commit 73f0c0db42327b5b2f7541ce72836e3196ba7496
Author: Batuhan Berk Başoğlu <batuhan@basoglu.ca>
Date:   Fri Oct 2 21:26:03 2020 -0400

    Created starter files for the project.

diff --git a/.idea/.gitignore b/.idea/.gitignore
new file mode 100644
index 000000000..26d33521a
--- /dev/null
+++ b/.idea/.gitignore
@@ -0,0 +1,3 @@
+# Default ignored files
+/shelf/
+/workspace.xml
diff --git a/.idea/Vehicle Anti-Theft Face Recognition System.iml b/.idea/Vehicle Anti-Theft Face Recognition System.iml
new file mode 100644
index 000000000..74d515a02
--- /dev/null
+++ b/.idea/Vehicle Anti-Theft Face Recognition System.iml	
@@ -0,0 +1,10 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="PYTHON_MODULE" version="4">
+  <component name="NewModuleRootManager">
+    <content url="file://$MODULE_DIR$">
+      <excludeFolder url="file://$MODULE_DIR$/venv" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>
\ No newline at end of file
diff --git a/.idea/inspectionProfiles/profiles_settings.xml b/.idea/inspectionProfiles/profiles_settings.xml
new file mode 100644
index 000000000..105ce2da2
--- /dev/null
+++ b/.idea/inspectionProfiles/profiles_settings.xml
@@ -0,0 +1,6 @@
+<component name="InspectionProjectProfileManager">
+  <settings>
+    <option name="USE_PROJECT_PROFILE" value="false" />
+    <version value="1.0" />
+  </settings>
+</component>
\ No newline at end of file
diff --git a/.idea/misc.xml b/.idea/misc.xml
new file mode 100644
index 000000000..230432abf
--- /dev/null
+++ b/.idea/misc.xml
@@ -0,0 +1,4 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectRootManager" version="2" project-jdk-name="Python 3.6 (Vehicle Anti-Theft Face Recognition System)" project-jdk-type="Python SDK" />
+</project>
\ No newline at end of file
diff --git a/.idea/modules.xml b/.idea/modules.xml
new file mode 100644
index 000000000..6a0411007
--- /dev/null
+++ b/.idea/modules.xml
@@ -0,0 +1,8 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="ProjectModuleManager">
+    <modules>
+      <module fileurl="file://$PROJECT_DIR$/.idea/Vehicle Anti-Theft Face Recognition System.iml" filepath="$PROJECT_DIR$/.idea/Vehicle Anti-Theft Face Recognition System.iml" />
+    </modules>
+  </component>
+</project>
\ No newline at end of file
diff --git a/.idea/vcs.xml b/.idea/vcs.xml
new file mode 100644
index 000000000..94a25f7f4
--- /dev/null
+++ b/.idea/vcs.xml
@@ -0,0 +1,6 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<project version="4">
+  <component name="VcsDirectoryMappings">
+    <mapping directory="$PROJECT_DIR$" vcs="Git" />
+  </component>
+</project>
\ No newline at end of file
diff --git a/Database.py b/Database.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/Facial_Recognition_Software.py b/Facial_Recognition_Software.py
new file mode 100644
index 000000000..a404c335c
--- /dev/null
+++ b/Facial_Recognition_Software.py
@@ -0,0 +1,18 @@
+
+
+# This is a sample Python script.
+
+# Press Shift+F10 to execute it or replace it with your code.
+# Press Double Shift to search everywhere for classes, files, tool windows, actions, and settings.
+
+
+def print_hi(name):
+    # Use a breakpoint in the code line below to debug your script.
+    print(f'Hi, {name}')  # Press Ctrl+F8 to toggle the breakpoint.
+
+
+# Press the green button in the gutter to run the script.
+if __name__ == '__main__':
+    print_hi('PyCharm')
+
+# See PyCharm help at https://www.jetbrains.com/help/pycharm/
diff --git a/User_Interface.py b/User_Interface.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/__pycache__/easy_install.cpython-36.pyc b/venv/Lib/site-packages/__pycache__/easy_install.cpython-36.pyc
new file mode 100644
index 000000000..8ffa71079
Binary files /dev/null and b/venv/Lib/site-packages/__pycache__/easy_install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/_distutils_hack/__init__.py b/venv/Lib/site-packages/_distutils_hack/__init__.py
new file mode 100644
index 000000000..c31edfed1
--- /dev/null
+++ b/venv/Lib/site-packages/_distutils_hack/__init__.py
@@ -0,0 +1,123 @@
+import sys
+import os
+import re
+import importlib
+import warnings
+
+
+is_pypy = '__pypy__' in sys.builtin_module_names
+
+
+def warn_distutils_present():
+    if 'distutils' not in sys.modules:
+        return
+    if is_pypy and sys.version_info < (3, 7):
+        # PyPy for 3.6 unconditionally imports distutils, so bypass the warning
+        # https://foss.heptapod.net/pypy/pypy/-/blob/be829135bc0d758997b3566062999ee8b23872b4/lib-python/3/site.py#L250
+        return
+    warnings.warn(
+        "Distutils was imported before Setuptools, but importing Setuptools "
+        "also replaces the `distutils` module in `sys.modules`. This may lead "
+        "to undesirable behaviors or errors. To avoid these issues, avoid "
+        "using distutils directly, ensure that setuptools is installed in the "
+        "traditional way (e.g. not an editable install), and/or make sure "
+        "that setuptools is always imported before distutils.")
+
+
+def clear_distutils():
+    if 'distutils' not in sys.modules:
+        return
+    warnings.warn("Setuptools is replacing distutils.")
+    mods = [name for name in sys.modules if re.match(r'distutils\b', name)]
+    for name in mods:
+        del sys.modules[name]
+
+
+def enabled():
+    """
+    Allow selection of distutils by environment variable.
+    """
+    which = os.environ.get('SETUPTOOLS_USE_DISTUTILS', 'stdlib')
+    return which == 'local'
+
+
+def ensure_local_distutils():
+    clear_distutils()
+    distutils = importlib.import_module('setuptools._distutils')
+    distutils.__name__ = 'distutils'
+    sys.modules['distutils'] = distutils
+
+    # sanity check that submodules load as expected
+    core = importlib.import_module('distutils.core')
+    assert '_distutils' in core.__file__, core.__file__
+
+
+def do_override():
+    """
+    Ensure that the local copy of distutils is preferred over stdlib.
+
+    See https://github.com/pypa/setuptools/issues/417#issuecomment-392298401
+    for more motivation.
+    """
+    if enabled():
+        warn_distutils_present()
+        ensure_local_distutils()
+
+
+class DistutilsMetaFinder:
+    def find_spec(self, fullname, path, target=None):
+        if path is not None:
+            return
+
+        method_name = 'spec_for_{fullname}'.format(**locals())
+        method = getattr(self, method_name, lambda: None)
+        return method()
+
+    def spec_for_distutils(self):
+        import importlib.abc
+        import importlib.util
+
+        class DistutilsLoader(importlib.abc.Loader):
+
+            def create_module(self, spec):
+                return importlib.import_module('setuptools._distutils')
+
+            def exec_module(self, module):
+                pass
+
+        return importlib.util.spec_from_loader('distutils', DistutilsLoader())
+
+    def spec_for_pip(self):
+        """
+        Ensure stdlib distutils when running under pip.
+        See pypa/pip#8761 for rationale.
+        """
+        if self.pip_imported_during_build():
+            return
+        clear_distutils()
+        self.spec_for_distutils = lambda: None
+
+    @staticmethod
+    def pip_imported_during_build():
+        """
+        Detect if pip is being imported in a build script. Ref #2355.
+        """
+        import traceback
+        return any(
+            frame.f_globals['__file__'].endswith('setup.py')
+            for frame, line in traceback.walk_stack(None)
+        )
+
+
+DISTUTILS_FINDER = DistutilsMetaFinder()
+
+
+def add_shim():
+    sys.meta_path.insert(0, DISTUTILS_FINDER)
+
+
+def remove_shim():
+    try:
+        sys.meta_path.remove(DISTUTILS_FINDER)
+    except ValueError:
+        pass
diff --git a/venv/Lib/site-packages/_distutils_hack/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/_distutils_hack/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..6a5c75280
Binary files /dev/null and b/venv/Lib/site-packages/_distutils_hack/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/_distutils_hack/__pycache__/override.cpython-36.pyc b/venv/Lib/site-packages/_distutils_hack/__pycache__/override.cpython-36.pyc
new file mode 100644
index 000000000..b90544b39
Binary files /dev/null and b/venv/Lib/site-packages/_distutils_hack/__pycache__/override.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/_distutils_hack/override.py b/venv/Lib/site-packages/_distutils_hack/override.py
new file mode 100644
index 000000000..2cc433a4a
--- /dev/null
+++ b/venv/Lib/site-packages/_distutils_hack/override.py
@@ -0,0 +1 @@
+__import__('_distutils_hack').do_override()
diff --git a/venv/Lib/site-packages/cv2/LICENSE-3RD-PARTY.txt b/venv/Lib/site-packages/cv2/LICENSE-3RD-PARTY.txt
new file mode 100644
index 000000000..60c34bc06
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/LICENSE-3RD-PARTY.txt
@@ -0,0 +1,2278 @@
+OpenCV library is redistributed within opencv-python package.
+This license applies to OpenCV binary in the directory cv2/.
+
+By downloading, copying, installing or using the software you agree to this license.
+If you do not agree to this license, do not download, install,
+copy or use the software.
+
+
+                          License Agreement
+               For Open Source Computer Vision Library
+                       (3-clause BSD License)
+
+Copyright (C) 2000-2020, Intel Corporation, all rights reserved.
+Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved.
+Copyright (C) 2009-2016, NVIDIA Corporation, all rights reserved.
+Copyright (C) 2010-2013, Advanced Micro Devices, Inc., all rights reserved.
+Copyright (C) 2015-2016, OpenCV Foundation, all rights reserved.
+Copyright (C) 2015-2016, Itseez Inc., all rights reserved.
+Copyright (C) 2019-2020, Xperience AI, all rights reserved.
+Third party copyrights are property of their respective owners.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright notice,
+    this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright notice,
+    this list of conditions and the following disclaimer in the documentation
+    and/or other materials provided with the distribution.
+
+  * Neither the names of the copyright holders nor the names of the contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+This software is provided by the copyright holders and contributors "as is" and
+any express or implied warranties, including, but not limited to, the implied
+warranties of merchantability and fitness for a particular purpose are disclaimed.
+In no event shall copyright holders or contributors be liable for any direct,
+indirect, incidental, special, exemplary, or consequential damages
+(including, but not limited to, procurement of substitute goods or services;
+loss of use, data, or profits; or business interruption) however caused
+and on any theory of liability, whether in contract, strict liability,
+or tort (including negligence or otherwise) arising in any way out of
+the use of this software, even if advised of the possibility of such damage.
+
+------------------------------------------------------------------------------
+libvpx is redistributed within all opencv-python Linux packages.
+This license applies to libvpx binary in the directory cv2/.
+
+Copyright (c) 2010, The WebM Project authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.
+
+  * Neither the name of Google, nor the WebM Project, nor the names
+    of its contributors may be used to endorse or promote products
+    derived from this software without specific prior written
+    permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+FFmpeg is redistributed within all opencv-python packages.
+
+Libbluray, libgnutls, libnettle, libhogweed, libintl, libmp3lame, libp11,
+librtmp, libsoxr and libtasn1 are redistributed within all opencv-python macOS packages.
+
+This license applies to the above library binaries in the directory cv2/.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+------------------------------------------------------------------------------
+Qt 5 is redistributed within non-headless opencv-python Linux and macOS packages.
+libgmp is redistributed within opencv-python macOS packages.
+libidn2 is redistributed within opencv-python macOS packages.
+libunistring is redistributed within opencv-python macOS packages.
+This license applies to the above binaries in the directory cv2/.
+
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
+
+------------------------------------------------------------------------------
+bzip2 is redistributed within all opencv-python Linux packages.
+This license applies to libbz2 binary in the directory cv2/.
+
+This program, "bzip2", the associated library "libbzip2", and all
+documentation, are copyright (C) 1996-2010 Julian R Seward.  All
+rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. The origin of this software must not be misrepresented; you must 
+   not claim that you wrote the original software.  If you use this 
+   software in a product, an acknowledgment in the product 
+   documentation would be appreciated but is not required.
+
+3. Altered source versions must be plainly marked as such, and must
+   not be misrepresented as being the original software.
+
+4. The name of the author may not be used to endorse or promote 
+   products derived from this software without specific prior written 
+   permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Julian Seward, jseward@bzip.org
+bzip2/libbzip2 version 1.0.6 of 6 September 2010
+
+------------------------------------------------------------------------------
+libcrypto and libssl are redistributed within all opencv-python Linux and macOS packages.
+libopencore-amrnb and libopencore-amrwb are redistributed within all opencv-python Linux and macOS packages.
+This license applies to above binaries in the directory cv2/.
+
+  LICENSE ISSUES
+  ==============
+
+  The OpenSSL toolkit stays under a double license, i.e. both the conditions of
+  the OpenSSL License and the original SSLeay license apply to the toolkit.
+  See below for the actual license texts.
+
+  OpenSSL License
+  ---------------
+
+/* ====================================================================
+ * Copyright (c) 1998-2019 The OpenSSL Project.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ *
+ * 3. All advertising materials mentioning features or use of this
+ *    software must display the following acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
+ *
+ * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
+ *    endorse or promote products derived from this software without
+ *    prior written permission. For written permission, please contact
+ *    openssl-core@openssl.org.
+ *
+ * 5. Products derived from this software may not be called "OpenSSL"
+ *    nor may "OpenSSL" appear in their names without prior written
+ *    permission of the OpenSSL Project.
+ *
+ * 6. Redistributions of any form whatsoever must retain the following
+ *    acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
+ * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
+ * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ * ====================================================================
+ *
+ * This product includes cryptographic software written by Eric Young
+ * (eay@cryptsoft.com).  This product includes software written by Tim
+ * Hudson (tjh@cryptsoft.com).
+ *
+ */
+
+ Original SSLeay License
+ -----------------------
+
+/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
+ * All rights reserved.
+ *
+ * This package is an SSL implementation written
+ * by Eric Young (eay@cryptsoft.com).
+ * The implementation was written so as to conform with Netscapes SSL.
+ *
+ * This library is free for commercial and non-commercial use as long as
+ * the following conditions are aheared to.  The following conditions
+ * apply to all code found in this distribution, be it the RC4, RSA,
+ * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
+ * included with this distribution is covered by the same copyright terms
+ * except that the holder is Tim Hudson (tjh@cryptsoft.com).
+ *
+ * Copyright remains Eric Young's, and as such any Copyright notices in
+ * the code are not to be removed.
+ * If this package is used in a product, Eric Young should be given attribution
+ * as the author of the parts of the library used.
+ * This can be in the form of a textual message at program startup or
+ * in documentation (online or textual) provided with the package.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *    "This product includes cryptographic software written by
+ *     Eric Young (eay@cryptsoft.com)"
+ *    The word 'cryptographic' can be left out if the rouines from the library
+ *    being used are not cryptographic related :-).
+ * 4. If you include any Windows specific code (or a derivative thereof) from
+ *    the apps directory (application code) you must include an acknowledgement:
+ *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * The licence and distribution terms for any publically available version or
+ * derivative of this code cannot be changed.  i.e. this code cannot simply be
+ * copied and put under another distribution licence
+ * [including the GNU Public Licence.]
+ */
+
+------------------------------------------------------------------------------
+libfontconfig is redistributed within all opencv-python macOS packages.
+This license applies to libfontconfig binary in the directory cv2/.
+
+Copyright © 2000,2001,2002,2003,2004,2006,2007 Keith Packard
+Copyright © 2005 Patrick Lam
+Copyright © 2009 Roozbeh Pournader
+Copyright © 2008,2009 Red Hat, Inc.
+Copyright © 2008 Danilo Šegan
+Copyright © 2012 Google, Inc.
+
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation, and that the name of the author(s) not be used in
+advertising or publicity pertaining to distribution of the software without
+specific, written prior permission.  The authors make no
+representations about the suitability of this software for any purpose.  It
+is provided "as is" without express or implied warranty.
+
+THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
+EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
+------------------------------------------------------------------------------
+libfreetype is redistributed within opencv-python Linux and macOS packages.
+This license applies to libfreetype binary in the directory cv2/.
+
+                    The FreeType Project LICENSE
+                    ----------------------------
+
+                            2006-Jan-27
+
+                    Copyright 1996-2002, 2006 by
+          David Turner, Robert Wilhelm, and Werner Lemberg
+
+
+
+Introduction
+============
+
+  The FreeType  Project is distributed in  several archive packages;
+  some of them may contain, in addition to the FreeType font engine,
+  various tools and  contributions which rely on, or  relate to, the
+  FreeType Project.
+
+  This  license applies  to all  files found  in such  packages, and
+  which do not  fall under their own explicit  license.  The license
+  affects  thus  the  FreeType   font  engine,  the  test  programs,
+  documentation and makefiles, at the very least.
+
+  This  license   was  inspired  by  the  BSD,   Artistic,  and  IJG
+  (Independent JPEG  Group) licenses, which  all encourage inclusion
+  and  use of  free  software in  commercial  and freeware  products
+  alike.  As a consequence, its main points are that:
+
+    o We don't promise that this software works. However, we will be
+      interested in any kind of bug reports. (`as is' distribution)
+
+    o You can  use this software for whatever you  want, in parts or
+      full form, without having to pay us. (`royalty-free' usage)
+
+    o You may not pretend that  you wrote this software.  If you use
+      it, or  only parts of it,  in a program,  you must acknowledge
+      somewhere  in  your  documentation  that  you  have  used  the
+      FreeType code. (`credits')
+
+  We  specifically  permit  and  encourage  the  inclusion  of  this
+  software, with  or without modifications,  in commercial products.
+  We  disclaim  all warranties  covering  The  FreeType Project  and
+  assume no liability related to The FreeType Project.
+
+
+  Finally,  many  people  asked  us  for  a  preferred  form  for  a
+  credit/disclaimer to use in compliance with this license.  We thus
+  encourage you to use the following text:
+
+   """
+    Portions of this software are copyright © <year> The FreeType
+    Project (www.freetype.org).  All rights reserved.
+   """
+
+  Please replace <year> with the value from the FreeType version you
+  actually use.
+
+
+Legal Terms
+===========
+
+0. Definitions
+--------------
+
+  Throughout this license,  the terms `package', `FreeType Project',
+  and  `FreeType  archive' refer  to  the  set  of files  originally
+  distributed  by the  authors  (David Turner,  Robert Wilhelm,  and
+  Werner Lemberg) as the `FreeType Project', be they named as alpha,
+  beta or final release.
+
+  `You' refers to  the licensee, or person using  the project, where
+  `using' is a generic term including compiling the project's source
+  code as  well as linking it  to form a  `program' or `executable'.
+  This  program is  referred to  as  `a program  using the  FreeType
+  engine'.
+
+  This  license applies  to all  files distributed  in  the original
+  FreeType  Project,   including  all  source   code,  binaries  and
+  documentation,  unless  otherwise  stated   in  the  file  in  its
+  original, unmodified form as  distributed in the original archive.
+  If you are  unsure whether or not a particular  file is covered by
+  this license, you must contact us to verify this.
+
+  The FreeType  Project is copyright (C) 1996-2000  by David Turner,
+  Robert Wilhelm, and Werner Lemberg.  All rights reserved except as
+  specified below.
+
+1. No Warranty
+--------------
+
+  THE FREETYPE PROJECT  IS PROVIDED `AS IS' WITHOUT  WARRANTY OF ANY
+  KIND, EITHER  EXPRESS OR IMPLIED,  INCLUDING, BUT NOT  LIMITED TO,
+  WARRANTIES  OF  MERCHANTABILITY   AND  FITNESS  FOR  A  PARTICULAR
+  PURPOSE.  IN NO EVENT WILL ANY OF THE AUTHORS OR COPYRIGHT HOLDERS
+  BE LIABLE  FOR ANY DAMAGES CAUSED  BY THE USE OR  THE INABILITY TO
+  USE, OF THE FREETYPE PROJECT.
+
+2. Redistribution
+-----------------
+
+  This  license  grants  a  worldwide, royalty-free,  perpetual  and
+  irrevocable right  and license to use,  execute, perform, compile,
+  display,  copy,   create  derivative  works   of,  distribute  and
+  sublicense the  FreeType Project (in  both source and  object code
+  forms)  and  derivative works  thereof  for  any  purpose; and  to
+  authorize others  to exercise  some or all  of the  rights granted
+  herein, subject to the following conditions:
+
+    o Redistribution of  source code  must retain this  license file
+      (`FTL.TXT') unaltered; any  additions, deletions or changes to
+      the original  files must be clearly  indicated in accompanying
+      documentation.   The  copyright   notices  of  the  unaltered,
+      original  files must  be  preserved in  all  copies of  source
+      files.
+
+    o Redistribution in binary form must provide a  disclaimer  that
+      states  that  the software is based in part of the work of the
+      FreeType Team,  in  the  distribution  documentation.  We also
+      encourage you to put an URL to the FreeType web page  in  your
+      documentation, though this isn't mandatory.
+
+  These conditions  apply to any  software derived from or  based on
+  the FreeType Project,  not just the unmodified files.   If you use
+  our work, you  must acknowledge us.  However, no  fee need be paid
+  to us.
+
+3. Advertising
+--------------
+
+  Neither the  FreeType authors and  contributors nor you  shall use
+  the name of the  other for commercial, advertising, or promotional
+  purposes without specific prior written permission.
+
+  We suggest,  but do not require, that  you use one or  more of the
+  following phrases to refer  to this software in your documentation
+  or advertising  materials: `FreeType Project',  `FreeType Engine',
+  `FreeType library', or `FreeType Distribution'.
+
+  As  you have  not signed  this license,  you are  not  required to
+  accept  it.   However,  as  the FreeType  Project  is  copyrighted
+  material, only  this license, or  another one contracted  with the
+  authors, grants you  the right to use, distribute,  and modify it.
+  Therefore,  by  using,  distributing,  or modifying  the  FreeType
+  Project, you indicate that you understand and accept all the terms
+  of this license.
+
+4. Contacts
+-----------
+
+  There are two mailing lists related to FreeType:
+
+    o freetype@nongnu.org
+
+      Discusses general use and applications of FreeType, as well as
+      future and  wanted additions to the  library and distribution.
+      If  you are looking  for support,  start in  this list  if you
+      haven't found anything to help you in the documentation.
+
+    o freetype-devel@nongnu.org
+
+      Discusses bugs,  as well  as engine internals,  design issues,
+      specific licenses, porting, etc.
+
+  Our home page can be found at
+
+    https://www.freetype.org
+
+------------------------------------------------------------------------------
+libpng is redistributed within all opencv-python Linux and macOS packages.
+This license applies to libpng binary in the directory cv2/.
+
+PNG Reference Library License version 2
+---------------------------------------
+
+ * Copyright (c) 1995-2019 The PNG Reference Library Authors.
+ * Copyright (c) 2018-2019 Cosmin Truta.
+ * Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson.
+ * Copyright (c) 1996-1997 Andreas Dilger.
+ * Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
+
+The software is supplied "as is", without warranty of any kind,
+express or implied, including, without limitation, the warranties
+of merchantability, fitness for a particular purpose, title, and
+non-infringement.  In no event shall the Copyright owners, or
+anyone distributing the software, be liable for any damages or
+other liability, whether in contract, tort or otherwise, arising
+from, out of, or in connection with the software, or the use or
+other dealings in the software, even if advised of the possibility
+of such damage.
+
+Permission is hereby granted to use, copy, modify, and distribute
+this software, or portions hereof, for any purpose, without fee,
+subject to the following restrictions:
+
+ 1. The origin of this software must not be misrepresented; you
+    must not claim that you wrote the original software.  If you
+    use this software in a product, an acknowledgment in the product
+    documentation would be appreciated, but is not required.
+
+ 2. Altered source versions must be plainly marked as such, and must
+    not be misrepresented as being the original software.
+
+ 3. This Copyright notice may not be removed or altered from any
+    source or altered source distribution.
+
+
+PNG Reference Library License version 1 (for libpng 0.5 through 1.6.35)
+-----------------------------------------------------------------------
+
+libpng versions 1.0.7, July 1, 2000, through 1.6.35, July 15, 2018 are
+Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson, are
+derived from libpng-1.0.6, and are distributed according to the same
+disclaimer and license as libpng-1.0.6 with the following individuals
+added to the list of Contributing Authors:
+
+    Simon-Pierre Cadieux
+    Eric S. Raymond
+    Mans Rullgard
+    Cosmin Truta
+    Gilles Vollant
+    James Yu
+    Mandar Sahastrabuddhe
+    Google Inc.
+    Vadim Barkov
+
+and with the following additions to the disclaimer:
+
+    There is no warranty against interference with your enjoyment of
+    the library or against infringement.  There is no warranty that our
+    efforts or the library will fulfill any of your particular purposes
+    or needs.  This library is provided with all faults, and the entire
+    risk of satisfactory quality, performance, accuracy, and effort is
+    with the user.
+
+Some files in the "contrib" directory and some configure-generated
+files that are distributed with libpng have other copyright owners, and
+are released under other open source licenses.
+
+libpng versions 0.97, January 1998, through 1.0.6, March 20, 2000, are
+Copyright (c) 1998-2000 Glenn Randers-Pehrson, are derived from
+libpng-0.96, and are distributed according to the same disclaimer and
+license as libpng-0.96, with the following individuals added to the
+list of Contributing Authors:
+
+    Tom Lane
+    Glenn Randers-Pehrson
+    Willem van Schaik
+
+libpng versions 0.89, June 1996, through 0.96, May 1997, are
+Copyright (c) 1996-1997 Andreas Dilger, are derived from libpng-0.88,
+and are distributed according to the same disclaimer and license as
+libpng-0.88, with the following individuals added to the list of
+Contributing Authors:
+
+    John Bowler
+    Kevin Bracey
+    Sam Bushell
+    Magnus Holmgren
+    Greg Roelofs
+    Tom Tanner
+
+Some files in the "scripts" directory have other copyright owners,
+but are released under this license.
+
+libpng versions 0.5, May 1995, through 0.88, January 1996, are
+Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
+
+For the purposes of this copyright and license, "Contributing Authors"
+is defined as the following set of individuals:
+
+    Andreas Dilger
+    Dave Martindale
+    Guy Eric Schalnat
+    Paul Schmidt
+    Tim Wegner
+
+The PNG Reference Library is supplied "AS IS".  The Contributing
+Authors and Group 42, Inc. disclaim all warranties, expressed or
+implied, including, without limitation, the warranties of
+merchantability and of fitness for any purpose.  The Contributing
+Authors and Group 42, Inc. assume no liability for direct, indirect,
+incidental, special, exemplary, or consequential damages, which may
+result from the use of the PNG Reference Library, even if advised of
+the possibility of such damage.
+
+Permission is hereby granted to use, copy, modify, and distribute this
+source code, or portions hereof, for any purpose, without fee, subject
+to the following restrictions:
+
+ 1. The origin of this source code must not be misrepresented.
+
+ 2. Altered versions must be plainly marked as such and must not
+    be misrepresented as being the original source.
+
+ 3. This Copyright notice may not be removed or altered from any
+    source or altered source distribution.
+
+The Contributing Authors and Group 42, Inc. specifically permit,
+without fee, and encourage the use of this source code as a component
+to supporting the PNG file format in commercial products.  If you use
+this source code in a product, acknowledgment is not required but would
+be appreciated.
+
+------------------------------------------------------------------------------
+libz is redistributed within all opencv-python Linux packages.
+This license applies to libz binary in the directory cv2/.
+
+  Copyright (C) 1995-2017 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
+
+------------------------------------------------------------------------------
+libdav1d is redistributed within opencv-python macOS packages.
+This license applies to libdav1d binary in the directory cv2/.
+
+Copyright © 2018-2019, VideoLAN and dav1d authors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libffi is redistributed within opencv-python macOS packages.
+This license applies to libffi binary in the directory cv2/.
+
+libffi - Copyright (c) 1996-2020  Anthony Green, Red Hat, Inc and others.
+See source files for details.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+``Software''), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+------------------------------------------------------------------------------
+libogg is redistributed within opencv-python macOS packages.
+This license applies to libogg binary in the directory cv2/.
+
+Copyright (c) 2002, Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libopenjp2 is redistributed within opencv-python macOS packages.
+This license applies to libopenjp2 binary in the directory cv2/.
+
+The copyright in this software is being made available under the 2-clauses 
+BSD License, included below. This software may be subject to other third 
+party and contributor rights, including patent rights, and no such rights
+are granted under this license.
+
+Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
+Copyright (c) 2002-2014, Professor Benoit Macq
+Copyright (c) 2003-2014, Antonin Descampe
+Copyright (c) 2003-2009, Francois-Olivier Devaux
+Copyright (c) 2005, Herve Drolon, FreeImage Team
+Copyright (c) 2002-2003, Yannick Verschueren
+Copyright (c) 2001-2003, David Janssens
+Copyright (c) 2011-2012, Centre National d'Etudes Spatiales (CNES), France 
+Copyright (c) 2012, CS Systemes d'Information, France
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libopus is redistributed within opencv-python macOS packages.
+This license applies to libopus binary in the directory cv2/.
+
+Copyright 2001-2011 Xiph.Org, Skype Limited, Octasic,
+                    Jean-Marc Valin, Timothy B. Terriberry,
+                    CSIRO, Gregory Maxwell, Mark Borgerding,
+                    Erik de Castro Lopo
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of Internet Society, IETF or IETF Trust, nor the
+names of specific contributors, may be used to endorse or promote
+products derived from this software without specific prior written
+permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Opus is subject to the royalty-free patent licenses which are
+specified at:
+
+Xiph.Org Foundation:
+https://datatracker.ietf.org/ipr/1524/
+
+Microsoft Corporation:
+https://datatracker.ietf.org/ipr/1914/
+
+Broadcom Corporation:
+https://datatracker.ietf.org/ipr/1526/
+
+------------------------------------------------------------------------------
+librav1e is redistributed within opencv-python macOS packages.
+This license applies to librav1e binary in the directory cv2/.
+
+BSD 2-Clause License
+
+Copyright (c) 2017-2020, the rav1e contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libsnappy is redistributed within opencv-python macOS packages.
+This license applies to libsnappy binary in the directory cv2/.
+
+Copyright 2011, Google Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+    * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libspeex is redistributed within opencv-python macOS packages.
+This license applies to libspeex binary in the directory cv2/.
+
+Copyright 2002-2008   Xiph.org Foundation
+Copyright 2002-2008   Jean-Marc Valin
+Copyright 2005-2007 Analog Devices Inc.
+Copyright 2005-2008 Commonwealth Scientific and Industrial Research 
+                        Organisation (CSIRO)
+Copyright 1993, 2002, 2006 David Rowe
+Copyright 2003    EpicGames
+Copyright 1992-1994 Jutta Degener, Carsten Bormann
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR
+CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libsrt is redistributed within opencv-python macOS packages.
+This license applies to libsrt binary in the directory cv2/.
+
+/*
+ *  
+ * Copyright (c) 2001-2017 Cisco Systems, Inc.
+ * All rights reserved.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 
+ *   Redistributions of source code must retain the above copyright
+ *   notice, this list of conditions and the following disclaimer.
+ * 
+ *   Redistributions in binary form must reproduce the above
+ *   copyright notice, this list of conditions and the following
+ *   disclaimer in the documentation and/or other materials provided
+ *   with the distribution.
+ * 
+ *   Neither the name of the Cisco Systems, Inc. nor the names of its
+ *   contributors may be used to endorse or promote products derived
+ *   from this software without specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+ * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ */
+
+
+ Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in 
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  This Source Code Form is subject to the terms of the Mozilla Public
+  License, v. 2.0. If a copy of the MPL was not distributed with this
+  file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.
+
+------------------------------------------------------------------------------
+libtheoradec and libtheoraenc are redistributed within opencv-python macOS packages.
+This license applies to libtheoradec and libtheoraenc binaries in the directory cv2/.
+
+  Copyright (C) 2002-2009 Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libwebp and libwebpmux are redistributed within opencv-python macOS packages.
+This license applies to libwebp  and libwebpmux binaries in the directory cv2/.
+
+Copyright (c) 2010, Google Inc. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.
+
+  * Neither the name of Google nor the names of its contributors may
+    be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libvorbis and libvorbisenc are redistributed within opencv-python macOS packages.
+This license applies to libvorbis and libvorbisenc binaries in the directory cv2/.
+
+Copyright (c) 2002-2020 Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+Libxcb utility libraries are redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb related binaries in the directory cv2/.
+
+Copyright (C) 2001-2006 Bart Massey, Jamey Sharp, and Josh Triplett.
+All Rights Reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute,
+sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall
+be included in all copies or substantial portions of the
+Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
+KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
+WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
+PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS
+BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors
+or their institutions shall not be used in advertising or
+otherwise to promote the sale, use or other dealings in this
+Software without prior written authorization from the
+authors.
+
+------------------------------------------------------------------------------
+Libxcb-image is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-image binary in the directory cv2/.
+
+Copyright © 2007-2008 Bart Massey <bart@cs.pdx.edu>
+Copyright © 2008 Julien Danjou <julien@danjou.info>
+Copyright © 2008 Keith Packard <keithp@keithp.com>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use, copy,
+modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or
+their institutions shall not be used in advertising or otherwise to
+promote the sale, use or other dealings in this Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-util is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-util binary in the directory cv2/.
+
+Copyright © 2008 Bart Massey <bart@cs.pdx.edu>
+Copyright © 2008 Ian Osgood <iano@quirkster.com>
+Copyright © 2008 Jamey Sharp <jamey@minilop.net>
+Copyright © 2008 Josh Triplett <josh@freedesktop.org>
+Copyright © 2008-2009 Julien Danjou <julien@danjou.info>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use, copy,
+modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or
+their institutions shall not be used in advertising or otherwise to
+promote the sale, use or other dealings in this Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-render-util is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-render-util binary in the directory cv2/.
+
+Copyright © 2000 Keith Packard
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation, and that the name of Keith Packard not be used in
+advertising or publicity pertaining to distribution of the software without
+specific, written prior permission.  Keith Packard makes no
+representations about the suitability of this software for any purpose.  It
+is provided "as is" without express or implied warranty.
+
+KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
+EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
+Copyright © 2006 Jamey Sharp.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or their
+institutions shall not be used in advertising or otherwise to promote the
+sale, use or other dealings in this Software without prior written
+authorization from the authors.
+
+Copyright © 2006 Ian Osgood
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or their
+institutions shall not be used in advertising or otherwise to promote the
+sale, use or other dealings in this Software without prior written
+authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-icccm is redistributed within opencv-python non-headless Linux packages.
+This license applies to Libxcb-icccm binary in the directory cv2/.
+
+Copyright © 2008-2011 Arnaud Fontaine <arnau@debian.org>
+Copyright © 2007-2008 Vincent Torri <vtorri@univ-evry.fr>
+
+Permission  is  hereby  granted,  free  of charge,  to  any  person
+obtaining  a copy  of  this software  and associated  documentation
+files   (the  "Software"),   to  deal   in  the   Software  without
+restriction, including without limitation  the rights to use, copy,
+modify, merge, publish,  distribute, sublicense, and/or sell copies
+of  the Software, and  to permit  persons to  whom the  Software is
+furnished to do so, subject to the following conditions:
+
+The  above copyright  notice and  this permission  notice  shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE  IS PROVIDED  "AS IS", WITHOUT  WARRANTY OF  ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT  NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY,   FITNESS    FOR   A   PARTICULAR    PURPOSE   AND
+NONINFRINGEMENT. IN  NO EVENT SHALL  THE AUTHORS BE LIABLE  FOR ANY
+CLAIM,  DAMAGES  OR  OTHER  LIABILITY,  WHETHER  IN  AN  ACTION  OF
+CONTRACT, TORT OR OTHERWISE, ARISING  FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as  contained in  this notice, the  names of the  authors or
+their institutions shall not be used in advertising or otherwise to
+promote the  sale, use or  other dealings in this  Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+libXau is redistributed within opencv-python non-headless Linux packages.
+This license applies to libXau binary in the directory cv2/.
+
+Copyright 1988, 1993, 1994, 1998  The Open Group
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation.
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the name of The Open Group shall not be
+used in advertising or otherwise to promote the sale, use or other dealings
+in this Software without prior written authorization from The Open Group.
\ No newline at end of file
diff --git a/venv/Lib/site-packages/cv2/LICENSE.txt b/venv/Lib/site-packages/cv2/LICENSE.txt
new file mode 100644
index 000000000..328bf5063
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/LICENSE.txt
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Olli-Pekka Heinisuo
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/venv/Lib/site-packages/cv2/__init__.py b/venv/Lib/site-packages/cv2/__init__.py
new file mode 100644
index 000000000..d665b75ca
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/__init__.py
@@ -0,0 +1,33 @@
+import importlib
+import os
+import sys
+
+from .cv2 import *
+from .data import *
+
+# wildcard import above does not import "private" variables like __version__
+# this makes them available
+globals().update(importlib.import_module("cv2.cv2").__dict__)
+
+ci_and_not_headless = False
+
+try:
+    from .version import ci_build, headless
+
+    ci_and_not_headless = ci_build and not headless
+except:
+    pass
+
+# the Qt plugin is included currently only in the pre-built wheels
+if (
+    sys.platform == "darwin" or sys.platform.startswith("linux")
+) and ci_and_not_headless:
+    os.environ["QT_QPA_PLATFORM_PLUGIN_PATH"] = os.path.join(
+        os.path.dirname(os.path.abspath(__file__)), "qt", "plugins"
+    )
+
+# Qt will throw warning on Linux if fonts are not found
+if sys.platform.startswith("linux") and ci_and_not_headless:
+    os.environ["QT_QPA_FONTDIR"] = os.path.join(
+        os.path.dirname(os.path.abspath(__file__)), "qt", "fonts"
+    )
diff --git a/venv/Lib/site-packages/cv2/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/cv2/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..8e11c9910
Binary files /dev/null and b/venv/Lib/site-packages/cv2/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/cv2/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/cv2/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..c952e69fa
Binary files /dev/null and b/venv/Lib/site-packages/cv2/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/cv2/cv2.cp36-win32.pyd b/venv/Lib/site-packages/cv2/cv2.cp36-win32.pyd
new file mode 100644
index 000000000..93ec1f13f
Binary files /dev/null and b/venv/Lib/site-packages/cv2/cv2.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/cv2/data/__init__.py b/venv/Lib/site-packages/cv2/data/__init__.py
new file mode 100644
index 000000000..1cad2750a
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/__init__.py
@@ -0,0 +1,3 @@
+import os
+
+haarcascades = os.path.join(os.path.dirname(__file__), "")
diff --git a/venv/Lib/site-packages/cv2/data/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/cv2/data/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..f50477048
Binary files /dev/null and b/venv/Lib/site-packages/cv2/data/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_eye.xml b/venv/Lib/site-packages/cv2/data/haarcascade_eye.xml
new file mode 100644
index 000000000..b21e3b93d
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_eye.xml
@@ -0,0 +1,12213 @@
+<?xml version="1.0"?>
+<!--
+    Stump-based 20x20 frontal eye detector.
+    Created by Shameem Hameed (http://umich.edu/~shameem)
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>93</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>24</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>6</maxWeakCount>
+      <stageThreshold>-1.4562760591506958e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 1.2963959574699402e-01</internalNodes>
+          <leafValues>
+            -7.7304208278656006e-01 6.8350148200988770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -4.6326808631420135e-02</internalNodes>
+          <leafValues>
+            5.7352751493453979e-01 -4.9097689986228943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -1.6173090785741806e-02</internalNodes>
+          <leafValues>
+            6.0254341363906860e-01 -3.1610709428787231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 -4.5828841626644135e-02</internalNodes>
+          <leafValues>
+            6.4177548885345459e-01 -1.5545040369033813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 -5.3759619593620300e-02</internalNodes>
+          <leafValues>
+            5.4219317436218262e-01 -2.0480829477310181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 3.4171190112829208e-02</internalNodes>
+          <leafValues>
+            -2.3388190567493439e-01 4.8410901427268982e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.2550230026245117e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 6 -2.1727620065212250e-01</internalNodes>
+          <leafValues>
+            7.1098899841308594e-01 -5.9360730648040771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.2071969918906689e-02</internalNodes>
+          <leafValues>
+            -2.8240481019020081e-01 5.9013551473617554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 -1.7854139208793640e-02</internalNodes>
+          <leafValues>
+            5.3137522935867310e-01 -2.2758960723876953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 2.2333610802888870e-02</internalNodes>
+          <leafValues>
+            -1.7556099593639374e-01 6.3356137275695801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 -9.1420017182826996e-02</internalNodes>
+          <leafValues>
+            6.1563092470169067e-01 -1.6899530589580536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 2.8973650187253952e-02</internalNodes>
+          <leafValues>
+            -1.2250079959630966e-01 7.4401170015335083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 7.8203463926911354e-03</internalNodes>
+          <leafValues>
+            1.6974370181560516e-01 -6.5441650152206421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 2.0340489223599434e-02</internalNodes>
+          <leafValues>
+            -1.2556649744510651e-01 8.2710450887680054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -1.1926149949431419e-02</internalNodes>
+          <leafValues>
+            3.8605681061744690e-01 -2.0992340147495270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -9.7281101625412703e-04</internalNodes>
+          <leafValues>
+            -6.3761192560195923e-01 1.2952390313148499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 1.8322050891583785e-05</internalNodes>
+          <leafValues>
+            -3.4631478786468506e-01 2.2924269735813141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -8.0854417756199837e-03</internalNodes>
+          <leafValues>
+            -6.3665801286697388e-01 1.3078659772872925e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.3728189468383789e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 18 -1.1812269687652588e-01</internalNodes>
+          <leafValues>
+            6.7844521999359131e-01 -5.0045782327651978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -3.4332759678363800e-02</internalNodes>
+          <leafValues>
+            6.7186361551284790e-01 -3.5744878649711609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 -2.1530799567699432e-02</internalNodes>
+          <leafValues>
+            7.2220700979232788e-01 -1.8192419409751892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -2.1909970790147781e-02</internalNodes>
+          <leafValues>
+            6.6529387235641479e-01 -2.7510228753089905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -2.8713539242744446e-02</internalNodes>
+          <leafValues>
+            6.9955700635910034e-01 -1.9615580141544342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -1.1467480100691319e-02</internalNodes>
+          <leafValues>
+            5.9267348051071167e-01 -2.2097350656986237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 -2.2611169144511223e-02</internalNodes>
+          <leafValues>
+            3.4483069181442261e-01 -3.8379558920860291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -1.9308089977130294e-03</internalNodes>
+          <leafValues>
+            -7.9445719718933105e-01 1.5628659725189209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 5.6419910833938047e-05</internalNodes>
+          <leafValues>
+            -3.0896010994911194e-01 3.5431089997291565e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-1.2879480123519897e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 27 1.9886520504951477e-01</internalNodes>
+          <leafValues>
+            -5.2860701084136963e-01 3.5536721348762512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -3.6008939146995544e-02</internalNodes>
+          <leafValues>
+            4.2109689116477966e-01 -3.9348980784416199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -7.7569849789142609e-02</internalNodes>
+          <leafValues>
+            4.7991541028022766e-01 -2.5122168660163879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 8.2630853285081685e-05</internalNodes>
+          <leafValues>
+            -3.8475489616394043e-01 3.1849220395088196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 3.2773229759186506e-04</internalNodes>
+          <leafValues>
+            -2.6427319645881653e-01 3.2547241449356079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -1.8574850633740425e-02</internalNodes>
+          <leafValues>
+            4.6736589074134827e-01 -1.5067270398139954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -7.0008762122597545e-05</internalNodes>
+          <leafValues>
+            2.9313150048255920e-01 -2.5365099310874939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -1.8552130088210106e-02</internalNodes>
+          <leafValues>
+            4.6273660659790039e-01 -1.3148050010204315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -1.3030420057475567e-02</internalNodes>
+          <leafValues>
+            4.1627219319343567e-01 -1.7751489579677582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 6.5694141085259616e-05</internalNodes>
+          <leafValues>
+            -2.8035101294517517e-01 2.6680740714073181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 1.7005260451696813e-04</internalNodes>
+          <leafValues>
+            -2.7027249336242676e-01 2.3981650173664093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -3.3129199873656034e-03</internalNodes>
+          <leafValues>
+            4.4411438703536987e-01 -1.4428889751434326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 1.7583490116521716e-03</internalNodes>
+          <leafValues>
+            -1.6126190125942230e-01 4.2940768599510193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -2.5194749236106873e-02</internalNodes>
+          <leafValues>
+            4.0687298774719238e-01 -1.8202580511569977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 1.4031709870323539e-03</internalNodes>
+          <leafValues>
+            8.4759786725044250e-02 -8.0018568038940430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -7.3991729877889156e-03</internalNodes>
+          <leafValues>
+            5.5766099691390991e-01 -1.1843159794807434e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.2179850339889526e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 43 -2.9943080618977547e-02</internalNodes>
+          <leafValues>
+            3.5810810327529907e-01 -3.8487631082534790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -1.2567380070686340e-01</internalNodes>
+          <leafValues>
+            3.9316931366920471e-01 -3.0012258887290955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 5.3635272197425365e-03</internalNodes>
+          <leafValues>
+            -4.3908619880676270e-01 1.9257010519504547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -8.0971820279955864e-03</internalNodes>
+          <leafValues>
+            3.9906668663024902e-01 -2.3407870531082153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -1.6597909852862358e-02</internalNodes>
+          <leafValues>
+            4.2095288634300232e-01 -2.2674840688705444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -2.0199299324303865e-03</internalNodes>
+          <leafValues>
+            -7.4156731367111206e-01 1.2601189315319061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 -1.5202340437099338e-03</internalNodes>
+          <leafValues>
+            -7.6154601573944092e-01 8.6373612284660339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -4.9663940444588661e-03</internalNodes>
+          <leafValues>
+            4.2182239890098572e-01 -1.7904919385910034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 -1.9207600504159927e-02</internalNodes>
+          <leafValues>
+            4.6894899010658264e-01 -1.4378750324249268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 -1.2222680263221264e-02</internalNodes>
+          <leafValues>
+            3.2842078804969788e-01 -2.1802149713039398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 5.7548668235540390e-02</internalNodes>
+          <leafValues>
+            -3.6768808960914612e-01 2.4357110261917114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 -9.5794079825282097e-03</internalNodes>
+          <leafValues>
+            -7.2245067358016968e-01 6.3664563000202179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -2.9545740690082312e-03</internalNodes>
+          <leafValues>
+            3.5846439003944397e-01 -1.6696329414844513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 -4.2017991654574871e-03</internalNodes>
+          <leafValues>
+            3.9094808697700500e-01 -1.2041790038347244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 -1.3624990358948708e-02</internalNodes>
+          <leafValues>
+            -5.8767718076705933e-01 8.8404729962348938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 6.2853112467564642e-05</internalNodes>
+          <leafValues>
+            -2.6348459720611572e-01 2.1419279277324677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -2.6782939676195383e-03</internalNodes>
+          <leafValues>
+            -7.8390169143676758e-01 8.0526962876319885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -7.0597179234027863e-02</internalNodes>
+          <leafValues>
+            4.1469261050224304e-01 -1.3989959657192230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 9.2093646526336670e-02</internalNodes>
+          <leafValues>
+            -1.3055180013179779e-01 5.0435781478881836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -8.8004386052489281e-03</internalNodes>
+          <leafValues>
+            3.6609750986099243e-01 -1.4036649465560913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 7.5080977694597095e-05</internalNodes>
+          <leafValues>
+            -2.9704439640045166e-01 2.0702940225601196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -2.9870450962334871e-03</internalNodes>
+          <leafValues>
+            3.5615700483322144e-01 -1.5445969998836517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -2.6441509835422039e-03</internalNodes>
+          <leafValues>
+            -5.4353517293930054e-01 1.0295110195875168e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-1.2905240058898926e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 66 -4.7862470149993896e-02</internalNodes>
+          <leafValues>
+            4.1528239846229553e-01 -3.4185820817947388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 8.7350532412528992e-02</internalNodes>
+          <leafValues>
+            -3.8749781250953674e-01 2.4204200506210327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -1.6849499195814133e-02</internalNodes>
+          <leafValues>
+            5.3082478046417236e-01 -1.7282910645008087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 -2.8870029374957085e-02</internalNodes>
+          <leafValues>
+            3.5843509435653687e-01 -2.2402590513229370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 2.5679389946162701e-03</internalNodes>
+          <leafValues>
+            1.4990499615669250e-01 -6.5609407424926758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -2.4116659536957741e-02</internalNodes>
+          <leafValues>
+            5.5889678001403809e-01 -1.4810280501842499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 -3.2826658338308334e-02</internalNodes>
+          <leafValues>
+            4.6468681097030640e-01 -1.0785529762506485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -1.5233060345053673e-02</internalNodes>
+          <leafValues>
+            -7.3954427242279053e-01 5.6236881762742996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 -3.0209511169232428e-04</internalNodes>
+          <leafValues>
+            -4.5548820495605469e-01 9.7069837152957916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 7.5365108205005527e-04</internalNodes>
+          <leafValues>
+            9.5147296786308289e-02 -5.4895019531250000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -1.0638950392603874e-02</internalNodes>
+          <leafValues>
+            4.0912970900535583e-01 -1.2308409810066223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -7.5217830017209053e-03</internalNodes>
+          <leafValues>
+            4.0289148688316345e-01 -1.6048780083656311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -1.0677099972963333e-01</internalNodes>
+          <leafValues>
+            6.1759322881698608e-01 -7.3091186583042145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 1.6256919130682945e-02</internalNodes>
+          <leafValues>
+            -1.3103680312633514e-01 3.7453651428222656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -2.0679360255599022e-02</internalNodes>
+          <leafValues>
+            -7.1402907371520996e-01 5.2390009164810181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 1.7052369192242622e-02</internalNodes>
+          <leafValues>
+            1.2822860479354858e-01 -3.1080681085586548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 -5.7122060097754002e-03</internalNodes>
+          <leafValues>
+            -6.0556507110595703e-01 8.1884756684303284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 2.0851430235779844e-05</internalNodes>
+          <leafValues>
+            -2.6812988519668579e-01 1.4453840255737305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 7.9284431412816048e-03</internalNodes>
+          <leafValues>
+            -7.8795351088047028e-02 5.6762582063674927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 -2.5217379443347454e-03</internalNodes>
+          <leafValues>
+            3.7068629264831543e-01 -1.3620570302009583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 -2.2426199167966843e-02</internalNodes>
+          <leafValues>
+            -6.8704998493194580e-01 5.1062859594821930e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 -7.6451441273093224e-03</internalNodes>
+          <leafValues>
+            2.3492220044136047e-01 -1.7905959486961365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -1.1175329564139247e-03</internalNodes>
+          <leafValues>
+            -5.9869050979614258e-01 7.4324436485767365e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 1.9212789833545685e-02</internalNodes>
+          <leafValues>
+            -1.5702550113201141e-01 2.9737469553947449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 5.6293429806828499e-03</internalNodes>
+          <leafValues>
+            -9.9769018590450287e-02 4.2130270600318909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -9.5671862363815308e-03</internalNodes>
+          <leafValues>
+            -6.0858798027038574e-01 7.3506258428096771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 1.1217960156500340e-02</internalNodes>
+          <leafValues>
+            -1.0320810228586197e-01 4.1909849643707275e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>28</maxWeakCount>
+      <stageThreshold>-1.1600480079650879e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 93 -1.7486440017819405e-02</internalNodes>
+          <leafValues>
+            3.1307280063629150e-01 -3.3681181073188782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 3.0714649707078934e-02</internalNodes>
+          <leafValues>
+            -1.8766190111637115e-01 5.3780800104141235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 -2.2188719362020493e-02</internalNodes>
+          <leafValues>
+            3.6637881398200989e-01 -1.6124810278415680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -5.0700771680567414e-05</internalNodes>
+          <leafValues>
+            2.1245710551738739e-01 -2.8444620966911316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -7.0170420221984386e-03</internalNodes>
+          <leafValues>
+            3.9543110132217407e-01 -1.3173590600490570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -6.8563609384000301e-03</internalNodes>
+          <leafValues>
+            3.0373859405517578e-01 -2.0657819509506226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 -1.4129259623587132e-02</internalNodes>
+          <leafValues>
+            -7.6503008604049683e-01 9.8213188350200653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -4.7915481030941010e-02</internalNodes>
+          <leafValues>
+            4.8307389020919800e-01 -1.3006809353828430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 4.7032979637151584e-05</internalNodes>
+          <leafValues>
+            -2.5216570496559143e-01 2.4386680126190186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 1.0221180273219943e-03</internalNodes>
+          <leafValues>
+            6.8857602775096893e-02 -6.5861141681671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 -2.6056109927594662e-03</internalNodes>
+          <leafValues>
+            4.2942029237747192e-01 -1.3022460043430328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 5.4505340813193470e-05</internalNodes>
+          <leafValues>
+            -1.9288620352745056e-01 2.8958499431610107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 -6.6721157054416835e-05</internalNodes>
+          <leafValues>
+            3.0290710926055908e-01 -1.9854369759559631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 2.6281431317329407e-01</internalNodes>
+          <leafValues>
+            -2.3293940722942352e-01 2.3692460358142853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 -2.3569669574499130e-02</internalNodes>
+          <leafValues>
+            1.9401040673255920e-01 -2.8484618663787842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -3.9120172150433064e-03</internalNodes>
+          <leafValues>
+            5.5378979444503784e-01 -9.5665678381919861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 5.0788799853762612e-05</internalNodes>
+          <leafValues>
+            -2.3912659287452698e-01 2.1799489855766296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 -7.8732017427682877e-03</internalNodes>
+          <leafValues>
+            4.0697428584098816e-01 -1.2768040597438812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 -1.6778609715402126e-03</internalNodes>
+          <leafValues>
+            -5.7744657993316650e-01 9.7324788570404053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -2.6832430739887059e-04</internalNodes>
+          <leafValues>
+            2.9021880030632019e-01 -1.6831269860267639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 7.8687182394787669e-05</internalNodes>
+          <leafValues>
+            -1.9551570713520050e-01 2.7720969915390015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 1.2953500263392925e-02</internalNodes>
+          <leafValues>
+            -9.6838317811489105e-02 4.0323871374130249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -1.3043959625065327e-02</internalNodes>
+          <leafValues>
+            4.7198569774627686e-01 -8.9287549257278442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 3.0261781066656113e-03</internalNodes>
+          <leafValues>
+            -1.3623380661010742e-01 3.0686271190643311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 -6.0438038781285286e-03</internalNodes>
+          <leafValues>
+            -7.7954101562500000e-01 5.7316310703754425e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 -2.2507249377667904e-03</internalNodes>
+          <leafValues>
+            3.0877059698104858e-01 -1.5006309747695923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 1.5826810151338577e-02</internalNodes>
+          <leafValues>
+            6.4551889896392822e-02 -7.2455567121505737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 6.5864507632795721e-05</internalNodes>
+          <leafValues>
+            -1.7598840594291687e-01 2.3210389912128448e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>36</maxWeakCount>
+      <stageThreshold>-1.2257250547409058e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 121 -2.7854869142174721e-02</internalNodes>
+          <leafValues>
+            4.5518448948860168e-01 -1.8099910020828247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 1.2895040214061737e-01</internalNodes>
+          <leafValues>
+            -5.2565532922744751e-01 1.6188900172710419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 2.4403180927038193e-02</internalNodes>
+          <leafValues>
+            -1.4974960684776306e-01 4.2357379198074341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -2.4458570405840874e-03</internalNodes>
+          <leafValues>
+            3.2948669791221619e-01 -1.7447690665721893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 -3.5336529836058617e-03</internalNodes>
+          <leafValues>
+            4.7426640987396240e-01 -7.3618359863758087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 5.1358150813030079e-05</internalNodes>
+          <leafValues>
+            -3.0421930551528931e-01 1.5633270144462585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -1.6225680708885193e-02</internalNodes>
+          <leafValues>
+            2.3002180457115173e-01 -2.0359820127487183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -4.6007009223103523e-03</internalNodes>
+          <leafValues>
+            4.0459269285202026e-01 -1.3485440611839294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -2.1928999572992325e-02</internalNodes>
+          <leafValues>
+            -6.8724489212036133e-01 8.0684266984462738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 -2.8971210122108459e-03</internalNodes>
+          <leafValues>
+            -6.9619607925415039e-01 4.8545219004154205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 -4.4074649922549725e-03</internalNodes>
+          <leafValues>
+            2.5166261196136475e-01 -1.6236649453639984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 2.8437169268727303e-02</internalNodes>
+          <leafValues>
+            6.0394261032342911e-02 -6.6744458675384521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 8.3212882280349731e-02</internalNodes>
+          <leafValues>
+            6.4357921481132507e-02 -5.3626042604446411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -1.2419329956173897e-02</internalNodes>
+          <leafValues>
+            -7.0816862583160400e-01 5.7526610791683197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 -4.6992599964141846e-03</internalNodes>
+          <leafValues>
+            5.1254332065582275e-01 -8.7350800633430481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -7.8025809489190578e-04</internalNodes>
+          <leafValues>
+            2.6687660813331604e-01 -1.7961509525775909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -1.9724339246749878e-02</internalNodes>
+          <leafValues>
+            -6.7563730478286743e-01 7.2941906750202179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.0269250487908721e-03</internalNodes>
+          <leafValues>
+            5.3919319063425064e-02 -5.5540180206298828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -2.5957189500331879e-02</internalNodes>
+          <leafValues>
+            5.6362527608871460e-01 -7.1898393332958221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 -1.2552699772641063e-03</internalNodes>
+          <leafValues>
+            -5.0346630811691284e-01 8.9691452682018280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -4.9970578402280807e-02</internalNodes>
+          <leafValues>
+            1.7685119807720184e-01 -2.2301959991455078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -2.9899610672146082e-03</internalNodes>
+          <leafValues>
+            3.9122420549392700e-01 -1.0149750113487244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 4.8546842299401760e-03</internalNodes>
+          <leafValues>
+            -1.1770179867744446e-01 4.2190939188003540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 1.0448860120959580e-04</internalNodes>
+          <leafValues>
+            -1.7333979904651642e-01 2.2344440221786499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 5.9689260524464771e-05</internalNodes>
+          <leafValues>
+            -2.3409630358219147e-01 1.6558240354061127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -1.3423919677734375e-02</internalNodes>
+          <leafValues>
+            4.3023818731307983e-01 -9.9723652005195618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 2.2581999655812979e-03</internalNodes>
+          <leafValues>
+            7.2720989584922791e-02 -5.7501018047332764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -1.2546280398964882e-02</internalNodes>
+          <leafValues>
+            3.6184579133987427e-01 -1.1457010358572006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 -2.8705769218504429e-03</internalNodes>
+          <leafValues>
+            2.8210538625717163e-01 -1.2367550283670425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 1.9785640761256218e-02</internalNodes>
+          <leafValues>
+            4.7876749187707901e-02 -8.0666238069534302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 4.7588930465281010e-03</internalNodes>
+          <leafValues>
+            -1.0925389826297760e-01 3.3746978640556335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -6.9974269717931747e-03</internalNodes>
+          <leafValues>
+            -8.0295938253402710e-01 4.5706700533628464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 -1.3033480383455753e-02</internalNodes>
+          <leafValues>
+            1.8680439889431000e-01 -1.7688910663127899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 -1.3742579612880945e-03</internalNodes>
+          <leafValues>
+            2.7725479006767273e-01 -1.2809009850025177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 2.7657810132950544e-03</internalNodes>
+          <leafValues>
+            9.0758942067623138e-02 -4.2594739794731140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 2.8941841446794569e-04</internalNodes>
+          <leafValues>
+            -3.8816329836845398e-01 8.9267797768115997e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>47</maxWeakCount>
+      <stageThreshold>-1.2863140106201172e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.4469229616224766e-02</internalNodes>
+          <leafValues>
+            3.7507829070091248e-01 -2.4928289651870728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -1.3317629694938660e-01</internalNodes>
+          <leafValues>
+            3.0166378617286682e-01 -2.2414070367813110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -1.0132160037755966e-02</internalNodes>
+          <leafValues>
+            3.6985591053962708e-01 -1.7850010097026825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -7.8511182218790054e-03</internalNodes>
+          <leafValues>
+            4.6086761355400085e-01 -1.2931390106678009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 -1.4295839704573154e-02</internalNodes>
+          <leafValues>
+            4.4841429591178894e-01 -1.0226240009069443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -5.9606940485537052e-03</internalNodes>
+          <leafValues>
+            2.7927988767623901e-01 -1.5323829650878906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 1.0932769626379013e-02</internalNodes>
+          <leafValues>
+            -1.5141740441322327e-01 3.9889648556709290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 5.0430990086169913e-05</internalNodes>
+          <leafValues>
+            -2.2681570053100586e-01 2.1644389629364014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 -5.8431681245565414e-03</internalNodes>
+          <leafValues>
+            4.5420148968696594e-01 -1.2587159872055054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -2.2346209734678268e-02</internalNodes>
+          <leafValues>
+            -6.2690192461013794e-01 8.2403123378753662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 -4.8836669884622097e-03</internalNodes>
+          <leafValues>
+            2.6359251141548157e-01 -1.4686630666255951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 7.5506002758629620e-05</internalNodes>
+          <leafValues>
+            -2.4507020413875580e-01 1.6678880155086517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 -4.9026997294276953e-04</internalNodes>
+          <leafValues>
+            -4.2649960517883301e-01 8.9973561465740204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 1.4861579984426498e-03</internalNodes>
+          <leafValues>
+            -1.2040250003337860e-01 3.0097651481628418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 -1.1988339945673943e-02</internalNodes>
+          <leafValues>
+            2.7852478623390198e-01 -1.2244340032339096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 1.0502239689230919e-02</internalNodes>
+          <leafValues>
+            4.0452759712934494e-02 -7.4050408601760864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -3.0963009223341942e-02</internalNodes>
+          <leafValues>
+            -6.2842690944671631e-01 4.8013761639595032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 1.1414520442485809e-02</internalNodes>
+          <leafValues>
+            3.9405211806297302e-02 -7.1674120426177979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -1.2337000109255314e-02</internalNodes>
+          <leafValues>
+            1.9941329956054688e-01 -1.9274300336837769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -5.9942267835140228e-03</internalNodes>
+          <leafValues>
+            5.1318162679672241e-01 -6.1658058315515518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -1.1923230485990644e-03</internalNodes>
+          <leafValues>
+            -7.2605299949645996e-01 5.0652720034122467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 -7.4582789093255997e-03</internalNodes>
+          <leafValues>
+            2.9603078961372375e-01 -1.1754789948463440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 2.7877509128302336e-03</internalNodes>
+          <leafValues>
+            4.5068711042404175e-02 -6.9535410404205322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -2.2503209766000509e-04</internalNodes>
+          <leafValues>
+            2.0047250390052795e-01 -1.5775249898433685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -5.0367889925837517e-03</internalNodes>
+          <leafValues>
+            2.9299819469451904e-01 -1.1700499802827835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 7.4742160737514496e-02</internalNodes>
+          <leafValues>
+            -1.1392319947481155e-01 3.0256620049476624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 2.0255519077181816e-02</internalNodes>
+          <leafValues>
+            -1.0515890270471573e-01 4.0670460462570190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 4.4214509427547455e-02</internalNodes>
+          <leafValues>
+            -2.7631640434265137e-01 1.2363869696855545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -8.7259558495134115e-04</internalNodes>
+          <leafValues>
+            2.4355030059814453e-01 -1.3300949335098267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 -2.4453739169985056e-03</internalNodes>
+          <leafValues>
+            -5.3866171836853027e-01 6.2510646879673004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 8.2725353422574699e-05</internalNodes>
+          <leafValues>
+            -2.0772209763526917e-01 1.6270439326763153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -3.6627110093832016e-02</internalNodes>
+          <leafValues>
+            3.6568409204483032e-01 -9.0330280363559723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 3.0996399000287056e-03</internalNodes>
+          <leafValues>
+            -1.3183020055294037e-01 2.5354298949241638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -2.4709280114620924e-03</internalNodes>
+          <leafValues>
+            -5.6853497028350830e-01 5.3505431860685349e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 -1.4114670455455780e-02</internalNodes>
+          <leafValues>
+            -4.8599010705947876e-01 5.8485250920057297e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 8.4537261864170432e-04</internalNodes>
+          <leafValues>
+            -8.0093637108802795e-02 4.0265649557113647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -7.1098632179200649e-03</internalNodes>
+          <leafValues>
+            4.4703239202499390e-01 -6.2947437167167664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -1.9125960767269135e-02</internalNodes>
+          <leafValues>
+            -6.6422867774963379e-01 4.9822770059108734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 -5.0773010589182377e-03</internalNodes>
+          <leafValues>
+            1.7379400134086609e-01 -1.6850599646568298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -2.9198289848864079e-03</internalNodes>
+          <leafValues>
+            -6.0110282897949219e-01 5.7427939027547836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -2.4902150034904480e-02</internalNodes>
+          <leafValues>
+            2.3397980630397797e-01 -1.1818459630012512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 2.0147779956459999e-02</internalNodes>
+          <leafValues>
+            -8.9459821581840515e-02 3.6024400591850281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 1.7597640398889780e-03</internalNodes>
+          <leafValues>
+            4.9458440393209457e-02 -6.3102620840072632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 1.3812039978802204e-03</internalNodes>
+          <leafValues>
+            -1.5218059718608856e-01 1.8971739709377289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -1.0904540307819843e-02</internalNodes>
+          <leafValues>
+            -5.8097380399703979e-01 4.4862728565931320e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 7.5157178798690438e-05</internalNodes>
+          <leafValues>
+            -1.3777349889278412e-01 1.9543160498142242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 3.8649770431220531e-03</internalNodes>
+          <leafValues>
+            -1.0302229970693588e-01 2.5374969840049744e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>48</maxWeakCount>
+      <stageThreshold>-1.1189440488815308e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 204 -1.0215889662504196e-01</internalNodes>
+          <leafValues>
+            4.1681259870529175e-01 -1.6655629873275757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 -5.1939819008111954e-02</internalNodes>
+          <leafValues>
+            3.3023950457572937e-01 -2.0715710520744324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 -4.2717780917882919e-02</internalNodes>
+          <leafValues>
+            2.6093730330467224e-01 -1.6013890504837036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 4.3890418601222336e-04</internalNodes>
+          <leafValues>
+            -3.4750530123710632e-01 1.3918919861316681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 2.4264389649033546e-02</internalNodes>
+          <leafValues>
+            -4.2552059888839722e-01 1.3578380644321442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -2.3820599541068077e-02</internalNodes>
+          <leafValues>
+            3.1749808788299561e-01 -1.6652040183544159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -7.0518180727958679e-03</internalNodes>
+          <leafValues>
+            3.0947178602218628e-01 -1.3338300585746765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -6.8517157342284918e-04</internalNodes>
+          <leafValues>
+            -6.0082262754440308e-01 8.7747000157833099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 5.3705149330198765e-03</internalNodes>
+          <leafValues>
+            -1.2311449646949768e-01 3.8333550095558167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 -1.3403539545834064e-02</internalNodes>
+          <leafValues>
+            3.3877369761466980e-01 -1.0140489786863327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -6.6856360062956810e-03</internalNodes>
+          <leafValues>
+            -6.1193597316741943e-01 4.7740221023559570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 -4.2887418530881405e-03</internalNodes>
+          <leafValues>
+            2.5275790691375732e-01 -1.4434510469436646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -1.0876749642193317e-02</internalNodes>
+          <leafValues>
+            5.4775732755661011e-01 -5.9455480426549911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 3.7882640026509762e-04</internalNodes>
+          <leafValues>
+            8.3410300314426422e-02 -4.4226369261741638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -2.4550149682909250e-03</internalNodes>
+          <leafValues>
+            2.3330999910831451e-01 -1.3964480161666870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 1.2721839593723416e-03</internalNodes>
+          <leafValues>
+            6.0480289161205292e-02 -4.9456089735031128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 -4.8933159559965134e-03</internalNodes>
+          <leafValues>
+            -6.6833269596099854e-01 4.6218499541282654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 2.6449989527463913e-02</internalNodes>
+          <leafValues>
+            -7.3235362768173218e-02 4.4425961375236511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 -3.3706070389598608e-03</internalNodes>
+          <leafValues>
+            -4.2464339733123779e-01 6.8676561117172241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 -2.9559480026364326e-03</internalNodes>
+          <leafValues>
+            1.6218039393424988e-01 -1.8222999572753906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 3.0619909986853600e-02</internalNodes>
+          <leafValues>
+            -5.8643341064453125e-02 5.3263628482818604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -9.5765907317399979e-03</internalNodes>
+          <leafValues>
+            -6.0562682151794434e-01 5.3345989435911179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 6.6372493165545166e-05</internalNodes>
+          <leafValues>
+            -1.6680839657783508e-01 1.9284160435199738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 5.0975950434803963e-03</internalNodes>
+          <leafValues>
+            4.4119510799646378e-02 -5.7458841800689697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 3.7112718564458191e-04</internalNodes>
+          <leafValues>
+            -1.1086399853229523e-01 2.3105390369892120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 -8.6607588455080986e-03</internalNodes>
+          <leafValues>
+            4.0456289052963257e-01 -6.2446091324090958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 8.7489158613607287e-04</internalNodes>
+          <leafValues>
+            6.4875148236751556e-02 -4.4871041178703308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 1.1120870476588607e-03</internalNodes>
+          <leafValues>
+            -9.3861460685729980e-02 3.0453911423683167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 -2.3837819695472717e-02</internalNodes>
+          <leafValues>
+            -5.8887428045272827e-01 4.6659421175718307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 2.2272899514064193e-04</internalNodes>
+          <leafValues>
+            -1.4898599684238434e-01 1.7701950669288635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 2.4467470124363899e-02</internalNodes>
+          <leafValues>
+            -5.5789601057767868e-02 4.9208301305770874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 -1.4239320158958435e-01</internalNodes>
+          <leafValues>
+            1.5192000567913055e-01 -1.8778899312019348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -2.0123120397329330e-02</internalNodes>
+          <leafValues>
+            2.1780100464820862e-01 -1.2081900238990784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 1.1513679783092812e-04</internalNodes>
+          <leafValues>
+            -1.6856589913368225e-01 1.6451929509639740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 -2.7556740678846836e-03</internalNodes>
+          <leafValues>
+            -6.9442039728164673e-01 3.9449468255043030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 -7.5843912782147527e-05</internalNodes>
+          <leafValues>
+            1.8941369652748108e-01 -1.5183840692043304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 -7.0697711780667305e-03</internalNodes>
+          <leafValues>
+            4.7064599394798279e-01 -5.7927619665861130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -3.7393178790807724e-02</internalNodes>
+          <leafValues>
+            -7.5892448425292969e-01 3.4116048365831375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -1.5995610505342484e-02</internalNodes>
+          <leafValues>
+            3.0670469999313354e-01 -8.7525576353073120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -3.1183990649878979e-03</internalNodes>
+          <leafValues>
+            2.6195371150970459e-01 -9.1214887797832489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 1.0651360498741269e-03</internalNodes>
+          <leafValues>
+            -1.7427560687065125e-01 1.5277640521526337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 -1.6029420075938106e-03</internalNodes>
+          <leafValues>
+            3.5612630844116211e-01 -7.6629996299743652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 4.3619908392429352e-03</internalNodes>
+          <leafValues>
+            4.9356970936059952e-02 -5.9228771924972534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -1.0779909789562225e-02</internalNodes>
+          <leafValues>
+            -6.3922178745269775e-01 3.3204540610313416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -4.3590869754552841e-03</internalNodes>
+          <leafValues>
+            1.6107389330863953e-01 -1.5221320092678070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 7.4596069753170013e-03</internalNodes>
+          <leafValues>
+            3.3172961324453354e-02 -7.5007742643356323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 8.1385448575019836e-03</internalNodes>
+          <leafValues>
+            2.6325279846787453e-02 -7.1731162071228027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -3.3338490873575211e-02</internalNodes>
+          <leafValues>
+            3.3536610007286072e-01 -7.0803590118885040e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>55</maxWeakCount>
+      <stageThreshold>-1.1418989896774292e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 252 1.9553979858756065e-02</internalNodes>
+          <leafValues>
+            -1.0439720004796982e-01 5.3128951787948608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 2.2122919559478760e-02</internalNodes>
+          <leafValues>
+            -2.4747270345687866e-01 2.0847250521183014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 -4.1829389519989491e-03</internalNodes>
+          <leafValues>
+            3.8289439678192139e-01 -1.4711579680442810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -8.6381728760898113e-04</internalNodes>
+          <leafValues>
+            -6.2632888555526733e-01 1.1993259936571121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 7.9958612332120538e-04</internalNodes>
+          <leafValues>
+            9.2573471367359161e-02 -5.5168831348419189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 9.1527570039033890e-03</internalNodes>
+          <leafValues>
+            -7.2929807007312775e-02 5.5512511730194092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -3.9388681761920452e-03</internalNodes>
+          <leafValues>
+            2.0196039974689484e-01 -2.0912039279937744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 1.4613410166930407e-04</internalNodes>
+          <leafValues>
+            -2.7861818671226501e-01 1.3817410171031952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 -3.1691689509898424e-03</internalNodes>
+          <leafValues>
+            3.6685898900032043e-01 -7.6308242976665497e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 -2.2189389914274216e-02</internalNodes>
+          <leafValues>
+            3.9096599817276001e-01 -1.0971540212631226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -7.4523608200252056e-03</internalNodes>
+          <leafValues>
+            1.2838590145111084e-01 -2.4159869551658630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 7.7997002517804503e-04</internalNodes>
+          <leafValues>
+            7.1978069841861725e-02 -4.3976500630378723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 -4.6783639118075371e-03</internalNodes>
+          <leafValues>
+            2.1569849550724030e-01 -1.4205920696258545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -1.5188639983534813e-02</internalNodes>
+          <leafValues>
+            3.6458781361579895e-01 -8.2675926387310028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 5.0619798712432384e-03</internalNodes>
+          <leafValues>
+            -3.4380409121513367e-01 9.2068232595920563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 -1.7351920250803232e-03</internalNodes>
+          <leafValues>
+            -6.1725497245788574e-01 4.9214478582143784e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -1.2423450127243996e-02</internalNodes>
+          <leafValues>
+            -5.8558952808380127e-01 4.6112600713968277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 -1.3031429611146450e-02</internalNodes>
+          <leafValues>
+            -5.9710788726806641e-01 4.0672458708286285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -1.2369629694148898e-03</internalNodes>
+          <leafValues>
+            -6.8334168195724487e-01 3.3156178891658783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 6.1022108420729637e-03</internalNodes>
+          <leafValues>
+            -9.4729237258434296e-02 3.0102241039276123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 6.6952849738299847e-04</internalNodes>
+          <leafValues>
+            8.1816866993904114e-02 -3.5196030139923096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 -1.7970580374822021e-03</internalNodes>
+          <leafValues>
+            2.3718979954719543e-01 -1.1768709868192673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -7.1074528386816382e-04</internalNodes>
+          <leafValues>
+            -4.4763788580894470e-01 5.7682480663061142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -5.9126471169292927e-03</internalNodes>
+          <leafValues>
+            4.3425410985946655e-01 -6.6868573427200317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -3.3132149837911129e-03</internalNodes>
+          <leafValues>
+            1.8150010704994202e-01 -1.4180320501327515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -6.0814660042524338e-02</internalNodes>
+          <leafValues>
+            4.7221711277961731e-01 -6.1410639435052872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 -9.6714183688163757e-02</internalNodes>
+          <leafValues>
+            2.7683168649673462e-01 -9.4490036368370056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 3.9073550142347813e-03</internalNodes>
+          <leafValues>
+            -1.2278530001640320e-01 2.1057400107383728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -9.0431869029998779e-03</internalNodes>
+          <leafValues>
+            3.5641568899154663e-01 -7.7806226909160614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -4.8800031654536724e-03</internalNodes>
+          <leafValues>
+            -4.1034790873527527e-01 6.9694377481937408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -4.3547428213059902e-03</internalNodes>
+          <leafValues>
+            -7.3017889261245728e-01 3.6655150353908539e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 -9.6500627696514130e-03</internalNodes>
+          <leafValues>
+            5.5181127786636353e-01 -5.3168080747127533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 -1.7397310584783554e-02</internalNodes>
+          <leafValues>
+            -5.7084232568740845e-01 5.0214089453220367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -6.8304329179227352e-03</internalNodes>
+          <leafValues>
+            -4.6180281043052673e-01 5.0202690064907074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 3.3255619928240776e-04</internalNodes>
+          <leafValues>
+            -9.5362730324268341e-02 2.5983759760856628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -2.3100529797375202e-03</internalNodes>
+          <leafValues>
+            2.2872470319271088e-01 -1.0533530265092850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 -7.5426651164889336e-03</internalNodes>
+          <leafValues>
+            -5.6990510225296021e-01 4.8863459378480911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -5.2723060362040997e-03</internalNodes>
+          <leafValues>
+            3.5145181417465210e-01 -8.2390107214450836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 -4.8578968271613121e-03</internalNodes>
+          <leafValues>
+            -6.0417622327804565e-01 4.4539440423250198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 1.5867310576140881e-03</internalNodes>
+          <leafValues>
+            -1.0340909659862518e-01 2.3282019793987274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 -4.7427811659872532e-03</internalNodes>
+          <leafValues>
+            2.8490281105041504e-01 -9.8090499639511108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -1.3515240279957652e-03</internalNodes>
+          <leafValues>
+            2.3096430301666260e-01 -1.1361840367317200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 2.2526069078594446e-03</internalNodes>
+          <leafValues>
+            6.4478322863578796e-02 -4.2205891013145447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 -3.8038659840822220e-04</internalNodes>
+          <leafValues>
+            -3.8076201081275940e-01 6.0043290257453918e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 4.9043921753764153e-03</internalNodes>
+          <leafValues>
+            -7.6104998588562012e-02 3.3232170343399048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -9.0969670563936234e-03</internalNodes>
+          <leafValues>
+            1.4287790656089783e-01 -1.6887800395488739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -6.9317929446697235e-03</internalNodes>
+          <leafValues>
+            2.7255409955978394e-01 -9.2879563570022583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 1.1471060570329428e-03</internalNodes>
+          <leafValues>
+            -1.5273059904575348e-01 1.9702400267124176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -3.7662889808416367e-02</internalNodes>
+          <leafValues>
+            -5.9320437908172607e-01 4.0738601237535477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 -6.8165571428835392e-03</internalNodes>
+          <leafValues>
+            2.5494089722633362e-01 -9.4081960618495941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 6.6205562325194478e-04</internalNodes>
+          <leafValues>
+            4.6795718371868134e-02 -4.8454371094703674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 -4.2202551849186420e-03</internalNodes>
+          <leafValues>
+            2.4682149291038513e-01 -9.4673976302146912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -6.8986512720584869e-02</internalNodes>
+          <leafValues>
+            -6.6514801979064941e-01 3.5926390439271927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 6.1707608401775360e-03</internalNodes>
+          <leafValues>
+            2.5833319872617722e-02 -7.2686272859573364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 1.0536249727010727e-02</internalNodes>
+          <leafValues>
+            -8.1828996539115906e-02 2.9760798811912537e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>32</maxWeakCount>
+      <stageThreshold>-1.1255199909210205e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 307 -6.2758728861808777e-02</internalNodes>
+          <leafValues>
+            2.7899080514907837e-01 -2.9656109213829041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 3.4516479354351759e-03</internalNodes>
+          <leafValues>
+            -3.4635880589485168e-01 2.0903840661048889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 -7.8699486330151558e-03</internalNodes>
+          <leafValues>
+            2.4144889414310455e-01 -1.9205570220947266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 -3.4624869003891945e-03</internalNodes>
+          <leafValues>
+            -5.9151780605316162e-01 1.2486449629068375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 -9.4818761572241783e-03</internalNodes>
+          <leafValues>
+            1.8391540646553040e-01 -2.4858260154724121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 2.3226840130519122e-04</internalNodes>
+          <leafValues>
+            -3.3047258853912354e-01 1.0999260097742081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 1.8101120367646217e-03</internalNodes>
+          <leafValues>
+            9.8744012415409088e-02 -4.9634781479835510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -5.4422430694103241e-03</internalNodes>
+          <leafValues>
+            2.9344418644905090e-01 -1.3094750046730042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 7.4148122221231461e-03</internalNodes>
+          <leafValues>
+            -1.4762699604034424e-01 3.3277168869972229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -1.5565140172839165e-02</internalNodes>
+          <leafValues>
+            -6.8404901027679443e-01 9.9872693419456482e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 2.8720520436763763e-02</internalNodes>
+          <leafValues>
+            -1.4833280444145203e-01 3.0902579426765442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 9.6687392215244472e-05</internalNodes>
+          <leafValues>
+            -1.7431040108203888e-01 2.1402959525585175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 5.2371058613061905e-02</internalNodes>
+          <leafValues>
+            -7.0156857371330261e-02 4.9222990870475769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 -8.6485691368579865e-02</internalNodes>
+          <leafValues>
+            5.0757247209548950e-01 -7.5294211506843567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -4.2169868946075439e-02</internalNodes>
+          <leafValues>
+            4.5680961012840271e-01 -9.0219900012016296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 4.5369830331765115e-05</internalNodes>
+          <leafValues>
+            -2.6538279652595520e-01 1.6189539432525635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 5.2918000146746635e-03</internalNodes>
+          <leafValues>
+            7.4890151619911194e-02 -5.4054671525955200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -7.5511651812121272e-04</internalNodes>
+          <leafValues>
+            -4.9261990189552307e-01 5.8723948895931244e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 7.5108138844370842e-05</internalNodes>
+          <leafValues>
+            -2.1432100236415863e-01 1.4077760279178619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 4.9981209449470043e-03</internalNodes>
+          <leafValues>
+            -9.0547338128089905e-02 3.5716068744659424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 -1.4929979806765914e-03</internalNodes>
+          <leafValues>
+            2.5623458623886108e-01 -1.4229069650173187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 2.7239411137998104e-03</internalNodes>
+          <leafValues>
+            -1.5649250149726868e-01 2.1088710427284241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 2.2218320518732071e-03</internalNodes>
+          <leafValues>
+            -1.5072989463806152e-01 2.6801869273185730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 -7.3993072146549821e-04</internalNodes>
+          <leafValues>
+            2.9546990990638733e-01 -1.0692390054464340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 2.0113459322601557e-03</internalNodes>
+          <leafValues>
+            5.0614349544048309e-02 -7.1683371067047119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 1.1452870443463326e-02</internalNodes>
+          <leafValues>
+            -1.2719069421291351e-01 2.4152779579162598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -1.0782170575112104e-03</internalNodes>
+          <leafValues>
+            2.4813009798526764e-01 -1.3461199402809143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 3.3417691010981798e-03</internalNodes>
+          <leafValues>
+            5.3578309714794159e-02 -5.2274167537689209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 6.9398651248775423e-05</internalNodes>
+          <leafValues>
+            -2.1698740124702454e-01 1.2812179327011108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 -4.0982551872730255e-03</internalNodes>
+          <leafValues>
+            2.4401889741420746e-01 -1.1570589989423752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 -1.6289720078930259e-03</internalNodes>
+          <leafValues>
+            2.8261470794677734e-01 -1.0659469664096832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 1.3984859921038151e-02</internalNodes>
+          <leafValues>
+            4.2715899646282196e-02 -7.3646312952041626e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>30</maxWeakCount>
+      <stageThreshold>-1.1729990243911743e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 339 1.6416519880294800e-01</internalNodes>
+          <leafValues>
+            -4.8960301280021667e-01 1.7607709765434265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 8.3413062384352088e-04</internalNodes>
+          <leafValues>
+            -2.8220430016517639e-01 2.4199579656124115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -1.7193210078403354e-03</internalNodes>
+          <leafValues>
+            -7.1485888957977295e-01 8.6162216961383820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -1.5654950402677059e-03</internalNodes>
+          <leafValues>
+            -7.2972381114959717e-01 9.4070672988891602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 1.9124479731544852e-03</internalNodes>
+          <leafValues>
+            -3.1187158823013306e-01 1.8143390119075775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 -1.3512369990348816e-01</internalNodes>
+          <leafValues>
+            2.9577299952507019e-01 -2.2179250419139862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -4.0300549007952213e-03</internalNodes>
+          <leafValues>
+            -6.6595137119293213e-01 8.5431016981601715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -2.8640460222959518e-03</internalNodes>
+          <leafValues>
+            -6.2086361646652222e-01 5.3106021136045456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -1.4065420255064964e-03</internalNodes>
+          <leafValues>
+            2.2346289455890656e-01 -2.0211009681224823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -3.5820449702441692e-03</internalNodes>
+          <leafValues>
+            -5.4030400514602661e-01 6.8213619291782379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 4.1544470936059952e-02</internalNodes>
+          <leafValues>
+            -6.5215840935707092e-02 6.2109231948852539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -9.1709550470113754e-03</internalNodes>
+          <leafValues>
+            -7.5553297996520996e-01 5.2640449255704880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 6.1552738770842552e-03</internalNodes>
+          <leafValues>
+            9.0939402580261230e-02 -4.4246131181716919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -1.0043520014733076e-03</internalNodes>
+          <leafValues>
+            2.4292330443859100e-01 -1.8669790029525757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 1.1519829742610455e-02</internalNodes>
+          <leafValues>
+            -1.1763150244951248e-01 3.6723458766937256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -8.9040733873844147e-03</internalNodes>
+          <leafValues>
+            -4.8931330442428589e-01 1.0897020250558853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 5.3973670583218336e-04</internalNodes>
+          <leafValues>
+            -2.1850399672985077e-01 1.8489989638328552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 1.3727260520681739e-03</internalNodes>
+          <leafValues>
+            -1.5072910487651825e-01 2.9173129796981812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -1.0807390324771404e-02</internalNodes>
+          <leafValues>
+            4.2897450923919678e-01 -1.0280139744281769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 1.2670770520344377e-03</internalNodes>
+          <leafValues>
+            7.4192158877849579e-02 -6.4208251237869263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 2.2991129662841558e-03</internalNodes>
+          <leafValues>
+            4.7100279480218887e-02 -7.2335231304168701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 2.7187510859221220e-03</internalNodes>
+          <leafValues>
+            -1.7086869478225708e-01 2.3513509333133698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -6.6619180142879486e-03</internalNodes>
+          <leafValues>
+            -7.8975427150726318e-01 4.5084670186042786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -4.8266649246215820e-02</internalNodes>
+          <leafValues>
+            -6.9579917192459106e-01 4.1976079344749451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 1.5214690007269382e-02</internalNodes>
+          <leafValues>
+            -1.0818280279636383e-01 3.6460620164871216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 -6.0080131515860558e-03</internalNodes>
+          <leafValues>
+            3.0970990657806396e-01 -1.1359210312366486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 6.6127157770097256e-03</internalNodes>
+          <leafValues>
+            8.0665342509746552e-02 -4.6658530831336975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -7.9607013612985611e-03</internalNodes>
+          <leafValues>
+            -8.7201941013336182e-01 3.6774590611457825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 3.8847199175506830e-03</internalNodes>
+          <leafValues>
+            -1.1666289716959000e-01 3.3070269227027893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -1.0988810099661350e-03</internalNodes>
+          <leafValues>
+            2.3872570693492889e-01 -1.7656759917736053e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.0368299484252930e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 369 3.5903379321098328e-03</internalNodes>
+          <leafValues>
+            -2.3688079416751862e-01 2.4631640315055847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 6.4815930090844631e-03</internalNodes>
+          <leafValues>
+            -3.1373620033264160e-01 1.8675759434700012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 7.3048402555286884e-05</internalNodes>
+          <leafValues>
+            -2.7644351124763489e-01 1.6496239602565765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 -3.8514640182256699e-03</internalNodes>
+          <leafValues>
+            -5.6014508008956909e-01 1.1294739693403244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 3.8588210009038448e-03</internalNodes>
+          <leafValues>
+            3.9848998188972473e-02 -5.8071857690811157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -2.4651220068335533e-02</internalNodes>
+          <leafValues>
+            1.6755010187625885e-01 -2.5343671441078186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 4.7245521098375320e-02</internalNodes>
+          <leafValues>
+            -1.0662080347537994e-01 3.9451980590820312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 6.5964651294052601e-03</internalNodes>
+          <leafValues>
+            -1.7744250595569611e-01 2.7280190587043762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -1.3177490327507257e-03</internalNodes>
+          <leafValues>
+            -5.4272651672363281e-01 4.8606589436531067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 -5.0261709839105606e-03</internalNodes>
+          <leafValues>
+            2.4394249916076660e-01 -1.3143649697303772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 3.4632768947631121e-03</internalNodes>
+          <leafValues>
+            6.9049343466758728e-02 -7.0336240530014038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 2.1692588925361633e-03</internalNodes>
+          <leafValues>
+            -1.3289460539817810e-01 2.2098529338836670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 2.9395870864391327e-02</internalNodes>
+          <leafValues>
+            -2.8530520200729370e-01 1.3543990254402161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -9.6181448316201568e-04</internalNodes>
+          <leafValues>
+            -5.8041381835937500e-01 3.7450648844242096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 -1.0820999741554260e-01</internalNodes>
+          <leafValues>
+            3.9467281103134155e-01 -7.8655943274497986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 -1.8024869263172150e-02</internalNodes>
+          <leafValues>
+            2.7355629205703735e-01 -1.3415299355983734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 6.2509840354323387e-03</internalNodes>
+          <leafValues>
+            2.3388059809803963e-02 -8.0088591575622559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 -1.6088379779830575e-03</internalNodes>
+          <leafValues>
+            -5.6762522459030151e-01 4.1215669363737106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 7.7564752427861094e-04</internalNodes>
+          <leafValues>
+            -1.4891269803047180e-01 1.9086180627346039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 8.7122338300105184e-05</internalNodes>
+          <leafValues>
+            -1.5557530522346497e-01 1.9428220391273499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -2.0755320787429810e-02</internalNodes>
+          <leafValues>
+            -6.3006532192230225e-01 3.6134380847215652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -6.2931738793849945e-03</internalNodes>
+          <leafValues>
+            2.5609248876571655e-01 -1.0588269680738449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 1.0844149626791477e-02</internalNodes>
+          <leafValues>
+            -1.0124850273132324e-01 3.0322128534317017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 -6.3752777350600809e-05</internalNodes>
+          <leafValues>
+            1.9111579656600952e-01 -1.3849230110645294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 6.6480963141657412e-05</internalNodes>
+          <leafValues>
+            -1.5205250680446625e-01 2.1706309914588928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 1.3560829684138298e-03</internalNodes>
+          <leafValues>
+            4.9431789666414261e-02 -6.4279842376708984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -9.0662558795884252e-04</internalNodes>
+          <leafValues>
+            1.7982010543346405e-01 -1.4044609665870667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 1.0473709553480148e-03</internalNodes>
+          <leafValues>
+            -1.0933549702167511e-01 2.4265940487384796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -1.0243969736620784e-03</internalNodes>
+          <leafValues>
+            2.7162680029869080e-01 -1.1820919811725616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -1.2024149764329195e-03</internalNodes>
+          <leafValues>
+            -7.0151102542877197e-01 3.9489898830652237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 7.6911649666726589e-03</internalNodes>
+          <leafValues>
+            -9.2218913137912750e-02 3.1046289205551147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -1.3966549932956696e-01</internalNodes>
+          <leafValues>
+            6.8979388475418091e-01 -3.9706118404865265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 2.1276050247251987e-03</internalNodes>
+          <leafValues>
+            9.7277611494064331e-02 -2.8841799497604370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -2.7594310231506824e-03</internalNodes>
+          <leafValues>
+            2.4168670177459717e-01 -1.1277820169925690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 5.2236132323741913e-03</internalNodes>
+          <leafValues>
+            -1.1430279910564423e-01 2.4256780743598938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -1.2590440455824137e-03</internalNodes>
+          <leafValues>
+            -5.9679388999938965e-01 4.7663960605859756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 -3.7192099262028933e-03</internalNodes>
+          <leafValues>
+            -4.6414130926132202e-01 5.2847690880298615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 5.9696151874959469e-03</internalNodes>
+          <leafValues>
+            -7.3244288563728333e-02 3.8743090629577637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 -5.1776720210909843e-03</internalNodes>
+          <leafValues>
+            -7.4193227291107178e-01 4.0496710687875748e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 5.0035100430250168e-03</internalNodes>
+          <leafValues>
+            -1.3888800144195557e-01 1.8767620623111725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 -5.2013457752764225e-04</internalNodes>
+          <leafValues>
+            -5.4940617084503174e-01 4.9417849630117416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 5.3168768063187599e-03</internalNodes>
+          <leafValues>
+            -8.2482978701591492e-02 3.1740561127662659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -1.4774589799344540e-02</internalNodes>
+          <leafValues>
+            2.0816099643707275e-01 -1.2115559726953506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -4.1416451334953308e-02</internalNodes>
+          <leafValues>
+            -8.2437807321548462e-01 3.3329188823699951e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-1.0492420196533203e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 413 9.0962520334869623e-04</internalNodes>
+          <leafValues>
+            8.4579966962337494e-02 -5.6118410825729370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -5.6139789521694183e-02</internalNodes>
+          <leafValues>
+            1.5341749787330627e-01 -2.6967319846153259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 1.0292009683325887e-03</internalNodes>
+          <leafValues>
+            -2.0489980280399323e-01 2.0153179764747620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 2.8783010784536600e-03</internalNodes>
+          <leafValues>
+            -1.7351140081882477e-01 2.1297949552536011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 -7.4144392274320126e-03</internalNodes>
+          <leafValues>
+            -5.9624868631362915e-01 4.7077950090169907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -1.4831849839538336e-03</internalNodes>
+          <leafValues>
+            1.9024610519409180e-01 -1.5986390411853790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 4.5968941412866116e-03</internalNodes>
+          <leafValues>
+            3.1447131186723709e-02 -6.8694341182708740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 2.4255330208688974e-03</internalNodes>
+          <leafValues>
+            -2.3609359562397003e-01 1.1036109924316406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -8.4950566291809082e-02</internalNodes>
+          <leafValues>
+            2.3107160627841949e-01 -1.3776530325412750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -5.0145681016147137e-03</internalNodes>
+          <leafValues>
+            3.8676109910011292e-01 -5.6217379868030548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -2.1482061129063368e-03</internalNodes>
+          <leafValues>
+            1.8191599845886230e-01 -1.7615699768066406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 -1.0396770201623440e-02</internalNodes>
+          <leafValues>
+            -7.5351381301879883e-01 2.4091970175504684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 -1.3466750271618366e-02</internalNodes>
+          <leafValues>
+            -7.2118860483169556e-01 3.4949369728565216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 -8.4435477852821350e-02</internalNodes>
+          <leafValues>
+            -3.3792638778686523e-01 7.1113817393779755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 2.4771490134298801e-03</internalNodes>
+          <leafValues>
+            -1.1765109747648239e-01 2.2541989386081696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 1.5828050673007965e-02</internalNodes>
+          <leafValues>
+            -6.9536216557025909e-02 3.1395369768142700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 6.4916983246803284e-02</internalNodes>
+          <leafValues>
+            -7.5043588876724243e-02 4.0677338838577271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 2.9652469675056636e-04</internalNodes>
+          <leafValues>
+            7.3953360319137573e-02 -3.4544008970260620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 1.3129520229995251e-03</internalNodes>
+          <leafValues>
+            -1.6909439861774445e-01 1.5258370339870453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 -5.8032129891216755e-03</internalNodes>
+          <leafValues>
+            3.5260149836540222e-01 -8.3444066345691681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -1.4791679382324219e-01</internalNodes>
+          <leafValues>
+            4.3004658818244934e-01 -5.7309929281473160e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 -1.6584150493144989e-02</internalNodes>
+          <leafValues>
+            2.3432689905166626e-01 -1.0907640308141708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 3.0183270573616028e-03</internalNodes>
+          <leafValues>
+            -1.3600939512252808e-01 2.6409289240837097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -3.6471918225288391e-02</internalNodes>
+          <leafValues>
+            -6.2809741497039795e-01 4.3545108288526535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -7.3119226726703346e-05</internalNodes>
+          <leafValues>
+            1.6470630466938019e-01 -1.6463780403137207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 -3.6719450727105141e-03</internalNodes>
+          <leafValues>
+            -4.7421360015869141e-01 4.8586919903755188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 -4.0151178836822510e-03</internalNodes>
+          <leafValues>
+            1.8222180008888245e-01 -1.4097510278224945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 1.9948020577430725e-02</internalNodes>
+          <leafValues>
+            -6.9787658751010895e-02 3.6707460880279541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 7.6699437340721488e-04</internalNodes>
+          <leafValues>
+            5.5729299783706665e-02 -4.4585430622100830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -1.1806039838120341e-03</internalNodes>
+          <leafValues>
+            -4.6876621246337891e-01 4.8902221024036407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 1.5847349539399147e-02</internalNodes>
+          <leafValues>
+            -1.2120209634304047e-01 2.0566530525684357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -1.1985700111836195e-03</internalNodes>
+          <leafValues>
+            2.0262099802494049e-01 -1.2823820114135742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -1.0964959859848022e-01</internalNodes>
+          <leafValues>
+            -8.6619192361831665e-01 3.0351849272847176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 -9.2532606795430183e-03</internalNodes>
+          <leafValues>
+            2.9343119263648987e-01 -8.5361950099468231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 1.4686530455946922e-02</internalNodes>
+          <leafValues>
+            3.2798621803522110e-02 -7.7556562423706055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -1.3514430029317737e-03</internalNodes>
+          <leafValues>
+            2.4426999688148499e-01 -1.1503250151872635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 -4.3728090822696686e-03</internalNodes>
+          <leafValues>
+            2.1687670052051544e-01 -1.3984480500221252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 3.4263390116393566e-03</internalNodes>
+          <leafValues>
+            4.5614220201969147e-02 -5.4567712545394897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 -3.8404068909585476e-03</internalNodes>
+          <leafValues>
+            1.4949500560760498e-01 -1.5062509477138519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 3.7988980766385794e-03</internalNodes>
+          <leafValues>
+            -8.7301626801490784e-02 2.5481531023979187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -2.0094281062483788e-03</internalNodes>
+          <leafValues>
+            1.7259070277214050e-01 -1.4288470149040222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -2.4370709434151649e-03</internalNodes>
+          <leafValues>
+            2.6848098635673523e-01 -8.1898219883441925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 1.0485399980098009e-03</internalNodes>
+          <leafValues>
+            4.6113260090351105e-02 -4.7243279218673706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 1.7460780218243599e-03</internalNodes>
+          <leafValues>
+            -1.1030430346727371e-01 2.0379729568958282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 5.8608627878129482e-03</internalNodes>
+          <leafValues>
+            -1.5619659423828125e-01 1.5927439928054810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 -2.7724979445338249e-02</internalNodes>
+          <leafValues>
+            1.1349119991064072e-01 -2.1885140240192413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 4.7080639749765396e-02</internalNodes>
+          <leafValues>
+            -4.1688729077577591e-02 5.3630048036575317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -7.9283770173788071e-03</internalNodes>
+          <leafValues>
+            -5.3595131635665894e-01 4.4237509369850159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 -1.2880540452897549e-02</internalNodes>
+          <leafValues>
+            2.3237949609756470e-01 -1.0246250033378601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 2.3604769259691238e-02</internalNodes>
+          <leafValues>
+            -8.8291436433792114e-02 3.0561059713363647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 1.5902200713753700e-02</internalNodes>
+          <leafValues>
+            -1.2238109856843948e-01 1.7849120497703552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 7.9939495772123337e-03</internalNodes>
+          <leafValues>
+            -8.3729006350040436e-02 3.2319590449333191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 5.7100867852568626e-03</internalNodes>
+          <leafValues>
+            3.8479208946228027e-02 -6.8138152360916138e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>51</maxWeakCount>
+      <stageThreshold>-1.1122100353240967e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 466 2.2480720654129982e-03</internalNodes>
+          <leafValues>
+            -1.6416870057582855e-01 4.1648530960083008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 4.5813550241291523e-03</internalNodes>
+          <leafValues>
+            -1.2465959787368774e-01 4.0385121107101440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -1.6073239967226982e-03</internalNodes>
+          <leafValues>
+            2.6082459092140198e-01 -2.0282520353794098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 2.5205370038747787e-03</internalNodes>
+          <leafValues>
+            -1.0557229816913605e-01 3.6669111251831055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 2.4119189474731684e-03</internalNodes>
+          <leafValues>
+            -1.3877600431442261e-01 2.9959911108016968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 5.7156179100275040e-03</internalNodes>
+          <leafValues>
+            -7.7683463692665100e-02 4.8481920361518860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 3.1093840952962637e-03</internalNodes>
+          <leafValues>
+            -1.1229000240564346e-01 2.9215508699417114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -8.6836628615856171e-02</internalNodes>
+          <leafValues>
+            -3.6779600381851196e-01 7.2597242891788483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 5.2652182057499886e-03</internalNodes>
+          <leafValues>
+            -1.0890290141105652e-01 3.1791260838508606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -1.9913529977202415e-02</internalNodes>
+          <leafValues>
+            -5.3373438119888306e-01 7.0585712790489197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 3.8297839928418398e-03</internalNodes>
+          <leafValues>
+            -1.3575910031795502e-01 2.2788879275321960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 1.0431859642267227e-02</internalNodes>
+          <leafValues>
+            8.8797912001609802e-02 -4.7958970069885254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -2.0040439441800117e-02</internalNodes>
+          <leafValues>
+            1.5745539963245392e-01 -1.7771570384502411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -5.2967290394008160e-03</internalNodes>
+          <leafValues>
+            -6.8434917926788330e-01 3.5671461373567581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 -2.1624139044433832e-03</internalNodes>
+          <leafValues>
+            2.8318038582801819e-01 -9.8511278629302979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -3.5464888787828386e-04</internalNodes>
+          <leafValues>
+            -3.7077340483665466e-01 8.0932952463626862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -1.8152060511056334e-04</internalNodes>
+          <leafValues>
+            -3.2207030057907104e-01 7.7551059424877167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -2.7563021285459399e-04</internalNodes>
+          <leafValues>
+            -3.2441279292106628e-01 8.7949477136135101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 6.3823810778558254e-03</internalNodes>
+          <leafValues>
+            -8.8924713432788849e-02 3.1727218627929688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 1.1150909587740898e-02</internalNodes>
+          <leafValues>
+            7.1019843220710754e-02 -4.0494039654731750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -1.0593760525807738e-03</internalNodes>
+          <leafValues>
+            2.6050668954849243e-01 -1.1765640228986740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 2.3906480055302382e-03</internalNodes>
+          <leafValues>
+            -8.4388621151447296e-02 3.1230551004409790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -1.1000749655067921e-02</internalNodes>
+          <leafValues>
+            1.9152249395847321e-01 -1.5210020542144775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -2.4643228971399367e-04</internalNodes>
+          <leafValues>
+            -3.1765159964561462e-01 8.6582258343696594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 2.3053269833326340e-02</internalNodes>
+          <leafValues>
+            -1.0089760273694992e-01 2.5769290328025818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -2.2135660983622074e-03</internalNodes>
+          <leafValues>
+            4.5689210295677185e-01 -5.2404791116714478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -9.7139709396287799e-04</internalNodes>
+          <leafValues>
+            -3.5518380999565125e-01 8.0094382166862488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 1.5676229959353805e-03</internalNodes>
+          <leafValues>
+            1.0091420263051987e-01 -2.1603040397167206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 7.5460801599547267e-04</internalNodes>
+          <leafValues>
+            5.7896178215742111e-02 -4.0461111068725586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 -2.0698970183730125e-02</internalNodes>
+          <leafValues>
+            3.1543630361557007e-01 -8.0713048577308655e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -2.0619940012693405e-02</internalNodes>
+          <leafValues>
+            2.7181661128997803e-01 -7.6358616352081299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 2.1611129865050316e-02</internalNodes>
+          <leafValues>
+            3.9493449032306671e-02 -5.9429651498794556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 6.5676742233335972e-03</internalNodes>
+          <leafValues>
+            -9.8353669047355652e-02 2.3649279773235321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 -8.8434796780347824e-03</internalNodes>
+          <leafValues>
+            -5.2523428201675415e-01 4.3099921196699142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -9.4260741025209427e-03</internalNodes>
+          <leafValues>
+            2.4665130674839020e-01 -9.4130717217922211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 -1.9830230157822371e-03</internalNodes>
+          <leafValues>
+            2.6743701100349426e-01 -9.0069316327571869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -1.7358399927616119e-03</internalNodes>
+          <leafValues>
+            1.5940019488334656e-01 -1.5789410471916199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -1.3513869605958462e-02</internalNodes>
+          <leafValues>
+            4.0792331099510193e-01 -6.4223118126392365e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 -1.9394010305404663e-02</internalNodes>
+          <leafValues>
+            1.8015649914741516e-01 -1.3731400668621063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -3.2684770412743092e-03</internalNodes>
+          <leafValues>
+            2.9080390930175781e-01 -8.0161906778812408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 4.1773589327931404e-04</internalNodes>
+          <leafValues>
+            -2.1412980556488037e-01 1.1273439973592758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -7.6351119205355644e-03</internalNodes>
+          <leafValues>
+            -4.5365959405899048e-01 5.4625060409307480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -8.3652976900339127e-03</internalNodes>
+          <leafValues>
+            2.6472920179367065e-01 -9.4334110617637634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 2.7768449857831001e-02</internalNodes>
+          <leafValues>
+            -1.0136710107326508e-01 2.0743979513645172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -5.4891228675842285e-02</internalNodes>
+          <leafValues>
+            2.8840309381484985e-01 -7.5312040746212006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 2.5793339591473341e-03</internalNodes>
+          <leafValues>
+            -1.1088529974222183e-01 2.1724960207939148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 6.6196516854688525e-05</internalNodes>
+          <leafValues>
+            -1.8872100114822388e-01 1.4440689980983734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 5.0907251425087452e-03</internalNodes>
+          <leafValues>
+            -7.7601231634616852e-02 2.9398378729820251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -1.0444259643554688e-01</internalNodes>
+          <leafValues>
+            2.0133109390735626e-01 -1.0903970152139664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -6.7273090826347470e-04</internalNodes>
+          <leafValues>
+            1.7945900559425354e-01 -1.2023670226335526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 3.2412849832326174e-03</internalNodes>
+          <leafValues>
+            4.0688131004571915e-02 -5.4600572586059570e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.2529590129852295e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 517 5.2965320646762848e-03</internalNodes>
+          <leafValues>
+            -1.2154529988765717e-01 6.4420372247695923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 -2.5326260365545750e-03</internalNodes>
+          <leafValues>
+            5.1233220100402832e-01 -1.1108259856700897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -2.9183230362832546e-03</internalNodes>
+          <leafValues>
+            -5.0615429878234863e-01 1.1501979827880859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 -2.3692339658737183e-02</internalNodes>
+          <leafValues>
+            3.7167280912399292e-01 -1.4672680199146271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 2.0177470520138741e-02</internalNodes>
+          <leafValues>
+            -1.7388840019702911e-01 4.7759491205215454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 -2.1723210811614990e-02</internalNodes>
+          <leafValues>
+            -4.3880090117454529e-01 1.3576899468898773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 2.8369780629873276e-03</internalNodes>
+          <leafValues>
+            -1.2512069940567017e-01 4.6789029240608215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 2.7148420922458172e-03</internalNodes>
+          <leafValues>
+            -8.8018856942653656e-02 3.6866518855094910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 3.2625689636915922e-03</internalNodes>
+          <leafValues>
+            -8.5335306823253632e-02 5.1644730567932129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -3.5618850961327553e-03</internalNodes>
+          <leafValues>
+            -4.4503930211067200e-01 9.1738171875476837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 1.9227749435231090e-03</internalNodes>
+          <leafValues>
+            -1.1077310144901276e-01 3.9416998624801636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -3.5111969918943942e-04</internalNodes>
+          <leafValues>
+            -3.7775701284408569e-01 1.2166170030832291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 1.9121779769193381e-04</internalNodes>
+          <leafValues>
+            7.4816018342971802e-02 -4.0767100453376770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -2.6525629800744355e-04</internalNodes>
+          <leafValues>
+            -3.3151718974113464e-01 1.1291120201349258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 2.0086700096726418e-02</internalNodes>
+          <leafValues>
+            -6.1598118394613266e-02 5.6128817796707153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 3.6783248186111450e-02</internalNodes>
+          <leafValues>
+            -6.0251388698816299e-02 5.2192491292953491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 1.3941619545221329e-03</internalNodes>
+          <leafValues>
+            -3.5503050684928894e-01 1.0863020271062851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -1.5181669965386391e-02</internalNodes>
+          <leafValues>
+            2.2739650309085846e-01 -1.6252990067005157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 4.6796840615570545e-03</internalNodes>
+          <leafValues>
+            -5.7535041123628616e-02 4.8124238848686218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 -1.7988319450523704e-04</internalNodes>
+          <leafValues>
+            -3.0587670207023621e-01 1.0868159681558609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -3.5850999411195517e-03</internalNodes>
+          <leafValues>
+            3.8596940040588379e-01 -9.2194072902202606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 1.0793360415846109e-03</internalNodes>
+          <leafValues>
+            -1.1190389841794968e-01 3.1125208735466003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 7.3285802500322461e-05</internalNodes>
+          <leafValues>
+            -2.0239910483360291e-01 1.5586680173873901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 1.3678739964962006e-01</internalNodes>
+          <leafValues>
+            -2.1672859787940979e-01 1.4420390129089355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -1.1729259975254536e-02</internalNodes>
+          <leafValues>
+            4.3503770232200623e-01 -7.4886530637741089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 3.9230841211974621e-03</internalNodes>
+          <leafValues>
+            -5.0289329141378403e-02 5.8831161260604858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 -2.9819121118634939e-04</internalNodes>
+          <leafValues>
+            -3.8232401013374329e-01 9.2451132833957672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -4.7992770560085773e-03</internalNodes>
+          <leafValues>
+            4.8488789796829224e-01 -7.3136523365974426e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -3.0155890271998942e-04</internalNodes>
+          <leafValues>
+            -3.5757359862327576e-01 1.0581880062818527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 1.0390769690275192e-02</internalNodes>
+          <leafValues>
+            5.2920468151569366e-02 -5.7249659299850464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -9.4488041941076517e-04</internalNodes>
+          <leafValues>
+            4.4966828823089600e-01 -8.3075523376464844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 1.2651870492845774e-03</internalNodes>
+          <leafValues>
+            -9.6695438027381897e-02 3.1302270293235779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 1.7094539478421211e-02</internalNodes>
+          <leafValues>
+            -8.1248976290225983e-02 3.6113831400871277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 2.5973359588533640e-03</internalNodes>
+          <leafValues>
+            -1.1338350176811218e-01 2.2233949601650238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 1.4527440071105957e-03</internalNodes>
+          <leafValues>
+            6.9750443100929260e-02 -3.6720710992813110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 4.7638658434152603e-03</internalNodes>
+          <leafValues>
+            -6.5788961946964264e-02 3.8328540325164795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -6.2501081265509129e-03</internalNodes>
+          <leafValues>
+            -7.0754468441009521e-01 3.8350198417901993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -3.1765329185873270e-03</internalNodes>
+          <leafValues>
+            1.3755400478839874e-01 -2.3240029811859131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 3.2191169448196888e-03</internalNodes>
+          <leafValues>
+            -1.2935450673103333e-01 2.2737880051136017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -5.6365579366683960e-03</internalNodes>
+          <leafValues>
+            3.8067150115966797e-01 -6.7246839404106140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 -2.3844049428589642e-04</internalNodes>
+          <leafValues>
+            -3.1122380495071411e-01 8.3838358521461487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 -4.1017560288310051e-03</internalNodes>
+          <leafValues>
+            2.6067280769348145e-01 -1.0449740290641785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 1.3336989795789123e-03</internalNodes>
+          <leafValues>
+            -5.8250140398740768e-02 4.7682440280914307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 -1.2090239906683564e-03</internalNodes>
+          <leafValues>
+            1.4834509789943695e-01 -1.7329469323158264e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>72</maxWeakCount>
+      <stageThreshold>-1.1188739538192749e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 561 -3.1760931015014648e-03</internalNodes>
+          <leafValues>
+            3.3333331346511841e-01 -1.6642349958419800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 2.4858079850673676e-02</internalNodes>
+          <leafValues>
+            -7.2728872299194336e-02 5.6674581766128540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 -7.7597280032932758e-03</internalNodes>
+          <leafValues>
+            4.6258568763732910e-01 -9.3112178146839142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 7.8239021822810173e-03</internalNodes>
+          <leafValues>
+            -2.7414610981941223e-01 1.3243049383163452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -1.0948839597404003e-02</internalNodes>
+          <leafValues>
+            2.2345480322837830e-01 -1.4965449273586273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -3.4349008928984404e-03</internalNodes>
+          <leafValues>
+            3.8724988698959351e-01 -6.6121727228164673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 -3.1156290322542191e-02</internalNodes>
+          <leafValues>
+            2.4078279733657837e-01 -1.1406909674406052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 1.1100519914180040e-03</internalNodes>
+          <leafValues>
+            -2.8207978606224060e-01 1.3275429606437683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 3.1762740109115839e-03</internalNodes>
+          <leafValues>
+            3.4585930407047272e-02 -5.1374310255050659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -2.7977459132671356e-02</internalNodes>
+          <leafValues>
+            2.3926779627799988e-01 -1.3255919516086578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 -2.3097939789295197e-02</internalNodes>
+          <leafValues>
+            3.9019620418548584e-01 -7.8478008508682251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -3.9731930010020733e-03</internalNodes>
+          <leafValues>
+            3.0691069364547729e-01 -7.0601403713226318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 3.0335749033838511e-03</internalNodes>
+          <leafValues>
+            -1.4002190530300140e-01 1.9134859740734100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -1.0844370350241661e-02</internalNodes>
+          <leafValues>
+            1.6548730432987213e-01 -1.5657779574394226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 -1.8150510266423225e-02</internalNodes>
+          <leafValues>
+            -6.3243591785430908e-01 3.9561819285154343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 7.1052298881113529e-04</internalNodes>
+          <leafValues>
+            -1.8515570461750031e-01 1.3408809900283813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 1.0893340222537518e-02</internalNodes>
+          <leafValues>
+            -2.6730230078101158e-02 6.0971802473068237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -2.8780900174751878e-04</internalNodes>
+          <leafValues>
+            -3.0065140128135681e-01 7.3171459138393402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -3.5855069290846586e-03</internalNodes>
+          <leafValues>
+            2.6217609643936157e-01 -7.9714097082614899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 -1.9759280607104301e-02</internalNodes>
+          <leafValues>
+            -5.9039229154586792e-01 4.0698971599340439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -1.0845210403203964e-02</internalNodes>
+          <leafValues>
+            1.6364559531211853e-01 -1.2586060166358948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -4.3183090165257454e-03</internalNodes>
+          <leafValues>
+            -5.7474881410598755e-01 3.7644311785697937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 1.4913700288161635e-03</internalNodes>
+          <leafValues>
+            6.0913469642400742e-02 -3.0222928524017334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 1.5675699338316917e-02</internalNodes>
+          <leafValues>
+            -7.3145911097526550e-02 2.9379451274871826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -1.1033560149371624e-02</internalNodes>
+          <leafValues>
+            3.9318808913230896e-01 -4.7084320336580276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 8.8555756956338882e-03</internalNodes>
+          <leafValues>
+            3.7601381540298462e-02 -4.9108490347862244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 -8.9665671112015843e-04</internalNodes>
+          <leafValues>
+            1.7952020466327667e-01 -1.1086239665746689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -3.0592409893870354e-03</internalNodes>
+          <leafValues>
+            -4.4429460167884827e-01 5.1005430519580841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 6.3201179727911949e-03</internalNodes>
+          <leafValues>
+            -5.2841089665889740e-02 3.7197101116180420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 2.0682830363512039e-02</internalNodes>
+          <leafValues>
+            5.7667169719934464e-02 -3.6901599168777466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 9.9822662770748138e-02</internalNodes>
+          <leafValues>
+            -3.7377018481492996e-02 5.8165591955184937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 -6.5854229032993317e-03</internalNodes>
+          <leafValues>
+            2.8509441018104553e-01 -6.0978069901466370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -6.0900300741195679e-02</internalNodes>
+          <leafValues>
+            -5.1031768321990967e-01 3.7787400186061859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 -2.9991709161549807e-03</internalNodes>
+          <leafValues>
+            -4.7943010926246643e-01 3.8833890110254288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 -9.8906438797712326e-03</internalNodes>
+          <leafValues>
+            4.0609079599380493e-01 -4.7869648784399033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -8.2688927650451660e-02</internalNodes>
+          <leafValues>
+            -7.0671182870864868e-01 2.7487749233841896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 5.0060399807989597e-03</internalNodes>
+          <leafValues>
+            2.8208440169692039e-02 -5.2909690141677856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 6.1695030890405178e-03</internalNodes>
+          <leafValues>
+            -5.4554861038923264e-02 3.2837980985641479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 -3.3914761152118444e-03</internalNodes>
+          <leafValues>
+            9.2117667198181152e-02 -2.1637110412120819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -2.6131230406463146e-03</internalNodes>
+          <leafValues>
+            1.3651019334793091e-01 -1.3781130313873291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 8.0490659456700087e-04</internalNodes>
+          <leafValues>
+            -6.8637110292911530e-02 3.3581069111824036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 -3.8106508553028107e-02</internalNodes>
+          <leafValues>
+            2.9445430636405945e-01 -6.8239226937294006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 7.2450799052603543e-05</internalNodes>
+          <leafValues>
+            -1.6750130057334900e-01 1.2178230285644531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 1.5837959945201874e-03</internalNodes>
+          <leafValues>
+            -9.2042848467826843e-02 2.1348990499973297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 1.2924340553581715e-03</internalNodes>
+          <leafValues>
+            6.2917232513427734e-02 -3.6174508929252625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 9.9146775901317596e-03</internalNodes>
+          <leafValues>
+            1.9534060731530190e-02 -8.1015038490295410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 -1.7086310544982553e-03</internalNodes>
+          <leafValues>
+            2.5525239109992981e-01 -6.8229459226131439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 2.1844399161636829e-03</internalNodes>
+          <leafValues>
+            2.3314049467444420e-02 -8.4296780824661255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 -3.4244330599904060e-03</internalNodes>
+          <leafValues>
+            2.7213689684867859e-01 -7.6395228505134583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 2.7591470279730856e-04</internalNodes>
+          <leafValues>
+            -1.0742840170860291e-01 2.2888970375061035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 -6.0005177510902286e-04</internalNodes>
+          <leafValues>
+            -2.9854211211204529e-01 6.3479736447334290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -2.5001438916660845e-04</internalNodes>
+          <leafValues>
+            -2.7178969979286194e-01 6.9615006446838379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 6.8751391954720020e-03</internalNodes>
+          <leafValues>
+            -5.7185899466276169e-02 3.6695951223373413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 1.2761900201439857e-02</internalNodes>
+          <leafValues>
+            6.7955687642097473e-02 -2.8534150123596191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -1.4752789866179228e-03</internalNodes>
+          <leafValues>
+            2.0680660009384155e-01 -1.0059390217065811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 1.2138819694519043e-01</internalNodes>
+          <leafValues>
+            -9.7126796841621399e-02 1.9789619743824005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -5.0081279128789902e-02</internalNodes>
+          <leafValues>
+            2.8417178988456726e-01 -6.7879997193813324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 3.1454950571060181e-02</internalNodes>
+          <leafValues>
+            -8.9468672871589661e-02 2.1298420429229736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 1.8878319533541799e-03</internalNodes>
+          <leafValues>
+            -1.1656440049409866e-01 1.6663520038127899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -5.7211960665881634e-03</internalNodes>
+          <leafValues>
+            2.3702140152454376e-01 -9.0776607394218445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 -1.8076719425152987e-04</internalNodes>
+          <leafValues>
+            1.7951929569244385e-01 -1.0793480277061462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 -1.9761849939823151e-01</internalNodes>
+          <leafValues>
+            4.5674291253089905e-01 -4.0480159223079681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -2.3846809926908463e-04</internalNodes>
+          <leafValues>
+            -2.3733009397983551e-01 7.5922161340713501e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 2.1540730085689574e-04</internalNodes>
+          <leafValues>
+            8.1688016653060913e-02 -2.8685030341148376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 1.0163090191781521e-02</internalNodes>
+          <leafValues>
+            -4.1250020265579224e-02 4.8038348555564880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -7.2184870950877666e-03</internalNodes>
+          <leafValues>
+            1.7458580434322357e-01 -1.0146500170230865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 2.4263170361518860e-01</internalNodes>
+          <leafValues>
+            5.3426481783390045e-02 -3.2318529486656189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 6.9304101634770632e-04</internalNodes>
+          <leafValues>
+            -1.1499179899692535e-01 1.4793939888477325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 3.5475199110805988e-03</internalNodes>
+          <leafValues>
+            -3.9424978196620941e-02 5.3126180171966553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 2.1403690334409475e-04</internalNodes>
+          <leafValues>
+            6.9753833115100861e-02 -2.7319580316543579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 -5.7119462871924043e-04</internalNodes>
+          <leafValues>
+            3.4369900822639465e-01 -5.7699009776115417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -6.6290069371461868e-03</internalNodes>
+          <leafValues>
+            1.1758489906787872e-01 -1.5020139515399933e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>66</maxWeakCount>
+      <stageThreshold>-1.0888810157775879e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 633 -2.6513449847698212e-02</internalNodes>
+          <leafValues>
+            2.0568640530109406e-01 -2.6473900675773621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 9.7727458924055099e-03</internalNodes>
+          <leafValues>
+            -1.1192840337753296e-01 3.2570549845695496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 3.2290350645780563e-02</internalNodes>
+          <leafValues>
+            -9.8574757575988770e-02 3.1779170036315918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -2.8103240765631199e-03</internalNodes>
+          <leafValues>
+            1.5213899314403534e-01 -1.9686409831047058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -1.0991429910063744e-02</internalNodes>
+          <leafValues>
+            5.1407659053802490e-01 -4.3707210570573807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 6.3133831135928631e-03</internalNodes>
+          <leafValues>
+            -9.2781022191047668e-02 3.4702470898628235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 8.7105982005596161e-02</internalNodes>
+          <leafValues>
+            3.0053649097681046e-02 -8.2814818620681763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 1.1799359926953912e-03</internalNodes>
+          <leafValues>
+            -1.2928420305252075e-01 2.0646120607852936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 -9.3056890182197094e-04</internalNodes>
+          <leafValues>
+            -5.0021439790725708e-01 9.3666993081569672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -1.3687170110642910e-02</internalNodes>
+          <leafValues>
+            -7.9358148574829102e-01 -6.6733639687299728e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -7.5917452573776245e-02</internalNodes>
+          <leafValues>
+            3.0469641089439392e-01 -7.9655893146991730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -2.8559709899127483e-03</internalNodes>
+          <leafValues>
+            2.0961460471153259e-01 -1.2732550501823425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -4.0231510065495968e-03</internalNodes>
+          <leafValues>
+            -6.5817278623580933e-01 5.0683639943599701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 1.7558040097355843e-02</internalNodes>
+          <leafValues>
+            -8.5382692515850067e-02 3.6174559593200684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 2.1988239139318466e-02</internalNodes>
+          <leafValues>
+            6.2943696975708008e-02 -7.0896339416503906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 -2.8599589131772518e-03</internalNodes>
+          <leafValues>
+            1.4683780074119568e-01 -1.6465979814529419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -1.0030849836766720e-02</internalNodes>
+          <leafValues>
+            4.9579939246177673e-01 -2.7188340201973915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 -6.9560329429805279e-03</internalNodes>
+          <leafValues>
+            2.7977779507637024e-01 -7.7953331172466278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -3.8356808945536613e-03</internalNodes>
+          <leafValues>
+            -5.8163982629776001e-01 3.5739939659833908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -3.2647319603711367e-03</internalNodes>
+          <leafValues>
+            -4.9945080280303955e-01 4.6986490488052368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -7.8412350267171860e-03</internalNodes>
+          <leafValues>
+            3.4532830119132996e-01 -6.8810403347015381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 -8.1718113506212831e-05</internalNodes>
+          <leafValues>
+            1.5041710436344147e-01 -1.4146679639816284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -3.2448628917336464e-03</internalNodes>
+          <leafValues>
+            2.2724510729312897e-01 -9.2860206961631775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -7.8561151167377830e-04</internalNodes>
+          <leafValues>
+            -4.4319018721580505e-01 5.7812441140413284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -6.2474247533828020e-04</internalNodes>
+          <leafValues>
+            1.3952389359474182e-01 -1.4668719470500946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -3.2942948746494949e-04</internalNodes>
+          <leafValues>
+            -2.9901570081710815e-01 7.6066739857196808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 1.2605739757418633e-03</internalNodes>
+          <leafValues>
+            -1.6125600039958954e-01 1.3953800499439240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 -5.1667019724845886e-02</internalNodes>
+          <leafValues>
+            -5.3142839670181274e-01 4.0719520300626755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -1.5285619534552097e-02</internalNodes>
+          <leafValues>
+            -7.8206378221511841e-01 2.7183769270777702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 6.9029822945594788e-02</internalNodes>
+          <leafValues>
+            -3.6427021026611328e-02 7.1102517843246460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 1.4522749697789550e-03</internalNodes>
+          <leafValues>
+            -9.6890516579151154e-02 2.1668420732021332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -2.4765590205788612e-03</internalNodes>
+          <leafValues>
+            1.1645310372114182e-01 -1.8227979540824890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 -1.5134819550439715e-03</internalNodes>
+          <leafValues>
+            1.7863979935646057e-01 -1.2214969843626022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -1.5099470037966967e-03</internalNodes>
+          <leafValues>
+            1.8086239695549011e-01 -1.1446069926023483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 -6.7054620012640953e-03</internalNodes>
+          <leafValues>
+            2.5106599926948547e-01 -9.1871462762355804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 -1.4075200073421001e-02</internalNodes>
+          <leafValues>
+            1.3707509636878967e-01 -1.7333500087261200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -2.2400720044970512e-03</internalNodes>
+          <leafValues>
+            4.0092980861663818e-01 -4.7576878219842911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 1.9782369956374168e-02</internalNodes>
+          <leafValues>
+            -1.9040350615978241e-01 1.4923410117626190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 2.6002870872616768e-03</internalNodes>
+          <leafValues>
+            4.6971768140792847e-02 -4.3307659029960632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 -5.3445628145709634e-04</internalNodes>
+          <leafValues>
+            -4.3744230270385742e-01 4.1520189493894577e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -1.7466509714722633e-02</internalNodes>
+          <leafValues>
+            6.5818172693252563e-01 -3.4447491168975830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -2.0425589755177498e-03</internalNodes>
+          <leafValues>
+            3.9657929539680481e-01 -4.4052429497241974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 2.6661779265850782e-03</internalNodes>
+          <leafValues>
+            5.8770958334207535e-02 -3.2806369662284851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -5.5982369929552078e-02</internalNodes>
+          <leafValues>
+            -5.1735472679138184e-01 3.5791840404272079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -1.5066330088302493e-03</internalNodes>
+          <leafValues>
+            1.5123869478702545e-01 -1.2520180642604828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 -1.1472369544208050e-02</internalNodes>
+          <leafValues>
+            -6.2930530309677124e-01 3.4704331308603287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 2.3409629240632057e-02</internalNodes>
+          <leafValues>
+            -5.8063350617885590e-02 3.8668221235275269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -2.3243729956448078e-03</internalNodes>
+          <leafValues>
+            1.8754099309444427e-01 -9.8394669592380524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 -2.9039299115538597e-02</internalNodes>
+          <leafValues>
+            -5.4486900568008423e-01 4.0926340967416763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 -1.4474649913609028e-02</internalNodes>
+          <leafValues>
+            -6.7248392105102539e-01 2.3128850385546684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 -5.2086091600358486e-03</internalNodes>
+          <leafValues>
+            -4.3271440267562866e-01 4.3780650943517685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 4.9382899887859821e-03</internalNodes>
+          <leafValues>
+            -1.0878620296716690e-01 1.9342589378356934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -4.3193930760025978e-03</internalNodes>
+          <leafValues>
+            2.4080930650234222e-01 -1.0380800068378448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 2.3705669445917010e-04</internalNodes>
+          <leafValues>
+            -8.7349072098731995e-02 2.0466239750385284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 4.7858079778961837e-04</internalNodes>
+          <leafValues>
+            4.5624580234289169e-02 -3.8854670524597168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -8.5342838428914547e-04</internalNodes>
+          <leafValues>
+            -5.5077940225601196e-01 3.5825889557600021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 5.4772121075075120e-05</internalNodes>
+          <leafValues>
+            -1.1225239932537079e-01 1.7503519356250763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -3.8445889949798584e-03</internalNodes>
+          <leafValues>
+            2.4526700377464294e-01 -8.1132568418979645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 -4.0128458291292191e-02</internalNodes>
+          <leafValues>
+            -6.3122707605361938e-01 2.6972670108079910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -1.7886360001284629e-04</internalNodes>
+          <leafValues>
+            1.9855099916458130e-01 -1.0333680361509323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 1.7668239888735116e-04</internalNodes>
+          <leafValues>
+            -9.1359011828899384e-02 1.9848720729351044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 7.2763383388519287e-02</internalNodes>
+          <leafValues>
+            5.0075579434633255e-02 -3.3852630853652954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 1.0181630030274391e-02</internalNodes>
+          <leafValues>
+            -9.3229979276657104e-02 2.0059590041637421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 2.4409969337284565e-03</internalNodes>
+          <leafValues>
+            6.4636632800102234e-02 -2.6921740174293518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -3.6227488890290260e-03</internalNodes>
+          <leafValues>
+            1.3169890642166138e-01 -1.2514840066432953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -1.3635610230267048e-03</internalNodes>
+          <leafValues>
+            1.6350460052490234e-01 -1.0665939748287201e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>69</maxWeakCount>
+      <stageThreshold>-1.0408929586410522e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 699 -9.6991164609789848e-03</internalNodes>
+          <leafValues>
+            6.1125320196151733e-01 -6.6225312650203705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 -9.6426531672477722e-03</internalNodes>
+          <leafValues>
+            -1. 2.7699959464371204e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -9.6381865441799164e-03</internalNodes>
+          <leafValues>
+            1. -2.9904270195402205e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -4.2553939856588840e-03</internalNodes>
+          <leafValues>
+            2.8464388847351074e-01 -1.5540120005607605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 -9.6223521977663040e-03</internalNodes>
+          <leafValues>
+            -1. 4.3999180197715759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 -9.1231241822242737e-03</internalNodes>
+          <leafValues>
+            8.6869341135025024e-01 -2.7267890982329845e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 -8.6240433156490326e-03</internalNodes>
+          <leafValues>
+            4.5352488756179810e-01 -8.6071379482746124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -8.9324144646525383e-03</internalNodes>
+          <leafValues>
+            1.3375559449195862e-01 -2.6012519001960754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -1.4207810163497925e-02</internalNodes>
+          <leafValues>
+            3.2077640295028687e-01 -9.7226411104202271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 2.5911010801792145e-02</internalNodes>
+          <leafValues>
+            -1.2964080274105072e-01 2.6218649744987488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 2.0531509653665125e-04</internalNodes>
+          <leafValues>
+            -1.2404280155897141e-01 2.1062959730625153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 -5.4795680625829846e-05</internalNodes>
+          <leafValues>
+            1.1974299699068069e-01 -2.3201279342174530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 6.8555199541151524e-03</internalNodes>
+          <leafValues>
+            -6.3276126980781555e-02 4.1044250130653381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 -1.2253040447831154e-02</internalNodes>
+          <leafValues>
+            5.4883331060409546e-01 -3.9731100201606750e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -3.9058770053088665e-03</internalNodes>
+          <leafValues>
+            2.4190980195999146e-01 -9.7096011042594910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 2.7560980524867773e-03</internalNodes>
+          <leafValues>
+            -1.2569679319858551e-01 1.9456650316715240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -7.7662160620093346e-03</internalNodes>
+          <leafValues>
+            2.9765701293945312e-01 -9.6818156540393829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 3.8997188676148653e-04</internalNodes>
+          <leafValues>
+            6.2188401818275452e-02 -4.2040899395942688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 3.3579880837351084e-03</internalNodes>
+          <leafValues>
+            4.7498140484094620e-02 -6.3216882944107056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -1.6745539382100105e-02</internalNodes>
+          <leafValues>
+            7.1098130941390991e-01 -3.9157349616289139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -6.5409899689257145e-03</internalNodes>
+          <leafValues>
+            -3.5043171048164368e-01 7.0616953074932098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 3.0016340315341949e-04</internalNodes>
+          <leafValues>
+            9.1902457177639008e-02 -2.4618670344352722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 1.4918990433216095e-02</internalNodes>
+          <leafValues>
+            -5.1909450441598892e-02 5.6636041402816772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 4.8153079114854336e-04</internalNodes>
+          <leafValues>
+            6.4659558236598969e-02 -3.6590608954429626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 -3.0211321427486837e-04</internalNodes>
+          <leafValues>
+            1.7926569283008575e-01 -1.1410660296678543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 3.8521419628523290e-04</internalNodes>
+          <leafValues>
+            1.0345619916915894e-01 -2.0072460174560547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 8.0837132409214973e-03</internalNodes>
+          <leafValues>
+            -6.6073462367057800e-02 3.0284249782562256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 -2.2804969921708107e-02</internalNodes>
+          <leafValues>
+            5.2962350845336914e-01 -4.0118999779224396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 1.9440450705587864e-04</internalNodes>
+          <leafValues>
+            8.1854820251464844e-02 -2.4663360416889191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 -1.2848090380430222e-02</internalNodes>
+          <leafValues>
+            -3.4973311424255371e-01 5.6916229426860809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 -1.0937290498986840e-03</internalNodes>
+          <leafValues>
+            2.3368680477142334e-01 -9.1604806482791901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 1.0032650316134095e-03</internalNodes>
+          <leafValues>
+            1.1852180212736130e-01 -1.8469190597534180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -4.4688429683446884e-02</internalNodes>
+          <leafValues>
+            -6.4362460374832153e-01 3.0363269150257111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 8.1657543778419495e-03</internalNodes>
+          <leafValues>
+            4.3674658983945847e-02 -4.3002089858055115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -1.1717810295522213e-02</internalNodes>
+          <leafValues>
+            4.1781479120254517e-01 -4.8233699053525925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 8.4277130663394928e-02</internalNodes>
+          <leafValues>
+            5.3461279720067978e-02 -3.7952190637588501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 1.4211839996278286e-02</internalNodes>
+          <leafValues>
+            4.4900938868522644e-02 -4.2981499433517456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 1.5028340276330709e-03</internalNodes>
+          <leafValues>
+            8.2227639853954315e-02 -2.4706399440765381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 1.0003579780459404e-02</internalNodes>
+          <leafValues>
+            -5.7221669703722000e-02 3.4609371423721313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -9.0706320479512215e-03</internalNodes>
+          <leafValues>
+            4.5058089494705200e-01 -4.2795319110155106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -3.3141620224341750e-04</internalNodes>
+          <leafValues>
+            1.8336910009384155e-01 -1.0759949684143066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 1.9723279774188995e-01</internalNodes>
+          <leafValues>
+            -3.0363829806447029e-02 6.6423428058624268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -7.1258801035583019e-03</internalNodes>
+          <leafValues>
+            -8.9225047826766968e-01 2.5669990107417107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 8.6921341717243195e-03</internalNodes>
+          <leafValues>
+            -7.0764370262622833e-02 2.8210529685020447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 8.9262127876281738e-03</internalNodes>
+          <leafValues>
+            7.1078233420848846e-02 -3.0232560634613037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 5.7286009192466736e-02</internalNodes>
+          <leafValues>
+            5.0974130630493164e-02 -3.9196950197219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 3.7920880131423473e-03</internalNodes>
+          <leafValues>
+            3.3841941505670547e-02 -5.1016288995742798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -1.4508679741993546e-03</internalNodes>
+          <leafValues>
+            3.0879148840904236e-01 -6.3845083117485046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 9.8390132188796997e-04</internalNodes>
+          <leafValues>
+            -1.3029569387435913e-01 1.4604410529136658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -1.7221809830516577e-03</internalNodes>
+          <leafValues>
+            2.9157009720802307e-01 -6.8549558520317078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 1.0948250070214272e-02</internalNodes>
+          <leafValues>
+            3.4351408481597900e-02 -4.7702258825302124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -1.7176309484057128e-05</internalNodes>
+          <leafValues>
+            1.6055269539356232e-01 -1.1690840125083923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -5.4884208366274834e-03</internalNodes>
+          <leafValues>
+            -4.3415889143943787e-01 4.6106241643428802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 -3.0975250992923975e-03</internalNodes>
+          <leafValues>
+            3.7943339347839355e-01 -5.6860551238059998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 6.4182081259787083e-03</internalNodes>
+          <leafValues>
+            -1.5858210623264313e-01 1.2335419654846191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 1.1831239797174931e-02</internalNodes>
+          <leafValues>
+            -4.0929291397333145e-02 4.5878958702087402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 1.3540499843657017e-02</internalNodes>
+          <leafValues>
+            -5.3725559264421463e-02 3.5056120157241821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -2.5932150892913342e-03</internalNodes>
+          <leafValues>
+            1.1010520160198212e-01 -1.6752210259437561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 1.6856270376592875e-03</internalNodes>
+          <leafValues>
+            6.6574357450008392e-02 -3.0835020542144775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 2.6524690911173820e-03</internalNodes>
+          <leafValues>
+            6.6318482160568237e-02 -2.7861338853836060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -7.7341729775071144e-03</internalNodes>
+          <leafValues>
+            1.9718359410762787e-01 -1.0782919824123383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 5.0944271497428417e-03</internalNodes>
+          <leafValues>
+            8.5337489843368530e-02 -2.4847009778022766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -2.9162371065467596e-03</internalNodes>
+          <leafValues>
+            -4.7476351261138916e-01 3.3566489815711975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 3.0121419113129377e-03</internalNodes>
+          <leafValues>
+            -4.7575380653142929e-02 4.2586800456047058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 3.1694869976490736e-03</internalNodes>
+          <leafValues>
+            -1.0519450157880783e-01 1.7163459956645966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 2.2327560186386108e-01</internalNodes>
+          <leafValues>
+            -1.4370209537446499e-02 9.2483651638031006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -9.5585048198699951e-02</internalNodes>
+          <leafValues>
+            -7.4206638336181641e-01 2.7818970382213593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 3.4773729566950351e-05</internalNodes>
+          <leafValues>
+            -1.2765780091285706e-01 1.2926669418811798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 7.2459770308341831e-05</internalNodes>
+          <leafValues>
+            -1.6518579423427582e-01 1.0036809742450714e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>59</maxWeakCount>
+      <stageThreshold>-1.0566600561141968e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 768 -6.5778270363807678e-03</internalNodes>
+          <leafValues>
+            3.3815258741378784e-01 -1.5281909704208374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -1.0922809597104788e-03</internalNodes>
+          <leafValues>
+            2.2282369434833527e-01 -1.9308499991893768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -2.9759589582681656e-02</internalNodes>
+          <leafValues>
+            2.5959870219230652e-01 -1.5409409999847412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 -1.3147540390491486e-02</internalNodes>
+          <leafValues>
+            1.9033810496330261e-01 -1.6543999314308167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -1.4396329643204808e-03</internalNodes>
+          <leafValues>
+            2.0071710646152496e-01 -1.2338940054178238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -3.5928250290453434e-03</internalNodes>
+          <leafValues>
+            2.3985520005226135e-01 -1.2922149896621704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -1.5314699849113822e-03</internalNodes>
+          <leafValues>
+            -4.9014899134635925e-01 1.0275030136108398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -6.2372139655053616e-03</internalNodes>
+          <leafValues>
+            3.1214639544487000e-01 -1.1405629664659500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -3.3364649862051010e-02</internalNodes>
+          <leafValues>
+            -4.9520879983901978e-01 5.1328450441360474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 -2.2827699780464172e-02</internalNodes>
+          <leafValues>
+            3.2558828592300415e-01 -6.5089307725429535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 -8.6199097335338593e-02</internalNodes>
+          <leafValues>
+            -6.7646330595016479e-01 2.6985699310898781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -2.1065981127321720e-03</internalNodes>
+          <leafValues>
+            2.2452430427074432e-01 -1.2610229849815369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 3.9120148867368698e-02</internalNodes>
+          <leafValues>
+            1.1329399794340134e-01 -2.6860630512237549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 3.5082739777863026e-03</internalNodes>
+          <leafValues>
+            -1.1359959840774536e-01 2.5649771094322205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 5.9289898490533233e-04</internalNodes>
+          <leafValues>
+            -1.4942969381809235e-01 1.6409839689731598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 7.1766850305721164e-04</internalNodes>
+          <leafValues>
+            9.9905692040920258e-02 -2.1967969834804535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 -2.1803600713610649e-02</internalNodes>
+          <leafValues>
+            -3.1711721420288086e-01 8.2889586687088013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -3.2962779514491558e-03</internalNodes>
+          <leafValues>
+            -3.8048729300498962e-01 6.0819379985332489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 2.4196270387619734e-03</internalNodes>
+          <leafValues>
+            -9.6013016998767853e-02 2.8540581464767456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -4.4187481398694217e-04</internalNodes>
+          <leafValues>
+            2.2127939760684967e-01 -9.7434908151626587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 3.4523929934948683e-03</internalNodes>
+          <leafValues>
+            3.7553120404481888e-02 -5.7969051599502563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -2.1834600716829300e-02</internalNodes>
+          <leafValues>
+            2.9562139511108398e-01 -8.0048300325870514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 -2.1309500152710825e-04</internalNodes>
+          <leafValues>
+            2.2814509272575378e-01 -1.0114189982414246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -1.6166249988600612e-03</internalNodes>
+          <leafValues>
+            -5.0541198253631592e-01 4.4764541089534760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 7.5959609821438789e-03</internalNodes>
+          <leafValues>
+            4.5986540615558624e-02 -4.1197681427001953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 3.8601809646934271e-03</internalNodes>
+          <leafValues>
+            -8.6563169956207275e-02 2.4809999763965607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 6.0622231103479862e-03</internalNodes>
+          <leafValues>
+            -7.5557373464107513e-02 2.8433260321617126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -1.7097420059144497e-03</internalNodes>
+          <leafValues>
+            -3.5295820236206055e-01 5.8410499244928360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 1.6515579074621201e-02</internalNodes>
+          <leafValues>
+            -8.0486953258514404e-02 2.3537430167198181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 4.8465100117027760e-03</internalNodes>
+          <leafValues>
+            4.1895218193531036e-02 -4.8443049192428589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 -3.1167170032858849e-02</internalNodes>
+          <leafValues>
+            1.9192309677600861e-01 -1.0268159955739975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 6.1892281519249082e-04</internalNodes>
+          <leafValues>
+            -2.1085770428180695e-01 9.3886926770210266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 1.1946310289204121e-02</internalNodes>
+          <leafValues>
+            3.9096169173717499e-02 -6.2248629331588745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 -7.5677200220525265e-03</internalNodes>
+          <leafValues>
+            1.5936839580535889e-01 -1.2250780314207077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 -5.3747411817312241e-02</internalNodes>
+          <leafValues>
+            -5.5622178316116333e-01 4.1190009564161301e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 1.5513530001044273e-02</internalNodes>
+          <leafValues>
+            -3.9826881140470505e-02 6.2400728464126587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 1.5246650436893106e-03</internalNodes>
+          <leafValues>
+            7.0138677954673767e-02 -3.0789071321487427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 -4.8315100139006972e-04</internalNodes>
+          <leafValues>
+            1.7887659370899200e-01 -1.0958620160818100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 2.7374739293009043e-03</internalNodes>
+          <leafValues>
+            2.7478590607643127e-02 -8.8489568233489990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -6.5787717700004578e-02</internalNodes>
+          <leafValues>
+            -4.6432140469551086e-01 3.5037148743867874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 1.2409730115905404e-03</internalNodes>
+          <leafValues>
+            -9.6479237079620361e-02 2.8779220581054688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 8.1398809561505914e-04</internalNodes>
+          <leafValues>
+            1.1511719971895218e-01 -1.6766160726547241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 2.3901820182800293e-02</internalNodes>
+          <leafValues>
+            -3.2603189349174500e-02 6.0017347335815430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 2.7556600049138069e-02</internalNodes>
+          <leafValues>
+            -6.6137343645095825e-02 2.9994478821754456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 -3.8070970913395286e-04</internalNodes>
+          <leafValues>
+            -3.3881181478500366e-01 6.4450770616531372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -1.3335429830476642e-03</internalNodes>
+          <leafValues>
+            1.4588660001754761e-01 -1.3217620551586151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -9.3507990241050720e-03</internalNodes>
+          <leafValues>
+            -5.1177829504013062e-01 3.4969471395015717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 7.6215229928493500e-03</internalNodes>
+          <leafValues>
+            2.3249529302120209e-02 -6.9619411230087280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -5.3407860832521692e-05</internalNodes>
+          <leafValues>
+            2.3727379739284515e-01 -8.6910709738731384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.5332329785451293e-03</internalNodes>
+          <leafValues>
+            1.9228410720825195e-01 -1.0422399640083313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 4.3135890737175941e-03</internalNodes>
+          <leafValues>
+            -9.6219547092914581e-02 2.5601211190223694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -2.3042880638968199e-04</internalNodes>
+          <leafValues>
+            -3.1564751267433167e-01 5.8838598430156708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 -7.8411828726530075e-03</internalNodes>
+          <leafValues>
+            -6.6340929269790649e-01 2.4500999599695206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 1.7103740572929382e-01</internalNodes>
+          <leafValues>
+            3.3831499516963959e-02 -4.5615941286087036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -1.6011140542104840e-03</internalNodes>
+          <leafValues>
+            2.1574890613555908e-01 -8.3622530102729797e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 -1.0535780340433121e-02</internalNodes>
+          <leafValues>
+            2.4552319943904877e-01 -8.2384489476680756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 -5.8351638726890087e-03</internalNodes>
+          <leafValues>
+            -4.7807329893112183e-01 4.4086221605539322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -1.8706109374761581e-02</internalNodes>
+          <leafValues>
+            -6.0024029016494751e-01 2.1410040557384491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -9.3307439237833023e-04</internalNodes>
+          <leafValues>
+            2.4323590099811554e-01 -7.4165716767311096e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>88</maxWeakCount>
+      <stageThreshold>-9.7693431377410889e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 827 1.0646229609847069e-02</internalNodes>
+          <leafValues>
+            -1.3861389458179474e-01 2.6494070887565613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 3.5298269242048264e-02</internalNodes>
+          <leafValues>
+            -7.5821727514266968e-02 3.9021068811416626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 7.5638387352228165e-04</internalNodes>
+          <leafValues>
+            -9.5521442592144012e-02 2.9061999917030334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 9.2497706413269043e-02</internalNodes>
+          <leafValues>
+            -2.7704238891601562e-01 7.9474702477455139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -2.9340879991650581e-03</internalNodes>
+          <leafValues>
+            2.2989539802074432e-01 -7.8550010919570923e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 -8.6535848677158356e-02</internalNodes>
+          <leafValues>
+            4.7744810581207275e-01 -6.8231220357120037e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 5.4699288739357144e-05</internalNodes>
+          <leafValues>
+            -2.2642609477043152e-01 8.8192112743854523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -3.6592520773410797e-02</internalNodes>
+          <leafValues>
+            2.7353870868682861e-01 -9.8606742918491364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 2.6469118893146515e-03</internalNodes>
+          <leafValues>
+            -4.4083978980779648e-02 3.1445288658142090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -4.4271810911595821e-03</internalNodes>
+          <leafValues>
+            2.3822729289531708e-01 -8.6784273386001587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -5.1882481202483177e-03</internalNodes>
+          <leafValues>
+            1.5042769908905029e-01 -1.2672109901905060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 4.5530400238931179e-03</internalNodes>
+          <leafValues>
+            -5.5945020169019699e-02 3.6501631140708923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 1.4562410302460194e-02</internalNodes>
+          <leafValues>
+            3.6397770047187805e-02 -5.3559190034866333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 6.8677567469421774e-05</internalNodes>
+          <leafValues>
+            -1.7479629814624786e-01 1.1068709939718246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -5.9744901955127716e-03</internalNodes>
+          <leafValues>
+            3.1077870726585388e-01 -6.6530227661132812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -5.8691250160336494e-03</internalNodes>
+          <leafValues>
+            -3.1901490688323975e-01 6.3931830227375031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 -1.1140310205519199e-02</internalNodes>
+          <leafValues>
+            2.4364790320396423e-01 -8.0935180187225342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 -5.8643531054258347e-02</internalNodes>
+          <leafValues>
+            -7.6083260774612427e-01 3.0809629708528519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 -4.6097282320261002e-03</internalNodes>
+          <leafValues>
+            -4.5315021276473999e-01 2.9879059642553329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 -9.3032103031873703e-03</internalNodes>
+          <leafValues>
+            1.4513379335403442e-01 -1.1033169925212860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 1.3253629440441728e-03</internalNodes>
+          <leafValues>
+            -9.7698956727981567e-02 1.9646440446376801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 4.9800761044025421e-03</internalNodes>
+          <leafValues>
+            3.3648081123828888e-02 -3.9792209863662720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -7.6542161405086517e-03</internalNodes>
+          <leafValues>
+            9.0841993689537048e-02 -1.5967549383640289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 -3.8920590281486511e-01</internalNodes>
+          <leafValues>
+            -6.6571092605590820e-01 1.9028829410672188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 -1.0019669681787491e-01</internalNodes>
+          <leafValues>
+            -5.7559269666671753e-01 2.4282779544591904e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 7.3541211895644665e-04</internalNodes>
+          <leafValues>
+            8.7919801473617554e-02 -1.6195340454578400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 -3.4802639856934547e-03</internalNodes>
+          <leafValues>
+            2.6064491271972656e-01 -6.0200810432434082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 8.4000425413250923e-03</internalNodes>
+          <leafValues>
+            -1.0979729890823364e-01 1.5707309544086456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 2.3786011151969433e-03</internalNodes>
+          <leafValues>
+            3.6058239638805389e-02 -4.7277191281318665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 7.3831682093441486e-03</internalNodes>
+          <leafValues>
+            -3.5756360739469528e-02 4.9498590826988220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 3.2115620560944080e-03</internalNodes>
+          <leafValues>
+            -1.0125560313463211e-01 1.5747989714145660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -7.8209668397903442e-02</internalNodes>
+          <leafValues>
+            -7.6627081632614136e-01 2.2965829819440842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 5.3303989261621609e-05</internalNodes>
+          <leafValues>
+            -1.3414350152015686e-01 1.1114919930696487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 -9.6419155597686768e-03</internalNodes>
+          <leafValues>
+            2.5068029761314392e-01 -6.6608138382434845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -7.1092672646045685e-02</internalNodes>
+          <leafValues>
+            -4.0056818723678589e-01 4.0297791361808777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 3.5171560011804104e-04</internalNodes>
+          <leafValues>
+            4.1861180216073990e-02 -3.2961198687553406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 -3.3458150574006140e-04</internalNodes>
+          <leafValues>
+            -2.6029831171035767e-01 6.7892737686634064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -4.1451421566307545e-03</internalNodes>
+          <leafValues>
+            2.3967699706554413e-01 -7.2093337774276733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 3.1754500232636929e-03</internalNodes>
+          <leafValues>
+            -7.1235269308090210e-02 2.4128450453281403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 -5.5184490047395229e-03</internalNodes>
+          <leafValues>
+            5.0320237874984741e-01 -2.9686680063605309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -3.0242869979701936e-04</internalNodes>
+          <leafValues>
+            2.4879050254821777e-01 -5.6758578866720200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 -1.3125919504091144e-03</internalNodes>
+          <leafValues>
+            3.1747800111770630e-01 -4.1845861822366714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 -2.7123570907860994e-04</internalNodes>
+          <leafValues>
+            -2.7042070031166077e-01 5.6828990578651428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -7.3241777718067169e-03</internalNodes>
+          <leafValues>
+            2.7556678652763367e-01 -5.4252970963716507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -1.6851710155606270e-02</internalNodes>
+          <leafValues>
+            -3.4852910041809082e-01 4.5368999242782593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 2.9902100563049316e-02</internalNodes>
+          <leafValues>
+            3.1621079891920090e-02 -4.3114370107650757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 2.8902660124003887e-03</internalNodes>
+          <leafValues>
+            3.8029961287975311e-02 -3.7027099728584290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -1.9242949783802032e-03</internalNodes>
+          <leafValues>
+            2.4800279736518860e-01 -5.9333298355340958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 4.9354149959981441e-03</internalNodes>
+          <leafValues>
+            -8.3068400621414185e-02 2.2043809294700623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 8.2075603306293488e-02</internalNodes>
+          <leafValues>
+            -1.9413439556956291e-02 6.9089287519454956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -2.4699489586055279e-04</internalNodes>
+          <leafValues>
+            -2.4660569429397583e-01 6.4776450395584106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 -1.8365769647061825e-03</internalNodes>
+          <leafValues>
+            2.8836160898208618e-01 -5.3390458226203918e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -4.9553811550140381e-03</internalNodes>
+          <leafValues>
+            1.2740829586982727e-01 -1.2559419870376587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 -8.3086621016263962e-03</internalNodes>
+          <leafValues>
+            2.3478110134601593e-01 -7.1676492691040039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -1.0879919677972794e-01</internalNodes>
+          <leafValues>
+            -2.5992238521575928e-01 5.8689739555120468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 -9.6786450594663620e-03</internalNodes>
+          <leafValues>
+            -7.0720428228378296e-01 1.8749259412288666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 -2.7136830613017082e-02</internalNodes>
+          <leafValues>
+            -5.8384227752685547e-01 2.1684130653738976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -6.5389778465032578e-03</internalNodes>
+          <leafValues>
+            -5.9748911857604980e-01 2.1480310708284378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 -1.2095630168914795e-02</internalNodes>
+          <leafValues>
+            1.3269039988517761e-01 -9.9722720682621002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -1.6776099801063538e-01</internalNodes>
+          <leafValues>
+            -5.6655067205429077e-01 3.2123088836669922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 -1.3262550346553326e-02</internalNodes>
+          <leafValues>
+            1.1495590209960938e-01 -1.1738389730453491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 7.6744519174098969e-02</internalNodes>
+          <leafValues>
+            -3.1413231045007706e-02 5.9935492277145386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 5.0785229541361332e-03</internalNodes>
+          <leafValues>
+            -5.2911940962076187e-02 2.3342399299144745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 3.1800279393792152e-03</internalNodes>
+          <leafValues>
+            -7.7734388411045074e-02 1.7652909457683563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -1.7729829996824265e-03</internalNodes>
+          <leafValues>
+            1.9591629505157471e-01 -7.9752199351787567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 -4.8560940194875002e-04</internalNodes>
+          <leafValues>
+            -2.8800371289253235e-01 4.9047119915485382e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 3.6554320831783116e-04</internalNodes>
+          <leafValues>
+            6.7922897636890411e-02 -2.2499430179595947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -2.6938671362586319e-04</internalNodes>
+          <leafValues>
+            1.6582170128822327e-01 -8.9744098484516144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 7.8684233129024506e-02</internalNodes>
+          <leafValues>
+            2.6081679388880730e-02 -5.5693739652633667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 -7.3774810880422592e-04</internalNodes>
+          <leafValues>
+            1.4036870002746582e-01 -1.1800300329923630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 2.3957829922437668e-02</internalNodes>
+          <leafValues>
+            3.0470740050077438e-02 -4.6159979701042175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 -1.6239080578088760e-03</internalNodes>
+          <leafValues>
+            2.6327079534530640e-01 -5.6765370070934296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -9.0819748584181070e-04</internalNodes>
+          <leafValues>
+            1.5462459623813629e-01 -1.1087069660425186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 3.9806248969398439e-04</internalNodes>
+          <leafValues>
+            5.5630370974540710e-02 -2.8331959247589111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 2.0506449509412050e-03</internalNodes>
+          <leafValues>
+            -9.1604836285114288e-02 1.7585539817810059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 2.6742549613118172e-02</internalNodes>
+          <leafValues>
+            6.2003031373023987e-02 -2.4487000703811646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -2.1497008856385946e-03</internalNodes>
+          <leafValues>
+            2.9449298977851868e-01 -5.3218148648738861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 5.6671658530831337e-03</internalNodes>
+          <leafValues>
+            -6.4298242330551147e-02 2.4905680119991302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 6.8317902332637459e-05</internalNodes>
+          <leafValues>
+            -1.6819630563259125e-01 9.6548579633235931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 1.7600439605303109e-04</internalNodes>
+          <leafValues>
+            6.5308012068271637e-02 -2.4267880618572235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 4.1861608624458313e-03</internalNodes>
+          <leafValues>
+            -9.7988583147525787e-02 1.8052889406681061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -2.1808340679854155e-03</internalNodes>
+          <leafValues>
+            1.9231270253658295e-01 -9.4123929738998413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 2.1730400621891022e-02</internalNodes>
+          <leafValues>
+            3.5578511655330658e-02 -4.5088538527488708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 -1.4780269935727119e-02</internalNodes>
+          <leafValues>
+            -4.3927010893821716e-01 3.1735591590404510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -3.6145891062915325e-03</internalNodes>
+          <leafValues>
+            1.9811479747295380e-01 -7.7701419591903687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 1.8892709631472826e-03</internalNodes>
+          <leafValues>
+            1.9962439313530922e-02 -7.2041720151901245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 -1.3822480104863644e-03</internalNodes>
+          <leafValues>
+            9.8466947674751282e-02 -1.4881080389022827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -3.9505911991000175e-03</internalNodes>
+          <leafValues>
+            1.1593230068683624e-01 -1.2791970372200012e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>58</maxWeakCount>
+      <stageThreshold>-1.0129359960556030e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 915 -1.9395539537072182e-02</internalNodes>
+          <leafValues>
+            4.7474750876426697e-01 -1.1721090227365494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 1.3118919916450977e-02</internalNodes>
+          <leafValues>
+            -2.5552129745483398e-01 1.6378800570964813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -5.1606801571324468e-04</internalNodes>
+          <leafValues>
+            1.9452619552612305e-01 -1.7448890209197998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -1.3184159994125366e-02</internalNodes>
+          <leafValues>
+            4.4181451201438904e-01 -9.0048752725124359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 3.4657081123441458e-03</internalNodes>
+          <leafValues>
+            -1.3477090001106262e-01 1.8056340515613556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 6.2980200164020061e-03</internalNodes>
+          <leafValues>
+            -5.4164979606866837e-02 3.6033380031585693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 1.6879989998415112e-03</internalNodes>
+          <leafValues>
+            -1.9997949898242950e-01 1.2021599709987640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 3.6039709812030196e-04</internalNodes>
+          <leafValues>
+            1.0524140298366547e-01 -2.4116060137748718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 -1.5276849735528231e-03</internalNodes>
+          <leafValues>
+            2.8135529160499573e-01 -6.8964816629886627e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 3.5033570602536201e-03</internalNodes>
+          <leafValues>
+            -8.2519583404064178e-02 4.0713590383529663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -4.7337161377072334e-03</internalNodes>
+          <leafValues>
+            1.9727009534835815e-01 -1.1710140109062195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 -1.1557149700820446e-02</internalNodes>
+          <leafValues>
+            -5.6061112880706787e-01 6.8170957267284393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 -2.7445720508694649e-02</internalNodes>
+          <leafValues>
+            4.9718621373176575e-01 -6.2380149960517883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -5.2825778722763062e-02</internalNodes>
+          <leafValues>
+            1.6921220719814301e-01 -1.3093550503253937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -2.9849699139595032e-01</internalNodes>
+          <leafValues>
+            -6.4649671316146851e-01 4.0076818317174911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 -2.6307269581593573e-04</internalNodes>
+          <leafValues>
+            2.5127941370010376e-01 -8.9494839310646057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 2.3261709429789335e-04</internalNodes>
+          <leafValues>
+            -8.6843989789485931e-02 2.3831979930400848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 2.3631360090803355e-04</internalNodes>
+          <leafValues>
+            1.1554460227489471e-01 -1.8936349451541901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 2.0742209162563086e-03</internalNodes>
+          <leafValues>
+            -4.8594851046800613e-02 5.7485991716384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -7.0308889262378216e-03</internalNodes>
+          <leafValues>
+            -5.4120808839797974e-01 4.8743750900030136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 8.2652270793914795e-03</internalNodes>
+          <leafValues>
+            2.6494519785046577e-02 -6.1728459596633911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 2.0042760297656059e-04</internalNodes>
+          <leafValues>
+            -1.1768630146980286e-01 1.6333860158920288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 1.6470040427520871e-03</internalNodes>
+          <leafValues>
+            -5.9954918920993805e-02 3.5179701447486877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 -3.5642538568936288e-04</internalNodes>
+          <leafValues>
+            -3.4420299530029297e-01 6.4948253333568573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -3.0935870483517647e-02</internalNodes>
+          <leafValues>
+            1.9979700446128845e-01 -9.7693696618080139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 -6.3578772824257612e-04</internalNodes>
+          <leafValues>
+            -3.1481391191482544e-01 5.9425041079521179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -1.1862180195748806e-02</internalNodes>
+          <leafValues>
+            2.0043690502643585e-01 -8.9447543025016785e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 7.1508930996060371e-03</internalNodes>
+          <leafValues>
+            -3.9006061851978302e-02 5.3327161073684692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 -2.0059191156178713e-03</internalNodes>
+          <leafValues>
+            -2.8469720482826233e-01 7.0723608136177063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 3.6412389017641544e-03</internalNodes>
+          <leafValues>
+            -1.0660319775342941e-01 2.4944800138473511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -1.3467429578304291e-01</internalNodes>
+          <leafValues>
+            4.9910080432891846e-01 -4.0332220494747162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 -2.2547659464180470e-03</internalNodes>
+          <leafValues>
+            1.6851690411567688e-01 -1.1119280010461807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 4.3842289596796036e-03</internalNodes>
+          <leafValues>
+            8.6139492690563202e-02 -2.7431771159172058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -7.3361168615520000e-03</internalNodes>
+          <leafValues>
+            2.4875210225582123e-01 -9.5919162034988403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 6.4666912658140063e-04</internalNodes>
+          <leafValues>
+            6.7431576550006866e-02 -3.3754080533981323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 2.2983769304119051e-04</internalNodes>
+          <leafValues>
+            -8.3903051912784576e-02 2.4584099650382996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 6.7039071582257748e-03</internalNodes>
+          <leafValues>
+            2.9079329222440720e-02 -6.9055938720703125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 5.0734888645820320e-05</internalNodes>
+          <leafValues>
+            -1.5696719288825989e-01 1.1965429782867432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 -2.0335559546947479e-01</internalNodes>
+          <leafValues>
+            -6.9506347179412842e-01 2.7507519349455833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 9.4939414411783218e-03</internalNodes>
+          <leafValues>
+            -8.7449371814727783e-02 2.3968330025672913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -2.4055240210145712e-03</internalNodes>
+          <leafValues>
+            2.1150960028171539e-01 -1.3148930668830872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 -1.1342419747961685e-04</internalNodes>
+          <leafValues>
+            1.5233789384365082e-01 -1.2725900113582611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 1.4992210082709789e-02</internalNodes>
+          <leafValues>
+            -3.4127969294786453e-02 5.0624072551727295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 7.4068200774490833e-04</internalNodes>
+          <leafValues>
+            4.8764750361442566e-02 -4.0225321054458618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -4.2459447868168354e-03</internalNodes>
+          <leafValues>
+            2.1554760634899139e-01 -8.7126992642879486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 6.8655109498649836e-04</internalNodes>
+          <leafValues>
+            -7.5418718159198761e-02 2.6405909657478333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 -1.6751460731029510e-02</internalNodes>
+          <leafValues>
+            -6.7729032039642334e-01 3.2918728888034821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 -2.6301678735762835e-04</internalNodes>
+          <leafValues>
+            2.2725869715213776e-01 -9.0534873306751251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 4.3398610432632267e-04</internalNodes>
+          <leafValues>
+            5.5894378572702408e-02 -3.5592669248580933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 -2.0150149241089821e-02</internalNodes>
+          <leafValues>
+            1.9162760674953461e-01 -9.4929970800876617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 -1.4452129602432251e-02</internalNodes>
+          <leafValues>
+            -6.8510341644287109e-01 2.5422170758247375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -2.1149739623069763e-02</internalNodes>
+          <leafValues>
+            3.7533190846443176e-01 -5.1496580243110657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 2.1137770265340805e-02</internalNodes>
+          <leafValues>
+            2.9083080589771271e-02 -8.9430367946624756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 1.1524349683895707e-03</internalNodes>
+          <leafValues>
+            -6.9694936275482178e-02 2.7299800515174866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -1.9070580310653895e-04</internalNodes>
+          <leafValues>
+            1.8228119611740112e-01 -9.8367072641849518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -3.6349631845951080e-02</internalNodes>
+          <leafValues>
+            -8.3693099021911621e-01 2.5055760517716408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 -9.0632075443863869e-03</internalNodes>
+          <leafValues>
+            4.1463500261306763e-01 -5.4413449019193649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 -2.0535490475594997e-03</internalNodes>
+          <leafValues>
+            -1.9750310480594635e-01 1.0506899654865265e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>93</maxWeakCount>
+      <stageThreshold>-9.7747492790222168e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 973 -2.2717019543051720e-02</internalNodes>
+          <leafValues>
+            2.4288550019264221e-01 -1.4745520055294037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 2.5505950674414635e-02</internalNodes>
+          <leafValues>
+            -2.8551739454269409e-01 1.0837209969758987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 -2.6640091091394424e-03</internalNodes>
+          <leafValues>
+            2.9275730252265930e-01 -1.0372710227966309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -3.8115289062261581e-03</internalNodes>
+          <leafValues>
+            2.1426899731159210e-01 -1.3811139762401581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 -1.6732690855860710e-02</internalNodes>
+          <leafValues>
+            2.6550260186195374e-01 -4.3911330401897430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 4.9277010839432478e-04</internalNodes>
+          <leafValues>
+            2.1104559302330017e-02 -4.2971360683441162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -3.6691110581159592e-02</internalNodes>
+          <leafValues>
+            5.3992420434951782e-01 -4.3648801743984222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 1.2615970335900784e-03</internalNodes>
+          <leafValues>
+            -1.2933869659900665e-01 1.6638770699501038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -8.4106856957077980e-03</internalNodes>
+          <leafValues>
+            -9.4698411226272583e-01 2.1465849131345749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 6.4902722835540771e-02</internalNodes>
+          <leafValues>
+            -7.1727760136127472e-02 2.6613479852676392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 3.0305000022053719e-02</internalNodes>
+          <leafValues>
+            -8.2782492041587830e-02 2.7694320678710938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 2.5875340215861797e-03</internalNodes>
+          <leafValues>
+            -1.2966169416904449e-01 1.7756630480289459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -7.0240451022982597e-03</internalNodes>
+          <leafValues>
+            -6.4243179559707642e-01 3.9943210780620575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -1.0099769569933414e-03</internalNodes>
+          <leafValues>
+            1.4176610112190247e-01 -1.1659970134496689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -4.1179071558872238e-05</internalNodes>
+          <leafValues>
+            1.5687669813632965e-01 -1.1127340048551559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 -4.7293151146732271e-04</internalNodes>
+          <leafValues>
+            -3.3554559946060181e-01 4.5977730304002762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 -1.7178079579025507e-03</internalNodes>
+          <leafValues>
+            1.6952909529209137e-01 -1.0578069835901260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 -1.3333169743418694e-02</internalNodes>
+          <leafValues>
+            -5.8257812261581421e-01 3.0978430062532425e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.8783430568873882e-03</internalNodes>
+          <leafValues>
+            1.4266879856586456e-01 -1.1131259799003601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -6.5765981562435627e-03</internalNodes>
+          <leafValues>
+            2.7561360597610474e-01 -5.3100328892469406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 -7.7210381277836859e-05</internalNodes>
+          <leafValues>
+            1.3240240514278412e-01 -1.1167799681425095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 2.1968539804220200e-02</internalNodes>
+          <leafValues>
+            -2.6968160644173622e-02 5.0067168474197388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -2.7445750311017036e-02</internalNodes>
+          <leafValues>
+            -2.4086740612983704e-01 6.0478270053863525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 7.8305849456228316e-05</internalNodes>
+          <leafValues>
+            -1.3334889709949493e-01 1.0123469680547714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 7.0190683007240295e-02</internalNodes>
+          <leafValues>
+            -5.4863780736923218e-02 2.4809940159320831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 -7.1902133524417877e-02</internalNodes>
+          <leafValues>
+            -3.7846690416336060e-01 4.2210999876260757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -1.0780979692935944e-01</internalNodes>
+          <leafValues>
+            -3.7486588954925537e-01 4.2833440005779266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 1.4364200178533792e-03</internalNodes>
+          <leafValues>
+            8.0476358532905579e-02 -1.7263789474964142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 6.8289190530776978e-02</internalNodes>
+          <leafValues>
+            -3.5595789551734924e-02 4.0761318802833557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 -6.8037179298698902e-03</internalNodes>
+          <leafValues>
+            1.9233790040016174e-01 -8.2368023693561554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -5.6193489581346512e-04</internalNodes>
+          <leafValues>
+            1.3057120144367218e-01 -1.4355149865150452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -5.8276649564504623e-02</internalNodes>
+          <leafValues>
+            -3.0125439167022705e-01 5.2819650620222092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -6.1205718666315079e-03</internalNodes>
+          <leafValues>
+            2.2043900191783905e-01 -7.5691752135753632e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 -1.3594309799373150e-02</internalNodes>
+          <leafValues>
+            -3.9049360156059265e-01 4.1857108473777771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 1.3626200379803777e-03</internalNodes>
+          <leafValues>
+            -9.5363423228263855e-02 1.4970320463180542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -1.5074219845701009e-04</internalNodes>
+          <leafValues>
+            -2.3945580422878265e-01 6.4798332750797272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 -7.7414259314537048e-02</internalNodes>
+          <leafValues>
+            5.5941981077194214e-01 -2.4516880512237549e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 9.2117872554808855e-04</internalNodes>
+          <leafValues>
+            5.4928861558437347e-02 -2.7934810519218445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 1.0250780032947659e-03</internalNodes>
+          <leafValues>
+            -6.2167309224605560e-02 2.4976369738578796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -8.1174750812351704e-04</internalNodes>
+          <leafValues>
+            2.3437939584255219e-01 -6.5725810825824738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 8.3431020379066467e-02</internalNodes>
+          <leafValues>
+            5.0954800099134445e-02 -3.1020981073379517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 -9.2014456167817116e-03</internalNodes>
+          <leafValues>
+            -3.9242538809776306e-01 3.2926950603723526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 -2.9086650465615094e-04</internalNodes>
+          <leafValues>
+            -3.1039750576019287e-01 4.9711819738149643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 7.7576898038387299e-03</internalNodes>
+          <leafValues>
+            -4.4040750712156296e-02 3.6431351304054260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 -1.2466090172529221e-01</internalNodes>
+          <leafValues>
+            -8.1957077980041504e-01 1.9150640815496445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 1.3242550194263458e-02</internalNodes>
+          <leafValues>
+            3.8988839834928513e-02 -3.3230680227279663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 -6.6770128905773163e-03</internalNodes>
+          <leafValues>
+            -3.5790139436721802e-01 4.0460210293531418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -2.7479929849505424e-03</internalNodes>
+          <leafValues>
+            2.5253900885581970e-01 -5.6427821516990662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 8.2659651525318623e-04</internalNodes>
+          <leafValues>
+            -7.1988657116889954e-02 2.2780479490756989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 -5.0153400748968124e-02</internalNodes>
+          <leafValues>
+            -6.3036471605300903e-01 2.7462050318717957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 7.4203149415552616e-03</internalNodes>
+          <leafValues>
+            -6.6610716283321381e-02 2.7787339687347412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 -6.7951780511066318e-04</internalNodes>
+          <leafValues>
+            -3.6327061057090759e-01 4.2795430868864059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 -1.9305750029161572e-03</internalNodes>
+          <leafValues>
+            1.4196230471134186e-01 -1.0759980231523514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 -3.8132671033963561e-04</internalNodes>
+          <leafValues>
+            2.1591760218143463e-01 -7.0202663540840149e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 -7.0990346372127533e-02</internalNodes>
+          <leafValues>
+            4.5266601443290710e-01 -4.0750481188297272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 -5.3368080407381058e-02</internalNodes>
+          <leafValues>
+            -6.7674058675765991e-01 1.9288340583443642e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -2.0064849406480789e-02</internalNodes>
+          <leafValues>
+            -4.3365430831909180e-01 3.1853288412094116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 1.1976360110566020e-03</internalNodes>
+          <leafValues>
+            -2.6559870690107346e-02 5.0797182321548462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -2.2697300300933421e-04</internalNodes>
+          <leafValues>
+            1.8012599647045135e-01 -8.3606548607349396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 1.5262699685990810e-02</internalNodes>
+          <leafValues>
+            -2.0238929986953735e-01 6.7422017455101013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -2.0811769366264343e-01</internalNodes>
+          <leafValues>
+            6.6943860054016113e-01 -2.2452110424637794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 1.5514369588345289e-03</internalNodes>
+          <leafValues>
+            -7.5121842324733734e-02 1.7326919734477997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -5.2924010902643204e-02</internalNodes>
+          <leafValues>
+            2.4992519617080688e-01 -6.2879167497158051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 -2.1648850291967392e-02</internalNodes>
+          <leafValues>
+            -2.9194280505180359e-01 5.2614491432905197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 -2.2905069636180997e-04</internalNodes>
+          <leafValues>
+            -2.2117300331592560e-01 6.3168339431285858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 5.0170070608146489e-05</internalNodes>
+          <leafValues>
+            -1.1510709673166275e-01 1.1611440032720566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 -1.6416069411206990e-04</internalNodes>
+          <leafValues>
+            1.5871520340442657e-01 -8.2600601017475128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -1.2003289535641670e-02</internalNodes>
+          <leafValues>
+            1.2218090146780014e-01 -1.1229699850082397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 -1.7784100025892258e-02</internalNodes>
+          <leafValues>
+            -3.5072788596153259e-01 3.1341921538114548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 -6.3457582145929337e-03</internalNodes>
+          <leafValues>
+            1.3078069686889648e-01 -1.0574410110712051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 -7.9523242311552167e-04</internalNodes>
+          <leafValues>
+            1.7204670608043671e-01 -8.6001992225646973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 -3.1029590172693133e-04</internalNodes>
+          <leafValues>
+            -2.8433170914649963e-01 5.1817119121551514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 -1.7053710296750069e-02</internalNodes>
+          <leafValues>
+            3.9242428541183472e-01 -4.0143270045518875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 4.6504959464073181e-03</internalNodes>
+          <leafValues>
+            -3.1837560236454010e-02 4.1237699985504150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 -1.0358760133385658e-02</internalNodes>
+          <leafValues>
+            -5.6993198394775391e-01 2.9248379170894623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 -2.2196240723133087e-02</internalNodes>
+          <leafValues>
+            -4.5605289936065674e-01 2.6285989210009575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -7.0536029525101185e-03</internalNodes>
+          <leafValues>
+            1.5998320281505585e-01 -9.1594859957695007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -5.7094299700111151e-04</internalNodes>
+          <leafValues>
+            -1.4076329767704010e-01 1.0287419706583023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 -2.2152599412947893e-03</internalNodes>
+          <leafValues>
+            1.6593599319458008e-01 -8.5273988544940948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 -2.8084890916943550e-02</internalNodes>
+          <leafValues>
+            2.7022340893745422e-01 -5.5873811244964600e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 2.1515151020139456e-03</internalNodes>
+          <leafValues>
+            4.2472891509532928e-02 -3.2005849480628967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 -2.9733829433098435e-04</internalNodes>
+          <leafValues>
+            1.6177169978618622e-01 -8.5115589201450348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -1.6694780439138412e-02</internalNodes>
+          <leafValues>
+            -4.2858770489692688e-01 3.0541609972715378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 1.1982990056276321e-01</internalNodes>
+          <leafValues>
+            -1.6277290880680084e-02 7.9846781492233276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -3.5499420482665300e-04</internalNodes>
+          <leafValues>
+            1.5935939550399780e-01 -8.3272881805896759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 -1.8226269632577896e-02</internalNodes>
+          <leafValues>
+            1.9527280330657959e-01 -7.3939889669418335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 -4.0238600922748446e-04</internalNodes>
+          <leafValues>
+            7.9101808369159698e-02 -2.0806129276752472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 4.0892060496844351e-04</internalNodes>
+          <leafValues>
+            1.0036630183458328e-01 -1.5128210186958313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 9.5368112670257688e-04</internalNodes>
+          <leafValues>
+            -7.3011666536331177e-02 2.1752020716667175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 4.3081799149513245e-01</internalNodes>
+          <leafValues>
+            -2.7450699359178543e-02 5.7061582803726196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 5.3564831614494324e-04</internalNodes>
+          <leafValues>
+            1.1587540060281754e-01 -1.2790560722351074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 2.4430730263702571e-05</internalNodes>
+          <leafValues>
+            -1.6816629469394684e-01 8.0449983477592468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 -5.5345650762319565e-02</internalNodes>
+          <leafValues>
+            4.5338949561119080e-01 -3.1222779303789139e-02</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          0 8 20 12 -1.</_>
+        <_>
+          0 14 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 15 -1.</_>
+        <_>
+          9 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 9 -1.</_>
+        <_>
+          7 3 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 18 -1.</_>
+        <_>
+          12 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 6 -1.</_>
+        <_>
+          8 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 17 18 -1.</_>
+        <_>
+          2 6 17 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 1 8 -1.</_>
+        <_>
+          10 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 9 2 -1.</_>
+        <_>
+          10 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 6 -1.</_>
+        <_>
+          5 3 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 9 -1.</_>
+        <_>
+          3 4 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 6 -1.</_>
+        <_>
+          6 5 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 3 -1.</_>
+        <_>
+          10 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 9 1 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 11 -1.</_>
+        <_>
+          3 7 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 1 -1.</_>
+        <_>
+          10 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 3 -1.</_>
+        <_>
+          11 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 5 18 -1.</_>
+        <_>
+          8 6 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 7 -1.</_>
+        <_>
+          9 7 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 10 -1.</_>
+        <_>
+          16 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 9 5 -1.</_>
+        <_>
+          12 8 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 9 6 -1.</_>
+        <_>
+          6 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 6 -1.</_>
+        <_>
+          3 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 18 -1.</_>
+        <_>
+          16 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 3 3 -1.</_>
+        <_>
+          0 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 1 -1.</_>
+        <_>
+          17 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 12 -1.</_>
+        <_>
+          0 14 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 8 -1.</_>
+        <_>
+          9 6 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          5 6 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 1 2 -1.</_>
+        <_>
+          4 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 1 -1.</_>
+        <_>
+          19 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 5 -1.</_>
+        <_>
+          11 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 6 -1.</_>
+        <_>
+          8 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 7 -1.</_>
+        <_>
+          13 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 14 1 2 -1.</_>
+        <_>
+          19 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 1 2 -1.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 7 -1.</_>
+        <_>
+          15 7 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 4 -1.</_>
+        <_>
+          7 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 6 -1.</_>
+        <_>
+          5 10 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 1 3 -1.</_>
+        <_>
+          2 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 6 -1.</_>
+        <_>
+          7 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 12 -1.</_>
+        <_>
+          9 7 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 11 12 -1.</_>
+        <_>
+          6 6 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 5 8 -1.</_>
+        <_>
+          1 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 7 -1.</_>
+        <_>
+          16 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 6 -1.</_>
+        <_>
+          12 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          16 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 3 -1.</_>
+        <_>
+          18 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 7 -1.</_>
+        <_>
+          10 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 8 -1.</_>
+        <_>
+          7 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 11 -1.</_>
+        <_>
+          4 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 12 8 -1.</_>
+        <_>
+          8 14 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 3 -1.</_>
+        <_>
+          9 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 3 3 -1.</_>
+        <_>
+          11 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 6 -1.</_>
+        <_>
+          9 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 5 -1.</_>
+        <_>
+          9 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 1 3 -1.</_>
+        <_>
+          6 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          0 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 11 9 -1.</_>
+        <_>
+          4 4 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 9 -1.</_>
+        <_>
+          3 4 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 4 -1.</_>
+        <_>
+          2 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 13 1 2 -1.</_>
+        <_>
+          18 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 11 -1.</_>
+        <_>
+          14 5 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 8 2 -1.</_>
+        <_>
+          0 18 4 1 2.</_>
+        <_>
+          4 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 5 -1.</_>
+        <_>
+          9 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 11 10 -1.</_>
+        <_>
+          4 12 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 4 -1.</_>
+        <_>
+          16 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 8 -1.</_>
+        <_>
+          3 7 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 3 3 -1.</_>
+        <_>
+          0 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 12 1 -1.</_>
+        <_>
+          11 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 9 4 -1.</_>
+        <_>
+          7 8 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 4 -1.</_>
+        <_>
+          7 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 10 -1.</_>
+        <_>
+          4 9 2 5 2.</_>
+        <_>
+          6 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          6 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 2 18 -1.</_>
+        <_>
+          10 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 6 -1.</_>
+        <_>
+          0 5 4 3 2.</_>
+        <_>
+          4 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 5 -1.</_>
+        <_>
+          8 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 14 -1.</_>
+        <_>
+          18 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 2 -1.</_>
+        <_>
+          10 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 3 -1.</_>
+        <_>
+          1 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 5 -1.</_>
+        <_>
+          12 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 4 -1.</_>
+        <_>
+          12 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 5 -1.</_>
+        <_>
+          13 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 7 -1.</_>
+        <_>
+          3 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 1 3 -1.</_>
+        <_>
+          0 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 9 6 -1.</_>
+        <_>
+          3 4 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 2 -1.</_>
+        <_>
+          8 7 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 3 6 -1.</_>
+        <_>
+          0 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 4 -1.</_>
+        <_>
+          3 11 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 3 -1.</_>
+        <_>
+          9 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 6 -1.</_>
+        <_>
+          6 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 6 -1.</_>
+        <_>
+          8 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 2 1 -1.</_>
+        <_>
+          2 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 2 -1.</_>
+        <_>
+          12 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 6 -1.</_>
+        <_>
+          15 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 6 4 -1.</_>
+        <_>
+          8 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 9 -1.</_>
+        <_>
+          8 3 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 3 -1.</_>
+        <_>
+          8 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 2 -1.</_>
+        <_>
+          9 14 1 1 2.</_>
+        <_>
+          10 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 2 -1.</_>
+        <_>
+          9 14 1 1 2.</_>
+        <_>
+          10 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 12 -1.</_>
+        <_>
+          0 14 19 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 14 -1.</_>
+        <_>
+          10 6 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 4 -1.</_>
+        <_>
+          14 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 1 3 -1.</_>
+        <_>
+          4 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 3 -1.</_>
+        <_>
+          6 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 5 2 -1.</_>
+        <_>
+          2 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_>
+        <_>
+          8 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_>
+        <_>
+          8 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 2 -1.</_>
+        <_>
+          5 11 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 1 9 -1.</_>
+        <_>
+          10 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 12 -1.</_>
+        <_>
+          15 8 1 6 2.</_>
+        <_>
+          16 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 5 -1.</_>
+        <_>
+          5 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 7 -1.</_>
+        <_>
+          13 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 4 -1.</_>
+        <_>
+          9 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 1 -1.</_>
+        <_>
+          10 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 15 14 -1.</_>
+        <_>
+          0 13 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 5 6 -1.</_>
+        <_>
+          9 3 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 4 -1.</_>
+        <_>
+          4 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 6 -1.</_>
+        <_>
+          6 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 12 -1.</_>
+        <_>
+          11 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 1 -1.</_>
+        <_>
+          8 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 9 3 -1.</_>
+        <_>
+          10 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 6 2 -1.</_>
+        <_>
+          14 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 14 -1.</_>
+        <_>
+          10 5 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 9 4 -1.</_>
+        <_>
+          11 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 14 -1.</_>
+        <_>
+          0 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 3 -1.</_>
+        <_>
+          10 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 4 -1.</_>
+        <_>
+          7 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 4 -1.</_>
+        <_>
+          5 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 5 -1.</_>
+        <_>
+          7 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 1 2 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          7 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          0 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 12 -1.</_>
+        <_>
+          12 7 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 4 -1.</_>
+        <_>
+          13 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 5 -1.</_>
+        <_>
+          13 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 1 -1.</_>
+        <_>
+          17 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 1 3 -1.</_>
+        <_>
+          5 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 6 -1.</_>
+        <_>
+          10 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 2 3 -1.</_>
+        <_>
+          4 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 1 9 -1.</_>
+        <_>
+          12 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 9 -1.</_>
+        <_>
+          8 6 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 3 6 -1.</_>
+        <_>
+          17 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 8 -1.</_>
+        <_>
+          8 7 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 5 -1.</_>
+        <_>
+          6 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 8 -1.</_>
+        <_>
+          7 6 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 3 3 -1.</_>
+        <_>
+          3 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          16 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 10 -1.</_>
+        <_>
+          17 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 4 -1.</_>
+        <_>
+          10 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 12 -1.</_>
+        <_>
+          5 6 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 3 -1.</_>
+        <_>
+          8 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 7 -1.</_>
+        <_>
+          12 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 4 -1.</_>
+        <_>
+          14 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 5 -1.</_>
+        <_>
+          16 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 4 -1.</_>
+        <_>
+          12 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 1 2 -1.</_>
+        <_>
+          3 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 6 -1.</_>
+        <_>
+          12 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 8 -1.</_>
+        <_>
+          11 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          16 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 2 -1.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 9 -1.</_>
+        <_>
+          5 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 9 1 -1.</_>
+        <_>
+          7 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 9 -1.</_>
+        <_>
+          0 14 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 3 -1.</_>
+        <_>
+          11 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          9 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 4 -1.</_>
+        <_>
+          7 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 1 3 -1.</_>
+        <_>
+          3 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 4 -1.</_>
+        <_>
+          13 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 2 -1.</_>
+        <_>
+          7 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 14 -1.</_>
+        <_>
+          1 0 1 7 2.</_>
+        <_>
+          2 7 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 11 8 -1.</_>
+        <_>
+          5 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 6 -1.</_>
+        <_>
+          9 5 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 5 10 -1.</_>
+        <_>
+          7 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          16 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 8 2 -1.</_>
+        <_>
+          0 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 1 3 -1.</_>
+        <_>
+          7 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 11 6 -1.</_>
+        <_>
+          7 4 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 9 3 -1.</_>
+        <_>
+          8 4 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 2 -1.</_>
+        <_>
+          0 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 6 -1.</_>
+        <_>
+          0 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 6 -1.</_>
+        <_>
+          8 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 4 -1.</_>
+        <_>
+          14 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 8 -1.</_>
+        <_>
+          11 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 3 3 -1.</_>
+        <_>
+          17 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 9 -1.</_>
+        <_>
+          6 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 6 -1.</_>
+        <_>
+          0 5 4 3 2.</_>
+        <_>
+          4 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 3 -1.</_>
+        <_>
+          0 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 6 -1.</_>
+        <_>
+          18 0 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 3 -1.</_>
+        <_>
+          12 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 2 -1.</_>
+        <_>
+          13 15 1 1 2.</_>
+        <_>
+          14 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 3 -1.</_>
+        <_>
+          4 1 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 9 -1.</_>
+        <_>
+          5 6 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 7 -1.</_>
+        <_>
+          10 7 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 9 6 -1.</_>
+        <_>
+          8 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 2 -1.</_>
+        <_>
+          0 17 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 7 14 -1.</_>
+        <_>
+          12 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 8 -1.</_>
+        <_>
+          15 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 3 -1.</_>
+        <_>
+          4 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 2 -1.</_>
+        <_>
+          7 2 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 4 -1.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 6 2 -1.</_>
+        <_>
+          10 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 2 -1.</_>
+        <_>
+          7 7 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 6 -1.</_>
+        <_>
+          7 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 7 -1.</_>
+        <_>
+          17 8 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 3 -1.</_>
+        <_>
+          0 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 6 1 -1.</_>
+        <_>
+          7 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          9 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 4 -1.</_>
+        <_>
+          0 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 3 -1.</_>
+        <_>
+          2 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 9 -1.</_>
+        <_>
+          3 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 2 -1.</_>
+        <_>
+          11 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 1 -1.</_>
+        <_>
+          15 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 4 -1.</_>
+        <_>
+          0 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 2 -1.</_>
+        <_>
+          15 6 1 1 2.</_>
+        <_>
+          16 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          8 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 3 -1.</_>
+        <_>
+          19 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 1 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 6 -1.</_>
+        <_>
+          14 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 1 -1.</_>
+        <_>
+          16 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 4 -1.</_>
+        <_>
+          8 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 15 -1.</_>
+        <_>
+          4 5 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 6 -1.</_>
+        <_>
+          9 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 1 3 -1.</_>
+        <_>
+          11 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 2 4 -1.</_>
+        <_>
+          12 16 1 2 2.</_>
+        <_>
+          13 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 1 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 3 -1.</_>
+        <_>
+          12 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 8 -1.</_>
+        <_>
+          4 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 6 -1.</_>
+        <_>
+          3 5 3 3 2.</_>
+        <_>
+          6 8 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 3 -1.</_>
+        <_>
+          11 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 4 2 -1.</_>
+        <_>
+          5 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 5 2 -1.</_>
+        <_>
+          8 17 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 3 -1.</_>
+        <_>
+          0 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 2 -1.</_>
+        <_>
+          8 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 9 3 -1.</_>
+        <_>
+          7 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 1 4 -1.</_>
+        <_>
+          0 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 8 3 -1.</_>
+        <_>
+          0 18 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 11 6 -1.</_>
+        <_>
+          6 3 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 2 -1.</_>
+        <_>
+          6 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 1 12 -1.</_>
+        <_>
+          10 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 4 -1.</_>
+        <_>
+          6 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 1 3 -1.</_>
+        <_>
+          0 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 1 3 -1.</_>
+        <_>
+          0 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 4 -1.</_>
+        <_>
+          14 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 5 4 -1.</_>
+        <_>
+          1 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 1 2 -1.</_>
+        <_>
+          18 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 4 -1.</_>
+        <_>
+          14 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 8 -1.</_>
+        <_>
+          12 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 10 -1.</_>
+        <_>
+          10 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 3 -1.</_>
+        <_>
+          17 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 2 10 -1.</_>
+        <_>
+          2 7 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 3 -1.</_>
+        <_>
+          7 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 12 -1.</_>
+        <_>
+          0 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 1 3 -1.</_>
+        <_>
+          0 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 6 4 -1.</_>
+        <_>
+          8 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 6 -1.</_>
+        <_>
+          0 8 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 2 1 -1.</_>
+        <_>
+          12 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 9 2 -1.</_>
+        <_>
+          5 2 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 3 -1.</_>
+        <_>
+          16 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 1 -1.</_>
+        <_>
+          13 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 4 -1.</_>
+        <_>
+          3 3 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 1 18 -1.</_>
+        <_>
+          11 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 5 12 -1.</_>
+        <_>
+          9 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 1 -1.</_>
+        <_>
+          16 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 10 -1.</_>
+        <_>
+          9 6 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 6 -1.</_>
+        <_>
+          19 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 4 -1.</_>
+        <_>
+          8 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 5 -1.</_>
+        <_>
+          7 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 3 -1.</_>
+        <_>
+          0 4 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 1 -1.</_>
+        <_>
+          2 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 10 -1.</_>
+        <_>
+          4 8 1 5 2.</_>
+        <_>
+          5 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 2 -1.</_>
+        <_>
+          2 18 9 1 2.</_>
+        <_>
+          11 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 4 -1.</_>
+        <_>
+          2 7 2 2 2.</_>
+        <_>
+          4 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 4 -1.</_>
+        <_>
+          18 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 8 -1.</_>
+        <_>
+          16 9 1 4 2.</_>
+        <_>
+          17 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 1 6 -1.</_>
+        <_>
+          15 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 2 -1.</_>
+        <_>
+          14 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 3 -1.</_>
+        <_>
+          17 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 3 -1.</_>
+        <_>
+          10 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 6 -1.</_>
+        <_>
+          4 2 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 6 -1.</_>
+        <_>
+          7 16 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 2 -1.</_>
+        <_>
+          11 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 4 -1.</_>
+        <_>
+          10 1 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 7 -1.</_>
+        <_>
+          10 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 2 -1.</_>
+        <_>
+          6 17 1 1 2.</_>
+        <_>
+          7 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 9 -1.</_>
+        <_>
+          5 6 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 19 10 -1.</_>
+        <_>
+          0 15 19 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 6 1 -1.</_>
+        <_>
+          7 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 3 -1.</_>
+        <_>
+          3 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 5 -1.</_>
+        <_>
+          8 5 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 6 4 -1.</_>
+        <_>
+          1 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 6 -1.</_>
+        <_>
+          16 10 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 4 3 -1.</_>
+        <_>
+          0 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 11 -1.</_>
+        <_>
+          3 7 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 7 2 -1.</_>
+        <_>
+          13 18 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 3 -1.</_>
+        <_>
+          0 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 2 -1.</_>
+        <_>
+          3 0 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 3 -1.</_>
+        <_>
+          3 1 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 6 -1.</_>
+        <_>
+          0 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 14 -1.</_>
+        <_>
+          1 2 3 7 2.</_>
+        <_>
+          4 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 2 -1.</_>
+        <_>
+          17 5 1 1 2.</_>
+        <_>
+          18 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 9 4 -1.</_>
+        <_>
+          14 10 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 4 -1.</_>
+        <_>
+          6 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 12 2 -1.</_>
+        <_>
+          11 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 1 2 -1.</_>
+        <_>
+          2 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 3 -1.</_>
+        <_>
+          16 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 3 -1.</_>
+        <_>
+          19 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 1 2 -1.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 2 -1.</_>
+        <_>
+          12 7 4 1 2.</_>
+        <_>
+          16 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 4 -1.</_>
+        <_>
+          15 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 4 -1.</_>
+        <_>
+          14 2 3 2 2.</_>
+        <_>
+          17 4 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 1 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 1 -1.</_>
+        <_>
+          4 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 1 -1.</_>
+        <_>
+          18 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 2 -1.</_>
+        <_>
+          7 16 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 8 1 -1.</_>
+        <_>
+          6 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 3 -1.</_>
+        <_>
+          1 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 2 -1.</_>
+        <_>
+          19 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 10 4 -1.</_>
+        <_>
+          9 16 5 2 2.</_>
+        <_>
+          14 18 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 4 -1.</_>
+        <_>
+          12 9 1 2 2.</_>
+        <_>
+          13 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 11 1 9 -1.</_>
+        <_>
+          19 14 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 14 -1.</_>
+        <_>
+          6 13 14 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 4 2 -1.</_>
+        <_>
+          2 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 3 -1.</_>
+        <_>
+          0 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 1 3 -1.</_>
+        <_>
+          0 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 4 4 -1.</_>
+        <_>
+          15 17 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 7 -1.</_>
+        <_>
+          8 5 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 5 3 -1.</_>
+        <_>
+          1 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 3 -1.</_>
+        <_>
+          0 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 6 -1.</_>
+        <_>
+          1 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 3 -1.</_>
+        <_>
+          16 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 6 -1.</_>
+        <_>
+          3 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 10 -1.</_>
+        <_>
+          3 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 2 -1.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 4 -1.</_>
+        <_>
+          12 8 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 7 3 -1.</_>
+        <_>
+          13 6 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 2 -1.</_>
+        <_>
+          10 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 4 2 -1.</_>
+        <_>
+          18 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 7 -1.</_>
+        <_>
+          18 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 3 -1.</_>
+        <_>
+          16 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 9 1 3 -1.</_>
+        <_>
+          19 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 6 -1.</_>
+        <_>
+          19 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 4 -1.</_>
+        <_>
+          9 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 2 -1.</_>
+        <_>
+          9 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 4 -1.</_>
+        <_>
+          2 12 4 2 2.</_>
+        <_>
+          6 14 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 3 -1.</_>
+        <_>
+          0 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 3 3 -1.</_>
+        <_>
+          15 14 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 3 -1.</_>
+        <_>
+          2 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 7 -1.</_>
+        <_>
+          2 0 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 4 4 -1.</_>
+        <_>
+          15 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 4 -1.</_>
+        <_>
+          5 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 1 2 -1.</_>
+        <_>
+          3 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 4 -1.</_>
+        <_>
+          7 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 4 -1.</_>
+        <_>
+          7 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 9 12 -1.</_>
+        <_>
+          9 8 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 6 -1.</_>
+        <_>
+          8 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 3 -1.</_>
+        <_>
+          17 2 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 3 -1.</_>
+        <_>
+          0 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 2 -1.</_>
+        <_>
+          15 0 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 2 -1.</_>
+        <_>
+          12 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 10 1 -1.</_>
+        <_>
+          8 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 16 -1.</_>
+        <_>
+          0 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 1 3 -1.</_>
+        <_>
+          2 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 6 -1.</_>
+        <_>
+          11 8 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 7 -1.</_>
+        <_>
+          16 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 6 1 -1.</_>
+        <_>
+          14 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 1 -1.</_>
+        <_>
+          17 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 8 2 -1.</_>
+        <_>
+          0 17 4 1 2.</_>
+        <_>
+          4 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 1 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 5 -1.</_>
+        <_>
+          6 15 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 2 -1.</_>
+        <_>
+          7 3 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 4 -1.</_>
+        <_>
+          4 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 2 1 -1.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 2 1 -1.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 3 -1.</_>
+        <_>
+          16 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 3 -1.</_>
+        <_>
+          1 11 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 4 1 -1.</_>
+        <_>
+          2 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          2 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 1 3 -1.</_>
+        <_>
+          2 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 11 2 -1.</_>
+        <_>
+          5 8 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 10 -1.</_>
+        <_>
+          9 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 3 -1.</_>
+        <_>
+          0 3 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 10 1 -1.</_>
+        <_>
+          15 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 8 3 -1.</_>
+        <_>
+          15 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 19 3 1 -1.</_>
+        <_>
+          9 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 4 -1.</_>
+        <_>
+          15 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 3 -1.</_>
+        <_>
+          10 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 3 2 -1.</_>
+        <_>
+          0 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 6 -1.</_>
+        <_>
+          7 14 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 1 2 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 4 -1.</_>
+        <_>
+          2 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 7 -1.</_>
+        <_>
+          3 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 5 -1.</_>
+        <_>
+          2 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 3 -1.</_>
+        <_>
+          19 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 6 -1.</_>
+        <_>
+          7 5 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 4 2 -1.</_>
+        <_>
+          2 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 11 -1.</_>
+        <_>
+          19 6 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 6 -1.</_>
+        <_>
+          0 14 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 2 -1.</_>
+        <_>
+          12 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 2 3 -1.</_>
+        <_>
+          1 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 4 -1.</_>
+        <_>
+          16 16 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 5 -1.</_>
+        <_>
+          10 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 7 -1.</_>
+        <_>
+          14 7 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 2 6 -1.</_>
+        <_>
+          2 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 7 -1.</_>
+        <_>
+          16 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 2 -1.</_>
+        <_>
+          6 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 9 -1.</_>
+        <_>
+          0 12 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 2 -1.</_>
+        <_>
+          10 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 4 -1.</_>
+        <_>
+          6 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 5 9 -1.</_>
+        <_>
+          6 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 4 -1.</_>
+        <_>
+          0 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 5 -1.</_>
+        <_>
+          11 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 7 -1.</_>
+        <_>
+          7 7 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 4 -1.</_>
+        <_>
+          3 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 8 -1.</_>
+        <_>
+          2 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 3 -1.</_>
+        <_>
+          0 1 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 4 -1.</_>
+        <_>
+          5 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 9 1 -1.</_>
+        <_>
+          5 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 1 3 -1.</_>
+        <_>
+          1 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 2 3 -1.</_>
+        <_>
+          0 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 16 3 -1.</_>
+        <_>
+          8 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 1 -1.</_>
+        <_>
+          2 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 20 -1.</_>
+        <_>
+          3 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 6 -1.</_>
+        <_>
+          2 5 2 3 2.</_>
+        <_>
+          4 8 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 3 -1.</_>
+        <_>
+          11 16 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 6 1 -1.</_>
+        <_>
+          14 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 15 2 -1.</_>
+        <_>
+          8 17 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 3 -1.</_>
+        <_>
+          18 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 4 -1.</_>
+        <_>
+          13 6 2 2 2.</_>
+        <_>
+          15 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 4 -1.</_>
+        <_>
+          17 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 2 -1.</_>
+        <_>
+          15 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 3 -1.</_>
+        <_>
+          17 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 8 1 -1.</_>
+        <_>
+          7 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 3 6 -1.</_>
+        <_>
+          0 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 5 -1.</_>
+        <_>
+          9 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 2 -1.</_>
+        <_>
+          10 1 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 2 -1.</_>
+        <_>
+          10 0 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 3 -1.</_>
+        <_>
+          12 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 6 -1.</_>
+        <_>
+          5 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 4 -1.</_>
+        <_>
+          8 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 3 -1.</_>
+        <_>
+          17 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 3 -1.</_>
+        <_>
+          5 3 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 6 -1.</_>
+        <_>
+          6 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 6 -1.</_>
+        <_>
+          15 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 3 -1.</_>
+        <_>
+          7 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 2 -1.</_>
+        <_>
+          12 4 4 1 2.</_>
+        <_>
+          16 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 1 6 -1.</_>
+        <_>
+          15 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 11 3 -1.</_>
+        <_>
+          4 18 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 20 -1.</_>
+        <_>
+          3 10 16 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 6 -1.</_>
+        <_>
+          12 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          13 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 4 -1.</_>
+        <_>
+          13 1 3 2 2.</_>
+        <_>
+          16 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 4 -1.</_>
+        <_>
+          13 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 4 -1.</_>
+        <_>
+          8 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 2 -1.</_>
+        <_>
+          0 17 7 1 2.</_>
+        <_>
+          7 18 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 2 2 -1.</_>
+        <_>
+          6 18 1 1 2.</_>
+        <_>
+          7 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          17 18 1 1 2.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 1 9 -1.</_>
+        <_>
+          5 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 4 -1.</_>
+        <_>
+          7 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 2 -1.</_>
+        <_>
+          1 9 3 1 2.</_>
+        <_>
+          4 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 3 -1.</_>
+        <_>
+          7 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 12 -1.</_>
+        <_>
+          8 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 2 2 -1.</_>
+        <_>
+          4 18 1 1 2.</_>
+        <_>
+          5 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 6 -1.</_>
+        <_>
+          9 3 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 2 -1.</_>
+        <_>
+          6 18 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 16 2 -1.</_>
+        <_>
+          3 19 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 11 -1.</_>
+        <_>
+          4 0 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 3 1 -1.</_>
+        <_>
+          14 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 6 -1.</_>
+        <_>
+          6 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 4 -1.</_>
+        <_>
+          1 2 6 2 2.</_>
+        <_>
+          7 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 4 -1.</_>
+        <_>
+          5 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 1 -1.</_>
+        <_>
+          16 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 2 -1.</_>
+        <_>
+          11 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 1 -1.</_>
+        <_>
+          9 3 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 2 -1.</_>
+        <_>
+          2 7 3 1 2.</_>
+        <_>
+          5 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 6 -1.</_>
+        <_>
+          0 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 7 -1.</_>
+        <_>
+          10 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 13 -1.</_>
+        <_>
+          11 6 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 1 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 6 -1.</_>
+        <_>
+          18 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 9 -1.</_>
+        <_>
+          18 2 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 6 -1.</_>
+        <_>
+          13 8 2 3 2.</_>
+        <_>
+          15 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          10 2 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 16 6 -1.</_>
+        <_>
+          12 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 10 1 -1.</_>
+        <_>
+          11 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 1 3 -1.</_>
+        <_>
+          6 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 10 3 -1.</_>
+        <_>
+          4 15 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 12 -1.</_>
+        <_>
+          6 4 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 2 -1.</_>
+        <_>
+          5 7 2 1 2.</_>
+        <_>
+          7 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 2 -1.</_>
+        <_>
+          18 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 3 -1.</_>
+        <_>
+          8 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 5 3 -1.</_>
+        <_>
+          8 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 1 18 -1.</_>
+        <_>
+          13 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 7 4 -1.</_>
+        <_>
+          11 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 8 -1.</_>
+        <_>
+          3 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 3 -1.</_>
+        <_>
+          9 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 3 -1.</_>
+        <_>
+          9 18 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 3 3 -1.</_>
+        <_>
+          12 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 5 -1.</_>
+        <_>
+          5 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 3 -1.</_>
+        <_>
+          10 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_>
+        <_>
+          19 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 9 1 -1.</_>
+        <_>
+          7 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 5 -1.</_>
+        <_>
+          5 9 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 1 12 -1.</_>
+        <_>
+          18 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 6 -1.</_>
+        <_>
+          0 2 4 3 2.</_>
+        <_>
+          4 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 3 -1.</_>
+        <_>
+          9 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 2 2 -1.</_>
+        <_>
+          3 18 1 1 2.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 3 -1.</_>
+        <_>
+          6 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 2 -1.</_>
+        <_>
+          16 7 2 1 2.</_>
+        <_>
+          18 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 1 3 -1.</_>
+        <_>
+          5 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 20 -1.</_>
+        <_>
+          2 10 15 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 4 -1.</_>
+        <_>
+          8 11 3 2 2.</_>
+        <_>
+          11 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 3 -1.</_>
+        <_>
+          8 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 2 2 -1.</_>
+        <_>
+          8 18 1 1 2.</_>
+        <_>
+          9 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 13 3 -1.</_>
+        <_>
+          2 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 3 -1.</_>
+        <_>
+          10 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 2 -1.</_>
+        <_>
+          14 7 2 1 2.</_>
+        <_>
+          16 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 1 -1.</_>
+        <_>
+          11 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 2 -1.</_>
+        <_>
+          10 4 4 1 2.</_>
+        <_>
+          14 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 2 -1.</_>
+        <_>
+          9 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 3 -1.</_>
+        <_>
+          12 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 1 4 -1.</_>
+        <_>
+          1 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 1 18 -1.</_>
+        <_>
+          1 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 2 -1.</_>
+        <_>
+          11 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 2 -1.</_>
+        <_>
+          0 1 6 1 2.</_>
+        <_>
+          6 2 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 2 2 -1.</_>
+        <_>
+          10 18 1 1 2.</_>
+        <_>
+          11 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 4 -1.</_>
+        <_>
+          4 5 2 2 2.</_>
+        <_>
+          6 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 1 3 -1.</_>
+        <_>
+          6 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 2 -1.</_>
+        <_>
+          16 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 6 -1.</_>
+        <_>
+          17 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 2 -1.</_>
+        <_>
+          6 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 7 -1.</_>
+        <_>
+          7 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 6 -1.</_>
+        <_>
+          0 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 1 9 -1.</_>
+        <_>
+          12 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 3 -1.</_>
+        <_>
+          6 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 13 -1.</_>
+        <_>
+          9 5 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 10 -1.</_>
+        <_>
+          19 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 6 1 -1.</_>
+        <_>
+          13 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 12 -1.</_>
+        <_>
+          11 7 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 6 -1.</_>
+        <_>
+          14 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 4 -1.</_>
+        <_>
+          16 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 2 -1.</_>
+        <_>
+          6 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 8 -1.</_>
+        <_>
+          3 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 6 5 -1.</_>
+        <_>
+          13 15 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 4 2 -1.</_>
+        <_>
+          15 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 1 -1.</_>
+        <_>
+          15 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 2 2 -1.</_>
+        <_>
+          5 18 1 1 2.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 4 -1.</_>
+        <_>
+          4 8 2 2 2.</_>
+        <_>
+          6 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 9 3 -1.</_>
+        <_>
+          11 8 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 4 -1.</_>
+        <_>
+          0 3 5 2 2.</_>
+        <_>
+          5 5 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 1 -1.</_>
+        <_>
+          9 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 3 3 -1.</_>
+        <_>
+          0 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 8 -1.</_>
+        <_>
+          0 0 3 4 2.</_>
+        <_>
+          3 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 8 -1.</_>
+        <_>
+          8 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 7 3 -1.</_>
+        <_>
+          13 8 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 2 -1.</_>
+        <_>
+          3 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 3 -1.</_>
+        <_>
+          0 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 2 -1.</_>
+        <_>
+          9 4 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 4 -1.</_>
+        <_>
+          9 5 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 12 3 -1.</_>
+        <_>
+          7 10 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 3 -1.</_>
+        <_>
+          0 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 4 -1.</_>
+        <_>
+          10 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 15 -1.</_>
+        <_>
+          3 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 5 -1.</_>
+        <_>
+          16 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 10 -1.</_>
+        <_>
+          10 2 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 12 -1.</_>
+        <_>
+          10 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 4 -1.</_>
+        <_>
+          16 6 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          13 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 1 3 -1.</_>
+        <_>
+          7 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 2 -1.</_>
+        <_>
+          12 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 1 3 -1.</_>
+        <_>
+          17 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 3 -1.</_>
+        <_>
+          0 17 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 4 -1.</_>
+        <_>
+          3 6 1 2 2.</_>
+        <_>
+          4 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 3 1 -1.</_>
+        <_>
+          14 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          2 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 2 1 -1.</_>
+        <_>
+          2 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          0 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 1 3 -1.</_>
+        <_>
+          2 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 5 -1.</_>
+        <_>
+          5 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 7 -1.</_>
+        <_>
+          4 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 8 -1.</_>
+        <_>
+          3 6 1 4 2.</_>
+        <_>
+          4 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 11 10 -1.</_>
+        <_>
+          4 10 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 2 -1.</_>
+        <_>
+          10 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 16 3 -1.</_>
+        <_>
+          9 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 4 -1.</_>
+        <_>
+          16 4 2 2 2.</_>
+        <_>
+          18 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 12 -1.</_>
+        <_>
+          16 0 2 6 2.</_>
+        <_>
+          18 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 3 1 -1.</_>
+        <_>
+          15 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 12 10 -1.</_>
+        <_>
+          3 9 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 2 2 -1.</_>
+        <_>
+          9 18 1 1 2.</_>
+        <_>
+          10 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 2 2 -1.</_>
+        <_>
+          9 18 1 1 2.</_>
+        <_>
+          10 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 14 -1.</_>
+        <_>
+          13 4 1 7 2.</_>
+        <_>
+          14 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 4 -1.</_>
+        <_>
+          7 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 20 -1.</_>
+        <_>
+          0 0 9 10 2.</_>
+        <_>
+          9 10 9 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 2 -1.</_>
+        <_>
+          15 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 4 -1.</_>
+        <_>
+          16 10 1 2 2.</_>
+        <_>
+          17 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_>
+        <_>
+          19 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 1 2 -1.</_>
+        <_>
+          9 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 6 -1.</_>
+        <_>
+          11 4 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 10 -1.</_>
+        <_>
+          9 9 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 5 4 -1.</_>
+        <_>
+          5 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 11 4 -1.</_>
+        <_>
+          5 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 2 14 -1.</_>
+        <_>
+          3 4 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 5 -1.</_>
+        <_>
+          9 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 9 -1.</_>
+        <_>
+          9 4 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 6 -1.</_>
+        <_>
+          0 10 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 6 1 -1.</_>
+        <_>
+          17 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          17 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 3 -1.</_>
+        <_>
+          10 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 15 -1.</_>
+        <_>
+          7 1 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 12 -1.</_>
+        <_>
+          12 5 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 4 3 -1.</_>
+        <_>
+          0 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 1 -1.</_>
+        <_>
+          5 0 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 4 -1.</_>
+        <_>
+          8 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 3 -1.</_>
+        <_>
+          5 0 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 3 7 -1.</_>
+        <_>
+          14 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 2 -1.</_>
+        <_>
+          7 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 6 1 -1.</_>
+        <_>
+          8 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 7 3 -1.</_>
+        <_>
+          6 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 1 -1.</_>
+        <_>
+          13 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 10 -1.</_>
+        <_>
+          15 1 1 5 2.</_>
+        <_>
+          16 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 2 2 -1.</_>
+        <_>
+          0 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 8 -1.</_>
+        <_>
+          19 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 1 3 -1.</_>
+        <_>
+          1 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 6 4 -1.</_>
+        <_>
+          0 15 3 2 2.</_>
+        <_>
+          3 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 18 -1.</_>
+        <_>
+          19 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 2 -1.</_>
+        <_>
+          12 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 2 -1.</_>
+        <_>
+          6 8 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 1 -1.</_>
+        <_>
+          18 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 6 -1.</_>
+        <_>
+          8 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 10 -1.</_>
+        <_>
+          15 5 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 2 -1.</_>
+        <_>
+          13 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 6 -1.</_>
+        <_>
+          11 3 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 2 -1.</_>
+        <_>
+          10 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 4 2 -1.</_>
+        <_>
+          9 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 4 -1.</_>
+        <_>
+          5 16 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 8 -1.</_>
+        <_>
+          7 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 6 -1.</_>
+        <_>
+          0 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 6 -1.</_>
+        <_>
+          14 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 4 -1.</_>
+        <_>
+          14 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 2 4 -1.</_>
+        <_>
+          1 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 4 -1.</_>
+        <_>
+          13 3 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 10 -1.</_>
+        <_>
+          4 10 1 5 2.</_>
+        <_>
+          5 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 3 -1.</_>
+        <_>
+          5 16 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 9 -1.</_>
+        <_>
+          2 2 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 4 -1.</_>
+        <_>
+          19 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 6 8 -1.</_>
+        <_>
+          14 11 3 4 2.</_>
+        <_>
+          17 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 6 -1.</_>
+        <_>
+          15 12 2 3 2.</_>
+        <_>
+          17 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 2 2 -1.</_>
+        <_>
+          2 3 1 1 2.</_>
+        <_>
+          3 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 3 -1.</_>
+        <_>
+          11 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 7 8 -1.</_>
+        <_>
+          5 13 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 3 -1.</_>
+        <_>
+          14 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 8 -1.</_>
+        <_>
+          6 7 2 4 2.</_>
+        <_>
+          8 11 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 3 -1.</_>
+        <_>
+          1 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 10 -1.</_>
+        <_>
+          8 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 6 -1.</_>
+        <_>
+          5 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 4 -1.</_>
+        <_>
+          3 10 2 2 2.</_>
+        <_>
+          5 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 4 -1.</_>
+        <_>
+          3 10 2 2 2.</_>
+        <_>
+          5 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 4 -1.</_>
+        <_>
+          3 10 2 2 2.</_>
+        <_>
+          5 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 2 6 -1.</_>
+        <_>
+          15 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 4 -1.</_>
+        <_>
+          3 10 2 2 2.</_>
+        <_>
+          5 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 4 -1.</_>
+        <_>
+          3 10 2 2 2.</_>
+        <_>
+          5 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 9 -1.</_>
+        <_>
+          13 4 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 1 12 -1.</_>
+        <_>
+          12 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 1 -1.</_>
+        <_>
+          8 0 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          10 0 5 3 2.</_>
+        <_>
+          15 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 2 -1.</_>
+        <_>
+          3 5 2 1 2.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 3 -1.</_>
+        <_>
+          12 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 5 -1.</_>
+        <_>
+          12 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 15 1 -1.</_>
+        <_>
+          8 19 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 2 -1.</_>
+        <_>
+          8 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 4 -1.</_>
+        <_>
+          2 12 4 2 2.</_>
+        <_>
+          6 14 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 2 -1.</_>
+        <_>
+          8 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 5 -1.</_>
+        <_>
+          7 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 17 -1.</_>
+        <_>
+          19 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          16 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 7 -1.</_>
+        <_>
+          15 8 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 2 2 -1.</_>
+        <_>
+          10 17 1 1 2.</_>
+        <_>
+          11 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 1 3 -1.</_>
+        <_>
+          4 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 3 -1.</_>
+        <_>
+          18 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 10 -1.</_>
+        <_>
+          13 1 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 9 1 -1.</_>
+        <_>
+          11 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 2 2 -1.</_>
+        <_>
+          5 18 1 1 2.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 9 -1.</_>
+        <_>
+          19 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 4 -1.</_>
+        <_>
+          4 7 1 2 2.</_>
+        <_>
+          5 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 14 -1.</_>
+        <_>
+          3 4 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 3 -1.</_>
+        <_>
+          13 5 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 6 -1.</_>
+        <_>
+          18 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 7 -1.</_>
+        <_>
+          6 6 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 8 -1.</_>
+        <_>
+          13 4 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 9 -1.</_>
+        <_>
+          0 11 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 3 -1.</_>
+        <_>
+          0 8 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 7 2 -1.</_>
+        <_>
+          8 2 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 5 -1.</_>
+        <_>
+          8 5 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 2 -1.</_>
+        <_>
+          19 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 11 -1.</_>
+        <_>
+          11 7 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 6 1 -1.</_>
+        <_>
+          11 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 1 -1.</_>
+        <_>
+          7 0 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 5 -1.</_>
+        <_>
+          6 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 12 6 -1.</_>
+        <_>
+          10 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 2 3 -1.</_>
+        <_>
+          16 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 2 -1.</_>
+        <_>
+          7 15 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 2 -1.</_>
+        <_>
+          7 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 4 -1.</_>
+        <_>
+          3 10 1 2 2.</_>
+        <_>
+          4 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 6 -1.</_>
+        <_>
+          0 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 2 2 -1.</_>
+        <_>
+          1 10 1 1 2.</_>
+        <_>
+          2 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 3 -1.</_>
+        <_>
+          16 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 4 -1.</_>
+        <_>
+          5 10 1 2 2.</_>
+        <_>
+          6 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 13 2 -1.</_>
+        <_>
+          5 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 11 -1.</_>
+        <_>
+          11 2 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 4 -1.</_>
+        <_>
+          10 4 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 2 -1.</_>
+        <_>
+          10 8 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 3 -1.</_>
+        <_>
+          12 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 14 2 -1.</_>
+        <_>
+          6 18 7 1 2.</_>
+        <_>
+          13 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 12 -1.</_>
+        <_>
+          17 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 10 3 -1.</_>
+        <_>
+          10 6 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 3 -1.</_>
+        <_>
+          7 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 1 -1.</_>
+        <_>
+          14 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 6 -1.</_>
+        <_>
+          10 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 14 -1.</_>
+        <_>
+          8 1 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 14 -1.</_>
+        <_>
+          16 1 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 2 -1.</_>
+        <_>
+          3 16 1 1 2.</_>
+        <_>
+          4 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 6 -1.</_>
+        <_>
+          15 6 2 3 2.</_>
+        <_>
+          17 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 2 -1.</_>
+        <_>
+          12 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 13 -1.</_>
+        <_>
+          9 6 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 5 -1.</_>
+        <_>
+          3 9 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 4 -1.</_>
+        <_>
+          0 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 2 -1.</_>
+        <_>
+          4 1 8 1 2.</_>
+        <_>
+          12 2 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 2 -1.</_>
+        <_>
+          1 18 2 1 2.</_>
+        <_>
+          3 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 4 -1.</_>
+        <_>
+          8 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 9 3 -1.</_>
+        <_>
+          6 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 10 -1.</_>
+        <_>
+          6 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 10 -1.</_>
+        <_>
+          13 0 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 1 -1.</_>
+        <_>
+          12 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 16 -1.</_>
+        <_>
+          6 2 4 8 2.</_>
+        <_>
+          10 10 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 10 -1.</_>
+        <_>
+          14 10 1 5 2.</_>
+        <_>
+          15 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 8 -1.</_>
+        <_>
+          17 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 5 -1.</_>
+        <_>
+          17 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 11 2 -1.</_>
+        <_>
+          4 6 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 3 -1.</_>
+        <_>
+          0 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 11 -1.</_>
+        <_>
+          13 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 1 -1.</_>
+        <_>
+          15 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 2 -1.</_>
+        <_>
+          19 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 9 -1.</_>
+        <_>
+          18 0 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 2 -1.</_>
+        <_>
+          0 1 7 1 2.</_>
+        <_>
+          7 2 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 2 -1.</_>
+        <_>
+          4 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 2 -1.</_>
+        <_>
+          9 0 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 1 -1.</_>
+        <_>
+          12 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 11 -1.</_>
+        <_>
+          11 4 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 2 4 -1.</_>
+        <_>
+          2 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 3 -1.</_>
+        <_>
+          8 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 2 -1.</_>
+        <_>
+          9 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 9 2 -1.</_>
+        <_>
+          9 8 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 10 -1.</_>
+        <_>
+          6 6 1 5 2.</_>
+        <_>
+          7 11 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 3 -1.</_>
+        <_>
+          0 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 4 1 -1.</_>
+        <_>
+          13 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 1 2 -1.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 20 -1.</_>
+        <_>
+          2 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 2 -1.</_>
+        <_>
+          4 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 5 -1.</_>
+        <_>
+          5 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 2 -1.</_>
+        <_>
+          5 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 16 -1.</_>
+        <_>
+          16 1 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 6 3 -1.</_>
+        <_>
+          8 16 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 3 2 -1.</_>
+        <_>
+          15 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 1 2 -1.</_>
+        <_>
+          12 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 4 -1.</_>
+        <_>
+          0 2 2 2 2.</_>
+        <_>
+          2 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 4 -1.</_>
+        <_>
+          1 1 3 2 2.</_>
+        <_>
+          4 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 1 2 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 3 -1.</_>
+        <_>
+          4 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 14 -1.</_>
+        <_>
+          1 7 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 3 -1.</_>
+        <_>
+          5 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 4 -1.</_>
+        <_>
+          0 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 10 -1.</_>
+        <_>
+          17 6 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 1 -1.</_>
+        <_>
+          17 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 9 2 -1.</_>
+        <_>
+          13 11 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          15 10 1 1 2.</_>
+        <_>
+          16 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 14 -1.</_>
+        <_>
+          10 13 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 5 -1.</_>
+        <_>
+          15 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 3 -1.</_>
+        <_>
+          10 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 4 -1.</_>
+        <_>
+          8 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 2 -1.</_>
+        <_>
+          11 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 2 -1.</_>
+        <_>
+          3 4 4 1 2.</_>
+        <_>
+          7 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 6 -1.</_>
+        <_>
+          2 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 2 -1.</_>
+        <_>
+          7 5 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 3 -1.</_>
+        <_>
+          9 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 3 3 -1.</_>
+        <_>
+          2 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 1 -1.</_>
+        <_>
+          5 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 2 -1.</_>
+        <_>
+          9 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 9 1 -1.</_>
+        <_>
+          7 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 11 12 -1.</_>
+        <_>
+          7 13 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 4 -1.</_>
+        <_>
+          4 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 3 -1.</_>
+        <_>
+          12 7 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 6 -1.</_>
+        <_>
+          15 11 1 3 2.</_>
+        <_>
+          16 14 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 3 -1.</_>
+        <_>
+          0 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 12 -1.</_>
+        <_>
+          10 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 13 -1.</_>
+        <_>
+          8 7 5 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 9 -1.</_>
+        <_>
+          0 12 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 8 -1.</_>
+        <_>
+          17 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 2 -1.</_>
+        <_>
+          18 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 5 -1.</_>
+        <_>
+          16 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 2 -1.</_>
+        <_>
+          16 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 2 -1.</_>
+        <_>
+          12 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 2 12 -1.</_>
+        <_>
+          1 8 1 6 2.</_>
+        <_>
+          2 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          2 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 3 -1.</_>
+        <_>
+          19 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 10 -1.</_>
+        <_>
+          12 3 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 8 -1.</_>
+        <_>
+          11 1 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 6 -1.</_>
+        <_>
+          6 15 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 2 -1.</_>
+        <_>
+          9 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 4 -1.</_>
+        <_>
+          14 10 1 2 2.</_>
+        <_>
+          15 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 2 2 -1.</_>
+        <_>
+          0 15 1 1 2.</_>
+        <_>
+          1 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 2 2 -1.</_>
+        <_>
+          11 18 1 1 2.</_>
+        <_>
+          12 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 4 -1.</_>
+        <_>
+          0 0 3 2 2.</_>
+        <_>
+          3 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 6 -1.</_>
+        <_>
+          6 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 5 4 -1.</_>
+        <_>
+          15 15 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 1 -1.</_>
+        <_>
+          9 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 19 4 1 -1.</_>
+        <_>
+          18 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 4 4 -1.</_>
+        <_>
+          18 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 4 -1.</_>
+        <_>
+          10 8 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 4 -1.</_>
+        <_>
+          2 9 1 2 2.</_>
+        <_>
+          3 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 4 -1.</_>
+        <_>
+          0 3 4 2 2.</_>
+        <_>
+          4 5 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 1 -1.</_>
+        <_>
+          4 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 9 -1.</_>
+        <_>
+          4 5 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 2 -1.</_>
+        <_>
+          9 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 1 12 -1.</_>
+        <_>
+          0 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 6 -1.</_>
+        <_>
+          19 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 8 -1.</_>
+        <_>
+          4 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 17 -1.</_>
+        <_>
+          3 0 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 8 -1.</_>
+        <_>
+          9 9 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 9 4 -1.</_>
+        <_>
+          8 10 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 3 -1.</_>
+        <_>
+          5 1 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 4 -1.</_>
+        <_>
+          16 6 2 2 2.</_>
+        <_>
+          18 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 8 -1.</_>
+        <_>
+          17 4 1 4 2.</_>
+        <_>
+          18 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 1 3 -1.</_>
+        <_>
+          2 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 1 3 -1.</_>
+        <_>
+          2 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 1 3 -1.</_>
+        <_>
+          11 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 7 -1.</_>
+        <_>
+          14 2 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 6 -1.</_>
+        <_>
+          11 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 15 2 -1.</_>
+        <_>
+          5 10 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 6 2 -1.</_>
+        <_>
+          8 17 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 10 2 -1.</_>
+        <_>
+          9 16 5 1 2.</_>
+        <_>
+          14 17 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 2 2 -1.</_>
+        <_>
+          9 17 1 1 2.</_>
+        <_>
+          10 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 4 -1.</_>
+        <_>
+          10 15 3 2 2.</_>
+        <_>
+          13 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 15 12 -1.</_>
+        <_>
+          9 5 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 3 -1.</_>
+        <_>
+          11 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 7 3 -1.</_>
+        <_>
+          8 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 1 2 -1.</_>
+        <_>
+          1 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 1 -1.</_>
+        <_>
+          4 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 1 12 -1.</_>
+        <_>
+          1 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 3 6 -1.</_>
+        <_>
+          0 11 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 10 -1.</_>
+        <_>
+          6 4 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 1 -1.</_>
+        <_>
+          7 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 12 -1.</_>
+        <_>
+          3 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 9 2 -1.</_>
+        <_>
+          7 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 9 1 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 10 -1.</_>
+        <_>
+          17 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 10 -1.</_>
+        <_>
+          4 10 1 5 2.</_>
+        <_>
+          5 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 12 -1.</_>
+        <_>
+          13 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 6 -1.</_>
+        <_>
+          15 3 2 3 2.</_>
+        <_>
+          17 6 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 3 -1.</_>
+        <_>
+          13 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 4 -1.</_>
+        <_>
+          4 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 1 3 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 2 3 -1.</_>
+        <_>
+          2 1 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 1 -1.</_>
+        <_>
+          2 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 12 3 -1.</_>
+        <_>
+          12 17 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 4 -1.</_>
+        <_>
+          11 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 6 -1.</_>
+        <_>
+          4 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 9 -1.</_>
+        <_>
+          6 5 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 20 -1.</_>
+        <_>
+          6 0 7 10 2.</_>
+        <_>
+          13 10 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 3 -1.</_>
+        <_>
+          19 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 2 -1.</_>
+        <_>
+          13 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 2 -1.</_>
+        <_>
+          0 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 6 -1.</_>
+        <_>
+          19 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 1 -1.</_>
+        <_>
+          17 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 1 3 -1.</_>
+        <_>
+          13 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 3 -1.</_>
+        <_>
+          17 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 8 -1.</_>
+        <_>
+          5 4 4 4 2.</_>
+        <_>
+          9 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 2 2 -1.</_>
+        <_>
+          1 2 1 1 2.</_>
+        <_>
+          2 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 6 -1.</_>
+        <_>
+          0 0 4 3 2.</_>
+        <_>
+          4 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 2 -1.</_>
+        <_>
+          6 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 3 -1.</_>
+        <_>
+          1 1 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 2 -1.</_>
+        <_>
+          6 2 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 12 6 -1.</_>
+        <_>
+          6 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 9 2 -1.</_>
+        <_>
+          4 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 4 -1.</_>
+        <_>
+          9 15 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 12 1 -1.</_>
+        <_>
+          12 15 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 3 -1.</_>
+        <_>
+          17 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 2 -1.</_>
+        <_>
+          17 15 1 1 2.</_>
+        <_>
+          18 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 3 -1.</_>
+        <_>
+          3 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 1 3 -1.</_>
+        <_>
+          10 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 8 -1.</_>
+        <_>
+          11 0 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 2 -1.</_>
+        <_>
+          6 0 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 3 -1.</_>
+        <_>
+          4 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 1 2 -1.</_>
+        <_>
+          13 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          8 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 2 -1.</_>
+        <_>
+          18 2 1 1 2.</_>
+        <_>
+          19 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 14 -1.</_>
+        <_>
+          16 1 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 2 -1.</_>
+        <_>
+          15 6 1 1 2.</_>
+        <_>
+          16 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 3 -1.</_>
+        <_>
+          5 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 17 1 1 2.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 10 -1.</_>
+        <_>
+          11 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 3 -1.</_>
+        <_>
+          12 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 10 -1.</_>
+        <_>
+          14 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 2 -1.</_>
+        <_>
+          11 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 1 3 -1.</_>
+        <_>
+          8 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 2 2 -1.</_>
+        <_>
+          12 15 1 1 2.</_>
+        <_>
+          13 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 4 -1.</_>
+        <_>
+          6 8 3 2 2.</_>
+        <_>
+          9 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 5 -1.</_>
+        <_>
+          8 5 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 7 3 -1.</_>
+        <_>
+          0 6 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 6 -1.</_>
+        <_>
+          9 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 8 -1.</_>
+        <_>
+          5 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 1 -1.</_>
+        <_>
+          12 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 11 -1.</_>
+        <_>
+          15 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 2 2 -1.</_>
+        <_>
+          8 17 1 1 2.</_>
+        <_>
+          9 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 1 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 3 2 -1.</_>
+        <_>
+          11 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 1 -1.</_>
+        <_>
+          10 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 6 -1.</_>
+        <_>
+          4 3 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 12 -1.</_>
+        <_>
+          14 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 3 2 -1.</_>
+        <_>
+          12 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 1 -1.</_>
+        <_>
+          8 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 1 -1.</_>
+        <_>
+          12 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 2 1 -1.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 7 -1.</_>
+        <_>
+          17 11 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 6 -1.</_>
+        <_>
+          19 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 3 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 4 -1.</_>
+        <_>
+          16 8 2 2 2.</_>
+        <_>
+          18 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 2 2 -1.</_>
+        <_>
+          2 8 1 1 2.</_>
+        <_>
+          3 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 4 -1.</_>
+        <_>
+          3 5 3 2 2.</_>
+        <_>
+          6 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 16 -1.</_>
+        <_>
+          2 3 4 8 2.</_>
+        <_>
+          6 11 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 3 -1.</_>
+        <_>
+          17 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 11 -1.</_>
+        <_>
+          11 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 14 -1.</_>
+        <_>
+          16 3 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 2 -1.</_>
+        <_>
+          6 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 14 3 -1.</_>
+        <_>
+          6 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 9 3 -1.</_>
+        <_>
+          13 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 6 -1.</_>
+        <_>
+          3 5 2 3 2.</_>
+        <_>
+          5 8 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 7 -1.</_>
+        <_>
+          4 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 11 6 -1.</_>
+        <_>
+          2 10 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 3 -1.</_>
+        <_>
+          8 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 11 -1.</_>
+        <_>
+          4 3 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 6 1 -1.</_>
+        <_>
+          3 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 1 2 -1.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 0 6 3 2.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 3 -1.</_>
+        <_>
+          19 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 1 -1.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 1 -1.</_>
+        <_>
+          14 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 15 13 -1.</_>
+        <_>
+          8 6 5 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 2 -1.</_>
+        <_>
+          6 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 1 2 -1.</_>
+        <_>
+          0 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 6 -1.</_>
+        <_>
+          8 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 19 -1.</_>
+        <_>
+          5 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 5 -1.</_>
+        <_>
+          5 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 14 3 6 -1.</_>
+        <_>
+          17 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 2 6 -1.</_>
+        <_>
+          18 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          18 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 4 -1.</_>
+        <_>
+          14 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 6 -1.</_>
+        <_>
+          15 8 2 3 2.</_>
+        <_>
+          17 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 1 3 -1.</_>
+        <_>
+          1 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 14 -1.</_>
+        <_>
+          8 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 1 -1.</_>
+        <_>
+          13 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 9 -1.</_>
+        <_>
+          17 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          13 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 18 -1.</_>
+        <_>
+          13 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 10 -1.</_>
+        <_>
+          8 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 3 -1.</_>
+        <_>
+          8 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 9 -1.</_>
+        <_>
+          11 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 6 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 2 2 -1.</_>
+        <_>
+          12 18 1 1 2.</_>
+        <_>
+          13 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 1 3 -1.</_>
+        <_>
+          1 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 19 2 1 -1.</_>
+        <_>
+          13 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 6 -1.</_>
+        <_>
+          10 10 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 5 -1.</_>
+        <_>
+          16 2 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 2 2 -1.</_>
+        <_>
+          2 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 6 -1.</_>
+        <_>
+          10 16 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 2 -1.</_>
+        <_>
+          6 9 3 1 2.</_>
+        <_>
+          9 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 12 -1.</_>
+        <_>
+          0 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 1 -1.</_>
+        <_>
+          9 0 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 2 -1.</_>
+        <_>
+          9 0 4 1 2.</_>
+        <_>
+          13 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 1 -1.</_>
+        <_>
+          16 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 6 -1.</_>
+        <_>
+          7 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 3 -1.</_>
+        <_>
+          18 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 12 1 1 2.</_>
+        <_>
+          5 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 2 -1.</_>
+        <_>
+          8 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 6 -1.</_>
+        <_>
+          3 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          18 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 16 -1.</_>
+        <_>
+          13 2 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 13 -1.</_>
+        <_>
+          7 4 5 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 10 -1.</_>
+        <_>
+          17 2 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 1 -1.</_>
+        <_>
+          7 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 16 -1.</_>
+        <_>
+          10 1 9 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 15 -1.</_>
+        <_>
+          15 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 2 -1.</_>
+        <_>
+          19 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 5 8 -1.</_>
+        <_>
+          2 10 5 4 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_eye_tree_eyeglasses.xml b/venv/Lib/site-packages/cv2/data/haarcascade_eye_tree_eyeglasses.xml
new file mode 100644
index 000000000..6813d243c
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_eye_tree_eyeglasses.xml
@@ -0,0 +1,22619 @@
+<?xml version="1.0"?>
+<!--
+    Tree-based 20x20 frontal eye detector with better handling of eyeglasses.
+    Created by Shameem Hameed (http://umich.edu/~shameem)
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>47</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>30</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>5</maxWeakCount>
+      <stageThreshold>-1.6473180055618286e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 0 -2.6987109333276749e-02 0 -1 1 5.0670530647039413e-02
+            -2 -3 2 -1.2915390729904175e-01</internalNodes>
+          <leafValues>
+            -8.0395472049713135e-01 6.0491400957107544e-01
+            9.0544581413269043e-01 4.4070810079574585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 3 8.8827736675739288e-02 0 -1 4 -2.0398240536451340e-02
+            -2 -3 5 -6.1261758208274841e-02</internalNodes>
+          <leafValues>
+            7.9218882322311401e-01 4.0692299604415894e-02
+            4.2585361003875732e-01 -7.0325207710266113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 6 -2.0490810275077820e-01 0 -1 7 9.4933047890663147e-02
+            -2 -3 8 1.2091030366718769e-03</internalNodes>
+          <leafValues>
+            -4.4017648696899414e-01 5.3640520572662354e-01
+            6.8776458501815796e-01 -5.5879348516464233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 9 9.2227972345426679e-04 -1 2 10 -7.2678289143368602e-04
+            -2 -3 11 6.8421510513871908e-04</internalNodes>
+          <leafValues>
+            -7.2684401273727417e-01 -5.8028000593185425e-01
+            5.6177532672882080e-01 -2.9834181070327759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 12 -5.1150590181350708e-02 2 -1 13
+            6.1622060835361481e-02 -2 -3 14 7.2873473167419434e-02</internalNodes>
+          <leafValues>
+            5.9840762615203857e-01 7.4743932485580444e-01
+            -4.9703779816627502e-01 2.8129258751869202e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>7</maxWeakCount>
+      <stageThreshold>-1.4257860183715820e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 15 -4.1994878649711609e-01 0 -1 16
+            -5.6186288595199585e-02 -2 -3 17 -2.3711109533905983e-02</internalNodes>
+          <leafValues>
+            2.7586200833320618e-01 -6.4623218774795532e-01
+            8.5241252183914185e-01 8.3703370764851570e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 18 4.0523439645767212e-02 -1 2 19 2.7388900518417358e-01
+            -2 -3 20 -1.4293800108134747e-02</internalNodes>
+          <leafValues>
+            7.4270218610763550e-01 -4.9286690354347229e-01
+            7.1784788370132446e-01 -4.2223978787660599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 21 -2.1144729107618332e-03 2 -1 22
+            1.0659949621185660e-03 -2 -3 23 1.0812469990924001e-03</internalNodes>
+          <leafValues>
+            -8.0196601152420044e-01 -6.6025912761688232e-01
+            4.7916370630264282e-01 -5.1645290851593018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 24 3.0198289081454277e-02 2 -1 25 4.0569551289081573e-02
+            -2 -3 26 7.0679739117622375e-02</internalNodes>
+          <leafValues>
+            5.1327562332153320e-01 6.6641497611999512e-01
+            -4.5298659801483154e-01 5.5480718612670898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 27 -7.8928138827905059e-04 2 -1 28
+            8.0574717139825225e-04 -2 -3 29 -2.0976560190320015e-02</internalNodes>
+          <leafValues>
+            -7.2526299953460693e-01 -5.6479871273040771e-01
+            6.9993537664413452e-01 6.8500466644763947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 30 1.2794960290193558e-02 -1 2 31
+            -8.1120636314153671e-03 -2 -3 32 -1.5506530180573463e-02</internalNodes>
+          <leafValues>
+            -8.6409568786621094e-01 4.4448360800743103e-01
+            3.6675310134887695e-01 -2.9189071059226990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 33 -1.2915650382637978e-02 0 -1 34
+            6.6297221928834915e-03 -2 -3 35 -3.6532930098474026e-03</internalNodes>
+          <leafValues>
+            -4.7566780447959900e-01 1.0350350290536880e-01
+            -6.1723059415817261e-01 5.4382532835006714e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.4711019992828369e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 36 -7.8731971979141235e-01 -1 2 37
+            1.6908009350299835e-01 -2 -3 38 -4.0369689464569092e-02</internalNodes>
+          <leafValues>
+            7.1268838644027710e-01 -7.1908998489379883e-01
+            4.4148930907249451e-01 -4.2251929640769958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 39 1.9132360816001892e-02 2 -1 40 6.4184539951384068e-04
+            -2 -3 41 -7.8941037645563483e-04</internalNodes>
+          <leafValues>
+            6.9186228513717651e-01 -7.6116967201232910e-01
+            -6.8140429258346558e-01 1.6009919345378876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 42 -7.1503049694001675e-03 0 -1 43
+            -2.3156129755079746e-03 -2 -3 44 -4.1521269828081131e-02</internalNodes>
+          <leafValues>
+            -5.5916607379913330e-01 5.1284497976303101e-01
+            2.4422569572925568e-01 -4.6883401274681091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 45 9.1200548922643065e-04 -1 2 46
+            -1.5798299573361874e-03 -2 -3 47 -1.1573649942874908e-02</internalNodes>
+          <leafValues>
+            -6.9527888298034668e-01 -6.3509649038314819e-01
+            6.4686381816864014e-01 6.9198559504002333e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 48 2.1843519061803818e-03 0 -1 49 2.9345690272748470e-03
+            -2 -3 50 -5.8788150548934937e-02</internalNodes>
+          <leafValues>
+            4.5632898807525635e-01 -5.8841437101364136e-01
+            2.6704201102256775e-01 -3.8348990678787231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 51 -5.5392808280885220e-04 -1 2 52
+            -5.3035060409456491e-04 -2 -3 53 -6.8775108084082603e-03</internalNodes>
+          <leafValues>
+            -4.8913368582725525e-01 -3.8421550393104553e-01
+            6.6845697164535522e-01 9.3158259987831116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 54 1.6710379859432578e-03 2 -1 55 1.4162790030241013e-03
+            -2 -3 56 7.7876187860965729e-03</internalNodes>
+          <leafValues>
+            -6.0369372367858887e-01 -3.0418768525123596e-01
+            3.9699068665504456e-01 -6.6687589883804321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 57 -1.2916780076920986e-02 0 -1 58
+            -3.0156269203871489e-03 -2 -3 59 -1.9785940647125244e-02</internalNodes>
+          <leafValues>
+            -7.1239727735519409e-01 4.6252989768981934e-01
+            2.8338319063186646e-01 -3.5317930579185486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 60 3.3207770902663469e-03 2 -1 61 2.9606239870190620e-02
+            -2 -3 62 4.4614788144826889e-02</internalNodes>
+          <leafValues>
+            -7.3291397094726562e-01 4.9530759453773499e-01
+            -1.9502809643745422e-01 7.9816418886184692e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.3850779533386230e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 63 -9.2366141080856323e-01 2 -1 64
+            -4.8193939030170441e-02 -2 -3 65 2.8669878840446472e-01</internalNodes>
+          <leafValues>
+            7.6915800571441650e-01 -5.1361227035522461e-01
+            -2.9671901464462280e-01 6.2028187513351440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 66 -1.3038160279393196e-02 0 -1 67
+            -1.4749659458175302e-03 -2 -3 68 -4.6921748667955399e-02</internalNodes>
+          <leafValues>
+            -7.1294248104095459e-01 5.9115177392959595e-01
+            3.1303560733795166e-01 -3.6749690771102905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 69 2.4459899868816137e-03 -1 2 70
+            -2.5321498978883028e-03 -2 -3 71 1.4651260571554303e-03</internalNodes>
+          <leafValues>
+            -4.6930000185966492e-01 -7.7450162172317505e-01
+            3.6414781212806702e-01 -5.7445889711380005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 72 -1.1307420209050179e-02 0 -1 73
+            -1.2048849603161216e-03 -2 -3 74 -6.2752872705459595e-02</internalNodes>
+          <leafValues>
+            -5.5727648735046387e-01 4.7871670126914978e-01
+            2.2788530588150024e-01 -4.3667969107627869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 75 -4.0173111483454704e-03 2 -1 76
+            1.5160309849306941e-03 -2 -3 77 1.9954680465161800e-03</internalNodes>
+          <leafValues>
+            -7.3568779230117798e-01 -5.8480697870254517e-01
+            2.1544020622968674e-02 5.5875688791275024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 78 3.4435209818184376e-03 -1 2 79
+            -2.6550020556896925e-03 -2 -3 80 -1.1407690122723579e-02</internalNodes>
+          <leafValues>
+            -7.6565897464752197e-01 -6.5447497367858887e-01
+            5.3633081912994385e-01 -3.8849171251058578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 81 -2.3805440869182348e-03 0 -1 82
+            6.6475258208811283e-03 -2 -3 83 1.4018240571022034e-01</internalNodes>
+          <leafValues>
+            3.3984410762786865e-01 -6.5025091171264648e-01
+            -3.2491090893745422e-01 7.5067067146301270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 84 -6.2358360737562180e-02 2 -1 85
+            1.3628599699586630e-03 -2 -3 86 -4.4609848409891129e-03</internalNodes>
+          <leafValues>
+            4.5777168869972229e-01 -6.3202661275863647e-01
+            4.0597960352897644e-01 -2.0854069292545319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 87 -1.0046839714050293e-02 2 -1 88
+            -2.9274819418787956e-02 -2 -3 89 7.7389390207827091e-03</internalNodes>
+          <leafValues>
+            -7.4789828062057495e-01 -1.7995479702949524e-01
+            4.7782841324806213e-01 -6.5113341808319092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 90 1.4774020528420806e-03 -1 2 91 1.4989820308983326e-02
+            -2 -3 92 4.5073241926729679e-03</internalNodes>
+          <leafValues>
+            -6.6269898414611816e-01 -1.6695550084114075e-01
+            3.8702058792114258e-01 -7.3409372568130493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 93 1.4901049435138702e-03 2 -1 94 8.9141662465408444e-04
+            -2 -3 95 -1.1558219790458679e-02</internalNodes>
+          <leafValues>
+            -3.4280839562416077e-01 -2.8036740422248840e-01
+            -4.2523959279060364e-01 4.5259669423103333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 96 -2.0011950284242630e-02 -1 2 97
+            -1.7092300578951836e-02 -2 -3 98 -6.7685171961784363e-02</internalNodes>
+          <leafValues>
+            4.0133118629455566e-01 3.6970010399818420e-01
+            7.4438679218292236e-01 -3.8255840539932251e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.4432040452957153e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 99 -2.0911149680614471e-02 0 -1 100
+            1.4305709302425385e-01 -2 -3 101 1.1925029568374157e-02</internalNodes>
+          <leafValues>
+            -3.4965568780899048e-01 7.0134562253952026e-01
+            -6.0404628515243530e-01 8.5615903139114380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 102 2.4742009118199348e-02 2 -1 103
+            4.5732118189334869e-02 -2 -3 104 4.3204430490732193e-02</internalNodes>
+          <leafValues>
+            8.5365587472915649e-01 4.1876411437988281e-01
+            -3.9094918966293335e-01 2.7387988567352295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 105 -7.2548422031104565e-04 2 -1 106
+            1.4243220211938024e-03 -2 -3 107 -5.3335479460656643e-03</internalNodes>
+          <leafValues>
+            -6.2011122703552246e-01 -6.1589437723159790e-01
+            6.0596448183059692e-01 1.5840480104088783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 108 -7.1891010738909245e-03 2 -1 109
+            1.8233320442959666e-03 -2 -3 110 1.6109029529616237e-03</internalNodes>
+          <leafValues>
+            -2.0852829515933990e-01 -8.1338381767272949e-01
+            5.6780648231506348e-01 -8.7046259641647339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 111 -4.8350278288125992e-02 0 -1 112
+            3.1746171414852142e-02 -2 -3 113 1.9233829807490110e-03</internalNodes>
+          <leafValues>
+            -3.5335820913314819e-01 4.4076570868492126e-01
+            4.0730631351470947e-01 -5.9592568874359131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 114 1.3614529743790627e-03 -1 2 115
+            -3.6934199742972851e-03 -2 -3 116 -8.5378461517393589e-04</internalNodes>
+          <leafValues>
+            -5.5307251214981079e-01 -7.3163098096847534e-01
+            4.3890678882598877e-01 -6.3009172677993774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 117 -1.0950770229101181e-02 -1 2 118
+            -7.2186449542641640e-03 -2 -3 119 1.8548289313912392e-02</internalNodes>
+          <leafValues>
+            3.9263078570365906e-01 2.7225250005722046e-01
+            -4.1208618879318237e-01 6.3790637254714966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 120 1.0859060566872358e-03 -1 2 121
+            -6.5618362277746201e-03 -2 -3 122 -6.1777420341968536e-02</internalNodes>
+          <leafValues>
+            -5.0857210159301758e-01 3.5386729240417480e-01
+            5.7568281888961792e-01 -2.8477248549461365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 123 4.9480778397992253e-04 2 -1 124
+            1.1606880463659763e-02 -2 -3 125 -1.6142609529197216e-03</internalNodes>
+          <leafValues>
+            -4.9583891034126282e-01 -5.1320201158523560e-01
+            5.2665728330612183e-01 3.0917160212993622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 126 2.0437680650502443e-03 -1 2 127
+            -8.2394909113645554e-03 -2 -3 128 -3.9699211716651917e-02</internalNodes>
+          <leafValues>
+            -7.0948588848114014e-01 3.4189811348915100e-01
+            4.7383341193199158e-01 -2.5060850381851196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 129 -8.0377282574772835e-04 0 -1 130
+            -5.4273242130875587e-03 -2 -3 131 -5.2662738598883152e-03</internalNodes>
+          <leafValues>
+            -5.1384007930755615e-01 2.9752710461616516e-01
+            1.4577029645442963e-01 -4.6007528901100159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 132 6.3841522205621004e-04 -1 2 133
+            -1.5458120033144951e-03 -2 -3 134 1.1863360414281487e-03</internalNodes>
+          <leafValues>
+            -3.6412829160690308e-01 -5.8081609010696411e-01
+            2.9298609495162964e-01 -5.1420718431472778e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.5415630340576172e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 135 -2.7745011448860168e-01 0 -1 136
+            -3.1200000084936619e-03 -2 -3 137 -8.0280922353267670e-02</internalNodes>
+          <leafValues>
+            8.3265638351440430e-01 1.0233189910650253e-01
+            2.3773579299449921e-01 -6.4546662569046021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 138 -6.9391548633575439e-02 2 -1 139
+            5.3355181589722633e-03 -2 -3 140 -5.4189618676900864e-02</internalNodes>
+          <leafValues>
+            4.6008241176605225e-01 2.9137989878654480e-01
+            4.7026729583740234e-01 -5.7723402976989746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 141 1.8562959507107735e-02 -1 2 142
+            4.6305730938911438e-02 -2 -3 143 -8.8262781500816345e-03</internalNodes>
+          <leafValues>
+            7.0555502176284790e-01 -5.2839881181716919e-01
+            4.3953609466552734e-01 -1.3887490332126617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 144 -2.8772179502993822e-03 -1 2 145
+            -2.6457069907337427e-03 -2 -3 146 3.3441530540585518e-03</internalNodes>
+          <leafValues>
+            -2.7475830912590027e-01 -5.7746797800064087e-01
+            3.6615240573883057e-01 -6.3586741685867310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 147 -8.3742372691631317e-02 0 -1 148
+            1.0164769738912582e-01 -2 -3 149 -2.1541758906096220e-03</internalNodes>
+          <leafValues>
+            -2.9664519429206848e-01 5.6140047311782837e-01
+            -7.5446271896362305e-01 3.9601260423660278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 150 -1.7133549554273486e-03 2 -1 151
+            1.3899410143494606e-02 -2 -3 152 -2.8498120605945587e-02</internalNodes>
+          <leafValues>
+            -7.3741632699966431e-01 4.8247390985488892e-01
+            4.1971048712730408e-01 -2.0021289587020874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 153 -4.9728769809007645e-03 2 -1 154
+            -3.4751880913972855e-02 -2 -3 155 -8.7171117775142193e-04</internalNodes>
+          <leafValues>
+            3.7631350755691528e-01 -4.4797790050506592e-01
+            -6.9995099306106567e-01 1.5640909969806671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 156 -3.3666230738162994e-03 -1 2 157
+            -2.1378830075263977e-02 -2 -3 158 -1.1869249865412712e-02</internalNodes>
+          <leafValues>
+            -6.7721921205520630e-01 3.3951529860496521e-01
+            5.4050672054290771e-01 -2.4071580171585083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 159 -4.4268160127103329e-03 2 -1 160
+            4.1405398398637772e-02 -2 -3 161 -3.7884410470724106e-02</internalNodes>
+          <leafValues>
+            -7.3965507745742798e-01 8.2905638217926025e-01
+            1.7030739784240723e-01 -2.4498699605464935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 162 3.7567419349215925e-04 -1 2 163
+            -3.7140299100428820e-03 -2 -3 164 -6.1806719750165939e-03</internalNodes>
+          <leafValues>
+            -4.5103698968887329e-01 3.8348129391670227e-01
+            3.6097520589828491e-01 -2.0644439756870270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 165 -1.2373559875413775e-03 -1 2 166
+            -2.1339580416679382e-03 -2 -3 167 2.8985869139432907e-03</internalNodes>
+          <leafValues>
+            -5.8166879415512085e-01 4.1669690608978271e-01
+            -2.4721260368824005e-01 3.5056841373443604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 168 -4.4636861421167850e-03 0 -1 169
+            1.6411510296165943e-03 -2 -3 170 -7.3051019571721554e-03</internalNodes>
+          <leafValues>
+            3.5625410079956055e-01 -4.1040098667144775e-01
+            2.0216129720211029e-01 -3.4234520792961121e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.4762729406356812e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 171 -5.1942609250545502e-02 0 -1 172
+            -4.7268528491258621e-02 -2 -3 173 -7.8969672322273254e-03</internalNodes>
+          <leafValues>
+            8.8198930025100708e-01 6.4829237759113312e-02
+            8.8662758469581604e-02 -5.9007811546325684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 174 9.0199249098077416e-04 2 -1 175
+            -1.7289820313453674e-01 -2 -3 176 -2.3374119773507118e-03</internalNodes>
+          <leafValues>
+            5.9040898084640503e-01 -5.2029031515121460e-01
+            5.2981728315353394e-01 -1.4985850453376770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 177 -1.7534950748085976e-02 -1 2 178
+            5.8875310060102493e-05 -2 -3 179 -3.2241028547286987e-01</internalNodes>
+          <leafValues>
+            5.3269028663635254e-01 -4.5709720253944397e-01
+            5.7380169630050659e-01 -1.2866480648517609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 180 8.3220787928439677e-05 0 -1 181
+            -1.1180160072399303e-04 -2 -3 182 -1.0344980284571648e-02</internalNodes>
+          <leafValues>
+            9.0006209909915924e-02 -5.6352388858795166e-01
+            6.3273417949676514e-01 5.0064269453287125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 183 -9.4440882094204426e-04 2 -1 184
+            -3.7474210839718580e-03 -2 -3 185 4.0574651211500168e-03</internalNodes>
+          <leafValues>
+            4.4386640191078186e-01 -3.4999918937683105e-01
+            -4.5298218727111816e-01 3.0920198559761047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 186 5.5205920943990350e-05 0 -1 187
+            -7.5678288936614990e-02 -2 -3 188 -3.0975368618965149e-01</internalNodes>
+          <leafValues>
+            3.5544091463088989e-01 -3.6047360301017761e-01
+            -6.4954018592834473e-01 3.0679279565811157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 189 -7.9595847637392581e-05 0 -1 190
+            4.0613119490444660e-03 -2 -3 191 4.3240871280431747e-02</internalNodes>
+          <leafValues>
+            3.3850470185279846e-01 -5.3271901607513428e-01
+            -3.2592329382896423e-01 5.5076271295547485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 192 -6.7015928216278553e-03 -1 2 193
+            -1.0451120324432850e-03 -2 -3 194 8.3967261016368866e-03</internalNodes>
+          <leafValues>
+            5.0109171867370605e-01 -5.8881980180740356e-01
+            -9.5237597823143005e-02 5.6516999006271362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 195 -6.5531006839592010e-05 0 -1 196
+            7.8218057751655579e-05 -2 -3 197 3.2988168299198151e-02</internalNodes>
+          <leafValues>
+            -4.6556711196899414e-01 5.4509781301021576e-02
+            3.5248789191246033e-01 -5.2722948789596558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 198 -1.4161449857056141e-02 2 -1 199
+            3.1500440090894699e-02 -2 -3 200 -2.1956730633974075e-03</internalNodes>
+          <leafValues>
+            3.6811780929565430e-01 5.2040421962738037e-01
+            1.1603529751300812e-01 -3.0985280871391296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 201 -4.0099889039993286e-02 -1 2 202
+            -3.2569639384746552e-02 -2 -3 203 -4.2014168575406075e-03</internalNodes>
+          <leafValues>
+            -4.5146378874778748e-01 -6.4392048120498657e-01
+            -8.2594501972198486e-01 1.9259540736675262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 204 2.0385689567774534e-03 0 -1 205
+            -1.6212540213018656e-03 -2 -3 206 -8.6220083758234978e-03</internalNodes>
+          <leafValues>
+            -3.7723371386528015e-01 3.3918830752372742e-01
+            4.8986920714378357e-01 -2.7532070875167847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 207 9.2185800895094872e-05 2 -1 208
+            -7.1932889113668352e-05 -2 -3 209 4.4952900498174131e-04</internalNodes>
+          <leafValues>
+            2.4223749339580536e-01 -4.2189198732376099e-01
+            2.9407840967178345e-01 -4.4028049707412720e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.4963719844818115e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 210 -1.9638450816273689e-02 0 -1 211
+            1.1364299803972244e-01 -2 -3 212 -1.0112149640917778e-02</internalNodes>
+          <leafValues>
+            -3.2444450259208679e-01 7.4602019786834717e-01
+            3.3333331346511841e-01 -5.6435650587081909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 213 1.2130879797041416e-02 2 -1 214
+            -1.5958850085735321e-01 -2 -3 215 -2.3524949792772532e-03</internalNodes>
+          <leafValues>
+            7.2214919328689575e-01 -3.9274591207504272e-01
+            5.6152492761611938e-01 -1.3768480718135834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 216 -4.1118920780718327e-03 -1 2 217
+            -1.7832900583744049e-01 -2 -3 218 -7.8500732779502869e-03</internalNodes>
+          <leafValues>
+            6.3556081056594849e-01 3.3373141288757324e-01
+            3.9536771178245544e-01 -3.3380430936813354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 219 -4.6880490117473528e-05 0 -1 220
+            5.2934719860786572e-05 -2 -3 221 2.0851430235779844e-05</internalNodes>
+          <leafValues>
+            -6.6118270158767700e-01 -4.8232190310955048e-02
+            -9.8838359117507935e-02 4.4528418779373169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 222 -1.8425289541482925e-02 -1 2 223
+            -7.6133902184665203e-03 -2 -3 224 -6.0353721491992474e-03</internalNodes>
+          <leafValues>
+            -6.5690898895263672e-01 5.3413677215576172e-01
+            3.6171048879623413e-01 -2.0478430390357971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 225 4.3712720071198419e-05 0 -1 226
+            -7.8823999501764774e-04 -2 -3 227 -4.5693209394812584e-03</internalNodes>
+          <leafValues>
+            -4.5326828956604004e-01 3.5517698526382446e-01
+            6.1721032857894897e-01 -2.9707700014114380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 228 -3.8058571517467499e-02 0 -1 229
+            -1.1797689646482468e-01 -2 -3 230 4.6841651201248169e-03</internalNodes>
+          <leafValues>
+            3.5003998875617981e-01 -2.7257668972015381e-01
+            -3.2559171319007874e-01 3.7737470865249634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 231 -2.6372840511612594e-04 0 -1 232
+            6.2580420635640621e-03 -2 -3 233 5.6767999922158197e-05</internalNodes>
+          <leafValues>
+            3.7421739101409912e-01 -5.8926701545715332e-01
+            -4.8859021067619324e-01 -1.8623730167746544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 234 9.2742107808589935e-03 2 -1 235
+            -3.8514519110321999e-03 -2 -3 236 -5.3287498303689063e-05</internalNodes>
+          <leafValues>
+            3.0933541059494019e-01 -3.4513729810714722e-01
+            5.2340328693389893e-01 -9.1159403324127197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 237 9.8315975628793240e-04 2 -1 238
+            8.2858657697215676e-04 -2 -3 239 1.1229789815843105e-02</internalNodes>
+          <leafValues>
+            -5.0185352563858032e-01 -3.0529549717903137e-01
+            2.6219210028648376e-01 -4.7969821095466614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 240 -1.0327639989554882e-02 -1 2 241
+            -6.9197742268443108e-03 -2 -3 242 -5.0027170218527317e-03</internalNodes>
+          <leafValues>
+            -5.6315082311630249e-01 3.1225070357322693e-01
+            1.7820779979228973e-01 -3.0091148614883423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 243 -1.1156810069223866e-04 -1 2 244
+            4.2464961297810078e-03 -2 -3 245 -4.7280951548600569e-05</internalNodes>
+          <leafValues>
+            1.8883679807186127e-01 -4.0101578831672668e-01
+            4.6505901217460632e-01 -2.9863640666007996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 246 -1.8891280051320791e-03 -1 2 247
+            -5.8536308642942458e-05 -2 -3 248 2.0671950551331975e-05</internalNodes>
+          <leafValues>
+            5.6963747739791870e-01 1.8008249998092651e-01
+            -5.8659601211547852e-01 -5.4875258356332779e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 249 -1.1267509544268250e-03 2 -1 250
+            2.1378440782427788e-02 -2 -3 251 -1.2546040117740631e-02</internalNodes>
+          <leafValues>
+            -4.0261599421501160e-01 3.9230358600616455e-01
+            4.9474561214447021e-01 -1.7322529852390289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 252 -7.2257901774719357e-04 2 -1 253
+            6.4563672058284283e-03 -2 -3 254 4.9086650833487511e-03</internalNodes>
+          <leafValues>
+            -3.0380329489707947e-01 4.7173491120338440e-01
+            -1.6380549967288971e-01 3.7708491086959839e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>-1.5243699550628662e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 255 -7.2617560625076294e-02 0 -1 256
+            -6.9059380330145359e-03 -2 -3 257 2.1727949380874634e-01</internalNodes>
+          <leafValues>
+            2.6602798700332642e-01 -4.9325171113014221e-01
+            -1.0769230127334595e-01 8.2661122083663940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 258 -2.0319509785622358e-03 0 -1 259
+            2.8931589797139168e-02 -2 -3 260 -4.6076569706201553e-03</internalNodes>
+          <leafValues>
+            -3.7963140755891800e-02 8.0230438709259033e-01
+            4.2468398809432983e-01 -2.9379379749298096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 261 6.9408868439495564e-03 0 -1 262
+            -5.9231962077319622e-03 -2 -3 263 5.1128160208463669e-02</internalNodes>
+          <leafValues>
+            4.1737049818038940e-01 -2.5552588701248169e-01
+            -3.8619861006736755e-01 4.7076860070228577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 264 1.5201330184936523e-02 -1 2 265
+            -1.8096340820193291e-02 -2 -3 266 7.9378951340913773e-05</internalNodes>
+          <leafValues>
+            5.4354798793792725e-01 2.6651141047477722e-01
+            -4.3927749991416931e-01 2.5831260718405247e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 267 -5.3462558425962925e-03 -1 2 268
+            -6.9701080210506916e-03 -2 -3 269 8.4738981968257576e-05</internalNodes>
+          <leafValues>
+            -6.6308969259262085e-01 -7.0310682058334351e-01
+            -1.7880809307098389e-01 2.5993299484252930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 270 -2.8513800352811813e-03 2 -1 271
+            2.2954840678721666e-03 -2 -3 272 -3.5036220215260983e-03</internalNodes>
+          <leafValues>
+            4.5053678750991821e-01 3.0560511350631714e-01
+            1.5040870010852814e-01 -3.3283078670501709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 273 -6.9570228457450867e-02 0 -1 274
+            5.9261121350573376e-05 -2 -3 275 -5.9058349579572678e-02</internalNodes>
+          <leafValues>
+            -3.6899719387292862e-02 4.0927308797836304e-01
+            1.3826370239257812e-01 -3.8214409351348877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 276 -8.9645627886056900e-03 -1 2 277
+            4.9211819714400917e-05 -2 -3 278 9.9640293046832085e-03</internalNodes>
+          <leafValues>
+            -5.8134728670120239e-01 -1.8481740355491638e-01
+            8.7685473263263702e-02 5.8509802818298340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 279 -1.9302699714899063e-02 -1 2 280
+            -4.3869198998436332e-04 -2 -3 281 6.5669846662785858e-05</internalNodes>
+          <leafValues>
+            5.3263461589813232e-01 2.8891131281852722e-01
+            -3.3493599295616150e-01 5.9566751122474670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 282 -2.0224519073963165e-02 -1 2 283
+            8.7082196841947734e-05 -2 -3 284 -1.6202719882130623e-02</internalNodes>
+          <leafValues>
+            -6.5536081790924072e-01 -1.2211789935827255e-01
+            -4.7076839208602905e-01 3.0990770459175110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 285 4.4353529810905457e-03 -1 2 286
+            -9.0544822160154581e-04 -2 -3 287 -1.4297979651018977e-03</internalNodes>
+          <leafValues>
+            -5.4039931297302246e-01 4.2878800630569458e-01
+            2.2322739660739899e-01 -1.8194420635700226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 288 3.2359519973397255e-03 0 -1 289
+            1.0716189717641100e-04 -2 -3 290 -5.8802281273528934e-04</internalNodes>
+          <leafValues>
+            -2.9218220710754395e-01 1.3910460472106934e-01
+            -4.6926081180572510e-01 3.8085499405860901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 291 -9.0546347200870514e-03 -1 2 292
+            -8.6048766970634460e-03 -2 -3 293 -1.2719300575554371e-03</internalNodes>
+          <leafValues>
+            -5.0426542758941650e-01 -2.7559030055999756e-01
+            3.6022108793258667e-01 -2.6484970003366470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 294 -3.9098240085877478e-04 -1 2 295
+            -3.6405251012183726e-04 -2 -3 296 -6.6685711499303579e-04</internalNodes>
+          <leafValues>
+            2.6651731133460999e-01 1.4721649885177612e-01
+            -4.9719738960266113e-01 -6.1579849570989609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 297 -2.4845570325851440e-02 -1 2 298
+            -1.5436399728059769e-02 -2 -3 299 -5.6572312116622925e-01</internalNodes>
+          <leafValues>
+            -7.0820981264114380e-01 -4.7206890583038330e-01
+            6.3965231180191040e-01 5.2069328725337982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 300 -5.7480141520500183e-02 -1 2 301
+            -1.4613820239901543e-02 -2 -3 302 -3.3993738889694214e-01</internalNodes>
+          <leafValues>
+            2.9297390580177307e-01 6.0129672288894653e-01
+            1.9041299819946289e-02 -3.3254599571228027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 303 -3.1427140347659588e-03 0 -1 304
+            2.1966299973428249e-03 -2 -3 305 -2.4858590215444565e-02</internalNodes>
+          <leafValues>
+            -2.2972729802131653e-01 2.2367340326309204e-01
+            -5.6212967634201050e-01 3.9542859792709351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 306 -1.6135630430653691e-03 2 -1 307
+            1.1416019697207958e-04 -2 -3 308 1.3170539750717580e-04</internalNodes>
+          <leafValues>
+            -4.8256790637969971e-01 2.6877319812774658e-01
+            -3.9078921079635620e-01 1.7153440415859222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 309 -8.5256207967177033e-05 -1 2 310
+            6.4925159676931798e-05 -2 -3 311 -1.2689639814198017e-02</internalNodes>
+          <leafValues>
+            2.1754570305347443e-01 -4.7468620538711548e-01
+            -6.6538578271865845e-01 1.2347090244293213e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-1.3592849969863892e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 312 -2.9844639822840691e-02 0 -1 313
+            -4.5487660169601440e-01 -2 -3 314 2.7445149607956409e-03</internalNodes>
+          <leafValues>
+            3.9222040772438049e-01 -3.9314880967140198e-01
+            -1.5923570096492767e-01 8.2696700096130371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 315 -1.0584670118987560e-02 0 -1 316
+            -1.6308380290865898e-02 -2 -3 317 -4.8787441104650497e-02</internalNodes>
+          <leafValues>
+            4.5954689383506775e-01 -2.1620120108127594e-01
+            7.5103652477264404e-01 7.4557967483997345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 318 -2.9621229041367769e-03 2 -1 319
+            1.7300529405474663e-02 -2 -3 320 -1.6731169074773788e-02</internalNodes>
+          <leafValues>
+            -2.4452270567417145e-01 -3.3090409636497498e-01
+            5.3751850128173828e-01 2.9153820127248764e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 321 1.2326180003583431e-02 -1 2 322
+            5.4928299039602280e-02 -2 -3 323 2.7763319667428732e-03</internalNodes>
+          <leafValues>
+            -5.4824811220169067e-01 -2.1952770650386810e-01
+            3.6463689059019089e-02 5.0633782148361206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 324 -4.5116998255252838e-02 2 -1 325
+            1.1207940056920052e-02 -2 -3 326 -5.7006389833986759e-03</internalNodes>
+          <leafValues>
+            4.2339310050010681e-01 3.9984008669853210e-01
+            -5.9729182720184326e-01 -9.8557651042938232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 327 -5.3951311856508255e-03 0 -1 328
+            7.8587066382169724e-03 -2 -3 329 1.0666639544069767e-02</internalNodes>
+          <leafValues>
+            3.4734690189361572e-01 -4.7281920909881592e-01
+            -2.3315669596195221e-01 2.4360010027885437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 330 2.8001810424029827e-03 0 -1 331
+            -7.9198479652404785e-03 -2 -3 332 -2.3832279257476330e-03</internalNodes>
+          <leafValues>
+            -4.8354551196098328e-01 1.8321120738983154e-01
+            3.2168481498956680e-02 -5.0476258993148804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 333 -9.7674019634723663e-03 -1 2 334
+            -1.3897259719669819e-02 -2 -3 335 -6.4803068526089191e-03</internalNodes>
+          <leafValues>
+            -7.4415212869644165e-01 4.5425128936767578e-01
+            4.8292869329452515e-01 -1.0258570313453674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 336 9.4482619315385818e-03 -1 2 337
+            -7.0351187605410814e-04 -2 -3 338 -4.2770579457283020e-03</internalNodes>
+          <leafValues>
+            -5.3326022624969482e-01 2.9435831308364868e-01
+            1.5501999855041504e-01 -3.0867969989776611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 339 5.8752358891069889e-03 2 -1 340
+            9.5629561692476273e-03 -2 -3 341 -6.8425266363192350e-05</internalNodes>
+          <leafValues>
+            -6.0491317510604858e-01 4.4039881229400635e-01
+            1.0206270217895508e-01 -2.5624030828475952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 342 5.4002371616661549e-03 2 -1 343
+            2.9745819047093391e-03 -2 -3 344 -2.5536341127008200e-03</internalNodes>
+          <leafValues>
+            4.5371580123901367e-01 -6.0967987775802612e-01
+            2.2111609578132629e-01 -1.2801170349121094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 345 4.0425839833915234e-03 2 -1 346
+            7.6407291926443577e-03 -2 -3 347 -1.0939979692921042e-03</internalNodes>
+          <leafValues>
+            -1.9264020025730133e-01 6.1178821325302124e-01
+            -3.7973681092262268e-01 1.6438940167427063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 348 -1.1377089685993269e-04 0 -1 349
+            5.2979402244091034e-03 -2 -3 350 2.9510098975151777e-03</internalNodes>
+          <leafValues>
+            -2.7770480141043663e-02 4.3019628524780273e-01
+            -3.7912338972091675e-01 1.0130850225687027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 351 6.3235480338335037e-03 -1 2 352
+            3.9955950342118740e-03 -2 -3 353 -5.3595582721754909e-04</internalNodes>
+          <leafValues>
+            4.0413460135459900e-01 -1.5097740292549133e-01
+            5.9522801637649536e-01 -3.4380171447992325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 354 3.6193430423736572e-03 2 -1 355
+            3.4626820124685764e-03 -2 -3 356 2.9030859470367432e-02</internalNodes>
+          <leafValues>
+            -7.4454522132873535e-01 2.8504610061645508e-01
+            -1.8565440177917480e-01 1.5829989314079285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 357 6.0747697716578841e-04 2 -1 358
+            9.4140451401472092e-03 -2 -3 359 -2.2230610251426697e-02</internalNodes>
+          <leafValues>
+            -3.3788970112800598e-01 -3.6750578880310059e-01
+            -6.4205718040466309e-01 1.7526410520076752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 360 -4.6881791204214096e-03 0 -1 361
+            -3.9184167981147766e-03 -2 -3 362 -6.3269808888435364e-03</internalNodes>
+          <leafValues>
+            1.6476869583129883e-01 -2.2729560732841492e-01
+            5.7388627529144287e-01 5.7931281626224518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 363 -3.7428940413519740e-04 2 -1 364
+            2.8672320768237114e-03 -2 -3 365 2.4337199283763766e-04</internalNodes>
+          <leafValues>
+            -3.5288140177726746e-01 -4.1419389843940735e-01
+            2.0027640461921692e-01 -2.8263148665428162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 366 -9.1555183753371239e-03 -1 2 367
+            -1.2892490485683084e-03 -2 -3 368 -1.6453899443149567e-03</internalNodes>
+          <leafValues>
+            -5.4508739709854126e-01 2.5321239233016968e-01
+            1.7635670304298401e-01 -2.3053619265556335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 369 -7.6485536992549896e-02 2 -1 370
+            3.8297360879369080e-04 -2 -3 371 -2.6448920834809542e-04</internalNodes>
+          <leafValues>
+            -7.0480287075042725e-01 2.2375050187110901e-01
+            1.4251540601253510e-01 -2.4608950316905975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 372 -7.9496540129184723e-03 -1 2 373
+            -7.7398279681801796e-03 -2 -3 374 -1.0467980057001114e-02</internalNodes>
+          <leafValues>
+            -4.2123699188232422e-01 -4.6475729346275330e-01
+            -4.7312980890274048e-01 1.3598929345607758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 375 9.4248689711093903e-03 2 -1 376
+            -3.7210211157798767e-03 -2 -3 377 -1.6539100557565689e-02</internalNodes>
+          <leafValues>
+            3.5587531328201294e-01 -1.5899239480495453e-01
+            -6.1142671108245850e-01 3.3778318762779236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 378 1.8258139491081238e-02 -1 2 379
+            -6.1498139984905720e-03 -2 -3 380 1.4396630227565765e-02</internalNodes>
+          <leafValues>
+            -7.0120972394943237e-01 3.8414189219474792e-01
+            2.2873559966683388e-02 -4.8029011487960815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 381 -4.8927508294582367e-02 -1 2 382
+            -4.9874751130118966e-04 -2 -3 383 -1.2338399887084961e-02</internalNodes>
+          <leafValues>
+            -1.2219530344009399e-01 4.4899681210517883e-01
+            5.8306622505187988e-01 -1.5592460334300995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 384 4.9237860366702080e-03 -1 2 385
+            6.4515617850702256e-05 -2 -3 386 -9.0754460543394089e-03</internalNodes>
+          <leafValues>
+            5.7889437675476074e-01 -2.2252050042152405e-01
+            2.5118181109428406e-01 -1.1915980279445648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 387 -2.2913129068911076e-03 2 -1 388
+            -1.1618229560554028e-02 -2 -3 389 -2.6231290772557259e-02</internalNodes>
+          <leafValues>
+            2.0203049480915070e-01 -2.4990449845790863e-01
+            -7.2858989238739014e-01 2.2483369708061218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 390 2.1525719785131514e-04 2 -1 391
+            5.4147760383784771e-03 -2 -3 392 -6.8281739950180054e-03</internalNodes>
+          <leafValues>
+            -3.0237621068954468e-01 -3.4467801451683044e-01
+            -5.1470118761062622e-01 1.8762029707431793e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>29</maxWeakCount>
+      <stageThreshold>-1.3664239645004272e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 393 8.8577903807163239e-03 0 -1 394
+            2.2660400718450546e-03 -2 -3 395 1.5509200282394886e-02</internalNodes>
+          <leafValues>
+            -3.6197811365127563e-01 3.4535628557205200e-01
+            -2.2814500331878662e-01 8.0521601438522339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 396 1.9730629399418831e-02 0 -1 397
+            -5.2804131060838699e-02 -2 -3 398 -3.4123551100492477e-02</internalNodes>
+          <leafValues>
+            2.2162230312824249e-01 -2.6307260990142822e-01
+            8.7687742710113525e-01 1.5147949755191803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 399 -4.4995918869972229e-03 -1 2 400
+            -3.8060150109231472e-03 -2 -3 401 -6.5935899328906089e-05</internalNodes>
+          <leafValues>
+            -5.1520478725433350e-01 3.1563198566436768e-01
+            1.1052650213241577e-01 -3.0016160011291504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 402 9.5838904380798340e-03 2 -1 403
+            4.2877299711108208e-03 -2 -3 404 3.2141651026904583e-03</internalNodes>
+          <leafValues>
+            5.2808177471160889e-01 -6.3694041967391968e-01
+            3.5910170525312424e-02 -5.4334390163421631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 405 -7.9250690760090947e-04 2 -1 406
+            -1.5514569822698832e-03 -2 -3 407 -1.7790550366044044e-02</internalNodes>
+          <leafValues>
+            -4.7867339849472046e-01 -9.1462276875972748e-02
+            4.5612779259681702e-01 1.0628259740769863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 408 -2.5881261099129915e-03 0 -1 409
+            -2.7412150520831347e-03 -2 -3 410 4.4753181282430887e-04</internalNodes>
+          <leafValues>
+            1.6198949515819550e-01 -2.9113239049911499e-01
+            -2.8482219576835632e-01 3.3902090787887573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 411 -3.6593680270016193e-03 2 -1 412
+            2.4432500358670950e-03 -2 -3 413 -1.3546410016715527e-02</internalNodes>
+          <leafValues>
+            -5.1089602708816528e-01 -3.2154849171638489e-01
+            2.7356979250907898e-01 -1.2062689661979675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 414 1.1241570115089417e-01 -1 2 415
+            -4.5845299027860165e-03 -2 -3 416 6.3416222110390663e-03</internalNodes>
+          <leafValues>
+            3.6505278944969177e-01 4.4773998856544495e-01
+            -9.7543753683567047e-02 -6.1698240041732788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 417 -9.1398190706968307e-03 0 -1 418
+            -8.2371473312377930e-02 -2 -3 419 3.1728888861835003e-03</internalNodes>
+          <leafValues>
+            6.1478227376937866e-01 -1.7612460255622864e-01
+            2.7462399005889893e-01 -5.3833961486816406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 420 8.2914117956534028e-04 0 -1 421
+            -1.7079230397939682e-02 -2 -3 422 -4.8665981739759445e-03</internalNodes>
+          <leafValues>
+            -4.3669781088829041e-01 1.7935889959335327e-01
+            -6.2017709016799927e-02 -5.9141248464584351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 423 -3.3614661078900099e-03 -1 2 424
+            -4.4482201337814331e-02 -2 -3 425 -1.8765870481729507e-03</internalNodes>
+          <leafValues>
+            -4.3437281250953674e-01 -6.8157917261123657e-01
+            -6.8667972087860107e-01 1.1657930165529251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 426 2.3192320019006729e-02 -1 2 427
+            -4.5041430741548538e-02 -2 -3 428 2.3778830654919147e-03</internalNodes>
+          <leafValues>
+            4.0776708722114563e-01 3.7137511372566223e-01
+            -7.1181386709213257e-02 -5.3898727893829346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 429 -1.3468379620462656e-03 0 -1 430
+            4.3169260025024414e-03 -2 -3 431 4.5682261697947979e-03</internalNodes>
+          <leafValues>
+            2.3184180259704590e-01 -3.8448938727378845e-01
+            -2.4857190251350403e-01 1.2519669532775879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 432 1.1057799682021141e-02 -1 2 433
+            -6.6700251772999763e-04 -2 -3 434 4.8536141548538581e-05</internalNodes>
+          <leafValues>
+            -3.8228470087051392e-01 -2.7387779951095581e-01
+            -2.9664589092135429e-02 2.8385889530181885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 435 -3.9972390979528427e-02 0 -1 436
+            -1.6880780458450317e-02 -2 -3 437 -5.6082051247358322e-02</internalNodes>
+          <leafValues>
+            6.3570600748062134e-01 -1.9189420342445374e-01
+            -9.0092360973358154e-01 1.9145509600639343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 438 3.4141261130571365e-03 2 -1 439
+            9.1075859963893890e-03 -2 -3 440 -1.3897320022806525e-03</internalNodes>
+          <leafValues>
+            4.2132571339607239e-01 5.5071562528610229e-01
+            -5.0447541475296021e-01 -4.0802270174026489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 441 1.7231719568371773e-02 0 -1 442
+            -2.0052720792591572e-03 -2 -3 443 3.5111181205138564e-04</internalNodes>
+          <leafValues>
+            -3.1567269563674927e-01 5.5168247222900391e-01
+            5.6736338883638382e-02 -2.6553949713706970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 444 -2.0616729743778706e-03 -1 2 445
+            -1.0434100404381752e-03 -2 -3 446 2.0041360985487700e-03</internalNodes>
+          <leafValues>
+            -4.9637660384178162e-01 2.5625479221343994e-01
+            -2.3637770116329193e-01 1.2562820315361023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 447 -4.6680038794875145e-03 2 -1 448
+            1.0352090001106262e-02 -2 -3 449 2.9808359686285257e-03</internalNodes>
+          <leafValues>
+            -5.1331508159637451e-01 3.5214298963546753e-01
+            -1.6628879308700562e-01 1.6649410128593445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 450 1.0835190303623676e-02 -1 2 451
+            -3.8211939390748739e-03 -2 -3 452 -3.4161040093749762e-03</internalNodes>
+          <leafValues>
+            -3.8929209113121033e-01 3.5466459393501282e-01
+            -4.5814520120620728e-01 4.5853018760681152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 453 -5.8807642199099064e-03 0 -1 454
+            -3.4913890063762665e-02 -2 -3 455 4.8959217965602875e-03</internalNodes>
+          <leafValues>
+            1.0240379720926285e-01 -2.5945249199867249e-01
+            2.6778548955917358e-01 -4.8959800601005554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 456 5.8120768517255783e-03 -1 2 457
+            3.5575949586927891e-03 -2 -3 458 2.5241500698029995e-03</internalNodes>
+          <leafValues>
+            3.0377060174942017e-01 -1.8064819276332855e-01
+            4.1480910778045654e-01 -1.9794499874114990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 459 1.5492970123887062e-02 2 -1 460
+            2.3261269961949438e-04 -2 -3 461 -2.1607619710266590e-03</internalNodes>
+          <leafValues>
+            4.7802209854125977e-01 -3.0891039967536926e-01
+            -4.0223160386085510e-01 1.1098849773406982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 462 3.5326189827173948e-03 -1 2 463
+            -3.3474999945610762e-03 -2 -3 464 2.9168210923671722e-02</internalNodes>
+          <leafValues>
+            2.2489060461521149e-01 1.6631869971752167e-01
+            -7.4026778340339661e-02 -4.5744699239730835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 465 -1.6242500394582748e-02 -1 2 466
+            -7.5024510733783245e-03 -2 -3 467 1.7816389445215464e-03</internalNodes>
+          <leafValues>
+            -4.3497189879417419e-01 1.6646090149879456e-01
+            -3.9155849814414978e-01 8.0571353435516357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 468 -7.2545823059044778e-05 0 -1 469
+            6.1626458773389459e-05 -2 -3 470 -4.3781189015135169e-04</internalNodes>
+          <leafValues>
+            -4.1679731011390686e-01 6.0808397829532623e-03
+            3.1920549273490906e-01 -7.7506266534328461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 471 -3.0576970311813056e-04 0 -1 472
+            -1.3107899576425552e-02 -2 -3 473 -7.4203108670189977e-04</internalNodes>
+          <leafValues>
+            -3.6462840437889099e-01 2.2391660511493683e-01
+            6.8343617022037506e-02 -2.9597601294517517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 474 -7.7575328759849072e-03 2 -1 475
+            3.0043099541217089e-03 -2 -3 476 -5.8561760932207108e-02</internalNodes>
+          <leafValues>
+            4.5748728513717651e-01 1.8059000372886658e-01
+            2.6555559039115906e-01 -2.0381399989128113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 477 -2.5295289233326912e-02 -1 2 478
+            -4.9810659140348434e-02 -2 -3 479 -2.4564980994910002e-03</internalNodes>
+          <leafValues>
+            -5.8704811334609985e-01 -8.4442830085754395e-01
+            4.4017440080642700e-01 3.7946549709886312e-03</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.3621879816055298e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 480 -2.3795999586582184e-02 0 -1 481
+            -4.2916718870401382e-02 -2 -3 482 -9.9466904066503048e-04</internalNodes>
+          <leafValues>
+            2.1881549619138241e-03 -4.9640420079231262e-01
+            8.3718097209930420e-01 -3.0279759317636490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 483 1.3895650394260883e-02 2 -1 484
+            -2.2832138929516077e-03 -2 -3 485 -4.8447579145431519e-01</internalNodes>
+          <leafValues>
+            -3.9495769143104553e-01 -3.8689300417900085e-02
+            8.3933347463607788e-01 2.3111909627914429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 486 -7.3761418461799622e-03 2 -1 487
+            3.3793840557336807e-03 -2 -3 488 -3.3415269106626511e-02</internalNodes>
+          <leafValues>
+            2.3094999790191650e-01 9.1608531773090363e-02
+            1.1462929844856262e-01 -5.4809182882308960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 489 -7.6022851280868053e-03 2 -1 490
+            7.6229616999626160e-02 -2 -3 491 -3.7729479372501373e-03</internalNodes>
+          <leafValues>
+            -5.7959568500518799e-01 3.4666779637336731e-01
+            1.1899670213460922e-01 -2.7983540296554565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 492 -4.2590490193106234e-04 0 -1 493
+            -9.4475867226719856e-03 -2 -3 494 -8.0220031738281250e-01</internalNodes>
+          <leafValues>
+            1.4403289556503296e-01 -2.8053888678550720e-01
+            6.6430008411407471e-01 5.4834768176078796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 495 -2.8851430397480726e-03 -1 2 496
+            -1.2341480469331145e-03 -2 -3 497 4.8669218813301995e-05</internalNodes>
+          <leafValues>
+            -3.8836699724197388e-01 -3.6734551191329956e-01
+            -7.8982323408126831e-02 3.0184748768806458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 498 -1.6491800546646118e-01 -1 2 499
+            1.0784890037029982e-03 -2 -3 500 -2.8511860873550177e-03</internalNodes>
+          <leafValues>
+            3.8886231184005737e-01 -2.4477399885654449e-01
+            4.5753139257431030e-01 -5.3499769419431686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 501 -3.2212301157414913e-03 0 -1 502
+            3.4995030146092176e-03 -2 -3 503 -1.0098779574036598e-02</internalNodes>
+          <leafValues>
+            -2.4303850531578064e-01 1.5881340205669403e-01
+            -5.5816608667373657e-01 3.2196229696273804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 504 -6.6468201112002134e-04 -1 2 505
+            -3.6263898946344852e-03 -2 -3 506 -7.6791420578956604e-02</internalNodes>
+          <leafValues>
+            2.4572889506816864e-01 1.8094339966773987e-01
+            2.6634529232978821e-01 -3.5051029920578003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 507 -2.7685859240591526e-03 2 -1 508
+            2.5676529854536057e-02 -2 -3 509 -4.6753739006817341e-03</internalNodes>
+          <leafValues>
+            -4.3504360318183899e-01 -3.5143280029296875e-01
+            4.1049909591674805e-01 3.3144820481538773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 510 6.7022559233009815e-03 -1 2 511
+            1.6208000481128693e-02 -2 -3 512 -1.1024869978427887e-02</internalNodes>
+          <leafValues>
+            -4.9738308787345886e-01 -1.7945469915866852e-01
+            4.0457150340080261e-01 -4.3077580630779266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 513 7.7911361586302519e-04 0 -1 514
+            -1.8139690160751343e-01 -2 -3 515 -1.2972550466656685e-03</internalNodes>
+          <leafValues>
+            5.1866638660430908e-01 -7.5364969670772552e-02
+            -5.0643932819366455e-01 -1.7226299270987511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 516 2.0431660115718842e-02 2 -1 517
+            1.6622639959678054e-03 -2 -3 518 -2.7155179996043444e-03</internalNodes>
+          <leafValues>
+            -7.0584601163864136e-01 -4.5102250576019287e-01
+            -4.4598218798637390e-01 1.3886100053787231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 519 4.2074210796272382e-05 2 -1 520
+            9.3489577993750572e-03 -2 -3 521 -1.3226609677076340e-02</internalNodes>
+          <leafValues>
+            -2.2170229256153107e-01 -4.6554449200630188e-01
+            5.4859870672225952e-01 6.7970179021358490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 522 -1.5071720117703080e-03 2 -1 523
+            8.7646767497062683e-03 -2 -3 524 -1.0542649775743484e-02</internalNodes>
+          <leafValues>
+            4.6481129527091980e-01 2.7992910146713257e-01
+            2.1239709854125977e-01 -2.2514510154724121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 525 -6.4357798546552658e-03 2 -1 526
+            7.8919027000665665e-03 -2 -3 527 -7.8666176705155522e-05</internalNodes>
+          <leafValues>
+            -4.1811630129814148e-01 -6.2211698293685913e-01
+            2.7184090018272400e-01 -4.2934559285640717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 528 8.2855960354208946e-03 2 -1 529
+            5.4834279580973089e-05 -2 -3 530 2.4197530001401901e-03</internalNodes>
+          <leafValues>
+            3.4669309854507446e-01 7.2008788585662842e-02
+            -3.7774428725242615e-01 1.7871029675006866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 531 -6.7930121440440416e-04 0 -1 532
+            -5.6035388261079788e-03 -2 -3 533 8.4534510970115662e-03</internalNodes>
+          <leafValues>
+            1.6817240417003632e-01 -2.7659809589385986e-01
+            6.9586731493473053e-02 6.7284989356994629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 534 4.4707441702485085e-03 -1 2 535
+            -9.1664772480726242e-03 -2 -3 536 -7.1168012917041779e-02</internalNodes>
+          <leafValues>
+            -4.2183759808540344e-01 3.6319440603256226e-01
+            -5.9520107507705688e-01 2.3322079330682755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 537 -3.6344379186630249e-03 0 -1 538
+            -5.8278841897845268e-03 -2 -3 539 -2.5245670694857836e-03</internalNodes>
+          <leafValues>
+            -3.5108420252799988e-01 2.7366310358047485e-01
+            1.4989720284938812e-01 -2.4933290481567383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 540 5.6592230685055256e-03 2 -1 541
+            4.0714079514145851e-03 -2 -3 542 -1.1921550147235394e-02</internalNodes>
+          <leafValues>
+            -3.4733161330223083e-01 -4.7359859943389893e-01
+            -4.0016528964042664e-01 1.5767680108547211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 543 9.8874024115502834e-04 0 -1 544
+            1.4633700484409928e-03 -2 -3 545 -7.6617081649601460e-03</internalNodes>
+          <leafValues>
+            2.1033559739589691e-01 -1.5317709743976593e-01
+            2.3481769859790802e-01 -3.7187078595161438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 546 -1.7770569771528244e-02 0 -1 547
+            8.8388901203870773e-03 -2 -3 548 -1.0058529675006866e-02</internalNodes>
+          <leafValues>
+            -1.6414129734039307e-01 4.8245888948440552e-01
+            -5.4388159513473511e-01 2.8127178549766541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 549 2.8392190579324961e-03 -1 2 550
+            -7.8546267468482256e-04 -2 -3 551 4.2725168896140531e-05</internalNodes>
+          <leafValues>
+            -3.8577800989151001e-01 -3.2860949635505676e-01
+            -4.6654768288135529e-02 2.7741169929504395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 552 5.1506902091205120e-03 -1 2 553
+            -8.3640925586223602e-03 -2 -3 554 -8.8340323418378830e-03</internalNodes>
+          <leafValues>
+            2.7348038554191589e-01 1.4315670728683472e-01
+            5.4049361497163773e-02 -3.6266559362411499e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-1.3905019760131836e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 555 1.7114889621734619e-01 0 -1 556
+            3.2740959431976080e-03 -2 -3 557 4.8062200658023357e-03</internalNodes>
+          <leafValues>
+            -5.5645358562469482e-01 5.5018130689859390e-02
+            1.1190200224518776e-02 7.9551488161087036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 558 1.8143800552934408e-03 0 -1 559
+            -4.2795971035957336e-01 -2 -3 560 -6.3261981122195721e-03</internalNodes>
+          <leafValues>
+            5.8408319950103760e-01 -1.3940179720520973e-02
+            1.6659989953041077e-01 -5.0161522626876831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 561 1.0702019557356834e-02 0 -1 562
+            7.3792198672890663e-03 -2 -3 563 4.8895571380853653e-03</internalNodes>
+          <leafValues>
+            -4.0653520822525024e-01 1.2877050042152405e-01
+            4.3990871310234070e-01 -7.8997397422790527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 564 1.0012320242822170e-02 0 -1 565
+            3.4356310963630676e-01 -2 -3 566 -7.2859530337154865e-03</internalNodes>
+          <leafValues>
+            -2.5616368651390076e-01 4.6377441287040710e-01
+            5.8014488220214844e-01 -5.4609451442956924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 567 -1.5099609736353159e-03 2 -1 568
+            2.9597719549201429e-04 -2 -3 569 1.0984730033669621e-04</internalNodes>
+          <leafValues>
+            -6.4054518938064575e-01 3.8956710696220398e-01
+            -3.4113371372222900e-01 1.1111719906330109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 570 -3.2580990809947252e-03 -1 2 571
+            -3.8750080857425928e-03 -2 -3 572 1.4542469754815102e-02</internalNodes>
+          <leafValues>
+            -7.3414462804794312e-01 -6.3508582115173340e-01
+            1.7632520198822021e-01 -6.6695272922515869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 573 2.6616070419549942e-02 2 -1 574
+            5.2236141636967659e-03 -2 -3 575 5.8677811175584793e-03</internalNodes>
+          <leafValues>
+            -7.5831902027130127e-01 -6.2622100114822388e-01
+            -3.1810950487852097e-02 4.1031879186630249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 576 -1.0499180061742663e-03 0 -1 577
+            2.3986180312931538e-03 -2 -3 578 1.1009530164301395e-02</internalNodes>
+          <leafValues>
+            -5.2936470508575439e-01 2.2620279341936111e-02
+            3.0528450012207031e-01 -7.4659830331802368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 579 -2.3957889527082443e-02 -1 2 580
+            -3.6849190946668386e-03 -2 -3 581 3.4864700865000486e-03</internalNodes>
+          <leafValues>
+            -5.8027571439743042e-01 3.0985590815544128e-01
+            -3.1498908996582031e-01 1.3219730556011200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 582 -1.9150340557098389e-01 -1 2 583
+            -8.0496361479163170e-03 -2 -3 584 1.2236339971423149e-02</internalNodes>
+          <leafValues>
+            4.3646478652954102e-01 1.7165799438953400e-01
+            -3.6382019519805908e-01 2.3967529833316803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 585 -2.0347100216895342e-03 -1 2 586
+            -5.5528031662106514e-03 -2 -3 587 -3.2379259355366230e-03</internalNodes>
+          <leafValues>
+            -5.9768581390380859e-01 -5.4164600372314453e-01
+            -5.3870290517807007e-01 1.8444229662418365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 588 9.0606305748224258e-03 -1 2 589
+            -4.1239038109779358e-03 -2 -3 590 3.5246899351477623e-03</internalNodes>
+          <leafValues>
+            3.1039738655090332e-01 1.8052390217781067e-01
+            -4.7347640991210938e-01 1.5349459834396839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 591 5.2378959953784943e-03 -1 2 592
+            -9.4280708581209183e-03 -2 -3 593 -7.9351589083671570e-03</internalNodes>
+          <leafValues>
+            -4.5859739184379578e-01 -6.3323330879211426e-01
+            -6.1539369821548462e-01 1.6920439898967743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 594 -7.7211041934788227e-03 2 -1 595
+            9.0800300240516663e-03 -2 -3 596 -4.3125250376760960e-03</internalNodes>
+          <leafValues>
+            -6.5861612558364868e-01 -7.1446138620376587e-01
+            3.4336578845977783e-01 -4.6265859156847000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 597 2.3179050534963608e-02 -1 2 598
+            -2.1390080451965332e-02 -2 -3 599 -2.3761409521102905e-01</internalNodes>
+          <leafValues>
+            3.6338710784912109e-01 1.8276840448379517e-01
+            6.1675137281417847e-01 -3.4261471033096313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 600 2.1705040708184242e-03 -1 2 601
+            7.8210679930634797e-05 -2 -3 602 5.5145919322967529e-03</internalNodes>
+          <leafValues>
+            3.0056789517402649e-01 -3.4116759896278381e-01
+            2.3386859893798828e-01 -4.2150521278381348e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.3378640413284302e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 603 -2.2743379697203636e-02 0 -1 604
+            1.8450849456712604e-03 -2 -3 605 1.3338179886341095e-01</internalNodes>
+          <leafValues>
+            -8.9552268385887146e-02 7.4778342247009277e-01
+            -4.4504231214523315e-01 -1.7580920830368996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 606 6.3608489930629730e-02 -1 2 607
+            -2.5199958682060242e-01 -2 -3 608 -1.2144230306148529e-01</internalNodes>
+          <leafValues>
+            -3.7739220261573792e-01 4.9088031053543091e-01
+            6.3825917243957520e-01 -1.1822170019149780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 609 2.6287150103598833e-03 2 -1 610
+            3.0568530783057213e-03 -2 -3 611 8.1901780504267663e-05</internalNodes>
+          <leafValues>
+            -4.6926748752593994e-01 -6.5101218223571777e-01
+            -1.1639259755611420e-01 3.0188819766044617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 612 -1.6189720481634140e-03 2 -1 613
+            1.8283469835296273e-03 -2 -3 614 -3.9073298685252666e-03</internalNodes>
+          <leafValues>
+            -2.0891909301280975e-01 -1.9859300553798676e-01
+            -3.4454259276390076e-01 3.7140819430351257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 615 8.3928240928798914e-04 2 -1 616
+            3.7175789475440979e-03 -2 -3 617 5.1694628782570362e-03</internalNodes>
+          <leafValues>
+            -1.5356570482254028e-01 -5.0904238224029541e-01
+            3.5618001222610474e-01 -5.5773228406906128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 618 2.5797619018703699e-03 -1 2 619
+            -6.0318140313029289e-03 -2 -3 620 6.4257727935910225e-03</internalNodes>
+          <leafValues>
+            -4.2096439003944397e-01 -4.3999868631362915e-01
+            1.8873579800128937e-01 -4.5191749930381775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 621 3.4354510717093945e-03 2 -1 622
+            2.3672808893024921e-03 -2 -3 623 -2.0294289570301771e-03</internalNodes>
+          <leafValues>
+            2.7395468950271606e-01 2.3808500170707703e-01
+            -4.7586150467395782e-02 -4.8159629106521606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 624 -4.8436429351568222e-03 2 -1 625
+            3.0318649951368570e-03 -2 -3 626 -1.1691249907016754e-02</internalNodes>
+          <leafValues>
+            -4.9325150251388550e-01 -4.7109460830688477e-01
+            -5.8763760328292847e-01 1.4840489625930786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 627 6.5642758272588253e-05 2 -1 628
+            -6.9199966674204916e-05 -2 -3 629 -2.8953890432603657e-04</internalNodes>
+          <leafValues>
+            2.0787779986858368e-01 -4.2199170589447021e-01
+            -3.4657689929008484e-01 2.4809280037879944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 630 4.0080421604216099e-03 0 -1 631
+            5.0496991025283933e-04 -2 -3 632 -8.1637818366289139e-03</internalNodes>
+          <leafValues>
+            -2.9731631278991699e-01 6.3133187592029572e-02
+            6.3499641418457031e-01 -1.4965349435806274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 633 4.9255997873842716e-03 -1 2 634
+            -1.9985990598797798e-02 -2 -3 635 6.5322928130626678e-03</internalNodes>
+          <leafValues>
+            -5.8709067106246948e-01 4.1946971416473389e-01
+            -1.3393980264663696e-01 2.6131281256675720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 636 5.1231118850409985e-03 2 -1 637
+            -4.0335211087949574e-04 -2 -3 638 2.9234900139272213e-03</internalNodes>
+          <leafValues>
+            -3.6397430300712585e-01 -1.1776120215654373e-01
+            -1.2529510073363781e-02 4.6132311224937439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 639 3.5967670381069183e-02 2 -1 640
+            6.5072569996118546e-03 -2 -3 641 -1.0821050032973289e-02</internalNodes>
+          <leafValues>
+            4.5991379022598267e-01 3.2189390063285828e-01
+            3.0423519015312195e-01 -2.0769970118999481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 642 -3.7279170937836170e-03 -1 2 643
+            -8.9352466166019440e-03 -2 -3 644 3.9792140014469624e-03</internalNodes>
+          <leafValues>
+            -4.7056239843368530e-01 3.1361898779869080e-01
+            -1.8559350073337555e-01 3.0811190605163574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 645 1.9110339926555753e-03 -1 2 646
+            -6.8130958825349808e-03 -2 -3 647 -6.4241990912705660e-04</internalNodes>
+          <leafValues>
+            -4.4997429847717285e-01 -4.4663950800895691e-01
+            2.5373989343643188e-01 -6.7794866859912872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 648 4.8487721942365170e-03 -1 2 649
+            -2.2816660348325968e-03 -2 -3 650 -1.1166459880769253e-03</internalNodes>
+          <leafValues>
+            2.1777780354022980e-01 7.4151009321212769e-02
+            1.3762679696083069e-01 -4.5716550946235657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 651 -5.7191308587789536e-03 2 -1 652
+            1.9458220340311527e-03 -2 -3 653 1.7544110305607319e-03</internalNodes>
+          <leafValues>
+            -2.0206199586391449e-01 5.1613742113113403e-01
+            1.8209919333457947e-01 -2.4927709996700287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 654 6.5033212304115295e-03 2 -1 655
+            2.3260021116584539e-03 -2 -3 656 -5.0675291568040848e-03</internalNodes>
+          <leafValues>
+            -6.0831350088119507e-01 -4.5783790946006775e-01
+            -4.6264541149139404e-01 1.3114589452743530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 657 -1.4921430265530944e-03 0 -1 658
+            -1.3755200430750847e-02 -2 -3 659 6.3531019259244204e-04</internalNodes>
+          <leafValues>
+            -4.3485641479492188e-01 2.0381599664688110e-01
+            -3.2480859756469727e-01 1.9679710268974304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 660 -1.0971709853038192e-03 0 -1 661
+            2.1464130841195583e-03 -2 -3 662 1.0343589819967747e-02</internalNodes>
+          <leafValues>
+            2.2354440391063690e-01 -2.5036358833312988e-01
+            -2.7500569820404053e-01 3.2847368717193604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 663 -1.3076810538768768e-01 -1 2 664
+            -8.7650436908006668e-03 -2 -3 665 -3.0066180624999106e-04</internalNodes>
+          <leafValues>
+            -7.7974641323089600e-01 3.8356649875640869e-01
+            -3.0849298834800720e-01 5.5713050067424774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 666 -1.0776310227811337e-02 2 -1 667
+            7.3227831162512302e-03 -2 -3 668 -2.1263879537582397e-01</internalNodes>
+          <leafValues>
+            -5.3079968690872192e-01 3.0776378512382507e-01
+            -6.5190672874450684e-01 2.3253040853887796e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 669 6.5717170946300030e-03 -1 2 670
+            -1.6367210075259209e-02 -2 -3 671 -1.5086789615452290e-02</internalNodes>
+          <leafValues>
+            2.4296599626541138e-01 4.0867790579795837e-01
+            1.5299239754676819e-01 -2.5561499595642090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 672 4.5563760213553905e-03 0 -1 673
+            7.2980518452823162e-03 -2 -3 674 2.3971209302544594e-02</internalNodes>
+          <leafValues>
+            8.6251303553581238e-02 -5.1425570249557495e-01
+            -6.8491697311401367e-01 3.9260080456733704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 675 3.5279770381748676e-03 -1 2 676
+            -5.4452237673103809e-03 -2 -3 677 8.1267702626064420e-04</internalNodes>
+          <leafValues>
+            -5.8989018201828003e-01 4.1997981071472168e-01
+            -2.5605329871177673e-01 7.9393006861209869e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>30</maxWeakCount>
+      <stageThreshold>-1.2140669822692871e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 678 -2.7691459283232689e-02 0 -1 679
+            1.3043059734627604e-03 -2 -3 680 -1.9430460408329964e-02</internalNodes>
+          <leafValues>
+            -1.3037249445915222e-01 7.8108358383178711e-01
+            1.4480729587376118e-02 -3.7184581160545349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 681 -1.2235040217638016e-01 0 -1 682
+            -9.8456647247076035e-03 -2 -3 683 -7.4350096285343170e-02</internalNodes>
+          <leafValues>
+            2.8437229990959167e-01 -2.3675830662250519e-01
+            5.8174878358840942e-01 -2.8041550889611244e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 684 5.4055661894381046e-03 -1 2 685
+            -3.7805580068379641e-03 -2 -3 686 -6.2997087836265564e-02</internalNodes>
+          <leafValues>
+            -3.3748638629913330e-01 -4.6232721209526062e-01
+            4.2070108652114868e-01 -1.6759809805080295e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 687 -5.5793630890548229e-03 -1 2 688
+            -2.2814329713582993e-03 -2 -3 689 3.9111520163714886e-03</internalNodes>
+          <leafValues>
+            -6.4612352848052979e-01 -4.6796101331710815e-01
+            -2.5594810023903847e-02 3.3460310101509094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 690 -3.5144959110766649e-03 0 -1 691
+            -5.8226250112056732e-03 -2 -3 692 -3.5309740342199802e-03</internalNodes>
+          <leafValues>
+            1.1143500357866287e-01 -3.0549728870391846e-01
+            -3.7789401412010193e-01 2.9324159026145935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 693 -1.6653330530971289e-03 0 -1 694
+            -5.3326018154621124e-02 -2 -3 695 8.0891316756606102e-03</internalNodes>
+          <leafValues>
+            1.7236860096454620e-01 -3.9026060700416565e-01
+            -1.6290800645947456e-02 3.9434731006622314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 696 -3.7783260922878981e-03 2 -1 697
+            6.9123809225857258e-03 -2 -3 698 -2.1676100790500641e-02</internalNodes>
+          <leafValues>
+            -5.9947258234024048e-01 3.4755259752273560e-01
+            3.3966198563575745e-01 -1.2729069590568542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 699 4.8390422016382217e-03 -1 2 700
+            -8.3583313971757889e-03 -2 -3 701 3.7209360743872821e-04</internalNodes>
+          <leafValues>
+            -3.6860859394073486e-01 3.6083450913429260e-01
+            5.5149830877780914e-02 -3.8888710737228394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 702 2.4114940315485001e-03 -1 2 703
+            -2.2250239271670580e-03 -2 -3 704 5.9994249604642391e-03</internalNodes>
+          <leafValues>
+            -3.4846460819244385e-01 2.5639998912811279e-01
+            -3.3086439967155457e-01 6.3943088054656982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 705 1.2653459794819355e-02 2 -1 706
+            9.6980258822441101e-03 -2 -3 707 4.6688161790370941e-02</internalNodes>
+          <leafValues>
+            -6.5382891893386841e-01 3.2730111479759216e-01
+            6.1174212023615837e-03 -5.0968867540359497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 708 1.7876239726319909e-03 2 -1 709
+            1.2315230444073677e-02 -2 -3 710 -5.9714429080486298e-03</internalNodes>
+          <leafValues>
+            2.5808030366897583e-01 1.8367570638656616e-01
+            9.3017883598804474e-02 -3.3489298820495605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 711 -4.6226778067648411e-03 -1 2 712
+            -1.8949989229440689e-02 -2 -3 713 -2.6787531375885010e-01</internalNodes>
+          <leafValues>
+            -6.0853439569473267e-01 -6.2188267707824707e-01
+            -4.4505828619003296e-01 1.1461599916219711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 714 5.3505371324717999e-03 0 -1 715
+            2.8202211251482368e-04 -2 -3 716 -2.1514539548661560e-04</internalNodes>
+          <leafValues>
+            -3.3214330673217773e-01 1.1352939903736115e-01
+            3.9949831366539001e-01 -7.2412580251693726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 717 -7.1091961581259966e-04 -1 2 718
+            3.9453650970244780e-05 -2 -3 719 -1.5662070363759995e-02</internalNodes>
+          <leafValues>
+            -3.4575951099395752e-01 -1.4114260673522949e-01
+            4.7070771455764771e-01 8.7163902819156647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 720 -2.9816610738635063e-02 0 -1 721
+            8.2333059981465340e-04 -2 -3 722 -4.9664578400552273e-03</internalNodes>
+          <leafValues>
+            -1.4977900311350822e-02 -4.1764840483665466e-01
+            4.4018781185150146e-01 -2.0097310189157724e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 723 9.6796536818146706e-03 0 -1 724
+            1.4388150302693248e-03 -2 -3 725 -6.5185758285224438e-04</internalNodes>
+          <leafValues>
+            -2.8451511263847351e-01 1.1680959910154343e-01
+            3.4258028864860535e-01 -2.7020359039306641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 726 -4.6871218830347061e-02 -1 2 727
+            -2.2867210209369659e-02 -2 -3 728 -1.1887500295415521e-03</internalNodes>
+          <leafValues>
+            -3.9659130573272705e-01 -3.4727048873901367e-01
+            2.6036709547042847e-01 -4.2848858982324600e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 729 4.3433779501356184e-04 -1 2 730
+            -2.0600060001015663e-02 -2 -3 731 3.2824440859258175e-03</internalNodes>
+          <leafValues>
+            -2.2835609316825867e-01 -5.0135952234268188e-01
+            1.6683070361614227e-01 -5.0252157449722290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 732 -1.9087310880422592e-02 -1 2 733
+            -1.1216020211577415e-02 -2 -3 734 7.7710166573524475e-02</internalNodes>
+          <leafValues>
+            4.1381299495697021e-01 1.5498070418834686e-01
+            -2.9895618557929993e-01 1.7541980743408203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 735 3.1873160041868687e-03 -1 2 736
+            -1.0656990110874176e-01 -2 -3 737 -5.1779888570308685e-02</internalNodes>
+          <leafValues>
+            -8.5479579865932465e-02 -5.1295292377471924e-01
+            -5.0179839134216309e-01 3.8466781377792358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 738 1.5107400249689817e-03 2 -1 739
+            3.1244980636984110e-03 -2 -3 740 -1.3240240514278412e-03</internalNodes>
+          <leafValues>
+            -3.3874571323394775e-01 -2.1653899550437927e-01
+            3.3594998717308044e-01 -1.2085800059139729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 741 -1.6975030303001404e-02 2 -1 742
+            7.9635268775746226e-04 -2 -3 743 -8.4425378590822220e-03</internalNodes>
+          <leafValues>
+            5.1493197679519653e-01 -2.2367909550666809e-01
+            -5.4637181758880615e-01 1.2477649748325348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 744 1.4797519892454147e-02 2 -1 745
+            3.8537830114364624e-03 -2 -3 746 -2.5684939697384834e-02</internalNodes>
+          <leafValues>
+            4.0930178761482239e-01 2.5966641306877136e-01
+            4.6507820487022400e-02 -3.1387579441070557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 747 -1.9678380340337753e-03 2 -1 748
+            1.9392849644646049e-03 -2 -3 749 -5.7980217970907688e-03</internalNodes>
+          <leafValues>
+            -3.4348770976066589e-01 -2.3071029782295227e-01
+            -4.2302230000495911e-01 1.8470630049705505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 750 6.0432781465351582e-03 2 -1 751
+            2.2162510140333325e-04 -2 -3 752 -2.5901809567585588e-04</internalNodes>
+          <leafValues>
+            2.0985080301761627e-01 -3.4345629811286926e-01
+            -4.0245899558067322e-01 9.6283361315727234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 753 -4.6646450646221638e-03 -1 2 754
+            1.8331389874219894e-03 -2 -3 755 -5.4393261671066284e-03</internalNodes>
+          <leafValues>
+            -4.0147981047630310e-01 -7.4128046631813049e-02
+            -7.1304339170455933e-01 2.5141170620918274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 756 -4.2101307772099972e-03 0 -1 757
+            -8.6573585867881775e-03 -2 -3 758 -2.5619829073548317e-02</internalNodes>
+          <leafValues>
+            5.5250108242034912e-01 -8.8310241699218750e-02
+            4.0513488650321960e-01 -1.2086849659681320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 759 -9.3565601855516434e-03 -1 2 760
+            -9.7968382760882378e-04 -2 -3 761 4.5081991702318192e-02</internalNodes>
+          <leafValues>
+            1.4859180152416229e-01 1.5276379883289337e-01
+            -3.3007758855819702e-01 4.9553450942039490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 762 2.0435510668903589e-03 -1 2 763
+            -5.1532210782170296e-03 -2 -3 764 2.5609789881855249e-03</internalNodes>
+          <leafValues>
+            -5.4895031452178955e-01 -5.9945631027221680e-01
+            -3.6197409033775330e-02 2.5463849306106567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 765 -2.8830259107053280e-03 0 -1 766
+            2.4457499966956675e-04 -2 -3 767 3.4641250967979431e-03</internalNodes>
+          <leafValues>
+            3.6667680740356445e-01 -8.9348360896110535e-02
+            -2.2523890435695648e-01 1.6340459883213043e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.3826370239257812e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 768 6.3124410808086395e-03 0 -1 769
+            -2.9899911023676395e-03 -2 -3 770 -5.2643599919974804e-03</internalNodes>
+          <leafValues>
+            8.2071298360824585e-01 5.6462198495864868e-02
+            1.8240800499916077e-01 -4.2487311363220215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 771 2.4592089466750622e-03 0 -1 772
+            4.2719349265098572e-01 -2 -3 773 3.0295109376311302e-02</internalNodes>
+          <leafValues>
+            -3.3858558535575867e-01 1.5100230276584625e-01
+            7.8724241256713867e-01 -5.8373618125915527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 774 5.7569369673728943e-03 -1 2 775
+            -9.9140219390392303e-03 -2 -3 776 8.0783478915691376e-03</internalNodes>
+          <leafValues>
+            4.2810270190238953e-01 3.5321989655494690e-01
+            -4.0107539296150208e-01 1.2523290514945984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 777 -3.5829450935125351e-02 2 -1 778
+            3.0664550140500069e-02 -2 -3 779 -1.3575930148363113e-02</internalNodes>
+          <leafValues>
+            -3.8963070511817932e-01 6.7701917886734009e-01
+            3.0789810419082642e-01 -1.1214990168809891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 780 -3.1188609078526497e-02 -1 2 781
+            -1.7885420471429825e-02 -2 -3 782 2.3879480431787670e-04</internalNodes>
+          <leafValues>
+            -5.0550907850265503e-01 -5.2990978956222534e-01
+            2.6112490892410278e-01 -1.2882560491561890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 783 8.5746757686138153e-03 2 -1 784
+            2.3016470950096846e-03 -2 -3 785 4.6683140099048615e-03</internalNodes>
+          <leafValues>
+            4.8921179771423340e-01 1.5979060530662537e-01
+            -3.8685420155525208e-01 2.4002879858016968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 786 5.3485399112105370e-03 2 -1 787
+            2.3726709187030792e-02 -2 -3 788 -3.0209170654416084e-04</internalNodes>
+          <leafValues>
+            3.4825628995895386e-01 5.2329671382904053e-01
+            -4.4047841429710388e-01 -3.3358339220285416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 789 -1.6881260275840759e-01 -1 2 790
+            -1.8069280486088246e-04 -2 -3 791 -2.7342080138623714e-03</internalNodes>
+          <leafValues>
+            -6.5631157159805298e-01 -2.7557009458541870e-01
+            4.0996900200843811e-01 3.1245049089193344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 792 -3.1896680593490601e-03 0 -1 793
+            -1.6777559649199247e-03 -2 -3 794 7.5925810961052775e-04</internalNodes>
+          <leafValues>
+            3.1674280762672424e-01 -1.3047559559345245e-01
+            8.2382179796695709e-02 7.4721777439117432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 795 1.7604179680347443e-02 0 -1 796
+            -2.5936108827590942e-01 -2 -3 797 -2.4794649798423052e-03</internalNodes>
+          <leafValues>
+            2.6953551173210144e-01 -3.3992108702659607e-01
+            5.0643271207809448e-01 2.7994990348815918e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 798 -5.7244639843702316e-02 -1 2 799
+            -2.9133851057849824e-04 -2 -3 800 3.0808679759502411e-02</internalNodes>
+          <leafValues>
+            -6.9636821746826172e-01 -3.1919568777084351e-01
+            1.3237810134887695e-01 -7.6749938726425171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 801 2.8046660125255585e-02 2 -1 802
+            -3.7829200737178326e-03 -2 -3 803 -1.3911469839513302e-02</internalNodes>
+          <leafValues>
+            6.9832587242126465e-01 -2.1438920497894287e-01
+            3.3778458833694458e-01 -9.6943713724613190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 804 -9.6410012338310480e-04 -1 2 805
+            -4.1028819978237152e-03 -2 -3 806 7.6512782834470272e-04</internalNodes>
+          <leafValues>
+            2.7303680777549744e-01 1.8931980431079865e-01
+            -3.2082849740982056e-01 8.1871077418327332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 807 -2.2203559638001025e-04 -1 2 808
+            -2.5135980104096234e-04 -2 -3 809 -1.7842829402070493e-04</internalNodes>
+          <leafValues>
+            -2.9679200053215027e-01 -2.7259480953216553e-01
+            -2.2551620006561279e-01 2.9105350375175476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 810 2.2679679095745087e-02 -1 2 811
+            -1.4839429641142488e-03 -2 -3 812 -9.7775906324386597e-02</internalNodes>
+          <leafValues>
+            6.0594111680984497e-01 5.8346527814865112e-01
+            -5.1989138126373291e-01 -2.1351039409637451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 813 -2.1942430175840855e-03 0 -1 814
+            9.6272170543670654e-02 -2 -3 815 2.5899629108607769e-03</internalNodes>
+          <leafValues>
+            -2.3860040307044983e-01 4.5208680629730225e-01
+            -3.2299709320068359e-01 2.3171809315681458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 816 5.4749320261180401e-03 -1 2 817
+            -1.4976410195231438e-02 -2 -3 818 -7.3499558493494987e-03</internalNodes>
+          <leafValues>
+            2.6661419868469238e-01 -4.7525641322135925e-01
+            3.6936700344085693e-01 -1.0437080264091492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 819 8.0258701927959919e-04 -1 2 820
+            -3.1779240816831589e-03 -2 -3 821 -1.6361019515898079e-04</internalNodes>
+          <leafValues>
+            -2.6545119285583496e-01 -2.6746180653572083e-01
+            -1.3902419805526733e-01 2.9700610041618347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 822 -3.0408808961510658e-03 -1 2 823
+            -1.2945629656314850e-02 -2 -3 824 -1.7983650788664818e-02</internalNodes>
+          <leafValues>
+            -1.0607139766216278e-01 -4.2864450812339783e-01
+            5.3250139951705933e-01 6.2068658880889416e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 825 3.5721210297197104e-03 2 -1 826
+            3.3481561113148928e-03 -2 -3 827 -2.7103780303150415e-04</internalNodes>
+          <leafValues>
+            2.8643238544464111e-01 5.2708417177200317e-01
+            -4.0083900094032288e-01 -1.1597709730267525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 828 -3.5315480083227158e-02 -1 2 829
+            -3.3448180183768272e-03 -2 -3 830 -3.6211799830198288e-02</internalNodes>
+          <leafValues>
+            -6.4248001575469971e-01 1.6799710690975189e-01
+            -4.4045579433441162e-01 7.2158249095082283e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 831 9.7624881891533732e-04 2 -1 832
+            3.9304429083131254e-04 -2 -3 833 -9.0960100293159485e-02</internalNodes>
+          <leafValues>
+            -3.3223769068717957e-01 -2.9518169164657593e-01
+            -2.6596671342849731e-01 1.9091020524501801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 834 -9.7260335460305214e-03 2 -1 835
+            6.3109961338341236e-03 -2 -3 836 -1.8113269470632076e-04</internalNodes>
+          <leafValues>
+            4.3416848778724670e-01 3.6779248714447021e-01
+            -3.8609200716018677e-01 -2.1463580429553986e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>-1.2412749528884888e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 837 2.1084180101752281e-02 0 -1 838
+            -2.1115990821272135e-03 -2 -3 839 -3.7253301125019789e-03</internalNodes>
+          <leafValues>
+            7.7905070781707764e-01 -9.1717608273029327e-02
+            3.5618048161268234e-02 -3.5509699583053589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 840 -4.9224868416786194e-02 0 -1 841
+            -1.2256789952516556e-02 -2 -3 842 -1.7591969808563590e-03</internalNodes>
+          <leafValues>
+            2.3374380171298981e-01 -2.0726789534091949e-01
+            7.1231132745742798e-01 1.5468549728393555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 843 -1.3072569854557514e-02 -1 2 844
+            1.0713989846408367e-02 -2 -3 845 2.7589630335569382e-03</internalNodes>
+          <leafValues>
+            -1.7413349449634552e-01 -1.3037489354610443e-01
+            4.3284869194030762e-01 -6.6202241182327271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 846 -7.0322921965271235e-04 2 -1 847
+            3.2859561033546925e-03 -2 -3 848 -1.5731799649074674e-03</internalNodes>
+          <leafValues>
+            -4.2838820815086365e-01 -4.5926880836486816e-01
+            -4.6182459592819214e-01 1.7856159806251526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 849 -6.4174369908869267e-03 -1 2 850
+            1.6610589809715748e-03 -2 -3 851 1.5099810436367989e-02</internalNodes>
+          <leafValues>
+            -5.4262351989746094e-01 -6.4273983240127563e-02
+            4.0244659781455994e-01 -6.2330418825149536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 852 1.6554270405322313e-03 -1 2 853
+            -3.3705390524119139e-03 -2 -3 854 -1.0568870231509209e-02</internalNodes>
+          <leafValues>
+            -4.5953160524368286e-01 3.0769738554954529e-01
+            2.8306689858436584e-01 -1.5513870120048523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 855 -1.5460990369319916e-02 0 -1 856
+            1.0563080199062824e-02 -2 -3 857 -2.5313820224255323e-03</internalNodes>
+          <leafValues>
+            -2.3533730208873749e-01 1.7863610386848450e-01
+            -3.9789968729019165e-01 3.4673249721527100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 858 -1.1370539665222168e-02 0 -1 859
+            5.1206751959398389e-04 -2 -3 860 2.0633509848266840e-03</internalNodes>
+          <leafValues>
+            3.5862970352172852e-01 -2.6715761423110962e-01
+            -2.3807419836521149e-01 8.9544452726840973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 861 6.1831250786781311e-03 2 -1 862
+            -1.5297930222004652e-03 -2 -3 863 -1.4521819539368153e-03</internalNodes>
+          <leafValues>
+            -3.4589260816574097e-01 -5.7744260877370834e-02
+            -2.2643689811229706e-01 3.3492559194564819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 864 9.1494834050536156e-03 -1 2 865
+            -7.8258356079459190e-03 -2 -3 866 -9.1795083135366440e-03</internalNodes>
+          <leafValues>
+            -4.5102459192276001e-01 -2.0574240386486053e-01
+            2.8064918518066406e-01 -1.9400069490075111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 867 5.2864141762256622e-03 -1 2 868
+            -1.1895409785211086e-02 -2 -3 869 -2.9768719105049968e-04</internalNodes>
+          <leafValues>
+            3.8742628693580627e-01 3.3122861385345459e-01
+            -4.1473099589347839e-01 -4.6005301177501678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 870 -9.9406214430928230e-03 -1 2 871
+            1.8322050891583785e-05 -2 -3 872 -8.9074727147817612e-03</internalNodes>
+          <leafValues>
+            -6.0510438680648804e-01 -1.5049360692501068e-01
+            4.3751770257949829e-01 4.4532001018524170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 873 2.7458940166980028e-04 0 -1 874
+            -1.0605080024106428e-04 -2 -3 875 1.3431450352072716e-02</internalNodes>
+          <leafValues>
+            3.4243520349264145e-02 -3.1917920708656311e-01
+            5.4285280406475067e-02 5.1082128286361694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 876 1.7373449736624025e-05 2 -1 877
+            2.6647070626495406e-05 -2 -3 878 2.8135200409451500e-05</internalNodes>
+          <leafValues>
+            -1.3858599960803986e-01 2.9074499011039734e-01
+            -5.2693158388137817e-01 6.1677869409322739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 879 -1.4079789980314672e-04 -1 2 880
+            -1.0311259888112545e-02 -2 -3 881 -2.7866840362548828e-02</internalNodes>
+          <leafValues>
+            -1.4329759776592255e-01 -4.7958651185035706e-01
+            3.8226899504661560e-01 1.0630049742758274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 882 5.8228662237524986e-03 2 -1 883
+            -8.7669547647237778e-03 -2 -3 884 -2.8466230724006891e-03</internalNodes>
+          <leafValues>
+            2.9776591062545776e-01 -1.8124760687351227e-01
+            -2.4237589538097382e-01 3.0139160156250000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 885 6.4540808089077473e-03 2 -1 886
+            6.9421119987964630e-03 -2 -3 887 -7.1991360746324062e-03</internalNodes>
+          <leafValues>
+            -4.7911441326141357e-01 -3.8983830809593201e-01
+            -3.8099661469459534e-01 1.3023279607295990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 888 1.3020260259509087e-02 -1 2 889
+            -1.0113810189068317e-02 -2 -3 890 -1.9183289259672165e-02</internalNodes>
+          <leafValues>
+            4.9582180380821228e-01 4.5563331246376038e-01
+            3.3518138527870178e-01 -1.1938130110502243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 891 1.0314499959349632e-03 0 -1 892
+            5.7669691159389913e-05 -2 -3 893 5.0447430461645126e-02</internalNodes>
+          <leafValues>
+            -3.5977721214294434e-01 2.6054680347442627e-02
+            1.6761170327663422e-01 -2.8970599174499512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 894 3.7453400436788797e-03 2 -1 895
+            4.7667181206634268e-05 -2 -3 896 -5.3708041377831250e-05</internalNodes>
+          <leafValues>
+            -4.6433079242706299e-01 1.8610210716724396e-01
+            5.6288938969373703e-02 -4.2427191138267517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 897 -6.5939482301473618e-03 -1 2 898
+            -2.1548079326748848e-02 -2 -3 899 1.3188139535486698e-02</internalNodes>
+          <leafValues>
+            -4.7423711419105530e-01 -4.2937740683555603e-01
+            1.1677609756588936e-02 4.2440900206565857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 900 1.2091189622879028e-02 2 -1 901
+            -6.2589373555965722e-05 -2 -3 902 1.9446300575509667e-03</internalNodes>
+          <leafValues>
+            2.3611229658126831e-01 -2.1822200715541840e-01
+            -2.5404209271073341e-02 4.2902240157127380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 903 7.7299331314861774e-03 -1 2 904
+            -3.7915860302746296e-03 -2 -3 905 4.3860040605068207e-03</internalNodes>
+          <leafValues>
+            -5.3524547815322876e-01 -4.3546271324157715e-01
+            1.2576849758625031e-01 -2.8148999810218811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 906 -9.4350852305069566e-04 -1 2 907
+            -1.1670179665088654e-03 -2 -3 908 2.9260620940476656e-03</internalNodes>
+          <leafValues>
+            -1.7022730410099030e-01 2.6141870021820068e-01
+            -1.7437639832496643e-01 3.8530299067497253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 909 1.4593300409615040e-02 2 -1 910
+            7.9177077859640121e-03 -2 -3 911 -3.1372120138257742e-03</internalNodes>
+          <leafValues>
+            -5.5104351043701172e-01 2.7703890204429626e-01
+            1.3093240559101105e-01 -1.6954340040683746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 912 -9.2021061573177576e-04 0 -1 913
+            -1.0446259751915932e-02 -2 -3 914 -8.3597414195537567e-03</internalNodes>
+          <leafValues>
+            4.4468599557876587e-01 -3.9477398991584778e-01
+            3.4909680485725403e-01 -1.0887180455029011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 915 -9.7741633653640747e-03 -1 2 916
+            1.2587079778313637e-02 -2 -3 917 -1.4933859929442406e-03</internalNodes>
+          <leafValues>
+            2.1157720685005188e-01 -1.4542940258979797e-01
+            -1.5098230540752411e-01 5.0790101289749146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 918 -5.0530377775430679e-03 -1 2 919
+            -2.5890849065035582e-04 -2 -3 920 4.8418638471048325e-05</internalNodes>
+          <leafValues>
+            -2.3845790326595306e-01 -2.5153321027755737e-01
+            -2.4533210322260857e-02 3.0376350879669189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 921 2.3038890212774277e-03 2 -1 922
+            3.6540660075843334e-03 -2 -3 923 -3.3346249256283045e-03</internalNodes>
+          <leafValues>
+            2.8125861287117004e-01 -3.6965739727020264e-01
+            -3.0266079306602478e-01 8.8287420570850372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 924 -1.1975349858403206e-02 -1 2 925
+            -1.8564870115369558e-03 -2 -3 926 1.5760740498080850e-03</internalNodes>
+          <leafValues>
+            -4.6360239386558533e-01 3.9942011237144470e-01
+            -1.1057750135660172e-01 1.6782909631729126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 927 4.1210349649190903e-02 2 -1 928
+            -1.0635109618306160e-02 -2 -3 929 -3.3335660118609667e-03</internalNodes>
+          <leafValues>
+            -6.8945991992950439e-01 -9.5825389027595520e-02
+            -4.6437320113182068e-01 2.2104820609092712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 930 -2.4082309100776911e-03 2 -1 931
+            5.5890781804919243e-03 -2 -3 932 1.2177750468254089e-03</internalNodes>
+          <leafValues>
+            2.0128449797630310e-01 -5.2314841747283936e-01
+            3.1367950141429901e-02 -4.1038578748703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 933 8.6324941366910934e-03 2 -1 934
+            3.8473210297524929e-03 -2 -3 935 -1.8842349527403712e-03</internalNodes>
+          <leafValues>
+            3.1741571426391602e-01 -4.3851628899574280e-01
+            3.8140851259231567e-01 -6.0103170573711395e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>41</maxWeakCount>
+      <stageThreshold>-1.2084549665451050e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 936 -2.3675959557294846e-02 -1 2 937
+            -2.0480139646679163e-03 -2 -3 938 8.1840698840096593e-04</internalNodes>
+          <leafValues>
+            -3.5308888554573059e-01 6.9878387451171875e-01
+            -2.8367671370506287e-01 4.1667369008064270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 939 1.2784999562427402e-03 0 -1 940
+            -3.4423400647938251e-03 -2 -3 941 -7.4483961798250675e-03</internalNodes>
+          <leafValues>
+            3.3807888627052307e-01 -1.6657039523124695e-01
+            6.4591968059539795e-01 -2.2018529474735260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 942 1.1179470457136631e-02 2 -1 943
+            -2.3196099698543549e-01 -2 -3 944 -4.3133709579706192e-02</internalNodes>
+          <leafValues>
+            -3.2552671432495117e-01 -8.3167977631092072e-02
+            -1.6172540187835693e-01 4.6209758520126343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 945 -1.9728920597117394e-04 -1 2 946
+            -2.3259329609572887e-03 -2 -3 947 -1.0320080444216728e-02</internalNodes>
+          <leafValues>
+            -1.5667790174484253e-01 3.6914899945259094e-01
+            4.8015019297599792e-01 -8.9061602950096130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 948 -2.0040970295667648e-02 -1 2 949
+            -2.4495070101693273e-04 -2 -3 950 -1.1836830526590347e-03</internalNodes>
+          <leafValues>
+            -5.6967437267303467e-01 -2.3713299632072449e-01
+            -3.4671390056610107e-01 1.4475019276142120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 951 -2.6744368951767683e-03 2 -1 952
+            -5.1904888823628426e-03 -2 -3 953 -1.9888129085302353e-02</internalNodes>
+          <leafValues>
+            -1.2661710381507874e-01 -6.4648993313312531e-02
+            -4.5441371202468872e-01 3.9849451184272766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 954 -5.7462421245872974e-03 2 -1 955
+            4.4583589769899845e-03 -2 -3 956 -1.2518949806690216e-02</internalNodes>
+          <leafValues>
+            -3.6761870980262756e-01 3.8435870409011841e-01
+            -6.1902827024459839e-01 1.9050609320402145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 957 -7.7734276652336121e-02 2 -1 958
+            6.7193829454481602e-03 -2 -3 959 1.6520710196346045e-03</internalNodes>
+          <leafValues>
+            5.5405282974243164e-01 -4.1308841109275818e-01
+            7.3280662298202515e-02 -2.8589090704917908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 960 2.1226350218057632e-02 2 -1 961
+            1.1231450363993645e-02 -2 -3 962 -1.8163130152970552e-04</internalNodes>
+          <leafValues>
+            3.6871838569641113e-01 3.5591110587120056e-01
+            -3.3781459927558899e-01 -8.1584807485342026e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 963 2.8726160526275635e-02 2 -1 964
+            5.0780461169779301e-03 -2 -3 965 -5.1352521404623985e-04</internalNodes>
+          <leafValues>
+            -7.2751021385192871e-01 2.6649999618530273e-01
+            1.1073680222034454e-01 -1.8206079304218292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 966 -3.8125980645418167e-03 2 -1 967
+            9.1425428399816155e-04 -2 -3 968 1.0090490104630589e-03</internalNodes>
+          <leafValues>
+            -2.8374129533767700e-01 2.4259260296821594e-01
+            6.0151178389787674e-02 -2.7039301395416260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 969 -7.8553140163421631e-02 -1 2 970
+            -6.5192081965506077e-03 -2 -3 971 2.0706290379166603e-03</internalNodes>
+          <leafValues>
+            -5.5804842710494995e-01 2.5557601451873779e-01
+            -1.0600800067186356e-01 2.7225118875503540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 972 1.3555780053138733e-02 -1 2 973
+            7.0873757067602128e-05 -2 -3 974 -1.4444560511037707e-03</internalNodes>
+          <leafValues>
+            -4.8073831200599670e-01 -1.3499049842357635e-01
+            4.3762150406837463e-01 4.8329260200262070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 975 -3.6353049799799919e-03 -1 2 976
+            -2.7163419872522354e-03 -2 -3 977 -7.4552530422806740e-03</internalNodes>
+          <leafValues>
+            -1.2743209302425385e-01 3.3708488941192627e-01
+            5.4894310235977173e-01 -1.0238330066204071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 978 1.8306199926882982e-03 0 -1 979
+            3.5198179539293051e-03 -2 -3 980 -3.0126908677630126e-04</internalNodes>
+          <leafValues>
+            -2.4612280726432800e-01 1.5894930064678192e-01
+            -2.7785000205039978e-01 2.3901990056037903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 981 3.1999459024518728e-03 0 -1 982
+            1.4862619573250413e-03 -2 -3 983 -1.3004139764234424e-03</internalNodes>
+          <leafValues>
+            4.7738438844680786e-01 -3.1345888972282410e-02
+            7.1047246456146240e-02 -2.1556860208511353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 984 1.5583000145852566e-02 2 -1 985
+            7.6356581412255764e-03 -2 -3 986 -1.4318820321932435e-03</internalNodes>
+          <leafValues>
+            2.7187249064445496e-01 -5.1074218750000000e-01
+            -1.5140180289745331e-01 1.4207449555397034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 987 -6.7814798094332218e-03 0 -1 988
+            -1.1809200048446655e-01 -2 -3 989 -2.8277190402150154e-02</internalNodes>
+          <leafValues>
+            -6.9562858343124390e-01 3.3270710706710815e-01
+            1.1135250329971313e-01 -1.7491710186004639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 990 -3.7033241242170334e-02 -1 2 991
+            -4.9177031032741070e-03 -2 -3 992 -2.7518879505805671e-04</internalNodes>
+          <leafValues>
+            2.8885498642921448e-01 -4.0966060757637024e-01
+            -3.1160330772399902e-01 6.0995019972324371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 993 -2.3584270384162664e-03 -1 2 994
+            -3.5775059368461370e-03 -2 -3 995 -4.1078119538724422e-03</internalNodes>
+          <leafValues>
+            -5.9846490621566772e-01 2.4603059887886047e-01
+            8.5180006921291351e-02 -2.0629020035266876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 996 1.5300850383937359e-02 -1 2 997
+            -1.5483479946851730e-02 -2 -3 998 -5.7852710597217083e-03</internalNodes>
+          <leafValues>
+            3.0057510733604431e-01 -6.8350881338119507e-01
+            2.0100210607051849e-01 -9.0607739984989166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 999 1.4448310248553753e-02 -1 2 1000
+            -3.1330309808254242e-02 -2 -3 1001 -3.0594000127166510e-03</internalNodes>
+          <leafValues>
+            2.6733011007308960e-01 -5.2288150787353516e-01
+            4.0950208902359009e-01 -6.5823979675769806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1002 -1.8781309481710196e-03 2 -1 1003
+            -5.8503728359937668e-03 -2 -3 1004 2.6462681125849485e-03</internalNodes>
+          <leafValues>
+            -2.5463208556175232e-01 -1.2269999831914902e-01
+            -7.9216457903385162e-02 2.9203468561172485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1005 1.3989449944347143e-03 2 -1 1006
+            9.7635984420776367e-03 -2 -3 1007 -9.4864349812269211e-03</internalNodes>
+          <leafValues>
+            1.2148520350456238e-01 2.7110511064529419e-01
+            1.0176890343427658e-01 -3.2153740525245667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1008 1.5739769442006946e-03 2 -1 1009
+            4.9365921877324581e-03 -2 -3 1010 -5.0848699174821377e-04</internalNodes>
+          <leafValues>
+            -5.9908610582351685e-01 -3.8752740621566772e-01
+            -1.3056530058383942e-01 1.2711940705776215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1011 -9.6375271677970886e-02 -1 2 1012
+            -8.0375596880912781e-02 -2 -3 1013 -5.4449690505862236e-03</internalNodes>
+          <leafValues>
+            -6.8821328878402710e-01 4.1428178548812866e-01
+            8.2179926335811615e-02 -1.8036940693855286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1014 -7.6126731000840664e-03 2 -1 1015
+            -3.1007949728518724e-03 -2 -3 1016 -2.0799610763788223e-02</internalNodes>
+          <leafValues>
+            1.7513050138950348e-01 -2.1534129977226257e-01
+            2.9026609659194946e-01 -2.1753519773483276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1017 -1.7213800549507141e-01 -1 2 1018
+            -1.7464880365878344e-03 -2 -3 1019 -6.8416520953178406e-02</internalNodes>
+          <leafValues>
+            2.2739590704441071e-01 1.3240070641040802e-01
+            -6.2430542707443237e-01 -1.0549639910459518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1020 -1.9070530310273170e-02 -1 2 1021
+            -2.8794098761864007e-04 -2 -3 1022 7.3958968278020620e-04</internalNodes>
+          <leafValues>
+            5.5033868551254272e-01 -3.4565579891204834e-01
+            1.8934780359268188e-01 -8.8741242885589600e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1023 -7.5153419747948647e-03 -1 2 1024
+            -1.2848030310124159e-03 -2 -3 1025 1.2194210430607200e-03</internalNodes>
+          <leafValues>
+            -4.5797100663185120e-01 1.2825480103492737e-01
+            -2.9630279541015625e-01 1.9254499673843384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1026 -1.6169670224189758e-01 0 -1 1027
+            1.4747560024261475e-02 -2 -3 1028 -8.4396981401368976e-04</internalNodes>
+          <leafValues>
+            -4.4868141412734985e-01 1.3941350579261780e-01
+            2.0387759804725647e-01 -5.6935109198093414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1029 -1.2965890346094966e-04 -1 2 1030
+            -1.3776419684290886e-02 -2 -3 1031 -9.4375656917691231e-03</internalNodes>
+          <leafValues>
+            -1.4722099900245667e-01 2.4039970338344574e-01
+            5.5077737569808960e-01 -1.5877890586853027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1032 1.1291690316284075e-04 -1 2 1033
+            6.6032530739903450e-03 -2 -3 1034 2.0985701121389866e-03</internalNodes>
+          <leafValues>
+            1.3769179582595825e-01 -2.5903069972991943e-01
+            2.3297089338302612e-01 -3.7152260541915894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1035 -1.8329389858990908e-03 0 -1 1036
+            -1.6420709434896708e-03 -2 -3 1037 6.7886798642575741e-03</internalNodes>
+          <leafValues>
+            3.5991749167442322e-01 -1.5401339530944824e-01
+            1.8581290543079376e-01 -6.7269998788833618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1038 1.6932019498199224e-03 -1 2 1039
+            -1.0055249556899071e-02 -2 -3 1040 -3.1679549720138311e-03</internalNodes>
+          <leafValues>
+            -1.3255499303340912e-01 3.8144260644912720e-01
+            3.2224041223526001e-01 -8.5345722734928131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1041 2.4724518880248070e-04 0 -1 1042
+            -2.4610899854451418e-03 -2 -3 1043 4.2370590381324291e-04</internalNodes>
+          <leafValues>
+            2.4504560232162476e-01 -4.2068049311637878e-01
+            9.6731372177600861e-02 -3.6695280671119690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1044 -2.3991330526769161e-03 0 -1 1045
+            -1.0543569922447205e-01 -2 -3 1046 -2.9867719858884811e-03</internalNodes>
+          <leafValues>
+            -7.3811298608779907e-01 2.8551021218299866e-01
+            1.9291989505290985e-01 -1.4805729687213898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1047 -4.0492648258805275e-03 2 -1 1048
+            -1.1622729944065213e-03 -2 -3 1049 -2.7857329696416855e-02</internalNodes>
+          <leafValues>
+            1.0766500234603882e-01 -2.7701449394226074e-01
+            3.9593660831451416e-01 -2.0954720675945282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1050 8.1511605530977249e-03 0 -1 1051
+            1.5126319602131844e-02 -2 -3 1052 -1.1020600050687790e-01</internalNodes>
+          <leafValues>
+            6.8626463413238525e-02 5.3772068023681641e-01
+            -4.9161431193351746e-01 -4.4780239462852478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1053 -1.6588929574936628e-03 0 -1 1054
+            -3.4530278295278549e-02 -2 -3 1055 1.0060180211439729e-03</internalNodes>
+          <leafValues>
+            3.6734369397163391e-01 -2.5586590170860291e-02
+            2.7465619146823883e-02 -3.4973311424255371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1056 -2.8843909502029419e-02 2 -1 1057
+            2.4647780810482800e-04 -2 -3 1058 -7.4189889710396528e-04</internalNodes>
+          <leafValues>
+            -6.5100878477096558e-01 -1.8410819768905640e-01
+            -9.0942107141017914e-02 2.2521719336509705e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>37</maxWeakCount>
+      <stageThreshold>-1.2229189872741699e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 1059 -1.2407599948346615e-02 0 -1 1060
+            -1.1902820318937302e-02 -2 -3 1061 -5.5238649249076843e-02</internalNodes>
+          <leafValues>
+            6.8965518474578857e-01 -1.3579159975051880e-01
+            -4.4337168335914612e-02 -4.5446300506591797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1062 3.3332619350403547e-03 0 -1 1063
+            4.8620607703924179e-03 -2 -3 1064 -3.1632129102945328e-03</internalNodes>
+          <leafValues>
+            -3.1873029470443726e-01 7.0181049406528473e-02
+            -3.2160758972167969e-01 7.0131868124008179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1065 1.8592040240764618e-01 -1 2 1066
+            3.1807690393179655e-03 -2 -3 1067 -9.4139128923416138e-03</internalNodes>
+          <leafValues>
+            3.4192711114883423e-01 -3.3313518762588501e-01
+            3.2091590762138367e-01 -1.2491060048341751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1068 6.5205397550016642e-04 2 -1 1069
+            -5.0521180965006351e-03 -2 -3 1070 7.6105687767267227e-03</internalNodes>
+          <leafValues>
+            -2.3811559379100800e-01 -1.4155420660972595e-01
+            3.2182168960571289e-01 -2.4797810614109039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1071 -1.6043110517784953e-03 -1 2 1072
+            -2.7449749410152435e-02 -2 -3 1073 5.6960887741297483e-04</internalNodes>
+          <leafValues>
+            1.9883860647678375e-01 -6.9581168889999390e-01
+            5.0723928958177567e-02 -2.9218611121177673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1074 2.7564789634197950e-03 2 -1 1075
+            -1.1058920063078403e-02 -2 -3 1076 5.1102549768984318e-03</internalNodes>
+          <leafValues>
+            2.0911119878292084e-01 -2.4516950547695160e-01
+            -1.0658439993858337e-01 4.0211549401283264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1077 4.5064617879688740e-03 2 -1 1078
+            4.2800018563866615e-03 -2 -3 1079 7.8124259598553181e-03</internalNodes>
+          <leafValues>
+            -4.6300640702247620e-01 -3.9396348595619202e-01
+            1.4130340516567230e-01 -2.8671020269393921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1080 4.4836059212684631e-02 2 -1 1081
+            1.7986740916967392e-02 -2 -3 1082 -6.0726520605385303e-03</internalNodes>
+          <leafValues>
+            -5.0257712602615356e-01 3.1318759918212891e-01
+            9.8504282534122467e-02 -2.2500780224800110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1083 -1.8578730523586273e-02 2 -1 1084
+            3.5717431455850601e-02 -2 -3 1085 -1.8269789870828390e-03</internalNodes>
+          <leafValues>
+            -5.1453977823257446e-01 3.1848269701004028e-01
+            1.4090469479560852e-01 -1.8669110536575317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1086 -5.4818098433315754e-03 -1 2 1087
+            -6.0164718888700008e-04 -2 -3 1088 9.9322739988565445e-03</internalNodes>
+          <leafValues>
+            1.9321410357952118e-01 -3.8167670369148254e-01
+            -5.8519419282674789e-02 4.8970058560371399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1089 1.4053160557523370e-03 0 -1 1090
+            5.2271760068833828e-03 -2 -3 1091 -1.4931050129234791e-02</internalNodes>
+          <leafValues>
+            2.5072118639945984e-01 -6.5754747390747070e-01
+            5.5669851601123810e-02 -2.4669079482555389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1092 -1.2826359830796719e-02 0 -1 1093
+            -2.7587350457906723e-02 -2 -3 1094 -4.7543710097670555e-03</internalNodes>
+          <leafValues>
+            -3.2225701212882996e-01 5.6484752893447876e-01
+            -4.9142929911613464e-01 -8.8634714484214783e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1095 -2.7212230488657951e-03 2 -1 1096
+            6.6132671199738979e-03 -2 -3 1097 -1.1435840278863907e-02</internalNodes>
+          <leafValues>
+            -5.7900500297546387e-01 4.5554360747337341e-01
+            1.5250509977340698e-01 -1.2167599797248840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1098 -1.9095990806818008e-02 2 -1 1099
+            -1.2672290205955505e-01 -2 -3 1100 -1.8373519182205200e-02</internalNodes>
+          <leafValues>
+            -4.4416400790214539e-01 1.1622429639101028e-01
+            4.1248679161071777e-01 -3.0303838849067688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1101 -3.2425698637962341e-01 -1 2 1102
+            -3.8764779455959797e-03 -2 -3 1103 -7.5138150714337826e-04</internalNodes>
+          <leafValues>
+            4.4721060991287231e-01 7.5931303203105927e-02
+            1.1976880021393299e-02 -3.6275759339332581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1104 6.7106341011822224e-03 -1 2 1105
+            -6.5366760827600956e-03 -2 -3 1106 -5.5684632388874888e-04</internalNodes>
+          <leafValues>
+            -3.9521178603172302e-01 -3.0311599373817444e-01
+            -1.5832960605621338e-01 1.7123879492282867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1107 -3.9269351400434971e-03 -1 2 1108
+            -1.6322469338774681e-02 -2 -3 1109 5.5038761347532272e-02</internalNodes>
+          <leafValues>
+            2.0034509897232056e-01 4.1271069645881653e-01
+            -1.7926050722599030e-01 2.6303529739379883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1110 1.0095089673995972e-03 0 -1 1111
+            -9.8581332713365555e-03 -2 -3 1112 -7.0780781097710133e-03</internalNodes>
+          <leafValues>
+            2.4884219467639923e-01 -3.9200861006975174e-02
+            3.7243181467056274e-01 -3.7739849090576172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1113 2.1169960964471102e-03 2 -1 1114
+            1.5883900225162506e-01 -2 -3 1115 -4.2488988488912582e-02</internalNodes>
+          <leafValues>
+            1.7665450274944305e-01 7.2631222009658813e-01
+            4.8568719625473022e-01 -1.4427030086517334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1116 -9.4166352937463671e-05 -1 2 1117
+            8.1764090282376856e-05 -2 -3 1118 5.4165818728506565e-03</internalNodes>
+          <leafValues>
+            1.7045879364013672e-01 -3.1940829753875732e-01
+            9.9846661090850830e-02 -4.1059550642967224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1119 -6.1865211464464664e-03 2 -1 1120
+            6.5089072450064123e-05 -2 -3 1121 -6.8352972448337823e-05</internalNodes>
+          <leafValues>
+            -3.8492518663406372e-01 1.6319459676742554e-01
+            2.1182140707969666e-01 -2.5311520695686340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1122 -4.0968839311972260e-04 0 -1 1123
+            3.5239830613136292e-03 -2 -3 1124 -8.3400387666188180e-05</internalNodes>
+          <leafValues>
+            -1.1859580129384995e-01 -7.9780608415603638e-01
+            2.2940699756145477e-01 -3.8782458752393723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1125 -2.7096238918602467e-03 0 -1 1126
+            -6.8883160129189491e-03 -2 -3 1127 1.1571759823709726e-03</internalNodes>
+          <leafValues>
+            -5.9978920221328735e-01 3.4748208522796631e-01
+            -1.5406990051269531e-01 1.3573920726776123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1128 9.5913361292332411e-04 -1 2 1129
+            -1.8333569169044495e-02 -2 -3 1130 2.4258090183138847e-02</internalNodes>
+          <leafValues>
+            -1.0236030071973801e-01 -5.5400210618972778e-01
+            1.4270070195198059e-01 7.2077578306198120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1131 1.0541410185396671e-02 0 -1 1132
+            9.1231325641274452e-03 -2 -3 1133 -1.4598550042137504e-03</internalNodes>
+          <leafValues>
+            1.9214800000190735e-01 -3.6190611124038696e-01
+            2.8950750827789307e-01 -1.8767410516738892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1134 -1.1819070205092430e-02 -1 2 1135
+            -3.2446000725030899e-02 -2 -3 1136 -2.3319718893617392e-03</internalNodes>
+          <leafValues>
+            -5.3653758764266968e-01 -6.8713748455047607e-01
+            -8.8751368224620819e-02 1.5991990268230438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1137 -6.5151029266417027e-03 0 -1 1138
+            2.5015550199896097e-03 -2 -3 1139 7.8799802577123046e-04</internalNodes>
+          <leafValues>
+            6.8285889923572540e-02 5.7962691783905029e-01
+            -1.9128720462322235e-01 9.7289860248565674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1140 6.0783070512115955e-03 -1 2 1141
+            -8.7201576679944992e-03 -2 -3 1142 3.5847601247951388e-04</internalNodes>
+          <leafValues>
+            -6.1147671937942505e-01 4.7648158669471741e-01
+            9.0117119252681732e-02 -1.6770669817924500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1143 -1.3178629800677299e-02 -1 2 1144
+            -8.5365071892738342e-02 -2 -3 1145 3.3002009149640799e-03</internalNodes>
+          <leafValues>
+            -1.2755720317363739e-01 2.6924338936805725e-01
+            -1.8480269610881805e-01 5.8760780096054077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1146 -1.1601460166275501e-02 2 -1 1147
+            9.9076535552740097e-03 -2 -3 1148 4.3782261200249195e-03</internalNodes>
+          <leafValues>
+            3.3849120140075684e-01 -5.5809050798416138e-01
+            -7.8933097422122955e-02 2.2385579347610474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1149 -4.7082178294658661e-02 -1 2 1150
+            -3.2685339101590216e-04 -2 -3 1151 7.8715756535530090e-03</internalNodes>
+          <leafValues>
+            6.8917119503021240e-01 1.2139579653739929e-01
+            -7.5880296528339386e-02 -6.5191179513931274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1152 -3.9275310700759292e-04 0 -1 1153
+            -3.4211258753202856e-04 -2 -3 1154 5.6030962150543928e-04</internalNodes>
+          <leafValues>
+            -3.4082669019699097e-01 3.7230521440505981e-01
+            1.8275870010256767e-02 -2.7192598581314087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1155 -2.4439349770545959e-02 -1 2 1156
+            1.2128120288252831e-02 -2 -3 1157 2.2948130499571562e-03</internalNodes>
+          <leafValues>
+            -3.4894740581512451e-01 -4.1957078501582146e-03
+            -2.0841300487518311e-02 8.0151557922363281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1158 -3.6386020947247744e-03 0 -1 1159
+            -6.3949287869036198e-04 -2 -3 1160 2.0897389913443476e-04</internalNodes>
+          <leafValues>
+            -2.5389778614044189e-01 3.6606290936470032e-01
+            -1.4177979528903961e-01 1.4148280024528503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1161 -6.7888460762333125e-05 0 -1 1162
+            3.9580671000294387e-04 -2 -3 1163 1.2493260437622666e-03</internalNodes>
+          <leafValues>
+            -2.0807999372482300e-01 2.3690980672836304e-01
+            2.4679720401763916e-01 -2.2032499313354492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1164 -4.6679278602823615e-04 -1 2 1165
+            1.1740219779312611e-03 -2 -3 1166 -7.1949949488043785e-03</internalNodes>
+          <leafValues>
+            -3.3990928530693054e-01 1.2153220176696777e-01
+            3.3542940020561218e-01 -3.9178979396820068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1167 3.2422799267806113e-04 2 -1 1168
+            2.4374879896640778e-02 -2 -3 1169 2.6271429378539324e-03</internalNodes>
+          <leafValues>
+            -2.5593858957290649e-01 4.2434880137443542e-01
+            1.0237640142440796e-01 -2.6907420158386230e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>32</maxWeakCount>
+      <stageThreshold>-1.2001949548721313e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 1170 -1.8586540594696999e-02 -1 2 1171
+            -7.4109081178903580e-03 -2 -3 1172 -5.3711149841547012e-02</internalNodes>
+          <leafValues>
+            -3.6523258686065674e-01 7.7427452802658081e-01
+            2.4213680624961853e-01 -3.7803840637207031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1173 6.9198510609567165e-03 0 -1 1174
+            -3.0759189277887344e-02 -2 -3 1175 -8.9597534388303757e-03</internalNodes>
+          <leafValues>
+            1.3523690402507782e-01 -2.7957341074943542e-01
+            -6.0680317878723145e-01 6.9579082727432251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1176 7.1816287934780121e-02 2 -1 1177
+            -1.1622999794781208e-02 -2 -3 1178 -1.0627550072968006e-03</internalNodes>
+          <leafValues>
+            3.0647501349449158e-01 -2.2690390050411224e-01
+            4.4374391436576843e-01 -3.1824579834938049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1179 -7.3452957440167665e-04 -1 2 1180
+            -4.9303710460662842e-02 -2 -3 1181 -3.2011170405894518e-03</internalNodes>
+          <leafValues>
+            -2.2684609889984131e-01 3.4253200888633728e-01
+            3.0913218855857849e-01 -2.0078240334987640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1182 1.4706649817526340e-02 0 -1 1183
+            -1.1798519641160965e-01 -2 -3 1184 -1.6695359721779823e-02</internalNodes>
+          <leafValues>
+            -9.4517791271209717e-01 5.7428210973739624e-01
+            2.4567030370235443e-01 -1.1707650125026703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1185 -6.8853241391479969e-03 0 -1 1186
+            7.8145717270672321e-04 -2 -3 1187 2.7586790919303894e-01</internalNodes>
+          <leafValues>
+            3.9508721232414246e-01 -1.0023059695959091e-01
+            -1.4659850299358368e-01 7.7942031621932983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1188 -2.6423679664731026e-02 -1 2 1189
+            1.8955089617520571e-03 -2 -3 1190 -5.7396688498556614e-03</internalNodes>
+          <leafValues>
+            -3.2860249280929565e-01 1.5046370029449463e-01
+            -4.0492990612983704e-01 1.5257360041141510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1191 -7.8677870333194733e-03 -1 2 1192
+            -1.9029570103157312e-04 -2 -3 1193 2.9406580142676830e-04</internalNodes>
+          <leafValues>
+            2.2024929523468018e-01 -3.7222158908843994e-01
+            1.0350369662046432e-01 -3.6075070500373840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1194 -6.1921158339828253e-04 0 -1 1195
+            -4.6625699847936630e-02 -2 -3 1196 8.0430079833604395e-05</internalNodes>
+          <leafValues>
+            2.5249621272087097e-01 -3.2340309023857117e-01
+            -8.7712243199348450e-02 2.5224068760871887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1197 2.9532159678637981e-03 -1 2 1198
+            -4.5338911004364491e-03 -2 -3 1199 -1.1544080451130867e-02</internalNodes>
+          <leafValues>
+            4.8171079158782959e-01 -4.5188549160957336e-01
+            2.5434678792953491e-01 -8.4140419960021973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1200 1.3043760554865003e-03 -1 2 1201
+            -3.4115801099687815e-03 -2 -3 1202 -1.5855060191825032e-03</internalNodes>
+          <leafValues>
+            -1.0121349990367889e-01 5.2193498611450195e-01
+            6.8923211097717285e-01 -1.0570000112056732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1203 -2.9867749661207199e-02 2 -1 1204
+            -2.5652049225755036e-04 -2 -3 1205 -3.9234450086951256e-03</internalNodes>
+          <leafValues>
+            -4.3362548947334290e-01 -3.3430889248847961e-02
+            -2.5569188594818115e-01 4.4265130162239075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1206 4.6491571702063084e-03 -1 2 1207
+            -2.7727609872817993e-01 -2 -3 1208 -2.2448340058326721e-01</internalNodes>
+          <leafValues>
+            6.2878167629241943e-01 7.1006447076797485e-01
+            3.0520048737525940e-01 -9.2947281897068024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1209 3.8704689592123032e-02 0 -1 1210
+            8.2667707465589046e-04 -2 -3 1211 3.5339579335413873e-04</internalNodes>
+          <leafValues>
+            -7.1300238370895386e-01 3.4036791324615479e-01
+            -2.7960309386253357e-01 4.1289128363132477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1212 1.2603959999978542e-02 0 -1 1213
+            -5.5078358855098486e-05 -2 -3 1214 9.1213081032037735e-03</internalNodes>
+          <leafValues>
+            6.5844729542732239e-02 -2.0295199751853943e-01
+            5.0578397512435913e-01 -2.8807151317596436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1215 -4.0084728971123695e-03 2 -1 1216
+            4.4780140742659569e-03 -2 -3 1217 -4.7284600441344082e-04</internalNodes>
+          <leafValues>
+            2.1491059660911560e-01 2.1849650144577026e-01
+            -6.7471832036972046e-01 -1.0888069868087769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1218 -3.7310249172151089e-04 -1 2 1219
+            -1.0922510176897049e-02 -2 -3 1220 2.5496890768408775e-02</internalNodes>
+          <leafValues>
+            1.7151309549808502e-01 4.2335990071296692e-01
+            -2.3464329540729523e-01 1.9871939718723297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1221 7.0709688588976860e-03 -1 2 1222
+            3.5252509405836463e-04 -2 -3 1223 5.8937398716807365e-04</internalNodes>
+          <leafValues>
+            -4.3551680445671082e-01 -6.1764400452375412e-02
+            -7.9512260854244232e-02 4.0493848919868469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1224 -8.7519101798534393e-03 0 -1 1225
+            -9.4158039428293705e-04 -2 -3 1226 -8.8366247713565826e-02</internalNodes>
+          <leafValues>
+            7.1111567318439484e-02 -3.1814581155776978e-01
+            -5.9796679019927979e-01 1.9428940117359161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1227 4.5438520610332489e-03 0 -1 1228
+            -1.3041470199823380e-02 -2 -3 1229 3.2197220716625452e-03</internalNodes>
+          <leafValues>
+            -2.1855579316616058e-01 3.0563870072364807e-01
+            -1.9010399281978607e-01 1.8796740472316742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1230 3.2370660454034805e-02 2 -1 1231
+            8.7954197078943253e-03 -2 -3 1232 -8.5182236507534981e-03</internalNodes>
+          <leafValues>
+            -1.6135400533676147e-01 6.6259282827377319e-01
+            -3.8733869791030884e-01 1.3088770210742950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1233 -5.4210029542446136e-02 0 -1 1234
+            2.9004408861510456e-04 -2 -3 1235 -1.2670000083744526e-02</internalNodes>
+          <leafValues>
+            -1.8559680320322514e-03 5.0099188089370728e-01
+            2.9727068543434143e-01 -1.6530840098857880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1236 3.7995529174804688e-01 -1 2 1237
+            -4.8071850091218948e-02 -2 -3 1238 6.4968131482601166e-03</internalNodes>
+          <leafValues>
+            4.2289760708808899e-01 1.1011490225791931e-01
+            -2.6050418615341187e-01 1.7244240641593933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1239 -2.0901230163872242e-03 -1 2 1240
+            -6.2400829046964645e-03 -2 -3 1241 8.5770338773727417e-03</internalNodes>
+          <leafValues>
+            -1.4854459464550018e-01 3.5841208696365356e-01
+            -2.1481679379940033e-01 2.1504589915275574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1242 -6.6754068247973919e-03 0 -1 1243
+            -3.8183759897947311e-03 -2 -3 1244 5.5124791106209159e-04</internalNodes>
+          <leafValues>
+            -2.3905350267887115e-01 4.4719010591506958e-01
+            -2.5307258963584900e-01 3.4307420253753662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1245 9.0955598279833794e-03 0 -1 1246
+            1.1171290278434753e-01 -2 -3 1247 -1.7274810234084725e-03</internalNodes>
+          <leafValues>
+            -6.5154308080673218e-01 -2.6602389290928841e-02
+            6.1791652441024780e-01 2.7143610641360283e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1248 7.5292278779670596e-04 0 -1 1249
+            -3.1208951259031892e-04 -2 -3 1250 1.3574779732152820e-03</internalNodes>
+          <leafValues>
+            -5.5061008781194687e-02 2.7939450740814209e-01
+            -2.9496839642524719e-01 2.3769420385360718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1251 2.6001129299402237e-02 2 -1 1252
+            -5.1486152224242687e-03 -2 -3 1253 -4.1137751191854477e-02</internalNodes>
+          <leafValues>
+            4.8369780182838440e-01 -1.4562819898128510e-01
+            -4.8423030972480774e-01 1.9624310731887817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1254 1.2921179644763470e-02 2 -1 1255
+            2.9845361132174730e-03 -2 -3 1256 1.2732800096273422e-02</internalNodes>
+          <leafValues>
+            6.0538208484649658e-01 -4.6820640563964844e-01
+            -2.9540339484810829e-02 3.6185088753700256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1257 -1.0869900143006817e-04 -1 2 1258
+            -8.9501799084246159e-04 -2 -3 1259 5.3637558594346046e-03</internalNodes>
+          <leafValues>
+            1.6606490314006805e-01 3.5517621785402298e-02
+            -3.5981449484825134e-01 4.2224168777465820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1260 1.4909369871020317e-02 -1 2 1261
+            -1.0603530099615455e-03 -2 -3 1262 -3.6916081444360316e-04</internalNodes>
+          <leafValues>
+            -6.6308712959289551e-01 -3.8903519511222839e-01
+            -1.1299440264701843e-01 1.6010889410972595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1263 -3.8595579098910093e-04 2 -1 1264
+            5.9791578678414226e-04 -2 -3 1265 1.0427299886941910e-02</internalNodes>
+          <leafValues>
+            1.9961580634117126e-01 -2.5480431318283081e-01
+            1.0820420086383820e-01 -5.4060971736907959e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>41</maxWeakCount>
+      <stageThreshold>-1.2273980379104614e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1266 8.5305199027061462e-03 2 -1 1267
+            -7.0295208133757114e-03 -2 -3 1268 1.1181459762156010e-02</internalNodes>
+          <leafValues>
+            -2.3412899672985077e-01 -1.3273300230503082e-01
+            -1.0306409746408463e-01 8.1993848085403442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1269 -3.3347710967063904e-02 2 -1 1270
+            -5.7895448990166187e-03 -2 -3 1271 7.5207999907433987e-03</internalNodes>
+          <leafValues>
+            -2.0504109561443329e-01 -7.2138823568820953e-02
+            9.2525452375411987e-02 6.4616191387176514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1272 5.1975441165268421e-03 2 -1 1273
+            2.7103458996862173e-03 -2 -3 1274 -5.8099921792745590e-02</internalNodes>
+          <leafValues>
+            -3.6144751310348511e-01 -3.4319791197776794e-01
+            3.2151529192924500e-01 -3.0232580378651619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1275 4.1742541361600161e-04 0 -1 1276
+            5.8975181309506297e-04 -2 -3 1277 1.3578129932284355e-02</internalNodes>
+          <leafValues>
+            -2.6612699031829834e-01 1.4442689716815948e-01
+            3.6293990910053253e-02 4.4277408719062805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1278 -3.9278618060052395e-03 -1 2 1279
+            -1.6465460881590843e-02 -2 -3 1280 -9.0516731142997742e-03</internalNodes>
+          <leafValues>
+            -4.2203828692436218e-01 -5.7036012411117554e-01
+            -2.4343970417976379e-01 1.2901119887828827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1281 -4.0202909149229527e-03 -1 2 1282
+            1.9786891061812639e-03 -2 -3 1283 -2.1167920902371407e-02</internalNodes>
+          <leafValues>
+            3.0336159467697144e-01 -1.1887379735708237e-01
+            -5.3209340572357178e-01 3.7618291378021240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1284 -1.3314959593117237e-02 2 -1 1285
+            -3.0734280124306679e-02 -2 -3 1286 -4.9376720190048218e-01</internalNodes>
+          <leafValues>
+            -4.7728979587554932e-01 -1.0171979665756226e-01
+            -4.9745380878448486e-01 1.9965989887714386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1287 -2.2439099848270416e-03 -1 2 1288
+            -4.3283861130475998e-02 -2 -3 1289 -9.8785851150751114e-05</internalNodes>
+          <leafValues>
+            -1.0817500203847885e-01 6.4580261707305908e-01
+            2.6985371112823486e-01 -1.5044610202312469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1290 2.8435129672288895e-02 -1 2 1291
+            2.7237860485911369e-03 -2 -3 1292 -4.7562850522808731e-04</internalNodes>
+          <leafValues>
+            2.9883900284767151e-01 -1.8797110021114349e-01
+            2.8433099389076233e-01 -1.2085639685392380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1293 3.8944541011005640e-03 2 -1 1294
+            4.3390938080847263e-03 -2 -3 1295 -2.0263839513063431e-02</internalNodes>
+          <leafValues>
+            -2.7473360300064087e-01 -3.7163880467414856e-01
+            -3.5409209132194519e-01 1.3197909295558929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1296 -5.5432569235563278e-02 2 -1 1297
+            5.4974798113107681e-03 -2 -3 1298 -4.8123318701982498e-03</internalNodes>
+          <leafValues>
+            -6.3836967945098877e-01 2.4118340015411377e-01
+            1.2418109923601151e-01 -1.8538869917392731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1299 1.4174300013110042e-03 0 -1 1300
+            -3.3114890102297068e-03 -2 -3 1301 -9.4083733856678009e-03</internalNodes>
+          <leafValues>
+            1.0947279632091522e-01 -3.1438231468200684e-01
+            -5.0812500715255737e-01 1.2708969414234161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1302 1.6073260456323624e-02 -1 2 1303
+            -3.9989468641579151e-03 -2 -3 1304 1.0122359963133931e-03</internalNodes>
+          <leafValues>
+            -3.2891270518302917e-01 2.3349060118198395e-01
+            -1.7827099561691284e-01 1.6806240379810333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1305 1.5654880553483963e-02 2 -1 1306
+            1.3416170142591000e-02 -2 -3 1307 2.4865430314093828e-03</internalNodes>
+          <leafValues>
+            6.6142809391021729e-01 -5.6725960969924927e-01
+            7.0396818220615387e-02 -2.1695409715175629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1308 -4.5016291551291943e-03 -1 2 1309
+            -2.0310489460825920e-02 -2 -3 1310 2.0448309369385242e-03</internalNodes>
+          <leafValues>
+            -2.9001921415328979e-01 -5.5471527576446533e-01
+            -7.5903441756963730e-03 3.0112549662590027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1311 3.3151761163026094e-03 0 -1 1312
+            -1.1767409741878510e-02 -2 -3 1313 -9.0457782149314880e-02</internalNodes>
+          <leafValues>
+            -6.5939038991928101e-01 1.9516299664974213e-01
+            2.3783689737319946e-01 -1.6133689880371094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1314 -9.4386242562904954e-04 -1 2 1315
+            -5.5300429463386536e-02 -2 -3 1316 1.8430839991196990e-03</internalNodes>
+          <leafValues>
+            2.0265130698680878e-01 1.3218100368976593e-01
+            -8.5232466459274292e-02 -5.0634711980819702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1317 -4.4628758914768696e-03 0 -1 1318
+            9.7493419889360666e-04 -2 -3 1319 -3.1454759300686419e-04</internalNodes>
+          <leafValues>
+            -2.7136290073394775e-01 1.5943349897861481e-01
+            2.7965110540390015e-01 -3.2671060413122177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1320 -1.6447799280285835e-02 0 -1 1321
+            2.3777380585670471e-02 -2 -3 1322 2.8008338995277882e-03</internalNodes>
+          <leafValues>
+            -4.1435249149799347e-03 3.5191389918327332e-01
+            -2.2791029512882233e-01 1.8853689730167389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1323 1.7503320123068988e-04 -1 2 1324
+            1.3492659491021186e-04 -2 -3 1325 4.8691541451262310e-05</internalNodes>
+          <leafValues>
+            -2.1376720070838928e-01 -1.3506560027599335e-01
+            -2.7009880542755127e-01 3.2778948545455933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1326 2.4542049504816532e-03 -1 2 1327
+            -2.3232260718941689e-02 -2 -3 1328 5.2798539400100708e-03</internalNodes>
+          <leafValues>
+            2.6363280415534973e-01 -3.8305589556694031e-01
+            -7.7942140400409698e-02 2.4021050333976746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1329 7.0398352108895779e-03 2 -1 1330
+            4.0894638746976852e-02 -2 -3 1331 -7.9772479832172394e-02</internalNodes>
+          <leafValues>
+            2.0972409844398499e-01 -7.0987868309020996e-01
+            5.7007771730422974e-01 -6.9354712963104248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1332 6.4237392507493496e-04 -1 2 1333
+            1.8864229787141085e-03 -2 -3 1334 -2.5151949375867844e-03</internalNodes>
+          <leafValues>
+            -4.0321418642997742e-01 8.4503486752510071e-02
+            7.3963850736618042e-01 -3.7004008889198303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1335 9.2179048806428909e-04 0 -1 1336
+            -6.6281789913773537e-03 -2 -3 1337 -1.2447969987988472e-02</internalNodes>
+          <leafValues>
+            2.4241310358047485e-01 -2.5563749670982361e-01
+            4.5645469427108765e-01 3.5875100642442703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1338 9.8073864355683327e-03 2 -1 1339
+            1.1752230115234852e-02 -2 -3 1340 -4.5835418859496713e-04</internalNodes>
+          <leafValues>
+            -3.5728690028190613e-01 2.2477920353412628e-01
+            9.2636883258819580e-02 -2.2759440541267395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1341 1.2521909549832344e-02 2 -1 1342
+            5.4397471249103546e-03 -2 -3 1343 -5.8840587735176086e-04</internalNodes>
+          <leafValues>
+            -5.0926029682159424e-01 4.6630910038948059e-01
+            -2.5326851010322571e-01 4.8585399985313416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1344 -8.6136013269424438e-03 2 -1 1345
+            4.8513390356674790e-04 -2 -3 1346 -5.7645072229206562e-04</internalNodes>
+          <leafValues>
+            -4.6801608800888062e-01 1.5412229299545288e-01
+            3.3526080846786499e-01 -1.3425140082836151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1347 1.5327259898185730e-03 2 -1 1348
+            1.6712940123397857e-04 -2 -3 1349 5.0148408627137542e-04</internalNodes>
+          <leafValues>
+            -8.4655933082103729e-02 -2.9512628912925720e-01
+            4.4228151440620422e-01 7.0311659947037697e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1350 -7.2751182597130537e-04 2 -1 1351
+            1.6298179980367422e-03 -2 -3 1352 -6.5518761985003948e-03</internalNodes>
+          <leafValues>
+            3.6965361237525940e-01 -3.1909099221229553e-01
+            -5.0437092781066895e-01 4.8704870045185089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1353 -1.8271349370479584e-02 2 -1 1354
+            -3.1057938933372498e-01 -2 -3 1355 8.6849008221179247e-04</internalNodes>
+          <leafValues>
+            2.6778510212898254e-01 -1.5646959841251373e-01
+            2.2130140662193298e-01 -2.3309649527072906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1356 -1.0790280066430569e-02 2 -1 1357
+            -6.7156221484765410e-04 -2 -3 1358 7.9050064086914062e-03</internalNodes>
+          <leafValues>
+            -4.1554379463195801e-01 -8.0280020833015442e-02
+            1.7470720410346985e-01 -7.7852571010589600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1359 1.2352660298347473e-02 0 -1 1360
+            6.2703549861907959e-02 -2 -3 1361 -7.1864388883113861e-03</internalNodes>
+          <leafValues>
+            4.3160900473594666e-01 -3.9224869012832642e-01
+            -5.8003968000411987e-01 -2.5838220492005348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1362 -3.8558109663426876e-03 -1 2 1363
+            -1.5419459668919444e-03 -2 -3 1364 -2.2120370995253325e-03</internalNodes>
+          <leafValues>
+            1.5963500738143921e-01 1.6741840541362762e-01
+            2.9176110401749611e-02 -2.8822419047355652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1365 -2.1434590220451355e-02 2 -1 1366
+            -1.9107710104435682e-03 -2 -3 1367 3.5804428160190582e-02</internalNodes>
+          <leafValues>
+            -2.2613149881362915e-01 1.0307289659976959e-01
+            7.5381852686405182e-02 -6.3267099857330322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1368 1.4067400479689240e-03 -1 2 1369
+            9.6554737538099289e-03 -2 -3 1370 2.4058830738067627e-01</internalNodes>
+          <leafValues>
+            3.7057319283485413e-01 -2.0454670488834381e-01
+            2.0735639333724976e-01 -1.2661419808864594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1371 5.2541731856763363e-03 -1 2 1372
+            -1.1480560060590506e-03 -2 -3 1373 5.2387482719495893e-04</internalNodes>
+          <leafValues>
+            -2.3812450468540192e-01 -1.8807569518685341e-02
+            5.8435738086700439e-01 -7.0002108812332153e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1374 8.9346221648156643e-04 -1 2 1375
+            -1.4664779603481293e-01 -2 -3 1376 6.4734317129477859e-04</internalNodes>
+          <leafValues>
+            -2.0343719422817230e-01 4.2429131269454956e-01
+            -7.2510123252868652e-02 2.4216009676456451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1377 3.7285720463842154e-03 2 -1 1378
+            1.0364309855503961e-04 -2 -3 1379 -4.3523311614990234e-03</internalNodes>
+          <leafValues>
+            -4.1690871119499207e-01 1.7091989517211914e-01
+            3.1368499994277954e-01 -1.3387750089168549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1380 -8.2644030451774597e-02 0 -1 1381
+            -8.3868228830397129e-04 -2 -3 1382 -2.6123419404029846e-02</internalNodes>
+          <leafValues>
+            6.7182201147079468e-01 -4.5429998636245728e-01
+            2.1897830069065094e-01 -3.2377090305089951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1383 5.2059517474845052e-04 0 -1 1384
+            -2.9154460877180099e-02 -2 -3 1385 -1.1165169999003410e-03</internalNodes>
+          <leafValues>
+            -3.6328500509262085e-01 1.6834139823913574e-01
+            1.5818840265274048e-01 -2.3134049773216248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1386 -1.1460180394351482e-03 2 -1 1387
+            2.0873030647635460e-02 -2 -3 1388 4.0476579219102859e-02</internalNodes>
+          <leafValues>
+            -1.2237170338630676e-01 4.0715441107749939e-01
+            -4.8719130456447601e-02 6.1359512805938721e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>42</maxWeakCount>
+      <stageThreshold>-1.1990439891815186e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 1389 2.3152550682425499e-02 0 -1 1390
+            9.4490228220820427e-03 -2 -3 1391 1.2632790021598339e-03</internalNodes>
+          <leafValues>
+            1.6217540204524994e-01 8.9458537101745605e-01
+            -2.9920589923858643e-01 2.4114310741424561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1392 -6.3288196921348572e-02 0 -1 1393
+            -5.4630772210657597e-03 -2 -3 1394 -5.3964817197993398e-04</internalNodes>
+          <leafValues>
+            5.8726388216018677e-01 2.8670629486441612e-02
+            2.1043429151177406e-02 -3.3096361160278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1395 -4.3574950098991394e-01 -1 2 1396
+            -2.2997299674898386e-03 -2 -3 1397 2.8589849825948477e-03</internalNodes>
+          <leafValues>
+            2.9235550761222839e-01 1.0574100166559219e-01
+            -3.3370551466941833e-01 1.6990379989147186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1398 -2.1891849115490913e-02 -1 2 1399
+            -9.2662516981363297e-03 -2 -3 1400 -1.6625279560685158e-02</internalNodes>
+          <leafValues>
+            -6.2861520051956177e-01 -4.3969720602035522e-01
+            4.0394479036331177e-01 1.1343320365995169e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1401 2.4849560577422380e-03 0 -1 1402
+            -1.8093220889568329e-02 -2 -3 1403 -1.5609259717166424e-02</internalNodes>
+          <leafValues>
+            -1.5912850201129913e-01 4.4538548588752747e-01
+            6.9278262555599213e-02 -2.2655999660491943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1404 -4.3753669597208500e-03 -1 2 1405
+            -1.3602689432445914e-04 -2 -3 1406 3.8207470788620412e-04</internalNodes>
+          <leafValues>
+            -7.1104782819747925e-01 -1.6582900285720825e-01
+            2.1408109366893768e-01 -1.2310829758644104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1407 -5.7698809541761875e-03 -1 2 1408
+            -6.5253339707851410e-03 -2 -3 1409 -8.3149597048759460e-02</internalNodes>
+          <leafValues>
+            2.5808620452880859e-01 2.0068170130252838e-01
+            -6.4005237817764282e-01 -9.6292853355407715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1410 -1.7492580227553844e-03 -1 2 1411
+            -3.5885178949683905e-03 -2 -3 1412 2.8363720048218966e-03</internalNodes>
+          <leafValues>
+            -2.7996930480003357e-01 -4.2557060718536377e-01
+            1.7105630040168762e-01 -1.1548189818859100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1413 3.7369329947978258e-03 0 -1 1414
+            2.0398290827870369e-02 -2 -3 1415 -1.8605329096317291e-02</internalNodes>
+          <leafValues>
+            7.5142003595829010e-02 7.1449148654937744e-01
+            6.6745537519454956e-01 -1.3011719286441803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1416 1.2047400232404470e-03 -1 2 1417
+            -4.1799237951636314e-03 -2 -3 1418 5.3556780330836773e-03</internalNodes>
+          <leafValues>
+            1.9936279952526093e-01 2.0625339448451996e-01
+            -2.1847389638423920e-01 3.9184600114822388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1419 -2.3561089765280485e-03 0 -1 1420
+            -5.9740748256444931e-02 -2 -3 1421 1.4918210217729211e-03</internalNodes>
+          <leafValues>
+            6.4951920509338379e-01 -2.6147049665451050e-01
+            1.1800879985094070e-01 -3.6518579721450806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1422 -2.6466009020805359e-01 -1 2 1423
+            -6.3644978217780590e-04 -2 -3 1424 -1.0798840224742889e-01</internalNodes>
+          <leafValues>
+            -4.7007301449775696e-01 1.5393650531768799e-01
+            2.8167989850044250e-01 -1.9636960327625275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1425 -3.6950930370949209e-04 -1 2 1426
+            -7.9222144559025764e-03 -2 -3 1427 -7.1997018530964851e-03</internalNodes>
+          <leafValues>
+            -2.5694531202316284e-01 -3.6089059710502625e-01
+            2.1187220513820648e-01 -6.0304410755634308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1428 2.7865950018167496e-02 -1 2 1429
+            1.0313779785064980e-04 -2 -3 1430 9.8026450723409653e-04</internalNodes>
+          <leafValues>
+            2.7542260289192200e-01 -2.1113120019435883e-01
+            1.2969830632209778e-01 -3.5925969481468201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1431 1.0869160294532776e-02 2 -1 1432
+            1.9162669777870178e-03 -2 -3 1433 -6.9466588320210576e-04</internalNodes>
+          <leafValues>
+            -2.8709220886230469e-01 1.9223760068416595e-01
+            2.6802310347557068e-01 -1.5893469750881195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1434 -1.5737100038677454e-03 2 -1 1435
+            2.8489651158452034e-03 -2 -3 1436 1.2300360249355435e-03</internalNodes>
+          <leafValues>
+            4.8450559377670288e-01 1.4732420444488525e-01
+            -2.2078629583120346e-02 -3.5363599658012390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1437 -1.7871359596028924e-03 -1 2 1438
+            -7.5124297291040421e-04 -2 -3 1439 -1.5810869634151459e-02</internalNodes>
+          <leafValues>
+            1.5130859613418579e-01 -2.5845149159431458e-01
+            3.9024001359939575e-01 -8.3249032497406006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1440 -8.5817109793424606e-03 0 -1 1441
+            1.4925940334796906e-01 -2 -3 1442 5.0973348319530487e-02</internalNodes>
+          <leafValues>
+            6.5285183489322662e-02 -4.4836780428886414e-01
+            -5.9802252054214478e-01 7.6314812898635864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1443 -1.4699130551889539e-03 0 -1 1444
+            1.8571510445326567e-03 -2 -3 1445 2.7572319377213717e-03</internalNodes>
+          <leafValues>
+            -1.5857130289077759e-01 2.0623469352722168e-01
+            -1.5369700267910957e-02 3.5741418600082397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1446 -1.2494870461523533e-02 -1 2 1447
+            -2.0542230457067490e-02 -2 -3 1448 9.8408637568354607e-03</internalNodes>
+          <leafValues>
+            2.1646310389041901e-01 3.5183259844779968e-01
+            -2.5107988715171814e-01 2.4597419425845146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1449 7.5531061738729477e-03 2 -1 1450
+            8.6472760885953903e-03 -2 -3 1451 -2.3343270644545555e-02</internalNodes>
+          <leafValues>
+            -7.7170521020889282e-01 -2.6535108685493469e-01
+            -3.1102359294891357e-01 1.0751940310001373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1452 -2.3739689495414495e-03 2 -1 1453
+            4.5531010255217552e-03 -2 -3 1454 -1.7819739878177643e-02</internalNodes>
+          <leafValues>
+            2.4833559989929199e-01 1.2766610085964203e-01
+            -2.1538909524679184e-02 -3.3530569076538086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1455 -1.8217710778117180e-02 -1 2 1456
+            -4.5768721029162407e-03 -2 -3 1457 -1.8008370534516871e-04</internalNodes>
+          <leafValues>
+            -4.1915500164031982e-01 -4.3936538696289062e-01
+            -1.2697519361972809e-01 1.3539279997348785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1458 -7.6008588075637817e-03 2 -1 1459
+            4.5034091453999281e-04 -2 -3 1460 2.7170981047675014e-04</internalNodes>
+          <leafValues>
+            -3.3822789788246155e-01 3.1599909067153931e-01
+            -7.5660146772861481e-02 2.3075099289417267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1461 -5.9739891439676285e-02 2 -1 1462
+            -2.4159778840839863e-03 -2 -3 1463 7.5702499598264694e-03</internalNodes>
+          <leafValues>
+            -3.9958238601684570e-01 -2.9177419841289520e-02
+            3.6201998591423035e-01 -7.8775990009307861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1464 4.8360861837863922e-03 -1 2 1465
+            -1.9794749096035957e-02 -2 -3 1466 -5.3176241926848888e-03</internalNodes>
+          <leafValues>
+            -4.7984561324119568e-01 3.1721720099449158e-01
+            2.1971449255943298e-01 -8.5302233695983887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1467 3.5097550135105848e-03 0 -1 1468
+            -1.6063610091805458e-03 -2 -3 1469 1.8238229677081108e-03</internalNodes>
+          <leafValues>
+            3.4705808758735657e-01 -3.2198080420494080e-01
+            9.7573727369308472e-02 -4.1784769296646118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1470 2.2058039903640747e-03 0 -1 1471
+            2.5601179804652929e-03 -2 -3 1472 2.2490289993584156e-03</internalNodes>
+          <leafValues>
+            -2.9866018891334534e-01 3.2085859775543213e-01
+            1.0411229729652405e-01 -3.0941790342330933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1473 2.2417849395424128e-03 0 -1 1474
+            9.5781440904829651e-05 -2 -3 1475 -1.0199189931154251e-01</internalNodes>
+          <leafValues>
+            -1.9861190021038055e-01 8.0484487116336823e-02
+            -6.6573441028594971e-01 2.6545938849449158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1476 2.9278239235281944e-03 0 -1 1477
+            -2.3058110382407904e-03 -2 -3 1478 -3.5818710457533598e-03</internalNodes>
+          <leafValues>
+            4.6711549162864685e-01 -2.3293379694223404e-02
+            1.9756149500608444e-02 -2.5899839401245117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1479 4.8302081413567066e-03 0 -1 1480
+            -2.7483499143272638e-03 -2 -3 1481 -4.5970390783622861e-04</internalNodes>
+          <leafValues>
+            -3.6909970641136169e-01 2.9650568962097168e-01
+            1.0480040311813354e-01 -1.6184529662132263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1482 -1.0161349549889565e-02 0 -1 1483
+            3.2342320773750544e-03 -2 -3 1484 -1.1368689592927694e-03</internalNodes>
+          <leafValues>
+            -1.5523530542850494e-01 4.8816910386085510e-01
+            2.8159290552139282e-01 -6.2790401279926300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1485 1.1411249870434403e-03 2 -1 1486
+            2.8695389628410339e-03 -2 -3 1487 2.4731169641017914e-01</internalNodes>
+          <leafValues>
+            1.2081749737262726e-01 2.0992599427700043e-01
+            -2.4197529256343842e-01 6.4990550279617310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1488 2.7829511091113091e-03 0 -1 1489
+            -1.3701720163226128e-02 -2 -3 1490 4.8768401145935059e-02</internalNodes>
+          <leafValues>
+            4.5538169145584106e-01 -3.3847901225090027e-01
+            8.9688122272491455e-02 -3.1576380133628845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1491 1.7329800873994827e-02 2 -1 1492
+            1.4899630099534988e-02 -2 -3 1493 -5.4528238251805305e-03</internalNodes>
+          <leafValues>
+            4.2558190226554871e-01 6.1711931228637695e-01
+            -4.0939989686012268e-01 -1.5215449966490269e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1494 -4.6164509840309620e-03 2 -1 1495
+            2.2072680294513702e-03 -2 -3 1496 1.1780969798564911e-03</internalNodes>
+          <leafValues>
+            -3.5992878675460815e-01 2.0051500201225281e-01
+            -1.7710399627685547e-01 1.3283580541610718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1497 -2.1226529497653246e-04 0 -1 1498
+            6.6969380713999271e-03 -2 -3 1499 4.8628589138388634e-03</internalNodes>
+          <leafValues>
+            -1.4558829367160797e-01 3.0319228768348694e-01
+            2.1147659420967102e-01 -6.5050870180130005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1500 1.2855669483542442e-03 -1 2 1501
+            -9.8538002930581570e-04 -2 -3 1502 3.6161120515316725e-03</internalNodes>
+          <leafValues>
+            -1.4253799617290497e-01 -4.9302369356155396e-02
+            4.5496350526809692e-01 -1.2398339807987213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1503 7.4739390984177589e-03 2 -1 1504
+            1.4764349907636642e-02 -2 -3 1505 5.4328311234712601e-03</internalNodes>
+          <leafValues>
+            2.5631210207939148e-01 5.8572351932525635e-01
+            3.2529931515455246e-02 -2.2187189757823944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1506 -2.7086320915259421e-04 0 -1 1507
+            4.2132260277867317e-03 -2 -3 1508 1.9583420362323523e-04</internalNodes>
+          <leafValues>
+            2.6175120472908020e-01 -5.9540379047393799e-01
+            -1.9159470498561859e-01 9.1520026326179504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1509 -7.1442658081650734e-03 2 -1 1510
+            2.3744559439364821e-04 -2 -3 1511 -8.4380080807022750e-05</internalNodes>
+          <leafValues>
+            1.3012650609016418e-01 -3.8831448554992676e-01
+            2.1030910313129425e-01 -1.4587140083312988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1512 1.2161800265312195e-01 2 -1 1513
+            6.9275178248062730e-05 -2 -3 1514 -1.5904659405350685e-02</internalNodes>
+          <leafValues>
+            2.5583249330520630e-01 1.1272220313549042e-01
+            7.2112542390823364e-01 -1.9385160505771637e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>35</maxWeakCount>
+      <stageThreshold>-1.1545649766921997e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 1515 1.7899930477142334e-02 0 -1 1516
+            1.5925300540402532e-03 -2 -3 1517 1.8896949477493763e-03</internalNodes>
+          <leafValues>
+            4.6134639531373978e-02 8.3787131309509277e-01
+            -3.6899039149284363e-01 1.8707709386944771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1518 -4.1336648166179657e-02 -1 2 1519
+            -4.0737599134445190e-02 -2 -3 1520 -1.4306500088423491e-03</internalNodes>
+          <leafValues>
+            -1.9983500242233276e-01 5.5203098058700562e-01
+            -5.4083228111267090e-01 1.3183380663394928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1521 1.4656609855592251e-03 0 -1 1522
+            -1.3589359587058425e-03 -2 -3 1523 -1.5437849797308445e-03</internalNodes>
+          <leafValues>
+            1.7477029561996460e-01 -4.5285460352897644e-01
+            2.2154679894447327e-01 -1.1437030136585236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1524 6.6659757867455482e-03 0 -1 1525
+            -1.7080729594454169e-03 -2 -3 1526 -3.6050159484148026e-02</internalNodes>
+          <leafValues>
+            5.6135451793670654e-01 -7.5875748880207539e-03
+            6.9391137361526489e-01 -1.3373179733753204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1527 -7.1983798407018185e-03 -1 2 1528
+            -6.5796967828646302e-04 -2 -3 1529 -1.2115390272811055e-03</internalNodes>
+          <leafValues>
+            1.8855899572372437e-01 -4.7130081057548523e-01
+            1.9381099939346313e-01 -1.4709189534187317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1530 -1.0272770188748837e-02 2 -1 1531
+            -7.0025851018726826e-03 -2 -3 1532 -2.4933859705924988e-02</internalNodes>
+          <leafValues>
+            -4.1135069727897644e-01 -8.8177748024463654e-02
+            -6.3464301824569702e-01 2.5403091311454773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1533 7.7693387866020203e-03 0 -1 1534
+            -4.4885549694299698e-02 -2 -3 1535 1.9916899036616087e-03</internalNodes>
+          <leafValues>
+            -4.5445719361305237e-01 3.3884489536285400e-01
+            -5.3012330085039139e-02 -5.7269239425659180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1536 -1.4783450402319431e-02 2 -1 1537
+            1.1688449885696173e-03 -2 -3 1538 -1.2033269740641117e-04</internalNodes>
+          <leafValues>
+            3.7365919351577759e-01 -3.0164909362792969e-01
+            1.4958509802818298e-01 -1.4014390110969543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1539 -4.3730039149522781e-02 -1 2 1540
+            -1.7855180427432060e-02 -2 -3 1541 8.3651271415874362e-04</internalNodes>
+          <leafValues>
+            -7.0078557729721069e-01 8.0032449960708618e-01
+            7.8825756907463074e-02 -2.0352110266685486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1542 -6.6671593231149018e-05 0 -1 1543
+            -9.8805947345681489e-05 -2 -3 1544 -2.7336759376339614e-04</internalNodes>
+          <leafValues>
+            -3.7201121449470520e-01 1.3640309683978558e-02
+            -1.6216109693050385e-01 2.6113900542259216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1545 4.2468630708754063e-03 2 -1 1546
+            -4.9197040498256683e-03 -2 -3 1547 -1.4116670005023479e-02</internalNodes>
+          <leafValues>
+            2.8842711448669434e-01 -1.0787279903888702e-01
+            -7.0104539394378662e-01 3.3659279346466064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1548 -4.4507419806905091e-04 0 -1 1549
+            -1.2075440026819706e-02 -2 -3 1550 -2.3437689524143934e-03</internalNodes>
+          <leafValues>
+            -7.0987367630004883e-01 1.5176150202751160e-01
+            -4.0890040993690491e-01 -1.7091540619730949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1551 1.6248680651187897e-02 2 -1 1552
+            1.9177920185029507e-03 -2 -3 1553 -1.0359560139477253e-02</internalNodes>
+          <leafValues>
+            -6.0641109943389893e-01 3.6670050024986267e-01
+            1.9813629984855652e-01 -1.1020349711179733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1554 2.9234820976853371e-03 0 -1 1555
+            3.4323200583457947e-02 -2 -3 1556 1.8238219490740448e-04</internalNodes>
+          <leafValues>
+            -4.6382451057434082e-01 1.5469099581241608e-01
+            -2.5076579302549362e-02 2.7050849795341492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1557 -8.5055502131581306e-04 2 -1 1558
+            4.7644949518144131e-03 -2 -3 1559 -2.5098009500652552e-03</internalNodes>
+          <leafValues>
+            1.7459200322628021e-01 4.0942171216011047e-01
+            3.9601740241050720e-01 -1.7667229473590851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1560 -5.0978600047528744e-03 -1 2 1561
+            -5.2095171064138412e-02 -2 -3 1562 3.5293150693178177e-02</internalNodes>
+          <leafValues>
+            -4.4393861293792725e-01 -6.6363197565078735e-01
+            2.7801029384136200e-02 5.6744211912155151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1563 -3.6938309669494629e-01 2 -1 1564
+            5.7077431119978428e-03 -2 -3 1565 5.1315332530066371e-04</internalNodes>
+          <leafValues>
+            -5.4281282424926758e-01 -3.8007241487503052e-01
+            -7.5563162565231323e-02 1.8112689256668091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1566 -8.1165106967091560e-03 -1 2 1567
+            2.4742930690990761e-05 -2 -3 1568 -8.3282394334673882e-03</internalNodes>
+          <leafValues>
+            4.3757191300392151e-01 -1.6252890229225159e-01
+            2.9233780503273010e-01 -5.2530951797962189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1569 -9.9733080714941025e-03 -1 2 1570
+            -1.6291439533233643e-03 -2 -3 1571 2.3081828840076923e-03</internalNodes>
+          <leafValues>
+            2.3018500208854675e-01 -3.8834458589553833e-01
+            1.5438289940357208e-01 -1.6248099505901337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1572 7.0326360873878002e-03 2 -1 1573
+            -8.7802913039922714e-03 -2 -3 1574 -1.1044350266456604e-01</internalNodes>
+          <leafValues>
+            -8.2522578537464142e-02 3.2759511470794678e-01
+            6.3194888830184937e-01 -2.1398690342903137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1575 6.3772657886147499e-03 -1 2 1576
+            -1.4427660405635834e-01 -2 -3 1577 5.2613671869039536e-03</internalNodes>
+          <leafValues>
+            -6.5774962306022644e-02 -5.2361601591110229e-01
+            3.7687599658966064e-01 -3.7297201156616211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1578 -9.3407719396054745e-04 2 -1 1579
+            7.0944131584838033e-04 -2 -3 1580 -2.0967289805412292e-02</internalNodes>
+          <leafValues>
+            -3.5960820317268372e-01 2.9923319816589355e-01
+            -3.0739480257034302e-01 4.0209449827671051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1581 3.0113470274955034e-03 0 -1 1582
+            -1.6325850447174162e-04 -2 -3 1583 3.9222151972353458e-03</internalNodes>
+          <leafValues>
+            8.1960096955299377e-02 -2.3989020287990570e-01
+            3.2356649637222290e-01 -1.2140029668807983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1584 1.9476639572530985e-03 -1 2 1585
+            -1.1166670173406601e-01 -2 -3 1586 -8.8221747428178787e-03</internalNodes>
+          <leafValues>
+            -2.0126590132713318e-01 -3.1850230693817139e-01
+            -4.0777778625488281e-01 1.7498190701007843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1587 4.4771569082513452e-04 -1 2 1588
+            -1.5389479696750641e-01 -2 -3 1589 9.9520087242126465e-02</internalNodes>
+          <leafValues>
+            2.2826899588108063e-01 2.3346799612045288e-01
+            -1.9206780195236206e-01 1.9271479547023773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1590 -7.3821679688990116e-03 2 -1 1591
+            3.8805850781500340e-03 -2 -3 1592 1.6339759528636932e-01</internalNodes>
+          <leafValues>
+            -4.6257901191711426e-01 -2.3733510076999664e-01
+            5.5862568318843842e-02 6.1965280771255493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1593 -8.8077411055564880e-02 -1 2 1594
+            -3.5946018993854523e-02 -2 -3 1595 -1.6441620886325836e-02</internalNodes>
+          <leafValues>
+            -3.8033220171928406e-01 2.6925620436668396e-01
+            1.4508089423179626e-01 -1.6219359636306763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1596 -4.3592150323092937e-03 2 -1 1597
+            1.0485500097274780e-02 -2 -3 1598 -6.1118233134038746e-05</internalNodes>
+          <leafValues>
+            -5.1064497232437134e-01 2.8324770927429199e-01
+            7.6486147940158844e-02 -1.9800069928169250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1599 -4.7104779630899429e-02 2 -1 1600
+            4.4213151559233665e-03 -2 -3 1601 7.0402962155640125e-03</internalNodes>
+          <leafValues>
+            -7.2683817148208618e-01 3.9631149172782898e-01
+            1.8920229747891426e-02 -3.7019899487495422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1602 1.4250110089778900e-01 2 -1 1603
+            -5.7172770611941814e-03 -2 -3 1604 -4.6481531113386154e-02</internalNodes>
+          <leafValues>
+            8.8020402193069458e-01 4.3595671653747559e-02
+            7.6506501436233521e-01 -2.7619931101799011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1605 -4.4838748872280121e-02 2 -1 1606
+            3.0957909300923347e-02 -2 -3 1607 -8.7462607771158218e-03</internalNodes>
+          <leafValues>
+            -5.1540642976760864e-01 5.9068799018859863e-01
+            -2.2899469733238220e-01 6.3833296298980713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1608 -1.5742169693112373e-02 0 -1 1609
+            -2.6640590280294418e-02 -2 -3 1610 1.8860519630834460e-03</internalNodes>
+          <leafValues>
+            7.8339278697967529e-01 -2.8742430731654167e-02
+            -5.8971941471099854e-03 -5.2254527807235718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1611 9.0017020702362061e-02 2 -1 1612
+            4.1232812218368053e-03 -2 -3 1613 -3.1369640491902828e-03</internalNodes>
+          <leafValues>
+            -2.7766749262809753e-01 -3.3485591411590576e-01
+            2.3297710716724396e-01 -2.5101479142904282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1614 -1.9068670272827148e-01 -1 2 1615
+            -1.2578029930591583e-01 -2 -3 1616 -4.1931928717531264e-04</internalNodes>
+          <leafValues>
+            -4.9549269676208496e-01 -4.1263309121131897e-01
+            3.1464719772338867e-01 -1.8672699807211757e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1617 -3.2330630347132683e-03 -1 2 1618
+            1.7340299673378468e-03 -2 -3 1619 -2.2027179598808289e-02</internalNodes>
+          <leafValues>
+            1.2561239302158356e-01 -3.4801191091537476e-01
+            4.4815701246261597e-01 -7.2313196957111359e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>39</maxWeakCount>
+      <stageThreshold>-1.1791440248489380e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 1620 3.3422548323869705e-02 0 -1 1621
+            8.5403252160176635e-04 -2 -3 1622 -7.3585510253906250e-03</internalNodes>
+          <leafValues>
+            -1.3247360289096832e-01 7.6739120483398438e-01
+            1.3871429860591888e-01 -3.1415361166000366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1623 -1.0222700238227844e-01 2 -1 1624
+            3.4475249703973532e-03 -2 -3 1625 -1.7645580694079399e-02</internalNodes>
+          <leafValues>
+            -2.0302750170230865e-01 6.8434572219848633e-01
+            4.2404478788375854e-01 -4.3976809829473495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1626 3.2828699331730604e-03 -1 2 1627
+            -2.6843189261853695e-03 -2 -3 1628 2.6746080256998539e-03</internalNodes>
+          <leafValues>
+            -3.2990959286689758e-01 -3.5459449887275696e-01
+            2.0094729959964752e-01 -2.5637739896774292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1629 4.3111201375722885e-03 0 -1 1630
+            -1.0081959888339043e-02 -2 -3 1631 -1.2621459551155567e-02</internalNodes>
+          <leafValues>
+            6.3562941551208496e-01 7.2961407713592052e-03
+            -4.7962281107902527e-01 -2.3874230682849884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1632 6.5851196646690369e-02 2 -1 1633
+            6.6091239452362061e-02 -2 -3 1634 1.0616159997880459e-02</internalNodes>
+          <leafValues>
+            -4.3995830416679382e-01 5.8817231655120850e-01
+            4.4144749641418457e-02 -5.2871602773666382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1635 -1.7077329754829407e-01 2 -1 1636
+            7.3064928874373436e-03 -2 -3 1637 -1.6232950612902641e-02</internalNodes>
+          <leafValues>
+            3.5454490780830383e-01 -4.8716691136360168e-01
+            5.1020520925521851e-01 -4.3431609869003296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1638 1.7457149922847748e-02 -1 2 1639
+            1.8004700905294158e-05 -2 -3 1640 -1.8200390331912786e-04</internalNodes>
+          <leafValues>
+            6.0515201091766357e-01 -1.7250029742717743e-01
+            -1.9305349886417389e-01 1.9700099527835846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1641 1.9662559498101473e-04 0 -1 1642
+            -1.1132629588246346e-02 -2 -3 1643 2.1626690868288279e-03</internalNodes>
+          <leafValues>
+            5.0847887992858887e-01 -1.9962939620018005e-01
+            1.6478070616722107e-01 -4.2688089609146118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1644 7.7909911051392555e-03 -1 2 1645
+            -1.7233919352293015e-02 -2 -3 1646 1.2938809581100941e-02</internalNodes>
+          <leafValues>
+            4.0679588913917542e-01 -3.7941160798072815e-01
+            5.0589919090270996e-02 -3.9163780212402344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1647 -1.7387060448527336e-02 -1 2 1648
+            -2.5230729952454567e-03 -2 -3 1649 6.4417538233101368e-03</internalNodes>
+          <leafValues>
+            3.1603300571441650e-01 -1.7287540435791016e-01
+            -9.0429611504077911e-02 3.1889480352401733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1650 -6.1783548444509506e-03 -1 2 1651
+            -6.8178442306816578e-03 -2 -3 1652 1.2576530571095645e-04</internalNodes>
+          <leafValues>
+            -8.6734527349472046e-01 -4.4892689585685730e-01
+            -9.1477192938327789e-02 1.5243050456047058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1653 3.7562008947134018e-03 2 -1 1654
+            -7.1173519827425480e-03 -2 -3 1655 -4.5744940871372819e-04</internalNodes>
+          <leafValues>
+            -3.9259639382362366e-01 -1.9343020394444466e-02
+            5.8565497398376465e-01 -3.0873420182615519e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1656 1.8661000067368150e-03 -1 2 1657
+            4.5793029130436480e-04 -2 -3 1658 -7.0905109168961644e-04</internalNodes>
+          <leafValues>
+            1.2924820184707642e-01 -3.0677530169487000e-01
+            -2.7637350559234619e-01 1.8316049873828888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1659 1.6472890274599195e-03 0 -1 1660
+            3.3973839599639177e-03 -2 -3 1661 1.0479029733687639e-03</internalNodes>
+          <leafValues>
+            3.3831808716058731e-02 5.3982901573181152e-01
+            -3.4972178936004639e-01 3.4049559384584427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1662 -1.2611759593710303e-03 -1 2 1663
+            -1.3892400311306119e-03 -2 -3 1664 -2.3636990226805210e-03</internalNodes>
+          <leafValues>
+            -1.0801869630813599e-01 -5.8067310601472855e-02
+            -1.1870750039815903e-01 4.2690658569335938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1665 7.7976062893867493e-02 2 -1 1666
+            2.6837061159312725e-03 -2 -3 1667 -1.8215410411357880e-02</internalNodes>
+          <leafValues>
+            6.1271321773529053e-01 2.0893469452857971e-01
+            2.2027739882469177e-01 -1.4412580430507660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1668 -7.1908776590134948e-05 2 -1 1669
+            -4.8738159239292145e-02 -2 -3 1670 1.0442149825394154e-02</internalNodes>
+          <leafValues>
+            1.3836480677127838e-01 -1.8305869400501251e-01
+            2.6348349452018738e-01 -6.3504451513290405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1671 9.3731992819812149e-05 0 -1 1672
+            -8.5826592112425715e-05 -2 -3 1673 -8.0251938197761774e-04</internalNodes>
+          <leafValues>
+            1.4046959578990936e-01 -2.6721659302711487e-01
+            -1.2936100363731384e-01 2.3326739668846130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1674 -4.1836570017039776e-03 2 -1 1675
+            -7.2750613093376160e-02 -2 -3 1676 -2.1738439798355103e-01</internalNodes>
+          <leafValues>
+            -6.0153460502624512e-01 6.9707646965980530e-02
+            5.6727671623229980e-01 -4.5854389667510986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1677 1.1648099869489670e-02 0 -1 1678
+            -6.2701262533664703e-02 -2 -3 1679 2.1612979471683502e-02</internalNodes>
+          <leafValues>
+            7.8997617959976196e-01 -3.9388018846511841e-01
+            7.7059872448444366e-02 -3.8484179973602295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1680 1.4084950089454651e-02 0 -1 1681
+            -1.9548619166016579e-02 -2 -3 1682 -3.8142129778862000e-03</internalNodes>
+          <leafValues>
+            -8.6542218923568726e-01 3.0495870113372803e-01
+            9.0823858976364136e-02 -1.5859849750995636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1683 -1.0152840055525303e-02 -1 2 1684
+            -7.2696566581726074e-02 -2 -3 1685 6.2066782265901566e-03</internalNodes>
+          <leafValues>
+            4.4999830424785614e-02 -5.6914567947387695e-01
+            -2.0673969388008118e-01 9.0268892049789429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1686 6.9105483591556549e-02 -1 2 1687
+            -1.4375509927049279e-03 -2 -3 1688 -1.2960369931533933e-03</internalNodes>
+          <leafValues>
+            -5.9451812505722046e-01 4.0363711118698120e-01
+            -3.1941750645637512e-01 3.5984441637992859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1689 6.1866950243711472e-02 2 -1 1690
+            -1.2085740454494953e-02 -2 -3 1691 2.4474540259689093e-03</internalNodes>
+          <leafValues>
+            -2.7787050604820251e-01 -1.3511900603771210e-01
+            -1.1833719909191132e-02 3.7945300340652466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1692 -5.3315522382035851e-04 2 -1 1693
+            4.3831359595060349e-02 -2 -3 1694 3.1255939393304288e-04</internalNodes>
+          <leafValues>
+            -2.2559830546379089e-01 -4.7124490141868591e-01
+            1.7324599623680115e-01 -1.0789500176906586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1695 -3.2911780290305614e-03 2 -1 1696
+            -5.8774580247700214e-03 -2 -3 1697 1.7906239954754710e-03</internalNodes>
+          <leafValues>
+            7.7492022514343262e-01 -8.2756206393241882e-02
+            2.2471660748124123e-02 5.2061527967453003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1698 -2.8294209390878677e-02 0 -1 1699
+            -2.0737959071993828e-02 -2 -3 1700 6.0438051819801331e-02</internalNodes>
+          <leafValues>
+            -2.7196401357650757e-01 2.4411930143833160e-01
+            -1.8866230547428131e-01 1.2102810293436050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1701 1.0623940266668797e-02 -1 2 1702
+            -5.2178360521793365e-02 -2 -3 1703 -1.0080549865961075e-02</internalNodes>
+          <leafValues>
+            -4.3548050522804260e-01 5.5961382389068604e-01
+            -4.7012031078338623e-01 3.5867590457201004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1704 -1.8482849700376391e-03 -1 2 1705
+            -1.9860679458361119e-04 -2 -3 1706 1.3552449643611908e-01</internalNodes>
+          <leafValues>
+            1.6979730129241943e-01 7.1132831275463104e-02
+            -2.6272559165954590e-01 6.1016607284545898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1707 -1.5910629183053970e-02 0 -1 1708
+            2.6022290810942650e-02 -2 -3 1709 4.9573001451790333e-03</internalNodes>
+          <leafValues>
+            -3.0872771143913269e-01 4.9954459071159363e-01
+            1.6577349603176117e-01 -9.6653968095779419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1710 -7.6060830906499177e-05 -1 2 1711
+            -7.5124457478523254e-02 -2 -3 1712 -1.2995740398764610e-03</internalNodes>
+          <leafValues>
+            1.4288060367107391e-01 2.5722241401672363e-01
+            5.3607620298862457e-02 -2.8598341345787048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1713 -2.2266160231083632e-03 0 -1 1714
+            -1.7864009365439415e-02 -2 -3 1715 -7.8721214085817337e-03</internalNodes>
+          <leafValues>
+            4.0117779374122620e-01 -1.5379750728607178e-01
+            -5.3092598915100098e-01 2.0486819744110107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1716 7.2514810599386692e-03 0 -1 1717
+            -3.3152610994875431e-03 -2 -3 1718 1.1477110092528164e-04</internalNodes>
+          <leafValues>
+            4.3453741073608398e-01 9.4297742471098900e-03
+            -2.5599750876426697e-01 8.4530018270015717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1719 -8.1627883017063141e-02 -1 2 1720
+            -3.0422580894082785e-03 -2 -3 1721 9.5837161643430591e-04</internalNodes>
+          <leafValues>
+            6.3307619094848633e-01 1.4660899341106415e-01
+            -2.0023280382156372e-01 9.1823212802410126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1722 -2.9197218827903271e-04 -1 2 1723
+            -4.1077801142819226e-04 -2 -3 1724 -3.4885460045188665e-03</internalNodes>
+          <leafValues>
+            1.1741080135107040e-01 -4.0920740365982056e-01
+            -3.9310920238494873e-01 9.1094776988029480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1725 -8.0458387732505798e-02 2 -1 1726
+            1.4809619635343552e-02 -2 -3 1727 -2.5831649079918861e-02</internalNodes>
+          <leafValues>
+            -3.9728361368179321e-01 -6.7901968955993652e-01
+            -4.8431569337844849e-01 7.2864383459091187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1728 -6.8509988486766815e-03 2 -1 1729
+            7.2365561500191689e-03 -2 -3 1730 -1.5076539712026715e-03</internalNodes>
+          <leafValues>
+            -6.2457418441772461e-01 -4.1250211000442505e-01
+            4.2033711075782776e-01 4.4630239717662334e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1731 3.1408321112394333e-02 -1 2 1732
+            -1.5178160369396210e-01 -2 -3 1733 -1.4014760032296181e-02</internalNodes>
+          <leafValues>
+            5.3995478153228760e-01 -3.0855739116668701e-01
+            -5.0550711154937744e-01 4.7526750713586807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1734 -1.4479519426822662e-01 2 -1 1735
+            -3.5547069273889065e-04 -2 -3 1736 3.9468570612370968e-03</internalNodes>
+          <leafValues>
+            -6.7499721050262451e-01 -6.9627217948436737e-02
+            2.0310120284557343e-01 -5.7640278339385986e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>46</maxWeakCount>
+      <stageThreshold>-1.0878429412841797e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 1737 -3.7029121071100235e-02 0 -1 1738
+            3.5863209050148726e-03 -2 -3 1739 2.0645149052143097e-03</internalNodes>
+          <leafValues>
+            9.5846345648169518e-03 7.9992657899856567e-01
+            -2.9247409105300903e-01 1.4642210304737091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1740 5.5934679694473743e-03 0 -1 1741
+            2.2176630795001984e-02 -2 -3 1742 4.8479600081918761e-05</internalNodes>
+          <leafValues>
+            -3.9403820037841797e-01 5.4291707277297974e-01
+            -2.4063709378242493e-01 9.0213976800441742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1743 -1.2722389772534370e-02 2 -1 1744
+            1.1610349640250206e-02 -2 -3 1745 8.2520343363285065e-02</internalNodes>
+          <leafValues>
+            -1.7550089955329895e-01 -3.1787800788879395e-01
+            2.8798571228981018e-01 -4.4052869081497192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1746 -1.4208409935235977e-02 -1 2 1747
+            -8.1465748371556401e-04 -2 -3 1748 -5.5117108859121799e-03</internalNodes>
+          <leafValues>
+            -8.2584899663925171e-01 1.9521759450435638e-01
+            1.8622130155563354e-01 -1.9417479634284973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1749 1.0232779895886779e-03 -1 2 1750
+            -6.4967863261699677e-02 -2 -3 1751 2.5218280497938395e-03</internalNodes>
+          <leafValues>
+            -1.7564930021762848e-01 -6.9197070598602295e-01
+            6.9476373493671417e-02 6.7932087182998657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1752 1.5097549557685852e-01 -1 2 1753
+            4.3899910524487495e-03 -2 -3 1754 9.9906846880912781e-03</internalNodes>
+          <leafValues>
+            4.6142420172691345e-01 4.2842838913202286e-02
+            -4.2551028728485107e-01 3.2834030687808990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1755 -2.1895440295338631e-02 -1 2 1756
+            -7.6050527393817902e-02 -2 -3 1757 -9.6018705517053604e-03</internalNodes>
+          <leafValues>
+            -4.7627368569374084e-01 -3.6348098516464233e-01
+            2.4625270068645477e-01 -1.4736860059201717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1758 6.1576829466503114e-05 -1 2 1759
+            -2.2094589658081532e-03 -2 -3 1760 -1.3034399598836899e-02</internalNodes>
+          <leafValues>
+            -1.2972380220890045e-01 3.2342359423637390e-01
+            4.9937328696250916e-01 -1.3894359767436981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1761 -2.0411429926753044e-02 2 -1 1762
+            -6.8360187113285065e-02 -2 -3 1763 -4.1714729741215706e-03</internalNodes>
+          <leafValues>
+            -4.5825520157814026e-01 -5.3202010691165924e-02
+            -3.3815470337867737e-01 2.8209799528121948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1764 -2.2963550873100758e-03 -1 2 1765
+            -7.3422670364379883e-02 -2 -3 1766 3.5119321197271347e-02</internalNodes>
+          <leafValues>
+            -8.7558113038539886e-02 5.8385127782821655e-01
+            -7.8373529016971588e-02 5.2284508943557739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1767 -2.3843089584261179e-03 2 -1 1768
+            5.8223021915182471e-04 -2 -3 1769 5.1109357737004757e-03</internalNodes>
+          <leafValues>
+            -3.6075130105018616e-01 2.1036569774150848e-01
+            -1.9436909258365631e-01 1.3681420683860779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1770 -6.9154787342995405e-04 2 -1 1771
+            -5.5549171520397067e-04 -2 -3 1772 -7.5950571335852146e-03</internalNodes>
+          <leafValues>
+            -2.3962910473346710e-01 -1.0858660191297531e-01
+            -9.1398581862449646e-02 2.7578109502792358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1773 2.8131629806011915e-03 -1 2 1774
+            -4.5272540301084518e-02 -2 -3 1775 -2.6697120629251003e-03</internalNodes>
+          <leafValues>
+            -7.3745496571063995e-02 3.9891231060028076e-01
+            3.7440070509910583e-01 -2.5978609919548035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1776 -1.0849219746887684e-02 0 -1 1777
+            -1.6776850447058678e-02 -2 -3 1778 -1.9630219787359238e-02</internalNodes>
+          <leafValues>
+            -6.7678660154342651e-01 -4.9237858504056931e-02
+            -4.7865530848503113e-01 2.2300049662590027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1779 7.0901170372962952e-02 -1 2 1780
+            7.0403231075033545e-04 -2 -3 1781 3.3363080583512783e-03</internalNodes>
+          <leafValues>
+            -2.8926369547843933e-01 -5.3575031459331512e-02
+            -8.7073008762672544e-04 4.0888670086860657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1782 9.3207405880093575e-03 2 -1 1783
+            1.1512059718370438e-02 -2 -3 1784 -1.8639869813341647e-04</internalNodes>
+          <leafValues>
+            -5.3399091958999634e-01 -5.2177387475967407e-01
+            -1.1254069954156876e-01 1.3096989691257477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1785 1.5442570438608527e-03 -1 2 1786
+            2.5775749236345291e-03 -2 -3 1787 -1.2664040550589561e-03</internalNodes>
+          <leafValues>
+            -8.3666101098060608e-02 3.2544130086898804e-01
+            3.0370441079139709e-01 -2.6052421331405640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1788 3.2941689714789391e-03 -1 2 1789
+            -2.3375200107693672e-03 -2 -3 1790 -7.7096500899642706e-04</internalNodes>
+          <leafValues>
+            2.1506890654563904e-01 1.9738529622554779e-01
+            6.9986172020435333e-02 -1.9839569926261902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1791 -2.7190460241399705e-04 -1 2 1792
+            2.7237389236688614e-02 -2 -3 1793 -1.5080779790878296e-02</internalNodes>
+          <leafValues>
+            8.3213888108730316e-02 -2.8429448604583740e-01
+            6.8940150737762451e-01 -5.7628151029348373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1794 -6.5730936825275421e-02 -1 2 1795
+            -7.4283648282289505e-03 -2 -3 1796 3.4652319736778736e-03</internalNodes>
+          <leafValues>
+            -5.2482831478118896e-01 3.9523449540138245e-01
+            -7.3690779507160187e-02 2.0800660550594330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1797 -1.2613019905984402e-02 2 -1 1798
+            2.3288120329380035e-01 -2 -3 1799 2.1903509274125099e-02</internalNodes>
+          <leafValues>
+            -6.8893492221832275e-01 7.0790272951126099e-01
+            -7.7761108987033367e-03 8.4372210502624512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1800 1.0629750322550535e-03 -1 2 1801
+            1.8193929281551391e-04 -2 -3 1802 1.4717869926244020e-03</internalNodes>
+          <leafValues>
+            -3.4246420860290527e-01 1.0657790303230286e-01
+            -3.1970989704132080e-01 7.0577569305896759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1803 7.5306659564375877e-03 0 -1 1804
+            1.7505730502307415e-03 -2 -3 1805 3.8401300553232431e-03</internalNodes>
+          <leafValues>
+            -1.5460279583930969e-01 2.1335080265998840e-01
+            2.3800070583820343e-01 -4.1055840253829956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1806 -2.5041550397872925e-01 0 -1 1807
+            -2.0444789528846741e-01 -2 -3 1808 -1.2383040040731430e-02</internalNodes>
+          <leafValues>
+            -3.7927308678627014e-01 4.9870368838310242e-01
+            4.6343478560447693e-01 -6.7613303661346436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1809 1.9026029622182250e-03 0 -1 1810
+            -1.6705439984798431e-01 -2 -3 1811 -8.6937591433525085e-02</internalNodes>
+          <leafValues>
+            3.5356861352920532e-01 -2.4803459644317627e-01
+            -5.6781381368637085e-01 1.0121189802885056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1812 -1.0314949788153172e-02 2 -1 1813
+            4.5044738799333572e-03 -2 -3 1814 1.5172120183706284e-02</internalNodes>
+          <leafValues>
+            -5.2530448883771896e-02 -9.0071156620979309e-02
+            7.1758699417114258e-01 -3.7740949541330338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1815 -5.6233601644635201e-03 2 -1 1816
+            5.4567858576774597e-02 -2 -3 1817 9.7008212469518185e-04</internalNodes>
+          <leafValues>
+            2.3325720429420471e-01 4.8646458983421326e-01
+            -2.4600529670715332e-01 2.4224309250712395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1818 -2.7179729659110308e-03 2 -1 1819
+            -2.0419640466570854e-02 -2 -3 1820 -3.3307760953903198e-02</internalNodes>
+          <leafValues>
+            -5.3633391857147217e-01 -1.1361650191247463e-02
+            6.7398411035537720e-01 -1.4063489437103271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1821 -2.5500180199742317e-02 -1 2 1822
+            -4.0629908442497253e-02 -2 -3 1823 -9.0600941330194473e-03</internalNodes>
+          <leafValues>
+            -3.6177828907966614e-01 -5.4579132795333862e-01
+            5.2202242612838745e-01 2.2736469283699989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1824 -2.5635668635368347e-01 2 -1 1825
+            -9.5340751111507416e-02 -2 -3 1826 -5.9463721700012684e-03</internalNodes>
+          <leafValues>
+            -8.3328348398208618e-01 -1.6835439950227737e-02
+            5.6909567117691040e-01 -2.4973009526729584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1827 -9.2139927437528968e-04 0 -1 1828
+            -6.8437340669333935e-03 -2 -3 1829 -8.2487165927886963e-03</internalNodes>
+          <leafValues>
+            -3.6735090613365173e-01 1.6015109419822693e-01
+            5.2686601877212524e-01 -1.5151239931583405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1830 4.7555859200656414e-03 2 -1 1831
+            9.3567231670022011e-04 -2 -3 1832 -6.3907768344506621e-04</internalNodes>
+          <leafValues>
+            -4.2700308561325073e-01 1.7327770590782166e-01
+            1.3155570626258850e-01 -1.8646000325679779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1833 -5.6550311855971813e-03 -1 2 1834
+            -1.2212459929287434e-02 -2 -3 1835 -1.0550339706242085e-02</internalNodes>
+          <leafValues>
+            3.1297039985656738e-01 4.6750861406326294e-01
+            -2.4461230635643005e-01 1.6502030193805695e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1836 -7.5216998811811209e-04 2 -1 1837
+            3.0214080470614135e-04 -2 -3 1838 2.8510420816019177e-04</internalNodes>
+          <leafValues>
+            -1.0075300186872482e-01 -2.8865608572959900e-01
+            -1.1844499967992306e-02 3.6691731214523315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1839 -4.4020009227097034e-03 2 -1 1840
+            3.5568218678236008e-02 -2 -3 1841 6.4601990743540227e-05</internalNodes>
+          <leafValues>
+            -7.7167138457298279e-02 -4.4335851073265076e-01
+            1.3781660236418247e-02 4.5319119095802307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1842 9.3313469551503658e-04 -1 2 1843
+            -8.7838143110275269e-02 -2 -3 1844 2.8037109877914190e-03</internalNodes>
+          <leafValues>
+            -1.2059070169925690e-01 -4.6736609935760498e-01
+            7.1518830955028534e-02 4.4593128561973572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1845 2.3915059864521027e-03 2 -1 1846
+            -1.8183189677074552e-03 -2 -3 1847 1.9244100258219987e-04</internalNodes>
+          <leafValues>
+            -3.3277919888496399e-01 9.1478407382965088e-02
+            4.9121279269456863e-02 -4.5266890525817871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1848 2.1789909899234772e-01 -1 2 1849
+            1.0331439552828670e-03 -2 -3 1850 -1.4138330519199371e-01</internalNodes>
+          <leafValues>
+            7.4892401695251465e-01 -1.0637000203132629e-01
+            -4.2974629998207092e-01 1.6179689764976501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1851 -5.9106688946485519e-02 2 -1 1852
+            7.8279376029968262e-03 -2 -3 1853 -3.1304039293900132e-04</internalNodes>
+          <leafValues>
+            -4.0774118900299072e-01 3.9237990975379944e-01
+            1.3964369893074036e-01 -9.7562357783317566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1854 -6.4937800168991089e-02 -1 2 1855
+            -2.1739810705184937e-01 -2 -3 1856 -2.0257150754332542e-02</internalNodes>
+          <leafValues>
+            2.2590440511703491e-01 -3.4484180808067322e-01
+            2.4723629653453827e-01 -6.6609263420104980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1857 -1.1548499576747417e-02 0 -1 1858
+            -6.7811407148838043e-02 -2 -3 1859 -3.4953389316797256e-02</internalNodes>
+          <leafValues>
+            1.9427110254764557e-01 -5.8727997541427612e-01
+            7.8955358266830444e-01 1.5297190286219120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1860 -1.7180469632148743e-01 2 -1 1861
+            -2.5918710161931813e-04 -2 -3 1862 1.2741640210151672e-02</internalNodes>
+          <leafValues>
+            -2.9612448811531067e-01 1.0281720012426376e-01
+            -3.0702060461044312e-01 2.1692450344562531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1863 -3.1258590519428253e-02 2 -1 1864
+            3.5533700138330460e-03 -2 -3 1865 -9.2502118786796927e-04</internalNodes>
+          <leafValues>
+            5.7348787784576416e-01 5.0475007295608521e-01
+            -2.6686659455299377e-01 9.2138834297657013e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1866 -1.2170480331405997e-03 -1 2 1867
+            -2.2023949772119522e-02 -2 -3 1868 2.9549229890108109e-02</internalNodes>
+          <leafValues>
+            -3.9172619581222534e-01 2.0690579712390900e-01
+            -6.0358341783285141e-02 6.9752788543701172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1869 -7.2058511432260275e-04 0 -1 1870
+            -2.5625678896903992e-01 -2 -3 1871 3.2817238569259644e-01</internalNodes>
+          <leafValues>
+            -3.3763760328292847e-01 5.7221870869398117e-02
+            1.8268160521984100e-02 4.5866298675537109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1872 -5.2478950470685959e-02 -1 2 1873
+            -7.2261072695255280e-02 -2 -3 1874 -1.0751239955425262e-02</internalNodes>
+          <leafValues>
+            -3.7492391467094421e-01 5.6878948211669922e-01
+            -3.2823160290718079e-01 5.0447538495063782e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>43</maxWeakCount>
+      <stageThreshold>-1.1713529825210571e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 1875 -3.6475598812103271e-02 0 -1 1876
+            1.2570239603519440e-02 -2 -3 1877 -5.3332238458096981e-03</internalNodes>
+          <leafValues>
+            7.8855842351913452e-01 -5.8355428278446198e-02
+            6.4850552007555962e-03 -3.8411408662796021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1878 -3.8449079729616642e-03 0 -1 1879
+            1.8065240001305938e-03 -2 -3 1880 4.4460720382630825e-03</internalNodes>
+          <leafValues>
+            -8.8380120694637299e-02 6.6356122493743896e-01
+            -2.2651070356369019e-01 1.2168529629707336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1881 -1.5441340208053589e-01 2 -1 1882
+            2.8965979814529419e-02 -2 -3 1883 -1.8112070858478546e-02</internalNodes>
+          <leafValues>
+            -1.7789100110530853e-01 3.8929471373558044e-01
+            4.2137289047241211e-01 -2.0651680231094360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1884 -3.0437670648097992e-03 -1 2 1885
+            -2.7257429901510477e-03 -2 -3 1886 -1.5535579994320869e-02</internalNodes>
+          <leafValues>
+            -4.5531120896339417e-01 2.5576180219650269e-01
+            2.9463219642639160e-01 -1.2572860717773438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1887 -1.4182399958372116e-02 -1 2 1888
+            2.8875279240310192e-03 -2 -3 1889 1.9505630480125546e-03</internalNodes>
+          <leafValues>
+            -4.7841429710388184e-01 -1.4739120006561279e-01
+            -1.1689100414514542e-02 3.8708359003067017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1890 -4.1997907683253288e-03 0 -1 1891
+            -1.2343189679086208e-02 -2 -3 1892 -6.5799211151897907e-03</internalNodes>
+          <leafValues>
+            2.1066769957542419e-01 -2.4238829314708710e-01
+            -4.1709339618682861e-01 1.9089350104331970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1893 2.0319439936429262e-03 -1 2 1894
+            -2.2653149440884590e-02 -2 -3 1895 -2.4583860067650676e-04</internalNodes>
+          <leafValues>
+            2.7525109052658081e-01 6.1857348680496216e-01
+            -3.7903881072998047e-01 -1.9395859912037849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1896 -1.1686830548569560e-03 -1 2 1897
+            3.6638419260270894e-04 -2 -3 1898 -5.7184919569408521e-05</internalNodes>
+          <leafValues>
+            1.3913659751415253e-01 -2.6073169708251953e-01
+            3.0361440777778625e-01 -1.7147840559482574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1899 -2.3458409123122692e-03 0 -1 1900
+            -7.0121302269399166e-03 -2 -3 1901 2.3318149149417877e-02</internalNodes>
+          <leafValues>
+            1.7510280013084412e-01 -1.7132690548896790e-01
+            2.2869640588760376e-01 -3.7544658780097961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1902 2.7293559163808823e-02 -1 2 1903
+            -7.4272030033171177e-03 -2 -3 1904 -7.8977271914482117e-03</internalNodes>
+          <leafValues>
+            -2.8686890006065369e-01 -6.9167411327362061e-01
+            -4.1576528549194336e-01 1.0694450139999390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1905 -3.6563118919730186e-03 2 -1 1906
+            1.5060990117490292e-03 -2 -3 1907 -2.2211389616131783e-02</internalNodes>
+          <leafValues>
+            -4.2580971121788025e-01 2.3827329277992249e-01
+            -6.2818527221679688e-01 -1.2995249591767788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1908 -1.0182500118389726e-03 0 -1 1909
+            2.7624370530247688e-02 -2 -3 1910 -3.0267149209976196e-02</internalNodes>
+          <leafValues>
+            2.0952360332012177e-01 -3.9603650569915771e-01
+            -2.9257088899612427e-01 1.6949739307165146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1911 8.2686528563499451e-02 2 -1 1912
+            6.4655147492885590e-02 -2 -3 1913 2.7647409588098526e-03</internalNodes>
+          <leafValues>
+            3.3863779902458191e-01 6.1647278070449829e-01
+            -1.4266699552536011e-01 1.2386939674615860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1914 -3.1129099428653717e-02 2 -1 1915
+            -1.5587930101901293e-03 -2 -3 1916 -5.9767777565866709e-04</internalNodes>
+          <leafValues>
+            -3.7931808829307556e-01 -9.2908859252929688e-02
+            -1.0530649870634079e-01 2.9945549368858337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1917 -5.0103079527616501e-02 2 -1 1918
+            2.5710230693221092e-02 -2 -3 1919 -8.8613387197256088e-04</internalNodes>
+          <leafValues>
+            -4.4678428769111633e-01 -4.3549379706382751e-01
+            2.0978139340877533e-01 -3.8637928664684296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1920 -6.0174837708473206e-03 2 -1 1921
+            6.2055201269686222e-03 -2 -3 1922 2.7212419081479311e-04</internalNodes>
+          <leafValues>
+            2.9752719402313232e-01 6.6692227125167847e-01
+            2.1671950817108154e-02 -2.7139788866043091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1923 -1.3685439713299274e-02 -1 2 1924
+            -6.1648458242416382e-01 -2 -3 1925 -2.6253409683704376e-02</internalNodes>
+          <leafValues>
+            4.7005081176757812e-01 -5.2666938304901123e-01
+            1.3483020663261414e-01 -1.0639149695634842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1926 -4.1545720887370408e-04 0 -1 1927
+            -3.6237420863471925e-04 -2 -3 1928 5.5113807320594788e-04</internalNodes>
+          <leafValues>
+            -1.8588809669017792e-01 5.2727550268173218e-01
+            4.5380011200904846e-02 -2.3133419454097748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1929 -3.1878859736025333e-03 0 -1 1930
+            -6.2446491792798042e-03 -2 -3 1931 -2.1054609678685665e-03</internalNodes>
+          <leafValues>
+            2.8475400805473328e-01 -4.0583759546279907e-01
+            2.6000189781188965e-01 -1.6356609761714935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1932 2.2513020667247474e-04 2 -1 1933
+            -5.1745050586760044e-03 -2 -3 1934 -2.7152549009770155e-03</internalNodes>
+          <leafValues>
+            -1.8777419626712799e-01 1.2812760472297668e-01
+            3.4431490302085876e-01 -4.2658099532127380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1935 2.7846530079841614e-02 2 -1 1936
+            4.3891910463571548e-03 -2 -3 1937 1.9749049097299576e-03</internalNodes>
+          <leafValues>
+            -2.8553798794746399e-01 6.4455038309097290e-01
+            -8.2864962518215179e-02 1.7122590541839600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1938 -3.1317298999056220e-04 -1 2 1939
+            -1.5486280433833599e-02 -2 -3 1940 9.5049021765589714e-03</internalNodes>
+          <leafValues>
+            -1.2443479895591736e-01 -1.8395289778709412e-01
+            3.4495291113853455e-01 -2.0286519080400467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1941 -3.7190609145909548e-04 0 -1 1942
+            2.9666710179299116e-03 -2 -3 1943 -5.8068940415978432e-03</internalNodes>
+          <leafValues>
+            4.3022842146456242e-03 -3.4436589479446411e-01
+            -8.4134072065353394e-01 2.8392368555068970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 1944 -5.5204080417752266e-03 0 -1 1945
+            -1.3792069512419403e-04 -2 -3 1946 -3.7187319248914719e-02</internalNodes>
+          <leafValues>
+            -2.6300218701362610e-01 2.6706520467996597e-02
+            -2.9245018959045410e-01 4.0641939640045166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1947 -5.0016207387670875e-04 -1 2 1948
+            -1.5453010564669967e-03 -2 -3 1949 1.9056679448112845e-03</internalNodes>
+          <leafValues>
+            -1.1965669691562653e-01 -4.2565101385116577e-01
+            2.9724061489105225e-01 -4.7963049262762070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1950 7.2636879049241543e-03 2 -1 1951
+            1.9141070079058409e-03 -2 -3 1952 1.2875479296781123e-04</internalNodes>
+          <leafValues>
+            -6.4583316445350647e-02 -3.5147330164909363e-01
+            1.1196230351924896e-01 5.7284992933273315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1953 -1.0092630051076412e-02 -1 2 1954
+            -7.8368087997660041e-04 -2 -3 1955 -9.8703950643539429e-03</internalNodes>
+          <leafValues>
+            -3.7826448678970337e-01 2.3288239538669586e-01
+            2.1510779857635498e-01 -1.2697519361972809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1956 -1.0650960030034184e-03 -1 2 1957
+            8.5762650996912271e-05 -2 -3 1958 8.1163638969883323e-04</internalNodes>
+          <leafValues>
+            -3.2178428769111633e-01 -8.8832110166549683e-02
+            3.0365571379661560e-01 -8.3779007196426392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1959 -4.8947618342936039e-03 2 -1 1960
+            5.5883510503917933e-04 -2 -3 1961 -1.9008320523425937e-03</internalNodes>
+          <leafValues>
+            1.6282820701599121e-01 -2.5395259261131287e-01
+            -1.3888220489025116e-01 2.9919460415840149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1962 -2.0215269178152084e-03 0 -1 1963
+            -4.4383360072970390e-03 -2 -3 1964 6.8489909172058105e-02</internalNodes>
+          <leafValues>
+            3.9251059293746948e-01 -4.3069578707218170e-02
+            2.4472021032124758e-03 -2.9618039727210999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1965 5.0306279212236404e-02 2 -1 1966
+            -5.6435600854456425e-03 -2 -3 1967 -8.9875478297472000e-03</internalNodes>
+          <leafValues>
+            4.2249730229377747e-01 -9.2901676893234253e-02
+            6.6785961389541626e-01 6.2985196709632874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1968 -7.9090101644396782e-04 0 -1 1969
+            -2.5300959125161171e-02 -2 -3 1970 7.8745762584730983e-04</internalNodes>
+          <leafValues>
+            3.0849850177764893e-01 -6.3608251512050629e-02
+            -1.4883120357990265e-01 2.6234000921249390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1971 7.6404176652431488e-02 -1 2 1972
+            -7.9231243580579758e-03 -2 -3 1973 1.9256339874118567e-03</internalNodes>
+          <leafValues>
+            -4.5977321267127991e-01 -3.9364838600158691e-01
+            -6.4516498241573572e-04 2.8573459386825562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1974 3.3896900713443756e-03 -1 2 1975
+            2.6566439191810787e-04 -2 -3 1976 -7.0364158600568771e-03</internalNodes>
+          <leafValues>
+            -4.1618600487709045e-01 8.7239697575569153e-02
+            5.4902660846710205e-01 -3.1658211350440979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1977 2.7734860777854919e-02 -1 2 1978
+            3.3155460841953754e-03 -2 -3 1979 5.4807748645544052e-02</internalNodes>
+          <leafValues>
+            3.5683360695838928e-01 2.0545400679111481e-02
+            -3.7979850172996521e-01 8.2199662923812866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1980 -3.1911249971017241e-04 -1 2 1981
+            -2.3244849580805749e-04 -2 -3 1982 2.4389199912548065e-02</internalNodes>
+          <leafValues>
+            2.3498380184173584e-01 1.5976969897747040e-01
+            -1.6952790319919586e-01 3.8837739825248718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1983 3.7521280348300934e-02 -1 2 1984
+            5.3981738165020943e-04 -2 -3 1985 -1.1914219940081239e-03</internalNodes>
+          <leafValues>
+            -5.3004390001296997e-01 -9.2949196696281433e-02
+            2.5772979855537415e-01 -1.2804870307445526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1986 -1.9628699868917465e-02 2 -1 1987
+            -2.6430340949445963e-03 -2 -3 1988 -1.0492499917745590e-02</internalNodes>
+          <leafValues>
+            -4.5749071240425110e-01 -6.6639073193073273e-02
+            3.7817710638046265e-01 -7.0677888579666615e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1989 -8.1244978355243802e-04 2 -1 1990
+            1.4308369718492031e-02 -2 -3 1991 -2.6346129016019404e-04</internalNodes>
+          <leafValues>
+            7.1544222533702850e-02 -4.6973049640655518e-01
+            3.2926559448242188e-01 -2.3322540521621704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1992 9.5907926559448242e-02 -1 2 1993
+            -1.2872040271759033e-01 -2 -3 1994 -3.1911451369524002e-02</internalNodes>
+          <leafValues>
+            9.9990457296371460e-01 5.7599371671676636e-01
+            -7.3348528146743774e-01 -1.8063450232148170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1995 3.7128551048226655e-04 0 -1 1996
+            -2.8491979464888573e-03 -2 -3 1997 -4.2754760943353176e-04</internalNodes>
+          <leafValues>
+            -5.4329651594161987e-01 1.0755009949207306e-01
+            2.2071920335292816e-01 -2.6160699129104614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 1998 9.7452866612002254e-05 0 -1 1999
+            5.2659702487289906e-04 -2 -3 2000 5.9415772557258606e-04</internalNodes>
+          <leafValues>
+            -2.0488780736923218e-01 3.1935650110244751e-01
+            1.5211449563503265e-01 -2.8799989819526672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2001 -2.1307960560079664e-04 -1 2 2002
+            -1.2103560147807002e-03 -2 -3 2003 1.2572610285133123e-03</internalNodes>
+          <leafValues>
+            1.5206280350685120e-01 -2.3918260633945465e-01
+            3.7353378534317017e-01 -8.1597693264484406e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>46</maxWeakCount>
+      <stageThreshold>-1.0940879583358765e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 2 2004 -3.1007960438728333e-02 0 -1 2005
+            -3.1969440169632435e-03 -2 -3 2006 -2.0676921121776104e-03</internalNodes>
+          <leafValues>
+            6.8854278326034546e-01 -5.4836649447679520e-02
+            -3.5974439978599548e-01 -3.0973760411143303e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2007 -1.1122719943523407e-01 2 -1 2008
+            1.4844049699604511e-02 -2 -3 2009 -3.4631208982318640e-03</internalNodes>
+          <leafValues>
+            -1.5703879296779633e-01 -2.0413580536842346e-01
+            6.6245990991592407e-01 1.5534339845180511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2010 -1.2320470064878464e-01 2 -1 2011
+            1.1103290133178234e-02 -2 -3 2012 4.7404197975993156e-03</internalNodes>
+          <leafValues>
+            -5.2760660648345947e-01 -4.7932231426239014e-01
+            -1.0074780136346817e-01 1.6249769926071167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2013 -5.8416109532117844e-03 0 -1 2014
+            -5.1666028797626495e-02 -2 -3 2015 -3.9447061717510223e-03</internalNodes>
+          <leafValues>
+            -3.7591809034347534e-01 3.7338769435882568e-01
+            2.4347339570522308e-01 -1.4522999525070190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2016 -3.6320939660072327e-02 -1 2 2017
+            3.7123491056263447e-03 -2 -3 2018 -2.8242779895663261e-02</internalNodes>
+          <leafValues>
+            -3.6804199218750000e-01 1.0094779729843140e-01
+            4.2476901412010193e-01 -4.3828350305557251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2019 -2.0250169560313225e-02 0 -1 2020
+            3.0780840665102005e-02 -2 -3 2021 2.5205970741808414e-03</internalNodes>
+          <leafValues>
+            1.6355019807815552e-01 -6.3770228624343872e-01
+            -1.9899259507656097e-01 3.1258741021156311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2022 -4.2486261576414108e-02 2 -1 2023
+            3.0256640166044235e-02 -2 -3 2024 1.2559810420498252e-03</internalNodes>
+          <leafValues>
+            -6.1104768514633179e-01 7.7699762582778931e-01
+            6.8223267793655396e-02 -1.8402789533138275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2025 -1.8111230805516243e-02 2 -1 2026
+            -7.0966721978038549e-04 -2 -3 2027 2.0517550874501467e-03</internalNodes>
+          <leafValues>
+            3.7390831112861633e-01 7.1673221886157990e-02
+            -2.3723709583282471e-01 4.2304378747940063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2028 -6.6939830780029297e-02 -1 2 2029
+            -8.4355175495147705e-03 -2 -3 2030 -7.6646007597446442e-02</internalNodes>
+          <leafValues>
+            -6.4464849233627319e-01 -5.9667718410491943e-01
+            -3.5360890626907349e-01 7.6701030135154724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2031 -1.8152770353481174e-03 -1 2 2032
+            -2.7247369289398193e-03 -2 -3 2033 -5.4963980801403522e-04</internalNodes>
+          <leafValues>
+            1.7099569737911224e-01 1.6262990236282349e-01
+            -4.4764471054077148e-01 -7.4255913496017456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2034 -4.1336409747600555e-02 -1 2 2035
+            -1.2627179920673370e-01 -2 -3 2036 -4.9632410518825054e-03</internalNodes>
+          <leafValues>
+            -3.0079290270805359e-01 -2.1949230134487152e-01
+            3.1715381145477295e-01 1.6522889956831932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2037 -6.8255789577960968e-02 2 -1 2038
+            1.7256699502468109e-02 -2 -3 2039 1.8318969523534179e-03</internalNodes>
+          <leafValues>
+            3.7629279494285583e-01 6.0703051090240479e-01
+            4.4839300215244293e-02 -1.8284620344638824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2040 6.2703560106456280e-03 2 -1 2041
+            6.4142688643187284e-04 -2 -3 2042 -1.2087869690731168e-03</internalNodes>
+          <leafValues>
+            1.5012329816818237e-01 -2.4387939274311066e-01
+            -9.6486136317253113e-02 4.5252281427383423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2043 -1.3087630271911621e-02 0 -1 2044
+            -2.0685649942606688e-03 -2 -3 2045 -9.9608547985553741e-02</internalNodes>
+          <leafValues>
+            3.4508320689201355e-01 -4.1232489049434662e-02
+            -5.4945659637451172e-01 -5.1996659487485886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2046 -3.6486559547483921e-03 0 -1 2047
+            -2.8182850219309330e-03 -2 -3 2048 5.5368460714817047e-02</internalNodes>
+          <leafValues>
+            -3.3460721373558044e-01 1.5438309311866760e-01
+            -2.0008920133113861e-01 2.6830759644508362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2049 -7.4223391711711884e-03 2 -1 2050
+            -4.4916807673871517e-03 -2 -3 2051 -6.0621831566095352e-02</internalNodes>
+          <leafValues>
+            -2.5990688800811768e-01 9.8559968173503876e-02
+            -3.5481810569763184e-01 4.1711899638175964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2052 2.3197410337161273e-04 0 -1 2053
+            -2.6323291240260005e-04 -2 -3 2054 1.8173559510614723e-04</internalNodes>
+          <leafValues>
+            1.1800730228424072e-01 -1.8469020724296570e-01
+            3.3645889163017273e-01 -1.6443650424480438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2055 -4.3080520117655396e-04 0 -1 2056
+            8.4635447710752487e-03 -2 -3 2057 3.2700230367481709e-03</internalNodes>
+          <leafValues>
+            -3.5056531429290771e-01 3.3979919552803040e-01
+            -1.9305050373077393e-01 1.0525429993867874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2058 1.2329599820077419e-02 0 -1 2059
+            3.2368130632676184e-04 -2 -3 2060 -7.1359151042997837e-03</internalNodes>
+          <leafValues>
+            -7.0782758295536041e-02 4.2691200971603394e-01
+            2.4507419764995575e-01 -1.1304569989442825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2061 -3.8914520293474197e-02 2 -1 2062
+            6.6584121668711305e-04 -2 -3 2063 -9.3276530969887972e-04</internalNodes>
+          <leafValues>
+            -4.1401219367980957e-01 -1.2954230606555939e-01
+            -2.8715679422020912e-02 2.9640379548072815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2064 9.1005821013823152e-04 0 -1 2065
+            7.4173710308969021e-03 -2 -3 2066 -5.9348379727452993e-04</internalNodes>
+          <leafValues>
+            1.5225520357489586e-02 5.1878088712692261e-01
+            6.3158690929412842e-02 -1.6790659725666046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2067 -1.6713090008124709e-03 2 -1 2068
+            -3.2247399212792516e-04 -2 -3 2069 -3.3846818841993809e-03</internalNodes>
+          <leafValues>
+            1.8846319615840912e-01 -2.2796130180358887e-01
+            3.0563241243362427e-01 -8.1067040562629700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2070 9.5189079642295837e-02 2 -1 2071
+            9.7679207101464272e-04 -2 -3 2072 -1.0893770307302475e-01</internalNodes>
+          <leafValues>
+            1.9821229577064514e-01 1.4671079814434052e-01
+            -6.9909930229187012e-01 -1.1488740146160126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2073 -1.7448779195547104e-02 0 -1 2074
+            -9.9434393632691354e-05 -2 -3 2075 6.4250029623508453e-02</internalNodes>
+          <leafValues>
+            2.4062860012054443e-01 -8.9487351477146149e-02
+            -1.7152050137519836e-01 5.1314127445220947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2076 5.9518171474337578e-03 -1 2 2077
+            -9.0886192629113793e-04 -2 -3 2078 -5.1080051343888044e-04</internalNodes>
+          <leafValues>
+            2.3301599919795990e-01 5.8810569345951080e-02
+            -5.0240808725357056e-01 -8.0962918698787689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2079 -1.5467169694602489e-02 2 -1 2080
+            2.3221820592880249e-02 -2 -3 2081 3.9248089888133109e-04</internalNodes>
+          <leafValues>
+            -4.4010490179061890e-01 5.1546990871429443e-01
+            -5.2290290594100952e-02 2.1555709838867188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2082 -1.1872940231114626e-03 -1 2 2083
+            -1.1692909756675363e-03 -2 -3 2084 -1.8374159699305892e-03</internalNodes>
+          <leafValues>
+            2.8682470321655273e-01 3.9871171116828918e-01
+            -2.4273440241813660e-01 2.5974079966545105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2085 -3.9783148095011711e-03 2 -1 2086
+            -4.7793678822927177e-04 -2 -3 2087 5.3964089602231979e-04</internalNodes>
+          <leafValues>
+            -2.5224199891090393e-01 1.0499279946088791e-01
+            -4.1497600078582764e-01 1.0635569691658020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2088 -4.2262359056621790e-04 -1 2 2089
+            -1.0138460248708725e-01 -2 -3 2090 -9.2142065986990929e-03</internalNodes>
+          <leafValues>
+            2.1089179813861847e-01 -9.3101882934570312e-01
+            -8.2452338933944702e-01 -2.4682279676198959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2091 4.3104309588670731e-02 -1 2 2092
+            -5.3224200382828712e-03 -2 -3 2093 3.7746389862149954e-03</internalNodes>
+          <leafValues>
+            9.0424752235412598e-01 -2.7320840954780579e-01
+            -2.9543019831180573e-02 2.7356389164924622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2094 2.3850500583648682e-02 -1 2 2095
+            -8.8544972240924835e-03 -2 -3 2096 -1.3691160082817078e-01</internalNodes>
+          <leafValues>
+            -5.1007378101348877e-01 4.8890089988708496e-01
+            -5.5362242460250854e-01 2.5062739849090576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2097 -2.5274729356169701e-02 2 -1 2098
+            2.6481070090085268e-03 -2 -3 2099 -2.0161429711151868e-04</internalNodes>
+          <leafValues>
+            -7.3669922351837158e-01 2.6283189654350281e-01
+            -2.4148160219192505e-01 5.1645949482917786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2100 -1.1898370459675789e-02 -1 2 2101
+            -1.9360600272193551e-03 -2 -3 2102 2.1037699189037085e-03</internalNodes>
+          <leafValues>
+            -6.3804662227630615e-01 3.9121028780937195e-01
+            -5.2923560142517090e-02 2.3925469815731049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2103 -1.3646620325744152e-02 -1 2 2104
+            -8.8408291339874268e-03 -2 -3 2105 3.7220980972051620e-02</internalNodes>
+          <leafValues>
+            4.5531919598579407e-01 -5.2776831388473511e-01
+            -5.2423689514398575e-02 2.1479150652885437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2106 -4.2580282315611839e-03 0 -1 2107
+            -4.6129771508276463e-03 -2 -3 2108 5.9317899867892265e-03</internalNodes>
+          <leafValues>
+            -5.8091402053833008e-01 9.2666886746883392e-02
+            -6.7499437136575580e-04 3.6766529083251953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2109 9.4187082722783089e-03 -1 2 2110
+            -4.1941772215068340e-03 -2 -3 2111 5.1073678769171238e-03</internalNodes>
+          <leafValues>
+            -6.1342322826385498e-01 -3.8310700654983521e-01
+            6.7254997789859772e-02 -3.9773949980735779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2112 -5.5304579436779022e-03 2 -1 2113
+            -6.0295849107205868e-04 -2 -3 2114 -7.0414398796856403e-03</internalNodes>
+          <leafValues>
+            -1.2926359474658966e-01 1.8724639713764191e-01
+            4.7651541233062744e-01 -2.3238509893417358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2115 -1.3096419861540198e-03 2 -1 2116
+            3.2035118783824146e-04 -2 -3 2117 -3.3677490428090096e-03</internalNodes>
+          <leafValues>
+            -8.3683609962463379e-02 4.4803410768508911e-01
+            2.6184868812561035e-01 -2.1176619827747345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2118 -1.3419929891824722e-02 2 -1 2119
+            4.5043388381600380e-03 -2 -3 2120 -7.8677892452105880e-04</internalNodes>
+          <leafValues>
+            -5.1725488901138306e-01 -2.4854829907417297e-01
+            2.2026860713958740e-01 -2.9989460483193398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2121 -4.0467849373817444e-01 -1 2 2122
+            -1.6472050547599792e-01 -2 -3 2123 -4.3211959302425385e-02</internalNodes>
+          <leafValues>
+            -8.6876207590103149e-01 -2.6331049203872681e-01
+            -1.2996859848499298e-01 1.2739099562168121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2124 -1.7417479539290071e-03 2 -1 2125
+            -8.3949731197208166e-04 -2 -3 2126 1.5101189492270350e-03</internalNodes>
+          <leafValues>
+            8.2801252603530884e-02 -3.8465818762779236e-01
+            1.3933099806308746e-01 -3.5602769255638123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2127 3.6241519264876842e-03 2 -1 2128
+            1.6943299851845950e-04 -2 -3 2129 -5.5435068905353546e-02</internalNodes>
+          <leafValues>
+            2.3847030103206635e-01 5.6582901626825333e-02
+            8.5272318124771118e-01 -1.9084540009498596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2130 -2.3511620238423347e-02 2 -1 2131
+            -2.2539960627909750e-04 -2 -3 2132 1.6610369086265564e-02</internalNodes>
+          <leafValues>
+            -1.3226120173931122e-01 -2.0941901020705700e-03
+            4.0792500972747803e-01 -2.9247689247131348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2133 -6.3177421689033508e-03 -1 2 2134
+            8.5653591668233275e-04 -2 -3 2135 -1.1638339608907700e-02</internalNodes>
+          <leafValues>
+            2.4937899410724640e-01 -1.5689609944820404e-01
+            4.2693111300468445e-01 -1.3493919745087624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2136 -5.1630330272018909e-03 2 -1 2137
+            4.8902099952101707e-03 -2 -3 2138 -2.9903270304203033e-02</internalNodes>
+          <leafValues>
+            2.8233599662780762e-01 -2.2749769687652588e-01
+            -3.1318700313568115e-01 7.2451077401638031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2139 3.1764109735377133e-04 -1 2 2140
+            5.2735407371073961e-04 -2 -3 2141 3.4350980422459543e-04</internalNodes>
+          <leafValues>
+            -1.3494649529457092e-01 -9.4839558005332947e-02
+            -2.8737118840217590e-01 2.6408618688583374e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>47</maxWeakCount>
+      <stageThreshold>-1.1282010078430176e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 2142 2.0928289741277695e-03 2 -1 2143
+            -2.0667549222707748e-02 -2 -3 2144 4.1186730377376080e-03</internalNodes>
+          <leafValues>
+            -2.4059830605983734e-01 -8.3949699997901917e-02
+            7.5294119119644165e-01 -2.5010040402412415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2145 -7.7038057148456573e-02 0 -1 2146
+            6.8526387214660645e-02 -2 -3 2147 -9.1197844594717026e-03</internalNodes>
+          <leafValues>
+            -1.6047920286655426e-01 5.8060508966445923e-01
+            4.0888330340385437e-01 -2.3711539804935455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2148 3.8453419692814350e-03 0 -1 2149
+            -4.0648199617862701e-02 -2 -3 2150 -3.5154789686203003e-02</internalNodes>
+          <leafValues>
+            -3.6227381229400635e-01 2.8189870715141296e-01
+            -6.3932722806930542e-01 -8.8311180472373962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2151 1.7193749547004700e-02 -1 2 2152
+            -3.1834539026021957e-02 -2 -3 2153 5.9677828103303909e-03</internalNodes>
+          <leafValues>
+            2.1619839966297150e-01 -6.1106377840042114e-01
+            -1.3163220137357712e-03 -6.7810398340225220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2154 1.7432730237487704e-04 -1 2 2155
+            -1.0427909903228283e-02 -2 -3 2156 -1.4324070070870221e-04</internalNodes>
+          <leafValues>
+            -1.6660380363464355e-01 3.0099079012870789e-01
+            -3.6957770586013794e-01 7.5943082571029663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2157 -1.0312269441783428e-03 -1 2 2158
+            -8.9528188109397888e-03 -2 -3 2159 5.4365568794310093e-03</internalNodes>
+          <leafValues>
+            -8.3984650671482086e-02 3.3358749747276306e-01
+            -2.5666850805282593e-01 3.6911809444427490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2160 2.0321870688349009e-03 2 -1 2161
+            1.9954480230808258e-03 -2 -3 2162 1.6922239214181900e-02</internalNodes>
+          <leafValues>
+            -1.1628130078315735e-01 -2.2477209568023682e-01
+            3.6504098773002625e-01 1.8671670928597450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2163 -1.4152450021356344e-03 0 -1 2164
+            8.0416322452947497e-04 -2 -3 2165 6.2191791832447052e-02</internalNodes>
+          <leafValues>
+            -4.4372379779815674e-02 2.6297140121459961e-01
+            -1.4997449517250061e-01 5.6759977340698242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2166 -4.4721928425133228e-03 -1 2 2167
+            -1.9247440621256828e-02 -2 -3 2168 5.2884127944707870e-03</internalNodes>
+          <leafValues>
+            -2.9525101184844971e-01 -7.0941370725631714e-01
+            4.9494709819555283e-03 3.6569160223007202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2169 9.1529808938503265e-02 -1 2 2170
+            -3.9309188723564148e-02 -2 -3 2171 -6.9177672266960144e-02</internalNodes>
+          <leafValues>
+            -4.7588708996772766e-01 -4.9558719992637634e-01
+            7.8180468082427979e-01 3.5177771002054214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2172 1.9501270726323128e-02 -1 2 2173
+            -5.4460992105305195e-03 -2 -3 2174 1.0495989583432674e-02</internalNodes>
+          <leafValues>
+            4.5107740163803101e-01 9.5154292881488800e-02
+            -1.6815499961376190e-01 5.1015657186508179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2175 5.7117962278425694e-03 -1 2 2176
+            -2.7439638972282410e-01 -2 -3 2177 -4.5373341999948025e-03</internalNodes>
+          <leafValues>
+            -7.4655741453170776e-01 -6.0310351848602295e-01
+            2.3245190083980560e-01 -4.1262548416852951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2178 4.7711891238577664e-04 -1 2 2179
+            -6.9821202196180820e-03 -2 -3 2180 -1.0556570291519165e+00</internalNodes>
+          <leafValues>
+            -1.5402629971504211e-01 -5.2603191137313843e-01
+            -5.0477248430252075e-01 1.4896139502525330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2181 -1.7868630588054657e-01 -1 2 2182
+            9.6028903499245644e-05 -2 -3 2183 1.4864769764244556e-03</internalNodes>
+          <leafValues>
+            6.1333847045898438e-01 -1.2570370733737946e-01
+            1.5855489671230316e-01 -3.2419750094413757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2184 -2.7532540843822062e-04 0 -1 2185
+            1.9395699491724372e-03 -2 -3 2186 -3.0006670858711004e-03</internalNodes>
+          <leafValues>
+            2.2301700711250305e-01 -1.4492830634117126e-01
+            2.5364619493484497e-01 -1.9060049951076508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2187 2.6949180755764246e-03 0 -1 2188
+            -2.7354890480637550e-02 -2 -3 2189 -2.6278549805283546e-02</internalNodes>
+          <leafValues>
+            -6.9697231054306030e-01 2.6986810564994812e-01
+            8.3400028944015503e-01 -8.1475183367729187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2190 -1.1615309631451964e-03 -1 2 2191
+            -7.9284235835075378e-03 -2 -3 2192 -4.0769609622657299e-03</internalNodes>
+          <leafValues>
+            9.9186070263385773e-02 2.9844290018081665e-01
+            1.1436840146780014e-01 -3.5259690880775452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2193 1.3272130163386464e-03 0 -1 2194
+            9.6542192623019218e-03 -2 -3 2195 -1.8561830511316657e-03</internalNodes>
+          <leafValues>
+            1.8691679835319519e-01 -3.3289530873298645e-01
+            -4.8549610376358032e-01 -4.0883861482143402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2196 8.5922293365001678e-02 -1 2 2197
+            -8.8873326778411865e-02 -2 -3 2198 -2.7235411107540131e-03</internalNodes>
+          <leafValues>
+            3.6382618546485901e-01 -3.3766660094261169e-01
+            2.4199460446834564e-01 -4.2081810534000397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2199 -1.3049770146608353e-02 2 -1 2200
+            -3.2052190508693457e-03 -2 -3 2201 -3.4975090529769659e-03</internalNodes>
+          <leafValues>
+            -3.0092039704322815e-01 -1.0076750069856644e-01
+            -4.0278410911560059e-01 1.7511740326881409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2202 3.6366239655762911e-03 0 -1 2203
+            -1.1586080305278301e-02 -2 -3 2204 3.9760980871506035e-04</internalNodes>
+          <leafValues>
+            1.7796489596366882e-01 -1.6348969936370850e-01
+            6.7020449787378311e-03 4.4130641222000122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2205 -2.5880750268697739e-02 2 -1 2206
+            1.0445900261402130e-03 -2 -3 2207 -4.7445381060242653e-03</internalNodes>
+          <leafValues>
+            6.0719907283782959e-01 -3.2216680049896240e-01
+            1.8654330074787140e-01 -5.8600809425115585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2208 7.0085371844470501e-03 -1 2 2209
+            -7.0238402113318443e-03 -2 -3 2210 8.1113204360008240e-03</internalNodes>
+          <leafValues>
+            3.1219249963760376e-01 -4.7851589322090149e-01
+            -1.1469169706106186e-01 1.4005890488624573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2211 -4.0908880531787872e-02 0 -1 2212
+            6.7115128040313721e-03 -2 -3 2213 4.7661857679486275e-03</internalNodes>
+          <leafValues>
+            1.1935690045356750e-01 -4.9553608894348145e-01
+            2.9291590908542275e-04 3.0523601174354553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2214 8.2969013601541519e-03 0 -1 2215
+            -1.4058559900149703e-03 -2 -3 2216 3.8165580481290817e-03</internalNodes>
+          <leafValues>
+            3.8395699858665466e-01 -5.8064288459718227e-03
+            8.5270447016227990e-05 -3.1768730282783508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2217 -1.5988849103450775e-02 2 -1 2218
+            -4.2525809258222580e-02 -2 -3 2219 1.0341469943523407e-01</internalNodes>
+          <leafValues>
+            5.8605968952178955e-01 1.5200969763100147e-02
+            -4.2698180675506592e-01 9.1076821088790894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2220 1.5279020590241998e-04 -1 2 2221
+            4.4353670091368258e-04 -2 -3 2222 -2.1845809533260763e-04</internalNodes>
+          <leafValues>
+            -1.8349540233612061e-01 1.8386720120906830e-01
+            -3.0458870530128479e-01 9.6679449081420898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2223 -6.9333161227405071e-03 2 -1 2224
+            2.6824630796909332e-02 -2 -3 2225 2.8827119618654251e-02</internalNodes>
+          <leafValues>
+            1.9829869270324707e-01 5.7704108953475952e-01
+            -1.3593469560146332e-01 1.8093059957027435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2226 3.4493818879127502e-02 -1 2 2227
+            -3.9107841439545155e-03 -2 -3 2228 2.0955900254193693e-04</internalNodes>
+          <leafValues>
+            2.7782711386680603e-01 1.0099980235099792e-01
+            -1.6889050602912903e-02 -3.4672379493713379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2229 -1.1503810063004494e-02 0 -1 2230
+            -5.8503649197518826e-03 -2 -3 2231 -1.9477239402476698e-04</internalNodes>
+          <leafValues>
+            2.9069650173187256e-01 -5.7935047149658203e-01
+            -1.5547400712966919e-01 8.7707668542861938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2232 -2.4192599812522531e-04 0 -1 2233
+            -8.7722227908670902e-04 -2 -3 2234 -8.8649448007345200e-03</internalNodes>
+          <leafValues>
+            -4.9958980083465576e-01 2.2867499291896820e-01
+            1.4817740023136139e-01 -1.4039020240306854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2235 6.6976482048630714e-03 2 -1 2236
+            1.6602370305918157e-04 -2 -3 2237 5.6860040873289108e-02</internalNodes>
+          <leafValues>
+            -1.7738009989261627e-01 2.5650730729103088e-01
+            1.7361199483275414e-02 -7.4021261930465698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2238 2.4098889902234077e-02 2 -1 2239
+            8.0347352195531130e-04 -2 -3 2240 6.9724403321743011e-02</internalNodes>
+          <leafValues>
+            -5.3940677642822266e-01 1.4385139942169189e-01
+            -1.0675229877233505e-01 5.4217422008514404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2241 9.0714782709255815e-04 -1 2 2242
+            -7.3141716711688787e-05 -2 -3 2243 -1.5573799610137939e-03</internalNodes>
+          <leafValues>
+            2.4376200139522552e-01 7.3325037956237793e-02
+            4.9846198409795761e-02 -3.1094640493392944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2244 -1.3867990113794804e-02 -1 2 2245
+            1.1202249443158507e-03 -2 -3 2246 -3.7206329405307770e-02</internalNodes>
+          <leafValues>
+            -6.6426891088485718e-01 7.0658437907695770e-02
+            4.2091751098632812e-01 -2.5585201382637024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2247 -4.2576639680191875e-04 0 -1 2248
+            5.4934259504079819e-02 -2 -3 2249 9.6833100542426109e-04</internalNodes>
+          <leafValues>
+            -3.0530530214309692e-01 2.7118149399757385e-01
+            -6.7041292786598206e-02 1.7276880145072937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2250 7.9393703490495682e-03 -1 2 2251
+            5.0757948309183121e-02 -2 -3 2252 -3.2133560627698898e-02</internalNodes>
+          <leafValues>
+            -5.3697269409894943e-02 4.0109890699386597e-01
+            4.3551141023635864e-01 -4.1936281323432922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2253 9.9633932113647461e-02 -1 2 2254
+            -4.5324079692363739e-03 -2 -3 2255 7.6392642222344875e-04</internalNodes>
+          <leafValues>
+            -6.1999887228012085e-01 1.6984449326992035e-01
+            1.0533300042152405e-01 -2.1900549530982971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2256 -1.3120270334184170e-02 2 -1 2257
+            -1.2095270212739706e-03 -2 -3 2258 -6.0685798525810242e-03</internalNodes>
+          <leafValues>
+            -5.1372468471527100e-02 -1.2173540145158768e-01
+            -3.2418820261955261e-01 6.5560877323150635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2259 -4.4329889118671417e-02 -1 2 2260
+            -1.1334549635648727e-02 -2 -3 2261 -9.7028171876445413e-04</internalNodes>
+          <leafValues>
+            -2.6503491401672363e-01 -7.6205557584762573e-01
+            -9.5501512289047241e-02 1.5263360738754272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2262 -8.4918709471821785e-03 -1 2 2263
+            -6.9846503436565399e-02 -2 -3 2264 9.2466361820697784e-02</internalNodes>
+          <leafValues>
+            1.9973739981651306e-01 3.1325021386146545e-01
+            -1.1733359843492508e-01 7.7850347757339478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2265 -9.5799759030342102e-02 2 -1 2266
+            5.1276460289955139e-03 -2 -3 2267 6.1059608124196529e-03</internalNodes>
+          <leafValues>
+            7.8442037105560303e-01 1.5389220416545868e-01
+            -1.3577620685100555e-01 2.1575249731540680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2268 -5.5722601246088743e-04 0 -1 2269
+            5.2772291004657745e-02 -2 -3 2270 -3.7010889500379562e-03</internalNodes>
+          <leafValues>
+            -1.3534410297870636e-01 2.9378059506416321e-01
+            -1.7292410135269165e-01 2.3805269598960876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2271 -1.3051830464974046e-03 -1 2 2272
+            -4.0903348475694656e-02 -2 -3 2273 -6.3687269575893879e-03</internalNodes>
+          <leafValues>
+            -5.5020369589328766e-02 -3.0940970778465271e-01
+            6.5783101320266724e-01 9.2643633484840393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2274 1.4673050027340651e-03 0 -1 2275
+            5.3080540150403976e-02 -2 -3 2276 4.5696222223341465e-03</internalNodes>
+          <leafValues>
+            1.1342869699001312e-01 -3.8801661133766174e-01
+            8.7235711514949799e-02 -5.5333012342453003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2277 2.7171480469405651e-03 0 -1 2278
+            -7.5547560118138790e-03 -2 -3 2279 2.1428259788081050e-04</internalNodes>
+          <leafValues>
+            4.6386051177978516e-01 2.2095510736107826e-02
+            -1.7482960224151611e-01 1.6784119606018066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2280 1.1644139885902405e-03 0 -1 2281
+            2.7417868841439486e-03 -2 -3 2282 5.1555588841438293e-02</internalNodes>
+          <leafValues>
+            -3.0654639005661011e-01 5.7464569807052612e-02
+            1.3891890645027161e-01 -4.4362550973892212e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>46</maxWeakCount>
+      <stageThreshold>-1.0841189622879028e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 2283 -1.9345199689269066e-03 -1 2 2284
+            5.4789008572697639e-03 -2 -3 2285 1.3723999727517366e-03</internalNodes>
+          <leafValues>
+            -2.9038429260253906e-01 -4.9600031226873398e-02
+            8.1412100791931152e-01 -4.1888630390167236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2286 2.6495110243558884e-02 0 -1 2287
+            -1.3697579503059387e-01 -2 -3 2288 -3.0566600617021322e-04</internalNodes>
+          <leafValues>
+            2.4463020265102386e-01 -1.4825659990310669e-01
+            6.5781980752944946e-01 -7.9236596822738647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2289 -1.9925139844417572e-02 -1 2 2290
+            -1.3427959382534027e-01 -2 -3 2291 -1.0180550161749125e-03</internalNodes>
+          <leafValues>
+            -7.2399538755416870e-01 5.6490647792816162e-01
+            1.0791130363941193e-01 -1.4493170380592346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2292 -1.6956209437921643e-03 0 -1 2293
+            -3.9232008159160614e-02 -2 -3 2294 -1.1985700111836195e-03</internalNodes>
+          <leafValues>
+            2.0442679524421692e-01 -2.2484399378299713e-01
+            -9.8312400281429291e-02 2.5217679142951965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2295 5.6637298315763474e-02 -1 2 2296
+            -1.4088810421526432e-02 -2 -3 2297 1.9742019474506378e-02</internalNodes>
+          <leafValues>
+            4.2156541347503662e-01 -5.4424422979354858e-01
+            -4.3038509786128998e-02 3.9660850167274475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2298 -3.7790019065141678e-02 -1 2 2299
+            -2.1278490126132965e-01 -2 -3 2300 -7.5766840018332005e-04</internalNodes>
+          <leafValues>
+            -5.3746891021728516e-01 2.9742780327796936e-01
+            -1.7239089310169220e-01 9.4371169805526733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2301 1.0515520116314292e-03 -1 2 2302
+            -4.6967338770627975e-02 -2 -3 2303 -6.6702580079436302e-03</internalNodes>
+          <leafValues>
+            -9.4606198370456696e-02 3.8049909472465515e-01
+            -3.6735290288925171e-01 1.8134810030460358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2304 -8.8434442877769470e-03 -1 2 2305
+            -7.5162857770919800e-02 -2 -3 2306 6.0678281442960724e-05</internalNodes>
+          <leafValues>
+            1.9733619689941406e-01 2.8719368577003479e-01
+            -2.1481469273567200e-01 4.5404769480228424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2307 -2.6157319545745850e-02 -1 2 2308
+            -2.5265390053391457e-02 -2 -3 2309 -5.3271669894456863e-03</internalNodes>
+          <leafValues>
+            -5.9915411472320557e-01 -3.2973399758338928e-01
+            4.3388798832893372e-01 1.2896250002086163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2310 -4.6350698918104172e-02 2 -1 2311
+            8.5780251538380980e-04 -2 -3 2312 8.7990947067737579e-03</internalNodes>
+          <leafValues>
+            -4.4396370649337769e-01 -1.0408560186624527e-01
+            2.6796650141477585e-02 3.4592410922050476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2313 -8.6540228221565485e-04 0 -1 2314
+            1.4915770152583718e-03 -2 -3 2315 -1.7994260415434837e-02</internalNodes>
+          <leafValues>
+            -3.0356478691101074e-01 2.4568190798163414e-02
+            -3.6277890205383301e-01 2.3864120244979858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2316 3.1142059713602066e-02 -1 2 2317
+            -1.3936620205640793e-02 -2 -3 2318 -2.1907410700805485e-04</internalNodes>
+          <leafValues>
+            3.8710731267929077e-01 5.2351367473602295e-01
+            -1.7730639874935150e-01 5.4297018796205521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2319 -1.5399450203403831e-03 0 -1 2320
+            2.0680578891187906e-03 -2 -3 2321 6.5148430876433849e-03</internalNodes>
+          <leafValues>
+            -1.2532320618629456e-01 1.5583939850330353e-01
+            2.7854940295219421e-01 -6.9196671247482300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2322 3.9056401699781418e-02 2 -1 2323
+            -4.0204878896474838e-03 -2 -3 2324 2.9492459725588560e-03</internalNodes>
+          <leafValues>
+            -4.3681609630584717e-01 8.3736188709735870e-02
+            -2.3137259483337402e-01 5.8771818876266479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2325 4.0582148358225822e-03 0 -1 2326
+            5.4531730711460114e-02 -2 -3 2327 2.4824589490890503e-03</internalNodes>
+          <leafValues>
+            2.7056580781936646e-01 -3.6512500047683716e-01
+            -2.2614318877458572e-03 3.5627979040145874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2328 -4.5967500656843185e-02 -1 2 2329
+            -7.7245971187949181e-03 -2 -3 2330 1.0509139858186245e-02</internalNodes>
+          <leafValues>
+            -3.6472341418266296e-01 -3.5956159234046936e-01
+            -1.1801080545410514e-03 2.6658898591995239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2331 2.7509370818734169e-02 0 -1 2332
+            -3.8485318422317505e-02 -2 -3 2333 8.4051601588726044e-03</internalNodes>
+          <leafValues>
+            -5.8312857151031494e-01 2.4421650171279907e-01
+            -1.2067990005016327e-01 2.0528540015220642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2334 -4.0405229665338993e-03 0 -1 2335
+            1.5476900443900377e-04 -2 -3 2336 2.4814540665829554e-05</internalNodes>
+          <leafValues>
+            3.1298181414604187e-01 -2.5597780942916870e-01
+            -2.2016249597072601e-01 5.4762478917837143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2337 -2.0571500062942505e-03 0 -1 2338
+            -2.5400029495358467e-02 -2 -3 2339 -9.7940629348158836e-04</internalNodes>
+          <leafValues>
+            1.5875819325447083e-01 -2.5695261359214783e-01
+            -4.8633909225463867e-01 1.3700939714908600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2340 2.1806131117045879e-03 2 -1 2341
+            -3.5455688834190369e-02 -2 -3 2342 7.0310868322849274e-03</internalNodes>
+          <leafValues>
+            -1.5206259489059448e-01 2.2079099714756012e-01
+            -1.0352379828691483e-01 7.8391069173812866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2343 -1.9015279831364751e-03 0 -1 2344
+            -2.7523210272192955e-02 -2 -3 2345 1.1140380054712296e-02</internalNodes>
+          <leafValues>
+            2.2670629620552063e-01 -1.4048579335212708e-01
+            3.8015339523553848e-02 4.5577189326286316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2346 -1.4077059924602509e-02 -1 2 2347
+            -7.5063481926918030e-03 -2 -3 2348 3.4938179887831211e-03</internalNodes>
+          <leafValues>
+            -3.4491220116615295e-01 2.4528980255126953e-01
+            -1.3371880352497101e-01 1.5036830306053162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2349 5.0538990646600723e-02 -1 2 2350
+            5.9616268845275044e-04 -2 -3 2351 -2.0425749942660332e-02</internalNodes>
+          <leafValues>
+            3.9677879214286804e-01 -1.6664770245552063e-01
+            -3.4699028730392456e-01 1.3850739598274231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2352 -5.2063791081309319e-03 -1 2 2353
+            -7.5247389031574130e-04 -2 -3 2354 -5.4832808673381805e-02</internalNodes>
+          <leafValues>
+            -3.6672219634056091e-01 -2.6418569684028625e-01
+            2.7295270562171936e-01 -3.5999810788780451e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2355 1.7384309321641922e-02 0 -1 2356
+            8.1398971378803253e-03 -2 -3 2357 5.3603048436343670e-03</internalNodes>
+          <leafValues>
+            -9.5032609999179840e-02 3.2227438688278198e-01
+            -1.8586769700050354e-02 4.8577728867530823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2358 -6.7889019846916199e-03 -1 2 2359
+            -2.6219699066132307e-04 -2 -3 2360 -6.3086668960750103e-03</internalNodes>
+          <leafValues>
+            4.3564158678054810e-01 -1.8974490463733673e-01
+            -3.2145148515701294e-01 9.9988803267478943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2361 -7.5333809945732355e-04 -1 2 2362
+            -5.1618018187582493e-04 -2 -3 2363 4.9971960484981537e-02</internalNodes>
+          <leafValues>
+            -6.4324781298637390e-02 4.0329611301422119e-01
+            -1.0619989782571793e-01 7.8842008113861084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2364 -1.6776630282402039e-01 2 -1 2365
+            1.5873169759288430e-03 -2 -3 2366 -1.5413289656862617e-03</internalNodes>
+          <leafValues>
+            8.3238917589187622e-01 -1.4161799848079681e-01
+            -1.1225470155477524e-01 2.1630200743675232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2367 -6.0930051840841770e-03 0 -1 2368
+            1.2093319557607174e-02 -2 -3 2369 -1.0354000143706799e-02</internalNodes>
+          <leafValues>
+            2.8332099318504333e-01 -7.5473171472549438e-01
+            3.1173440814018250e-01 -8.3147212862968445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2370 -2.2508190572261810e-01 0 -1 2371
+            -3.9419779181480408e-01 -2 -3 2372 -7.0281741209328175e-03</internalNodes>
+          <leafValues>
+            7.2753679752349854e-01 -4.7205528616905212e-01
+            2.6742509007453918e-01 -2.3675439879298210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2373 -1.0977389663457870e-01 -1 2 2374
+            -1.8981259316205978e-02 -2 -3 2375 -1.5975029673427343e-03</internalNodes>
+          <leafValues>
+            3.2995739579200745e-01 -4.1107800602912903e-01
+            3.9100599288940430e-01 -3.0054800212383270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2376 3.3699660561978817e-03 0 -1 2377
+            2.8608400374650955e-02 -2 -3 2378 1.1234980076551437e-02</internalNodes>
+          <leafValues>
+            -2.6757821440696716e-01 5.4922807216644287e-01
+            7.9798206686973572e-02 -4.9347519874572754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2379 1.0005270130932331e-02 0 -1 2380
+            -1.3333059847354889e-01 -2 -3 2381 1.0838189627975225e-03</internalNodes>
+          <leafValues>
+            4.3375509977340698e-01 1.4595700427889824e-02
+            9.0088322758674622e-03 -2.6673930883407593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2382 1.8866240279749036e-03 2 -1 2383
+            -1.9594319164752960e-02 -2 -3 2384 -4.0433141402900219e-03</internalNodes>
+          <leafValues>
+            1.6358950734138489e-01 2.3428240790963173e-02
+            1.8105390667915344e-01 -3.7628519535064697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2385 -1.3283960521221161e-01 0 -1 2386
+            3.8986348954495043e-05 -2 -3 2387 3.0710658757016063e-04</internalNodes>
+          <leafValues>
+            -4.7917541116476059e-02 5.7672798633575439e-01
+            -1.0200879722833633e-01 1.3613240420818329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2388 -4.0010150521993637e-02 -1 2 2389
+            -1.1752990540117025e-03 -2 -3 2390 -4.5838830992579460e-03</internalNodes>
+          <leafValues>
+            7.0342528820037842e-01 1.1457219719886780e-01
+            7.0621937513351440e-02 -2.1597090363502502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2391 5.3299739956855774e-02 2 -1 2392
+            1.9961010664701462e-02 -2 -3 2393 -1.4994270168244839e-02</internalNodes>
+          <leafValues>
+            -1.6445639729499817e-01 4.0419510006904602e-01
+            -4.9861040711402893e-01 6.1822768300771713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2394 4.2854552157223225e-03 -1 2 2395
+            -1.3991270214319229e-02 -2 -3 2396 9.9598374217748642e-03</internalNodes>
+          <leafValues>
+            -7.2749477624893188e-01 1.5665039420127869e-01
+            -1.2152709811925888e-01 2.4375760555267334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2397 -6.1463691294193268e-02 2 -1 2398
+            8.1084080738946795e-04 -2 -3 2399 1.4836339978501201e-03</internalNodes>
+          <leafValues>
+            -4.9159640073776245e-01 4.0312820672988892e-01
+            5.2907239645719528e-02 -2.0971420407295227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2400 2.8651900356635451e-04 2 -1 2401
+            -4.9405667232349515e-04 -2 -3 2402 -1.3786340132355690e-03</internalNodes>
+          <leafValues>
+            -5.8905839920043945e-02 3.8144549727439880e-01
+            -4.4638028740882874e-01 4.1437059640884399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2403 9.0396329760551453e-03 2 -1 2404
+            1.5593219723086804e-04 -2 -3 2405 -1.1492449790239334e-02</internalNodes>
+          <leafValues>
+            -5.8979207277297974e-01 1.4469850063323975e-01
+            -6.2305951118469238e-01 -2.8079420328140259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2406 -1.0058670304715633e-02 -1 2 2407
+            2.8506040107458830e-03 -2 -3 2408 -1.0550140403211117e-02</internalNodes>
+          <leafValues>
+            1.3063749670982361e-01 -1.5896910429000854e-01
+            -5.8578401803970337e-01 4.1516658663749695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2409 -2.6834249496459961e-02 -1 2 2410
+            -6.7446259781718254e-03 -2 -3 2411 -1.9539019558578730e-03</internalNodes>
+          <leafValues>
+            -2.3982690274715424e-01 -3.0731248855590820e-01
+            2.6545688509941101e-01 -2.7655568555928767e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2412 -1.5296439826488495e-01 0 -1 2413
+            1.3547400012612343e-02 -2 -3 2414 4.4966558925807476e-03</internalNodes>
+          <leafValues>
+            5.4796701669692993e-01 7.3741371743381023e-03
+            -3.9956450928002596e-04 -3.4183570742607117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2415 -9.6259176731109619e-02 2 -1 2416
+            6.0006431303918362e-03 -2 -3 2417 4.8557221889495850e-03</internalNodes>
+          <leafValues>
+            -3.4981849789619446e-01 4.8977410793304443e-01
+            9.2725560069084167e-02 -1.3060179352760315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2418 -1.2333790073171258e-03 0 -1 2419
+            -4.2365258559584618e-04 -2 -3 2420 8.3003565669059753e-03</internalNodes>
+          <leafValues>
+            2.4704679846763611e-01 -3.9149808883666992e-01
+            9.2340186238288879e-03 4.0348419547080994e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.1084890365600586e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            2 1 2421 2.8592639137059450e-03 0 -1 2422
+            -1.5535679645836353e-02 -2 -3 2423 -2.3885839618742466e-03</internalNodes>
+          <leafValues>
+            8.2635468244552612e-01 2.2793740034103394e-02
+            6.7295722663402557e-02 -3.1476849317550659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2424 1.4029210433363914e-03 -1 2 2425
+            -4.5515298843383789e-03 -2 -3 2426 9.4592738896608353e-03</internalNodes>
+          <leafValues>
+            -1.0290689766407013e-01 -3.2368329167366028e-01
+            5.4250991344451904e-01 -3.0348530411720276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2427 5.4062008857727051e-03 -1 2 2428
+            -2.6852379087358713e-03 -2 -3 2429 -6.2019047618377954e-05</internalNodes>
+          <leafValues>
+            -2.8486549854278564e-01 2.6024919748306274e-01
+            1.6827000677585602e-01 -2.3859730362892151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2430 2.4147080257534981e-02 -1 2 2431
+            1.3977369526401162e-03 -2 -3 2432 2.0164279267191887e-02</internalNodes>
+          <leafValues>
+            4.8240968585014343e-01 -3.6230188608169556e-01
+            -3.6146581172943115e-02 5.0473397970199585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2433 -6.1244291067123413e-01 2 -1 2434
+            9.0631619095802307e-03 -2 -3 2435 1.7811909317970276e-01</internalNodes>
+          <leafValues>
+            -4.8220318555831909e-01 -5.7859402894973755e-01
+            8.5012361407279968e-02 -6.3362121582031250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2436 2.6881069061346352e-04 -1 2 2437
+            -1.2180560268461704e-02 -2 -3 2438 4.0606390684843063e-03</internalNodes>
+          <leafValues>
+            -1.6075380146503448e-01 -6.5734118223190308e-01
+            5.4012559354305267e-02 4.9817681312561035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2439 -3.6952861119061708e-03 -1 2 2440
+            -6.8888221867382526e-03 -2 -3 2441 2.7258940972387791e-03</internalNodes>
+          <leafValues>
+            -2.9826200008392334e-01 6.1437392234802246e-01
+            -8.3065047860145569e-02 1.8066459894180298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2442 9.8391417413949966e-03 0 -1 2443
+            1.4573390362784266e-03 -2 -3 2444 -2.3016060004010797e-04</internalNodes>
+          <leafValues>
+            -4.8802070319652557e-02 2.9650750756263733e-01
+            8.3583436906337738e-02 -2.4457779526710510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2445 -1.3347089989110827e-03 0 -1 2446
+            -2.3516249656677246e-01 -2 -3 2447 -3.1839110888540745e-03</internalNodes>
+          <leafValues>
+            -3.9780059456825256e-01 2.9200470447540283e-01
+            1.5484599769115448e-01 -1.3911180198192596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2448 -5.9498839080333710e-02 2 -1 2449
+            2.9865070246160030e-04 -2 -3 2450 -2.1592311095446348e-03</internalNodes>
+          <leafValues>
+            -8.0241578817367554e-01 -1.7932119965553284e-01
+            -1.9703079760074615e-01 1.5901389718055725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2451 -8.7727643549442291e-02 -1 2 2452
+            1.8073969986289740e-03 -2 -3 2453 -3.0411710031330585e-04</internalNodes>
+          <leafValues>
+            2.3391810059547424e-01 -1.9777239859104156e-01
+            -2.2787599265575409e-01 2.3480290174484253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2454 -3.6778930574655533e-02 -1 2 2455
+            -8.4806662052869797e-03 -2 -3 2456 4.4526819139719009e-02</internalNodes>
+          <leafValues>
+            6.3471937179565430e-01 3.4320148825645447e-01
+            -3.2206610776484013e-03 -3.3057790994644165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2457 -1.1732319835573435e-03 0 -1 2458
+            1.4339870540425181e-03 -2 -3 2459 7.7017117291688919e-04</internalNodes>
+          <leafValues>
+            -3.2894629240036011e-01 2.6812461018562317e-01
+            1.5722079575061798e-01 -1.2080919742584229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2460 5.0579622620716691e-04 -1 2 2461
+            -1.6109919548034668e-01 -2 -3 2462 -9.3872181605547667e-04</internalNodes>
+          <leafValues>
+            1.6917209327220917e-01 5.4838567972183228e-01
+            1.3432510197162628e-01 -1.8490299582481384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2463 1.0552279651165009e-02 2 -1 2464
+            4.1157208383083344e-02 -2 -3 2465 -1.3245060108602047e-03</internalNodes>
+          <leafValues>
+            -4.0745589137077332e-01 7.5326120853424072e-01
+            -1.1372119933366776e-01 1.1744459718465805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2466 -7.3126708157360554e-03 -1 2 2467
+            -1.5847360715270042e-02 -2 -3 2468 -5.2730008028447628e-03</internalNodes>
+          <leafValues>
+            -7.3187656700611115e-02 -4.7248768806457520e-01
+            -3.9433181285858154e-01 3.2054188847541809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2469 -1.0163930244743824e-02 -1 2 2470
+            -1.4269599691033363e-02 -2 -3 2471 -2.8677590307779610e-04</internalNodes>
+          <leafValues>
+            -5.2099817991256714e-01 4.4472008943557739e-01
+            1.0787820070981979e-01 -1.3239330053329468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2472 -4.4711050577461720e-04 0 -1 2473
+            6.9207558408379555e-03 -2 -3 2474 -4.7490649740211666e-04</internalNodes>
+          <leafValues>
+            -2.1184509992599487e-01 7.1038311719894409e-01
+            -9.0368412435054779e-02 1.9339320063591003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2475 -1.4192230068147182e-02 -1 2 2476
+            -5.9010402765125036e-04 -2 -3 2477 2.2904858924448490e-03</internalNodes>
+          <leafValues>
+            -3.8774991035461426e-01 4.2241969704627991e-01
+            -8.0403536558151245e-02 1.7335900664329529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2478 -2.5104399770498276e-02 -1 2 2479
+            -9.7052762284874916e-03 -2 -3 2480 2.7441041311249137e-04</internalNodes>
+          <leafValues>
+            -6.0312938690185547e-01 -6.5721738338470459e-01
+            -5.2042860537767410e-02 1.8078009784221649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2481 -2.6883379905484617e-04 -1 2 2482
+            8.5731758736073971e-04 -2 -3 2483 -7.1471570990979671e-03</internalNodes>
+          <leafValues>
+            1.8486160039901733e-01 3.6701809614896774e-02
+            3.8019171357154846e-01 -3.1314790248870850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2484 -5.9650279581546783e-03 2 -1 2485
+            6.5897651948034763e-03 -2 -3 2486 5.0898519111797214e-04</internalNodes>
+          <leafValues>
+            -3.7518349289894104e-01 2.1948930621147156e-01
+            5.8855868875980377e-02 -2.6831701397895813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2487 -1.9406380131840706e-02 2 -1 2488
+            1.0682499967515469e-02 -2 -3 2489 5.9157088398933411e-03</internalNodes>
+          <leafValues>
+            -4.0213540196418762e-01 6.6164708137512207e-01
+            3.6718819290399551e-02 -4.7886928915977478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2490 -4.9229031428694725e-03 -1 2 2491
+            -1.2417170219123363e-02 -2 -3 2492 5.5979369208216667e-03</internalNodes>
+          <leafValues>
+            2.2026430070400238e-01 -4.9814000725746155e-01
+            -4.0141601115465164e-02 7.9332500696182251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2493 -1.8435899913311005e-01 2 -1 2494
+            6.4280577003955841e-02 -2 -3 2495 -1.6670690383762121e-03</internalNodes>
+          <leafValues>
+            8.2392162084579468e-01 -5.1533687114715576e-01
+            -5.7897537946701050e-01 3.1020650640130043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2496 4.7475788742303848e-02 2 -1 2497
+            2.5915699079632759e-03 -2 -3 2498 -6.8349228240549564e-04</internalNodes>
+          <leafValues>
+            1.5852110087871552e-01 -2.8132149577140808e-01
+            -8.4496207535266876e-02 3.4085351228713989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2499 -8.0965347588062286e-03 2 -1 2500
+            2.0750269293785095e-02 -2 -3 2501 2.0832920563407242e-04</internalNodes>
+          <leafValues>
+            6.4384061098098755e-01 4.5479089021682739e-01
+            -1.0736659914255142e-01 1.3257840275764465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2502 -3.6361071397550404e-04 -1 2 2503
+            -6.1230720020830631e-03 -2 -3 2504 -4.2420169338583946e-03</internalNodes>
+          <leafValues>
+            1.8995989859104156e-01 -5.5252599716186523e-01
+            2.9558050632476807e-01 -7.1881696581840515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2505 -3.2453850144520402e-04 2 -1 2506
+            1.2140260078012943e-02 -2 -3 2507 -1.8192020070273429e-04</internalNodes>
+          <leafValues>
+            -2.1697629988193512e-01 -3.1753998994827271e-01
+            -1.1777029931545258e-01 1.7208409309387207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2508 -3.0392920598387718e-03 2 -1 2509
+            2.8347579063847661e-04 -2 -3 2510 -2.0839450880885124e-03</internalNodes>
+          <leafValues>
+            1.8131990730762482e-01 1.4752319455146790e-01
+            1.2602719664573669e-01 -2.3448009788990021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            2 1 2511 -1.5735890716314316e-02 0 -1 2512
+            -5.9783339500427246e-02 -2 -3 2513 8.1148296594619751e-02</internalNodes>
+          <leafValues>
+            -3.7624269723892212e-01 1.0452839732170105e-01
+            -4.6331068873405457e-01 1.4930450357496738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2514 5.8228247798979282e-03 2 -1 2515
+            -5.7364261010661721e-04 -2 -3 2516 -3.6678448668681085e-04</internalNodes>
+          <leafValues>
+            -7.1261131763458252e-01 -3.9293140172958374e-02
+            -1.0198889672756195e-01 4.7379100322723389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2517 -9.1290572891011834e-04 0 -1 2518
+            1.2561770156025887e-02 -2 -3 2519 -7.6223909854888916e-04</internalNodes>
+          <leafValues>
+            3.5364340990781784e-02 4.8163351416587830e-01
+            4.6516609191894531e-01 -1.5139210224151611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2520 1.8540889723226428e-03 -1 2 2521
+            -1.8188059329986572e-02 -2 -3 2522 2.5648679584264755e-02</internalNodes>
+          <leafValues>
+            1.1853530257940292e-01 5.0805187225341797e-01
+            -2.3640629649162292e-01 2.6991719007492065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2523 -2.5939470157027245e-02 2 -1 2524
+            9.7436201758682728e-04 -2 -3 2525 -1.2310179881751537e-03</internalNodes>
+          <leafValues>
+            -6.1304092407226562e-01 -1.6751369833946228e-01
+            -2.6179370284080505e-01 1.2718600034713745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2526 -7.0769861340522766e-02 2 -1 2527
+            6.8592047318816185e-04 -2 -3 2528 7.2288517840206623e-03</internalNodes>
+          <leafValues>
+            3.6499670147895813e-01 3.1916418671607971e-01
+            -1.1326509714126587e-01 2.3138450086116791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2529 -4.7549661248922348e-03 -1 2 2530
+            3.8560681045055389e-02 -2 -3 2531 3.3737360499799252e-03</internalNodes>
+          <leafValues>
+            1.2249550223350525e-01 -2.2969830036163330e-01
+            -2.9323069378733635e-02 7.3215091228485107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2532 -1.4671970158815384e-02 -1 2 2533
+            3.5087150172330439e-04 -2 -3 2534 -2.0783280488103628e-03</internalNodes>
+          <leafValues>
+            -5.2395147085189819e-01 9.8115980625152588e-02
+            4.0350338816642761e-01 -2.2959670424461365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2535 -3.7065339274704456e-03 2 -1 2536
+            4.0150329470634460e-02 -2 -3 2537 -6.1276711523532867e-02</internalNodes>
+          <leafValues>
+            -9.2062972486019135e-02 -7.1320801973342896e-01
+            4.4615340232849121e-01 5.8714438229799271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 2 2538 -9.9730096757411957e-02 0 -1 2539
+            -7.7125482494011521e-04 -2 -3 2540 1.3902420178055763e-03</internalNodes>
+          <leafValues>
+            -1.4246919751167297e-01 5.1187419891357422e-01
+            1.8041240051388741e-02 -2.5729590654373169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2541 -2.5304889306426048e-02 -1 2 2542
+            2.5176260620355606e-02 -2 -3 2543 -2.7789679169654846e-01</internalNodes>
+          <leafValues>
+            -3.9365610480308533e-01 -1.7298270016908646e-02
+            -5.1464182138442993e-01 4.1422238945960999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2544 4.6188719570636749e-02 -1 2 2545
+            -1.7873500473797321e-03 -2 -3 2546 -1.2076550163328648e-02</internalNodes>
+          <leafValues>
+            -4.1546550393104553e-01 2.9358920454978943e-01
+            3.0501538515090942e-01 -8.3189137279987335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2547 -5.4004848934710026e-03 -1 2 2548
+            -9.4532333314418793e-03 -2 -3 2549 -1.6526769613847136e-03</internalNodes>
+          <leafValues>
+            -4.8242959380149841e-01 -4.1864201426506042e-01
+            -4.7690790891647339e-01 6.9955162703990936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2550 -3.1153310090303421e-02 2 -1 2551
+            5.1554460078477859e-03 -2 -3 2552 -2.7182319900020957e-04</internalNodes>
+          <leafValues>
+            6.2633192539215088e-01 -2.2152930498123169e-01
+            -2.8926940634846687e-02 3.6499640345573425e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          8 7 12 1 -1.</_>
+        <_>
+          8 7 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 6 -1.</_>
+        <_>
+          6 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 12 -1.</_>
+        <_>
+          9 7 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 12 -1.</_>
+        <_>
+          1 14 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 6 -1.</_>
+        <_>
+          8 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 15 -1.</_>
+        <_>
+          2 5 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 9 -1.</_>
+        <_>
+          7 4 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 19 3 1 -1.</_>
+        <_>
+          9 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 17 1 1 2.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 17 1 1 2.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 1 -1.</_>
+        <_>
+          11 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 7 -1.</_>
+        <_>
+          10 7 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 5 -1.</_>
+        <_>
+          9 8 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 7 -1.</_>
+        <_>
+          13 1 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 15 -1.</_>
+        <_>
+          9 7 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 14 1 -1.</_>
+        <_>
+          6 5 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 10 1 -1.</_>
+        <_>
+          9 9 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 3 -1.</_>
+        <_>
+          5 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 12 -1.</_>
+        <_>
+          0 14 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 13 -1.</_>
+        <_>
+          2 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 3 2 -1.</_>
+        <_>
+          12 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 3 1 -1.</_>
+        <_>
+          12 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 19 3 1 -1.</_>
+        <_>
+          12 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 9 3 -1.</_>
+        <_>
+          13 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 7 -1.</_>
+        <_>
+          7 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 8 -1.</_>
+        <_>
+          11 6 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 2 2 -1.</_>
+        <_>
+          4 18 1 1 2.</_>
+        <_>
+          5 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 2 2 -1.</_>
+        <_>
+          4 18 1 1 2.</_>
+        <_>
+          5 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 14 -1.</_>
+        <_>
+          9 6 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 4 3 -1.</_>
+        <_>
+          15 14 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 13 4 2 -1.</_>
+        <_>
+          16 13 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 14 -1.</_>
+        <_>
+          7 6 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 11 -1.</_>
+        <_>
+          2 7 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 7 -1.</_>
+        <_>
+          2 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 3 1 -1.</_>
+        <_>
+          3 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 18 -1.</_>
+        <_>
+          8 6 5 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          0 13 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 7 -1.</_>
+        <_>
+          9 7 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 2 -1.</_>
+        <_>
+          5 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 5 -1.</_>
+        <_>
+          16 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          16 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 9 12 -1.</_>
+        <_>
+          11 8 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 1 -1.</_>
+        <_>
+          9 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 11 -1.</_>
+        <_>
+          2 8 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 1 -1.</_>
+        <_>
+          15 0 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 3 -1.</_>
+        <_>
+          14 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 12 -1.</_>
+        <_>
+          6 8 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 1 2 -1.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 5 -1.</_>
+        <_>
+          10 10 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 3 2 -1.</_>
+        <_>
+          14 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 12 -1.</_>
+        <_>
+          0 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 4 -1.</_>
+        <_>
+          0 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 6 -1.</_>
+        <_>
+          14 7 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 2 -1.</_>
+        <_>
+          5 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 17 -1.</_>
+        <_>
+          13 2 4 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 3 -1.</_>
+        <_>
+          16 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 13 -1.</_>
+        <_>
+          13 5 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 6 -1.</_>
+        <_>
+          7 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 18 -1.</_>
+        <_>
+          8 7 5 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 8 -1.</_>
+        <_>
+          9 7 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          0 13 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 7 -1.</_>
+        <_>
+          3 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 3 1 -1.</_>
+        <_>
+          10 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 7 -1.</_>
+        <_>
+          7 6 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 1 10 -1.</_>
+        <_>
+          18 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 2 4 -1.</_>
+        <_>
+          12 16 1 2 2.</_>
+        <_>
+          13 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 19 4 1 -1.</_>
+        <_>
+          13 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 15 -1.</_>
+        <_>
+          11 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 1 -1.</_>
+        <_>
+          11 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 16 -1.</_>
+        <_>
+          5 0 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 3 3 -1.</_>
+        <_>
+          0 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 1 3 -1.</_>
+        <_>
+          1 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 1 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 3 -1.</_>
+        <_>
+          13 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 2 -1.</_>
+        <_>
+          13 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 13 -1.</_>
+        <_>
+          16 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 1 -1.</_>
+        <_>
+          14 6 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 2 -1.</_>
+        <_>
+          15 7 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 12 -1.</_>
+        <_>
+          9 4 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 13 9 -1.</_>
+        <_>
+          6 4 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          17 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 2 -1.</_>
+        <_>
+          6 0 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 3 -1.</_>
+        <_>
+          3 3 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 6 -1.</_>
+        <_>
+          5 3 13 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 3 -1.</_>
+        <_>
+          2 3 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 1 -1.</_>
+        <_>
+          18 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 5 6 -1.</_>
+        <_>
+          1 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 1 -1.</_>
+        <_>
+          6 15 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 3 -1.</_>
+        <_>
+          0 8 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 4 -1.</_>
+        <_>
+          0 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 3 -1.</_>
+        <_>
+          6 3 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 10 -1.</_>
+        <_>
+          8 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 12 -1.</_>
+        <_>
+          4 5 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 4 -1.</_>
+        <_>
+          4 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 8 12 -1.</_>
+        <_>
+          9 8 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 11 14 -1.</_>
+        <_>
+          8 13 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 9 -1.</_>
+        <_>
+          18 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 2 -1.</_>
+        <_>
+          14 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 6 -1.</_>
+        <_>
+          6 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 5 -1.</_>
+        <_>
+          5 0 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 1 3 -1.</_>
+        <_>
+          2 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 1 3 -1.</_>
+        <_>
+          2 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 2 -1.</_>
+        <_>
+          12 0 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 5 -1.</_>
+        <_>
+          2 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 1 -1.</_>
+        <_>
+          9 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 2 1 -1.</_>
+        <_>
+          11 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 9 3 -1.</_>
+        <_>
+          10 5 3 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 5 6 -1.</_>
+        <_>
+          8 5 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 1 3 -1.</_>
+        <_>
+          0 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 3 2 -1.</_>
+        <_>
+          13 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 3 3 -1.</_>
+        <_>
+          13 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 4 -1.</_>
+        <_>
+          6 10 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 8 -1.</_>
+        <_>
+          14 7 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 4 6 -1.</_>
+        <_>
+          5 12 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 10 -1.</_>
+        <_>
+          2 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 9 1 3 -1.</_>
+        <_>
+          19 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 15 -1.</_>
+        <_>
+          17 2 2 15 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 7 -1.</_>
+        <_>
+          16 7 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 6 -1.</_>
+        <_>
+          0 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 4 -1.</_>
+        <_>
+          17 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 1 3 -1.</_>
+        <_>
+          0 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 10 3 -1.</_>
+        <_>
+          6 6 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 7 -1.</_>
+        <_>
+          12 7 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 8 -1.</_>
+        <_>
+          14 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 1 -1.</_>
+        <_>
+          18 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 8 -1.</_>
+        <_>
+          17 3 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 3 -1.</_>
+        <_>
+          0 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 1 -1.</_>
+        <_>
+          6 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 1 -1.</_>
+        <_>
+          6 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 15 -1.</_>
+        <_>
+          9 7 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 3 -1.</_>
+        <_>
+          2 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 9 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 9 -1.</_>
+        <_>
+          4 6 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 4 -1.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 17 8 -1.</_>
+        <_>
+          0 3 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 9 1 -1.</_>
+        <_>
+          5 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 9 8 -1.</_>
+        <_>
+          2 15 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 15 -1.</_>
+        <_>
+          16 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 9 -1.</_>
+        <_>
+          17 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          15 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 2 -1.</_>
+        <_>
+          8 0 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 15 -1.</_>
+        <_>
+          10 0 4 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 6 -1.</_>
+        <_>
+          11 8 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 1 -1.</_>
+        <_>
+          12 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 1 -1.</_>
+        <_>
+          9 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 4 -1.</_>
+        <_>
+          7 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 8 -1.</_>
+        <_>
+          8 2 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 3 -1.</_>
+        <_>
+          6 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 9 12 -1.</_>
+        <_>
+          3 8 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 1 2 -1.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 2 -1.</_>
+        <_>
+          10 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 17 -1.</_>
+        <_>
+          8 1 4 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 4 -1.</_>
+        <_>
+          14 10 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 3 -1.</_>
+        <_>
+          8 1 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 4 -1.</_>
+        <_>
+          14 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 15 -1.</_>
+        <_>
+          13 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          17 18 1 1 2.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 10 -1.</_>
+        <_>
+          4 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 11 -1.</_>
+        <_>
+          7 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 4 1 -1.</_>
+        <_>
+          8 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 2 -1.</_>
+        <_>
+          15 0 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 3 -1.</_>
+        <_>
+          8 1 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 3 -1.</_>
+        <_>
+          12 1 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          17 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 6 -1.</_>
+        <_>
+          17 11 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 6 -1.</_>
+        <_>
+          9 6 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 10 -1.</_>
+        <_>
+          14 5 2 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 5 3 -1.</_>
+        <_>
+          8 8 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 1 -1.</_>
+        <_>
+          5 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 16 -1.</_>
+        <_>
+          4 6 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 6 -1.</_>
+        <_>
+          16 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 6 -1.</_>
+        <_>
+          15 7 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 17 1 2 -1.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 12 -1.</_>
+        <_>
+          11 8 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 6 -1.</_>
+        <_>
+          7 5 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 1 -1.</_>
+        <_>
+          5 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 9 -1.</_>
+        <_>
+          8 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 2 12 -1.</_>
+        <_>
+          1 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 1 -1.</_>
+        <_>
+          17 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 9 -1.</_>
+        <_>
+          8 5 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 20 -1.</_>
+        <_>
+          0 0 10 10 2.</_>
+        <_>
+          10 10 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 1 2 -1.</_>
+        <_>
+          18 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 1 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 6 -1.</_>
+        <_>
+          7 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 3 -1.</_>
+        <_>
+          16 10 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 18 3 2 -1.</_>
+        <_>
+          17 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 2 -1.</_>
+        <_>
+          16 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 1 2 -1.</_>
+        <_>
+          1 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 1 -1.</_>
+        <_>
+          10 18 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 2 -1.</_>
+        <_>
+          9 7 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          12 9 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 5 -1.</_>
+        <_>
+          12 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 9 3 -1.</_>
+        <_>
+          6 16 3 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          15 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 4 -1.</_>
+        <_>
+          2 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 5 2 -1.</_>
+        <_>
+          0 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 3 -1.</_>
+        <_>
+          16 8 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 1 -1.</_>
+        <_>
+          17 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 1 2 -1.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 12 -1.</_>
+        <_>
+          2 14 18 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          11 7 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 3 -1.</_>
+        <_>
+          16 9 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 17 12 -1.</_>
+        <_>
+          2 6 17 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 9 -1.</_>
+        <_>
+          3 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 9 -1.</_>
+        <_>
+          5 9 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 1 8 -1.</_>
+        <_>
+          8 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 1 -1.</_>
+        <_>
+          4 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 1 -1.</_>
+        <_>
+          4 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 1 3 -1.</_>
+        <_>
+          4 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 9 3 -1.</_>
+        <_>
+          9 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 4 -1.</_>
+        <_>
+          15 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 6 -1.</_>
+        <_>
+          18 9 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 3 -1.</_>
+        <_>
+          16 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 3 2 -1.</_>
+        <_>
+          14 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 3 -1.</_>
+        <_>
+          7 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 11 -1.</_>
+        <_>
+          7 0 8 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 20 -1.</_>
+        <_>
+          1 5 18 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 4 -1.</_>
+        <_>
+          15 5 2 2 2.</_>
+        <_>
+          17 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 1 -1.</_>
+        <_>
+          16 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 2 -1.</_>
+        <_>
+          9 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 1 -1.</_>
+        <_>
+          16 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          2 1 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 4 -1.</_>
+        <_>
+          5 1 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 1 2 -1.</_>
+        <_>
+          0 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 2 -1.</_>
+        <_>
+          18 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 4 -1.</_>
+        <_>
+          17 0 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 4 -1.</_>
+        <_>
+          3 3 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 11 -1.</_>
+        <_>
+          2 4 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 4 -1.</_>
+        <_>
+          0 4 4 2 2.</_>
+        <_>
+          4 6 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 1 2 -1.</_>
+        <_>
+          4 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 4 -1.</_>
+        <_>
+          0 1 3 2 2.</_>
+        <_>
+          3 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 2 -1.</_>
+        <_>
+          3 5 2 1 2.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 1 -1.</_>
+        <_>
+          5 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 2 -1.</_>
+        <_>
+          8 15 1 1 2.</_>
+        <_>
+          9 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 2 -1.</_>
+        <_>
+          8 15 1 1 2.</_>
+        <_>
+          9 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 5 2 -1.</_>
+        <_>
+          2 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 8 -1.</_>
+        <_>
+          4 14 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 5 3 -1.</_>
+        <_>
+          8 8 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 18 6 2 -1.</_>
+        <_>
+          2 18 3 1 2.</_>
+        <_>
+          5 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 12 4 -1.</_>
+        <_>
+          6 17 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 1 4 -1.</_>
+        <_>
+          10 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 3 -1.</_>
+        <_>
+          9 10 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 8 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 19 14 -1.</_>
+        <_>
+          1 13 19 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 4 2 -1.</_>
+        <_>
+          16 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 8 -1.</_>
+        <_>
+          8 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 3 -1.</_>
+        <_>
+          7 8 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 4 -1.</_>
+        <_>
+          5 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 4 -1.</_>
+        <_>
+          8 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 10 -1.</_>
+        <_>
+          2 15 18 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 3 -1.</_>
+        <_>
+          7 9 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 7 2 -1.</_>
+        <_>
+          7 9 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 17 1 3 -1.</_>
+        <_>
+          5 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 13 2 -1.</_>
+        <_>
+          7 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 14 1 2 -1.</_>
+        <_>
+          3 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 4 -1.</_>
+        <_>
+          13 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 2 -1.</_>
+        <_>
+          13 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          6 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 9 12 -1.</_>
+        <_>
+          10 7 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 1 -1.</_>
+        <_>
+          16 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 9 -1.</_>
+        <_>
+          1 3 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 3 -1.</_>
+        <_>
+          3 15 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 1 2 -1.</_>
+        <_>
+          2 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 4 -1.</_>
+        <_>
+          11 2 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 6 -1.</_>
+        <_>
+          7 6 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 1 -1.</_>
+        <_>
+          18 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 5 -1.</_>
+        <_>
+          14 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 1 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 5 -1.</_>
+        <_>
+          12 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 14 3 2 -1.</_>
+        <_>
+          17 14 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 1 -1.</_>
+        <_>
+          6 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 6 -1.</_>
+        <_>
+          4 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 5 4 -1.</_>
+        <_>
+          8 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 2 2 -1.</_>
+        <_>
+          14 15 1 1 2.</_>
+        <_>
+          15 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 1 2 -1.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 3 -1.</_>
+        <_>
+          8 15 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 20 -1.</_>
+        <_>
+          19 10 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 1 -1.</_>
+        <_>
+          9 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 1 -1.</_>
+        <_>
+          15 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 1 -1.</_>
+        <_>
+          16 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 2 8 -1.</_>
+        <_>
+          18 11 1 4 2.</_>
+        <_>
+          19 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 4 -1.</_>
+        <_>
+          8 1 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 5 4 -1.</_>
+        <_>
+          5 1 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 15 -1.</_>
+        <_>
+          10 10 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 9 -1.</_>
+        <_>
+          7 5 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 10 3 -1.</_>
+        <_>
+          2 2 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 15 12 -1.</_>
+        <_>
+          7 9 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 6 -1.</_>
+        <_>
+          8 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 7 -1.</_>
+        <_>
+          8 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 9 4 -1.</_>
+        <_>
+          7 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 18 5 2 -1.</_>
+        <_>
+          15 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 4 -1.</_>
+        <_>
+          15 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 2 -1.</_>
+        <_>
+          6 15 1 1 2.</_>
+        <_>
+          7 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 2 -1.</_>
+        <_>
+          6 15 1 1 2.</_>
+        <_>
+          7 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 3 -1.</_>
+        <_>
+          10 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          9 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 15 -1.</_>
+        <_>
+          9 7 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 1 14 -1.</_>
+        <_>
+          17 13 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 3 -1.</_>
+        <_>
+          15 6 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 4 9 -1.</_>
+        <_>
+          13 7 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 2 -1.</_>
+        <_>
+          3 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 15 -1.</_>
+        <_>
+          0 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          10 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 9 2 -1.</_>
+        <_>
+          8 17 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 18 -1.</_>
+        <_>
+          7 11 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 10 -1.</_>
+        <_>
+          15 9 1 5 2.</_>
+        <_>
+          16 14 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 4 -1.</_>
+        <_>
+          14 9 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 2 -1.</_>
+        <_>
+          14 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 2 -1.</_>
+        <_>
+          18 5 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 2 -1.</_>
+        <_>
+          10 6 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 2 -1.</_>
+        <_>
+          18 4 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 7 4 -1.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 6 4 -1.</_>
+        <_>
+          1 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 2 6 -1.</_>
+        <_>
+          0 15 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 4 2 -1.</_>
+        <_>
+          10 13 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 2 4 -1.</_>
+        <_>
+          15 15 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 4 -1.</_>
+        <_>
+          8 5 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 3 -1.</_>
+        <_>
+          6 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 4 -1.</_>
+        <_>
+          3 2 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 2 3 -1.</_>
+        <_>
+          3 1 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 4 -1.</_>
+        <_>
+          1 2 4 2 2.</_>
+        <_>
+          5 4 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 4 -1.</_>
+        <_>
+          7 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 5 -1.</_>
+        <_>
+          7 5 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 3 -1.</_>
+        <_>
+          7 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 1 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 4 -1.</_>
+        <_>
+          7 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 9 2 -1.</_>
+        <_>
+          9 12 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 7 2 -1.</_>
+        <_>
+          5 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          12 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 2 -1.</_>
+        <_>
+          17 1 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 4 -1.</_>
+        <_>
+          14 2 3 2 2.</_>
+        <_>
+          17 4 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 6 -1.</_>
+        <_>
+          8 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 4 -1.</_>
+        <_>
+          11 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 3 -1.</_>
+        <_>
+          18 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 4 -1.</_>
+        <_>
+          7 1 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 8 -1.</_>
+        <_>
+          6 3 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 2 -1.</_>
+        <_>
+          2 0 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 5 -1.</_>
+        <_>
+          12 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 7 -1.</_>
+        <_>
+          8 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 8 -1.</_>
+        <_>
+          10 3 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 4 -1.</_>
+        <_>
+          7 2 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 1 2 -1.</_>
+        <_>
+          0 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 1 -1.</_>
+        <_>
+          18 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 3 4 -1.</_>
+        <_>
+          16 14 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 3 -1.</_>
+        <_>
+          4 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 5 -1.</_>
+        <_>
+          1 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 12 -1.</_>
+        <_>
+          4 14 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          17 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          17 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 4 -1.</_>
+        <_>
+          18 2 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 7 -1.</_>
+        <_>
+          4 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 3 -1.</_>
+        <_>
+          8 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 4 4 -1.</_>
+        <_>
+          13 8 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 5 2 -1.</_>
+        <_>
+          6 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 5 12 -1.</_>
+        <_>
+          1 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 3 -1.</_>
+        <_>
+          10 18 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 12 -1.</_>
+        <_>
+          13 4 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 8 1 -1.</_>
+        <_>
+          5 13 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 9 6 -1.</_>
+        <_>
+          5 4 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 1 2 -1.</_>
+        <_>
+          14 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 1 -1.</_>
+        <_>
+          8 1 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 2 -1.</_>
+        <_>
+          9 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 1 2 -1.</_>
+        <_>
+          0 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 8 -1.</_>
+        <_>
+          11 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 3 -1.</_>
+        <_>
+          6 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 11 -1.</_>
+        <_>
+          2 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 14 -1.</_>
+        <_>
+          2 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 3 -1.</_>
+        <_>
+          17 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 4 -1.</_>
+        <_>
+          19 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 1 -1.</_>
+        <_>
+          5 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 1 -1.</_>
+        <_>
+          7 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 10 -1.</_>
+        <_>
+          8 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 2 -1.</_>
+        <_>
+          14 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 1 12 -1.</_>
+        <_>
+          14 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 8 -1.</_>
+        <_>
+          11 5 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 3 -1.</_>
+        <_>
+          2 3 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 4 -1.</_>
+        <_>
+          0 3 3 2 2.</_>
+        <_>
+          3 5 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 1 -1.</_>
+        <_>
+          4 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 5 -1.</_>
+        <_>
+          13 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 3 -1.</_>
+        <_>
+          14 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 3 2 -1.</_>
+        <_>
+          0 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 2 -1.</_>
+        <_>
+          5 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 2 -1.</_>
+        <_>
+          6 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 7 -1.</_>
+        <_>
+          17 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 5 -1.</_>
+        <_>
+          15 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 14 -1.</_>
+        <_>
+          0 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 1 -1.</_>
+        <_>
+          18 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 1 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 12 -1.</_>
+        <_>
+          4 3 13 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 2 -1.</_>
+        <_>
+          13 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 3 -1.</_>
+        <_>
+          3 3 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 3 -1.</_>
+        <_>
+          10 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 6 -1.</_>
+        <_>
+          11 5 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 2 -1.</_>
+        <_>
+          11 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 4 -1.</_>
+        <_>
+          4 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 8 2 -1.</_>
+        <_>
+          9 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 9 1 8 -1.</_>
+        <_>
+          19 9 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 5 3 -1.</_>
+        <_>
+          0 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 15 -1.</_>
+        <_>
+          19 9 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 4 1 -1.</_>
+        <_>
+          8 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 4 -1.</_>
+        <_>
+          6 3 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 11 6 -1.</_>
+        <_>
+          4 3 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 4 -1.</_>
+        <_>
+          0 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 5 -1.</_>
+        <_>
+          2 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 4 -1.</_>
+        <_>
+          3 6 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 3 -1.</_>
+        <_>
+          3 18 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          13 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 3 2 -1.</_>
+        <_>
+          17 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 3 -1.</_>
+        <_>
+          8 8 5 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 3 -1.</_>
+        <_>
+          11 9 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 8 -1.</_>
+        <_>
+          0 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          10 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 8 -1.</_>
+        <_>
+          11 7 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 1 -1.</_>
+        <_>
+          13 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 11 4 -1.</_>
+        <_>
+          2 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 4 -1.</_>
+        <_>
+          0 4 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 2 -1.</_>
+        <_>
+          17 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 14 1 4 -1.</_>
+        <_>
+          19 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 4 -1.</_>
+        <_>
+          2 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 3 -1.</_>
+        <_>
+          2 14 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 4 3 -1.</_>
+        <_>
+          0 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 4 -1.</_>
+        <_>
+          9 4 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 1 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 5 -1.</_>
+        <_>
+          18 0 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 1 4 -1.</_>
+        <_>
+          14 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 2 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 8 -1.</_>
+        <_>
+          10 7 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 12 -1.</_>
+        <_>
+          10 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 3 -1.</_>
+        <_>
+          4 1 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 2 -1.</_>
+        <_>
+          18 1 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 9 2 -1.</_>
+        <_>
+          6 9 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 4 -1.</_>
+        <_>
+          7 9 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 4 -1.</_>
+        <_>
+          7 8 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 2 2 -1.</_>
+        <_>
+          9 18 1 1 2.</_>
+        <_>
+          10 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 6 2 -1.</_>
+        <_>
+          6 18 3 1 2.</_>
+        <_>
+          9 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 12 -1.</_>
+        <_>
+          5 8 1 6 2.</_>
+        <_>
+          6 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 8 -1.</_>
+        <_>
+          19 0 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 6 -1.</_>
+        <_>
+          1 13 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 4 -1.</_>
+        <_>
+          6 12 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 13 1 6 -1.</_>
+        <_>
+          18 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 4 4 -1.</_>
+        <_>
+          14 15 2 2 2.</_>
+        <_>
+          16 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 1 2 -1.</_>
+        <_>
+          4 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 4 -1.</_>
+        <_>
+          5 4 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 1 -1.</_>
+        <_>
+          3 2 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 5 -1.</_>
+        <_>
+          7 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 8 -1.</_>
+        <_>
+          8 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 4 -1.</_>
+        <_>
+          14 10 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 9 3 -1.</_>
+        <_>
+          8 16 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 6 6 -1.</_>
+        <_>
+          14 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 5 2 -1.</_>
+        <_>
+          9 17 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          8 10 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 5 -1.</_>
+        <_>
+          7 5 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 3 -1.</_>
+        <_>
+          16 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 6 -1.</_>
+        <_>
+          0 17 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 15 -1.</_>
+        <_>
+          9 6 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 1 -1.</_>
+        <_>
+          5 0 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 1 -1.</_>
+        <_>
+          6 0 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          5 0 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 3 -1.</_>
+        <_>
+          2 1 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 6 -1.</_>
+        <_>
+          7 2 5 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 4 -1.</_>
+        <_>
+          3 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 1 -1.</_>
+        <_>
+          15 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 9 -1.</_>
+        <_>
+          4 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 18 -1.</_>
+        <_>
+          6 6 5 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 12 1 3 -1.</_>
+        <_>
+          19 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 2 -1.</_>
+        <_>
+          19 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 7 12 -1.</_>
+        <_>
+          7 8 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 2 -1.</_>
+        <_>
+          15 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 4 -1.</_>
+        <_>
+          17 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 9 2 -1.</_>
+        <_>
+          13 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 10 1 -1.</_>
+        <_>
+          7 15 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 4 3 -1.</_>
+        <_>
+          14 14 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 3 -1.</_>
+        <_>
+          4 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          16 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 6 -1.</_>
+        <_>
+          12 7 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 9 -1.</_>
+        <_>
+          17 14 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 2 -1.</_>
+        <_>
+          17 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          17 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 2 18 -1.</_>
+        <_>
+          5 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 9 -1.</_>
+        <_>
+          7 9 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 1 -1.</_>
+        <_>
+          6 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 9 -1.</_>
+        <_>
+          10 8 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          0 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 3 -1.</_>
+        <_>
+          0 13 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 1 2 -1.</_>
+        <_>
+          1 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 2 -1.</_>
+        <_>
+          6 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 1 2 -1.</_>
+        <_>
+          2 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 3 -1.</_>
+        <_>
+          0 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 3 5 -1.</_>
+        <_>
+          16 7 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 2 1 -1.</_>
+        <_>
+          14 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 5 -1.</_>
+        <_>
+          6 4 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 5 -1.</_>
+        <_>
+          6 4 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 2 -1.</_>
+        <_>
+          18 6 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 3 -1.</_>
+        <_>
+          3 1 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 1 -1.</_>
+        <_>
+          12 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 3 -1.</_>
+        <_>
+          15 7 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 1 4 -1.</_>
+        <_>
+          2 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 2 -1.</_>
+        <_>
+          2 13 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 1 2 -1.</_>
+        <_>
+          12 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 4 -1.</_>
+        <_>
+          10 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 6 -1.</_>
+        <_>
+          13 8 2 3 2.</_>
+        <_>
+          15 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 3 -1.</_>
+        <_>
+          17 11 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          4 2 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 1 -1.</_>
+        <_>
+          9 0 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 2 -1.</_>
+        <_>
+          15 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 1 -1.</_>
+        <_>
+          17 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 3 -1.</_>
+        <_>
+          16 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 1 -1.</_>
+        <_>
+          18 7 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 4 -1.</_>
+        <_>
+          3 4 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 4 -1.</_>
+        <_>
+          16 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          6 5 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 6 -1.</_>
+        <_>
+          18 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 3 -1.</_>
+        <_>
+          9 10 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 4 -1.</_>
+        <_>
+          9 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 3 -1.</_>
+        <_>
+          10 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 3 3 -1.</_>
+        <_>
+          0 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 3 -1.</_>
+        <_>
+          16 6 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 1 6 -1.</_>
+        <_>
+          10 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 12 -1.</_>
+        <_>
+          12 3 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 14 -1.</_>
+        <_>
+          8 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 19 2 -1.</_>
+        <_>
+          1 18 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 4 -1.</_>
+        <_>
+          14 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 4 -1.</_>
+        <_>
+          3 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 12 -1.</_>
+        <_>
+          7 6 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 5 -1.</_>
+        <_>
+          2 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 6 -1.</_>
+        <_>
+          17 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 16 3 -1.</_>
+        <_>
+          8 16 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 8 1 -1.</_>
+        <_>
+          10 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 4 -1.</_>
+        <_>
+          4 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 9 -1.</_>
+        <_>
+          6 3 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 2 -1.</_>
+        <_>
+          2 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 1 -1.</_>
+        <_>
+          16 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 1 -1.</_>
+        <_>
+          17 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 1 2 -1.</_>
+        <_>
+          18 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 2 -1.</_>
+        <_>
+          5 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 3 1 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 3 -1.</_>
+        <_>
+          0 12 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 19 3 -1.</_>
+        <_>
+          1 15 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 5 -1.</_>
+        <_>
+          16 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 4 -1.</_>
+        <_>
+          14 2 3 2 2.</_>
+        <_>
+          17 4 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          16 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 3 4 -1.</_>
+        <_>
+          14 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 15 -1.</_>
+        <_>
+          17 5 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 14 3 -1.</_>
+        <_>
+          6 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 12 3 -1.</_>
+        <_>
+          6 17 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 16 2 -1.</_>
+        <_>
+          4 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 16 -1.</_>
+        <_>
+          7 7 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 3 -1.</_>
+        <_>
+          10 1 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 4 -1.</_>
+        <_>
+          13 3 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 3 2 -1.</_>
+        <_>
+          7 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 5 -1.</_>
+        <_>
+          3 2 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 3 -1.</_>
+        <_>
+          11 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 4 -1.</_>
+        <_>
+          10 0 5 2 2.</_>
+        <_>
+          15 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 3 -1.</_>
+        <_>
+          3 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 3 -1.</_>
+        <_>
+          3 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 2 -1.</_>
+        <_>
+          17 2 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 3 -1.</_>
+        <_>
+          3 2 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 5 -1.</_>
+        <_>
+          7 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 3 3 -1.</_>
+        <_>
+          5 18 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 3 3 -1.</_>
+        <_>
+          5 16 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 1 -1.</_>
+        <_>
+          3 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 2 -1.</_>
+        <_>
+          5 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 4 -1.</_>
+        <_>
+          7 1 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 8 -1.</_>
+        <_>
+          10 10 9 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 1 4 -1.</_>
+        <_>
+          16 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 2 1 -1.</_>
+        <_>
+          18 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 7 -1.</_>
+        <_>
+          18 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          8 10 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 6 -1.</_>
+        <_>
+          15 9 1 3 2.</_>
+        <_>
+          16 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 16 10 -1.</_>
+        <_>
+          1 11 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 19 8 -1.</_>
+        <_>
+          1 16 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 9 -1.</_>
+        <_>
+          8 7 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 9 -1.</_>
+        <_>
+          5 5 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 6 -1.</_>
+        <_>
+          14 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 2 -1.</_>
+        <_>
+          17 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 2 -1.</_>
+        <_>
+          2 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 19 -1.</_>
+        <_>
+          4 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 1 -1.</_>
+        <_>
+          5 14 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 1 -1.</_>
+        <_>
+          18 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 4 -1.</_>
+        <_>
+          11 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 5 -1.</_>
+        <_>
+          10 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 1 3 -1.</_>
+        <_>
+          2 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 2 3 -1.</_>
+        <_>
+          2 5 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 3 -1.</_>
+        <_>
+          6 15 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 2 -1.</_>
+        <_>
+          2 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 1 -1.</_>
+        <_>
+          3 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 5 -1.</_>
+        <_>
+          2 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 4 -1.</_>
+        <_>
+          3 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 1 -1.</_>
+        <_>
+          7 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 2 -1.</_>
+        <_>
+          17 4 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 2 1 -1.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 1 -1.</_>
+        <_>
+          18 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 3 -1.</_>
+        <_>
+          17 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 5 2 -1.</_>
+        <_>
+          2 18 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 3 -1.</_>
+        <_>
+          8 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 3 -1.</_>
+        <_>
+          16 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 5 2 -1.</_>
+        <_>
+          6 8 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 4 -1.</_>
+        <_>
+          11 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 3 -1.</_>
+        <_>
+          18 3 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 2 -1.</_>
+        <_>
+          16 5 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 3 2.</_>
+        <_>
+          17 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 10 4 -1.</_>
+        <_>
+          6 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 2 -1.</_>
+        <_>
+          5 7 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 3 -1.</_>
+        <_>
+          7 7 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 1 -1.</_>
+        <_>
+          18 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 2 -1.</_>
+        <_>
+          14 0 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 2 -1.</_>
+        <_>
+          18 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 1 -1.</_>
+        <_>
+          10 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          4 5 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 8 -1.</_>
+        <_>
+          17 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 16 1 -1.</_>
+        <_>
+          9 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 12 1 -1.</_>
+        <_>
+          10 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 4 1 -1.</_>
+        <_>
+          4 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 8 -1.</_>
+        <_>
+          12 7 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 1 2 -1.</_>
+        <_>
+          8 10 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 12 -1.</_>
+        <_>
+          16 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 3 -1.</_>
+        <_>
+          16 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 2 -1.</_>
+        <_>
+          4 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 3 6 -1.</_>
+        <_>
+          14 13 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 2 -1.</_>
+        <_>
+          2 12 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 1 9 -1.</_>
+        <_>
+          1 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 2 2 -1.</_>
+        <_>
+          2 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          12 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 6 -1.</_>
+        <_>
+          11 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 8 -1.</_>
+        <_>
+          12 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 14 -1.</_>
+        <_>
+          5 13 14 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 3 -1.</_>
+        <_>
+          6 5 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 1 3 -1.</_>
+        <_>
+          1 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 3 -1.</_>
+        <_>
+          4 2 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 3 -1.</_>
+        <_>
+          16 4 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 15 -1.</_>
+        <_>
+          15 8 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 4 6 -1.</_>
+        <_>
+          15 9 2 3 2.</_>
+        <_>
+          17 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 3 -1.</_>
+        <_>
+          15 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 6 9 -1.</_>
+        <_>
+          13 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 3 -1.</_>
+        <_>
+          15 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 7 3 -1.</_>
+        <_>
+          0 18 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 7 -1.</_>
+        <_>
+          17 9 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 3 -1.</_>
+        <_>
+          14 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 17 8 1 -1.</_>
+        <_>
+          16 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 2 4 -1.</_>
+        <_>
+          14 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 1 -1.</_>
+        <_>
+          8 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          5 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 9 2 -1.</_>
+        <_>
+          10 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 13 9 -1.</_>
+        <_>
+          5 6 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 5 2 -1.</_>
+        <_>
+          6 8 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 14 -1.</_>
+        <_>
+          9 5 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 10 -1.</_>
+        <_>
+          18 13 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 4 -1.</_>
+        <_>
+          9 1 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 7 -1.</_>
+        <_>
+          5 0 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 4 -1.</_>
+        <_>
+          11 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 2 -1.</_>
+        <_>
+          14 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 1 -1.</_>
+        <_>
+          16 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 6 -1.</_>
+        <_>
+          0 3 2 3 2.</_>
+        <_>
+          2 6 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 5 -1.</_>
+        <_>
+          3 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 1 3 -1.</_>
+        <_>
+          3 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 2 -1.</_>
+        <_>
+          4 14 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 16 7 -1.</_>
+        <_>
+          11 13 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 9 4 -1.</_>
+        <_>
+          5 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 3 -1.</_>
+        <_>
+          5 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 1 -1.</_>
+        <_>
+          5 0 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 4 -1.</_>
+        <_>
+          7 7 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 2 -1.</_>
+        <_>
+          18 4 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 3 -1.</_>
+        <_>
+          12 8 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 3 -1.</_>
+        <_>
+          6 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 14 -1.</_>
+        <_>
+          0 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 5 2 -1.</_>
+        <_>
+          14 13 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 5 -1.</_>
+        <_>
+          6 5 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 6 -1.</_>
+        <_>
+          0 10 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          15 10 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 15 14 2 -1.</_>
+        <_>
+          8 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 4 5 -1.</_>
+        <_>
+          4 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 3 -1.</_>
+        <_>
+          16 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 4 -1.</_>
+        <_>
+          7 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 20 -1.</_>
+        <_>
+          6 10 14 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 1 9 -1.</_>
+        <_>
+          13 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 1 4 -1.</_>
+        <_>
+          15 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 2 -1.</_>
+        <_>
+          14 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 3 2 -1.</_>
+        <_>
+          16 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 3 -1.</_>
+        <_>
+          17 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 6 -1.</_>
+        <_>
+          4 6 4 3 2.</_>
+        <_>
+          8 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 3 -1.</_>
+        <_>
+          6 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 2 -1.</_>
+        <_>
+          17 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 3 -1.</_>
+        <_>
+          4 7 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 3 -1.</_>
+        <_>
+          5 17 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 4 2 -1.</_>
+        <_>
+          17 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 2 5 -1.</_>
+        <_>
+          5 13 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 1 -1.</_>
+        <_>
+          1 8 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 15 9 5 -1.</_>
+        <_>
+          12 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 7 -1.</_>
+        <_>
+          16 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 1 -1.</_>
+        <_>
+          13 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 11 -1.</_>
+        <_>
+          16 3 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 1 -1.</_>
+        <_>
+          4 16 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 4 -1.</_>
+        <_>
+          14 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 2 -1.</_>
+        <_>
+          10 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 7 -1.</_>
+        <_>
+          10 1 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 4 -1.</_>
+        <_>
+          12 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 12 -1.</_>
+        <_>
+          10 12 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 8 -1.</_>
+        <_>
+          17 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 2 -1.</_>
+        <_>
+          7 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 8 -1.</_>
+        <_>
+          5 1 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 6 2 -1.</_>
+        <_>
+          7 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 6 -1.</_>
+        <_>
+          8 0 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 14 -1.</_>
+        <_>
+          3 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 9 -1.</_>
+        <_>
+          18 0 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 5 -1.</_>
+        <_>
+          7 6 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 5 -1.</_>
+        <_>
+          7 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 9 11 -1.</_>
+        <_>
+          8 8 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 3 4 -1.</_>
+        <_>
+          8 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 6 -1.</_>
+        <_>
+          11 12 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 2 -1.</_>
+        <_>
+          10 17 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 0 4 2 2.</_>
+        <_>
+          16 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 2 -1.</_>
+        <_>
+          19 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 1 -1.</_>
+        <_>
+          19 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 3 -1.</_>
+        <_>
+          4 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 1 -1.</_>
+        <_>
+          6 6 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 3 -1.</_>
+        <_>
+          0 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 5 -1.</_>
+        <_>
+          15 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 7 -1.</_>
+        <_>
+          16 5 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 6 -1.</_>
+        <_>
+          15 9 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 4 -1.</_>
+        <_>
+          4 8 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 2 -1.</_>
+        <_>
+          18 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 2 -1.</_>
+        <_>
+          14 0 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 1 -1.</_>
+        <_>
+          8 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 3 -1.</_>
+        <_>
+          18 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 4 4 -1.</_>
+        <_>
+          13 4 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 17 4 -1.</_>
+        <_>
+          0 9 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 1 4 -1.</_>
+        <_>
+          11 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 8 2 -1.</_>
+        <_>
+          12 8 4 1 2.</_>
+        <_>
+          16 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 1 -1.</_>
+        <_>
+          14 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 5 -1.</_>
+        <_>
+          5 8 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 1 -1.</_>
+        <_>
+          12 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 1 -1.</_>
+        <_>
+          6 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          0 13 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 8 -1.</_>
+        <_>
+          9 5 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 2 -1.</_>
+        <_>
+          6 2 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 4 -1.</_>
+        <_>
+          7 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 4 -1.</_>
+        <_>
+          3 1 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 7 -1.</_>
+        <_>
+          3 1 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 3 -1.</_>
+        <_>
+          7 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 3 -1.</_>
+        <_>
+          5 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 7 -1.</_>
+        <_>
+          14 0 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 6 -1.</_>
+        <_>
+          10 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 1 -1.</_>
+        <_>
+          1 14 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 4 -1.</_>
+        <_>
+          6 10 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 17 10 3 -1.</_>
+        <_>
+          5 18 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 4 -1.</_>
+        <_>
+          7 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 7 3 -1.</_>
+        <_>
+          8 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 3 -1.</_>
+        <_>
+          7 8 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 9 6 -1.</_>
+        <_>
+          7 5 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 1 2 -1.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 1 -1.</_>
+        <_>
+          17 12 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 3 -1.</_>
+        <_>
+          5 1 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 1 -1.</_>
+        <_>
+          14 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 10 -1.</_>
+        <_>
+          15 7 1 5 2.</_>
+        <_>
+          16 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 20 -1.</_>
+        <_>
+          6 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 9 16 -1.</_>
+        <_>
+          4 8 9 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 3 3 -1.</_>
+        <_>
+          3 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 6 -1.</_>
+        <_>
+          6 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 1 2 -1.</_>
+        <_>
+          5 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 5 -1.</_>
+        <_>
+          6 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 7 -1.</_>
+        <_>
+          17 9 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 7 -1.</_>
+        <_>
+          16 4 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 1 15 -1.</_>
+        <_>
+          18 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 1 -1.</_>
+        <_>
+          6 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 12 -1.</_>
+        <_>
+          8 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 4 2 -1.</_>
+        <_>
+          14 6 2 1 2.</_>
+        <_>
+          16 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 2 2 -1.</_>
+        <_>
+          5 18 1 1 2.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 2 2 -1.</_>
+        <_>
+          8 18 1 1 2.</_>
+        <_>
+          9 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 2 2 -1.</_>
+        <_>
+          3 18 1 1 2.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 6 -1.</_>
+        <_>
+          7 5 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 3 -1.</_>
+        <_>
+          6 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 2 -1.</_>
+        <_>
+          11 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 8 -1.</_>
+        <_>
+          11 5 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 12 -1.</_>
+        <_>
+          16 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 10 4 -1.</_>
+        <_>
+          9 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 1 20 -1.</_>
+        <_>
+          12 10 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 3 -1.</_>
+        <_>
+          9 10 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 2 -1.</_>
+        <_>
+          6 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 5 -1.</_>
+        <_>
+          5 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 3 -1.</_>
+        <_>
+          3 11 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 12 -1.</_>
+        <_>
+          1 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 14 -1.</_>
+        <_>
+          9 1 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 7 3 -1.</_>
+        <_>
+          5 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 2 -1.</_>
+        <_>
+          15 7 2 1 2.</_>
+        <_>
+          17 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 1 -1.</_>
+        <_>
+          9 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 6 -1.</_>
+        <_>
+          1 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 5 3 -1.</_>
+        <_>
+          8 5 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 2 -1.</_>
+        <_>
+          14 6 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 2 -1.</_>
+        <_>
+          9 16 1 1 2.</_>
+        <_>
+          10 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 8 -1.</_>
+        <_>
+          0 10 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 7 -1.</_>
+        <_>
+          13 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 5 3 -1.</_>
+        <_>
+          5 7 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 2 2 -1.</_>
+        <_>
+          11 18 1 1 2.</_>
+        <_>
+          12 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 2 -1.</_>
+        <_>
+          14 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 2 -1.</_>
+        <_>
+          2 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 6 -1.</_>
+        <_>
+          3 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 4 -1.</_>
+        <_>
+          6 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 4 -1.</_>
+        <_>
+          9 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 2 -1.</_>
+        <_>
+          16 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          5 15 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 1 8 -1.</_>
+        <_>
+          10 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          9 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 1 3 -1.</_>
+        <_>
+          0 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 1 -1.</_>
+        <_>
+          18 6 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 1 4 -1.</_>
+        <_>
+          0 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 2 -1.</_>
+        <_>
+          9 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 1 -1.</_>
+        <_>
+          6 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 4 -1.</_>
+        <_>
+          6 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 3 -1.</_>
+        <_>
+          0 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 1 -1.</_>
+        <_>
+          2 8 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 8 -1.</_>
+        <_>
+          5 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 4 -1.</_>
+        <_>
+          7 3 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 4 -1.</_>
+        <_>
+          7 3 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 4 -1.</_>
+        <_>
+          18 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 3 -1.</_>
+        <_>
+          4 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 1 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 3 -1.</_>
+        <_>
+          5 3 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 2 -1.</_>
+        <_>
+          13 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 3 -1.</_>
+        <_>
+          18 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 4 -1.</_>
+        <_>
+          18 1 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 4 -1.</_>
+        <_>
+          17 2 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 9 -1.</_>
+        <_>
+          8 9 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 5 -1.</_>
+        <_>
+          7 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 4 -1.</_>
+        <_>
+          5 4 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 1 2 -1.</_>
+        <_>
+          0 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 5 4 -1.</_>
+        <_>
+          15 14 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 11 1 2 -1.</_>
+        <_>
+          19 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 2 -1.</_>
+        <_>
+          13 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 1 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 2 3 -1.</_>
+        <_>
+          15 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 3 -1.</_>
+        <_>
+          13 5 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 1 3 -1.</_>
+        <_>
+          3 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 6 2 -1.</_>
+        <_>
+          2 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 3 3 -1.</_>
+        <_>
+          2 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 19 -1.</_>
+        <_>
+          17 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 4 -1.</_>
+        <_>
+          7 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 6 -1.</_>
+        <_>
+          7 8 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 2 -1.</_>
+        <_>
+          17 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 2 -1.</_>
+        <_>
+          14 1 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          0 1 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 2 -1.</_>
+        <_>
+          18 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 3 -1.</_>
+        <_>
+          18 3 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 3 -1.</_>
+        <_>
+          2 1 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 1 6 -1.</_>
+        <_>
+          12 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 4 -1.</_>
+        <_>
+          7 5 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 2 -1.</_>
+        <_>
+          9 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 2 -1.</_>
+        <_>
+          16 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 5 6 -1.</_>
+        <_>
+          15 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 1 3 -1.</_>
+        <_>
+          2 2 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 2 -1.</_>
+        <_>
+          15 14 1 1 2.</_>
+        <_>
+          16 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 2 -1.</_>
+        <_>
+          15 14 1 1 2.</_>
+        <_>
+          16 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 6 -1.</_>
+        <_>
+          15 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 3 -1.</_>
+        <_>
+          14 4 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 10 2 -1.</_>
+        <_>
+          10 15 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 1 -1.</_>
+        <_>
+          10 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 4 2 -1.</_>
+        <_>
+          2 14 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 14 3 3 -1.</_>
+        <_>
+          16 15 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 14 1 4 -1.</_>
+        <_>
+          17 15 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 5 3 -1.</_>
+        <_>
+          1 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 1 2 -1.</_>
+        <_>
+          3 12 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 4 -1.</_>
+        <_>
+          18 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 1 2 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 2 -1.</_>
+        <_>
+          1 15 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 3 -1.</_>
+        <_>
+          15 3 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 2 4 -1.</_>
+        <_>
+          16 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 3 -1.</_>
+        <_>
+          19 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 6 -1.</_>
+        <_>
+          12 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 3 -1.</_>
+        <_>
+          5 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 12 -1.</_>
+        <_>
+          2 8 2 6 2.</_>
+        <_>
+          4 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 1 -1.</_>
+        <_>
+          12 5 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 5 -1.</_>
+        <_>
+          13 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 3 -1.</_>
+        <_>
+          13 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 18 1 2 -1.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 3 -1.</_>
+        <_>
+          19 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 4 -1.</_>
+        <_>
+          15 9 1 2 2.</_>
+        <_>
+          16 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 3 -1.</_>
+        <_>
+          16 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 3 -1.</_>
+        <_>
+          4 1 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 3 -1.</_>
+        <_>
+          12 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 1 -1.</_>
+        <_>
+          14 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 4 -1.</_>
+        <_>
+          0 2 3 2 2.</_>
+        <_>
+          3 4 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 4 -1.</_>
+        <_>
+          0 9 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          8 7 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 1 3 -1.</_>
+        <_>
+          3 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 4 -1.</_>
+        <_>
+          0 2 2 2 2.</_>
+        <_>
+          2 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 3 -1.</_>
+        <_>
+          6 1 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 3 -1.</_>
+        <_>
+          19 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 3 -1.</_>
+        <_>
+          7 7 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 1 4 -1.</_>
+        <_>
+          6 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 1 -1.</_>
+        <_>
+          15 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 6 -1.</_>
+        <_>
+          15 5 1 3 2.</_>
+        <_>
+          16 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          6 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 2 -1.</_>
+        <_>
+          6 10 1 1 2.</_>
+        <_>
+          7 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 2 -1.</_>
+        <_>
+          6 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 4 -1.</_>
+        <_>
+          12 10 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 3 10 -1.</_>
+        <_>
+          0 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 15 9 -1.</_>
+        <_>
+          8 6 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 18 -1.</_>
+        <_>
+          8 1 4 9 2.</_>
+        <_>
+          12 10 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 11 -1.</_>
+        <_>
+          4 6 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 3 -1.</_>
+        <_>
+          12 8 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 2 3 -1.</_>
+        <_>
+          16 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 5 -1.</_>
+        <_>
+          5 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 2 2 -1.</_>
+        <_>
+          6 18 1 1 2.</_>
+        <_>
+          7 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 9 -1.</_>
+        <_>
+          16 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 5 -1.</_>
+        <_>
+          8 9 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 3 15 -1.</_>
+        <_>
+          16 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 2 16 -1.</_>
+        <_>
+          14 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 2 -1.</_>
+        <_>
+          12 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 6 -1.</_>
+        <_>
+          19 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 6 -1.</_>
+        <_>
+          5 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 3 -1.</_>
+        <_>
+          5 4 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 1 -1.</_>
+        <_>
+          18 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 4 -1.</_>
+        <_>
+          8 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 2 2 -1.</_>
+        <_>
+          0 18 1 1 2.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 4 -1.</_>
+        <_>
+          0 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 3 -1.</_>
+        <_>
+          16 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 16 -1.</_>
+        <_>
+          15 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 1 -1.</_>
+        <_>
+          16 5 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 4 2 -1.</_>
+        <_>
+          14 6 2 1 2.</_>
+        <_>
+          16 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 5 3 -1.</_>
+        <_>
+          15 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 20 -1.</_>
+        <_>
+          2 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 9 -1.</_>
+        <_>
+          2 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 4 1 -1.</_>
+        <_>
+          3 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 5 2 -1.</_>
+        <_>
+          2 0 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 1 -1.</_>
+        <_>
+          8 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 8 -1.</_>
+        <_>
+          5 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 2 -1.</_>
+        <_>
+          10 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 7 -1.</_>
+        <_>
+          10 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 11 3 -1.</_>
+        <_>
+          0 18 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 5 4 -1.</_>
+        <_>
+          6 15 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 1 2 -1.</_>
+        <_>
+          3 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 11 2 -1.</_>
+        <_>
+          2 8 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 6 -1.</_>
+        <_>
+          7 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 3 -1.</_>
+        <_>
+          14 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 1 -1.</_>
+        <_>
+          10 2 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 3 -1.</_>
+        <_>
+          12 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 7 4 -1.</_>
+        <_>
+          11 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 11 12 -1.</_>
+        <_>
+          5 12 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 3 -1.</_>
+        <_>
+          13 9 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 15 6 -1.</_>
+        <_>
+          3 4 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 9 -1.</_>
+        <_>
+          4 0 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 2 2 -1.</_>
+        <_>
+          8 18 1 1 2.</_>
+        <_>
+          9 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 1 -1.</_>
+        <_>
+          16 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 2 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 6 -1.</_>
+        <_>
+          13 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 3 6 -1.</_>
+        <_>
+          16 7 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 5 3 -1.</_>
+        <_>
+          14 8 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 4 -1.</_>
+        <_>
+          17 12 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 5 -1.</_>
+        <_>
+          17 11 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 9 3 -1.</_>
+        <_>
+          13 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 4 -1.</_>
+        <_>
+          5 9 1 2 2.</_>
+        <_>
+          6 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 8 -1.</_>
+        <_>
+          19 6 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 15 -1.</_>
+        <_>
+          19 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 12 2 -1.</_>
+        <_>
+          14 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 10 -1.</_>
+        <_>
+          19 1 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 4 -1.</_>
+        <_>
+          6 5 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 3 -1.</_>
+        <_>
+          5 5 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 1 -1.</_>
+        <_>
+          11 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 3 -1.</_>
+        <_>
+          0 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 1 -1.</_>
+        <_>
+          9 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 8 8 -1.</_>
+        <_>
+          12 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 7 -1.</_>
+        <_>
+          11 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 4 4 -1.</_>
+        <_>
+          10 8 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 3 -1.</_>
+        <_>
+          4 6 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 3 -1.</_>
+        <_>
+          5 10 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 6 -1.</_>
+        <_>
+          10 6 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 10 5 -1.</_>
+        <_>
+          9 3 5 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 2 -1.</_>
+        <_>
+          16 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 8 10 -1.</_>
+        <_>
+          8 8 4 5 2.</_>
+        <_>
+          12 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 3 -1.</_>
+        <_>
+          15 1 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 18 1 2 -1.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 7 2 -1.</_>
+        <_>
+          13 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 4 -1.</_>
+        <_>
+          4 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 2 4 -1.</_>
+        <_>
+          2 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 4 -1.</_>
+        <_>
+          1 3 2 2 2.</_>
+        <_>
+          3 5 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 12 -1.</_>
+        <_>
+          0 6 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 4 -1.</_>
+        <_>
+          1 1 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 3 14 -1.</_>
+        <_>
+          15 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 2 -1.</_>
+        <_>
+          19 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 6 -1.</_>
+        <_>
+          3 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 3 -1.</_>
+        <_>
+          9 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 1 -1.</_>
+        <_>
+          18 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 12 3 -1.</_>
+        <_>
+          11 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 3 3 -1.</_>
+        <_>
+          1 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 8 2 -1.</_>
+        <_>
+          11 17 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 4 2 -1.</_>
+        <_>
+          13 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 6 3 -1.</_>
+        <_>
+          13 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 4 -1.</_>
+        <_>
+          6 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 6 -1.</_>
+        <_>
+          7 10 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 5 -1.</_>
+        <_>
+          8 4 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 1 -1.</_>
+        <_>
+          14 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 2 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_>
+        <_>
+          17 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 1 -1.</_>
+        <_>
+          2 1 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 5 10 -1.</_>
+        <_>
+          3 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 2 -1.</_>
+        <_>
+          4 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 8 2 -1.</_>
+        <_>
+          10 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 2 3 -1.</_>
+        <_>
+          14 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 1 10 -1.</_>
+        <_>
+          11 6 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 2 -1.</_>
+        <_>
+          11 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 2 -1.</_>
+        <_>
+          6 3 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 10 -1.</_>
+        <_>
+          15 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 2 -1.</_>
+        <_>
+          18 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 3 -1.</_>
+        <_>
+          14 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 2 -1.</_>
+        <_>
+          2 0 8 1 2.</_>
+        <_>
+          10 1 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 8 -1.</_>
+        <_>
+          0 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 2 2 -1.</_>
+        <_>
+          8 16 1 1 2.</_>
+        <_>
+          9 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 2 -1.</_>
+        <_>
+          6 0 6 1 2.</_>
+        <_>
+          12 1 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 3 -1.</_>
+        <_>
+          2 8 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 13 2 -1.</_>
+        <_>
+          2 2 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 13 -1.</_>
+        <_>
+          5 7 10 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 2 -1.</_>
+        <_>
+          15 10 2 1 2.</_>
+        <_>
+          17 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 6 -1.</_>
+        <_>
+          16 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 1 3 -1.</_>
+        <_>
+          16 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 9 -1.</_>
+        <_>
+          0 3 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 6 4 -1.</_>
+        <_>
+          0 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 6 -1.</_>
+        <_>
+          14 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 5 -1.</_>
+        <_>
+          17 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 8 -1.</_>
+        <_>
+          9 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 5 4 -1.</_>
+        <_>
+          13 12 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 3 -1.</_>
+        <_>
+          15 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 1 -1.</_>
+        <_>
+          8 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 6 -1.</_>
+        <_>
+          17 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 2 -1.</_>
+        <_>
+          10 3 5 1 2.</_>
+        <_>
+          15 4 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 1 -1.</_>
+        <_>
+          8 1 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 5 4 -1.</_>
+        <_>
+          13 4 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 4 -1.</_>
+        <_>
+          5 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 5 -1.</_>
+        <_>
+          13 1 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 7 3 -1.</_>
+        <_>
+          9 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 16 -1.</_>
+        <_>
+          19 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 3 -1.</_>
+        <_>
+          8 0 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 3 -1.</_>
+        <_>
+          12 0 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 5 -1.</_>
+        <_>
+          13 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 5 8 -1.</_>
+        <_>
+          12 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 4 -1.</_>
+        <_>
+          5 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 3 -1.</_>
+        <_>
+          12 7 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 1 -1.</_>
+        <_>
+          11 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 5 -1.</_>
+        <_>
+          11 6 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 4 2 -1.</_>
+        <_>
+          17 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 6 -1.</_>
+        <_>
+          13 9 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 3 -1.</_>
+        <_>
+          4 1 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 3 -1.</_>
+        <_>
+          2 3 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 2 -1.</_>
+        <_>
+          3 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 2 -1.</_>
+        <_>
+          19 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 2 -1.</_>
+        <_>
+          8 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 9 2 -1.</_>
+        <_>
+          7 8 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 11 6 -1.</_>
+        <_>
+          6 13 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 5 -1.</_>
+        <_>
+          5 8 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 3 -1.</_>
+        <_>
+          10 12 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 14 18 -1.</_>
+        <_>
+          9 2 7 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 1 8 -1.</_>
+        <_>
+          8 5 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 2 -1.</_>
+        <_>
+          2 14 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 3 -1.</_>
+        <_>
+          7 14 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 3 -1.</_>
+        <_>
+          2 3 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 1 -1.</_>
+        <_>
+          6 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 9 1 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 3 -1.</_>
+        <_>
+          6 3 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 5 -1.</_>
+        <_>
+          5 0 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 2 -1.</_>
+        <_>
+          9 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 1 -1.</_>
+        <_>
+          5 0 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 4 -1.</_>
+        <_>
+          9 5 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 1 2 -1.</_>
+        <_>
+          18 4 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 4 -1.</_>
+        <_>
+          11 3 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 2 -1.</_>
+        <_>
+          8 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 2 -1.</_>
+        <_>
+          3 15 1 1 2.</_>
+        <_>
+          4 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 2 -1.</_>
+        <_>
+          3 15 1 1 2.</_>
+        <_>
+          4 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 4 -1.</_>
+        <_>
+          9 14 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 4 -1.</_>
+        <_>
+          9 14 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 17 1 3 -1.</_>
+        <_>
+          14 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 2 -1.</_>
+        <_>
+          15 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 3 2 -1.</_>
+        <_>
+          13 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 6 2 -1.</_>
+        <_>
+          13 18 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 2 1 -1.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 4 -1.</_>
+        <_>
+          2 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 3 -1.</_>
+        <_>
+          4 2 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 1 2 -1.</_>
+        <_>
+          3 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 2 -1.</_>
+        <_>
+          8 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 7 2 -1.</_>
+        <_>
+          2 6 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 3 -1.</_>
+        <_>
+          3 0 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 4 -1.</_>
+        <_>
+          12 5 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 17 -1.</_>
+        <_>
+          18 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 2 -1.</_>
+        <_>
+          7 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 8 -1.</_>
+        <_>
+          19 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 3 -1.</_>
+        <_>
+          14 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 2 -1.</_>
+        <_>
+          3 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 4 -1.</_>
+        <_>
+          15 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 2 -1.</_>
+        <_>
+          12 8 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 2 -1.</_>
+        <_>
+          9 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 1 -1.</_>
+        <_>
+          8 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 10 -1.</_>
+        <_>
+          13 3 1 5 2.</_>
+        <_>
+          14 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 4 -1.</_>
+        <_>
+          18 1 1 2 2.</_>
+        <_>
+          19 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 8 -1.</_>
+        <_>
+          16 3 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 14 -1.</_>
+        <_>
+          17 3 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          9 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 3 -1.</_>
+        <_>
+          7 10 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 3 -1.</_>
+        <_>
+          11 14 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 4 -1.</_>
+        <_>
+          6 1 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 3 1 -1.</_>
+        <_>
+          16 15 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 2 -1.</_>
+        <_>
+          4 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 1 2 -1.</_>
+        <_>
+          0 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 4 -1.</_>
+        <_>
+          11 12 1 2 2.</_>
+        <_>
+          12 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 8 -1.</_>
+        <_>
+          11 9 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 3 -1.</_>
+        <_>
+          6 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 2 -1.</_>
+        <_>
+          11 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 14 2 -1.</_>
+        <_>
+          6 17 7 1 2.</_>
+        <_>
+          13 18 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 8 2 -1.</_>
+        <_>
+          2 18 4 1 2.</_>
+        <_>
+          6 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 4 2 -1.</_>
+        <_>
+          15 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 15 1 3 -1.</_>
+        <_>
+          18 16 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 6 -1.</_>
+        <_>
+          16 8 2 3 2.</_>
+        <_>
+          18 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 2 -1.</_>
+        <_>
+          6 17 1 1 2.</_>
+        <_>
+          7 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 3 -1.</_>
+        <_>
+          5 9 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 18 -1.</_>
+        <_>
+          4 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 10 4 -1.</_>
+        <_>
+          7 5 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 6 -1.</_>
+        <_>
+          3 9 2 3 2.</_>
+        <_>
+          5 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 7 -1.</_>
+        <_>
+          12 3 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 1 -1.</_>
+        <_>
+          15 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 12 -1.</_>
+        <_>
+          17 7 1 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          6 13 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 17 6 -1.</_>
+        <_>
+          0 3 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 2 -1.</_>
+        <_>
+          6 18 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 2 -1.</_>
+        <_>
+          2 15 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 6 -1.</_>
+        <_>
+          19 1 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 4 -1.</_>
+        <_>
+          11 7 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 3 -1.</_>
+        <_>
+          7 11 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 8 -1.</_>
+        <_>
+          6 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 2 -1.</_>
+        <_>
+          2 8 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 5 -1.</_>
+        <_>
+          4 9 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 3 -1.</_>
+        <_>
+          7 8 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 3 10 -1.</_>
+        <_>
+          3 8 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 9 -1.</_>
+        <_>
+          4 5 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 3 -1.</_>
+        <_>
+          8 8 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 4 3 -1.</_>
+        <_>
+          2 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 1 -1.</_>
+        <_>
+          5 12 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 3 -1.</_>
+        <_>
+          10 10 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 1 2 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 2 2 -1.</_>
+        <_>
+          0 18 1 1 2.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          8 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 6 -1.</_>
+        <_>
+          12 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 1 4 -1.</_>
+        <_>
+          5 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 4 1 -1.</_>
+        <_>
+          10 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 4 4 -1.</_>
+        <_>
+          15 1 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 3 -1.</_>
+        <_>
+          3 0 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 3 -1.</_>
+        <_>
+          2 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 2 -1.</_>
+        <_>
+          2 12 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 1 -1.</_>
+        <_>
+          6 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 3 -1.</_>
+        <_>
+          10 7 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 3 -1.</_>
+        <_>
+          15 15 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 1 3 -1.</_>
+        <_>
+          11 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 9 -1.</_>
+        <_>
+          0 9 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 10 -1.</_>
+        <_>
+          10 9 9 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 5 10 -1.</_>
+        <_>
+          12 8 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 14 -1.</_>
+        <_>
+          1 13 12 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 1 -1.</_>
+        <_>
+          13 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 3 -1.</_>
+        <_>
+          0 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 2 1 -1.</_>
+        <_>
+          1 11 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 5 -1.</_>
+        <_>
+          16 5 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 4 -1.</_>
+        <_>
+          16 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 4 -1.</_>
+        <_>
+          17 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 1 2 -1.</_>
+        <_>
+          18 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 1 -1.</_>
+        <_>
+          6 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 12 2 -1.</_>
+        <_>
+          7 2 6 1 2.</_>
+        <_>
+          13 3 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 6 -1.</_>
+        <_>
+          9 0 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 3 -1.</_>
+        <_>
+          3 1 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 19 4 1 -1.</_>
+        <_>
+          14 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          5 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 2 -1.</_>
+        <_>
+          15 0 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 12 -1.</_>
+        <_>
+          18 5 1 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 2 -1.</_>
+        <_>
+          5 0 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 12 2 -1.</_>
+        <_>
+          10 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 2 -1.</_>
+        <_>
+          10 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 6 -1.</_>
+        <_>
+          10 4 5 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 5 -1.</_>
+        <_>
+          8 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 3 3 -1.</_>
+        <_>
+          16 3 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 6 -1.</_>
+        <_>
+          4 4 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 1 -1.</_>
+        <_>
+          15 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 4 6 -1.</_>
+        <_>
+          3 8 2 3 2.</_>
+        <_>
+          5 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 10 -1.</_>
+        <_>
+          2 12 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 9 16 -1.</_>
+        <_>
+          10 3 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 1 6 -1.</_>
+        <_>
+          13 11 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 2 2 -1.</_>
+        <_>
+          2 11 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 3 -1.</_>
+        <_>
+          10 5 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 4 -1.</_>
+        <_>
+          13 15 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 3 -1.</_>
+        <_>
+          4 2 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 3 5 -1.</_>
+        <_>
+          1 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 6 -1.</_>
+        <_>
+          3 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 4 -1.</_>
+        <_>
+          4 10 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 20 -1.</_>
+        <_>
+          3 10 12 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 2 2 -1.</_>
+        <_>
+          1 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 8 -1.</_>
+        <_>
+          17 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 4 -1.</_>
+        <_>
+          17 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 6 -1.</_>
+        <_>
+          0 0 1 3 2.</_>
+        <_>
+          1 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 5 -1.</_>
+        <_>
+          17 11 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 14 12 3 -1.</_>
+        <_>
+          12 15 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          8 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 3 -1.</_>
+        <_>
+          4 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 3 3 -1.</_>
+        <_>
+          0 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 1 14 -1.</_>
+        <_>
+          14 3 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 1 -1.</_>
+        <_>
+          10 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 8 1 -1.</_>
+        <_>
+          10 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 2 -1.</_>
+        <_>
+          17 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 4 -1.</_>
+        <_>
+          14 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 1 3 -1.</_>
+        <_>
+          0 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 1 3 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 17 -1.</_>
+        <_>
+          16 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 6 4 -1.</_>
+        <_>
+          13 15 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 1 -1.</_>
+        <_>
+          14 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 1 4 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 1 10 -1.</_>
+        <_>
+          9 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 14 -1.</_>
+        <_>
+          8 6 8 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 11 -1.</_>
+        <_>
+          3 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 6 -1.</_>
+        <_>
+          5 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 9 -1.</_>
+        <_>
+          15 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 6 -1.</_>
+        <_>
+          10 13 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 7 -1.</_>
+        <_>
+          13 5 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 1 2 -1.</_>
+        <_>
+          18 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 1 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 15 3 -1.</_>
+        <_>
+          1 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 5 -1.</_>
+        <_>
+          4 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 3 -1.</_>
+        <_>
+          6 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 5 -1.</_>
+        <_>
+          9 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 5 -1.</_>
+        <_>
+          14 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 2 -1.</_>
+        <_>
+          8 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 12 4 -1.</_>
+        <_>
+          2 12 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 3 -1.</_>
+        <_>
+          2 6 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 6 -1.</_>
+        <_>
+          9 8 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 12 -1.</_>
+        <_>
+          7 9 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 1 3 -1.</_>
+        <_>
+          11 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 5 9 -1.</_>
+        <_>
+          11 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 1 -1.</_>
+        <_>
+          11 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 6 -1.</_>
+        <_>
+          2 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 3 -1.</_>
+        <_>
+          7 6 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 3 -1.</_>
+        <_>
+          4 1 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 3 -1.</_>
+        <_>
+          12 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 4 -1.</_>
+        <_>
+          12 2 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 6 -1.</_>
+        <_>
+          4 10 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 4 -1.</_>
+        <_>
+          17 1 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 2 -1.</_>
+        <_>
+          10 0 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 2 -1.</_>
+        <_>
+          2 0 9 1 2.</_>
+        <_>
+          11 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 2 -1.</_>
+        <_>
+          18 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 3 -1.</_>
+        <_>
+          4 3 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 20 -1.</_>
+        <_>
+          19 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 5 -1.</_>
+        <_>
+          17 12 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          10 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 3 2 -1.</_>
+        <_>
+          16 12 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 2 -1.</_>
+        <_>
+          13 11 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 17 -1.</_>
+        <_>
+          1 1 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 3 -1.</_>
+        <_>
+          3 5 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 8 -1.</_>
+        <_>
+          18 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 2 -1.</_>
+        <_>
+          7 4 6 1 2.</_>
+        <_>
+          13 5 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 6 2 -1.</_>
+        <_>
+          9 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          5 1 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 1 -1.</_>
+        <_>
+          15 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 10 -1.</_>
+        <_>
+          10 4 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 1 3 -1.</_>
+        <_>
+          2 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 3 -1.</_>
+        <_>
+          3 13 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 4 1 -1.</_>
+        <_>
+          18 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 2 -1.</_>
+        <_>
+          4 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 3 -1.</_>
+        <_>
+          10 9 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 6 -1.</_>
+        <_>
+          12 4 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 1 -1.</_>
+        <_>
+          3 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 3 -1.</_>
+        <_>
+          17 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 4 -1.</_>
+        <_>
+          15 9 1 2 2.</_>
+        <_>
+          16 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 4 -1.</_>
+        <_>
+          4 11 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 3 -1.</_>
+        <_>
+          15 6 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 4 -1.</_>
+        <_>
+          17 13 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 15 -1.</_>
+        <_>
+          18 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 12 -1.</_>
+        <_>
+          13 4 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 2 -1.</_>
+        <_>
+          5 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 18 -1.</_>
+        <_>
+          3 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          6 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 4 -1.</_>
+        <_>
+          8 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 1 -1.</_>
+        <_>
+          16 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 2 -1.</_>
+        <_>
+          5 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 6 1 -1.</_>
+        <_>
+          4 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 6 2 -1.</_>
+        <_>
+          8 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 2 -1.</_>
+        <_>
+          10 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 1 -1.</_>
+        <_>
+          12 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 18 10 1 2.</_>
+        <_>
+          10 19 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 1 2 -1.</_>
+        <_>
+          15 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 2 1 -1.</_>
+        <_>
+          18 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 1 -1.</_>
+        <_>
+          17 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 2 -1.</_>
+        <_>
+          19 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 2 -1.</_>
+        <_>
+          2 18 9 1 2.</_>
+        <_>
+          11 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 1 3 -1.</_>
+        <_>
+          15 16 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 1 2 -1.</_>
+        <_>
+          2 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 3 -1.</_>
+        <_>
+          7 5 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 12 -1.</_>
+        <_>
+          7 9 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 4 -1.</_>
+        <_>
+          8 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 3 -1.</_>
+        <_>
+          18 5 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 1 -1.</_>
+        <_>
+          17 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 1 2 -1.</_>
+        <_>
+          7 6 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 1 -1.</_>
+        <_>
+          7 0 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 18 8 -1.</_>
+        <_>
+          6 7 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 4 6 -1.</_>
+        <_>
+          14 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 3 -1.</_>
+        <_>
+          5 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 2 -1.</_>
+        <_>
+          18 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 8 4 -1.</_>
+        <_>
+          13 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 20 -1.</_>
+        <_>
+          12 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 8 -1.</_>
+        <_>
+          19 0 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 14 -1.</_>
+        <_>
+          18 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 8 4 -1.</_>
+        <_>
+          9 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 14 10 -1.</_>
+        <_>
+          0 15 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 4 -1.</_>
+        <_>
+          1 9 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 11 4 -1.</_>
+        <_>
+          2 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 2 -1.</_>
+        <_>
+          4 0 3 1 2.</_>
+        <_>
+          7 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 2 -1.</_>
+        <_>
+          9 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 12 -1.</_>
+        <_>
+          7 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 6 -1.</_>
+        <_>
+          17 10 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 3 -1.</_>
+        <_>
+          8 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 1 -1.</_>
+        <_>
+          17 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 2 8 -1.</_>
+        <_>
+          17 3 1 4 2.</_>
+        <_>
+          18 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 8 -1.</_>
+        <_>
+          9 8 5 4 2.</_>
+        <_>
+          14 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 1 -1.</_>
+        <_>
+          10 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 14 -1.</_>
+        <_>
+          11 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 1 -1.</_>
+        <_>
+          12 12 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 9 6 -1.</_>
+        <_>
+          5 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 1 -1.</_>
+        <_>
+          17 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 2 -1.</_>
+        <_>
+          5 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 8 -1.</_>
+        <_>
+          4 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 7 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 3 -1.</_>
+        <_>
+          5 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 2 -1.</_>
+        <_>
+          14 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 2 -1.</_>
+        <_>
+          7 10 1 1 2.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 4 7 -1.</_>
+        <_>
+          13 7 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 4 -1.</_>
+        <_>
+          18 7 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 2 -1.</_>
+        <_>
+          3 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 16 -1.</_>
+        <_>
+          0 6 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 1 -1.</_>
+        <_>
+          4 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 3 -1.</_>
+        <_>
+          7 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 9 -1.</_>
+        <_>
+          17 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 5 -1.</_>
+        <_>
+          8 13 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 1 -1.</_>
+        <_>
+          18 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 16 -1.</_>
+        <_>
+          8 0 6 8 2.</_>
+        <_>
+          14 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 5 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 18 3 2 -1.</_>
+        <_>
+          17 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 3 -1.</_>
+        <_>
+          17 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 2 -1.</_>
+        <_>
+          11 5 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 4 -1.</_>
+        <_>
+          8 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 5 9 -1.</_>
+        <_>
+          14 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 9 2 -1.</_>
+        <_>
+          0 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 1 -1.</_>
+        <_>
+          18 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 5 3 -1.</_>
+        <_>
+          12 13 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 13 4 2 -1.</_>
+        <_>
+          10 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 3 -1.</_>
+        <_>
+          7 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 3 -1.</_>
+        <_>
+          15 4 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 18 4 1 -1.</_>
+        <_>
+          17 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 3 -1.</_>
+        <_>
+          5 0 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 2 -1.</_>
+        <_>
+          12 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          0 2 1 9 2.</_>
+        <_>
+          1 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 7 -1.</_>
+        <_>
+          3 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 4 2 -1.</_>
+        <_>
+          12 18 2 1 2.</_>
+        <_>
+          14 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 12 -1.</_>
+        <_>
+          7 4 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 1 -1.</_>
+        <_>
+          7 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 8 -1.</_>
+        <_>
+          11 4 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 2 2 -1.</_>
+        <_>
+          8 16 1 1 2.</_>
+        <_>
+          9 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 3 -1.</_>
+        <_>
+          2 5 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 6 -1.</_>
+        <_>
+          9 7 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 2 -1.</_>
+        <_>
+          8 5 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 1 2 -1.</_>
+        <_>
+          14 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 1 -1.</_>
+        <_>
+          6 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 17 3 -1.</_>
+        <_>
+          1 10 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 9 3 -1.</_>
+        <_>
+          1 18 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 6 2 -1.</_>
+        <_>
+          4 17 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 2 2 -1.</_>
+        <_>
+          3 8 1 1 2.</_>
+        <_>
+          4 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 3 -1.</_>
+        <_>
+          16 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 2 -1.</_>
+        <_>
+          8 3 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 1 -1.</_>
+        <_>
+          4 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 4 -1.</_>
+        <_>
+          1 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 12 -1.</_>
+        <_>
+          6 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 2 -1.</_>
+        <_>
+          0 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 5 16 -1.</_>
+        <_>
+          2 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 6 -1.</_>
+        <_>
+          9 2 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 1 -1.</_>
+        <_>
+          8 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 2 -1.</_>
+        <_>
+          10 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 6 -1.</_>
+        <_>
+          15 9 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 7 -1.</_>
+        <_>
+          14 9 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 4 -1.</_>
+        <_>
+          15 8 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 1 16 -1.</_>
+        <_>
+          13 9 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 8 1 -1.</_>
+        <_>
+          9 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 5 -1.</_>
+        <_>
+          10 11 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 3 -1.</_>
+        <_>
+          6 13 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 1 2 -1.</_>
+        <_>
+          3 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 4 -1.</_>
+        <_>
+          4 14 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 8 -1.</_>
+        <_>
+          9 5 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 4 -1.</_>
+        <_>
+          17 5 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 3 4 -1.</_>
+        <_>
+          0 15 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 6 4 -1.</_>
+        <_>
+          8 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 2 1 -1.</_>
+        <_>
+          10 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 5 8 -1.</_>
+        <_>
+          14 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 7 -1.</_>
+        <_>
+          10 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 1 2 -1.</_>
+        <_>
+          2 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 11 3 -1.</_>
+        <_>
+          4 7 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 3 -1.</_>
+        <_>
+          5 5 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 3 -1.</_>
+        <_>
+          0 9 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 3 -1.</_>
+        <_>
+          15 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 1 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 3 -1.</_>
+        <_>
+          15 7 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 8 2 -1.</_>
+        <_>
+          9 15 4 1 2.</_>
+        <_>
+          13 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 4 -1.</_>
+        <_>
+          0 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 2 -1.</_>
+        <_>
+          9 4 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 2 -1.</_>
+        <_>
+          15 3 1 1 2.</_>
+        <_>
+          16 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 12 -1.</_>
+        <_>
+          12 0 2 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 8 2 -1.</_>
+        <_>
+          10 7 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 13 -1.</_>
+        <_>
+          16 3 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 5 2 -1.</_>
+        <_>
+          11 11 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 2 -1.</_>
+        <_>
+          3 0 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 1 3 -1.</_>
+        <_>
+          3 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 5 -1.</_>
+        <_>
+          7 0 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 1 2 -1.</_>
+        <_>
+          18 10 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 4 -1.</_>
+        <_>
+          4 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 1 -1.</_>
+        <_>
+          13 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 2 -1.</_>
+        <_>
+          0 5 4 1 2.</_>
+        <_>
+          4 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 13 -1.</_>
+        <_>
+          12 7 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 2 -1.</_>
+        <_>
+          18 4 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 2 -1.</_>
+        <_>
+          2 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 6 -1.</_>
+        <_>
+          4 10 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 2 -1.</_>
+        <_>
+          14 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 3 8 -1.</_>
+        <_>
+          11 9 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 6 -1.</_>
+        <_>
+          14 13 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 2 -1.</_>
+        <_>
+          11 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 3 -1.</_>
+        <_>
+          13 1 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 2 1 -1.</_>
+        <_>
+          8 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 4 -1.</_>
+        <_>
+          6 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 3 -1.</_>
+        <_>
+          12 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 18 10 1 2.</_>
+        <_>
+          10 19 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 2 -1.</_>
+        <_>
+          2 18 9 1 2.</_>
+        <_>
+          11 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 17 -1.</_>
+        <_>
+          5 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 4 -1.</_>
+        <_>
+          4 9 2 2 2.</_>
+        <_>
+          6 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 4 -1.</_>
+        <_>
+          5 11 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 12 -1.</_>
+        <_>
+          12 2 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 2 4 -1.</_>
+        <_>
+          1 9 1 2 2.</_>
+        <_>
+          2 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 2 1 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 4 -1.</_>
+        <_>
+          15 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 1 -1.</_>
+        <_>
+          16 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 10 -1.</_>
+        <_>
+          2 3 9 5 2.</_>
+        <_>
+          11 8 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 2 2 -1.</_>
+        <_>
+          15 17 1 1 2.</_>
+        <_>
+          16 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 10 -1.</_>
+        <_>
+          7 1 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 2 -1.</_>
+        <_>
+          5 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 2 -1.</_>
+        <_>
+          15 10 2 1 2.</_>
+        <_>
+          17 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 1 4 -1.</_>
+        <_>
+          0 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 13 -1.</_>
+        <_>
+          10 7 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 11 6 -1.</_>
+        <_>
+          8 7 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 3 -1.</_>
+        <_>
+          8 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 11 -1.</_>
+        <_>
+          1 9 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 2 -1.</_>
+        <_>
+          5 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 1 -1.</_>
+        <_>
+          10 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 5 4 -1.</_>
+        <_>
+          5 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 3 -1.</_>
+        <_>
+          16 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 3 -1.</_>
+        <_>
+          0 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 3 -1.</_>
+        <_>
+          9 10 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 3 -1.</_>
+        <_>
+          18 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 6 -1.</_>
+        <_>
+          5 13 2 3 2.</_>
+        <_>
+          7 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 17 -1.</_>
+        <_>
+          1 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 3 -1.</_>
+        <_>
+          9 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 8 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 5 6 -1.</_>
+        <_>
+          7 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 9 -1.</_>
+        <_>
+          12 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 2 -1.</_>
+        <_>
+          15 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 3 -1.</_>
+        <_>
+          12 9 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 3 -1.</_>
+        <_>
+          4 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 14 3 -1.</_>
+        <_>
+          6 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 14 4 -1.</_>
+        <_>
+          0 11 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 3 -1.</_>
+        <_>
+          4 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_>
+        <_>
+          18 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 3 -1.</_>
+        <_>
+          17 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 1 -1.</_>
+        <_>
+          6 8 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 1 -1.</_>
+        <_>
+          9 8 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 1 -1.</_>
+        <_>
+          10 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 10 -1.</_>
+        <_>
+          4 9 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 3 -1.</_>
+        <_>
+          7 15 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 12 -1.</_>
+        <_>
+          0 4 1 6 2.</_>
+        <_>
+          1 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 10 -1.</_>
+        <_>
+          5 2 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 1 -1.</_>
+        <_>
+          5 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 6 -1.</_>
+        <_>
+          15 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 2 -1.</_>
+        <_>
+          18 6 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 5 -1.</_>
+        <_>
+          10 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 2 2 -1.</_>
+        <_>
+          7 17 1 1 2.</_>
+        <_>
+          8 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 4 1 -1.</_>
+        <_>
+          6 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 3 -1.</_>
+        <_>
+          9 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 1 4 -1.</_>
+        <_>
+          16 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 2 3 -1.</_>
+        <_>
+          16 14 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 13 10 -1.</_>
+        <_>
+          3 13 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 1 -1.</_>
+        <_>
+          12 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 15 6 -1.</_>
+        <_>
+          7 7 5 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          17 1 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 3 -1.</_>
+        <_>
+          0 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 2 -1.</_>
+        <_>
+          11 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 2 -1.</_>
+        <_>
+          12 5 1 1 2.</_>
+        <_>
+          13 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 2 -1.</_>
+        <_>
+          12 0 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 3 3 -1.</_>
+        <_>
+          11 10 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          12 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 2 -1.</_>
+        <_>
+          8 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 4 -1.</_>
+        <_>
+          6 1 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 4 -1.</_>
+        <_>
+          3 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 9 -1.</_>
+        <_>
+          10 7 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 4 -1.</_>
+        <_>
+          5 15 6 2 2.</_>
+        <_>
+          11 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 10 -1.</_>
+        <_>
+          13 3 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 2 -1.</_>
+        <_>
+          11 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 3 1 -1.</_>
+        <_>
+          12 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 4 -1.</_>
+        <_>
+          15 16 1 2 2.</_>
+        <_>
+          16 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 11 7 2 2.</_>
+        <_>
+          10 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 16 1 -1.</_>
+        <_>
+          5 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 2 1 -1.</_>
+        <_>
+          4 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 1 8 -1.</_>
+        <_>
+          10 9 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 16 -1.</_>
+        <_>
+          18 3 1 8 2.</_>
+        <_>
+          19 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          5 9 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 3 -1.</_>
+        <_>
+          7 15 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 2 -1.</_>
+        <_>
+          7 1 1 1 2.</_>
+        <_>
+          8 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 11 -1.</_>
+        <_>
+          9 5 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 14 -1.</_>
+        <_>
+          14 0 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 8 -1.</_>
+        <_>
+          16 1 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 3 4 -1.</_>
+        <_>
+          0 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 9 -1.</_>
+        <_>
+          8 12 3 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 6 -1.</_>
+        <_>
+          10 9 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 9 -1.</_>
+        <_>
+          7 5 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 2 -1.</_>
+        <_>
+          10 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 3 -1.</_>
+        <_>
+          8 1 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 3 -1.</_>
+        <_>
+          11 1 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 1 2 -1.</_>
+        <_>
+          18 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 2 -1.</_>
+        <_>
+          8 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 4 -1.</_>
+        <_>
+          5 7 1 2 2.</_>
+        <_>
+          6 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 9 1 -1.</_>
+        <_>
+          5 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 9 -1.</_>
+        <_>
+          5 13 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 3 -1.</_>
+        <_>
+          0 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 16 1 -1.</_>
+        <_>
+          8 9 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 3 -1.</_>
+        <_>
+          5 2 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 1 -1.</_>
+        <_>
+          12 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 10 -1.</_>
+        <_>
+          14 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          5 10 2 4 2.</_>
+        <_>
+          7 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 10 -1.</_>
+        <_>
+          0 0 8 5 2.</_>
+        <_>
+          8 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 4 -1.</_>
+        <_>
+          5 15 1 2 2.</_>
+        <_>
+          6 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 16 -1.</_>
+        <_>
+          17 2 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 1 -1.</_>
+        <_>
+          9 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 2 2 -1.</_>
+        <_>
+          18 12 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 18 -1.</_>
+        <_>
+          17 6 1 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 3 -1.</_>
+        <_>
+          10 2 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 2 1 -1.</_>
+        <_>
+          2 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 3 -1.</_>
+        <_>
+          11 0 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 3 -1.</_>
+        <_>
+          11 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 1 6 -1.</_>
+        <_>
+          18 9 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 3 -1.</_>
+        <_>
+          5 10 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 6 -1.</_>
+        <_>
+          15 9 1 3 2.</_>
+        <_>
+          16 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 1 -1.</_>
+        <_>
+          13 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 14 -1.</_>
+        <_>
+          7 6 6 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 2 -1.</_>
+        <_>
+          15 10 2 1 2.</_>
+        <_>
+          17 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 7 -1.</_>
+        <_>
+          16 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 10 -1.</_>
+        <_>
+          1 10 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 12 -1.</_>
+        <_>
+          19 0 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 10 1 -1.</_>
+        <_>
+          4 7 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 2 -1.</_>
+        <_>
+          12 2 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 2 -1.</_>
+        <_>
+          8 8 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 3 -1.</_>
+        <_>
+          13 11 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 5 6 -1.</_>
+        <_>
+          10 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 8 -1.</_>
+        <_>
+          9 7 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 2 3 -1.</_>
+        <_>
+          16 2 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 13 9 -1.</_>
+        <_>
+          4 5 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 2 -1.</_>
+        <_>
+          11 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 2 -1.</_>
+        <_>
+          0 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 12 -1.</_>
+        <_>
+          12 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 3 -1.</_>
+        <_>
+          19 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 18 1 2 -1.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 4 -1.</_>
+        <_>
+          13 4 1 2 2.</_>
+        <_>
+          14 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 1 4 -1.</_>
+        <_>
+          13 8 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 1 -1.</_>
+        <_>
+          2 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 1 4 -1.</_>
+        <_>
+          17 10 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 4 -1.</_>
+        <_>
+          8 9 3 2 2.</_>
+        <_>
+          11 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 15 3 -1.</_>
+        <_>
+          0 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 3 -1.</_>
+        <_>
+          15 7 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 9 4 -1.</_>
+        <_>
+          11 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 1 6 -1.</_>
+        <_>
+          16 5 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 3 -1.</_>
+        <_>
+          8 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 1 4 -1.</_>
+        <_>
+          3 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 3 4 -1.</_>
+        <_>
+          17 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 4 3 -1.</_>
+        <_>
+          14 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 3 -1.</_>
+        <_>
+          6 4 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 1 8 -1.</_>
+        <_>
+          9 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 1 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 1 -1.</_>
+        <_>
+          15 3 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 4 -1.</_>
+        <_>
+          17 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 4 -1.</_>
+        <_>
+          17 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 3 -1.</_>
+        <_>
+          12 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 7 -1.</_>
+        <_>
+          18 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 2 -1.</_>
+        <_>
+          15 8 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 1 -1.</_>
+        <_>
+          17 8 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 3 6 -1.</_>
+        <_>
+          1 10 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 13 -1.</_>
+        <_>
+          10 4 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          6 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 3 -1.</_>
+        <_>
+          7 11 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 2 -1.</_>
+        <_>
+          6 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 3 -1.</_>
+        <_>
+          9 8 3 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 6 -1.</_>
+        <_>
+          1 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 1 3 -1.</_>
+        <_>
+          10 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 2 -1.</_>
+        <_>
+          8 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 10 2 -1.</_>
+        <_>
+          1 18 5 1 2.</_>
+        <_>
+          6 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 2 -1.</_>
+        <_>
+          6 0 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 3 -1.</_>
+        <_>
+          10 7 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 9 -1.</_>
+        <_>
+          6 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 4 -1.</_>
+        <_>
+          16 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 6 -1.</_>
+        <_>
+          9 7 5 3 2.</_>
+        <_>
+          14 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 4 -1.</_>
+        <_>
+          8 6 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 14 6 6 -1.</_>
+        <_>
+          3 16 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 6 -1.</_>
+        <_>
+          5 14 3 3 2.</_>
+        <_>
+          8 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 6 -1.</_>
+        <_>
+          3 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 20 -1.</_>
+        <_>
+          3 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 10 3 -1.</_>
+        <_>
+          4 7 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 6 -1.</_>
+        <_>
+          1 10 2 3 2.</_>
+        <_>
+          3 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 10 -1.</_>
+        <_>
+          4 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 2 -1.</_>
+        <_>
+          4 7 1 1 2.</_>
+        <_>
+          5 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 6 2 -1.</_>
+        <_>
+          0 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 10 -1.</_>
+        <_>
+          19 0 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 12 -1.</_>
+        <_>
+          9 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 4 -1.</_>
+        <_>
+          3 15 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 1 -1.</_>
+        <_>
+          9 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 4 -1.</_>
+        <_>
+          1 9 5 2 2.</_>
+        <_>
+          6 11 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 1 -1.</_>
+        <_>
+          6 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 2 -1.</_>
+        <_>
+          14 7 1 1 2.</_>
+        <_>
+          15 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 3 -1.</_>
+        <_>
+          14 8 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 1 -1.</_>
+        <_>
+          9 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 7 -1.</_>
+        <_>
+          12 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 4 -1.</_>
+        <_>
+          16 0 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 7 -1.</_>
+        <_>
+          10 0 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 2 -1.</_>
+        <_>
+          9 1 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 1 -1.</_>
+        <_>
+          7 9 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 6 3 -1.</_>
+        <_>
+          5 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 12 1 -1.</_>
+        <_>
+          4 19 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 8 1 -1.</_>
+        <_>
+          14 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 6 -1.</_>
+        <_>
+          8 12 4 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 6 -1.</_>
+        <_>
+          14 4 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 8 -1.</_>
+        <_>
+          9 2 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 18 19 2 -1.</_>
+        <_>
+          1 19 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 8 3 -1.</_>
+        <_>
+          10 3 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 1 -1.</_>
+        <_>
+          7 0 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 8 1 -1.</_>
+        <_>
+          13 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 2 -1.</_>
+        <_>
+          7 2 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 3 3 -1.</_>
+        <_>
+          1 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 9 -1.</_>
+        <_>
+          4 10 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 3 -1.</_>
+        <_>
+          6 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 2 -1.</_>
+        <_>
+          18 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 4 -1.</_>
+        <_>
+          14 10 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 3 -1.</_>
+        <_>
+          6 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 1 2 -1.</_>
+        <_>
+          4 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 1 -1.</_>
+        <_>
+          2 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 3 2 -1.</_>
+        <_>
+          1 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 6 -1.</_>
+        <_>
+          0 2 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 10 -1.</_>
+        <_>
+          0 10 6 5 2.</_>
+        <_>
+          6 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 2 -1.</_>
+        <_>
+          7 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 3 -1.</_>
+        <_>
+          13 9 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 1 2 -1.</_>
+        <_>
+          6 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 2 2 -1.</_>
+        <_>
+          17 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 1 2 -1.</_>
+        <_>
+          15 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 6 -1.</_>
+        <_>
+          17 10 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 9 -1.</_>
+        <_>
+          6 8 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 3 -1.</_>
+        <_>
+          14 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 4 -1.</_>
+        <_>
+          9 6 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 2 -1.</_>
+        <_>
+          4 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 4 -1.</_>
+        <_>
+          0 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          9 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 4 4 -1.</_>
+        <_>
+          15 9 2 2 2.</_>
+        <_>
+          17 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 1 -1.</_>
+        <_>
+          5 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 2 -1.</_>
+        <_>
+          14 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 13 8 -1.</_>
+        <_>
+          2 16 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 3 -1.</_>
+        <_>
+          16 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 6 -1.</_>
+        <_>
+          10 7 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 12 4 -1.</_>
+        <_>
+          1 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 17 -1.</_>
+        <_>
+          14 2 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 8 2 -1.</_>
+        <_>
+          10 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 4 2 -1.</_>
+        <_>
+          2 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 10 4 -1.</_>
+        <_>
+          10 15 5 2 2.</_>
+        <_>
+          15 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 14 -1.</_>
+        <_>
+          16 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 12 -1.</_>
+        <_>
+          3 14 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 1 2 -1.</_>
+        <_>
+          4 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 6 -1.</_>
+        <_>
+          7 10 4 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 7 -1.</_>
+        <_>
+          19 3 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 6 -1.</_>
+        <_>
+          14 7 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 4 -1.</_>
+        <_>
+          13 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 2 -1.</_>
+        <_>
+          10 1 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 1 -1.</_>
+        <_>
+          19 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 1 3 -1.</_>
+        <_>
+          12 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 2 -1.</_>
+        <_>
+          10 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 6 -1.</_>
+        <_>
+          4 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 12 -1.</_>
+        <_>
+          4 4 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 3 -1.</_>
+        <_>
+          2 4 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          6 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 5 -1.</_>
+        <_>
+          9 4 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 4 -1.</_>
+        <_>
+          13 3 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 3 3 -1.</_>
+        <_>
+          0 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 3 -1.</_>
+        <_>
+          5 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 8 -1.</_>
+        <_>
+          7 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 5 2 -1.</_>
+        <_>
+          3 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 1 2 -1.</_>
+        <_>
+          18 10 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 18 -1.</_>
+        <_>
+          0 9 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 2 -1.</_>
+        <_>
+          8 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 5 4 -1.</_>
+        <_>
+          10 8 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 12 -1.</_>
+        <_>
+          14 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 4 -1.</_>
+        <_>
+          1 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 6 3 -1.</_>
+        <_>
+          15 15 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 4 8 -1.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 2 -1.</_>
+        <_>
+          6 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 2 -1.</_>
+        <_>
+          7 15 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 2 -1.</_>
+        <_>
+          17 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 2 -1.</_>
+        <_>
+          5 1 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 3 -1.</_>
+        <_>
+          0 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 3 -1.</_>
+        <_>
+          7 1 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 2 -1.</_>
+        <_>
+          0 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 2 -1.</_>
+        <_>
+          5 8 2 1 2.</_>
+        <_>
+          7 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 2 -1.</_>
+        <_>
+          14 5 3 1 2.</_>
+        <_>
+          17 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 2 4 -1.</_>
+        <_>
+          3 1 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 1 2 -1.</_>
+        <_>
+          2 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 4 -1.</_>
+        <_>
+          0 0 1 2 2.</_>
+        <_>
+          1 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 10 -1.</_>
+        <_>
+          8 0 4 5 2.</_>
+        <_>
+          12 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 8 -1.</_>
+        <_>
+          3 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 9 2 -1.</_>
+        <_>
+          10 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 2 3 -1.</_>
+        <_>
+          6 3 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 2 -1.</_>
+        <_>
+          11 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 5 -1.</_>
+        <_>
+          17 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 12 6 -1.</_>
+        <_>
+          11 12 4 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 7 -1.</_>
+        <_>
+          15 6 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 2 -1.</_>
+        <_>
+          18 9 1 1 2.</_>
+        <_>
+          19 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 4 -1.</_>
+        <_>
+          16 7 2 2 2.</_>
+        <_>
+          18 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 6 -1.</_>
+        <_>
+          14 10 3 3 2.</_>
+        <_>
+          17 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 2 4 -1.</_>
+        <_>
+          8 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 2 8 -1.</_>
+        <_>
+          18 11 1 4 2.</_>
+        <_>
+          19 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 12 -1.</_>
+        <_>
+          7 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 9 -1.</_>
+        <_>
+          5 7 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 4 -1.</_>
+        <_>
+          5 4 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 3 12 -1.</_>
+        <_>
+          14 3 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 6 -1.</_>
+        <_>
+          11 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 5 -1.</_>
+        <_>
+          18 8 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 6 -1.</_>
+        <_>
+          5 13 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 5 -1.</_>
+        <_>
+          15 6 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 3 -1.</_>
+        <_>
+          7 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 2 -1.</_>
+        <_>
+          9 10 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 12 -1.</_>
+        <_>
+          7 8 1 6 2.</_>
+        <_>
+          8 14 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 3 2 -1.</_>
+        <_>
+          6 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 4 -1.</_>
+        <_>
+          5 6 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 10 -1.</_>
+        <_>
+          11 1 6 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 1 -1.</_>
+        <_>
+          2 6 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 1 6 -1.</_>
+        <_>
+          14 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 1 3 -1.</_>
+        <_>
+          13 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 3 -1.</_>
+        <_>
+          6 7 6 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 3 -1.</_>
+        <_>
+          14 7 3 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 3 -1.</_>
+        <_>
+          7 12 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 8 -1.</_>
+        <_>
+          18 8 1 4 2.</_>
+        <_>
+          19 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 2 -1.</_>
+        <_>
+          16 2 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 10 -1.</_>
+        <_>
+          14 0 1 5 2.</_>
+        <_>
+          15 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 2 6 -1.</_>
+        <_>
+          10 1 1 3 2.</_>
+        <_>
+          11 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 2 3 -1.</_>
+        <_>
+          17 2 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 1 -1.</_>
+        <_>
+          14 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 2 -1.</_>
+        <_>
+          0 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 4 -1.</_>
+        <_>
+          13 12 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 7 -1.</_>
+        <_>
+          10 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 8 -1.</_>
+        <_>
+          4 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_>
+        <_>
+          19 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 1 2 -1.</_>
+        <_>
+          5 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 1 -1.</_>
+        <_>
+          3 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          9 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 12 -1.</_>
+        <_>
+          18 2 1 6 2.</_>
+        <_>
+          19 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 3 -1.</_>
+        <_>
+          2 17 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 9 -1.</_>
+        <_>
+          10 12 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 3 4 -1.</_>
+        <_>
+          13 15 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 3 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 5 3 -1.</_>
+        <_>
+          2 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 19 6 1 -1.</_>
+        <_>
+          13 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 15 -1.</_>
+        <_>
+          11 6 2 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 8 -1.</_>
+        <_>
+          15 10 1 4 2.</_>
+        <_>
+          16 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 12 -1.</_>
+        <_>
+          2 11 2 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 4 -1.</_>
+        <_>
+          11 2 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 3 -1.</_>
+        <_>
+          5 9 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 4 -1.</_>
+        <_>
+          15 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 4 -1.</_>
+        <_>
+          11 13 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 14 -1.</_>
+        <_>
+          10 0 10 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 11 -1.</_>
+        <_>
+          2 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 17 -1.</_>
+        <_>
+          3 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 7 -1.</_>
+        <_>
+          7 0 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 6 -1.</_>
+        <_>
+          9 3 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 20 -1.</_>
+        <_>
+          6 0 7 10 2.</_>
+        <_>
+          13 10 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 6 1 1 2.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 3 -1.</_>
+        <_>
+          14 10 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 6 -1.</_>
+        <_>
+          8 13 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 15 2 1 -1.</_>
+        <_>
+          18 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 2 -1.</_>
+        <_>
+          9 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 1 -1.</_>
+        <_>
+          7 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 5 -1.</_>
+        <_>
+          10 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 3 -1.</_>
+        <_>
+          6 5 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 2 -1.</_>
+        <_>
+          15 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 20 -1.</_>
+        <_>
+          6 5 9 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 11 12 -1.</_>
+        <_>
+          0 13 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 1 -1.</_>
+        <_>
+          1 8 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 10 -1.</_>
+        <_>
+          12 6 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 6 -1.</_>
+        <_>
+          18 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          9 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 4 -1.</_>
+        <_>
+          14 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 4 -1.</_>
+        <_>
+          11 9 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 8 -1.</_>
+        <_>
+          15 8 1 4 2.</_>
+        <_>
+          16 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 9 2 -1.</_>
+        <_>
+          1 17 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 12 -1.</_>
+        <_>
+          5 5 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 2 10 -1.</_>
+        <_>
+          2 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 5 -1.</_>
+        <_>
+          5 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 2 -1.</_>
+        <_>
+          12 1 4 1 2.</_>
+        <_>
+          16 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 6 -1.</_>
+        <_>
+          5 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 4 -1.</_>
+        <_>
+          4 2 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 14 -1.</_>
+        <_>
+          6 10 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 10 -1.</_>
+        <_>
+          15 10 1 5 2.</_>
+        <_>
+          16 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 9 4 -1.</_>
+        <_>
+          13 2 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 1 9 -1.</_>
+        <_>
+          15 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 2 -1.</_>
+        <_>
+          5 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 2 -1.</_>
+        <_>
+          15 5 2 1 2.</_>
+        <_>
+          17 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 4 -1.</_>
+        <_>
+          8 3 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 1 2 -1.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 3 -1.</_>
+        <_>
+          3 14 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 14 2 -1.</_>
+        <_>
+          2 16 7 1 2.</_>
+        <_>
+          9 17 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 3 -1.</_>
+        <_>
+          5 0 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 1 -1.</_>
+        <_>
+          9 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 3 -1.</_>
+        <_>
+          10 7 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 10 2 -1.</_>
+        <_>
+          4 12 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 15 6 -1.</_>
+        <_>
+          0 10 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 8 1 -1.</_>
+        <_>
+          5 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 2 -1.</_>
+        <_>
+          15 3 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 4 -1.</_>
+        <_>
+          18 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 2 -1.</_>
+        <_>
+          10 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 3 -1.</_>
+        <_>
+          11 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 2 -1.</_>
+        <_>
+          5 7 2 1 2.</_>
+        <_>
+          7 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 5 -1.</_>
+        <_>
+          6 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 6 -1.</_>
+        <_>
+          7 9 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 16 -1.</_>
+        <_>
+          7 3 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 8 -1.</_>
+        <_>
+          5 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 3 -1.</_>
+        <_>
+          17 7 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 1 12 -1.</_>
+        <_>
+          16 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 5 2 -1.</_>
+        <_>
+          13 5 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 3 -1.</_>
+        <_>
+          17 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 6 -1.</_>
+        <_>
+          13 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 13 4 -1.</_>
+        <_>
+          7 8 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 2 -1.</_>
+        <_>
+          13 11 3 1 2.</_>
+        <_>
+          16 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 5 3 -1.</_>
+        <_>
+          10 3 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 2 -1.</_>
+        <_>
+          1 8 2 1 2.</_>
+        <_>
+          3 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 4 -1.</_>
+        <_>
+          19 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 2 -1.</_>
+        <_>
+          5 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 15 9 -1.</_>
+        <_>
+          9 7 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 11 -1.</_>
+        <_>
+          11 0 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          16 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 3 3 -1.</_>
+        <_>
+          14 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 4 6 -1.</_>
+        <_>
+          13 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 1 6 -1.</_>
+        <_>
+          8 12 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 12 1 -1.</_>
+        <_>
+          11 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 2 2 -1.</_>
+        <_>
+          14 16 1 1 2.</_>
+        <_>
+          15 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 1 4 -1.</_>
+        <_>
+          3 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 1 -1.</_>
+        <_>
+          2 2 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 1 -1.</_>
+        <_>
+          13 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 6 -1.</_>
+        <_>
+          13 3 1 3 2.</_>
+        <_>
+          14 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 5 -1.</_>
+        <_>
+          8 9 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 17 -1.</_>
+        <_>
+          7 1 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 11 -1.</_>
+        <_>
+          17 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 1 -1.</_>
+        <_>
+          13 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 3 -1.</_>
+        <_>
+          15 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 4 -1.</_>
+        <_>
+          1 6 1 2 2.</_>
+        <_>
+          2 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 2 12 -1.</_>
+        <_>
+          3 7 1 6 2.</_>
+        <_>
+          4 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 2 2 -1.</_>
+        <_>
+          2 18 1 1 2.</_>
+        <_>
+          3 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 7 -1.</_>
+        <_>
+          8 9 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 4 -1.</_>
+        <_>
+          19 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 3 2 -1.</_>
+        <_>
+          5 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 8 5 -1.</_>
+        <_>
+          10 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 8 3 -1.</_>
+        <_>
+          4 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 1 4 -1.</_>
+        <_>
+          2 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 1 3 -1.</_>
+        <_>
+          0 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 8 3 -1.</_>
+        <_>
+          9 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 8 1 -1.</_>
+        <_>
+          9 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          0 0 3 3 2.</_>
+        <_>
+          3 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 2 -1.</_>
+        <_>
+          9 5 1 1 2.</_>
+        <_>
+          10 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 1 3 -1.</_>
+        <_>
+          8 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 12 2 -1.</_>
+        <_>
+          8 18 6 1 2.</_>
+        <_>
+          14 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 1 -1.</_>
+        <_>
+          10 9 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          8 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          1 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 12 1 -1.</_>
+        <_>
+          3 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 1 -1.</_>
+        <_>
+          3 12 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 14 5 -1.</_>
+        <_>
+          13 11 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 10 -1.</_>
+        <_>
+          15 4 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 1 -1.</_>
+        <_>
+          3 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 1 12 -1.</_>
+        <_>
+          15 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 2 -1.</_>
+        <_>
+          15 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 11 -1.</_>
+        <_>
+          9 9 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_>
+        <_>
+          13 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 6 13 -1.</_>
+        <_>
+          5 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 3 -1.</_>
+        <_>
+          16 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 6 -1.</_>
+        <_>
+          7 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 1 -1.</_>
+        <_>
+          18 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 16 1 1 2.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 2 -1.</_>
+        <_>
+          12 2 4 1 2.</_>
+        <_>
+          16 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 4 -1.</_>
+        <_>
+          4 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 3 -1.</_>
+        <_>
+          3 1 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 8 -1.</_>
+        <_>
+          10 9 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 15 2 2 -1.</_>
+        <_>
+          1 15 1 1 2.</_>
+        <_>
+          2 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 12 -1.</_>
+        <_>
+          0 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 8 -1.</_>
+        <_>
+          10 6 2 4 2.</_>
+        <_>
+          12 10 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 4 -1.</_>
+        <_>
+          12 6 1 2 2.</_>
+        <_>
+          13 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 2 -1.</_>
+        <_>
+          3 12 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 1 -1.</_>
+        <_>
+          9 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 16 -1.</_>
+        <_>
+          4 1 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 9 -1.</_>
+        <_>
+          10 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 3 -1.</_>
+        <_>
+          17 14 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          14 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 19 6 1 -1.</_>
+        <_>
+          16 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 5 -1.</_>
+        <_>
+          9 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 3 -1.</_>
+        <_>
+          11 5 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 10 -1.</_>
+        <_>
+          9 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 2 -1.</_>
+        <_>
+          17 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 2 -1.</_>
+        <_>
+          4 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 2 1 -1.</_>
+        <_>
+          14 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 2 3 -1.</_>
+        <_>
+          17 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 2 -1.</_>
+        <_>
+          15 14 1 1 2.</_>
+        <_>
+          16 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          16 18 2 1 2.</_>
+        <_>
+          18 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 3 2 -1.</_>
+        <_>
+          5 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 11 2 -1.</_>
+        <_>
+          1 1 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 2 -1.</_>
+        <_>
+          2 1 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 1 -1.</_>
+        <_>
+          8 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 6 -1.</_>
+        <_>
+          2 9 2 3 2.</_>
+        <_>
+          4 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 14 -1.</_>
+        <_>
+          15 6 2 7 2.</_>
+        <_>
+          17 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 12 -1.</_>
+        <_>
+          12 6 2 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 15 -1.</_>
+        <_>
+          10 10 2 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 5 -1.</_>
+        <_>
+          18 9 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          12 8 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 12 -1.</_>
+        <_>
+          18 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 4 -1.</_>
+        <_>
+          5 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 6 -1.</_>
+        <_>
+          16 0 2 3 2.</_>
+        <_>
+          18 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 10 -1.</_>
+        <_>
+          15 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 2 3 -1.</_>
+        <_>
+          15 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 3 -1.</_>
+        <_>
+          2 2 14 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 12 -1.</_>
+        <_>
+          4 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 5 -1.</_>
+        <_>
+          10 9 2 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 1 12 -1.</_>
+        <_>
+          9 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 4 -1.</_>
+        <_>
+          2 0 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 2 -1.</_>
+        <_>
+          8 8 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 6 -1.</_>
+        <_>
+          5 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 6 -1.</_>
+        <_>
+          13 1 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 2 -1.</_>
+        <_>
+          3 0 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 2 -1.</_>
+        <_>
+          12 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 2 2 -1.</_>
+        <_>
+          14 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 4 -1.</_>
+        <_>
+          12 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 2 -1.</_>
+        <_>
+          4 11 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 6 -1.</_>
+        <_>
+          11 4 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 6 -1.</_>
+        <_>
+          5 10 1 3 2.</_>
+        <_>
+          6 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          6 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 1 -1.</_>
+        <_>
+          13 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 6 -1.</_>
+        <_>
+          2 13 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 14 -1.</_>
+        <_>
+          8 6 5 7 2.</_>
+        <_>
+          13 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 2 -1.</_>
+        <_>
+          2 2 6 1 2.</_>
+        <_>
+          8 3 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 10 -1.</_>
+        <_>
+          10 7 3 5 2.</_>
+        <_>
+          13 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 4 -1.</_>
+        <_>
+          3 2 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 2 -1.</_>
+        <_>
+          3 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 11 3 -1.</_>
+        <_>
+          3 3 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 4 -1.</_>
+        <_>
+          14 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 4 -1.</_>
+        <_>
+          9 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 12 -1.</_>
+        <_>
+          8 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 3 -1.</_>
+        <_>
+          5 8 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 15 -1.</_>
+        <_>
+          4 5 6 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 8 2 -1.</_>
+        <_>
+          10 8 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 6 -1.</_>
+        <_>
+          19 0 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 5 -1.</_>
+        <_>
+          12 1 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 4 -1.</_>
+        <_>
+          10 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 2 -1.</_>
+        <_>
+          18 6 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 9 -1.</_>
+        <_>
+          8 4 6 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_>
+        <_>
+          17 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          9 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 1 16 -1.</_>
+        <_>
+          8 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 8 -1.</_>
+        <_>
+          17 2 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 2 -1.</_>
+        <_>
+          7 3 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 3 -1.</_>
+        <_>
+          15 7 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 9 -1.</_>
+        <_>
+          4 0 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 8 -1.</_>
+        <_>
+          17 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 8 -1.</_>
+        <_>
+          17 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 2 -1.</_>
+        <_>
+          18 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 4 -1.</_>
+        <_>
+          13 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 2 -1.</_>
+        <_>
+          17 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 3 -1.</_>
+        <_>
+          13 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 7 -1.</_>
+        <_>
+          16 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 6 -1.</_>
+        <_>
+          2 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 10 -1.</_>
+        <_>
+          2 2 9 5 2.</_>
+        <_>
+          11 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 3 -1.</_>
+        <_>
+          9 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 2 -1.</_>
+        <_>
+          6 6 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 6 -1.</_>
+        <_>
+          9 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 3 -1.</_>
+        <_>
+          15 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 6 4 -1.</_>
+        <_>
+          1 15 3 2 2.</_>
+        <_>
+          4 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 6 -1.</_>
+        <_>
+          3 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 3 2 -1.</_>
+        <_>
+          1 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 2 -1.</_>
+        <_>
+          17 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 4 -1.</_>
+        <_>
+          6 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 2 -1.</_>
+        <_>
+          16 5 1 1 2.</_>
+        <_>
+          17 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 8 -1.</_>
+        <_>
+          0 1 1 4 2.</_>
+        <_>
+          1 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 3 -1.</_>
+        <_>
+          9 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 1 -1.</_>
+        <_>
+          2 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 2 6 -1.</_>
+        <_>
+          2 13 1 3 2.</_>
+        <_>
+          3 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 10 -1.</_>
+        <_>
+          2 15 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 2 -1.</_>
+        <_>
+          12 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 8 -1.</_>
+        <_>
+          7 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 1 -1.</_>
+        <_>
+          10 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 4 3 -1.</_>
+        <_>
+          3 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 7 2 -1.</_>
+        <_>
+          5 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 3 3 -1.</_>
+        <_>
+          1 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 6 -1.</_>
+        <_>
+          12 9 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 4 -1.</_>
+        <_>
+          4 8 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 4 -1.</_>
+        <_>
+          5 10 1 2 2.</_>
+        <_>
+          6 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 2 2 -1.</_>
+        <_>
+          14 16 1 1 2.</_>
+        <_>
+          15 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 10 -1.</_>
+        <_>
+          2 9 1 5 2.</_>
+        <_>
+          3 14 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 4 2 -1.</_>
+        <_>
+          14 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 1 3 -1.</_>
+        <_>
+          3 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 3 -1.</_>
+        <_>
+          14 13 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 1 -1.</_>
+        <_>
+          17 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 6 -1.</_>
+        <_>
+          11 3 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 3 3 -1.</_>
+        <_>
+          15 14 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 3 6 -1.</_>
+        <_>
+          1 9 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 7 2 -1.</_>
+        <_>
+          11 6 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 3 -1.</_>
+        <_>
+          6 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 3 3 -1.</_>
+        <_>
+          16 18 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 1 -1.</_>
+        <_>
+          9 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 3 -1.</_>
+        <_>
+          10 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 1 4 -1.</_>
+        <_>
+          1 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 1 4 -1.</_>
+        <_>
+          12 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 1 -1.</_>
+        <_>
+          3 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 1 2 -1.</_>
+        <_>
+          9 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 1 -1.</_>
+        <_>
+          8 2 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 4 -1.</_>
+        <_>
+          18 0 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 1 -1.</_>
+        <_>
+          1 6 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 1 4 -1.</_>
+        <_>
+          4 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 19 9 -1.</_>
+        <_>
+          1 6 19 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          0 5 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 2 -1.</_>
+        <_>
+          6 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 11 -1.</_>
+        <_>
+          8 8 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 1 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 8 -1.</_>
+        <_>
+          5 3 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 11 -1.</_>
+        <_>
+          8 3 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 1 -1.</_>
+        <_>
+          18 4 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 4 9 -1.</_>
+        <_>
+          5 8 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 1 12 -1.</_>
+        <_>
+          12 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 19 2 1 -1.</_>
+        <_>
+          3 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 6 -1.</_>
+        <_>
+          5 1 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 1 -1.</_>
+        <_>
+          15 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 1 -1.</_>
+        <_>
+          16 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 1 -1.</_>
+        <_>
+          11 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 8 2 -1.</_>
+        <_>
+          10 6 4 1 2.</_>
+        <_>
+          14 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 3 -1.</_>
+        <_>
+          5 1 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 6 -1.</_>
+        <_>
+          2 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 3 12 -1.</_>
+        <_>
+          3 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 7 3 -1.</_>
+        <_>
+          1 18 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 8 2 -1.</_>
+        <_>
+          1 17 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 6 -1.</_>
+        <_>
+          15 9 1 3 2.</_>
+        <_>
+          16 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 1 -1.</_>
+        <_>
+          8 10 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 3 -1.</_>
+        <_>
+          15 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 15 -1.</_>
+        <_>
+          3 7 1 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 9 -1.</_>
+        <_>
+          5 8 1 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 2 -1.</_>
+        <_>
+          7 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 4 5 -1.</_>
+        <_>
+          17 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 9 7 -1.</_>
+        <_>
+          13 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 3 -1.</_>
+        <_>
+          8 6 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 4 -1.</_>
+        <_>
+          9 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 2 6 -1.</_>
+        <_>
+          4 5 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 1 4 -1.</_>
+        <_>
+          10 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 5 3 -1.</_>
+        <_>
+          1 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 10 1 -1.</_>
+        <_>
+          2 4 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 1 2 -1.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 1 3 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 3 -1.</_>
+        <_>
+          6 11 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 3 4 -1.</_>
+        <_>
+          17 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 11 4 -1.</_>
+        <_>
+          6 12 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 1 -1.</_>
+        <_>
+          8 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 2 8 -1.</_>
+        <_>
+          17 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 4 -1.</_>
+        <_>
+          17 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 2 -1.</_>
+        <_>
+          10 9 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 12 -1.</_>
+        <_>
+          5 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 4 -1.</_>
+        <_>
+          19 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 1 -1.</_>
+        <_>
+          3 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 2 -1.</_>
+        <_>
+          7 10 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 8 11 -1.</_>
+        <_>
+          6 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 7 -1.</_>
+        <_>
+          18 4 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 8 -1.</_>
+        <_>
+          11 7 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 3 -1.</_>
+        <_>
+          15 7 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 7 -1.</_>
+        <_>
+          11 9 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 6 -1.</_>
+        <_>
+          15 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 1 -1.</_>
+        <_>
+          11 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 9 9 -1.</_>
+        <_>
+          14 7 3 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 7 -1.</_>
+        <_>
+          15 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 6 -1.</_>
+        <_>
+          17 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 7 -1.</_>
+        <_>
+          15 13 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 12 -1.</_>
+        <_>
+          6 8 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 7 9 -1.</_>
+        <_>
+          3 9 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 4 -1.</_>
+        <_>
+          18 4 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 3 -1.</_>
+        <_>
+          6 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 1 -1.</_>
+        <_>
+          1 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 11 4 -1.</_>
+        <_>
+          5 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 7 -1.</_>
+        <_>
+          9 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 2 -1.</_>
+        <_>
+          7 8 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 3 -1.</_>
+        <_>
+          5 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 4 -1.</_>
+        <_>
+          15 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 4 -1.</_>
+        <_>
+          3 12 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 13 -1.</_>
+        <_>
+          14 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 2 -1.</_>
+        <_>
+          8 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 4 -1.</_>
+        <_>
+          7 14 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 1 -1.</_>
+        <_>
+          7 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 3 -1.</_>
+        <_>
+          7 1 6 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 15 -1.</_>
+        <_>
+          8 5 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 4 -1.</_>
+        <_>
+          13 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 9 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 3 2 -1.</_>
+        <_>
+          2 11 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 17 16 1 -1.</_>
+        <_>
+          8 17 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 3 -1.</_>
+        <_>
+          8 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 1 -1.</_>
+        <_>
+          6 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 3 -1.</_>
+        <_>
+          6 5 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 1 -1.</_>
+        <_>
+          7 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 7 3 -1.</_>
+        <_>
+          2 1 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 2 -1.</_>
+        <_>
+          7 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 10 -1.</_>
+        <_>
+          18 3 1 5 2.</_>
+        <_>
+          19 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 4 -1.</_>
+        <_>
+          0 9 5 2 2.</_>
+        <_>
+          5 11 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 6 -1.</_>
+        <_>
+          0 3 4 3 2.</_>
+        <_>
+          4 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 4 -1.</_>
+        <_>
+          14 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 1 2 -1.</_>
+        <_>
+          17 6 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 1 10 -1.</_>
+        <_>
+          14 9 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 1 -1.</_>
+        <_>
+          16 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 8 -1.</_>
+        <_>
+          5 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 1 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 11 -1.</_>
+        <_>
+          16 0 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 12 -1.</_>
+        <_>
+          10 4 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 2 4 -1.</_>
+        <_>
+          0 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 1 2 -1.</_>
+        <_>
+          16 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 4 -1.</_>
+        <_>
+          10 3 5 2 2.</_>
+        <_>
+          15 5 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 3 -1.</_>
+        <_>
+          15 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 6 -1.</_>
+        <_>
+          4 0 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 8 -1.</_>
+        <_>
+          10 0 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 3 -1.</_>
+        <_>
+          5 8 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 12 -1.</_>
+        <_>
+          16 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 5 -1.</_>
+        <_>
+          15 2 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 1 2.</_>
+        <_>
+          19 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 2 -1.</_>
+        <_>
+          6 15 1 1 2.</_>
+        <_>
+          7 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 2 -1.</_>
+        <_>
+          4 16 1 1 2.</_>
+        <_>
+          5 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          8 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 8 -1.</_>
+        <_>
+          3 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 8 -1.</_>
+        <_>
+          17 4 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 10 4 -1.</_>
+        <_>
+          3 15 5 2 2.</_>
+        <_>
+          8 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 1 -1.</_>
+        <_>
+          15 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 7 -1.</_>
+        <_>
+          8 5 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 1 2.</_>
+        <_>
+          17 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 3 -1.</_>
+        <_>
+          14 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 2 3 -1.</_>
+        <_>
+          11 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 3 -1.</_>
+        <_>
+          17 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 12 -1.</_>
+        <_>
+          4 4 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 2 -1.</_>
+        <_>
+          11 6 1 1 2.</_>
+        <_>
+          12 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 12 -1.</_>
+        <_>
+          5 8 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 4 -1.</_>
+        <_>
+          13 5 3 2 2.</_>
+        <_>
+          16 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 3 -1.</_>
+        <_>
+          13 1 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 12 -1.</_>
+        <_>
+          3 5 5 6 2.</_>
+        <_>
+          8 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 6 -1.</_>
+        <_>
+          3 11 3 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 7 -1.</_>
+        <_>
+          5 4 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 5 -1.</_>
+        <_>
+          16 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 4 -1.</_>
+        <_>
+          19 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 3 -1.</_>
+        <_>
+          16 9 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 17 -1.</_>
+        <_>
+          4 2 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 10 -1.</_>
+        <_>
+          18 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 4 -1.</_>
+        <_>
+          5 1 14 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 1 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          9 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 3 -1.</_>
+        <_>
+          5 9 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 1 -1.</_>
+        <_>
+          10 7 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 5 -1.</_>
+        <_>
+          12 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 12 -1.</_>
+        <_>
+          13 5 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 5 -1.</_>
+        <_>
+          4 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 3 -1.</_>
+        <_>
+          5 7 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 3 -1.</_>
+        <_>
+          4 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 5 4 -1.</_>
+        <_>
+          7 2 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 7 -1.</_>
+        <_>
+          4 13 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 1 3 -1.</_>
+        <_>
+          16 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 8 3 -1.</_>
+        <_>
+          5 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 3 4 -1.</_>
+        <_>
+          13 10 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 5 -1.</_>
+        <_>
+          9 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 6 -1.</_>
+        <_>
+          0 14 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 1 2 -1.</_>
+        <_>
+          2 3 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 12 4 -1.</_>
+        <_>
+          6 15 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 13 -1.</_>
+        <_>
+          7 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 2 -1.</_>
+        <_>
+          17 15 1 1 2.</_>
+        <_>
+          18 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 5 2 -1.</_>
+        <_>
+          12 16 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 6 -1.</_>
+        <_>
+          13 14 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 1 9 -1.</_>
+        <_>
+          12 3 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 1 -1.</_>
+        <_>
+          14 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 3 -1.</_>
+        <_>
+          11 11 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 2 -1.</_>
+        <_>
+          14 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 12 -1.</_>
+        <_>
+          12 6 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 8 -1.</_>
+        <_>
+          11 11 1 4 2.</_>
+        <_>
+          12 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 3 -1.</_>
+        <_>
+          7 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 6 -1.</_>
+        <_>
+          8 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 1 2 -1.</_>
+        <_>
+          3 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 3 -1.</_>
+        <_>
+          14 1 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 7 -1.</_>
+        <_>
+          4 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 6 -1.</_>
+        <_>
+          18 2 1 3 2.</_>
+        <_>
+          19 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 16 -1.</_>
+        <_>
+          4 0 3 8 2.</_>
+        <_>
+          7 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 6 4 -1.</_>
+        <_>
+          5 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 3 -1.</_>
+        <_>
+          3 8 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 3 -1.</_>
+        <_>
+          10 7 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 8 -1.</_>
+        <_>
+          3 7 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 3 -1.</_>
+        <_>
+          12 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          6 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 14 -1.</_>
+        <_>
+          17 4 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 10 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 9 -1.</_>
+        <_>
+          7 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 12 1 -1.</_>
+        <_>
+          7 5 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 2 2 -1.</_>
+        <_>
+          2 16 1 1 2.</_>
+        <_>
+          3 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 3 -1.</_>
+        <_>
+          16 6 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 8 -1.</_>
+        <_>
+          11 8 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 3 -1.</_>
+        <_>
+          7 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 5 6 -1.</_>
+        <_>
+          13 5 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 5 3 -1.</_>
+        <_>
+          0 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 1 -1.</_>
+        <_>
+          11 18 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 2 -1.</_>
+        <_>
+          13 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 7 2 -1.</_>
+        <_>
+          3 16 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 12 -1.</_>
+        <_>
+          14 1 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 5 -1.</_>
+        <_>
+          10 5 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 4 -1.</_>
+        <_>
+          18 14 1 2 2.</_>
+        <_>
+          19 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 19 4 1 -1.</_>
+        <_>
+          18 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 5 -1.</_>
+        <_>
+          18 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 3 -1.</_>
+        <_>
+          0 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 1 14 -1.</_>
+        <_>
+          0 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 5 -1.</_>
+        <_>
+          6 12 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 1 -1.</_>
+        <_>
+          13 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 7 -1.</_>
+        <_>
+          19 0 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 10 -1.</_>
+        <_>
+          3 13 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 5 -1.</_>
+        <_>
+          18 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 12 -1.</_>
+        <_>
+          18 0 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 2 -1.</_>
+        <_>
+          2 1 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 1 5 12 -1.</_>
+        <_>
+          1 4 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 1 14 -1.</_>
+        <_>
+          2 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 7 -1.</_>
+        <_>
+          9 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 6 -1.</_>
+        <_>
+          16 1 2 3 2.</_>
+        <_>
+          18 4 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 6 -1.</_>
+        <_>
+          16 0 2 3 2.</_>
+        <_>
+          18 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 1 2 -1.</_>
+        <_>
+          18 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 1 3 -1.</_>
+        <_>
+          17 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 3 4 -1.</_>
+        <_>
+          1 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 15 -1.</_>
+        <_>
+          8 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 3 -1.</_>
+        <_>
+          5 8 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 12 -1.</_>
+        <_>
+          4 5 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 1 3 -1.</_>
+        <_>
+          13 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 2 -1.</_>
+        <_>
+          4 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 10 -1.</_>
+        <_>
+          6 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 14 -1.</_>
+        <_>
+          14 6 3 7 2.</_>
+        <_>
+          17 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 11 8 -1.</_>
+        <_>
+          6 11 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 5 -1.</_>
+        <_>
+          18 9 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 2 -1.</_>
+        <_>
+          10 4 5 1 2.</_>
+        <_>
+          15 5 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 5 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 4 -1.</_>
+        <_>
+          19 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 10 -1.</_>
+        <_>
+          19 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 3 -1.</_>
+        <_>
+          17 1 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 1 -1.</_>
+        <_>
+          10 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 5 -1.</_>
+        <_>
+          8 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 9 -1.</_>
+        <_>
+          15 11 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 1 8 -1.</_>
+        <_>
+          13 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 8 3 -1.</_>
+        <_>
+          14 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 8 -1.</_>
+        <_>
+          7 8 1 4 2.</_>
+        <_>
+          8 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 4 2 -1.</_>
+        <_>
+          2 18 2 1 2.</_>
+        <_>
+          4 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          4 6 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 1 -1.</_>
+        <_>
+          17 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 3 -1.</_>
+        <_>
+          6 2 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 19 -1.</_>
+        <_>
+          6 1 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 5 8 -1.</_>
+        <_>
+          8 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          0 0 10 1 2.</_>
+        <_>
+          10 1 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 2 -1.</_>
+        <_>
+          7 0 4 1 2.</_>
+        <_>
+          11 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 3 -1.</_>
+        <_>
+          4 7 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 8 -1.</_>
+        <_>
+          1 6 1 4 2.</_>
+        <_>
+          2 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 3 -1.</_>
+        <_>
+          17 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 12 -1.</_>
+        <_>
+          13 5 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 20 -1.</_>
+        <_>
+          8 5 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 3 -1.</_>
+        <_>
+          11 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 12 -1.</_>
+        <_>
+          12 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 7 4 -1.</_>
+        <_>
+          11 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 1 2 -1.</_>
+        <_>
+          2 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 5 3 -1.</_>
+        <_>
+          6 10 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 2 -1.</_>
+        <_>
+          12 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 4 -1.</_>
+        <_>
+          0 11 2 2 2.</_>
+        <_>
+          2 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 8 -1.</_>
+        <_>
+          0 9 2 4 2.</_>
+        <_>
+          2 13 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 7 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 7 -1.</_>
+        <_>
+          1 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 2 -1.</_>
+        <_>
+          1 1 4 1 2.</_>
+        <_>
+          5 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 10 -1.</_>
+        <_>
+          2 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 9 -1.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 3 -1.</_>
+        <_>
+          8 1 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 3 6 -1.</_>
+        <_>
+          1 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 1 -1.</_>
+        <_>
+          3 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 11 3 -1.</_>
+        <_>
+          2 2 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 3 -1.</_>
+        <_>
+          14 9 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 6 -1.</_>
+        <_>
+          4 5 4 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 3 -1.</_>
+        <_>
+          5 6 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 5 4 -1.</_>
+        <_>
+          1 6 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 2 -1.</_>
+        <_>
+          15 0 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 2 -1.</_>
+        <_>
+          10 0 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 1 -1.</_>
+        <_>
+          14 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 12 3 -1.</_>
+        <_>
+          4 16 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 1 -1.</_>
+        <_>
+          8 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 12 -1.</_>
+        <_>
+          1 8 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 2 -1.</_>
+        <_>
+          7 16 1 1 2.</_>
+        <_>
+          8 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 10 -1.</_>
+        <_>
+          11 2 1 5 2.</_>
+        <_>
+          12 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 13 -1.</_>
+        <_>
+          8 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 4 -1.</_>
+        <_>
+          14 15 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 2 -1.</_>
+        <_>
+          6 8 5 1 2.</_>
+        <_>
+          11 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          7 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 2 -1.</_>
+        <_>
+          9 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 2 -1.</_>
+        <_>
+          4 9 5 1 2.</_>
+        <_>
+          9 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 2 -1.</_>
+        <_>
+          16 6 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 2 -1.</_>
+        <_>
+          10 3 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 12 -1.</_>
+        <_>
+          15 1 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 14 -1.</_>
+        <_>
+          10 0 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 4 -1.</_>
+        <_>
+          16 5 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 3 -1.</_>
+        <_>
+          1 4 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 6 -1.</_>
+        <_>
+          9 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 2 -1.</_>
+        <_>
+          10 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 2 -1.</_>
+        <_>
+          0 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 16 2 -1.</_>
+        <_>
+          3 19 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 6 3 -1.</_>
+        <_>
+          13 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 17 3 -1.</_>
+        <_>
+          1 18 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 1 4 -1.</_>
+        <_>
+          15 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 6 -1.</_>
+        <_>
+          1 9 3 3 2.</_>
+        <_>
+          4 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 12 2 -1.</_>
+        <_>
+          12 15 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 1 -1.</_>
+        <_>
+          5 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 1 -1.</_>
+        <_>
+          5 11 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 17 -1.</_>
+        <_>
+          11 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 4 8 -1.</_>
+        <_>
+          4 1 2 4 2.</_>
+        <_>
+          6 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 2 -1.</_>
+        <_>
+          6 13 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 19 2 1 -1.</_>
+        <_>
+          3 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 19 3 -1.</_>
+        <_>
+          0 2 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 6 -1.</_>
+        <_>
+          4 11 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 3 -1.</_>
+        <_>
+          4 3 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 15 9 -1.</_>
+        <_>
+          9 7 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 2 -1.</_>
+        <_>
+          6 2 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 18 -1.</_>
+        <_>
+          8 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 1 3 -1.</_>
+        <_>
+          3 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 15 2 -1.</_>
+        <_>
+          3 13 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 6 4 -1.</_>
+        <_>
+          3 16 3 2 2.</_>
+        <_>
+          6 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 9 -1.</_>
+        <_>
+          17 0 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 2 3 -1.</_>
+        <_>
+          17 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 4 -1.</_>
+        <_>
+          13 5 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 6 -1.</_>
+        <_>
+          11 3 3 3 2.</_>
+        <_>
+          14 6 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 1 4 -1.</_>
+        <_>
+          3 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 1 -1.</_>
+        <_>
+          3 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 2 -1.</_>
+        <_>
+          5 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 9 -1.</_>
+        <_>
+          9 8 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 2 -1.</_>
+        <_>
+          11 7 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 9 -1.</_>
+        <_>
+          0 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 1 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 1 4 -1.</_>
+        <_>
+          3 4 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 12 -1.</_>
+        <_>
+          1 2 9 6 2.</_>
+        <_>
+          10 8 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 1 4 -1.</_>
+        <_>
+          5 2 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 2 -1.</_>
+        <_>
+          1 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          4 3 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 3 -1.</_>
+        <_>
+          8 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 6 -1.</_>
+        <_>
+          6 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 3 -1.</_>
+        <_>
+          0 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 3 -1.</_>
+        <_>
+          17 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 9 -1.</_>
+        <_>
+          17 0 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 2 -1.</_>
+        <_>
+          14 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 9 -1.</_>
+        <_>
+          8 5 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 2 -1.</_>
+        <_>
+          11 0 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 4 -1.</_>
+        <_>
+          10 3 2 2 2.</_>
+        <_>
+          12 5 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 1 -1.</_>
+        <_>
+          7 2 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 12 -1.</_>
+        <_>
+          0 3 1 6 2.</_>
+        <_>
+          1 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 4 -1.</_>
+        <_>
+          4 9 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 12 -1.</_>
+        <_>
+          0 4 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 6 -1.</_>
+        <_>
+          16 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 1 3 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 18 -1.</_>
+        <_>
+          14 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          16 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 3 3 -1.</_>
+        <_>
+          15 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 1 -1.</_>
+        <_>
+          17 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 2 -1.</_>
+        <_>
+          4 0 4 1 2.</_>
+        <_>
+          8 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 8 4 -1.</_>
+        <_>
+          11 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 18 2 2 -1.</_>
+        <_>
+          15 18 1 1 2.</_>
+        <_>
+          16 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 4 -1.</_>
+        <_>
+          15 2 2 2 2.</_>
+        <_>
+          17 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 12 -1.</_>
+        <_>
+          19 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 3 -1.</_>
+        <_>
+          15 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 18 2 2 -1.</_>
+        <_>
+          16 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 18 2 1 -1.</_>
+        <_>
+          16 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 2 -1.</_>
+        <_>
+          0 0 9 1 2.</_>
+        <_>
+          9 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 4 -1.</_>
+        <_>
+          5 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 3 -1.</_>
+        <_>
+          15 12 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          9 5 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 4 -1.</_>
+        <_>
+          5 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          9 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 3 -1.</_>
+        <_>
+          12 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 5 -1.</_>
+        <_>
+          16 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 1 4 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 1 -1.</_>
+        <_>
+          13 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 10 -1.</_>
+        <_>
+          9 8 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 4 -1.</_>
+        <_>
+          4 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 2 1 -1.</_>
+        <_>
+          16 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 6 -1.</_>
+        <_>
+          7 3 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 2 -1.</_>
+        <_>
+          3 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 2 -1.</_>
+        <_>
+          4 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 4 -1.</_>
+        <_>
+          17 3 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 6 -1.</_>
+        <_>
+          5 6 2 3 2.</_>
+        <_>
+          7 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 13 2 -1.</_>
+        <_>
+          7 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 1 6 -1.</_>
+        <_>
+          16 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 1 1 2.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 5 2 -1.</_>
+        <_>
+          4 4 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 17 2 2 -1.</_>
+        <_>
+          14 17 1 1 2.</_>
+        <_>
+          15 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 2 -1.</_>
+        <_>
+          15 1 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 2 -1.</_>
+        <_>
+          15 1 1 1 2.</_>
+        <_>
+          16 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 7 -1.</_>
+        <_>
+          7 10 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 5 -1.</_>
+        <_>
+          15 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 6 -1.</_>
+        <_>
+          7 4 3 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 8 10 -1.</_>
+        <_>
+          2 11 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 2 -1.</_>
+        <_>
+          1 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 15 4 -1.</_>
+        <_>
+          5 17 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 4 -1.</_>
+        <_>
+          15 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 3 -1.</_>
+        <_>
+          6 3 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 10 3 -1.</_>
+        <_>
+          8 3 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 4 -1.</_>
+        <_>
+          17 9 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 1 12 -1.</_>
+        <_>
+          2 11 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 3 6 -1.</_>
+        <_>
+          18 15 1 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 2 -1.</_>
+        <_>
+          14 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 2 -1.</_>
+        <_>
+          4 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 5 -1.</_>
+        <_>
+          7 4 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 2 -1.</_>
+        <_>
+          5 15 1 1 2.</_>
+        <_>
+          6 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 3 -1.</_>
+        <_>
+          12 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 6 -1.</_>
+        <_>
+          13 0 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 8 -1.</_>
+        <_>
+          10 1 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 3 -1.</_>
+        <_>
+          17 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 3 -1.</_>
+        <_>
+          14 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 1 3 -1.</_>
+        <_>
+          1 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 1 2 -1.</_>
+        <_>
+          10 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 4 -1.</_>
+        <_>
+          19 13 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 6 -1.</_>
+        <_>
+          9 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 10 -1.</_>
+        <_>
+          2 9 9 5 2.</_>
+        <_>
+          11 14 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 6 -1.</_>
+        <_>
+          11 4 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 4 -1.</_>
+        <_>
+          17 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 4 -1.</_>
+        <_>
+          3 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 10 -1.</_>
+        <_>
+          19 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 6 -1.</_>
+        <_>
+          1 7 3 3 2.</_>
+        <_>
+          4 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 3 12 -1.</_>
+        <_>
+          11 6 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 7 6 -1.</_>
+        <_>
+          3 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 1 3 -1.</_>
+        <_>
+          8 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 6 -1.</_>
+        <_>
+          4 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 4 3 -1.</_>
+        <_>
+          1 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 4 -1.</_>
+        <_>
+          7 1 2 2 2.</_>
+        <_>
+          9 3 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 2 2 -1.</_>
+        <_>
+          2 4 1 1 2.</_>
+        <_>
+          3 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 3 -1.</_>
+        <_>
+          2 5 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 17 3 -1.</_>
+        <_>
+          0 7 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 7 10 1 3.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface.xml
new file mode 100644
index 000000000..1c38a8bab
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface.xml
@@ -0,0 +1,14382 @@
+<?xml version="1.0"?>
+<!--
+ A frontal cat face detector using the basic set of Haar features, i.e.
+ horizontal and vertical features but not diagonal features.
+
+ Contributed by Joseph Howse (josephhowse@nummist.com).
+
+ More information can be found in the following publications and
+ presentations:
+
+ Joseph Howse. OpenCV for Secret Agents (book). Packt Publishing, January
+   2015.
+ Joseph Howse. "Training Detectors and Recognizers in Python and OpenCV"
+   (tutorial). ISMAR 2014. September 9, 2014.
+   http://nummist.com/opencv/Howse_ISMAR_20140909.pdf
+ Joseph Howse. "Training Intelligent Camera Systems with Python and OpenCV"
+   (webcast). O’Reilly Media. June 17, 2014.
+   http://www.oreilly.com/pub/e/3077
+
+ Build scripts and demo applications can be found in the following repository:
+ https://bitbucket.org/Joe_Howse/angora-blue
+
+ KNOWN LIMITATIONS:
+
+ An upright subject is assumed. In situations where the cat's face might be
+ sideways or upside down (e.g. the cat is rolling over), try various rotations
+ of the input image.
+
+ CHANGELOG:
+
+ 2016-08-06: Re-trained with more negative samples and more stages. False
+   positives are much rarer now. If you tailored your code for the cascade's
+   previous version, now you should re-adjust the arguments of
+   CascadeClassifier::detectMultiScale. For example, decrease the value of the
+   minNeighbors argument. You do not need to use a human face detector to
+   cross-check the positives anymore.
+ 2014-04-25: First release (at https://bitbucket.org/Joe_Howse/angora-blue)
+
+ //////////////////////////////////////////////////////////////////////////
+ | Contributors License Agreement
+ | IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+ |   By downloading, copying, installing or using the software you agree
+ |   to this license.
+ |   If you do not agree to this license, do not download, install,
+ |   copy or use the software.
+ |
+ | Copyright (c) 2014-2016, Joseph Howse (Nummist Media Corporation Limited,
+ | Halifax, Nova Scotia, Canada). All rights reserved.
+ |
+ | Redistribution and use in source and binary forms, with or without
+ | modification, are permitted provided that the following conditions are
+ | met:
+ |
+ |    * Redistributions of source code must retain the above copyright
+ |       notice, this list of conditions and the following disclaimer.
+ |    * Redistributions in binary form must reproduce the above
+ |      copyright notice, this list of conditions and the following
+ |      disclaimer in the documentation and/or other materials provided
+ |      with the distribution.
+ |    * The name of Contributor may not used to endorse or promote products
+ |      derived from this software without specific prior written permission.
+ |
+ | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ | A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ | CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+ | Top
+ //////////////////////////////////////////////////////////////////////////
+ -->
+<opencv_storage>
+<cascade>
+  <stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>24</height>
+  <width>24</width>
+  <stageParams>
+    <boostType>GAB</boostType>
+    <minHitRate>9.9500000476837158e-01</minHitRate>
+    <maxFalseAlarm>5.0000000000000000e-01</maxFalseAlarm>
+    <weightTrimRate>9.4999999999999996e-01</weightTrimRate>
+    <maxDepth>1</maxDepth>
+    <maxWeakCount>100</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount>
+    <featSize>1</featSize>
+    <mode>BASIC</mode></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <!-- stage 0 -->
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-1.4806525707244873e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 472 -1.5126220881938934e-02</internalNodes>
+          <leafValues>
+            7.5887596607208252e-01 -3.4230688214302063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 3.9337221533060074e-03</internalNodes>
+          <leafValues>
+            -3.3288389444351196e-01 5.2361363172531128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -1.5044892206788063e-02</internalNodes>
+          <leafValues>
+            5.5565774440765381e-01 -2.2505992650985718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -1.2927042320370674e-02</internalNodes>
+          <leafValues>
+            5.7442700862884521e-01 -1.9708566367626190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 5.5960696190595627e-03</internalNodes>
+          <leafValues>
+            -3.0430641770362854e-01 4.0241482853889465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 1.5758406370878220e-02</internalNodes>
+          <leafValues>
+            -1.9767063856124878e-01 4.5033392310142517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 2.4262722581624985e-02</internalNodes>
+          <leafValues>
+            -1.6931040585041046e-01 5.9707510471343994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 -3.5242564976215363e-02</internalNodes>
+          <leafValues>
+            6.5973556041717529e-01 -1.4519356191158295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 2.6568008586764336e-02</internalNodes>
+          <leafValues>
+            -1.3476610183715820e-01 5.4296624660491943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 4.7154121100902557e-02</internalNodes>
+          <leafValues>
+            -1.7337851226329803e-01 4.6071702241897583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -5.3081759251654148e-03</internalNodes>
+          <leafValues>
+            5.4976856708526611e-01 -1.1913410574197769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 5.3415738046169281e-02</internalNodes>
+          <leafValues>
+            -1.2382411211729050e-01 6.3972741365432739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 -3.0798995867371559e-03</internalNodes>
+          <leafValues>
+            -8.2048600912094116e-01 1.0249497741460800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -2.3766520898789167e-03</internalNodes>
+          <leafValues>
+            -7.0665025711059570e-01 6.7025005817413330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 1.1965663870796561e-03</internalNodes>
+          <leafValues>
+            -2.4753804504871368e-01 3.0198124051094055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -4.2106406763195992e-03</internalNodes>
+          <leafValues>
+            3.8455343246459961e-01 -1.8334107100963593e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 1 -->
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.4618960618972778e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 725 1.0133055038750172e-02</internalNodes>
+          <leafValues>
+            -2.8207325935363770e-01 6.2703561782836914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 3.8468956947326660e-02</internalNodes>
+          <leafValues>
+            -1.4483113586902618e-01 7.4971008300781250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -3.7523733917623758e-03</internalNodes>
+          <leafValues>
+            4.2959973216056824e-01 -2.1445912122726440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 9.9978316575288773e-04</internalNodes>
+          <leafValues>
+            -1.9259409606456757e-01 4.2325544357299805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -1.6786376014351845e-02</internalNodes>
+          <leafValues>
+            5.0582861900329590e-01 -1.8607729673385620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 3.0330579727888107e-02</internalNodes>
+          <leafValues>
+            -2.1100421249866486e-01 4.2819553613662720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 1.5150709077715874e-02</internalNodes>
+          <leafValues>
+            -2.1129198372364044e-01 3.6263525485992432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 -3.6349350120872259e-03</internalNodes>
+          <leafValues>
+            3.9500275254249573e-01 -1.8650630116462708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -7.2061517275869846e-03</internalNodes>
+          <leafValues>
+            -7.2816300392150879e-01 1.1153221875429153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 -2.0212728530168533e-02</internalNodes>
+          <leafValues>
+            5.6296736001968384e-01 -1.2056054919958115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 2.5640423409640789e-03</internalNodes>
+          <leafValues>
+            -2.3753854632377625e-01 3.5794413089752197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 -6.2726587057113647e-03</internalNodes>
+          <leafValues>
+            -6.7750877141952515e-01 1.2570948898792267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 7.8710336238145828e-03</internalNodes>
+          <leafValues>
+            6.9211356341838837e-02 -7.6449161767959595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 5.9134580194950104e-02</internalNodes>
+          <leafValues>
+            -1.7324967682361603e-01 3.3361187577247620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -2.8770491480827332e-03</internalNodes>
+          <leafValues>
+            3.6101511120796204e-01 -1.6122241318225861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -5.7046953588724136e-03</internalNodes>
+          <leafValues>
+            -6.7659336328506470e-01 8.4153175354003906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -7.8070178627967834e-02</internalNodes>
+          <leafValues>
+            6.0763663053512573e-01 -1.1037797480821609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 6.5858578309416771e-03</internalNodes>
+          <leafValues>
+            9.3060031533241272e-02 -7.0068693161010742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 -2.0920131355524063e-03</internalNodes>
+          <leafValues>
+            2.8173315525054932e-01 -1.8406434357166290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -2.1252598613500595e-02</internalNodes>
+          <leafValues>
+            3.9672371745109558e-01 -1.5127600729465485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -3.2937981188297272e-02</internalNodes>
+          <leafValues>
+            3.9487251639366150e-01 -1.3228580355644226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 4.9491915851831436e-03</internalNodes>
+          <leafValues>
+            1.1234261840581894e-01 -4.7414371371269226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 3.4271054901182652e-03</internalNodes>
+          <leafValues>
+            7.8623600304126740e-02 -5.7828009128570557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -6.0859560035169125e-03</internalNodes>
+          <leafValues>
+            -5.0091904401779175e-01 9.1926425695419312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 1.2116413563489914e-02</internalNodes>
+          <leafValues>
+            -1.7154470086097717e-01 2.6759135723114014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 8.2814376801252365e-03</internalNodes>
+          <leafValues>
+            -1.2938241660594940e-01 3.5665917396545410e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 2 -->
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.4103703498840332e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 532 -1.0988018475472927e-02</internalNodes>
+          <leafValues>
+            6.4358645677566528e-01 -2.3149165511131287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -7.8163212165236473e-03</internalNodes>
+          <leafValues>
+            5.4850798845291138e-01 -1.7881108820438385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 7.1337133646011353e-02</internalNodes>
+          <leafValues>
+            -1.7631703615188599e-01 4.5873588323593140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 5.2656695246696472e-02</internalNodes>
+          <leafValues>
+            -1.3836050033569336e-01 5.6253266334533691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 1.5166129916906357e-02</internalNodes>
+          <leafValues>
+            -2.0990008115768433e-01 4.0483391284942627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -1.4538960531353951e-03</internalNodes>
+          <leafValues>
+            3.3692672848701477e-01 -2.1745139360427856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 1.1136244982481003e-02</internalNodes>
+          <leafValues>
+            -1.5003634989261627e-01 5.2208083868026733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -3.3187635708600283e-03</internalNodes>
+          <leafValues>
+            3.9145255088806152e-01 -1.9418042898178101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 4.9791105091571808e-02</internalNodes>
+          <leafValues>
+            -1.0192432254552841e-01 5.4612094163894653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 4.3476112186908722e-02</internalNodes>
+          <leafValues>
+            -1.2768918275833130e-01 5.0825607776641846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -2.8149634599685669e-03</internalNodes>
+          <leafValues>
+            -7.0453292131423950e-01 1.2536850571632385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 1.6101204091683030e-03</internalNodes>
+          <leafValues>
+            -2.6965174078941345e-01 2.2737979888916016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -1.5866891480982304e-03</internalNodes>
+          <leafValues>
+            -6.6891485452651978e-01 1.1686278134584427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -3.2338392920792103e-03</internalNodes>
+          <leafValues>
+            -6.7284232378005981e-01 6.6228114068508148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -9.9909156560897827e-03</internalNodes>
+          <leafValues>
+            3.6961549520492554e-01 -1.5993835031986237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 4.8409838229417801e-02</internalNodes>
+          <leafValues>
+            -1.0068884491920471e-01 5.0648134946823120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 8.0585200339555740e-03</internalNodes>
+          <leafValues>
+            -1.6782654821872711e-01 3.5382467508316040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -1.1718695983290672e-02</internalNodes>
+          <leafValues>
+            4.3832498788833618e-01 -1.2780784070491791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 5.7147610932588577e-03</internalNodes>
+          <leafValues>
+            7.5814604759216309e-02 -7.2597140073776245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 -2.0917234942317009e-03</internalNodes>
+          <leafValues>
+            -6.0916984081268311e-01 8.4811411798000336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 5.7651996612548828e-03</internalNodes>
+          <leafValues>
+            -1.9243443012237549e-01 2.8976503014564514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -2.8093710541725159e-02</internalNodes>
+          <leafValues>
+            5.4229170083999634e-01 -1.0005526244640350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 8.9291334152221680e-03</internalNodes>
+          <leafValues>
+            8.3808921277523041e-02 -6.3219338655471802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -5.1958961412310600e-03</internalNodes>
+          <leafValues>
+            -5.4964137077331543e-01 7.9588212072849274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 9.2318728566169739e-03</internalNodes>
+          <leafValues>
+            -1.2818163633346558e-01 4.2056322097778320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 -2.0556427538394928e-02</internalNodes>
+          <leafValues>
+            3.2048463821411133e-01 -1.3858842849731445e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 3 -->
+    <_>
+      <maxWeakCount>35</maxWeakCount>
+      <stageThreshold>-1.4265209436416626e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 683 1.8821602687239647e-02</internalNodes>
+          <leafValues>
+            -1.7807419598102570e-01 5.9040957689285278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 -9.5066539943218231e-03</internalNodes>
+          <leafValues>
+            5.0587177276611328e-01 -1.7767964303493500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 1.3296608813107014e-03</internalNodes>
+          <leafValues>
+            -1.6886346042156219e-01 3.6326614022254944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 3.5266026854515076e-02</internalNodes>
+          <leafValues>
+            -1.1824090778827667e-01 5.8951085805892944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 1.7804209142923355e-02</internalNodes>
+          <leafValues>
+            -1.4211210608482361e-01 5.1762068271636963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 4.7029324923641980e-04</internalNodes>
+          <leafValues>
+            -2.4296821653842926e-01 2.5087893009185791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 7.1838246658444405e-03</internalNodes>
+          <leafValues>
+            9.2609666287899017e-02 -6.7694115638732910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -5.7565318420529366e-03</internalNodes>
+          <leafValues>
+            -7.3053181171417236e-01 8.2794629037380219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 2.0850602537393570e-02</internalNodes>
+          <leafValues>
+            -1.7353208363056183e-01 3.3287450671195984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 3.1848326325416565e-03</internalNodes>
+          <leafValues>
+            -2.0941653847694397e-01 2.6059800386428833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -7.5752258300781250e-02</internalNodes>
+          <leafValues>
+            5.1588213443756104e-01 -1.0057342052459717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 2.8725115582346916e-02</internalNodes>
+          <leafValues>
+            -1.5012685954570770e-01 4.1436919569969177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -1.7325732856988907e-02</internalNodes>
+          <leafValues>
+            3.8678762316703796e-01 -1.3586300611495972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -3.2187681645154953e-03</internalNodes>
+          <leafValues>
+            -5.1590150594711304e-01 1.1511231958866119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -6.1595086008310318e-03</internalNodes>
+          <leafValues>
+            -7.0271849632263184e-01 5.5648274719715118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 -8.7264683097600937e-03</internalNodes>
+          <leafValues>
+            2.6393634080886841e-01 -1.8446569144725800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 8.1868227571249008e-03</internalNodes>
+          <leafValues>
+            8.0838531255722046e-02 -5.5512112379074097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -7.8468751162290573e-03</internalNodes>
+          <leafValues>
+            -5.7306796312332153e-01 8.3454042673110962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 2.9962153639644384e-03</internalNodes>
+          <leafValues>
+            6.2645487487316132e-02 -5.8123600482940674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -4.3795984238386154e-03</internalNodes>
+          <leafValues>
+            2.2211562097072601e-01 -1.9649308919906616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -6.3172029331326485e-03</internalNodes>
+          <leafValues>
+            -6.6067039966583252e-01 6.4884319901466370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 1.3302030274644494e-03</internalNodes>
+          <leafValues>
+            -1.0496762394905090e-01 4.2326071858406067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 -4.3333107605576515e-03</internalNodes>
+          <leafValues>
+            -4.9972066283226013e-01 8.7225496768951416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 -3.5346355289220810e-03</internalNodes>
+          <leafValues>
+            3.0818134546279907e-01 -1.4765550196170807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 -8.7353587150573730e-03</internalNodes>
+          <leafValues>
+            -6.5214675664901733e-01 7.1881487965583801e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -1.5620354562997818e-02</internalNodes>
+          <leafValues>
+            3.5721915960311890e-01 -1.1427627503871918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 -3.9745438843965530e-03</internalNodes>
+          <leafValues>
+            -6.6090464591979980e-01 6.2067609280347824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 -6.7040426656603813e-03</internalNodes>
+          <leafValues>
+            2.7337384223937988e-01 -1.4059108495712280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 3.5359347239136696e-03</internalNodes>
+          <leafValues>
+            6.1201948672533035e-02 -6.0017114877700806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 6.0818484053015709e-03</internalNodes>
+          <leafValues>
+            -1.5247075259685516e-01 2.4383027851581573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 -7.2771648410707712e-04</internalNodes>
+          <leafValues>
+            3.0065426230430603e-01 -1.2037902325391769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 4.6168416738510132e-03</internalNodes>
+          <leafValues>
+            5.5311698466539383e-02 -7.5343269109725952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 2.5280299596488476e-03</internalNodes>
+          <leafValues>
+            5.7204965502023697e-02 -5.3993463516235352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 1.5074670314788818e-02</internalNodes>
+          <leafValues>
+            -9.6106290817260742e-02 3.9084190130233765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -8.4932018071413040e-03</internalNodes>
+          <leafValues>
+            3.4130987524986267e-01 -1.4117397367954254e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 4 -->
+    <_>
+      <maxWeakCount>37</maxWeakCount>
+      <stageThreshold>-1.3977209329605103e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 794 -2.5338861159980297e-03</internalNodes>
+          <leafValues>
+            5.7321399450302124e-01 -2.0396080613136292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -6.5112011507153511e-03</internalNodes>
+          <leafValues>
+            3.7378740310668945e-01 -2.5049039721488953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 1.6318978741765022e-03</internalNodes>
+          <leafValues>
+            -2.1858637034893036e-01 3.5027471184730530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 3.3452022820711136e-02</internalNodes>
+          <leafValues>
+            -1.4827065169811249e-01 4.7324529290199280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -1.1114047840237617e-02</internalNodes>
+          <leafValues>
+            4.1662359237670898e-01 -2.1660456061363220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -1.2996498262509704e-03</internalNodes>
+          <leafValues>
+            4.7613915801048279e-01 -1.6742442548274994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 -3.2986078877002001e-03</internalNodes>
+          <leafValues>
+            -6.7662662267684937e-01 8.6653761565685272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 6.6831205040216446e-03</internalNodes>
+          <leafValues>
+            -2.0158858597278595e-01 2.6189696788787842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 2.1282089874148369e-03</internalNodes>
+          <leafValues>
+            -1.1156299710273743e-01 4.0097075700759888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 -9.0472139418125153e-03</internalNodes>
+          <leafValues>
+            3.2078295946121216e-01 -1.6775439679622650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 -5.3160609677433968e-03</internalNodes>
+          <leafValues>
+            -5.5567348003387451e-01 1.2950280308723450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 7.9724024981260300e-03</internalNodes>
+          <leafValues>
+            -2.1466700732707977e-01 2.2514854371547699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 -2.1980279125273228e-03</internalNodes>
+          <leafValues>
+            2.8711742162704468e-01 -1.6561916470527649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 5.3897619247436523e-02</internalNodes>
+          <leafValues>
+            -1.4823001623153687e-01 3.4951418638229370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -7.6241128146648407e-02</internalNodes>
+          <leafValues>
+            6.0101884603500366e-01 -8.8328786194324493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -8.3202747628092766e-03</internalNodes>
+          <leafValues>
+            -7.2828358411788940e-01 8.7956465780735016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 5.3778752684593201e-02</internalNodes>
+          <leafValues>
+            -1.0316975414752960e-01 5.0247919559478760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -1.2401826679706573e-02</internalNodes>
+          <leafValues>
+            2.7538898587226868e-01 -1.5569972991943359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 1.3729928061366081e-02</internalNodes>
+          <leafValues>
+            -1.3373774290084839e-01 3.0739122629165649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 -2.2788168862462044e-03</internalNodes>
+          <leafValues>
+            2.2555501759052277e-01 -1.9497908651828766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 3.6288173869252205e-03</internalNodes>
+          <leafValues>
+            4.8981692641973495e-02 -7.9248648881912231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 5.2453137934207916e-02</internalNodes>
+          <leafValues>
+            -1.3389803469181061e-01 3.2700663805007935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 3.1685843132436275e-03</internalNodes>
+          <leafValues>
+            -1.4415425062179565e-01 2.8044179081916809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 8.9051481336355209e-03</internalNodes>
+          <leafValues>
+            6.1227656900882721e-02 -7.0277702808380127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -1.3966157566756010e-03</internalNodes>
+          <leafValues>
+            4.2409667372703552e-01 -1.0888981819152832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -6.7695947363972664e-03</internalNodes>
+          <leafValues>
+            -5.1588076353073120e-01 8.3254821598529816e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 2.2157761268317699e-03</internalNodes>
+          <leafValues>
+            -1.3696527481079102e-01 2.8638482093811035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 2.7808796148747206e-03</internalNodes>
+          <leafValues>
+            7.1316704154014587e-02 -6.0322999954223633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 4.5836241915822029e-03</internalNodes>
+          <leafValues>
+            -1.2486589699983597e-01 3.2929363846778870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 -5.1459800451993942e-03</internalNodes>
+          <leafValues>
+            -5.3781992197036743e-01 7.6631128787994385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 2.4449056945741177e-03</internalNodes>
+          <leafValues>
+            8.5920669138431549e-02 -4.0670683979988098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -2.7756379917263985e-02</internalNodes>
+          <leafValues>
+            3.7449231743812561e-01 -1.0538945347070694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -1.8243372440338135e-02</internalNodes>
+          <leafValues>
+            3.4281516075134277e-01 -9.9502928555011749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 3.8416781462728977e-03</internalNodes>
+          <leafValues>
+            7.3987491428852081e-02 -4.8903524875640869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -1.2322908267378807e-02</internalNodes>
+          <leafValues>
+            2.1036790311336517e-01 -1.5852701663970947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -4.1760304011404514e-03</internalNodes>
+          <leafValues>
+            3.1288132071495056e-01 -1.1697492748498917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 -2.8026863932609558e-02</internalNodes>
+          <leafValues>
+            3.3711743354797363e-01 -1.2294299900531769e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 5 -->
+    <_>
+      <maxWeakCount>42</maxWeakCount>
+      <stageThreshold>-1.3775455951690674e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 725 1.3382414355874062e-02</internalNodes>
+          <leafValues>
+            -1.7922241985797882e-01 5.0368404388427734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 1.9935802556574345e-03</internalNodes>
+          <leafValues>
+            -2.5249919295310974e-01 3.5295018553733826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -1.3569685397669673e-03</internalNodes>
+          <leafValues>
+            4.1222429275512695e-01 -1.8140394985675812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 2.5418698787689209e-03</internalNodes>
+          <leafValues>
+            -2.3195247352123260e-01 2.5945317745208740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 1.1867792345583439e-03</internalNodes>
+          <leafValues>
+            -1.1509010195732117e-01 4.0095508098602295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -4.0491363033652306e-03</internalNodes>
+          <leafValues>
+            -7.6275551319122314e-01 8.0663219094276428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 2.4698153138160706e-02</internalNodes>
+          <leafValues>
+            -9.9053405225276947e-02 4.6469488739967346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 1.3041709549725056e-02</internalNodes>
+          <leafValues>
+            -1.3049817085266113e-01 4.7066822648048401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -2.0927201956510544e-02</internalNodes>
+          <leafValues>
+            -7.2363191843032837e-01 7.5520738959312439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 1.6108792275190353e-02</internalNodes>
+          <leafValues>
+            8.9385204017162323e-02 -5.0678378343582153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 -8.6308103054761887e-03</internalNodes>
+          <leafValues>
+            3.1878158450126648e-01 -1.3526505231857300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 1.2651814613491297e-03</internalNodes>
+          <leafValues>
+            -1.2344279885292053e-01 4.0271109342575073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -3.0170590616762638e-03</internalNodes>
+          <leafValues>
+            -5.6960099935531616e-01 7.0437252521514893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 -3.5529488231986761e-03</internalNodes>
+          <leafValues>
+            2.0624065399169922e-01 -1.8426756560802460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 2.8021419420838356e-03</internalNodes>
+          <leafValues>
+            7.2748780250549316e-02 -5.3796368837356567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -9.9331419914960861e-04</internalNodes>
+          <leafValues>
+            2.4827398359775543e-01 -1.5866567194461823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 -7.1950745768845081e-03</internalNodes>
+          <leafValues>
+            -5.0943744182586670e-01 7.3041573166847229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -8.7737981230020523e-03</internalNodes>
+          <leafValues>
+            2.4838714301586151e-01 -1.5162147581577301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 5.6750684976577759e-02</internalNodes>
+          <leafValues>
+            -8.4416143596172333e-02 4.4269657135009766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 1.8110256642103195e-03</internalNodes>
+          <leafValues>
+            -1.7787678539752960e-01 2.2753682732582092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 6.1733853071928024e-02</internalNodes>
+          <leafValues>
+            -1.4452947676181793e-01 2.6785543560981750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 1.7999792471528053e-03</internalNodes>
+          <leafValues>
+            5.3869031369686127e-02 -7.0216673612594604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -1.7839821521192789e-03</internalNodes>
+          <leafValues>
+            -7.3474282026290894e-01 4.3809492141008377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -2.2269869223237038e-03</internalNodes>
+          <leafValues>
+            2.5256577134132385e-01 -1.4765015244483948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 7.7408831566572189e-04</internalNodes>
+          <leafValues>
+            -1.6781617701053619e-01 2.5267890095710754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 9.6316616982221603e-03</internalNodes>
+          <leafValues>
+            5.8525908738374710e-02 -6.3684886693954468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -1.1892126873135567e-02</internalNodes>
+          <leafValues>
+            2.6363542675971985e-01 -1.4106634259223938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 4.8407237976789474e-02</internalNodes>
+          <leafValues>
+            -1.0837136209011078e-01 3.6018091440200806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -1.0315750539302826e-01</internalNodes>
+          <leafValues>
+            -7.3309695720672607e-01 6.4976803958415985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 -2.6544972788542509e-03</internalNodes>
+          <leafValues>
+            2.7709859609603882e-01 -1.3764445483684540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -4.8850756138563156e-03</internalNodes>
+          <leafValues>
+            -5.0026285648345947e-01 6.8797707557678223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -1.1310833506286144e-02</internalNodes>
+          <leafValues>
+            2.5653550028800964e-01 -1.3755545020103455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -3.8394361734390259e-02</internalNodes>
+          <leafValues>
+            2.6404461264610291e-01 -1.3614650070667267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 5.8298893272876740e-03</internalNodes>
+          <leafValues>
+            6.0382172465324402e-02 -5.9578329324722290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 2.2631133906543255e-03</internalNodes>
+          <leafValues>
+            -1.0302778333425522e-01 3.4782779216766357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 -1.8709234893321991e-02</internalNodes>
+          <leafValues>
+            -7.6758313179016113e-01 4.6181913465261459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 3.7359733134508133e-02</internalNodes>
+          <leafValues>
+            -1.3407541811466217e-01 2.5607112050056458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 -5.3099328652024269e-03</internalNodes>
+          <leafValues>
+            -6.9016355276107788e-01 4.7683756798505783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -1.5396323287859559e-03</internalNodes>
+          <leafValues>
+            3.7874689698219299e-01 -9.2663109302520752e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 -2.6333518326282501e-03</internalNodes>
+          <leafValues>
+            2.9358446598052979e-01 -1.2460695207118988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 1.6515964642167091e-02</internalNodes>
+          <leafValues>
+            -1.4082725346088409e-01 2.3664724826812744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 -4.4658156111836433e-03</internalNodes>
+          <leafValues>
+            -5.9253305196762085e-01 5.5994171649217606e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 6 -->
+    <_>
+      <maxWeakCount>50</maxWeakCount>
+      <stageThreshold>-1.3835698366165161e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 898 1.5156399458646774e-03</internalNodes>
+          <leafValues>
+            -1.0024535655975342e-01 5.8807808160781860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 -3.5168868489563465e-03</internalNodes>
+          <leafValues>
+            4.0972998738288879e-01 -1.6088742017745972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 2.3035616613924503e-03</internalNodes>
+          <leafValues>
+            -1.8985269963741302e-01 2.9883998632431030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 4.5840561389923096e-02</internalNodes>
+          <leafValues>
+            -1.4383240044116974e-01 4.7528687119483948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 5.5156396701931953e-03</internalNodes>
+          <leafValues>
+            -1.7356806993484497e-01 3.4583050012588501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 3.9731184951961040e-03</internalNodes>
+          <leafValues>
+            7.8886620700359344e-02 -5.6442558765411377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -5.6995991617441177e-03</internalNodes>
+          <leafValues>
+            -4.7576662898063660e-01 9.4875656068325043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -9.6501735970377922e-03</internalNodes>
+          <leafValues>
+            2.3381656408309937e-01 -1.8310526013374329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 6.1656545847654343e-02</internalNodes>
+          <leafValues>
+            -1.4697165787220001e-01 3.6247691512107849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 1.1418928205966949e-01</internalNodes>
+          <leafValues>
+            -8.8033527135848999e-02 4.4633501768112183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 -1.1903396807610989e-02</internalNodes>
+          <leafValues>
+            3.3496665954589844e-01 -1.2121009081602097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 -4.1371315717697144e-02</internalNodes>
+          <leafValues>
+            4.1400006413459778e-01 -9.7229279577732086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 7.8342631459236145e-03</internalNodes>
+          <leafValues>
+            -1.6631671786308289e-01 2.5738984346389771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -4.5139621943235397e-03</internalNodes>
+          <leafValues>
+            -4.6883803606033325e-01 8.7662570178508759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 1.5914421528577805e-03</internalNodes>
+          <leafValues>
+            -1.1636006087064743e-01 3.2739594578742981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 -5.2607608959078789e-03</internalNodes>
+          <leafValues>
+            -6.7755740880966187e-01 5.1752120256423950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 3.1824512407183647e-03</internalNodes>
+          <leafValues>
+            5.2379645407199860e-02 -6.0918039083480835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -3.6813789047300816e-03</internalNodes>
+          <leafValues>
+            4.8251116275787354e-01 -9.2318780720233917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 -4.3226117268204689e-03</internalNodes>
+          <leafValues>
+            -5.7561415433883667e-01 5.9672243893146515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 -7.1843853220343590e-03</internalNodes>
+          <leafValues>
+            2.6631006598472595e-01 -1.4015418291091919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 2.1028071641921997e-03</internalNodes>
+          <leafValues>
+            -1.1286304146051407e-01 3.5946926474571228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 8.5248583927750587e-03</internalNodes>
+          <leafValues>
+            6.9424033164978027e-02 -5.2462881803512573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 6.9785099476575851e-03</internalNodes>
+          <leafValues>
+            5.6668873876333237e-02 -5.6192052364349365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -5.2639590576291084e-03</internalNodes>
+          <leafValues>
+            -5.8648955821990967e-01 5.0352573394775391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 2.8417459689080715e-03</internalNodes>
+          <leafValues>
+            -1.3425759971141815e-01 2.7325555682182312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -1.3187457807362080e-02</internalNodes>
+          <leafValues>
+            4.0453648567199707e-01 -9.1843754053115845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 -6.7344801500439644e-03</internalNodes>
+          <leafValues>
+            -7.5647395849227905e-01 5.0157479941844940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 2.1363141015172005e-02</internalNodes>
+          <leafValues>
+            4.7982390969991684e-02 -5.5388218164443970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 1.6145884292200208e-03</internalNodes>
+          <leafValues>
+            7.9808227717876434e-02 -3.7233716249465942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -2.2595757618546486e-03</internalNodes>
+          <leafValues>
+            2.8343635797500610e-01 -1.1216876655817032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 1.4407988637685776e-02</internalNodes>
+          <leafValues>
+            -1.0392460227012634e-01 3.1299999356269836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 -1.4912552433088422e-03</internalNodes>
+          <leafValues>
+            2.8538599610328674e-01 -1.0644508898258209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 9.8895151168107986e-03</internalNodes>
+          <leafValues>
+            5.0090074539184570e-02 -6.2053185701370239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 4.2754956521093845e-03</internalNodes>
+          <leafValues>
+            6.5051443874835968e-02 -4.2582303285598755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -2.5489409454166889e-03</internalNodes>
+          <leafValues>
+            3.1278640031814575e-01 -9.9601686000823975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -6.0358326882123947e-03</internalNodes>
+          <leafValues>
+            2.2685267031192780e-01 -1.3849361240863800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 1.1879121884703636e-02</internalNodes>
+          <leafValues>
+            -8.9687183499336243e-02 3.7642294168472290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 1.2982923537492752e-02</internalNodes>
+          <leafValues>
+            4.3990727514028549e-02 -7.3371982574462891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 -2.8599319048225880e-03</internalNodes>
+          <leafValues>
+            -4.3102917075157166e-01 5.9561621397733688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 -3.5829999251291156e-04</internalNodes>
+          <leafValues>
+            1.7152757942676544e-01 -1.6511310636997223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 2.5972571223974228e-02</internalNodes>
+          <leafValues>
+            -1.2855969369411469e-01 2.2820757329463959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 4.2565623298287392e-03</internalNodes>
+          <leafValues>
+            5.7662181556224823e-02 -5.3734982013702393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -2.9159568250179291e-02</internalNodes>
+          <leafValues>
+            -6.3020753860473633e-01 4.0746636688709259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 3.1341956928372383e-03</internalNodes>
+          <leafValues>
+            -8.1374719738960266e-02 4.1371321678161621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -1.3592604082077742e-03</internalNodes>
+          <leafValues>
+            3.2382342219352722e-01 -9.7880341112613678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 -6.9904811680316925e-03</internalNodes>
+          <leafValues>
+            -6.8850576877593994e-01 4.2428225278854370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 -8.7879784405231476e-03</internalNodes>
+          <leafValues>
+            -5.8945190906524658e-01 3.7613209336996078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -1.7947785556316376e-02</internalNodes>
+          <leafValues>
+            3.1659606099128723e-01 -8.7437197566032410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 8.0379713326692581e-03</internalNodes>
+          <leafValues>
+            -1.1311284452676773e-01 3.0860018730163574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 3.0642822384834290e-03</internalNodes>
+          <leafValues>
+            4.8351831734180450e-02 -6.0563534498214722e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 7 -->
+    <_>
+      <maxWeakCount>54</maxWeakCount>
+      <stageThreshold>-1.3756012916564941e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 798 -1.7431776504963636e-03</internalNodes>
+          <leafValues>
+            5.5538344383239746e-01 -1.0357239097356796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 4.4551412574946880e-03</internalNodes>
+          <leafValues>
+            -1.2460361421108246e-01 5.1942145824432373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 3.5308140795677900e-03</internalNodes>
+          <leafValues>
+            -2.2974169254302979e-01 2.7043044567108154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -1.5887852758169174e-02</internalNodes>
+          <leafValues>
+            4.1745069622993469e-01 -1.1281611770391464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.1611310765147209e-02</internalNodes>
+          <leafValues>
+            -1.9416445493698120e-01 2.5554594397544861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 1.5740045346319675e-03</internalNodes>
+          <leafValues>
+            -1.2263108044862747e-01 3.8852572441101074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 5.1882643252611160e-02</internalNodes>
+          <leafValues>
+            -7.5461924076080322e-02 5.0257563591003418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -3.8624972105026245e-02</internalNodes>
+          <leafValues>
+            4.0001305937767029e-01 -9.6231088042259216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 -3.9408572018146515e-02</internalNodes>
+          <leafValues>
+            3.0533725023269653e-01 -1.6677139699459076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 7.5884531252086163e-03</internalNodes>
+          <leafValues>
+            9.8107770085334778e-02 -5.8249044418334961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 7.2114326059818268e-02</internalNodes>
+          <leafValues>
+            -1.4419755339622498e-01 2.8208708763122559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 5.5582458153367043e-03</internalNodes>
+          <leafValues>
+            7.2843901813030243e-02 -5.5255079269409180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -4.7345291823148727e-03</internalNodes>
+          <leafValues>
+            3.3209753036499023e-01 -1.2499606609344482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 5.1413839682936668e-03</internalNodes>
+          <leafValues>
+            6.4787313342094421e-02 -6.4880597591400146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 5.4608630016446114e-03</internalNodes>
+          <leafValues>
+            3.7491828203201294e-02 -7.5315922498703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -8.6404485045932233e-05</internalNodes>
+          <leafValues>
+            1.7464619874954224e-01 -1.8258170783519745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 6.1132330447435379e-03</internalNodes>
+          <leafValues>
+            7.5624085962772369e-02 -4.3711006641387939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -7.0670098066329956e-03</internalNodes>
+          <leafValues>
+            2.1796958148479462e-01 -1.4547325670719147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 9.4080460257828236e-04</internalNodes>
+          <leafValues>
+            -1.2536728382110596e-01 2.8143358230590820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 -2.6800869964063168e-03</internalNodes>
+          <leafValues>
+            -4.2977494001388550e-01 8.2963027060031891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 5.8945640921592712e-03</internalNodes>
+          <leafValues>
+            4.2834181338548660e-02 -6.0937494039535522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 1.0121082887053490e-03</internalNodes>
+          <leafValues>
+            -1.1036285758018494e-01 2.9971688985824585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 3.1157936900854111e-03</internalNodes>
+          <leafValues>
+            7.3115289211273193e-02 -4.3226471543312073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -3.3052214421331882e-03</internalNodes>
+          <leafValues>
+            -4.9826300144195557e-01 5.1225960254669189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 8.3188470453023911e-03</internalNodes>
+          <leafValues>
+            5.0362452864646912e-02 -4.8688000440597534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 -2.5094528682529926e-03</internalNodes>
+          <leafValues>
+            2.6902040839195251e-01 -1.0433372855186462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 1.1217880528420210e-03</internalNodes>
+          <leafValues>
+            -1.1188100278377533e-01 3.1254816055297852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 -2.9259414877742529e-03</internalNodes>
+          <leafValues>
+            -5.7495939731597900e-01 5.3564101457595825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -1.1687271296977997e-02</internalNodes>
+          <leafValues>
+            2.5880128145217896e-01 -1.0639669001102448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 3.5054073669016361e-03</internalNodes>
+          <leafValues>
+            5.4045904427766800e-02 -5.5625277757644653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 1.9068794324994087e-02</internalNodes>
+          <leafValues>
+            -1.1246301978826523e-01 2.5745245814323425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 4.6145436353981495e-03</internalNodes>
+          <leafValues>
+            6.7216314375400543e-02 -4.1385611891746521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -8.2267355173826218e-03</internalNodes>
+          <leafValues>
+            2.1265375614166260e-01 -1.3443692028522491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 -1.4355888590216637e-02</internalNodes>
+          <leafValues>
+            2.5618723034858704e-01 -1.0785522311925888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 8.0431215465068817e-03</internalNodes>
+          <leafValues>
+            -1.4258129894733429e-01 2.2692860662937164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 -5.6914249435067177e-03</internalNodes>
+          <leafValues>
+            -4.8886317014694214e-01 6.0331270098686218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -2.5912215933203697e-03</internalNodes>
+          <leafValues>
+            2.1062785387039185e-01 -1.4967896044254303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 5.5204275995492935e-03</internalNodes>
+          <leafValues>
+            -8.1333734095096588e-02 3.8316065073013306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 5.3790090605616570e-03</internalNodes>
+          <leafValues>
+            -9.3129634857177734e-02 3.2883483171463013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -7.2196200489997864e-03</internalNodes>
+          <leafValues>
+            -6.6427856683731079e-01 4.4702950865030289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 -8.3873540163040161e-02</internalNodes>
+          <leafValues>
+            -7.9910254478454590e-01 2.7107261121273041e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 -3.4268260933458805e-03</internalNodes>
+          <leafValues>
+            2.5298807024955750e-01 -1.0898132622241974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 -3.7466005887836218e-03</internalNodes>
+          <leafValues>
+            -5.5346089601516724e-01 5.2094604820013046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 1.2452949304133654e-03</internalNodes>
+          <leafValues>
+            -8.2017965614795685e-02 3.5483068227767944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 -6.2445802614092827e-03</internalNodes>
+          <leafValues>
+            -5.0969594717025757e-01 5.4533429443836212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -1.1970927007496357e-03</internalNodes>
+          <leafValues>
+            3.6470764875411987e-01 -7.7394872903823853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 3.0796977225691080e-03</internalNodes>
+          <leafValues>
+            5.3208738565444946e-02 -5.0689512491226196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -3.9015077054500580e-02</internalNodes>
+          <leafValues>
+            1.9598089158535004e-01 -1.3218660652637482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -7.7085788361728191e-03</internalNodes>
+          <leafValues>
+            2.2754703462123871e-01 -1.2544488906860352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 3.2509677112102509e-02</internalNodes>
+          <leafValues>
+            -6.7099742591381073e-02 4.1469818353652954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 3.0232844874262810e-03</internalNodes>
+          <leafValues>
+            6.6373795270919800e-02 -4.2127549648284912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 2.5392756797373295e-03</internalNodes>
+          <leafValues>
+            -1.1576391756534576e-01 2.3464009165763855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 6.8497275933623314e-03</internalNodes>
+          <leafValues>
+            4.5596633106470108e-02 -5.8435302972793579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 -4.4358119368553162e-02</internalNodes>
+          <leafValues>
+            -3.9718165993690491e-01 6.2707424163818359e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 8 -->
+    <_>
+      <maxWeakCount>63</maxWeakCount>
+      <stageThreshold>-1.4057025909423828e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 804 5.0806580111384392e-03</internalNodes>
+          <leafValues>
+            -7.9617008566856384e-02 5.6362086534500122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 2.0602284930646420e-03</internalNodes>
+          <leafValues>
+            -1.8717131018638611e-01 3.4062680602073669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 6.1347078531980515e-02</internalNodes>
+          <leafValues>
+            -1.3253036141395569e-01 4.0938606858253479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -6.0383215546607971e-02</internalNodes>
+          <leafValues>
+            4.1172346472740173e-01 -1.4447186887264252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -3.0238348990678787e-03</internalNodes>
+          <leafValues>
+            3.4262558817863464e-01 -1.0982885956764221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 4.0474245324730873e-03</internalNodes>
+          <leafValues>
+            7.1186766028404236e-02 -5.0650447607040405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 -2.0359824411571026e-03</internalNodes>
+          <leafValues>
+            2.2166600823402405e-01 -1.6060648858547211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 2.7303429305902682e-05</internalNodes>
+          <leafValues>
+            -2.6211214065551758e-01 1.2801185250282288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 1.2323079630732536e-02</internalNodes>
+          <leafValues>
+            8.2502633333206177e-02 -4.5231887698173523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 2.2477287799119949e-02</internalNodes>
+          <leafValues>
+            -7.7229477465152740e-02 4.5144733786582947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -1.4673802070319653e-02</internalNodes>
+          <leafValues>
+            3.5660189390182495e-01 -1.1584777384996414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 9.9029816687107086e-02</internalNodes>
+          <leafValues>
+            -1.6957059502601624e-01 2.2625257074832916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 -1.0632930323481560e-02</internalNodes>
+          <leafValues>
+            -5.6829780340194702e-01 7.1929946541786194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 2.5341216474771500e-02</internalNodes>
+          <leafValues>
+            -1.2931844592094421e-01 2.6161769032478333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 5.8172484859824181e-03</internalNodes>
+          <leafValues>
+            -1.5375703573226929e-01 2.0636843144893646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -2.0786169171333313e-01</internalNodes>
+          <leafValues>
+            3.9931070804595947e-01 -7.7051497995853424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 2.2137831151485443e-01</internalNodes>
+          <leafValues>
+            -7.2486869990825653e-02 3.9756566286087036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 3.4148676786571741e-04</internalNodes>
+          <leafValues>
+            -1.5928100049495697e-01 1.8005076050758362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -6.7202709615230560e-03</internalNodes>
+          <leafValues>
+            -6.7838191986083984e-01 4.5886330306529999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 1.4110710471868515e-03</internalNodes>
+          <leafValues>
+            -9.7257830202579498e-02 3.2224002480506897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 4.2120069265365601e-02</internalNodes>
+          <leafValues>
+            -8.8405482470989227e-02 3.2538983225822449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -1.3846142683178186e-03</internalNodes>
+          <leafValues>
+            2.0695628225803375e-01 -1.5275791287422180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 3.5425978712737560e-03</internalNodes>
+          <leafValues>
+            -1.2709444761276245e-01 2.1816165745258331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 3.3351695165038109e-03</internalNodes>
+          <leafValues>
+            4.8398405313491821e-02 -6.0871434211730957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 -3.3201207406818867e-03</internalNodes>
+          <leafValues>
+            -4.8987022042274475e-01 5.5623263120651245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 1.0103111853823066e-03</internalNodes>
+          <leafValues>
+            -1.5765775740146637e-01 1.6940611600875854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 4.9717966467142105e-03</internalNodes>
+          <leafValues>
+            5.1272217184305191e-02 -5.4395431280136108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 1.7913591582328081e-03</internalNodes>
+          <leafValues>
+            -7.2745941579341888e-02 4.0087917447090149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 -1.3228422030806541e-02</internalNodes>
+          <leafValues>
+            -3.5441592335700989e-01 7.9325266182422638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 2.0421743392944336e-03</internalNodes>
+          <leafValues>
+            -5.9137169271707535e-02 4.6143886446952820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -5.9784355107694864e-04</internalNodes>
+          <leafValues>
+            2.5433012843132019e-01 -1.0601133853197098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -5.1422840915620327e-03</internalNodes>
+          <leafValues>
+            -4.4627833366394043e-01 6.1951976269483566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 6.4243013039231300e-03</internalNodes>
+          <leafValues>
+            3.1528502702713013e-02 -7.2403544187545776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 3.4636156633496284e-03</internalNodes>
+          <leafValues>
+            3.7317775189876556e-02 -5.4165351390838623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 3.2000489532947540e-02</internalNodes>
+          <leafValues>
+            3.0169567093253136e-02 -7.1302002668380737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 -5.8225672692060471e-03</internalNodes>
+          <leafValues>
+            -4.4310861825942993e-01 4.7724053263664246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 -8.4763765335083008e-03</internalNodes>
+          <leafValues>
+            -6.0832363367080688e-01 3.6428902298212051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 2.7582058683037758e-03</internalNodes>
+          <leafValues>
+            -1.0180406272411346e-01 2.4450653791427612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 -3.0314538162201643e-03</internalNodes>
+          <leafValues>
+            -5.6130182743072510e-01 4.1730970144271851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 3.8132141344249249e-03</internalNodes>
+          <leafValues>
+            4.3826375156641006e-02 -4.8639413714408875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 -1.1944114230573177e-03</internalNodes>
+          <leafValues>
+            1.9191412627696991e-01 -1.2599647045135498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -3.2212696969509125e-02</internalNodes>
+          <leafValues>
+            -7.3205161094665527e-01 3.3331435173749924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 -1.0144908446818590e-03</internalNodes>
+          <leafValues>
+            3.0479896068572998e-01 -8.2489714026451111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -1.4355147257447243e-02</internalNodes>
+          <leafValues>
+            2.1706604957580566e-01 -1.0914804041385651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -4.8122168518602848e-03</internalNodes>
+          <leafValues>
+            -6.7199075222015381e-01 4.0943562984466553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 3.3706519752740860e-04</internalNodes>
+          <leafValues>
+            -1.4588885009288788e-01 1.6099508106708527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 -1.8943618983030319e-02</internalNodes>
+          <leafValues>
+            -5.9796541929244995e-01 3.7877634167671204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 1.5444982796907425e-02</internalNodes>
+          <leafValues>
+            2.6846721768379211e-02 -7.2375786304473877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 1.0463559068739414e-02</internalNodes>
+          <leafValues>
+            3.2184243202209473e-02 -6.0756552219390869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 2.5047133676707745e-03</internalNodes>
+          <leafValues>
+            -1.1925315856933594e-01 1.9379882514476776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 -1.4791900292038918e-02</internalNodes>
+          <leafValues>
+            1.9981779158115387e-01 -1.2553811073303223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -6.1217732727527618e-03</internalNodes>
+          <leafValues>
+            -4.2455345392227173e-01 5.5959124118089676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 -3.5850135609507561e-03</internalNodes>
+          <leafValues>
+            3.2560044527053833e-01 -7.1894593536853790e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 -3.2580485567450523e-03</internalNodes>
+          <leafValues>
+            -5.4515779018402100e-01 4.5138467103242874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 8.5870809853076935e-03</internalNodes>
+          <leafValues>
+            -9.2699222266674042e-02 2.7361676096916199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 -3.5999938845634460e-03</internalNodes>
+          <leafValues>
+            1.7715592682361603e-01 -1.3859097659587860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 1.5299995429813862e-03</internalNodes>
+          <leafValues>
+            -1.0419535636901855e-01 2.1118766069412231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 2.7578026056289673e-03</internalNodes>
+          <leafValues>
+            -7.0944413542747498e-02 2.9870492219924927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 -6.1489176005125046e-03</internalNodes>
+          <leafValues>
+            -5.1581281423568726e-01 4.6433247625827789e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 8.3175086183473468e-04</internalNodes>
+          <leafValues>
+            -8.4185592830181122e-02 2.8132751584053040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -6.7444925662130117e-04</internalNodes>
+          <leafValues>
+            2.6548036932945251e-01 -9.7815677523612976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 -5.6643221527338028e-02</internalNodes>
+          <leafValues>
+            3.8170987367630005e-01 -6.2833912670612335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 -7.5360340997576714e-03</internalNodes>
+          <leafValues>
+            2.2137185931205750e-01 -1.0336405038833618e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 9 -->
+    <_>
+      <maxWeakCount>54</maxWeakCount>
+      <stageThreshold>-1.3439358472824097e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 526 -4.8420722596347332e-03</internalNodes>
+          <leafValues>
+            5.7400572299957275e-01 -9.5008336007595062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -5.9993756003677845e-03</internalNodes>
+          <leafValues>
+            4.5479923486709595e-01 -1.5483228862285614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 -3.1531709246337414e-03</internalNodes>
+          <leafValues>
+            4.2504432797431946e-01 -1.2935030460357666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 1.2363551650196314e-03</internalNodes>
+          <leafValues>
+            -1.5872104465961456e-01 3.1463247537612915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -6.7780278623104095e-03</internalNodes>
+          <leafValues>
+            4.1302111744880676e-01 -1.7017546296119690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 1.3960017822682858e-03</internalNodes>
+          <leafValues>
+            -1.3419999182224274e-01 3.3868113160133362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 -3.5894233733415604e-03</internalNodes>
+          <leafValues>
+            3.3102113008499146e-01 -1.1498286575078964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 5.4187951609492302e-03</internalNodes>
+          <leafValues>
+            -1.2790408730506897e-01 3.1275641918182373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -3.3248444087803364e-03</internalNodes>
+          <leafValues>
+            -5.1654219627380371e-01 7.1216024458408356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 7.9970825463533401e-03</internalNodes>
+          <leafValues>
+            6.3098005950450897e-02 -5.8896148204803467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 6.0347835533320904e-03</internalNodes>
+          <leafValues>
+            6.4018696546554565e-02 -4.7639665007591248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -6.9478121586143970e-03</internalNodes>
+          <leafValues>
+            -6.0485291481018066e-01 7.2506561875343323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 1.9063859945163131e-03</internalNodes>
+          <leafValues>
+            -1.8492227792739868e-01 1.9994279742240906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 2.1343495696783066e-02</internalNodes>
+          <leafValues>
+            -8.6192794144153595e-02 4.8719888925552368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 -2.2514071315526962e-03</internalNodes>
+          <leafValues>
+            3.5809755325317383e-01 -7.6123438775539398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 -4.4778124429285526e-03</internalNodes>
+          <leafValues>
+            -4.5578238368034363e-01 7.3516018688678741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 3.9280336350202560e-03</internalNodes>
+          <leafValues>
+            6.2599055469036102e-02 -5.2695369720458984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 -4.5666974037885666e-03</internalNodes>
+          <leafValues>
+            -6.1827522516250610e-01 4.1984613984823227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -6.1424830928444862e-03</internalNodes>
+          <leafValues>
+            3.0607789754867554e-01 -9.1138295829296112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 3.4258943051099777e-03</internalNodes>
+          <leafValues>
+            5.5657953023910522e-02 -5.3350126743316650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 3.3122287131845951e-03</internalNodes>
+          <leafValues>
+            -1.5935245156288147e-01 1.7000633478164673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 7.4128687381744385e-02</internalNodes>
+          <leafValues>
+            3.3975400030612946e-02 -6.4646822214126587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -6.0862921178340912e-02</internalNodes>
+          <leafValues>
+            3.1012952327728271e-01 -9.1380268335342407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 -4.3243117630481720e-02</internalNodes>
+          <leafValues>
+            -4.5051410794258118e-01 6.6722445189952850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -5.4576778784394264e-03</internalNodes>
+          <leafValues>
+            -4.8368638753890991e-01 5.5113438516855240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -2.1073617972433567e-03</internalNodes>
+          <leafValues>
+            2.3326623439788818e-01 -1.2007984519004822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 -1.1282963678240776e-02</internalNodes>
+          <leafValues>
+            2.9159554839134216e-01 -1.0025029629468918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 2.9302681796252728e-03</internalNodes>
+          <leafValues>
+            -8.5840485990047455e-02 3.3159431815147400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -2.8825225308537483e-03</internalNodes>
+          <leafValues>
+            -5.3361582756042480e-01 5.7994876056909561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 6.2230005860328674e-03</internalNodes>
+          <leafValues>
+            4.4393569231033325e-02 -5.3072142601013184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 1.1437942739576101e-03</internalNodes>
+          <leafValues>
+            -9.5763660967350006e-02 2.8212538361549377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 1.2469270732253790e-03</internalNodes>
+          <leafValues>
+            6.5446242690086365e-02 -4.1902217268943787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -1.1369751766324043e-02</internalNodes>
+          <leafValues>
+            -7.0747911930084229e-01 3.4916084259748459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 1.0013033449649811e-01</internalNodes>
+          <leafValues>
+            -6.7160040140151978e-02 4.2184004187583923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -2.6742245536297560e-03</internalNodes>
+          <leafValues>
+            1.7217047512531281e-01 -1.6229687631130219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -3.4254738129675388e-03</internalNodes>
+          <leafValues>
+            2.9603767395019531e-01 -8.9177258312702179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 1.5813322970643640e-03</internalNodes>
+          <leafValues>
+            4.8733744770288467e-02 -5.6422549486160278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 2.7555555789149366e-05</internalNodes>
+          <leafValues>
+            -1.7079097032546997e-01 1.4066468179225922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -8.2116597332060337e-04</internalNodes>
+          <leafValues>
+            1.8260034918785095e-01 -1.3242910802364349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 -1.0168720036745071e-02</internalNodes>
+          <leafValues>
+            -4.1390055418014526e-01 6.5349683165550232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 2.5848036631941795e-02</internalNodes>
+          <leafValues>
+            4.6910341829061508e-02 -4.7531116008758545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 5.9797330759465694e-03</internalNodes>
+          <leafValues>
+            4.5450355857610703e-02 -4.5701387524604797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -2.4257015902549028e-03</internalNodes>
+          <leafValues>
+            1.8431460857391357e-01 -1.1879430711269379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -4.1334740817546844e-02</internalNodes>
+          <leafValues>
+            3.0460721254348755e-01 -9.4910860061645508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 7.5982198119163513e-02</internalNodes>
+          <leafValues>
+            -6.5890170633792877e-02 3.3325287699699402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 -2.7852014682139270e-05</internalNodes>
+          <leafValues>
+            1.4771287143230438e-01 -1.4524473249912262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -1.4885163400322199e-03</internalNodes>
+          <leafValues>
+            -4.6987643837928772e-01 4.7233786433935165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 -3.3519542776048183e-03</internalNodes>
+          <leafValues>
+            2.4128976464271545e-01 -9.3788638710975647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 1.3348343782126904e-03</internalNodes>
+          <leafValues>
+            -9.9509775638580322e-02 2.9368522763252258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 3.2456549815833569e-03</internalNodes>
+          <leafValues>
+            -9.8895303905010223e-02 2.3363485932350159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 4.2385179549455643e-03</internalNodes>
+          <leafValues>
+            5.9986904263496399e-02 -4.5745995640754700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 8.4751443937420845e-03</internalNodes>
+          <leafValues>
+            3.0937874689698219e-02 -6.7139619588851929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 3.0964510515332222e-03</internalNodes>
+          <leafValues>
+            3.0879957601428032e-02 -6.2686437368392944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 2.3455230984836817e-03</internalNodes>
+          <leafValues>
+            -1.3303077220916748e-01 1.6908498108386993e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 10 -->
+    <_>
+      <maxWeakCount>72</maxWeakCount>
+      <stageThreshold>-1.4052674770355225e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 534 -8.4834604058414698e-04</internalNodes>
+          <leafValues>
+            4.6746683120727539e-01 -1.2498743087053299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 1.1534148361533880e-03</internalNodes>
+          <leafValues>
+            -2.1341361105442047e-01 3.0533915758132935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 1.3660041615366936e-02</internalNodes>
+          <leafValues>
+            -1.5390963852405548e-01 3.2113197445869446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -1.3363182079046965e-03</internalNodes>
+          <leafValues>
+            2.4346974492073059e-01 -1.8074017763137817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 5.5064354091882706e-04</internalNodes>
+          <leafValues>
+            -1.9600959122180939e-01 2.1903340518474579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 2.8026416897773743e-02</internalNodes>
+          <leafValues>
+            -9.9956467747688293e-02 5.1314896345138550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 -9.8200759384781122e-04</internalNodes>
+          <leafValues>
+            2.0671010017395020e-01 -1.9585600495338440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -1.9661948084831238e-02</internalNodes>
+          <leafValues>
+            -5.1859843730926514e-01 7.9988524317741394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 5.7550622150301933e-03</internalNodes>
+          <leafValues>
+            -1.0230549424886703e-01 2.9102912545204163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 4.8226406797766685e-03</internalNodes>
+          <leafValues>
+            -1.2503834068775177e-01 2.2606587409973145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 -3.5137422382831573e-03</internalNodes>
+          <leafValues>
+            -6.8291509151458740e-01 4.6296034008264542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 2.7717142074834555e-05</internalNodes>
+          <leafValues>
+            -2.1390475332736969e-01 1.3291628658771515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -2.2634968161582947e-02</internalNodes>
+          <leafValues>
+            4.0156257152557373e-01 -9.0922117233276367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -2.6544253341853619e-04</internalNodes>
+          <leafValues>
+            2.1944612264633179e-01 -1.5686984360218048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 1.7469950020313263e-02</internalNodes>
+          <leafValues>
+            5.9605021029710770e-02 -5.4529672861099243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 3.6130528897047043e-03</internalNodes>
+          <leafValues>
+            5.2721742540597916e-02 -4.4890201091766357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -3.8260491564869881e-03</internalNodes>
+          <leafValues>
+            -5.1076781749725342e-01 4.7858215868473053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -4.6305969590321183e-04</internalNodes>
+          <leafValues>
+            2.0340332388877869e-01 -1.3007256388664246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -7.3791583999991417e-03</internalNodes>
+          <leafValues>
+            -5.4855078458786011e-01 5.1355980336666107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -4.1331160813570023e-02</internalNodes>
+          <leafValues>
+            -3.7914556264877319e-01 6.2432620674371719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 -1.4983891742303967e-03</internalNodes>
+          <leafValues>
+            -5.2967226505279541e-01 4.2461462318897247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -2.5054097641259432e-03</internalNodes>
+          <leafValues>
+            2.0288434624671936e-01 -1.2341590225696564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -7.1871257387101650e-04</internalNodes>
+          <leafValues>
+            2.4784520268440247e-01 -9.8167583346366882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 -6.8983237724751234e-04</internalNodes>
+          <leafValues>
+            2.7780577540397644e-01 -9.7512029111385345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 4.8434769269078970e-04</internalNodes>
+          <leafValues>
+            -1.1704409867525101e-01 2.4324342608451843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -3.6378027871251106e-03</internalNodes>
+          <leafValues>
+            -5.7295501232147217e-01 4.9037151038646698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 -2.6648804545402527e-02</internalNodes>
+          <leafValues>
+            -6.0253041982650757e-01 3.6413222551345825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -4.3416651897132397e-03</internalNodes>
+          <leafValues>
+            4.7109794616699219e-01 -5.9058945626020432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -2.7588163502514362e-03</internalNodes>
+          <leafValues>
+            -4.9160134792327881e-01 5.4663125425577164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 4.7046472318470478e-03</internalNodes>
+          <leafValues>
+            3.7025094032287598e-02 -5.6842529773712158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 4.9029560759663582e-03</internalNodes>
+          <leafValues>
+            4.8207473009824753e-02 -4.2965477705001831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -7.0135248824954033e-04</internalNodes>
+          <leafValues>
+            2.2556030750274658e-01 -9.9117368459701538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 2.7165210340172052e-03</internalNodes>
+          <leafValues>
+            4.3833449482917786e-02 -5.5271440744400024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 8.9941755868494511e-04</internalNodes>
+          <leafValues>
+            -8.9474648237228394e-02 2.6415902376174927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 -1.7575379461050034e-03</internalNodes>
+          <leafValues>
+            -5.7822185754776001e-01 4.4655490666627884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 2.2079560905694962e-02</internalNodes>
+          <leafValues>
+            -9.1862626373767853e-02 2.6927500963211060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -2.4989219382405281e-03</internalNodes>
+          <leafValues>
+            1.9282613694667816e-01 -1.4004705846309662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 4.4558709487318993e-03</internalNodes>
+          <leafValues>
+            5.2965965121984482e-02 -4.6530798077583313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 8.9809950441122055e-03</internalNodes>
+          <leafValues>
+            -6.9099865853786469e-02 3.5005539655685425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 -4.6078087761998177e-03</internalNodes>
+          <leafValues>
+            1.5373907983303070e-01 -1.5948937833309174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 -8.9063167572021484e-02</internalNodes>
+          <leafValues>
+            4.8500600457191467e-01 -5.1386959850788116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 4.8636873252689838e-03</internalNodes>
+          <leafValues>
+            5.1732856780290604e-02 -4.9787709116935730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -5.4465518333017826e-03</internalNodes>
+          <leafValues>
+            1.5584819018840790e-01 -1.4326727390289307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 6.4384475350379944e-02</internalNodes>
+          <leafValues>
+            3.1540591269731522e-02 -7.1331930160522461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -9.3528348952531815e-03</internalNodes>
+          <leafValues>
+            -5.8800560235977173e-01 3.2534934580326080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 6.5686285961419344e-04</internalNodes>
+          <leafValues>
+            -1.6972899436950684e-01 1.4208021759986877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -6.5707243047654629e-03</internalNodes>
+          <leafValues>
+            3.1901842355728149e-01 -7.0233277976512909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 7.0676081813871861e-03</internalNodes>
+          <leafValues>
+            3.0735086649656296e-02 -7.6451587677001953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -1.1614331044256687e-02</internalNodes>
+          <leafValues>
+            2.0416912436485291e-01 -1.0650242120027542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -3.0933439731597900e-02</internalNodes>
+          <leafValues>
+            -3.5186296701431274e-01 6.3158944249153137e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 8.9404191821813583e-03</internalNodes>
+          <leafValues>
+            4.1301336139440536e-02 -5.2171415090560913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -3.0004943255335093e-04</internalNodes>
+          <leafValues>
+            1.8332102894783020e-01 -1.1965552717447281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -4.2704585939645767e-03</internalNodes>
+          <leafValues>
+            -4.1220253705978394e-01 5.2136015146970749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 9.1349193826317787e-04</internalNodes>
+          <leafValues>
+            -8.2035504281520844e-02 2.7817621827125549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 2.8089310973882675e-02</internalNodes>
+          <leafValues>
+            6.0909613966941833e-02 -3.7705209851264954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -1.1489203898236156e-03</internalNodes>
+          <leafValues>
+            2.9547268152236938e-01 -7.8550107777118683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -8.5876882076263428e-04</internalNodes>
+          <leafValues>
+            1.6158875823020935e-01 -1.3613829016685486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 3.3645064104348421e-03</internalNodes>
+          <leafValues>
+            3.6055568605661392e-02 -5.5788111686706543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 -1.2699423357844353e-02</internalNodes>
+          <leafValues>
+            -4.2199519276618958e-01 4.3876208364963531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -1.3306856155395508e-01</internalNodes>
+          <leafValues>
+            -7.5723612308502197e-01 2.4755204096436501e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 4.9831219017505646e-02</internalNodes>
+          <leafValues>
+            2.5250671431422234e-02 -6.3122928142547607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 5.8193420991301537e-03</internalNodes>
+          <leafValues>
+            2.2189516574144363e-02 -7.2821933031082153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -6.3158385455608368e-03</internalNodes>
+          <leafValues>
+            1.9480472803115845e-01 -1.0275462269783020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 -2.6879269629716873e-02</internalNodes>
+          <leafValues>
+            -4.3909311294555664e-01 4.5222271233797073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -1.6478844918310642e-03</internalNodes>
+          <leafValues>
+            2.7425831556320190e-01 -7.7650256454944611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 4.4362144544720650e-03</internalNodes>
+          <leafValues>
+            3.2876692712306976e-02 -6.0907542705535889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 -1.5154483262449503e-03</internalNodes>
+          <leafValues>
+            2.2985421121120453e-01 -8.5810013115406036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 7.0627350360155106e-03</internalNodes>
+          <leafValues>
+            3.4827440977096558e-02 -5.9273594617843628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 4.5482232235372066e-03</internalNodes>
+          <leafValues>
+            -5.2113339304924011e-02 4.0603092312812805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 -3.9095789194107056e-02</internalNodes>
+          <leafValues>
+            2.5562492012977600e-01 -8.1410482525825500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -1.9122204976156354e-03</internalNodes>
+          <leafValues>
+            -6.5523076057434082e-01 3.1964879482984543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 5.1604928448796272e-03</internalNodes>
+          <leafValues>
+            2.8228869661688805e-02 -6.0336226224899292e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 11 -->
+    <_>
+      <maxWeakCount>63</maxWeakCount>
+      <stageThreshold>-1.2550007104873657e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 532 -1.3708438724279404e-02</internalNodes>
+          <leafValues>
+            4.5314663648605347e-01 -1.2558805942535400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 1.2687301263213158e-02</internalNodes>
+          <leafValues>
+            -1.5584127604961395e-01 3.8753288984298706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 3.3966779708862305e-02</internalNodes>
+          <leafValues>
+            -1.1772038787603378e-01 4.0628942847251892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 8.0258902162313461e-03</internalNodes>
+          <leafValues>
+            -1.4661933481693268e-01 4.0369525551795959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -4.2836386710405350e-03</internalNodes>
+          <leafValues>
+            2.2167153656482697e-01 -1.9662868976593018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -2.7807329315692186e-03</internalNodes>
+          <leafValues>
+            -4.6929144859313965e-01 6.9577261805534363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 1.9090694840997458e-03</internalNodes>
+          <leafValues>
+            5.9488739818334579e-02 -6.3101488351821899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 3.1442400068044662e-03</internalNodes>
+          <leafValues>
+            -1.1149841547012329e-01 3.0095639824867249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -2.8418585658073425e-02</internalNodes>
+          <leafValues>
+            3.6157062649726868e-01 -9.6387691795825958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 -4.4032465666532516e-03</internalNodes>
+          <leafValues>
+            3.2977014780044556e-01 -9.8187342286109924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -2.6041134260594845e-03</internalNodes>
+          <leafValues>
+            2.8221642971038818e-01 -1.0142992436885834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -5.8917067945003510e-03</internalNodes>
+          <leafValues>
+            -5.8254349231719971e-01 6.0040380805730820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 1.3956660404801369e-03</internalNodes>
+          <leafValues>
+            -1.6574928164482117e-01 1.7746162414550781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 -1.7630932852625847e-03</internalNodes>
+          <leafValues>
+            -5.7597070932388306e-01 6.2388133257627487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -1.3517161132767797e-03</internalNodes>
+          <leafValues>
+            -5.1934504508972168e-01 4.7232870012521744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -3.8743610493838787e-03</internalNodes>
+          <leafValues>
+            2.9165247082710266e-01 -9.9355563521385193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 1.0973589494824409e-02</internalNodes>
+          <leafValues>
+            -7.7571205794811249e-02 3.4312543272972107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -3.5274624824523926e-03</internalNodes>
+          <leafValues>
+            -6.7513287067413330e-01 3.6897819489240646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -2.4239125195890665e-03</internalNodes>
+          <leafValues>
+            2.5701349973678589e-01 -1.0465545207262039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 -8.3098262548446655e-03</internalNodes>
+          <leafValues>
+            2.6842510700225830e-01 -9.9635124206542969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 -2.7831714600324631e-02</internalNodes>
+          <leafValues>
+            -3.9901316165924072e-01 6.5086022019386292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 8.1690559163689613e-03</internalNodes>
+          <leafValues>
+            -1.1402101069688797e-01 2.2761905193328857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 2.8635351918637753e-03</internalNodes>
+          <leafValues>
+            -1.4034478366374969e-01 1.8733198940753937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -2.1204156801104546e-03</internalNodes>
+          <leafValues>
+            -5.9949654340744019e-01 4.9501683562994003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -9.4446074217557907e-04</internalNodes>
+          <leafValues>
+            -3.8145086169242859e-01 5.9254929423332214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 2.1901372820138931e-03</internalNodes>
+          <leafValues>
+            3.6901079118251801e-02 -5.6260800361633301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 4.2550573125481606e-03</internalNodes>
+          <leafValues>
+            -9.8831087350845337e-02 2.3313422501087189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 4.2771790176630020e-03</internalNodes>
+          <leafValues>
+            4.2207289487123489e-02 -5.6859022378921509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -7.8792609274387360e-03</internalNodes>
+          <leafValues>
+            2.2428077459335327e-01 -9.9518932402133942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -3.5514549817889929e-03</internalNodes>
+          <leafValues>
+            -5.6150603294372559e-01 3.9242122322320938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -6.8606354761868715e-04</internalNodes>
+          <leafValues>
+            2.1056549251079559e-01 -1.2413132935762405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 5.2483025938272476e-03</internalNodes>
+          <leafValues>
+            3.4256864339113235e-02 -7.2566890716552734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -3.6910744383931160e-03</internalNodes>
+          <leafValues>
+            2.6440864801406860e-01 -8.9745096862316132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 2.0369128324091434e-03</internalNodes>
+          <leafValues>
+            4.6990364789962769e-02 -5.3132331371307373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 3.8735207635909319e-03</internalNodes>
+          <leafValues>
+            -9.1540865600109100e-02 2.7486115694046021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 6.0556940734386444e-03</internalNodes>
+          <leafValues>
+            5.3909529000520706e-02 -4.6437451243400574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 4.8301572678610682e-04</internalNodes>
+          <leafValues>
+            -1.6165176033973694e-01 1.3917934894561768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -1.4880476519465446e-02</internalNodes>
+          <leafValues>
+            -5.9634107351303101e-01 3.9811171591281891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 2.9731846880167723e-03</internalNodes>
+          <leafValues>
+            3.0903076753020287e-02 -6.2935864925384521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -1.1181155219674110e-02</internalNodes>
+          <leafValues>
+            3.5473996400833130e-01 -6.4499482512474060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 -9.8370900377631187e-04</internalNodes>
+          <leafValues>
+            2.9858112335205078e-01 -8.4500424563884735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 -1.0228222236037254e-03</internalNodes>
+          <leafValues>
+            2.7100124955177307e-01 -1.0033085197210312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 2.0134919323027134e-03</internalNodes>
+          <leafValues>
+            4.3533660471439362e-02 -5.4969471693038940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -3.1473359558731318e-03</internalNodes>
+          <leafValues>
+            3.1102818250656128e-01 -8.0141142010688782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -2.9232497327029705e-03</internalNodes>
+          <leafValues>
+            -6.7808300256729126e-01 3.5025410354137421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -3.8992143236100674e-03</internalNodes>
+          <leafValues>
+            2.5711989402770996e-01 -8.4509201347827911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -3.8403570652008057e-02</internalNodes>
+          <leafValues>
+            2.8463324904441833e-01 -7.5673028826713562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 -2.2210094612091780e-03</internalNodes>
+          <leafValues>
+            -5.6876182556152344e-01 4.0759250521659851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 6.9615743122994900e-03</internalNodes>
+          <leafValues>
+            -7.8118488192558289e-02 2.8128826618194580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -1.8219950143247843e-03</internalNodes>
+          <leafValues>
+            1.8647159636020660e-01 -1.3465921580791473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 1.0106971021741629e-03</internalNodes>
+          <leafValues>
+            5.7168632745742798e-02 -4.1419604420661926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -3.3746981061995029e-03</internalNodes>
+          <leafValues>
+            -5.2892911434173584e-01 4.0065344423055649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -8.5245687514543533e-03</internalNodes>
+          <leafValues>
+            -5.0935691595077515e-01 3.8823168724775314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -2.2426969371736050e-03</internalNodes>
+          <leafValues>
+            2.5891116261482239e-01 -8.8167145848274231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -5.9730862267315388e-03</internalNodes>
+          <leafValues>
+            -4.3465223908424377e-01 4.9864508211612701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 -5.5482299067080021e-03</internalNodes>
+          <leafValues>
+            2.5288850069046021e-01 -9.3322932720184326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 3.7344563007354736e-01</internalNodes>
+          <leafValues>
+            -4.9019347876310349e-02 4.3872711062431335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -4.0881419554352760e-03</internalNodes>
+          <leafValues>
+            3.1952694058418274e-01 -7.7735908329486847e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 3.1661842949688435e-03</internalNodes>
+          <leafValues>
+            -1.0995075106620789e-01 1.7701222002506256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -2.1666671335697174e-01</internalNodes>
+          <leafValues>
+            -4.5134860277175903e-01 4.9127347767353058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -3.1139418482780457e-02</internalNodes>
+          <leafValues>
+            2.5138390064239502e-01 -9.4933450222015381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 9.1597874416038394e-04</internalNodes>
+          <leafValues>
+            -7.4231699109077454e-02 3.1368830800056458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 -6.1164153739809990e-03</internalNodes>
+          <leafValues>
+            -7.0417582988739014e-01 3.4018490463495255e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 12 -->
+    <_>
+      <maxWeakCount>77</maxWeakCount>
+      <stageThreshold>-1.3230814933776855e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 522 -3.3400340471416712e-03</internalNodes>
+          <leafValues>
+            4.2352598905563354e-01 -1.2572944164276123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 -2.3890279699116945e-03</internalNodes>
+          <leafValues>
+            3.8169610500335693e-01 -1.4501731097698212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -2.4045775644481182e-03</internalNodes>
+          <leafValues>
+            3.4690696001052856e-01 -1.2821178138256073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 1.2546034995466471e-03</internalNodes>
+          <leafValues>
+            -1.4823316037654877e-01 2.9894015192985535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 -1.8236635252833366e-02</internalNodes>
+          <leafValues>
+            3.0641126632690430e-01 -1.2427721172571182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 4.1921215597540140e-04</internalNodes>
+          <leafValues>
+            -1.8449674546718597e-01 1.7403297126293182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -3.0837533995509148e-03</internalNodes>
+          <leafValues>
+            -6.2562137842178345e-01 3.4162398427724838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 -3.4897932782769203e-03</internalNodes>
+          <leafValues>
+            2.0127655565738678e-01 -1.4677318930625916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 -3.4818234853446484e-03</internalNodes>
+          <leafValues>
+            2.9465374350547791e-01 -1.0961814969778061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 6.2356598675251007e-02</internalNodes>
+          <leafValues>
+            -9.8056003451347351e-02 3.1733244657516479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 -1.8334560096263885e-02</internalNodes>
+          <leafValues>
+            3.1992998719215393e-01 -7.8213296830654144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 3.7803263403475285e-03</internalNodes>
+          <leafValues>
+            5.3678415715694427e-02 -5.0315982103347778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 -3.6906298249959946e-02</internalNodes>
+          <leafValues>
+            -6.3056147098541260e-01 3.8218058645725250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 4.6968068927526474e-03</internalNodes>
+          <leafValues>
+            -1.1338837444782257e-01 2.6388064026832581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -1.1566210538148880e-02</internalNodes>
+          <leafValues>
+            1.6388712823390961e-01 -1.6043519973754883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 3.1895786523818970e-03</internalNodes>
+          <leafValues>
+            6.0215596109628677e-02 -4.7157511115074158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -2.5480750948190689e-02</internalNodes>
+          <leafValues>
+            -5.5096846818923950e-01 3.9257630705833435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 3.9267786778509617e-03</internalNodes>
+          <leafValues>
+            6.1174295842647552e-02 -4.1686600446701050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 4.2923549190163612e-03</internalNodes>
+          <leafValues>
+            -6.9901801645755768e-02 3.6233785748481750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 1.5720827504992485e-03</internalNodes>
+          <leafValues>
+            -9.2891335487365723e-02 2.6970732212066650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 4.2968937195837498e-03</internalNodes>
+          <leafValues>
+            4.5402236282825470e-02 -6.1771476268768311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 5.8442405425012112e-03</internalNodes>
+          <leafValues>
+            3.4459017217159271e-02 -6.2251347303390503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 2.6888614520430565e-03</internalNodes>
+          <leafValues>
+            3.6230482161045074e-02 -5.7353609800338745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 4.4175283983349800e-03</internalNodes>
+          <leafValues>
+            -6.4959764480590820e-02 3.7311050295829773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.4900951646268368e-03</internalNodes>
+          <leafValues>
+            -1.0781793296337128e-01 2.0226408541202545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 2.4665119126439095e-03</internalNodes>
+          <leafValues>
+            5.7804334908723831e-02 -4.1689205169677734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 9.3985523562878370e-04</internalNodes>
+          <leafValues>
+            -1.4865192770957947e-01 1.3861793279647827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -5.3606871515512466e-03</internalNodes>
+          <leafValues>
+            1.8524695932865143e-01 -1.1567704379558563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -4.6638157218694687e-03</internalNodes>
+          <leafValues>
+            1.6163532435894012e-01 -1.3586524128913879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 3.7256032228469849e-03</internalNodes>
+          <leafValues>
+            5.2170656621456146e-02 -4.2538973689079285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 -8.9184641838073730e-03</internalNodes>
+          <leafValues>
+            -5.0052535533905029e-01 4.7540370374917984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 5.6020710617303848e-03</internalNodes>
+          <leafValues>
+            3.4621786326169968e-02 -5.4071390628814697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -3.7551699206233025e-03</internalNodes>
+          <leafValues>
+            -3.9268767833709717e-01 5.2867397665977478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 4.0759481489658356e-03</internalNodes>
+          <leafValues>
+            3.7209436297416687e-02 -4.7708320617675781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 4.1836635209619999e-03</internalNodes>
+          <leafValues>
+            -5.8815345168113708e-02 3.6573976278305054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -9.3902507796883583e-04</internalNodes>
+          <leafValues>
+            1.9424098730087280e-01 -1.1125016957521439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -9.9178254604339600e-03</internalNodes>
+          <leafValues>
+            -5.9317117929458618e-01 3.3418238162994385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 3.3355036284774542e-03</internalNodes>
+          <leafValues>
+            -8.7399490177631378e-02 2.4422888457775116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -3.4440397284924984e-03</internalNodes>
+          <leafValues>
+            2.9363137483596802e-01 -7.5259201228618622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 2.1378418896347284e-03</internalNodes>
+          <leafValues>
+            5.6551665067672729e-02 -3.9630606770515442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -4.5215697027742863e-03</internalNodes>
+          <leafValues>
+            1.6443158686161041e-01 -1.1997994035482407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -1.2263706885278225e-03</internalNodes>
+          <leafValues>
+            -2.6839572191238403e-01 7.8797832131385803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 -7.3856199160218239e-03</internalNodes>
+          <leafValues>
+            -7.5282222032546997e-01 2.3323338478803635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 1.1934632435441017e-02</internalNodes>
+          <leafValues>
+            3.9068166166543961e-02 -4.3301787972450256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -4.2066089808940887e-03</internalNodes>
+          <leafValues>
+            3.1933805346488953e-01 -6.1786398291587830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -1.5679887728765607e-03</internalNodes>
+          <leafValues>
+            2.1744215488433838e-01 -9.4651907682418823e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 2.5083343498408794e-03</internalNodes>
+          <leafValues>
+            5.7137917727231979e-02 -3.3361336588859558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 3.6224797368049622e-03</internalNodes>
+          <leafValues>
+            3.1345754861831665e-02 -5.7247912883758545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -7.7814143151044846e-03</internalNodes>
+          <leafValues>
+            2.9652404785156250e-01 -6.6501826047897339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -4.1631370550021529e-04</internalNodes>
+          <leafValues>
+            2.2159980237483978e-01 -1.0610108822584152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 4.7841453924775124e-03</internalNodes>
+          <leafValues>
+            3.3327136188745499e-02 -5.7043993473052979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 1.2740758247673512e-03</internalNodes>
+          <leafValues>
+            -7.9592645168304443e-02 2.4728350341320038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -2.0162630826234818e-02</internalNodes>
+          <leafValues>
+            -7.0677626132965088e-01 2.7118822559714317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 -2.5762226432561874e-02</internalNodes>
+          <leafValues>
+            -5.9367066621780396e-01 2.7015525847673416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -1.1241633910685778e-03</internalNodes>
+          <leafValues>
+            2.9121127724647522e-01 -6.5690472722053528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 2.9669383540749550e-02</internalNodes>
+          <leafValues>
+            3.4585461020469666e-02 -5.4837781190872192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 -6.3295168802142143e-03</internalNodes>
+          <leafValues>
+            2.3453639447689056e-01 -8.5172846913337708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 4.0143523365259171e-03</internalNodes>
+          <leafValues>
+            3.5306803882122040e-02 -5.4817456007003784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -2.4633856955915689e-03</internalNodes>
+          <leafValues>
+            1.6164709627628326e-01 -1.1111633479595184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -2.6468174532055855e-02</internalNodes>
+          <leafValues>
+            2.5775042176246643e-01 -7.2721429169178009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 -2.5992670562118292e-03</internalNodes>
+          <leafValues>
+            -3.1405648589134216e-01 5.9779226779937744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -2.2960878908634186e-02</internalNodes>
+          <leafValues>
+            2.8405818343162537e-01 -6.8080194294452667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -1.6940593719482422e-02</internalNodes>
+          <leafValues>
+            3.0056476593017578e-01 -6.7668616771697998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 1.7171052750200033e-03</internalNodes>
+          <leafValues>
+            -6.5253980457782745e-02 2.9430890083312988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -5.2873874083161354e-03</internalNodes>
+          <leafValues>
+            -4.5413893461227417e-01 4.3044254183769226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -1.8073642626404762e-02</internalNodes>
+          <leafValues>
+            -3.4945023059844971e-01 5.2509855479001999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 -2.0803229417651892e-03</internalNodes>
+          <leafValues>
+            -4.0171647071838379e-01 4.5229051262140274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -1.1218651343369856e-04</internalNodes>
+          <leafValues>
+            1.2830497324466705e-01 -1.4649079740047455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -6.6526420414447784e-03</internalNodes>
+          <leafValues>
+            -3.4429419040679932e-01 5.4524090141057968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -4.1576132178306580e-02</internalNodes>
+          <leafValues>
+            -5.5132204294204712e-01 3.2239176332950592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -3.2582432031631470e-03</internalNodes>
+          <leafValues>
+            2.1904261410236359e-01 -9.0739406645298004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 -4.4706808403134346e-03</internalNodes>
+          <leafValues>
+            2.2556288540363312e-01 -9.5258384943008423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -6.5750535577535629e-03</internalNodes>
+          <leafValues>
+            -4.8511472344398499e-01 4.1734144091606140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -3.7532784044742584e-02</internalNodes>
+          <leafValues>
+            2.0968079566955566e-01 -8.8354945182800293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -1.2600638438016176e-03</internalNodes>
+          <leafValues>
+            2.2111406922340393e-01 -9.0988010168075562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -2.3967802524566650e-02</internalNodes>
+          <leafValues>
+            -6.2524855136871338e-01 3.0603738501667976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -3.1747903674840927e-02</internalNodes>
+          <leafValues>
+            -6.2007570266723633e-01 2.5801742449402809e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 13 -->
+    <_>
+      <maxWeakCount>84</maxWeakCount>
+      <stageThreshold>-1.3265128135681152e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 801 -2.4247136898338795e-03</internalNodes>
+          <leafValues>
+            4.3507692217826843e-01 -1.1363404244184494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 3.6287805996835232e-03</internalNodes>
+          <leafValues>
+            -1.5781879425048828e-01 3.3899685740470886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 -4.2556263506412506e-03</internalNodes>
+          <leafValues>
+            2.2901295125484467e-01 -2.0403152704238892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 1.6322638839483261e-03</internalNodes>
+          <leafValues>
+            -1.9230945408344269e-01 2.0004445314407349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 1.4746835455298424e-02</internalNodes>
+          <leafValues>
+            -1.2184409052133560e-01 3.9130899310112000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -1.5139304101467133e-02</internalNodes>
+          <leafValues>
+            2.6918080449104309e-01 -1.4086124300956726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -7.4753491207957268e-03</internalNodes>
+          <leafValues>
+            2.1792158484458923e-01 -1.6056208312511444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 2.3232740350067616e-03</internalNodes>
+          <leafValues>
+            -1.6489887237548828e-01 1.7108000814914703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -2.7532558888196945e-03</internalNodes>
+          <leafValues>
+            -5.3275841474533081e-01 5.2368167787790298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 -3.9793960750102997e-03</internalNodes>
+          <leafValues>
+            3.4057796001434326e-01 -8.0085732042789459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 7.1728855371475220e-02</internalNodes>
+          <leafValues>
+            -7.2147607803344727e-02 4.0667375922203064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 -5.3792679682374001e-04</internalNodes>
+          <leafValues>
+            1.7865169048309326e-01 -1.4902706444263458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 6.0019297525286674e-03</internalNodes>
+          <leafValues>
+            7.1029536426067352e-02 -3.9921376109123230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 6.9427289068698883e-02</internalNodes>
+          <leafValues>
+            -9.5279395580291748e-02 2.6865223050117493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 -8.8401548564434052e-03</internalNodes>
+          <leafValues>
+            -5.3491175174713135e-01 5.0447739660739899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -1.4551014639437199e-02</internalNodes>
+          <leafValues>
+            1.9883459806442261e-01 -1.1586152762174606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -1.7498439410701394e-03</internalNodes>
+          <leafValues>
+            2.2214990854263306e-01 -9.8238572478294373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 -2.1636944264173508e-02</internalNodes>
+          <leafValues>
+            2.8814041614532471e-01 -8.2750618457794189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 1.2786949053406715e-02</internalNodes>
+          <leafValues>
+            -8.7337315082550049e-02 2.6530647277832031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 -8.7271071970462799e-03</internalNodes>
+          <leafValues>
+            -5.3538525104522705e-01 5.0595279783010483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 3.3185956999659538e-03</internalNodes>
+          <leafValues>
+            4.5733701437711716e-02 -4.4758048653602600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -1.2216938193887472e-03</internalNodes>
+          <leafValues>
+            1.5257745981216431e-01 -1.4963941276073456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 3.9857804775238037e-02</internalNodes>
+          <leafValues>
+            -8.5655666887760162e-02 2.6823255419731140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 2.4454984813928604e-03</internalNodes>
+          <leafValues>
+            4.6102020889520645e-02 -5.0574064254760742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -4.2114150524139404e-01</internalNodes>
+          <leafValues>
+            6.9476419687271118e-01 -3.2907195389270782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 2.3470625281333923e-02</internalNodes>
+          <leafValues>
+            -8.6790844798088074e-02 2.2723633050918579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 -1.1454307474195957e-02</internalNodes>
+          <leafValues>
+            2.5413584709167480e-01 -8.8991768658161163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 5.0260839052498341e-03</internalNodes>
+          <leafValues>
+            3.8961157202720642e-02 -5.9463697671890259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 1.6196466749534011e-03</internalNodes>
+          <leafValues>
+            -9.0231269598007202e-02 2.6204809546470642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 8.1676244735717773e-02</internalNodes>
+          <leafValues>
+            -8.0785289406776428e-02 2.5112318992614746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -5.4313270375132561e-03</internalNodes>
+          <leafValues>
+            1.6463221609592438e-01 -1.3186016678810120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 5.7006161659955978e-03</internalNodes>
+          <leafValues>
+            -1.3998855650424957e-01 1.4326113462448120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -7.5926873832941055e-03</internalNodes>
+          <leafValues>
+            -5.5559343099594116e-01 3.7072587758302689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 7.5261802412569523e-03</internalNodes>
+          <leafValues>
+            2.8434989973902702e-02 -5.8689045906066895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 -6.3516031950712204e-03</internalNodes>
+          <leafValues>
+            1.4447389543056488e-01 -1.4542055130004883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 -7.6800247188657522e-04</internalNodes>
+          <leafValues>
+            1.8556322157382965e-01 -1.0404425859451294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -4.4167470186948776e-03</internalNodes>
+          <leafValues>
+            -7.0306748151779175e-01 3.0874395743012428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 3.3405693247914314e-03</internalNodes>
+          <leafValues>
+            -6.6534630954265594e-02 3.4018290042877197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 1.1457607150077820e-02</internalNodes>
+          <leafValues>
+            3.3658623695373535e-02 -6.1056423187255859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 -1.8547235522419214e-03</internalNodes>
+          <leafValues>
+            -7.4722522497177124e-01 2.2372998297214508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 -1.9720013439655304e-01</internalNodes>
+          <leafValues>
+            -5.9932583570480347e-01 2.9283462092280388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -2.6251156814396381e-03</internalNodes>
+          <leafValues>
+            -3.0683135986328125e-01 5.5391944944858551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -2.7104711532592773e-01</internalNodes>
+          <leafValues>
+            -6.4121168851852417e-01 2.6428909972310066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 1.0233232751488686e-02</internalNodes>
+          <leafValues>
+            4.5153360813856125e-02 -3.6883556842803955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 4.0971953421831131e-03</internalNodes>
+          <leafValues>
+            4.1385501623153687e-02 -4.3035930395126343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -8.8650803081691265e-04</internalNodes>
+          <leafValues>
+            1.6314724087715149e-01 -1.1271495372056961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 -4.1144760325551033e-03</internalNodes>
+          <leafValues>
+            -5.5176359415054321e-01 3.3540870994329453e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 -9.8663510289043188e-04</internalNodes>
+          <leafValues>
+            2.1676342189311981e-01 -8.5408315062522888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 6.0831783339381218e-03</internalNodes>
+          <leafValues>
+            -8.7310679256916046e-02 2.3208071291446686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -1.4624604955315590e-02</internalNodes>
+          <leafValues>
+            -5.9713214635848999e-01 3.0128041282296181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 1.3654056005179882e-02</internalNodes>
+          <leafValues>
+            2.4816744029521942e-02 -6.2301605939865112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 4.2229411192238331e-03</internalNodes>
+          <leafValues>
+            -7.3886208236217499e-02 2.4938605725765228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 1.3268929906189442e-03</internalNodes>
+          <leafValues>
+            4.0760166943073273e-02 -4.3510803580284119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -9.6903974190354347e-04</internalNodes>
+          <leafValues>
+            2.2486831247806549e-01 -7.8642837703227997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 1.0329007636755705e-03</internalNodes>
+          <leafValues>
+            -7.3648050427436829e-02 2.6808246970176697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -4.2711962014436722e-03</internalNodes>
+          <leafValues>
+            -4.0931078791618347e-01 4.7851666808128357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -3.7627927958965302e-03</internalNodes>
+          <leafValues>
+            -5.0520634651184082e-01 3.0405685305595398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -1.7928264569491148e-03</internalNodes>
+          <leafValues>
+            3.3886525034904480e-01 -5.3929597139358521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 3.9475625380873680e-03</internalNodes>
+          <leafValues>
+            3.4511350095272064e-02 -5.2250456809997559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -4.4537894427776337e-03</internalNodes>
+          <leafValues>
+            2.2575919330120087e-01 -7.4650920927524567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -2.9974281787872314e-02</internalNodes>
+          <leafValues>
+            -6.0629475116729736e-01 3.4456655383110046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 2.6775486767292023e-02</internalNodes>
+          <leafValues>
+            -8.8883727788925171e-02 2.0147153735160828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 -4.4971965253353119e-03</internalNodes>
+          <leafValues>
+            -5.3158396482467651e-01 3.3491309732198715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -1.5196309424936771e-02</internalNodes>
+          <leafValues>
+            2.8140705823898315e-01 -6.4074374735355377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 -2.1833679638803005e-03</internalNodes>
+          <leafValues>
+            2.1953551471233368e-01 -8.5029341280460358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -5.4325433447957039e-03</internalNodes>
+          <leafValues>
+            -4.8182886838912964e-01 3.8184959441423416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -3.9055421948432922e-03</internalNodes>
+          <leafValues>
+            -3.5678783059120178e-01 4.5511916279792786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 -5.0043486990034580e-03</internalNodes>
+          <leafValues>
+            -3.5324424505233765e-01 4.9539435654878616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 4.2052613571286201e-03</internalNodes>
+          <leafValues>
+            -7.6765090227127075e-02 2.4410718679428101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -2.9198043048381805e-03</internalNodes>
+          <leafValues>
+            2.8657916188240051e-01 -9.1479435563087463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 1.4442477375268936e-02</internalNodes>
+          <leafValues>
+            2.2604020312428474e-02 -7.7516084909439087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 1.0879908688366413e-02</internalNodes>
+          <leafValues>
+            -8.9434660971164703e-02 1.8898591399192810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 1.2304648756980896e-01</internalNodes>
+          <leafValues>
+            2.9145279899239540e-02 -5.6789475679397583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 5.4486069828271866e-02</internalNodes>
+          <leafValues>
+            -8.0465197563171387e-02 2.1073351800441742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -1.0112209245562553e-02</internalNodes>
+          <leafValues>
+            2.5688818097114563e-01 -7.3113977909088135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -4.3551158159971237e-03</internalNodes>
+          <leafValues>
+            -4.0537205338478088e-01 5.1149621605873108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 2.8712721541523933e-03</internalNodes>
+          <leafValues>
+            -8.9186541736125946e-02 2.0391693711280823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 2.4744076654314995e-02</internalNodes>
+          <leafValues>
+            3.1359996646642685e-02 -5.9586691856384277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 6.0209888033568859e-03</internalNodes>
+          <leafValues>
+            -8.2612000405788422e-02 2.1787849068641663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 6.0595902614295483e-03</internalNodes>
+          <leafValues>
+            4.7610606998205185e-02 -3.5010379552841187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -2.1957855671644211e-02</internalNodes>
+          <leafValues>
+            2.2477181255817413e-01 -7.5377546250820160e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -3.9967135526239872e-03</internalNodes>
+          <leafValues>
+            4.3043723702430725e-01 -3.9885677397251129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 -2.0381226204335690e-03</internalNodes>
+          <leafValues>
+            -5.8131587505340576e-01 3.2071832567453384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 3.8902673404663801e-03</internalNodes>
+          <leafValues>
+            -6.0279250144958496e-02 2.9424437880516052e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 14 -->
+    <_>
+      <maxWeakCount>82</maxWeakCount>
+      <stageThreshold>-1.2607949972152710e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 798 -1.9003680208697915e-03</internalNodes>
+          <leafValues>
+            4.8600798845291138e-01 -7.5834542512893677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 1.5605278313159943e-03</internalNodes>
+          <leafValues>
+            -1.9763922691345215e-01 2.5329649448394775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -4.8138713464140892e-03</internalNodes>
+          <leafValues>
+            3.5302931070327759e-01 -1.2585695087909698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 5.7447804138064384e-03</internalNodes>
+          <leafValues>
+            -1.5453046560287476e-01 3.5572248697280884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 3.2787662930786610e-03</internalNodes>
+          <leafValues>
+            -1.8419209122657776e-01 1.6216333210468292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 2.8142044320702553e-03</internalNodes>
+          <leafValues>
+            -9.4009101390838623e-02 2.7667456865310669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 1.8096582498401403e-03</internalNodes>
+          <leafValues>
+            -8.9050479233264923e-02 2.9622453451156616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 7.2106244042515755e-03</internalNodes>
+          <leafValues>
+            -1.0854976624250412e-01 2.2157947719097137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 1.3368867337703705e-02</internalNodes>
+          <leafValues>
+            5.8126326650381088e-02 -3.8564166426658630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 1.6755410470068455e-03</internalNodes>
+          <leafValues>
+            -6.9541916251182556e-02 3.6275833845138550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 -4.5782830566167831e-03</internalNodes>
+          <leafValues>
+            -5.6317430734634399e-01 3.9351724088191986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 3.6364984698593616e-03</internalNodes>
+          <leafValues>
+            -1.5140864253044128e-01 1.4790520071983337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -1.1279541999101639e-02</internalNodes>
+          <leafValues>
+            -4.8907181620597839e-01 5.1109701395034790e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -1.2224027886986732e-02</internalNodes>
+          <leafValues>
+            -6.0496371984481812e-01 3.5609807819128036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -2.8662174940109253e-02</internalNodes>
+          <leafValues>
+            2.4556699395179749e-01 -9.9369116127490997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 6.7924216389656067e-02</internalNodes>
+          <leafValues>
+            -7.8038521111011505e-02 3.3691942691802979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 2.2719642147421837e-03</internalNodes>
+          <leafValues>
+            5.8022607117891312e-02 -4.7124773263931274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 8.5627539083361626e-03</internalNodes>
+          <leafValues>
+            3.4671626985073090e-02 -4.6883812546730042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 1.1866856366395950e-03</internalNodes>
+          <leafValues>
+            -8.0339640378952026e-02 2.5030750036239624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 8.1023329403251410e-04</internalNodes>
+          <leafValues>
+            -8.0605715513229370e-02 2.5741192698478699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -4.0647285059094429e-03</internalNodes>
+          <leafValues>
+            -5.0938653945922852e-01 4.0403041988611221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 -1.9617568701505661e-02</internalNodes>
+          <leafValues>
+            -5.4703706502914429e-01 3.5078343003988266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 6.9989012554287910e-03</internalNodes>
+          <leafValues>
+            2.6246270164847374e-02 -6.0453557968139648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -6.2460554763674736e-03</internalNodes>
+          <leafValues>
+            2.3062629997730255e-01 -8.3763726055622101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 7.5731135439127684e-04</internalNodes>
+          <leafValues>
+            -9.5188923180103302e-02 2.3367822170257568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -3.2256892882287502e-03</internalNodes>
+          <leafValues>
+            2.1003848314285278e-01 -1.2173316627740860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -2.8797222767025232e-03</internalNodes>
+          <leafValues>
+            -4.8621371388435364e-01 4.3998546898365021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 5.9399371966719627e-03</internalNodes>
+          <leafValues>
+            2.7645273134112358e-02 -6.2591820955276489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 -5.4768389090895653e-03</internalNodes>
+          <leafValues>
+            2.5695452094078064e-01 -8.1276804208755493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 -2.2785080596804619e-02</internalNodes>
+          <leafValues>
+            -6.7479509115219116e-01 2.9845010489225388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 -6.0453559271991253e-03</internalNodes>
+          <leafValues>
+            -4.5132589340209961e-01 4.0413774549961090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 5.9022027999162674e-03</internalNodes>
+          <leafValues>
+            4.6321801841259003e-02 -3.9377251267433167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -1.1740738991647959e-03</internalNodes>
+          <leafValues>
+            2.2063454985618591e-01 -8.9038714766502380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -3.7963264621794224e-03</internalNodes>
+          <leafValues>
+            1.7901860177516937e-01 -1.0518371313810349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 2.4132090620696545e-03</internalNodes>
+          <leafValues>
+            -9.3182116746902466e-02 2.9489630460739136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 4.5318575575947762e-04</internalNodes>
+          <leafValues>
+            -1.4386458694934845e-01 1.3717848062515259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 1.8930386751890182e-02</internalNodes>
+          <leafValues>
+            3.3168405294418335e-02 -5.5337232351303101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -2.6878318749368191e-03</internalNodes>
+          <leafValues>
+            -5.4439735412597656e-01 3.1048862263560295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 -3.9407592266798019e-03</internalNodes>
+          <leafValues>
+            -6.5507227182388306e-01 2.4424355477094650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 2.1629813127219677e-03</internalNodes>
+          <leafValues>
+            -1.0160741209983826e-01 1.8277852237224579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 -2.9370808042585850e-03</internalNodes>
+          <leafValues>
+            -4.7847637534141541e-01 3.8538910448551178e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 3.8221649825572968e-02</internalNodes>
+          <leafValues>
+            -7.6206430792808533e-02 2.3375664651393890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 -3.1483019702136517e-03</internalNodes>
+          <leafValues>
+            2.5192636251449585e-01 -7.3695883154869080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -4.5907422900199890e-03</internalNodes>
+          <leafValues>
+            -6.2766075134277344e-01 2.8896089643239975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 -9.5378428697586060e-02</internalNodes>
+          <leafValues>
+            -7.4559724330902100e-01 2.1207747980952263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 2.0872952882200480e-03</internalNodes>
+          <leafValues>
+            -8.7810918688774109e-02 2.0629811286926270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 -6.9244997575879097e-03</internalNodes>
+          <leafValues>
+            1.8590562045574188e-01 -9.8790608346462250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 2.4594084825366735e-03</internalNodes>
+          <leafValues>
+            -1.0049589723348618e-01 2.2963477671146393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 -5.2931695245206356e-03</internalNodes>
+          <leafValues>
+            -4.5924744009971619e-01 4.3104480952024460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 4.8847724683582783e-03</internalNodes>
+          <leafValues>
+            4.6008609235286713e-02 -4.4277390837669373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 1.4400177169591188e-03</internalNodes>
+          <leafValues>
+            -5.9334080666303635e-02 3.0132320523262024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -8.6052305996417999e-03</internalNodes>
+          <leafValues>
+            1.9737368822097778e-01 -8.9747570455074310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -6.1248587444424629e-03</internalNodes>
+          <leafValues>
+            -4.5141929388046265e-01 3.8760874420404434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -1.8148655071854591e-03</internalNodes>
+          <leafValues>
+            2.2768247127532959e-01 -8.2637414336204529e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 -8.5119507275521755e-04</internalNodes>
+          <leafValues>
+            1.9616322219371796e-01 -1.0013028979301453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 1.4472046867012978e-02</internalNodes>
+          <leafValues>
+            -8.8336527347564697e-02 1.9660694897174835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 1.4135142788290977e-02</internalNodes>
+          <leafValues>
+            -6.4112767577171326e-02 3.1887489557266235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 4.8004039563238621e-03</internalNodes>
+          <leafValues>
+            4.8681098967790604e-02 -4.6234726905822754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 -3.3503584563732147e-02</internalNodes>
+          <leafValues>
+            2.5094386935234070e-01 -8.0808885395526886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 2.4153569247573614e-03</internalNodes>
+          <leafValues>
+            -7.2777584195137024e-02 2.6076248288154602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -1.3153228908777237e-02</internalNodes>
+          <leafValues>
+            2.3979008197784424e-01 -7.6283767819404602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -8.5048296023160219e-04</internalNodes>
+          <leafValues>
+            -3.2108953595161438e-01 5.7150222361087799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 2.0031477324664593e-03</internalNodes>
+          <leafValues>
+            -7.5618073344230652e-02 2.3024985194206238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -3.9609652012586594e-03</internalNodes>
+          <leafValues>
+            -4.3856775760650635e-01 3.7756573408842087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 5.9846425428986549e-03</internalNodes>
+          <leafValues>
+            3.5378426313400269e-02 -4.7760033607482910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 2.0205255597829819e-02</internalNodes>
+          <leafValues>
+            -8.0130979418754578e-02 2.2919151186943054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 -2.7492402587085962e-03</internalNodes>
+          <leafValues>
+            2.1395626664161682e-01 -7.6452419161796570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 -8.3101191557943821e-04</internalNodes>
+          <leafValues>
+            1.6961804032325745e-01 -9.9106967449188232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -1.8657972104847431e-03</internalNodes>
+          <leafValues>
+            -3.8131290674209595e-01 4.6056091785430908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 2.0824437960982323e-03</internalNodes>
+          <leafValues>
+            6.4966239035129547e-02 -2.3824627697467804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -4.4267112389206886e-03</internalNodes>
+          <leafValues>
+            -3.5809823870658875e-01 4.6749643981456757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 1.3552411692216992e-03</internalNodes>
+          <leafValues>
+            -1.2307690829038620e-01 1.3934792578220367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 -4.4114869087934494e-03</internalNodes>
+          <leafValues>
+            2.6617470383644104e-01 -7.4502207338809967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 5.2309304010123014e-04</internalNodes>
+          <leafValues>
+            -1.0876630991697311e-01 1.5687976777553558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 6.4505764748901129e-04</internalNodes>
+          <leafValues>
+            -8.0842182040214539e-02 2.0263716578483582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 2.0405012182891369e-03</internalNodes>
+          <leafValues>
+            -6.2390543520450592e-02 3.3067914843559265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.9838459789752960e-02</internalNodes>
+          <leafValues>
+            2.3488542065024376e-02 -8.1695795059204102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 2.3998366668820381e-03</internalNodes>
+          <leafValues>
+            4.1017178446054459e-02 -3.7197592854499817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -1.1092903092503548e-02</internalNodes>
+          <leafValues>
+            -5.5750596523284912e-01 2.9520254582166672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 1.4876715838909149e-02</internalNodes>
+          <leafValues>
+            -6.5797492861747742e-02 2.5957426428794861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 -3.0385032296180725e-02</internalNodes>
+          <leafValues>
+            2.2640630602836609e-01 -7.6991938054561615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 1.2216348201036453e-02</internalNodes>
+          <leafValues>
+            -7.0106968283653259e-02 2.4013392627239227e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 15 -->
+    <_>
+      <maxWeakCount>94</maxWeakCount>
+      <stageThreshold>-1.2798616886138916e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 801 -3.8322431501001120e-03</internalNodes>
+          <leafValues>
+            4.8065602779388428e-01 -4.9388073384761810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 2.5449637323617935e-03</internalNodes>
+          <leafValues>
+            -1.7564620077610016e-01 2.5865191221237183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -5.4743299260735512e-03</internalNodes>
+          <leafValues>
+            4.9321442842483521e-01 -7.0596724748611450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 1.5188493765890598e-02</internalNodes>
+          <leafValues>
+            -1.8555639684200287e-01 1.5278494358062744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 7.5815798481926322e-04</internalNodes>
+          <leafValues>
+            -1.5043407678604126e-01 1.8612807989120483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 -3.4232349134981632e-03</internalNodes>
+          <leafValues>
+            -4.5882478356361389e-01 4.3279532343149185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 2.4103666655719280e-03</internalNodes>
+          <leafValues>
+            -8.4217190742492676e-02 2.6687353849411011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 -2.3144368082284927e-02</internalNodes>
+          <leafValues>
+            2.9155749082565308e-01 -9.9449791014194489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 -4.2331898584961891e-03</internalNodes>
+          <leafValues>
+            -3.7696760892868042e-01 8.0511704087257385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 4.9294121563434601e-03</internalNodes>
+          <leafValues>
+            -1.3016121089458466e-01 1.8470372259616852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -2.7466980100143701e-05</internalNodes>
+          <leafValues>
+            1.4074377715587616e-01 -1.7928679287433624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 2.2430901881307364e-03</internalNodes>
+          <leafValues>
+            -1.4674974977970123e-01 1.5197925269603729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 7.5493026524782181e-03</internalNodes>
+          <leafValues>
+            2.4894557893276215e-02 -6.5740859508514404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 -3.3066330943256617e-03</internalNodes>
+          <leafValues>
+            1.8501703441143036e-01 -1.1837758123874664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 6.9540860131382942e-03</internalNodes>
+          <leafValues>
+            -7.3770649731159210e-02 2.9017251729965210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 -8.6210696026682854e-03</internalNodes>
+          <leafValues>
+            2.0990766584873199e-01 -1.0644201189279556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -6.0504255816340446e-04</internalNodes>
+          <leafValues>
+            2.2373022139072418e-01 -9.6104651689529419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -4.5433510094881058e-03</internalNodes>
+          <leafValues>
+            -5.4173427820205688e-01 4.7511249780654907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -2.2248399909585714e-03</internalNodes>
+          <leafValues>
+            -4.6854707598686218e-01 3.8701556622982025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 -5.3389102220535278e-02</internalNodes>
+          <leafValues>
+            2.9293462634086609e-01 -7.2517670691013336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 4.6098522841930389e-02</internalNodes>
+          <leafValues>
+            -1.0042577981948853e-01 2.3779328167438507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 7.7845109626650810e-03</internalNodes>
+          <leafValues>
+            3.7205196917057037e-02 -4.9194374680519104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 6.0175172984600067e-03</internalNodes>
+          <leafValues>
+            4.4034618884325027e-02 -4.3780878186225891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 4.8966710455715656e-03</internalNodes>
+          <leafValues>
+            -1.0375351458787918e-01 1.9480220973491669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -3.1284091528505087e-03</internalNodes>
+          <leafValues>
+            2.3669239878654480e-01 -9.6020378172397614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -1.3859109021723270e-03</internalNodes>
+          <leafValues>
+            2.8487151861190796e-01 -7.2190955281257629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 2.6260318700224161e-03</internalNodes>
+          <leafValues>
+            -8.5511997342109680e-02 3.0152606964111328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 1.7782470583915710e-01</internalNodes>
+          <leafValues>
+            -6.4100205898284912e-02 3.3825826644897461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 1.7538113519549370e-02</internalNodes>
+          <leafValues>
+            5.9994459152221680e-02 -3.5529783368110657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 -3.2135979272425175e-03</internalNodes>
+          <leafValues>
+            1.3668337464332581e-01 -1.3979049026966095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 6.1371903866529465e-03</internalNodes>
+          <leafValues>
+            -6.2439329922199249e-02 3.0614212155342102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -4.6563488431274891e-03</internalNodes>
+          <leafValues>
+            -4.3073609471321106e-01 4.9068968743085861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 -4.0680947713553905e-03</internalNodes>
+          <leafValues>
+            -4.6810126304626465e-01 3.7441805005073547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 1.4199400320649147e-03</internalNodes>
+          <leafValues>
+            -8.7975829839706421e-02 2.1591611206531525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 3.5254685208201408e-03</internalNodes>
+          <leafValues>
+            4.6650484204292297e-02 -4.3687531352043152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 1.8623860552906990e-02</internalNodes>
+          <leafValues>
+            -7.6216101646423340e-02 2.3812168836593628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -2.6926528662443161e-02</internalNodes>
+          <leafValues>
+            -6.7117422819137573e-01 2.9464269056916237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 2.2593191824853420e-03</internalNodes>
+          <leafValues>
+            2.8521748259663582e-02 -5.4787307977676392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 1.7519816174171865e-04</internalNodes>
+          <leafValues>
+            -1.6111046075820923e-01 1.0367503762245178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 1.0614154860377312e-02</internalNodes>
+          <leafValues>
+            4.5461904257535934e-02 -3.8087964057922363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 -4.4702589511871338e-03</internalNodes>
+          <leafValues>
+            1.4304992556571960e-01 -1.3372300565242767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 6.2367701902985573e-03</internalNodes>
+          <leafValues>
+            -7.7783808112144470e-02 2.1545551717281342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 4.6502514742314816e-03</internalNodes>
+          <leafValues>
+            4.6132039278745651e-02 -3.7130251526832581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -4.3315230868756771e-03</internalNodes>
+          <leafValues>
+            -4.1549521684646606e-01 3.8484618067741394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 -1.6567837446928024e-03</internalNodes>
+          <leafValues>
+            -3.4637498855590820e-01 4.6623144298791885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 4.7653233632445335e-03</internalNodes>
+          <leafValues>
+            -5.0808548927307129e-02 3.4609997272491455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 -3.2579647377133369e-03</internalNodes>
+          <leafValues>
+            2.6948198676109314e-01 -8.5287831723690033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 2.3307730443775654e-03</internalNodes>
+          <leafValues>
+            -7.4774339795112610e-02 2.3053503036499023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -2.7928136289119720e-02</internalNodes>
+          <leafValues>
+            1.9429244101047516e-01 -8.7820984423160553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -9.8205050453543663e-03</internalNodes>
+          <leafValues>
+            -5.9664642810821533e-01 3.1795132905244827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 4.9811266362667084e-03</internalNodes>
+          <leafValues>
+            -1.1911241710186005e-01 1.5268225967884064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -2.4869772605597973e-03</internalNodes>
+          <leafValues>
+            -3.8041505217552185e-01 4.4293139129877090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 5.4475376382470131e-03</internalNodes>
+          <leafValues>
+            -4.6219147741794586e-02 3.9531415700912476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -2.1438062191009521e-02</internalNodes>
+          <leafValues>
+            -5.2191144227981567e-01 3.4259662032127380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -4.1901203803718090e-03</internalNodes>
+          <leafValues>
+            -5.2377271652221680e-01 2.8632357716560364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -4.7237933613359928e-03</internalNodes>
+          <leafValues>
+            1.8694585561752319e-01 -8.3333678543567657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 1.2320578098297119e-03</internalNodes>
+          <leafValues>
+            -9.6744544804096222e-02 1.8287587165832520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 2.0271677523851395e-02</internalNodes>
+          <leafValues>
+            -6.4628154039382935e-02 2.7641129493713379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -1.0729704797267914e-01</internalNodes>
+          <leafValues>
+            4.3015307188034058e-01 -3.8674801588058472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -4.0820333361625671e-01</internalNodes>
+          <leafValues>
+            5.0520670413970947e-01 -3.0450601130723953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 4.4355981051921844e-02</internalNodes>
+          <leafValues>
+            -9.2204704880714417e-02 1.7342080175876617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -1.0999260703101754e-03</internalNodes>
+          <leafValues>
+            2.0996508002281189e-01 -7.7222190797328949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 -3.2928451895713806e-02</internalNodes>
+          <leafValues>
+            2.7598264813423157e-01 -6.4115919172763824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 2.3981094360351562e-02</internalNodes>
+          <leafValues>
+            2.5229524821043015e-02 -6.9560426473617554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 4.1703339666128159e-03</internalNodes>
+          <leafValues>
+            2.9712976887822151e-02 -4.8132696747779846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -1.4920771354809403e-03</internalNodes>
+          <leafValues>
+            1.6165184974670410e-01 -9.6420668065547943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 1.8172110430896282e-03</internalNodes>
+          <leafValues>
+            4.2247310280799866e-02 -3.5703054070472717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -2.5937356986105442e-03</internalNodes>
+          <leafValues>
+            2.2665317356586456e-01 -6.9081544876098633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -2.4995308369398117e-02</internalNodes>
+          <leafValues>
+            -6.3855916261672974e-01 2.8458235785365105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 1.2001263909041882e-02</internalNodes>
+          <leafValues>
+            1.4999576844274998e-02 -7.8175085783004761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 2.2153530735522509e-03</internalNodes>
+          <leafValues>
+            -8.8839285075664520e-02 1.8819671869277954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 2.7237991162110120e-05</internalNodes>
+          <leafValues>
+            -1.4949426054954529e-01 9.8739065229892731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -2.6735704392194748e-02</internalNodes>
+          <leafValues>
+            -4.5522138476371765e-01 3.2516691833734512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -2.3417242337018251e-03</internalNodes>
+          <leafValues>
+            -3.1453001499176025e-01 4.7598775476217270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 4.7831580042839050e-02</internalNodes>
+          <leafValues>
+            2.1954061463475227e-02 -6.1162966489791870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -5.7228151708841324e-03</internalNodes>
+          <leafValues>
+            -6.3381904363632202e-01 2.0299639552831650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 3.4780064597725868e-03</internalNodes>
+          <leafValues>
+            3.1021401286125183e-02 -4.2342424392700195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -5.4140854626893997e-03</internalNodes>
+          <leafValues>
+            4.7739461064338684e-01 -3.4031655639410019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 1.5283382963389158e-03</internalNodes>
+          <leafValues>
+            -9.6935935318470001e-02 1.9429819285869598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 -8.6789112538099289e-03</internalNodes>
+          <leafValues>
+            2.4826894700527191e-01 -6.0082063078880310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 3.0333681497722864e-03</internalNodes>
+          <leafValues>
+            -7.4087560176849365e-02 2.6165533065795898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 6.5222466364502907e-03</internalNodes>
+          <leafValues>
+            3.0176062136888504e-02 -5.5570882558822632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 5.9719551354646683e-03</internalNodes>
+          <leafValues>
+            2.3057831451296806e-02 -5.7078248262405396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 -1.3977952767163515e-03</internalNodes>
+          <leafValues>
+            1.5342144668102264e-01 -9.8401337862014771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 5.9919534251093864e-03</internalNodes>
+          <leafValues>
+            -3.9796624332666397e-02 3.5881185531616211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 2.6286500506103039e-03</internalNodes>
+          <leafValues>
+            -9.3140766024589539e-02 1.6334943473339081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 -4.4777179136872292e-03</internalNodes>
+          <leafValues>
+            -4.8081240057945251e-01 3.2935630530118942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 5.2724601700901985e-03</internalNodes>
+          <leafValues>
+            3.0787551775574684e-02 -4.5133110880851746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -3.2540475949645042e-03</internalNodes>
+          <leafValues>
+            -4.7695344686508179e-01 2.8554188087582588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 1.8083681166172028e-01</internalNodes>
+          <leafValues>
+            2.7366345748305321e-02 -4.9431446194648743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 2.7535988483577967e-03</internalNodes>
+          <leafValues>
+            1.9968675449490547e-02 -6.4471620321273804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -1.4123708009719849e-02</internalNodes>
+          <leafValues>
+            -5.2748751640319824e-01 2.4596616625785828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -3.2076485455036163e-02</internalNodes>
+          <leafValues>
+            -7.2171974182128906e-01 1.6940405592322350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 -3.2569766044616699e-02</internalNodes>
+          <leafValues>
+            2.2400286793708801e-01 -6.3403561711311340e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 16 -->
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.2990239858627319e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 728 1.1235726065933704e-02</internalNodes>
+          <leafValues>
+            -1.2534695863723755e-01 3.9147180318832397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 5.0947451964020729e-03</internalNodes>
+          <leafValues>
+            -1.2666413187980652e-01 4.0618515014648438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -1.5323986299335957e-03</internalNodes>
+          <leafValues>
+            2.8940162062644958e-01 -1.4350101351737976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 3.7766513414680958e-03</internalNodes>
+          <leafValues>
+            -1.9189934432506561e-01 1.4756591618061066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 4.8757870681583881e-03</internalNodes>
+          <leafValues>
+            -1.2341982126235962e-01 2.3298588395118713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 3.1278211623430252e-02</internalNodes>
+          <leafValues>
+            -7.6286941766738892e-02 3.4027433395385742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 6.3753505237400532e-03</internalNodes>
+          <leafValues>
+            7.3992513120174408e-02 -3.2609656453132629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 -9.8742637783288956e-04</internalNodes>
+          <leafValues>
+            2.4873960018157959e-01 -9.0153135359287262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -3.0144110321998596e-02</internalNodes>
+          <leafValues>
+            -5.1088541746139526e-01 5.0071869045495987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 4.7727730125188828e-03</internalNodes>
+          <leafValues>
+            5.1353454589843750e-02 -4.1142973303794861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 6.4554966986179352e-02</internalNodes>
+          <leafValues>
+            4.5133572071790695e-02 -4.8264691233634949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 8.0438675358891487e-03</internalNodes>
+          <leafValues>
+            -6.3803412020206451e-02 3.0405151844024658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 1.0576066561043262e-03</internalNodes>
+          <leafValues>
+            4.9984093755483627e-02 -3.3949175477027893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 6.8522170186042786e-03</internalNodes>
+          <leafValues>
+            3.5091523081064224e-02 -6.7847234010696411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 -1.7977621406316757e-02</internalNodes>
+          <leafValues>
+            -3.7503832578659058e-01 4.0370170027017593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -2.9955487698316574e-02</internalNodes>
+          <leafValues>
+            -4.2023807764053345e-01 4.2222321033477783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 2.0934976637363434e-02</internalNodes>
+          <leafValues>
+            4.3809924274682999e-02 -4.1159108281135559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 -1.0348223149776459e-03</internalNodes>
+          <leafValues>
+            1.7594149708747864e-01 -1.0171056538820267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 1.1026043444871902e-02</internalNodes>
+          <leafValues>
+            3.7518307566642761e-02 -4.9795153737068176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 4.1434396989643574e-03</internalNodes>
+          <leafValues>
+            -7.7400334179401398e-02 2.3505100607872009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -1.4838734641671181e-03</internalNodes>
+          <leafValues>
+            2.9909220337867737e-01 -9.2648021876811981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 4.0641101077198982e-03</internalNodes>
+          <leafValues>
+            3.8187902420759201e-02 -5.9566622972488403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -2.6055248454213142e-03</internalNodes>
+          <leafValues>
+            1.4647382497787476e-01 -1.1769902706146240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -1.8873009830713272e-02</internalNodes>
+          <leafValues>
+            2.0791313052177429e-01 -9.1127894818782806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 1.0428125038743019e-02</internalNodes>
+          <leafValues>
+            4.3083548545837402e-02 -4.1407048702239990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 1.9560819491744041e-03</internalNodes>
+          <leafValues>
+            -6.5898597240447998e-02 2.6488196849822998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 6.1143590137362480e-03</internalNodes>
+          <leafValues>
+            4.7718580812215805e-02 -4.3339842557907104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 3.9817169308662415e-03</internalNodes>
+          <leafValues>
+            2.8663935139775276e-02 -5.4472506046295166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 -9.0858177281916142e-04</internalNodes>
+          <leafValues>
+            1.2656490504741669e-01 -1.3804104924201965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 -5.1833119243383408e-02</internalNodes>
+          <leafValues>
+            2.9838389158248901e-01 -6.4876683056354523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 -6.1461031436920166e-02</internalNodes>
+          <leafValues>
+            2.2751982510089874e-01 -7.7075794339179993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 -3.8890805444680154e-04</internalNodes>
+          <leafValues>
+            1.4823918044567108e-01 -1.2443733215332031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 6.3632195815443993e-03</internalNodes>
+          <leafValues>
+            3.3928975462913513e-02 -5.5825293064117432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 2.3877150379121304e-03</internalNodes>
+          <leafValues>
+            -6.0555700212717056e-02 2.9875907301902771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 2.1584378555417061e-03</internalNodes>
+          <leafValues>
+            2.6707226410508156e-02 -6.5327596664428711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 1.3073299778625369e-03</internalNodes>
+          <leafValues>
+            -6.5057143568992615e-02 2.8509995341300964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 2.7173646230949089e-05</internalNodes>
+          <leafValues>
+            -1.4736446738243103e-01 1.1435943096876144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 2.5558518245816231e-03</internalNodes>
+          <leafValues>
+            2.2957315668463707e-02 -6.1825275421142578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 4.4789682142436504e-03</internalNodes>
+          <leafValues>
+            3.6877695471048355e-02 -4.1827708482742310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 -4.0298998355865479e-02</internalNodes>
+          <leafValues>
+            -6.8164646625518799e-01 2.1755648776888847e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -3.2729938626289368e-02</internalNodes>
+          <leafValues>
+            -5.4164266586303711e-01 2.6013873517513275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 -1.6982981469482183e-03</internalNodes>
+          <leafValues>
+            3.5175332427024841e-01 -4.7216285020112991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 3.6859638057649136e-03</internalNodes>
+          <leafValues>
+            4.9838334321975708e-02 -3.0565607547760010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 1.8905990291386843e-03</internalNodes>
+          <leafValues>
+            2.3341298103332520e-02 -6.6700172424316406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 4.9954187124967575e-03</internalNodes>
+          <leafValues>
+            2.5513354688882828e-02 -5.4635345935821533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 -5.5998284369707108e-03</internalNodes>
+          <leafValues>
+            2.9532432556152344e-01 -5.9350244700908661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -1.0907559189945459e-03</internalNodes>
+          <leafValues>
+            1.8265166878700256e-01 -9.8137028515338898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 -7.4323470471426845e-04</internalNodes>
+          <leafValues>
+            1.9020494818687439e-01 -8.7386451661586761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 2.7787161525338888e-03</internalNodes>
+          <leafValues>
+            3.2241951674222946e-02 -4.8055323958396912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 2.4344769772142172e-03</internalNodes>
+          <leafValues>
+            4.6477138996124268e-02 -2.9923307895660400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 2.8132982552051544e-03</internalNodes>
+          <leafValues>
+            -9.0026579797267914e-02 1.6738441586494446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 3.2191604375839233e-02</internalNodes>
+          <leafValues>
+            -6.3697919249534607e-02 2.8380525112152100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -1.8642821814864874e-03</internalNodes>
+          <leafValues>
+            2.0616722106933594e-01 -7.4722714722156525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 4.0091956034302711e-03</internalNodes>
+          <leafValues>
+            -7.1015752851963043e-02 2.5589218735694885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -5.1108514890074730e-03</internalNodes>
+          <leafValues>
+            -4.8940917849540710e-01 3.4555420279502869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -1.9523575901985168e-02</internalNodes>
+          <leafValues>
+            3.1921747326850891e-01 -5.1439035683870316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -1.4431261457502842e-02</internalNodes>
+          <leafValues>
+            1.4213174581527710e-01 -1.1113181710243225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 4.5302580110728741e-04</internalNodes>
+          <leafValues>
+            -1.0926237702369690e-01 1.4363190531730652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -5.4108840413391590e-03</internalNodes>
+          <leafValues>
+            -4.6926099061965942e-01 3.1095381826162338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 1.6963672824203968e-03</internalNodes>
+          <leafValues>
+            -6.7337587475776672e-02 2.2115154564380646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 1.8719944637268782e-03</internalNodes>
+          <leafValues>
+            -5.8433420956134796e-02 2.7830049395561218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 -8.3780642598867416e-03</internalNodes>
+          <leafValues>
+            -4.6290600299835205e-01 3.3701810985803604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 1.0720299184322357e-01</internalNodes>
+          <leafValues>
+            2.6600774377584457e-02 -5.0957643985748291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -1.5523867914453149e-03</internalNodes>
+          <leafValues>
+            -5.7974040508270264e-01 2.2188233211636543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -1.0537400841712952e-02</internalNodes>
+          <leafValues>
+            -4.3835061788558960e-01 2.9434528201818466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 3.1337797641754150e-02</internalNodes>
+          <leafValues>
+            2.0445786416530609e-02 -6.3010692596435547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -5.1124744117259979e-02</internalNodes>
+          <leafValues>
+            -6.7282766103744507e-01 1.8230145797133446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -6.0091790510341525e-04</internalNodes>
+          <leafValues>
+            2.0237097144126892e-01 -7.2557553648948669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 1.6933252336457372e-03</internalNodes>
+          <leafValues>
+            -5.9000160545110703e-02 2.4010565876960754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 5.7134744711220264e-03</internalNodes>
+          <leafValues>
+            2.9386352747678757e-02 -5.1309728622436523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 -9.6922749653458595e-03</internalNodes>
+          <leafValues>
+            -5.4907989501953125e-01 2.3704739287495613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 -1.2504560872912407e-02</internalNodes>
+          <leafValues>
+            -6.1863696575164795e-01 1.9876839593052864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -9.1812955215573311e-03</internalNodes>
+          <leafValues>
+            -4.7697570919990540e-01 2.5203671306371689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 2.8069302439689636e-02</internalNodes>
+          <leafValues>
+            -5.5565606802701950e-02 2.5318285822868347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 4.6324366703629494e-03</internalNodes>
+          <leafValues>
+            2.5273589417338371e-02 -5.9603255987167358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 2.9409723356366158e-03</internalNodes>
+          <leafValues>
+            -5.1576137542724609e-02 2.9322555661201477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -1.6009721904993057e-02</internalNodes>
+          <leafValues>
+            2.9389014840126038e-01 -4.7874812036752701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 -2.0468614995479584e-02</internalNodes>
+          <leafValues>
+            1.4383009076118469e-01 -1.0160042345523834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 2.3338340222835541e-02</internalNodes>
+          <leafValues>
+            -5.7301126420497894e-02 2.9121819138526917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 -2.1875634789466858e-02</internalNodes>
+          <leafValues>
+            -6.4106851816177368e-01 2.4203805252909660e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 1.1228370480239391e-02</internalNodes>
+          <leafValues>
+            -5.2143514156341553e-02 2.8465506434440613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -4.3659657239913940e-03</internalNodes>
+          <leafValues>
+            -6.0558545589447021e-01 2.5440702214837074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 1.1577639961615205e-03</internalNodes>
+          <leafValues>
+            -8.9793093502521515e-02 1.6500258445739746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 1.1090341955423355e-02</internalNodes>
+          <leafValues>
+            2.4472476914525032e-02 -6.1380225419998169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 4.7660744749009609e-03</internalNodes>
+          <leafValues>
+            4.1726417839527130e-02 -3.2548862695693970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 2.4865168597898446e-05</internalNodes>
+          <leafValues>
+            -1.2436556816101074e-01 1.1702288687229156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 -7.6379198580980301e-03</internalNodes>
+          <leafValues>
+            -4.9008071422576904e-01 2.9381709173321724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -3.2750256359577179e-03</internalNodes>
+          <leafValues>
+            1.7950019240379333e-01 -8.0592408776283264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 1.3944536913186312e-03</internalNodes>
+          <leafValues>
+            -8.0001771450042725e-02 2.2785140573978424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 1.9776031840592623e-03</internalNodes>
+          <leafValues>
+            3.4109916538000107e-02 -4.8504865169525146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 -3.9329148828983307e-02</internalNodes>
+          <leafValues>
+            -6.8790251016616821e-01 1.7370922490954399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -2.8447234071791172e-03</internalNodes>
+          <leafValues>
+            2.3028372228145599e-01 -6.6618286073207855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 3.2375190407037735e-02</internalNodes>
+          <leafValues>
+            -7.5743824243545532e-02 1.7864570021629333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 5.1314428448677063e-02</internalNodes>
+          <leafValues>
+            -5.3142681717872620e-02 2.8643575310707092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 4.6999715268611908e-03</internalNodes>
+          <leafValues>
+            3.5749543458223343e-02 -4.0437424182891846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -2.0850417204201221e-03</internalNodes>
+          <leafValues>
+            -3.0815458297729492e-01 4.2763352394104004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 -9.1223767958581448e-04</internalNodes>
+          <leafValues>
+            2.1245715022087097e-01 -6.7729450762271881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -2.2479293693322688e-04</internalNodes>
+          <leafValues>
+            1.3159312307834625e-01 -1.0141336172819138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 3.1234124675393105e-02</internalNodes>
+          <leafValues>
+            -8.9100256562232971e-02 1.5734429657459259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.5079543227329850e-03</internalNodes>
+          <leafValues>
+            3.2412421703338623e-01 -4.4387526810169220e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 17 -->
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.2500010728836060e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 803 -5.5631361901760101e-03</internalNodes>
+          <leafValues>
+            4.5343571901321411e-01 -5.2330773323774338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 4.1911248117685318e-03</internalNodes>
+          <leafValues>
+            -1.2266161292791367e-01 3.6830583214759827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 -1.8559540621936321e-03</internalNodes>
+          <leafValues>
+            2.4044598639011383e-01 -1.5207393467426300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -1.1846812441945076e-02</internalNodes>
+          <leafValues>
+            2.7016878128051758e-01 -1.1934488266706467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 1.0401019826531410e-03</internalNodes>
+          <leafValues>
+            -2.3527304828166962e-01 9.5964968204498291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 9.3873767182230949e-03</internalNodes>
+          <leafValues>
+            -5.6923847645521164e-02 4.2236638069152832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 9.0843521058559418e-02</internalNodes>
+          <leafValues>
+            -6.3625380396842957e-02 3.8295668363571167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 -1.6221515834331512e-03</internalNodes>
+          <leafValues>
+            1.8148291110992432e-01 -1.3424767553806305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -1.8008962273597717e-02</internalNodes>
+          <leafValues>
+            2.7346464991569519e-01 -7.6283894479274750e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 8.6509017273783684e-03</internalNodes>
+          <leafValues>
+            5.8148156851530075e-02 -5.2620184421539307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 2.8817038983106613e-03</internalNodes>
+          <leafValues>
+            2.6940831914544106e-02 -4.7911167144775391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -6.1017833650112152e-03</internalNodes>
+          <leafValues>
+            1.7878855764865875e-01 -1.2378337979316711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 -5.9294269885867834e-04</internalNodes>
+          <leafValues>
+            -2.7179723978042603e-01 8.0951526761054993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 3.1696190126240253e-04</internalNodes>
+          <leafValues>
+            -1.7311862111091614e-01 1.0296358913183212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 6.6280784085392952e-03</internalNodes>
+          <leafValues>
+            -5.8870136737823486e-02 2.9477587342262268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 -4.5112203806638718e-03</internalNodes>
+          <leafValues>
+            -5.9672296047210693e-01 2.7053238824009895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -4.3381296098232269e-02</internalNodes>
+          <leafValues>
+            -4.2040801048278809e-01 4.0890187025070190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 2.0323593635112047e-03</internalNodes>
+          <leafValues>
+            5.5178079754114151e-02 -3.0439695715904236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 1.8127080984413624e-03</internalNodes>
+          <leafValues>
+            -8.2048252224922180e-02 2.1907366812229156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 -6.6424394026398659e-03</internalNodes>
+          <leafValues>
+            -4.7840338945388794e-01 4.4878169894218445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -8.5755460895597935e-04</internalNodes>
+          <leafValues>
+            1.3301849365234375e-01 -1.2699788808822632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 3.4769098274409771e-03</internalNodes>
+          <leafValues>
+            -7.1578972041606903e-02 2.5448271632194519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -1.8520625308156013e-03</internalNodes>
+          <leafValues>
+            1.5127970278263092e-01 -1.2349219620227814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 5.4582338780164719e-03</internalNodes>
+          <leafValues>
+            3.5001352429389954e-02 -4.8021456599235535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -6.4206691458821297e-03</internalNodes>
+          <leafValues>
+            -5.6509351730346680e-01 2.6883032172918320e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 8.2498416304588318e-03</internalNodes>
+          <leafValues>
+            4.3442543596029282e-02 -3.7965279817581177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 3.0813394114375114e-03</internalNodes>
+          <leafValues>
+            -5.6544844061136246e-02 3.2101437449455261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 2.8121876530349255e-03</internalNodes>
+          <leafValues>
+            -7.1444042026996613e-02 2.8035575151443481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -1.1791236698627472e-02</internalNodes>
+          <leafValues>
+            2.0067863166332245e-01 -1.0047248005867004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 1.4931729529052973e-03</internalNodes>
+          <leafValues>
+            -6.6428750753402710e-02 2.6187655329704285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 -2.8772680088877678e-03</internalNodes>
+          <leafValues>
+            -4.5838123559951782e-01 4.2477916926145554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 -4.5857336372137070e-03</internalNodes>
+          <leafValues>
+            1.2718579173088074e-01 -1.3642288744449615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -1.3770985417068005e-02</internalNodes>
+          <leafValues>
+            -6.4000308513641357e-01 2.7297915890812874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -3.6472730338573456e-02</internalNodes>
+          <leafValues>
+            -5.1465278863906860e-01 3.1265191733837128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 1.0626764036715031e-02</internalNodes>
+          <leafValues>
+            2.4199636653065681e-02 -6.3441967964172363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 -3.6817211657762527e-03</internalNodes>
+          <leafValues>
+            -4.4575414061546326e-01 3.1119547784328461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 -3.4752404317259789e-03</internalNodes>
+          <leafValues>
+            1.4008119702339172e-01 -1.0539831966161728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -4.7973562031984329e-03</internalNodes>
+          <leafValues>
+            2.8762820363044739e-01 -6.0662355273962021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 6.4153699204325676e-03</internalNodes>
+          <leafValues>
+            -1.1230263859033585e-01 1.4087037742137909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -1.0156400967389345e-03</internalNodes>
+          <leafValues>
+            -3.3441004157066345e-01 4.3477565050125122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 3.3057793043553829e-03</internalNodes>
+          <leafValues>
+            1.9609324634075165e-02 -7.0060092210769653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -5.3275022655725479e-03</internalNodes>
+          <leafValues>
+            2.4580952525138855e-01 -6.0118518769741058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 1.5886269975453615e-03</internalNodes>
+          <leafValues>
+            -7.7446170151233673e-02 1.9878011941909790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 4.7287968918681145e-03</internalNodes>
+          <leafValues>
+            3.0098341405391693e-02 -5.0950014591217041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -1.9788878853432834e-04</internalNodes>
+          <leafValues>
+            1.5142950415611267e-01 -9.6688762307167053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -4.9208370037376881e-03</internalNodes>
+          <leafValues>
+            -4.5343187451362610e-01 3.7627156823873520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 4.5094583183526993e-02</internalNodes>
+          <leafValues>
+            -8.5510566830635071e-02 1.7849470674991608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 1.4799998607486486e-03</internalNodes>
+          <leafValues>
+            -6.4638271927833557e-02 2.3496921360492706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 1.0061380267143250e-01</internalNodes>
+          <leafValues>
+            -3.0139762908220291e-02 4.9012109637260437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -5.2844230085611343e-03</internalNodes>
+          <leafValues>
+            1.7104546725749969e-01 -8.7710574269294739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -8.3214940968900919e-04</internalNodes>
+          <leafValues>
+            -2.6654696464538574e-01 5.3875535726547241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -8.8889291509985924e-04</internalNodes>
+          <leafValues>
+            1.8824113905429840e-01 -8.0119885504245758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 2.2177316714078188e-03</internalNodes>
+          <leafValues>
+            -6.9703146815299988e-02 2.0391084253787994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -1.1522162239998579e-03</internalNodes>
+          <leafValues>
+            -3.6508113145828247e-01 3.9048090577125549e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 -1.0836161673069000e-02</internalNodes>
+          <leafValues>
+            -5.8106678724288940e-01 2.1713526919484138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 -1.6731536388397217e-01</internalNodes>
+          <leafValues>
+            -4.7344669699668884e-01 2.6662701740860939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -9.5267388969659805e-03</internalNodes>
+          <leafValues>
+            2.7732986211776733e-01 -5.6512769311666489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 6.6450019367039204e-03</internalNodes>
+          <leafValues>
+            2.9381312429904938e-02 -5.3565382957458496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 -2.1554589271545410e-02</internalNodes>
+          <leafValues>
+            -6.2839144468307495e-01 1.8782904371619225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 1.4288825332187116e-04</internalNodes>
+          <leafValues>
+            -1.2763719260692596e-01 1.0616952925920486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 1.8068919889628887e-03</internalNodes>
+          <leafValues>
+            4.2757544666528702e-02 -3.2102146744728088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 1.2280542869120836e-03</internalNodes>
+          <leafValues>
+            -5.7478122413158417e-02 2.5948432087898254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 2.6250675320625305e-02</internalNodes>
+          <leafValues>
+            -9.5928788185119629e-02 1.4502045512199402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 1.8192850984632969e-03</internalNodes>
+          <leafValues>
+            -6.8028703331947327e-02 2.3167446255683899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -4.8545510508120060e-03</internalNodes>
+          <leafValues>
+            -4.3374514579772949e-01 3.6196250468492508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 2.8766903560608625e-03</internalNodes>
+          <leafValues>
+            3.8431353867053986e-02 -3.3900904655456543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 4.4511677697300911e-03</internalNodes>
+          <leafValues>
+            -4.8704307526350021e-02 2.9764902591705322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -9.9098179489374161e-03</internalNodes>
+          <leafValues>
+            2.5863200426101685e-01 -5.7418409734964371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -2.6503708213567734e-03</internalNodes>
+          <leafValues>
+            1.3571591675281525e-01 -1.1608450859785080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -3.0543167144060135e-02</internalNodes>
+          <leafValues>
+            2.8910955786705017e-01 -5.1689133048057556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -2.6757145300507545e-02</internalNodes>
+          <leafValues>
+            1.8446540832519531e-01 -7.7666454017162323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 -2.2985447198152542e-02</internalNodes>
+          <leafValues>
+            -3.5471677780151367e-01 4.1345477104187012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 9.5467511564493179e-03</internalNodes>
+          <leafValues>
+            -5.5719308555126190e-02 2.4589607119560242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 2.6181992143392563e-03</internalNodes>
+          <leafValues>
+            -1.0256808251142502e-01 1.3319683074951172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -3.5491142421960831e-02</internalNodes>
+          <leafValues>
+            -5.9519535303115845e-01 2.2935084998607635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 1.5474080573767424e-03</internalNodes>
+          <leafValues>
+            -8.4649838507175446e-02 1.6198579967021942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -3.4878745209425688e-03</internalNodes>
+          <leafValues>
+            -5.0121647119522095e-01 2.6359066367149353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 3.6612942349165678e-03</internalNodes>
+          <leafValues>
+            -7.2178244590759277e-02 1.8415448069572449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -2.1762652322649956e-03</internalNodes>
+          <leafValues>
+            2.1102276444435120e-01 -6.4692504703998566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -6.9864131510257721e-03</internalNodes>
+          <leafValues>
+            -4.3104550242424011e-01 3.3448409289121628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 4.7067347913980484e-03</internalNodes>
+          <leafValues>
+            4.7681909054517746e-02 -3.1132212281227112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 -7.0012239739298820e-03</internalNodes>
+          <leafValues>
+            -3.4665238857269287e-01 3.6263268440961838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 1.0144514963030815e-02</internalNodes>
+          <leafValues>
+            3.3140499144792557e-02 -3.7149414420127869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 2.5893552228808403e-03</internalNodes>
+          <leafValues>
+            -5.6186988949775696e-02 2.3859155178070068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -3.8091647438704967e-03</internalNodes>
+          <leafValues>
+            1.8803173303604126e-01 -9.0667806565761566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -2.5004068017005920e-01</internalNodes>
+          <leafValues>
+            -5.7437247037887573e-01 2.3015361279249191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -8.5459719412028790e-04</internalNodes>
+          <leafValues>
+            -3.0019384622573853e-01 4.1898671537637711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -1.5604835003614426e-02</internalNodes>
+          <leafValues>
+            -5.8520871400833130e-01 2.1410541608929634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 -1.9794562458992004e-01</internalNodes>
+          <leafValues>
+            -6.7963910102844238e-01 1.6488522291183472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 -1.9824346527457237e-03</internalNodes>
+          <leafValues>
+            1.4493939280509949e-01 -8.7999224662780762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -2.1158650517463684e-02</internalNodes>
+          <leafValues>
+            -6.4664304256439209e-01 2.4590896442532539e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -9.3553803162649274e-04</internalNodes>
+          <leafValues>
+            1.8229192495346069e-01 -7.2682343423366547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -1.1120189446955919e-03</internalNodes>
+          <leafValues>
+            1.5188181400299072e-01 -8.6225852370262146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 1.1543033272027969e-01</internalNodes>
+          <leafValues>
+            -4.7091111540794373e-02 3.5574361681938171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -5.2959467284381390e-03</internalNodes>
+          <leafValues>
+            2.0496748387813568e-01 -6.1289250850677490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 -2.6194794103503227e-02</internalNodes>
+          <leafValues>
+            1.7320305109024048e-01 -1.1094193905591965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 1.4183738268911839e-02</internalNodes>
+          <leafValues>
+            -9.7011148929595947e-02 1.4372280240058899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 -3.6340979859232903e-03</internalNodes>
+          <leafValues>
+            -4.0951785445213318e-01 3.0991807579994202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 1.4448106288909912e-02</internalNodes>
+          <leafValues>
+            -6.1627220362424850e-02 2.0916682481765747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 -1.1399465613067150e-02</internalNodes>
+          <leafValues>
+            1.8926219642162323e-01 -8.7004892528057098e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 18 -->
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.2953979969024658e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 725 1.6048721969127655e-02</internalNodes>
+          <leafValues>
+            -9.5187164843082428e-02 3.7635341286659241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 4.1785854846239090e-03</internalNodes>
+          <leafValues>
+            -1.4184002578258514e-01 3.1887301802635193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -6.7659835331141949e-03</internalNodes>
+          <leafValues>
+            3.7005490064620972e-01 -8.9318118989467621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 1.4478694647550583e-02</internalNodes>
+          <leafValues>
+            -1.3418816030025482e-01 2.8370034694671631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -1.8653089646250010e-03</internalNodes>
+          <leafValues>
+            -3.5015934705734253e-01 6.9187328219413757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 3.7634610198438168e-03</internalNodes>
+          <leafValues>
+            -7.7612839639186859e-02 3.0384179949760437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 8.9913085103034973e-03</internalNodes>
+          <leafValues>
+            6.0584690421819687e-02 -4.7271341085433960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -3.0867164023220539e-03</internalNodes>
+          <leafValues>
+            1.6870087385177612e-01 -1.3231597840785980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -4.0246914140880108e-03</internalNodes>
+          <leafValues>
+            -4.1840493679046631e-01 6.4627721905708313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 4.8679644241929054e-03</internalNodes>
+          <leafValues>
+            -5.6233335286378860e-02 4.2156839370727539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 5.5472417734563351e-03</internalNodes>
+          <leafValues>
+            3.7891130894422531e-02 -5.1408857107162476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 6.5884483046829700e-04</internalNodes>
+          <leafValues>
+            -1.6457377374172211e-01 1.1204792559146881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -1.0980388615280390e-03</internalNodes>
+          <leafValues>
+            -3.3544427156448364e-01 4.6025454998016357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -2.8328509069979191e-03</internalNodes>
+          <leafValues>
+            2.3426958918571472e-01 -7.2758100926876068e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 1.5504788607358932e-03</internalNodes>
+          <leafValues>
+            6.2664858996868134e-02 -2.5632002949714661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -6.2153179896995425e-04</internalNodes>
+          <leafValues>
+            1.7485393583774567e-01 -9.9982917308807373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 -1.4540781266987324e-02</internalNodes>
+          <leafValues>
+            -4.4969236850738525e-01 3.7324137985706329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 -1.6624422278255224e-03</internalNodes>
+          <leafValues>
+            1.4047256112098694e-01 -1.1892398446798325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 1.6246617306023836e-03</internalNodes>
+          <leafValues>
+            6.1172962188720703e-02 -2.7449882030487061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 -1.1364535987377167e-01</internalNodes>
+          <leafValues>
+            -4.3175131082534790e-01 3.8861453533172607e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 6.3355863094329834e-03</internalNodes>
+          <leafValues>
+            4.3615639209747314e-02 -3.7530297040939331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -7.9950205981731415e-03</internalNodes>
+          <leafValues>
+            -5.6157833337783813e-01 2.7148496359586716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -6.0972268693149090e-03</internalNodes>
+          <leafValues>
+            4.7499263286590576e-01 -3.5678520798683167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 1.3845593202859163e-03</internalNodes>
+          <leafValues>
+            -1.1575383692979813e-01 1.3405258953571320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 8.5432223975658417e-02</internalNodes>
+          <leafValues>
+            -5.6930482387542725e-02 3.1373351812362671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -1.2029780447483063e-01</internalNodes>
+          <leafValues>
+            -4.7989824414253235e-01 3.8594469428062439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 -8.3766942843794823e-03</internalNodes>
+          <leafValues>
+            -2.0806340873241425e-01 7.6934777200222015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -4.6590538695454597e-03</internalNodes>
+          <leafValues>
+            -5.0349289178848267e-01 3.0419014394283295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -3.2761119306087494e-02</internalNodes>
+          <leafValues>
+            3.2354715466499329e-01 -5.6276485323905945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 8.3009023219347000e-03</internalNodes>
+          <leafValues>
+            -8.3831317722797394e-02 2.3335608839988708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 5.7156109251081944e-03</internalNodes>
+          <leafValues>
+            -8.6484365165233612e-02 1.8363620340824127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 -1.0080671310424805e-01</internalNodes>
+          <leafValues>
+            3.8774350285530090e-01 -4.0828518569469452e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -2.5552421808242798e-02</internalNodes>
+          <leafValues>
+            -5.0166463851928711e-01 3.8269419223070145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -6.1748407781124115e-02</internalNodes>
+          <leafValues>
+            -3.5811841487884521e-01 4.6544160693883896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -1.2269845232367516e-02</internalNodes>
+          <leafValues>
+            2.0786920189857483e-01 -7.8518457710742950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 2.8048269450664520e-02</internalNodes>
+          <leafValues>
+            -5.6248739361763000e-02 2.8977242112159729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 -7.2269486263394356e-03</internalNodes>
+          <leafValues>
+            -7.2842431068420410e-01 2.3379294201731682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 4.7771912068128586e-03</internalNodes>
+          <leafValues>
+            2.3226773366332054e-02 -5.6412339210510254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 2.8181755915284157e-03</internalNodes>
+          <leafValues>
+            -3.3893339335918427e-02 4.3989458680152893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -8.4437360055744648e-04</internalNodes>
+          <leafValues>
+            1.9623728096485138e-01 -7.8485630452632904e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 -4.3037505820393562e-03</internalNodes>
+          <leafValues>
+            -3.6311796307563782e-01 4.0526941418647766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 4.9789976328611374e-03</internalNodes>
+          <leafValues>
+            4.8658054322004318e-02 -3.1162264943122864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 -5.0353109836578369e-03</internalNodes>
+          <leafValues>
+            -5.5396872758865356e-01 2.3420164361596107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -1.3716940302401781e-03</internalNodes>
+          <leafValues>
+            2.2532704472541809e-01 -6.2741614878177643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 3.3456790260970592e-03</internalNodes>
+          <leafValues>
+            3.8516163825988770e-02 -3.6224716901779175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 1.9023896893486381e-03</internalNodes>
+          <leafValues>
+            -5.4677281528711319e-02 2.5294607877731323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 -1.4274399727582932e-03</internalNodes>
+          <leafValues>
+            -3.7934723496437073e-01 3.8707002997398376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 1.1010284069925547e-03</internalNodes>
+          <leafValues>
+            -9.5659099519252777e-02 1.4958517253398895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -4.4154529459774494e-03</internalNodes>
+          <leafValues>
+            -5.1156622171401978e-01 2.5640288367867470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 3.7023271434009075e-03</internalNodes>
+          <leafValues>
+            -4.3221119791269302e-02 3.2581970095634460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -5.4480084218084812e-03</internalNodes>
+          <leafValues>
+            -4.7611567378044128e-01 3.5773757845163345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -3.1974539160728455e-04</internalNodes>
+          <leafValues>
+            1.1916244029998779e-01 -1.1832383275032043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 -2.8494147583842278e-02</internalNodes>
+          <leafValues>
+            -6.5004557371139526e-01 2.0599177107214928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -2.7449331246316433e-03</internalNodes>
+          <leafValues>
+            -3.9275056123733521e-01 3.3223718404769897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 4.1362000629305840e-03</internalNodes>
+          <leafValues>
+            2.7191400527954102e-02 -4.7952741384506226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 3.3568721264600754e-03</internalNodes>
+          <leafValues>
+            -6.0983922332525253e-02 2.2964073717594147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 -5.7129040360450745e-03</internalNodes>
+          <leafValues>
+            -5.9052920341491699e-01 2.3388050496578217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -1.1567326728254557e-03</internalNodes>
+          <leafValues>
+            1.5093772113323212e-01 -9.1553181409835815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -8.9379055425524712e-03</internalNodes>
+          <leafValues>
+            -3.5481104254722595e-01 3.6294396966695786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 3.6097350530326366e-03</internalNodes>
+          <leafValues>
+            3.2780081033706665e-02 -3.8517734408378601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 2.0727193914353848e-03</internalNodes>
+          <leafValues>
+            -5.3627125918865204e-02 2.5666573643684387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 -1.8177125602960587e-03</internalNodes>
+          <leafValues>
+            2.0363596081733704e-01 -7.0555560290813446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 -3.3223466016352177e-03</internalNodes>
+          <leafValues>
+            -4.8926571011543274e-01 2.8675178065896034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -4.4222660362720490e-03</internalNodes>
+          <leafValues>
+            -4.0920063853263855e-01 3.0863059684634209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 -7.8024319373071194e-04</internalNodes>
+          <leafValues>
+            1.2166435271501541e-01 -1.0897941887378693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 7.9855127260088921e-03</internalNodes>
+          <leafValues>
+            2.5865448638796806e-02 -4.8917418718338013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 -2.7752606911235489e-05</internalNodes>
+          <leafValues>
+            1.1611134558916092e-01 -1.1225233227014542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 3.0770362354815006e-03</internalNodes>
+          <leafValues>
+            -6.4753420650959015e-02 1.9632078707218170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -2.1007210016250610e-03</internalNodes>
+          <leafValues>
+            1.9681814312934875e-01 -9.4167068600654602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -6.1383144930005074e-03</internalNodes>
+          <leafValues>
+            -3.9225277304649353e-01 3.5275831818580627e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 1.1184177361428738e-02</internalNodes>
+          <leafValues>
+            2.9410628601908684e-02 -4.3673589825630188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 1.0432782582938671e-03</internalNodes>
+          <leafValues>
+            -6.7393802106380463e-02 1.9237922132015228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 8.5366604616865516e-04</internalNodes>
+          <leafValues>
+            -8.4067851305007935e-02 1.6720806062221527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -3.3059090375900269e-02</internalNodes>
+          <leafValues>
+            2.6451063156127930e-01 -5.2662543952465057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 -8.7435375899076462e-03</internalNodes>
+          <leafValues>
+            -3.0780994892120361e-01 4.8419766128063202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 -1.1587596964091063e-03</internalNodes>
+          <leafValues>
+            1.4863640069961548e-01 -9.4251774251461029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 -2.2717786952853203e-02</internalNodes>
+          <leafValues>
+            -4.2414310574531555e-01 3.5150803625583649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 -8.4660220891237259e-03</internalNodes>
+          <leafValues>
+            2.5765278935432434e-01 -5.4796367883682251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -1.4943551504984498e-03</internalNodes>
+          <leafValues>
+            -2.7729934453964233e-01 4.9375709146261215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 0 -7.5480109080672264e-04</internalNodes>
+          <leafValues>
+            1.2197802960872650e-01 -1.0845532268285751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 2.9903287068009377e-03</internalNodes>
+          <leafValues>
+            -8.4785357117652893e-02 1.5424512326717377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 1.7600806895643473e-03</internalNodes>
+          <leafValues>
+            7.0044547319412231e-02 -1.9795240461826324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 1.2243577279150486e-02</internalNodes>
+          <leafValues>
+            -7.8472696244716644e-02 1.7095038294792175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -2.7739753946661949e-02</internalNodes>
+          <leafValues>
+            2.0475350320339203e-01 -6.9862313568592072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -6.4486754126846790e-03</internalNodes>
+          <leafValues>
+            -3.7651637196540833e-01 3.3540505915880203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -1.3427068479359150e-02</internalNodes>
+          <leafValues>
+            1.5320046246051788e-01 -8.3272159099578857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 8.2654636353254318e-03</internalNodes>
+          <leafValues>
+            -8.1395141780376434e-02 1.9696740806102753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 3.0615129508078098e-03</internalNodes>
+          <leafValues>
+            -5.8534789830446243e-02 2.1799990534782410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -1.4359520282596350e-03</internalNodes>
+          <leafValues>
+            1.8553669750690460e-01 -7.9428143799304962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 2.8793164528906345e-03</internalNodes>
+          <leafValues>
+            3.7499722093343735e-02 -3.5483118891716003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 -9.0899681672453880e-03</internalNodes>
+          <leafValues>
+            -5.9031629562377930e-01 2.0012531429529190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 1.6797243151813745e-03</internalNodes>
+          <leafValues>
+            -6.8868115544319153e-02 1.8992543220520020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -1.1759581044316292e-02</internalNodes>
+          <leafValues>
+            3.6288693547248840e-01 -3.3578243106603622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 3.8305222988128662e-03</internalNodes>
+          <leafValues>
+            -6.6793553531169891e-02 1.9304293394088745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 1.2506111524999142e-03</internalNodes>
+          <leafValues>
+            -8.1618689000606537e-02 1.5481384098529816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 -1.6119323670864105e-02</internalNodes>
+          <leafValues>
+            1.4024992287158966e-01 -9.3965478241443634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 -7.2789913974702358e-04</internalNodes>
+          <leafValues>
+            1.9554650783538818e-01 -7.2329640388488770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 1.4888901496306062e-03</internalNodes>
+          <leafValues>
+            3.3372651785612106e-02 -4.0691211819648743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -4.9822013825178146e-03</internalNodes>
+          <leafValues>
+            -3.3125448226928711e-01 3.6899805068969727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 9.4443336129188538e-03</internalNodes>
+          <leafValues>
+            3.1763385981321335e-02 -3.7651473283767700e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 19 -->
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.3101767301559448e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 535 -1.2652185745537281e-02</internalNodes>
+          <leafValues>
+            4.0350878238677979e-01 -8.6829073727130890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 4.8778904601931572e-03</internalNodes>
+          <leafValues>
+            -9.1208808124065399e-02 4.8882400989532471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -2.4099014699459076e-02</internalNodes>
+          <leafValues>
+            3.6089360713958740e-01 -1.1495783179998398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 1.7244052141904831e-03</internalNodes>
+          <leafValues>
+            -1.5974776446819305e-01 1.6197346150875092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -3.6334272008389235e-03</internalNodes>
+          <leafValues>
+            2.7575418353080750e-01 -9.4314105808734894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -3.4076566807925701e-03</internalNodes>
+          <leafValues>
+            2.2806543111801147e-01 -1.1266379803419113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 8.8951038196682930e-03</internalNodes>
+          <leafValues>
+            -6.6720969974994659e-02 3.3090111613273621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -2.4365000426769257e-03</internalNodes>
+          <leafValues>
+            -4.6264356374740601e-01 5.9559248387813568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 1.6330357640981674e-02</internalNodes>
+          <leafValues>
+            6.1187297105789185e-02 -4.2252638936042786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 8.4438512567430735e-04</internalNodes>
+          <leafValues>
+            -1.6640183329582214e-01 1.1608948558568954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 2.9493896290659904e-03</internalNodes>
+          <leafValues>
+            -9.1952294111251831e-02 2.0670032501220703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 3.4696407616138458e-02</internalNodes>
+          <leafValues>
+            -8.0334044992923737e-02 2.8779104351997375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -3.3343117684125900e-03</internalNodes>
+          <leafValues>
+            -5.9474521875381470e-01 3.6547001451253891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 9.3975086929276586e-04</internalNodes>
+          <leafValues>
+            -1.5703736245632172e-01 1.1884722858667374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 -3.4337402321398258e-03</internalNodes>
+          <leafValues>
+            -5.6122291088104248e-01 3.2535579055547714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 2.6463428512215614e-03</internalNodes>
+          <leafValues>
+            -7.0756055414676666e-02 2.5195503234863281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 -5.4167490452528000e-04</internalNodes>
+          <leafValues>
+            1.2782673537731171e-01 -1.3642209768295288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 2.6469756849110126e-03</internalNodes>
+          <leafValues>
+            4.3448049575090408e-02 -4.2012536525726318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -3.8945327978581190e-03</internalNodes>
+          <leafValues>
+            -3.4613665938377380e-01 4.6863511204719543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 1.0849055834114552e-03</internalNodes>
+          <leafValues>
+            -7.2841711342334747e-02 2.2674085199832916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -9.8655023612082005e-04</internalNodes>
+          <leafValues>
+            2.5967630743980408e-01 -8.0196425318717957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 4.3801497668027878e-03</internalNodes>
+          <leafValues>
+            2.8548270463943481e-02 -6.2486541271209717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 3.1944573856890202e-04</internalNodes>
+          <leafValues>
+            -1.4062304794788361e-01 1.1761485785245895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 6.6440929658710957e-03</internalNodes>
+          <leafValues>
+            3.2654736191034317e-02 -4.6211913228034973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 7.0357543881982565e-04</internalNodes>
+          <leafValues>
+            7.5751155614852905e-02 -1.9804775714874268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 5.4024737328290939e-03</internalNodes>
+          <leafValues>
+            -6.1951220035552979e-02 2.4502439796924591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 7.2796619497239590e-03</internalNodes>
+          <leafValues>
+            -5.9379905462265015e-02 2.5588110089302063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 -1.5059831552207470e-02</internalNodes>
+          <leafValues>
+            -6.6548824310302734e-01 2.2492453455924988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -4.6248016878962517e-03</internalNodes>
+          <leafValues>
+            -3.4483894705772400e-01 4.2247168719768524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 1.4736279845237732e-03</internalNodes>
+          <leafValues>
+            3.3624436706304550e-02 -4.1066497564315796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 4.0667224675416946e-03</internalNodes>
+          <leafValues>
+            -8.6238399147987366e-02 1.6550070047378540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -1.2728295987471938e-03</internalNodes>
+          <leafValues>
+            1.9737298786640167e-01 -9.5425128936767578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 -1.5297440811991692e-02</internalNodes>
+          <leafValues>
+            -5.9287589788436890e-01 2.3890895769000053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -2.9415758326649666e-03</internalNodes>
+          <leafValues>
+            -4.8744291067123413e-01 2.8945079073309898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 9.3173712957650423e-04</internalNodes>
+          <leafValues>
+            -8.9065223932266235e-02 1.6721877455711365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 2.1161064505577087e-03</internalNodes>
+          <leafValues>
+            -5.8501452207565308e-02 2.7767315506935120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -3.7564497906714678e-03</internalNodes>
+          <leafValues>
+            2.6502594351768494e-01 -5.3400754928588867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 1.9215289503335953e-02</internalNodes>
+          <leafValues>
+            3.6197379231452942e-02 -3.9996260404586792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -5.8480387087911367e-04</internalNodes>
+          <leafValues>
+            1.7670612037181854e-01 -8.0434471368789673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 1.7193648964166641e-02</internalNodes>
+          <leafValues>
+            2.1810308098793030e-02 -6.6349571943283081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -1.5182361006736755e-02</internalNodes>
+          <leafValues>
+            2.4825552105903625e-01 -6.3092373311519623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 3.0793007463216782e-03</internalNodes>
+          <leafValues>
+            2.4977168068289757e-02 -5.3303867578506470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 -2.4421955458819866e-03</internalNodes>
+          <leafValues>
+            -3.6828973889350891e-01 3.3543743193149567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 7.0760864764451981e-04</internalNodes>
+          <leafValues>
+            -7.0839107036590576e-02 1.9299270212650299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -2.9198618140071630e-03</internalNodes>
+          <leafValues>
+            -4.2773759365081787e-01 3.4788779914379120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 4.9937088042497635e-03</internalNodes>
+          <leafValues>
+            3.5642433911561966e-02 -3.7421676516532898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 3.1980490311980247e-03</internalNodes>
+          <leafValues>
+            -6.5103210508823395e-02 2.1381905674934387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 -1.1253832839429379e-02</internalNodes>
+          <leafValues>
+            1.9790579378604889e-01 -7.1859836578369141e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -3.6279223859310150e-02</internalNodes>
+          <leafValues>
+            1.7960831522941589e-01 -9.7373597323894501e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 2.5160997174680233e-03</internalNodes>
+          <leafValues>
+            4.7910790890455246e-02 -2.7035105228424072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 1.2429051566869020e-03</internalNodes>
+          <leafValues>
+            -7.8723609447479248e-02 1.7209371924400330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -1.6120750457048416e-02</internalNodes>
+          <leafValues>
+            2.6868200302124023e-01 -5.0688084214925766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 1.9487962126731873e-03</internalNodes>
+          <leafValues>
+            4.2773328721523285e-02 -3.2401460409164429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 7.1887858211994171e-04</internalNodes>
+          <leafValues>
+            -9.3979224562644958e-02 1.4450067281723022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 2.4896476417779922e-02</internalNodes>
+          <leafValues>
+            3.0655095353722572e-02 -4.5330229401588440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 -3.9382722228765488e-02</internalNodes>
+          <leafValues>
+            -7.5473642349243164e-01 1.4460344798862934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 1.6916246712207794e-01</internalNodes>
+          <leafValues>
+            1.8219815567135811e-02 -6.0212779045104980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 2.6912155590252951e-05</internalNodes>
+          <leafValues>
+            -1.3110430538654327e-01 1.0080647468566895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 -1.1350987479090691e-03</internalNodes>
+          <leafValues>
+            -3.5285457968711853e-01 3.5424951463937759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -5.3854554425925016e-04</internalNodes>
+          <leafValues>
+            1.6519539058208466e-01 -8.5205554962158203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 -7.9703063238412142e-04</internalNodes>
+          <leafValues>
+            1.2170238047838211e-01 -1.1191177368164062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 6.4357938244938850e-03</internalNodes>
+          <leafValues>
+            2.3892326280474663e-02 -5.2907115221023560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 3.5384115763008595e-03</internalNodes>
+          <leafValues>
+            1.5895446762442589e-02 -7.3063355684280396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -5.9715351089835167e-03</internalNodes>
+          <leafValues>
+            -4.9897637963294983e-01 2.2720154374837875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -1.3486531376838684e-01</internalNodes>
+          <leafValues>
+            4.7622504830360413e-01 -3.0212458223104477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 1.5813487116247416e-03</internalNodes>
+          <leafValues>
+            -6.4366899430751801e-02 1.9106543064117432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 1.2239011703059077e-03</internalNodes>
+          <leafValues>
+            3.5654775798320770e-02 -3.6865225434303284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 1.5586249064654112e-03</internalNodes>
+          <leafValues>
+            -7.6894849538803101e-02 1.7627324163913727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 8.1224087625741959e-03</internalNodes>
+          <leafValues>
+            -9.0349502861499786e-02 1.4695085585117340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 -1.1717316228896379e-03</internalNodes>
+          <leafValues>
+            -4.2172068357467651e-01 3.2626960426568985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 3.1573872547596693e-03</internalNodes>
+          <leafValues>
+            1.6080003231763840e-02 -7.3708915710449219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 -6.0417165514081717e-04</internalNodes>
+          <leafValues>
+            1.3188406825065613e-01 -1.0221557319164276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 5.9989960864186287e-03</internalNodes>
+          <leafValues>
+            -5.6194521486759186e-02 2.4262723326683044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 9.2063043266534805e-03</internalNodes>
+          <leafValues>
+            -7.4052155017852783e-02 1.9847218692302704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 5.9181386604905128e-03</internalNodes>
+          <leafValues>
+            2.7928760275244713e-02 -5.3380137681961060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 2.2121241781860590e-03</internalNodes>
+          <leafValues>
+            -7.4788182973861694e-02 1.9799898564815521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 1.5453733503818512e-03</internalNodes>
+          <leafValues>
+            -8.1615962088108063e-02 1.7845135927200317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -2.7309993747621775e-03</internalNodes>
+          <leafValues>
+            -2.9415401816368103e-01 4.8099983483552933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 1.5755122527480125e-02</internalNodes>
+          <leafValues>
+            -8.2719191908836365e-02 1.5387716889381409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 -5.5120363831520081e-02</internalNodes>
+          <leafValues>
+            -2.7076271176338196e-01 5.2753895521163940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 2.9593750834465027e-01</internalNodes>
+          <leafValues>
+            -2.5313137099146843e-02 5.3404790163040161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 -1.1218986473977566e-03</internalNodes>
+          <leafValues>
+            1.1400944739580154e-01 -1.1270149052143097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -3.7802509963512421e-02</internalNodes>
+          <leafValues>
+            3.1571185588836670e-01 -4.9672659486532211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 7.6384171843528748e-03</internalNodes>
+          <leafValues>
+            -1.0544487833976746e-01 1.6579298675060272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 6.8679507821798325e-03</internalNodes>
+          <leafValues>
+            -6.0160953551530838e-02 2.2640766203403473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 5.1510091871023178e-02</internalNodes>
+          <leafValues>
+            2.6919802650809288e-02 -5.1188707351684570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 -1.7317479476332664e-02</internalNodes>
+          <leafValues>
+            2.8218811750411987e-01 -4.4739942997694016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 8.3876429125666618e-03</internalNodes>
+          <leafValues>
+            -5.7016383856534958e-02 2.2617760300636292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 9.2909142374992371e-02</internalNodes>
+          <leafValues>
+            3.1283479183912277e-02 -4.9390810728073120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 4.8232711851596832e-03</internalNodes>
+          <leafValues>
+            2.4896934628486633e-02 -4.5571261644363403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 2.3969253525137901e-03</internalNodes>
+          <leafValues>
+            2.3365976288914680e-02 -4.8319596052169800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 -3.8546645082533360e-03</internalNodes>
+          <leafValues>
+            2.0274488627910614e-01 -5.8264043182134628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -1.2048919452354312e-03</internalNodes>
+          <leafValues>
+            -3.4361392259597778e-01 3.4746967256069183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 -1.6053356230258942e-02</internalNodes>
+          <leafValues>
+            1.8685258924961090e-01 -6.7979305982589722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 -2.1703056991100311e-02</internalNodes>
+          <leafValues>
+            -5.0804340839385986e-01 2.5113353505730629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -1.9719875417649746e-03</internalNodes>
+          <leafValues>
+            -2.7325069904327393e-01 4.3638698756694794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.3189280871301889e-03</internalNodes>
+          <leafValues>
+            2.5198838114738464e-01 -4.8170279711484909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 1.3257672544568777e-03</internalNodes>
+          <leafValues>
+            -6.6290155053138733e-02 2.6572498679161072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 -2.5993511080741882e-03</internalNodes>
+          <leafValues>
+            -7.1209841966629028e-01 1.9255550578236580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 4.0416182018816471e-03</internalNodes>
+          <leafValues>
+            2.4820772930979729e-02 -4.3810126185417175e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          0 0 2 4 -1.</_>
+        <_>
+          0 2 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 14 -1.</_>
+        <_>
+          0 0 3 7 2.</_>
+        <_>
+          3 7 3 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 1 -1.</_>
+        <_>
+          4 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 2 -1.</_>
+        <_>
+          4 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 6 -1.</_>
+        <_>
+          0 0 4 3 2.</_>
+        <_>
+          4 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 14 -1.</_>
+        <_>
+          0 0 4 7 2.</_>
+        <_>
+          4 7 4 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 8 -1.</_>
+        <_>
+          0 0 5 4 2.</_>
+        <_>
+          5 4 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 13 -1.</_>
+        <_>
+          6 0 6 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 10 -1.</_>
+        <_>
+          0 0 7 5 2.</_>
+        <_>
+          7 5 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 1 -1.</_>
+        <_>
+          8 0 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 6 -1.</_>
+        <_>
+          0 0 8 3 2.</_>
+        <_>
+          8 3 8 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 10 -1.</_>
+        <_>
+          0 0 8 5 2.</_>
+        <_>
+          8 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 1 -1.</_>
+        <_>
+          12 0 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 2 -1.</_>
+        <_>
+          0 0 12 1 2.</_>
+        <_>
+          12 1 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 12 -1.</_>
+        <_>
+          0 6 12 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 18 -1.</_>
+        <_>
+          0 6 15 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 6 -1.</_>
+        <_>
+          0 3 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 6 -1.</_>
+        <_>
+          2 1 2 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 1 -1.</_>
+        <_>
+          5 1 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 2 -1.</_>
+        <_>
+          5 1 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 2 -1.</_>
+        <_>
+          0 2 12 1 2.</_>
+        <_>
+          12 3 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 10 -1.</_>
+        <_>
+          0 2 12 5 2.</_>
+        <_>
+          12 7 12 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 3 -1.</_>
+        <_>
+          0 4 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 2 -1.</_>
+        <_>
+          0 3 12 1 2.</_>
+        <_>
+          12 4 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 12 -1.</_>
+        <_>
+          0 8 6 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 24 6 -1.</_>
+        <_>
+          0 6 24 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 9 -1.</_>
+        <_>
+          0 8 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 2 -1.</_>
+        <_>
+          0 5 12 1 2.</_>
+        <_>
+          12 6 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 3 -1.</_>
+        <_>
+          0 7 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 2 -1.</_>
+        <_>
+          0 6 12 1 2.</_>
+        <_>
+          12 7 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 22 3 -1.</_>
+        <_>
+          0 7 22 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 9 -1.</_>
+        <_>
+          0 9 24 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 1 -1.</_>
+        <_>
+          8 7 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 3 -1.</_>
+        <_>
+          8 7 8 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 2 -1.</_>
+        <_>
+          0 7 12 1 2.</_>
+        <_>
+          12 8 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 6 -1.</_>
+        <_>
+          2 8 2 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 15 -1.</_>
+        <_>
+          3 8 3 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 9 -1.</_>
+        <_>
+          0 11 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 24 1 -1.</_>
+        <_>
+          8 8 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 24 4 -1.</_>
+        <_>
+          0 8 12 2 2.</_>
+        <_>
+          12 10 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 3 -1.</_>
+        <_>
+          0 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 9 -1.</_>
+        <_>
+          0 12 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 3 -1.</_>
+        <_>
+          0 10 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 6 -1.</_>
+        <_>
+          0 11 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 2 -1.</_>
+        <_>
+          0 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 2 -1.</_>
+        <_>
+          0 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 2 -1.</_>
+        <_>
+          0 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 22 2 -1.</_>
+        <_>
+          0 9 11 1 2.</_>
+        <_>
+          11 10 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 4 -1.</_>
+        <_>
+          0 9 12 2 2.</_>
+        <_>
+          12 11 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 15 -1.</_>
+        <_>
+          12 9 12 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 15 3 -1.</_>
+        <_>
+          0 10 15 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 3 -1.</_>
+        <_>
+          0 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 1 -1.</_>
+        <_>
+          3 10 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 14 -1.</_>
+        <_>
+          3 10 3 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 3 -1.</_>
+        <_>
+          0 11 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 2 -1.</_>
+        <_>
+          0 10 12 1 2.</_>
+        <_>
+          12 11 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 4 -1.</_>
+        <_>
+          0 10 12 2 2.</_>
+        <_>
+          12 12 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 13 3 -1.</_>
+        <_>
+          0 11 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 3 -1.</_>
+        <_>
+          0 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          0 11 3 4 2.</_>
+        <_>
+          3 15 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 10 3 -1.</_>
+        <_>
+          0 12 10 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 2 -1.</_>
+        <_>
+          0 11 12 1 2.</_>
+        <_>
+          12 12 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 3 10 -1.</_>
+        <_>
+          1 12 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 22 10 -1.</_>
+        <_>
+          11 12 11 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 3 9 -1.</_>
+        <_>
+          1 13 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 12 10 -1.</_>
+        <_>
+          6 13 6 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 10 -1.</_>
+        <_>
+          12 13 12 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 2 -1.</_>
+        <_>
+          0 14 12 1 2.</_>
+        <_>
+          12 15 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 3 8 -1.</_>
+        <_>
+          1 15 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 12 8 -1.</_>
+        <_>
+          0 15 6 4 2.</_>
+        <_>
+          6 19 6 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 6 -1.</_>
+        <_>
+          0 17 10 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 8 -1.</_>
+        <_>
+          0 16 6 4 2.</_>
+        <_>
+          6 20 6 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 3 7 -1.</_>
+        <_>
+          1 17 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 6 3 -1.</_>
+        <_>
+          0 19 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 19 6 3 -1.</_>
+        <_>
+          0 20 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 20 6 3 -1.</_>
+        <_>
+          0 21 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 21 4 3 -1.</_>
+        <_>
+          0 22 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 21 5 3 -1.</_>
+        <_>
+          0 22 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 22 22 2 -1.</_>
+        <_>
+          11 22 11 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 1 -1.</_>
+        <_>
+          4 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 13 -1.</_>
+        <_>
+          6 0 5 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 6 -1.</_>
+        <_>
+          1 0 6 3 2.</_>
+        <_>
+          7 3 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 2 -1.</_>
+        <_>
+          1 1 11 1 2.</_>
+        <_>
+          12 2 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 2 23 9 -1.</_>
+        <_>
+          1 5 23 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 3 -1.</_>
+        <_>
+          1 4 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 18 -1.</_>
+        <_>
+          5 3 4 18 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 3 -1.</_>
+        <_>
+          1 5 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 4 23 6 -1.</_>
+        <_>
+          1 6 23 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 4 -1.</_>
+        <_>
+          1 6 3 2 2.</_>
+        <_>
+          4 8 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 3 9 -1.</_>
+        <_>
+          1 9 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 3 -1.</_>
+        <_>
+          1 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 22 2 -1.</_>
+        <_>
+          1 6 11 1 2.</_>
+        <_>
+          12 7 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 8 -1.</_>
+        <_>
+          1 10 12 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 4 -1.</_>
+        <_>
+          1 7 4 2 2.</_>
+        <_>
+          5 9 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 20 4 -1.</_>
+        <_>
+          1 7 10 2 2.</_>
+        <_>
+          11 9 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 22 6 -1.</_>
+        <_>
+          1 7 11 3 2.</_>
+        <_>
+          12 10 11 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 22 14 -1.</_>
+        <_>
+          12 7 11 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 1 2 -1.</_>
+        <_>
+          1 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 2 -1.</_>
+        <_>
+          1 8 4 1 2.</_>
+        <_>
+          5 9 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 7 4 -1.</_>
+        <_>
+          1 10 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 22 4 -1.</_>
+        <_>
+          1 8 11 2 2.</_>
+        <_>
+          12 10 11 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 3 -1.</_>
+        <_>
+          3 9 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 6 -1.</_>
+        <_>
+          1 11 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 20 2 -1.</_>
+        <_>
+          1 9 10 1 2.</_>
+        <_>
+          11 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 13 -1.</_>
+        <_>
+          2 10 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 6 -1.</_>
+        <_>
+          1 12 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 3 -1.</_>
+        <_>
+          1 11 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 20 2 -1.</_>
+        <_>
+          1 10 10 1 2.</_>
+        <_>
+          11 11 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 2 -1.</_>
+        <_>
+          4 11 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 22 2 -1.</_>
+        <_>
+          1 11 11 1 2.</_>
+        <_>
+          12 12 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 12 3 8 -1.</_>
+        <_>
+          2 12 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 1 -1.</_>
+        <_>
+          3 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 2 -1.</_>
+        <_>
+          1 12 10 1 2.</_>
+        <_>
+          11 13 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 3 8 -1.</_>
+        <_>
+          2 13 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 9 3 -1.</_>
+        <_>
+          1 14 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 21 8 -1.</_>
+        <_>
+          1 17 21 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 15 8 2 -1.</_>
+        <_>
+          5 15 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 22 2 -1.</_>
+        <_>
+          1 17 11 1 2.</_>
+        <_>
+          12 18 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 18 3 6 -1.</_>
+        <_>
+          2 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 1 -1.</_>
+        <_>
+          5 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 6 -1.</_>
+        <_>
+          2 0 4 3 2.</_>
+        <_>
+          6 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 5 -1.</_>
+        <_>
+          8 0 6 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 2 -1.</_>
+        <_>
+          2 3 10 1 2.</_>
+        <_>
+          12 4 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 3 3 -1.</_>
+        <_>
+          2 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 20 2 -1.</_>
+        <_>
+          2 4 10 1 2.</_>
+        <_>
+          12 5 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 2 3 -1.</_>
+        <_>
+          2 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 20 2 -1.</_>
+        <_>
+          2 5 10 1 2.</_>
+        <_>
+          12 6 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 22 2 -1.</_>
+        <_>
+          2 6 11 1 2.</_>
+        <_>
+          13 7 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 22 4 -1.</_>
+        <_>
+          2 6 11 2 2.</_>
+        <_>
+          13 8 11 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 15 3 -1.</_>
+        <_>
+          2 8 15 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 3 -1.</_>
+        <_>
+          2 9 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 20 4 -1.</_>
+        <_>
+          2 8 10 2 2.</_>
+        <_>
+          12 10 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 20 8 -1.</_>
+        <_>
+          2 9 10 4 2.</_>
+        <_>
+          12 13 10 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 22 2 -1.</_>
+        <_>
+          2 9 11 1 2.</_>
+        <_>
+          13 10 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 19 3 -1.</_>
+        <_>
+          2 10 19 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 1 -1.</_>
+        <_>
+          4 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 22 2 -1.</_>
+        <_>
+          2 10 11 1 2.</_>
+        <_>
+          13 11 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 22 14 -1.</_>
+        <_>
+          13 10 11 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 20 12 -1.</_>
+        <_>
+          2 16 20 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 3 5 -1.</_>
+        <_>
+          3 11 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 20 2 -1.</_>
+        <_>
+          2 11 10 1 2.</_>
+        <_>
+          12 12 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 22 2 -1.</_>
+        <_>
+          2 11 11 1 2.</_>
+        <_>
+          13 12 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 3 5 -1.</_>
+        <_>
+          3 12 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 3 9 -1.</_>
+        <_>
+          3 12 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 3 11 -1.</_>
+        <_>
+          3 12 1 11 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 3 3 -1.</_>
+        <_>
+          3 14 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 8 8 -1.</_>
+        <_>
+          2 14 4 4 2.</_>
+        <_>
+          6 18 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 3 5 -1.</_>
+        <_>
+          3 17 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 3 6 -1.</_>
+        <_>
+          3 17 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 21 4 -1.</_>
+        <_>
+          9 17 7 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 18 3 5 -1.</_>
+        <_>
+          3 18 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 18 10 4 -1.</_>
+        <_>
+          7 18 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 20 6 2 -1.</_>
+        <_>
+          5 20 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 21 12 2 -1.</_>
+        <_>
+          8 21 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 5 -1.</_>
+        <_>
+          4 0 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 22 -1.</_>
+        <_>
+          6 0 3 22 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 4 -1.</_>
+        <_>
+          3 0 6 2 2.</_>
+        <_>
+          9 2 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 3 -1.</_>
+        <_>
+          4 1 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 20 -1.</_>
+        <_>
+          4 1 1 20 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 20 -1.</_>
+        <_>
+          5 1 2 20 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 3 -1.</_>
+        <_>
+          4 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 3 -1.</_>
+        <_>
+          4 3 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 9 -1.</_>
+        <_>
+          3 6 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 20 19 -1.</_>
+        <_>
+          13 3 10 19 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 19 4 -1.</_>
+        <_>
+          3 5 19 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 1 3 -1.</_>
+        <_>
+          3 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 3 -1.</_>
+        <_>
+          5 4 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 18 2 -1.</_>
+        <_>
+          3 4 9 1 2.</_>
+        <_>
+          12 5 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 6 -1.</_>
+        <_>
+          3 6 16 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 1 -1.</_>
+        <_>
+          4 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 2 -1.</_>
+        <_>
+          4 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 2 3 -1.</_>
+        <_>
+          3 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 3 -1.</_>
+        <_>
+          8 5 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 3 -1.</_>
+        <_>
+          9 5 6 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 2 -1.</_>
+        <_>
+          3 5 9 1 2.</_>
+        <_>
+          12 6 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 1 -1.</_>
+        <_>
+          4 6 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 1 3 -1.</_>
+        <_>
+          3 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 3 -1.</_>
+        <_>
+          3 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 6 -1.</_>
+        <_>
+          3 8 6 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 2 -1.</_>
+        <_>
+          3 6 9 1 2.</_>
+        <_>
+          12 7 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 17 6 -1.</_>
+        <_>
+          3 8 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 1 -1.</_>
+        <_>
+          4 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 4 2 -1.</_>
+        <_>
+          3 8 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 6 -1.</_>
+        <_>
+          3 9 6 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 4 -1.</_>
+        <_>
+          3 7 9 2 2.</_>
+        <_>
+          12 9 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 20 11 -1.</_>
+        <_>
+          13 7 10 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 17 6 -1.</_>
+        <_>
+          3 9 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 1 -1.</_>
+        <_>
+          4 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 2 -1.</_>
+        <_>
+          4 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 9 2 -1.</_>
+        <_>
+          6 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 2 -1.</_>
+        <_>
+          3 9 9 1 2.</_>
+        <_>
+          12 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 1 -1.</_>
+        <_>
+          4 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 13 -1.</_>
+        <_>
+          4 10 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 2 -1.</_>
+        <_>
+          3 11 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 2 -1.</_>
+        <_>
+          4 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 3 -1.</_>
+        <_>
+          4 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 5 -1.</_>
+        <_>
+          4 11 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 13 -1.</_>
+        <_>
+          4 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 2 -1.</_>
+        <_>
+          3 11 3 1 2.</_>
+        <_>
+          6 12 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 4 -1.</_>
+        <_>
+          3 13 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 8 -1.</_>
+        <_>
+          3 15 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 3 -1.</_>
+        <_>
+          4 12 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 6 -1.</_>
+        <_>
+          3 15 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 9 7 -1.</_>
+        <_>
+          6 12 3 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 8 -1.</_>
+        <_>
+          3 16 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 8 -1.</_>
+        <_>
+          3 16 8 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 19 6 -1.</_>
+        <_>
+          3 15 19 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 18 2 -1.</_>
+        <_>
+          3 13 9 1 2.</_>
+        <_>
+          12 14 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 2 -1.</_>
+        <_>
+          5 15 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 3 -1.</_>
+        <_>
+          5 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 2 -1.</_>
+        <_>
+          6 15 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 8 8 -1.</_>
+        <_>
+          3 16 4 4 2.</_>
+        <_>
+          7 20 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 20 3 4 -1.</_>
+        <_>
+          4 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 8 -1.</_>
+        <_>
+          5 1 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 12 -1.</_>
+        <_>
+          4 5 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 1 15 10 -1.</_>
+        <_>
+          4 6 15 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 3 -1.</_>
+        <_>
+          5 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 5 -1.</_>
+        <_>
+          6 2 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 2 -1.</_>
+        <_>
+          4 2 8 1 2.</_>
+        <_>
+          12 3 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 2 -1.</_>
+        <_>
+          5 3 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 1 -1.</_>
+        <_>
+          6 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 5 -1.</_>
+        <_>
+          6 3 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 3 -1.</_>
+        <_>
+          7 3 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 2 -1.</_>
+        <_>
+          4 3 8 1 2.</_>
+        <_>
+          12 4 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 8 -1.</_>
+        <_>
+          4 3 8 4 2.</_>
+        <_>
+          12 7 8 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 17 8 -1.</_>
+        <_>
+          4 7 17 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 1 4 -1.</_>
+        <_>
+          4 6 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 2 -1.</_>
+        <_>
+          4 4 8 1 2.</_>
+        <_>
+          12 5 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 10 -1.</_>
+        <_>
+          4 4 8 5 2.</_>
+        <_>
+          12 9 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 20 6 -1.</_>
+        <_>
+          4 6 20 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 2 -1.</_>
+        <_>
+          4 5 8 1 2.</_>
+        <_>
+          12 6 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 9 -1.</_>
+        <_>
+          4 8 16 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 2 -1.</_>
+        <_>
+          4 6 1 1 2.</_>
+        <_>
+          5 7 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 2 -1.</_>
+        <_>
+          4 7 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 1 -1.</_>
+        <_>
+          6 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 3 -1.</_>
+        <_>
+          4 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 3 -1.</_>
+        <_>
+          4 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 2 -1.</_>
+        <_>
+          4 6 8 1 2.</_>
+        <_>
+          12 7 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 6 -1.</_>
+        <_>
+          4 8 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 3 -1.</_>
+        <_>
+          4 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 3 -1.</_>
+        <_>
+          6 7 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 3 -1.</_>
+        <_>
+          4 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 3 -1.</_>
+        <_>
+          4 8 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 6 -1.</_>
+        <_>
+          4 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 7 3 -1.</_>
+        <_>
+          4 8 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 18 2 -1.</_>
+        <_>
+          4 7 9 1 2.</_>
+        <_>
+          13 8 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 18 4 -1.</_>
+        <_>
+          4 7 9 2 2.</_>
+        <_>
+          13 9 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 3 -1.</_>
+        <_>
+          4 8 16 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 6 -1.</_>
+        <_>
+          4 9 16 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 17 2 -1.</_>
+        <_>
+          4 8 17 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 17 3 -1.</_>
+        <_>
+          4 8 17 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 17 6 -1.</_>
+        <_>
+          4 9 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 2 -1.</_>
+        <_>
+          4 8 1 1 2.</_>
+        <_>
+          5 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 2 -1.</_>
+        <_>
+          4 8 8 1 2.</_>
+        <_>
+          12 9 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 18 4 -1.</_>
+        <_>
+          4 8 9 2 2.</_>
+        <_>
+          13 10 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 1 -1.</_>
+        <_>
+          5 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 1 -1.</_>
+        <_>
+          5 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          4 9 1 1 2.</_>
+        <_>
+          5 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          5 9 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 1 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 9 -1.</_>
+        <_>
+          4 12 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 1 -1.</_>
+        <_>
+          9 9 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 5 3 -1.</_>
+        <_>
+          4 10 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 2 -1.</_>
+        <_>
+          9 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 3 -1.</_>
+        <_>
+          9 9 5 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 2 -1.</_>
+        <_>
+          4 9 8 1 2.</_>
+        <_>
+          12 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 6 -1.</_>
+        <_>
+          4 9 8 3 2.</_>
+        <_>
+          12 12 8 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 18 2 -1.</_>
+        <_>
+          4 9 9 1 2.</_>
+        <_>
+          13 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 20 2 -1.</_>
+        <_>
+          4 9 10 1 2.</_>
+        <_>
+          14 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 17 9 -1.</_>
+        <_>
+          4 12 17 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 18 3 -1.</_>
+        <_>
+          4 10 18 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 1 -1.</_>
+        <_>
+          5 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 1 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 2 -1.</_>
+        <_>
+          4 10 1 1 2.</_>
+        <_>
+          5 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 3 -1.</_>
+        <_>
+          7 10 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 18 2 -1.</_>
+        <_>
+          4 10 9 1 2.</_>
+        <_>
+          13 11 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 17 6 -1.</_>
+        <_>
+          4 12 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 2 -1.</_>
+        <_>
+          5 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 3 -1.</_>
+        <_>
+          5 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 8 -1.</_>
+        <_>
+          4 15 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 6 -1.</_>
+        <_>
+          5 11 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 3 -1.</_>
+        <_>
+          6 11 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 15 2 -1.</_>
+        <_>
+          4 12 15 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 1 -1.</_>
+        <_>
+          5 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 4 4 -1.</_>
+        <_>
+          6 12 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 8 -1.</_>
+        <_>
+          4 16 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 17 12 -1.</_>
+        <_>
+          4 16 17 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 1 -1.</_>
+        <_>
+          5 13 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 9 -1.</_>
+        <_>
+          4 16 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 2 -1.</_>
+        <_>
+          6 14 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 2 -1.</_>
+        <_>
+          6 15 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 9 4 -1.</_>
+        <_>
+          7 15 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 16 4 -1.</_>
+        <_>
+          4 15 8 2 2.</_>
+        <_>
+          12 17 8 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 3 5 -1.</_>
+        <_>
+          5 18 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 3 6 -1.</_>
+        <_>
+          5 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 15 5 -1.</_>
+        <_>
+          9 18 5 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 9 6 -1.</_>
+        <_>
+          4 21 9 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 2 -1.</_>
+        <_>
+          5 1 7 1 2.</_>
+        <_>
+          12 2 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 11 8 -1.</_>
+        <_>
+          5 5 11 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 3 -1.</_>
+        <_>
+          6 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 2 -1.</_>
+        <_>
+          7 2 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 2 -1.</_>
+        <_>
+          5 2 7 1 2.</_>
+        <_>
+          12 3 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 8 -1.</_>
+        <_>
+          5 6 14 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 16 10 -1.</_>
+        <_>
+          5 7 16 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 1 -1.</_>
+        <_>
+          7 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 2 -1.</_>
+        <_>
+          7 3 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 10 -1.</_>
+        <_>
+          5 3 2 5 2.</_>
+        <_>
+          7 8 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 12 -1.</_>
+        <_>
+          8 3 3 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 14 2 -1.</_>
+        <_>
+          5 3 7 1 2.</_>
+        <_>
+          12 4 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 15 8 -1.</_>
+        <_>
+          5 7 15 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 4 -1.</_>
+        <_>
+          5 4 1 2 2.</_>
+        <_>
+          6 6 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          7 4 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 12 -1.</_>
+        <_>
+          7 4 2 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 8 -1.</_>
+        <_>
+          9 4 4 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 2 -1.</_>
+        <_>
+          5 4 7 1 2.</_>
+        <_>
+          12 5 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 2 -1.</_>
+        <_>
+          5 5 1 1 2.</_>
+        <_>
+          6 6 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 4 -1.</_>
+        <_>
+          5 5 1 2 2.</_>
+        <_>
+          6 7 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 6 -1.</_>
+        <_>
+          5 7 6 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 2 -1.</_>
+        <_>
+          5 5 7 1 2.</_>
+        <_>
+          12 6 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 16 2 -1.</_>
+        <_>
+          5 5 8 1 2.</_>
+        <_>
+          13 6 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 6 -1.</_>
+        <_>
+          5 7 13 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 6 -1.</_>
+        <_>
+          5 7 14 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 6 -1.</_>
+        <_>
+          5 7 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 9 -1.</_>
+        <_>
+          5 8 15 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 4 -1.</_>
+        <_>
+          5 6 1 2 2.</_>
+        <_>
+          6 8 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 1 -1.</_>
+        <_>
+          7 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 3 -1.</_>
+        <_>
+          5 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 2 -1.</_>
+        <_>
+          5 6 7 1 2.</_>
+        <_>
+          12 7 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          6 7 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 6 -1.</_>
+        <_>
+          5 7 1 3 2.</_>
+        <_>
+          6 10 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 1 -1.</_>
+        <_>
+          7 7 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 5 -1.</_>
+        <_>
+          7 7 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          5 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 3 -1.</_>
+        <_>
+          5 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 6 -1.</_>
+        <_>
+          5 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 3 -1.</_>
+        <_>
+          5 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          5 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 5 6 -1.</_>
+        <_>
+          5 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 4 -1.</_>
+        <_>
+          5 7 7 2 2.</_>
+        <_>
+          12 9 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 2 -1.</_>
+        <_>
+          5 8 14 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 4 -1.</_>
+        <_>
+          5 9 14 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 2 -1.</_>
+        <_>
+          5 8 15 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 6 -1.</_>
+        <_>
+          5 9 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 1 3 -1.</_>
+        <_>
+          5 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 2 -1.</_>
+        <_>
+          5 8 1 1 2.</_>
+        <_>
+          6 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 5 -1.</_>
+        <_>
+          7 8 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 4 -1.</_>
+        <_>
+          9 8 4 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 3 -1.</_>
+        <_>
+          10 8 5 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 4 -1.</_>
+        <_>
+          5 8 7 2 2.</_>
+        <_>
+          12 10 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 4 -1.</_>
+        <_>
+          7 9 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 3 -1.</_>
+        <_>
+          5 10 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 8 -1.</_>
+        <_>
+          5 9 4 4 2.</_>
+        <_>
+          9 13 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 15 2 -1.</_>
+        <_>
+          10 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 2 -1.</_>
+        <_>
+          5 9 7 1 2.</_>
+        <_>
+          12 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 12 -1.</_>
+        <_>
+          5 9 7 6 2.</_>
+        <_>
+          12 15 7 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 18 2 -1.</_>
+        <_>
+          5 9 9 1 2.</_>
+        <_>
+          14 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 3 -1.</_>
+        <_>
+          5 10 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 15 6 -1.</_>
+        <_>
+          5 12 15 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          5 10 1 1 2.</_>
+        <_>
+          6 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 3 -1.</_>
+        <_>
+          6 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          6 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          6 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 13 -1.</_>
+        <_>
+          6 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 14 2 -1.</_>
+        <_>
+          5 12 14 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 1 6 -1.</_>
+        <_>
+          5 15 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 15 8 -1.</_>
+        <_>
+          5 17 15 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 3 -1.</_>
+        <_>
+          5 15 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 2 -1.</_>
+        <_>
+          6 15 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 19 3 5 -1.</_>
+        <_>
+          6 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 21 3 3 -1.</_>
+        <_>
+          6 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 1 6 -1.</_>
+        <_>
+          6 3 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 11 10 -1.</_>
+        <_>
+          6 5 11 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 12 -1.</_>
+        <_>
+          8 1 2 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 6 -1.</_>
+        <_>
+          7 2 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 2 -1.</_>
+        <_>
+          8 2 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 10 -1.</_>
+        <_>
+          8 2 2 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 4 -1.</_>
+        <_>
+          6 4 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 4 -1.</_>
+        <_>
+          8 3 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 1 -1.</_>
+        <_>
+          9 3 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 3 -1.</_>
+        <_>
+          7 4 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 4 -1.</_>
+        <_>
+          8 4 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 2 -1.</_>
+        <_>
+          7 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 3 -1.</_>
+        <_>
+          7 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 9 -1.</_>
+        <_>
+          6 8 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 2 -1.</_>
+        <_>
+          6 5 6 1 2.</_>
+        <_>
+          12 6 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 1 -1.</_>
+        <_>
+          8 6 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 2 -1.</_>
+        <_>
+          6 6 6 1 2.</_>
+        <_>
+          12 7 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 1 6 -1.</_>
+        <_>
+          6 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 8 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          6 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 6 -1.</_>
+        <_>
+          6 9 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 6 -1.</_>
+        <_>
+          6 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 2 -1.</_>
+        <_>
+          6 7 6 1 2.</_>
+        <_>
+          12 8 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 12 -1.</_>
+        <_>
+          6 13 8 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 15 -1.</_>
+        <_>
+          6 12 12 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 6 -1.</_>
+        <_>
+          6 11 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 2 -1.</_>
+        <_>
+          6 9 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 3 -1.</_>
+        <_>
+          10 8 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 2 -1.</_>
+        <_>
+          6 8 6 1 2.</_>
+        <_>
+          12 9 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 2 -1.</_>
+        <_>
+          6 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 3 -1.</_>
+        <_>
+          6 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 1 -1.</_>
+        <_>
+          9 9 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 3 -1.</_>
+        <_>
+          6 10 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 2 -1.</_>
+        <_>
+          6 9 6 1 2.</_>
+        <_>
+          12 10 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 13 12 -1.</_>
+        <_>
+          6 13 13 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 1 3 -1.</_>
+        <_>
+          6 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 2 -1.</_>
+        <_>
+          7 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 3 -1.</_>
+        <_>
+          7 10 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 14 -1.</_>
+        <_>
+          7 10 1 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 3 -1.</_>
+        <_>
+          6 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 3 -1.</_>
+        <_>
+          8 10 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 3 -1.</_>
+        <_>
+          6 11 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 5 -1.</_>
+        <_>
+          9 10 3 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 1 -1.</_>
+        <_>
+          10 10 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 4 -1.</_>
+        <_>
+          6 10 4 2 2.</_>
+        <_>
+          10 12 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 2 -1.</_>
+        <_>
+          6 10 6 1 2.</_>
+        <_>
+          12 11 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 12 -1.</_>
+        <_>
+          6 10 6 6 2.</_>
+        <_>
+          12 16 6 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 18 1 -1.</_>
+        <_>
+          15 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 13 3 -1.</_>
+        <_>
+          6 11 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 2 -1.</_>
+        <_>
+          6 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 2 -1.</_>
+        <_>
+          6 12 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 3 -1.</_>
+        <_>
+          6 12 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 3 -1.</_>
+        <_>
+          6 12 12 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 3 -1.</_>
+        <_>
+          6 12 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 14 2 -1.</_>
+        <_>
+          6 12 7 1 2.</_>
+        <_>
+          13 13 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 3 -1.</_>
+        <_>
+          6 15 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 2 -1.</_>
+        <_>
+          7 14 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 3 -1.</_>
+        <_>
+          6 16 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 17 10 6 -1.</_>
+        <_>
+          6 20 10 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 18 3 6 -1.</_>
+        <_>
+          7 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 19 3 5 -1.</_>
+        <_>
+          7 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 20 9 4 -1.</_>
+        <_>
+          6 22 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 23 3 1 -1.</_>
+        <_>
+          7 23 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 8 -1.</_>
+        <_>
+          7 0 1 4 2.</_>
+        <_>
+          8 4 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 1 -1.</_>
+        <_>
+          12 0 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 4 -1.</_>
+        <_>
+          7 3 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 1 -1.</_>
+        <_>
+          12 1 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 21 -1.</_>
+        <_>
+          9 2 2 21 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 1 3 -1.</_>
+        <_>
+          7 4 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 5 -1.</_>
+        <_>
+          8 3 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 10 -1.</_>
+        <_>
+          8 4 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 2 -1.</_>
+        <_>
+          8 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 2 -1.</_>
+        <_>
+          8 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 3 -1.</_>
+        <_>
+          8 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          8 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 7 -1.</_>
+        <_>
+          8 5 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 6 -1.</_>
+        <_>
+          7 7 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 11 6 -1.</_>
+        <_>
+          7 7 11 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 1 -1.</_>
+        <_>
+          8 6 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 1 3 -1.</_>
+        <_>
+          7 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 6 -1.</_>
+        <_>
+          9 6 2 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 2 -1.</_>
+        <_>
+          7 6 5 1 2.</_>
+        <_>
+          12 7 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 2 -1.</_>
+        <_>
+          7 6 6 1 2.</_>
+        <_>
+          13 7 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 3 -1.</_>
+        <_>
+          7 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 6 -1.</_>
+        <_>
+          7 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 4 -1.</_>
+        <_>
+          7 9 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 2 -1.</_>
+        <_>
+          7 7 5 1 2.</_>
+        <_>
+          12 8 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 1 3 -1.</_>
+        <_>
+          7 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_>
+        <_>
+          8 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 4 -1.</_>
+        <_>
+          7 8 1 2 2.</_>
+        <_>
+          8 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 2 -1.</_>
+        <_>
+          7 8 5 1 2.</_>
+        <_>
+          12 9 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 2 -1.</_>
+        <_>
+          7 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 3 -1.</_>
+        <_>
+          7 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 3 -1.</_>
+        <_>
+          8 9 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 4 6 -1.</_>
+        <_>
+          7 9 2 3 2.</_>
+        <_>
+          9 12 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          7 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 2 -1.</_>
+        <_>
+          11 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 2 -1.</_>
+        <_>
+          7 9 5 1 2.</_>
+        <_>
+          12 10 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 2 -1.</_>
+        <_>
+          7 9 6 1 2.</_>
+        <_>
+          13 10 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 1 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 1 3 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 3 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 4 -1.</_>
+        <_>
+          9 10 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 10 2 -1.</_>
+        <_>
+          7 10 5 1 2.</_>
+        <_>
+          12 11 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 1 -1.</_>
+        <_>
+          8 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 4 -1.</_>
+        <_>
+          9 11 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 10 8 -1.</_>
+        <_>
+          7 20 10 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 6 -1.</_>
+        <_>
+          8 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 9 6 -1.</_>
+        <_>
+          7 20 9 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 19 3 3 -1.</_>
+        <_>
+          8 19 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 3 4 -1.</_>
+        <_>
+          8 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 7 4 -1.</_>
+        <_>
+          7 22 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 11 4 -1.</_>
+        <_>
+          7 22 11 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 22 3 2 -1.</_>
+        <_>
+          8 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 2 -1.</_>
+        <_>
+          12 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 2 -1.</_>
+        <_>
+          8 1 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 10 -1.</_>
+        <_>
+          8 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 16 10 -1.</_>
+        <_>
+          8 0 8 5 2.</_>
+        <_>
+          16 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 3 -1.</_>
+        <_>
+          8 1 10 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 1 -1.</_>
+        <_>
+          12 1 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 2 -1.</_>
+        <_>
+          9 2 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 20 -1.</_>
+        <_>
+          12 2 4 20 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 8 -1.</_>
+        <_>
+          9 3 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 9 -1.</_>
+        <_>
+          9 3 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 1 -1.</_>
+        <_>
+          11 3 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 3 -1.</_>
+        <_>
+          8 4 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 2 -1.</_>
+        <_>
+          8 3 4 1 2.</_>
+        <_>
+          12 4 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 2 -1.</_>
+        <_>
+          9 4 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 8 -1.</_>
+        <_>
+          9 4 1 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 3 -1.</_>
+        <_>
+          8 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 2 -1.</_>
+        <_>
+          8 4 4 1 2.</_>
+        <_>
+          12 5 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 7 15 -1.</_>
+        <_>
+          8 9 7 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 2 -1.</_>
+        <_>
+          9 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          9 5 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 5 -1.</_>
+        <_>
+          9 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 6 -1.</_>
+        <_>
+          9 5 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 7 -1.</_>
+        <_>
+          9 5 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 3 -1.</_>
+        <_>
+          8 6 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 12 -1.</_>
+        <_>
+          12 5 4 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 19 -1.</_>
+        <_>
+          12 5 4 19 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 5 -1.</_>
+        <_>
+          9 6 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 2 -1.</_>
+        <_>
+          8 6 5 1 2.</_>
+        <_>
+          13 7 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 2 -1.</_>
+        <_>
+          8 8 1 1 2.</_>
+        <_>
+          9 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 1 6 -1.</_>
+        <_>
+          8 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 3 -1.</_>
+        <_>
+          8 9 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 3 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 2 -1.</_>
+        <_>
+          9 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 2 6 -1.</_>
+        <_>
+          8 9 1 3 2.</_>
+        <_>
+          9 12 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 1 -1.</_>
+        <_>
+          9 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 1 -1.</_>
+        <_>
+          9 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 2 -1.</_>
+        <_>
+          8 10 1 1 2.</_>
+        <_>
+          9 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 2 -1.</_>
+        <_>
+          9 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 2 -1.</_>
+        <_>
+          9 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 8 -1.</_>
+        <_>
+          8 10 2 4 2.</_>
+        <_>
+          10 14 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_>
+        <_>
+          12 11 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 2 -1.</_>
+        <_>
+          8 11 1 1 2.</_>
+        <_>
+          9 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 8 -1.</_>
+        <_>
+          8 11 2 4 2.</_>
+        <_>
+          10 15 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 10 -1.</_>
+        <_>
+          8 11 2 5 2.</_>
+        <_>
+          10 16 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 10 -1.</_>
+        <_>
+          8 18 9 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 4 -1.</_>
+        <_>
+          10 15 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 16 9 3 -1.</_>
+        <_>
+          11 16 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 3 5 -1.</_>
+        <_>
+          9 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 20 3 3 -1.</_>
+        <_>
+          9 20 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 1 2 -1.</_>
+        <_>
+          9 1 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 4 -1.</_>
+        <_>
+          10 0 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 1 -1.</_>
+        <_>
+          12 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 4 -1.</_>
+        <_>
+          9 2 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 10 -1.</_>
+        <_>
+          9 5 6 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 14 8 -1.</_>
+        <_>
+          9 0 7 4 2.</_>
+        <_>
+          16 4 7 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 7 10 -1.</_>
+        <_>
+          9 5 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 14 10 -1.</_>
+        <_>
+          9 0 7 5 2.</_>
+        <_>
+          16 5 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 14 12 -1.</_>
+        <_>
+          9 0 7 6 2.</_>
+        <_>
+          16 6 7 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 12 -1.</_>
+        <_>
+          10 1 1 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 15 -1.</_>
+        <_>
+          11 1 2 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 1 -1.</_>
+        <_>
+          12 1 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 2 -1.</_>
+        <_>
+          10 2 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 18 -1.</_>
+        <_>
+          12 2 3 18 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 15 3 -1.</_>
+        <_>
+          9 3 15 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 9 -1.</_>
+        <_>
+          10 3 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 6 -1.</_>
+        <_>
+          9 6 8 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 15 15 -1.</_>
+        <_>
+          9 8 15 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 4 -1.</_>
+        <_>
+          10 4 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 2 -1.</_>
+        <_>
+          9 4 3 1 2.</_>
+        <_>
+          12 5 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 14 5 -1.</_>
+        <_>
+          16 4 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 5 -1.</_>
+        <_>
+          10 5 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 6 -1.</_>
+        <_>
+          10 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 15 -1.</_>
+        <_>
+          11 5 2 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 3 -1.</_>
+        <_>
+          9 6 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 3 -1.</_>
+        <_>
+          9 6 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 4 -1.</_>
+        <_>
+          11 6 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 3 -1.</_>
+        <_>
+          9 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 7 -1.</_>
+        <_>
+          12 6 3 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 3 -1.</_>
+        <_>
+          9 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 15 10 -1.</_>
+        <_>
+          9 11 15 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 2 -1.</_>
+        <_>
+          9 7 3 1 2.</_>
+        <_>
+          12 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 7 10 -1.</_>
+        <_>
+          9 13 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          10 9 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 3 -1.</_>
+        <_>
+          9 10 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 6 -1.</_>
+        <_>
+          12 9 3 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 4 -1.</_>
+        <_>
+          9 10 1 2 2.</_>
+        <_>
+          10 12 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 2 -1.</_>
+        <_>
+          9 10 3 1 2.</_>
+        <_>
+          12 11 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 8 1 -1.</_>
+        <_>
+          13 10 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 15 3 -1.</_>
+        <_>
+          9 11 15 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 4 -1.</_>
+        <_>
+          9 11 1 2 2.</_>
+        <_>
+          10 13 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 6 -1.</_>
+        <_>
+          9 11 1 3 2.</_>
+        <_>
+          10 14 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 11 -1.</_>
+        <_>
+          10 13 1 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 3 -1.</_>
+        <_>
+          11 14 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 4 3 -1.</_>
+        <_>
+          11 16 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 4 -1.</_>
+        <_>
+          11 16 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 8 -1.</_>
+        <_>
+          11 16 2 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 3 -1.</_>
+        <_>
+          9 17 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          11 17 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 7 -1.</_>
+        <_>
+          11 17 2 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 5 3 -1.</_>
+        <_>
+          9 19 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 19 3 5 -1.</_>
+        <_>
+          10 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 19 7 3 -1.</_>
+        <_>
+          9 20 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 4 -1.</_>
+        <_>
+          10 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 2 -1.</_>
+        <_>
+          9 21 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 5 3 -1.</_>
+        <_>
+          9 21 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 6 3 -1.</_>
+        <_>
+          9 21 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 6 4 -1.</_>
+        <_>
+          9 22 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 7 3 -1.</_>
+        <_>
+          9 21 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 8 4 -1.</_>
+        <_>
+          9 22 8 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 21 3 2 -1.</_>
+        <_>
+          10 21 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 22 3 2 -1.</_>
+        <_>
+          10 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 1 6 -1.</_>
+        <_>
+          10 3 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 1 -1.</_>
+        <_>
+          13 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 8 -1.</_>
+        <_>
+          10 4 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 14 10 -1.</_>
+        <_>
+          10 0 7 5 2.</_>
+        <_>
+          17 5 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 2 -1.</_>
+        <_>
+          10 1 2 1 2.</_>
+        <_>
+          12 2 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 1 6 -1.</_>
+        <_>
+          10 5 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 1 -1.</_>
+        <_>
+          13 3 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 9 1 -1.</_>
+        <_>
+          13 3 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 3 -1.</_>
+        <_>
+          10 4 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 3 -1.</_>
+        <_>
+          11 4 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 2 8 -1.</_>
+        <_>
+          11 4 1 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 3 -1.</_>
+        <_>
+          11 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 11 -1.</_>
+        <_>
+          12 5 2 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 3 -1.</_>
+        <_>
+          10 7 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 3 -1.</_>
+        <_>
+          10 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 7 -1.</_>
+        <_>
+          12 7 2 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 6 -1.</_>
+        <_>
+          13 7 3 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 3 -1.</_>
+        <_>
+          10 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 3 -1.</_>
+        <_>
+          10 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 2 -1.</_>
+        <_>
+          10 9 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 10 -1.</_>
+        <_>
+          10 13 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 1 3 -1.</_>
+        <_>
+          10 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 3 -1.</_>
+        <_>
+          10 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 4 -1.</_>
+        <_>
+          13 9 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 14 3 -1.</_>
+        <_>
+          10 11 14 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 11 1 3 -1.</_>
+        <_>
+          10 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 3 -1.</_>
+        <_>
+          10 12 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 1 3 -1.</_>
+        <_>
+          10 13 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 8 -1.</_>
+        <_>
+          10 12 1 4 2.</_>
+        <_>
+          11 16 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 15 4 3 -1.</_>
+        <_>
+          10 16 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 6 -1.</_>
+        <_>
+          10 17 6 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 16 6 8 -1.</_>
+        <_>
+          10 16 3 4 2.</_>
+        <_>
+          13 20 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 16 4 2 -1.</_>
+        <_>
+          10 17 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 16 4 3 -1.</_>
+        <_>
+          10 17 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          10 18 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 5 3 -1.</_>
+        <_>
+          10 18 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 18 5 3 -1.</_>
+        <_>
+          10 19 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 19 5 3 -1.</_>
+        <_>
+          10 20 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 3 3 -1.</_>
+        <_>
+          11 20 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 3 4 -1.</_>
+        <_>
+          11 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 4 3 -1.</_>
+        <_>
+          10 21 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 5 3 -1.</_>
+        <_>
+          10 21 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 3 1 -1.</_>
+        <_>
+          11 21 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 3 3 -1.</_>
+        <_>
+          11 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 6 3 -1.</_>
+        <_>
+          12 21 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 5 2 -1.</_>
+        <_>
+          10 22 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 22 3 1 -1.</_>
+        <_>
+          11 22 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 22 3 2 -1.</_>
+        <_>
+          11 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 12 -1.</_>
+        <_>
+          11 4 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 12 19 -1.</_>
+        <_>
+          15 0 4 19 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 20 -1.</_>
+        <_>
+          13 2 2 20 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 3 -1.</_>
+        <_>
+          12 3 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 5 -1.</_>
+        <_>
+          12 3 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 6 -1.</_>
+        <_>
+          12 3 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 7 -1.</_>
+        <_>
+          12 3 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 3 -1.</_>
+        <_>
+          11 4 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 12 14 -1.</_>
+        <_>
+          15 3 4 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 5 -1.</_>
+        <_>
+          12 4 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 3 -1.</_>
+        <_>
+          11 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 9 1 -1.</_>
+        <_>
+          14 4 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 3 -1.</_>
+        <_>
+          11 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 4 -1.</_>
+        <_>
+          11 7 8 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 3 -1.</_>
+        <_>
+          11 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 3 -1.</_>
+        <_>
+          11 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 1 3 -1.</_>
+        <_>
+          11 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 2 -1.</_>
+        <_>
+          11 7 1 1 2.</_>
+        <_>
+          12 8 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 3 -1.</_>
+        <_>
+          11 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 4 2 -1.</_>
+        <_>
+          11 7 2 1 2.</_>
+        <_>
+          13 8 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 4 3 -1.</_>
+        <_>
+          11 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 1 3 -1.</_>
+        <_>
+          11 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 1 10 -1.</_>
+        <_>
+          11 13 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 3 -1.</_>
+        <_>
+          11 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 3 -1.</_>
+        <_>
+          11 9 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 8 8 -1.</_>
+        <_>
+          11 8 4 4 2.</_>
+        <_>
+          15 12 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 7 10 -1.</_>
+        <_>
+          11 13 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 6 -1.</_>
+        <_>
+          13 9 2 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 3 -1.</_>
+        <_>
+          11 10 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 4 -1.</_>
+        <_>
+          13 10 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 8 -1.</_>
+        <_>
+          11 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 3 -1.</_>
+        <_>
+          11 11 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 5 3 -1.</_>
+        <_>
+          11 11 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 3 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 10 10 -1.</_>
+        <_>
+          11 11 5 5 2.</_>
+        <_>
+          16 16 5 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 2 -1.</_>
+        <_>
+          13 13 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 9 -1.</_>
+        <_>
+          11 17 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 15 1 2 -1.</_>
+        <_>
+          11 16 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 20 3 4 -1.</_>
+        <_>
+          12 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 20 3 3 -1.</_>
+        <_>
+          11 21 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 21 2 1 -1.</_>
+        <_>
+          12 21 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 21 3 2 -1.</_>
+        <_>
+          12 21 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 21 2 3 -1.</_>
+        <_>
+          12 21 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 21 3 2 -1.</_>
+        <_>
+          11 22 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 23 3 1 -1.</_>
+        <_>
+          12 23 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 12 -1.</_>
+        <_>
+          12 0 4 6 2.</_>
+        <_>
+          16 6 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 12 6 -1.</_>
+        <_>
+          12 0 6 3 2.</_>
+        <_>
+          18 3 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 1 3 -1.</_>
+        <_>
+          12 2 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 7 -1.</_>
+        <_>
+          13 1 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 12 4 -1.</_>
+        <_>
+          12 1 6 2 2.</_>
+        <_>
+          18 3 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 3 -1.</_>
+        <_>
+          13 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 7 -1.</_>
+        <_>
+          13 2 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 1 -1.</_>
+        <_>
+          14 2 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 4 -1.</_>
+        <_>
+          14 2 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 18 -1.</_>
+        <_>
+          12 8 6 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 11 -1.</_>
+        <_>
+          14 3 2 11 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 9 3 -1.</_>
+        <_>
+          15 3 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 12 3 -1.</_>
+        <_>
+          12 4 12 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 12 -1.</_>
+        <_>
+          13 4 1 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 3 -1.</_>
+        <_>
+          12 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 5 -1.</_>
+        <_>
+          13 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 1 3 -1.</_>
+        <_>
+          12 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 3 -1.</_>
+        <_>
+          12 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 4 -1.</_>
+        <_>
+          12 6 4 2 2.</_>
+        <_>
+          16 8 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 1 3 -1.</_>
+        <_>
+          12 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 3 -1.</_>
+        <_>
+          12 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 1 3 -1.</_>
+        <_>
+          12 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 3 -1.</_>
+        <_>
+          12 9 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 4 3 -1.</_>
+        <_>
+          12 9 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 9 1 3 -1.</_>
+        <_>
+          12 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 12 -1.</_>
+        <_>
+          12 10 1 6 2.</_>
+        <_>
+          13 16 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 10 -1.</_>
+        <_>
+          12 10 2 5 2.</_>
+        <_>
+          14 15 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 3 -1.</_>
+        <_>
+          12 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 4 -1.</_>
+        <_>
+          14 11 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 8 -1.</_>
+        <_>
+          12 11 2 4 2.</_>
+        <_>
+          14 15 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 6 5 -1.</_>
+        <_>
+          14 15 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 10 4 -1.</_>
+        <_>
+          12 15 5 2 2.</_>
+        <_>
+          17 17 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 16 4 3 -1.</_>
+        <_>
+          14 16 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 17 3 3 -1.</_>
+        <_>
+          13 17 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 17 8 6 -1.</_>
+        <_>
+          12 17 4 3 2.</_>
+        <_>
+          16 20 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 18 12 6 -1.</_>
+        <_>
+          12 18 6 3 2.</_>
+        <_>
+          18 21 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 21 3 3 -1.</_>
+        <_>
+          13 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 11 14 -1.</_>
+        <_>
+          13 7 11 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 3 -1.</_>
+        <_>
+          14 2 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 1 4 -1.</_>
+        <_>
+          13 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 3 -1.</_>
+        <_>
+          14 3 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 1 -1.</_>
+        <_>
+          15 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 2 -1.</_>
+        <_>
+          13 5 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 7 -1.</_>
+        <_>
+          14 4 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 8 -1.</_>
+        <_>
+          14 4 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 6 -1.</_>
+        <_>
+          14 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 6 1 3 -1.</_>
+        <_>
+          13 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 6 -1.</_>
+        <_>
+          15 7 2 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 3 -1.</_>
+        <_>
+          13 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 8 -1.</_>
+        <_>
+          15 8 2 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 4 -1.</_>
+        <_>
+          14 9 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 3 -1.</_>
+        <_>
+          15 9 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 4 -1.</_>
+        <_>
+          15 9 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 9 2 -1.</_>
+        <_>
+          16 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 9 2 -1.</_>
+        <_>
+          13 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 2 -1.</_>
+        <_>
+          14 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 1 -1.</_>
+        <_>
+          15 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 4 -1.</_>
+        <_>
+          13 10 2 2 2.</_>
+        <_>
+          15 12 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 3 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 3 -1.</_>
+        <_>
+          13 12 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 3 -1.</_>
+        <_>
+          13 13 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 6 -1.</_>
+        <_>
+          13 13 1 3 2.</_>
+        <_>
+          14 16 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 5 -1.</_>
+        <_>
+          14 15 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 19 3 3 -1.</_>
+        <_>
+          14 19 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 20 3 3 -1.</_>
+        <_>
+          14 20 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 22 3 2 -1.</_>
+        <_>
+          14 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 1 10 -1.</_>
+        <_>
+          14 5 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 7 -1.</_>
+        <_>
+          15 0 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 22 -1.</_>
+        <_>
+          14 0 1 11 2.</_>
+        <_>
+          15 11 1 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 6 -1.</_>
+        <_>
+          14 0 5 3 2.</_>
+        <_>
+          19 3 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 8 -1.</_>
+        <_>
+          14 0 5 4 2.</_>
+        <_>
+          19 4 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 12 -1.</_>
+        <_>
+          14 0 5 6 2.</_>
+        <_>
+          19 6 5 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 2 -1.</_>
+        <_>
+          15 1 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 4 4 -1.</_>
+        <_>
+          14 3 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 10 2 -1.</_>
+        <_>
+          19 1 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          16 2 2 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 4 -1.</_>
+        <_>
+          14 3 1 2 2.</_>
+        <_>
+          15 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 3 -1.</_>
+        <_>
+          15 4 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 1 -1.</_>
+        <_>
+          16 4 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 3 -1.</_>
+        <_>
+          14 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 2 -1.</_>
+        <_>
+          15 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 3 -1.</_>
+        <_>
+          15 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 2 -1.</_>
+        <_>
+          16 5 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 10 -1.</_>
+        <_>
+          14 10 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 6 -1.</_>
+        <_>
+          14 7 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 2 -1.</_>
+        <_>
+          15 6 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 4 -1.</_>
+        <_>
+          15 6 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 6 -1.</_>
+        <_>
+          15 6 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 2 -1.</_>
+        <_>
+          16 6 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 17 -1.</_>
+        <_>
+          16 6 2 17 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 2 13 -1.</_>
+        <_>
+          15 8 1 13 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 6 -1.</_>
+        <_>
+          14 10 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 2 -1.</_>
+        <_>
+          15 9 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 3 2 -1.</_>
+        <_>
+          15 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 4 -1.</_>
+        <_>
+          14 9 1 2 2.</_>
+        <_>
+          15 11 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 3 -1.</_>
+        <_>
+          15 9 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 1 -1.</_>
+        <_>
+          16 9 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 1 -1.</_>
+        <_>
+          16 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 9 9 -1.</_>
+        <_>
+          14 12 9 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 1 -1.</_>
+        <_>
+          15 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 1 -1.</_>
+        <_>
+          15 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          14 10 1 1 2.</_>
+        <_>
+          15 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          15 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 2 -1.</_>
+        <_>
+          15 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 3 -1.</_>
+        <_>
+          15 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 6 -1.</_>
+        <_>
+          14 10 1 3 2.</_>
+        <_>
+          15 13 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 2 -1.</_>
+        <_>
+          16 12 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 5 -1.</_>
+        <_>
+          16 12 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 8 6 -1.</_>
+        <_>
+          14 14 4 3 2.</_>
+        <_>
+          18 17 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 10 10 -1.</_>
+        <_>
+          14 14 5 5 2.</_>
+        <_>
+          19 19 5 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 16 10 8 -1.</_>
+        <_>
+          14 16 5 4 2.</_>
+        <_>
+          19 20 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 18 8 4 -1.</_>
+        <_>
+          14 18 4 2 2.</_>
+        <_>
+          18 20 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 19 3 4 -1.</_>
+        <_>
+          15 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 19 3 5 -1.</_>
+        <_>
+          15 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 20 3 4 -1.</_>
+        <_>
+          15 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 23 3 1 -1.</_>
+        <_>
+          15 23 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 8 1 -1.</_>
+        <_>
+          19 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 8 2 -1.</_>
+        <_>
+          19 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 2 2 10 -1.</_>
+        <_>
+          16 2 1 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 2 6 7 -1.</_>
+        <_>
+          17 2 2 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 3 -1.</_>
+        <_>
+          15 3 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 6 -1.</_>
+        <_>
+          16 4 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 8 -1.</_>
+        <_>
+          16 4 1 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 6 8 -1.</_>
+        <_>
+          18 4 3 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 8 3 -1.</_>
+        <_>
+          15 5 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 2 -1.</_>
+        <_>
+          16 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 2 -1.</_>
+        <_>
+          16 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 3 -1.</_>
+        <_>
+          16 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 6 -1.</_>
+        <_>
+          16 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 6 3 18 -1.</_>
+        <_>
+          15 12 3 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 6 6 7 -1.</_>
+        <_>
+          18 6 3 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 6 8 4 -1.</_>
+        <_>
+          15 6 4 2 2.</_>
+        <_>
+          19 8 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 6 -1.</_>
+        <_>
+          15 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 4 -1.</_>
+        <_>
+          15 9 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 6 -1.</_>
+        <_>
+          15 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 6 -1.</_>
+        <_>
+          15 9 6 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 7 3 -1.</_>
+        <_>
+          15 8 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 9 6 -1.</_>
+        <_>
+          15 9 9 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 2 -1.</_>
+        <_>
+          15 8 1 1 2.</_>
+        <_>
+          16 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 4 -1.</_>
+        <_>
+          15 8 1 2 2.</_>
+        <_>
+          16 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 1 12 -1.</_>
+        <_>
+          15 14 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 2 -1.</_>
+        <_>
+          15 9 1 1 2.</_>
+        <_>
+          16 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 4 -1.</_>
+        <_>
+          16 9 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 3 -1.</_>
+        <_>
+          15 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 7 3 -1.</_>
+        <_>
+          15 10 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 1 -1.</_>
+        <_>
+          16 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 4 -1.</_>
+        <_>
+          16 10 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 5 -1.</_>
+        <_>
+          16 10 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 8 -1.</_>
+        <_>
+          15 12 2 4 2.</_>
+        <_>
+          17 16 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 4 3 -1.</_>
+        <_>
+          15 16 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 5 3 -1.</_>
+        <_>
+          15 17 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 19 3 4 -1.</_>
+        <_>
+          16 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 19 9 3 -1.</_>
+        <_>
+          15 20 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 20 6 3 -1.</_>
+        <_>
+          18 20 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 1 -1.</_>
+        <_>
+          20 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 2 -1.</_>
+        <_>
+          20 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 4 -1.</_>
+        <_>
+          16 0 4 2 2.</_>
+        <_>
+          20 2 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 6 -1.</_>
+        <_>
+          16 0 4 3 2.</_>
+        <_>
+          20 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          20 4 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 12 -1.</_>
+        <_>
+          16 0 4 6 2.</_>
+        <_>
+          20 6 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 13 -1.</_>
+        <_>
+          18 1 2 13 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 2 -1.</_>
+        <_>
+          17 2 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 2 3 -1.</_>
+        <_>
+          16 4 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 4 1 3 -1.</_>
+        <_>
+          16 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 4 2 2 -1.</_>
+        <_>
+          16 4 1 1 2.</_>
+        <_>
+          17 5 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 3 -1.</_>
+        <_>
+          17 5 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 2 9 -1.</_>
+        <_>
+          16 9 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 4 -1.</_>
+        <_>
+          18 6 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 9 -1.</_>
+        <_>
+          16 9 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 7 6 -1.</_>
+        <_>
+          16 8 7 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 1 6 -1.</_>
+        <_>
+          16 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 3 -1.</_>
+        <_>
+          16 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 6 -1.</_>
+        <_>
+          16 9 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 2 -1.</_>
+        <_>
+          16 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 3 -1.</_>
+        <_>
+          16 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 6 -1.</_>
+        <_>
+          16 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          19 9 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 3 -1.</_>
+        <_>
+          16 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 6 -1.</_>
+        <_>
+          16 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 1 2 -1.</_>
+        <_>
+          16 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 2 -1.</_>
+        <_>
+          16 8 1 1 2.</_>
+        <_>
+          17 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 2 -1.</_>
+        <_>
+          16 9 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 8 2 -1.</_>
+        <_>
+          16 8 4 1 2.</_>
+        <_>
+          20 9 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 1 3 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 3 -1.</_>
+        <_>
+          17 9 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 1 -1.</_>
+        <_>
+          18 9 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 2 -1.</_>
+        <_>
+          16 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 4 -1.</_>
+        <_>
+          18 9 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 6 6 -1.</_>
+        <_>
+          16 9 3 3 2.</_>
+        <_>
+          19 12 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 1 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 1 3 -1.</_>
+        <_>
+          16 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          16 10 1 1 2.</_>
+        <_>
+          17 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          17 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 5 -1.</_>
+        <_>
+          17 10 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 13 -1.</_>
+        <_>
+          17 10 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 3 -1.</_>
+        <_>
+          16 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 3 -1.</_>
+        <_>
+          16 11 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 1 2 -1.</_>
+        <_>
+          16 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 2 -1.</_>
+        <_>
+          17 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 3 -1.</_>
+        <_>
+          16 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 13 3 3 -1.</_>
+        <_>
+          16 14 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 1 -1.</_>
+        <_>
+          18 14 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 15 4 3 -1.</_>
+        <_>
+          18 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 15 6 2 -1.</_>
+        <_>
+          19 15 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 15 8 3 -1.</_>
+        <_>
+          20 15 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 16 4 1 -1.</_>
+        <_>
+          18 16 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 17 3 7 -1.</_>
+        <_>
+          17 17 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 17 6 3 -1.</_>
+        <_>
+          16 18 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 3 4 -1.</_>
+        <_>
+          17 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 1 -1.</_>
+        <_>
+          20 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 2 1 4 -1.</_>
+        <_>
+          17 4 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 1 -1.</_>
+        <_>
+          18 3 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 2 -1.</_>
+        <_>
+          18 3 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 2 8 -1.</_>
+        <_>
+          17 3 1 4 2.</_>
+        <_>
+          18 7 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 3 -1.</_>
+        <_>
+          17 4 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 3 -1.</_>
+        <_>
+          17 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 2 -1.</_>
+        <_>
+          18 4 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 6 -1.</_>
+        <_>
+          17 4 1 3 2.</_>
+        <_>
+          18 7 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 1 6 -1.</_>
+        <_>
+          17 8 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 4 8 -1.</_>
+        <_>
+          17 6 2 4 2.</_>
+        <_>
+          19 10 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 3 -1.</_>
+        <_>
+          17 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 5 3 -1.</_>
+        <_>
+          17 7 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 3 -1.</_>
+        <_>
+          17 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 6 -1.</_>
+        <_>
+          17 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 6 -1.</_>
+        <_>
+          17 7 1 3 2.</_>
+        <_>
+          18 10 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 3 -1.</_>
+        <_>
+          17 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 6 4 -1.</_>
+        <_>
+          17 10 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 1 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 2 6 -1.</_>
+        <_>
+          17 9 1 3 2.</_>
+        <_>
+          18 12 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 4 2 -1.</_>
+        <_>
+          17 9 2 1 2.</_>
+        <_>
+          19 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 2 -1.</_>
+        <_>
+          17 10 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 5 3 -1.</_>
+        <_>
+          17 10 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 7 2 -1.</_>
+        <_>
+          17 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 1 3 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 2 -1.</_>
+        <_>
+          17 10 1 1 2.</_>
+        <_>
+          18 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 4 -1.</_>
+        <_>
+          18 10 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 4 -1.</_>
+        <_>
+          18 10 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 4 2 -1.</_>
+        <_>
+          17 10 2 1 2.</_>
+        <_>
+          19 11 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 1 3 -1.</_>
+        <_>
+          17 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 2 -1.</_>
+        <_>
+          18 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 3 -1.</_>
+        <_>
+          18 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 4 2 -1.</_>
+        <_>
+          17 11 2 1 2.</_>
+        <_>
+          19 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 12 3 2 -1.</_>
+        <_>
+          18 12 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 13 4 5 -1.</_>
+        <_>
+          19 13 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 14 2 3 -1.</_>
+        <_>
+          17 15 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 14 4 2 -1.</_>
+        <_>
+          19 14 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 15 4 2 -1.</_>
+        <_>
+          19 15 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 4 3 -1.</_>
+        <_>
+          19 16 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 17 3 7 -1.</_>
+        <_>
+          18 17 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 19 3 4 -1.</_>
+        <_>
+          18 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 21 3 3 -1.</_>
+        <_>
+          18 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 4 1 -1.</_>
+        <_>
+          20 0 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 1 -1.</_>
+        <_>
+          21 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 4 -1.</_>
+        <_>
+          21 0 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 1 1 12 -1.</_>
+        <_>
+          18 5 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 3 3 -1.</_>
+        <_>
+          19 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 3 2 -1.</_>
+        <_>
+          19 3 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 1 9 -1.</_>
+        <_>
+          18 6 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 3 4 -1.</_>
+        <_>
+          19 3 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 3 2 -1.</_>
+        <_>
+          19 4 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 3 4 -1.</_>
+        <_>
+          19 4 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 15 -1.</_>
+        <_>
+          21 5 3 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 3 -1.</_>
+        <_>
+          18 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 3 3 -1.</_>
+        <_>
+          18 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 3 -1.</_>
+        <_>
+          18 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 3 1 -1.</_>
+        <_>
+          19 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 2 -1.</_>
+        <_>
+          19 7 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 3 2 -1.</_>
+        <_>
+          18 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 1 3 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 2 -1.</_>
+        <_>
+          18 8 1 1 2.</_>
+        <_>
+          19 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 3 -1.</_>
+        <_>
+          18 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 3 14 -1.</_>
+        <_>
+          18 15 3 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 3 1 -1.</_>
+        <_>
+          19 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 2 -1.</_>
+        <_>
+          18 9 1 1 2.</_>
+        <_>
+          19 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 3 2 -1.</_>
+        <_>
+          19 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 1 -1.</_>
+        <_>
+          19 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 2 -1.</_>
+        <_>
+          18 10 1 1 2.</_>
+        <_>
+          19 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 2 -1.</_>
+        <_>
+          18 11 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 6 4 -1.</_>
+        <_>
+          21 10 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 6 5 -1.</_>
+        <_>
+          21 10 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 2 -1.</_>
+        <_>
+          19 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 6 -1.</_>
+        <_>
+          19 11 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 9 -1.</_>
+        <_>
+          19 11 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 8 -1.</_>
+        <_>
+          18 15 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 3 4 -1.</_>
+        <_>
+          19 12 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 2 6 -1.</_>
+        <_>
+          18 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 6 2 -1.</_>
+        <_>
+          21 12 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 3 12 -1.</_>
+        <_>
+          18 16 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 13 3 1 -1.</_>
+        <_>
+          19 13 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 14 6 6 -1.</_>
+        <_>
+          21 14 3 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 20 3 4 -1.</_>
+        <_>
+          19 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 20 6 3 -1.</_>
+        <_>
+          18 21 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 2 2 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_>
+        <_>
+          20 4 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 4 -1.</_>
+        <_>
+          19 6 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 20 -1.</_>
+        <_>
+          19 14 1 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 2 4 -1.</_>
+        <_>
+          19 6 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 4 3 -1.</_>
+        <_>
+          19 5 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 5 2 2 -1.</_>
+        <_>
+          19 5 1 1 2.</_>
+        <_>
+          20 6 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 3 -1.</_>
+        <_>
+          19 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 2 3 -1.</_>
+        <_>
+          19 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 5 3 -1.</_>
+        <_>
+          19 7 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 5 9 -1.</_>
+        <_>
+          19 9 5 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 12 -1.</_>
+        <_>
+          19 11 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 7 2 3 -1.</_>
+        <_>
+          19 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 3 -1.</_>
+        <_>
+          19 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 2 3 -1.</_>
+        <_>
+          20 8 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 2 1 -1.</_>
+        <_>
+          20 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 3 2 -1.</_>
+        <_>
+          20 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 10 2 2 -1.</_>
+        <_>
+          19 10 1 1 2.</_>
+        <_>
+          20 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 10 4 1 -1.</_>
+        <_>
+          21 10 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 11 3 7 -1.</_>
+        <_>
+          20 11 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 11 3 10 -1.</_>
+        <_>
+          20 11 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 11 3 11 -1.</_>
+        <_>
+          20 11 1 11 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 11 3 13 -1.</_>
+        <_>
+          20 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 14 3 10 -1.</_>
+        <_>
+          20 14 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 15 3 2 -1.</_>
+        <_>
+          19 16 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 18 3 3 -1.</_>
+        <_>
+          20 18 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 18 3 6 -1.</_>
+        <_>
+          20 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 20 5 3 -1.</_>
+        <_>
+          19 21 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 4 1 3 -1.</_>
+        <_>
+          20 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 5 1 2 -1.</_>
+        <_>
+          20 6 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 5 1 3 -1.</_>
+        <_>
+          20 6 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 5 2 3 -1.</_>
+        <_>
+          20 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 5 3 9 -1.</_>
+        <_>
+          20 8 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 6 4 9 -1.</_>
+        <_>
+          20 9 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 8 4 16 -1.</_>
+        <_>
+          22 8 2 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 9 4 6 -1.</_>
+        <_>
+          20 11 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 10 3 10 -1.</_>
+        <_>
+          21 10 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 10 3 9 -1.</_>
+        <_>
+          20 13 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 16 3 3 -1.</_>
+        <_>
+          21 16 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 17 3 7 -1.</_>
+        <_>
+          21 17 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 17 4 6 -1.</_>
+        <_>
+          20 19 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 18 3 3 -1.</_>
+        <_>
+          21 18 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 1 2 4 -1.</_>
+        <_>
+          21 3 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 5 1 3 -1.</_>
+        <_>
+          21 6 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 6 3 9 -1.</_>
+        <_>
+          21 9 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 10 3 3 -1.</_>
+        <_>
+          21 11 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 13 3 7 -1.</_>
+        <_>
+          22 13 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 16 3 3 -1.</_>
+        <_>
+          22 16 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 16 3 7 -1.</_>
+        <_>
+          22 16 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 17 3 5 -1.</_>
+        <_>
+          22 17 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 17 3 6 -1.</_>
+        <_>
+          21 19 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 17 3 6 -1.</_>
+        <_>
+          21 20 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 19 3 3 -1.</_>
+        <_>
+          22 19 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 19 3 5 -1.</_>
+        <_>
+          22 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 10 2 3 -1.</_>
+        <_>
+          22 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 11 2 3 -1.</_>
+        <_>
+          22 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 7 1 3 -1.</_>
+        <_>
+          23 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 9 1 3 -1.</_>
+        <_>
+          23 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 10 1 3 -1.</_>
+        <_>
+          23 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 14 1 9 -1.</_>
+        <_>
+          23 17 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 15 1 9 -1.</_>
+        <_>
+          23 18 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 18 1 6 -1.</_>
+        <_>
+          23 20 1 2 3.</_></rects>
+      <tilted>0</tilted></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface_extended.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface_extended.xml
new file mode 100644
index 000000000..892d5cb1a
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalcatface_extended.xml
@@ -0,0 +1,13394 @@
+<?xml version="1.0"?>
+<!--
+ A frontal cat face detector using the full set of Haar features, i.e.
+ horizontal, vertical, and diagonal features.
+
+ Contributed by Joseph Howse (josephhowse@nummist.com).
+
+ More information can be found in the following publications and
+ presentations:
+
+ Joseph Howse. OpenCV for Secret Agents (book). Packt Publishing, January
+   2015.
+ Joseph Howse. "Training Detectors and Recognizers in Python and OpenCV"
+   (tutorial). ISMAR 2014. September 9, 2014.
+   http://nummist.com/opencv/Howse_ISMAR_20140909.pdf
+ Joseph Howse. "Training Intelligent Camera Systems with Python and OpenCV"
+   (webcast). O’Reilly Media. June 17, 2014.
+   http://www.oreilly.com/pub/e/3077
+
+ Build scripts and demo applications can be found in the following repository:
+ https://bitbucket.org/Joe_Howse/angora-blue
+
+ KNOWN LIMITATIONS:
+
+ An upright subject is assumed. In situations where the cat's face might be
+ sideways or upside down (e.g. the cat is rolling over), try various rotations
+ of the input image.
+
+ CHANGELOG:
+
+ 2016-08-06: Re-trained with more negative samples and more stages. False
+   positives are much rarer now. If you tailored your code for the cascade's
+   previous version, now you should re-adjust the arguments of
+   CascadeClassifier::detectMultiScale. For example, decrease the value of the
+   minNeighbors argument. You do not need to use a human face detector to
+   cross-check the positives anymore.
+ 2014-04-25: First release (at https://bitbucket.org/Joe_Howse/angora-blue)
+
+ //////////////////////////////////////////////////////////////////////////
+ | Contributors License Agreement
+ | IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+ |   By downloading, copying, installing or using the software you agree
+ |   to this license.
+ |   If you do not agree to this license, do not download, install,
+ |   copy or use the software.
+ |
+ | Copyright (c) 2014-2016, Joseph Howse (Nummist Media Corporation Limited,
+ | Halifax, Nova Scotia, Canada). All rights reserved.
+ |
+ | Redistribution and use in source and binary forms, with or without
+ | modification, are permitted provided that the following conditions are
+ | met:
+ |
+ |    * Redistributions of source code must retain the above copyright
+ |       notice, this list of conditions and the following disclaimer.
+ |    * Redistributions in binary form must reproduce the above
+ |      copyright notice, this list of conditions and the following
+ |      disclaimer in the documentation and/or other materials provided
+ |      with the distribution.
+ |    * The name of Contributor may not used to endorse or promote products
+ |      derived from this software without specific prior written permission.
+ |
+ | THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ | "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ | LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+ | A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ | CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+ | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+ | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+ | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+ | LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+ | NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+ | SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+ | Top
+ //////////////////////////////////////////////////////////////////////////
+ -->
+<opencv_storage>
+<cascade>
+  <stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>24</height>
+  <width>24</width>
+  <stageParams>
+    <boostType>GAB</boostType>
+    <minHitRate>9.9500000476837158e-01</minHitRate>
+    <maxFalseAlarm>5.0000000000000000e-01</maxFalseAlarm>
+    <weightTrimRate>9.4999999999999996e-01</weightTrimRate>
+    <maxDepth>1</maxDepth>
+    <maxWeakCount>100</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount>
+    <featSize>1</featSize>
+    <mode>ALL</mode></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <!-- stage 0 -->
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.4294912815093994e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 394 -1.5126220881938934e-02</internalNodes>
+          <leafValues>
+            7.5887596607208252e-01 -3.4230688214302063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 3.9337221533060074e-03</internalNodes>
+          <leafValues>
+            -3.3288389444351196e-01 5.2361363172531128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 -1.5044892206788063e-02</internalNodes>
+          <leafValues>
+            5.5565774440765381e-01 -2.2505992650985718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -1.5777055174112320e-02</internalNodes>
+          <leafValues>
+            7.2692525386810303e-01 -1.6206762194633484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 3.0781796202063560e-02</internalNodes>
+          <leafValues>
+            -1.8173390626907349e-01 7.3483395576477051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 1.8483418971300125e-02</internalNodes>
+          <leafValues>
+            -1.8690711259841919e-01 5.0116515159606934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 1.3474167324602604e-02</internalNodes>
+          <leafValues>
+            -1.5681208670139313e-01 5.8611637353897095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 5.3415738046169281e-02</internalNodes>
+          <leafValues>
+            -1.6418528556823730e-01 6.8128466606140137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 5.4243900813162327e-03</internalNodes>
+          <leafValues>
+            -1.8231739103794098e-01 4.6716138720512390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 1.7689792439341545e-02</internalNodes>
+          <leafValues>
+            -1.3713267445564270e-01 6.0434049367904663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 2.2149257711134851e-04</internalNodes>
+          <leafValues>
+            -2.7738124132156372e-01 2.8165665268898010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 -2.8517641127109528e-02</internalNodes>
+          <leafValues>
+            5.5257320404052734e-01 -1.2970162928104401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 4.3854981660842896e-02</internalNodes>
+          <leafValues>
+            -1.9231440126895905e-01 4.2093500494956970e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 1 -->
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-1.5509251356124878e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 337 2.4014184251427650e-02</internalNodes>
+          <leafValues>
+            -2.1038578450679779e-01 7.3892170190811157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -5.5319909006357193e-03</internalNodes>
+          <leafValues>
+            4.4344031810760498e-01 -2.8907662630081177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 2.7481060475111008e-02</internalNodes>
+          <leafValues>
+            -1.9128543138504028e-01 5.1661676168441772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -1.1628001928329468e-02</internalNodes>
+          <leafValues>
+            5.1978123188018799e-01 -1.7051684856414795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 1.5159824397414923e-03</internalNodes>
+          <leafValues>
+            -2.9784303903579712e-01 3.9050224423408508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 1.3662670738995075e-02</internalNodes>
+          <leafValues>
+            -1.4316783845424652e-01 4.4111710786819458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 -3.6911026109009981e-03</internalNodes>
+          <leafValues>
+            3.2185173034667969e-01 -2.3853960633277893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 3.3176485449075699e-02</internalNodes>
+          <leafValues>
+            -7.4603199958801270e-02 7.5860917568206787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -5.7046953588724136e-03</internalNodes>
+          <leafValues>
+            -7.5004047155380249e-01 1.0240622609853745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 7.9660946503281593e-03</internalNodes>
+          <leafValues>
+            9.8882928490638733e-02 -7.3491615056991577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 3.0965393409132957e-02</internalNodes>
+          <leafValues>
+            -1.6046196222305298e-01 4.5570060610771179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -4.0078125894069672e-03</internalNodes>
+          <leafValues>
+            -7.1539020538330078e-01 6.9276176393032074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -8.2283765077590942e-03</internalNodes>
+          <leafValues>
+            3.2576236128807068e-01 -1.8509653210639954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 3.4253271296620369e-03</internalNodes>
+          <leafValues>
+            1.0964145511388779e-01 -5.8205413818359375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 9.0980646200478077e-04</internalNodes>
+          <leafValues>
+            -2.0425215363502502e-01 2.7488732337951660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 5.9772443026304245e-02</internalNodes>
+          <leafValues>
+            -1.3786207139492035e-01 4.0762668848037720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -4.1712004691362381e-02</internalNodes>
+          <leafValues>
+            4.9409377574920654e-01 -1.1713714897632599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -3.0311278998851776e-02</internalNodes>
+          <leafValues>
+            5.1191121339797974e-01 -1.0507214814424515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 -6.5785087645053864e-03</internalNodes>
+          <leafValues>
+            -7.6472043991088867e-01 8.0923363566398621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 1.1685060337185860e-02</internalNodes>
+          <leafValues>
+            5.0379037857055664e-02 -7.9744982719421387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 6.5714016556739807e-02</internalNodes>
+          <leafValues>
+            -1.1398456245660782e-01 4.9489131569862366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 9.7422497346997261e-03</internalNodes>
+          <leafValues>
+            -1.4347794651985168e-01 3.6561754345893860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 4.9857441335916519e-03</internalNodes>
+          <leafValues>
+            7.9834438860416412e-02 -7.2391557693481445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -1.1547822505235672e-03</internalNodes>
+          <leafValues>
+            4.1867440938949585e-01 -1.2869183719158173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -4.4658007100224495e-03</internalNodes>
+          <leafValues>
+            -6.7933702468872070e-01 8.2867160439491272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 3.6325352266430855e-03</internalNodes>
+          <leafValues>
+            6.6807270050048828e-02 -6.0182958841323853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 7.4123376980423927e-03</internalNodes>
+          <leafValues>
+            -1.5108695626258850e-01 3.2046884298324585e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 2 -->
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.3890913724899292e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 619 1.7836617305874825e-02</internalNodes>
+          <leafValues>
+            -2.1508488059043884e-01 6.6796410083770752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -8.5781915113329887e-03</internalNodes>
+          <leafValues>
+            5.0962758064270020e-01 -2.2129471600055695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 3.1586211174726486e-02</internalNodes>
+          <leafValues>
+            -2.1485456824302673e-01 4.2591696977615356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 2.5690056383609772e-02</internalNodes>
+          <leafValues>
+            -1.5910078585147858e-01 6.7842948436737061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 -2.2857591509819031e-02</internalNodes>
+          <leafValues>
+            5.7221925258636475e-01 -1.3710150122642517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 4.7176675871014595e-03</internalNodes>
+          <leafValues>
+            -2.3617559671401978e-01 3.9870622754096985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -2.3281413596123457e-03</internalNodes>
+          <leafValues>
+            -7.0095318555831909e-01 1.3746888935565948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 1.0266102617606521e-03</internalNodes>
+          <leafValues>
+            -2.6873087882995605e-01 2.6495781540870667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -7.6808528974652290e-03</internalNodes>
+          <leafValues>
+            3.6925876140594482e-01 -2.1339643001556396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 6.4357556402683258e-02</internalNodes>
+          <leafValues>
+            -1.1779088526964188e-01 5.5030888319015503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 8.9486092329025269e-02</internalNodes>
+          <leafValues>
+            -1.4395782351493835e-01 5.3468054533004761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 -5.6334878318011761e-03</internalNodes>
+          <leafValues>
+            -6.5704786777496338e-01 1.3971389830112457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -8.0200601369142532e-03</internalNodes>
+          <leafValues>
+            3.6956611275672913e-01 -1.8284171819686890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 8.3984360098838806e-03</internalNodes>
+          <leafValues>
+            -1.3507588207721710e-01 4.4903004169464111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 -5.7764705270528793e-03</internalNodes>
+          <leafValues>
+            -6.5459579229354858e-01 1.1050829291343689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 3.9896301925182343e-02</internalNodes>
+          <leafValues>
+            -1.5822732448577881e-01 3.6069712042808533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -6.8376958370208740e-02</internalNodes>
+          <leafValues>
+            6.2642019987106323e-01 -8.3647280931472778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -2.7075063437223434e-02</internalNodes>
+          <leafValues>
+            4.0549215674400330e-01 -1.4247153699398041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 6.8107023835182190e-03</internalNodes>
+          <leafValues>
+            7.7754773199558258e-02 -6.4665120840072632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 3.6659452598541975e-03</internalNodes>
+          <leafValues>
+            7.9356946051120758e-02 -5.4679936170578003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 2.3308303207159042e-02</internalNodes>
+          <leafValues>
+            -1.4383231103420258e-01 3.4179633855819702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -3.2547116279602051e-02</internalNodes>
+          <leafValues>
+            3.6395668983459473e-01 -1.2551946938037872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 1.6501296311616898e-02</internalNodes>
+          <leafValues>
+            -1.0674661397933960e-01 4.2714300751686096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -2.9296698048710823e-03</internalNodes>
+          <leafValues>
+            -5.7476091384887695e-01 8.5429534316062927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 1.3306898763403296e-03</internalNodes>
+          <leafValues>
+            -1.2303277105093002e-01 3.7224721908569336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 9.8933260887861252e-03</internalNodes>
+          <leafValues>
+            6.7675270140171051e-02 -6.7935848236083984e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 3 -->
+    <_>
+      <maxWeakCount>31</maxWeakCount>
+      <stageThreshold>-1.4026626348495483e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 876 -1.4927964657545090e-02</internalNodes>
+          <leafValues>
+            6.3834953308105469e-01 -1.8698258697986603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -1.1759694665670395e-02</internalNodes>
+          <leafValues>
+            5.0763273239135742e-01 -2.0944127440452576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 1.1289508081972599e-02</internalNodes>
+          <leafValues>
+            -1.4533838629722595e-01 5.3039866685867310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 1.3691024854779243e-02</internalNodes>
+          <leafValues>
+            -1.3143934309482574e-01 5.9853446483612061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 -8.6051290854811668e-03</internalNodes>
+          <leafValues>
+            3.1604155898094177e-01 -2.2497664391994476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 1.1611104011535645e-02</internalNodes>
+          <leafValues>
+            -1.7180299758911133e-01 3.6340636014938354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 5.4911419283598661e-04</internalNodes>
+          <leafValues>
+            -2.0625770092010498e-01 3.0243906378746033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -1.1997690424323082e-02</internalNodes>
+          <leafValues>
+            6.7541980743408203e-01 -1.0784135758876801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -2.0809918642044067e-03</internalNodes>
+          <leafValues>
+            -5.7404327392578125e-01 1.1769672483205795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 6.8656861782073975e-02</internalNodes>
+          <leafValues>
+            -1.4633083343505859e-01 4.1269731521606445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 -4.5645810663700104e-02</internalNodes>
+          <leafValues>
+            5.4341620206832886e-01 -1.1726979166269302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -1.8052812665700912e-02</internalNodes>
+          <leafValues>
+            3.6646232008934021e-01 -1.3256482779979706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 9.2329997569322586e-03</internalNodes>
+          <leafValues>
+            9.1808989644050598e-02 -6.4987671375274658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -2.9587259050458670e-03</internalNodes>
+          <leafValues>
+            2.4805040657520294e-01 -2.0830279588699341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 -7.1467030793428421e-03</internalNodes>
+          <leafValues>
+            -6.6564339399337769e-01 8.8065519928932190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -5.7738199830055237e-03</internalNodes>
+          <leafValues>
+            2.4252247810363770e-01 -2.1394193172454834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 6.4636822789907455e-03</internalNodes>
+          <leafValues>
+            8.4821723401546478e-02 -6.4125812053680420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -2.8782974928617477e-02</internalNodes>
+          <leafValues>
+            3.5874211788177490e-01 -1.4370997250080109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -1.8174832221120596e-03</internalNodes>
+          <leafValues>
+            3.7480926513671875e-01 -1.2761794030666351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 -1.9234847277402878e-03</internalNodes>
+          <leafValues>
+            -5.6678783893585205e-01 9.0299606323242188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 2.8048637323081493e-03</internalNodes>
+          <leafValues>
+            8.5870750248432159e-02 -5.8541411161422729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 7.0693701505661011e-02</internalNodes>
+          <leafValues>
+            -1.2318307906389236e-01 3.9827430248260498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 6.2659628689289093e-02</internalNodes>
+          <leafValues>
+            -9.1229990124702454e-02 5.0639665126800537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -3.7420655135065317e-03</internalNodes>
+          <leafValues>
+            3.5059738159179688e-01 -1.2444343417882919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 6.8388320505619049e-03</internalNodes>
+          <leafValues>
+            -1.0419095307588577e-01 4.5085826516151428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 7.1193519979715347e-03</internalNodes>
+          <leafValues>
+            9.1205865144729614e-02 -5.2279585599899292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -9.8787562455981970e-04</internalNodes>
+          <leafValues>
+            2.8105542063713074e-01 -1.5169830620288849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 1.8099821172654629e-03</internalNodes>
+          <leafValues>
+            6.5428622066974640e-02 -6.9196063280105591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 -6.0212425887584686e-03</internalNodes>
+          <leafValues>
+            -6.2636482715606689e-01 5.1543414592742920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 5.1644006744027138e-03</internalNodes>
+          <leafValues>
+            6.3040286302566528e-02 -6.3455927371978760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 9.4506526365876198e-03</internalNodes>
+          <leafValues>
+            -1.3443979620933533e-01 3.1506177783012390e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 4 -->
+    <_>
+      <maxWeakCount>38</maxWeakCount>
+      <stageThreshold>-1.4621645212173462e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 383 -1.5925668179988861e-02</internalNodes>
+          <leafValues>
+            6.2127149105072021e-01 -1.8520653247833252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 1.0260052047669888e-02</internalNodes>
+          <leafValues>
+            -2.4736632406711578e-01 4.2336893081665039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 5.7025998830795288e-03</internalNodes>
+          <leafValues>
+            -2.3670144379138947e-01 3.3228391408920288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 9.3164276331663132e-03</internalNodes>
+          <leafValues>
+            -1.7946784198284149e-01 4.6311038732528687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -5.0438079051673412e-03</internalNodes>
+          <leafValues>
+            4.4613519310951233e-01 -1.6072992980480194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 2.8381291776895523e-03</internalNodes>
+          <leafValues>
+            -1.8486896157264709e-01 3.5892590880393982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 6.7377656698226929e-02</internalNodes>
+          <leafValues>
+            -1.7760114371776581e-01 3.9539518952369690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -8.7916189804673195e-03</internalNodes>
+          <leafValues>
+            -5.9182339906692505e-01 1.1145308613777161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 1.3353329151868820e-02</internalNodes>
+          <leafValues>
+            -1.1993711441755295e-01 4.8862439393997192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -1.0008489713072777e-02</internalNodes>
+          <leafValues>
+            4.1768664121627808e-01 -1.2453128397464752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -1.4410717412829399e-03</internalNodes>
+          <leafValues>
+            3.4100320935249329e-01 -1.6849595308303833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 1.1647527664899826e-01</internalNodes>
+          <leafValues>
+            -9.7596585750579834e-02 4.2289251089096069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 -9.8112244158983231e-03</internalNodes>
+          <leafValues>
+            2.6155915856361389e-01 -2.0234876871109009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 6.3042029738426208e-02</internalNodes>
+          <leafValues>
+            -1.2662252783775330e-01 3.6811619997024536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -1.7675247043371201e-02</internalNodes>
+          <leafValues>
+            4.1690909862518311e-01 -1.1987055838108063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 4.0485346689820290e-03</internalNodes>
+          <leafValues>
+            7.0249855518341064e-02 -7.3556905984878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 8.2748252898454666e-03</internalNodes>
+          <leafValues>
+            -1.6168670356273651e-01 2.8835350275039673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -5.0843162462115288e-03</internalNodes>
+          <leafValues>
+            -5.8562570810317993e-01 8.9675068855285645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 6.0826279222965240e-03</internalNodes>
+          <leafValues>
+            4.7766357660293579e-02 -6.8612217903137207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 8.5826087743043900e-03</internalNodes>
+          <leafValues>
+            -1.6963686048984528e-01 2.6875671744346619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 2.4908576160669327e-02</internalNodes>
+          <leafValues>
+            8.5034154355525970e-02 -5.7059210538864136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 2.0448346622288227e-03</internalNodes>
+          <leafValues>
+            -1.8642950057983398e-01 2.3178242146968842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 2.4130716919898987e-02</internalNodes>
+          <leafValues>
+            -1.2823060154914856e-01 3.4394741058349609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 -4.7494415193796158e-03</internalNodes>
+          <leafValues>
+            -7.1827727556228638e-01 6.8053275346755981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -1.7751917243003845e-02</internalNodes>
+          <leafValues>
+            -5.5972510576248169e-01 5.2141726016998291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 5.5826390162110329e-03</internalNodes>
+          <leafValues>
+            4.8266090452671051e-02 -5.9813541173934937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 1.4416726771742105e-03</internalNodes>
+          <leafValues>
+            -9.2707693576812744e-02 4.1495534777641296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -2.1779362577944994e-03</internalNodes>
+          <leafValues>
+            2.7112621068954468e-01 -1.5071788430213928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 3.0656920280307531e-03</internalNodes>
+          <leafValues>
+            6.0340058058500290e-02 -6.5465551614761353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 1.9947460293769836e-01</internalNodes>
+          <leafValues>
+            -9.5098674297332764e-02 3.9016976952552795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -2.0255323499441147e-02</internalNodes>
+          <leafValues>
+            4.3044877052307129e-01 -8.8302992284297943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 5.4685659706592560e-03</internalNodes>
+          <leafValues>
+            -8.7241113185882568e-02 3.9513549208641052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -1.0883151553571224e-03</internalNodes>
+          <leafValues>
+            2.9802373051643372e-01 -1.3696449995040894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -5.0911568105220795e-03</internalNodes>
+          <leafValues>
+            -6.2439930438995361e-01 6.2544539570808411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -5.2395770326256752e-03</internalNodes>
+          <leafValues>
+            -6.9036418199539185e-01 4.5142117887735367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 4.0486194193363190e-02</internalNodes>
+          <leafValues>
+            -7.5753845274448395e-02 5.2426725625991821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 4.1610337793827057e-03</internalNodes>
+          <leafValues>
+            6.6071115434169769e-02 -5.8079534769058228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 -6.4253048039972782e-03</internalNodes>
+          <leafValues>
+            3.0481830239295959e-01 -1.1435022950172424e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 5 -->
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.4235107898712158e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 716 -2.2738082334399223e-03</internalNodes>
+          <leafValues>
+            5.9519726037979126e-01 -1.6779936850070953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -1.2204157188534737e-02</internalNodes>
+          <leafValues>
+            4.6985983848571777e-01 -1.7339397966861725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 3.1242824625223875e-03</internalNodes>
+          <leafValues>
+            -2.2488421201705933e-01 3.4029743075370789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 -3.9868438616394997e-03</internalNodes>
+          <leafValues>
+            3.8314539194107056e-01 -1.8952924013137817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 -5.4737669415771961e-03</internalNodes>
+          <leafValues>
+            2.4583901464939117e-01 -2.3114782571792603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 1.5154287219047546e-02</internalNodes>
+          <leafValues>
+            -1.0675037652254105e-01 5.8347207307815552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -1.4294658321887255e-03</internalNodes>
+          <leafValues>
+            3.8292840123176575e-01 -1.2911921739578247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -7.4405185878276825e-03</internalNodes>
+          <leafValues>
+            2.8356546163558960e-01 -1.7810684442520142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -4.0357224643230438e-03</internalNodes>
+          <leafValues>
+            2.6303085684776306e-01 -1.6862161457538605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -5.8342106640338898e-03</internalNodes>
+          <leafValues>
+            3.2040205597877502e-01 -1.4103877544403076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 1.7279960215091705e-02</internalNodes>
+          <leafValues>
+            -1.7433850467205048e-01 2.7985212206840515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 2.2125110030174255e-02</internalNodes>
+          <leafValues>
+            -1.1797516793012619e-01 4.0373948216438293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 -4.4059187173843384e-02</internalNodes>
+          <leafValues>
+            5.2820503711700439e-01 -7.0916719734668732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -3.8316637277603149e-02</internalNodes>
+          <leafValues>
+            3.8833045959472656e-01 -1.0811555385589600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 4.5704744756221771e-02</internalNodes>
+          <leafValues>
+            -1.7566929757595062e-01 3.4665411710739136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 1.1523386929184198e-03</internalNodes>
+          <leafValues>
+            -1.7257389426231384e-01 2.5989890098571777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -1.0491746477782726e-02</internalNodes>
+          <leafValues>
+            -6.1285555362701416e-01 7.1230083703994751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -4.5014433562755585e-03</internalNodes>
+          <leafValues>
+            -5.7712453603744507e-01 5.8887075632810593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -3.7281280383467674e-03</internalNodes>
+          <leafValues>
+            -6.7359894514083862e-01 5.2957162261009216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 3.4461893141269684e-02</internalNodes>
+          <leafValues>
+            -1.0375578701496124e-01 3.7974634766578674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -1.3906960375607014e-03</internalNodes>
+          <leafValues>
+            3.9171192049980164e-01 -1.0048408061265945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.6332454979419708e-02</internalNodes>
+          <leafValues>
+            8.6256101727485657e-02 -4.5887523889541626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 -6.0738036409020424e-03</internalNodes>
+          <leafValues>
+            -5.2265202999114990e-01 6.5308839082717896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -3.3630726393312216e-03</internalNodes>
+          <leafValues>
+            -5.6505429744720459e-01 5.5844355374574661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -1.5329496003687382e-02</internalNodes>
+          <leafValues>
+            3.4475114941596985e-01 -1.0086353123188019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 -9.0496204793453217e-03</internalNodes>
+          <leafValues>
+            2.9553902149200439e-01 -1.1406829208135605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 -3.1109917908906937e-03</internalNodes>
+          <leafValues>
+            -4.4897687435150146e-01 7.3615357279777527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 3.3499556593596935e-03</internalNodes>
+          <leafValues>
+            5.4718658328056335e-02 -5.4810231924057007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 1.8374501960352063e-03</internalNodes>
+          <leafValues>
+            -1.3522666692733765e-01 2.4655479192733765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 2.6134990621358156e-03</internalNodes>
+          <leafValues>
+            6.6369861364364624e-02 -4.7342041134834290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -7.4155852198600769e-03</internalNodes>
+          <leafValues>
+            2.0866124331951141e-01 -1.5775154531002045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 3.9352793246507645e-03</internalNodes>
+          <leafValues>
+            5.1660846918821335e-02 -6.2589824199676514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -1.0450070258229971e-03</internalNodes>
+          <leafValues>
+            3.3525371551513672e-01 -1.0084854811429977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 1.2639444321393967e-03</internalNodes>
+          <leafValues>
+            -1.2103077769279480e-01 2.7691018581390381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 7.7577251940965652e-03</internalNodes>
+          <leafValues>
+            4.6813234686851501e-02 -7.3385792970657349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -1.0632604360580444e-02</internalNodes>
+          <leafValues>
+            -7.1024382114410400e-01 3.3777639269828796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 1.8631946295499802e-02</internalNodes>
+          <leafValues>
+            -1.4613701403141022e-01 2.1491082012653351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 4.9128942191600800e-03</internalNodes>
+          <leafValues>
+            5.3445268422365189e-02 -6.3314527273178101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -9.8230186849832535e-03</internalNodes>
+          <leafValues>
+            2.6917773485183716e-01 -1.1376978456974030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 -3.0754944309592247e-03</internalNodes>
+          <leafValues>
+            -5.0787961483001709e-01 6.1582125723361969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -6.7374799400568008e-03</internalNodes>
+          <leafValues>
+            2.3871047794818878e-01 -1.2552142143249512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -1.1759715154767036e-02</internalNodes>
+          <leafValues>
+            3.3646693825721741e-01 -9.4460532069206238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 -4.1377237066626549e-03</internalNodes>
+          <leafValues>
+            -5.0522220134735107e-01 6.2668189406394958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 1.7267453949898481e-03</internalNodes>
+          <leafValues>
+            -8.0607026815414429e-02 3.8304185867309570e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 6 -->
+    <_>
+      <maxWeakCount>47</maxWeakCount>
+      <stageThreshold>-1.4313566684722900e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 882 -1.1920252814888954e-02</internalNodes>
+          <leafValues>
+            5.6617152690887451e-01 -1.5811842679977417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -4.3085627257823944e-03</internalNodes>
+          <leafValues>
+            4.4759327173233032e-01 -1.6846470534801483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 1.1177745182067156e-03</internalNodes>
+          <leafValues>
+            -1.5351393818855286e-01 4.3508940935134888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 3.5418532788753510e-02</internalNodes>
+          <leafValues>
+            -1.2973460555076599e-01 3.6943939328193665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 2.2405586205422878e-03</internalNodes>
+          <leafValues>
+            -1.8800468742847443e-01 3.2498928904533386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -1.7982896417379379e-02</internalNodes>
+          <leafValues>
+            4.5607218146324158e-01 -1.0459473729133606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -4.9088716506958008e-02</internalNodes>
+          <leafValues>
+            3.4279289841651917e-01 -1.5114119648933411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 7.1780886501073837e-03</internalNodes>
+          <leafValues>
+            6.3825756311416626e-02 -6.2449872493743896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 3.9123920723795891e-03</internalNodes>
+          <leafValues>
+            7.1502417325973511e-02 -6.3956946134567261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 -4.1980943642556667e-03</internalNodes>
+          <leafValues>
+            2.1998657286167145e-01 -1.9890366494655609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 -4.5476644299924374e-03</internalNodes>
+          <leafValues>
+            2.1866278350353241e-01 -1.9852560758590698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 -4.4158436357975006e-03</internalNodes>
+          <leafValues>
+            2.3959043622016907e-01 -1.7090958356857300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -4.7058244235813618e-03</internalNodes>
+          <leafValues>
+            -5.1537507772445679e-01 9.0310461819171906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -8.7488889694213867e-03</internalNodes>
+          <leafValues>
+            2.2937677800655365e-01 -1.8315380811691284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -3.1655649654567242e-03</internalNodes>
+          <leafValues>
+            -7.3091191053390503e-01 6.5193220973014832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 6.4696683548390865e-03</internalNodes>
+          <leafValues>
+            -1.1077737808227539e-01 3.7207809090614319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 2.2985613904893398e-03</internalNodes>
+          <leafValues>
+            7.7800542116165161e-02 -5.1104581356048584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 4.5809363946318626e-03</internalNodes>
+          <leafValues>
+            5.7778771966695786e-02 -5.7898092269897461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 1.1279166210442781e-03</internalNodes>
+          <leafValues>
+            -1.7981146275997162e-01 1.9939005374908447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -1.2820301577448845e-02</internalNodes>
+          <leafValues>
+            5.1867282390594482e-01 -6.9989629089832306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 4.4866472482681274e-02</internalNodes>
+          <leafValues>
+            -1.4253044128417969e-01 3.0062338709831238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -3.5413210280239582e-03</internalNodes>
+          <leafValues>
+            -5.7618641853332520e-01 6.0328345745801926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -7.4678594246506691e-03</internalNodes>
+          <leafValues>
+            -5.0187259912490845e-01 6.1294022947549820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 1.8058011308312416e-02</internalNodes>
+          <leafValues>
+            5.3603217005729675e-02 -5.8919399976730347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -6.8098572082817554e-03</internalNodes>
+          <leafValues>
+            -5.4100829362869263e-01 5.5898215621709824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 3.6491458304226398e-03</internalNodes>
+          <leafValues>
+            4.7378763556480408e-02 -5.9323132038116455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 1.4524955768138170e-03</internalNodes>
+          <leafValues>
+            -8.8994570076465607e-02 3.8729071617126465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -6.2408884987235069e-03</internalNodes>
+          <leafValues>
+            -6.6442847251892090e-01 5.1082015037536621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -9.9360430613160133e-04</internalNodes>
+          <leafValues>
+            3.2972389459609985e-01 -1.0494423657655716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 3.9777760393917561e-03</internalNodes>
+          <leafValues>
+            5.4083213210105896e-02 -6.2114214897155762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 -1.4884659089148045e-02</internalNodes>
+          <leafValues>
+            2.4066454172134399e-01 -1.2317410856485367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 3.3154981210827827e-03</internalNodes>
+          <leafValues>
+            -1.1744727939367294e-01 2.9429042339324951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -4.7508114948868752e-03</internalNodes>
+          <leafValues>
+            -4.5763325691223145e-01 6.7066885530948639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -1.1973761022090912e-02</internalNodes>
+          <leafValues>
+            2.5750914216041565e-01 -1.1354148387908936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 4.9072699621319771e-03</internalNodes>
+          <leafValues>
+            -1.1266437917947769e-01 3.0022394657135010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 6.5630510449409485e-02</internalNodes>
+          <leafValues>
+            -1.0180503129959106e-01 3.0517497658729553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -2.3393325507640839e-02</internalNodes>
+          <leafValues>
+            3.2443770766258240e-01 -9.5363102853298187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -3.8902116939425468e-03</internalNodes>
+          <leafValues>
+            2.0148487389087677e-01 -1.4944279193878174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -2.5926973670721054e-02</internalNodes>
+          <leafValues>
+            -4.4917497038841248e-01 6.9752328097820282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -7.1825529448688030e-03</internalNodes>
+          <leafValues>
+            -5.6838059425354004e-01 4.9584377557039261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 -9.9399685859680176e-03</internalNodes>
+          <leafValues>
+            3.0747908353805542e-01 -1.1064232140779495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -3.6286246031522751e-03</internalNodes>
+          <leafValues>
+            -6.0276371240615845e-01 5.2405584603548050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 1.5756220091134310e-03</internalNodes>
+          <leafValues>
+            -1.1615782976150513e-01 2.6717522740364075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 3.5662509500980377e-02</internalNodes>
+          <leafValues>
+            -1.0885569453239441e-01 2.9044550657272339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 5.3282946348190308e-02</internalNodes>
+          <leafValues>
+            -8.1855505704879761e-02 4.0298762917518616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 3.3901704009622335e-03</internalNodes>
+          <leafValues>
+            5.5047694593667984e-02 -5.4021596908569336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 1.3204356655478477e-03</internalNodes>
+          <leafValues>
+            -9.4643965363502502e-02 3.0430349707603455e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 7 -->
+    <_>
+      <maxWeakCount>48</maxWeakCount>
+      <stageThreshold>-1.3744181394577026e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 788 3.9594387635588646e-03</internalNodes>
+          <leafValues>
+            -1.5454453229904175e-01 4.9922767281532288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -1.6322813928127289e-02</internalNodes>
+          <leafValues>
+            4.2537182569503784e-01 -1.5276345610618591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 1.6230947803705931e-03</internalNodes>
+          <leafValues>
+            -2.2640861570835114e-01 2.5220483541488647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -6.0441931709647179e-03</internalNodes>
+          <leafValues>
+            2.2711095213890076e-01 -2.1762822568416595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 1.1688062921166420e-02</internalNodes>
+          <leafValues>
+            -1.6991630196571350e-01 2.8343129158020020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 -3.1942571513354778e-03</internalNodes>
+          <leafValues>
+            -6.2475329637527466e-01 7.3184341192245483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -7.6569117605686188e-02</internalNodes>
+          <leafValues>
+            5.5236744880676270e-01 -7.7832877635955811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 1.8717286875471473e-03</internalNodes>
+          <leafValues>
+            8.4293909370899200e-02 -5.2716743946075439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 3.5880310460925102e-03</internalNodes>
+          <leafValues>
+            -1.2907223403453827e-01 3.3967444300651550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -5.7136151008307934e-03</internalNodes>
+          <leafValues>
+            -5.9208476543426514e-01 7.7793844044208527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -1.9309867173433304e-02</internalNodes>
+          <leafValues>
+            2.5386241078376770e-01 -1.7397734522819519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 -2.4289516732096672e-03</internalNodes>
+          <leafValues>
+            3.2221227884292603e-01 -1.2751287221908569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -8.5500031709671021e-02</internalNodes>
+          <leafValues>
+            -7.7962499856948853e-01 5.0715133547782898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 5.7447291910648346e-03</internalNodes>
+          <leafValues>
+            -1.1523491144180298e-01 3.6400210857391357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 5.8936916291713715e-02</internalNodes>
+          <leafValues>
+            -8.7829843163490295e-02 4.1893997788429260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -4.1379006579518318e-03</internalNodes>
+          <leafValues>
+            -6.3083720207214355e-01 6.4935714006423950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -4.6407114714384079e-03</internalNodes>
+          <leafValues>
+            -6.5650087594985962e-01 5.4394256323575974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 1.5865347813814878e-03</internalNodes>
+          <leafValues>
+            -1.7255148291587830e-01 2.3248092830181122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 2.8971401043236256e-03</internalNodes>
+          <leafValues>
+            6.0526229441165924e-02 -5.4368048906326294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 1.5737174544483423e-03</internalNodes>
+          <leafValues>
+            -1.1744406074285507e-01 3.0534917116165161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.6838097944855690e-03</internalNodes>
+          <leafValues>
+            6.6153712570667267e-02 -5.9224641323089600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 3.2287575304508209e-03</internalNodes>
+          <leafValues>
+            5.2678912878036499e-02 -5.7474386692047119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 -3.1512752175331116e-03</internalNodes>
+          <leafValues>
+            3.7773844599723816e-01 -8.7322145700454712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 8.2073279190808535e-04</internalNodes>
+          <leafValues>
+            -1.0513201355934143e-01 3.4025487303733826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 2.8983387164771557e-03</internalNodes>
+          <leafValues>
+            5.1720291376113892e-02 -6.5431916713714600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 -5.7246205396950245e-03</internalNodes>
+          <leafValues>
+            -7.8483843803405762e-01 3.5195719450712204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -1.1572695337235928e-02</internalNodes>
+          <leafValues>
+            -6.7286187410354614e-01 3.5210411995649338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -1.4562263153493404e-02</internalNodes>
+          <leafValues>
+            2.4655815958976746e-01 -1.2278749793767929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 7.8490225132554770e-04</internalNodes>
+          <leafValues>
+            -1.4652141928672791e-01 3.0276218056678772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -1.4289810787886381e-03</internalNodes>
+          <leafValues>
+            1.8906314671039581e-01 -1.5791040658950806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -9.4615388661623001e-03</internalNodes>
+          <leafValues>
+            -6.9036215543746948e-01 3.9911076426506042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 2.3225568234920502e-02</internalNodes>
+          <leafValues>
+            5.0278317183256149e-02 -5.2323836088180542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 1.4046948403120041e-02</internalNodes>
+          <leafValues>
+            -7.9005211591720581e-02 4.0158179402351379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 3.7851710803806782e-03</internalNodes>
+          <leafValues>
+            -1.3530673086643219e-01 2.1973098814487457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -3.6725951358675957e-03</internalNodes>
+          <leafValues>
+            1.9924460351467133e-01 -1.5001934766769409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 -3.1669549643993378e-03</internalNodes>
+          <leafValues>
+            -4.2041611671447754e-01 7.4019186198711395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 -1.3667810708284378e-02</internalNodes>
+          <leafValues>
+            2.5204744935035706e-01 -1.2807497382164001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -3.5862527787685394e-02</internalNodes>
+          <leafValues>
+            3.2997950911521912e-01 -8.9863941073417664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 -6.2667285092175007e-03</internalNodes>
+          <leafValues>
+            -5.5024039745330811e-01 5.7369034737348557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 -6.4383493736386299e-03</internalNodes>
+          <leafValues>
+            3.3817592263221741e-01 -9.3247875571250916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 5.4173925891518593e-03</internalNodes>
+          <leafValues>
+            -1.0427469760179520e-01 2.9482829570770264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -1.5132453292608261e-02</internalNodes>
+          <leafValues>
+            3.2000914216041565e-01 -9.8272062838077545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -1.2513613328337669e-02</internalNodes>
+          <leafValues>
+            2.8962445259094238e-01 -1.2084391713142395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -9.8966564983129501e-03</internalNodes>
+          <leafValues>
+            -5.8358079195022583e-01 5.1291342824697495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 1.3835988938808441e-02</internalNodes>
+          <leafValues>
+            -9.0702146291732788e-02 3.2527267932891846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 3.6492943763732910e-03</internalNodes>
+          <leafValues>
+            8.4720104932785034e-02 -3.4649613499641418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -1.3878188095986843e-02</internalNodes>
+          <leafValues>
+            2.9309025406837463e-01 -9.6585884690284729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 2.8816664125770330e-03</internalNodes>
+          <leafValues>
+            -1.0839603841304779e-01 2.5134062767028809e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 8 -->
+    <_>
+      <maxWeakCount>57</maxWeakCount>
+      <stageThreshold>-1.3757541179656982e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 742 -4.1507836431264877e-03</internalNodes>
+          <leafValues>
+            4.7857573628425598e-01 -1.5079282224178314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -4.2431484907865524e-03</internalNodes>
+          <leafValues>
+            2.7976706624031067e-01 -2.1182695031166077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 7.2727665305137634e-02</internalNodes>
+          <leafValues>
+            -1.1322361230850220e-01 4.6931907534599304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 7.3349894955754280e-03</internalNodes>
+          <leafValues>
+            -2.2507375478744507e-01 2.3486614227294922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 -1.3757663965225220e-01</internalNodes>
+          <leafValues>
+            5.5153369903564453e-01 -8.4895148873329163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 6.8098353222012520e-04</internalNodes>
+          <leafValues>
+            -1.7585472762584686e-01 2.2849111258983612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 2.7579340338706970e-01</internalNodes>
+          <leafValues>
+            -1.1671220511198044e-01 3.2674804329872131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 5.4910051403567195e-04</internalNodes>
+          <leafValues>
+            -2.0603717863559723e-01 1.8896938860416412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 -5.5065844208002090e-03</internalNodes>
+          <leafValues>
+            -5.7701790332794189e-01 6.9212622940540314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 -8.3996364846825600e-03</internalNodes>
+          <leafValues>
+            4.6683028340339661e-01 -7.4202880263328552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 -1.1010931339114904e-03</internalNodes>
+          <leafValues>
+            1.9711431860923767e-01 -1.7736457288265228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -4.4837296009063721e-03</internalNodes>
+          <leafValues>
+            -6.0108631849288940e-01 4.9327563494443893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 2.5086081586778164e-03</internalNodes>
+          <leafValues>
+            6.9480538368225098e-02 -4.8671180009841919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 1.5808893367648125e-03</internalNodes>
+          <leafValues>
+            -1.0519328713417053e-01 3.2050549983978271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 1.4971228083595634e-03</internalNodes>
+          <leafValues>
+            -8.4364958107471466e-02 4.3016371130943298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 -2.6089220773428679e-03</internalNodes>
+          <leafValues>
+            -4.2146065831184387e-01 8.8990658521652222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -7.7147269621491432e-03</internalNodes>
+          <leafValues>
+            -6.6330111026763916e-01 5.0671890377998352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 -1.7141735181212425e-02</internalNodes>
+          <leafValues>
+            -4.8750495910644531e-01 5.6981299072504044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 1.3850606046617031e-02</internalNodes>
+          <leafValues>
+            7.4964463710784912e-02 -4.4079580903053284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -1.4932476915419102e-03</internalNodes>
+          <leafValues>
+            3.1057041883468628e-01 -1.0369800031185150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -8.3094676956534386e-03</internalNodes>
+          <leafValues>
+            2.2514784336090088e-01 -1.4621259272098541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -7.2969077154994011e-04</internalNodes>
+          <leafValues>
+            2.6934301853179932e-01 -1.2512375414371490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -1.3652374967932701e-02</internalNodes>
+          <leafValues>
+            -4.9215099215507507e-01 7.3141731321811676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 9.4011947512626648e-03</internalNodes>
+          <leafValues>
+            4.1364993900060654e-02 -6.5001028776168823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 4.0921592153608799e-03</internalNodes>
+          <leafValues>
+            4.0478449314832687e-02 -5.9830683469772339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 1.5591707779094577e-03</internalNodes>
+          <leafValues>
+            -9.3049824237823486e-02 3.1007137894630432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 3.4408085048198700e-03</internalNodes>
+          <leafValues>
+            4.7337688505649567e-02 -6.5880972146987915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 -1.3411687687039375e-03</internalNodes>
+          <leafValues>
+            2.8307750821113586e-01 -1.0693576931953430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -5.7181939482688904e-03</internalNodes>
+          <leafValues>
+            -4.7754487395286560e-01 6.3519261777400970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -5.0096530467271805e-03</internalNodes>
+          <leafValues>
+            -6.1091655492782593e-01 3.9555240422487259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -4.1508115828037262e-03</internalNodes>
+          <leafValues>
+            2.1694649755954742e-01 -1.3193054497241974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 -1.6968715935945511e-02</internalNodes>
+          <leafValues>
+            2.7644789218902588e-01 -1.0202119499444962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 1.0276203043758869e-02</internalNodes>
+          <leafValues>
+            -9.0598084032535553e-02 2.9703584313392639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -1.8649294506758451e-03</internalNodes>
+          <leafValues>
+            2.8791305422782898e-01 -9.2735975980758667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 3.3354205079376698e-03</internalNodes>
+          <leafValues>
+            5.3746312856674194e-02 -5.0940161943435669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -1.4105688314884901e-03</internalNodes>
+          <leafValues>
+            2.4489782750606537e-01 -1.1008579283952713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 2.3928448557853699e-02</internalNodes>
+          <leafValues>
+            5.2839644253253937e-02 -4.9896511435508728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -3.8580424152314663e-03</internalNodes>
+          <leafValues>
+            -4.8197838664054871e-01 5.3767576813697815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -3.0590491369366646e-03</internalNodes>
+          <leafValues>
+            -5.2978992462158203e-01 4.6741079539060593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -2.9391471762210131e-03</internalNodes>
+          <leafValues>
+            -3.4711557626724243e-01 6.9464050233364105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 -7.0184348151087761e-03</internalNodes>
+          <leafValues>
+            3.1962895393371582e-01 -8.3362981677055359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 1.0384586639702320e-03</internalNodes>
+          <leafValues>
+            -1.0797444730997086e-01 2.4896475672721863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 -8.0418614670634270e-03</internalNodes>
+          <leafValues>
+            -7.3527222871780396e-01 3.6740459501743317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -3.1738542020320892e-02</internalNodes>
+          <leafValues>
+            2.6166516542434692e-01 -1.0992183536291122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 3.6780342459678650e-02</internalNodes>
+          <leafValues>
+            -8.7741106748580933e-02 3.7106978893280029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -6.4193591475486755e-02</internalNodes>
+          <leafValues>
+            3.1807181239128113e-01 -8.8648937642574310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 3.4801474213600159e-01</internalNodes>
+          <leafValues>
+            -5.5967021733522415e-02 5.3631168603897095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 7.5712919235229492e-02</internalNodes>
+          <leafValues>
+            -5.9786085039377213e-02 4.1973164677619934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 7.8374873846769333e-03</internalNodes>
+          <leafValues>
+            -6.8252839148044586e-02 3.9001336693763733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 3.3967243507504463e-03</internalNodes>
+          <leafValues>
+            5.7270396500825882e-02 -4.7492286562919617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 3.2095968723297119e-02</internalNodes>
+          <leafValues>
+            3.0982470139861107e-02 -7.2973543405532837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 4.1734268888831139e-03</internalNodes>
+          <leafValues>
+            3.0397623777389526e-02 -6.8009066581726074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 3.2336891163140535e-03</internalNodes>
+          <leafValues>
+            -9.4194613397121429e-02 2.5351443886756897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -3.8070861250162125e-02</internalNodes>
+          <leafValues>
+            2.7447724342346191e-01 -8.3862110972404480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 4.6657784841954708e-03</internalNodes>
+          <leafValues>
+            3.7179920822381973e-02 -6.7654901742935181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -3.9379103109240532e-03</internalNodes>
+          <leafValues>
+            -5.9923279285430908e-01 3.2963614910840988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -4.8031057231128216e-03</internalNodes>
+          <leafValues>
+            2.2248022258281708e-01 -1.0560184717178345e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 9 -->
+    <_>
+      <maxWeakCount>55</maxWeakCount>
+      <stageThreshold>-1.3843152523040771e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 456 6.7532630637288094e-03</internalNodes>
+          <leafValues>
+            -1.5934121608734131e-01 5.1630091667175293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 1.6582473181188107e-03</internalNodes>
+          <leafValues>
+            -1.4192129671573639e-01 4.6970281004905701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 8.5381623357534409e-03</internalNodes>
+          <leafValues>
+            -1.4064009487628937e-01 4.3454051017761230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 -5.8347072452306747e-02</internalNodes>
+          <leafValues>
+            4.8053690791130066e-01 -1.1435888707637787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 7.5503322295844555e-04</internalNodes>
+          <leafValues>
+            -1.6613751649856567e-01 3.5059270262718201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -1.6263198340311646e-03</internalNodes>
+          <leafValues>
+            3.3983412384986877e-01 -1.2952369451522827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 -4.9476943910121918e-02</internalNodes>
+          <leafValues>
+            5.1085108518600464e-01 -7.6757252216339111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 1.5736839268356562e-03</internalNodes>
+          <leafValues>
+            -9.8503805696964264e-02 4.2097148299217224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 2.8940830379724503e-03</internalNodes>
+          <leafValues>
+            8.0476768314838409e-02 -5.9272909164428711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 -8.5198890883475542e-04</internalNodes>
+          <leafValues>
+            2.7713751792907715e-01 -1.2991340458393097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 -3.2718123402446508e-03</internalNodes>
+          <leafValues>
+            3.1215441226959229e-01 -1.2980756163597107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 6.0219354927539825e-03</internalNodes>
+          <leafValues>
+            7.2135269641876221e-02 -5.9813290834426880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 2.3065296933054924e-02</internalNodes>
+          <leafValues>
+            7.1330830454826355e-02 -5.3722465038299561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 2.7176631192560308e-05</internalNodes>
+          <leafValues>
+            -2.6853099465370178e-01 1.4315985143184662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 5.4575498215854168e-03</internalNodes>
+          <leafValues>
+            5.5034745484590530e-02 -5.7176333665847778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 2.5911496777553111e-05</internalNodes>
+          <leafValues>
+            -2.3133303225040436e-01 1.4060766994953156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 2.1752633154392242e-02</internalNodes>
+          <leafValues>
+            5.9929180890321732e-02 -5.0224888324737549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 3.5099866800010204e-03</internalNodes>
+          <leafValues>
+            4.7387380152940750e-02 -5.8126205205917358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 8.6558861657977104e-03</internalNodes>
+          <leafValues>
+            -1.3651072978973389e-01 2.2407715022563934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 3.0432851053774357e-03</internalNodes>
+          <leafValues>
+            5.7905938476324081e-02 -5.5585581064224243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 3.4083288628607988e-03</internalNodes>
+          <leafValues>
+            4.6358574181795120e-02 -5.6204903125762939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -4.1327420622110367e-03</internalNodes>
+          <leafValues>
+            -4.3748503923416138e-01 6.6312022507190704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 5.4382300004363060e-04</internalNodes>
+          <leafValues>
+            -1.2188895046710968e-01 2.6694831252098083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 2.0359107293188572e-03</internalNodes>
+          <leafValues>
+            -6.9375663995742798e-02 4.1734528541564941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 5.6087510893121362e-04</internalNodes>
+          <leafValues>
+            -1.2235503643751144e-01 2.9018589854240417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 5.4084453731775284e-03</internalNodes>
+          <leafValues>
+            5.1494579762220383e-02 -6.3784217834472656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 1.9748538732528687e-02</internalNodes>
+          <leafValues>
+            -7.0414997637271881e-02 4.8995351791381836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 -2.0231239497661591e-02</internalNodes>
+          <leafValues>
+            -5.9452813863754272e-01 5.5317912250757217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 -8.5184378549456596e-03</internalNodes>
+          <leafValues>
+            -4.9081006646156311e-01 5.1023125648498535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 6.4936149865388870e-03</internalNodes>
+          <leafValues>
+            -8.6577519774436951e-02 3.6036944389343262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 -4.0995404124259949e-02</internalNodes>
+          <leafValues>
+            4.0132537484169006e-01 -7.1912504732608795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 3.1340471468865871e-03</internalNodes>
+          <leafValues>
+            -1.2547470629215240e-01 2.2158138453960419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.9882351160049438e-02</internalNodes>
+          <leafValues>
+            -7.1213179826736450e-01 4.2412471026182175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 2.0461969077587128e-02</internalNodes>
+          <leafValues>
+            -1.0324169695377350e-01 2.9102885723114014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 -1.2761610560119152e-03</internalNodes>
+          <leafValues>
+            2.3810100555419922e-01 -1.1509060114622116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -3.3783772960305214e-03</internalNodes>
+          <leafValues>
+            -5.6838840246200562e-01 5.6331343948841095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 5.0912564620375633e-03</internalNodes>
+          <leafValues>
+            4.7987211495637894e-02 -4.7997272014617920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -4.1752815246582031e-02</internalNodes>
+          <leafValues>
+            -5.9290748834609985e-01 4.2219188064336777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -1.3672109693288803e-02</internalNodes>
+          <leafValues>
+            2.7416154742240906e-01 -9.8633147776126862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 4.5463615097105503e-03</internalNodes>
+          <leafValues>
+            -9.5323033630847931e-02 3.3586710691452026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 -1.1957241222262383e-02</internalNodes>
+          <leafValues>
+            1.6140049695968628e-01 -1.6837921738624573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 -2.4866103194653988e-03</internalNodes>
+          <leafValues>
+            -3.8348227739334106e-01 6.6880211234092712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 3.3222150523215532e-03</internalNodes>
+          <leafValues>
+            4.9669362604618073e-02 -5.2419567108154297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 1.2700627557933331e-03</internalNodes>
+          <leafValues>
+            -1.0981336981058121e-01 2.4314954876899719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -4.0526064112782478e-03</internalNodes>
+          <leafValues>
+            -5.4617625474929810e-01 4.6236973255872726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -1.7611857037991285e-03</internalNodes>
+          <leafValues>
+            2.0527404546737671e-01 -1.1924317479133606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 -2.8845192864537239e-03</internalNodes>
+          <leafValues>
+            2.0061042904853821e-01 -1.4499643445014954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -9.4242449849843979e-03</internalNodes>
+          <leafValues>
+            -7.2513866424560547e-01 3.4894362092018127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 3.7029895465821028e-03</internalNodes>
+          <leafValues>
+            5.5003125220537186e-02 -4.1173446178436279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -8.4825151134282351e-04</internalNodes>
+          <leafValues>
+            2.6719486713409424e-01 -9.9083028733730316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 1.5727356076240540e-02</internalNodes>
+          <leafValues>
+            -1.2551975250244141e-01 2.0588764548301697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 5.9068910777568817e-03</internalNodes>
+          <leafValues>
+            6.0179408639669418e-02 -4.1827461123466492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 -3.9538964629173279e-02</internalNodes>
+          <leafValues>
+            3.4726879000663757e-01 -7.4968926608562469e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 4.7501657158136368e-02</internalNodes>
+          <leafValues>
+            -7.6978117227554321e-02 3.5068345069885254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -5.9454172151163220e-04</internalNodes>
+          <leafValues>
+            1.6073931753635406e-01 -1.5279982984066010e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 10 -->
+    <_>
+      <maxWeakCount>58</maxWeakCount>
+      <stageThreshold>-1.2862224578857422e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 882 -1.3625519350171089e-02</internalNodes>
+          <leafValues>
+            5.0128185749053955e-01 -1.1663150042295456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -2.2920668125152588e-03</internalNodes>
+          <leafValues>
+            3.9538189768791199e-01 -1.3872602581977844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 1.0770710650831461e-03</internalNodes>
+          <leafValues>
+            -1.7133137583732605e-01 3.1510788202285767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 -1.2591466307640076e-02</internalNodes>
+          <leafValues>
+            3.9579889178276062e-01 -1.4279782772064209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -4.7927081584930420e-02</internalNodes>
+          <leafValues>
+            -4.9305588006973267e-01 5.6685980409383774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -2.5895023718476295e-03</internalNodes>
+          <leafValues>
+            1.6586430370807648e-01 -2.2577352821826935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 9.8585948348045349e-02</internalNodes>
+          <leafValues>
+            -7.2541341185569763e-02 5.3971153497695923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 7.2299325838685036e-03</internalNodes>
+          <leafValues>
+            7.2869211435317993e-02 -6.0541796684265137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 -6.0262705665081739e-04</internalNodes>
+          <leafValues>
+            2.7961328625679016e-01 -1.3374039530754089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 5.3171166218817234e-03</internalNodes>
+          <leafValues>
+            6.1562143266201019e-02 -5.3435516357421875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -7.3790093883872032e-03</internalNodes>
+          <leafValues>
+            -5.8770626783370972e-01 5.2599798887968063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 2.2994203027337790e-04</internalNodes>
+          <leafValues>
+            -2.2165967524051666e-01 1.6663813591003418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -2.7968082576990128e-03</internalNodes>
+          <leafValues>
+            -4.5023602247238159e-01 6.7983791232109070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -4.4262632727622986e-03</internalNodes>
+          <leafValues>
+            -5.4457426071166992e-01 5.3928002715110779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 -6.1236601322889328e-03</internalNodes>
+          <leafValues>
+            2.9386061429977417e-01 -1.0868654400110245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 6.1672870069742203e-03</internalNodes>
+          <leafValues>
+            6.7409984767436981e-02 -4.2896196246147156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 1.5454929322004318e-02</internalNodes>
+          <leafValues>
+            -9.3371987342834473e-02 3.2237896323204041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -5.5358107201755047e-03</internalNodes>
+          <leafValues>
+            -6.3797932863235474e-01 4.7232467681169510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -5.8793288189917803e-04</internalNodes>
+          <leafValues>
+            2.6480975747108459e-01 -1.1852940917015076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 1.2575921136885881e-03</internalNodes>
+          <leafValues>
+            -1.2490244954824448e-01 2.8103300929069519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 3.3034523949027061e-03</internalNodes>
+          <leafValues>
+            6.2105692923069000e-02 -4.5968556404113770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 -2.6582641527056694e-02</internalNodes>
+          <leafValues>
+            -5.0849837064743042e-01 5.3966015577316284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 2.7427850291132927e-02</internalNodes>
+          <leafValues>
+            5.2529457956552505e-02 -5.3614085912704468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 -2.1938718855381012e-03</internalNodes>
+          <leafValues>
+            -5.6713318824768066e-01 4.6497207134962082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 8.5861550178378820e-04</internalNodes>
+          <leafValues>
+            -1.1162154376506805e-01 2.8105884790420532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -8.4925384726375341e-04</internalNodes>
+          <leafValues>
+            3.1280112266540527e-01 -1.2138028442859650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 2.9905270785093307e-03</internalNodes>
+          <leafValues>
+            6.1607286334037781e-02 -5.1581907272338867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 5.8231391012668610e-03</internalNodes>
+          <leafValues>
+            4.7376025468111038e-02 -5.1492005586624146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 4.2811138555407524e-03</internalNodes>
+          <leafValues>
+            3.2761037349700928e-02 -6.7820072174072266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 9.5272483304142952e-04</internalNodes>
+          <leafValues>
+            -1.5452747046947479e-01 1.7837351560592651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -2.7698231860995293e-04</internalNodes>
+          <leafValues>
+            1.8924367427825928e-01 -1.3868112862110138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 3.0586202628910542e-03</internalNodes>
+          <leafValues>
+            5.3298473358154297e-02 -4.7908756136894226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 2.0293965935707092e-03</internalNodes>
+          <leafValues>
+            3.1667634844779968e-02 -6.7199909687042236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -1.8073513638228178e-03</internalNodes>
+          <leafValues>
+            -6.4894622564315796e-01 3.3469315618276596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 -1.1197938583791256e-03</internalNodes>
+          <leafValues>
+            2.2734998166561127e-01 -1.1382233351469040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 1.2703117681667209e-03</internalNodes>
+          <leafValues>
+            -9.7680233418941498e-02 2.9997348785400391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -1.8036495894193649e-03</internalNodes>
+          <leafValues>
+            2.3566392064094543e-01 -1.1566326767206192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 2.3318463936448097e-03</internalNodes>
+          <leafValues>
+            5.5787801742553711e-02 -4.4648987054824829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 1.8485619220882654e-03</internalNodes>
+          <leafValues>
+            -1.0420991480350494e-01 2.4521166086196899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 8.2633290439844131e-03</internalNodes>
+          <leafValues>
+            5.3129263222217560e-02 -4.8460647463798523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 2.7392050469643436e-05</internalNodes>
+          <leafValues>
+            -1.7487643659114838e-01 1.3620604574680328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 2.6163433212786913e-03</internalNodes>
+          <leafValues>
+            -9.9586494266986847e-02 2.4075058102607727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 3.6149267107248306e-03</internalNodes>
+          <leafValues>
+            4.2312353849411011e-02 -5.5195075273513794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 1.4812931418418884e-02</internalNodes>
+          <leafValues>
+            -6.7619144916534424e-02 3.7573158740997314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -2.8877586591988802e-03</internalNodes>
+          <leafValues>
+            -5.3493702411651611e-01 5.1065266132354736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 3.5591312916949391e-04</internalNodes>
+          <leafValues>
+            -1.2231220304965973e-01 1.9974029064178467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 -1.0347569361329079e-02</internalNodes>
+          <leafValues>
+            -6.3408315181732178e-01 4.0167611092329025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -4.4028884731233120e-03</internalNodes>
+          <leafValues>
+            -5.1359844207763672e-01 4.3052427470684052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 -1.6173283802345395e-03</internalNodes>
+          <leafValues>
+            1.4859439432621002e-01 -1.4985026419162750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 -3.1839800067245960e-03</internalNodes>
+          <leafValues>
+            -4.1493499279022217e-01 6.0393124818801880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 -7.9784039407968521e-03</internalNodes>
+          <leafValues>
+            2.8296649456024170e-01 -8.6312569677829742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 2.8750954661518335e-03</internalNodes>
+          <leafValues>
+            -6.7822508513927460e-02 3.2967612147331238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -1.1433581821620464e-03</internalNodes>
+          <leafValues>
+            -3.4375748038291931e-01 6.8774074316024780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 1.7783213406801224e-03</internalNodes>
+          <leafValues>
+            -8.8273152709007263e-02 2.6904863119125366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -6.3564153388142586e-03</internalNodes>
+          <leafValues>
+            3.4165042638778687e-01 -7.6342806220054626e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 5.8753319084644318e-02</internalNodes>
+          <leafValues>
+            3.6884155124425888e-02 -7.0002478361129761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -1.2118986342102289e-03</internalNodes>
+          <leafValues>
+            1.8067996203899384e-01 -1.2888990342617035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -3.4786794334650040e-02</internalNodes>
+          <leafValues>
+            2.8380703926086426e-01 -1.0494612902402878e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 11 -->
+    <_>
+      <maxWeakCount>61</maxWeakCount>
+      <stageThreshold>-1.3526766300201416e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 875 9.3241240829229355e-03</internalNodes>
+          <leafValues>
+            -1.1945860832929611e-01 4.8265087604522705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 -4.0869116783142090e-03</internalNodes>
+          <leafValues>
+            2.7903670072555542e-01 -2.3448269069194794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 8.3140000700950623e-02</internalNodes>
+          <leafValues>
+            -8.5437655448913574e-02 5.4905670881271362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 2.6708254590630531e-03</internalNodes>
+          <leafValues>
+            -1.6097296774387360e-01 3.5868695378303528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 2.2817514836788177e-03</internalNodes>
+          <leafValues>
+            -1.6324259340763092e-01 2.3956388235092163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 6.7889376077800989e-04</internalNodes>
+          <leafValues>
+            -2.5205141305923462e-01 1.6190616786479950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 3.1512721907347441e-03</internalNodes>
+          <leafValues>
+            -1.3325424492359161e-01 2.7017220854759216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 5.7821646332740784e-02</internalNodes>
+          <leafValues>
+            -6.7158013582229614e-02 4.1875806450843811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 2.8442896902561188e-02</internalNodes>
+          <leafValues>
+            5.5711831897497177e-02 -5.8136337995529175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -1.7370734130963683e-03</internalNodes>
+          <leafValues>
+            -6.7132610082626343e-01 3.2464105635881424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -1.9680276513099670e-02</internalNodes>
+          <leafValues>
+            3.9044600725173950e-01 -8.8745564222335815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 1.0001409798860550e-02</internalNodes>
+          <leafValues>
+            -1.5947268903255463e-01 2.7087828516960144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 1.2495646951720119e-03</internalNodes>
+          <leafValues>
+            8.3702936768531799e-02 -4.6324184536933899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 3.0510198324918747e-02</internalNodes>
+          <leafValues>
+            -1.0709584504365921e-01 3.2648065686225891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -3.7916197907179594e-03</internalNodes>
+          <leafValues>
+            -6.1073684692382812e-01 4.7788143157958984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 8.5655774455517530e-04</internalNodes>
+          <leafValues>
+            -2.0807541906833649e-01 1.5517778694629669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -3.2812850549817085e-03</internalNodes>
+          <leafValues>
+            -5.8795136213302612e-01 4.5926980674266815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 3.6125673796050251e-04</internalNodes>
+          <leafValues>
+            -1.6806155443191528e-01 1.7441834509372711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 -1.2282358948141336e-03</internalNodes>
+          <leafValues>
+            -4.7641313076019287e-01 5.6790668517351151e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 9.3263220041990280e-03</internalNodes>
+          <leafValues>
+            -7.4045926332473755e-02 3.7817317247390747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 7.4745330493897200e-04</internalNodes>
+          <leafValues>
+            8.0762349069118500e-02 -3.5692575573921204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 7.4315653182566166e-03</internalNodes>
+          <leafValues>
+            -8.5764542222023010e-02 3.2155406475067139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 2.7057509869337082e-02</internalNodes>
+          <leafValues>
+            6.9296583533287048e-02 -4.2836430668830872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 3.9283365011215210e-02</internalNodes>
+          <leafValues>
+            -1.0806435346603394e-01 2.9007008671760559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -3.4139624238014221e-01</internalNodes>
+          <leafValues>
+            5.0227731466293335e-01 -6.3795588910579681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -1.8172953277826309e-02</internalNodes>
+          <leafValues>
+            2.7207729220390320e-01 -1.0322675853967667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 1.5265008434653282e-02</internalNodes>
+          <leafValues>
+            -1.0788526386022568e-01 2.4405729770660400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.4973650686442852e-03</internalNodes>
+          <leafValues>
+            2.8644701838493347e-01 -1.0436929017305374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 2.1207414101809263e-03</internalNodes>
+          <leafValues>
+            4.5713264495134354e-02 -6.6571021080017090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 1.3393461704254150e-02</internalNodes>
+          <leafValues>
+            -8.4284797310829163e-02 3.6480179429054260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 9.7873376216739416e-04</internalNodes>
+          <leafValues>
+            -1.2960052490234375e-01 2.2095513343811035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 -4.9731796607375145e-03</internalNodes>
+          <leafValues>
+            2.7467787265777588e-01 -1.0236363112926483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -7.9883169382810593e-03</internalNodes>
+          <leafValues>
+            -5.3638678789138794e-01 5.3369920700788498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 2.3855306208133698e-03</internalNodes>
+          <leafValues>
+            5.4967612028121948e-02 -4.2117682099342346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -3.0849636532366276e-03</internalNodes>
+          <leafValues>
+            2.6192533969879150e-01 -9.4207443296909332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 4.3416069820523262e-03</internalNodes>
+          <leafValues>
+            -1.5543100237846375e-01 1.6663897037506104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 3.8728015497326851e-03</internalNodes>
+          <leafValues>
+            4.9280565232038498e-02 -4.9337747693061829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 1.8099667504429817e-03</internalNodes>
+          <leafValues>
+            4.2697191238403320e-02 -5.2748012542724609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -3.3727339468896389e-03</internalNodes>
+          <leafValues>
+            2.0491680502891541e-01 -1.2846539914608002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 3.1393815297633410e-03</internalNodes>
+          <leafValues>
+            -7.3090612888336182e-02 3.4941059350967407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 3.2568261958658695e-03</internalNodes>
+          <leafValues>
+            4.5729346573352814e-02 -5.7302659749984741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 -2.0513155031949282e-03</internalNodes>
+          <leafValues>
+            -5.4655516147613525e-01 3.8907390087842941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -2.7090720832347870e-03</internalNodes>
+          <leafValues>
+            -5.2781039476394653e-01 3.8093525916337967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -3.6282267421483994e-02</internalNodes>
+          <leafValues>
+            -5.8760797977447510e-01 3.4759882837533951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 3.7925848737359047e-03</internalNodes>
+          <leafValues>
+            -8.5966393351554871e-02 2.6226586103439331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -3.7565450184047222e-03</internalNodes>
+          <leafValues>
+            -5.7828390598297119e-01 3.9440535008907318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -7.8137982636690140e-03</internalNodes>
+          <leafValues>
+            3.5042202472686768e-01 -6.6597603261470795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 -3.1100357882678509e-03</internalNodes>
+          <leafValues>
+            1.8389418721199036e-01 -1.4107073843479156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 9.1797057539224625e-03</internalNodes>
+          <leafValues>
+            -6.2711343169212341e-02 3.4819519519805908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -2.9698751866817474e-02</internalNodes>
+          <leafValues>
+            2.8956320881843567e-01 -8.5679493844509125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 7.9502481967210770e-03</internalNodes>
+          <leafValues>
+            3.9165180176496506e-02 -6.0753583908081055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 2.2064188960939646e-03</internalNodes>
+          <leafValues>
+            3.5431943833827972e-02 -5.5480444431304932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -3.1044434756040573e-02</internalNodes>
+          <leafValues>
+            -6.2628567218780518e-01 3.1049268320202827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 0 -1.3199620880186558e-03</internalNodes>
+          <leafValues>
+            1.5564316511154175e-01 -1.3879336416721344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -9.6068280981853604e-04</internalNodes>
+          <leafValues>
+            1.9332279264926910e-01 -1.1179215461015701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 7.4608568102121353e-03</internalNodes>
+          <leafValues>
+            5.7219974696636200e-02 -4.2135125398635864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -4.3320422992110252e-03</internalNodes>
+          <leafValues>
+            -6.8079024553298950e-01 2.9504306614398956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -6.5548438578844070e-03</internalNodes>
+          <leafValues>
+            2.9043409228324890e-01 -8.7089523673057556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 4.2611984536051750e-03</internalNodes>
+          <leafValues>
+            -8.5929870605468750e-02 3.1930494308471680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 -7.2978977113962173e-03</internalNodes>
+          <leafValues>
+            1.4620631933212280e-01 -1.7617914080619812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -2.2543172817677259e-03</internalNodes>
+          <leafValues>
+            -5.9305733442306519e-01 3.9764832705259323e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 12 -->
+    <_>
+      <maxWeakCount>70</maxWeakCount>
+      <stageThreshold>-1.3067549467086792e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 742 -5.6160744279623032e-03</internalNodes>
+          <leafValues>
+            4.7913768887519836e-01 -9.8717339336872101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 -5.6263338774442673e-03</internalNodes>
+          <leafValues>
+            2.8639736771583557e-01 -1.7997759580612183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -1.6268140170723200e-03</internalNodes>
+          <leafValues>
+            3.0874463915824890e-01 -1.3907180726528168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 -1.3920383062213659e-03</internalNodes>
+          <leafValues>
+            3.2034638524055481e-01 -1.3876211643218994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 3.4234612248837948e-03</internalNodes>
+          <leafValues>
+            -1.0860712081193924e-01 3.2174232602119446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 4.3767906725406647e-02</internalNodes>
+          <leafValues>
+            -1.3255064189434052e-01 3.7021124362945557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 -4.4696494005620480e-03</internalNodes>
+          <leafValues>
+            -4.5687621831893921e-01 8.2243621349334717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 -7.1945399977266788e-03</internalNodes>
+          <leafValues>
+            -6.4334297180175781e-01 4.5623987913131714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 6.5287351608276367e-03</internalNodes>
+          <leafValues>
+            -8.9336074888706207e-02 3.3727860450744629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 2.8297028038650751e-03</internalNodes>
+          <leafValues>
+            -1.0177894681692123e-01 3.5831856727600098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 1.1526069603860378e-02</internalNodes>
+          <leafValues>
+            7.5238041579723358e-02 -4.8319393396377563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 4.7937319613993168e-03</internalNodes>
+          <leafValues>
+            5.7682428508996964e-02 -4.7086900472640991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -3.6777029745280743e-03</internalNodes>
+          <leafValues>
+            -4.2743790149688721e-01 7.4363298714160919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 -8.0760312266647816e-04</internalNodes>
+          <leafValues>
+            1.4320656657218933e-01 -1.9929704070091248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 3.7253312766551971e-03</internalNodes>
+          <leafValues>
+            5.2736207842826843e-02 -5.2105212211608887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -2.3560712113976479e-02</internalNodes>
+          <leafValues>
+            4.0658730268478394e-01 -7.3024936020374298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 -4.5593185350298882e-03</internalNodes>
+          <leafValues>
+            -6.3590377569198608e-01 3.5127460956573486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -2.4863984435796738e-03</internalNodes>
+          <leafValues>
+            -4.5599257946014404e-01 5.3035512566566467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 -2.6802124921232462e-03</internalNodes>
+          <leafValues>
+            1.9116453826427460e-01 -1.3404799997806549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -7.7647715806961060e-02</internalNodes>
+          <leafValues>
+            4.1297465562820435e-01 -6.3970938324928284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 2.3329094983637333e-03</internalNodes>
+          <leafValues>
+            -1.2160944193601608e-01 2.3117628693580627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 -6.6609308123588562e-03</internalNodes>
+          <leafValues>
+            2.2600707411766052e-01 -1.2069495767354965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -5.0821684300899506e-02</internalNodes>
+          <leafValues>
+            3.2217630743980408e-01 -7.6335281133651733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -7.0379404351115227e-03</internalNodes>
+          <leafValues>
+            1.8399104475975037e-01 -1.4812190830707550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -3.3276520669460297e-02</internalNodes>
+          <leafValues>
+            -6.0358065366744995e-01 3.5330448299646378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 7.5909225270152092e-03</internalNodes>
+          <leafValues>
+            3.1779482960700989e-02 -6.4767998456954956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -5.6639023125171661e-02</internalNodes>
+          <leafValues>
+            -4.6455994248390198e-01 4.6072337776422501e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 3.7777128163725138e-03</internalNodes>
+          <leafValues>
+            5.7451672852039337e-02 -3.7793967127799988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 8.9145395904779434e-03</internalNodes>
+          <leafValues>
+            -7.5942978262901306e-02 3.1487807631492615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -1.4818884432315826e-02</internalNodes>
+          <leafValues>
+            2.7122247219085693e-01 -9.8314434289932251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 -5.5922558531165123e-03</internalNodes>
+          <leafValues>
+            -6.4762401580810547e-01 4.1314963251352310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 3.1491921981796622e-04</internalNodes>
+          <leafValues>
+            -1.4864055812358856e-01 1.4411780238151550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -5.7063563726842403e-03</internalNodes>
+          <leafValues>
+            -4.6024248003959656e-01 4.7999884933233261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -1.2257394846528769e-03</internalNodes>
+          <leafValues>
+            3.2288366556167603e-01 -7.0425607264041901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -1.6291948035359383e-02</internalNodes>
+          <leafValues>
+            2.7573275566101074e-01 -8.3055868744850159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -8.1639690324664116e-04</internalNodes>
+          <leafValues>
+            1.7044979333877563e-01 -1.4129574596881866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 5.1114819943904877e-03</internalNodes>
+          <leafValues>
+            3.3882420510053635e-02 -6.9941717386245728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 -2.8371806256473064e-03</internalNodes>
+          <leafValues>
+            -3.7707236409187317e-01 5.7759616523981094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 5.3479857742786407e-03</internalNodes>
+          <leafValues>
+            4.1541736572980881e-02 -4.8687714338302612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 1.1360908392816782e-03</internalNodes>
+          <leafValues>
+            -7.8717894852161407e-02 2.9692038893699646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 1.4100213302299380e-03</internalNodes>
+          <leafValues>
+            4.3843001127243042e-02 -5.1339787244796753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 8.7079760851338506e-04</internalNodes>
+          <leafValues>
+            -9.8695866763591766e-02 2.2730629146099091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -5.4065873846411705e-03</internalNodes>
+          <leafValues>
+            -6.3011974096298218e-01 3.7802927196025848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -1.6894804313778877e-02</internalNodes>
+          <leafValues>
+            -5.0091201066970825e-01 3.5215172916650772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 1.4164673630148172e-03</internalNodes>
+          <leafValues>
+            -8.8441111147403717e-02 2.4102251231670380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 -1.1464871931821108e-03</internalNodes>
+          <leafValues>
+            1.9273723661899567e-01 -1.1090471595525742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -3.2706123311072588e-03</internalNodes>
+          <leafValues>
+            -4.5202803611755371e-01 4.7059688717126846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 1.1416582390666008e-02</internalNodes>
+          <leafValues>
+            2.6714416220784187e-02 -6.9660711288452148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 2.7643535286188126e-03</internalNodes>
+          <leafValues>
+            4.7252438962459564e-02 -3.9458727836608887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 2.4567130021750927e-03</internalNodes>
+          <leafValues>
+            -7.5188823044300079e-02 2.9944056272506714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 -7.3516201227903366e-03</internalNodes>
+          <leafValues>
+            2.8476437926292419e-01 -9.2367134988307953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 -4.3670929968357086e-02</internalNodes>
+          <leafValues>
+            -6.8588620424270630e-01 3.3353023231029510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 -6.4992159605026245e-02</internalNodes>
+          <leafValues>
+            -7.9678738117218018e-01 2.0331909880042076e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -1.1700032278895378e-02</internalNodes>
+          <leafValues>
+            -6.1183351278305054e-01 2.7328895404934883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 3.0743866227567196e-03</internalNodes>
+          <leafValues>
+            -7.7295452356338501e-02 2.6685911417007446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -1.5546076931059361e-02</internalNodes>
+          <leafValues>
+            -5.5246621370315552e-01 4.0912687778472900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 6.5568592399358749e-03</internalNodes>
+          <leafValues>
+            -1.0432150214910507e-01 1.9379787147045135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -8.0047458410263062e-02</internalNodes>
+          <leafValues>
+            3.9228948950767517e-01 -5.2565738558769226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 1.5684183686971664e-02</internalNodes>
+          <leafValues>
+            -1.1151826381683350e-01 1.8633136153221130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 2.3603178560733795e-03</internalNodes>
+          <leafValues>
+            -1.0219112038612366e-01 2.0333246886730194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -3.5169085022062063e-03</internalNodes>
+          <leafValues>
+            2.7427124977111816e-01 -8.6362943053245544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 9.4871241599321365e-03</internalNodes>
+          <leafValues>
+            3.5626750439405441e-02 -6.2631088495254517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 -9.3261618167161942e-03</internalNodes>
+          <leafValues>
+            -7.1806514263153076e-01 2.4241568520665169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -6.3302312046289444e-03</internalNodes>
+          <leafValues>
+            2.1094995737075806e-01 -9.2475786805152893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 -2.8244811110198498e-03</internalNodes>
+          <leafValues>
+            2.6596403121948242e-01 -8.0099694430828094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -1.1591307818889618e-02</internalNodes>
+          <leafValues>
+            2.3619163036346436e-01 -8.5169024765491486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 2.1401243284344673e-03</internalNodes>
+          <leafValues>
+            -1.0995808988809586e-01 2.1230246126651764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 4.2046746239066124e-03</internalNodes>
+          <leafValues>
+            3.6688093096017838e-02 -6.1654287576675415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 1.1085141450166702e-03</internalNodes>
+          <leafValues>
+            -8.0656312406063080e-02 2.7754181623458862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 -8.2805287092924118e-03</internalNodes>
+          <leafValues>
+            -6.5883606672286987e-01 3.6048211157321930e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 13 -->
+    <_>
+      <maxWeakCount>70</maxWeakCount>
+      <stageThreshold>-1.2368309497833252e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 716 -3.3105849288403988e-03</internalNodes>
+          <leafValues>
+            5.0566112995147705e-01 -8.2956805825233459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 4.5855166390538216e-03</internalNodes>
+          <leafValues>
+            -1.3226345181465149e-01 3.9034894108772278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 -2.6665716432034969e-03</internalNodes>
+          <leafValues>
+            2.7508354187011719e-01 -1.3807572424411774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 1.8106825649738312e-02</internalNodes>
+          <leafValues>
+            -1.2738862633705139e-01 3.5449108481407166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -5.7813120074570179e-03</internalNodes>
+          <leafValues>
+            2.7463605999946594e-01 -1.2951526045799255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 8.9321136474609375e-03</internalNodes>
+          <leafValues>
+            4.8491790890693665e-02 -5.8104276657104492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 6.2806839123368263e-03</internalNodes>
+          <leafValues>
+            -1.3215491175651550e-01 2.1852293610572815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 -4.3670572340488434e-02</internalNodes>
+          <leafValues>
+            3.8786840438842773e-01 -7.4191503226757050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -6.2309622764587402e-02</internalNodes>
+          <leafValues>
+            3.3408007025718689e-01 -8.7087221443653107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 -3.2859744969755411e-03</internalNodes>
+          <leafValues>
+            3.3486780524253845e-01 -8.9008949697017670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -3.9627305231988430e-03</internalNodes>
+          <leafValues>
+            2.6155433058738708e-01 -9.5614455640316010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 1.0877416934818029e-03</internalNodes>
+          <leafValues>
+            -1.4199735224246979e-01 1.8414285778999329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 5.4819821380078793e-03</internalNodes>
+          <leafValues>
+            7.4260123074054718e-02 -5.6989872455596924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 4.9011572264134884e-04</internalNodes>
+          <leafValues>
+            -1.9576059281826019e-01 1.3506270945072174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -7.7052684500813484e-03</internalNodes>
+          <leafValues>
+            -5.0443643331527710e-01 6.1383318156003952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 4.8691947013139725e-03</internalNodes>
+          <leafValues>
+            4.3469026684761047e-02 -5.2802342176437378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 2.4673391599208117e-03</internalNodes>
+          <leafValues>
+            -8.9178681373596191e-02 3.0606627464294434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 -3.6682826466858387e-03</internalNodes>
+          <leafValues>
+            -6.5514552593231201e-01 4.7427203506231308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 2.5194899644702673e-03</internalNodes>
+          <leafValues>
+            4.9365170300006866e-02 -4.0812951326370239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 5.8970693498849869e-03</internalNodes>
+          <leafValues>
+            3.5579398274421692e-02 -6.4191317558288574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 1.7767311073839664e-03</internalNodes>
+          <leafValues>
+            -8.6629316210746765e-02 2.7705979347229004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 4.0457276627421379e-03</internalNodes>
+          <leafValues>
+            5.6002113968133926e-02 -4.7005215287208557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 3.2862280495464802e-03</internalNodes>
+          <leafValues>
+            -1.2930884957313538e-01 2.0613414049148560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 1.4660503948107362e-03</internalNodes>
+          <leafValues>
+            -9.9395424127578735e-02 3.3950179815292358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 1.9015703350305557e-02</internalNodes>
+          <leafValues>
+            6.0197159647941589e-02 -5.1893943548202515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 -7.1178808808326721e-02</internalNodes>
+          <leafValues>
+            -4.3668299913406372e-01 4.7340013086795807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -4.6305771684274077e-04</internalNodes>
+          <leafValues>
+            1.4736598730087280e-01 -1.5406486392021179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -4.7644632868468761e-03</internalNodes>
+          <leafValues>
+            -5.0336647033691406e-01 4.4053792953491211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -8.5318256169557571e-03</internalNodes>
+          <leafValues>
+            -5.9967356920242310e-01 3.2567754387855530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -2.7496295515447855e-03</internalNodes>
+          <leafValues>
+            1.3502316176891327e-01 -1.6025592386722565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 4.2666587978601456e-03</internalNodes>
+          <leafValues>
+            2.5802688673138618e-02 -7.8170543909072876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -2.9856398701667786e-02</internalNodes>
+          <leafValues>
+            2.4982222914695740e-01 -8.8180385529994965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 2.2136634215712547e-03</internalNodes>
+          <leafValues>
+            -1.4314906299114227e-01 1.6945528984069824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 1.6336794942617416e-02</internalNodes>
+          <leafValues>
+            4.6008959412574768e-02 -4.9338266253471375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 7.9861842095851898e-03</internalNodes>
+          <leafValues>
+            -1.1460029333829880e-01 1.9282819330692291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 -1.7455726629123092e-03</internalNodes>
+          <leafValues>
+            1.7520657181739807e-01 -1.2269173562526703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -6.2451506964862347e-03</internalNodes>
+          <leafValues>
+            -4.5638361573219299e-01 4.8106320202350616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 8.5668899118900299e-03</internalNodes>
+          <leafValues>
+            -8.0403454601764679e-02 3.0411326885223389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 8.6863581091165543e-03</internalNodes>
+          <leafValues>
+            3.4176670014858246e-02 -7.3028022050857544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 1.0814646258950233e-02</internalNodes>
+          <leafValues>
+            2.5131458416581154e-02 -6.7325627803802490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 4.4222913682460785e-02</internalNodes>
+          <leafValues>
+            3.9326712489128113e-02 -5.1067680120468140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 3.7128489930182695e-03</internalNodes>
+          <leafValues>
+            -1.3248492777347565e-01 1.6692358255386353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -4.6475054696202278e-03</internalNodes>
+          <leafValues>
+            1.7683532834053040e-01 -1.2570241093635559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 4.2433524504303932e-03</internalNodes>
+          <leafValues>
+            3.6985948681831360e-02 -5.8369445800781250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -5.1774000748991966e-03</internalNodes>
+          <leafValues>
+            5.1487326622009277e-01 -4.1473735123872757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 4.2645614594221115e-03</internalNodes>
+          <leafValues>
+            3.7253957241773605e-02 -5.7676959037780762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 4.8632645048201084e-03</internalNodes>
+          <leafValues>
+            -6.7035257816314697e-02 3.1131938099861145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 2.6089766994118690e-02</internalNodes>
+          <leafValues>
+            -8.2920446991920471e-02 3.0445784330368042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -1.9001008477061987e-03</internalNodes>
+          <leafValues>
+            -4.3419414758682251e-01 4.6812325716018677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -6.0952613130211830e-03</internalNodes>
+          <leafValues>
+            -5.1850622892379761e-01 3.6754775792360306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 1.2120242230594158e-02</internalNodes>
+          <leafValues>
+            -7.4773810803890228e-02 2.6738941669464111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.8978580832481384e-02</internalNodes>
+          <leafValues>
+            2.5657230615615845e-01 -8.0304212868213654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 4.3438978493213654e-02</internalNodes>
+          <leafValues>
+            -6.2818735837936401e-02 3.2261833548545837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 9.4384723342955112e-04</internalNodes>
+          <leafValues>
+            -9.8582215607166290e-02 2.2370135784149170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -4.1803726926445961e-03</internalNodes>
+          <leafValues>
+            -4.9802374839782715e-01 4.3809909373521805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 -9.7246468067169189e-03</internalNodes>
+          <leafValues>
+            2.2823798656463623e-01 -9.8547600209712982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 2.7193846181035042e-03</internalNodes>
+          <leafValues>
+            -9.1188244521617889e-02 2.2684387862682343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 6.2224082648754120e-03</internalNodes>
+          <leafValues>
+            3.2258503139019012e-02 -6.0108250379562378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -4.8602908849716187e-01</internalNodes>
+          <leafValues>
+            6.3337916135787964e-01 -3.3006772398948669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 -5.3604291751980782e-03</internalNodes>
+          <leafValues>
+            2.9434949159622192e-01 -6.1312302947044373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 5.5021280422806740e-03</internalNodes>
+          <leafValues>
+            4.1839476674795151e-02 -4.5681878924369812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -1.3823953922837973e-03</internalNodes>
+          <leafValues>
+            1.6067574918270111e-01 -1.1796293407678604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 2.0954519510269165e-02</internalNodes>
+          <leafValues>
+            -5.7253565639257431e-02 3.3830171823501587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 7.4234008789062500e-03</internalNodes>
+          <leafValues>
+            -7.4798591434955597e-02 2.6430690288543701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 2.1767318248748779e-03</internalNodes>
+          <leafValues>
+            -8.0530151724815369e-02 2.5947657227516174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 1.8930230289697647e-03</internalNodes>
+          <leafValues>
+            -8.1788897514343262e-02 2.2988820075988770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 6.9275917485356331e-03</internalNodes>
+          <leafValues>
+            2.6962997391819954e-02 -7.6910203695297241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 6.7140227183699608e-03</internalNodes>
+          <leafValues>
+            2.3244854062795639e-02 -6.8406605720520020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -3.4494437277317047e-02</internalNodes>
+          <leafValues>
+            -6.5257686376571655e-01 2.4584138765931129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 1.9636256620287895e-03</internalNodes>
+          <leafValues>
+            -9.1118760406970978e-02 2.0629465579986572e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 14 -->
+    <_>
+      <maxWeakCount>80</maxWeakCount>
+      <stageThreshold>-1.3304495811462402e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 572 -9.1053368523716927e-03</internalNodes>
+          <leafValues>
+            4.8031216859817505e-01 -9.3147851526737213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -2.1384856663644314e-03</internalNodes>
+          <leafValues>
+            3.4027156233787537e-01 -1.4834050834178925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 1.2453617528080940e-02</internalNodes>
+          <leafValues>
+            -8.0359503626823425e-02 4.7585478425025940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 5.0965799018740654e-03</internalNodes>
+          <leafValues>
+            -1.6364066302776337e-01 2.9590085148811340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -3.1894792336970568e-03</internalNodes>
+          <leafValues>
+            1.7039565742015839e-01 -2.1295401453971863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -1.4799979981034994e-03</internalNodes>
+          <leafValues>
+            -4.1050529479980469e-01 5.3783610463142395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 6.0710287652909756e-03</internalNodes>
+          <leafValues>
+            -1.5162153542041779e-01 1.8406888842582703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 4.3081510812044144e-03</internalNodes>
+          <leafValues>
+            5.0293717533349991e-02 -4.6324169635772705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 1.8933035898953676e-03</internalNodes>
+          <leafValues>
+            6.5655551850795746e-02 -3.9198148250579834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -1.6021143645048141e-02</internalNodes>
+          <leafValues>
+            2.2748421132564545e-01 -1.0609938949346542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -8.9298677630722523e-04</internalNodes>
+          <leafValues>
+            3.1164079904556274e-01 -1.1380065232515335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 -1.4284942299127579e-03</internalNodes>
+          <leafValues>
+            2.7966943383216858e-01 -9.6580952405929565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 2.5015190243721008e-02</internalNodes>
+          <leafValues>
+            4.2534209787845612e-02 -6.2623745203018188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -2.8645459096878767e-03</internalNodes>
+          <leafValues>
+            -4.1426309943199158e-01 5.1780503243207932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 3.2044243998825550e-03</internalNodes>
+          <leafValues>
+            -1.1883606761693954e-01 1.9546063244342804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -1.0433372110128403e-02</internalNodes>
+          <leafValues>
+            2.6159819960594177e-01 -9.3164652585983276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -9.7299478948116302e-03</internalNodes>
+          <leafValues>
+            -4.9464005231857300e-01 5.0998747348785400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 -2.1688457578420639e-02</internalNodes>
+          <leafValues>
+            5.6923902034759521e-01 -4.9958106130361557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -2.9492072761058807e-02</internalNodes>
+          <leafValues>
+            -6.1336356401443481e-01 4.7003138810396194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -2.4866596795618534e-03</internalNodes>
+          <leafValues>
+            -3.9986124634742737e-01 5.7781789451837540e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 4.0488247759640217e-03</internalNodes>
+          <leafValues>
+            4.6429801732301712e-02 -4.4500553607940674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -9.3909690622240305e-04</internalNodes>
+          <leafValues>
+            2.4617424607276917e-01 -9.0848781168460846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 -5.2673118188977242e-03</internalNodes>
+          <leafValues>
+            -6.4129960536956787e-01 3.5207435488700867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 -6.1755320057272911e-03</internalNodes>
+          <leafValues>
+            1.7039734125137329e-01 -1.3195209205150604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 1.5832348726689816e-03</internalNodes>
+          <leafValues>
+            -9.2635877430438995e-02 2.5755262374877930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 2.8633023612201214e-03</internalNodes>
+          <leafValues>
+            5.0923369824886322e-02 -4.6171438694000244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -2.3722708225250244e-02</internalNodes>
+          <leafValues>
+            -4.5609694719314575e-01 4.3677136301994324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 5.8846692554652691e-03</internalNodes>
+          <leafValues>
+            5.1512561738491058e-02 -4.4899132847785950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -8.2513026427477598e-04</internalNodes>
+          <leafValues>
+            2.4914309382438660e-01 -8.9795768260955811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -2.9888928402215242e-03</internalNodes>
+          <leafValues>
+            -4.0133482217788696e-01 5.5449619889259338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 1.8384978175163269e-02</internalNodes>
+          <leafValues>
+            4.9513496458530426e-02 -4.2024865746498108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 -2.4238843470811844e-03</internalNodes>
+          <leafValues>
+            -6.7325645685195923e-01 2.8972415253520012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 8.1563717685639858e-04</internalNodes>
+          <leafValues>
+            -1.4400914311408997e-01 1.5184181928634644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 2.1788734011352062e-03</internalNodes>
+          <leafValues>
+            -8.2650899887084961e-02 2.5927037000656128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 3.7263201083987951e-03</internalNodes>
+          <leafValues>
+            -6.3213117420673370e-02 3.8062268495559692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 3.0819473322480917e-03</internalNodes>
+          <leafValues>
+            3.9066124707460403e-02 -6.2055569887161255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 2.7417289093136787e-03</internalNodes>
+          <leafValues>
+            3.2166294753551483e-02 -5.6402361392974854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -3.8205389864742756e-03</internalNodes>
+          <leafValues>
+            2.5668358802795410e-01 -7.9121366143226624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -1.2516178190708160e-02</internalNodes>
+          <leafValues>
+            -7.0402121543884277e-01 3.2493114471435547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 4.6941628679633141e-03</internalNodes>
+          <leafValues>
+            4.7352086752653122e-02 -4.0129581093788147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 5.0501096993684769e-03</internalNodes>
+          <leafValues>
+            -1.0563907027244568e-01 2.3647888004779816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 1.5111428685486317e-02</internalNodes>
+          <leafValues>
+            -6.7443214356899261e-02 2.7579694986343384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 7.4835181236267090e-02</internalNodes>
+          <leafValues>
+            -6.2918186187744141e-02 3.6493194103240967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 1.3086002320051193e-02</internalNodes>
+          <leafValues>
+            2.9699811711907387e-02 -7.4420636892318726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 -5.4838880896568298e-03</internalNodes>
+          <leafValues>
+            2.2497597336769104e-01 -8.8018722832202911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 3.3699360210448503e-03</internalNodes>
+          <leafValues>
+            -6.9213069975376129e-02 2.9263094067573547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 7.7881952747702599e-03</internalNodes>
+          <leafValues>
+            5.8034870773553848e-02 -3.9803403615951538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -1.9298251718282700e-02</internalNodes>
+          <leafValues>
+            2.1273820102214813e-01 -9.6075013279914856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 1.3059679418802261e-02</internalNodes>
+          <leafValues>
+            4.0989801287651062e-02 -4.9787399172782898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -2.2303011268377304e-02</internalNodes>
+          <leafValues>
+            -6.5915608406066895e-01 2.7258813381195068e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 -5.2872681990265846e-03</internalNodes>
+          <leafValues>
+            2.9461637139320374e-01 -6.9564543664455414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 6.0780980857089162e-04</internalNodes>
+          <leafValues>
+            -9.5468334853649139e-02 2.0951601862907410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 4.8917778767645359e-03</internalNodes>
+          <leafValues>
+            3.9317954331636429e-02 -5.3803342580795288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 -1.0402110219001770e-01</internalNodes>
+          <leafValues>
+            5.4199391603469849e-01 -3.9763871580362320e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 3.8908584974706173e-03</internalNodes>
+          <leafValues>
+            3.8185238838195801e-02 -5.3280067443847656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 8.0125425010919571e-03</internalNodes>
+          <leafValues>
+            -7.8310973942279816e-02 2.4926608800888062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 -3.4356187097728252e-03</internalNodes>
+          <leafValues>
+            2.3415692150592804e-01 -9.2279240489006042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 -5.2030328661203384e-03</internalNodes>
+          <leafValues>
+            -5.0255048274993896e-01 4.4738721102476120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 -5.5568795651197433e-03</internalNodes>
+          <leafValues>
+            2.8329169750213623e-01 -7.0860259234905243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 -7.6205702498555183e-03</internalNodes>
+          <leafValues>
+            2.5350978970527649e-01 -7.2612494230270386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 2.7379104495048523e-01</internalNodes>
+          <leafValues>
+            -5.6398060172796249e-02 3.6085364222526550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 7.3067229241132736e-03</internalNodes>
+          <leafValues>
+            -6.2759615480899811e-02 3.1996127963066101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 3.2574313227087259e-03</internalNodes>
+          <leafValues>
+            4.1181974112987518e-02 -4.9355933070182800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 -1.2764024734497070e-01</internalNodes>
+          <leafValues>
+            2.5147503614425659e-01 -7.5440123677253723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -3.2227888703346252e-02</internalNodes>
+          <leafValues>
+            3.9548832178115845e-01 -4.7284111380577087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 2.3350853472948074e-02</internalNodes>
+          <leafValues>
+            -7.2977773845195770e-02 2.5172060728073120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 2.7610745746642351e-05</internalNodes>
+          <leafValues>
+            -1.3625738024711609e-01 1.3250400125980377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 6.9611091166734695e-03</internalNodes>
+          <leafValues>
+            2.9794082045555115e-02 -5.8855760097503662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -9.9057564511895180e-04</internalNodes>
+          <leafValues>
+            2.5895762443542480e-01 -7.1211874485015869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -3.7965672090649605e-03</internalNodes>
+          <leafValues>
+            -6.4451014995574951e-01 3.5450231283903122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 3.9518065750598907e-03</internalNodes>
+          <leafValues>
+            -6.3615679740905762e-02 3.0333930253982544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -5.4976264946162701e-03</internalNodes>
+          <leafValues>
+            -4.3285435438156128e-01 4.7526597976684570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 7.1266246959567070e-03</internalNodes>
+          <leafValues>
+            -6.6810697317123413e-02 2.8491511940956116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 -3.0366722494363785e-03</internalNodes>
+          <leafValues>
+            -4.3046197295188904e-01 4.4313102960586548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 -1.7097850795835257e-03</internalNodes>
+          <leafValues>
+            2.5873449444770813e-01 -7.3857538402080536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -4.4310283847153187e-03</internalNodes>
+          <leafValues>
+            2.1451152861118317e-01 -8.7626561522483826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -3.9760642684996128e-03</internalNodes>
+          <leafValues>
+            -4.6889033913612366e-01 3.8441929966211319e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 -2.9741778969764709e-02</internalNodes>
+          <leafValues>
+            -5.5860131978988647e-01 3.0309556052088737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 1.3289751112461090e-01</internalNodes>
+          <leafValues>
+            2.8634676709771156e-02 -5.6014162302017212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 -1.1272695846855640e-03</internalNodes>
+          <leafValues>
+            1.7104774713516235e-01 -1.0818520933389664e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 15 -->
+    <_>
+      <maxWeakCount>83</maxWeakCount>
+      <stageThreshold>-1.2789946794509888e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 649 1.3820428401231766e-02</internalNodes>
+          <leafValues>
+            -1.0330537706613541e-01 4.5001628994941711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -1.0161036625504494e-02</internalNodes>
+          <leafValues>
+            3.2188063859939575e-01 -1.5805941820144653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -3.8372592534869909e-03</internalNodes>
+          <leafValues>
+            3.2943242788314819e-01 -1.1501405388116837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 3.4624878317117691e-02</internalNodes>
+          <leafValues>
+            -9.8698168992996216e-02 5.4050970077514648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 5.7967011816799641e-03</internalNodes>
+          <leafValues>
+            -1.1608023941516876e-01 2.8170758485794067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 4.7825248911976814e-03</internalNodes>
+          <leafValues>
+            -1.3033217191696167e-01 2.4669390916824341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 7.1141775697469711e-04</internalNodes>
+          <leafValues>
+            -2.0435671508312225e-01 1.1761441081762314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -2.9168082401156425e-02</internalNodes>
+          <leafValues>
+            -6.2692928314208984e-01 5.5113222450017929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 2.1553519181907177e-03</internalNodes>
+          <leafValues>
+            5.3858544677495956e-02 -4.2096143960952759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -2.1254396997392178e-03</internalNodes>
+          <leafValues>
+            4.2603659629821777e-01 -5.0405498594045639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 8.4234733367338777e-04</internalNodes>
+          <leafValues>
+            -9.3583315610885620e-02 2.6316204667091370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -1.6576268244534731e-03</internalNodes>
+          <leafValues>
+            -3.5802370309829712e-01 6.8603202700614929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 6.5620511770248413e-02</internalNodes>
+          <leafValues>
+            -6.4758449792861938e-02 3.8339248299598694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -1.8485928885638714e-03</internalNodes>
+          <leafValues>
+            1.7337062954902649e-01 -1.3676019012928009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 -1.8170465528964996e-01</internalNodes>
+          <leafValues>
+            4.0350264310836792e-01 -5.3196940571069717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 -3.4317909739911556e-03</internalNodes>
+          <leafValues>
+            -5.2157330513000488e-01 4.6489212661981583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -2.7482535224407911e-03</internalNodes>
+          <leafValues>
+            -5.1078474521636963e-01 4.3557438999414444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -4.7894287854433060e-03</internalNodes>
+          <leafValues>
+            3.4981805086135864e-01 -6.5036587417125702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -3.3211666159331799e-03</internalNodes>
+          <leafValues>
+            2.1143883466720581e-01 -1.1754662543535233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 3.5642951726913452e-02</internalNodes>
+          <leafValues>
+            3.7131600081920624e-02 -6.2165355682373047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -3.1561930663883686e-03</internalNodes>
+          <leafValues>
+            -4.2197883129119873e-01 4.7645546495914459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 5.2224877290427685e-03</internalNodes>
+          <leafValues>
+            -1.0117106884717941e-01 2.1957167983055115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 2.5758458301424980e-02</internalNodes>
+          <leafValues>
+            -9.6981137990951538e-02 3.0423089861869812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 2.8883803170174360e-03</internalNodes>
+          <leafValues>
+            4.4947806745767593e-02 -5.5540132522583008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 2.6014349423348904e-03</internalNodes>
+          <leafValues>
+            4.5947834849357605e-02 -4.1711980104446411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -7.8792509157210588e-04</internalNodes>
+          <leafValues>
+            1.5732656419277191e-01 -1.2769798934459686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 4.2199464514851570e-03</internalNodes>
+          <leafValues>
+            -9.4008974730968475e-02 2.6868444681167603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 -2.4246796965599060e-03</internalNodes>
+          <leafValues>
+            -4.9610009789466858e-01 4.6141009777784348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.8996626604348421e-03</internalNodes>
+          <leafValues>
+            2.6260954141616821e-01 -8.5721127688884735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 1.8048105994239450e-03</internalNodes>
+          <leafValues>
+            7.1231566369533539e-02 -3.2751160860061646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -5.6593962945044041e-03</internalNodes>
+          <leafValues>
+            -5.0264769792556763e-01 4.0275387465953827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 -3.4701074473559856e-03</internalNodes>
+          <leafValues>
+            -4.9033272266387939e-01 3.6995064467191696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 1.1992279905825853e-03</internalNodes>
+          <leafValues>
+            -9.3982182443141937e-02 2.2527951002120972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -3.3614276908338070e-03</internalNodes>
+          <leafValues>
+            1.5591301023960114e-01 -1.3875743746757507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 9.2923380434513092e-03</internalNodes>
+          <leafValues>
+            2.8368480503559113e-02 -6.3946157693862915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -1.6806223988533020e-01</internalNodes>
+          <leafValues>
+            -6.3519150018692017e-01 2.4432161822915077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 -1.5483988681808114e-03</internalNodes>
+          <leafValues>
+            -4.9389392137527466e-01 3.4452050924301147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 7.9401559196412563e-04</internalNodes>
+          <leafValues>
+            -1.6395612061023712e-01 1.1427336186170578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 -5.3670424968004227e-03</internalNodes>
+          <leafValues>
+            -5.4615026712417603e-01 3.2274313271045685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 -5.1019818056374788e-04</internalNodes>
+          <leafValues>
+            1.4040225744247437e-01 -1.2673649191856384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 -9.6546392887830734e-04</internalNodes>
+          <leafValues>
+            2.3117446899414062e-01 -7.7826015651226044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 -9.7423873376101255e-04</internalNodes>
+          <leafValues>
+            -4.0673121809959412e-01 4.6749390661716461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -4.7841384075582027e-03</internalNodes>
+          <leafValues>
+            -5.0288796424865723e-01 3.4186109900474548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 6.8537802435457706e-03</internalNodes>
+          <leafValues>
+            5.0501946359872818e-02 -3.5414797067642212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 4.1695050895214081e-03</internalNodes>
+          <leafValues>
+            -6.8471699953079224e-02 2.8334242105484009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 2.6521178369875997e-05</internalNodes>
+          <leafValues>
+            -1.7646598815917969e-01 1.0057727992534637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -1.8193974392488599e-03</internalNodes>
+          <leafValues>
+            -5.2059328556060791e-01 3.4266594797372818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 1.1680822353810072e-03</internalNodes>
+          <leafValues>
+            -7.5169444084167480e-02 2.3740953207015991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 -5.8111123507842422e-04</internalNodes>
+          <leafValues>
+            2.4673853814601898e-01 -8.9036554098129272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 5.5753946304321289e-02</internalNodes>
+          <leafValues>
+            -4.8898559063673019e-02 3.7110447883605957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -6.0947462916374207e-03</internalNodes>
+          <leafValues>
+            -4.8019152879714966e-01 3.6990296095609665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 3.3249799162149429e-03</internalNodes>
+          <leafValues>
+            3.2017692923545837e-02 -4.8544195294380188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 -1.1994136497378349e-02</internalNodes>
+          <leafValues>
+            2.7767661213874817e-01 -6.2677264213562012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 1.9462420605123043e-03</internalNodes>
+          <leafValues>
+            5.7167824357748032e-02 -3.2460683584213257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -3.5742400214076042e-03</internalNodes>
+          <leafValues>
+            2.1856486797332764e-01 -7.7333562076091766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 3.4013153053820133e-03</internalNodes>
+          <leafValues>
+            -9.4114005565643311e-02 2.3269242048263550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 6.4494553953409195e-03</internalNodes>
+          <leafValues>
+            3.4765381366014481e-02 -5.1627504825592041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 -1.2767435982823372e-02</internalNodes>
+          <leafValues>
+            2.5566741824150085e-01 -6.7411571741104126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 2.2043818607926369e-03</internalNodes>
+          <leafValues>
+            -1.3278621435165405e-01 1.7942063510417938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 -4.0757502429187298e-03</internalNodes>
+          <leafValues>
+            -3.8042715191841125e-01 4.4863421469926834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 2.2066584788262844e-03</internalNodes>
+          <leafValues>
+            -7.0331946015357971e-02 2.5572371482849121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 2.2714279592037201e-02</internalNodes>
+          <leafValues>
+            4.1653785854578018e-02 -4.4101753830909729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -1.1373223736882210e-02</internalNodes>
+          <leafValues>
+            3.2443967461585999e-01 -5.8059785515069962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 1.8165379296988249e-03</internalNodes>
+          <leafValues>
+            -7.2351627051830292e-02 2.2953742742538452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 -2.8745923191308975e-03</internalNodes>
+          <leafValues>
+            -3.9090758562088013e-01 4.6148840337991714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -5.7676057331264019e-03</internalNodes>
+          <leafValues>
+            2.4503223598003387e-01 -7.2128646075725555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 1.2852130457758904e-02</internalNodes>
+          <leafValues>
+            -1.1143829673528671e-01 1.6758553683757782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -4.2651765048503876e-02</internalNodes>
+          <leafValues>
+            2.3846423625946045e-01 -7.9255387187004089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 -6.8766735494136810e-03</internalNodes>
+          <leafValues>
+            -3.9145267009735107e-01 5.2240811288356781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -1.5351611375808716e-01</internalNodes>
+          <leafValues>
+            -5.4598790407180786e-01 2.9950620606541634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -1.7586871981620789e-02</internalNodes>
+          <leafValues>
+            2.4160921573638916e-01 -7.7404774725437164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 2.8469474054872990e-03</internalNodes>
+          <leafValues>
+            -7.1562752127647400e-02 2.3895153403282166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -2.6379337534308434e-02</internalNodes>
+          <leafValues>
+            2.7370086312294006e-01 -6.5483018755912781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -6.6346197854727507e-04</internalNodes>
+          <leafValues>
+            1.7174075543880463e-01 -1.0841262340545654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 1.4637422282248735e-03</internalNodes>
+          <leafValues>
+            -1.1365657299757004e-01 1.6123561561107635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 -1.3798776781186461e-03</internalNodes>
+          <leafValues>
+            2.3192690312862396e-01 -7.5626462697982788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 -6.8256547674536705e-03</internalNodes>
+          <leafValues>
+            2.4984428286552429e-01 -7.2457753121852875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -9.0181883424520493e-03</internalNodes>
+          <leafValues>
+            2.0358866453170776e-01 -9.5499873161315918e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 3.1383798923343420e-03</internalNodes>
+          <leafValues>
+            4.0804021060466766e-02 -4.9618390202522278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 -1.8526764586567879e-02</internalNodes>
+          <leafValues>
+            2.2743205726146698e-01 -8.6628310382366180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 -2.2562327794730663e-03</internalNodes>
+          <leafValues>
+            -3.2850387692451477e-01 5.9250634163618088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 -4.1183121502399445e-03</internalNodes>
+          <leafValues>
+            -5.0281947851181030e-01 3.2455049455165863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 4.8136096447706223e-03</internalNodes>
+          <leafValues>
+            3.1708184629678726e-02 -4.9248033761978149e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 16 -->
+    <_>
+      <maxWeakCount>90</maxWeakCount>
+      <stageThreshold>-1.2794928550720215e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 568 -4.7569684684276581e-03</internalNodes>
+          <leafValues>
+            4.4339472055435181e-01 -1.0486443340778351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -2.5423073675483465e-03</internalNodes>
+          <leafValues>
+            3.9922216534614563e-01 -1.0431514680385590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 1.1162508279085159e-02</internalNodes>
+          <leafValues>
+            -1.5686489641666412e-01 2.3129878938198090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 1.7287035007029772e-03</internalNodes>
+          <leafValues>
+            -1.5123696625232697e-01 2.9676723480224609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 2.5025676935911179e-02</internalNodes>
+          <leafValues>
+            -5.1661748439073563e-02 4.8509848117828369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 1.2561861425638199e-02</internalNodes>
+          <leafValues>
+            -1.1817755550146103e-01 2.6937758922576904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 4.6598571352660656e-03</internalNodes>
+          <leafValues>
+            -1.3565555214881897e-01 2.1206009387969971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 7.4310216587036848e-04</internalNodes>
+          <leafValues>
+            -1.7020516097545624e-01 1.5990819036960602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 1.0259399190545082e-02</internalNodes>
+          <leafValues>
+            -1.4796857535839081e-01 1.8798792362213135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 -1.2777388095855713e-02</internalNodes>
+          <leafValues>
+            -5.4041445255279541e-01 4.8501875251531601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -1.1427352204918861e-02</internalNodes>
+          <leafValues>
+            -5.1071381568908691e-01 4.8088576644659042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 2.8340169592411257e-05</internalNodes>
+          <leafValues>
+            -2.0961570739746094e-01 1.0582420229911804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 -6.4714960753917694e-03</internalNodes>
+          <leafValues>
+            -5.0862830877304077e-01 4.8812258988618851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 1.3540303334593773e-02</internalNodes>
+          <leafValues>
+            2.7134107425808907e-02 -7.1317195892333984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 1.8916794797405601e-03</internalNodes>
+          <leafValues>
+            -6.2187314033508301e-02 3.6233416199684143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 1.0457850992679596e-02</internalNodes>
+          <leafValues>
+            4.0487006306648254e-02 -5.3173840045928955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -9.0822251513600349e-04</internalNodes>
+          <leafValues>
+            2.0090451836585999e-01 -1.0807146877050400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -1.9299473613500595e-02</internalNodes>
+          <leafValues>
+            -6.4914399385452271e-01 4.0790289640426636e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 -8.2283990923315287e-04</internalNodes>
+          <leafValues>
+            1.5708251297473907e-01 -1.3143004477024078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 3.7520762998610735e-03</internalNodes>
+          <leafValues>
+            3.8761712610721588e-02 -4.9775493144989014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 8.2424264401197433e-03</internalNodes>
+          <leafValues>
+            3.6369498819112778e-02 -5.1153117418289185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 -1.1945937294512987e-03</internalNodes>
+          <leafValues>
+            1.3862735033035278e-01 -1.3917639851570129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -1.0589268989861012e-02</internalNodes>
+          <leafValues>
+            3.2981950044631958e-01 -7.6042778789997101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 2.6780981570482254e-02</internalNodes>
+          <leafValues>
+            4.6954374760389328e-02 -4.5390221476554871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 5.2458671852946281e-03</internalNodes>
+          <leafValues>
+            -4.7804936766624451e-02 4.0361502766609192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 1.0518019553273916e-03</internalNodes>
+          <leafValues>
+            -1.0052871704101562e-01 1.9928459823131561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 3.9210864342749119e-03</internalNodes>
+          <leafValues>
+            3.6381114274263382e-02 -5.4954099655151367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 -1.5182888135313988e-02</internalNodes>
+          <leafValues>
+            2.8286656737327576e-01 -7.6106920838356018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 2.7552489191293716e-03</internalNodes>
+          <leafValues>
+            -1.2027227133512497e-01 2.0814672112464905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 1.3051946647465229e-02</internalNodes>
+          <leafValues>
+            3.6561664193868637e-02 -6.8296074867248535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 4.4104140251874924e-03</internalNodes>
+          <leafValues>
+            2.9448021203279495e-02 -5.9994471073150635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 2.3885946720838547e-03</internalNodes>
+          <leafValues>
+            3.9816807955503464e-02 -4.6116915345191956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 2.3683100007474422e-03</internalNodes>
+          <leafValues>
+            4.9801617860794067e-02 -3.9546611905097961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -4.1178334504365921e-03</internalNodes>
+          <leafValues>
+            1.6903834044933319e-01 -1.1102814227342606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -2.7111368253827095e-03</internalNodes>
+          <leafValues>
+            2.0166625082492828e-01 -9.3054622411727905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 -2.4442467838525772e-03</internalNodes>
+          <leafValues>
+            1.3419428467750549e-01 -1.4021472632884979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 -6.9398069754242897e-03</internalNodes>
+          <leafValues>
+            -4.7041961550712585e-01 3.8327444344758987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -7.5376339256763458e-02</internalNodes>
+          <leafValues>
+            3.5196593403816223e-01 -5.8293107897043228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -7.3061959119513631e-04</internalNodes>
+          <leafValues>
+            2.0563322305679321e-01 -9.7862586379051208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 -4.4864090159535408e-03</internalNodes>
+          <leafValues>
+            -4.3219071626663208e-01 4.6815373003482819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -3.3369990997016430e-03</internalNodes>
+          <leafValues>
+            -5.7968968152999878e-01 3.2250367105007172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -5.7756435126066208e-03</internalNodes>
+          <leafValues>
+            -6.3823670148849487e-01 2.6716385036706924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 3.8174313958734274e-03</internalNodes>
+          <leafValues>
+            -7.8204549849033356e-02 2.4104152619838715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 3.9163082838058472e-03</internalNodes>
+          <leafValues>
+            4.0961768478155136e-02 -4.2656800150871277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -3.7615487817674875e-03</internalNodes>
+          <leafValues>
+            2.0846015214920044e-01 -8.6097449064254761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 -9.5803234726190567e-03</internalNodes>
+          <leafValues>
+            -7.0837384462356567e-01 2.8397833928465843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 1.4632595703005791e-02</internalNodes>
+          <leafValues>
+            1.8669826909899712e-02 -7.4236363172531128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 5.3799869492650032e-03</internalNodes>
+          <leafValues>
+            3.0915707349777222e-02 -4.7074958682060242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -2.4318110663443804e-03</internalNodes>
+          <leafValues>
+            3.0304560065269470e-01 -5.6169599294662476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 3.8594864308834076e-02</internalNodes>
+          <leafValues>
+            2.5472542271018028e-02 -6.8472218513488770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 1.6673290729522705e-01</internalNodes>
+          <leafValues>
+            -5.9959251433610916e-02 2.9591250419616699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 -5.0129964947700500e-03</internalNodes>
+          <leafValues>
+            1.9718486070632935e-01 -9.4902090728282928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 -9.3115903437137604e-03</internalNodes>
+          <leafValues>
+            2.8306549787521362e-01 -6.8168632686138153e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 -2.7176579460501671e-03</internalNodes>
+          <leafValues>
+            2.4883794784545898e-01 -7.3830418288707733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 6.9358374457806349e-04</internalNodes>
+          <leafValues>
+            -1.2474948167800903e-01 1.6316886246204376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 1.3523821253329515e-03</internalNodes>
+          <leafValues>
+            -7.3475763201713562e-02 3.0120497941970825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -2.6339504867792130e-02</internalNodes>
+          <leafValues>
+            4.7823980450630188e-01 -3.9222836494445801e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 3.3510509878396988e-02</internalNodes>
+          <leafValues>
+            -3.8013227283954620e-02 4.1955846548080444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -2.8097369067836553e-05</internalNodes>
+          <leafValues>
+            1.2249568104743958e-01 -1.4184975624084473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 -4.0141213685274124e-03</internalNodes>
+          <leafValues>
+            -4.5551317930221558e-01 3.6903131753206253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 5.7984986342489719e-03</internalNodes>
+          <leafValues>
+            3.9383981376886368e-02 -4.0305584669113159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 7.5392555445432663e-03</internalNodes>
+          <leafValues>
+            -9.3996182084083557e-02 1.8520636856555939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 4.5007485896348953e-03</internalNodes>
+          <leafValues>
+            4.2565450072288513e-02 -4.0628531575202942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 5.0333794206380844e-03</internalNodes>
+          <leafValues>
+            -6.7051678895950317e-02 2.5224363803863525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 8.7359821191057563e-04</internalNodes>
+          <leafValues>
+            -9.5469102263450623e-02 1.7292767763137817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 3.0778967775404453e-03</internalNodes>
+          <leafValues>
+            -6.1908006668090820e-02 2.5266119837760925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -2.2874618880450726e-03</internalNodes>
+          <leafValues>
+            1.9187310338020325e-01 -8.5145145654678345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 4.0947222150862217e-03</internalNodes>
+          <leafValues>
+            3.0908439308404922e-02 -5.5290663242340088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 2.1358881145715714e-02</internalNodes>
+          <leafValues>
+            4.0033571422100067e-02 -3.8174301385879517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -4.5840246602892876e-03</internalNodes>
+          <leafValues>
+            -5.2027910947799683e-01 3.0034648254513741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 9.8655056208372116e-03</internalNodes>
+          <leafValues>
+            2.1588459610939026e-02 -6.3089925050735474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 2.5678081437945366e-03</internalNodes>
+          <leafValues>
+            -1.1046713590621948e-01 1.4713281393051147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -2.6078277733176947e-03</internalNodes>
+          <leafValues>
+            2.7103677392005920e-01 -5.9257075190544128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 2.6908484287559986e-03</internalNodes>
+          <leafValues>
+            2.7514556422829628e-02 -6.3733005523681641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -1.3983637327328324e-03</internalNodes>
+          <leafValues>
+            1.5699537098407745e-01 -1.0462216287851334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 1.0498151183128357e-01</internalNodes>
+          <leafValues>
+            3.0471364036202431e-02 -4.9990084767341614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -1.4592260122299194e-01</internalNodes>
+          <leafValues>
+            3.2007977366447449e-01 -5.2097231149673462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 7.8754723072052002e-03</internalNodes>
+          <leafValues>
+            -6.7778728902339935e-02 2.8044930100440979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -5.3792521357536316e-03</internalNodes>
+          <leafValues>
+            2.1354769170284271e-01 -8.2902953028678894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 -1.0021779686212540e-02</internalNodes>
+          <leafValues>
+            2.5685080885887146e-01 -7.3165819048881531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -4.2762188240885735e-03</internalNodes>
+          <leafValues>
+            1.7162682116031647e-01 -9.7696490585803986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 1.0965526103973389e-02</internalNodes>
+          <leafValues>
+            -7.5053967535495758e-02 2.3615135252475739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 -4.4276113621890545e-03</internalNodes>
+          <leafValues>
+            2.5747051835060120e-01 -6.3898853957653046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -8.6840223520994186e-03</internalNodes>
+          <leafValues>
+            -4.7478455305099487e-01 3.6790292710065842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 2.8339526616036892e-03</internalNodes>
+          <leafValues>
+            4.0944386273622513e-02 -3.6514538526535034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 7.6391562819480896e-02</internalNodes>
+          <leafValues>
+            -4.9489263445138931e-02 3.4142583608627319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 1.9103729864582419e-03</internalNodes>
+          <leafValues>
+            -5.6329321116209030e-02 2.9177185893058777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 5.2499733865261078e-02</internalNodes>
+          <leafValues>
+            2.8848636895418167e-02 -5.9306102991104126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 -5.0793914124369621e-03</internalNodes>
+          <leafValues>
+            -5.0588577985763550e-01 2.8303196653723717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 -7.1491668932139874e-03</internalNodes>
+          <leafValues>
+            -6.2660187482833862e-01 2.3113224655389786e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 17 -->
+    <_>
+      <maxWeakCount>88</maxWeakCount>
+      <stageThreshold>-1.2153301239013672e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 803 3.5730558447539806e-03</internalNodes>
+          <leafValues>
+            -4.2218949645757675e-02 5.5067819356918335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 1.0531613603234291e-02</internalNodes>
+          <leafValues>
+            -1.0848262906074524e-01 4.2079353332519531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -2.8240748215466738e-03</internalNodes>
+          <leafValues>
+            1.5155430138111115e-01 -2.2742147743701935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 -1.6008135862648487e-03</internalNodes>
+          <leafValues>
+            2.9879093170166016e-01 -1.0573560744524002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -1.2082614004611969e-02</internalNodes>
+          <leafValues>
+            2.5803449749946594e-01 -1.1197961121797562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 9.8490377422422171e-04</internalNodes>
+          <leafValues>
+            -1.8312133848667145e-01 1.3942104578018188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 1.3184763491153717e-02</internalNodes>
+          <leafValues>
+            -1.0306112468242645e-01 2.5403776764869690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 2.5388993322849274e-02</internalNodes>
+          <leafValues>
+            6.4101323485374451e-02 -4.2444714903831482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 7.8083951957523823e-03</internalNodes>
+          <leafValues>
+            -7.8133262693881989e-02 3.2170715928077698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 1.2125947978347540e-03</internalNodes>
+          <leafValues>
+            -1.4831624925136566e-01 1.6055701673030853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 -5.7722916826605797e-03</internalNodes>
+          <leafValues>
+            -6.2254351377487183e-01 4.7926213592290878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -6.7740413360297680e-03</internalNodes>
+          <leafValues>
+            -6.4991837739944458e-01 1.9058052450418472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -2.8847754001617432e-03</internalNodes>
+          <leafValues>
+            -5.1574712991714478e-01 4.2939033359289169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 -5.1092512905597687e-02</internalNodes>
+          <leafValues>
+            -7.1794927120208740e-01 3.0500946566462517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 -3.0863287393003702e-03</internalNodes>
+          <leafValues>
+            -5.1027435064315796e-01 3.7360988557338715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -3.1833123648539186e-04</internalNodes>
+          <leafValues>
+            1.1626140773296356e-01 -1.7245446145534515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 1.2636608444154263e-03</internalNodes>
+          <leafValues>
+            -7.4942886829376221e-02 2.7081242203712463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 -2.7436314150691032e-02</internalNodes>
+          <leafValues>
+            -5.7718968391418457e-01 3.3168055117130280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -1.8837231909856200e-03</internalNodes>
+          <leafValues>
+            -3.0960574746131897e-01 6.1044581234455109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 3.2289433293044567e-03</internalNodes>
+          <leafValues>
+            -6.8203814327716827e-02 2.9658797383308411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -3.6236688029021025e-03</internalNodes>
+          <leafValues>
+            -4.9605649709701538e-01 4.2492914944887161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 -1.3776571722701192e-03</internalNodes>
+          <leafValues>
+            1.3447758555412292e-01 -1.3678476214408875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 2.9051192104816437e-03</internalNodes>
+          <leafValues>
+            -1.2944447994232178e-01 1.4306847751140594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 4.4553354382514954e-03</internalNodes>
+          <leafValues>
+            3.8421813398599625e-02 -4.5035859942436218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 1.0964765213429928e-02</internalNodes>
+          <leafValues>
+            -4.8769049346446991e-02 3.9813303947448730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 2.8863823972642422e-03</internalNodes>
+          <leafValues>
+            5.1313977688550949e-02 -3.6272794008255005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 8.8652484118938446e-03</internalNodes>
+          <leafValues>
+            -9.4886533915996552e-02 2.1068450808525085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -1.9646657630801201e-02</internalNodes>
+          <leafValues>
+            2.2927023470401764e-01 -1.0384474694728851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 -2.3328745737671852e-03</internalNodes>
+          <leafValues>
+            -3.0931735038757324e-01 6.4516365528106689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 -4.0204055607318878e-02</internalNodes>
+          <leafValues>
+            2.7381995320320129e-01 -7.6448827981948853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 1.9051276147365570e-02</internalNodes>
+          <leafValues>
+            4.9466736614704132e-02 -3.6089882254600525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 1.1553505435585976e-02</internalNodes>
+          <leafValues>
+            -7.4454858899116516e-02 2.5223839282989502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 6.0810474678874016e-03</internalNodes>
+          <leafValues>
+            4.9583721905946732e-02 -3.6660569906234741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 5.4147411137819290e-03</internalNodes>
+          <leafValues>
+            3.2274514436721802e-02 -4.9895319342613220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 4.6544210053980350e-03</internalNodes>
+          <leafValues>
+            2.5989409536123276e-02 -6.1053085327148438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 2.4446439929306507e-03</internalNodes>
+          <leafValues>
+            -1.2073440849781036e-01 1.4529803395271301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 4.6318914974108338e-04</internalNodes>
+          <leafValues>
+            -1.0553400218486786e-01 1.7337696254253387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -3.7485856562852859e-02</internalNodes>
+          <leafValues>
+            -4.0581890940666199e-01 4.1759915649890900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 -2.0438145846128464e-02</internalNodes>
+          <leafValues>
+            2.9171264171600342e-01 -6.6287793219089508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -3.8345486391335726e-03</internalNodes>
+          <leafValues>
+            1.5750087797641754e-01 -1.2569475173950195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 8.8059913832694292e-04</internalNodes>
+          <leafValues>
+            -1.0610871762037277e-01 1.7642241716384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 2.0514219067990780e-03</internalNodes>
+          <leafValues>
+            3.4303460270166397e-02 -5.5235451459884644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 -3.5282317548990250e-03</internalNodes>
+          <leafValues>
+            -5.3414058685302734e-01 3.0512372031807899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 6.1051873490214348e-03</internalNodes>
+          <leafValues>
+            -8.4812760353088379e-02 1.9969700276851654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -6.4141638576984406e-03</internalNodes>
+          <leafValues>
+            -4.0772309899330139e-01 4.3864764273166656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 1.7272554337978363e-02</internalNodes>
+          <leafValues>
+            2.1965105086565018e-02 -6.9809681177139282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -1.9691141787916422e-03</internalNodes>
+          <leafValues>
+            1.8511210381984711e-01 -9.0554594993591309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -5.5513512343168259e-03</internalNodes>
+          <leafValues>
+            -4.2040807008743286e-01 4.0062893182039261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -1.1905157566070557e-01</internalNodes>
+          <leafValues>
+            -6.4312189817428589e-01 2.3472266271710396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 4.0823101997375488e-02</internalNodes>
+          <leafValues>
+            -7.3068141937255859e-02 2.4851579964160919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 -8.1011475995182991e-03</internalNodes>
+          <leafValues>
+            2.2747313976287842e-01 -7.5412914156913757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 4.7750310041010380e-03</internalNodes>
+          <leafValues>
+            -7.8901365399360657e-02 2.3182301223278046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -2.7586806565523148e-02</internalNodes>
+          <leafValues>
+            -6.4926701784133911e-01 2.5375340133905411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 4.3069543316960335e-03</internalNodes>
+          <leafValues>
+            2.4360222741961479e-02 -5.7372909784317017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -6.1931653181090951e-04</internalNodes>
+          <leafValues>
+            2.2557340562343597e-01 -7.5787223875522614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -1.1459679901599884e-01</internalNodes>
+          <leafValues>
+            3.0668416619300842e-01 -5.2840072661638260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 3.1560026109218597e-02</internalNodes>
+          <leafValues>
+            -9.5666781067848206e-02 1.7659574747085571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 1.5142546035349369e-03</internalNodes>
+          <leafValues>
+            -9.2694908380508423e-02 2.0833927392959595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 4.7312509268522263e-03</internalNodes>
+          <leafValues>
+            -4.9851816147565842e-02 3.4422698616981506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 -5.9051956050097942e-03</internalNodes>
+          <leafValues>
+            -4.6798244118690491e-01 3.6009732633829117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 3.3569703809916973e-03</internalNodes>
+          <leafValues>
+            -5.1445800811052322e-02 3.3950069546699524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -1.1821147799491882e-01</internalNodes>
+          <leafValues>
+            4.6877983212471008e-01 -3.2708466053009033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 -8.8651233818382025e-04</internalNodes>
+          <leafValues>
+            1.5177871286869049e-01 -1.0880727320909500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -2.5330238044261932e-02</internalNodes>
+          <leafValues>
+            1.7184022068977356e-01 -9.8979160189628601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 5.5901473388075829e-03</internalNodes>
+          <leafValues>
+            -7.1004293859004974e-02 2.7359166741371155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 1.2344302609562874e-02</internalNodes>
+          <leafValues>
+            3.2738436013460159e-02 -5.2876019477844238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -7.4871592223644257e-03</internalNodes>
+          <leafValues>
+            -5.1955360174179077e-01 2.7597136795520782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -2.6753707788884640e-03</internalNodes>
+          <leafValues>
+            -4.7180628776550293e-01 3.1411368399858475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 -3.2419776543974876e-03</internalNodes>
+          <leafValues>
+            1.5980260074138641e-01 -9.5776490867137909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 8.8083129376173019e-03</internalNodes>
+          <leafValues>
+            -8.2104682922363281e-02 2.0850872993469238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 2.7282098308205605e-03</internalNodes>
+          <leafValues>
+            6.1908718198537827e-02 -2.6338595151901245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 5.0587565638124943e-03</internalNodes>
+          <leafValues>
+            -8.2083821296691895e-02 1.9557759165763855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -2.1199107170104980e-02</internalNodes>
+          <leafValues>
+            -5.0425887107849121e-01 3.0914928764104843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 3.4958114847540855e-03</internalNodes>
+          <leafValues>
+            -8.2294017076492310e-02 1.9164223968982697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 1.5914414543658495e-03</internalNodes>
+          <leafValues>
+            -6.9352962076663971e-02 2.1474194526672363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -5.0045788288116455e-02</internalNodes>
+          <leafValues>
+            2.4582423269748688e-01 -6.2959901988506317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -4.1983526200056076e-02</internalNodes>
+          <leafValues>
+            -6.3210010528564453e-01 2.5985429063439369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -6.9432961754500866e-04</internalNodes>
+          <leafValues>
+            2.2444137930870056e-01 -7.0591680705547333e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 6.0177911072969437e-03</internalNodes>
+          <leafValues>
+            3.7622205913066864e-02 -4.1375440359115601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 4.7936867922544479e-03</internalNodes>
+          <leafValues>
+            -9.0203136205673218e-02 1.7498855292797089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -4.7484524548053741e-03</internalNodes>
+          <leafValues>
+            -3.9998278021812439e-01 3.8966752588748932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -7.7324017882347107e-02</internalNodes>
+          <leafValues>
+            -4.8634868860244751e-01 2.9687402769923210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 1.1184449307620525e-02</internalNodes>
+          <leafValues>
+            -4.9598570913076401e-02 3.2780852913856506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -1.0921864770352840e-02</internalNodes>
+          <leafValues>
+            1.7756749689579010e-01 -8.5219532251358032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 4.5135535299777985e-02</internalNodes>
+          <leafValues>
+            2.8995228931307793e-02 -5.3758519887924194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -1.1866749264299870e-03</internalNodes>
+          <leafValues>
+            1.8304300308227539e-01 -8.5605643689632416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 2.0626676268875599e-03</internalNodes>
+          <leafValues>
+            2.5438303127884865e-02 -5.9883767366409302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 2.7453177608549595e-05</internalNodes>
+          <leafValues>
+            -1.3831512629985809e-01 1.0590004175901413e-01</leafValues></_></weakClassifiers></_>
+    <!-- stage 18 -->
+    <_>
+      <maxWeakCount>98</maxWeakCount>
+      <stageThreshold>-1.2823635339736938e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 840 -8.7535101920366287e-03</internalNodes>
+          <leafValues>
+            3.7845414876937866e-01 -1.2724789977073669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -5.7867290452122688e-03</internalNodes>
+          <leafValues>
+            4.6451708674430847e-01 -1.0028645396232605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -1.5636831521987915e-02</internalNodes>
+          <leafValues>
+            2.7137696743011475e-01 -1.3237486779689789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 7.9419813118875027e-04</internalNodes>
+          <leafValues>
+            -2.2457434237003326e-01 1.8765783309936523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 9.8101666662842035e-04</internalNodes>
+          <leafValues>
+            -1.1674020439386368e-01 2.3788549005985260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -1.1779682245105505e-03</internalNodes>
+          <leafValues>
+            2.5913080573081970e-01 -8.3949849009513855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 9.6748135983943939e-03</internalNodes>
+          <leafValues>
+            -8.3296068012714386e-02 3.4700453281402588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 2.9431451112031937e-03</internalNodes>
+          <leafValues>
+            4.6826824545860291e-02 -5.1865130662918091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -1.0496248723939061e-03</internalNodes>
+          <leafValues>
+            -2.9976195096969604e-01 6.9594070315361023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -1.6385620459914207e-02</internalNodes>
+          <leafValues>
+            2.1480703353881836e-01 -9.7807772457599640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 4.9830954521894455e-03</internalNodes>
+          <leafValues>
+            2.2837642580270767e-02 -7.7743059396743774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 -3.1421617604792118e-03</internalNodes>
+          <leafValues>
+            -5.6898134946823120e-01 3.6988433450460434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 1.6069117933511734e-02</internalNodes>
+          <leafValues>
+            -1.0548119246959686e-01 1.9650301337242126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 1.5043821185827255e-02</internalNodes>
+          <leafValues>
+            -1.0749972611665726e-01 2.0178599655628204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 6.8444460630416870e-03</internalNodes>
+          <leafValues>
+            5.0306834280490875e-02 -4.3162798881530762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 1.1850953102111816e-02</internalNodes>
+          <leafValues>
+            3.2905589789152145e-02 -5.1617246866226196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 2.1246306598186493e-02</internalNodes>
+          <leafValues>
+            -6.3726536929607391e-02 3.0544599890708923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 1.1852337047457695e-02</internalNodes>
+          <leafValues>
+            -8.9553833007812500e-02 2.9359081387519836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 -2.5085010565817356e-03</internalNodes>
+          <leafValues>
+            2.2805334627628326e-01 -9.5263637602329254e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 7.5797801837325096e-03</internalNodes>
+          <leafValues>
+            3.8756053894758224e-02 -5.7552194595336914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 5.4980744607746601e-03</internalNodes>
+          <leafValues>
+            4.6144284307956696e-02 -3.6506399512290955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 -3.0190458055585623e-03</internalNodes>
+          <leafValues>
+            -2.9709556698799133e-01 7.5851216912269592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 -7.0441095158457756e-03</internalNodes>
+          <leafValues>
+            1.6086654365062714e-01 -1.1914677917957306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 -6.9178184494376183e-03</internalNodes>
+          <leafValues>
+            -4.1069602966308594e-01 4.4916272163391113e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 5.0740875303745270e-03</internalNodes>
+          <leafValues>
+            -7.4677795171737671e-02 2.4945564568042755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -1.0403880849480629e-02</internalNodes>
+          <leafValues>
+            -5.3336864709854126e-01 3.9480298757553101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 2.3738082963973284e-03</internalNodes>
+          <leafValues>
+            -7.8084513545036316e-02 2.3774850368499756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 2.7033074729843065e-05</internalNodes>
+          <leafValues>
+            -1.8558554351329803e-01 9.6640095114707947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 2.9049259610474110e-03</internalNodes>
+          <leafValues>
+            4.6409133821725845e-02 -3.9720407128334045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -5.6298477575182915e-03</internalNodes>
+          <leafValues>
+            -4.5908093452453613e-01 3.7730857729911804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 5.0751655362546444e-03</internalNodes>
+          <leafValues>
+            2.3507807403802872e-02 -6.4602053165435791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -7.5826002284884453e-04</internalNodes>
+          <leafValues>
+            1.2444372475147247e-01 -1.3639765977859497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -9.7201213240623474e-02</internalNodes>
+          <leafValues>
+            3.9986947178840637e-01 -4.4366274029016495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -2.3840454220771790e-01</internalNodes>
+          <leafValues>
+            -5.3094118833541870e-01 3.8410611450672150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -1.3428549282252789e-02</internalNodes>
+          <leafValues>
+            2.2794343531131744e-01 -7.7827021479606628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -5.0623202696442604e-04</internalNodes>
+          <leafValues>
+            1.5778008103370667e-01 -1.2732668220996857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -8.6578715126961470e-04</internalNodes>
+          <leafValues>
+            1.4809772372245789e-01 -1.1785575747489929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -2.7892580255866051e-03</internalNodes>
+          <leafValues>
+            -4.2324438691139221e-01 4.1194166988134384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 2.9110969044268131e-03</internalNodes>
+          <leafValues>
+            -1.2145258486270905e-01 1.4758351445198059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -1.7908504605293274e-01</internalNodes>
+          <leafValues>
+            4.0684828162193298e-01 -4.6298943459987640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 4.2685694643296301e-04</internalNodes>
+          <leafValues>
+            -9.4548642635345459e-02 1.8615303933620453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 1.9871112704277039e-01</internalNodes>
+          <leafValues>
+            -5.6818448007106781e-02 3.2197028398513794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 1.2496551498770714e-03</internalNodes>
+          <leafValues>
+            -7.0664338767528534e-02 2.5729593634605408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 1.6119793057441711e-02</internalNodes>
+          <leafValues>
+            -5.0713617354631424e-02 3.9684635400772095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 -2.5047704111784697e-03</internalNodes>
+          <leafValues>
+            -3.5733562707901001e-01 4.9460943788290024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 5.2866833284497261e-03</internalNodes>
+          <leafValues>
+            3.2510578632354736e-02 -4.4326359033584595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 -3.4677600488066673e-03</internalNodes>
+          <leafValues>
+            2.3254001140594482e-01 -7.3516972362995148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -3.3557973802089691e-03</internalNodes>
+          <leafValues>
+            2.3221854865550995e-01 -6.9719336926937103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 -6.3276281580328941e-03</internalNodes>
+          <leafValues>
+            -4.0112924575805664e-01 4.3525256216526031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -4.3456726707518101e-03</internalNodes>
+          <leafValues>
+            -6.8020933866500854e-01 1.9806224852800369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 6.2400596216320992e-03</internalNodes>
+          <leafValues>
+            1.8352568149566650e-02 -7.0223194360733032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 3.3795731142163277e-03</internalNodes>
+          <leafValues>
+            4.3487045913934708e-02 -3.0831974744796753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 1.3499217107892036e-02</internalNodes>
+          <leafValues>
+            -4.4923197478055954e-02 3.2624542713165283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 -1.0585743002593517e-03</internalNodes>
+          <leafValues>
+            1.6033367812633514e-01 -9.8465800285339355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 -5.3765797056257725e-03</internalNodes>
+          <leafValues>
+            2.6544988155364990e-01 -6.7050188779830933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 -2.4880110286176205e-03</internalNodes>
+          <leafValues>
+            -2.9397118091583252e-01 5.4097402840852737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -2.1792344748973846e-02</internalNodes>
+          <leafValues>
+            -7.2506862878799438e-01 1.9187789410352707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 4.7056311741471291e-03</internalNodes>
+          <leafValues>
+            -5.2215453237295151e-02 3.1615570187568665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -4.2645912617444992e-03</internalNodes>
+          <leafValues>
+            2.3567616939544678e-01 -6.8938009440898895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 5.8556320145726204e-03</internalNodes>
+          <leafValues>
+            4.2000979185104370e-02 -4.6045160293579102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 1.3632343616336584e-03</internalNodes>
+          <leafValues>
+            -6.5663956105709076e-02 2.3397234082221985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 -6.0495175421237946e-03</internalNodes>
+          <leafValues>
+            -4.3943586945533752e-01 3.6742802709341049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 6.7223357036709785e-03</internalNodes>
+          <leafValues>
+            1.9922675564885139e-02 -6.8767511844635010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -5.1960002630949020e-02</internalNodes>
+          <leafValues>
+            -7.5993520021438599e-01 1.5627101063728333e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 3.3762669190764427e-03</internalNodes>
+          <leafValues>
+            -7.7943108975887299e-02 1.9545321166515350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -1.8302195239812136e-03</internalNodes>
+          <leafValues>
+            1.9154363870620728e-01 -9.4946600496768951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -4.3824277818202972e-03</internalNodes>
+          <leafValues>
+            -5.3172159194946289e-01 2.8438575565814972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 4.8605538904666901e-03</internalNodes>
+          <leafValues>
+            1.8084224313497543e-02 -7.0419138669967651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -5.0755832344293594e-03</internalNodes>
+          <leafValues>
+            1.3961549103260040e-01 -1.0557857155799866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 9.0303886681795120e-03</internalNodes>
+          <leafValues>
+            -5.6681722402572632e-02 3.0537691712379456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 1.7635107040405273e-01</internalNodes>
+          <leafValues>
+            -3.5581633448600769e-02 3.9358299970626831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 1.1068049352616072e-03</internalNodes>
+          <leafValues>
+            -9.6729792654514313e-02 1.6677951812744141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 1.1059102602303028e-02</internalNodes>
+          <leafValues>
+            2.9283966869115829e-02 -5.1121145486831665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -5.0462923943996429e-02</internalNodes>
+          <leafValues>
+            -4.2722624540328979e-01 3.1082244589924812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -3.8071773014962673e-03</internalNodes>
+          <leafValues>
+            2.9747742414474487e-01 -5.1289469003677368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 -1.5183673240244389e-03</internalNodes>
+          <leafValues>
+            1.8215130269527435e-01 -1.0301912575960159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 2.1069757640361786e-02</internalNodes>
+          <leafValues>
+            2.4503789842128754e-02 -5.8991265296936035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 6.6435593180358410e-03</internalNodes>
+          <leafValues>
+            4.3313629925251007e-02 -3.1504327058792114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -8.2504414021968842e-03</internalNodes>
+          <leafValues>
+            -4.7998124361038208e-01 3.0433293431997299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -1.0892231017351151e-02</internalNodes>
+          <leafValues>
+            3.1449675559997559e-01 -5.2475348114967346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 8.1554818898439407e-03</internalNodes>
+          <leafValues>
+            3.9224579930305481e-02 -3.8470247387886047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 -5.4475883953273296e-03</internalNodes>
+          <leafValues>
+            -6.5578418970108032e-01 2.0117431879043579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -2.6005427935160697e-04</internalNodes>
+          <leafValues>
+            1.4328984916210175e-01 -9.8999619483947754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 1.3821206521242857e-03</internalNodes>
+          <leafValues>
+            -5.2590593695640564e-02 2.7557003498077393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -1.1740636080503464e-02</internalNodes>
+          <leafValues>
+            2.7564841508865356e-01 -5.9799015522003174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 2.7866149321198463e-03</internalNodes>
+          <leafValues>
+            5.0002526491880417e-02 -3.5232934355735779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 6.6179647110402584e-03</internalNodes>
+          <leafValues>
+            -6.3348092138767242e-02 2.3150660097599030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -1.3244405854493380e-03</internalNodes>
+          <leafValues>
+            -2.6642721891403198e-01 5.5936500430107117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 1.1830568313598633e-02</internalNodes>
+          <leafValues>
+            -6.9061063230037689e-02 2.1172530949115753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 2.5925931986421347e-03</internalNodes>
+          <leafValues>
+            1.9716180860996246e-02 -7.7208590507507324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -2.8010653331875801e-03</internalNodes>
+          <leafValues>
+            1.3846111297607422e-01 -9.7015053033828735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 -4.7637272626161575e-02</internalNodes>
+          <leafValues>
+            2.1245625615119934e-01 -7.0445045828819275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 1.3677144888788462e-03</internalNodes>
+          <leafValues>
+            -8.5676178336143494e-02 1.9613882899284363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -1.3261453807353973e-01</internalNodes>
+          <leafValues>
+            4.3639957904815674e-01 -3.4653130918741226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 7.1225965023040771e-01</internalNodes>
+          <leafValues>
+            1.9474601373076439e-02 -8.7232232093811035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 -5.9057516045868397e-03</internalNodes>
+          <leafValues>
+            -3.7135502696037292e-01 3.5206548869609833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 3.5532126203179359e-03</internalNodes>
+          <leafValues>
+            -6.6334858536720276e-02 2.3531165719032288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -1.9724387675523758e-02</internalNodes>
+          <leafValues>
+            2.5173032283782959e-01 -5.7575348764657974e-02</leafValues></_></weakClassifiers></_>
+    <!-- stage 19 -->
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.3067311048507690e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 458 8.1832958385348320e-03</internalNodes>
+          <leafValues>
+            -1.1180391162633896e-01 3.9526882767677307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -5.5650249123573303e-03</internalNodes>
+          <leafValues>
+            3.3437621593475342e-01 -1.2654128670692444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 8.1406952813267708e-04</internalNodes>
+          <leafValues>
+            -1.7086146771907806e-01 1.8384252488613129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -2.0645279437303543e-03</internalNodes>
+          <leafValues>
+            1.7057111859321594e-01 -1.7103828489780426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 1.9037863239645958e-03</internalNodes>
+          <leafValues>
+            -1.6791534423828125e-01 1.5749432146549225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 1.1136581189930439e-02</internalNodes>
+          <leafValues>
+            4.0173061192035675e-02 -3.7364640831947327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 5.6379067245870829e-04</internalNodes>
+          <leafValues>
+            -1.6792711615562439e-01 1.4207355678081512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 -3.3720356877893209e-03</internalNodes>
+          <leafValues>
+            2.5698736310005188e-01 -7.5178287923336029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 -1.7311582341790199e-02</internalNodes>
+          <leafValues>
+            -5.2065086364746094e-01 4.7350786626338959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 -3.3407085575163364e-03</internalNodes>
+          <leafValues>
+            -4.5184752345085144e-01 3.2597322016954422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -3.4317255020141602e-02</internalNodes>
+          <leafValues>
+            2.5700893998146057e-01 -8.3455510437488556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -6.8267658352851868e-02</internalNodes>
+          <leafValues>
+            2.8288829326629639e-01 -7.8631594777107239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 2.8722581191686913e-05</internalNodes>
+          <leafValues>
+            -1.8466357886791229e-01 1.1576397716999054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 9.9579263478517532e-03</internalNodes>
+          <leafValues>
+            -6.3400641083717346e-02 3.6796927452087402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -1.8424488604068756e-02</internalNodes>
+          <leafValues>
+            2.4584248661994934e-01 -9.4283707439899445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 6.8876314908266068e-03</internalNodes>
+          <leafValues>
+            -9.9725127220153809e-02 2.8111982345581055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -2.2637452930212021e-03</internalNodes>
+          <leafValues>
+            -4.1033151745796204e-01 6.1188895255327225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 -8.5531552031170577e-05</internalNodes>
+          <leafValues>
+            1.1543370783329010e-01 -1.6276736557483673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 3.3203132450580597e-02</internalNodes>
+          <leafValues>
+            4.8811107873916626e-02 -3.7535405158996582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 5.1993243396282196e-03</internalNodes>
+          <leafValues>
+            3.9811953902244568e-02 -4.8758861422538757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 4.8818998038768768e-03</internalNodes>
+          <leafValues>
+            2.4118293076753616e-02 -6.7809182405471802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 -7.2956003248691559e-02</internalNodes>
+          <leafValues>
+            1.8825025856494904e-01 -9.5193333923816681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 9.4123989343643188e-02</internalNodes>
+          <leafValues>
+            -7.2761356830596924e-02 2.7999758720397949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 1.0472428984940052e-03</internalNodes>
+          <leafValues>
+            -7.4624419212341309e-02 2.4220877885818481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 8.0979522317647934e-03</internalNodes>
+          <leafValues>
+            -5.4950036108493805e-02 3.0833497643470764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -2.8517602477222681e-03</internalNodes>
+          <leafValues>
+            3.2442548871040344e-01 -7.1306072175502777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 3.7457090802490711e-03</internalNodes>
+          <leafValues>
+            5.7812750339508057e-02 -3.3119776844978333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -3.9520347490906715e-03</internalNodes>
+          <leafValues>
+            -4.3750977516174316e-01 3.9293695241212845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 -5.8175362646579742e-03</internalNodes>
+          <leafValues>
+            2.0937338471412659e-01 -8.1724949181079865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 7.8594256192445755e-03</internalNodes>
+          <leafValues>
+            4.8747915774583817e-02 -4.1596582531929016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 -6.7130924435332417e-04</internalNodes>
+          <leafValues>
+            1.4715777337551117e-01 -1.2916122376918793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -4.2964564636349678e-03</internalNodes>
+          <leafValues>
+            -3.5870963335037231e-01 4.8831127583980560e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 -3.8814521394670010e-03</internalNodes>
+          <leafValues>
+            -4.7464737296104431e-01 3.4466378390789032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -1.8017216352745891e-03</internalNodes>
+          <leafValues>
+            -3.5517925024032593e-01 4.9101348966360092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 7.7566690742969513e-03</internalNodes>
+          <leafValues>
+            2.7035165578126907e-02 -5.5951416492462158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 1.9125882536172867e-03</internalNodes>
+          <leafValues>
+            -6.3309118151664734e-02 2.5223699212074280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -9.9804997444152832e-04</internalNodes>
+          <leafValues>
+            2.4349449574947357e-01 -8.9007876813411713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -7.5093598570674658e-04</internalNodes>
+          <leafValues>
+            1.3702079653739929e-01 -1.2293258309364319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.0788314975798130e-02</internalNodes>
+          <leafValues>
+            -7.3592424392700195e-02 2.3694764077663422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 -1.2814668007194996e-03</internalNodes>
+          <leafValues>
+            1.7014959454536438e-01 -9.3263216316699982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 3.5997035447508097e-03</internalNodes>
+          <leafValues>
+            2.4880735203623772e-02 -5.7666695117950439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 5.9913634322583675e-03</internalNodes>
+          <leafValues>
+            -6.6571407020092010e-02 2.3750782012939453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 3.7381309084594250e-03</internalNodes>
+          <leafValues>
+            3.7266705185174942e-02 -4.3619966506958008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 8.8815446943044662e-03</internalNodes>
+          <leafValues>
+            3.0544634908437729e-02 -4.6924960613250732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -3.1860180199146271e-02</internalNodes>
+          <leafValues>
+            -4.8059463500976562e-01 3.1165035441517830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -5.4914336651563644e-03</internalNodes>
+          <leafValues>
+            1.7584608495235443e-01 -9.0091012418270111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -1.2325609102845192e-02</internalNodes>
+          <leafValues>
+            3.4678825736045837e-01 -5.6969922035932541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 5.8694169856607914e-03</internalNodes>
+          <leafValues>
+            3.9381653070449829e-02 -4.6237498521804810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -5.0925426185131073e-03</internalNodes>
+          <leafValues>
+            -4.0191245079040527e-01 4.1170045733451843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 4.5132841914892197e-03</internalNodes>
+          <leafValues>
+            2.7933681383728981e-02 -4.8419687151908875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 2.2130757570266724e-02</internalNodes>
+          <leafValues>
+            2.1358741447329521e-02 -6.0434627532958984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 -1.8624030053615570e-03</internalNodes>
+          <leafValues>
+            1.9556084275245667e-01 -7.8905813395977020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 3.2466566190123558e-03</internalNodes>
+          <leafValues>
+            -8.3141714334487915e-02 2.5859814882278442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 1.9641252234578133e-02</internalNodes>
+          <leafValues>
+            2.1901637315750122e-02 -7.2247391939163208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 1.2722628191113472e-02</internalNodes>
+          <leafValues>
+            -4.9173772335052490e-02 3.1656193733215332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -3.9457585080526769e-04</internalNodes>
+          <leafValues>
+            1.7969387769699097e-01 -1.0087045282125473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -3.0111533123999834e-04</internalNodes>
+          <leafValues>
+            1.2916654348373413e-01 -1.5019074082374573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -4.1901473887264729e-03</internalNodes>
+          <leafValues>
+            1.6727919876575470e-01 -9.4101771712303162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 -2.9096096754074097e-02</internalNodes>
+          <leafValues>
+            2.4397623538970947e-01 -6.5033406019210815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -3.0687432736158371e-02</internalNodes>
+          <leafValues>
+            -5.3695982694625854e-01 3.6870311945676804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 8.9634142816066742e-02</internalNodes>
+          <leafValues>
+            -4.5044522732496262e-02 3.7668040394783020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -1.8486939370632172e-02</internalNodes>
+          <leafValues>
+            -4.5869186520576477e-01 3.6696173250675201e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -2.0481455139815807e-03</internalNodes>
+          <leafValues>
+            1.9705456495285034e-01 -8.1085532903671265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 7.9915560781955719e-03</internalNodes>
+          <leafValues>
+            2.6794398203492165e-02 -6.0658437013626099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -4.5167207717895508e-03</internalNodes>
+          <leafValues>
+            -3.5664665699005127e-01 4.1606105864048004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 -8.8896900415420532e-03</internalNodes>
+          <leafValues>
+            -5.6794744729995728e-01 2.4264462292194366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -2.7863893657922745e-02</internalNodes>
+          <leafValues>
+            -6.6293621063232422e-01 1.7915287986397743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 1.9837494473904371e-03</internalNodes>
+          <leafValues>
+            -5.5686347186565399e-02 2.7396288514137268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 -2.9144049622118473e-03</internalNodes>
+          <leafValues>
+            -4.3623712658882141e-01 3.1940482556819916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -1.1720246402546763e-03</internalNodes>
+          <leafValues>
+            1.5299941599369049e-01 -8.8886320590972900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 2.1249109413474798e-03</internalNodes>
+          <leafValues>
+            -7.1360021829605103e-02 2.0698173344135284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 4.6013649553060532e-03</internalNodes>
+          <leafValues>
+            2.5328675284981728e-02 -5.1310408115386963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -9.4112986698746681e-04</internalNodes>
+          <leafValues>
+            -2.9404127597808838e-01 4.4868268072605133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 5.2681900560855865e-03</internalNodes>
+          <leafValues>
+            -6.4163528382778168e-02 2.2999708354473114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 1.4232876710593700e-03</internalNodes>
+          <leafValues>
+            -7.8037962317466736e-02 1.9061613082885742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -1.0191567242145538e-02</internalNodes>
+          <leafValues>
+            -5.7409489154815674e-01 2.2581731900572777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -4.9564028158783913e-03</internalNodes>
+          <leafValues>
+            2.4646909534931183e-01 -5.9094201773405075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 2.2057720925658941e-03</internalNodes>
+          <leafValues>
+            -9.8776444792747498e-02 1.9191808998584747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -4.7279503196477890e-03</internalNodes>
+          <leafValues>
+            -2.9638877511024475e-01 4.7132529318332672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 1.8900397699326277e-03</internalNodes>
+          <leafValues>
+            -1.2390431761741638e-01 1.2199163436889648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -3.9616838330402970e-04</internalNodes>
+          <leafValues>
+            -2.0177872478961945e-01 6.7829817533493042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 1.5198520850390196e-03</internalNodes>
+          <leafValues>
+            -5.0418090075254440e-02 2.8014704585075378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -3.0729006975889206e-03</internalNodes>
+          <leafValues>
+            1.6384753584861755e-01 -9.6394442021846771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 3.3707641065120697e-02</internalNodes>
+          <leafValues>
+            3.3062599599361420e-02 -4.3530252575874329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 -2.7547087520360947e-03</internalNodes>
+          <leafValues>
+            -6.2498420476913452e-01 2.0407166332006454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 1.0800797026604414e-03</internalNodes>
+          <leafValues>
+            4.3235320597887039e-02 -3.1784874200820923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -2.4060246068984270e-03</internalNodes>
+          <leafValues>
+            1.3923163712024689e-01 -9.8239123821258545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 4.6191983856260777e-03</internalNodes>
+          <leafValues>
+            2.3523205891251564e-02 -6.0865134000778198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 2.1874131634831429e-03</internalNodes>
+          <leafValues>
+            -4.4655255973339081e-02 3.2406413555145264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 7.9257078468799591e-03</internalNodes>
+          <leafValues>
+            2.8643675148487091e-02 -5.0231784582138062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 9.6561573445796967e-03</internalNodes>
+          <leafValues>
+            -6.7481219768524170e-02 2.0780794322490692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -4.3771188706159592e-02</internalNodes>
+          <leafValues>
+            2.0091144740581512e-01 -8.7350860238075256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -3.9570517838001251e-02</internalNodes>
+          <leafValues>
+            -6.9823634624481201e-01 2.2996466606855392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 -7.4827047064900398e-03</internalNodes>
+          <leafValues>
+            -3.2485857605934143e-01 4.2747449129819870e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 -9.5894857076928020e-04</internalNodes>
+          <leafValues>
+            1.3692225515842438e-01 -1.0624063760042191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 -5.6482471525669098e-02</internalNodes>
+          <leafValues>
+            2.7130955457687378e-01 -5.5133864283561707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -5.5641448125243187e-03</internalNodes>
+          <leafValues>
+            -6.5910613536834717e-01 2.6108600199222565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 4.5432001352310181e-03</internalNodes>
+          <leafValues>
+            -1.0277131199836731e-01 1.4715240895748138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 -1.9441416952759027e-03</internalNodes>
+          <leafValues>
+            1.7929133772850037e-01 -7.8247167170047760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 1.5584268840029836e-03</internalNodes>
+          <leafValues>
+            5.2101351320743561e-02 -2.7727204561233521e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          0 0 6 1 -1.</_>
+        <_>
+          3 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 1 -1.</_>
+        <_>
+          4 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 2 -1.</_>
+        <_>
+          4 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 6 -1.</_>
+        <_>
+          0 0 4 3 2.</_>
+        <_>
+          4 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 1 -1.</_>
+        <_>
+          5 0 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 1 -1.</_>
+        <_>
+          6 0 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 2 -1.</_>
+        <_>
+          6 0 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 8 -1.</_>
+        <_>
+          0 0 7 4 2.</_>
+        <_>
+          7 4 7 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 8 -1.</_>
+        <_>
+          0 0 8 4 2.</_>
+        <_>
+          8 4 8 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 10 -1.</_>
+        <_>
+          0 0 8 5 2.</_>
+        <_>
+          8 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 1 -1.</_>
+        <_>
+          12 0 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 10 -1.</_>
+        <_>
+          0 5 13 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 10 -1.</_>
+        <_>
+          0 1 8 5 2.</_>
+        <_>
+          8 6 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 15 -1.</_>
+        <_>
+          0 6 13 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 12 -1.</_>
+        <_>
+          0 2 4 6 2.</_>
+        <_>
+          4 8 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 4 -1.</_>
+        <_>
+          0 2 5 2 2.</_>
+        <_>
+          5 4 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 24 2 -1.</_>
+        <_>
+          0 4 12 1 2.</_>
+        <_>
+          12 5 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 9 -1.</_>
+        <_>
+          0 8 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 2 -1.</_>
+        <_>
+          0 5 12 1 2.</_>
+        <_>
+          12 6 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 4 -1.</_>
+        <_>
+          0 5 12 2 2.</_>
+        <_>
+          12 7 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 8 -1.</_>
+        <_>
+          0 8 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 22 17 -1.</_>
+        <_>
+          11 6 11 17 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 2 -1.</_>
+        <_>
+          0 6 12 1 2.</_>
+        <_>
+          12 7 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 8 -1.</_>
+        <_>
+          0 10 14 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 3 -1.</_>
+        <_>
+          0 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 16 -1.</_>
+        <_>
+          3 7 3 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 9 -1.</_>
+        <_>
+          0 10 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 17 -1.</_>
+        <_>
+          4 7 4 17 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 2 -1.</_>
+        <_>
+          6 7 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 16 -1.</_>
+        <_>
+          2 8 2 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 24 6 -1.</_>
+        <_>
+          0 8 12 3 2.</_>
+        <_>
+          12 11 12 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 1 3 -1.</_>
+        <_>
+          0 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 2 -1.</_>
+        <_>
+          0 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 2 -1.</_>
+        <_>
+          0 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 22 2 -1.</_>
+        <_>
+          0 9 11 1 2.</_>
+        <_>
+          11 10 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 2 -1.</_>
+        <_>
+          0 9 12 1 2.</_>
+        <_>
+          12 10 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 4 -1.</_>
+        <_>
+          0 9 12 2 2.</_>
+        <_>
+          12 11 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 2 -1.</_>
+        <_>
+          0 11 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 10 -1.</_>
+        <_>
+          2 10 2 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 3 -1.</_>
+        <_>
+          0 11 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 5 3 -1.</_>
+        <_>
+          0 11 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 22 2 -1.</_>
+        <_>
+          0 10 11 1 2.</_>
+        <_>
+          11 11 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 2 -1.</_>
+        <_>
+          0 10 12 1 2.</_>
+        <_>
+          12 11 12 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 4 -1.</_>
+        <_>
+          0 10 12 2 2.</_>
+        <_>
+          12 12 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 14 -1.</_>
+        <_>
+          12 10 12 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 3 3 -1.</_>
+        <_>
+          0 12 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          0 11 3 4 2.</_>
+        <_>
+          3 15 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 4 -1.</_>
+        <_>
+          0 11 12 2 2.</_>
+        <_>
+          12 13 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 7 -1.</_>
+        <_>
+          9 12 9 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 22 2 -1.</_>
+        <_>
+          0 12 11 1 2.</_>
+        <_>
+          11 13 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 24 6 -1.</_>
+        <_>
+          12 12 12 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 3 -1.</_>
+        <_>
+          6 13 12 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 7 -1.</_>
+        <_>
+          4 14 4 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 10 -1.</_>
+        <_>
+          0 14 6 5 2.</_>
+        <_>
+          6 19 6 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 8 -1.</_>
+        <_>
+          6 14 6 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 10 -1.</_>
+        <_>
+          10 14 10 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 15 3 8 -1.</_>
+        <_>
+          1 15 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 3 7 -1.</_>
+        <_>
+          1 16 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 19 6 3 -1.</_>
+        <_>
+          0 20 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 19 9 3 -1.</_>
+        <_>
+          0 20 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 21 6 3 -1.</_>
+        <_>
+          0 22 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 21 7 3 -1.</_>
+        <_>
+          0 22 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 1 4 -1.</_>
+        <_>
+          1 2 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 3 -1.</_>
+        <_>
+          4 0 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 6 -1.</_>
+        <_>
+          1 0 4 3 2.</_>
+        <_>
+          5 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 4 -1.</_>
+        <_>
+          5 0 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 22 2 -1.</_>
+        <_>
+          1 0 11 1 2.</_>
+        <_>
+          12 1 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 21 15 -1.</_>
+        <_>
+          8 8 7 5 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 11 3 -1.</_>
+        <_>
+          1 4 11 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 5 3 3 -1.</_>
+        <_>
+          1 6 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 5 21 6 -1.</_>
+        <_>
+          8 7 7 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 5 22 2 -1.</_>
+        <_>
+          1 5 11 1 2.</_>
+        <_>
+          12 6 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 3 -1.</_>
+        <_>
+          1 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 5 3 -1.</_>
+        <_>
+          1 7 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 22 2 -1.</_>
+        <_>
+          1 6 11 1 2.</_>
+        <_>
+          12 7 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 22 17 -1.</_>
+        <_>
+          12 6 11 17 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 20 3 -1.</_>
+        <_>
+          1 7 20 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 6 -1.</_>
+        <_>
+          5 9 4 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 6 -1.</_>
+        <_>
+          1 9 8 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 20 4 -1.</_>
+        <_>
+          1 7 10 2 2.</_>
+        <_>
+          11 9 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 22 12 -1.</_>
+        <_>
+          1 11 22 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 2 -1.</_>
+        <_>
+          1 8 4 1 2.</_>
+        <_>
+          5 9 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 9 3 -1.</_>
+        <_>
+          1 9 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 22 4 -1.</_>
+        <_>
+          1 8 11 2 2.</_>
+        <_>
+          12 10 11 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 20 2 -1.</_>
+        <_>
+          1 9 10 1 2.</_>
+        <_>
+          11 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 3 -1.</_>
+        <_>
+          3 10 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 4 -1.</_>
+        <_>
+          1 11 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 2 -1.</_>
+        <_>
+          1 10 11 1 2.</_>
+        <_>
+          12 11 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 21 4 -1.</_>
+        <_>
+          1 11 21 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 3 13 -1.</_>
+        <_>
+          2 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 3 10 -1.</_>
+        <_>
+          2 13 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 14 22 2 -1.</_>
+        <_>
+          1 14 11 1 2.</_>
+        <_>
+          12 15 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 16 3 1 -1.</_>
+        <_>
+          2 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 1 -1.</_>
+        <_>
+          2 18 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 19 4 1 -1.</_>
+        <_>
+          2 20 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 1 -1.</_>
+        <_>
+          4 0 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 14 -1.</_>
+        <_>
+          6 0 4 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 20 1 -1.</_>
+        <_>
+          7 0 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 22 1 -1.</_>
+        <_>
+          13 0 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 22 2 -1.</_>
+        <_>
+          2 2 11 1 2.</_>
+        <_>
+          13 3 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 22 10 -1.</_>
+        <_>
+          2 2 11 5 2.</_>
+        <_>
+          13 7 11 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 1 -1.</_>
+        <_>
+          7 3 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 2 -1.</_>
+        <_>
+          2 3 10 1 2.</_>
+        <_>
+          12 4 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 3 3 -1.</_>
+        <_>
+          2 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 20 2 -1.</_>
+        <_>
+          2 4 10 1 2.</_>
+        <_>
+          12 5 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 2 3 -1.</_>
+        <_>
+          2 6 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 20 2 -1.</_>
+        <_>
+          2 5 10 1 2.</_>
+        <_>
+          12 6 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 20 2 -1.</_>
+        <_>
+          2 6 10 1 2.</_>
+        <_>
+          12 7 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 21 18 -1.</_>
+        <_>
+          2 15 21 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 2 -1.</_>
+        <_>
+          2 7 3 1 2.</_>
+        <_>
+          5 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 9 6 -1.</_>
+        <_>
+          5 9 3 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 7 3 -1.</_>
+        <_>
+          2 8 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 2 -1.</_>
+        <_>
+          2 8 18 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 3 -1.</_>
+        <_>
+          2 8 18 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 21 4 -1.</_>
+        <_>
+          2 8 21 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 2 -1.</_>
+        <_>
+          4 8 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 22 2 -1.</_>
+        <_>
+          2 8 11 1 2.</_>
+        <_>
+          13 9 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 2 -1.</_>
+        <_>
+          2 9 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 20 3 -1.</_>
+        <_>
+          2 10 20 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 22 2 -1.</_>
+        <_>
+          2 11 11 1 2.</_>
+        <_>
+          13 12 11 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 22 7 -1.</_>
+        <_>
+          13 12 11 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 19 10 -1.</_>
+        <_>
+          2 17 19 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 13 3 8 -1.</_>
+        <_>
+          3 13 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 13 20 10 -1.</_>
+        <_>
+          12 13 10 10 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 6 2 -1.</_>
+        <_>
+          5 15 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 6 3 -1.</_>
+        <_>
+          5 15 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 20 4 -1.</_>
+        <_>
+          2 15 10 2 2.</_>
+        <_>
+          12 17 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 6 -1.</_>
+        <_>
+          2 16 3 3 2.</_>
+        <_>
+          5 19 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 3 1 -1.</_>
+        <_>
+          3 18 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 18 3 5 -1.</_>
+        <_>
+          3 18 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 21 12 3 -1.</_>
+        <_>
+          8 21 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 20 1 -1.</_>
+        <_>
+          3 2 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 8 6 -1.</_>
+        <_>
+          5 3 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 4 -1.</_>
+        <_>
+          3 4 3 2 2.</_>
+        <_>
+          6 6 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 18 2 -1.</_>
+        <_>
+          3 4 9 1 2.</_>
+        <_>
+          12 5 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 20 2 -1.</_>
+        <_>
+          3 5 10 1 2.</_>
+        <_>
+          13 6 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 20 6 -1.</_>
+        <_>
+          3 5 10 3 2.</_>
+        <_>
+          13 8 10 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 3 -1.</_>
+        <_>
+          3 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 8 -1.</_>
+        <_>
+          3 8 16 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 19 6 -1.</_>
+        <_>
+          3 8 19 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 5 4 -1.</_>
+        <_>
+          3 8 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 6 -1.</_>
+        <_>
+          3 7 9 3 2.</_>
+        <_>
+          12 10 9 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 17 6 -1.</_>
+        <_>
+          3 9 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 19 2 -1.</_>
+        <_>
+          3 8 19 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 18 4 -1.</_>
+        <_>
+          3 8 9 2 2.</_>
+        <_>
+          12 10 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 20 4 -1.</_>
+        <_>
+          3 8 10 2 2.</_>
+        <_>
+          13 10 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 1 -1.</_>
+        <_>
+          4 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 3 -1.</_>
+        <_>
+          4 10 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 9 -1.</_>
+        <_>
+          3 12 8 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 20 2 -1.</_>
+        <_>
+          3 9 10 1 2.</_>
+        <_>
+          13 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 19 9 -1.</_>
+        <_>
+          3 12 19 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 1 -1.</_>
+        <_>
+          4 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 1 -1.</_>
+        <_>
+          4 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 2 -1.</_>
+        <_>
+          4 11 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 4 -1.</_>
+        <_>
+          3 11 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 3 -1.</_>
+        <_>
+          3 11 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 18 4 -1.</_>
+        <_>
+          3 10 9 2 2.</_>
+        <_>
+          12 12 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 1 -1.</_>
+        <_>
+          4 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 8 -1.</_>
+        <_>
+          4 11 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 8 -1.</_>
+        <_>
+          3 15 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 18 2 -1.</_>
+        <_>
+          3 11 9 1 2.</_>
+        <_>
+          12 12 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 10 2 -1.</_>
+        <_>
+          3 11 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 2 -1.</_>
+        <_>
+          4 13 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 12 -1.</_>
+        <_>
+          3 16 8 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 3 -1.</_>
+        <_>
+          5 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 6 4 -1.</_>
+        <_>
+          3 16 3 2 2.</_>
+        <_>
+          6 18 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 8 6 -1.</_>
+        <_>
+          3 16 4 3 2.</_>
+        <_>
+          7 19 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 20 3 4 -1.</_>
+        <_>
+          4 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 4 -1.</_>
+        <_>
+          6 2 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 2 -1.</_>
+        <_>
+          5 2 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 2 -1.</_>
+        <_>
+          4 2 8 1 2.</_>
+        <_>
+          12 3 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 1 -1.</_>
+        <_>
+          6 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 3 -1.</_>
+        <_>
+          7 3 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 2 -1.</_>
+        <_>
+          4 3 8 1 2.</_>
+        <_>
+          12 4 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 6 -1.</_>
+        <_>
+          4 6 9 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 8 -1.</_>
+        <_>
+          4 7 16 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 1 4 -1.</_>
+        <_>
+          4 6 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 9 4 -1.</_>
+        <_>
+          7 7 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 2 -1.</_>
+        <_>
+          4 4 8 1 2.</_>
+        <_>
+          12 5 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 18 6 -1.</_>
+        <_>
+          4 6 18 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 20 6 -1.</_>
+        <_>
+          4 6 20 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 5 -1.</_>
+        <_>
+          6 5 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 6 -1.</_>
+        <_>
+          4 5 8 3 2.</_>
+        <_>
+          12 8 8 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 15 6 -1.</_>
+        <_>
+          4 7 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 1 3 -1.</_>
+        <_>
+          4 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 3 -1.</_>
+        <_>
+          4 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          6 6 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 3 -1.</_>
+        <_>
+          4 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          4 6 3 1 2.</_>
+        <_>
+          7 7 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 3 -1.</_>
+        <_>
+          4 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 6 -1.</_>
+        <_>
+          4 9 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 6 -1.</_>
+        <_>
+          4 9 16 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 17 3 -1.</_>
+        <_>
+          4 8 17 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 3 -1.</_>
+        <_>
+          5 9 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 3 -1.</_>
+        <_>
+          4 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 5 4 -1.</_>
+        <_>
+          4 9 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 18 4 -1.</_>
+        <_>
+          4 8 9 2 2.</_>
+        <_>
+          13 10 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 1 -1.</_>
+        <_>
+          5 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 1 -1.</_>
+        <_>
+          5 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          4 9 1 1 2.</_>
+        <_>
+          5 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 4 -1.</_>
+        <_>
+          4 9 1 2 2.</_>
+        <_>
+          5 11 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 2 -1.</_>
+        <_>
+          4 9 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          4 9 3 3 2.</_>
+        <_>
+          7 12 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 1 -1.</_>
+        <_>
+          8 9 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 2 -1.</_>
+        <_>
+          4 9 8 1 2.</_>
+        <_>
+          12 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 18 2 -1.</_>
+        <_>
+          4 9 9 1 2.</_>
+        <_>
+          13 10 9 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 11 4 -1.</_>
+        <_>
+          4 9 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 2 -1.</_>
+        <_>
+          4 10 1 1 2.</_>
+        <_>
+          5 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 1 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 2 -1.</_>
+        <_>
+          5 11 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 14 -1.</_>
+        <_>
+          5 10 1 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 9 4 -1.</_>
+        <_>
+          4 10 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 4 -1.</_>
+        <_>
+          4 10 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 6 -1.</_>
+        <_>
+          4 12 16 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 1 -1.</_>
+        <_>
+          5 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 2 -1.</_>
+        <_>
+          5 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          5 11 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 10 -1.</_>
+        <_>
+          4 16 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 1 -1.</_>
+        <_>
+          5 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 2 -1.</_>
+        <_>
+          5 12 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 1 6 -1.</_>
+        <_>
+          4 15 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 8 -1.</_>
+        <_>
+          4 16 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 1 -1.</_>
+        <_>
+          5 13 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 3 -1.</_>
+        <_>
+          6 13 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 5 -1.</_>
+        <_>
+          7 13 3 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 1 -1.</_>
+        <_>
+          6 14 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 3 2 -1.</_>
+        <_>
+          5 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 3 -1.</_>
+        <_>
+          6 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 9 4 -1.</_>
+        <_>
+          7 15 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 4 -1.</_>
+        <_>
+          4 16 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 17 3 1 -1.</_>
+        <_>
+          5 18 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 3 6 -1.</_>
+        <_>
+          5 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 20 3 4 -1.</_>
+        <_>
+          5 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 18 -1.</_>
+        <_>
+          7 0 2 18 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 12 -1.</_>
+        <_>
+          7 2 2 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 2 -1.</_>
+        <_>
+          5 2 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 6 -1.</_>
+        <_>
+          5 5 15 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 1 3 -1.</_>
+        <_>
+          4 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 2 3 -1.</_>
+        <_>
+          4 4 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 9 -1.</_>
+        <_>
+          7 3 2 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 3 -1.</_>
+        <_>
+          8 4 3 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 14 2 -1.</_>
+        <_>
+          5 3 7 1 2.</_>
+        <_>
+          12 4 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          4 5 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 16 2 -1.</_>
+        <_>
+          5 4 8 1 2.</_>
+        <_>
+          13 5 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 3 -1.</_>
+        <_>
+          4 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 9 -1.</_>
+        <_>
+          5 8 4 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 2 -1.</_>
+        <_>
+          5 5 7 1 2.</_>
+        <_>
+          12 6 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 6 -1.</_>
+        <_>
+          5 7 15 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 4 -1.</_>
+        <_>
+          5 7 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 2 -1.</_>
+        <_>
+          5 6 7 1 2.</_>
+        <_>
+          12 7 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 4 -1.</_>
+        <_>
+          5 7 14 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          5 8 14 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 15 4 -1.</_>
+        <_>
+          5 7 15 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 1 3 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 15 -1.</_>
+        <_>
+          6 7 2 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 1 -1.</_>
+        <_>
+          7 7 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          5 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 3 -1.</_>
+        <_>
+          5 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 4 -1.</_>
+        <_>
+          5 8 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 6 -1.</_>
+        <_>
+          5 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          5 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 16 4 -1.</_>
+        <_>
+          5 7 8 2 2.</_>
+        <_>
+          13 9 8 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 2 -1.</_>
+        <_>
+          5 8 14 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 16 6 -1.</_>
+        <_>
+          5 9 16 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 1 3 -1.</_>
+        <_>
+          5 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 2 -1.</_>
+        <_>
+          5 8 1 1 2.</_>
+        <_>
+          6 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 3 -1.</_>
+        <_>
+          4 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 4 -1.</_>
+        <_>
+          4 9 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 3 -1.</_>
+        <_>
+          4 9 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 2 -1.</_>
+        <_>
+          5 8 7 1 2.</_>
+        <_>
+          12 9 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 16 2 -1.</_>
+        <_>
+          5 8 8 1 2.</_>
+        <_>
+          13 9 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 13 16 -1.</_>
+        <_>
+          5 12 13 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 4 -1.</_>
+        <_>
+          7 9 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 3 -1.</_>
+        <_>
+          5 10 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 2 -1.</_>
+        <_>
+          5 9 7 1 2.</_>
+        <_>
+          12 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 16 2 -1.</_>
+        <_>
+          5 9 8 1 2.</_>
+        <_>
+          13 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 15 3 -1.</_>
+        <_>
+          5 10 15 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          5 10 1 1 2.</_>
+        <_>
+          6 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 1 -1.</_>
+        <_>
+          6 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 14 -1.</_>
+        <_>
+          6 10 1 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          7 10 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 4 -1.</_>
+        <_>
+          9 10 4 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 14 3 -1.</_>
+        <_>
+          5 11 14 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 16 8 -1.</_>
+        <_>
+          5 12 16 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          6 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 4 -1.</_>
+        <_>
+          5 11 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 14 2 -1.</_>
+        <_>
+          5 12 7 1 2.</_>
+        <_>
+          12 13 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 14 2 -1.</_>
+        <_>
+          5 13 7 1 2.</_>
+        <_>
+          12 14 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 14 10 -1.</_>
+        <_>
+          5 18 14 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 1 -1.</_>
+        <_>
+          6 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 2 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 19 3 4 -1.</_>
+        <_>
+          6 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 20 3 4 -1.</_>
+        <_>
+          6 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 11 -1.</_>
+        <_>
+          8 1 2 11 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 2 -1.</_>
+        <_>
+          6 1 6 1 2.</_>
+        <_>
+          12 2 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 1 3 -1.</_>
+        <_>
+          5 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 2 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 6 -1.</_>
+        <_>
+          6 2 6 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 2 -1.</_>
+        <_>
+          6 3 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 3 -1.</_>
+        <_>
+          5 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 1 -1.</_>
+        <_>
+          8 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 18 21 -1.</_>
+        <_>
+          15 3 9 21 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 1 3 -1.</_>
+        <_>
+          5 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 3 -1.</_>
+        <_>
+          6 5 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 5 4 -1.</_>
+        <_>
+          5 5 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 3 -1.</_>
+        <_>
+          6 5 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 3 -1.</_>
+        <_>
+          5 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 2 -1.</_>
+        <_>
+          7 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 3 -1.</_>
+        <_>
+          7 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 2 -1.</_>
+        <_>
+          6 5 6 1 2.</_>
+        <_>
+          12 6 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 2 -1.</_>
+        <_>
+          6 6 5 1 2.</_>
+        <_>
+          11 7 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 3 -1.</_>
+        <_>
+          5 7 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 1 3 -1.</_>
+        <_>
+          6 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 1 6 -1.</_>
+        <_>
+          6 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 8 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          6 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 6 -1.</_>
+        <_>
+          6 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 2 -1.</_>
+        <_>
+          6 7 6 1 2.</_>
+        <_>
+          12 8 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 1 -1.</_>
+        <_>
+          7 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          5 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 4 -1.</_>
+        <_>
+          6 9 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 3 -1.</_>
+        <_>
+          5 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 3 -1.</_>
+        <_>
+          9 8 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 2 -1.</_>
+        <_>
+          6 8 6 1 2.</_>
+        <_>
+          12 9 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 13 6 -1.</_>
+        <_>
+          6 10 13 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 2 -1.</_>
+        <_>
+          6 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 1 -1.</_>
+        <_>
+          9 9 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 2 -1.</_>
+        <_>
+          9 9 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 3 -1.</_>
+        <_>
+          9 9 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 2 -1.</_>
+        <_>
+          10 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 2 -1.</_>
+        <_>
+          6 9 6 1 2.</_>
+        <_>
+          12 10 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 3 -1.</_>
+        <_>
+          6 10 12 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 1 3 -1.</_>
+        <_>
+          6 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 3 -1.</_>
+        <_>
+          7 10 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 4 -1.</_>
+        <_>
+          7 10 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 3 -1.</_>
+        <_>
+          6 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 4 -1.</_>
+        <_>
+          6 11 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 3 -1.</_>
+        <_>
+          6 11 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 1 -1.</_>
+        <_>
+          9 10 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 2 -1.</_>
+        <_>
+          6 10 6 1 2.</_>
+        <_>
+          12 11 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 13 3 -1.</_>
+        <_>
+          6 11 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 2 -1.</_>
+        <_>
+          6 12 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 3 -1.</_>
+        <_>
+          6 12 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 3 -1.</_>
+        <_>
+          6 12 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 13 7 4 -1.</_>
+        <_>
+          6 13 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 3 -1.</_>
+        <_>
+          6 15 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 4 -1.</_>
+        <_>
+          7 16 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 3 -1.</_>
+        <_>
+          6 15 3 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 18 3 1 -1.</_>
+        <_>
+          7 19 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 19 3 5 -1.</_>
+        <_>
+          7 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 4 -1.</_>
+        <_>
+          7 0 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 2 -1.</_>
+        <_>
+          7 0 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 1 -1.</_>
+        <_>
+          12 0 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 6 -1.</_>
+        <_>
+          7 1 1 3 2.</_>
+        <_>
+          8 4 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 1 -1.</_>
+        <_>
+          12 1 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 1 3 -1.</_>
+        <_>
+          6 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 1 4 -1.</_>
+        <_>
+          6 3 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 4 -1.</_>
+        <_>
+          6 3 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 3 -1.</_>
+        <_>
+          7 3 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 13 10 -1.</_>
+        <_>
+          7 7 13 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 1 3 -1.</_>
+        <_>
+          6 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 4 -1.</_>
+        <_>
+          6 4 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 2 -1.</_>
+        <_>
+          7 3 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 3 -1.</_>
+        <_>
+          8 4 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 2 -1.</_>
+        <_>
+          7 4 5 1 2.</_>
+        <_>
+          12 5 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 2 -1.</_>
+        <_>
+          8 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 3 -1.</_>
+        <_>
+          8 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 5 -1.</_>
+        <_>
+          8 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 1 -1.</_>
+        <_>
+          8 6 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 1 4 -1.</_>
+        <_>
+          7 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 2 -1.</_>
+        <_>
+          7 6 5 1 2.</_>
+        <_>
+          12 7 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 3 -1.</_>
+        <_>
+          6 7 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          6 7 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 3 -1.</_>
+        <_>
+          7 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 2 -1.</_>
+        <_>
+          7 7 1 1 2.</_>
+        <_>
+          8 8 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 1 3 -1.</_>
+        <_>
+          7 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_>
+        <_>
+          8 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 8 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 7 -1.</_>
+        <_>
+          11 8 4 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 2 -1.</_>
+        <_>
+          7 8 5 1 2.</_>
+        <_>
+          12 9 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 2 -1.</_>
+        <_>
+          7 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          7 9 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          7 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          7 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 2 -1.</_>
+        <_>
+          7 9 5 1 2.</_>
+        <_>
+          12 10 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 1 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 1 3 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 3 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 5 -1.</_>
+        <_>
+          9 10 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 9 4 -1.</_>
+        <_>
+          10 10 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 10 10 2 -1.</_>
+        <_>
+          7 10 5 1 2.</_>
+        <_>
+          12 11 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 11 1 2 -1.</_>
+        <_>
+          7 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 4 -1.</_>
+        <_>
+          6 16 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 2 -1.</_>
+        <_>
+          9 18 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 2 -1.</_>
+        <_>
+          7 16 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 4 -1.</_>
+        <_>
+          6 17 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 1 -1.</_>
+        <_>
+          8 18 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 1 4 -1.</_>
+        <_>
+          7 19 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 6 -1.</_>
+        <_>
+          7 20 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 3 -1.</_>
+        <_>
+          6 18 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 5 2 -1.</_>
+        <_>
+          7 17 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 1 -1.</_>
+        <_>
+          8 19 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 19 3 1 -1.</_>
+        <_>
+          8 20 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 19 3 5 -1.</_>
+        <_>
+          8 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 3 1 -1.</_>
+        <_>
+          8 21 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 9 4 -1.</_>
+        <_>
+          7 22 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 10 4 -1.</_>
+        <_>
+          7 21 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 10 4 -1.</_>
+        <_>
+          7 22 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 1 -1.</_>
+        <_>
+          12 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 4 -1.</_>
+        <_>
+          8 2 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 16 6 -1.</_>
+        <_>
+          8 0 8 3 2.</_>
+        <_>
+          16 3 8 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 10 -1.</_>
+        <_>
+          8 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 16 10 -1.</_>
+        <_>
+          8 0 8 5 2.</_>
+        <_>
+          16 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 4 -1.</_>
+        <_>
+          8 1 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 10 -1.</_>
+        <_>
+          8 5 9 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 8 -1.</_>
+        <_>
+          8 5 8 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 10 -1.</_>
+        <_>
+          8 6 12 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 3 -1.</_>
+        <_>
+          9 2 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 4 -1.</_>
+        <_>
+          7 3 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 6 -1.</_>
+        <_>
+          6 4 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 8 -1.</_>
+        <_>
+          9 3 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 2 -1.</_>
+        <_>
+          8 4 4 1 2.</_>
+        <_>
+          12 5 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 7 15 -1.</_>
+        <_>
+          8 9 7 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 1 -1.</_>
+        <_>
+          8 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 2 -1.</_>
+        <_>
+          9 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 5 -1.</_>
+        <_>
+          9 5 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 6 -1.</_>
+        <_>
+          9 5 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 6 -1.</_>
+        <_>
+          9 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 7 -1.</_>
+        <_>
+          9 5 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 7 -1.</_>
+        <_>
+          9 6 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 8 -1.</_>
+        <_>
+          9 5 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 6 -1.</_>
+        <_>
+          8 5 3 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 6 -1.</_>
+        <_>
+          6 7 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 10 2 -1.</_>
+        <_>
+          8 5 5 1 2.</_>
+        <_>
+          13 6 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 3 -1.</_>
+        <_>
+          7 6 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 6 -1.</_>
+        <_>
+          9 6 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          7 7 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 2 -1.</_>
+        <_>
+          8 6 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 3 -1.</_>
+        <_>
+          7 7 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 4 -1.</_>
+        <_>
+          7 7 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 2 -1.</_>
+        <_>
+          8 6 5 1 2.</_>
+        <_>
+          13 7 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          7 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 4 -1.</_>
+        <_>
+          7 8 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 5 -1.</_>
+        <_>
+          11 10 3 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 8 -1.</_>
+        <_>
+          11 10 3 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 2 -1.</_>
+        <_>
+          8 7 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          7 8 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 2 -1.</_>
+        <_>
+          8 7 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 2 -1.</_>
+        <_>
+          8 7 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 12 -1.</_>
+        <_>
+          8 13 10 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 2 -1.</_>
+        <_>
+          8 8 1 1 2.</_>
+        <_>
+          9 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 1 -1.</_>
+        <_>
+          9 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 1 -1.</_>
+        <_>
+          9 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 2 -1.</_>
+        <_>
+          8 10 1 1 2.</_>
+        <_>
+          9 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 2 -1.</_>
+        <_>
+          9 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 2 -1.</_>
+        <_>
+          9 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 8 -1.</_>
+        <_>
+          8 10 2 4 2.</_>
+        <_>
+          10 14 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_>
+        <_>
+          12 11 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 15 12 -1.</_>
+        <_>
+          13 14 5 4 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 2 -1.</_>
+        <_>
+          8 11 1 1 2.</_>
+        <_>
+          9 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 3 -1.</_>
+        <_>
+          11 13 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 15 9 6 -1.</_>
+        <_>
+          11 15 3 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 15 8 6 -1.</_>
+        <_>
+          8 17 8 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 2 -1.</_>
+        <_>
+          10 16 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 3 -1.</_>
+        <_>
+          10 16 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 3 -1.</_>
+        <_>
+          9 18 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 17 8 3 -1.</_>
+        <_>
+          10 17 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 17 9 6 -1.</_>
+        <_>
+          8 19 9 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 6 -1.</_>
+        <_>
+          9 18 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 3 1 -1.</_>
+        <_>
+          9 20 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 3 4 -1.</_>
+        <_>
+          9 19 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 7 3 -1.</_>
+        <_>
+          8 20 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 19 9 4 -1.</_>
+        <_>
+          8 20 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 20 3 3 -1.</_>
+        <_>
+          9 20 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 20 16 4 -1.</_>
+        <_>
+          8 20 8 2 2.</_>
+        <_>
+          16 22 8 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 21 3 3 -1.</_>
+        <_>
+          9 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 1 2 -1.</_>
+        <_>
+          9 1 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 6 -1.</_>
+        <_>
+          7 2 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 3 -1.</_>
+        <_>
+          12 0 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          9 0 3 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 9 -1.</_>
+        <_>
+          9 0 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 4 -1.</_>
+        <_>
+          9 2 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 8 -1.</_>
+        <_>
+          9 4 5 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 14 12 -1.</_>
+        <_>
+          9 0 7 6 2.</_>
+        <_>
+          16 6 7 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 10 -1.</_>
+        <_>
+          9 5 8 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 15 18 -1.</_>
+        <_>
+          9 6 15 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 2 8 -1.</_>
+        <_>
+          9 5 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 4 -1.</_>
+        <_>
+          8 2 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 2 -1.</_>
+        <_>
+          10 2 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 1 6 -1.</_>
+        <_>
+          9 5 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 10 -1.</_>
+        <_>
+          10 2 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 8 4 -1.</_>
+        <_>
+          11 4 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 2 -1.</_>
+        <_>
+          9 2 3 1 2.</_>
+        <_>
+          12 3 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 7 8 -1.</_>
+        <_>
+          9 6 7 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 7 -1.</_>
+        <_>
+          10 4 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 12 -1.</_>
+        <_>
+          10 3 1 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 7 -1.</_>
+        <_>
+          11 3 2 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 12 3 -1.</_>
+        <_>
+          13 4 4 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 11 4 -1.</_>
+        <_>
+          8 4 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 8 -1.</_>
+        <_>
+          10 5 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 1 -1.</_>
+        <_>
+          9 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 4 -1.</_>
+        <_>
+          10 5 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 6 -1.</_>
+        <_>
+          10 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          11 5 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 3 -1.</_>
+        <_>
+          9 6 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 3 -1.</_>
+        <_>
+          8 6 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 6 -1.</_>
+        <_>
+          7 8 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 3 -1.</_>
+        <_>
+          9 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 3 -1.</_>
+        <_>
+          8 7 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          9 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 2 -1.</_>
+        <_>
+          9 7 3 1 2.</_>
+        <_>
+          12 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          8 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 5 -1.</_>
+        <_>
+          11 10 2 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 9 9 -1.</_>
+        <_>
+          12 8 3 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 12 -1.</_>
+        <_>
+          9 9 1 6 2.</_>
+        <_>
+          10 15 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 3 -1.</_>
+        <_>
+          11 11 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 4 -1.</_>
+        <_>
+          11 11 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 3 -1.</_>
+        <_>
+          9 10 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 4 -1.</_>
+        <_>
+          12 9 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 3 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 5 3 -1.</_>
+        <_>
+          9 11 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 14 3 -1.</_>
+        <_>
+          9 11 14 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 6 -1.</_>
+        <_>
+          9 13 2 3 2.</_>
+        <_>
+          11 16 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 13 9 4 -1.</_>
+        <_>
+          12 13 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 5 -1.</_>
+        <_>
+          11 16 2 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          11 17 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 3 -1.</_>
+        <_>
+          10 19 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 19 3 2 -1.</_>
+        <_>
+          10 20 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 19 6 3 -1.</_>
+        <_>
+          9 20 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 19 7 3 -1.</_>
+        <_>
+          9 20 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 3 -1.</_>
+        <_>
+          10 20 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 5 3 -1.</_>
+        <_>
+          9 21 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 6 3 -1.</_>
+        <_>
+          9 21 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 7 3 -1.</_>
+        <_>
+          9 21 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 7 4 -1.</_>
+        <_>
+          9 22 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 21 3 3 -1.</_>
+        <_>
+          10 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 21 8 2 -1.</_>
+        <_>
+          9 22 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 1 -1.</_>
+        <_>
+          12 0 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 12 -1.</_>
+        <_>
+          10 4 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 8 -1.</_>
+        <_>
+          10 4 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 14 10 -1.</_>
+        <_>
+          10 0 7 5 2.</_>
+        <_>
+          17 5 7 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 6 -1.</_>
+        <_>
+          11 2 2 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 10 -1.</_>
+        <_>
+          10 2 3 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 2 5 -1.</_>
+        <_>
+          11 3 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 5 -1.</_>
+        <_>
+          11 4 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 19 -1.</_>
+        <_>
+          12 4 2 19 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 1 2 -1.</_>
+        <_>
+          10 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 3 -1.</_>
+        <_>
+          11 5 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 3 -1.</_>
+        <_>
+          10 6 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 1 3 -1.</_>
+        <_>
+          10 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 6 -1.</_>
+        <_>
+          12 6 2 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 3 -1.</_>
+        <_>
+          10 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 1 2 -1.</_>
+        <_>
+          10 8 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 2 -1.</_>
+        <_>
+          10 9 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 1 3 -1.</_>
+        <_>
+          9 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 3 -1.</_>
+        <_>
+          11 9 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 12 -1.</_>
+        <_>
+          10 9 1 6 2.</_>
+        <_>
+          11 15 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 3 -1.</_>
+        <_>
+          10 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 3 -1.</_>
+        <_>
+          9 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 3 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 3 -1.</_>
+        <_>
+          10 12 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 14 3 -1.</_>
+        <_>
+          10 13 14 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 2 -1.</_>
+        <_>
+          11 17 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 2 6 -1.</_>
+        <_>
+          10 17 1 3 2.</_>
+        <_>
+          11 20 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 3 -1.</_>
+        <_>
+          10 18 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 2 -1.</_>
+        <_>
+          13 17 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 18 5 4 -1.</_>
+        <_>
+          10 19 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 19 5 4 -1.</_>
+        <_>
+          10 20 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 19 6 3 -1.</_>
+        <_>
+          10 20 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 3 4 -1.</_>
+        <_>
+          11 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 6 4 -1.</_>
+        <_>
+          12 20 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 5 4 -1.</_>
+        <_>
+          10 21 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 5 4 -1.</_>
+        <_>
+          10 22 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 20 14 4 -1.</_>
+        <_>
+          10 20 7 2 2.</_>
+        <_>
+          17 22 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 3 3 -1.</_>
+        <_>
+          11 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 21 5 2 -1.</_>
+        <_>
+          10 22 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 22 3 2 -1.</_>
+        <_>
+          11 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 23 3 1 -1.</_>
+        <_>
+          11 23 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 1 2 -1.</_>
+        <_>
+          11 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 1 4 -1.</_>
+        <_>
+          10 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 1 -1.</_>
+        <_>
+          13 0 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 1 2 -1.</_>
+        <_>
+          11 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 9 -1.</_>
+        <_>
+          13 4 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 3 -1.</_>
+        <_>
+          12 3 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 4 -1.</_>
+        <_>
+          12 3 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 4 -1.</_>
+        <_>
+          12 4 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 5 -1.</_>
+        <_>
+          12 4 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 7 -1.</_>
+        <_>
+          12 5 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 1 -1.</_>
+        <_>
+          13 4 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 3 -1.</_>
+        <_>
+          11 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 3 -1.</_>
+        <_>
+          11 5 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 1 -1.</_>
+        <_>
+          12 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 11 -1.</_>
+        <_>
+          13 5 2 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 3 -1.</_>
+        <_>
+          11 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 3 -1.</_>
+        <_>
+          11 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 1 3 -1.</_>
+        <_>
+          11 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 3 -1.</_>
+        <_>
+          11 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 6 -1.</_>
+        <_>
+          11 7 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 3 -1.</_>
+        <_>
+          11 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 8 -1.</_>
+        <_>
+          11 7 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 1 3 -1.</_>
+        <_>
+          11 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 3 -1.</_>
+        <_>
+          11 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 3 3 -1.</_>
+        <_>
+          11 10 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 5 -1.</_>
+        <_>
+          12 11 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 3 -1.</_>
+        <_>
+          13 10 2 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 8 -1.</_>
+        <_>
+          11 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          9 12 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 3 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 14 3 3 -1.</_>
+        <_>
+          10 15 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 16 3 3 -1.</_>
+        <_>
+          11 17 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 21 3 3 -1.</_>
+        <_>
+          12 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 22 3 2 -1.</_>
+        <_>
+          12 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 9 17 -1.</_>
+        <_>
+          15 0 3 17 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 14 -1.</_>
+        <_>
+          13 2 1 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 1 -1.</_>
+        <_>
+          14 3 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 3 -1.</_>
+        <_>
+          12 4 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 12 6 -1.</_>
+        <_>
+          10 5 12 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 3 -1.</_>
+        <_>
+          12 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 9 3 -1.</_>
+        <_>
+          15 5 3 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 5 -1.</_>
+        <_>
+          13 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 3 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 9 8 -1.</_>
+        <_>
+          15 5 3 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 8 -1.</_>
+        <_>
+          12 6 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 1 3 -1.</_>
+        <_>
+          12 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 1 8 -1.</_>
+        <_>
+          12 7 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 6 -1.</_>
+        <_>
+          12 7 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 8 -1.</_>
+        <_>
+          12 7 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 3 -1.</_>
+        <_>
+          12 8 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 1 3 -1.</_>
+        <_>
+          12 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 3 -1.</_>
+        <_>
+          12 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 3 -1.</_>
+        <_>
+          12 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 4 -1.</_>
+        <_>
+          14 10 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 10 -1.</_>
+        <_>
+          12 10 2 5 2.</_>
+        <_>
+          14 15 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 8 -1.</_>
+        <_>
+          12 11 2 4 2.</_>
+        <_>
+          14 15 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 3 -1.</_>
+        <_>
+          13 13 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 2 -1.</_>
+        <_>
+          13 15 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 2 4 -1.</_>
+        <_>
+          12 15 1 2 2.</_>
+        <_>
+          13 17 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 4 5 -1.</_>
+        <_>
+          14 15 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 16 6 2 -1.</_>
+        <_>
+          14 16 2 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 19 3 5 -1.</_>
+        <_>
+          13 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 21 3 2 -1.</_>
+        <_>
+          13 21 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 21 3 3 -1.</_>
+        <_>
+          13 21 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 10 -1.</_>
+        <_>
+          13 0 1 5 2.</_>
+        <_>
+          14 5 1 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 12 -1.</_>
+        <_>
+          14 0 2 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          15 0 2 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 11 8 -1.</_>
+        <_>
+          11 2 11 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 8 -1.</_>
+        <_>
+          15 1 2 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 2 -1.</_>
+        <_>
+          14 2 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 4 -1.</_>
+        <_>
+          13 3 1 2 2.</_>
+        <_>
+          14 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 3 -1.</_>
+        <_>
+          15 4 2 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 7 -1.</_>
+        <_>
+          14 4 2 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 8 -1.</_>
+        <_>
+          14 4 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 2 -1.</_>
+        <_>
+          14 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 5 -1.</_>
+        <_>
+          14 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 6 -1.</_>
+        <_>
+          14 5 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 8 -1.</_>
+        <_>
+          14 5 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 1 -1.</_>
+        <_>
+          15 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 6 7 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 1 3 -1.</_>
+        <_>
+          13 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 4 8 -1.</_>
+        <_>
+          13 7 2 4 2.</_>
+        <_>
+          15 11 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 9 6 -1.</_>
+        <_>
+          16 9 3 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 2 -1.</_>
+        <_>
+          13 7 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 8 1 -1.</_>
+        <_>
+          13 7 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 3 -1.</_>
+        <_>
+          13 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 9 3 -1.</_>
+        <_>
+          16 9 3 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 8 -1.</_>
+        <_>
+          13 8 3 4 2.</_>
+        <_>
+          16 12 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 10 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 4 -1.</_>
+        <_>
+          15 9 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 10 2 -1.</_>
+        <_>
+          13 10 10 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 1 -1.</_>
+        <_>
+          14 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 2 -1.</_>
+        <_>
+          14 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 3 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 6 -1.</_>
+        <_>
+          13 13 1 3 2.</_>
+        <_>
+          14 16 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 6 -1.</_>
+        <_>
+          14 14 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 20 3 4 -1.</_>
+        <_>
+          14 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 22 3 2 -1.</_>
+        <_>
+          14 22 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 23 3 1 -1.</_>
+        <_>
+          14 23 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 11 -1.</_>
+        <_>
+          15 1 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 3 -1.</_>
+        <_>
+          14 1 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 6 -1.</_>
+        <_>
+          14 0 5 3 2.</_>
+        <_>
+          19 3 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 10 -1.</_>
+        <_>
+          14 0 5 5 2.</_>
+        <_>
+          19 5 5 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 10 6 -1.</_>
+        <_>
+          14 1 5 3 2.</_>
+        <_>
+          19 4 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 1 2 -1.</_>
+        <_>
+          14 2 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 8 -1.</_>
+        <_>
+          15 2 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          16 2 2 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 4 -1.</_>
+        <_>
+          14 3 1 2 2.</_>
+        <_>
+          15 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 7 -1.</_>
+        <_>
+          15 3 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 2 -1.</_>
+        <_>
+          15 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 3 -1.</_>
+        <_>
+          15 5 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 3 -1.</_>
+        <_>
+          15 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 5 -1.</_>
+        <_>
+          15 5 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 7 -1.</_>
+        <_>
+          15 5 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 4 -1.</_>
+        <_>
+          16 5 2 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 3 -1.</_>
+        <_>
+          14 6 3 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 16 -1.</_>
+        <_>
+          15 7 2 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 6 -1.</_>
+        <_>
+          16 9 2 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 16 -1.</_>
+        <_>
+          16 7 2 16 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 9 4 -1.</_>
+        <_>
+          14 8 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 4 -1.</_>
+        <_>
+          14 9 1 2 2.</_>
+        <_>
+          15 11 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 1 -1.</_>
+        <_>
+          15 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          15 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 3 -1.</_>
+        <_>
+          15 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 1 -1.</_>
+        <_>
+          15 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 3 4 -1.</_>
+        <_>
+          15 15 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 5 3 -1.</_>
+        <_>
+          14 15 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 15 3 3 -1.</_>
+        <_>
+          15 16 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 19 3 5 -1.</_>
+        <_>
+          15 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 21 10 1 -1.</_>
+        <_>
+          19 21 5 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 2 -1.</_>
+        <_>
+          15 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 2 -1.</_>
+        <_>
+          16 1 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 6 3 -1.</_>
+        <_>
+          15 4 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 3 -1.</_>
+        <_>
+          15 5 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 1 -1.</_>
+        <_>
+          15 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 2 2 -1.</_>
+        <_>
+          16 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 2 -1.</_>
+        <_>
+          16 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 3 -1.</_>
+        <_>
+          16 5 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 4 -1.</_>
+        <_>
+          15 9 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 6 -1.</_>
+        <_>
+          15 9 4 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 6 -1.</_>
+        <_>
+          15 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 2 -1.</_>
+        <_>
+          15 8 1 1 2.</_>
+        <_>
+          16 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 1 -1.</_>
+        <_>
+          15 8 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 1 12 -1.</_>
+        <_>
+          15 14 1 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 2 -1.</_>
+        <_>
+          15 8 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 16 -1.</_>
+        <_>
+          15 12 3 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 5 4 -1.</_>
+        <_>
+          15 9 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 3 -1.</_>
+        <_>
+          16 10 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          15 10 1 1 2.</_>
+        <_>
+          16 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          16 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 5 -1.</_>
+        <_>
+          16 10 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 4 -1.</_>
+        <_>
+          14 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 4 -1.</_>
+        <_>
+          15 11 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 4 -1.</_>
+        <_>
+          14 11 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 8 3 -1.</_>
+        <_>
+          19 15 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 8 8 -1.</_>
+        <_>
+          15 15 4 4 2.</_>
+        <_>
+          19 19 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 5 3 -1.</_>
+        <_>
+          15 17 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 18 8 6 -1.</_>
+        <_>
+          15 18 4 3 2.</_>
+        <_>
+          19 21 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 1 -1.</_>
+        <_>
+          20 0 4 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 2 -1.</_>
+        <_>
+          20 0 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 6 -1.</_>
+        <_>
+          16 0 4 3 2.</_>
+        <_>
+          20 3 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          20 4 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 3 -1.</_>
+        <_>
+          17 2 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 1 2 1 -1.</_>
+        <_>
+          16 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 1 2 -1.</_>
+        <_>
+          16 3 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 3 -1.</_>
+        <_>
+          17 3 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 2 -1.</_>
+        <_>
+          17 3 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 1 -1.</_>
+        <_>
+          18 4 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 12 -1.</_>
+        <_>
+          17 4 2 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 4 6 3 -1.</_>
+        <_>
+          15 5 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 1 2 -1.</_>
+        <_>
+          16 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 2 -1.</_>
+        <_>
+          17 5 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 9 -1.</_>
+        <_>
+          16 8 3 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 6 2 -1.</_>
+        <_>
+          18 8 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 1 6 -1.</_>
+        <_>
+          16 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 3 -1.</_>
+        <_>
+          16 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 2 -1.</_>
+        <_>
+          16 8 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 2 -1.</_>
+        <_>
+          16 7 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 6 -1.</_>
+        <_>
+          16 9 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 4 -1.</_>
+        <_>
+          16 7 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 3 -1.</_>
+        <_>
+          16 8 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 5 3 -1.</_>
+        <_>
+          16 8 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 5 6 -1.</_>
+        <_>
+          16 9 5 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 4 -1.</_>
+        <_>
+          16 8 6 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 7 8 -1.</_>
+        <_>
+          14 9 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 7 8 6 -1.</_>
+        <_>
+          16 9 8 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 1 2 -1.</_>
+        <_>
+          16 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 1 4 -1.</_>
+        <_>
+          16 9 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 2 -1.</_>
+        <_>
+          16 8 1 1 2.</_>
+        <_>
+          17 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 3 -1.</_>
+        <_>
+          17 9 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 1 -1.</_>
+        <_>
+          16 8 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 2 -1.</_>
+        <_>
+          16 8 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 5 6 -1.</_>
+        <_>
+          14 10 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 7 8 -1.</_>
+        <_>
+          14 10 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 1 3 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 5 3 -1.</_>
+        <_>
+          16 10 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 8 2 -1.</_>
+        <_>
+          16 10 8 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 1 3 -1.</_>
+        <_>
+          16 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          17 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 3 -1.</_>
+        <_>
+          16 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 6 6 -1.</_>
+        <_>
+          14 12 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 2 -1.</_>
+        <_>
+          17 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 13 -1.</_>
+        <_>
+          17 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 12 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 3 -1.</_>
+        <_>
+          16 12 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 3 -1.</_>
+        <_>
+          16 12 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 2 -1.</_>
+        <_>
+          18 14 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 6 3 -1.</_>
+        <_>
+          19 14 3 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 3 5 -1.</_>
+        <_>
+          17 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 2 3 -1.</_>
+        <_>
+          15 20 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 19 8 3 -1.</_>
+        <_>
+          16 20 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 15 -1.</_>
+        <_>
+          19 2 2 15 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 1 -1.</_>
+        <_>
+          20 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 2 -1.</_>
+        <_>
+          20 0 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 3 -1.</_>
+        <_>
+          18 3 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 2 -1.</_>
+        <_>
+          18 3 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 9 -1.</_>
+        <_>
+          18 6 1 3 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 6 2 -1.</_>
+        <_>
+          19 5 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 8 -1.</_>
+        <_>
+          15 5 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 5 3 -1.</_>
+        <_>
+          17 4 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 6 -1.</_>
+        <_>
+          17 4 1 3 2.</_>
+        <_>
+          18 7 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 1 2 -1.</_>
+        <_>
+          17 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 4 -1.</_>
+        <_>
+          18 6 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 6 2 -1.</_>
+        <_>
+          17 5 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 5 7 3 -1.</_>
+        <_>
+          16 6 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 3 -1.</_>
+        <_>
+          17 6 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 4 -1.</_>
+        <_>
+          18 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 3 -1.</_>
+        <_>
+          17 7 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 6 1 -1.</_>
+        <_>
+          17 6 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 3 -1.</_>
+        <_>
+          17 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 3 -1.</_>
+        <_>
+          16 8 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 6 -1.</_>
+        <_>
+          17 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 6 -1.</_>
+        <_>
+          18 9 1 2 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 2 -1.</_>
+        <_>
+          18 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 3 -1.</_>
+        <_>
+          17 7 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 3 -1.</_>
+        <_>
+          18 8 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 3 -1.</_>
+        <_>
+          17 8 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 6 9 -1.</_>
+        <_>
+          14 10 6 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 3 -1.</_>
+        <_>
+          18 9 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 2 4 -1.</_>
+        <_>
+          17 8 1 2 2.</_>
+        <_>
+          18 10 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 2 8 -1.</_>
+        <_>
+          17 8 1 4 2.</_>
+        <_>
+          18 12 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 4 -1.</_>
+        <_>
+          18 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 4 6 -1.</_>
+        <_>
+          15 10 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 1 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 2 6 -1.</_>
+        <_>
+          17 9 1 3 2.</_>
+        <_>
+          18 12 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 6 10 -1.</_>
+        <_>
+          17 9 3 5 2.</_>
+        <_>
+          20 14 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 7 2 -1.</_>
+        <_>
+          17 10 7 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 1 -1.</_>
+        <_>
+          18 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 1 3 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 3 -1.</_>
+        <_>
+          18 10 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 4 -1.</_>
+        <_>
+          18 10 1 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 4 2 -1.</_>
+        <_>
+          17 10 2 1 2.</_>
+        <_>
+          19 11 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 2 -1.</_>
+        <_>
+          18 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 3 -1.</_>
+        <_>
+          18 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 12 3 1 -1.</_>
+        <_>
+          18 12 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 12 6 2 -1.</_>
+        <_>
+          20 12 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 3 -1.</_>
+        <_>
+          17 16 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 15 4 3 -1.</_>
+        <_>
+          19 15 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 15 4 4 -1.</_>
+        <_>
+          17 15 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 18 2 4 -1.</_>
+        <_>
+          16 19 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 18 5 3 -1.</_>
+        <_>
+          17 19 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 19 1 3 -1.</_>
+        <_>
+          16 20 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 20 1 3 -1.</_>
+        <_>
+          16 21 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 20 3 4 -1.</_>
+        <_>
+          18 20 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 2 -1.</_>
+        <_>
+          18 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 1 -1.</_>
+        <_>
+          21 0 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 5 -1.</_>
+        <_>
+          21 0 3 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 12 -1.</_>
+        <_>
+          18 0 3 6 2.</_>
+        <_>
+          21 6 3 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 3 1 -1.</_>
+        <_>
+          19 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 4 1 -1.</_>
+        <_>
+          19 3 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 4 3 -1.</_>
+        <_>
+          19 3 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 3 -1.</_>
+        <_>
+          18 5 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 2 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 3 -1.</_>
+        <_>
+          18 6 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 3 -1.</_>
+        <_>
+          19 7 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 4 -1.</_>
+        <_>
+          19 7 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 5 -1.</_>
+        <_>
+          18 6 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 6 -1.</_>
+        <_>
+          19 7 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 3 -1.</_>
+        <_>
+          18 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 1 -1.</_>
+        <_>
+          18 6 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 5 3 -1.</_>
+        <_>
+          18 7 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 6 3 -1.</_>
+        <_>
+          18 7 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 3 2 -1.</_>
+        <_>
+          19 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 7 3 5 -1.</_>
+        <_>
+          19 8 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 1 3 -1.</_>
+        <_>
+          18 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 3 -1.</_>
+        <_>
+          18 9 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 2 -1.</_>
+        <_>
+          18 8 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 3 1 -1.</_>
+        <_>
+          19 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 2 -1.</_>
+        <_>
+          18 9 1 1 2.</_>
+        <_>
+          19 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 3 2 -1.</_>
+        <_>
+          19 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 4 -1.</_>
+        <_>
+          18 11 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 6 9 -1.</_>
+        <_>
+          21 9 3 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 6 3 -1.</_>
+        <_>
+          18 10 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 1 -1.</_>
+        <_>
+          19 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 1 3 -1.</_>
+        <_>
+          18 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 2 -1.</_>
+        <_>
+          18 10 1 1 2.</_>
+        <_>
+          19 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 6 2 -1.</_>
+        <_>
+          18 11 6 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 4 -1.</_>
+        <_>
+          19 11 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 13 -1.</_>
+        <_>
+          19 11 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 2 8 -1.</_>
+        <_>
+          18 15 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 6 1 -1.</_>
+        <_>
+          21 11 3 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 6 2 -1.</_>
+        <_>
+          21 12 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 3 8 -1.</_>
+        <_>
+          18 16 3 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 13 2 4 -1.</_>
+        <_>
+          18 15 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 14 4 4 -1.</_>
+        <_>
+          18 16 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 15 4 5 -1.</_>
+        <_>
+          20 15 2 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 4 -1.</_>
+        <_>
+          18 16 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 5 -1.</_>
+        <_>
+          18 17 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 18 1 3 -1.</_>
+        <_>
+          17 19 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 20 1 3 -1.</_>
+        <_>
+          17 21 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 0 2 3 -1.</_>
+        <_>
+          19 0 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 2 3 1 -1.</_>
+        <_>
+          20 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 2 4 3 -1.</_>
+        <_>
+          20 3 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 3 3 1 -1.</_>
+        <_>
+          20 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 2 -1.</_>
+        <_>
+          19 4 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 3 1 -1.</_>
+        <_>
+          20 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 3 -1.</_>
+        <_>
+          18 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 4 -1.</_>
+        <_>
+          19 6 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 5 9 -1.</_>
+        <_>
+          19 7 5 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 5 3 1 -1.</_>
+        <_>
+          20 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 3 -1.</_>
+        <_>
+          19 7 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 3 -1.</_>
+        <_>
+          18 7 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 2 3 -1.</_>
+        <_>
+          19 7 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 5 9 -1.</_>
+        <_>
+          19 9 5 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 3 -1.</_>
+        <_>
+          19 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 7 3 4 -1.</_>
+        <_>
+          20 7 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 7 2 4 -1.</_>
+        <_>
+          19 7 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 3 -1.</_>
+        <_>
+          19 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 3 3 -1.</_>
+        <_>
+          20 8 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 2 1 -1.</_>
+        <_>
+          20 9 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 2 2 -1.</_>
+        <_>
+          19 9 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 10 2 2 -1.</_>
+        <_>
+          19 10 1 1 2.</_>
+        <_>
+          20 11 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 10 3 4 -1.</_>
+        <_>
+          19 11 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 12 4 8 -1.</_>
+        <_>
+          20 13 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 12 3 10 -1.</_>
+        <_>
+          20 12 1 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 12 3 12 -1.</_>
+        <_>
+          20 12 1 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 13 3 9 -1.</_>
+        <_>
+          20 13 1 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 14 4 6 -1.</_>
+        <_>
+          20 15 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 15 3 6 -1.</_>
+        <_>
+          20 16 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 3 -1.</_>
+        <_>
+          18 18 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 18 1 3 -1.</_>
+        <_>
+          18 19 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 19 1 3 -1.</_>
+        <_>
+          18 20 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 19 1 4 -1.</_>
+        <_>
+          18 20 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 20 1 3 -1.</_>
+        <_>
+          18 21 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 21 5 3 -1.</_>
+        <_>
+          19 22 5 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 0 4 4 -1.</_>
+        <_>
+          19 1 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 3 3 1 -1.</_>
+        <_>
+          21 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 3 3 2 -1.</_>
+        <_>
+          21 4 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 4 1 3 -1.</_>
+        <_>
+          20 5 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 4 3 1 -1.</_>
+        <_>
+          21 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 4 3 2 -1.</_>
+        <_>
+          21 5 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 5 3 1 -1.</_>
+        <_>
+          21 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 6 4 3 -1.</_>
+        <_>
+          20 7 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 8 3 2 -1.</_>
+        <_>
+          21 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 8 3 3 -1.</_>
+        <_>
+          21 9 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 9 3 2 -1.</_>
+        <_>
+          21 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 9 4 10 -1.</_>
+        <_>
+          20 9 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 10 1 3 -1.</_>
+        <_>
+          19 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 10 2 2 -1.</_>
+        <_>
+          20 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 11 4 9 -1.</_>
+        <_>
+          20 11 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 14 4 6 -1.</_>
+        <_>
+          21 15 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 14 2 7 -1.</_>
+        <_>
+          20 14 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 15 3 4 -1.</_>
+        <_>
+          19 16 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 16 4 4 -1.</_>
+        <_>
+          21 17 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 17 3 5 -1.</_>
+        <_>
+          21 17 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 20 1 3 -1.</_>
+        <_>
+          19 21 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 20 4 3 -1.</_>
+        <_>
+          20 21 4 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 1 2 16 -1.</_>
+        <_>
+          21 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 1 3 4 -1.</_>
+        <_>
+          21 2 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 3 3 2 -1.</_>
+        <_>
+          22 4 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 4 3 3 -1.</_>
+        <_>
+          22 5 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 10 1 3 -1.</_>
+        <_>
+          20 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 10 2 2 -1.</_>
+        <_>
+          21 10 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 10 3 4 -1.</_>
+        <_>
+          21 11 3 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 11 1 2 -1.</_>
+        <_>
+          21 11 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 15 2 3 -1.</_>
+        <_>
+          20 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 16 1 3 -1.</_>
+        <_>
+          20 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 16 3 8 -1.</_>
+        <_>
+          22 16 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 16 2 3 -1.</_>
+        <_>
+          20 17 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 17 1 3 -1.</_>
+        <_>
+          20 18 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 17 3 7 -1.</_>
+        <_>
+          22 17 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 19 3 5 -1.</_>
+        <_>
+          22 19 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 1 2 4 -1.</_>
+        <_>
+          21 2 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 2 1 16 -1.</_>
+        <_>
+          22 2 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 9 2 4 -1.</_>
+        <_>
+          22 9 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 10 1 3 -1.</_>
+        <_>
+          21 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 10 2 7 -1.</_>
+        <_>
+          22 10 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 10 2 3 -1.</_>
+        <_>
+          22 11 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 10 2 3 -1.</_>
+        <_>
+          21 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 11 1 3 -1.</_>
+        <_>
+          21 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 12 1 3 -1.</_>
+        <_>
+          21 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 13 1 3 -1.</_>
+        <_>
+          21 14 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 16 1 3 -1.</_>
+        <_>
+          21 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 7 1 3 -1.</_>
+        <_>
+          23 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 10 1 3 -1.</_>
+        <_>
+          23 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 11 1 2 -1.</_>
+        <_>
+          23 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 11 1 3 -1.</_>
+        <_>
+          22 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 15 1 4 -1.</_>
+        <_>
+          22 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt.xml
new file mode 100644
index 000000000..ade4b2121
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt.xml
@@ -0,0 +1,24350 @@
+<?xml version="1.0"?>
+<!--
+    Stump-based 20x20 gentle adaboost frontal face detector.
+    Created by Rainer Lienhart.
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>213</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>22</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>3</maxWeakCount>
+      <stageThreshold>8.2268941402435303e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 4.0141958743333817e-03</internalNodes>
+          <leafValues>
+            3.3794190734624863e-02 8.3781069517135620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 1.5151339583098888e-02</internalNodes>
+          <leafValues>
+            1.5141320228576660e-01 7.4888122081756592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 4.2109931819140911e-03</internalNodes>
+          <leafValues>
+            9.0049281716346741e-02 6.3748198747634888e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>6.9566087722778320e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3 1.6227109590545297e-03</internalNodes>
+          <leafValues>
+            6.9308586418628693e-02 7.1109461784362793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 2.2906649392098188e-03</internalNodes>
+          <leafValues>
+            1.7958030104637146e-01 6.6686922311782837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 5.0025708042085171e-03</internalNodes>
+          <leafValues>
+            1.6936729848384857e-01 6.5540069341659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 7.9659894108772278e-03</internalNodes>
+          <leafValues>
+            5.8663320541381836e-01 9.1414518654346466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 -3.5227010957896709e-03</internalNodes>
+          <leafValues>
+            1.4131669700145721e-01 6.0318958759307861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 3.6667689681053162e-02</internalNodes>
+          <leafValues>
+            3.6756721138954163e-01 7.9203182458877563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 9.3361474573612213e-03</internalNodes>
+          <leafValues>
+            6.1613857746124268e-01 2.0885099470615387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 8.6961314082145691e-03</internalNodes>
+          <leafValues>
+            2.8362309932708740e-01 6.3602739572525024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 1.1488880263641477e-03</internalNodes>
+          <leafValues>
+            2.2235809266567230e-01 5.8007007837295532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -2.1484689787030220e-03</internalNodes>
+          <leafValues>
+            2.4064640700817108e-01 5.7870548963546753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 2.1219060290604830e-03</internalNodes>
+          <leafValues>
+            5.5596548318862915e-01 1.3622370362281799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -9.3949146568775177e-02</internalNodes>
+          <leafValues>
+            8.5027372837066650e-01 4.7177401185035706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 1.3777789426967502e-03</internalNodes>
+          <leafValues>
+            5.9936738014221191e-01 2.8345298767089844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 7.3063157498836517e-02</internalNodes>
+          <leafValues>
+            4.3418860435485840e-01 7.0600342750549316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 3.6767389974556863e-04</internalNodes>
+          <leafValues>
+            3.0278879404067993e-01 6.0515749454498291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -6.0479710809886456e-03</internalNodes>
+          <leafValues>
+            1.7984339594841003e-01 5.6752568483352661e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>9.4985427856445312e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 19 -1.6510689631104469e-02</internalNodes>
+          <leafValues>
+            6.6442251205444336e-01 1.4248579740524292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 2.7052499353885651e-03</internalNodes>
+          <leafValues>
+            6.3253521919250488e-01 1.2884770333766937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 2.8069869149476290e-03</internalNodes>
+          <leafValues>
+            1.2402880191802979e-01 6.1931931972503662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -1.5402400167658925e-03</internalNodes>
+          <leafValues>
+            1.4321430027484894e-01 5.6700158119201660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -5.6386279175058007e-04</internalNodes>
+          <leafValues>
+            1.6574330627918243e-01 5.9052079916000366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 1.9253729842603207e-03</internalNodes>
+          <leafValues>
+            2.6955071091651917e-01 5.7388240098953247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -5.0214841030538082e-03</internalNodes>
+          <leafValues>
+            1.8935389816761017e-01 5.7827740907669067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 2.6365420781075954e-03</internalNodes>
+          <leafValues>
+            2.3093290627002716e-01 5.6954258680343628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 -1.5127769438549876e-03</internalNodes>
+          <leafValues>
+            2.7596020698547363e-01 5.9566420316696167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -1.0157439857721329e-02</internalNodes>
+          <leafValues>
+            1.7325380444526672e-01 5.5220472812652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -1.1953660286962986e-02</internalNodes>
+          <leafValues>
+            1.3394099473953247e-01 5.5590140819549561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 4.8859491944313049e-03</internalNodes>
+          <leafValues>
+            3.6287039518356323e-01 6.1888492107391357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -8.0132916569709778e-02</internalNodes>
+          <leafValues>
+            9.1211050748825073e-02 5.4759448766708374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 1.0643280111253262e-03</internalNodes>
+          <leafValues>
+            3.7151429057121277e-01 5.7113999128341675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -1.3419450260698795e-03</internalNodes>
+          <leafValues>
+            5.9533137083053589e-01 3.3180978894233704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -5.4601140320301056e-02</internalNodes>
+          <leafValues>
+            1.8440659344196320e-01 5.6028461456298828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 2.9071690514683723e-03</internalNodes>
+          <leafValues>
+            3.5942441225051880e-01 6.1317151784896851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 7.4718717951327562e-04</internalNodes>
+          <leafValues>
+            5.9943532943725586e-01 3.4595629572868347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 4.3013808317482471e-03</internalNodes>
+          <leafValues>
+            4.1726520657539368e-01 6.9908452033996582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 4.5017572119832039e-03</internalNodes>
+          <leafValues>
+            4.5097151398658752e-01 7.8014570474624634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 2.4138500913977623e-02</internalNodes>
+          <leafValues>
+            5.4382127523422241e-01 1.3198269903659821e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>39</maxWeakCount>
+      <stageThreshold>1.8412969589233398e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 40 1.9212230108678341e-03</internalNodes>
+          <leafValues>
+            1.4152669906616211e-01 6.1998707056045532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 -1.2748669541906565e-04</internalNodes>
+          <leafValues>
+            6.1910742521286011e-01 1.8849289417266846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 5.1409931620582938e-04</internalNodes>
+          <leafValues>
+            1.4873969554901123e-01 5.8579277992248535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 4.1878609918057919e-03</internalNodes>
+          <leafValues>
+            2.7469098567962646e-01 6.3592398166656494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 5.1015717908740044e-03</internalNodes>
+          <leafValues>
+            5.8708512783050537e-01 2.1756289899349213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 -2.1448440384119749e-03</internalNodes>
+          <leafValues>
+            5.8809447288513184e-01 2.9795908927917480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -2.8977119363844395e-03</internalNodes>
+          <leafValues>
+            2.3733270168304443e-01 5.8766472339630127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -2.1610679104924202e-02</internalNodes>
+          <leafValues>
+            1.2206549942493439e-01 5.1942020654678345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -4.6299318782985210e-03</internalNodes>
+          <leafValues>
+            2.6312309503555298e-01 5.8174091577529907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 5.9393711853772402e-04</internalNodes>
+          <leafValues>
+            3.6386200785636902e-01 5.6985449790954590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 5.3878661245107651e-02</internalNodes>
+          <leafValues>
+            4.3035310506820679e-01 7.5593662261962891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 1.8887349870055914e-03</internalNodes>
+          <leafValues>
+            2.1226030588150024e-01 5.6134271621704102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 -2.3635339457541704e-03</internalNodes>
+          <leafValues>
+            5.6318491697311401e-01 2.6427671313285828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 2.4017799645662308e-02</internalNodes>
+          <leafValues>
+            5.7971078157424927e-01 2.7517059445381165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 2.0543030404951423e-04</internalNodes>
+          <leafValues>
+            2.7052420377731323e-01 5.7525688409805298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 8.4790197433903813e-04</internalNodes>
+          <leafValues>
+            5.4356247186660767e-01 2.3348769545555115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 1.4091329649090767e-03</internalNodes>
+          <leafValues>
+            5.3194248676300049e-01 2.0631550252437592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 1.4642629539594054e-03</internalNodes>
+          <leafValues>
+            5.4189807176589966e-01 3.0688610672950745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 1.6352549428120255e-03</internalNodes>
+          <leafValues>
+            3.6953729391098022e-01 6.1128681898117065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 8.3172752056270838e-04</internalNodes>
+          <leafValues>
+            3.5650369524955750e-01 6.0252362489700317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -2.0998890977352858e-03</internalNodes>
+          <leafValues>
+            1.9139820337295532e-01 5.3628271818161011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -7.4213981861248612e-04</internalNodes>
+          <leafValues>
+            3.8355550169944763e-01 5.5293101072311401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 3.2655049581080675e-03</internalNodes>
+          <leafValues>
+            4.3128961324691772e-01 7.1018958091735840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 8.9134991867467761e-04</internalNodes>
+          <leafValues>
+            3.9848309755325317e-01 6.3919639587402344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -1.5284179709851742e-02</internalNodes>
+          <leafValues>
+            2.3667329549789429e-01 5.4337137937545776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 4.8381411470472813e-03</internalNodes>
+          <leafValues>
+            5.8175009489059448e-01 3.2391890883445740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -9.1093179071322083e-04</internalNodes>
+          <leafValues>
+            5.5405938625335693e-01 2.9118689894676208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 -6.1275060288608074e-03</internalNodes>
+          <leafValues>
+            1.7752550542354584e-01 5.1966291666030884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -4.4576259097084403e-04</internalNodes>
+          <leafValues>
+            3.0241701006889343e-01 5.5335938930511475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 2.2646540775895119e-02</internalNodes>
+          <leafValues>
+            4.4149309396743774e-01 6.9753772020339966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -1.8804960418492556e-03</internalNodes>
+          <leafValues>
+            2.7913948893547058e-01 5.4979521036148071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 7.0889107882976532e-03</internalNodes>
+          <leafValues>
+            5.2631992101669312e-01 2.3855470120906830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 1.7318050377070904e-03</internalNodes>
+          <leafValues>
+            4.3193790316581726e-01 6.9836008548736572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -6.8482700735330582e-03</internalNodes>
+          <leafValues>
+            3.0820429325103760e-01 5.3909200429916382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 -1.5062530110299122e-05</internalNodes>
+          <leafValues>
+            5.5219221115112305e-01 3.1203660368919373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 2.9475569725036621e-02</internalNodes>
+          <leafValues>
+            5.4013228416442871e-01 1.7706030607223511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 8.1387329846620560e-03</internalNodes>
+          <leafValues>
+            5.1786178350448608e-01 1.2110190093517303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 2.0942950621247292e-02</internalNodes>
+          <leafValues>
+            5.2902942895889282e-01 3.3112218976020813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -9.5665529370307922e-03</internalNodes>
+          <leafValues>
+            7.4719941616058350e-01 4.4519689679145813e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>1.5324139595031738e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 79 -2.8206960996612906e-04</internalNodes>
+          <leafValues>
+            2.0640860497951508e-01 6.0767322778701782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 1.6790600493550301e-03</internalNodes>
+          <leafValues>
+            5.8519971370697021e-01 1.2553839385509491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 6.9827912375330925e-04</internalNodes>
+          <leafValues>
+            9.4018429517745972e-02 5.7289612293243408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 7.8959012171253562e-04</internalNodes>
+          <leafValues>
+            1.7819879949092865e-01 5.6943088769912720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -2.8560499195009470e-03</internalNodes>
+          <leafValues>
+            1.6383990645408630e-01 5.7886648178100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -3.8122469559311867e-03</internalNodes>
+          <leafValues>
+            2.0854400098323822e-01 5.5085647106170654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.5896620461717248e-03</internalNodes>
+          <leafValues>
+            5.7027608156204224e-01 1.8572150170803070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 1.0078339837491512e-02</internalNodes>
+          <leafValues>
+            5.1169431209564209e-01 2.1897700428962708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 -6.3526302576065063e-02</internalNodes>
+          <leafValues>
+            7.1313798427581787e-01 4.0438130497932434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -9.1031491756439209e-03</internalNodes>
+          <leafValues>
+            2.5671818852424622e-01 5.4639732837677002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 -2.4035000242292881e-03</internalNodes>
+          <leafValues>
+            1.7006659507751465e-01 5.5909740924835205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 1.5226360410451889e-03</internalNodes>
+          <leafValues>
+            5.4105567932128906e-01 2.6190540194511414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 1.7997439950704575e-02</internalNodes>
+          <leafValues>
+            3.7324368953704834e-01 6.5352207422256470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 -6.4538191072642803e-03</internalNodes>
+          <leafValues>
+            2.6264819502830505e-01 5.5374461412429810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 -1.1880760081112385e-02</internalNodes>
+          <leafValues>
+            2.0037539303302765e-01 5.5447459220886230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 1.2713660253211856e-03</internalNodes>
+          <leafValues>
+            5.5919027328491211e-01 3.0319759249687195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 1.1376109905540943e-03</internalNodes>
+          <leafValues>
+            2.7304071187973022e-01 5.6465089321136475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -4.2651998810470104e-03</internalNodes>
+          <leafValues>
+            1.4059090614318848e-01 5.4618209600448608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -2.9602861031889915e-03</internalNodes>
+          <leafValues>
+            1.7950350046157837e-01 5.4592901468276978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -8.8448226451873779e-03</internalNodes>
+          <leafValues>
+            5.7367831468582153e-01 2.8092199563980103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 -6.6430689767003059e-03</internalNodes>
+          <leafValues>
+            2.3706759512424469e-01 5.5038261413574219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 3.9997808635234833e-03</internalNodes>
+          <leafValues>
+            5.6081998348236084e-01 3.3042821288108826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -4.1221720166504383e-03</internalNodes>
+          <leafValues>
+            1.6401059925556183e-01 5.3789931535720825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 1.5624909661710262e-02</internalNodes>
+          <leafValues>
+            5.2276492118835449e-01 2.2886039316654205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 -1.0356419719755650e-02</internalNodes>
+          <leafValues>
+            7.0161938667297363e-01 4.2529278993606567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 -8.7960809469223022e-03</internalNodes>
+          <leafValues>
+            2.7673470973968506e-01 5.3558301925659180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 1.6226939857006073e-01</internalNodes>
+          <leafValues>
+            4.3422400951385498e-01 7.4425792694091797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 4.5542530715465546e-03</internalNodes>
+          <leafValues>
+            5.7264858484268188e-01 2.5821250677108765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 -2.1309209987521172e-03</internalNodes>
+          <leafValues>
+            2.1068480610847473e-01 5.3610187768936157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -1.3208420015871525e-02</internalNodes>
+          <leafValues>
+            7.5937908887863159e-01 4.5524680614471436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -6.5996676683425903e-02</internalNodes>
+          <leafValues>
+            1.2524759769439697e-01 5.3440397977828979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 7.9142656177282333e-03</internalNodes>
+          <leafValues>
+            3.3153840899467468e-01 5.6010431051254272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 2.0894279703497887e-02</internalNodes>
+          <leafValues>
+            5.5060499906539917e-01 2.7688381075859070e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>2.1010639190673828e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 112 1.1961159761995077e-03</internalNodes>
+          <leafValues>
+            1.7626909911632538e-01 6.1562412977218628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -1.8679830245673656e-03</internalNodes>
+          <leafValues>
+            6.1181068420410156e-01 1.8323999643325806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -1.9579799845814705e-04</internalNodes>
+          <leafValues>
+            9.9044263362884521e-02 5.7238161563873291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -8.0255657667294145e-04</internalNodes>
+          <leafValues>
+            5.5798798799514771e-01 2.3772829771041870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -2.4510810617357492e-03</internalNodes>
+          <leafValues>
+            2.2314579784870148e-01 5.8589351177215576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 5.0361850298941135e-04</internalNodes>
+          <leafValues>
+            2.6539939641952515e-01 5.7941037416458130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 4.0293349884450436e-03</internalNodes>
+          <leafValues>
+            5.8038270473480225e-01 2.4848650395870209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 -1.4451709575951099e-02</internalNodes>
+          <leafValues>
+            1.8303519487380981e-01 5.4842048883438110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 2.0380979403853416e-03</internalNodes>
+          <leafValues>
+            3.3635589480400085e-01 6.0510927438735962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -1.6155190533027053e-03</internalNodes>
+          <leafValues>
+            2.2866420447826385e-01 5.4412460327148438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 3.3458340913057327e-03</internalNodes>
+          <leafValues>
+            5.6259131431579590e-01 2.3923380672931671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 1.6379579901695251e-03</internalNodes>
+          <leafValues>
+            3.9069938659667969e-01 5.9646219015121460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 3.0251210555434227e-02</internalNodes>
+          <leafValues>
+            5.2484822273254395e-01 1.5757469832897186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 3.7251990288496017e-02</internalNodes>
+          <leafValues>
+            4.1943109035491943e-01 6.7484188079833984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -2.5109790265560150e-02</internalNodes>
+          <leafValues>
+            1.8825499713420868e-01 5.4734510183334351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -5.3099058568477631e-03</internalNodes>
+          <leafValues>
+            1.3399730622768402e-01 5.2271109819412231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 1.2086479691788554e-03</internalNodes>
+          <leafValues>
+            3.7620881199836731e-01 6.1096358299255371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -2.1907679736614227e-02</internalNodes>
+          <leafValues>
+            2.6631429791450500e-01 5.4040068387985229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 5.4116579703986645e-03</internalNodes>
+          <leafValues>
+            5.3635787963867188e-01 2.2322730720043182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 6.9946326315402985e-02</internalNodes>
+          <leafValues>
+            5.3582328557968140e-01 2.4536980688571930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 3.4520021290518343e-04</internalNodes>
+          <leafValues>
+            2.4096719920635223e-01 5.3769302368164062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 1.2627709656953812e-03</internalNodes>
+          <leafValues>
+            5.4258567094802856e-01 3.1556931138038635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 2.2719509899616241e-02</internalNodes>
+          <leafValues>
+            4.1584059596061707e-01 6.5978652238845825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 -1.8111000536009669e-03</internalNodes>
+          <leafValues>
+            2.8112530708312988e-01 5.5052447319030762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 3.3469670452177525e-03</internalNodes>
+          <leafValues>
+            5.2600282430648804e-01 1.8914650380611420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 4.0791751234792173e-04</internalNodes>
+          <leafValues>
+            5.6735092401504517e-01 3.3442100882530212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.2734799645841122e-02</internalNodes>
+          <leafValues>
+            5.3435921669006348e-01 2.3956120014190674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -7.3119727894663811e-03</internalNodes>
+          <leafValues>
+            6.0108900070190430e-01 4.0222078561782837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 -5.6948751211166382e-02</internalNodes>
+          <leafValues>
+            8.1991511583328247e-01 4.5431908965110779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -5.0116591155529022e-03</internalNodes>
+          <leafValues>
+            2.2002810239791870e-01 5.3577107191085815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 6.0334368608891964e-03</internalNodes>
+          <leafValues>
+            4.4130811095237732e-01 7.1817511320114136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 3.9437441155314445e-03</internalNodes>
+          <leafValues>
+            5.4788607358932495e-01 2.7917331457138062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 -3.6591119132936001e-03</internalNodes>
+          <leafValues>
+            6.3578677177429199e-01 3.9897239208221436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -3.8456181064248085e-03</internalNodes>
+          <leafValues>
+            3.4936860203742981e-01 5.3006649017333984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -7.1926261298358440e-03</internalNodes>
+          <leafValues>
+            1.1196149885654449e-01 5.2296727895736694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 -5.2798941731452942e-02</internalNodes>
+          <leafValues>
+            2.3871029913425446e-01 5.4534512758255005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -7.9537667334079742e-03</internalNodes>
+          <leafValues>
+            7.5869178771972656e-01 4.4393768906593323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 -2.7344180271029472e-03</internalNodes>
+          <leafValues>
+            2.5654768943786621e-01 5.4893219470977783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -1.8507939530536532e-03</internalNodes>
+          <leafValues>
+            6.7343479394912720e-01 4.2524749040603638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 1.5918919816613197e-02</internalNodes>
+          <leafValues>
+            5.4883527755737305e-01 2.2926619648933411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -1.2687679845839739e-03</internalNodes>
+          <leafValues>
+            6.1043310165405273e-01 4.0223899483680725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 6.2883910723030567e-03</internalNodes>
+          <leafValues>
+            5.3108531236648560e-01 1.5361930429935455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 -6.2259892001748085e-03</internalNodes>
+          <leafValues>
+            1.7291119694709778e-01 5.2416062355041504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 -1.2132599949836731e-02</internalNodes>
+          <leafValues>
+            6.5977597236633301e-01 4.3251821398735046e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>50</maxWeakCount>
+      <stageThreshold>2.3918790817260742e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 156 -3.9184908382594585e-03</internalNodes>
+          <leafValues>
+            6.1034351587295532e-01 1.4693309366703033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 1.5971299726516008e-03</internalNodes>
+          <leafValues>
+            2.6323631405830383e-01 5.8964669704437256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 1.7780110239982605e-02</internalNodes>
+          <leafValues>
+            5.8728742599487305e-01 1.7603619396686554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 6.5334769897162914e-04</internalNodes>
+          <leafValues>
+            1.5678019821643829e-01 5.5960661172866821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -2.8353091329336166e-04</internalNodes>
+          <leafValues>
+            1.9131539762020111e-01 5.7320362329483032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 1.6104689566418529e-03</internalNodes>
+          <leafValues>
+            2.9149138927459717e-01 5.6230807304382324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -9.7750619053840637e-02</internalNodes>
+          <leafValues>
+            1.9434769451618195e-01 5.6482332944869995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 5.5182358482852578e-04</internalNodes>
+          <leafValues>
+            3.1346169114112854e-01 5.5046397447586060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -1.2858220376074314e-02</internalNodes>
+          <leafValues>
+            2.5364819169044495e-01 5.7601428031921387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 4.1530239395797253e-03</internalNodes>
+          <leafValues>
+            5.7677221298217773e-01 3.6597740650177002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 1.7092459602281451e-03</internalNodes>
+          <leafValues>
+            2.8431910276412964e-01 5.9189391136169434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 7.5217359699308872e-03</internalNodes>
+          <leafValues>
+            4.0524271130561829e-01 6.1831092834472656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 2.2479810286313295e-03</internalNodes>
+          <leafValues>
+            5.7837551832199097e-01 3.1354010105133057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 5.2006211131811142e-02</internalNodes>
+          <leafValues>
+            5.5413120985031128e-01 1.9166369736194611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 1.2085529975593090e-02</internalNodes>
+          <leafValues>
+            4.0326559543609619e-01 6.6445910930633545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 1.4687820112158079e-05</internalNodes>
+          <leafValues>
+            3.5359779000282288e-01 5.7093828916549683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 7.1395188570022583e-06</internalNodes>
+          <leafValues>
+            3.0374449491500854e-01 5.6102699041366577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -4.6001640148460865e-03</internalNodes>
+          <leafValues>
+            7.1810871362686157e-01 4.5803260803222656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 2.0058949012309313e-03</internalNodes>
+          <leafValues>
+            5.6219518184661865e-01 2.9536840319633484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 4.5050270855426788e-03</internalNodes>
+          <leafValues>
+            4.6153879165649414e-01 7.6190179586410522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 1.1746830306947231e-02</internalNodes>
+          <leafValues>
+            5.3438371419906616e-01 1.7725290358066559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -5.8316338807344437e-02</internalNodes>
+          <leafValues>
+            1.6862459480762482e-01 5.3407722711563110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 2.3629379575140774e-04</internalNodes>
+          <leafValues>
+            3.7920561432838440e-01 6.0268038511276245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -7.8156180679798126e-03</internalNodes>
+          <leafValues>
+            1.5128670632839203e-01 5.3243237733840942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -1.0876160115003586e-02</internalNodes>
+          <leafValues>
+            2.0818220078945160e-01 5.3199452161788940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -2.7745519764721394e-03</internalNodes>
+          <leafValues>
+            4.0982469916343689e-01 5.2103281021118164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 -7.8276381827890873e-04</internalNodes>
+          <leafValues>
+            5.6932741403579712e-01 3.4788420796394348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 1.3870409689843655e-02</internalNodes>
+          <leafValues>
+            5.3267508745193481e-01 2.2576980292797089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -2.3674910888075829e-02</internalNodes>
+          <leafValues>
+            1.5513050556182861e-01 5.2007079124450684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -1.4879409718560055e-05</internalNodes>
+          <leafValues>
+            5.5005669593811035e-01 3.8201761245727539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 3.6190641112625599e-03</internalNodes>
+          <leafValues>
+            4.2386838793754578e-01 6.6397482156753540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -1.9817110151052475e-02</internalNodes>
+          <leafValues>
+            2.1500380337238312e-01 5.3823578357696533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -3.8154039066284895e-03</internalNodes>
+          <leafValues>
+            6.6757112741470337e-01 4.2152971029281616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 -4.9775829538702965e-03</internalNodes>
+          <leafValues>
+            2.2672890126705170e-01 5.3863281011581421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 2.2441020701080561e-03</internalNodes>
+          <leafValues>
+            4.3086910247802734e-01 6.8557357788085938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 1.2282459996640682e-02</internalNodes>
+          <leafValues>
+            5.8366149663925171e-01 3.4674790501594543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -2.8548699337989092e-03</internalNodes>
+          <leafValues>
+            7.0169448852539062e-01 4.3114539980888367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -3.7875669077038765e-03</internalNodes>
+          <leafValues>
+            2.8953450918197632e-01 5.2249461412429810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -1.2201230274513364e-03</internalNodes>
+          <leafValues>
+            2.9755708575248718e-01 5.4816448688507080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 1.0160599835216999e-02</internalNodes>
+          <leafValues>
+            4.8888179659843445e-01 8.1826978921890259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -1.6174569725990295e-02</internalNodes>
+          <leafValues>
+            1.4814929664134979e-01 5.2399927377700806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 1.9292460754513741e-02</internalNodes>
+          <leafValues>
+            4.7863098978996277e-01 7.3781907558441162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 -3.2479539513587952e-03</internalNodes>
+          <leafValues>
+            7.3742228746414185e-01 4.4706439971923828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -9.3803480267524719e-03</internalNodes>
+          <leafValues>
+            3.4891548752784729e-01 5.5379962921142578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -1.2606129981577396e-02</internalNodes>
+          <leafValues>
+            2.3796869814395905e-01 5.3154432773590088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -2.5621930137276649e-02</internalNodes>
+          <leafValues>
+            1.9646880030632019e-01 5.1387697458267212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 -7.5741496402770281e-05</internalNodes>
+          <leafValues>
+            5.5905228853225708e-01 3.3658531308174133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -8.9210882782936096e-02</internalNodes>
+          <leafValues>
+            6.3404656946659088e-02 5.1626348495483398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 -2.7670480776578188e-03</internalNodes>
+          <leafValues>
+            7.3234677314758301e-01 4.4907060265541077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 2.7152578695677221e-04</internalNodes>
+          <leafValues>
+            4.1148349642753601e-01 5.9855180978775024e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>51</maxWeakCount>
+      <stageThreshold>2.4527879714965820e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 206 1.4786219689995050e-03</internalNodes>
+          <leafValues>
+            2.6635450124740601e-01 6.6433167457580566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -1.8741659587249160e-03</internalNodes>
+          <leafValues>
+            6.1438488960266113e-01 2.5185129046440125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 -1.7151009524241090e-03</internalNodes>
+          <leafValues>
+            5.7663410902023315e-01 2.3974630236625671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -1.8939269939437509e-03</internalNodes>
+          <leafValues>
+            5.6820458173751831e-01 2.5291448831558228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -5.3006052039563656e-03</internalNodes>
+          <leafValues>
+            1.6406759619712830e-01 5.5560797452926636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -4.6662531793117523e-02</internalNodes>
+          <leafValues>
+            6.1231541633605957e-01 4.7628301382064819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 -7.9431332414969802e-04</internalNodes>
+          <leafValues>
+            5.7078588008880615e-01 2.8394040465354919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 1.4891670085489750e-02</internalNodes>
+          <leafValues>
+            4.0896728634834290e-01 6.0063672065734863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -1.2046529445797205e-03</internalNodes>
+          <leafValues>
+            5.7124507427215576e-01 2.7052891254425049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 6.0619381256401539e-03</internalNodes>
+          <leafValues>
+            5.2625042200088501e-01 3.2622259855270386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -2.5286648888140917e-03</internalNodes>
+          <leafValues>
+            6.8538308143615723e-01 4.1992568969726562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -5.9010218828916550e-03</internalNodes>
+          <leafValues>
+            3.2662820816040039e-01 5.4348129034042358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 5.6702760048210621e-03</internalNodes>
+          <leafValues>
+            5.4684108495712280e-01 2.3190039396286011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -3.0304100364446640e-03</internalNodes>
+          <leafValues>
+            5.5706679821014404e-01 2.7082380652427673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 2.9803649522364140e-03</internalNodes>
+          <leafValues>
+            3.7005689740180969e-01 5.8906257152557373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -7.5840510427951813e-02</internalNodes>
+          <leafValues>
+            2.1400700509548187e-01 5.4199481010437012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 1.9262539222836494e-02</internalNodes>
+          <leafValues>
+            5.5267721414566040e-01 2.7265900373458862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 1.8888259364757687e-04</internalNodes>
+          <leafValues>
+            3.9580118656158447e-01 6.0172098875045776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 2.9369549825787544e-02</internalNodes>
+          <leafValues>
+            5.2413737773895264e-01 1.4357580244541168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 1.0417619487270713e-03</internalNodes>
+          <leafValues>
+            3.3854091167449951e-01 5.9299832582473755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 2.6125640142709017e-03</internalNodes>
+          <leafValues>
+            5.4853779077529907e-01 3.0215978622436523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 9.6977467183023691e-04</internalNodes>
+          <leafValues>
+            3.3752760291099548e-01 5.5320328474044800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 5.9512659208849072e-04</internalNodes>
+          <leafValues>
+            5.6317430734634399e-01 3.3593991398811340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 -1.0156559944152832e-01</internalNodes>
+          <leafValues>
+            6.3735038042068481e-02 5.2304250001907349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 3.6156699061393738e-02</internalNodes>
+          <leafValues>
+            5.1369631290435791e-01 1.0295289754867554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 3.4624140243977308e-03</internalNodes>
+          <leafValues>
+            3.8793200254440308e-01 5.5582892894744873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 1.9554980099201202e-02</internalNodes>
+          <leafValues>
+            5.2500867843627930e-01 1.8758599460124969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 -2.3121440317481756e-03</internalNodes>
+          <leafValues>
+            6.6720288991928101e-01 4.6796411275863647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -1.8605289515107870e-03</internalNodes>
+          <leafValues>
+            7.1633791923522949e-01 4.3346709012985229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 -9.4026362057775259e-04</internalNodes>
+          <leafValues>
+            3.0213609337806702e-01 5.6502032279968262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -5.2418331615626812e-03</internalNodes>
+          <leafValues>
+            1.8200090527534485e-01 5.2502560615539551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 1.1729019752237946e-04</internalNodes>
+          <leafValues>
+            3.3891880512237549e-01 5.4459732770919800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 1.1878840159624815e-03</internalNodes>
+          <leafValues>
+            4.0853491425514221e-01 6.2535631656646729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 -1.0881359688937664e-02</internalNodes>
+          <leafValues>
+            3.3783990144729614e-01 5.7000827789306641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 1.7354859737679362e-03</internalNodes>
+          <leafValues>
+            4.2046359181404114e-01 6.5230387449264526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -6.5119052305817604e-03</internalNodes>
+          <leafValues>
+            2.5952160358428955e-01 5.4281437397003174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -1.2136430013924837e-03</internalNodes>
+          <leafValues>
+            6.1651438474655151e-01 3.9778938889503479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -1.0354240424931049e-02</internalNodes>
+          <leafValues>
+            1.6280280053615570e-01 5.2195048332214355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 5.5858830455690622e-04</internalNodes>
+          <leafValues>
+            3.1996509432792664e-01 5.5035740137100220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 1.5299649909138680e-02</internalNodes>
+          <leafValues>
+            4.1039940714836121e-01 6.1223882436752319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 -2.1588210016489029e-02</internalNodes>
+          <leafValues>
+            1.0349129885435104e-01 5.1973849534988403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -1.2834629416465759e-01</internalNodes>
+          <leafValues>
+            8.4938651323318481e-01 4.8931029438972473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -2.2927189711481333e-03</internalNodes>
+          <leafValues>
+            3.1301578879356384e-01 5.4715752601623535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 7.9915106296539307e-02</internalNodes>
+          <leafValues>
+            4.8563209176063538e-01 6.0739892721176147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 -7.9441092908382416e-02</internalNodes>
+          <leafValues>
+            8.3946740627288818e-01 4.6245330572128296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -5.2800010889768600e-03</internalNodes>
+          <leafValues>
+            1.8816959857940674e-01 5.3066980838775635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 1.0463109938427806e-03</internalNodes>
+          <leafValues>
+            5.2712291479110718e-01 2.5830659270286560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 2.6317298761568964e-04</internalNodes>
+          <leafValues>
+            4.2353048920631409e-01 5.7354408502578735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 -3.6173160187900066e-03</internalNodes>
+          <leafValues>
+            6.9343960285186768e-01 4.4954448938369751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 1.1421879753470421e-02</internalNodes>
+          <leafValues>
+            5.9009212255477905e-01 4.1381931304931641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 -1.9963278900831938e-03</internalNodes>
+          <leafValues>
+            6.4663827419281006e-01 4.3272399902343750e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>56</maxWeakCount>
+      <stageThreshold>2.7153350830078125e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 257 -9.9691245704889297e-03</internalNodes>
+          <leafValues>
+            6.1423242092132568e-01 2.4822120368480682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 7.3073059320449829e-04</internalNodes>
+          <leafValues>
+            5.7049518823623657e-01 2.3219659924507141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 6.4045301405712962e-04</internalNodes>
+          <leafValues>
+            2.1122519671916962e-01 5.8149331808090210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 4.5424019917845726e-03</internalNodes>
+          <leafValues>
+            2.9504820704460144e-01 5.8663117885589600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 9.2477443104144186e-05</internalNodes>
+          <leafValues>
+            2.9909908771514893e-01 5.7913267612457275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -8.6603146046400070e-03</internalNodes>
+          <leafValues>
+            2.8130298852920532e-01 5.6355422735214233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 8.0515816807746887e-03</internalNodes>
+          <leafValues>
+            3.5353690385818481e-01 6.0547572374343872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 4.3835240649059415e-04</internalNodes>
+          <leafValues>
+            5.5965322256088257e-01 2.7315109968185425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -9.8168973636347800e-05</internalNodes>
+          <leafValues>
+            5.9780317544937134e-01 3.6385610699653625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 -1.1298790341243148e-03</internalNodes>
+          <leafValues>
+            2.7552521228790283e-01 5.4327291250228882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 6.4356150105595589e-03</internalNodes>
+          <leafValues>
+            4.3056419491767883e-01 7.0698332786560059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -5.6829329580068588e-02</internalNodes>
+          <leafValues>
+            2.4952429533004761e-01 5.2949970960617065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 4.0668169967830181e-03</internalNodes>
+          <leafValues>
+            5.4785531759262085e-01 2.4977239966392517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 4.8164798499783501e-05</internalNodes>
+          <leafValues>
+            3.9386010169982910e-01 5.7063561677932739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 6.1795017682015896e-03</internalNodes>
+          <leafValues>
+            4.4076061248779297e-01 7.3947668075561523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 6.4985752105712891e-03</internalNodes>
+          <leafValues>
+            5.4452431201934814e-01 2.4791529774665833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 -1.0211090557277203e-03</internalNodes>
+          <leafValues>
+            2.5447669625282288e-01 5.3389710187911987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -5.4247528314590454e-03</internalNodes>
+          <leafValues>
+            2.7188581228256226e-01 5.3240692615509033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -1.0559899965301156e-03</internalNodes>
+          <leafValues>
+            3.1782880425453186e-01 5.5345088243484497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 6.6465808777138591e-04</internalNodes>
+          <leafValues>
+            4.2842191457748413e-01 6.5581941604614258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -2.7524109464138746e-04</internalNodes>
+          <leafValues>
+            5.9028607606887817e-01 3.8102629780769348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 4.2293202131986618e-03</internalNodes>
+          <leafValues>
+            3.8164898753166199e-01 5.7093858718872070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 -3.2868210691958666e-03</internalNodes>
+          <leafValues>
+            1.7477439343929291e-01 5.2595442533493042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 1.5611879643984139e-04</internalNodes>
+          <leafValues>
+            3.6017221212387085e-01 5.7256120443344116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -7.3621381488919724e-06</internalNodes>
+          <leafValues>
+            5.4018580913543701e-01 3.0444970726966858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -1.4767250046133995e-02</internalNodes>
+          <leafValues>
+            3.2207700610160828e-01 5.5734348297119141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 2.4489590898156166e-02</internalNodes>
+          <leafValues>
+            4.3015280365943909e-01 6.5188127756118774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 -3.7652091123163700e-04</internalNodes>
+          <leafValues>
+            3.5645830631256104e-01 5.5982369184494019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 7.3657688517414499e-06</internalNodes>
+          <leafValues>
+            3.4907829761505127e-01 5.5618977546691895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -1.5099939890205860e-02</internalNodes>
+          <leafValues>
+            1.7762720584869385e-01 5.3352999687194824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -3.8316650316119194e-03</internalNodes>
+          <leafValues>
+            6.1496877670288086e-01 4.2213940620422363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 1.6925400123000145e-02</internalNodes>
+          <leafValues>
+            5.4130148887634277e-01 2.1665850281715393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -3.0477850232273340e-03</internalNodes>
+          <leafValues>
+            6.4494907855987549e-01 4.3546178936958313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 3.2140589319169521e-03</internalNodes>
+          <leafValues>
+            5.4001551866531372e-01 3.5232171416282654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -4.0023201145231724e-03</internalNodes>
+          <leafValues>
+            2.7745240926742554e-01 5.3384172916412354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 7.4182129465043545e-03</internalNodes>
+          <leafValues>
+            5.6767392158508301e-01 3.7028178572654724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -8.8764587417244911e-03</internalNodes>
+          <leafValues>
+            7.7492219209671021e-01 4.5836889743804932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 2.7311739977449179e-03</internalNodes>
+          <leafValues>
+            5.3387218713760376e-01 3.9966610074043274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 -2.5082379579544067e-03</internalNodes>
+          <leafValues>
+            5.6119632720947266e-01 3.7774989008903503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 -8.0541074275970459e-03</internalNodes>
+          <leafValues>
+            2.9152289032936096e-01 5.1791828870773315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -9.7938813269138336e-04</internalNodes>
+          <leafValues>
+            5.5364328622817993e-01 3.7001928687095642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -5.8745909482240677e-03</internalNodes>
+          <leafValues>
+            3.7543910741806030e-01 5.6793761253356934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -4.4936719350516796e-03</internalNodes>
+          <leafValues>
+            7.0196992158889771e-01 4.4809499382972717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -5.4389229044318199e-03</internalNodes>
+          <leafValues>
+            2.3103649914264679e-01 5.3133869171142578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 -7.5094640487805009e-04</internalNodes>
+          <leafValues>
+            5.8648687601089478e-01 4.1293430328369141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 1.4528800420521293e-05</internalNodes>
+          <leafValues>
+            3.7324070930480957e-01 5.6196212768554688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 4.0758069604635239e-02</internalNodes>
+          <leafValues>
+            5.3120911121368408e-01 2.7205219864845276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 6.6505931317806244e-03</internalNodes>
+          <leafValues>
+            4.7100159525871277e-01 6.6934937238693237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 4.5759351924061775e-03</internalNodes>
+          <leafValues>
+            5.1678192615509033e-01 1.6372759640216827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 6.5269311890006065e-03</internalNodes>
+          <leafValues>
+            5.3976088762283325e-01 2.9385319352149963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -1.3660379685461521e-02</internalNodes>
+          <leafValues>
+            7.0864880084991455e-01 4.5322000980377197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 2.7358869090676308e-02</internalNodes>
+          <leafValues>
+            5.2064812183380127e-01 3.5892319679260254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 6.2197551596909761e-04</internalNodes>
+          <leafValues>
+            3.5070759057998657e-01 5.4411232471466064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 -3.3077080734074116e-03</internalNodes>
+          <leafValues>
+            5.8595228195190430e-01 4.0248918533325195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 -1.0631109587848186e-02</internalNodes>
+          <leafValues>
+            6.7432671785354614e-01 4.4226029515266418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 1.9441649317741394e-02</internalNodes>
+          <leafValues>
+            5.2827161550521851e-01 1.7979049682617188e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>71</maxWeakCount>
+      <stageThreshold>3.4554111480712891e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 313 -5.5052167735993862e-03</internalNodes>
+          <leafValues>
+            5.9147310256958008e-01 2.6265591382980347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 1.9562279339879751e-03</internalNodes>
+          <leafValues>
+            2.3125819861888885e-01 5.7416272163391113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -8.8924784213304520e-03</internalNodes>
+          <leafValues>
+            1.6565300524234772e-01 5.6266540288925171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 8.3638377487659454e-02</internalNodes>
+          <leafValues>
+            5.4234498739242554e-01 1.9572949409484863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 1.2282270472496748e-03</internalNodes>
+          <leafValues>
+            3.4179040789604187e-01 5.9925037622451782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 5.7629169896245003e-03</internalNodes>
+          <leafValues>
+            3.7195819616317749e-01 6.0799038410186768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -1.6417410224676132e-03</internalNodes>
+          <leafValues>
+            2.5774860382080078e-01 5.5769157409667969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 3.4113149158656597e-03</internalNodes>
+          <leafValues>
+            2.9507490992546082e-01 5.5141717195510864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -1.1069320142269135e-02</internalNodes>
+          <leafValues>
+            7.5693589448928833e-01 4.4770789146423340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 3.4865971654653549e-02</internalNodes>
+          <leafValues>
+            5.5837088823318481e-01 2.6696211099624634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 6.5701099811121821e-04</internalNodes>
+          <leafValues>
+            5.6273132562637329e-01 2.9888901114463806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -2.4339130148291588e-02</internalNodes>
+          <leafValues>
+            2.7711850404739380e-01 5.1088631153106689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 5.9435202274471521e-04</internalNodes>
+          <leafValues>
+            5.5806517601013184e-01 3.1203418970108032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 2.2971509024500847e-03</internalNodes>
+          <leafValues>
+            3.3302500844001770e-01 5.6790757179260254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 -3.7801829166710377e-03</internalNodes>
+          <leafValues>
+            2.9905349016189575e-01 5.3448081016540527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 -1.3420669734477997e-01</internalNodes>
+          <leafValues>
+            1.4638589322566986e-01 5.3925681114196777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 7.5224548345431685e-04</internalNodes>
+          <leafValues>
+            3.7469539046287537e-01 5.6927347183227539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 -4.0545541793107986e-02</internalNodes>
+          <leafValues>
+            2.7547478675842285e-01 5.4842978715896606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 1.2572970008477569e-03</internalNodes>
+          <leafValues>
+            3.7445840239524841e-01 5.7560759782791138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 -7.4249948374927044e-03</internalNodes>
+          <leafValues>
+            7.5138592720031738e-01 4.7282311320304871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 5.0908129196614027e-04</internalNodes>
+          <leafValues>
+            5.4048967361450195e-01 2.9323211312294006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 -1.2808450264856219e-03</internalNodes>
+          <leafValues>
+            6.1697798967361450e-01 4.2733490467071533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 -1.8348860321566463e-03</internalNodes>
+          <leafValues>
+            2.0484960079193115e-01 5.2064722776412964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 2.7484869584441185e-02</internalNodes>
+          <leafValues>
+            5.2529847621917725e-01 1.6755220293998718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 2.2372419480234385e-03</internalNodes>
+          <leafValues>
+            5.2677828073501587e-01 2.7776581048965454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -8.8635291904211044e-03</internalNodes>
+          <leafValues>
+            6.9545578956604004e-01 4.8120489716529846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 4.1753971017897129e-03</internalNodes>
+          <leafValues>
+            4.2918878793716431e-01 6.3491958379745483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 -1.7098189564421773e-03</internalNodes>
+          <leafValues>
+            2.9305368661880493e-01 5.3612488508224487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 6.5328548662364483e-03</internalNodes>
+          <leafValues>
+            4.4953250885009766e-01 7.4096941947937012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -9.5372907817363739e-03</internalNodes>
+          <leafValues>
+            3.1491199135780334e-01 5.4165017604827881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 2.5310989469289780e-02</internalNodes>
+          <leafValues>
+            5.1218920946121216e-01 1.3117079436779022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 3.6460969597101212e-02</internalNodes>
+          <leafValues>
+            5.1759117841720581e-01 2.5913399457931519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 2.0854329690337181e-02</internalNodes>
+          <leafValues>
+            5.1371401548385620e-01 1.5823160111904144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -8.7207747856155038e-04</internalNodes>
+          <leafValues>
+            5.5743098258972168e-01 4.3989789485931396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -1.5227000403683633e-05</internalNodes>
+          <leafValues>
+            5.5489408969879150e-01 3.7080699205398560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -8.4316509310156107e-04</internalNodes>
+          <leafValues>
+            3.3874198794364929e-01 5.5542111396789551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 3.6037859972566366e-03</internalNodes>
+          <leafValues>
+            5.3580617904663086e-01 3.4111711382865906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -6.8057891912758350e-03</internalNodes>
+          <leafValues>
+            6.1252027750015259e-01 4.3458628654479980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 -4.7021660953760147e-02</internalNodes>
+          <leafValues>
+            2.3581659793853760e-01 5.1937389373779297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -3.6954108625650406e-02</internalNodes>
+          <leafValues>
+            7.3231112957000732e-01 4.7609439492225647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 1.0439479956403375e-03</internalNodes>
+          <leafValues>
+            5.4194551706314087e-01 3.4113308787345886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -2.1050689974799752e-04</internalNodes>
+          <leafValues>
+            2.8216940164566040e-01 5.5549472570419312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 -8.0831587314605713e-02</internalNodes>
+          <leafValues>
+            9.1299301385879517e-01 4.6974349021911621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 -3.6579059087671340e-04</internalNodes>
+          <leafValues>
+            6.0226702690124512e-01 3.9782929420471191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -1.2545920617412776e-04</internalNodes>
+          <leafValues>
+            5.6132131814956665e-01 3.8455399870872498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 -6.8786486983299255e-02</internalNodes>
+          <leafValues>
+            2.2616119682788849e-01 5.3004968166351318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 1.2415789999067783e-02</internalNodes>
+          <leafValues>
+            4.0756919980049133e-01 5.8288121223449707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 -4.7174817882478237e-03</internalNodes>
+          <leafValues>
+            2.8272539377212524e-01 5.2677577733993530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 3.8136858493089676e-02</internalNodes>
+          <leafValues>
+            5.0747412443161011e-01 1.0236159712076187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -2.8168049175292253e-03</internalNodes>
+          <leafValues>
+            6.1690068244934082e-01 4.3596929311752319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 8.1303603947162628e-03</internalNodes>
+          <leafValues>
+            4.5244330167770386e-01 7.6060950756072998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 6.0056019574403763e-03</internalNodes>
+          <leafValues>
+            5.2404087781906128e-01 1.8597120046615601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 1.9139319658279419e-02</internalNodes>
+          <leafValues>
+            5.2093791961669922e-01 2.3320719599723816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 1.6445759683847427e-02</internalNodes>
+          <leafValues>
+            5.4507029056549072e-01 3.2642349600791931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -3.7356890738010406e-02</internalNodes>
+          <leafValues>
+            6.9990468025207520e-01 4.5332419872283936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -1.9727900624275208e-02</internalNodes>
+          <leafValues>
+            2.6536649465560913e-01 5.4128098487854004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 6.6972579807043076e-03</internalNodes>
+          <leafValues>
+            4.4805660843849182e-01 7.1386522054672241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 7.4457528535276651e-04</internalNodes>
+          <leafValues>
+            4.2313501238822937e-01 5.4713201522827148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 1.1790640419349074e-03</internalNodes>
+          <leafValues>
+            5.3417021036148071e-01 3.1304550170898438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 3.4980610013008118e-02</internalNodes>
+          <leafValues>
+            5.1186597347259521e-01 3.4305301308631897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 5.6859792675822973e-04</internalNodes>
+          <leafValues>
+            3.5321870446205139e-01 5.4686397314071655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -1.1340649798512459e-02</internalNodes>
+          <leafValues>
+            2.8423538804054260e-01 5.3487008810043335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -6.6228108480572701e-03</internalNodes>
+          <leafValues>
+            6.8836402893066406e-01 4.4926649332046509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -8.0160330981016159e-03</internalNodes>
+          <leafValues>
+            1.7098939418792725e-01 5.2243089675903320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 1.4206819469109178e-03</internalNodes>
+          <leafValues>
+            5.2908462285995483e-01 2.9933831095695496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 -2.7801711112260818e-03</internalNodes>
+          <leafValues>
+            6.4988541603088379e-01 4.4604998826980591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 -1.4747589593753219e-03</internalNodes>
+          <leafValues>
+            3.2604381442070007e-01 5.3881132602691650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 -2.3830339312553406e-02</internalNodes>
+          <leafValues>
+            7.5289410352706909e-01 4.8012199997901917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 6.9369790144264698e-03</internalNodes>
+          <leafValues>
+            5.3351658582687378e-01 3.2614278793334961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 8.2806255668401718e-03</internalNodes>
+          <leafValues>
+            4.5803940296173096e-01 5.7378298044204712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 -1.0439500212669373e-02</internalNodes>
+          <leafValues>
+            2.5923201441764832e-01 5.2338278293609619e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>80</maxWeakCount>
+      <stageThreshold>3.9107288360595703e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 384 7.2006587870419025e-03</internalNodes>
+          <leafValues>
+            3.2588860392570496e-01 6.8498080968856812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -2.8593589086085558e-03</internalNodes>
+          <leafValues>
+            5.8388811349868774e-01 2.5378298759460449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 6.8580528022721410e-04</internalNodes>
+          <leafValues>
+            5.7080817222595215e-01 2.8124240040779114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 7.9580191522836685e-03</internalNodes>
+          <leafValues>
+            2.5010511279106140e-01 5.5442607402801514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -1.2124150525778532e-03</internalNodes>
+          <leafValues>
+            2.3853680491447449e-01 5.4333502054214478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 7.9426132142543793e-03</internalNodes>
+          <leafValues>
+            3.9550709724426270e-01 6.2207579612731934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 2.4630590341985226e-03</internalNodes>
+          <leafValues>
+            5.6397080421447754e-01 2.9923579096794128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -6.0396599583327770e-03</internalNodes>
+          <leafValues>
+            2.1865129470825195e-01 5.4116767644882202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 -1.2988339876756072e-03</internalNodes>
+          <leafValues>
+            2.3507060110569000e-01 5.3645849227905273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 2.2299369447864592e-04</internalNodes>
+          <leafValues>
+            3.8041129708290100e-01 5.7296061515808105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 1.4654280385002494e-03</internalNodes>
+          <leafValues>
+            2.5101679563522339e-01 5.2582687139511108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -8.1210042117163539e-04</internalNodes>
+          <leafValues>
+            5.9928238391876221e-01 3.8511589169502258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -1.3836020370945334e-03</internalNodes>
+          <leafValues>
+            5.6813961267471313e-01 3.6365869641304016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -2.7936449274420738e-02</internalNodes>
+          <leafValues>
+            1.4913170039653778e-01 5.3775602579116821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -4.6919551095925272e-04</internalNodes>
+          <leafValues>
+            3.6924299597740173e-01 5.5724847316741943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 -4.9829659983515739e-03</internalNodes>
+          <leafValues>
+            6.7585092782974243e-01 4.5325040817260742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 1.8815309740602970e-03</internalNodes>
+          <leafValues>
+            5.3680229187011719e-01 2.9325398802757263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 -1.9067550078034401e-02</internalNodes>
+          <leafValues>
+            1.6493770480155945e-01 5.3300672769546509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -4.6906559728085995e-03</internalNodes>
+          <leafValues>
+            1.9639259576797485e-01 5.1193618774414062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 5.9777139686048031e-03</internalNodes>
+          <leafValues>
+            4.6711719036102295e-01 7.0083981752395630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -3.3303130418062210e-02</internalNodes>
+          <leafValues>
+            1.1554169654846191e-01 5.1041620969772339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 9.0744107961654663e-02</internalNodes>
+          <leafValues>
+            5.1496601104736328e-01 1.3061730563640594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 9.3555898638442159e-04</internalNodes>
+          <leafValues>
+            3.6054810881614685e-01 5.4398590326309204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 1.4901650138199329e-02</internalNodes>
+          <leafValues>
+            4.8862120509147644e-01 7.6875698566436768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 6.1594118596985936e-04</internalNodes>
+          <leafValues>
+            5.3568130731582642e-01 3.2409390807151794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 -5.0670988857746124e-02</internalNodes>
+          <leafValues>
+            1.8486219644546509e-01 5.2304041385650635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 6.8665749859064817e-04</internalNodes>
+          <leafValues>
+            3.8405799865722656e-01 5.5179458856582642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 8.3712432533502579e-03</internalNodes>
+          <leafValues>
+            4.2885640263557434e-01 6.1317539215087891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -1.2953069526702166e-03</internalNodes>
+          <leafValues>
+            2.9136741161346436e-01 5.2807378768920898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 -4.1941680014133453e-02</internalNodes>
+          <leafValues>
+            7.5547999143600464e-01 4.8560309410095215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -2.3529380559921265e-02</internalNodes>
+          <leafValues>
+            2.8382799029350281e-01 5.2560812234878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 4.0857449173927307e-02</internalNodes>
+          <leafValues>
+            4.8709350824356079e-01 6.2772971391677856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -2.5406869128346443e-02</internalNodes>
+          <leafValues>
+            7.0997077226638794e-01 4.5750290155410767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 -4.1415440500713885e-04</internalNodes>
+          <leafValues>
+            4.0308868885040283e-01 5.4694122076034546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 2.1824119612574577e-02</internalNodes>
+          <leafValues>
+            4.5020240545272827e-01 6.7687010765075684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 1.4114039950072765e-02</internalNodes>
+          <leafValues>
+            5.4428607225418091e-01 3.7917000055313110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 6.7214590671937913e-05</internalNodes>
+          <leafValues>
+            4.2004638910293579e-01 5.8734762668609619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -7.9417638480663300e-03</internalNodes>
+          <leafValues>
+            3.7925618886947632e-01 5.5852657556533813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -7.2144409641623497e-03</internalNodes>
+          <leafValues>
+            7.2531038522720337e-01 4.6035489439964294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 2.5817339774221182e-03</internalNodes>
+          <leafValues>
+            4.6933019161224365e-01 5.9002387523651123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 1.3409319519996643e-01</internalNodes>
+          <leafValues>
+            5.1492130756378174e-01 1.8088449537754059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 2.2962710354477167e-03</internalNodes>
+          <leafValues>
+            5.3997439146041870e-01 3.7178671360015869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 -2.1575849968940020e-03</internalNodes>
+          <leafValues>
+            2.4084959924221039e-01 5.1488637924194336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -4.9196188338100910e-03</internalNodes>
+          <leafValues>
+            6.5735882520675659e-01 4.7387400269508362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 1.6267469618469477e-03</internalNodes>
+          <leafValues>
+            4.1928219795227051e-01 6.3031142950057983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 3.3413388882763684e-04</internalNodes>
+          <leafValues>
+            5.5402982234954834e-01 3.7021011114120483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -2.6698080822825432e-02</internalNodes>
+          <leafValues>
+            1.7109179496765137e-01 5.1014107465744019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 -3.0561879277229309e-02</internalNodes>
+          <leafValues>
+            1.9042180478572845e-01 5.1687937974929810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 2.8511548880487680e-03</internalNodes>
+          <leafValues>
+            4.4475069642066956e-01 6.3138538599014282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -3.6211479455232620e-02</internalNodes>
+          <leafValues>
+            2.4907270073890686e-01 5.3773492574691772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 -2.4115189444273710e-03</internalNodes>
+          <leafValues>
+            5.3812432289123535e-01 3.6642369627952576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 -7.7253201743587852e-04</internalNodes>
+          <leafValues>
+            5.5302321910858154e-01 3.5415500402450562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 2.9481729143299162e-04</internalNodes>
+          <leafValues>
+            4.1326990723609924e-01 5.6672430038452148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -6.2334560789167881e-03</internalNodes>
+          <leafValues>
+            9.8787233233451843e-02 5.1986688375473022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 -2.6274729520082474e-02</internalNodes>
+          <leafValues>
+            9.1127492487430573e-02 5.0281071662902832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 5.3212260827422142e-03</internalNodes>
+          <leafValues>
+            4.7266489267349243e-01 6.2227207422256470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 -4.1129058226943016e-03</internalNodes>
+          <leafValues>
+            2.1574570238590240e-01 5.1378047466278076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 3.2457809429615736e-03</internalNodes>
+          <leafValues>
+            5.4107707738876343e-01 3.7217769026756287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -1.6359709203243256e-02</internalNodes>
+          <leafValues>
+            7.7878749370574951e-01 4.6852919459342957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 3.2166109303943813e-04</internalNodes>
+          <leafValues>
+            5.4789870977401733e-01 4.2403739690780640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 6.4452440710738301e-04</internalNodes>
+          <leafValues>
+            5.3305608034133911e-01 3.5013249516487122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -7.8909732401371002e-03</internalNodes>
+          <leafValues>
+            6.9235211610794067e-01 4.7265690565109253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 4.8336211591959000e-02</internalNodes>
+          <leafValues>
+            5.0559002161026001e-01 7.5749203562736511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -7.5178127735853195e-04</internalNodes>
+          <leafValues>
+            3.7837418913841248e-01 5.5385738611221313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -2.4953910615295172e-03</internalNodes>
+          <leafValues>
+            3.0816510319709778e-01 5.3596121072769165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 -2.2385010961443186e-03</internalNodes>
+          <leafValues>
+            6.6339588165283203e-01 4.6493428945541382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -1.7988430336117744e-03</internalNodes>
+          <leafValues>
+            6.5968447923660278e-01 4.3471878767013550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 8.7860915809869766e-03</internalNodes>
+          <leafValues>
+            5.2318328619003296e-01 2.3155799508094788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 3.6715380847454071e-03</internalNodes>
+          <leafValues>
+            5.2042502164840698e-01 2.9773768782615662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -3.5336449742317200e-02</internalNodes>
+          <leafValues>
+            7.2388780117034912e-01 4.8615050315856934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -6.9189240457490087e-04</internalNodes>
+          <leafValues>
+            3.1050220131874084e-01 5.2298247814178467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 -3.3946109469980001e-03</internalNodes>
+          <leafValues>
+            3.1389680504798889e-01 5.2101737260818481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 9.8569283727556467e-04</internalNodes>
+          <leafValues>
+            4.5365801453590393e-01 6.5850979089736938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -5.0163101404905319e-02</internalNodes>
+          <leafValues>
+            1.8044540286064148e-01 5.1989167928695679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 -2.2367259953171015e-03</internalNodes>
+          <leafValues>
+            7.2557020187377930e-01 4.6513590216636658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 7.4326287722215056e-04</internalNodes>
+          <leafValues>
+            4.4129210710525513e-01 5.8985459804534912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -9.3485182151198387e-04</internalNodes>
+          <leafValues>
+            3.5000529885292053e-01 5.3660178184509277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 1.7497939988970757e-02</internalNodes>
+          <leafValues>
+            4.9121949076652527e-01 8.3152848482131958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -1.5200000489130616e-03</internalNodes>
+          <leafValues>
+            3.5702759027481079e-01 5.3705602884292603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 7.8003940870985389e-04</internalNodes>
+          <leafValues>
+            4.3537721037864685e-01 5.9673351049423218e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>103</maxWeakCount>
+      <stageThreshold>5.0610481262207031e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 464 -9.9945552647113800e-03</internalNodes>
+          <leafValues>
+            6.1625832319259644e-01 3.0545330047607422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.1085229925811291e-03</internalNodes>
+          <leafValues>
+            5.8182948827743530e-01 3.1555780768394470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 1.0364380432292819e-03</internalNodes>
+          <leafValues>
+            2.5520521402359009e-01 5.6929117441177368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 6.8211311008781195e-04</internalNodes>
+          <leafValues>
+            3.6850899457931519e-01 5.9349310398101807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -6.8057340104132891e-04</internalNodes>
+          <leafValues>
+            2.3323920369148254e-01 5.4747921228408813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 2.6068789884448051e-04</internalNodes>
+          <leafValues>
+            3.2574570178985596e-01 5.6675457954406738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 5.1607372006401420e-04</internalNodes>
+          <leafValues>
+            3.7447169423103333e-01 5.8454728126525879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 8.5007521556690335e-04</internalNodes>
+          <leafValues>
+            3.4203711152076721e-01 5.5228072404861450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 -1.8607829697430134e-03</internalNodes>
+          <leafValues>
+            2.8044199943542480e-01 5.3754240274429321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -1.5033970121294260e-03</internalNodes>
+          <leafValues>
+            2.5790509581565857e-01 5.4989522695541382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 2.3478909861296415e-03</internalNodes>
+          <leafValues>
+            4.1751560568809509e-01 6.3137108087539673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -2.8880240279249847e-04</internalNodes>
+          <leafValues>
+            5.8651697635650635e-01 4.0526661276817322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 8.9405477046966553e-03</internalNodes>
+          <leafValues>
+            5.2111411094665527e-01 2.3186540603637695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -1.9327739253640175e-02</internalNodes>
+          <leafValues>
+            2.7534329891204834e-01 5.2415257692337036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -2.0202060113660991e-04</internalNodes>
+          <leafValues>
+            5.7229787111282349e-01 3.6771959066390991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 2.1179069299250841e-03</internalNodes>
+          <leafValues>
+            4.4661080837249756e-01 5.5424308776855469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 -1.7743760254234076e-03</internalNodes>
+          <leafValues>
+            2.8132531046867371e-01 5.3009599447250366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 4.2234458960592747e-03</internalNodes>
+          <leafValues>
+            4.3997099995613098e-01 5.7954281568527222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -1.4375220052897930e-02</internalNodes>
+          <leafValues>
+            2.9811179637908936e-01 5.2920591831207275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -1.5349180437624454e-02</internalNodes>
+          <leafValues>
+            7.7052152156829834e-01 4.7481718659400940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 1.5152279956964776e-05</internalNodes>
+          <leafValues>
+            3.7188440561294556e-01 5.5768972635269165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 -9.1293919831514359e-03</internalNodes>
+          <leafValues>
+            3.6151960492134094e-01 5.2867668867111206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 2.2512159775942564e-03</internalNodes>
+          <leafValues>
+            5.3647047281265259e-01 3.4862980246543884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -4.9696918576955795e-03</internalNodes>
+          <leafValues>
+            6.9276517629623413e-01 4.6768361330032349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -1.2829010374844074e-02</internalNodes>
+          <leafValues>
+            7.7121537923812866e-01 4.6607351303100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -9.3660065904259682e-03</internalNodes>
+          <leafValues>
+            3.3749839663505554e-01 5.3512877225875854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 3.2452319283038378e-03</internalNodes>
+          <leafValues>
+            5.3251898288726807e-01 3.2896101474761963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -1.1723560281097889e-02</internalNodes>
+          <leafValues>
+            6.8376529216766357e-01 4.7543001174926758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 2.9257940695970319e-05</internalNodes>
+          <leafValues>
+            3.5720878839492798e-01 5.3605020046234131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -2.2244219508138485e-05</internalNodes>
+          <leafValues>
+            5.5414271354675293e-01 3.5520640015602112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 5.0881509669125080e-03</internalNodes>
+          <leafValues>
+            5.0708442926406860e-01 1.2564620375633240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 2.7429679408669472e-02</internalNodes>
+          <leafValues>
+            5.2695602178573608e-01 1.6258180141448975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -6.4142867922782898e-03</internalNodes>
+          <leafValues>
+            7.1455889940261841e-01 4.5841971039772034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 3.3479959238320589e-03</internalNodes>
+          <leafValues>
+            5.3986120223999023e-01 3.4946969151496887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 -8.2635492086410522e-02</internalNodes>
+          <leafValues>
+            2.4391929805278778e-01 5.1602262258529663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 1.0261740535497665e-03</internalNodes>
+          <leafValues>
+            3.8868919014930725e-01 5.7679080963134766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -1.6307090409100056e-03</internalNodes>
+          <leafValues>
+            3.3894580602645874e-01 5.3477007150650024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 2.4546680506318808e-03</internalNodes>
+          <leafValues>
+            4.6014139056205750e-01 6.3872468471527100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -9.9476519972085953e-04</internalNodes>
+          <leafValues>
+            5.7698792219161987e-01 4.1203960776329041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 1.5409190207719803e-02</internalNodes>
+          <leafValues>
+            4.8787090182304382e-01 7.0898222923278809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 1.1784400558099151e-03</internalNodes>
+          <leafValues>
+            5.2635532617568970e-01 2.8952449560165405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -2.7701919898390770e-02</internalNodes>
+          <leafValues>
+            1.4988289773464203e-01 5.2196067571640015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 -2.9505399987101555e-02</internalNodes>
+          <leafValues>
+            2.4893319234251976e-02 4.9998161196708679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 4.5159430010244250e-04</internalNodes>
+          <leafValues>
+            5.4646229743957520e-01 4.0296629071235657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 7.1772639639675617e-03</internalNodes>
+          <leafValues>
+            4.2710569500923157e-01 5.8662968873977661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 -7.4182048439979553e-02</internalNodes>
+          <leafValues>
+            6.8741792440414429e-01 4.9190279841423035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -1.7254160717129707e-02</internalNodes>
+          <leafValues>
+            3.3706760406494141e-01 5.3487390279769897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 1.4851559884846210e-02</internalNodes>
+          <leafValues>
+            4.6267929673194885e-01 6.1299049854278564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 1.0002000257372856e-02</internalNodes>
+          <leafValues>
+            5.3461229801177979e-01 3.4234538674354553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 2.0138120744377375e-03</internalNodes>
+          <leafValues>
+            4.6438300609588623e-01 5.8243042230606079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 1.5135470312088728e-03</internalNodes>
+          <leafValues>
+            5.1963961124420166e-01 2.8561499714851379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 3.1381431035697460e-03</internalNodes>
+          <leafValues>
+            4.8381629586219788e-01 5.9585297107696533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 -5.1450440660119057e-03</internalNodes>
+          <leafValues>
+            8.9203029870986938e-01 4.7414121031761169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 -4.4736708514392376e-03</internalNodes>
+          <leafValues>
+            2.0339429378509521e-01 5.3372788429260254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 1.9628470763564110e-03</internalNodes>
+          <leafValues>
+            4.5716339349746704e-01 6.7258632183074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 5.4260450415313244e-03</internalNodes>
+          <leafValues>
+            5.2711081504821777e-01 2.8456708788871765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 4.9611460417509079e-04</internalNodes>
+          <leafValues>
+            4.1383129358291626e-01 5.7185977697372437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 9.3728788197040558e-03</internalNodes>
+          <leafValues>
+            5.2251511812210083e-01 2.8048470616340637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 6.0500897234305739e-04</internalNodes>
+          <leafValues>
+            5.2367687225341797e-01 3.3145239949226379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 5.6792551185935736e-04</internalNodes>
+          <leafValues>
+            4.5310598611831665e-01 6.2769711017608643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 2.4644339457154274e-02</internalNodes>
+          <leafValues>
+            5.1308518648147583e-01 2.0171439647674561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -1.0290450416505337e-02</internalNodes>
+          <leafValues>
+            7.7865952253341675e-01 4.8766410350799561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 2.0629419013857841e-03</internalNodes>
+          <leafValues>
+            4.2885988950729370e-01 5.8812642097473145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -5.0519481301307678e-03</internalNodes>
+          <leafValues>
+            3.5239779949188232e-01 5.2860087156295776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -5.7692620903253555e-03</internalNodes>
+          <leafValues>
+            6.8410861492156982e-01 4.5880940556526184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 -4.5789941214025021e-04</internalNodes>
+          <leafValues>
+            3.5655200481414795e-01 5.4859781265258789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -7.5918837683275342e-04</internalNodes>
+          <leafValues>
+            3.3687931299209595e-01 5.2541971206665039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 -1.7737259622663260e-03</internalNodes>
+          <leafValues>
+            3.4221610426902771e-01 5.4540151357650757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -8.5610467940568924e-03</internalNodes>
+          <leafValues>
+            6.5336120128631592e-01 4.4858568906784058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 1.7277270089834929e-03</internalNodes>
+          <leafValues>
+            5.3075802326202393e-01 3.9253529906272888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -2.8199609369039536e-02</internalNodes>
+          <leafValues>
+            6.8574589490890503e-01 4.5885840058326721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -1.7781109781935811e-03</internalNodes>
+          <leafValues>
+            4.0378510951995850e-01 5.3698569536209106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 3.3177141449414194e-04</internalNodes>
+          <leafValues>
+            5.3997987508773804e-01 3.7057501077651978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 2.6385399978607893e-03</internalNodes>
+          <leafValues>
+            4.6654370427131653e-01 6.4527308940887451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 -2.1183069329708815e-03</internalNodes>
+          <leafValues>
+            5.9147810935974121e-01 4.0646770596504211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -1.4773289673030376e-02</internalNodes>
+          <leafValues>
+            3.6420381069183350e-01 5.2947628498077393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 -1.6815440729260445e-02</internalNodes>
+          <leafValues>
+            2.6642319560050964e-01 5.1449728012084961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -6.3370140269398689e-03</internalNodes>
+          <leafValues>
+            6.7795312404632568e-01 4.8520979285240173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -4.4560048991115764e-05</internalNodes>
+          <leafValues>
+            5.6139647960662842e-01 4.1530540585517883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 -1.0240620467811823e-03</internalNodes>
+          <leafValues>
+            5.9644782543182373e-01 4.5663040876388550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -2.3161689750850201e-03</internalNodes>
+          <leafValues>
+            2.9761150479316711e-01 5.1881599426269531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 5.3217571973800659e-01</internalNodes>
+          <leafValues>
+            5.1878392696380615e-01 2.2026319801807404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 -1.6643050312995911e-01</internalNodes>
+          <leafValues>
+            1.8660229444503784e-01 5.0603431463241577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 1.1253529787063599e-01</internalNodes>
+          <leafValues>
+            5.2121251821517944e-01 1.1850229650735855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 9.3046864494681358e-03</internalNodes>
+          <leafValues>
+            4.5899370312690735e-01 6.8261492252349854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -4.6255099587142467e-03</internalNodes>
+          <leafValues>
+            3.0799409747123718e-01 5.2250087261199951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 -1.1116469651460648e-01</internalNodes>
+          <leafValues>
+            2.1010440587997437e-01 5.0808018445968628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -1.0888439603149891e-02</internalNodes>
+          <leafValues>
+            5.7653552293777466e-01 4.7904640436172485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 5.8564301580190659e-03</internalNodes>
+          <leafValues>
+            5.0651001930236816e-01 1.5635989606380463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 5.4854389280080795e-02</internalNodes>
+          <leafValues>
+            4.9669149518013000e-01 7.2305107116699219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -1.1197339743375778e-02</internalNodes>
+          <leafValues>
+            2.1949790418148041e-01 5.0987982749938965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 4.4069071300327778e-03</internalNodes>
+          <leafValues>
+            4.7784018516540527e-01 6.7709028720855713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -6.3665293157100677e-02</internalNodes>
+          <leafValues>
+            1.9363629817962646e-01 5.0810241699218750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 -9.8081491887569427e-03</internalNodes>
+          <leafValues>
+            5.9990632534027100e-01 4.8103410005569458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 -2.1717099007219076e-03</internalNodes>
+          <leafValues>
+            3.3383339643478394e-01 5.2354729175567627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -1.3315520249307156e-02</internalNodes>
+          <leafValues>
+            6.6170698404312134e-01 4.9192130565643311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 2.5442079640924931e-03</internalNodes>
+          <leafValues>
+            4.4887441396713257e-01 6.0821849107742310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 1.2037839740514755e-02</internalNodes>
+          <leafValues>
+            5.4093921184539795e-01 3.2924321293830872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 -2.0701050758361816e-02</internalNodes>
+          <leafValues>
+            6.8191200494766235e-01 4.5949959754943848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 2.7608279138803482e-02</internalNodes>
+          <leafValues>
+            4.6307921409606934e-01 5.7672828435897827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 1.2370620388537645e-03</internalNodes>
+          <leafValues>
+            5.1653790473937988e-01 2.6350161433219910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -3.7669338285923004e-02</internalNodes>
+          <leafValues>
+            2.5363931059837341e-01 5.2789801359176636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -1.8057259730994701e-03</internalNodes>
+          <leafValues>
+            3.9851561188697815e-01 5.5175000429153442e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>111</maxWeakCount>
+      <stageThreshold>5.4620071411132812e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 567 4.4299028813838959e-03</internalNodes>
+          <leafValues>
+            2.8910180926322937e-01 6.3352262973785400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -2.3813319858163595e-03</internalNodes>
+          <leafValues>
+            6.2117892503738403e-01 3.4774878621101379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 2.2915711160749197e-03</internalNodes>
+          <leafValues>
+            2.2544120252132416e-01 5.5821180343627930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 9.9457940086722374e-04</internalNodes>
+          <leafValues>
+            3.7117108702659607e-01 5.9300708770751953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 7.7164667891338468e-04</internalNodes>
+          <leafValues>
+            5.6517201662063599e-01 3.3479958772659302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -1.1386410333216190e-03</internalNodes>
+          <leafValues>
+            3.0691260099411011e-01 5.5086308717727661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 -1.6403039626311511e-04</internalNodes>
+          <leafValues>
+            5.7628279924392700e-01 3.6990478634834290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 2.9793529392918572e-05</internalNodes>
+          <leafValues>
+            2.6442441344261169e-01 5.4379111528396606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 8.5774902254343033e-03</internalNodes>
+          <leafValues>
+            5.0511389970779419e-01 1.7957249283790588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 -2.6032689493149519e-04</internalNodes>
+          <leafValues>
+            5.8269691467285156e-01 4.4468268752098083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 -6.1404630541801453e-03</internalNodes>
+          <leafValues>
+            3.1138521432876587e-01 5.3469717502593994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -2.3086950182914734e-02</internalNodes>
+          <leafValues>
+            3.2779461145401001e-01 5.3311979770660400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -1.4243650250136852e-02</internalNodes>
+          <leafValues>
+            7.3817098140716553e-01 4.5880630612373352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 1.9487129524350166e-02</internalNodes>
+          <leafValues>
+            5.2566307783126831e-01 2.2744719684123993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -9.6681108698248863e-04</internalNodes>
+          <leafValues>
+            5.5112308263778687e-01 3.8150069117546082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 3.1474709976464510e-03</internalNodes>
+          <leafValues>
+            5.4256367683410645e-01 2.5437268614768982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -1.8026070029009134e-04</internalNodes>
+          <leafValues>
+            5.3801918029785156e-01 3.4063041210174561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -6.0266260989010334e-03</internalNodes>
+          <leafValues>
+            3.0358019471168518e-01 5.4205721616744995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 4.4462960795499384e-04</internalNodes>
+          <leafValues>
+            3.9909970760345459e-01 5.6601101160049438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 2.2609760053455830e-03</internalNodes>
+          <leafValues>
+            5.5628067255020142e-01 3.9406880736351013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 5.1133058965206146e-02</internalNodes>
+          <leafValues>
+            4.6096539497375488e-01 7.1185618638992310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -1.7786309123039246e-02</internalNodes>
+          <leafValues>
+            2.3161660134792328e-01 5.3221440315246582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 -4.9679628573358059e-03</internalNodes>
+          <leafValues>
+            2.3307719826698303e-01 5.1220291852951050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 2.0667689386755228e-03</internalNodes>
+          <leafValues>
+            4.6574440598487854e-01 6.4554882049560547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 7.4413768015801907e-03</internalNodes>
+          <leafValues>
+            5.1543921232223511e-01 2.3616339266300201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 -3.6277279723435640e-03</internalNodes>
+          <leafValues>
+            6.2197732925415039e-01 4.4766610860824585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -5.3530759178102016e-03</internalNodes>
+          <leafValues>
+            1.8373550474643707e-01 5.1022082567214966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 1.4530919492244720e-01</internalNodes>
+          <leafValues>
+            5.1459872722625732e-01 1.5359309315681458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 2.4394490756094456e-03</internalNodes>
+          <leafValues>
+            5.3436601161956787e-01 3.6246618628501892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -3.1283390708267689e-03</internalNodes>
+          <leafValues>
+            6.2150079011917114e-01 4.8455920815467834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 1.7940260004252195e-03</internalNodes>
+          <leafValues>
+            4.2992618680000305e-01 5.8241981267929077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 3.6253821104764938e-02</internalNodes>
+          <leafValues>
+            5.2603340148925781e-01 1.4394679665565491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 -5.1746722310781479e-03</internalNodes>
+          <leafValues>
+            3.5065388679504395e-01 5.2870452404022217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 6.5383297624066472e-04</internalNodes>
+          <leafValues>
+            4.8096409440040588e-01 6.1220401525497437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -2.6480229571461678e-02</internalNodes>
+          <leafValues>
+            1.1393620073795319e-01 5.0455862283706665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 -3.0440660193562508e-03</internalNodes>
+          <leafValues>
+            6.3520950078964233e-01 4.7947341203689575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 3.6993520334362984e-03</internalNodes>
+          <leafValues>
+            5.1311182975769043e-01 2.4985109269618988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -3.6762931267730892e-04</internalNodes>
+          <leafValues>
+            5.4213947057723999e-01 3.7095320224761963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -4.1382260620594025e-02</internalNodes>
+          <leafValues>
+            1.8949599564075470e-01 5.0816917419433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -1.0532729793339968e-03</internalNodes>
+          <leafValues>
+            6.4543670415878296e-01 4.7836089134216309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 -2.1648600231856108e-03</internalNodes>
+          <leafValues>
+            6.2150311470031738e-01 4.4998261332511902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 -5.6747748749330640e-04</internalNodes>
+          <leafValues>
+            3.7126109004020691e-01 5.4193347692489624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.7375840246677399e-01</internalNodes>
+          <leafValues>
+            5.0236439704895020e-01 1.2157420068979263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -2.9049699660390615e-03</internalNodes>
+          <leafValues>
+            3.2402679324150085e-01 5.3818839788436890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 1.2299539521336555e-03</internalNodes>
+          <leafValues>
+            4.1655078530311584e-01 5.7034862041473389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -5.4329237900674343e-04</internalNodes>
+          <leafValues>
+            3.8540428876876831e-01 5.5475491285324097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -8.3297258242964745e-03</internalNodes>
+          <leafValues>
+            2.2044940292835236e-01 5.0970828533172607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 -1.0417630255687982e-04</internalNodes>
+          <leafValues>
+            5.6070661544799805e-01 4.3030360341072083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 3.1204700469970703e-02</internalNodes>
+          <leafValues>
+            4.6216571331024170e-01 6.9820040464401245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 7.8943502157926559e-03</internalNodes>
+          <leafValues>
+            5.2695941925048828e-01 2.2690680623054504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -4.3645310215651989e-03</internalNodes>
+          <leafValues>
+            6.3592231273651123e-01 4.5379561185836792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 7.6793059706687927e-03</internalNodes>
+          <leafValues>
+            5.2747678756713867e-01 2.7404838800430298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 -2.5431139394640923e-02</internalNodes>
+          <leafValues>
+            2.0385199785232544e-01 5.0717329978942871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 8.2000601105391979e-04</internalNodes>
+          <leafValues>
+            4.5874550938606262e-01 6.1198681592941284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 2.9284600168466568e-03</internalNodes>
+          <leafValues>
+            5.0712740421295166e-01 2.0282049477100372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 4.5256470912136137e-05</internalNodes>
+          <leafValues>
+            4.8121041059494019e-01 5.4308217763900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 1.3158309739083052e-03</internalNodes>
+          <leafValues>
+            4.6258139610290527e-01 6.7793232202529907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 1.5870389761403203e-03</internalNodes>
+          <leafValues>
+            5.3862917423248291e-01 3.4314650297164917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -2.1539660170674324e-02</internalNodes>
+          <leafValues>
+            2.5942500680685043e-02 5.0032228231430054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 1.4334480278193951e-02</internalNodes>
+          <leafValues>
+            5.2028447389602661e-01 1.5906329452991486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 -8.3881383761763573e-03</internalNodes>
+          <leafValues>
+            7.2824811935424805e-01 4.6480441093444824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 9.1906841844320297e-03</internalNodes>
+          <leafValues>
+            5.5623567104339600e-01 3.9231911301612854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 -5.8453059755265713e-03</internalNodes>
+          <leafValues>
+            6.8033927679061890e-01 4.6291279792785645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 -5.4707799106836319e-02</internalNodes>
+          <leafValues>
+            2.5616711378097534e-01 5.2061259746551514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 9.1142775490880013e-03</internalNodes>
+          <leafValues>
+            5.1896202564239502e-01 3.0538770556449890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -1.5575000084936619e-02</internalNodes>
+          <leafValues>
+            1.2950749695301056e-01 5.1690948009490967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 -1.2050600344082341e-04</internalNodes>
+          <leafValues>
+            5.7350981235504150e-01 4.2308250069618225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 1.2273970060050488e-03</internalNodes>
+          <leafValues>
+            5.2898782491683960e-01 4.0797919034957886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 -1.2186600361019373e-03</internalNodes>
+          <leafValues>
+            6.5756398439407349e-01 4.5744091272354126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -3.3256649039685726e-03</internalNodes>
+          <leafValues>
+            3.6280471086502075e-01 5.1950198411941528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -1.3288309797644615e-02</internalNodes>
+          <leafValues>
+            1.2842659652233124e-01 5.0434887409210205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 -3.3839771058410406e-03</internalNodes>
+          <leafValues>
+            6.2922400236129761e-01 4.7575059533119202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -2.1954220533370972e-01</internalNodes>
+          <leafValues>
+            1.4877319335937500e-01 5.0650137662887573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 4.9111708067357540e-03</internalNodes>
+          <leafValues>
+            4.2561021447181702e-01 5.6658387184143066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 -1.8744950648397207e-04</internalNodes>
+          <leafValues>
+            4.0041440725326538e-01 5.5868571996688843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -5.2178641781210899e-03</internalNodes>
+          <leafValues>
+            6.0091161727905273e-01 4.8127061128616333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -1.1111519997939467e-03</internalNodes>
+          <leafValues>
+            3.5149338841438293e-01 5.2870899438858032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 4.4036400504410267e-03</internalNodes>
+          <leafValues>
+            4.6422758698463440e-01 5.9240859746932983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 1.2299499660730362e-01</internalNodes>
+          <leafValues>
+            5.0255292654037476e-01 6.9152481853961945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -1.2313510291278362e-02</internalNodes>
+          <leafValues>
+            5.8845919370651245e-01 4.9340128898620605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 4.1471039876341820e-03</internalNodes>
+          <leafValues>
+            4.3722391128540039e-01 5.8934777975082397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 -3.5502649843692780e-03</internalNodes>
+          <leafValues>
+            4.3275511264801025e-01 5.3962701559066772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -1.9224269315600395e-02</internalNodes>
+          <leafValues>
+            1.9131340086460114e-01 5.0683307647705078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 1.4395059552043676e-03</internalNodes>
+          <leafValues>
+            5.3081780672073364e-01 4.2435330152511597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -6.7751999013125896e-03</internalNodes>
+          <leafValues>
+            6.3653957843780518e-01 4.5400860905647278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 7.0119630545377731e-03</internalNodes>
+          <leafValues>
+            5.1898342370986938e-01 3.0261999368667603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 5.4014651104807854e-03</internalNodes>
+          <leafValues>
+            5.1050621271133423e-01 2.5576829910278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 9.0274988906458020e-04</internalNodes>
+          <leafValues>
+            4.6969148516654968e-01 5.8618277311325073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 1.1474450118839741e-02</internalNodes>
+          <leafValues>
+            5.0536459684371948e-01 1.5271779894828796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -6.7023430019617081e-03</internalNodes>
+          <leafValues>
+            6.5089809894561768e-01 4.8906040191650391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -2.0462959073483944e-03</internalNodes>
+          <leafValues>
+            6.2418168783187866e-01 4.5146000385284424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -9.9951568990945816e-03</internalNodes>
+          <leafValues>
+            3.4327811002731323e-01 5.4009538888931274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -3.5700708627700806e-02</internalNodes>
+          <leafValues>
+            1.8780590593814850e-01 5.0740778446197510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 4.5584561303257942e-04</internalNodes>
+          <leafValues>
+            3.8052770495414734e-01 5.4025697708129883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -5.4260600358247757e-02</internalNodes>
+          <leafValues>
+            6.8437147140502930e-01 4.5950970053672791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 6.0600461438298225e-03</internalNodes>
+          <leafValues>
+            5.5029052495956421e-01 4.5005279779434204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 -6.4791832119226456e-03</internalNodes>
+          <leafValues>
+            3.3688580989837646e-01 5.3107571601867676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -1.4939469983801246e-03</internalNodes>
+          <leafValues>
+            6.4876401424407959e-01 4.7561758756637573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 1.4610530342906713e-05</internalNodes>
+          <leafValues>
+            4.0345790982246399e-01 5.4510641098022461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -7.2321938350796700e-03</internalNodes>
+          <leafValues>
+            6.3868737220764160e-01 4.8247399926185608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 -4.0645818226039410e-03</internalNodes>
+          <leafValues>
+            2.9864218831062317e-01 5.1573359966278076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 3.0463080853223801e-02</internalNodes>
+          <leafValues>
+            5.0221997499465942e-01 7.1599560976028442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -8.0544911324977875e-03</internalNodes>
+          <leafValues>
+            6.4924520254135132e-01 4.6192750334739685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 3.9505138993263245e-02</internalNodes>
+          <leafValues>
+            5.1505708694458008e-01 2.4506139755249023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 8.4530208259820938e-03</internalNodes>
+          <leafValues>
+            4.5736691355705261e-01 6.3940370082855225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 -1.1688120430335402e-03</internalNodes>
+          <leafValues>
+            3.8655120134353638e-01 5.4836612939834595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 2.8070670086890459e-03</internalNodes>
+          <leafValues>
+            5.1285791397094727e-01 2.7014800906181335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 4.7365209320560098e-04</internalNodes>
+          <leafValues>
+            4.0515819191932678e-01 5.3874611854553223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 1.1741080321371555e-02</internalNodes>
+          <leafValues>
+            5.2959501743316650e-01 3.7194138765335083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 3.1833238899707794e-03</internalNodes>
+          <leafValues>
+            4.7894069552421570e-01 6.8951261043548584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 7.0241501089185476e-04</internalNodes>
+          <leafValues>
+            5.3844892978668213e-01 3.9180809259414673e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>102</maxWeakCount>
+      <stageThreshold>5.0169731140136719e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 678 1.7059929668903351e-02</internalNodes>
+          <leafValues>
+            3.9485278725624084e-01 7.1425348520278931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 2.1840840578079224e-02</internalNodes>
+          <leafValues>
+            3.3703160285949707e-01 6.0900169610977173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 2.4520049919374287e-04</internalNodes>
+          <leafValues>
+            3.5005760192871094e-01 5.9879022836685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 8.3272606134414673e-03</internalNodes>
+          <leafValues>
+            3.2675281167030334e-01 5.6972408294677734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 5.7148298947140574e-04</internalNodes>
+          <leafValues>
+            3.0445998907089233e-01 5.5316567420959473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 6.7373987985774875e-04</internalNodes>
+          <leafValues>
+            3.6500120162963867e-01 5.6726312637329102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 3.4681590477703139e-05</internalNodes>
+          <leafValues>
+            3.3135411143302917e-01 5.3887271881103516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -5.8563398197293282e-03</internalNodes>
+          <leafValues>
+            2.6979428529739380e-01 5.4987788200378418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 8.5102273151278496e-03</internalNodes>
+          <leafValues>
+            5.2693581581115723e-01 2.7628791332244873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 -6.9817207753658295e-02</internalNodes>
+          <leafValues>
+            2.9096031188964844e-01 5.2592468261718750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -8.6113670840859413e-04</internalNodes>
+          <leafValues>
+            5.8925771713256836e-01 4.0736979246139526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 9.7149249631911516e-04</internalNodes>
+          <leafValues>
+            3.5235640406608582e-01 5.4158622026443481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -1.4727490452060010e-05</internalNodes>
+          <leafValues>
+            5.4230177402496338e-01 3.5031560063362122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 4.8420291393995285e-02</internalNodes>
+          <leafValues>
+            5.1939457654953003e-01 3.4111958742141724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 1.3257140526548028e-03</internalNodes>
+          <leafValues>
+            3.1577691435813904e-01 5.3353762626647949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 1.4922149603080470e-05</internalNodes>
+          <leafValues>
+            4.4512999057769775e-01 5.5365538597106934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -2.7173398993909359e-03</internalNodes>
+          <leafValues>
+            3.0317419767379761e-01 5.2480888366699219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 2.9219500720500946e-03</internalNodes>
+          <leafValues>
+            4.7814530134201050e-01 6.6060417890548706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -1.9804988987743855e-03</internalNodes>
+          <leafValues>
+            3.1863081455230713e-01 5.2876251935958862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -4.0012109093368053e-03</internalNodes>
+          <leafValues>
+            6.4135968685150146e-01 4.7499281167984009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -4.3491991236805916e-03</internalNodes>
+          <leafValues>
+            1.5074980258941650e-01 5.0989967584609985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 1.3490889687091112e-03</internalNodes>
+          <leafValues>
+            4.3161588907241821e-01 5.8811670541763306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 1.8597070127725601e-02</internalNodes>
+          <leafValues>
+            4.7355538606643677e-01 9.0897941589355469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -1.8562379991635680e-03</internalNodes>
+          <leafValues>
+            3.5531890392303467e-01 5.5778372287750244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 2.2940430790185928e-03</internalNodes>
+          <leafValues>
+            4.5000949501991272e-01 6.5808779001235962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 2.9982850537635386e-04</internalNodes>
+          <leafValues>
+            5.6292420625686646e-01 3.9758789539337158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 3.5455459728837013e-03</internalNodes>
+          <leafValues>
+            5.3815472126007080e-01 3.6054858565330505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 9.6104722470045090e-03</internalNodes>
+          <leafValues>
+            5.2559971809387207e-01 1.7967459559440613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -6.2783220782876015e-03</internalNodes>
+          <leafValues>
+            2.2728569805622101e-01 5.1140302419662476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 3.4598479978740215e-03</internalNodes>
+          <leafValues>
+            4.6263080835342407e-01 6.6082191467285156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -1.3112019514665008e-03</internalNodes>
+          <leafValues>
+            6.3175398111343384e-01 4.4368579983711243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 2.6876179035753012e-03</internalNodes>
+          <leafValues>
+            5.4211097955703735e-01 4.0540221333503723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 3.9118169806897640e-03</internalNodes>
+          <leafValues>
+            5.3584778308868408e-01 3.2734549045562744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 -1.4206450432538986e-02</internalNodes>
+          <leafValues>
+            7.7935767173767090e-01 4.9757811427116394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 7.1705528534948826e-04</internalNodes>
+          <leafValues>
+            5.2973198890686035e-01 3.5609039664268494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 1.6635019565001130e-03</internalNodes>
+          <leafValues>
+            4.6780940890312195e-01 5.8164817094802856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 3.3686188980937004e-03</internalNodes>
+          <leafValues>
+            5.2767342329025269e-01 3.4464201331138611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 1.2799530290067196e-02</internalNodes>
+          <leafValues>
+            4.8346799612045288e-01 7.4721592664718628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 3.3901201095432043e-03</internalNodes>
+          <leafValues>
+            4.5118591189384460e-01 6.4017212390899658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 4.7070779837667942e-03</internalNodes>
+          <leafValues>
+            5.3356587886810303e-01 3.5552209615707397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 1.4819339849054813e-03</internalNodes>
+          <leafValues>
+            4.2507070302963257e-01 5.7727241516113281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -6.9995759986341000e-03</internalNodes>
+          <leafValues>
+            3.0033200979232788e-01 5.2929002046585083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 1.5939010307192802e-02</internalNodes>
+          <leafValues>
+            5.0673192739486694e-01 1.6755819320678711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 7.6377349905669689e-03</internalNodes>
+          <leafValues>
+            4.7950699925422668e-01 7.0856010913848877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 6.7334040068089962e-03</internalNodes>
+          <leafValues>
+            5.1331132650375366e-01 2.1624700725078583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 -1.2858809903264046e-02</internalNodes>
+          <leafValues>
+            1.9388419389724731e-01 5.2513718605041504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 -6.2270800117403269e-04</internalNodes>
+          <leafValues>
+            5.6865382194519043e-01 4.1978681087493896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -5.2651681471616030e-04</internalNodes>
+          <leafValues>
+            4.2241689562797546e-01 5.4296958446502686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 1.1075099930167198e-02</internalNodes>
+          <leafValues>
+            5.1137751340866089e-01 2.5145179033279419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 -3.6728251725435257e-02</internalNodes>
+          <leafValues>
+            7.1946620941162109e-01 4.8496189713478088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 -2.8207109426148236e-04</internalNodes>
+          <leafValues>
+            3.8402619957923889e-01 5.3944462537765503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 -2.7489690110087395e-03</internalNodes>
+          <leafValues>
+            5.9370887279510498e-01 4.5691820979118347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 1.0047519579529762e-02</internalNodes>
+          <leafValues>
+            5.1385760307312012e-01 2.8022980690002441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -8.1497840583324432e-03</internalNodes>
+          <leafValues>
+            6.0900372266769409e-01 4.6361210942268372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 -6.8833888508379459e-03</internalNodes>
+          <leafValues>
+            3.4586110711097717e-01 5.2546602487564087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -1.4039360394235700e-05</internalNodes>
+          <leafValues>
+            5.6931042671203613e-01 4.0820831060409546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 1.5498419525101781e-03</internalNodes>
+          <leafValues>
+            4.3505370616912842e-01 5.8065170049667358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -6.7841499112546444e-03</internalNodes>
+          <leafValues>
+            1.4688730239868164e-01 5.1827752590179443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 2.1705629478674382e-04</internalNodes>
+          <leafValues>
+            5.2935242652893066e-01 3.4561741352081299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 3.1198898795992136e-04</internalNodes>
+          <leafValues>
+            4.6524509787559509e-01 5.9424138069152832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 5.4507530294358730e-03</internalNodes>
+          <leafValues>
+            4.6535089612007141e-01 7.0248460769653320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -2.5818689027801156e-04</internalNodes>
+          <leafValues>
+            5.4972952604293823e-01 3.7689670920372009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 -1.7442539334297180e-02</internalNodes>
+          <leafValues>
+            3.9190879464149475e-01 5.4574978351593018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -4.5343529433012009e-02</internalNodes>
+          <leafValues>
+            1.6313570737838745e-01 5.1549088954925537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 1.9190689781680703e-03</internalNodes>
+          <leafValues>
+            5.1458978652954102e-01 2.7918958663940430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -6.0177869163453579e-03</internalNodes>
+          <leafValues>
+            6.5176361799240112e-01 4.7563329339027405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -4.0720738470554352e-03</internalNodes>
+          <leafValues>
+            5.5146527290344238e-01 4.0926858782768250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 3.9855059003457427e-04</internalNodes>
+          <leafValues>
+            3.1652408838272095e-01 5.2855509519577026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -6.5418570302426815e-03</internalNodes>
+          <leafValues>
+            6.8533778190612793e-01 4.6528089046478271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 3.4845089539885521e-03</internalNodes>
+          <leafValues>
+            5.4845881462097168e-01 4.5027598738670349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -1.3696780428290367e-02</internalNodes>
+          <leafValues>
+            6.3957798480987549e-01 4.5725551247596741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -1.7347140237689018e-02</internalNodes>
+          <leafValues>
+            2.7510729432106018e-01 5.1816147565841675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -4.0885428898036480e-03</internalNodes>
+          <leafValues>
+            3.3256360888481140e-01 5.1949840784072876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -9.4687901437282562e-03</internalNodes>
+          <leafValues>
+            5.9422808885574341e-01 4.8518198728561401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 1.7084840219467878e-03</internalNodes>
+          <leafValues>
+            4.1671109199523926e-01 5.5198061466217041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 9.4809094443917274e-03</internalNodes>
+          <leafValues>
+            5.4338949918746948e-01 4.2085149884223938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -4.7389650717377663e-03</internalNodes>
+          <leafValues>
+            6.4071899652481079e-01 4.5606550574302673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 6.5761050209403038e-03</internalNodes>
+          <leafValues>
+            5.2145552635192871e-01 2.2582270205020905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -2.1690549328923225e-03</internalNodes>
+          <leafValues>
+            3.1515279412269592e-01 5.1567047834396362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 1.4660170301795006e-02</internalNodes>
+          <leafValues>
+            4.8708370327949524e-01 6.6899412870407104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 1.7231999663636088e-04</internalNodes>
+          <leafValues>
+            3.5697489976882935e-01 5.2510780096054077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -2.1803760901093483e-02</internalNodes>
+          <leafValues>
+            8.8259208202362061e-01 4.9663299322128296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 -9.4736106693744659e-02</internalNodes>
+          <leafValues>
+            1.4461620151996613e-01 5.0611138343811035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 5.5825551971793175e-03</internalNodes>
+          <leafValues>
+            5.3964787721633911e-01 4.2380660772323608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 1.9517090404406190e-03</internalNodes>
+          <leafValues>
+            4.1704109311103821e-01 5.4977869987487793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 1.2149900197982788e-02</internalNodes>
+          <leafValues>
+            4.6983671188354492e-01 5.6642740964889526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 -7.5169620104134083e-03</internalNodes>
+          <leafValues>
+            6.2677729129791260e-01 4.4631358981132507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -7.1667909622192383e-02</internalNodes>
+          <leafValues>
+            3.0970111489295959e-01 5.2210032939910889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -8.8292419910430908e-02</internalNodes>
+          <leafValues>
+            8.1123888492584229e-02 5.0063651800155640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 3.1063079833984375e-02</internalNodes>
+          <leafValues>
+            5.1555037498474121e-01 1.2822559475898743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 4.6621840447187424e-02</internalNodes>
+          <leafValues>
+            4.6997779607772827e-01 7.3639607429504395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -1.2189489789307117e-02</internalNodes>
+          <leafValues>
+            3.9205300807952881e-01 5.5189967155456543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 1.3016110286116600e-02</internalNodes>
+          <leafValues>
+            5.2606582641601562e-01 3.6851361393928528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 -3.4952899441123009e-03</internalNodes>
+          <leafValues>
+            6.3392949104309082e-01 4.7162809967994690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -4.4015039748046547e-05</internalNodes>
+          <leafValues>
+            5.3330272436141968e-01 3.7761849164962769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -1.0966490209102631e-01</internalNodes>
+          <leafValues>
+            1.7653420567512512e-01 5.1983469724655151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -9.0279558207839727e-04</internalNodes>
+          <leafValues>
+            5.3241598606109619e-01 3.8389080762863159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 7.1126641705632210e-04</internalNodes>
+          <leafValues>
+            4.6479299664497375e-01 5.7552242279052734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -3.1250279862433672e-03</internalNodes>
+          <leafValues>
+            3.2367089390754700e-01 5.1667708158493042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 2.4144679773598909e-03</internalNodes>
+          <leafValues>
+            4.7874391078948975e-01 6.4597177505493164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 4.4391240226104856e-04</internalNodes>
+          <leafValues>
+            4.4093081355094910e-01 6.0102558135986328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -2.2611189342569560e-04</internalNodes>
+          <leafValues>
+            4.0381139516830444e-01 5.4932558536529541e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>135</maxWeakCount>
+      <stageThreshold>6.6669120788574219e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 780 -4.6901289373636246e-02</internalNodes>
+          <leafValues>
+            6.6001719236373901e-01 3.7438011169433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 -1.4568349579349160e-03</internalNodes>
+          <leafValues>
+            5.7839912176132202e-01 3.4377971291542053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 5.5598369799554348e-03</internalNodes>
+          <leafValues>
+            3.6222669482231140e-01 5.9082162380218506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 7.3170487303286791e-04</internalNodes>
+          <leafValues>
+            5.5004191398620605e-01 2.8735581040382385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 1.3318009441718459e-03</internalNodes>
+          <leafValues>
+            2.6731699705123901e-01 5.4310190677642822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 2.4347059661522508e-04</internalNodes>
+          <leafValues>
+            3.8550278544425964e-01 5.7413887977600098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -3.0512469820678234e-03</internalNodes>
+          <leafValues>
+            5.5032098293304443e-01 3.4628450870513916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -6.8657199153676629e-04</internalNodes>
+          <leafValues>
+            3.2912218570709229e-01 5.4295092821121216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 1.4668200165033340e-03</internalNodes>
+          <leafValues>
+            3.5883820056915283e-01 5.3518110513687134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 3.2021870720200241e-04</internalNodes>
+          <leafValues>
+            4.2968419194221497e-01 5.7002341747283936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 7.4122188379988074e-04</internalNodes>
+          <leafValues>
+            5.2821648120880127e-01 3.3668708801269531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 3.8330298848450184e-03</internalNodes>
+          <leafValues>
+            4.5595678687095642e-01 6.2573361396789551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 -1.5456439927220345e-02</internalNodes>
+          <leafValues>
+            2.3501169681549072e-01 5.1294529438018799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 2.6796779129654169e-03</internalNodes>
+          <leafValues>
+            5.3294152021408081e-01 4.1550621390342712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 2.8296569362282753e-03</internalNodes>
+          <leafValues>
+            4.2730879783630371e-01 5.8045381307601929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -3.9444249123334885e-03</internalNodes>
+          <leafValues>
+            2.9126119613647461e-01 5.2026861906051636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 2.7179559692740440e-03</internalNodes>
+          <leafValues>
+            5.3076881170272827e-01 3.5856771469116211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 5.9077627956867218e-03</internalNodes>
+          <leafValues>
+            4.7037750482559204e-01 5.9415858983993530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 -4.2240349575877190e-03</internalNodes>
+          <leafValues>
+            2.1415670216083527e-01 5.0887960195541382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 4.0725888684391975e-03</internalNodes>
+          <leafValues>
+            4.7664138674736023e-01 6.8410611152648926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 1.0149530135095119e-02</internalNodes>
+          <leafValues>
+            5.3607988357543945e-01 3.7484970688819885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 -1.8864999583456665e-04</internalNodes>
+          <leafValues>
+            5.7201302051544189e-01 3.8538050651550293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 -4.8864358104765415e-03</internalNodes>
+          <leafValues>
+            3.6931228637695312e-01 5.3409588336944580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 2.6158479973673820e-02</internalNodes>
+          <leafValues>
+            4.9623748660087585e-01 6.0599899291992188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 4.8560759751126170e-04</internalNodes>
+          <leafValues>
+            4.4389459490776062e-01 6.0124689340591431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 1.1268709786236286e-02</internalNodes>
+          <leafValues>
+            5.2442502975463867e-01 1.8403880298137665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 -2.8114619199186563e-03</internalNodes>
+          <leafValues>
+            6.0602837800979614e-01 4.4098970293998718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -5.6112729944288731e-03</internalNodes>
+          <leafValues>
+            3.8911709189414978e-01 5.5892372131347656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 8.5680093616247177e-03</internalNodes>
+          <leafValues>
+            5.0693458318710327e-01 2.0626190304756165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -3.8172779022715986e-04</internalNodes>
+          <leafValues>
+            5.8822017908096313e-01 4.1926109790802002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 -1.7680290329735726e-04</internalNodes>
+          <leafValues>
+            5.5336058139801025e-01 4.0033689141273499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 6.5112537704408169e-03</internalNodes>
+          <leafValues>
+            3.3101469278335571e-01 5.4441910982131958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 -6.5948683186434209e-05</internalNodes>
+          <leafValues>
+            5.4338318109512329e-01 3.9449059963226318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 6.9939051754772663e-03</internalNodes>
+          <leafValues>
+            5.6003582477569580e-01 4.1927140951156616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -4.6744439750909805e-03</internalNodes>
+          <leafValues>
+            6.6854667663574219e-01 4.6049609780311584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 1.1589850299060345e-02</internalNodes>
+          <leafValues>
+            5.3571212291717529e-01 2.9268300533294678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 1.3007840141654015e-02</internalNodes>
+          <leafValues>
+            4.6798178553581238e-01 7.3074632883071899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.1008579749614000e-03</internalNodes>
+          <leafValues>
+            3.9375010132789612e-01 5.4150652885437012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 6.0472649056464434e-04</internalNodes>
+          <leafValues>
+            4.2423760890960693e-01 5.6040412187576294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -1.4494840055704117e-02</internalNodes>
+          <leafValues>
+            3.6312100291252136e-01 5.2931827306747437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 -5.3056948818266392e-03</internalNodes>
+          <leafValues>
+            6.8604522943496704e-01 4.6218210458755493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -8.1829127157106996e-04</internalNodes>
+          <leafValues>
+            3.9440968632698059e-01 5.4204392433166504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -1.9077520817518234e-02</internalNodes>
+          <leafValues>
+            1.9626219570636749e-01 5.0378918647766113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 3.5549470339901745e-04</internalNodes>
+          <leafValues>
+            4.0862590074539185e-01 5.6139731407165527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 1.9679730758070946e-03</internalNodes>
+          <leafValues>
+            4.4891211390495300e-01 5.9261232614517212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 6.9189141504466534e-03</internalNodes>
+          <leafValues>
+            5.3359258174896240e-01 3.7283858656883240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 2.9872779268771410e-03</internalNodes>
+          <leafValues>
+            5.1113212108612061e-01 2.9756438732147217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -6.2264618463814259e-03</internalNodes>
+          <leafValues>
+            5.5414897203445435e-01 4.8245379328727722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 1.3353300280869007e-02</internalNodes>
+          <leafValues>
+            4.5864239335060120e-01 6.4147979021072388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 3.3505238592624664e-02</internalNodes>
+          <leafValues>
+            5.3924250602722168e-01 3.4299948811531067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -2.5294460356235504e-03</internalNodes>
+          <leafValues>
+            1.7037139832973480e-01 5.0133150815963745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -1.2801629491150379e-03</internalNodes>
+          <leafValues>
+            5.3054618835449219e-01 4.6974050998687744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 7.0687388069927692e-03</internalNodes>
+          <leafValues>
+            4.6155458688735962e-01 6.4365047216415405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 9.6880499040707946e-04</internalNodes>
+          <leafValues>
+            4.8335990309715271e-01 6.0438942909240723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 3.9647659286856651e-03</internalNodes>
+          <leafValues>
+            5.1876372098922729e-01 3.2318168878555298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -2.2057730704545975e-02</internalNodes>
+          <leafValues>
+            4.0792569518089294e-01 5.2009809017181396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -6.6906312713399529e-04</internalNodes>
+          <leafValues>
+            5.3316092491149902e-01 3.8156008720397949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -6.7009328631684184e-04</internalNodes>
+          <leafValues>
+            5.6554222106933594e-01 4.6889019012451172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 7.4284552829340100e-04</internalNodes>
+          <leafValues>
+            4.5343810319900513e-01 6.2874001264572144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 2.2227810695767403e-03</internalNodes>
+          <leafValues>
+            5.3506332635879517e-01 3.3036559820175171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 -5.4130521602928638e-03</internalNodes>
+          <leafValues>
+            1.1136870086193085e-01 5.0054347515106201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -1.4520040167553816e-05</internalNodes>
+          <leafValues>
+            5.6287378072738647e-01 4.3251338601112366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 2.3369169502984732e-04</internalNodes>
+          <leafValues>
+            4.1658350825309753e-01 5.4477912187576294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 4.2894547805190086e-03</internalNodes>
+          <leafValues>
+            4.8603910207748413e-01 6.7786490917205811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 5.9103150852024555e-03</internalNodes>
+          <leafValues>
+            5.2623051404953003e-01 3.6121138930320740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 1.2900539673864841e-02</internalNodes>
+          <leafValues>
+            5.3193771839141846e-01 3.2502880692481995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 4.6982979401946068e-03</internalNodes>
+          <leafValues>
+            4.6182450652122498e-01 6.6659259796142578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 1.0439859703183174e-02</internalNodes>
+          <leafValues>
+            5.5056709051132202e-01 3.8836041092872620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 3.0443191062659025e-03</internalNodes>
+          <leafValues>
+            4.6978530287742615e-01 7.3018449544906616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -6.1593751888722181e-04</internalNodes>
+          <leafValues>
+            3.8308390974998474e-01 5.4649841785430908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 -3.4247159492224455e-03</internalNodes>
+          <leafValues>
+            2.5663000345230103e-01 5.0895309448242188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 -9.3538565561175346e-03</internalNodes>
+          <leafValues>
+            6.4699661731719971e-01 4.9407958984375000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 5.2338998764753342e-02</internalNodes>
+          <leafValues>
+            4.7459828853607178e-01 7.8787708282470703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 3.5765620414167643e-03</internalNodes>
+          <leafValues>
+            5.3066647052764893e-01 2.7484980225563049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 7.1555317845195532e-04</internalNodes>
+          <leafValues>
+            5.4131257534027100e-01 4.0419089794158936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 -1.0516679845750332e-02</internalNodes>
+          <leafValues>
+            6.1585122346878052e-01 4.8152831196784973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 7.7347927726805210e-03</internalNodes>
+          <leafValues>
+            4.6958059072494507e-01 7.0289808511734009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -4.3226778507232666e-03</internalNodes>
+          <leafValues>
+            2.8495660424232483e-01 5.3046840429306030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -2.5534399319440126e-03</internalNodes>
+          <leafValues>
+            7.0569849014282227e-01 4.6888920664787292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 1.0268510231981054e-04</internalNodes>
+          <leafValues>
+            3.9029321074485779e-01 5.5734640359878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 7.1395188570022583e-06</internalNodes>
+          <leafValues>
+            3.6842319369316101e-01 5.2639877796173096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -1.6711989883333445e-03</internalNodes>
+          <leafValues>
+            3.8491758704185486e-01 5.3872710466384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 4.9260449595749378e-03</internalNodes>
+          <leafValues>
+            4.7297719120979309e-01 7.4472510814666748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 4.3908702209591866e-03</internalNodes>
+          <leafValues>
+            4.8091810941696167e-01 5.5919218063354492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -1.7793629318475723e-02</internalNodes>
+          <leafValues>
+            6.9036781787872314e-01 4.6769270300865173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 2.0469669252634048e-03</internalNodes>
+          <leafValues>
+            5.3706902265548706e-01 3.3081620931625366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 2.9891489073634148e-02</internalNodes>
+          <leafValues>
+            5.1398652791976929e-01 3.3090591430664062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 1.5494900289922953e-03</internalNodes>
+          <leafValues>
+            4.6602371335029602e-01 6.0783427953720093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 1.4956969534978271e-03</internalNodes>
+          <leafValues>
+            4.4048359990119934e-01 5.8639198541641235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 9.5885928021743894e-04</internalNodes>
+          <leafValues>
+            5.4359710216522217e-01 4.2085230350494385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 4.9643701640889049e-04</internalNodes>
+          <leafValues>
+            5.3705781698226929e-01 4.0006220340728760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -2.7280810754746199e-03</internalNodes>
+          <leafValues>
+            5.6594127416610718e-01 4.2596429586410522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 2.3026480339467525e-03</internalNodes>
+          <leafValues>
+            5.1616579294204712e-01 3.3508691191673279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 2.5151631236076355e-01</internalNodes>
+          <leafValues>
+            4.8696619272232056e-01 7.1473097801208496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -4.6328022144734859e-03</internalNodes>
+          <leafValues>
+            2.7274489402770996e-01 5.0837898254394531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -4.0434490889310837e-02</internalNodes>
+          <leafValues>
+            6.8514388799667358e-01 5.0217670202255249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 1.4972220014897175e-05</internalNodes>
+          <leafValues>
+            4.2844650149345398e-01 5.5225551128387451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -2.4050309730228037e-04</internalNodes>
+          <leafValues>
+            4.2261189222335815e-01 5.3900748491287231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 2.3657839745283127e-02</internalNodes>
+          <leafValues>
+            4.7446319460868835e-01 7.5043660402297974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -8.1449104472994804e-03</internalNodes>
+          <leafValues>
+            4.2450588941574097e-01 5.5383628606796265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 -3.6992130335420370e-03</internalNodes>
+          <leafValues>
+            5.9523570537567139e-01 4.5297130942344666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -6.7718601785600185e-03</internalNodes>
+          <leafValues>
+            4.1377940773963928e-01 5.4733997583389282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 4.2669530957937241e-03</internalNodes>
+          <leafValues>
+            4.4841149449348450e-01 5.7979941368103027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 1.7791989957913756e-03</internalNodes>
+          <leafValues>
+            5.6248587369918823e-01 4.4324448704719543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 1.6774770338088274e-03</internalNodes>
+          <leafValues>
+            4.6377518773078918e-01 6.3642418384552002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 1.1732629500329494e-03</internalNodes>
+          <leafValues>
+            4.5445030927658081e-01 5.9144157171249390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 8.6998171173036098e-04</internalNodes>
+          <leafValues>
+            5.3347527980804443e-01 3.8859179615974426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 7.6378340600058436e-04</internalNodes>
+          <leafValues>
+            5.3985852003097534e-01 3.7449419498443604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.5684569370932877e-04</internalNodes>
+          <leafValues>
+            4.3178731203079224e-01 5.6146162748336792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -2.1511370316147804e-02</internalNodes>
+          <leafValues>
+            1.7859250307083130e-01 5.1855427026748657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 1.3081369979772717e-04</internalNodes>
+          <leafValues>
+            4.3424990773200989e-01 5.6828498840332031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 2.1992040798068047e-02</internalNodes>
+          <leafValues>
+            5.1617169380187988e-01 2.3793940246105194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 -8.0136500764638186e-04</internalNodes>
+          <leafValues>
+            5.9867632389068604e-01 4.4664269685745239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -8.2736099138855934e-03</internalNodes>
+          <leafValues>
+            4.1082179546356201e-01 5.2510571479797363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 3.6831789184361696e-03</internalNodes>
+          <leafValues>
+            5.1738142967224121e-01 3.3975180983543396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 -7.9525681212544441e-03</internalNodes>
+          <leafValues>
+            6.8889832496643066e-01 4.8459240794181824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 1.5382299898192286e-03</internalNodes>
+          <leafValues>
+            5.1785671710968018e-01 3.4541139006614685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 -1.4043530449271202e-02</internalNodes>
+          <leafValues>
+            1.6784210503101349e-01 5.1886677742004395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 1.4315890148282051e-03</internalNodes>
+          <leafValues>
+            4.3682569265365601e-01 5.6557738780975342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -3.4014228731393814e-02</internalNodes>
+          <leafValues>
+            7.8022962808609009e-01 4.9592170119285583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -1.2027299962937832e-02</internalNodes>
+          <leafValues>
+            1.5851010382175446e-01 5.0322318077087402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 1.3316619396209717e-01</internalNodes>
+          <leafValues>
+            5.1633048057556152e-01 2.7551281452178955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 -1.5221949433907866e-03</internalNodes>
+          <leafValues>
+            3.7283179163932800e-01 5.2145522832870483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -9.3929271679371595e-04</internalNodes>
+          <leafValues>
+            5.8383792638778687e-01 4.5111650228500366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 2.7719739824533463e-02</internalNodes>
+          <leafValues>
+            4.7282868623733521e-01 7.3315447568893433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 3.1030150130391121e-03</internalNodes>
+          <leafValues>
+            5.3022021055221558e-01 4.1015630960464478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 7.7861219644546509e-02</internalNodes>
+          <leafValues>
+            4.9983340501785278e-01 1.2729619443416595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 -1.5854939818382263e-02</internalNodes>
+          <leafValues>
+            5.0833359360694885e-02 5.1656562089920044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -4.9725300632417202e-03</internalNodes>
+          <leafValues>
+            6.7981338500976562e-01 4.6842318773269653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -9.7676506265997887e-04</internalNodes>
+          <leafValues>
+            6.0107719898223877e-01 4.7889319062232971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 -2.4647710379213095e-03</internalNodes>
+          <leafValues>
+            3.3933979272842407e-01 5.2205038070678711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -6.7937700077891350e-03</internalNodes>
+          <leafValues>
+            4.3651369214057922e-01 5.2396631240844727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 3.2608021050691605e-02</internalNodes>
+          <leafValues>
+            5.0527238845825195e-01 2.4252149462699890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 -5.8514421107247472e-04</internalNodes>
+          <leafValues>
+            5.7339739799499512e-01 4.7585740685462952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -2.9632600024342537e-02</internalNodes>
+          <leafValues>
+            3.8922891020774841e-01 5.2635979652404785e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>137</maxWeakCount>
+      <stageThreshold>6.7698921203613281e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 915 4.6550851315259933e-02</internalNodes>
+          <leafValues>
+            3.2769501209259033e-01 6.2405228614807129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 7.9537127166986465e-03</internalNodes>
+          <leafValues>
+            4.2564851045608521e-01 6.9429391622543335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 6.8221561377868056e-04</internalNodes>
+          <leafValues>
+            3.7114870548248291e-01 5.9007328748703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -1.9348249770700932e-04</internalNodes>
+          <leafValues>
+            2.0411339402198792e-01 5.3005450963973999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 -2.6710508973337710e-04</internalNodes>
+          <leafValues>
+            5.4161262512207031e-01 3.1031790375709534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 2.7818060480058193e-03</internalNodes>
+          <leafValues>
+            5.2778327465057373e-01 3.4670698642730713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 -4.6779078547842801e-04</internalNodes>
+          <leafValues>
+            5.3082311153411865e-01 3.2944920659065247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 -3.0335160772665404e-05</internalNodes>
+          <leafValues>
+            5.7738727331161499e-01 3.8520970940589905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 7.8038009814918041e-04</internalNodes>
+          <leafValues>
+            4.3174389004707336e-01 6.1500579118728638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -4.2553851380944252e-03</internalNodes>
+          <leafValues>
+            2.9339039325714111e-01 5.3242927789688110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -2.4735610350035131e-04</internalNodes>
+          <leafValues>
+            5.4688447713851929e-01 3.8430300354957581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 -1.4724259381182492e-04</internalNodes>
+          <leafValues>
+            4.2815428972244263e-01 5.7555872201919556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 1.1864770203828812e-03</internalNodes>
+          <leafValues>
+            3.7473011016845703e-01 5.4714661836624146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 2.3936580400913954e-03</internalNodes>
+          <leafValues>
+            4.5377838611602783e-01 6.1115288734436035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -1.5390539774671197e-03</internalNodes>
+          <leafValues>
+            2.9713419079780579e-01 5.1895380020141602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 -7.1968790143728256e-03</internalNodes>
+          <leafValues>
+            6.6990667581558228e-01 4.7264769673347473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -4.1499789222143590e-04</internalNodes>
+          <leafValues>
+            3.3849540352821350e-01 5.2603179216384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 4.4359830208122730e-03</internalNodes>
+          <leafValues>
+            5.3991222381591797e-01 3.9201408624649048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 2.6606200262904167e-03</internalNodes>
+          <leafValues>
+            4.4825780391693115e-01 6.1196178197860718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -1.5287200221791863e-03</internalNodes>
+          <leafValues>
+            3.7112379074096680e-01 5.3402662277221680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -4.7397250309586525e-03</internalNodes>
+          <leafValues>
+            6.0310882329940796e-01 4.4551450014114380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 -1.4829129911959171e-02</internalNodes>
+          <leafValues>
+            2.8387540578842163e-01 5.3418618440628052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 9.2275557108223438e-04</internalNodes>
+          <leafValues>
+            5.2095472812652588e-01 3.3616539835929871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 8.3529807627201080e-02</internalNodes>
+          <leafValues>
+            5.1199698448181152e-01 8.1164449453353882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -7.5633148662745953e-04</internalNodes>
+          <leafValues>
+            3.3171200752258301e-01 5.1898312568664551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 9.8403859883546829e-03</internalNodes>
+          <leafValues>
+            5.2475982904434204e-01 2.3349590599536896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -1.5953830443322659e-03</internalNodes>
+          <leafValues>
+            5.7500940561294556e-01 4.2956221103668213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 3.4766020689858124e-05</internalNodes>
+          <leafValues>
+            4.3424451351165771e-01 5.5640292167663574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 2.9862910509109497e-02</internalNodes>
+          <leafValues>
+            4.5791471004486084e-01 6.5791881084442139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 1.1325590312480927e-02</internalNodes>
+          <leafValues>
+            5.2743119001388550e-01 3.6738881468772888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -8.7828645482659340e-03</internalNodes>
+          <leafValues>
+            7.1003687381744385e-01 4.6421670913696289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 4.3639959767460823e-03</internalNodes>
+          <leafValues>
+            5.2792161703109741e-01 2.7058771252632141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 4.1804728098213673e-03</internalNodes>
+          <leafValues>
+            5.0725251436233521e-01 2.4490830302238464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -4.5668511302210391e-04</internalNodes>
+          <leafValues>
+            4.2831051349639893e-01 5.5486911535263062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -3.7140368949621916e-03</internalNodes>
+          <leafValues>
+            5.5193877220153809e-01 4.1036531329154968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -2.5304289534687996e-02</internalNodes>
+          <leafValues>
+            6.8670022487640381e-01 4.8698890209197998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 -3.4454080741852522e-04</internalNodes>
+          <leafValues>
+            3.7288740277290344e-01 5.2876931428909302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 -8.3935231668874621e-04</internalNodes>
+          <leafValues>
+            6.0601520538330078e-01 4.6160620450973511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 1.7280049622058868e-02</internalNodes>
+          <leafValues>
+            5.0496357679367065e-01 1.8198239803314209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 -6.3595077954232693e-03</internalNodes>
+          <leafValues>
+            1.6312399506568909e-01 5.2327787876129150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 1.0298109846189618e-03</internalNodes>
+          <leafValues>
+            4.4632780551910400e-01 6.1765491962432861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 1.0117109632119536e-03</internalNodes>
+          <leafValues>
+            5.4733848571777344e-01 4.3006989359855652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 -1.0308800265192986e-02</internalNodes>
+          <leafValues>
+            1.1669850349426270e-01 5.0008672475814819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 5.4682018235325813e-03</internalNodes>
+          <leafValues>
+            4.7692871093750000e-01 6.7192137241363525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -9.1696460731327534e-04</internalNodes>
+          <leafValues>
+            3.4710898995399475e-01 5.1781648397445679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 2.3922820109874010e-03</internalNodes>
+          <leafValues>
+            4.7852361202239990e-01 6.2163108587265015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 -7.5573818758130074e-03</internalNodes>
+          <leafValues>
+            5.8147960901260376e-01 4.4100850820541382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 -7.7024032361805439e-04</internalNodes>
+          <leafValues>
+            3.8780000805854797e-01 5.4657220840454102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 -8.7125990539789200e-03</internalNodes>
+          <leafValues>
+            1.6600510478019714e-01 4.9958360195159912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 -1.0306320153176785e-02</internalNodes>
+          <leafValues>
+            4.0933910012245178e-01 5.2742338180541992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 -2.0940979011356831e-03</internalNodes>
+          <leafValues>
+            6.2061947584152222e-01 4.5722800493240356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 6.8099051713943481e-03</internalNodes>
+          <leafValues>
+            5.5677592754364014e-01 4.1556000709533691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 -1.0746059706434608e-03</internalNodes>
+          <leafValues>
+            5.6389278173446655e-01 4.3530249595642090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 2.1550289820879698e-03</internalNodes>
+          <leafValues>
+            4.8262658715248108e-01 6.7497581243515015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 3.1742319464683533e-02</internalNodes>
+          <leafValues>
+            5.0483798980712891e-01 1.8832489848136902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -7.8382723033428192e-02</internalNodes>
+          <leafValues>
+            2.3695489764213562e-01 5.2601581811904907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 5.7415119372308254e-03</internalNodes>
+          <leafValues>
+            5.0488287210464478e-01 2.7764698863029480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 -2.9014600440859795e-03</internalNodes>
+          <leafValues>
+            6.2386047840118408e-01 4.6933171153068542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 -2.6427931152284145e-03</internalNodes>
+          <leafValues>
+            3.3141419291496277e-01 5.1697772741317749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 -1.0949660092592239e-01</internalNodes>
+          <leafValues>
+            2.3800450563430786e-01 5.1834410429000854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 7.4075913289561868e-05</internalNodes>
+          <leafValues>
+            4.0696358680725098e-01 5.3621500730514526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -5.0593802006915212e-04</internalNodes>
+          <leafValues>
+            5.5067062377929688e-01 4.3745940923690796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 -8.2131777890026569e-04</internalNodes>
+          <leafValues>
+            5.5257099866867065e-01 4.2093759775161743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -6.0276539443293586e-05</internalNodes>
+          <leafValues>
+            5.4554748535156250e-01 4.7482660412788391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 6.8065142259001732e-03</internalNodes>
+          <leafValues>
+            5.1579958200454712e-01 3.4245771169662476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 1.7202789895236492e-03</internalNodes>
+          <leafValues>
+            5.0132077932357788e-01 6.3312637805938721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -1.3016929733566940e-04</internalNodes>
+          <leafValues>
+            5.5397182703018188e-01 4.2268699407577515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 -4.8016388900578022e-03</internalNodes>
+          <leafValues>
+            4.4250950217247009e-01 5.4307800531387329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -2.5399310979992151e-03</internalNodes>
+          <leafValues>
+            7.1457821130752563e-01 4.6976050734519958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -1.4278929447755218e-03</internalNodes>
+          <leafValues>
+            4.0704450011253357e-01 5.3996050357818604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -2.5142550468444824e-02</internalNodes>
+          <leafValues>
+            7.8846907615661621e-01 4.7473520040512085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -3.8899609353393316e-03</internalNodes>
+          <leafValues>
+            4.2961919307708740e-01 5.5771100521087646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 4.3947459198534489e-03</internalNodes>
+          <leafValues>
+            4.6931621432304382e-01 7.0239442586898804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 2.4678420275449753e-02</internalNodes>
+          <leafValues>
+            5.2423220872879028e-01 3.8125100731849670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 3.8047678768634796e-02</internalNodes>
+          <leafValues>
+            5.0117397308349609e-01 1.6878280043601990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 7.9424865543842316e-03</internalNodes>
+          <leafValues>
+            4.8285821080207825e-01 6.3695681095123291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.5110049862414598e-03</internalNodes>
+          <leafValues>
+            5.9064859151840210e-01 4.4876679778099060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 6.4201741479337215e-03</internalNodes>
+          <leafValues>
+            5.2410978078842163e-01 2.9905700683593750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 -2.9802159406244755e-03</internalNodes>
+          <leafValues>
+            3.0414658784866333e-01 5.0784897804260254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 -7.4580078944563866e-04</internalNodes>
+          <leafValues>
+            4.1281390190124512e-01 5.2568262815475464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -1.0470950044691563e-02</internalNodes>
+          <leafValues>
+            5.8083951473236084e-01 4.4942960143089294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 9.3369204550981522e-03</internalNodes>
+          <leafValues>
+            5.2465528249740601e-01 2.6589488983154297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 2.7936900034546852e-02</internalNodes>
+          <leafValues>
+            4.6749550104141235e-01 7.0872569084167480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 7.4277678504586220e-03</internalNodes>
+          <leafValues>
+            5.4094868898391724e-01 3.7585180997848511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -2.3584509268403053e-02</internalNodes>
+          <leafValues>
+            3.7586399912834167e-01 5.2385509014129639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 1.1452640173956752e-03</internalNodes>
+          <leafValues>
+            4.3295788764953613e-01 5.8042472600936890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 -4.3468660442158580e-04</internalNodes>
+          <leafValues>
+            5.2806180715560913e-01 3.8730698823928833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 1.0648540221154690e-02</internalNodes>
+          <leafValues>
+            4.9021130800247192e-01 5.6812518835067749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -3.9418050437234342e-04</internalNodes>
+          <leafValues>
+            5.5708801746368408e-01 4.3182510137557983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -1.3270479394122958e-04</internalNodes>
+          <leafValues>
+            5.6584399938583374e-01 4.3435549736022949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -2.0125510636717081e-03</internalNodes>
+          <leafValues>
+            6.0567390918731689e-01 4.5375239849090576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 2.4854319635778666e-03</internalNodes>
+          <leafValues>
+            5.3904771804809570e-01 4.1380101442337036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 1.8237880431115627e-03</internalNodes>
+          <leafValues>
+            4.3548288941383362e-01 5.7171887159347534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -1.6656659543514252e-02</internalNodes>
+          <leafValues>
+            3.0109131336212158e-01 5.2161228656768799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 8.0349558265879750e-04</internalNodes>
+          <leafValues>
+            5.3001511096954346e-01 3.8183969259262085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 3.4170378930866718e-03</internalNodes>
+          <leafValues>
+            5.3280287981033325e-01 4.2414000630378723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 -3.6222729249857366e-04</internalNodes>
+          <leafValues>
+            5.4917281866073608e-01 4.1869771480560303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -1.1630020290613174e-01</internalNodes>
+          <leafValues>
+            1.4407220482826233e-01 5.2264511585235596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 -1.4695010147988796e-02</internalNodes>
+          <leafValues>
+            7.7477252483367920e-01 4.7157171368598938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 2.1972130052745342e-03</internalNodes>
+          <leafValues>
+            5.3554338216781616e-01 3.3156448602676392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 -4.6965209185145795e-04</internalNodes>
+          <leafValues>
+            5.7672351598739624e-01 4.4581368565559387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 6.5144998952746391e-03</internalNodes>
+          <leafValues>
+            5.2156740427017212e-01 3.6478888988494873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 2.1300060674548149e-02</internalNodes>
+          <leafValues>
+            4.9942049384117126e-01 1.5679509937763214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 3.1881409231573343e-03</internalNodes>
+          <leafValues>
+            4.7422000765800476e-01 6.2872701883316040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 9.0019777417182922e-04</internalNodes>
+          <leafValues>
+            5.3479540348052979e-01 3.9437520503997803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -5.1772277802228928e-03</internalNodes>
+          <leafValues>
+            6.7271918058395386e-01 5.0131380558013916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 -4.3764649890363216e-03</internalNodes>
+          <leafValues>
+            3.1066751480102539e-01 5.1287931203842163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 2.6299960445612669e-03</internalNodes>
+          <leafValues>
+            4.8863101005554199e-01 5.7552158832550049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 -2.0458688959479332e-03</internalNodes>
+          <leafValues>
+            6.0257941484451294e-01 4.5580768585205078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 6.9482706487178802e-02</internalNodes>
+          <leafValues>
+            5.2407479286193848e-01 2.1852590143680573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 2.4048939347267151e-02</internalNodes>
+          <leafValues>
+            5.0118672847747803e-01 2.0906220376491547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 3.1095340382307768e-03</internalNodes>
+          <leafValues>
+            4.8667120933532715e-01 7.1085482835769653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 -1.2503260513767600e-03</internalNodes>
+          <leafValues>
+            3.4078910946846008e-01 5.1561951637268066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 -1.0281190043315291e-03</internalNodes>
+          <leafValues>
+            5.5755722522735596e-01 4.4394320249557495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -8.8893622159957886e-03</internalNodes>
+          <leafValues>
+            6.4020007848739624e-01 4.6204420924186707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -6.1094801640138030e-04</internalNodes>
+          <leafValues>
+            3.7664419412612915e-01 5.4488998651504517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -5.7686357758939266e-03</internalNodes>
+          <leafValues>
+            3.3186489343643188e-01 5.1336771249771118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 1.8506490159779787e-03</internalNodes>
+          <leafValues>
+            4.9035701155662537e-01 6.4069348573684692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -9.9799469113349915e-02</internalNodes>
+          <leafValues>
+            1.5360510349273682e-01 5.0155621767044067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 -3.5128349065780640e-01</internalNodes>
+          <leafValues>
+            5.8823131024837494e-02 5.1743787527084351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -4.5244570821523666e-02</internalNodes>
+          <leafValues>
+            6.9614887237548828e-01 4.6778729557991028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 7.1481578052043915e-02</internalNodes>
+          <leafValues>
+            5.1679861545562744e-01 1.0380929708480835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 2.1895780228078365e-03</internalNodes>
+          <leafValues>
+            4.2730781435966492e-01 5.5320608615875244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 -5.9242651332169771e-04</internalNodes>
+          <leafValues>
+            4.6389439702033997e-01 5.2763891220092773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 1.6788389766588807e-03</internalNodes>
+          <leafValues>
+            5.3016489744186401e-01 3.9320349693298340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -2.2163488902151585e-03</internalNodes>
+          <leafValues>
+            5.6306940317153931e-01 4.7570338845252991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 1.1568699846975505e-04</internalNodes>
+          <leafValues>
+            4.3075358867645264e-01 5.5357027053833008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 -7.2017288766801357e-03</internalNodes>
+          <leafValues>
+            1.4448820054531097e-01 5.1930642127990723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 8.9081272017210722e-04</internalNodes>
+          <leafValues>
+            4.3844321370124817e-01 5.5936211347579956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 1.9605009583756328e-04</internalNodes>
+          <leafValues>
+            5.3404158353805542e-01 4.7059568762779236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 5.2022142335772514e-04</internalNodes>
+          <leafValues>
+            5.2138561010360718e-01 3.8100790977478027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 9.4588572392240167e-04</internalNodes>
+          <leafValues>
+            4.7694149613380432e-01 6.1307388544082642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 9.1698471806012094e-05</internalNodes>
+          <leafValues>
+            4.2450091242790222e-01 5.4293632507324219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 2.1833200007677078e-03</internalNodes>
+          <leafValues>
+            5.4577308893203735e-01 4.1910758614540100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -8.6039671441540122e-04</internalNodes>
+          <leafValues>
+            5.7645887136459351e-01 4.4716599583625793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -1.3236239552497864e-02</internalNodes>
+          <leafValues>
+            6.3728231191635132e-01 4.6950098872184753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 4.3376701069064438e-04</internalNodes>
+          <leafValues>
+            5.3178739547729492e-01 3.9458298683166504e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>140</maxWeakCount>
+      <stageThreshold>6.9229873657226562e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1052 -2.4847149848937988e-02</internalNodes>
+          <leafValues>
+            6.5555167198181152e-01 3.8733118772506714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 6.1348611488938332e-03</internalNodes>
+          <leafValues>
+            3.7480720877647400e-01 5.9739977121353149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 6.4498498104512691e-03</internalNodes>
+          <leafValues>
+            5.4254919290542603e-01 2.5488111376762390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 6.3491211039945483e-04</internalNodes>
+          <leafValues>
+            2.4624420702457428e-01 5.3872537612915039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 1.4023890253156424e-03</internalNodes>
+          <leafValues>
+            5.5943220853805542e-01 3.5286578536033630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 3.0044000595808029e-04</internalNodes>
+          <leafValues>
+            3.9585039019584656e-01 5.7659381628036499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 1.0042409849120304e-04</internalNodes>
+          <leafValues>
+            3.6989969015121460e-01 5.5349981784820557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 -5.0841490738093853e-03</internalNodes>
+          <leafValues>
+            3.7110909819602966e-01 5.5478000640869141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 -1.9537260755896568e-02</internalNodes>
+          <leafValues>
+            7.4927550554275513e-01 4.5792970061302185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 -7.4532740654831287e-06</internalNodes>
+          <leafValues>
+            5.6497871875762939e-01 3.9040699601173401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 -3.6079459823668003e-03</internalNodes>
+          <leafValues>
+            3.3810880780220032e-01 5.2678012847900391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 2.0697501022368670e-03</internalNodes>
+          <leafValues>
+            5.5192911624908447e-01 3.7143889069557190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 -4.6463840408250690e-04</internalNodes>
+          <leafValues>
+            5.6082147359848022e-01 4.1135668754577637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 7.5490452582016587e-04</internalNodes>
+          <leafValues>
+            3.5592061281204224e-01 5.3293561935424805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 -9.8322238773107529e-04</internalNodes>
+          <leafValues>
+            5.4147958755493164e-01 3.7632051110267639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 -1.9940640777349472e-02</internalNodes>
+          <leafValues>
+            6.3479030132293701e-01 4.7052991390228271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 3.7680300883948803e-03</internalNodes>
+          <leafValues>
+            3.9134898781776428e-01 5.5637162923812866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 -9.4528505578637123e-03</internalNodes>
+          <leafValues>
+            2.5548928976058960e-01 5.2151167392730713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 2.9560849070549011e-03</internalNodes>
+          <leafValues>
+            5.1746791601181030e-01 3.0639201402664185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 9.1078737750649452e-03</internalNodes>
+          <leafValues>
+            5.3884482383728027e-01 2.8859630227088928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 1.8219229532405734e-03</internalNodes>
+          <leafValues>
+            4.3360430002212524e-01 5.8521968126296997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 1.4688739553093910e-02</internalNodes>
+          <leafValues>
+            5.2873617410659790e-01 2.8700059652328491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 -1.4387990348041058e-02</internalNodes>
+          <leafValues>
+            7.0194488763809204e-01 4.6473708748817444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 -1.8986649811267853e-02</internalNodes>
+          <leafValues>
+            2.9865521192550659e-01 5.2470117807388306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 1.1527639580890536e-03</internalNodes>
+          <leafValues>
+            4.3234738707542419e-01 5.9316617250442505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 1.0933670215308666e-02</internalNodes>
+          <leafValues>
+            5.2868640422821045e-01 3.1303191184997559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 -1.4932730235159397e-02</internalNodes>
+          <leafValues>
+            2.6584190130233765e-01 5.0840771198272705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 -2.9970539617352188e-04</internalNodes>
+          <leafValues>
+            5.4635268449783325e-01 3.7407240271568298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 4.1677621193230152e-03</internalNodes>
+          <leafValues>
+            4.7034969925880432e-01 7.4357217550277710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 -6.3905320130288601e-03</internalNodes>
+          <leafValues>
+            2.0692589879035950e-01 5.2805382013320923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 4.5029609464108944e-03</internalNodes>
+          <leafValues>
+            5.1826488971710205e-01 3.4835430979728699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 -9.2040365561842918e-03</internalNodes>
+          <leafValues>
+            6.8037772178649902e-01 4.9323600530624390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 8.1327259540557861e-02</internalNodes>
+          <leafValues>
+            5.0583988428115845e-01 2.2530519962310791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 -1.5079280734062195e-01</internalNodes>
+          <leafValues>
+            2.9634249210357666e-01 5.2646797895431519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 3.3179009333252907e-03</internalNodes>
+          <leafValues>
+            4.6554958820343018e-01 7.0729321241378784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 7.7402801252901554e-04</internalNodes>
+          <leafValues>
+            4.7803479433059692e-01 5.6682378053665161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 6.8199541419744492e-04</internalNodes>
+          <leafValues>
+            4.2869961261749268e-01 5.7221567630767822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 5.3671570494771004e-03</internalNodes>
+          <leafValues>
+            5.2993071079254150e-01 3.1146219372749329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 9.7018666565418243e-05</internalNodes>
+          <leafValues>
+            3.6746388673782349e-01 5.2694618701934814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 -1.2534089386463165e-01</internalNodes>
+          <leafValues>
+            2.3514920473098755e-01 5.2457910776138306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 -5.2516269497573376e-03</internalNodes>
+          <leafValues>
+            7.1159368753433228e-01 4.6937671303749084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 -7.8342109918594360e-03</internalNodes>
+          <leafValues>
+            4.4626510143280029e-01 5.4090857505798340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 -1.1310069821774960e-03</internalNodes>
+          <leafValues>
+            5.9456187486648560e-01 4.4176620244979858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 1.7601120052859187e-03</internalNodes>
+          <leafValues>
+            5.3532499074935913e-01 3.9734530448913574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 -8.1581249833106995e-04</internalNodes>
+          <leafValues>
+            3.7602680921554565e-01 5.2647268772125244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 -3.8687589112669230e-03</internalNodes>
+          <leafValues>
+            6.3099128007888794e-01 4.7498199343681335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 1.5207129763439298e-03</internalNodes>
+          <leafValues>
+            5.2301818132400513e-01 3.3612239360809326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 5.4586738348007202e-01</internalNodes>
+          <leafValues>
+            5.1671397686004639e-01 1.1726350337266922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 1.5650190412998199e-02</internalNodes>
+          <leafValues>
+            4.9794390797615051e-01 1.3932949304580688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 -1.1731860227882862e-02</internalNodes>
+          <leafValues>
+            7.1296507120132446e-01 4.9211961030960083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 -6.1765122227370739e-03</internalNodes>
+          <leafValues>
+            2.2881029546260834e-01 5.0497019290924072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 2.2457661107182503e-03</internalNodes>
+          <leafValues>
+            4.6324339509010315e-01 6.0487258434295654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 -5.1915869116783142e-03</internalNodes>
+          <leafValues>
+            6.4674210548400879e-01 4.6021929383277893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 -2.3827880620956421e-02</internalNodes>
+          <leafValues>
+            1.4820009469985962e-01 5.2260792255401611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 1.0284580057486892e-03</internalNodes>
+          <leafValues>
+            5.1354891061782837e-01 3.3759570121765137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 -1.0078850202262402e-02</internalNodes>
+          <leafValues>
+            2.7405610680580139e-01 5.3035670518875122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 2.6168930344283581e-03</internalNodes>
+          <leafValues>
+            5.3326708078384399e-01 3.9724540710449219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 5.4385367548093200e-04</internalNodes>
+          <leafValues>
+            5.3656041622161865e-01 4.0634119510650635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 5.3510512225329876e-03</internalNodes>
+          <leafValues>
+            4.6537590026855469e-01 6.8890458345413208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 -1.5274790348485112e-03</internalNodes>
+          <leafValues>
+            5.4495012760162354e-01 3.6247238516807556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 -8.0624416470527649e-02</internalNodes>
+          <leafValues>
+            1.6560870409011841e-01 5.0002872943878174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 2.2192029282450676e-02</internalNodes>
+          <leafValues>
+            5.1327311992645264e-01 2.0028080046176910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 7.3100631125271320e-03</internalNodes>
+          <leafValues>
+            4.6179479360580444e-01 6.3665360212326050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 -6.4063072204589844e-03</internalNodes>
+          <leafValues>
+            5.9162509441375732e-01 4.8678609728813171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 -7.6415040530264378e-04</internalNodes>
+          <leafValues>
+            3.8884091377258301e-01 5.3157979249954224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 7.6734489994123578e-04</internalNodes>
+          <leafValues>
+            4.1590648889541626e-01 5.6052798032760620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 6.1474501853808761e-04</internalNodes>
+          <leafValues>
+            3.0890220403671265e-01 5.1201480627059937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -5.0105270929634571e-03</internalNodes>
+          <leafValues>
+            3.9721998572349548e-01 5.2073061466217041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 -8.6909132078289986e-03</internalNodes>
+          <leafValues>
+            6.2574082612991333e-01 4.6085759997367859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 -1.6391459852457047e-02</internalNodes>
+          <leafValues>
+            2.0852099359035492e-01 5.2422660589218140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 4.0973909199237823e-04</internalNodes>
+          <leafValues>
+            5.2224272489547729e-01 3.7803208827972412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 -2.5242289993911982e-03</internalNodes>
+          <leafValues>
+            5.8039271831512451e-01 4.6118900179862976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 5.0945312250405550e-04</internalNodes>
+          <leafValues>
+            4.4012719392776489e-01 5.8460158109664917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 1.9656419754028320e-03</internalNodes>
+          <leafValues>
+            5.3223252296447754e-01 4.1845908761024475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 5.6298897834494710e-04</internalNodes>
+          <leafValues>
+            3.7418448925018311e-01 5.2345657348632812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -6.7946797935292125e-04</internalNodes>
+          <leafValues>
+            4.6310418844223022e-01 5.3564780950546265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 7.2856349870562553e-03</internalNodes>
+          <leafValues>
+            5.0446701049804688e-01 2.3775640130043030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 -1.7459489405155182e-02</internalNodes>
+          <leafValues>
+            7.2891211509704590e-01 5.0504350662231445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 -2.5421749800443649e-02</internalNodes>
+          <leafValues>
+            6.6671347618103027e-01 4.6781000494956970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 -1.5647639520466328e-03</internalNodes>
+          <leafValues>
+            4.3917590379714966e-01 5.3236269950866699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 1.1444360017776489e-02</internalNodes>
+          <leafValues>
+            4.3464401364326477e-01 5.6800121068954468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 -6.7352550104260445e-04</internalNodes>
+          <leafValues>
+            4.4771409034729004e-01 5.2968120574951172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 9.3194209039211273e-03</internalNodes>
+          <leafValues>
+            4.7402000427246094e-01 7.4626070261001587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 1.3328490604180843e-04</internalNodes>
+          <leafValues>
+            5.3650617599487305e-01 4.7521349787712097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 -7.8815799206495285e-03</internalNodes>
+          <leafValues>
+            1.7522190511226654e-01 5.0152552127838135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 -5.7985680177807808e-03</internalNodes>
+          <leafValues>
+            7.2712367773056030e-01 4.8962008953094482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 -3.8922499516047537e-04</internalNodes>
+          <leafValues>
+            4.0039089322090149e-01 5.3449410200119019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 -1.9288610201328993e-03</internalNodes>
+          <leafValues>
+            5.6056129932403564e-01 4.8039558529853821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 8.4214154630899429e-03</internalNodes>
+          <leafValues>
+            4.7532469034194946e-01 7.6236087083816528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 8.1655876711010933e-03</internalNodes>
+          <leafValues>
+            5.3932619094848633e-01 4.1916438937187195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 4.8280550981871784e-04</internalNodes>
+          <leafValues>
+            4.2408001422882080e-01 5.3998219966888428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 -2.7186630759388208e-03</internalNodes>
+          <leafValues>
+            4.2445999383926392e-01 5.4249238967895508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 -1.2507230043411255e-02</internalNodes>
+          <leafValues>
+            5.8958417177200317e-01 4.5504111051559448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 -2.4286519736051559e-02</internalNodes>
+          <leafValues>
+            2.6471349596977234e-01 5.1891797780990601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -2.9676330741494894e-03</internalNodes>
+          <leafValues>
+            7.3476827144622803e-01 4.7497498989105225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 -1.2528999708592892e-02</internalNodes>
+          <leafValues>
+            2.7560499310493469e-01 5.1775997877120972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 -1.0104000102728605e-03</internalNodes>
+          <leafValues>
+            3.5105609893798828e-01 5.1447242498397827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 -2.1348530426621437e-03</internalNodes>
+          <leafValues>
+            5.6379258632659912e-01 4.6673199534416199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 1.9564259797334671e-02</internalNodes>
+          <leafValues>
+            4.6145731210708618e-01 6.1376398801803589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 -9.7146347165107727e-02</internalNodes>
+          <leafValues>
+            2.9983788728713989e-01 5.1935559511184692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 4.5014568604528904e-03</internalNodes>
+          <leafValues>
+            5.0778847932815552e-01 3.0457559227943420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 6.3706971704959869e-03</internalNodes>
+          <leafValues>
+            4.8610189557075500e-01 6.8875008821487427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -9.0721528977155685e-03</internalNodes>
+          <leafValues>
+            1.6733959317207336e-01 5.0175631046295166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 -5.3537208586931229e-03</internalNodes>
+          <leafValues>
+            2.6927569508552551e-01 5.2426332235336304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -1.0932840406894684e-02</internalNodes>
+          <leafValues>
+            7.1838641166687012e-01 4.7360289096832275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 8.2356072962284088e-03</internalNodes>
+          <leafValues>
+            5.2239668369293213e-01 2.3898629844188690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 -1.0038160253316164e-03</internalNodes>
+          <leafValues>
+            5.7193559408187866e-01 4.4339430332183838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 4.0859128348529339e-03</internalNodes>
+          <leafValues>
+            5.4728418588638306e-01 4.1488361358642578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 1.5485419332981110e-01</internalNodes>
+          <leafValues>
+            4.9738121032714844e-01 6.1061598360538483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 2.0897459762636572e-04</internalNodes>
+          <leafValues>
+            4.7091740369796753e-01 5.4238891601562500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 3.3316991175524890e-04</internalNodes>
+          <leafValues>
+            4.0896269679069519e-01 5.3009921312332153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 -1.0813400149345398e-02</internalNodes>
+          <leafValues>
+            6.1043697595596313e-01 4.9573341012001038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 4.5656010508537292e-02</internalNodes>
+          <leafValues>
+            5.0696891546249390e-01 2.8666600584983826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 1.2569549726322293e-03</internalNodes>
+          <leafValues>
+            4.8469170928001404e-01 6.3181710243225098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 -1.2015070021152496e-01</internalNodes>
+          <leafValues>
+            6.0526140034198761e-02 4.9809598922729492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 -1.0533799650147557e-04</internalNodes>
+          <leafValues>
+            5.3631097078323364e-01 4.7080421447753906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 -2.0703190565109253e-01</internalNodes>
+          <leafValues>
+            5.9660330414772034e-02 4.9790981411933899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 1.2909180077258497e-04</internalNodes>
+          <leafValues>
+            4.7129771113395691e-01 5.3779977560043335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 3.8818528992123902e-04</internalNodes>
+          <leafValues>
+            4.3635380268096924e-01 5.5341911315917969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 -2.9243610333651304e-03</internalNodes>
+          <leafValues>
+            5.8111858367919922e-01 4.8252159357070923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 8.3882332546636462e-04</internalNodes>
+          <leafValues>
+            5.3117001056671143e-01 4.0381389856338501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 -1.9061550265178084e-03</internalNodes>
+          <leafValues>
+            3.7707018852233887e-01 5.2600151300430298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 8.9514348655939102e-03</internalNodes>
+          <leafValues>
+            4.7661679983139038e-01 7.6821839809417725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 1.3083459809422493e-02</internalNodes>
+          <leafValues>
+            5.2644628286361694e-01 3.0622220039367676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 -2.1159330010414124e-01</internalNodes>
+          <leafValues>
+            6.7371982336044312e-01 4.6958100795745850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 3.1493250280618668e-03</internalNodes>
+          <leafValues>
+            5.6448352336883545e-01 4.3869531154632568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 3.9754100725986063e-04</internalNodes>
+          <leafValues>
+            4.5260611176490784e-01 5.8956301212310791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 -1.3814480043947697e-03</internalNodes>
+          <leafValues>
+            6.0705822706222534e-01 4.9424138665199280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 -5.8122188784182072e-04</internalNodes>
+          <leafValues>
+            5.9982132911682129e-01 4.5082521438598633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 -2.3905329871922731e-03</internalNodes>
+          <leafValues>
+            4.2055889964103699e-01 5.2238482236862183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 2.7268929407000542e-02</internalNodes>
+          <leafValues>
+            5.2064472436904907e-01 3.5633018612861633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 -3.7658358924090862e-03</internalNodes>
+          <leafValues>
+            3.1447041034698486e-01 5.2188140153884888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 -1.4903489500284195e-03</internalNodes>
+          <leafValues>
+            3.3801960945129395e-01 5.1244372129440308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 -1.7428230494260788e-02</internalNodes>
+          <leafValues>
+            5.8299607038497925e-01 4.9197259545326233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -1.5278030186891556e-02</internalNodes>
+          <leafValues>
+            6.1631447076797485e-01 4.6178871393203735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 3.1995609402656555e-02</internalNodes>
+          <leafValues>
+            5.1663571596145630e-01 1.7127640545368195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 -3.8256710395216942e-03</internalNodes>
+          <leafValues>
+            3.4080120921134949e-01 5.1313877105712891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -8.5186436772346497e-03</internalNodes>
+          <leafValues>
+            6.1055189371109009e-01 4.9979418516159058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 9.0641621500253677e-04</internalNodes>
+          <leafValues>
+            4.3272709846496582e-01 5.5823111534118652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 1.0344849899411201e-02</internalNodes>
+          <leafValues>
+            4.8556530475616455e-01 5.4524201154708862e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>160</maxWeakCount>
+      <stageThreshold>7.9249076843261719e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1192 7.8981826081871986e-03</internalNodes>
+          <leafValues>
+            3.3325248956680298e-01 5.9464621543884277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 1.6170160379260778e-03</internalNodes>
+          <leafValues>
+            3.4906411170959473e-01 5.5778688192367554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 -5.5449741194024682e-04</internalNodes>
+          <leafValues>
+            5.5425661802291870e-01 3.2915300130844116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 1.5428980113938451e-03</internalNodes>
+          <leafValues>
+            3.6125791072845459e-01 5.5459791421890259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 -1.0329450014978647e-03</internalNodes>
+          <leafValues>
+            3.5301390290260315e-01 5.5761402845382690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 7.7698158565908670e-04</internalNodes>
+          <leafValues>
+            3.9167788624763489e-01 5.6453210115432739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 1.4320300519466400e-01</internalNodes>
+          <leafValues>
+            4.6674820780754089e-01 7.0236331224441528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 -7.3866490274667740e-03</internalNodes>
+          <leafValues>
+            3.0736848711967468e-01 5.2892577648162842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 -6.2936742324382067e-04</internalNodes>
+          <leafValues>
+            5.6221181154251099e-01 4.0370491147041321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 7.8893528552725911e-04</internalNodes>
+          <leafValues>
+            5.2676612138748169e-01 3.5578748583793640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 -1.2228050269186497e-02</internalNodes>
+          <leafValues>
+            6.6683208942413330e-01 4.6255499124526978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 3.5420239437371492e-03</internalNodes>
+          <leafValues>
+            5.5214381217956543e-01 3.8696730136871338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 -1.0585320414975286e-03</internalNodes>
+          <leafValues>
+            3.6286780238151550e-01 5.3209269046783447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 1.4935660146875307e-05</internalNodes>
+          <leafValues>
+            4.6324449777603149e-01 5.3633230924606323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 5.2537708543241024e-03</internalNodes>
+          <leafValues>
+            5.1322317123413086e-01 3.2657089829444885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 -8.2338023930788040e-03</internalNodes>
+          <leafValues>
+            6.6936898231506348e-01 4.7741401195526123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 2.1866810129722580e-05</internalNodes>
+          <leafValues>
+            4.0538620948791504e-01 5.4579311609268188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 -3.8150229956954718e-03</internalNodes>
+          <leafValues>
+            6.4549958705902100e-01 4.7931781411170959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 1.1105879675596952e-03</internalNodes>
+          <leafValues>
+            5.2704071998596191e-01 3.5296788811683655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 -5.7707689702510834e-03</internalNodes>
+          <leafValues>
+            3.8035470247268677e-01 5.3529578447341919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 -3.0158339068293571e-03</internalNodes>
+          <leafValues>
+            5.3394031524658203e-01 3.8871330022811890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 -8.5453689098358154e-04</internalNodes>
+          <leafValues>
+            3.5646161437034607e-01 5.2736037969589233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 1.1050510220229626e-02</internalNodes>
+          <leafValues>
+            4.6719071269035339e-01 6.8497377634048462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 4.2605839669704437e-02</internalNodes>
+          <leafValues>
+            5.1514732837677002e-01 7.0220090448856354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 -3.0781750101596117e-03</internalNodes>
+          <leafValues>
+            3.0416610836982727e-01 5.1526021957397461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 -5.4815728217363358e-03</internalNodes>
+          <leafValues>
+            6.4302957057952881e-01 4.8972299695014954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 3.1881860923022032e-03</internalNodes>
+          <leafValues>
+            5.3074932098388672e-01 3.8262099027633667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 3.5947180003859103e-04</internalNodes>
+          <leafValues>
+            4.6500471234321594e-01 5.4219049215316772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -4.0705031715333462e-03</internalNodes>
+          <leafValues>
+            2.8496798872947693e-01 5.0791162252426147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 -1.4594170264899731e-02</internalNodes>
+          <leafValues>
+            2.9716458916664124e-01 5.1284617185592651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 -1.1947689927183092e-04</internalNodes>
+          <leafValues>
+            5.6310981512069702e-01 4.3430820107460022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 -6.9344649091362953e-04</internalNodes>
+          <leafValues>
+            4.4035780429840088e-01 5.3599590063095093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 1.4834799912932795e-05</internalNodes>
+          <leafValues>
+            3.4210088849067688e-01 5.1646977663040161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 9.0296985581517220e-03</internalNodes>
+          <leafValues>
+            4.6393430233001709e-01 6.1140751838684082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 -8.0640818923711777e-03</internalNodes>
+          <leafValues>
+            2.8201588988304138e-01 5.0754940509796143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 2.6062119752168655e-02</internalNodes>
+          <leafValues>
+            5.2089059352874756e-01 2.6887780427932739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 1.7314659431576729e-02</internalNodes>
+          <leafValues>
+            4.6637138724327087e-01 6.7385399341583252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 2.2666640579700470e-02</internalNodes>
+          <leafValues>
+            5.2093499898910522e-01 2.2127239406108856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 -2.1965929772704840e-03</internalNodes>
+          <leafValues>
+            6.0631012916564941e-01 4.5381900668144226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 -9.5282476395368576e-03</internalNodes>
+          <leafValues>
+            4.6352049708366394e-01 5.2474308013916016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 8.0943619832396507e-03</internalNodes>
+          <leafValues>
+            5.2894401550292969e-01 3.9138820767402649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 -7.2877332568168640e-02</internalNodes>
+          <leafValues>
+            7.7520018815994263e-01 4.9902349710464478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 -6.9009521976113319e-03</internalNodes>
+          <leafValues>
+            2.4280390143394470e-01 5.0480902194976807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 -1.1308239772915840e-02</internalNodes>
+          <leafValues>
+            5.7343649864196777e-01 4.8423761129379272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 5.9613201767206192e-02</internalNodes>
+          <leafValues>
+            5.0298362970352173e-01 2.5249770283699036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 -2.8624620754271746e-03</internalNodes>
+          <leafValues>
+            6.0730451345443726e-01 4.8984599113464355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 4.4781449250876904e-03</internalNodes>
+          <leafValues>
+            5.0152891874313354e-01 2.2203169763088226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 -1.7513240454718471e-03</internalNodes>
+          <leafValues>
+            6.6144287586212158e-01 4.9338689446449280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 4.0163420140743256e-02</internalNodes>
+          <leafValues>
+            5.1808780431747437e-01 3.7410449981689453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 3.4768949262797832e-04</internalNodes>
+          <leafValues>
+            4.7204169631004333e-01 5.8180320262908936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 2.6551650371402502e-03</internalNodes>
+          <leafValues>
+            3.8050109148025513e-01 5.2213358879089355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 -8.7706279009580612e-03</internalNodes>
+          <leafValues>
+            2.9441660642623901e-01 5.2312952280044556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 -5.5122091434895992e-03</internalNodes>
+          <leafValues>
+            7.3461771011352539e-01 4.7228169441223145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 6.8672042107209563e-04</internalNodes>
+          <leafValues>
+            5.4528760910034180e-01 4.2424130439758301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1246 5.6019669864326715e-04</internalNodes>
+          <leafValues>
+            4.3988621234893799e-01 5.6012850999832153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 2.4143769405782223e-03</internalNodes>
+          <leafValues>
+            4.7416868805885315e-01 6.1366218328475952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 -1.5680900542065501e-03</internalNodes>
+          <leafValues>
+            6.0445529222488403e-01 4.5164099335670471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 -3.6827491130679846e-03</internalNodes>
+          <leafValues>
+            2.4524590373039246e-01 5.2949821949005127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1250 -2.9409190756268799e-04</internalNodes>
+          <leafValues>
+            3.7328380346298218e-01 5.2514511346817017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 4.2847759323194623e-04</internalNodes>
+          <leafValues>
+            5.4988098144531250e-01 4.0655350685119629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -4.8817070201039314e-03</internalNodes>
+          <leafValues>
+            2.1399089694023132e-01 4.9999570846557617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 2.7272020815871656e-04</internalNodes>
+          <leafValues>
+            4.6502870321273804e-01 5.8134287595748901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 2.0947199664078653e-04</internalNodes>
+          <leafValues>
+            4.3874868750572205e-01 5.5727928876876831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 4.8501189798116684e-02</internalNodes>
+          <leafValues>
+            5.2449727058410645e-01 3.2128891348838806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 -4.5166411437094212e-03</internalNodes>
+          <leafValues>
+            6.0568130016326904e-01 4.5458820462226868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 -1.2291680090129375e-02</internalNodes>
+          <leafValues>
+            2.0409290492534637e-01 5.1522141695022583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 4.8549679922871292e-04</internalNodes>
+          <leafValues>
+            5.2376049757003784e-01 3.7395030260086060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 3.0556049197912216e-02</internalNodes>
+          <leafValues>
+            4.9605339765548706e-01 5.9382462501525879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 -1.5105320198927075e-04</internalNodes>
+          <leafValues>
+            5.3513038158416748e-01 4.1452041268348694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 2.4937440175563097e-03</internalNodes>
+          <leafValues>
+            4.6933668851852417e-01 5.5149412155151367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 -1.2382130138576031e-02</internalNodes>
+          <leafValues>
+            6.7913967370986938e-01 4.6816679835319519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 -5.1333461888134480e-03</internalNodes>
+          <leafValues>
+            3.6087390780448914e-01 5.2291601896286011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 5.1919277757406235e-04</internalNodes>
+          <leafValues>
+            5.3000730276107788e-01 3.6336138844490051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 1.5060420334339142e-01</internalNodes>
+          <leafValues>
+            5.1573169231414795e-01 2.2117820382118225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 7.7144149690866470e-03</internalNodes>
+          <leafValues>
+            4.4104969501495361e-01 5.7766091823577881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 9.4443522393703461e-03</internalNodes>
+          <leafValues>
+            5.4018551111221313e-01 3.7566500902175903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 2.5006249779835343e-04</internalNodes>
+          <leafValues>
+            4.3682709336280823e-01 5.6073749065399170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 -3.3077150583267212e-03</internalNodes>
+          <leafValues>
+            4.2447990179061890e-01 5.5182307958602905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 7.4048910755664110e-04</internalNodes>
+          <leafValues>
+            4.4969621300697327e-01 5.9005767107009888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 4.4092051684856415e-02</internalNodes>
+          <leafValues>
+            5.2934932708740234e-01 3.1563550233840942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 3.3639909233897924e-03</internalNodes>
+          <leafValues>
+            4.4832968711853027e-01 5.8486622571945190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 -3.9760079234838486e-03</internalNodes>
+          <leafValues>
+            4.5595070719718933e-01 5.4836392402648926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 2.7716930489987135e-03</internalNodes>
+          <leafValues>
+            5.3417861461639404e-01 3.7924841046333313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 -2.4123019829858094e-04</internalNodes>
+          <leafValues>
+            5.6671887636184692e-01 4.5769730210304260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 4.9425667384639382e-04</internalNodes>
+          <leafValues>
+            4.4212448596954346e-01 5.6287872791290283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 -3.8876468897797167e-04</internalNodes>
+          <leafValues>
+            4.2883709073066711e-01 5.3910630941390991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 -5.0048898905515671e-02</internalNodes>
+          <leafValues>
+            6.8995130062103271e-01 4.7037428617477417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 -3.6635480821132660e-02</internalNodes>
+          <leafValues>
+            2.2177790105342865e-01 5.1918262243270874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 2.4273579474538565e-03</internalNodes>
+          <leafValues>
+            5.1362240314483643e-01 3.4973978996276855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 1.9558030180633068e-03</internalNodes>
+          <leafValues>
+            4.8261928558349609e-01 6.4083808660507202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 -1.7494610510766506e-03</internalNodes>
+          <leafValues>
+            3.9228358864784241e-01 5.2726852893829346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1283 1.3955079950392246e-02</internalNodes>
+          <leafValues>
+            5.0782018899917603e-01 8.4165048599243164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 -2.1896739781368524e-04</internalNodes>
+          <leafValues>
+            5.5204898118972778e-01 4.3142348527908325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 -1.5131309628486633e-03</internalNodes>
+          <leafValues>
+            3.9346051216125488e-01 5.3825712203979492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 -4.3622800149023533e-03</internalNodes>
+          <leafValues>
+            7.3706287145614624e-01 4.7364759445190430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 6.5160587430000305e-02</internalNodes>
+          <leafValues>
+            5.1592797040939331e-01 3.2815951108932495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 -2.3567399475723505e-03</internalNodes>
+          <leafValues>
+            3.6728268861770630e-01 5.1728862524032593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 1.5146659687161446e-02</internalNodes>
+          <leafValues>
+            5.0314939022064209e-01 6.6876041889190674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 -2.2850960493087769e-02</internalNodes>
+          <leafValues>
+            6.7675197124481201e-01 4.7095969319343567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 4.8867650330066681e-03</internalNodes>
+          <leafValues>
+            5.2579981088638306e-01 4.0598788857460022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 1.7619599821045995e-03</internalNodes>
+          <leafValues>
+            4.6962729096412659e-01 6.6882789134979248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 -1.2942519970238209e-03</internalNodes>
+          <leafValues>
+            4.3207129836082458e-01 5.3442817926406860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 1.0929949581623077e-02</internalNodes>
+          <leafValues>
+            4.9977061152458191e-01 1.6374860703945160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 2.9958489903947338e-05</internalNodes>
+          <leafValues>
+            4.2824178934097290e-01 5.6332242488861084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 -6.5884361974895000e-03</internalNodes>
+          <leafValues>
+            6.7721211910247803e-01 4.7005268931388855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1297 3.2527779694646597e-03</internalNodes>
+          <leafValues>
+            5.3133970499038696e-01 4.5361489057540894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 -4.0435739792883396e-03</internalNodes>
+          <leafValues>
+            5.6600618362426758e-01 4.4133889675140381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 -1.2523540062829852e-03</internalNodes>
+          <leafValues>
+            3.7319138646125793e-01 5.3564518690109253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 1.9246719602961093e-04</internalNodes>
+          <leafValues>
+            5.1899862289428711e-01 3.7388110160827637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 -3.8589671254158020e-02</internalNodes>
+          <leafValues>
+            2.9563739895820618e-01 5.1888108253479004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 1.5489870565943420e-04</internalNodes>
+          <leafValues>
+            4.3471351265907288e-01 5.5095332860946655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 -3.3763848245143890e-02</internalNodes>
+          <leafValues>
+            3.2303300499916077e-01 5.1954758167266846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 -8.2657067105174065e-03</internalNodes>
+          <leafValues>
+            5.9754890203475952e-01 4.5521140098571777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 1.4481440302915871e-05</internalNodes>
+          <leafValues>
+            4.7456780076026917e-01 5.4974269866943359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 1.4951299817766994e-05</internalNodes>
+          <leafValues>
+            4.3244731426239014e-01 5.4806441068649292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 -1.8741799518465996e-02</internalNodes>
+          <leafValues>
+            1.5800529718399048e-01 5.1785331964492798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 1.7572239739820361e-03</internalNodes>
+          <leafValues>
+            4.5176368951797485e-01 5.7737642526626587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 -3.1391119118779898e-03</internalNodes>
+          <leafValues>
+            4.1496479511260986e-01 5.4608422517776489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 6.6656779381446540e-05</internalNodes>
+          <leafValues>
+            4.0390908718109131e-01 5.2930849790573120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 6.7743421532213688e-03</internalNodes>
+          <leafValues>
+            4.7676518559455872e-01 6.1219561100006104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 -7.3868161998689175e-03</internalNodes>
+          <leafValues>
+            3.5862588882446289e-01 5.1872807741165161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 1.4040930196642876e-02</internalNodes>
+          <leafValues>
+            4.7121399641036987e-01 5.5761557817459106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 -5.5258329957723618e-03</internalNodes>
+          <leafValues>
+            2.6610270142555237e-01 5.0392812490463257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 3.8684239983558655e-01</internalNodes>
+          <leafValues>
+            5.1443397998809814e-01 2.5258991122245789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 1.1459240340627730e-04</internalNodes>
+          <leafValues>
+            4.2849949002265930e-01 5.4233711957931519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 -1.8467569723725319e-02</internalNodes>
+          <leafValues>
+            3.8858351111412048e-01 5.2130621671676636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 -4.5907011372037232e-04</internalNodes>
+          <leafValues>
+            5.4125630855560303e-01 4.2359098792076111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 1.2527540093287826e-03</internalNodes>
+          <leafValues>
+            4.8993051052093506e-01 6.6240912675857544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 1.4910609461367130e-03</internalNodes>
+          <leafValues>
+            5.2867782115936279e-01 4.0400519967079163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 -7.5435562757775187e-04</internalNodes>
+          <leafValues>
+            6.0329902172088623e-01 4.7951200604438782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 -6.9478838704526424e-03</internalNodes>
+          <leafValues>
+            4.0844011306762695e-01 5.3735041618347168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 2.8092920547351241e-04</internalNodes>
+          <leafValues>
+            4.8460629582405090e-01 5.7593822479248047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 9.6073717577382922e-04</internalNodes>
+          <leafValues>
+            5.1647412776947021e-01 3.5549798607826233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 -2.6883929967880249e-04</internalNodes>
+          <leafValues>
+            5.6775820255279541e-01 4.7317659854888916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 2.1599370520561934e-03</internalNodes>
+          <leafValues>
+            4.7314870357513428e-01 7.0705670118331909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 5.6235301308333874e-03</internalNodes>
+          <leafValues>
+            5.2402430772781372e-01 2.7817919850349426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 -5.0243991427123547e-03</internalNodes>
+          <leafValues>
+            2.8370139002799988e-01 5.0623041391372681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 -9.7611639648675919e-03</internalNodes>
+          <leafValues>
+            7.4007177352905273e-01 4.9345690011978149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 4.1515100747346878e-03</internalNodes>
+          <leafValues>
+            5.1191312074661255e-01 3.4070080518722534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 6.2465080991387367e-03</internalNodes>
+          <leafValues>
+            4.9237880110740662e-01 6.5790587663650513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 -7.0597478188574314e-03</internalNodes>
+          <leafValues>
+            2.4347110092639923e-01 5.0328421592712402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 -2.0587709732353687e-03</internalNodes>
+          <leafValues>
+            5.9003108739852905e-01 4.6950870752334595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 -2.4146060459315777e-03</internalNodes>
+          <leafValues>
+            3.6473178863525391e-01 5.1892018318176270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 -1.4817609917372465e-03</internalNodes>
+          <leafValues>
+            6.0349482297897339e-01 4.9401280283927917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 -6.3016400672495365e-03</internalNodes>
+          <leafValues>
+            5.8189898729324341e-01 4.5604279637336731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 3.4763428848236799e-03</internalNodes>
+          <leafValues>
+            5.2174758911132812e-01 3.4839931130409241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 -2.2250870242714882e-02</internalNodes>
+          <leafValues>
+            2.3607000708580017e-01 5.0320827960968018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 -3.0612550675868988e-02</internalNodes>
+          <leafValues>
+            6.4991867542266846e-01 4.9149191379547119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 1.3057479634881020e-02</internalNodes>
+          <leafValues>
+            4.4133231043815613e-01 5.6837642192840576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 -6.0095742810517550e-04</internalNodes>
+          <leafValues>
+            4.3597310781478882e-01 5.3334832191467285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 -4.1514250915497541e-04</internalNodes>
+          <leafValues>
+            5.5040627717971802e-01 4.3260601162910461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 -1.3776290230453014e-02</internalNodes>
+          <leafValues>
+            4.0641129016876221e-01 5.2015489339828491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 -3.2296508550643921e-02</internalNodes>
+          <leafValues>
+            4.7351971268653870e-02 4.9771949648857117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 5.3556978702545166e-02</internalNodes>
+          <leafValues>
+            4.8817330598831177e-01 6.6669392585754395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 8.1889545544981956e-03</internalNodes>
+          <leafValues>
+            5.4000371694564819e-01 4.2408201098442078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 2.1055320394225419e-04</internalNodes>
+          <leafValues>
+            4.8020479083061218e-01 5.5638527870178223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 -2.4382730480283499e-03</internalNodes>
+          <leafValues>
+            7.3877930641174316e-01 4.7736850380897522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 3.2835570164024830e-03</internalNodes>
+          <leafValues>
+            5.2885460853576660e-01 3.1712919473648071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 2.3729570675641298e-03</internalNodes>
+          <leafValues>
+            4.7508129477500916e-01 7.0601707696914673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 -1.4541699783876538e-03</internalNodes>
+          <leafValues>
+            3.8117301464080811e-01 5.3307390213012695e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>177</maxWeakCount>
+      <stageThreshold>8.7696029663085938e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1352 5.5755238980054855e-02</internalNodes>
+          <leafValues>
+            4.0191569924354553e-01 6.8060368299484253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 2.4730248842388391e-03</internalNodes>
+          <leafValues>
+            3.3511489629745483e-01 5.9657198190689087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 -3.5031698644161224e-04</internalNodes>
+          <leafValues>
+            5.5577081441879272e-01 3.4822869300842285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 5.4167630150914192e-04</internalNodes>
+          <leafValues>
+            4.2608588933944702e-01 5.6933808326721191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 7.7193678589537740e-04</internalNodes>
+          <leafValues>
+            3.4942400455474854e-01 5.4336887598037720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 -1.5999219613149762e-03</internalNodes>
+          <leafValues>
+            4.0284991264343262e-01 5.4843592643737793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1358 -1.1832080053864047e-04</internalNodes>
+          <leafValues>
+            3.8069018721580505e-01 5.4254651069641113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 3.2909031142480671e-04</internalNodes>
+          <leafValues>
+            2.6201000809669495e-01 5.4295217990875244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 2.9518108931370080e-04</internalNodes>
+          <leafValues>
+            3.7997689843177795e-01 5.3992640972137451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 9.0466710389591753e-05</internalNodes>
+          <leafValues>
+            4.4336450099945068e-01 5.4402261972427368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 1.5007190086180344e-05</internalNodes>
+          <leafValues>
+            3.7196549773216248e-01 5.4091197252273560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 1.3935610651969910e-01</internalNodes>
+          <leafValues>
+            5.5253958702087402e-01 4.4790428876876831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 1.6461990308016539e-03</internalNodes>
+          <leafValues>
+            4.2645010352134705e-01 5.7721698284149170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 4.9984431825578213e-04</internalNodes>
+          <leafValues>
+            4.3595260381698608e-01 5.6858712434768677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 -1.0971280280500650e-03</internalNodes>
+          <leafValues>
+            3.3901369571685791e-01 5.2054089307785034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 6.6919892560690641e-04</internalNodes>
+          <leafValues>
+            4.5574560761451721e-01 5.9806597232818604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1368 8.6471042595803738e-04</internalNodes>
+          <leafValues>
+            5.1348412036895752e-01 2.9440331459045410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 -2.7182599296793342e-04</internalNodes>
+          <leafValues>
+            3.9065781235694885e-01 5.3771811723709106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 3.0249499104684219e-05</internalNodes>
+          <leafValues>
+            3.6796098947525024e-01 5.2256888151168823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 -8.5225896909832954e-03</internalNodes>
+          <leafValues>
+            7.2931021451950073e-01 4.8923650383949280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 1.6705560265108943e-03</internalNodes>
+          <leafValues>
+            4.3453249335289001e-01 5.6961381435394287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 -7.1433838456869125e-03</internalNodes>
+          <leafValues>
+            2.5912800431251526e-01 5.2256238460540771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 -1.6319369897246361e-02</internalNodes>
+          <leafValues>
+            6.9222790002822876e-01 4.6515759825706482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 4.8034260980784893e-03</internalNodes>
+          <leafValues>
+            5.3522628545761108e-01 3.2863029837608337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 -7.5421929359436035e-03</internalNodes>
+          <leafValues>
+            2.0405440032482147e-01 5.0345462560653687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 -1.4363110065460205e-02</internalNodes>
+          <leafValues>
+            6.8048888444900513e-01 4.8890590667724609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 8.9063588529825211e-04</internalNodes>
+          <leafValues>
+            5.3106957674026489e-01 3.8954809308052063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 -4.4060191139578819e-03</internalNodes>
+          <leafValues>
+            5.7415628433227539e-01 4.3724268674850464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 -1.8862540309783071e-04</internalNodes>
+          <leafValues>
+            2.8317859768867493e-01 5.0982052087783813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 -3.7979281041771173e-03</internalNodes>
+          <leafValues>
+            3.3725079894065857e-01 5.2465802431106567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 1.4627049677073956e-04</internalNodes>
+          <leafValues>
+            5.3066742420196533e-01 3.9117100834846497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -4.9164638767251745e-05</internalNodes>
+          <leafValues>
+            5.4624962806701660e-01 3.9427208900451660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 -3.3582501113414764e-02</internalNodes>
+          <leafValues>
+            2.1578240394592285e-01 5.0482118129730225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 -3.5339309833943844e-03</internalNodes>
+          <leafValues>
+            6.4653122425079346e-01 4.8726969957351685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 5.0144111737608910e-03</internalNodes>
+          <leafValues>
+            4.6176680922508240e-01 6.2480747699737549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 1.8817370757460594e-02</internalNodes>
+          <leafValues>
+            5.2206891775131226e-01 2.0000520348548889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 -1.3434339780360460e-03</internalNodes>
+          <leafValues>
+            4.0145379304885864e-01 5.3016197681427002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 1.7557960236445069e-03</internalNodes>
+          <leafValues>
+            4.7940391302108765e-01 5.6531697511672974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 -9.5637463033199310e-02</internalNodes>
+          <leafValues>
+            2.0341950654983521e-01 5.0067067146301270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 -2.2241229191422462e-02</internalNodes>
+          <leafValues>
+            7.6724731922149658e-01 5.0463402271270752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 -1.5575819648802280e-02</internalNodes>
+          <leafValues>
+            7.4903422594070435e-01 4.7558510303497314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 5.3599118255078793e-03</internalNodes>
+          <leafValues>
+            5.3653037548065186e-01 4.0046709775924683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1394 -2.1763499826192856e-02</internalNodes>
+          <leafValues>
+            7.4015498161315918e-02 4.9641749262809753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 -1.6561590135097504e-01</internalNodes>
+          <leafValues>
+            2.8591030836105347e-01 5.2180862426757812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 1.6461320046801120e-04</internalNodes>
+          <leafValues>
+            4.1916158795356750e-01 5.3807932138442993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 -8.9077502489089966e-03</internalNodes>
+          <leafValues>
+            6.2731927633285522e-01 4.8774048686027527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 8.6346449097618461e-04</internalNodes>
+          <leafValues>
+            5.1599407196044922e-01 3.6710259318351746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 -1.3751760125160217e-03</internalNodes>
+          <leafValues>
+            5.8843767642974854e-01 4.5790839195251465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 -1.4081239933148026e-03</internalNodes>
+          <leafValues>
+            3.5605099797248840e-01 5.1399451494216919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 -3.9342888630926609e-03</internalNodes>
+          <leafValues>
+            5.9942889213562012e-01 4.6642720699310303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 -3.1966928392648697e-02</internalNodes>
+          <leafValues>
+            3.3454620838165283e-01 5.1441830396652222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1403 -1.5089280168467667e-05</internalNodes>
+          <leafValues>
+            5.5826562643051147e-01 4.4140571355819702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 5.1994470413774252e-04</internalNodes>
+          <leafValues>
+            4.6236801147460938e-01 6.1689937114715576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1405 -3.4220460802316666e-03</internalNodes>
+          <leafValues>
+            6.5570747852325439e-01 4.9748051166534424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 1.7723299970384687e-04</internalNodes>
+          <leafValues>
+            5.2695018053054810e-01 3.9019080996513367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 1.5716759953647852e-03</internalNodes>
+          <leafValues>
+            4.6333730220794678e-01 5.7904577255249023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 -8.9041329920291901e-03</internalNodes>
+          <leafValues>
+            2.6896080374717712e-01 5.0535911321640015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 4.0677518700249493e-04</internalNodes>
+          <leafValues>
+            5.4566031694412231e-01 4.3298989534378052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 6.7604780197143555e-03</internalNodes>
+          <leafValues>
+            4.6489939093589783e-01 6.6897618770599365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 2.9100088868290186e-03</internalNodes>
+          <leafValues>
+            5.3097039461135864e-01 3.3778399229049683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 1.3885459629818797e-03</internalNodes>
+          <leafValues>
+            4.0747389197349548e-01 5.3491330146789551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 -7.6764263212680817e-02</internalNodes>
+          <leafValues>
+            1.9921760261058807e-01 5.2282422780990601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 -2.2688310127705336e-04</internalNodes>
+          <leafValues>
+            5.4385018348693848e-01 4.2530721426010132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 -6.3094152137637138e-03</internalNodes>
+          <leafValues>
+            4.2591789364814758e-01 5.3789097070693970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 -1.1007279902696609e-01</internalNodes>
+          <leafValues>
+            6.9041568040847778e-01 4.7217491269111633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 2.8619659133255482e-04</internalNodes>
+          <leafValues>
+            4.5249149203300476e-01 5.5483061075210571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 2.9425329557852820e-05</internalNodes>
+          <leafValues>
+            5.3703737258911133e-01 4.2364639043807983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 -2.4886570870876312e-02</internalNodes>
+          <leafValues>
+            6.4235579967498779e-01 4.9693039059638977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 3.3148851245641708e-02</internalNodes>
+          <leafValues>
+            4.9884751439094543e-01 1.6138119995594025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 7.8491691965609789e-04</internalNodes>
+          <leafValues>
+            5.4160261154174805e-01 4.2230090498924255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 4.7087189741432667e-03</internalNodes>
+          <leafValues>
+            4.5763289928436279e-01 6.0275578498840332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 2.4144479539245367e-03</internalNodes>
+          <leafValues>
+            5.3089731931686401e-01 4.4224989414215088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 1.9523180089890957e-03</internalNodes>
+          <leafValues>
+            4.7056341171264648e-01 6.6633248329162598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 1.3031980488449335e-03</internalNodes>
+          <leafValues>
+            4.4061261415481567e-01 5.5269622802734375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 4.4735497795045376e-03</internalNodes>
+          <leafValues>
+            5.1290237903594971e-01 3.3014988899230957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -2.6652868837118149e-03</internalNodes>
+          <leafValues>
+            3.1354710459709167e-01 5.1750361919403076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 1.3666770246345550e-04</internalNodes>
+          <leafValues>
+            4.1193708777427673e-01 5.3068768978118896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 -1.7126450315117836e-02</internalNodes>
+          <leafValues>
+            6.1778062582015991e-01 4.8365789651870728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 -2.6601430727168918e-04</internalNodes>
+          <leafValues>
+            3.6543309688568115e-01 5.1697367429733276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 -2.2932380437850952e-02</internalNodes>
+          <leafValues>
+            3.4909150004386902e-01 5.1639920473098755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 2.3316550068557262e-03</internalNodes>
+          <leafValues>
+            5.1662999391555786e-01 3.7093898653984070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 1.6925660893321037e-02</internalNodes>
+          <leafValues>
+            5.0147360563278198e-01 8.0539882183074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 -8.9858826249837875e-03</internalNodes>
+          <leafValues>
+            6.4707887172698975e-01 4.6570208668708801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 -1.1874699965119362e-02</internalNodes>
+          <leafValues>
+            3.2463788986206055e-01 5.2587550878524780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 1.9350569345988333e-04</internalNodes>
+          <leafValues>
+            5.1919418573379517e-01 3.8396438956260681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 5.8713490143418312e-03</internalNodes>
+          <leafValues>
+            4.9181339144706726e-01 6.1870431900024414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 -2.4838790297508240e-01</internalNodes>
+          <leafValues>
+            1.8368029594421387e-01 4.9881500005722046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 1.2256000190973282e-02</internalNodes>
+          <leafValues>
+            5.2270537614822388e-01 3.6320298910140991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 8.3990179700776935e-04</internalNodes>
+          <leafValues>
+            4.4902500510215759e-01 5.7741481065750122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 2.5407369248569012e-03</internalNodes>
+          <leafValues>
+            4.8047870397567749e-01 5.8582991361618042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 -1.4822429977357388e-02</internalNodes>
+          <leafValues>
+            2.5210499763488770e-01 5.0235372781753540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 -5.7973959483206272e-03</internalNodes>
+          <leafValues>
+            5.9966957569122314e-01 4.8537150025367737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 7.2662148158997297e-04</internalNodes>
+          <leafValues>
+            5.1537168025970459e-01 3.6717799305915833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 -1.7232580110430717e-02</internalNodes>
+          <leafValues>
+            6.6217190027236938e-01 4.9946561455726624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 7.8624086454510689e-03</internalNodes>
+          <leafValues>
+            4.6333950757980347e-01 6.2561017274856567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 -4.7343620099127293e-03</internalNodes>
+          <leafValues>
+            3.6155730485916138e-01 5.2818852663040161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 8.3048478700220585e-04</internalNodes>
+          <leafValues>
+            4.4428890943527222e-01 5.5509579181671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 7.6602199114859104e-03</internalNodes>
+          <leafValues>
+            5.1629352569580078e-01 2.6133549213409424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 -4.1048377752304077e-03</internalNodes>
+          <leafValues>
+            2.7896320819854736e-01 5.0190317630767822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 4.8512578941881657e-03</internalNodes>
+          <leafValues>
+            4.9689841270446777e-01 5.6616681814193726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 9.9896453320980072e-04</internalNodes>
+          <leafValues>
+            4.4456079602241516e-01 5.5518132448196411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -2.7023631334304810e-01</internalNodes>
+          <leafValues>
+            2.9388209804892540e-02 5.1513141393661499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 -1.3090680353343487e-02</internalNodes>
+          <leafValues>
+            5.6993997097015381e-01 4.4474598765373230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 -9.4342790544033051e-03</internalNodes>
+          <leafValues>
+            4.3054661154747009e-01 5.4878950119018555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 -1.5482039889320731e-03</internalNodes>
+          <leafValues>
+            3.6803171038627625e-01 5.1280808448791504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 5.3746132180094719e-03</internalNodes>
+          <leafValues>
+            4.8389169573783875e-01 6.1015558242797852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 1.5786769799888134e-03</internalNodes>
+          <leafValues>
+            5.3252232074737549e-01 4.1185480356216431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 3.6856050137430429e-03</internalNodes>
+          <leafValues>
+            4.8109480738639832e-01 6.2523031234741211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 9.3887019902467728e-03</internalNodes>
+          <leafValues>
+            5.2002298831939697e-01 3.6294108629226685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 1.2792630121111870e-02</internalNodes>
+          <leafValues>
+            4.9617099761962891e-01 6.7380160093307495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 -3.3661040943115950e-03</internalNodes>
+          <leafValues>
+            4.0602791309356689e-01 5.2835988998413086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 3.9771420415490866e-04</internalNodes>
+          <leafValues>
+            4.6741139888763428e-01 5.9007751941680908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1464 1.4868030557408929e-03</internalNodes>
+          <leafValues>
+            4.5191168785095215e-01 6.0820537805557251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1465 -8.8686749339103699e-02</internalNodes>
+          <leafValues>
+            2.8078991174697876e-01 5.1809918880462646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1466 -7.4296112870797515e-05</internalNodes>
+          <leafValues>
+            5.2955842018127441e-01 4.0876251459121704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1467 -1.4932939848222304e-05</internalNodes>
+          <leafValues>
+            5.4614001512527466e-01 4.5385429263114929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1468 5.9162238612771034e-03</internalNodes>
+          <leafValues>
+            5.3291612863540649e-01 4.1921341419219971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1469 1.1141640134155750e-03</internalNodes>
+          <leafValues>
+            4.5120179653167725e-01 5.7062172889709473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1470 8.9249362645205110e-05</internalNodes>
+          <leafValues>
+            4.5778059959411621e-01 5.8976382017135620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1471 2.5319510605186224e-03</internalNodes>
+          <leafValues>
+            5.2996039390563965e-01 3.3576390147209167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1472 1.2426200322806835e-02</internalNodes>
+          <leafValues>
+            4.9590590596199036e-01 1.3466019928455353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1473 2.8335750102996826e-02</internalNodes>
+          <leafValues>
+            5.1170790195465088e-01 6.1043637106195092e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1474 6.6165882162749767e-03</internalNodes>
+          <leafValues>
+            4.7363498806953430e-01 7.0116281509399414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1475 8.0468766391277313e-03</internalNodes>
+          <leafValues>
+            5.2164179086685181e-01 3.2828199863433838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1476 -1.1193980462849140e-03</internalNodes>
+          <leafValues>
+            5.8098608255386353e-01 4.5637390017509460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1477 1.3277590274810791e-02</internalNodes>
+          <leafValues>
+            5.3983622789382935e-01 4.1039010882377625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1478 4.8794739996083081e-04</internalNodes>
+          <leafValues>
+            4.2492860555648804e-01 5.4105907678604126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1479 1.1243170127272606e-02</internalNodes>
+          <leafValues>
+            5.2699637413024902e-01 3.4382158517837524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1480 -8.9896668214350939e-04</internalNodes>
+          <leafValues>
+            5.6330758333206177e-01 4.4566130638122559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1481 6.6677159629762173e-03</internalNodes>
+          <leafValues>
+            5.3128892183303833e-01 4.3626791238784790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1482 2.8947299346327782e-02</internalNodes>
+          <leafValues>
+            4.7017949819564819e-01 6.5757977962493896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1483 -2.3400049656629562e-02</internalNodes>
+          <leafValues>
+            0. 5.1373988389968872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1484 -8.9117050170898438e-02</internalNodes>
+          <leafValues>
+            2.3745279759168625e-02 4.9424308538436890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1485 -1.4054600149393082e-02</internalNodes>
+          <leafValues>
+            3.1273230910301208e-01 5.1175111532211304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1486 8.1239398568868637e-03</internalNodes>
+          <leafValues>
+            5.0090491771697998e-01 2.5200259685516357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1487 -4.9964650534093380e-03</internalNodes>
+          <leafValues>
+            6.3871437311172485e-01 4.9278119206428528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1488 3.1253970228135586e-03</internalNodes>
+          <leafValues>
+            5.1368498802185059e-01 3.6804521083831787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1489 6.7669642157852650e-03</internalNodes>
+          <leafValues>
+            5.5098438262939453e-01 4.3636319041252136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1490 -2.3711440153419971e-03</internalNodes>
+          <leafValues>
+            6.1623352766036987e-01 4.5869469642639160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1491 -5.3522791713476181e-03</internalNodes>
+          <leafValues>
+            6.1854577064514160e-01 4.9204909801483154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1492 -1.5968859195709229e-02</internalNodes>
+          <leafValues>
+            1.3826179504394531e-01 4.9832528829574585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1493 4.7676060348749161e-03</internalNodes>
+          <leafValues>
+            4.6880578994750977e-01 5.4900461435317993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1494 -2.4714691098779440e-03</internalNodes>
+          <leafValues>
+            2.3685149848461151e-01 5.0039529800415039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1495 -7.1033788844943047e-04</internalNodes>
+          <leafValues>
+            5.8563941717147827e-01 4.7215330600738525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1496 -1.4117559790611267e-01</internalNodes>
+          <leafValues>
+            8.6900062859058380e-02 4.9615910649299622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1497 1.0651809722185135e-01</internalNodes>
+          <leafValues>
+            5.1388370990753174e-01 1.7410050332546234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1498 -5.2744749933481216e-02</internalNodes>
+          <leafValues>
+            7.3536360263824463e-01 4.7728818655014038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1499 -4.7431760467588902e-03</internalNodes>
+          <leafValues>
+            3.8844060897827148e-01 5.2927017211914062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1500 9.9676765967160463e-04</internalNodes>
+          <leafValues>
+            5.2234929800033569e-01 4.0034240484237671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1501 8.0284131690859795e-03</internalNodes>
+          <leafValues>
+            4.9591061472892761e-01 7.2129642963409424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1502 8.6025858763605356e-04</internalNodes>
+          <leafValues>
+            4.4448840618133545e-01 5.5384761095046997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1503 9.3191501218825579e-04</internalNodes>
+          <leafValues>
+            5.3983712196350098e-01 4.1632440686225891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1504 -2.5082060601562262e-03</internalNodes>
+          <leafValues>
+            5.8542650938034058e-01 4.5625001192092896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1505 -2.1378761157393456e-03</internalNodes>
+          <leafValues>
+            4.6080690622329712e-01 5.2802592515945435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1506 -2.1546049974858761e-03</internalNodes>
+          <leafValues>
+            3.7911269068717957e-01 5.2559971809387207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1507 -7.6214009895920753e-03</internalNodes>
+          <leafValues>
+            5.9986090660095215e-01 4.9520739912986755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1508 2.2055360022932291e-03</internalNodes>
+          <leafValues>
+            4.4842061400413513e-01 5.5885308980941772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1509 1.2586950324475765e-03</internalNodes>
+          <leafValues>
+            5.4507470130920410e-01 4.4238409399986267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1510 -5.0926720723509789e-03</internalNodes>
+          <leafValues>
+            4.1182750463485718e-01 5.2630358934402466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1511 -2.5095739401876926e-03</internalNodes>
+          <leafValues>
+            5.7879078388214111e-01 4.9984949827194214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1512 -7.7327556908130646e-02</internalNodes>
+          <leafValues>
+            8.3978658914566040e-01 4.8111200332641602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1513 -4.1485819965600967e-02</internalNodes>
+          <leafValues>
+            2.4086110293865204e-01 5.1769930124282837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1514 1.0355669655837119e-04</internalNodes>
+          <leafValues>
+            4.3553608655929565e-01 5.4170542955398560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1515 1.3255809899419546e-03</internalNodes>
+          <leafValues>
+            5.4539710283279419e-01 4.8940950632095337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1516 -8.0598732456564903e-03</internalNodes>
+          <leafValues>
+            5.7710242271423340e-01 4.5779189467430115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1517 1.9058620557188988e-02</internalNodes>
+          <leafValues>
+            5.1698678731918335e-01 3.4004750847816467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1518 -3.5057891160249710e-02</internalNodes>
+          <leafValues>
+            2.2032439708709717e-01 5.0005030632019043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1519 5.7296059094369411e-03</internalNodes>
+          <leafValues>
+            5.0434082746505737e-01 6.5975707769393921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1520 -1.1648329906165600e-02</internalNodes>
+          <leafValues>
+            2.1862849593162537e-01 4.9966529011726379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1521 1.4544479781761765e-03</internalNodes>
+          <leafValues>
+            5.0076818466186523e-01 5.5037277936935425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1522 -2.5030909455381334e-04</internalNodes>
+          <leafValues>
+            4.1298410296440125e-01 5.2416700124740601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1523 -8.2907272735610604e-04</internalNodes>
+          <leafValues>
+            5.4128682613372803e-01 4.9744960665702820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1524 1.0862209601327777e-03</internalNodes>
+          <leafValues>
+            4.6055299043655396e-01 5.8792287111282349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1525 2.0000500080641359e-04</internalNodes>
+          <leafValues>
+            5.2788549661636353e-01 4.7052091360092163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1526 2.9212920926511288e-03</internalNodes>
+          <leafValues>
+            5.1296097040176392e-01 3.7555369734764099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1527 2.5387400761246681e-02</internalNodes>
+          <leafValues>
+            4.8226919770240784e-01 5.7907682657241821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1528 -3.1968469265848398e-03</internalNodes>
+          <leafValues>
+            5.2483952045440674e-01 3.9628401398658752e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>182</maxWeakCount>
+      <stageThreshold>9.0253349304199219e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1529 5.8031738735735416e-03</internalNodes>
+          <leafValues>
+            3.4989839792251587e-01 5.9619832038879395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1530 -9.0003069490194321e-03</internalNodes>
+          <leafValues>
+            6.8166369199752808e-01 4.4785520434379578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1531 -1.1549659539014101e-03</internalNodes>
+          <leafValues>
+            5.5857062339782715e-01 3.5782510042190552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1532 -1.1069850297644734e-03</internalNodes>
+          <leafValues>
+            5.3650361299514771e-01 3.0504280328750610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1533 1.0308309720130637e-04</internalNodes>
+          <leafValues>
+            3.6390951275825500e-01 5.3446358442306519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1534 -5.0984839908778667e-03</internalNodes>
+          <leafValues>
+            2.8591570258140564e-01 5.5042648315429688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1535 8.2572200335562229e-04</internalNodes>
+          <leafValues>
+            5.2365237474441528e-01 3.4760418534278870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1536 9.9783325567841530e-03</internalNodes>
+          <leafValues>
+            4.7503221035003662e-01 6.2196469306945801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1537 -3.7402529269456863e-02</internalNodes>
+          <leafValues>
+            3.3433759212493896e-01 5.2780628204345703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1538 4.8548257909715176e-03</internalNodes>
+          <leafValues>
+            5.1921808719635010e-01 3.7004441022872925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1539 -1.8664470408111811e-03</internalNodes>
+          <leafValues>
+            2.9298439621925354e-01 5.0919449329376221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1540 1.6888890415430069e-02</internalNodes>
+          <leafValues>
+            3.6868458986282349e-01 5.4312258958816528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1541 -5.8372621424496174e-03</internalNodes>
+          <leafValues>
+            3.6321839690208435e-01 5.2213358879089355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1542 -1.4713739510625601e-03</internalNodes>
+          <leafValues>
+            5.8706837892532349e-01 4.7006508708000183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1543 -1.1522950371727347e-03</internalNodes>
+          <leafValues>
+            3.1958949565887451e-01 5.1409542560577393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1544 -4.2560300789773464e-03</internalNodes>
+          <leafValues>
+            6.3018590211868286e-01 4.8149210214614868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1545 -6.7378291860222816e-03</internalNodes>
+          <leafValues>
+            1.9770480692386627e-01 5.0258082151412964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1546 1.1382670141756535e-02</internalNodes>
+          <leafValues>
+            4.9541321396827698e-01 6.8670457601547241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1547 5.1794708706438541e-03</internalNodes>
+          <leafValues>
+            5.1644277572631836e-01 3.3506479859352112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1548 -1.1743789911270142e-01</internalNodes>
+          <leafValues>
+            2.3152460157871246e-01 5.2344137430191040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1549 2.8703449293971062e-02</internalNodes>
+          <leafValues>
+            4.6642971038818359e-01 6.7225211858749390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1550 4.8231030814349651e-03</internalNodes>
+          <leafValues>
+            5.2208751440048218e-01 2.7235329151153564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1551 2.6798530016094446e-03</internalNodes>
+          <leafValues>
+            5.0792771577835083e-01 2.9069489240646362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1552 8.0504082143306732e-03</internalNodes>
+          <leafValues>
+            4.8859509825706482e-01 6.3950210809707642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1553 4.8054959625005722e-03</internalNodes>
+          <leafValues>
+            5.1972568035125732e-01 3.6566638946533203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1554 -2.2420159075409174e-03</internalNodes>
+          <leafValues>
+            6.1534678936004639e-01 4.7637018561363220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1555 -1.3757710345089436e-02</internalNodes>
+          <leafValues>
+            2.6373448967933655e-01 5.0309032201766968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1556 -1.0338299721479416e-01</internalNodes>
+          <leafValues>
+            2.2875219583511353e-01 5.1824611425399780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1557 -9.4432085752487183e-03</internalNodes>
+          <leafValues>
+            6.9533038139343262e-01 4.6949490904808044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1558 8.0271181650459766e-04</internalNodes>
+          <leafValues>
+            5.4506552219390869e-01 4.2687839269638062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1559 -4.1945669800043106e-03</internalNodes>
+          <leafValues>
+            6.0913878679275513e-01 4.5716428756713867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1560 1.0942210443317890e-02</internalNodes>
+          <leafValues>
+            5.2410632371902466e-01 3.2845470309257507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1561 -5.7841069065034389e-04</internalNodes>
+          <leafValues>
+            5.3879290819168091e-01 4.1793689131736755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1562 -2.0888620056211948e-03</internalNodes>
+          <leafValues>
+            4.2926910519599915e-01 5.3017157316207886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1563 3.2383969519287348e-03</internalNodes>
+          <leafValues>
+            3.7923479080200195e-01 5.2207440137863159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1564 4.9075027927756310e-03</internalNodes>
+          <leafValues>
+            5.2372831106185913e-01 4.1267579793930054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1565 -3.2277941703796387e-02</internalNodes>
+          <leafValues>
+            1.9476559758186340e-01 4.9945020675659180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1566 -8.9711230248212814e-03</internalNodes>
+          <leafValues>
+            6.0112851858139038e-01 4.9290320277214050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1567 1.5321089886128902e-02</internalNodes>
+          <leafValues>
+            5.0097537040710449e-01 2.0398220419883728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1568 2.0855569746345282e-03</internalNodes>
+          <leafValues>
+            4.8621898889541626e-01 5.7216948270797729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1569 5.0615021027624607e-03</internalNodes>
+          <leafValues>
+            5.0002187490463257e-01 1.8018059432506561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1570 -3.7174751050770283e-03</internalNodes>
+          <leafValues>
+            5.5301171541213989e-01 4.8975929617881775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1571 -1.2170500122010708e-02</internalNodes>
+          <leafValues>
+            4.1786059737205505e-01 5.3837239742279053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1572 4.6248398721218109e-03</internalNodes>
+          <leafValues>
+            4.9971699714660645e-01 5.7613271474838257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1573 -2.1040429419372231e-04</internalNodes>
+          <leafValues>
+            5.3318071365356445e-01 4.0976810455322266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1574 -1.4641780406236649e-02</internalNodes>
+          <leafValues>
+            5.7559251785278320e-01 5.0517761707305908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1575 3.3199489116668701e-03</internalNodes>
+          <leafValues>
+            4.5769768953323364e-01 6.0318058729171753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1576 3.7236879579722881e-03</internalNodes>
+          <leafValues>
+            4.3803969025611877e-01 5.4158830642700195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1577 8.2951161311939359e-04</internalNodes>
+          <leafValues>
+            5.1630318164825439e-01 3.7022191286087036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1578 -1.1408490128815174e-02</internalNodes>
+          <leafValues>
+            6.0729467868804932e-01 4.8625651001930237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1579 -4.5320121571421623e-03</internalNodes>
+          <leafValues>
+            3.2924759387969971e-01 5.0889629125595093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1580 5.1276017911732197e-03</internalNodes>
+          <leafValues>
+            4.8297679424285889e-01 6.1227089166641235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1581 9.8583158105611801e-03</internalNodes>
+          <leafValues>
+            4.6606799960136414e-01 6.5561771392822266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1582 3.6985918879508972e-02</internalNodes>
+          <leafValues>
+            5.2048492431640625e-01 1.6904720664024353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1583 4.6491161920130253e-03</internalNodes>
+          <leafValues>
+            5.1673221588134766e-01 3.7252250313758850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1584 -4.2664702050387859e-03</internalNodes>
+          <leafValues>
+            6.4064931869506836e-01 4.9873429536819458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1585 -4.7956590424291790e-04</internalNodes>
+          <leafValues>
+            5.8972930908203125e-01 4.4648739695549011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1586 3.6827160511165857e-03</internalNodes>
+          <leafValues>
+            5.4415607452392578e-01 3.4726628661155701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1587 -1.0059880092740059e-02</internalNodes>
+          <leafValues>
+            2.1431629359722137e-01 5.0048297643661499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1588 -3.0361840617842972e-04</internalNodes>
+          <leafValues>
+            5.3864240646362305e-01 4.5903238654136658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1589 -1.4545479789376259e-03</internalNodes>
+          <leafValues>
+            5.7511842250823975e-01 4.4970950484275818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1590 1.6515209572389722e-03</internalNodes>
+          <leafValues>
+            5.4219377040863037e-01 4.2385208606719971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1591 -7.8468639403581619e-03</internalNodes>
+          <leafValues>
+            4.0779209136962891e-01 5.2581572532653809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1592 -5.1259850151836872e-03</internalNodes>
+          <leafValues>
+            4.2292758822441101e-01 5.4794532060623169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1593 -3.6890961229801178e-02</internalNodes>
+          <leafValues>
+            6.5963757038116455e-01 4.6746781468391418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1594 2.4035639944486320e-04</internalNodes>
+          <leafValues>
+            4.2511358857154846e-01 5.5732029676437378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1595 -1.5150169929256663e-05</internalNodes>
+          <leafValues>
+            5.2592468261718750e-01 4.0741148591041565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1596 2.2108471021056175e-03</internalNodes>
+          <leafValues>
+            4.6717229485511780e-01 5.8863520622253418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1597 -1.1568620102480054e-03</internalNodes>
+          <leafValues>
+            5.7110661268234253e-01 4.4871619343757629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1598 4.9996292218565941e-03</internalNodes>
+          <leafValues>
+            5.2641981840133667e-01 2.8983271121978760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1599 -1.4656189596280456e-03</internalNodes>
+          <leafValues>
+            3.8917380571365356e-01 5.1978719234466553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1600 -1.1975039960816503e-03</internalNodes>
+          <leafValues>
+            5.7958728075027466e-01 4.9279558658599854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1601 -4.4954330660402775e-03</internalNodes>
+          <leafValues>
+            2.3776030540466309e-01 5.0125551223754883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1602 1.4997160178609192e-04</internalNodes>
+          <leafValues>
+            4.8766261339187622e-01 5.6176078319549561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1603 2.6391509454697371e-03</internalNodes>
+          <leafValues>
+            5.1680880784988403e-01 3.7655091285705566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1604 -2.9368131072260439e-04</internalNodes>
+          <leafValues>
+            5.4466491937637329e-01 4.8746308684349060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1605 1.4211760135367513e-03</internalNodes>
+          <leafValues>
+            4.6878978610038757e-01 6.6913318634033203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1606 7.9427637159824371e-02</internalNodes>
+          <leafValues>
+            5.1934438943862915e-01 2.7329459786415100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1607 7.9937502741813660e-02</internalNodes>
+          <leafValues>
+            4.9717310070991516e-01 1.7820839583873749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1608 1.1089259758591652e-02</internalNodes>
+          <leafValues>
+            5.1659947633743286e-01 3.2094758749008179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1609 1.6560709627810866e-04</internalNodes>
+          <leafValues>
+            4.0584719181060791e-01 5.3072762489318848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1610 -5.3354292176663876e-03</internalNodes>
+          <leafValues>
+            3.4450569748878479e-01 5.1581299304962158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1611 1.1287260567769408e-03</internalNodes>
+          <leafValues>
+            4.5948630571365356e-01 6.0755330324172974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1612 -2.1969219669699669e-02</internalNodes>
+          <leafValues>
+            1.6804009675979614e-01 5.2285957336425781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1613 -2.1775320055894554e-04</internalNodes>
+          <leafValues>
+            3.8615968823432922e-01 5.2156728506088257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1614 2.0200149447191507e-04</internalNodes>
+          <leafValues>
+            5.5179792642593384e-01 4.3630391359329224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1615 -2.1733149886131287e-02</internalNodes>
+          <leafValues>
+            7.9994601011276245e-01 4.7898510098457336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1616 -8.4399932529777288e-04</internalNodes>
+          <leafValues>
+            4.0859758853912354e-01 5.3747731447219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1617 -4.3895249837078154e-04</internalNodes>
+          <leafValues>
+            5.4704052209854126e-01 4.3661430478096008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1618 1.5092400135472417e-03</internalNodes>
+          <leafValues>
+            4.9889969825744629e-01 5.8421492576599121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1619 -3.5547839943319559e-03</internalNodes>
+          <leafValues>
+            6.7536902427673340e-01 4.7210058569908142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1620 4.8191400128416717e-04</internalNodes>
+          <leafValues>
+            5.4158538579940796e-01 4.3571090698242188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1621 -6.0264398343861103e-03</internalNodes>
+          <leafValues>
+            2.2585099935531616e-01 4.9918809533119202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1622 -1.1668140068650246e-02</internalNodes>
+          <leafValues>
+            6.2565547227859497e-01 4.9274989962577820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1623 -2.8718370012938976e-03</internalNodes>
+          <leafValues>
+            3.9477849006652832e-01 5.2458018064498901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1624 1.7051169648766518e-02</internalNodes>
+          <leafValues>
+            4.7525110840797424e-01 5.7942241430282593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1625 -1.3352080248296261e-02</internalNodes>
+          <leafValues>
+            6.0411047935485840e-01 4.5445358753204346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1626 -3.9301801007241011e-04</internalNodes>
+          <leafValues>
+            4.2582759261131287e-01 5.5449050664901733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1627 3.0483349692076445e-03</internalNodes>
+          <leafValues>
+            5.2334201335906982e-01 3.7802729010581970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1628 -4.3579288758337498e-03</internalNodes>
+          <leafValues>
+            6.3718891143798828e-01 4.8386740684509277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1629 5.6661018170416355e-03</internalNodes>
+          <leafValues>
+            5.3747057914733887e-01 4.1636660695075989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1630 6.0677339206449687e-05</internalNodes>
+          <leafValues>
+            4.6387958526611328e-01 5.3116250038146973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1631 3.6738160997629166e-02</internalNodes>
+          <leafValues>
+            4.6886560320854187e-01 6.4665240049362183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1632 8.6528137326240540e-03</internalNodes>
+          <leafValues>
+            5.2043187618255615e-01 2.1886579692363739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1633 -1.5371359884738922e-01</internalNodes>
+          <leafValues>
+            1.6303719580173492e-01 4.9588400125503540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1634 -4.1560421232134104e-04</internalNodes>
+          <leafValues>
+            5.7744592428207397e-01 4.6964588761329651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1635 -1.2640169588848948e-03</internalNodes>
+          <leafValues>
+            3.9771759510040283e-01 5.2171981334686279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1636 -3.5473341122269630e-03</internalNodes>
+          <leafValues>
+            6.0465282201766968e-01 4.8083150386810303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1637 3.0019069527043030e-05</internalNodes>
+          <leafValues>
+            3.9967238903045654e-01 5.2282011508941650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1638 1.3113019522279501e-03</internalNodes>
+          <leafValues>
+            4.7121581435203552e-01 5.7659977674484253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1639 -1.3374709524214268e-03</internalNodes>
+          <leafValues>
+            4.1095849871635437e-01 5.2531701326370239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1640 2.0876709371805191e-02</internalNodes>
+          <leafValues>
+            5.2029937505722046e-01 1.7579819262027740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1641 -7.5497948564589024e-03</internalNodes>
+          <leafValues>
+            6.5666097402572632e-01 4.6949750185012817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1642 2.4188550189137459e-02</internalNodes>
+          <leafValues>
+            5.1286739110946655e-01 3.3702209591865540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1643 -2.9358828905969858e-03</internalNodes>
+          <leafValues>
+            6.5807867050170898e-01 4.6945410966873169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1644 5.7557929307222366e-02</internalNodes>
+          <leafValues>
+            5.1464450359344482e-01 2.7752599120140076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1645 -1.1343370424583554e-03</internalNodes>
+          <leafValues>
+            3.8366019725799561e-01 5.1926672458648682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1646 1.6816999763250351e-02</internalNodes>
+          <leafValues>
+            5.0855928659439087e-01 6.1772608757019043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1647 5.0535178743302822e-03</internalNodes>
+          <leafValues>
+            5.1387631893157959e-01 3.6847919225692749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1648 -4.5874710194766521e-03</internalNodes>
+          <leafValues>
+            5.9896552562713623e-01 4.8352020978927612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1649 1.6882460331544280e-03</internalNodes>
+          <leafValues>
+            4.5094868540763855e-01 5.7230567932128906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1650 -1.6554000321775675e-03</internalNodes>
+          <leafValues>
+            3.4967708587646484e-01 5.2433192729949951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1651 -1.9373800605535507e-02</internalNodes>
+          <leafValues>
+            1.1205369979143143e-01 4.9687129259109497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1652 1.0374450124800205e-02</internalNodes>
+          <leafValues>
+            5.1481968164443970e-01 4.3952131271362305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1653 1.4973050565458834e-04</internalNodes>
+          <leafValues>
+            4.0849998593330383e-01 5.2698868513107300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1654 -4.2981930077075958e-02</internalNodes>
+          <leafValues>
+            6.3941049575805664e-01 5.0185042619705200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1655 8.3065936341881752e-03</internalNodes>
+          <leafValues>
+            4.7075539827346802e-01 6.6983532905578613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1656 -4.1285790503025055e-03</internalNodes>
+          <leafValues>
+            4.5413690805435181e-01 5.3236472606658936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1657 1.7399420030415058e-03</internalNodes>
+          <leafValues>
+            4.3339619040489197e-01 5.4398661851882935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1658 1.1739750334527344e-04</internalNodes>
+          <leafValues>
+            4.5796871185302734e-01 5.5434262752532959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1659 1.8585780344437808e-04</internalNodes>
+          <leafValues>
+            4.3246439099311829e-01 5.4267549514770508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1660 5.5587692186236382e-03</internalNodes>
+          <leafValues>
+            5.2572208642959595e-01 3.5506111383438110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1661 -7.9851560294628143e-03</internalNodes>
+          <leafValues>
+            6.0430181026458740e-01 4.6306359767913818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1662 6.0594122624024749e-04</internalNodes>
+          <leafValues>
+            4.5982548594474792e-01 5.5331951379776001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1663 -2.2983040253166109e-04</internalNodes>
+          <leafValues>
+            4.1307520866394043e-01 5.3224611282348633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1664 4.3740210821852088e-04</internalNodes>
+          <leafValues>
+            4.0430399775505066e-01 5.4092890024185181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1665 2.9482020181603730e-04</internalNodes>
+          <leafValues>
+            4.4949638843536377e-01 5.6288522481918335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1666 1.0312659665942192e-02</internalNodes>
+          <leafValues>
+            5.1775109767913818e-01 2.7043169736862183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1667 -7.7241109684109688e-03</internalNodes>
+          <leafValues>
+            1.9880190491676331e-01 4.9805539846420288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1668 -4.6797208487987518e-03</internalNodes>
+          <leafValues>
+            6.6447502374649048e-01 5.0182962417602539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1669 -5.0755459815263748e-03</internalNodes>
+          <leafValues>
+            3.8983049988746643e-01 5.1852691173553467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1670 2.2479740437120199e-03</internalNodes>
+          <leafValues>
+            4.8018088936805725e-01 5.6603360176086426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1671 8.3327008178457618e-04</internalNodes>
+          <leafValues>
+            5.2109199762344360e-01 3.9571881294250488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1672 -4.1279330849647522e-02</internalNodes>
+          <leafValues>
+            6.1545419692993164e-01 5.0070542097091675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1673 -5.0930189900100231e-04</internalNodes>
+          <leafValues>
+            3.9759421348571777e-01 5.2284038066864014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1674 1.2568780221045017e-03</internalNodes>
+          <leafValues>
+            4.9791380763053894e-01 5.9391832351684570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1675 8.0048497766256332e-03</internalNodes>
+          <leafValues>
+            4.9844971299171448e-01 1.6333660483360291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1676 -1.1879300000146031e-03</internalNodes>
+          <leafValues>
+            5.9049648046493530e-01 4.9426248669624329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1677 6.1948952497914433e-04</internalNodes>
+          <leafValues>
+            4.1995579004287720e-01 5.3287261724472046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1678 6.6829859279096127e-03</internalNodes>
+          <leafValues>
+            5.4186028242111206e-01 4.9058890342712402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1679 -3.7062340416014194e-03</internalNodes>
+          <leafValues>
+            3.7259390950202942e-01 5.1380002498626709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1680 -3.9739411324262619e-02</internalNodes>
+          <leafValues>
+            6.4789611101150513e-01 5.0503468513488770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1681 1.4085009461268783e-03</internalNodes>
+          <leafValues>
+            4.6823391318321228e-01 6.3778841495513916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1682 3.9322688826359808e-04</internalNodes>
+          <leafValues>
+            5.4585301876068115e-01 4.1504821181297302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1683 -1.8979819724336267e-03</internalNodes>
+          <leafValues>
+            3.6901599168777466e-01 5.1497042179107666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1684 -1.3970440253615379e-02</internalNodes>
+          <leafValues>
+            6.0505628585815430e-01 4.8113578557968140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1685 -1.0100819915533066e-01</internalNodes>
+          <leafValues>
+            2.0170800387859344e-01 4.9923619627952576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1686 -1.7346920445561409e-02</internalNodes>
+          <leafValues>
+            5.7131487131118774e-01 4.8994860053062439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1687 1.5619759506080300e-04</internalNodes>
+          <leafValues>
+            4.2153888940811157e-01 5.3926420211791992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1688 1.3438929617404938e-01</internalNodes>
+          <leafValues>
+            5.1361519098281860e-01 3.7676128745079041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1689 -2.4582240730524063e-02</internalNodes>
+          <leafValues>
+            7.0273578166961670e-01 4.7479069232940674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1690 -3.8553720805794001e-03</internalNodes>
+          <leafValues>
+            4.3174090981483459e-01 5.4277169704437256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1691 -2.3165249731391668e-03</internalNodes>
+          <leafValues>
+            5.9426987171173096e-01 4.6186479926109314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1692 -4.8518120311200619e-03</internalNodes>
+          <leafValues>
+            6.1915689706802368e-01 4.8848950862884521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1693 2.4699938949197531e-03</internalNodes>
+          <leafValues>
+            5.2566647529602051e-01 4.0171998739242554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1694 4.5496959239244461e-02</internalNodes>
+          <leafValues>
+            5.2378678321838379e-01 2.6857739686965942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1695 -2.0319599658250809e-02</internalNodes>
+          <leafValues>
+            2.1304459869861603e-01 4.9797388911247253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1696 2.6994998916052282e-04</internalNodes>
+          <leafValues>
+            4.8140418529510498e-01 5.5431222915649414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1697 -1.8232699949294329e-03</internalNodes>
+          <leafValues>
+            6.4825797080993652e-01 4.7099891304969788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1698 -6.3015790656208992e-03</internalNodes>
+          <leafValues>
+            4.5819279551506042e-01 5.3062361478805542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1699 -2.4139499873854220e-04</internalNodes>
+          <leafValues>
+            5.2320867776870728e-01 4.0517631173133850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1700 -1.0330369696021080e-03</internalNodes>
+          <leafValues>
+            5.5562019348144531e-01 4.7891938686370850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1701 1.8041160365100950e-04</internalNodes>
+          <leafValues>
+            5.2294427156448364e-01 4.0118101239204407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1702 -6.1407860368490219e-02</internalNodes>
+          <leafValues>
+            6.2986820936203003e-01 5.0107032060623169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1703 -6.9543913006782532e-02</internalNodes>
+          <leafValues>
+            7.2282809019088745e-01 4.7731840610504150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1704 -7.0542663335800171e-02</internalNodes>
+          <leafValues>
+            2.2695130109786987e-01 5.1825290918350220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1705 2.4423799477517605e-03</internalNodes>
+          <leafValues>
+            5.2370971441268921e-01 4.0981510281562805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1706 1.5494349645450711e-03</internalNodes>
+          <leafValues>
+            4.7737509012222290e-01 5.4680430889129639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1707 -2.3914219811558723e-02</internalNodes>
+          <leafValues>
+            7.1469759941101074e-01 4.7838249802589417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1708 -1.2453690171241760e-02</internalNodes>
+          <leafValues>
+            2.6352968811988831e-01 5.2411228418350220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1709 -2.0760179904755205e-04</internalNodes>
+          <leafValues>
+            3.6237570643424988e-01 5.1136088371276855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1710 2.9781080229440704e-05</internalNodes>
+          <leafValues>
+            4.7059321403503418e-01 5.4328018426895142e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>211</maxWeakCount>
+      <stageThreshold>1.0474919891357422e+02</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1711 1.1772749945521355e-02</internalNodes>
+          <leafValues>
+            3.8605189323425293e-01 6.4211672544479370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1712 2.7037570253014565e-02</internalNodes>
+          <leafValues>
+            4.3856549263000488e-01 6.7540389299392700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1713 -3.6419500247575343e-05</internalNodes>
+          <leafValues>
+            5.4871010780334473e-01 3.4233158826828003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1714 1.9995409529656172e-03</internalNodes>
+          <leafValues>
+            3.2305321097373962e-01 5.4003179073333740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1715 4.5278300531208515e-03</internalNodes>
+          <leafValues>
+            5.0916397571563721e-01 2.9350438714027405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1716 4.7890920541249216e-04</internalNodes>
+          <leafValues>
+            4.1781538724899292e-01 5.3440642356872559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1717 1.1720920447260141e-03</internalNodes>
+          <leafValues>
+            2.8991821408271790e-01 5.1320707798004150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1718 9.5305702416226268e-04</internalNodes>
+          <leafValues>
+            4.2801249027252197e-01 5.5608451366424561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1719 1.5099150004971307e-05</internalNodes>
+          <leafValues>
+            4.0448719263076782e-01 5.4047602415084839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1720 -6.0817901976406574e-04</internalNodes>
+          <leafValues>
+            4.2717689275741577e-01 5.5034661293029785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1721 3.3224520739167929e-03</internalNodes>
+          <leafValues>
+            3.9627239108085632e-01 5.3697347640991211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1722 -1.1037490330636501e-03</internalNodes>
+          <leafValues>
+            4.7271779179573059e-01 5.2377498149871826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1723 -1.4350269921123981e-03</internalNodes>
+          <leafValues>
+            5.6030082702636719e-01 4.2235091328620911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1724 2.0767399109899998e-03</internalNodes>
+          <leafValues>
+            5.2259171009063721e-01 4.7327259182929993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1725 -1.6412809782195836e-04</internalNodes>
+          <leafValues>
+            3.9990758895874023e-01 5.4327398538589478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1726 8.8302437216043472e-03</internalNodes>
+          <leafValues>
+            4.6783858537673950e-01 6.0273271799087524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1727 -1.0552070103585720e-02</internalNodes>
+          <leafValues>
+            3.4939670562744141e-01 5.2139747142791748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1728 -2.2731600329279900e-03</internalNodes>
+          <leafValues>
+            6.1858189105987549e-01 4.7490629553794861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1729 -8.4786332445219159e-04</internalNodes>
+          <leafValues>
+            5.2853411436080933e-01 3.8434821367263794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1730 1.2081359745934606e-03</internalNodes>
+          <leafValues>
+            5.3606408834457397e-01 3.4473359584808350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1731 2.6512730401009321e-03</internalNodes>
+          <leafValues>
+            4.5582920312881470e-01 6.1939620971679688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1732 -1.1012479662895203e-03</internalNodes>
+          <leafValues>
+            3.6802300810813904e-01 5.3276282548904419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1733 4.9561518244445324e-04</internalNodes>
+          <leafValues>
+            3.9605951309204102e-01 5.2749407291412354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1734 -4.3901771306991577e-02</internalNodes>
+          <leafValues>
+            7.0204448699951172e-01 4.9928390979766846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1735 3.4690350294113159e-02</internalNodes>
+          <leafValues>
+            5.0491642951965332e-01 2.7666029334068298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1736 -2.7442190330475569e-03</internalNodes>
+          <leafValues>
+            2.6726329326629639e-01 5.2749711275100708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1737 3.3316588960587978e-03</internalNodes>
+          <leafValues>
+            4.5794829726219177e-01 6.0011017322540283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1738 -2.0044570788741112e-02</internalNodes>
+          <leafValues>
+            3.1715941429138184e-01 5.2357178926467896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1739 1.3492030557245016e-03</internalNodes>
+          <leafValues>
+            5.2653628587722778e-01 4.0343248844146729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1740 2.9702018946409225e-03</internalNodes>
+          <leafValues>
+            5.3324568271636963e-01 4.5719841122627258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1741 6.3039981760084629e-03</internalNodes>
+          <leafValues>
+            4.5933109521865845e-01 6.0346359014511108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1742 -1.2936590239405632e-02</internalNodes>
+          <leafValues>
+            4.4379639625549316e-01 5.3729712963104248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1743 4.0148729458451271e-03</internalNodes>
+          <leafValues>
+            4.6803238987922668e-01 6.4378339052200317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1744 -2.6401679497212172e-03</internalNodes>
+          <leafValues>
+            3.7096318602561951e-01 5.3143328428268433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1745 1.3918439857661724e-02</internalNodes>
+          <leafValues>
+            4.7235551476478577e-01 7.1308088302612305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1746 -4.5087869511917233e-04</internalNodes>
+          <leafValues>
+            4.4923940300941467e-01 5.3704041242599487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1747 2.5384349282830954e-04</internalNodes>
+          <leafValues>
+            4.4068640470504761e-01 5.5144029855728149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1748 2.2710000630468130e-03</internalNodes>
+          <leafValues>
+            4.6824169158935547e-01 5.9679841995239258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1749 2.4120779708027840e-03</internalNodes>
+          <leafValues>
+            5.0793921947479248e-01 3.0185988545417786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1750 -3.6025670851813629e-05</internalNodes>
+          <leafValues>
+            5.6010371446609497e-01 4.4710969924926758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1751 -7.4905529618263245e-03</internalNodes>
+          <leafValues>
+            2.2075350582599640e-01 4.9899441003799438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1752 -1.7513120546936989e-02</internalNodes>
+          <leafValues>
+            6.5312159061431885e-01 5.0176489353179932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1753 1.4281630516052246e-01</internalNodes>
+          <leafValues>
+            4.9679630994796753e-01 1.4820620417594910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1754 5.5345268920063972e-03</internalNodes>
+          <leafValues>
+            4.8989468812942505e-01 5.9542238712310791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1755 -9.6323591424152255e-04</internalNodes>
+          <leafValues>
+            3.9271169900894165e-01 5.1960742473602295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1756 -2.0370010752230883e-03</internalNodes>
+          <leafValues>
+            5.6133252382278442e-01 4.8848581314086914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1757 1.6614829655736685e-03</internalNodes>
+          <leafValues>
+            4.4728800654411316e-01 5.5788809061050415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1758 -3.1188090797513723e-03</internalNodes>
+          <leafValues>
+            3.8405328989028931e-01 5.3974777460098267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1759 -6.4000617712736130e-03</internalNodes>
+          <leafValues>
+            5.8439838886260986e-01 4.5332181453704834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1760 3.1319601112045348e-04</internalNodes>
+          <leafValues>
+            5.4392218589782715e-01 4.2347279191017151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1761 -1.8222099170088768e-02</internalNodes>
+          <leafValues>
+            1.2884649634361267e-01 4.9584048986434937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1762 8.7969247251749039e-03</internalNodes>
+          <leafValues>
+            4.9512979388237000e-01 7.1534800529479980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1763 -4.2395070195198059e-03</internalNodes>
+          <leafValues>
+            3.9465999603271484e-01 5.1949369907379150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1764 9.7086271271109581e-03</internalNodes>
+          <leafValues>
+            4.8975038528442383e-01 6.0649001598358154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1765 -3.9934171363711357e-03</internalNodes>
+          <leafValues>
+            3.2454401254653931e-01 5.0608289241790771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1766 -1.6785059124231339e-02</internalNodes>
+          <leafValues>
+            1.5819530189037323e-01 5.2037787437438965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1767 1.8272090703248978e-02</internalNodes>
+          <leafValues>
+            4.6809351444244385e-01 6.6269791126251221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1768 5.6872838176786900e-03</internalNodes>
+          <leafValues>
+            5.2116978168487549e-01 3.5121849179267883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1769 -1.0739039862528443e-03</internalNodes>
+          <leafValues>
+            5.7683861255645752e-01 4.5298451185226440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1770 -3.7093870341777802e-03</internalNodes>
+          <leafValues>
+            4.5077630877494812e-01 5.3135812282562256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1771 -2.1110709349159151e-04</internalNodes>
+          <leafValues>
+            5.4608201980590820e-01 4.3333768844604492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1772 1.0670139454305172e-03</internalNodes>
+          <leafValues>
+            5.3718560934066772e-01 4.0783908963203430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1773 3.5943021066486835e-03</internalNodes>
+          <leafValues>
+            4.4712871313095093e-01 5.6438362598419189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1774 -5.1776031032204628e-03</internalNodes>
+          <leafValues>
+            4.4993931055068970e-01 5.2803301811218262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1775 -2.5414369883947074e-04</internalNodes>
+          <leafValues>
+            5.5161732435226440e-01 4.4077080488204956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1776 6.3522560521960258e-03</internalNodes>
+          <leafValues>
+            5.1941901445388794e-01 2.4652279913425446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1777 -4.4205080484971404e-04</internalNodes>
+          <leafValues>
+            3.8307058811187744e-01 5.1396822929382324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1778 7.4488727841526270e-04</internalNodes>
+          <leafValues>
+            4.8910909891128540e-01 5.9747868776321411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1779 -3.5116379149258137e-03</internalNodes>
+          <leafValues>
+            7.4136817455291748e-01 4.7687649726867676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1780 -1.2540910392999649e-02</internalNodes>
+          <leafValues>
+            3.6488190293312073e-01 5.2528268098831177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1781 9.4931852072477341e-03</internalNodes>
+          <leafValues>
+            5.1004928350448608e-01 3.6295869946479797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1782 1.2961150147020817e-02</internalNodes>
+          <leafValues>
+            5.2324420213699341e-01 4.3335610628128052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1783 4.7209449112415314e-03</internalNodes>
+          <leafValues>
+            4.6481490135192871e-01 6.3310527801513672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1784 -2.3119079414755106e-03</internalNodes>
+          <leafValues>
+            5.9303098917007446e-01 4.5310580730438232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1785 -2.8262299019843340e-03</internalNodes>
+          <leafValues>
+            3.8704779744148254e-01 5.2571010589599609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1786 -1.4311339473351836e-03</internalNodes>
+          <leafValues>
+            5.5225032567977905e-01 4.5618548989295959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1787 1.9378310535103083e-03</internalNodes>
+          <leafValues>
+            4.5462208986282349e-01 5.7369667291641235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1788 2.6343559147790074e-04</internalNodes>
+          <leafValues>
+            5.3457391262054443e-01 4.5718750357627869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1789 7.8257522545754910e-04</internalNodes>
+          <leafValues>
+            3.9678159356117249e-01 5.2201879024505615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1790 -1.9550440832972527e-02</internalNodes>
+          <leafValues>
+            2.8296428918838501e-01 5.2435082197189331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1791 4.3914958951063454e-04</internalNodes>
+          <leafValues>
+            4.5900669693946838e-01 5.8990901708602905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1792 2.1452000364661217e-02</internalNodes>
+          <leafValues>
+            5.2314108610153198e-01 2.8553789854049683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1793 5.8973580598831177e-04</internalNodes>
+          <leafValues>
+            4.3972569704055786e-01 5.5064219236373901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1794 -2.6157610118389130e-02</internalNodes>
+          <leafValues>
+            3.1350791454315186e-01 5.1891750097274780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1795 -1.3959860429167747e-02</internalNodes>
+          <leafValues>
+            3.2132729887962341e-01 5.0407177209854126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1796 -6.3699018210172653e-03</internalNodes>
+          <leafValues>
+            6.3875448703765869e-01 4.8495069146156311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1797 -8.5613820701837540e-03</internalNodes>
+          <leafValues>
+            2.7591320872306824e-01 5.0320190191268921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1798 9.6622901037335396e-04</internalNodes>
+          <leafValues>
+            4.6856409311294556e-01 5.8348792791366577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1799 7.6550268568098545e-04</internalNodes>
+          <leafValues>
+            5.1752072572708130e-01 3.8964220881462097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1800 -8.1833340227603912e-03</internalNodes>
+          <leafValues>
+            2.0691369473934174e-01 5.2081221342086792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1801 -9.3976939097046852e-03</internalNodes>
+          <leafValues>
+            6.1340910196304321e-01 4.6412229537963867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1802 4.8028980381786823e-03</internalNodes>
+          <leafValues>
+            5.4541081190109253e-01 4.3952199816703796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1803 -3.5680569708347321e-03</internalNodes>
+          <leafValues>
+            6.3444852828979492e-01 4.6810939908027649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1804 4.0733120404183865e-03</internalNodes>
+          <leafValues>
+            5.2926832437515259e-01 4.0156200528144836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1805 1.2568129459396005e-03</internalNodes>
+          <leafValues>
+            4.3929880857467651e-01 5.4528248310089111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1806 -2.9065010603517294e-03</internalNodes>
+          <leafValues>
+            5.8988320827484131e-01 4.8633798956871033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1807 -2.4409340694546700e-03</internalNodes>
+          <leafValues>
+            4.0693649649620056e-01 5.2474218606948853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1808 2.4830700829625130e-02</internalNodes>
+          <leafValues>
+            5.1827257871627808e-01 3.6825248599052429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1809 -4.8854008316993713e-02</internalNodes>
+          <leafValues>
+            1.3075779378414154e-01 4.9612811207771301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1810 -1.6110379947349429e-03</internalNodes>
+          <leafValues>
+            6.4210057258605957e-01 4.8726621270179749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1811 -9.7009479999542236e-02</internalNodes>
+          <leafValues>
+            4.7769349068403244e-02 4.9509888887405396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1812 1.1209240183234215e-03</internalNodes>
+          <leafValues>
+            4.6162670850753784e-01 5.3547459840774536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1813 -1.3064090162515640e-03</internalNodes>
+          <leafValues>
+            6.2618541717529297e-01 4.6388059854507446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1814 4.5771620352752507e-04</internalNodes>
+          <leafValues>
+            5.3844177722930908e-01 4.6466401219367981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1815 -6.3149951165542006e-04</internalNodes>
+          <leafValues>
+            3.8040471076965332e-01 5.1302570104598999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1816 1.4505970466416329e-04</internalNodes>
+          <leafValues>
+            4.5543101429939270e-01 5.6644618511199951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1817 -1.6474550589919090e-02</internalNodes>
+          <leafValues>
+            6.5969580411911011e-01 4.7158598899841309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1818 1.3369579799473286e-02</internalNodes>
+          <leafValues>
+            5.1954662799835205e-01 3.0359649658203125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1819 1.0271780047332868e-04</internalNodes>
+          <leafValues>
+            5.2291762828826904e-01 4.1070660948753357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1820 -5.5311559699475765e-03</internalNodes>
+          <leafValues>
+            6.3528877496719360e-01 4.9609071016311646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1821 -2.6187049224972725e-03</internalNodes>
+          <leafValues>
+            3.8245460391044617e-01 5.1409840583801270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1822 5.0834268331527710e-03</internalNodes>
+          <leafValues>
+            4.9504399299621582e-01 6.2208187580108643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1823 7.9818159341812134e-02</internalNodes>
+          <leafValues>
+            4.9523359537124634e-01 1.3224759697914124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1824 -9.9226586520671844e-02</internalNodes>
+          <leafValues>
+            7.5427287817001343e-01 5.0084167718887329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1825 -6.5174017800018191e-04</internalNodes>
+          <leafValues>
+            3.6993029713630676e-01 5.1301211118698120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1826 -1.8996849656105042e-02</internalNodes>
+          <leafValues>
+            6.6891789436340332e-01 4.9212029576301575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1827 1.7346899956464767e-02</internalNodes>
+          <leafValues>
+            4.9833008646965027e-01 1.8591980636119843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1828 5.5082101607695222e-04</internalNodes>
+          <leafValues>
+            4.5744240283966064e-01 5.5221217870712280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1829 2.0056050270795822e-03</internalNodes>
+          <leafValues>
+            5.1317447423934937e-01 3.8564699888229370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1830 -7.7688191086053848e-03</internalNodes>
+          <leafValues>
+            4.3617001175880432e-01 5.4343092441558838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1831 5.0878278911113739e-02</internalNodes>
+          <leafValues>
+            4.6827208995819092e-01 6.8406397104263306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1832 -2.2901780903339386e-03</internalNodes>
+          <leafValues>
+            4.3292450904846191e-01 5.3060990571975708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1833 -1.5715380141045898e-04</internalNodes>
+          <leafValues>
+            5.3700572252273560e-01 4.3781641125679016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1834 1.0519240051507950e-01</internalNodes>
+          <leafValues>
+            5.1372742652893066e-01 6.7361466586589813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1835 2.7198919560760260e-03</internalNodes>
+          <leafValues>
+            4.1120609641075134e-01 5.2556651830673218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1836 4.8337779939174652e-02</internalNodes>
+          <leafValues>
+            5.4046237468719482e-01 4.4389671087265015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1837 9.5703761326149106e-04</internalNodes>
+          <leafValues>
+            4.3559691309928894e-01 5.3995108604431152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1838 -2.5371259078383446e-02</internalNodes>
+          <leafValues>
+            5.9951752424240112e-01 5.0310248136520386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1839 5.2457951009273529e-02</internalNodes>
+          <leafValues>
+            4.9502879381179810e-01 1.3983510434627533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1840 -1.2365629896521568e-02</internalNodes>
+          <leafValues>
+            6.3972991704940796e-01 4.9641060829162598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1841 -1.4589719474315643e-01</internalNodes>
+          <leafValues>
+            1.0016699880361557e-01 4.9463221430778503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1842 -1.5908600762486458e-02</internalNodes>
+          <leafValues>
+            3.3123299479484558e-01 5.2083408832550049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1843 3.9486068999394774e-04</internalNodes>
+          <leafValues>
+            4.4063639640808105e-01 5.4261028766632080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1844 -5.2454001270234585e-03</internalNodes>
+          <leafValues>
+            2.7995899319648743e-01 5.1899671554565430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1845 -5.0421799533069134e-03</internalNodes>
+          <leafValues>
+            6.9875800609588623e-01 4.7521421313285828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1846 2.9812189750373363e-03</internalNodes>
+          <leafValues>
+            4.9832889437675476e-01 6.3074797391891479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1847 -7.2884308174252510e-03</internalNodes>
+          <leafValues>
+            2.9823330044746399e-01 5.0268697738647461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1848 1.5094350092113018e-03</internalNodes>
+          <leafValues>
+            5.3084421157836914e-01 3.8329708576202393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1849 -9.3340799212455750e-03</internalNodes>
+          <leafValues>
+            2.0379640161991119e-01 4.9698171019554138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1850 2.8667140752077103e-02</internalNodes>
+          <leafValues>
+            5.0256967544555664e-01 6.9280272722244263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1851 1.7019680142402649e-01</internalNodes>
+          <leafValues>
+            4.9600529670715332e-01 1.4764429628849030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1852 -3.2614478841423988e-03</internalNodes>
+          <leafValues>
+            5.6030637025833130e-01 4.8260560631752014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1853 5.5769277969375253e-04</internalNodes>
+          <leafValues>
+            5.2055621147155762e-01 4.1296330094337463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1854 3.6258339881896973e-01</internalNodes>
+          <leafValues>
+            5.2216529846191406e-01 3.7686121463775635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1855 -1.1615130119025707e-02</internalNodes>
+          <leafValues>
+            6.0226827859878540e-01 4.6374899148941040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1856 -4.0795197710394859e-03</internalNodes>
+          <leafValues>
+            4.0704470872879028e-01 5.3374791145324707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1857 5.7204300537705421e-04</internalNodes>
+          <leafValues>
+            4.6018350124359131e-01 5.9003931283950806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1858 6.7543348995968699e-04</internalNodes>
+          <leafValues>
+            5.3982520103454590e-01 4.3454289436340332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1859 6.3295697327703238e-04</internalNodes>
+          <leafValues>
+            5.2015632390975952e-01 4.0513589978218079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1860 1.2435320531949401e-03</internalNodes>
+          <leafValues>
+            4.6423879265785217e-01 5.5474412441253662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1861 -4.7363857738673687e-03</internalNodes>
+          <leafValues>
+            6.1985671520233154e-01 4.6725520491600037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1862 -6.4658462069928646e-03</internalNodes>
+          <leafValues>
+            6.8373328447341919e-01 5.0190007686614990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1863 3.5017321351915598e-04</internalNodes>
+          <leafValues>
+            4.3448030948638916e-01 5.3636229038238525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1864 1.5754920605104417e-04</internalNodes>
+          <leafValues>
+            4.7600790858268738e-01 5.7320207357406616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1865 9.9774366244673729e-03</internalNodes>
+          <leafValues>
+            5.0909858942031860e-01 3.6350399255752563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1866 -4.1464529931545258e-04</internalNodes>
+          <leafValues>
+            5.5700647830963135e-01 4.5938020944595337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1867 -3.5888899583369493e-04</internalNodes>
+          <leafValues>
+            5.3568458557128906e-01 4.3391349911689758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1868 4.0463250479660928e-04</internalNodes>
+          <leafValues>
+            4.4398030638694763e-01 5.4367768764495850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1869 -8.2184787606820464e-04</internalNodes>
+          <leafValues>
+            4.0422949194908142e-01 5.1762992143630981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1870 5.9467419050633907e-03</internalNodes>
+          <leafValues>
+            4.9276518821716309e-01 5.6337797641754150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1871 -2.1753389388322830e-02</internalNodes>
+          <leafValues>
+            8.0062937736511230e-01 4.8008409142494202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1872 -1.4540379866957664e-02</internalNodes>
+          <leafValues>
+            3.9460548758506775e-01 5.1822227239608765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1873 -4.0510769933462143e-02</internalNodes>
+          <leafValues>
+            2.1324990317225456e-02 4.9357929825782776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1874 -5.8458268176764250e-04</internalNodes>
+          <leafValues>
+            4.0127959847450256e-01 5.3140252828598022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1875 5.5151800625026226e-03</internalNodes>
+          <leafValues>
+            4.6424189209938049e-01 5.8962607383728027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1876 -6.0626221820712090e-03</internalNodes>
+          <leafValues>
+            6.5021592378616333e-01 5.0164777040481567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1877 9.4535842537879944e-02</internalNodes>
+          <leafValues>
+            5.2647089958190918e-01 4.1268271207809448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1878 4.7315051779150963e-03</internalNodes>
+          <leafValues>
+            4.8791998624801636e-01 5.8924478292465210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1879 -5.2571471314877272e-04</internalNodes>
+          <leafValues>
+            3.9172801375389099e-01 5.1894128322601318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1880 -2.5464049540460110e-03</internalNodes>
+          <leafValues>
+            5.8375990390777588e-01 4.9857059121131897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1881 -2.6075689122080803e-02</internalNodes>
+          <leafValues>
+            1.2619839608669281e-01 4.9558219313621521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1882 -5.4779709316790104e-03</internalNodes>
+          <leafValues>
+            5.7225137948989868e-01 5.0102657079696655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1883 5.1337741315364838e-03</internalNodes>
+          <leafValues>
+            5.2732622623443604e-01 4.2263761162757874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1884 4.7944980906322598e-04</internalNodes>
+          <leafValues>
+            4.4500669836997986e-01 5.8195871114730835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1885 -2.1114079281687737e-03</internalNodes>
+          <leafValues>
+            5.7576531171798706e-01 4.5117148756980896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1886 -1.3179990462958813e-02</internalNodes>
+          <leafValues>
+            1.8843810260295868e-01 5.1607340574264526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1887 -4.7968099825084209e-03</internalNodes>
+          <leafValues>
+            6.5897899866104126e-01 4.7361189126968384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1888 6.7483168095350266e-03</internalNodes>
+          <leafValues>
+            5.2594298124313354e-01 3.3563950657844543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1889 1.4623369788751006e-03</internalNodes>
+          <leafValues>
+            5.3552711009979248e-01 4.2640921473503113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1890 4.7645159065723419e-03</internalNodes>
+          <leafValues>
+            5.0344067811965942e-01 5.7868278026580811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1891 6.8066660314798355e-03</internalNodes>
+          <leafValues>
+            4.7566050291061401e-01 6.6778290271759033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1892 3.6608621012419462e-03</internalNodes>
+          <leafValues>
+            5.3696119785308838e-01 4.3115469813346863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1893 2.1449640393257141e-02</internalNodes>
+          <leafValues>
+            4.9686419963836670e-01 1.8888160586357117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1894 4.1678901761770248e-03</internalNodes>
+          <leafValues>
+            4.9307331442832947e-01 5.8153688907623291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1895 8.6467564105987549e-03</internalNodes>
+          <leafValues>
+            5.2052050828933716e-01 4.1325950622558594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1896 -3.6114078829996288e-04</internalNodes>
+          <leafValues>
+            5.4835551977157593e-01 4.8009279370307922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1897 1.0808729566633701e-03</internalNodes>
+          <leafValues>
+            4.6899020671844482e-01 6.0414212942123413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1898 5.7719959877431393e-03</internalNodes>
+          <leafValues>
+            5.1711422204971313e-01 3.0532771348953247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1899 1.5720770461484790e-03</internalNodes>
+          <leafValues>
+            5.2199780941009521e-01 4.1788038611412048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1900 -1.9307859474793077e-03</internalNodes>
+          <leafValues>
+            5.8603698015213013e-01 4.8129200935363770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1901 -7.8926272690296173e-03</internalNodes>
+          <leafValues>
+            1.7492769658565521e-01 4.9717339873313904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1902 -2.2224679123610258e-03</internalNodes>
+          <leafValues>
+            4.3425890803337097e-01 5.2128481864929199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1903 1.9011989934369922e-03</internalNodes>
+          <leafValues>
+            4.7651869058609009e-01 6.8920552730560303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1904 2.7576119173318148e-03</internalNodes>
+          <leafValues>
+            5.2621912956237793e-01 4.3374860286712646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1905 5.1787449046969414e-03</internalNodes>
+          <leafValues>
+            4.8040691018104553e-01 7.8437292575836182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1906 -9.0273341629654169e-04</internalNodes>
+          <leafValues>
+            4.1208469867706299e-01 5.3534239530563354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1907 5.1797959022223949e-03</internalNodes>
+          <leafValues>
+            4.7403728961944580e-01 6.4259600639343262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1908 -1.0114000178873539e-02</internalNodes>
+          <leafValues>
+            2.4687920510768890e-01 5.1750177145004272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1909 -1.8617060035467148e-02</internalNodes>
+          <leafValues>
+            5.7562941312789917e-01 4.6289789676666260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1910 5.9225959703326225e-03</internalNodes>
+          <leafValues>
+            5.1696258783340454e-01 3.2142710685729980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1911 -6.2945079989731312e-03</internalNodes>
+          <leafValues>
+            3.8720148801803589e-01 5.1416367292404175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1912 6.5353019163012505e-03</internalNodes>
+          <leafValues>
+            4.8530489206314087e-01 6.3104897737503052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1913 1.0878399480134249e-03</internalNodes>
+          <leafValues>
+            5.1173150539398193e-01 3.7232589721679688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1914 -2.2542240098118782e-02</internalNodes>
+          <leafValues>
+            5.6927400827407837e-01 4.8871129751205444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1915 -3.0065660830587149e-03</internalNodes>
+          <leafValues>
+            2.5560128688812256e-01 5.0039929151535034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1916 7.4741272255778313e-03</internalNodes>
+          <leafValues>
+            4.8108729720115662e-01 5.6759268045425415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1917 2.6162320747971535e-02</internalNodes>
+          <leafValues>
+            4.9711948633193970e-01 1.7772370576858521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1918 9.4352738233283162e-04</internalNodes>
+          <leafValues>
+            4.9400109052658081e-01 5.4912507534027100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1919 3.3363241702318192e-02</internalNodes>
+          <leafValues>
+            5.0076121091842651e-01 2.7907240390777588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1920 -1.5118650160729885e-02</internalNodes>
+          <leafValues>
+            7.0595788955688477e-01 4.9730318784713745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1921 9.8648946732282639e-04</internalNodes>
+          <leafValues>
+            5.1286202669143677e-01 3.7767618894577026e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>213</maxWeakCount>
+      <stageThreshold>1.0576110076904297e+02</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1922 -9.5150798559188843e-02</internalNodes>
+          <leafValues>
+            6.4707571268081665e-01 4.0172868967056274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1923 6.2702340073883533e-03</internalNodes>
+          <leafValues>
+            3.9998221397399902e-01 5.7464492321014404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1924 3.0018089455552399e-04</internalNodes>
+          <leafValues>
+            3.5587701201438904e-01 5.5388098955154419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1925 1.1757409665733576e-03</internalNodes>
+          <leafValues>
+            4.2565348744392395e-01 5.3826177120208740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1926 4.4235268433112651e-05</internalNodes>
+          <leafValues>
+            3.6829081177711487e-01 5.5899268388748169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1927 -2.9936920327600092e-05</internalNodes>
+          <leafValues>
+            5.4524701833724976e-01 4.0203678607940674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1928 3.0073199886828661e-03</internalNodes>
+          <leafValues>
+            5.2390581369400024e-01 3.3178439736366272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1929 -1.0513889603316784e-02</internalNodes>
+          <leafValues>
+            4.3206891417503357e-01 5.3079837560653687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1930 8.3476826548576355e-03</internalNodes>
+          <leafValues>
+            4.5046371221542358e-01 6.4532989263534546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1931 -3.1492270063608885e-03</internalNodes>
+          <leafValues>
+            4.3134251236915588e-01 5.3705251216888428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1932 -1.4435649973165710e-05</internalNodes>
+          <leafValues>
+            5.3266030550003052e-01 3.8179719448089600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1933 -4.2855090578086674e-04</internalNodes>
+          <leafValues>
+            4.3051639199256897e-01 5.3820097446441650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1934 1.5062429883982986e-04</internalNodes>
+          <leafValues>
+            4.2359709739685059e-01 5.5449652671813965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1935 7.1559831500053406e-02</internalNodes>
+          <leafValues>
+            5.3030598163604736e-01 2.6788029074668884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1936 8.4095180500298738e-04</internalNodes>
+          <leafValues>
+            3.5571089386940002e-01 5.2054339647293091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1937 6.2986500561237335e-02</internalNodes>
+          <leafValues>
+            5.2253627777099609e-01 2.8613761067390442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1938 -3.3798629883676767e-03</internalNodes>
+          <leafValues>
+            3.6241859197616577e-01 5.2016979455947876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1939 -1.1810739670181647e-04</internalNodes>
+          <leafValues>
+            5.4744768142700195e-01 3.9598938822746277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1940 -5.4505601292476058e-04</internalNodes>
+          <leafValues>
+            3.7404221296310425e-01 5.2157157659530640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1941 -1.8454910023137927e-03</internalNodes>
+          <leafValues>
+            5.8930522203445435e-01 4.5844489336013794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1942 -4.3832371011376381e-04</internalNodes>
+          <leafValues>
+            4.0845820307731628e-01 5.3853511810302734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1943 -2.4000830017030239e-03</internalNodes>
+          <leafValues>
+            3.7774550914764404e-01 5.2935802936553955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1944 -9.8795741796493530e-02</internalNodes>
+          <leafValues>
+            2.9636120796203613e-01 5.0700891017913818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1945 3.1798239797353745e-03</internalNodes>
+          <leafValues>
+            4.8776328563690186e-01 6.7264437675476074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1946 3.2406419632025063e-04</internalNodes>
+          <leafValues>
+            4.3669110536575317e-01 5.5611097812652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1947 -3.2547250390052795e-02</internalNodes>
+          <leafValues>
+            3.1281578540802002e-01 5.3086161613464355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1948 -7.7561130747199059e-03</internalNodes>
+          <leafValues>
+            6.5602248907089233e-01 4.6398720145225525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1949 1.6027249395847321e-02</internalNodes>
+          <leafValues>
+            5.1726800203323364e-01 3.1418979167938232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1950 7.1002350523485802e-06</internalNodes>
+          <leafValues>
+            4.0844461321830750e-01 5.3362947702407837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1951 7.3422808200120926e-03</internalNodes>
+          <leafValues>
+            4.9669221043586731e-01 6.6034650802612305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1952 -1.6970280557870865e-03</internalNodes>
+          <leafValues>
+            5.9082370996475220e-01 4.5001828670501709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1953 2.4118260480463505e-03</internalNodes>
+          <leafValues>
+            5.3151607513427734e-01 3.5997208952903748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1954 -5.5300937965512276e-03</internalNodes>
+          <leafValues>
+            2.3340409994125366e-01 4.9968141317367554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1955 -2.6478730142116547e-03</internalNodes>
+          <leafValues>
+            5.8809357881546021e-01 4.6847340464591980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1956 1.1295629665255547e-02</internalNodes>
+          <leafValues>
+            4.9837771058082581e-01 1.8845909833908081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1957 -6.6952878842130303e-04</internalNodes>
+          <leafValues>
+            5.8721381425857544e-01 4.7990199923515320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1958 1.4410680159926414e-03</internalNodes>
+          <leafValues>
+            5.1311892271041870e-01 3.5010111331939697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1959 2.4637870956212282e-03</internalNodes>
+          <leafValues>
+            5.3393721580505371e-01 4.1176390647888184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1960 3.3114518737420440e-04</internalNodes>
+          <leafValues>
+            4.3133831024169922e-01 5.3982460498809814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1961 -3.3557269722223282e-02</internalNodes>
+          <leafValues>
+            2.6753368973731995e-01 5.1791548728942871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1962 1.8539419397711754e-02</internalNodes>
+          <leafValues>
+            4.9738699197769165e-01 2.3171770572662354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1963 -2.9698139405809343e-04</internalNodes>
+          <leafValues>
+            5.5297082662582397e-01 4.6436640620231628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1964 -4.5577259152196348e-04</internalNodes>
+          <leafValues>
+            5.6295841932296753e-01 4.4691911339759827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1965 -1.0158980265259743e-02</internalNodes>
+          <leafValues>
+            6.7062127590179443e-01 4.9259188771247864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1966 -2.2413829356082715e-05</internalNodes>
+          <leafValues>
+            5.2394217252731323e-01 3.9129018783569336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1967 7.2034963523037732e-05</internalNodes>
+          <leafValues>
+            4.7994381189346313e-01 5.5017888545989990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1968 -6.9267209619283676e-03</internalNodes>
+          <leafValues>
+            6.9300097227096558e-01 4.6980848908424377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1969 -7.6997838914394379e-03</internalNodes>
+          <leafValues>
+            4.0996238589286804e-01 5.4808831214904785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1970 -7.3130549862980843e-03</internalNodes>
+          <leafValues>
+            3.2834759354591370e-01 5.0578862428665161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1971 1.9650589674711227e-03</internalNodes>
+          <leafValues>
+            4.9780470132827759e-01 6.3982498645782471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1972 7.1647600270807743e-03</internalNodes>
+          <leafValues>
+            4.6611601114273071e-01 6.2221372127532959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1973 -2.4078639224171638e-02</internalNodes>
+          <leafValues>
+            2.3346449434757233e-01 5.2221620082855225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1974 -2.1027969196438789e-02</internalNodes>
+          <leafValues>
+            1.1836539953947067e-01 4.9382260441780090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1975 3.6017020465806127e-04</internalNodes>
+          <leafValues>
+            5.3250199556350708e-01 4.1167110204696655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1976 -1.7219729721546173e-02</internalNodes>
+          <leafValues>
+            6.2787622213363647e-01 4.6642690896987915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1977 -7.8672142699360847e-03</internalNodes>
+          <leafValues>
+            3.4034150838851929e-01 5.2497369050979614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1978 -4.4777389848604798e-04</internalNodes>
+          <leafValues>
+            3.6104118824005127e-01 5.0862592458724976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1979 5.5486010387539864e-03</internalNodes>
+          <leafValues>
+            4.8842659592628479e-01 6.2034982442855835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1980 -6.9461148232221603e-03</internalNodes>
+          <leafValues>
+            2.6259300112724304e-01 5.0110971927642822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1981 1.3569870498031378e-04</internalNodes>
+          <leafValues>
+            4.3407949805259705e-01 5.6283122301101685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1982 -4.5880250632762909e-02</internalNodes>
+          <leafValues>
+            6.5079987049102783e-01 4.6962749958038330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1983 -2.1582560613751411e-02</internalNodes>
+          <leafValues>
+            3.8265028595924377e-01 5.2876168489456177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1984 -2.0209539681673050e-02</internalNodes>
+          <leafValues>
+            3.2333680987358093e-01 5.0744771957397461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1985 5.8496710844337940e-03</internalNodes>
+          <leafValues>
+            5.1776039600372314e-01 4.4896709918975830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1986 -5.7476379879517481e-05</internalNodes>
+          <leafValues>
+            4.0208509564399719e-01 5.2463638782501221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1987 -1.1513100471347570e-03</internalNodes>
+          <leafValues>
+            6.3150721788406372e-01 4.9051541090011597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1988 1.9862831104546785e-03</internalNodes>
+          <leafValues>
+            4.7024598717689514e-01 6.4971512556076050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1989 -5.2719512023031712e-03</internalNodes>
+          <leafValues>
+            3.6503839492797852e-01 5.2276527881622314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1990 1.2662699446082115e-03</internalNodes>
+          <leafValues>
+            5.1661008596420288e-01 3.8776180148124695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1991 -6.2919440679252148e-03</internalNodes>
+          <leafValues>
+            7.3758941888809204e-01 5.0238478183746338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1992 6.7360111279413104e-04</internalNodes>
+          <leafValues>
+            4.4232261180877686e-01 5.4955857992172241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1993 -1.0523450328037143e-03</internalNodes>
+          <leafValues>
+            5.9763962030410767e-01 4.8595830798149109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1994 -4.4216238893568516e-04</internalNodes>
+          <leafValues>
+            5.9559392929077148e-01 4.3989309668540955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1995 1.1747940443456173e-03</internalNodes>
+          <leafValues>
+            5.3498882055282593e-01 4.6050581336021423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1996 5.2457437850534916e-03</internalNodes>
+          <leafValues>
+            5.0491911172866821e-01 2.9415771365165710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1997 -2.4539720267057419e-02</internalNodes>
+          <leafValues>
+            2.5501778721809387e-01 5.2185869216918945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1998 7.3793041519820690e-04</internalNodes>
+          <leafValues>
+            4.4248610734939575e-01 5.4908162355422974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1999 1.4233799884095788e-03</internalNodes>
+          <leafValues>
+            5.3195142745971680e-01 4.0813559293746948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2000 -2.4149110540747643e-03</internalNodes>
+          <leafValues>
+            4.0876591205596924e-01 5.2389502525329590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2001 -1.2165299849584699e-03</internalNodes>
+          <leafValues>
+            5.6745791435241699e-01 4.9080529808998108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2002 -1.2438809499144554e-03</internalNodes>
+          <leafValues>
+            4.1294258832931519e-01 5.2561181783676147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2003 6.1942739412188530e-03</internalNodes>
+          <leafValues>
+            5.0601941347122192e-01 7.3136532306671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2004 -1.6607169527560472e-03</internalNodes>
+          <leafValues>
+            5.9796321392059326e-01 4.5963698625564575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2005 -2.7316259220242500e-02</internalNodes>
+          <leafValues>
+            4.1743651032447815e-01 5.3088420629501343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2006 -1.5845570014789701e-03</internalNodes>
+          <leafValues>
+            5.6158047914505005e-01 4.5194861292839050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2007 -1.5514739789068699e-03</internalNodes>
+          <leafValues>
+            4.0761870145797729e-01 5.3607851266860962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2008 3.8446558755822480e-04</internalNodes>
+          <leafValues>
+            4.3472939729690552e-01 5.4304420948028564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2009 -1.4672259800136089e-02</internalNodes>
+          <leafValues>
+            1.6593049466609955e-01 5.1460939645767212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2010 8.1608882173895836e-03</internalNodes>
+          <leafValues>
+            4.9618190526962280e-01 1.8847459554672241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2011 1.1121659772470593e-03</internalNodes>
+          <leafValues>
+            4.8682639002799988e-01 6.0938161611557007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2012 -7.2603770531713963e-03</internalNodes>
+          <leafValues>
+            6.2843251228332520e-01 4.6903759241104126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2013 -2.4046430189628154e-04</internalNodes>
+          <leafValues>
+            5.5750000476837158e-01 4.0460440516471863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2014 -2.3348190006799996e-04</internalNodes>
+          <leafValues>
+            4.1157621145248413e-01 5.2528482675552368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2015 5.5736480280756950e-03</internalNodes>
+          <leafValues>
+            4.7300729155540466e-01 5.6901007890701294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2016 3.0623769387602806e-02</internalNodes>
+          <leafValues>
+            4.9718868732452393e-01 1.7400950193405151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2017 9.2074798885732889e-04</internalNodes>
+          <leafValues>
+            5.3721177577972412e-01 4.3548721075057983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2018 -4.3550739064812660e-05</internalNodes>
+          <leafValues>
+            5.3668838739395142e-01 4.3473169207572937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2019 -6.6452710889279842e-03</internalNodes>
+          <leafValues>
+            3.4355181455612183e-01 5.1605331897735596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2020 4.3221998959779739e-02</internalNodes>
+          <leafValues>
+            4.7667920589447021e-01 7.2936528921127319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2021 2.2331769578158855e-03</internalNodes>
+          <leafValues>
+            5.0293159484863281e-01 5.6331712007522583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2022 3.1829739455133677e-03</internalNodes>
+          <leafValues>
+            4.0160921216011047e-01 5.1921367645263672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2023 -1.8027749320026487e-04</internalNodes>
+          <leafValues>
+            4.0883159637451172e-01 5.4179197549819946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2024 -5.2934689447283745e-03</internalNodes>
+          <leafValues>
+            4.0756770968437195e-01 5.2435618638992310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2025 1.2750959722325206e-03</internalNodes>
+          <leafValues>
+            4.9132829904556274e-01 6.3870108127593994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2026 4.3385322205722332e-03</internalNodes>
+          <leafValues>
+            5.0316721200942993e-01 2.9473468661308289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2027 8.5250744596123695e-03</internalNodes>
+          <leafValues>
+            4.9497890472412109e-01 6.3088691234588623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2028 -9.4266352243721485e-04</internalNodes>
+          <leafValues>
+            5.3283667564392090e-01 4.2856499552726746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2029 1.3609660090878606e-03</internalNodes>
+          <leafValues>
+            4.9915251135826111e-01 5.9415012598037720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2030 4.4782509212382138e-04</internalNodes>
+          <leafValues>
+            4.5735040307044983e-01 5.8544808626174927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2031 1.3360050506889820e-03</internalNodes>
+          <leafValues>
+            4.6043589711189270e-01 5.8490520715713501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2032 -6.0967548051849008e-04</internalNodes>
+          <leafValues>
+            3.9693889021873474e-01 5.2294230461120605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2033 -2.3656780831515789e-03</internalNodes>
+          <leafValues>
+            5.8083200454711914e-01 4.8983570933341980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2034 1.0734340175986290e-03</internalNodes>
+          <leafValues>
+            4.3512108922004700e-01 5.4700392484664917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2035 2.1923359017819166e-03</internalNodes>
+          <leafValues>
+            5.3550601005554199e-01 3.8429039716720581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2036 5.4968618787825108e-03</internalNodes>
+          <leafValues>
+            5.0181388854980469e-01 2.8271919488906860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2037 -7.5368821620941162e-02</internalNodes>
+          <leafValues>
+            1.2250760197639465e-01 5.1488268375396729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2038 2.5134470313787460e-02</internalNodes>
+          <leafValues>
+            4.7317668795585632e-01 7.0254462957382202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2039 -2.9358599931583740e-05</internalNodes>
+          <leafValues>
+            5.4305320978164673e-01 4.6560868620872498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2040 -5.8355910005047917e-04</internalNodes>
+          <leafValues>
+            4.0310400724411011e-01 5.1901197433471680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2041 -2.6639450807124376e-03</internalNodes>
+          <leafValues>
+            4.3081268668174744e-01 5.1617711782455444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2042 -1.3804089976474643e-03</internalNodes>
+          <leafValues>
+            6.2198299169540405e-01 4.6955159306526184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2043 1.2313219485804439e-03</internalNodes>
+          <leafValues>
+            5.3793638944625854e-01 4.4258311390876770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2044 -1.4644179827882908e-05</internalNodes>
+          <leafValues>
+            5.2816402912139893e-01 4.2225030064582825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2045 -1.2818809598684311e-02</internalNodes>
+          <leafValues>
+            2.5820928812026978e-01 5.1799327135086060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2046 2.2852189838886261e-02</internalNodes>
+          <leafValues>
+            4.7786930203437805e-01 7.6092642545700073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2047 8.2305970136076212e-04</internalNodes>
+          <leafValues>
+            5.3409922122955322e-01 4.6717241406440735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2048 1.2770120054483414e-02</internalNodes>
+          <leafValues>
+            4.9657610058784485e-01 1.4723660051822662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2049 -5.0051510334014893e-02</internalNodes>
+          <leafValues>
+            6.4149940013885498e-01 5.0165921449661255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2050 1.5775270760059357e-02</internalNodes>
+          <leafValues>
+            4.5223200321197510e-01 5.6853622198104858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2051 -1.8501620739698410e-02</internalNodes>
+          <leafValues>
+            2.7647489309310913e-01 5.1379591226577759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2052 2.4626250378787518e-03</internalNodes>
+          <leafValues>
+            5.1419419050216675e-01 3.7954080104827881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2053 6.2916167080402374e-02</internalNodes>
+          <leafValues>
+            5.0606489181518555e-01 6.5804338455200195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2054 -2.1648500478477217e-05</internalNodes>
+          <leafValues>
+            5.1953881978988647e-01 4.0198868513107300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2055 2.1180990152060986e-03</internalNodes>
+          <leafValues>
+            4.9623650312423706e-01 5.9544587135314941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2056 -1.6634890809655190e-02</internalNodes>
+          <leafValues>
+            3.7579330801963806e-01 5.1754468679428101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2057 -2.8899470344185829e-03</internalNodes>
+          <leafValues>
+            6.6240137815475464e-01 5.0571787357330322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2058 7.6783262193202972e-02</internalNodes>
+          <leafValues>
+            4.7957968711853027e-01 8.0477148294448853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2059 3.9170677773654461e-03</internalNodes>
+          <leafValues>
+            4.9378821253776550e-01 5.7199418544769287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2060 -7.2670601308345795e-02</internalNodes>
+          <leafValues>
+            5.3894560784101486e-02 4.9439039826393127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2061 5.4039502143859863e-01</internalNodes>
+          <leafValues>
+            5.1297742128372192e-01 1.1433389782905579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2062 2.9510019812732935e-03</internalNodes>
+          <leafValues>
+            4.5283439755439758e-01 5.6985741853713989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2063 3.4508369863033295e-03</internalNodes>
+          <leafValues>
+            5.3577268123626709e-01 4.2187309265136719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2064 -4.2077939724549651e-04</internalNodes>
+          <leafValues>
+            5.9161728620529175e-01 4.6379259228706360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2065 3.3051050268113613e-03</internalNodes>
+          <leafValues>
+            5.2733850479125977e-01 4.3820428848266602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2066 4.7735060798004270e-04</internalNodes>
+          <leafValues>
+            4.0465280413627625e-01 5.1818847656250000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2067 -2.5928510352969170e-02</internalNodes>
+          <leafValues>
+            7.4522358179092407e-01 5.0893861055374146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2068 -2.9729790985584259e-03</internalNodes>
+          <leafValues>
+            3.2954359054565430e-01 5.0587952136993408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2069 5.8508329093456268e-03</internalNodes>
+          <leafValues>
+            4.8571440577507019e-01 5.7930248975753784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2070 -4.5967519283294678e-02</internalNodes>
+          <leafValues>
+            4.3127310276031494e-01 5.3806531429290771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2071 1.5585960447788239e-01</internalNodes>
+          <leafValues>
+            5.1961702108383179e-01 1.6847139596939087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2072 1.5164829790592194e-02</internalNodes>
+          <leafValues>
+            4.7357571125030518e-01 6.7350268363952637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2073 -1.0604249546304345e-03</internalNodes>
+          <leafValues>
+            5.8229267597198486e-01 4.7757029533386230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2074 6.6476291976869106e-03</internalNodes>
+          <leafValues>
+            4.9991989135742188e-01 2.3195350170135498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2075 -1.2231130152940750e-02</internalNodes>
+          <leafValues>
+            4.7508931159973145e-01 5.2629822492599487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2076 5.6528882123529911e-03</internalNodes>
+          <leafValues>
+            5.0697678327560425e-01 3.5618188977241516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2077 1.2977829901501536e-03</internalNodes>
+          <leafValues>
+            4.8756939172744751e-01 5.6190627813339233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2078 1.0781589895486832e-02</internalNodes>
+          <leafValues>
+            4.7507700324058533e-01 6.7823082208633423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2079 2.8654779307544231e-03</internalNodes>
+          <leafValues>
+            5.3054618835449219e-01 4.2907360196113586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2080 2.8663428965955973e-03</internalNodes>
+          <leafValues>
+            4.5184791088104248e-01 5.5393511056900024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2081 -5.1983320154249668e-03</internalNodes>
+          <leafValues>
+            4.1491198539733887e-01 5.4341888427734375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2082 5.3739990107715130e-03</internalNodes>
+          <leafValues>
+            4.7178968787193298e-01 6.5076571702957153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2083 -1.4641529880464077e-02</internalNodes>
+          <leafValues>
+            2.1721640229225159e-01 5.1617771387100220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2084 -1.5042580344015732e-05</internalNodes>
+          <leafValues>
+            5.3373837471008301e-01 4.2988368868827820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2085 -1.1875660129589960e-04</internalNodes>
+          <leafValues>
+            4.6045941114425659e-01 5.5824470520019531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2086 1.6995530575513840e-02</internalNodes>
+          <leafValues>
+            4.9458950757980347e-01 7.3880076408386230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2087 -3.5095941275358200e-02</internalNodes>
+          <leafValues>
+            7.0055091381072998e-01 4.9775910377502441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2088 2.4217350874096155e-03</internalNodes>
+          <leafValues>
+            4.4662651419639587e-01 5.4776942729949951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2089 -9.6340337768197060e-04</internalNodes>
+          <leafValues>
+            4.7140988707542419e-01 5.3133380413055420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2090 1.6391130338888615e-04</internalNodes>
+          <leafValues>
+            4.3315461277961731e-01 5.3422421216964722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2091 -2.1141460165381432e-02</internalNodes>
+          <leafValues>
+            2.6447001099586487e-01 5.2044987678527832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2092 8.7775202700868249e-04</internalNodes>
+          <leafValues>
+            5.2083498239517212e-01 4.1527429223060608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2093 -2.7943920344114304e-02</internalNodes>
+          <leafValues>
+            6.3441252708435059e-01 5.0188118219375610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2094 6.7297378554940224e-03</internalNodes>
+          <leafValues>
+            5.0504380464553833e-01 3.5008639097213745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2095 2.3281039670109749e-02</internalNodes>
+          <leafValues>
+            4.9663180112838745e-01 6.9686770439147949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2096 -1.1644979938864708e-02</internalNodes>
+          <leafValues>
+            3.3002600073814392e-01 5.0496298074722290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2097 1.5764309093356133e-02</internalNodes>
+          <leafValues>
+            4.9915981292724609e-01 7.3211538791656494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2098 -1.3611479662358761e-03</internalNodes>
+          <leafValues>
+            3.9117351174354553e-01 5.1606708765029907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2099 -8.1522337859496474e-04</internalNodes>
+          <leafValues>
+            5.6289112567901611e-01 4.9497190117835999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2100 -6.0066272271797061e-04</internalNodes>
+          <leafValues>
+            5.8535951375961304e-01 4.5505958795547485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2101 4.9715518252924085e-04</internalNodes>
+          <leafValues>
+            4.2714700102806091e-01 5.4435992240905762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2102 2.3475370835512877e-03</internalNodes>
+          <leafValues>
+            5.1431107521057129e-01 3.8876569271087646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2103 -8.9261569082736969e-03</internalNodes>
+          <leafValues>
+            6.0445022583007812e-01 4.9717208743095398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2104 -1.3919910416007042e-02</internalNodes>
+          <leafValues>
+            2.5831609964370728e-01 5.0003677606582642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2105 1.0209949687123299e-03</internalNodes>
+          <leafValues>
+            4.8573741316795349e-01 5.5603581666946411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2106 -2.7441629208624363e-03</internalNodes>
+          <leafValues>
+            5.9368848800659180e-01 4.6457770466804504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2107 -1.6200130805373192e-02</internalNodes>
+          <leafValues>
+            3.1630149483680725e-01 5.1934951543807983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2108 4.3331980705261230e-03</internalNodes>
+          <leafValues>
+            5.0612241029739380e-01 3.4588789939880371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2109 5.8497930876910686e-04</internalNodes>
+          <leafValues>
+            4.7790178656578064e-01 5.8701777458190918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2110 -2.2466450463980436e-03</internalNodes>
+          <leafValues>
+            4.2978510260581970e-01 5.3747731447219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2111 2.3146099410951138e-03</internalNodes>
+          <leafValues>
+            5.4386717081069946e-01 4.6409699320793152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2112 8.7679121643304825e-03</internalNodes>
+          <leafValues>
+            4.7268930077552795e-01 6.7717897891998291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2113 -2.2448020172305405e-04</internalNodes>
+          <leafValues>
+            4.2291730642318726e-01 5.4280489683151245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2114 -7.4336021207273006e-03</internalNodes>
+          <leafValues>
+            6.0988807678222656e-01 4.6836739778518677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2115 -2.3189240600913763e-03</internalNodes>
+          <leafValues>
+            5.6894367933273315e-01 4.4242420792579651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2116 -2.1042178850620985e-03</internalNodes>
+          <leafValues>
+            3.7622210383415222e-01 5.1870870590209961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2117 4.6034841216169298e-04</internalNodes>
+          <leafValues>
+            4.6994051337242126e-01 5.7712072134017944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2118 1.0547629790380597e-03</internalNodes>
+          <leafValues>
+            4.4652169942855835e-01 5.6017017364501953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2119 8.7148818420246243e-04</internalNodes>
+          <leafValues>
+            5.4498052597045898e-01 3.9147090911865234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2120 3.3364820410497487e-04</internalNodes>
+          <leafValues>
+            4.5640090107917786e-01 5.6457388401031494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2121 -1.4853250468149781e-03</internalNodes>
+          <leafValues>
+            5.7473778724670410e-01 4.6927788853645325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2122 3.0251620337367058e-03</internalNodes>
+          <leafValues>
+            5.1661968231201172e-01 3.7628141045570374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2123 5.0280741415917873e-03</internalNodes>
+          <leafValues>
+            5.0021117925643921e-01 6.1515271663665771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2124 -5.8164511574432254e-04</internalNodes>
+          <leafValues>
+            5.3945982456207275e-01 4.3907511234283447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2125 4.5141529291868210e-02</internalNodes>
+          <leafValues>
+            5.1883268356323242e-01 2.0630359649658203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2126 -1.0795620037242770e-03</internalNodes>
+          <leafValues>
+            3.9046850800514221e-01 5.1379072666168213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2127 1.5995999274309725e-04</internalNodes>
+          <leafValues>
+            4.8953229188919067e-01 5.4275041818618774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2128 -1.9359270110726357e-02</internalNodes>
+          <leafValues>
+            6.9752287864685059e-01 4.7735071182250977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2129 2.0725509524345398e-01</internalNodes>
+          <leafValues>
+            5.2336359024047852e-01 3.0349919199943542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2130 -4.1953290929086506e-04</internalNodes>
+          <leafValues>
+            5.4193967580795288e-01 4.4601860642433167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2131 2.2582069505006075e-03</internalNodes>
+          <leafValues>
+            4.8157641291618347e-01 6.0274088382720947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2132 -6.7811207845807076e-03</internalNodes>
+          <leafValues>
+            3.9802789688110352e-01 5.1833057403564453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2133 1.1154309846460819e-02</internalNodes>
+          <leafValues>
+            5.4312318563461304e-01 4.1887599229812622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2134 4.3162431567907333e-02</internalNodes>
+          <leafValues>
+            4.7382280230522156e-01 6.5229612588882446e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          3 7 14 4 -1.</_>
+        <_>
+          3 9 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 4 -1.</_>
+        <_>
+          7 2 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 9 -1.</_>
+        <_>
+          1 10 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 6 -1.</_>
+        <_>
+          5 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 3 -1.</_>
+        <_>
+          9 5 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 9 -1.</_>
+        <_>
+          4 3 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 8 -1.</_>
+        <_>
+          6 13 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 8 -1.</_>
+        <_>
+          3 10 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 10 -1.</_>
+        <_>
+          14 1 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 5 12 -1.</_>
+        <_>
+          7 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          7 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 17 2 -1.</_>
+        <_>
+          1 9 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 2 -1.</_>
+        <_>
+          16 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 12 -1.</_>
+        <_>
+          14 2 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 12 -1.</_>
+        <_>
+          4 0 2 6 2.</_>
+        <_>
+          6 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 8 -1.</_>
+        <_>
+          8 11 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          5 8 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 3 -1.</_>
+        <_>
+          15 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 9 -1.</_>
+        <_>
+          5 6 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 12 -1.</_>
+        <_>
+          3 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 5 -1.</_>
+        <_>
+          8 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          5 10 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          8 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 1 8 -1.</_>
+        <_>
+          9 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 17 -1.</_>
+        <_>
+          9 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 4 -1.</_>
+        <_>
+          11 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 4 -1.</_>
+        <_>
+          7 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 16 -1.</_>
+        <_>
+          14 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 8 -1.</_>
+        <_>
+          0 5 9 4 2.</_>
+        <_>
+          9 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 10 4 -1.</_>
+        <_>
+          13 15 5 2 2.</_>
+        <_>
+          8 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 8 -1.</_>
+        <_>
+          3 1 2 4 2.</_>
+        <_>
+          5 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 10 -1.</_>
+        <_>
+          10 6 7 5 2.</_>
+        <_>
+          3 11 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 16 -1.</_>
+        <_>
+          4 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 19 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 6 -1.</_>
+        <_>
+          0 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 4 -1.</_>
+        <_>
+          5 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 16 -1.</_>
+        <_>
+          9 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 8 -1.</_>
+        <_>
+          3 10 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 2 -1.</_>
+        <_>
+          12 3 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 12 -1.</_>
+        <_>
+          8 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 6 -1.</_>
+        <_>
+          15 3 4 3 2.</_>
+        <_>
+          11 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 19 -1.</_>
+        <_>
+          9 1 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 4 -1.</_>
+        <_>
+          11 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 3 -1.</_>
+        <_>
+          6 1 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 10 4 -1.</_>
+        <_>
+          13 15 5 2 2.</_>
+        <_>
+          8 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 10 -1.</_>
+        <_>
+          3 3 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 15 15 -1.</_>
+        <_>
+          3 9 15 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 10 -1.</_>
+        <_>
+          10 4 6 5 2.</_>
+        <_>
+          4 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 4 -1.</_>
+        <_>
+          8 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 2 -1.</_>
+        <_>
+          15 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 2 -1.</_>
+        <_>
+          3 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 1 3 -1.</_>
+        <_>
+          16 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 4 -1.</_>
+        <_>
+          3 15 3 2 2.</_>
+        <_>
+          6 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 2 -1.</_>
+        <_>
+          6 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 1 3 -1.</_>
+        <_>
+          3 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 2 -1.</_>
+        <_>
+          6 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 2 -1.</_>
+        <_>
+          7 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 6 -1.</_>
+        <_>
+          0 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 2 -1.</_>
+        <_>
+          8 12 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 9 -1.</_>
+        <_>
+          6 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 2 -1.</_>
+        <_>
+          11 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 4 -1.</_>
+        <_>
+          9 6 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 2 -1.</_>
+        <_>
+          8 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 3 -1.</_>
+        <_>
+          11 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 2 -1.</_>
+        <_>
+          8 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 2 -1.</_>
+        <_>
+          11 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 13 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 4 -1.</_>
+        <_>
+          10 10 9 2 2.</_>
+        <_>
+          1 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 3 3 -1.</_>
+        <_>
+          0 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 6 -1.</_>
+        <_>
+          11 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 9 -1.</_>
+        <_>
+          1 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 6 -1.</_>
+        <_>
+          12 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 19 8 -1.</_>
+        <_>
+          0 9 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 1 -1.</_>
+        <_>
+          7 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 1 -1.</_>
+        <_>
+          13 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 6 -1.</_>
+        <_>
+          5 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 1 -1.</_>
+        <_>
+          13 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 6 -1.</_>
+        <_>
+          4 6 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 6 -1.</_>
+        <_>
+          15 14 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 2 -1.</_>
+        <_>
+          10 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 1 -1.</_>
+        <_>
+          10 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 14 -1.</_>
+        <_>
+          3 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 4 -1.</_>
+        <_>
+          11 0 2 2 2.</_>
+        <_>
+          9 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 1 14 -1.</_>
+        <_>
+          7 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 4 -1.</_>
+        <_>
+          8 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 6 -1.</_>
+        <_>
+          3 14 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 12 -1.</_>
+        <_>
+          10 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 2 -1.</_>
+        <_>
+          11 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 3 -1.</_>
+        <_>
+          5 12 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 2 -1.</_>
+        <_>
+          11 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 5 -1.</_>
+        <_>
+          7 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 4 -1.</_>
+        <_>
+          10 0 2 2 2.</_>
+        <_>
+          8 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 1 3 -1.</_>
+        <_>
+          3 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 5 3 -1.</_>
+        <_>
+          8 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 12 -1.</_>
+        <_>
+          5 4 5 6 2.</_>
+        <_>
+          10 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 12 -1.</_>
+        <_>
+          9 10 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 14 -1.</_>
+        <_>
+          2 2 6 7 2.</_>
+        <_>
+          8 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 4 -1.</_>
+        <_>
+          7 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 11 8 -1.</_>
+        <_>
+          4 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 4 -1.</_>
+        <_>
+          3 12 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 2 -1.</_>
+        <_>
+          0 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 2 -1.</_>
+        <_>
+          9 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 15 -1.</_>
+        <_>
+          10 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 8 6 -1.</_>
+        <_>
+          3 14 4 3 2.</_>
+        <_>
+          7 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 2 -1.</_>
+        <_>
+          14 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 7 6 -1.</_>
+        <_>
+          1 13 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 3 -1.</_>
+        <_>
+          15 4 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 14 6 -1.</_>
+        <_>
+          2 9 7 3 2.</_>
+        <_>
+          9 12 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 4 -1.</_>
+        <_>
+          5 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          6 9 4 4 2.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 2 -1.</_>
+        <_>
+          14 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 2 -1.</_>
+        <_>
+          3 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 8 -1.</_>
+        <_>
+          11 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 3 -1.</_>
+        <_>
+          0 1 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 8 -1.</_>
+        <_>
+          11 5 9 4 2.</_>
+        <_>
+          2 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 6 -1.</_>
+        <_>
+          6 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 3 -1.</_>
+        <_>
+          19 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 6 -1.</_>
+        <_>
+          9 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 3 -1.</_>
+        <_>
+          19 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 12 -1.</_>
+        <_>
+          12 4 4 6 2.</_>
+        <_>
+          8 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 3 -1.</_>
+        <_>
+          7 2 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 10 -1.</_>
+        <_>
+          6 6 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 12 -1.</_>
+        <_>
+          2 4 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 3 -1.</_>
+        <_>
+          15 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 5 3 -1.</_>
+        <_>
+          7 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 3 3 -1.</_>
+        <_>
+          15 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 3 -1.</_>
+        <_>
+          6 15 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 3 3 -1.</_>
+        <_>
+          15 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 3 3 -1.</_>
+        <_>
+          2 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          10 7 6 6 2.</_>
+        <_>
+          4 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 6 -1.</_>
+        <_>
+          10 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 5 2 -1.</_>
+        <_>
+          8 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 8 -1.</_>
+        <_>
+          9 10 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 6 -1.</_>
+        <_>
+          8 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 3 -1.</_>
+        <_>
+          12 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 1 -1.</_>
+        <_>
+          7 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 7 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 9 -1.</_>
+        <_>
+          7 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 1 -1.</_>
+        <_>
+          9 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 8 -1.</_>
+        <_>
+          2 12 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 6 -1.</_>
+        <_>
+          14 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 15 -1.</_>
+        <_>
+          1 10 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          10 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 14 -1.</_>
+        <_>
+          6 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 6 -1.</_>
+        <_>
+          13 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 4 -1.</_>
+        <_>
+          6 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 10 -1.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 4 6 -1.</_>
+        <_>
+          3 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 10 -1.</_>
+        <_>
+          15 3 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 10 -1.</_>
+        <_>
+          5 7 4 5 2.</_>
+        <_>
+          9 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 12 -1.</_>
+        <_>
+          10 4 6 6 2.</_>
+        <_>
+          4 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 9 -1.</_>
+        <_>
+          3 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 5 -1.</_>
+        <_>
+          11 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 5 -1.</_>
+        <_>
+          8 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 3 -1.</_>
+        <_>
+          10 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 2 -1.</_>
+        <_>
+          8 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 6 -1.</_>
+        <_>
+          4 14 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 5 9 -1.</_>
+        <_>
+          11 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          6 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 5 -1.</_>
+        <_>
+          12 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          8 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 1 9 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 8 -1.</_>
+        <_>
+          3 2 2 4 2.</_>
+        <_>
+          5 6 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 6 -1.</_>
+        <_>
+          13 14 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 6 -1.</_>
+        <_>
+          3 14 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 4 -1.</_>
+        <_>
+          13 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 3 -1.</_>
+        <_>
+          4 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 11 8 -1.</_>
+        <_>
+          7 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 4 -1.</_>
+        <_>
+          8 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 1 -1.</_>
+        <_>
+          11 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 3 -1.</_>
+        <_>
+          5 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 6 -1.</_>
+        <_>
+          10 9 10 3 2.</_>
+        <_>
+          0 12 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 5 -1.</_>
+        <_>
+          9 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 1 3 -1.</_>
+        <_>
+          11 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 2 -1.</_>
+        <_>
+          4 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 3 -1.</_>
+        <_>
+          12 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 4 -1.</_>
+        <_>
+          7 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 8 -1.</_>
+        <_>
+          10 7 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 6 -1.</_>
+        <_>
+          0 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 4 -1.</_>
+        <_>
+          13 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          4 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 8 -1.</_>
+        <_>
+          11 9 6 4 2.</_>
+        <_>
+          5 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 1 3 -1.</_>
+        <_>
+          9 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 4 -1.</_>
+        <_>
+          10 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 1 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 6 -1.</_>
+        <_>
+          15 3 3 3 2.</_>
+        <_>
+          12 6 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 6 -1.</_>
+        <_>
+          0 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 14 -1.</_>
+        <_>
+          12 3 4 7 2.</_>
+        <_>
+          8 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 7 15 -1.</_>
+        <_>
+          4 9 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 8 -1.</_>
+        <_>
+          15 2 3 4 2.</_>
+        <_>
+          12 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 8 -1.</_>
+        <_>
+          2 2 3 4 2.</_>
+        <_>
+          5 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 7 -1.</_>
+        <_>
+          8 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 14 -1.</_>
+        <_>
+          4 3 4 7 2.</_>
+        <_>
+          8 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 6 -1.</_>
+        <_>
+          18 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 6 -1.</_>
+        <_>
+          18 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 6 -1.</_>
+        <_>
+          0 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 6 -1.</_>
+        <_>
+          1 7 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 7 -1.</_>
+        <_>
+          3 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 14 -1.</_>
+        <_>
+          7 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 13 10 -1.</_>
+        <_>
+          3 12 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 2 -1.</_>
+        <_>
+          11 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 4 -1.</_>
+        <_>
+          2 11 8 2 2.</_>
+        <_>
+          10 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 9 -1.</_>
+        <_>
+          6 13 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 1 6 -1.</_>
+        <_>
+          14 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 1 -1.</_>
+        <_>
+          7 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 5 -1.</_>
+        <_>
+          8 8 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 5 4 -1.</_>
+        <_>
+          1 8 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 17 6 -1.</_>
+        <_>
+          3 3 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 2 -1.</_>
+        <_>
+          10 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          9 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 6 -1.</_>
+        <_>
+          10 7 6 3 2.</_>
+        <_>
+          4 10 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          9 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 8 -1.</_>
+        <_>
+          8 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 6 -1.</_>
+        <_>
+          11 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 8 -1.</_>
+        <_>
+          8 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 13 -1.</_>
+        <_>
+          14 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 6 -1.</_>
+        <_>
+          8 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 13 -1.</_>
+        <_>
+          14 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 4 -1.</_>
+        <_>
+          0 7 5 2 2.</_>
+        <_>
+          5 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 13 -1.</_>
+        <_>
+          14 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 13 -1.</_>
+        <_>
+          3 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 1 -1.</_>
+        <_>
+          9 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 1 -1.</_>
+        <_>
+          9 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 4 4 -1.</_>
+        <_>
+          12 16 2 2 2.</_>
+        <_>
+          10 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          10 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 2 -1.</_>
+        <_>
+          8 5 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 6 -1.</_>
+        <_>
+          6 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 12 -1.</_>
+        <_>
+          9 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 8 -1.</_>
+        <_>
+          4 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 5 -1.</_>
+        <_>
+          12 2 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 3 -1.</_>
+        <_>
+          0 9 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 5 -1.</_>
+        <_>
+          4 2 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 4 -1.</_>
+        <_>
+          13 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 1 -1.</_>
+        <_>
+          12 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 3 -1.</_>
+        <_>
+          7 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 6 -1.</_>
+        <_>
+          11 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 6 -1.</_>
+        <_>
+          2 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 6 -1.</_>
+        <_>
+          12 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 3 -1.</_>
+        <_>
+          8 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 5 -1.</_>
+        <_>
+          12 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 9 -1.</_>
+        <_>
+          8 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 1 -1.</_>
+        <_>
+          12 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          8 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 4 2 -1.</_>
+        <_>
+          5 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 6 -1.</_>
+        <_>
+          2 3 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 2 -1.</_>
+        <_>
+          7 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 2 -1.</_>
+        <_>
+          16 8 3 1 2.</_>
+        <_>
+          13 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          10 13 10 2 2.</_>
+        <_>
+          0 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 5 -1.</_>
+        <_>
+          9 7 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 2 -1.</_>
+        <_>
+          11 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 2 -1.</_>
+        <_>
+          1 8 3 1 2.</_>
+        <_>
+          4 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          10 2 10 1 2.</_>
+        <_>
+          0 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 5 3 -1.</_>
+        <_>
+          7 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          10 13 3 3 2.</_>
+        <_>
+          7 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 1 6 -1.</_>
+        <_>
+          16 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 1 6 -1.</_>
+        <_>
+          3 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 12 -1.</_>
+        <_>
+          11 4 7 6 2.</_>
+        <_>
+          4 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 10 -1.</_>
+        <_>
+          3 1 2 5 2.</_>
+        <_>
+          5 6 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          5 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 3 -1.</_>
+        <_>
+          15 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 4 -1.</_>
+        <_>
+          8 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 12 -1.</_>
+        <_>
+          13 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          4 5 6 6 2.</_>
+        <_>
+          10 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 7 3 -1.</_>
+        <_>
+          7 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 3 -1.</_>
+        <_>
+          3 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          10 2 7 1 2.</_>
+        <_>
+          3 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 3 10 -1.</_>
+        <_>
+          1 1 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 5 -1.</_>
+        <_>
+          11 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 2 -1.</_>
+        <_>
+          8 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          7 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 6 -1.</_>
+        <_>
+          16 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 6 -1.</_>
+        <_>
+          6 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 17 10 -1.</_>
+        <_>
+          0 9 17 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 15 16 -1.</_>
+        <_>
+          3 12 15 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 4 -1.</_>
+        <_>
+          7 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 9 -1.</_>
+        <_>
+          15 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 2 -1.</_>
+        <_>
+          2 4 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 7 9 -1.</_>
+        <_>
+          13 9 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          10 2 10 3 2.</_>
+        <_>
+          0 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 4 -1.</_>
+        <_>
+          13 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 4 -1.</_>
+        <_>
+          4 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 3 -1.</_>
+        <_>
+          9 5 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 8 -1.</_>
+        <_>
+          7 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 6 -1.</_>
+        <_>
+          0 14 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 6 -1.</_>
+        <_>
+          4 13 2 3 2.</_>
+        <_>
+          6 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          10 0 4 6 2.</_>
+        <_>
+          6 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 2 -1.</_>
+        <_>
+          2 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 1 2 -1.</_>
+        <_>
+          3 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 1 -1.</_>
+        <_>
+          8 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 6 -1.</_>
+        <_>
+          17 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 2 -1.</_>
+        <_>
+          8 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 3 -1.</_>
+        <_>
+          11 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 5 3 -1.</_>
+        <_>
+          4 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 2 -1.</_>
+        <_>
+          19 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 3 -1.</_>
+        <_>
+          5 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 6 -1.</_>
+        <_>
+          17 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 3 6 -1.</_>
+        <_>
+          0 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 6 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 2 -1.</_>
+        <_>
+          12 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 2 -1.</_>
+        <_>
+          6 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 6 -1.</_>
+        <_>
+          8 3 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 15 -1.</_>
+        <_>
+          16 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 2 -1.</_>
+        <_>
+          1 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 1 10 -1.</_>
+        <_>
+          14 9 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 12 -1.</_>
+        <_>
+          2 1 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 2 -1.</_>
+        <_>
+          11 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 2 -1.</_>
+        <_>
+          7 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 5 -1.</_>
+        <_>
+          8 8 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          3 0 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 2 -1.</_>
+        <_>
+          12 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          8 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 5 3 -1.</_>
+        <_>
+          8 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 3 -1.</_>
+        <_>
+          7 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 2 -1.</_>
+        <_>
+          12 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          3 15 7 2 2.</_>
+        <_>
+          10 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 4 -1.</_>
+        <_>
+          10 2 8 2 2.</_>
+        <_>
+          2 4 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          3 8 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          5 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 5 -1.</_>
+        <_>
+          10 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 2 -1.</_>
+        <_>
+          0 14 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 7 3 2 2.</_>
+        <_>
+          4 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 1 12 -1.</_>
+        <_>
+          12 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          10 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 3 -1.</_>
+        <_>
+          14 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 3 -1.</_>
+        <_>
+          8 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 2 4 -1.</_>
+        <_>
+          5 2 1 2 2.</_>
+        <_>
+          6 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 11 3 -1.</_>
+        <_>
+          5 6 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 5 -1.</_>
+        <_>
+          12 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 1 12 -1.</_>
+        <_>
+          7 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 3 -1.</_>
+        <_>
+          4 2 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          12 5 3 5 2.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 12 -1.</_>
+        <_>
+          5 5 4 6 2.</_>
+        <_>
+          9 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 2 -1.</_>
+        <_>
+          4 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 12 2 -1.</_>
+        <_>
+          8 18 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 16 -1.</_>
+        <_>
+          7 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 8 -1.</_>
+        <_>
+          7 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 1 -1.</_>
+        <_>
+          7 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 4 -1.</_>
+        <_>
+          11 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 12 -1.</_>
+        <_>
+          7 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          6 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 6 -1.</_>
+        <_>
+          16 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 5 2 -1.</_>
+        <_>
+          3 4 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 4 2 -1.</_>
+        <_>
+          2 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          10 13 3 3 2.</_>
+        <_>
+          7 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 4 -1.</_>
+        <_>
+          8 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 6 -1.</_>
+        <_>
+          0 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 3 -1.</_>
+        <_>
+          9 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 14 -1.</_>
+        <_>
+          9 6 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 4 -1.</_>
+        <_>
+          6 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 7 6 -1.</_>
+        <_>
+          10 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 2 -1.</_>
+        <_>
+          1 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 1 -1.</_>
+        <_>
+          6 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 10 -1.</_>
+        <_>
+          0 8 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 15 1 2 -1.</_>
+        <_>
+          19 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 8 -1.</_>
+        <_>
+          2 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 4 -1.</_>
+        <_>
+          11 1 9 2 2.</_>
+        <_>
+          2 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 2 -1.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 6 -1.</_>
+        <_>
+          10 2 5 3 2.</_>
+        <_>
+          5 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 4 -1.</_>
+        <_>
+          10 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 8 -1.</_>
+        <_>
+          8 5 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 4 3 -1.</_>
+        <_>
+          15 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 1 -1.</_>
+        <_>
+          9 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 3 -1.</_>
+        <_>
+          9 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 3 -1.</_>
+        <_>
+          7 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 15 1 2 -1.</_>
+        <_>
+          19 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 8 4 -1.</_>
+        <_>
+          0 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 4 -1.</_>
+        <_>
+          11 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 6 -1.</_>
+        <_>
+          3 16 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 6 -1.</_>
+        <_>
+          6 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 14 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 4 -1.</_>
+        <_>
+          4 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 2 -1.</_>
+        <_>
+          13 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 4 -1.</_>
+        <_>
+          7 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 3 -1.</_>
+        <_>
+          2 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 12 -1.</_>
+        <_>
+          9 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 6 -1.</_>
+        <_>
+          3 14 2 3 2.</_>
+        <_>
+          5 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 2 2 -1.</_>
+        <_>
+          2 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 3 -1.</_>
+        <_>
+          8 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 1 -1.</_>
+        <_>
+          10 7 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 3 -1.</_>
+        <_>
+          7 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          9 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 5 -1.</_>
+        <_>
+          12 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 6 -1.</_>
+        <_>
+          7 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 5 -1.</_>
+        <_>
+          14 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 1 3 -1.</_>
+        <_>
+          10 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 2 -1.</_>
+        <_>
+          6 6 1 1 2.</_>
+        <_>
+          7 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 4 -1.</_>
+        <_>
+          11 11 9 2 2.</_>
+        <_>
+          2 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 2 -1.</_>
+        <_>
+          6 6 1 1 2.</_>
+        <_>
+          7 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 2 -1.</_>
+        <_>
+          0 16 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 3 -1.</_>
+        <_>
+          4 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 3 -1.</_>
+        <_>
+          8 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 4 -1.</_>
+        <_>
+          12 7 3 2 2.</_>
+        <_>
+          9 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 6 -1.</_>
+        <_>
+          4 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 4 4 -1.</_>
+        <_>
+          13 15 2 2 2.</_>
+        <_>
+          11 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 2 -1.</_>
+        <_>
+          7 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 3 -1.</_>
+        <_>
+          13 1 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 4 -1.</_>
+        <_>
+          5 15 2 2 2.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 7 -1.</_>
+        <_>
+          9 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 3 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 3 -1.</_>
+        <_>
+          7 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 3 -1.</_>
+        <_>
+          11 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 10 -1.</_>
+        <_>
+          6 14 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 2 -1.</_>
+        <_>
+          10 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 2 -1.</_>
+        <_>
+          7 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 1 -1.</_>
+        <_>
+          11 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 2 -1.</_>
+        <_>
+          7 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 5 -1.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 12 -1.</_>
+        <_>
+          7 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 3 -1.</_>
+        <_>
+          5 1 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 6 -1.</_>
+        <_>
+          18 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 6 -1.</_>
+        <_>
+          0 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 3 -1.</_>
+        <_>
+          7 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 6 -1.</_>
+        <_>
+          18 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 6 -1.</_>
+        <_>
+          0 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 3 -1.</_>
+        <_>
+          8 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          8 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 6 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 2 -1.</_>
+        <_>
+          7 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          10 14 7 2 2.</_>
+        <_>
+          3 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 2 -1.</_>
+        <_>
+          6 15 3 1 2.</_>
+        <_>
+          9 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 2 -1.</_>
+        <_>
+          14 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 8 -1.</_>
+        <_>
+          2 16 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 7 2 -1.</_>
+        <_>
+          7 8 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          0 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 5 -1.</_>
+        <_>
+          9 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 8 -1.</_>
+        <_>
+          8 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 4 -1.</_>
+        <_>
+          10 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 2 -1.</_>
+        <_>
+          4 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 3 -1.</_>
+        <_>
+          11 4 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 3 -1.</_>
+        <_>
+          7 4 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 5 2 -1.</_>
+        <_>
+          14 12 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 9 -1.</_>
+        <_>
+          3 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 13 -1.</_>
+        <_>
+          14 6 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 8 -1.</_>
+        <_>
+          3 6 7 4 2.</_>
+        <_>
+          10 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 11 -1.</_>
+        <_>
+          16 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 12 12 -1.</_>
+        <_>
+          3 4 6 6 2.</_>
+        <_>
+          9 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 3 -1.</_>
+        <_>
+          11 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 2 -1.</_>
+        <_>
+          4 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 2 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 3 -1.</_>
+        <_>
+          5 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 3 -1.</_>
+        <_>
+          11 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 2 -1.</_>
+        <_>
+          5 6 3 1 2.</_>
+        <_>
+          8 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 4 3 -1.</_>
+        <_>
+          12 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 2 -1.</_>
+        <_>
+          3 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 5 3 -1.</_>
+        <_>
+          4 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 4 3 -1.</_>
+        <_>
+          12 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 2 -1.</_>
+        <_>
+          9 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 3 -1.</_>
+        <_>
+          2 13 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 2 -1.</_>
+        <_>
+          16 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 18 2 -1.</_>
+        <_>
+          7 18 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 2 -1.</_>
+        <_>
+          16 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 3 2 -1.</_>
+        <_>
+          1 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 8 3 -1.</_>
+        <_>
+          5 15 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 14 -1.</_>
+        <_>
+          10 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 14 -1.</_>
+        <_>
+          8 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 3 -1.</_>
+        <_>
+          13 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 1 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 3 -1.</_>
+        <_>
+          8 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 18 -1.</_>
+        <_>
+          4 9 16 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 14 -1.</_>
+        <_>
+          1 8 16 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 15 4 -1.</_>
+        <_>
+          8 9 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 7 3 -1.</_>
+        <_>
+          6 13 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 2 3 -1.</_>
+        <_>
+          14 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 14 -1.</_>
+        <_>
+          2 3 8 7 2.</_>
+        <_>
+          10 10 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 2 3 -1.</_>
+        <_>
+          4 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 3 -1.</_>
+        <_>
+          1 2 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 9 -1.</_>
+        <_>
+          5 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 11 -1.</_>
+        <_>
+          16 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 7 -1.</_>
+        <_>
+          17 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 7 -1.</_>
+        <_>
+          2 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          7 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 11 -1.</_>
+        <_>
+          2 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 20 -1.</_>
+        <_>
+          14 0 3 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 2 -1.</_>
+        <_>
+          0 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 8 -1.</_>
+        <_>
+          10 5 5 4 2.</_>
+        <_>
+          5 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 7 6 2 2.</_>
+        <_>
+          10 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 4 -1.</_>
+        <_>
+          5 1 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 4 -1.</_>
+        <_>
+          12 7 3 2 2.</_>
+        <_>
+          9 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 6 -1.</_>
+        <_>
+          5 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 4 -1.</_>
+        <_>
+          12 16 3 2 2.</_>
+        <_>
+          9 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 12 -1.</_>
+        <_>
+          9 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 18 -1.</_>
+        <_>
+          9 1 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 2 -1.</_>
+        <_>
+          8 12 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 2 -1.</_>
+        <_>
+          8 9 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 6 -1.</_>
+        <_>
+          9 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 3 2 -1.</_>
+        <_>
+          11 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 17 4 -1.</_>
+        <_>
+          1 3 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 17 -1.</_>
+        <_>
+          12 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 1 -1.</_>
+        <_>
+          6 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 3 -1.</_>
+        <_>
+          18 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 4 -1.</_>
+        <_>
+          8 6 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          4 10 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 4 2 -1.</_>
+        <_>
+          7 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 6 -1.</_>
+        <_>
+          17 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 6 -1.</_>
+        <_>
+          9 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 6 -1.</_>
+        <_>
+          17 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 4 -1.</_>
+        <_>
+          9 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 3 -1.</_>
+        <_>
+          0 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 3 -1.</_>
+        <_>
+          3 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 7 -1.</_>
+        <_>
+          9 6 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 1 3 -1.</_>
+        <_>
+          14 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 14 -1.</_>
+        <_>
+          3 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 5 6 -1.</_>
+        <_>
+          12 16 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 5 6 -1.</_>
+        <_>
+          4 16 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 14 -1.</_>
+        <_>
+          6 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 3 -1.</_>
+        <_>
+          10 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 3 -1.</_>
+        <_>
+          0 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 6 -1.</_>
+        <_>
+          5 14 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 9 -1.</_>
+        <_>
+          6 14 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 3 -1.</_>
+        <_>
+          5 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 13 3 -1.</_>
+        <_>
+          4 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 6 -1.</_>
+        <_>
+          6 7 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          8 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 3 -1.</_>
+        <_>
+          8 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 1 3 -1.</_>
+        <_>
+          15 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 5 3 -1.</_>
+        <_>
+          1 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 12 -1.</_>
+        <_>
+          7 7 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 10 -1.</_>
+        <_>
+          0 1 3 5 2.</_>
+        <_>
+          3 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 3 -1.</_>
+        <_>
+          16 2 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 5 -1.</_>
+        <_>
+          13 2 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 6 -1.</_>
+        <_>
+          0 5 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 1 -1.</_>
+        <_>
+          9 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 2 -1.</_>
+        <_>
+          7 10 1 1 2.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 4 -1.</_>
+        <_>
+          11 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          9 12 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 3 -1.</_>
+        <_>
+          13 1 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          9 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 10 -1.</_>
+        <_>
+          10 7 5 5 2.</_>
+        <_>
+          5 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 8 2 -1.</_>
+        <_>
+          3 18 4 1 2.</_>
+        <_>
+          7 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 8 -1.</_>
+        <_>
+          12 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 8 -1.</_>
+        <_>
+          6 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 7 -1.</_>
+        <_>
+          12 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 1 -1.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 1 3 -1.</_>
+        <_>
+          15 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 2 -1.</_>
+        <_>
+          7 15 1 1 2.</_>
+        <_>
+          8 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 1 3 -1.</_>
+        <_>
+          15 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 7 -1.</_>
+        <_>
+          7 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 7 -1.</_>
+        <_>
+          18 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 20 -1.</_>
+        <_>
+          2 10 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 6 -1.</_>
+        <_>
+          3 2 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 2 -1.</_>
+        <_>
+          4 4 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 5 -1.</_>
+        <_>
+          16 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 4 -1.</_>
+        <_>
+          8 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 5 -1.</_>
+        <_>
+          16 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 13 -1.</_>
+        <_>
+          3 7 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 5 -1.</_>
+        <_>
+          16 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 5 -1.</_>
+        <_>
+          2 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 6 -1.</_>
+        <_>
+          14 14 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 6 -1.</_>
+        <_>
+          3 14 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 3 -1.</_>
+        <_>
+          16 2 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 10 -1.</_>
+        <_>
+          8 7 1 5 2.</_>
+        <_>
+          9 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 4 -1.</_>
+        <_>
+          11 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 3 -1.</_>
+        <_>
+          0 2 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 3 -1.</_>
+        <_>
+          13 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 5 -1.</_>
+        <_>
+          8 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 14 -1.</_>
+        <_>
+          10 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 6 -1.</_>
+        <_>
+          0 7 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 10 -1.</_>
+        <_>
+          6 0 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 14 -1.</_>
+        <_>
+          10 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 14 -1.</_>
+        <_>
+          8 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 3 -1.</_>
+        <_>
+          13 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 2 3 -1.</_>
+        <_>
+          6 1 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 18 -1.</_>
+        <_>
+          19 1 1 9 2.</_>
+        <_>
+          18 10 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 3 -1.</_>
+        <_>
+          2 2 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 18 -1.</_>
+        <_>
+          19 1 1 9 2.</_>
+        <_>
+          18 10 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 6 -1.</_>
+        <_>
+          1 14 2 3 2.</_>
+        <_>
+          3 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 7 6 -1.</_>
+        <_>
+          10 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 4 -1.</_>
+        <_>
+          12 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 5 6 -1.</_>
+        <_>
+          5 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 1 8 -1.</_>
+        <_>
+          14 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 6 -1.</_>
+        <_>
+          1 7 9 3 2.</_>
+        <_>
+          10 10 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 5 -1.</_>
+        <_>
+          7 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 3 -1.</_>
+        <_>
+          9 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 4 -1.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 19 9 -1.</_>
+        <_>
+          1 3 19 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 6 -1.</_>
+        <_>
+          3 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 4 4 -1.</_>
+        <_>
+          15 7 2 2 2.</_>
+        <_>
+          13 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 4 4 -1.</_>
+        <_>
+          3 7 2 2 2.</_>
+        <_>
+          5 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 10 8 -1.</_>
+        <_>
+          9 10 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 12 -1.</_>
+        <_>
+          3 14 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 12 -1.</_>
+        <_>
+          11 5 5 6 2.</_>
+        <_>
+          6 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 4 -1.</_>
+        <_>
+          9 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 1 -1.</_>
+        <_>
+          13 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 1 -1.</_>
+        <_>
+          5 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 3 -1.</_>
+        <_>
+          13 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 4 -1.</_>
+        <_>
+          0 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 3 -1.</_>
+        <_>
+          13 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 9 2 -1.</_>
+        <_>
+          6 16 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 4 -1.</_>
+        <_>
+          18 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 3 2 -1.</_>
+        <_>
+          15 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 9 -1.</_>
+        <_>
+          0 3 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          9 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 12 -1.</_>
+        <_>
+          11 6 4 6 2.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 12 -1.</_>
+        <_>
+          5 6 4 6 2.</_>
+        <_>
+          9 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 3 2 -1.</_>
+        <_>
+          2 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 6 -1.</_>
+        <_>
+          2 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 3 -1.</_>
+        <_>
+          6 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 5 3 -1.</_>
+        <_>
+          14 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 5 3 -1.</_>
+        <_>
+          14 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 2 -1.</_>
+        <_>
+          7 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 5 3 -1.</_>
+        <_>
+          1 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          10 13 2 3 2.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 3 -1.</_>
+        <_>
+          8 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 4 -1.</_>
+        <_>
+          12 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          0 2 10 1 2.</_>
+        <_>
+          10 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 1 -1.</_>
+        <_>
+          6 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 13 2 -1.</_>
+        <_>
+          4 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 6 -1.</_>
+        <_>
+          2 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 8 -1.</_>
+        <_>
+          17 12 3 4 2.</_>
+        <_>
+          14 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 10 6 -1.</_>
+        <_>
+          4 13 5 3 2.</_>
+        <_>
+          9 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 1 2 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 2 -1.</_>
+        <_>
+          14 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 9 2 -1.</_>
+        <_>
+          8 13 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 6 -1.</_>
+        <_>
+          11 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 12 -1.</_>
+        <_>
+          5 12 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 6 -1.</_>
+        <_>
+          11 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 11 3 -1.</_>
+        <_>
+          5 5 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 10 -1.</_>
+        <_>
+          7 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 2 -1.</_>
+        <_>
+          2 9 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 5 3 -1.</_>
+        <_>
+          7 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 1 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 6 6 -1.</_>
+        <_>
+          0 14 3 3 2.</_>
+        <_>
+          3 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 1 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 1 -1.</_>
+        <_>
+          7 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 7 -1.</_>
+        <_>
+          14 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 2 -1.</_>
+        <_>
+          1 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 9 -1.</_>
+        <_>
+          10 12 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 2 -1.</_>
+        <_>
+          5 1 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 2 3 -1.</_>
+        <_>
+          17 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 2 3 -1.</_>
+        <_>
+          1 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          10 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 3 -1.</_>
+        <_>
+          8 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          9 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 12 12 -1.</_>
+        <_>
+          3 4 6 6 2.</_>
+        <_>
+          9 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 15 -1.</_>
+        <_>
+          11 2 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 17 -1.</_>
+        <_>
+          4 2 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 7 -1.</_>
+        <_>
+          14 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 7 -1.</_>
+        <_>
+          3 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 15 -1.</_>
+        <_>
+          11 2 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 15 -1.</_>
+        <_>
+          7 2 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 6 -1.</_>
+        <_>
+          17 11 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 6 -1.</_>
+        <_>
+          8 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 6 -1.</_>
+        <_>
+          10 10 9 3 2.</_>
+        <_>
+          1 13 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 9 -1.</_>
+        <_>
+          0 12 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 4 -1.</_>
+        <_>
+          5 14 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 12 -1.</_>
+        <_>
+          3 9 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 12 -1.</_>
+        <_>
+          1 1 6 6 2.</_>
+        <_>
+          7 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 2 4 -1.</_>
+        <_>
+          11 4 1 2 2.</_>
+        <_>
+          10 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 2 -1.</_>
+        <_>
+          0 9 5 1 2.</_>
+        <_>
+          5 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          9 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 9 2 -1.</_>
+        <_>
+          3 13 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 6 -1.</_>
+        <_>
+          3 6 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 4 -1.</_>
+        <_>
+          12 7 3 2 2.</_>
+        <_>
+          9 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 8 -1.</_>
+        <_>
+          4 0 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 12 -1.</_>
+        <_>
+          9 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 10 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 8 3 -1.</_>
+        <_>
+          6 18 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 2 -1.</_>
+        <_>
+          13 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 5 -1.</_>
+        <_>
+          9 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 6 -1.</_>
+        <_>
+          12 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 8 2 -1.</_>
+        <_>
+          1 12 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 6 -1.</_>
+        <_>
+          0 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 2 -1.</_>
+        <_>
+          13 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 6 -1.</_>
+        <_>
+          4 14 2 3 2.</_>
+        <_>
+          6 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 2 -1.</_>
+        <_>
+          13 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 8 -1.</_>
+        <_>
+          17 0 3 4 2.</_>
+        <_>
+          14 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 2 -1.</_>
+        <_>
+          8 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 0 4 6 2.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 10 -1.</_>
+        <_>
+          15 0 1 5 2.</_>
+        <_>
+          14 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 8 6 -1.</_>
+        <_>
+          5 3 4 3 2.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 2 -1.</_>
+        <_>
+          9 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 3 -1.</_>
+        <_>
+          15 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 3 -1.</_>
+        <_>
+          8 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 4 -1.</_>
+        <_>
+          10 13 7 2 2.</_>
+        <_>
+          3 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 3 -1.</_>
+        <_>
+          1 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 1 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 16 15 -1.</_>
+        <_>
+          3 10 16 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 2 -1.</_>
+        <_>
+          8 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 10 -1.</_>
+        <_>
+          10 4 6 5 2.</_>
+        <_>
+          4 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          10 12 2 4 2.</_>
+        <_>
+          8 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 2 -1.</_>
+        <_>
+          13 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 3 2 -1.</_>
+        <_>
+          8 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 14 -1.</_>
+        <_>
+          9 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          10 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 3 -1.</_>
+        <_>
+          10 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 6 -1.</_>
+        <_>
+          0 11 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 2 -1.</_>
+        <_>
+          6 1 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 7 3 -1.</_>
+        <_>
+          6 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 9 -1.</_>
+        <_>
+          8 13 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 2 -1.</_>
+        <_>
+          6 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 8 -1.</_>
+        <_>
+          17 1 3 4 2.</_>
+        <_>
+          14 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          0 1 3 4 2.</_>
+        <_>
+          3 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 6 -1.</_>
+        <_>
+          10 2 9 3 2.</_>
+        <_>
+          1 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 1 -1.</_>
+        <_>
+          10 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 6 -1.</_>
+        <_>
+          15 2 2 3 2.</_>
+        <_>
+          13 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 3 -1.</_>
+        <_>
+          13 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 5 3 -1.</_>
+        <_>
+          2 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 6 -1.</_>
+        <_>
+          15 2 2 3 2.</_>
+        <_>
+          13 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 6 -1.</_>
+        <_>
+          3 2 2 3 2.</_>
+        <_>
+          5 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 2 -1.</_>
+        <_>
+          13 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 2 -1.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 2 -1.</_>
+        <_>
+          13 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 2 -1.</_>
+        <_>
+          6 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 3 2 -1.</_>
+        <_>
+          13 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 4 4 -1.</_>
+        <_>
+          6 16 2 2 2.</_>
+        <_>
+          8 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 3 -1.</_>
+        <_>
+          9 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 6 -1.</_>
+        <_>
+          9 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 6 -1.</_>
+        <_>
+          1 12 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 2 -1.</_>
+        <_>
+          8 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 2 -1.</_>
+        <_>
+          7 10 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 3 -1.</_>
+        <_>
+          8 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 4 -1.</_>
+        <_>
+          18 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 2 -1.</_>
+        <_>
+          10 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 1 6 -1.</_>
+        <_>
+          1 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 8 3 -1.</_>
+        <_>
+          12 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 4 -1.</_>
+        <_>
+          1 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 11 1 1 2.</_>
+        <_>
+          8 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 5 -1.</_>
+        <_>
+          11 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 5 -1.</_>
+        <_>
+          8 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 3 -1.</_>
+        <_>
+          15 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          5 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 15 1 -1.</_>
+        <_>
+          9 19 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 15 1 -1.</_>
+        <_>
+          6 19 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 3 -1.</_>
+        <_>
+          15 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 15 -1.</_>
+        <_>
+          7 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 5 -1.</_>
+        <_>
+          9 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 7 -1.</_>
+        <_>
+          10 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 3 -1.</_>
+        <_>
+          16 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 3 3 -1.</_>
+        <_>
+          1 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 6 2 -1.</_>
+        <_>
+          0 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          7 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 4 -1.</_>
+        <_>
+          7 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 10 -1.</_>
+        <_>
+          16 10 2 5 2.</_>
+        <_>
+          14 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 2 -1.</_>
+        <_>
+          4 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 2 -1.</_>
+        <_>
+          11 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 10 -1.</_>
+        <_>
+          2 10 2 5 2.</_>
+        <_>
+          4 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 6 -1.</_>
+        <_>
+          10 13 10 3 2.</_>
+        <_>
+          0 16 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 15 -1.</_>
+        <_>
+          1 5 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 4 -1.</_>
+        <_>
+          10 7 9 2 2.</_>
+        <_>
+          1 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 17 -1.</_>
+        <_>
+          1 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 6 -1.</_>
+        <_>
+          10 6 8 3 2.</_>
+        <_>
+          2 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 2 -1.</_>
+        <_>
+          8 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 2 -1.</_>
+        <_>
+          5 2 4 1 2.</_>
+        <_>
+          9 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 6 -1.</_>
+        <_>
+          6 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 2 -1.</_>
+        <_>
+          9 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 6 -1.</_>
+        <_>
+          18 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 2 -1.</_>
+        <_>
+          9 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 6 -1.</_>
+        <_>
+          18 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 1 3 -1.</_>
+        <_>
+          9 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 6 -1.</_>
+        <_>
+          18 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 6 -1.</_>
+        <_>
+          0 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 3 -1.</_>
+        <_>
+          13 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 6 -1.</_>
+        <_>
+          5 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 3 -1.</_>
+        <_>
+          3 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 5 -1.</_>
+        <_>
+          8 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 2 -1.</_>
+        <_>
+          7 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 9 -1.</_>
+        <_>
+          11 3 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 6 -1.</_>
+        <_>
+          10 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 3 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 9 -1.</_>
+        <_>
+          2 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 5 -1.</_>
+        <_>
+          10 13 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 3 -1.</_>
+        <_>
+          9 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          9 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 2 -1.</_>
+        <_>
+          9 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 1 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 11 15 -1.</_>
+        <_>
+          0 6 11 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          7 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 1 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 4 -1.</_>
+        <_>
+          5 16 3 2 2.</_>
+        <_>
+          8 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 8 -1.</_>
+        <_>
+          6 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 6 -1.</_>
+        <_>
+          5 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 10 -1.</_>
+        <_>
+          11 6 4 5 2.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 10 -1.</_>
+        <_>
+          5 6 4 5 2.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 2 -1.</_>
+        <_>
+          9 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 2 -1.</_>
+        <_>
+          5 13 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 2 -1.</_>
+        <_>
+          10 3 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 10 -1.</_>
+        <_>
+          4 0 1 5 2.</_>
+        <_>
+          5 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 2 -1.</_>
+        <_>
+          9 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 3 -1.</_>
+        <_>
+          2 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 2 -1.</_>
+        <_>
+          8 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 6 -1.</_>
+        <_>
+          17 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 3 4 -1.</_>
+        <_>
+          2 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 6 -1.</_>
+        <_>
+          14 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 3 8 -1.</_>
+        <_>
+          2 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          8 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 2 2 -1.</_>
+        <_>
+          3 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 6 -1.</_>
+        <_>
+          14 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 6 -1.</_>
+        <_>
+          2 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 6 -1.</_>
+        <_>
+          10 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          8 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 6 -1.</_>
+        <_>
+          12 2 1 3 2.</_>
+        <_>
+          11 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 5 -1.</_>
+        <_>
+          8 6 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 6 -1.</_>
+        <_>
+          17 3 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 5 2 -1.</_>
+        <_>
+          12 4 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 12 -1.</_>
+        <_>
+          7 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 2 -1.</_>
+        <_>
+          4 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 2 -1.</_>
+        <_>
+          13 14 2 1 2.</_>
+        <_>
+          11 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 3 -1.</_>
+        <_>
+          5 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 1 -1.</_>
+        <_>
+          10 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 1 -1.</_>
+        <_>
+          7 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 3 -1.</_>
+        <_>
+          9 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 1 3 -1.</_>
+        <_>
+          4 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 3 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 3 -1.</_>
+        <_>
+          4 6 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 3 -1.</_>
+        <_>
+          5 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 17 -1.</_>
+        <_>
+          9 0 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 1 3 -1.</_>
+        <_>
+          9 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 15 -1.</_>
+        <_>
+          9 10 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 3 -1.</_>
+        <_>
+          8 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 5 -1.</_>
+        <_>
+          9 1 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          0 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 3 -1.</_>
+        <_>
+          2 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 9 15 -1.</_>
+        <_>
+          2 10 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 10 -1.</_>
+        <_>
+          11 0 6 5 2.</_>
+        <_>
+          5 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 2 3 -1.</_>
+        <_>
+          6 1 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 1 -1.</_>
+        <_>
+          12 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 2 10 -1.</_>
+        <_>
+          3 1 1 5 2.</_>
+        <_>
+          4 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 6 -1.</_>
+        <_>
+          4 15 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 1 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 2 -1.</_>
+        <_>
+          16 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          0 2 1 9 2.</_>
+        <_>
+          1 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 4 -1.</_>
+        <_>
+          10 2 9 2 2.</_>
+        <_>
+          1 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 3 -1.</_>
+        <_>
+          9 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 3 -1.</_>
+        <_>
+          11 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 7 3 -1.</_>
+        <_>
+          6 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 3 3 -1.</_>
+        <_>
+          13 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 4 -1.</_>
+        <_>
+          9 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 4 -1.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 3 -1.</_>
+        <_>
+          3 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 8 -1.</_>
+        <_>
+          12 0 1 4 2.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          0 8 3 6 2.</_>
+        <_>
+          3 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 12 -1.</_>
+        <_>
+          10 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 8 14 -1.</_>
+        <_>
+          5 10 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 1 -1.</_>
+        <_>
+          14 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 4 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 5 8 -1.</_>
+        <_>
+          10 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 8 -1.</_>
+        <_>
+          8 1 2 4 2.</_>
+        <_>
+          10 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 1 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 4 -1.</_>
+        <_>
+          9 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 6 -1.</_>
+        <_>
+          18 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          9 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 1 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 6 -1.</_>
+        <_>
+          12 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 10 -1.</_>
+        <_>
+          10 4 9 5 2.</_>
+        <_>
+          1 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 9 -1.</_>
+        <_>
+          8 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 3 -1.</_>
+        <_>
+          8 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 4 3 -1.</_>
+        <_>
+          14 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 10 -1.</_>
+        <_>
+          6 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 6 -1.</_>
+        <_>
+          0 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 1 3 -1.</_>
+        <_>
+          10 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 4 3 -1.</_>
+        <_>
+          2 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 8 -1.</_>
+        <_>
+          19 3 1 4 2.</_>
+        <_>
+          18 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 8 -1.</_>
+        <_>
+          0 3 1 4 2.</_>
+        <_>
+          1 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 10 -1.</_>
+        <_>
+          10 7 7 5 2.</_>
+        <_>
+          3 12 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 19 3 -1.</_>
+        <_>
+          0 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 3 -1.</_>
+        <_>
+          0 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 3 -1.</_>
+        <_>
+          5 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 2 -1.</_>
+        <_>
+          8 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 12 -1.</_>
+        <_>
+          8 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 3 -1.</_>
+        <_>
+          13 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 4 -1.</_>
+        <_>
+          0 12 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 17 14 -1.</_>
+        <_>
+          2 7 17 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 4 -1.</_>
+        <_>
+          14 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 4 -1.</_>
+        <_>
+          3 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 2 -1.</_>
+        <_>
+          13 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 2 -1.</_>
+        <_>
+          0 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 14 2 -1.</_>
+        <_>
+          13 11 7 1 2.</_>
+        <_>
+          6 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 2 -1.</_>
+        <_>
+          8 5 1 1 2.</_>
+        <_>
+          9 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 12 -1.</_>
+        <_>
+          2 1 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 3 -1.</_>
+        <_>
+          17 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 1 3 -1.</_>
+        <_>
+          2 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 3 -1.</_>
+        <_>
+          14 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 3 -1.</_>
+        <_>
+          7 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          10 13 2 3 2.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 3 -1.</_>
+        <_>
+          5 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 20 -1.</_>
+        <_>
+          16 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 2 6 -1.</_>
+        <_>
+          5 1 1 3 2.</_>
+        <_>
+          6 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 12 -1.</_>
+        <_>
+          15 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 8 -1.</_>
+        <_>
+          14 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 10 -1.</_>
+        <_>
+          1 4 7 5 2.</_>
+        <_>
+          8 9 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 14 -1.</_>
+        <_>
+          14 6 3 7 2.</_>
+        <_>
+          11 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 14 -1.</_>
+        <_>
+          3 6 3 7 2.</_>
+        <_>
+          6 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 2 -1.</_>
+        <_>
+          9 9 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_>
+        <_>
+          6 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 15 2 -1.</_>
+        <_>
+          6 9 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 9 -1.</_>
+        <_>
+          6 14 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 8 -1.</_>
+        <_>
+          8 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 6 -1.</_>
+        <_>
+          14 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 4 -1.</_>
+        <_>
+          5 7 3 2 2.</_>
+        <_>
+          8 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 19 -1.</_>
+        <_>
+          7 1 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 5 -1.</_>
+        <_>
+          4 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 6 2 -1.</_>
+        <_>
+          12 18 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 6 2 -1.</_>
+        <_>
+          2 18 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 6 -1.</_>
+        <_>
+          17 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 3 -1.</_>
+        <_>
+          8 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 6 -1.</_>
+        <_>
+          10 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 6 -1.</_>
+        <_>
+          17 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 2 3 -1.</_>
+        <_>
+          8 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 2 -1.</_>
+        <_>
+          11 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 6 -1.</_>
+        <_>
+          0 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 6 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 2 -1.</_>
+        <_>
+          5 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 4 -1.</_>
+        <_>
+          11 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 5 9 -1.</_>
+        <_>
+          1 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 3 -1.</_>
+        <_>
+          13 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 3 -1.</_>
+        <_>
+          7 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 8 -1.</_>
+        <_>
+          2 15 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          5 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 2 -1.</_>
+        <_>
+          12 6 2 1 2.</_>
+        <_>
+          10 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 2 -1.</_>
+        <_>
+          6 6 2 1 2.</_>
+        <_>
+          8 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 4 -1.</_>
+        <_>
+          11 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 7 -1.</_>
+        <_>
+          8 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 14 -1.</_>
+        <_>
+          4 9 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          9 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 4 -1.</_>
+        <_>
+          11 3 9 2 2.</_>
+        <_>
+          2 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 2 -1.</_>
+        <_>
+          7 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 7 -1.</_>
+        <_>
+          9 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 3 -1.</_>
+        <_>
+          6 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 18 -1.</_>
+        <_>
+          6 9 14 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 3 -1.</_>
+        <_>
+          2 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          10 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 3 -1.</_>
+        <_>
+          7 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 3 -1.</_>
+        <_>
+          7 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 2 -1.</_>
+        <_>
+          9 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 6 -1.</_>
+        <_>
+          5 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 2 -1.</_>
+        <_>
+          11 13 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 6 -1.</_>
+        <_>
+          6 10 4 3 2.</_>
+        <_>
+          10 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 4 -1.</_>
+        <_>
+          11 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 3 -1.</_>
+        <_>
+          9 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 1 9 -1.</_>
+        <_>
+          13 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 14 6 -1.</_>
+        <_>
+          1 15 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 1 6 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 8 -1.</_>
+        <_>
+          1 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 6 2 -1.</_>
+        <_>
+          2 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 6 -1.</_>
+        <_>
+          9 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 6 -1.</_>
+        <_>
+          6 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 3 -1.</_>
+        <_>
+          14 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          1 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 18 2 -1.</_>
+        <_>
+          10 18 9 1 2.</_>
+        <_>
+          1 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 2 -1.</_>
+        <_>
+          3 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 5 3 -1.</_>
+        <_>
+          8 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 3 -1.</_>
+        <_>
+          8 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 2 -1.</_>
+        <_>
+          9 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 5 2 -1.</_>
+        <_>
+          15 6 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 2 -1.</_>
+        <_>
+          0 6 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 14 1 6 -1.</_>
+        <_>
+          17 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 3 -1.</_>
+        <_>
+          5 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 18 -1.</_>
+        <_>
+          2 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 1 3 -1.</_>
+        <_>
+          17 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 1 6 -1.</_>
+        <_>
+          2 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 1 2 -1.</_>
+        <_>
+          19 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 3 -1.</_>
+        <_>
+          6 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 3 -1.</_>
+        <_>
+          9 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 1 3 -1.</_>
+        <_>
+          2 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 2 -1.</_>
+        <_>
+          16 4 4 1 2.</_>
+        <_>
+          12 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 2 -1.</_>
+        <_>
+          0 4 4 1 2.</_>
+        <_>
+          4 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 18 4 -1.</_>
+        <_>
+          2 18 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 4 -1.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 3 -1.</_>
+        <_>
+          4 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          2 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 8 -1.</_>
+        <_>
+          14 4 2 4 2.</_>
+        <_>
+          12 8 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 3 -1.</_>
+        <_>
+          10 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          8 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 12 -1.</_>
+        <_>
+          8 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 12 -1.</_>
+        <_>
+          4 4 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 11 -1.</_>
+        <_>
+          16 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 4 3 -1.</_>
+        <_>
+          0 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          5 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 3 -1.</_>
+        <_>
+          10 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          9 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 3 -1.</_>
+        <_>
+          10 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 2 -1.</_>
+        <_>
+          8 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 4 -1.</_>
+        <_>
+          10 10 8 2 2.</_>
+        <_>
+          2 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 4 17 -1.</_>
+        <_>
+          4 3 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 7 -1.</_>
+        <_>
+          15 13 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 1 -1.</_>
+        <_>
+          5 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 4 -1.</_>
+        <_>
+          9 2 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 0 4 6 2.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 2 -1.</_>
+        <_>
+          14 7 1 1 2.</_>
+        <_>
+          13 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 14 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 3 -1.</_>
+        <_>
+          14 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 12 -1.</_>
+        <_>
+          3 8 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 2 -1.</_>
+        <_>
+          3 0 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 3 -1.</_>
+        <_>
+          6 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 3 -1.</_>
+        <_>
+          8 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 6 -1.</_>
+        <_>
+          0 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 3 -1.</_>
+        <_>
+          10 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 1 -1.</_>
+        <_>
+          5 7 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 19 -1.</_>
+        <_>
+          10 0 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 6 -1.</_>
+        <_>
+          10 6 10 3 2.</_>
+        <_>
+          0 9 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 2 -1.</_>
+        <_>
+          16 6 1 1 2.</_>
+        <_>
+          15 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 1 12 -1.</_>
+        <_>
+          14 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 10 -1.</_>
+        <_>
+          2 5 8 5 2.</_>
+        <_>
+          10 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 2 2 -1.</_>
+        <_>
+          1 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 5 -1.</_>
+        <_>
+          10 0 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 5 -1.</_>
+        <_>
+          5 0 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 17 -1.</_>
+        <_>
+          11 2 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 17 -1.</_>
+        <_>
+          8 2 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 9 -1.</_>
+        <_>
+          15 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 9 -1.</_>
+        <_>
+          4 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 14 4 -1.</_>
+        <_>
+          5 16 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 1 -1.</_>
+        <_>
+          7 4 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 12 -1.</_>
+        <_>
+          9 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 6 -1.</_>
+        <_>
+          12 3 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 6 -1.</_>
+        <_>
+          5 2 3 3 2.</_>
+        <_>
+          8 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 4 -1.</_>
+        <_>
+          12 16 3 2 2.</_>
+        <_>
+          9 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 3 -1.</_>
+        <_>
+          7 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 10 -1.</_>
+        <_>
+          7 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 4 -1.</_>
+        <_>
+          7 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 6 -1.</_>
+        <_>
+          11 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 5 3 -1.</_>
+        <_>
+          7 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 6 -1.</_>
+        <_>
+          10 11 3 3 2.</_>
+        <_>
+          7 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 9 -1.</_>
+        <_>
+          0 3 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 6 -1.</_>
+        <_>
+          13 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 6 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 3 -1.</_>
+        <_>
+          7 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 3 -1.</_>
+        <_>
+          9 1 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 3 -1.</_>
+        <_>
+          0 7 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 1 2 -1.</_>
+        <_>
+          10 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 6 -1.</_>
+        <_>
+          10 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 1 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 1 -1.</_>
+        <_>
+          7 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 2 -1.</_>
+        <_>
+          6 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 1 -1.</_>
+        <_>
+          8 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 13 -1.</_>
+        <_>
+          9 4 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 2 -1.</_>
+        <_>
+          6 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 6 -1.</_>
+        <_>
+          16 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 3 -1.</_>
+        <_>
+          0 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 10 -1.</_>
+        <_>
+          10 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 3 -1.</_>
+        <_>
+          10 4 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 8 -1.</_>
+        <_>
+          9 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 13 -1.</_>
+        <_>
+          9 6 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 0 4 6 2.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 8 -1.</_>
+        <_>
+          16 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 6 -1.</_>
+        <_>
+          7 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 8 -1.</_>
+        <_>
+          16 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 2 -1.</_>
+        <_>
+          12 12 3 1 2.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 2 -1.</_>
+        <_>
+          12 6 1 1 2.</_>
+        <_>
+          11 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 2 -1.</_>
+        <_>
+          7 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 2 -1.</_>
+        <_>
+          12 6 1 1 2.</_>
+        <_>
+          11 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 12 8 -1.</_>
+        <_>
+          7 4 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 5 3 -1.</_>
+        <_>
+          13 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 3 -1.</_>
+        <_>
+          14 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 3 -1.</_>
+        <_>
+          5 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 3 -1.</_>
+        <_>
+          13 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 2 2 -1.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 1 4 -1.</_>
+        <_>
+          15 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 2 -1.</_>
+        <_>
+          3 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 2 2 -1.</_>
+        <_>
+          13 15 1 1 2.</_>
+        <_>
+          12 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 2 -1.</_>
+        <_>
+          9 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 14 9 -1.</_>
+        <_>
+          4 14 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 3 -1.</_>
+        <_>
+          7 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 1 4 -1.</_>
+        <_>
+          15 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 1 4 -1.</_>
+        <_>
+          4 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          16 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 12 -1.</_>
+        <_>
+          4 1 1 6 2.</_>
+        <_>
+          5 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 6 -1.</_>
+        <_>
+          14 14 3 3 2.</_>
+        <_>
+          11 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 6 6 -1.</_>
+        <_>
+          3 14 3 3 2.</_>
+        <_>
+          6 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 3 2 -1.</_>
+        <_>
+          14 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 3 2 -1.</_>
+        <_>
+          3 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          16 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 13 -1.</_>
+        <_>
+          2 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 2 -1.</_>
+        <_>
+          6 15 1 1 2.</_>
+        <_>
+          7 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 6 -1.</_>
+        <_>
+          10 11 4 3 2.</_>
+        <_>
+          6 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 2 -1.</_>
+        <_>
+          7 6 1 1 2.</_>
+        <_>
+          8 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 6 -1.</_>
+        <_>
+          10 2 8 3 2.</_>
+        <_>
+          2 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 10 -1.</_>
+        <_>
+          11 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 10 -1.</_>
+        <_>
+          6 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 2 -1.</_>
+        <_>
+          11 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 1 3 -1.</_>
+        <_>
+          10 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 18 -1.</_>
+        <_>
+          1 2 2 9 2.</_>
+        <_>
+          3 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 12 -1.</_>
+        <_>
+          12 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 6 -1.</_>
+        <_>
+          0 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 2 -1.</_>
+        <_>
+          11 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 2 -1.</_>
+        <_>
+          8 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 1 -1.</_>
+        <_>
+          11 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 6 -1.</_>
+        <_>
+          16 7 4 3 2.</_>
+        <_>
+          12 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 6 -1.</_>
+        <_>
+          0 7 4 3 2.</_>
+        <_>
+          4 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 10 -1.</_>
+        <_>
+          19 2 1 5 2.</_>
+        <_>
+          18 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 4 -1.</_>
+        <_>
+          3 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 1 -1.</_>
+        <_>
+          11 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 2 -1.</_>
+        <_>
+          7 15 1 1 2.</_>
+        <_>
+          8 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 6 -1.</_>
+        <_>
+          11 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 1 6 -1.</_>
+        <_>
+          8 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 1 -1.</_>
+        <_>
+          14 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 3 -1.</_>
+        <_>
+          8 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 7 4 -1.</_>
+        <_>
+          12 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 3 -1.</_>
+        <_>
+          4 15 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 2 -1.</_>
+        <_>
+          11 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 6 -1.</_>
+        <_>
+          10 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 2 -1.</_>
+        <_>
+          7 13 1 1 2.</_>
+        <_>
+          8 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 14 4 -1.</_>
+        <_>
+          11 11 7 2 2.</_>
+        <_>
+          4 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 18 2 -1.</_>
+        <_>
+          7 18 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 2 2 -1.</_>
+        <_>
+          12 18 1 1 2.</_>
+        <_>
+          11 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 2 2 -1.</_>
+        <_>
+          7 18 1 1 2.</_>
+        <_>
+          8 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          12 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 2 -1.</_>
+        <_>
+          7 15 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          10 12 2 4 2.</_>
+        <_>
+          8 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 3 -1.</_>
+        <_>
+          4 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 2 -1.</_>
+        <_>
+          9 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 15 -1.</_>
+        <_>
+          7 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 14 -1.</_>
+        <_>
+          12 6 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 3 -1.</_>
+        <_>
+          5 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 19 -1.</_>
+        <_>
+          12 1 4 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 2 -1.</_>
+        <_>
+          3 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 4 5 -1.</_>
+        <_>
+          10 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 5 -1.</_>
+        <_>
+          8 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 10 -1.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 2 -1.</_>
+        <_>
+          2 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 11 1 1 2.</_>
+        <_>
+          8 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 3 3 -1.</_>
+        <_>
+          14 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 3 -1.</_>
+        <_>
+          3 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 3 -1.</_>
+        <_>
+          13 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 3 -1.</_>
+        <_>
+          0 10 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 3 3 -1.</_>
+        <_>
+          13 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 8 -1.</_>
+        <_>
+          9 12 1 4 2.</_>
+        <_>
+          10 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 2 -1.</_>
+        <_>
+          12 7 1 1 2.</_>
+        <_>
+          11 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 4 -1.</_>
+        <_>
+          3 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 3 -1.</_>
+        <_>
+          10 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 8 4 -1.</_>
+        <_>
+          12 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 2 -1.</_>
+        <_>
+          10 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 2 -1.</_>
+        <_>
+          6 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 13 -1.</_>
+        <_>
+          13 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 13 -1.</_>
+        <_>
+          6 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 9 -1.</_>
+        <_>
+          9 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 7 12 -1.</_>
+        <_>
+          4 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 2 -1.</_>
+        <_>
+          13 12 1 1 2.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 2 -1.</_>
+        <_>
+          6 12 1 1 2.</_>
+        <_>
+          7 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          10 9 2 1 2.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 2 -1.</_>
+        <_>
+          16 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 19 4 -1.</_>
+        <_>
+          0 9 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 1 -1.</_>
+        <_>
+          10 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 12 -1.</_>
+        <_>
+          9 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 4 1 -1.</_>
+        <_>
+          12 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 7 3 2 2.</_>
+        <_>
+          4 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 13 -1.</_>
+        <_>
+          14 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 13 -1.</_>
+        <_>
+          4 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 8 -1.</_>
+        <_>
+          10 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 5 -1.</_>
+        <_>
+          9 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 1 -1.</_>
+        <_>
+          11 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 9 1 -1.</_>
+        <_>
+          6 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 10 -1.</_>
+        <_>
+          7 0 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 5 3 -1.</_>
+        <_>
+          7 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 1 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 2 -1.</_>
+        <_>
+          2 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 4 -1.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          8 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          9 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 3 -1.</_>
+        <_>
+          6 14 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 4 -1.</_>
+        <_>
+          10 15 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 17 -1.</_>
+        <_>
+          10 2 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 3 4 -1.</_>
+        <_>
+          9 15 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 3 -1.</_>
+        <_>
+          7 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 3 -1.</_>
+        <_>
+          9 16 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 10 -1.</_>
+        <_>
+          6 7 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 8 -1.</_>
+        <_>
+          2 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 2 2 -1.</_>
+        <_>
+          14 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 2 -1.</_>
+        <_>
+          4 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 6 -1.</_>
+        <_>
+          10 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 6 -1.</_>
+        <_>
+          6 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 6 -1.</_>
+        <_>
+          12 0 2 3 2.</_>
+        <_>
+          10 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 2 -1.</_>
+        <_>
+          0 4 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          16 0 4 1 2.</_>
+        <_>
+          12 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 8 -1.</_>
+        <_>
+          2 16 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 10 -1.</_>
+        <_>
+          18 7 1 5 2.</_>
+        <_>
+          17 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 2 10 -1.</_>
+        <_>
+          1 7 1 5 2.</_>
+        <_>
+          2 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 6 -1.</_>
+        <_>
+          15 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 2 -1.</_>
+        <_>
+          6 4 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 2 -1.</_>
+        <_>
+          0 0 4 1 2.</_>
+        <_>
+          4 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 2 -1.</_>
+        <_>
+          1 14 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 4 -1.</_>
+        <_>
+          11 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 1 -1.</_>
+        <_>
+          8 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 2 -1.</_>
+        <_>
+          10 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 2 -1.</_>
+        <_>
+          15 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 2 -1.</_>
+        <_>
+          6 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 3 -1.</_>
+        <_>
+          13 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 1 2 -1.</_>
+        <_>
+          2 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 3 -1.</_>
+        <_>
+          12 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 3 -1.</_>
+        <_>
+          0 1 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 2 -1.</_>
+        <_>
+          9 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 3 -1.</_>
+        <_>
+          18 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 6 -1.</_>
+        <_>
+          3 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          10 2 10 3 2.</_>
+        <_>
+          0 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 4 -1.</_>
+        <_>
+          5 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 15 2 -1.</_>
+        <_>
+          8 10 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 11 -1.</_>
+        <_>
+          9 0 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 6 -1.</_>
+        <_>
+          13 0 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 2 1 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 10 -1.</_>
+        <_>
+          18 10 2 5 2.</_>
+        <_>
+          16 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 3 -1.</_>
+        <_>
+          4 9 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 3 -1.</_>
+        <_>
+          14 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 10 -1.</_>
+        <_>
+          0 10 2 5 2.</_>
+        <_>
+          2 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 6 -1.</_>
+        <_>
+          18 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 3 -1.</_>
+        <_>
+          6 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 7 2 -1.</_>
+        <_>
+          7 8 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 6 -1.</_>
+        <_>
+          0 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 1 -1.</_>
+        <_>
+          12 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 6 -1.</_>
+        <_>
+          6 0 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 14 -1.</_>
+        <_>
+          7 1 6 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 3 -1.</_>
+        <_>
+          8 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 2 -1.</_>
+        <_>
+          9 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 2 -1.</_>
+        <_>
+          8 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 5 -1.</_>
+        <_>
+          11 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 5 -1.</_>
+        <_>
+          8 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 10 -1.</_>
+        <_>
+          14 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 2 -1.</_>
+        <_>
+          4 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 6 -1.</_>
+        <_>
+          18 3 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 10 -1.</_>
+        <_>
+          1 13 18 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 10 -1.</_>
+        <_>
+          14 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 7 -1.</_>
+        <_>
+          17 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 10 -1.</_>
+        <_>
+          5 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 7 -1.</_>
+        <_>
+          17 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 1 2 -1.</_>
+        <_>
+          0 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 10 -1.</_>
+        <_>
+          18 1 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 10 -1.</_>
+        <_>
+          1 1 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 4 -1.</_>
+        <_>
+          11 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 3 3 -1.</_>
+        <_>
+          3 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 6 -1.</_>
+        <_>
+          12 0 1 3 2.</_>
+        <_>
+          11 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 6 -1.</_>
+        <_>
+          7 0 1 3 2.</_>
+        <_>
+          8 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 7 -1.</_>
+        <_>
+          17 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 7 -1.</_>
+        <_>
+          2 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 16 -1.</_>
+        <_>
+          16 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 16 -1.</_>
+        <_>
+          2 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 8 -1.</_>
+        <_>
+          10 0 8 4 2.</_>
+        <_>
+          2 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 5 3 -1.</_>
+        <_>
+          6 9 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          9 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 15 1 -1.</_>
+        <_>
+          5 7 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 9 -1.</_>
+        <_>
+          8 5 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 4 -1.</_>
+        <_>
+          1 7 8 2 2.</_>
+        <_>
+          9 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 2 -1.</_>
+        <_>
+          6 13 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          8 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 14 10 -1.</_>
+        <_>
+          11 5 7 5 2.</_>
+        <_>
+          4 10 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 2 -1.</_>
+        <_>
+          4 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 1 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 7 6 -1.</_>
+        <_>
+          4 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 3 -1.</_>
+        <_>
+          7 11 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 2 -1.</_>
+        <_>
+          9 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 1 -1.</_>
+        <_>
+          8 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 1 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 4 -1.</_>
+        <_>
+          11 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 8 -1.</_>
+        <_>
+          2 16 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 15 2 -1.</_>
+        <_>
+          0 16 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 6 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 4 -1.</_>
+        <_>
+          10 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 9 6 -1.</_>
+        <_>
+          8 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 15 1 -1.</_>
+        <_>
+          7 19 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 4 -1.</_>
+        <_>
+          11 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          0 17 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 4 -1.</_>
+        <_>
+          11 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 3 4 -1.</_>
+        <_>
+          8 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 3 -1.</_>
+        <_>
+          9 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 6 -1.</_>
+        <_>
+          8 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 12 -1.</_>
+        <_>
+          9 10 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          8 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 8 2 -1.</_>
+        <_>
+          13 18 4 1 2.</_>
+        <_>
+          9 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 8 2 -1.</_>
+        <_>
+          1 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 15 -1.</_>
+        <_>
+          15 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 3 -1.</_>
+        <_>
+          9 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 15 -1.</_>
+        <_>
+          3 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 8 -1.</_>
+        <_>
+          11 1 7 4 2.</_>
+        <_>
+          4 5 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 16 -1.</_>
+        <_>
+          2 4 2 8 2.</_>
+        <_>
+          4 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 12 -1.</_>
+        <_>
+          12 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 12 -1.</_>
+        <_>
+          4 5 5 6 2.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 10 -1.</_>
+        <_>
+          14 2 2 5 2.</_>
+        <_>
+          12 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 7 3 -1.</_>
+        <_>
+          6 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 2 -1.</_>
+        <_>
+          11 0 9 1 2.</_>
+        <_>
+          2 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 2 -1.</_>
+        <_>
+          0 0 9 1 2.</_>
+        <_>
+          9 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 6 -1.</_>
+        <_>
+          15 13 2 3 2.</_>
+        <_>
+          13 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 6 -1.</_>
+        <_>
+          3 13 2 3 2.</_>
+        <_>
+          5 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 6 -1.</_>
+        <_>
+          10 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 10 -1.</_>
+        <_>
+          5 9 5 5 2.</_>
+        <_>
+          10 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 2 -1.</_>
+        <_>
+          13 4 2 1 2.</_>
+        <_>
+          11 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 8 -1.</_>
+        <_>
+          10 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 10 -1.</_>
+        <_>
+          14 2 2 5 2.</_>
+        <_>
+          12 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 1 -1.</_>
+        <_>
+          9 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 1 12 -1.</_>
+        <_>
+          10 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 9 -1.</_>
+        <_>
+          3 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 10 -1.</_>
+        <_>
+          14 2 2 5 2.</_>
+        <_>
+          12 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 10 -1.</_>
+        <_>
+          4 2 2 5 2.</_>
+        <_>
+          6 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 2 -1.</_>
+        <_>
+          13 4 2 1 2.</_>
+        <_>
+          11 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 6 3 -1.</_>
+        <_>
+          0 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 2 -1.</_>
+        <_>
+          13 4 2 1 2.</_>
+        <_>
+          11 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 2 -1.</_>
+        <_>
+          7 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 2 -1.</_>
+        <_>
+          13 4 2 1 2.</_>
+        <_>
+          11 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 2 -1.</_>
+        <_>
+          5 4 2 1 2.</_>
+        <_>
+          7 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 12 -1.</_>
+        <_>
+          14 0 1 6 2.</_>
+        <_>
+          13 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 10 -1.</_>
+        <_>
+          7 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 8 -1.</_>
+        <_>
+          3 4 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 4 -1.</_>
+        <_>
+          0 6 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 2 -1.</_>
+        <_>
+          4 3 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 4 -1.</_>
+        <_>
+          5 7 3 2 2.</_>
+        <_>
+          8 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 9 -1.</_>
+        <_>
+          8 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 1 4 -1.</_>
+        <_>
+          8 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 7 -1.</_>
+        <_>
+          8 5 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 10 -1.</_>
+        <_>
+          4 2 2 5 2.</_>
+        <_>
+          6 7 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 2 -1.</_>
+        <_>
+          3 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 15 -1.</_>
+        <_>
+          2 7 16 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 2 -1.</_>
+        <_>
+          15 3 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 2 -1.</_>
+        <_>
+          10 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 15 -1.</_>
+        <_>
+          4 10 16 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 6 -1.</_>
+        <_>
+          7 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 2 -1.</_>
+        <_>
+          11 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 1 -1.</_>
+        <_>
+          9 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 3 -1.</_>
+        <_>
+          9 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 2 -1.</_>
+        <_>
+          0 3 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 1 -1.</_>
+        <_>
+          5 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 14 -1.</_>
+        <_>
+          7 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 0 4 5 2.</_>
+        <_>
+          4 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 2 -1.</_>
+        <_>
+          10 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 2 -1.</_>
+        <_>
+          9 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 16 -1.</_>
+        <_>
+          7 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 2 6 -1.</_>
+        <_>
+          2 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 6 -1.</_>
+        <_>
+          13 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 2 6 -1.</_>
+        <_>
+          3 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 2 -1.</_>
+        <_>
+          14 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 2 -1.</_>
+        <_>
+          0 9 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 2 -1.</_>
+        <_>
+          14 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 6 -1.</_>
+        <_>
+          0 2 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 6 -1.</_>
+        <_>
+          4 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 1 3 -1.</_>
+        <_>
+          9 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 12 -1.</_>
+        <_>
+          6 12 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 2 -1.</_>
+        <_>
+          8 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 3 -1.</_>
+        <_>
+          4 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 2 -1.</_>
+        <_>
+          9 6 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 3 -1.</_>
+        <_>
+          4 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 6 -1.</_>
+        <_>
+          14 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 7 -1.</_>
+        <_>
+          8 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          10 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 3 -1.</_>
+        <_>
+          9 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 11 3 -1.</_>
+        <_>
+          5 11 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 1 -1.</_>
+        <_>
+          10 7 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          9 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 2 -1.</_>
+        <_>
+          11 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 2 -1.</_>
+        <_>
+          7 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 4 -1.</_>
+        <_>
+          14 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 2 -1.</_>
+        <_>
+          8 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 6 3 -1.</_>
+        <_>
+          14 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          4 5 6 6 2.</_>
+        <_>
+          10 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 15 4 -1.</_>
+        <_>
+          5 4 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 1 -1.</_>
+        <_>
+          13 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 3 -1.</_>
+        <_>
+          9 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 3 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 4 -1.</_>
+        <_>
+          7 12 2 2 2.</_>
+        <_>
+          9 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 2 -1.</_>
+        <_>
+          11 11 1 1 2.</_>
+        <_>
+          10 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 2 -1.</_>
+        <_>
+          11 11 1 1 2.</_>
+        <_>
+          10 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 3 -1.</_>
+        <_>
+          0 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 2 -1.</_>
+        <_>
+          11 11 1 1 2.</_>
+        <_>
+          10 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 2 -1.</_>
+        <_>
+          8 11 1 1 2.</_>
+        <_>
+          9 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 4 -1.</_>
+        <_>
+          12 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 4 -1.</_>
+        <_>
+          4 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 1 -1.</_>
+        <_>
+          13 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 1 -1.</_>
+        <_>
+          5 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 2 -1.</_>
+        <_>
+          12 0 2 1 2.</_>
+        <_>
+          10 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 1 -1.</_>
+        <_>
+          8 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 8 -1.</_>
+        <_>
+          10 11 2 4 2.</_>
+        <_>
+          8 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 15 2 -1.</_>
+        <_>
+          3 19 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 2 12 -1.</_>
+        <_>
+          2 6 1 6 2.</_>
+        <_>
+          3 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 2 -1.</_>
+        <_>
+          8 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 1 -1.</_>
+        <_>
+          12 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 1 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 2 -1.</_>
+        <_>
+          11 2 2 1 2.</_>
+        <_>
+          9 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          8 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 14 -1.</_>
+        <_>
+          7 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 12 3 -1.</_>
+        <_>
+          8 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 6 -1.</_>
+        <_>
+          9 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 1 8 -1.</_>
+        <_>
+          9 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 12 -1.</_>
+        <_>
+          9 10 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 8 -1.</_>
+        <_>
+          2 1 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 2 -1.</_>
+        <_>
+          12 1 3 1 2.</_>
+        <_>
+          9 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 14 -1.</_>
+        <_>
+          1 10 12 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          10 12 2 1 2.</_>
+        <_>
+          8 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 2 -1.</_>
+        <_>
+          1 9 5 1 2.</_>
+        <_>
+          6 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 3 -1.</_>
+        <_>
+          6 9 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 5 3 -1.</_>
+        <_>
+          9 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 2 -1.</_>
+        <_>
+          7 8 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          5 7 4 1 2.</_>
+        <_>
+          9 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 2 -1.</_>
+        <_>
+          4 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 3 -1.</_>
+        <_>
+          5 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 6 -1.</_>
+        <_>
+          18 3 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 6 -1.</_>
+        <_>
+          1 3 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 14 1 2 -1.</_>
+        <_>
+          17 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 3 -1.</_>
+        <_>
+          6 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          12 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 3 -1.</_>
+        <_>
+          5 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 8 -1.</_>
+        <_>
+          12 5 3 4 2.</_>
+        <_>
+          9 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          5 5 3 4 2.</_>
+        <_>
+          8 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 6 -1.</_>
+        <_>
+          16 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 20 -1.</_>
+        <_>
+          3 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 2 -1.</_>
+        <_>
+          13 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          6 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 1 -1.</_>
+        <_>
+          11 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 3 -1.</_>
+        <_>
+          4 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 5 -1.</_>
+        <_>
+          15 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 2 -1.</_>
+        <_>
+          5 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 15 -1.</_>
+        <_>
+          9 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 1 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 4 -1.</_>
+        <_>
+          13 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 1 -1.</_>
+        <_>
+          7 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 2 -1.</_>
+        <_>
+          12 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 6 -1.</_>
+        <_>
+          0 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 2 -1.</_>
+        <_>
+          12 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 3 3 -1.</_>
+        <_>
+          2 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 10 -1.</_>
+        <_>
+          16 8 3 5 2.</_>
+        <_>
+          13 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 2 -1.</_>
+        <_>
+          0 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          13 11 1 1 2.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 3 -1.</_>
+        <_>
+          3 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 2 -1.</_>
+        <_>
+          12 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          5 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 9 -1.</_>
+        <_>
+          9 8 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 7 -1.</_>
+        <_>
+          6 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 5 -1.</_>
+        <_>
+          9 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 2 -1.</_>
+        <_>
+          6 11 1 1 2.</_>
+        <_>
+          7 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 3 2 -1.</_>
+        <_>
+          15 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 2 -1.</_>
+        <_>
+          2 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 8 -1.</_>
+        <_>
+          17 12 3 4 2.</_>
+        <_>
+          14 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 6 -1.</_>
+        <_>
+          7 8 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 17 -1.</_>
+        <_>
+          8 2 6 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 1 -1.</_>
+        <_>
+          7 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 5 -1.</_>
+        <_>
+          9 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 5 -1.</_>
+        <_>
+          7 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 4 -1.</_>
+        <_>
+          10 9 6 2 2.</_>
+        <_>
+          4 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 2 -1.</_>
+        <_>
+          5 15 3 1 2.</_>
+        <_>
+          8 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 3 -1.</_>
+        <_>
+          10 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 2 -1.</_>
+        <_>
+          0 13 10 1 2.</_>
+        <_>
+          10 14 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 8 -1.</_>
+        <_>
+          10 9 6 4 2.</_>
+        <_>
+          4 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 6 -1.</_>
+        <_>
+          8 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 2 -1.</_>
+        <_>
+          10 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 2 -1.</_>
+        <_>
+          9 12 1 1 2.</_>
+        <_>
+          10 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 14 4 -1.</_>
+        <_>
+          11 11 7 2 2.</_>
+        <_>
+          4 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 2 -1.</_>
+        <_>
+          8 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 3 -1.</_>
+        <_>
+          12 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 1 2 -1.</_>
+        <_>
+          2 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 12 -1.</_>
+        <_>
+          16 8 3 6 2.</_>
+        <_>
+          13 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 12 -1.</_>
+        <_>
+          1 8 3 6 2.</_>
+        <_>
+          4 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 10 -1.</_>
+        <_>
+          12 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 4 -1.</_>
+        <_>
+          5 11 4 2 2.</_>
+        <_>
+          9 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 8 4 -1.</_>
+        <_>
+          14 16 4 2 2.</_>
+        <_>
+          10 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 6 -1.</_>
+        <_>
+          9 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 10 -1.</_>
+        <_>
+          10 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 9 -1.</_>
+        <_>
+          8 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 19 2 1 -1.</_>
+        <_>
+          12 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 9 -1.</_>
+        <_>
+          3 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          9 5 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 4 -1.</_>
+        <_>
+          9 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 8 -1.</_>
+        <_>
+          14 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 12 -1.</_>
+        <_>
+          7 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 6 -1.</_>
+        <_>
+          14 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 6 -1.</_>
+        <_>
+          4 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 10 4 -1.</_>
+        <_>
+          13 15 5 2 2.</_>
+        <_>
+          8 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 2 2 -1.</_>
+        <_>
+          7 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 2 -1.</_>
+        <_>
+          11 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 6 -1.</_>
+        <_>
+          2 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 2 -1.</_>
+        <_>
+          11 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 10 3 -1.</_>
+        <_>
+          4 12 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 2 -1.</_>
+        <_>
+          11 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 2 -1.</_>
+        <_>
+          3 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 3 -1.</_>
+        <_>
+          9 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          6 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 3 -1.</_>
+        <_>
+          15 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 2 -1.</_>
+        <_>
+          10 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 3 -1.</_>
+        <_>
+          5 1 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 1 -1.</_>
+        <_>
+          10 0 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 3 -1.</_>
+        <_>
+          15 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 4 -1.</_>
+        <_>
+          1 4 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 6 -1.</_>
+        <_>
+          16 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 6 -1.</_>
+        <_>
+          1 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 6 -1.</_>
+        <_>
+          12 2 6 3 2.</_>
+        <_>
+          6 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 3 -1.</_>
+        <_>
+          8 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 6 -1.</_>
+        <_>
+          11 2 7 3 2.</_>
+        <_>
+          4 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 3 -1.</_>
+        <_>
+          15 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 3 -1.</_>
+        <_>
+          8 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 3 -1.</_>
+        <_>
+          15 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 2 -1.</_>
+        <_>
+          7 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 3 -1.</_>
+        <_>
+          7 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 4 -1.</_>
+        <_>
+          5 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 3 -1.</_>
+        <_>
+          12 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 3 -1.</_>
+        <_>
+          7 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 6 -1.</_>
+        <_>
+          17 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 7 -1.</_>
+        <_>
+          7 6 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 6 -1.</_>
+        <_>
+          17 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 6 -1.</_>
+        <_>
+          17 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 3 6 -1.</_>
+        <_>
+          2 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 1 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 7 -1.</_>
+        <_>
+          4 9 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 2 -1.</_>
+        <_>
+          12 12 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 2 -1.</_>
+        <_>
+          0 12 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 3 -1.</_>
+        <_>
+          9 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          4 10 6 2 2.</_>
+        <_>
+          10 12 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 7 -1.</_>
+        <_>
+          10 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 5 -1.</_>
+        <_>
+          8 2 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 6 -1.</_>
+        <_>
+          11 12 2 3 2.</_>
+        <_>
+          9 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 2 -1.</_>
+        <_>
+          15 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 4 -1.</_>
+        <_>
+          14 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 1 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 3 -1.</_>
+        <_>
+          15 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 10 -1.</_>
+        <_>
+          9 7 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 6 -1.</_>
+        <_>
+          11 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 1 -1.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 2 -1.</_>
+        <_>
+          10 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 2 2 -1.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 2 -1.</_>
+        <_>
+          13 7 1 1 2.</_>
+        <_>
+          12 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 14 -1.</_>
+        <_>
+          14 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 14 -1.</_>
+        <_>
+          5 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 14 -1.</_>
+        <_>
+          14 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 16 -1.</_>
+        <_>
+          5 2 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 10 -1.</_>
+        <_>
+          7 7 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 7 3 -1.</_>
+        <_>
+          6 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 10 12 -1.</_>
+        <_>
+          14 2 5 6 2.</_>
+        <_>
+          9 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 2 -1.</_>
+        <_>
+          6 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          8 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 3 -1.</_>
+        <_>
+          6 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 6 -1.</_>
+        <_>
+          16 4 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 2 -1.</_>
+        <_>
+          6 6 2 1 2.</_>
+        <_>
+          8 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 6 -1.</_>
+        <_>
+          16 4 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 6 -1.</_>
+        <_>
+          0 4 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 6 -1.</_>
+        <_>
+          9 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 10 -1.</_>
+        <_>
+          3 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 3 2 -1.</_>
+        <_>
+          13 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 10 4 -1.</_>
+        <_>
+          2 16 5 2 2.</_>
+        <_>
+          7 18 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 6 -1.</_>
+        <_>
+          10 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 6 3 -1.</_>
+        <_>
+          14 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 3 -1.</_>
+        <_>
+          7 5 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 4 -1.</_>
+        <_>
+          0 6 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 9 -1.</_>
+        <_>
+          13 14 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 9 -1.</_>
+        <_>
+          4 14 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 1 -1.</_>
+        <_>
+          9 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 17 -1.</_>
+        <_>
+          7 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 3 -1.</_>
+        <_>
+          10 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 4 -1.</_>
+        <_>
+          7 2 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 2 -1.</_>
+        <_>
+          12 2 4 1 2.</_>
+        <_>
+          8 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 6 -1.</_>
+        <_>
+          8 3 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 2 2 -1.</_>
+        <_>
+          9 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 14 -1.</_>
+        <_>
+          1 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 7 3 -1.</_>
+        <_>
+          12 1 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 1 2 -1.</_>
+        <_>
+          1 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 8 -1.</_>
+        <_>
+          15 12 1 4 2.</_>
+        <_>
+          14 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 7 3 -1.</_>
+        <_>
+          1 1 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 8 -1.</_>
+        <_>
+          15 12 1 4 2.</_>
+        <_>
+          14 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 0 4 6 2.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 9 -1.</_>
+        <_>
+          6 4 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 2 2 -1.</_>
+        <_>
+          5 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 6 6 -1.</_>
+        <_>
+          16 14 3 3 2.</_>
+        <_>
+          13 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 2 -1.</_>
+        <_>
+          0 17 10 1 2.</_>
+        <_>
+          10 18 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 2 6 -1.</_>
+        <_>
+          11 3 1 3 2.</_>
+        <_>
+          10 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 2 -1.</_>
+        <_>
+          8 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 13 -1.</_>
+        <_>
+          10 7 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 10 5 -1.</_>
+        <_>
+          10 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 10 -1.</_>
+        <_>
+          10 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 1 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          10 3 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 7 -1.</_>
+        <_>
+          7 3 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 5 -1.</_>
+        <_>
+          7 7 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 4 3 -1.</_>
+        <_>
+          5 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 12 6 -1.</_>
+        <_>
+          14 14 6 3 2.</_>
+        <_>
+          8 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          0 13 10 2 2.</_>
+        <_>
+          10 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 14 2 -1.</_>
+        <_>
+          11 5 7 1 2.</_>
+        <_>
+          4 6 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 10 12 -1.</_>
+        <_>
+          1 2 5 6 2.</_>
+        <_>
+          6 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 3 -1.</_>
+        <_>
+          6 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 2 3 -1.</_>
+        <_>
+          8 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 2 -1.</_>
+        <_>
+          5 15 2 1 2.</_>
+        <_>
+          7 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 1 3 -1.</_>
+        <_>
+          10 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 4 -1.</_>
+        <_>
+          8 16 2 2 2.</_>
+        <_>
+          10 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 6 -1.</_>
+        <_>
+          6 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 2 -1.</_>
+        <_>
+          2 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 6 6 -1.</_>
+        <_>
+          16 14 3 3 2.</_>
+        <_>
+          13 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 4 -1.</_>
+        <_>
+          7 9 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 6 6 -1.</_>
+        <_>
+          16 14 3 3 2.</_>
+        <_>
+          13 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 6 -1.</_>
+        <_>
+          0 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 20 -1.</_>
+        <_>
+          5 10 15 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 6 -1.</_>
+        <_>
+          1 14 3 3 2.</_>
+        <_>
+          4 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 6 -1.</_>
+        <_>
+          10 14 2 3 2.</_>
+        <_>
+          8 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 1 -1.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 4 6 -1.</_>
+        <_>
+          14 14 2 3 2.</_>
+        <_>
+          12 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 6 -1.</_>
+        <_>
+          4 14 2 3 2.</_>
+        <_>
+          6 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 2 6 -1.</_>
+        <_>
+          14 14 1 3 2.</_>
+        <_>
+          13 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 2 6 -1.</_>
+        <_>
+          5 14 1 3 2.</_>
+        <_>
+          6 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 12 -1.</_>
+        <_>
+          7 4 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 2 -1.</_>
+        <_>
+          4 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 13 -1.</_>
+        <_>
+          11 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 13 -1.</_>
+        <_>
+          8 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 3 -1.</_>
+        <_>
+          10 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 2 -1.</_>
+        <_>
+          4 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 8 -1.</_>
+        <_>
+          16 12 3 4 2.</_>
+        <_>
+          13 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 5 -1.</_>
+        <_>
+          9 6 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 7 -1.</_>
+        <_>
+          17 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 8 2 -1.</_>
+        <_>
+          7 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 3 -1.</_>
+        <_>
+          6 10 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 3 -1.</_>
+        <_>
+          4 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 3 -1.</_>
+        <_>
+          11 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 17 12 -1.</_>
+        <_>
+          1 8 17 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 3 -1.</_>
+        <_>
+          11 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 3 -1.</_>
+        <_>
+          4 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 5 3 -1.</_>
+        <_>
+          12 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 2 7 -1.</_>
+        <_>
+          2 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 8 -1.</_>
+        <_>
+          16 12 1 4 2.</_>
+        <_>
+          15 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 11 3 -1.</_>
+        <_>
+          4 9 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 2 -1.</_>
+        <_>
+          12 13 3 1 2.</_>
+        <_>
+          9 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 4 3 -1.</_>
+        <_>
+          6 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          10 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 3 -1.</_>
+        <_>
+          5 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 3 -1.</_>
+        <_>
+          9 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 3 -1.</_>
+        <_>
+          0 3 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 8 -1.</_>
+        <_>
+          16 12 1 4 2.</_>
+        <_>
+          15 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 8 -1.</_>
+        <_>
+          3 12 1 4 2.</_>
+        <_>
+          4 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 3 6 -1.</_>
+        <_>
+          14 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 6 -1.</_>
+        <_>
+          3 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 2 -1.</_>
+        <_>
+          11 5 5 1 2.</_>
+        <_>
+          6 6 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 14 6 -1.</_>
+        <_>
+          2 17 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 2 -1.</_>
+        <_>
+          4 16 1 1 2.</_>
+        <_>
+          5 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 3 -1.</_>
+        <_>
+          10 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 2 -1.</_>
+        <_>
+          0 17 10 1 2.</_>
+        <_>
+          10 18 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 1 3 -1.</_>
+        <_>
+          13 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 2 -1.</_>
+        <_>
+          9 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 3 -1.</_>
+        <_>
+          13 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 2 2 -1.</_>
+        <_>
+          3 18 1 1 2.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 4 -1.</_>
+        <_>
+          10 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 3 -1.</_>
+        <_>
+          6 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 5 2 -1.</_>
+        <_>
+          13 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 2 -1.</_>
+        <_>
+          7 14 3 1 2.</_>
+        <_>
+          10 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 4 -1.</_>
+        <_>
+          12 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 12 6 -1.</_>
+        <_>
+          5 13 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 5 2 -1.</_>
+        <_>
+          14 12 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 14 4 -1.</_>
+        <_>
+          2 15 7 2 2.</_>
+        <_>
+          9 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 2 -1.</_>
+        <_>
+          10 7 7 1 2.</_>
+        <_>
+          3 8 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 2 -1.</_>
+        <_>
+          1 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 14 -1.</_>
+        <_>
+          16 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 3 -1.</_>
+        <_>
+          4 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 14 -1.</_>
+        <_>
+          16 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 7 -1.</_>
+        <_>
+          2 10 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 9 2 -1.</_>
+        <_>
+          8 13 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 1 -1.</_>
+        <_>
+          10 6 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 4 -1.</_>
+        <_>
+          8 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 9 -1.</_>
+        <_>
+          5 6 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 10 -1.</_>
+        <_>
+          15 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 7 -1.</_>
+        <_>
+          9 2 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 1 -1.</_>
+        <_>
+          11 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 9 1 -1.</_>
+        <_>
+          6 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 1 4 -1.</_>
+        <_>
+          15 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 4 -1.</_>
+        <_>
+          7 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 1 6 -1.</_>
+        <_>
+          15 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 3 -1.</_>
+        <_>
+          7 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 16 -1.</_>
+        <_>
+          15 3 1 8 2.</_>
+        <_>
+          14 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 1 6 -1.</_>
+        <_>
+          4 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 5 2 -1.</_>
+        <_>
+          12 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 4 2 -1.</_>
+        <_>
+          6 18 2 1 2.</_>
+        <_>
+          8 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 10 -1.</_>
+        <_>
+          10 4 8 5 2.</_>
+        <_>
+          2 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 10 -1.</_>
+        <_>
+          6 10 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 2 -1.</_>
+        <_>
+          9 8 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 2 -1.</_>
+        <_>
+          6 8 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 6 -1.</_>
+        <_>
+          9 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          9 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 3 -1.</_>
+        <_>
+          1 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 7 2 -1.</_>
+        <_>
+          11 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 18 -1.</_>
+        <_>
+          5 7 10 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 2 -1.</_>
+        <_>
+          18 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 1 3 -1.</_>
+        <_>
+          8 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 6 -1.</_>
+        <_>
+          3 16 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 4 -1.</_>
+        <_>
+          1 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 5 2 -1.</_>
+        <_>
+          12 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 5 2 -1.</_>
+        <_>
+          3 2 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 3 -1.</_>
+        <_>
+          10 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 2 3 -1.</_>
+        <_>
+          8 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 3 -1.</_>
+        <_>
+          14 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 3 -1.</_>
+        <_>
+          7 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 4 -1.</_>
+        <_>
+          10 6 5 2 2.</_>
+        <_>
+          5 8 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 1 6 -1.</_>
+        <_>
+          9 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 2 -1.</_>
+        <_>
+          11 12 1 1 2.</_>
+        <_>
+          10 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 6 -1.</_>
+        <_>
+          14 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 2 3 -1.</_>
+        <_>
+          8 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 6 -1.</_>
+        <_>
+          16 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 6 -1.</_>
+        <_>
+          0 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 3 -1.</_>
+        <_>
+          14 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 1 -1.</_>
+        <_>
+          8 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 3 -1.</_>
+        <_>
+          8 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 10 6 -1.</_>
+        <_>
+          5 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 2 -1.</_>
+        <_>
+          8 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 6 -1.</_>
+        <_>
+          7 12 2 3 2.</_>
+        <_>
+          9 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 1 -1.</_>
+        <_>
+          11 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 10 -1.</_>
+        <_>
+          9 7 1 5 2.</_>
+        <_>
+          10 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 6 -1.</_>
+        <_>
+          10 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 6 -1.</_>
+        <_>
+          3 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 1 2 -1.</_>
+        <_>
+          16 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 6 -1.</_>
+        <_>
+          1 14 3 3 2.</_>
+        <_>
+          4 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 6 -1.</_>
+        <_>
+          14 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 2 -1.</_>
+        <_>
+          8 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 3 -1.</_>
+        <_>
+          10 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 3 -1.</_>
+        <_>
+          14 0 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 9 -1.</_>
+        <_>
+          7 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 15 -1.</_>
+        <_>
+          11 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 15 -1.</_>
+        <_>
+          7 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 3 -1.</_>
+        <_>
+          14 0 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 3 -1.</_>
+        <_>
+          5 0 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 2 -1.</_>
+        <_>
+          7 12 1 1 2.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 4 -1.</_>
+        <_>
+          13 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 3 -1.</_>
+        <_>
+          4 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 2 -1.</_>
+        <_>
+          12 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 2 -1.</_>
+        <_>
+          9 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 2 -1.</_>
+        <_>
+          10 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 2 -1.</_>
+        <_>
+          9 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 4 -1.</_>
+        <_>
+          13 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 4 -1.</_>
+        <_>
+          6 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 4 -1.</_>
+        <_>
+          10 14 6 2 2.</_>
+        <_>
+          4 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 2 3 -1.</_>
+        <_>
+          8 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 8 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 8 -1.</_>
+        <_>
+          8 10 2 4 2.</_>
+        <_>
+          10 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 1 -1.</_>
+        <_>
+          11 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 1 6 -1.</_>
+        <_>
+          9 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 1 -1.</_>
+        <_>
+          11 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 1 -1.</_>
+        <_>
+          8 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 14 -1.</_>
+        <_>
+          5 9 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 2 10 -1.</_>
+        <_>
+          2 1 1 5 2.</_>
+        <_>
+          3 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 2 3 -1.</_>
+        <_>
+          14 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 3 -1.</_>
+        <_>
+          3 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 3 -1.</_>
+        <_>
+          17 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 3 -1.</_>
+        <_>
+          0 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 2 -1.</_>
+        <_>
+          16 5 3 1 2.</_>
+        <_>
+          13 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 12 1 -1.</_>
+        <_>
+          8 19 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 4 -1.</_>
+        <_>
+          12 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 1 3 -1.</_>
+        <_>
+          3 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 6 4 -1.</_>
+        <_>
+          11 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 10 -1.</_>
+        <_>
+          3 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 4 -1.</_>
+        <_>
+          12 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 4 -1.</_>
+        <_>
+          7 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 3 -1.</_>
+        <_>
+          10 14 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 3 -1.</_>
+        <_>
+          10 1 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 2 -1.</_>
+        <_>
+          11 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 2 -1.</_>
+        <_>
+          8 6 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 6 -1.</_>
+        <_>
+          2 11 8 3 2.</_>
+        <_>
+          10 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 2 -1.</_>
+        <_>
+          13 7 1 1 2.</_>
+        <_>
+          12 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 3 -1.</_>
+        <_>
+          9 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 12 -1.</_>
+        <_>
+          5 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 2 -1.</_>
+        <_>
+          13 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 2 -1.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 3 -1.</_>
+        <_>
+          4 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 6 -1.</_>
+        <_>
+          10 14 1 3 2.</_>
+        <_>
+          9 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 2 -1.</_>
+        <_>
+          9 14 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          11 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 6 -1.</_>
+        <_>
+          7 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 1 2 -1.</_>
+        <_>
+          13 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 2 -1.</_>
+        <_>
+          0 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 1 2 -1.</_>
+        <_>
+          13 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 7 -1.</_>
+        <_>
+          13 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 1 2 -1.</_>
+        <_>
+          6 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 7 -1.</_>
+        <_>
+          12 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 16 -1.</_>
+        <_>
+          0 3 1 8 2.</_>
+        <_>
+          1 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 7 -1.</_>
+        <_>
+          12 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 7 -1.</_>
+        <_>
+          7 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 8 4 -1.</_>
+        <_>
+          11 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 8 4 -1.</_>
+        <_>
+          5 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 7 -1.</_>
+        <_>
+          13 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 7 -1.</_>
+        <_>
+          6 5 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 14 -1.</_>
+        <_>
+          18 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 4 -1.</_>
+        <_>
+          6 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 1 2 -1.</_>
+        <_>
+          14 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 6 -1.</_>
+        <_>
+          0 1 9 3 2.</_>
+        <_>
+          9 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 1 2 -1.</_>
+        <_>
+          14 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 14 -1.</_>
+        <_>
+          0 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 12 -1.</_>
+        <_>
+          18 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 3 -1.</_>
+        <_>
+          0 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 16 -1.</_>
+        <_>
+          6 8 14 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 12 -1.</_>
+        <_>
+          1 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 7 -1.</_>
+        <_>
+          14 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 1 2 -1.</_>
+        <_>
+          5 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 6 -1.</_>
+        <_>
+          14 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 7 2 -1.</_>
+        <_>
+          5 8 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          8 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 1 -1.</_>
+        <_>
+          7 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 4 -1.</_>
+        <_>
+          16 0 3 2 2.</_>
+        <_>
+          13 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 12 -1.</_>
+        <_>
+          1 6 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 17 12 -1.</_>
+        <_>
+          3 6 17 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 7 3 -1.</_>
+        <_>
+          5 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 3 3 -1.</_>
+        <_>
+          3 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 6 -1.</_>
+        <_>
+          14 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 6 -1.</_>
+        <_>
+          0 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 3 -1.</_>
+        <_>
+          12 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 3 -1.</_>
+        <_>
+          4 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 6 -1.</_>
+        <_>
+          18 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 9 -1.</_>
+        <_>
+          10 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 2 -1.</_>
+        <_>
+          6 6 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 2 -1.</_>
+        <_>
+          6 5 2 1 2.</_>
+        <_>
+          8 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 2 3 -1.</_>
+        <_>
+          10 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 1 3 -1.</_>
+        <_>
+          9 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 2 -1.</_>
+        <_>
+          9 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 3 -1.</_>
+        <_>
+          0 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          6 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 4 -1.</_>
+        <_>
+          1 0 3 2 2.</_>
+        <_>
+          4 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 7 -1.</_>
+        <_>
+          14 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 2 -1.</_>
+        <_>
+          9 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 10 -1.</_>
+        <_>
+          11 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 19 2 -1.</_>
+        <_>
+          0 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 9 -1.</_>
+        <_>
+          9 8 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 7 -1.</_>
+        <_>
+          5 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 12 -1.</_>
+        <_>
+          10 6 2 6 2.</_>
+        <_>
+          8 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 4 -1.</_>
+        <_>
+          0 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 7 -1.</_>
+        <_>
+          9 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 4 -1.</_>
+        <_>
+          10 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 4 -1.</_>
+        <_>
+          9 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 1 -1.</_>
+        <_>
+          9 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 4 -1.</_>
+        <_>
+          7 14 2 2 2.</_>
+        <_>
+          9 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 4 6 -1.</_>
+        <_>
+          15 14 2 3 2.</_>
+        <_>
+          13 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 1 8 -1.</_>
+        <_>
+          7 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 8 -1.</_>
+        <_>
+          17 0 1 4 2.</_>
+        <_>
+          16 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 8 -1.</_>
+        <_>
+          2 0 1 4 2.</_>
+        <_>
+          3 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 3 -1.</_>
+        <_>
+          6 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 10 -1.</_>
+        <_>
+          7 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 2 -1.</_>
+        <_>
+          9 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 8 -1.</_>
+        <_>
+          7 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          9 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 3 -1.</_>
+        <_>
+          7 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 2 -1.</_>
+        <_>
+          6 1 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 14 -1.</_>
+        <_>
+          7 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 1 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 9 -1.</_>
+        <_>
+          10 3 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 3 -1.</_>
+        <_>
+          18 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 3 1 -1.</_>
+        <_>
+          8 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 4 -1.</_>
+        <_>
+          11 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 6 -1.</_>
+        <_>
+          8 14 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 4 -1.</_>
+        <_>
+          11 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 4 -1.</_>
+        <_>
+          8 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 9 -1.</_>
+        <_>
+          7 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 3 -1.</_>
+        <_>
+          0 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 3 -1.</_>
+        <_>
+          8 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          0 4 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 3 -1.</_>
+        <_>
+          9 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 4 -1.</_>
+        <_>
+          0 17 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 6 -1.</_>
+        <_>
+          1 17 18 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt2.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt2.xml
new file mode 100644
index 000000000..b49cf5df3
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt2.xml
@@ -0,0 +1,20719 @@
+<?xml version="1.0"?>
+<!--
+    Tree-based 20x20 gentle adaboost frontal face detector.
+    Created by Rainer Lienhart.
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>109</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>3</maxWeakCount>
+      <stageThreshold>3.5069230198860168e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 0 4.3272329494357109e-03 -1 -2 1 1.3076160103082657e-02</internalNodes>
+          <leafValues>
+            3.8381900638341904e-02 8.9652568101882935e-01
+            2.6293140649795532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2 5.2434601821005344e-04 -1 -2 3 4.4573000632226467e-03</internalNodes>
+          <leafValues>
+            1.0216630250215530e-01 1.2384019792079926e-01
+            6.9103831052780151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 4 -9.2708261217921972e-04 -1 -2 5 3.3989109215326607e-04</internalNodes>
+          <leafValues>
+            1.9536970555782318e-01 2.1014410257339478e-01
+            8.2586747407913208e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>3.4721779823303223e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 6 2.3025739938020706e-03 -1 -2 7 4.4174338690936565e-03</internalNodes>
+          <leafValues>
+            1.0183759778738022e-01 8.2190579175949097e-01
+            1.9565549492835999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 8 2.2203210741281509e-02 -1 -2 9 -1.7283110355492681e-04</internalNodes>
+          <leafValues>
+            2.2054070234298706e-01 7.3263257741928101e-02
+            5.9314841032028198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 10 4.3567270040512085e-03 -1 -2 11
+            -2.6032889727503061e-03</internalNodes>
+          <leafValues>
+            1.8441149592399597e-01 4.0322139859199524e-01
+            8.0665212869644165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 12 1.7309630056843162e-03 -1 -2 13
+            -7.8146401792764664e-03</internalNodes>
+          <leafValues>
+            2.5483280420303345e-01 6.0570698976516724e-01
+            2.7790638804435730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 14 -8.7343417108058929e-03 -1 -2 15
+            9.4522320432588458e-04</internalNodes>
+          <leafValues>
+            2.8899800777435303e-01 7.6165872812271118e-01
+            3.4956431388854980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 16 4.9414858222007751e-02 -1 -2 17
+            4.4891750440001488e-03</internalNodes>
+          <leafValues>
+            8.1516528129577637e-01 2.8087830543518066e-01
+            6.0277748107910156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 18 6.0313619673252106e-02 -1 -2 19
+            -1.0762850288301706e-03</internalNodes>
+          <leafValues>
+            7.6075017452239990e-01 4.4440358877182007e-01
+            1.4373120665550232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 20 -9.5083238556981087e-03 -1 -2 21
+            7.6601309701800346e-03</internalNodes>
+          <leafValues>
+            5.3181701898574829e-01 5.4110521078109741e-01
+            2.1806870400905609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 22 7.6467678882181644e-03 -1 -2 23
+            -8.4662932204082608e-04</internalNodes>
+          <leafValues>
+            1.1589600145816803e-01 2.3406790196895599e-01
+            5.9903818368911743e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>14</maxWeakCount>
+      <stageThreshold>5.9844889640808105e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 24 -4.8506218008697033e-03 -1 -2 25
+            -4.6141650527715683e-03</internalNodes>
+          <leafValues>
+            1.8054960668087006e-01 2.1778939664363861e-01
+            8.0182367563247681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 26 -2.4301309604197741e-03 -1 -2 27
+            4.1787960799410939e-04</internalNodes>
+          <leafValues>
+            1.1413549631834030e-01 1.2030939757823944e-01
+            6.1085307598114014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 28 1.0010929545387626e-03 -1 -2 29
+            1.0577100329101086e-03</internalNodes>
+          <leafValues>
+            2.0799599587917328e-01 3.3020541071891785e-01
+            7.5110942125320435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 30 1.2376549420878291e-03 -1 -2 31
+            3.5315038985572755e-04</internalNodes>
+          <leafValues>
+            2.7682220935821533e-01 1.6682930290699005e-01
+            5.8294767141342163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 32 -1.1953660286962986e-02 -1 -2 33
+            1.4182999730110168e-03</internalNodes>
+          <leafValues>
+            1.5087880194187164e-01 4.3912279605865479e-01
+            7.6465952396392822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 34 3.4642980899661779e-03 -1 -2 35
+            -1.4948950149118900e-02</internalNodes>
+          <leafValues>
+            2.6515561342239380e-01 2.2980530560016632e-01
+            5.4421657323837280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 36 -1.0506849503144622e-03 -1 -2 37
+            -4.0782918222248554e-03</internalNodes>
+          <leafValues>
+            3.6228439211845398e-01 2.6012599468231201e-01
+            7.2336578369140625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 38 5.4242828628048301e-04 -1 -2 39
+            -7.3204059153795242e-03</internalNodes>
+          <leafValues>
+            3.8496789336204529e-01 2.9655128717422485e-01
+            5.4803091287612915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 40 1.1421289527788758e-03 -1 -2 41
+            1.1783400550484657e-03</internalNodes>
+          <leafValues>
+            4.1047701239585876e-01 7.2390240430831909e-01
+            2.7872839570045471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 42 4.4077109545469284e-02 -1 -2 43
+            3.7900090683251619e-03</internalNodes>
+          <leafValues>
+            5.6405162811279297e-01 5.9475481510162354e-01
+            3.3120200037956238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 44 -2.4291418958455324e-03 -1 -2 45
+            9.4262324273586273e-03</internalNodes>
+          <leafValues>
+            6.6032320261001587e-01 4.6806651353836060e-01
+            2.0643380284309387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 46 8.0630257725715637e-03 -1 -2 47
+            5.2240812219679356e-03</internalNodes>
+          <leafValues>
+            5.2988511323928833e-01 5.2816027402877808e-01
+            1.9095499813556671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 48 -7.0630568079650402e-03 -1 -2 49
+            5.6897541508078575e-03</internalNodes>
+          <leafValues>
+            1.3806459307670593e-01 5.4906368255615234e-01
+            1.2602810561656952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 50 1.2472929665818810e-03 -1 -2 51
+            4.9543488770723343e-02</internalNodes>
+          <leafValues>
+            2.3726630210876465e-01 5.2401661872863770e-01
+            1.7692160606384277e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>8.5117864608764648e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 52 -4.9326149746775627e-03 -1 -2 53
+            2.7918140403926373e-05</internalNodes>
+          <leafValues>
+            1.9980649650096893e-01 2.2993800044059753e-01
+            7.3932111263275146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 54 3.0876200180500746e-03 -1 -2 55
+            7.4669660534709692e-06</internalNodes>
+          <leafValues>
+            1.5338400006294250e-01 2.0368589460849762e-01
+            5.8549159765243530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 56 1.8739729421213269e-03 -1 -2 57
+            9.3380251200869679e-04</internalNodes>
+          <leafValues>
+            2.0498959720134735e-01 3.2341998815536499e-01
+            7.3230141401290894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 58 1.9151850137859583e-03 -1 -2 59
+            -5.9683797881007195e-03</internalNodes>
+          <leafValues>
+            3.0451491475105286e-01 2.9321339726448059e-01
+            5.6212961673736572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 60 -7.2115601506084204e-04 -1 -2 61
+            -5.9663117863237858e-03</internalNodes>
+          <leafValues>
+            3.6580368876457214e-01 2.7121558785438538e-01
+            7.2263348102569580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 62 3.0874179676175117e-02 -1 -2 63
+            -1.1099710129201412e-02</internalNodes>
+          <leafValues>
+            4.4198378920555115e-01 3.6129769682884216e-01
+            5.2514511346817017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 64 2.1164179779589176e-03 -1 -2 65
+            -9.4317439943552017e-03</internalNodes>
+          <leafValues>
+            3.6286169290542603e-01 1.6010950505733490e-01
+            7.0522767305374146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 66 -3.5266019403934479e-03 -1 -2 67
+            -1.6907559474930167e-03</internalNodes>
+          <leafValues>
+            1.3012880086898804e-01 1.7863239347934723e-01
+            5.5215299129486084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 68 4.6470930101349950e-04 -1 -2 69
+            -1.0215570218861103e-02</internalNodes>
+          <leafValues>
+            3.4873831272125244e-01 2.6739910244941711e-01
+            6.6679191589355469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 70 1.2634709710255265e-03 -1 -2 71
+            -1.1875299736857414e-02</internalNodes>
+          <leafValues>
+            3.4378638863563538e-01 5.9953361749649048e-01
+            3.4977179765701294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 72 -1.0732339695096016e-02 -1 -2 73
+            7.1836481802165508e-03</internalNodes>
+          <leafValues>
+            2.1504899859428406e-01 6.2714362144470215e-01
+            2.5195419788360596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 74 -2.8340889140963554e-02 -1 -2 75
+            -4.5813230099156499e-04</internalNodes>
+          <leafValues>
+            8.2411892712116241e-02 5.9100568294525146e-01
+            3.7052011489868164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 76 4.2940340936183929e-03 -1 -2 77
+            1.0751079767942429e-02</internalNodes>
+          <leafValues>
+            1.5947279334068298e-01 5.9804809093475342e-01
+            2.8325080871582031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 78 2.2465119138360023e-02 -1 -2 79
+            -5.7988539338111877e-02</internalNodes>
+          <leafValues>
+            7.8770911693572998e-01 1.5557409822940826e-01
+            5.2396571636199951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 80 7.2110891342163086e-03 -1 -2 81
+            -4.8367571085691452e-02</internalNodes>
+          <leafValues>
+            6.6203659772872925e-01 1.4247199892997742e-01
+            4.4298338890075684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 82 -1.4418059960007668e-02 -1 -2 83
+            -2.3156389594078064e-02</internalNodes>
+          <leafValues>
+            1.5885409712791443e-01 2.3757989704608917e-01
+            5.2171349525451660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 84 7.6985340565443039e-03 -1 -2 85
+            -5.6248619221150875e-03</internalNodes>
+          <leafValues>
+            1.9417250156402588e-01 6.2784057855606079e-01
+            3.7460449337959290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 86 -7.2936748620122671e-04 -1 -2 87
+            6.1783898854628205e-04</internalNodes>
+          <leafValues>
+            3.8409221172332764e-01 3.1064930558204651e-01
+            5.5378472805023193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 88 -4.5803939428878948e-05 -1 -2 89
+            -1.4719359569426160e-05</internalNodes>
+          <leafValues>
+            3.4444490075111389e-01 2.7295520901679993e-01
+            6.4289510250091553e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>8.4680156707763672e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 90 -1.3469370314851403e-03 -1 -2 91
+            -2.4774789344519377e-03</internalNodes>
+          <leafValues>
+            1.6570860147476196e-01 2.2738510370254517e-01
+            6.9893497228622437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 92 5.2632777951657772e-03 -1 -2 93
+            4.9075339920818806e-03</internalNodes>
+          <leafValues>
+            1.5120740234851837e-01 5.5644702911376953e-01
+            1.6054420173168182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 94 -2.3254349362105131e-03 -1 -2 95
+            -1.4665479538962245e-03</internalNodes>
+          <leafValues>
+            1.8802590668201447e-01 3.1224989891052246e-01
+            7.1653962135314941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 96 -1.2311690300703049e-01 -1 -2 97
+            2.2108340635895729e-03</internalNodes>
+          <leafValues>
+            3.8595831394195557e-01 2.4552939832210541e-01
+            5.6957101821899414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 98 2.0661531016230583e-03 -1 -2 99
+            3.6130280932411551e-04</internalNodes>
+          <leafValues>
+            2.7165201306343079e-01 2.2933620214462280e-01
+            7.2086298465728760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 100 7.9957872629165649e-02 -1 -2 101
+            2.6064720004796982e-03</internalNodes>
+          <leafValues>
+            7.8336209058761597e-01 5.5452322959899902e-01
+            2.5506898760795593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 102 6.5699010156095028e-03 -1 -2 103
+            1.6259610420092940e-03</internalNodes>
+          <leafValues>
+            1.8193900585174561e-01 3.5298758745193481e-01
+            6.5528190135955811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 104 3.6204981151968241e-03 -1 -2 105
+            -4.4391951523721218e-03</internalNodes>
+          <leafValues>
+            5.4623097181320190e-01 1.3598430156707764e-01
+            5.4158151149749756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 106 -9.0540945529937744e-03 -1 -2 107
+            -4.6067481162026525e-04</internalNodes>
+          <leafValues>
+            1.1151199787855148e-01 5.8467197418212891e-01
+            2.5983488559722900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 108 -5.6621041148900986e-03 -1 -2 109
+            5.1165837794542313e-03</internalNodes>
+          <leafValues>
+            1.6105690598487854e-01 5.3766787052154541e-01
+            1.7394550144672394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 110 -2.1362339612096548e-03 -1 -2 111
+            -5.4809921421110630e-03</internalNodes>
+          <leafValues>
+            1.9020730257034302e-01 3.2720080018043518e-01
+            6.3648408651351929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 112 -8.1061907112598419e-03 -1 -2 113
+            6.0048708692193031e-03</internalNodes>
+          <leafValues>
+            6.9148528575897217e-01 4.3273261189460754e-01
+            6.9638431072235107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 114 -8.7028548121452332e-02 -1 -2 115
+            -4.7809639945626259e-03</internalNodes>
+          <leafValues>
+            8.5941338539123535e-01 9.7394466400146484e-02
+            4.5870301127433777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 116 -2.2166660055518150e-03 -1 -2 117
+            1.3642730191349983e-03</internalNodes>
+          <leafValues>
+            2.5546258687973022e-01 3.3190909028053284e-01
+            5.9641027450561523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 118 -9.0077864006161690e-03 -1 -2 119
+            -1.5494120307266712e-02</internalNodes>
+          <leafValues>
+            2.6665949821472168e-01 1.8481859564781189e-01
+            6.2459707260131836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 120 -4.2165028862655163e-03 -1 -2 121
+            4.3249759823083878e-02</internalNodes>
+          <leafValues>
+            5.3799271583557129e-01 5.1830291748046875e-01
+            2.1704199910163879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 122 2.8786511393263936e-04 -1 -2 123
+            1.2373150093480945e-03</internalNodes>
+          <leafValues>
+            2.6133841276168823e-01 2.7865320444107056e-01
+            5.9089881181716919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 124 1.9528300035744905e-03 -1 -2 125
+            -1.4947060262784362e-03</internalNodes>
+          <leafValues>
+            2.6128691434860229e-01 5.9154129028320312e-01
+            3.4557819366455078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 126 3.5878680646419525e-03 -1 -2 127
+            -2.5938691105693579e-03</internalNodes>
+          <leafValues>
+            1.5870520472526550e-01 1.2704110145568848e-01
+            5.9794288873672485e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>1.2578499794006348e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 128 3.5810680128633976e-03 -1 -2 129
+            -2.8552350122481585e-03</internalNodes>
+          <leafValues>
+            1.9951049983501434e-01 7.3730701208114624e-01
+            2.9217371344566345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 130 1.9758539274334908e-03 -1 -2 131
+            3.2583118882030249e-03</internalNodes>
+          <leafValues>
+            1.9564199447631836e-01 5.6920468807220459e-01
+            1.8390649557113647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 132 2.3711679386906326e-04 -1 -2 133
+            2.5942500215023756e-03</internalNodes>
+          <leafValues>
+            2.1716670691967010e-01 2.7199891209602356e-01
+            7.1502441167831421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 134 -2.5032449513673782e-02 -1 -2 135
+            6.3087949529290199e-03</internalNodes>
+          <leafValues>
+            1.8251839280128479e-01 5.6998378038406372e-01
+            3.5098528861999512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 136 -3.2494920305907726e-03 -1 -2 137
+            -1.4885730110108852e-02</internalNodes>
+          <leafValues>
+            4.0239268541336060e-01 3.6040958762168884e-01
+            7.2919952869415283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 138 8.0623216927051544e-03 -1 -2 139
+            2.7405679225921631e-02</internalNodes>
+          <leafValues>
+            6.4914900064468384e-01 5.5189931392669678e-01
+            2.6596811413764954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 140 3.4368600696325302e-02 -1 -2 141
+            -2.7292970567941666e-02</internalNodes>
+          <leafValues>
+            6.7125129699707031e-01 1.6913780570030212e-01
+            4.3262779712677002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 142 7.4452121043577790e-04 -1 -2 143
+            7.0336280623450875e-04</internalNodes>
+          <leafValues>
+            3.4051001071929932e-01 5.5167931318283081e-01
+            3.3113878965377808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 144 -1.2275460362434387e-01 -1 -2 145
+            3.2559928949922323e-03</internalNodes>
+          <leafValues>
+            1.6753150522708893e-01 3.6157518625259399e-01
+            6.4207828044891357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 146 -3.2090399414300919e-02 -1 -2 147
+            3.2957999501377344e-03</internalNodes>
+          <leafValues>
+            2.9210790991783142e-01 5.6130319833755493e-01
+            3.3578601479530334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 148 -3.2273170072585344e-03 -1 -2 149
+            1.1171669466421008e-03</internalNodes>
+          <leafValues>
+            6.9706428050994873e-01 3.5411500930786133e-01
+            6.1440062522888184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 150 -1.7279950901865959e-02 -1 -2 151
+            1.1741200461983681e-02</internalNodes>
+          <leafValues>
+            5.5371809005737305e-01 5.3419572114944458e-01
+            2.7571049332618713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 152 4.6405228786170483e-03 -1 -2 153
+            -1.6913030296564102e-02</internalNodes>
+          <leafValues>
+            2.4895210564136505e-01 1.7119289934635162e-01
+            5.5239528417587280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 154 1.0060169734060764e-02 -1 -2 155
+            -6.0715491417795420e-04</internalNodes>
+          <leafValues>
+            8.2734507322311401e-01 3.7793910503387451e-01
+            5.4762518405914307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 156 -1.0865400545299053e-03 -1 -2 157
+            8.9362077414989471e-03</internalNodes>
+          <leafValues>
+            3.2965409755706787e-01 6.0628837347030640e-01
+            2.4342200160026550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 158 -2.6372660067863762e-04 -1 -2 159
+            1.3110050000250340e-02</internalNodes>
+          <leafValues>
+            3.8140949606895447e-01 5.5176162719726562e-01
+            3.7268930673599243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 160 -2.9806280508637428e-03 -1 -2 161
+            -4.1619571857154369e-03</internalNodes>
+          <leafValues>
+            1.2296640127897263e-01 7.2522747516632080e-01
+            4.9734550714492798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 162 3.3842328935861588e-02 -1 -2 163
+            -1.2564560165628791e-03</internalNodes>
+          <leafValues>
+            5.3483128547668457e-01 5.8519148826599121e-01
+            4.3841668963432312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 164 -1.9635230302810669e-02 -1 -2 165
+            -9.9625496659427881e-04</internalNodes>
+          <leafValues>
+            2.2978340089321136e-01 6.2959378957748413e-01
+            4.1315990686416626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 166 -2.3127110674977303e-02 -1 -2 167
+            2.3525709286332130e-02</internalNodes>
+          <leafValues>
+            1.6954590380191803e-01 5.1741302013397217e-01
+            5.9519391506910324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 168 -1.9356520846486092e-02 -1 -2 169
+            -4.1787112131714821e-03</internalNodes>
+          <leafValues>
+            1.3572479784488678e-01 2.9966288805007935e-01
+            5.7916951179504395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 170 3.1488779932260513e-03 -1 -2 171
+            7.3972279205918312e-03</internalNodes>
+          <leafValues>
+            6.5925890207290649e-01 5.3071719408035278e-01
+            3.7951210141181946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 172 7.1955118983169086e-06 -1 -2 173
+            4.7114409506320953e-02</internalNodes>
+          <leafValues>
+            3.1283149123191833e-01 5.5378931760787964e-01
+            1.0273090004920959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 174 7.2878710925579071e-03 -1 -2 175
+            -6.1887511983513832e-03</internalNodes>
+          <leafValues>
+            4.6608591079711914e-01 7.1588581800460815e-01
+            4.7244489192962646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 176 2.9757320880889893e-03 -1 -2 177
+            -1.8449809867888689e-03</internalNodes>
+          <leafValues>
+            5.9345688670873642e-02 7.0273017883300781e-01
+            4.7187310457229614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 178 1.0239540279144421e-04 -1 -2 179
+            2.4277009069919586e-03</internalNodes>
+          <leafValues>
+            5.8947342634201050e-01 4.8623558878898621e-01
+            5.2475881576538086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 180 -6.4751312136650085e-02 -1 -2 181
+            3.9380151429213583e-04</internalNodes>
+          <leafValues>
+            6.9174712896347046e-01 4.6696171164512634e-01
+            2.3824059963226318e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>31</maxWeakCount>
+      <stageThreshold>1.4546750068664551e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 182 1.4397440245375037e-03 -1 -2 183
+            -5.4068560712039471e-04</internalNodes>
+          <leafValues>
+            2.7734708786010742e-01 7.4271547794342041e-01
+            2.4797350168228149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 184 -7.1237959673453588e-06 -1 -2 185
+            -2.3661039303988218e-03</internalNodes>
+          <leafValues>
+            2.1995030343532562e-01 5.8899897336959839e-01
+            2.5957161188125610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 186 1.7343269428238273e-03 -1 -2 187
+            1.5874590026214719e-03</internalNodes>
+          <leafValues>
+            1.8601259589195251e-01 4.1518709063529968e-01
+            7.1034741401672363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 188 3.7285638973116875e-03 -1 -2 189
+            -1.2883819639682770e-01</internalNodes>
+          <leafValues>
+            2.5279670953750610e-01 1.3930009305477142e-01
+            5.2545148134231567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 190 7.9412180930376053e-03 -1 -2 191
+            -1.2661729939281940e-02</internalNodes>
+          <leafValues>
+            2.4877290427684784e-01 2.7107000350952148e-01
+            6.6188377141952515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 192 3.0146789868013002e-05 -1 -2 193
+            -1.6330160200595856e-02</internalNodes>
+          <leafValues>
+            3.8128259778022766e-01 2.3264320194721222e-01
+            5.2630108594894409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 194 1.4622770322603174e-05 -1 -2 195
+            -2.0858660340309143e-02</internalNodes>
+          <leafValues>
+            4.2933320999145508e-01 1.6004039347171783e-01
+            6.7823147773742676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 196 2.8194559272378683e-03 -1 -2 197
+            3.7899368908256292e-03</internalNodes>
+          <leafValues>
+            6.6792941093444824e-01 4.5877051353454590e-01
+            7.1762388944625854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 198 3.5344641655683517e-02 -1 -2 199
+            -1.1571600334718823e-03</internalNodes>
+          <leafValues>
+            1.8640750646591187e-01 5.5382597446441650e-01
+            3.1504508852958679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 200 -5.8742752298712730e-03 -1 -2 201
+            -1.5201780115603469e-05</internalNodes>
+          <leafValues>
+            2.8287911415100098e-01 5.8702242374420166e-01
+            3.7048238515853882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 202 -2.2681879636365920e-04 -1 -2 203
+            3.7845689803361893e-03</internalNodes>
+          <leafValues>
+            4.2189309000968933e-01 6.6670012474060059e-01
+            2.4611820280551910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 204 -8.5295992903411388e-05 -1 -2 205
+            -4.4394891709089279e-02</internalNodes>
+          <leafValues>
+            3.5575878620147705e-01 1.6655470430850983e-01
+            5.2348488569259644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 206 1.0126030538231134e-03 -1 -2 207
+            -7.6327780261635780e-03</internalNodes>
+          <leafValues>
+            2.8846129775047302e-01 2.9693400859832764e-01
+            6.0801112651824951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 208 4.0330411866307259e-03 -1 -2 209
+            1.3676689565181732e-01</internalNodes>
+          <leafValues>
+            4.5363900065422058e-01 5.1772642135620117e-01
+            1.4491820335388184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 210 -5.0060478970408440e-03 -1 -2 211
+            -1.2475839816033840e-02</internalNodes>
+          <leafValues>
+            7.6169097423553467e-01 2.1597060561180115e-01
+            5.4601877927780151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 212 -9.4012258341535926e-04 -1 -2 213
+            -1.2191980145871639e-02</internalNodes>
+          <leafValues>
+            3.9262959361076355e-01 3.4788811206817627e-01
+            5.5426627397537231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 214 -5.4959481349214911e-04 -1 -2 215
+            -2.1802430273965001e-04</internalNodes>
+          <leafValues>
+            6.0642760992050171e-01 5.6974071264266968e-01
+            1.7797139286994934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 216 6.9115799851715565e-03 -1 -2 217
+            -9.7631698008626699e-04</internalNodes>
+          <leafValues>
+            5.3793722391128540e-01 3.3278390765190125e-01
+            5.4615312814712524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 218 -8.7870173156261444e-03 -1 -2 219
+            -1.6761029837653041e-03</internalNodes>
+          <leafValues>
+            2.1161609888076782e-01 6.6358232498168945e-01
+            4.3658590316772461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 220 -5.5694948881864548e-02 -1 -2 221
+            -1.9844379276037216e-02</internalNodes>
+          <leafValues>
+            5.3874248266220093e-01 1.6028049588203430e-01
+            5.3304588794708252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 222 -7.4751611100509763e-04 -1 -2 223
+            2.3032890632748604e-02</internalNodes>
+          <leafValues>
+            2.9174768924713135e-01 5.6081241369247437e-01
+            1.9979810714721680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 224 -3.0700280331075191e-03 -1 -2 225
+            -1.1636839481070638e-03</internalNodes>
+          <leafValues>
+            3.9383140206336975e-01 5.7574361562728882e-01
+            4.2394569516181946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 226 2.2464339435100555e-01 -1 -2 227
+            1.4412109740078449e-03</internalNodes>
+          <leafValues>
+            7.6765531301498413e-01 5.3538662195205688e-01
+            2.5147768855094910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 228 -3.0011249706149101e-02 -1 -2 229
+            -5.3078960627317429e-02</internalNodes>
+          <leafValues>
+            2.3649039864540100e-01 2.3858639597892761e-01
+            5.4146647453308105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 230 2.0800929050892591e-03 -1 -2 231
+            -4.0738182142376900e-03</internalNodes>
+          <leafValues>
+            6.5116149187088013e-01 6.0304141044616699e-01
+            3.5877010226249695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 232 -1.9529370591044426e-02 -1 -2 233
+            -5.3309470415115356e-02</internalNodes>
+          <leafValues>
+            5.4235929250717163e-01 2.3609539866447449e-01
+            5.4017579555511475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 234 -3.4849561750888824e-02 -1 -2 235
+            -1.2658450007438660e-01</internalNodes>
+          <leafValues>
+            2.8369858860969543e-01 1.8135160207748413e-01
+            5.4210460186004639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 236 7.3325118137290701e-06 -1 -2 237
+            -1.1843870393931866e-02</internalNodes>
+          <leafValues>
+            3.9803659915924072e-01 2.6163849234580994e-01
+            5.2377301454544067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 238 -4.8470678739249706e-03 -1 -2 239
+            8.1693977117538452e-03</internalNodes>
+          <leafValues>
+            2.4381080269813538e-01 5.3271460533142090e-01
+            8.1903767585754395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 240 -6.4716790802776814e-03 -1 -2 241
+            -1.5188479665084742e-05</internalNodes>
+          <leafValues>
+            4.6796938776969910e-01 5.5639117956161499e-01
+            4.3675860762596130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 242 3.0696711037307978e-03 -1 -2 243
+            -1.6296720423270017e-04</internalNodes>
+          <leafValues>
+            6.6643488407135010e-01 5.5946111679077148e-01
+            3.0427119135856628e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>39</maxWeakCount>
+      <stageThreshold>1.8572250366210938e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 244 -9.8275858908891678e-03 -1 -2 245
+            -4.1693858802318573e-03</internalNodes>
+          <leafValues>
+            2.1160189807415009e-01 6.9246852397918701e-01
+            3.0437770485877991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 246 3.5341319744475186e-04 -1 -2 247
+            4.8054549843072891e-03</internalNodes>
+          <leafValues>
+            3.1832858920097351e-01 5.4565590620040894e-01
+            2.5222688913345337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 248 2.1071180526632816e-04 -1 -2 249
+            -2.8318869881331921e-03</internalNodes>
+          <leafValues>
+            2.9026180505752563e-01 3.1304559111595154e-01
+            6.8849372863769531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 250 -7.5633679443853907e-06 -1 -2 251
+            -8.2888139877468348e-04</internalNodes>
+          <leafValues>
+            2.9624658823013306e-01 3.0996260046958923e-01
+            5.7525151968002319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 252 1.6209259629249573e-03 -1 -2 253
+            9.1338958591222763e-03</internalNodes>
+          <leafValues>
+            3.9931958913803101e-01 4.8273721337318420e-01
+            7.5378328561782837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 254 -4.1212290525436401e-03 -1 -2 255
+            -2.5447290390729904e-03</internalNodes>
+          <leafValues>
+            2.6169270277023315e-01 3.1087028980255127e-01
+            5.4912358522415161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 256 -6.2652782071381807e-04 -1 -2 257
+            -3.6596331483451650e-05</internalNodes>
+          <leafValues>
+            3.2396918535232544e-01 6.5174108743667603e-01
+            4.1789120435714722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 258 1.3882719911634922e-02 -1 -2 259
+            1.0493700392544270e-03</internalNodes>
+          <leafValues>
+            6.7712038755416870e-01 4.1595110297203064e-01
+            5.6528919935226440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 260 1.8215360119938850e-02 -1 -2 261
+            -1.1334580369293690e-02</internalNodes>
+          <leafValues>
+            7.6896011829376221e-01 2.8733238577842712e-01
+            4.9889329075813293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 262 -4.1097560897469521e-03 -1 -2 263
+            4.2612891411408782e-04</internalNodes>
+          <leafValues>
+            5.4630082845687866e-01 3.6312350630760193e-01
+            5.5125522613525391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 264 6.0301548801362514e-03 -1 -2 265
+            3.3587709185667336e-04</internalNodes>
+          <leafValues>
+            1.1437670141458511e-01 2.8910788893699646e-01
+            5.4473417997360229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 266 6.2279507983475924e-04 -1 -2 267
+            -2.5837119668722153e-02</internalNodes>
+          <leafValues>
+            3.0234318971633911e-01 2.1670059859752655e-01
+            5.2781528234481812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 268 2.1774910390377045e-02 -1 -2 269
+            1.7682299949228764e-03</internalNodes>
+          <leafValues>
+            3.2548341155052185e-01 5.2630507946014404e-01
+            7.5263291597366333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 270 -1.3793810270726681e-02 -1 -2 271
+            -5.0852829590439796e-03</internalNodes>
+          <leafValues>
+            7.4103301763534546e-01 6.8366098403930664e-01
+            4.5790711045265198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 272 6.1795017682015896e-03 -1 -2 273
+            1.0030319914221764e-02</internalNodes>
+          <leafValues>
+            7.4499362707138062e-01 4.8607799410820007e-01
+            2.3614570498466492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 274 -6.4201927743852139e-03 -1 -2 275
+            -5.6961281225085258e-03</internalNodes>
+          <leafValues>
+            1.4673270285129547e-01 2.3478199541568756e-01
+            5.3233772516250610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 276 -7.1498160250484943e-03 -1 -2 277
+            2.4450740311294794e-03</internalNodes>
+          <leafValues>
+            1.4770570397377014e-01 3.4985339641571045e-01
+            5.8035618066787720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 278 -3.7503410130739212e-02 -1 -2 279
+            4.7799441381357610e-04</internalNodes>
+          <leafValues>
+            5.2595508098602295e-01 4.3628829717636108e-01
+            6.2089228630065918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 280 -7.0806080475449562e-03 -1 -2 281
+            3.2818000763654709e-02</internalNodes>
+          <leafValues>
+            2.0394609868526459e-01 5.1983588933944702e-01
+            1.3711960613727570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 282 6.5188988810405135e-04 -1 -2 283
+            4.6485587954521179e-03</internalNodes>
+          <leafValues>
+            6.3234299421310425e-01 4.7201630473136902e-01
+            6.5670871734619141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 284 -1.9827929791063070e-03 -1 -2 285
+            -1.6011310508474708e-03</internalNodes>
+          <leafValues>
+            6.0530602931976318e-01 5.0905191898345947e-01
+            3.1169331073760986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 286 -3.0539939180016518e-03 -1 -2 287
+            4.3212040327489376e-04</internalNodes>
+          <leafValues>
+            3.4298041462898254e-01 3.8384029269218445e-01
+            5.7755982875823975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 288 -2.7452120557427406e-02 -1 -2 289
+            9.3099439982324839e-04</internalNodes>
+          <leafValues>
+            2.1434690058231354e-01 5.9529662132263184e-01
+            3.7601581215858459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 290 6.7144189961254597e-03 -1 -2 291
+            -3.3701690845191479e-03</internalNodes>
+          <leafValues>
+            5.6926268339157104e-01 5.7843041419982910e-01
+            3.9742821455001831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 292 -1.8903959542512894e-02 -1 -2 293
+            -6.5850871615111828e-03</internalNodes>
+          <leafValues>
+            1.8188929557800293e-01 6.8491101264953613e-01
+            4.3515840172767639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 294 5.8810501359403133e-03 -1 -2 295
+            8.0092082498595119e-04</internalNodes>
+          <leafValues>
+            2.7266609668731689e-01 4.2364311218261719e-01
+            5.8446758985519409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 296 1.8510579830035567e-03 -1 -2 297
+            6.3273650594055653e-03</internalNodes>
+          <leafValues>
+            3.3713209629058838e-01 5.2702218294143677e-01
+            8.0536508560180664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 298 -3.3820930402725935e-03 -1 -2 299
+            -1.9292969955131412e-03</internalNodes>
+          <leafValues>
+            2.8660181164741516e-01 5.8889460563659668e-01
+            3.8957870006561279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 300 1.4995220117270947e-02 -1 -2 301
+            -2.6330750435590744e-02</internalNodes>
+          <leafValues>
+            2.1778169274330139e-01 1.7753170430660248e-01
+            5.6714701652526855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 302 -4.1734222322702408e-03 -1 -2 303
+            2.7268350124359131e-02</internalNodes>
+          <leafValues>
+            4.6529620885848999e-01 4.7683110833168030e-01
+            5.6952387094497681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 304 9.8880263976752758e-04 -1 -2 305
+            -1.0528849670663476e-03</internalNodes>
+          <leafValues>
+            3.3974018692970276e-01 6.2500411272048950e-01
+            4.2884120345115662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 306 5.2288072183728218e-03 -1 -2 307
+            3.0395459383726120e-02</internalNodes>
+          <leafValues>
+            5.3477621078491211e-01 4.1155189275741577e-01
+            5.6607538461685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 308 -7.9113930463790894e-02 -1 -2 309
+            1.8231669440865517e-02</internalNodes>
+          <leafValues>
+            7.8813230991363525e-01 3.6043399572372437e-01
+            5.5695050954818726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 310 5.2288072183728218e-03 -1 -2 311
+            4.3922828626818955e-04</internalNodes>
+          <leafValues>
+            5.4166442155838013e-01 5.5071568489074707e-01
+            3.8822770118713379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 312 -8.6501962505280972e-04 -1 -2 313
+            1.0326979681849480e-03</internalNodes>
+          <leafValues>
+            3.1858509778976440e-01 5.5783641338348389e-01
+            3.2192459702491760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 314 -7.2997747920453548e-03 -1 -2 315
+            -9.3629042385146022e-04</internalNodes>
+          <leafValues>
+            7.0732331275939941e-01 5.5580157041549683e-01
+            4.6138420701026917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 316 -6.0483231209218502e-03 -1 -2 317
+            6.7529221996665001e-03</internalNodes>
+          <leafValues>
+            6.8692898750305176e-01 4.8703178763389587e-01
+            2.6503708958625793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 318 5.3078029304742813e-02 -1 -2 319
+            -1.0225810110569000e-03</internalNodes>
+          <leafValues>
+            5.2815151214599609e-01 6.0858821868896484e-01
+            4.3048679828643799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 320 3.1270649284124374e-02 -1 -2 321
+            -6.3522169366478920e-03</internalNodes>
+          <leafValues>
+            5.4458320140838623e-01 5.3283357620239258e-01
+            2.3643240332603455e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>2.1578119277954102e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 322 -6.2215630896389484e-03 -1 -2 323
+            2.1097389981150627e-03</internalNodes>
+          <leafValues>
+            2.6255810260772705e-01 1.5649929642677307e-01
+            6.7928832769393921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 324 1.0845859535038471e-02 -1 -2 325
+            6.4230401767417789e-04</internalNodes>
+          <leafValues>
+            3.4858089685440063e-01 3.6982551217079163e-01
+            5.9216582775115967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 326 7.3311722371727228e-04 -1 -2 327
+            1.0134200565516949e-03</internalNodes>
+          <leafValues>
+            3.0070841312408447e-01 3.6249229311943054e-01
+            7.0724260807037354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 328 1.1093559674918652e-02 -1 -2 329
+            -7.9127531498670578e-03</internalNodes>
+          <leafValues>
+            4.4167020916938782e-01 3.0287081003189087e-01
+            5.4173761606216431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 330 1.2905309908092022e-02 -1 -2 331
+            -4.2430912144482136e-03</internalNodes>
+          <leafValues>
+            4.3745040893554688e-01 4.4015899300575256e-01
+            7.5651907920837402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 332 -2.1304309484548867e-04 -1 -2 333
+            -2.2308640182018280e-03</internalNodes>
+          <leafValues>
+            2.3107869923114777e-01 3.5681959986686707e-01
+            5.7499992847442627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 334 2.6400520000606775e-03 -1 -2 335
+            7.5101032853126526e-02</internalNodes>
+          <leafValues>
+            3.5936889052391052e-01 6.3635677099227905e-01
+            2.3270289599895477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 336 -7.7012968249619007e-03 -1 -2 337
+            1.5588370151817799e-03</internalNodes>
+          <leafValues>
+            7.0746237039566040e-01 5.7002371549606323e-01
+            3.5904508829116821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 338 -4.7687938786111772e-04 -1 -2 339
+            8.4234727546572685e-04</internalNodes>
+          <leafValues>
+            2.8054410219192505e-01 4.1254189610481262e-01
+            6.1779958009719849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 340 -1.2825109995901585e-02 -1 -2 341
+            -6.5156567143276334e-04</internalNodes>
+          <leafValues>
+            5.4030781984329224e-01 5.6336438655853271e-01
+            3.3565390110015869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 342 -1.2006159871816635e-02 -1 -2 343
+            1.3213419588282704e-03</internalNodes>
+          <leafValues>
+            7.1095108985900879e-01 4.9038508534431458e-01
+            2.8245830535888672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 344 -2.0307440310716629e-02 -1 -2 345
+            4.0180929936468601e-03</internalNodes>
+          <leafValues>
+            1.8913699686527252e-01 5.3779661655426025e-01
+            3.1194949150085449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 346 4.5315311290323734e-03 -1 -2 347
+            -4.4381739571690559e-03</internalNodes>
+          <leafValues>
+            7.2067582607269287e-01 1.8546679615974426e-01
+            4.9817329645156860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 348 1.5692010056227446e-03 -1 -2 349
+            -4.9516442231833935e-03</internalNodes>
+          <leafValues>
+            2.6382741332054138e-01 6.8710672855377197e-01
+            4.7146868705749512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 350 -2.7429679408669472e-02 -1 -2 351
+            1.4181969454512000e-03</internalNodes>
+          <leafValues>
+            1.5482850372791290e-01 4.3768429756164551e-01
+            6.3273680210113525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 352 -1.3078940100967884e-02 -1 -2 353
+            -3.5092779435217381e-03</internalNodes>
+          <leafValues>
+            3.1668141484260559e-01 6.1997437477111816e-01
+            4.3796870112419128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 354 1.8920730799436569e-02 -1 -2 355
+            2.1683350205421448e-03</internalNodes>
+          <leafValues>
+            1.4707140624523163e-01 5.8094590902328491e-01
+            3.4319490194320679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 356 1.6401590546593070e-03 -1 -2 357
+            1.4005920093040913e-04</internalNodes>
+          <leafValues>
+            3.9594578742980957e-01 3.2400250434875488e-01
+            5.6466472148895264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 358 -3.3137591090053320e-03 -1 -2 359
+            -2.9459029901772738e-03</internalNodes>
+          <leafValues>
+            4.2745280265808105e-01 3.3416679501533508e-01
+            6.6279602050781250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 360 1.3612229668069631e-04 -1 -2 361
+            6.0512032359838486e-04</internalNodes>
+          <leafValues>
+            4.0469279885292053e-01 5.4840582609176636e-01
+            3.5699409246444702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 362 -1.7513990402221680e-02 -1 -2 363
+            -1.8735030665993690e-02</internalNodes>
+          <leafValues>
+            1.8241509795188904e-01 7.9718202352523804e-01
+            5.0685691833496094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 364 1.2065649963915348e-02 -1 -2 365
+            -2.6544178836047649e-03</internalNodes>
+          <leafValues>
+            2.1670070290565491e-01 6.5841788053512573e-01
+            4.6282431483268738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 366 1.4501289697363973e-03 -1 -2 367
+            1.0954019613564014e-02</internalNodes>
+          <leafValues>
+            2.0902520418167114e-01 5.1123052835464478e-01
+            7.7845758199691772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 368 1.5771709382534027e-02 -1 -2 369
+            -1.4252689667046070e-02</internalNodes>
+          <leafValues>
+            5.1323592662811279e-01 1.7424149811267853e-01
+            5.2671480178833008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 370 3.0411860279855318e-05 -1 -2 371
+            2.3486299440264702e-02</internalNodes>
+          <leafValues>
+            3.4184479713439941e-01 5.6312650442123413e-01
+            2.0063939690589905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 372 5.2205449901521206e-03 -1 -2 373
+            -2.5812430307269096e-02</internalNodes>
+          <leafValues>
+            6.2496489286422729e-01 3.2032281160354614e-01
+            5.1993298530578613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 374 -1.9526650430634618e-03 -1 -2 375
+            -8.1470049917697906e-03</internalNodes>
+          <leafValues>
+            6.1407059431076050e-01 6.5928959846496582e-01
+            3.7111249566078186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 376 3.2962448894977570e-03 -1 -2 377
+            -1.3961310032755136e-03</internalNodes>
+          <leafValues>
+            2.9521119594573975e-01 3.3208039402961731e-01
+            5.5284148454666138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 378 -4.1055441834032536e-03 -1 -2 379
+            -1.0888779535889626e-02</internalNodes>
+          <leafValues>
+            1.7105500400066376e-01 3.3594349026679993e-01
+            5.6749051809310913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 380 -7.6768421567976475e-03 -1 -2 381
+            -9.7729787230491638e-03</internalNodes>
+          <leafValues>
+            4.7732418775558472e-01 8.0810451507568359e-01
+            4.8458281159400940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 382 6.0439710505306721e-03 -1 -2 383
+            -4.6134641161188483e-04</internalNodes>
+          <leafValues>
+            6.7840021848678589e-01 5.5146390199661255e-01
+            3.6423599720001221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 384 5.7992361485958099e-02 -1 -2 385
+            5.9384980704635382e-04</internalNodes>
+          <leafValues>
+            1.2544350326061249e-01 4.4248789548873901e-01
+            5.7284617424011230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 386 -6.2353480607271194e-03 -1 -2 387
+            -1.2784929946064949e-02</internalNodes>
+          <leafValues>
+            2.8050419688224792e-01 1.9509120285511017e-01
+            5.6529247760772705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 388 4.1973669431172311e-04 -1 -2 389
+            8.0646801507100463e-04</internalNodes>
+          <leafValues>
+            6.1664837598800659e-01 4.5265799760818481e-01
+            5.9444868564605713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 390 -1.6339010326191783e-03 -1 -2 391
+            -4.8299999907612801e-03</internalNodes>
+          <leafValues>
+            4.0869420766830444e-01 2.7935269474983215e-01
+            6.4449352025985718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 392 -6.3992068171501160e-03 -1 -2 393
+            1.0819199681282043e-01</internalNodes>
+          <leafValues>
+            5.6716561317443848e-01 5.3118121623992920e-01
+            2.6143568754196167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 394 6.5056560561060905e-04 -1 -2 395
+            2.0611250773072243e-02</internalNodes>
+          <leafValues>
+            2.9967740178108215e-01 4.4899430871009827e-01
+            6.8882799148559570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 396 -2.5129050016403198e-02 -1 -2 397
+            1.7922939732670784e-03</internalNodes>
+          <leafValues>
+            5.1968640089035034e-01 3.4669959545135498e-01
+            5.5335879325866699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 398 1.5626220265403390e-03 -1 -2 399
+            -6.1898730928078294e-04</internalNodes>
+          <leafValues>
+            3.0814400315284729e-01 2.6938709616661072e-01
+            5.5444890260696411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 400 4.8111421056091785e-03 -1 -2 401
+            2.2484229411929846e-03</internalNodes>
+          <leafValues>
+            5.5878478288650513e-01 4.6721130609512329e-01
+            6.0908252000808716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 402 -3.0147239565849304e-02 -1 -2 403
+            2.7548679709434509e-01</internalNodes>
+          <leafValues>
+            9.0275919437408447e-01 4.7198349237442017e-01
+            2.1969200670719147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 404 3.6894630175083876e-03 -1 -2 405
+            7.2957701049745083e-03</internalNodes>
+          <leafValues>
+            6.2730091810226440e-01 4.8392179608345032e-01
+            6.9090622663497925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 406 -5.6211069226264954e-02 -1 -2 407
+            -2.6478560175746679e-03</internalNodes>
+          <leafValues>
+            1.7384879291057587e-01 6.3041448593139648e-01
+            4.4743019342422485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 408 -1.4534000074490905e-03 -1 -2 409
+            2.8540920466184616e-03</internalNodes>
+          <leafValues>
+            5.3025382757186890e-01 5.3383970260620117e-01
+            3.7968829274177551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 410 5.8243022067472339e-04 -1 -2 411
+            9.2509482055902481e-04</internalNodes>
+          <leafValues>
+            3.2698369026184082e-01 4.5548120141029358e-01
+            6.3583481311798096e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>47</maxWeakCount>
+      <stageThreshold>2.2585290908813477e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 412 1.9806440919637680e-02 -1 -2 413
+            7.0395611692219973e-04</internalNodes>
+          <leafValues>
+            2.8097251057624817e-01 3.1198260188102722e-01
+            7.0903062820434570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 414 2.5563780218362808e-03 -1 -2 415
+            1.0824160417541862e-03</internalNodes>
+          <leafValues>
+            2.9819479584693909e-01 3.0205601453781128e-01
+            5.8088111877441406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 416 -9.2893769033253193e-04 -1 -2 417
+            -1.8009729683399200e-02</internalNodes>
+          <leafValues>
+            3.7381029129028320e-01 2.1631260216236115e-01
+            6.6192537546157837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 418 2.3500190582126379e-03 -1 -2 419
+            8.1822491483762860e-04</internalNodes>
+          <leafValues>
+            2.9104039072990417e-01 5.5786228179931641e-01
+            3.3666279911994934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 420 6.2095321482047439e-04 -1 -2 421
+            9.6780969761312008e-04</internalNodes>
+          <leafValues>
+            4.0724259614944458e-01 6.8595957756042480e-01
+            3.1054618954658508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 422 4.8000211245380342e-04 -1 -2 423
+            9.0538640506565571e-05</internalNodes>
+          <leafValues>
+            3.3373329043388367e-01 3.3709588646888733e-01
+            5.4512107372283936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 424 -4.3914798647165298e-02 -1 -2 425
+            -5.6501338258385658e-03</internalNodes>
+          <leafValues>
+            2.6256701350212097e-01 6.0504627227783203e-01
+            3.2324150204658508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 426 3.8661491125822067e-03 -1 -2 427
+            -6.3069426687434316e-05</internalNodes>
+          <leafValues>
+            3.2626131176948547e-01 5.8173078298568726e-01
+            4.1643899679183960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 428 5.2533738315105438e-02 -1 -2 429
+            1.3818660518154502e-03</internalNodes>
+          <leafValues>
+            7.0953989028930664e-01 5.2928757667541504e-01
+            2.5413888692855835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 430 -8.9264067355543375e-04 -1 -2 431
+            8.5579507052898407e-02</internalNodes>
+          <leafValues>
+            4.0853410959243774e-01 5.2632361650466919e-01
+            3.0032029747962952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 432 -1.8343339615967125e-04 -1 -2 433
+            -9.7924815490841866e-03</internalNodes>
+          <leafValues>
+            4.0292051434516907e-01 3.5213199257850647e-01
+            6.6640049219131470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 434 1.4428620226681232e-02 -1 -2 435
+            -4.5687001198530197e-02</internalNodes>
+          <leafValues>
+            4.5935660600662231e-01 1.4747560024261475e-01
+            5.1786321401596069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 436 -2.5763090234249830e-03 -1 -2 437
+            -3.8301859050989151e-02</internalNodes>
+          <leafValues>
+            1.8372780084609985e-01 8.0826580524444580e-01
+            5.1666879653930664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 438 2.8978290501981974e-03 -1 -2 439
+            -2.5165060069411993e-03</internalNodes>
+          <leafValues>
+            4.7980138659477234e-01 3.3462959527969360e-01
+            5.4444491863250732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 440 5.6281982688233256e-04 -1 -2 441
+            3.6684391088783741e-03</internalNodes>
+          <leafValues>
+            3.5890269279479980e-01 5.9831297397613525e-01
+            2.9839640855789185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 442 2.1319789811968803e-03 -1 -2 443
+            7.6037310063838959e-03</internalNodes>
+          <leafValues>
+            6.1632239818572998e-01 5.2171301841735840e-01
+            2.0541590452194214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 444 -1.1668079969240353e-04 -1 -2 445
+            3.1659509986639023e-03</internalNodes>
+          <leafValues>
+            3.4466689825057983e-01 5.5974847078323364e-01
+            2.6737868785858154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 446 -2.2569499909877777e-02 -1 -2 447
+            2.7129601221531630e-04</internalNodes>
+          <leafValues>
+            6.9002681970596313e-01 4.4866389036178589e-01
+            5.5087852478027344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 448 -1.5434459783136845e-02 -1 -2 449
+            -8.4861656650900841e-03</internalNodes>
+          <leafValues>
+            2.0483230054378510e-01 1.2549529969692230e-01
+            5.0603562593460083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 450 -1.1807470023632050e-01 -1 -2 451
+            -1.2300079688429832e-03</internalNodes>
+          <leafValues>
+            6.7633062601089478e-02 5.6607007980346680e-01
+            4.2922011017799377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 452 -7.0290351286530495e-03 -1 -2 453
+            8.9325206354260445e-03</internalNodes>
+          <leafValues>
+            7.1364039182662964e-01 4.3388760089874268e-01
+            7.0608752965927124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 454 -4.7735981643199921e-02 -1 -2 455
+            -4.4155579060316086e-02</internalNodes>
+          <leafValues>
+            5.2686852216720581e-01 2.5805801153182983e-01
+            5.4069608449935913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 456 -2.5983480736613274e-02 -1 -2 457
+            -4.7885831445455551e-03</internalNodes>
+          <leafValues>
+            1.9050540030002594e-01 2.5518929958343506e-01
+            5.3390771150588989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 458 6.7423451691865921e-03 -1 -2 459
+            1.1654750443994999e-02</internalNodes>
+          <leafValues>
+            4.6933099627494812e-01 5.2619642019271851e-01
+            3.1454348564147949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 460 -5.6982729583978653e-03 -1 -2 461
+            -7.2983349673449993e-03</internalNodes>
+          <leafValues>
+            1.7568530142307281e-01 7.7747297286987305e-01
+            5.1242929697036743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 462 7.9091778025031090e-03 -1 -2 463
+            -1.5874979726504534e-04</internalNodes>
+          <leafValues>
+            5.2845597267150879e-01 3.8878020644187927e-01
+            5.5011737346649170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 464 -6.2235877849161625e-03 -1 -2 465
+            1.3308860361576080e-03</internalNodes>
+          <leafValues>
+            2.4898290634155273e-01 4.2621460556983948e-01
+            5.9350621700286865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 466 5.2055278792977333e-03 -1 -2 467
+            1.4065169729292393e-02</internalNodes>
+          <leafValues>
+            2.5452229380607605e-01 4.8519900441169739e-01
+            7.0214188098907471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 468 -6.7384149879217148e-03 -1 -2 469
+            3.3406780567020178e-03</internalNodes>
+          <leafValues>
+            7.1432709693908691e-01 5.1757252216339111e-01
+            2.8086438775062561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 470 -1.1880699545145035e-02 -1 -2 471
+            1.4226379571482539e-03</internalNodes>
+          <leafValues>
+            5.1732218265533447e-01 4.5028659701347351e-01
+            5.7956951856613159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 472 2.9858129564672709e-03 -1 -2 473
+            -2.0481580868363380e-03</internalNodes>
+          <leafValues>
+            1.9151160120964050e-01 6.5024322271347046e-01
+            4.5593151450157166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 474 1.7122729914262891e-03 -1 -2 475
+            -1.6980869695544243e-02</internalNodes>
+          <leafValues>
+            5.3762471675872803e-01 7.0562332868576050e-01
+            4.9146059155464172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 476 -1.1290470138192177e-03 -1 -2 477
+            2.8620059601962566e-03</internalNodes>
+          <leafValues>
+            2.6787060499191284e-01 4.4108539819717407e-01
+            6.3683199882507324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 478 -3.8065758999437094e-03 -1 -2 479
+            5.9090270660817623e-03</internalNodes>
+          <leafValues>
+            2.7635639905929565e-01 4.8673018813133240e-01
+            6.7287760972976685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 480 1.1004370171576738e-03 -1 -2 481
+            -2.3396299220621586e-03</internalNodes>
+          <leafValues>
+            4.0705141425132751e-01 2.6049488782882690e-01
+            6.1548602581024170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 482 -3.6068160552531481e-03 -1 -2 483
+            4.0831189602613449e-02</internalNodes>
+          <leafValues>
+            5.7319998741149902e-01 4.9733769893646240e-01
+            7.3870068788528442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 484 -7.1082250215113163e-03 -1 -2 485
+            -9.3759730225428939e-04</internalNodes>
+          <leafValues>
+            6.9847512245178223e-01 2.6911678910255432e-01
+            4.7417798638343811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 486 -1.6740820137783885e-03 -1 -2 487
+            8.8287703692913055e-02</internalNodes>
+          <leafValues>
+            3.5510140657424927e-01 5.2446138858795166e-01
+            2.0966500043869019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 488 8.2009629113599658e-04 -1 -2 489
+            -7.6624617213383317e-04</internalNodes>
+          <leafValues>
+            4.1310968995094299e-01 4.6202930808067322e-01
+            6.7754101753234863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 490 6.5769668435677886e-04 -1 -2 491
+            -2.1304790861904621e-03</internalNodes>
+          <leafValues>
+            5.6282752752304077e-01 5.5768597126007080e-01
+            4.5776501297950745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 492 -3.7317050737328827e-04 -1 -2 493
+            -1.1172230355441570e-02</internalNodes>
+          <leafValues>
+            4.9592560529708862e-01 5.6256359815597534e-01
+            2.0471079647541046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 494 4.3435219675302505e-02 -1 -2 495
+            9.6736161503940821e-04</internalNodes>
+          <leafValues>
+            2.2421480715274811e-01 4.5333439111709595e-01
+            6.1999320983886719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 496 -3.1452889088541269e-03 -1 -2 497
+            1.5233129961416125e-03</internalNodes>
+          <leafValues>
+            6.6627562046051025e-01 5.0079882144927979e-01
+            2.3849929869174957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 498 2.0854279864579439e-03 -1 -2 499
+            3.6098200827836990e-02</internalNodes>
+          <leafValues>
+            3.7535008788108826e-01 5.1771712303161621e-01
+            1.6344930231571198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 500 1.6179570229724050e-03 -1 -2 501
+            -6.2132300809025764e-04</internalNodes>
+          <leafValues>
+            2.5873818993568420e-01 6.2995338439941406e-01
+            4.6587899327278137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 502 7.1878539165481925e-04 -1 -2 503
+            -3.9339520037174225e-02</internalNodes>
+          <leafValues>
+            3.3540761470794678e-01 2.1541289985179901e-01
+            5.2357137203216553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 504 -1.0988829890266061e-03 -1 -2 505
+            2.1191420964896679e-03</internalNodes>
+          <leafValues>
+            6.4688968658447266e-01 2.8930890560150146e-01
+            5.2548158168792725e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>2.5609300613403320e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 506 5.2359891124069691e-03 -1 -2 507
+            -2.2169889416545630e-03</internalNodes>
+          <leafValues>
+            3.2997110486030579e-01 7.0415931940078735e-01
+            3.2354658842086792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 508 -8.2303592935204506e-03 -1 -2 509
+            -8.2303592935204506e-03</internalNodes>
+          <leafValues>
+            4.9611708521842957e-01 7.1280431747436523e-01
+            4.9611708521842957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 510 4.5343261444941163e-04 -1 -2 511
+            -4.1777061414904892e-04</internalNodes>
+          <leafValues>
+            3.2084721326828003e-01 6.6139167547225952e-01
+            3.5513329505920410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 512 2.7823769487440586e-03 -1 -2 513
+            -6.0361868236213923e-05</internalNodes>
+          <leafValues>
+            3.7101349234580994e-01 5.7463937997817993e-01
+            3.8948801159858704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 514 3.5061789676547050e-03 -1 -2 515
+            1.7013119941111654e-04</internalNodes>
+          <leafValues>
+            3.0541029572486877e-01 2.8855779767036438e-01
+            6.4877450466156006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 516 -2.3378930054605007e-03 -1 -2 517
+            -2.1369170863181353e-03</internalNodes>
+          <leafValues>
+            3.1744310259819031e-01 3.8209199905395508e-01
+            5.2328932285308838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 518 1.0250400518998504e-03 -1 -2 519
+            -4.4726220949087292e-05</internalNodes>
+          <leafValues>
+            3.6227950453758240e-01 6.5389591455459595e-01
+            4.0036809444427490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 520 5.7102291611954570e-04 -1 -2 521
+            5.7743012439459562e-04</internalNodes>
+          <leafValues>
+            3.8931730389595032e-01 5.6145328283309937e-01
+            3.6876440048217773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 522 7.9692091094329953e-04 -1 -2 523
+            3.5945948911830783e-04</internalNodes>
+          <leafValues>
+            6.4430278539657593e-01 3.3808529376983643e-01
+            5.8246481418609619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 524 4.3973900028504431e-04 -1 -2 525
+            -8.9061429025605321e-04</internalNodes>
+          <leafValues>
+            3.9387670159339905e-01 3.4279710054397583e-01
+            5.5156987905502319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 526 5.4110242053866386e-03 -1 -2 527
+            -8.5764907998964190e-04</internalNodes>
+          <leafValues>
+            3.8035380840301514e-01 6.4395052194595337e-01
+            4.1683459281921387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 528 -2.2000649943947792e-02 -1 -2 529
+            -7.8731682151556015e-03</internalNodes>
+          <leafValues>
+            6.6546010971069336e-01 4.1827228665351868e-01
+            5.6047242879867554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 530 -2.7444459497928619e-02 -1 -2 531
+            1.9792269449681044e-03</internalNodes>
+          <leafValues>
+            6.5868628025054932e-01 3.2449120283126831e-01
+            4.8828700184822083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 532 -5.6783691979944706e-03 -1 -2 533
+            1.5057219570735469e-05</internalNodes>
+          <leafValues>
+            2.2290790081024170e-01 4.1072851419448853e-01
+            5.7475912570953369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 534 -5.4136710241436958e-03 -1 -2 535
+            5.3679239936172962e-03</internalNodes>
+          <leafValues>
+            2.0657970011234283e-01 4.9264231324195862e-01
+            7.1394848823547363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 536 -3.1426660716533661e-03 -1 -2 537
+            1.0907390154898167e-02</internalNodes>
+          <leafValues>
+            6.7800867557525635e-01 5.2149301767349243e-01
+            1.1439959704875946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 538 5.8436761610209942e-03 -1 -2 539
+            9.0507230197545141e-05</internalNodes>
+          <leafValues>
+            1.9375260174274445e-01 3.8125771284103394e-01
+            5.5141878128051758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 540 -1.6345789656043053e-02 -1 -2 541
+            1.5987500082701445e-03</internalNodes>
+          <leafValues>
+            2.4740239977836609e-01 4.8177829384803772e-01
+            5.9230798482894897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 542 -4.0257978253066540e-03 -1 -2 543
+            -6.7750471644103527e-03</internalNodes>
+          <leafValues>
+            7.5082087516784668e-01 2.8798109292984009e-01
+            5.1996952295303345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 544 -3.2470689620822668e-03 -1 -2 545
+            1.5409620245918632e-03</internalNodes>
+          <leafValues>
+            3.0449101328849792e-01 4.0634828805923462e-01
+            5.6765627861022949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 546 -1.2858119793236256e-02 -1 -2 547
+            -1.4824670506641269e-04</internalNodes>
+          <leafValues>
+            9.6717558801174164e-02 4.5378330349922180e-01
+            6.1153751611709595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 548 -9.0210810303688049e-03 -1 -2 549
+            -2.8795029968023300e-02</internalNodes>
+          <leafValues>
+            4.8077508807182312e-01 3.4037950634956360e-01
+            5.2555292844772339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 550 9.0210810303688049e-03 -1 -2 551
+            7.4121179059147835e-03</internalNodes>
+          <leafValues>
+            7.5058358907699585e-01 5.4554468393325806e-01
+            3.2260689139366150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 552 -3.7217529024928808e-03 -1 -2 553
+            1.9865889847278595e-01</internalNodes>
+          <leafValues>
+            2.3118489980697632e-01 5.2710479497909546e-01
+            1.4699299633502960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 554 1.5208719560177997e-05 -1 -2 555
+            -3.9089918136596680e-03</internalNodes>
+          <leafValues>
+            3.6781388521194458e-01 7.1319299936294556e-01
+            4.9938669800758362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 556 2.5106288958340883e-03 -1 -2 557
+            2.3921660613268614e-04</internalNodes>
+          <leafValues>
+            5.3120541572570801e-01 4.6893781423568726e-01
+            5.7140219211578369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 558 6.9443131797015667e-03 -1 -2 559
+            1.2065629707649350e-03</internalNodes>
+          <leafValues>
+            6.9487977027893066e-01 4.0045049786567688e-01
+            5.8748817443847656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 560 2.5106288958340883e-03 -1 -2 561
+            1.7514040227979422e-03</internalNodes>
+          <leafValues>
+            5.3295719623565674e-01 5.5458492040634155e-01
+            3.4495818614959717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 562 -4.1978210210800171e-03 -1 -2 563
+            1.3092850567772985e-03</internalNodes>
+          <leafValues>
+            1.2171830236911774e-01 5.3750497102737427e-01
+            3.4156250953674316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 564 6.7396182566881180e-04 -1 -2 565
+            -1.0530710220336914e-02</internalNodes>
+          <leafValues>
+            4.1951790452003479e-01 3.4607538580894470e-01
+            5.1558601856231689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 566 -4.0672299265861511e-01 -1 -2 567
+            -2.6314549148082733e-02</internalNodes>
+          <leafValues>
+            5.8065678924322128e-02 1.4734490215778351e-01
+            5.5593782663345337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 568 2.2557149641215801e-03 -1 -2 569
+            1.2154860422015190e-02</internalNodes>
+          <leafValues>
+            5.4777151346206665e-01 4.2077910900115967e-01
+            5.6218808889389038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 570 -1.8436539918184280e-02 -1 -2 571
+            5.3676147945225239e-04</internalNodes>
+          <leafValues>
+            6.4471471309661865e-01 2.7651271224021912e-01
+            4.8885959386825562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 572 -2.6265541091561317e-03 -1 -2 573
+            -5.1119807176291943e-04</internalNodes>
+          <leafValues>
+            5.2646911144256592e-01 5.7853102684020996e-01
+            4.2911028861999512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 574 4.1454841266386211e-04 -1 -2 575
+            -5.5028748465701938e-04</internalNodes>
+          <leafValues>
+            3.4554108977317810e-01 6.0269188880920410e-01
+            4.1438931226730347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 576 -1.0347720235586166e-03 -1 -2 577
+            -3.3966631162911654e-03</internalNodes>
+          <leafValues>
+            6.0952937602996826e-01 6.1082822084426880e-01
+            4.7077208757400513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 578 3.1795909162610769e-03 -1 -2 579
+            -1.6528950072824955e-04</internalNodes>
+          <leafValues>
+            3.2443669438362122e-01 3.8307571411132812e-01
+            5.7343262434005737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 580 8.3725210279226303e-03 -1 -2 581
+            -2.5799809955060482e-03</internalNodes>
+          <leafValues>
+            6.6109192371368408e-01 6.1393070220947266e-01
+            4.6861499547958374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 582 9.0194388758391142e-04 -1 -2 583
+            3.6952210939489305e-04</internalNodes>
+          <leafValues>
+            3.5200220346450806e-01 2.5787541270256042e-01
+            5.4672420024871826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 584 9.9746137857437134e-04 -1 -2 585
+            -3.6688039544969797e-03</internalNodes>
+          <leafValues>
+            4.8201468586921692e-01 5.7101500034332275e-01
+            4.8319110274314880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 586 -8.9501030743122101e-04 -1 -2 587
+            5.1904921419918537e-03</internalNodes>
+          <leafValues>
+            6.1336791515350342e-01 4.9285829067230225e-01
+            2.5813090801239014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 588 4.2274440056644380e-04 -1 -2 589
+            8.5176713764667511e-03</internalNodes>
+          <leafValues>
+            4.4711241126060486e-01 5.1610249280929565e-01
+            3.3165338635444641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 590 -3.6623608320951462e-02 -1 -2 591
+            -4.1103712283074856e-03</internalNodes>
+          <leafValues>
+            9.2606216669082642e-02 8.5221147537231445e-01
+            5.1379078626632690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 592 -6.6017331555485725e-03 -1 -2 593
+            2.5578640401363373e-02</internalNodes>
+          <leafValues>
+            5.4590600728988647e-01 5.2193528413772583e-01
+            1.9271859526634216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 594 1.1447439901530743e-02 -1 -2 595
+            7.2427501436322927e-04</internalNodes>
+          <leafValues>
+            1.9160020351409912e-01 5.2315711975097656e-01
+            3.5353401303291321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 596 9.7127500921487808e-03 -1 -2 597
+            -1.1337569914758205e-02</internalNodes>
+          <leafValues>
+            6.4641010761260986e-01 7.3830378055572510e-01
+            4.9647438526153564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 598 -8.1453882157802582e-03 -1 -2 599
+            -8.5570756345987320e-03</internalNodes>
+          <leafValues>
+            3.6117058992385864e-01 3.4219071269035339e-01
+            5.9435117244720459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 600 2.2993308957666159e-03 -1 -2 601
+            3.8430930580943823e-03</internalNodes>
+          <leafValues>
+            4.5501041412353516e-01 4.7168621420860291e-01
+            6.6561907529830933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 602 -9.9116540513932705e-04 -1 -2 603
+            2.5496469810605049e-02</internalNodes>
+          <leafValues>
+            4.5927169919013977e-01 6.5634012222290039e-01
+            1.2588350474834442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 604 -1.5748359262943268e-02 -1 -2 605
+            -1.8046120181679726e-02</internalNodes>
+          <leafValues>
+            5.2395021915435791e-01 8.0158519744873047e-01
+            5.0079578161239624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 606 1.0323390364646912e-02 -1 -2 607
+            1.6452240524813533e-03</internalNodes>
+          <leafValues>
+            2.2748200595378876e-01 4.3519461154937744e-01
+            5.8676278591156006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 608 1.5881149098277092e-02 -1 -2 609
+            1.0586519725620747e-02</internalNodes>
+          <leafValues>
+            4.4650518894195557e-01 4.5444580912590027e-01
+            5.7071107625961304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 610 -2.1531689912080765e-02 -1 -2 611
+            5.2480469457805157e-03</internalNodes>
+          <leafValues>
+            6.5276437997817993e-01 3.4447279572486877e-01
+            5.3246361017227173e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>67</maxWeakCount>
+      <stageThreshold>3.2647129058837891e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 612 1.8219340126961470e-03 -1 -2 613
+            8.1313941627740860e-03</internalNodes>
+          <leafValues>
+            3.1087881326675415e-01 3.1332370638847351e-01
+            6.6458672285079956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 614 1.7055979697033763e-03 -1 -2 615
+            -7.4483548814896494e-05</internalNodes>
+          <leafValues>
+            2.6401311159133911e-01 5.6472051143646240e-01
+            3.4853729605674744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 616 3.8342390325851738e-04 -1 -2 617
+            3.1868910882622004e-03</internalNodes>
+          <leafValues>
+            3.1406548619270325e-01 6.4891988039016724e-01
+            3.8877290487289429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 618 1.6044320166110992e-01 -1 -2 619
+            -6.7285560071468353e-03</internalNodes>
+          <leafValues>
+            7.2165298461914062e-01 1.6531379520893097e-01
+            5.1398259401321411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 620 7.2638481469766703e-06 -1 -2 621
+            5.5551197146996856e-04</internalNodes>
+          <leafValues>
+            3.1406199932098389e-01 5.9936988353729248e-01
+            3.3173981308937073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 622 -1.0822320356965065e-02 -1 -2 623
+            -4.5834020711481571e-03</internalNodes>
+          <leafValues>
+            2.6529380679130554e-01 1.8495689332485199e-01
+            5.3139579296112061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 624 -3.0205070506781340e-03 -1 -2 625
+            7.7864617109298706e-02</internalNodes>
+          <leafValues>
+            4.0400999784469604e-01 6.1581897735595703e-01
+            1.7864869534969330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 626 2.6494380086660385e-02 -1 -2 627
+            3.6912109702825546e-02</internalNodes>
+          <leafValues>
+            4.5110899209976196e-01 4.5282199978828430e-01
+            5.9722828865051270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 628 5.7857790961861610e-03 -1 -2 629
+            9.3849771656095982e-04</internalNodes>
+          <leafValues>
+            2.5338920950889587e-01 3.4104120731353760e-01
+            5.9236437082290649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 630 -1.1003199964761734e-02 -1 -2 631
+            -1.1737640015780926e-03</internalNodes>
+          <leafValues>
+            6.9580441713333130e-01 3.8510841131210327e-01
+            5.4081892967224121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 632 -3.6596669815480709e-03 -1 -2 633
+            -2.4822750128805637e-03</internalNodes>
+          <leafValues>
+            2.0093089342117310e-01 6.2953931093215942e-01
+            4.3950408697128296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 634 -4.4606071896851063e-03 -1 -2 635
+            -3.5969649907201529e-03</internalNodes>
+          <leafValues>
+            2.4052999913692474e-01 5.4501742124557495e-01
+            3.7823578715324402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 636 -3.6222559865564108e-03 -1 -2 637
+            1.2059339787811041e-03</internalNodes>
+          <leafValues>
+            3.0338969826698303e-01 4.6337789297103882e-01
+            6.3359522819519043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 638 4.3124938383698463e-03 -1 -2 639
+            -4.4961250387132168e-03</internalNodes>
+          <leafValues>
+            6.5988260507583618e-01 6.6216969490051270e-01
+            4.7552469372749329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 640 -1.3860689941793680e-03 -1 -2 641
+            -5.1588460337370634e-04</internalNodes>
+          <leafValues>
+            2.8012010455131531e-01 3.8294890522956848e-01
+            5.6236267089843750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 642 7.0330002927221358e-05 -1 -2 643
+            -2.0976549421902746e-04</internalNodes>
+          <leafValues>
+            4.5363429188728333e-01 5.6081390380859375e-01
+            4.2657798528671265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 644 1.3642259873449802e-03 -1 -2 645
+            1.5483660390600562e-03</internalNodes>
+          <leafValues>
+            2.6370918750762939e-01 4.1707509756088257e-01
+            5.9329879283905029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 646 1.9179609417915344e-01 -1 -2 647
+            -4.4776909053325653e-03</internalNodes>
+          <leafValues>
+            5.2567642927169800e-01 6.6326218843460083e-01
+            4.8925888538360596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 648 -1.2649179995059967e-01 -1 -2 649
+            6.5253327193204314e-05</internalNodes>
+          <leafValues>
+            1.4997789263725281e-01 4.2333200573921204e-01
+            5.7560402154922485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 650 4.1856421157717705e-03 -1 -2 651
+            2.7478230185806751e-04</internalNodes>
+          <leafValues>
+            5.2888268232345581e-01 4.5240178704261780e-01
+            5.6041252613067627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 652 -2.2906810045242310e-03 -1 -2 653
+            1.6744500026106834e-03</internalNodes>
+          <leafValues>
+            5.5782741308212280e-01 3.3230578899383545e-01
+            5.5587881803512573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 654 1.2349759927019477e-03 -1 -2 655
+            -8.7158754467964172e-03</internalNodes>
+          <leafValues>
+            3.6539471149444580e-01 1.9245339930057526e-01
+            5.3136497735977173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 656 4.6613621525466442e-03 -1 -2 657
+            -8.5815992206335068e-03</internalNodes>
+          <leafValues>
+            2.0277309417724609e-01 7.6360601186752319e-01
+            5.1408261060714722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 658 1.4352120459079742e-02 -1 -2 659
+            -7.7948719263076782e-03</internalNodes>
+          <leafValues>
+            5.2529758214950562e-01 2.6329371333122253e-01
+            5.3286892175674438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 660 -3.4155680332332850e-03 -1 -2 661
+            -4.2639090679585934e-03</internalNodes>
+          <leafValues>
+            2.4160879850387573e-01 3.9365449547767639e-01
+            5.4787421226501465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 662 8.7177697569131851e-03 -1 -2 663
+            -3.2232629600912333e-03</internalNodes>
+          <leafValues>
+            4.7881990671157837e-01 3.6316120624542236e-01
+            5.2883160114288330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 664 -4.2188368737697601e-02 -1 -2 665
+            1.9875749945640564e-02</internalNodes>
+          <leafValues>
+            6.9311392307281494e-01 4.5201000571250916e-01
+            6.8550550937652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 666 -3.1134510412812233e-02 -1 -2 667
+            5.7032387703657150e-03</internalNodes>
+          <leafValues>
+            5.3004240989685059e-01 5.6068921089172363e-01
+            4.2306229472160339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 668 5.2733682096004486e-03 -1 -2 669
+            -3.1231069006025791e-03</internalNodes>
+          <leafValues>
+            3.2472288608551025e-01 1.9856959581375122e-01
+            5.3498727083206177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 670 4.6453849063254893e-04 -1 -2 671
+            3.0355889350175858e-02</internalNodes>
+          <leafValues>
+            4.2075088620185852e-01 5.1534587144851685e-01
+            3.1181010603904724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 672 -4.2992769740521908e-03 -1 -2 673
+            1.9509199773892760e-04</internalNodes>
+          <leafValues>
+            3.2745069265365601e-01 5.9530782699584961e-01
+            4.2255210876464844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 674 -7.7784480527043343e-03 -1 -2 675
+            1.6917599365115166e-02</internalNodes>
+          <leafValues>
+            7.2111797332763672e-01 4.9365919828414917e-01
+            7.0302772521972656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 676 -5.1948569715023041e-02 -1 -2 677
+            -5.4751220159232616e-03</internalNodes>
+          <leafValues>
+            1.4255349338054657e-01 6.0593318939208984e-01
+            4.3939951062202454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 678 1.5210839592327829e-05 -1 -2 679
+            1.0235579684376717e-03</internalNodes>
+          <leafValues>
+            4.4888499379158020e-01 4.2565500736236572e-01
+            5.7954382896423340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 680 -1.0427719826111570e-04 -1 -2 681
+            8.7853781878948212e-03</internalNodes>
+          <leafValues>
+            4.2460399866104126e-01 4.9580091238021851e-01
+            6.7594307661056519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 682 3.4012699034065008e-03 -1 -2 683
+            5.8582378551363945e-04</internalNodes>
+          <leafValues>
+            5.4234808683395386e-01 3.6365428566932678e-01
+            5.4643487930297852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 684 -2.2973360028117895e-03 -1 -2 685
+            -1.4330189675092697e-02</internalNodes>
+          <leafValues>
+            2.5488188862800598e-01 6.5876567363739014e-01
+            4.5328021049499512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 686 9.8565965890884399e-04 -1 -2 687
+            -4.6640761196613312e-02</internalNodes>
+          <leafValues>
+            3.8227710127830505e-01 3.0773219466209412e-01
+            5.2441328763961792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 688 -1.1907300353050232e-01 -1 -2 689
+            1.9333280622959137e-02</internalNodes>
+          <leafValues>
+            1.0338629782199860e-01 5.5547451972961426e-01
+            3.2213169336318970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 690 3.1427849084138870e-02 -1 -2 691
+            2.0082130504306406e-04</internalNodes>
+          <leafValues>
+            4.6823790669441223e-01 5.3730702400207520e-01
+            3.8006669282913208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 692 -6.2584900297224522e-03 -1 -2 693
+            8.2861045375466347e-03</internalNodes>
+          <leafValues>
+            1.7992070317268372e-01 5.0950688123703003e-01
+            7.5446051359176636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 694 2.0529709290713072e-03 -1 -2 695
+            3.2524869311600924e-03</internalNodes>
+          <leafValues>
+            5.6286448240280151e-01 4.8016890883445740e-01
+            5.8021020889282227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 696 -3.1884901225566864e-02 -1 -2 697
+            1.8379340181127191e-03</internalNodes>
+          <leafValues>
+            1.7427450418472290e-01 3.4665969014167786e-01
+            5.1071548461914062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 698 -4.8512680223211646e-04 -1 -2 699
+            -2.5407879147678614e-03</internalNodes>
+          <leafValues>
+            5.3260862827301025e-01 6.3427752256393433e-01
+            4.9926930665969849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 700 -5.1559060811996460e-03 -1 -2 701
+            -4.4968750327825546e-02</internalNodes>
+          <leafValues>
+            3.4334290027618408e-01 1.8681369721889496e-01
+            5.2154648303985596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 702 5.8984281495213509e-03 -1 -2 703
+            3.2763120252639055e-03</internalNodes>
+          <leafValues>
+            6.2293052673339844e-01 4.9357721209526062e-01
+            7.2179448604583740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 704 -1.0161520185647532e-04 -1 -2 705
+            -1.6290300118271261e-04</internalNodes>
+          <leafValues>
+            5.0079762935638428e-01 6.0241490602493286e-01
+            2.3295080661773682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 706 9.0541364625096321e-03 -1 -2 707
+            3.5398490726947784e-02</internalNodes>
+          <leafValues>
+            4.5104169845581055e-01 5.1419967412948608e-01
+            2.8602918982505798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 708 5.6469351984560490e-03 -1 -2 709
+            -2.4807190056890249e-03</internalNodes>
+          <leafValues>
+            4.7049251198768616e-01 4.1798511147499084e-01
+            6.7266470193862915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 710 -4.1088787838816643e-03 -1 -2 711
+            -2.0714469719678164e-03</internalNodes>
+          <leafValues>
+            5.8098018169403076e-01 6.0747838020324707e-01
+            4.5240598917007446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 712 -2.8939060866832733e-03 -1 -2 713
+            1.3467279495671391e-03</internalNodes>
+          <leafValues>
+            3.3835199475288391e-01 5.6969100236892700e-01
+            3.9708450436592102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 714 -9.0779133141040802e-02 -1 -2 715
+            -8.3171762526035309e-02</internalNodes>
+          <leafValues>
+            1.5027019381523132e-01 7.5736707448959351e-01
+            4.9364370107650757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 716 -1.4107000315561891e-03 -1 -2 717
+            5.5668760091066360e-02</internalNodes>
+          <leafValues>
+            3.3909329771995544e-01 5.0250971317291260e-01
+            7.4220830202102661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 718 5.7701539248228073e-02 -1 -2 719
+            -4.2503291368484497e-01</internalNodes>
+          <leafValues>
+            5.1973718404769897e-01 9.7346916794776917e-02
+            5.1857399940490723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 720 -4.4380719191394746e-04 -1 -2 721
+            1.7924769781529903e-04</internalNodes>
+          <leafValues>
+            3.6493501067161560e-01 5.6192791461944580e-01
+            3.7602970004081726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 722 5.0382469780743122e-03 -1 -2 723
+            1.5191170386970043e-02</internalNodes>
+          <leafValues>
+            6.3284450769424438e-01 4.9360820651054382e-01
+            7.4265247583389282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 724 -1.2300389818847179e-02 -1 -2 725
+            1.5168030513450503e-03</internalNodes>
+          <leafValues>
+            1.3893499970436096e-01 5.0919622182846069e-01
+            3.4826481342315674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 726 9.5754547510296106e-04 -1 -2 727
+            -1.8962200731039047e-02</internalNodes>
+          <leafValues>
+            6.0363167524337769e-01 2.3191730678081512e-01
+            5.1166528463363647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 728 -2.2272260859608650e-02 -1 -2 729
+            -2.5145230814814568e-02</internalNodes>
+          <leafValues>
+            6.5550220012664795e-01 1.3260710239410400e-01
+            4.6740341186523438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 730 1.9533900544047356e-02 -1 -2 731
+            -1.1231349781155586e-03</internalNodes>
+          <leafValues>
+            5.1820272207260132e-01 6.3182431459426880e-01
+            4.8255190253257751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 732 -1.4861139934509993e-03 -1 -2 733
+            3.5002888762392104e-04</internalNodes>
+          <leafValues>
+            2.9186710715293884e-01 5.6213712692260742e-01
+            4.2492130398750305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 734 -1.1231349781155586e-03 -1 -2 735
+            1.0409739799797535e-02</internalNodes>
+          <leafValues>
+            4.8137450218200684e-01 5.1840060949325562e-01
+            2.0512230694293976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 736 -8.7832562625408173e-02 -1 -2 737
+            1.6584879485890269e-03</internalNodes>
+          <leafValues>
+            1.1799219995737076e-01 4.9878111481666565e-01
+            6.9737559556961060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 738 -2.3008750285953283e-03 -1 -2 739
+            3.3026169985532761e-02</internalNodes>
+          <leafValues>
+            5.3398311138153076e-01 5.0332891941070557e-01
+            6.8519067764282227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 740 -1.3585069682449102e-03 -1 -2 741
+            7.8067491995170712e-04</internalNodes>
+          <leafValues>
+            3.0028221011161804e-01 4.5930838584899902e-01
+            6.4400452375411987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 742 -1.8025759607553482e-02 -1 -2 743
+            1.2354910140857100e-03</internalNodes>
+          <leafValues>
+            5.3112912178039551e-01 4.7291061282157898e-01
+            5.7214611768722534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 744 -9.2583027435466647e-04 -1 -2 745
+            8.0123997759073973e-04</internalNodes>
+          <leafValues>
+            3.6623328924179077e-01 5.3619897365570068e-01
+            3.0086329579353333e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>63</maxWeakCount>
+      <stageThreshold>3.0672130584716797e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 746 2.4914839304983616e-03 -1 -2 747
+            -5.0488598644733429e-02</internalNodes>
+          <leafValues>
+            3.4223890304565430e-01 7.7034580707550049e-01
+            4.5163908600807190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 748 -7.7838351717218757e-04 -1 -2 749
+            2.3572890495415777e-04</internalNodes>
+          <leafValues>
+            3.2563421130180359e-01 3.4065559506416321e-01
+            5.8970272541046143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 750 4.5575071126222610e-03 -1 -2 751
+            8.1241987645626068e-03</internalNodes>
+          <leafValues>
+            4.3065789341926575e-01 7.1495872735977173e-01
+            4.3456849455833435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 752 -4.4612158671952784e-04 -1 -2 753
+            -2.8972938889637589e-04</internalNodes>
+          <leafValues>
+            3.2959741353988647e-01 5.8456200361251831e-01
+            3.5266879200935364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 754 7.1604831646254752e-06 -1 -2 755
+            -3.8497708737850189e-04</internalNodes>
+          <leafValues>
+            4.0819549560546875e-01 4.2031130194664001e-01
+            6.6341269016265869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 756 1.9489860278554261e-04 -1 -2 757
+            -1.7083849757909775e-02</internalNodes>
+          <leafValues>
+            3.9424669742584229e-01 2.2940720617771149e-01
+            5.2389609813690186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 758 8.3513697609305382e-04 -1 -2 759
+            7.5499608647078276e-04</internalNodes>
+          <leafValues>
+            3.0260318517684937e-01 6.0321962833404541e-01
+            3.4124588966369629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 760 8.0216713249683380e-03 -1 -2 761
+            -3.8930509239435196e-02</internalNodes>
+          <leafValues>
+            7.3062407970428467e-01 3.5993251204490662e-01
+            5.2343809604644775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 762 -7.0348767621908337e-05 -1 -2 763
+            -8.5350573062896729e-03</internalNodes>
+          <leafValues>
+            3.4937581419944763e-01 2.7461090683937073e-01
+            5.6265860795974731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 764 1.0854450054466724e-02 -1 -2 765
+            4.5329501153901219e-04</internalNodes>
+          <leafValues>
+            5.2822262048721313e-01 4.5220491290092468e-01
+            6.0543018579483032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 766 1.8117150466423482e-04 -1 -2 767
+            4.6641560038551688e-04</internalNodes>
+          <leafValues>
+            3.3068621158599854e-01 1.4550000429153442e-01
+            5.3849279880523682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 768 -8.4854792803525925e-03 -1 -2 769
+            -1.8934309482574463e-02</internalNodes>
+          <leafValues>
+            4.8141559958457947e-01 3.5637411475181580e-01
+            5.4051452875137329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 770 4.9814549274742603e-03 -1 -2 771
+            3.4286780282855034e-03</internalNodes>
+          <leafValues>
+            6.9577431678771973e-01 5.0508928298950195e-01
+            2.3169949650764465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 772 4.4203791185282171e-04 -1 -2 773
+            2.3822550429031253e-04</internalNodes>
+          <leafValues>
+            6.0185819864273071e-01 4.7550821304321289e-01
+            5.5852377414703369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 774 -6.4261639490723610e-03 -1 -2 775
+            9.9637769162654877e-03</internalNodes>
+          <leafValues>
+            2.2824659943580627e-01 4.0405881404876709e-01
+            5.6501698493957520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 776 1.3654050417244434e-02 -1 -2 777
+            -9.9892877042293549e-03</internalNodes>
+          <leafValues>
+            5.2677392959594727e-01 6.7940497398376465e-01
+            4.7970339655876160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 778 3.6558631807565689e-02 -1 -2 779
+            4.8999379941960797e-05</internalNodes>
+          <leafValues>
+            8.8425733149051666e-02 4.0207880735397339e-01
+            5.4573321342468262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 780 1.3654050417244434e-02 -1 -2 781
+            1.8802779959514737e-03</internalNodes>
+          <leafValues>
+            5.2676129341125488e-01 4.8060521483421326e-01
+            6.3943648338317871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 782 -1.3654050417244434e-02 -1 -2 783
+            1.2778700329363346e-03</internalNodes>
+          <leafValues>
+            1.7248100042343140e-01 4.4798240065574646e-01
+            6.3100087642669678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 784 9.8843395244330168e-04 -1 -2 785
+            1.4511500012304168e-05</internalNodes>
+          <leafValues>
+            5.9481692314147949e-01 4.8541748523712158e-01
+            5.3093612194061279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 786 -2.2775429533794522e-04 -1 -2 787
+            -1.4753740280866623e-02</internalNodes>
+          <leafValues>
+            3.1836318969726562e-01 3.0849760770797729e-01
+            5.3520262241363525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 788 -3.4148250706493855e-03 -1 -2 789
+            7.5806681998074055e-03</internalNodes>
+          <leafValues>
+            6.1153268814086914e-01 4.9516460299491882e-01
+            7.0613312721252441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 790 -5.7734688743948936e-03 -1 -2 791
+            7.4033669079653919e-05</internalNodes>
+          <leafValues>
+            3.7542209029197693e-01 4.1155171394348145e-01
+            5.8894449472427368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 792 -8.2278084009885788e-03 -1 -2 793
+            5.3380909375846386e-03</internalNodes>
+          <leafValues>
+            9.5610566437244415e-02 5.3005087375640869e-01
+            3.9618980884552002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 794 -2.7049109339714050e-03 -1 -2 795
+            7.7341338619589806e-03</internalNodes>
+          <leafValues>
+            6.4818692207336426e-01 5.1104402542114258e-01
+            3.1215190887451172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 796 1.0886609554290771e-02 -1 -2 797
+            1.1038660071790218e-02</internalNodes>
+          <leafValues>
+            4.8014289140701294e-01 5.4297101497650146e-01
+            4.1623631119728088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 798 -1.0054199956357479e-02 -1 -2 799
+            7.7072880230844021e-03</internalNodes>
+          <leafValues>
+            7.3293352127075195e-01 5.3568720817565918e-01
+            3.4555470943450928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 800 -5.8278098003938794e-04 -1 -2 801
+            -2.5739220436662436e-03</internalNodes>
+          <leafValues>
+            3.6550220847129822e-01 3.7767601013183594e-01
+            5.3917747735977173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 802 -7.0167761296033859e-03 -1 -2 803
+            -1.7727289814502001e-03</internalNodes>
+          <leafValues>
+            4.0393048524856567e-01 6.9504439830780029e-01
+            4.9811169505119324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 804 -1.6318289563059807e-02 -1 -2 805
+            -1.1663000099360943e-02</internalNodes>
+          <leafValues>
+            5.2967327833175659e-01 5.8426398038864136e-01
+            4.7895029187202454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 806 2.5881489273160696e-03 -1 -2 807
+            -3.7328999023884535e-03</internalNodes>
+          <leafValues>
+            6.0921788215637207e-01 6.7217427492141724e-01
+            4.0668940544128418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 808 -1.4355930034071207e-03 -1 -2 809
+            1.8340899841859937e-03</internalNodes>
+          <leafValues>
+            3.5850879549980164e-01 5.3711581230163574e-01
+            4.0335071086883545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 810 1.2280289828777313e-01 -1 -2 811
+            5.0228700041770935e-02</internalNodes>
+          <leafValues>
+            1.5475720167160034e-01 5.4338437318801880e-01
+            8.4292672574520111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 812 -2.1437000483274460e-02 -1 -2 813
+            -3.1009620055556297e-02</internalNodes>
+          <leafValues>
+            4.8600539565086365e-01 1.8330100178718567e-01
+            5.2075541019439697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 814 -1.2973720207810402e-02 -1 -2 815
+            1.5818020328879356e-03</internalNodes>
+          <leafValues>
+            7.0482409000396729e-01 4.1705870628356934e-01
+            5.8651638031005859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 816 -9.7806248813867569e-03 -1 -2 817
+            1.1735740117728710e-03</internalNodes>
+          <leafValues>
+            5.3079181909561157e-01 5.5224531888961792e-01
+            3.5071650147438049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 818 1.4651629608124495e-03 -1 -2 819
+            2.3532148916274309e-03</internalNodes>
+          <leafValues>
+            3.0426511168479919e-01 5.3393232822418213e-01
+            2.8062361478805542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 820 -6.1809681355953217e-03 -1 -2 821
+            6.5688649192452431e-04</internalNodes>
+          <leafValues>
+            6.4101332426071167e-01 5.6208711862564087e-01
+            4.3903189897537231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 822 2.6228010654449463e-02 -1 -2 823
+            -1.7958110198378563e-02</internalNodes>
+          <leafValues>
+            6.4455568790435791e-01 2.0027139782905579e-01
+            4.6246650815010071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 824 -7.6468721963465214e-03 -1 -2 825
+            -2.7482809964567423e-03</internalNodes>
+          <leafValues>
+            5.2632009983062744e-01 5.8739811182022095e-01
+            4.8366001248359680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 826 1.3851850293576717e-02 -1 -2 827
+            2.6369190309196711e-03</internalNodes>
+          <leafValues>
+            1.5661309659481049e-01 4.2701789736747742e-01
+            5.8066600561141968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 828 -3.1513599678874016e-03 -1 -2 829
+            -1.4788460248382762e-05</internalNodes>
+          <leafValues>
+            6.2158662080764771e-01 5.5766427516937256e-01
+            4.1220021247863770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 830 -7.3676988482475281e-02 -1 -2 831
+            -3.0912780202925205e-03</internalNodes>
+          <leafValues>
+            1.5367099642753601e-01 6.3442689180374146e-01
+            4.5074120163917542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 832 7.9240966588258743e-03 -1 -2 833
+            8.5778040811419487e-03</internalNodes>
+          <leafValues>
+            5.4579752683639526e-01 5.4016572237014771e-01
+            3.8907998800277710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 834 5.5403169244527817e-03 -1 -2 835
+            -1.1886510037584230e-04</internalNodes>
+          <leafValues>
+            3.5556110739707947e-01 5.8367502689361572e-01
+            4.2743161320686340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 836 -1.8408369272947311e-02 -1 -2 837
+            -2.3490579333156347e-03</internalNodes>
+          <leafValues>
+            5.8604401350021362e-01 4.4989579916000366e-01
+            5.4981988668441772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 838 -7.6157399453222752e-03 -1 -2 839
+            -3.3190969843417406e-03</internalNodes>
+          <leafValues>
+            4.1009929776191711e-01 6.7013788223266602e-01
+            4.3530011177062988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 840 -9.4642979092895985e-04 -1 -2 841
+            8.7858550250530243e-03</internalNodes>
+          <leafValues>
+            5.3911769390106201e-01 5.5040502548217773e-01
+            3.9909350872039795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 842 1.6395459533669055e-04 -1 -2 843
+            -2.3508940357714891e-03</internalNodes>
+          <leafValues>
+            3.5929331183433533e-01 4.0341728925704956e-01
+            5.8060771226882935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 844 7.5449963333085179e-05 -1 -2 845
+            2.7018489316105843e-02</internalNodes>
+          <leafValues>
+            5.4123848676681519e-01 4.9449229240417480e-01
+            5.5894362926483154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 846 8.4561208495870233e-04 -1 -2 847
+            -1.1687109945341945e-03</internalNodes>
+          <leafValues>
+            5.8092182874679565e-01 4.7469571232795715e-01
+            2.8458958864212036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 848 2.2897500544786453e-02 -1 -2 849
+            7.0879262685775757e-01</internalNodes>
+          <leafValues>
+            2.4144110083580017e-01 5.1957648992538452e-01
+            1.0300920158624649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 850 3.7483830004930496e-02 -1 -2 851
+            1.2827500468119979e-03</internalNodes>
+          <leafValues>
+            1.8146389722824097e-01 4.2460718750953674e-01
+            5.7079732418060303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 852 -5.1718312315642834e-03 -1 -2 853
+            2.7545939665287733e-03</internalNodes>
+          <leafValues>
+            6.1433231830596924e-01 5.2056711912155151e-01
+            4.2204418778419495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 854 -3.6072919610887766e-03 -1 -2 855
+            -2.5258748792111874e-04</internalNodes>
+          <leafValues>
+            3.1825920939445496e-01 5.7104682922363281e-01
+            4.2260938882827759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 856 -7.0514748804271221e-03 -1 -2 857
+            -5.4323761723935604e-03</internalNodes>
+          <leafValues>
+            5.1628297567367554e-01 2.6662889122962952e-01
+            5.2146798372268677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 858 -1.4652940080850385e-05 -1 -2 859
+            -1.8556920113041997e-03</internalNodes>
+          <leafValues>
+            3.9817610383033752e-01 3.3227631449699402e-01
+            5.7058340311050415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 860 4.7609540633857250e-03 -1 -2 861
+            1.5676260227337480e-03</internalNodes>
+          <leafValues>
+            6.6365581750869751e-01 5.5055677890777588e-01
+            4.4206619262695312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 862 5.4239919409155846e-03 -1 -2 863
+            -6.4692399464547634e-03</internalNodes>
+          <leafValues>
+            5.9599381685256958e-01 5.3695940971374512e-01
+            3.7443399429321289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 864 -7.8038539504632354e-04 -1 -2 865
+            4.5086450874805450e-02</internalNodes>
+          <leafValues>
+            4.1035950183868408e-01 5.1775068044662476e-01
+            1.8781000375747681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 866 -5.1405387930572033e-03 -1 -2 867
+            -2.1236129105091095e-02</internalNodes>
+          <leafValues>
+            2.3528920114040375e-01 1.7087510228157043e-01
+            5.4249739646911621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 868 -2.3763340432196856e-03 -1 -2 869
+            5.4122589528560638e-02</internalNodes>
+          <leafValues>
+            5.8365309238433838e-01 5.1174330711364746e-01
+            1.8659310042858124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 870 -5.3492980077862740e-04 -1 -2 871
+            -5.8454048121348023e-04</internalNodes>
+          <leafValues>
+            5.1086932420730591e-01 4.7754910588264465e-01
+            2.4398539960384369e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>71</maxWeakCount>
+      <stageThreshold>3.4677078247070312e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 872 3.0031939968466759e-03 -1 -2 873
+            6.9161207647994161e-04</internalNodes>
+          <leafValues>
+            3.3496499061584473e-01 4.5183679461479187e-01
+            7.2893542051315308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 874 1.1212790384888649e-02 -1 -2 875
+            -7.6108198845759034e-04</internalNodes>
+          <leafValues>
+            2.9508009552955627e-01 5.6690549850463867e-01
+            2.8308510780334473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 876 1.1984579759882763e-04 -1 -2 877
+            -1.9725349557120353e-04</internalNodes>
+          <leafValues>
+            4.0905779600143433e-01 6.9514942169189453e-01
+            4.6378681063652039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 878 -5.5180420167744160e-03 -1 -2 879
+            1.2148249661549926e-03</internalNodes>
+          <leafValues>
+            3.1676751375198364e-01 3.3167061209678650e-01
+            5.3963977098464966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 880 -4.2497441172599792e-03 -1 -2 881
+            -9.4915721565485001e-03</internalNodes>
+          <leafValues>
+            2.6005738973617554e-01 7.4842947721481323e-01
+            5.0731921195983887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 882 6.5378600265830755e-04 -1 -2 883
+            -4.9741100519895554e-04</internalNodes>
+          <leafValues>
+            3.9520108699798584e-01 5.8802747726440430e-01
+            3.5521200299263000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 884 -4.3079249560832977e-02 -1 -2 885
+            -5.1999092102050781e-04</internalNodes>
+          <leafValues>
+            2.4348780512809753e-01 3.1955629587173462e-01
+            5.5854547023773193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 886 -4.5451628975570202e-03 -1 -2 887
+            -7.9610403627157211e-03</internalNodes>
+          <leafValues>
+            4.8452898859977722e-01 3.8011810183525085e-01
+            5.3585118055343628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 888 -3.1919340835884213e-04 -1 -2 889
+            -1.9223889335989952e-02</internalNodes>
+          <leafValues>
+            4.3563291430473328e-01 2.6130661368370056e-01
+            6.1554962396621704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 890 -1.3076990144327283e-03 -1 -2 891
+            1.9825039431452751e-02</internalNodes>
+          <leafValues>
+            5.9420621395111084e-01 4.9454280734062195e-01
+            7.3848551511764526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 892 -2.2013280540704727e-03 -1 -2 893
+            -7.8596705570816994e-03</internalNodes>
+          <leafValues>
+            2.2144819796085358e-01 3.6009770631790161e-01
+            5.2985501289367676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 894 1.4142199652269483e-03 -1 -2 895
+            -1.1232759803533554e-02</internalNodes>
+          <leafValues>
+            5.7765662670135498e-01 6.9344568252563477e-01
+            4.8272070288658142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 896 2.9746301006525755e-03 -1 -2 897
+            5.3283828310668468e-04</internalNodes>
+          <leafValues>
+            3.2166770100593567e-01 3.9625000953674316e-01
+            5.6803637742996216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 898 1.0105259716510773e-02 -1 -2 899
+            -1.1653699912130833e-02</internalNodes>
+          <leafValues>
+            7.5674182176589966e-01 6.5235567092895508e-01
+            5.0270539522171021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 900 -7.0609981194138527e-03 -1 -2 901
+            2.2343141026794910e-03</internalNodes>
+          <leafValues>
+            2.5387701392173767e-01 4.3872770667076111e-01
+            6.1776322126388550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 902 -2.9802279546856880e-02 -1 -2 903
+            1.1611840454861522e-03</internalNodes>
+          <leafValues>
+            5.2011400461196899e-01 4.6479099988937378e-01
+            6.1842548847198486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 904 9.4824447296559811e-04 -1 -2 905
+            4.1284630424343050e-04</internalNodes>
+          <leafValues>
+            3.0409941077232361e-01 4.5188081264495850e-01
+            6.2457829713821411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 906 -3.1203540042042732e-02 -1 -2 907
+            2.7652881108224392e-03</internalNodes>
+          <leafValues>
+            2.7889358997344971e-01 4.6985000371932983e-01
+            6.5024542808532715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 908 2.5644779205322266e-02 -1 -2 909
+            -7.5331530533730984e-03</internalNodes>
+          <leafValues>
+            1.8051710724830627e-01 3.2080689072608948e-01
+            5.5220228433609009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 910 3.2047149725258350e-03 -1 -2 911
+            -2.4282479716930538e-04</internalNodes>
+          <leafValues>
+            6.4369338750839233e-01 5.6767052412033081e-01
+            4.5091038942337036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 912 -6.1979342717677355e-04 -1 -2 913
+            -8.0101029016077518e-04</internalNodes>
+          <leafValues>
+            3.1221461296081543e-01 2.9651939868927002e-01
+            5.2304947376251221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 914 -9.1816839994862676e-04 -1 -2 915
+            1.2239529751241207e-03</internalNodes>
+          <leafValues>
+            5.4647117853164673e-01 4.6185028553009033e-01
+            5.6795489788055420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 916 -6.8743730662390590e-04 -1 -2 917
+            -1.8252469599246979e-03</internalNodes>
+          <leafValues>
+            5.4308801889419556e-01 5.4336231946945190e-01
+            3.3852210640907288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 918 -7.4570789001882076e-03 -1 -2 919
+            5.3775748237967491e-03</internalNodes>
+          <leafValues>
+            5.2655947208404541e-01 4.8572158813476562e-01
+            6.8151241540908813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 920 3.7602309603244066e-03 -1 -2 921
+            8.7752222316339612e-04</internalNodes>
+          <leafValues>
+            2.8321608901023865e-01 3.9668309688568115e-01
+            5.5124807357788086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 922 5.5084479972720146e-03 -1 -2 923
+            -7.5949047459289432e-04</internalNodes>
+          <leafValues>
+            6.7846202850341797e-01 3.9065030217170715e-01
+            5.4572027921676636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 924 1.6352660022675991e-03 -1 -2 925
+            -1.2750849418807775e-04</internalNodes>
+          <leafValues>
+            3.6402040719985962e-01 5.8297240734100342e-01
+            4.1949799656867981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 926 2.2067610174417496e-02 -1 -2 927
+            -1.9203789532184601e-02</internalNodes>
+          <leafValues>
+            4.6067029237747192e-01 3.2614830136299133e-01
+            5.2360808849334717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 928 -1.2998109683394432e-02 -1 -2 929
+            -3.1332690268754959e-03</internalNodes>
+          <leafValues>
+            7.0221120119094849e-01 2.8704708814620972e-01
+            5.0764769315719604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 930 -5.2937557920813560e-03 -1 -2 931
+            2.1857069805264473e-03</internalNodes>
+          <leafValues>
+            4.7095209360122681e-01 4.7082918882369995e-01
+            6.1698418855667114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 932 -4.5750709250569344e-03 -1 -2 933
+            -4.5152138918638229e-02</internalNodes>
+          <leafValues>
+            3.1142529845237732e-01 1.8514350056648254e-01
+            5.5048149824142456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 934 -2.7783559635281563e-03 -1 -2 935
+            -2.5752480141818523e-03</internalNodes>
+          <leafValues>
+            4.9373480677604675e-01 6.1529481410980225e-01
+            4.7354999184608459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 936 1.1614130344241858e-03 -1 -2 937
+            2.3350189439952374e-03</internalNodes>
+          <leafValues>
+            6.5105718374252319e-01 4.0883418917655945e-01
+            5.6841522455215454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 938 3.8499289657920599e-03 -1 -2 939
+            2.4529630318284035e-03</internalNodes>
+          <leafValues>
+            3.0258288979530334e-01 5.2325028181076050e-01
+            2.0176209509372711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 940 3.6731390282511711e-03 -1 -2 941
+            2.1937100682407618e-03</internalNodes>
+          <leafValues>
+            6.4284259080886841e-01 4.3288651108741760e-01
+            6.4205098152160645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 942 -6.4666871912777424e-03 -1 -2 943
+            -5.7186251506209373e-03</internalNodes>
+          <leafValues>
+            5.2540659904479980e-01 2.4909840524196625e-01
+            5.2876192331314087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 944 9.9941878579556942e-04 -1 -2 945
+            -7.8276498243212700e-04</internalNodes>
+          <leafValues>
+            3.3297958970069885e-01 3.5983449220657349e-01
+            5.4983407258987427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 946 4.3231188319623470e-03 -1 -2 947
+            4.0838290005922318e-03</internalNodes>
+          <leafValues>
+            4.8187050223350525e-01 5.2663302421569824e-01
+            3.1057891249656677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 948 3.0515898833982646e-04 -1 -2 949
+            1.2640280183404684e-03</internalNodes>
+          <leafValues>
+            3.9952918887138367e-01 3.2284379005432129e-01
+            5.8192151784896851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 950 -1.0152660310268402e-02 -1 -2 951
+            -2.6863690000027418e-03</internalNodes>
+          <leafValues>
+            8.0260711908340454e-01 3.8756170868873596e-01
+            5.4665708541870117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 952 -9.0515613555908203e-03 -1 -2 953
+            -6.3204211182892323e-03</internalNodes>
+          <leafValues>
+            4.3720579147338867e-01 1.1265510320663452e-01
+            6.3954162597656250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 954 2.6117300149053335e-03 -1 -2 955
+            1.4339019544422626e-02</internalNodes>
+          <leafValues>
+            5.4239892959594727e-01 4.9792730808258057e-01
+            6.0422360897064209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 956 2.8452780097723007e-03 -1 -2 957
+            1.4783289771003183e-05</internalNodes>
+          <leafValues>
+            3.4910920262336731e-01 4.1950678825378418e-01
+            5.7759660482406616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 958 8.1814555451273918e-03 -1 -2 959
+            6.6321990452706814e-03</internalNodes>
+          <leafValues>
+            4.8859870433807373e-01 5.4444682598114014e-01
+            4.4209951162338257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 960 -2.2483461070805788e-03 -1 -2 961
+            1.2374560348689556e-02</internalNodes>
+          <leafValues>
+            6.6997921466827393e-01 4.4786059856414795e-01
+            6.5648937225341797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 962 -6.6516688093543053e-03 -1 -2 963
+            -8.5750613361597061e-03</internalNodes>
+          <leafValues>
+            5.5118787288665771e-01 4.0174451470375061e-01
+            5.4055362939834595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 964 6.5078441984951496e-03 -1 -2 965
+            2.8675209730863571e-02</internalNodes>
+          <leafValues>
+            2.2943930327892303e-01 5.1779001951217651e-01
+            3.5677561163902283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 966 7.0673860609531403e-03 -1 -2 967
+            1.2367829913273454e-03</internalNodes>
+          <leafValues>
+            5.5646997690200806e-01 3.6276981234550476e-01
+            5.5724138021469116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 968 7.4818679131567478e-03 -1 -2 969
+            4.7109839506447315e-03</internalNodes>
+          <leafValues>
+            6.7849111557006836e-01 4.1212528944015503e-01
+            6.0722357034683228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 970 -6.9405790418386459e-03 -1 -2 971
+            3.3302098512649536e-02</internalNodes>
+          <leafValues>
+            5.4597669839859009e-01 5.2767068147659302e-01
+            2.3749159276485443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 972 3.6104630678892136e-02 -1 -2 973
+            1.9674649462103844e-02</internalNodes>
+          <leafValues>
+            7.2492793202400208e-02 4.6263459324836731e-01
+            8.2089632749557495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 974 3.4766150638461113e-03 -1 -2 975
+            1.3987369602546096e-03</internalNodes>
+          <leafValues>
+            5.2087318897247314e-01 5.4844141006469727e-01
+            4.2300349473953247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 976 4.0974249131977558e-03 -1 -2 977
+            2.6973790954798460e-03</internalNodes>
+          <leafValues>
+            2.7805531024932861e-01 5.4038310050964355e-01
+            3.7909889221191406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 978 -5.6591699831187725e-03 -1 -2 979
+            3.9460969856008887e-04</internalNodes>
+          <leafValues>
+            4.7983360290527344e-01 3.7669500708580017e-01
+            5.4292291402816772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 980 2.1750570740550756e-03 -1 -2 981
+            1.4614439569413662e-03</internalNodes>
+          <leafValues>
+            6.2071627378463745e-01 3.3579450845718384e-01
+            5.1426321268081665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 982 -5.3006567759439349e-04 -1 -2 983
+            1.4869309961795807e-01</internalNodes>
+          <leafValues>
+            5.3446400165557861e-01 5.1596081256866455e-01
+            2.5618231296539307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 984 -5.8816498494707048e-05 -1 -2 985
+            -1.6275369562208652e-03</internalNodes>
+          <leafValues>
+            5.1230919361114502e-01 6.0176461935043335e-01
+            3.1093719601631165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 986 -1.2881809845566750e-02 -1 -2 987
+            9.4982917653396726e-04</internalNodes>
+          <leafValues>
+            2.7122870087623596e-01 5.4424422979354858e-01
+            4.0288880467414856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 988 -1.2315999716520309e-02 -1 -2 989
+            9.0286601334810257e-03</internalNodes>
+          <leafValues>
+            4.7360658645629883e-01 7.4514347314834595e-01
+            3.4879919886589050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 990 -8.6876116693019867e-02 -1 -2 991
+            -1.5107560102478601e-05</internalNodes>
+          <leafValues>
+            2.2903330624103546e-01 5.5178898572921753e-01
+            4.3931490182876587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 992 -1.7457660287618637e-02 -1 -2 993
+            -2.5219470262527466e-03</internalNodes>
+          <leafValues>
+            9.0167902410030365e-02 6.2335401773452759e-01
+            4.7894591093063354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 994 1.0656520025804639e-03 -1 -2 995
+            -4.2540300637483597e-03</internalNodes>
+          <leafValues>
+            5.4896962642669678e-01 5.5798089504241943e-01
+            4.3758779764175415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 996 -9.0349102392792702e-03 -1 -2 997
+            -1.5230999561026692e-03</internalNodes>
+          <leafValues>
+            3.5791561007499695e-01 5.6136602163314819e-01
+            3.9390438795089722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 998 2.8441150207072496e-03 -1 -2 999
+            -3.2824429217725992e-03</internalNodes>
+          <leafValues>
+            3.9015549421310425e-01 4.5286190509796143e-01
+            5.4413431882858276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1000 3.2161718991119415e-05 -1 -2 1001
+            3.0118400900391862e-05</internalNodes>
+          <leafValues>
+            5.8031117916107178e-01 3.3368501067161560e-01
+            5.5048561096191406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1002 -5.6150099262595177e-03 -1 -2 1003
+            -1.7389209941029549e-02</internalNodes>
+          <leafValues>
+            6.1247891187667847e-01 8.7271630764007568e-02
+            5.2045881748199463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1004 -4.4361080654198304e-05 -1 -2 1005
+            1.0354899859521538e-04</internalNodes>
+          <leafValues>
+            3.9353290200233459e-01 5.9188538789749146e-01
+            4.1196140646934509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1006 1.5939630102366209e-03 -1 -2 1007
+            2.5440789759159088e-03</internalNodes>
+          <leafValues>
+            4.8396238684654236e-01 4.7873649001121521e-01
+            6.3606631755828857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1008 1.5083180187502876e-05 -1 -2 1009
+            -9.9282202427275479e-05</internalNodes>
+          <leafValues>
+            4.2311170697212219e-01 4.2745891213417053e-01
+            6.0940480232238770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1010 5.5371708003804088e-04 -1 -2 1011
+            1.9186759600415826e-03</internalNodes>
+          <leafValues>
+            4.2719879746437073e-01 4.4971078634262085e-01
+            5.5491220951080322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1012 -5.0764222396537662e-04 -1 -2 1013
+            1.7236480489373207e-03</internalNodes>
+          <leafValues>
+            5.4771959781646729e-01 2.8829228878021240e-01
+            5.6151270866394043e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>75</maxWeakCount>
+      <stageThreshold>3.6726501464843750e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1014 1.3092169538140297e-02 -1 -2 1015
+            4.1446479735895991e-04</internalNodes>
+          <leafValues>
+            3.3388701081275940e-01 3.0993521213531494e-01
+            6.6774922609329224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1016 2.1835729479789734e-02 -1 -2 1017
+            4.8323940485715866e-02</internalNodes>
+          <leafValues>
+            4.3690490722656250e-01 4.3017241358757019e-01
+            6.1538851261138916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1018 1.6091950237751007e-03 -1 -2 1019
+            1.3469760306179523e-03</internalNodes>
+          <leafValues>
+            3.3873260021209717e-01 6.2487137317657471e-01
+            3.5941308736801147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1020 1.7729059618432075e-04 -1 -2 1021
+            3.6743620876222849e-04</internalNodes>
+          <leafValues>
+            3.8684248924255371e-01 4.4093450903892517e-01
+            5.4764741659164429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1022 -1.2352119665592909e-03 -1 -2 1023
+            1.1705530341714621e-03</internalNodes>
+          <leafValues>
+            3.2601711153984070e-01 4.1113489866256714e-01
+            6.0881638526916504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1024 -2.9695429475395940e-05 -1 -2 1025
+            2.7050738572143018e-04</internalNodes>
+          <leafValues>
+            4.2694228887557983e-01 4.3064668774604797e-01
+            5.8105140924453735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1026 -7.9626210208516568e-05 -1 -2 1027
+            3.3152441028505564e-04</internalNodes>
+          <leafValues>
+            3.6691430211067200e-01 4.6106639504432678e-01
+            6.2905901670455933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1028 -5.2305828779935837e-02 -1 -2 1029
+            2.6880469173192978e-02</internalNodes>
+          <leafValues>
+            5.3286898136138916e-01 5.2132612466812134e-01
+            3.2312199473381042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1030 -2.4203000066336244e-04 -1 -2 1031
+            -1.6424639616161585e-03</internalNodes>
+          <leafValues>
+            3.5685700178146362e-01 3.4406611323356628e-01
+            5.6256049871444702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1032 -2.6830288697965443e-04 -1 -2 1033
+            -2.2649629972875118e-03</internalNodes>
+          <leafValues>
+            4.5611730217933655e-01 5.3213518857955933e-01
+            3.6741548776626587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1034 1.5627209097146988e-02 -1 -2 1035
+            1.6211320459842682e-01</internalNodes>
+          <leafValues>
+            2.0293539762496948e-01 5.5630332231521606e-01
+            2.6188498735427856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1036 -3.7391691002994776e-03 -1 -2 1037
+            -2.0878419745713472e-03</internalNodes>
+          <leafValues>
+            6.0621947050094604e-01 5.9507638216018677e-01
+            4.5451170206069946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1038 2.3334210272878408e-03 -1 -2 1039
+            6.5116386394947767e-05</internalNodes>
+          <leafValues>
+            6.4355242252349854e-01 3.5207340121269226e-01
+            5.1797789335250854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1040 7.4625718407332897e-03 -1 -2 1041
+            -2.2032689303159714e-02</internalNodes>
+          <leafValues>
+            5.3266882896423340e-01 3.4919810295104980e-01
+            5.4292368888854980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1042 -8.3081610500812531e-03 -1 -2 1043
+            -4.3259368976578116e-04</internalNodes>
+          <leafValues>
+            2.0840230584144592e-01 3.9652720093727112e-01
+            5.4254537820816040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1044 -3.2209228724241257e-02 -1 -2 1045
+            -9.0424838708713651e-04</internalNodes>
+          <leafValues>
+            5.3064119815826416e-01 5.4503858089447021e-01
+            4.2566969990730286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1046 2.2727500181645155e-03 -1 -2 1047
+            5.9820008464157581e-03</internalNodes>
+          <leafValues>
+            5.9686112403869629e-01 4.7581401467323303e-01
+            3.1509441137313843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1048 -5.8856618124991655e-04 -1 -2 1049
+            -8.8227191008627415e-04</internalNodes>
+          <leafValues>
+            4.8477488756179810e-01 5.4263162612915039e-01
+            4.3383410573005676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1050 -7.4473457061685622e-05 -1 -2 1051
+            3.9148979703895748e-04</internalNodes>
+          <leafValues>
+            4.2875099182128906e-01 6.3451850414276123e-01
+            4.1018518805503845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1052 -3.6939629353582859e-03 -1 -2 1053
+            -1.1207849718630314e-02</internalNodes>
+          <leafValues>
+            4.8491048812866211e-01 4.1463369131088257e-01
+            5.4712641239166260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1054 -1.0337409563362598e-02 -1 -2 1055
+            3.6883640568703413e-03</internalNodes>
+          <leafValues>
+            2.8771838545799255e-01 5.1019018888473511e-01
+            7.2169512510299683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1056 -3.8984280545264482e-03 -1 -2 1057
+            -5.9986729174852371e-03</internalNodes>
+          <leafValues>
+            5.2761822938919067e-01 6.6184598207473755e-01
+            4.8416310548782349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1058 4.5043681748211384e-03 -1 -2 1059
+            1.7799530178308487e-02</internalNodes>
+          <leafValues>
+            1.8741579353809357e-01 4.6169349551200867e-01
+            7.0889657735824585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1060 -1.8462570384144783e-02 -1 -2 1061
+            1.4931300029275008e-05</internalNodes>
+          <leafValues>
+            3.0019798874855042e-01 4.5618081092834473e-01
+            5.6107878684997559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1062 -8.6021229624748230e-02 -1 -2 1063
+            -6.0818758356617764e-05</internalNodes>
+          <leafValues>
+            2.3417009413242340e-01 5.6722861528396606e-01
+            4.1999641060829163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1064 1.2670679716393352e-03 -1 -2 1065
+            1.3699879636988044e-03</internalNodes>
+          <leafValues>
+            6.2074822187423706e-01 5.3949588537216187e-01
+            3.8238629698753357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1066 3.3162781037390232e-03 -1 -2 1067
+            -1.4532039640471339e-03</internalNodes>
+          <leafValues>
+            7.0616811513900757e-01 3.0655130743980408e-01
+            4.8273730278015137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1068 -7.1492061018943787e-02 -1 -2 1069
+            1.9857978913933039e-03</internalNodes>
+          <leafValues>
+            5.1931220293045044e-01 4.6424350142478943e-01
+            5.8076947927474976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1070 6.2516499310731888e-03 -1 -2 1071
+            2.7005500160157681e-03</internalNodes>
+          <leafValues>
+            2.9498139023780823e-01 4.5858868956565857e-01
+            6.0223537683486938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1072 1.1130389757454395e-02 -1 -2 1073
+            1.5092849731445312e-02</internalNodes>
+          <leafValues>
+            4.3578410148620605e-01 4.5615398883819580e-01
+            6.1190617084503174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1074 -2.7943300083279610e-02 -1 -2 1075
+            4.4036991312168539e-05</internalNodes>
+          <leafValues>
+            6.5371441841125488e-01 3.4747231006622314e-01
+            5.3369677066802979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1076 -1.2232770211994648e-02 -1 -2 1077
+            -6.8591412855312228e-04</internalNodes>
+          <leafValues>
+            3.7316760420799255e-01 5.7172292470932007e-01
+            4.7933790087699890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1078 -3.8992990739643574e-03 -1 -2 1079
+            4.9113907152786851e-04</internalNodes>
+          <leafValues>
+            4.0564361214637756e-01 6.1740481853485107e-01
+            4.4717541337013245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1080 8.2117747515439987e-03 -1 -2 1081
+            -4.5564480125904083e-02</internalNodes>
+          <leafValues>
+            6.1796981096267700e-01 2.2854949533939362e-01
+            5.2495658397674561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1082 -5.3631910122931004e-03 -1 -2 1083
+            -1.2274970300495625e-02</internalNodes>
+          <leafValues>
+            1.7849500477313995e-01 7.2619527578353882e-01
+            4.5503988862037659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1084 5.4185991175472736e-03 -1 -2 1085
+            8.1846961984410882e-04</internalNodes>
+          <leafValues>
+            5.2529907226562500e-01 5.4452222585678101e-01
+            3.2722181081771851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1086 4.1358140297234058e-03 -1 -2 1087
+            3.9578010910190642e-04</internalNodes>
+          <leafValues>
+            7.0138317346572876e-01 4.9659439921379089e-01
+            3.2955980300903320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1088 4.6887691132724285e-03 -1 -2 1089
+            -1.8255440518260002e-02</internalNodes>
+          <leafValues>
+            5.3626418113708496e-01 6.4961087703704834e-01
+            4.7571370005607605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1090 -6.2736468389630318e-03 -1 -2 1091
+            2.4320168886333704e-03</internalNodes>
+          <leafValues>
+            2.3437410593032837e-01 4.6201181411743164e-01
+            6.8984192609786987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1092 -4.9617629498243332e-02 -1 -2 1093
+            1.1701210169121623e-03</internalNodes>
+          <leafValues>
+            2.1007199585437775e-01 4.6215289831161499e-01
+            5.7971358299255371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1094 -4.5237291604280472e-02 -1 -2 1095
+            4.7563421539962292e-03</internalNodes>
+          <leafValues>
+            2.1182620525360107e-01 4.8846149444580078e-01
+            6.8724989891052246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1096 -1.4835969544947147e-02 -1 -2 1097
+            7.7436608262360096e-04</internalNodes>
+          <leafValues>
+            5.2751058340072632e-01 4.1723209619522095e-01
+            5.4911398887634277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1098 1.4835969544947147e-02 -1 -2 1099
+            -8.0892542609944940e-04</internalNodes>
+          <leafValues>
+            2.1248769760131836e-01 5.4952150583267212e-01
+            4.2077958583831787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1100 7.7517668250948191e-04 -1 -2 1101
+            -6.7618978209793568e-03</internalNodes>
+          <leafValues>
+            3.3219420909881592e-01 2.2129580378532410e-01
+            5.2326530218124390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1102 -4.0135860443115234e-02 -1 -2 1103
+            -3.3651469275355339e-03</internalNodes>
+          <leafValues>
+            1.1017960309982300e-01 3.8101008534431458e-01
+            5.6172919273376465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1104 7.4713007779791951e-04 -1 -2 1105
+            -4.2727389372885227e-03</internalNodes>
+          <leafValues>
+            5.7950568199157715e-01 6.3922691345214844e-01
+            4.7114381194114685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1106 3.6202510818839073e-03 -1 -2 1107
+            4.7307618660852313e-04</internalNodes>
+          <leafValues>
+            3.4098839759826660e-01 3.6593028903007507e-01
+            5.3881710767745972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1108 3.3094909042119980e-02 -1 -2 1109
+            -1.1544119566679001e-02</internalNodes>
+          <leafValues>
+            7.1703857183456421e-01 6.3868182897567749e-01
+            4.6813040971755981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1110 -7.4234469793736935e-03 -1 -2 1111
+            -4.2252950370311737e-03</internalNodes>
+          <leafValues>
+            3.2637009024620056e-01 5.7678192853927612e-01
+            4.3464180827140808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1112 1.8133109435439110e-02 -1 -2 1113
+            7.0903049781918526e-03</internalNodes>
+          <leafValues>
+            4.6978279948234558e-01 4.4373890757560730e-01
+            6.0616689920425415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1114 -1.3272940181195736e-02 -1 -2 1115
+            1.4632199599873275e-04</internalNodes>
+          <leafValues>
+            6.5585112571716309e-01 3.3763539791107178e-01
+            5.0916552543640137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1116 -3.5790191031992435e-03 -1 -2 1117
+            -4.6997101162560284e-04</internalNodes>
+          <leafValues>
+            2.9478839039802551e-01 5.5569821596145630e-01
+            4.6654561161994934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1118 -4.8179440200328827e-02 -1 -2 1119
+            -9.2581362696364522e-04</internalNodes>
+          <leafValues>
+            7.3383557796478271e-01 3.5438719391822815e-01
+            5.2851498126983643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1120 -1.4780730009078979e-02 -1 -2 1121
+            -1.0027450323104858e-01</internalNodes>
+          <leafValues>
+            1.9444419443607330e-01 9.9049292504787445e-02
+            5.1398539543151855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1122 -9.3848101096227765e-04 -1 -2 1123
+            -2.8861360624432564e-03</internalNodes>
+          <leafValues>
+            5.8271098136901855e-01 3.4414279460906982e-01
+            5.1488387584686279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1124 -4.3682761490345001e-02 -1 -2 1125
+            2.6115700602531433e-03</internalNodes>
+          <leafValues>
+            5.2079981565475464e-01 4.8355031013488770e-01
+            6.3222199678421021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1126 4.3682761490345001e-02 -1 -2 1127
+            1.7179530113935471e-03</internalNodes>
+          <leafValues>
+            1.3645380735397339e-01 4.5373201370239258e-01
+            6.0667508840560913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1128 -3.3964909613132477e-02 -1 -2 1129
+            -1.0993590112775564e-03</internalNodes>
+          <leafValues>
+            4.9683749675750732e-01 5.8316808938980103e-01
+            4.6882399916648865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1130 5.4301079362630844e-02 -1 -2 1131
+            1.0993590112775564e-03</internalNodes>
+          <leafValues>
+            7.5682890415191650e-01 4.3301481008529663e-01
+            5.7684689760208130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1132 -1.4954120160837192e-05 -1 -2 1133
+            3.1415868550539017e-02</internalNodes>
+          <leafValues>
+            4.4432818889617920e-01 5.2744728326797485e-01
+            3.0378559231758118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1134 1.0831849649548531e-02 -1 -2 1135
+            8.6545711383223534e-04</internalNodes>
+          <leafValues>
+            3.5817208886146545e-01 5.9375840425491333e-01
+            4.2946299910545349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1136 2.2743160370737314e-03 -1 -2 1137
+            3.9340821094810963e-03</internalNodes>
+          <leafValues>
+            5.9545767307281494e-01 4.7922229766845703e-01
+            5.8561331033706665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1138 8.1451907753944397e-03 -1 -2 1139
+            -5.2763288840651512e-03</internalNodes>
+          <leafValues>
+            3.5734778642654419e-01 4.0260228514671326e-01
+            5.7647430896759033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1140 -8.3787851035594940e-03 -1 -2 1141
+            1.5621910570189357e-03</internalNodes>
+          <leafValues>
+            4.9813330173492432e-01 4.7365880012512207e-01
+            5.5836081504821777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1142 3.2318739686161280e-03 -1 -2 1143
+            6.6804019734263420e-03</internalNodes>
+          <leafValues>
+            6.1674368381500244e-01 4.1314241290092468e-01
+            6.2806951999664307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1144 -3.3396480139344931e-03 -1 -2 1145
+            -2.0933480560779572e-01</internalNodes>
+          <leafValues>
+            3.4463581442832947e-01 1.0386580228805542e-01
+            5.2044892311096191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1146 6.3805822283029556e-03 -1 -2 1147
+            -6.0137799009680748e-03</internalNodes>
+          <leafValues>
+            2.1674020588397980e-01 6.7383992671966553e-01
+            4.8966509103775024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1148 -8.1756077706813812e-03 -1 -2 1149
+            6.3951779156923294e-04</internalNodes>
+          <leafValues>
+            5.1779150962829590e-01 4.8196458816528320e-01
+            5.4644381999969482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1150 1.0127760469913483e-03 -1 -2 1151
+            4.9784599104896188e-04</internalNodes>
+          <leafValues>
+            3.4235960245132446e-01 4.4884610176086426e-01
+            5.9126710891723633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1152 1.3596490316558629e-04 -1 -2 1153
+            1.3571660034358501e-02</internalNodes>
+          <leafValues>
+            5.5688631534576416e-01 5.1610678434371948e-01
+            1.7130009829998016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1154 3.0259079721872695e-05 -1 -2 1155
+            -3.2625840976834297e-03</internalNodes>
+          <leafValues>
+            4.9162039160728455e-01 6.4046627283096313e-01
+            2.8590849041938782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1156 -1.9217010412830859e-04 -1 -2 1157
+            2.1993879228830338e-02</internalNodes>
+          <leafValues>
+            5.4592829942703247e-01 4.7157138586044312e-01
+            5.6900751590728760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1158 7.8907777788117528e-04 -1 -2 1159
+            5.0893891602754593e-04</internalNodes>
+          <leafValues>
+            3.2798269391059875e-01 4.3020078539848328e-01
+            5.6960451602935791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1160 1.1662710312521085e-04 -1 -2 1161
+            8.0604078248143196e-03</internalNodes>
+          <leafValues>
+            5.3872352838516235e-01 5.0214231014251709e-01
+            5.9653222560882568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1162 9.5925969071686268e-04 -1 -2 1163
+            -1.9526129588484764e-02</internalNodes>
+          <leafValues>
+            3.4734940528869629e-01 6.4755451679229736e-01
+            4.6437820792198181e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>78</maxWeakCount>
+      <stageThreshold>3.8236038208007812e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1164 4.1242439299821854e-02 -1 -2 1165
+            1.5626709908246994e-02</internalNodes>
+          <leafValues>
+            3.3933150768280029e-01 5.1041001081466675e-01
+            7.7728152275085449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1166 2.9947189614176750e-04 -1 -2 1167
+            -1.0037609608843923e-03</internalNodes>
+          <leafValues>
+            3.6646738648414612e-01 5.4056507349014282e-01
+            3.9262050390243530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1168 6.8128242855891585e-04 -1 -2 1169
+            1.3098999625071883e-04</internalNodes>
+          <leafValues>
+            4.2515191435813904e-01 4.1351449489593506e-01
+            6.9257462024688721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1170 3.1696720980107784e-03 -1 -2 1171
+            -2.0587369799613953e-03</internalNodes>
+          <leafValues>
+            3.4558731317520142e-01 2.2341939806938171e-01
+            5.2861189842224121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1172 -4.6395038953050971e-04 -1 -2 1173
+            3.5089480224996805e-03</internalNodes>
+          <leafValues>
+            4.2065200209617615e-01 6.5029817819595337e-01
+            4.1175979375839233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1174 -2.3975980002433062e-03 -1 -2 1175
+            1.0901279747486115e-03</internalNodes>
+          <leafValues>
+            3.6733010411262512e-01 2.9062381386756897e-01
+            5.4451119899749756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1176 -1.6524370585102588e-04 -1 -2 1177
+            -4.1602319106459618e-04</internalNodes>
+          <leafValues>
+            4.2335158586502075e-01 3.8863611221313477e-01
+            6.2691658735275269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1178 -2.3739910102449358e-04 -1 -2 1179
+            2.4739760905504227e-02</internalNodes>
+          <leafValues>
+            5.5244511365890503e-01 4.9600958824157715e-01
+            5.3734910488128662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1180 -1.5342839993536472e-02 -1 -2 1181
+            1.1540469713509083e-02</internalNodes>
+          <leafValues>
+            6.8494051694869995e-01 4.0372350811958313e-01
+            6.7869400978088379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1182 6.4230621792376041e-03 -1 -2 1183
+            1.2977809645235538e-02</internalNodes>
+          <leafValues>
+            3.8146761059761047e-01 5.5270588397979736e-01
+            3.7449559569358826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1184 1.1063399724662304e-03 -1 -2 1185
+            1.3743690215051174e-03</internalNodes>
+          <leafValues>
+            3.5209289193153381e-01 5.6419032812118530e-01
+            3.0750259757041931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1186 1.6233779489994049e-02 -1 -2 1187
+            -8.1519351806491613e-04</internalNodes>
+          <leafValues>
+            4.8888280987739563e-01 5.4563212394714355e-01
+            4.7435501217842102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1188 -9.0782493352890015e-02 -1 -2 1189
+            1.1665210127830505e-02</internalNodes>
+          <leafValues>
+            2.9252481460571289e-01 4.6884548664093018e-01
+            6.2303477525711060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1190 -2.3286409676074982e-02 -1 -2 1191
+            2.1559339947998524e-03</internalNodes>
+          <leafValues>
+            6.8958431482315063e-01 5.3558021783828735e-01
+            3.4234660863876343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1192 -4.3167220428586006e-03 -1 -2 1193
+            1.5610599657520652e-03</internalNodes>
+          <leafValues>
+            5.9370762109756470e-01 4.7086599469184875e-01
+            2.7369970083236694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1194 1.4076639898121357e-02 -1 -2 1195
+            7.1018589660525322e-03</internalNodes>
+          <leafValues>
+            5.2871561050415039e-01 5.3361928462982178e-01
+            3.2248139381408691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1196 -4.8221647739410400e-03 -1 -2 1197
+            -5.3852899000048637e-03</internalNodes>
+          <leafValues>
+            2.9839101433753967e-01 5.6239992380142212e-01
+            4.2959120869636536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1198 7.3483278974890709e-03 -1 -2 1199
+            -3.5707519855350256e-03</internalNodes>
+          <leafValues>
+            6.8139612674713135e-01 5.8579689264297485e-01
+            4.6034291386604309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1200 2.3340100888162851e-03 -1 -2 1201
+            4.7432780265808105e-03</internalNodes>
+          <leafValues>
+            2.7448511123657227e-01 5.0475269556045532e-01
+            2.3627419769763947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1202 6.5055489540100098e-03 -1 -2 1203
+            1.2589249759912491e-02</internalNodes>
+          <leafValues>
+            5.2422481775283813e-01 4.8236909508705139e-01
+            6.7525368928909302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1204 -6.3358368352055550e-03 -1 -2 1205
+            -5.7639651931822300e-03</internalNodes>
+          <leafValues>
+            1.7346349358558655e-01 6.3543808460235596e-01
+            4.5874750614166260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1206 1.3599749654531479e-03 -1 -2 1207
+            2.8404260054230690e-02</internalNodes>
+          <leafValues>
+            4.5803809165954590e-01 5.1763808727264404e-01
+            1.2043850123882294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1208 -9.2958156019449234e-03 -1 -2 1209
+            -1.1800320353358984e-03</internalNodes>
+          <leafValues>
+            2.3379570245742798e-01 3.9028140902519226e-01
+            5.6529301404953003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1210 -2.0948140881955624e-03 -1 -2 1211
+            4.1679958812892437e-03</internalNodes>
+          <leafValues>
+            5.5120289325714111e-01 5.4559761285781860e-01
+            4.7989490628242493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1212 5.4458891972899437e-03 -1 -2 1213
+            -1.2766510481014848e-03</internalNodes>
+          <leafValues>
+            6.1270868778228760e-01 5.3171318769454956e-01
+            3.8509321212768555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1214 5.9404270723462105e-04 -1 -2 1215
+            4.2309608310461044e-02</internalNodes>
+          <leafValues>
+            5.4464370012283325e-01 5.2346438169479370e-01
+            2.2130440175533295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1216 5.6189671158790588e-03 -1 -2 1217
+            7.2401198558509350e-03</internalNodes>
+          <leafValues>
+            4.9161979556083679e-01 1.4714759588241577e-01
+            4.8528939485549927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1218 -4.5610670931637287e-03 -1 -2 1219
+            4.5506159949582070e-05</internalNodes>
+          <leafValues>
+            2.7737739682197571e-01 4.6264618635177612e-01
+            5.7680791616439819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1220 -6.1903791502118111e-03 -1 -2 1221
+            8.1186462193727493e-04</internalNodes>
+          <leafValues>
+            1.6442899405956268e-01 4.7785910964012146e-01
+            6.2618649005889893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1222 1.3779809698462486e-02 -1 -2 1223
+            1.1290319962427020e-03</internalNodes>
+          <leafValues>
+            5.2573078870773315e-01 5.4980480670928955e-01
+            3.9831069111824036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1224 -1.0610350000206381e-04 -1 -2 1225
+            1.6695790691301227e-04</internalNodes>
+          <leafValues>
+            4.0335190296173096e-01 4.1493400931358337e-01
+            5.7953411340713501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1226 1.1290319962427020e-03 -1 -2 1227
+            -1.2019349634647369e-01</internalNodes>
+          <leafValues>
+            3.9341148734092712e-01 7.3400482535362244e-02
+            5.2025860548019409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1228 -1.5230740420520306e-02 -1 -2 1229
+            3.5759829916059971e-03</internalNodes>
+          <leafValues>
+            3.7495058774948120e-01 5.0781500339508057e-01
+            6.6060662269592285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1230 1.3479460030794144e-02 -1 -2 1231
+            -2.1162950433790684e-03</internalNodes>
+          <leafValues>
+            4.5477110147476196e-01 3.3110061287879944e-01
+            5.3842592239379883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1232 -1.7877709120512009e-02 -1 -2 1233
+            1.0931970318779349e-03</internalNodes>
+          <leafValues>
+            6.5132528543472290e-01 5.2647650241851807e-01
+            3.4569910168647766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1234 -3.0553159303963184e-03 -1 -2 1235
+            3.6365049891173840e-03</internalNodes>
+          <leafValues>
+            6.2686139345169067e-01 5.3992128372192383e-01
+            4.3453970551490784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1236 9.7896481747739017e-05 -1 -2 1237
+            -3.2714448752813041e-04</internalNodes>
+          <leafValues>
+            3.8356059789657593e-01 3.3376678824424744e-01
+            5.5391657352447510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1238 4.3425030889920890e-04 -1 -2 1239
+            1.4005579985678196e-02</internalNodes>
+          <leafValues>
+            5.7882702350616455e-01 5.2750778198242188e-01
+            2.7011251449584961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1240 -9.2654931358993053e-04 -1 -2 1241
+            3.9504268206655979e-03</internalNodes>
+          <leafValues>
+            5.8522802591323853e-01 4.7283369302749634e-01
+            3.3139181137084961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1242 -5.8086868375539780e-04 -1 -2 1243
+            -1.2018020264804363e-02</internalNodes>
+          <leafValues>
+            4.2588108777999878e-01 5.6097871065139771e-01
+            4.8951920866966248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1244 -1.4521540701389313e-01 -1 -2 1245
+            -6.6049019806087017e-03</internalNodes>
+          <leafValues>
+            4.3894480913877487e-02 4.2291709780693054e-01
+            5.6162929534912109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1246 -3.4909751266241074e-02 -1 -2 1247
+            3.7478420417755842e-03</internalNodes>
+          <leafValues>
+            4.7881281375885010e-01 4.8002821207046509e-01
+            5.8013892173767090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1248 3.3038031309843063e-02 -1 -2 1249
+            3.6872599739581347e-03</internalNodes>
+          <leafValues>
+            7.0781761407852173e-01 4.4496241211891174e-01
+            5.9577310085296631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1250 -4.5311939902603626e-03 -1 -2 1251
+            4.1058510541915894e-03</internalNodes>
+          <leafValues>
+            4.1770470142364502e-01 5.3729480504989624e-01
+            3.7369269132614136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1252 -8.7599847465753555e-03 -1 -2 1253
+            -2.3003309965133667e-02</internalNodes>
+          <leafValues>
+            6.6588079929351807e-01 2.6479220390319824e-01
+            5.1018178462982178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1254 5.3664818406105042e-03 -1 -2 1255
+            3.8971770554780960e-02</internalNodes>
+          <leafValues>
+            4.5486348867416382e-01 5.1570618152618408e-01
+            3.4364390373229980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1256 -2.7767190709710121e-02 -1 -2 1257
+            -9.8894089460372925e-03</internalNodes>
+          <leafValues>
+            2.3543910682201385e-01 6.8877410888671875e-01
+            5.1110517978668213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1258 -3.2073140610009432e-03 -1 -2 1259
+            -6.7484978353604674e-04</internalNodes>
+          <leafValues>
+            5.4388678073883057e-01 5.4511487483978271e-01
+            4.8313531279563904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1260 -5.1947520114481449e-03 -1 -2 1261
+            -2.6169899501837790e-04</internalNodes>
+          <leafValues>
+            2.1134190261363983e-01 5.2736818790435791e-01
+            3.9925870299339294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1262 2.2421479225158691e-03 -1 -2 1263
+            -1.2139769969508052e-03</internalNodes>
+          <leafValues>
+            4.6882608532905579e-01 5.5042350292205811e-01
+            4.3848711252212524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1264 -2.9469770379364491e-03 -1 -2 1265
+            -3.9291830034926534e-04</internalNodes>
+          <leafValues>
+            3.8928470015525818e-01 6.0017228126525879e-01
+            4.5616629719734192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1266 6.2550729513168335e-01 -1 -2 1267
+            9.7744520753622055e-03</internalNodes>
+          <leafValues>
+            6.8125613033771515e-02 4.8130258917808533e-01
+            5.6206572055816650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1268 9.4378247857093811e-02 -1 -2 1269
+            -1.9560910295695066e-03</internalNodes>
+          <leafValues>
+            6.6632293164730072e-02 3.5882329940795898e-01
+            5.2954071760177612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1270 9.0652769431471825e-03 -1 -2 1271
+            4.2138071148656309e-04</internalNodes>
+          <leafValues>
+            4.8226881027221680e-01 4.6703329682350159e-01
+            5.6831127405166626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1272 -4.4220191193744540e-04 -1 -2 1273
+            -4.7313501127064228e-03</internalNodes>
+          <leafValues>
+            5.3607952594757080e-01 6.1372458934783936e-01
+            3.1880891323089600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1274 1.5395509544759989e-03 -1 -2 1275
+            2.4315000046044588e-03</internalNodes>
+          <leafValues>
+            4.4877201318740845e-01 4.8941668868064880e-01
+            6.7166537046432495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1276 -1.5581619925796986e-02 -1 -2 1277
+            1.0816920548677444e-03</internalNodes>
+          <leafValues>
+            3.3367419242858887e-01 4.7182199358940125e-01
+            5.9606271982192993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1278 -2.2197659127414227e-03 -1 -2 1279
+            -9.3048671260476112e-04</internalNodes>
+          <leafValues>
+            3.5885548591613770e-01 6.2187129259109497e-01
+            4.8173001408576965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1280 -4.7418707981705666e-03 -1 -2 1281
+            -6.2950369901955128e-03</internalNodes>
+          <leafValues>
+            2.5500270724296570e-01 6.7280787229537964e-01
+            5.0510638952255249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1282 3.5216049291193485e-03 -1 -2 1283
+            -2.4289379362016916e-03</internalNodes>
+          <leafValues>
+            5.4019099473953247e-01 5.4194617271423340e-01
+            4.3471428751945496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1284 -2.5261470582336187e-03 -1 -2 1285
+            -1.4817339833825827e-03</internalNodes>
+          <leafValues>
+            6.9706249237060547e-01 3.2634168863296509e-01
+            4.9178731441497803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1286 -2.2474530339241028e-01 -1 -2 1287
+            2.8342509176582098e-03</internalNodes>
+          <leafValues>
+            7.2937291115522385e-03 4.5792299509048462e-01
+            5.3798812627792358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1288 -2.0821610465645790e-02 -1 -2 1289
+            1.4896340144332498e-04</internalNodes>
+          <leafValues>
+            6.0240888595581055e-01 3.3361440896987915e-01
+            4.9628159403800964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1290 -3.3524499740451574e-03 -1 -2 1291
+            -3.7279881536960602e-02</internalNodes>
+          <leafValues>
+            3.5587510466575623e-01 1.6985629498958588e-01
+            5.2089858055114746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1292 1.3896770542487502e-04 -1 -2 1293
+            -3.1912620761431754e-04</internalNodes>
+          <leafValues>
+            5.5906862020492554e-01 5.8487337827682495e-01
+            3.7958368659019470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1294 5.4003461264073849e-04 -1 -2 1295
+            3.8956850767135620e-03</internalNodes>
+          <leafValues>
+            5.6702882051467896e-01 5.1826947927474976e-01
+            3.3277091383934021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1296 1.6084529925137758e-03 -1 -2 1297
+            -5.7474587811157107e-04</internalNodes>
+          <leafValues>
+            5.4104858636856079e-01 6.0226422548294067e-01
+            3.6446440219879150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1298 1.3435039669275284e-02 -1 -2 1299
+            2.1368139423429966e-03</internalNodes>
+          <leafValues>
+            3.4412819147109985e-01 5.2924340963363647e-01
+            2.7470758557319641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1300 1.4157629571855068e-02 -1 -2 1301
+            5.3884391672909260e-03</internalNodes>
+          <leafValues>
+            8.0278682708740234e-01 5.2223151922225952e-01
+            3.5867279767990112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1302 8.8013410568237305e-03 -1 -2 1303
+            3.8858849438838661e-04</internalNodes>
+          <leafValues>
+            4.9003869295120239e-01 4.6810561418533325e-01
+            5.7219529151916504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1304 -2.2143588867038488e-03 -1 -2 1305
+            -8.4642972797155380e-03</internalNodes>
+          <leafValues>
+            5.3888058662414551e-01 6.6755378246307373e-01
+            3.4484419226646423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1306 1.5044390223920345e-02 -1 -2 1307
+            7.6346402056515217e-03</internalNodes>
+          <leafValues>
+            9.2396140098571777e-01 4.8848968744277954e-01
+            6.3060528039932251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1308 3.3895121305249631e-04 -1 -2 1309
+            2.1157610171940178e-04</internalNodes>
+          <leafValues>
+            3.9974310994148254e-01 5.6639820337295532e-01
+            3.9729809761047363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1310 -2.7514949440956116e-02 -1 -2 1311
+            5.1603060215711594e-02</internalNodes>
+          <leafValues>
+            5.2010637521743774e-01 5.1407301425933838e-01
+            1.2451309710741043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1312 3.7510651163756847e-03 -1 -2 1313
+            -2.1457639522850513e-03</internalNodes>
+          <leafValues>
+            3.8020950555801392e-01 3.3094480633735657e-01
+            5.4745388031005859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1314 -5.8178009930998087e-04 -1 -2 1315
+            -9.3638541875407100e-04</internalNodes>
+          <leafValues>
+            4.8926019668579102e-01 5.9373992681503296e-01
+            4.6646690368652344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1316 4.1667491197586060e-02 -1 -2 1317
+            -6.7763780243694782e-03</internalNodes>
+          <leafValues>
+            7.0213532447814941e-01 3.2227510213851929e-01
+            5.0683951377868652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1318 -2.9170580673962831e-03 -1 -2 1319
+            3.2789530814625323e-04</internalNodes>
+          <leafValues>
+            4.7177010774612427e-01 4.5093831419944763e-01
+            5.6511628627777100e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>91</maxWeakCount>
+      <stageThreshold>4.4682968139648438e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1320 1.1729800142347813e-02 -1 -2 1321
+            1.1712179984897375e-03</internalNodes>
+          <leafValues>
+            3.8052248954772949e-01 3.1400179862976074e-01
+            6.8581461906433105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1322 9.3555096536874771e-03 -1 -2 1323
+            1.6570610459893942e-03</internalNodes>
+          <leafValues>
+            6.8346732854843140e-01 2.9924729466438293e-01
+            5.4756778478622437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1324 -1.3387809740379453e-03 -1 -2 1325
+            1.7580550047568977e-04</internalNodes>
+          <leafValues>
+            2.9414069652557373e-01 3.8969779014587402e-01
+            5.8729708194732666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1326 -2.9473248869180679e-03 -1 -2 1327
+            8.3220899105072021e-03</internalNodes>
+          <leafValues>
+            3.5765719413757324e-01 5.2324008941650391e-01
+            3.2310879230499268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1328 7.4366689659655094e-03 -1 -2 1329
+            -2.1322889369912446e-04</internalNodes>
+          <leafValues>
+            6.7156732082366943e-01 5.4705417156219482e-01
+            3.8633960485458374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1330 -7.8024631366133690e-03 -1 -2 1331
+            5.6611228501424193e-04</internalNodes>
+          <leafValues>
+            2.7714601159095764e-01 4.6891361474990845e-01
+            5.8519637584686279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1332 -9.2346500605344772e-03 -1 -2 1333
+            -1.4676499631605111e-05</internalNodes>
+          <leafValues>
+            2.7043971419334412e-01 5.6225502490997314e-01
+            3.5793170332908630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1334 9.7007937729358673e-03 -1 -2 1335
+            -3.5320650786161423e-03</internalNodes>
+          <leafValues>
+            4.1738718748092651e-01 4.1950130462646484e-01
+            5.5494689941406250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1336 2.1616410464048386e-02 -1 -2 1337
+            3.4567608963698149e-03</internalNodes>
+          <leafValues>
+            2.8573909401893616e-01 6.0245329141616821e-01
+            4.3775078654289246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1338 2.2914320230484009e-02 -1 -2 1339
+            3.4328910987824202e-03</internalNodes>
+          <leafValues>
+            4.6893501281738281e-01 4.6646049618721008e-01
+            5.7625621557235718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1340 -8.6510833352804184e-03 -1 -2 1341
+            1.4510039472952485e-03</internalNodes>
+          <leafValues>
+            6.3817399740219116e-01 3.7114879488945007e-01
+            5.5307507514953613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1342 7.8191719949245453e-03 -1 -2 1343
+            2.0798550394829363e-04</internalNodes>
+          <leafValues>
+            5.2643620967864990e-01 3.7305128574371338e-01
+            5.4457312822341919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1344 -3.9962218143045902e-03 -1 -2 1345
+            -1.5010139577498194e-05</internalNodes>
+          <leafValues>
+            2.4381700158119202e-01 5.3246712684631348e-01
+            3.6829888820648193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1346 -4.2428788729012012e-03 -1 -2 1347
+            9.1374982148408890e-03</internalNodes>
+          <leafValues>
+            6.4814740419387817e-01 4.8961588740348816e-01
+            6.5588432550430298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1348 8.8254585862159729e-03 -1 -2 1349
+            9.4092212384566665e-04</internalNodes>
+          <leafValues>
+            3.6138701438903809e-01 5.5028957128524780e-01
+            3.6325180530548096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1350 -1.2503350153565407e-02 -1 -2 1351
+            8.6759645491838455e-03</internalNodes>
+          <leafValues>
+            2.2611320018768311e-01 4.9878901243209839e-01
+            6.8471962213516235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1352 -1.0416760109364986e-02 -1 -2 1353
+            2.7432460337877274e-03</internalNodes>
+          <leafValues>
+            2.4462990462779999e-01 3.5115250945091248e-01
+            5.3998267650604248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1354 -4.2385691776871681e-03 -1 -2 1355
+            1.8325870856642723e-02</internalNodes>
+          <leafValues>
+            6.8236732482910156e-01 4.8915800452232361e-01
+            7.1356189250946045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1356 -2.4334540590643883e-02 -1 -2 1357
+            4.6469361404888332e-04</internalNodes>
+          <leafValues>
+            3.5225218534469604e-01 4.0498688817024231e-01
+            5.5158257484436035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1358 3.4260009415447712e-03 -1 -2 1359
+            -2.5827318895608187e-03</internalNodes>
+          <leafValues>
+            4.1267699003219604e-01 2.8994289040565491e-01
+            5.3864318132400513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1360 1.0545699624344707e-03 -1 -2 1361
+            -9.1257691383361816e-04</internalNodes>
+          <leafValues>
+            3.7713441252708435e-01 5.8273869752883911e-01
+            4.2675569653511047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1362 2.6589010376483202e-03 -1 -2 1363
+            4.8598358407616615e-03</internalNodes>
+          <leafValues>
+            4.6881249547004700e-01 4.8539221286773682e-01
+            6.1636447906494141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1364 8.0638676881790161e-03 -1 -2 1365
+            -7.5898370705544949e-03</internalNodes>
+          <leafValues>
+            1.7491950094699860e-01 6.8261897563934326e-01
+            4.8940700292587280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1366 3.6368070868775249e-04 -1 -2 1367
+            6.2594950199127197e-02</internalNodes>
+          <leafValues>
+            4.6145960688591003e-01 5.1830172538757324e-01
+            2.6866960525512695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1368 -4.9753207713365555e-03 -1 -2 1369
+            -2.0880119409412146e-03</internalNodes>
+          <leafValues>
+            1.7584669589996338e-01 6.3693821430206299e-01
+            4.9300441145896912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1370 9.5644511748105288e-04 -1 -2 1371
+            -3.1721461564302444e-02</internalNodes>
+          <leafValues>
+            4.1393989324569702e-01 6.0455572605133057e-01
+            4.8163640499114990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1372 1.2898689601570368e-03 -1 -2 1373
+            9.8405163735151291e-03</internalNodes>
+          <leafValues>
+            5.4508107900619507e-01 2.9240009188652039e-01
+            6.6996061801910400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1374 1.2237089686095715e-03 -1 -2 1375
+            -8.4232585504651070e-03</internalNodes>
+          <leafValues>
+            6.2828367948532104e-01 5.9865701198577881e-01
+            4.8525801301002502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1376 -7.2726322105154395e-04 -1 -2 1377
+            4.6842931769788265e-03</internalNodes>
+          <leafValues>
+            3.3400490880012512e-01 5.1689237356185913e-01
+            2.6794800162315369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1378 -1.0379579616710544e-03 -1 -2 1379
+            9.1342730447649956e-03</internalNodes>
+          <leafValues>
+            5.9257918596267700e-01 5.4377281665802002e-01
+            4.3468001484870911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1380 1.4971119817346334e-03 -1 -2 1381
+            1.5762320253998041e-03</internalNodes>
+          <leafValues>
+            4.1295009851455688e-01 4.5228740572929382e-01
+            6.5562921762466431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1382 8.7496247142553329e-03 -1 -2 1383
+            -8.5103599121794105e-04</internalNodes>
+          <leafValues>
+            4.5320340991020203e-01 3.7859839200973511e-01
+            5.4169750213623047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1384 -1.7325570806860924e-02 -1 -2 1385
+            -8.3266440778970718e-03</internalNodes>
+          <leafValues>
+            6.8842482566833496e-01 3.0913260579109192e-01
+            5.2436548471450806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1386 1.5157909729168750e-05 -1 -2 1387
+            1.8041470320895314e-03</internalNodes>
+          <leafValues>
+            4.7657939791679382e-01 4.7253859043121338e-01
+            5.7165551185607910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1388 3.0691560823470354e-03 -1 -2 1389
+            -5.2225510444259271e-05</internalNodes>
+          <leafValues>
+            2.1433599293231964e-01 5.6532102823257446e-01
+            4.3851110339164734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1390 1.0072169970953837e-04 -1 -2 1391
+            1.3573700562119484e-04</internalNodes>
+          <leafValues>
+            5.9247761964797974e-01 4.5734488964080811e-01
+            5.7693827152252197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1392 9.2137878527864814e-04 -1 -2 1393
+            3.0316581251099706e-04</internalNodes>
+          <leafValues>
+            5.9926092624664307e-01 3.6100810766220093e-01
+            5.0493258237838745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1394 3.9582479745149612e-02 -1 -2 1395
+            4.7519680112600327e-02</internalNodes>
+          <leafValues>
+            1.5384890139102936e-01 5.2161407470703125e-01
+            1.4283910393714905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1396 1.8871759995818138e-02 -1 -2 1397
+            -3.9876459049992263e-04</internalNodes>
+          <leafValues>
+            2.8255069255828857e-01 4.0350168943405151e-01
+            5.4377931356430054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1398 4.6556600136682391e-04 -1 -2 1399
+            6.7090610973536968e-03</internalNodes>
+          <leafValues>
+            4.6689969301223755e-01 5.3313547372817993e-01
+            4.1365718841552734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1400 -1.8931160448119044e-03 -1 -2 1401
+            -1.3056949712336063e-02</internalNodes>
+          <leafValues>
+            7.1551632881164551e-01 3.1178998947143555e-01
+            5.2084398269653320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1402 -1.9484119547996670e-04 -1 -2 1403
+            1.5093220099515747e-05</internalNodes>
+          <leafValues>
+            4.6376588940620422e-01 4.5616531372070312e-01
+            5.4452341794967651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1404 -7.1617960202274844e-06 -1 -2 1405
+            3.0164679628796875e-04</internalNodes>
+          <leafValues>
+            4.1931080818176270e-01 5.9662377834320068e-01
+            4.1005000472068787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1406 4.4195181690156460e-03 -1 -2 1407
+            -7.3984181508421898e-03</internalNodes>
+          <leafValues>
+            4.8450559377670288e-01 6.2068462371826172e-01
+            4.9312090873718262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1408 -7.8031201846897602e-03 -1 -2 1409
+            -1.0731429792940617e-02</internalNodes>
+          <leafValues>
+            5.2824628353118896e-01 9.1048341989517212e-01
+            3.4559220075607300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1410 1.4246780192479491e-03 -1 -2 1411
+            -8.2717568147927523e-05</internalNodes>
+          <leafValues>
+            4.7085541486740112e-01 5.6516230106353760e-01
+            4.7310239076614380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1412 4.4803409837186337e-03 -1 -2 1413
+            3.0789140146225691e-03</internalNodes>
+          <leafValues>
+            6.1758869886398315e-01 5.1395332813262939e-01
+            3.4230878949165344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1414 -1.1310289846733212e-03 -1 -2 1415
+            -1.0410690447315574e-03</internalNodes>
+          <leafValues>
+            4.9182820320129395e-01 5.9420871734619141e-01
+            4.9230429530143738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1416 1.1648540385067463e-03 -1 -2 1417
+            9.0057362103834748e-04</internalNodes>
+          <leafValues>
+            6.4052718877792358e-01 4.5043969154357910e-01
+            6.1920768022537231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1418 6.8781538866460323e-03 -1 -2 1419
+            -3.5283900797367096e-02</internalNodes>
+          <leafValues>
+            5.3748130798339844e-01 2.2471010684967041e-01
+            5.2171707153320312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1420 -1.3320200378075242e-03 -1 -2 1421
+            -2.3177571129053831e-03</internalNodes>
+          <leafValues>
+            2.5547030568122864e-01 3.7925159931182861e-01
+            5.2432268857955933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1422 2.1332940377760679e-04 -1 -2 1423
+            1.3467900454998016e-02</internalNodes>
+          <leafValues>
+            3.8603371381759644e-01 5.3806877136230469e-01
+            4.1783639788627625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1424 -1.2829169863834977e-03 -1 -2 1425
+            5.1571638323366642e-04</internalNodes>
+          <leafValues>
+            6.1336231231689453e-01 4.0285378694534302e-01
+            5.5368518829345703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1426 3.9254198782145977e-03 -1 -2 1427
+            -3.3780589699745178e-02</internalNodes>
+          <leafValues>
+            5.2799212932586670e-01 2.3346750438213348e-01
+            5.1759117841720581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1428 -3.7853721529245377e-02 -1 -2 1429
+            -4.0752900531515479e-04</internalNodes>
+          <leafValues>
+            1.0748530179262161e-01 5.3459298610687256e-01
+            4.1989380121231079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1430 -3.1193809118121862e-03 -1 -2 1431
+            -1.5714969485998154e-02</internalNodes>
+          <leafValues>
+            3.8558250665664673e-01 3.3351901173591614e-01
+            5.2632021903991699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1432 -7.8525702701881528e-04 -1 -2 1433
+            -2.8750501223839819e-04</internalNodes>
+          <leafValues>
+            5.8603972196578979e-01 5.4377847909927368e-01
+            3.7161049246788025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1434 2.8016859665513039e-02 -1 -2 1435
+            -1.9018839811906219e-03</internalNodes>
+          <leafValues>
+            3.3307549357414246e-01 5.3665977716445923e-01
+            4.6937939524650574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1436 2.0647559314966202e-02 -1 -2 1437
+            4.3002571910619736e-03</internalNodes>
+          <leafValues>
+            1.0069560259580612e-01 4.8160359263420105e-01
+            6.2156772613525391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1438 1.3459140434861183e-02 -1 -2 1439
+            -1.0320040397346020e-02</internalNodes>
+          <leafValues>
+            5.4619538784027100e-01 4.5784530043601990e-01
+            5.4193097352981567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1440 3.1990748643875122e-01 -1 -2 1441
+            9.2198798665776849e-04</internalNodes>
+          <leafValues>
+            2.0080469548702240e-01 5.1932811737060547e-01
+            3.9121940732002258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1442 4.1852539288811386e-04 -1 -2 1443
+            3.5891108564101160e-04</internalNodes>
+          <leafValues>
+            4.2997440695762634e-01 4.3445029854774475e-01
+            5.5319738388061523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1444 -2.0992439985275269e-01 -1 -2 1445
+            -4.9328152090311050e-03</internalNodes>
+          <leafValues>
+            1.0757210105657578e-01 5.7627969980239868e-01
+            4.5746439695358276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1446 2.3409130517393351e-03 -1 -2 1447
+            4.7120270319283009e-03</internalNodes>
+          <leafValues>
+            7.4768078327178955e-01 5.2617651224136353e-01
+            4.5055508613586426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1448 2.8713190928101540e-02 -1 -2 1449
+            -2.6156550738960505e-03</internalNodes>
+          <leafValues>
+            4.4071030616760254e-01 4.2442709207534790e-01
+            6.8929767608642578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1450 -1.3558969832956791e-02 -1 -2 1451
+            -3.0331799644045532e-04</internalNodes>
+          <leafValues>
+            1.2522679567337036e-01 4.0777918696403503e-01
+            5.4428178071975708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1452 -5.5601762142032385e-04 -1 -2 1453
+            2.4025330785661936e-03</internalNodes>
+          <leafValues>
+            5.3780037164688110e-01 3.1665799021720886e-01
+            5.2857381105422974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1454 -3.4089901018887758e-03 -1 -2 1455
+            8.0019602319225669e-04</internalNodes>
+          <leafValues>
+            4.9052149057388306e-01 4.5227360725402832e-01
+            5.5806142091751099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1456 2.1901070140302181e-03 -1 -2 1457
+            3.3745369873940945e-03</internalNodes>
+          <leafValues>
+            6.6126817464828491e-01 5.1077651977539062e-01
+            3.3869299292564392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1458 8.0019602319225669e-04 -1 -2 1459
+            1.7346069216728210e-02</internalNodes>
+          <leafValues>
+            5.7075601816177368e-01 5.0160211324691772e-01
+            6.3064599037170410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1460 -1.9568449351936579e-03 -1 -2 1461
+            -1.1229019612073898e-02</internalNodes>
+          <leafValues>
+            3.0178061127662659e-01 6.2938511371612549e-01
+            4.5204889774322510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1462 -2.6608388870954514e-03 -1 -2 1463
+            -1.1615100316703320e-02</internalNodes>
+          <leafValues>
+            3.3440071344375610e-01 2.8253790736198425e-01
+            5.1509708166122437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1464 -9.5248602330684662e-02 -1 -2 1465
+            7.3701781220734119e-03</internalNodes>
+          <leafValues>
+            1.3982650637626648e-01 5.2939987182617188e-01
+            2.3317280411720276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1466 -1.4953900128602982e-02 -1 -2 1467
+            5.7038792874664068e-04</internalNodes>
+          <leafValues>
+            4.9404659867286682e-01 5.4665708541870117e-01
+            4.6267679333686829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1468 5.8516198769211769e-03 -1 -2 1469
+            2.1150549582671374e-04</internalNodes>
+          <leafValues>
+            6.2700408697128296e-01 5.5081409215927124e-01
+            4.0618729591369629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1470 -6.9679190346505493e-06 -1 -2 1471
+            -7.9677387839183211e-04</internalNodes>
+          <leafValues>
+            4.0965679287910461e-01 5.6155568361282349e-01
+            4.6668860316276550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1472 1.9459480419754982e-02 -1 -2 1473
+            -1.1160830035805702e-02</internalNodes>
+          <leafValues>
+            2.3114809393882751e-01 3.0870118737220764e-01
+            5.5146622657775879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1474 1.4056149870157242e-02 -1 -2 1475
+            -3.2958350493572652e-04</internalNodes>
+          <leafValues>
+            7.0050561428070068e-01 5.7974857091903687e-01
+            4.6916508674621582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1476 -5.4636420682072639e-03 -1 -2 1477
+            5.8881669247057289e-05</internalNodes>
+          <leafValues>
+            5.9285950660705566e-01 3.7413978576660156e-01
+            5.1701688766479492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1478 6.6343429498374462e-03 -1 -2 1479
+            4.5263409614562988e-02</internalNodes>
+          <leafValues>
+            5.4149878025054932e-01 5.1803272962570190e-01
+            1.5296840667724609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1480 -8.0646127462387085e-03 -1 -2 1481
+            4.7389548853971064e-04</internalNodes>
+          <leafValues>
+            2.5154680013656616e-01 5.1219987869262695e-01
+            3.7259489297866821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1482 1.4877359717502259e-05 -1 -2 1483
+            2.4321159347891808e-02</internalNodes>
+          <leafValues>
+            5.5324357748031616e-01 4.9607661366462708e-01
+            5.9833151102066040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1484 6.9931396865285933e-05 -1 -2 1485
+            2.6287760119885206e-03</internalNodes>
+          <leafValues>
+            4.1639530658721924e-01 5.8801448345184326e-01
+            3.3996629714965820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1486 3.8190539926290512e-03 -1 -2 1487
+            -2.5989150628447533e-02</internalNodes>
+          <leafValues>
+            7.8466212749481201e-01 3.2881140708923340e-01
+            5.1550877094268799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1488 1.2062400346621871e-03 -1 -2 1489
+            -1.5557400183752179e-03</internalNodes>
+          <leafValues>
+            4.5960599184036255e-01 3.1269869208335876e-01
+            7.1833992004394531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1490 -2.2691930644214153e-03 -1 -2 1491
+            2.3287249496206641e-04</internalNodes>
+          <leafValues>
+            5.2740061283111572e-01 4.8786661028862000e-01
+            5.6151527166366577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1492 -5.5999699980020523e-03 -1 -2 1493
+            -1.0496189817786217e-02</internalNodes>
+          <leafValues>
+            5.1608121395111084e-01 5.7016140222549438e-01
+            3.2048508524894714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1494 -1.4814930182183161e-05 -1 -2 1495
+            -6.4287078566849232e-04</internalNodes>
+          <leafValues>
+            5.5388379096984863e-01 5.3494292497634888e-01
+            4.4721511006355286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1496 -1.8891949730459601e-04 -1 -2 1497
+            -9.0413521975278854e-03</internalNodes>
+          <leafValues>
+            5.0128370523452759e-01 2.5629359483718872e-01
+            4.5033830404281616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1498 7.9534705728292465e-03 -1 -2 1499
+            -2.7908999472856522e-03</internalNodes>
+          <leafValues>
+            2.6304998993873596e-01 5.7565087080001831e-01
+            4.8548638820648193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1500 3.2857100013643503e-03 -1 -2 1501
+            7.7063008211553097e-04</internalNodes>
+          <leafValues>
+            4.0847519040107727e-01 4.0733560919761658e-01
+            5.9202408790588379e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>97</maxWeakCount>
+      <stageThreshold>4.7763450622558594e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1502 6.3021942973136902e-02 -1 -2 1503
+            -2.8374609537422657e-03</internalNodes>
+          <leafValues>
+            3.4193828701972961e-01 6.8295639753341675e-01
+            4.4045230746269226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1504 4.6461950987577438e-02 -1 -2 1505
+            2.9152540490031242e-02</internalNodes>
+          <leafValues>
+            4.3917450308799744e-01 4.6010631322860718e-01
+            6.3579368591308594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1506 -1.4000290320836939e-05 -1 -2 1507
+            -1.2757079675793648e-03</internalNodes>
+          <leafValues>
+            3.7300100922584534e-01 3.0938240885734558e-01
+            5.9013700485229492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1508 1.3596529606729746e-03 -1 -2 1509
+            1.7991929780691862e-04</internalNodes>
+          <leafValues>
+            4.3375650048255920e-01 4.2175039649009705e-01
+            5.8468478918075562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1510 -1.4166639630275313e-05 -1 -2 1511
+            6.0252390539972112e-05</internalNodes>
+          <leafValues>
+            4.0846911072731018e-01 5.0872868299484253e-01
+            7.2771841287612915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1512 6.4320368692278862e-03 -1 -2 1513
+            4.6682319953106344e-04</internalNodes>
+          <leafValues>
+            2.9679030179977417e-01 4.1104629635810852e-01
+            5.5812197923660278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1514 5.7436279021203518e-03 -1 -2 1515
+            3.2019240316003561e-03</internalNodes>
+          <leafValues>
+            4.2873099446296692e-01 4.2661958932876587e-01
+            6.4440459012985229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1516 -5.7637941790744662e-04 -1 -2 1517
+            -3.7901920732110739e-03</internalNodes>
+          <leafValues>
+            4.0848249197006226e-01 3.1819209456443787e-01
+            5.2306932210922241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1518 4.8914109356701374e-03 -1 -2 1519
+            4.6459292061626911e-03</internalNodes>
+          <leafValues>
+            3.5483568906784058e-01 5.6105977296829224e-01
+            2.6938489079475403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1520 -6.8799369037151337e-03 -1 -2 1521
+            -1.8147470429539680e-02</internalNodes>
+          <leafValues>
+            6.2354081869125366e-01 2.8619819879531860e-01
+            5.2268481254577637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1522 1.1409220314817503e-04 -1 -2 1523
+            -5.4334272863343358e-04</internalNodes>
+          <leafValues>
+            3.2578331232070923e-01 3.8829690217971802e-01
+            5.3411662578582764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1524 -2.7602489572018385e-03 -1 -2 1525
+            -1.9730569329112768e-03</internalNodes>
+          <leafValues>
+            6.3539659976959229e-01 5.8807611465454102e-01
+            4.5930901169776917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1526 2.4565239436924458e-03 -1 -2 1527
+            1.9392010290175676e-04</internalNodes>
+          <leafValues>
+            3.1340101361274719e-01 5.2771317958831787e-01
+            3.6041069030761719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1528 7.8643016517162323e-02 -1 -2 1529
+            6.5276869572699070e-03</internalNodes>
+          <leafValues>
+            5.2903419733047485e-01 4.6544799208641052e-01
+            6.0449051856994629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1530 -7.8716799616813660e-02 -1 -2 1531
+            5.7298499159514904e-03</internalNodes>
+          <leafValues>
+            2.5411269068717957e-01 4.3669191002845764e-01
+            5.8228862285614014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1532 6.2386557692661881e-04 -1 -2 1533
+            -8.5267230868339539e-02</internalNodes>
+          <leafValues>
+            5.4726922512054443e-01 1.4616079628467560e-01
+            5.1818108558654785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1534 4.0981110185384750e-02 -1 -2 1535
+            7.7135749161243439e-03</internalNodes>
+          <leafValues>
+            1.2701350450515747e-01 4.8326849937438965e-01
+            2.2235789895057678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1536 -6.8663940764963627e-03 -1 -2 1537
+            1.4559639617800713e-02</internalNodes>
+          <leafValues>
+            5.9189289808273315e-01 4.7615069150924683e-01
+            5.7272237539291382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1538 -1.0064310394227505e-02 -1 -2 1539
+            3.6274080630391836e-03</internalNodes>
+          <leafValues>
+            3.6367309093475342e-01 5.2717310190200806e-01
+            2.7405250072479248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1540 -2.3421540390700102e-03 -1 -2 1541
+            -2.4686409160494804e-02</internalNodes>
+          <leafValues>
+            5.4977840185165405e-01 6.0598951578140259e-01
+            4.9603140354156494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1542 1.9456120207905769e-04 -1 -2 1543
+            3.1714211218059063e-04</internalNodes>
+          <leafValues>
+            3.7694650888442993e-01 4.0623620152473450e-01
+            5.6682151556015015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1544 2.0793990697711706e-03 -1 -2 1545
+            1.7982709687203169e-03</internalNodes>
+          <leafValues>
+            4.6186569333076477e-01 4.8675051331520081e-01
+            6.5184497833251953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1546 -2.2287059982772917e-04 -1 -2 1547
+            3.2623921288177371e-04</internalNodes>
+          <leafValues>
+            5.6775957345962524e-01 3.7107339501380920e-01
+            5.6766051054000854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1548 -6.6792681813240051e-02 -1 -2 1549
+            -1.4869889710098505e-03</internalNodes>
+          <leafValues>
+            2.5115218758583069e-01 3.8867509365081787e-01
+            5.2622538805007935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1550 -5.0454870797693729e-03 -1 -2 1551
+            -4.8297587782144547e-03</internalNodes>
+          <leafValues>
+            6.5574729442596436e-01 5.9341061115264893e-01
+            4.2859220504760742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1552 -1.0722599690780044e-03 -1 -2 1553
+            8.7901195511221886e-03</internalNodes>
+          <leafValues>
+            5.4260587692260742e-01 5.3513032197952271e-01
+            4.8342779278755188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1554 -7.1750381030142307e-03 -1 -2 1555
+            1.1251230025663972e-03</internalNodes>
+          <leafValues>
+            2.0671689510345459e-01 5.1122522354125977e-01
+            3.4687140583992004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1556 1.0634710080921650e-02 -1 -2 1557
+            -1.1763219721615314e-02</internalNodes>
+          <leafValues>
+            4.4790080189704895e-01 6.2539017200469971e-01
+            4.9689871072769165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1558 9.2324063181877136e-02 -1 -2 1559
+            1.8991080578416586e-03</internalNodes>
+          <leafValues>
+            2.0313039422035217e-01 5.6187218427658081e-01
+            4.0465721487998962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1560 -1.0510340332984924e-02 -1 -2 1561
+            -7.4531312566250563e-04</internalNodes>
+          <leafValues>
+            4.9432641267776489e-01 5.6134277582168579e-01
+            3.8453319668769836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1562 8.0041000619530678e-03 -1 -2 1563
+            5.8110528625547886e-03</internalNodes>
+          <leafValues>
+            7.7598422765731812e-01 4.6247330307960510e-01
+            6.2862771749496460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1564 -2.7918580919504166e-02 -1 -2 1565
+            2.1739399526268244e-03</internalNodes>
+          <leafValues>
+            2.4093140661716461e-01 5.3455048799514771e-01
+            3.5079580545425415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1566 -4.0639587678015232e-03 -1 -2 1567
+            6.0017139185220003e-04</internalNodes>
+          <leafValues>
+            6.6471010446548462e-01 4.9985098838806152e-01
+            3.0221650004386902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1568 1.9214770291000605e-03 -1 -2 1569
+            -1.3860830105841160e-02</internalNodes>
+          <leafValues>
+            5.9191507101058960e-01 6.3517677783966064e-01
+            4.9933108687400818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1570 2.3006850853562355e-02 -1 -2 1571
+            -1.3857929734513164e-03</internalNodes>
+          <leafValues>
+            1.9023360311985016e-01 5.2533692121505737e-01
+            3.9858600497245789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1572 1.2637410545721650e-03 -1 -2 1573
+            -1.4675210230052471e-02</internalNodes>
+          <leafValues>
+            4.6661040186882019e-01 3.8231649994850159e-01
+            5.3266328573226929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1574 -2.9535070061683655e-03 -1 -2 1575
+            -1.7189770005643368e-03</internalNodes>
+          <leafValues>
+            7.0636558532714844e-01 3.8134628534317017e-01
+            5.2467352151870728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1576 -4.2484089499339461e-04 -1 -2 1577
+            -8.5248658433556557e-04</internalNodes>
+          <leafValues>
+            4.7916388511657715e-01 4.4912180304527283e-01
+            5.3709012269973755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1578 8.9034568518400192e-03 -1 -2 1579
+            1.4895649655954912e-05</internalNodes>
+          <leafValues>
+            2.0764739811420441e-01 4.4476351141929626e-01
+            5.6671631336212158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1580 -4.7091601300053298e-04 -1 -2 1581
+            4.3084810022264719e-04</internalNodes>
+          <leafValues>
+            5.4650712013244629e-01 5.4932618141174316e-01
+            4.5807081460952759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1582 -6.3893961487337947e-04 -1 -2 1583
+            -7.3733746830839664e-05</internalNodes>
+          <leafValues>
+            5.5015718936920166e-01 5.0857907533645630e-01
+            3.3056980371475220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1584 -8.8991485536098480e-03 -1 -2 1585
+            -1.0253350250422955e-02</internalNodes>
+          <leafValues>
+            4.2764690518379211e-01 1.1232180148363113e-01
+            5.1527231931686401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1586 -5.9637490659952164e-02 -1 -2 1587
+            2.1707199513912201e-02</internalNodes>
+          <leafValues>
+            7.3867720365524292e-01 4.9962919950485229e-01
+            1.3394139707088470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1588 9.9107045680284500e-03 -1 -2 1589
+            -1.0998300276696682e-02</internalNodes>
+          <leafValues>
+            4.6790120005607605e-01 6.9286561012268066e-01
+            5.0120681524276733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1590 7.4608891736716032e-04 -1 -2 1591
+            2.9539171373471618e-04</internalNodes>
+          <leafValues>
+            5.8335822820663452e-01 3.8263911008834839e-01
+            5.5663508176803589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1592 5.0054129213094711e-02 -1 -2 1593
+            -7.2330660186707973e-03</internalNodes>
+          <leafValues>
+            3.0027210712432861e-01 5.9080427885055542e-01
+            5.0008708238601685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1594 -2.6863380335271358e-03 -1 -2 1595
+            -1.0195849463343620e-03</internalNodes>
+          <leafValues>
+            3.9750349521636963e-01 3.6976858973503113e-01
+            5.7561928033828735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1596 -2.0204920321702957e-02 -1 -2 1597
+            2.1340379025787115e-03</internalNodes>
+          <leafValues>
+            6.3752681016921997e-01 5.3632658720016479e-01
+            4.4331708550453186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1598 -1.8348889425396919e-03 -1 -2 1599
+            -5.9489468112587929e-03</internalNodes>
+          <leafValues>
+            5.8289992809295654e-01 2.6806709170341492e-01
+            4.6428859233856201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1600 -2.3030120064504445e-04 -1 -2 1601
+            5.0581009127199650e-03</internalNodes>
+          <leafValues>
+            5.4753202199935913e-01 5.3208339214324951e-01
+            4.6464928984642029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1602 -5.1950011402368546e-04 -1 -2 1603
+            -6.8620947422459722e-04</internalNodes>
+          <leafValues>
+            5.2327448129653931e-01 4.9350860714912415e-01
+            3.1031179428100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1604 -7.4936267919838428e-03 -1 -2 1605
+            -1.5682930126786232e-02</internalNodes>
+          <leafValues>
+            2.8830468654632568e-01 3.6403131484985352e-01
+            5.3687548637390137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1606 -3.2649750355631113e-03 -1 -2 1607
+            3.8463930832222104e-04</internalNodes>
+          <leafValues>
+            6.4686310291290283e-01 5.2596598863601685e-01
+            3.8314279913902283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1608 4.4492390006780624e-03 -1 -2 1609
+            2.3118320852518082e-02</internalNodes>
+          <leafValues>
+            2.0868189632892609e-01 4.9785330891609192e-01
+            5.9612572193145752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1610 2.0835159812122583e-03 -1 -2 1611
+            1.1513150529935956e-03</internalNodes>
+          <leafValues>
+            5.7464218139648438e-01 3.5868450999259949e-01
+            5.3634738922119141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1612 3.6104708909988403e-02 -1 -2 1613
+            3.6256198654882610e-04</internalNodes>
+          <leafValues>
+            2.8331369161605835e-01 5.4777222871780396e-01
+            4.1105321049690247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1614 -3.4635469783097506e-03 -1 -2 1615
+            -2.8796829283237457e-03</internalNodes>
+          <leafValues>
+            5.9903860092163086e-01 5.7252532243728638e-01
+            4.1495120525360107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1616 -8.1119500100612640e-03 -1 -2 1617
+            4.5932079665362835e-03</internalNodes>
+          <leafValues>
+            5.3963518142700195e-01 5.3797042369842529e-01
+            3.8913029432296753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1618 7.0014740340411663e-03 -1 -2 1619
+            8.0169539432972670e-04</internalNodes>
+          <leafValues>
+            3.7146711349487305e-01 5.5295670032501221e-01
+            3.7558048963546753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1620 -8.6652329191565514e-03 -1 -2 1621
+            -2.7315050829201937e-03</internalNodes>
+          <leafValues>
+            5.0257730484008789e-01 5.8503222465515137e-01
+            4.6175739169120789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1622 1.3301590224727988e-03 -1 -2 1623
+            -4.2648240923881531e-03</internalNodes>
+          <leafValues>
+            5.9377008676528931e-01 5.6453680992126465e-01
+            3.9376249909400940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1624 6.3251499086618423e-03 -1 -2 1625
+            -3.0753740575164557e-03</internalNodes>
+          <leafValues>
+            5.1821058988571167e-01 3.0074161291122437e-01
+            5.1964038610458374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1626 -7.3622138006612659e-04 -1 -2 1627
+            3.0082479497650638e-05</internalNodes>
+          <leafValues>
+            3.6975800991058350e-01 4.3275931477546692e-01
+            5.7158088684082031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1628 -3.8722730241715908e-03 -1 -2 1629
+            6.2879058532416821e-04</internalNodes>
+          <leafValues>
+            3.4737130999565125e-01 5.4382592439651489e-01
+            4.4539061188697815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1630 1.3411579420790076e-03 -1 -2 1631
+            -8.3681922405958176e-03</internalNodes>
+          <leafValues>
+            6.5117138624191284e-01 1.4432950317859650e-01
+            4.8881998658180237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1632 9.3305751215666533e-04 -1 -2 1633
+            -1.0746510233730078e-03</internalNodes>
+          <leafValues>
+            3.9511090517044067e-01 3.9102658629417419e-01
+            5.3495037555694580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1634 -1.8610050901770592e-02 -1 -2 1635
+            1.3651419430971146e-03</internalNodes>
+          <leafValues>
+            1.2757439911365509e-01 5.0382888317108154e-01
+            6.9513040781021118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1636 7.3744421824812889e-03 -1 -2 1637
+            8.4163323044776917e-03</internalNodes>
+          <leafValues>
+            5.2534431219100952e-01 5.0112438201904297e-01
+            7.3113328218460083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1638 5.1413988694548607e-03 -1 -2 1639
+            4.5847031287848949e-03</internalNodes>
+          <leafValues>
+            4.9535360932350159e-01 2.5355559587478638e-01
+            6.4624428749084473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1640 2.8565239161252975e-02 -1 -2 1641
+            4.3958800961263478e-04</internalNodes>
+          <leafValues>
+            2.3307220637798309e-01 4.7022441029548645e-01
+            5.5445492267608643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1642 3.1459458172321320e-02 -1 -2 1643
+            5.6011630222201347e-03</internalNodes>
+          <leafValues>
+            3.3689688891172409e-02 4.7871211171150208e-01
+            6.3383519649505615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1644 7.1835669223219156e-04 -1 -2 1645
+            -5.5303089320659637e-03</internalNodes>
+          <leafValues>
+            5.4314869642257690e-01 4.1058328747749329e-01
+            5.4039907455444336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1646 1.4129279879853129e-03 -1 -2 1647
+            2.5530709535814822e-04</internalNodes>
+          <leafValues>
+            3.1055399775505066e-01 4.2544719576835632e-01
+            5.4471540451049805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1648 3.1966410460881889e-04 -1 -2 1649
+            5.0411392003297806e-03</internalNodes>
+          <leafValues>
+            6.1183619499206543e-01 5.2900421619415283e-01
+            4.2247870564460754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1650 7.7617880888283253e-03 -1 -2 1651
+            2.9374631121754646e-03</internalNodes>
+          <leafValues>
+            4.3153458833694458e-01 6.6292631626129150e-01
+            3.0289649963378906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1652 -1.6497720498591661e-03 -1 -2 1653
+            -5.8834417723119259e-03</internalNodes>
+          <leafValues>
+            5.4918527603149414e-01 3.1885540485382080e-01
+            5.1842892169952393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1654 8.7459187489002943e-04 -1 -2 1655
+            -1.5308779664337635e-02</internalNodes>
+          <leafValues>
+            3.3288308978080750e-01 3.9236080646514893e-01
+            5.2351391315460205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1656 3.2292451709508896e-02 -1 -2 1657
+            -4.3842519517056644e-04</internalNodes>
+          <leafValues>
+            5.9776467084884644e-01 4.5416879653930664e-01
+            5.3694289922714233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1658 1.5429529594257474e-03 -1 -2 1659
+            -2.4733028840273619e-03</internalNodes>
+          <leafValues>
+            6.3181412220001221e-01 3.4906330704689026e-01
+            4.7590249776840210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1660 2.0994939841330051e-03 -1 -2 1661
+            -5.7541108690202236e-03</internalNodes>
+          <leafValues>
+            5.8871978521347046e-01 5.9613317251205444e-01
+            4.8419830203056335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1662 -1.0233130306005478e-02 -1 -2 1663
+            2.2554509341716766e-01</internalNodes>
+          <leafValues>
+            1.7054040729999542e-01 4.7793799638748169e-01
+            9.7879663109779358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1664 2.9666559770703316e-02 -1 -2 1665
+            -2.8518449980765581e-03</internalNodes>
+          <leafValues>
+            5.8222240209579468e-01 5.4596269130706787e-01
+            4.6100661158561707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1666 9.7465328872203827e-04 -1 -2 1667
+            1.4044740055396687e-05</internalNodes>
+          <leafValues>
+            3.6703228950500488e-01 4.3023860454559326e-01
+            5.6917107105255127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1668 -1.7579430714249611e-02 -1 -2 1669
+            -5.2381679415702820e-02</internalNodes>
+          <leafValues>
+            6.9173210859298706e-01 7.1100401878356934e-01
+            5.0601547956466675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1670 -1.1242110282182693e-02 -1 -2 1671
+            -3.6728400737047195e-03</internalNodes>
+          <leafValues>
+            8.7691891193389893e-01 6.5191918611526489e-01
+            4.5460689067840576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1672 3.5082760732620955e-03 -1 -2 1673
+            6.1679710634052753e-03</internalNodes>
+          <leafValues>
+            5.3298658132553101e-01 5.2204591035842896e-01
+            2.9535189270973206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1674 -9.7009900491684675e-04 -1 -2 1675
+            -1.0957010090351105e-02</internalNodes>
+          <leafValues>
+            5.0486332178115845e-01 5.8373582363128662e-01
+            3.0200859904289246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1676 -8.3272513002157211e-03 -1 -2 1677
+            2.9798380637657829e-05</internalNodes>
+          <leafValues>
+            3.1580638885498047e-01 4.3863898515701294e-01
+            5.4432111978530884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1678 2.8244039276614785e-04 -1 -2 1679
+            -8.1364117795601487e-04</internalNodes>
+          <leafValues>
+            5.6253957748413086e-01 5.2811980247497559e-01
+            3.4014078974723816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1680 1.8008040497079492e-03 -1 -2 1681
+            -6.9944779388606548e-03</internalNodes>
+          <leafValues>
+            3.4716591238975525e-01 4.4816970825195312e-01
+            5.3857702016830444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1682 4.5625398342963308e-05 -1 -2 1683
+            -7.3189922841265798e-04</internalNodes>
+          <leafValues>
+            4.4925129413604736e-01 4.1673120856285095e-01
+            6.0211020708084106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1684 -2.9980219551362097e-04 -1 -2 1685
+            -2.9060940505587496e-05</internalNodes>
+          <leafValues>
+            4.1484281420707703e-01 5.5920898914337158e-01
+            4.0732109546661377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1686 -5.9742690064013004e-04 -1 -2 1687
+            1.4831830048933625e-04</internalNodes>
+          <leafValues>
+            6.0889142751693726e-01 5.2983051538467407e-01
+            3.7619501352310181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1688 -2.9441029764711857e-03 -1 -2 1689
+            1.3741210103034973e-01</internalNodes>
+          <leafValues>
+            4.7160848975181580e-01 5.1013368368148804e-01
+            4.6746801584959030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1690 -8.8414177298545837e-02 -1 -2 1691
+            7.0610277354717255e-02</internalNodes>
+          <leafValues>
+            1.1818689852952957e-01 5.1190632581710815e-01
+            7.7784419059753418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1692 -7.7188978902995586e-03 -1 -2 1693
+            1.5115399844944477e-02</internalNodes>
+          <leafValues>
+            1.8741349875926971e-01 4.9800279736518860e-01
+            7.0058178901672363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1694 1.0671879863366485e-03 -1 -2 1695
+            7.0487911580130458e-04</internalNodes>
+          <leafValues>
+            4.4822388887405396e-01 6.2657529115676880e-01
+            4.4026550650596619e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>90</maxWeakCount>
+      <stageThreshold>4.4251281738281250e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 1696 -9.8690733313560486e-02 -1 -2 1697
+            6.2373418360948563e-02</internalNodes>
+          <leafValues>
+            3.9994749426841736e-01 5.2477848529815674e-01
+            8.1935757398605347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1698 1.9496519817039371e-03 -1 -2 1699
+            -8.9139147894456983e-04</internalNodes>
+          <leafValues>
+            3.5298168659210205e-01 5.8527278900146484e-01
+            3.2459780573844910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1700 -5.5150408297777176e-04 -1 -2 1701
+            -1.1721949558705091e-03</internalNodes>
+          <leafValues>
+            3.8928169012069702e-01 4.3350520730018616e-01
+            6.5206241607666016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1702 -7.4480642797425389e-04 -1 -2 1703
+            -2.6264840271323919e-03</internalNodes>
+          <leafValues>
+            4.0411350131034851e-01 5.6249821186065674e-01
+            3.9675250649452209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1704 -3.9712688885629177e-04 -1 -2 1705
+            3.5984949208796024e-03</internalNodes>
+          <leafValues>
+            3.8561120629310608e-01 5.9978890419006348e-01
+            4.2416140437126160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1706 5.3080618381500244e-03 -1 -2 1707
+            9.6319877775385976e-04</internalNodes>
+          <leafValues>
+            6.6601687669754028e-01 4.4813790917396545e-01
+            5.5834877490997314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1708 5.0776469288393855e-04 -1 -2 1709
+            3.6223160568624735e-03</internalNodes>
+          <leafValues>
+            3.5354590415954590e-01 3.4098070859909058e-01
+            5.4206877946853638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1710 -6.2061410397291183e-02 -1 -2 1711
+            6.4387189922854304e-04</internalNodes>
+          <leafValues>
+            1.9340839982032776e-01 4.0836268663406372e-01
+            5.4902219772338867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1712 2.6239909231662750e-02 -1 -2 1713
+            8.1940297968685627e-04</internalNodes>
+          <leafValues>
+            2.2857080399990082e-01 4.6486678719520569e-01
+            6.0173559188842773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1714 2.3833119485061616e-04 -1 -2 1715
+            -1.5869759954512119e-03</internalNodes>
+          <leafValues>
+            3.5980388522148132e-01 4.2596510052680969e-01
+            5.4764348268508911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1716 -6.7263417877256870e-03 -1 -2 1717
+            1.1006110347807407e-02</internalNodes>
+          <leafValues>
+            6.5072381496429443e-01 5.1494097709655762e-01
+            3.3629849553108215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1718 7.1445819921791553e-03 -1 -2 1719
+            -4.7233798541128635e-03</internalNodes>
+          <leafValues>
+            2.6729300618171692e-01 5.6521821022033691e-01
+            4.2981448769569397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1720 9.8437406122684479e-03 -1 -2 1721
+            1.5124640412977897e-05</internalNodes>
+          <leafValues>
+            1.1518859863281250e-01 4.3735980987548828e-01
+            5.6121289730072021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1722 3.9908871054649353e-02 -1 -2 1723
+            5.3903679363429546e-03</internalNodes>
+          <leafValues>
+            5.2046489715576172e-01 4.8134678602218628e-01
+            6.3612091541290283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1724 -3.9908871054649353e-02 -1 -2 1725
+            5.3903679363429546e-03</internalNodes>
+          <leafValues>
+            1.5068709850311279e-01 4.5816949009895325e-01
+            6.2002408504486084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1726 6.7005190066993237e-03 -1 -2 1727
+            -1.2623789720237255e-02</internalNodes>
+          <leafValues>
+            3.4322351217269897e-01 3.0882269144058228e-01
+            5.2267378568649292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1728 1.1806610040366650e-02 -1 -2 1729
+            -3.4257229417562485e-03</internalNodes>
+          <leafValues>
+            7.1879392862319946e-01 3.1208148598670959e-01
+            5.0658440589904785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1730 3.9385299896821380e-04 -1 -2 1731
+            3.4388188272714615e-02</internalNodes>
+          <leafValues>
+            4.7545841336250305e-01 5.2616578340530396e-01
+            3.3501741290092468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1732 -7.5009986758232117e-02 -1 -2 1733
+            4.9022492021322250e-04</internalNodes>
+          <leafValues>
+            1.7134809494018555e-01 4.7258019447326660e-01
+            5.9564691781997681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1734 -8.5525289177894592e-03 -1 -2 1735
+            1.3135520566720515e-04</internalNodes>
+          <leafValues>
+            6.5582227706909180e-01 4.8354008793830872e-01
+            5.5869138240814209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1736 4.7948658466339111e-03 -1 -2 1737
+            2.0124691072851419e-03</internalNodes>
+          <leafValues>
+            2.6457059383392334e-01 3.6579450964927673e-01
+            5.1247721910476685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1738 -1.1785479635000229e-01 -1 -2 1739
+            1.5575019642710686e-03</internalNodes>
+          <leafValues>
+            2.3856540024280548e-01 5.4904741048812866e-01
+            4.2747479677200317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1740 -1.5573759563267231e-02 -1 -2 1741
+            -2.1854790393263102e-03</internalNodes>
+          <leafValues>
+            6.9389009475708008e-01 3.6459881067276001e-01
+            5.0925260782241821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1742 2.9272339306771755e-03 -1 -2 1743
+            6.4663668163120747e-03</internalNodes>
+          <leafValues>
+            4.6858081221580505e-01 4.9734100699424744e-01
+            7.7260971069335938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1744 -7.6140360906720161e-03 -1 -2 1745
+            4.1512572206556797e-03</internalNodes>
+          <leafValues>
+            6.8774658441543579e-01 4.7885251045227051e-01
+            6.9216579198837280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1746 2.7711640577763319e-03 -1 -2 1747
+            -1.2836109846830368e-02</internalNodes>
+          <leafValues>
+            5.4818397760391235e-01 3.8001629710197449e-01
+            5.2044928073883057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1748 -2.4380050599575043e-03 -1 -2 1749
+            2.1713329479098320e-03</internalNodes>
+          <leafValues>
+            2.5824350118637085e-01 4.9611631035804749e-01
+            3.2152029871940613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1750 6.2800728483125567e-04 -1 -2 1751
+            -9.7982389852404594e-03</internalNodes>
+          <leafValues>
+            5.4604238271713257e-01 6.0465437173843384e-01
+            4.9399220943450928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1752 7.3543828912079334e-03 -1 -2 1753
+            -1.4665040187537670e-02</internalNodes>
+          <leafValues>
+            5.2910941839218140e-01 5.4461228847503662e-01
+            3.5673621296882629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1754 3.0244510620832443e-02 -1 -2 1755
+            -5.6660208851099014e-02</internalNodes>
+          <leafValues>
+            5.5183291435241699e-01 6.9309788942337036e-01
+            5.0933879613876343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1756 -5.6967479176819324e-03 -1 -2 1757
+            3.0806770548224449e-02</internalNodes>
+          <leafValues>
+            3.2015261054039001e-01 4.9892461299896240e-01
+            2.2770540416240692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1758 2.2748769260942936e-03 -1 -2 1759
+            2.0436900667846203e-03</internalNodes>
+          <leafValues>
+            4.8109310865402222e-01 5.2838671207427979e-01
+            3.2559248805046082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1760 -8.6277956143021584e-03 -1 -2 1761
+            6.5113382879644632e-04</internalNodes>
+          <leafValues>
+            6.2665361166000366e-01 5.0971370935440063e-01
+            3.1919100880622864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1762 8.8188261725008488e-04 -1 -2 1763
+            -1.4594909735023975e-02</internalNodes>
+          <leafValues>
+            4.5495858788490295e-01 2.6450389623641968e-01
+            5.1538681983947754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1764 -1.2304580304771662e-03 -1 -2 1765
+            -2.1867299801670015e-04</internalNodes>
+          <leafValues>
+            6.1975848674774170e-01 5.4691988229751587e-01
+            4.2068558931350708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1766 -1.0909959673881531e-03 -1 -2 1767
+            3.5210378700867295e-04</internalNodes>
+          <leafValues>
+            4.1407600045204163e-01 5.4766088724136353e-01
+            4.1550210118293762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1768 -7.2563779540359974e-03 -1 -2 1769
+            1.4701850013807416e-03</internalNodes>
+          <leafValues>
+            7.1604692935943604e-01 5.2408081293106079e-01
+            3.7296628952026367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1770 1.1472719779703766e-04 -1 -2 1771
+            3.0506469774991274e-03</internalNodes>
+          <leafValues>
+            4.0337988734245300e-01 5.2639859914779663e-01
+            3.5600930452346802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1772 2.6269949739798903e-04 -1 -2 1773
+            -3.6365550477057695e-03</internalNodes>
+          <leafValues>
+            4.5697999000549316e-01 3.0425709486007690e-01
+            5.8682537078857422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1774 -8.4893293678760529e-03 -1 -2 1775
+            5.8107408694922924e-03</internalNodes>
+          <leafValues>
+            4.9141570925712585e-01 4.9185299873352051e-01
+            6.2669628858566284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1776 7.5583951547741890e-04 -1 -2 1777
+            -2.2017690353095531e-03</internalNodes>
+          <leafValues>
+            5.6332361698150635e-01 5.5539160966873169e-01
+            3.8276460766792297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1778 2.7908938936889172e-03 -1 -2 1779
+            -1.8228569533675909e-03</internalNodes>
+          <leafValues>
+            5.4986977577209473e-01 4.3822830915451050e-01
+            5.4240328073501587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1780 -7.2495508939027786e-03 -1 -2 1781
+            -6.8744522286579013e-04</internalNodes>
+          <leafValues>
+            2.8881219029426575e-01 3.4726551175117493e-01
+            5.0763708353042603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1782 2.5174440816044807e-03 -1 -2 1783
+            -1.0151379741728306e-02</internalNodes>
+          <leafValues>
+            4.6612051129341125e-01 3.7447750568389893e-01
+            5.2940011024475098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1784 -4.1399952024221420e-03 -1 -2 1785
+            -4.7078551724553108e-03</internalNodes>
+          <leafValues>
+            4.6604850888252258e-01 4.1750618815422058e-01
+            6.9163060188293457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1786 4.1981041431427002e-02 -1 -2 1787
+            -1.4272999949753284e-02</internalNodes>
+          <leafValues>
+            2.0182150602340698e-01 7.5111979246139526e-01
+            5.0320839881896973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1788 4.0869521908462048e-03 -1 -2 1789
+            1.7606799956411123e-03</internalNodes>
+          <leafValues>
+            2.5045138597488403e-01 3.3014011383056641e-01
+            5.2183371782302856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1790 1.2550549581646919e-04 -1 -2 1791
+            -2.9503209516406059e-03</internalNodes>
+          <leafValues>
+            4.6144428849220276e-01 4.6199500560760498e-01
+            5.2470302581787109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1792 -1.1312420247122645e-03 -1 -2 1793
+            -1.6983180539682508e-03</internalNodes>
+          <leafValues>
+            6.3143682479858398e-01 3.4013068675994873e-01
+            5.0555270910263062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1794 -1.1457820422947407e-02 -1 -2 1795
+            -8.4962565451860428e-03</internalNodes>
+          <leafValues>
+            4.9399960041046143e-01 2.9654508829116821e-01
+            5.1943677663803101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1796 1.1919089592993259e-02 -1 -2 1797
+            6.4416420646011829e-03</internalNodes>
+          <leafValues>
+            7.8869980573654175e-01 5.1069867610931396e-01
+            2.9671460390090942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1798 -8.7857811013236642e-04 -1 -2 1799
+            -2.0312711130827665e-03</internalNodes>
+          <leafValues>
+            5.7143712043762207e-01 4.4812008738517761e-01
+            5.3849118947982788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1800 -1.5262430533766747e-03 -1 -2 1801
+            4.2860880494117737e-03</internalNodes>
+          <leafValues>
+            6.1935687065124512e-01 4.3398851156234741e-01
+            7.6972991228103638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1802 3.5010920837521553e-03 -1 -2 1803
+            1.2587670236825943e-02</internalNodes>
+          <leafValues>
+            3.1713891029357910e-01 5.2466988563537598e-01
+            4.2412081360816956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1804 2.6207490009255707e-04 -1 -2 1805
+            4.4701730075757951e-05</internalNodes>
+          <leafValues>
+            4.2318999767303467e-01 4.1741389036178589e-01
+            5.9196037054061890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1806 7.8084698179736733e-04 -1 -2 1807
+            8.8851212058216333e-04</internalNodes>
+          <leafValues>
+            4.2773890495300293e-01 3.7201610207557678e-01
+            5.2268189191818237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1808 2.3369069676846266e-03 -1 -2 1809
+            1.6688359901309013e-03</internalNodes>
+          <leafValues>
+            5.4780668020248413e-01 3.6286789178848267e-01
+            6.1500048637390137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1810 3.0844469438306987e-04 -1 -2 1811
+            3.4617560449987650e-03</internalNodes>
+          <leafValues>
+            4.7470751404762268e-01 4.5801380276679993e-01
+            5.5856817960739136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1812 1.8961310386657715e-02 -1 -2 1813
+            1.7347310483455658e-01</internalNodes>
+          <leafValues>
+            5.2988010644912720e-01 3.6983850598335266e-01
+            8.4986197948455811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1814 2.0020549709443003e-04 -1 -2 1815
+            1.0967060225084424e-03</internalNodes>
+          <leafValues>
+            5.5656617879867554e-01 4.7957131266593933e-01
+            6.2862598896026611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1816 1.5107099898159504e-04 -1 -2 1817
+            -3.4463501069694757e-03</internalNodes>
+          <leafValues>
+            4.0524059534072876e-01 6.1730152368545532e-01
+            4.4142639636993408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1818 8.5176620632410049e-03 -1 -2 1819
+            -3.5812109708786011e-02</internalNodes>
+          <leafValues>
+            3.5705709457397461e-01 3.1513288617134094e-01
+            5.2527028322219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1820 -2.1155400201678276e-02 -1 -2 1821
+            8.9890940580517054e-04</internalNodes>
+          <leafValues>
+            6.1247211694717407e-01 5.1699757575988770e-01
+            3.5962718725204468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1822 -1.5613760333508253e-03 -1 -2 1823
+            6.7120860330760479e-04</internalNodes>
+          <leafValues>
+            4.9149879813194275e-01 4.5462110638618469e-01
+            5.3958117961883545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1824 -2.1597029641270638e-02 -1 -2 1825
+            -2.4947229772806168e-02</internalNodes>
+          <leafValues>
+            1.9031339883804321e-01 6.9740772247314453e-01
+            4.9677160382270813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1826 1.8725979607552290e-03 -1 -2 1827
+            6.3912719488143921e-03</internalNodes>
+          <leafValues>
+            4.7489479184150696e-01 5.1801782846450806e-01
+            2.9243218898773193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1828 -9.1552399098873138e-03 -1 -2 1829
+            2.1715660113841295e-03</internalNodes>
+          <leafValues>
+            7.6658701896667480e-01 5.2155512571334839e-01
+            3.3657190203666687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1830 1.2330369791015983e-03 -1 -2 1831
+            -4.0785901364870369e-04</internalNodes>
+          <leafValues>
+            6.2609577178955078e-01 4.5335099101066589e-01
+            5.3864890336990356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1832 4.6437609125860035e-04 -1 -2 1833
+            -1.1600199650274590e-04</internalNodes>
+          <leafValues>
+            4.1034960746765137e-01 5.8303910493850708e-01
+            4.3041059374809265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1834 -1.2718720361590385e-02 -1 -2 1835
+            8.9431880041956902e-05</internalNodes>
+          <leafValues>
+            2.1325829625129700e-01 4.8728910088539124e-01
+            5.4589152336120605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1836 -3.3913689549081028e-04 -1 -2 1837
+            -1.8026340752840042e-02</internalNodes>
+          <leafValues>
+            3.9743649959564209e-01 7.5685507059097290e-01
+            5.0456118583679199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1838 6.9179181009531021e-03 -1 -2 1839
+            -1.1839679791592062e-04</internalNodes>
+          <leafValues>
+            3.9662998914718628e-01 4.1980829834938049e-01
+            5.4358041286468506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1840 -3.9474181830883026e-03 -1 -2 1841
+            6.0050919273635373e-05</internalNodes>
+          <leafValues>
+            6.3694578409194946e-01 5.2695667743682861e-01
+            3.8122430443763733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1842 9.1423643752932549e-03 -1 -2 1843
+            2.1305440168362111e-04</internalNodes>
+          <leafValues>
+            4.1567629575729370e-01 3.5235330462455750e-01
+            5.3494542837142944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1844 -2.0855850016232580e-04 -1 -2 1845
+            1.3130389852449298e-03</internalNodes>
+          <leafValues>
+            4.4033220410346985e-01 6.0581612586975098e-01
+            4.4682189822196960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1846 -2.9134768992662430e-03 -1 -2 1847
+            2.9645769391208887e-03</internalNodes>
+          <leafValues>
+            4.8257058858871460e-01 4.8359981179237366e-01
+            6.0392779111862183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1848 1.7772549763321877e-03 -1 -2 1849
+            -7.7136349864304066e-03</internalNodes>
+          <leafValues>
+            6.8718272447586060e-01 2.8422209620475769e-01
+            5.1454281806945801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1850 5.1027478184551001e-04 -1 -2 1851
+            1.7460630042478442e-03</internalNodes>
+          <leafValues>
+            6.0244262218475342e-01 4.7566100955009460e-01
+            5.7211542129516602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1852 3.8068278809078038e-04 -1 -2 1853
+            2.8228890150785446e-03</internalNodes>
+          <leafValues>
+            4.9310690164566040e-01 3.3116981387138367e-01
+            6.2275981903076172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1854 -5.3000478073954582e-03 -1 -2 1855
+            4.4951299059903249e-05</internalNodes>
+          <leafValues>
+            5.2320927381515503e-01 3.9952319860458374e-01
+            5.3147977590560913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1856 3.2752458937466145e-03 -1 -2 1857
+            -2.8162579983472824e-03</internalNodes>
+          <leafValues>
+            4.4816198945045471e-01 3.9079719781875610e-01
+            6.6716408729553223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1858 1.4112279750406742e-03 -1 -2 1859
+            8.3062034100294113e-03</internalNodes>
+          <leafValues>
+            5.3570109605789185e-01 4.7709658741950989e-01
+            5.5700999498367310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1860 2.2164839319884777e-03 -1 -2 1861
+            -4.9868631176650524e-03</internalNodes>
+          <leafValues>
+            4.9471241235733032e-01 5.2413070201873779e-01
+            2.5126549601554871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1862 -3.6664260551333427e-03 -1 -2 1863
+            -1.0581229813396931e-02</internalNodes>
+          <leafValues>
+            4.6195539832115173e-01 6.3017189502716064e-01
+            4.9730318784713745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1864 7.3366491124033928e-03 -1 -2 1865
+            -3.9318940252996981e-04</internalNodes>
+          <leafValues>
+            2.8709700703620911e-01 4.2528051137924194e-01
+            5.5792468786239624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1866 -8.1375334411859512e-03 -1 -2 1867
+            2.4809150490909815e-03</internalNodes>
+          <leafValues>
+            5.7473158836364746e-01 5.2033740282058716e-01
+            3.9035668969154358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1868 8.8749779388308525e-04 -1 -2 1869
+            -4.2194919660687447e-04</internalNodes>
+          <leafValues>
+            5.5343210697174072e-01 5.3380441665649414e-01
+            3.9258408546447754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1870 -7.9790111631155014e-03 -1 -2 1871
+            1.1439629597589374e-03</internalNodes>
+          <leafValues>
+            4.1443160176277161e-01 4.7013729810714722e-01
+            5.2817362546920776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1872 7.5542130507528782e-03 -1 -2 1873
+            1.0288399644196033e-03</internalNodes>
+          <leafValues>
+            2.5272560119628906e-01 5.6051462888717651e-01
+            4.2978560924530029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1874 -1.7234670231118798e-03 -1 -2 1875
+            5.7586699724197388e-01</internalNodes>
+          <leafValues>
+            4.8396828770637512e-01 5.1105028390884399e-01
+            8.0489329993724823e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>109</maxWeakCount>
+      <stageThreshold>5.3755569458007812e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 1876 6.6640521399676800e-03 -1 -2 1877
+            8.9905522763729095e-03</internalNodes>
+          <leafValues>
+            3.8289201259613037e-01 4.8584291338920593e-01
+            7.3549592494964600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1878 5.7154200039803982e-03 -1 -2 1879
+            1.1257929727435112e-03</internalNodes>
+          <leafValues>
+            6.7232239246368408e-01 4.4295778870582581e-01
+            6.0707777738571167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1880 -9.1789010912179947e-04 -1 -2 1881
+            -1.0492859873920679e-03</internalNodes>
+          <leafValues>
+            3.0763450264930725e-01 5.5936437845230103e-01
+            3.6510229110717773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1882 3.5453929740469903e-05 -1 -2 1883
+            2.9015709878876805e-04</internalNodes>
+          <leafValues>
+            4.2779681086540222e-01 4.5835450291633606e-01
+            5.2846831083297729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1884 1.6071660502348095e-04 -1 -2 1885
+            -5.2961107576265931e-04</internalNodes>
+          <leafValues>
+            3.7981921434402466e-01 3.8504371047019958e-01
+            5.9396880865097046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1886 2.6682569296099246e-04 -1 -2 1887
+            -1.3492540165316314e-04</internalNodes>
+          <leafValues>
+            4.1230249404907227e-01 5.7605999708175659e-01
+            4.2376458644866943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1888 -1.0841679759323597e-02 -1 -2 1889
+            1.2077829800546169e-02</internalNodes>
+          <leafValues>
+            3.9299210906028748e-01 5.7619231939315796e-01
+            2.7804449200630188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1890 2.2128869313746691e-03 -1 -2 1891
+            -1.5266190283000469e-02</internalNodes>
+          <leafValues>
+            4.7945070266723633e-01 7.4055880308151245e-02
+            5.1535779237747192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1892 6.7929533543065190e-05 -1 -2 1893
+            1.7633590323384851e-04</internalNodes>
+          <leafValues>
+            5.8587378263473511e-01 3.5676109790802002e-01
+            5.5989629030227661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1894 8.1311381654813886e-04 -1 -2 1895
+            3.2630451023578644e-03</internalNodes>
+          <leafValues>
+            5.3468507528305054e-01 4.7825369238853455e-01
+            5.4567539691925049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1896 -3.9503918960690498e-03 -1 -2 1897
+            -3.9864578866399825e-04</internalNodes>
+          <leafValues>
+            2.8318119049072266e-01 5.4852157831192017e-01
+            4.1596978902816772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1898 -1.1432520113885403e-02 -1 -2 1899
+            5.3339172154664993e-03</internalNodes>
+          <leafValues>
+            5.6391012668609619e-01 4.5969840884208679e-01
+            5.9312427043914795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1900 8.3193257451057434e-03 -1 -2 1901
+            -4.2479918920435011e-04</internalNodes>
+          <leafValues>
+            3.2306200265884399e-01 3.7952938675880432e-01
+            5.4086112976074219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1902 -1.1189430207014084e-01 -1 -2 1903
+            -7.5553781352937222e-03</internalNodes>
+          <leafValues>
+            1.1322979629039764e-01 6.3393700122833252e-01
+            4.8387709259986877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1904 -7.0337029173970222e-03 -1 -2 1905
+            -1.4833680354058743e-02</internalNodes>
+          <leafValues>
+            5.6652551889419556e-01 6.7514181137084961e-01
+            4.1409450769424438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1906 8.7506724521517754e-03 -1 -2 1907
+            1.6645010327920318e-03</internalNodes>
+          <leafValues>
+            3.5612589120864868e-01 5.3472799062728882e-01
+            3.6497798562049866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1908 9.4900820404291153e-03 -1 -2 1909
+            1.1133110383525491e-03</internalNodes>
+          <leafValues>
+            2.7546560764312744e-01 4.2259928584098816e-01
+            5.6291788816452026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1910 9.4940755516290665e-03 -1 -2 1911
+            -1.5396620146930218e-03</internalNodes>
+          <leafValues>
+            4.9060368537902832e-01 4.0070518851280212e-01
+            5.3807091712951660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1912 1.3434959948062897e-01 -1 -2 1913
+            -9.4940755516290665e-03</internalNodes>
+          <leafValues>
+            2.2146719694137573e-01 7.3531562089920044e-01
+            5.0050330162048340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1914 2.0011790096759796e-02 -1 -2 1915
+            -1.8875009845942259e-03</internalNodes>
+          <leafValues>
+            3.3279061317443848e-01 3.9152890443801880e-01
+            5.4018497467041016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1916 7.1842782199382782e-03 -1 -2 1917
+            1.6976969782263041e-03</internalNodes>
+          <leafValues>
+            7.1766048669815063e-01 4.5269781351089478e-01
+            6.0769128799438477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1918 4.9219978973269463e-03 -1 -2 1919
+            1.1803199537098408e-02</internalNodes>
+          <leafValues>
+            2.5698339939117432e-01 4.9996379017829895e-01
+            5.9582281112670898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1920 -9.7703449428081512e-03 -1 -2 1921
+            2.1174899302423000e-03</internalNodes>
+          <leafValues>
+            3.4590938687324524e-01 4.5151269435882568e-01
+            5.8297157287597656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1922 9.4801411032676697e-03 -1 -2 1923
+            -2.6078789960592985e-03</internalNodes>
+          <leafValues>
+            4.8073920607566833e-01 3.4622168540954590e-01
+            5.2015948295593262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1924 -5.7252747938036919e-03 -1 -2 1925
+            -8.2325618714094162e-03</internalNodes>
+          <leafValues>
+            6.5998530387878418e-01 2.8218281269073486e-01
+            5.1252847909927368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1926 8.9571950957179070e-04 -1 -2 1927
+            -1.5021569561213255e-04</internalNodes>
+          <leafValues>
+            4.8838189244270325e-01 4.8299181461334229e-01
+            5.4287171363830566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1928 4.8489659093320370e-04 -1 -2 1929
+            -9.6192650496959686e-02</internalNodes>
+          <leafValues>
+            4.4345989823341370e-01 2.2566360235214233e-01
+            5.9562277793884277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1930 -1.1053519556298852e-03 -1 -2 1931
+            -1.0215040296316147e-01</internalNodes>
+          <leafValues>
+            4.5272240042686462e-01 2.8443491458892822e-01
+            5.1864528656005859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1932 3.0147889629006386e-03 -1 -2 1933
+            7.6131648384034634e-03</internalNodes>
+          <leafValues>
+            3.8089990615844727e-01 5.7186990976333618e-01
+            4.2625638842582703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1934 1.5197630273178220e-03 -1 -2 1935
+            -1.4197279699146748e-02</internalNodes>
+          <leafValues>
+            5.9427189826965332e-01 7.7311038970947266e-01
+            4.9976539611816406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1936 -1.3818879611790180e-02 -1 -2 1937
+            -5.0701329018920660e-04</internalNodes>
+          <leafValues>
+            6.6811382770538330e-01 3.3056080341339111e-01
+            4.7499749064445496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1938 -9.3537531793117523e-03 -1 -2 1939
+            -9.4771059229969978e-03</internalNodes>
+          <leafValues>
+            2.8609329462051392e-01 6.1888831853866577e-01
+            4.8421001434326172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1940 1.6923650400713086e-03 -1 -2 1941
+            5.8652542065829039e-04</internalNodes>
+          <leafValues>
+            6.0702490806579590e-01 3.7826898694038391e-01
+            5.3681969642639160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1942 -2.5826620403677225e-03 -1 -2 1943
+            -2.7307639829814434e-03</internalNodes>
+          <leafValues>
+            3.6902099847793579e-01 3.8571149110794067e-01
+            5.3181087970733643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1944 2.1871570497751236e-02 -1 -2 1945
+            -1.5010299648565706e-05</internalNodes>
+          <leafValues>
+            2.3270089924335480e-01 5.5607229471206665e-01
+            4.3014100193977356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1946 5.3583700209856033e-03 -1 -2 1947
+            5.0057549960911274e-03</internalNodes>
+          <leafValues>
+            6.7676377296447754e-01 5.1949042081832886e-01
+            3.6128538846969604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1948 -1.9030070398002863e-03 -1 -2 1949
+            -7.8506693243980408e-03</internalNodes>
+          <leafValues>
+            3.2378450036048889e-01 1.1948519945144653e-01
+            4.9917238950729370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1950 -2.7093670796602964e-03 -1 -2 1951
+            1.4138079714030027e-03</internalNodes>
+          <leafValues>
+            4.8549601435661316e-01 4.8723229765892029e-01
+            5.9035778045654297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1952 9.0300198644399643e-03 -1 -2 1953
+            -9.7925681620836258e-04</internalNodes>
+          <leafValues>
+            6.5473157167434692e-01 5.8492732048034668e-01
+            4.5542308688163757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1954 1.3984439428895712e-03 -1 -2 1955
+            8.3372107474133372e-04</internalNodes>
+          <leafValues>
+            4.0646260976791382e-01 5.3995430469512939e-01
+            4.1528099775314331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1956 1.0551059618592262e-02 -1 -2 1957
+            8.8344102550763637e-05</internalNodes>
+          <leafValues>
+            1.7966809868812561e-01 4.2518630623817444e-01
+            5.4135227203369141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1958 -4.1022308170795441e-02 -1 -2 1959
+            7.5065628625452518e-03</internalNodes>
+          <leafValues>
+            5.2281248569488525e-01 4.8537430167198181e-01
+            6.0934442281723022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1960 4.1022308170795441e-02 -1 -2 1961
+            -5.3961377125233412e-04</internalNodes>
+          <leafValues>
+            2.2050240635871887e-01 5.6927317380905151e-01
+            4.4687569141387939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1962 -6.8696036934852600e-02 -1 -2 1963
+            -1.8447940237820148e-03</internalNodes>
+          <leafValues>
+            1.4833140373229980e-01 6.2112838029861450e-01
+            4.9666011333465576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1964 -6.0959919355809689e-03 -1 -2 1965
+            -4.2068301700055599e-03</internalNodes>
+          <leafValues>
+            2.2946719825267792e-01 6.4070910215377808e-01
+            4.7485628724098206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1966 -7.1332789957523346e-04 -1 -2 1967
+            1.1756779998540878e-01</internalNodes>
+          <leafValues>
+            5.3549361228942871e-01 5.1369780302047729e-01
+            1.0595739819109440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1968 5.9354289987822995e-05 -1 -2 1969
+            -6.3173691742122173e-03</internalNodes>
+          <leafValues>
+            3.7118038535118103e-01 1.7120739817619324e-01
+            5.0617581605911255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1970 1.4941499568521976e-02 -1 -2 1971
+            -2.0789399277418852e-03</internalNodes>
+          <leafValues>
+            6.7291188240051270e-01 4.4106459617614746e-01
+            5.4440277814865112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1972 -7.0736219640821218e-04 -1 -2 1973
+            -3.1247111037373543e-03</internalNodes>
+          <leafValues>
+            5.5689108371734619e-01 5.0238692760467529e-01
+            3.5624051094055176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1974 -7.8919378574937582e-04 -1 -2 1975
+            1.0179580189287663e-02</internalNodes>
+          <leafValues>
+            5.4567861557006836e-01 5.5451387166976929e-01
+            4.6223109960556030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1976 -2.7506109327077866e-03 -1 -2 1977
+            1.0601329617202282e-02</internalNodes>
+          <leafValues>
+            4.9425360560417175e-01 2.9612338542938232e-01
+            5.9643387794494629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1978 5.1466780714690685e-03 -1 -2 1979
+            7.6321147382259369e-02</internalNodes>
+          <leafValues>
+            5.4952287673950195e-01 5.1739591360092163e-01
+            2.9402169585227966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1980 -1.5027689514681697e-03 -1 -2 1981
+            1.2266670353710651e-02</internalNodes>
+          <leafValues>
+            3.1062999367713928e-01 4.6511501073837280e-01
+            6.8466138839721680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1982 -3.1118579208850861e-02 -1 -2 1983
+            2.8905589133501053e-02</internalNodes>
+          <leafValues>
+            5.2260571718215942e-01 5.1822441816329956e-01
+            2.7054280042648315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1984 4.7598380595445633e-02 -1 -2 1985
+            3.0808549374341965e-02</internalNodes>
+          <leafValues>
+            1.1095120012760162e-01 4.9386250972747803e-01
+            1.4041109383106232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1986 -2.1277810446918011e-04 -1 -2 1987
+            7.8969962894916534e-02</internalNodes>
+          <leafValues>
+            4.3923568725585938e-01 5.2165520191192627e-01
+            2.2941139340400696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1988 -1.0257950052618980e-02 -1 -2 1989
+            1.2604889925569296e-03</internalNodes>
+          <leafValues>
+            6.1766529083251953e-01 5.2362227439880371e-01
+            3.3289659023284912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1990 -3.3490460366010666e-02 -1 -2 1991
+            -5.9202767442911863e-04</internalNodes>
+          <leafValues>
+            4.8661869764328003e-01 4.1164070367813110e-01
+            5.3956401348114014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1992 3.0320750738610514e-05 -1 -2 1993
+            -5.4369680583477020e-04</internalNodes>
+          <leafValues>
+            5.6107360124588013e-01 5.6213891506195068e-01
+            3.4612038731575012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1994 -3.3490460366010666e-02 -1 -2 1995
+            -5.9202767442911863e-04</internalNodes>
+          <leafValues>
+            4.8967620730400085e-01 4.3054041266441345e-01
+            5.3407138586044312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 1996 2.0550889894366264e-03 -1 -2 1997
+            -4.4353571720421314e-03</internalNodes>
+          <leafValues>
+            5.5449998378753662e-01 6.0385400056838989e-01
+            3.7465929985046387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 1998 -8.4170423448085785e-02 -1 -2 1999
+            6.7419027909636497e-03</internalNodes>
+          <leafValues>
+            5.0073480606079102e-01 5.2980971336364746e-01
+            4.7161450982093811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2000 1.0278150439262390e-02 -1 -2 2001
+            5.8800862170755863e-03</internalNodes>
+          <leafValues>
+            6.2693750858306885e-01 5.1548278331756592e-01
+            3.8130408525466919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2002 -6.9679190346505493e-06 -1 -2 2003
+            8.2419527461752295e-04</internalNodes>
+          <leafValues>
+            4.4402399659156799e-01 4.6975341439247131e-01
+            5.4855042695999146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2004 -5.5268318392336369e-03 -1 -2 2005
+            9.6128671430051327e-04</internalNodes>
+          <leafValues>
+            5.5136048793792725e-01 3.6186391115188599e-01
+            5.8384567499160767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2006 2.4810510221868753e-03 -1 -2 2007
+            -1.0480589699000120e-03</internalNodes>
+          <leafValues>
+            2.5232228636741638e-01 4.1172578930854797e-01
+            5.3929960727691650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2008 -6.1287907883524895e-03 -1 -2 2009
+            1.1682329932227731e-04</internalNodes>
+          <leafValues>
+            6.7263299226760864e-01 5.0411927700042725e-01
+            3.6077290773391724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2010 -3.9909478276968002e-02 -1 -2 2011
+            1.5859459526836872e-03</internalNodes>
+          <leafValues>
+            1.5637390315532684e-01 4.8919808864593506e-01
+            5.7798451185226440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2012 -2.2690229117870331e-02 -1 -2 2013
+            2.0916070789098740e-03</internalNodes>
+          <leafValues>
+            2.1868790686130524e-01 4.7715771198272705e-01
+            6.0992312431335449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2014 -2.4715419858694077e-02 -1 -2 2015
+            -1.3419450260698795e-02</internalNodes>
+          <leafValues>
+            3.4639969468116760e-01 3.6306929588317871e-01
+            5.2521961927413940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2016 -6.0629472136497498e-03 -1 -2 2017
+            -2.0921030081808567e-03</internalNodes>
+          <leafValues>
+            6.6663217544555664e-01 3.3995470404624939e-01
+            5.0356978178024292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2018 2.5961859151721001e-02 -1 -2 2019
+            1.7908669542521238e-04</internalNodes>
+          <leafValues>
+            5.0368028879165649e-01 5.4185307025909424e-01
+            4.3189769983291626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2020 -3.1546850223094225e-03 -1 -2 2021
+            -1.1397759662941098e-03</internalNodes>
+          <leafValues>
+            7.2210252285003662e-01 3.3209729194641113e-01
+            5.0244337320327759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2022 -4.7840211540460587e-02 -1 -2 2023
+            4.1577088995836675e-04</internalNodes>
+          <leafValues>
+            1.9387650489807129e-01 4.8021888732910156e-01
+            5.7307147979736328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2024 -4.4247039477340877e-04 -1 -2 2025
+            1.4479350065812469e-03</internalNodes>
+          <leafValues>
+            4.2625150084495544e-01 5.7191711664199829e-01
+            4.0641531348228455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2026 1.5701510012149811e-02 -1 -2 2027
+            2.7805729769170284e-04</internalNodes>
+          <leafValues>
+            4.9957260489463806e-01 5.2892869710922241e-01
+            4.5817288756370544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2028 -2.9010509606450796e-03 -1 -2 2029
+            2.0830519497394562e-04</internalNodes>
+          <leafValues>
+            6.0121482610702515e-01 5.0579768419265747e-01
+            3.5994321107864380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2030 -5.1530029624700546e-02 -1 -2 2031
+            1.7163449956569821e-04</internalNodes>
+          <leafValues>
+            4.9917969107627869e-01 4.6754699945449829e-01
+            5.3747731447219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2032 2.3614279925823212e-02 -1 -2 2033
+            -5.6427798699587584e-04</internalNodes>
+          <leafValues>
+            6.5864789485931396e-01 3.8532960414886475e-01
+            5.1960402727127075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2034 6.6903959959745407e-03 -1 -2 2035
+            -4.8789530992507935e-03</internalNodes>
+          <leafValues>
+            6.0042357444763184e-01 3.2932278513908386e-01
+            5.2452367544174194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2036 -6.8537332117557526e-03 -1 -2 2037
+            9.9893810693174601e-04</internalNodes>
+          <leafValues>
+            2.5659140944480896e-01 4.6154940128326416e-01
+            5.9424322843551636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2038 -1.3354700058698654e-04 -1 -2 2039
+            1.0165109997615218e-03</internalNodes>
+          <leafValues>
+            5.4873758554458618e-01 4.5783591270446777e-01
+            5.4269278049468994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2040 9.1216771397739649e-04 -1 -2 2041
+            1.0080259526148438e-03</internalNodes>
+          <leafValues>
+            3.9394611120223999e-01 4.0497899055480957e-01
+            5.5207037925720215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2042 -1.3102490629535168e-04 -1 -2 2043
+            5.5228749988600612e-04</internalNodes>
+          <leafValues>
+            4.8790889978408813e-01 4.8449438810348511e-01
+            5.5128258466720581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2044 -1.2130969844292849e-04 -1 -2 2045
+            -1.5112989785848185e-05</internalNodes>
+          <leafValues>
+            4.3679711222648621e-01 6.4259552955627441e-01
+            4.8818269371986389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2046 -4.0125829400494695e-04 -1 -2 2047
+            -6.5766851184889674e-04</internalNodes>
+          <leafValues>
+            5.3720992803573608e-01 5.8345532417297363e-01
+            4.8690780997276306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2048 6.2220421386882663e-04 -1 -2 2049
+            1.4663359615951777e-03</internalNodes>
+          <leafValues>
+            3.8246369361877441e-01 4.8134881258010864e-01
+            6.9667392969131470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2050 -4.9547709524631500e-02 -1 -2 2051
+            1.3017569435760379e-03</internalNodes>
+          <leafValues>
+            5.3927659988403320e-02 5.3374558687210083e-01
+            4.1607481241226196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2052 -4.4914530590176582e-03 -1 -2 2053
+            1.6592369647696614e-03</internalNodes>
+          <leafValues>
+            5.9974372386932373e-01 3.7271851301193237e-01
+            5.1156342029571533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2054 6.4695458859205246e-03 -1 -2 2055
+            4.9810269847512245e-03</internalNodes>
+          <leafValues>
+            5.2520352602005005e-01 5.2567178010940552e-01
+            3.9344060420989990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2056 -3.8536980748176575e-02 -1 -2 2057
+            -2.8275650739669800e-01</internalNodes>
+          <leafValues>
+            2.0619249343872070e-01 6.1883211135864258e-02
+            4.9250578880310059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2058 -9.0301828458905220e-03 -1 -2 2059
+            -4.3866269290447235e-02</internalNodes>
+          <leafValues>
+            3.1575900316238403e-01 2.0336820185184479e-01
+            5.1647698879241943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2060 -4.5701069757342339e-03 -1 -2 2061
+            -2.3362410720437765e-03</internalNodes>
+          <leafValues>
+            6.6111832857131958e-01 2.8077891469001770e-01
+            4.9628761410713196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2062 5.3960331715643406e-03 -1 -2 2063
+            -2.6297608856111765e-03</internalNodes>
+          <leafValues>
+            5.1463878154754639e-01 6.2844878435134888e-01
+            4.9555888772010803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2064 -3.8577478844672441e-03 -1 -2 2065
+            1.3963800156489015e-03</internalNodes>
+          <leafValues>
+            1.4867480099201202e-01 4.7013381123542786e-01
+            6.3209718465805054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2066 -8.8699469342827797e-03 -1 -2 2067
+            -7.0626288652420044e-04</internalNodes>
+          <leafValues>
+            5.2868181467056274e-01 4.6483701467514038e-01
+            5.3332102298736572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2068 4.2645810171961784e-03 -1 -2 2069
+            6.1572100967168808e-02</internalNodes>
+          <leafValues>
+            5.0848782062530518e-01 3.6296251416206360e-01
+            8.7571567296981812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2070 -4.5381980016827583e-03 -1 -2 2071
+            -4.0877899155020714e-03</internalNodes>
+          <leafValues>
+            4.8566961288452148e-01 4.5841160416603088e-01
+            5.4202407598495483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2072 6.4308601431548595e-03 -1 -2 2073
+            7.0455260574817657e-03</internalNodes>
+          <leafValues>
+            2.7073028683662415e-01 5.0574868917465210e-01
+            7.0265239477157593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2074 -2.3246440105140209e-03 -1 -2 2075
+            6.0276601288933307e-05</internalNodes>
+          <leafValues>
+            4.8272788524627686e-01 4.2472490668296814e-01
+            5.5087631940841675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2076 1.8084559589624405e-02 -1 -2 2077
+            8.4693520329892635e-04</internalNodes>
+          <leafValues>
+            8.1048011779785156e-01 5.1546192169189453e-01
+            3.5143798589706421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2078 -2.6931039988994598e-02 -1 -2 2079
+            -4.2346641421318054e-03</internalNodes>
+          <leafValues>
+            4.8868888616561890e-01 4.6223780512809753e-01
+            5.3824782371520996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2080 2.6947110891342163e-02 -1 -2 2081
+            4.6446882188320160e-03</internalNodes>
+          <leafValues>
+            6.3665962219238281e-01 5.3685069084167480e-01
+            3.7654298543930054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2082 -6.9577661342918873e-03 -1 -2 2083
+            8.7609712500125170e-04</internalNodes>
+          <leafValues>
+            4.2346870899200439e-01 4.6724060177803040e-01
+            5.3506839275360107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2084 1.6103329835459590e-03 -1 -2 2085
+            -1.2848590267822146e-03</internalNodes>
+          <leafValues>
+            5.7327628135681152e-01 5.4817992448806763e-01
+            3.7845930457115173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2086 1.0243539698421955e-02 -1 -2 2087
+            2.6889349101111293e-04</internalNodes>
+          <leafValues>
+            5.1559072732925415e-01 5.3531897068023682e-01
+            4.3871539831161499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2088 3.7903659977018833e-03 -1 -2 2089
+            -2.9369680210947990e-02</internalNodes>
+          <leafValues>
+            5.0320029258728027e-01 5.8735388517379761e-01
+            2.2154450416564941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 2090 6.0743088833987713e-03 -1 -2 2091
+            -1.2710720300674438e-02</internalNodes>
+          <leafValues>
+            5.4170298576354980e-01 6.0565119981765747e-01
+            4.9851819872856140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2092 -5.9445449151098728e-03 -1 -2 2093
+            -2.8927479870617390e-03</internalNodes>
+          <leafValues>
+            3.3520698547363281e-01 6.9292408227920532e-01
+            4.7782200574874878e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          2 7 16 4 -1.</_>
+        <_>
+          2 9 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 14 -1.</_>
+        <_>
+          8 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 1 6 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 8 -1.</_>
+        <_>
+          8 2 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 9 -1.</_>
+        <_>
+          6 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 9 -1.</_>
+        <_>
+          3 10 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 4 -1.</_>
+        <_>
+          4 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 16 -1.</_>
+        <_>
+          9 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 5 -1.</_>
+        <_>
+          7 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 8 -1.</_>
+        <_>
+          4 9 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 9 -1.</_>
+        <_>
+          1 10 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 4 -1.</_>
+        <_>
+          2 2 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          9 5 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 9 -1.</_>
+        <_>
+          6 6 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          8 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 2 -1.</_>
+        <_>
+          3 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          14 1 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 6 -1.</_>
+        <_>
+          8 4 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 15 -1.</_>
+        <_>
+          3 2 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 6 -1.</_>
+        <_>
+          5 6 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 3 -1.</_>
+        <_>
+          13 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 4 -1.</_>
+        <_>
+          12 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 3 -1.</_>
+        <_>
+          1 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 5 8 -1.</_>
+        <_>
+          2 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 12 -1.</_>
+        <_>
+          2 8 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          8 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 9 -1.</_>
+        <_>
+          13 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 9 -1.</_>
+        <_>
+          5 10 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 8 -1.</_>
+        <_>
+          9 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 12 -1.</_>
+        <_>
+          14 0 2 6 2.</_>
+        <_>
+          12 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 2 -1.</_>
+        <_>
+          5 9 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 4 -1.</_>
+        <_>
+          7 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 9 12 -1.</_>
+        <_>
+          3 3 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 12 -1.</_>
+        <_>
+          9 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 15 -1.</_>
+        <_>
+          0 10 20 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 8 -1.</_>
+        <_>
+          2 2 3 4 2.</_>
+        <_>
+          5 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 2 -1.</_>
+        <_>
+          2 2 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 4 -1.</_>
+        <_>
+          13 15 3 2 2.</_>
+        <_>
+          10 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 6 -1.</_>
+        <_>
+          12 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 4 -1.</_>
+        <_>
+          5 15 2 2 2.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 1 2 -1.</_>
+        <_>
+          7 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          10 5 6 5 2.</_>
+        <_>
+          4 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 12 -1.</_>
+        <_>
+          11 4 4 6 2.</_>
+        <_>
+          7 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 12 -1.</_>
+        <_>
+          3 3 6 6 2.</_>
+        <_>
+          9 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 3 -1.</_>
+        <_>
+          15 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 3 -1.</_>
+        <_>
+          0 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 2 -1.</_>
+        <_>
+          2 9 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 12 -1.</_>
+        <_>
+          9 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          6 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 8 -1.</_>
+        <_>
+          10 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 10 -1.</_>
+        <_>
+          12 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 9 -1.</_>
+        <_>
+          4 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 4 -1.</_>
+        <_>
+          9 4 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 3 -1.</_>
+        <_>
+          12 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 6 -1.</_>
+        <_>
+          15 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 8 -1.</_>
+        <_>
+          2 12 5 4 2.</_>
+        <_>
+          7 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          5 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 3 -1.</_>
+        <_>
+          12 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 6 -1.</_>
+        <_>
+          15 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 3 -1.</_>
+        <_>
+          4 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 4 -1.</_>
+        <_>
+          2 3 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 2 -1.</_>
+        <_>
+          11 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 1 -1.</_>
+        <_>
+          11 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 4 -1.</_>
+        <_>
+          7 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 6 -1.</_>
+        <_>
+          4 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 1 14 -1.</_>
+        <_>
+          10 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 6 -1.</_>
+        <_>
+          5 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 3 -1.</_>
+        <_>
+          7 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 5 -1.</_>
+        <_>
+          7 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 5 -1.</_>
+        <_>
+          9 15 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 6 -1.</_>
+        <_>
+          9 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 7 -1.</_>
+        <_>
+          10 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 9 -1.</_>
+        <_>
+          16 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 7 -1.</_>
+        <_>
+          9 6 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 8 -1.</_>
+        <_>
+          0 5 9 4 2.</_>
+        <_>
+          9 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 10 -1.</_>
+        <_>
+          13 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 6 -1.</_>
+        <_>
+          12 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 5 -1.</_>
+        <_>
+          8 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 14 -1.</_>
+        <_>
+          13 3 3 7 2.</_>
+        <_>
+          10 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 8 -1.</_>
+        <_>
+          13 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 14 -1.</_>
+        <_>
+          4 3 3 7 2.</_>
+        <_>
+          7 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 8 -1.</_>
+        <_>
+          6 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 1 6 -1.</_>
+        <_>
+          8 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 2 -1.</_>
+        <_>
+          2 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 8 -1.</_>
+        <_>
+          10 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 2 -1.</_>
+        <_>
+          8 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 2 2 -1.</_>
+        <_>
+          9 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 9 -1.</_>
+        <_>
+          4 6 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 5 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 5 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 12 -1.</_>
+        <_>
+          4 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 18 -1.</_>
+        <_>
+          13 0 3 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 1 12 -1.</_>
+        <_>
+          10 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 6 -1.</_>
+        <_>
+          3 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 2 6 -1.</_>
+        <_>
+          2 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          7 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 6 1 -1.</_>
+        <_>
+          9 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 1 -1.</_>
+        <_>
+          9 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 2 -1.</_>
+        <_>
+          2 2 8 1 2.</_>
+        <_>
+          10 3 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 5 3 -1.</_>
+        <_>
+          8 12 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 15 -1.</_>
+        <_>
+          2 1 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 3 -1.</_>
+        <_>
+          2 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 1 3 -1.</_>
+        <_>
+          16 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 6 -1.</_>
+        <_>
+          7 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 1 14 -1.</_>
+        <_>
+          7 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 3 -1.</_>
+        <_>
+          15 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 14 -1.</_>
+        <_>
+          10 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 6 -1.</_>
+        <_>
+          6 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 8 -1.</_>
+        <_>
+          6 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 1 -1.</_>
+        <_>
+          13 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 10 -1.</_>
+        <_>
+          15 1 3 5 2.</_>
+        <_>
+          12 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 3 -1.</_>
+        <_>
+          3 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 2 1 -1.</_>
+        <_>
+          10 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 17 9 -1.</_>
+        <_>
+          1 3 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 2 4 4 2.</_>
+        <_>
+          5 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 7 10 -1.</_>
+        <_>
+          10 14 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 4 -1.</_>
+        <_>
+          8 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 10 -1.</_>
+        <_>
+          6 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 12 -1.</_>
+        <_>
+          8 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 10 6 -1.</_>
+        <_>
+          3 13 5 3 2.</_>
+        <_>
+          8 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 11 -1.</_>
+        <_>
+          15 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 10 -1.</_>
+        <_>
+          10 7 5 5 2.</_>
+        <_>
+          5 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 11 -1.</_>
+        <_>
+          3 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 12 -1.</_>
+        <_>
+          1 11 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 7 4 -1.</_>
+        <_>
+          11 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 12 -1.</_>
+        <_>
+          0 4 10 6 2.</_>
+        <_>
+          10 10 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 15 -1.</_>
+        <_>
+          1 10 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 8 -1.</_>
+        <_>
+          11 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          10 14 7 2 2.</_>
+        <_>
+          3 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 4 -1.</_>
+        <_>
+          18 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          3 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 6 -1.</_>
+        <_>
+          0 6 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 3 -1.</_>
+        <_>
+          9 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 4 -1.</_>
+        <_>
+          15 7 5 2 2.</_>
+        <_>
+          10 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 8 -1.</_>
+        <_>
+          7 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 2 -1.</_>
+        <_>
+          8 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 5 -1.</_>
+        <_>
+          11 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 19 -1.</_>
+        <_>
+          11 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 1 2 -1.</_>
+        <_>
+          3 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 5 3 -1.</_>
+        <_>
+          7 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 4 -1.</_>
+        <_>
+          11 1 9 2 2.</_>
+        <_>
+          2 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 8 -1.</_>
+        <_>
+          11 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          0 1 9 2 2.</_>
+        <_>
+          9 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 8 -1.</_>
+        <_>
+          8 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 5 2 -1.</_>
+        <_>
+          10 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 1 -1.</_>
+        <_>
+          7 10 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 2 6 -1.</_>
+        <_>
+          2 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 3 -1.</_>
+        <_>
+          9 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 10 -1.</_>
+        <_>
+          9 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 2 -1.</_>
+        <_>
+          0 8 4 1 2.</_>
+        <_>
+          4 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          5 9 5 4 2.</_>
+        <_>
+          10 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 4 -1.</_>
+        <_>
+          9 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 4 -1.</_>
+        <_>
+          10 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 1 -1.</_>
+        <_>
+          9 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 14 -1.</_>
+        <_>
+          14 0 2 7 2.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 9 -1.</_>
+        <_>
+          12 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 16 -1.</_>
+        <_>
+          3 2 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 2 -1.</_>
+        <_>
+          1 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 1 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 9 -1.</_>
+        <_>
+          8 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 6 -1.</_>
+        <_>
+          12 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 16 -1.</_>
+        <_>
+          12 1 4 8 2.</_>
+        <_>
+          8 9 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 6 -1.</_>
+        <_>
+          4 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 2 -1.</_>
+        <_>
+          4 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 12 -1.</_>
+        <_>
+          9 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 7 10 -1.</_>
+        <_>
+          10 14 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 7 10 -1.</_>
+        <_>
+          3 14 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 1 14 -1.</_>
+        <_>
+          7 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 6 -1.</_>
+        <_>
+          13 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 6 -1.</_>
+        <_>
+          14 14 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 6 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 6 -1.</_>
+        <_>
+          3 14 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 5 3 -1.</_>
+        <_>
+          8 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 8 -1.</_>
+        <_>
+          5 1 5 4 2.</_>
+        <_>
+          10 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 5 4 -1.</_>
+        <_>
+          6 6 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 1 -1.</_>
+        <_>
+          7 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 3 -1.</_>
+        <_>
+          11 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 3 -1.</_>
+        <_>
+          3 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 3 4 -1.</_>
+        <_>
+          12 14 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 5 6 -1.</_>
+        <_>
+          11 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 2 -1.</_>
+        <_>
+          0 9 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 4 -1.</_>
+        <_>
+          2 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 6 -1.</_>
+        <_>
+          9 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 6 -1.</_>
+        <_>
+          7 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 5 -1.</_>
+        <_>
+          12 5 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          5 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 5 -1.</_>
+        <_>
+          6 5 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 10 -1.</_>
+        <_>
+          9 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 16 2 -1.</_>
+        <_>
+          11 1 8 1 2.</_>
+        <_>
+          3 2 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 2 -1.</_>
+        <_>
+          9 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 2 -1.</_>
+        <_>
+          1 1 8 1 2.</_>
+        <_>
+          9 2 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          10 5 6 5 2.</_>
+        <_>
+          4 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          10 13 3 3 2.</_>
+        <_>
+          7 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 2 -1.</_>
+        <_>
+          8 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 4 -1.</_>
+        <_>
+          9 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 3 -1.</_>
+        <_>
+          6 7 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 1 -1.</_>
+        <_>
+          12 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 6 -1.</_>
+        <_>
+          6 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 6 -1.</_>
+        <_>
+          6 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 6 -1.</_>
+        <_>
+          11 15 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 12 -1.</_>
+        <_>
+          10 4 6 6 2.</_>
+        <_>
+          4 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 6 -1.</_>
+        <_>
+          2 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 3 7 -1.</_>
+        <_>
+          2 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 4 -1.</_>
+        <_>
+          10 13 6 2 2.</_>
+        <_>
+          4 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 17 12 -1.</_>
+        <_>
+          3 9 17 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 12 -1.</_>
+        <_>
+          3 3 7 6 2.</_>
+        <_>
+          10 9 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 9 -1.</_>
+        <_>
+          2 14 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 6 -1.</_>
+        <_>
+          9 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 6 -1.</_>
+        <_>
+          10 14 2 3 2.</_>
+        <_>
+          8 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 1 -1.</_>
+        <_>
+          8 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 5 -1.</_>
+        <_>
+          10 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 5 -1.</_>
+        <_>
+          10 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 1 -1.</_>
+        <_>
+          9 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 5 -1.</_>
+        <_>
+          9 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 3 -1.</_>
+        <_>
+          8 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          0 6 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 6 -1.</_>
+        <_>
+          1 3 4 3 2.</_>
+        <_>
+          5 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 4 -1.</_>
+        <_>
+          7 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 10 -1.</_>
+        <_>
+          3 15 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 4 -1.</_>
+        <_>
+          8 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 10 -1.</_>
+        <_>
+          0 9 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 4 -1.</_>
+        <_>
+          2 2 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 8 -1.</_>
+        <_>
+          4 12 3 4 2.</_>
+        <_>
+          7 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 7 -1.</_>
+        <_>
+          3 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 4 -1.</_>
+        <_>
+          15 7 5 2 2.</_>
+        <_>
+          10 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 1 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 4 -1.</_>
+        <_>
+          9 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 6 -1.</_>
+        <_>
+          10 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 4 -1.</_>
+        <_>
+          15 7 3 2 2.</_>
+        <_>
+          12 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 6 -1.</_>
+        <_>
+          9 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 6 -1.</_>
+        <_>
+          1 6 9 3 2.</_>
+        <_>
+          10 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 3 -1.</_>
+        <_>
+          10 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 5 2 -1.</_>
+        <_>
+          10 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 3 -1.</_>
+        <_>
+          9 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 5 2 -1.</_>
+        <_>
+          5 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 8 -1.</_>
+        <_>
+          12 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          5 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          4 5 6 5 2.</_>
+        <_>
+          10 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 3 -1.</_>
+        <_>
+          9 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 3 -1.</_>
+        <_>
+          8 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 9 -1.</_>
+        <_>
+          1 13 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          13 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 3 -1.</_>
+        <_>
+          6 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 12 -1.</_>
+        <_>
+          5 10 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 4 -1.</_>
+        <_>
+          10 11 9 2 2.</_>
+        <_>
+          1 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 2 -1.</_>
+        <_>
+          7 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 6 -1.</_>
+        <_>
+          7 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 4 -1.</_>
+        <_>
+          0 11 9 2 2.</_>
+        <_>
+          9 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 2 -1.</_>
+        <_>
+          7 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 4 2 -1.</_>
+        <_>
+          13 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 2 -1.</_>
+        <_>
+          4 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          6 9 4 4 2.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 2 -1.</_>
+        <_>
+          1 12 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 8 -1.</_>
+        <_>
+          11 5 9 4 2.</_>
+        <_>
+          2 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 6 -1.</_>
+        <_>
+          0 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 3 -1.</_>
+        <_>
+          4 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 6 -1.</_>
+        <_>
+          19 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 2 -1.</_>
+        <_>
+          6 16 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 6 -1.</_>
+        <_>
+          0 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 3 -1.</_>
+        <_>
+          5 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 3 -1.</_>
+        <_>
+          12 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 2 6 -1.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 8 -1.</_>
+        <_>
+          9 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 3 -1.</_>
+        <_>
+          12 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 15 5 -1.</_>
+        <_>
+          10 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 2 2 -1.</_>
+        <_>
+          2 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 2 -1.</_>
+        <_>
+          6 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 1 -1.</_>
+        <_>
+          10 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 12 -1.</_>
+        <_>
+          7 0 6 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 15 5 -1.</_>
+        <_>
+          5 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 1 -1.</_>
+        <_>
+          10 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 6 -1.</_>
+        <_>
+          11 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 1 -1.</_>
+        <_>
+          8 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 6 -1.</_>
+        <_>
+          6 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 4 -1.</_>
+        <_>
+          10 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 7 -1.</_>
+        <_>
+          6 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 12 -1.</_>
+        <_>
+          10 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 4 -1.</_>
+        <_>
+          11 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 14 -1.</_>
+        <_>
+          7 0 6 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 11 -1.</_>
+        <_>
+          5 8 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 15 4 -1.</_>
+        <_>
+          1 6 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 8 -1.</_>
+        <_>
+          5 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 8 -1.</_>
+        <_>
+          14 2 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 14 -1.</_>
+        <_>
+          14 6 3 7 2.</_>
+        <_>
+          11 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 12 -1.</_>
+        <_>
+          9 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 4 6 -1.</_>
+        <_>
+          3 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 6 -1.</_>
+        <_>
+          14 3 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 4 -1.</_>
+        <_>
+          15 4 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 7 -1.</_>
+        <_>
+          3 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 14 -1.</_>
+        <_>
+          3 6 3 7 2.</_>
+        <_>
+          6 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 8 -1.</_>
+        <_>
+          4 10 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 8 -1.</_>
+        <_>
+          10 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 20 -1.</_>
+        <_>
+          9 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 12 -1.</_>
+        <_>
+          1 7 8 6 2.</_>
+        <_>
+          9 13 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          9 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 5 -1.</_>
+        <_>
+          11 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 1 2 -1.</_>
+        <_>
+          3 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 5 3 -1.</_>
+        <_>
+          7 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          10 12 2 4 2.</_>
+        <_>
+          8 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 12 -1.</_>
+        <_>
+          12 4 5 6 2.</_>
+        <_>
+          7 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 5 -1.</_>
+        <_>
+          7 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 8 2 -1.</_>
+        <_>
+          9 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 5 2 -1.</_>
+        <_>
+          14 16 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 4 -1.</_>
+        <_>
+          1 7 4 2 2.</_>
+        <_>
+          5 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 2 -1.</_>
+        <_>
+          19 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          3 14 7 2 2.</_>
+        <_>
+          10 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 2 -1.</_>
+        <_>
+          5 1 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 6 -1.</_>
+        <_>
+          11 16 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          7 13 3 3 2.</_>
+        <_>
+          10 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 6 -1.</_>
+        <_>
+          0 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 2 -1.</_>
+        <_>
+          6 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 1 -1.</_>
+        <_>
+          9 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 2 -1.</_>
+        <_>
+          0 3 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 4 -1.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 6 -1.</_>
+        <_>
+          11 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 2 -1.</_>
+        <_>
+          7 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 6 -1.</_>
+        <_>
+          2 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 2 -1.</_>
+        <_>
+          9 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 1 2 -1.</_>
+        <_>
+          3 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 11 3 -1.</_>
+        <_>
+          4 6 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 4 -1.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 3 -1.</_>
+        <_>
+          10 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          8 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 3 -1.</_>
+        <_>
+          8 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 3 -1.</_>
+        <_>
+          11 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 8 -1.</_>
+        <_>
+          11 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 5 -1.</_>
+        <_>
+          10 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 1 6 -1.</_>
+        <_>
+          14 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 2 -1.</_>
+        <_>
+          0 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 5 6 -1.</_>
+        <_>
+          4 16 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 3 -1.</_>
+        <_>
+          11 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 3 -1.</_>
+        <_>
+          5 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 2 -1.</_>
+        <_>
+          7 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 3 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 6 -1.</_>
+        <_>
+          1 8 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 8 15 -1.</_>
+        <_>
+          2 9 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 5 -1.</_>
+        <_>
+          8 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 2 -1.</_>
+        <_>
+          7 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 10 -1.</_>
+        <_>
+          10 1 4 5 2.</_>
+        <_>
+          6 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 10 -1.</_>
+        <_>
+          10 0 10 5 2.</_>
+        <_>
+          0 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 1 -1.</_>
+        <_>
+          7 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 8 -1.</_>
+        <_>
+          2 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 4 -1.</_>
+        <_>
+          11 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 8 -1.</_>
+        <_>
+          12 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 4 -1.</_>
+        <_>
+          6 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 8 -1.</_>
+        <_>
+          5 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 6 -1.</_>
+        <_>
+          11 6 9 3 2.</_>
+        <_>
+          2 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 7 3 -1.</_>
+        <_>
+          7 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 12 -1.</_>
+        <_>
+          1 0 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 16 -1.</_>
+        <_>
+          1 10 18 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 5 3 -1.</_>
+        <_>
+          9 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 6 -1.</_>
+        <_>
+          0 6 9 3 2.</_>
+        <_>
+          9 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 3 -1.</_>
+        <_>
+          17 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 9 -1.</_>
+        <_>
+          12 14 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 1 3 -1.</_>
+        <_>
+          2 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 3 -1.</_>
+        <_>
+          7 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 6 -1.</_>
+        <_>
+          0 3 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 3 -1.</_>
+        <_>
+          9 5 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 10 -1.</_>
+        <_>
+          3 1 2 5 2.</_>
+        <_>
+          5 6 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 19 10 -1.</_>
+        <_>
+          0 9 19 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 12 -1.</_>
+        <_>
+          9 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 5 2 -1.</_>
+        <_>
+          11 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 4 -1.</_>
+        <_>
+          5 16 3 2 2.</_>
+        <_>
+          8 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 3 2 -1.</_>
+        <_>
+          5 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 2 -1.</_>
+        <_>
+          13 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 6 -1.</_>
+        <_>
+          1 2 9 3 2.</_>
+        <_>
+          10 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 6 -1.</_>
+        <_>
+          3 7 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 6 -1.</_>
+        <_>
+          18 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 1 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          3 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 2 -1.</_>
+        <_>
+          9 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 15 -1.</_>
+        <_>
+          9 4 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 15 -1.</_>
+        <_>
+          8 4 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 7 -1.</_>
+        <_>
+          14 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 9 -1.</_>
+        <_>
+          18 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 1 -1.</_>
+        <_>
+          9 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 7 -1.</_>
+        <_>
+          3 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          16 7 3 2 2.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 2 -1.</_>
+        <_>
+          8 1 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 7 3 2 2.</_>
+        <_>
+          4 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 3 -1.</_>
+        <_>
+          1 3 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 3 -1.</_>
+        <_>
+          9 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 2 -1.</_>
+        <_>
+          12 14 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 2 -1.</_>
+        <_>
+          8 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 8 -1.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 2 -1.</_>
+        <_>
+          12 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 12 -1.</_>
+        <_>
+          7 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 4 -1.</_>
+        <_>
+          7 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 6 -1.</_>
+        <_>
+          0 15 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 2 -1.</_>
+        <_>
+          14 5 6 1 2.</_>
+        <_>
+          8 6 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 3 -1.</_>
+        <_>
+          8 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          10 0 4 6 2.</_>
+        <_>
+          6 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 4 -1.</_>
+        <_>
+          0 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 5 -1.</_>
+        <_>
+          10 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          9 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 6 -1.</_>
+        <_>
+          17 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 3 -1.</_>
+        <_>
+          3 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 3 -1.</_>
+        <_>
+          7 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 5 3 -1.</_>
+        <_>
+          14 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 3 -1.</_>
+        <_>
+          4 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 5 3 -1.</_>
+        <_>
+          1 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 2 -1.</_>
+        <_>
+          1 15 6 1 2.</_>
+        <_>
+          7 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 2 -1.</_>
+        <_>
+          12 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 5 -1.</_>
+        <_>
+          10 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 6 -1.</_>
+        <_>
+          10 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 6 -1.</_>
+        <_>
+          0 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 2 -1.</_>
+        <_>
+          12 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 2 -1.</_>
+        <_>
+          4 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 5 -1.</_>
+        <_>
+          9 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 1 -1.</_>
+        <_>
+          10 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 8 -1.</_>
+        <_>
+          17 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 1 -1.</_>
+        <_>
+          9 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 3 8 -1.</_>
+        <_>
+          2 5 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 3 -1.</_>
+        <_>
+          11 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 4 -1.</_>
+        <_>
+          17 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 3 -1.</_>
+        <_>
+          2 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 1 3 -1.</_>
+        <_>
+          9 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 10 -1.</_>
+        <_>
+          6 6 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 8 -1.</_>
+        <_>
+          16 0 3 4 2.</_>
+        <_>
+          13 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 2 4 -1.</_>
+        <_>
+          2 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 2 -1.</_>
+        <_>
+          4 3 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 4 -1.</_>
+        <_>
+          8 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 4 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 1 -1.</_>
+        <_>
+          5 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 10 -1.</_>
+        <_>
+          3 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 2 -1.</_>
+        <_>
+          8 6 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 6 -1.</_>
+        <_>
+          12 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 2 -1.</_>
+        <_>
+          8 6 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 6 -1.</_>
+        <_>
+          6 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 4 -1.</_>
+        <_>
+          3 16 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 3 -1.</_>
+        <_>
+          8 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 1 -1.</_>
+        <_>
+          8 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 3 -1.</_>
+        <_>
+          18 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 6 -1.</_>
+        <_>
+          16 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 1 -1.</_>
+        <_>
+          9 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 9 -1.</_>
+        <_>
+          8 1 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 11 6 -1.</_>
+        <_>
+          5 14 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 14 -1.</_>
+        <_>
+          12 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 5 -1.</_>
+        <_>
+          7 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 3 -1.</_>
+        <_>
+          4 2 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 10 -1.</_>
+        <_>
+          5 5 3 5 2.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 2 2 -1.</_>
+        <_>
+          16 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 5 -1.</_>
+        <_>
+          9 4 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 1 4 -1.</_>
+        <_>
+          8 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 12 4 -1.</_>
+        <_>
+          13 15 6 2 2.</_>
+        <_>
+          7 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 6 2 -1.</_>
+        <_>
+          11 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 10 -1.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          5 10 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 12 -1.</_>
+        <_>
+          14 1 3 6 2.</_>
+        <_>
+          11 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 1 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 6 -1.</_>
+        <_>
+          4 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          4 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 2 2 -1.</_>
+        <_>
+          14 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 2 -1.</_>
+        <_>
+          15 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 2 -1.</_>
+        <_>
+          7 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 2 -1.</_>
+        <_>
+          8 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 12 -1.</_>
+        <_>
+          14 1 3 6 2.</_>
+        <_>
+          11 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 2 -1.</_>
+        <_>
+          12 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 12 6 -1.</_>
+        <_>
+          3 10 6 3 2.</_>
+        <_>
+          9 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 12 -1.</_>
+        <_>
+          3 1 3 6 2.</_>
+        <_>
+          6 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 8 -1.</_>
+        <_>
+          10 1 5 4 2.</_>
+        <_>
+          5 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 14 -1.</_>
+        <_>
+          0 6 2 7 2.</_>
+        <_>
+          2 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 4 -1.</_>
+        <_>
+          1 15 6 2 2.</_>
+        <_>
+          7 17 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 3 -1.</_>
+        <_>
+          11 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 6 -1.</_>
+        <_>
+          12 2 1 3 2.</_>
+        <_>
+          11 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 3 -1.</_>
+        <_>
+          8 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 4 2 -1.</_>
+        <_>
+          12 15 2 1 2.</_>
+        <_>
+          10 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 3 -1.</_>
+        <_>
+          13 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 3 -1.</_>
+        <_>
+          3 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 6 -1.</_>
+        <_>
+          7 2 1 3 2.</_>
+        <_>
+          8 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 3 -1.</_>
+        <_>
+          2 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 4 2 -1.</_>
+        <_>
+          12 15 2 1 2.</_>
+        <_>
+          10 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 4 2 -1.</_>
+        <_>
+          6 15 2 1 2.</_>
+        <_>
+          8 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 3 -1.</_>
+        <_>
+          3 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 2 -1.</_>
+        <_>
+          6 8 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 6 -1.</_>
+        <_>
+          9 14 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 2 -1.</_>
+        <_>
+          9 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 5 -1.</_>
+        <_>
+          9 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 5 -1.</_>
+        <_>
+          10 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 2 -1.</_>
+        <_>
+          13 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 11 -1.</_>
+        <_>
+          8 3 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 7 -1.</_>
+        <_>
+          8 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 8 -1.</_>
+        <_>
+          8 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 2 -1.</_>
+        <_>
+          13 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 2 -1.</_>
+        <_>
+          12 6 1 1 2.</_>
+        <_>
+          11 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 3 -1.</_>
+        <_>
+          6 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 2 -1.</_>
+        <_>
+          13 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 3 -1.</_>
+        <_>
+          16 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 2 -1.</_>
+        <_>
+          6 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 3 3 -1.</_>
+        <_>
+          1 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 1 6 -1.</_>
+        <_>
+          13 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 2 -1.</_>
+        <_>
+          13 4 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          0 13 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 6 -1.</_>
+        <_>
+          0 6 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 6 -1.</_>
+        <_>
+          10 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 5 -1.</_>
+        <_>
+          8 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 5 -1.</_>
+        <_>
+          6 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 9 6 -1.</_>
+        <_>
+          1 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 2 -1.</_>
+        <_>
+          15 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 3 4 -1.</_>
+        <_>
+          13 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 2 -1.</_>
+        <_>
+          3 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 3 4 -1.</_>
+        <_>
+          4 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 5 3 -1.</_>
+        <_>
+          9 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 6 -1.</_>
+        <_>
+          0 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 3 -1.</_>
+        <_>
+          6 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 3 -1.</_>
+        <_>
+          9 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 5 3 -1.</_>
+        <_>
+          8 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 2 -1.</_>
+        <_>
+          9 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 2 -1.</_>
+        <_>
+          1 9 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 3 -1.</_>
+        <_>
+          8 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 4 -1.</_>
+        <_>
+          4 13 6 2 2.</_>
+        <_>
+          10 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 8 -1.</_>
+        <_>
+          14 4 1 4 2.</_>
+        <_>
+          13 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 6 -1.</_>
+        <_>
+          0 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 2 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 7 -1.</_>
+        <_>
+          14 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 14 -1.</_>
+        <_>
+          11 2 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 7 -1.</_>
+        <_>
+          5 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 12 -1.</_>
+        <_>
+          5 5 4 6 2.</_>
+        <_>
+          9 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 3 -1.</_>
+        <_>
+          11 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 3 -1.</_>
+        <_>
+          12 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 12 -1.</_>
+        <_>
+          5 5 5 6 2.</_>
+        <_>
+          10 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 3 -1.</_>
+        <_>
+          9 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 7 -1.</_>
+        <_>
+          9 6 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 4 -1.</_>
+        <_>
+          9 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 4 -1.</_>
+        <_>
+          7 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 7 3 -1.</_>
+        <_>
+          13 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 7 3 -1.</_>
+        <_>
+          0 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 8 10 -1.</_>
+        <_>
+          12 9 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 12 5 -1.</_>
+        <_>
+          12 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 10 -1.</_>
+        <_>
+          4 9 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 5 -1.</_>
+        <_>
+          4 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 6 2 -1.</_>
+        <_>
+          5 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 9 -1.</_>
+        <_>
+          0 3 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 4 -1.</_>
+        <_>
+          12 4 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 4 -1.</_>
+        <_>
+          0 12 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 5 -1.</_>
+        <_>
+          6 3 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 4 2 -1.</_>
+        <_>
+          3 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 8 10 -1.</_>
+        <_>
+          9 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          8 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 12 -1.</_>
+        <_>
+          3 4 7 6 2.</_>
+        <_>
+          10 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 4 -1.</_>
+        <_>
+          9 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 4 -1.</_>
+        <_>
+          6 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 3 -1.</_>
+        <_>
+          2 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 9 -1.</_>
+        <_>
+          4 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          9 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 2 -1.</_>
+        <_>
+          3 2 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 5 -1.</_>
+        <_>
+          10 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 10 -1.</_>
+        <_>
+          4 15 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 2 -1.</_>
+        <_>
+          0 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 9 2 -1.</_>
+        <_>
+          5 16 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 3 -1.</_>
+        <_>
+          8 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 4 3 -1.</_>
+        <_>
+          8 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 2 -1.</_>
+        <_>
+          3 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 1 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 2 -1.</_>
+        <_>
+          0 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 6 -1.</_>
+        <_>
+          9 4 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 14 -1.</_>
+        <_>
+          10 2 10 7 2.</_>
+        <_>
+          0 9 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 1 3 -1.</_>
+        <_>
+          14 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 12 -1.</_>
+        <_>
+          0 4 10 6 2.</_>
+        <_>
+          10 10 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 2 -1.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 2 -1.</_>
+        <_>
+          10 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          11 17 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          5 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 3 2 -1.</_>
+        <_>
+          14 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 4 -1.</_>
+        <_>
+          12 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 2 -1.</_>
+        <_>
+          3 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 7 -1.</_>
+        <_>
+          10 13 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 5 3 -1.</_>
+        <_>
+          12 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 7 6 2 2.</_>
+        <_>
+          10 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 14 1 -1.</_>
+        <_>
+          6 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 3 2 -1.</_>
+        <_>
+          16 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 10 -1.</_>
+        <_>
+          1 0 2 5 2.</_>
+        <_>
+          3 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 5 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 15 -1.</_>
+        <_>
+          9 10 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 6 -1.</_>
+        <_>
+          0 5 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 2 -1.</_>
+        <_>
+          7 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 8 2 -1.</_>
+        <_>
+          16 8 4 1 2.</_>
+        <_>
+          12 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 1 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 3 -1.</_>
+        <_>
+          3 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 2 -1.</_>
+        <_>
+          5 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 3 -1.</_>
+        <_>
+          9 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 3 -1.</_>
+        <_>
+          7 16 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 11 6 -1.</_>
+        <_>
+          3 16 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 1 -1.</_>
+        <_>
+          7 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          11 17 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 2 -1.</_>
+        <_>
+          14 11 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 6 2 -1.</_>
+        <_>
+          7 17 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 10 -1.</_>
+        <_>
+          3 1 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 3 -1.</_>
+        <_>
+          11 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 3 -1.</_>
+        <_>
+          8 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 11 -1.</_>
+        <_>
+          2 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 10 -1.</_>
+        <_>
+          10 0 4 5 2.</_>
+        <_>
+          6 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 14 -1.</_>
+        <_>
+          6 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          8 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 5 -1.</_>
+        <_>
+          9 7 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 9 -1.</_>
+        <_>
+          9 6 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 3 -1.</_>
+        <_>
+          9 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          10 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 9 -1.</_>
+        <_>
+          10 8 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 8 -1.</_>
+        <_>
+          17 4 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 4 -1.</_>
+        <_>
+          8 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 2 -1.</_>
+        <_>
+          9 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 2 -1.</_>
+        <_>
+          11 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 12 2 4 2.</_>
+        <_>
+          10 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 9 -1.</_>
+        <_>
+          0 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 3 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 2 -1.</_>
+        <_>
+          8 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 2 -1.</_>
+        <_>
+          7 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 1 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 9 -1.</_>
+        <_>
+          16 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 6 -1.</_>
+        <_>
+          16 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 9 -1.</_>
+        <_>
+          2 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 6 -1.</_>
+        <_>
+          1 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 9 -1.</_>
+        <_>
+          11 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 6 -1.</_>
+        <_>
+          11 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 2 -1.</_>
+        <_>
+          1 2 9 1 2.</_>
+        <_>
+          10 3 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 8 -1.</_>
+        <_>
+          7 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 16 -1.</_>
+        <_>
+          11 0 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 18 -1.</_>
+        <_>
+          17 1 3 9 2.</_>
+        <_>
+          14 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 3 -1.</_>
+        <_>
+          2 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 18 -1.</_>
+        <_>
+          0 1 3 9 2.</_>
+        <_>
+          3 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 18 -1.</_>
+        <_>
+          2 10 18 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 1 -1.</_>
+        <_>
+          7 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 5 3 -1.</_>
+        <_>
+          8 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 5 3 -1.</_>
+        <_>
+          3 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 4 -1.</_>
+        <_>
+          7 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 1 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 8 -1.</_>
+        <_>
+          10 4 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 5 -1.</_>
+        <_>
+          10 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 4 -1.</_>
+        <_>
+          12 4 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 2 -1.</_>
+        <_>
+          13 7 1 1 2.</_>
+        <_>
+          12 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 8 -1.</_>
+        <_>
+          3 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 12 -1.</_>
+        <_>
+          7 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 2 -1.</_>
+        <_>
+          13 7 1 1 2.</_>
+        <_>
+          12 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 6 -1.</_>
+        <_>
+          11 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 15 -1.</_>
+        <_>
+          7 1 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 2 -1.</_>
+        <_>
+          17 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 10 -1.</_>
+        <_>
+          12 3 2 5 2.</_>
+        <_>
+          10 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 2 2 -1.</_>
+        <_>
+          1 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 2 -1.</_>
+        <_>
+          7 10 1 1 2.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          10 12 7 2 2.</_>
+        <_>
+          3 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 2 -1.</_>
+        <_>
+          9 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 3 3 -1.</_>
+        <_>
+          1 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 2 -1.</_>
+        <_>
+          0 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 1 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 6 -1.</_>
+        <_>
+          0 6 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 14 -1.</_>
+        <_>
+          9 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 3 -1.</_>
+        <_>
+          12 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 12 2 -1.</_>
+        <_>
+          8 18 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 8 -1.</_>
+        <_>
+          15 1 1 4 2.</_>
+        <_>
+          14 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 9 1 -1.</_>
+        <_>
+          6 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 4 2 -1.</_>
+        <_>
+          3 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 4 -1.</_>
+        <_>
+          11 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 6 -1.</_>
+        <_>
+          14 15 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 1 6 -1.</_>
+        <_>
+          6 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 8 -1.</_>
+        <_>
+          10 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 10 -1.</_>
+        <_>
+          8 4 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 3 -1.</_>
+        <_>
+          14 3 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 6 -1.</_>
+        <_>
+          8 3 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 8 -1.</_>
+        <_>
+          3 9 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 3 -1.</_>
+        <_>
+          12 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          5 16 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 3 -1.</_>
+        <_>
+          3 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 6 -1.</_>
+        <_>
+          9 14 1 3 2.</_>
+        <_>
+          10 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 2 -1.</_>
+        <_>
+          9 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 3 -1.</_>
+        <_>
+          0 3 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 11 -1.</_>
+        <_>
+          3 1 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          10 13 2 3 2.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          3 12 7 2 2.</_>
+        <_>
+          10 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 4 -1.</_>
+        <_>
+          7 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          10 13 2 3 2.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          8 13 2 3 2.</_>
+        <_>
+          10 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 3 -1.</_>
+        <_>
+          9 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 3 -1.</_>
+        <_>
+          10 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 1 2 -1.</_>
+        <_>
+          11 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 2 -1.</_>
+        <_>
+          9 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 8 -1.</_>
+        <_>
+          0 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 3 -1.</_>
+        <_>
+          10 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 3 -1.</_>
+        <_>
+          10 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 16 6 -1.</_>
+        <_>
+          0 6 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 2 -1.</_>
+        <_>
+          5 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 12 -1.</_>
+        <_>
+          10 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          7 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          10 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 8 -1.</_>
+        <_>
+          8 16 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          10 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 3 -1.</_>
+        <_>
+          8 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 3 3 -1.</_>
+        <_>
+          16 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 3 -1.</_>
+        <_>
+          10 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 5 -1.</_>
+        <_>
+          8 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 2 -1.</_>
+        <_>
+          10 10 10 1 2.</_>
+        <_>
+          0 11 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 9 4 -1.</_>
+        <_>
+          14 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 4 -1.</_>
+        <_>
+          1 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 2 -1.</_>
+        <_>
+          8 15 2 1 2.</_>
+        <_>
+          10 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 19 3 -1.</_>
+        <_>
+          1 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 3 3 -1.</_>
+        <_>
+          15 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 10 -1.</_>
+        <_>
+          0 4 10 5 2.</_>
+        <_>
+          10 9 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 6 -1.</_>
+        <_>
+          10 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 6 -1.</_>
+        <_>
+          16 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 3 -1.</_>
+        <_>
+          7 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 6 2 -1.</_>
+        <_>
+          13 14 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 3 -1.</_>
+        <_>
+          14 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 2 -1.</_>
+        <_>
+          1 14 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 5 -1.</_>
+        <_>
+          18 4 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 8 -1.</_>
+        <_>
+          12 5 7 4 2.</_>
+        <_>
+          5 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 5 -1.</_>
+        <_>
+          8 8 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 6 -1.</_>
+        <_>
+          0 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 6 -1.</_>
+        <_>
+          10 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 3 -1.</_>
+        <_>
+          10 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 6 -1.</_>
+        <_>
+          9 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 3 -1.</_>
+        <_>
+          4 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 4 2 -1.</_>
+        <_>
+          12 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          0 2 10 3 2.</_>
+        <_>
+          10 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 4 -1.</_>
+        <_>
+          10 10 8 2 2.</_>
+        <_>
+          2 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 6 -1.</_>
+        <_>
+          11 10 8 3 2.</_>
+        <_>
+          3 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 16 6 -1.</_>
+        <_>
+          1 10 8 3 2.</_>
+        <_>
+          9 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 4 -1.</_>
+        <_>
+          5 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 9 4 -1.</_>
+        <_>
+          14 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 4 -1.</_>
+        <_>
+          10 16 7 2 2.</_>
+        <_>
+          3 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 4 -1.</_>
+        <_>
+          3 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 6 -1.</_>
+        <_>
+          1 14 3 3 2.</_>
+        <_>
+          4 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 1 -1.</_>
+        <_>
+          9 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 10 -1.</_>
+        <_>
+          10 7 4 5 2.</_>
+        <_>
+          6 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 1 2 -1.</_>
+        <_>
+          2 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 2 -1.</_>
+        <_>
+          7 9 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 15 -1.</_>
+        <_>
+          9 7 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 2 -1.</_>
+        <_>
+          5 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 5 6 -1.</_>
+        <_>
+          12 15 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 18 -1.</_>
+        <_>
+          0 9 20 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 6 -1.</_>
+        <_>
+          7 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 9 -1.</_>
+        <_>
+          7 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 5 2 -1.</_>
+        <_>
+          14 17 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 15 10 -1.</_>
+        <_>
+          0 10 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 2 -1.</_>
+        <_>
+          7 15 2 1 2.</_>
+        <_>
+          9 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 2 2 -1.</_>
+        <_>
+          14 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 2 2 -1.</_>
+        <_>
+          4 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 3 -1.</_>
+        <_>
+          8 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 10 -1.</_>
+        <_>
+          1 9 2 5 2.</_>
+        <_>
+          3 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 8 -1.</_>
+        <_>
+          2 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 2 -1.</_>
+        <_>
+          11 1 2 1 2.</_>
+        <_>
+          9 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 3 -1.</_>
+        <_>
+          7 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          9 14 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 4 -1.</_>
+        <_>
+          11 6 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 3 -1.</_>
+        <_>
+          8 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 3 -1.</_>
+        <_>
+          8 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 5 -1.</_>
+        <_>
+          7 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 1 -1.</_>
+        <_>
+          4 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 6 -1.</_>
+        <_>
+          8 2 1 3 2.</_>
+        <_>
+          9 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 3 6 -1.</_>
+        <_>
+          12 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 1 4 -1.</_>
+        <_>
+          8 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 4 -1.</_>
+        <_>
+          5 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 12 -1.</_>
+        <_>
+          6 6 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          8 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 6 -1.</_>
+        <_>
+          12 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 12 -1.</_>
+        <_>
+          5 7 5 6 2.</_>
+        <_>
+          10 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 10 -1.</_>
+        <_>
+          4 9 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 2 -1.</_>
+        <_>
+          11 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 2 -1.</_>
+        <_>
+          5 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 6 -1.</_>
+        <_>
+          0 4 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 3 4 -1.</_>
+        <_>
+          11 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 1 3 -1.</_>
+        <_>
+          9 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 6 -1.</_>
+        <_>
+          0 6 8 3 2.</_>
+        <_>
+          8 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 3 -1.</_>
+        <_>
+          10 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 4 3 -1.</_>
+        <_>
+          9 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 2 -1.</_>
+        <_>
+          3 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 3 -1.</_>
+        <_>
+          9 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 3 -1.</_>
+        <_>
+          10 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          9 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 6 -1.</_>
+        <_>
+          12 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 5 2 -1.</_>
+        <_>
+          8 13 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 6 -1.</_>
+        <_>
+          5 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 2 -1.</_>
+        <_>
+          8 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 7 6 -1.</_>
+        <_>
+          11 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 4 -1.</_>
+        <_>
+          3 13 7 2 2.</_>
+        <_>
+          10 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 6 -1.</_>
+        <_>
+          8 14 2 3 2.</_>
+        <_>
+          10 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 2 -1.</_>
+        <_>
+          9 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 2 -1.</_>
+        <_>
+          7 8 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 13 3 -1.</_>
+        <_>
+          3 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 4 -1.</_>
+        <_>
+          9 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 3 -1.</_>
+        <_>
+          8 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 4 -1.</_>
+        <_>
+          8 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 5 -1.</_>
+        <_>
+          9 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 4 -1.</_>
+        <_>
+          13 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 4 -1.</_>
+        <_>
+          6 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 1 -1.</_>
+        <_>
+          7 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 3 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 2 -1.</_>
+        <_>
+          11 3 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 2 7 1 2.</_>
+        <_>
+          10 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 14 -1.</_>
+        <_>
+          6 8 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 5 -1.</_>
+        <_>
+          8 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 1 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 5 -1.</_>
+        <_>
+          5 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 15 -1.</_>
+        <_>
+          2 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 3 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 3 -1.</_>
+        <_>
+          13 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 4 3 -1.</_>
+        <_>
+          2 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 2 -1.</_>
+        <_>
+          12 6 1 1 2.</_>
+        <_>
+          11 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 3 -1.</_>
+        <_>
+          12 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 2 -1.</_>
+        <_>
+          7 6 1 1 2.</_>
+        <_>
+          8 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 3 -1.</_>
+        <_>
+          4 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 3 -1.</_>
+        <_>
+          12 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 1 -1.</_>
+        <_>
+          9 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 3 -1.</_>
+        <_>
+          4 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 3 -1.</_>
+        <_>
+          4 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 3 -1.</_>
+        <_>
+          12 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 3 -1.</_>
+        <_>
+          7 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 1 3 -1.</_>
+        <_>
+          4 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 2 -1.</_>
+        <_>
+          17 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 9 -1.</_>
+        <_>
+          8 13 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 2 -1.</_>
+        <_>
+          0 9 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 6 -1.</_>
+        <_>
+          1 14 3 3 2.</_>
+        <_>
+          4 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 6 2 -1.</_>
+        <_>
+          0 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 3 -1.</_>
+        <_>
+          12 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 8 -1.</_>
+        <_>
+          10 8 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 3 -1.</_>
+        <_>
+          6 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 6 1 -1.</_>
+        <_>
+          6 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 2 -1.</_>
+        <_>
+          10 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 12 -1.</_>
+        <_>
+          10 7 4 6 2.</_>
+        <_>
+          6 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          9 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 4 -1.</_>
+        <_>
+          10 16 7 2 2.</_>
+        <_>
+          3 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 4 -1.</_>
+        <_>
+          10 14 9 2 2.</_>
+        <_>
+          1 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 12 -1.</_>
+        <_>
+          0 4 10 6 2.</_>
+        <_>
+          10 10 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 12 -1.</_>
+        <_>
+          10 5 5 6 2.</_>
+        <_>
+          5 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          8 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 3 -1.</_>
+        <_>
+          8 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 5 6 -1.</_>
+        <_>
+          13 15 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          9 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 6 -1.</_>
+        <_>
+          2 15 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 12 -1.</_>
+        <_>
+          0 4 1 6 2.</_>
+        <_>
+          1 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 3 1 -1.</_>
+        <_>
+          10 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 6 -1.</_>
+        <_>
+          18 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 6 -1.</_>
+        <_>
+          0 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 6 -1.</_>
+        <_>
+          0 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 7 -1.</_>
+        <_>
+          18 2 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 7 -1.</_>
+        <_>
+          1 2 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 8 -1.</_>
+        <_>
+          8 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 1 4 -1.</_>
+        <_>
+          13 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 5 -1.</_>
+        <_>
+          9 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 1 4 -1.</_>
+        <_>
+          6 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 5 -1.</_>
+        <_>
+          7 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 8 -1.</_>
+        <_>
+          10 12 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 1 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 7 3 -1.</_>
+        <_>
+          5 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 14 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 2 -1.</_>
+        <_>
+          4 19 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          9 12 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 3 -1.</_>
+        <_>
+          7 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 10 -1.</_>
+        <_>
+          11 5 6 5 2.</_>
+        <_>
+          5 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 10 -1.</_>
+        <_>
+          8 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 12 -1.</_>
+        <_>
+          5 10 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          7 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 5 16 -1.</_>
+        <_>
+          8 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 6 -1.</_>
+        <_>
+          8 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 2 -1.</_>
+        <_>
+          7 13 1 1 2.</_>
+        <_>
+          8 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 2 -1.</_>
+        <_>
+          7 12 1 1 2.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 14 -1.</_>
+        <_>
+          18 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 2 -1.</_>
+        <_>
+          12 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 1 2 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 1 2 -1.</_>
+        <_>
+          2 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 1 -1.</_>
+        <_>
+          9 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          9 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 2 2 -1.</_>
+        <_>
+          4 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 2 -1.</_>
+        <_>
+          3 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 3 4 -1.</_>
+        <_>
+          12 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 2 -1.</_>
+        <_>
+          7 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          8 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 3 -1.</_>
+        <_>
+          7 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 3 -1.</_>
+        <_>
+          5 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 6 -1.</_>
+        <_>
+          0 3 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 3 -1.</_>
+        <_>
+          9 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 4 -1.</_>
+        <_>
+          3 9 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 6 -1.</_>
+        <_>
+          5 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 12 -1.</_>
+        <_>
+          8 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          12 17 3 1 2.</_>
+        <_>
+          9 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          10 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 2 -1.</_>
+        <_>
+          4 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 14 -1.</_>
+        <_>
+          9 3 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 1 6 -1.</_>
+        <_>
+          15 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 2 6 -1.</_>
+        <_>
+          13 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 5 6 -1.</_>
+        <_>
+          4 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 4 2 -1.</_>
+        <_>
+          6 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 12 -1.</_>
+        <_>
+          11 5 5 6 2.</_>
+        <_>
+          6 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 12 -1.</_>
+        <_>
+          4 0 1 6 2.</_>
+        <_>
+          5 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 2 -1.</_>
+        <_>
+          6 1 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 6 -1.</_>
+        <_>
+          5 7 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 10 9 1 2.</_>
+        <_>
+          10 11 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 7 -1.</_>
+        <_>
+          6 6 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 3 3 -1.</_>
+        <_>
+          9 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 2 -1.</_>
+        <_>
+          8 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 3 -1.</_>
+        <_>
+          15 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 1 -1.</_>
+        <_>
+          0 14 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 6 3 -1.</_>
+        <_>
+          0 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 2 -1.</_>
+        <_>
+          5 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 1 -1.</_>
+        <_>
+          0 6 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 10 14 -1.</_>
+        <_>
+          11 3 5 7 2.</_>
+        <_>
+          6 10 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          6 3 4 3 2.</_>
+        <_>
+          10 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 10 14 -1.</_>
+        <_>
+          11 3 5 7 2.</_>
+        <_>
+          6 10 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 1 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 14 -1.</_>
+        <_>
+          4 3 5 7 2.</_>
+        <_>
+          9 10 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 1 -1.</_>
+        <_>
+          0 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 10 3 -1.</_>
+        <_>
+          2 2 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          10 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 6 -1.</_>
+        <_>
+          16 5 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 12 -1.</_>
+        <_>
+          16 6 1 6 2.</_>
+        <_>
+          15 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 10 -1.</_>
+        <_>
+          1 4 9 5 2.</_>
+        <_>
+          10 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 4 -1.</_>
+        <_>
+          9 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 2 -1.</_>
+        <_>
+          12 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 10 4 -1.</_>
+        <_>
+          5 14 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 2 -1.</_>
+        <_>
+          5 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 6 -1.</_>
+        <_>
+          8 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 6 -1.</_>
+        <_>
+          14 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 6 -1.</_>
+        <_>
+          18 0 2 3 2.</_>
+        <_>
+          16 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 6 -1.</_>
+        <_>
+          0 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 6 -1.</_>
+        <_>
+          0 0 2 3 2.</_>
+        <_>
+          2 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 5 -1.</_>
+        <_>
+          12 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 17 -1.</_>
+        <_>
+          16 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 20 -1.</_>
+        <_>
+          7 0 6 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 5 -1.</_>
+        <_>
+          7 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 1 -1.</_>
+        <_>
+          0 6 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 4 -1.</_>
+        <_>
+          10 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 4 -1.</_>
+        <_>
+          1 1 8 2 2.</_>
+        <_>
+          9 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 2 -1.</_>
+        <_>
+          7 2 2 1 2.</_>
+        <_>
+          9 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 3 -1.</_>
+        <_>
+          7 5 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 5 12 -1.</_>
+        <_>
+          10 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 3 -1.</_>
+        <_>
+          3 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 5 -1.</_>
+        <_>
+          9 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          5 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 2 -1.</_>
+        <_>
+          2 12 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 3 -1.</_>
+        <_>
+          15 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 17 -1.</_>
+        <_>
+          16 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 3 -1.</_>
+        <_>
+          1 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 1 3 -1.</_>
+        <_>
+          9 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 7 -1.</_>
+        <_>
+          10 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 2 -1.</_>
+        <_>
+          8 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 7 -1.</_>
+        <_>
+          7 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          10 2 10 1 2.</_>
+        <_>
+          0 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 2 -1.</_>
+        <_>
+          6 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          0 2 10 1 2.</_>
+        <_>
+          10 3 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 2 10 -1.</_>
+        <_>
+          3 1 1 5 2.</_>
+        <_>
+          4 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 1 10 -1.</_>
+        <_>
+          13 9 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 3 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 4 -1.</_>
+        <_>
+          2 11 8 2 2.</_>
+        <_>
+          10 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 5 -1.</_>
+        <_>
+          6 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 2 -1.</_>
+        <_>
+          9 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 2 -1.</_>
+        <_>
+          0 11 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 7 3 2 2.</_>
+        <_>
+          4 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 4 -1.</_>
+        <_>
+          16 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 2 14 -1.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 12 -1.</_>
+        <_>
+          6 7 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 5 -1.</_>
+        <_>
+          10 0 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 10 -1.</_>
+        <_>
+          15 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 3 -1.</_>
+        <_>
+          7 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 2 -1.</_>
+        <_>
+          0 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 3 -1.</_>
+        <_>
+          11 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 12 -1.</_>
+        <_>
+          11 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 16 -1.</_>
+        <_>
+          1 3 2 8 2.</_>
+        <_>
+          3 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 3 -1.</_>
+        <_>
+          8 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          9 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 13 -1.</_>
+        <_>
+          11 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 2 -1.</_>
+        <_>
+          8 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 1 12 -1.</_>
+        <_>
+          8 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 6 -1.</_>
+        <_>
+          10 10 6 3 2.</_>
+        <_>
+          4 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 3 -1.</_>
+        <_>
+          13 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 6 -1.</_>
+        <_>
+          4 10 6 3 2.</_>
+        <_>
+          10 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          9 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          10 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 3 -1.</_>
+        <_>
+          12 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 1 -1.</_>
+        <_>
+          0 6 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 2 -1.</_>
+        <_>
+          10 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 4 3 -1.</_>
+        <_>
+          1 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 5 3 -1.</_>
+        <_>
+          10 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 8 -1.</_>
+        <_>
+          3 9 7 4 2.</_>
+        <_>
+          10 13 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 10 -1.</_>
+        <_>
+          6 8 4 5 2.</_>
+        <_>
+          10 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 5 3 -1.</_>
+        <_>
+          10 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 5 3 -1.</_>
+        <_>
+          5 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 2 3 -1.</_>
+        <_>
+          13 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 3 3 -1.</_>
+        <_>
+          3 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 3 -1.</_>
+        <_>
+          7 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 3 -1.</_>
+        <_>
+          12 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 6 -1.</_>
+        <_>
+          15 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 3 -1.</_>
+        <_>
+          7 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 6 -1.</_>
+        <_>
+          4 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 4 -1.</_>
+        <_>
+          11 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 5 -1.</_>
+        <_>
+          13 4 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          8 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 5 -1.</_>
+        <_>
+          6 4 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 2 -1.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 13 -1.</_>
+        <_>
+          12 7 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 2 -1.</_>
+        <_>
+          0 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 4 3 -1.</_>
+        <_>
+          6 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 2 -1.</_>
+        <_>
+          11 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 4 -1.</_>
+        <_>
+          11 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 3 -1.</_>
+        <_>
+          4 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 5 -1.</_>
+        <_>
+          7 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 4 -1.</_>
+        <_>
+          5 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 2 -1.</_>
+        <_>
+          10 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 14 4 -1.</_>
+        <_>
+          13 4 7 2 2.</_>
+        <_>
+          6 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 4 -1.</_>
+        <_>
+          5 16 3 2 2.</_>
+        <_>
+          8 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 4 -1.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 14 -1.</_>
+        <_>
+          8 12 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 7 -1.</_>
+        <_>
+          8 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 9 -1.</_>
+        <_>
+          0 3 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 8 -1.</_>
+        <_>
+          12 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 1 -1.</_>
+        <_>
+          6 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 2 6 -1.</_>
+        <_>
+          9 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 4 -1.</_>
+        <_>
+          12 5 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 12 -1.</_>
+        <_>
+          9 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 3 -1.</_>
+        <_>
+          8 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          12 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 6 -1.</_>
+        <_>
+          3 12 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 10 -1.</_>
+        <_>
+          5 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 12 -1.</_>
+        <_>
+          17 2 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 2 14 -1.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 12 9 -1.</_>
+        <_>
+          3 14 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 12 -1.</_>
+        <_>
+          2 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 3 2 -1.</_>
+        <_>
+          16 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 15 -1.</_>
+        <_>
+          1 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 2 4 -1.</_>
+        <_>
+          1 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 18 -1.</_>
+        <_>
+          11 1 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          10 2 7 1 2.</_>
+        <_>
+          3 3 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 18 -1.</_>
+        <_>
+          8 1 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 12 -1.</_>
+        <_>
+          6 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 3 -1.</_>
+        <_>
+          8 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 5 2 -1.</_>
+        <_>
+          0 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 6 -1.</_>
+        <_>
+          9 0 1 3 2.</_>
+        <_>
+          10 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 6 -1.</_>
+        <_>
+          10 0 1 3 2.</_>
+        <_>
+          9 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          10 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 6 -1.</_>
+        <_>
+          9 0 1 3 2.</_>
+        <_>
+          10 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          9 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 6 -1.</_>
+        <_>
+          9 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 3 -1.</_>
+        <_>
+          9 4 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 3 -1.</_>
+        <_>
+          0 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 2 -1.</_>
+        <_>
+          8 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 3 -1.</_>
+        <_>
+          12 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 12 -1.</_>
+        <_>
+          9 10 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 3 -1.</_>
+        <_>
+          5 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 3 -1.</_>
+        <_>
+          5 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          0 8 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 7 -1.</_>
+        <_>
+          6 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 10 -1.</_>
+        <_>
+          5 10 3 5 2.</_>
+        <_>
+          8 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 2 -1.</_>
+        <_>
+          9 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 3 -1.</_>
+        <_>
+          5 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 2 -1.</_>
+        <_>
+          10 1 10 1 2.</_>
+        <_>
+          0 2 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 2 -1.</_>
+        <_>
+          5 4 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 2 -1.</_>
+        <_>
+          7 4 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 14 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 4 -1.</_>
+        <_>
+          2 2 8 2 2.</_>
+        <_>
+          10 4 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 5 3 -1.</_>
+        <_>
+          7 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 10 -1.</_>
+        <_>
+          14 9 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 3 2 -1.</_>
+        <_>
+          16 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 10 -1.</_>
+        <_>
+          3 9 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 5 2 -1.</_>
+        <_>
+          0 17 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 12 -1.</_>
+        <_>
+          9 11 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 2 -1.</_>
+        <_>
+          5 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 1 2 -1.</_>
+        <_>
+          4 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 1 2 -1.</_>
+        <_>
+          11 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 16 2 -1.</_>
+        <_>
+          11 1 8 1 2.</_>
+        <_>
+          3 2 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 11 5 3 2.</_>
+        <_>
+          10 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 6 -1.</_>
+        <_>
+          10 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 11 -1.</_>
+        <_>
+          16 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 11 -1.</_>
+        <_>
+          2 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 6 -1.</_>
+        <_>
+          2 11 8 3 2.</_>
+        <_>
+          10 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 10 -1.</_>
+        <_>
+          16 0 4 5 2.</_>
+        <_>
+          12 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 4 -1.</_>
+        <_>
+          16 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 0 4 5 2.</_>
+        <_>
+          4 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 4 -1.</_>
+        <_>
+          2 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 2 -1.</_>
+        <_>
+          9 9 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 8 -1.</_>
+        <_>
+          14 3 2 4 2.</_>
+        <_>
+          12 7 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 9 -1.</_>
+        <_>
+          10 2 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 1 -1.</_>
+        <_>
+          10 2 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 5 -1.</_>
+        <_>
+          16 1 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 6 -1.</_>
+        <_>
+          16 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 4 -1.</_>
+        <_>
+          6 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 5 -1.</_>
+        <_>
+          6 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 14 -1.</_>
+        <_>
+          12 2 6 7 2.</_>
+        <_>
+          6 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 5 -1.</_>
+        <_>
+          12 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          5 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          7 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 2 -1.</_>
+        <_>
+          9 9 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 2 -1.</_>
+        <_>
+          12 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 15 2 -1.</_>
+        <_>
+          6 9 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 10 -1.</_>
+        <_>
+          5 0 1 5 2.</_>
+        <_>
+          6 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 14 -1.</_>
+        <_>
+          0 7 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 4 -1.</_>
+        <_>
+          12 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 4 -1.</_>
+        <_>
+          4 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 3 -1.</_>
+        <_>
+          9 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 4 -1.</_>
+        <_>
+          10 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 1 -1.</_>
+        <_>
+          10 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 2 -1.</_>
+        <_>
+          8 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 8 -1.</_>
+        <_>
+          8 4 1 4 2.</_>
+        <_>
+          9 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 3 -1.</_>
+        <_>
+          5 9 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 8 3 -1.</_>
+        <_>
+          4 18 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 3 -1.</_>
+        <_>
+          17 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 2 -1.</_>
+        <_>
+          10 12 1 1 2.</_>
+        <_>
+          9 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 4 -1.</_>
+        <_>
+          9 13 1 2 2.</_>
+        <_>
+          10 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 10 -1.</_>
+        <_>
+          11 5 6 5 2.</_>
+        <_>
+          5 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 12 -1.</_>
+        <_>
+          12 3 6 6 2.</_>
+        <_>
+          6 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          5 7 1 1 2.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 2 -1.</_>
+        <_>
+          5 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 14 -1.</_>
+        <_>
+          12 2 6 7 2.</_>
+        <_>
+          6 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 3 -1.</_>
+        <_>
+          9 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 17 -1.</_>
+        <_>
+          7 1 6 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 1 -1.</_>
+        <_>
+          5 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 3 -1.</_>
+        <_>
+          16 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          7 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 6 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 2 -1.</_>
+        <_>
+          6 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 6 2 -1.</_>
+        <_>
+          13 18 3 1 2.</_>
+        <_>
+          10 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 1 3 -1.</_>
+        <_>
+          16 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 1 2 -1.</_>
+        <_>
+          9 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 12 -1.</_>
+        <_>
+          14 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 1 3 -1.</_>
+        <_>
+          15 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 3 3 -1.</_>
+        <_>
+          8 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 12 -1.</_>
+        <_>
+          5 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 1 -1.</_>
+        <_>
+          10 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 14 -1.</_>
+        <_>
+          2 2 6 7 2.</_>
+        <_>
+          8 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 3 -1.</_>
+        <_>
+          8 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 8 -1.</_>
+        <_>
+          18 2 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 2 2 -1.</_>
+        <_>
+          1 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 6 -1.</_>
+        <_>
+          6 14 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 6 -1.</_>
+        <_>
+          13 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 3 -1.</_>
+        <_>
+          5 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 5 6 -1.</_>
+        <_>
+          2 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 15 3 -1.</_>
+        <_>
+          0 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 1 -1.</_>
+        <_>
+          17 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 2 -1.</_>
+        <_>
+          18 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 12 -1.</_>
+        <_>
+          0 8 4 6 2.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 6 -1.</_>
+        <_>
+          1 7 4 3 2.</_>
+        <_>
+          5 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 2 -1.</_>
+        <_>
+          16 1 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 4 -1.</_>
+        <_>
+          17 0 2 2 2.</_>
+        <_>
+          15 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 11 -1.</_>
+        <_>
+          3 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 8 -1.</_>
+        <_>
+          5 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 1 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 4 -1.</_>
+        <_>
+          8 6 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 9 1 -1.</_>
+        <_>
+          5 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 8 -1.</_>
+        <_>
+          9 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 12 -1.</_>
+        <_>
+          3 14 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 7 3 -1.</_>
+        <_>
+          6 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 3 -1.</_>
+        <_>
+          7 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 3 -1.</_>
+        <_>
+          12 2 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 2 -1.</_>
+        <_>
+          8 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          0 2 9 1 2.</_>
+        <_>
+          9 3 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 6 -1.</_>
+        <_>
+          6 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 8 -1.</_>
+        <_>
+          15 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 4 -1.</_>
+        <_>
+          9 16 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 14 4 -1.</_>
+        <_>
+          2 11 7 2 2.</_>
+        <_>
+          9 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          14 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 12 -1.</_>
+        <_>
+          14 8 5 6 2.</_>
+        <_>
+          9 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          3 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 12 -1.</_>
+        <_>
+          1 8 5 6 2.</_>
+        <_>
+          6 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 1 -1.</_>
+        <_>
+          11 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 3 -1.</_>
+        <_>
+          9 4 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 1 -1.</_>
+        <_>
+          7 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 3 -1.</_>
+        <_>
+          6 5 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 3 -1.</_>
+        <_>
+          9 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 3 -1.</_>
+        <_>
+          8 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 0 4 6 2.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 3 -1.</_>
+        <_>
+          4 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 6 3 -1.</_>
+        <_>
+          12 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 7 2 -1.</_>
+        <_>
+          7 13 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 3 -1.</_>
+        <_>
+          2 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 6 -1.</_>
+        <_>
+          0 10 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 5 -1.</_>
+        <_>
+          10 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 10 -1.</_>
+        <_>
+          0 5 10 5 2.</_>
+        <_>
+          10 10 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 2 -1.</_>
+        <_>
+          5 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 10 -1.</_>
+        <_>
+          11 6 4 5 2.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 2 -1.</_>
+        <_>
+          17 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 10 -1.</_>
+        <_>
+          5 6 4 5 2.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 10 6 -1.</_>
+        <_>
+          5 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 2 6 -1.</_>
+        <_>
+          11 3 1 3 2.</_>
+        <_>
+          10 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 3 -1.</_>
+        <_>
+          0 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 8 4 -1.</_>
+        <_>
+          3 16 4 2 2.</_>
+        <_>
+          7 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 5 2 -1.</_>
+        <_>
+          8 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 12 -1.</_>
+        <_>
+          8 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 2 -1.</_>
+        <_>
+          6 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 3 -1.</_>
+        <_>
+          9 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 3 -1.</_>
+        <_>
+          13 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 17 -1.</_>
+        <_>
+          16 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          6 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 1 -1.</_>
+        <_>
+          5 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 3 -1.</_>
+        <_>
+          9 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 3 -1.</_>
+        <_>
+          7 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 2 -1.</_>
+        <_>
+          0 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 1 -1.</_>
+        <_>
+          9 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 3 -1.</_>
+        <_>
+          9 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 17 6 -1.</_>
+        <_>
+          2 16 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 7 -1.</_>
+        <_>
+          2 3 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 4 -1.</_>
+        <_>
+          3 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 5 -1.</_>
+        <_>
+          14 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 2 -1.</_>
+        <_>
+          13 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 5 -1.</_>
+        <_>
+          3 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 2 6 -1.</_>
+        <_>
+          2 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 2 -1.</_>
+        <_>
+          9 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 1 -1.</_>
+        <_>
+          7 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 12 -1.</_>
+        <_>
+          8 6 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 2 -1.</_>
+        <_>
+          5 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 3 -1.</_>
+        <_>
+          5 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 4 -1.</_>
+        <_>
+          11 11 8 2 2.</_>
+        <_>
+          3 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 3 -1.</_>
+        <_>
+          0 11 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 2 -1.</_>
+        <_>
+          4 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 2 -1.</_>
+        <_>
+          13 6 1 1 2.</_>
+        <_>
+          12 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 6 -1.</_>
+        <_>
+          12 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 2 -1.</_>
+        <_>
+          6 6 1 1 2.</_>
+        <_>
+          7 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 16 -1.</_>
+        <_>
+          8 4 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 3 2 -1.</_>
+        <_>
+          11 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          12 17 3 1 2.</_>
+        <_>
+          9 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 2 -1.</_>
+        <_>
+          2 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 2 -1.</_>
+        <_>
+          3 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 3 -1.</_>
+        <_>
+          10 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 6 -1.</_>
+        <_>
+          9 6 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 2 11 -1.</_>
+        <_>
+          9 1 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 4 -1.</_>
+        <_>
+          9 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 1 -1.</_>
+        <_>
+          11 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 9 -1.</_>
+        <_>
+          1 3 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 6 -1.</_>
+        <_>
+          0 5 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 2 -1.</_>
+        <_>
+          12 15 1 1 2.</_>
+        <_>
+          11 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 2 -1.</_>
+        <_>
+          12 14 1 1 2.</_>
+        <_>
+          11 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 2 -1.</_>
+        <_>
+          7 15 1 1 2.</_>
+        <_>
+          8 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 2 -1.</_>
+        <_>
+          7 14 1 1 2.</_>
+        <_>
+          8 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 6 -1.</_>
+        <_>
+          10 13 2 3 2.</_>
+        <_>
+          8 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 16 4 -1.</_>
+        <_>
+          10 14 8 2 2.</_>
+        <_>
+          2 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 3 -1.</_>
+        <_>
+          7 8 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 2 -1.</_>
+        <_>
+          9 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 18 -1.</_>
+        <_>
+          11 1 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 4 -1.</_>
+        <_>
+          8 5 1 2 2.</_>
+        <_>
+          9 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          10 13 1 3 2.</_>
+        <_>
+          9 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 18 -1.</_>
+        <_>
+          12 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 18 -1.</_>
+        <_>
+          7 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 2 -1.</_>
+        <_>
+          7 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 1 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          10 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 2 -1.</_>
+        <_>
+          8 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 1 -1.</_>
+        <_>
+          0 7 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 5 4 -1.</_>
+        <_>
+          11 5 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 1 -1.</_>
+        <_>
+          10 7 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 3 -1.</_>
+        <_>
+          8 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 8 -1.</_>
+        <_>
+          10 0 8 4 2.</_>
+        <_>
+          2 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 10 -1.</_>
+        <_>
+          11 5 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 18 -1.</_>
+        <_>
+          4 2 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 6 -1.</_>
+        <_>
+          0 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 2 -1.</_>
+        <_>
+          6 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 2 -1.</_>
+        <_>
+          4 2 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 14 -1.</_>
+        <_>
+          2 8 16 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 12 -1.</_>
+        <_>
+          5 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 2 2 -1.</_>
+        <_>
+          9 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 5 6 -1.</_>
+        <_>
+          9 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 8 -1.</_>
+        <_>
+          3 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 5 8 -1.</_>
+        <_>
+          6 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 3 -1.</_>
+        <_>
+          9 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 3 -1.</_>
+        <_>
+          6 9 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 7 6 -1.</_>
+        <_>
+          2 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 14 4 -1.</_>
+        <_>
+          2 1 7 2 2.</_>
+        <_>
+          9 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 2 -1.</_>
+        <_>
+          6 16 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 8 -1.</_>
+        <_>
+          8 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 2 -1.</_>
+        <_>
+          6 16 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 8 3 -1.</_>
+        <_>
+          7 17 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 8 4 -1.</_>
+        <_>
+          1 16 4 2 2.</_>
+        <_>
+          5 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          2 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 4 -1.</_>
+        <_>
+          13 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 16 6 -1.</_>
+        <_>
+          0 15 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 4 -1.</_>
+        <_>
+          6 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 18 -1.</_>
+        <_>
+          19 2 1 9 2.</_>
+        <_>
+          18 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 9 -1.</_>
+        <_>
+          19 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          0 2 1 9 2.</_>
+        <_>
+          1 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 1 9 -1.</_>
+        <_>
+          0 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 2 -1.</_>
+        <_>
+          14 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 3 -1.</_>
+        <_>
+          11 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 2 -1.</_>
+        <_>
+          7 9 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 6 -1.</_>
+        <_>
+          7 12 2 3 2.</_>
+        <_>
+          9 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 5 3 -1.</_>
+        <_>
+          8 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 2 -1.</_>
+        <_>
+          13 14 1 1 2.</_>
+        <_>
+          12 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 2 -1.</_>
+        <_>
+          7 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 4 -1.</_>
+        <_>
+          10 10 8 2 2.</_>
+        <_>
+          2 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          9 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 3 -1.</_>
+        <_>
+          7 2 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 2 -1.</_>
+        <_>
+          0 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 11 2 -1.</_>
+        <_>
+          6 4 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 6 -1.</_>
+        <_>
+          16 0 4 3 2.</_>
+        <_>
+          12 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 2 -1.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 1 12 -1.</_>
+        <_>
+          8 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 13 -1.</_>
+        <_>
+          13 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 11 1 1 2.</_>
+        <_>
+          8 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 1 3 -1.</_>
+        <_>
+          3 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 1 -1.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 5 9 -1.</_>
+        <_>
+          1 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          6 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 4 -1.</_>
+        <_>
+          13 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 14 -1.</_>
+        <_>
+          13 3 2 7 2.</_>
+        <_>
+          11 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 4 -1.</_>
+        <_>
+          6 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 14 -1.</_>
+        <_>
+          5 3 2 7 2.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 6 -1.</_>
+        <_>
+          2 2 6 3 2.</_>
+        <_>
+          8 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 2 -1.</_>
+        <_>
+          9 6 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 12 -1.</_>
+        <_>
+          7 0 6 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 4 -1.</_>
+        <_>
+          5 7 3 2 2.</_>
+        <_>
+          8 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 4 -1.</_>
+        <_>
+          5 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 4 -1.</_>
+        <_>
+          9 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 2 -1.</_>
+        <_>
+          9 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 8 3 -1.</_>
+        <_>
+          6 18 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 2 -1.</_>
+        <_>
+          12 17 3 1 2.</_>
+        <_>
+          9 18 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 9 2 -1.</_>
+        <_>
+          3 13 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 1 -1.</_>
+        <_>
+          10 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          11 3 2 3 2.</_>
+        <_>
+          9 6 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 5 -1.</_>
+        <_>
+          3 3 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 18 -1.</_>
+        <_>
+          2 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 4 9 -1.</_>
+        <_>
+          14 5 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 9 -1.</_>
+        <_>
+          2 5 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 3 3 -1.</_>
+        <_>
+          10 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 6 -1.</_>
+        <_>
+          10 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 6 -1.</_>
+        <_>
+          7 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 2 -1.</_>
+        <_>
+          3 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 7 3 -1.</_>
+        <_>
+          8 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 3 -1.</_>
+        <_>
+          13 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 12 -1.</_>
+        <_>
+          8 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 14 -1.</_>
+        <_>
+          5 4 4 7 2.</_>
+        <_>
+          9 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 8 -1.</_>
+        <_>
+          10 1 10 4 2.</_>
+        <_>
+          0 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 2 -1.</_>
+        <_>
+          4 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 8 -1.</_>
+        <_>
+          0 1 10 4 2.</_>
+        <_>
+          10 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 2 -1.</_>
+        <_>
+          4 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 3 -1.</_>
+        <_>
+          9 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 10 6 -1.</_>
+        <_>
+          8 15 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 3 -1.</_>
+        <_>
+          8 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 1 -1.</_>
+        <_>
+          8 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 9 2 -1.</_>
+        <_>
+          14 18 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 7 -1.</_>
+        <_>
+          13 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 10 -1.</_>
+        <_>
+          4 6 6 5 2.</_>
+        <_>
+          10 11 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 3 -1.</_>
+        <_>
+          9 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 9 2 -1.</_>
+        <_>
+          14 18 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 8 -1.</_>
+        <_>
+          13 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 2 -1.</_>
+        <_>
+          4 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 4 -1.</_>
+        <_>
+          7 17 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 3 -1.</_>
+        <_>
+          13 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 1 -1.</_>
+        <_>
+          7 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 1 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 4 -1.</_>
+        <_>
+          0 14 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 2 -1.</_>
+        <_>
+          10 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 3 -1.</_>
+        <_>
+          5 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 2 12 -1.</_>
+        <_>
+          10 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 3 -1.</_>
+        <_>
+          0 4 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 2 3 -1.</_>
+        <_>
+          1 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 11 -1.</_>
+        <_>
+          16 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 16 -1.</_>
+        <_>
+          19 2 1 8 2.</_>
+        <_>
+          18 10 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 12 -1.</_>
+        <_>
+          3 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 2 -1.</_>
+        <_>
+          7 2 3 1 2.</_>
+        <_>
+          10 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 2 -1.</_>
+        <_>
+          16 4 4 1 2.</_>
+        <_>
+          12 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 2 -1.</_>
+        <_>
+          12 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 2 -1.</_>
+        <_>
+          0 4 4 1 2.</_>
+        <_>
+          4 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 5 -1.</_>
+        <_>
+          2 3 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 6 -1.</_>
+        <_>
+          16 5 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 3 -1.</_>
+        <_>
+          8 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 2 -1.</_>
+        <_>
+          4 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 3 -1.</_>
+        <_>
+          8 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 3 -1.</_>
+        <_>
+          7 16 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 8 -1.</_>
+        <_>
+          9 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          6 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 2 -1.</_>
+        <_>
+          12 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 13 10 -1.</_>
+        <_>
+          5 8 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 2 -1.</_>
+        <_>
+          4 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 2 -1.</_>
+        <_>
+          0 8 8 1 2.</_>
+        <_>
+          8 9 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 5 -1.</_>
+        <_>
+          11 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 13 -1.</_>
+        <_>
+          10 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 2 -1.</_>
+        <_>
+          1 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 2 1 -1.</_>
+        <_>
+          5 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 5 -1.</_>
+        <_>
+          11 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 8 -1.</_>
+        <_>
+          12 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 5 -1.</_>
+        <_>
+          8 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 8 -1.</_>
+        <_>
+          6 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 12 -1.</_>
+        <_>
+          9 7 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 3 -1.</_>
+        <_>
+          11 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 8 -1.</_>
+        <_>
+          8 11 2 4 2.</_>
+        <_>
+          10 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 11 -1.</_>
+        <_>
+          16 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 4 -1.</_>
+        <_>
+          18 2 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 2 -1.</_>
+        <_>
+          5 6 3 1 2.</_>
+        <_>
+          8 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 3 -1.</_>
+        <_>
+          5 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 14 -1.</_>
+        <_>
+          11 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 3 -1.</_>
+        <_>
+          8 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 14 -1.</_>
+        <_>
+          7 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 2 -1.</_>
+        <_>
+          9 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          8 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 10 -1.</_>
+        <_>
+          9 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 4 -1.</_>
+        <_>
+          9 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 11 -1.</_>
+        <_>
+          8 5 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 5 -1.</_>
+        <_>
+          11 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 5 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 5 -1.</_>
+        <_>
+          8 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 3 -1.</_>
+        <_>
+          9 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 7 -1.</_>
+        <_>
+          11 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 12 -1.</_>
+        <_>
+          0 9 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 1 -1.</_>
+        <_>
+          7 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 3 2 -1.</_>
+        <_>
+          13 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 6 -1.</_>
+        <_>
+          16 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 3 -1.</_>
+        <_>
+          7 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 7 3 -1.</_>
+        <_>
+          6 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 6 -1.</_>
+        <_>
+          11 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 14 1 3 -1.</_>
+        <_>
+          19 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 6 -1.</_>
+        <_>
+          3 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 9 1 -1.</_>
+        <_>
+          3 19 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 6 -1.</_>
+        <_>
+          11 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          12 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 6 -1.</_>
+        <_>
+          1 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 2 -1.</_>
+        <_>
+          9 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 4 -1.</_>
+        <_>
+          18 2 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 3 -1.</_>
+        <_>
+          16 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 4 -1.</_>
+        <_>
+          1 2 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 3 -1.</_>
+        <_>
+          2 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 2 -1.</_>
+        <_>
+          10 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 2 -1.</_>
+        <_>
+          12 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 2 -1.</_>
+        <_>
+          9 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 2 -1.</_>
+        <_>
+          7 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 3 -1.</_>
+        <_>
+          10 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 6 2 -1.</_>
+        <_>
+          13 16 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 2 2 -1.</_>
+        <_>
+          8 12 1 1 2.</_>
+        <_>
+          9 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 3 5 -1.</_>
+        <_>
+          9 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 12 -1.</_>
+        <_>
+          8 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 8 -1.</_>
+        <_>
+          7 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 2 -1.</_>
+        <_>
+          0 12 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 2 -1.</_>
+        <_>
+          8 11 1 1 2.</_>
+        <_>
+          9 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 1 -1.</_>
+        <_>
+          11 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 2 -1.</_>
+        <_>
+          11 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 1 -1.</_>
+        <_>
+          5 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 2 -1.</_>
+        <_>
+          6 5 4 1 2.</_>
+        <_>
+          10 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 10 -1.</_>
+        <_>
+          10 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 4 -1.</_>
+        <_>
+          16 0 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 10 -1.</_>
+        <_>
+          9 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 2 3 -1.</_>
+        <_>
+          9 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          10 9 2 1 2.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 1 -1.</_>
+        <_>
+          7 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 4 -1.</_>
+        <_>
+          3 0 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          12 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 2 9 -1.</_>
+        <_>
+          3 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 3 2 -1.</_>
+        <_>
+          14 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 3 2 -1.</_>
+        <_>
+          15 3 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 5 2 -1.</_>
+        <_>
+          2 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 12 10 -1.</_>
+        <_>
+          3 4 6 5 2.</_>
+        <_>
+          9 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 6 -1.</_>
+        <_>
+          5 3 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 2 -1.</_>
+        <_>
+          15 4 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 11 1 1 2.</_>
+        <_>
+          8 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 6 6 -1.</_>
+        <_>
+          2 16 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 3 -1.</_>
+        <_>
+          6 14 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 6 -1.</_>
+        <_>
+          8 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 15 -1.</_>
+        <_>
+          0 5 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 8 -1.</_>
+        <_>
+          3 4 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 12 -1.</_>
+        <_>
+          6 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 3 -1.</_>
+        <_>
+          6 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 4 -1.</_>
+        <_>
+          6 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 4 6 -1.</_>
+        <_>
+          17 14 2 3 2.</_>
+        <_>
+          15 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 8 -1.</_>
+        <_>
+          15 11 3 4 2.</_>
+        <_>
+          12 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 4 -1.</_>
+        <_>
+          9 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 1 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 14 -1.</_>
+        <_>
+          12 3 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 2 -1.</_>
+        <_>
+          15 11 3 1 2.</_>
+        <_>
+          12 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 2 -1.</_>
+        <_>
+          0 3 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 1 -1.</_>
+        <_>
+          5 0 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 2 -1.</_>
+        <_>
+          15 11 3 1 2.</_>
+        <_>
+          12 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 2 2 -1.</_>
+        <_>
+          10 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 10 -1.</_>
+        <_>
+          9 0 1 5 2.</_>
+        <_>
+          10 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 2 -1.</_>
+        <_>
+          18 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 4 9 -1.</_>
+        <_>
+          13 14 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 2 2 -1.</_>
+        <_>
+          8 13 1 1 2.</_>
+        <_>
+          9 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 3 -1.</_>
+        <_>
+          7 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          8 10 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 2 -1.</_>
+        <_>
+          13 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 2 -1.</_>
+        <_>
+          6 14 1 1 2.</_>
+        <_>
+          7 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 2 -1.</_>
+        <_>
+          0 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 6 -1.</_>
+        <_>
+          7 11 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 4 -1.</_>
+        <_>
+          6 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 11 -1.</_>
+        <_>
+          10 9 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 4 3 -1.</_>
+        <_>
+          9 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 17 -1.</_>
+        <_>
+          3 3 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 3 -1.</_>
+        <_>
+          0 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 11 9 -1.</_>
+        <_>
+          4 6 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          3 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 5 -1.</_>
+        <_>
+          13 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 4 -1.</_>
+        <_>
+          12 7 3 2 2.</_>
+        <_>
+          9 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 2 -1.</_>
+        <_>
+          9 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 1 -1.</_>
+        <_>
+          6 8 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 2 -1.</_>
+        <_>
+          8 12 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 10 -1.</_>
+        <_>
+          15 0 2 5 2.</_>
+        <_>
+          13 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 2 -1.</_>
+        <_>
+          6 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          8 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 9 2 -1.</_>
+        <_>
+          11 3 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 9 2 -1.</_>
+        <_>
+          6 3 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 14 -1.</_>
+        <_>
+          8 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 7 10 -1.</_>
+        <_>
+          7 8 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 3 -1.</_>
+        <_>
+          4 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          3 12 7 2 2.</_>
+        <_>
+          10 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 2 -1.</_>
+        <_>
+          8 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 8 -1.</_>
+        <_>
+          6 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 8 -1.</_>
+        <_>
+          9 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 3 -1.</_>
+        <_>
+          8 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 10 -1.</_>
+        <_>
+          7 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 3 3 -1.</_>
+        <_>
+          14 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 3 -1.</_>
+        <_>
+          3 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 2 -1.</_>
+        <_>
+          3 9 2 1 2.</_>
+        <_>
+          5 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 4 -1.</_>
+        <_>
+          10 11 10 2 2.</_>
+        <_>
+          0 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 4 -1.</_>
+        <_>
+          0 11 10 2 2.</_>
+        <_>
+          10 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 6 -1.</_>
+        <_>
+          10 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 2 -1.</_>
+        <_>
+          11 1 9 1 2.</_>
+        <_>
+          2 2 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 3 -1.</_>
+        <_>
+          8 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 1 -1.</_>
+        <_>
+          6 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 3 -1.</_>
+        <_>
+          11 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 12 -1.</_>
+        <_>
+          13 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 6 -1.</_>
+        <_>
+          1 16 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 1 3 -1.</_>
+        <_>
+          8 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          7 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 2 -1.</_>
+        <_>
+          9 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 3 -1.</_>
+        <_>
+          6 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 14 -1.</_>
+        <_>
+          7 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 2 -1.</_>
+        <_>
+          9 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 12 -1.</_>
+        <_>
+          1 2 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 5 3 -1.</_>
+        <_>
+          1 1 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 3 -1.</_>
+        <_>
+          5 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 3 -1.</_>
+        <_>
+          5 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          10 12 2 4 2.</_>
+        <_>
+          8 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 2 -1.</_>
+        <_>
+          11 17 9 1 2.</_>
+        <_>
+          2 18 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 2 -1.</_>
+        <_>
+          9 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 6 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 6 -1.</_>
+        <_>
+          9 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 9 -1.</_>
+        <_>
+          2 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 2 -1.</_>
+        <_>
+          7 4 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 12 4 -1.</_>
+        <_>
+          14 16 6 2 2.</_>
+        <_>
+          8 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 2 -1.</_>
+        <_>
+          0 0 9 1 2.</_>
+        <_>
+          9 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 18 -1.</_>
+        <_>
+          4 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 7 -1.</_>
+        <_>
+          14 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 2 2 -1.</_>
+        <_>
+          15 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 7 -1.</_>
+        <_>
+          4 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 2 2 -1.</_>
+        <_>
+          3 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          11 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 6 -1.</_>
+        <_>
+          15 0 1 3 2.</_>
+        <_>
+          14 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 2 -1.</_>
+        <_>
+          7 11 1 1 2.</_>
+        <_>
+          8 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 2 -1.</_>
+        <_>
+          8 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 6 -1.</_>
+        <_>
+          9 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 4 2 -1.</_>
+        <_>
+          12 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          8 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 8 2 -1.</_>
+        <_>
+          2 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          2 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 2 -1.</_>
+        <_>
+          9 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 2 4 -1.</_>
+        <_>
+          5 14 1 2 2.</_>
+        <_>
+          6 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 2 -1.</_>
+        <_>
+          8 9 2 1 2.</_>
+        <_>
+          10 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 5 -1.</_>
+        <_>
+          9 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 2 -1.</_>
+        <_>
+          10 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 2 -1.</_>
+        <_>
+          9 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 6 -1.</_>
+        <_>
+          9 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          10 12 2 4 2.</_>
+        <_>
+          8 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 16 2 -1.</_>
+        <_>
+          10 17 8 1 2.</_>
+        <_>
+          2 18 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          9 12 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 1 3 -1.</_>
+        <_>
+          3 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 3 6 -1.</_>
+        <_>
+          14 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 2 -1.</_>
+        <_>
+          7 10 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 16 3 -1.</_>
+        <_>
+          4 18 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 9 -1.</_>
+        <_>
+          8 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 4 -1.</_>
+        <_>
+          9 16 1 2 2.</_>
+        <_>
+          10 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 8 -1.</_>
+        <_>
+          5 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 2 -1.</_>
+        <_>
+          13 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 6 -1.</_>
+        <_>
+          14 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 1 -1.</_>
+        <_>
+          9 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          9 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 3 -1.</_>
+        <_>
+          13 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          8 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 3 -1.</_>
+        <_>
+          6 9 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 1 3 -1.</_>
+        <_>
+          10 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 4 -1.</_>
+        <_>
+          10 9 3 2 2.</_>
+        <_>
+          7 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 2 -1.</_>
+        <_>
+          4 7 1 1 2.</_>
+        <_>
+          5 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 1 -1.</_>
+        <_>
+          6 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 3 -1.</_>
+        <_>
+          18 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 2 -1.</_>
+        <_>
+          13 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 4 2 -1.</_>
+        <_>
+          5 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 5 2 -1.</_>
+        <_>
+          3 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 4 -1.</_>
+        <_>
+          17 7 3 2 2.</_>
+        <_>
+          14 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 2 -1.</_>
+        <_>
+          4 9 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 5 6 -1.</_>
+        <_>
+          2 13 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 4 -1.</_>
+        <_>
+          5 16 1 2 2.</_>
+        <_>
+          6 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 12 -1.</_>
+        <_>
+          16 6 1 6 2.</_>
+        <_>
+          15 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 16 -1.</_>
+        <_>
+          15 3 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          4 5 6 6 2.</_>
+        <_>
+          10 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 13 -1.</_>
+        <_>
+          10 1 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 2 -1.</_>
+        <_>
+          12 5 1 1 2.</_>
+        <_>
+          11 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 3 -1.</_>
+        <_>
+          13 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 4 -1.</_>
+        <_>
+          7 4 1 2 2.</_>
+        <_>
+          8 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          10 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 6 -1.</_>
+        <_>
+          14 4 2 3 2.</_>
+        <_>
+          12 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 6 -1.</_>
+        <_>
+          7 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 2 -1.</_>
+        <_>
+          16 6 1 1 2.</_>
+        <_>
+          15 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 4 -1.</_>
+        <_>
+          16 7 2 2 2.</_>
+        <_>
+          14 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 2 -1.</_>
+        <_>
+          7 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          7 19 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 3 -1.</_>
+        <_>
+          12 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 3 -1.</_>
+        <_>
+          16 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 3 -1.</_>
+        <_>
+          5 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 3 -1.</_>
+        <_>
+          2 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 2 -1.</_>
+        <_>
+          16 6 1 1 2.</_>
+        <_>
+          15 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 6 -1.</_>
+        <_>
+          10 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 2 -1.</_>
+        <_>
+          0 7 5 1 2.</_>
+        <_>
+          5 8 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 2 -1.</_>
+        <_>
+          3 11 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 4 2 -1.</_>
+        <_>
+          12 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 2 2 -1.</_>
+        <_>
+          13 18 1 1 2.</_>
+        <_>
+          12 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 2 1 -1.</_>
+        <_>
+          7 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 16 -1.</_>
+        <_>
+          0 4 1 8 2.</_>
+        <_>
+          1 12 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 9 -1.</_>
+        <_>
+          16 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 1 2 -1.</_>
+        <_>
+          10 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 6 -1.</_>
+        <_>
+          4 14 2 3 2.</_>
+        <_>
+          6 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 1 4 -1.</_>
+        <_>
+          4 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          10 2 10 2 2.</_>
+        <_>
+          0 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 8 -1.</_>
+        <_>
+          14 9 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 5 -1.</_>
+        <_>
+          7 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 11 3 -1.</_>
+        <_>
+          9 15 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 7 3 -1.</_>
+        <_>
+          7 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 7 -1.</_>
+        <_>
+          7 7 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 3 -1.</_>
+        <_>
+          14 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 3 -1.</_>
+        <_>
+          13 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 4 -1.</_>
+        <_>
+          2 7 2 2 2.</_>
+        <_>
+          4 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 13 6 -1.</_>
+        <_>
+          2 12 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 4 -1.</_>
+        <_>
+          11 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 5 2 -1.</_>
+        <_>
+          9 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 11 3 -1.</_>
+        <_>
+          0 15 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 8 -1.</_>
+        <_>
+          8 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 14 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 15 5 -1.</_>
+        <_>
+          10 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 1 10 -1.</_>
+        <_>
+          8 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 2 -1.</_>
+        <_>
+          6 14 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 7 3 -1.</_>
+        <_>
+          7 15 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 9 3 -1.</_>
+        <_>
+          7 17 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 6 -1.</_>
+        <_>
+          3 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 11 2 -1.</_>
+        <_>
+          6 6 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 2 -1.</_>
+        <_>
+          10 0 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 1 3 -1.</_>
+        <_>
+          5 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 2 -1.</_>
+        <_>
+          9 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 6 -1.</_>
+        <_>
+          10 2 5 3 2.</_>
+        <_>
+          5 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 4 -1.</_>
+        <_>
+          9 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          9 13 1 3 2.</_>
+        <_>
+          10 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 1 -1.</_>
+        <_>
+          10 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 15 -1.</_>
+        <_>
+          2 10 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 2 -1.</_>
+        <_>
+          4 3 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 2 -1.</_>
+        <_>
+          9 6 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          8 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 3 -1.</_>
+        <_>
+          10 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 4 -1.</_>
+        <_>
+          0 12 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 4 -1.</_>
+        <_>
+          5 7 3 2 2.</_>
+        <_>
+          8 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 2 3 -1.</_>
+        <_>
+          10 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 2 -1.</_>
+        <_>
+          9 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 1 10 -1.</_>
+        <_>
+          4 9 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 2 -1.</_>
+        <_>
+          11 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 3 2 -1.</_>
+        <_>
+          12 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 6 -1.</_>
+        <_>
+          0 6 8 3 2.</_>
+        <_>
+          8 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 2 -1.</_>
+        <_>
+          11 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 3 2 -1.</_>
+        <_>
+          12 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 2 -1.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 1 3 -1.</_>
+        <_>
+          8 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 2 -1.</_>
+        <_>
+          11 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 6 -1.</_>
+        <_>
+          14 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 4 -1.</_>
+        <_>
+          7 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 8 -1.</_>
+        <_>
+          4 0 1 4 2.</_>
+        <_>
+          5 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 9 3 -1.</_>
+        <_>
+          14 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 5 -1.</_>
+        <_>
+          16 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 2 -1.</_>
+        <_>
+          8 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 9 3 -1.</_>
+        <_>
+          14 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 5 -1.</_>
+        <_>
+          16 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 3 -1.</_>
+        <_>
+          3 17 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 5 -1.</_>
+        <_>
+          2 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 9 -1.</_>
+        <_>
+          5 14 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 3 -1.</_>
+        <_>
+          9 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 5 3 -1.</_>
+        <_>
+          3 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 7 -1.</_>
+        <_>
+          9 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 5 -1.</_>
+        <_>
+          9 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 2 -1.</_>
+        <_>
+          2 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 6 -1.</_>
+        <_>
+          7 8 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 5 -1.</_>
+        <_>
+          10 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 6 -1.</_>
+        <_>
+          12 12 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 2 -1.</_>
+        <_>
+          14 4 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 3 -1.</_>
+        <_>
+          5 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 3 -1.</_>
+        <_>
+          4 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 3 -1.</_>
+        <_>
+          14 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 11 3 -1.</_>
+        <_>
+          6 13 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 6 -1.</_>
+        <_>
+          1 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          3 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 4 -1.</_>
+        <_>
+          10 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 2 -1.</_>
+        <_>
+          10 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          9 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 10 -1.</_>
+        <_>
+          4 9 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 2 -1.</_>
+        <_>
+          10 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 2 -1.</_>
+        <_>
+          9 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 2 -1.</_>
+        <_>
+          9 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 12 -1.</_>
+        <_>
+          2 4 7 6 2.</_>
+        <_>
+          9 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 1 6 -1.</_>
+        <_>
+          10 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 8 16 -1.</_>
+        <_>
+          11 3 4 8 2.</_>
+        <_>
+          7 11 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 10 -1.</_>
+        <_>
+          5 6 4 5 2.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 8 -1.</_>
+        <_>
+          6 2 4 4 2.</_>
+        <_>
+          10 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 2 -1.</_>
+        <_>
+          12 5 2 1 2.</_>
+        <_>
+          10 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 3 -1.</_>
+        <_>
+          12 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 12 1 -1.</_>
+        <_>
+          8 19 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 1 -1.</_>
+        <_>
+          9 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 4 3 -1.</_>
+        <_>
+          13 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 3 -1.</_>
+        <_>
+          7 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 3 -1.</_>
+        <_>
+          14 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 6 -1.</_>
+        <_>
+          4 12 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 2 -1.</_>
+        <_>
+          4 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 3 -1.</_>
+        <_>
+          9 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 3 2 -1.</_>
+        <_>
+          11 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 2 -1.</_>
+        <_>
+          1 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 3 -1.</_>
+        <_>
+          12 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 1 3 -1.</_>
+        <_>
+          14 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 3 -1.</_>
+        <_>
+          2 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 1 3 -1.</_>
+        <_>
+          5 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 3 -1.</_>
+        <_>
+          14 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 3 -1.</_>
+        <_>
+          15 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 3 -1.</_>
+        <_>
+          3 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 2 -1.</_>
+        <_>
+          8 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 1 -1.</_>
+        <_>
+          0 0 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 4 -1.</_>
+        <_>
+          10 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 1 -1.</_>
+        <_>
+          10 0 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 4 -1.</_>
+        <_>
+          9 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 19 3 -1.</_>
+        <_>
+          1 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 2 -1.</_>
+        <_>
+          12 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 3 -1.</_>
+        <_>
+          7 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 3 -1.</_>
+        <_>
+          8 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          2 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 12 -1.</_>
+        <_>
+          9 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 5 -1.</_>
+        <_>
+          8 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 4 3 -1.</_>
+        <_>
+          9 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 4 -1.</_>
+        <_>
+          10 8 3 2 2.</_>
+        <_>
+          7 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 2 -1.</_>
+        <_>
+          10 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 6 -1.</_>
+        <_>
+          7 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 6 -1.</_>
+        <_>
+          10 1 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 2 -1.</_>
+        <_>
+          8 5 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 4 -1.</_>
+        <_>
+          6 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 2 -1.</_>
+        <_>
+          4 8 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 6 -1.</_>
+        <_>
+          10 6 7 3 2.</_>
+        <_>
+          3 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 3 -1.</_>
+        <_>
+          3 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 2 -1.</_>
+        <_>
+          0 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 3 -1.</_>
+        <_>
+          8 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 20 -1.</_>
+        <_>
+          14 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 3 -1.</_>
+        <_>
+          10 9 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 20 -1.</_>
+        <_>
+          5 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 10 3 -1.</_>
+        <_>
+          0 9 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 4 -1.</_>
+        <_>
+          13 5 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 4 -1.</_>
+        <_>
+          10 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 6 -1.</_>
+        <_>
+          1 14 3 3 2.</_>
+        <_>
+          4 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 2 -1.</_>
+        <_>
+          1 18 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          17 8 3 6 2.</_>
+        <_>
+          14 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 2 -1.</_>
+        <_>
+          18 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 2 -1.</_>
+        <_>
+          3 16 2 1 2.</_>
+        <_>
+          5 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 2 -1.</_>
+        <_>
+          4 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          17 8 3 6 2.</_>
+        <_>
+          14 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 2 -1.</_>
+        <_>
+          18 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 9 2 -1.</_>
+        <_>
+          8 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 6 6 -1.</_>
+        <_>
+          3 14 3 3 2.</_>
+        <_>
+          6 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          17 8 3 6 2.</_>
+        <_>
+          14 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 12 -1.</_>
+        <_>
+          11 11 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          0 8 3 6 2.</_>
+        <_>
+          3 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 12 -1.</_>
+        <_>
+          7 11 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 1 2 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 1 -1.</_>
+        <_>
+          12 13 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 16 6 -1.</_>
+        <_>
+          0 6 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 2 -1.</_>
+        <_>
+          1 4 4 1 2.</_>
+        <_>
+          5 5 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 1 2 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 3 -1.</_>
+        <_>
+          15 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 3 -1.</_>
+        <_>
+          8 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 1 2 -1.</_>
+        <_>
+          5 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 15 -1.</_>
+        <_>
+          14 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 2 6 -1.</_>
+        <_>
+          18 3 1 3 2.</_>
+        <_>
+          17 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 15 -1.</_>
+        <_>
+          5 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 2 6 -1.</_>
+        <_>
+          1 3 1 3 2.</_>
+        <_>
+          2 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 12 4 -1.</_>
+        <_>
+          7 17 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 19 3 -1.</_>
+        <_>
+          1 1 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 10 2 -1.</_>
+        <_>
+          3 17 5 1 2.</_>
+        <_>
+          8 18 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 10 15 -1.</_>
+        <_>
+          2 10 10 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 4 -1.</_>
+        <_>
+          13 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 13 1 2 -1.</_>
+        <_>
+          19 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 4 -1.</_>
+        <_>
+          4 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 1 2 -1.</_>
+        <_>
+          0 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 12 -1.</_>
+        <_>
+          12 13 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 2 2 -1.</_>
+        <_>
+          15 7 1 1 2.</_>
+        <_>
+          14 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 8 2 -1.</_>
+        <_>
+          5 4 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 6 -1.</_>
+        <_>
+          0 4 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 12 -1.</_>
+        <_>
+          19 2 1 6 2.</_>
+        <_>
+          18 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 1 2 -1.</_>
+        <_>
+          18 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 12 -1.</_>
+        <_>
+          0 2 1 6 2.</_>
+        <_>
+          1 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 1 2 -1.</_>
+        <_>
+          1 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 14 -1.</_>
+        <_>
+          18 4 2 7 2.</_>
+        <_>
+          16 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 6 -1.</_>
+        <_>
+          10 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 14 -1.</_>
+        <_>
+          0 4 2 7 2.</_>
+        <_>
+          2 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 6 -1.</_>
+        <_>
+          9 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 4 3 -1.</_>
+        <_>
+          9 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          8 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 3 -1.</_>
+        <_>
+          0 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 2 -1.</_>
+        <_>
+          4 7 1 1 2.</_>
+        <_>
+          5 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 5 -1.</_>
+        <_>
+          11 4 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 3 -1.</_>
+        <_>
+          5 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 1 -1.</_>
+        <_>
+          4 3 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 1 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 2 -1.</_>
+        <_>
+          15 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 1 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 2 -1.</_>
+        <_>
+          4 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 2 -1.</_>
+        <_>
+          18 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 2 -1.</_>
+        <_>
+          13 14 1 1 2.</_>
+        <_>
+          12 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 2 -1.</_>
+        <_>
+          0 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 2 -1.</_>
+        <_>
+          6 14 1 1 2.</_>
+        <_>
+          7 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 5 -1.</_>
+        <_>
+          9 12 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 5 2 -1.</_>
+        <_>
+          12 18 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 3 -1.</_>
+        <_>
+          4 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 3 -1.</_>
+        <_>
+          4 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 12 -1.</_>
+        <_>
+          12 13 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 3 -1.</_>
+        <_>
+          8 8 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 12 -1.</_>
+        <_>
+          6 13 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 9 18 -1.</_>
+        <_>
+          4 2 3 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 5 2 -1.</_>
+        <_>
+          12 18 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          4 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 1 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 2 -1.</_>
+        <_>
+          8 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 1 -1.</_>
+        <_>
+          10 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 1 -1.</_>
+        <_>
+          12 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 1 -1.</_>
+        <_>
+          9 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 1 -1.</_>
+        <_>
+          7 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 6 -1.</_>
+        <_>
+          12 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 1 6 -1.</_>
+        <_>
+          14 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 6 6 -1.</_>
+        <_>
+          2 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 1 -1.</_>
+        <_>
+          7 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 2 -1.</_>
+        <_>
+          10 7 6 1 2.</_>
+        <_>
+          4 8 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 10 -1.</_>
+        <_>
+          10 1 4 5 2.</_>
+        <_>
+          6 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 3 -1.</_>
+        <_>
+          3 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 4 3 -1.</_>
+        <_>
+          6 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 4 3 -1.</_>
+        <_>
+          9 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 3 -1.</_>
+        <_>
+          12 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 3 -1.</_>
+        <_>
+          7 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 1 -1.</_>
+        <_>
+          10 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 5 -1.</_>
+        <_>
+          5 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 7 -1.</_>
+        <_>
+          6 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 5 -1.</_>
+        <_>
+          10 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 7 -1.</_>
+        <_>
+          10 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          10 9 5 4 2.</_>
+        <_>
+          5 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 10 -1.</_>
+        <_>
+          12 0 2 5 2.</_>
+        <_>
+          10 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 3 -1.</_>
+        <_>
+          1 5 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 8 3 -1.</_>
+        <_>
+          4 5 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 3 -1.</_>
+        <_>
+          9 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 12 -1.</_>
+        <_>
+          12 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 3 -1.</_>
+        <_>
+          7 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 12 -1.</_>
+        <_>
+          5 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 6 -1.</_>
+        <_>
+          10 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 1 -1.</_>
+        <_>
+          8 1 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 8 -1.</_>
+        <_>
+          6 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 2 -1.</_>
+        <_>
+          4 8 4 1 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt_tree.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt_tree.xml
new file mode 100644
index 000000000..e0420a274
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_alt_tree.xml
@@ -0,0 +1,96484 @@
+<?xml version="1.0"?>
+<!--
+    Stump-based 20x20 gentle adaboost frontal face detector.
+    This detector uses tree of stage classifiers instead of a cascade
+    Created by Rainer Lienhart.
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>406</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>47</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>3</maxWeakCount>
+      <stageThreshold>-1.3442519903182983e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 3.7895569112151861e-03</internalNodes>
+          <leafValues>
+            -9.2945802211761475e-01 6.4119851589202881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 1.2098110280930996e-02</internalNodes>
+          <leafValues>
+            -7.1810090541839600e-01 4.7141009569168091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 1.2138449819758534e-03</internalNodes>
+          <leafValues>
+            -7.2831612825393677e-01 3.0330690741539001e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.6378560066223145e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3 8.7510552257299423e-03</internalNodes>
+          <leafValues>
+            -8.5947072505950928e-01 3.6881381273269653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 2.1986700594425201e-02</internalNodes>
+          <leafValues>
+            -6.0180151462554932e-01 3.2897830009460449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 6.4913398819044232e-04</internalNodes>
+          <leafValues>
+            -7.9431951045989990e-01 2.5493299961090088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 -1.0192029876634479e-03</internalNodes>
+          <leafValues>
+            2.2729329764842987e-01 -6.3627982139587402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.3674780493602157e-03</internalNodes>
+          <leafValues>
+            -6.0014182329177856e-01 2.4118369817733765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 1.0245250305160880e-03</internalNodes>
+          <leafValues>
+            -5.8542472124099731e-01 1.2550109624862671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 1.8465859815478325e-02</internalNodes>
+          <leafValues>
+            1.9563560187816620e-01 -6.7630231380462646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 4.0901508182287216e-03</internalNodes>
+          <leafValues>
+            -4.4916498661041260e-01 2.6677688956260681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 1.1358099989593029e-02</internalNodes>
+          <leafValues>
+            1.8783229589462280e-01 -6.1379361152648926e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-1.7317579984664917e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 12 -1.1588949710130692e-02</internalNodes>
+          <leafValues>
+            3.4567040205001831e-01 -7.6478981971740723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 5.1809530705213547e-03</internalNodes>
+          <leafValues>
+            2.4104920029640198e-01 -6.9623559713363647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 2.1468549966812134e-03</internalNodes>
+          <leafValues>
+            -8.0553662776947021e-01 1.9838610291481018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -3.6556499544531107e-03</internalNodes>
+          <leafValues>
+            -7.1833139657974243e-01 1.2305679917335510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 -1.9701640121638775e-03</internalNodes>
+          <leafValues>
+            2.2777689993381500e-01 -4.7520169615745544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -3.3645539078861475e-03</internalNodes>
+          <leafValues>
+            -4.6095049381256104e-01 2.0394650101661682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -7.4126059189438820e-05</internalNodes>
+          <leafValues>
+            1.8213239312171936e-01 -4.7829270362854004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -1.7571110278367996e-02</internalNodes>
+          <leafValues>
+            -7.1737551689147949e-01 1.1311130225658417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 6.3840472139418125e-03</internalNodes>
+          <leafValues>
+            -4.0205681324005127e-01 2.0730289816856384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -1.4723399654030800e-02</internalNodes>
+          <leafValues>
+            -6.7558771371841431e-01 6.8973086774349213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -5.2889222279191017e-03</internalNodes>
+          <leafValues>
+            -6.2105172872543335e-01 1.3349360227584839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 2.7743630111217499e-02</internalNodes>
+          <leafValues>
+            1.1760850250720978e-01 -5.4641121625900269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 3.9427559822797775e-02</internalNodes>
+          <leafValues>
+            -2.1134279668331146e-01 3.9452999830245972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 8.6949411779642105e-03</internalNodes>
+          <leafValues>
+            1.2580950558185577e-01 -4.7989100217819214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 2.8245279099792242e-03</internalNodes>
+          <leafValues>
+            1.9653140008449554e-01 -4.0256679058074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 -2.8915189206600189e-02</internalNodes>
+          <leafValues>
+            -8.0616527795791626e-01 8.1882260739803314e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>29</maxWeakCount>
+      <stageThreshold>-1.9308480024337769e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 28 8.0171944573521614e-03</internalNodes>
+          <leafValues>
+            -6.8981552124023438e-01 2.4136860668659210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -2.4478728882968426e-03</internalNodes>
+          <leafValues>
+            2.1353200078010559e-01 -6.4146691560745239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 1.7917619552463293e-03</internalNodes>
+          <leafValues>
+            -6.1445468664169312e-01 1.9236929714679718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 4.3905500206165016e-04</internalNodes>
+          <leafValues>
+            -7.5360429286956787e-01 1.5696890652179718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -3.6769549478776753e-04</internalNodes>
+          <leafValues>
+            1.7380510270595551e-01 -5.8404499292373657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -4.2802388779819012e-03</internalNodes>
+          <leafValues>
+            -6.6968989372253418e-01 1.1289729923009872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 3.5238768905401230e-03</internalNodes>
+          <leafValues>
+            1.2501940131187439e-01 -7.3299217224121094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 7.9299701610580087e-04</internalNodes>
+          <leafValues>
+            -4.4966199994087219e-01 2.1590930223464966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 4.4371088733896613e-04</internalNodes>
+          <leafValues>
+            -3.8909769058227539e-01 2.1181149780750275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -2.7145470958203077e-03</internalNodes>
+          <leafValues>
+            -4.6716868877410889e-01 1.5038399398326874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -6.9272058317437768e-04</internalNodes>
+          <leafValues>
+            -5.8596551418304443e-01 1.1714380234479904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 4.9261808395385742e-02</internalNodes>
+          <leafValues>
+            -1.3800150156021118e-01 4.9366238713264465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -2.2837519645690918e-02</internalNodes>
+          <leafValues>
+            -6.3743507862091064e-01 1.2324090301990509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 4.8372112214565277e-03</internalNodes>
+          <leafValues>
+            -1.2391629815101624e-01 1.0620889812707901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 1.0256259702146053e-02</internalNodes>
+          <leafValues>
+            -1.8767049908638000e-01 2.9824170470237732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 1.0618680156767368e-02</internalNodes>
+          <leafValues>
+            1.0612460225820541e-01 -3.3244881033897400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 2.4113139137625694e-02</internalNodes>
+          <leafValues>
+            8.7200611829757690e-02 -6.6846621036529541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 -3.6754710599780083e-03</internalNodes>
+          <leafValues>
+            1.1043280363082886e-01 -4.4581958651542664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -3.8996201008558273e-02</internalNodes>
+          <leafValues>
+            -7.0228111743927002e-01 8.1809490919113159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 1.5777100343257189e-03</internalNodes>
+          <leafValues>
+            1.5954199433326721e-01 -3.2860770821571350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 9.1089410707354546e-03</internalNodes>
+          <leafValues>
+            1.0326369851827621e-01 -4.4402560591697693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 -1.7051609233021736e-02</internalNodes>
+          <leafValues>
+            -5.5853348970413208e-01 6.2711499631404877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 1.3652660418301821e-03</internalNodes>
+          <leafValues>
+            -5.3934460878372192e-01 7.0839896798133850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 -1.1186149902641773e-02</internalNodes>
+          <leafValues>
+            -4.7260180115699768e-01 8.1019416451454163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 -1.1705270037055016e-02</internalNodes>
+          <leafValues>
+            2.4750089645385742e-01 -1.7778989672660828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -9.7736932337284088e-02</internalNodes>
+          <leafValues>
+            -5.6177508831024170e-01 8.0921821296215057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 -8.5228063166141510e-02</internalNodes>
+          <leafValues>
+            -5.2233248949050903e-01 7.2821393609046936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -3.6733459681272507e-02</internalNodes>
+          <leafValues>
+            4.3623578548431396e-01 -9.9339507520198822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 -3.6704430822283030e-03</internalNodes>
+          <leafValues>
+            1.4834220707416534e-01 -2.7119669318199158e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>36</maxWeakCount>
+      <stageThreshold>-2.0711259841918945e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 57 -1.1610370129346848e-03</internalNodes>
+          <leafValues>
+            -5.6377887725830078e-01 2.3568780720233917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 1.1830299627035856e-03</internalNodes>
+          <leafValues>
+            1.5724280476570129e-01 -6.7728179693222046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -2.1273950114846230e-03</internalNodes>
+          <leafValues>
+            -6.6150152683258057e-01 1.4943139255046844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -1.1893469840288162e-01</internalNodes>
+          <leafValues>
+            5.3225821256637573e-01 -2.2968369722366333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -1.3624870218336582e-02</internalNodes>
+          <leafValues>
+            -6.0635501146316528e-01 1.7001089453697205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -6.3198682619258761e-04</internalNodes>
+          <leafValues>
+            -6.8972241878509521e-01 1.1584629863500595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -4.4108428992331028e-03</internalNodes>
+          <leafValues>
+            -6.2967002391815186e-01 1.2430600076913834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -2.2982239723205566e-02</internalNodes>
+          <leafValues>
+            -5.0497251749038696e-01 1.6636120155453682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -2.3721898905932903e-03</internalNodes>
+          <leafValues>
+            -6.2462240457534790e-01 1.3793750107288361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 8.7364763021469116e-03</internalNodes>
+          <leafValues>
+            1.3996620476245880e-01 -5.4822951555252075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 6.7737072706222534e-02</internalNodes>
+          <leafValues>
+            -1.9172480702400208e-01 5.4700487852096558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -4.0138149634003639e-03</internalNodes>
+          <leafValues>
+            -5.5429118871688843e-01 1.4517059922218323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 1.2857170077040792e-04</internalNodes>
+          <leafValues>
+            -5.1031237840652466e-01 1.1023940145969391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -3.9688948541879654e-02</internalNodes>
+          <leafValues>
+            -6.1830729246139526e-01 9.6676096320152283e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -1.6646150033921003e-03</internalNodes>
+          <leafValues>
+            1.6449889540672302e-01 -3.7186318635940552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 5.3499247878789902e-03</internalNodes>
+          <leafValues>
+            1.1145050078630447e-01 -3.7441021203994751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -2.2904010489583015e-02</internalNodes>
+          <leafValues>
+            -5.8097589015960693e-01 1.1077260226011276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 1.0703450068831444e-02</internalNodes>
+          <leafValues>
+            4.4733259826898575e-02 -5.8116632699966431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 -4.2331559234298766e-04</internalNodes>
+          <leafValues>
+            -5.4423791170120239e-01 8.7089292705059052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 1.5554429963231087e-02</internalNodes>
+          <leafValues>
+            5.6884340941905975e-02 -3.7645170092582703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -2.0539449527859688e-02</internalNodes>
+          <leafValues>
+            -3.8714569807052612e-01 1.1833839863538742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -3.1234358903020620e-03</internalNodes>
+          <leafValues>
+            8.3635427057743073e-02 -1.9862389564514160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 2.3932829499244690e-02</internalNodes>
+          <leafValues>
+            7.9600542783737183e-02 -6.5370100736618042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 8.3920456469058990e-02</internalNodes>
+          <leafValues>
+            -1.0653129965066910e-01 4.8772820830345154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 1.6003159806132317e-02</internalNodes>
+          <leafValues>
+            8.3643212914466858e-02 -5.9207731485366821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 5.8071441017091274e-03</internalNodes>
+          <leafValues>
+            8.7997503578662872e-02 -3.3279138803482056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -8.1104427576065063e-02</internalNodes>
+          <leafValues>
+            6.3775187730789185e-01 -6.7692361772060394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 4.5403029769659042e-02</internalNodes>
+          <leafValues>
+            -5.1510389894247055e-02 3.0225670337677002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.3877229765057564e-02</internalNodes>
+          <leafValues>
+            9.9967628717422485e-02 -4.6520909667015076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 3.4590709954500198e-02</internalNodes>
+          <leafValues>
+            -9.7614437341690063e-02 3.4678751230239868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 1.5704549849033356e-02</internalNodes>
+          <leafValues>
+            7.6344117522239685e-02 -5.3356319665908813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -1.0420549660921097e-01</internalNodes>
+          <leafValues>
+            6.1890971660614014e-01 -4.4259760528802872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 1.3443189859390259e-01</internalNodes>
+          <leafValues>
+            -5.9853021055459976e-02 6.3635712862014771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -2.5646309368312359e-03</internalNodes>
+          <leafValues>
+            -5.3600472211837769e-01 7.3116026818752289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 1.8647089600563049e-02</internalNodes>
+          <leafValues>
+            6.9856151938438416e-02 -5.6878322362899780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 1.5159539878368378e-02</internalNodes>
+          <leafValues>
+            1.8206339329481125e-02 -2.7663159370422363e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>7</maxWeakCount>
+      <stageThreshold>-2.1360809803009033e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 93 1.4778429269790649e-01</internalNodes>
+          <leafValues>
+            -8.9933121204376221e-01 5.7035928964614868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 2.9984670877456665e-01</internalNodes>
+          <leafValues>
+            -6.5394151210784912e-01 3.5054451227188110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 -7.9061716794967651e-02</internalNodes>
+          <leafValues>
+            4.4085291028022766e-01 -6.5087568759918213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 5.8428961783647537e-02</internalNodes>
+          <leafValues>
+            -4.2665359377861023e-01 5.8410567045211792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -1.4664280228316784e-02</internalNodes>
+          <leafValues>
+            3.2435241341590881e-01 -5.9659618139266968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 3.9517199993133545e-01</internalNodes>
+          <leafValues>
+            -7.5798347592353821e-02 4.8659950494766235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 1.1040589958429337e-01</internalNodes>
+          <leafValues>
+            -8.4556102752685547e-01 2.1374569833278656e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>50</maxWeakCount>
+      <stageThreshold>-1.8755869865417480e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 100 3.7777079269289970e-03</internalNodes>
+          <leafValues>
+            1.8744400143623352e-01 -6.5354061126708984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 5.3003188222646713e-03</internalNodes>
+          <leafValues>
+            9.3951843678951263e-02 -5.6917887926101685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 -5.5426009930670261e-03</internalNodes>
+          <leafValues>
+            1.6031709313392639e-01 -5.1822239160537720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 -9.1971885412931442e-03</internalNodes>
+          <leafValues>
+            -5.7420462369918823e-01 1.4791400730609894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 5.3701602155342698e-04</internalNodes>
+          <leafValues>
+            -7.0449697971343994e-01 1.0752149671316147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 -2.2125479299575090e-03</internalNodes>
+          <leafValues>
+            -5.0877428054809570e-01 1.1367189884185791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 1.1675730347633362e-02</internalNodes>
+          <leafValues>
+            8.4258683025836945e-02 -6.7384701967239380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 -2.0404369570314884e-03</internalNodes>
+          <leafValues>
+            1.6251119971275330e-01 -4.1435649991035461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -7.6540438458323479e-03</internalNodes>
+          <leafValues>
+            -4.2833179235458374e-01 1.3060709834098816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 2.9370479285717010e-02</internalNodes>
+          <leafValues>
+            5.4651051759719849e-02 -3.4795379638671875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 -9.5828901976346970e-03</internalNodes>
+          <leafValues>
+            -4.8620718717575073e-01 1.1706890165805817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 6.0666278004646301e-03</internalNodes>
+          <leafValues>
+            -3.6553880572319031e-01 8.7813600897789001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 1.7992249922826886e-03</internalNodes>
+          <leafValues>
+            1.6035990417003632e-01 -3.0859109759330750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -1.0092309676110744e-02</internalNodes>
+          <leafValues>
+            -3.9505869150161743e-01 1.1514779925346375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 2.5171819142997265e-03</internalNodes>
+          <leafValues>
+            -3.0043110251426697e-01 1.8256050348281860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -1.7089240252971649e-02</internalNodes>
+          <leafValues>
+            -5.2173590660095215e-01 9.7457267343997955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -5.5856268852949142e-02</internalNodes>
+          <leafValues>
+            5.3540021181106567e-01 -8.9221552014350891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 -2.3930610623210669e-03</internalNodes>
+          <leafValues>
+            -4.7012439370155334e-01 8.6141407489776611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 3.6918919067829847e-03</internalNodes>
+          <leafValues>
+            -2.7755591273307800e-01 1.5186099708080292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 2.1945969201624393e-03</internalNodes>
+          <leafValues>
+            -1.6867069900035858e-01 1.1952520161867142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 2.9675459954887629e-03</internalNodes>
+          <leafValues>
+            -3.8940680027008057e-01 1.0388910025358200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 1.9976729527115822e-03</internalNodes>
+          <leafValues>
+            9.1141343116760254e-02 -4.1050049662590027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -2.0369699224829674e-02</internalNodes>
+          <leafValues>
+            -5.9968769550323486e-01 6.9301806390285492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 2.3318571038544178e-03</internalNodes>
+          <leafValues>
+            6.1892550438642502e-02 -3.2886800169944763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -4.2863588780164719e-02</internalNodes>
+          <leafValues>
+            -7.3844969272613525e-01 5.7071659713983536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 1.1471749749034643e-03</internalNodes>
+          <leafValues>
+            -5.1379621028900146e-01 7.1196496486663818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -1.3735669665038586e-02</internalNodes>
+          <leafValues>
+            -5.3785508871078491e-01 6.5542042255401611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 4.7165591269731522e-02</internalNodes>
+          <leafValues>
+            4.5389361679553986e-02 -6.8944799900054932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -1.1204879730939865e-02</internalNodes>
+          <leafValues>
+            1.6932639479637146e-01 -2.3061719536781311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -1.5478420257568359e-01</internalNodes>
+          <leafValues>
+            -7.7705371379852295e-01 1.2142470106482506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 5.8086342178285122e-03</internalNodes>
+          <leafValues>
+            1.1318100243806839e-01 -3.3206319808959961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 -2.8529569506645203e-02</internalNodes>
+          <leafValues>
+            -5.6747281551361084e-01 4.8734560608863831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -3.8758948445320129e-02</internalNodes>
+          <leafValues>
+            5.9423100948333740e-01 -7.5139336287975311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 3.1037809327244759e-02</internalNodes>
+          <leafValues>
+            5.1973540335893631e-02 -5.8552652597427368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 7.4786080404010136e-06</internalNodes>
+          <leafValues>
+            -2.7623200416564941e-01 1.4088490605354309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 3.1000260263681412e-02</internalNodes>
+          <leafValues>
+            3.1331729143857956e-02 -5.6860172748565674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -4.9860659986734390e-02</internalNodes>
+          <leafValues>
+            -8.2924622297286987e-01 3.8801580667495728e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -4.2323280125856400e-02</internalNodes>
+          <leafValues>
+            -4.3062108755111694e-01 1.6579480841755867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 9.1987219639122486e-04</internalNodes>
+          <leafValues>
+            -2.1154449880123138e-01 1.5517529845237732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 2.0559869706630707e-01</internalNodes>
+          <leafValues>
+            -6.2403179705142975e-02 3.2229611277580261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 2.9118418693542480e-01</internalNodes>
+          <leafValues>
+            3.9228469133377075e-02 -9.4128221273422241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 7.8337509185075760e-03</internalNodes>
+          <leafValues>
+            -1.4806599915027618e-01 1.7849209904670715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 1.1393319815397263e-02</internalNodes>
+          <leafValues>
+            7.7987723052501678e-02 -4.2424258589744568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -9.1807022690773010e-02</internalNodes>
+          <leafValues>
+            3.3689481019973755e-01 -5.6174129247665405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 -1.6038250178098679e-02</internalNodes>
+          <leafValues>
+            -2.4954010546207428e-01 1.4570869505405426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 5.4830290377140045e-02</internalNodes>
+          <leafValues>
+            -1.5496000647544861e-01 2.0329600572586060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 2.4449700489640236e-02</internalNodes>
+          <leafValues>
+            6.0974378138780594e-02 -6.3072341680526733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 2.9260670766234398e-02</internalNodes>
+          <leafValues>
+            4.6833608299493790e-02 -3.7985381484031677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 3.9965552277863026e-03</internalNodes>
+          <leafValues>
+            -1.6927300393581390e-01 1.9100320339202881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 -6.9938853383064270e-02</internalNodes>
+          <leafValues>
+            5.4655587673187256e-01 -5.4965749382972717e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.9646480083465576e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 150 4.5835621654987335e-02</internalNodes>
+          <leafValues>
+            -4.9982848763465881e-01 4.0961080789566040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 2.6363100856542587e-02</internalNodes>
+          <leafValues>
+            -3.9193201065063477e-01 5.1567757129669189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 1.5189830213785172e-02</internalNodes>
+          <leafValues>
+            -5.2216362953186035e-01 3.1368219852447510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 -2.0805280655622482e-02</internalNodes>
+          <leafValues>
+            3.7614479660987854e-01 -4.7375538945198059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 -7.4902721680700779e-03</internalNodes>
+          <leafValues>
+            1.6283489763736725e-01 -7.0384472608566284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 2.7719369530677795e-01</internalNodes>
+          <leafValues>
+            -1.6404120624065399e-01 3.3481580018997192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 6.4188443124294281e-02</internalNodes>
+          <leafValues>
+            -8.0176621675491333e-01 1.2763829529285431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 4.0668170899152756e-02</internalNodes>
+          <leafValues>
+            -3.3386930823326111e-01 2.8456181287765503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 7.4888020753860474e-03</internalNodes>
+          <leafValues>
+            -3.7188920378684998e-01 2.5932261347770691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 6.4942672848701477e-02</internalNodes>
+          <leafValues>
+            1.0372909903526306e-01 -7.1671068668365479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -2.1149769891053438e-03</internalNodes>
+          <leafValues>
+            -7.5683927536010742e-01 7.9019591212272644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 -4.8293141298927367e-04</internalNodes>
+          <leafValues>
+            -4.9852079153060913e-01 8.1111326813697815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 1.3996459543704987e-01</internalNodes>
+          <leafValues>
+            8.7497599422931671e-02 -7.6389372348785400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 5.2211988717317581e-02</internalNodes>
+          <leafValues>
+            3.1640481203794479e-02 -5.3281372785568237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 3.0680459458380938e-03</internalNodes>
+          <leafValues>
+            -6.2458527088165283e-01 1.3869540393352509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 5.0478860735893250e-02</internalNodes>
+          <leafValues>
+            7.9063497483730316e-02 -7.4017041921615601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -8.5122063755989075e-03</internalNodes>
+          <leafValues>
+            -4.9971660971641541e-01 1.1132259666919708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 7.0091806352138519e-02</internalNodes>
+          <leafValues>
+            9.7081907093524933e-02 -6.1879187822341919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 -2.7261190116405487e-03</internalNodes>
+          <leafValues>
+            9.7546629607677460e-02 -5.7760041952133179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 1.0676559992134571e-02</internalNodes>
+          <leafValues>
+            -2.9058128595352173e-01 1.8426120281219482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 6.3848652644082904e-04</internalNodes>
+          <leafValues>
+            1.3869750499725342e-01 -4.2546540498733521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 -4.7957260161638260e-02</internalNodes>
+          <leafValues>
+            -7.3249137401580811e-01 4.1188109666109085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 1.7140049487352371e-02</internalNodes>
+          <leafValues>
+            -3.1973451375961304e-01 1.6840089857578278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 7.8544542193412781e-02</internalNodes>
+          <leafValues>
+            5.0053231418132782e-02 -7.1410048007965088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 -1.1342849582433701e-02</internalNodes>
+          <leafValues>
+            -3.8810971379280090e-01 1.2976409494876862e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-2.1222629547119141e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 175 -8.6751781054772437e-05</internalNodes>
+          <leafValues>
+            2.5179910659790039e-01 -6.7723119258880615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 2.0550179481506348e-01</internalNodes>
+          <leafValues>
+            2.0217150449752808e-02 -3.3618199825286865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 1.3893260061740875e-01</internalNodes>
+          <leafValues>
+            1.0678269714117050e-01 -8.6710119247436523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 2.6432450395077467e-03</internalNodes>
+          <leafValues>
+            -4.1057088971138000e-01 2.5603920221328735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -1.6145260306075215e-03</internalNodes>
+          <leafValues>
+            1.7448160052299500e-01 -5.0290131568908691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -4.6492749825119972e-03</internalNodes>
+          <leafValues>
+            -8.3960932493209839e-01 1.0409969836473465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -5.5983918718993664e-03</internalNodes>
+          <leafValues>
+            -5.2673357725143433e-01 1.2114489823579788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 2.1482799202203751e-03</internalNodes>
+          <leafValues>
+            8.6831927299499512e-02 -5.2384740114212036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 -2.2942349314689636e-03</internalNodes>
+          <leafValues>
+            1.5666730701923370e-01 -3.9387580752372742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.0809659725055099e-03</internalNodes>
+          <leafValues>
+            9.4777546823024750e-02 -5.7967597246170044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -1.8739879131317139e-02</internalNodes>
+          <leafValues>
+            -4.3780770897865295e-01 1.2754319608211517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 -2.0956669468432665e-03</internalNodes>
+          <leafValues>
+            2.1275860071182251e-01 -1.7645539343357086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -6.1370119452476501e-02</internalNodes>
+          <leafValues>
+            -6.7007988691329956e-01 8.5291177034378052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -4.5074969530105591e-02</internalNodes>
+          <leafValues>
+            -4.7614151239395142e-01 3.8384389132261276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 4.5961341820657253e-03</internalNodes>
+          <leafValues>
+            9.0776696801185608e-02 -5.3642177581787109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -5.6205179542303085e-02</internalNodes>
+          <leafValues>
+            -4.4128128886222839e-01 2.6340639218688011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 -1.7070030793547630e-02</internalNodes>
+          <leafValues>
+            3.1962528824806213e-01 -1.5699079632759094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 1.3778540305793285e-02</internalNodes>
+          <leafValues>
+            -4.1468238830566406e-01 1.0832040011882782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 5.6932470761239529e-03</internalNodes>
+          <leafValues>
+            1.0973270237445831e-01 -4.1420969367027283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 1.1573060182854533e-03</internalNodes>
+          <leafValues>
+            -4.6996459364891052e-01 1.4088229835033417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 -4.3259391532046720e-05</internalNodes>
+          <leafValues>
+            -5.9117478132247925e-01 7.2208836674690247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -1.4467669825535268e-04</internalNodes>
+          <leafValues>
+            1.4340500533580780e-01 -2.0809020102024078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -3.0667539685964584e-02</internalNodes>
+          <leafValues>
+            -6.4181727170944214e-01 7.6316222548484802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 6.4002368599176407e-03</internalNodes>
+          <leafValues>
+            -1.5426200628280640e-01 2.0618820190429688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 2.7318780776113272e-03</internalNodes>
+          <leafValues>
+            -1.8429130315780640e-01 2.2046269476413727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -4.1759859770536423e-02</internalNodes>
+          <leafValues>
+            5.1284658908843994e-01 -4.3097220361232758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -3.0174419283866882e-02</internalNodes>
+          <leafValues>
+            -3.6134809255599976e-01 1.1633390188217163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 6.8081771023571491e-03</internalNodes>
+          <leafValues>
+            -2.5953280925750732e-01 1.4927390217781067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 4.3430369347333908e-02</internalNodes>
+          <leafValues>
+            6.8601243197917938e-02 -5.8221191167831421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 2.1121300756931305e-02</internalNodes>
+          <leafValues>
+            -8.5372917354106903e-02 8.0498583614826202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 9.9840283393859863e-02</internalNodes>
+          <leafValues>
+            5.3292520344257355e-02 -7.1819657087326050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 5.6953770108520985e-03</internalNodes>
+          <leafValues>
+            -8.8976107537746429e-02 1.3483940064907074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -5.9984568506479263e-02</internalNodes>
+          <leafValues>
+            6.8324291706085205e-01 -5.1916271448135376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 5.9353262186050415e-03</internalNodes>
+          <leafValues>
+            1.0305190086364746e-01 -2.5361439585685730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -7.4867930379696190e-05</internalNodes>
+          <leafValues>
+            1.3340729475021362e-01 -2.9323559999465942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -2.5437519070692360e-04</internalNodes>
+          <leafValues>
+            1.5335780382156372e-01 -1.9387570023536682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 7.7576987678185105e-04</internalNodes>
+          <leafValues>
+            -3.1155571341514587e-01 1.0632509738206863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 5.4478500038385391e-02</internalNodes>
+          <leafValues>
+            2.6277480646967888e-02 -6.6687411069869995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 1.2692850083112717e-02</internalNodes>
+          <leafValues>
+            9.3613043427467346e-02 -3.9152190089225769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -3.0766960233449936e-02</internalNodes>
+          <leafValues>
+            -5.9238088130950928e-01 4.8314999788999557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 -1.9366150721907616e-02</internalNodes>
+          <leafValues>
+            4.3661609292030334e-01 -8.8672943413257599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -2.8705620206892490e-03</internalNodes>
+          <leafValues>
+            1.5244780480861664e-01 -1.3861170411109924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 4.0003698319196701e-02</internalNodes>
+          <leafValues>
+            5.8748051524162292e-02 -6.9119709730148315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -8.1130467355251312e-02</internalNodes>
+          <leafValues>
+            -7.8684318065643311e-01 2.0421498920768499e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -2.1017501130700111e-03</internalNodes>
+          <leafValues>
+            1.9100449979305267e-01 -1.9659680128097534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 8.6481617763638496e-03</internalNodes>
+          <leafValues>
+            8.8689289987087250e-02 -3.7414151430130005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -5.2429020404815674e-02</internalNodes>
+          <leafValues>
+            -7.2615998983383179e-01 3.9465688169002533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 3.4464800264686346e-03</internalNodes>
+          <leafValues>
+            -1.1640899628400803e-01 2.7386268973350525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 -7.0581152103841305e-03</internalNodes>
+          <leafValues>
+            -3.6283940076828003e-01 9.2023678123950958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -5.7412259280681610e-02</internalNodes>
+          <leafValues>
+            -8.8839381933212280e-01 2.6647759601473808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 3.3479030244052410e-03</internalNodes>
+          <leafValues>
+            -1.4884050190448761e-01 1.8366430699825287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 -5.3958419710397720e-02</internalNodes>
+          <leafValues>
+            3.8098138570785522e-01 -4.4046580791473389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -2.5719689205288887e-02</internalNodes>
+          <leafValues>
+            3.2570821046829224e-01 -1.0078220069408417e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-2.1038460731506348e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 228 1.2441220134496689e-01</internalNodes>
+          <leafValues>
+            -3.8573729991912842e-01 3.9273661375045776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 3.7802878767251968e-02</internalNodes>
+          <leafValues>
+            -4.7028678655624390e-01 3.5786831378936768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 3.0441429466009140e-02</internalNodes>
+          <leafValues>
+            -3.9460399746894836e-01 3.2518500089645386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 3.9223438943736255e-04</internalNodes>
+          <leafValues>
+            -4.5166510343551636e-01 1.9672380387783051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 3.9077710360288620e-02</internalNodes>
+          <leafValues>
+            -2.1073329448699951e-01 4.3864768743515015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 -8.9118082541972399e-05</internalNodes>
+          <leafValues>
+            1.5196959674358368e-01 -5.9563517570495605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 8.8415127247571945e-03</internalNodes>
+          <leafValues>
+            -4.9292489886283875e-01 1.7406579852104187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 1.3666059821844101e-02</internalNodes>
+          <leafValues>
+            9.2861749231815338e-02 -5.5182307958602905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -6.1203300952911377e-02</internalNodes>
+          <leafValues>
+            -6.7985290288925171e-01 1.0049080103635788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 5.7719892356544733e-04</internalNodes>
+          <leafValues>
+            -5.8301997184753418e-01 1.1089629679918289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 2.8370460495352745e-04</internalNodes>
+          <leafValues>
+            -5.9793341159820557e-01 9.3898378312587738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 1.7665980383753777e-02</internalNodes>
+          <leafValues>
+            -2.2015470266342163e-01 3.4533089399337769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 2.5697330012917519e-02</internalNodes>
+          <leafValues>
+            -3.6195701360702515e-01 1.6877350211143494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -4.0316689759492874e-02</internalNodes>
+          <leafValues>
+            2.2964400053024292e-01 -2.9301440715789795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 4.6522719785571098e-03</internalNodes>
+          <leafValues>
+            -5.8995968103408813e-01 1.0466910153627396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -1.3406000100076199e-02</internalNodes>
+          <leafValues>
+            -3.9572098851203918e-01 8.3528116345405579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 3.6127280443906784e-02</internalNodes>
+          <leafValues>
+            9.4165802001953125e-02 -5.4097181558609009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 2.2792080417275429e-03</internalNodes>
+          <leafValues>
+            1.2819069623947144e-01 -3.6514538526535034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 1.4454070478677750e-03</internalNodes>
+          <leafValues>
+            -2.3281599581241608e-01 1.9829919934272766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 5.7482529431581497e-02</internalNodes>
+          <leafValues>
+            7.5042396783828735e-02 -5.7704979181289673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 3.3360819797962904e-03</internalNodes>
+          <leafValues>
+            8.8012017309665680e-02 -4.6779251098632812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 3.7225749343633652e-02</internalNodes>
+          <leafValues>
+            3.2155111432075500e-02 -6.6346621513366699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 1.6612760722637177e-02</internalNodes>
+          <leafValues>
+            9.1689839959144592e-02 -5.2128171920776367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 2.0543249323964119e-02</internalNodes>
+          <leafValues>
+            -2.8753378987312317e-01 1.4261309802532196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 -1.5633470320608467e-04</internalNodes>
+          <leafValues>
+            2.0246730744838715e-01 -2.2424469888210297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 1.2188810110092163e-01</internalNodes>
+          <leafValues>
+            -1.6461309790611267e-01 1.7583920061588287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 4.6413440257310867e-02</internalNodes>
+          <leafValues>
+            -6.8978017568588257e-01 6.4349927008152008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 1.4946439862251282e-01</internalNodes>
+          <leafValues>
+            3.9805840700864792e-02 -7.0177328586578369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 1.4346869662404060e-02</internalNodes>
+          <leafValues>
+            9.2628777027130127e-02 -4.6314170956611633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 3.6158718168735504e-02</internalNodes>
+          <leafValues>
+            6.4412936568260193e-02 -6.5277212858200073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -5.5098228156566620e-02</internalNodes>
+          <leafValues>
+            -6.1021989583969116e-01 6.6034287214279175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -3.2978600356727839e-03</internalNodes>
+          <leafValues>
+            8.6579866707324982e-02 -2.1844820678234100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 4.1257790289819241e-03</internalNodes>
+          <leafValues>
+            -4.4980299472808838e-01 9.3251250684261322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 3.3465269953012466e-02</internalNodes>
+          <leafValues>
+            1.4524499885737896e-02 -4.0200001001358032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -2.2584630176424980e-02</internalNodes>
+          <leafValues>
+            -6.0067617893218994e-01 6.4416721463203430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -7.1505038067698479e-03</internalNodes>
+          <leafValues>
+            6.7139469087123871e-02 -1.2947300076484680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 -5.1440041512250900e-02</internalNodes>
+          <leafValues>
+            -4.8466479778289795e-01 8.2093752920627594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -1.9100949168205261e-02</internalNodes>
+          <leafValues>
+            -3.5394379496574402e-01 1.0851690173149109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 6.9468282163143158e-03</internalNodes>
+          <leafValues>
+            1.5407569706439972e-01 -2.3040190339088440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 -2.3886600509285927e-02</internalNodes>
+          <leafValues>
+            4.9007979035377502e-01 -5.9650428593158722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -1.3964619720354676e-03</internalNodes>
+          <leafValues>
+            -3.3704701066017151e-01 1.1569459736347198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 2.6320600882172585e-02</internalNodes>
+          <leafValues>
+            -3.9132680743932724e-02 3.7615358829498291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 5.0336541607975960e-03</internalNodes>
+          <leafValues>
+            -3.5457020998001099e-01 1.0786720365285873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -1.1523960158228874e-02</internalNodes>
+          <leafValues>
+            3.5148641467094421e-01 -1.1373709887266159e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>72</maxWeakCount>
+      <stageThreshold>-1.9109580516815186e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 272 -5.6698019616305828e-03</internalNodes>
+          <leafValues>
+            2.5299090147018433e-01 -5.5377197265625000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 1.2186550302430987e-03</internalNodes>
+          <leafValues>
+            9.1723538935184479e-02 -6.5661650896072388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 3.1903409399092197e-03</internalNodes>
+          <leafValues>
+            1.2116809934377670e-01 -5.4405361413955688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -1.2117680162191391e-02</internalNodes>
+          <leafValues>
+            -6.8211251497268677e-01 1.1178220063447952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 2.2634069900959730e-03</internalNodes>
+          <leafValues>
+            -5.6313961744308472e-01 9.9629260599613190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 2.2871519904583693e-03</internalNodes>
+          <leafValues>
+            -5.0227242708206177e-01 1.1288029700517654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 -7.4018500745296478e-03</internalNodes>
+          <leafValues>
+            -5.0622308254241943e-01 1.0325270146131516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 6.5725757740437984e-03</internalNodes>
+          <leafValues>
+            3.1603671610355377e-02 -4.5879349112510681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -1.7237069085240364e-02</internalNodes>
+          <leafValues>
+            -3.6556100845336914e-01 1.4122049510478973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -1.7646619817242026e-03</internalNodes>
+          <leafValues>
+            1.8962210416793823e-01 -3.4349760413169861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 2.6085950434207916e-02</internalNodes>
+          <leafValues>
+            8.7369233369827271e-02 -5.3332161903381348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 8.5357967764139175e-03</internalNodes>
+          <leafValues>
+            -3.7360730767250061e-01 1.4508520066738129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 -6.2934341840445995e-03</internalNodes>
+          <leafValues>
+            -4.5775079727172852e-01 1.0016269981861115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 9.7081549465656281e-02</internalNodes>
+          <leafValues>
+            3.3761640079319477e-03 -8.4679859876632690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -9.9455721676349640e-02</internalNodes>
+          <leafValues>
+            7.7892357110977173e-01 -5.4456088691949844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 3.9128549396991730e-02</internalNodes>
+          <leafValues>
+            3.9479929953813553e-02 -4.6620211005210876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 6.8423762917518616e-02</internalNodes>
+          <leafValues>
+            4.8163410276174545e-02 -8.1910741329193115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -1.7304550856351852e-02</internalNodes>
+          <leafValues>
+            -4.6001830697059631e-01 2.1781340241432190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 4.5203989429865032e-05</internalNodes>
+          <leafValues>
+            1.5590970218181610e-01 -2.5734600424766541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -5.3720749914646149e-02</internalNodes>
+          <leafValues>
+            -7.3984587192535400e-01 2.3658139631152153e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 -2.1576840663328767e-04</internalNodes>
+          <leafValues>
+            1.1803720146417618e-01 -3.5380458831787109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 1.2613219441846013e-03</internalNodes>
+          <leafValues>
+            -1.8313080072402954e-01 1.6306960582733154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 2.2714029997587204e-02</internalNodes>
+          <leafValues>
+            -9.5647342503070831e-02 3.8062781095504761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 2.0958330482244492e-02</internalNodes>
+          <leafValues>
+            6.1185598373413086e-02 -5.2644938230514526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 1.5458449721336365e-02</internalNodes>
+          <leafValues>
+            6.4466789364814758e-02 -4.7441288828849792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -5.0828810781240463e-03</internalNodes>
+          <leafValues>
+            1.0018830001354218e-01 -3.6397251486778259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 1.1842510430142283e-03</internalNodes>
+          <leafValues>
+            -2.0603519678115845e-01 1.7129589617252350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 5.0187770277261734e-02</internalNodes>
+          <leafValues>
+            -7.0924967527389526e-02 1.0435319691896439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 1.7535200715065002e-01</internalNodes>
+          <leafValues>
+            3.7766210734844208e-02 -8.0802738666534424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 -6.8425558507442474e-02</internalNodes>
+          <leafValues>
+            -5.0214898586273193e-01 5.4671119898557663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 2.2496099118143320e-03</internalNodes>
+          <leafValues>
+            -2.8013509511947632e-01 1.0950099676847458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 8.5355632007122040e-02</internalNodes>
+          <leafValues>
+            3.3376980572938919e-02 -7.3676842451095581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -2.8825979679822922e-02</internalNodes>
+          <leafValues>
+            -4.8528099060058594e-01 4.9596078693866730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 -1.3562700478360057e-03</internalNodes>
+          <leafValues>
+            1.8493090569972992e-01 -1.6541489958763123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 1.5731659950688481e-03</internalNodes>
+          <leafValues>
+            9.0431816875934601e-02 -3.0193880200386047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -5.2912188693881035e-03</internalNodes>
+          <leafValues>
+            -4.3963611125946045e-01 4.6880699694156647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 4.2200140655040741e-02</internalNodes>
+          <leafValues>
+            -7.5348012149333954e-02 3.7712809443473816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 3.1030770391225815e-02</internalNodes>
+          <leafValues>
+            6.6053368151187897e-02 -4.7378420829772949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 8.0451928079128265e-03</internalNodes>
+          <leafValues>
+            -7.7326983213424683e-02 3.4898889064788818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 2.3791180923581123e-02</internalNodes>
+          <leafValues>
+            4.8629928380250931e-02 -5.8155477046966553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -2.6884680613875389e-02</internalNodes>
+          <leafValues>
+            7.3852258920669556e-01 -4.0025118738412857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -1.7013859469443560e-03</internalNodes>
+          <leafValues>
+            1.4116409420967102e-01 -1.8305079638957977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -3.2258979976177216e-02</internalNodes>
+          <leafValues>
+            -6.4598697423934937e-01 4.1774179786443710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -9.1719552874565125e-02</internalNodes>
+          <leafValues>
+            6.3651692867279053e-01 -4.4406279921531677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 1.1253220029175282e-02</internalNodes>
+          <leafValues>
+            -1.0398969799280167e-01 2.4386499822139740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 9.1702006757259369e-03</internalNodes>
+          <leafValues>
+            -1.0142300277948380e-01 1.7325720191001892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 -3.7584431469440460e-02</internalNodes>
+          <leafValues>
+            -6.5999048948287964e-01 3.5357259213924408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 1.4904039562679827e-04</internalNodes>
+          <leafValues>
+            -1.2504950165748596e-01 1.0161379724740982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 5.6240631965920329e-04</internalNodes>
+          <leafValues>
+            -2.1511219441890717e-01 1.0537440329790115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -1.7314270138740540e-02</internalNodes>
+          <leafValues>
+            -1.6798290610313416e-01 6.1207499355077744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -1.5429870225489140e-02</internalNodes>
+          <leafValues>
+            2.5674480199813843e-01 -9.7193486988544464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 -1.5612079761922359e-02</internalNodes>
+          <leafValues>
+            -3.5797500610351562e-01 6.9260068237781525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 7.4424187187105417e-04</internalNodes>
+          <leafValues>
+            -1.5740460157394409e-01 1.4921070635318756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 7.9008340835571289e-02</internalNodes>
+          <leafValues>
+            3.5924728959798813e-02 -6.4907592535018921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -3.3477540127933025e-03</internalNodes>
+          <leafValues>
+            -2.5794708728790283e-01 8.1626862287521362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 3.5589419305324554e-02</internalNodes>
+          <leafValues>
+            -4.6870049089193344e-02 5.3945267200469971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 7.6168961822986603e-04</internalNodes>
+          <leafValues>
+            8.0409869551658630e-02 -2.8045970201492310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 9.6126887947320938e-03</internalNodes>
+          <leafValues>
+            9.2715777456760406e-02 -2.2755210101604462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 3.4582789987325668e-02</internalNodes>
+          <leafValues>
+            -9.5495507121086121e-02 2.8116491436958313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 -8.2031842321157455e-03</internalNodes>
+          <leafValues>
+            -3.3162289857864380e-01 4.0629711002111435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 2.5540109723806381e-02</internalNodes>
+          <leafValues>
+            7.0458933711051941e-02 -3.2799351215362549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -3.1389920040965080e-03</internalNodes>
+          <leafValues>
+            1.2529349327087402e-01 -6.0766801238059998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 4.5892409980297089e-03</internalNodes>
+          <leafValues>
+            -9.5335446298122406e-02 2.4738679826259613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 -2.3260030895471573e-02</internalNodes>
+          <leafValues>
+            -2.3823159933090210e-01 3.3502969890832901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 1.7964519793167710e-03</internalNodes>
+          <leafValues>
+            8.9843861758708954e-02 -2.8049159049987793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 -1.0952910035848618e-01</internalNodes>
+          <leafValues>
+            -4.6206548810005188e-01 7.4333418160676956e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 6.8442770279943943e-03</internalNodes>
+          <leafValues>
+            7.3520109057426453e-02 -3.6190700531005859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 -7.3719851672649384e-02</internalNodes>
+          <leafValues>
+            4.1131800413131714e-01 -6.8293057382106781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 9.4485012814402580e-03</internalNodes>
+          <leafValues>
+            -1.2132299691438675e-01 2.1491959691047668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -7.4686057865619659e-02</internalNodes>
+          <leafValues>
+            2.4292010068893433e-01 -3.8520719856023788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -1.8958229571580887e-02</internalNodes>
+          <leafValues>
+            -3.7263819575309753e-01 6.8381950259208679e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 -8.3170487778261304e-04</internalNodes>
+          <leafValues>
+            9.5785446465015411e-02 -1.0169020295143127e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>54</maxWeakCount>
+      <stageThreshold>-2.0048389434814453e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 344 1.5233230590820312e-01</internalNodes>
+          <leafValues>
+            -3.1805351376533508e-01 4.7039988636970520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 8.8482722640037537e-03</internalNodes>
+          <leafValues>
+            -3.6134269833564758e-01 2.7332958579063416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 2.9788410291075706e-02</internalNodes>
+          <leafValues>
+            -2.8059279918670654e-01 3.6270239949226379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 5.2725639194250107e-02</internalNodes>
+          <leafValues>
+            -1.9320569932460785e-01 3.5507258772850037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 2.6077419519424438e-02</internalNodes>
+          <leafValues>
+            -3.7120199203491211e-01 2.7038440108299255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 -4.4878520071506500e-02</internalNodes>
+          <leafValues>
+            2.9119300842285156e-01 -3.5178241133689880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -9.3984341947361827e-04</internalNodes>
+          <leafValues>
+            -6.0143661499023438e-01 1.1815790086984634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 3.1817350536584854e-03</internalNodes>
+          <leafValues>
+            -6.1632722616195679e-01 1.0581470280885696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -6.2214181525632739e-04</internalNodes>
+          <leafValues>
+            1.1701049655675888e-01 -6.1873781681060791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 5.4993429221212864e-03</internalNodes>
+          <leafValues>
+            7.1740642189979553e-02 -3.2122710347175598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 7.0621701888740063e-03</internalNodes>
+          <leafValues>
+            -3.0814599990844727e-01 1.8299129605293274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 -3.4492298960685730e-02</internalNodes>
+          <leafValues>
+            -3.6952570080757141e-01 1.1142779886722565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 -5.3783431649208069e-02</internalNodes>
+          <leafValues>
+            -6.6689962148666382e-01 8.4863640367984772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -2.0194910466670990e-02</internalNodes>
+          <leafValues>
+            -4.2300069332122803e-01 5.6325469166040421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 -7.6839578105136752e-04</internalNodes>
+          <leafValues>
+            1.3547450304031372e-01 -3.5696288943290710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 6.6877179779112339e-03</internalNodes>
+          <leafValues>
+            -3.4379830956459045e-01 1.3302099704742432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 1.1147409677505493e-01</internalNodes>
+          <leafValues>
+            -4.9523550271987915e-01 9.7303003072738647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -8.5021732375025749e-03</internalNodes>
+          <leafValues>
+            -5.1778990030288696e-01 6.7188903689384460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -1.8897019326686859e-02</internalNodes>
+          <leafValues>
+            -4.7064769268035889e-01 9.0873777866363525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 5.7387170381844044e-03</internalNodes>
+          <leafValues>
+            -1.4860689640045166e-01 3.0976840853691101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 3.2604049891233444e-02</internalNodes>
+          <leafValues>
+            7.8677706420421600e-02 -5.4713827371597290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 1.8975350030814297e-05</internalNodes>
+          <leafValues>
+            -2.4359850585460663e-01 9.8908931016921997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -1.9267159514129162e-03</internalNodes>
+          <leafValues>
+            -5.0522977113723755e-01 7.5119331479072571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -7.7145430259406567e-03</internalNodes>
+          <leafValues>
+            -2.5014960765838623e-01 1.0211499780416489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -1.8806649371981621e-02</internalNodes>
+          <leafValues>
+            -4.3269169330596924e-01 1.1147680133581161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 2.9912199825048447e-02</internalNodes>
+          <leafValues>
+            4.6748448163270950e-02 -5.8818292617797852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 -7.4260600376874208e-04</internalNodes>
+          <leafValues>
+            1.8389309942722321e-01 -2.0138260722160339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 4.0662181563675404e-03</internalNodes>
+          <leafValues>
+            -4.4948458671569824e-01 8.6881376802921295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 1.8681669607758522e-02</internalNodes>
+          <leafValues>
+            -1.7103520035743713e-01 2.2931230068206787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 4.6580690890550613e-02</internalNodes>
+          <leafValues>
+            4.3874379247426987e-02 -6.6704601049423218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -1.5030739828944206e-02</internalNodes>
+          <leafValues>
+            -7.6569449901580811e-01 4.2524490505456924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 6.3602820038795471e-02</internalNodes>
+          <leafValues>
+            3.3629488199949265e-02 -8.6777329444885254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -3.3613100647926331e-02</internalNodes>
+          <leafValues>
+            -6.7464047670364380e-01 4.5196920633316040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -4.4314529746770859e-02</internalNodes>
+          <leafValues>
+            -4.7056430578231812e-01 2.0987950265407562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 2.9175819829106331e-02</internalNodes>
+          <leafValues>
+            5.6036490947008133e-02 -6.5745961666107178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 8.4737781435251236e-03</internalNodes>
+          <leafValues>
+            -1.2312129884958267e-01 3.6037188768386841e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 -2.6930740103125572e-02</internalNodes>
+          <leafValues>
+            -6.5255117416381836e-01 6.0726620256900787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 3.7930138409137726e-02</internalNodes>
+          <leafValues>
+            -1.5491360425949097e-01 2.1770450472831726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 1.6430050134658813e-02</internalNodes>
+          <leafValues>
+            -2.5250691175460815e-01 1.5458230674266815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 5.1079809665679932e-02</internalNodes>
+          <leafValues>
+            3.0773499980568886e-02 -6.4929312467575073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 1.6663300339132547e-03</internalNodes>
+          <leafValues>
+            -3.7425559759140015e-01 8.1392176449298859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -9.0896980836987495e-03</internalNodes>
+          <leafValues>
+            1.7854049801826477e-01 -7.6578080654144287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 2.0629199221730232e-02</internalNodes>
+          <leafValues>
+            7.2373263537883759e-02 -4.2050579190254211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 8.2410024479031563e-03</internalNodes>
+          <leafValues>
+            3.2896678894758224e-02 -3.7325268983840942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -4.6126499772071838e-02</internalNodes>
+          <leafValues>
+            -3.7356421351432800e-01 7.7336780726909637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -8.3484929054975510e-03</internalNodes>
+          <leafValues>
+            1.8690130114555359e-01 -1.5126839280128479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -4.7689080238342285e-02</internalNodes>
+          <leafValues>
+            -4.0730020403862000e-01 8.7598368525505066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -5.0166220171377063e-04</internalNodes>
+          <leafValues>
+            1.2036769837141037e-01 -2.4717660248279572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 2.1794239728478715e-05</internalNodes>
+          <leafValues>
+            -2.9800811409950256e-01 1.2065000087022781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 -7.0597290992736816e-02</internalNodes>
+          <leafValues>
+            -6.8116611242294312e-01 6.4198948442935944e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -6.4999358728528023e-03</internalNodes>
+          <leafValues>
+            2.6219159364700317e-01 -1.4015009999275208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 5.3664338774979115e-03</internalNodes>
+          <leafValues>
+            -3.4273180365562439e-01 9.2048570513725281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -1.3341950252652168e-02</internalNodes>
+          <leafValues>
+            4.0258079767227173e-01 -7.2052307426929474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 1.2243090197443962e-02</internalNodes>
+          <leafValues>
+            -8.2426831126213074e-02 3.8369199633598328e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>100</maxWeakCount>
+      <stageThreshold>-1.8743180036544800e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 398 -2.8617910575121641e-03</internalNodes>
+          <leafValues>
+            2.1443170309066772e-01 -5.1532137393951416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 1.9125089747831225e-03</internalNodes>
+          <leafValues>
+            1.4483030140399933e-01 -6.1175411939620972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 4.8059499822556973e-03</internalNodes>
+          <leafValues>
+            -4.4235628843307495e-01 1.3466580212116241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 -9.5777623355388641e-02</internalNodes>
+          <leafValues>
+            -4.8914781212806702e-01 1.3169640302658081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -8.9395968243479729e-03</internalNodes>
+          <leafValues>
+            1.4790549874305725e-01 -4.6696281433105469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 8.1128235906362534e-03</internalNodes>
+          <leafValues>
+            5.0671331584453583e-02 -4.0227508544921875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 2.2638900554738939e-04</internalNodes>
+          <leafValues>
+            -5.0928252935409546e-01 8.2113206386566162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 -6.1516009736806154e-04</internalNodes>
+          <leafValues>
+            -3.8136801123619080e-01 1.0157950222492218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 -3.2050691079348326e-03</internalNodes>
+          <leafValues>
+            -5.8352458477020264e-01 6.2385398894548416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 5.4250762332230806e-04</internalNodes>
+          <leafValues>
+            -2.5548499822616577e-01 1.4832200109958649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 1.0713520459830761e-03</internalNodes>
+          <leafValues>
+            -3.5334318876266479e-01 1.1791589856147766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 -1.7755989683791995e-03</internalNodes>
+          <leafValues>
+            -3.4087279438972473e-01 9.4740107655525208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 -9.3014203011989594e-02</internalNodes>
+          <leafValues>
+            7.4685460329055786e-01 -5.2443340420722961e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -1.4192130416631699e-02</internalNodes>
+          <leafValues>
+            -3.1433999538421631e-01 9.0452186763286591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -5.3375191055238247e-04</internalNodes>
+          <leafValues>
+            1.4119710028171539e-01 -2.0296710729598999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 9.4844609498977661e-02</internalNodes>
+          <leafValues>
+            1.4625679701566696e-02 -6.2215209007263184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 1.1853160103783011e-03</internalNodes>
+          <leafValues>
+            -2.5984010100364685e-01 1.2153120338916779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 -2.4541220627725124e-03</internalNodes>
+          <leafValues>
+            7.1894593536853790e-02 -3.9803519845008850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 6.8703000433743000e-03</internalNodes>
+          <leafValues>
+            6.8626098334789276e-02 -3.8565808534622192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 -6.0411270707845688e-02</internalNodes>
+          <leafValues>
+            -4.8482391238212585e-01 2.0706020295619965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -4.6826168545521796e-04</internalNodes>
+          <leafValues>
+            9.5856241881847382e-02 -3.1230351328849792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 -3.3507338957861066e-04</internalNodes>
+          <leafValues>
+            7.8128658235073090e-02 -9.4751000404357910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 3.6313060671091080e-02</internalNodes>
+          <leafValues>
+            4.4824421405792236e-02 -6.3693147897720337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 3.8052719901315868e-04</internalNodes>
+          <leafValues>
+            -2.1931269764900208e-01 1.1780519783496857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -5.0964631140232086e-02</internalNodes>
+          <leafValues>
+            5.5783379077911377e-01 -4.3869689106941223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -7.6198756694793701e-02</internalNodes>
+          <leafValues>
+            6.7789608240127563e-01 -1.7935890704393387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 -1.2677020393311977e-02</internalNodes>
+          <leafValues>
+            -6.0731011629104614e-01 4.9086190760135651e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 -3.6766629200428724e-03</internalNodes>
+          <leafValues>
+            1.5226639807224274e-01 -1.9953680038452148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 -3.8846738636493683e-02</internalNodes>
+          <leafValues>
+            -7.7045238018035889e-01 3.3732470124959946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 9.4217229634523392e-03</internalNodes>
+          <leafValues>
+            -6.9929488003253937e-02 1.3669140636920929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 7.3391180485486984e-03</internalNodes>
+          <leafValues>
+            -1.2133339792490005e-01 2.1175499260425568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 1.2211379595100880e-02</internalNodes>
+          <leafValues>
+            6.7636847496032715e-02 -4.3353718519210815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -9.3064550310373306e-03</internalNodes>
+          <leafValues>
+            -3.4682491421699524e-01 6.4062312245368958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 5.2111309021711349e-02</internalNodes>
+          <leafValues>
+            -3.4146990627050400e-02 3.8904741406440735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 -4.3582019861787558e-04</internalNodes>
+          <leafValues>
+            1.3956509530544281e-01 -1.8289420008659363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -1.0575359687209129e-02</internalNodes>
+          <leafValues>
+            -2.7782461047172546e-01 8.5667066276073456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 1.4794029993936419e-03</internalNodes>
+          <leafValues>
+            -2.3154720664024353e-01 1.1765889823436737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 9.4746891409158707e-03</internalNodes>
+          <leafValues>
+            -1.3345280289649963e-01 1.8066969513893127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 8.3355188369750977e-02</internalNodes>
+          <leafValues>
+            3.3563960343599319e-02 -7.2860741615295410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -6.6629007458686829e-02</internalNodes>
+          <leafValues>
+            3.8058251142501831e-01 -3.3490750938653946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 5.0287488847970963e-03</internalNodes>
+          <leafValues>
+            -1.1418010294437408e-01 2.1534989774227142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 5.1222002506256104e-01</internalNodes>
+          <leafValues>
+            7.6377480290830135e-03 -6.5067559480667114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 1.2300059944391251e-01</internalNodes>
+          <leafValues>
+            3.8879081606864929e-02 -5.9420442581176758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 -1.1227129725739360e-03</internalNodes>
+          <leafValues>
+            1.0235410183668137e-01 -1.1207509785890579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -6.2220949679613113e-02</internalNodes>
+          <leafValues>
+            -5.1173472404479980e-01 4.1879799216985703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 -2.6323389261960983e-02</internalNodes>
+          <leafValues>
+            3.4005990624427795e-01 -5.0624471157789230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -1.8875019624829292e-02</internalNodes>
+          <leafValues>
+            -5.4550838470458984e-01 4.1524920612573624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -3.4034788608551025e-01</internalNodes>
+          <leafValues>
+            -9.1541802883148193e-01 1.6561320051550865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 -8.0456008436158299e-04</internalNodes>
+          <leafValues>
+            1.4270770549774170e-01 -1.2901450693607330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -3.9579509757459164e-03</internalNodes>
+          <leafValues>
+            -3.3408370614051819e-01 5.8637548238039017e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 1.8336549401283264e-02</internalNodes>
+          <leafValues>
+            -4.5632220804691315e-02 5.2696329355239868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 -5.7686101645231247e-02</internalNodes>
+          <leafValues>
+            -5.7604360580444336e-01 3.9550099521875381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -8.6881890892982483e-03</internalNodes>
+          <leafValues>
+            2.0929679274559021e-01 -1.0309000313282013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 2.0318549871444702e-01</internalNodes>
+          <leafValues>
+            9.4080818817019463e-03 -9.9389547109603882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 2.0097799599170685e-02</internalNodes>
+          <leafValues>
+            5.6577399373054504e-02 -3.7819018959999084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 1.3217139989137650e-02</internalNodes>
+          <leafValues>
+            -7.4322126805782318e-02 1.7874650657176971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -9.1346688568592072e-03</internalNodes>
+          <leafValues>
+            -4.9356880784034729e-01 3.7799369543790817e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 8.7239191634580493e-04</internalNodes>
+          <leafValues>
+            -1.3848680257797241e-01 1.1516919732093811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -3.4609009162522852e-04</internalNodes>
+          <leafValues>
+            -1.6371829807758331e-01 1.1949790269136429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -9.8570866975933313e-04</internalNodes>
+          <leafValues>
+            -5.4642897844314575e-01 4.4689279049634933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 1.0218559764325619e-02</internalNodes>
+          <leafValues>
+            -1.1570169776678085e-01 1.6723839938640594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 2.6702679693698883e-02</internalNodes>
+          <leafValues>
+            4.3922040611505508e-02 -4.5120438933372498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -2.0299260504543781e-03</internalNodes>
+          <leafValues>
+            1.1932279914617538e-01 -1.6979490220546722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 -8.8023602962493896e-02</internalNodes>
+          <leafValues>
+            -8.0279791355133057e-01 9.4295190647244453e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -1.3109110295772552e-02</internalNodes>
+          <leafValues>
+            -3.0865308642387390e-01 6.0802049934864044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -9.9501870572566986e-03</internalNodes>
+          <leafValues>
+            1.8400619924068451e-01 -4.6465478837490082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -3.4293539356440306e-03</internalNodes>
+          <leafValues>
+            2.6682999730110168e-01 -9.9338643252849579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 5.4729141294956207e-02</internalNodes>
+          <leafValues>
+            2.8731130063533783e-02 -7.7745848894119263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 7.2012972086668015e-03</internalNodes>
+          <leafValues>
+            4.4892478734254837e-02 -3.8289341330528259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 4.2047120630741119e-02</internalNodes>
+          <leafValues>
+            -2.2562339901924133e-02 4.0646651387214661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 4.4444389641284943e-03</internalNodes>
+          <leafValues>
+            9.1204106807708740e-02 -1.8748210370540619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 2.8441840782761574e-02</internalNodes>
+          <leafValues>
+            4.0668040513992310e-02 -4.0552121400833130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 -1.5141829848289490e-02</internalNodes>
+          <leafValues>
+            2.4799869954586029e-01 -8.3607338368892670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 3.9388090372085571e-02</internalNodes>
+          <leafValues>
+            2.4279279634356499e-02 -7.6827299594879150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 6.1649468261748552e-04</internalNodes>
+          <leafValues>
+            -1.7249910533428192e-01 1.0311610251665115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 2.6001650840044022e-02</internalNodes>
+          <leafValues>
+            2.2825349122285843e-02 -7.7545452117919922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 1.4940380351617932e-03</internalNodes>
+          <leafValues>
+            -1.1028409749269485e-01 1.6966749727725983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -1.3777149841189384e-02</internalNodes>
+          <leafValues>
+            -3.8424721360206604e-01 3.0320269986987114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 9.9619822576642036e-03</internalNodes>
+          <leafValues>
+            -5.3764659911394119e-02 3.7887129187583923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 3.2952039036899805e-03</internalNodes>
+          <leafValues>
+            9.4384163618087769e-02 -3.2762721180915833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 5.7747410610318184e-03</internalNodes>
+          <leafValues>
+            5.7114940136671066e-02 -3.0719769001007080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -4.8392590135335922e-02</internalNodes>
+          <leafValues>
+            1.7021059989929199e-01 -8.7045513093471527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 5.6376052089035511e-04</internalNodes>
+          <leafValues>
+            -9.3816302716732025e-02 2.0642310380935669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -2.3873809725046158e-02</internalNodes>
+          <leafValues>
+            -3.0082350969314575e-01 1.7477719113230705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -1.0526900179684162e-02</internalNodes>
+          <leafValues>
+            -3.4418928623199463e-01 5.7995639741420746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 2.2288670763373375e-02</internalNodes>
+          <leafValues>
+            -5.7179849594831467e-02 1.9739510118961334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 -1.4589070342481136e-02</internalNodes>
+          <leafValues>
+            -4.5168799161911011e-01 4.1490409523248672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 -4.6936370432376862e-02</internalNodes>
+          <leafValues>
+            2.0457950234413147e-01 -5.1769189536571503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 5.3777720313519239e-04</internalNodes>
+          <leafValues>
+            -3.9481449127197266e-01 4.5076690614223480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -2.2181039676070213e-03</internalNodes>
+          <leafValues>
+            -2.4575619399547577e-01 1.0261219739913940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 3.5076549649238586e-01</internalNodes>
+          <leafValues>
+            1.9791129976511002e-02 -9.5161467790603638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -2.6712059974670410e-02</internalNodes>
+          <leafValues>
+            2.2393140196800232e-01 -4.5580100268125534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 -3.9627091027796268e-03</internalNodes>
+          <leafValues>
+            -2.4207019805908203e-01 7.6588593423366547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -4.7878702171146870e-03</internalNodes>
+          <leafValues>
+            1.2655270099639893e-01 -1.1964710056781769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 7.1042939089238644e-03</internalNodes>
+          <leafValues>
+            -9.2130422592163086e-02 2.1519139409065247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -2.2581929442822002e-05</internalNodes>
+          <leafValues>
+            6.0634609311819077e-02 -1.5848989784717560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -7.8060641884803772e-02</internalNodes>
+          <leafValues>
+            3.4822109341621399e-01 -5.3173709660768509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 2.7555850148200989e-01</internalNodes>
+          <leafValues>
+            7.4112107977271080e-03 -1.0000040531158447e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 1.9652329385280609e-01</internalNodes>
+          <leafValues>
+            2.0131109282374382e-02 -8.5326671600341797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 -1.6801860183477402e-03</internalNodes>
+          <leafValues>
+            7.7082179486751556e-02 -2.2620369493961334e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>71</maxWeakCount>
+      <stageThreshold>-1.9982930421829224e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 498 -1.8814710900187492e-02</internalNodes>
+          <leafValues>
+            3.7744289636611938e-01 -4.0770640969276428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 -2.3191049695014954e-02</internalNodes>
+          <leafValues>
+            3.4049031138420105e-01 -3.6144611239433289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 3.1333088874816895e-02</internalNodes>
+          <leafValues>
+            -4.3613511323928833e-01 1.9668689370155334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 -1.1318700388073921e-02</internalNodes>
+          <leafValues>
+            1.1685170233249664e-01 -5.6359791755676270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -3.1084290822036564e-04</internalNodes>
+          <leafValues>
+            -4.3396338820457458e-01 1.4264069497585297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 8.7350063025951385e-02</internalNodes>
+          <leafValues>
+            -1.9952809810638428e-01 3.3043611049652100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 -2.9018519446253777e-02</internalNodes>
+          <leafValues>
+            3.2315209507942200e-01 -2.1707040071487427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 5.9860680252313614e-02</internalNodes>
+          <leafValues>
+            -1.8764750659465790e-01 2.7651038765907288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 -2.9682170599699020e-02</internalNodes>
+          <leafValues>
+            -4.6436330676078796e-01 1.1129009723663330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -2.2648361045867205e-03</internalNodes>
+          <leafValues>
+            -2.7163028717041016e-01 8.6916759610176086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -1.6869819955900311e-03</internalNodes>
+          <leafValues>
+            1.7998990416526794e-01 -2.7152928709983826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 1.0256370296701789e-03</internalNodes>
+          <leafValues>
+            -4.3248209357261658e-01 1.0256689786911011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -3.1762920320034027e-02</internalNodes>
+          <leafValues>
+            -6.4419168233871460e-01 6.7505106329917908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 -8.5913296788930893e-03</internalNodes>
+          <leafValues>
+            -3.7672510743141174e-01 7.2900757193565369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -2.1636451128870249e-03</internalNodes>
+          <leafValues>
+            -4.2209509015083313e-01 1.0724630206823349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 6.0111237689852715e-04</internalNodes>
+          <leafValues>
+            6.1302110552787781e-02 -3.8004979491233826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -6.1244412790983915e-05</internalNodes>
+          <leafValues>
+            7.4765786528587341e-02 -5.2644491195678711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -2.3666430264711380e-02</internalNodes>
+          <leafValues>
+            -5.6801301240921021e-01 3.6377541720867157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 -1.4256609603762627e-02</internalNodes>
+          <leafValues>
+            -5.3446692228317261e-01 6.2768869102001190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 -1.5713909640908241e-02</internalNodes>
+          <leafValues>
+            3.1898561120033264e-01 -1.1541239917278290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 -5.9286020696163177e-02</internalNodes>
+          <leafValues>
+            -5.7135957479476929e-01 8.1775680184364319e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -4.4122908264398575e-02</internalNodes>
+          <leafValues>
+            -7.0591008663177490e-01 2.0833099260926247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 -7.2728260420262814e-04</internalNodes>
+          <leafValues>
+            1.0819850116968155e-01 -3.8077458739280701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 -6.6653728485107422e-02</internalNodes>
+          <leafValues>
+            -6.0824638605117798e-01 4.3248821049928665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 2.3679709993302822e-03</internalNodes>
+          <leafValues>
+            -2.9793098568916321e-01 1.2091939896345139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 3.3566180616617203e-02</internalNodes>
+          <leafValues>
+            3.6464620381593704e-02 -5.5766987800598145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -5.3138811141252518e-02</internalNodes>
+          <leafValues>
+            -5.6245392560958862e-01 6.5296277403831482e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -2.9401908977888525e-04</internalNodes>
+          <leafValues>
+            -5.8417952060699463e-01 5.0005510449409485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -4.8085048911161721e-04</internalNodes>
+          <leafValues>
+            1.4018669724464417e-01 -2.4792720377445221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 4.7777060419321060e-02</internalNodes>
+          <leafValues>
+            5.5672798305749893e-02 -5.9540742635726929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 3.3423870801925659e-02</internalNodes>
+          <leafValues>
+            -1.4370389282703400e-01 2.3300980031490326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 2.0432810485363007e-01</internalNodes>
+          <leafValues>
+            4.5327048748731613e-02 -7.4164307117462158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 1.4106060564517975e-01</internalNodes>
+          <leafValues>
+            -3.9674291014671326e-01 8.1692866981029510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 1.0005939839174971e-04</internalNodes>
+          <leafValues>
+            -2.2317939996719360e-01 1.3917629420757294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 6.0689389705657959e-02</internalNodes>
+          <leafValues>
+            3.4324988722801208e-02 -8.2796847820281982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 -3.6456179805099964e-03</internalNodes>
+          <leafValues>
+            1.5286439657211304e-01 -1.4005979895591736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 3.1945340335369110e-02</internalNodes>
+          <leafValues>
+            6.5343692898750305e-02 -4.4296088814735413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 2.3428380489349365e-02</internalNodes>
+          <leafValues>
+            2.5527309626340866e-02 -6.3270658254623413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 4.6067949384450912e-02</internalNodes>
+          <leafValues>
+            4.3579101562500000e-02 -6.4929872751235962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -5.8055151253938675e-02</internalNodes>
+          <leafValues>
+            -6.3957542181015015e-01 1.4028750360012054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 3.8783740252256393e-02</internalNodes>
+          <leafValues>
+            5.1233518868684769e-02 -5.4144388437271118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -1.2765520252287388e-02</internalNodes>
+          <leafValues>
+            2.7082890272140503e-01 -9.1927766799926758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 -3.1400551088154316e-03</internalNodes>
+          <leafValues>
+            -3.4679821133613586e-01 8.3973668515682220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -1.9719999283552170e-02</internalNodes>
+          <leafValues>
+            -2.0476959645748138e-01 6.3232198357582092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 3.2241051085293293e-03</internalNodes>
+          <leafValues>
+            9.6259713172912598e-02 -2.8098219633102417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 -5.9271860867738724e-02</internalNodes>
+          <leafValues>
+            -2.6686909794807434e-01 3.2907258719205856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 1.5636639669537544e-02</internalNodes>
+          <leafValues>
+            6.9188073277473450e-02 -4.1761711239814758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -8.8900122791528702e-03</internalNodes>
+          <leafValues>
+            1.9603550434112549e-01 -1.1249750107526779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 2.4458909407258034e-02</internalNodes>
+          <leafValues>
+            5.6988969445228577e-02 -5.1025021076202393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 1.0101319849491119e-01</internalNodes>
+          <leafValues>
+            9.4210049137473106e-03 -3.6691328883171082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 9.0739831328392029e-02</internalNodes>
+          <leafValues>
+            5.3999878466129303e-02 -5.1181477308273315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -4.9557868391275406e-02</internalNodes>
+          <leafValues>
+            -6.2467038631439209e-01 4.0988270193338394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 2.6558348536491394e-01</internalNodes>
+          <leafValues>
+            -8.6136549711227417e-02 3.2438439130783081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 1.8632459687069058e-03</internalNodes>
+          <leafValues>
+            -5.4563361406326294e-01 5.8684051036834717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 1.1804940178990364e-02</internalNodes>
+          <leafValues>
+            -2.0603899657726288e-01 1.4167340099811554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 6.8137067137286067e-04</internalNodes>
+          <leafValues>
+            -2.0806470513343811e-01 9.2627376317977905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 5.7278381427749991e-04</internalNodes>
+          <leafValues>
+            -4.3170881271362305e-01 6.3360363245010376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 -1.1041999794542789e-02</internalNodes>
+          <leafValues>
+            1.8144379556179047e-01 -4.1707839816808701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 9.5696747303009033e-03</internalNodes>
+          <leafValues>
+            -1.2098339945077896e-01 2.1607619524002075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 7.4274197220802307e-02</internalNodes>
+          <leafValues>
+            2.6399549096822739e-02 -7.7601867914199829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 -2.5815829634666443e-02</internalNodes>
+          <leafValues>
+            5.3497368097305298e-01 -5.2025150507688522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -6.3314691185951233e-02</internalNodes>
+          <leafValues>
+            5.1900321245193481e-01 -1.9329590722918510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 -6.6432490944862366e-02</internalNodes>
+          <leafValues>
+            7.2140932083129883e-01 -3.2882031053304672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -7.5749039649963379e-02</internalNodes>
+          <leafValues>
+            4.1485249996185303e-01 -5.5451728403568268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 -2.0296040922403336e-02</internalNodes>
+          <leafValues>
+            -3.3250689506530762e-01 8.2397893071174622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 2.2172650322318077e-02</internalNodes>
+          <leafValues>
+            -1.4419150352478027e-01 1.7280860245227814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 4.2085880413651466e-03</internalNodes>
+          <leafValues>
+            -3.0237489938735962e-01 8.6699083447456360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 6.8267330527305603e-02</internalNodes>
+          <leafValues>
+            8.7291244417428970e-03 -3.6955729126930237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 5.1220320165157318e-03</internalNodes>
+          <leafValues>
+            -2.0824980735778809e-01 1.4530059695243835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 -5.3114328533411026e-02</internalNodes>
+          <leafValues>
+            -5.5142301321029663e-01 4.3421190232038498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -4.9739979207515717e-02</internalNodes>
+          <leafValues>
+            4.4077101349830627e-01 -6.4349673688411713e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>94</maxWeakCount>
+      <stageThreshold>-1.8377989530563354e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 569 -3.3883380820043385e-04</internalNodes>
+          <leafValues>
+            1.8997849524021149e-01 -4.6184849739074707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -1.5632030554115772e-03</internalNodes>
+          <leafValues>
+            1.9381409883499146e-01 -4.3518841266632080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 1.5552520053461194e-03</internalNodes>
+          <leafValues>
+            -4.7420310974121094e-01 1.2137629836797714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -3.1417120248079300e-02</internalNodes>
+          <leafValues>
+            -3.9096689224243164e-01 1.0951930284500122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 -3.2835190650075674e-03</internalNodes>
+          <leafValues>
+            1.6428950428962708e-01 -3.2751929759979248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 5.8749080635607243e-03</internalNodes>
+          <leafValues>
+            7.6225973665714264e-02 -4.3470710515975952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 4.4846539385616779e-03</internalNodes>
+          <leafValues>
+            1.2197560071945190e-01 -4.4872379302978516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 1.9835829734802246e-03</internalNodes>
+          <leafValues>
+            -6.2911021709442139e-01 1.0122530162334442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 1.2609469704329967e-02</internalNodes>
+          <leafValues>
+            1.0438250005245209e-01 -3.5015499591827393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -4.7475768951699138e-04</internalNodes>
+          <leafValues>
+            1.1008159816265106e-01 -3.0429539084434509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 3.2356760930269957e-03</internalNodes>
+          <leafValues>
+            -2.7057901024818420e-01 1.2746180593967438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 9.9898613989353180e-03</internalNodes>
+          <leafValues>
+            6.3906982541084290e-02 -4.7118431329727173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 5.6069239508360624e-04</internalNodes>
+          <leafValues>
+            -3.1783330440521240e-01 1.0404340177774429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -5.7694699615240097e-02</internalNodes>
+          <leafValues>
+            -5.1342570781707764e-01 2.6394980028271675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 5.5947788059711456e-03</internalNodes>
+          <leafValues>
+            7.6774753630161285e-02 -4.3374261260032654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -3.8770840037614107e-03</internalNodes>
+          <leafValues>
+            1.3988199830055237e-01 -2.0221559703350067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -4.7874201089143753e-02</internalNodes>
+          <leafValues>
+            -4.7928389906883240e-01 6.8043030798435211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 2.5817550718784332e-02</internalNodes>
+          <leafValues>
+            -4.5524198561906815e-02 3.9452901482582092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 1.6696650709491223e-04</internalNodes>
+          <leafValues>
+            -3.0880719423294067e-01 1.0875239968299866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 9.8888948559761047e-04</internalNodes>
+          <leafValues>
+            6.8699032068252563e-02 -4.1813009977340698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 -3.4260770771652460e-03</internalNodes>
+          <leafValues>
+            -2.8929701447486877e-01 1.1479649692773819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 6.6044367849826813e-02</internalNodes>
+          <leafValues>
+            1.6809269785881042e-02 -3.3534801006317139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 2.8318059630692005e-03</internalNodes>
+          <leafValues>
+            -3.9482170343399048e-01 8.5598722100257874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 4.2680549621582031e-01</internalNodes>
+          <leafValues>
+            5.0977780483663082e-03 -5.9331178665161133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 1.1960650235414505e-01</internalNodes>
+          <leafValues>
+            2.7437770739197731e-02 -7.6616281270980835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 1.9571319222450256e-02</internalNodes>
+          <leafValues>
+            -1.1966180056333542e-01 2.3962239921092987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 -1.7432469874620438e-02</internalNodes>
+          <leafValues>
+            -5.8530348539352417e-01 5.6400340050458908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -1.1196629703044891e-01</internalNodes>
+          <leafValues>
+            -6.7248320579528809e-01 2.9150659218430519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 -4.5747519470751286e-03</internalNodes>
+          <leafValues>
+            -4.7730261087417603e-01 5.6612998247146606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 -5.1501519046723843e-03</internalNodes>
+          <leafValues>
+            1.1510629951953888e-01 -1.0732329636812210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 2.9034249484539032e-02</internalNodes>
+          <leafValues>
+            -5.3368709981441498e-02 6.4226460456848145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -1.8050910439342260e-03</internalNodes>
+          <leafValues>
+            1.2795349955558777e-01 -1.2329389899969101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -2.4374839849770069e-03</internalNodes>
+          <leafValues>
+            -3.5312348604202271e-01 8.7703153491020203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 -1.9070079550147057e-02</internalNodes>
+          <leafValues>
+            -4.0662440657615662e-01 4.3273188173770905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 -5.0454240292310715e-02</internalNodes>
+          <leafValues>
+            -8.1198102235794067e-01 2.8289109468460083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 1.6544000245630741e-03</internalNodes>
+          <leafValues>
+            -1.6964040696620941e-01 1.2194740027189255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -4.6791311353445053e-02</internalNodes>
+          <leafValues>
+            4.0614441037178040e-01 -6.1174858361482620e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -5.5953849107027054e-02</internalNodes>
+          <leafValues>
+            -8.2662910223007202e-01 2.7774749323725700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 1.4469559537246823e-03</internalNodes>
+          <leafValues>
+            -1.4953869581222534e-01 1.5966990590095520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 -1.2529050000011921e-02</internalNodes>
+          <leafValues>
+            -4.2504650354385376e-01 2.1658079698681831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.1086500016972423e-03</internalNodes>
+          <leafValues>
+            -3.6006990075111389e-01 6.4415097236633301e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 3.9361778646707535e-02</internalNodes>
+          <leafValues>
+            8.2419048994779587e-03 -7.5303071737289429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 1.8823929131031036e-02</internalNodes>
+          <leafValues>
+            4.4821120798587799e-02 -5.0604110956192017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -3.2083000987768173e-02</internalNodes>
+          <leafValues>
+            3.1431311368942261e-01 -3.9181869477033615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -3.1081929802894592e-02</internalNodes>
+          <leafValues>
+            -7.6903742551803589e-01 3.0742960050702095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 2.3218210786581039e-02</internalNodes>
+          <leafValues>
+            -5.7748749852180481e-02 2.8955349326133728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -1.1492100311443210e-03</internalNodes>
+          <leafValues>
+            1.1501409858465195e-01 -1.9310690462589264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -1.6593940556049347e-02</internalNodes>
+          <leafValues>
+            -4.2298540472984314e-01 4.3738979846239090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -1.0146570391952991e-02</internalNodes>
+          <leafValues>
+            2.5579848885536194e-01 -9.1966241598129272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -1.3054019771516323e-02</internalNodes>
+          <leafValues>
+            1.8339529633522034e-01 -4.0160831063985825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 3.7463540211319923e-03</internalNodes>
+          <leafValues>
+            -1.2586769461631775e-01 2.2247019410133362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -4.8463590443134308e-02</internalNodes>
+          <leafValues>
+            -5.8155900239944458e-01 2.9713390395045280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 6.4649381674826145e-03</internalNodes>
+          <leafValues>
+            9.3169108033180237e-02 -2.9046580195426941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 1.5607809647917747e-02</internalNodes>
+          <leafValues>
+            4.7331970185041428e-02 -4.4805559515953064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -5.8314641937613487e-03</internalNodes>
+          <leafValues>
+            9.8941758275032043e-02 -2.2056859731674194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 7.3607802391052246e-02</internalNodes>
+          <leafValues>
+            1.6780460253357887e-02 -5.4953122138977051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -6.4223129302263260e-03</internalNodes>
+          <leafValues>
+            -2.9647961258888245e-01 7.3539912700653076e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 2.2267029635258950e-05</internalNodes>
+          <leafValues>
+            -3.4211820363998413e-01 4.1858270764350891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 3.7273630499839783e-02</internalNodes>
+          <leafValues>
+            2.7458079159259796e-02 -7.8551971912384033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 4.2738770134747028e-03</internalNodes>
+          <leafValues>
+            -8.2514517009258270e-02 1.0404880344867706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 1.1906049912795424e-03</internalNodes>
+          <leafValues>
+            -1.6300439834594727e-01 1.5300649404525757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 8.7800435721874237e-03</internalNodes>
+          <leafValues>
+            -9.2885948717594147e-02 1.3147510588169098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 2.4151368997991085e-03</internalNodes>
+          <leafValues>
+            4.7598559409379959e-02 -4.4829669594764709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -2.7428340166807175e-02</internalNodes>
+          <leafValues>
+            1.9811069965362549e-01 -5.5979698896408081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 -1.4117059763520956e-03</internalNodes>
+          <leafValues>
+            -2.1138970553874969e-01 1.0409740358591080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 -2.0210200548171997e-01</internalNodes>
+          <leafValues>
+            -7.7120232582092285e-01 7.0582218468189240e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 -4.1451320052146912e-02</internalNodes>
+          <leafValues>
+            2.8295141458511353e-01 -7.1323528885841370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 4.8561887815594673e-03</internalNodes>
+          <leafValues>
+            8.6693897843360901e-02 -2.3541820049285889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -4.4662880100077018e-05</internalNodes>
+          <leafValues>
+            1.3257139921188354e-01 -2.0168599486351013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 3.7671580910682678e-02</internalNodes>
+          <leafValues>
+            -7.4952289462089539e-02 3.3843380212783813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 7.4343256652355194e-02</internalNodes>
+          <leafValues>
+            3.2905030995607376e-02 -7.3536777496337891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 -1.0186419822275639e-02</internalNodes>
+          <leafValues>
+            -3.1277081370353699e-01 4.4163990765810013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 -2.4506879970431328e-02</internalNodes>
+          <leafValues>
+            -6.1346518993377686e-01 2.9692139476537704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -3.8238149136304855e-02</internalNodes>
+          <leafValues>
+            3.5583540797233582e-01 -4.8388618975877762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 1.7983660101890564e-01</internalNodes>
+          <leafValues>
+            1.9501589238643646e-02 -9.8485881090164185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 8.4765878273174167e-04</internalNodes>
+          <leafValues>
+            -2.7960330247879028e-01 7.8323036432266235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 3.7178809288889170e-03</internalNodes>
+          <leafValues>
+            7.2525441646575928e-02 -2.4067409336566925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -9.0932317078113556e-02</internalNodes>
+          <leafValues>
+            -7.1539151668548584e-01 8.8080493733286858e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -8.0087810754776001e-02</internalNodes>
+          <leafValues>
+            -6.7830717563629150e-01 2.4904320016503334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 7.6924148015677929e-03</internalNodes>
+          <leafValues>
+            -5.0967499613761902e-02 1.1952529847621918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 4.1485231369733810e-02</internalNodes>
+          <leafValues>
+            -4.9493920058012009e-02 3.5386860370635986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 3.4051608294248581e-02</internalNodes>
+          <leafValues>
+            4.2200978845357895e-02 -5.0110721588134766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -2.6235830038785934e-02</internalNodes>
+          <leafValues>
+            4.4934839010238647e-01 -4.1851200163364410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -5.1373958587646484e-02</internalNodes>
+          <leafValues>
+            -9.5942801237106323e-01 1.7192790284752846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -2.6742739602923393e-02</internalNodes>
+          <leafValues>
+            -6.5632241964340210e-01 2.1778080612421036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 -1.3730529462918639e-03</internalNodes>
+          <leafValues>
+            -1.8638509511947632e-01 4.1139349341392517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 1.0963230160996318e-03</internalNodes>
+          <leafValues>
+            -1.4219370484352112e-01 1.3832019269466400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -4.5011811889708042e-03</internalNodes>
+          <leafValues>
+            -1.8468600511550903e-01 9.1024190187454224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 4.4253250234760344e-04</internalNodes>
+          <leafValues>
+            -1.2736940383911133e-01 1.3655360043048859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 3.0500710010528564e-02</internalNodes>
+          <leafValues>
+            -5.8146148920059204e-02 2.4189910292625427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -1.1691919714212418e-01</internalNodes>
+          <leafValues>
+            -5.5466407537460327e-01 3.0249029397964478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 -9.5684931147843599e-04</internalNodes>
+          <leafValues>
+            5.1899868994951248e-02 -1.4152799546718597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 1.3096149777993560e-03</internalNodes>
+          <leafValues>
+            -1.4248229563236237e-01 1.2227780371904373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 3.4988880157470703e-02</internalNodes>
+          <leafValues>
+            2.7653129771351814e-02 -6.1738812923431396e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>82</maxWeakCount>
+      <stageThreshold>-1.9031070470809937e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 663 1.6489429771900177e-01</internalNodes>
+          <leafValues>
+            -2.5657209753990173e-01 4.1277718544006348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 2.0584860816597939e-02</internalNodes>
+          <leafValues>
+            -5.2442210912704468e-01 1.4910830557346344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 8.8764587417244911e-04</internalNodes>
+          <leafValues>
+            1.3334700465202332e-01 -5.2259522676467896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -1.3320889556780457e-03</internalNodes>
+          <leafValues>
+            -3.6568748950958252e-01 2.0482279360294342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 7.7916197478771210e-02</internalNodes>
+          <leafValues>
+            -2.1557159721851349e-01 3.1069579720497131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 2.4321360979229212e-03</internalNodes>
+          <leafValues>
+            -4.4742551445960999e-01 1.0638339817523956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -5.8699389919638634e-03</internalNodes>
+          <leafValues>
+            -3.8800778985023499e-01 1.4410589635372162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 6.9754302501678467e-02</internalNodes>
+          <leafValues>
+            1.3224910013377666e-02 -8.0096632242202759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 3.8338101003319025e-03</internalNodes>
+          <leafValues>
+            -4.3139308691024780e-01 1.4253990352153778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 -1.5829030424356461e-02</internalNodes>
+          <leafValues>
+            3.0954799056053162e-01 -1.2232720106840134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 6.6198296844959259e-02</internalNodes>
+          <leafValues>
+            -2.0558249950408936e-01 1.9531220197677612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 1.7639519646763802e-02</internalNodes>
+          <leafValues>
+            1.0770589858293533e-01 -4.3488320708274841e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 -1.1082629673182964e-02</internalNodes>
+          <leafValues>
+            -3.6149570345878601e-01 1.1327210068702698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -3.6515299230813980e-02</internalNodes>
+          <leafValues>
+            -4.3912211060523987e-01 5.5279448628425598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -3.3373299986124039e-02</internalNodes>
+          <leafValues>
+            -5.6869208812713623e-01 8.4043957293033600e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 8.1395559012889862e-02</internalNodes>
+          <leafValues>
+            -1.4235010743141174e-01 2.8748288750648499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -4.3892292305827141e-03</internalNodes>
+          <leafValues>
+            -3.4859830141067505e-01 1.1650340259075165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -6.3558202236890793e-03</internalNodes>
+          <leafValues>
+            -3.3823049068450928e-01 1.1005490273237228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 2.0912459120154381e-02</internalNodes>
+          <leafValues>
+            7.8197829425334930e-02 -4.6337550878524780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 1.1600360274314880e-01</internalNodes>
+          <leafValues>
+            -2.0528669655323029e-01 1.5923389792442322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 1.6316600143909454e-02</internalNodes>
+          <leafValues>
+            -1.0633999854326248e-01 3.3453521132469177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 -2.8488141298294067e-01</internalNodes>
+          <leafValues>
+            5.1638001203536987e-01 -3.9357859641313553e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 2.4155430495738983e-02</internalNodes>
+          <leafValues>
+            -7.1670228242874146e-01 5.0031550228595734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 1.1413260363042355e-02</internalNodes>
+          <leafValues>
+            5.9236031025648117e-02 -3.8141900300979614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 -2.4304199963808060e-02</internalNodes>
+          <leafValues>
+            4.3475851416587830e-01 -8.6574159562587738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -1.5267609851434827e-03</internalNodes>
+          <leafValues>
+            -6.4307600259780884e-01 5.1642779260873795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 1.0073349811136723e-02</internalNodes>
+          <leafValues>
+            7.5743027031421661e-02 -4.2902961373329163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -8.1224881112575531e-02</internalNodes>
+          <leafValues>
+            -4.0827330946922302e-01 5.5444631725549698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 1.5149010345339775e-02</internalNodes>
+          <leafValues>
+            5.3084861487150192e-02 -5.4495412111282349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -5.3490739315748215e-02</internalNodes>
+          <leafValues>
+            -4.7422149777412415e-01 3.9420779794454575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 -4.0884271264076233e-02</internalNodes>
+          <leafValues>
+            -8.8557797670364380e-01 3.2042708247900009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -4.2768509592860937e-04</internalNodes>
+          <leafValues>
+            -3.0554470419883728e-01 5.1432881504297256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 1.8441269174218178e-02</internalNodes>
+          <leafValues>
+            8.0688089132308960e-02 -3.5884049534797668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -4.7630790621042252e-02</internalNodes>
+          <leafValues>
+            -4.6131908893585205e-01 6.0592770576477051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 8.2442145794630051e-03</internalNodes>
+          <leafValues>
+            8.9793607592582703e-02 -3.7605780363082886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 1.0003759711980820e-01</internalNodes>
+          <leafValues>
+            -8.3760380744934082e-02 3.9221811294555664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -2.8420550748705864e-02</internalNodes>
+          <leafValues>
+            -6.9483548402786255e-01 4.9100410193204880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 5.6485999375581741e-02</internalNodes>
+          <leafValues>
+            4.4795661233365536e-03 -7.5373399257659912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 1.0085420217365026e-03</internalNodes>
+          <leafValues>
+            -3.7881261110305786e-01 7.8376993536949158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -1.2643639929592609e-03</internalNodes>
+          <leafValues>
+            7.5486026704311371e-02 -3.1015640497207642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 1.4146340079605579e-02</internalNodes>
+          <leafValues>
+            -8.1805020570755005e-02 3.7313848733901978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 -3.1549399718642235e-03</internalNodes>
+          <leafValues>
+            -2.1241660416126251e-01 8.9129790663719177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 1.4796239556744695e-03</internalNodes>
+          <leafValues>
+            -2.1479040384292603e-01 1.3543279469013214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -3.1343609094619751e-02</internalNodes>
+          <leafValues>
+            -5.8114588260650635e-01 4.8576328903436661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -7.6149761676788330e-02</internalNodes>
+          <leafValues>
+            -5.3774517774581909e-01 4.8339068889617920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -6.1668939888477325e-02</internalNodes>
+          <leafValues>
+            -8.4525662660598755e-01 1.7448999278713018e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 -2.7084920555353165e-02</internalNodes>
+          <leafValues>
+            -5.0659137964248657e-01 4.7709420323371887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 -2.4240929633378983e-02</internalNodes>
+          <leafValues>
+            -3.8534450531005859e-01 5.0300780683755875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 4.1979398578405380e-02</internalNodes>
+          <leafValues>
+            -1.0378009825944901e-01 2.6236268877983093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 2.3717690259218216e-02</internalNodes>
+          <leafValues>
+            5.6897271424531937e-02 -2.8959441184997559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -1.8669789656996727e-02</internalNodes>
+          <leafValues>
+            -3.9924529194831848e-01 7.3442213237285614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 -1.4987000264227390e-02</internalNodes>
+          <leafValues>
+            -3.2296919822692871e-01 4.1676748543977737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 8.7209865450859070e-03</internalNodes>
+          <leafValues>
+            1.3521389663219452e-01 -1.8224580585956573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 -1.2239219620823860e-02</internalNodes>
+          <leafValues>
+            1.5540809929370880e-01 -1.5208069980144501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -4.8744980245828629e-02</internalNodes>
+          <leafValues>
+            -3.6606758832931519e-01 6.3152566552162170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -3.8249569479376078e-03</internalNodes>
+          <leafValues>
+            8.3472989499568939e-02 -2.4186329543590546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 1.5581659972667694e-01</internalNodes>
+          <leafValues>
+            3.1953960657119751e-02 -6.7813181877136230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 6.8241581320762634e-02</internalNodes>
+          <leafValues>
+            1.5478439629077911e-02 -4.2029750347137451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 -9.5974646508693695e-02</internalNodes>
+          <leafValues>
+            -9.5647841691970825e-01 2.1444590762257576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 -1.2618429958820343e-02</internalNodes>
+          <leafValues>
+            -5.0544857978820801e-01 3.0875260010361671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 7.2727642953395844e-02</internalNodes>
+          <leafValues>
+            4.7215349972248077e-02 -4.5075151324272156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 2.9923219233751297e-02</internalNodes>
+          <leafValues>
+            -8.1444352865219116e-02 3.1656229496002197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 1.9138090312480927e-02</internalNodes>
+          <leafValues>
+            6.8187400698661804e-02 -3.4876790642738342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 -3.4314721822738647e-02</internalNodes>
+          <leafValues>
+            -5.5220371484756470e-01 3.7325009703636169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 5.2559198811650276e-03</internalNodes>
+          <leafValues>
+            6.4786978065967560e-02 -3.6363509297370911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 1.4092399738729000e-02</internalNodes>
+          <leafValues>
+            -4.8704359680414200e-02 2.7677831053733826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 -9.0101473033428192e-03</internalNodes>
+          <leafValues>
+            2.3452599346637726e-01 -1.3140350580215454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 9.6720218658447266e-02</internalNodes>
+          <leafValues>
+            2.6661360636353493e-02 -7.7422797679901123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 8.5365071892738342e-02</internalNodes>
+          <leafValues>
+            2.3529909551143646e-02 -7.0710861682891846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 2.4384429678320885e-02</internalNodes>
+          <leafValues>
+            -6.2648482620716095e-02 3.7251880764961243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 3.6380778998136520e-02</internalNodes>
+          <leafValues>
+            4.3358739465475082e-02 -6.0222417116165161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 -5.3780268877744675e-02</internalNodes>
+          <leafValues>
+            -3.3441001176834106e-01 3.5700578242540359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -1.4787100255489349e-02</internalNodes>
+          <leafValues>
+            2.9136168956756592e-01 -7.4075296521186829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 1.2491010129451752e-03</internalNodes>
+          <leafValues>
+            4.1654240339994431e-02 -9.3758836388587952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 -2.7572909370064735e-02</internalNodes>
+          <leafValues>
+            -3.1398218870162964e-01 7.2411999106407166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -7.8866451978683472e-02</internalNodes>
+          <leafValues>
+            6.0655838251113892e-01 -2.3838050663471222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -6.9339312613010406e-02</internalNodes>
+          <leafValues>
+            7.1137732267379761e-01 -2.9814269393682480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 9.4372592866420746e-02</internalNodes>
+          <leafValues>
+            3.3579438924789429e-02 -5.9774041175842285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -2.6048649102449417e-02</internalNodes>
+          <leafValues>
+            -4.0574911236763000e-01 5.5603530257940292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 -7.3630206286907196e-02</internalNodes>
+          <leafValues>
+            -6.0780352354049683e-01 2.5251649320125580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -1.8610449507832527e-02</internalNodes>
+          <leafValues>
+            2.4013559520244598e-01 -9.5389783382415771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 1.3329629600048065e-01</internalNodes>
+          <leafValues>
+            -6.9742381572723389e-02 1.3323000073432922e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>112</maxWeakCount>
+      <stageThreshold>-1.6909840106964111e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 745 -4.1724857874214649e-03</internalNodes>
+          <leafValues>
+            1.9310890138149261e-01 -4.9630740284919739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 9.6606701845303178e-04</internalNodes>
+          <leafValues>
+            -5.4340302944183350e-01 1.2434119731187820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 1.0261629940941930e-03</internalNodes>
+          <leafValues>
+            -4.6321579813957214e-01 1.1160290241241455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 3.6368470173329115e-03</internalNodes>
+          <leafValues>
+            8.2918949425220490e-02 -3.6662510037422180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -2.8364539612084627e-03</internalNodes>
+          <leafValues>
+            -6.7365992069244385e-01 6.5546013414859772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -1.0111520532518625e-03</internalNodes>
+          <leafValues>
+            1.4055189490318298e-01 -3.5270330309867859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -2.5434889830648899e-03</internalNodes>
+          <leafValues>
+            1.4191180467605591e-01 -2.8350821137428284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 3.3014779910445213e-03</internalNodes>
+          <leafValues>
+            4.6553891152143478e-02 -4.8537290096282959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -1.1802930384874344e-02</internalNodes>
+          <leafValues>
+            -3.7958830595016479e-01 9.2071913182735443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -1.3293370138853788e-03</internalNodes>
+          <leafValues>
+            1.7311429977416992e-01 -1.6890439391136169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 1.4958450198173523e-01</internalNodes>
+          <leafValues>
+            3.7626601755619049e-02 -8.0016881227493286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 1.6352189704775810e-03</internalNodes>
+          <leafValues>
+            -2.0858129858970642e-01 1.5985429286956787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 1.5483440365642309e-03</internalNodes>
+          <leafValues>
+            -1.7578269541263580e-01 1.7560100555419922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 -3.5674259066581726e-02</internalNodes>
+          <leafValues>
+            -4.6057531237602234e-01 4.3983791023492813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -1.4558699913322926e-02</internalNodes>
+          <leafValues>
+            -3.3587411046028137e-01 8.3965480327606201e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 5.2891410887241364e-03</internalNodes>
+          <leafValues>
+            -3.5635179281234741e-01 9.4101972877979279e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -9.8066125065088272e-04</internalNodes>
+          <leafValues>
+            -4.4301840662956238e-01 6.4368210732936859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 -4.0704999119043350e-02</internalNodes>
+          <leafValues>
+            -5.9700322151184082e-01 1.7846770584583282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 2.9682040214538574e-02</internalNodes>
+          <leafValues>
+            3.8127020001411438e-02 -6.6795140504837036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 -1.7841320368461311e-04</internalNodes>
+          <leafValues>
+            7.4118576943874359e-02 -3.2121241092681885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 1.0050840210169554e-03</internalNodes>
+          <leafValues>
+            -2.0642249286174774e-01 1.2194109708070755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -1.6711819916963577e-03</internalNodes>
+          <leafValues>
+            -2.6586419343948364e-01 7.1882687509059906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 -6.9955319166183472e-02</internalNodes>
+          <leafValues>
+            5.0097060203552246e-01 -5.2172549068927765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 8.3406828343868256e-03</internalNodes>
+          <leafValues>
+            -6.9546110928058624e-02 1.6949440538883209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 1.5483159571886063e-02</internalNodes>
+          <leafValues>
+            -9.5865622162818909e-02 2.8736731410026550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -4.2621988803148270e-02</internalNodes>
+          <leafValues>
+            -2.5160768628120422e-01 1.1381790041923523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 3.6459038965404034e-03</internalNodes>
+          <leafValues>
+            7.0138469338417053e-02 -4.0376278758049011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -1.8889949424192309e-03</internalNodes>
+          <leafValues>
+            1.4695550501346588e-01 -1.7879849672317505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -3.4749018959701061e-03</internalNodes>
+          <leafValues>
+            -2.4985860288143158e-01 1.0349679738283157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -3.7792209535837173e-02</internalNodes>
+          <leafValues>
+            -6.5756058692932129e-01 2.3007599636912346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -4.0167139377444983e-04</internalNodes>
+          <leafValues>
+            1.4987960457801819e-01 -1.4527609944343567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 3.4890990704298019e-02</internalNodes>
+          <leafValues>
+            -4.5207828283309937e-02 5.1295852661132812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 -9.5964537467807531e-04</internalNodes>
+          <leafValues>
+            1.4688290655612946e-01 -1.7244540154933929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 -9.6461333334445953e-02</internalNodes>
+          <leafValues>
+            -7.1814310550689697e-01 3.2587919384241104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -1.1924919672310352e-03</internalNodes>
+          <leafValues>
+            1.3805310428142548e-01 -1.4162309467792511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 -1.6420070081949234e-02</internalNodes>
+          <leafValues>
+            -4.1954740881919861e-01 4.3040689080953598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 -6.1112269759178162e-02</internalNodes>
+          <leafValues>
+            3.7761390209197998e-01 -5.6264769285917282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -3.1682170927524567e-02</internalNodes>
+          <leafValues>
+            2.1038809418678284e-01 -5.4475009441375732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 -7.4058552272617817e-03</internalNodes>
+          <leafValues>
+            -1.8709950149059296e-01 1.0876149684190750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 -2.8892440604977310e-04</internalNodes>
+          <leafValues>
+            6.9734372198581696e-02 -2.4516759812831879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -7.9921782016754150e-03</internalNodes>
+          <leafValues>
+            -2.4069899320602417e-01 8.8012270629405975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -6.4670671708881855e-03</internalNodes>
+          <leafValues>
+            2.0819950103759766e-01 -6.9062210619449615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -5.3345328196883202e-03</internalNodes>
+          <leafValues>
+            3.2469388842582703e-01 -7.4058808386325836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 -6.7914440296590328e-03</internalNodes>
+          <leafValues>
+            -1.7014460265636444e-01 3.7378448992967606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 1.6337619721889496e-01</internalNodes>
+          <leafValues>
+            1.9682100042700768e-02 -9.1652041673660278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 1.1759659647941589e-01</internalNodes>
+          <leafValues>
+            8.8446342851966619e-04 -7.8050827980041504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -1.1682280153036118e-01</internalNodes>
+          <leafValues>
+            -9.6009898185729980e-01 1.7070280387997627e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 4.6899251639842987e-02</internalNodes>
+          <leafValues>
+            4.7891899943351746e-02 -3.2044771313667297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 -4.0058898739516735e-03</internalNodes>
+          <leafValues>
+            1.1414390057325363e-01 -1.5711469948291779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 -4.4986438297200948e-05</internalNodes>
+          <leafValues>
+            2.9008099436759949e-01 -4.2413331568241119e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 2.1421080455183983e-03</internalNodes>
+          <leafValues>
+            -3.3137580752372742e-01 5.3943689912557602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 -7.1408763527870178e-02</internalNodes>
+          <leafValues>
+            -8.8519471883773804e-01 9.3488330021500587e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 -1.3733670115470886e-01</internalNodes>
+          <leafValues>
+            -8.3241897821426392e-01 1.7800329253077507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 6.1765720602124929e-04</internalNodes>
+          <leafValues>
+            -1.9419220089912415e-01 6.8034619092941284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 -6.7170798778533936e-02</internalNodes>
+          <leafValues>
+            -5.7243210077285767e-01 3.0333630740642548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 2.4611391127109528e-03</internalNodes>
+          <leafValues>
+            -1.0570179671049118e-01 1.8801900744438171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 5.0573959015309811e-03</internalNodes>
+          <leafValues>
+            -6.5921753644943237e-02 2.9868951439857483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 1.4213779941201210e-02</internalNodes>
+          <leafValues>
+            6.3767880201339722e-02 -2.1217249333858490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 -2.0629619248211384e-03</internalNodes>
+          <leafValues>
+            -2.6714050769805908e-01 7.6817572116851807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 3.3787779510021210e-02</internalNodes>
+          <leafValues>
+            2.1774150431156158e-02 -7.4938130378723145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 -2.7371870353817940e-02</internalNodes>
+          <leafValues>
+            3.2008060812950134e-01 -5.9622511267662048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 2.8310349211096764e-02</internalNodes>
+          <leafValues>
+            4.4150609523057938e-02 -4.4278699159622192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 3.7205279804766178e-03</internalNodes>
+          <leafValues>
+            -1.3136489689350128e-01 1.5447700023651123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 2.3320990148931742e-03</internalNodes>
+          <leafValues>
+            -1.0849229991436005e-01 2.2682890295982361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 7.6775359921157360e-03</internalNodes>
+          <leafValues>
+            4.9520388245582581e-02 -3.8854768872261047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 -2.9863099916838109e-04</internalNodes>
+          <leafValues>
+            -1.9632560014724731e-01 8.3448931574821472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 6.1346050351858139e-03</internalNodes>
+          <leafValues>
+            5.1433250308036804e-02 -3.0831611156463623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 3.1090779229998589e-02</internalNodes>
+          <leafValues>
+            2.4180799722671509e-02 -6.0184460878372192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 2.9320400953292847e-01</internalNodes>
+          <leafValues>
+            1.1811030097305775e-02 -9.6253931522369385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -6.6321907797828317e-04</internalNodes>
+          <leafValues>
+            1.0245270282030106e-01 -1.4200760424137115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 4.4736359268426895e-02</internalNodes>
+          <leafValues>
+            -1.1238799989223480e-01 1.7392039299011230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -1.5153390355408192e-02</internalNodes>
+          <leafValues>
+            -1.6100360453128815e-01 3.1116949394345284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.1029309825971723e-03</internalNodes>
+          <leafValues>
+            1.2128510326147079e-01 -1.6182290017604828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 -2.8973959852010012e-03</internalNodes>
+          <leafValues>
+            1.0827620327472687e-01 -5.3621310740709305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -9.5785204321146011e-03</internalNodes>
+          <leafValues>
+            -1.6808320581912994e-01 8.5053622722625732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 9.9092386662960052e-02</internalNodes>
+          <leafValues>
+            -1.5469879843294621e-02 4.1138508915901184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 3.7229780107736588e-02</internalNodes>
+          <leafValues>
+            -5.2865970879793167e-02 3.1804299354553223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -2.4716049432754517e-02</internalNodes>
+          <leafValues>
+            -4.0339410305023193e-01 2.9964840039610863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 -9.8965302109718323e-02</internalNodes>
+          <leafValues>
+            5.8510482311248779e-01 -2.6924170553684235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 -9.6337851136922836e-03</internalNodes>
+          <leafValues>
+            -1.7467470467090607e-01 7.5126871466636658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 1.0483879595994949e-03</internalNodes>
+          <leafValues>
+            -1.3728469610214233e-01 1.0684580355882645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 4.2523849755525589e-02</internalNodes>
+          <leafValues>
+            1.6578629612922668e-02 -5.6332737207412720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -3.0866260640323162e-03</internalNodes>
+          <leafValues>
+            7.5264893472194672e-02 -1.9476540386676788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 2.8643399477005005e-02</internalNodes>
+          <leafValues>
+            -6.7578136920928955e-02 2.5766220688819885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 -1.0627339594066143e-02</internalNodes>
+          <leafValues>
+            -2.2384619712829590e-01 7.2172448039054871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 4.6080970205366611e-03</internalNodes>
+          <leafValues>
+            5.0876080989837646e-02 -1.4076329767704010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 2.9914160259068012e-03</internalNodes>
+          <leafValues>
+            -9.7337983548641205e-02 1.7665959894657135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 -7.7902628108859062e-03</internalNodes>
+          <leafValues>
+            -9.8008237779140472e-02 3.7403069436550140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 -6.1339238891378045e-04</internalNodes>
+          <leafValues>
+            9.9036023020744324e-02 -1.6265949606895447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -1.0234319604933262e-02</internalNodes>
+          <leafValues>
+            2.3654979467391968e-01 -3.7817131727933884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -1.1867409572005272e-02</internalNodes>
+          <leafValues>
+            -8.5035067796707153e-01 1.9063299521803856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 4.1437768377363682e-03</internalNodes>
+          <leafValues>
+            8.7878346443176270e-02 -9.4404630362987518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -5.1355729810893536e-03</internalNodes>
+          <leafValues>
+            -3.5699799656867981e-01 4.1546490043401718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 -1.5296200290322304e-03</internalNodes>
+          <leafValues>
+            7.7694572508335114e-02 -4.3186578899621964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 -2.7581020258367062e-03</internalNodes>
+          <leafValues>
+            1.9065889716148376e-01 -8.0679900944232941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 2.8375169634819031e-01</internalNodes>
+          <leafValues>
+            6.2291761860251427e-03 -8.8578152656555176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -2.4612499773502350e-01</internalNodes>
+          <leafValues>
+            -7.0548111200332642e-01 2.1798960864543915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -3.9965631440281868e-03</internalNodes>
+          <leafValues>
+            -1.9710969924926758e-01 8.0300606787204742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 -8.4951231256127357e-03</internalNodes>
+          <leafValues>
+            2.1296609938144684e-01 -8.2974627614021301e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 4.7206480056047440e-02</internalNodes>
+          <leafValues>
+            9.7466083243489265e-03 -7.0066297054290771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 3.7802560254931450e-03</internalNodes>
+          <leafValues>
+            7.7478893101215363e-02 -2.3372000455856323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 4.4631671160459518e-02</internalNodes>
+          <leafValues>
+            -2.1464770659804344e-02 3.2136338949203491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 6.8157288478687406e-04</internalNodes>
+          <leafValues>
+            1.2177070230245590e-01 -1.2063200026750565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 -6.9712452590465546e-02</internalNodes>
+          <leafValues>
+            -9.4828051328659058e-01 1.2017440050840378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -4.8821792006492615e-03</internalNodes>
+          <leafValues>
+            -2.1774840354919434e-01 7.7113322913646698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 3.4387600608170033e-03</internalNodes>
+          <leafValues>
+            -1.8093569576740265e-01 9.3595556914806366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 -2.5215700268745422e-02</internalNodes>
+          <leafValues>
+            -5.5714958906173706e-01 2.7420820668339729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 7.4309771880507469e-03</internalNodes>
+          <leafValues>
+            -4.6630490571260452e-02 2.1024890244007111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 -1.5789959579706192e-02</internalNodes>
+          <leafValues>
+            -3.3443140983581543e-01 4.6291690319776535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 3.5080160014331341e-03</internalNodes>
+          <leafValues>
+            -6.4612612128257751e-02 2.2737669944763184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 4.4291261583566666e-02</internalNodes>
+          <leafValues>
+            2.2642729803919792e-02 -7.0683121681213379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 1.9108189269900322e-02</internalNodes>
+          <leafValues>
+            -3.5893321037292480e-02 1.4613699913024902e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>99</maxWeakCount>
+      <stageThreshold>-1.8724700212478638e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 857 -1.6636669635772705e-02</internalNodes>
+          <leafValues>
+            2.5966519117355347e-01 -4.1162249445915222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 2.9865810647606850e-02</internalNodes>
+          <leafValues>
+            -3.3182668685913086e-01 2.0545999705791473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 9.1892024502158165e-03</internalNodes>
+          <leafValues>
+            -3.4481799602508545e-01 1.8148690462112427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 2.8450509998947382e-03</internalNodes>
+          <leafValues>
+            -3.2904830574989319e-01 9.4392292201519012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 3.4257639199495316e-02</internalNodes>
+          <leafValues>
+            -3.2212799787521362e-01 1.7332050204277039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 3.4367710351943970e-02</internalNodes>
+          <leafValues>
+            -3.2593810558319092e-01 1.7473269999027252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 9.0881884098052979e-03</internalNodes>
+          <leafValues>
+            1.0527010262012482e-01 -4.8131370544433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -5.0939731299877167e-03</internalNodes>
+          <leafValues>
+            1.7374989390373230e-01 -2.7883121371269226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 1.1773620499297976e-03</internalNodes>
+          <leafValues>
+            -4.2217200994491577e-01 1.0231760144233704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 3.6797609180212021e-02</internalNodes>
+          <leafValues>
+            1.1229369789361954e-01 -3.8409191370010376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -7.2484882548451424e-04</internalNodes>
+          <leafValues>
+            -4.4795128703117371e-01 8.5079587996006012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 1.2603210285305977e-02</internalNodes>
+          <leafValues>
+            6.0475040227174759e-02 -3.5327509045600891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 5.1925552543252707e-04</internalNodes>
+          <leafValues>
+            -3.1916388869285583e-01 1.1903370171785355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -1.3244180008769035e-02</internalNodes>
+          <leafValues>
+            2.1975730359554291e-01 -9.5025591552257538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -2.7882310096174479e-03</internalNodes>
+          <leafValues>
+            -2.7294808626174927e-01 1.2419769912958145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 2.6591470465064049e-02</internalNodes>
+          <leafValues>
+            6.0452010482549667e-02 -3.9637029170989990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 1.2505210004746914e-02</internalNodes>
+          <leafValues>
+            7.8631103038787842e-02 -4.0303888916969299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -1.3857340440154076e-02</internalNodes>
+          <leafValues>
+            2.5759750604629517e-01 -1.0351459681987762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 7.2099752724170685e-02</internalNodes>
+          <leafValues>
+            -5.5193781852722168e-01 6.0020800679922104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 -9.8338630050420761e-04</internalNodes>
+          <leafValues>
+            -3.1915199756622314e-01 8.7977647781372070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -5.8390170335769653e-02</internalNodes>
+          <leafValues>
+            -5.5988979339599609e-01 5.2990190684795380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 4.2504342272877693e-03</internalNodes>
+          <leafValues>
+            -2.8897258639335632e-01 9.2816516757011414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -3.2332520931959152e-02</internalNodes>
+          <leafValues>
+            -4.8713520169258118e-01 6.0787629336118698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 4.7365639358758926e-02</internalNodes>
+          <leafValues>
+            -1.0111550241708755e-01 3.2597780227661133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -3.8943330291658640e-03</internalNodes>
+          <leafValues>
+            1.9173160195350647e-01 -1.6729380190372467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 5.7729199528694153e-02</internalNodes>
+          <leafValues>
+            3.6343291401863098e-02 -7.3161131143569946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 -1.8925540149211884e-02</internalNodes>
+          <leafValues>
+            3.2471498847007751e-01 -8.6188063025474548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -3.9679601788520813e-02</internalNodes>
+          <leafValues>
+            -4.1826680302619934e-01 5.3354211151599884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 -2.0733650773763657e-02</internalNodes>
+          <leafValues>
+            -4.1205188632011414e-01 6.3596852123737335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 1.5387910604476929e-01</internalNodes>
+          <leafValues>
+            1.9954150542616844e-02 -5.7643288373947144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 1.2131260335445404e-01</internalNodes>
+          <leafValues>
+            4.4516459107398987e-02 -5.9093242883682251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 2.7478559786686674e-05</internalNodes>
+          <leafValues>
+            -4.0688499808311462e-01 5.2828099578619003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 8.8893681764602661e-02</internalNodes>
+          <leafValues>
+            5.1985241472721100e-02 -5.0228989124298096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 2.8169099241495132e-03</internalNodes>
+          <leafValues>
+            6.7726433277130127e-02 -1.3582049310207367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -1.7215269326698035e-04</internalNodes>
+          <leafValues>
+            8.9616917073726654e-02 -2.9589369893074036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 -3.1830620020627975e-02</internalNodes>
+          <leafValues>
+            -5.6433600187301636e-01 2.2822249680757523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -6.3334330916404724e-02</internalNodes>
+          <leafValues>
+            -8.2371699810028076e-01 2.7576120570302010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -6.9032818078994751e-02</internalNodes>
+          <leafValues>
+            -6.9788217544555664e-01 3.3770920708775520e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 2.1021519787609577e-03</internalNodes>
+          <leafValues>
+            -2.7244049310684204e-01 8.6922891438007355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 3.4065779298543930e-02</internalNodes>
+          <leafValues>
+            1.7670579254627228e-02 -4.3001320958137512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 8.1215314567089081e-03</internalNodes>
+          <leafValues>
+            -1.5942670404911041e-01 1.6256070137023926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 -1.6329119680449367e-03</internalNodes>
+          <leafValues>
+            4.2009588330984116e-02 -3.2923451066017151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -3.9110329002141953e-02</internalNodes>
+          <leafValues>
+            -6.0666251182556152e-01 4.1248850524425507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -2.3188870400190353e-02</internalNodes>
+          <leafValues>
+            -5.5365419387817383e-01 1.7315510660409927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 -6.2944158911705017e-02</internalNodes>
+          <leafValues>
+            -5.3853708505630493e-01 4.1758351027965546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 -8.5414372384548187e-02</internalNodes>
+          <leafValues>
+            -9.3122452497482300e-01 -9.1123272432014346e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -4.1963338851928711e-02</internalNodes>
+          <leafValues>
+            -5.6720697879791260e-01 3.9175700396299362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 1.1165619827806950e-02</internalNodes>
+          <leafValues>
+            -6.7815810441970825e-02 2.9003840684890747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 -1.3730769976973534e-02</internalNodes>
+          <leafValues>
+            3.2328099012374878e-01 -1.0592839866876602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -7.5793050229549408e-02</internalNodes>
+          <leafValues>
+            5.5545729398727417e-01 -3.2934208866208792e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 2.7008100878447294e-03</internalNodes>
+          <leafValues>
+            1.5311180055141449e-01 -1.6604180634021759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 1.0164660401642323e-02</internalNodes>
+          <leafValues>
+            7.6404631137847900e-02 -2.8745749592781067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -5.9808149933815002e-02</internalNodes>
+          <leafValues>
+            -7.3486739397048950e-01 3.0370820313692093e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 9.6447616815567017e-02</internalNodes>
+          <leafValues>
+            2.6198839768767357e-02 -6.6001427173614502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 3.2350219786167145e-02</internalNodes>
+          <leafValues>
+            4.1407719254493713e-02 -4.7442498803138733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 2.3717279732227325e-01</internalNodes>
+          <leafValues>
+            -9.5941081643104553e-02 2.4070499837398529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 -4.0942471474409103e-02</internalNodes>
+          <leafValues>
+            -4.0582120418548584e-01 6.4327560365200043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -3.4409161657094955e-02</internalNodes>
+          <leafValues>
+            -7.4849551916122437e-01 2.2520760074257851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 1.3847379386425018e-01</internalNodes>
+          <leafValues>
+            2.8472309932112694e-02 -7.0612120628356934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 4.6567160636186600e-02</internalNodes>
+          <leafValues>
+            -4.1168119758367538e-02 6.9962567090988159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -3.0492639169096947e-02</internalNodes>
+          <leafValues>
+            -6.5116977691650391e-01 3.9995279163122177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 8.6345896124839783e-03</internalNodes>
+          <leafValues>
+            -1.1207970231771469e-01 7.7241696417331696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 3.1845968216657639e-02</internalNodes>
+          <leafValues>
+            -1.1552079766988754e-01 1.7539389431476593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 1.7124590277671814e-01</internalNodes>
+          <leafValues>
+            5.0687979906797409e-02 -4.7042238712310791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 5.2879499271512032e-03</internalNodes>
+          <leafValues>
+            6.5041497349739075e-02 -2.8894019126892090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 1.0060779750347137e-02</internalNodes>
+          <leafValues>
+            6.3689216971397400e-02 -2.6081889867782593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 3.3330768346786499e-02</internalNodes>
+          <leafValues>
+            3.4809298813343048e-02 -5.7845467329025269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -5.2802279591560364e-02</internalNodes>
+          <leafValues>
+            -6.8521040678024292e-01 1.7583779990673065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -1.5452199615538120e-02</internalNodes>
+          <leafValues>
+            3.1395891308784485e-01 -7.7611543238162994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 -6.5528601408004761e-04</internalNodes>
+          <leafValues>
+            5.6181360036134720e-02 -1.5184390544891357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 3.7062149494886398e-02</internalNodes>
+          <leafValues>
+            2.8928549960255623e-02 -7.0487600564956665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -5.7728089392185211e-02</internalNodes>
+          <leafValues>
+            -4.3192410469055176e-01 9.2153800651431084e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -2.2813139948993921e-03</internalNodes>
+          <leafValues>
+            1.0200300067663193e-01 -2.1657040715217590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 2.6513230055570602e-02</internalNodes>
+          <leafValues>
+            -8.3650946617126465e-02 3.0740359425544739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 7.3622196912765503e-02</internalNodes>
+          <leafValues>
+            3.0683049932122231e-02 -7.1910232305526733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 -1.3022350147366524e-02</internalNodes>
+          <leafValues>
+            -3.6386561393737793e-01 2.5367209687829018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 -1.3319820165634155e-02</internalNodes>
+          <leafValues>
+            -5.1884061098098755e-01 3.5935029387474060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 2.3190369829535484e-03</internalNodes>
+          <leafValues>
+            -6.1515200883150101e-02 7.1100451052188873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -2.1372830495238304e-02</internalNodes>
+          <leafValues>
+            -5.0247579813003540e-01 3.9844810962677002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 2.4474589154124260e-02</internalNodes>
+          <leafValues>
+            -4.7960858792066574e-02 2.6931110024452209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 -1.0679869912564754e-02</internalNodes>
+          <leafValues>
+            3.1474280357360840e-01 -8.4758952260017395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 4.8961799591779709e-02</internalNodes>
+          <leafValues>
+            2.7358099818229675e-02 -3.8229361176490784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 3.2376348972320557e-02</internalNodes>
+          <leafValues>
+            -4.7090999782085419e-02 4.5985230803489685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 -1.0995220392942429e-02</internalNodes>
+          <leafValues>
+            -1.8544240295886993e-01 3.6006979644298553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 1.7626030743122101e-01</internalNodes>
+          <leafValues>
+            2.4375159293413162e-02 -7.7686601877212524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 7.9778492450714111e-02</internalNodes>
+          <leafValues>
+            3.3787339925765991e-03 -7.2928887605667114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 -1.1329210363328457e-02</internalNodes>
+          <leafValues>
+            -4.6397671103477478e-01 3.9380829781293869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 6.3431300222873688e-02</internalNodes>
+          <leafValues>
+            -9.7074061632156372e-02 1.0118869692087173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -1.2691849842667580e-02</internalNodes>
+          <leafValues>
+            2.8142300248146057e-01 -7.2105713188648224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 -7.8238412737846375e-02</internalNodes>
+          <leafValues>
+            5.7400637865066528e-01 -1.8400549888610840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 3.9532519876956940e-02</internalNodes>
+          <leafValues>
+            4.3154988437891006e-02 -5.2327841520309448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 1.5355779789388180e-02</internalNodes>
+          <leafValues>
+            -4.7316178679466248e-02 4.6925771236419678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -6.4018620178103447e-03</internalNodes>
+          <leafValues>
+            1.3297230005264282e-01 -1.4365619421005249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -1.0567340254783630e-01</internalNodes>
+          <leafValues>
+            2.0206320285797119e-01 -1.4406460337340832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 2.8163839131593704e-02</internalNodes>
+          <leafValues>
+            7.1180991828441620e-02 -3.1034231185913086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 1.1702980101108551e-01</internalNodes>
+          <leafValues>
+            1.1619930155575275e-02 -7.1530961990356445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 -3.8921568542718887e-02</internalNodes>
+          <leafValues>
+            2.4412679672241211e-01 -8.2244850695133209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 -2.8435489162802696e-02</internalNodes>
+          <leafValues>
+            -3.6785170435905457e-01 3.8488820195198059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -3.6393549293279648e-02</internalNodes>
+          <leafValues>
+            5.2206730842590332e-01 -4.7079380601644516e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>139</maxWeakCount>
+      <stageThreshold>-1.7121059894561768e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 956 -2.1428510546684265e-02</internalNodes>
+          <leafValues>
+            1.9014079868793488e-01 -5.0612741708755493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 2.0596129819750786e-02</internalNodes>
+          <leafValues>
+            -2.9283228516578674e-01 2.4655179679393768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 2.7893469668924809e-03</internalNodes>
+          <leafValues>
+            1.1085920035839081e-01 -4.6909829974174500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 4.4722640886902809e-03</internalNodes>
+          <leafValues>
+            -2.8250780701637268e-01 1.4564670622348785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 -1.0463190264999866e-03</internalNodes>
+          <leafValues>
+            -2.6603269577026367e-01 1.2815919518470764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 1.5831940108910203e-03</internalNodes>
+          <leafValues>
+            -6.3467299938201904e-01 7.1003831923007965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 -7.3153319135599304e-06</internalNodes>
+          <leafValues>
+            1.0248930007219315e-01 -3.4815961122512817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 5.4208859801292419e-03</internalNodes>
+          <leafValues>
+            5.9830531477928162e-02 -3.1387779116630554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 1.2645759852603078e-03</internalNodes>
+          <leafValues>
+            -2.2709150612354279e-01 1.3160009682178497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 3.0235300073400140e-05</internalNodes>
+          <leafValues>
+            -2.6413309574127197e-01 2.8918080031871796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 1.5345469582825899e-03</internalNodes>
+          <leafValues>
+            -4.0711951255798340e-01 6.9787837564945221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 6.8222070112824440e-03</internalNodes>
+          <leafValues>
+            -1.5069720149040222e-01 2.1888419985771179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 -9.8558319732546806e-03</internalNodes>
+          <leafValues>
+            -3.5441368818283081e-01 8.6026392877101898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -2.9890429228544235e-02</internalNodes>
+          <leafValues>
+            2.2117440402507782e-01 -2.8611009940505028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -2.6285760104656219e-03</internalNodes>
+          <leafValues>
+            9.8204180598258972e-02 -2.7149739861488342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 3.2039839425124228e-04</internalNodes>
+          <leafValues>
+            -9.8540462553501129e-02 1.8785539269447327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 1.1079469695687294e-03</internalNodes>
+          <leafValues>
+            6.4034536480903625e-02 -4.3082669377326965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 -9.1538369655609131e-02</internalNodes>
+          <leafValues>
+            -5.2440929412841797e-01 1.2250489555299282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 4.3205898255109787e-02</internalNodes>
+          <leafValues>
+            9.6655867993831635e-02 -2.6809310913085938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 9.1920839622616768e-04</internalNodes>
+          <leafValues>
+            -1.3260160386562347e-01 1.2358319759368896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 8.9521165937185287e-03</internalNodes>
+          <leafValues>
+            8.6445420980453491e-02 -2.3219430446624756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 5.6190020404756069e-03</internalNodes>
+          <leafValues>
+            -6.0304049402475357e-02 1.5070669353008270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 3.7380240391939878e-03</internalNodes>
+          <leafValues>
+            -1.8652540445327759e-01 1.3011780381202698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -4.4416960328817368e-02</internalNodes>
+          <leafValues>
+            1.9036759436130524e-01 -1.7527159303426743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 1.9832739606499672e-02</internalNodes>
+          <leafValues>
+            -5.3527630865573883e-02 4.0238130092620850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 1.2155610136687756e-02</internalNodes>
+          <leafValues>
+            9.1288566589355469e-02 -2.6862761378288269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 5.0532341003417969e-02</internalNodes>
+          <leafValues>
+            3.1295180320739746e-02 -6.2836539745330811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -1.7635909607633948e-03</internalNodes>
+          <leafValues>
+            5.6185219436883926e-02 -2.1861009299755096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 4.9412921071052551e-03</internalNodes>
+          <leafValues>
+            5.5915899574756622e-02 -3.5954388976097107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -1.1536119878292084e-01</internalNodes>
+          <leafValues>
+            -5.3168737888336182e-01 7.9654296860098839e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -2.0473708864301443e-03</internalNodes>
+          <leafValues>
+            7.9633012413978577e-02 -2.5389900803565979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 4.7814860008656979e-03</internalNodes>
+          <leafValues>
+            -9.4149880111217499e-02 1.1631009727716446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 2.1274939179420471e-02</internalNodes>
+          <leafValues>
+            -4.7486610710620880e-02 3.7564519047737122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 5.1177050918340683e-03</internalNodes>
+          <leafValues>
+            7.4936643242835999e-02 -2.6105350255966187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 -1.3952000066637993e-02</internalNodes>
+          <leafValues>
+            2.3960170149803162e-01 -9.6836768090724945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.3828179799020290e-02</internalNodes>
+          <leafValues>
+            -3.9605268836021423e-01 5.8639749884605408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -4.7117020934820175e-02</internalNodes>
+          <leafValues>
+            -5.5717539787292480e-01 3.1678650528192520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 1.0515590198338032e-02</internalNodes>
+          <leafValues>
+            -4.3930530548095703e-02 8.5277959704399109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 4.0591089054942131e-03</internalNodes>
+          <leafValues>
+            -1.0774219781160355e-01 1.6283099353313446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -3.0376210808753967e-02</internalNodes>
+          <leafValues>
+            2.0997379720211029e-01 -9.9417790770530701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 -6.6932791378349066e-04</internalNodes>
+          <leafValues>
+            -3.4863340854644775e-01 5.9148021042346954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 -1.4665089547634125e-02</internalNodes>
+          <leafValues>
+            -4.3786540627479553e-01 2.8008179739117622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 -3.5847770050168037e-03</internalNodes>
+          <leafValues>
+            9.6611537039279938e-02 -1.7948310077190399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -5.5043050087988377e-03</internalNodes>
+          <leafValues>
+            -3.3546659350395203e-01 7.5057849287986755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 1.0141800157725811e-03</internalNodes>
+          <leafValues>
+            -1.8602859973907471e-01 8.6880050599575043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 1.4642399735748768e-02</internalNodes>
+          <leafValues>
+            2.6652090251445770e-02 -2.6002681255340576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 -5.8538499288260937e-03</internalNodes>
+          <leafValues>
+            -1.4993189275264740e-01 1.2684640288352966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -5.3472168743610382e-02</internalNodes>
+          <leafValues>
+            5.2131122350692749e-01 -2.0375749096274376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -7.6695926487445831e-02</internalNodes>
+          <leafValues>
+            4.5817071199417114e-01 -3.4876950085163116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -5.9094227617606521e-04</internalNodes>
+          <leafValues>
+            1.1570499837398529e-01 -1.2966969609260559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 -4.3543361127376556e-02</internalNodes>
+          <leafValues>
+            -8.2132732868194580e-01 2.0535599440336227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 5.0691701471805573e-02</internalNodes>
+          <leafValues>
+            -3.6280639469623566e-02 4.0212449431419373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 1.3124669902026653e-02</internalNodes>
+          <leafValues>
+            -8.3614267408847809e-02 2.0441520214080811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 3.5445049405097961e-01</internalNodes>
+          <leafValues>
+            1.4580509625375271e-02 -5.6883698701858521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 -2.1929910406470299e-02</internalNodes>
+          <leafValues>
+            1.6368280351161957e-01 -1.0018540173768997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 3.8168739527463913e-02</internalNodes>
+          <leafValues>
+            3.5331390798091888e-02 -5.3782612085342407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 6.3126571476459503e-03</internalNodes>
+          <leafValues>
+            5.6145761162042618e-02 -2.8158029913902283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 -4.3002668768167496e-02</internalNodes>
+          <leafValues>
+            -6.4804542064666748e-01 1.7478020861744881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 2.4681850336492062e-03</internalNodes>
+          <leafValues>
+            -1.1719709634780884e-01 1.3693059980869293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 4.5261289924383163e-02</internalNodes>
+          <leafValues>
+            1.5927750617265701e-02 -7.1915590763092041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 -4.2067110538482666e-02</internalNodes>
+          <leafValues>
+            -6.4201879501342773e-01 2.0196499302983284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 3.9601750904694200e-04</internalNodes>
+          <leafValues>
+            -3.1774568557739258e-01 7.6843477785587311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 -1.2469319626688957e-02</internalNodes>
+          <leafValues>
+            1.9531419873237610e-01 -7.8799232840538025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 7.9188523814082146e-03</internalNodes>
+          <leafValues>
+            5.6721080094575882e-02 -2.6906439661979675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -6.2929331324994564e-03</internalNodes>
+          <leafValues>
+            1.5688340365886688e-01 -9.9287010729312897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 2.2974120453000069e-02</internalNodes>
+          <leafValues>
+            -6.6930226981639862e-02 2.4427099525928497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 -9.1710267588496208e-03</internalNodes>
+          <leafValues>
+            -2.9078531265258789e-01 5.9312019497156143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 -9.5892272889614105e-02</internalNodes>
+          <leafValues>
+            -6.3700878620147705e-01 1.3278760015964508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 5.6696119718253613e-03</internalNodes>
+          <leafValues>
+            5.6131001561880112e-02 -2.9535120725631714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 -1.3495329767465591e-02</internalNodes>
+          <leafValues>
+            2.0205779373645782e-01 -6.3128583133220673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 1.6108239069581032e-02</internalNodes>
+          <leafValues>
+            4.5092061161994934e-02 -3.6163818836212158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 1.1768710101023316e-03</internalNodes>
+          <leafValues>
+            -1.9879919290542603e-01 1.3078540563583374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 1.4128970215097070e-03</internalNodes>
+          <leafValues>
+            -2.0856089890003204e-01 8.1473708152770996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -4.3028060346841812e-02</internalNodes>
+          <leafValues>
+            -2.8687548637390137e-01 2.9704660177230835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -1.0961409658193588e-02</internalNodes>
+          <leafValues>
+            4.8846191167831421e-01 -3.5002779215574265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -4.5575079275295138e-04</internalNodes>
+          <leafValues>
+            1.0644569993019104e-01 -1.0506340116262436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 -5.0013329833745956e-02</internalNodes>
+          <leafValues>
+            -8.2039457559585571e-01 1.8604470416903496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -4.6841200441122055e-02</internalNodes>
+          <leafValues>
+            -8.6972111463546753e-01 3.9388639852404594e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 -8.0362131120637059e-04</internalNodes>
+          <leafValues>
+            1.4196899533271790e-01 -1.2184119969606400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 1.9802400842308998e-02</internalNodes>
+          <leafValues>
+            4.0857948362827301e-02 -3.6116421222686768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 2.1874029189348221e-02</internalNodes>
+          <leafValues>
+            -5.8230601251125336e-02 2.4490930140018463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 3.2371848821640015e-02</internalNodes>
+          <leafValues>
+            2.6172259822487831e-02 -4.0803569555282593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 -7.0319771766662598e-03</internalNodes>
+          <leafValues>
+            -2.5175130367279053e-01 6.0090810060501099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 2.6019799988716841e-03</internalNodes>
+          <leafValues>
+            -7.0827886462211609e-02 2.0735129714012146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -3.1531439162790775e-03</internalNodes>
+          <leafValues>
+            1.7268289625644684e-01 -1.1326900124549866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 5.8357551693916321e-02</internalNodes>
+          <leafValues>
+            1.4668770134449005e-02 -9.2907238006591797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 3.6941959988325834e-03</internalNodes>
+          <leafValues>
+            6.6812008619308472e-02 -2.0454549789428711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 1.8183739855885506e-02</internalNodes>
+          <leafValues>
+            -3.5921659320592880e-02 2.3765130341053009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 -4.4514648616313934e-03</internalNodes>
+          <leafValues>
+            -1.8156670033931732e-01 8.0072969198226929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 3.5554010421037674e-02</internalNodes>
+          <leafValues>
+            1.1413309723138809e-02 -3.9503180980682373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 1.6067499294877052e-02</internalNodes>
+          <leafValues>
+            -4.9147009849548340e-02 3.0306708812713623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 3.6372188478708267e-02</internalNodes>
+          <leafValues>
+            2.3675160482525826e-02 -6.8069261312484741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 -7.4834008701145649e-03</internalNodes>
+          <leafValues>
+            2.4146680533885956e-01 -5.8301728218793869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -7.2762509807944298e-03</internalNodes>
+          <leafValues>
+            -2.2373069822788239e-01 5.0284590572118759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -4.7946218401193619e-03</internalNodes>
+          <leafValues>
+            -2.1922710537910461e-01 6.6698201000690460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 -1.3066439889371395e-02</internalNodes>
+          <leafValues>
+            2.2604539990425110e-01 -3.7037428468465805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 2.3257338907569647e-03</internalNodes>
+          <leafValues>
+            -8.1509239971637726e-02 2.3270750045776367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 -1.1436239816248417e-02</internalNodes>
+          <leafValues>
+            6.7732691764831543e-02 -3.3069651573896408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 6.7957569845020771e-03</internalNodes>
+          <leafValues>
+            9.3188859522342682e-02 -1.8542419373989105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -5.2705928683280945e-02</internalNodes>
+          <leafValues>
+            4.0707829594612122e-01 -2.5846559554338455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 1.2774269282817841e-01</internalNodes>
+          <leafValues>
+            1.7207339406013489e-02 -8.8952672481536865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -2.7999880909919739e-01</internalNodes>
+          <leafValues>
+            -9.1963422298431396e-01 2.5054879370145500e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 1.2669020332396030e-02</internalNodes>
+          <leafValues>
+            -7.3152393102645874e-02 2.0872280001640320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 -1.5894599258899689e-02</internalNodes>
+          <leafValues>
+            1.1266420036554337e-01 -4.0140561759471893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 5.3938169032335281e-02</internalNodes>
+          <leafValues>
+            3.0137389898300171e-02 -5.0454300642013550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 7.3805922875180840e-04</internalNodes>
+          <leafValues>
+            -3.5923779010772705e-01 3.3418480306863785e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 4.7065159305930138e-03</internalNodes>
+          <leafValues>
+            4.4195190072059631e-01 -3.9396088570356369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 3.0945870094001293e-03</internalNodes>
+          <leafValues>
+            -7.1224376559257507e-02 1.2306260317564011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 -3.2640039920806885e-02</internalNodes>
+          <leafValues>
+            -4.4644719362258911e-01 3.4509830176830292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 -7.8390557318925858e-03</internalNodes>
+          <leafValues>
+            -9.9895596504211426e-02 3.3491879701614380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 7.6504289172589779e-03</internalNodes>
+          <leafValues>
+            5.5107340216636658e-02 -2.4002109467983246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 3.8153179921209812e-03</internalNodes>
+          <leafValues>
+            -5.7143520563840866e-02 1.7120680212974548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 1.4295349828898907e-02</internalNodes>
+          <leafValues>
+            -5.5747661739587784e-02 2.6719009876251221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 -1.8241480574943125e-04</internalNodes>
+          <leafValues>
+            4.7362379729747772e-02 -2.1473219990730286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 -3.1916480511426926e-02</internalNodes>
+          <leafValues>
+            -1.4398300647735596e-01 9.2526309192180634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 -7.6755490154027939e-03</internalNodes>
+          <leafValues>
+            1.2513080239295959e-01 -5.2855581045150757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 1.4152109622955322e-02</internalNodes>
+          <leafValues>
+            -5.8198999613523483e-02 2.4444380402565002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 -1.6701059415936470e-02</internalNodes>
+          <leafValues>
+            -3.0269339680671692e-01 2.5713469833135605e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 3.5869849380105734e-03</internalNodes>
+          <leafValues>
+            -1.1999790370464325e-01 1.2468840181827545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 3.7683059927076101e-03</internalNodes>
+          <leafValues>
+            5.0271350890398026e-02 -2.0477029681205750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 9.9043175578117371e-04</internalNodes>
+          <leafValues>
+            -8.5413850843906403e-02 1.6316239535808563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 9.3151312321424484e-03</internalNodes>
+          <leafValues>
+            9.4177378341555595e-03 -3.5209101438522339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 -1.5002860163804144e-04</internalNodes>
+          <leafValues>
+            8.3480976521968842e-02 -1.7047779262065887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 8.7790598627179861e-04</internalNodes>
+          <leafValues>
+            -1.1054719984531403e-01 1.1750820279121399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 -3.7630271166563034e-02</internalNodes>
+          <leafValues>
+            5.0325840711593628e-01 -2.6165060698986053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 5.6488867849111557e-03</internalNodes>
+          <leafValues>
+            7.4713237583637238e-02 -1.4058519899845123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 -1.4621330192312598e-03</internalNodes>
+          <leafValues>
+            6.7465327680110931e-02 -2.0143230259418488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 5.3189881145954132e-03</internalNodes>
+          <leafValues>
+            -3.5997938364744186e-02 3.7376481294631958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 2.1019520238041878e-02</internalNodes>
+          <leafValues>
+            2.7063809335231781e-02 -5.0199657678604126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 -1.1328969895839691e-01</internalNodes>
+          <leafValues>
+            -7.4395442008972168e-01 1.3778089545667171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 -6.1144838109612465e-03</internalNodes>
+          <leafValues>
+            1.4044840633869171e-01 -8.7939672172069550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 -7.7648349106311798e-03</internalNodes>
+          <leafValues>
+            -1.4341640472412109e-01 4.3061099946498871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 -9.1335996985435486e-02</internalNodes>
+          <leafValues>
+            -6.3246071338653564e-01 2.0902950316667557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 -1.6339610517024994e-01</internalNodes>
+          <leafValues>
+            -7.7071088552474976e-01 1.3627690263092518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 5.3004521131515503e-01</internalNodes>
+          <leafValues>
+            1.2292830273509026e-02 -7.9708522558212280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 -3.0609068926423788e-03</internalNodes>
+          <leafValues>
+            5.7478528469800949e-02 -8.8626816868782043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 1.3204859569668770e-03</internalNodes>
+          <leafValues>
+            -1.0473939776420593e-01 1.2416320294141769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 -6.6045127809047699e-02</internalNodes>
+          <leafValues>
+            -7.0403701066970825e-01 7.2672651149332523e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 5.2080051973462105e-03</internalNodes>
+          <leafValues>
+            7.3289416730403900e-02 -1.6105780005455017e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>106</maxWeakCount>
+      <stageThreshold>-1.8098859786987305e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1095 -2.4040700867772102e-02</internalNodes>
+          <leafValues>
+            2.4318559467792511e-01 -3.8189288973808289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 2.6374191045761108e-01</internalNodes>
+          <leafValues>
+            -2.5091141462326050e-01 2.7231940627098083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 3.3161949831992388e-03</internalNodes>
+          <leafValues>
+            -2.8115370869636536e-01 2.2977580130100250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 2.5751669891178608e-03</internalNodes>
+          <leafValues>
+            -6.4815878868103027e-01 8.3049327135086060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 1.2843149714171886e-02</internalNodes>
+          <leafValues>
+            -5.4388070106506348e-01 8.6304552853107452e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 1.3005360029637814e-02</internalNodes>
+          <leafValues>
+            -2.6411589980125427e-01 2.2107879817485809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 2.6304060593247414e-02</internalNodes>
+          <leafValues>
+            -2.2276160120964050e-01 2.2458629310131073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 -6.8887993693351746e-02</internalNodes>
+          <leafValues>
+            4.4677790999412537e-01 -1.8398750573396683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 1.5864400193095207e-02</internalNodes>
+          <leafValues>
+            -3.3532321453094482e-01 1.6380620002746582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 -7.1481592021882534e-03</internalNodes>
+          <leafValues>
+            -3.5999459028244019e-01 1.0679650306701660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 -1.2002130039036274e-02</internalNodes>
+          <leafValues>
+            -3.7498581409454346e-01 9.6759349107742310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 -2.6663220487535000e-03</internalNodes>
+          <leafValues>
+            -3.8941639661788940e-01 5.9776391834020615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 5.2618351764976978e-04</internalNodes>
+          <leafValues>
+            -3.0557510256767273e-01 1.0778070241212845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 -4.0705721825361252e-02</internalNodes>
+          <leafValues>
+            -5.8572947978973389e-01 4.0660858154296875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 -8.7929163128137589e-03</internalNodes>
+          <leafValues>
+            2.3699410259723663e-01 -1.3827539980411530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 -2.2475840523838997e-03</internalNodes>
+          <leafValues>
+            -3.5475319623947144e-01 8.9079782366752625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 5.8501982130110264e-03</internalNodes>
+          <leafValues>
+            9.1695636510848999e-02 -3.3329799771308899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 -3.9623910561203957e-03</internalNodes>
+          <leafValues>
+            -1.9845740497112274e-01 1.2363869696855545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 -1.7685770289972425e-03</internalNodes>
+          <leafValues>
+            7.3684811592102051e-02 -4.5862528681755066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 6.3303880393505096e-02</internalNodes>
+          <leafValues>
+            4.8690151423215866e-02 -5.7301318645477295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 7.9875197261571884e-03</internalNodes>
+          <leafValues>
+            -8.1072300672531128e-01 2.7054410427808762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 -1.3520400039851665e-02</internalNodes>
+          <leafValues>
+            1.6274809837341309e-01 -1.6841860115528107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 4.8139609396457672e-02</internalNodes>
+          <leafValues>
+            4.5234218239784241e-02 -5.7300239801406860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 5.0355647690594196e-03</internalNodes>
+          <leafValues>
+            6.5225511789321899e-02 -2.5856611132621765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 1.9625260028988123e-04</internalNodes>
+          <leafValues>
+            1.4221550524234772e-01 -1.8481519818305969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 2.5747891049832106e-03</internalNodes>
+          <leafValues>
+            -3.5904300212860107e-01 7.5663506984710693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 -4.0524629876017570e-03</internalNodes>
+          <leafValues>
+            -2.1212129294872284e-01 1.1840210109949112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 5.6920260190963745e-02</internalNodes>
+          <leafValues>
+            -4.3657299131155014e-02 3.8774600625038147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 3.7986990064382553e-02</internalNodes>
+          <leafValues>
+            -8.1706330180168152e-02 3.9529800415039062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 -2.2731529548764229e-02</internalNodes>
+          <leafValues>
+            -3.4693419933319092e-01 6.8438567221164703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 9.9069473799318075e-04</internalNodes>
+          <leafValues>
+            -3.6681869626045227e-01 6.1036650091409683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -4.3086782097816467e-03</internalNodes>
+          <leafValues>
+            1.4361980557441711e-01 -9.6160076558589935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -2.5202209129929543e-02</internalNodes>
+          <leafValues>
+            -4.6109348535537720e-01 5.9420660138130188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 -3.3597718924283981e-02</internalNodes>
+          <leafValues>
+            -4.7127521038055420e-01 9.6356319263577461e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 -4.6891071833670139e-03</internalNodes>
+          <leafValues>
+            1.9676209986209869e-01 -1.1853359639644623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 2.4549920111894608e-02</internalNodes>
+          <leafValues>
+            -4.5542590320110321e-02 2.8717058897018433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 -1.8802500562742352e-03</internalNodes>
+          <leafValues>
+            -2.9892438650131226e-01 8.0199889838695526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 2.0160999894142151e-01</internalNodes>
+          <leafValues>
+            3.0502580106258392e-02 -4.8414209485054016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 -6.9803953170776367e-02</internalNodes>
+          <leafValues>
+            -6.2382811307907104e-01 3.5180661827325821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 9.1318902559578419e-04</internalNodes>
+          <leafValues>
+            -1.9935069978237152e-01 6.8270348012447357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 1.4578959904611111e-02</internalNodes>
+          <leafValues>
+            1.0063359886407852e-01 -2.5353130698204041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 5.0130348652601242e-02</internalNodes>
+          <leafValues>
+            5.7192109525203705e-02 -4.1628059744834900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 -1.8048109486699104e-02</internalNodes>
+          <leafValues>
+            -4.4572651386260986e-01 5.0399489700794220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 1.4818160235881805e-01</internalNodes>
+          <leafValues>
+            1.6779610887169838e-02 -4.5810478925704956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 -2.6285950094461441e-02</internalNodes>
+          <leafValues>
+            3.5442620515823364e-01 -6.1184428632259369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 -1.8414109945297241e-02</internalNodes>
+          <leafValues>
+            -3.2132109999656677e-01 7.6148152351379395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 6.1610070988535881e-03</internalNodes>
+          <leafValues>
+            8.7946079671382904e-02 -2.5913208723068237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 -2.5900160893797874e-02</internalNodes>
+          <leafValues>
+            3.0681431293487549e-01 -6.5600410103797913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 1.5014899894595146e-02</internalNodes>
+          <leafValues>
+            -5.6076969951391220e-02 3.8661429286003113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 -4.3112158775329590e-02</internalNodes>
+          <leafValues>
+            5.5926108360290527e-01 -3.9232630282640457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 -2.1485170349478722e-02</internalNodes>
+          <leafValues>
+            -4.6384871006011963e-01 4.8264618963003159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -2.5131789967417717e-02</internalNodes>
+          <leafValues>
+            -4.8091739416122437e-01 4.1346170008182526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 4.1451459401287138e-04</internalNodes>
+          <leafValues>
+            4.4691830873489380e-02 -4.2174011468887329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 1.0218570008873940e-02</internalNodes>
+          <leafValues>
+            5.3744480013847351e-02 -1.9395479559898376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 -2.0342700183391571e-02</internalNodes>
+          <leafValues>
+            2.9722499847412109e-01 -7.1297563612461090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 -3.0666049569845200e-02</internalNodes>
+          <leafValues>
+            -3.9920780062675476e-01 4.5510981231927872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 -3.2767441123723984e-02</internalNodes>
+          <leafValues>
+            -5.0248539447784424e-01 4.4888608157634735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 -5.4365001618862152e-02</internalNodes>
+          <leafValues>
+            -4.7751170396804810e-01 4.1882470250129700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 -2.9916359111666679e-02</internalNodes>
+          <leafValues>
+            3.5793611407279968e-01 -6.1831939965486526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 1.0144179686903954e-02</internalNodes>
+          <leafValues>
+            -1.5790919959545135e-01 5.7373359799385071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 1.5639010071754456e-01</internalNodes>
+          <leafValues>
+            3.2949700951576233e-02 -6.4462232589721680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 5.4447978734970093e-02</internalNodes>
+          <leafValues>
+            -4.1508059948682785e-02 1.2866689264774323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 -3.9772719144821167e-02</internalNodes>
+          <leafValues>
+            -6.8962317705154419e-01 2.9046570882201195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 6.9650667719542980e-03</internalNodes>
+          <leafValues>
+            -9.4761677086353302e-02 1.8257130682468414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 -5.1617428660392761e-02</internalNodes>
+          <leafValues>
+            -4.4907289743423462e-01 4.3913140892982483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 -2.6814609766006470e-02</internalNodes>
+          <leafValues>
+            -2.2568839788436890e-01 5.4928071796894073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 1.3181920163333416e-02</internalNodes>
+          <leafValues>
+            8.0101907253265381e-02 -2.8673300147056580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 1.4241590164601803e-02</internalNodes>
+          <leafValues>
+            -8.4264412522315979e-02 2.1000739932060242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 3.1410539522767067e-03</internalNodes>
+          <leafValues>
+            1.3257560133934021e-01 -1.5610539913177490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 1.0995150357484818e-01</internalNodes>
+          <leafValues>
+            1.2388270348310471e-02 -4.0302368998527527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 1.7845850437879562e-02</internalNodes>
+          <leafValues>
+            5.2870228886604309e-02 -3.7930241227149963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 1.0851990431547165e-02</internalNodes>
+          <leafValues>
+            -5.4071258753538132e-02 3.5186240077018738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 -2.5958200916647911e-02</internalNodes>
+          <leafValues>
+            4.1978350281715393e-01 -4.0477428585290909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 4.0990379638969898e-03</internalNodes>
+          <leafValues>
+            5.0911288708448410e-02 -3.5974949598312378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 1.4909840188920498e-02</internalNodes>
+          <leafValues>
+            -6.1437230557203293e-02 2.8947550058364868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 4.0265037678182125e-03</internalNodes>
+          <leafValues>
+            1.0686399787664413e-01 -1.2979680299758911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 3.9495688676834106e-01</internalNodes>
+          <leafValues>
+            -2.8920559212565422e-02 6.3535267114639282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 1.2874379754066467e-02</internalNodes>
+          <leafValues>
+            -1.1910410225391388e-01 1.2068430334329605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 -4.8598181456327438e-02</internalNodes>
+          <leafValues>
+            4.6885690093040466e-01 -4.2797289788722992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 1.5357979573309422e-03</internalNodes>
+          <leafValues>
+            -3.0882269144058228e-01 6.3154831528663635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 3.5379750188440084e-03</internalNodes>
+          <leafValues>
+            1.0132449865341187e-01 -1.7726400494575500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 -1.9441220909357071e-02</internalNodes>
+          <leafValues>
+            2.3254390060901642e-01 -5.3732268512248993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 2.5940369814634323e-03</internalNodes>
+          <leafValues>
+            -3.5682299733161926e-01 5.0598859786987305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 5.9910379350185394e-02</internalNodes>
+          <leafValues>
+            -2.4030869826674461e-02 1.7003220319747925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 -1.1181759648025036e-02</internalNodes>
+          <leafValues>
+            3.4869500994682312e-01 -6.2812417745590210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 4.9201812362298369e-04</internalNodes>
+          <leafValues>
+            -1.2642909586429596e-01 3.6503899842500687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 6.7902177572250366e-02</internalNodes>
+          <leafValues>
+            -4.2887088656425476e-01 4.6336911618709564e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 1.5728829428553581e-02</internalNodes>
+          <leafValues>
+            -6.3028946518898010e-02 1.6275769472122192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 -1.4824390411376953e-02</internalNodes>
+          <leafValues>
+            -5.3391677141189575e-01 3.2132621854543686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 -1.9706260412931442e-02</internalNodes>
+          <leafValues>
+            2.5455629825592041e-01 -3.0816650018095970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 9.6607124432921410e-03</internalNodes>
+          <leafValues>
+            9.2674352228641510e-02 -1.7940239608287811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -4.9929421395063400e-02</internalNodes>
+          <leafValues>
+            2.6743340492248535e-01 -2.5595119222998619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 7.3459640145301819e-02</internalNodes>
+          <leafValues>
+            -5.8698959648609161e-02 2.8898829221725464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 -8.6538150208070874e-04</internalNodes>
+          <leafValues>
+            -1.4318460226058960e-01 6.5386183559894562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -1.0462219826877117e-02</internalNodes>
+          <leafValues>
+            -3.2498508691787720e-01 5.4955318570137024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 -6.3478751108050346e-03</internalNodes>
+          <leafValues>
+            -1.0396370291709900e-01 4.0321409702301025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 1.1406400054693222e-01</internalNodes>
+          <leafValues>
+            2.6192039251327515e-02 -6.6177910566329956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 -2.6893770322203636e-02</internalNodes>
+          <leafValues>
+            -3.5338699817657471e-01 1.9753590226173401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 8.0600962042808533e-02</internalNodes>
+          <leafValues>
+            2.8878480195999146e-02 -5.4975187778472900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 -7.4676960706710815e-02</internalNodes>
+          <leafValues>
+            -3.4416058659553528e-01 2.6990719139575958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 -7.7004089951515198e-02</internalNodes>
+          <leafValues>
+            4.0045699477195740e-01 -4.5340269804000854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 -8.6920477449893951e-02</internalNodes>
+          <leafValues>
+            -3.4687021374702454e-01 3.9195980876684189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 -4.3200692161917686e-03</internalNodes>
+          <leafValues>
+            7.5932569801807404e-02 -2.3720650374889374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 -3.4127760678529739e-02</internalNodes>
+          <leafValues>
+            -4.1994720697402954e-01 4.3633870780467987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 2.1845370531082153e-02</internalNodes>
+          <leafValues>
+            -5.8681700378656387e-02 3.2972678542137146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 1.0037229955196381e-01</internalNodes>
+          <leafValues>
+            4.2507208883762360e-02 -4.3366080522537231e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>157</maxWeakCount>
+      <stageThreshold>-1.5512030124664307e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1201 -2.8922120109200478e-03</internalNodes>
+          <leafValues>
+            1.4381329715251923e-01 -4.0896520018577576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 -3.2057950738817453e-03</internalNodes>
+          <leafValues>
+            -3.3472418785095215e-01 1.2834690511226654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 -1.4795559764024802e-05</internalNodes>
+          <leafValues>
+            1.0139170289039612e-01 -4.4680911302566528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 3.7529919063672423e-04</internalNodes>
+          <leafValues>
+            -2.8604930639266968e-01 1.5357840061187744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 4.9170467536896467e-04</internalNodes>
+          <leafValues>
+            -2.8404960036277771e-01 1.3163900375366211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 1.6417380422353745e-02</internalNodes>
+          <leafValues>
+            7.9901106655597687e-02 -2.8092819452285767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 1.0119860060513020e-02</internalNodes>
+          <leafValues>
+            1.0026869922876358e-01 -4.0932568907737732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 -6.5251751802861691e-03</internalNodes>
+          <leafValues>
+            -3.3101710677146912e-01 9.6044629812240601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 6.1215078458189964e-03</internalNodes>
+          <leafValues>
+            -3.5483101010322571e-01 8.4309920668601990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 2.5817379355430603e-03</internalNodes>
+          <leafValues>
+            8.3384357392787933e-02 -2.8031709790229797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 -1.3406439684331417e-03</internalNodes>
+          <leafValues>
+            1.5083800256252289e-01 -1.4946520328521729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 3.3681320492178202e-03</internalNodes>
+          <leafValues>
+            4.2112700641155243e-02 -2.2309710085391998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 2.8937528841197491e-03</internalNodes>
+          <leafValues>
+            8.2953810691833496e-02 -2.9152309894561768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 3.3696501050144434e-03</internalNodes>
+          <leafValues>
+            4.8548549413681030e-02 -1.9542780518531799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 -7.1538880467414856e-02</internalNodes>
+          <leafValues>
+            5.2008682489395142e-01 -4.2644441127777100e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 7.6072360388934612e-03</internalNodes>
+          <leafValues>
+            -8.5208661854267120e-02 1.1523310095071793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 1.9313229713588953e-03</internalNodes>
+          <leafValues>
+            8.9357398450374603e-02 -2.3614349961280823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 9.0475968318060040e-04</internalNodes>
+          <leafValues>
+            -7.7408589422702789e-02 1.6829580068588257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 1.1103670112788677e-02</internalNodes>
+          <leafValues>
+            -9.5963977277278900e-02 2.0391720533370972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -3.1021970789879560e-03</internalNodes>
+          <leafValues>
+            -3.8605719804763794e-01 4.6329721808433533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 1.1446890421211720e-03</internalNodes>
+          <leafValues>
+            -2.8306689858436584e-01 5.8978211134672165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 7.7077788300812244e-03</internalNodes>
+          <leafValues>
+            1.0474249720573425e-01 -1.7146070301532745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 4.9893710762262344e-02</internalNodes>
+          <leafValues>
+            -6.4692601561546326e-02 3.0140951275825500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 -1.4937819913029671e-02</internalNodes>
+          <leafValues>
+            -2.7854371070861816e-01 7.0895470678806305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 -2.5303829461336136e-03</internalNodes>
+          <leafValues>
+            1.2108519673347473e-01 -1.4635290205478668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 2.8611259534955025e-02</internalNodes>
+          <leafValues>
+            -5.0357531756162643e-02 4.0651878714561462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 3.6244060844182968e-02</internalNodes>
+          <leafValues>
+            4.4577218592166901e-02 -5.6234288215637207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 -3.0544339679181576e-03</internalNodes>
+          <leafValues>
+            1.1526989936828613e-01 -2.7371090650558472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 -1.3101019430905581e-03</internalNodes>
+          <leafValues>
+            -2.6798000931739807e-01 5.9726651757955551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 1.0702989529818296e-03</internalNodes>
+          <leafValues>
+            -1.5439410507678986e-01 1.1206989735364914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 -2.3467160761356354e-02</internalNodes>
+          <leafValues>
+            -6.2424921989440918e-01 2.6010479778051376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 -2.2787749767303467e-02</internalNodes>
+          <leafValues>
+            1.7903989553451538e-01 -6.8230852484703064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 7.5017688795924187e-03</internalNodes>
+          <leafValues>
+            5.2637178450822830e-02 -3.3333471417427063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 1.3881090097129345e-02</internalNodes>
+          <leafValues>
+            6.5118886530399323e-02 -2.4152719974517822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 -8.7769115343689919e-03</internalNodes>
+          <leafValues>
+            1.9925190508365631e-01 -8.8063232600688934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 2.6523560285568237e-02</internalNodes>
+          <leafValues>
+            4.6574778854846954e-02 -3.6550509929656982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 7.2263809852302074e-03</internalNodes>
+          <leafValues>
+            -1.0806850343942642e-01 1.5131799876689911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 2.3426050320267677e-03</internalNodes>
+          <leafValues>
+            -1.5072929859161377e-01 9.9945023655891418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 -2.8811080483137630e-05</internalNodes>
+          <leafValues>
+            6.1413038522005081e-02 -2.4344439804553986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 -1.3911900110542774e-02</internalNodes>
+          <leafValues>
+            -3.1010839343070984e-01 2.4895850569009781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 2.4768780916929245e-02</internalNodes>
+          <leafValues>
+            2.3218030110001564e-02 -6.5071028470993042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 -6.0916407965123653e-03</internalNodes>
+          <leafValues>
+            5.9768490493297577e-02 -2.5360348820686340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 -9.7264908254146576e-03</internalNodes>
+          <leafValues>
+            -2.5584441423416138e-01 5.5554620921611786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 9.7499042749404907e-02</internalNodes>
+          <leafValues>
+            5.3867488168179989e-03 -7.3567670583724976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 3.0411418993026018e-03</internalNodes>
+          <leafValues>
+            -1.3759210705757141e-01 1.2143649905920029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1246 2.7967148926109076e-03</internalNodes>
+          <leafValues>
+            1.8048660457134247e-01 -8.4527000784873962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 1.0707279667258263e-02</internalNodes>
+          <leafValues>
+            -4.3970860540866852e-02 3.1042009592056274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 1.7561139538884163e-03</internalNodes>
+          <leafValues>
+            5.1866840571165085e-02 -2.2768710553646088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 -3.0384738929569721e-03</internalNodes>
+          <leafValues>
+            7.1652042865753174e-01 -2.2465929388999939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1250 -9.4161480665206909e-02</internalNodes>
+          <leafValues>
+            -7.9338562488555908e-01 1.3117490336298943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 -2.3869009688496590e-02</internalNodes>
+          <leafValues>
+            4.9338179826736450e-01 -3.2169021666049957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -3.9958588778972626e-02</internalNodes>
+          <leafValues>
+            -1.8914769589900970e-01 2.8500700369477272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 6.9391070865094662e-03</internalNodes>
+          <leafValues>
+            3.9777211844921112e-02 -3.9105901122093201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 -3.3596780151128769e-02</internalNodes>
+          <leafValues>
+            -5.6830072402954102e-01 2.1618509665131569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 -1.4079840481281281e-01</internalNodes>
+          <leafValues>
+            -7.9014372825622559e-01 1.4884609729051590e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 -5.7346289977431297e-03</internalNodes>
+          <leafValues>
+            -1.5512639284133911e-01 4.2879570275545120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 -5.2841830998659134e-02</internalNodes>
+          <leafValues>
+            3.0823838710784912e-01 -5.0709690898656845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 1.5207099728286266e-02</internalNodes>
+          <leafValues>
+            -2.5789769366383553e-02 3.3292320370674133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 -5.8392022037878633e-04</internalNodes>
+          <leafValues>
+            8.8900387287139893e-02 -1.6297949850559235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 -3.3715530298650265e-03</internalNodes>
+          <leafValues>
+            -1.7890229821205139e-01 7.5376607477664948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 -1.2047060299664736e-03</internalNodes>
+          <leafValues>
+            1.0491970181465149e-01 -1.2970739603042603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 5.5276479572057724e-02</internalNodes>
+          <leafValues>
+            -4.3197508901357651e-02 3.7212029099464417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 3.9330609142780304e-02</internalNodes>
+          <leafValues>
+            3.0416399240493774e-02 -4.9076101183891296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 -9.7229599487036467e-04</internalNodes>
+          <leafValues>
+            -2.1895459294319153e-01 3.9032708853483200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 -5.6048069149255753e-02</internalNodes>
+          <leafValues>
+            4.1632568836212158e-01 -3.3747311681509018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 7.1376740932464600e-02</internalNodes>
+          <leafValues>
+            1.2129209935665131e-02 -6.4814078807830811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 1.4940260443836451e-03</internalNodes>
+          <leafValues>
+            -2.1393610537052155e-01 8.4887221455574036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 -3.2299170270562172e-03</internalNodes>
+          <leafValues>
+            9.0792432427406311e-02 -9.5816053450107574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 4.2182870209217072e-02</internalNodes>
+          <leafValues>
+            -6.6914401948451996e-02 2.5217619538307190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 -6.5001910552382469e-03</internalNodes>
+          <leafValues>
+            -1.2149559706449509e-01 3.7367988377809525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 1.9457129761576653e-02</internalNodes>
+          <leafValues>
+            5.0163779407739639e-02 -2.8700378537178040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 3.7291388958692551e-02</internalNodes>
+          <leafValues>
+            2.9608439654111862e-02 -5.7222497463226318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 -2.5571519508957863e-02</internalNodes>
+          <leafValues>
+            4.3941849470138550e-01 -3.6532308906316757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 -7.9122912138700485e-03</internalNodes>
+          <leafValues>
+            -2.9618510603904724e-01 3.5483270883560181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 3.0267490074038506e-03</internalNodes>
+          <leafValues>
+            -1.2113779783248901e-01 1.1271420121192932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 -2.1035820245742798e-02</internalNodes>
+          <leafValues>
+            2.9206061363220215e-01 -3.1001489609479904e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 -1.2911420315504074e-02</internalNodes>
+          <leafValues>
+            -5.4194331169128418e-01 2.6756240054965019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 5.5096071213483810e-02</internalNodes>
+          <leafValues>
+            8.4169982001185417e-03 -6.2873458862304688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 -6.3893562182784081e-03</internalNodes>
+          <leafValues>
+            -2.0784839987754822e-01 6.0436788946390152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 1.0858760215342045e-02</internalNodes>
+          <leafValues>
+            -7.8497253358364105e-02 1.2957990169525146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 -1.5859620645642281e-02</internalNodes>
+          <leafValues>
+            1.5772910416126251e-01 -1.0143510252237320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 1.5203879773616791e-01</internalNodes>
+          <leafValues>
+            2.1721320226788521e-02 -3.1713140010833740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1283 1.7942039296030998e-02</internalNodes>
+          <leafValues>
+            -8.4816932678222656e-02 1.7697300016880035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 8.8212518021464348e-03</internalNodes>
+          <leafValues>
+            5.1800601184368134e-02 -2.1443609893321991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 1.5715289860963821e-02</internalNodes>
+          <leafValues>
+            4.2525820434093475e-02 -3.2278341054916382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 -2.4744209367781878e-03</internalNodes>
+          <leafValues>
+            1.0828550159931183e-01 -1.2953069806098938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 1.2597530148923397e-02</internalNodes>
+          <leafValues>
+            -6.0251701623201370e-02 2.7512151002883911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 -1.0955630568787456e-03</internalNodes>
+          <leafValues>
+            -5.4244071245193481e-01 2.8166439384222031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 -1.4035019557923079e-03</internalNodes>
+          <leafValues>
+            -2.3625169694423676e-01 6.1887249350547791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 -7.7294543385505676e-02</internalNodes>
+          <leafValues>
+            -5.2141982316970825e-01 1.1844149790704250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 -7.5442157685756683e-02</internalNodes>
+          <leafValues>
+            -7.1588802337646484e-01 1.7151419073343277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 -6.5148338675498962e-02</internalNodes>
+          <leafValues>
+            2.4099840223789215e-01 -5.0278738141059875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 -1.0481229983270168e-03</internalNodes>
+          <leafValues>
+            6.5461628139019012e-02 -1.9198420643806458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 2.0919230300933123e-03</internalNodes>
+          <leafValues>
+            4.8702161759138107e-02 -2.0062549412250519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 -4.2849369347095490e-02</internalNodes>
+          <leafValues>
+            -4.6154209971427917e-01 2.9137039557099342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 -4.5563629828393459e-03</internalNodes>
+          <leafValues>
+            1.3732179999351501e-01 -7.3871016502380371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1297 6.7648440599441528e-03</internalNodes>
+          <leafValues>
+            -6.3866026699542999e-02 2.7578699588775635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 4.2252071201801300e-02</internalNodes>
+          <leafValues>
+            1.3583010062575340e-02 -6.2714421749114990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 -3.5438220947980881e-02</internalNodes>
+          <leafValues>
+            -5.2436131238937378e-01 2.1047530695796013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 -5.3693209774792194e-03</internalNodes>
+          <leafValues>
+            1.8366709351539612e-01 -6.6432453691959381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 1.3521539513021708e-03</internalNodes>
+          <leafValues>
+            5.8834321796894073e-02 -2.2455100715160370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 -3.2204028218984604e-02</internalNodes>
+          <leafValues>
+            -4.8017048835754395e-01 9.2976661399006844e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 4.0550291305407882e-04</internalNodes>
+          <leafValues>
+            -8.5948407649993896e-02 2.0100370049476624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 -3.8419410120695829e-03</internalNodes>
+          <leafValues>
+            2.0595569908618927e-01 -6.6863708198070526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 -4.5518199913203716e-03</internalNodes>
+          <leafValues>
+            -2.2908920049667358e-01 5.8954399079084396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 -4.9340371042490005e-02</internalNodes>
+          <leafValues>
+            -3.8995718955993652e-01 1.6714079305529594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 8.6456492543220520e-02</internalNodes>
+          <leafValues>
+            -3.2278828322887421e-02 3.6371639370918274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 5.1636258140206337e-03</internalNodes>
+          <leafValues>
+            -1.7399039864540100e-01 5.6017149239778519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 3.5364869982004166e-03</internalNodes>
+          <leafValues>
+            -7.9630948603153229e-02 1.6313460469245911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 -4.3170839548110962e-02</internalNodes>
+          <leafValues>
+            -3.7036859989166260e-01 1.9841130822896957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 6.1772209592163563e-03</internalNodes>
+          <leafValues>
+            5.9052169322967529e-02 -2.3701970279216766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 -2.2244770079851151e-02</internalNodes>
+          <leafValues>
+            2.5762718915939331e-01 -2.2968450561165810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 5.0163730978965759e-02</internalNodes>
+          <leafValues>
+            1.7468400299549103e-02 -6.8128740787506104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 -3.0043811420910060e-04</internalNodes>
+          <leafValues>
+            5.5781401693820953e-02 -1.2685780227184296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 1.9783550500869751e-01</internalNodes>
+          <leafValues>
+            1.2211419641971588e-02 -8.6064267158508301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 6.5362468361854553e-02</internalNodes>
+          <leafValues>
+            4.1287927888333797e-03 -6.2948238849639893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 -1.8684990704059601e-02</internalNodes>
+          <leafValues>
+            -2.4377359449863434e-01 4.3232489377260208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 -7.5593511573970318e-03</internalNodes>
+          <leafValues>
+            1.7254440486431122e-01 -1.6871780157089233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 1.4699660241603851e-03</internalNodes>
+          <leafValues>
+            -1.5561489760875702e-01 6.9231852889060974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 1.1925940215587616e-01</internalNodes>
+          <leafValues>
+            -2.6341190561652184e-02 4.4847229123115540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 1.3763479888439178e-02</internalNodes>
+          <leafValues>
+            3.1852710992097855e-02 -3.8184550404548645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 1.2966440059244633e-02</internalNodes>
+          <leafValues>
+            -3.9391368627548218e-02 1.9092699885368347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 -1.1041419580578804e-02</internalNodes>
+          <leafValues>
+            -2.7309378981590271e-01 4.7777820378541946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 6.8364411592483521e-01</internalNodes>
+          <leafValues>
+            9.6240043640136719e-03 -9.7447502613067627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 -2.4255160242319107e-03</internalNodes>
+          <leafValues>
+            -2.5439569354057312e-01 4.0732551366090775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 6.4529682276770473e-04</internalNodes>
+          <leafValues>
+            -1.3824179768562317e-01 7.4660047888755798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 -2.2386180236935616e-02</internalNodes>
+          <leafValues>
+            3.9404779672622681e-01 -4.2591951787471771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 -6.4325161278247833e-02</internalNodes>
+          <leafValues>
+            -9.6853357553482056e-01 5.4289568215608597e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 4.0803711861371994e-02</internalNodes>
+          <leafValues>
+            1.4779980294406414e-02 -7.5445967912673950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 -2.4066439364105463e-03</internalNodes>
+          <leafValues>
+            7.6213918626308441e-02 -8.1325337290763855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 -4.9865059554576874e-02</internalNodes>
+          <leafValues>
+            -7.8447979688644409e-01 1.5130150131881237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 -8.9749991893768311e-02</internalNodes>
+          <leafValues>
+            -9.0076518058776855e-01 4.0898341685533524e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 2.1489290520548820e-03</internalNodes>
+          <leafValues>
+            -7.7873408794403076e-02 1.4538989961147308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 1.8653910374268889e-03</internalNodes>
+          <leafValues>
+            -5.1264639943838120e-02 1.4514209330081940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 5.4189950227737427e-02</internalNodes>
+          <leafValues>
+            1.6740569844841957e-02 -7.2964847087860107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 -3.7668810691684484e-03</internalNodes>
+          <leafValues>
+            1.5345999598503113e-01 -5.9867210686206818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 -1.5151940286159515e-01</internalNodes>
+          <leafValues>
+            -8.2612198591232300e-01 1.4488279819488525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 1.0246659629046917e-02</internalNodes>
+          <leafValues>
+            -6.3145689666271210e-02 1.8994790315628052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 1.0578270070254803e-02</internalNodes>
+          <leafValues>
+            5.9726748615503311e-02 -1.9162079691886902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 1.5032970346510410e-02</internalNodes>
+          <leafValues>
+            -7.3868520557880402e-02 1.5511709451675415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 -4.2136289179325104e-02</internalNodes>
+          <leafValues>
+            -6.8733322620391846e-01 1.6604630276560783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 1.8628799589350820e-03</internalNodes>
+          <leafValues>
+            -1.5732850134372711e-01 7.5714908540248871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 2.4659639224410057e-02</internalNodes>
+          <leafValues>
+            9.7081139683723450e-02 -1.6045799851417542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 1.9145730137825012e-01</internalNodes>
+          <leafValues>
+            7.1056559681892395e-03 -7.5537341833114624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 -3.0167160555720329e-02</internalNodes>
+          <leafValues>
+            1.7002609372138977e-01 -8.6163826286792755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 9.2923697084188461e-03</internalNodes>
+          <leafValues>
+            4.3352611362934113e-02 -1.9533480703830719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 -1.9069829722866416e-03</internalNodes>
+          <leafValues>
+            8.2421518862247467e-02 -1.4644089341163635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 3.1027841032482684e-04</internalNodes>
+          <leafValues>
+            -1.1879319697618484e-01 9.4635762274265289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 4.4492271263152361e-04</internalNodes>
+          <leafValues>
+            -1.5645760297775269e-01 6.8512812256813049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 -1.2095469981431961e-02</internalNodes>
+          <leafValues>
+            -9.0144127607345581e-02 3.0050620436668396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 -2.0358909387141466e-03</internalNodes>
+          <leafValues>
+            1.3586470484733582e-01 -7.2631262242794037e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1352 -9.3594277277588844e-03</internalNodes>
+          <leafValues>
+            1.1376120150089264e-01 -3.9632719010114670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 4.2418478988111019e-03</internalNodes>
+          <leafValues>
+            -8.1519439816474915e-02 1.5766209363937378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 -5.9963759034872055e-02</internalNodes>
+          <leafValues>
+            -2.3273150622844696e-01 2.0836880430579185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 4.6651167795062065e-03</internalNodes>
+          <leafValues>
+            1.3135330379009247e-01 -1.2394910305738449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 6.2358117429539561e-04</internalNodes>
+          <leafValues>
+            -1.2920179963111877e-01 6.5220557153224945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 2.0561330020427704e-03</internalNodes>
+          <leafValues>
+            -6.2910877168178558e-02 1.6288000345230103e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>127</maxWeakCount>
+      <stageThreshold>-1.7598799467086792e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1358 1.1216440051794052e-01</internalNodes>
+          <leafValues>
+            -2.9065090417861938e-01 3.1510210037231445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 2.7850609272718430e-02</internalNodes>
+          <leafValues>
+            -3.9972350001335144e-01 1.7894990742206573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 4.0804240852594376e-02</internalNodes>
+          <leafValues>
+            -2.4171060323715210e-01 2.2376739978790283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 1.3134710025042295e-03</internalNodes>
+          <leafValues>
+            -4.2230761051177979e-01 6.9066837430000305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 3.9736120961606503e-03</internalNodes>
+          <leafValues>
+            -5.5243992805480957e-01 1.0362079739570618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 -9.7877913503907621e-05</internalNodes>
+          <leafValues>
+            7.0300459861755371e-02 -4.1970318555831909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 6.2921550124883652e-03</internalNodes>
+          <leafValues>
+            -3.0629968643188477e-01 1.3072040677070618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 -8.7216142565011978e-03</internalNodes>
+          <leafValues>
+            -4.1267630457878113e-01 7.2738148272037506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 -5.8611109852790833e-02</internalNodes>
+          <leafValues>
+            1.9491520524024963e-01 -1.9737449288368225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 -4.6104468405246735e-02</internalNodes>
+          <leafValues>
+            -2.6274758577346802e-01 2.4362189695239067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1368 -5.2685278933495283e-04</internalNodes>
+          <leafValues>
+            7.9876311123371124e-02 -4.4358581304550171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 -2.5521939620375633e-02</internalNodes>
+          <leafValues>
+            -4.4183689355850220e-01 1.0705660097301006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 -6.8350387737154961e-03</internalNodes>
+          <leafValues>
+            -3.9501190185546875e-01 7.8441992402076721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 6.1055209487676620e-02</internalNodes>
+          <leafValues>
+            3.5330320242792368e-03 -6.0677450895309448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 4.7110877931118011e-03</internalNodes>
+          <leafValues>
+            -1.9310380518436432e-01 1.5259410440921783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 3.7552498281002045e-02</internalNodes>
+          <leafValues>
+            6.9572687149047852e-02 -4.1588190197944641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 4.0887430310249329e-02</internalNodes>
+          <leafValues>
+            -1.3596929609775543e-01 2.4894300103187561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 2.6306639483664185e-05</internalNodes>
+          <leafValues>
+            -2.5603210926055908e-01 1.1001589894294739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 9.4716809689998627e-03</internalNodes>
+          <leafValues>
+            -2.2197020053863525e-01 1.3640490174293518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 3.4596489276736975e-03</internalNodes>
+          <leafValues>
+            1.5568970143795013e-01 -1.8454350531101227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 -8.1670414656400681e-03</internalNodes>
+          <leafValues>
+            -3.7346610426902771e-01 8.2206420600414276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 4.7045178711414337e-02</internalNodes>
+          <leafValues>
+            1.2655580416321754e-02 -6.9167500734329224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 -1.9954189192503691e-03</internalNodes>
+          <leafValues>
+            -4.2871651053428650e-01 6.0119848698377609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 -3.2797679305076599e-02</internalNodes>
+          <leafValues>
+            -5.8513718843460083e-01 3.9739210158586502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 4.3516121804714203e-02</internalNodes>
+          <leafValues>
+            3.6311239004135132e-02 -5.8556967973709106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -1.3213600032031536e-02</internalNodes>
+          <leafValues>
+            2.1160380542278290e-01 -8.9618362486362457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 -3.8574080914258957e-02</internalNodes>
+          <leafValues>
+            -5.9375947713851929e-01 3.7297870963811874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 -1.5351839363574982e-01</internalNodes>
+          <leafValues>
+            4.4116440415382385e-01 -5.9058368206024170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 -1.4133240096271038e-02</internalNodes>
+          <leafValues>
+            -3.4045210480690002e-01 6.6277496516704559e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 1.4061010442674160e-02</internalNodes>
+          <leafValues>
+            1.1312460154294968e-01 -1.9001239538192749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 3.5457469522953033e-02</internalNodes>
+          <leafValues>
+            3.7297818809747696e-02 -5.3568178415298462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 -1.2931039556860924e-02</internalNodes>
+          <leafValues>
+            -2.8593328595161438e-01 5.8341801166534424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 -1.1986999772489071e-02</internalNodes>
+          <leafValues>
+            -4.0216270089149475e-01 4.7841191291809082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 -1.3723289594054222e-02</internalNodes>
+          <leafValues>
+            2.0238439738750458e-01 -8.9290492236614227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 1.5990810468792915e-02</internalNodes>
+          <leafValues>
+            -6.1742551624774933e-02 3.9387008547782898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 -1.4505759812891483e-02</internalNodes>
+          <leafValues>
+            -3.5829049348831177e-01 4.3789908289909363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1394 3.1443528831005096e-02</internalNodes>
+          <leafValues>
+            -6.7374527454376221e-02 2.8779721260070801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 3.4287340939044952e-02</internalNodes>
+          <leafValues>
+            5.6390259414911270e-02 -3.3407160639762878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 8.8674569269642234e-05</internalNodes>
+          <leafValues>
+            -2.8655600547790527e-01 7.0318557322025299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 1.8266469240188599e-02</internalNodes>
+          <leafValues>
+            -5.2221570163965225e-02 1.7026390135288239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 6.1769630759954453e-02</internalNodes>
+          <leafValues>
+            -6.8800583481788635e-02 2.7483311295509338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 -2.3383310064673424e-02</internalNodes>
+          <leafValues>
+            -2.7845630049705505e-01 2.4131359532475471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 -1.1182860285043716e-01</internalNodes>
+          <leafValues>
+            4.5687168836593628e-01 -4.3217949569225311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 -6.4386896789073944e-02</internalNodes>
+          <leafValues>
+            -3.4228751063346863e-01 6.4063712954521179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 2.1763430535793304e-01</internalNodes>
+          <leafValues>
+            -6.0564499348402023e-02 3.6352708935737610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1403 -4.9456087872385979e-03</internalNodes>
+          <leafValues>
+            -1.6526390612125397e-01 4.6035580337047577e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 -1.2704910477623343e-03</internalNodes>
+          <leafValues>
+            -2.5035798549652100e-01 8.2336440682411194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1405 2.6536729186773300e-02</internalNodes>
+          <leafValues>
+            -1.3919049501419067e-01 1.9524000585079193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 -2.0027440041303635e-02</internalNodes>
+          <leafValues>
+            -3.7472829222679138e-01 5.3981021046638489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 -6.1987549066543579e-02</internalNodes>
+          <leafValues>
+            -1.4436429738998413e-01 1.5863290056586266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 2.3037059232592583e-02</internalNodes>
+          <leafValues>
+            3.8429230451583862e-02 -4.8479309678077698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 5.7958271354436874e-02</internalNodes>
+          <leafValues>
+            2.0750140771269798e-02 -7.6776617765426636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 5.4419268853962421e-03</internalNodes>
+          <leafValues>
+            7.2074413299560547e-02 -2.4254220724105835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 7.2400430217385292e-03</internalNodes>
+          <leafValues>
+            -8.2432948052883148e-02 1.8463499844074249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 1.4847779646515846e-02</internalNodes>
+          <leafValues>
+            5.6245408952236176e-02 -3.6297059059143066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 1.2084879912436008e-02</internalNodes>
+          <leafValues>
+            -6.3536256551742554e-02 2.8614228963851929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 8.0831356346607208e-02</internalNodes>
+          <leafValues>
+            4.7143958508968353e-02 -4.9968090653419495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 1.9218639936298132e-03</internalNodes>
+          <leafValues>
+            -4.0469148755073547e-01 2.2093040868639946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 -1.4179679565131664e-02</internalNodes>
+          <leafValues>
+            -1.8520280718803406e-01 8.6823917925357819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 -2.9600440029753372e-05</internalNodes>
+          <leafValues>
+            7.4054829776287079e-02 -1.9331359863281250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 1.7121590208262205e-03</internalNodes>
+          <leafValues>
+            -4.9954649806022644e-01 3.8273740559816360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 -1.3207949697971344e-01</internalNodes>
+          <leafValues>
+            5.2964788675308228e-01 -1.0363499633967876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 3.6922071129083633e-02</internalNodes>
+          <leafValues>
+            1.9587470218539238e-02 -8.8954067230224609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 -7.3079409048659727e-06</internalNodes>
+          <leafValues>
+            6.4993053674697876e-02 -1.7331290245056152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 -3.5222709178924561e-02</internalNodes>
+          <leafValues>
+            -3.6849930882453918e-01 5.0565738230943680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 -5.5531110614538193e-02</internalNodes>
+          <leafValues>
+            3.1555691361427307e-01 -4.5015729963779449e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 1.8762869760394096e-02</internalNodes>
+          <leafValues>
+            -1.9359070062637329e-01 7.9093530774116516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 2.4971760809421539e-02</internalNodes>
+          <leafValues>
+            -8.1862196326255798e-02 2.1014890074729919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 -2.0817129407078028e-03</internalNodes>
+          <leafValues>
+            -1.7723660171031952e-01 9.1757282614707947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -1.1499860137701035e-01</internalNodes>
+          <leafValues>
+            5.0862562656402588e-01 -1.8267450854182243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 3.2068958878517151e-01</internalNodes>
+          <leafValues>
+            2.1651009097695351e-02 -7.6685470342636108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 -8.1451296806335449e-02</internalNodes>
+          <leafValues>
+            -4.6331760287284851e-01 2.9383579269051552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 -1.5007940120995045e-02</internalNodes>
+          <leafValues>
+            -3.9308649301528931e-01 3.6867558956146240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 2.3795820772647858e-02</internalNodes>
+          <leafValues>
+            -3.2482311129570007e-02 1.6764250397682190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 -8.8508807122707367e-02</internalNodes>
+          <leafValues>
+            7.2103458642959595e-01 -2.1140210330486298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 4.5011121779680252e-02</internalNodes>
+          <leafValues>
+            -2.5326130911707878e-02 2.8062760829925537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 1.9286990165710449e-02</internalNodes>
+          <leafValues>
+            6.5771162509918213e-02 -2.5697788596153259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 2.2137619554996490e-02</internalNodes>
+          <leafValues>
+            3.9154991507530212e-02 -1.9145630300045013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 2.9847979545593262e-02</internalNodes>
+          <leafValues>
+            -1.2521019577980042e-01 1.4867870509624481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 -6.8392023444175720e-02</internalNodes>
+          <leafValues>
+            2.6023870706558228e-01 -4.7525301575660706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 6.8003371357917786e-02</internalNodes>
+          <leafValues>
+            -4.5898560434579849e-02 4.0107101202011108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 5.6098159402608871e-02</internalNodes>
+          <leafValues>
+            2.3277789354324341e-02 -8.4457129240036011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 -1.3024089857935905e-02</internalNodes>
+          <leafValues>
+            -3.8348990678787231e-01 3.8314189761877060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 1.2594680301845074e-02</internalNodes>
+          <leafValues>
+            -6.7616842687129974e-02 2.9852440953254700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 -4.9063879996538162e-02</internalNodes>
+          <leafValues>
+            -5.5862659215927124e-01 2.8511619195342064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 -1.5734169632196426e-02</internalNodes>
+          <leafValues>
+            2.5611931085586548e-01 -5.9407141059637070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 1.4674849808216095e-02</internalNodes>
+          <leafValues>
+            -6.3001021742820740e-02 2.7854999899864197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 2.5068029761314392e-02</internalNodes>
+          <leafValues>
+            -7.8861348330974579e-02 1.0577370226383209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 7.4170758016407490e-03</internalNodes>
+          <leafValues>
+            -3.5775899887084961e-01 4.8707701265811920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 -7.7149281278252602e-03</internalNodes>
+          <leafValues>
+            -1.8049560487270355e-01 9.7531601786613464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 4.9982070922851562e-02</internalNodes>
+          <leafValues>
+            2.1009320393204689e-02 -7.6537537574768066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 -1.6759630292654037e-02</internalNodes>
+          <leafValues>
+            -5.9045380353927612e-01 2.6948049664497375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 3.7632828950881958e-01</internalNodes>
+          <leafValues>
+            2.1989850327372551e-02 -6.1461311578750610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 5.2720829844474792e-02</internalNodes>
+          <leafValues>
+            -3.9074160158634186e-02 2.6600670814514160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 2.6270199567079544e-02</internalNodes>
+          <leafValues>
+            -9.3863986432552338e-02 2.2280269861221313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -2.5664661079645157e-03</internalNodes>
+          <leafValues>
+            -1.8621809780597687e-01 9.8519712686538696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 5.3800269961357117e-03</internalNodes>
+          <leafValues>
+            1.2816059589385986e-01 -1.3671700656414032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 2.5200050324201584e-02</internalNodes>
+          <leafValues>
+            3.0875589698553085e-02 -2.9681420326232910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 2.5444060564041138e-02</internalNodes>
+          <leafValues>
+            4.3978411704301834e-02 -4.0505328774452209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 -2.4715809151530266e-02</internalNodes>
+          <leafValues>
+            -5.8492290973663330e-01 2.3179760202765465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 -1.6159649938344955e-02</internalNodes>
+          <leafValues>
+            -3.1950500607490540e-01 4.4603530317544937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 6.5401610918343067e-03</internalNodes>
+          <leafValues>
+            -5.8575991541147232e-02 7.4016787111759186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 -4.3940648436546326e-02</internalNodes>
+          <leafValues>
+            -7.7211838960647583e-01 1.9352979958057404e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 -4.5612620306201279e-04</internalNodes>
+          <leafValues>
+            3.0397420749068260e-02 -2.6982998847961426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 2.8633379843086004e-03</internalNodes>
+          <leafValues>
+            -1.6874340176582336e-01 8.8886268436908722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 -5.9488460421562195e-02</internalNodes>
+          <leafValues>
+            -3.4058949351310730e-01 2.4625880643725395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1464 3.0714470893144608e-02</internalNodes>
+          <leafValues>
+            3.1796399503946304e-02 -4.1572770476341248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1465 -2.2330379113554955e-02</internalNodes>
+          <leafValues>
+            1.2896050512790680e-01 -2.4232570081949234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1466 2.3971609771251678e-02</internalNodes>
+          <leafValues>
+            -7.6858058571815491e-02 2.0360720157623291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1467 -6.0696780681610107e-02</internalNodes>
+          <leafValues>
+            -7.2060132026672363e-01 1.1617880314588547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1468 -6.8362243473529816e-02</internalNodes>
+          <leafValues>
+            3.5825181007385254e-01 -4.4807899743318558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1469 1.3451039791107178e-01</internalNodes>
+          <leafValues>
+            2.6008069515228271e-02 -2.5077620148658752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1470 1.3341170549392700e-01</internalNodes>
+          <leafValues>
+            4.7138180583715439e-02 -3.9661580324172974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1471 2.0524330437183380e-02</internalNodes>
+          <leafValues>
+            4.3894171714782715e-02 -2.8501969575881958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1472 4.1543610394001007e-02</internalNodes>
+          <leafValues>
+            2.5452220812439919e-02 -5.9377658367156982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1473 -7.1573443710803986e-02</internalNodes>
+          <leafValues>
+            -7.8743761777877808e-01 1.3979320414364338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1474 6.6264629364013672e-02</internalNodes>
+          <leafValues>
+            2.2939130663871765e-02 -5.4304981231689453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1475 4.4609569013118744e-03</internalNodes>
+          <leafValues>
+            5.0688140094280243e-02 -2.0599000155925751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1476 1.4859540387988091e-02</internalNodes>
+          <leafValues>
+            -7.3408462107181549e-02 1.9902250170707703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1477 -3.9625339210033417e-02</internalNodes>
+          <leafValues>
+            -5.3522932529449463e-01 9.3211038038134575e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1478 -9.6143726259469986e-03</internalNodes>
+          <leafValues>
+            2.7664861083030701e-01 -6.3087522983551025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1479 5.4589830338954926e-02</internalNodes>
+          <leafValues>
+            2.4962859228253365e-02 -5.8171188831329346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1480 1.3770899735391140e-02</internalNodes>
+          <leafValues>
+            -2.2891749441623688e-01 6.9963671267032623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1481 8.6862340569496155e-02</internalNodes>
+          <leafValues>
+            2.4058010429143906e-02 -5.8642482757568359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1482 -2.2433010861277580e-02</internalNodes>
+          <leafValues>
+            -9.2169362306594849e-01 1.3281799852848053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1483 -7.3779597878456116e-02</internalNodes>
+          <leafValues>
+            3.8463789224624634e-01 -8.5962712764739990e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1484 2.9300490859895945e-04</internalNodes>
+          <leafValues>
+            -1.7170579731464386e-01 8.8520109653472900e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>178</maxWeakCount>
+      <stageThreshold>-1.5360039472579956e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1485 5.3288340568542480e-03</internalNodes>
+          <leafValues>
+            -2.6616770029067993e-01 1.7760449647903442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1486 -4.0987450629472733e-03</internalNodes>
+          <leafValues>
+            1.2358420342206955e-01 -3.0805110931396484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1487 -5.5853058584034443e-03</internalNodes>
+          <leafValues>
+            -5.0533992052078247e-01 6.2050119042396545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1488 -5.1797390915453434e-04</internalNodes>
+          <leafValues>
+            6.9178067147731781e-02 -3.4831359982490540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1489 5.3605018183588982e-03</internalNodes>
+          <leafValues>
+            6.5158672630786896e-02 -4.6262231469154358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1490 3.0114270746707916e-02</internalNodes>
+          <leafValues>
+            -6.4132362604141235e-02 7.1070060133934021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1491 8.9014291763305664e-02</internalNodes>
+          <leafValues>
+            4.2987130582332611e-02 -6.0177898406982422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1492 1.5248140553012490e-03</internalNodes>
+          <leafValues>
+            -3.3071789145469666e-01 7.1408301591873169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1493 1.8556410213932395e-03</internalNodes>
+          <leafValues>
+            -3.4727120399475098e-01 7.0630677044391632e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1494 -1.6151620075106621e-02</internalNodes>
+          <leafValues>
+            -2.5611770153045654e-01 7.1255698800086975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1495 -3.1278008827939630e-04</internalNodes>
+          <leafValues>
+            7.3420330882072449e-02 -2.9594621062278748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1496 -6.0263078921707347e-05</internalNodes>
+          <leafValues>
+            6.6566191613674164e-02 -2.1802450716495514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1497 7.6520902803167701e-04</internalNodes>
+          <leafValues>
+            7.5537197291851044e-02 -3.7677881121635437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1498 -6.9589070975780487e-02</internalNodes>
+          <leafValues>
+            3.9810648560523987e-01 -2.5841819122433662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1499 -9.8529577255249023e-02</internalNodes>
+          <leafValues>
+            6.7321968078613281e-01 -3.3925469964742661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1500 4.9950059503316879e-02</internalNodes>
+          <leafValues>
+            6.1660569161176682e-02 -3.7851110100746155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1501 3.9009240572340786e-04</internalNodes>
+          <leafValues>
+            -9.6428610384464264e-02 2.1700200438499451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1502 -7.1598717477172613e-04</internalNodes>
+          <leafValues>
+            -1.8358109891414642e-01 1.0587400197982788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1503 3.8064830005168915e-03</internalNodes>
+          <leafValues>
+            -1.7527610063552856e-01 1.1430399864912033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1504 6.5288757905364037e-03</internalNodes>
+          <leafValues>
+            6.7994527518749237e-02 -3.0726119875907898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1505 2.2182099055498838e-03</internalNodes>
+          <leafValues>
+            -2.7935230731964111e-01 5.8790720999240875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1506 1.7800349451135844e-04</internalNodes>
+          <leafValues>
+            9.9489107728004456e-02 -2.6616880297660828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1507 -3.2656680792570114e-02</internalNodes>
+          <leafValues>
+            5.8734762668609619e-01 -2.6545880362391472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1508 2.6773350313305855e-02</internalNodes>
+          <leafValues>
+            3.6414410918951035e-02 -3.7188830971717834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1509 1.2780309654772282e-02</internalNodes>
+          <leafValues>
+            -8.4540523588657379e-02 1.7853260040283203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1510 5.5374070070683956e-03</internalNodes>
+          <leafValues>
+            -1.0892049968242645e-01 1.4403919875621796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1511 -7.1258977986872196e-03</internalNodes>
+          <leafValues>
+            1.9850020110607147e-01 -8.3359397947788239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1512 8.0109452828764915e-03</internalNodes>
+          <leafValues>
+            4.8844348639249802e-02 -2.8590029478073120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1513 -2.7231130748987198e-02</internalNodes>
+          <leafValues>
+            -6.8558162450790405e-01 2.1877769380807877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1514 -2.0928949117660522e-02</internalNodes>
+          <leafValues>
+            -2.0820230245590210e-01 2.6585230603814125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1515 3.9801741950213909e-03</internalNodes>
+          <leafValues>
+            6.7004777491092682e-02 -2.3015810549259186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1516 2.1598068997263908e-03</internalNodes>
+          <leafValues>
+            -9.3109019100666046e-02 1.7235539853572845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1517 9.9411439150571823e-03</internalNodes>
+          <leafValues>
+            -4.4999819248914719e-02 3.1830498576164246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1518 -1.7938859760761261e-02</internalNodes>
+          <leafValues>
+            -2.1515959501266479e-01 7.2462916374206543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1519 -1.5030350368760992e-05</internalNodes>
+          <leafValues>
+            9.1437973082065582e-02 -1.6706299781799316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1520 4.2446260340511799e-03</internalNodes>
+          <leafValues>
+            6.4810760319232941e-02 -1.0556270182132721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1521 7.4575991675374098e-06</internalNodes>
+          <leafValues>
+            -2.6309689879417419e-01 5.6588400155305862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1522 -1.0457210242748260e-02</internalNodes>
+          <leafValues>
+            1.6078880429267883e-01 -7.2708033025264740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1523 -1.2225599493831396e-03</internalNodes>
+          <leafValues>
+            1.1558330059051514e-01 -1.2233489751815796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1524 1.6061630100011826e-02</internalNodes>
+          <leafValues>
+            2.8201790526509285e-02 -5.0996178388595581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1525 -1.6162030398845673e-02</internalNodes>
+          <leafValues>
+            -3.3857521414756775e-01 3.5924781113862991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1526 7.2181350551545620e-03</internalNodes>
+          <leafValues>
+            -7.2706200182437897e-02 1.0624659806489944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1527 -1.0416660457849503e-02</internalNodes>
+          <leafValues>
+            1.6205810010433197e-01 -9.4567760825157166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1528 1.3946600258350372e-02</internalNodes>
+          <leafValues>
+            5.4169639945030212e-02 -3.2068040966987610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1529 1.2734119780361652e-02</internalNodes>
+          <leafValues>
+            -8.6066111922264099e-02 1.9648639857769012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1530 -2.7858370915055275e-02</internalNodes>
+          <leafValues>
+            -2.8409239649772644e-01 2.6706550270318985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1531 -9.8931521177291870e-02</internalNodes>
+          <leafValues>
+            5.8457607030868530e-01 -2.1955510601401329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1532 2.3434299509972334e-03</internalNodes>
+          <leafValues>
+            9.6475467085838318e-02 -1.2095340341329575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1533 -2.3025700356811285e-03</internalNodes>
+          <leafValues>
+            7.3297969996929169e-02 -2.2309069335460663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1534 3.0791079625487328e-02</internalNodes>
+          <leafValues>
+            1.1463879607617855e-02 -2.4034079909324646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1535 -8.4339501336216927e-03</internalNodes>
+          <leafValues>
+            2.9611539840698242e-01 -4.2663689702749252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1536 -3.4617669880390167e-03</internalNodes>
+          <leafValues>
+            -2.1257869899272919e-01 4.2709458619356155e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1537 -3.3371929079294205e-02</internalNodes>
+          <leafValues>
+            3.5299271345138550e-01 -3.5570569336414337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1538 -3.7238128483295441e-02</internalNodes>
+          <leafValues>
+            -5.9177130460739136e-01 2.6775840669870377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1539 -2.0860069990158081e-01</internalNodes>
+          <leafValues>
+            -5.7595241069793701e-01 1.9763559103012085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1540 -6.8279817700386047e-02</internalNodes>
+          <leafValues>
+            3.4582608938217163e-01 -3.7861179560422897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1541 1.1600320227444172e-02</internalNodes>
+          <leafValues>
+            5.7685580104589462e-02 -2.6008209586143494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1542 -6.7218959331512451e-02</internalNodes>
+          <leafValues>
+            -4.5048278570175171e-01 1.2495189905166626e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1543 -5.1632397808134556e-03</internalNodes>
+          <leafValues>
+            1.6146700084209442e-01 -7.6975770294666290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1544 4.0113311260938644e-02</internalNodes>
+          <leafValues>
+            1.3131230138242245e-02 -4.5731449127197266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1545 3.7837740033864975e-02</internalNodes>
+          <leafValues>
+            2.3001920431852341e-02 -5.3636288642883301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1546 2.6023429818451405e-03</internalNodes>
+          <leafValues>
+            -6.1007440090179443e-02 1.7084220051765442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1547 -7.1841642260551453e-02</internalNodes>
+          <leafValues>
+            -5.8330380916595459e-01 2.0075250416994095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1548 -8.2885712618008256e-04</internalNodes>
+          <leafValues>
+            5.3465340286493301e-02 -1.9092260301113129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1549 -8.1979477545246482e-04</internalNodes>
+          <leafValues>
+            -2.3775930702686310e-01 4.5844908803701401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1550 1.0474859736859798e-02</internalNodes>
+          <leafValues>
+            -4.0103420615196228e-02 2.4948400259017944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1551 -6.3726361840963364e-03</internalNodes>
+          <leafValues>
+            -1.7087849974632263e-01 7.2894603013992310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1552 -3.6113489419221878e-02</internalNodes>
+          <leafValues>
+            -3.6879929900169373e-01 1.8331730738282204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1553 5.4730800911784172e-04</internalNodes>
+          <leafValues>
+            7.2073057293891907e-02 -1.8893779814243317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1554 1.7547659575939178e-02</internalNodes>
+          <leafValues>
+            -9.4452597200870514e-02 1.3311000168323517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1555 6.3078789971768856e-03</internalNodes>
+          <leafValues>
+            7.6223470270633698e-02 -1.6668230295181274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1556 2.5120719801634550e-03</internalNodes>
+          <leafValues>
+            5.0375527143478394e-01 -2.2624349221587181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1557 4.5274170115590096e-03</internalNodes>
+          <leafValues>
+            -1.3446590304374695e-01 9.9167577922344208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1558 -1.4772829308640212e-04</internalNodes>
+          <leafValues>
+            3.9675179868936539e-02 -6.0015488415956497e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1559 1.4728739857673645e-02</internalNodes>
+          <leafValues>
+            3.9208918809890747e-02 -3.0560019612312317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1560 -5.6161261163651943e-03</internalNodes>
+          <leafValues>
+            -1.0845050215721130e-01 4.7754660248756409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1561 -9.8265614360570908e-03</internalNodes>
+          <leafValues>
+            1.6729339957237244e-01 -7.6756693422794342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1562 1.7972329631447792e-02</internalNodes>
+          <leafValues>
+            -5.9147968888282776e-02 1.2773279845714569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1563 1.1233139783143997e-02</internalNodes>
+          <leafValues>
+            -9.2626020312309265e-02 1.5735739469528198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1564 1.3678249670192599e-03</internalNodes>
+          <leafValues>
+            -5.6156760454177856e-01 2.1800750866532326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1565 -4.1535100899636745e-03</internalNodes>
+          <leafValues>
+            -2.6951169967651367e-01 4.1213478893041611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1566 -6.7194692790508270e-02</internalNodes>
+          <leafValues>
+            5.6008362770080566e-01 -2.0973740145564079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1567 -8.0572411417961121e-02</internalNodes>
+          <leafValues>
+            -7.5846642255783081e-01 1.6614310443401337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1568 -9.7504993900656700e-03</internalNodes>
+          <leafValues>
+            2.2781279683113098e-01 -4.0246330201625824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1569 5.6034037843346596e-03</internalNodes>
+          <leafValues>
+            -7.5519852340221405e-02 1.6372010111808777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1570 -1.0232060216367245e-02</internalNodes>
+          <leafValues>
+            -3.5803198814392090e-01 4.6331088989973068e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1571 2.8616760391741991e-03</internalNodes>
+          <leafValues>
+            6.7746236920356750e-02 -1.6429120302200317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1572 7.7214869670569897e-03</internalNodes>
+          <leafValues>
+            3.4494820982217789e-02 -1.7762580513954163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1573 -7.0147789083421230e-03</internalNodes>
+          <leafValues>
+            1.7282240092754364e-01 -6.5176323056221008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1574 5.0470869988203049e-02</internalNodes>
+          <leafValues>
+            -2.7071960270404816e-02 3.5509440302848816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1575 -5.7124681770801544e-03</internalNodes>
+          <leafValues>
+            -1.5901079773902893e-01 7.9559110105037689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1576 8.7470682337880135e-03</internalNodes>
+          <leafValues>
+            3.7789858877658844e-02 -1.9156649708747864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1577 2.0058929920196533e-02</internalNodes>
+          <leafValues>
+            2.7415299788117409e-02 -3.8070109486579895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1578 -1.8094859551638365e-03</internalNodes>
+          <leafValues>
+            1.0538379848003387e-01 -1.4996549487113953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1579 -7.3339277878403664e-03</internalNodes>
+          <leafValues>
+            2.9203268885612488e-01 -6.1218190938234329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1580 4.4179419055581093e-03</internalNodes>
+          <leafValues>
+            1.8868620693683624e-01 -5.8132741600275040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1581 -1.3543309643864632e-02</internalNodes>
+          <leafValues>
+            -4.9409559369087219e-01 2.2855930030345917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1582 3.6197271198034286e-02</internalNodes>
+          <leafValues>
+            -2.6089120656251907e-02 3.0890250205993652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1583 -1.1831840127706528e-01</internalNodes>
+          <leafValues>
+            -5.9094661474227905e-01 1.8215280026197433e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1584 7.5656071305274963e-02</internalNodes>
+          <leafValues>
+            -3.5965580493211746e-02 3.0386120080947876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1585 -1.3134519569575787e-02</internalNodes>
+          <leafValues>
+            -2.6306131482124329e-01 4.2262919247150421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1586 1.8981160596013069e-02</internalNodes>
+          <leafValues>
+            -2.6483630761504173e-02 1.9371989369392395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1587 -4.6003229916095734e-02</internalNodes>
+          <leafValues>
+            4.0513500571250916e-01 -2.4454200640320778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1588 -1.3232730329036713e-02</internalNodes>
+          <leafValues>
+            -2.9721269011497498e-01 4.7959219664335251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1589 1.9586850702762604e-01</internalNodes>
+          <leafValues>
+            1.0540399700403214e-02 -8.6647927761077881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1590 9.6459556370973587e-03</internalNodes>
+          <leafValues>
+            -7.1334943175315857e-02 1.1469510197639465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1591 -3.9044579025357962e-03</internalNodes>
+          <leafValues>
+            1.0740319639444351e-01 -9.8514996469020844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1592 1.6896370798349380e-02</internalNodes>
+          <leafValues>
+            -7.6805070042610168e-02 1.9533200562000275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1593 -5.5025662295520306e-03</internalNodes>
+          <leafValues>
+            5.0643190741539001e-02 -2.0898430049419403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1594 -1.9621569663286209e-02</internalNodes>
+          <leafValues>
+            -2.9651358723640442e-01 3.2955050468444824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1595 7.7158107887953520e-04</internalNodes>
+          <leafValues>
+            4.6017099171876907e-02 -1.9982999563217163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1596 -1.1102840304374695e-01</internalNodes>
+          <leafValues>
+            5.7578712701797485e-01 -1.7741529271006584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1597 1.4945500297471881e-03</internalNodes>
+          <leafValues>
+            4.7335729002952576e-02 -2.0898909866809845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1598 5.0667919218540192e-02</internalNodes>
+          <leafValues>
+            -1.8657619133591652e-02 3.4070459008216858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1599 1.6073169186711311e-02</internalNodes>
+          <leafValues>
+            -3.6449488252401352e-02 2.6568078994750977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1600 -2.6536740362644196e-02</internalNodes>
+          <leafValues>
+            -3.6141690611839294e-01 2.9734270647168159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1601 -5.2550169639289379e-03</internalNodes>
+          <leafValues>
+            -1.3104499876499176e-01 8.2153528928756714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1602 -1.6678560525178909e-02</internalNodes>
+          <leafValues>
+            3.1324890255928040e-01 -4.5052528381347656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1603 3.4808400087058544e-03</internalNodes>
+          <leafValues>
+            8.2945778965950012e-02 -1.5753500163555145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1604 -8.0889053642749786e-02</internalNodes>
+          <leafValues>
+            -6.4314198493957520e-01 7.1740332059562206e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1605 -5.4260632023215294e-03</internalNodes>
+          <leafValues>
+            1.3533130288124084e-01 -1.0547909885644913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1606 1.6630839556455612e-02</internalNodes>
+          <leafValues>
+            4.1602101176977158e-02 -2.6668208837509155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1607 1.7991060158237815e-03</internalNodes>
+          <leafValues>
+            5.9531088918447495e-02 -1.8355309963226318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1608 2.7219969779253006e-02</internalNodes>
+          <leafValues>
+            -2.6586830615997314e-02 2.2722280025482178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1609 -9.6450755372643471e-03</internalNodes>
+          <leafValues>
+            -2.1428169310092926e-01 4.9515731632709503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1610 8.3123803138732910e-02</internalNodes>
+          <leafValues>
+            -4.2176891118288040e-02 3.0793419480323792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1611 1.4406450092792511e-02</internalNodes>
+          <leafValues>
+            -2.9500020667910576e-02 3.2144379615783691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1612 4.7938730567693710e-03</internalNodes>
+          <leafValues>
+            5.1244091242551804e-02 -1.0931850224733353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1613 -2.8978011105209589e-03</internalNodes>
+          <leafValues>
+            -1.4344370365142822e-01 6.6597223281860352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1614 -4.5887690037488937e-02</internalNodes>
+          <leafValues>
+            1.8003830313682556e-01 -1.5642790123820305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1615 -5.4717700928449631e-02</internalNodes>
+          <leafValues>
+            -3.5110801458358765e-01 3.0438890680670738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1616 -1.9787369295954704e-02</internalNodes>
+          <leafValues>
+            9.3385331332683563e-02 -4.9382571130990982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1617 2.5110379792749882e-03</internalNodes>
+          <leafValues>
+            -6.6672600805759430e-02 1.4406199753284454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1618 5.3660150617361069e-02</internalNodes>
+          <leafValues>
+            1.4468840323388577e-02 -6.7007470130920410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1619 -8.1825470551848412e-03</internalNodes>
+          <leafValues>
+            1.1510120332241058e-01 -8.0932617187500000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1620 -3.5225939936935902e-03</internalNodes>
+          <leafValues>
+            -1.4181140065193176e-01 6.1330620199441910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1621 2.8271550312638283e-02</internalNodes>
+          <leafValues>
+            -2.8353890404105186e-02 3.7045130133628845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1622 -6.4923018217086792e-02</internalNodes>
+          <leafValues>
+            -4.6481159329414368e-01 2.2807259112596512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1623 -3.5065850615501404e-01</internalNodes>
+          <leafValues>
+            -8.2529050111770630e-01 1.1031460016965866e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1624 5.1821782253682613e-03</internalNodes>
+          <leafValues>
+            3.6583270877599716e-02 -2.4567179381847382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1625 9.2609220882877707e-04</internalNodes>
+          <leafValues>
+            -6.1898738145828247e-02 1.9307570159435272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1626 2.5952830910682678e-03</internalNodes>
+          <leafValues>
+            4.3015718460083008e-02 -1.9770270586013794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1627 3.4880579914897680e-03</internalNodes>
+          <leafValues>
+            -6.8296536803245544e-02 1.5725280344486237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1628 2.4002529680728912e-03</internalNodes>
+          <leafValues>
+            -6.8618178367614746e-02 6.8551987409591675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1629 1.2020230060443282e-03</internalNodes>
+          <leafValues>
+            -1.2073139846324921e-01 9.5026522874832153e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1630 -2.0470360293984413e-02</internalNodes>
+          <leafValues>
+            -1.2891639769077301e-01 7.9386599361896515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1631 -5.9516180306673050e-02</internalNodes>
+          <leafValues>
+            2.4869689345359802e-01 -4.9729160964488983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1632 -1.0568950325250626e-02</internalNodes>
+          <leafValues>
+            -1.8583840131759644e-01 2.0700320601463318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1633 -1.4192920178174973e-02</internalNodes>
+          <leafValues>
+            -3.8137429952621460e-01 2.9879279434680939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1634 -2.4968578945845366e-03</internalNodes>
+          <leafValues>
+            9.1516681015491486e-02 -5.0178311765193939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1635 1.7714010027702898e-04</internalNodes>
+          <leafValues>
+            -1.1470019817352295e-01 9.9245697259902954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1636 7.8318670392036438e-02</internalNodes>
+          <leafValues>
+            3.6057420074939728e-03 -9.9996072053909302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1637 1.5502399764955044e-03</internalNodes>
+          <leafValues>
+            -1.2888610363006592e-01 7.9822011291980743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1638 -6.6678877919912338e-03</internalNodes>
+          <leafValues>
+            -8.8244557380676270e-02 2.8102599084377289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1639 -4.0497239679098129e-03</internalNodes>
+          <leafValues>
+            -1.4427180588245392e-01 8.7126396596431732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1640 -3.5481531172990799e-02</internalNodes>
+          <leafValues>
+            -4.4681170582771301e-01 1.4808270148932934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1641 -1.2597720138728619e-02</internalNodes>
+          <leafValues>
+            8.9324191212654114e-02 -1.2518140673637390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1642 7.4662449769675732e-03</internalNodes>
+          <leafValues>
+            7.4888199567794800e-02 -1.3587780296802521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1643 -6.7536987364292145e-02</internalNodes>
+          <leafValues>
+            2.3416820168495178e-01 -4.0952268987894058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1644 8.2704171538352966e-02</internalNodes>
+          <leafValues>
+            7.6422439888119698e-03 -8.5177552700042725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1645 -7.1595138870179653e-03</internalNodes>
+          <leafValues>
+            -1.8738010525703430e-01 5.5288419127464294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1646 -1.0481069795787334e-02</internalNodes>
+          <leafValues>
+            1.8271109461784363e-01 -5.9641968458890915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1647 4.5238467864692211e-03</internalNodes>
+          <leafValues>
+            -8.3817601203918457e-02 1.4822180569171906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1648 -2.6731120306067169e-04</internalNodes>
+          <leafValues>
+            -2.0896770060062408e-01 4.5835729688405991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1649 3.3838581293821335e-02</internalNodes>
+          <leafValues>
+            4.2582869529724121e-02 -2.1883819997310638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1650 2.2287720348685980e-03</internalNodes>
+          <leafValues>
+            -1.3284230232238770e-01 8.1795319914817810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1651 -5.4200361482799053e-03</internalNodes>
+          <leafValues>
+            -1.3896510004997253e-01 7.1154713630676270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1652 -4.9642968922853470e-02</internalNodes>
+          <leafValues>
+            4.8901641368865967e-01 -1.1556959711015224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1653 3.3323399256914854e-03</internalNodes>
+          <leafValues>
+            5.1426161080598831e-02 -1.8269440531730652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1654 2.4343939498066902e-02</internalNodes>
+          <leafValues>
+            -3.1839560717344284e-02 1.2758859992027283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1655 -2.3774489760398865e-02</internalNodes>
+          <leafValues>
+            3.2773551344871521e-01 -2.7216760441660881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1656 3.6809889134019613e-03</internalNodes>
+          <leafValues>
+            5.2922040224075317e-02 -1.2880720198154449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1657 -3.2609070185571909e-03</internalNodes>
+          <leafValues>
+            -1.4948120713233948e-01 6.5733537077903748e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1658 1.0793889872729778e-02</internalNodes>
+          <leafValues>
+            -3.2969951629638672e-02 3.2955420017242432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1659 5.4287910461425781e-04</internalNodes>
+          <leafValues>
+            -1.0678680241107941e-01 9.8564229905605316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1660 1.1902759782969952e-02</internalNodes>
+          <leafValues>
+            3.5682920366525650e-02 -3.1317448616027832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1661 2.4277849588543177e-03</internalNodes>
+          <leafValues>
+            -6.2080658972263336e-02 1.7598509788513184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1662 -4.4930889271199703e-03</internalNodes>
+          <leafValues>
+            1.1790850013494492e-01 -1.0593199729919434e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>143</maxWeakCount>
+      <stageThreshold>-1.7262409925460815e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1663 -2.0656470209360123e-02</internalNodes>
+          <leafValues>
+            2.5365149974822998e-01 -3.1044611334800720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1664 -3.6518350243568420e-02</internalNodes>
+          <leafValues>
+            2.4484130740165710e-01 -2.3221190273761749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1665 4.9312350153923035e-01</internalNodes>
+          <leafValues>
+            -1.6275240480899811e-01 2.8116190433502197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1666 2.0970099285477772e-05</internalNodes>
+          <leafValues>
+            -3.0840009450912476e-01 1.7317549884319305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1667 1.3082929886877537e-02</internalNodes>
+          <leafValues>
+            -2.5983220338821411e-01 1.5675869584083557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1668 -4.3061940232291818e-04</internalNodes>
+          <leafValues>
+            7.8543603420257568e-02 -3.9016070961952209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1669 -1.6367400065064430e-02</internalNodes>
+          <leafValues>
+            -4.3000039458274841e-01 7.4141636490821838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1670 3.6269389092922211e-02</internalNodes>
+          <leafValues>
+            -1.7073200643062592e-01 1.8045969307422638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1671 1.2340269982814789e-02</internalNodes>
+          <leafValues>
+            8.8775381445884705e-02 -3.4402659535408020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1672 -7.3516286909580231e-02</internalNodes>
+          <leafValues>
+            -4.1623479127883911e-01 -2.9528199229389429e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1673 4.6191830188035965e-04</internalNodes>
+          <leafValues>
+            6.5629899501800537e-02 -4.1018250584602356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1674 -1.4744039624929428e-02</internalNodes>
+          <leafValues>
+            2.2775030136108398e-01 -7.9184867441654205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1675 4.2559150606393814e-03</internalNodes>
+          <leafValues>
+            -2.4004960060119629e-01 1.1321090161800385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1676 -3.6180280148983002e-03</internalNodes>
+          <leafValues>
+            -2.7612069249153137e-01 1.0118050128221512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1677 4.6012919396162033e-02</internalNodes>
+          <leafValues>
+            4.5763589441776276e-02 -5.4713648557662964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1678 -1.6181809827685356e-02</internalNodes>
+          <leafValues>
+            1.9489669799804688e-01 -7.3955342173576355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1679 -2.3682719984208234e-05</internalNodes>
+          <leafValues>
+            1.1729680001735687e-01 -1.9396829605102539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1680 -2.1599140018224716e-03</internalNodes>
+          <leafValues>
+            -4.5654550194740295e-01 4.2699530720710754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1681 -7.9827345907688141e-03</internalNodes>
+          <leafValues>
+            -5.4107201099395752e-01 4.0036130696535110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1682 -8.1530469469726086e-04</internalNodes>
+          <leafValues>
+            -2.0640519261360168e-01 6.6795073449611664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1683 -4.7501060180366039e-03</internalNodes>
+          <leafValues>
+            -3.6572128534317017e-01 7.5665749609470367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1684 -3.4870140254497528e-02</internalNodes>
+          <leafValues>
+            -8.0093812942504883e-01 2.2356539964675903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1685 -1.9949559122323990e-02</internalNodes>
+          <leafValues>
+            -3.9110630750656128e-01 4.6844650059938431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1686 -5.9008211828768253e-03</internalNodes>
+          <leafValues>
+            9.0756498277187347e-02 -1.7600280046463013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1687 -1.4019970549270511e-03</internalNodes>
+          <leafValues>
+            -2.9260930418968201e-01 6.4894109964370728e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1688 -2.2886939346790314e-02</internalNodes>
+          <leafValues>
+            -4.8391869664192200e-01 5.0514958798885345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1689 -1.0039290413260460e-02</internalNodes>
+          <leafValues>
+            2.6921668648719788e-01 -7.5274370610713959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1690 1.6729189082980156e-02</internalNodes>
+          <leafValues>
+            -7.3217533528804779e-02 2.2045159339904785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1691 -2.0423909649252892e-02</internalNodes>
+          <leafValues>
+            -4.5161980390548706e-01 4.5858111232519150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1692 -3.5104680806398392e-02</internalNodes>
+          <leafValues>
+            -5.5169981718063354e-01 2.3118300363421440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1693 1.0697999969124794e-02</internalNodes>
+          <leafValues>
+            3.3516589552164078e-02 -5.2482652664184570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1694 -3.8978241384029388e-02</internalNodes>
+          <leafValues>
+            -6.2331187725067139e-01 2.6838419958949089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1695 4.8226700164377689e-03</internalNodes>
+          <leafValues>
+            -1.1215549707412720e-01 1.5613789856433868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1696 3.6878231167793274e-01</internalNodes>
+          <leafValues>
+            1.9857980310916901e-02 -6.1260747909545898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1697 -7.7059920877218246e-03</internalNodes>
+          <leafValues>
+            -3.7371110916137695e-01 4.3724238872528076e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1698 -6.6843323409557343e-02</internalNodes>
+          <leafValues>
+            -5.0772088766098022e-01 2.4401089176535606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1699 3.7273049354553223e-02</internalNodes>
+          <leafValues>
+            3.6522880196571350e-02 -4.3735611438751221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1700 -3.3105209469795227e-02</internalNodes>
+          <leafValues>
+            -3.4438988566398621e-01 3.2440148293972015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1701 5.3402669727802277e-03</internalNodes>
+          <leafValues>
+            9.2385761439800262e-02 -1.7823779582977295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1702 2.1542439237236977e-02</internalNodes>
+          <leafValues>
+            -1.9848670065402985e-01 5.1953200250864029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1703 3.3289310336112976e-01</internalNodes>
+          <leafValues>
+            -6.0750268399715424e-02 2.8925099968910217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1704 -6.6301261540502310e-04</internalNodes>
+          <leafValues>
+            3.3636718988418579e-02 -2.8510418534278870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1705 4.6686761081218719e-02</internalNodes>
+          <leafValues>
+            -4.9883669614791870e-01 3.3776078373193741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1706 -2.2452229168266058e-03</internalNodes>
+          <leafValues>
+            -1.9685390591621399e-01 9.5161177217960358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1707 -1.1499020271003246e-02</internalNodes>
+          <leafValues>
+            -3.2423889636993408e-01 5.2468359470367432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1708 1.3134529814124107e-02</internalNodes>
+          <leafValues>
+            -6.7538492381572723e-02 2.7605938911437988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1709 -1.5978980809450150e-02</internalNodes>
+          <leafValues>
+            3.1496050953865051e-01 -7.6657392084598541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1710 2.4199750274419785e-02</internalNodes>
+          <leafValues>
+            5.5836521089076996e-02 -3.6609899997711182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1711 4.0229028090834618e-03</internalNodes>
+          <leafValues>
+            -1.3053479790687561e-01 1.3470110297203064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1712 -1.4172590337693691e-02</internalNodes>
+          <leafValues>
+            -8.8616542518138885e-02 5.5053278803825378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1713 1.8967399373650551e-02</internalNodes>
+          <leafValues>
+            5.1348548382520676e-02 -3.1439921259880066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1714 2.6502970606088638e-02</internalNodes>
+          <leafValues>
+            -1.1065970361232758e-01 8.8080927729606628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1715 -3.9654489606618881e-02</internalNodes>
+          <leafValues>
+            -5.0742971897125244e-01 3.2999441027641296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1716 -8.9988503605127335e-03</internalNodes>
+          <leafValues>
+            1.2830139696598053e-01 -7.3064133524894714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1717 7.4613288044929504e-02</internalNodes>
+          <leafValues>
+            3.1729809939861298e-02 -5.3899657726287842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1718 3.3414870500564575e-02</internalNodes>
+          <leafValues>
+            -6.1130590736865997e-02 2.4669900536537170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1719 9.6071150619536638e-04</internalNodes>
+          <leafValues>
+            1.2528179585933685e-01 -1.4304199814796448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1720 -8.6224973201751709e-03</internalNodes>
+          <leafValues>
+            -2.2081799805164337e-01 4.7569438815116882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1721 3.9893008768558502e-02</internalNodes>
+          <leafValues>
+            -5.1774360239505768e-02 3.1735679507255554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1722 8.5388116538524628e-02</internalNodes>
+          <leafValues>
+            -3.5584390163421631e-02 4.1974198818206787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1723 6.3205747865140438e-03</internalNodes>
+          <leafValues>
+            6.9412536919116974e-02 -2.9979988932609558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1724 -5.8932311832904816e-02</internalNodes>
+          <leafValues>
+            -4.6194219589233398e-01 2.2290540859103203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1725 -1.0054419748485088e-02</internalNodes>
+          <leafValues>
+            2.3649129271507263e-01 -6.6811926662921906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1726 -2.5194720365107059e-05</internalNodes>
+          <leafValues>
+            7.8815452754497528e-02 -1.1585489660501480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1727 -5.9346649795770645e-02</internalNodes>
+          <leafValues>
+            -5.8799749612808228e-01 3.0486419796943665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1728 2.0421659573912621e-02</internalNodes>
+          <leafValues>
+            3.9184041321277618e-02 -2.6986798644065857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1729 -4.0381640195846558e-02</internalNodes>
+          <leafValues>
+            -6.1601102352142334e-01 2.5353100150823593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1730 1.7877650260925293e-01</internalNodes>
+          <leafValues>
+            -5.7135760784149170e-02 1.7361579835414886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1731 -2.2120740264654160e-02</internalNodes>
+          <leafValues>
+            -3.7697589397430420e-01 4.2690049856901169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1732 1.1585020273923874e-01</internalNodes>
+          <leafValues>
+            9.8102567717432976e-03 -6.1380887031555176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1733 9.7944810986518860e-02</internalNodes>
+          <leafValues>
+            3.6329559981822968e-02 -4.5240780711174011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1734 -2.9123030602931976e-02</internalNodes>
+          <leafValues>
+            -6.5607357025146484e-01 8.4500880911946297e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1735 -1.3053599745035172e-02</internalNodes>
+          <leafValues>
+            -3.4685650467872620e-01 4.6511679887771606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1736 1.3451489619910717e-02</internalNodes>
+          <leafValues>
+            3.4420430660247803e-02 -1.0168869793415070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1737 -2.3957140743732452e-02</internalNodes>
+          <leafValues>
+            -8.4189480543136597e-01 1.9317319616675377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1738 -1.3450190424919128e-01</internalNodes>
+          <leafValues>
+            3.9132338762283325e-01 -2.1901259198784828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1739 -1.0342430323362350e-01</internalNodes>
+          <leafValues>
+            6.0790222883224487e-01 -2.5869879871606827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1740 -4.1464429348707199e-02</internalNodes>
+          <leafValues>
+            -3.9631319046020508e-01 3.7771981209516525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1741 -3.4945748746395111e-02</internalNodes>
+          <leafValues>
+            -4.5746931433677673e-01 3.2913569360971451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1742 1.4289909973740578e-02</internalNodes>
+          <leafValues>
+            -5.0757531076669693e-02 3.1772908568382263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1743 -5.4311589337885380e-03</internalNodes>
+          <leafValues>
+            2.4708689749240875e-01 -7.8526623547077179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1744 2.6972589548677206e-03</internalNodes>
+          <leafValues>
+            -3.4061861038208008e-01 5.0948519259691238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1745 -4.3831961229443550e-03</internalNodes>
+          <leafValues>
+            8.0095797777175903e-02 -2.0902189612388611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1746 -1.5958329662680626e-02</internalNodes>
+          <leafValues>
+            -2.4625590443611145e-01 5.8348231017589569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1747 4.5252371579408646e-02</internalNodes>
+          <leafValues>
+            4.1630141437053680e-02 -3.5550931096076965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1748 -1.8278149887919426e-02</internalNodes>
+          <leafValues>
+            3.0804929137229919e-01 -4.7184839844703674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1749 2.5277629494667053e-02</internalNodes>
+          <leafValues>
+            2.9698649421334267e-02 -5.3776097297668457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1750 7.2078350931406021e-03</internalNodes>
+          <leafValues>
+            -1.2820510566234589e-01 1.1753190308809280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1751 -1.4014700055122375e-01</internalNodes>
+          <leafValues>
+            -4.5020869374275208e-01 3.2753791660070419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1752 -4.5832369476556778e-02</internalNodes>
+          <leafValues>
+            -4.2000839114189148e-01 2.4114929139614105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1753 -4.3976899236440659e-02</internalNodes>
+          <leafValues>
+            -4.5973241329193115e-01 3.3604741096496582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1754 -1.0124820284545422e-02</internalNodes>
+          <leafValues>
+            1.6260810196399689e-01 -6.6449157893657684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1755 -1.3071260182186961e-03</internalNodes>
+          <leafValues>
+            1.1608310043811798e-01 -1.3168659806251526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1756 4.5284889638423920e-02</internalNodes>
+          <leafValues>
+            3.5751760005950928e-02 -4.4795739650726318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1757 -2.0851079374551773e-02</internalNodes>
+          <leafValues>
+            2.4665319919586182e-01 -6.5854541957378387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1758 2.6742550544440746e-03</internalNodes>
+          <leafValues>
+            5.1683109253644943e-02 -1.3699389994144440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1759 1.3148089637979865e-03</internalNodes>
+          <leafValues>
+            7.7798873186111450e-02 -2.1064509451389313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1760 -1.8174739554524422e-02</internalNodes>
+          <leafValues>
+            1.7355039715766907e-01 -7.2417192161083221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1761 1.4314319938421249e-02</internalNodes>
+          <leafValues>
+            8.1756986677646637e-02 -1.7111450433731079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1762 -1.6486430540680885e-02</internalNodes>
+          <leafValues>
+            2.2809509932994843e-01 -6.5906368196010590e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1763 3.0756060034036636e-02</internalNodes>
+          <leafValues>
+            3.8717139512300491e-02 -4.0505141019821167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1764 2.6106089353561401e-02</internalNodes>
+          <leafValues>
+            3.0850199982523918e-02 -2.7759250998497009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1765 8.0401107668876648e-02</internalNodes>
+          <leafValues>
+            2.9792500659823418e-02 -4.4742569327354431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1766 -1.8350789323449135e-02</internalNodes>
+          <leafValues>
+            1.1515419930219650e-01 -2.8744319453835487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1767 3.4827049821615219e-02</internalNodes>
+          <leafValues>
+            2.8738139197230339e-02 -4.8401808738708496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1768 -8.8250182569026947e-02</internalNodes>
+          <leafValues>
+            -4.2635539174079895e-01 3.0173489823937416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1769 1.4836989343166351e-01</internalNodes>
+          <leafValues>
+            2.2089749574661255e-02 -5.5364227294921875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1770 -1.8949609249830246e-02</internalNodes>
+          <leafValues>
+            -2.3020160198211670e-01 3.9267301559448242e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1771 -5.6775949895381927e-02</internalNodes>
+          <leafValues>
+            3.5013529658317566e-01 -4.0862828493118286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1772 6.2286540865898132e-02</internalNodes>
+          <leafValues>
+            2.2344540804624557e-02 -7.1082341670989990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1773 -3.8629550486803055e-02</internalNodes>
+          <leafValues>
+            -3.2933491468429565e-01 3.8508068770170212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1774 2.8154330328106880e-02</internalNodes>
+          <leafValues>
+            -7.3690913617610931e-02 1.8824370205402374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1775 -1.0570179671049118e-02</internalNodes>
+          <leafValues>
+            -2.7806881070137024e-01 4.7679189592599869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1776 5.6604571640491486e-02</internalNodes>
+          <leafValues>
+            2.4767610430717468e-01 -5.6830938905477524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1777 -2.8522670269012451e-01</internalNodes>
+          <leafValues>
+            5.2345401048660278e-01 -2.3652829229831696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1778 3.4807138144969940e-02</internalNodes>
+          <leafValues>
+            2.4819910526275635e-02 -4.3205270171165466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1779 -2.3218799382448196e-02</internalNodes>
+          <leafValues>
+            2.9929161071777344e-01 -4.4712670147418976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1780 -6.3094392418861389e-02</internalNodes>
+          <leafValues>
+            3.3279260993003845e-01 -1.6075499355792999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1781 3.0182430148124695e-01</internalNodes>
+          <leafValues>
+            -7.5196906924247742e-02 1.9139809906482697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1782 2.3077869787812233e-02</internalNodes>
+          <leafValues>
+            3.6844979971647263e-02 -2.8761258721351624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1783 1.0964149981737137e-01</internalNodes>
+          <leafValues>
+            3.7548121064901352e-02 -4.1763558983802795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1784 2.9672039672732353e-02</internalNodes>
+          <leafValues>
+            -7.8409820795059204e-02 1.3064210116863251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1785 6.3356538303196430e-03</internalNodes>
+          <leafValues>
+            6.7014321684837341e-02 -2.0481500029563904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1786 -1.9940949976444244e-02</internalNodes>
+          <leafValues>
+            8.4663636982440948e-02 -4.2069409042596817e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1787 -4.7988001257181168e-02</internalNodes>
+          <leafValues>
+            -6.1099517345428467e-01 2.2842260077595711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1788 4.8280019313097000e-02</internalNodes>
+          <leafValues>
+            7.4727279134094715e-03 -7.5153297185897827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1789 -2.5825301418080926e-04</internalNodes>
+          <leafValues>
+            3.5517089068889618e-02 -3.2686069607734680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1790 -4.8175308853387833e-02</internalNodes>
+          <leafValues>
+            -5.8099460601806641e-01 1.9760759547352791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1791 -2.8606340289115906e-02</internalNodes>
+          <leafValues>
+            3.2096970081329346e-01 -4.0734320878982544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1792 -4.3328531086444855e-02</internalNodes>
+          <leafValues>
+            -3.3021429181098938e-01 3.1527239829301834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1793 2.2753410041332245e-02</internalNodes>
+          <leafValues>
+            3.7327829748392105e-02 -3.6291739344596863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1794 1.8975350030814297e-05</internalNodes>
+          <leafValues>
+            -1.1503349989652634e-01 4.1816640645265579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1795 1.8077540397644043e-01</internalNodes>
+          <leafValues>
+            -5.5751871317625046e-02 2.2424830496311188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1796 -1.2539149820804596e-01</internalNodes>
+          <leafValues>
+            -8.8098400831222534e-01 3.8788339588791132e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1797 -8.0908974632620811e-03</internalNodes>
+          <leafValues>
+            2.6210701465606689e-01 -5.3706649690866470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1798 9.9102966487407684e-03</internalNodes>
+          <leafValues>
+            -1.2978099286556244e-01 8.3635807037353516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1799 2.4792920798063278e-02</internalNodes>
+          <leafValues>
+            -1.4584439992904663e-01 9.2305660247802734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1800 4.5074880123138428e-02</internalNodes>
+          <leafValues>
+            -7.2375498712062836e-02 2.6057431101799011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1801 -7.9205513000488281e-02</internalNodes>
+          <leafValues>
+            -6.2073522806167603e-01 2.1323349326848984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1802 -4.4725250452756882e-02</internalNodes>
+          <leafValues>
+            -6.4248198270797729e-01 9.5317112281918526e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1803 -3.4065779298543930e-02</internalNodes>
+          <leafValues>
+            3.0759710073471069e-01 -4.2296990752220154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1804 -2.9756739735603333e-02</internalNodes>
+          <leafValues>
+            2.5211650133132935e-01 -3.1183030456304550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1805 -3.2026950269937515e-02</internalNodes>
+          <leafValues>
+            -5.5300801992416382e-01 2.8021570295095444e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>193</maxWeakCount>
+      <stageThreshold>-1.4976780414581299e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1806 2.8652619570493698e-02</internalNodes>
+          <leafValues>
+            -2.1822139620780945e-01 2.2675579786300659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1807 4.3320041149854660e-03</internalNodes>
+          <leafValues>
+            -2.8597879409790039e-01 1.0589209944009781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1808 5.6604119017720222e-03</internalNodes>
+          <leafValues>
+            8.8295452296733856e-02 -3.8920480012893677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1809 2.4440148845314980e-03</internalNodes>
+          <leafValues>
+            -3.5482680797576904e-01 9.9362373352050781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1810 2.2643520496785641e-03</internalNodes>
+          <leafValues>
+            -2.8858441114425659e-01 8.8367857038974762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1811 5.3952648304402828e-03</internalNodes>
+          <leafValues>
+            8.5537381470203400e-02 -3.0366399884223938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1812 -7.2699488373473287e-04</internalNodes>
+          <leafValues>
+            7.4840240180492401e-02 -3.4039780497550964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1813 -9.7503658616915345e-04</internalNodes>
+          <leafValues>
+            1.2008629739284515e-01 -2.5634410977363586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1814 4.0540988557040691e-03</internalNodes>
+          <leafValues>
+            6.7266032099723816e-02 -3.5701939463615417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1815 2.5258921086788177e-03</internalNodes>
+          <leafValues>
+            -4.1966471076011658e-01 5.5665798485279083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1816 -1.2021360453218222e-03</internalNodes>
+          <leafValues>
+            1.0004480183124542e-01 -2.1932320296764374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1817 7.7549100387841463e-04</internalNodes>
+          <leafValues>
+            -1.3562729954719543e-01 1.1973659694194794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1818 -5.0699848681688309e-02</internalNodes>
+          <leafValues>
+            4.5418289303779602e-01 -3.9030350744724274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1819 1.3364490121603012e-02</internalNodes>
+          <leafValues>
+            1.1166039854288101e-01 -1.7938789725303650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1820 -1.5418980270624161e-02</internalNodes>
+          <leafValues>
+            -3.5180059075355530e-01 4.7354999929666519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1821 -4.2981099337339401e-02</internalNodes>
+          <leafValues>
+            3.9232799410820007e-01 -4.5337028801441193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1822 6.2867929227650166e-03</internalNodes>
+          <leafValues>
+            6.4331822097301483e-02 -2.2239510715007782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1823 -3.5951940808445215e-03</internalNodes>
+          <leafValues>
+            9.5404297113418579e-02 -1.5338289737701416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1824 -7.6760917901992798e-02</internalNodes>
+          <leafValues>
+            -6.5099817514419556e-01 1.7283650115132332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1825 4.6225200640037656e-04</internalNodes>
+          <leafValues>
+            -4.3415609002113342e-01 2.5241859257221222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1826 7.5868278509005904e-04</internalNodes>
+          <leafValues>
+            -1.4624330401420593e-01 9.6319071948528290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1827 -5.0252641085535288e-04</internalNodes>
+          <leafValues>
+            1.3584020733833313e-01 -2.3181040585041046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1828 9.7315143793821335e-03</internalNodes>
+          <leafValues>
+            -8.5155591368675232e-02 2.0156989991664886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1829 -2.6432229205965996e-02</internalNodes>
+          <leafValues>
+            -3.7002518773078918e-01 2.4616630747914314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1830 -4.4683468877337873e-04</internalNodes>
+          <leafValues>
+            1.0048960149288177e-01 -1.8588609993457794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1831 1.9872789271175861e-03</internalNodes>
+          <leafValues>
+            5.3223919123411179e-02 -3.1603801250457764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1832 3.1368629424832761e-04</internalNodes>
+          <leafValues>
+            -1.3213190436363220e-01 9.5771767199039459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1833 5.9834700077772141e-03</internalNodes>
+          <leafValues>
+            -7.5681813061237335e-02 1.5230950713157654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1834 -5.0965389236807823e-03</internalNodes>
+          <leafValues>
+            -1.8477819859981537e-01 7.6022140681743622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1835 -1.9187610596418381e-02</internalNodes>
+          <leafValues>
+            2.1431809663772583e-01 -4.9764219671487808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1836 2.3320479318499565e-02</internalNodes>
+          <leafValues>
+            -4.8689320683479309e-02 2.6578998565673828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1837 -6.9449091097339988e-04</internalNodes>
+          <leafValues>
+            -1.5433350205421448e-01 8.7410651147365570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1838 4.8893648199737072e-03</internalNodes>
+          <leafValues>
+            5.1342789083719254e-02 -2.6165360212326050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1839 -2.7428869158029556e-02</internalNodes>
+          <leafValues>
+            -3.7972038984298706e-01 3.1821161508560181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1840 -1.7734549939632416e-02</internalNodes>
+          <leafValues>
+            1.9976620376110077e-01 -6.2318049371242523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1841 1.5148259699344635e-01</internalNodes>
+          <leafValues>
+            7.4510741978883743e-03 -5.8031332492828369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1842 1.5324390260502696e-03</internalNodes>
+          <leafValues>
+            -1.2510550022125244e-01 1.0431899875402451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1843 -1.2310810387134552e-02</internalNodes>
+          <leafValues>
+            -2.3539729416370392e-01 5.3646210581064224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1844 -1.1210800148546696e-02</internalNodes>
+          <leafValues>
+            1.0759239643812180e-01 -1.2055230140686035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1845 2.7532500680536032e-03</internalNodes>
+          <leafValues>
+            -6.6479906439781189e-02 1.7321150004863739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1846 -8.4678819403052330e-03</internalNodes>
+          <leafValues>
+            -3.1850680708885193e-01 4.2280819267034531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1847 -7.3283319361507893e-03</internalNodes>
+          <leafValues>
+            -1.6369259357452393e-01 3.1772349029779434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1848 4.7156549990177155e-02</internalNodes>
+          <leafValues>
+            -6.1667099595069885e-02 1.7410990595817566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1849 8.2125868648290634e-03</internalNodes>
+          <leafValues>
+            6.7069798707962036e-02 -2.2030070424079895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1850 7.6550841331481934e-03</internalNodes>
+          <leafValues>
+            6.1422310769557953e-02 -1.9357620179653168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1851 -4.5372851192951202e-02</internalNodes>
+          <leafValues>
+            -4.7565659880638123e-01 2.2869469597935677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1852 3.7434820551425219e-03</internalNodes>
+          <leafValues>
+            -9.0940922498703003e-02 1.3841210305690765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1853 2.3490150924772024e-03</internalNodes>
+          <leafValues>
+            6.3291497528553009e-02 -1.5506389737129211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1854 -2.4149749428033829e-02</internalNodes>
+          <leafValues>
+            3.4588441252708435e-01 -3.1525820493698120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1855 1.4878350310027599e-02</internalNodes>
+          <leafValues>
+            2.4215059354901314e-02 -3.2387629151344299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1856 2.9843160882592201e-02</internalNodes>
+          <leafValues>
+            -2.7817690744996071e-02 4.0939471125602722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1857 7.1600051596760750e-03</internalNodes>
+          <leafValues>
+            -4.6596240252256393e-02 7.4547067284584045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1858 5.6267209351062775e-02</internalNodes>
+          <leafValues>
+            2.9551850631833076e-02 -4.0098059177398682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1859 -4.5356149785220623e-03</internalNodes>
+          <leafValues>
+            8.1820577383041382e-02 -1.0619299858808517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1860 -1.3697359710931778e-02</internalNodes>
+          <leafValues>
+            -1.9359089434146881e-01 7.0917747914791107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1861 -1.5458730049431324e-03</internalNodes>
+          <leafValues>
+            -2.1987679600715637e-01 2.8396489098668098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1862 2.9332858975976706e-03</internalNodes>
+          <leafValues>
+            -7.6153233647346497e-02 1.6460180282592773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1863 3.4973609726876020e-03</internalNodes>
+          <leafValues>
+            -6.8196080625057220e-02 1.6717350482940674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1864 -1.8307069316506386e-02</internalNodes>
+          <leafValues>
+            -1.8867099285125732e-01 6.9932736456394196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1865 -1.7092080414295197e-01</internalNodes>
+          <leafValues>
+            -5.0067770481109619e-01 7.8164357692003250e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1866 4.1620130650699139e-03</internalNodes>
+          <leafValues>
+            5.5900041013956070e-02 -2.2972549498081207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1867 -1.9724309444427490e-02</internalNodes>
+          <leafValues>
+            3.2998558878898621e-01 -3.6602400243282318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1868 5.3331600502133369e-03</internalNodes>
+          <leafValues>
+            -1.4134259521961212e-01 8.8277637958526611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1869 -4.2182218283414841e-02</internalNodes>
+          <leafValues>
+            -6.6718780994415283e-01 1.5770509839057922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1870 -5.2826730534434319e-03</internalNodes>
+          <leafValues>
+            1.7025630176067352e-01 -6.8491317331790924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1871 -2.3227441124618053e-03</internalNodes>
+          <leafValues>
+            7.2378590703010559e-02 -1.0066709667444229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1872 -1.6239390242844820e-03</internalNodes>
+          <leafValues>
+            -2.2501319646835327e-01 5.5898498743772507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1873 5.6083410978317261e-02</internalNodes>
+          <leafValues>
+            1.3646169565618038e-02 -4.9306789040565491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1874 -3.0199930071830750e-02</internalNodes>
+          <leafValues>
+            2.3070830106735229e-01 -5.3645938634872437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1875 1.9157670438289642e-02</internalNodes>
+          <leafValues>
+            3.6830320954322815e-02 -3.9522978663444519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1876 3.5853029694408178e-03</internalNodes>
+          <leafValues>
+            -6.1893220990896225e-02 1.7583209276199341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1877 -2.8775330632925034e-02</internalNodes>
+          <leafValues>
+            -3.1838440895080566e-01 2.3103740066289902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1878 2.5611401069909334e-03</internalNodes>
+          <leafValues>
+            -1.0484419763088226e-01 9.7152568399906158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1879 -3.1554490327835083e-02</internalNodes>
+          <leafValues>
+            2.9366511106491089e-01 -2.4189069867134094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1880 -7.3520588921383023e-04</internalNodes>
+          <leafValues>
+            9.7711041569709778e-02 -1.5248039364814758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1881 -4.7993879765272141e-02</internalNodes>
+          <leafValues>
+            -9.4587820768356323e-01 9.0406481176614761e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1882 5.2936570718884468e-03</internalNodes>
+          <leafValues>
+            3.3320371061563492e-02 -3.1268939375877380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1883 1.6903249546885490e-02</internalNodes>
+          <leafValues>
+            -2.4132709950208664e-02 2.8483408689498901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1884 -7.0723611861467361e-03</internalNodes>
+          <leafValues>
+            -1.7524200677871704e-01 7.2713881731033325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1885 6.4191617071628571e-02</internalNodes>
+          <leafValues>
+            -2.0969670265913010e-02 3.5402628779411316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1886 2.9694940894842148e-03</internalNodes>
+          <leafValues>
+            -7.5086936354637146e-02 1.4321349561214447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1887 -2.0105259492993355e-02</internalNodes>
+          <leafValues>
+            6.0784012079238892e-01 -1.8104499205946922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1888 -1.3169869780540466e-02</internalNodes>
+          <leafValues>
+            -5.4678368568420410e-01 2.4742240086197853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1889 -1.4226729981601238e-02</internalNodes>
+          <leafValues>
+            -4.6722590923309326e-01 3.1489629298448563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1890 3.7746191024780273e-02</internalNodes>
+          <leafValues>
+            -3.8495831191539764e-02 3.5333481431007385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1891 -3.8704369217157364e-03</internalNodes>
+          <leafValues>
+            1.4984290301799774e-01 -5.6549768894910812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1892 -1.1565440334379673e-02</internalNodes>
+          <leafValues>
+            -1.5227930247783661e-01 7.6062962412834167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1893 -8.8854476809501648e-02</internalNodes>
+          <leafValues>
+            -7.2967928647994995e-01 4.8231678083539009e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1894 -2.0447981078177691e-03</internalNodes>
+          <leafValues>
+            1.4148180186748505e-01 -8.3200357854366302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1895 -1.1762860231101513e-02</internalNodes>
+          <leafValues>
+            -4.0200519561767578e-01 2.6679439470171928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1896 -1.7539029940962791e-02</internalNodes>
+          <leafValues>
+            -3.7316259741783142e-01 3.0171979218721390e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1897 3.8314110133796930e-03</internalNodes>
+          <leafValues>
+            -9.3409948050975800e-02 7.9503498971462250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1898 -1.4472359791398048e-02</internalNodes>
+          <leafValues>
+            3.4333580732345581e-01 -4.3657060712575912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1899 -2.6516690850257874e-02</internalNodes>
+          <leafValues>
+            -4.8230230808258057e-01 1.6811650246381760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1900 -3.3194791525602341e-02</internalNodes>
+          <leafValues>
+            -4.3580260872840881e-01 2.2644890472292900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1901 4.4987560249865055e-03</internalNodes>
+          <leafValues>
+            -3.2281540334224701e-02 8.9946307241916656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1902 3.6823831032961607e-03</internalNodes>
+          <leafValues>
+            -6.8755462765693665e-02 1.4339810609817505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1903 -1.1184140294790268e-01</internalNodes>
+          <leafValues>
+            -7.7756762504577637e-01 5.2246451377868652e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1904 -7.3255039751529694e-02</internalNodes>
+          <leafValues>
+            -5.5630749464035034e-01 1.9127149134874344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1905 2.9855769127607346e-02</internalNodes>
+          <leafValues>
+            2.1178830415010452e-02 -4.0850040316581726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1906 -7.3472231626510620e-02</internalNodes>
+          <leafValues>
+            8.2820487022399902e-01 -1.2452909722924232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1907 -7.2046648710966110e-04</internalNodes>
+          <leafValues>
+            9.9630527198314667e-02 -9.5278859138488770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1908 -3.8003330701030791e-04</internalNodes>
+          <leafValues>
+            1.0231109708547592e-01 -1.0351389646530151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1909 -4.5453108847141266e-02</internalNodes>
+          <leafValues>
+            -6.4885061979293823e-01 1.1966000311076641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1910 -5.1456969231367111e-04</internalNodes>
+          <leafValues>
+            -1.5083299577236176e-01 6.6544473171234131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1911 2.7949180454015732e-02</internalNodes>
+          <leafValues>
+            1.7186399549245834e-02 -3.7501189112663269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1912 6.3039876520633698e-02</internalNodes>
+          <leafValues>
+            -4.3821588158607483e-02 2.4789440631866455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1913 -2.2690258920192719e-03</internalNodes>
+          <leafValues>
+            7.4712008237838745e-02 -1.1131580173969269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1914 -3.8063840474933386e-03</internalNodes>
+          <leafValues>
+            -1.5530909597873688e-01 6.5264508128166199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1915 3.7190090864896774e-02</internalNodes>
+          <leafValues>
+            -2.9698630794882774e-02 2.3071870207786560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1916 2.1895840764045715e-02</internalNodes>
+          <leafValues>
+            1.5778519213199615e-02 -6.3006269931793213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1917 -3.1993988901376724e-02</internalNodes>
+          <leafValues>
+            2.6250898838043213e-01 -2.4627109989523888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1918 -1.6778679564595222e-02</internalNodes>
+          <leafValues>
+            -4.2436981201171875e-01 2.2607849910855293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1919 5.2477661520242691e-02</internalNodes>
+          <leafValues>
+            -1.6188420355319977e-02 3.1766140460968018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1920 1.0443729907274246e-01</internalNodes>
+          <leafValues>
+            1.1290200054645538e-02 -8.6021018028259277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1921 -6.5574781037867069e-03</internalNodes>
+          <leafValues>
+            1.2225849926471710e-01 -5.6091431528329849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1922 1.6797389835119247e-02</internalNodes>
+          <leafValues>
+            3.5811539739370346e-02 -3.1163010001182556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1923 5.0427159294486046e-03</internalNodes>
+          <leafValues>
+            -5.0439529120922089e-02 6.3930332660675049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1924 -3.4571789205074310e-02</internalNodes>
+          <leafValues>
+            -5.6278371810913086e-01 1.6692740842700005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1925 3.7999521009624004e-03</internalNodes>
+          <leafValues>
+            -6.8566747009754181e-02 9.6017867326736450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1926 -1.1995599605143070e-02</internalNodes>
+          <leafValues>
+            1.3819910585880280e-01 -7.1510016918182373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1927 1.1098429560661316e-02</internalNodes>
+          <leafValues>
+            5.3506620228290558e-02 -1.0482089966535568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1928 -1.2905290722846985e-01</internalNodes>
+          <leafValues>
+            -6.7262178659439087e-01 1.5195850282907486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1929 6.3130040653049946e-03</internalNodes>
+          <leafValues>
+            -6.1030130833387375e-02 1.0355649888515472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1930 4.0955888107419014e-03</internalNodes>
+          <leafValues>
+            7.0534646511077881e-02 -1.4484269917011261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1931 -1.0530550032854080e-02</internalNodes>
+          <leafValues>
+            9.8569639027118683e-02 -3.7973210215568542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1932 3.6035990342497826e-03</internalNodes>
+          <leafValues>
+            5.1277790218591690e-02 -1.8671560287475586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1933 1.1999369598925114e-03</internalNodes>
+          <leafValues>
+            -6.3231408596038818e-02 1.0446310043334961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1934 -1.9585370318964124e-04</internalNodes>
+          <leafValues>
+            8.6044862866401672e-02 -1.1856850236654282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1935 -1.2213560193777084e-01</internalNodes>
+          <leafValues>
+            -8.8419800996780396e-01 6.3145011663436890e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1936 -7.7650691382586956e-03</internalNodes>
+          <leafValues>
+            1.3725960254669189e-01 -8.0412857234477997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1937 1.5734319388866425e-01</internalNodes>
+          <leafValues>
+            1.2743320316076279e-02 -6.5401297807693481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1938 -7.6066371984779835e-03</internalNodes>
+          <leafValues>
+            -1.3797719776630402e-01 7.6062493026256561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1939 -4.3096300214529037e-03</internalNodes>
+          <leafValues>
+            1.1195199936628342e-01 -3.2390709966421127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1940 -3.2239840365946293e-03</internalNodes>
+          <leafValues>
+            2.1420599520206451e-01 -5.8244630694389343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1941 8.3754826337099075e-03</internalNodes>
+          <leafValues>
+            4.7615598887205124e-02 -2.4216049909591675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1942 3.0904430896043777e-03</internalNodes>
+          <leafValues>
+            -9.0418681502342224e-02 9.9244832992553711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1943 9.8243616521358490e-03</internalNodes>
+          <leafValues>
+            -4.4643919914960861e-02 1.0423039644956589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1944 -3.2808810938149691e-03</internalNodes>
+          <leafValues>
+            -1.9123159348964691e-01 6.3141517341136932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1945 3.6370379384607077e-03</internalNodes>
+          <leafValues>
+            3.6944739520549774e-02 -1.1988619714975357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1946 7.8952945768833160e-03</internalNodes>
+          <leafValues>
+            -7.1313530206680298e-02 1.6107399761676788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1947 -3.3853040076792240e-03</internalNodes>
+          <leafValues>
+            -1.1704929918050766e-01 2.5579249486327171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1948 -2.6786550879478455e-03</internalNodes>
+          <leafValues>
+            -1.7064009606838226e-01 6.0627460479736328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1949 -4.5887688174843788e-03</internalNodes>
+          <leafValues>
+            3.4779790788888931e-02 -6.8817831575870514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1950 -6.1642300337553024e-02</internalNodes>
+          <leafValues>
+            5.1108109951019287e-01 -1.9752239808440208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1951 2.5235159322619438e-02</internalNodes>
+          <leafValues>
+            2.0203070715069771e-02 -3.4359911084175110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1952 -2.1312809549272060e-03</internalNodes>
+          <leafValues>
+            5.4698210209608078e-02 -1.6512370109558105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1953 -8.2598842680454254e-02</internalNodes>
+          <leafValues>
+            3.3804669976234436e-01 -2.8026569634675980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1954 -5.6678601540625095e-03</internalNodes>
+          <leafValues>
+            -3.3786231279373169e-01 2.9727049171924591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1955 -9.3317396938800812e-02</internalNodes>
+          <leafValues>
+            -6.7238032817840576e-01 2.0025020930916071e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1956 9.2052231775596738e-04</internalNodes>
+          <leafValues>
+            -1.3974259793758392e-01 6.3175596296787262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1957 5.1411538152024150e-04</internalNodes>
+          <leafValues>
+            -8.1585250794887543e-02 5.9324279427528381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1958 -6.7130490206182003e-03</internalNodes>
+          <leafValues>
+            -1.6645990312099457e-01 6.1560809612274170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1959 3.1578689813613892e-03</internalNodes>
+          <leafValues>
+            -1.0710070282220840e-01 6.6695116460323334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1960 1.2202030047774315e-02</internalNodes>
+          <leafValues>
+            -2.4845300242304802e-02 4.2458030581474304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1961 -2.8585169464349747e-02</internalNodes>
+          <leafValues>
+            2.3526839911937714e-01 -2.1121440455317497e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1962 2.3390499409288168e-03</internalNodes>
+          <leafValues>
+            6.4441107213497162e-02 -1.4063580334186554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1963 3.5900938510894775e-01</internalNodes>
+          <leafValues>
+            1.2122919782996178e-02 -7.3121142387390137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1964 7.6048658229410648e-03</internalNodes>
+          <leafValues>
+            -4.0700931102037430e-02 2.3581039905548096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1965 4.4263368472456932e-03</internalNodes>
+          <leafValues>
+            5.3039629012346268e-02 -1.5912020206451416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1966 8.5811351891607046e-04</internalNodes>
+          <leafValues>
+            -8.5265956819057465e-02 1.0489220172166824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1967 -4.2959367856383324e-03</internalNodes>
+          <leafValues>
+            -1.2851840257644653e-01 6.2752753496170044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1968 4.4881720095872879e-03</internalNodes>
+          <leafValues>
+            6.4671441912651062e-02 -1.8789650499820709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1969 -4.9869619309902191e-02</internalNodes>
+          <leafValues>
+            2.1496759355068207e-01 -3.5577021539211273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1970 -1.1942230165004730e-01</internalNodes>
+          <leafValues>
+            -6.7953938245773315e-01 1.5091570094227791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1971 6.2965508550405502e-04</internalNodes>
+          <leafValues>
+            -9.2145420610904694e-02 6.1806648969650269e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1972 2.9381969943642616e-03</internalNodes>
+          <leafValues>
+            1.7903240025043488e-01 -4.9355998635292053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1973 -2.2860679775476456e-02</internalNodes>
+          <leafValues>
+            2.0976249873638153e-01 -3.1370889395475388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1974 4.3369621038436890e-02</internalNodes>
+          <leafValues>
+            1.8286330625414848e-02 -5.1288998126983643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1975 1.9932509958744049e-01</internalNodes>
+          <leafValues>
+            6.7204708466306329e-04 -8.9769357442855835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1976 8.0751203000545502e-02</internalNodes>
+          <leafValues>
+            -2.0869649946689606e-02 4.3768700957298279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1977 1.5349129680544138e-03</internalNodes>
+          <leafValues>
+            3.6761760711669922e-02 -2.2203999757766724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1978 -3.6580949090421200e-03</internalNodes>
+          <leafValues>
+            -1.5471710264682770e-01 6.7229896783828735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1979 2.4743290618062019e-02</internalNodes>
+          <leafValues>
+            -5.5474709719419479e-02 1.7429579794406891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1980 -1.6451500356197357e-02</internalNodes>
+          <leafValues>
+            1.8817320466041565e-01 -5.5719010531902313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1981 -8.4505761042237282e-03</internalNodes>
+          <leafValues>
+            -3.2943668961524963e-01 2.2743720561265945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1982 2.9369179159402847e-02</internalNodes>
+          <leafValues>
+            1.5479310415685177e-02 -5.9099632501602173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1983 1.0524799674749374e-01</internalNodes>
+          <leafValues>
+            2.1177560556679964e-03 -4.9212720990180969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1984 -2.7816150337457657e-02</internalNodes>
+          <leafValues>
+            3.6421439051628113e-01 -2.5163119658827782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1985 5.3339339792728424e-03</internalNodes>
+          <leafValues>
+            -4.8402350395917892e-02 3.9851561188697815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1986 1.1682730168104172e-02</internalNodes>
+          <leafValues>
+            2.4898340925574303e-02 -3.5719999670982361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1987 8.9094992727041245e-03</internalNodes>
+          <leafValues>
+            4.6579260379076004e-02 -1.5088100731372833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1988 7.3203681968152523e-03</internalNodes>
+          <leafValues>
+            7.0891879498958588e-02 -1.3278549909591675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1989 -2.0311130210757256e-02</internalNodes>
+          <leafValues>
+            1.7783379554748535e-01 -3.7538051605224609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1990 1.3689160114154220e-03</internalNodes>
+          <leafValues>
+            -1.2096449732780457e-01 7.8017823398113251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1991 7.6994091272354126e-02</internalNodes>
+          <leafValues>
+            -8.7762605398893356e-03 3.2993561029434204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1992 8.8949268683791161e-03</internalNodes>
+          <leafValues>
+            -5.5553250014781952e-02 1.6372109949588776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1993 -1.8518440425395966e-02</internalNodes>
+          <leafValues>
+            -1.4479570090770721e-01 3.0250260606408119e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1994 -4.0174879133701324e-02</internalNodes>
+          <leafValues>
+            -2.4990509450435638e-01 4.0788788348436356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1995 6.5176486968994141e-02</internalNodes>
+          <leafValues>
+            -1.4393090270459652e-02 3.7707069516181946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1996 -1.4845930039882660e-02</internalNodes>
+          <leafValues>
+            2.7375608682632446e-01 -3.3898409456014633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1997 -6.1434650421142578e-01</internalNodes>
+          <leafValues>
+            -6.9167751073837280e-01 4.0905540809035301e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1998 1.4119890332221985e-01</internalNodes>
+          <leafValues>
+            1.6643870621919632e-02 -5.8944582939147949e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>157</maxWeakCount>
+      <stageThreshold>-1.5337220430374146e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1999 2.1962670609354973e-02</internalNodes>
+          <leafValues>
+            -3.0903491377830505e-01 2.1529789268970490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2000 5.1272530108690262e-02</internalNodes>
+          <leafValues>
+            -2.2286629676818848e-01 2.9869711399078369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2001 4.1870009154081345e-02</internalNodes>
+          <leafValues>
+            -2.7849119901657104e-01 2.0416070520877838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2002 6.7551871761679649e-03</internalNodes>
+          <leafValues>
+            -2.1988549828529358e-01 7.3887020349502563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2003 1.7311690375208855e-02</internalNodes>
+          <leafValues>
+            -3.4227430820465088e-01 1.3190160691738129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2004 1.5399109572172165e-02</internalNodes>
+          <leafValues>
+            -2.3149499297142029e-01 1.8828059732913971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2005 -1.0792730376124382e-02</internalNodes>
+          <leafValues>
+            -3.0813691020011902e-01 1.1191529780626297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2006 8.5879449034109712e-04</internalNodes>
+          <leafValues>
+            7.2238206863403320e-02 -4.4624349474906921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2007 9.2791311908513308e-04</internalNodes>
+          <leafValues>
+            -2.9247429966926575e-01 9.3132883310317993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2008 -8.5785696282982826e-03</internalNodes>
+          <leafValues>
+            2.0642790198326111e-01 -1.1203339695930481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2009 -1.8951490521430969e-02</internalNodes>
+          <leafValues>
+            -3.9317628741264343e-01 6.7260466516017914e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2010 3.4939948469400406e-02</internalNodes>
+          <leafValues>
+            2.8045989573001862e-02 -5.7410031557083130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2011 -4.2870659381151199e-02</internalNodes>
+          <leafValues>
+            -5.9856891632080078e-01 3.4607890993356705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2012 5.4958608234301209e-04</internalNodes>
+          <leafValues>
+            -4.1193041205406189e-01 6.7322418093681335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2013 2.2494920995086432e-03</internalNodes>
+          <leafValues>
+            1.3482889533042908e-01 -1.9777689874172211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2014 -9.2442613095045090e-03</internalNodes>
+          <leafValues>
+            -1.7850719392299652e-01 7.6734513044357300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2015 1.2210760032758117e-03</internalNodes>
+          <leafValues>
+            -3.4616300463676453e-01 7.5431950390338898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2016 1.3654090464115143e-02</internalNodes>
+          <leafValues>
+            7.7861636877059937e-02 -4.3963378667831421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2017 1.7332829535007477e-02</internalNodes>
+          <leafValues>
+            4.8317600041627884e-02 -4.1461798548698425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2018 -1.6807779669761658e-02</internalNodes>
+          <leafValues>
+            2.3211599886417389e-01 -8.2342058420181274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2019 3.2203171402215958e-02</internalNodes>
+          <leafValues>
+            3.4065268933773041e-02 -5.9796607494354248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2020 1.6777820885181427e-02</internalNodes>
+          <leafValues>
+            -5.9402968734502792e-02 1.6782909631729126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2021 1.3074859976768494e-02</internalNodes>
+          <leafValues>
+            -1.0592609643936157e-01 2.3796890676021576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2022 9.4082832336425781e-02</internalNodes>
+          <leafValues>
+            1.0573189705610275e-02 -5.3249269723892212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2023 -7.6036658138036728e-03</internalNodes>
+          <leafValues>
+            -2.3031429946422577e-01 1.0104469954967499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2024 8.2368071889504790e-04</internalNodes>
+          <leafValues>
+            4.6598970890045166e-02 -1.0087580233812332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2025 -7.6875449158251286e-03</internalNodes>
+          <leafValues>
+            -2.6123398542404175e-01 7.3543973267078400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2026 -3.3729180693626404e-02</internalNodes>
+          <leafValues>
+            2.1907149255275726e-01 -2.1958939731121063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2027 1.3204690068960190e-02</internalNodes>
+          <leafValues>
+            -1.4203189313411713e-01 1.5107029676437378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2028 8.5354369366541505e-04</internalNodes>
+          <leafValues>
+            -2.4303670227527618e-01 8.3283171057701111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2029 -1.4071330428123474e-02</internalNodes>
+          <leafValues>
+            -3.6977100372314453e-01 5.5142328143119812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2030 -1.1115919798612595e-02</internalNodes>
+          <leafValues>
+            -4.6575489640235901e-01 2.7285559102892876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2031 1.3858900405466557e-02</internalNodes>
+          <leafValues>
+            -9.1722346842288971e-02 1.9947899878025055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2032 8.5548251867294312e-02</internalNodes>
+          <leafValues>
+            2.6189789175987244e-02 -3.6603820323944092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2033 -1.9484929740428925e-02</internalNodes>
+          <leafValues>
+            1.7259980738162994e-01 -8.9445300400257111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2034 2.1631179377436638e-02</internalNodes>
+          <leafValues>
+            -5.6183289736509323e-02 6.7707277834415436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2035 1.9267840310931206e-02</internalNodes>
+          <leafValues>
+            5.5609680712223053e-02 -2.9480481147766113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2036 1.1855900287628174e-02</internalNodes>
+          <leafValues>
+            6.8580061197280884e-02 -2.7094689011573792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2037 1.7135039670392871e-03</internalNodes>
+          <leafValues>
+            -1.5590840578079224e-01 9.4477489590644836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2038 6.2993362545967102e-02</internalNodes>
+          <leafValues>
+            2.9042679816484451e-02 -2.5151410698890686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2039 1.7328880727291107e-02</internalNodes>
+          <leafValues>
+            -4.3562661856412888e-02 3.4017661213874817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2040 2.4053089320659637e-02</internalNodes>
+          <leafValues>
+            3.7450179457664490e-02 -2.8990021347999573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2041 2.1294029429554939e-02</internalNodes>
+          <leafValues>
+            4.8889711499214172e-02 -3.6390760540962219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2042 9.2860676348209381e-02</internalNodes>
+          <leafValues>
+            -3.6604419350624084e-02 3.2365238666534424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2043 2.1167730446904898e-03</internalNodes>
+          <leafValues>
+            8.7506070733070374e-02 -1.8339939415454865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2044 -8.7125040590763092e-02</internalNodes>
+          <leafValues>
+            -4.6162751317024231e-01 3.1342040747404099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2045 1.9298809766769409e-01</internalNodes>
+          <leafValues>
+            2.9041619971394539e-02 -4.4543629884719849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2046 -2.4475890313624404e-05</internalNodes>
+          <leafValues>
+            5.9352759271860123e-02 -2.0239880681037903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2047 -3.4894149750471115e-02</internalNodes>
+          <leafValues>
+            -4.5676550269126892e-01 3.5249751061201096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2048 1.9192209839820862e-01</internalNodes>
+          <leafValues>
+            -4.0733739733695984e-02 1.5444849431514740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2049 -2.3085139691829681e-02</internalNodes>
+          <leafValues>
+            7.1740321815013885e-02 -2.0493650436401367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2050 2.9535569250583649e-02</internalNodes>
+          <leafValues>
+            4.0762118995189667e-02 -3.6926439404487610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2051 -3.6492519080638885e-02</internalNodes>
+          <leafValues>
+            -5.4941332340240479e-01 2.5431329384446144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2052 4.0696229785680771e-02</internalNodes>
+          <leafValues>
+            1.0515309870243073e-02 -4.9906229972839355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2053 -3.6384560167789459e-02</internalNodes>
+          <leafValues>
+            -2.4736070632934570e-01 5.3187850862741470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2054 3.7000048905611038e-02</internalNodes>
+          <leafValues>
+            -4.6731691807508469e-02 3.0095300078392029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2055 3.7872981280088425e-02</internalNodes>
+          <leafValues>
+            4.5600850135087967e-02 -3.3789730072021484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2056 -1.6164340078830719e-02</internalNodes>
+          <leafValues>
+            1.9655610620975494e-01 -5.6567810475826263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2057 2.4253420531749725e-01</internalNodes>
+          <leafValues>
+            3.7772599607706070e-02 -3.6190840601921082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2058 -1.7429869621992111e-02</internalNodes>
+          <leafValues>
+            7.8519687056541443e-02 -1.9835950806736946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2059 1.4150669798254967e-02</internalNodes>
+          <leafValues>
+            -1.5143400430679321e-01 1.2028410285711288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2060 6.3771687448024750e-02</internalNodes>
+          <leafValues>
+            6.8969810381531715e-03 -8.0511492490768433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2061 1.1273720301687717e-03</internalNodes>
+          <leafValues>
+            -2.6931971311569214e-01 5.2550218999385834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2062 -3.8293499499559402e-02</internalNodes>
+          <leafValues>
+            2.0563830435276031e-01 -2.1474370732903481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2063 5.0103109329938889e-02</internalNodes>
+          <leafValues>
+            2.3352440446615219e-02 -5.4645192623138428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2064 -4.0057931095361710e-02</internalNodes>
+          <leafValues>
+            2.4553330242633820e-01 -3.3474709838628769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2065 1.8415290862321854e-02</internalNodes>
+          <leafValues>
+            -7.5977481901645660e-02 1.8510019779205322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2066 1.0548150166869164e-02</internalNodes>
+          <leafValues>
+            6.6050186753273010e-02 -6.4367741346359253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2067 7.3007687926292419e-02</internalNodes>
+          <leafValues>
+            -2.6471909135580063e-02 4.6508520841598511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2068 -3.4658040851354599e-02</internalNodes>
+          <leafValues>
+            2.7848151326179504e-01 -4.6662889420986176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2069 1.6924630850553513e-02</internalNodes>
+          <leafValues>
+            1.1554700136184692e-01 -1.1504360288381577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2070 -7.4245870113372803e-02</internalNodes>
+          <leafValues>
+            -4.3072721362113953e-01 1.6461249440908432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2071 -7.3406308889389038e-02</internalNodes>
+          <leafValues>
+            -5.6626558303833008e-01 2.3453989997506142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2072 1.2397419661283493e-01</internalNodes>
+          <leafValues>
+            -5.4616708308458328e-02 1.0024350136518478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2073 -1.6235560178756714e-02</internalNodes>
+          <leafValues>
+            -1.9912120699882507e-01 6.8537697196006775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2074 -3.0137969180941582e-02</internalNodes>
+          <leafValues>
+            -3.3398950099945068e-01 2.2806070744991302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2075 -8.1836536526679993e-02</internalNodes>
+          <leafValues>
+            4.0628650784492493e-01 -3.7828210741281509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2076 5.2240878343582153e-01</internalNodes>
+          <leafValues>
+            1.8094440922141075e-02 -4.3477010726928711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2077 1.4845579862594604e-02</internalNodes>
+          <leafValues>
+            -7.0279222726821899e-01 1.9977509975433350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2078 -5.5507790297269821e-02</internalNodes>
+          <leafValues>
+            5.1214778423309326e-01 -2.8097610920667648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2079 -2.7078049257397652e-02</internalNodes>
+          <leafValues>
+            3.0834761261940002e-01 -4.0676809847354889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2080 -2.4416339583694935e-03</internalNodes>
+          <leafValues>
+            -1.2054579704999924e-01 5.9857279062271118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2081 1.5043720602989197e-01</internalNodes>
+          <leafValues>
+            -6.0036379843950272e-02 2.2021989524364471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2082 -4.1030261665582657e-02</internalNodes>
+          <leafValues>
+            -3.3254709839820862e-01 2.5029130280017853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2083 1.4609499834477901e-02</internalNodes>
+          <leafValues>
+            5.1357660442590714e-02 -2.8190329670906067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2084 1.2588420510292053e-01</internalNodes>
+          <leafValues>
+            6.7158509045839310e-03 -4.9155730009078979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2085 -3.7784978747367859e-02</internalNodes>
+          <leafValues>
+            5.1675951480865479e-01 -2.7236010879278183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2086 -1.8090210855007172e-02</internalNodes>
+          <leafValues>
+            -3.5778409242630005e-01 3.5485059022903442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2087 -3.9881139993667603e-02</internalNodes>
+          <leafValues>
+            -4.8079541325569153e-01 2.7166770771145821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2088 7.3324372060596943e-03</internalNodes>
+          <leafValues>
+            -5.3297691047191620e-02 1.1757290363311768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2089 -6.9262558827176690e-04</internalNodes>
+          <leafValues>
+            -1.4501209557056427e-01 9.2885218560695648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2090 -8.2166977226734161e-02</internalNodes>
+          <leafValues>
+            2.3127609491348267e-01 -5.6990649551153183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2091 3.8556379731744528e-03</internalNodes>
+          <leafValues>
+            9.5330670475959778e-02 -1.5586289763450623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2092 -7.4245668947696686e-03</internalNodes>
+          <leafValues>
+            -2.7692940831184387e-01 3.5343449562788010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2093 2.2808350622653961e-02</internalNodes>
+          <leafValues>
+            4.6904660761356354e-02 -3.3659911155700684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2094 8.2916222512722015e-02</internalNodes>
+          <leafValues>
+            2.8655149508267641e-03 -5.2691662311553955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2095 -5.2402060478925705e-02</internalNodes>
+          <leafValues>
+            -6.9835901260375977e-01 1.8587840721011162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2096 1.5193739905953407e-02</internalNodes>
+          <leafValues>
+            -6.0126390308141708e-02 2.5917008519172668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2097 -1.4240809716284275e-02</internalNodes>
+          <leafValues>
+            2.7056190371513367e-01 -6.4629502594470978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2098 -3.2158840913325548e-03</internalNodes>
+          <leafValues>
+            -9.3549117445945740e-02 2.8090029954910278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2099 4.7198659740388393e-03</internalNodes>
+          <leafValues>
+            -1.8783959746360779e-01 7.1021787822246552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2100 -2.5415599346160889e-02</internalNodes>
+          <leafValues>
+            -3.3236810564994812e-01 4.0915489196777344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2101 4.2758490890264511e-02</internalNodes>
+          <leafValues>
+            2.6150930672883987e-02 -5.1128530502319336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2102 4.2231049388647079e-02</internalNodes>
+          <leafValues>
+            -2.1398520097136497e-02 1.7453899979591370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2103 -2.0674670115113258e-02</internalNodes>
+          <leafValues>
+            2.5898760557174683e-01 -5.6440889835357666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2104 2.8976969420909882e-02</internalNodes>
+          <leafValues>
+            -2.0763730630278587e-02 9.6909962594509125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2105 3.4173950552940369e-03</internalNodes>
+          <leafValues>
+            9.3572951853275299e-02 -1.5996080636978149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2106 6.7922919988632202e-02</internalNodes>
+          <leafValues>
+            1.6243519261479378e-02 -7.4624717235565186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2107 -9.0270619839429855e-03</internalNodes>
+          <leafValues>
+            3.3382698893547058e-01 -3.8774389773607254e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2108 -2.8317999094724655e-02</internalNodes>
+          <leafValues>
+            -3.6276119947433472e-01 2.3800129070878029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2109 -1.5302050160244107e-03</internalNodes>
+          <leafValues>
+            -1.8413589894771576e-01 7.0150263607501984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2110 8.4196459501981735e-03</internalNodes>
+          <leafValues>
+            9.0586692094802856e-02 -6.1134628951549530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2111 4.4346109032630920e-02</internalNodes>
+          <leafValues>
+            6.1388049274682999e-02 -2.1231949329376221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2112 2.5921100750565529e-02</internalNodes>
+          <leafValues>
+            -3.5028610378503799e-02 2.2107489407062531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2113 -6.0503371059894562e-03</internalNodes>
+          <leafValues>
+            -3.2179000973701477e-01 3.9333820343017578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2114 -2.5171019136905670e-02</internalNodes>
+          <leafValues>
+            6.9517672061920166e-01 -1.8360199406743050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2115 -5.2073050290346146e-02</internalNodes>
+          <leafValues>
+            -7.4727028608322144e-01 1.9030340015888214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2116 -1.3639439828693867e-02</internalNodes>
+          <leafValues>
+            -6.2003239989280701e-02 4.1589640080928802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2117 -3.8377299904823303e-02</internalNodes>
+          <leafValues>
+            3.8518410921096802e-01 -3.1509511172771454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2118 -1.4677719771862030e-01</internalNodes>
+          <leafValues>
+            -6.0099261999130249e-01 1.0989420115947723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2119 2.0508460700511932e-02</internalNodes>
+          <leafValues>
+            5.6464750319719315e-02 -2.5149369239807129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2120 2.3784590885043144e-02</internalNodes>
+          <leafValues>
+            5.8459620922803879e-02 -2.2233340144157410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2121 1.8658170476555824e-02</internalNodes>
+          <leafValues>
+            -7.3706217110157013e-02 1.8556639552116394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2122 -2.6653500273823738e-02</internalNodes>
+          <leafValues>
+            2.1061730384826660e-01 -6.8629503250122070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2123 -7.5975798070430756e-02</internalNodes>
+          <leafValues>
+            -4.8535370826721191e-01 2.7239590883255005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2124 5.3205721080303192e-02</internalNodes>
+          <leafValues>
+            5.1950141787528992e-03 -4.7940468788146973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2125 4.1206479072570801e-02</internalNodes>
+          <leafValues>
+            1.9166460260748863e-02 -6.4439648389816284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2126 2.2624490782618523e-02</internalNodes>
+          <leafValues>
+            1.7490459606051445e-02 -2.0645530521869659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2127 2.1147429943084717e-02</internalNodes>
+          <leafValues>
+            -3.2944951206445694e-02 3.5154509544372559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2128 1.3374770060181618e-02</internalNodes>
+          <leafValues>
+            4.0784850716590881e-02 -1.9725930690765381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2129 4.2831092141568661e-03</internalNodes>
+          <leafValues>
+            -8.5159152746200562e-02 1.4025710523128510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2130 6.3718900084495544e-02</internalNodes>
+          <leafValues>
+            -4.9198199994862080e-03 4.5491519570350647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2131 1.2082169763743877e-02</internalNodes>
+          <leafValues>
+            5.3176809102296829e-02 -2.6156601309776306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2132 1.8195409327745438e-02</internalNodes>
+          <leafValues>
+            -3.8999419659376144e-02 3.3412361145019531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2133 2.8948329389095306e-02</internalNodes>
+          <leafValues>
+            3.9750248193740845e-02 -3.4182530641555786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2134 -9.3633607029914856e-02</internalNodes>
+          <leafValues>
+            -9.4571298360824585e-01 3.0850030016154051e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2135 3.4850560128688812e-02</internalNodes>
+          <leafValues>
+            3.1342729926109314e-02 -3.5700461268424988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2136 1.2895749509334564e-01</internalNodes>
+          <leafValues>
+            -3.9653491228818893e-02 3.7412929534912109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2137 2.3297289386391640e-02</internalNodes>
+          <leafValues>
+            2.5941710919141769e-02 -4.7231191396713257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2138 1.5667669475078583e-02</internalNodes>
+          <leafValues>
+            -8.1445790827274323e-02 1.5750789642333984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2139 1.1425570119172335e-03</internalNodes>
+          <leafValues>
+            6.3901476562023163e-02 -2.0547799766063690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2140 -5.5744551122188568e-02</internalNodes>
+          <leafValues>
+            -3.4481841325759888e-01 1.1300710029900074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2141 -9.2509537935256958e-02</internalNodes>
+          <leafValues>
+            8.9074200391769409e-01 -1.5398530289530754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2142 -5.5660872021690011e-04</internalNodes>
+          <leafValues>
+            8.7056189775466919e-02 -5.1321998238563538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2143 -1.4538520015776157e-02</internalNodes>
+          <leafValues>
+            -4.5140060782432556e-01 2.8146119788289070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2144 -3.7515729665756226e-02</internalNodes>
+          <leafValues>
+            -7.3286539316177368e-01 6.7265569232404232e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2145 -1.5516959829255939e-03</internalNodes>
+          <leafValues>
+            9.1213479638099670e-02 -1.3395330309867859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2146 -9.5461420714855194e-02</internalNodes>
+          <leafValues>
+            -9.5529359579086304e-01 2.3820339702069759e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2147 -1.2917599640786648e-02</internalNodes>
+          <leafValues>
+            2.7040511369705200e-01 -4.6904701739549637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2148 7.9802395775914192e-03</internalNodes>
+          <leafValues>
+            5.5390980094671249e-02 -2.0667399466037750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2149 6.6025177948176861e-03</internalNodes>
+          <leafValues>
+            6.6448308527469635e-02 -1.9922210276126862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2150 1.7824679613113403e-02</internalNodes>
+          <leafValues>
+            -1.4532490074634552e-01 8.9904323220252991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2151 -2.3261539638042450e-02</internalNodes>
+          <leafValues>
+            4.8062869906425476e-01 -2.7084289118647575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2152 -5.3659449331462383e-03</internalNodes>
+          <leafValues>
+            -1.9143599271774292e-01 7.0398069918155670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2153 -2.0775340497493744e-02</internalNodes>
+          <leafValues>
+            1.6774240136146545e-01 -8.9455418288707733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2154 6.2107890844345093e-02</internalNodes>
+          <leafValues>
+            1.2815490365028381e-02 -6.4452892541885376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2155 -4.4327871873974800e-03</internalNodes>
+          <leafValues>
+            1.3405950367450714e-01 -1.0231850296258926e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>210</maxWeakCount>
+      <stageThreshold>-1.4604519605636597e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2156 -4.6693067997694016e-03</internalNodes>
+          <leafValues>
+            1.4297600090503693e-01 -3.5293748974800110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2157 -5.8510829694569111e-04</internalNodes>
+          <leafValues>
+            -2.2447289526462555e-01 7.3556646704673767e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2158 -3.4788011107593775e-03</internalNodes>
+          <leafValues>
+            1.0603249818086624e-01 -2.5625610351562500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2159 6.2952568987384439e-04</internalNodes>
+          <leafValues>
+            4.1076458990573883e-02 -3.6061421036720276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2160 2.1010650380048901e-04</internalNodes>
+          <leafValues>
+            -2.4425220489501953e-01 1.0942090302705765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2161 -2.6671579107642174e-03</internalNodes>
+          <leafValues>
+            8.4581501781940460e-02 -2.7449008822441101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2162 7.1533219888806343e-03</internalNodes>
+          <leafValues>
+            -1.2603819370269775e-01 2.0079800486564636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2163 -2.3616119287908077e-03</internalNodes>
+          <leafValues>
+            1.6627199947834015e-01 -1.3186289370059967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2164 3.9599660784006119e-02</internalNodes>
+          <leafValues>
+            5.5119238793849945e-02 -3.4003400802612305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2165 1.9385309424251318e-03</internalNodes>
+          <leafValues>
+            -2.0686650276184082e-01 1.0400419682264328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2166 4.3686539866030216e-03</internalNodes>
+          <leafValues>
+            6.4766593277454376e-02 -2.7426311373710632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2167 -3.9834968629293144e-04</internalNodes>
+          <leafValues>
+            5.2820999175310135e-02 -2.2684779763221741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2168 -5.2277399227023125e-03</internalNodes>
+          <leafValues>
+            -2.5515750050544739e-01 7.6405368745326996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2169 -1.0445619933307171e-02</internalNodes>
+          <leafValues>
+            1.3513970375061035e-01 -5.0032071769237518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2170 -2.0478919614106417e-03</internalNodes>
+          <leafValues>
+            -2.7669870853424072e-01 5.4732039570808411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2171 9.1795288026332855e-03</internalNodes>
+          <leafValues>
+            -1.2642470002174377e-01 1.9979229569435120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2172 9.4128772616386414e-04</internalNodes>
+          <leafValues>
+            -4.0286481380462646e-01 3.8918491452932358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2173 -4.0410319343209267e-03</internalNodes>
+          <leafValues>
+            -2.0108319818973541e-01 5.1456429064273834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2174 -1.2742569670081139e-02</internalNodes>
+          <leafValues>
+            2.2716869413852692e-01 -6.8204790353775024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2175 -4.6246009878814220e-03</internalNodes>
+          <leafValues>
+            -2.5854289531707764e-01 7.8878343105316162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2176 -6.4845927990972996e-03</internalNodes>
+          <leafValues>
+            -3.1391140818595886e-01 7.1605153381824493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2177 -4.8291690647602081e-02</internalNodes>
+          <leafValues>
+            2.5488480925559998e-01 -2.1891580894589424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2178 8.4315962158143520e-04</internalNodes>
+          <leafValues>
+            -1.6529269516468048e-01 8.9575611054897308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2179 -1.0773389786481857e-01</internalNodes>
+          <leafValues>
+            -6.0115939378738403e-01 3.3779250225052238e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2180 -4.5969419181346893e-02</internalNodes>
+          <leafValues>
+            3.6489740014076233e-01 -3.9942290633916855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2181 -1.6649639233946800e-02</internalNodes>
+          <leafValues>
+            -1.1858119815587997e-01 1.0585139691829681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2182 -1.4521550387144089e-02</internalNodes>
+          <leafValues>
+            -3.7954211235046387e-01 3.4867148846387863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2183 1.3591590104624629e-03</internalNodes>
+          <leafValues>
+            -2.3180609941482544e-01 5.0401471555233002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2184 -5.8343587443232536e-04</internalNodes>
+          <leafValues>
+            -2.8496581315994263e-01 4.0894281119108200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2185 7.9833306372165680e-03</internalNodes>
+          <leafValues>
+            -3.6992359906435013e-02 1.6985300183296204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2186 9.9762203171849251e-04</internalNodes>
+          <leafValues>
+            6.4871042966842651e-02 -1.8648339807987213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2187 -4.6869087964296341e-03</internalNodes>
+          <leafValues>
+            7.6987423002719879e-02 -8.1482626497745514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2188 3.0047740787267685e-02</internalNodes>
+          <leafValues>
+            -2.9839929193258286e-02 4.3676841259002686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2189 1.8069539219141006e-02</internalNodes>
+          <leafValues>
+            2.7509700506925583e-02 -4.2724269628524780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2190 -1.5088430047035217e-01</internalNodes>
+          <leafValues>
+            -6.7918521165847778e-01 1.8012860789895058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2191 -2.5836290791630745e-02</internalNodes>
+          <leafValues>
+            2.5797989964485168e-01 -3.5906858742237091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2192 1.8183529376983643e-02</internalNodes>
+          <leafValues>
+            3.5895019769668579e-02 -3.7197691202163696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2193 6.3127309083938599e-02</internalNodes>
+          <leafValues>
+            -7.3392972350120544e-02 1.2563429772853851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2194 -6.6507689189165831e-04</internalNodes>
+          <leafValues>
+            8.5442617535591125e-02 -1.5228550136089325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2195 1.0104980319738388e-02</internalNodes>
+          <leafValues>
+            3.4569118171930313e-02 -2.2657699882984161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2196 -1.2355949729681015e-02</internalNodes>
+          <leafValues>
+            1.5785010159015656e-01 -7.4710778892040253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2197 1.5728179365396500e-02</internalNodes>
+          <leafValues>
+            6.8844422698020935e-02 -1.6961769759654999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2198 1.5084549886523746e-05</internalNodes>
+          <leafValues>
+            -1.3695539534091949e-01 9.0837597846984863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2199 2.9634479433298111e-02</internalNodes>
+          <leafValues>
+            4.9822349101305008e-02 -2.6809689402580261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2200 2.8015200048685074e-02</internalNodes>
+          <leafValues>
+            -8.1799760460853577e-02 1.7842799425125122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2201 2.3299450986087322e-03</internalNodes>
+          <leafValues>
+            6.9535210728645325e-02 -1.8205040693283081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2202 1.3453120365738869e-02</internalNodes>
+          <leafValues>
+            -7.0231497287750244e-02 1.8492579460144043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2203 1.4049040153622627e-02</internalNodes>
+          <leafValues>
+            7.6328299939632416e-02 -1.7219689488410950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2204 -1.4648989774286747e-02</internalNodes>
+          <leafValues>
+            3.4281060099601746e-01 -4.3134819716215134e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2205 1.4879769878461957e-04</internalNodes>
+          <leafValues>
+            -2.7614209055900574e-01 7.3140732944011688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2206 -6.8892319686710835e-03</internalNodes>
+          <leafValues>
+            -1.8386749923229218e-01 6.5872021019458771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2207 1.2898260029032826e-03</internalNodes>
+          <leafValues>
+            -1.1688020080327988e-01 1.1173330247402191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2208 -2.5763860321603715e-04</internalNodes>
+          <leafValues>
+            8.9391976594924927e-02 -1.4183540642261505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2209 1.3652349822223186e-02</internalNodes>
+          <leafValues>
+            2.5085829198360443e-02 -1.7959770560264587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2210 -5.7484027929604053e-03</internalNodes>
+          <leafValues>
+            1.6128179430961609e-01 -7.9023167490959167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2211 -1.1682719923555851e-02</internalNodes>
+          <leafValues>
+            -1.8493950366973877e-01 4.5419961214065552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2212 2.7498970739543438e-03</internalNodes>
+          <leafValues>
+            -6.5800942480564117e-02 1.9426700472831726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2213 -1.1797569459304214e-03</internalNodes>
+          <leafValues>
+            5.3563870489597321e-02 -5.5225171148777008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2214 -3.7005849182605743e-02</internalNodes>
+          <leafValues>
+            -5.1369887590408325e-01 2.4779239669442177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2215 2.3432020097970963e-02</internalNodes>
+          <leafValues>
+            1.4517559669911861e-02 -3.2621389627456665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2216 -2.4803660809993744e-02</internalNodes>
+          <leafValues>
+            4.1374489665031433e-01 -3.1516589224338531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2217 -9.1133005917072296e-03</internalNodes>
+          <leafValues>
+            -2.3262369632720947e-01 6.5307170152664185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2218 -7.2223007678985596e-02</internalNodes>
+          <leafValues>
+            3.1365010142326355e-01 -4.0287811309099197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2219 6.4163007773458958e-03</internalNodes>
+          <leafValues>
+            4.4151920825242996e-02 -1.4439010620117188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2220 5.4361939430236816e-02</internalNodes>
+          <leafValues>
+            -4.9821659922599792e-02 2.6239651441574097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2221 -5.9238062240183353e-03</internalNodes>
+          <leafValues>
+            7.4054516851902008e-02 -7.2215773165225983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2222 -3.4175089094787836e-03</internalNodes>
+          <leafValues>
+            -3.0714958906173706e-01 3.9461899548768997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2223 1.1367879807949066e-02</internalNodes>
+          <leafValues>
+            -4.8698928207159042e-02 1.0077890008687973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2224 2.3361030034720898e-03</internalNodes>
+          <leafValues>
+            4.9539480358362198e-02 -2.3815050721168518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2225 -7.2044372791424394e-04</internalNodes>
+          <leafValues>
+            9.6084482967853546e-02 -9.8123528063297272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2226 -3.4777939436025918e-04</internalNodes>
+          <leafValues>
+            1.0546120256185532e-01 -1.0600890219211578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2227 -6.6456091590225697e-03</internalNodes>
+          <leafValues>
+            -1.7471200227737427e-01 4.7264128923416138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2228 4.4261440634727478e-02</internalNodes>
+          <leafValues>
+            -4.0742669254541397e-02 2.8637731075286865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2229 3.4959740936756134e-02</internalNodes>
+          <leafValues>
+            1.3479149900376797e-02 -4.4233149290084839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2230 -2.5971820577979088e-02</internalNodes>
+          <leafValues>
+            -4.6334660053253174e-01 2.5301979854702950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2231 1.8818200333043933e-03</internalNodes>
+          <leafValues>
+            -7.2344467043876648e-02 1.5579940378665924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2232 3.2623678445816040e-02</internalNodes>
+          <leafValues>
+            1.8171060830354691e-02 -6.3472539186477661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2233 1.5041300095617771e-02</internalNodes>
+          <leafValues>
+            -5.3582038730382919e-02 1.8320439755916595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2234 -5.5875489488244057e-03</internalNodes>
+          <leafValues>
+            1.5442819893360138e-01 -6.9521442055702209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2235 3.9029030594974756e-03</internalNodes>
+          <leafValues>
+            7.2893843054771423e-02 -1.3542290031909943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2236 4.5964889228343964e-02</internalNodes>
+          <leafValues>
+            2.1482560783624649e-02 -5.4532879590988159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2237 -7.4338473379611969e-02</internalNodes>
+          <leafValues>
+            -7.1795612573623657e-01 3.5341270267963409e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2238 2.0902850665152073e-03</internalNodes>
+          <leafValues>
+            4.3308760970830917e-02 -2.5078159570693970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2239 -7.5608417391777039e-02</internalNodes>
+          <leafValues>
+            2.7488818764686584e-01 -3.4967329353094101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2240 5.1200888119637966e-03</internalNodes>
+          <leafValues>
+            4.7384329140186310e-02 -2.6794269680976868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2241 -2.0140670239925385e-02</internalNodes>
+          <leafValues>
+            7.2039432823657990e-02 -4.4537059962749481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2242 2.6719279587268829e-02</internalNodes>
+          <leafValues>
+            -6.0671631246805191e-02 2.4019980430603027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2243 -2.3299809545278549e-03</internalNodes>
+          <leafValues>
+            -1.4848700165748596e-01 6.3779368996620178e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2244 1.4248250052332878e-02</internalNodes>
+          <leafValues>
+            3.9471931755542755e-02 -2.7790299057960510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2245 -6.8691447377204895e-02</internalNodes>
+          <leafValues>
+            3.1307551264762878e-01 -2.2111769765615463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2246 -6.5213128924369812e-02</internalNodes>
+          <leafValues>
+            3.6191588640213013e-01 -3.1089780852198601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2247 -1.4469860121607780e-02</internalNodes>
+          <leafValues>
+            -1.9942939281463623e-01 2.6489760726690292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2248 -9.4575136899948120e-03</internalNodes>
+          <leafValues>
+            -2.9698899388313293e-01 3.6693658679723740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2249 -1.8222700059413910e-01</internalNodes>
+          <leafValues>
+            -4.0887731313705444e-01 7.3904348537325859e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2250 -2.3991869390010834e-01</internalNodes>
+          <leafValues>
+            -9.5519691705703735e-01 1.0895749554038048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2251 -1.4964600093662739e-02</internalNodes>
+          <leafValues>
+            1.3325509428977966e-01 -6.4146116375923157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2252 1.1056339740753174e-01</internalNodes>
+          <leafValues>
+            -2.1147079765796661e-02 5.2262008190155029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2253 -1.1857460252940655e-02</internalNodes>
+          <leafValues>
+            -2.6103261113166809e-01 2.4917129427194595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2254 1.7032399773597717e-02</internalNodes>
+          <leafValues>
+            -4.2655009776353836e-02 2.4324589967727661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2255 -6.6315201111137867e-03</internalNodes>
+          <leafValues>
+            -2.7996608614921570e-01 4.7972209751605988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2256 -1.3527619885280728e-03</internalNodes>
+          <leafValues>
+            -1.7117640376091003e-01 6.8423986434936523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2257 5.8159399777650833e-02</internalNodes>
+          <leafValues>
+            1.4452300034463406e-02 -3.6640700697898865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2258 9.6522513777017593e-03</internalNodes>
+          <leafValues>
+            6.4102686941623688e-02 -1.9386090338230133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2259 4.6681659296154976e-03</internalNodes>
+          <leafValues>
+            -6.4305387437343597e-02 1.2191460281610489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2260 4.8228199593722820e-03</internalNodes>
+          <leafValues>
+            4.2306859046220779e-02 -2.5486230850219727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2261 7.2615491226315498e-03</internalNodes>
+          <leafValues>
+            -4.4169031083583832e-02 1.9888080656528473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2262 2.7650638949126005e-03</internalNodes>
+          <leafValues>
+            5.6748721748590469e-02 -1.8802900612354279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2263 -1.2599739711731672e-03</internalNodes>
+          <leafValues>
+            2.9681721329689026e-01 -3.0795339494943619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2264 -1.4079749584197998e-02</internalNodes>
+          <leafValues>
+            1.2790699303150177e-01 -7.7078782021999359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2265 4.1978028602898121e-03</internalNodes>
+          <leafValues>
+            -3.2651171088218689e-02 4.4282011687755585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2266 7.4891891563311219e-04</internalNodes>
+          <leafValues>
+            -1.1801239848136902e-01 1.0196279734373093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2267 3.9699498564004898e-02</internalNodes>
+          <leafValues>
+            1.6263889148831367e-02 -3.2391819357872009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2268 2.9685199260711670e-03</internalNodes>
+          <leafValues>
+            5.0729360431432724e-02 -2.2522340714931488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2269 3.0207540839910507e-03</internalNodes>
+          <leafValues>
+            -6.4312063157558441e-02 6.3618481159210205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2270 -1.0064570233225822e-03</internalNodes>
+          <leafValues>
+            -2.2469790279865265e-01 4.3256420642137527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2271 1.6607339493930340e-03</internalNodes>
+          <leafValues>
+            -5.8126531541347504e-02 5.9540931135416031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2272 4.9640638753771782e-03</internalNodes>
+          <leafValues>
+            -4.8804368823766708e-02 1.8437810242176056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2273 1.7194069921970367e-01</internalNodes>
+          <leafValues>
+            3.6377978976815939e-03 -1.0000029802322388e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2274 -2.0992290228605270e-03</internalNodes>
+          <leafValues>
+            1.1951360106468201e-01 -8.8613957166671753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2275 -4.0529989637434483e-03</internalNodes>
+          <leafValues>
+            -2.0199899375438690e-01 5.3564589470624924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2276 1.5536800492554903e-03</internalNodes>
+          <leafValues>
+            -9.6797212958335876e-02 9.5135137438774109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2277 2.2837040014564991e-03</internalNodes>
+          <leafValues>
+            -4.5535419136285782e-02 1.4682759344577789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2278 -1.0094629600644112e-02</internalNodes>
+          <leafValues>
+            -1.8853099644184113e-01 4.8864368349313736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2279 -7.0200799964368343e-03</internalNodes>
+          <leafValues>
+            1.4628750085830688e-01 -4.2158648371696472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2280 3.4074939321726561e-03</internalNodes>
+          <leafValues>
+            -7.7149718999862671e-02 1.3702009618282318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2281 3.9907437749207020e-03</internalNodes>
+          <leafValues>
+            -6.4178831875324249e-02 8.5484616458415985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2282 2.0611559972167015e-02</internalNodes>
+          <leafValues>
+            3.7988938391208649e-02 -2.9359170794487000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2283 -1.9768020138144493e-03</internalNodes>
+          <leafValues>
+            6.0499001294374466e-02 -1.6910280287265778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2284 -2.4783300235867500e-02</internalNodes>
+          <leafValues>
+            -5.5052608251571655e-01 1.5831759199500084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2285 -1.5710920095443726e-02</internalNodes>
+          <leafValues>
+            1.9716830551624298e-01 -3.1884010881185532e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2286 1.0070169810205698e-03</internalNodes>
+          <leafValues>
+            4.6532750129699707e-02 -2.1853099763393402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2287 -3.7466569337993860e-03</internalNodes>
+          <leafValues>
+            -2.5379389524459839e-01 3.9463929831981659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2288 4.5849520713090897e-02</internalNodes>
+          <leafValues>
+            1.3636340387165546e-02 -6.2976127862930298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2289 -1.1040110141038895e-02</internalNodes>
+          <leafValues>
+            2.4939639866352081e-01 -3.8895469158887863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2290 -4.2415689677000046e-03</internalNodes>
+          <leafValues>
+            -2.1564769744873047e-01 4.5613430440425873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2291 -3.1175611075013876e-03</internalNodes>
+          <leafValues>
+            1.0641460120677948e-01 -1.2268310040235519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2292 -2.3725910577923059e-03</internalNodes>
+          <leafValues>
+            2.0573639869689941e-01 -6.6338561475276947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2293 -3.6906299646943808e-03</internalNodes>
+          <leafValues>
+            -1.5802620351314545e-01 6.6760621964931488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2294 1.0908120311796665e-03</internalNodes>
+          <leafValues>
+            -1.7830020189285278e-01 5.7181321084499359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2295 -1.3929420150816441e-02</internalNodes>
+          <leafValues>
+            -1.4185859262943268e-01 5.8131370693445206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2296 -2.8283370658755302e-02</internalNodes>
+          <leafValues>
+            2.6451000571250916e-01 -4.5332599431276321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2297 -3.9213709533214569e-04</internalNodes>
+          <leafValues>
+            7.6039716601371765e-02 -8.4666326642036438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2298 -2.0424809772521257e-03</internalNodes>
+          <leafValues>
+            -1.6393850743770599e-01 5.7595171034336090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2299 -6.0634050518274307e-02</internalNodes>
+          <leafValues>
+            2.4343550205230713e-01 -1.3630810193717480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2300 5.5472988635301590e-02</internalNodes>
+          <leafValues>
+            1.2274630367755890e-02 -7.6161897182464600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2301 2.6451710611581802e-02</internalNodes>
+          <leafValues>
+            -1.6103159636259079e-02 1.4696520566940308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2302 -6.5615847706794739e-02</internalNodes>
+          <leafValues>
+            -6.6936880350112915e-01 1.2788389809429646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2303 -2.9287360608577728e-02</internalNodes>
+          <leafValues>
+            3.8422039151191711e-01 -2.0979570224881172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2304 -8.7814256548881531e-02</internalNodes>
+          <leafValues>
+            -5.5386292934417725e-01 1.6540929675102234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2305 4.0213011205196381e-02</internalNodes>
+          <leafValues>
+            5.5229798890650272e-03 -1.5169410407543182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2306 7.5501110404729843e-03</internalNodes>
+          <leafValues>
+            -5.3081061691045761e-02 1.6791249811649323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2307 7.5557199306786060e-03</internalNodes>
+          <leafValues>
+            4.9213249236345291e-02 -1.8097420036792755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2308 4.2264759540557861e-02</internalNodes>
+          <leafValues>
+            9.8954448476433754e-03 -8.7265938520431519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2309 -1.5821179375052452e-02</internalNodes>
+          <leafValues>
+            -4.9515271186828613e-01 1.0424910113215446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2310 4.4557699002325535e-03</internalNodes>
+          <leafValues>
+            -5.2823610603809357e-02 1.7409110069274902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2311 -6.3567152246832848e-03</internalNodes>
+          <leafValues>
+            1.0278800129890442e-01 -9.4062283635139465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2312 2.1308339200913906e-03</internalNodes>
+          <leafValues>
+            -5.7343449443578720e-02 1.5747800469398499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2313 6.4157308079302311e-03</internalNodes>
+          <leafValues>
+            4.1112188249826431e-02 -2.6482531428337097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2314 -1.0572739690542221e-01</internalNodes>
+          <leafValues>
+            -9.2719399929046631e-01 8.6396038532257080e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2315 6.1298489570617676e-02</internalNodes>
+          <leafValues>
+            1.1242480017244816e-02 -5.2976250648498535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2316 1.0018650442361832e-02</internalNodes>
+          <leafValues>
+            -6.1801191419363022e-02 1.5441860258579254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2317 2.3613891098648310e-03</internalNodes>
+          <leafValues>
+            -3.9282340556383133e-02 8.8061779737472534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2318 -4.7975129564292729e-04</internalNodes>
+          <leafValues>
+            -1.0663200169801712e-01 8.3887517452239990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2319 7.3982410132884979e-02</internalNodes>
+          <leafValues>
+            4.7058681957423687e-03 -6.0129082202911377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2320 6.3821911811828613e-02</internalNodes>
+          <leafValues>
+            1.1372390203177929e-02 -7.4044847488403320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2321 4.6818208647891879e-04</internalNodes>
+          <leafValues>
+            -7.6545506715774536e-02 5.3563810884952545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2322 4.3877989053726196e-01</internalNodes>
+          <leafValues>
+            1.2420959770679474e-02 -6.8776041269302368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2323 2.8831470757722855e-02</internalNodes>
+          <leafValues>
+            1.5150110237300396e-02 -1.3229629397392273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2324 6.7726813256740570e-02</internalNodes>
+          <leafValues>
+            -1.8901329487562180e-02 4.8799818754196167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2325 9.5125466585159302e-02</internalNodes>
+          <leafValues>
+            1.2518660165369511e-02 -7.4607741832733154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2326 3.4629011061042547e-03</internalNodes>
+          <leafValues>
+            -6.4396522939205170e-02 1.3450330495834351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2327 -1.0220340453088284e-02</internalNodes>
+          <leafValues>
+            -1.2102399766445160e-01 3.5081598907709122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2328 -2.5227791070938110e-01</internalNodes>
+          <leafValues>
+            5.3186398744583130e-01 -1.7373610287904739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2329 4.7006108798086643e-03</internalNodes>
+          <leafValues>
+            2.6264479383826256e-02 -1.6305670142173767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2330 8.0487072467803955e-02</internalNodes>
+          <leafValues>
+            -1.1193430051207542e-02 7.3598998785018921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2331 -3.8025099784135818e-03</internalNodes>
+          <leafValues>
+            -1.1756920069456100e-01 6.4899243414402008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2332 -5.1970399916172028e-02</internalNodes>
+          <leafValues>
+            2.1764869987964630e-01 -4.6299580484628677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2333 -1.2381119653582573e-02</internalNodes>
+          <leafValues>
+            -1.3483320176601410e-01 7.0956252515316010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2334 4.6567008830606937e-03</internalNodes>
+          <leafValues>
+            8.4818847477436066e-02 -1.0850810259580612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2335 2.4520549923181534e-02</internalNodes>
+          <leafValues>
+            -5.6512400507926941e-02 2.0845490694046021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2336 -6.0728159733116627e-03</internalNodes>
+          <leafValues>
+            1.0253319889307022e-01 -1.0739710181951523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2337 1.3803950278088450e-03</internalNodes>
+          <leafValues>
+            -1.2355019897222519e-01 3.8523931056261063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2338 8.3129312843084335e-03</internalNodes>
+          <leafValues>
+            5.0441969186067581e-02 -1.7901860177516937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2339 6.8436772562563419e-04</internalNodes>
+          <leafValues>
+            -6.1334688216447830e-02 4.9543838948011398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2340 7.1589440107345581e-02</internalNodes>
+          <leafValues>
+            1.1258729733526707e-02 -7.2902548313140869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2341 -3.9251110865734518e-04</internalNodes>
+          <leafValues>
+            -2.9022648930549622e-01 1.3908719643950462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2342 -1.6948020085692406e-02</internalNodes>
+          <leafValues>
+            1.4616020023822784e-01 -5.6298948824405670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2343 2.3180670104920864e-03</internalNodes>
+          <leafValues>
+            2.0289139449596405e-01 -4.3649390339851379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2344 7.9764174297451973e-03</internalNodes>
+          <leafValues>
+            -4.8768021166324615e-02 1.8070909380912781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2345 -1.1533150449395180e-02</internalNodes>
+          <leafValues>
+            -1.4238800108432770e-01 5.6691840291023254e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2346 -5.4723728680983186e-04</internalNodes>
+          <leafValues>
+            -2.3844610154628754e-01 3.2061301171779633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2347 -1.1751300189644098e-03</internalNodes>
+          <leafValues>
+            2.5394979864358902e-02 -8.9872613549232483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2348 1.3655239716172218e-02</internalNodes>
+          <leafValues>
+            -2.7230219915509224e-02 3.3419778943061829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2349 4.1803810745477676e-03</internalNodes>
+          <leafValues>
+            2.6914540678262711e-02 -1.2557040154933929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2350 3.1565671088173985e-04</internalNodes>
+          <leafValues>
+            6.2177520245313644e-02 -1.3345809280872345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2351 7.4048307724297047e-03</internalNodes>
+          <leafValues>
+            3.1548298895359039e-02 -2.8247129917144775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2352 -1.3977429829537868e-02</internalNodes>
+          <leafValues>
+            1.2342610210180283e-01 -8.0493018031120300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2353 -1.4240520074963570e-02</internalNodes>
+          <leafValues>
+            -2.3979499936103821e-01 1.8016669899225235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2354 -2.2901569306850433e-01</internalNodes>
+          <leafValues>
+            -4.2895668745040894e-01 2.0032370463013649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2355 2.6522560045123100e-02</internalNodes>
+          <leafValues>
+            -2.9899509623646736e-02 3.1195539236068726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2356 5.0723659805953503e-03</internalNodes>
+          <leafValues>
+            6.2117800116539001e-02 -1.5442310273647308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2357 2.2340700961649418e-03</internalNodes>
+          <leafValues>
+            3.0717259272933006e-02 -1.4656220376491547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2358 -4.6348381787538528e-02</internalNodes>
+          <leafValues>
+            -6.7844080924987793e-01 1.2258620001375675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2359 -3.0467000324279070e-03</internalNodes>
+          <leafValues>
+            1.0547509789466858e-01 -5.4426789283752441e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2360 7.0065702311694622e-03</internalNodes>
+          <leafValues>
+            -5.2537959069013596e-02 2.4259300529956818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2361 -2.7783720288425684e-03</internalNodes>
+          <leafValues>
+            -1.0732100158929825e-01 7.4064619839191437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2362 -4.2294961167499423e-04</internalNodes>
+          <leafValues>
+            6.8151466548442841e-02 -1.4117160439491272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2363 -8.7614007294178009e-02</internalNodes>
+          <leafValues>
+            -6.5271192789077759e-01 3.3460480626672506e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2364 1.2552930042147636e-02</internalNodes>
+          <leafValues>
+            3.3235169947147369e-02 -2.6571980118751526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2365 -2.1863510832190514e-02</internalNodes>
+          <leafValues>
+            1.5599909424781799e-01 -3.7561919540166855e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>189</maxWeakCount>
+      <stageThreshold>-1.6477719545364380e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2366 1.9715659320354462e-02</internalNodes>
+          <leafValues>
+            -4.0786159038543701e-01 1.6317300498485565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2367 4.9977540969848633e-02</internalNodes>
+          <leafValues>
+            -2.5753161311149597e-01 2.3471170663833618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2368 3.4774339292198420e-04</internalNodes>
+          <leafValues>
+            -2.7148011326789856e-01 1.5202049911022186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2369 8.2787703722715378e-03</internalNodes>
+          <leafValues>
+            8.6229562759399414e-02 -4.2272651195526123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2370 1.2891810387372971e-02</internalNodes>
+          <leafValues>
+            -2.7589491009712219e-01 9.9677331745624542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2371 -5.2444688044488430e-03</internalNodes>
+          <leafValues>
+            1.4687310159206390e-01 -1.8090559542179108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2372 4.7363140038214624e-04</internalNodes>
+          <leafValues>
+            1.1544570326805115e-01 -2.3242090642452240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2373 1.0767930187284946e-02</internalNodes>
+          <leafValues>
+            -2.3256160318851471e-01 5.7885929942131042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2374 -2.0576089154928923e-03</internalNodes>
+          <leafValues>
+            -4.0554818511009216e-01 6.1086129397153854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2375 1.2648279964923859e-01</internalNodes>
+          <leafValues>
+            2.5926080998033285e-03 -6.0955828428268433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2376 2.2029090672731400e-02</internalNodes>
+          <leafValues>
+            -2.3835970461368561e-01 1.1523839831352234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2377 8.6279091192409396e-04</internalNodes>
+          <leafValues>
+            -2.4382559955120087e-01 4.8174999654293060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2378 6.1232252046465874e-03</internalNodes>
+          <leafValues>
+            -3.3293130993843079e-01 7.3860548436641693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2379 1.8321570241823792e-03</internalNodes>
+          <leafValues>
+            7.4964806437492371e-02 -3.6050680279731750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2380 1.3176959939301014e-02</internalNodes>
+          <leafValues>
+            7.8650407493114471e-02 -3.0009350180625916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2381 -1.5092800371348858e-02</internalNodes>
+          <leafValues>
+            -4.5663359761238098e-01 4.5359719544649124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2382 -3.9765550754964352e-03</internalNodes>
+          <leafValues>
+            -3.7404119968414307e-01 5.7276591658592224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2383 -1.2558099813759327e-02</internalNodes>
+          <leafValues>
+            1.8079389631748199e-01 -9.0798392891883850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2384 1.1346530169248581e-02</internalNodes>
+          <leafValues>
+            6.7842416465282440e-02 -3.3354648947715759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2385 3.0938379932194948e-03</internalNodes>
+          <leafValues>
+            -6.4362257719039917e-02 1.6250990331172943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2386 -7.9837916418910027e-03</internalNodes>
+          <leafValues>
+            -2.8237259387969971e-01 6.4243227243423462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2387 5.3257539868354797e-02</internalNodes>
+          <leafValues>
+            -1.1842279881238937e-01 1.5403720736503601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2388 -3.2308440655469894e-02</internalNodes>
+          <leafValues>
+            -3.8174659013748169e-01 4.6444781124591827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2389 7.4837519787251949e-03</internalNodes>
+          <leafValues>
+            1.0087630152702332e-01 -1.7848369479179382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2390 1.4075540006160736e-02</internalNodes>
+          <leafValues>
+            -1.3612699508666992e-01 1.2589199841022491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2391 1.1945860460400581e-02</internalNodes>
+          <leafValues>
+            -4.6452131122350693e-02 3.1823348999023438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2392 4.9774140119552612e-02</internalNodes>
+          <leafValues>
+            3.7373390048742294e-02 -4.3919241428375244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2393 1.1070669861510396e-03</internalNodes>
+          <leafValues>
+            3.3163610845804214e-02 -1.8855419754981995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2394 -2.8594989329576492e-02</internalNodes>
+          <leafValues>
+            -3.6906918883323669e-01 4.1930228471755981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2395 -7.6013091020286083e-03</internalNodes>
+          <leafValues>
+            5.2191480994224548e-02 -2.4689050018787384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2396 1.3114510476589203e-01</internalNodes>
+          <leafValues>
+            -5.7957381010055542e-02 2.7318599820137024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2397 -7.4186350502714049e-06</internalNodes>
+          <leafValues>
+            1.1802060157060623e-01 -1.0745350271463394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2398 3.1472120434045792e-02</internalNodes>
+          <leafValues>
+            -7.1733877062797546e-02 2.5617578625679016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2399 3.8700491189956665e-02</internalNodes>
+          <leafValues>
+            4.2863689363002777e-02 -6.0855817794799805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2400 -3.9322520606219769e-03</internalNodes>
+          <leafValues>
+            -2.2127309441566467e-01 6.5617948770523071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2401 2.3144779726862907e-02</internalNodes>
+          <leafValues>
+            -6.8200387060642242e-02 1.6107009351253510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2402 4.4043041765689850e-02</internalNodes>
+          <leafValues>
+            -5.4092731326818466e-02 2.7009010314941406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2403 1.6363389790058136e-02</internalNodes>
+          <leafValues>
+            -6.7165039479732513e-02 1.4292019605636597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2404 4.0575690567493439e-02</internalNodes>
+          <leafValues>
+            2.7095599099993706e-02 -5.1922810077667236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2405 -8.1591978669166565e-02</internalNodes>
+          <leafValues>
+            3.6290401220321655e-01 -5.0641149282455444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2406 9.6564572304487228e-03</internalNodes>
+          <leafValues>
+            -6.5868496894836426e-02 2.0459869503974915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2407 4.3875370174646378e-02</internalNodes>
+          <leafValues>
+            2.8287120163440704e-02 -4.7316759824752808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2408 -5.3375590592622757e-02</internalNodes>
+          <leafValues>
+            -6.3912391662597656e-01 1.9213579595088959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2409 -4.2789369821548462e-02</internalNodes>
+          <leafValues>
+            3.7414470314979553e-01 -3.6020539700984955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2410 -1.4193350449204445e-02</internalNodes>
+          <leafValues>
+            -3.0562171339988708e-01 5.1724649965763092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2411 -5.2947051823139191e-02</internalNodes>
+          <leafValues>
+            2.2203849256038666e-01 -2.7123190462589264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2412 3.0441719293594360e-01</internalNodes>
+          <leafValues>
+            2.8107000514864922e-02 -5.1486051082611084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2413 9.6917577087879181e-02</internalNodes>
+          <leafValues>
+            7.5603500008583069e-03 -5.4642218351364136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2414 4.5469900942407548e-04</internalNodes>
+          <leafValues>
+            -2.2257779538631439e-01 5.9663061052560806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2415 6.4785419963300228e-03</internalNodes>
+          <leafValues>
+            7.0507273077964783e-02 -8.6525917053222656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2416 9.5442440360784531e-03</internalNodes>
+          <leafValues>
+            1.1858390271663666e-01 -1.2846529483795166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2417 1.0664040222764015e-02</internalNodes>
+          <leafValues>
+            6.0251180082559586e-02 -2.3454129695892334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2418 -5.9601400047540665e-02</internalNodes>
+          <leafValues>
+            -4.9083110690116882e-01 3.1179970130324364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2419 -1.4810609631240368e-02</internalNodes>
+          <leafValues>
+            1.7928470671176910e-01 -5.3788300603628159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2420 2.4988459423184395e-02</internalNodes>
+          <leafValues>
+            4.5585051178932190e-02 -3.1542968750000000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2421 3.7159871309995651e-02</internalNodes>
+          <leafValues>
+            -2.5552989915013313e-02 1.2824480235576630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2422 -3.6023799329996109e-02</internalNodes>
+          <leafValues>
+            3.0338558554649353e-01 -5.0723869353532791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2423 -4.0073681622743607e-02</internalNodes>
+          <leafValues>
+            -3.5327419638633728e-01 2.5542749091982841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2424 1.0118799656629562e-01</internalNodes>
+          <leafValues>
+            1.4954050071537495e-02 -8.5275518894195557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2425 1.2551939487457275e-01</internalNodes>
+          <leafValues>
+            -5.5777598172426224e-02 3.5162329673767090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2426 -1.0094200260937214e-02</internalNodes>
+          <leafValues>
+            -7.9517722129821777e-01 1.6658289358019829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2427 2.7957880869507790e-02</internalNodes>
+          <leafValues>
+            3.0823230743408203e-02 -2.9073038697242737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2428 3.6360241472721100e-02</internalNodes>
+          <leafValues>
+            2.7960959821939468e-02 -4.7691631317138672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2429 -9.9100463092327118e-02</internalNodes>
+          <leafValues>
+            -3.0804800987243652e-01 4.2725458741188049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2430 -5.8572040870785713e-04</internalNodes>
+          <leafValues>
+            5.9227660298347473e-02 -2.3531119525432587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2431 -5.1202569156885147e-02</internalNodes>
+          <leafValues>
+            -5.2199620008468628e-01 1.4952239580452442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2432 -6.7564798519015312e-03</internalNodes>
+          <leafValues>
+            1.4085020124912262e-01 -9.0452179312705994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2433 -4.8959780484437943e-02</internalNodes>
+          <leafValues>
+            -6.6878128051757812e-01 2.0590359345078468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2434 1.4971289783716202e-04</internalNodes>
+          <leafValues>
+            -1.8641050159931183e-01 6.5254852175712585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2435 -3.4409679472446442e-02</internalNodes>
+          <leafValues>
+            -6.5235960483551025e-01 1.4693650417029858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2436 6.4725689589977264e-02</internalNodes>
+          <leafValues>
+            1.2329719960689545e-02 -8.4077721834182739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2437 1.7888710135594010e-03</internalNodes>
+          <leafValues>
+            -3.3088308572769165e-01 2.3944050073623657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2438 7.4999839067459106e-02</internalNodes>
+          <leafValues>
+            2.6347629725933075e-02 -4.4841340184211731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2439 -1.3695800304412842e-01</internalNodes>
+          <leafValues>
+            -5.7192331552505493e-01 1.2316530337557197e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2440 8.7679617106914520e-02</internalNodes>
+          <leafValues>
+            9.1852411627769470e-02 -1.4714670181274414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2441 -1.4691170305013657e-02</internalNodes>
+          <leafValues>
+            -2.7389299869537354e-01 5.5910948663949966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2442 1.8059760332107544e-01</internalNodes>
+          <leafValues>
+            1.8475739285349846e-02 -6.2247991561889648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2443 -6.9349152036011219e-03</internalNodes>
+          <leafValues>
+            -1.6723890602588654e-01 4.2348120361566544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2444 -4.5395728200674057e-02</internalNodes>
+          <leafValues>
+            5.6401878595352173e-01 -2.0763039588928223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2445 -3.7714779376983643e-02</internalNodes>
+          <leafValues>
+            -4.9726399779319763e-01 1.3457749970257282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2446 -6.6780918277800083e-03</internalNodes>
+          <leafValues>
+            1.5654189884662628e-01 -7.9254247248172760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2447 -3.5693418234586716e-02</internalNodes>
+          <leafValues>
+            3.2214561104774475e-01 -2.7933960780501366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2448 2.0231369417160749e-03</internalNodes>
+          <leafValues>
+            -2.0472900569438934e-01 6.0136921703815460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2449 7.7706989832222462e-03</internalNodes>
+          <leafValues>
+            -6.2275718897581100e-02 1.3619600236415863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2450 -2.3846060037612915e-02</internalNodes>
+          <leafValues>
+            -6.4280962944030762e-01 1.9216870889067650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2451 3.8112789392471313e-02</internalNodes>
+          <leafValues>
+            1.6926249489188194e-02 -3.2001879811286926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2452 -8.1509854644536972e-03</internalNodes>
+          <leafValues>
+            -1.8527400493621826e-01 6.7431643605232239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2453 3.0041670799255371e-01</internalNodes>
+          <leafValues>
+            -3.4997869282960892e-02 3.7719568610191345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2454 3.2188769546337426e-04</internalNodes>
+          <leafValues>
+            -4.3860068917274475e-01 3.1008180230855942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2455 9.9805131554603577e-02</internalNodes>
+          <leafValues>
+            2.1043010056018829e-02 -2.4182139337062836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2456 -1.3132029771804810e-01</internalNodes>
+          <leafValues>
+            -6.0744529962539673e-01 1.9127229228615761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2457 -4.4457878917455673e-02</internalNodes>
+          <leafValues>
+            -2.8207719326019287e-01 1.6199590638279915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2458 -5.3282459266483784e-03</internalNodes>
+          <leafValues>
+            1.9118839502334595e-01 -6.4483523368835449e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2459 4.0367528796195984e-02</internalNodes>
+          <leafValues>
+            1.6362620517611504e-02 -5.5463272333145142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2460 -8.7769925594329834e-03</internalNodes>
+          <leafValues>
+            -3.8903188705444336e-01 3.1277969479560852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2461 -1.5031780116260052e-02</internalNodes>
+          <leafValues>
+            4.4966968894004822e-01 -1.8708650022745132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2462 -3.2085120677947998e-02</internalNodes>
+          <leafValues>
+            2.2872669994831085e-01 -5.2647799253463745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2463 1.7735429573804140e-03</internalNodes>
+          <leafValues>
+            1.0644569993019104e-01 -1.1970230191946030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2464 5.9195980429649353e-02</internalNodes>
+          <leafValues>
+            -6.4485557377338409e-02 1.8440729379653931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2465 1.1976130306720734e-02</internalNodes>
+          <leafValues>
+            -4.6655338257551193e-02 2.2750610113143921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2466 -7.3619361501187086e-04</internalNodes>
+          <leafValues>
+            6.4427956938743591e-02 -1.9669359922409058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2467 1.1274980008602142e-01</internalNodes>
+          <leafValues>
+            -3.2603729516267776e-02 2.6165801286697388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2468 -2.9639130458235741e-02</internalNodes>
+          <leafValues>
+            -2.4286089837551117e-01 5.2550770342350006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2469 -4.8972599208354950e-02</internalNodes>
+          <leafValues>
+            2.9013419151306152e-01 -3.9936609566211700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2470 -2.0732060074806213e-03</internalNodes>
+          <leafValues>
+            6.6728956997394562e-02 -1.8385919928550720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2471 1.8652489781379700e-01</internalNodes>
+          <leafValues>
+            2.5788070634007454e-02 -3.0477121472358704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2472 -6.4846210181713104e-02</internalNodes>
+          <leafValues>
+            5.8964151144027710e-01 -2.1531870588660240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2473 5.9668030589818954e-02</internalNodes>
+          <leafValues>
+            9.0434495359659195e-03 -8.9928478002548218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2474 -2.2810790687799454e-02</internalNodes>
+          <leafValues>
+            -5.5689752101898193e-01 2.1036420017480850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2475 -4.3924558907747269e-02</internalNodes>
+          <leafValues>
+            -7.7569800615310669e-01 1.3244120404124260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2476 -8.1411283463239670e-03</internalNodes>
+          <leafValues>
+            -1.6145749390125275e-01 6.3869751989841461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2477 -1.7681140452623367e-02</internalNodes>
+          <leafValues>
+            -1.7088229954242706e-01 4.4323820620775223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2478 3.5615780949592590e-01</internalNodes>
+          <leafValues>
+            1.3911530375480652e-02 -8.2366949319839478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2479 8.9791387319564819e-02</internalNodes>
+          <leafValues>
+            -3.3068671822547913e-02 3.9501950144767761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2480 -5.1039960235357285e-02</internalNodes>
+          <leafValues>
+            -4.9687319993972778e-01 2.4911910295486450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2481 4.4502970576286316e-01</internalNodes>
+          <leafValues>
+            1.3085749931633472e-02 -7.1374338865280151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2482 -3.1571299768984318e-03</internalNodes>
+          <leafValues>
+            -2.3235230147838593e-01 4.5422729104757309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2483 2.2295509278774261e-01</internalNodes>
+          <leafValues>
+            2.5272920727729797e-02 -4.5817920565605164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2484 8.1787049770355225e-02</internalNodes>
+          <leafValues>
+            -5.6966669857501984e-02 2.0633119344711304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2485 1.2290639802813530e-02</internalNodes>
+          <leafValues>
+            1.0433530062437057e-01 -1.4129990339279175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2486 3.2738980371505022e-03</internalNodes>
+          <leafValues>
+            -1.9929160177707672e-01 5.7900499552488327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2487 3.1915940344333649e-03</internalNodes>
+          <leafValues>
+            -2.8649568557739258e-01 3.8445938378572464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2488 -6.9429136812686920e-02</internalNodes>
+          <leafValues>
+            3.9995300769805908e-01 -2.9228420928120613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2489 3.0896291136741638e-01</internalNodes>
+          <leafValues>
+            4.5684990473091602e-03 -9.7593581676483154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2490 6.0547169297933578e-02</internalNodes>
+          <leafValues>
+            -1.7227350175380707e-01 7.3367759585380554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2491 8.0296747386455536e-02</internalNodes>
+          <leafValues>
+            1.2790890410542488e-02 -2.9636448621749878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2492 9.8309047520160675e-02</internalNodes>
+          <leafValues>
+            1.7421530559659004e-02 -7.3428112268447876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2493 -6.0651078820228577e-02</internalNodes>
+          <leafValues>
+            -8.9268088340759277e-01 9.2950398102402687e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2494 -1.1067830026149750e-02</internalNodes>
+          <leafValues>
+            3.6940470337867737e-01 -3.2281860709190369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2495 -1.7252689227461815e-02</internalNodes>
+          <leafValues>
+            2.0163689553737640e-01 -3.0649609863758087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2496 1.1417149752378464e-01</internalNodes>
+          <leafValues>
+            -7.2567440569400787e-02 1.4580799639225006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2497 -1.1878489749506116e-04</internalNodes>
+          <leafValues>
+            6.6703669726848602e-02 -1.2044110149145126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2498 4.2538821697235107e-02</internalNodes>
+          <leafValues>
+            1.4235669374465942e-01 -9.3128196895122528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2499 4.6220790594816208e-02</internalNodes>
+          <leafValues>
+            -4.5348118990659714e-02 2.6667690277099609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2500 -1.2598860263824463e-01</internalNodes>
+          <leafValues>
+            -6.2195998430252075e-01 1.9361790269613266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2501 1.4336410164833069e-01</internalNodes>
+          <leafValues>
+            1.5602460131049156e-02 -3.4269729256629944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2502 1.4853400178253651e-02</internalNodes>
+          <leafValues>
+            -1.9399890303611755e-01 5.9365049004554749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2503 2.9607299715280533e-02</internalNodes>
+          <leafValues>
+            2.9370859265327454e-02 -1.1840560287237167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2504 4.5151200145483017e-02</internalNodes>
+          <leafValues>
+            -3.1025370582938194e-02 4.2335650324821472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2505 1.7347050830721855e-02</internalNodes>
+          <leafValues>
+            5.2468661218881607e-02 -1.7071889340877533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2506 4.8696789890527725e-02</internalNodes>
+          <leafValues>
+            1.3757590204477310e-02 -7.3853892087936401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2507 -2.5120940059423447e-02</internalNodes>
+          <leafValues>
+            -2.6077219843864441e-01 3.6249000579118729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2508 -1.4412039890885353e-02</internalNodes>
+          <leafValues>
+            1.8435400724411011e-01 -5.5376049131155014e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2509 1.6011130064725876e-02</internalNodes>
+          <leafValues>
+            -3.3822190016508102e-02 9.8490990698337555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2510 -6.3778877258300781e-02</internalNodes>
+          <leafValues>
+            3.9596658945083618e-01 -2.6605289429426193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2511 -1.2431790120899677e-02</internalNodes>
+          <leafValues>
+            -2.7103281021118164e-01 5.1153909415006638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2512 1.5430289506912231e-01</internalNodes>
+          <leafValues>
+            -2.9742069542407990e-02 3.6223879456520081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2513 6.8953618407249451e-02</internalNodes>
+          <leafValues>
+            1.4560540206730366e-02 -7.1308761835098267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2514 2.6809390634298325e-02</internalNodes>
+          <leafValues>
+            3.0903020873665810e-02 -3.1453761458396912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2515 -5.4339639842510223e-02</internalNodes>
+          <leafValues>
+            -5.7081592082977295e-01 6.3606691546738148e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2516 -7.4291341006755829e-03</internalNodes>
+          <leafValues>
+            -2.1167820692062378e-01 5.4728411138057709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2517 1.5004719607532024e-02</internalNodes>
+          <leafValues>
+            -1.3576979935169220e-01 3.6672618240118027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2518 2.3438859730958939e-02</internalNodes>
+          <leafValues>
+            -6.2095177173614502e-01 1.7451370134949684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2519 2.1869429945945740e-01</internalNodes>
+          <leafValues>
+            -2.5175819173455238e-02 2.4256730079650879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2520 7.2554901242256165e-02</internalNodes>
+          <leafValues>
+            3.0378310009837151e-02 -3.5316839814186096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2521 -6.0775190591812134e-02</internalNodes>
+          <leafValues>
+            6.1231142282485962e-01 -2.9397750273346901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2522 1.0405359789729118e-02</internalNodes>
+          <leafValues>
+            -4.8925351351499557e-02 2.0042200386524200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2523 -4.4559161178767681e-03</internalNodes>
+          <leafValues>
+            -1.8175999820232391e-01 5.1460109651088715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2524 5.3141661919653416e-03</internalNodes>
+          <leafValues>
+            1.0836429893970490e-01 -1.1464370042085648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2525 2.8129909187555313e-02</internalNodes>
+          <leafValues>
+            4.8452459275722504e-02 -1.0588149726390839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2526 -1.0029030032455921e-02</internalNodes>
+          <leafValues>
+            -2.8854200243949890e-01 4.6509381383657455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2527 4.1623760014772415e-02</internalNodes>
+          <leafValues>
+            -5.2424181252717972e-02 2.4638059735298157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2528 1.7407029867172241e-02</internalNodes>
+          <leafValues>
+            -5.9511799365282059e-02 2.2489009797573090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2529 -9.1012917459011078e-02</internalNodes>
+          <leafValues>
+            3.8434851169586182e-01 -2.6776079088449478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2530 -5.5964559316635132e-02</internalNodes>
+          <leafValues>
+            3.3512559533119202e-01 -3.7086669355630875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2531 -2.3191609978675842e-01</internalNodes>
+          <leafValues>
+            -7.9937142133712769e-01 1.6157710924744606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2532 1.5095779672265053e-02</internalNodes>
+          <leafValues>
+            1.9562739878892899e-02 -4.7588780522346497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2533 -6.3537202775478363e-02</internalNodes>
+          <leafValues>
+            5.5103862285614014e-01 -9.9191991612315178e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2534 5.0780471414327621e-02</internalNodes>
+          <leafValues>
+            -5.0766121596097946e-02 1.9856730103492737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2535 3.3435709774494171e-02</internalNodes>
+          <leafValues>
+            1.7100030556321144e-02 -3.9106050133705139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2536 2.7236310765147209e-02</internalNodes>
+          <leafValues>
+            1.9491130486130714e-02 -4.9955821037292480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2537 3.6144461482763290e-02</internalNodes>
+          <leafValues>
+            1.9712809473276138e-02 -4.7714808583259583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2538 -3.7110898643732071e-02</internalNodes>
+          <leafValues>
+            -7.1080970764160156e-01 1.3297240249812603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2539 -1.6986919799819589e-03</internalNodes>
+          <leafValues>
+            -1.1454039812088013e-01 5.3833190351724625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2540 7.0956937270238996e-04</internalNodes>
+          <leafValues>
+            -1.1852429807186127e-01 8.6146153509616852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2541 -3.9854459464550018e-02</internalNodes>
+          <leafValues>
+            -2.1784169971942902e-01 7.9314615577459335e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2542 -2.6265300810337067e-02</internalNodes>
+          <leafValues>
+            5.1828277111053467e-01 -1.9502539187669754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2543 1.5767179429531097e-03</internalNodes>
+          <leafValues>
+            -9.0025149285793304e-02 4.3614149093627930e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2544 8.4500849246978760e-02</internalNodes>
+          <leafValues>
+            1.9108800217509270e-02 -5.8049428462982178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2545 5.8061029762029648e-02</internalNodes>
+          <leafValues>
+            5.1128780469298363e-03 -3.6629718542098999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2546 -8.6446420755237341e-04</internalNodes>
+          <leafValues>
+            9.8551221191883087e-02 -9.9286876618862152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2547 -1.6358779743313789e-02</internalNodes>
+          <leafValues>
+            -2.2353939712047577e-01 4.5100010931491852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2548 1.2069500051438808e-02</internalNodes>
+          <leafValues>
+            -3.0885580927133560e-02 3.5933670401573181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2549 6.4932592213153839e-02</internalNodes>
+          <leafValues>
+            8.9946594089269638e-03 -6.5505272150039673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2550 -1.6384720802307129e-02</internalNodes>
+          <leafValues>
+            1.8374380469322205e-01 -5.8319728821516037e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2551 3.6467831581830978e-02</internalNodes>
+          <leafValues>
+            3.3053800463676453e-02 -3.1176608800888062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2552 -4.8026088625192642e-03</internalNodes>
+          <leafValues>
+            -1.3096930086612701e-01 8.8815420866012573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2553 -9.7134411334991455e-03</internalNodes>
+          <leafValues>
+            1.2485890090465546e-01 -4.5851919800043106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2554 -3.6871319753117859e-04</internalNodes>
+          <leafValues>
+            1.0798580199480057e-01 -1.0795330256223679e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>248</maxWeakCount>
+      <stageThreshold>-1.3472950458526611e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2555 4.8573319800198078e-03</internalNodes>
+          <leafValues>
+            -2.2165919840335846e-01 2.0661990344524384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2556 -9.0601091505959630e-04</internalNodes>
+          <leafValues>
+            9.2684216797351837e-02 -3.4692689776420593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2557 3.8109601009637117e-03</internalNodes>
+          <leafValues>
+            -4.7693979740142822e-01 7.2208866477012634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2558 -1.9349349895492196e-03</internalNodes>
+          <leafValues>
+            -2.3474289476871490e-01 1.0308369994163513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2559 4.6932199038565159e-03</internalNodes>
+          <leafValues>
+            -2.1755599975585938e-01 1.0297770053148270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2560 -4.5681721530854702e-03</internalNodes>
+          <leafValues>
+            -3.2979539036750793e-01 6.2108699232339859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2561 2.0976159721612930e-03</internalNodes>
+          <leafValues>
+            -2.7585551142692566e-01 7.4447788298130035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2562 -2.3434460163116455e-02</internalNodes>
+          <leafValues>
+            -2.4517090618610382e-01 2.0888300612568855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2563 -7.5489659793674946e-03</internalNodes>
+          <leafValues>
+            -2.3539499938488007e-01 8.0594792962074280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2564 -1.3637889642268419e-03</internalNodes>
+          <leafValues>
+            1.2462289631366730e-01 -1.4383980631828308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2565 2.0881770178675652e-02</internalNodes>
+          <leafValues>
+            -2.5486978888511658e-01 7.0480130612850189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2566 -1.6712560318410397e-03</internalNodes>
+          <leafValues>
+            -1.4747080206871033e-01 9.3597747385501862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2567 -5.8552708476781845e-02</internalNodes>
+          <leafValues>
+            3.7929660081863403e-01 -3.7892241030931473e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2568 -4.7591641545295715e-02</internalNodes>
+          <leafValues>
+            3.4769389033317566e-01 -2.9484409838914871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2569 5.7788072153925896e-03</internalNodes>
+          <leafValues>
+            4.1627179831266403e-02 -3.8012310862541199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2570 6.1923051252961159e-03</internalNodes>
+          <leafValues>
+            -7.9854242503643036e-02 1.4662300050258636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2571 8.6211357265710831e-03</internalNodes>
+          <leafValues>
+            -7.9052597284317017e-02 1.9707180559635162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2572 3.8787689805030823e-01</internalNodes>
+          <leafValues>
+            9.9500510841608047e-03 -5.4955279827117920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2573 1.2184830009937286e-01</internalNodes>
+          <leafValues>
+            2.1560879424214363e-02 -7.1182191371917725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2574 5.6779510341584682e-03</internalNodes>
+          <leafValues>
+            5.0778731703758240e-02 -1.9817540049552917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2575 -3.2407268881797791e-02</internalNodes>
+          <leafValues>
+            -6.5776360034942627e-01 1.8930230289697647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2576 2.3834649473428726e-03</internalNodes>
+          <leafValues>
+            3.5910621285438538e-02 -1.9386079907417297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2577 4.4861159403808415e-04</internalNodes>
+          <leafValues>
+            6.3049189746379852e-02 -2.3067280650138855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2578 2.8381360694766045e-02</internalNodes>
+          <leafValues>
+            1.3798769563436508e-02 -2.0287990570068359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2579 -2.7084869798272848e-03</internalNodes>
+          <leafValues>
+            -1.6455270349979401e-01 8.1182733178138733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2580 -1.3218579813838005e-02</internalNodes>
+          <leafValues>
+            1.2929069995880127e-01 -4.9410581588745117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2581 1.8623949727043509e-03</internalNodes>
+          <leafValues>
+            -2.7398198843002319e-01 4.5746099203824997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2582 -6.6727721132338047e-03</internalNodes>
+          <leafValues>
+            -1.5167540311813354e-01 5.5587619543075562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2583 1.9492399878799915e-03</internalNodes>
+          <leafValues>
+            -8.5547126829624176e-02 1.3712610304355621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2584 -7.0978812873363495e-02</internalNodes>
+          <leafValues>
+            -7.7429318428039551e-01 5.5506629869341850e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2585 5.7003321126103401e-03</internalNodes>
+          <leafValues>
+            6.0299661010503769e-02 -2.3000110685825348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2586 6.6310778260231018e-02</internalNodes>
+          <leafValues>
+            -8.5690699517726898e-02 1.5169920027256012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2587 -8.5291899740695953e-03</internalNodes>
+          <leafValues>
+            1.4297589659690857e-01 -9.1805547475814819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2588 5.1141469739377499e-03</internalNodes>
+          <leafValues>
+            4.6917989850044250e-02 -1.3319849967956543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2589 1.9523530500009656e-03</internalNodes>
+          <leafValues>
+            -1.4177489280700684e-01 1.0524170100688934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2590 1.9558310508728027e-01</internalNodes>
+          <leafValues>
+            1.4478860422968864e-02 -7.9985427856445312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2591 5.3029200062155724e-03</internalNodes>
+          <leafValues>
+            3.7237700074911118e-02 -2.6131349802017212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2592 6.4814360812306404e-03</internalNodes>
+          <leafValues>
+            -4.9092698842287064e-02 2.5681778788566589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2593 -6.1802868731319904e-03</internalNodes>
+          <leafValues>
+            -2.1317920088768005e-01 6.1390031129121780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2594 1.9895739387720823e-03</internalNodes>
+          <leafValues>
+            -7.1335382759571075e-02 1.3002429902553558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2595 -4.2928531183861196e-04</internalNodes>
+          <leafValues>
+            7.2383478283882141e-02 -1.5643799304962158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2596 -4.5690318802371621e-04</internalNodes>
+          <leafValues>
+            7.5732357800006866e-02 -1.0932859778404236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2597 -1.3333739340305328e-01</internalNodes>
+          <leafValues>
+            -5.4889208078384399e-01 1.9494550302624702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2598 8.2705507520586252e-04</internalNodes>
+          <leafValues>
+            -1.8739989399909973e-01 5.7498261332511902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2599 -1.6954699531197548e-03</internalNodes>
+          <leafValues>
+            -1.4100700616836548e-01 8.6548388004302979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2600 9.8944529891014099e-03</internalNodes>
+          <leafValues>
+            1.7898159101605415e-02 -3.1395688652992249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2601 6.0766572132706642e-03</internalNodes>
+          <leafValues>
+            -1.3120110332965851e-01 9.1578528285026550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2602 -3.5680279135704041e-02</internalNodes>
+          <leafValues>
+            -3.8880988955497742e-01 1.1377809569239616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2603 8.7540567619726062e-04</internalNodes>
+          <leafValues>
+            5.3022928535938263e-02 -2.1509949862957001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2604 1.9438719609752297e-03</internalNodes>
+          <leafValues>
+            -8.1035703420639038e-02 1.3382309675216675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2605 5.6398138403892517e-02</internalNodes>
+          <leafValues>
+            1.4857930131256580e-02 -6.9551151990890503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2606 -1.0274930391460657e-03</internalNodes>
+          <leafValues>
+            -1.9196349382400513e-01 4.7596029937267303e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2607 -3.3568819053471088e-03</internalNodes>
+          <leafValues>
+            1.0466050356626511e-01 -1.0170979797840118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2608 1.1734040081501007e-01</internalNodes>
+          <leafValues>
+            -4.6565439552068710e-02 2.0878739655017853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2609 8.8005866855382919e-03</internalNodes>
+          <leafValues>
+            9.1754652559757233e-02 -1.2221500277519226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2610 2.4095149710774422e-03</internalNodes>
+          <leafValues>
+            -3.6752160638570786e-02 2.3443439602851868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2611 -2.8434590785764158e-04</internalNodes>
+          <leafValues>
+            -1.9996729493141174e-01 4.7353159636259079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2612 1.7623709514737129e-02</internalNodes>
+          <leafValues>
+            -2.2765519097447395e-02 2.5646668672561646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2613 1.4121740125119686e-02</internalNodes>
+          <leafValues>
+            2.2659989073872566e-02 -4.2449080944061279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2614 -1.5290649607777596e-02</internalNodes>
+          <leafValues>
+            2.4445760250091553e-01 -4.3145630508661270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2615 -2.5426879525184631e-02</internalNodes>
+          <leafValues>
+            4.1280931234359741e-01 -2.5002820417284966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2616 8.7438793852925301e-03</internalNodes>
+          <leafValues>
+            4.1931539773941040e-02 -1.2433040142059326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2617 4.1642960160970688e-02</internalNodes>
+          <leafValues>
+            2.1535869687795639e-02 -4.9062231183052063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2618 7.0692330598831177e-02</internalNodes>
+          <leafValues>
+            -2.4307090789079666e-02 3.3606329560279846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2619 -7.7690348029136658e-02</internalNodes>
+          <leafValues>
+            -7.3883998394012451e-01 1.3576829805970192e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2620 3.7781539140269160e-04</internalNodes>
+          <leafValues>
+            -9.6697732806205750e-02 9.4690509140491486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2621 -1.1192850070074201e-03</internalNodes>
+          <leafValues>
+            -2.1631820499897003e-01 4.4235199689865112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2622 5.9772249311208725e-02</internalNodes>
+          <leafValues>
+            -3.2024260610342026e-02 3.0602660775184631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2623 -1.5417120419442654e-02</internalNodes>
+          <leafValues>
+            -3.4087839722633362e-01 2.8097979724407196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2624 -6.3111339695751667e-03</internalNodes>
+          <leafValues>
+            1.5327680110931396e-01 -4.7901459038257599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2625 -1.8826499581336975e-02</internalNodes>
+          <leafValues>
+            -1.5269599854946136e-01 6.0955628752708435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2626 -3.9223838597536087e-02</internalNodes>
+          <leafValues>
+            2.6624131202697754e-01 -7.6400930993258953e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2627 -4.8653159290552139e-02</internalNodes>
+          <leafValues>
+            -4.5488500595092773e-01 1.9853049889206886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2628 6.7260518670082092e-02</internalNodes>
+          <leafValues>
+            1.0999150108546019e-03 -7.5273478031158447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2629 1.2728190049529076e-03</internalNodes>
+          <leafValues>
+            -7.8121297061443329e-02 1.1816550046205521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2630 -9.4147026538848877e-02</internalNodes>
+          <leafValues>
+            -5.2153587341308594e-01 1.4973170123994350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2631 -4.7454461455345154e-02</internalNodes>
+          <leafValues>
+            2.6547148823738098e-01 -3.0587410554289818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2632 -5.6014367146417499e-04</internalNodes>
+          <leafValues>
+            -1.0506449639797211e-01 6.0161281377077103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2633 -2.9601220740005374e-04</internalNodes>
+          <leafValues>
+            6.2257450073957443e-02 -1.3126540184020996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2634 -2.0918490365147591e-02</internalNodes>
+          <leafValues>
+            -2.0831510424613953e-01 2.6843119412660599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2635 -7.2696260176599026e-03</internalNodes>
+          <leafValues>
+            -1.6227640211582184e-01 6.1937049031257629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2636 7.2555372025817633e-04</internalNodes>
+          <leafValues>
+            -1.0315939784049988e-01 6.8040877580642700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2637 2.0828839391469955e-02</internalNodes>
+          <leafValues>
+            -4.4557690620422363e-02 2.2167469561100006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2638 8.7201192975044250e-02</internalNodes>
+          <leafValues>
+            9.5432223752140999e-03 -5.8706420660018921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2639 4.1596628725528717e-02</internalNodes>
+          <leafValues>
+            -3.0774539336562157e-02 2.8809019923210144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2640 -2.6154879480600357e-02</internalNodes>
+          <leafValues>
+            -5.9353542327880859e-01 1.4388410374522209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2641 2.7175429463386536e-01</internalNodes>
+          <leafValues>
+            1.3717720285058022e-02 -5.4619067907333374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2642 2.1811699494719505e-02</internalNodes>
+          <leafValues>
+            -1.6798110678792000e-02 2.9062330722808838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2643 -1.9965929910540581e-02</internalNodes>
+          <leafValues>
+            -4.3052119016647339e-01 1.8917759880423546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2644 -1.1561929713934660e-03</internalNodes>
+          <leafValues>
+            8.8031537830829620e-02 -1.9590209424495697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2645 -1.6627550357952714e-03</internalNodes>
+          <leafValues>
+            8.9111559092998505e-02 -9.0959653258323669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2646 -1.7325150547549129e-03</internalNodes>
+          <leafValues>
+            -1.1540830135345459e-01 5.3636670112609863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2647 -3.9231408387422562e-02</internalNodes>
+          <leafValues>
+            6.2471270561218262e-01 -1.3666920363903046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2648 1.0423580184578896e-02</internalNodes>
+          <leafValues>
+            2.4711130186915398e-02 -1.6751749813556671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2649 2.2725639864802361e-03</internalNodes>
+          <leafValues>
+            -5.5126778781414032e-02 1.4781460165977478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2650 -3.9644641801714897e-03</internalNodes>
+          <leafValues>
+            1.1337990313768387e-01 -6.8672053515911102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2651 4.0544760413467884e-03</internalNodes>
+          <leafValues>
+            4.0180210024118423e-02 -2.3837350308895111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2652 2.0538640674203634e-03</internalNodes>
+          <leafValues>
+            3.2863691449165344e-02 -1.2495829910039902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2653 2.9705381020903587e-03</internalNodes>
+          <leafValues>
+            4.1810061782598495e-02 -2.0539659261703491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2654 -8.3381328731775284e-03</internalNodes>
+          <leafValues>
+            9.2258736491203308e-02 -3.8435179740190506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2655 1.5640279743820429e-03</internalNodes>
+          <leafValues>
+            -9.6661567687988281e-02 8.5594817996025085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2656 -3.7052970379590988e-02</internalNodes>
+          <leafValues>
+            -7.7915471792221069e-01 1.0418290272355080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2657 -1.0109930299222469e-02</internalNodes>
+          <leafValues>
+            1.2499059736728668e-01 -6.4437836408615112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2658 -7.9335980117321014e-02</internalNodes>
+          <leafValues>
+            7.0784372091293335e-01 -3.1601081136614084e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2659 -2.5811919476836920e-03</internalNodes>
+          <leafValues>
+            -1.6802759468555450e-01 6.7257612943649292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2660 1.8863540142774582e-02</internalNodes>
+          <leafValues>
+            -5.2749298512935638e-02 1.4578150212764740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2661 6.1697891214862466e-04</internalNodes>
+          <leafValues>
+            -9.6527166664600372e-02 9.3077242374420166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2662 -9.9242655560374260e-03</internalNodes>
+          <leafValues>
+            1.2164440006017685e-01 -2.6439830660820007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2663 -4.7382008284330368e-02</internalNodes>
+          <leafValues>
+            -3.7194240093231201e-01 2.4884449318051338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2664 3.8585590664297342e-03</internalNodes>
+          <leafValues>
+            -4.2420830577611923e-02 1.1997900158166885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2665 2.3721279576420784e-03</internalNodes>
+          <leafValues>
+            -7.2769053280353546e-02 1.3027629256248474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2666 -3.1968571245670319e-02</internalNodes>
+          <leafValues>
+            -4.7088149189949036e-01 1.8863039091229439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2667 -7.2849751450121403e-04</internalNodes>
+          <leafValues>
+            2.8128319978713989e-01 -3.0785139650106430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2668 -1.2096880003809929e-02</internalNodes>
+          <leafValues>
+            -7.0163071155548096e-01 1.3336709700524807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2669 -1.7658369615674019e-02</internalNodes>
+          <leafValues>
+            1.9193160533905029e-01 -4.7951001673936844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2670 -1.0974059812724590e-02</internalNodes>
+          <leafValues>
+            -2.7307328581809998e-01 2.8784489259123802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2671 -1.8560180440545082e-02</internalNodes>
+          <leafValues>
+            -4.4306761026382446e-01 2.0472019910812378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2672 1.3861100189387798e-02</internalNodes>
+          <leafValues>
+            -3.7471339106559753e-02 1.0929849743843079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2673 5.6243170052766800e-02</internalNodes>
+          <leafValues>
+            1.3322129845619202e-02 -6.1972159147262573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2674 -1.3746799901127815e-02</internalNodes>
+          <leafValues>
+            1.8980909883975983e-01 -4.3810151517391205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2675 -2.0494889758992940e-04</internalNodes>
+          <leafValues>
+            -1.4809520542621613e-01 5.9458550065755844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2676 1.1416030116379261e-02</internalNodes>
+          <leafValues>
+            4.5111801475286484e-02 -1.7277219891548157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2677 4.1169788688421249e-02</internalNodes>
+          <leafValues>
+            -2.3442840203642845e-02 3.3413231372833252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2678 -9.6223354339599609e-03</internalNodes>
+          <leafValues>
+            -1.6086310148239136e-01 3.3183149993419647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2679 1.5951909590512514e-03</internalNodes>
+          <leafValues>
+            -6.3590511679649353e-02 1.3396669924259186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2680 -6.3169049099087715e-03</internalNodes>
+          <leafValues>
+            -1.6365319490432739e-01 5.1552049815654755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2681 4.6467378735542297e-02</internalNodes>
+          <leafValues>
+            -2.5627709925174713e-02 3.8097569346427917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2682 9.1598592698574066e-02</internalNodes>
+          <leafValues>
+            4.2748241685330868e-03 -5.9740132093429565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2683 -1.0416290024295449e-03</internalNodes>
+          <leafValues>
+            -1.4733889698982239e-01 5.5105950683355331e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2684 -2.3334469646215439e-02</internalNodes>
+          <leafValues>
+            9.2266462743282318e-02 -5.3653880953788757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2685 -6.3067381270229816e-03</internalNodes>
+          <leafValues>
+            -1.6974699497222900e-01 6.0046479105949402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2686 5.2549671381711960e-03</internalNodes>
+          <leafValues>
+            -8.8989406824111938e-02 4.7306548804044724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2687 -1.0699460282921791e-02</internalNodes>
+          <leafValues>
+            -1.5823520720005035e-01 5.1100831478834152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2688 -5.4387808777391911e-03</internalNodes>
+          <leafValues>
+            1.2524560093879700e-01 -3.9472699165344238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2689 3.4613600000739098e-03</internalNodes>
+          <leafValues>
+            -6.8892680108547211e-02 1.7920389771461487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2690 -1.7894359305500984e-02</internalNodes>
+          <leafValues>
+            -9.4599656760692596e-02 6.2322728335857391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2691 -2.1147909760475159e-01</internalNodes>
+          <leafValues>
+            -8.6275768280029297e-01 9.4653964042663574e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2692 1.4149859780445695e-03</internalNodes>
+          <leafValues>
+            -8.6214788258075714e-02 4.0635921061038971e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2693 -1.5357299707829952e-03</internalNodes>
+          <leafValues>
+            9.9525436758995056e-02 -7.7558159828186035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2694 2.8714749496430159e-03</internalNodes>
+          <leafValues>
+            -6.3778772950172424e-02 1.1251030117273331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2695 1.8400069326162338e-02</internalNodes>
+          <leafValues>
+            2.3700669407844543e-02 -3.5953688621520996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2696 -7.3078006505966187e-02</internalNodes>
+          <leafValues>
+            -8.3836638927459717e-01 2.1687510889023542e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2697 9.8323542624711990e-03</internalNodes>
+          <leafValues>
+            -5.3899969905614853e-02 1.6186970472335815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2698 2.2987959906458855e-02</internalNodes>
+          <leafValues>
+            1.5955159440636635e-02 -3.3074310421943665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2699 -5.4363980889320374e-03</internalNodes>
+          <leafValues>
+            -1.3372650742530823e-01 5.8162450790405273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2700 1.0177739895880222e-02</internalNodes>
+          <leafValues>
+            -5.7901948690414429e-02 4.0789060294628143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2701 -5.1690369844436646e-02</internalNodes>
+          <leafValues>
+            4.7881290316581726e-01 -2.0051179453730583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2702 -4.6395331621170044e-02</internalNodes>
+          <leafValues>
+            3.5422900319099426e-01 -1.6692889854311943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2703 4.0920148603618145e-04</internalNodes>
+          <leafValues>
+            -5.8872789144515991e-02 1.3617689907550812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2704 3.0743801034986973e-03</internalNodes>
+          <leafValues>
+            3.1892731785774231e-02 -2.9396781325340271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2705 1.3438959419727325e-01</internalNodes>
+          <leafValues>
+            1.5018840320408344e-02 -5.1557308435440063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2706 -4.4954590499401093e-02</internalNodes>
+          <leafValues>
+            -6.5404319763183594e-01 5.8901738375425339e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2707 -4.1479051113128662e-02</internalNodes>
+          <leafValues>
+            -5.6925541162490845e-01 1.3012220151722431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2708 2.9117099940776825e-02</internalNodes>
+          <leafValues>
+            -1.9148029386997223e-02 1.8318380415439606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2709 5.1073249429464340e-02</internalNodes>
+          <leafValues>
+            1.5260309912264347e-02 -4.9480628967285156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2710 7.0886377943679690e-04</internalNodes>
+          <leafValues>
+            8.7698653340339661e-02 -7.3333673179149628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2711 1.1835389770567417e-02</internalNodes>
+          <leafValues>
+            -3.9189878851175308e-02 2.0834849774837494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2712 -4.2260489426553249e-03</internalNodes>
+          <leafValues>
+            -1.8733769655227661e-01 7.4666850268840790e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2713 3.4847799688577652e-02</internalNodes>
+          <leafValues>
+            -3.0572960153222084e-02 2.6511108875274658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2714 1.2932980433106422e-02</internalNodes>
+          <leafValues>
+            2.2224349901080132e-02 -2.3204100131988525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2715 -3.4806900657713413e-03</internalNodes>
+          <leafValues>
+            6.0548238456249237e-02 -1.3034850358963013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2716 1.7225079238414764e-02</internalNodes>
+          <leafValues>
+            -6.7219920456409454e-03 1.1128149926662445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2717 -2.4316289927810431e-03</internalNodes>
+          <leafValues>
+            -1.8720659613609314e-01 4.1284140199422836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2718 -1.1786689981818199e-02</internalNodes>
+          <leafValues>
+            1.5917420387268066e-01 -3.0763400718569756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2719 -5.3132520988583565e-03</internalNodes>
+          <leafValues>
+            -1.3786070048809052e-01 5.4246630519628525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2720 -2.0012039691209793e-02</internalNodes>
+          <leafValues>
+            2.9359638690948486e-01 -2.6866350322961807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2721 2.0955558866262436e-03</internalNodes>
+          <leafValues>
+            6.7963063716888428e-02 -1.2520860135555267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2722 -3.9648640900850296e-02</internalNodes>
+          <leafValues>
+            -5.8195388317108154e-01 1.3146690092980862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2723 -3.4485850483179092e-02</internalNodes>
+          <leafValues>
+            4.5559158921241760e-01 -1.8659429624676704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2724 -4.4569540768861771e-02</internalNodes>
+          <leafValues>
+            -9.2067569494247437e-01 5.3931041620671749e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2725 -1.1394550092518330e-03</internalNodes>
+          <leafValues>
+            -2.1932439506053925e-01 3.6249380558729172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2726 -3.7044081836938858e-02</internalNodes>
+          <leafValues>
+            1.6192549467086792e-01 -4.7661919146776199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2727 1.9300490617752075e-02</internalNodes>
+          <leafValues>
+            -5.4432831704616547e-02 1.4432109892368317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2728 -1.4382150257006288e-03</internalNodes>
+          <leafValues>
+            -6.7343980073928833e-02 4.2511381208896637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2729 3.8761008530855179e-02</internalNodes>
+          <leafValues>
+            1.4171930029988289e-02 -5.3382647037506104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2730 -1.5265800058841705e-01</internalNodes>
+          <leafValues>
+            -9.1533327102661133e-01 2.1413750946521759e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2731 -8.4089813753962517e-03</internalNodes>
+          <leafValues>
+            1.7705249786376953e-01 -4.3753430247306824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2732 -1.6673170030117035e-01</internalNodes>
+          <leafValues>
+            -5.6390452384948730e-01 7.5904577970504761e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2733 -7.3619261384010315e-03</internalNodes>
+          <leafValues>
+            -1.9691839814186096e-01 3.9698500186204910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2734 -9.9920090287923813e-03</internalNodes>
+          <leafValues>
+            -1.3419510424137115e-01 6.3489198684692383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2735 -2.2656610235571861e-03</internalNodes>
+          <leafValues>
+            7.9676061868667603e-02 -1.0685960203409195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2736 -1.3868820667266846e-01</internalNodes>
+          <leafValues>
+            -4.7306931018829346e-01 1.5354130417108536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2737 -1.3284240663051605e-01</internalNodes>
+          <leafValues>
+            -8.7984371185302734e-01 7.0595988072454929e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2738 -2.4882299825549126e-02</internalNodes>
+          <leafValues>
+            1.3333520293235779e-01 -4.0933601558208466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2739 -6.6814320161938667e-03</internalNodes>
+          <leafValues>
+            -1.0295540094375610e-01 7.4870042502880096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2740 6.0326699167490005e-02</internalNodes>
+          <leafValues>
+            1.3355839997529984e-02 -3.7602999806404114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2741 -8.5582301020622253e-02</internalNodes>
+          <leafValues>
+            2.1200770139694214e-01 -3.8742028176784515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2742 -1.2076400220394135e-02</internalNodes>
+          <leafValues>
+            -8.2457520067691803e-02 6.7780442535877228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2743 2.0311089232563972e-02</internalNodes>
+          <leafValues>
+            -1.1817990243434906e-01 6.4830578863620758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2744 -3.9900741539895535e-03</internalNodes>
+          <leafValues>
+            -1.5723599493503571e-01 5.3033929318189621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2745 -1.4961370034143329e-03</internalNodes>
+          <leafValues>
+            2.4392129480838776e-01 -3.1170839443802834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2746 1.8568099767435342e-04</internalNodes>
+          <leafValues>
+            -1.9409550726413727e-01 4.5490209013223648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2747 1.4796480536460876e-01</internalNodes>
+          <leafValues>
+            6.2650348991155624e-03 -9.9987298250198364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2748 1.6918669641017914e-01</internalNodes>
+          <leafValues>
+            4.2962608858942986e-04 -3.5496100783348083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2749 -1.9380000594537705e-04</internalNodes>
+          <leafValues>
+            -1.3056799769401550e-01 5.4877169430255890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2750 -6.2729098135605454e-04</internalNodes>
+          <leafValues>
+            4.1053570806980133e-02 -8.3174988627433777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2751 -2.6877908967435360e-03</internalNodes>
+          <leafValues>
+            1.5513989329338074e-01 -5.5573899298906326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2752 -7.6885253190994263e-02</internalNodes>
+          <leafValues>
+            -6.1440211534500122e-01 3.2789220567792654e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2753 -1.6956549370661378e-04</internalNodes>
+          <leafValues>
+            6.0934148728847504e-02 -1.4717090129852295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2754 3.7390850484371185e-02</internalNodes>
+          <leafValues>
+            8.8595114648342133e-03 -2.3843410611152649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2755 -3.7611280567944050e-03</internalNodes>
+          <leafValues>
+            -1.1896059662103653e-01 5.4526679217815399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2756 -7.5538672506809235e-02</internalNodes>
+          <leafValues>
+            1. -2.8170819859951735e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2757 5.1163119496777654e-04</internalNodes>
+          <leafValues>
+            -1.1333829909563065e-01 6.8293251097202301e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2758 -5.4373521357774734e-02</internalNodes>
+          <leafValues>
+            5.6772488355636597e-01 -5.5303489789366722e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2759 -1.2200759723782539e-02</internalNodes>
+          <leafValues>
+            2.6310768723487854e-01 -3.5334069281816483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2760 6.5340757369995117e-02</internalNodes>
+          <leafValues>
+            8.2145677879452705e-03 -9.7914510965347290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2761 -9.7028106451034546e-02</internalNodes>
+          <leafValues>
+            -7.5845307111740112e-01 6.8704010918736458e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2762 -4.9768280237913132e-02</internalNodes>
+          <leafValues>
+            -8.0786317586898804e-01 1.3162019895389676e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2763 -2.9802118660882115e-04</internalNodes>
+          <leafValues>
+            8.5099622607231140e-02 -9.1054826974868774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2764 1.0124569758772850e-02</internalNodes>
+          <leafValues>
+            -8.9172579348087311e-02 7.7402189373970032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2765 8.1574246287345886e-03</internalNodes>
+          <leafValues>
+            -6.4016029238700867e-02 1.2462829798460007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2766 -1.2093920260667801e-02</internalNodes>
+          <leafValues>
+            -1.8433560431003571e-01 4.9659188836812973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2767 -1.1906909756362438e-02</internalNodes>
+          <leafValues>
+            2.6277810335159302e-01 -2.9921159148216248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2768 -8.1438422203063965e-02</internalNodes>
+          <leafValues>
+            -6.4389252662658691e-01 1.7232710495591164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2769 1.4961180277168751e-03</internalNodes>
+          <leafValues>
+            -1.2228660285472870e-01 5.7763870805501938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2770 -2.2651249542832375e-02</internalNodes>
+          <leafValues>
+            -1.1090759932994843e-01 7.0385642349720001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2771 -2.3789770901203156e-02</internalNodes>
+          <leafValues>
+            2.9644450545310974e-01 -2.5997739285230637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2772 1.4299990143626928e-03</internalNodes>
+          <leafValues>
+            -8.9716851711273193e-02 5.6030821055173874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2773 -4.1593458503484726e-02</internalNodes>
+          <leafValues>
+            -5.8160471916198730e-01 1.1599930003285408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2774 -2.5586199481040239e-03</internalNodes>
+          <leafValues>
+            6.2241408973932266e-02 -1.1328329890966415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2775 -1.0252290219068527e-01</internalNodes>
+          <leafValues>
+            -8.5185718536376953e-01 8.2774916663765907e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2776 -3.1799520365893841e-03</internalNodes>
+          <leafValues>
+            -1.3918060064315796e-01 5.3719218820333481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2777 -3.9835860952734947e-03</internalNodes>
+          <leafValues>
+            1.5531490743160248e-01 -5.3399000316858292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2778 1.0895960032939911e-02</internalNodes>
+          <leafValues>
+            3.9084900170564651e-02 -2.1268959343433380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2779 1.7865100875496864e-02</internalNodes>
+          <leafValues>
+            -2.5146210566163063e-02 3.3581560850143433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2780 5.5075511336326599e-03</internalNodes>
+          <leafValues>
+            2.3314310237765312e-02 -9.3666307628154755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2781 2.0092551130801439e-03</internalNodes>
+          <leafValues>
+            5.7231310755014420e-02 -1.4091749489307404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2782 -1.2218699790537357e-02</internalNodes>
+          <leafValues>
+            1.9243550300598145e-01 -2.4631109088659286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2783 1.8039119895547628e-03</internalNodes>
+          <leafValues>
+            5.5793199688196182e-02 -1.2940339744091034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2784 2.2159840911626816e-02</internalNodes>
+          <leafValues>
+            -9.0001197531819344e-03 5.2156221866607666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2785 -3.5827290266752243e-02</internalNodes>
+          <leafValues>
+            -6.2905979156494141e-01 1.1712389998137951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2786 8.9478418231010437e-03</internalNodes>
+          <leafValues>
+            -3.7455581128597260e-02 1.0906309634447098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2787 -1.2861900031566620e-01</internalNodes>
+          <leafValues>
+            -3.9527180790901184e-01 1.8151529133319855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2788 1.8464029999449849e-03</internalNodes>
+          <leafValues>
+            -3.3952530473470688e-02 9.6596188843250275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2789 2.8246780857443810e-03</internalNodes>
+          <leafValues>
+            -6.2633261084556580e-02 1.1198879778385162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2790 6.9075852632522583e-02</internalNodes>
+          <leafValues>
+            1.3590560294687748e-02 -5.2598261833190918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2791 -8.0794151872396469e-03</internalNodes>
+          <leafValues>
+            1.3081569969654083e-01 -5.0100728869438171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2792 -3.7193649914115667e-03</internalNodes>
+          <leafValues>
+            -1.4887580275535583e-01 5.1823489367961884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2793 2.0610638894140720e-03</internalNodes>
+          <leafValues>
+            -6.5545938909053802e-02 1.1345130205154419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2794 -6.0795281082391739e-02</internalNodes>
+          <leafValues>
+            -7.8219258785247803e-01 4.5540397986769676e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2795 -7.3096780106425285e-03</internalNodes>
+          <leafValues>
+            -1.9586810469627380e-01 3.5591870546340942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2796 -2.3796008899807930e-03</internalNodes>
+          <leafValues>
+            4.3329920619726181e-02 -6.0119420289993286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2797 -3.7874478846788406e-02</internalNodes>
+          <leafValues>
+            1.6700419783592224e-01 -4.1082471609115601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2798 -1.1011550202965736e-02</internalNodes>
+          <leafValues>
+            -7.9715803265571594e-02 3.2247040420770645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2799 -1.5278880018740892e-03</internalNodes>
+          <leafValues>
+            9.7541913390159607e-02 -9.4694830477237701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2800 3.7144418805837631e-02</internalNodes>
+          <leafValues>
+            -4.4054100289940834e-03 4.4159731268882751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2801 -4.9948949366807938e-02</internalNodes>
+          <leafValues>
+            -8.0400061607360840e-01 9.0302517637610435e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2802 -1.8558859825134277e-02</internalNodes>
+          <leafValues>
+            1.8556900322437286e-01 -2.6648480445146561e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>208</maxWeakCount>
+      <stageThreshold>-1.5900419950485229e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2803 5.9106469154357910e-02</internalNodes>
+          <leafValues>
+            -1.9395799934864044e-01 2.7272081375122070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2804 2.6784019544720650e-02</internalNodes>
+          <leafValues>
+            -4.2093229293823242e-01 1.2330240011215210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2805 8.6407009512186050e-03</internalNodes>
+          <leafValues>
+            -3.0236870050430298e-01 1.3153509795665741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2806 -1.1792869772762060e-03</internalNodes>
+          <leafValues>
+            8.2713536918163300e-02 -3.5140541195869446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2807 -2.2481461055576801e-03</internalNodes>
+          <leafValues>
+            -5.1323968172073364e-01 5.4614610970020294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2808 5.7527530007064342e-03</internalNodes>
+          <leafValues>
+            -1.9243009388446808e-01 1.3872030377388000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2809 1.0034020058810711e-02</internalNodes>
+          <leafValues>
+            6.0773681849241257e-02 -3.1631371378898621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2810 -3.2057110220193863e-03</internalNodes>
+          <leafValues>
+            1.3471069931983948e-01 -1.6333019733428955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2811 1.3803630135953426e-02</internalNodes>
+          <leafValues>
+            7.4590288102626801e-02 -2.7751418948173523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2812 -1.9213010370731354e-01</internalNodes>
+          <leafValues>
+            2.6890340447425842e-01 -6.6552907228469849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2813 -7.0279821753501892e-02</internalNodes>
+          <leafValues>
+            -3.2870158553123474e-01 4.9912039190530777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2814 3.1519670039415359e-02</internalNodes>
+          <leafValues>
+            3.5865701735019684e-02 -5.0489199161529541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2815 -1.1164420284330845e-02</internalNodes>
+          <leafValues>
+            -2.7422958612442017e-01 7.3949173092842102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2816 6.1416681855916977e-03</internalNodes>
+          <leafValues>
+            -8.7944798171520233e-02 1.5492740273475647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2817 2.5183141231536865e-01</internalNodes>
+          <leafValues>
+            -9.3605853617191315e-02 1.8827579915523529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2818 -1.9524399191141129e-02</internalNodes>
+          <leafValues>
+            -2.8733500838279724e-01 4.9147769808769226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2819 -2.1689489483833313e-02</internalNodes>
+          <leafValues>
+            -3.3415651321411133e-01 4.8450991511344910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2820 3.4099910408258438e-02</internalNodes>
+          <leafValues>
+            -1.4776800572872162e-01 1.1322359740734100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2821 -2.0377550274133682e-02</internalNodes>
+          <leafValues>
+            -2.9778409004211426e-01 5.6795541197061539e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2822 2.3986540734767914e-02</internalNodes>
+          <leafValues>
+            -5.5139839649200439e-02 3.5672488808631897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2823 -1.4578890055418015e-02</internalNodes>
+          <leafValues>
+            -3.3595868945121765e-01 4.9776330590248108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2824 -5.4530607303604484e-04</internalNodes>
+          <leafValues>
+            1.4906319975852966e-01 -1.2674619257450104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2825 3.0076410621404648e-03</internalNodes>
+          <leafValues>
+            -3.8654258847236633e-01 3.7338510155677795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2826 6.1654142336919904e-04</internalNodes>
+          <leafValues>
+            7.0350617170333862e-02 -2.7769538760185242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2827 5.1461078226566315e-02</internalNodes>
+          <leafValues>
+            2.7613859623670578e-02 -4.9107590317726135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2828 5.5607639253139496e-02</internalNodes>
+          <leafValues>
+            2.7626939117908478e-02 -2.9615479707717896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2829 2.9709029942750931e-02</internalNodes>
+          <leafValues>
+            6.5961636602878571e-02 -2.0508719980716705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2830 3.4046828746795654e-02</internalNodes>
+          <leafValues>
+            -3.8902580738067627e-02 2.4681000411510468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2831 2.4807849898934364e-02</internalNodes>
+          <leafValues>
+            3.5015519708395004e-02 -4.1401639580726624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2832 4.0748160332441330e-02</internalNodes>
+          <leafValues>
+            4.2967729270458221e-02 -3.2043859362602234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2833 1.0664659552276134e-02</internalNodes>
+          <leafValues>
+            5.6952890008687973e-02 -2.4745999276638031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2834 -6.3090369105339050e-02</internalNodes>
+          <leafValues>
+            1.6899240016937256e-01 -1.8692910671234131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2835 3.4371189773082733e-02</internalNodes>
+          <leafValues>
+            -4.7546751797199249e-02 3.2781639695167542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2836 -1.2518119812011719e-01</internalNodes>
+          <leafValues>
+            -5.6282979249954224e-01 1.3721459545195103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2837 -2.2273709997534752e-02</internalNodes>
+          <leafValues>
+            2.8452938795089722e-01 -4.7334741801023483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2838 3.1560619827359915e-03</internalNodes>
+          <leafValues>
+            6.7093066871166229e-02 -1.5777610242366791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2839 -8.5235182195901871e-03</internalNodes>
+          <leafValues>
+            -4.5404490828514099e-01 3.0238900333642960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2840 9.4529008492827415e-03</internalNodes>
+          <leafValues>
+            -5.5023040622472763e-02 1.4025360345840454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2841 -1.5268090181052685e-02</internalNodes>
+          <leafValues>
+            -4.1039389371871948e-01 3.3160910010337830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2842 1.0665830224752426e-02</internalNodes>
+          <leafValues>
+            -1.1716780066490173e-01 9.5943398773670197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2843 -1.8211569637060165e-02</internalNodes>
+          <leafValues>
+            -2.4850100278854370e-01 6.7713633179664612e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2844 2.9094598721712828e-04</internalNodes>
+          <leafValues>
+            4.9981009215116501e-02 -2.2298039495944977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2845 1.2524049961939454e-03</internalNodes>
+          <leafValues>
+            -2.3567390441894531e-01 6.0058139264583588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2846 -1.0200130194425583e-01</internalNodes>
+          <leafValues>
+            4.6817669272422791e-01 -1.4046870172023773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2847 -5.3803320974111557e-02</internalNodes>
+          <leafValues>
+            -3.8875138759613037e-01 3.8533151149749756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2848 3.5919819027185440e-02</internalNodes>
+          <leafValues>
+            1.7687749117612839e-02 -6.3149172067642212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2849 -9.9846003577113152e-03</internalNodes>
+          <leafValues>
+            2.3914399743080139e-01 -5.8490000665187836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2850 2.2157909348607063e-02</internalNodes>
+          <leafValues>
+            -4.4814221560955048e-02 1.9423240423202515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2851 -1.4240739867091179e-02</internalNodes>
+          <leafValues>
+            -3.7670499086380005e-01 3.4929048269987106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2852 -5.9150479733943939e-02</internalNodes>
+          <leafValues>
+            1.6816680133342743e-01 -3.5232000052928925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2853 3.6074228584766388e-02</internalNodes>
+          <leafValues>
+            2.2868489846587181e-02 -5.7828897237777710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2854 5.7692300528287888e-02</internalNodes>
+          <leafValues>
+            -2.1003179252147675e-02 3.0750969052314758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2855 -5.6619398295879364e-02</internalNodes>
+          <leafValues>
+            2.3383679986000061e-01 -5.5003248155117035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2856 -1.0697569698095322e-02</internalNodes>
+          <leafValues>
+            -1.3236419856548309e-01 9.1536827385425568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2857 4.2940411367453635e-04</internalNodes>
+          <leafValues>
+            5.2362058311700821e-02 -2.3470179736614227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2858 3.9490307681262493e-03</internalNodes>
+          <leafValues>
+            5.8583620935678482e-02 -8.2533597946166992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2859 2.9810430482029915e-02</internalNodes>
+          <leafValues>
+            7.1684047579765320e-02 -1.6931280493736267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2860 -1.1462910100817680e-02</internalNodes>
+          <leafValues>
+            -2.6410359144210815e-01 4.4687580317258835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2861 2.2996390238404274e-02</internalNodes>
+          <leafValues>
+            3.2992180436849594e-02 -3.4358990192413330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2862 -5.6792609393596649e-02</internalNodes>
+          <leafValues>
+            -7.5760507583618164e-01 2.4003670550882816e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2863 -4.4709402136504650e-03</internalNodes>
+          <leafValues>
+            1.6277609765529633e-01 -6.8193063139915466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2864 -1.2394989840686321e-02</internalNodes>
+          <leafValues>
+            -4.3603330850601196e-01 2.8416140004992485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2865 2.9185590147972107e-01</internalNodes>
+          <leafValues>
+            -3.3300530165433884e-02 3.9866968989372253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2866 3.3633329439908266e-03</internalNodes>
+          <leafValues>
+            -1.0972090065479279e-01 5.6931249797344208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2867 -3.5175260156393051e-02</internalNodes>
+          <leafValues>
+            -5.7213717699050903e-01 2.0903490483760834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2868 -1.2044839560985565e-02</internalNodes>
+          <leafValues>
+            9.1090522706508636e-02 -1.1947949975728989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2869 6.5466752275824547e-03</internalNodes>
+          <leafValues>
+            2.2512340545654297e-01 -5.8309450745582581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2870 -3.3635019790381193e-03</internalNodes>
+          <leafValues>
+            8.3123452961444855e-02 -1.6144299507141113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2871 -2.3451250046491623e-02</internalNodes>
+          <leafValues>
+            2.5118809938430786e-01 -4.8030331730842590e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2872 1.9356099888682365e-02</internalNodes>
+          <leafValues>
+            5.8134589344263077e-02 -2.0791250467300415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2873 -8.9994952082633972e-02</internalNodes>
+          <leafValues>
+            -7.5068491697311401e-01 1.4169859699904919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2874 1.2888260185718536e-02</internalNodes>
+          <leafValues>
+            3.3752571791410446e-02 -2.5715011358261108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2875 1.8961170688271523e-02</internalNodes>
+          <leafValues>
+            3.4717381000518799e-02 -3.6027848720550537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2876 -2.0835550501942635e-02</internalNodes>
+          <leafValues>
+            5.7851308584213257e-01 -2.2111309692263603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2877 1.0018779896199703e-02</internalNodes>
+          <leafValues>
+            -3.9775848388671875e-02 2.6814839243888855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2878 -8.7516820058226585e-03</internalNodes>
+          <leafValues>
+            1.1257819831371307e-01 -4.8538278788328171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2879 -6.2366750091314316e-02</internalNodes>
+          <leafValues>
+            -6.6089111566543579e-01 1.6852140426635742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2880 -1.9582180306315422e-02</internalNodes>
+          <leafValues>
+            -2.1182540059089661e-01 3.5702988505363464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2881 2.2675599902868271e-03</internalNodes>
+          <leafValues>
+            6.1212919652462006e-02 -2.0048849284648895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2882 -4.6558458358049393e-02</internalNodes>
+          <leafValues>
+            -5.6454938650131226e-01 9.2866625636816025e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2883 -7.7152079902589321e-03</internalNodes>
+          <leafValues>
+            1.5039919316768646e-01 -8.3328150212764740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2884 4.1551668196916580e-02</internalNodes>
+          <leafValues>
+            2.6247739791870117e-02 -3.2347521185874939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2885 -2.1789079532027245e-02</internalNodes>
+          <leafValues>
+            -3.2375821471214294e-01 3.1726188957691193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2886 1.9698198884725571e-03</internalNodes>
+          <leafValues>
+            -9.2564247548580170e-02 1.0823410004377365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2887 -5.2744988352060318e-03</internalNodes>
+          <leafValues>
+            -1.3990330696105957e-01 7.7120877802371979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2888 5.6007660925388336e-02</internalNodes>
+          <leafValues>
+            -1.0328499972820282e-01 1.1455559730529785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2889 2.2741030156612396e-01</internalNodes>
+          <leafValues>
+            1.6028450801968575e-02 -6.8145108222961426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2890 5.1362380385398865e-02</internalNodes>
+          <leafValues>
+            -2.3025810718536377e-02 1.5446029603481293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2891 -1.3017069548368454e-02</internalNodes>
+          <leafValues>
+            -3.2606399059295654e-01 3.2892610877752304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2892 1.5782029926776886e-01</internalNodes>
+          <leafValues>
+            -3.9765262044966221e-03 7.7765262126922607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2893 -9.9805086851119995e-02</internalNodes>
+          <leafValues>
+            6.8609541654586792e-01 -1.4648180454969406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2894 3.7506350874900818e-01</internalNodes>
+          <leafValues>
+            1.4925800263881683e-02 -8.3105468750000000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2895 -7.9828302841633558e-04</internalNodes>
+          <leafValues>
+            -2.0161899924278259e-01 4.7897689044475555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2896 -2.1241609752178192e-01</internalNodes>
+          <leafValues>
+            -3.4409451484680176e-01 1.0950430296361446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2897 3.9451681077480316e-02</internalNodes>
+          <leafValues>
+            1.3966959901154041e-02 -7.2163110971450806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2898 -2.9185509309172630e-02</internalNodes>
+          <leafValues>
+            -2.7462458610534668e-01 3.5496920347213745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2899 2.7055600658059120e-02</internalNodes>
+          <leafValues>
+            -4.6995740383863449e-02 2.9289430379867554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2900 -2.6052350178360939e-02</internalNodes>
+          <leafValues>
+            2.0752039551734924e-01 -3.6353081464767456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2901 5.7216219604015350e-02</internalNodes>
+          <leafValues>
+            1.8895739689469337e-02 -5.7143908739089966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2902 -1.7151840031147003e-02</internalNodes>
+          <leafValues>
+            -3.3009570837020874e-01 3.8528628647327423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2903 -1.2304399907588959e-01</internalNodes>
+          <leafValues>
+            -7.8316390514373779e-01 1.1679390445351601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2904 5.6786160916090012e-02</internalNodes>
+          <leafValues>
+            1.1063819751143456e-02 -5.3526097536087036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2905 1.1942840367555618e-01</internalNodes>
+          <leafValues>
+            9.5137851312756538e-03 -9.0637218952178955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2906 6.7707143723964691e-02</internalNodes>
+          <leafValues>
+            -3.9227519184350967e-02 2.8176560997962952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2907 -5.4918881505727768e-02</internalNodes>
+          <leafValues>
+            -6.2061691284179688e-01 1.6072269529104233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2908 9.2878006398677826e-03</internalNodes>
+          <leafValues>
+            -5.0339490175247192e-02 1.9040100276470184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2909 -1.3141489587724209e-02</internalNodes>
+          <leafValues>
+            1.8629829585552216e-01 -7.5528547167778015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2910 2.9876120970584452e-04</internalNodes>
+          <leafValues>
+            -1.6163469851016998e-01 5.3589500486850739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2911 1.0153599828481674e-01</internalNodes>
+          <leafValues>
+            1.8458279967308044e-01 -6.2570616602897644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2912 2.7205729484558105e-01</internalNodes>
+          <leafValues>
+            1.3762479647994041e-02 -4.9364060163497925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2913 5.8730211108922958e-02</internalNodes>
+          <leafValues>
+            -2.3933680355548859e-01 7.9166807234287262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2914 1.9694259390234947e-02</internalNodes>
+          <leafValues>
+            3.7195280194282532e-02 -2.6109260320663452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2915 -1.0566900164121762e-04</internalNodes>
+          <leafValues>
+            6.7052997648715973e-02 -1.6515819728374481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2916 -1.9761279225349426e-02</internalNodes>
+          <leafValues>
+            8.6443692445755005e-02 -6.8657971918582916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2917 5.3168509155511856e-02</internalNodes>
+          <leafValues>
+            2.9767790809273720e-02 -3.5225778818130493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2918 2.6071069762110710e-02</internalNodes>
+          <leafValues>
+            2.5216359645128250e-02 -1.4159369468688965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2919 -2.8720689937472343e-02</internalNodes>
+          <leafValues>
+            3.5941401124000549e-01 -2.9199620708823204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2920 1.2989250011742115e-02</internalNodes>
+          <leafValues>
+            4.0009770542383194e-02 -1.9973039627075195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2921 -5.8176040649414062e-02</internalNodes>
+          <leafValues>
+            2.9345899820327759e-01 -4.3967530131340027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2922 2.8285140171647072e-02</internalNodes>
+          <leafValues>
+            3.7457428872585297e-02 -3.1361749768257141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2923 4.2701218277215958e-02</internalNodes>
+          <leafValues>
+            -2.0987769588828087e-02 5.0845777988433838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2924 2.4763600900769234e-02</internalNodes>
+          <leafValues>
+            -1.1869250237941742e-01 9.4457350671291351e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2925 -2.8076129965484142e-03</internalNodes>
+          <leafValues>
+            -2.3249779641628265e-01 4.5222718268632889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2926 -7.5583919882774353e-02</internalNodes>
+          <leafValues>
+            -4.5907029509544373e-01 1.2932280078530312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2927 8.3796821534633636e-02</internalNodes>
+          <leafValues>
+            -1.5801630914211273e-02 6.8670481443405151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2928 -3.7072401493787766e-02</internalNodes>
+          <leafValues>
+            5.4146029055118561e-02 -4.2207449674606323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2929 2.4691069498658180e-02</internalNodes>
+          <leafValues>
+            2.6097679510712624e-02 -3.7760400772094727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2930 -2.7743929997086525e-02</internalNodes>
+          <leafValues>
+            -7.8631508350372314e-01 4.7534159384667873e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2931 1.9119970500469208e-02</internalNodes>
+          <leafValues>
+            2.6497760787606239e-02 -3.6489969491958618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2932 3.3773269969969988e-03</internalNodes>
+          <leafValues>
+            3.1966090202331543e-02 -3.2346761226654053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2933 1.9876819103956223e-02</internalNodes>
+          <leafValues>
+            -3.5128418356180191e-02 2.9078298807144165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2934 1.0035640001296997e-01</internalNodes>
+          <leafValues>
+            1.4607840217649937e-02 -5.2812242507934570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2935 -1.6163289546966553e-02</internalNodes>
+          <leafValues>
+            -1.0158140212297440e-01 1.1796499788761139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2936 1.0253380052745342e-02</internalNodes>
+          <leafValues>
+            3.6024410277605057e-02 -1.6520780324935913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2937 9.0665705502033234e-03</internalNodes>
+          <leafValues>
+            -3.4731701016426086e-02 3.7327200174331665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2938 3.0124900862574577e-02</internalNodes>
+          <leafValues>
+            5.1758479326963425e-02 -2.3582160472869873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2939 -6.6870311275124550e-03</internalNodes>
+          <leafValues>
+            4.3394241482019424e-02 -2.5202989578247070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2940 -2.0257479045540094e-03</internalNodes>
+          <leafValues>
+            -1.2479010224342346e-01 3.9309531450271606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2941 2.3254070430994034e-02</internalNodes>
+          <leafValues>
+            -4.7446910291910172e-02 2.3287700116634369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2942 2.3867199197411537e-02</internalNodes>
+          <leafValues>
+            -2.7421670034527779e-02 1.4630970358848572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2943 -4.0523000061511993e-02</internalNodes>
+          <leafValues>
+            -4.0472960472106934e-01 3.0415959656238556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2944 1.9958209991455078e-01</internalNodes>
+          <leafValues>
+            2.2049469873309135e-02 -4.6558481454849243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2945 -1.2990590184926987e-02</internalNodes>
+          <leafValues>
+            -1.7970620095729828e-01 5.8874938637018204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2946 2.5623949244618416e-02</internalNodes>
+          <leafValues>
+            9.9402610212564468e-03 -2.6575279235839844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2947 -3.2004870474338531e-02</internalNodes>
+          <leafValues>
+            2.5087380409240723e-01 -4.6291470527648926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2948 1.8758419901132584e-02</internalNodes>
+          <leafValues>
+            -2.2038230672478676e-02 9.4407431781291962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2949 4.5425668358802795e-02</internalNodes>
+          <leafValues>
+            2.3371569812297821e-02 -4.8393398523330688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2950 1.5670580789446831e-02</internalNodes>
+          <leafValues>
+            -5.5109858512878418e-02 1.9907830655574799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2951 5.1336981356143951e-02</internalNodes>
+          <leafValues>
+            2.6425419375300407e-02 -4.4082790613174438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2952 4.0884170681238174e-02</internalNodes>
+          <leafValues>
+            2.0071209967136383e-01 -3.4887779504060745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2953 6.9165557622909546e-02</internalNodes>
+          <leafValues>
+            -2.9303310438990593e-02 3.4936821460723877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2954 4.7967158257961273e-02</internalNodes>
+          <leafValues>
+            -2.4416960775852203e-02 2.7018651366233826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2955 4.4068440794944763e-02</internalNodes>
+          <leafValues>
+            -4.0497269481420517e-02 2.4382269382476807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2956 -1.0287550091743469e-01</internalNodes>
+          <leafValues>
+            7.1105289459228516e-01 -9.9055245518684387e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2957 2.2407740354537964e-01</internalNodes>
+          <leafValues>
+            -5.4946999996900558e-02 1.9853439927101135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2958 -9.6570551395416260e-03</internalNodes>
+          <leafValues>
+            -2.5050228834152222e-01 3.7410989403724670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2959 7.9199701547622681e-02</internalNodes>
+          <leafValues>
+            -2.2147569805383682e-02 4.8771071434020996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2960 4.5983199030160904e-02</internalNodes>
+          <leafValues>
+            8.2229733467102051e-02 -3.9335750043392181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2961 4.2670449614524841e-01</internalNodes>
+          <leafValues>
+            1.7132800072431564e-02 -5.3996258974075317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2962 1.5413990616798401e-01</internalNodes>
+          <leafValues>
+            1.1902350001037121e-02 -6.8533718585968018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2963 -1.7699889838695526e-01</internalNodes>
+          <leafValues>
+            -6.3113832473754883e-01 1.2545200064778328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2964 -2.3769829422235489e-02</internalNodes>
+          <leafValues>
+            -1.4281429350376129e-01 1.4284349977970123e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2965 -8.3290286362171173e-02</internalNodes>
+          <leafValues>
+            3.6433398723602295e-01 -2.5287430733442307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2966 -3.0276349280029535e-03</internalNodes>
+          <leafValues>
+            -1.7501260340213776e-01 3.5528600215911865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2967 9.3518232461065054e-04</internalNodes>
+          <leafValues>
+            -3.4317269921302795e-01 2.8196020051836967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2968 8.6792530491948128e-03</internalNodes>
+          <leafValues>
+            9.1854788362979889e-02 -1.1349800229072571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2969 -4.3289531022310257e-03</internalNodes>
+          <leafValues>
+            7.6560527086257935e-02 -1.2850379943847656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2970 6.1485089361667633e-02</internalNodes>
+          <leafValues>
+            4.0065501816570759e-03 -4.2798730731010437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2971 -2.3108569905161858e-02</internalNodes>
+          <leafValues>
+            -3.2999789714813232e-01 3.1228100880980492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2972 -6.3490739557892084e-04</internalNodes>
+          <leafValues>
+            5.3318761289119720e-02 -6.0307938605546951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2973 -4.1278889402747154e-03</internalNodes>
+          <leafValues>
+            1.5029670298099518e-01 -8.9805796742439270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2974 1.5408970415592194e-01</internalNodes>
+          <leafValues>
+            -2.3309229873120785e-03 9.6946477890014648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2975 1.8083740025758743e-02</internalNodes>
+          <leafValues>
+            -4.6674519777297974e-02 2.1941949427127838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2976 -6.0022968798875809e-02</internalNodes>
+          <leafValues>
+            3.7283098697662354e-01 -1.3637940399348736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2977 -1.6025049984455109e-01</internalNodes>
+          <leafValues>
+            3.9442360401153564e-01 -2.4808609858155251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2978 -2.3220200091600418e-02</internalNodes>
+          <leafValues>
+            -2.8352069854736328e-01 3.8456469774246216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2979 3.2353829592466354e-02</internalNodes>
+          <leafValues>
+            3.0197540298104286e-02 -3.5371699929237366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2980 -1.2930749915540218e-02</internalNodes>
+          <leafValues>
+            -1.8275280296802521e-01 4.0219429880380630e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2981 -2.9022840317338705e-03</internalNodes>
+          <leafValues>
+            5.7583440095186234e-02 -1.8175080418586731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2982 3.7042409181594849e-02</internalNodes>
+          <leafValues>
+            2.3471569642424583e-02 -3.7222048640251160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2983 -1.4371460676193237e-01</internalNodes>
+          <leafValues>
+            -6.7353278398513794e-01 1.3768459670245647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2984 -1.0714099742472172e-02</internalNodes>
+          <leafValues>
+            2.3074600100517273e-01 -5.9898581355810165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2985 1.1370699852705002e-02</internalNodes>
+          <leafValues>
+            -5.5859100073575974e-02 2.1604159474372864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2986 -3.3829350024461746e-02</internalNodes>
+          <leafValues>
+            -3.2868561148643494e-01 1.6743719577789307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2987 3.6406058818101883e-02</internalNodes>
+          <leafValues>
+            2.3512810468673706e-02 -4.7999539971351624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2988 -3.9853308349847794e-02</internalNodes>
+          <leafValues>
+            3.0388408899307251e-01 -2.2388210520148277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2989 2.3857640102505684e-02</internalNodes>
+          <leafValues>
+            -4.3960139155387878e-02 2.5021830201148987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2990 -8.6149327456951141e-02</internalNodes>
+          <leafValues>
+            -9.2641222476959229e-01 1.0180849581956863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2991 -2.7360459789633751e-02</internalNodes>
+          <leafValues>
+            -4.5331078767776489e-01 1.8517250195145607e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2992 4.6891667880117893e-03</internalNodes>
+          <leafValues>
+            1.4983110129833221e-02 -9.8690867424011230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2993 3.6140959709882736e-02</internalNodes>
+          <leafValues>
+            2.1240329369902611e-02 -4.2275610566139221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2994 1.0714419931173325e-01</internalNodes>
+          <leafValues>
+            -4.1592169553041458e-02 2.4880869686603546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2995 -1.2024450115859509e-02</internalNodes>
+          <leafValues>
+            -1.8906030058860779e-01 5.5290900170803070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2996 2.1671090275049210e-02</internalNodes>
+          <leafValues>
+            -3.7164088338613510e-02 2.9896330833435059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2997 -3.3205719664692879e-03</internalNodes>
+          <leafValues>
+            -9.1837689280509949e-02 1.1810839921236038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2998 -8.4256403148174286e-02</internalNodes>
+          <leafValues>
+            -5.4935282468795776e-01 4.6934271231293678e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2999 -2.7107410132884979e-03</internalNodes>
+          <leafValues>
+            5.2301179617643356e-02 -2.1932560205459595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3000 -1.9661630503833294e-03</internalNodes>
+          <leafValues>
+            6.9522850215435028e-02 -1.2369599938392639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3001 1.0835859924554825e-01</internalNodes>
+          <leafValues>
+            -1.6028439626097679e-02 6.7538297176361084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3002 -4.0661569684743881e-02</internalNodes>
+          <leafValues>
+            2.8239870071411133e-01 -1.8643079325556755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3003 9.4869043678045273e-03</internalNodes>
+          <leafValues>
+            -1.4204730093479156e-01 7.4218176305294037e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3004 -8.1196203827857971e-03</internalNodes>
+          <leafValues>
+            1.2733109295368195e-01 -7.5325429439544678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3005 -3.6718908697366714e-02</internalNodes>
+          <leafValues>
+            2.5209701061248779e-01 -3.8642361760139465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3006 4.2515851557254791e-02</internalNodes>
+          <leafValues>
+            3.4613508731126785e-02 -3.1406149268150330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3007 -1.6484249383211136e-02</internalNodes>
+          <leafValues>
+            -3.4622931480407715e-01 2.6470340788364410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3008 1.8608599901199341e-02</internalNodes>
+          <leafValues>
+            3.1125839799642563e-02 -2.3837919533252716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3009 -1.0872060433030128e-02</internalNodes>
+          <leafValues>
+            2.3061220347881317e-01 -4.3469380587339401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3010 -4.0728081017732620e-02</internalNodes>
+          <leafValues>
+            1.3258880376815796e-01 -3.8833290338516235e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>240</maxWeakCount>
+      <stageThreshold>-1.3404430150985718e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3011 2.7802670374512672e-02</internalNodes>
+          <leafValues>
+            -1.8535159528255463e-01 2.3777860403060913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3012 1.6392730176448822e-03</internalNodes>
+          <leafValues>
+            -2.6787629723548889e-01 1.1733309924602509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3013 -3.0419689137488604e-03</internalNodes>
+          <leafValues>
+            1.9552859663963318e-01 -1.3240019977092743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3014 -2.7744288672693074e-04</internalNodes>
+          <leafValues>
+            6.0701820999383926e-02 -3.0465421080589294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3015 -2.7942769229412079e-03</internalNodes>
+          <leafValues>
+            -2.5370940566062927e-01 7.6147846877574921e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3016 7.4005699716508389e-03</internalNodes>
+          <leafValues>
+            6.5623492002487183e-02 -3.0128520727157593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3017 1.1316470336169004e-03</internalNodes>
+          <leafValues>
+            -1.3232930004596710e-01 1.3622519373893738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3018 -8.7306648492813110e-03</internalNodes>
+          <leafValues>
+            -1.0246229916810989e-01 1.0649880394339561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3019 -6.4327879808843136e-03</internalNodes>
+          <leafValues>
+            -2.1301789581775665e-01 7.7425397932529449e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3020 -1.3303949963301420e-03</internalNodes>
+          <leafValues>
+            9.6234247088432312e-02 -1.7086009681224823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3021 -2.3770590778440237e-03</internalNodes>
+          <leafValues>
+            1.1657089740037918e-01 -1.5135769546031952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3022 -5.3865360096096992e-03</internalNodes>
+          <leafValues>
+            -1.6851960122585297e-01 4.4324558228254318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3023 -5.6973858736455441e-03</internalNodes>
+          <leafValues>
+            -2.4702399969100952e-01 7.7735342085361481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3024 4.5654520392417908e-02</internalNodes>
+          <leafValues>
+            -1.6687670722603798e-02 1.4222119748592377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3025 -1.4929420103726443e-05</internalNodes>
+          <leafValues>
+            -3.2725390791893005e-01 4.8142101615667343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3026 -1.7635900294408202e-03</internalNodes>
+          <leafValues>
+            7.0115849375724792e-02 -1.6864499077200890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3027 1.9133860478177667e-03</internalNodes>
+          <leafValues>
+            -1.9570820033550262e-01 9.0169131755828857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3028 -1.9309469498693943e-03</internalNodes>
+          <leafValues>
+            1.1824289709329605e-01 -1.2146709859371185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3029 9.7775761969387531e-04</internalNodes>
+          <leafValues>
+            1.1657200008630753e-01 -1.2770849466323853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3030 -5.2643800154328346e-03</internalNodes>
+          <leafValues>
+            1.9958360493183136e-01 -6.2928676605224609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3031 -2.2730689961463213e-03</internalNodes>
+          <leafValues>
+            -2.1804699301719666e-01 6.6565290093421936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3032 -3.5128789022564888e-03</internalNodes>
+          <leafValues>
+            8.1114247441291809e-02 -1.4230330288410187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3033 2.8102330397814512e-03</internalNodes>
+          <leafValues>
+            6.0884710401296616e-02 -2.2008429467678070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3034 -2.3211359977722168e-02</internalNodes>
+          <leafValues>
+            2.3182259500026703e-01 -3.4014280885457993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3035 -8.7068388238549232e-03</internalNodes>
+          <leafValues>
+            -2.0691269636154175e-01 6.8004116415977478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3036 7.0584798231720924e-03</internalNodes>
+          <leafValues>
+            -1.0500799864530563e-01 1.2610189616680145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3037 -6.8878240883350372e-02</internalNodes>
+          <leafValues>
+            4.2687618732452393e-01 -3.1305618584156036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3038 -1.2785149738192558e-02</internalNodes>
+          <leafValues>
+            -2.0268030464649200e-01 3.2005790621042252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3039 -4.2242300696671009e-03</internalNodes>
+          <leafValues>
+            -2.1619689464569092e-01 7.5660832226276398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3040 -4.1660640388727188e-02</internalNodes>
+          <leafValues>
+            3.5601380467414856e-01 -3.6500900983810425e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3041 1.4983239583671093e-02</internalNodes>
+          <leafValues>
+            3.3663559705018997e-02 -4.3016681075096130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3042 1.8940219888463616e-03</internalNodes>
+          <leafValues>
+            -7.7785640954971313e-02 1.4130039513111115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3043 -1.0271830251440406e-03</internalNodes>
+          <leafValues>
+            6.1292048543691635e-02 -1.8569129705429077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3044 -1.0491760447621346e-02</internalNodes>
+          <leafValues>
+            -2.1280039846897125e-01 4.6641569584608078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3045 4.1263508610427380e-03</internalNodes>
+          <leafValues>
+            -6.3113473355770111e-02 2.1683399379253387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3046 2.1284529939293861e-02</internalNodes>
+          <leafValues>
+            -1.9541380926966667e-02 4.0555500984191895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3047 6.0370927676558495e-03</internalNodes>
+          <leafValues>
+            6.1322800815105438e-02 -1.7558750510215759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3048 2.8550080023705959e-03</internalNodes>
+          <leafValues>
+            -3.7402968853712082e-02 8.6794376373291016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3049 -3.0839299783110619e-02</internalNodes>
+          <leafValues>
+            4.5826399326324463e-01 -2.2824319079518318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3050 -1.2664640322327614e-02</internalNodes>
+          <leafValues>
+            -1.5179179608821869e-01 3.8325909525156021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3051 8.4788333624601364e-03</internalNodes>
+          <leafValues>
+            -7.9164452850818634e-02 1.3821309804916382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3052 -9.0271160006523132e-03</internalNodes>
+          <leafValues>
+            2.0483429729938507e-01 -5.8428239077329636e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3053 -5.3999028168618679e-03</internalNodes>
+          <leafValues>
+            -1.9563870131969452e-01 6.2881819903850555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3054 4.8698568716645241e-03</internalNodes>
+          <leafValues>
+            4.7269448637962341e-02 -2.0357230305671692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3055 -5.6715728715062141e-03</internalNodes>
+          <leafValues>
+            1.6232620179653168e-01 -7.2473183274269104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3056 -6.3621107256039977e-04</internalNodes>
+          <leafValues>
+            -1.7648829519748688e-01 6.1553929001092911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3057 -5.7404721155762672e-03</internalNodes>
+          <leafValues>
+            -2.3773890733718872e-01 4.8493091017007828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3058 2.3313059937208891e-03</internalNodes>
+          <leafValues>
+            -9.8087467253208160e-02 7.6705731451511383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3059 2.6579289697110653e-03</internalNodes>
+          <leafValues>
+            -1.0429590195417404e-01 1.3275440037250519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3060 -1.2426489964127541e-02</internalNodes>
+          <leafValues>
+            -1.7686119675636292e-01 7.8797861933708191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3061 3.7596069741994143e-03</internalNodes>
+          <leafValues>
+            5.8028500527143478e-02 -2.0235699415206909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3062 -1.3941819779574871e-02</internalNodes>
+          <leafValues>
+            2.9365628957748413e-01 -3.1069029122591019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3063 2.4605529382824898e-02</internalNodes>
+          <leafValues>
+            -4.9767840653657913e-02 2.0446600019931793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3064 1.1572279781103134e-01</internalNodes>
+          <leafValues>
+            5.7542040012776852e-03 -5.5789208412170410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3065 1.4880299568176270e-03</internalNodes>
+          <leafValues>
+            -1.2870499491691589e-01 8.6191363632678986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3066 -1.0085869580507278e-02</internalNodes>
+          <leafValues>
+            -1.8718029558658600e-01 2.7143789455294609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3067 -4.0125781670212746e-03</internalNodes>
+          <leafValues>
+            -1.4843569695949554e-01 6.1482351273298264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3068 4.5241288840770721e-02</internalNodes>
+          <leafValues>
+            -2.2187199443578720e-02 4.9022749066352844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3069 -5.4588477360084653e-04</internalNodes>
+          <leafValues>
+            1.0740750283002853e-01 -9.4784751534461975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3070 1.0822109878063202e-02</internalNodes>
+          <leafValues>
+            -1.1820139735937119e-01 8.4009647369384766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3071 6.4339267555624247e-04</internalNodes>
+          <leafValues>
+            -1.1072149872779846e-01 8.4126397967338562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3072 9.3544989824295044e-02</internalNodes>
+          <leafValues>
+            6.1726439744234085e-03 -3.8121530413627625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3073 -3.9214221760630608e-03</internalNodes>
+          <leafValues>
+            1.2969920039176941e-01 -7.5530029833316803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3074 -4.5141312293708324e-03</internalNodes>
+          <leafValues>
+            -2.1222509443759918e-01 5.0941351801156998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3075 5.1563870161771774e-02</internalNodes>
+          <leafValues>
+            1.1215999722480774e-02 -8.4125047922134399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3076 -3.7086829543113708e-02</internalNodes>
+          <leafValues>
+            -3.3443790674209595e-01 1.2198350392282009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3077 -1.5274320030584931e-03</internalNodes>
+          <leafValues>
+            1.7022849619388580e-01 -5.3171109408140182e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3078 -3.3183719497174025e-03</internalNodes>
+          <leafValues>
+            1.4972689747810364e-01 -3.9522700011730194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3079 -1.0695139877498150e-02</internalNodes>
+          <leafValues>
+            -2.0767690241336823e-01 4.8223540186882019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3080 8.0909933894872665e-03</internalNodes>
+          <leafValues>
+            -5.5572569370269775e-02 8.1361941993236542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3081 8.9193560415878892e-04</internalNodes>
+          <leafValues>
+            -1.4888229966163635e-01 5.6974019855260849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3082 2.1180939802434295e-04</internalNodes>
+          <leafValues>
+            -1.8776890635490417e-01 4.5087080448865891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3083 6.8865409120917320e-03</internalNodes>
+          <leafValues>
+            -7.4651539325714111e-02 1.1806459724903107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3084 3.8009819388389587e-01</internalNodes>
+          <leafValues>
+            9.6241412684321404e-03 -5.0257128477096558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3085 9.4844900071620941e-02</internalNodes>
+          <leafValues>
+            2.0284110680222511e-02 -3.9478880167007446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3086 -1.1133160296594724e-04</internalNodes>
+          <leafValues>
+            5.3717028349637985e-02 -1.5433239936828613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3087 3.5911630839109421e-02</internalNodes>
+          <leafValues>
+            -2.4374049156904221e-02 3.5077759623527527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3088 -2.9291780665516853e-02</internalNodes>
+          <leafValues>
+            -4.9002739787101746e-01 2.1694840863347054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3089 -2.4277189746499062e-02</internalNodes>
+          <leafValues>
+            -5.0206911563873291e-01 1.5807420015335083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3090 1.2620110064744949e-02</internalNodes>
+          <leafValues>
+            -4.8637848347425461e-02 2.1370050311088562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3091 -4.1045118123292923e-03</internalNodes>
+          <leafValues>
+            -1.6757939755916595e-01 6.2675923109054565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3092 -2.3477169871330261e-01</internalNodes>
+          <leafValues>
+            6.2205511331558228e-01 -1.3949319720268250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3093 -6.7914247512817383e-02</internalNodes>
+          <leafValues>
+            -9.7014141082763672e-01 1.0490460321307182e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3094 1.4207609929144382e-03</internalNodes>
+          <leafValues>
+            -6.0801118612289429e-02 1.3500739634037018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3095 -5.0894408486783504e-03</internalNodes>
+          <leafValues>
+            -1.6992169618606567e-01 5.0795670598745346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3096 -1.9226800650358200e-02</internalNodes>
+          <leafValues>
+            9.8861172795295715e-02 -3.3686220645904541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3097 1.0590540245175362e-02</internalNodes>
+          <leafValues>
+            5.9616900980472565e-02 -1.6495449841022491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3098 3.3726880792528391e-03</internalNodes>
+          <leafValues>
+            -3.8652341812849045e-02 5.5400568991899490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3099 -8.9012801647186279e-02</internalNodes>
+          <leafValues>
+            4.0750509500503540e-01 -2.4150330573320389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3100 -2.3359079658985138e-01</internalNodes>
+          <leafValues>
+            -7.2641909122467041e-01 6.5185138955712318e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3101 -2.2732259333133698e-01</internalNodes>
+          <leafValues>
+            -8.9977008104324341e-01 9.1146891936659813e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3102 -2.9601769521832466e-02</internalNodes>
+          <leafValues>
+            -4.3270850181579590e-01 1.6021190211176872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3103 -6.9494689814746380e-03</internalNodes>
+          <leafValues>
+            1.5218999981880188e-01 -6.1896830797195435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3104 -1.9150479929521680e-03</internalNodes>
+          <leafValues>
+            7.2570547461509705e-02 -1.3121089339256287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3105 8.5106380283832550e-03</internalNodes>
+          <leafValues>
+            -5.7326089590787888e-02 1.5743100643157959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3106 -2.4363139644265175e-02</internalNodes>
+          <leafValues>
+            9.5700822770595551e-02 -5.8364428579807281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3107 -2.2522659972310066e-02</internalNodes>
+          <leafValues>
+            -4.6943131089210510e-01 2.0241359248757362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3108 -4.4660381972789764e-03</internalNodes>
+          <leafValues>
+            7.6211109757423401e-02 -8.1844657659530640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3109 -4.2101819999516010e-03</internalNodes>
+          <leafValues>
+            -2.2083589434623718e-01 4.7010198235511780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3110 5.7130381464958191e-03</internalNodes>
+          <leafValues>
+            -6.2254000455141068e-02 5.2705820649862289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3111 -5.6021669879555702e-03</internalNodes>
+          <leafValues>
+            -1.8985760211944580e-01 5.0114821642637253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3112 -2.2042069584131241e-02</internalNodes>
+          <leafValues>
+            8.7683752179145813e-02 -2.4777179583907127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3113 -2.1817081142216921e-03</internalNodes>
+          <leafValues>
+            1.6766600310802460e-01 -6.6771760582923889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3114 2.4545300751924515e-02</internalNodes>
+          <leafValues>
+            4.9205120652914047e-02 -2.2503720223903656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3115 -2.4728688877075911e-03</internalNodes>
+          <leafValues>
+            1.3539670407772064e-01 -6.2330130487680435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3116 2.3717728909105062e-03</internalNodes>
+          <leafValues>
+            5.7926058769226074e-02 -1.3325250148773193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3117 -3.8999661803245544e-02</internalNodes>
+          <leafValues>
+            2.9875481128692627e-01 -3.0257239937782288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3118 -1.7835620092228055e-03</internalNodes>
+          <leafValues>
+            9.2680282890796661e-02 -7.4350588023662567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3119 1.9984450191259384e-02</internalNodes>
+          <leafValues>
+            2.2409349679946899e-02 -4.1501939296722412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3120 4.1170548647642136e-03</internalNodes>
+          <leafValues>
+            5.3432278335094452e-02 -1.5092259645462036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3121 4.3995600193738937e-02</internalNodes>
+          <leafValues>
+            1.1389889754354954e-02 -6.6494518518447876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3122 -3.5350578837096691e-03</internalNodes>
+          <leafValues>
+            1.1005590111017227e-01 -7.6377056539058685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3123 1.4632029924541712e-03</internalNodes>
+          <leafValues>
+            -5.6962151080369949e-02 1.3184599578380585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3124 -4.9925539642572403e-03</internalNodes>
+          <leafValues>
+            -1.4675070345401764e-01 5.5129978805780411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3125 -7.8646428883075714e-02</internalNodes>
+          <leafValues>
+            -5.2768182754516602e-01 1.3662739656865597e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3126 -4.3559111654758453e-03</internalNodes>
+          <leafValues>
+            9.1798119246959686e-02 -5.7598169893026352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3127 8.2531487569212914e-03</internalNodes>
+          <leafValues>
+            -6.5613977611064911e-02 1.3083070516586304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3128 -3.5033349413424730e-03</internalNodes>
+          <leafValues>
+            -1.2742599844932556e-01 6.0875169932842255e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3129 3.9662471972405910e-03</internalNodes>
+          <leafValues>
+            -5.5715151131153107e-02 1.4783249795436859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3130 -1.0260219685733318e-02</internalNodes>
+          <leafValues>
+            -1.3472290337085724e-01 4.4514350593090057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3131 3.6724930396303535e-04</internalNodes>
+          <leafValues>
+            -1.3727700710296631e-01 6.1179649084806442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3132 1.9500199705362320e-02</internalNodes>
+          <leafValues>
+            -5.9033330529928207e-02 1.5589320659637451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3133 1.4041420072317123e-02</internalNodes>
+          <leafValues>
+            2.2140439599752426e-02 -4.2831090092658997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3134 3.8459740579128265e-02</internalNodes>
+          <leafValues>
+            1.6875730827450752e-02 -5.2425742149353027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3135 -2.5901539251208305e-02</internalNodes>
+          <leafValues>
+            2.5163099169731140e-01 -3.2579511404037476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3136 2.8264479711651802e-02</internalNodes>
+          <leafValues>
+            2.1297719329595566e-02 -2.3978309333324432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3137 -5.3067881613969803e-02</internalNodes>
+          <leafValues>
+            7.6594692468643188e-01 -1.0163240134716034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3138 1.6842440236359835e-03</internalNodes>
+          <leafValues>
+            4.0168728679418564e-02 -2.1810980141162872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3139 6.5255112713202834e-04</internalNodes>
+          <leafValues>
+            -3.2155249267816544e-02 2.6028048992156982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3140 -1.5381099283695221e-01</internalNodes>
+          <leafValues>
+            -7.9570180177688599e-01 9.9420538172125816e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3141 -1.7530319746583700e-04</internalNodes>
+          <leafValues>
+            6.1257161200046539e-02 -1.1830890178680420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3142 1.1829809518530965e-03</internalNodes>
+          <leafValues>
+            -8.2589529454708099e-02 5.8234758675098419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3143 1.4753890223801136e-02</internalNodes>
+          <leafValues>
+            4.6728778630495071e-02 -1.9874340295791626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3144 1.0592579841613770e-02</internalNodes>
+          <leafValues>
+            -5.7157158851623535e-02 1.2261729687452316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3145 -4.6638969331979752e-02</internalNodes>
+          <leafValues>
+            3.9221999049186707e-01 -1.8770450726151466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3146 -2.2761020809412003e-03</internalNodes>
+          <leafValues>
+            -1.9819819927215576e-01 3.2669950276613235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3147 -8.9252636826131493e-05</internalNodes>
+          <leafValues>
+            -1.7795699834823608e-01 4.5088160783052444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3148 -4.8888921737670898e-03</internalNodes>
+          <leafValues>
+            3.7973329424858093e-01 -2.5622500106692314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3149 -4.7039450146257877e-03</internalNodes>
+          <leafValues>
+            -1.4075440168380737e-01 5.1885869354009628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3150 6.8887867964804173e-03</internalNodes>
+          <leafValues>
+            -6.0707900673151016e-02 6.7318782210350037e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3151 9.4449967145919800e-02</internalNodes>
+          <leafValues>
+            -4.3975159525871277e-02 1.6885830461978912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3152 5.1520671695470810e-02</internalNodes>
+          <leafValues>
+            3.8239071145653725e-03 -6.3077712059020996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3153 6.3957129605114460e-03</internalNodes>
+          <leafValues>
+            4.4094309210777283e-02 -1.8156020343303680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3154 -4.9659270793199539e-02</internalNodes>
+          <leafValues>
+            1.1174239963293076e-01 -5.5821210145950317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3155 -6.9081829860806465e-03</internalNodes>
+          <leafValues>
+            -1.4038950204849243e-01 5.9535760432481766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3156 9.2546567320823669e-03</internalNodes>
+          <leafValues>
+            -3.3587910234928131e-02 5.8593101799488068e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3157 5.0454521551728249e-03</internalNodes>
+          <leafValues>
+            5.3777661174535751e-02 -1.3626030087471008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3158 -3.3333420753479004e-02</internalNodes>
+          <leafValues>
+            2.4641269445419312e-01 -3.1888678669929504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3159 6.1201080679893494e-02</internalNodes>
+          <leafValues>
+            2.0013030618429184e-02 -3.9326569437980652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3160 -1.0175120085477829e-02</internalNodes>
+          <leafValues>
+            7.5324602425098419e-02 -3.9622548967599869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3161 1.0271370410919189e-02</internalNodes>
+          <leafValues>
+            -5.2234519273042679e-02 1.7939470708370209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3162 -5.1337860524654388e-02</internalNodes>
+          <leafValues>
+            -3.1097239255905151e-01 2.1656470373272896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3163 2.3615739773958921e-03</internalNodes>
+          <leafValues>
+            -6.4843319356441498e-02 1.1771979928016663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3164 -2.7691819705069065e-03</internalNodes>
+          <leafValues>
+            1.4682589471340179e-01 -5.7794518768787384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3165 2.1457809954881668e-02</internalNodes>
+          <leafValues>
+            2.5269350036978722e-02 -3.3404821157455444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3166 -5.9619098901748657e-03</internalNodes>
+          <leafValues>
+            9.9241338670253754e-02 -3.5371959209442139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3167 7.5217390060424805e-01</internalNodes>
+          <leafValues>
+            7.7095897868275642e-03 -8.6434108018875122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3168 -9.2514551943168044e-04</internalNodes>
+          <leafValues>
+            3.8251910358667374e-02 -7.5597628951072693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3169 4.0818289853632450e-03</internalNodes>
+          <leafValues>
+            6.6699139773845673e-02 -1.1289499700069427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3170 1.6256010159850121e-02</internalNodes>
+          <leafValues>
+            -1.8782900646328926e-02 1.8875749409198761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3171 -9.3405954539775848e-03</internalNodes>
+          <leafValues>
+            -1.6462349891662598e-01 4.6859718859195709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3172 -3.8136378861963749e-04</internalNodes>
+          <leafValues>
+            6.0498170554637909e-02 -1.0089360177516937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3173 -2.3470960557460785e-02</internalNodes>
+          <leafValues>
+            1.8546760082244873e-01 -3.9577301591634750e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3174 -7.8684352338314056e-02</internalNodes>
+          <leafValues>
+            -6.0540008544921875e-01 1.3162979856133461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3175 1.0616140067577362e-01</internalNodes>
+          <leafValues>
+            9.4080185517668724e-03 -7.2416877746582031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3176 -6.9211378693580627e-02</internalNodes>
+          <leafValues>
+            -9.2819648981094360e-01 5.4140980355441570e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3177 -4.3828289955854416e-02</internalNodes>
+          <leafValues>
+            5.4933768510818481e-01 -1.5516829676926136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3178 5.6881271302700043e-03</internalNodes>
+          <leafValues>
+            3.7328861653804779e-02 -1.2019480019807816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3179 3.6933881044387817e-01</internalNodes>
+          <leafValues>
+            -9.9545158445835114e-03 8.1607538461685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3180 -1.0447519831359386e-02</internalNodes>
+          <leafValues>
+            1.4190499484539032e-01 -4.9798399209976196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3181 1.5151320025324821e-02</internalNodes>
+          <leafValues>
+            2.2705320268869400e-02 -3.4523698687553406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3182 1.2503850460052490e-01</internalNodes>
+          <leafValues>
+            -2.7150910347700119e-02 3.0379050970077515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3183 -9.1995187103748322e-03</internalNodes>
+          <leafValues>
+            -1.7020559310913086e-01 4.4314298778772354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3184 7.1795531548559666e-03</internalNodes>
+          <leafValues>
+            -7.8971788287162781e-02 6.3919156789779663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3185 -1.8217830359935760e-01</internalNodes>
+          <leafValues>
+            -9.7598892450332642e-01 7.1003441698849201e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3186 1.5047369743115269e-05</internalNodes>
+          <leafValues>
+            -9.8960377275943756e-02 3.9371099323034286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3187 -3.8763400167226791e-02</internalNodes>
+          <leafValues>
+            -5.9095138311386108e-01 1.0429039597511292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3188 -4.3799880892038345e-02</internalNodes>
+          <leafValues>
+            2.5290209054946899e-01 -9.5704924315214157e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3189 -5.6705519556999207e-02</internalNodes>
+          <leafValues>
+            -7.2466772794723511e-01 9.0332692489027977e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3190 7.5183928012847900e-02</internalNodes>
+          <leafValues>
+            -6.7565650679171085e-03 7.3075437545776367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3191 -6.4183590002357960e-03</internalNodes>
+          <leafValues>
+            8.5421830415725708e-02 -7.6056882739067078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3192 1.3349299551919103e-03</internalNodes>
+          <leafValues>
+            6.9977663457393646e-02 -9.2187918722629547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3193 2.8028399683535099e-03</internalNodes>
+          <leafValues>
+            -5.0953198224306107e-02 1.2934680283069611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3194 -6.4196899533271790e-02</internalNodes>
+          <leafValues>
+            -6.1751341819763184e-01 8.7323756888508797e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3195 1.7879910301417112e-03</internalNodes>
+          <leafValues>
+            -5.9445429593324661e-02 1.1325009912252426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3196 2.3370790295302868e-03</internalNodes>
+          <leafValues>
+            2.2643320262432098e-02 -1.7427070438861847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3197 2.1500359289348125e-03</internalNodes>
+          <leafValues>
+            -5.1846258342266083e-02 1.5027989447116852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3198 -2.9744949191808701e-02</internalNodes>
+          <leafValues>
+            -1.7235560715198517e-01 1.6160540282726288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3199 -2.9182229191064835e-03</internalNodes>
+          <leafValues>
+            -1.1646019667387009e-01 5.3380940109491348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3200 -5.2581899799406528e-03</internalNodes>
+          <leafValues>
+            -8.4262102842330933e-02 3.6880351603031158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3201 2.0302489399909973e-02</internalNodes>
+          <leafValues>
+            -5.3297229111194611e-02 1.6949890553951263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3202 3.1120770145207644e-03</internalNodes>
+          <leafValues>
+            4.4630430638790131e-02 -1.4054660499095917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3203 -7.7524736523628235e-02</internalNodes>
+          <leafValues>
+            -6.5038281679153442e-01 1.0468889959156513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3204 2.0978450775146484e-02</internalNodes>
+          <leafValues>
+            -3.0001569539308548e-02 1.9233350455760956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3205 2.0581670105457306e-03</internalNodes>
+          <leafValues>
+            5.1535431295633316e-02 -1.3114020228385925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3206 -7.8407032415270805e-03</internalNodes>
+          <leafValues>
+            -1.3882939517498016e-01 5.0657931715250015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3207 -7.1894749999046326e-02</internalNodes>
+          <leafValues>
+            2.1866980195045471e-01 -3.3615190535783768e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3208 1.4218500256538391e-01</internalNodes>
+          <leafValues>
+            1.2880220077931881e-02 -5.8853518962860107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3209 4.4800378382205963e-03</internalNodes>
+          <leafValues>
+            -5.5522039532661438e-02 1.1976230144500732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3210 -9.4673000276088715e-03</internalNodes>
+          <leafValues>
+            -1.2036380171775818e-01 3.0232360586524010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3211 -1.2275399640202522e-03</internalNodes>
+          <leafValues>
+            8.3563826978206635e-02 -8.7046720087528229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3212 -6.2556960619986057e-03</internalNodes>
+          <leafValues>
+            6.9355137646198273e-02 -3.5146340727806091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3213 6.4953900873661041e-02</internalNodes>
+          <leafValues>
+            -1.9296510145068169e-02 3.4898158907890320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3214 -3.2067541033029556e-03</internalNodes>
+          <leafValues>
+            -1.5205690264701843e-01 5.5897928774356842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3215 -4.8260089010000229e-02</internalNodes>
+          <leafValues>
+            -6.0309630632400513e-01 1.0463859885931015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3216 -4.2638331651687622e-03</internalNodes>
+          <leafValues>
+            -1.5278290212154388e-01 1.8424319103360176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3217 4.9363691359758377e-02</internalNodes>
+          <leafValues>
+            -2.5442009791731834e-02 3.9227759838104248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3218 2.3624610621482134e-03</internalNodes>
+          <leafValues>
+            3.8519620895385742e-01 -1.7071360722184181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3219 2.5921489577740431e-03</internalNodes>
+          <leafValues>
+            -1.5459729731082916e-01 4.3975789099931717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3220 1.1510170064866543e-02</internalNodes>
+          <leafValues>
+            6.0740210115909576e-02 -9.8671890795230865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3221 3.9182868786156178e-03</internalNodes>
+          <leafValues>
+            2.6165749877691269e-02 -2.9697629809379578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3222 7.3265641927719116e-02</internalNodes>
+          <leafValues>
+            5.5715530179440975e-03 -3.0474159121513367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3223 -4.8912810161709785e-03</internalNodes>
+          <leafValues>
+            1.2753780186176300e-01 -6.6236838698387146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3224 -1.3187030330300331e-02</internalNodes>
+          <leafValues>
+            -2.0257690548896790e-01 3.0369829386472702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3225 1.8196239834651351e-03</internalNodes>
+          <leafValues>
+            4.9198139458894730e-02 -1.3782709836959839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3226 -1.0299400426447392e-02</internalNodes>
+          <leafValues>
+            1.3534359633922577e-01 -2.9193470254540443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3227 1.7157079279422760e-01</internalNodes>
+          <leafValues>
+            -9.5548974350094795e-03 7.1399718523025513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3228 -3.4571110736578703e-03</internalNodes>
+          <leafValues>
+            6.1094630509614944e-02 -7.6816998422145844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3229 3.3349241130053997e-04</internalNodes>
+          <leafValues>
+            -1.8768610060214996e-01 3.9411719888448715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3230 5.6019209325313568e-02</internalNodes>
+          <leafValues>
+            8.5914824157953262e-03 -7.3577058315277100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3231 6.2299368437379599e-04</internalNodes>
+          <leafValues>
+            -9.4062000513076782e-02 6.7965887486934662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3232 -1.4288679696619511e-02</internalNodes>
+          <leafValues>
+            2.4144929647445679e-01 -2.7025459334254265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3233 -9.9114552140235901e-03</internalNodes>
+          <leafValues>
+            -1.5346029400825500e-01 5.3243361413478851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3234 -7.0727966725826263e-02</internalNodes>
+          <leafValues>
+            -7.1243101358413696e-01 7.4889077804982662e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3235 1.6112169250845909e-02</internalNodes>
+          <leafValues>
+            -3.5437509417533875e-02 2.2026020288467407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3236 2.9938609804958105e-03</internalNodes>
+          <leafValues>
+            1.1530820280313492e-02 -9.2017240822315216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3237 1.4030840247869492e-03</internalNodes>
+          <leafValues>
+            5.4302141070365906e-02 -1.1777610331773758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3238 -8.9894913136959076e-02</internalNodes>
+          <leafValues>
+            -6.7658591270446777e-01 1.5741019742563367e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3239 2.7459259144961834e-03</internalNodes>
+          <leafValues>
+            2.9860800132155418e-02 -2.2091430425643921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3240 2.2225940600037575e-02</internalNodes>
+          <leafValues>
+            -4.6592909842729568e-02 8.0418691039085388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3241 4.4512529857456684e-03</internalNodes>
+          <leafValues>
+            1.0706499963998795e-01 -6.5101496875286102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3242 -2.1191150881350040e-03</internalNodes>
+          <leafValues>
+            3.9871860295534134e-02 -5.2555959671735764e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3243 1.0229589790105820e-01</internalNodes>
+          <leafValues>
+            1.3386270031332970e-02 -4.5546561479568481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3244 -6.8260570988059044e-03</internalNodes>
+          <leafValues>
+            1.2695349752902985e-01 -5.9704031795263290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3245 -5.6890580803155899e-02</internalNodes>
+          <leafValues>
+            4.0180799365043640e-01 -1.6048269346356392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3246 -1.8590029329061508e-02</internalNodes>
+          <leafValues>
+            -4.0374109148979187e-01 1.3502580113708973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3247 3.3882200717926025e-02</internalNodes>
+          <leafValues>
+            7.8824451193213463e-03 -7.9268622398376465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3248 1.8759339582175016e-03</internalNodes>
+          <leafValues>
+            -3.4521240741014481e-02 1.8177880346775055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3249 1.5652549918740988e-03</internalNodes>
+          <leafValues>
+            4.8419889062643051e-02 -1.5185169875621796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3250 3.9563868194818497e-03</internalNodes>
+          <leafValues>
+            -4.2162090539932251e-02 7.8943721950054169e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>199</maxWeakCount>
+      <stageThreshold>-1.4275209903717041e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3251 8.8487491011619568e-02</internalNodes>
+          <leafValues>
+            -2.2935929894447327e-01 2.4001109600067139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3252 4.3344359844923019e-02</internalNodes>
+          <leafValues>
+            -1.9927449524402618e-01 2.0298740267753601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3253 1.5985079109668732e-02</internalNodes>
+          <leafValues>
+            -1.9890889525413513e-01 1.9233879446983337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3254 9.8411232233047485e-02</internalNodes>
+          <leafValues>
+            -9.4830892980098724e-02 2.4474050104618073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3255 1.0079979896545410e-02</internalNodes>
+          <leafValues>
+            -4.8000910878181458e-01 5.9808451682329178e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3256 6.2629938125610352e-02</internalNodes>
+          <leafValues>
+            -1.5902659296989441e-01 1.5163069963455200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3257 1.3623869977891445e-02</internalNodes>
+          <leafValues>
+            -2.7451339364051819e-01 9.0433366596698761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3258 -3.8067731074988842e-03</internalNodes>
+          <leafValues>
+            -2.9342180490493774e-01 7.3020830750465393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3259 -1.4649610035121441e-02</internalNodes>
+          <leafValues>
+            2.6059079170227051e-01 -9.5248378813266754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3260 -4.9288192531093955e-04</internalNodes>
+          <leafValues>
+            5.9352219104766846e-02 -2.8081470727920532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3261 -5.1220930181443691e-03</internalNodes>
+          <leafValues>
+            -2.4218030273914337e-01 8.1701509654521942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3262 3.3120220177806914e-04</internalNodes>
+          <leafValues>
+            -4.0093910694122314e-01 3.4026090055704117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3263 -7.4724480509757996e-04</internalNodes>
+          <leafValues>
+            6.0560788959264755e-02 -2.9127869009971619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3264 4.8829670995473862e-02</internalNodes>
+          <leafValues>
+            -7.2298422455787659e-02 2.6132971048355103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3265 2.6994010433554649e-02</internalNodes>
+          <leafValues>
+            9.5457129180431366e-02 -2.6758649945259094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3266 -2.1151660475879908e-03</internalNodes>
+          <leafValues>
+            -2.5773069262504578e-01 5.3247869014739990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3267 2.2652999177807942e-05</internalNodes>
+          <leafValues>
+            -3.0092310905456543e-01 5.9096790850162506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3268 1.1034930124878883e-02</internalNodes>
+          <leafValues>
+            -7.4277937412261963e-02 1.9048790633678436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3269 -1.0275219567120075e-02</internalNodes>
+          <leafValues>
+            -3.2835999131202698e-01 4.9218688160181046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3270 -8.3319991827011108e-03</internalNodes>
+          <leafValues>
+            -2.9651468992233276e-01 3.9428789168596268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3271 5.0808671861886978e-02</internalNodes>
+          <leafValues>
+            -4.7661241143941879e-02 3.7404251098632812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3272 -1.2126479996368289e-03</internalNodes>
+          <leafValues>
+            -1.2148889899253845e-01 6.5059438347816467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3273 4.1254470124840736e-03</internalNodes>
+          <leafValues>
+            -1.4912040531635284e-01 1.1146119982004166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3274 -1.8284359946846962e-02</internalNodes>
+          <leafValues>
+            -2.8573518991470337e-01 5.9268131852149963e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3275 1.4156280457973480e-01</internalNodes>
+          <leafValues>
+            -3.4436151385307312e-02 4.6374419331550598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3276 -3.6982420831918716e-02</internalNodes>
+          <leafValues>
+            -5.0853198766708374e-01 2.5087080895900726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3277 5.0303530879318714e-03</internalNodes>
+          <leafValues>
+            9.4626903533935547e-02 -1.6120310127735138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3278 -4.6149080991744995e-01</internalNodes>
+          <leafValues>
+            4.5096570253372192e-01 -3.1209290027618408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3279 -1.9794689491391182e-02</internalNodes>
+          <leafValues>
+            -4.1046530008316040e-01 3.8790289312601089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3280 -2.3872030898928642e-02</internalNodes>
+          <leafValues>
+            -1.5252740681171417e-01 9.2825219035148621e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3281 1.8736299825832248e-03</internalNodes>
+          <leafValues>
+            -1.9186599552631378e-01 6.9048486649990082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3282 5.8244299143552780e-02</internalNodes>
+          <leafValues>
+            -2.2612230852246284e-02 2.1975080668926239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3283 1.5281150117516518e-02</internalNodes>
+          <leafValues>
+            5.6379750370979309e-02 -2.4171100556850433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3284 1.3347120583057404e-01</internalNodes>
+          <leafValues>
+            -4.1846349835395813e-02 1.3641799986362457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3285 -1.8359240144491196e-02</internalNodes>
+          <leafValues>
+            1.3650700449943542e-01 -1.0537090152502060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3286 -1.1236529797315598e-02</internalNodes>
+          <leafValues>
+            -2.1045160293579102e-01 6.1872761696577072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3287 -7.2013743221759796e-02</internalNodes>
+          <leafValues>
+            -3.8488849997520447e-01 3.6731179803609848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3288 -1.9893420860171318e-02</internalNodes>
+          <leafValues>
+            1.9913719594478607e-01 -5.4470948874950409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3289 -8.1342989578843117e-03</internalNodes>
+          <leafValues>
+            -2.7529388666152954e-01 4.7152820974588394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3290 -1.3614459894597530e-02</internalNodes>
+          <leafValues>
+            1.9248710572719574e-01 -6.0025930404663086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3291 -6.4553669653832912e-03</internalNodes>
+          <leafValues>
+            -2.1480080485343933e-01 6.2654919922351837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3292 -7.2288706898689270e-02</internalNodes>
+          <leafValues>
+            -5.3200727701187134e-01 2.2132480517029762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3293 -7.0425979793071747e-02</internalNodes>
+          <leafValues>
+            -3.2588490843772888e-01 3.7150900810956955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3294 -1.2219670228660107e-02</internalNodes>
+          <leafValues>
+            -6.5945722162723541e-02 2.8728110715746880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3295 6.9816941395401955e-03</internalNodes>
+          <leafValues>
+            -2.8508388996124268e-01 4.2512468993663788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3296 -2.1437550894916058e-03</internalNodes>
+          <leafValues>
+            -1.0019320249557495e-01 7.1198999881744385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3297 -1.5813990030437708e-03</internalNodes>
+          <leafValues>
+            -1.2926709651947021e-01 9.5332272350788116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3298 2.1735160771640949e-05</internalNodes>
+          <leafValues>
+            -1.9246159493923187e-01 5.3724698722362518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3299 -1.0075280070304871e-01</internalNodes>
+          <leafValues>
+            5.8181059360504150e-01 -2.1155519410967827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3300 8.0153037561103702e-04</internalNodes>
+          <leafValues>
+            -1.6752170026302338e-01 6.1912689357995987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3301 -1.3424370437860489e-02</internalNodes>
+          <leafValues>
+            1.7007820308208466e-01 -6.5821729600429535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3302 2.5006510317325592e-02</internalNodes>
+          <leafValues>
+            3.1838789582252502e-02 -3.5664460062980652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3303 -2.3061310872435570e-02</internalNodes>
+          <leafValues>
+            -5.3446078300476074e-01 2.0500430837273598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3304 -8.1409228732809424e-04</internalNodes>
+          <leafValues>
+            7.3716811835765839e-02 -9.8385728895664215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3305 -1.3083440251648426e-02</internalNodes>
+          <leafValues>
+            2.3585100471973419e-01 -4.7893758863210678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3306 1.0480909608304501e-02</internalNodes>
+          <leafValues>
+            -6.7725770175457001e-02 1.1783230304718018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3307 -4.3198268860578537e-02</internalNodes>
+          <leafValues>
+            -4.3816858530044556e-01 2.5101570412516594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3308 -3.2453269232064486e-03</internalNodes>
+          <leafValues>
+            -2.2451759874820709e-01 4.3056890368461609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3309 -1.6294110100716352e-03</internalNodes>
+          <leafValues>
+            -2.3388780653476715e-01 4.5073401182889938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3310 -3.2911408692598343e-02</internalNodes>
+          <leafValues>
+            2.1012680232524872e-01 -2.1296700462698936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3311 1.4785619896429125e-05</internalNodes>
+          <leafValues>
+            -7.0854157209396362e-02 1.4696949720382690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3312 -6.0208540409803391e-02</internalNodes>
+          <leafValues>
+            -5.2135831117630005e-01 1.9577400758862495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3313 1.1327289976179600e-03</internalNodes>
+          <leafValues>
+            4.4817470014095306e-02 -2.4390450119972229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3314 8.3639882504940033e-03</internalNodes>
+          <leafValues>
+            -5.6976079940795898e-02 1.1684290319681168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3315 1.4313389547169209e-02</internalNodes>
+          <leafValues>
+            4.7445211559534073e-02 -2.2202989459037781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3316 -1.1530060321092606e-01</internalNodes>
+          <leafValues>
+            8.6662977933883667e-01 -4.2397230863571167e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3317 -2.0798090845346451e-02</internalNodes>
+          <leafValues>
+            2.8666529059410095e-01 -4.0919508785009384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3318 -1.8268700689077377e-02</internalNodes>
+          <leafValues>
+            1.3087140023708344e-01 -4.5348200947046280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3319 -2.5494489073753357e-01</internalNodes>
+          <leafValues>
+            -3.2410839200019836e-01 4.0496330708265305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3320 -2.1786570549011230e-02</internalNodes>
+          <leafValues>
+            3.3126661181449890e-01 -3.7021800875663757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3321 4.2743898928165436e-02</internalNodes>
+          <leafValues>
+            3.2316859811544418e-02 -3.5259619355201721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3322 3.4730590879917145e-02</internalNodes>
+          <leafValues>
+            3.4049548208713531e-02 -2.1393370628356934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3323 -8.8458160462323576e-05</internalNodes>
+          <leafValues>
+            -3.1134480237960815e-01 3.9364520460367203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3324 2.2288469970226288e-01</internalNodes>
+          <leafValues>
+            -8.7889749556779861e-03 8.6566871404647827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3325 2.7045139670372009e-01</internalNodes>
+          <leafValues>
+            -5.2694901823997498e-02 1.8746510148048401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3326 -2.4789940565824509e-02</internalNodes>
+          <leafValues>
+            2.7650299668312073e-01 -2.7306249365210533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3327 -3.5731170326471329e-02</internalNodes>
+          <leafValues>
+            4.1157469153404236e-01 -2.2886089980602264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3328 4.7842580825090408e-02</internalNodes>
+          <leafValues>
+            2.2989360615611076e-02 -4.1287249326705933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3329 -3.1846091151237488e-02</internalNodes>
+          <leafValues>
+            3.8073039054870605e-01 -2.9582230374217033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3330 -6.9219218567013741e-03</internalNodes>
+          <leafValues>
+            -1.3741379976272583e-01 4.8710118979215622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3331 4.1339758783578873e-02</internalNodes>
+          <leafValues>
+            4.4119630008935928e-02 -2.3561610281467438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3332 -3.4157071262598038e-02</internalNodes>
+          <leafValues>
+            -2.4877929687500000e-01 1.1872059665620327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3333 -1.2198990210890770e-02</internalNodes>
+          <leafValues>
+            -2.1426199376583099e-01 5.1533300429582596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3334 -7.9321218654513359e-03</internalNodes>
+          <leafValues>
+            8.1553332507610321e-02 -6.9921717047691345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3335 -4.2665388435125351e-02</internalNodes>
+          <leafValues>
+            -5.0616562366485596e-01 1.9237969070672989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3336 3.5445880144834518e-02</internalNodes>
+          <leafValues>
+            -1.6394840553402901e-02 1.7057849466800690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3337 4.5686280727386475e-01</internalNodes>
+          <leafValues>
+            1.9264170899987221e-02 -5.4413592815399170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3338 3.1118420884013176e-02</internalNodes>
+          <leafValues>
+            -3.0776979401707649e-02 1.3581100106239319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3339 -1.6103679314255714e-02</internalNodes>
+          <leafValues>
+            2.1244280040264130e-01 -4.8341780900955200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3340 5.7916441000998020e-03</internalNodes>
+          <leafValues>
+            -7.3984377086162567e-02 3.5749029368162155e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3341 -6.5660297870635986e-02</internalNodes>
+          <leafValues>
+            2.6183378696441650e-01 -4.1004821658134460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3342 8.1464983522891998e-02</internalNodes>
+          <leafValues>
+            1.2928999960422516e-02 -3.5362771153450012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3343 1.2561170384287834e-02</internalNodes>
+          <leafValues>
+            -1.9108769297599792e-01 6.9965943694114685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3344 7.8783802688121796e-02</internalNodes>
+          <leafValues>
+            -5.4801939986646175e-03 3.9217329025268555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3345 3.3984828740358353e-02</internalNodes>
+          <leafValues>
+            8.4328763186931610e-02 -1.2477640062570572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3346 1.7718339338898659e-02</internalNodes>
+          <leafValues>
+            4.4793829321861267e-02 -1.9760879874229431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3347 -9.8835285753011703e-03</internalNodes>
+          <leafValues>
+            -1.5149329602718353e-01 6.7348048090934753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3348 2.3850230500102043e-02</internalNodes>
+          <leafValues>
+            -3.3219821751117706e-02 1.6131630539894104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3349 -3.9590701460838318e-02</internalNodes>
+          <leafValues>
+            3.9903929829597473e-01 -2.8885990381240845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3350 3.4961920231580734e-02</internalNodes>
+          <leafValues>
+            2.2103229537606239e-02 -5.2885407209396362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3351 9.4825841486454010e-02</internalNodes>
+          <leafValues>
+            9.5985615625977516e-03 -8.2035672664642334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3352 -1.0215540230274200e-01</internalNodes>
+          <leafValues>
+            -2.0551559329032898e-01 3.0388559680432081e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3353 -9.3128867447376251e-03</internalNodes>
+          <leafValues>
+            3.6827068775892258e-02 -2.4656419456005096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3354 -5.4135788232088089e-03</internalNodes>
+          <leafValues>
+            -2.3878090083599091e-01 4.1015189141035080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3355 -2.6281980797648430e-02</internalNodes>
+          <leafValues>
+            2.7853861451148987e-01 -3.6868080496788025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3356 -9.9223516881465912e-03</internalNodes>
+          <leafValues>
+            -2.5322121381759644e-01 3.3522550016641617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3357 -1.7109709978103638e-01</internalNodes>
+          <leafValues>
+            -2.9404911398887634e-01 3.2432679086923599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3358 -8.7599586695432663e-03</internalNodes>
+          <leafValues>
+            6.8787500262260437e-02 -1.0647170245647430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3359 1.2942530214786530e-01</internalNodes>
+          <leafValues>
+            1.3241300359368324e-02 -6.8923670053482056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3360 -4.7723919153213501e-02</internalNodes>
+          <leafValues>
+            2.2214810550212860e-01 -2.8517080470919609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3361 1.0812310129404068e-01</internalNodes>
+          <leafValues>
+            1.1902020312845707e-02 -7.7915120124816895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3362 -2.7494689449667931e-02</internalNodes>
+          <leafValues>
+            -3.0192640423774719e-01 2.8540210798382759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3363 -4.9534138292074203e-02</internalNodes>
+          <leafValues>
+            -3.0015140771865845e-01 3.1750950962305069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3364 -1.0358350351452827e-02</internalNodes>
+          <leafValues>
+            1.2287119776010513e-01 -3.9123039692640305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3365 -3.2705869525671005e-02</internalNodes>
+          <leafValues>
+            -3.3354911208152771e-01 2.7965290471911430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3366 -1.3580479659140110e-02</internalNodes>
+          <leafValues>
+            1.1192899942398071e-01 -4.9471028149127960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3367 5.5075851269066334e-03</internalNodes>
+          <leafValues>
+            -1.3118129968643188e-01 6.9403477013111115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3368 7.5508110225200653e-02</internalNodes>
+          <leafValues>
+            -2.9019629582762718e-02 3.9413800835609436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3369 5.6811410933732986e-02</internalNodes>
+          <leafValues>
+            2.6788659393787384e-02 -4.1989549994468689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3370 5.0004580989480019e-03</internalNodes>
+          <leafValues>
+            4.6239160001277924e-02 -6.7620649933815002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3371 1.9717490300536156e-02</internalNodes>
+          <leafValues>
+            -6.0402508825063705e-02 1.6632139682769775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3372 -6.4729452133178711e-02</internalNodes>
+          <leafValues>
+            -5.2484118938446045e-01 2.7922600507736206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3373 -3.0683130025863647e-02</internalNodes>
+          <leafValues>
+            2.1945460140705109e-01 -4.8111628741025925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3374 8.1467535346746445e-03</internalNodes>
+          <leafValues>
+            6.0279220342636108e-02 -1.1600890010595322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3375 7.9492190852761269e-03</internalNodes>
+          <leafValues>
+            8.3563491702079773e-02 -1.6053000092506409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3376 -2.2406199946999550e-02</internalNodes>
+          <leafValues>
+            2.8271418809890747e-01 -2.8184479102492332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3377 8.2993790507316589e-02</internalNodes>
+          <leafValues>
+            1.0475059971213341e-02 -9.6875292062759399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3378 -7.0176632143557072e-03</internalNodes>
+          <leafValues>
+            -1.3753229379653931e-01 6.8205498158931732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3379 -9.7560193389654160e-03</internalNodes>
+          <leafValues>
+            -1.3707080483436584e-01 7.2890587151050568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3380 -5.2217379212379456e-02</internalNodes>
+          <leafValues>
+            -6.4300441741943359e-01 1.4492220245301723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3381 -7.8029942233115435e-04</internalNodes>
+          <leafValues>
+            -2.6479271054267883e-01 3.3517841249704361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3382 3.7919931113719940e-02</internalNodes>
+          <leafValues>
+            -8.4846787154674530e-02 1.1260589957237244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3383 3.0561289750039577e-03</internalNodes>
+          <leafValues>
+            4.8086941242218018e-02 -1.9009250402450562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3384 6.5862268209457397e-02</internalNodes>
+          <leafValues>
+            -5.2452040836215019e-03 9.1280621290206909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3385 1.5568210184574127e-01</internalNodes>
+          <leafValues>
+            2.0884050056338310e-02 -4.9580439925193787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3386 -1.9058469915762544e-03</internalNodes>
+          <leafValues>
+            1.8305900692939758e-01 -4.9756310880184174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3387 -9.8356999456882477e-02</internalNodes>
+          <leafValues>
+            4.8020449280738831e-01 -2.0384309813380241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3388 4.2754490859806538e-03</internalNodes>
+          <leafValues>
+            4.0095929056406021e-02 -1.4071129262447357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3389 -1.4033010229468346e-02</internalNodes>
+          <leafValues>
+            -2.0791560411453247e-01 5.2576299756765366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3390 8.0179408192634583e-02</internalNodes>
+          <leafValues>
+            -2.5790559127926826e-02 3.7651219964027405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3391 1.8175759911537170e-01</internalNodes>
+          <leafValues>
+            1.1428649537265301e-02 -8.3382111787796021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3392 -1.9141690805554390e-02</internalNodes>
+          <leafValues>
+            -5.0522857904434204e-01 1.2605519965291023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3393 -5.1260828971862793e-02</internalNodes>
+          <leafValues>
+            5.8292531967163086e-01 -1.6109749674797058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3394 6.4478136599063873e-02</internalNodes>
+          <leafValues>
+            1.0237329639494419e-02 -6.0302352905273438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3395 3.1238300725817680e-02</internalNodes>
+          <leafValues>
+            2.0845850929617882e-02 -3.9785829186439514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3396 -5.0772321410477161e-03</internalNodes>
+          <leafValues>
+            1.2331540137529373e-01 -3.5224981606006622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3397 -1.9385579507797956e-03</internalNodes>
+          <leafValues>
+            1.5726689994335175e-01 -7.3316320776939392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3398 2.4099789559841156e-02</internalNodes>
+          <leafValues>
+            -1.1178609728813171e-01 1.0738980025053024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3399 -8.8700000196695328e-03</internalNodes>
+          <leafValues>
+            -3.6048200726509094e-01 2.7034249156713486e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3400 -3.7424121052026749e-02</internalNodes>
+          <leafValues>
+            -3.5229408740997314e-01 1.6786530613899231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3401 -2.0067069679498672e-02</internalNodes>
+          <leafValues>
+            -2.7460938692092896e-01 3.9532590657472610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3402 6.5169870853424072e-02</internalNodes>
+          <leafValues>
+            1.1402159929275513e-02 -2.4819959700107574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3403 3.8157470524311066e-02</internalNodes>
+          <leafValues>
+            4.6323310583829880e-02 -2.0989510416984558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3404 1.1075180023908615e-02</internalNodes>
+          <leafValues>
+            3.4411158412694931e-02 -5.1256500184535980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3405 1.1583480238914490e-01</internalNodes>
+          <leafValues>
+            4.2282830923795700e-02 -2.1705499291419983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3406 -4.6720780432224274e-02</internalNodes>
+          <leafValues>
+            2.3093520104885101e-01 -8.3234477788209915e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3407 1.2567450106143951e-01</internalNodes>
+          <leafValues>
+            -4.9882501363754272e-02 2.1018449962139130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3408 1.8088010256178677e-04</internalNodes>
+          <leafValues>
+            -1.1836589872837067e-01 8.4278896450996399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3409 1.0470690205693245e-02</internalNodes>
+          <leafValues>
+            -8.6210608482360840e-02 1.1760850250720978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3410 5.8065719902515411e-02</internalNodes>
+          <leafValues>
+            1.5582700259983540e-02 -7.4217921495437622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3411 2.2783069871366024e-03</internalNodes>
+          <leafValues>
+            -1.9151380658149719e-01 4.7990638762712479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3412 -6.9596558809280396e-02</internalNodes>
+          <leafValues>
+            -7.3241692781448364e-01 1.1130559723824263e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3413 5.8907870203256607e-02</internalNodes>
+          <leafValues>
+            1.6878390684723854e-02 -5.4400408267974854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3414 -8.0658823251724243e-02</internalNodes>
+          <leafValues>
+            2.9922959208488464e-01 -1.8570570275187492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3415 1.7686929553747177e-02</internalNodes>
+          <leafValues>
+            4.2936161160469055e-02 -2.2591550648212433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3416 -1.6319070011377335e-02</internalNodes>
+          <leafValues>
+            1.8889640271663666e-01 -4.7047398984432220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3417 -3.9527568966150284e-02</internalNodes>
+          <leafValues>
+            -3.2657331228256226e-01 2.8762219473719597e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3418 1.9769819919019938e-03</internalNodes>
+          <leafValues>
+            -8.8217496871948242e-02 5.7402729988098145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3419 -3.0272029340267181e-02</internalNodes>
+          <leafValues>
+            -5.1177912950515747e-01 1.7359249293804169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3420 5.3786419332027435e-02</internalNodes>
+          <leafValues>
+            1.2071570381522179e-02 -4.0201959013938904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3421 -9.4136483967304230e-03</internalNodes>
+          <leafValues>
+            2.4728150665760040e-01 -3.6734741181135178e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3422 -5.9014528989791870e-02</internalNodes>
+          <leafValues>
+            -1.3277289271354675e-01 1.5220739878714085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3423 8.9417606592178345e-02</internalNodes>
+          <leafValues>
+            -2.5917148590087891e-01 3.7563629448413849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3424 -8.7996140122413635e-02</internalNodes>
+          <leafValues>
+            4.9200880527496338e-01 -2.1210839971899986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3425 -5.0747569650411606e-02</internalNodes>
+          <leafValues>
+            -4.8567768931388855e-01 2.0005319267511368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3426 -3.8918260484933853e-02</internalNodes>
+          <leafValues>
+            -8.9558547735214233e-01 7.8960238024592400e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3427 2.0968139171600342e-02</internalNodes>
+          <leafValues>
+            -5.4431710392236710e-02 1.6123360395431519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3428 -3.2103069126605988e-02</internalNodes>
+          <leafValues>
+            -3.6822700500488281e-01 1.9163349643349648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3429 5.5592609569430351e-03</internalNodes>
+          <leafValues>
+            7.8368440270423889e-02 -1.1842489987611771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3430 5.9554249048233032e-02</internalNodes>
+          <leafValues>
+            -5.2290938794612885e-02 3.6194879561662674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3431 -1.0973160155117512e-02</internalNodes>
+          <leafValues>
+            1.5855990350246429e-01 -5.5804491043090820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3432 -1.1934650130569935e-02</internalNodes>
+          <leafValues>
+            -2.5717508792877197e-01 3.2829850912094116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3433 6.0441631823778152e-02</internalNodes>
+          <leafValues>
+            -3.8720801472663879e-02 2.2971870005130768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3434 -8.2118069985881448e-04</internalNodes>
+          <leafValues>
+            6.9738790392875671e-02 -1.5992000699043274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3435 2.0469389855861664e-02</internalNodes>
+          <leafValues>
+            -8.4349267184734344e-02 1.0139500349760056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3436 -7.6305761933326721e-02</internalNodes>
+          <leafValues>
+            8.3174228668212891e-01 -5.0806580111384392e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3437 6.0551889240741730e-02</internalNodes>
+          <leafValues>
+            -3.7971161305904388e-02 2.1850149333477020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3438 -4.1085779666900635e-03</internalNodes>
+          <leafValues>
+            -1.1496649682521820e-01 3.6647479981184006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3439 1.2399969622492790e-02</internalNodes>
+          <leafValues>
+            6.2838301062583923e-02 -1.4144660532474518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3440 -7.1455702185630798e-02</internalNodes>
+          <leafValues>
+            -4.2673790454864502e-01 1.3947109691798687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3441 3.3709030598402023e-02</internalNodes>
+          <leafValues>
+            -1.2713599950075150e-02 7.4775099754333496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3442 3.4742768853902817e-02</internalNodes>
+          <leafValues>
+            2.0969500765204430e-02 -1.4630280435085297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3443 -4.3705299496650696e-02</internalNodes>
+          <leafValues>
+            1.8064750730991364e-01 -5.2335180342197418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3444 8.4926873445510864e-02</internalNodes>
+          <leafValues>
+            6.9014527834951878e-03 -2.6073959469795227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3445 -1.7119079828262329e-02</internalNodes>
+          <leafValues>
+            -1.4590080082416534e-01 6.7484676837921143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3446 3.3630719780921936e-01</internalNodes>
+          <leafValues>
+            7.8989071771502495e-03 -8.3852928876876831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3447 1.2371230125427246e-01</internalNodes>
+          <leafValues>
+            -2.5482710450887680e-02 3.9098039269447327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3448 -1.1195900291204453e-01</internalNodes>
+          <leafValues>
+            -3.8317111134529114e-01 6.0780011117458344e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3449 -1.0881890356540680e-01</internalNodes>
+          <leafValues>
+            -7.1362990140914917e-01 1.2700069695711136e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>268</maxWeakCount>
+      <stageThreshold>-1.3290590047836304e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3450 9.6844611689448357e-03</internalNodes>
+          <leafValues>
+            -1.9455039501190186e-01 2.0048019289970398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3451 -6.6196201369166374e-03</internalNodes>
+          <leafValues>
+            9.2211641371250153e-02 -3.4824401140213013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3452 5.6163137778639793e-03</internalNodes>
+          <leafValues>
+            6.6767610609531403e-02 -4.1172260046005249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3453 -1.6882510390132666e-03</internalNodes>
+          <leafValues>
+            7.2629712522029877e-02 -2.0694479346275330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3454 -2.9599820263683796e-03</internalNodes>
+          <leafValues>
+            -2.0635899901390076e-01 7.7335417270660400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3455 1.7798959743231535e-03</internalNodes>
+          <leafValues>
+            -3.2149469852447510e-01 6.4107127487659454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3456 -4.0264189010486007e-04</internalNodes>
+          <leafValues>
+            7.9512253403663635e-02 -2.4051089584827423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3457 -5.0024548545479774e-04</internalNodes>
+          <leafValues>
+            8.6675606667995453e-02 -2.0504170656204224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3458 -2.0284270867705345e-03</internalNodes>
+          <leafValues>
+            1.4322499930858612e-01 -1.2220569700002670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3459 6.0648359358310699e-03</internalNodes>
+          <leafValues>
+            3.7860579788684845e-02 -2.4375459551811218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3460 9.6257496625185013e-03</internalNodes>
+          <leafValues>
+            5.7141840457916260e-02 -2.8827920556068420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3461 2.5888499803841114e-03</internalNodes>
+          <leafValues>
+            -1.8906019628047943e-01 8.6430206894874573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3462 2.9090950265526772e-03</internalNodes>
+          <leafValues>
+            -8.3108469843864441e-02 1.7618839442729950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3463 2.2233440540730953e-03</internalNodes>
+          <leafValues>
+            2.0150169730186462e-02 -2.4882750213146210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3464 -9.8997671157121658e-03</internalNodes>
+          <leafValues>
+            -2.0639769732952118e-01 6.0985010117292404e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3465 1.9689390435814857e-02</internalNodes>
+          <leafValues>
+            -3.4452438354492188e-02 2.0069779455661774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3466 2.1106770262122154e-02</internalNodes>
+          <leafValues>
+            4.3886858969926834e-02 -2.6610890030860901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3467 -7.2028310969471931e-03</internalNodes>
+          <leafValues>
+            1.7015519738197327e-01 -5.4639339447021484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3468 4.0647671557962894e-03</internalNodes>
+          <leafValues>
+            5.2182808518409729e-02 -2.1304030716419220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3469 -2.8419198933988810e-03</internalNodes>
+          <leafValues>
+            5.3180210292339325e-02 -1.7669560015201569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3470 -4.9461819231510162e-02</internalNodes>
+          <leafValues>
+            3.7221330404281616e-01 -3.3969849348068237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3471 4.3024159967899323e-02</internalNodes>
+          <leafValues>
+            3.1251549720764160e-02 -3.1831890344619751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3472 -7.0111698005348444e-04</internalNodes>
+          <leafValues>
+            -2.0340210199356079e-01 5.8964170515537262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3473 5.7489587925374508e-04</internalNodes>
+          <leafValues>
+            -9.4937190413475037e-02 1.0538189858198166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3474 -1.4911209291312844e-04</internalNodes>
+          <leafValues>
+            6.8423688411712646e-02 -1.8207779526710510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3475 8.7993890047073364e-03</internalNodes>
+          <leafValues>
+            3.3866070210933685e-02 -1.1625579744577408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3476 -8.7150773033499718e-03</internalNodes>
+          <leafValues>
+            1.8041290342807770e-01 -6.5721526741981506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3477 -1.3727629557251930e-02</internalNodes>
+          <leafValues>
+            -1.3337810337543488e-01 3.5966601222753525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3478 -2.3620850406587124e-03</internalNodes>
+          <leafValues>
+            -1.9088070094585419e-01 6.1849810183048248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3479 1.7863539978861809e-03</internalNodes>
+          <leafValues>
+            -8.3071537315845490e-02 9.8926126956939697e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3480 -9.4514712691307068e-03</internalNodes>
+          <leafValues>
+            -1.8024919927120209e-01 6.0146760195493698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3481 4.8195280134677887e-02</internalNodes>
+          <leafValues>
+            -2.6617299765348434e-02 3.0134469270706177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3482 -1.2248229468241334e-03</internalNodes>
+          <leafValues>
+            -2.3560139536857605e-01 4.5572910457849503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3483 -4.2851101607084274e-02</internalNodes>
+          <leafValues>
+            1.6086329519748688e-01 -2.3455940186977386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3484 3.4798709675669670e-03</internalNodes>
+          <leafValues>
+            7.6882630586624146e-02 -1.3299170136451721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3485 -3.9859190583229065e-03</internalNodes>
+          <leafValues>
+            4.3115191161632538e-02 -2.3132759332656860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3486 4.3139848858118057e-02</internalNodes>
+          <leafValues>
+            -3.6780070513486862e-02 2.3883450031280518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3487 -1.7436629161238670e-02</internalNodes>
+          <leafValues>
+            -1.4046260714530945e-01 5.9077050536870956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3488 -7.5254887342453003e-02</internalNodes>
+          <leafValues>
+            3.6328521370887756e-01 -3.1380280852317810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3489 6.0125540941953659e-02</internalNodes>
+          <leafValues>
+            8.2496693357825279e-03 -2.3485200107097626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3490 1.2755369534716010e-03</internalNodes>
+          <leafValues>
+            -1.2268169969320297e-01 9.0071536600589752e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3491 -1.3465109514072537e-03</internalNodes>
+          <leafValues>
+            -1.4554239809513092e-01 7.0761166512966156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3492 2.3758469149470329e-02</internalNodes>
+          <leafValues>
+            -5.1834989339113235e-02 1.7583900690078735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3493 2.2376580163836479e-03</internalNodes>
+          <leafValues>
+            9.1763339936733246e-02 -1.1206050217151642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3494 3.8662939332425594e-03</internalNodes>
+          <leafValues>
+            6.2390189617872238e-02 -1.5142339468002319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3495 7.6868042349815369e-02</internalNodes>
+          <leafValues>
+            -2.7640199288725853e-02 3.7636131048202515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3496 1.6617199406027794e-02</internalNodes>
+          <leafValues>
+            3.3067818731069565e-02 -3.0950650572776794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3497 -4.6145029366016388e-02</internalNodes>
+          <leafValues>
+            1.0798139870166779e-01 -5.8277439326047897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3498 9.8206609487533569e-02</internalNodes>
+          <leafValues>
+            1.7502160742878914e-02 -5.0861918926239014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3499 4.7838049940764904e-03</internalNodes>
+          <leafValues>
+            -1.0207810252904892e-01 5.7796850800514221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3500 2.0467689260840416e-02</internalNodes>
+          <leafValues>
+            -2.0362010225653648e-02 4.5001450181007385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3501 1.5141700394451618e-02</internalNodes>
+          <leafValues>
+            2.8140379115939140e-02 -8.5130028426647186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3502 5.2229189313948154e-03</internalNodes>
+          <leafValues>
+            -5.7789258658885956e-02 1.5580329298973083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3503 1.8871299922466278e-02</internalNodes>
+          <leafValues>
+            2.7053799480199814e-02 -1.2046360224485397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3504 4.5608580112457275e-03</internalNodes>
+          <leafValues>
+            -7.9567588865756989e-02 1.1571010202169418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3505 -1.2172549962997437e-02</internalNodes>
+          <leafValues>
+            -1.6149179637432098e-01 2.4571539834141731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3506 -1.6468809545040131e-01</internalNodes>
+          <leafValues>
+            -6.5712791681289673e-01 1.2428689748048782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3507 1.8241419456899166e-03</internalNodes>
+          <leafValues>
+            -9.1526739299297333e-02 8.7851390242576599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3508 -5.4591207299381495e-04</internalNodes>
+          <leafValues>
+            -1.2581209838390350e-01 6.6968381404876709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3509 2.1177160087972879e-03</internalNodes>
+          <leafValues>
+            1.4261330664157867e-01 -6.1729468405246735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3510 1.1853260220959783e-03</internalNodes>
+          <leafValues>
+            -9.1425627470016479e-02 9.2089362442493439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3511 7.9899299889802933e-03</internalNodes>
+          <leafValues>
+            -6.3119217753410339e-02 1.5446299314498901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3512 4.5044990256428719e-03</internalNodes>
+          <leafValues>
+            4.0920298546552658e-02 -2.2475910186767578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3513 7.4563547968864441e-03</internalNodes>
+          <leafValues>
+            -3.9540700614452362e-02 2.4208679795265198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3514 6.3897971995174885e-03</internalNodes>
+          <leafValues>
+            5.2900739014148712e-02 -1.7378969490528107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3515 -5.9052068740129471e-02</internalNodes>
+          <leafValues>
+            -4.7957658767700195e-01 8.3919316530227661e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3516 -5.3746208548545837e-02</internalNodes>
+          <leafValues>
+            -5.0854432582855225e-01 1.6880670562386513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3517 -9.1852366924285889e-02</internalNodes>
+          <leafValues>
+            1.9466249644756317e-01 -1.1129629798233509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3518 1.5038819611072540e-01</internalNodes>
+          <leafValues>
+            -2.0112350583076477e-02 4.4738510251045227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3519 -2.1317429840564728e-02</internalNodes>
+          <leafValues>
+            2.9676139354705811e-01 -2.8231840580701828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3520 1.2711419723927975e-02</internalNodes>
+          <leafValues>
+            3.3570941537618637e-02 -2.8972589969635010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3521 -9.3287907540798187e-02</internalNodes>
+          <leafValues>
+            6.4380300045013428e-01 -1.4923879876732826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3522 -4.5716729946434498e-03</internalNodes>
+          <leafValues>
+            -2.6994249224662781e-01 3.3246111124753952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3523 -3.4010890522040427e-04</internalNodes>
+          <leafValues>
+            8.1715546548366547e-02 -1.0642260313034058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3524 -2.6096890214830637e-03</internalNodes>
+          <leafValues>
+            1.8403419852256775e-01 -6.4724236726760864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3525 4.6332611236721277e-04</internalNodes>
+          <leafValues>
+            -1.4283409714698792e-01 4.2033299803733826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3526 1.4095300436019897e-01</internalNodes>
+          <leafValues>
+            9.4516919925808907e-03 -7.7727228403091431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3527 2.0406199619174004e-03</internalNodes>
+          <leafValues>
+            -6.6505432128906250e-02 1.1805409938097000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3528 -2.2302009165287018e-02</internalNodes>
+          <leafValues>
+            -1.0419870167970657e-01 8.9387677609920502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3529 3.9168349467217922e-03</internalNodes>
+          <leafValues>
+            2.5769380852580070e-02 -1.6625499725341797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3530 6.1153857968747616e-03</internalNodes>
+          <leafValues>
+            -6.2531687319278717e-02 1.4075349271297455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3531 -2.9564529540948570e-05</internalNodes>
+          <leafValues>
+            4.6978309750556946e-02 -1.0862989723682404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3532 1.4300559996627271e-04</internalNodes>
+          <leafValues>
+            -1.0005149990320206e-01 8.0335728824138641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3533 1.1430789716541767e-02</internalNodes>
+          <leafValues>
+            2.3201359435915947e-02 -3.1366908550262451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3534 -1.3724610209465027e-02</internalNodes>
+          <leafValues>
+            1.2814410030841827e-01 -6.1290029436349869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3535 -4.5548770576715469e-02</internalNodes>
+          <leafValues>
+            -4.7528308629989624e-01 1.3631340116262436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3536 7.6914107194170356e-04</internalNodes>
+          <leafValues>
+            -8.9416027069091797e-02 9.6091486513614655e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3537 6.3840910792350769e-02</internalNodes>
+          <leafValues>
+            1.6064060851931572e-02 -3.8221898674964905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3538 -7.2662779130041599e-03</internalNodes>
+          <leafValues>
+            -2.1940490603446960e-01 3.8170509040355682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3539 -1.2828599661588669e-02</internalNodes>
+          <leafValues>
+            1.4705429971218109e-01 -5.5832669138908386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3540 -9.1467969119548798e-02</internalNodes>
+          <leafValues>
+            -7.9265332221984863e-01 1.0404639877378941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3541 -2.7164160273969173e-03</internalNodes>
+          <leafValues>
+            -1.7725169658660889e-01 5.6455809623003006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3542 -1.0097579658031464e-01</internalNodes>
+          <leafValues>
+            -5.9372657537460327e-01 1.3162240386009216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3543 -3.7983559072017670e-02</internalNodes>
+          <leafValues>
+            -1.5072999894618988e-01 1.9557390362024307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3544 5.3728191414847970e-04</internalNodes>
+          <leafValues>
+            5.2257049828767776e-02 -1.7996260523796082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3545 1.2443910352885723e-02</internalNodes>
+          <leafValues>
+            -2.8953019529581070e-02 2.5448489189147949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3546 -1.8171280622482300e-02</internalNodes>
+          <leafValues>
+            3.2203981280326843e-01 -3.1395100057125092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3547 -3.0619159340858459e-02</internalNodes>
+          <leafValues>
+            -1.2817279994487762e-01 6.0485020279884338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3548 2.8726200107485056e-03</internalNodes>
+          <leafValues>
+            -1.4807400107383728e-01 5.3796000778675079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3549 -2.8772678971290588e-01</internalNodes>
+          <leafValues>
+            -8.3234447240829468e-01 3.6127590574324131e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3550 4.1057071089744568e-01</internalNodes>
+          <leafValues>
+            8.3212452009320259e-03 -8.2476407289505005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3551 1.6370510682463646e-02</internalNodes>
+          <leafValues>
+            -2.4849100038409233e-02 1.6309140622615814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3552 5.3615570068359375e-02</internalNodes>
+          <leafValues>
+            1.8034080043435097e-02 -4.6126970648765564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3553 -1.0296109830960631e-03</internalNodes>
+          <leafValues>
+            3.8824349641799927e-02 -7.3625981807708740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3554 -6.3063339330255985e-03</internalNodes>
+          <leafValues>
+            1.3288870453834534e-01 -5.5812060832977295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3555 6.8714357912540436e-03</internalNodes>
+          <leafValues>
+            6.9562442600727081e-02 -1.1383140087127686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3556 -8.3098851609975100e-04</internalNodes>
+          <leafValues>
+            1.0002700239419937e-01 -8.5704028606414795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3557 1.3288210146129131e-02</internalNodes>
+          <leafValues>
+            4.2606260627508163e-02 -1.1729510128498077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3558 1.7035039141774178e-02</internalNodes>
+          <leafValues>
+            -4.2757850140333176e-02 2.2400109469890594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3559 3.2128300517797470e-02</internalNodes>
+          <leafValues>
+            1.5296909958124161e-02 -5.3317558765411377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3560 1.1440330184996128e-02</internalNodes>
+          <leafValues>
+            -5.8955609798431396e-02 1.2842489778995514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3561 2.5446009822189808e-03</internalNodes>
+          <leafValues>
+            4.6037770807743073e-02 -1.4760190248489380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3562 -3.5062368959188461e-02</internalNodes>
+          <leafValues>
+            -3.4721338748931885e-01 2.4020459502935410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3563 4.6889069490134716e-03</internalNodes>
+          <leafValues>
+            -8.2460209727287292e-02 7.6254382729530334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3564 -1.5067459571582731e-05</internalNodes>
+          <leafValues>
+            5.8223988860845566e-02 -1.3496190309524536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3565 -6.5259548136964440e-04</internalNodes>
+          <leafValues>
+            3.6780450493097305e-02 -7.0881396532058716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3566 4.5456850784830749e-04</internalNodes>
+          <leafValues>
+            5.9895541518926620e-02 -1.4553959667682648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3567 -1.0570470243692398e-01</internalNodes>
+          <leafValues>
+            1.3766160607337952e-01 -2.2337099537253380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3568 -4.6019242145121098e-03</internalNodes>
+          <leafValues>
+            -3.3811721205711365e-01 2.2578509524464607e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3569 5.5374279618263245e-03</internalNodes>
+          <leafValues>
+            -4.1250869631767273e-02 9.4750680029392242e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3570 -2.7569069061428308e-03</internalNodes>
+          <leafValues>
+            1.7380860447883606e-01 -4.5417640358209610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3571 4.1876680916175246e-04</internalNodes>
+          <leafValues>
+            -5.5233258754014969e-02 5.8342628180980682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3572 -2.4587850202806294e-04</internalNodes>
+          <leafValues>
+            -8.9373029768466949e-02 8.1158749759197235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3573 -7.4991412460803986e-02</internalNodes>
+          <leafValues>
+            -5.9057062864303589e-01 6.7846179008483887e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3574 1.7898950027301908e-03</internalNodes>
+          <leafValues>
+            5.2262220531702042e-02 -1.5884269773960114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3575 -3.2704160548746586e-03</internalNodes>
+          <leafValues>
+            1.1216899752616882e-01 -6.2488421797752380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3576 -1.7803650349378586e-02</internalNodes>
+          <leafValues>
+            -4.5739078521728516e-01 1.6650289297103882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3577 -3.3537930250167847e-01</internalNodes>
+          <leafValues>
+            -8.2564651966094971e-01 7.1495971642434597e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3578 1.1451829969882965e-01</internalNodes>
+          <leafValues>
+            -1.8937719985842705e-02 4.1076439619064331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3579 6.5141052007675171e-02</internalNodes>
+          <leafValues>
+            1.1196400038897991e-02 -7.6225310564041138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3580 -1.8442489206790924e-02</internalNodes>
+          <leafValues>
+            1.4006440341472626e-01 -5.1568318158388138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3581 2.0362680777907372e-02</internalNodes>
+          <leafValues>
+            2.7635680511593819e-02 -2.2622610628604889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3582 -5.4255980066955090e-03</internalNodes>
+          <leafValues>
+            -1.4688220620155334e-01 5.1294069737195969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3583 -1.4608480036258698e-02</internalNodes>
+          <leafValues>
+            2.8014749288558960e-01 -3.2668899744749069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3584 1.2462410377338529e-03</internalNodes>
+          <leafValues>
+            -2.0888839662075043e-01 3.3212959766387939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3585 -5.1487259566783905e-02</internalNodes>
+          <leafValues>
+            1.9872699677944183e-01 -1.0376259684562683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3586 -1.4138059690594673e-02</internalNodes>
+          <leafValues>
+            -1.6193750500679016e-01 4.6604789793491364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3587 -8.3356946706771851e-03</internalNodes>
+          <leafValues>
+            1.6429559886455536e-01 -4.2695630341768265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3588 9.5129031687974930e-03</internalNodes>
+          <leafValues>
+            4.4999569654464722e-02 -1.5971189737319946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3589 -7.0411129854619503e-03</internalNodes>
+          <leafValues>
+            7.0638000965118408e-01 -9.1527765616774559e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3590 -4.0637628990225494e-04</internalNodes>
+          <leafValues>
+            7.0747792720794678e-02 -1.0194250196218491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3591 4.2529408819973469e-03</internalNodes>
+          <leafValues>
+            3.1937479972839355e-02 -1.0357219725847244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3592 -1.9221140246372670e-04</internalNodes>
+          <leafValues>
+            1.0241460055112839e-01 -8.9996367692947388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3593 -1.3621139805763960e-03</internalNodes>
+          <leafValues>
+            -1.8157319724559784e-01 2.3933520540595055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3594 -9.3250330537557602e-03</internalNodes>
+          <leafValues>
+            1.5883359313011169e-01 -4.5317139476537704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3595 -3.4641081094741821e-01</internalNodes>
+          <leafValues>
+            -3.5901129245758057e-01 9.8646534606814384e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3596 1.7026960849761963e-02</internalNodes>
+          <leafValues>
+            -5.9731051325798035e-02 1.2576000392436981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3597 -3.9226989611051977e-04</internalNodes>
+          <leafValues>
+            6.4828976988792419e-02 -9.2051766812801361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3598 7.0719248615205288e-03</internalNodes>
+          <leafValues>
+            3.7144500762224197e-02 -1.9167420268058777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3599 2.9001249931752682e-03</internalNodes>
+          <leafValues>
+            -6.2633208930492401e-02 5.3248930722475052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3600 -2.4164669215679169e-02</internalNodes>
+          <leafValues>
+            3.0798891186714172e-01 -2.6505900546908379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3601 -7.5509406626224518e-02</internalNodes>
+          <leafValues>
+            -6.1827278137207031e-01 7.8803002834320068e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3602 -2.6605799212120473e-04</internalNodes>
+          <leafValues>
+            6.9619670510292053e-02 -9.9268868565559387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3603 2.3389840498566628e-03</internalNodes>
+          <leafValues>
+            4.2269691824913025e-02 -1.6290849447250366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3604 -1.2518429430201650e-03</internalNodes>
+          <leafValues>
+            9.0814828872680664e-02 -7.9618006944656372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3605 -1.9330839859321713e-03</internalNodes>
+          <leafValues>
+            7.6956093311309814e-02 -6.5234251320362091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3606 2.3863440379500389e-02</internalNodes>
+          <leafValues>
+            -7.7985651791095734e-02 9.7926571965217590e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3607 -5.1995079964399338e-02</internalNodes>
+          <leafValues>
+            -2.0676060020923615e-01 1.2264530174434185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3608 -9.4953901134431362e-04</internalNodes>
+          <leafValues>
+            7.2090931236743927e-02 -1.2452449649572372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3609 -9.0458765625953674e-03</internalNodes>
+          <leafValues>
+            -1.0756769776344299e-01 2.6017999276518822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3610 3.2019101083278656e-02</internalNodes>
+          <leafValues>
+            -4.4689521193504333e-02 1.6712300479412079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3611 -7.1996808983385563e-03</internalNodes>
+          <leafValues>
+            -1.2065560370683670e-01 5.3329549729824066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3612 9.7247883677482605e-02</internalNodes>
+          <leafValues>
+            -2.0059280097484589e-02 4.1321530938148499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3613 1.7411670414730906e-03</internalNodes>
+          <leafValues>
+            2.5265200063586235e-02 -1.1400379985570908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3614 -1.5694150328636169e-01</internalNodes>
+          <leafValues>
+            -9.6121889352798462e-01 7.4661090038716793e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3615 -2.0573820918798447e-02</internalNodes>
+          <leafValues>
+            1.3207539916038513e-01 -5.3688809275627136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3616 2.0626350305974483e-03</internalNodes>
+          <leafValues>
+            3.7869140505790710e-02 -2.0333750545978546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3617 1.2381599843502045e-01</internalNodes>
+          <leafValues>
+            2.3662589956074953e-03 -4.8794668912887573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3618 3.1255739741027355e-03</internalNodes>
+          <leafValues>
+            -6.4476020634174347e-02 1.5053239464759827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3619 1.8766360357403755e-02</internalNodes>
+          <leafValues>
+            1.2639230117201805e-02 -1.9121849536895752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3620 -8.6109619587659836e-03</internalNodes>
+          <leafValues>
+            -1.1916559934616089e-01 6.6547170281410217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3621 1.4604110270738602e-02</internalNodes>
+          <leafValues>
+            -2.1980939432978630e-02 2.6832428574562073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3622 1.8387939780950546e-03</internalNodes>
+          <leafValues>
+            -1.1506830155849457e-01 6.0840509831905365e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3623 -5.7930707931518555e-01</internalNodes>
+          <leafValues>
+            -1. 3.7629920989274979e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3624 1.8690739572048187e-01</internalNodes>
+          <leafValues>
+            6.2871198169887066e-03 -9.2426669597625732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3625 1.8341749906539917e-02</internalNodes>
+          <leafValues>
+            1.7516769468784332e-02 -1.6519400477409363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3626 -1.4776510186493397e-02</internalNodes>
+          <leafValues>
+            2.5068140029907227e-01 -2.6199640706181526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3627 4.4032301753759384e-02</internalNodes>
+          <leafValues>
+            1.1479279957711697e-02 -6.4663171768188477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3628 3.5362939815968275e-03</internalNodes>
+          <leafValues>
+            4.8670079559087753e-02 -1.3171669840812683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3629 -4.5765978284180164e-03</internalNodes>
+          <leafValues>
+            1.2401209771633148e-01 -5.3882170468568802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3630 3.0529699288308620e-03</internalNodes>
+          <leafValues>
+            -5.2538860589265823e-02 1.2860049307346344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3631 -1.1333939619362354e-02</internalNodes>
+          <leafValues>
+            -1.6732269525527954e-01 1.2890639714896679e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3632 2.7712888550013304e-04</internalNodes>
+          <leafValues>
+            6.5776027739048004e-02 -9.4573900103569031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3633 5.4571928922086954e-04</internalNodes>
+          <leafValues>
+            -5.9766601771116257e-02 1.3265900313854218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3634 6.2958751805126667e-03</internalNodes>
+          <leafValues>
+            2.8854750096797943e-02 -2.4328909814357758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3635 1.5611880226060748e-03</internalNodes>
+          <leafValues>
+            -5.6346539407968521e-02 8.0620631575584412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3636 1.0501279681921005e-01</internalNodes>
+          <leafValues>
+            -1.4052099548280239e-02 5.5927920341491699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3637 3.6907300353050232e-02</internalNodes>
+          <leafValues>
+            1.5443010255694389e-02 -2.0881450176239014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3638 -4.0569249540567398e-02</internalNodes>
+          <leafValues>
+            1.5851789712905884e-01 -4.3176181614398956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3639 -7.2549749165773392e-03</internalNodes>
+          <leafValues>
+            -2.6104170083999634e-01 1.7242910340428352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3640 4.5905262231826782e-03</internalNodes>
+          <leafValues>
+            -3.8419000804424286e-02 1.7464800179004669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3641 -4.2836060747504234e-03</internalNodes>
+          <leafValues>
+            -1.2006240338087082e-01 4.1917610913515091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3642 -1.0835780203342438e-01</internalNodes>
+          <leafValues>
+            5.4927551746368408e-01 -1.2255569919943810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3643 6.4851208589971066e-03</internalNodes>
+          <leafValues>
+            4.4952411204576492e-02 -1.6583940386772156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3644 -2.3725129663944244e-02</internalNodes>
+          <leafValues>
+            5.7158672809600830e-01 -1.2361500412225723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3645 -3.0070519074797630e-02</internalNodes>
+          <leafValues>
+            -3.0609959363937378e-01 1.1695429682731628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3646 -7.9774633049964905e-03</internalNodes>
+          <leafValues>
+            -1.8185980618000031e-01 3.6925770342350006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3647 -1.7213199287652969e-02</internalNodes>
+          <leafValues>
+            1.2317930161952972e-01 -3.6632679402828217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3648 -1.4119789702817798e-03</internalNodes>
+          <leafValues>
+            -5.0499087572097778e-01 1.3695210218429565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3649 2.9909020289778709e-02</internalNodes>
+          <leafValues>
+            -2.3535439744591713e-02 1.4312979578971863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3650 -1.1660479940474033e-02</internalNodes>
+          <leafValues>
+            -1.7822280526161194e-01 4.0250599384307861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3651 -8.9040184393525124e-03</internalNodes>
+          <leafValues>
+            3.5567161440849304e-01 -2.4783140048384666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3652 -1.1394720058888197e-03</internalNodes>
+          <leafValues>
+            -1.4268599450588226e-01 4.9102801829576492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3653 2.9107509180903435e-03</internalNodes>
+          <leafValues>
+            -5.4471809417009354e-02 1.3025890290737152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3654 1.7640810459852219e-02</internalNodes>
+          <leafValues>
+            2.0184019580483437e-02 -4.1954588890075684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3655 5.0001900643110275e-02</internalNodes>
+          <leafValues>
+            1.1975940316915512e-02 -5.1889878511428833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3656 2.7523660100996494e-03</internalNodes>
+          <leafValues>
+            -6.0628410428762436e-02 1.1169119924306870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3657 -3.1753338873386383e-02</internalNodes>
+          <leafValues>
+            -2.2611990571022034e-01 1.5267389826476574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3658 -1.2823809869587421e-02</internalNodes>
+          <leafValues>
+            2.3027139902114868e-01 -2.9404800385236740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3659 5.2626157412305474e-04</internalNodes>
+          <leafValues>
+            -1.5677809715270996e-01 4.9938481301069260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3660 1.2779150158166885e-02</internalNodes>
+          <leafValues>
+            -5.8851849287748337e-02 1.2255299836397171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3661 7.7667668461799622e-02</internalNodes>
+          <leafValues>
+            4.6644411049783230e-03 -5.0614321231842041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3662 -5.2286800928413868e-03</internalNodes>
+          <leafValues>
+            -1.8939809501171112e-01 4.4714428484439850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3663 8.4478305652737617e-03</internalNodes>
+          <leafValues>
+            3.9108898490667343e-02 -1.4809159934520721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3664 5.5970861576497555e-03</internalNodes>
+          <leafValues>
+            5.4664470255374908e-02 -1.4698089659214020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3665 1.6882989555597305e-02</internalNodes>
+          <leafValues>
+            -4.6449739485979080e-02 1.4121970534324646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3666 -6.1205658130347729e-04</internalNodes>
+          <leafValues>
+            -1.3906019926071167e-01 5.2586868405342102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3667 -3.6216019652783871e-03</internalNodes>
+          <leafValues>
+            5.3345881402492523e-02 -3.8361679762601852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3668 -1.4149090275168419e-03</internalNodes>
+          <leafValues>
+            2.0082549750804901e-01 -3.5985361784696579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3669 2.4758750805631280e-04</internalNodes>
+          <leafValues>
+            -1.8205779790878296e-01 1.5915339812636375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3670 1.3457840681076050e-01</internalNodes>
+          <leafValues>
+            9.7890906035900116e-03 -7.2879707813262939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3671 1.1352010071277618e-02</internalNodes>
+          <leafValues>
+            -3.5553149878978729e-02 6.3222207129001617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3672 -7.9044885933399200e-03</internalNodes>
+          <leafValues>
+            9.0774089097976685e-02 -9.8796442151069641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3673 7.9050168395042419e-02</internalNodes>
+          <leafValues>
+            4.7087217681109905e-03 -6.0529369115829468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3674 8.9114397997036576e-04</internalNodes>
+          <leafValues>
+            -9.0216107666492462e-02 8.4293842315673828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3675 4.1404040530323982e-03</internalNodes>
+          <leafValues>
+            6.0314171016216278e-02 -1.2171939760446548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3676 -9.2683091759681702e-02</internalNodes>
+          <leafValues>
+            6.7853301763534546e-01 -1.0615170001983643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3677 4.2872380465269089e-02</internalNodes>
+          <leafValues>
+            7.3283850215375423e-03 -5.2321487665176392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3678 -3.0652560293674469e-02</internalNodes>
+          <leafValues>
+            -6.5578341484069824e-01 9.7402445971965790e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3679 7.5054399669170380e-02</internalNodes>
+          <leafValues>
+            -1.1660519987344742e-02 3.7559139728546143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3680 9.3033112585544586e-02</internalNodes>
+          <leafValues>
+            7.4912221170961857e-03 -8.1748551130294800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3681 -4.0522208437323570e-03</internalNodes>
+          <leafValues>
+            3.6431130766868591e-01 -1.8015889450907707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3682 1.0411429684609175e-03</internalNodes>
+          <leafValues>
+            -1.9623729586601257e-01 3.4336969256401062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3683 4.0790800005197525e-02</internalNodes>
+          <leafValues>
+            1.7464859411120415e-02 -3.8497269153594971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3684 -1.8009789346251637e-04</internalNodes>
+          <leafValues>
+            5.2157621830701828e-02 -1.2038189917802811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3685 -3.5496380180120468e-02</internalNodes>
+          <leafValues>
+            2.1371629834175110e-01 -9.4601595774292946e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3686 -1.2321450049057603e-03</internalNodes>
+          <leafValues>
+            -1.2999939918518066e-01 4.8752531409263611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3687 -6.6326446831226349e-02</internalNodes>
+          <leafValues>
+            -5.0795209407806396e-01 5.8305650018155575e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3688 -2.7689670678228140e-03</internalNodes>
+          <leafValues>
+            1.2596920132637024e-01 -5.5794779211282730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3689 3.9610429666936398e-03</internalNodes>
+          <leafValues>
+            -8.4471739828586578e-02 6.2092550098896027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3690 -7.5474479235708714e-03</internalNodes>
+          <leafValues>
+            -2.0992270112037659e-01 3.1419910490512848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3691 -3.2456999178975821e-03</internalNodes>
+          <leafValues>
+            5.6223601102828979e-02 -3.6774989217519760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3692 -5.0519341602921486e-03</internalNodes>
+          <leafValues>
+            9.4136670231819153e-02 -8.0893777310848236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3693 2.1375959739089012e-02</internalNodes>
+          <leafValues>
+            4.9529589712619781e-02 -4.7989148646593094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3694 -1.6724619269371033e-01</internalNodes>
+          <leafValues>
+            -9.3551367521286011e-01 7.4155409820377827e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3695 6.4946119673550129e-03</internalNodes>
+          <leafValues>
+            -3.6735821515321732e-02 1.0955040156841278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3696 -5.5810972116887569e-03</internalNodes>
+          <leafValues>
+            -1.2764470279216766e-01 5.8691799640655518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3697 -7.0414197398349643e-04</internalNodes>
+          <leafValues>
+            3.9361558854579926e-02 -7.4844732880592346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3698 -7.3160971514880657e-03</internalNodes>
+          <leafValues>
+            2.1767179667949677e-01 -3.8703199476003647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3699 -5.4676099680364132e-03</internalNodes>
+          <leafValues>
+            -5.3973350673913956e-02 5.5032800883054733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3700 4.3309312313795090e-03</internalNodes>
+          <leafValues>
+            5.7104710489511490e-02 -1.2603929638862610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3701 2.8189779259264469e-03</internalNodes>
+          <leafValues>
+            -3.9729248732328415e-02 9.2701591551303864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3702 -4.7759278677403927e-03</internalNodes>
+          <leafValues>
+            -1.2856410443782806e-01 6.1216689646244049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3703 6.3424631953239441e-02</internalNodes>
+          <leafValues>
+            -4.8541268333792686e-03 5.9883451461791992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3704 -3.5035109613090754e-03</internalNodes>
+          <leafValues>
+            1.0191550105810165e-01 -9.8801277577877045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3705 -4.1303951293230057e-03</internalNodes>
+          <leafValues>
+            1.0890380293130875e-01 -3.8225919008255005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3706 -2.2271529305726290e-03</internalNodes>
+          <leafValues>
+            -1.3501960039138794e-01 5.1316611468791962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3707 -1.0730850044637918e-03</internalNodes>
+          <leafValues>
+            5.1526721566915512e-02 -7.4171036481857300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3708 -7.7973678708076477e-04</internalNodes>
+          <leafValues>
+            7.0857577025890350e-02 -1.1204849928617477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3709 -5.5701348930597305e-02</internalNodes>
+          <leafValues>
+            3.9836230874061584e-01 -5.2183559164404869e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3710 1.0608229786157608e-02</internalNodes>
+          <leafValues>
+            -3.2323788851499557e-02 2.1950970590114594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3711 -9.8208207637071609e-03</internalNodes>
+          <leafValues>
+            -1.6507670283317566e-01 4.2444411665201187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3712 1.4465330168604851e-03</internalNodes>
+          <leafValues>
+            -7.8392669558525085e-02 8.1393733620643616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3713 -4.4582188129425049e-03</internalNodes>
+          <leafValues>
+            -9.2314578592777252e-02 3.8734171539545059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3714 5.6474958546459675e-03</internalNodes>
+          <leafValues>
+            3.9651289582252502e-02 -1.7495639622211456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3715 4.2097918689250946e-02</internalNodes>
+          <leafValues>
+            -1.1850739829242229e-02 1.2762710452079773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3716 6.9958101958036423e-03</internalNodes>
+          <leafValues>
+            -4.7668740153312683e-02 1.4204859733581543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3717 3.8686778396368027e-02</internalNodes>
+          <leafValues>
+            1.3582780025899410e-02 -4.7315898537635803e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>238</maxWeakCount>
+      <stageThreshold>-1.4597640037536621e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3718 3.5009320825338364e-02</internalNodes>
+          <leafValues>
+            -2.7020230889320374e-01 2.0429250597953796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3719 -3.6780539900064468e-02</internalNodes>
+          <leafValues>
+            1.5254889428615570e-01 -2.6741871237754822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3720 5.6993318721652031e-03</internalNodes>
+          <leafValues>
+            1.6803050041198730e-01 -2.3068240284919739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3721 7.5601637363433838e-02</internalNodes>
+          <leafValues>
+            -1.5271709859371185e-01 1.9510839879512787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3722 -1.7248390242457390e-02</internalNodes>
+          <leafValues>
+            2.9379200935363770e-01 -9.8869532346725464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3723 2.8574180323630571e-03</internalNodes>
+          <leafValues>
+            -1.9790470600128174e-01 8.3361737430095673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3724 3.1029269099235535e-02</internalNodes>
+          <leafValues>
+            -2.1582309901714325e-01 1.1695130169391632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3725 -7.1099428460001945e-03</internalNodes>
+          <leafValues>
+            -2.5206819176673889e-01 3.6116510629653931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3726 4.5894421637058258e-03</internalNodes>
+          <leafValues>
+            -2.9707619547843933e-01 1.0743969678878784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3727 -7.0509258657693863e-03</internalNodes>
+          <leafValues>
+            -4.5635029673576355e-01 4.1864778846502304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3728 6.6762260394170880e-04</internalNodes>
+          <leafValues>
+            -1.7432719469070435e-01 1.2306489795446396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3729 -3.6481819115579128e-03</internalNodes>
+          <leafValues>
+            -4.0347629785537720e-01 4.9114771187305450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3730 2.2194240242242813e-02</internalNodes>
+          <leafValues>
+            6.1241529881954193e-02 -3.4557360410690308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3731 -1.1259679449722171e-03</internalNodes>
+          <leafValues>
+            5.2013769745826721e-02 -2.8461641073226929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3732 -1.5913739800453186e-02</internalNodes>
+          <leafValues>
+            -2.7667850255966187e-01 7.5852021574974060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3733 5.7643437758088112e-03</internalNodes>
+          <leafValues>
+            -2.7182090282440186e-01 6.6790662705898285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3734 -4.2196471244096756e-02</internalNodes>
+          <leafValues>
+            1.5786080062389374e-01 -1.0557679831981659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3735 -1.8624680116772652e-02</internalNodes>
+          <leafValues>
+            -2.5504299998283386e-01 4.7586869448423386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3736 -9.5020089065656066e-04</internalNodes>
+          <leafValues>
+            4.9903839826583862e-02 -2.9068550467491150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3737 2.0823240280151367e-02</internalNodes>
+          <leafValues>
+            2.6825139299035072e-02 -2.0558500289916992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3738 -1.3118459843099117e-02</internalNodes>
+          <leafValues>
+            -2.2395209968090057e-01 6.9013498723506927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3739 -8.6902417242527008e-03</internalNodes>
+          <leafValues>
+            1.9493189454078674e-01 -3.7850689142942429e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3740 4.5589819550514221e-02</internalNodes>
+          <leafValues>
+            2.5170389562845230e-02 -5.7766669988632202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3741 -4.8458490520715714e-02</internalNodes>
+          <leafValues>
+            9.5191553235054016e-02 -1.4320190250873566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3742 -7.2761103510856628e-02</internalNodes>
+          <leafValues>
+            -6.5967410802841187e-01 2.1175239235162735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3743 -5.3840368986129761e-02</internalNodes>
+          <leafValues>
+            -3.6426779627799988e-01 2.4827929213643074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3744 2.3190240608528256e-04</internalNodes>
+          <leafValues>
+            -1.4767690002918243e-01 8.3764038980007172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3745 -3.4166979603469372e-03</internalNodes>
+          <leafValues>
+            -1.7865709960460663e-01 6.0721088200807571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3746 4.9744218587875366e-02</internalNodes>
+          <leafValues>
+            1.8918199464678764e-02 -6.6629868745803833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3747 6.6813439130783081e-02</internalNodes>
+          <leafValues>
+            -2.8286559507250786e-02 1.7401529848575592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3748 3.1445559114217758e-02</internalNodes>
+          <leafValues>
+            5.2556060254573822e-02 -3.0884549021720886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3749 3.9593618363142014e-02</internalNodes>
+          <leafValues>
+            -6.4875252544879913e-02 2.5706759095191956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3750 1.8663380295038223e-02</internalNodes>
+          <leafValues>
+            -5.9568431228399277e-02 2.1532599627971649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3751 4.0150571614503860e-02</internalNodes>
+          <leafValues>
+            1.9589129835367203e-02 -3.5392150282859802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3752 -1.8263690173625946e-02</internalNodes>
+          <leafValues>
+            -3.1224039196968079e-01 4.1845381259918213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3753 -2.2579960525035858e-02</internalNodes>
+          <leafValues>
+            -1.4898709952831268e-01 1.7757140100002289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3754 8.5281759500503540e-02</internalNodes>
+          <leafValues>
+            2.4866759777069092e-02 -5.2197951078414917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3755 4.9491669051349163e-03</internalNodes>
+          <leafValues>
+            4.0433339774608612e-02 -1.1230610311031342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3756 -2.7419520542025566e-02</internalNodes>
+          <leafValues>
+            -4.1119968891143799e-01 3.0549079179763794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3757 3.8277640938758850e-02</internalNodes>
+          <leafValues>
+            1.2211250141263008e-02 -8.1860828399658203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3758 -2.1632280200719833e-02</internalNodes>
+          <leafValues>
+            2.2030480206012726e-01 -5.5459130555391312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3759 -2.4522699415683746e-01</internalNodes>
+          <leafValues>
+            4.1013330221176147e-01 -2.7000149711966515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3760 3.9314631372690201e-02</internalNodes>
+          <leafValues>
+            -3.1242560595273972e-02 3.6714181303977966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3761 1.3630360364913940e-02</internalNodes>
+          <leafValues>
+            -1.3902300596237183e-01 9.5946237444877625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3762 -6.7042862065136433e-03</internalNodes>
+          <leafValues>
+            7.8772000968456268e-02 -1.4522729814052582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3763 2.3312810808420181e-02</internalNodes>
+          <leafValues>
+            2.2815790027379990e-02 -4.4990560412406921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3764 3.0621029436588287e-02</internalNodes>
+          <leafValues>
+            -6.9781273603439331e-02 1.5422509610652924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3765 5.2047189325094223e-02</internalNodes>
+          <leafValues>
+            -1.7720200121402740e-02 4.4397410750389099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3766 2.0850539207458496e-02</internalNodes>
+          <leafValues>
+            -5.2309051156044006e-02 2.0608800649642944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3767 8.2694664597511292e-03</internalNodes>
+          <leafValues>
+            7.7132821083068848e-02 -1.9474139809608459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3768 5.5706288665533066e-02</internalNodes>
+          <leafValues>
+            3.3715151250362396e-02 -3.5783401131629944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3769 -2.5406919419765472e-02</internalNodes>
+          <leafValues>
+            -2.1424999833106995e-01 5.3813599050045013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3770 3.7127479445189238e-03</internalNodes>
+          <leafValues>
+            5.7478290051221848e-02 -1.7734010517597198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3771 9.8399087786674500e-02</internalNodes>
+          <leafValues>
+            -3.5304271150380373e-03 7.7086448669433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3772 -7.0944158360362053e-03</internalNodes>
+          <leafValues>
+            -1.3782690465450287e-01 7.0290572941303253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3773 -7.8213073313236237e-02</internalNodes>
+          <leafValues>
+            4.6844071149826050e-01 -4.8642340116202831e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3774 3.0407020822167397e-02</internalNodes>
+          <leafValues>
+            -2.8489479795098305e-02 3.4157308936119080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3775 1.7667879583314061e-03</internalNodes>
+          <leafValues>
+            -1.4614230394363403e-01 2.3572970181703568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3776 7.1991011500358582e-02</internalNodes>
+          <leafValues>
+            -3.5075180232524872e-02 2.8865718841552734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3777 5.0020869821310043e-02</internalNodes>
+          <leafValues>
+            2.4096360430121422e-02 -3.3890551328659058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3778 -1.7998270690441132e-02</internalNodes>
+          <leafValues>
+            2.9191690683364868e-01 -4.1259169578552246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3779 -8.6585222743451595e-04</internalNodes>
+          <leafValues>
+            -1.2248259782791138e-01 5.9690121561288834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3780 5.7470470666885376e-02</internalNodes>
+          <leafValues>
+            2.1541740745306015e-02 -4.7508370876312256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3781 -1.6517810523509979e-02</internalNodes>
+          <leafValues>
+            1.6598740220069885e-01 -3.9656970649957657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3782 2.1703030914068222e-02</internalNodes>
+          <leafValues>
+            -3.8327228277921677e-02 3.3476251363754272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3783 -6.1237839981913567e-03</internalNodes>
+          <leafValues>
+            -1.4342689514160156e-01 2.6313329115509987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3784 -1.0893509723246098e-02</internalNodes>
+          <leafValues>
+            -7.9468882083892822e-01 1.2403479777276516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3785 -3.8589738309383392e-02</internalNodes>
+          <leafValues>
+            3.3763501048088074e-01 -1.8747940659523010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3786 1.3378040166571736e-03</internalNodes>
+          <leafValues>
+            -3.6288881301879883e-01 2.9460189864039421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3787 2.7590300305746496e-04</internalNodes>
+          <leafValues>
+            7.6419189572334290e-02 -8.6953632533550262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3788 7.9552736133337021e-03</internalNodes>
+          <leafValues>
+            5.2696179598569870e-02 -1.9200770556926727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3789 -1.2174629606306553e-02</internalNodes>
+          <leafValues>
+            8.4013037383556366e-02 -2.1740090101957321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3790 -1.6361070796847343e-02</internalNodes>
+          <leafValues>
+            -2.5493758916854858e-01 3.8582589477300644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3791 -3.4992128610610962e-02</internalNodes>
+          <leafValues>
+            2.5760510563850403e-01 -1.5727080404758453e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3792 -7.6113208197057247e-03</internalNodes>
+          <leafValues>
+            1.9114670157432556e-01 -5.2980780601501465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3793 5.0110749900341034e-02</internalNodes>
+          <leafValues>
+            2.4265250191092491e-02 -5.1509189605712891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3794 -9.1486647725105286e-03</internalNodes>
+          <leafValues>
+            -3.3170440793037415e-01 2.6774439960718155e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3795 8.3293259143829346e-02</internalNodes>
+          <leafValues>
+            4.2860410176217556e-03 -3.0381551384925842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3796 -1.9334359094500542e-02</internalNodes>
+          <leafValues>
+            3.8916379213333130e-01 -2.4908309802412987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3797 -7.2061046957969666e-02</internalNodes>
+          <leafValues>
+            4.1184291243553162e-01 -2.5687059387564659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3798 2.2506359964609146e-02</internalNodes>
+          <leafValues>
+            -2.1196739375591278e-01 5.3825020790100098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3799 5.5772401392459869e-02</internalNodes>
+          <leafValues>
+            -2.3104140534996986e-02 9.1578252613544464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3800 -2.6210390031337738e-02</internalNodes>
+          <leafValues>
+            3.3509409427642822e-01 -3.4225810319185257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3801 -4.6085331588983536e-02</internalNodes>
+          <leafValues>
+            -5.3006750345230103e-01 1.9083080813288689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3802 -3.2998260110616684e-02</internalNodes>
+          <leafValues>
+            3.0701389908790588e-01 -3.1638059765100479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3803 1.0677659884095192e-02</internalNodes>
+          <leafValues>
+            3.8186781108379364e-02 -2.0256699621677399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3804 3.7972650025039911e-03</internalNodes>
+          <leafValues>
+            7.8951433300971985e-02 -1.3040140271186829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3805 -2.4965009652078152e-03</internalNodes>
+          <leafValues>
+            -1.9799210131168365e-01 3.0743129551410675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3806 1.4203139580786228e-02</internalNodes>
+          <leafValues>
+            -4.5443460345268250e-02 2.1806409955024719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3807 7.7012999099679291e-05</internalNodes>
+          <leafValues>
+            -2.5858289003372192e-01 4.2508359998464584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3808 2.3724909406155348e-03</internalNodes>
+          <leafValues>
+            -1.5815889835357666e-01 6.1494071036577225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3809 -8.4086082875728607e-02</internalNodes>
+          <leafValues>
+            -9.3704527616500854e-01 8.3687662845477462e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3810 -2.2892290726304054e-02</internalNodes>
+          <leafValues>
+            4.2960539460182190e-01 -2.7215819805860519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3811 -1.1238969862461090e-01</internalNodes>
+          <leafValues>
+            -2.0607289671897888e-01 1.7798800021409988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3812 6.8175032734870911e-02</internalNodes>
+          <leafValues>
+            -4.2019781470298767e-01 2.5051090866327286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3813 -1.0620189830660820e-02</internalNodes>
+          <leafValues>
+            -2.1870230138301849e-01 2.4231420829892159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3814 2.9390859417617321e-03</internalNodes>
+          <leafValues>
+            8.8470183312892914e-02 -1.1958040297031403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3815 5.6766260415315628e-02</internalNodes>
+          <leafValues>
+            -5.8820329606533051e-02 1.7845800518989563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3816 -7.3099520523101091e-04</internalNodes>
+          <leafValues>
+            3.0122080445289612e-01 -3.4890830516815186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3817 3.4174978733062744e-02</internalNodes>
+          <leafValues>
+            1.9614150747656822e-02 -1.7419980466365814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3818 3.3152099698781967e-02</internalNodes>
+          <leafValues>
+            2.9344469308853149e-02 -3.5163739323616028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3819 1.7158590257167816e-02</internalNodes>
+          <leafValues>
+            -4.7744009643793106e-02 2.0690310001373291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3820 -3.3270310610532761e-02</internalNodes>
+          <leafValues>
+            -3.6818051338195801e-01 3.0547879636287689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3821 -7.5228337664157152e-04</internalNodes>
+          <leafValues>
+            -1.0068210214376450e-01 3.7446059286594391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3822 -5.7363631203770638e-03</internalNodes>
+          <leafValues>
+            -2.9704639315605164e-01 3.0889809131622314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3823 3.4203678369522095e-02</internalNodes>
+          <leafValues>
+            3.2694388180971146e-02 -1.9386410713195801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3824 1.1759670078754425e-01</internalNodes>
+          <leafValues>
+            2.8010509908199310e-02 -3.4469729661941528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3825 3.5684760659933090e-02</internalNodes>
+          <leafValues>
+            1.4612049795687199e-02 -3.2323908805847168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3826 -1.4562480151653290e-01</internalNodes>
+          <leafValues>
+            -4.3703469634056091e-01 2.0697519183158875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3827 8.0413380637764931e-03</internalNodes>
+          <leafValues>
+            1.8440550193190575e-02 -3.2272771000862122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3828 5.3446288220584393e-03</internalNodes>
+          <leafValues>
+            5.0503399223089218e-02 -1.8428540229797363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3829 8.6473226547241211e-02</internalNodes>
+          <leafValues>
+            6.2484769150614738e-03 -9.3612897396087646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3830 6.6168710589408875e-02</internalNodes>
+          <leafValues>
+            -5.9868391603231430e-02 1.5810599923133850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3831 2.8978990390896797e-02</internalNodes>
+          <leafValues>
+            2.8844339773058891e-02 -2.8269919753074646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3832 1.8636519089341164e-02</internalNodes>
+          <leafValues>
+            -5.1709290593862534e-02 1.7777459323406219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3833 -2.6881769299507141e-02</internalNodes>
+          <leafValues>
+            7.3635026812553406e-02 -3.6229219287633896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3834 -1.3696019537746906e-02</internalNodes>
+          <leafValues>
+            1.8215629458427429e-01 -5.9880878776311874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3835 -4.1931979358196259e-03</internalNodes>
+          <leafValues>
+            -9.3321792781352997e-02 2.7901070192456245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3836 2.2784220054745674e-02</internalNodes>
+          <leafValues>
+            3.0631329864263535e-02 -2.8531938791275024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3837 -8.3819748833775520e-03</internalNodes>
+          <leafValues>
+            -2.3251660168170929e-01 5.0801441073417664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3838 -6.4928620122373104e-03</internalNodes>
+          <leafValues>
+            1.1060830205678940e-01 -8.3281010389328003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3839 5.5866848677396774e-02</internalNodes>
+          <leafValues>
+            2.3439039289951324e-01 -4.5191779732704163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3840 -1.0926710441708565e-02</internalNodes>
+          <leafValues>
+            2.0532840490341187e-01 -5.0775919109582901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3841 1.7515379935503006e-02</internalNodes>
+          <leafValues>
+            3.6728449165821075e-02 -3.0638590455055237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3842 1.4543980360031128e-02</internalNodes>
+          <leafValues>
+            4.4784490019083023e-02 -2.0757840573787689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3843 1.7274370184168220e-03</internalNodes>
+          <leafValues>
+            2.3706600069999695e-02 -1.8639369308948517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3844 2.0160499960184097e-02</internalNodes>
+          <leafValues>
+            4.1744660586118698e-02 -2.1943749487400055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3845 -5.5732231587171555e-02</internalNodes>
+          <leafValues>
+            -3.7666681408882141e-01 7.3045571334660053e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3846 -4.2138090357184410e-03</internalNodes>
+          <leafValues>
+            1.1314260214567184e-01 -8.4451928734779358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3847 -5.7113498449325562e-02</internalNodes>
+          <leafValues>
+            -4.1903460025787354e-01 4.2158551514148712e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3848 -3.3385161310434341e-02</internalNodes>
+          <leafValues>
+            -3.9007860422134399e-01 2.5290969759225845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3849 -8.5305999964475632e-03</internalNodes>
+          <leafValues>
+            5.3572379052639008e-02 -1.2238460034132004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3850 -1.5144890174269676e-02</internalNodes>
+          <leafValues>
+            4.5743760466575623e-01 -2.5002999231219292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3851 7.5857941992580891e-03</internalNodes>
+          <leafValues>
+            2.6268539950251579e-02 -9.8890319466590881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3852 -6.4347468316555023e-02</internalNodes>
+          <leafValues>
+            2.2607059776782990e-01 -4.1821580380201340e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3853 6.5772183239459991e-02</internalNodes>
+          <leafValues>
+            2.4147959426045418e-02 -4.0227779746055603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3854 -1.0496930032968521e-01</internalNodes>
+          <leafValues>
+            -4.6343261003494263e-01 1.9134109839797020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3855 9.6320390701293945e-02</internalNodes>
+          <leafValues>
+            8.7147848680615425e-03 -3.5269328951835632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3856 1.6651069745421410e-02</internalNodes>
+          <leafValues>
+            -2.3842410743236542e-01 3.8928661495447159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3857 5.8829918503761292e-02</internalNodes>
+          <leafValues>
+            -1.6538100317120552e-02 3.3465591073036194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3858 5.2411198616027832e-02</internalNodes>
+          <leafValues>
+            -1.9688919186592102e-02 4.6966078877449036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3859 1.2325269635766745e-03</internalNodes>
+          <leafValues>
+            -1.2056189775466919e-01 5.0563529133796692e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3860 -2.4530949071049690e-02</internalNodes>
+          <leafValues>
+            -3.9168059825897217e-01 2.3108620196580887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3861 3.5507690161466599e-02</internalNodes>
+          <leafValues>
+            2.0499339327216148e-02 -3.6233830451965332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3862 -1.5282739885151386e-02</internalNodes>
+          <leafValues>
+            -2.4604129791259766e-01 3.4749999642372131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3863 6.0466449707746506e-02</internalNodes>
+          <leafValues>
+            -5.5071748793125153e-02 2.0428660511970520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3864 6.5809831023216248e-02</internalNodes>
+          <leafValues>
+            -7.1466080844402313e-02 1.2002970278263092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3865 -7.9543672502040863e-02</internalNodes>
+          <leafValues>
+            4.9044218659400940e-01 -7.8059309162199497e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3866 7.1057200431823730e-02</internalNodes>
+          <leafValues>
+            4.4219430536031723e-02 -2.1077010035514832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3867 1.2412209762260318e-03</internalNodes>
+          <leafValues>
+            9.9759846925735474e-02 -7.4065141379833221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3868 4.3900560587644577e-02</internalNodes>
+          <leafValues>
+            2.0245339721441269e-02 -4.7800138592720032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3869 1.3814829289913177e-01</internalNodes>
+          <leafValues>
+            -3.4169729799032211e-02 2.0662400126457214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3870 6.4026713371276855e-02</internalNodes>
+          <leafValues>
+            1.7396930605173111e-02 -5.7749879360198975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3871 -1.2456770054996014e-02</internalNodes>
+          <leafValues>
+            -1.6710869967937469e-01 1.2106380425393581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3872 3.7183608859777451e-02</internalNodes>
+          <leafValues>
+            -1.9024299457669258e-02 4.4476169347763062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3873 -3.4905251115560532e-02</internalNodes>
+          <leafValues>
+            -1.4648060500621796e-01 2.0895779132843018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3874 6.1689559370279312e-02</internalNodes>
+          <leafValues>
+            1.2428649701178074e-02 -7.1737641096115112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3875 -2.7358489111065865e-02</internalNodes>
+          <leafValues>
+            -2.4311469495296478e-01 2.6138730347156525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3876 6.3740741461515427e-03</internalNodes>
+          <leafValues>
+            -8.2593016326427460e-02 1.1356580257415771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3877 -1.0299839824438095e-01</internalNodes>
+          <leafValues>
+            4.5398610830307007e-01 -1.6315529122948647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3878 -1.4695020392537117e-02</internalNodes>
+          <leafValues>
+            -1.8050310015678406e-01 4.8061780631542206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3879 6.0288330132607371e-05</internalNodes>
+          <leafValues>
+            -9.8974503576755524e-02 3.8105670362710953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3880 -1.3763650320470333e-02</internalNodes>
+          <leafValues>
+            4.5689401030540466e-01 -2.0808599889278412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3881 5.1598600111901760e-03</internalNodes>
+          <leafValues>
+            2.8479820117354393e-02 -1.9778659939765930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3882 6.6321617923676968e-03</internalNodes>
+          <leafValues>
+            -6.1560358852148056e-02 1.4045900106430054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3883 -1.1073590256273746e-02</internalNodes>
+          <leafValues>
+            1.1272329837083817e-01 -3.8423039019107819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3884 7.3836948722600937e-03</internalNodes>
+          <leafValues>
+            2.4575280025601387e-02 -3.3994451165199280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3885 -1.9277689978480339e-02</internalNodes>
+          <leafValues>
+            1.5732249617576599e-01 -5.8382220566272736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3886 -2.6209199801087379e-02</internalNodes>
+          <leafValues>
+            -3.2575431466102600e-01 3.5296149551868439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3887 1.3872079551219940e-02</internalNodes>
+          <leafValues>
+            2.7504689991474152e-02 -2.0510050654411316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3888 2.5171930901706219e-03</internalNodes>
+          <leafValues>
+            6.9805637001991272e-02 -1.1518660187721252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3889 6.7753292620182037e-02</internalNodes>
+          <leafValues>
+            -3.7268139421939850e-02 2.3363080620765686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3890 -2.4352179840207100e-02</internalNodes>
+          <leafValues>
+            -2.1191249787807465e-01 4.2971581220626831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3891 -1.5085450373589993e-02</internalNodes>
+          <leafValues>
+            1.4743280410766602e-01 -3.8589131087064743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3892 3.0052060261368752e-02</internalNodes>
+          <leafValues>
+            4.3882489204406738e-02 -2.0401340723037720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3893 -7.9878583550453186e-02</internalNodes>
+          <leafValues>
+            7.1355827152729034e-02 -3.5806309431791306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3894 -4.9845650792121887e-02</internalNodes>
+          <leafValues>
+            2.8991028666496277e-01 -2.9193209484219551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3895 6.0983549803495407e-02</internalNodes>
+          <leafValues>
+            1.1078090406954288e-02 -8.0549037456512451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3896 -2.4187229573726654e-02</internalNodes>
+          <leafValues>
+            2.0816670358181000e-01 -4.0332991629838943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3897 2.9581909999251366e-02</internalNodes>
+          <leafValues>
+            1.7189880833029747e-02 -3.0174249410629272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3898 -9.6158936619758606e-02</internalNodes>
+          <leafValues>
+            -3.6115181446075439e-01 2.1451879292726517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3899 1.1087789898738265e-03</internalNodes>
+          <leafValues>
+            6.0711268335580826e-02 -1.2995730340480804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3900 3.6577019840478897e-02</internalNodes>
+          <leafValues>
+            -1.5757689252495766e-02 6.1568331718444824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3901 8.9887566864490509e-02</internalNodes>
+          <leafValues>
+            7.5012152083218098e-03 -8.4639918804168701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3902 5.2048689685761929e-03</internalNodes>
+          <leafValues>
+            -5.0408910959959030e-02 1.5618799626827240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3903 3.4727361053228378e-02</internalNodes>
+          <leafValues>
+            2.1034790202975273e-02 -2.1834190189838409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3904 -5.4695051163434982e-02</internalNodes>
+          <leafValues>
+            -8.3126282691955566e-01 8.9029762893915176e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3905 1.5987730026245117e-01</internalNodes>
+          <leafValues>
+            8.5425339639186859e-03 -6.9280862808227539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3906 -3.8558691740036011e-02</internalNodes>
+          <leafValues>
+            -2.7078241109848022e-01 2.7025369927287102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3907 -7.1866370737552643e-02</internalNodes>
+          <leafValues>
+            -3.9044618606567383e-01 1.0923280380666256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3908 1.9590340554714203e-01</internalNodes>
+          <leafValues>
+            1.3423370197415352e-02 -5.4260522127151489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3909 -2.2330079227685928e-02</internalNodes>
+          <leafValues>
+            -1.7275239527225494e-01 2.9058510437607765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3910 5.1018559932708740e-01</internalNodes>
+          <leafValues>
+            1.1418639682233334e-02 -6.7876529693603516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3911 -1.1239909566938877e-02</internalNodes>
+          <leafValues>
+            1.1462499946355820e-01 -5.6867629289627075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3912 1.7486160621047020e-02</internalNodes>
+          <leafValues>
+            5.2641868591308594e-02 -1.6195179522037506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3913 -1.4517609961330891e-03</internalNodes>
+          <leafValues>
+            -1.0877469927072525e-01 5.6960400193929672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3914 3.7016559392213821e-02</internalNodes>
+          <leafValues>
+            1.7460089176893234e-02 -4.6505320072174072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3915 -8.6366441100835800e-03</internalNodes>
+          <leafValues>
+            7.3076270520687103e-02 -1.0616590082645416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3916 1.9361129961907864e-03</internalNodes>
+          <leafValues>
+            -1.4585369825363159e-01 5.9394489973783493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3917 -2.3119550198316574e-02</internalNodes>
+          <leafValues>
+            -9.4876237213611603e-02 3.0387479811906815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3918 6.3178739510476589e-03</internalNodes>
+          <leafValues>
+            -1.0537099838256836e-01 7.7892847359180450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3919 1.0961949825286865e-02</internalNodes>
+          <leafValues>
+            -6.6041983664035797e-02 1.0566339641809464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3920 -4.2129520326852798e-02</internalNodes>
+          <leafValues>
+            2.4344080686569214e-01 -5.1573678851127625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3921 4.5132819563150406e-02</internalNodes>
+          <leafValues>
+            1.0772050358355045e-02 -7.6156777143478394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3922 9.4924736768007278e-03</internalNodes>
+          <leafValues>
+            4.5273378491401672e-02 -1.8770030140876770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3923 -1.1573860049247742e-01</internalNodes>
+          <leafValues>
+            4.4831728935241699e-01 -8.6225848644971848e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3924 1.5801179688423872e-03</internalNodes>
+          <leafValues>
+            -1.0931409895420074e-01 7.9391218721866608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3925 -4.4442281126976013e-02</internalNodes>
+          <leafValues>
+            3.3827048540115356e-01 -2.6649719104170799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3926 -6.5993092954158783e-02</internalNodes>
+          <leafValues>
+            -5.3106492757797241e-01 1.7543010413646698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3927 -1.0968820191919804e-02</internalNodes>
+          <leafValues>
+            -1.6612820327281952e-01 4.9488350749015808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3928 3.8149021565914154e-02</internalNodes>
+          <leafValues>
+            -4.1509900242090225e-02 2.0616669952869415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3929 4.0625538676977158e-03</internalNodes>
+          <leafValues>
+            4.8925049602985382e-02 -8.4866181015968323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3930 3.2693019602447748e-03</internalNodes>
+          <leafValues>
+            -1.1883019655942917e-01 8.6803138256072998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3931 -1.2488859938457608e-03</internalNodes>
+          <leafValues>
+            -1.4354729652404785e-01 2.1422969177365303e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3932 -1.7064889892935753e-02</internalNodes>
+          <leafValues>
+            -5.2316349744796753e-01 1.6529040411114693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3933 -2.3354699835181236e-02</internalNodes>
+          <leafValues>
+            -1.9698520004749298e-01 2.1972300484776497e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3934 2.7899529784917831e-02</internalNodes>
+          <leafValues>
+            3.8033228367567062e-02 -2.2323200106620789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3935 -6.7869402468204498e-02</internalNodes>
+          <leafValues>
+            -4.2076128721237183e-01 1.0559639893472195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3936 5.7542059570550919e-02</internalNodes>
+          <leafValues>
+            -4.2111430317163467e-02 2.3515710234642029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3937 -2.1877309679985046e-01</internalNodes>
+          <leafValues>
+            6.9553351402282715e-01 -9.9031934514641762e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3938 3.7776291370391846e-01</internalNodes>
+          <leafValues>
+            -2.4721829220652580e-02 3.0367389321327209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3939 4.1029900312423706e-02</internalNodes>
+          <leafValues>
+            2.1999280899763107e-02 -2.4707089364528656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3940 2.5587070733308792e-02</internalNodes>
+          <leafValues>
+            4.2045179754495621e-02 -2.2333100438117981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3941 6.7200772464275360e-02</internalNodes>
+          <leafValues>
+            -1.6648389399051666e-02 2.4265660345554352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3942 2.8230389580130577e-02</internalNodes>
+          <leafValues>
+            2.9572259634733200e-02 -3.0128848552703857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3943 2.4588680267333984e-01</internalNodes>
+          <leafValues>
+            1.9440819742158055e-03 -4.2153918743133545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3944 -9.5752447843551636e-02</internalNodes>
+          <leafValues>
+            -6.4711397886276245e-01 1.3180449604988098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3945 -1.0596579872071743e-02</internalNodes>
+          <leafValues>
+            -2.0484970510005951e-01 2.8054440394043922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3946 6.7103967070579529e-02</internalNodes>
+          <leafValues>
+            2.9053989797830582e-02 -2.6770511269569397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3947 -7.9280838370323181e-02</internalNodes>
+          <leafValues>
+            2.1911109983921051e-01 -1.5684010460972786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3948 -4.0710358880460262e-03</internalNodes>
+          <leafValues>
+            2.2031579911708832e-01 -4.0581289678812027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3949 3.7690360099077225e-02</internalNodes>
+          <leafValues>
+            -1.2946240603923798e-01 6.1921589076519012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3950 1.8453929573297501e-02</internalNodes>
+          <leafValues>
+            -3.2800889015197754e-01 2.9745969921350479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3951 1.5218369662761688e-01</internalNodes>
+          <leafValues>
+            1.1928870342671871e-02 -4.3678689002990723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3952 1.0948959738016129e-01</internalNodes>
+          <leafValues>
+            2.4663779884576797e-02 -3.1567180156707764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3953 -4.4906709343194962e-02</internalNodes>
+          <leafValues>
+            2.3082759976387024e-01 -2.2163389250636101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3954 1.4668619632720947e-01</internalNodes>
+          <leafValues>
+            1.8490659072995186e-02 -4.6669480204582214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3955 -4.0597580373287201e-02</internalNodes>
+          <leafValues>
+            2.0691379904747009e-01 -4.1412089020013809e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>293</maxWeakCount>
+      <stageThreshold>-1.3393770456314087e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3956 2.5723339058458805e-03</internalNodes>
+          <leafValues>
+            -2.4097059667110443e-01 1.5659730136394501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3957 5.7603712193667889e-03</internalNodes>
+          <leafValues>
+            -4.3601021170616150e-01 8.0516032874584198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3958 -1.0138600319623947e-01</internalNodes>
+          <leafValues>
+            3.9704030752182007e-01 -6.5761536359786987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3959 1.3221249682828784e-03</internalNodes>
+          <leafValues>
+            -4.2382979393005371e-01 2.8659680858254433e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3960 5.4164527682587504e-04</internalNodes>
+          <leafValues>
+            6.7418687045574188e-02 -3.1019261479377747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3961 2.4447739124298096e-03</internalNodes>
+          <leafValues>
+            1.3928419910371304e-02 -2.4488939344882965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3962 1.4049450401216745e-03</internalNodes>
+          <leafValues>
+            -1.5040999650955200e-01 1.2638579308986664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3963 1.1241709580644965e-03</internalNodes>
+          <leafValues>
+            -2.7436348795890808e-01 7.1175657212734222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3964 -1.3413740089163184e-03</internalNodes>
+          <leafValues>
+            -3.7685438990592957e-01 5.0038158893585205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3965 4.1714560240507126e-02</internalNodes>
+          <leafValues>
+            1.1733000166714191e-02 -5.4509437084197998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3966 2.1810019388794899e-03</internalNodes>
+          <leafValues>
+            -2.0847110450267792e-01 8.4929227828979492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3967 1.9655700773000717e-02</internalNodes>
+          <leafValues>
+            2.9568189755082130e-02 -2.4840490520000458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3968 4.9905799096450210e-04</internalNodes>
+          <leafValues>
+            -1.7222259938716888e-01 9.3910522758960724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3969 3.3110571093857288e-03</internalNodes>
+          <leafValues>
+            7.9480826854705811e-02 -1.8249939382076263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3970 3.4921199548989534e-03</internalNodes>
+          <leafValues>
+            6.0159709304571152e-02 -2.3041090369224548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3971 1.3379369629547000e-03</internalNodes>
+          <leafValues>
+            -7.8347019851207733e-02 1.5814539790153503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3972 -3.4234288614243269e-04</internalNodes>
+          <leafValues>
+            -1.5121580660343170e-01 9.5998182892799377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3973 -7.2008459828794003e-03</internalNodes>
+          <leafValues>
+            1.0716210305690765e-01 -1.2086699903011322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3974 -3.3037480898201466e-03</internalNodes>
+          <leafValues>
+            -1.9142769277095795e-01 7.1347109973430634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3975 -8.1909723579883575e-02</internalNodes>
+          <leafValues>
+            -8.5086518526077271e-01 6.6832960583269596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3976 -5.2563002100214362e-04</internalNodes>
+          <leafValues>
+            7.1854703128337860e-02 -2.3162660002708435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3977 -2.1477319300174713e-02</internalNodes>
+          <leafValues>
+            2.2399149835109711e-01 -3.2982278615236282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3978 -5.6700430810451508e-02</internalNodes>
+          <leafValues>
+            5.1475530862808228e-01 -2.3378230631351471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3979 1.8419699743390083e-02</internalNodes>
+          <leafValues>
+            1.8853360787034035e-02 -4.4701090455055237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3980 -8.8926553726196289e-03</internalNodes>
+          <leafValues>
+            1.8497599661350250e-01 -6.6978506743907928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3981 1.2642369605600834e-02</internalNodes>
+          <leafValues>
+            8.6571149528026581e-02 -1.4233930408954620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3982 8.0502573400735855e-03</internalNodes>
+          <leafValues>
+            -7.7052421867847443e-02 2.1340900659561157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3983 -6.9165248423814774e-03</internalNodes>
+          <leafValues>
+            -1.7848269641399384e-01 5.6415598839521408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3984 -1.4194440096616745e-02</internalNodes>
+          <leafValues>
+            1.8763299286365509e-01 -6.7588217556476593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3985 3.5530389286577702e-03</internalNodes>
+          <leafValues>
+            3.8925249129533768e-02 -1.4981240034103394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3986 4.8001301474869251e-03</internalNodes>
+          <leafValues>
+            4.4963311403989792e-02 -2.4595139920711517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3987 9.0420730412006378e-03</internalNodes>
+          <leafValues>
+            -5.3614400327205658e-02 1.3824699819087982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3988 4.3342178687453270e-03</internalNodes>
+          <leafValues>
+            -8.6166441440582275e-02 1.2793409824371338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3989 1.2264699675142765e-02</internalNodes>
+          <leafValues>
+            3.6203060299158096e-02 -3.7494099140167236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3990 4.9155529588460922e-02</internalNodes>
+          <leafValues>
+            -9.1319262981414795e-02 1.2587989866733551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3991 -5.8642931981012225e-04</internalNodes>
+          <leafValues>
+            9.3702591955661774e-02 -1.0736119747161865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3992 3.2971050590276718e-02</internalNodes>
+          <leafValues>
+            2.7238529175519943e-02 -4.5005699992179871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3993 1.6174600459635258e-03</internalNodes>
+          <leafValues>
+            3.2863009721040726e-02 -1.4241309463977814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3994 1.0178020456805825e-03</internalNodes>
+          <leafValues>
+            6.9898538291454315e-02 -1.7507210373878479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3995 3.4081579651683569e-03</internalNodes>
+          <leafValues>
+            -7.7970616519451141e-02 5.8423690497875214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3996 -6.9078300148248672e-03</internalNodes>
+          <leafValues>
+            1.1711090058088303e-01 -9.5380999147891998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3997 -7.8317627776414156e-04</internalNodes>
+          <leafValues>
+            6.3730940222740173e-02 -8.8190883398056030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3998 -1.3578870333731174e-02</internalNodes>
+          <leafValues>
+            -2.7168250083923340e-01 3.9688158780336380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3999 -8.0021530389785767e-02</internalNodes>
+          <leafValues>
+            6.0115522146224976e-01 -2.4968839716166258e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4000 -1.7085570143535733e-03</internalNodes>
+          <leafValues>
+            1.0888680070638657e-01 -1.0520359873771667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4001 8.5700387135148048e-03</internalNodes>
+          <leafValues>
+            -4.1784621775150299e-02 1.4857980608940125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4002 1.5518560074269772e-02</internalNodes>
+          <leafValues>
+            2.1855160593986511e-02 -4.5708781480789185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4003 -1.5739940572530031e-03</internalNodes>
+          <leafValues>
+            5.0655461847782135e-02 -6.9658473134040833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4004 -1.0979890357702971e-03</internalNodes>
+          <leafValues>
+            7.9917587339878082e-02 -1.1895059794187546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4005 -2.6248019188642502e-02</internalNodes>
+          <leafValues>
+            7.0614987611770630e-01 -1.3660780154168606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4006 -1.0281460359692574e-02</internalNodes>
+          <leafValues>
+            -1.8412110209465027e-01 6.6442340612411499e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4007 -3.6530280485749245e-03</internalNodes>
+          <leafValues>
+            1.2995550036430359e-01 -5.8351561427116394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4008 7.8363716602325439e-03</internalNodes>
+          <leafValues>
+            2.7073230594396591e-02 -3.3601909875869751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4009 -1.5283710323274136e-02</internalNodes>
+          <leafValues>
+            2.5562399625778198e-01 -3.5940971225500107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4010 -6.7279259674251080e-03</internalNodes>
+          <leafValues>
+            2.4661159515380859e-01 -4.8673499375581741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4011 1.7807850241661072e-01</internalNodes>
+          <leafValues>
+            6.0471030883491039e-03 -7.2566151618957520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4012 -1.0486179962754250e-03</internalNodes>
+          <leafValues>
+            -1.9335940480232239e-01 5.0940699875354767e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4013 8.9163314551115036e-03</internalNodes>
+          <leafValues>
+            3.3024791628122330e-02 -1.6986289620399475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4014 4.0643039392307401e-04</internalNodes>
+          <leafValues>
+            -1.3117119669914246e-01 6.6818282008171082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4015 -4.7499048709869385e-01</internalNodes>
+          <leafValues>
+            -4.0152749419212341e-01 6.3146720640361309e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4016 1.0430049896240234e-01</internalNodes>
+          <leafValues>
+            2.4024970829486847e-02 -3.2695800065994263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4017 -5.1650121808052063e-02</internalNodes>
+          <leafValues>
+            1.6934829950332642e-01 -1.5539200045168400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4018 4.0506269782781601e-02</internalNodes>
+          <leafValues>
+            -2.2082980722188950e-02 3.9694729447364807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4019 2.4179749190807343e-02</internalNodes>
+          <leafValues>
+            2.1926779299974442e-02 -4.3460670113563538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4020 -3.0531319789588451e-03</internalNodes>
+          <leafValues>
+            -1.4108030498027802e-01 5.6175179779529572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4021 -1.7123650759458542e-02</internalNodes>
+          <leafValues>
+            -6.3341897726058960e-01 9.8466947674751282e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4022 4.1705969721078873e-02</internalNodes>
+          <leafValues>
+            1.0977629572153091e-02 -6.7681282758712769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4023 4.3895491398870945e-03</internalNodes>
+          <leafValues>
+            -5.7781290262937546e-02 1.5501640737056732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4024 -4.4786250218749046e-03</internalNodes>
+          <leafValues>
+            -1.6706019639968872e-01 4.6572938561439514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4025 4.8733421135693789e-04</internalNodes>
+          <leafValues>
+            -1.5037140250205994e-01 4.6920441091060638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4026 1.5530640259385109e-02</internalNodes>
+          <leafValues>
+            2.2556010633707047e-02 -3.2370451092720032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4027 4.5443180948495865e-02</internalNodes>
+          <leafValues>
+            -9.8806591704487801e-03 6.0815322399139404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4028 -7.7960297465324402e-02</internalNodes>
+          <leafValues>
+            4.0743818879127502e-01 -1.8391529098153114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4029 -4.5014719944447279e-04</internalNodes>
+          <leafValues>
+            -3.8319730758666992e-01 1.3420820236206055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4030 -2.1852780133485794e-02</internalNodes>
+          <leafValues>
+            -4.4697651267051697e-01 1.5379330143332481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4031 -6.3410878181457520e-02</internalNodes>
+          <leafValues>
+            3.9926728606224060e-01 -2.2168820723891258e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4032 -6.6417120397090912e-03</internalNodes>
+          <leafValues>
+            -1.4594499766826630e-01 5.1541730761528015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4033 2.0355410873889923e-02</internalNodes>
+          <leafValues>
+            -2.3113679140806198e-02 1.8792650103569031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4034 9.2754261568188667e-03</internalNodes>
+          <leafValues>
+            -5.5808931589126587e-02 1.3504269719123840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4035 -6.4075283706188202e-02</internalNodes>
+          <leafValues>
+            2.6259770989418030e-01 -3.1913250684738159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4036 5.7537898421287537e-02</internalNodes>
+          <leafValues>
+            3.4703690558671951e-02 -2.7203989028930664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4037 -1.3369999825954437e-02</internalNodes>
+          <leafValues>
+            -1.0251790285110474e-01 2.0719829946756363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4038 2.9637520201504230e-03</internalNodes>
+          <leafValues>
+            -5.7579819113016129e-02 1.3346299529075623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4039 -4.7313207760453224e-03</internalNodes>
+          <leafValues>
+            -1.4229220151901245e-01 5.3106248378753662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4040 1.2967540323734283e-01</internalNodes>
+          <leafValues>
+            -2.1926470100879669e-02 3.3583769202232361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4041 -2.8757948894053698e-03</internalNodes>
+          <leafValues>
+            7.4970930814743042e-02 -1.0183060169219971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4042 -1.3546359725296497e-02</internalNodes>
+          <leafValues>
+            -1.5313720703125000e-01 5.2247390151023865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4043 6.3532173633575439e-02</internalNodes>
+          <leafValues>
+            9.1543495655059814e-03 -7.4869108200073242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4044 -1.0261409915983677e-02</internalNodes>
+          <leafValues>
+            1.2742519378662109e-01 -5.6786071509122849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4045 -4.3331928551197052e-02</internalNodes>
+          <leafValues>
+            -6.1829072237014771e-01 8.0406935885548592e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4046 4.0195342153310776e-03</internalNodes>
+          <leafValues>
+            -5.4130308330059052e-02 1.4864480495452881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4047 6.7003332078456879e-03</internalNodes>
+          <leafValues>
+            3.7507299333810806e-02 -1.9986230134963989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4048 -1.1208239942789078e-02</internalNodes>
+          <leafValues>
+            -1.4704710245132446e-01 5.7189401239156723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4049 -3.7890970706939697e-03</internalNodes>
+          <leafValues>
+            1.5529400110244751e-01 -3.7930488586425781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4050 -1.1098479852080345e-02</internalNodes>
+          <leafValues>
+            1.7850440740585327e-01 -4.5689649879932404e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4051 -7.3761218227446079e-03</internalNodes>
+          <leafValues>
+            -1.0891640186309814e-01 7.4425593018531799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4052 -3.2149269245564938e-03</internalNodes>
+          <leafValues>
+            9.0641707181930542e-02 -9.4377033412456512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4053 -3.5010059364140034e-03</internalNodes>
+          <leafValues>
+            -1.3498190045356750e-01 6.6652722656726837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4054 -1.4920319699740503e-05</internalNodes>
+          <leafValues>
+            -1.0505480319261551e-01 8.4583170711994171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4055 9.5882397145032883e-03</internalNodes>
+          <leafValues>
+            1.9421499222517014e-02 -2.4732840061187744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4056 5.7274959981441498e-02</internalNodes>
+          <leafValues>
+            8.1852423027157784e-03 -7.9508548974990845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4057 2.4549640715122223e-02</internalNodes>
+          <leafValues>
+            -1.5515980310738087e-02 4.8995479941368103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4058 -4.6792559325695038e-02</internalNodes>
+          <leafValues>
+            -8.4720087051391602e-01 9.0526090934872627e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4059 3.1038739252835512e-03</internalNodes>
+          <leafValues>
+            -5.3271029144525528e-02 7.8815557062625885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4060 -3.4241031855344772e-02</internalNodes>
+          <leafValues>
+            -4.8161220550537109e-01 1.3654340058565140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4061 4.4056270271539688e-03</internalNodes>
+          <leafValues>
+            -4.9280438572168350e-02 7.8709162771701813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4062 2.3878510110080242e-03</internalNodes>
+          <leafValues>
+            -7.6887659728527069e-02 8.4614582359790802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4063 -1.1621230281889439e-02</internalNodes>
+          <leafValues>
+            -2.3086050152778625e-01 2.2584810853004456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4064 2.5225759018212557e-03</internalNodes>
+          <leafValues>
+            -5.0813131034374237e-02 1.3810400664806366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4065 1.3507470488548279e-01</internalNodes>
+          <leafValues>
+            7.5730998069047928e-03 -4.7955051064491272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4066 -2.2317951079457998e-03</internalNodes>
+          <leafValues>
+            -9.0258792042732239e-02 8.3118766546249390e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4067 -3.0061710625886917e-02</internalNodes>
+          <leafValues>
+            -5.1799142360687256e-01 1.2881710194051266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4068 -4.5464351773262024e-02</internalNodes>
+          <leafValues>
+            2.0660980045795441e-01 -3.4860398620367050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4069 -9.2374589294195175e-03</internalNodes>
+          <leafValues>
+            -1.4695020020008087e-01 3.1320258975028992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4070 6.0185948386788368e-03</internalNodes>
+          <leafValues>
+            6.3885621726512909e-02 -1.1779619753360748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4071 -1.0322810150682926e-02</internalNodes>
+          <leafValues>
+            1.7958350479602814e-01 -4.6830028295516968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4072 -1.7961780540645123e-03</internalNodes>
+          <leafValues>
+            -1.1374049633741379e-01 6.1730381101369858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4073 7.1363700553774834e-03</internalNodes>
+          <leafValues>
+            3.3574521541595459e-02 -1.5472589433193207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4074 6.9487772881984711e-02</internalNodes>
+          <leafValues>
+            -5.9162009507417679e-02 1.3841110467910767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4075 -3.8321871310472488e-02</internalNodes>
+          <leafValues>
+            1.5628719329833984e-01 -3.1815651804208755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4076 3.9706169627606869e-03</internalNodes>
+          <leafValues>
+            5.1252529025077820e-02 -1.7615999281406403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4077 -3.9275288581848145e-03</internalNodes>
+          <leafValues>
+            7.8947998583316803e-02 -5.1486730575561523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4078 1.9882800988852978e-03</internalNodes>
+          <leafValues>
+            -5.0474651157855988e-02 1.3366329669952393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4079 -1.6472870483994484e-03</internalNodes>
+          <leafValues>
+            4.9180198460817337e-02 -5.3437490016222000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4080 -1.1580109596252441e-02</internalNodes>
+          <leafValues>
+            -1.3224309682846069e-01 5.8321509510278702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4081 4.3496791273355484e-02</internalNodes>
+          <leafValues>
+            -2.3527380079030991e-02 1.2179140001535416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4082 1.8956169951707125e-03</internalNodes>
+          <leafValues>
+            5.6072939187288284e-02 -1.1997289955615997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4083 2.4906420148909092e-03</internalNodes>
+          <leafValues>
+            -1.2799920141696930e-01 3.5218570381402969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4084 -6.0253150761127472e-02</internalNodes>
+          <leafValues>
+            -7.8707909584045410e-01 7.7965850941836834e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4085 -1.5306809917092323e-02</internalNodes>
+          <leafValues>
+            -1.2276060134172440e-01 4.2537391185760498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4086 3.6899570841342211e-04</internalNodes>
+          <leafValues>
+            -1.2192569673061371e-01 5.9650231152772903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4087 3.0398070812225342e-03</internalNodes>
+          <leafValues>
+            -6.3023842871189117e-02 5.0918091088533401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4088 -3.5760499304160476e-04</internalNodes>
+          <leafValues>
+            -7.6859332621097565e-02 8.6624316871166229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4089 -2.7939230203628540e-03</internalNodes>
+          <leafValues>
+            1.3074369728565216e-01 -4.6912711113691330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4090 4.2060539126396179e-03</internalNodes>
+          <leafValues>
+            -5.3119719028472900e-02 1.2866240739822388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4091 5.1448699086904526e-02</internalNodes>
+          <leafValues>
+            1.1080370284616947e-02 -4.1434210538864136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4092 3.2859880477190018e-02</internalNodes>
+          <leafValues>
+            1.7495309934020042e-02 -3.7538790702819824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4093 -4.8408061265945435e-02</internalNodes>
+          <leafValues>
+            1.7011879384517670e-01 -2.3726450279355049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4094 1.4061340130865574e-02</internalNodes>
+          <leafValues>
+            2.5981390848755836e-02 -2.7635771036148071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4095 5.2196439355611801e-02</internalNodes>
+          <leafValues>
+            -9.5534622669219971e-03 1.0973469913005829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4096 4.4780261814594269e-02</internalNodes>
+          <leafValues>
+            -2.7032930403947830e-02 2.7434709668159485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4097 -3.7703409325331450e-03</internalNodes>
+          <leafValues>
+            -1.4412869513034821e-01 5.2342470735311508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4098 -4.1479258798062801e-03</internalNodes>
+          <leafValues>
+            -1.3706830143928528e-01 4.9621090292930603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4099 1.4685150235891342e-02</internalNodes>
+          <leafValues>
+            -4.9949668347835541e-02 1.3658650219440460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4100 1.0325849987566471e-02</internalNodes>
+          <leafValues>
+            8.3659462630748749e-02 -1.0378009825944901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4101 -1.7972270143218338e-04</internalNodes>
+          <leafValues>
+            -8.6658917367458344e-02 2.2592369467020035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4102 2.0081000402569771e-02</internalNodes>
+          <leafValues>
+            -1.9589949399232864e-02 3.4358739852905273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4103 -2.2905580699443817e-02</internalNodes>
+          <leafValues>
+            -4.2482820153236389e-01 1.5416770242154598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4104 -5.5506028234958649e-02</internalNodes>
+          <leafValues>
+            7.3143810033798218e-01 -9.4347409904003143e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4105 -1.7899540252983570e-03</internalNodes>
+          <leafValues>
+            -8.1951782107353210e-02 3.5823788493871689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4106 -8.0740358680486679e-04</internalNodes>
+          <leafValues>
+            8.6620979011058807e-02 -7.8758612275123596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4107 2.4445019662380219e-02</internalNodes>
+          <leafValues>
+            -2.2004250437021255e-02 9.4158843159675598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4108 -7.5640110298991203e-03</internalNodes>
+          <leafValues>
+            1.2011729925870895e-01 -7.2349771857261658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4109 2.3397218901664019e-03</internalNodes>
+          <leafValues>
+            -8.1034347414970398e-02 9.8173618316650391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4110 -3.1817611306905746e-02</internalNodes>
+          <leafValues>
+            -3.5730469226837158e-01 1.9601309671998024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4111 1.0028080083429813e-02</internalNodes>
+          <leafValues>
+            -2.4160459637641907e-02 3.1340339779853821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4112 9.0504523541312665e-05</internalNodes>
+          <leafValues>
+            5.8050628751516342e-02 -1.1760439723730087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4113 -2.1010750904679298e-02</internalNodes>
+          <leafValues>
+            -2.0346039533615112e-01 3.4145411103963852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4114 -7.1200268575921655e-04</internalNodes>
+          <leafValues>
+            6.3303150236606598e-02 -1.0497389733791351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4115 -7.6272932346910238e-04</internalNodes>
+          <leafValues>
+            -7.4432566761970520e-02 3.4912228584289551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4116 -5.8506328612565994e-02</internalNodes>
+          <leafValues>
+            5.5758380889892578e-01 -1.2666489928960800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4117 2.4057500995695591e-03</internalNodes>
+          <leafValues>
+            4.4605068862438202e-02 -1.1581590026617050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4118 -1.9729519262909889e-02</internalNodes>
+          <leafValues>
+            -4.7550109028816223e-01 1.5548559837043285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4119 -2.2645130753517151e-02</internalNodes>
+          <leafValues>
+            1.1828950047492981e-01 -2.2170929238200188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4120 -1.3123790267854929e-03</internalNodes>
+          <leafValues>
+            5.0635538995265961e-02 -1.3423310220241547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4121 -5.9856739826500416e-03</internalNodes>
+          <leafValues>
+            5.4273821413516998e-02 -6.9639056921005249e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4122 5.2245449274778366e-02</internalNodes>
+          <leafValues>
+            -1.8341360613703728e-02 4.1689381003379822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4123 -4.6837949194014072e-03</internalNodes>
+          <leafValues>
+            -1.2121260166168213e-01 3.9187919348478317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4124 -1.5208399854600430e-02</internalNodes>
+          <leafValues>
+            -9.6487842500209808e-02 6.5325021743774414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4125 -5.7328920811414719e-03</internalNodes>
+          <leafValues>
+            2.1023470163345337e-01 -3.1721260398626328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4126 -3.7612610030919313e-03</internalNodes>
+          <leafValues>
+            1.0085880011320114e-01 -6.1392951756715775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4127 -1.0980520397424698e-02</internalNodes>
+          <leafValues>
+            -1.8342439830303192e-01 1.7121249809861183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4128 2.7213071007281542e-03</internalNodes>
+          <leafValues>
+            -5.8404140174388885e-02 1.0729049891233444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4129 -1.8969269469380379e-02</internalNodes>
+          <leafValues>
+            7.4764728546142578e-02 -3.4056201577186584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4130 -7.1104627568274736e-04</internalNodes>
+          <leafValues>
+            -1.4749570190906525e-01 5.2447158843278885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4131 9.4774961471557617e-03</internalNodes>
+          <leafValues>
+            -2.5232490152120590e-02 1.0677599906921387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4132 1.0275880247354507e-01</internalNodes>
+          <leafValues>
+            1.0039360262453556e-02 -6.4630568027496338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4133 -1.1228179931640625e-01</internalNodes>
+          <leafValues>
+            -5.7247608900070190e-01 6.3971187919378281e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4134 -2.5683579966425896e-02</internalNodes>
+          <leafValues>
+            -3.2004079222679138e-01 1.7239449545741081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4135 2.5494299829006195e-02</internalNodes>
+          <leafValues>
+            -2.2127779200673103e-02 1.1838120222091675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4136 -3.0458789318799973e-02</internalNodes>
+          <leafValues>
+            -5.8747881650924683e-01 9.8222652450203896e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4137 -2.7816120535135269e-02</internalNodes>
+          <leafValues>
+            3.6785709857940674e-01 -1.2260340154170990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4138 -1.2768269516527653e-03</internalNodes>
+          <leafValues>
+            2.4150429666042328e-01 -2.4503409862518311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4139 -7.6435826718807220e-02</internalNodes>
+          <leafValues>
+            -6.3471722602844238e-01 2.7080429717898369e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4140 3.7574430461972952e-04</internalNodes>
+          <leafValues>
+            -1.3316820561885834e-01 4.6189591288566589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4141 1.3193810358643532e-02</internalNodes>
+          <leafValues>
+            2.6501480489969254e-02 -6.8515978753566742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4142 -6.3689619302749634e-02</internalNodes>
+          <leafValues>
+            4.1126638650894165e-01 -1.5647120773792267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4143 -8.0426287604495883e-04</internalNodes>
+          <leafValues>
+            -9.4006098806858063e-02 3.1002070754766464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4144 8.2476891111582518e-04</internalNodes>
+          <leafValues>
+            -1.5928819775581360e-01 3.7096790969371796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4145 4.8443409614264965e-03</internalNodes>
+          <leafValues>
+            -2.5698879733681679e-02 1.5079009532928467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4146 2.2941319271922112e-02</internalNodes>
+          <leafValues>
+            2.2941149771213531e-02 -2.7759069204330444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4147 5.6285588070750237e-03</internalNodes>
+          <leafValues>
+            2.0121619105339050e-02 -6.3584417104721069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4148 -8.1927451537922025e-04</internalNodes>
+          <leafValues>
+            5.5934138596057892e-02 -1.0776060074567795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4149 5.1910132169723511e-03</internalNodes>
+          <leafValues>
+            -2.6781970635056496e-02 5.5094171315431595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4150 -2.0220499485731125e-02</internalNodes>
+          <leafValues>
+            -1.2501780688762665e-01 5.9274829924106598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4151 -3.6798599176108837e-03</internalNodes>
+          <leafValues>
+            6.0474321246147156e-02 -5.9632349759340286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4152 1.0483860038220882e-02</internalNodes>
+          <leafValues>
+            -5.3652260452508926e-02 1.2906110286712646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4153 1.7904460430145264e-02</internalNodes>
+          <leafValues>
+            1.4318290166556835e-02 -2.7349731326103210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4154 3.3693820238113403e-01</internalNodes>
+          <leafValues>
+            -8.6311781778931618e-03 7.3288571834564209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4155 -1.0807479918003082e-01</internalNodes>
+          <leafValues>
+            -5.0707489252090454e-01 6.7152627743780613e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4156 -1.2219610065221786e-01</internalNodes>
+          <leafValues>
+            -7.9352718591690063e-01 7.4890498071908951e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4157 -3.7357630208134651e-03</internalNodes>
+          <leafValues>
+            -1.5436430275440216e-01 1.9933359697461128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4158 4.7283530235290527e-02</internalNodes>
+          <leafValues>
+            -3.2180741429328918e-02 2.2332429885864258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4159 -4.8949089832603931e-03</internalNodes>
+          <leafValues>
+            -1.4440849423408508e-01 2.7687419205904007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4160 -4.6767960302531719e-03</internalNodes>
+          <leafValues>
+            4.2589519172906876e-02 -1.3181249797344208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4161 -4.0526568889617920e-02</internalNodes>
+          <leafValues>
+            1.5155360102653503e-01 -1.3137400150299072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4162 5.1309340633451939e-03</internalNodes>
+          <leafValues>
+            -4.2436398565769196e-02 1.9428129494190216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4163 4.9947341904044151e-03</internalNodes>
+          <leafValues>
+            2.0656300708651543e-02 -1.8332560360431671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4164 -1.0946449823677540e-02</internalNodes>
+          <leafValues>
+            -1.1576370149850845e-01 6.1964198946952820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4165 -6.7135482095181942e-03</internalNodes>
+          <leafValues>
+            1.5796749293804169e-01 -3.5399619489908218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4166 -3.0990630388259888e-02</internalNodes>
+          <leafValues>
+            -1.7271049320697784e-01 3.7916570901870728e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4167 -2.7503890451043844e-03</internalNodes>
+          <leafValues>
+            4.1495159268379211e-02 -5.5152788758277893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4168 -2.4700429290533066e-02</internalNodes>
+          <leafValues>
+            2.9076111316680908e-01 -2.0552640780806541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4169 -1.7607269808650017e-02</internalNodes>
+          <leafValues>
+            -9.8671503365039825e-02 3.2800450921058655e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4170 8.7928329594433308e-04</internalNodes>
+          <leafValues>
+            3.6442421376705170e-02 -1.7518040537834167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4171 6.9036949425935745e-03</internalNodes>
+          <leafValues>
+            2.1444270387291908e-02 -1.1997299641370773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4172 -2.2592858877032995e-03</internalNodes>
+          <leafValues>
+            9.5944248139858246e-02 -8.1264480948448181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4173 1.5885939821600914e-02</internalNodes>
+          <leafValues>
+            -3.1494110822677612e-02 8.7531946599483490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4174 1.9379710778594017e-02</internalNodes>
+          <leafValues>
+            -3.5075489431619644e-02 1.6199189424514771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4175 -2.3565329611301422e-02</internalNodes>
+          <leafValues>
+            9.9367812275886536e-02 -5.0409961491823196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4176 -6.2582190148532391e-03</internalNodes>
+          <leafValues>
+            -1.5962609648704529e-01 5.6871950626373291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4177 1.0289040394127369e-02</internalNodes>
+          <leafValues>
+            3.2422259449958801e-02 -1.1825840175151825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4178 -5.8485912159085274e-03</internalNodes>
+          <leafValues>
+            1.9107459485530853e-01 -3.7084739655256271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4179 -8.5805162787437439e-02</internalNodes>
+          <leafValues>
+            -4.0877249836921692e-01 1.2781100347638130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4180 -2.4852859787642956e-03</internalNodes>
+          <leafValues>
+            -1.0116399824619293e-01 5.6311480700969696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4181 -7.1535720489919186e-03</internalNodes>
+          <leafValues>
+            -4.4118609279394150e-02 2.2217169404029846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4182 1.2644700473174453e-03</internalNodes>
+          <leafValues>
+            6.5305598080158234e-02 -1.2273000180721283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4183 3.9825689047574997e-02</internalNodes>
+          <leafValues>
+            -5.0402980297803879e-02 1.4424259960651398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4184 1.3322670012712479e-02</internalNodes>
+          <leafValues>
+            2.3235419392585754e-01 -2.8198169544339180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4185 2.1017350256443024e-02</internalNodes>
+          <leafValues>
+            -1.9653260707855225e-02 1.0432569682598114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4186 2.4515210092067719e-01</internalNodes>
+          <leafValues>
+            8.4479590877890587e-03 -7.4833422899246216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4187 4.3030278757214546e-03</internalNodes>
+          <leafValues>
+            3.1172480434179306e-02 -9.4183586537837982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4188 2.2224480286240578e-02</internalNodes>
+          <leafValues>
+            -3.9602920413017273e-02 1.5614870190620422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4189 -8.5019748657941818e-03</internalNodes>
+          <leafValues>
+            -1.0852319747209549e-01 2.8045600280165672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4190 1.0845540091395378e-02</internalNodes>
+          <leafValues>
+            -6.5594159066677094e-02 1.0217399895191193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4191 1.7696369905024767e-03</internalNodes>
+          <leafValues>
+            7.5369141995906830e-02 -9.5298826694488525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4192 1.0289049893617630e-01</internalNodes>
+          <leafValues>
+            -1.1767229996621609e-02 4.8167210817337036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4193 -3.5074170678853989e-02</internalNodes>
+          <leafValues>
+            -2.6299050450325012e-01 1.0002779774367809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4194 3.8302998989820480e-02</internalNodes>
+          <leafValues>
+            1.0883949697017670e-02 -5.8092927932739258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4195 1.2183119542896748e-02</internalNodes>
+          <leafValues>
+            3.1098999083042145e-02 -5.4257929325103760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4196 2.0388139411807060e-02</internalNodes>
+          <leafValues>
+            -3.7379540503025055e-02 1.8725450336933136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4197 6.5857400186359882e-03</internalNodes>
+          <leafValues>
+            -4.4194780290126801e-02 6.0033790767192841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4198 5.8739529922604561e-03</internalNodes>
+          <leafValues>
+            3.9219710975885391e-02 -1.5857939422130585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4199 -7.8279033303260803e-02</internalNodes>
+          <leafValues>
+            2.1789179742336273e-01 -1.0094420053064823e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4200 1.5336579643189907e-02</internalNodes>
+          <leafValues>
+            -3.1219519674777985e-02 2.2452400624752045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4201 1.4171670190989971e-03</internalNodes>
+          <leafValues>
+            -1.6625450551509857e-01 2.7684109285473824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4202 -3.4021309111267328e-03</internalNodes>
+          <leafValues>
+            -2.8452378511428833e-01 2.2661060094833374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4203 -1.9340340048074722e-02</internalNodes>
+          <leafValues>
+            5.2300518751144409e-01 -5.0734821707010269e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4204 -1.6514319926500320e-02</internalNodes>
+          <leafValues>
+            7.0619380474090576e-01 -8.2714930176734924e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4205 -6.4589809626340866e-03</internalNodes>
+          <leafValues>
+            -1.2104330211877823e-01 3.8718421012163162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4206 -4.3003219179809093e-03</internalNodes>
+          <leafValues>
+            -1.2103659659624100e-01 5.5335890501737595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4207 1.0784200392663479e-02</internalNodes>
+          <leafValues>
+            -3.8975819945335388e-02 1.9870519638061523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4208 -1.1527650058269501e-03</internalNodes>
+          <leafValues>
+            9.3596100807189941e-02 -6.4248889684677124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4209 -4.2101260274648666e-02</internalNodes>
+          <leafValues>
+            -3.0032190680503845e-01 1.5909299254417419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4210 3.0202090274542570e-03</internalNodes>
+          <leafValues>
+            -6.5310478210449219e-02 9.4754762947559357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4211 2.9999990016222000e-02</internalNodes>
+          <leafValues>
+            1.7673229798674583e-02 -2.2457149624824524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4212 -1.3678170507773757e-03</internalNodes>
+          <leafValues>
+            1.3394910097122192e-01 -5.0086550414562225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4213 -2.3151950910687447e-02</internalNodes>
+          <leafValues>
+            -1.8310110270977020e-01 1.9103579223155975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4214 6.3826322555541992e-02</internalNodes>
+          <leafValues>
+            7.5651248916983604e-03 -8.3116590976715088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4215 -1.4831620454788208e-01</internalNodes>
+          <leafValues>
+            -1. 3.4445689525455236e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4216 1.3207890151534230e-04</internalNodes>
+          <leafValues>
+            5.1135819405317307e-02 -1.1863200366497040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4217 6.6078707575798035e-02</internalNodes>
+          <leafValues>
+            7.1528651751577854e-03 -4.2906388640403748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4218 6.1758249066770077e-03</internalNodes>
+          <leafValues>
+            -5.9010580182075500e-02 1.0781309753656387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4219 -3.3506110310554504e-02</internalNodes>
+          <leafValues>
+            -3.7636739015579224e-01 1.7037799581885338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4220 -9.7032980993390083e-03</internalNodes>
+          <leafValues>
+            1.3820339739322662e-01 -4.3922200798988342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4221 -7.2475131601095200e-03</internalNodes>
+          <leafValues>
+            -2.2192749381065369e-01 1.2801939621567726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4222 -5.3309328854084015e-02</internalNodes>
+          <leafValues>
+            -4.5594760775566101e-01 1.2495010159909725e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4223 1.0387069545686245e-02</internalNodes>
+          <leafValues>
+            -5.1624130457639694e-02 1.2236239761114120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4224 6.7208573222160339e-02</internalNodes>
+          <leafValues>
+            3.1655121594667435e-02 -2.1086180210113525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4225 -1.5143319964408875e-02</internalNodes>
+          <leafValues>
+            1.7224070429801941e-01 -2.9209939762949944e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4226 -3.9284970611333847e-02</internalNodes>
+          <leafValues>
+            -4.8226779699325562e-01 1.4366200193762779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4227 -5.1000402309000492e-03</internalNodes>
+          <leafValues>
+            1.3700410723686218e-01 -4.3541591614484787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4228 4.7284159809350967e-03</internalNodes>
+          <leafValues>
+            6.5495520830154419e-02 -1.2913839519023895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4229 -1.1877629905939102e-02</internalNodes>
+          <leafValues>
+            2.0146130025386810e-01 -2.3640049621462822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4230 -4.5396368950605392e-03</internalNodes>
+          <leafValues>
+            -1.6872450709342957e-01 4.4881179928779602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4231 -8.0548608675599098e-03</internalNodes>
+          <leafValues>
+            6.5916322171688080e-02 -4.5184228569269180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4232 -4.3037731200456619e-02</internalNodes>
+          <leafValues>
+            1.2817430496215820e-01 -6.3021719455718994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4233 1.0952279716730118e-01</internalNodes>
+          <leafValues>
+            6.0560060665011406e-03 -5.1614511013031006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4234 -7.0019549457356334e-04</internalNodes>
+          <leafValues>
+            -1.2845410406589508e-01 4.9936100840568542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4235 -2.9595570595120080e-05</internalNodes>
+          <leafValues>
+            6.7076332867145538e-02 -9.0397119522094727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4236 1.7749640345573425e-01</internalNodes>
+          <leafValues>
+            -7.6472861692309380e-03 8.9716571569442749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4237 -5.5364448577165604e-02</internalNodes>
+          <leafValues>
+            -6.5513938665390015e-01 6.7208600230515003e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4238 -5.1461409777402878e-02</internalNodes>
+          <leafValues>
+            -6.5337532758712769e-01 8.9703118428587914e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4239 -2.6581719517707825e-02</internalNodes>
+          <leafValues>
+            -2.8116428852081299e-01 1.7766090109944344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4240 -6.9034337997436523e-02</internalNodes>
+          <leafValues>
+            9.2583978176116943e-01 -6.2460578046739101e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4241 -3.0205730348825455e-02</internalNodes>
+          <leafValues>
+            2.3784290254116058e-01 -1.6295459121465683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4242 -9.1226873919367790e-03</internalNodes>
+          <leafValues>
+            -1.4569890499114990e-01 4.5654390007257462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4243 -2.1233780682086945e-01</internalNodes>
+          <leafValues>
+            1.6472199559211731e-01 -1.4758829958736897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4244 -2.6254689320921898e-02</internalNodes>
+          <leafValues>
+            3.0381628870964050e-01 -2.0108530297875404e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4245 3.0262209475040436e-03</internalNodes>
+          <leafValues>
+            -1.5298280119895935e-01 2.6878539472818375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4246 8.3838596940040588e-02</internalNodes>
+          <leafValues>
+            1.0042349807918072e-02 -5.9345102310180664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4247 1.8845759332180023e-02</internalNodes>
+          <leafValues>
+            -4.5260541141033173e-02 8.4220200777053833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4248 -4.8671411350369453e-03</internalNodes>
+          <leafValues>
+            -1.1234840005636215e-01 5.6676398962736130e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>243</maxWeakCount>
+      <stageThreshold>-1.4994510412216187e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 4249 1.1900869756937027e-01</internalNodes>
+          <leafValues>
+            -2.0186680555343628e-01 2.4417600035667419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4250 2.1277489140629768e-02</internalNodes>
+          <leafValues>
+            -2.3454399406909943e-01 1.6303069889545441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4251 3.7066950462758541e-03</internalNodes>
+          <leafValues>
+            -2.0559909939765930e-01 1.4982059597969055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4252 3.2929550856351852e-02</internalNodes>
+          <leafValues>
+            7.8803077340126038e-02 -3.3688440918922424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4253 2.5057960301637650e-02</internalNodes>
+          <leafValues>
+            -1.5932090580463409e-01 1.6405050456523895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4254 6.5863109193742275e-04</internalNodes>
+          <leafValues>
+            -2.7804228663444519e-01 8.3028919994831085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4255 -6.6210910677909851e-02</internalNodes>
+          <leafValues>
+            -3.6402150988578796e-01 6.0067348182201385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4256 4.2186300270259380e-03</internalNodes>
+          <leafValues>
+            -1.8551510572433472e-01 1.2828220427036285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4257 1.7119459807872772e-03</internalNodes>
+          <leafValues>
+            -2.1572509407997131e-01 8.6879499256610870e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4258 -2.1390480920672417e-02</internalNodes>
+          <leafValues>
+            1.1124739795923233e-01 -1.4486509561538696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4259 5.5712480098009109e-03</internalNodes>
+          <leafValues>
+            6.2546879053115845e-02 -3.1598201394081116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4260 4.5709838159382343e-03</internalNodes>
+          <leafValues>
+            -2.3647899925708771e-01 3.8399569690227509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4261 -1.7086030915379524e-02</internalNodes>
+          <leafValues>
+            2.0653559267520905e-01 -8.6405612528324127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4262 -3.0640950426459312e-02</internalNodes>
+          <leafValues>
+            4.1523000597953796e-01 -2.5601850822567940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4263 2.5803469121456146e-02</internalNodes>
+          <leafValues>
+            4.0156230330467224e-02 -3.7444010376930237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4264 2.6425920426845551e-02</internalNodes>
+          <leafValues>
+            4.2625781148672104e-02 -4.1888910531997681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4265 -1.1849730275571346e-02</internalNodes>
+          <leafValues>
+            -3.0619880557060242e-01 5.1505949348211288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4266 -1.6269849613308907e-02</internalNodes>
+          <leafValues>
+            -1.9878490269184113e-01 4.2683240026235580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4267 -2.4036159738898277e-02</internalNodes>
+          <leafValues>
+            -3.3211991190910339e-01 4.6091418713331223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4268 7.3583971243351698e-04</internalNodes>
+          <leafValues>
+            -2.0677410066127777e-01 5.7418260723352432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4269 -2.0423160865902901e-02</internalNodes>
+          <leafValues>
+            -2.6922059059143066e-01 4.4893719255924225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4270 1.9533000886440277e-03</internalNodes>
+          <leafValues>
+            4.3481849133968353e-02 -1.4295850694179535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4271 3.3202540129423141e-02</internalNodes>
+          <leafValues>
+            6.1112720519304276e-02 -2.0773139595985413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4272 2.1049549803137779e-02</internalNodes>
+          <leafValues>
+            -5.5196329951286316e-02 1.7273330688476562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4273 -4.2487941682338715e-03</internalNodes>
+          <leafValues>
+            -3.1202110648155212e-01 3.5714551806449890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4274 1.4544890262186527e-02</internalNodes>
+          <leafValues>
+            -1.2891520559787750e-01 1.0874609649181366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4275 4.4858800247311592e-03</internalNodes>
+          <leafValues>
+            5.0264850258827209e-02 -2.2729620337486267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4276 -7.2019517421722412e-02</internalNodes>
+          <leafValues>
+            -5.0357151031494141e-01 2.4909170344471931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4277 7.4088312685489655e-02</internalNodes>
+          <leafValues>
+            -2.6110179722309113e-02 4.6904951333999634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4278 -1.9376210868358612e-02</internalNodes>
+          <leafValues>
+            -8.7742328643798828e-02 5.2696809172630310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4279 -1.5192059800028801e-02</internalNodes>
+          <leafValues>
+            -1.6470350325107574e-01 7.4841916561126709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4280 6.7975218407809734e-03</internalNodes>
+          <leafValues>
+            -1.2512689828872681e-01 8.2092992961406708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4281 -1.9816169515252113e-03</internalNodes>
+          <leafValues>
+            6.1259880661964417e-02 -1.9138810038566589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4282 -4.0343839675188065e-02</internalNodes>
+          <leafValues>
+            -3.4634640812873840e-01 3.3814091235399246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4283 -9.7851715981960297e-03</internalNodes>
+          <leafValues>
+            2.4771960079669952e-01 -5.1031429320573807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4284 1.3061050325632095e-02</internalNodes>
+          <leafValues>
+            -5.9378169476985931e-02 1.4298720657825470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4285 1.2519969604909420e-02</internalNodes>
+          <leafValues>
+            -1.0087440162897110e-01 2.0617449283599854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4286 6.1620049178600311e-02</internalNodes>
+          <leafValues>
+            1.0850620456039906e-02 -4.9976751208305359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4287 1.5351610258221626e-02</internalNodes>
+          <leafValues>
+            3.0459180474281311e-02 -4.0248531103134155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4288 6.7390319891273975e-03</internalNodes>
+          <leafValues>
+            -1.5230870246887207e-01 3.4763731062412262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4289 2.7166040614247322e-02</internalNodes>
+          <leafValues>
+            3.2465178519487381e-02 -3.7905651330947876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4290 -4.9443650990724564e-02</internalNodes>
+          <leafValues>
+            -4.1042488813400269e-01 1.5265700407326221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4291 3.2999709248542786e-02</internalNodes>
+          <leafValues>
+            2.8922239318490028e-02 -4.3119680881500244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4292 3.7604149430990219e-02</internalNodes>
+          <leafValues>
+            2.0920699462294579e-02 -3.5471540689468384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4293 1.7311640083789825e-02</internalNodes>
+          <leafValues>
+            -1.5490870177745819e-01 7.3543228209018707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4294 -1.7037079669535160e-03</internalNodes>
+          <leafValues>
+            -9.5346920192241669e-02 5.1517289131879807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4295 -1.5008790418505669e-02</internalNodes>
+          <leafValues>
+            2.1057499945163727e-01 -5.2197169512510300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4296 -4.1283361613750458e-02</internalNodes>
+          <leafValues>
+            -4.8727679252624512e-01 1.6686370596289635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4297 -1.7190299928188324e-02</internalNodes>
+          <leafValues>
+            2.3070749640464783e-01 -5.7094439864158630e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4298 3.9707008749246597e-02</internalNodes>
+          <leafValues>
+            1.7016230151057243e-02 -3.8233861327171326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4299 4.7051470726728439e-02</internalNodes>
+          <leafValues>
+            4.2239248752593994e-02 -2.8050369024276733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4300 -1.1948949657380581e-02</internalNodes>
+          <leafValues>
+            -2.3056490719318390e-01 2.6532189920544624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4301 -7.9857409000396729e-02</internalNodes>
+          <leafValues>
+            -8.4963917732238770e-01 1.2582180090248585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4302 2.5627639144659042e-02</internalNodes>
+          <leafValues>
+            2.3311240598559380e-02 -2.4923819303512573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4303 -3.1094370409846306e-02</internalNodes>
+          <leafValues>
+            -2.3769870400428772e-01 4.6116128563880920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4304 4.6573221683502197e-02</internalNodes>
+          <leafValues>
+            2.8770290315151215e-02 -5.3739601373672485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4305 -5.4066929966211319e-02</internalNodes>
+          <leafValues>
+            2.7794760465621948e-01 -4.7770768404006958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4306 1.8918470013886690e-03</internalNodes>
+          <leafValues>
+            -9.8254829645156860e-02 4.7856420278549194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4307 3.3229328691959381e-02</internalNodes>
+          <leafValues>
+            -5.2595350891351700e-02 2.3564100265502930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4308 1.1775200255215168e-03</internalNodes>
+          <leafValues>
+            -2.3401489853858948e-01 2.6142070069909096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4309 1.9482020288705826e-03</internalNodes>
+          <leafValues>
+            -1.5223619341850281e-01 7.8751467168331146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4310 5.5945508182048798e-02</internalNodes>
+          <leafValues>
+            1.1540699750185013e-02 -1.9889539480209351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4311 2.9455369338393211e-02</internalNodes>
+          <leafValues>
+            3.3315770328044891e-02 -3.2850489020347595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4312 4.0880320593714714e-03</internalNodes>
+          <leafValues>
+            -8.6178407073020935e-02 7.9575799405574799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4313 -5.9127728454768658e-03</internalNodes>
+          <leafValues>
+            -1.7738300561904907e-01 6.0648940503597260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4314 -6.2419679015874863e-02</internalNodes>
+          <leafValues>
+            2.4396699666976929e-01 -3.3243889920413494e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4315 -3.7195120006799698e-02</internalNodes>
+          <leafValues>
+            2.6807048916816711e-01 -3.9979271590709686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4316 -1.4324760437011719e-01</internalNodes>
+          <leafValues>
+            2.9332828521728516e-01 -2.6897290721535683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4317 -4.2845219373703003e-02</internalNodes>
+          <leafValues>
+            -2.5283750891685486e-01 4.1232049465179443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4318 1.1560089886188507e-01</internalNodes>
+          <leafValues>
+            -1.4965849928557873e-02 2.4187250435352325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4319 5.0169471651315689e-02</internalNodes>
+          <leafValues>
+            8.8590547442436218e-02 -1.2442570179700851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4320 1.0200110077857971e-01</internalNodes>
+          <leafValues>
+            1.2396319769322872e-02 -3.6982178688049316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4321 -5.2397060208022594e-03</internalNodes>
+          <leafValues>
+            -2.5912949442863464e-01 4.0550298988819122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4322 -1.9227810204029083e-02</internalNodes>
+          <leafValues>
+            2.0064230263233185e-01 -6.5223582088947296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4323 -1.1133120395243168e-02</internalNodes>
+          <leafValues>
+            -4.6262189745903015e-01 2.4428030475974083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4324 9.7551010549068451e-02</internalNodes>
+          <leafValues>
+            1.2901189737021923e-02 -7.4022471904754639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4325 4.6071741729974747e-02</internalNodes>
+          <leafValues>
+            1.8453989177942276e-02 -4.8419821262359619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4326 -8.3533532917499542e-02</internalNodes>
+          <leafValues>
+            -8.8434767723083496e-01 1.6764779575169086e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4327 6.0535832308232784e-03</internalNodes>
+          <leafValues>
+            -1.5865640342235565e-01 6.7758671939373016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4328 -1.3178240042179823e-03</internalNodes>
+          <leafValues>
+            -8.7943129241466522e-02 6.6591359674930573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4329 -2.0939730107784271e-02</internalNodes>
+          <leafValues>
+            2.3358969390392303e-01 -5.2145671099424362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4330 -8.8145419955253601e-02</internalNodes>
+          <leafValues>
+            4.8081308603286743e-01 -1.1917640455067158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4331 1.6344599425792694e-02</internalNodes>
+          <leafValues>
+            -5.3838059306144714e-02 2.2349910438060760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4332 -2.2833999991416931e-01</internalNodes>
+          <leafValues>
+            3.6013820767402649e-01 -1.8727909773588181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4333 8.4737362340092659e-03</internalNodes>
+          <leafValues>
+            -5.6207131594419479e-02 1.6089470684528351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4334 -9.8505034111440182e-04</internalNodes>
+          <leafValues>
+            1.0108830034732819e-01 -1.0455229878425598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4335 4.9648447893559933e-03</internalNodes>
+          <leafValues>
+            -7.9359367489814758e-02 1.3140240311622620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4336 -1.3171610422432423e-02</internalNodes>
+          <leafValues>
+            -1.2099819630384445e-01 3.7730131298303604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4337 8.2112876698374748e-03</internalNodes>
+          <leafValues>
+            -5.3597409278154373e-02 2.2156579792499542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4338 -4.8930559307336807e-02</internalNodes>
+          <leafValues>
+            -3.9349249005317688e-01 1.9850309938192368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4339 7.4527352117002010e-03</internalNodes>
+          <leafValues>
+            5.8218438178300858e-02 -2.5317558646202087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4340 7.7388651669025421e-02</internalNodes>
+          <leafValues>
+            -5.7724680751562119e-02 2.0154540240764618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4341 4.9968929961323738e-03</internalNodes>
+          <leafValues>
+            8.9260630309581757e-02 -1.3082459568977356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4342 -4.0977269411087036e-02</internalNodes>
+          <leafValues>
+            -1.7190429568290710e-01 2.2051449865102768e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4343 3.0041709542274475e-03</internalNodes>
+          <leafValues>
+            4.5379869639873505e-02 -2.4130369722843170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4344 1.5435700118541718e-01</internalNodes>
+          <leafValues>
+            -3.2916471362113953e-02 3.2090398669242859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4345 1.5153509564697742e-02</internalNodes>
+          <leafValues>
+            5.3576458245515823e-02 -1.6273179650306702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4346 9.5209293067455292e-02</internalNodes>
+          <leafValues>
+            1.3132530264556408e-02 -4.3389630317687988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4347 -2.2066019475460052e-02</internalNodes>
+          <leafValues>
+            1.8358850479125977e-01 -5.3995680063962936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4348 -4.0623430162668228e-02</internalNodes>
+          <leafValues>
+            -4.5687249302864075e-01 1.1119400151073933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4349 -2.1428579930216074e-03</internalNodes>
+          <leafValues>
+            9.5221467316150665e-02 -1.0431689769029617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4350 -9.6598910167813301e-03</internalNodes>
+          <leafValues>
+            -2.8121781349182129e-01 3.1387180089950562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4351 -1.7860020697116852e-01</internalNodes>
+          <leafValues>
+            4.6675390005111694e-01 -2.2296290844678879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4352 -2.0536049269139767e-03</internalNodes>
+          <leafValues>
+            -8.8460110127925873e-02 2.5863479822874069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4353 -4.6333461068570614e-03</internalNodes>
+          <leafValues>
+            6.0720779001712799e-02 -1.6562700271606445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4354 4.6847991645336151e-02</internalNodes>
+          <leafValues>
+            -4.0696758776903152e-02 1.0598970204591751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4355 -9.0538233518600464e-02</internalNodes>
+          <leafValues>
+            -6.3367050886154175e-01 1.6277700662612915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4356 -6.6260926425457001e-02</internalNodes>
+          <leafValues>
+            -2.8792759776115417e-01 6.1133177950978279e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4357 2.4731729179620743e-02</internalNodes>
+          <leafValues>
+            4.0057931095361710e-02 -2.3272530734539032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4358 -1.3736580312252045e-01</internalNodes>
+          <leafValues>
+            4.7250029444694519e-01 -8.2997139543294907e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4359 -6.3414901494979858e-02</internalNodes>
+          <leafValues>
+            4.3039301037788391e-01 -2.1049000322818756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4360 -3.3071819692850113e-02</internalNodes>
+          <leafValues>
+            -1.1073499917984009e-01 3.3718731254339218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4361 1.0934790223836899e-01</internalNodes>
+          <leafValues>
+            1.3508499599993229e-02 -6.5502017736434937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4362 1.5925880521535873e-02</internalNodes>
+          <leafValues>
+            3.3672690391540527e-02 -7.0779062807559967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4363 -7.4891438707709312e-03</internalNodes>
+          <leafValues>
+            -2.6472839713096619e-01 3.8183860480785370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4364 9.8611623980104923e-04</internalNodes>
+          <leafValues>
+            -1.6149909794330597e-01 2.9475390911102295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4365 2.5206479430198669e-01</internalNodes>
+          <leafValues>
+            -3.2382488250732422e-02 3.1068611145019531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4366 -2.8892729431390762e-02</internalNodes>
+          <leafValues>
+            -4.9116641283035278e-01 1.4923149719834328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4367 -5.5389881134033203e-02</internalNodes>
+          <leafValues>
+            5.7543408870697021e-01 -1.8582839518785477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4368 3.1414598226547241e-02</internalNodes>
+          <leafValues>
+            2.0720759406685829e-02 -9.4729647040367126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4369 2.8307519387453794e-03</internalNodes>
+          <leafValues>
+            -2.2519350051879883e-01 4.1564159095287323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4370 -3.3751260489225388e-02</internalNodes>
+          <leafValues>
+            -1.6646580398082733e-01 7.2693623602390289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4371 -3.8290288299322128e-02</internalNodes>
+          <leafValues>
+            7.9213732481002808e-01 -1.1434529908001423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4372 -1.7989480867981911e-02</internalNodes>
+          <leafValues>
+            1.1361669749021530e-01 -4.4032510370016098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4373 1.8146529793739319e-02</internalNodes>
+          <leafValues>
+            3.4219540655612946e-02 -2.5041630864143372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4374 -6.9133192300796509e-02</internalNodes>
+          <leafValues>
+            -2.9793199896812439e-01 4.9929767847061157e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4375 1.2525920569896698e-01</internalNodes>
+          <leafValues>
+            1.0709079913794994e-02 -7.6342308521270752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4376 3.7683561444282532e-02</internalNodes>
+          <leafValues>
+            -3.4866910427808762e-02 1.9532379508018494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4377 -7.6676071621477604e-03</internalNodes>
+          <leafValues>
+            1.7114819586277008e-01 -5.1101781427860260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4378 3.5654550883919001e-03</internalNodes>
+          <leafValues>
+            -6.9071911275386810e-02 6.5724693238735199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4379 -1.8968600779771805e-02</internalNodes>
+          <leafValues>
+            -4.0976929664611816e-01 2.0560229197144508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4380 -2.0211370661854744e-02</internalNodes>
+          <leafValues>
+            3.3508920669555664e-01 -2.7907410636544228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4381 -1.9064599648118019e-02</internalNodes>
+          <leafValues>
+            1.9361929595470428e-01 -4.8648219555616379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4382 1.0313340276479721e-01</internalNodes>
+          <leafValues>
+            1.9382460042834282e-02 -1.1198680102825165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4383 9.8863355815410614e-03</internalNodes>
+          <leafValues>
+            -2.4043160676956177e-01 4.4305600225925446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4384 4.3293699622154236e-02</internalNodes>
+          <leafValues>
+            1.0728780180215836e-02 -6.4660537242889404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4385 6.1878331005573273e-02</internalNodes>
+          <leafValues>
+            1.0291899554431438e-02 -7.2967112064361572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4386 9.7703160718083382e-03</internalNodes>
+          <leafValues>
+            3.1311180442571640e-02 -1.5605080127716064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4387 -8.3175063133239746e-02</internalNodes>
+          <leafValues>
+            -3.3045348525047302e-01 2.3997390642762184e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4388 -3.1724658608436584e-01</internalNodes>
+          <leafValues>
+            5.4760771989822388e-01 -1.7853379249572754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4389 6.7434520460665226e-03</internalNodes>
+          <leafValues>
+            -6.6969439387321472e-02 1.2657959759235382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4390 4.0886890143156052e-02</internalNodes>
+          <leafValues>
+            4.3191551230847836e-03 -2.2032399475574493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4391 6.4959921874105930e-03</internalNodes>
+          <leafValues>
+            5.4097741842269897e-02 -1.5504899621009827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4392 -3.2832350581884384e-02</internalNodes>
+          <leafValues>
+            3.0770578980445862e-01 -2.4346910417079926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4393 -1.6127960756421089e-02</internalNodes>
+          <leafValues>
+            -1.0477919876575470e-01 9.1267466545104980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4394 3.4646671265363693e-02</internalNodes>
+          <leafValues>
+            1.4030230231583118e-02 -1.8207600712776184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4395 -3.3005408942699432e-02</internalNodes>
+          <leafValues>
+            3.8698929548263550e-01 -2.1859629079699516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4396 -4.3908338993787766e-02</internalNodes>
+          <leafValues>
+            -3.0621778964996338e-01 2.2774800658226013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4397 2.4842899292707443e-02</internalNodes>
+          <leafValues>
+            3.2077241688966751e-02 -2.5279021263122559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4398 1.0331260040402412e-02</internalNodes>
+          <leafValues>
+            -6.0551200062036514e-02 1.2119130045175552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4399 -6.7832246422767639e-02</internalNodes>
+          <leafValues>
+            -5.5833387374877930e-01 1.5336999669671059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4400 3.4947868436574936e-02</internalNodes>
+          <leafValues>
+            1.1647179722785950e-02 -2.5563651323318481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4401 -2.5261789560317993e-02</internalNodes>
+          <leafValues>
+            3.2832020521163940e-01 -2.3357210680842400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4402 7.5701558962464333e-03</internalNodes>
+          <leafValues>
+            7.1183882653713226e-02 -8.3878181874752045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4403 1.1809100210666656e-01</internalNodes>
+          <leafValues>
+            -4.1809991002082825e-02 2.2083349525928497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4404 3.6332231014966965e-02</internalNodes>
+          <leafValues>
+            1.7415270209312439e-01 -5.1788080483675003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4405 1.3216850347816944e-02</internalNodes>
+          <leafValues>
+            -4.7699850797653198e-01 1.8878389149904251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4406 1.4325110241770744e-02</internalNodes>
+          <leafValues>
+            2.1834760904312134e-02 -1.3961690664291382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4407 1.3779220171272755e-03</internalNodes>
+          <leafValues>
+            -2.0156779885292053e-01 3.9925381541252136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4408 1.4492850005626678e-01</internalNodes>
+          <leafValues>
+            -3.3947311341762543e-02 1.4805939793586731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4409 2.0336720347404480e-01</internalNodes>
+          <leafValues>
+            -2.8280159458518028e-02 3.0469599366188049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4410 -3.0550520867109299e-02</internalNodes>
+          <leafValues>
+            1.5751589834690094e-01 -3.4339658915996552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4411 -1.1067859828472137e-02</internalNodes>
+          <leafValues>
+            2.4688349664211273e-01 -3.7554491311311722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4412 2.5981210172176361e-02</internalNodes>
+          <leafValues>
+            2.1994030103087425e-02 -1.4765749871730804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4413 -4.8331938683986664e-02</internalNodes>
+          <leafValues>
+            -2.5580298900604248e-01 3.2857868820428848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4414 1.5268280170857906e-02</internalNodes>
+          <leafValues>
+            6.2162041664123535e-02 -5.1811810582876205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4415 -2.4390730261802673e-01</internalNodes>
+          <leafValues>
+            5.0339847803115845e-01 -1.6864169389009476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4416 -3.2398870680481195e-03</internalNodes>
+          <leafValues>
+            -1.3850170373916626e-01 6.3738316297531128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4417 6.1450928449630737e-02</internalNodes>
+          <leafValues>
+            -5.6962829083204269e-02 1.4706780016422272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4418 4.3161489069461823e-02</internalNodes>
+          <leafValues>
+            2.3441100493073463e-02 -2.6922780275344849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4419 -1.1370860040187836e-02</internalNodes>
+          <leafValues>
+            -2.6135998964309692e-01 3.3624760806560516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4420 -1.5418549999594688e-02</internalNodes>
+          <leafValues>
+            2.2153179347515106e-01 -4.0866490453481674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4421 4.5487228780984879e-02</internalNodes>
+          <leafValues>
+            -3.1598750501871109e-02 2.5687301158905029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4422 -1.5879619866609573e-02</internalNodes>
+          <leafValues>
+            -2.9981338977813721e-01 2.7006199583411217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4423 5.7012498378753662e-02</internalNodes>
+          <leafValues>
+            1.5179580077528954e-02 -5.2078807353973389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4424 -1.5038490295410156e-01</internalNodes>
+          <leafValues>
+            2.5164321064949036e-01 -4.0796510875225067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4425 -4.2246039956808090e-02</internalNodes>
+          <leafValues>
+            -4.8303580284118652e-01 1.9222039729356766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4426 -7.4928469955921173e-02</internalNodes>
+          <leafValues>
+            -9.5458990335464478e-01 4.4229729101061821e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4427 -2.1251840516924858e-02</internalNodes>
+          <leafValues>
+            3.1850698590278625e-01 -2.8021970763802528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4428 5.3983781486749649e-02</internalNodes>
+          <leafValues>
+            2.7037480846047401e-02 -3.4430688619613647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4429 3.3572580665349960e-02</internalNodes>
+          <leafValues>
+            -7.6545879244804382e-02 1.4255550503730774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4430 -6.7975879646837711e-03</internalNodes>
+          <leafValues>
+            1.7748320102691650e-01 -4.3155338615179062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4431 -1.3311849907040596e-03</internalNodes>
+          <leafValues>
+            1.5498100221157074e-01 -7.6261833310127258e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4432 3.9364699274301529e-02</internalNodes>
+          <leafValues>
+            3.6991588771343231e-02 -2.4243550002574921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4433 -6.8364520557224751e-03</internalNodes>
+          <leafValues>
+            1.0743640363216400e-01 -9.3058176338672638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4434 1.6118010506033897e-02</internalNodes>
+          <leafValues>
+            -3.5690911114215851e-02 2.4185790121555328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4435 -7.0620089769363403e-02</internalNodes>
+          <leafValues>
+            6.3363391160964966e-01 -1.2438289821147919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4436 4.4361630082130432e-01</internalNodes>
+          <leafValues>
+            -3.7221789360046387e-02 1.1892700195312500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4437 -8.1899233162403107e-02</internalNodes>
+          <leafValues>
+            3.4853339195251465e-01 -2.5211019441485405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4438 -8.2997446879744530e-03</internalNodes>
+          <leafValues>
+            -3.0899089574813843e-01 2.5778239592909813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4439 -2.9730390757322311e-02</internalNodes>
+          <leafValues>
+            -3.0759811401367188e-01 2.5530820712447166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4440 -2.6014490053057671e-02</internalNodes>
+          <leafValues>
+            -1.2162390351295471e-01 1.8338350579142570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4441 4.5121149742044508e-04</internalNodes>
+          <leafValues>
+            -5.4737848043441772e-01 1.3564749620854855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4442 1.8679940700531006e-01</internalNodes>
+          <leafValues>
+            7.8039847314357758e-02 -5.8137271553277969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4443 3.1894310377538204e-03</internalNodes>
+          <leafValues>
+            -2.4976019561290741e-01 3.0865840613842010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4444 -2.9449069872498512e-02</internalNodes>
+          <leafValues>
+            1.0489200055599213e-01 -4.8869129270315170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4445 2.9614970088005066e-02</internalNodes>
+          <leafValues>
+            -2.2261720150709152e-02 3.4992438554763794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4446 3.9882060140371323e-02</internalNodes>
+          <leafValues>
+            9.6727507188916206e-03 -6.7914432287216187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4447 -2.4404419586062431e-02</internalNodes>
+          <leafValues>
+            -2.6743829250335693e-01 3.0360370874404907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4448 4.3481849133968353e-02</internalNodes>
+          <leafValues>
+            -2.3372199386358261e-02 2.1356420218944550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4449 -4.8128370195627213e-02</internalNodes>
+          <leafValues>
+            -3.6890029907226562e-01 2.2832820191979408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4450 -1.3142440002411604e-03</internalNodes>
+          <leafValues>
+            5.6764688342809677e-02 -1.3795310258865356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4451 2.1767991129308939e-03</internalNodes>
+          <leafValues>
+            8.2446262240409851e-02 -1.0511689633131027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4452 -2.7471050620079041e-02</internalNodes>
+          <leafValues>
+            9.6438340842723846e-02 -5.1520779728889465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4453 5.2003171294927597e-02</internalNodes>
+          <leafValues>
+            -2.3240759968757629e-02 3.5900598764419556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4454 2.9681740328669548e-02</internalNodes>
+          <leafValues>
+            1.4641559682786465e-02 -2.1500889956951141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4455 -4.7545950859785080e-02</internalNodes>
+          <leafValues>
+            -3.8834908604621887e-01 2.2062640637159348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4456 -9.6900813281536102e-02</internalNodes>
+          <leafValues>
+            -4.3412810564041138e-01 6.4087379723787308e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4457 -3.8218989968299866e-01</internalNodes>
+          <leafValues>
+            -9.0176671743392944e-01 7.9825157299637794e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4458 -3.4389309585094452e-02</internalNodes>
+          <leafValues>
+            -3.1850269436836243e-01 9.1135511174798012e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4459 3.9068788290023804e-02</internalNodes>
+          <leafValues>
+            2.8420960530638695e-02 -2.6570749282836914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4460 1.0031700134277344e-01</internalNodes>
+          <leafValues>
+            -1.6155399382114410e-02 1.2212689965963364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4461 -1.0857210308313370e-01</internalNodes>
+          <leafValues>
+            3.7742871046066284e-01 -2.4014420807361603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4462 -4.3303978600306436e-05</internalNodes>
+          <leafValues>
+            2.0308060571551323e-02 -1.3060510158538818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4463 -3.8757279515266418e-02</internalNodes>
+          <leafValues>
+            -1.5826420485973358e-01 4.9129229038953781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4464 6.8668089807033539e-02</internalNodes>
+          <leafValues>
+            5.5041261948645115e-03 -7.2222518920898438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4465 -4.4268090277910233e-03</internalNodes>
+          <leafValues>
+            8.2263059914112091e-02 -1.0354729741811752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4466 -3.1016240245662630e-04</internalNodes>
+          <leafValues>
+            9.0432256460189819e-02 -1.0348629951477051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4467 3.7703070789575577e-02</internalNodes>
+          <leafValues>
+            6.0126338154077530e-02 -1.6111390292644501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4468 4.1672129184007645e-02</internalNodes>
+          <leafValues>
+            8.5145309567451477e-03 -2.4217429757118225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4469 -6.6434321925044060e-03</internalNodes>
+          <leafValues>
+            -2.7172479033470154e-01 3.1463291496038437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4470 -4.0658649057149887e-02</internalNodes>
+          <leafValues>
+            -1.1673620343208313e-01 1.4849590137600899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4471 -3.0082110315561295e-03</internalNodes>
+          <leafValues>
+            4.0028568357229233e-02 -2.3079049587249756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4472 -4.4187769293785095e-02</internalNodes>
+          <leafValues>
+            -1.7888109385967255e-01 1.7313620075583458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4473 -1.1813719756901264e-02</internalNodes>
+          <leafValues>
+            1.5633359551429749e-01 -5.4751630872488022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4474 -2.4433450400829315e-01</internalNodes>
+          <leafValues>
+            4.0716889500617981e-01 -3.8216509856283665e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4475 4.7230181097984314e-01</internalNodes>
+          <leafValues>
+            -5.5454619228839874e-02 1.6410639882087708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4476 1.7955109942704439e-03</internalNodes>
+          <leafValues>
+            9.5228001475334167e-02 -1.2934769690036774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4477 -5.0934039056301117e-02</internalNodes>
+          <leafValues>
+            2.2153440117835999e-01 -3.7975560873746872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4478 -5.9531718492507935e-02</internalNodes>
+          <leafValues>
+            -4.2974939942359924e-01 1.3196409679949284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4479 -3.5149399191141129e-02</internalNodes>
+          <leafValues>
+            -2.1232509613037109e-01 3.6872539669275284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4480 -8.2134327385574579e-04</internalNodes>
+          <leafValues>
+            7.4890241026878357e-02 -6.9701731204986572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4481 6.3945869915187359e-03</internalNodes>
+          <leafValues>
+            8.0602109432220459e-02 -1.0488619655370712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4482 6.3735827803611755e-02</internalNodes>
+          <leafValues>
+            1.1988660320639610e-02 -5.9508371353149414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4483 6.6942021250724792e-02</internalNodes>
+          <leafValues>
+            1.0711859911680222e-02 -7.0240277051925659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4484 3.5445358604192734e-02</internalNodes>
+          <leafValues>
+            8.8395569473505020e-03 -2.0588539540767670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4485 8.2025423645973206e-02</internalNodes>
+          <leafValues>
+            1.1511360295116901e-02 -6.7081338167190552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4486 -1.2151840329170227e-01</internalNodes>
+          <leafValues>
+            3.9124768972396851e-01 -6.0432488098740578e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4487 1.3732859492301941e-01</internalNodes>
+          <leafValues>
+            -1.6136020421981812e-02 4.6182548999786377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4488 -1.6075259447097778e-01</internalNodes>
+          <leafValues>
+            -1. 2.4232869036495686e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4489 6.3080438412725925e-03</internalNodes>
+          <leafValues>
+            4.3026689440011978e-02 -1.9072249531745911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4490 -8.5772968828678131e-02</internalNodes>
+          <leafValues>
+            -5.3327548503875732e-01 1.4197999611496925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4491 5.5853448808193207e-02</internalNodes>
+          <leafValues>
+            4.0535259991884232e-02 -2.0816819369792938e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>350</maxWeakCount>
+      <stageThreshold>-1.3171190023422241e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 4492 -1.1009960435330868e-02</internalNodes>
+          <leafValues>
+            1.6106800734996796e-01 -2.3270499706268311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4493 5.6892321445047855e-03</internalNodes>
+          <leafValues>
+            -2.2233660519123077e-01 1.2257739901542664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4494 4.3932348489761353e-03</internalNodes>
+          <leafValues>
+            -1.5293380618095398e-01 1.5888489782810211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4495 -5.0024059601128101e-04</internalNodes>
+          <leafValues>
+            6.1716180294752121e-02 -2.3175540566444397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4496 4.2015648796223104e-04</internalNodes>
+          <leafValues>
+            -3.0259498953819275e-01 6.1093948781490326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4497 -4.2626978829503059e-03</internalNodes>
+          <leafValues>
+            -2.4387679994106293e-01 6.9513782858848572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4498 6.5330968936905265e-04</internalNodes>
+          <leafValues>
+            -3.7112379074096680e-01 4.6169780194759369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4499 -1.0163539648056030e-01</internalNodes>
+          <leafValues>
+            4.5089960098266602e-01 -1.4424510300159454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4500 -1.3200199464336038e-03</internalNodes>
+          <leafValues>
+            7.5765132904052734e-02 -1.9461849331855774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4501 -9.8261423408985138e-03</internalNodes>
+          <leafValues>
+            -2.7440890669822693e-01 5.2373219281435013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4502 -6.6574551165103912e-02</internalNodes>
+          <leafValues>
+            4.2804849147796631e-01 -3.2640948891639709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4503 -9.1772843152284622e-03</internalNodes>
+          <leafValues>
+            -2.5876390933990479e-01 6.1596788465976715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4504 -2.5353950913995504e-03</internalNodes>
+          <leafValues>
+            1.1473689973354340e-01 -1.0097979754209518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4505 4.9194418825209141e-03</internalNodes>
+          <leafValues>
+            4.0027469396591187e-02 -1.6378170251846313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4506 -1.6810640227049589e-03</internalNodes>
+          <leafValues>
+            -1.3706670701503754e-01 8.0321729183197021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4507 2.1476070396602154e-03</internalNodes>
+          <leafValues>
+            -2.3408600687980652e-01 4.3113950639963150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4508 -3.3502440899610519e-02</internalNodes>
+          <leafValues>
+            -2.4204289913177490e-01 4.9100209027528763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4509 1.4241789281368256e-01</internalNodes>
+          <leafValues>
+            -2.8680980205535889e-02 4.7807058691978455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4510 5.8733951300382614e-04</internalNodes>
+          <leafValues>
+            -2.1685610711574554e-01 4.8530109226703644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4511 -1.2295519700273871e-03</internalNodes>
+          <leafValues>
+            9.3180246651172638e-02 -1.0158210247755051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4512 1.1210669763386250e-02</internalNodes>
+          <leafValues>
+            3.6210179328918457e-02 -2.3106449842453003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4513 -2.5235990062355995e-02</internalNodes>
+          <leafValues>
+            8.5747621953487396e-02 -5.4415158927440643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4514 -1.0014030151069164e-02</internalNodes>
+          <leafValues>
+            -1.9362440705299377e-01 5.0274729728698730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4515 -4.5554949901998043e-03</internalNodes>
+          <leafValues>
+            8.8674992322921753e-02 -1.4237509667873383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4516 -9.5264799892902374e-03</internalNodes>
+          <leafValues>
+            2.6754239201545715e-01 -3.7632450461387634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4517 2.3753349669277668e-03</internalNodes>
+          <leafValues>
+            3.9261918514966965e-02 -1.4199909567832947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4518 1.2389000039547682e-03</internalNodes>
+          <leafValues>
+            6.8643912672996521e-02 -1.8060870468616486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4519 -1.5835729427635670e-03</internalNodes>
+          <leafValues>
+            -1.3684159517288208e-01 5.7875689119100571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4520 6.5202586352825165e-02</internalNodes>
+          <leafValues>
+            -3.4448388963937759e-02 2.5318139791488647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4521 6.6306376538705081e-05</internalNodes>
+          <leafValues>
+            -8.4601633250713348e-02 9.1657586395740509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4522 1.5117590010049753e-05</internalNodes>
+          <leafValues>
+            -9.3343816697597504e-02 1.1079390347003937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4523 -2.2637350484728813e-03</internalNodes>
+          <leafValues>
+            -1.9531199336051941e-01 3.8263510912656784e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4524 6.5463641658425331e-04</internalNodes>
+          <leafValues>
+            4.7860879451036453e-02 -1.6354900598526001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4525 5.0345290452241898e-02</internalNodes>
+          <leafValues>
+            -1.5618369914591312e-02 5.2660512924194336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4526 8.5375197231769562e-03</internalNodes>
+          <leafValues>
+            3.3894728869199753e-02 -2.7040940523147583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4527 -6.1621618270874023e-01</internalNodes>
+          <leafValues>
+            -9.3156081438064575e-01 2.6866910047829151e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4528 -2.6742840185761452e-02</internalNodes>
+          <leafValues>
+            1.2415560334920883e-01 -8.1576861441135406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4529 -1.4756740070879459e-02</internalNodes>
+          <leafValues>
+            -4.4224148988723755e-01 2.4418739601969719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4530 1.2045809999108315e-02</internalNodes>
+          <leafValues>
+            -8.4552876651287079e-02 9.2735297977924347e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4531 -4.0131900459527969e-02</internalNodes>
+          <leafValues>
+            -2.5734719634056091e-01 1.0692110285162926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4532 -1.0760580189526081e-03</internalNodes>
+          <leafValues>
+            2.8027180582284927e-02 -2.6805961132049561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4533 7.7456878498196602e-03</internalNodes>
+          <leafValues>
+            -3.6401689052581787e-02 2.6165041327476501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4534 1.3539849780499935e-02</internalNodes>
+          <leafValues>
+            2.8945919126272202e-02 -2.8003379702568054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4535 -1.2464780360460281e-02</internalNodes>
+          <leafValues>
+            -3.6258488893508911e-01 1.3006039895117283e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4536 3.5297829657793045e-02</internalNodes>
+          <leafValues>
+            1.2918749824166298e-02 -5.6460797786712646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4537 -5.5710550397634506e-02</internalNodes>
+          <leafValues>
+            1.2794859707355499e-01 -3.8257118314504623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4538 -4.5230439864099026e-03</internalNodes>
+          <leafValues>
+            -9.9410563707351685e-02 7.8997522592544556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4539 2.9874469619244337e-03</internalNodes>
+          <leafValues>
+            -4.8509139567613602e-02 1.1298680305480957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4540 -6.3613310456275940e-02</internalNodes>
+          <leafValues>
+            -6.6647279262542725e-01 1.1221170425415039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4541 1.3244490139186382e-02</internalNodes>
+          <leafValues>
+            -6.1976868659257889e-02 1.3122899830341339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4542 -3.6382430698722601e-04</internalNodes>
+          <leafValues>
+            4.3054241687059402e-02 -1.6996359825134277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4543 -2.1500189602375031e-01</internalNodes>
+          <leafValues>
+            -4.6784079074859619e-01 1.2286320328712463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4544 6.0248938389122486e-03</internalNodes>
+          <leafValues>
+            -5.1475919783115387e-02 1.5234859287738800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4545 4.3000571429729462e-02</internalNodes>
+          <leafValues>
+            3.8120739627629519e-03 -7.5349187850952148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4546 8.5592586547136307e-03</internalNodes>
+          <leafValues>
+            2.4470439180731773e-02 -3.2796609401702881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4547 2.9510160675272346e-04</internalNodes>
+          <leafValues>
+            -7.6456926763057709e-02 6.8010047078132629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4548 9.9761411547660828e-04</internalNodes>
+          <leafValues>
+            -8.4680661559104919e-02 9.6316136419773102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4549 5.0175599753856659e-03</internalNodes>
+          <leafValues>
+            -3.9048101752996445e-02 1.0983789712190628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4550 5.5693010799586773e-03</internalNodes>
+          <leafValues>
+            4.0719300508499146e-02 -1.8395960330963135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4551 1.0486049577593803e-03</internalNodes>
+          <leafValues>
+            -4.4622048735618591e-02 7.0918112993240356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4552 3.2043100800365210e-03</internalNodes>
+          <leafValues>
+            -5.8839108794927597e-02 1.2777310609817505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4553 -1.0644660145044327e-01</internalNodes>
+          <leafValues>
+            4.3339949846267700e-01 -1.2449969537556171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4554 -8.9908082736656070e-04</internalNodes>
+          <leafValues>
+            -1.1510500311851501e-01 6.3306562602519989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4555 2.9652470257133245e-03</internalNodes>
+          <leafValues>
+            -3.1290680170059204e-02 7.2845660150051117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4556 8.9800870046019554e-04</internalNodes>
+          <leafValues>
+            -8.6840502917766571e-02 1.0022729635238647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4557 -2.1874029189348221e-02</internalNodes>
+          <leafValues>
+            7.6143169403076172e-01 -4.5735938474535942e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4558 1.4919589739292860e-03</internalNodes>
+          <leafValues>
+            8.2724168896675110e-02 -9.6837893128395081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4559 -2.4136069696396589e-03</internalNodes>
+          <leafValues>
+            6.2480941414833069e-02 -5.0549559295177460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4560 1.2893830426037312e-02</internalNodes>
+          <leafValues>
+            -3.3901989459991455e-02 2.8036591410636902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4561 -1.9992720335721970e-03</internalNodes>
+          <leafValues>
+            -1.7152810096740723e-01 4.0084149688482285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4562 1.3713949592784047e-03</internalNodes>
+          <leafValues>
+            -1.2216719985008240e-01 6.2122181057929993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4563 -8.9740045368671417e-03</internalNodes>
+          <leafValues>
+            -1.7094230651855469e-01 4.4032000005245209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4564 -2.9300691094249487e-03</internalNodes>
+          <leafValues>
+            1.2364040315151215e-01 -6.3765726983547211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4565 -8.0555928871035576e-03</internalNodes>
+          <leafValues>
+            1.1552560329437256e-01 -4.4458869844675064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4566 6.4662001095712185e-03</internalNodes>
+          <leafValues>
+            7.5147427618503571e-02 -1.1281009763479233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4567 -1.9541789591312408e-01</internalNodes>
+          <leafValues>
+            -8.6494231224060059e-01 3.1826570630073547e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4568 -1.5740759670734406e-01</internalNodes>
+          <leafValues>
+            -7.2405809164047241e-01 9.4235781580209732e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4569 -3.1526461243629456e-02</internalNodes>
+          <leafValues>
+            -3.8218951225280762e-01 1.6386790201067924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4570 5.0439048558473587e-02</internalNodes>
+          <leafValues>
+            -2.7623040601611137e-02 2.7306279540061951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4571 -5.5078428704291582e-04</internalNodes>
+          <leafValues>
+            4.9623548984527588e-02 -5.4462801665067673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4572 1.5047970227897167e-03</internalNodes>
+          <leafValues>
+            -6.2058940529823303e-02 1.2204010039567947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4573 -4.5796841382980347e-02</internalNodes>
+          <leafValues>
+            -9.3314772844314575e-01 6.8162381649017334e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4574 -9.3235643580555916e-03</internalNodes>
+          <leafValues>
+            -2.7436700463294983e-01 2.7820749208331108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4575 1.0689129680395126e-01</internalNodes>
+          <leafValues>
+            4.7212988138198853e-03 -4.4037041068077087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4576 1.1234519770368934e-03</internalNodes>
+          <leafValues>
+            -1.4162249863147736e-01 4.7511368989944458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4577 6.7312899045646191e-03</internalNodes>
+          <leafValues>
+            -4.5881479978561401e-02 1.1342740058898926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4578 4.1264150291681290e-02</internalNodes>
+          <leafValues>
+            1.1406780220568180e-02 -6.2894171476364136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4579 -7.3788799345493317e-02</internalNodes>
+          <leafValues>
+            -4.1924831271171570e-01 7.9344836995005608e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4580 -3.2669529318809509e-02</internalNodes>
+          <leafValues>
+            2.2224910557270050e-01 -3.0845979228615761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4581 -5.9001590125262737e-03</internalNodes>
+          <leafValues>
+            -1.5003520250320435e-01 4.5819710940122604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4582 -7.4141867458820343e-02</internalNodes>
+          <leafValues>
+            5.6236612796783447e-01 -1.1184119619429111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4583 -1.7110589891672134e-02</internalNodes>
+          <leafValues>
+            -3.0888330936431885e-01 1.7340350896120071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4584 2.4508470669388771e-03</internalNodes>
+          <leafValues>
+            -5.7074081152677536e-02 1.1306890100240707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4585 -2.1157979965209961e-02</internalNodes>
+          <leafValues>
+            2.0264630019664764e-01 -1.4705169945955276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4586 7.1819419972598553e-03</internalNodes>
+          <leafValues>
+            2.9788199812173843e-02 -2.2308370471000671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4587 5.0557879731059074e-03</internalNodes>
+          <leafValues>
+            -2.6257280260324478e-02 1.2028290331363678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4588 1.2610659934580326e-02</internalNodes>
+          <leafValues>
+            2.5965299457311630e-02 -2.5755238533020020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4589 3.0165250791469589e-05</internalNodes>
+          <leafValues>
+            -1.1994919925928116e-01 2.8916500508785248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4590 -1.3415860012173653e-03</internalNodes>
+          <leafValues>
+            2.0592840015888214e-01 -3.2803039997816086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4591 5.9342157328501344e-04</internalNodes>
+          <leafValues>
+            4.9788691103458405e-02 -7.0998527109622955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4592 -1.5428929589688778e-02</internalNodes>
+          <leafValues>
+            3.2733771204948425e-01 -2.0239489153027534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4593 -1.1928460298804566e-04</internalNodes>
+          <leafValues>
+            2.6405010372400284e-02 -1.4666070044040680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4594 -2.1726880222558975e-02</internalNodes>
+          <leafValues>
+            -4.4014349579811096e-01 1.4264649711549282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4595 -3.0710769817233086e-02</internalNodes>
+          <leafValues>
+            1.3549150526523590e-01 -1.7586210742592812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4596 4.3861479498445988e-03</internalNodes>
+          <leafValues>
+            5.4423790425062180e-02 -1.1234579980373383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4597 4.7966800630092621e-03</internalNodes>
+          <leafValues>
+            -4.3494079262018204e-02 1.3108870387077332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4598 2.2497470490634441e-03</internalNodes>
+          <leafValues>
+            5.9489808976650238e-02 -1.0955479741096497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4599 4.3578739278018475e-03</internalNodes>
+          <leafValues>
+            5.9186179190874100e-02 -1.3026049733161926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4600 2.0433720201253891e-03</internalNodes>
+          <leafValues>
+            -5.1625490188598633e-02 1.3787810504436493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4601 -2.0268680527806282e-03</internalNodes>
+          <leafValues>
+            8.8105127215385437e-02 -8.5867561399936676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4602 -6.5703789005056024e-04</internalNodes>
+          <leafValues>
+            7.1044988930225372e-02 -9.0751543641090393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4603 4.4309969991445541e-02</internalNodes>
+          <leafValues>
+            -1.1522290296852589e-02 2.2733740508556366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4604 4.6578957699239254e-03</internalNodes>
+          <leafValues>
+            -4.6123549342155457e-02 1.5277029573917389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4605 -4.0960058569908142e-02</internalNodes>
+          <leafValues>
+            -5.5988901853561401e-01 1.2064740061759949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4606 -6.7416871897876263e-03</internalNodes>
+          <leafValues>
+            1.0484070330858231e-01 -6.5152801573276520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4607 -2.9713090043514967e-04</internalNodes>
+          <leafValues>
+            3.2221201807260513e-02 -8.4709979593753815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4608 -8.0926045775413513e-03</internalNodes>
+          <leafValues>
+            -1.6476640105247498e-01 4.5700121670961380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4609 4.0710348635911942e-02</internalNodes>
+          <leafValues>
+            1.0099260136485100e-02 -1.0893329977989197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4610 -1.1402929667383432e-03</internalNodes>
+          <leafValues>
+            -1.9269819557666779e-01 4.4590830802917480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4611 -2.0306430757045746e-02</internalNodes>
+          <leafValues>
+            6.8668061494827271e-01 -9.8533723503351212e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4612 4.8631370067596436e-02</internalNodes>
+          <leafValues>
+            1.1991590261459351e-02 -6.4770907163619995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4613 -5.4414950311183929e-02</internalNodes>
+          <leafValues>
+            3.4730699658393860e-01 -1.1940590105950832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4614 -5.9532530605792999e-02</internalNodes>
+          <leafValues>
+            3.6410269141197205e-01 -1.6050819307565689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4615 -3.5089451819658279e-02</internalNodes>
+          <leafValues>
+            -1.9252899289131165e-01 2.3598629981279373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4616 5.7658711448311806e-03</internalNodes>
+          <leafValues>
+            -4.6293850988149643e-02 1.5287970006465912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4617 -2.3687579669058323e-03</internalNodes>
+          <leafValues>
+            5.7345230132341385e-02 -8.8195472955703735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4618 -2.7341600507497787e-03</internalNodes>
+          <leafValues>
+            -2.3896160721778870e-01 2.5761809200048447e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4619 -9.1599775478243828e-03</internalNodes>
+          <leafValues>
+            1.0037499666213989e-01 -2.6731979101896286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4620 -5.0623171031475067e-02</internalNodes>
+          <leafValues>
+            4.6908378601074219e-01 -1.3880429789423943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4621 -4.3487590737640858e-03</internalNodes>
+          <leafValues>
+            -1.4812940359115601e-01 5.2115358412265778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4622 4.0859800577163696e-01</internalNodes>
+          <leafValues>
+            1.5454529784619808e-02 -4.6494269371032715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4623 5.3104009479284286e-02</internalNodes>
+          <leafValues>
+            7.8609427437186241e-03 -5.3555142879486084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4624 -4.1035288013517857e-03</internalNodes>
+          <leafValues>
+            -1.3777880370616913e-01 4.6847809106111526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4625 -2.7622529305517673e-03</internalNodes>
+          <leafValues>
+            5.2303940057754517e-02 -9.4970837235450745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4626 9.3903020024299622e-03</internalNodes>
+          <leafValues>
+            -2.3493729531764984e-02 3.6259791254997253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4627 2.3771630600094795e-02</internalNodes>
+          <leafValues>
+            8.0746166408061981e-02 -8.2893602550029755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4628 2.8008709196001291e-03</internalNodes>
+          <leafValues>
+            -2.6595699787139893e-01 2.8534680604934692e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4629 -6.3013769686222076e-03</internalNodes>
+          <leafValues>
+            8.0481633543968201e-02 -2.9016179963946342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4630 -5.1433448679745197e-03</internalNodes>
+          <leafValues>
+            -1.1473509669303894e-01 5.8448631316423416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4631 1.0679479455575347e-03</internalNodes>
+          <leafValues>
+            -3.1661890447139740e-02 5.4522778838872910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4632 1.5213950537145138e-03</internalNodes>
+          <leafValues>
+            -6.2172550708055496e-02 9.7601316869258881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4633 -3.3779911696910858e-02</internalNodes>
+          <leafValues>
+            -4.9582698941230774e-01 1.2093319557607174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4634 -1.0505370050668716e-01</internalNodes>
+          <leafValues>
+            -9.8738801479339600e-01 5.1499558612704277e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4635 1.9685840234160423e-02</internalNodes>
+          <leafValues>
+            -5.6189429014921188e-02 9.1260537505149841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4636 6.6470399498939514e-02</internalNodes>
+          <leafValues>
+            1.4097889885306358e-02 -4.5731648802757263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4637 -1.5898099169135094e-02</internalNodes>
+          <leafValues>
+            -2.3317760229110718e-01 1.1369620449841022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4638 4.0450799278914928e-03</internalNodes>
+          <leafValues>
+            4.3345049023628235e-02 -1.5908020734786987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4639 -3.3486548811197281e-02</internalNodes>
+          <leafValues>
+            1.3086590170860291e-01 -3.4327559173107147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4640 2.1458480507135391e-02</internalNodes>
+          <leafValues>
+            -5.0213351845741272e-02 1.1467009782791138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4641 1.1672739684581757e-01</internalNodes>
+          <leafValues>
+            -3.4590030554682016e-03 4.4156730175018311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4642 -5.0386278890073299e-03</internalNodes>
+          <leafValues>
+            -1.3995400071144104e-01 4.0854398161172867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4643 3.7261120975017548e-02</internalNodes>
+          <leafValues>
+            -1.6399189829826355e-02 2.3627850413322449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4644 -1.7991460859775543e-02</internalNodes>
+          <leafValues>
+            -5.6703627109527588e-01 1.0185079649090767e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4645 1.0748039931058884e-01</internalNodes>
+          <leafValues>
+            1.8287489656358957e-03 -7.8705781698226929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4646 -2.1439619362354279e-02</internalNodes>
+          <leafValues>
+            1.8347090482711792e-01 -3.2410789281129837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4647 6.8095367169007659e-04</internalNodes>
+          <leafValues>
+            4.1675068438053131e-02 -8.9301638305187225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4648 -6.8581351079046726e-03</internalNodes>
+          <leafValues>
+            -1.4511869847774506e-01 5.1585499197244644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4649 1.5318280458450317e-01</internalNodes>
+          <leafValues>
+            3.1881679315119982e-03 -4.4190090894699097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4650 2.2777369245886803e-02</internalNodes>
+          <leafValues>
+            -4.3234121054410934e-02 1.7477220296859741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4651 6.6160550341010094e-03</internalNodes>
+          <leafValues>
+            4.3140821158885956e-02 -1.7188510298728943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4652 -8.8224448263645172e-03</internalNodes>
+          <leafValues>
+            1.3203169405460358e-01 -4.7509200870990753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4653 -5.1209977827966213e-03</internalNodes>
+          <leafValues>
+            -1.8979160487651825e-01 5.7657308876514435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4654 -1.0311880148947239e-02</internalNodes>
+          <leafValues>
+            3.2286819815635681e-01 -1.9725019112229347e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4655 -2.5065759196877480e-02</internalNodes>
+          <leafValues>
+            -3.6572399735450745e-01 1.8344869837164879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4656 -1.4318429864943027e-02</internalNodes>
+          <leafValues>
+            1.5795469284057617e-01 -3.8276918232440948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4657 -5.7383939623832703e-02</internalNodes>
+          <leafValues>
+            -3.6835289001464844e-01 1.6900209710001945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4658 -4.3680299073457718e-02</internalNodes>
+          <leafValues>
+            4.4766798615455627e-01 -1.3710459694266319e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4659 -2.4289099872112274e-01</internalNodes>
+          <leafValues>
+            -7.5490927696228027e-01 8.9195184409618378e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4660 3.8089449517428875e-03</internalNodes>
+          <leafValues>
+            -6.2916718423366547e-02 9.4282902777194977e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4661 8.9389752247370780e-05</internalNodes>
+          <leafValues>
+            -1.1253400146961212e-01 9.9447913467884064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4662 2.7378369122743607e-03</internalNodes>
+          <leafValues>
+            7.4880510568618774e-02 -9.9257610738277435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4663 2.3680560290813446e-02</internalNodes>
+          <leafValues>
+            1.2105870060622692e-02 -1.1780750006437302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4664 -4.6060070395469666e-02</internalNodes>
+          <leafValues>
+            3.9799740910530090e-01 -1.7129369080066681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4665 2.1130219101905823e-03</internalNodes>
+          <leafValues>
+            -6.0906849801540375e-02 4.9974281340837479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4666 1.4753149822354317e-02</internalNodes>
+          <leafValues>
+            1.6629729419946671e-02 -3.7806668877601624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4667 3.5430908203125000e-02</internalNodes>
+          <leafValues>
+            -2.3844370618462563e-02 2.6354551315307617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4668 -5.0745099782943726e-02</internalNodes>
+          <leafValues>
+            -2.3141309618949890e-01 2.8320349752902985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4669 8.9874058961868286e-02</internalNodes>
+          <leafValues>
+            -1.0191249661147594e-02 2.6277700066566467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4670 -2.7411670889705420e-03</internalNodes>
+          <leafValues>
+            -1.3828440010547638e-01 4.6966280788183212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4671 8.7385937571525574e-02</internalNodes>
+          <leafValues>
+            1.7351199639961123e-03 -8.0810409784317017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4672 -2.9055110644549131e-03</internalNodes>
+          <leafValues>
+            6.6193267703056335e-02 -9.5981188118457794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4673 -5.1255577802658081e-01</internalNodes>
+          <leafValues>
+            -1. 8.6886010831221938e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4674 -1.3281259685754776e-02</internalNodes>
+          <leafValues>
+            1.0134270042181015e-01 -6.4344279468059540e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4675 5.3660940378904343e-02</internalNodes>
+          <leafValues>
+            3.2843649387359619e-03 -8.0011987686157227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4676 3.9290629327297211e-02</internalNodes>
+          <leafValues>
+            9.0429633855819702e-03 -6.7074328660964966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4677 6.5197132527828217e-02</internalNodes>
+          <leafValues>
+            4.4964649714529514e-03 -9.7931307554244995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4678 3.2505281269550323e-02</internalNodes>
+          <leafValues>
+            -1.2679249979555607e-02 4.9774479866027832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4679 -6.5749078989028931e-02</internalNodes>
+          <leafValues>
+            -3.7844368815422058e-01 5.9391320683062077e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4680 -6.0045070946216583e-02</internalNodes>
+          <leafValues>
+            -3.9957770705223083e-01 1.4155699871480465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4681 -4.6631351113319397e-02</internalNodes>
+          <leafValues>
+            1.6843810677528381e-01 -3.7634961307048798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4682 1.8095660198014230e-04</internalNodes>
+          <leafValues>
+            -1.0198330134153366e-01 7.2940513491630554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4683 -3.7607289850711823e-03</internalNodes>
+          <leafValues>
+            4.5154098421335220e-02 -5.4370220750570297e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4684 -5.0964287947863340e-04</internalNodes>
+          <leafValues>
+            1.6106060147285461e-01 -5.4398071020841599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4685 -1.6095000319182873e-03</internalNodes>
+          <leafValues>
+            -2.1058610081672668e-01 3.0864259228110313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4686 -5.4673491977155209e-03</internalNodes>
+          <leafValues>
+            1.9076080620288849e-01 -3.2738618552684784e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4687 4.1697090491652489e-03</internalNodes>
+          <leafValues>
+            2.0009849220514297e-02 -6.8173840641975403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4688 3.2709140796214342e-03</internalNodes>
+          <leafValues>
+            -1.1110019683837891e-01 5.8211889117956161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4689 -5.1663857884705067e-03</internalNodes>
+          <leafValues>
+            -8.5210792720317841e-02 3.3905100077390671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4690 -1.2914719991385937e-02</internalNodes>
+          <leafValues>
+            -1.3726939260959625e-01 4.8348769545555115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4691 -3.8130749017000198e-03</internalNodes>
+          <leafValues>
+            -1.1084940284490585e-01 3.2373629510402679e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4692 -5.7762481272220612e-02</internalNodes>
+          <leafValues>
+            2.1701450645923615e-01 -2.9828049242496490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4693 -2.2619909141212702e-03</internalNodes>
+          <leafValues>
+            3.5641018301248550e-02 -5.5289078503847122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4694 5.2979849278926849e-02</internalNodes>
+          <leafValues>
+            7.7050398103892803e-03 -7.2121208906173706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4695 -3.3839911222457886e-01</internalNodes>
+          <leafValues>
+            -9.4540262222290039e-01 4.5049181208014488e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4696 5.2918092114850879e-04</internalNodes>
+          <leafValues>
+            4.1633930057287216e-02 -1.3283179700374603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4697 2.8239609673619270e-03</internalNodes>
+          <leafValues>
+            1.3815909624099731e-01 -1.1371930129826069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4698 -2.1569489035755396e-03</internalNodes>
+          <leafValues>
+            6.3553653657436371e-02 -8.4683336317539215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4699 4.1426848620176315e-03</internalNodes>
+          <leafValues>
+            4.1431330144405365e-02 -9.1413199901580811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4700 -1.1016559787094593e-02</internalNodes>
+          <leafValues>
+            8.0382406711578369e-02 -8.3978570997714996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4701 -6.5561989322304726e-03</internalNodes>
+          <leafValues>
+            -1.3563759624958038e-01 3.4514341503381729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4702 -2.2384698968380690e-03</internalNodes>
+          <leafValues>
+            -1.2900340557098389e-01 6.0718830674886703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4703 -1.2789719738066196e-02</internalNodes>
+          <leafValues>
+            2.6254388689994812e-01 -2.5295289233326912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4704 -1.1028759926557541e-01</internalNodes>
+          <leafValues>
+            -4.0324538946151733e-01 1.3996849767863750e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4705 2.9025289695709944e-03</internalNodes>
+          <leafValues>
+            -6.0133900493383408e-02 4.0657509118318558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4706 1.3041580095887184e-03</internalNodes>
+          <leafValues>
+            -1.1271840333938599e-01 5.3001549094915390e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4707 4.8518911004066467e-02</internalNodes>
+          <leafValues>
+            9.9352700635790825e-03 -3.3844459056854248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4708 -5.0848070532083511e-03</internalNodes>
+          <leafValues>
+            -1.3072639703750610e-01 4.7106929123401642e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4709 5.7023460976779461e-03</internalNodes>
+          <leafValues>
+            -5.2840489894151688e-02 1.2418749928474426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4710 -2.7858179528266191e-03</internalNodes>
+          <leafValues>
+            -9.6685640513896942e-02 6.6828437149524689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4711 -3.0082210432738066e-03</internalNodes>
+          <leafValues>
+            7.1778140962123871e-02 -3.8511540740728378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4712 6.9350451231002808e-03</internalNodes>
+          <leafValues>
+            -5.7932149618864059e-02 1.0691670328378677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4713 -4.7064341604709625e-02</internalNodes>
+          <leafValues>
+            1.0284499824047089e-01 -2.7998289093375206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4714 -8.2645736634731293e-02</internalNodes>
+          <leafValues>
+            -8.5849452018737793e-01 6.3560227863490582e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4715 8.9476434513926506e-03</internalNodes>
+          <leafValues>
+            -3.9904471486806870e-02 6.6897280514240265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4716 3.0593979358673096e-01</internalNodes>
+          <leafValues>
+            7.2277039289474487e-03 -7.9749721288681030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4717 -5.8336472138762474e-03</internalNodes>
+          <leafValues>
+            -1.9526490569114685e-01 2.4196550250053406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4718 -5.3784619085490704e-03</internalNodes>
+          <leafValues>
+            7.1967631578445435e-02 -9.1547563672065735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4719 9.2504899948835373e-03</internalNodes>
+          <leafValues>
+            3.6146361380815506e-02 -7.4494920670986176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4720 3.7581291049718857e-02</internalNodes>
+          <leafValues>
+            -2.0222729071974754e-02 3.3224269747734070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4721 -4.6818740665912628e-02</internalNodes>
+          <leafValues>
+            -5.0513672828674316e-01 1.2870309874415398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4722 3.3507939428091049e-02</internalNodes>
+          <leafValues>
+            -1.8688799813389778e-02 3.0542388558387756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4723 6.8437248468399048e-02</internalNodes>
+          <leafValues>
+            -6.2482542125508189e-04 8.3963787555694580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4724 1.0151940397918224e-02</internalNodes>
+          <leafValues>
+            2.5653729215264320e-02 -2.1830080449581146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4725 -1.3866250216960907e-01</internalNodes>
+          <leafValues>
+            5.7341670989990234e-01 -6.0921781696379185e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4726 -1.1214310070499778e-03</internalNodes>
+          <leafValues>
+            7.0692487061023712e-02 -8.2995750010013580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4727 1.4782310463488102e-03</internalNodes>
+          <leafValues>
+            -3.5161279141902924e-02 5.8569159358739853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4728 -2.3407500702887774e-03</internalNodes>
+          <leafValues>
+            1.2667399644851685e-01 -7.7700607478618622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4729 4.3265568092465401e-03</internalNodes>
+          <leafValues>
+            3.1229879707098007e-02 -1.1680649966001511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4730 -3.2252248376607895e-02</internalNodes>
+          <leafValues>
+            -5.4395800828933716e-01 1.0386509820818901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4731 -7.1836792631074786e-04</internalNodes>
+          <leafValues>
+            -6.3850082457065582e-02 4.8989679664373398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4732 1.1035969946533442e-03</internalNodes>
+          <leafValues>
+            -7.1095839142799377e-02 8.3087973296642303e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4733 -1.0265519842505455e-02</internalNodes>
+          <leafValues>
+            1.1647050082683563e-01 -2.8178630396723747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4734 7.2632037103176117e-02</internalNodes>
+          <leafValues>
+            7.5578331016004086e-03 -7.1635490655899048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4735 1.2232369929552078e-01</internalNodes>
+          <leafValues>
+            -3.9898478426039219e-03 6.0708892345428467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4736 -1.4398260414600372e-01</internalNodes>
+          <leafValues>
+            8.5836321115493774e-01 -5.8769038878381252e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4737 5.9525449760258198e-03</internalNodes>
+          <leafValues>
+            2.1712759509682655e-02 -1.5896700322628021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4738 -1.3158279471099377e-03</internalNodes>
+          <leafValues>
+            8.3239771425724030e-02 -7.1944266557693481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4739 -3.5782668739557266e-02</internalNodes>
+          <leafValues>
+            -3.1888490915298462e-01 6.7262151278555393e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4740 1.4122560387477279e-03</internalNodes>
+          <leafValues>
+            -6.9247573614120483e-02 8.8037729263305664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4741 -1.6188029199838638e-02</internalNodes>
+          <leafValues>
+            -6.0439001768827438e-02 6.7530423402786255e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4742 -2.8433150146156549e-03</internalNodes>
+          <leafValues>
+            6.4466439187526703e-02 -1.0504409670829773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4743 -1.5944750048220158e-03</internalNodes>
+          <leafValues>
+            -5.1919359713792801e-02 5.3710401058197021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4744 1.8808269500732422e-01</internalNodes>
+          <leafValues>
+            -8.1325937062501907e-03 7.0354807376861572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4745 -3.3552229404449463e-02</internalNodes>
+          <leafValues>
+            -3.1318250298500061e-01 2.4297190830111504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4746 -1.5341060236096382e-02</internalNodes>
+          <leafValues>
+            2.3687170445919037e-01 -2.8020450845360756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4747 -1.3534810394048691e-02</internalNodes>
+          <leafValues>
+            -3.1544640660285950e-01 2.3011740297079086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4748 3.2969659660011530e-03</internalNodes>
+          <leafValues>
+            3.2923359423875809e-02 -1.5933570265769958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4749 -4.4846888631582260e-02</internalNodes>
+          <leafValues>
+            1.2876190245151520e-01 -1.7795780673623085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4750 5.1291137933731079e-03</internalNodes>
+          <leafValues>
+            3.2709009945392609e-02 -1.7871360480785370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4751 1.1287770466879010e-03</internalNodes>
+          <leafValues>
+            -7.6234400272369385e-02 7.1267232298851013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4752 1.2759109959006310e-02</internalNodes>
+          <leafValues>
+            -5.1268041133880615e-02 1.2901780009269714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4753 5.3586461581289768e-04</internalNodes>
+          <leafValues>
+            6.6144347190856934e-02 -6.8021528422832489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4754 5.8012880617752671e-04</internalNodes>
+          <leafValues>
+            7.5946256518363953e-02 -7.2426833212375641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4755 9.8113536834716797e-02</internalNodes>
+          <leafValues>
+            4.4115697965025902e-03 -5.7646822929382324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4756 3.2547891139984131e-01</internalNodes>
+          <leafValues>
+            -2.8849789872765541e-02 2.3245050013065338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4757 1.6109529882669449e-02</internalNodes>
+          <leafValues>
+            2.6149509474635124e-02 -2.2507910430431366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4758 1.6630800440907478e-02</internalNodes>
+          <leafValues>
+            -5.6001648306846619e-02 1.0011140257120132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4759 1.2567469850182533e-02</internalNodes>
+          <leafValues>
+            1.1760590225458145e-01 -2.5833690539002419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4760 2.4531960487365723e-02</internalNodes>
+          <leafValues>
+            2.1979559212923050e-02 -2.4158330261707306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4761 5.1343659870326519e-03</internalNodes>
+          <leafValues>
+            -1.3964179903268814e-02 1.0398290306329727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4762 -1.1144300224259496e-03</internalNodes>
+          <leafValues>
+            -8.1608608365058899e-02 6.4991973340511322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4763 -6.8641006946563721e-02</internalNodes>
+          <leafValues>
+            3.7113350629806519e-01 -1.7774619162082672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4764 8.8211498223245144e-04</internalNodes>
+          <leafValues>
+            -8.4080681204795837e-02 6.2524639070034027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4765 1.0471940040588379e-03</internalNodes>
+          <leafValues>
+            6.9488562643527985e-02 -8.3000160753726959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4766 1.6197249293327332e-02</internalNodes>
+          <leafValues>
+            1.6007730737328529e-02 -3.4216699004173279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4767 -2.2690620273351669e-02</internalNodes>
+          <leafValues>
+            1.3959160447120667e-01 -4.2305570095777512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4768 -4.1030000895261765e-02</internalNodes>
+          <leafValues>
+            -3.4669420123100281e-01 1.7233539372682571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4769 8.5194930434226990e-02</internalNodes>
+          <leafValues>
+            -8.8493460789322853e-03 6.0639351606369019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4770 3.9775099605321884e-02</internalNodes>
+          <leafValues>
+            6.5457229502499104e-03 -9.3794268369674683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4771 -1.8673250451683998e-02</internalNodes>
+          <leafValues>
+            8.4701649844646454e-02 -2.1742990240454674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4772 -1.1632209643721581e-02</internalNodes>
+          <leafValues>
+            -1.6503639519214630e-01 3.2852791249752045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4773 -2.1068679634481668e-03</internalNodes>
+          <leafValues>
+            2.5774169713258743e-02 -1.0540559887886047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4774 -1.0474229929968715e-03</internalNodes>
+          <leafValues>
+            5.3470570594072342e-02 -1.0844449698925018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4775 6.6169992089271545e-02</internalNodes>
+          <leafValues>
+            2.6304489001631737e-03 -4.3908849358558655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4776 -1.2816500384360552e-03</internalNodes>
+          <leafValues>
+            -8.8744208216667175e-02 6.7286081612110138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4777 -1.2601809576153755e-02</internalNodes>
+          <leafValues>
+            2.3047180473804474e-01 -1.4204639941453934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4778 3.1882619950920343e-03</internalNodes>
+          <leafValues>
+            -6.0790609568357468e-02 9.3256607651710510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4779 -4.4821877963840961e-03</internalNodes>
+          <leafValues>
+            -7.4911139905452728e-02 3.5563640296459198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4780 1.3803370529785752e-03</internalNodes>
+          <leafValues>
+            -6.5355330705642700e-02 8.9660577476024628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4781 9.3855522572994232e-03</internalNodes>
+          <leafValues>
+            2.2601179778575897e-02 -1.6038919985294342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4782 -3.3057469408959150e-03</internalNodes>
+          <leafValues>
+            -9.3390651047229767e-02 5.6599788367748260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4783 -1.4823249541223049e-02</internalNodes>
+          <leafValues>
+            6.3946582376956940e-02 -3.7617258727550507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4784 -2.4304309859871864e-02</internalNodes>
+          <leafValues>
+            1.1825300008058548e-01 -5.3607080131769180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4785 -2.6398031041026115e-03</internalNodes>
+          <leafValues>
+            -7.8462429344654083e-02 4.7125939279794693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4786 -6.6844499669969082e-03</internalNodes>
+          <leafValues>
+            -1.4298090338706970e-01 5.4876580834388733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4787 -1.8713249592110515e-03</internalNodes>
+          <leafValues>
+            6.5964557230472565e-02 -5.9726029634475708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4788 -5.0526339560747147e-02</internalNodes>
+          <leafValues>
+            5.2933692932128906e-01 -1.0625099763274193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4789 -7.1036286652088165e-02</internalNodes>
+          <leafValues>
+            -3.3027708530426025e-01 5.6759058497846127e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4790 -5.4212540388107300e-02</internalNodes>
+          <leafValues>
+            3.7536340951919556e-01 -1.6479549929499626e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4791 1.4903850387781858e-04</internalNodes>
+          <leafValues>
+            -5.2896250039339066e-02 1.0646480321884155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4792 1.0254220105707645e-03</internalNodes>
+          <leafValues>
+            -5.1714900881052017e-02 1.0771189630031586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4793 7.6022921130061150e-03</internalNodes>
+          <leafValues>
+            2.4376839399337769e-02 -1.2493179738521576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4794 6.8572920281440020e-04</internalNodes>
+          <leafValues>
+            7.1341581642627716e-02 -7.6490812003612518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4795 -1.3697240501642227e-03</internalNodes>
+          <leafValues>
+            -1.5173940360546112e-01 3.9827719330787659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4796 -2.4336120113730431e-03</internalNodes>
+          <leafValues>
+            6.5315209329128265e-02 -7.9230897128582001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4797 -1.4390869997441769e-02</internalNodes>
+          <leafValues>
+            -2.3706260323524475e-01 1.6740530729293823e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4798 7.8907981514930725e-02</internalNodes>
+          <leafValues>
+            -4.2810469865798950e-02 1.4248989522457123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4799 1.0681129992008209e-01</internalNodes>
+          <leafValues>
+            3.4115819726139307e-03 -7.7656471729278564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4800 5.1377359777688980e-02</internalNodes>
+          <leafValues>
+            1.0703410021960735e-02 -5.3400570154190063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4801 -8.6883217096328735e-02</internalNodes>
+          <leafValues>
+            1. -3.0740019865334034e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4802 -2.4080339353531599e-03</internalNodes>
+          <leafValues>
+            -1.0685530304908752e-01 4.9721568822860718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4803 -1.5590289607644081e-02</internalNodes>
+          <leafValues>
+            1.0636159777641296e-01 -2.4414319545030594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4804 2.3770150728523731e-03</internalNodes>
+          <leafValues>
+            3.9840381592512131e-02 -1.4689840376377106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4805 -9.0648621320724487e-02</internalNodes>
+          <leafValues>
+            1.8861660361289978e-01 -1.2951680459082127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4806 4.4955732300877571e-03</internalNodes>
+          <leafValues>
+            -2.6563400402665138e-02 2.3943750560283661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4807 -6.4725756645202637e-02</internalNodes>
+          <leafValues>
+            -5.4622077941894531e-01 9.2595359310507774e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4808 2.1703580394387245e-02</internalNodes>
+          <leafValues>
+            -8.8741881772875786e-03 6.4019817113876343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4809 6.1110239475965500e-02</internalNodes>
+          <leafValues>
+            9.5075201243162155e-03 -4.3702909350395203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4810 2.0086880773305893e-02</internalNodes>
+          <leafValues>
+            2.2985199466347694e-02 -2.2840890288352966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4811 4.1216641664505005e-02</internalNodes>
+          <leafValues>
+            -1.4420590363442898e-02 1.3452969491481781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4812 -2.3712279275059700e-02</internalNodes>
+          <leafValues>
+            -2.9533639550209045e-01 1.8435720354318619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4813 -6.8324371241033077e-03</internalNodes>
+          <leafValues>
+            1.2094250321388245e-01 -4.3016240000724792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4814 1.0880210250616074e-01</internalNodes>
+          <leafValues>
+            -1.0228149592876434e-02 5.2824842929840088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4815 9.8231732845306396e-03</internalNodes>
+          <leafValues>
+            4.1886411607265472e-02 -1.3665479421615601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4816 -1.5005770139396191e-02</internalNodes>
+          <leafValues>
+            1.8148930370807648e-01 -3.0691139400005341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4817 -4.4110611081123352e-01</internalNodes>
+          <leafValues>
+            -1. 1.4937899541109800e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4818 -3.4122800827026367e-01</internalNodes>
+          <leafValues>
+            -4.9184858798980713e-01 1.0096929967403412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4819 9.3225948512554169e-03</internalNodes>
+          <leafValues>
+            -2.2894829511642456e-02 7.0796586573123932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4820 7.3594371788203716e-03</internalNodes>
+          <leafValues>
+            1.3842869549989700e-02 -3.6142700910568237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4821 -8.4109082818031311e-02</internalNodes>
+          <leafValues>
+            -6.2284982204437256e-01 7.3129259981215000e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4822 1.0704870335757732e-02</internalNodes>
+          <leafValues>
+            -4.2617131024599075e-02 1.1360719799995422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4823 1.1478140018880367e-02</internalNodes>
+          <leafValues>
+            3.6586448550224304e-02 -9.6474952995777130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4824 1.6416399739682674e-03</internalNodes>
+          <leafValues>
+            -9.8777309060096741e-02 5.5158369243144989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4825 -1.5731199528090656e-04</internalNodes>
+          <leafValues>
+            -6.1207920312881470e-02 5.6053601205348969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4826 4.1953278705477715e-03</internalNodes>
+          <leafValues>
+            5.0657391548156738e-02 -1.0238680243492126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4827 -1.6238249838352203e-02</internalNodes>
+          <leafValues>
+            1.1267519742250443e-01 -1.3786830008029938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4828 3.2428819686174393e-02</internalNodes>
+          <leafValues>
+            -2.5513019412755966e-02 2.3171940445899963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4829 -8.3901472389698029e-03</internalNodes>
+          <leafValues>
+            -6.2842369079589844e-02 2.3776959627866745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4830 4.9057020805776119e-03</internalNodes>
+          <leafValues>
+            5.7676758617162704e-02 -1.2715479731559753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4831 1.4458860270678997e-02</internalNodes>
+          <leafValues>
+            -5.0932768732309341e-02 6.2239319086074829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4832 1.2484519928693771e-01</internalNodes>
+          <leafValues>
+            -1.1612229980528355e-02 4.9361020326614380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4833 4.8587709665298462e-01</internalNodes>
+          <leafValues>
+            4.8130601644515991e-03 -5.5395811796188354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4834 1.6886210441589355e-01</internalNodes>
+          <leafValues>
+            7.8053288161754608e-03 -7.3394978046417236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4835 -2.1220340568106622e-04</internalNodes>
+          <leafValues>
+            3.1656648963689804e-02 -1.0314700007438660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4836 1.9249629694968462e-03</internalNodes>
+          <leafValues>
+            5.5135779082775116e-02 -1.0309369862079620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4837 -2.8178339824080467e-02</internalNodes>
+          <leafValues>
+            1.1637330055236816e-01 -3.4630060195922852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4838 -1.4069500379264355e-02</internalNodes>
+          <leafValues>
+            -1.4737719297409058e-01 4.4723790138959885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4839 -1.2483589816838503e-03</internalNodes>
+          <leafValues>
+            -1.1185120046138763e-01 6.8806178867816925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4840 5.3278112318366766e-04</internalNodes>
+          <leafValues>
+            -9.3908883631229401e-02 6.7072838544845581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4841 1.1722769588232040e-02</internalNodes>
+          <leafValues>
+            -1.9012469798326492e-02 1.8834389746189117e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>249</maxWeakCount>
+      <stageThreshold>-1.4526200294494629e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 4842 5.8254651725292206e-02</internalNodes>
+          <leafValues>
+            -2.3232789337635040e-01 2.1454159915447235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4843 3.4433450549840927e-02</internalNodes>
+          <leafValues>
+            -2.6520681381225586e-01 1.3274359703063965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4844 1.4937009662389755e-02</internalNodes>
+          <leafValues>
+            -2.3927900195121765e-01 1.5786519646644592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4845 3.1153639778494835e-02</internalNodes>
+          <leafValues>
+            -1.5004000067710876e-01 1.6116039454936981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4846 2.6988480240106583e-03</internalNodes>
+          <leafValues>
+            -2.3409889638423920e-01 9.9983781576156616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4847 9.2046073405072093e-05</internalNodes>
+          <leafValues>
+            -2.9268169403076172e-01 4.7872740775346756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4848 5.0020251364912838e-05</internalNodes>
+          <leafValues>
+            -3.6815708875656128e-01 5.8189608156681061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4849 -1.4902159571647644e-02</internalNodes>
+          <leafValues>
+            -3.8818851113319397e-01 2.6158519089221954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4850 2.0448720082640648e-02</internalNodes>
+          <leafValues>
+            6.0846891254186630e-02 -3.0645281076431274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4851 6.2656581576447934e-05</internalNodes>
+          <leafValues>
+            -1.7161040008068085e-01 1.0800299793481827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4852 -7.0627559907734394e-03</internalNodes>
+          <leafValues>
+            -2.3428949713706970e-01 7.6327130198478699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4853 -2.9078179504722357e-03</internalNodes>
+          <leafValues>
+            -2.1010600030422211e-01 7.8605473041534424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4854 -3.6554310470819473e-02</internalNodes>
+          <leafValues>
+            1.7013889551162720e-01 -1.2837870419025421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4855 -1.3991629704833031e-02</internalNodes>
+          <leafValues>
+            -1.5198560059070587e-01 3.1168300658464432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4856 7.4681073427200317e-02</internalNodes>
+          <leafValues>
+            3.6079999059438705e-02 -4.6322378516197205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4857 -1.0407929867506027e-01</internalNodes>
+          <leafValues>
+            -3.1802299618721008e-01 2.0612560212612152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4858 1.2444700114428997e-02</internalNodes>
+          <leafValues>
+            7.7818617224693298e-02 -1.6825589537620544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4859 3.4679330885410309e-02</internalNodes>
+          <leafValues>
+            3.2584380358457565e-02 -2.6884159445762634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4860 -2.9028469696640968e-02</internalNodes>
+          <leafValues>
+            -4.4522678852081299e-01 2.9661040753126144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4861 2.3345749650616199e-04</internalNodes>
+          <leafValues>
+            -1.3071049749851227e-01 6.1756659299135208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4862 3.6993178725242615e-01</internalNodes>
+          <leafValues>
+            1.7400909215211868e-02 -7.0418548583984375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4863 -2.1505730226635933e-02</internalNodes>
+          <leafValues>
+            -2.4095299839973450e-01 2.8891649097204208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4864 5.4181810468435287e-02</internalNodes>
+          <leafValues>
+            -8.4053620696067810e-02 1.3876989483833313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4865 -3.2677378505468369e-02</internalNodes>
+          <leafValues>
+            -2.9904881119728088e-01 2.8195250779390335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4866 1.1804300360381603e-02</internalNodes>
+          <leafValues>
+            4.9124121665954590e-02 -2.5538289546966553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4867 -9.5703108236193657e-03</internalNodes>
+          <leafValues>
+            1.1865220218896866e-01 -7.9305157065391541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4868 -8.5534068057313561e-04</internalNodes>
+          <leafValues>
+            -9.0315766632556915e-02 1.2984269857406616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4869 7.1445330977439880e-02</internalNodes>
+          <leafValues>
+            1.4396210201084614e-02 -5.3161299228668213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4870 6.1263251118361950e-03</internalNodes>
+          <leafValues>
+            -2.4559390544891357e-01 4.8353280872106552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4871 -4.8277149908244610e-03</internalNodes>
+          <leafValues>
+            -2.3828850686550140e-01 7.5664043426513672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4872 -2.6015359908342361e-03</internalNodes>
+          <leafValues>
+            4.5826680958271027e-02 -2.4928370118141174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4873 -4.7515620826743543e-04</internalNodes>
+          <leafValues>
+            3.8604840636253357e-02 -1.3118830323219299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4874 -5.4591469466686249e-02</internalNodes>
+          <leafValues>
+            5.5260437726974487e-01 -1.9622489809989929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4875 5.3931411355733871e-02</internalNodes>
+          <leafValues>
+            -4.8285599797964096e-02 2.2110609710216522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4876 -9.1672148555517197e-03</internalNodes>
+          <leafValues>
+            -2.5744551420211792e-01 4.0833171457052231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4877 -2.9818129260092974e-03</internalNodes>
+          <leafValues>
+            -7.5891457498073578e-02 6.0899209231138229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4878 7.4697382748126984e-02</internalNodes>
+          <leafValues>
+            3.6657888442277908e-02 -2.6946181058883667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4879 -2.7006270363926888e-02</internalNodes>
+          <leafValues>
+            1.8391659855842590e-01 -5.5832479149103165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4880 -6.0810879804193974e-03</internalNodes>
+          <leafValues>
+            -3.2777228951454163e-01 3.5269659012556076e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4881 3.8182068616151810e-02</internalNodes>
+          <leafValues>
+            -5.6075371801853180e-02 2.1839509904384613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4882 9.5723047852516174e-03</internalNodes>
+          <leafValues>
+            8.4293976426124573e-02 -1.1767770349979401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4883 7.8028216958045959e-02</internalNodes>
+          <leafValues>
+            5.6959469802677631e-03 -8.1442731618881226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4884 -3.2862029969692230e-02</internalNodes>
+          <leafValues>
+            -4.7212830185890198e-01 1.9418969750404358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4885 4.2359679937362671e-02</internalNodes>
+          <leafValues>
+            -1.7929280176758766e-02 3.1368249654769897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4886 -2.1030420437455177e-02</internalNodes>
+          <leafValues>
+            1.4199249446392059e-01 -6.7171506583690643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4887 -4.6487968415021896e-02</internalNodes>
+          <leafValues>
+            -3.0455109477043152e-01 3.1824499368667603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4888 -8.5280627012252808e-02</internalNodes>
+          <leafValues>
+            2.4725529551506042e-01 -4.0726520121097565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4889 4.7598700039088726e-03</internalNodes>
+          <leafValues>
+            -6.4076490700244904e-02 1.0103560239076614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4890 6.0733199119567871e-02</internalNodes>
+          <leafValues>
+            -8.8772647082805634e-02 1.1654719710350037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4891 5.4770488291978836e-02</internalNodes>
+          <leafValues>
+            2.2390449419617653e-02 -4.9855118989944458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4892 -3.7478970625670627e-05</internalNodes>
+          <leafValues>
+            6.2433928251266479e-02 -1.6515359282493591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4893 -2.3898750543594360e-02</internalNodes>
+          <leafValues>
+            -1.9021050631999969e-01 1.4979549683630466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4894 -1.8465859815478325e-02</internalNodes>
+          <leafValues>
+            2.3008669912815094e-01 -4.5363288372755051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4895 -3.8619639817625284e-03</internalNodes>
+          <leafValues>
+            -1.1168369650840759e-01 7.9550966620445251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4896 6.0682989656925201e-02</internalNodes>
+          <leafValues>
+            2.5401040911674500e-02 -4.1787821054458618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4897 -6.1235381290316582e-03</internalNodes>
+          <leafValues>
+            -2.4201570451259613e-01 1.9984690472483635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4898 -2.7558460831642151e-02</internalNodes>
+          <leafValues>
+            -4.5678210258483887e-01 2.0328069105744362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4899 2.4938629940152168e-02</internalNodes>
+          <leafValues>
+            -3.8399018347263336e-02 1.3205289840698242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4900 -4.7081429511308670e-02</internalNodes>
+          <leafValues>
+            3.1839731335639954e-01 -3.2127480953931808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4901 6.2321990728378296e-02</internalNodes>
+          <leafValues>
+            1.7846960574388504e-02 -5.0114768743515015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4902 -5.5789871839806437e-04</internalNodes>
+          <leafValues>
+            1.0673029720783234e-01 -9.0454310178756714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4903 -2.0528730005025864e-02</internalNodes>
+          <leafValues>
+            2.2777000069618225e-01 -4.6683758497238159e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4904 1.4043749542906880e-03</internalNodes>
+          <leafValues>
+            -2.0688509941101074e-01 6.7320853471755981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4905 3.1474549323320389e-02</internalNodes>
+          <leafValues>
+            2.5873050093650818e-02 -3.1385809183120728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4906 -3.1364340335130692e-02</internalNodes>
+          <leafValues>
+            -3.5079669952392578e-01 2.4890480563044548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4907 -1.0076019912958145e-01</internalNodes>
+          <leafValues>
+            -2.2738389670848846e-01 1.0731879621744156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4908 1.4409960247576237e-02</internalNodes>
+          <leafValues>
+            2.4001860618591309e-01 -3.8389049470424652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4909 5.6410171091556549e-02</internalNodes>
+          <leafValues>
+            -4.0667269378900528e-02 1.9880810379981995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4910 -1.4310100115835667e-02</internalNodes>
+          <leafValues>
+            -2.2484239935874939e-01 5.1415968686342239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4911 3.8093481212854385e-02</internalNodes>
+          <leafValues>
+            1.0602000169456005e-02 -6.5031349658966064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4912 7.3483381420373917e-03</internalNodes>
+          <leafValues>
+            3.7624299526214600e-02 -2.3660179972648621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4913 1.5990389883518219e-01</internalNodes>
+          <leafValues>
+            -3.1958691775798798e-02 7.8257188200950623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4914 7.5298376381397247e-02</internalNodes>
+          <leafValues>
+            -2.2225739434361458e-02 4.7734829783439636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4915 1.0515630245208740e-02</internalNodes>
+          <leafValues>
+            2.4979539215564728e-02 -4.3517309427261353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4916 1.1720249801874161e-01</internalNodes>
+          <leafValues>
+            -3.7235978990793228e-02 2.6529499888420105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4917 1.5799700122443028e-05</internalNodes>
+          <leafValues>
+            -1.0837449878454208e-01 7.2809703648090363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4918 1.2115119956433773e-02</internalNodes>
+          <leafValues>
+            6.5032199025154114e-02 -1.4378160238265991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4919 -1.7766270786523819e-02</internalNodes>
+          <leafValues>
+            1.0095430165529251e-01 -2.4499140679836273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4920 4.2227920144796371e-02</internalNodes>
+          <leafValues>
+            -3.6625079810619354e-02 2.8341490030288696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4921 2.4346679449081421e-02</internalNodes>
+          <leafValues>
+            2.4560010060667992e-02 -1.9787840545177460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4922 3.1748838722705841e-02</internalNodes>
+          <leafValues>
+            2.9603859409689903e-02 -3.0412709712982178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4923 -5.2616238594055176e-02</internalNodes>
+          <leafValues>
+            1.7751359939575195e-01 -3.1825721263885498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4924 -5.4358910769224167e-02</internalNodes>
+          <leafValues>
+            2.2886650264263153e-01 -4.0221411734819412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4925 1.1845750268548727e-03</internalNodes>
+          <leafValues>
+            6.1528120189905167e-02 -1.2204740196466446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4926 -3.6325298249721527e-02</internalNodes>
+          <leafValues>
+            -2.9528170824050903e-01 3.3452831208705902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4927 1.5100809931755066e-01</internalNodes>
+          <leafValues>
+            -2.5661900639533997e-02 3.8788089156150818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4928 2.8278939425945282e-02</internalNodes>
+          <leafValues>
+            -3.5951491445302963e-02 2.5251358747482300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4929 -8.3803251385688782e-02</internalNodes>
+          <leafValues>
+            -7.2599482536315918e-01 4.1993269696831703e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4930 -2.9865629039704800e-04</internalNodes>
+          <leafValues>
+            5.5302988737821579e-02 -1.6678869724273682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4931 -1.6872739419341087e-02</internalNodes>
+          <leafValues>
+            -1.9040539860725403e-01 5.2307758480310440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4932 -5.9451311826705933e-02</internalNodes>
+          <leafValues>
+            -4.7634351253509521e-01 2.0981209352612495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4933 -1.8378829583525658e-02</internalNodes>
+          <leafValues>
+            6.6858462989330292e-02 -6.0389090329408646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4934 4.8198848962783813e-02</internalNodes>
+          <leafValues>
+            4.2580351233482361e-02 -2.6010730862617493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4935 -4.3217130005359650e-02</internalNodes>
+          <leafValues>
+            -2.5067010521888733e-01 1.7225300893187523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4936 -6.3647949136793613e-03</internalNodes>
+          <leafValues>
+            -1.6788710653781891e-01 6.8857319653034210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4937 2.4770569801330566e-01</internalNodes>
+          <leafValues>
+            -3.3154450356960297e-02 1.4794079959392548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4938 -1.1216869950294495e-01</internalNodes>
+          <leafValues>
+            5.1129728555679321e-01 -1.7360100522637367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4939 3.6601010710000992e-02</internalNodes>
+          <leafValues>
+            -4.3869979679584503e-02 1.9755239784717560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4940 -7.2332553565502167e-02</internalNodes>
+          <leafValues>
+            -8.2932412624359131e-01 1.1810120195150375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4941 7.7837951481342316e-02</internalNodes>
+          <leafValues>
+            2.4520579725503922e-02 -2.7260521054267883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4942 7.2094596922397614e-02</internalNodes>
+          <leafValues>
+            3.7606250494718552e-02 -2.7291780710220337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4943 -8.7373353540897369e-02</internalNodes>
+          <leafValues>
+            -9.5344787836074829e-01 3.2734218984842300e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4944 -3.6240059882402420e-02</internalNodes>
+          <leafValues>
+            -3.2300001382827759e-01 2.6389310136437416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4945 -8.7862694635987282e-03</internalNodes>
+          <leafValues>
+            -1.4808210730552673e-01 4.6761561185121536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4946 6.5432381816208363e-03</internalNodes>
+          <leafValues>
+            6.0071479529142380e-02 -1.5036399662494659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4947 2.7910009957849979e-03</internalNodes>
+          <leafValues>
+            -7.9585656523704529e-02 6.4064942300319672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4948 2.9471930116415024e-02</internalNodes>
+          <leafValues>
+            3.6904528737068176e-02 -2.7659609913825989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4949 -4.4924151152372360e-02</internalNodes>
+          <leafValues>
+            3.5313630104064941e-01 -2.7219140902161598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4950 7.8969523310661316e-02</internalNodes>
+          <leafValues>
+            1.0873800143599510e-02 -9.3217527866363525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4951 -3.1053030863404274e-02</internalNodes>
+          <leafValues>
+            2.4087889492511749e-01 -2.7155969291925430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4952 5.0429090857505798e-02</internalNodes>
+          <leafValues>
+            -5.4164800792932510e-02 2.0343920588493347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4953 -3.7637658417224884e-02</internalNodes>
+          <leafValues>
+            3.2998979091644287e-01 -3.4573089331388474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4954 -1.7269999952986836e-03</internalNodes>
+          <leafValues>
+            -1.2339779734611511e-01 7.5958393514156342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4955 1.2604339979588985e-02</internalNodes>
+          <leafValues>
+            3.6150000989437103e-02 -2.1591770648956299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4956 1.1010640300810337e-02</internalNodes>
+          <leafValues>
+            -1.4330290257930756e-01 6.3043266534805298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4957 1.3539699837565422e-02</internalNodes>
+          <leafValues>
+            -7.8418523073196411e-02 1.8389409780502319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4958 -3.8949768990278244e-02</internalNodes>
+          <leafValues>
+            3.4183630347251892e-01 -2.9505429789423943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4959 -4.9093078821897507e-02</internalNodes>
+          <leafValues>
+            -3.6278200149536133e-01 1.7093619331717491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4960 4.2306110262870789e-03</internalNodes>
+          <leafValues>
+            5.8190550655126572e-02 -1.8383790552616119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4961 8.9376904070377350e-03</internalNodes>
+          <leafValues>
+            -5.1576498895883560e-02 1.9376990199089050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4962 4.0846280753612518e-02</internalNodes>
+          <leafValues>
+            1.3241729699075222e-02 -7.0892220735549927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4963 -3.6945961415767670e-02</internalNodes>
+          <leafValues>
+            -3.4456318616867065e-01 7.1702878922224045e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4964 -1.2924180366098881e-02</internalNodes>
+          <leafValues>
+            -1.9354179501533508e-01 4.8157788813114166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4965 3.3079650253057480e-02</internalNodes>
+          <leafValues>
+            -5.1704820245504379e-02 1.3492329418659210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4966 2.2233519703149796e-02</internalNodes>
+          <leafValues>
+            5.2919991314411163e-02 -1.7628639936447144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4967 -1.4483500272035599e-02</internalNodes>
+          <leafValues>
+            1.5105240046977997e-01 -3.9817798882722855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4968 1.5934909880161285e-01</internalNodes>
+          <leafValues>
+            -3.3422928303480148e-02 2.8085818886756897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4969 1.2470430135726929e-01</internalNodes>
+          <leafValues>
+            1.1225829832255840e-02 -4.5520108938217163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4970 7.0243299007415771e-02</internalNodes>
+          <leafValues>
+            2.6213169097900391e-02 -3.4778589010238647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4971 6.1747688055038452e-01</internalNodes>
+          <leafValues>
+            9.0320473536849022e-03 -5.5216097831726074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4972 7.7007927000522614e-02</internalNodes>
+          <leafValues>
+            9.3850009143352509e-03 -6.9495117664337158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4973 4.2874120175838470e-02</internalNodes>
+          <leafValues>
+            -3.3166319131851196e-02 1.3550239801406860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4974 -2.4558259174227715e-02</internalNodes>
+          <leafValues>
+            3.8989260792732239e-01 -2.0506320521235466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4975 1.0723150335252285e-02</internalNodes>
+          <leafValues>
+            -5.1526758819818497e-02 8.9461207389831543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4976 3.8331970572471619e-02</internalNodes>
+          <leafValues>
+            -3.9952859282493591e-02 1.8591549992561340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4977 1.2556019425392151e-01</internalNodes>
+          <leafValues>
+            5.1561538130044937e-03 -8.4782391786575317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4978 1.1590070277452469e-01</internalNodes>
+          <leafValues>
+            9.7828712314367294e-03 -7.6437431573867798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4979 -1.5016060322523117e-02</internalNodes>
+          <leafValues>
+            -1.8328569829463959e-01 3.2125338912010193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4980 -4.1521931998431683e-03</internalNodes>
+          <leafValues>
+            9.8160982131958008e-02 -8.2769006490707397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4981 1.4998050173744559e-03</internalNodes>
+          <leafValues>
+            4.1228689253330231e-02 -8.4460526704788208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4982 3.8117531687021255e-02</internalNodes>
+          <leafValues>
+            1.9691960886120796e-02 -3.9931151270866394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4983 9.4391452148556709e-04</internalNodes>
+          <leafValues>
+            -1.9674700498580933e-01 5.6476209312677383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4984 2.4907960323616862e-04</internalNodes>
+          <leafValues>
+            9.2797473073005676e-02 -1.0708689689636230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4985 2.5447670370340347e-02</internalNodes>
+          <leafValues>
+            -2.5304390117526054e-02 1.0032439976930618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4986 -2.8884090483188629e-02</internalNodes>
+          <leafValues>
+            -1.7259830236434937e-01 4.9671061336994171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4987 1.2102840095758438e-01</internalNodes>
+          <leafValues>
+            -5.5194748565554619e-03 9.5438259840011597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4988 -7.9245921224355698e-03</internalNodes>
+          <leafValues>
+            6.4903482794761658e-02 -1.2671549618244171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4989 -6.5536066889762878e-02</internalNodes>
+          <leafValues>
+            -3.7892189621925354e-01 1.6463089734315872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4990 -1.6883460804820061e-02</internalNodes>
+          <leafValues>
+            5.8534818887710571e-01 -1.4671769924461842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4991 6.7252418957650661e-03</internalNodes>
+          <leafValues>
+            2.7604229748249054e-02 -3.4817421436309814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4992 -6.3783898949623108e-02</internalNodes>
+          <leafValues>
+            -3.9567160606384277e-01 1.9867889583110809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4993 1.8600550293922424e-01</internalNodes>
+          <leafValues>
+            -4.5898579061031342e-02 7.3586076498031616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4994 4.9724031239748001e-02</internalNodes>
+          <leafValues>
+            -2.0517630502581596e-02 4.3107840418815613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4995 1.5011380426585674e-02</internalNodes>
+          <leafValues>
+            4.0192149579524994e-02 -1.0242489725351334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4996 -1.5085030347108841e-02</internalNodes>
+          <leafValues>
+            2.3888920247554779e-01 -3.5642918199300766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4997 -1.2931490316987038e-02</internalNodes>
+          <leafValues>
+            -3.6863088607788086e-01 1.7377890646457672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4998 -1.3186899945139885e-02</internalNodes>
+          <leafValues>
+            -4.3170270323753357e-01 1.7947910353541374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4999 -6.6814959049224854e-02</internalNodes>
+          <leafValues>
+            4.1336119174957275e-01 -2.0904310047626495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5000 4.4064331799745560e-02</internalNodes>
+          <leafValues>
+            -3.8615190982818604e-01 2.1414510905742645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5001 4.1341730952262878e-01</internalNodes>
+          <leafValues>
+            1.0130990296602249e-02 -4.7053098678588867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5002 2.4443659931421280e-02</internalNodes>
+          <leafValues>
+            9.3184120953083038e-02 -8.6774162948131561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5003 1.5779680013656616e-01</internalNodes>
+          <leafValues>
+            4.8137311823666096e-03 -5.8746212720870972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5004 -2.0141510292887688e-02</internalNodes>
+          <leafValues>
+            2.2643919289112091e-01 -4.6824630349874496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5005 3.8796770386397839e-03</internalNodes>
+          <leafValues>
+            -7.7155217528343201e-02 3.6106169223785400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5006 1.5064960345625877e-02</internalNodes>
+          <leafValues>
+            -5.6656859815120697e-02 1.4758649468421936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5007 1.2925310060381889e-02</internalNodes>
+          <leafValues>
+            3.5308018326759338e-02 -1.1645320057868958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5008 -1.4788310043513775e-02</internalNodes>
+          <leafValues>
+            -1.1459939926862717e-01 7.5000070035457611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5009 -2.0497168879956007e-03</internalNodes>
+          <leafValues>
+            4.2067401111125946e-02 -7.0409573614597321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5010 8.9428946375846863e-03</internalNodes>
+          <leafValues>
+            5.3989838808774948e-02 -1.5380840003490448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5011 1.0064999759197235e-01</internalNodes>
+          <leafValues>
+            -2.9709249734878540e-02 3.1293758749961853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5012 -4.6580079942941666e-02</internalNodes>
+          <leafValues>
+            -7.2227877378463745e-01 1.3004340231418610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5013 -3.8618590682744980e-02</internalNodes>
+          <leafValues>
+            3.3867758512496948e-01 -2.1726610139012337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5014 8.5657741874456406e-03</internalNodes>
+          <leafValues>
+            7.0621289312839508e-02 -1.3055880367755890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5015 -1.0986299812793732e-01</internalNodes>
+          <leafValues>
+            3.7974509596824646e-01 -5.1755867898464203e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5016 3.0184251070022583e-01</internalNodes>
+          <leafValues>
+            -2.4274839088320732e-02 3.6632651090621948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5017 -5.3246088325977325e-02</internalNodes>
+          <leafValues>
+            -5.5290502309799194e-01 6.2071220017969608e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5018 3.6629870533943176e-02</internalNodes>
+          <leafValues>
+            2.3161249235272408e-02 -3.5514861345291138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5019 6.9993197917938232e-02</internalNodes>
+          <leafValues>
+            8.9623704552650452e-03 -8.2245421409606934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5020 -8.7623577564954758e-03</internalNodes>
+          <leafValues>
+            -2.8028720617294312e-01 2.6217460632324219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5021 1.5275989659130573e-02</internalNodes>
+          <leafValues>
+            -5.0123069435358047e-02 1.5774080157279968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5022 1.8836189806461334e-01</internalNodes>
+          <leafValues>
+            1.1483459733426571e-02 -7.4004447460174561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5023 -1.4518629759550095e-02</internalNodes>
+          <leafValues>
+            8.2921922206878662e-02 -5.2536141127347946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5024 1.9221989437937737e-02</internalNodes>
+          <leafValues>
+            4.0790341794490814e-02 -2.0889760553836823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5025 -3.1274989247322083e-02</internalNodes>
+          <leafValues>
+            8.0864340066909790e-01 -1.0754980146884918e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5026 -4.9813431687653065e-03</internalNodes>
+          <leafValues>
+            -1.9617860019207001e-01 4.1330069303512573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5027 3.7296909838914871e-02</internalNodes>
+          <leafValues>
+            3.0313879251480103e-02 -2.7336311340332031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5028 -1.9014550372958183e-02</internalNodes>
+          <leafValues>
+            1.3439440727233887e-01 -6.0782499611377716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5029 -7.9229613766074181e-03</internalNodes>
+          <leafValues>
+            -7.9689770936965942e-02 4.0497440844774246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5030 9.6371799707412720e-02</internalNodes>
+          <leafValues>
+            -2.5576870888471603e-02 3.2440510392189026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5031 -1.7210310325026512e-02</internalNodes>
+          <leafValues>
+            2.9772299528121948e-01 -3.0994139611721039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5032 1.0736179538071156e-02</internalNodes>
+          <leafValues>
+            -7.0299342274665833e-02 1.2448900192975998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5033 -4.0398869663476944e-02</internalNodes>
+          <leafValues>
+            -6.4470887184143066e-01 6.9025149568915367e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5034 -3.1870428472757339e-02</internalNodes>
+          <leafValues>
+            -5.3339338302612305e-01 1.5221790410578251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5035 3.6518078297376633e-02</internalNodes>
+          <leafValues>
+            -7.7875651419162750e-02 1.4458900690078735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5036 1.2330260127782822e-01</internalNodes>
+          <leafValues>
+            1.7689300701022148e-02 -5.1895797252655029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5037 1.0086199641227722e-01</internalNodes>
+          <leafValues>
+            6.6002830862998962e-03 -5.5289500951766968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5038 1.0026770085096359e-01</internalNodes>
+          <leafValues>
+            1.0175090283155441e-02 -7.1554392576217651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5039 3.6956761032342911e-02</internalNodes>
+          <leafValues>
+            2.2131860256195068e-02 -3.1452280282974243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5040 8.5017476230859756e-03</internalNodes>
+          <leafValues>
+            4.9146678298711777e-02 -1.5193499624729156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5041 5.3833048790693283e-02</internalNodes>
+          <leafValues>
+            2.5698679964989424e-03 -5.0750207901000977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5042 4.8958938568830490e-02</internalNodes>
+          <leafValues>
+            9.2353876680135727e-03 -7.9371142387390137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5043 4.0810879319906235e-02</internalNodes>
+          <leafValues>
+            -4.6270430088043213e-02 1.9726410508155823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5044 -3.3165120985358953e-03</internalNodes>
+          <leafValues>
+            -2.1495009958744049e-01 3.8868401199579239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5045 4.8434760537929833e-04</internalNodes>
+          <leafValues>
+            -1.7870649695396423e-01 5.7129681110382080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5046 7.9494096338748932e-02</internalNodes>
+          <leafValues>
+            -2.2463550791144371e-02 3.6770978569984436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5047 -8.8844364508986473e-03</internalNodes>
+          <leafValues>
+            -3.3796560764312744e-01 2.5869650766253471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5048 -1.0575620457530022e-02</internalNodes>
+          <leafValues>
+            1.2438619881868362e-01 -6.8147383630275726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5049 7.3358109220862389e-03</internalNodes>
+          <leafValues>
+            -4.3375171720981598e-02 1.5483480691909790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5050 4.2306821793317795e-02</internalNodes>
+          <leafValues>
+            1.0016439855098724e-01 -8.8011689484119415e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5051 7.1759216487407684e-02</internalNodes>
+          <leafValues>
+            -8.9269876480102539e-03 2.3254199326038361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5052 -2.2478280588984489e-02</internalNodes>
+          <leafValues>
+            -5.4057407379150391e-01 1.4396119862794876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5053 -2.5606580078601837e-02</internalNodes>
+          <leafValues>
+            -4.3508179485797882e-02 6.4285047352313995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5054 2.5733409449458122e-02</internalNodes>
+          <leafValues>
+            2.3084849119186401e-02 -3.4278741478919983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5055 -7.0163339376449585e-02</internalNodes>
+          <leafValues>
+            4.0744331479072571e-01 -1.1836090125143528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5056 -1.2527329847216606e-02</internalNodes>
+          <leafValues>
+            9.1184526681900024e-02 -8.7035633623600006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5057 5.9983458369970322e-02</internalNodes>
+          <leafValues>
+            3.6528799682855606e-03 -8.0261522531509399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5058 -5.2271911408752203e-04</internalNodes>
+          <leafValues>
+            6.9573827087879181e-02 -1.2091639637947083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5059 -2.0996539294719696e-01</internalNodes>
+          <leafValues>
+            -4.6747279167175293e-01 9.4682360067963600e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5060 -1.8358640372753143e-02</internalNodes>
+          <leafValues>
+            1.4919880032539368e-01 -5.7198900729417801e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5061 -1.3342049904167652e-02</internalNodes>
+          <leafValues>
+            1.4447879791259766e-01 -2.2494640201330185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5062 -3.0613059177994728e-02</internalNodes>
+          <leafValues>
+            -3.3590090274810791e-01 2.4433709681034088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5063 -1.9018750637769699e-02</internalNodes>
+          <leafValues>
+            1.5518119931221008e-01 -2.5613630190491676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5064 -4.5201808214187622e-02</internalNodes>
+          <leafValues>
+            4.8730811476707458e-01 -1.7641659826040268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5065 6.3432596623897552e-02</internalNodes>
+          <leafValues>
+            -5.1946818828582764e-02 1.2361440062522888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5066 3.4017860889434814e-03</internalNodes>
+          <leafValues>
+            -1.7030030488967896e-01 5.4143410176038742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5067 -8.5307076573371887e-02</internalNodes>
+          <leafValues>
+            -7.1878427267074585e-01 1.0392259806394577e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5068 -5.3066499531269073e-02</internalNodes>
+          <leafValues>
+            5.2359157800674438e-01 -1.8369760364294052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5069 -2.8319370001554489e-02</internalNodes>
+          <leafValues>
+            -1.1979889869689941e-01 5.8951549232006073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5070 -8.7353803217411041e-02</internalNodes>
+          <leafValues>
+            2.7089080214500427e-01 -2.9345329850912094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5071 2.7152231335639954e-01</internalNodes>
+          <leafValues>
+            -1.1648589745163918e-02 5.5842977762222290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5072 1.9388480111956596e-02</internalNodes>
+          <leafValues>
+            5.0895590335130692e-02 -1.7962279915809631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5073 2.1159179508686066e-02</internalNodes>
+          <leafValues>
+            -4.8424899578094482e-02 9.5020256936550140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5074 1.2039250135421753e-01</internalNodes>
+          <leafValues>
+            9.2587787657976151e-03 -8.7804621458053589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5075 5.0090719014406204e-02</internalNodes>
+          <leafValues>
+            -2.1926950663328171e-02 2.0202030241489410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5076 -5.5227670818567276e-03</internalNodes>
+          <leafValues>
+            2.1560280025005341e-01 -3.6554779857397079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5077 2.7551440522074699e-02</internalNodes>
+          <leafValues>
+            -3.2782018184661865e-02 1.6503919661045074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5078 -2.5543190538883209e-02</internalNodes>
+          <leafValues>
+            -3.6424461007118225e-01 2.1275209262967110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5079 -2.6791828870773315e-01</internalNodes>
+          <leafValues>
+            4.8525270819664001e-01 -4.7535290941596031e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5080 -1.6798110306262970e-01</internalNodes>
+          <leafValues>
+            3.9280641078948975e-01 -1.9414989277720451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5081 4.5900348573923111e-02</internalNodes>
+          <leafValues>
+            -3.6706160753965378e-02 2.0677609741687775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5082 3.6797890788875520e-04</internalNodes>
+          <leafValues>
+            -8.7039902806282043e-02 9.2830970883369446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5083 -9.9194556474685669e-02</internalNodes>
+          <leafValues>
+            -3.6096671223640442e-01 2.1962769329547882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5084 8.0924080975819379e-05</internalNodes>
+          <leafValues>
+            -7.9007692635059357e-02 9.5904067158699036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5085 7.0894961245357990e-03</internalNodes>
+          <leafValues>
+            3.7076078355312347e-02 -5.0917111337184906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5086 -1.2181960046291351e-03</internalNodes>
+          <leafValues>
+            4.9094028770923615e-02 -1.5975970029830933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5087 -9.2138662934303284e-02</internalNodes>
+          <leafValues>
+            5.5284732580184937e-01 -1.3595860451459885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5088 6.2209279276430607e-03</internalNodes>
+          <leafValues>
+            4.6889189630746841e-02 -1.8105800449848175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5089 6.5014839172363281e-02</internalNodes>
+          <leafValues>
+            9.4407051801681519e-03 -5.1224017143249512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5090 5.4055921733379364e-02</internalNodes>
+          <leafValues>
+            1.6289059072732925e-02 -4.2684501409530640e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>368</maxWeakCount>
+      <stageThreshold>-1.3073990345001221e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 5091 3.7594079971313477e-02</internalNodes>
+          <leafValues>
+            -1.5953080356121063e-01 2.4245350062847137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5092 4.0349629707634449e-03</internalNodes>
+          <leafValues>
+            -2.5617128610610962e-01 8.0420561134815216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5093 2.1681638900190592e-03</internalNodes>
+          <leafValues>
+            -2.8089070320129395e-01 7.0903629064559937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5094 -7.4014628808072302e-06</internalNodes>
+          <leafValues>
+            4.9326181411743164e-02 -1.9688490033149719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5095 -2.2384349722415209e-03</internalNodes>
+          <leafValues>
+            6.8618856370449066e-02 -2.1775339543819427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5096 2.9939650557935238e-03</internalNodes>
+          <leafValues>
+            -2.4257700145244598e-01 2.9716130346059799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5097 4.5135850086808205e-03</internalNodes>
+          <leafValues>
+            8.9443869888782501e-02 -1.9461549818515778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5098 3.8457550108432770e-03</internalNodes>
+          <leafValues>
+            5.0935801118612289e-02 -2.7721929550170898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5099 4.0572669240646064e-04</internalNodes>
+          <leafValues>
+            -8.5517741739749908e-02 1.6446280479431152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5100 -7.0624578256683890e-06</internalNodes>
+          <leafValues>
+            7.8454487025737762e-02 -1.2395980209112167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5101 -2.8428720543161035e-04</internalNodes>
+          <leafValues>
+            1.0774250328540802e-01 -1.2222009897232056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5102 7.3404680006206036e-03</internalNodes>
+          <leafValues>
+            4.7837160527706146e-02 -2.4441170692443848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5103 3.6235509905964136e-03</internalNodes>
+          <leafValues>
+            -3.1533789634704590e-01 3.5066880285739899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5104 -1.5671759610995650e-03</internalNodes>
+          <leafValues>
+            -1.7147080600261688e-01 6.5121836960315704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5105 4.2834067717194557e-03</internalNodes>
+          <leafValues>
+            -1.3190010190010071e-01 9.2709146440029144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5106 -8.9772082865238190e-03</internalNodes>
+          <leafValues>
+            1.2469480186700821e-01 -2.8118500486016273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5107 5.5919871665537357e-03</internalNodes>
+          <leafValues>
+            4.8671621829271317e-02 -2.2460219264030457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5108 1.1782390065491199e-02</internalNodes>
+          <leafValues>
+            3.1041109934449196e-02 -2.9882109165191650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5109 -5.5568912066519260e-03</internalNodes>
+          <leafValues>
+            1.3689100742340088e-01 -7.7152192592620850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5110 1.7162049189209938e-02</internalNodes>
+          <leafValues>
+            -4.0298670530319214e-02 1.1232800036668777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5111 3.5631000064313412e-03</internalNodes>
+          <leafValues>
+            5.6056100875139236e-02 -1.9608840346336365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5112 2.2586699575185776e-02</internalNodes>
+          <leafValues>
+            1.1250300332903862e-02 -5.0490778684616089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5113 2.6307879015803337e-03</internalNodes>
+          <leafValues>
+            4.1528269648551941e-02 -2.2185860574245453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5114 -1.0008380049839616e-03</internalNodes>
+          <leafValues>
+            5.9657059609889984e-02 -1.5395790338516235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5115 -7.1316999383270741e-03</internalNodes>
+          <leafValues>
+            1.0590689629316330e-01 -8.9700952172279358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5116 -6.1685360968112946e-02</internalNodes>
+          <leafValues>
+            1.2677849829196930e-01 -2.2709969431161880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5117 1.3120709918439388e-02</internalNodes>
+          <leafValues>
+            -6.3731230795383453e-02 1.5842080116271973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5118 3.2676599919795990e-02</internalNodes>
+          <leafValues>
+            2.5724250823259354e-02 -3.3406201004981995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5119 1.8886770308017731e-01</internalNodes>
+          <leafValues>
+            -1.7100410535931587e-02 5.3700131177902222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5120 -1.6522880468983203e-04</internalNodes>
+          <leafValues>
+            5.4908581078052521e-02 -1.1608000099658966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5121 -1.4789770357310772e-03</internalNodes>
+          <leafValues>
+            7.7602192759513855e-02 -1.0971190035343170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5122 -1.2441210448741913e-02</internalNodes>
+          <leafValues>
+            -1.4090730249881744e-01 6.8732522428035736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5123 1.9457910209894180e-02</internalNodes>
+          <leafValues>
+            -3.7276178598403931e-02 2.6319879293441772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5124 -2.9123809654265642e-03</internalNodes>
+          <leafValues>
+            -1.8960340321063995e-01 2.9360920190811157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5125 -2.3870699107646942e-02</internalNodes>
+          <leafValues>
+            2.5528749823570251e-01 -3.1279411166906357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5126 -2.6912079192698002e-03</internalNodes>
+          <leafValues>
+            -1.4431649446487427e-01 4.8498779535293579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5127 -1.7636029515415430e-03</internalNodes>
+          <leafValues>
+            -1.3328640162944794e-01 5.4250828921794891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5128 -1.8844179809093475e-02</internalNodes>
+          <leafValues>
+            1.1653099954128265e-01 -3.8028150796890259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5129 3.8752850145101547e-02</internalNodes>
+          <leafValues>
+            -3.6811299622058868e-02 2.1002089977264404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5130 9.4316434115171432e-03</internalNodes>
+          <leafValues>
+            5.7964589446783066e-02 -1.8342800438404083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5131 -1.1705379933118820e-02</internalNodes>
+          <leafValues>
+            1.7905050516128540e-01 -4.9799650907516479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5132 -4.4072889722883701e-03</internalNodes>
+          <leafValues>
+            -1.9810500741004944e-01 4.4608719646930695e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5133 -4.7192219644784927e-03</internalNodes>
+          <leafValues>
+            -1.8307499587535858e-01 4.2252171784639359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5134 -4.5182029716670513e-03</internalNodes>
+          <leafValues>
+            9.5572151243686676e-02 -6.0799460858106613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5135 -5.4851798340678215e-03</internalNodes>
+          <leafValues>
+            -1.7556129395961761e-01 4.0092539042234421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5136 -9.9079031497240067e-04</internalNodes>
+          <leafValues>
+            -1.3978339731693268e-01 4.8252910375595093e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5137 -5.0425329245626926e-03</internalNodes>
+          <leafValues>
+            -8.8625833392143250e-02 7.9794026911258698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5138 -6.3926707953214645e-03</internalNodes>
+          <leafValues>
+            3.5854909569025040e-02 -8.5030712187290192e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5139 -1.1408809572458267e-02</internalNodes>
+          <leafValues>
+            7.7756106853485107e-02 -1.0200379788875580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5140 5.9286449104547501e-02</internalNodes>
+          <leafValues>
+            6.4652841538190842e-03 -4.9082350730895996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5141 -5.7389298453927040e-03</internalNodes>
+          <leafValues>
+            -1.6221189498901367e-01 5.9541791677474976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5142 4.4626160524785519e-03</internalNodes>
+          <leafValues>
+            -2.4659389629960060e-02 2.8509560227394104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5143 -7.4683688580989838e-04</internalNodes>
+          <leafValues>
+            5.5159430950880051e-02 -1.4510269463062286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5144 7.5665451586246490e-03</internalNodes>
+          <leafValues>
+            -3.0510440468788147e-02 9.2685796320438385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5145 8.1203378736972809e-02</internalNodes>
+          <leafValues>
+            8.3315223455429077e-03 -8.8626891374588013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5146 2.5454829446971416e-03</internalNodes>
+          <leafValues>
+            -5.4131258279085159e-02 1.6551689803600311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5147 5.6319180876016617e-02</internalNodes>
+          <leafValues>
+            1.5744749456644058e-02 -4.6605950593948364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5148 -2.7670960873365402e-02</internalNodes>
+          <leafValues>
+            2.7910009026527405e-01 -2.1267570555210114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5149 5.7495549321174622e-02</internalNodes>
+          <leafValues>
+            1.3765430077910423e-02 -5.6881892681121826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5150 1.1847530258819461e-03</internalNodes>
+          <leafValues>
+            6.3452966511249542e-02 -1.6044929623603821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5151 4.2551690712571144e-03</internalNodes>
+          <leafValues>
+            6.3017703592777252e-02 -1.3584609329700470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5152 -2.1190859377384186e-02</internalNodes>
+          <leafValues>
+            1.9623500108718872e-01 -2.8249129652976990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5153 8.3922911435365677e-03</internalNodes>
+          <leafValues>
+            -6.2064249068498611e-02 1.1225070059299469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5154 -3.5534579306840897e-02</internalNodes>
+          <leafValues>
+            1.8565779924392700e-01 -2.1027710288763046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5155 -9.2783384025096893e-03</internalNodes>
+          <leafValues>
+            -1.6255140304565430e-01 5.3493771702051163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5156 -7.4480189941823483e-03</internalNodes>
+          <leafValues>
+            5.6045979261398315e-02 -2.7357129380106926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5157 3.4573610872030258e-02</internalNodes>
+          <leafValues>
+            2.7872329577803612e-02 -2.5443691015243530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5158 1.0644230060279369e-02</internalNodes>
+          <leafValues>
+            -2.5041149929165840e-02 1.2895500659942627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5159 -6.9164121523499489e-03</internalNodes>
+          <leafValues>
+            5.5145461112260818e-02 -1.4286629855632782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5160 4.0446728467941284e-02</internalNodes>
+          <leafValues>
+            4.3409019708633423e-03 -3.0095139145851135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5161 -2.1182280033826828e-02</internalNodes>
+          <leafValues>
+            2.3987750709056854e-01 -3.0267970636487007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5162 -1.8278649076819420e-02</internalNodes>
+          <leafValues>
+            -2.8024369478225708e-01 2.0352259278297424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5163 -6.0500060208141804e-03</internalNodes>
+          <leafValues>
+            -1.5138089656829834e-01 4.5843418687582016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5164 -7.4632540345191956e-03</internalNodes>
+          <leafValues>
+            7.3087826371192932e-02 -3.9645120501518250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5165 -3.1640689820051193e-02</internalNodes>
+          <leafValues>
+            3.8544759154319763e-01 -1.8987689167261124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5166 -4.9488719552755356e-02</internalNodes>
+          <leafValues>
+            -3.7455439567565918e-01 4.6011591330170631e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5167 -2.4384791031479836e-03</internalNodes>
+          <leafValues>
+            -1.0864440351724625e-01 7.0171296596527100e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5168 7.4253929778933525e-03</internalNodes>
+          <leafValues>
+            -4.4223289936780930e-02 7.5678370893001556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5169 -5.3592741489410400e-02</internalNodes>
+          <leafValues>
+            1.9981780648231506e-01 -3.8047380745410919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5170 -2.1555580198764801e-02</internalNodes>
+          <leafValues>
+            -5.2737689018249512e-01 7.7934260480105877e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5171 4.1731819510459900e-03</internalNodes>
+          <leafValues>
+            3.8742069154977798e-02 -1.6946560144424438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5172 4.1882280260324478e-02</internalNodes>
+          <leafValues>
+            -1.1853899806737900e-02 2.9235321283340454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5173 -2.2035069763660431e-02</internalNodes>
+          <leafValues>
+            -1.3629269599914551e-01 4.7323219478130341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5174 1.6916249878704548e-03</internalNodes>
+          <leafValues>
+            -4.9461908638477325e-02 7.4048481881618500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5175 -1.9994638860225677e-03</internalNodes>
+          <leafValues>
+            9.3016393482685089e-02 -7.5230561196804047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5176 -8.7527623400092125e-03</internalNodes>
+          <leafValues>
+            8.4076300263404846e-02 -3.7777189165353775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5177 2.8121439740061760e-02</internalNodes>
+          <leafValues>
+            3.8471631705760956e-02 -1.9039680063724518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5178 2.4713769555091858e-02</internalNodes>
+          <leafValues>
+            -1.1225669644773006e-02 1.3408440351486206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5179 2.1718820556998253e-02</internalNodes>
+          <leafValues>
+            -1.7361419275403023e-02 3.4876769781112671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5180 -4.3202299624681473e-02</internalNodes>
+          <leafValues>
+            -5.1877439022064209e-01 1.2914709746837616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5181 -1.6658119857311249e-03</internalNodes>
+          <leafValues>
+            -3.0727219581604004e-01 1.9104089587926865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5182 -3.2269109040498734e-02</internalNodes>
+          <leafValues>
+            3.1825730204582214e-01 -6.1126789078116417e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5183 -9.6689872443675995e-03</internalNodes>
+          <leafValues>
+            3.3182978630065918e-01 -1.8409479409456253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5184 1.7683519981801510e-03</internalNodes>
+          <leafValues>
+            3.1587228178977966e-02 -1.1481689661741257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5185 3.4618038684129715e-02</internalNodes>
+          <leafValues>
+            -1.8013959750533104e-02 3.4668689966201782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5186 -9.3643896281719208e-02</internalNodes>
+          <leafValues>
+            -5.1143682003021240e-01 1.4282460324466228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5187 4.3095857836306095e-03</internalNodes>
+          <leafValues>
+            2.4471389129757881e-02 -2.3517690598964691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5188 6.6311933100223541e-02</internalNodes>
+          <leafValues>
+            -1.5711139887571335e-02 2.4676759541034698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5189 -9.2896772548556328e-03</internalNodes>
+          <leafValues>
+            -1.3924039900302887e-01 4.8822149634361267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5190 -3.3214599825441837e-03</internalNodes>
+          <leafValues>
+            1.3379609584808350e-01 -3.6818679422140121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5191 4.0180981159210205e-02</internalNodes>
+          <leafValues>
+            -1.2793520465493202e-02 5.2580958604812622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5192 8.7590962648391724e-02</internalNodes>
+          <leafValues>
+            1.2522599659860134e-02 -5.5810731649398804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5193 3.5475298762321472e-02</internalNodes>
+          <leafValues>
+            2.3128280416131020e-02 -2.7402919530868530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5194 5.2033789455890656e-02</internalNodes>
+          <leafValues>
+            -6.1640930362045765e-03 1.9052730500698090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5195 -1.3046549260616302e-01</internalNodes>
+          <leafValues>
+            2.5712540745735168e-01 -2.3529190570116043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5196 2.8882310725748539e-03</internalNodes>
+          <leafValues>
+            -6.0755409300327301e-02 6.0243420302867889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5197 1.5083160251379013e-02</internalNodes>
+          <leafValues>
+            2.1192179992794991e-02 -2.8479540348052979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5198 8.0875161802396178e-04</internalNodes>
+          <leafValues>
+            -8.5497900843620300e-02 5.4305519908666611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5199 1.4947880059480667e-02</internalNodes>
+          <leafValues>
+            -5.7983450591564178e-02 1.0115720331668854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5200 -4.5683588832616806e-02</internalNodes>
+          <leafValues>
+            -3.9345711469650269e-01 1.7556620761752129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5201 -9.4226107466965914e-04</internalNodes>
+          <leafValues>
+            1.3064099848270416e-01 -5.1675319671630859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5202 -2.8342329896986485e-03</internalNodes>
+          <leafValues>
+            1.5992760658264160e-01 -3.4787811338901520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5203 -1.8812920898199081e-02</internalNodes>
+          <leafValues>
+            -2.9807311296463013e-01 2.2536030039191246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5204 1.9601570442318916e-02</internalNodes>
+          <leafValues>
+            1.3461099937558174e-02 -1.6885930299758911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5205 -6.4929589629173279e-02</internalNodes>
+          <leafValues>
+            -7.1198761463165283e-01 8.5184276103973389e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5206 -1.4283999800682068e-02</internalNodes>
+          <leafValues>
+            -7.8602321445941925e-02 4.2226359248161316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5207 2.5105919688940048e-02</internalNodes>
+          <leafValues>
+            -2.9744949191808701e-02 2.2586929798126221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5208 3.8459669798612595e-02</internalNodes>
+          <leafValues>
+            1.7592959105968475e-02 -3.4457311034202576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5209 2.9701360035687685e-03</internalNodes>
+          <leafValues>
+            -5.2914209663867950e-02 1.1567460000514984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5210 -3.5584170836955309e-03</internalNodes>
+          <leafValues>
+            1.2957760691642761e-01 -6.1714299023151398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5211 5.5475500412285328e-03</internalNodes>
+          <leafValues>
+            4.9168299883604050e-02 -1.2925429642200470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5212 7.1379862725734711e-02</internalNodes>
+          <leafValues>
+            -1.1528199538588524e-02 3.2423359155654907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5213 -1.1731989681720734e-01</internalNodes>
+          <leafValues>
+            -9.0184438228607178e-01 6.3025541603565216e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5214 2.2931929677724838e-02</internalNodes>
+          <leafValues>
+            -1.1425419710576534e-02 4.1168990731239319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5215 3.6658400204032660e-03</internalNodes>
+          <leafValues>
+            2.8030570596456528e-02 -2.0567989349365234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5216 -7.0796072483062744e-02</internalNodes>
+          <leafValues>
+            -2.1817129850387573e-01 1.2820649892091751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5217 6.7239440977573395e-03</internalNodes>
+          <leafValues>
+            -4.2305160313844681e-02 1.4150319993495941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5218 -2.0242671016603708e-03</internalNodes>
+          <leafValues>
+            9.1976962983608246e-02 -4.6815071254968643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5219 2.3123170249164104e-03</internalNodes>
+          <leafValues>
+            -7.1074202656745911e-02 9.8617300391197205e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5220 2.7525359764695168e-03</internalNodes>
+          <leafValues>
+            -5.0785668194293976e-02 7.5282126665115356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5221 -3.4460208844393492e-03</internalNodes>
+          <leafValues>
+            9.6368476748466492e-02 -7.8051783144474030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5222 -1.1416469700634480e-02</internalNodes>
+          <leafValues>
+            -1.1313349753618240e-01 7.5080856680870056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5223 3.0283999876701273e-05</internalNodes>
+          <leafValues>
+            -1.3886189460754395e-01 4.3761149048805237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5224 -1.4150349888950586e-03</internalNodes>
+          <leafValues>
+            3.7164621055126190e-02 -1.1095599830150604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5225 -1.9245060393586755e-03</internalNodes>
+          <leafValues>
+            7.0604592561721802e-02 -9.4269059598445892e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5226 3.0031649395823479e-02</internalNodes>
+          <leafValues>
+            -5.1407739520072937e-02 1.6337560117244720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5227 -2.5132829323410988e-03</internalNodes>
+          <leafValues>
+            -1.4933520555496216e-01 5.1749840378761292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5228 1.9437290029600263e-04</internalNodes>
+          <leafValues>
+            -4.8553969711065292e-02 1.0562740266323090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5229 2.9679399449378252e-03</internalNodes>
+          <leafValues>
+            3.6664169281721115e-02 -1.5650020539760590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5230 3.2629880588501692e-03</internalNodes>
+          <leafValues>
+            4.2934000492095947e-02 -1.4514559507369995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5231 2.9959511011838913e-03</internalNodes>
+          <leafValues>
+            -6.3821822404861450e-02 9.3514777719974518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5232 -1.5483190305531025e-02</internalNodes>
+          <leafValues>
+            -2.0184549689292908e-01 3.1191380694508553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5233 -2.3956559598445892e-02</internalNodes>
+          <leafValues>
+            3.6116409301757812e-01 -2.4698240682482719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5234 -1.7136270180344582e-02</internalNodes>
+          <leafValues>
+            -2.6252090930938721e-01 2.4616269394755363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5235 -6.2233610078692436e-03</internalNodes>
+          <leafValues>
+            1.1059129983186722e-01 -5.7947199791669846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5236 2.9878519475460052e-02</internalNodes>
+          <leafValues>
+            7.8794546425342560e-03 -2.8504589200019836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5237 -9.6910241991281509e-03</internalNodes>
+          <leafValues>
+            -1.5696419775485992e-01 3.8263391703367233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5238 -1.2825420498847961e-01</internalNodes>
+          <leafValues>
+            2.8350758552551270e-01 -2.7224350720643997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5239 -3.9670959813520312e-04</internalNodes>
+          <leafValues>
+            -1.3316330313682556e-01 5.3896941244602203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5240 -8.2217011367902160e-04</internalNodes>
+          <leafValues>
+            -1.3680179417133331e-01 7.7957339584827423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5241 7.4795359978452325e-05</internalNodes>
+          <leafValues>
+            -9.0496443212032318e-02 6.8528160452842712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5242 9.3816556036472321e-03</internalNodes>
+          <leafValues>
+            -9.9184580147266388e-02 6.4078651368618011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5243 -6.6485297866165638e-03</internalNodes>
+          <leafValues>
+            1.4783580601215363e-01 -4.6988330781459808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5244 -5.5821631103754044e-03</internalNodes>
+          <leafValues>
+            -1.3562120497226715e-01 5.5308390408754349e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5245 -3.0224759131669998e-02</internalNodes>
+          <leafValues>
+            3.4760668873786926e-01 -1.6698839142918587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5246 -2.7506949380040169e-02</internalNodes>
+          <leafValues>
+            2.8031051158905029e-01 -1.0123490355908871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5247 1.5043930150568485e-02</internalNodes>
+          <leafValues>
+            1.5279079787433147e-02 -3.9506959915161133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5248 9.2139653861522675e-03</internalNodes>
+          <leafValues>
+            2.6678409427404404e-02 -1.4255590736865997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5249 6.3955582678318024e-02</internalNodes>
+          <leafValues>
+            6.2569188885390759e-03 -8.8076668977737427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5250 3.0171850085025653e-05</internalNodes>
+          <leafValues>
+            -1.1047919839620590e-01 5.1936849951744080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5251 -5.1049161702394485e-03</internalNodes>
+          <leafValues>
+            2.1350729465484619e-01 -2.7889270335435867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5252 -9.1436346992850304e-03</internalNodes>
+          <leafValues>
+            -1.9197109341621399e-01 3.0341459438204765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5253 -7.6746046543121338e-02</internalNodes>
+          <leafValues>
+            -7.2468912601470947e-01 7.1879802271723747e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5254 4.8780560493469238e-02</internalNodes>
+          <leafValues>
+            -2.1447779610753059e-02 3.0364468693733215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5255 4.2551410198211670e-01</internalNodes>
+          <leafValues>
+            6.3504311256110668e-03 -9.4783991575241089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5256 2.2590209264308214e-03</internalNodes>
+          <leafValues>
+            1.8893169239163399e-02 -1.9443869590759277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5257 -3.8309961091727018e-03</internalNodes>
+          <leafValues>
+            -1.2813219428062439e-01 4.7748729586601257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5258 7.5495108030736446e-03</internalNodes>
+          <leafValues>
+            -6.7982822656631470e-02 7.6470799744129181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5259 1.4784730039536953e-02</internalNodes>
+          <leafValues>
+            -3.4885041415691376e-02 1.7936830222606659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5260 5.6762639433145523e-02</internalNodes>
+          <leafValues>
+            1.2816789560019970e-02 -4.8105829954147339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5261 -2.5854599662125111e-03</internalNodes>
+          <leafValues>
+            1.2653970718383789e-01 -4.7761850059032440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5262 -5.5542518384754658e-03</internalNodes>
+          <leafValues>
+            7.2126902639865875e-02 -3.8657661527395248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5263 2.6672501116991043e-03</internalNodes>
+          <leafValues>
+            -6.1485260725021362e-02 1.2647840380668640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5264 -2.2879959642887115e-01</internalNodes>
+          <leafValues>
+            -4.8435351252555847e-01 4.5618140138685703e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5265 3.7851329892873764e-02</internalNodes>
+          <leafValues>
+            1.8769560381770134e-02 -3.0806949734687805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5266 2.4275709874927998e-03</internalNodes>
+          <leafValues>
+            -7.1589171886444092e-02 8.1694543361663818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5267 -7.9000797122716904e-03</internalNodes>
+          <leafValues>
+            -1.2589320540428162e-01 4.7421310096979141e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5268 -6.7925411276519299e-03</internalNodes>
+          <leafValues>
+            6.1758730560541153e-02 -5.3803559392690659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5269 -1.7522360384464264e-01</internalNodes>
+          <leafValues>
+            3.3726111054420471e-01 -1.7961960285902023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5270 6.6033959388732910e-02</internalNodes>
+          <leafValues>
+            4.4206557795405388e-03 -5.5819147825241089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5271 5.1699979230761528e-03</internalNodes>
+          <leafValues>
+            5.3349301218986511e-02 -1.2245289981365204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5272 1.2047989666461945e-01</internalNodes>
+          <leafValues>
+            -6.9788158871233463e-03 7.9341912269592285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5273 -4.2617730796337128e-03</internalNodes>
+          <leafValues>
+            7.8014120459556580e-02 -6.8260386586189270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5274 3.0685370787978172e-02</internalNodes>
+          <leafValues>
+            9.3320813030004501e-03 -2.7420249581336975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5275 -6.8651121109724045e-03</internalNodes>
+          <leafValues>
+            -1.3084979355335236e-01 4.7273408621549606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5276 -3.9284229278564453e-03</internalNodes>
+          <leafValues>
+            1.1553719639778137e-01 -5.5044289678335190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5277 -4.2112590745091438e-03</internalNodes>
+          <leafValues>
+            1.3730779290199280e-01 -5.2514389157295227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5278 -7.6999869197607040e-03</internalNodes>
+          <leafValues>
+            -3.4011191129684448e-01 1.7478680238127708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5279 -1.1867909692227840e-02</internalNodes>
+          <leafValues>
+            2.5731179118156433e-01 -2.5691770017147064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5280 5.3619472309947014e-03</internalNodes>
+          <leafValues>
+            1.1936780065298080e-02 -2.8930050134658813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5281 -2.3130229674279690e-03</internalNodes>
+          <leafValues>
+            -1.0821309685707092e-01 5.3640749305486679e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5282 -2.2222870588302612e-01</internalNodes>
+          <leafValues>
+            3.1654310226440430e-01 -1.4542319811880589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5283 6.2593920156359673e-03</internalNodes>
+          <leafValues>
+            3.7795171141624451e-02 -1.5100699663162231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5284 3.4754760563373566e-03</internalNodes>
+          <leafValues>
+            -6.3047468662261963e-02 8.5025683045387268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5285 -2.8249478782527149e-04</internalNodes>
+          <leafValues>
+            -1.1442869901657104e-01 5.6041400879621506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5286 4.8107700422406197e-04</internalNodes>
+          <leafValues>
+            -9.6898466348648071e-02 2.8347050771117210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5287 2.4178959429264069e-02</internalNodes>
+          <leafValues>
+            -2.1033059805631638e-02 2.5629448890686035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5288 2.9526960104703903e-02</internalNodes>
+          <leafValues>
+            1.6122579574584961e-02 -3.4472090005874634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5289 -3.0501780565828085e-03</internalNodes>
+          <leafValues>
+            -1.3633529841899872e-01 4.0983788669109344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5290 1.0082300286740065e-03</internalNodes>
+          <leafValues>
+            -6.0927029699087143e-02 4.0717199444770813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5291 -3.0384280253201723e-03</internalNodes>
+          <leafValues>
+            6.1883278191089630e-02 -9.7887121140956879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5292 3.2816259190440178e-03</internalNodes>
+          <leafValues>
+            -4.7950621694326401e-02 6.2675401568412781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5293 1.3182610273361206e-02</internalNodes>
+          <leafValues>
+            2.2476239502429962e-01 -2.5649169459939003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5294 -2.3278119042515755e-03</internalNodes>
+          <leafValues>
+            7.3735602200031281e-02 -5.1023889333009720e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5295 -1.0695509612560272e-02</internalNodes>
+          <leafValues>
+            -7.5625538825988770e-01 7.3301601223647594e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5296 7.8046746551990509e-02</internalNodes>
+          <leafValues>
+            1.8139410531148314e-03 -6.2067931890487671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5297 5.6678339838981628e-02</internalNodes>
+          <leafValues>
+            6.2128840945661068e-03 -7.8200930356979370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5298 7.2442921809852123e-03</internalNodes>
+          <leafValues>
+            -4.8852469772100449e-02 1.0644549876451492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5299 -6.6754333674907684e-02</internalNodes>
+          <leafValues>
+            -6.4796060323715210e-01 8.7654050439596176e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5300 -3.4662630409002304e-02</internalNodes>
+          <leafValues>
+            3.3293959498405457e-01 -1.7286069691181183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5301 -1.5084750019013882e-02</internalNodes>
+          <leafValues>
+            -1.2696580588817596e-01 4.5507699251174927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5302 -2.3421730846166611e-02</internalNodes>
+          <leafValues>
+            -2.5279340147972107e-01 1.5818970277905464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5303 2.5689320638775826e-02</internalNodes>
+          <leafValues>
+            -3.7194628268480301e-02 1.6223169863224030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5304 6.3883140683174133e-03</internalNodes>
+          <leafValues>
+            3.0617009848356247e-02 -1.3695000112056732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5305 -1.0519590228796005e-01</internalNodes>
+          <leafValues>
+            -8.4453481435775757e-01 6.6635669209063053e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5306 1.8773669376969337e-02</internalNodes>
+          <leafValues>
+            4.6610347926616669e-03 -1.7115519940853119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5307 -1.3318320270627737e-03</internalNodes>
+          <leafValues>
+            6.5780423581600189e-02 -8.7241567671298981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5308 -2.1417330205440521e-01</internalNodes>
+          <leafValues>
+            4.7866639494895935e-01 -3.0801231041550636e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5309 -5.5097872018814087e-01</internalNodes>
+          <leafValues>
+            -6.3633698225021362e-01 8.8994754478335381e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5310 -3.3415539655834436e-03</internalNodes>
+          <leafValues>
+            1.2846040725708008e-01 -3.2317079603672028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5311 1.0858159512281418e-03</internalNodes>
+          <leafValues>
+            -1.1438050121068954e-01 4.7090869396924973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5312 4.2784498073160648e-03</internalNodes>
+          <leafValues>
+            4.3842699378728867e-02 -8.0856688320636749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5313 -2.0054390188306570e-03</internalNodes>
+          <leafValues>
+            1.0532370209693909e-01 -5.0866328179836273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5314 -3.4336079843342304e-03</internalNodes>
+          <leafValues>
+            -7.9986043274402618e-02 4.2570270597934723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5315 -1.2204749509692192e-03</internalNodes>
+          <leafValues>
+            4.1162941604852676e-02 -1.3378110527992249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5316 -1.3440379500389099e-01</internalNodes>
+          <leafValues>
+            -5.2044588327407837e-01 2.9635489918291569e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5317 1.4581819996237755e-02</internalNodes>
+          <leafValues>
+            -1.9067969173192978e-02 4.0065661072731018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5318 -2.8450360987335443e-03</internalNodes>
+          <leafValues>
+            -5.8998711407184601e-02 3.1797751784324646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5319 4.8618339933454990e-03</internalNodes>
+          <leafValues>
+            3.9754759520292282e-02 -1.4741879701614380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5320 5.6295008398592472e-03</internalNodes>
+          <leafValues>
+            -4.2094878852367401e-02 4.1394129395484924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5321 -4.5936359092593193e-03</internalNodes>
+          <leafValues>
+            2.0751099288463593e-01 -2.7909379452466965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5322 -3.0693739652633667e-02</internalNodes>
+          <leafValues>
+            -3.4029048681259155e-01 5.0333337858319283e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5323 3.1476689036935568e-04</internalNodes>
+          <leafValues>
+            -8.8118873536586761e-02 6.3354291021823883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5324 -3.4313879441469908e-03</internalNodes>
+          <leafValues>
+            5.9088770300149918e-02 -6.7773580551147461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5325 -3.4075058647431433e-04</internalNodes>
+          <leafValues>
+            -9.8268762230873108e-02 5.8783698827028275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5326 -3.7829359062016010e-03</internalNodes>
+          <leafValues>
+            1.7841720581054688e-01 -4.6912178397178650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5327 -4.6322058886289597e-02</internalNodes>
+          <leafValues>
+            -1.6307410597801208e-01 3.9191931486129761e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5328 1.8471380695700645e-02</internalNodes>
+          <leafValues>
+            1.5975039452314377e-02 -2.8808701038360596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5329 9.0416809543967247e-03</internalNodes>
+          <leafValues>
+            -3.1815830618143082e-02 1.6392929852008820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5330 -3.1387940049171448e-02</internalNodes>
+          <leafValues>
+            1.5696319937705994e-01 -1.5333149582147598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5331 -7.5614887464325875e-05</internalNodes>
+          <leafValues>
+            7.4591353535652161e-02 -8.4359541535377502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5332 -2.3939300328493118e-02</internalNodes>
+          <leafValues>
+            -1.1604589968919754e-01 3.0868789181113243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5333 2.2537580225616693e-03</internalNodes>
+          <leafValues>
+            4.0261909365653992e-02 -1.6604030132293701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5334 -5.3389810025691986e-02</internalNodes>
+          <leafValues>
+            1.0318890213966370e-01 -2.0877240225672722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5335 5.6420508772134781e-03</internalNodes>
+          <leafValues>
+            -4.6839520335197449e-02 1.1634089797735214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5336 4.2355400510132313e-03</internalNodes>
+          <leafValues>
+            2.5631250813603401e-02 -9.3193583190441132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5337 -2.1929260343313217e-02</internalNodes>
+          <leafValues>
+            -3.5141220688819885e-01 1.5704020857810974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5338 1.3050789944827557e-02</internalNodes>
+          <leafValues>
+            -7.6834131032228470e-03 1.3095930218696594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5339 2.2426109760999680e-02</internalNodes>
+          <leafValues>
+            6.3964631408452988e-03 -8.0513131618499756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5340 -8.8755652308464050e-02</internalNodes>
+          <leafValues>
+            3.9323249459266663e-01 -1.0365420021116734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5341 1.1768270283937454e-02</internalNodes>
+          <leafValues>
+            -7.5270563364028931e-02 7.1183227002620697e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5342 2.1221570670604706e-02</internalNodes>
+          <leafValues>
+            2.4082770571112633e-02 -1.6292670369148254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5343 -5.2887611091136932e-02</internalNodes>
+          <leafValues>
+            3.3231079578399658e-01 -1.5548040159046650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5344 2.5847768783569336e-01</internalNodes>
+          <leafValues>
+            9.5278248190879822e-03 -6.3773447275161743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5345 -2.8695159126073122e-03</internalNodes>
+          <leafValues>
+            -9.8719991743564606e-02 5.5244650691747665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5346 1.2492690235376358e-01</internalNodes>
+          <leafValues>
+            1.9365450134500861e-03 -9.9999272823333740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5347 4.3900720775127411e-02</internalNodes>
+          <leafValues>
+            -1.6385570168495178e-02 3.7183851003646851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5348 5.2520469762384892e-03</internalNodes>
+          <leafValues>
+            4.7758270055055618e-02 -1.3461829721927643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5349 -2.0031959284096956e-03</internalNodes>
+          <leafValues>
+            8.3587102591991425e-02 -6.7750580608844757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5350 4.4535310007631779e-03</internalNodes>
+          <leafValues>
+            -8.9202463626861572e-02 4.6748258173465729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5351 1.5174630284309387e-01</internalNodes>
+          <leafValues>
+            5.6481529027223587e-03 -8.2450437545776367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5352 -6.1992209404706955e-02</internalNodes>
+          <leafValues>
+            -4.3334591388702393e-01 5.3922580555081367e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5353 -9.3085348606109619e-02</internalNodes>
+          <leafValues>
+            5.2169102430343628e-01 -9.9382782354950905e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5354 -4.9394429661333561e-03</internalNodes>
+          <leafValues>
+            -2.0004139840602875e-01 2.7710979804396629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5355 -1.3681269483640790e-03</internalNodes>
+          <leafValues>
+            8.5065416991710663e-02 -7.4542969465255737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5356 -2.7988219517283142e-04</internalNodes>
+          <leafValues>
+            -7.6987631618976593e-02 6.8912938237190247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5357 -3.2129848841577768e-03</internalNodes>
+          <leafValues>
+            1.5940999984741211e-01 -3.4221589565277100e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5358 3.9533369243144989e-02</internalNodes>
+          <leafValues>
+            3.1095379963517189e-03 -8.5460907220840454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5359 2.0442719105631113e-03</internalNodes>
+          <leafValues>
+            -6.4074553549289703e-02 7.8644759953022003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5360 -2.0770760253071785e-02</internalNodes>
+          <leafValues>
+            -3.1129410862922668e-01 4.3864948675036430e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5361 -4.7200381755828857e-02</internalNodes>
+          <leafValues>
+            1.0526890307664871e-01 -5.1456131041049957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5362 1.3096869923174381e-02</internalNodes>
+          <leafValues>
+            9.9430568516254425e-03 -1.4253680408000946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5363 -1.0935390368103981e-02</internalNodes>
+          <leafValues>
+            -1.6756610572338104e-01 3.5863548517227173e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5364 -1.6354349255561829e-01</internalNodes>
+          <leafValues>
+            -8.2129329442977905e-01 1.9741130527108908e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5365 3.8668718189001083e-02</internalNodes>
+          <leafValues>
+            -1.1329679749906063e-02 4.7532460093498230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5366 6.0949958860874176e-02</internalNodes>
+          <leafValues>
+            1.1516530066728592e-02 -5.7472079992294312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5367 -1.2101690284907818e-02</internalNodes>
+          <leafValues>
+            1.5505610406398773e-01 -3.2629158347845078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5368 -1.0064270347356796e-02</internalNodes>
+          <leafValues>
+            -9.2389531433582306e-02 3.2318059355020523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5369 -5.8900681324303150e-03</internalNodes>
+          <leafValues>
+            -2.6503130793571472e-01 1.9127139821648598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5370 -3.1361039727926254e-02</internalNodes>
+          <leafValues>
+            5.6730771064758301e-01 -9.6010044217109680e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5371 -4.7777321189641953e-02</internalNodes>
+          <leafValues>
+            5.9038662910461426e-01 -7.4091539718210697e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5372 -1.0792270302772522e-02</internalNodes>
+          <leafValues>
+            -1.2814930081367493e-01 4.0264949202537537e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5373 -1.4374120160937309e-02</internalNodes>
+          <leafValues>
+            2.0772540569305420e-01 -2.9854990541934967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5374 5.2079811692237854e-02</internalNodes>
+          <leafValues>
+            -3.8335260469466448e-03 7.5818628072738647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5375 6.1354418285191059e-03</internalNodes>
+          <leafValues>
+            3.0476450920104980e-02 -1.7281690239906311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5376 -3.0654598958790302e-03</internalNodes>
+          <leafValues>
+            5.8025300502777100e-02 -7.9617038369178772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5377 5.7721929624676704e-03</internalNodes>
+          <leafValues>
+            -3.6747518926858902e-02 1.6319790482521057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5378 2.7028471231460571e-01</internalNodes>
+          <leafValues>
+            -3.9847781881690025e-03 4.9476540088653564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5379 -1.5034529566764832e-01</internalNodes>
+          <leafValues>
+            -5.2624911069869995e-01 1.0567910037934780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5380 7.6101601123809814e-02</internalNodes>
+          <leafValues>
+            -2.3525250144302845e-03 9.1819989681243896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5381 -5.5953811854124069e-02</internalNodes>
+          <leafValues>
+            -7.8321272134780884e-01 6.8363421596586704e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5382 -2.4320950731635094e-02</internalNodes>
+          <leafValues>
+            2.2739610075950623e-01 -1.1622290126979351e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5383 1.6274319961667061e-02</internalNodes>
+          <leafValues>
+            1.4024170115590096e-02 -3.4222239255905151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5384 7.7015208080410957e-04</internalNodes>
+          <leafValues>
+            -4.4768709689378738e-02 5.7412229478359222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5385 1.3995269546285272e-03</internalNodes>
+          <leafValues>
+            -6.0614239424467087e-02 8.4398999810218811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5386 -2.0544769242405891e-02</internalNodes>
+          <leafValues>
+            -1.8160410225391388e-01 2.0795119926333427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5387 -3.6872550845146179e-02</internalNodes>
+          <leafValues>
+            2.6817229390144348e-01 -1.9921269267797470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5388 -2.5466610677540302e-03</internalNodes>
+          <leafValues>
+            -1.3361929357051849e-01 1.9191939383745193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5389 3.3513590693473816e-02</internalNodes>
+          <leafValues>
+            9.8206587135791779e-03 -5.2659887075424194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5390 -5.5437661707401276e-02</internalNodes>
+          <leafValues>
+            4.5292490720748901e-01 -9.3475803732872009e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5391 -5.3564338013529778e-03</internalNodes>
+          <leafValues>
+            -1.4787580072879791e-01 3.3617950975894928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5392 1.1551200412213802e-02</internalNodes>
+          <leafValues>
+            -3.2851058989763260e-02 6.3716597855091095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5393 7.2917826473712921e-02</internalNodes>
+          <leafValues>
+            -1.6388719901442528e-02 3.1580808758735657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5394 -8.9563012123107910e-02</internalNodes>
+          <leafValues>
+            7.5366562604904175e-01 -2.0717559382319450e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5395 -2.2225419525057077e-03</internalNodes>
+          <leafValues>
+            -9.2733852565288544e-02 6.0395851731300354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5396 -1.7847110331058502e-01</internalNodes>
+          <leafValues>
+            4.7988530993461609e-01 -1.0481510311365128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5397 6.7723011597990990e-03</internalNodes>
+          <leafValues>
+            5.2660830318927765e-02 -1.0471290349960327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5398 2.8399130329489708e-02</internalNodes>
+          <leafValues>
+            -2.2862000390887260e-02 2.5348138809204102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5399 -7.0053818635642529e-03</internalNodes>
+          <leafValues>
+            -1.3017000257968903e-01 4.3448921293020248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5400 -5.1440461538732052e-03</internalNodes>
+          <leafValues>
+            -1.4800100028514862e-01 4.5171629637479782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5401 -1.1269059963524342e-02</internalNodes>
+          <leafValues>
+            1.1185359954833984e-01 -5.4867088794708252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5402 2.2866109386086464e-02</internalNodes>
+          <leafValues>
+            -1.5563690103590488e-02 2.1705490350723267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5403 5.1559228450059891e-02</internalNodes>
+          <leafValues>
+            1.0421809740364552e-02 -5.3233247995376587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5404 1.8902059644460678e-02</internalNodes>
+          <leafValues>
+            -3.0878869816660881e-02 5.5574499070644379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5405 5.5700382217764854e-03</internalNodes>
+          <leafValues>
+            5.3661361336708069e-02 -9.4876497983932495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5406 -2.3021729663014412e-02</internalNodes>
+          <leafValues>
+            1.2766240537166595e-01 -2.2307910025119781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5407 7.1334750391542912e-03</internalNodes>
+          <leafValues>
+            3.1089689582586288e-02 -1.6293430328369141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5408 -2.9335260391235352e-02</internalNodes>
+          <leafValues>
+            1.0503090173006058e-01 -2.6008550077676773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5409 4.6253278851509094e-02</internalNodes>
+          <leafValues>
+            7.8362170606851578e-03 -6.6226661205291748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5410 3.9622580516152084e-04</internalNodes>
+          <leafValues>
+            -9.4567127525806427e-02 2.6796899735927582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5411 -1.1323750019073486e-02</internalNodes>
+          <leafValues>
+            7.4313652515411377e-01 -6.7432140931487083e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5412 -1.7217209935188293e-01</internalNodes>
+          <leafValues>
+            -7.1483498811721802e-01 8.1747565418481827e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5413 1.8156579462811351e-03</internalNodes>
+          <leafValues>
+            4.8135720193386078e-02 -1.0678470134735107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5414 5.8022491633892059e-02</internalNodes>
+          <leafValues>
+            -7.4218288064002991e-03 3.8226440548896790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5415 1.4357370091602206e-03</internalNodes>
+          <leafValues>
+            -2.2542880475521088e-01 2.1576719358563423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5416 5.5960440076887608e-03</internalNodes>
+          <leafValues>
+            2.5731930136680603e-01 -2.1246509626507759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5417 2.5314849335700274e-03</internalNodes>
+          <leafValues>
+            -3.6227720975875854e-01 1.5138260088860989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5418 -4.2207110673189163e-03</internalNodes>
+          <leafValues>
+            -4.6638991683721542e-02 2.6125539094209671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5419 -5.4260431788861752e-03</internalNodes>
+          <leafValues>
+            1.0110379755496979e-01 -5.2066121250391006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5420 1.6170790186151862e-03</internalNodes>
+          <leafValues>
+            -4.1680540889501572e-02 9.6459351480007172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5421 -3.2414530869573355e-03</internalNodes>
+          <leafValues>
+            -1.2638680636882782e-01 3.9169210940599442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5422 4.5421482063829899e-03</internalNodes>
+          <leafValues>
+            -2.9149880632758141e-02 6.9948889315128326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5423 5.3024510852992535e-03</internalNodes>
+          <leafValues>
+            -7.9129062592983246e-02 6.1111859977245331e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5424 -4.6412080526351929e-02</internalNodes>
+          <leafValues>
+            3.1127449870109558e-01 -6.2580788508057594e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5425 -6.2991487793624401e-03</internalNodes>
+          <leafValues>
+            -8.3928130567073822e-02 6.6761530935764313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5426 7.9948090016841888e-02</internalNodes>
+          <leafValues>
+            2.6887101121246815e-03 -5.6553709506988525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5427 9.9693494848906994e-04</internalNodes>
+          <leafValues>
+            -7.2051003575325012e-02 9.2260897159576416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5428 -2.1847949828952551e-03</internalNodes>
+          <leafValues>
+            8.3864517509937286e-02 -6.6099606454372406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5429 -1.5286840498447418e-01</internalNodes>
+          <leafValues>
+            6.1705768108367920e-01 -8.1674018874764442e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5430 1.7121130600571632e-02</internalNodes>
+          <leafValues>
+            2.6676440611481667e-02 -1.4158309996128082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5431 1.8799189710989594e-03</internalNodes>
+          <leafValues>
+            -7.7865563333034515e-02 6.7955218255519867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5432 5.5029629729688168e-03</internalNodes>
+          <leafValues>
+            -7.9979859292507172e-02 6.4055956900119781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5433 2.7474550530314445e-02</internalNodes>
+          <leafValues>
+            6.0482721775770187e-02 -8.8957548141479492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5434 2.7708879113197327e-01</internalNodes>
+          <leafValues>
+            4.4098719954490662e-03 -1.0000040531158447e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5435 -4.9538668245077133e-03</internalNodes>
+          <leafValues>
+            1.4720940589904785e-01 -3.5671569406986237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5436 4.7095369547605515e-02</internalNodes>
+          <leafValues>
+            -6.0950522311031818e-03 2.4319580197334290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5437 -3.1939700711518526e-03</internalNodes>
+          <leafValues>
+            -1.3417580723762512e-01 3.9335511624813080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5438 3.5586568992584944e-03</internalNodes>
+          <leafValues>
+            2.1399470046162605e-02 -4.3609801679849625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5439 -1.0028639808297157e-02</internalNodes>
+          <leafValues>
+            1.6288889944553375e-01 -3.1448449939489365e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5440 -2.9802629724144936e-03</internalNodes>
+          <leafValues>
+            -7.0220857858657837e-02 3.7910789251327515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5441 1.7347529530525208e-02</internalNodes>
+          <leafValues>
+            1.1053959839046001e-02 -4.5107790827751160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5442 -4.4207129627466202e-02</internalNodes>
+          <leafValues>
+            1.4115320146083832e-01 -6.2362072058022022e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5443 -3.2249989453703165e-03</internalNodes>
+          <leafValues>
+            -1.0305760055780411e-01 4.9647849053144455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5444 7.5196991674602032e-03</internalNodes>
+          <leafValues>
+            -2.8604390099644661e-02 9.8367802798748016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5445 -6.1209458857774734e-02</internalNodes>
+          <leafValues>
+            2.2113859653472900e-01 -2.9835490509867668e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5446 2.0107250660657883e-02</internalNodes>
+          <leafValues>
+            1.6412479802966118e-02 -1.2316829711198807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5447 -1.6578679904341698e-02</internalNodes>
+          <leafValues>
+            -2.3395630717277527e-01 3.0250690877437592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5448 -6.0900870710611343e-02</internalNodes>
+          <leafValues>
+            3.1688570976257324e-01 -1.8433200195431709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5449 4.2772209271788597e-03</internalNodes>
+          <leafValues>
+            -4.3859448283910751e-02 1.2858760356903076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5450 6.6130697727203369e-02</internalNodes>
+          <leafValues>
+            2.0941190421581268e-02 -2.0549100637435913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5451 2.5896991137415171e-03</internalNodes>
+          <leafValues>
+            -8.2597322762012482e-02 7.7048726379871368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5452 -1.7113700509071350e-02</internalNodes>
+          <leafValues>
+            -9.9560201168060303e-02 2.0174279808998108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5453 6.2078679911792278e-03</internalNodes>
+          <leafValues>
+            -1.5074240043759346e-02 3.5393691062927246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5454 -3.3676949143409729e-01</internalNodes>
+          <leafValues>
+            -4.9838671088218689e-01 7.4067250825464725e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5455 5.0239380449056625e-02</internalNodes>
+          <leafValues>
+            -1.8589239567518234e-02 2.8223350644111633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5456 1.1036300100386143e-02</internalNodes>
+          <leafValues>
+            2.9623959213495255e-02 -2.0078790187835693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5457 6.0965020209550858e-02</internalNodes>
+          <leafValues>
+            -1.1036460287868977e-02 5.0334519147872925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5458 1.5966590493917465e-02</internalNodes>
+          <leafValues>
+            1.3941870070993900e-02 -2.4742470681667328e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>243</maxWeakCount>
+      <stageThreshold>-1.4138590097427368e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 5459 -3.8829419761896133e-02</internalNodes>
+          <leafValues>
+            3.1823828816413879e-01 -1.4062009751796722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5460 -6.7771300673484802e-02</internalNodes>
+          <leafValues>
+            2.0526969432830811e-01 -1.7867469787597656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5461 9.3152940273284912e-02</internalNodes>
+          <leafValues>
+            -1.3293810188770294e-01 2.3252120614051819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5462 -6.0846367850899696e-03</internalNodes>
+          <leafValues>
+            1.9817650318145752e-01 -1.5535140037536621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5463 -1.7230149358510971e-02</internalNodes>
+          <leafValues>
+            2.5784310698509216e-01 -9.0387366712093353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5464 4.1907798498868942e-02</internalNodes>
+          <leafValues>
+            6.2066148966550827e-02 -3.2303139567375183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5465 -3.4084350336343050e-03</internalNodes>
+          <leafValues>
+            -3.1667909026145935e-01 6.0275040566921234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5466 3.4909289330244064e-02</internalNodes>
+          <leafValues>
+            -1.2456309795379639e-01 1.6099859774112701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5467 1.1676900088787079e-02</internalNodes>
+          <leafValues>
+            -1.8025660514831543e-01 1.2234430015087128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5468 -1.2773449998348951e-03</internalNodes>
+          <leafValues>
+            -2.4735580384731293e-01 6.2129739671945572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5469 1.6917299479246140e-02</internalNodes>
+          <leafValues>
+            6.9671042263507843e-02 -2.5292581319808960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5470 2.5656640529632568e-02</internalNodes>
+          <leafValues>
+            2.6212580502033234e-02 -1.6348999738693237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5471 1.9884048961102962e-03</internalNodes>
+          <leafValues>
+            -3.1018510460853577e-01 5.0259251147508621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5472 4.2548488825559616e-02</internalNodes>
+          <leafValues>
+            1.7065819352865219e-02 -4.7830620408058167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5473 6.0466718859970570e-03</internalNodes>
+          <leafValues>
+            -2.2118049860000610e-01 7.2842411696910858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5474 -8.0229081213474274e-03</internalNodes>
+          <leafValues>
+            -1.4530059695243835e-01 4.9906261265277863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5475 3.7937261164188385e-02</internalNodes>
+          <leafValues>
+            -3.4007780253887177e-02 4.3715330958366394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5476 -5.2960298955440521e-02</internalNodes>
+          <leafValues>
+            -2.8856590390205383e-01 1.8457209691405296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5477 7.5578060932457447e-03</internalNodes>
+          <leafValues>
+            -2.3534600436687469e-01 6.0302570462226868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5478 -1.5554980374872684e-02</internalNodes>
+          <leafValues>
+            -2.6567730307579041e-01 5.5279370397329330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5479 3.4035260323435068e-03</internalNodes>
+          <leafValues>
+            4.6175889670848846e-02 -3.3651891350746155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5480 -1.9370270892977715e-02</internalNodes>
+          <leafValues>
+            1.9603839516639709e-01 -8.0186828970909119e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5481 2.1719569340348244e-02</internalNodes>
+          <leafValues>
+            4.1932079941034317e-02 -3.4327590465545654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5482 -3.8787510129623115e-04</internalNodes>
+          <leafValues>
+            -2.5382238626480103e-01 4.5200780034065247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5483 3.3794559538364410e-02</internalNodes>
+          <leafValues>
+            -6.4901560544967651e-02 2.1238659322261810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5484 -9.1701336205005646e-03</internalNodes>
+          <leafValues>
+            -2.3874589800834656e-01 4.0796380490064621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5485 -1.3741330476477742e-03</internalNodes>
+          <leafValues>
+            -1.6430020332336426e-01 8.1496283411979675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5486 -1.2352719902992249e-02</internalNodes>
+          <leafValues>
+            1.6805070638656616e-01 -5.7883970439434052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5487 -1.1177700012922287e-02</internalNodes>
+          <leafValues>
+            -1.9775860011577606e-01 6.3408702611923218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5488 2.5044390931725502e-03</internalNodes>
+          <leafValues>
+            -1.2900459766387939e-01 5.8973610401153564e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5489 2.1939110010862350e-03</internalNodes>
+          <leafValues>
+            1.4937159419059753e-01 -7.9897291958332062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5490 -4.6443499624729156e-02</internalNodes>
+          <leafValues>
+            -4.4332349300384521e-01 2.0691359415650368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5491 -3.8867309689521790e-02</internalNodes>
+          <leafValues>
+            -5.3450870513916016e-01 2.1435650065541267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5492 -2.0838780328631401e-03</internalNodes>
+          <leafValues>
+            5.3876239806413651e-02 -1.6674530506134033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5493 -1.7784969881176949e-02</internalNodes>
+          <leafValues>
+            2.5898349285125732e-01 -6.5794423222541809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5494 -9.9478460848331451e-02</internalNodes>
+          <leafValues>
+            -7.2332090139389038e-01 6.1601991765201092e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5495 -2.5733250658959150e-03</internalNodes>
+          <leafValues>
+            7.2027653455734253e-02 -1.7522309720516205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5496 6.9977439939975739e-02</internalNodes>
+          <leafValues>
+            -3.0238330364227295e-02 3.9809378981590271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5497 -1.0880780406296253e-02</internalNodes>
+          <leafValues>
+            -3.0606269836425781e-01 4.5210558921098709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5498 4.8081401735544205e-02</internalNodes>
+          <leafValues>
+            4.3911099433898926e-02 -2.5686219334602356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5499 7.9688243567943573e-02</internalNodes>
+          <leafValues>
+            -3.3741600811481476e-02 3.6532700061798096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5500 -1.5404020436108112e-02</internalNodes>
+          <leafValues>
+            -1.7731459438800812e-01 2.3800730705261230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5501 -3.6643899977207184e-02</internalNodes>
+          <leafValues>
+            -6.3931107521057129e-01 1.7518630251288414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5502 -1.3072500005364418e-02</internalNodes>
+          <leafValues>
+            -2.4119360744953156e-01 5.8876950293779373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5503 -2.5379280559718609e-03</internalNodes>
+          <leafValues>
+            -2.0509210228919983e-01 5.8915760368108749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5504 4.7491278499364853e-02</internalNodes>
+          <leafValues>
+            2.2842779755592346e-02 -3.9453479647636414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5505 -2.1489640697836876e-02</internalNodes>
+          <leafValues>
+            -3.1091120839118958e-01 3.8020871579647064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5506 1.3841330073773861e-02</internalNodes>
+          <leafValues>
+            -5.6039519608020782e-02 2.1308979392051697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5507 4.9399589188396931e-03</internalNodes>
+          <leafValues>
+            -1.8838630616664886e-01 6.2171839177608490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5508 1.3483439572155476e-02</internalNodes>
+          <leafValues>
+            3.6875329911708832e-02 -2.4952369928359985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5509 -8.4225656464695930e-03</internalNodes>
+          <leafValues>
+            7.1501091122627258e-02 -1.3996620476245880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5510 -4.3786991387605667e-02</internalNodes>
+          <leafValues>
+            2.0128419995307922e-01 -5.3744260221719742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5511 -1.0068439878523350e-02</internalNodes>
+          <leafValues>
+            -1.6707019507884979e-01 6.1345089226961136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5512 2.4383061099797487e-03</internalNodes>
+          <leafValues>
+            -1.2105459719896317e-01 4.9807701259851456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5513 3.2083820551633835e-03</internalNodes>
+          <leafValues>
+            -5.6045360863208771e-02 1.7955709993839264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5514 -2.0389519631862640e-02</internalNodes>
+          <leafValues>
+            -3.1983590126037598e-01 3.4141618758440018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5515 -2.2914420813322067e-02</internalNodes>
+          <leafValues>
+            -3.9454650878906250e-01 2.3838970810174942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5516 1.8566900864243507e-02</internalNodes>
+          <leafValues>
+            3.8432560861110687e-02 -2.2991999983787537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5517 -1.0277030058205128e-02</internalNodes>
+          <leafValues>
+            2.2557449340820312e-01 -4.9223229289054871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5518 -9.7914133220911026e-03</internalNodes>
+          <leafValues>
+            1.9327880442142487e-01 -3.6139059811830521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5519 1.2699839659035206e-02</internalNodes>
+          <leafValues>
+            5.6297991424798965e-02 -2.0981599390506744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5520 3.9867468178272247e-02</internalNodes>
+          <leafValues>
+            9.4982674345374107e-03 -4.7686201333999634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5521 3.3704519271850586e-02</internalNodes>
+          <leafValues>
+            1.8848460167646408e-02 -5.3707981109619141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5522 -3.3695269376039505e-02</internalNodes>
+          <leafValues>
+            -2.7003350853919983e-01 3.8956340402364731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5523 2.3961249738931656e-02</internalNodes>
+          <leafValues>
+            -9.5000430941581726e-02 1.0282819718122482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5524 8.2990229129791260e-02</internalNodes>
+          <leafValues>
+            3.7828568369150162e-02 -3.0267751216888428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5525 1.6537210345268250e-01</internalNodes>
+          <leafValues>
+            2.3912150412797928e-02 -4.1214409470558167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5526 1.8202569335699081e-02</internalNodes>
+          <leafValues>
+            2.6127459481358528e-02 -6.9227010011672974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5527 -4.5322380959987640e-02</internalNodes>
+          <leafValues>
+            -4.4437649846076965e-01 2.1279569715261459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5528 4.7620609402656555e-02</internalNodes>
+          <leafValues>
+            -3.4070000052452087e-02 2.1065680682659149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5529 1.0596530046314001e-03</internalNodes>
+          <leafValues>
+            9.8347820341587067e-02 -9.2732593417167664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5530 3.2028049230575562e-02</internalNodes>
+          <leafValues>
+            2.3833949118852615e-02 -4.3276590108871460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5531 -1.3764370232820511e-02</internalNodes>
+          <leafValues>
+            -4.1726619005203247e-01 2.1883359178900719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5532 3.6652158945798874e-02</internalNodes>
+          <leafValues>
+            -2.6851410046219826e-02 1.0051230341196060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5533 -1.5507760457694530e-02</internalNodes>
+          <leafValues>
+            4.8519268631935120e-01 -2.4900710210204124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5534 7.1460101753473282e-03</internalNodes>
+          <leafValues>
+            5.7906471192836761e-02 -5.1613971590995789e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5535 2.4280229583382607e-02</internalNodes>
+          <leafValues>
+            -3.7341829389333725e-02 2.9201799631118774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5536 -8.3522319793701172e-02</internalNodes>
+          <leafValues>
+            3.7447971105575562e-01 -3.4602559171617031e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5537 3.1485721468925476e-02</internalNodes>
+          <leafValues>
+            2.4092009291052818e-02 -3.9594879746437073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5538 9.4820279628038406e-03</internalNodes>
+          <leafValues>
+            -7.3714673519134521e-02 1.3066330552101135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5539 4.0116958320140839e-02</internalNodes>
+          <leafValues>
+            3.0453719198703766e-02 -3.0641159415245056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5540 -5.2815478295087814e-02</internalNodes>
+          <leafValues>
+            4.5792409777641296e-01 -2.3906230926513672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5541 4.6821571886539459e-03</internalNodes>
+          <leafValues>
+            -8.8395930826663971e-02 1.2858130037784576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5542 -1.3448280096054077e-01</internalNodes>
+          <leafValues>
+            -2.7471750974655151e-01 1.5970310196280479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5543 5.4646627977490425e-03</internalNodes>
+          <leafValues>
+            -2.1628439426422119e-01 4.3035320937633514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5544 -3.5996358841657639e-02</internalNodes>
+          <leafValues>
+            -4.8524090647697449e-01 1.0563749819993973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5545 2.5235998630523682e-01</internalNodes>
+          <leafValues>
+            9.3745701014995575e-03 -8.8613390922546387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5546 -2.5067269802093506e-02</internalNodes>
+          <leafValues>
+            -2.2364640235900879e-01 3.7146601825952530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5547 -1.4150329865515232e-02</internalNodes>
+          <leafValues>
+            3.7856650352478027e-01 -2.7817489579319954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5548 1.0049570351839066e-01</internalNodes>
+          <leafValues>
+            1.1244839988648891e-02 -7.1869522333145142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5549 1.9989080727100372e-02</internalNodes>
+          <leafValues>
+            2.6056809350848198e-02 -3.2147800922393799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5550 -4.9160558730363846e-02</internalNodes>
+          <leafValues>
+            -2.3164880275726318e-01 1.6317559406161308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5551 2.2118790075182915e-02</internalNodes>
+          <leafValues>
+            -5.0569478422403336e-02 1.7572580277919769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5552 -7.6390360482037067e-03</internalNodes>
+          <leafValues>
+            2.2264319658279419e-01 -4.3685391545295715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5553 -1.6813250258564949e-03</internalNodes>
+          <leafValues>
+            5.5582441389560699e-02 -1.7739319801330566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5554 -1.6619000583887100e-02</internalNodes>
+          <leafValues>
+            -2.7812969684600830e-01 1.9737830385565758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5555 -3.2801620662212372e-02</internalNodes>
+          <leafValues>
+            -2.3325189948081970e-01 3.6663819104433060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5556 2.4526590108871460e-01</internalNodes>
+          <leafValues>
+            -2.9738940298557281e-02 3.1338408589363098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5557 -1.7271770164370537e-02</internalNodes>
+          <leafValues>
+            5.2818918228149414e-01 -1.4151779934763908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5558 2.0111909136176109e-02</internalNodes>
+          <leafValues>
+            2.7173580601811409e-02 -8.3122722804546356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5559 1.6076749190688133e-02</internalNodes>
+          <leafValues>
+            5.6346639990806580e-02 -1.5893140435218811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5560 -1.0179769992828369e-01</internalNodes>
+          <leafValues>
+            6.0448008775711060e-01 -7.6062050648033619e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5561 -4.4865649193525314e-02</internalNodes>
+          <leafValues>
+            3.3077031373977661e-01 -2.5329189375042915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5562 2.7094980701804161e-02</internalNodes>
+          <leafValues>
+            -6.9251723587512970e-02 1.5350599586963654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5563 -3.7675891071557999e-02</internalNodes>
+          <leafValues>
+            -3.1949838995933533e-01 2.9909679666161537e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5564 -8.2310457946732640e-04</internalNodes>
+          <leafValues>
+            6.0612969100475311e-02 -1.0531579703092575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5565 5.5686049163341522e-02</internalNodes>
+          <leafValues>
+            -4.0920350700616837e-02 2.2959649562835693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5566 -1.6866069927345961e-04</internalNodes>
+          <leafValues>
+            -7.7643588185310364e-02 2.9549270868301392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5567 -2.3873209953308105e-02</internalNodes>
+          <leafValues>
+            2.7944079041481018e-01 -3.1888458877801895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5568 -1.5003600157797337e-02</internalNodes>
+          <leafValues>
+            2.5077390670776367e-01 -4.5932788401842117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5569 -1.4522319659590721e-02</internalNodes>
+          <leafValues>
+            -1.6453540325164795e-01 5.5180910974740982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5570 -7.4650160968303680e-03</internalNodes>
+          <leafValues>
+            -1.2690469622612000e-01 7.1543112397193909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5571 5.4984640330076218e-02</internalNodes>
+          <leafValues>
+            -1.3730799779295921e-02 6.5119642019271851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5572 -8.8030762970447540e-02</internalNodes>
+          <leafValues>
+            2.5416490435600281e-01 -1.2233870103955269e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5573 -3.6195501685142517e-02</internalNodes>
+          <leafValues>
+            -4.4917309284210205e-01 2.1093770861625671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5574 3.7063211202621460e-02</internalNodes>
+          <leafValues>
+            -6.6644148901104927e-03 2.4940170347690582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5575 -1.0568380355834961e-02</internalNodes>
+          <leafValues>
+            -4.1061571240425110e-01 2.1398089826107025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5576 1.2662780284881592e-01</internalNodes>
+          <leafValues>
+            5.2506178617477417e-03 -3.3240249752998352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5577 -8.7341770995408297e-04</internalNodes>
+          <leafValues>
+            3.2687219977378845e-01 -2.7704829350113869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5578 -1.0967969428747892e-03</internalNodes>
+          <leafValues>
+            -2.7710831165313721e-01 3.6352828145027161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5579 -7.9738020896911621e-02</internalNodes>
+          <leafValues>
+            -5.8329159021377563e-01 1.4061779715120792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5580 -3.8278030697256327e-03</internalNodes>
+          <leafValues>
+            3.5459451377391815e-02 -1.3996809720993042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5581 2.0333999767899513e-02</internalNodes>
+          <leafValues>
+            -2.1421350538730621e-02 5.1610380411148071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5582 7.5564032886177301e-04</internalNodes>
+          <leafValues>
+            -1.0803470015525818e-01 3.3538289368152618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5583 1.7855849862098694e-01</internalNodes>
+          <leafValues>
+            9.4842249527573586e-03 -8.1858187913894653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5584 -3.4745071083307266e-02</internalNodes>
+          <leafValues>
+            -5.8172190189361572e-01 1.1315549723803997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5585 5.1304209046065807e-03</internalNodes>
+          <leafValues>
+            -1.0659860074520111e-01 7.4440896511077881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5586 -3.3936198800802231e-02</internalNodes>
+          <leafValues>
+            -4.5997759699821472e-01 1.5264419838786125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5587 -1.0171560570597649e-03</internalNodes>
+          <leafValues>
+            1.0301309823989868e-01 -8.9842960238456726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5588 6.3489019870758057e-02</internalNodes>
+          <leafValues>
+            6.8669100292026997e-03 -7.6022517681121826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5589 2.4077939987182617e-01</internalNodes>
+          <leafValues>
+            -2.1571479737758636e-02 4.1113030910491943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5590 -5.1963441073894501e-02</internalNodes>
+          <leafValues>
+            -2.8517320752143860e-01 4.0943060070276260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5591 3.6408171057701111e-02</internalNodes>
+          <leafValues>
+            -5.0460960716009140e-02 1.6671819984912872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5592 9.6712149679660797e-03</internalNodes>
+          <leafValues>
+            -4.8915110528469086e-02 1.8224430084228516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5593 2.2268150001764297e-02</internalNodes>
+          <leafValues>
+            6.1390981078147888e-02 -1.5445849299430847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5594 -7.0929281413555145e-02</internalNodes>
+          <leafValues>
+            5.0010168552398682e-01 -3.9896317757666111e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5595 2.0806699467357248e-04</internalNodes>
+          <leafValues>
+            -1.4475630223751068e-01 6.3607528805732727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5596 -9.2365043237805367e-03</internalNodes>
+          <leafValues>
+            -2.1817289292812347e-01 3.8856260478496552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5597 2.2781990468502045e-02</internalNodes>
+          <leafValues>
+            2.0108619704842567e-02 -3.8452360033988953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5598 -7.0844120346009731e-03</internalNodes>
+          <leafValues>
+            -4.8885490745306015e-02 4.6367339789867401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5599 -8.4006279706954956e-02</internalNodes>
+          <leafValues>
+            3.5921669006347656e-01 -2.2461889311671257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5600 -7.0446580648422241e-02</internalNodes>
+          <leafValues>
+            -8.8395321369171143e-01 2.9730550013482571e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5601 4.8899810761213303e-02</internalNodes>
+          <leafValues>
+            2.3936219513416290e-02 -3.6770141124725342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5602 2.9677329584956169e-02</internalNodes>
+          <leafValues>
+            1.6608120873570442e-02 -2.2972689568996429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5603 2.5721399579197168e-03</internalNodes>
+          <leafValues>
+            -3.2572209835052490e-01 2.4146009236574173e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5604 1.6117929480969906e-03</internalNodes>
+          <leafValues>
+            2.9355300590395927e-02 -3.7541579455137253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5605 1.7546640709042549e-02</internalNodes>
+          <leafValues>
+            -5.0879240036010742e-02 1.5283130109310150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5606 -4.6326398849487305e-02</internalNodes>
+          <leafValues>
+            -2.2843320667743683e-01 1.4442530460655689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5607 -3.3205670118331909e-01</internalNodes>
+          <leafValues>
+            7.4457818269729614e-01 -1.0856879875063896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5608 -4.2317830026149750e-02</internalNodes>
+          <leafValues>
+            -1.4666019380092621e-01 5.7799231261014938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5609 3.2436659093946218e-03</internalNodes>
+          <leafValues>
+            5.4021451622247696e-02 -1.7029410600662231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5610 -2.0900890231132507e-02</internalNodes>
+          <leafValues>
+            -4.0789291262626648e-01 2.5334810838103294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5611 2.0325010642409325e-02</internalNodes>
+          <leafValues>
+            3.3015929162502289e-02 -2.4503390491008759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5612 -4.6341929584741592e-02</internalNodes>
+          <leafValues>
+            1.5976649522781372e-01 -4.1177939623594284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5613 -3.4356329590082169e-02</internalNodes>
+          <leafValues>
+            1.6021409630775452e-01 -6.2500953674316406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5614 2.4465970695018768e-02</internalNodes>
+          <leafValues>
+            -3.7487599998712540e-02 2.2807280719280243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5615 -1.8139539286494255e-02</internalNodes>
+          <leafValues>
+            -1.5909589827060699e-01 6.0539811849594116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5616 6.4394161105155945e-02</internalNodes>
+          <leafValues>
+            6.6441670060157776e-03 -7.4860227108001709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5617 9.6367759397253394e-04</internalNodes>
+          <leafValues>
+            -9.0620808303356171e-02 9.4118133187294006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5618 2.0024490356445312e-01</internalNodes>
+          <leafValues>
+            5.9731658548116684e-03 -8.2521688938140869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5619 -6.3498668372631073e-02</internalNodes>
+          <leafValues>
+            -6.9635838270187378e-01 9.3487137928605080e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5620 -1.9232399761676788e-02</internalNodes>
+          <leafValues>
+            1.1236680299043655e-01 -2.9199739918112755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5621 2.5418749451637268e-01</internalNodes>
+          <leafValues>
+            1.3959039933979511e-02 -5.1584947109222412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5622 1.0437460243701935e-01</internalNodes>
+          <leafValues>
+            -2.7743030339479446e-02 2.7373430132865906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5623 8.5034370422363281e-03</internalNodes>
+          <leafValues>
+            5.4144650697708130e-02 -1.3029509782791138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5624 5.2647730335593224e-03</internalNodes>
+          <leafValues>
+            -4.8077501356601715e-02 1.0371380299329758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5625 -2.4193519726395607e-02</internalNodes>
+          <leafValues>
+            1.9932989776134491e-01 -3.7111040204763412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5626 -4.6968772076070309e-03</internalNodes>
+          <leafValues>
+            -6.5797090530395508e-02 3.3837348222732544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5627 -2.3464579135179520e-02</internalNodes>
+          <leafValues>
+            -2.6043030619621277e-01 3.0933089554309845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5628 -2.9029840603470802e-02</internalNodes>
+          <leafValues>
+            2.0683619379997253e-01 -2.7628650888800621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5629 7.9100236296653748e-02</internalNodes>
+          <leafValues>
+            7.7356752008199692e-03 -9.1816711425781250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5630 6.2152887694537640e-03</internalNodes>
+          <leafValues>
+            -7.3988027870655060e-02 8.7727412581443787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5631 -6.7013278603553772e-02</internalNodes>
+          <leafValues>
+            3.7628298997879028e-01 -2.0892709493637085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5632 -7.9359989613294601e-03</internalNodes>
+          <leafValues>
+            -8.9532703161239624e-02 6.6559307277202606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5633 1.3035970041528344e-03</internalNodes>
+          <leafValues>
+            -6.6657140851020813e-02 1.1399099975824356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5634 -1.1964319646358490e-01</internalNodes>
+          <leafValues>
+            -6.0656189918518066e-01 7.3508038185536861e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5635 -2.2869240492582321e-03</internalNodes>
+          <leafValues>
+            7.3336817324161530e-02 -1.1889570206403732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5636 -1.1462569981813431e-01</internalNodes>
+          <leafValues>
+            2.9288530349731445e-01 -6.7763519473373890e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5637 4.8477489501237869e-02</internalNodes>
+          <leafValues>
+            -1.7062950879335403e-02 4.2953211069107056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5638 -1.3129960279911757e-03</internalNodes>
+          <leafValues>
+            -7.4319638311862946e-02 6.2149789184331894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5639 -6.6344782710075378e-02</internalNodes>
+          <leafValues>
+            -5.8945667743682861e-01 1.3225819915533066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5640 -4.6543189091607928e-04</internalNodes>
+          <leafValues>
+            5.7886548340320587e-02 -6.4295299351215363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5641 -1.3286540284752846e-02</internalNodes>
+          <leafValues>
+            1.4123329520225525e-01 -6.1506468802690506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5642 7.3928399942815304e-03</internalNodes>
+          <leafValues>
+            -7.2719991207122803e-02 4.2179141193628311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5643 -4.7434169799089432e-02</internalNodes>
+          <leafValues>
+            3.2672271132469177e-01 -2.9001530259847641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5644 1.3546790182590485e-01</internalNodes>
+          <leafValues>
+            1.0393570177257061e-02 -4.5354479551315308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5645 -2.5216810405254364e-02</internalNodes>
+          <leafValues>
+            -1.9075979292392731e-01 4.1522741317749023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5646 -4.9431398510932922e-02</internalNodes>
+          <leafValues>
+            -9.4192171096801758e-01 3.5473550669848919e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5647 -4.8375181853771210e-02</internalNodes>
+          <leafValues>
+            -8.3028668165206909e-01 7.2369067929685116e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5648 -1.4348509721457958e-02</internalNodes>
+          <leafValues>
+            -2.1860499680042267e-01 3.1486429274082184e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5649 -5.5373171344399452e-03</internalNodes>
+          <leafValues>
+            -2.1521030366420746e-01 4.4235888868570328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5650 2.1771800518035889e-01</internalNodes>
+          <leafValues>
+            -5.0501842051744461e-03 4.9025520682334900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5651 1.7441399395465851e-01</internalNodes>
+          <leafValues>
+            -9.7074145451188087e-03 7.4196231365203857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5652 8.8840499520301819e-02</internalNodes>
+          <leafValues>
+            -5.8005251921713352e-03 3.3403220772743225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5653 -3.8012791424989700e-02</internalNodes>
+          <leafValues>
+            5.0677591562271118e-01 -1.3809430412948132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5654 -6.3611388206481934e-02</internalNodes>
+          <leafValues>
+            -5.6696820259094238e-01 7.9266652464866638e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5655 9.8358482122421265e-02</internalNodes>
+          <leafValues>
+            3.4634899348020554e-02 -1.9651760160923004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5656 2.2929610684514046e-02</internalNodes>
+          <leafValues>
+            -4.4682640582323074e-02 6.0062419623136520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5657 -3.9763651788234711e-02</internalNodes>
+          <leafValues>
+            -2.8310349583625793e-01 2.6087069883942604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5658 1.1215689778327942e-01</internalNodes>
+          <leafValues>
+            -4.3225709348917007e-02 1.5505640208721161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5659 -1.4957940578460693e-01</internalNodes>
+          <leafValues>
+            4.1476088762283325e-01 -2.5112669914960861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5660 1.4239370357245207e-03</internalNodes>
+          <leafValues>
+            -2.2813330590724945e-01 2.2414619103074074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5661 -1.1346139945089817e-02</internalNodes>
+          <leafValues>
+            -2.6083931326866150e-01 2.6456480845808983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5662 -9.0518407523632050e-02</internalNodes>
+          <leafValues>
+            6.0067182779312134e-01 -1.2559159658849239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5663 3.6097481846809387e-02</internalNodes>
+          <leafValues>
+            1.9451009109616280e-02 -4.0998241305351257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5664 -2.5657469406723976e-02</internalNodes>
+          <leafValues>
+            2.3453080654144287e-01 -3.2354518771171570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5665 -9.2462729662656784e-03</internalNodes>
+          <leafValues>
+            1.4458569884300232e-01 -5.7280141860246658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5666 6.1006739735603333e-02</internalNodes>
+          <leafValues>
+            1.9963319599628448e-01 -3.5018790513277054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5667 -2.2736669052392244e-03</internalNodes>
+          <leafValues>
+            -2.7180460095405579e-01 3.5324309021234512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5668 -1.1173350363969803e-01</internalNodes>
+          <leafValues>
+            2.6010888814926147e-01 -8.4183625876903534e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5669 1.4601589739322662e-01</internalNodes>
+          <leafValues>
+            -4.3707858771085739e-02 1.9343809783458710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5670 -3.9008598774671555e-02</internalNodes>
+          <leafValues>
+            -2.4021549522876740e-01 1.9324809312820435e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5671 -3.2065149396657944e-02</internalNodes>
+          <leafValues>
+            -1.4616030454635620e-01 5.0410438328981400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5672 -3.9755292236804962e-03</internalNodes>
+          <leafValues>
+            8.6786061525344849e-02 -7.5101003050804138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5673 -2.2264609113335609e-02</internalNodes>
+          <leafValues>
+            -1.7820209264755249e-01 4.2221881449222565e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5674 -6.0096651315689087e-02</internalNodes>
+          <leafValues>
+            3.3062270283699036e-01 -1.3347219675779343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5675 -8.3170406520366669e-02</internalNodes>
+          <leafValues>
+            6.9863271713256836e-01 -1.1014309711754322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5676 -7.7182397246360779e-02</internalNodes>
+          <leafValues>
+            -2.5630331039428711e-01 8.8049499318003654e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5677 6.8902172148227692e-02</internalNodes>
+          <leafValues>
+            1.0996440425515175e-02 -6.3520067930221558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5678 -5.0353281199932098e-02</internalNodes>
+          <leafValues>
+            2.2927890717983246e-01 -3.2763719558715820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5679 2.4320879019796848e-03</internalNodes>
+          <leafValues>
+            -1.3213059306144714e-01 7.1088582277297974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5680 -1.4196460135281086e-02</internalNodes>
+          <leafValues>
+            7.1845069527626038e-02 -4.5263659209012985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5681 -4.5774779282510281e-03</internalNodes>
+          <leafValues>
+            -2.5832280516624451e-01 2.9419040307402611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5682 -1.4008210273459554e-03</internalNodes>
+          <leafValues>
+            4.4636521488428116e-02 -1.2310150265693665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5683 3.5062711685895920e-02</internalNodes>
+          <leafValues>
+            -1.8722500652074814e-02 4.5533668994903564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5684 3.9364919066429138e-02</internalNodes>
+          <leafValues>
+            -3.8776830770075321e-03 4.8229390382766724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5685 2.9430290684103966e-02</internalNodes>
+          <leafValues>
+            -5.6632690131664276e-02 1.3604450225830078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5686 7.9320840537548065e-02</internalNodes>
+          <leafValues>
+            -4.0827351622283459e-03 9.9998551607131958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5687 4.2696330696344376e-02</internalNodes>
+          <leafValues>
+            2.3583339527249336e-02 -3.7798878550529480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5688 2.5937719270586967e-02</internalNodes>
+          <leafValues>
+            5.0283338874578476e-02 -6.7249342799186707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5689 2.7053659781813622e-02</internalNodes>
+          <leafValues>
+            1.0406839847564697e-01 -1.0069710016250610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5690 3.0322301387786865e-01</internalNodes>
+          <leafValues>
+            -5.1615409553050995e-02 1.2398669868707657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5691 7.4373193085193634e-02</internalNodes>
+          <leafValues>
+            -2.9979649931192398e-02 2.5944980978965759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5692 4.6059768646955490e-02</internalNodes>
+          <leafValues>
+            6.1678960919380188e-03 -7.0887911319732666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5693 3.6883510649204254e-02</internalNodes>
+          <leafValues>
+            1.5985019505023956e-02 -4.4436019659042358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5694 1.3493379950523376e-01</internalNodes>
+          <leafValues>
+            8.8313389569520950e-03 -7.3426938056945801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5695 1.4799199998378754e-01</internalNodes>
+          <leafValues>
+            6.9719799794256687e-03 -8.2078450918197632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5696 3.9690379053354263e-02</internalNodes>
+          <leafValues>
+            -1.8247799947857857e-02 2.6955920457839966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5697 -5.3511280566453934e-02</internalNodes>
+          <leafValues>
+            2.0000250637531281e-01 -3.9136700332164764e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5698 6.3795700669288635e-02</internalNodes>
+          <leafValues>
+            1.1616130359470844e-02 -2.5315120816230774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5699 -8.1078916788101196e-02</internalNodes>
+          <leafValues>
+            -7.7582788467407227e-01 9.7084697335958481e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5700 -4.8272658139467239e-02</internalNodes>
+          <leafValues>
+            -3.0734309554100037e-01 1.1298010125756264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5701 4.3912570923566818e-02</internalNodes>
+          <leafValues>
+            -3.9403300732374191e-02 1.9216950237751007e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>394</maxWeakCount>
+      <stageThreshold>-1.2940989732742310e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 5702 1.9188739359378815e-02</internalNodes>
+          <leafValues>
+            -2.1150399744510651e-01 1.3286529481410980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5703 -8.1222038716077805e-03</internalNodes>
+          <leafValues>
+            9.2491082847118378e-02 -1.7585119605064392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5704 1.5851219650357962e-03</internalNodes>
+          <leafValues>
+            -2.8565698862075806e-01 6.6710568964481354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5705 -4.3140850029885769e-03</internalNodes>
+          <leafValues>
+            -1.3885229825973511e-01 5.2694689482450485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5706 -1.7131429631263018e-03</internalNodes>
+          <leafValues>
+            1.3135610520839691e-01 -1.3149109482765198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5707 6.8447366356849670e-02</internalNodes>
+          <leafValues>
+            9.3052154406905174e-03 -2.5063261389732361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5708 -2.4445978924632072e-03</internalNodes>
+          <leafValues>
+            -1.7205530405044556e-01 9.8322823643684387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5709 1.0310600046068430e-03</internalNodes>
+          <leafValues>
+            2.3039160296320915e-02 -2.7527621388435364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5710 7.4603251414373517e-04</internalNodes>
+          <leafValues>
+            -2.3276780545711517e-01 5.2693009376525879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5711 -6.6399492789059877e-04</internalNodes>
+          <leafValues>
+            6.8990781903266907e-02 -8.4687709808349609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5712 -4.0997468749992549e-04</internalNodes>
+          <leafValues>
+            1.0501380264759064e-01 -1.0819009691476822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5713 -1.8094549886882305e-03</internalNodes>
+          <leafValues>
+            -1.8178839981555939e-01 4.4184140861034393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5714 9.3385757645592093e-04</internalNodes>
+          <leafValues>
+            -1.4622689783573151e-01 7.2726443409919739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5715 -3.8197741378098726e-04</internalNodes>
+          <leafValues>
+            2.4009939283132553e-02 -1.7295800149440765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5716 -1.4950280310586095e-03</internalNodes>
+          <leafValues>
+            -1.9403380155563354e-01 4.8807919025421143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5717 -1.0159100405871868e-02</internalNodes>
+          <leafValues>
+            1.9173899292945862e-01 -5.2749071270227432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5718 5.9903519286308438e-05</internalNodes>
+          <leafValues>
+            -1.0791549831628799e-01 9.0988166630268097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5719 -3.1967550516128540e-02</internalNodes>
+          <leafValues>
+            4.1109889745712280e-01 -2.2650640457868576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5720 1.4343270100653172e-02</internalNodes>
+          <leafValues>
+            2.4315539747476578e-02 -4.2680150270462036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5721 1.1039529927074909e-02</internalNodes>
+          <leafValues>
+            -6.2717013061046600e-02 1.1330530047416687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5722 -8.4228850901126862e-03</internalNodes>
+          <leafValues>
+            -2.1369309723377228e-01 4.2059201747179031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5723 -2.0549839362502098e-02</internalNodes>
+          <leafValues>
+            1.5161630511283875e-01 -2.4594139307737350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5724 -6.5411031246185303e-03</internalNodes>
+          <leafValues>
+            1.4883629977703094e-01 -6.1179339885711670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5725 -1.3324400410056114e-02</internalNodes>
+          <leafValues>
+            -2.0791970193386078e-01 4.8333309590816498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5726 7.0111267268657684e-02</internalNodes>
+          <leafValues>
+            -2.6863219216465950e-02 3.6322259902954102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5727 -2.6973750209435821e-04</internalNodes>
+          <leafValues>
+            6.0876660048961639e-02 -1.1272370070219040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5728 -1.3509000418707728e-03</internalNodes>
+          <leafValues>
+            -1.8552079796791077e-01 5.2154958248138428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5729 -2.8083190321922302e-02</internalNodes>
+          <leafValues>
+            3.5111880302429199e-01 -2.3596329614520073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5730 -1.0003290139138699e-02</internalNodes>
+          <leafValues>
+            -2.9058480262756348e-01 3.2125689089298248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5731 -1.6111029544845223e-03</internalNodes>
+          <leafValues>
+            9.8113670945167542e-02 -5.2203711122274399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5732 -1.8411900848150253e-02</internalNodes>
+          <leafValues>
+            -1.8082669377326965e-01 5.4536700248718262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5733 -7.1738816797733307e-02</internalNodes>
+          <leafValues>
+            -7.6654988527297974e-01 3.3518690615892410e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5734 -2.7943260502070189e-03</internalNodes>
+          <leafValues>
+            1.5871369838714600e-01 -6.4271800220012665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5735 -1.6874749958515167e-01</internalNodes>
+          <leafValues>
+            -6.9956189393997192e-01 4.8861699178814888e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5736 -1.2672400334849954e-03</internalNodes>
+          <leafValues>
+            3.1616039574146271e-02 -2.4953269958496094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5737 2.0807750523090363e-02</internalNodes>
+          <leafValues>
+            1.7053410410881042e-02 -2.4331410229206085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5738 -1.5869849594309926e-03</internalNodes>
+          <leafValues>
+            9.3171089887619019e-02 -8.1361927092075348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5739 -1.0014690458774567e-02</internalNodes>
+          <leafValues>
+            -2.7789619565010071e-01 2.6569239795207977e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5740 -5.7948171161115170e-03</internalNodes>
+          <leafValues>
+            -2.2287739813327789e-01 3.5975661128759384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5741 2.7189950924366713e-03</internalNodes>
+          <leafValues>
+            -9.0631909668445587e-02 5.6820400059223175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5742 3.8845159113407135e-02</internalNodes>
+          <leafValues>
+            1.2280859984457493e-02 -5.8521348237991333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5743 -1.4158680103719234e-02</internalNodes>
+          <leafValues>
+            1.8153870105743408e-01 -3.1109429895877838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5744 -1.8278600275516510e-01</internalNodes>
+          <leafValues>
+            -9.0013808012008667e-01 7.6544750481843948e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5745 2.7588419616222382e-02</internalNodes>
+          <leafValues>
+            -1.2460039928555489e-02 2.0069369673728943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5746 -1.4784430153667927e-02</internalNodes>
+          <leafValues>
+            -8.9910492300987244e-02 8.1648677587509155e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5747 1.1625719815492630e-01</internalNodes>
+          <leafValues>
+            2.3692469112575054e-03 -9.9998068809509277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5748 3.5341090988367796e-03</internalNodes>
+          <leafValues>
+            -6.1760541051626205e-02 1.3490639626979828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5749 5.1878788508474827e-03</internalNodes>
+          <leafValues>
+            1.8745860084891319e-02 -1.7449170351028442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5750 7.9457357525825500e-02</internalNodes>
+          <leafValues>
+            -2.3402990773320198e-02 3.3502200245857239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5751 2.7684379369020462e-02</internalNodes>
+          <leafValues>
+            2.3663910105824471e-02 -3.3256360888481140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5752 -4.4806320220232010e-03</internalNodes>
+          <leafValues>
+            -1.4658750593662262e-01 4.7376811504364014e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5753 5.6939688511192799e-03</internalNodes>
+          <leafValues>
+            -5.6776121258735657e-02 6.7580856382846832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5754 7.7299480326473713e-03</internalNodes>
+          <leafValues>
+            -3.1156649813055992e-02 2.3102590441703796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5755 3.9786100387573242e-03</internalNodes>
+          <leafValues>
+            -5.6882441043853760e-02 1.3271529972553253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5756 -1.1275880038738251e-02</internalNodes>
+          <leafValues>
+            -2.0938649773597717e-01 3.5291459411382675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5757 -2.4308220017701387e-03</internalNodes>
+          <leafValues>
+            -2.0176360011100769e-01 3.4513931721448898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5758 5.7369591668248177e-03</internalNodes>
+          <leafValues>
+            -5.5607158690690994e-02 1.1532089859247208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5759 4.6170800924301147e-03</internalNodes>
+          <leafValues>
+            -5.6083500385284424e-02 8.1762917339801788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5760 -4.7089671716094017e-03</internalNodes>
+          <leafValues>
+            -1.3351219892501831e-01 5.6296080350875854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5761 -3.2688070088624954e-02</internalNodes>
+          <leafValues>
+            2.7922388911247253e-01 -1.0867659933865070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5762 8.8686197996139526e-02</internalNodes>
+          <leafValues>
+            1.8268220126628876e-02 -3.5637390613555908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5763 4.5751677826046944e-03</internalNodes>
+          <leafValues>
+            -5.1558461040258408e-02 6.3948810100555420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5764 4.9765850417315960e-03</internalNodes>
+          <leafValues>
+            -5.4684590548276901e-02 1.1907110363245010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5765 -6.4881290309131145e-03</internalNodes>
+          <leafValues>
+            -9.9121123552322388e-02 2.6508849114179611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5766 2.4523450993001461e-03</internalNodes>
+          <leafValues>
+            -9.5045946538448334e-02 6.6802926361560822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5767 7.0354789495468140e-03</internalNodes>
+          <leafValues>
+            1.0705590248107910e-01 -6.2395099550485611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5768 4.2746789753437042e-02</internalNodes>
+          <leafValues>
+            -1.6092179343104362e-02 4.3256199359893799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5769 -4.5301730278879404e-04</internalNodes>
+          <leafValues>
+            3.6420568823814392e-02 -9.9322892725467682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5770 -5.2631930448114872e-03</internalNodes>
+          <leafValues>
+            -1.1416749656200409e-01 5.7260219007730484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5771 1.0581909446045756e-03</internalNodes>
+          <leafValues>
+            3.3220488578081131e-02 -1.1831220239400864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5772 2.5088949128985405e-02</internalNodes>
+          <leafValues>
+            -6.0655020177364349e-02 1.2601740658283234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5773 2.4252159893512726e-01</internalNodes>
+          <leafValues>
+            2.2060840856283903e-03 -1.0000120401382446e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5774 -1.4393079280853271e-01</internalNodes>
+          <leafValues>
+            3.7419798970222473e-01 -2.2252110764384270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5775 -6.0972762294113636e-03</internalNodes>
+          <leafValues>
+            -1.1038099974393845e-01 4.5996960252523422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5776 6.1375470831990242e-03</internalNodes>
+          <leafValues>
+            3.8307808339595795e-02 -1.8086770176887512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5777 -3.6617079749703407e-03</internalNodes>
+          <leafValues>
+            3.8439918309450150e-02 -6.2540791928768158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5778 -1.5854850411415100e-01</internalNodes>
+          <leafValues>
+            3.4469398856163025e-01 -1.9837500527501106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5779 6.7219287157058716e-02</internalNodes>
+          <leafValues>
+            9.5165139064192772e-03 -5.0206458568572998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5780 2.2499680053442717e-03</internalNodes>
+          <leafValues>
+            -1.3063929975032806e-01 6.4832933247089386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5781 8.4626786410808563e-02</internalNodes>
+          <leafValues>
+            5.9339799918234348e-03 -4.1516590118408203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5782 -9.5411221263930202e-04</internalNodes>
+          <leafValues>
+            -9.3790747225284576e-02 7.5486607849597931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5783 -7.6813949272036552e-03</internalNodes>
+          <leafValues>
+            -1.4821960031986237e-01 2.9010580852627754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5784 -2.5593319907784462e-02</internalNodes>
+          <leafValues>
+            1.4859579503536224e-01 -4.7195930033922195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5785 2.1508369594812393e-02</internalNodes>
+          <leafValues>
+            2.3782620206475258e-02 -9.6659287810325623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5786 3.4463100135326385e-02</internalNodes>
+          <leafValues>
+            -3.7410069257020950e-02 2.2015300393104553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5787 -3.7860300391912460e-02</internalNodes>
+          <leafValues>
+            -5.0047469139099121e-01 1.4059869572520256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5788 1.2028450146317482e-03</internalNodes>
+          <leafValues>
+            -6.5087057650089264e-02 8.9583486318588257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5789 1.6753520816564560e-02</internalNodes>
+          <leafValues>
+            4.9179811030626297e-03 -4.3030908703804016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5790 1.6640779795125127e-03</internalNodes>
+          <leafValues>
+            4.0807429701089859e-02 -1.4469960331916809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5791 3.4473428968340158e-03</internalNodes>
+          <leafValues>
+            -3.9910178631544113e-02 1.5272960066795349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5792 8.9918142184615135e-03</internalNodes>
+          <leafValues>
+            7.1071267127990723e-02 -8.6169913411140442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5793 8.3185202674940228e-04</internalNodes>
+          <leafValues>
+            -2.5739189982414246e-01 1.7941089347004890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5794 -6.8142730742692947e-03</internalNodes>
+          <leafValues>
+            1.3823160529136658e-01 -5.3994540125131607e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5795 2.9746210202574730e-03</internalNodes>
+          <leafValues>
+            -4.1550260037183762e-02 3.9839770644903183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5796 2.5836620479822159e-03</internalNodes>
+          <leafValues>
+            -7.0656493306159973e-02 9.5045506954193115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5797 2.7143809711560607e-04</internalNodes>
+          <leafValues>
+            5.8070071041584015e-02 -1.2781760096549988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5798 3.5418298840522766e-01</internalNodes>
+          <leafValues>
+            5.4909070022404194e-03 -9.7960698604583740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5799 2.5318650528788567e-02</internalNodes>
+          <leafValues>
+            -1.4410969801247120e-02 2.6219129562377930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5800 -2.2658439411316067e-04</internalNodes>
+          <leafValues>
+            5.2997849881649017e-02 -1.1629349738359451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5801 6.8859090097248554e-03</internalNodes>
+          <leafValues>
+            1.6437310725450516e-02 -2.0349490642547607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5802 1.1607459746301174e-02</internalNodes>
+          <leafValues>
+            -3.6651011556386948e-02 1.5184010565280914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5803 -4.8253959976136684e-03</internalNodes>
+          <leafValues>
+            -2.3476150631904602e-01 3.7914011627435684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5804 2.5656020734459162e-03</internalNodes>
+          <leafValues>
+            3.5185638815164566e-02 -1.8540710210800171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5805 1.2601399421691895e-01</internalNodes>
+          <leafValues>
+            -9.8542850464582443e-03 2.5520691275596619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5806 2.7164958883076906e-03</internalNodes>
+          <leafValues>
+            -2.1748440340161324e-02 2.5467529892921448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5807 3.2356029748916626e-01</internalNodes>
+          <leafValues>
+            8.8657345622777939e-03 -7.0383572578430176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5808 -8.4016058826819062e-04</internalNodes>
+          <leafValues>
+            3.6831360310316086e-02 -1.4953260123729706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5809 3.3291990403085947e-03</internalNodes>
+          <leafValues>
+            4.8185840249061584e-02 -1.2290470302104950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5810 2.1130539476871490e-01</internalNodes>
+          <leafValues>
+            6.5245870500802994e-03 -8.8293862342834473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5811 5.0388509407639503e-03</internalNodes>
+          <leafValues>
+            -6.7079946398735046e-02 3.7849709391593933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5812 -2.7862399816513062e-02</internalNodes>
+          <leafValues>
+            3.3469489216804504e-01 -1.8816500902175903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5813 3.8636629469692707e-03</internalNodes>
+          <leafValues>
+            4.3644730001688004e-02 -1.7481489479541779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5814 1.0480300337076187e-01</internalNodes>
+          <leafValues>
+            -1.5737529844045639e-02 4.2094239592552185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5815 -3.4130848944187164e-03</internalNodes>
+          <leafValues>
+            -1.0835570096969604e-01 4.3717790395021439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5816 -4.6396970748901367e-02</internalNodes>
+          <leafValues>
+            -7.5680077075958252e-01 8.6701400578022003e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5817 5.3708078339695930e-03</internalNodes>
+          <leafValues>
+            -4.1797801852226257e-02 1.4824719727039337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5818 -6.1126388609409332e-03</internalNodes>
+          <leafValues>
+            1.8673719465732574e-01 -4.3387491255998611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5819 4.2509321123361588e-02</internalNodes>
+          <leafValues>
+            1.1690679937601089e-02 -4.3740659952163696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5820 1.0473020374774933e-02</internalNodes>
+          <leafValues>
+            4.3143630027770996e-02 -1.5654399991035461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5821 -4.7223959118127823e-02</internalNodes>
+          <leafValues>
+            -7.4483537673950195e-01 3.4918629098683596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5822 5.3090360015630722e-02</internalNodes>
+          <leafValues>
+            1.0408150032162666e-02 -5.3499448299407959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5823 -7.0432561915367842e-04</internalNodes>
+          <leafValues>
+            3.3384170383214951e-02 -7.3706030845642090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5824 7.5942431576550007e-03</internalNodes>
+          <leafValues>
+            -2.9107049107551575e-02 1.9468860328197479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5825 2.2676989436149597e-02</internalNodes>
+          <leafValues>
+            3.3803820610046387e-02 -2.7627611160278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5826 6.6533521749079227e-03</internalNodes>
+          <leafValues>
+            -2.6578240096569061e-02 2.4283319711685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5827 3.7712270859628916e-03</internalNodes>
+          <leafValues>
+            2.6554299518465996e-02 -6.4952917397022247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5828 -2.0740530453622341e-03</internalNodes>
+          <leafValues>
+            -1.7968970537185669e-01 3.1532160937786102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5829 -1.5632519498467445e-03</internalNodes>
+          <leafValues>
+            5.3109679371118546e-02 -8.7415628135204315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5830 1.2540889903903008e-02</internalNodes>
+          <leafValues>
+            -3.4136459231376648e-02 2.2097539901733398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5831 -3.2660199794918299e-03</internalNodes>
+          <leafValues>
+            -5.5261608213186264e-02 3.2669559121131897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5832 -8.2185603678226471e-03</internalNodes>
+          <leafValues>
+            -1.4478379487991333e-01 5.5743928998708725e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5833 -5.5811040103435516e-02</internalNodes>
+          <leafValues>
+            1.7237940430641174e-01 -1.4456519857048988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5834 -1.4723159372806549e-01</internalNodes>
+          <leafValues>
+            -8.1392312049865723e-01 7.4356291443109512e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5835 -5.8468529023230076e-03</internalNodes>
+          <leafValues>
+            -6.9043442606925964e-02 1.9456790760159492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5836 1.9462220370769501e-02</internalNodes>
+          <leafValues>
+            -3.5472229123115540e-02 1.6666300594806671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5837 5.8353468775749207e-02</internalNodes>
+          <leafValues>
+            3.0551329255104065e-03 -3.9289128780364990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5838 4.3785829097032547e-02</internalNodes>
+          <leafValues>
+            1.3574630022048950e-02 -4.6152359247207642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5839 -5.1904350519180298e-02</internalNodes>
+          <leafValues>
+            6.3802438974380493e-01 -9.6664745360612869e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5840 -7.7811058145016432e-04</internalNodes>
+          <leafValues>
+            -9.9303223192691803e-02 5.6094601750373840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5841 4.9657518975436687e-03</internalNodes>
+          <leafValues>
+            4.1419368237257004e-02 -1.1274819821119308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5842 -5.4516079835593700e-03</internalNodes>
+          <leafValues>
+            1.7399060726165771e-01 -4.1147731244564056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5843 5.0428751856088638e-03</internalNodes>
+          <leafValues>
+            -4.1255220770835876e-02 1.3794229924678802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5844 -1.6985220136120915e-03</internalNodes>
+          <leafValues>
+            -2.2874790430068970e-01 2.5274980813264847e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5845 8.2764238119125366e-02</internalNodes>
+          <leafValues>
+            3.3066510222852230e-03 -6.9113439321517944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5846 3.9285849779844284e-03</internalNodes>
+          <leafValues>
+            -7.9043358564376831e-02 6.6218852996826172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5847 -3.0601240694522858e-02</internalNodes>
+          <leafValues>
+            -2.6517450809478760e-01 1.6467850655317307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5848 -1.9941160455346107e-02</internalNodes>
+          <leafValues>
+            1.5431809425354004e-01 -3.6100689321756363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5849 8.0520063638687134e-02</internalNodes>
+          <leafValues>
+            1.7015919089317322e-02 -3.3448880910873413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5850 7.0323847234249115e-02</internalNodes>
+          <leafValues>
+            1.7122440040111542e-02 -3.3302140235900879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5851 -5.2850939333438873e-02</internalNodes>
+          <leafValues>
+            6.2421400099992752e-02 -1.4690199866890907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5852 -7.1594159817323089e-04</internalNodes>
+          <leafValues>
+            -1.1335150152444839e-01 5.2260790020227432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5853 2.1469970047473907e-01</internalNodes>
+          <leafValues>
+            9.9299731664359570e-04 -9.9997580051422119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5854 8.7042592465877533e-02</internalNodes>
+          <leafValues>
+            -1.2329760007560253e-02 5.0260668992996216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5855 -5.8731262106448412e-04</internalNodes>
+          <leafValues>
+            -9.9346466362476349e-02 5.1705610007047653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5856 -4.4215220957994461e-02</internalNodes>
+          <leafValues>
+            -3.9368900656700134e-01 1.3920850120484829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5857 -8.7676227092742920e-02</internalNodes>
+          <leafValues>
+            3.0157440900802612e-01 -6.8702381104230881e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5858 -4.8453990370035172e-02</internalNodes>
+          <leafValues>
+            2.5477871298789978e-01 -2.2457750514149666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5859 -2.1567570511251688e-03</internalNodes>
+          <leafValues>
+            -1.3562899827957153e-01 3.1725399196147919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5860 3.9050900377333164e-03</internalNodes>
+          <leafValues>
+            4.9100890755653381e-02 -1.1861059814691544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5861 -3.9808028377592564e-03</internalNodes>
+          <leafValues>
+            4.8333909362554550e-02 -5.5897079408168793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5862 2.9744929634034634e-03</internalNodes>
+          <leafValues>
+            -6.4802452921867371e-02 9.3583501875400543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5863 2.5875229388475418e-02</internalNodes>
+          <leafValues>
+            1.8487609922885895e-02 -3.3436349034309387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5864 -1.9373580580577254e-03</internalNodes>
+          <leafValues>
+            2.2000649571418762e-01 -2.5404980406165123e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5865 -2.0171629264950752e-02</internalNodes>
+          <leafValues>
+            -7.8228309750556946e-02 4.5462790876626968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5866 -2.6088140904903412e-02</internalNodes>
+          <leafValues>
+            1.7637069523334503e-01 -4.5097298920154572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5867 -2.6868300512433052e-02</internalNodes>
+          <leafValues>
+            -3.2656419277191162e-01 1.7994230613112450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5868 -7.0211151614785194e-04</internalNodes>
+          <leafValues>
+            3.9671998471021652e-02 -1.4533540606498718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5869 8.3507681265473366e-03</internalNodes>
+          <leafValues>
+            -2.3051729425787926e-02 1.8850760161876678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5870 4.6823569573462009e-03</internalNodes>
+          <leafValues>
+            2.9996560886502266e-02 -2.0701029896736145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5871 3.3109660726040602e-03</internalNodes>
+          <leafValues>
+            5.6536730378866196e-02 -1.6835589706897736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5872 7.6425541192293167e-03</internalNodes>
+          <leafValues>
+            -4.1423950344324112e-02 1.2557519972324371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5873 -2.4713110178709030e-03</internalNodes>
+          <leafValues>
+            7.2156153619289398e-02 -1.0767730325460434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5874 -9.9495360627770424e-03</internalNodes>
+          <leafValues>
+            -1.8187619745731354e-01 3.3567231148481369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5875 1.9820800516754389e-03</internalNodes>
+          <leafValues>
+            -5.6488718837499619e-02 1.0741490125656128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5876 2.3254439234733582e-02</internalNodes>
+          <leafValues>
+            -1.6543349251151085e-02 3.6466678977012634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5877 -5.4177921265363693e-02</internalNodes>
+          <leafValues>
+            -1. 3.3418419770896435e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5878 6.1567849479615688e-04</internalNodes>
+          <leafValues>
+            4.0159329771995544e-02 -1.6460220515727997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5879 -4.2699510231614113e-03</internalNodes>
+          <leafValues>
+            -5.6978620588779449e-02 4.4480901211500168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5880 1.9749389030039310e-03</internalNodes>
+          <leafValues>
+            5.9283681213855743e-02 -1.0791260004043579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5881 -5.8583128266036510e-03</internalNodes>
+          <leafValues>
+            1.3734050095081329e-01 -3.4231521189212799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5882 -7.2995189111679792e-04</internalNodes>
+          <leafValues>
+            -1.0075060278177261e-01 5.4733160883188248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5883 -2.9930740594863892e-02</internalNodes>
+          <leafValues>
+            6.3882559537887573e-02 -4.1027020663022995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5884 -5.1738750189542770e-02</internalNodes>
+          <leafValues>
+            -7.2713458538055420e-01 7.4993381276726723e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5885 2.4021189659833908e-02</internalNodes>
+          <leafValues>
+            7.8491801396012306e-03 -5.5794471502304077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5886 -3.7574321031570435e-03</internalNodes>
+          <leafValues>
+            -1.6086879372596741e-01 3.1015990301966667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5887 -6.2635682523250580e-02</internalNodes>
+          <leafValues>
+            9.0577863156795502e-02 -2.9033770784735680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5888 1.9363429397344589e-02</internalNodes>
+          <leafValues>
+            -4.9920588731765747e-02 1.2835779786109924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5889 -3.5072889178991318e-02</internalNodes>
+          <leafValues>
+            2.1391840279102325e-01 -8.8168960064649582e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5890 -1.3243310153484344e-02</internalNodes>
+          <leafValues>
+            2.3349699378013611e-01 -2.3088019341230392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5891 -3.1290829181671143e-02</internalNodes>
+          <leafValues>
+            -6.9495099782943726e-01 9.3020889908075333e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5892 7.2391419671475887e-03</internalNodes>
+          <leafValues>
+            2.8485849499702454e-02 -1.8310770392417908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5893 6.6785318776965141e-03</internalNodes>
+          <leafValues>
+            -4.9132950603961945e-02 5.4181691259145737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5894 -3.6825571209192276e-02</internalNodes>
+          <leafValues>
+            3.3120208978652954e-01 -2.1359929814934731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5895 -4.5507341623306274e-02</internalNodes>
+          <leafValues>
+            -1.2893490493297577e-01 4.9545988440513611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5896 7.7639957889914513e-03</internalNodes>
+          <leafValues>
+            -3.6255620419979095e-02 1.5321409702301025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5897 6.0417611151933670e-02</internalNodes>
+          <leafValues>
+            4.5740022324025631e-03 -6.7541092634201050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5898 2.4624960497021675e-03</internalNodes>
+          <leafValues>
+            5.3674161434173584e-02 -1.1326540261507034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5899 7.3594506829977036e-05</internalNodes>
+          <leafValues>
+            -3.5648930817842484e-02 2.5458969175815582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5900 -4.0958370082080364e-03</internalNodes>
+          <leafValues>
+            1.5562909841537476e-01 -3.9390601217746735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5901 2.8689370083156973e-05</internalNodes>
+          <leafValues>
+            -8.4823302924633026e-02 3.8254238665103912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5902 -4.6220528893172741e-03</internalNodes>
+          <leafValues>
+            -1.8994529545307159e-01 3.3508758991956711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5903 -8.5343196988105774e-03</internalNodes>
+          <leafValues>
+            1.1212539672851562e-01 -3.3968489617109299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5904 -5.8803848922252655e-02</internalNodes>
+          <leafValues>
+            -5.1244312524795532e-01 1.0789549909532070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5905 6.0719929635524750e-02</internalNodes>
+          <leafValues>
+            -1.2555030174553394e-02 2.2509759664535522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5906 1.1038020020350814e-03</internalNodes>
+          <leafValues>
+            -9.6294492483139038e-02 5.6727480143308640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5907 -3.8484560791403055e-03</internalNodes>
+          <leafValues>
+            4.0573459118604660e-02 -2.5326859205961227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5908 -1.0771050117909908e-02</internalNodes>
+          <leafValues>
+            8.8735632598400116e-02 -5.5628679692745209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5909 1.2016809545457363e-02</internalNodes>
+          <leafValues>
+            2.3566279560327530e-02 -2.4590580165386200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5910 -1.1656560236588120e-03</internalNodes>
+          <leafValues>
+            -3.7417300045490265e-02 1.6503289341926575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5911 3.2137628644704819e-02</internalNodes>
+          <leafValues>
+            1.4245970174670219e-02 -2.6480850577354431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5912 2.3331670090556145e-02</internalNodes>
+          <leafValues>
+            -3.5288721323013306e-02 1.8447829782962799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5913 -1.2685320340096951e-02</internalNodes>
+          <leafValues>
+            -1.1757309734821320e-01 1.6436910256743431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5914 7.3903938755393028e-05</internalNodes>
+          <leafValues>
+            -1.0271479934453964e-01 7.4301436543464661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5915 -1.0925470292568207e-01</internalNodes>
+          <leafValues>
+            -8.3165317773818970e-01 5.6438110768795013e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5916 -1.3324350118637085e-01</internalNodes>
+          <leafValues>
+            7.7729821205139160e-01 -8.3403270691633224e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5917 8.9381448924541473e-04</internalNodes>
+          <leafValues>
+            -5.9524301439523697e-02 4.1173089295625687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5918 1.0318649932742119e-02</internalNodes>
+          <leafValues>
+            1.5926430001854897e-02 -3.1637790799140930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5919 -5.2297548390924931e-03</internalNodes>
+          <leafValues>
+            -7.1166560053825378e-02 3.3489290624856949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5920 1.6409620642662048e-02</internalNodes>
+          <leafValues>
+            -2.6454120874404907e-02 1.9589969515800476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5921 1.4068709686398506e-02</internalNodes>
+          <leafValues>
+            -3.9364140480756760e-02 1.3977420330047607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5922 6.6486410796642303e-03</internalNodes>
+          <leafValues>
+            6.4070828258991241e-02 -1.0493399947881699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5923 -1.8030619248747826e-02</internalNodes>
+          <leafValues>
+            8.3942912518978119e-02 -1.3399159535765648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5924 -4.4034369289875031e-02</internalNodes>
+          <leafValues>
+            -5.5825459957122803e-01 9.7633162513375282e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5925 -8.0966893583536148e-03</internalNodes>
+          <leafValues>
+            -2.0489789545536041e-01 2.6520200073719025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5926 5.0180461257696152e-03</internalNodes>
+          <leafValues>
+            -1.1661209911108017e-01 4.5791670680046082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5927 -1.7064629122614861e-02</internalNodes>
+          <leafValues>
+            2.6282730698585510e-01 -2.0390639081597328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5928 7.1850173175334930e-02</internalNodes>
+          <leafValues>
+            -6.9503681734204292e-03 6.7032539844512939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5929 -5.6914370507001877e-02</internalNodes>
+          <leafValues>
+            -1.3477900624275208e-01 1.8399080261588097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5930 -3.2365729566663504e-03</internalNodes>
+          <leafValues>
+            6.9673851132392883e-02 -7.2314530611038208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5931 4.1818909347057343e-02</internalNodes>
+          <leafValues>
+            1.1151459999382496e-02 -5.1680111885070801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5932 -6.1106588691473007e-03</internalNodes>
+          <leafValues>
+            -1.3163940608501434e-01 4.3796509504318237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5933 -3.5560909658670425e-02</internalNodes>
+          <leafValues>
+            6.8005502223968506e-02 -3.6331020295619965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5934 6.8789169192314148e-02</internalNodes>
+          <leafValues>
+            1.4698959887027740e-02 -3.8212299346923828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5935 -7.8313373029232025e-02</internalNodes>
+          <leafValues>
+            2.0296069979667664e-01 -8.6810020729899406e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5936 3.9626220241189003e-03</internalNodes>
+          <leafValues>
+            -3.5797890275716782e-02 1.3905510306358337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5937 -3.3874038606882095e-02</internalNodes>
+          <leafValues>
+            -2.2253429889678955e-01 7.5455638580024242e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5938 -6.4755856990814209e-02</internalNodes>
+          <leafValues>
+            4.7521549463272095e-01 -1.0970680043101311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5939 2.6647940278053284e-02</internalNodes>
+          <leafValues>
+            1.5445309691131115e-02 -2.6785778999328613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5940 -3.0731109902262688e-02</internalNodes>
+          <leafValues>
+            -4.7668689489364624e-01 9.6429884433746338e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5941 -2.4022700265049934e-02</internalNodes>
+          <leafValues>
+            -1.0633960366249084e-01 1.2849040329456329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5942 -1.3036349555477500e-03</internalNodes>
+          <leafValues>
+            7.3524177074432373e-02 -6.8074919283390045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5943 -9.8344050347805023e-03</internalNodes>
+          <leafValues>
+            -1.1843550205230713e-01 4.2866699397563934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5944 8.7102197110652924e-02</internalNodes>
+          <leafValues>
+            -4.0088258683681488e-02 1.7804540693759918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5945 2.0411569625139236e-02</internalNodes>
+          <leafValues>
+            1.6849989071488380e-02 -3.8953658938407898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5946 9.5875263214111328e-02</internalNodes>
+          <leafValues>
+            5.9905550442636013e-03 -8.1525659561157227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5947 6.4893220551311970e-03</internalNodes>
+          <leafValues>
+            -2.4039229378104210e-02 5.3871169686317444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5948 -9.6279237186536193e-04</internalNodes>
+          <leafValues>
+            9.4299189746379852e-02 -6.4436018466949463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5949 -3.7659960798919201e-04</internalNodes>
+          <leafValues>
+            -6.2296878546476364e-02 4.1251849383115768e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5950 6.5272641368210316e-03</internalNodes>
+          <leafValues>
+            5.1325131207704544e-02 -1.3037790358066559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5951 2.1429110318422318e-02</internalNodes>
+          <leafValues>
+            -1.1989659629762173e-02 2.6280459761619568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5952 -5.0938720814883709e-03</internalNodes>
+          <leafValues>
+            6.3418947160243988e-02 -9.0566337108612061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5953 -2.5309680495411158e-03</internalNodes>
+          <leafValues>
+            6.0297761112451553e-02 -2.5049470365047455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5954 -1.5915350522845984e-03</internalNodes>
+          <leafValues>
+            -1.2171190232038498e-01 3.7737991660833359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5955 -3.4030709415674210e-02</internalNodes>
+          <leafValues>
+            4.6413430571556091e-01 -3.5409750416874886e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5956 5.1074200309813023e-03</internalNodes>
+          <leafValues>
+            3.9823830127716064e-02 -1.2645539641380310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5957 -9.6449116244912148e-03</internalNodes>
+          <leafValues>
+            3.3464258909225464e-01 -6.6040740348398685e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5958 1.1422860436141491e-02</internalNodes>
+          <leafValues>
+            -3.6080420017242432e-02 1.3714550435543060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5959 -5.1042139530181885e-03</internalNodes>
+          <leafValues>
+            -9.3986809253692627e-02 2.8844779357314110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5960 -2.6332271099090576e-01</internalNodes>
+          <leafValues>
+            4.9980929493904114e-01 -1.0173249989748001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5961 -2.4556639790534973e-01</internalNodes>
+          <leafValues>
+            -8.1778347492218018e-01 6.9596339017152786e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5962 -2.1419329941272736e-01</internalNodes>
+          <leafValues>
+            -5.1040518283843994e-01 9.4540230929851532e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5963 -1.4363219961524010e-02</internalNodes>
+          <leafValues>
+            -9.1000981628894806e-02 2.4646669626235962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5964 -1.2388969771564007e-03</internalNodes>
+          <leafValues>
+            1.1544570326805115e-01 -4.9565620720386505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5965 2.1015120670199394e-02</internalNodes>
+          <leafValues>
+            -1.7765879631042480e-02 1.9577859342098236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5966 -4.1783051565289497e-03</internalNodes>
+          <leafValues>
+            -1.1172860115766525e-01 4.4625449925661087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5967 2.0896939095109701e-03</internalNodes>
+          <leafValues>
+            -3.3988729119300842e-02 6.5539501607418060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5968 1.6410060226917267e-02</internalNodes>
+          <leafValues>
+            -2.0373269915580750e-02 2.5331538915634155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5969 -6.4266882836818695e-02</internalNodes>
+          <leafValues>
+            -6.5880149602890015e-01 3.4550630953162909e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5970 6.8898178869858384e-04</internalNodes>
+          <leafValues>
+            6.7643247544765472e-02 -8.7556242942810059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5971 5.6662331335246563e-03</internalNodes>
+          <leafValues>
+            3.0638309195637703e-02 -1.1895540356636047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5972 -4.3778121471405029e-02</internalNodes>
+          <leafValues>
+            -2.8309130668640137e-01 1.7713630571961403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5973 3.4748481120914221e-03</internalNodes>
+          <leafValues>
+            -9.5787122845649719e-02 4.2630400508642197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5974 -1.1673940345644951e-02</internalNodes>
+          <leafValues>
+            -1.0502570122480392e-01 5.0903890281915665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5975 -3.4004659391939640e-03</internalNodes>
+          <leafValues>
+            1.0470719635486603e-01 -4.0939141064882278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5976 2.7091780211776495e-03</internalNodes>
+          <leafValues>
+            -6.0524601489305496e-02 1.3978950679302216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5977 -1.7439300194382668e-02</internalNodes>
+          <leafValues>
+            -3.2391169667243958e-01 1.4630249701440334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5978 -1.2598330155014992e-02</internalNodes>
+          <leafValues>
+            -2.0682629942893982e-01 2.5501869618892670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5979 1.8755869939923286e-02</internalNodes>
+          <leafValues>
+            -4.7925960272550583e-02 1.0864380002021790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5980 -4.2074159719049931e-03</internalNodes>
+          <leafValues>
+            -8.2077808678150177e-02 6.3647769391536713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5981 -1.6427719674538821e-04</internalNodes>
+          <leafValues>
+            1.0120390355587006e-01 -3.4067928791046143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5982 4.3847691267728806e-02</internalNodes>
+          <leafValues>
+            6.0980222187936306e-03 -8.3685982227325439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5983 -3.9284680038690567e-02</internalNodes>
+          <leafValues>
+            2.8250560164451599e-01 -2.2389259189367294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5984 3.8550909608602524e-02</internalNodes>
+          <leafValues>
+            1.5570489689707756e-02 -3.3978620171546936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5985 -6.9177031517028809e-02</internalNodes>
+          <leafValues>
+            1.2258320301771164e-01 -1.7850179225206375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5986 -1.9251030171290040e-03</internalNodes>
+          <leafValues>
+            -1.0687749832868576e-01 4.6379510313272476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5987 -8.6635202169418335e-03</internalNodes>
+          <leafValues>
+            9.6412748098373413e-02 -1.7563249915838242e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5988 1.3393509387969971e-01</internalNodes>
+          <leafValues>
+            6.3692941330373287e-03 -7.0170587301254272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5989 4.1082348674535751e-02</internalNodes>
+          <leafValues>
+            -1.1077569797635078e-02 1.3463750481605530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5990 1.4911450445652008e-01</internalNodes>
+          <leafValues>
+            9.5263421535491943e-03 -5.0872552394866943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5991 -5.2500818856060505e-03</internalNodes>
+          <leafValues>
+            7.0025578141212463e-02 -4.2880270630121231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5992 2.2823570296168327e-02</internalNodes>
+          <leafValues>
+            -4.1884049773216248e-02 1.1770319938659668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5993 -8.5306530818343163e-03</internalNodes>
+          <leafValues>
+            6.1222139745950699e-02 -2.4944549426436424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5994 1.1971729807555676e-02</internalNodes>
+          <leafValues>
+            3.9662770926952362e-02 -1.6267740726470947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5995 -3.8938269019126892e-02</internalNodes>
+          <leafValues>
+            2.5743520259857178e-01 -1.6356239095330238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5996 -2.1706389263272285e-02</internalNodes>
+          <leafValues>
+            -3.1998679041862488e-01 1.7135290428996086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5997 6.6900630481541157e-03</internalNodes>
+          <leafValues>
+            2.6101849973201752e-02 -1.0980729758739471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5998 -7.2270832955837250e-02</internalNodes>
+          <leafValues>
+            1.9431130588054657e-01 -2.6044359430670738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5999 -6.7073688842356205e-03</internalNodes>
+          <leafValues>
+            -1.7747850716114044e-01 4.5862998813390732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6000 5.5019360035657883e-02</internalNodes>
+          <leafValues>
+            -8.3471573889255524e-03 6.0511541366577148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6001 1.3142649829387665e-01</internalNodes>
+          <leafValues>
+            -5.7535418309271336e-03 2.9167538881301880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6002 -1.6564460238441825e-03</internalNodes>
+          <leafValues>
+            7.0003032684326172e-02 -6.2690876424312592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6003 1.5445409715175629e-01</internalNodes>
+          <leafValues>
+            6.1896732077002525e-03 -7.4323302507400513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6004 -5.0357519648969173e-03</internalNodes>
+          <leafValues>
+            -1.1333289742469788e-01 3.8741771131753922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6005 2.2772569209337234e-03</internalNodes>
+          <leafValues>
+            -1.1340530216693878e-01 2.1319400519132614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6006 3.3173530828207731e-03</internalNodes>
+          <leafValues>
+            4.4273331761360168e-02 -1.0459829866886139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6007 -2.9692800715565681e-02</internalNodes>
+          <leafValues>
+            9.2483766376972198e-02 -2.3342609405517578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6008 6.2937840819358826e-02</internalNodes>
+          <leafValues>
+            -1.2998280115425587e-02 3.8887938857078552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6009 3.6641359329223633e-03</internalNodes>
+          <leafValues>
+            3.2099820673465729e-02 -3.9647988975048065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6010 4.4782999902963638e-03</internalNodes>
+          <leafValues>
+            -4.5701328665018082e-02 1.0697010159492493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6011 1.8147319788113236e-03</internalNodes>
+          <leafValues>
+            -3.2871820032596588e-02 1.0647939890623093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6012 4.8941639252007008e-03</internalNodes>
+          <leafValues>
+            2.7911009266972542e-02 -2.1725590527057648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6013 -4.4425828382372856e-03</internalNodes>
+          <leafValues>
+            -1.3470150530338287e-01 1.0781410150229931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6014 -2.5493400171399117e-02</internalNodes>
+          <leafValues>
+            6.8371468782424927e-01 -7.7452720142900944e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6015 2.7835449203848839e-02</internalNodes>
+          <leafValues>
+            2.4144299328327179e-02 -1.5170599520206451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6016 7.5548859313130379e-03</internalNodes>
+          <leafValues>
+            -4.7643400728702545e-02 1.1925770342350006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6017 1.0329609736800194e-02</internalNodes>
+          <leafValues>
+            1.8646810203790665e-02 -1.6122570633888245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6018 -1.2393389828503132e-02</internalNodes>
+          <leafValues>
+            6.0304921865463257e-01 -7.7566630207002163e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6019 1.3833769597113132e-02</internalNodes>
+          <leafValues>
+            -2.7617299929261208e-02 5.1266878843307495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6020 -2.5669319555163383e-02</internalNodes>
+          <leafValues>
+            2.3801359534263611e-01 -2.3971909657120705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6021 -5.2043660543859005e-03</internalNodes>
+          <leafValues>
+            -1.0721790045499802e-01 2.6645049452781677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6022 3.4628969151526690e-03</internalNodes>
+          <leafValues>
+            5.4313410073518753e-02 -1.3458320498466492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6023 -1.9220679998397827e-02</internalNodes>
+          <leafValues>
+            7.2996392846107483e-02 -4.0652111172676086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6024 -2.5009829550981522e-03</internalNodes>
+          <leafValues>
+            -7.7671296894550323e-02 5.9096541255712509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6025 -8.5285156965255737e-03</internalNodes>
+          <leafValues>
+            4.9050811678171158e-02 -6.4078353345394135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6026 4.3327538296580315e-03</internalNodes>
+          <leafValues>
+            2.5221010670065880e-02 -1.9358980655670166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6027 3.6595970392227173e-02</internalNodes>
+          <leafValues>
+            -1.6262590885162354e-02 1.5651239454746246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6028 -1.1795730097219348e-03</internalNodes>
+          <leafValues>
+            -7.2468072175979614e-02 7.0449486374855042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6029 -1.3975829817354679e-02</internalNodes>
+          <leafValues>
+            -1.1789470165967941e-01 2.1292049437761307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6030 -1.3828700175508857e-03</internalNodes>
+          <leafValues>
+            7.9283542931079865e-02 -9.5104120671749115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6031 -2.9435830656439066e-03</internalNodes>
+          <leafValues>
+            7.0368431508541107e-02 -3.3217910677194595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6032 9.5262555405497551e-03</internalNodes>
+          <leafValues>
+            -2.9733620584011078e-02 1.6670459508895874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6033 -9.0114273130893707e-02</internalNodes>
+          <leafValues>
+            -1.6625370085239410e-01 8.6199166253209114e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6034 -1.2089919764548540e-03</internalNodes>
+          <leafValues>
+            8.1083856523036957e-02 -7.3029123246669769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6035 -1.4199960231781006e-01</internalNodes>
+          <leafValues>
+            -1. 2.2284830920398235e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6036 8.0690719187259674e-03</internalNodes>
+          <leafValues>
+            4.7412220388650894e-02 -1.0178930312395096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6037 -4.7410889528691769e-03</internalNodes>
+          <leafValues>
+            1.2051119655370712e-01 -4.9957480281591415e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6038 -1.6977200284600258e-03</internalNodes>
+          <leafValues>
+            -2.4171440303325653e-01 1.9534369930624962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6039 -2.8892089612782001e-03</internalNodes>
+          <leafValues>
+            2.5727990269660950e-01 -1.1625059880316257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6040 -1.5177440363913774e-03</internalNodes>
+          <leafValues>
+            -9.8784193396568298e-02 4.6706128865480423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6041 1.4197319746017456e-01</internalNodes>
+          <leafValues>
+            -2.5096370372921228e-03 7.5450611114501953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6042 9.7517937421798706e-02</internalNodes>
+          <leafValues>
+            -6.9059049710631371e-03 6.5184432268142700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6043 1.3567379675805569e-02</internalNodes>
+          <leafValues>
+            -7.6325193047523499e-02 8.8054582476615906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6044 8.0981463193893433e-02</internalNodes>
+          <leafValues>
+            1.5558109618723392e-02 -3.4601628780364990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6045 -4.7192731872200966e-03</internalNodes>
+          <leafValues>
+            8.1620022654533386e-02 -4.6072289347648621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6046 2.0368969999253750e-03</internalNodes>
+          <leafValues>
+            -4.4817630201578140e-02 1.2861390411853790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6047 -1.7878509825095534e-03</internalNodes>
+          <leafValues>
+            4.3731331825256348e-02 -4.4995948672294617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6048 -7.1685528382658958e-03</internalNodes>
+          <leafValues>
+            -1.3597999513149261e-01 3.8796991109848022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6049 -6.7460887134075165e-02</internalNodes>
+          <leafValues>
+            -2.9265740513801575e-01 3.5135280340909958e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6050 -1.5598500147461891e-02</internalNodes>
+          <leafValues>
+            2.3105660080909729e-01 -2.2405069321393967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6051 -2.1026479080319405e-02</internalNodes>
+          <leafValues>
+            -1.5283830463886261e-01 3.1531449407339096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6052 -1.0558360069990158e-01</internalNodes>
+          <leafValues>
+            -6.8366038799285889e-01 6.8997950293123722e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6053 -3.6966579500585794e-03</internalNodes>
+          <leafValues>
+            3.4315150231122971e-02 -4.8922799527645111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6054 -6.0826627304777503e-04</internalNodes>
+          <leafValues>
+            -5.2638430148363113e-02 8.9546948671340942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6055 -2.8936540707945824e-02</internalNodes>
+          <leafValues>
+            4.1818480938673019e-02 -1.3818169943988323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6056 -5.8082528412342072e-03</internalNodes>
+          <leafValues>
+            6.7874796688556671e-02 -8.5578799247741699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6057 -4.6095378696918488e-02</internalNodes>
+          <leafValues>
+            -1.2584780156612396e-01 2.0466970279812813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6058 5.2972920238971710e-02</internalNodes>
+          <leafValues>
+            -1.2453259900212288e-02 3.4565049409866333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6059 4.9351599067449570e-02</internalNodes>
+          <leafValues>
+            1.0901239700615406e-02 -4.8506981134414673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6060 4.4377800077199936e-02</internalNodes>
+          <leafValues>
+            9.9294837564229965e-03 -4.3877899646759033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6061 -1.1464890092611313e-01</internalNodes>
+          <leafValues>
+            2.6874598860740662e-01 -9.2000560835003853e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6062 1.6887830197811127e-01</internalNodes>
+          <leafValues>
+            5.7101310230791569e-03 -8.5972881317138672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6063 5.1198098808526993e-02</internalNodes>
+          <leafValues>
+            -8.5723921656608582e-03 1.3395169377326965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6064 -3.0789880547672510e-03</internalNodes>
+          <leafValues>
+            -1.0338760167360306e-01 4.3459478765726089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6065 4.7223128378391266e-02</internalNodes>
+          <leafValues>
+            8.1934239715337753e-03 -4.3803408741950989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6066 -7.6270569115877151e-03</internalNodes>
+          <leafValues>
+            1.8713890016078949e-01 -2.4660250172019005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6067 5.4106907919049263e-03</internalNodes>
+          <leafValues>
+            4.1099831461906433e-02 -7.8868232667446136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6068 -1.4900229871273041e-03</internalNodes>
+          <leafValues>
+            -2.0115040242671967e-01 3.1898159533739090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6069 -8.3831608295440674e-02</internalNodes>
+          <leafValues>
+            5.8017939329147339e-01 -5.2973427809774876e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6070 6.2233800999820232e-03</internalNodes>
+          <leafValues>
+            -3.9786059409379959e-02 1.2283950299024582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6071 1.1475080251693726e-01</internalNodes>
+          <leafValues>
+            -1.1975419707596302e-02 2.1586710214614868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6072 -1.5253260498866439e-03</internalNodes>
+          <leafValues>
+            1.3804529607295990e-01 -3.9941880851984024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6073 -5.2878521382808685e-03</internalNodes>
+          <leafValues>
+            -1.2790650129318237e-01 3.2893560826778412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6074 8.9670647867023945e-04</internalNodes>
+          <leafValues>
+            -1.2481059879064560e-01 4.4544249773025513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6075 3.8421660661697388e-02</internalNodes>
+          <leafValues>
+            7.7155791223049164e-03 -6.5575468540191650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6076 -9.3785318313166499e-04</internalNodes>
+          <leafValues>
+            5.5608510971069336e-02 -8.9876912534236908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6077 1.9965849351137877e-03</internalNodes>
+          <leafValues>
+            -2.5297610089182854e-02 1.9413180649280548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6078 4.5782068627886474e-04</internalNodes>
+          <leafValues>
+            3.9089199155569077e-02 -1.2908570468425751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6079 3.8373940624296665e-03</internalNodes>
+          <leafValues>
+            -2.8748869895935059e-02 1.9429750740528107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6080 3.7142829387448728e-04</internalNodes>
+          <leafValues>
+            3.8272358477115631e-02 -1.3759189844131470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6081 7.5116259977221489e-03</internalNodes>
+          <leafValues>
+            -1.4461129903793335e-02 1.2656949460506439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6082 -5.0362840294837952e-02</internalNodes>
+          <leafValues>
+            3.5183578729629517e-01 -1.4051860198378563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6083 3.9921641349792480e-02</internalNodes>
+          <leafValues>
+            2.7280429378151894e-02 -1.9958199560642242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6084 2.2605259716510773e-01</internalNodes>
+          <leafValues>
+            -6.8001961335539818e-03 7.3006898164749146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6085 1.1081779748201370e-01</internalNodes>
+          <leafValues>
+            4.3370737694203854e-03 -8.6829161643981934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6086 -9.7494889050722122e-03</internalNodes>
+          <leafValues>
+            -6.3740663230419159e-02 8.4537997841835022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6087 -2.2887689992785454e-03</internalNodes>
+          <leafValues>
+            9.9654018878936768e-02 -4.1565418243408203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6088 2.0008319988846779e-03</internalNodes>
+          <leafValues>
+            -5.5650699883699417e-02 1.0709869861602783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6089 -1.5160050243139267e-02</internalNodes>
+          <leafValues>
+            -1.4098760485649109e-01 3.8741599768400192e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6090 -6.3132969662547112e-03</internalNodes>
+          <leafValues>
+            -1. 4.4605308212339878e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6091 -1.3970009982585907e-02</internalNodes>
+          <leafValues>
+            1.2481089681386948e-01 -2.1425830200314522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6092 -4.4321279972791672e-02</internalNodes>
+          <leafValues>
+            -5.3340071439743042e-01 1.0165239684283733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6093 1.4885979471728206e-03</internalNodes>
+          <leafValues>
+            -4.8868600279092789e-02 3.6077901721000671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6094 6.5139681100845337e-02</internalNodes>
+          <leafValues>
+            7.6331058517098427e-03 -5.8781641721725464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6095 -2.0741410553455353e-02</internalNodes>
+          <leafValues>
+            -2.9658278822898865e-01 1.8622800707817078e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>394</maxWeakCount>
+      <stageThreshold>-1.2940989732742310e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 6096 1.9188739359378815e-02</internalNodes>
+          <leafValues>
+            -2.1150399744510651e-01 1.3286529481410980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6097 -8.1222038716077805e-03</internalNodes>
+          <leafValues>
+            9.2491082847118378e-02 -1.7585119605064392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6098 1.5851219650357962e-03</internalNodes>
+          <leafValues>
+            -2.8565698862075806e-01 6.6710568964481354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6099 -4.3140850029885769e-03</internalNodes>
+          <leafValues>
+            -1.3885229825973511e-01 5.2694689482450485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6100 -1.7131429631263018e-03</internalNodes>
+          <leafValues>
+            1.3135610520839691e-01 -1.3149109482765198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6101 6.8447366356849670e-02</internalNodes>
+          <leafValues>
+            9.3052154406905174e-03 -2.5063261389732361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6102 -2.4445978924632072e-03</internalNodes>
+          <leafValues>
+            -1.7205530405044556e-01 9.8322823643684387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6103 1.0310600046068430e-03</internalNodes>
+          <leafValues>
+            2.3039160296320915e-02 -2.7527621388435364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6104 7.4603251414373517e-04</internalNodes>
+          <leafValues>
+            -2.3276780545711517e-01 5.2693009376525879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6105 -6.6399492789059877e-04</internalNodes>
+          <leafValues>
+            6.8990781903266907e-02 -8.4687709808349609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6106 -4.0997468749992549e-04</internalNodes>
+          <leafValues>
+            1.0501380264759064e-01 -1.0819009691476822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6107 -1.8094549886882305e-03</internalNodes>
+          <leafValues>
+            -1.8178839981555939e-01 4.4184140861034393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6108 9.3385757645592093e-04</internalNodes>
+          <leafValues>
+            -1.4622689783573151e-01 7.2726443409919739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6109 -3.8197741378098726e-04</internalNodes>
+          <leafValues>
+            2.4009939283132553e-02 -1.7295800149440765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6110 -1.4950280310586095e-03</internalNodes>
+          <leafValues>
+            -1.9403380155563354e-01 4.8807919025421143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6111 -1.0159100405871868e-02</internalNodes>
+          <leafValues>
+            1.9173899292945862e-01 -5.2749071270227432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6112 5.9903519286308438e-05</internalNodes>
+          <leafValues>
+            -1.0791549831628799e-01 9.0988166630268097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6113 -3.1967550516128540e-02</internalNodes>
+          <leafValues>
+            4.1109889745712280e-01 -2.2650640457868576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6114 1.4343270100653172e-02</internalNodes>
+          <leafValues>
+            2.4315539747476578e-02 -4.2680150270462036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6115 1.1039529927074909e-02</internalNodes>
+          <leafValues>
+            -6.2717013061046600e-02 1.1330530047416687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6116 -8.4228850901126862e-03</internalNodes>
+          <leafValues>
+            -2.1369309723377228e-01 4.2059201747179031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6117 -2.0549839362502098e-02</internalNodes>
+          <leafValues>
+            1.5161630511283875e-01 -2.4594139307737350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6118 -6.5411031246185303e-03</internalNodes>
+          <leafValues>
+            1.4883629977703094e-01 -6.1179339885711670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6119 -1.3324400410056114e-02</internalNodes>
+          <leafValues>
+            -2.0791970193386078e-01 4.8333309590816498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6120 7.0111267268657684e-02</internalNodes>
+          <leafValues>
+            -2.6863219216465950e-02 3.6322259902954102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6121 -2.6973750209435821e-04</internalNodes>
+          <leafValues>
+            6.0876660048961639e-02 -1.1272370070219040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6122 -1.3509000418707728e-03</internalNodes>
+          <leafValues>
+            -1.8552079796791077e-01 5.2154958248138428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6123 -2.8083190321922302e-02</internalNodes>
+          <leafValues>
+            3.5111880302429199e-01 -2.3596329614520073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6124 -1.0003290139138699e-02</internalNodes>
+          <leafValues>
+            -2.9058480262756348e-01 3.2125689089298248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6125 -1.6111029544845223e-03</internalNodes>
+          <leafValues>
+            9.8113670945167542e-02 -5.2203711122274399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6126 -1.8411900848150253e-02</internalNodes>
+          <leafValues>
+            -1.8082669377326965e-01 5.4536700248718262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6127 -7.1738816797733307e-02</internalNodes>
+          <leafValues>
+            -7.6654988527297974e-01 3.3518690615892410e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6128 -2.7943260502070189e-03</internalNodes>
+          <leafValues>
+            1.5871369838714600e-01 -6.4271800220012665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6129 -1.6874749958515167e-01</internalNodes>
+          <leafValues>
+            -6.9956189393997192e-01 4.8861699178814888e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6130 -1.2672400334849954e-03</internalNodes>
+          <leafValues>
+            3.1616039574146271e-02 -2.4953269958496094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6131 2.0807750523090363e-02</internalNodes>
+          <leafValues>
+            1.7053410410881042e-02 -2.4331410229206085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6132 -1.5869849594309926e-03</internalNodes>
+          <leafValues>
+            9.3171089887619019e-02 -8.1361927092075348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6133 -1.0014690458774567e-02</internalNodes>
+          <leafValues>
+            -2.7789619565010071e-01 2.6569239795207977e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6134 -5.7948171161115170e-03</internalNodes>
+          <leafValues>
+            -2.2287739813327789e-01 3.5975661128759384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6135 2.7189950924366713e-03</internalNodes>
+          <leafValues>
+            -9.0631909668445587e-02 5.6820400059223175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6136 3.8845159113407135e-02</internalNodes>
+          <leafValues>
+            1.2280859984457493e-02 -5.8521348237991333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6137 -1.4158680103719234e-02</internalNodes>
+          <leafValues>
+            1.8153870105743408e-01 -3.1109429895877838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6138 -1.8278600275516510e-01</internalNodes>
+          <leafValues>
+            -9.0013808012008667e-01 7.6544750481843948e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6139 2.7588419616222382e-02</internalNodes>
+          <leafValues>
+            -1.2460039928555489e-02 2.0069369673728943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6140 -1.4784430153667927e-02</internalNodes>
+          <leafValues>
+            -8.9910492300987244e-02 8.1648677587509155e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6141 1.1625719815492630e-01</internalNodes>
+          <leafValues>
+            2.3692469112575054e-03 -9.9998068809509277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6142 3.5341090988367796e-03</internalNodes>
+          <leafValues>
+            -6.1760541051626205e-02 1.3490639626979828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6143 5.1878788508474827e-03</internalNodes>
+          <leafValues>
+            1.8745860084891319e-02 -1.7449170351028442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6144 7.9457357525825500e-02</internalNodes>
+          <leafValues>
+            -2.3402990773320198e-02 3.3502200245857239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6145 2.7684379369020462e-02</internalNodes>
+          <leafValues>
+            2.3663910105824471e-02 -3.3256360888481140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6146 -4.4806320220232010e-03</internalNodes>
+          <leafValues>
+            -1.4658750593662262e-01 4.7376811504364014e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6147 5.6939688511192799e-03</internalNodes>
+          <leafValues>
+            -5.6776121258735657e-02 6.7580856382846832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6148 7.7299480326473713e-03</internalNodes>
+          <leafValues>
+            -3.1156649813055992e-02 2.3102590441703796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6149 3.9786100387573242e-03</internalNodes>
+          <leafValues>
+            -5.6882441043853760e-02 1.3271529972553253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6150 -1.1275880038738251e-02</internalNodes>
+          <leafValues>
+            -2.0938649773597717e-01 3.5291459411382675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6151 -2.4308220017701387e-03</internalNodes>
+          <leafValues>
+            -2.0176360011100769e-01 3.4513931721448898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6152 5.7369591668248177e-03</internalNodes>
+          <leafValues>
+            -5.5607158690690994e-02 1.1532089859247208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6153 4.6170800924301147e-03</internalNodes>
+          <leafValues>
+            -5.6083500385284424e-02 8.1762917339801788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6154 -4.7089671716094017e-03</internalNodes>
+          <leafValues>
+            -1.3351219892501831e-01 5.6296080350875854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6155 -3.2688070088624954e-02</internalNodes>
+          <leafValues>
+            2.7922388911247253e-01 -1.0867659933865070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6156 8.8686197996139526e-02</internalNodes>
+          <leafValues>
+            1.8268220126628876e-02 -3.5637390613555908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6157 4.5751677826046944e-03</internalNodes>
+          <leafValues>
+            -5.1558461040258408e-02 6.3948810100555420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6158 4.9765850417315960e-03</internalNodes>
+          <leafValues>
+            -5.4684590548276901e-02 1.1907110363245010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6159 -6.4881290309131145e-03</internalNodes>
+          <leafValues>
+            -9.9121123552322388e-02 2.6508849114179611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6160 2.4523450993001461e-03</internalNodes>
+          <leafValues>
+            -9.5045946538448334e-02 6.6802926361560822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6161 7.0354789495468140e-03</internalNodes>
+          <leafValues>
+            1.0705590248107910e-01 -6.2395099550485611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6162 4.2746789753437042e-02</internalNodes>
+          <leafValues>
+            -1.6092179343104362e-02 4.3256199359893799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6163 -4.5301730278879404e-04</internalNodes>
+          <leafValues>
+            3.6420568823814392e-02 -9.9322892725467682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6164 -5.2631930448114872e-03</internalNodes>
+          <leafValues>
+            -1.1416749656200409e-01 5.7260219007730484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6165 1.0581909446045756e-03</internalNodes>
+          <leafValues>
+            3.3220488578081131e-02 -1.1831220239400864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6166 2.5088949128985405e-02</internalNodes>
+          <leafValues>
+            -6.0655020177364349e-02 1.2601740658283234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6167 2.4252159893512726e-01</internalNodes>
+          <leafValues>
+            2.2060840856283903e-03 -1.0000120401382446e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6168 -1.4393079280853271e-01</internalNodes>
+          <leafValues>
+            3.7419798970222473e-01 -2.2252110764384270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6169 -6.0972762294113636e-03</internalNodes>
+          <leafValues>
+            -1.1038099974393845e-01 4.5996960252523422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6170 6.1375470831990242e-03</internalNodes>
+          <leafValues>
+            3.8307808339595795e-02 -1.8086770176887512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6171 -3.6617079749703407e-03</internalNodes>
+          <leafValues>
+            3.8439918309450150e-02 -6.2540791928768158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6172 -1.5854850411415100e-01</internalNodes>
+          <leafValues>
+            3.4469398856163025e-01 -1.9837500527501106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6173 6.7219287157058716e-02</internalNodes>
+          <leafValues>
+            9.5165139064192772e-03 -5.0206458568572998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6174 2.2499680053442717e-03</internalNodes>
+          <leafValues>
+            -1.3063929975032806e-01 6.4832933247089386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6175 8.4626786410808563e-02</internalNodes>
+          <leafValues>
+            5.9339799918234348e-03 -4.1516590118408203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6176 -9.5411221263930202e-04</internalNodes>
+          <leafValues>
+            -9.3790747225284576e-02 7.5486607849597931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6177 -7.6813949272036552e-03</internalNodes>
+          <leafValues>
+            -1.4821960031986237e-01 2.9010580852627754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6178 -2.5593319907784462e-02</internalNodes>
+          <leafValues>
+            1.4859579503536224e-01 -4.7195930033922195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6179 2.1508369594812393e-02</internalNodes>
+          <leafValues>
+            2.3782620206475258e-02 -9.6659287810325623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6180 3.4463100135326385e-02</internalNodes>
+          <leafValues>
+            -3.7410069257020950e-02 2.2015300393104553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6181 -3.7860300391912460e-02</internalNodes>
+          <leafValues>
+            -5.0047469139099121e-01 1.4059869572520256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6182 1.2028450146317482e-03</internalNodes>
+          <leafValues>
+            -6.5087057650089264e-02 8.9583486318588257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6183 1.6753520816564560e-02</internalNodes>
+          <leafValues>
+            4.9179811030626297e-03 -4.3030908703804016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6184 1.6640779795125127e-03</internalNodes>
+          <leafValues>
+            4.0807429701089859e-02 -1.4469960331916809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6185 3.4473428968340158e-03</internalNodes>
+          <leafValues>
+            -3.9910178631544113e-02 1.5272960066795349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6186 8.9918142184615135e-03</internalNodes>
+          <leafValues>
+            7.1071267127990723e-02 -8.6169913411140442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6187 8.3185202674940228e-04</internalNodes>
+          <leafValues>
+            -2.5739189982414246e-01 1.7941089347004890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6188 -6.8142730742692947e-03</internalNodes>
+          <leafValues>
+            1.3823160529136658e-01 -5.3994540125131607e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6189 2.9746210202574730e-03</internalNodes>
+          <leafValues>
+            -4.1550260037183762e-02 3.9839770644903183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6190 2.5836620479822159e-03</internalNodes>
+          <leafValues>
+            -7.0656493306159973e-02 9.5045506954193115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6191 2.7143809711560607e-04</internalNodes>
+          <leafValues>
+            5.8070071041584015e-02 -1.2781760096549988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6192 3.5418298840522766e-01</internalNodes>
+          <leafValues>
+            5.4909070022404194e-03 -9.7960698604583740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6193 2.5318650528788567e-02</internalNodes>
+          <leafValues>
+            -1.4410969801247120e-02 2.6219129562377930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6194 -2.2658439411316067e-04</internalNodes>
+          <leafValues>
+            5.2997849881649017e-02 -1.1629349738359451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6195 6.8859090097248554e-03</internalNodes>
+          <leafValues>
+            1.6437310725450516e-02 -2.0349490642547607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6196 1.1607459746301174e-02</internalNodes>
+          <leafValues>
+            -3.6651011556386948e-02 1.5184010565280914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6197 -4.8253959976136684e-03</internalNodes>
+          <leafValues>
+            -2.3476150631904602e-01 3.7914011627435684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6198 2.5656020734459162e-03</internalNodes>
+          <leafValues>
+            3.5185638815164566e-02 -1.8540710210800171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6199 1.2601399421691895e-01</internalNodes>
+          <leafValues>
+            -9.8542850464582443e-03 2.5520691275596619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6200 2.7164958883076906e-03</internalNodes>
+          <leafValues>
+            -2.1748440340161324e-02 2.5467529892921448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6201 3.2356029748916626e-01</internalNodes>
+          <leafValues>
+            8.8657345622777939e-03 -7.0383572578430176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6202 -8.4016058826819062e-04</internalNodes>
+          <leafValues>
+            3.6831360310316086e-02 -1.4953260123729706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6203 3.3291990403085947e-03</internalNodes>
+          <leafValues>
+            4.8185840249061584e-02 -1.2290470302104950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6204 2.1130539476871490e-01</internalNodes>
+          <leafValues>
+            6.5245870500802994e-03 -8.8293862342834473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6205 5.0388509407639503e-03</internalNodes>
+          <leafValues>
+            -6.7079946398735046e-02 3.7849709391593933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6206 -2.7862399816513062e-02</internalNodes>
+          <leafValues>
+            3.3469489216804504e-01 -1.8816500902175903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6207 3.8636629469692707e-03</internalNodes>
+          <leafValues>
+            4.3644730001688004e-02 -1.7481489479541779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6208 1.0480300337076187e-01</internalNodes>
+          <leafValues>
+            -1.5737529844045639e-02 4.2094239592552185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6209 -3.4130848944187164e-03</internalNodes>
+          <leafValues>
+            -1.0835570096969604e-01 4.3717790395021439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6210 -4.6396970748901367e-02</internalNodes>
+          <leafValues>
+            -7.5680077075958252e-01 8.6701400578022003e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6211 5.3708078339695930e-03</internalNodes>
+          <leafValues>
+            -4.1797801852226257e-02 1.4824719727039337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6212 -6.1126388609409332e-03</internalNodes>
+          <leafValues>
+            1.8673719465732574e-01 -4.3387491255998611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6213 4.2509321123361588e-02</internalNodes>
+          <leafValues>
+            1.1690679937601089e-02 -4.3740659952163696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6214 1.0473020374774933e-02</internalNodes>
+          <leafValues>
+            4.3143630027770996e-02 -1.5654399991035461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6215 -4.7223959118127823e-02</internalNodes>
+          <leafValues>
+            -7.4483537673950195e-01 3.4918629098683596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6216 5.3090360015630722e-02</internalNodes>
+          <leafValues>
+            1.0408150032162666e-02 -5.3499448299407959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6217 -7.0432561915367842e-04</internalNodes>
+          <leafValues>
+            3.3384170383214951e-02 -7.3706030845642090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6218 7.5942431576550007e-03</internalNodes>
+          <leafValues>
+            -2.9107049107551575e-02 1.9468860328197479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6219 2.2676989436149597e-02</internalNodes>
+          <leafValues>
+            3.3803820610046387e-02 -2.7627611160278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6220 6.6533521749079227e-03</internalNodes>
+          <leafValues>
+            -2.6578240096569061e-02 2.4283319711685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6221 3.7712270859628916e-03</internalNodes>
+          <leafValues>
+            2.6554299518465996e-02 -6.4952917397022247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6222 -2.0740530453622341e-03</internalNodes>
+          <leafValues>
+            -1.7968970537185669e-01 3.1532160937786102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6223 -1.5632519498467445e-03</internalNodes>
+          <leafValues>
+            5.3109679371118546e-02 -8.7415628135204315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6224 1.2540889903903008e-02</internalNodes>
+          <leafValues>
+            -3.4136459231376648e-02 2.2097539901733398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6225 -3.2660199794918299e-03</internalNodes>
+          <leafValues>
+            -5.5261608213186264e-02 3.2669559121131897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6226 -8.2185603678226471e-03</internalNodes>
+          <leafValues>
+            -1.4478379487991333e-01 5.5743928998708725e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6227 -5.5811040103435516e-02</internalNodes>
+          <leafValues>
+            1.7237940430641174e-01 -1.4456519857048988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6228 -1.4723159372806549e-01</internalNodes>
+          <leafValues>
+            -8.1392312049865723e-01 7.4356291443109512e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6229 -5.8468529023230076e-03</internalNodes>
+          <leafValues>
+            -6.9043442606925964e-02 1.9456790760159492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6230 1.9462220370769501e-02</internalNodes>
+          <leafValues>
+            -3.5472229123115540e-02 1.6666300594806671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6231 5.8353468775749207e-02</internalNodes>
+          <leafValues>
+            3.0551329255104065e-03 -3.9289128780364990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6232 4.3785829097032547e-02</internalNodes>
+          <leafValues>
+            1.3574630022048950e-02 -4.6152359247207642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6233 -5.1904350519180298e-02</internalNodes>
+          <leafValues>
+            6.3802438974380493e-01 -9.6664745360612869e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6234 -7.7811058145016432e-04</internalNodes>
+          <leafValues>
+            -9.9303223192691803e-02 5.6094601750373840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6235 4.9657518975436687e-03</internalNodes>
+          <leafValues>
+            4.1419368237257004e-02 -1.1274819821119308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6236 -5.4516079835593700e-03</internalNodes>
+          <leafValues>
+            1.7399060726165771e-01 -4.1147731244564056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6237 5.0428751856088638e-03</internalNodes>
+          <leafValues>
+            -4.1255220770835876e-02 1.3794229924678802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6238 -1.6985220136120915e-03</internalNodes>
+          <leafValues>
+            -2.2874790430068970e-01 2.5274980813264847e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6239 8.2764238119125366e-02</internalNodes>
+          <leafValues>
+            3.3066510222852230e-03 -6.9113439321517944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6240 3.9285849779844284e-03</internalNodes>
+          <leafValues>
+            -7.9043358564376831e-02 6.6218852996826172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6241 -3.0601240694522858e-02</internalNodes>
+          <leafValues>
+            -2.6517450809478760e-01 1.6467850655317307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6242 -1.9941160455346107e-02</internalNodes>
+          <leafValues>
+            1.5431809425354004e-01 -3.6100689321756363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6243 8.0520063638687134e-02</internalNodes>
+          <leafValues>
+            1.7015919089317322e-02 -3.3448880910873413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6244 7.0323847234249115e-02</internalNodes>
+          <leafValues>
+            1.7122440040111542e-02 -3.3302140235900879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6245 -5.2850939333438873e-02</internalNodes>
+          <leafValues>
+            6.2421400099992752e-02 -1.4690199866890907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6246 -7.1594159817323089e-04</internalNodes>
+          <leafValues>
+            -1.1335150152444839e-01 5.2260790020227432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6247 2.1469970047473907e-01</internalNodes>
+          <leafValues>
+            9.9299731664359570e-04 -9.9997580051422119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6248 8.7042592465877533e-02</internalNodes>
+          <leafValues>
+            -1.2329760007560253e-02 5.0260668992996216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6249 -5.8731262106448412e-04</internalNodes>
+          <leafValues>
+            -9.9346466362476349e-02 5.1705610007047653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6250 -4.4215220957994461e-02</internalNodes>
+          <leafValues>
+            -3.9368900656700134e-01 1.3920850120484829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6251 -8.7676227092742920e-02</internalNodes>
+          <leafValues>
+            3.0157440900802612e-01 -6.8702381104230881e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6252 -4.8453990370035172e-02</internalNodes>
+          <leafValues>
+            2.5477871298789978e-01 -2.2457750514149666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6253 -2.1567570511251688e-03</internalNodes>
+          <leafValues>
+            -1.3562899827957153e-01 3.1725399196147919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6254 3.9050900377333164e-03</internalNodes>
+          <leafValues>
+            4.9100890755653381e-02 -1.1861059814691544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6255 -3.9808028377592564e-03</internalNodes>
+          <leafValues>
+            4.8333909362554550e-02 -5.5897079408168793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6256 2.9744929634034634e-03</internalNodes>
+          <leafValues>
+            -6.4802452921867371e-02 9.3583501875400543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6257 2.5875229388475418e-02</internalNodes>
+          <leafValues>
+            1.8487609922885895e-02 -3.3436349034309387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6258 -1.9373580580577254e-03</internalNodes>
+          <leafValues>
+            2.2000649571418762e-01 -2.5404980406165123e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6259 -2.0171629264950752e-02</internalNodes>
+          <leafValues>
+            -7.8228309750556946e-02 4.5462790876626968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6260 -2.6088140904903412e-02</internalNodes>
+          <leafValues>
+            1.7637069523334503e-01 -4.5097298920154572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6261 -2.6868300512433052e-02</internalNodes>
+          <leafValues>
+            -3.2656419277191162e-01 1.7994230613112450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6262 -7.0211151614785194e-04</internalNodes>
+          <leafValues>
+            3.9671998471021652e-02 -1.4533540606498718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6263 8.3507681265473366e-03</internalNodes>
+          <leafValues>
+            -2.3051729425787926e-02 1.8850760161876678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6264 4.6823569573462009e-03</internalNodes>
+          <leafValues>
+            2.9996560886502266e-02 -2.0701029896736145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6265 3.3109660726040602e-03</internalNodes>
+          <leafValues>
+            5.6536730378866196e-02 -1.6835589706897736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6266 7.6425541192293167e-03</internalNodes>
+          <leafValues>
+            -4.1423950344324112e-02 1.2557519972324371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6267 -2.4713110178709030e-03</internalNodes>
+          <leafValues>
+            7.2156153619289398e-02 -1.0767730325460434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6268 -9.9495360627770424e-03</internalNodes>
+          <leafValues>
+            -1.8187619745731354e-01 3.3567231148481369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6269 1.9820800516754389e-03</internalNodes>
+          <leafValues>
+            -5.6488718837499619e-02 1.0741490125656128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6270 2.3254439234733582e-02</internalNodes>
+          <leafValues>
+            -1.6543349251151085e-02 3.6466678977012634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6271 -5.4177921265363693e-02</internalNodes>
+          <leafValues>
+            -1. 3.3418419770896435e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6272 6.1567849479615688e-04</internalNodes>
+          <leafValues>
+            4.0159329771995544e-02 -1.6460220515727997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6273 -4.2699510231614113e-03</internalNodes>
+          <leafValues>
+            -5.6978620588779449e-02 4.4480901211500168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6274 1.9749389030039310e-03</internalNodes>
+          <leafValues>
+            5.9283681213855743e-02 -1.0791260004043579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6275 -5.8583128266036510e-03</internalNodes>
+          <leafValues>
+            1.3734050095081329e-01 -3.4231521189212799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6276 -7.2995189111679792e-04</internalNodes>
+          <leafValues>
+            -1.0075060278177261e-01 5.4733160883188248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6277 -2.9930740594863892e-02</internalNodes>
+          <leafValues>
+            6.3882559537887573e-02 -4.1027020663022995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6278 -5.1738750189542770e-02</internalNodes>
+          <leafValues>
+            -7.2713458538055420e-01 7.4993381276726723e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6279 2.4021189659833908e-02</internalNodes>
+          <leafValues>
+            7.8491801396012306e-03 -5.5794471502304077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6280 -3.7574321031570435e-03</internalNodes>
+          <leafValues>
+            -1.6086879372596741e-01 3.1015990301966667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6281 -6.2635682523250580e-02</internalNodes>
+          <leafValues>
+            9.0577863156795502e-02 -2.9033770784735680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6282 1.9363429397344589e-02</internalNodes>
+          <leafValues>
+            -4.9920588731765747e-02 1.2835779786109924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6283 -3.5072889178991318e-02</internalNodes>
+          <leafValues>
+            2.1391840279102325e-01 -8.8168960064649582e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6284 -1.3243310153484344e-02</internalNodes>
+          <leafValues>
+            2.3349699378013611e-01 -2.3088019341230392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6285 -3.1290829181671143e-02</internalNodes>
+          <leafValues>
+            -6.9495099782943726e-01 9.3020889908075333e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6286 7.2391419671475887e-03</internalNodes>
+          <leafValues>
+            2.8485849499702454e-02 -1.8310770392417908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6287 6.6785318776965141e-03</internalNodes>
+          <leafValues>
+            -4.9132950603961945e-02 5.4181691259145737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6288 -3.6825571209192276e-02</internalNodes>
+          <leafValues>
+            3.3120208978652954e-01 -2.1359929814934731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6289 -4.5507341623306274e-02</internalNodes>
+          <leafValues>
+            -1.2893490493297577e-01 4.9545988440513611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6290 7.7639957889914513e-03</internalNodes>
+          <leafValues>
+            -3.6255620419979095e-02 1.5321409702301025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6291 6.0417611151933670e-02</internalNodes>
+          <leafValues>
+            4.5740022324025631e-03 -6.7541092634201050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6292 2.4624960497021675e-03</internalNodes>
+          <leafValues>
+            5.3674161434173584e-02 -1.1326540261507034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6293 7.3594506829977036e-05</internalNodes>
+          <leafValues>
+            -3.5648930817842484e-02 2.5458969175815582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6294 -4.0958370082080364e-03</internalNodes>
+          <leafValues>
+            1.5562909841537476e-01 -3.9390601217746735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6295 2.8689370083156973e-05</internalNodes>
+          <leafValues>
+            -8.4823302924633026e-02 3.8254238665103912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6296 -4.6220528893172741e-03</internalNodes>
+          <leafValues>
+            -1.8994529545307159e-01 3.3508758991956711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6297 -8.5343196988105774e-03</internalNodes>
+          <leafValues>
+            1.1212539672851562e-01 -3.3968489617109299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6298 -5.8803848922252655e-02</internalNodes>
+          <leafValues>
+            -5.1244312524795532e-01 1.0789549909532070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6299 6.0719929635524750e-02</internalNodes>
+          <leafValues>
+            -1.2555030174553394e-02 2.2509759664535522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6300 1.1038020020350814e-03</internalNodes>
+          <leafValues>
+            -9.6294492483139038e-02 5.6727480143308640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6301 -3.8484560791403055e-03</internalNodes>
+          <leafValues>
+            4.0573459118604660e-02 -2.5326859205961227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6302 -1.0771050117909908e-02</internalNodes>
+          <leafValues>
+            8.8735632598400116e-02 -5.5628679692745209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6303 1.2016809545457363e-02</internalNodes>
+          <leafValues>
+            2.3566279560327530e-02 -2.4590580165386200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6304 -1.1656560236588120e-03</internalNodes>
+          <leafValues>
+            -3.7417300045490265e-02 1.6503289341926575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6305 3.2137628644704819e-02</internalNodes>
+          <leafValues>
+            1.4245970174670219e-02 -2.6480850577354431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6306 2.3331670090556145e-02</internalNodes>
+          <leafValues>
+            -3.5288721323013306e-02 1.8447829782962799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6307 -1.2685320340096951e-02</internalNodes>
+          <leafValues>
+            -1.1757309734821320e-01 1.6436910256743431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6308 7.3903938755393028e-05</internalNodes>
+          <leafValues>
+            -1.0271479934453964e-01 7.4301436543464661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6309 -1.0925470292568207e-01</internalNodes>
+          <leafValues>
+            -8.3165317773818970e-01 5.6438110768795013e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6310 -1.3324350118637085e-01</internalNodes>
+          <leafValues>
+            7.7729821205139160e-01 -8.3403270691633224e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6311 8.9381448924541473e-04</internalNodes>
+          <leafValues>
+            -5.9524301439523697e-02 4.1173089295625687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6312 1.0318649932742119e-02</internalNodes>
+          <leafValues>
+            1.5926430001854897e-02 -3.1637790799140930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6313 -5.2297548390924931e-03</internalNodes>
+          <leafValues>
+            -7.1166560053825378e-02 3.3489290624856949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6314 1.6409620642662048e-02</internalNodes>
+          <leafValues>
+            -2.6454120874404907e-02 1.9589969515800476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6315 1.4068709686398506e-02</internalNodes>
+          <leafValues>
+            -3.9364140480756760e-02 1.3977420330047607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6316 6.6486410796642303e-03</internalNodes>
+          <leafValues>
+            6.4070828258991241e-02 -1.0493399947881699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6317 -1.8030619248747826e-02</internalNodes>
+          <leafValues>
+            8.3942912518978119e-02 -1.3399159535765648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6318 -4.4034369289875031e-02</internalNodes>
+          <leafValues>
+            -5.5825459957122803e-01 9.7633162513375282e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6319 -8.0966893583536148e-03</internalNodes>
+          <leafValues>
+            -2.0489789545536041e-01 2.6520200073719025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6320 5.0180461257696152e-03</internalNodes>
+          <leafValues>
+            -1.1661209911108017e-01 4.5791670680046082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6321 -1.7064629122614861e-02</internalNodes>
+          <leafValues>
+            2.6282730698585510e-01 -2.0390639081597328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6322 7.1850173175334930e-02</internalNodes>
+          <leafValues>
+            -6.9503681734204292e-03 6.7032539844512939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6323 -5.6914370507001877e-02</internalNodes>
+          <leafValues>
+            -1.3477900624275208e-01 1.8399080261588097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6324 -3.2365729566663504e-03</internalNodes>
+          <leafValues>
+            6.9673851132392883e-02 -7.2314530611038208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6325 4.1818909347057343e-02</internalNodes>
+          <leafValues>
+            1.1151459999382496e-02 -5.1680111885070801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6326 -6.1106588691473007e-03</internalNodes>
+          <leafValues>
+            -1.3163940608501434e-01 4.3796509504318237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6327 -3.5560909658670425e-02</internalNodes>
+          <leafValues>
+            6.8005502223968506e-02 -3.6331020295619965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6328 6.8789169192314148e-02</internalNodes>
+          <leafValues>
+            1.4698959887027740e-02 -3.8212299346923828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6329 -7.8313373029232025e-02</internalNodes>
+          <leafValues>
+            2.0296069979667664e-01 -8.6810020729899406e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6330 3.9626220241189003e-03</internalNodes>
+          <leafValues>
+            -3.5797890275716782e-02 1.3905510306358337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6331 -3.3874038606882095e-02</internalNodes>
+          <leafValues>
+            -2.2253429889678955e-01 7.5455638580024242e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6332 -6.4755856990814209e-02</internalNodes>
+          <leafValues>
+            4.7521549463272095e-01 -1.0970680043101311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6333 2.6647940278053284e-02</internalNodes>
+          <leafValues>
+            1.5445309691131115e-02 -2.6785778999328613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6334 -3.0731109902262688e-02</internalNodes>
+          <leafValues>
+            -4.7668689489364624e-01 9.6429884433746338e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6335 -2.4022700265049934e-02</internalNodes>
+          <leafValues>
+            -1.0633960366249084e-01 1.2849040329456329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6336 -1.3036349555477500e-03</internalNodes>
+          <leafValues>
+            7.3524177074432373e-02 -6.8074919283390045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6337 -9.8344050347805023e-03</internalNodes>
+          <leafValues>
+            -1.1843550205230713e-01 4.2866699397563934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6338 8.7102197110652924e-02</internalNodes>
+          <leafValues>
+            -4.0088258683681488e-02 1.7804540693759918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6339 2.0411569625139236e-02</internalNodes>
+          <leafValues>
+            1.6849989071488380e-02 -3.8953658938407898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6340 9.5875263214111328e-02</internalNodes>
+          <leafValues>
+            5.9905550442636013e-03 -8.1525659561157227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6341 6.4893220551311970e-03</internalNodes>
+          <leafValues>
+            -2.4039229378104210e-02 5.3871169686317444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6342 -9.6279237186536193e-04</internalNodes>
+          <leafValues>
+            9.4299189746379852e-02 -6.4436018466949463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6343 -3.7659960798919201e-04</internalNodes>
+          <leafValues>
+            -6.2296878546476364e-02 4.1251849383115768e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6344 6.5272641368210316e-03</internalNodes>
+          <leafValues>
+            5.1325131207704544e-02 -1.3037790358066559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6345 2.1429110318422318e-02</internalNodes>
+          <leafValues>
+            -1.1989659629762173e-02 2.6280459761619568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6346 -5.0938720814883709e-03</internalNodes>
+          <leafValues>
+            6.3418947160243988e-02 -9.0566337108612061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6347 -2.5309680495411158e-03</internalNodes>
+          <leafValues>
+            6.0297761112451553e-02 -2.5049470365047455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6348 -1.5915350522845984e-03</internalNodes>
+          <leafValues>
+            -1.2171190232038498e-01 3.7737991660833359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6349 -3.4030709415674210e-02</internalNodes>
+          <leafValues>
+            4.6413430571556091e-01 -3.5409750416874886e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6350 5.1074200309813023e-03</internalNodes>
+          <leafValues>
+            3.9823830127716064e-02 -1.2645539641380310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6351 -9.6449116244912148e-03</internalNodes>
+          <leafValues>
+            3.3464258909225464e-01 -6.6040740348398685e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6352 1.1422860436141491e-02</internalNodes>
+          <leafValues>
+            -3.6080420017242432e-02 1.3714550435543060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6353 -5.1042139530181885e-03</internalNodes>
+          <leafValues>
+            -9.3986809253692627e-02 2.8844779357314110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6354 -2.6332271099090576e-01</internalNodes>
+          <leafValues>
+            4.9980929493904114e-01 -1.0173249989748001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6355 -2.4556639790534973e-01</internalNodes>
+          <leafValues>
+            -8.1778347492218018e-01 6.9596339017152786e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6356 -2.1419329941272736e-01</internalNodes>
+          <leafValues>
+            -5.1040518283843994e-01 9.4540230929851532e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6357 -1.4363219961524010e-02</internalNodes>
+          <leafValues>
+            -9.1000981628894806e-02 2.4646669626235962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6358 -1.2388969771564007e-03</internalNodes>
+          <leafValues>
+            1.1544570326805115e-01 -4.9565620720386505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6359 2.1015120670199394e-02</internalNodes>
+          <leafValues>
+            -1.7765879631042480e-02 1.9577859342098236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6360 -4.1783051565289497e-03</internalNodes>
+          <leafValues>
+            -1.1172860115766525e-01 4.4625449925661087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6361 2.0896939095109701e-03</internalNodes>
+          <leafValues>
+            -3.3988729119300842e-02 6.5539501607418060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6362 1.6410060226917267e-02</internalNodes>
+          <leafValues>
+            -2.0373269915580750e-02 2.5331538915634155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6363 -6.4266882836818695e-02</internalNodes>
+          <leafValues>
+            -6.5880149602890015e-01 3.4550630953162909e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6364 6.8898178869858384e-04</internalNodes>
+          <leafValues>
+            6.7643247544765472e-02 -8.7556242942810059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6365 5.6662331335246563e-03</internalNodes>
+          <leafValues>
+            3.0638309195637703e-02 -1.1895540356636047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6366 -4.3778121471405029e-02</internalNodes>
+          <leafValues>
+            -2.8309130668640137e-01 1.7713630571961403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6367 3.4748481120914221e-03</internalNodes>
+          <leafValues>
+            -9.5787122845649719e-02 4.2630400508642197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6368 -1.1673940345644951e-02</internalNodes>
+          <leafValues>
+            -1.0502570122480392e-01 5.0903890281915665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6369 -3.4004659391939640e-03</internalNodes>
+          <leafValues>
+            1.0470719635486603e-01 -4.0939141064882278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6370 2.7091780211776495e-03</internalNodes>
+          <leafValues>
+            -6.0524601489305496e-02 1.3978950679302216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6371 -1.7439300194382668e-02</internalNodes>
+          <leafValues>
+            -3.2391169667243958e-01 1.4630249701440334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6372 -1.2598330155014992e-02</internalNodes>
+          <leafValues>
+            -2.0682629942893982e-01 2.5501869618892670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6373 1.8755869939923286e-02</internalNodes>
+          <leafValues>
+            -4.7925960272550583e-02 1.0864380002021790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6374 -4.2074159719049931e-03</internalNodes>
+          <leafValues>
+            -8.2077808678150177e-02 6.3647769391536713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6375 -1.6427719674538821e-04</internalNodes>
+          <leafValues>
+            1.0120390355587006e-01 -3.4067928791046143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6376 4.3847691267728806e-02</internalNodes>
+          <leafValues>
+            6.0980222187936306e-03 -8.3685982227325439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6377 -3.9284680038690567e-02</internalNodes>
+          <leafValues>
+            2.8250560164451599e-01 -2.2389259189367294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6378 3.8550909608602524e-02</internalNodes>
+          <leafValues>
+            1.5570489689707756e-02 -3.3978620171546936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6379 -6.9177031517028809e-02</internalNodes>
+          <leafValues>
+            1.2258320301771164e-01 -1.7850179225206375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6380 -1.9251030171290040e-03</internalNodes>
+          <leafValues>
+            -1.0687749832868576e-01 4.6379510313272476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6381 -8.6635202169418335e-03</internalNodes>
+          <leafValues>
+            9.6412748098373413e-02 -1.7563249915838242e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6382 1.3393509387969971e-01</internalNodes>
+          <leafValues>
+            6.3692941330373287e-03 -7.0170587301254272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6383 4.1082348674535751e-02</internalNodes>
+          <leafValues>
+            -1.1077569797635078e-02 1.3463750481605530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6384 1.4911450445652008e-01</internalNodes>
+          <leafValues>
+            9.5263421535491943e-03 -5.0872552394866943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6385 -5.2500818856060505e-03</internalNodes>
+          <leafValues>
+            7.0025578141212463e-02 -4.2880270630121231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6386 2.2823570296168327e-02</internalNodes>
+          <leafValues>
+            -4.1884049773216248e-02 1.1770319938659668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6387 -8.5306530818343163e-03</internalNodes>
+          <leafValues>
+            6.1222139745950699e-02 -2.4944549426436424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6388 1.1971729807555676e-02</internalNodes>
+          <leafValues>
+            3.9662770926952362e-02 -1.6267740726470947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6389 -3.8938269019126892e-02</internalNodes>
+          <leafValues>
+            2.5743520259857178e-01 -1.6356239095330238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6390 -2.1706389263272285e-02</internalNodes>
+          <leafValues>
+            -3.1998679041862488e-01 1.7135290428996086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6391 6.6900630481541157e-03</internalNodes>
+          <leafValues>
+            2.6101849973201752e-02 -1.0980729758739471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6392 -7.2270832955837250e-02</internalNodes>
+          <leafValues>
+            1.9431130588054657e-01 -2.6044359430670738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6393 -6.7073688842356205e-03</internalNodes>
+          <leafValues>
+            -1.7747850716114044e-01 4.5862998813390732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6394 5.5019360035657883e-02</internalNodes>
+          <leafValues>
+            -8.3471573889255524e-03 6.0511541366577148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6395 1.3142649829387665e-01</internalNodes>
+          <leafValues>
+            -5.7535418309271336e-03 2.9167538881301880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6396 -1.6564460238441825e-03</internalNodes>
+          <leafValues>
+            7.0003032684326172e-02 -6.2690876424312592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6397 1.5445409715175629e-01</internalNodes>
+          <leafValues>
+            6.1896732077002525e-03 -7.4323302507400513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6398 -5.0357519648969173e-03</internalNodes>
+          <leafValues>
+            -1.1333289742469788e-01 3.8741771131753922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6399 2.2772569209337234e-03</internalNodes>
+          <leafValues>
+            -1.1340530216693878e-01 2.1319400519132614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6400 3.3173530828207731e-03</internalNodes>
+          <leafValues>
+            4.4273331761360168e-02 -1.0459829866886139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6401 -2.9692800715565681e-02</internalNodes>
+          <leafValues>
+            9.2483766376972198e-02 -2.3342609405517578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6402 6.2937840819358826e-02</internalNodes>
+          <leafValues>
+            -1.2998280115425587e-02 3.8887938857078552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6403 3.6641359329223633e-03</internalNodes>
+          <leafValues>
+            3.2099820673465729e-02 -3.9647988975048065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6404 4.4782999902963638e-03</internalNodes>
+          <leafValues>
+            -4.5701328665018082e-02 1.0697010159492493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6405 1.8147319788113236e-03</internalNodes>
+          <leafValues>
+            -3.2871820032596588e-02 1.0647939890623093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6406 4.8941639252007008e-03</internalNodes>
+          <leafValues>
+            2.7911009266972542e-02 -2.1725590527057648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6407 -4.4425828382372856e-03</internalNodes>
+          <leafValues>
+            -1.3470150530338287e-01 1.0781410150229931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6408 -2.5493400171399117e-02</internalNodes>
+          <leafValues>
+            6.8371468782424927e-01 -7.7452720142900944e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6409 2.7835449203848839e-02</internalNodes>
+          <leafValues>
+            2.4144299328327179e-02 -1.5170599520206451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6410 7.5548859313130379e-03</internalNodes>
+          <leafValues>
+            -4.7643400728702545e-02 1.1925770342350006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6411 1.0329609736800194e-02</internalNodes>
+          <leafValues>
+            1.8646810203790665e-02 -1.6122570633888245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6412 -1.2393389828503132e-02</internalNodes>
+          <leafValues>
+            6.0304921865463257e-01 -7.7566630207002163e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6413 1.3833769597113132e-02</internalNodes>
+          <leafValues>
+            -2.7617299929261208e-02 5.1266878843307495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6414 -2.5669319555163383e-02</internalNodes>
+          <leafValues>
+            2.3801359534263611e-01 -2.3971909657120705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6415 -5.2043660543859005e-03</internalNodes>
+          <leafValues>
+            -1.0721790045499802e-01 2.6645049452781677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6416 3.4628969151526690e-03</internalNodes>
+          <leafValues>
+            5.4313410073518753e-02 -1.3458320498466492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6417 -1.9220679998397827e-02</internalNodes>
+          <leafValues>
+            7.2996392846107483e-02 -4.0652111172676086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6418 -2.5009829550981522e-03</internalNodes>
+          <leafValues>
+            -7.7671296894550323e-02 5.9096541255712509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6419 -8.5285156965255737e-03</internalNodes>
+          <leafValues>
+            4.9050811678171158e-02 -6.4078353345394135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6420 4.3327538296580315e-03</internalNodes>
+          <leafValues>
+            2.5221010670065880e-02 -1.9358980655670166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6421 3.6595970392227173e-02</internalNodes>
+          <leafValues>
+            -1.6262590885162354e-02 1.5651239454746246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6422 -1.1795730097219348e-03</internalNodes>
+          <leafValues>
+            -7.2468072175979614e-02 7.0449486374855042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6423 -1.3975829817354679e-02</internalNodes>
+          <leafValues>
+            -1.1789470165967941e-01 2.1292049437761307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6424 -1.3828700175508857e-03</internalNodes>
+          <leafValues>
+            7.9283542931079865e-02 -9.5104120671749115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6425 -2.9435830656439066e-03</internalNodes>
+          <leafValues>
+            7.0368431508541107e-02 -3.3217910677194595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6426 9.5262555405497551e-03</internalNodes>
+          <leafValues>
+            -2.9733620584011078e-02 1.6670459508895874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6427 -9.0114273130893707e-02</internalNodes>
+          <leafValues>
+            -1.6625370085239410e-01 8.6199166253209114e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6428 -1.2089919764548540e-03</internalNodes>
+          <leafValues>
+            8.1083856523036957e-02 -7.3029123246669769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6429 -1.4199960231781006e-01</internalNodes>
+          <leafValues>
+            -1. 2.2284830920398235e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6430 8.0690719187259674e-03</internalNodes>
+          <leafValues>
+            4.7412220388650894e-02 -1.0178930312395096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6431 -4.7410889528691769e-03</internalNodes>
+          <leafValues>
+            1.2051119655370712e-01 -4.9957480281591415e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6432 -1.6977200284600258e-03</internalNodes>
+          <leafValues>
+            -2.4171440303325653e-01 1.9534369930624962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6433 -2.8892089612782001e-03</internalNodes>
+          <leafValues>
+            2.5727990269660950e-01 -1.1625059880316257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6434 -1.5177440363913774e-03</internalNodes>
+          <leafValues>
+            -9.8784193396568298e-02 4.6706128865480423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6435 1.4197319746017456e-01</internalNodes>
+          <leafValues>
+            -2.5096370372921228e-03 7.5450611114501953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6436 9.7517937421798706e-02</internalNodes>
+          <leafValues>
+            -6.9059049710631371e-03 6.5184432268142700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6437 1.3567379675805569e-02</internalNodes>
+          <leafValues>
+            -7.6325193047523499e-02 8.8054582476615906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6438 8.0981463193893433e-02</internalNodes>
+          <leafValues>
+            1.5558109618723392e-02 -3.4601628780364990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6439 -4.7192731872200966e-03</internalNodes>
+          <leafValues>
+            8.1620022654533386e-02 -4.6072289347648621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6440 2.0368969999253750e-03</internalNodes>
+          <leafValues>
+            -4.4817630201578140e-02 1.2861390411853790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6441 -1.7878509825095534e-03</internalNodes>
+          <leafValues>
+            4.3731331825256348e-02 -4.4995948672294617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6442 -7.1685528382658958e-03</internalNodes>
+          <leafValues>
+            -1.3597999513149261e-01 3.8796991109848022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6443 -6.7460887134075165e-02</internalNodes>
+          <leafValues>
+            -2.9265740513801575e-01 3.5135280340909958e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6444 -1.5598500147461891e-02</internalNodes>
+          <leafValues>
+            2.3105660080909729e-01 -2.2405069321393967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6445 -2.1026479080319405e-02</internalNodes>
+          <leafValues>
+            -1.5283830463886261e-01 3.1531449407339096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6446 -1.0558360069990158e-01</internalNodes>
+          <leafValues>
+            -6.8366038799285889e-01 6.8997950293123722e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6447 -3.6966579500585794e-03</internalNodes>
+          <leafValues>
+            3.4315150231122971e-02 -4.8922799527645111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6448 -6.0826627304777503e-04</internalNodes>
+          <leafValues>
+            -5.2638430148363113e-02 8.9546948671340942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6449 -2.8936540707945824e-02</internalNodes>
+          <leafValues>
+            4.1818480938673019e-02 -1.3818169943988323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6450 -5.8082528412342072e-03</internalNodes>
+          <leafValues>
+            6.7874796688556671e-02 -8.5578799247741699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6451 -4.6095378696918488e-02</internalNodes>
+          <leafValues>
+            -1.2584780156612396e-01 2.0466970279812813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6452 5.2972920238971710e-02</internalNodes>
+          <leafValues>
+            -1.2453259900212288e-02 3.4565049409866333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6453 4.9351599067449570e-02</internalNodes>
+          <leafValues>
+            1.0901239700615406e-02 -4.8506981134414673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6454 4.4377800077199936e-02</internalNodes>
+          <leafValues>
+            9.9294837564229965e-03 -4.3877899646759033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6455 -1.1464890092611313e-01</internalNodes>
+          <leafValues>
+            2.6874598860740662e-01 -9.2000560835003853e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6456 1.6887830197811127e-01</internalNodes>
+          <leafValues>
+            5.7101310230791569e-03 -8.5972881317138672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6457 5.1198098808526993e-02</internalNodes>
+          <leafValues>
+            -8.5723921656608582e-03 1.3395169377326965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6458 -3.0789880547672510e-03</internalNodes>
+          <leafValues>
+            -1.0338760167360306e-01 4.3459478765726089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6459 4.7223128378391266e-02</internalNodes>
+          <leafValues>
+            8.1934239715337753e-03 -4.3803408741950989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6460 -7.6270569115877151e-03</internalNodes>
+          <leafValues>
+            1.8713890016078949e-01 -2.4660250172019005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6461 5.4106907919049263e-03</internalNodes>
+          <leafValues>
+            4.1099831461906433e-02 -7.8868232667446136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6462 -1.4900229871273041e-03</internalNodes>
+          <leafValues>
+            -2.0115040242671967e-01 3.1898159533739090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6463 -8.3831608295440674e-02</internalNodes>
+          <leafValues>
+            5.8017939329147339e-01 -5.2973427809774876e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6464 6.2233800999820232e-03</internalNodes>
+          <leafValues>
+            -3.9786059409379959e-02 1.2283950299024582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6465 1.1475080251693726e-01</internalNodes>
+          <leafValues>
+            -1.1975419707596302e-02 2.1586710214614868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6466 -1.5253260498866439e-03</internalNodes>
+          <leafValues>
+            1.3804529607295990e-01 -3.9941880851984024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6467 -5.2878521382808685e-03</internalNodes>
+          <leafValues>
+            -1.2790650129318237e-01 3.2893560826778412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6468 8.9670647867023945e-04</internalNodes>
+          <leafValues>
+            -1.2481059879064560e-01 4.4544249773025513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6469 3.8421660661697388e-02</internalNodes>
+          <leafValues>
+            7.7155791223049164e-03 -6.5575468540191650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6470 -9.3785318313166499e-04</internalNodes>
+          <leafValues>
+            5.5608510971069336e-02 -8.9876912534236908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6471 1.9965849351137877e-03</internalNodes>
+          <leafValues>
+            -2.5297610089182854e-02 1.9413180649280548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6472 4.5782068627886474e-04</internalNodes>
+          <leafValues>
+            3.9089199155569077e-02 -1.2908570468425751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6473 3.8373940624296665e-03</internalNodes>
+          <leafValues>
+            -2.8748869895935059e-02 1.9429750740528107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6474 3.7142829387448728e-04</internalNodes>
+          <leafValues>
+            3.8272358477115631e-02 -1.3759189844131470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6475 7.5116259977221489e-03</internalNodes>
+          <leafValues>
+            -1.4461129903793335e-02 1.2656949460506439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6476 -5.0362840294837952e-02</internalNodes>
+          <leafValues>
+            3.5183578729629517e-01 -1.4051860198378563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6477 3.9921641349792480e-02</internalNodes>
+          <leafValues>
+            2.7280429378151894e-02 -1.9958199560642242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6478 2.2605259716510773e-01</internalNodes>
+          <leafValues>
+            -6.8001961335539818e-03 7.3006898164749146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6479 1.1081779748201370e-01</internalNodes>
+          <leafValues>
+            4.3370737694203854e-03 -8.6829161643981934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6480 -9.7494889050722122e-03</internalNodes>
+          <leafValues>
+            -6.3740663230419159e-02 8.4537997841835022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6481 -2.2887689992785454e-03</internalNodes>
+          <leafValues>
+            9.9654018878936768e-02 -4.1565418243408203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6482 2.0008319988846779e-03</internalNodes>
+          <leafValues>
+            -5.5650699883699417e-02 1.0709869861602783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6483 -1.5160050243139267e-02</internalNodes>
+          <leafValues>
+            -1.4098760485649109e-01 3.8741599768400192e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6484 -6.3132969662547112e-03</internalNodes>
+          <leafValues>
+            -1. 4.4605308212339878e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6485 -1.3970009982585907e-02</internalNodes>
+          <leafValues>
+            1.2481089681386948e-01 -2.1425830200314522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6486 -4.4321279972791672e-02</internalNodes>
+          <leafValues>
+            -5.3340071439743042e-01 1.0165239684283733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6487 1.4885979471728206e-03</internalNodes>
+          <leafValues>
+            -4.8868600279092789e-02 3.6077901721000671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6488 6.5139681100845337e-02</internalNodes>
+          <leafValues>
+            7.6331058517098427e-03 -5.8781641721725464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6489 -2.0741410553455353e-02</internalNodes>
+          <leafValues>
+            -2.9658278822898865e-01 1.8622800707817078e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>396</maxWeakCount>
+      <stageThreshold>-1.2181390523910522e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 6490 1.3575689867138863e-02</internalNodes>
+          <leafValues>
+            -1.4249590039253235e-01 2.3337620496749878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6491 -7.5882389210164547e-03</internalNodes>
+          <leafValues>
+            8.6464479565620422e-02 -2.3954319953918457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6492 4.2986529879271984e-03</internalNodes>
+          <leafValues>
+            5.0282090902328491e-02 -3.5250121355056763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6493 -1.9793119281530380e-02</internalNodes>
+          <leafValues>
+            -1.6827470064163208e-01 4.3712720274925232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6494 6.6613829694688320e-03</internalNodes>
+          <leafValues>
+            -2.0371539890766144e-01 7.1225747466087341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6495 3.2715050037950277e-03</internalNodes>
+          <leafValues>
+            5.4536718875169754e-02 -2.2428829967975616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6496 -3.6143321543931961e-02</internalNodes>
+          <leafValues>
+            5.5044889450073242e-01 -2.3597210645675659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6497 3.1145319808274508e-03</internalNodes>
+          <leafValues>
+            2.2049430757761002e-02 -3.0109429359436035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6498 8.9540961198508739e-04</internalNodes>
+          <leafValues>
+            -1.2279850244522095e-01 1.0751420259475708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6499 8.0573331797495484e-04</internalNodes>
+          <leafValues>
+            -8.7587781250476837e-02 5.4632049053907394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6500 -6.5726130269467831e-03</internalNodes>
+          <leafValues>
+            -1.5649870038032532e-01 7.6560758054256439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6501 2.2269350010901690e-03</internalNodes>
+          <leafValues>
+            2.9490780085325241e-02 -5.9210199862718582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6502 6.2076752074062824e-03</internalNodes>
+          <leafValues>
+            7.5727343559265137e-02 -1.7675329744815826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6503 6.0021011158823967e-03</internalNodes>
+          <leafValues>
+            -7.8353807330131531e-02 1.4492890238761902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6504 1.1996340006589890e-02</internalNodes>
+          <leafValues>
+            2.8644030913710594e-02 -3.1982469558715820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6505 6.7174229770898819e-03</internalNodes>
+          <leafValues>
+            -1.0739900171756744e-01 1.3106329739093781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6506 5.7567027397453785e-04</internalNodes>
+          <leafValues>
+            -6.4126797020435333e-02 1.6293540596961975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6507 3.9552329108119011e-03</internalNodes>
+          <leafValues>
+            3.7347421050071716e-02 -1.5253570675849915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6508 1.5598450554534793e-03</internalNodes>
+          <leafValues>
+            -9.8687313497066498e-02 9.8718203604221344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6509 -8.4324590861797333e-03</internalNodes>
+          <leafValues>
+            2.0905649662017822e-01 -6.0484018176794052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6510 8.7580326944589615e-03</internalNodes>
+          <leafValues>
+            5.0603430718183517e-02 -2.1845470368862152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6511 -1.1965750157833099e-01</internalNodes>
+          <leafValues>
+            2.6711589097976685e-01 -7.4574039317667484e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6512 2.0653149113059044e-03</internalNodes>
+          <leafValues>
+            3.5194810479879379e-02 -2.5230750441551208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6513 -5.7491107145324349e-04</internalNodes>
+          <leafValues>
+            8.2424223423004150e-02 -1.0830479860305786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6514 -6.7591401748359203e-03</internalNodes>
+          <leafValues>
+            -1.3704189658164978e-01 7.0154368877410889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6515 1.8210740759968758e-02</internalNodes>
+          <leafValues>
+            -2.5407770648598671e-02 1.0123729705810547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6516 -8.8006846606731415e-02</internalNodes>
+          <leafValues>
+            3.6638718843460083e-01 -3.0893180519342422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6517 -4.4944360852241516e-03</internalNodes>
+          <leafValues>
+            -1.5753810107707977e-01 6.0070630162954330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6518 -6.3741360791027546e-03</internalNodes>
+          <leafValues>
+            2.1189889311790466e-01 -3.9567999541759491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6519 -3.1097440049052238e-02</internalNodes>
+          <leafValues>
+            -5.9965521097183228e-01 9.9493442103266716e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6520 5.8496380224823952e-03</internalNodes>
+          <leafValues>
+            2.8244689106941223e-02 -2.9778000712394714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6521 -2.2763800807297230e-03</internalNodes>
+          <leafValues>
+            1.0270419716835022e-01 -7.3711991310119629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6522 3.9103049784898758e-03</internalNodes>
+          <leafValues>
+            5.2445668727159500e-02 -2.0123919844627380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6523 2.8906730003654957e-03</internalNodes>
+          <leafValues>
+            -2.1692280471324921e-01 3.7294570356607437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6524 4.5904931612312794e-03</internalNodes>
+          <leafValues>
+            -8.1276580691337585e-02 1.1013159900903702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6525 -3.4245800226926804e-02</internalNodes>
+          <leafValues>
+            -1.1541730165481567e-01 1.4384049922227859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6526 -1.7881620442494750e-04</internalNodes>
+          <leafValues>
+            6.2885977327823639e-02 -1.3267129659652710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6527 -4.0114559233188629e-03</internalNodes>
+          <leafValues>
+            -1.8961720168590546e-01 3.6701768636703491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6528 3.1429999507963657e-03</internalNodes>
+          <leafValues>
+            -4.9915120005607605e-02 1.7299769818782806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6529 7.8082352876663208e-02</internalNodes>
+          <leafValues>
+            4.7195390798151493e-03 -3.4015879034996033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6530 2.0370949804782867e-01</internalNodes>
+          <leafValues>
+            -2.1733140572905540e-02 3.7422651052474976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6531 9.7424820065498352e-02</internalNodes>
+          <leafValues>
+            -6.8117439514026046e-04 4.9639159440994263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6532 -2.6366419624537230e-03</internalNodes>
+          <leafValues>
+            -1.8532100319862366e-01 4.3768830597400665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6533 4.1020149365067482e-04</internalNodes>
+          <leafValues>
+            2.7802910655736923e-02 -8.7706968188285828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6534 -5.9666559100151062e-02</internalNodes>
+          <leafValues>
+            -5.6872707605361938e-01 1.3388640247285366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6535 -5.1892381161451340e-03</internalNodes>
+          <leafValues>
+            5.0499498844146729e-02 -1.4465869963169098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6536 1.0377140343189240e-01</internalNodes>
+          <leafValues>
+            -1.8952060490846634e-02 4.1107979416847229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6537 -1.4075759798288345e-02</internalNodes>
+          <leafValues>
+            -2.0367360115051270e-01 3.2513279467821121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6538 -6.8877148441970348e-03</internalNodes>
+          <leafValues>
+            1.2401729822158813e-01 -7.6617129147052765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6539 2.9345849528908730e-02</internalNodes>
+          <leafValues>
+            8.4471162408590317e-03 -3.4656980633735657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6540 -8.3123557269573212e-03</internalNodes>
+          <leafValues>
+            -1.9180110096931458e-01 3.8585629314184189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6541 6.4493268728256226e-02</internalNodes>
+          <leafValues>
+            -2.7158880606293678e-02 3.0217999219894409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6542 8.0413377145305276e-04</internalNodes>
+          <leafValues>
+            -1.0444170236587524e-01 6.4721979200839996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6543 -6.5569980069994926e-03</internalNodes>
+          <leafValues>
+            -1.0658600181341171e-01 2.5238489732146263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6544 -3.8326930254697800e-02</internalNodes>
+          <leafValues>
+            -6.8506389856338501e-01 9.6486946567893028e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6545 -4.0327329188585281e-02</internalNodes>
+          <leafValues>
+            1.9759850203990936e-01 -2.5184169411659241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6546 6.1981407925486565e-03</internalNodes>
+          <leafValues>
+            4.6415790915489197e-02 -1.7171670496463776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6547 3.7465501576662064e-02</internalNodes>
+          <leafValues>
+            -1.5010279603302479e-02 8.6962252855300903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6548 -6.0584479942917824e-03</internalNodes>
+          <leafValues>
+            6.9242753088474274e-02 -9.4594202935695648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6549 -1.4991699717938900e-02</internalNodes>
+          <leafValues>
+            -1.4969819784164429e-01 4.6579450368881226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6550 6.4760357141494751e-02</internalNodes>
+          <leafValues>
+            -2.6089169085025787e-02 2.7072009444236755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6551 5.9020328521728516e-01</internalNodes>
+          <leafValues>
+            3.9715780876576900e-03 -6.3918071985244751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6552 7.3892213404178619e-02</internalNodes>
+          <leafValues>
+            -6.2506332993507385e-02 1.3100719451904297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6553 4.3928170204162598e-01</internalNodes>
+          <leafValues>
+            5.0452877767384052e-03 -3.7628439068794250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6554 1.0192040354013443e-01</internalNodes>
+          <leafValues>
+            2.2053290158510208e-02 -3.3408200740814209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6555 1.1084219813346863e-01</internalNodes>
+          <leafValues>
+            1.6215540468692780e-02 -3.4900701045989990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6556 5.5628088302910328e-03</internalNodes>
+          <leafValues>
+            -5.2196711301803589e-02 1.1796370148658752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6557 -6.3897081417962909e-04</internalNodes>
+          <leafValues>
+            -1.5659700334072113e-01 4.4744450598955154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6558 -3.5426639951765537e-03</internalNodes>
+          <leafValues>
+            1.4490570127964020e-01 -4.2518708854913712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6559 -3.3016160130500793e-02</internalNodes>
+          <leafValues>
+            -3.6942940950393677e-01 7.6470980420708656e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6560 9.6050858497619629e-02</internalNodes>
+          <leafValues>
+            6.5154801122844219e-03 -8.7827038764953613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6561 -4.9572009593248367e-02</internalNodes>
+          <leafValues>
+            -4.2723020911216736e-01 3.1567770056426525e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6562 2.5885479408316314e-04</internalNodes>
+          <leafValues>
+            -1.5689669549465179e-01 3.8051828742027283e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6563 -1.5898289857432246e-03</internalNodes>
+          <leafValues>
+            -1.8845720589160919e-01 2.4630049243569374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6564 -1.3463890354614705e-04</internalNodes>
+          <leafValues>
+            1.4452700316905975e-01 -4.4172260910272598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6565 1.1674249544739723e-02</internalNodes>
+          <leafValues>
+            -2.5676380842924118e-02 1.9527709484100342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6566 -2.3507000878453255e-02</internalNodes>
+          <leafValues>
+            -3.2271888852119446e-01 1.8514839932322502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6567 3.1225800514221191e-02</internalNodes>
+          <leafValues>
+            -1.9622299820184708e-02 1.4570100605487823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6568 8.0607319250702858e-04</internalNodes>
+          <leafValues>
+            4.4379990547895432e-02 -1.3635620474815369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6569 -2.6445880532264709e-01</internalNodes>
+          <leafValues>
+            4.1771200299263000e-01 -6.3821650110185146e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6570 3.5479381680488586e-02</internalNodes>
+          <leafValues>
+            -2.2758480161428452e-02 2.6946100592613220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6571 -3.8137599825859070e-02</internalNodes>
+          <leafValues>
+            -3.6719909310340881e-01 1.8722059205174446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6572 3.9108810015022755e-03</internalNodes>
+          <leafValues>
+            -1.8176819384098053e-01 3.9054948836565018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6573 4.1834539733827114e-03</internalNodes>
+          <leafValues>
+            4.8676248639822006e-02 -1.3558860123157501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6574 -4.6641420572996140e-02</internalNodes>
+          <leafValues>
+            -5.8741682767868042e-01 9.8590552806854248e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6575 1.1950139887630939e-02</internalNodes>
+          <leafValues>
+            -2.5506049394607544e-02 2.7971199154853821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6576 -6.3585072755813599e-02</internalNodes>
+          <leafValues>
+            -7.0940697193145752e-01 8.8691459968686104e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6577 9.7221415489912033e-03</internalNodes>
+          <leafValues>
+            -2.7885029092431068e-02 5.4626680910587311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6578 -1.6111459583044052e-02</internalNodes>
+          <leafValues>
+            -6.8265482783317566e-02 8.0932967364788055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6579 -7.9950511455535889e-02</internalNodes>
+          <leafValues>
+            2.0425680279731750e-01 -3.4306850284337997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6580 3.1421340536326170e-03</internalNodes>
+          <leafValues>
+            4.2196881026029587e-02 -1.5366910398006439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6581 2.9253180400701240e-05</internalNodes>
+          <leafValues>
+            -7.6382257044315338e-02 3.1748879700899124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6582 -5.4587088525295258e-02</internalNodes>
+          <leafValues>
+            -6.4891487360000610e-01 9.1545386239886284e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6583 -2.1083420142531395e-02</internalNodes>
+          <leafValues>
+            1.9058999419212341e-01 -2.4686640128493309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6584 3.9170900708995759e-04</internalNodes>
+          <leafValues>
+            -1.0570889711380005e-01 5.2946768701076508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6585 2.2588829696178436e-01</internalNodes>
+          <leafValues>
+            2.3077470250427723e-03 -9.2606049776077271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6586 -1.8899979069828987e-02</internalNodes>
+          <leafValues>
+            1.4503970742225647e-01 -3.8506619632244110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6587 -8.7533425539731979e-03</internalNodes>
+          <leafValues>
+            8.3958826959133148e-02 -3.7479098886251450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6588 -2.0821259915828705e-01</internalNodes>
+          <leafValues>
+            -6.7948538064956665e-01 9.8609952256083488e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6589 1.6270060092210770e-02</internalNodes>
+          <leafValues>
+            1.4115580357611179e-02 -1.8218359351158142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6590 3.0145489145070314e-03</internalNodes>
+          <leafValues>
+            5.2013739943504333e-02 -1.1450190097093582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6591 1.8547449260950089e-02</internalNodes>
+          <leafValues>
+            -2.5681620463728905e-02 1.6456380486488342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6592 4.2732958681881428e-03</internalNodes>
+          <leafValues>
+            -5.9573240578174591e-02 1.0390280187129974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6593 -2.8249630704522133e-02</internalNodes>
+          <leafValues>
+            -7.8161589801311493e-02 2.9064230620861053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6594 -1.5538600273430347e-02</internalNodes>
+          <leafValues>
+            -1.4481380581855774e-01 3.8434058427810669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6595 3.8620950654149055e-03</internalNodes>
+          <leafValues>
+            -3.8745380938053131e-02 9.8183527588844299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6596 1.5253369696438313e-02</internalNodes>
+          <leafValues>
+            1.7946500331163406e-02 -3.0948030948638916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6597 -4.2140888981521130e-03</internalNodes>
+          <leafValues>
+            5.7521570473909378e-02 -2.7782430872321129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6598 -2.1610679104924202e-03</internalNodes>
+          <leafValues>
+            1.0617449879646301e-01 -5.9411250054836273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6599 -1.8687519477680326e-03</internalNodes>
+          <leafValues>
+            -1.2807689607143402e-01 4.7781638801097870e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6600 -6.2083022203296423e-04</internalNodes>
+          <leafValues>
+            1.1725349724292755e-01 -4.7861199826002121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6601 -2.5575871113687754e-03</internalNodes>
+          <leafValues>
+            5.7900648564100266e-02 -8.4036856889724731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6602 4.1207410395145416e-03</internalNodes>
+          <leafValues>
+            5.4239779710769653e-02 -1.2611140310764313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6603 1.7525779083371162e-02</internalNodes>
+          <leafValues>
+            2.8792750090360641e-02 -1.9793170690536499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6604 -1.9012490287423134e-02</internalNodes>
+          <leafValues>
+            1.1444319784641266e-01 -6.6813051700592041e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6605 9.5198452472686768e-03</internalNodes>
+          <leafValues>
+            -3.9105638861656189e-02 8.8588982820510864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6606 7.7857482247054577e-03</internalNodes>
+          <leafValues>
+            4.7903850674629211e-02 -1.1941280215978622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6607 -2.5355129037052393e-03</internalNodes>
+          <leafValues>
+            6.1377499252557755e-02 -5.1576390862464905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6608 1.3886679708957672e-01</internalNodes>
+          <leafValues>
+            7.1258218958973885e-03 -7.5076061487197876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6609 -3.0958889983594418e-03</internalNodes>
+          <leafValues>
+            7.3432266712188721e-02 -4.0409181267023087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6610 4.7118910588324070e-03</internalNodes>
+          <leafValues>
+            2.2374270483851433e-02 -2.3885080218315125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6611 6.3587618060410023e-03</internalNodes>
+          <leafValues>
+            5.3684379905462265e-02 -1.3398240506649017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6612 6.8367011845111847e-02</internalNodes>
+          <leafValues>
+            -3.6103919148445129e-02 1.7410080134868622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6613 -3.2802459318190813e-03</internalNodes>
+          <leafValues>
+            -1.4603079855442047e-01 4.8215139657258987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6614 -6.6430270671844482e-02</internalNodes>
+          <leafValues>
+            4.6738991141319275e-01 -1.3140380382537842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6615 -4.2274069041013718e-02</internalNodes>
+          <leafValues>
+            -6.3253331184387207e-01 1.0359439998865128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6616 -1.0691370116546750e-03</internalNodes>
+          <leafValues>
+            -1.1469829827547073e-01 4.5048121362924576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6617 5.4235469549894333e-02</internalNodes>
+          <leafValues>
+            -1.9809609279036522e-02 3.1430730223655701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6618 -7.2852471930673346e-06</internalNodes>
+          <leafValues>
+            5.8051250874996185e-02 -1.0246170312166214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6619 2.0893309265375137e-02</internalNodes>
+          <leafValues>
+            1.5608809888362885e-02 -2.1545739471912384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6620 -5.3765181452035904e-02</internalNodes>
+          <leafValues>
+            2.0559239387512207e-01 -3.2525919377803802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6621 -1.5972670167684555e-02</internalNodes>
+          <leafValues>
+            -1.7119890451431274e-01 1.4773829840123653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6622 -1.4591409824788570e-02</internalNodes>
+          <leafValues>
+            -2.3046019673347473e-01 2.3345010355114937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6623 2.4016639217734337e-03</internalNodes>
+          <leafValues>
+            -2.8272429481148720e-02 9.5124237239360809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6624 -2.0430689677596092e-02</internalNodes>
+          <leafValues>
+            4.0655559301376343e-01 -1.6212539747357368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6625 8.1926792860031128e-02</internalNodes>
+          <leafValues>
+            8.7937163189053535e-03 -4.0210300683975220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6626 -1.2892849743366241e-02</internalNodes>
+          <leafValues>
+            -1.1946929991245270e-01 4.5022130012512207e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6627 9.4712682068347931e-02</internalNodes>
+          <leafValues>
+            -1.0760080069303513e-02 2.1693980693817139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6628 4.0901689790189266e-03</internalNodes>
+          <leafValues>
+            -8.4592603147029877e-02 7.0457696914672852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6629 -1.2496539950370789e-01</internalNodes>
+          <leafValues>
+            2.8276950120925903e-01 -4.2760102078318596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6630 1.5758169814944267e-02</internalNodes>
+          <leafValues>
+            -4.8926588147878647e-02 1.2380229681730270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6631 -5.2818129770457745e-03</internalNodes>
+          <leafValues>
+            6.1836440116167068e-02 -3.6712940782308578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6632 8.6735859513282776e-03</internalNodes>
+          <leafValues>
+            -4.7372240573167801e-02 1.5809150040149689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6633 -5.2273580804467201e-03</internalNodes>
+          <leafValues>
+            -1.1694569885730743e-01 2.9156440868973732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6634 6.1831828206777573e-02</internalNodes>
+          <leafValues>
+            8.0447606742382050e-03 -6.8530529737472534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6635 6.6815607249736786e-02</internalNodes>
+          <leafValues>
+            -8.4813889116048813e-03 1.4523769915103912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6636 -1.0062000155448914e-01</internalNodes>
+          <leafValues>
+            7.4605828523635864e-01 -6.8016690202057362e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6637 -1.4751539565622807e-02</internalNodes>
+          <leafValues>
+            -1.4893519878387451e-01 3.9579190313816071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6638 3.4616589546203613e-02</internalNodes>
+          <leafValues>
+            -2.0749099552631378e-02 2.8549820184707642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6639 -1.2966389954090118e-01</internalNodes>
+          <leafValues>
+            -5.5446487665176392e-01 4.6082548797130585e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6640 7.4035510420799255e-02</internalNodes>
+          <leafValues>
+            5.3174998611211777e-03 -8.4149527549743652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6641 1.0177110135555267e-01</internalNodes>
+          <leafValues>
+            -7.6451660133898258e-03 3.5442221164703369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6642 8.9658737182617188e-02</internalNodes>
+          <leafValues>
+            -9.3901483342051506e-03 5.0577938556671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6643 -1.6180740296840668e-01</internalNodes>
+          <leafValues>
+            -6.5451782941818237e-01 8.7116202339529991e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6644 1.8784119747579098e-03</internalNodes>
+          <leafValues>
+            5.2064418792724609e-02 -9.0741947293281555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6645 1.9505689851939678e-03</internalNodes>
+          <leafValues>
+            -5.4091621190309525e-02 3.5506200045347214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6646 -6.0789179988205433e-03</internalNodes>
+          <leafValues>
+            1.2238519638776779e-01 -4.6803738921880722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6647 -2.2403250634670258e-01</internalNodes>
+          <leafValues>
+            -7.7728492021560669e-01 2.3639709688723087e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6648 -1.3039590418338776e-01</internalNodes>
+          <leafValues>
+            -2.7692648768424988e-01 2.1548289805650711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6649 7.2587423026561737e-02</internalNodes>
+          <leafValues>
+            1.0621299967169762e-02 -1.6270780563354492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6650 7.3180042207241058e-02</internalNodes>
+          <leafValues>
+            -1.7519259825348854e-02 3.3697870373725891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6651 -3.4525979310274124e-02</internalNodes>
+          <leafValues>
+            -5.3538697957992554e-01 1.0397709906101227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6652 2.3753559216856956e-03</internalNodes>
+          <leafValues>
+            5.1910828799009323e-02 -9.6959516406059265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6653 -6.8947779946029186e-03</internalNodes>
+          <leafValues>
+            8.2409977912902832e-02 -2.3098999634385109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6654 -9.4773292541503906e-02</internalNodes>
+          <leafValues>
+            -7.0510691404342651e-01 7.7322297729551792e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6655 5.6327427737414837e-03</internalNodes>
+          <leafValues>
+            1.7960680648684502e-02 -7.2307042777538300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6656 6.6090249456465244e-03</internalNodes>
+          <leafValues>
+            -3.6701079457998276e-02 1.3706339895725250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6657 -2.4978399276733398e-02</internalNodes>
+          <leafValues>
+            -1.6281390190124512e-01 7.6992698013782501e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6658 -6.0882410034537315e-03</internalNodes>
+          <leafValues>
+            1.0555619746446609e-01 -4.8507411032915115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6659 6.1161588877439499e-02</internalNodes>
+          <leafValues>
+            1.1127579491585493e-03 -5.6657880544662476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6660 -3.8722809404134750e-02</internalNodes>
+          <leafValues>
+            -5.9797358512878418e-01 8.4153199568390846e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6661 6.2335198745131493e-03</internalNodes>
+          <leafValues>
+            3.1563021242618561e-02 -1.8769240379333496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6662 1.6939510405063629e-01</internalNodes>
+          <leafValues>
+            -1.7183739691972733e-02 3.1440049409866333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6663 8.5851341485977173e-02</internalNodes>
+          <leafValues>
+            5.7081878185272217e-03 -4.9966809153556824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6664 -2.0315010100603104e-02</internalNodes>
+          <leafValues>
+            -1.2359900027513504e-01 4.4704839587211609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6665 -4.0276069194078445e-03</internalNodes>
+          <leafValues>
+            4.7957219183444977e-02 -9.7137056291103363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6666 -3.9274509996175766e-02</internalNodes>
+          <leafValues>
+            1.8804270029067993e-01 -2.9754199087619781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6667 -2.1163629367947578e-02</internalNodes>
+          <leafValues>
+            -1.5724900364875793e-01 3.9636529982089996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6668 4.0783579461276531e-03</internalNodes>
+          <leafValues>
+            -4.7562818974256516e-02 1.0976249724626541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6669 1.0180410463362932e-03</internalNodes>
+          <leafValues>
+            -6.6306091845035553e-02 9.8773077130317688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6670 2.8516049496829510e-03</internalNodes>
+          <leafValues>
+            -5.1101740449666977e-02 9.6994958817958832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6671 4.8373742029070854e-03</internalNodes>
+          <leafValues>
+            4.0866550058126450e-02 -1.2480360269546509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6672 -3.4715479705482721e-04</internalNodes>
+          <leafValues>
+            4.1778691112995148e-02 -1.2574540078639984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6673 -6.3760261982679367e-03</internalNodes>
+          <leafValues>
+            1.5754230320453644e-01 -4.1692778468132019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6674 -1.2534069828689098e-02</internalNodes>
+          <leafValues>
+            -1.3565440475940704e-01 4.1295569390058517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6675 -2.3321550339460373e-02</internalNodes>
+          <leafValues>
+            1.2518349289894104e-01 -1.3427260331809521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6676 2.1691620349884033e-03</internalNodes>
+          <leafValues>
+            1.4331200718879700e-01 -3.5120349377393723e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6677 -5.0005540251731873e-02</internalNodes>
+          <leafValues>
+            2.1500219404697418e-01 -2.7628419920802116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6678 1.3818169943988323e-02</internalNodes>
+          <leafValues>
+            2.2208500653505325e-02 -2.6048558950424194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6679 -1.1389379948377609e-01</internalNodes>
+          <leafValues>
+            -2.6434680819511414e-01 5.8247619308531284e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6680 1.4204699546098709e-03</internalNodes>
+          <leafValues>
+            -7.1546286344528198e-02 7.0379182696342468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6681 1.2329610064625740e-02</internalNodes>
+          <leafValues>
+            2.9475130140781403e-02 -1.9224089384078979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6682 3.4679430536925793e-03</internalNodes>
+          <leafValues>
+            -6.1920940876007080e-02 9.0893089771270752e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6683 -1.2088479846715927e-01</internalNodes>
+          <leafValues>
+            4.6626859903335571e-01 -2.7361230459064245e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6684 -1.5827519819140434e-02</internalNodes>
+          <leafValues>
+            -9.5342837274074554e-02 5.5003169924020767e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6685 -5.3695850074291229e-03</internalNodes>
+          <leafValues>
+            1.6891020536422729e-01 -4.6700950711965561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6686 5.2695080637931824e-02</internalNodes>
+          <leafValues>
+            -5.6889699772000313e-03 9.0487861633300781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6687 -1.1397979687899351e-03</internalNodes>
+          <leafValues>
+            3.4316681325435638e-02 -7.5787901878356934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6688 -2.8946578968316317e-03</internalNodes>
+          <leafValues>
+            7.5482390820980072e-02 -7.6466552913188934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6689 -5.1091420464217663e-03</internalNodes>
+          <leafValues>
+            -1.2294950336217880e-01 4.9972750246524811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6690 1.8837359966710210e-03</internalNodes>
+          <leafValues>
+            4.3406400829553604e-02 -1.2572230398654938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6691 1.5422919765114784e-02</internalNodes>
+          <leafValues>
+            1.5831289812922478e-02 -2.0917390286922455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6692 2.1666040644049644e-02</internalNodes>
+          <leafValues>
+            -2.4713400751352310e-02 2.4171669781208038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6693 -9.4336412847042084e-02</internalNodes>
+          <leafValues>
+            8.0389547348022461e-01 -2.6913180481642485e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6694 -6.0154758393764496e-03</internalNodes>
+          <leafValues>
+            -1.3231749832630157e-01 4.9613710492849350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6695 4.3775320053100586e-02</internalNodes>
+          <leafValues>
+            4.5396219938993454e-03 -5.8732748031616211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6696 1.0561950039118528e-03</internalNodes>
+          <leafValues>
+            -8.8057562708854675e-02 7.1294106543064117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6697 -1.6394529957324266e-03</internalNodes>
+          <leafValues>
+            9.0810842812061310e-02 -3.7760701030492783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6698 2.6742160320281982e-01</internalNodes>
+          <leafValues>
+            9.4182817265391350e-03 -5.2740138769149780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6699 -2.1629330515861511e-01</internalNodes>
+          <leafValues>
+            -6.1128187179565430e-01 5.2118571475148201e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6700 -2.6974570751190186e-01</internalNodes>
+          <leafValues>
+            -7.3394459486007690e-01 6.0041057877242565e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6701 -6.0050850734114647e-03</internalNodes>
+          <leafValues>
+            1.1067090183496475e-01 -2.0614199340343475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6702 4.9247939139604568e-02</internalNodes>
+          <leafValues>
+            1.0287189856171608e-02 -4.9581390619277954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6703 4.9235569313168526e-03</internalNodes>
+          <leafValues>
+            1.4880360104143620e-02 -1.1287470161914825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6704 -8.2946997135877609e-03</internalNodes>
+          <leafValues>
+            5.6476062536239624e-01 -1.0442149825394154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6705 2.3567330092191696e-02</internalNodes>
+          <leafValues>
+            -2.9235871043056250e-03 2.4979250133037567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6706 -4.1040919721126556e-02</internalNodes>
+          <leafValues>
+            4.0030491352081299e-01 -1.3312620110809803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6707 -5.3690220229327679e-03</internalNodes>
+          <leafValues>
+            -2.9186370968818665e-01 1.6781600192189217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6708 3.6616099532693624e-03</internalNodes>
+          <leafValues>
+            -4.7920960932970047e-02 1.0898339748382568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6709 -2.4735789746046066e-02</internalNodes>
+          <leafValues>
+            6.7270919680595398e-02 -1.6207970678806305e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6710 8.6064152419567108e-03</internalNodes>
+          <leafValues>
+            -6.0250200331211090e-02 1.0674320161342621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6711 -3.3892609179019928e-02</internalNodes>
+          <leafValues>
+            -1.9795329868793488e-01 1.9014969468116760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6712 1.0522030293941498e-01</internalNodes>
+          <leafValues>
+            6.0530952177941799e-03 -7.5238007307052612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6713 -5.9583578258752823e-03</internalNodes>
+          <leafValues>
+            9.9094383418560028e-02 -3.5570640116930008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6714 2.7306210249662399e-03</internalNodes>
+          <leafValues>
+            -8.8879808783531189e-02 6.4843989908695221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6715 4.3243571417406201e-04</internalNodes>
+          <leafValues>
+            3.2528489828109741e-02 -9.1479070484638214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6716 -5.2608880214393139e-03</internalNodes>
+          <leafValues>
+            1.3896170258522034e-01 -4.0624819695949554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6717 -1.5605129301548004e-01</internalNodes>
+          <leafValues>
+            -7.3170071840286255e-01 2.5103189982473850e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6718 -1.1245990172028542e-02</internalNodes>
+          <leafValues>
+            -1.1834110319614410e-01 5.2261721342802048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6719 -9.2654878972098231e-04</internalNodes>
+          <leafValues>
+            4.3350778520107269e-02 -7.6521359384059906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6720 1.5148459933698177e-03</internalNodes>
+          <leafValues>
+            -7.1485839784145355e-02 7.3206916451454163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6721 4.6230577863752842e-03</internalNodes>
+          <leafValues>
+            2.0211879163980484e-02 -4.6565961092710495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6722 1.2555140256881714e-01</internalNodes>
+          <leafValues>
+            9.2135155573487282e-03 -5.4831707477569580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6723 4.0751680731773376e-02</internalNodes>
+          <leafValues>
+            -4.5771248638629913e-02 5.6990999728441238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6724 -2.2074349224567413e-02</internalNodes>
+          <leafValues>
+            -3.9075499773025513e-01 1.1654710397124290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6725 1.2412919849157333e-01</internalNodes>
+          <leafValues>
+            -6.0688108205795288e-03 2.6376709342002869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6726 6.0741119086742401e-03</internalNodes>
+          <leafValues>
+            1.0768520087003708e-01 -5.0139870494604111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6727 -1.4694149792194366e-01</internalNodes>
+          <leafValues>
+            -4.3452548980712891e-01 5.5836569517850876e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6728 -1.2046460062265396e-01</internalNodes>
+          <leafValues>
+            -5.4068279266357422e-01 9.8318615928292274e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6729 -9.0990159660577774e-03</internalNodes>
+          <leafValues>
+            -1.3625259697437286e-01 9.5357475802302361e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6730 1.0966449975967407e-02</internalNodes>
+          <leafValues>
+            -3.1344298273324966e-02 1.7068630456924438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6731 -2.1763380616903305e-02</internalNodes>
+          <leafValues>
+            7.3918178677558899e-02 -1.7846420407295227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6732 -4.9578789621591568e-02</internalNodes>
+          <leafValues>
+            -5.8034032583236694e-01 1.0063209570944309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6733 -6.6796392202377319e-03</internalNodes>
+          <leafValues>
+            -4.7280300408601761e-02 3.8668069988489151e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6734 -1.0112039744853973e-03</internalNodes>
+          <leafValues>
+            4.5412030071020126e-02 -1.4603359997272491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6735 2.5813570246100426e-03</internalNodes>
+          <leafValues>
+            3.1112480908632278e-02 -1.0001499950885773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6736 2.0418369676917791e-03</internalNodes>
+          <leafValues>
+            4.8378061503171921e-02 -1.4722709357738495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6737 5.6246068328619003e-02</internalNodes>
+          <leafValues>
+            3.7779449485242367e-03 -6.1013627052307129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6738 -2.6130750775337219e-02</internalNodes>
+          <leafValues>
+            2.6240581274032593e-01 -2.4313600733876228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6739 -1.2151029892265797e-02</internalNodes>
+          <leafValues>
+            -5.6114129722118378e-02 2.9739160090684891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6740 -5.1036469638347626e-02</internalNodes>
+          <leafValues>
+            2.7955740690231323e-01 -2.1683510392904282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6741 8.7444618344306946e-02</internalNodes>
+          <leafValues>
+            -3.7635879125446081e-03 5.2711361646652222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6742 3.4982790239155293e-03</internalNodes>
+          <leafValues>
+            5.6673228740692139e-02 -9.2554636299610138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6743 9.7861722111701965e-02</internalNodes>
+          <leafValues>
+            3.7442990578711033e-03 -5.4237729310989380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6744 -6.3886200077831745e-03</internalNodes>
+          <leafValues>
+            -9.7468167543411255e-02 6.0299299657344818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6745 -1.0128310322761536e-01</internalNodes>
+          <leafValues>
+            -6.5173667669296265e-01 3.4321940038353205e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6746 -3.9312228560447693e-02</internalNodes>
+          <leafValues>
+            2.6476991176605225e-01 -2.6981310918927193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6747 1.1417990177869797e-01</internalNodes>
+          <leafValues>
+            7.5375889427959919e-03 -6.8553638458251953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6748 8.4078265354037285e-03</internalNodes>
+          <leafValues>
+            -3.0973089858889580e-02 1.7200429737567902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6749 -1.5489499783143401e-03</internalNodes>
+          <leafValues>
+            4.6454809606075287e-02 -6.9261766970157623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6750 2.9730569804087281e-04</internalNodes>
+          <leafValues>
+            3.7772700190544128e-02 -1.3767069578170776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6751 2.8460770845413208e-03</internalNodes>
+          <leafValues>
+            -4.3182320892810822e-02 9.9634610116481781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6752 4.9144420772790909e-02</internalNodes>
+          <leafValues>
+            5.9465290978550911e-03 -8.2366597652435303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6753 1.0286020115017891e-02</internalNodes>
+          <leafValues>
+            2.8591090813279152e-02 -1.5941999852657318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6754 1.9976280629634857e-02</internalNodes>
+          <leafValues>
+            -2.9617030173540115e-02 1.5943069756031036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6755 2.3533409461379051e-02</internalNodes>
+          <leafValues>
+            7.5594270601868629e-03 -2.3041130602359772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6756 -9.0482197701931000e-03</internalNodes>
+          <leafValues>
+            -1.2408699840307236e-01 4.1615001857280731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6757 -3.8635660894215107e-03</internalNodes>
+          <leafValues>
+            8.7811216711997986e-02 -4.1511181741952896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6758 -2.7298410423099995e-03</internalNodes>
+          <leafValues>
+            9.4712667167186737e-02 -5.2838958799839020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6759 -4.5442068949341774e-03</internalNodes>
+          <leafValues>
+            -1.0748460143804550e-01 1.7744770273566246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6760 2.3271010722965002e-03</internalNodes>
+          <leafValues>
+            -8.3826236426830292e-02 5.7210709899663925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6761 -1.2409550137817860e-02</internalNodes>
+          <leafValues>
+            2.3100300133228302e-01 -2.2110419347882271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6762 -4.5268908143043518e-03</internalNodes>
+          <leafValues>
+            -1.6244150698184967e-01 3.2564349472522736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6763 -4.4666860048891976e-05</internalNodes>
+          <leafValues>
+            2.4341119825839996e-01 -2.6702800765633583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6764 7.7015289571136236e-04</internalNodes>
+          <leafValues>
+            -1.2858650088310242e-01 4.2308151721954346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6765 4.4863048940896988e-02</internalNodes>
+          <leafValues>
+            1.0781999677419662e-02 -3.5814240574836731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6766 3.7869490683078766e-02</internalNodes>
+          <leafValues>
+            -1.4966360293328762e-02 3.4195008873939514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6767 -8.3092376589775085e-03</internalNodes>
+          <leafValues>
+            -2.7514660358428955e-01 2.0139539614319801e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6768 -4.3290119618177414e-02</internalNodes>
+          <leafValues>
+            3.0036559700965881e-01 -1.9493019208312035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6769 -1.0075629688799381e-02</internalNodes>
+          <leafValues>
+            -1.2262579798698425e-01 9.1246366500854492e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6770 -3.3486529719084501e-03</internalNodes>
+          <leafValues>
+            1.1790259927511215e-01 -4.1050188243389130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6771 -6.4645247766748071e-04</internalNodes>
+          <leafValues>
+            -7.8154936432838440e-02 4.6990569680929184e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6772 3.5247370600700378e-02</internalNodes>
+          <leafValues>
+            1.0365270078182220e-02 -5.1507127285003662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6773 3.5965928691439331e-04</internalNodes>
+          <leafValues>
+            -7.7936813235282898e-02 3.0275240540504456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6774 -1.5898740384727716e-03</internalNodes>
+          <leafValues>
+            -1.0594320297241211e-01 5.0036150962114334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6775 -2.1408300846815109e-02</internalNodes>
+          <leafValues>
+            1.1649339646100998e-01 -3.7540700286626816e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6776 -2.7612380217760801e-03</internalNodes>
+          <leafValues>
+            3.4751810133457184e-02 -1.3718530535697937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6777 6.4307968132197857e-03</internalNodes>
+          <leafValues>
+            -1.3667429797351360e-02 1.4938560128211975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6778 -6.9555612280964851e-03</internalNodes>
+          <leafValues>
+            -1.2171459943056107e-01 5.6100189685821533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6779 -2.7654969692230225e-01</internalNodes>
+          <leafValues>
+            -8.5077387094497681e-01 3.8885050453245640e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6780 4.7567309811711311e-03</internalNodes>
+          <leafValues>
+            -6.5594427287578583e-02 7.5947061181068420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6781 8.9218050241470337e-02</internalNodes>
+          <leafValues>
+            6.5016360022127628e-03 -3.2032990455627441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6782 6.7748151719570160e-02</internalNodes>
+          <leafValues>
+            -1.1878870427608490e-02 4.4954490661621094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6783 4.5336190611124039e-02</internalNodes>
+          <leafValues>
+            7.4317739345133305e-03 -4.3144878745079041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6784 1.0965850204229355e-02</internalNodes>
+          <leafValues>
+            2.5135010480880737e-02 -2.0359070599079132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6785 -6.5938562154769897e-02</internalNodes>
+          <leafValues>
+            4.5524141192436218e-01 -7.5815711170434952e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6786 -4.2270109057426453e-02</internalNodes>
+          <leafValues>
+            3.8470050692558289e-01 -1.1672279797494411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6787 -6.3518402166664600e-03</internalNodes>
+          <leafValues>
+            -8.7010167539119720e-02 3.4159921109676361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6788 3.2269880175590515e-02</internalNodes>
+          <leafValues>
+            -4.0711440145969391e-02 1.2469469755887985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6789 -3.9068311452865601e-02</internalNodes>
+          <leafValues>
+            -1.0403119772672653e-01 6.7032999359071255e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6790 -1.0384949855506420e-03</internalNodes>
+          <leafValues>
+            5.8422528207302094e-02 -1.0154890269041061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6791 2.9740650206804276e-02</internalNodes>
+          <leafValues>
+            1.2596059590578079e-02 -1.5170450508594513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6792 5.3193639032542706e-03</internalNodes>
+          <leafValues>
+            -4.6843089163303375e-02 1.1005250364542007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6793 -3.2385820522904396e-03</internalNodes>
+          <leafValues>
+            -1.0309839993715286e-01 5.0686061382293701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6794 4.2344750836491585e-03</internalNodes>
+          <leafValues>
+            -4.9582429230213165e-02 1.2092150002717972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6795 -7.4786663055419922e-02</internalNodes>
+          <leafValues>
+            -4.6895131468772888e-01 3.8582859560847282e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6796 8.5299033671617508e-03</internalNodes>
+          <leafValues>
+            3.8806159049272537e-02 -1.2022049725055695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6797 -4.8662569373846054e-02</internalNodes>
+          <leafValues>
+            1.6113990545272827e-01 -1.1717130430042744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6798 -1.3677199603989720e-03</internalNodes>
+          <leafValues>
+            -8.5303716361522675e-02 5.5394109338521957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6799 -5.8111362159252167e-03</internalNodes>
+          <leafValues>
+            4.7039270401000977e-02 -5.1736868917942047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6800 -3.9951619692146778e-03</internalNodes>
+          <leafValues>
+            -7.8167162835597992e-02 6.3919343054294586e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6801 3.0817699152976274e-03</internalNodes>
+          <leafValues>
+            -6.9289833307266235e-02 2.8242539614439011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6802 -4.6279471367597580e-02</internalNodes>
+          <leafValues>
+            -3.4760490059852600e-01 1.3878909870982170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6803 -1.8725780770182610e-02</internalNodes>
+          <leafValues>
+            1.5222269296646118e-01 -1.5724090859293938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6804 -2.1445369347929955e-02</internalNodes>
+          <leafValues>
+            -3.5962730646133423e-01 1.2764260172843933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6805 -9.1003477573394775e-02</internalNodes>
+          <leafValues>
+            -7.9615950584411621e-01 4.9090441316366196e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6806 2.5607119314372540e-03</internalNodes>
+          <leafValues>
+            -5.4551690816879272e-02 8.4403410553932190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6807 -1.3662099838256836e-02</internalNodes>
+          <leafValues>
+            9.4987250864505768e-02 -6.2036819756031036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6808 9.2437807470560074e-03</internalNodes>
+          <leafValues>
+            5.3822331130504608e-02 -9.9236510694026947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6809 -1.4612140133976936e-02</internalNodes>
+          <leafValues>
+            -1.5248660743236542e-01 4.2905550450086594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6810 -3.9584659039974213e-02</internalNodes>
+          <leafValues>
+            1.5883240103721619e-01 -3.5484429448843002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6811 -6.7460699938237667e-03</internalNodes>
+          <leafValues>
+            1.1749260127544403e-01 -3.7934441119432449e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6812 2.0449559669941664e-03</internalNodes>
+          <leafValues>
+            6.1626188457012177e-02 -9.4409346580505371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6813 -1.5146560035645962e-02</internalNodes>
+          <leafValues>
+            -3.3887571096420288e-01 6.8320450372993946e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6814 -2.0916219800710678e-03</internalNodes>
+          <leafValues>
+            -1.4829570055007935e-01 3.3358350396156311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6815 1.3274390250444412e-02</internalNodes>
+          <leafValues>
+            -3.8169000297784805e-02 4.6379629522562027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6816 1.2404330074787140e-02</internalNodes>
+          <leafValues>
+            -1.8498679623007774e-02 2.7952960133552551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6817 -2.3678259924054146e-02</internalNodes>
+          <leafValues>
+            -4.7142859548330307e-02 2.3141339421272278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6818 6.7575983703136444e-02</internalNodes>
+          <leafValues>
+            -1.8598400056362152e-02 2.7481150627136230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6819 7.6359122991561890e-02</internalNodes>
+          <leafValues>
+            2.9178129509091377e-02 -2.0572820305824280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6820 -1.0918889939785004e-01</internalNodes>
+          <leafValues>
+            6.2577211856842041e-01 -9.8246810957789421e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6821 1.2964319903403521e-03</internalNodes>
+          <leafValues>
+            -3.1776499003171921e-02 6.7833930253982544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6822 4.1218679398298264e-02</internalNodes>
+          <leafValues>
+            8.5701625794172287e-03 -5.8379119634628296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6823 -1.8773629562929273e-03</internalNodes>
+          <leafValues>
+            5.3263541311025620e-02 -4.1702788323163986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6824 -2.9402649961411953e-03</internalNodes>
+          <leafValues>
+            8.6931921541690826e-02 -7.1344070136547089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6825 -3.0833749100565910e-02</internalNodes>
+          <leafValues>
+            -3.9439570903778076e-01 6.0907239094376564e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6826 -3.7960989866405725e-03</internalNodes>
+          <leafValues>
+            7.4150532484054565e-02 -6.1881281435489655e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6827 -6.3087488524615765e-03</internalNodes>
+          <leafValues>
+            -1.1662469804286957e-01 2.5016760453581810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6828 4.0001370944082737e-03</internalNodes>
+          <leafValues>
+            -5.7236731052398682e-02 9.7589701414108276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6829 6.7752957344055176e-02</internalNodes>
+          <leafValues>
+            9.5101362094283104e-03 -3.3777019381523132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6830 -9.2353783547878265e-02</internalNodes>
+          <leafValues>
+            7.9015249013900757e-01 -6.2939748167991638e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6831 -2.4050839245319366e-02</internalNodes>
+          <leafValues>
+            -1.5585710108280182e-01 1.8099930137395859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6832 3.2272089738398790e-03</internalNodes>
+          <leafValues>
+            -4.7936741262674332e-02 1.0735899955034256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6833 -7.2444709949195385e-03</internalNodes>
+          <leafValues>
+            9.6775539219379425e-02 -2.4095900356769562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6834 -1.0888259857892990e-01</internalNodes>
+          <leafValues>
+            -8.1255799531936646e-01 6.0875630006194115e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6835 -1.4077230356633663e-02</internalNodes>
+          <leafValues>
+            -1.3358989357948303e-01 2.5421140715479851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6836 -3.0071370303630829e-02</internalNodes>
+          <leafValues>
+            3.5427039861679077e-01 -1.3553430326282978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6837 3.4985799342393875e-02</internalNodes>
+          <leafValues>
+            -3.0686240643262863e-03 4.6311178803443909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6838 1.8354769796133041e-02</internalNodes>
+          <leafValues>
+            1.1218019761145115e-02 -4.6143579483032227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6839 -6.4306408166885376e-02</internalNodes>
+          <leafValues>
+            -6.1207151412963867e-01 1.9155009649693966e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6840 8.2096129655838013e-02</internalNodes>
+          <leafValues>
+            -8.8210906833410263e-03 5.4885977506637573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6841 7.7698810491710901e-04</internalNodes>
+          <leafValues>
+            1.3247950375080109e-01 -3.3915128558874130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6842 6.4568981528282166e-02</internalNodes>
+          <leafValues>
+            6.4043831080198288e-03 -7.7150177955627441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6843 -1.5833489596843719e-02</internalNodes>
+          <leafValues>
+            -1.9498950242996216e-01 7.5541301630437374e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6844 3.4125618636608124e-02</internalNodes>
+          <leafValues>
+            -1.5915289521217346e-02 2.9716441035270691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6845 -1.2615050189197063e-02</internalNodes>
+          <leafValues>
+            -2.4650709331035614e-01 2.2699799388647079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6846 1.8272679299116135e-02</internalNodes>
+          <leafValues>
+            -4.0593959391117096e-02 1.1693490296602249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6847 -6.6374349407851696e-03</internalNodes>
+          <leafValues>
+            -1.4557109773159027e-01 3.5353910177946091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6848 -2.6520919054746628e-03</internalNodes>
+          <leafValues>
+            7.6382592320442200e-02 -6.6688627004623413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6849 2.2452129051089287e-03</internalNodes>
+          <leafValues>
+            -8.9759878814220428e-02 5.5091369897127151e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6850 -4.4775419519282877e-04</internalNodes>
+          <leafValues>
+            2.1264159679412842e-01 -2.6620639488101006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6851 -1.1115259677171707e-01</internalNodes>
+          <leafValues>
+            -4.3139949440956116e-01 4.6484731137752533e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6852 -1.1578770354390144e-02</internalNodes>
+          <leafValues>
+            -3.5296261310577393e-01 1.2750539928674698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6853 -2.5290170684456825e-02</internalNodes>
+          <leafValues>
+            5.1385980844497681e-01 -6.7363809794187546e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6854 -3.2232340425252914e-02</internalNodes>
+          <leafValues>
+            -5.7690191268920898e-01 7.7741048298776150e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6855 -4.1698799468576908e-03</internalNodes>
+          <leafValues>
+            -1.7519310116767883e-01 1.1018699966371059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6856 -2.0664500072598457e-02</internalNodes>
+          <leafValues>
+            2.5821951031684875e-01 -1.7920289188623428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6857 -1.0834420099854469e-03</internalNodes>
+          <leafValues>
+            -1.3178519904613495e-01 2.5419749319553375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6858 -9.5458701252937317e-03</internalNodes>
+          <leafValues>
+            4.4964689016342163e-01 -1.1315030045807362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6859 5.3232181817293167e-02</internalNodes>
+          <leafValues>
+            7.4498020112514496e-03 -6.8122059106826782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6860 -1.3852520287036896e-01</internalNodes>
+          <leafValues>
+            -6.0117882490158081e-01 6.5434179268777370e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6861 1.7173439264297485e-02</internalNodes>
+          <leafValues>
+            -2.5120509788393974e-02 8.6516633629798889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6862 3.9947189390659332e-02</internalNodes>
+          <leafValues>
+            5.8647249825298786e-03 -7.4653059244155884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6863 2.0647009834647179e-02</internalNodes>
+          <leafValues>
+            -1.0226000100374222e-02 1.7227609455585480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6864 -1.8602909985929728e-03</internalNodes>
+          <leafValues>
+            -6.5767973661422729e-02 6.9248490035533905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6865 -3.4106068313121796e-02</internalNodes>
+          <leafValues>
+            1.5908730030059814e-01 -1.3241630047559738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6866 6.3425069674849510e-03</internalNodes>
+          <leafValues>
+            3.5119149833917618e-02 -1.3436080515384674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6867 1.6866199439391494e-03</internalNodes>
+          <leafValues>
+            -4.3401770293712616e-02 5.0606630742549896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6868 -3.0595089774578810e-03</internalNodes>
+          <leafValues>
+            5.6976709514856339e-02 -8.1074528396129608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6869 2.7664829976856709e-03</internalNodes>
+          <leafValues>
+            2.0497009158134460e-02 -8.0963827669620514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6870 -3.2909188885241747e-03</internalNodes>
+          <leafValues>
+            -1.0803789645433426e-01 4.6237960457801819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6871 1.7244400456547737e-02</internalNodes>
+          <leafValues>
+            -2.5127060711383820e-02 2.4591030180454254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6872 9.1161586344242096e-02</internalNodes>
+          <leafValues>
+            1.0174980387091637e-02 -4.6983879804611206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6873 2.5459621101617813e-03</internalNodes>
+          <leafValues>
+            -3.0003750696778297e-02 1.4800469577312469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6874 1.7582690343260765e-03</internalNodes>
+          <leafValues>
+            5.4400689899921417e-02 -7.7444270253181458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6875 -1.6833960544317961e-03</internalNodes>
+          <leafValues>
+            8.1838123500347137e-02 -4.3751198798418045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6876 -7.6617579907178879e-04</internalNodes>
+          <leafValues>
+            -1.3564400374889374e-01 3.6041948944330215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6877 1.1155450483784080e-03</internalNodes>
+          <leafValues>
+            -4.8263888806104660e-02 5.0273448228836060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6878 -2.6005289983004332e-03</internalNodes>
+          <leafValues>
+            8.8793486356735229e-02 -5.4554209113121033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6879 -3.2424980308860540e-03</internalNodes>
+          <leafValues>
+            -1.3159190118312836e-01 3.4248508512973785e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6880 -1.4817930059507489e-04</internalNodes>
+          <leafValues>
+            3.7875428795814514e-02 -1.2225220352411270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6881 1.1546639725565910e-02</internalNodes>
+          <leafValues>
+            1.5370969660580158e-02 -1.0286240279674530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6882 2.4446300230920315e-03</internalNodes>
+          <leafValues>
+            -5.1783051341772079e-02 1.0735079646110535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6883 4.5723789371550083e-03</internalNodes>
+          <leafValues>
+            -3.6362100392580032e-02 1.3289859890937805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6884 -1.1938340030610561e-02</internalNodes>
+          <leafValues>
+            -1.0882350057363510e-01 4.7698900103569031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6885 -4.1671381331980228e-03</internalNodes>
+          <leafValues>
+            1.1637099832296371e-01 -3.0638780444860458e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>399</maxWeakCount>
+      <stageThreshold>-1.2330470085144043e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 6886 3.3659618347883224e-02</internalNodes>
+          <leafValues>
+            -1.5576040744781494e-01 1.9109010696411133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6887 -1.5392389614135027e-03</internalNodes>
+          <leafValues>
+            7.2527736425399780e-02 -2.8808951377868652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6888 1.5648789703845978e-03</internalNodes>
+          <leafValues>
+            -1.1329220235347748e-01 1.5057389438152313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6889 5.6565739214420319e-04</internalNodes>
+          <leafValues>
+            -4.0502288937568665e-01 3.0235100537538528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6890 -2.9683491447940469e-04</internalNodes>
+          <leafValues>
+            -1.2592320144176483e-01 1.0352999716997147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6891 4.3946141377091408e-03</internalNodes>
+          <leafValues>
+            -1.0582420229911804e-01 2.3163750767707825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6892 3.2444300595670938e-03</internalNodes>
+          <leafValues>
+            5.0188560038805008e-02 -2.5477260351181030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6893 3.8864749949425459e-03</internalNodes>
+          <leafValues>
+            -1.4332659542560577e-01 2.9871070757508278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6894 3.3563380129635334e-03</internalNodes>
+          <leafValues>
+            -1.8739770352840424e-01 6.1354521661996841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6895 1.9797699525952339e-02</internalNodes>
+          <leafValues>
+            2.7567919343709946e-02 -7.3189876973628998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6896 3.3829871099442244e-03</internalNodes>
+          <leafValues>
+            -2.6915690302848816e-01 4.7561220824718475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6897 5.0223460420966148e-03</internalNodes>
+          <leafValues>
+            4.2572669684886932e-02 -2.0097489655017853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6898 1.4903279952704906e-03</internalNodes>
+          <leafValues>
+            -1.0160639882087708e-01 1.1291279643774033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6899 -5.5050072260200977e-03</internalNodes>
+          <leafValues>
+            -2.1760410070419312e-01 2.5067379698157310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6900 4.1127130389213562e-03</internalNodes>
+          <leafValues>
+            -1.3703300058841705e-01 6.6536687314510345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6901 1.9442260265350342e-02</internalNodes>
+          <leafValues>
+            4.2253911495208740e-02 -1.1731100082397461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6902 -1.9445870071649551e-02</internalNodes>
+          <leafValues>
+            2.8616631031036377e-01 -3.0423089861869812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6903 -1.5500449808314443e-03</internalNodes>
+          <leafValues>
+            -1.5157119929790497e-01 6.3723236322402954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6904 -3.2575910445302725e-03</internalNodes>
+          <leafValues>
+            6.1063949018716812e-02 -1.3006690144538879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6905 8.5774611216038465e-04</internalNodes>
+          <leafValues>
+            -6.2051288783550262e-02 5.4809290915727615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6906 6.8592262687161565e-04</internalNodes>
+          <leafValues>
+            -9.2828713357448578e-02 9.2287853360176086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6907 4.8905659466981888e-02</internalNodes>
+          <leafValues>
+            -1.2098040431737900e-02 2.4674870073795319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6908 -4.6415459364652634e-03</internalNodes>
+          <leafValues>
+            -1.7103439569473267e-01 5.1900148391723633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6909 -9.9253775551915169e-03</internalNodes>
+          <leafValues>
+            1.6824729740619659e-01 -4.3742731213569641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6910 -7.2820088826119900e-04</internalNodes>
+          <leafValues>
+            -1.5762010216712952e-01 4.9283239990472794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6911 7.1829417720437050e-03</internalNodes>
+          <leafValues>
+            -7.5083851814270020e-02 1.5677660703659058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6912 7.4819842120632529e-04</internalNodes>
+          <leafValues>
+            9.4303682446479797e-02 -9.4410486519336700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6913 1.3856319710612297e-02</internalNodes>
+          <leafValues>
+            4.2250029742717743e-02 -2.4046279489994049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6914 -5.0514908507466316e-03</internalNodes>
+          <leafValues>
+            2.0170919597148895e-01 -4.4972479343414307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6915 -2.5696419179439545e-03</internalNodes>
+          <leafValues>
+            -1.4004689455032349e-01 4.1754510253667831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6916 5.4275751113891602e-02</internalNodes>
+          <leafValues>
+            -2.6094799861311913e-02 2.8374740481376648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6917 -3.7299469113349915e-02</internalNodes>
+          <leafValues>
+            -5.8281177282333374e-01 1.3501949608325958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6918 3.0674990266561508e-03</internalNodes>
+          <leafValues>
+            5.6224178522825241e-02 -1.1995050311088562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6919 -3.5402809735387564e-03</internalNodes>
+          <leafValues>
+            6.6515468060970306e-02 -1.1834269762039185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6920 4.1401982307434082e-03</internalNodes>
+          <leafValues>
+            2.0988019183278084e-02 -3.1807440519332886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6921 -1.1183559894561768e-02</internalNodes>
+          <leafValues>
+            1.2467139959335327e-01 -4.1797909885644913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6922 1.0800679447129369e-03</internalNodes>
+          <leafValues>
+            4.5548491179943085e-02 -1.5857310593128204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6923 -7.7602718956768513e-03</internalNodes>
+          <leafValues>
+            -1.7031720280647278e-01 3.3989530056715012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6924 -3.1192360911518335e-03</internalNodes>
+          <leafValues>
+            9.6817880868911743e-02 -8.6022533476352692e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6925 -1.3673380017280579e-02</internalNodes>
+          <leafValues>
+            -2.2536599636077881e-01 1.5587169677019119e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6926 -2.0611209329217672e-03</internalNodes>
+          <leafValues>
+            -1.5269860625267029e-01 5.0227679312229156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6927 2.2635459899902344e-03</internalNodes>
+          <leafValues>
+            -4.2889460921287537e-02 7.6818563044071198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6928 -3.4530080854892731e-02</internalNodes>
+          <leafValues>
+            1.2874439358711243e-01 -6.7660316824913025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6929 6.1309239827096462e-03</internalNodes>
+          <leafValues>
+            -6.3456058502197266e-02 6.4237646758556366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6930 -1.0171280242502689e-02</internalNodes>
+          <leafValues>
+            -2.9192021489143372e-01 2.6645509526133537e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6931 -1.3060650229454041e-01</internalNodes>
+          <leafValues>
+            -9.6297067403793335e-01 1.5367489540949464e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6932 6.8621779792010784e-03</internalNodes>
+          <leafValues>
+            -4.7239519655704498e-02 1.5440399944782257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6933 1.2950079981237650e-03</internalNodes>
+          <leafValues>
+            -7.1122348308563232e-02 5.8697238564491272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6934 -5.6443549692630768e-03</internalNodes>
+          <leafValues>
+            -1.7261339724063873e-01 4.4769309461116791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6935 1.6346110403537750e-01</internalNodes>
+          <leafValues>
+            -2.1536830812692642e-02 3.6825808882713318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6936 1.4170600101351738e-02</internalNodes>
+          <leafValues>
+            2.3462019860744476e-02 -3.0498749017715454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6937 -1.0679910331964493e-01</internalNodes>
+          <leafValues>
+            3.1485679745674133e-01 -9.1049326583743095e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6938 7.0258649066090584e-03</internalNodes>
+          <leafValues>
+            -6.5418191254138947e-02 1.0200239717960358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6939 -4.3358937837183475e-03</internalNodes>
+          <leafValues>
+            1.1601199954748154e-01 -5.5041059851646423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6940 3.5394240170717239e-02</internalNodes>
+          <leafValues>
+            2.7795480564236641e-02 -2.5534549355506897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6941 2.1599680185317993e-02</internalNodes>
+          <leafValues>
+            -1.0513960383832455e-02 2.6087591052055359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6942 4.3032150715589523e-03</internalNodes>
+          <leafValues>
+            -4.6745400875806808e-02 1.3318620622158051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6943 7.8372862190008163e-03</internalNodes>
+          <leafValues>
+            6.1899811029434204e-02 -1.2405169755220413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6944 -1.6856989823281765e-03</internalNodes>
+          <leafValues>
+            -9.5696307718753815e-02 7.7667310833930969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6945 -4.1602249257266521e-03</internalNodes>
+          <leafValues>
+            6.5850533545017242e-02 -7.6837591826915741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6946 -5.0864819437265396e-02</internalNodes>
+          <leafValues>
+            5.2419060468673706e-01 -1.7342429608106613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6947 -6.4477883279323578e-02</internalNodes>
+          <leafValues>
+            -4.1972258687019348e-01 1.2231100350618362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6948 -2.4949579965323210e-03</internalNodes>
+          <leafValues>
+            6.4242206513881683e-02 -9.7457312047481537e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6949 3.2167730387300253e-03</internalNodes>
+          <leafValues>
+            -3.7902288138866425e-02 8.2197092473506927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6950 -2.3393060546368361e-03</internalNodes>
+          <leafValues>
+            -1.0608460009098053e-01 7.2004899382591248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6951 -8.0535542219877243e-03</internalNodes>
+          <leafValues>
+            -1.0991869866847992e-01 2.5643279775977135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6952 1.5007739886641502e-02</internalNodes>
+          <leafValues>
+            -3.1267128884792328e-02 2.0507030189037323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6953 -4.7144708223640919e-03</internalNodes>
+          <leafValues>
+            -1.4058899879455566e-01 4.8687249422073364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6954 -2.7188581228256226e-01</internalNodes>
+          <leafValues>
+            -7.7086192369461060e-01 8.2119107246398926e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6955 -3.7261729594320059e-03</internalNodes>
+          <leafValues>
+            7.8386418521404266e-02 -6.1110321432352066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6956 8.1726117059588432e-03</internalNodes>
+          <leafValues>
+            2.5872390717267990e-02 -2.4203300476074219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6957 -1.5384130179882050e-01</internalNodes>
+          <leafValues>
+            -8.3681619167327881e-01 1.0526239639148116e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6958 -4.2209690436720848e-03</internalNodes>
+          <leafValues>
+            1.0987819731235504e-01 -6.0973130166530609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6959 3.4641180187463760e-02</internalNodes>
+          <leafValues>
+            5.9377611614763737e-03 -7.3021429777145386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6960 -1.0757029522210360e-03</internalNodes>
+          <leafValues>
+            6.3253231346607208e-02 -9.3954533338546753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6961 6.0506182489916682e-04</internalNodes>
+          <leafValues>
+            -7.2633743286132812e-02 5.4847791790962219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6962 -4.9192002043128014e-03</internalNodes>
+          <leafValues>
+            -1.4617989957332611e-01 4.9854889512062073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6963 5.8641340583562851e-02</internalNodes>
+          <leafValues>
+            -1.4487889595329762e-02 2.1949279308319092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6964 -9.5993638038635254e-02</internalNodes>
+          <leafValues>
+            -4.2456990480422974e-01 1.5611169859766960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6965 -1.7546750605106354e-01</internalNodes>
+          <leafValues>
+            -5.7154530286788940e-01 2.7310380246490240e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6966 5.3192701190710068e-02</internalNodes>
+          <leafValues>
+            -2.0759610459208488e-02 3.1531611084938049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6967 -3.0862109735608101e-02</internalNodes>
+          <leafValues>
+            -4.0818691253662109e-01 9.1538606211543083e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6968 -2.9243549797683954e-03</internalNodes>
+          <leafValues>
+            1.6538919508457184e-01 -3.7048339843750000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6969 7.9757552593946457e-03</internalNodes>
+          <leafValues>
+            4.0010299533605576e-02 -1.0603089630603790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6970 1.0228200256824493e-01</internalNodes>
+          <leafValues>
+            9.6151717007160187e-03 -6.5299248695373535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6971 2.3435470648109913e-03</internalNodes>
+          <leafValues>
+            -4.3119609355926514e-02 1.1908730119466782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6972 -3.3627110533416271e-03</internalNodes>
+          <leafValues>
+            1.0518670082092285e-01 -6.9644443690776825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6973 4.9040392041206360e-03</internalNodes>
+          <leafValues>
+            4.8949901014566422e-02 -1.2949359416961670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6974 4.5119290007278323e-05</internalNodes>
+          <leafValues>
+            -1.6148559749126434e-01 4.1733540594577789e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6975 1.6195859760046005e-02</internalNodes>
+          <leafValues>
+            -1.2759320437908173e-02 2.0746350288391113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6976 -6.4254719763994217e-03</internalNodes>
+          <leafValues>
+            -1.3736939430236816e-01 4.3490421026945114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6977 -6.6467811120674014e-04</internalNodes>
+          <leafValues>
+            6.6771537065505981e-02 -7.4648462235927582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6978 -2.3743628989905119e-03</internalNodes>
+          <leafValues>
+            -1.2377700209617615e-01 5.1728729158639908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6979 -8.3166018128395081e-02</internalNodes>
+          <leafValues>
+            1.5261100232601166e-01 -2.1502759307622910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6980 1.3301270082592964e-03</internalNodes>
+          <leafValues>
+            -6.1925448477268219e-02 1.0591439902782440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6981 9.0925350785255432e-02</internalNodes>
+          <leafValues>
+            6.9404938258230686e-03 -5.1022678613662720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6982 5.7555912062525749e-03</internalNodes>
+          <leafValues>
+            5.2849009633064270e-02 -1.0758169740438461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6983 9.3440711498260498e-04</internalNodes>
+          <leafValues>
+            -1.0605130344629288e-01 4.7824278473854065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6984 5.2353799343109131e-02</internalNodes>
+          <leafValues>
+            -1.6387209296226501e-02 4.2318668961524963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6985 -2.4307209998369217e-02</internalNodes>
+          <leafValues>
+            1.3521690666675568e-01 -1.0088359937071800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6986 -1.3722239993512630e-02</internalNodes>
+          <leafValues>
+            -4.9520999193191528e-01 1.1784340254962444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6987 -1.1442030081525445e-03</internalNodes>
+          <leafValues>
+            4.3818730860948563e-02 -6.9104023277759552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6988 -7.8848190605640411e-02</internalNodes>
+          <leafValues>
+            3.5198599100112915e-01 -1.6464689746499062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6989 1.7305529909208417e-03</internalNodes>
+          <leafValues>
+            -6.6790081560611725e-02 8.2463577389717102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6990 -1.2928839772939682e-02</internalNodes>
+          <leafValues>
+            -8.1002123653888702e-02 8.5223287343978882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6991 8.7096104398369789e-03</internalNodes>
+          <leafValues>
+            -5.0021901726722717e-02 1.3493220508098602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6992 -6.3483066856861115e-02</internalNodes>
+          <leafValues>
+            -7.7681750059127808e-01 7.0912609808146954e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6993 -4.3746097944676876e-03</internalNodes>
+          <leafValues>
+            -1.3329389691352844e-01 4.2627040296792984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6994 -4.3985169380903244e-02</internalNodes>
+          <leafValues>
+            1.5131869912147522e-01 -4.0801558643579483e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6995 -6.0488767921924591e-03</internalNodes>
+          <leafValues>
+            -5.3645741194486618e-02 1.7832729965448380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6996 -5.1487190648913383e-04</internalNodes>
+          <leafValues>
+            6.2102951109409332e-02 -9.5339402556419373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6997 -3.3046479802578688e-03</internalNodes>
+          <leafValues>
+            -2.4732820689678192e-01 2.1977340802550316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6998 -3.0949179199524224e-04</internalNodes>
+          <leafValues>
+            -3.4656081348657608e-02 1.9599510729312897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6999 -8.3323381841182709e-03</internalNodes>
+          <leafValues>
+            1.7436729371547699e-01 -3.2631549984216690e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7000 6.6935829818248749e-03</internalNodes>
+          <leafValues>
+            2.5050759315490723e-02 -2.7362829446792603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7001 1.4068570453673601e-03</internalNodes>
+          <leafValues>
+            -2.9797010123729706e-02 6.5752580761909485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7002 4.0725398808717728e-02</internalNodes>
+          <leafValues>
+            1.4967479743063450e-02 -3.7111800909042358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7003 -2.1524120122194290e-02</internalNodes>
+          <leafValues>
+            3.7294471263885498e-01 -1.4142910018563271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7004 4.1689630597829819e-02</internalNodes>
+          <leafValues>
+            8.3227548748254776e-03 -6.6822868585586548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7005 -3.2075429335236549e-03</internalNodes>
+          <leafValues>
+            6.2741018831729889e-02 -1.3061609864234924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7006 2.6418430730700493e-02</internalNodes>
+          <leafValues>
+            6.6760168410837650e-03 -7.5557070970535278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7007 -5.1153838634490967e-02</internalNodes>
+          <leafValues>
+            -5.0382971763610840e-01 2.2476969752460718e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7008 1.5723450342193246e-03</internalNodes>
+          <leafValues>
+            -6.0214620083570480e-02 7.9933151602745056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7009 1.2616170570254326e-03</internalNodes>
+          <leafValues>
+            4.4674988836050034e-02 -8.3830736577510834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7010 -2.8608670458197594e-02</internalNodes>
+          <leafValues>
+            -3.0249071121215820e-01 1.6254810616374016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7011 1.4726459980010986e-02</internalNodes>
+          <leafValues>
+            -4.9459420144557953e-02 1.1457759886980057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7012 3.5319201648235321e-02</internalNodes>
+          <leafValues>
+            1.1276819743216038e-02 -4.8055538535118103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7013 2.2470189630985260e-01</internalNodes>
+          <leafValues>
+            -1.0596769861876965e-02 5.4026299715042114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7014 -7.0188841782510281e-03</internalNodes>
+          <leafValues>
+            -1.1836989969015121e-01 5.2995279431343079e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7015 -2.9194930568337440e-02</internalNodes>
+          <leafValues>
+            2.8498569130897522e-01 -1.4652130194008350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7016 -1.6918469918891788e-03</internalNodes>
+          <leafValues>
+            6.7731522023677826e-02 -7.4129588901996613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7017 1.3110489584505558e-02</internalNodes>
+          <leafValues>
+            -4.0418051183223724e-02 9.6537798643112183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7018 7.5334981374908239e-05</internalNodes>
+          <leafValues>
+            -7.3065057396888733e-02 7.1049667894840240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7019 2.9962710104882717e-03</internalNodes>
+          <leafValues>
+            2.4401130154728889e-02 -1.0679820179939270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7020 -4.1236128658056259e-02</internalNodes>
+          <leafValues>
+            2.5446560978889465e-01 -1.9801229238510132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7021 2.2827479988336563e-03</internalNodes>
+          <leafValues>
+            -5.9622149914503098e-02 8.6871787905693054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7022 -2.1318379731383175e-04</internalNodes>
+          <leafValues>
+            4.0506061166524887e-02 -1.2357629835605621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7023 4.1725938208401203e-03</internalNodes>
+          <leafValues>
+            4.1674789041280746e-02 -1.3029229640960693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7024 -1.7945859581232071e-02</internalNodes>
+          <leafValues>
+            2.5395989418029785e-01 -2.0783929154276848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7025 -6.0957930982112885e-02</internalNodes>
+          <leafValues>
+            -5.9399938583374023e-01 5.6327730417251587e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7026 -8.3080737385898829e-04</internalNodes>
+          <leafValues>
+            4.8011310398578644e-02 -1.1289869993925095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7027 2.7037229388952255e-02</internalNodes>
+          <leafValues>
+            2.6524379849433899e-02 -1.7208619415760040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7028 3.7293829955160618e-03</internalNodes>
+          <leafValues>
+            -5.0795450806617737e-02 1.1093439906835556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7029 -1.0271129431203008e-03</internalNodes>
+          <leafValues>
+            -8.9025869965553284e-02 4.9861740320920944e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7030 4.3261310202069581e-04</internalNodes>
+          <leafValues>
+            -7.6471529901027679e-02 7.2490736842155457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7031 -8.3997912704944611e-02</internalNodes>
+          <leafValues>
+            4.0178960561752319e-01 -8.4397885948419571e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7032 -3.4407388884574175e-03</internalNodes>
+          <leafValues>
+            -1.4326460659503937e-01 3.9170410484075546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7033 -2.1418789401650429e-02</internalNodes>
+          <leafValues>
+            1.5835569798946381e-01 -1.3701870106160641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7034 2.4877830874174833e-03</internalNodes>
+          <leafValues>
+            -5.6875430047512054e-02 1.0218720138072968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7035 -1.0390300303697586e-03</internalNodes>
+          <leafValues>
+            8.1530712544918060e-02 -4.7183711081743240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7036 4.6788761392235756e-04</internalNodes>
+          <leafValues>
+            7.0995680987834930e-02 -8.8464602828025818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7037 2.7436260133981705e-02</internalNodes>
+          <leafValues>
+            1.5190550126135349e-02 -1.2117669731378555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7038 -5.8917858405038714e-04</internalNodes>
+          <leafValues>
+            -8.1471607089042664e-02 6.8480782210826874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7039 7.9439081251621246e-02</internalNodes>
+          <leafValues>
+            -7.3907868936657906e-03 1.4902259409427643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7040 -3.5153090953826904e-02</internalNodes>
+          <leafValues>
+            4.1942089796066284e-01 -1.2480289675295353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7041 6.8230971693992615e-02</internalNodes>
+          <leafValues>
+            9.3489149585366249e-03 -2.5965470075607300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7042 8.1733033061027527e-02</internalNodes>
+          <leafValues>
+            1.5513390302658081e-02 -3.2704469561576843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7043 -3.0718350317329168e-03</internalNodes>
+          <leafValues>
+            6.6938467323780060e-02 -4.2225748300552368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7044 5.6301880627870560e-02</internalNodes>
+          <leafValues>
+            -2.5680650025606155e-02 2.1728150546550751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7045 2.5166019797325134e-02</internalNodes>
+          <leafValues>
+            2.3228300735354424e-02 -9.2791043221950531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7046 6.5088197588920593e-02</internalNodes>
+          <leafValues>
+            6.8949609994888306e-03 -8.2639491558074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7047 2.2007930092513561e-03</internalNodes>
+          <leafValues>
+            -7.4394248425960541e-02 8.7209381163120270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7048 -8.8553391396999359e-03</internalNodes>
+          <leafValues>
+            -1.3203050196170807e-01 3.7658430635929108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7049 6.0942411422729492e-02</internalNodes>
+          <leafValues>
+            1.0197839699685574e-02 -5.4252862930297852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7050 -5.2589550614356995e-04</internalNodes>
+          <leafValues>
+            4.8835718631744385e-01 -1.1828079819679260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7051 1.3005370274186134e-03</internalNodes>
+          <leafValues>
+            -3.8898441195487976e-01 1.4226339757442474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7052 -1.6531689465045929e-01</internalNodes>
+          <leafValues>
+            4.0004518628120422e-01 -1.2666770257055759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7053 1.8595480360090733e-03</internalNodes>
+          <leafValues>
+            4.7802660614252090e-02 -1.1368919909000397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7054 1.3065179809927940e-02</internalNodes>
+          <leafValues>
+            -3.3714219927787781e-02 1.5762269496917725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7055 3.1612750142812729e-02</internalNodes>
+          <leafValues>
+            7.6767429709434509e-03 -5.9641021490097046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7056 -2.2566620260477066e-02</internalNodes>
+          <leafValues>
+            1.0603710263967514e-01 -4.7383170574903488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7057 6.2679480761289597e-03</internalNodes>
+          <leafValues>
+            3.4595031291246414e-02 -7.7622346580028534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7058 -3.1758081167936325e-02</internalNodes>
+          <leafValues>
+            -3.2147431373596191e-01 1.5986470505595207e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7059 -2.1477609872817993e-02</internalNodes>
+          <leafValues>
+            2.0527760684490204e-01 -1.8074609339237213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7060 1.8594050779938698e-02</internalNodes>
+          <leafValues>
+            1.6375590115785599e-02 -2.9955211281776428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7061 1.4604429714381695e-02</internalNodes>
+          <leafValues>
+            -2.0433440804481506e-02 2.2725510597229004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7062 1.9902919884771109e-03</internalNodes>
+          <leafValues>
+            -5.8518249541521072e-02 1.0997360199689865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7063 9.7299525514245033e-03</internalNodes>
+          <leafValues>
+            3.1371861696243286e-02 -4.4369909912347794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7064 -2.3401379585266113e-03</internalNodes>
+          <leafValues>
+            9.6488200128078461e-02 -5.7249929755926132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7065 -1.9590060692280531e-03</internalNodes>
+          <leafValues>
+            -1.4031149446964264e-01 1.3546340167522430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7066 8.4066856652498245e-03</internalNodes>
+          <leafValues>
+            6.6289551556110382e-02 -8.0348283052444458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7067 5.2574548870325089e-02</internalNodes>
+          <leafValues>
+            -3.6297008395195007e-02 1.4638340473175049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7068 4.1065202094614506e-03</internalNodes>
+          <leafValues>
+            3.0372349545359612e-02 -1.8155770003795624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7069 -4.1818427853286266e-03</internalNodes>
+          <leafValues>
+            5.5590789765119553e-02 -3.7148520350456238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7070 -1.5470250509679317e-03</internalNodes>
+          <leafValues>
+            1.0347150266170502e-01 -4.6374730765819550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7071 -8.2695618038997054e-04</internalNodes>
+          <leafValues>
+            -9.3296989798545837e-02 4.3734461069107056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7072 4.1385791264474392e-03</internalNodes>
+          <leafValues>
+            -4.4266488403081894e-02 1.0968980193138123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7073 -3.3684119582176208e-02</internalNodes>
+          <leafValues>
+            -6.4337152242660522e-01 7.9893283545970917e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7074 5.2798818796873093e-02</internalNodes>
+          <leafValues>
+            -1.2490300461649895e-02 4.1572460532188416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7075 -2.9699259996414185e-01</internalNodes>
+          <leafValues>
+            -1.9598379731178284e-01 9.4300797209143639e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7076 1.1196310073137283e-01</internalNodes>
+          <leafValues>
+            1.1162719689309597e-02 -4.6838051080703735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7077 -1.8544310703873634e-02</internalNodes>
+          <leafValues>
+            -7.4080787599086761e-02 1.9528210163116455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7078 -1.0937429964542389e-02</internalNodes>
+          <leafValues>
+            8.8206529617309570e-02 -6.2830187380313873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7079 2.7186619117856026e-03</internalNodes>
+          <leafValues>
+            3.0855480581521988e-02 -9.2405863106250763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7080 2.0727319642901421e-02</internalNodes>
+          <leafValues>
+            -5.2543301135301590e-02 1.0608410090208054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7081 -2.7961930260062218e-02</internalNodes>
+          <leafValues>
+            2.1735160052776337e-01 -2.1356139332056046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7082 -9.0406360104680061e-03</internalNodes>
+          <leafValues>
+            -1.9535389542579651e-01 3.0077420175075531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7083 -1.0906349867582321e-02</internalNodes>
+          <leafValues>
+            1.4888639748096466e-01 -3.1188679859042168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7084 -3.8616119418293238e-03</internalNodes>
+          <leafValues>
+            -1.2094800174236298e-01 4.5144081115722656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7085 4.3162601068615913e-03</internalNodes>
+          <leafValues>
+            -1.0713649913668633e-02 2.8116491436958313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7086 -1.4098359970375896e-03</internalNodes>
+          <leafValues>
+            6.4685508608818054e-02 -9.9471300840377808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7087 3.2964099664241076e-03</internalNodes>
+          <leafValues>
+            1.4295330643653870e-01 -3.1101010739803314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7088 -2.9802869539707899e-03</internalNodes>
+          <leafValues>
+            -2.4578930437564850e-01 2.1760260686278343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7089 6.7178793251514435e-02</internalNodes>
+          <leafValues>
+            3.3457649406045675e-03 -4.5685601234436035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7090 2.9182849451899529e-02</internalNodes>
+          <leafValues>
+            -1.7016859725117683e-02 3.3545929193496704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7091 1.7935150535777211e-03</internalNodes>
+          <leafValues>
+            3.0516179278492928e-02 -1.2526740133762360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7092 2.0465679466724396e-02</internalNodes>
+          <leafValues>
+            -1.0909980162978172e-02 4.3552139401435852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7093 -2.6115079526789486e-04</internalNodes>
+          <leafValues>
+            3.8759760558605194e-02 -6.4098693430423737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7094 3.7161160726100206e-03</internalNodes>
+          <leafValues>
+            3.7150889635086060e-02 -1.5467320382595062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7095 -7.4094999581575394e-03</internalNodes>
+          <leafValues>
+            -8.2704223692417145e-02 6.2809906899929047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7096 1.7094809561967850e-02</internalNodes>
+          <leafValues>
+            -4.8347331583499908e-02 9.8770812153816223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7097 -3.0473200604319572e-03</internalNodes>
+          <leafValues>
+            -1.0638830065727234e-01 3.0948650091886520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7098 3.4502498805522919e-02</internalNodes>
+          <leafValues>
+            1.0997230187058449e-02 -4.2861738801002502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7099 -2.6834919117391109e-03</internalNodes>
+          <leafValues>
+            -1.4986449480056763e-01 3.3157639205455780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7100 9.2392861843109131e-03</internalNodes>
+          <leafValues>
+            -3.7733338773250580e-02 1.5778259932994843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7101 8.8205106556415558e-02</internalNodes>
+          <leafValues>
+            -1.0704769752919674e-02 3.2353109121322632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7102 7.7868886291980743e-02</internalNodes>
+          <leafValues>
+            1.0804659686982632e-02 -4.4243350625038147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7103 -3.1202291138470173e-03</internalNodes>
+          <leafValues>
+            2.0444509387016296e-01 -2.3976439610123634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7104 2.6000461075454950e-03</internalNodes>
+          <leafValues>
+            4.5765019953250885e-02 -1.0138899832963943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7105 7.0194108411669731e-03</internalNodes>
+          <leafValues>
+            2.5740729644894600e-02 -4.9060840159654617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7106 -2.4108150973916054e-03</internalNodes>
+          <leafValues>
+            -1.1837480217218399e-01 4.8649929463863373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7107 4.9886249005794525e-02</internalNodes>
+          <leafValues>
+            -1.4449880458414555e-02 2.0894059538841248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7108 -7.2655039839446545e-03</internalNodes>
+          <leafValues>
+            8.9042186737060547e-02 -4.9845550209283829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7109 1.0560270398855209e-02</internalNodes>
+          <leafValues>
+            5.2911709994077682e-02 -1.1509139835834503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7110 5.6417449377477169e-03</internalNodes>
+          <leafValues>
+            -6.8672746419906616e-02 7.7489316463470459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7111 4.3234648182988167e-03</internalNodes>
+          <leafValues>
+            -7.9207062721252441e-02 5.3491309285163879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7112 1.1184070259332657e-02</internalNodes>
+          <leafValues>
+            7.1656093001365662e-02 -1.0634940117597580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7113 -9.9230423569679260e-02</internalNodes>
+          <leafValues>
+            3.7169519066810608e-01 -6.6843931563198566e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7114 -4.4848727993667126e-03</internalNodes>
+          <leafValues>
+            7.5577408075332642e-02 -6.9481082260608673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7115 -1.9104180857539177e-02</internalNodes>
+          <leafValues>
+            -1.7291219532489777e-01 1.1360409669578075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7116 -1.7672680551186204e-03</internalNodes>
+          <leafValues>
+            9.2567160725593567e-02 -5.2470050752162933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7117 5.9071529656648636e-02</internalNodes>
+          <leafValues>
+            9.2153968289494514e-03 -2.6687648892402649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7118 -3.4362819045782089e-02</internalNodes>
+          <leafValues>
+            -5.7914721965789795e-01 7.9972539097070694e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7119 5.6766539812088013e-02</internalNodes>
+          <leafValues>
+            5.8937501162290573e-03 -5.2275192737579346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7120 -1.2173549830913544e-01</internalNodes>
+          <leafValues>
+            -5.2229601144790649e-01 7.9296948388218880e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7121 3.4274619072675705e-02</internalNodes>
+          <leafValues>
+            -1.7069879919290543e-02 1.2958990037441254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7122 -6.7191021516919136e-03</internalNodes>
+          <leafValues>
+            1.1187720298767090e-01 -4.4685728847980499e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7123 3.1698260456323624e-02</internalNodes>
+          <leafValues>
+            2.8529319912195206e-02 -1.1617069691419601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7124 -9.5326751470565796e-02</internalNodes>
+          <leafValues>
+            3.6362048983573914e-01 -1.3523319736123085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7125 1.2620569765567780e-01</internalNodes>
+          <leafValues>
+            6.0956259258091450e-03 -8.4947621822357178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7126 -2.7324870228767395e-02</internalNodes>
+          <leafValues>
+            -2.9046019911766052e-01 1.4303879812359810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7127 -7.3618680238723755e-02</internalNodes>
+          <leafValues>
+            4.8824289441108704e-01 -1.0269859805703163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7128 5.0417389720678329e-03</internalNodes>
+          <leafValues>
+            -8.4770277142524719e-02 5.6035611778497696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7129 2.7569099329411983e-03</internalNodes>
+          <leafValues>
+            -4.8269480466842651e-02 3.8525570183992386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7130 2.1967370063066483e-02</internalNodes>
+          <leafValues>
+            8.6190566420555115e-02 -8.0797329545021057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7131 -3.8637530803680420e-01</internalNodes>
+          <leafValues>
+            -8.3998018503189087e-01 3.6657860036939383e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7132 -4.1083219647407532e-01</internalNodes>
+          <leafValues>
+            -9.7182428836822510e-01 3.9403690025210381e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7133 -4.1033279150724411e-02</internalNodes>
+          <leafValues>
+            1. -3.3212041016668081e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7134 2.4305000901222229e-02</internalNodes>
+          <leafValues>
+            1.8234970048069954e-02 -2.4954320490360260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7135 1.6170740127563477e-03</internalNodes>
+          <leafValues>
+            -1.2958160042762756e-01 3.2725200057029724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7136 4.4785268604755402e-02</internalNodes>
+          <leafValues>
+            -2.3868849501013756e-02 1.9763439893722534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7137 4.0209591388702393e-02</internalNodes>
+          <leafValues>
+            5.3034191951155663e-03 -6.6284531354904175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7138 3.3616109285503626e-03</internalNodes>
+          <leafValues>
+            3.0226179957389832e-01 -1.6103280708193779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7139 -1.1624400503933430e-03</internalNodes>
+          <leafValues>
+            -2.7934190630912781e-01 1.8276169896125793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7140 5.5524259805679321e-02</internalNodes>
+          <leafValues>
+            -6.5288958139717579e-03 7.5690442323684692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7141 4.6308599412441254e-03</internalNodes>
+          <leafValues>
+            2.8254630044102669e-02 -9.4945177435874939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7142 2.7387610170990229e-03</internalNodes>
+          <leafValues>
+            -4.6980410814285278e-02 9.4511218369007111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7143 2.9127181041985750e-03</internalNodes>
+          <leafValues>
+            -2.2264670580625534e-02 7.2091333568096161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7144 -2.3628510534763336e-02</internalNodes>
+          <leafValues>
+            -3.9147511124610901e-01 1.2840859591960907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7145 7.1669870521873236e-04</internalNodes>
+          <leafValues>
+            2.0413680002093315e-02 -1.6587799787521362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7146 3.2723631709814072e-02</internalNodes>
+          <leafValues>
+            8.5352789610624313e-03 -5.1838648319244385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7147 5.6393269449472427e-02</internalNodes>
+          <leafValues>
+            -2.4937599897384644e-02 1.9025549292564392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7148 2.9392001032829285e-01</internalNodes>
+          <leafValues>
+            5.7944031432271004e-03 -8.5530591011047363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7149 -5.6904228404164314e-03</internalNodes>
+          <leafValues>
+            -2.4354919791221619e-01 1.0601679794490337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7150 9.8184328526258469e-03</internalNodes>
+          <leafValues>
+            -1.3599770143628120e-02 3.3795401453971863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7151 -3.6970589309930801e-02</internalNodes>
+          <leafValues>
+            -5.7309299707412720e-01 1.0090970434248447e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7152 1.8607610836625099e-02</internalNodes>
+          <leafValues>
+            -1.2938570231199265e-02 4.1123750805854797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7153 -1.5049210051074624e-03</internalNodes>
+          <leafValues>
+            -8.4678567945957184e-02 3.3724751323461533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7154 -3.9040379226207733e-02</internalNodes>
+          <leafValues>
+            -4.7390699386596680e-01 9.5385275781154633e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7155 -3.4379279240965843e-03</internalNodes>
+          <leafValues>
+            1.4112870395183563e-01 -2.2367769852280617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7156 -1.1330900015309453e-03</internalNodes>
+          <leafValues>
+            -1.3950189948081970e-01 3.2505869865417480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7157 -6.5370470285415649e-02</internalNodes>
+          <leafValues>
+            1.4801700413227081e-01 -2.2039920091629028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7158 -2.0970970392227173e-01</internalNodes>
+          <leafValues>
+            -7.4392271041870117e-01 7.5829490087926388e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7159 -5.8827060274779797e-03</internalNodes>
+          <leafValues>
+            -6.3253037631511688e-02 2.3363839834928513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7160 -2.9759449884295464e-02</internalNodes>
+          <leafValues>
+            4.8733299970626831e-01 -9.2995148152112961e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7161 -5.3064361214637756e-02</internalNodes>
+          <leafValues>
+            -3.8064101338386536e-01 5.6431228294968605e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7162 6.6667333245277405e-02</internalNodes>
+          <leafValues>
+            4.6323328278958797e-03 -9.1536080837249756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7163 -9.2325232923030853e-02</internalNodes>
+          <leafValues>
+            2.9184600710868835e-01 -7.4540497735142708e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7164 8.5644036531448364e-02</internalNodes>
+          <leafValues>
+            -1.0288530029356480e-02 4.1251561045646667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7165 2.2969970107078552e-01</internalNodes>
+          <leafValues>
+            -4.6802540309727192e-03 3.6509141325950623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7166 8.7508037686347961e-03</internalNodes>
+          <leafValues>
+            7.7816851437091827e-02 -6.3657559454441071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7167 5.7104961015284061e-03</internalNodes>
+          <leafValues>
+            -5.9653200209140778e-02 4.2732730507850647e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7168 -4.8026451840996742e-03</internalNodes>
+          <leafValues>
+            -9.8918512463569641e-02 4.4956978410482407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7169 3.2986800651997328e-03</internalNodes>
+          <leafValues>
+            3.3164538443088531e-02 -1.3477820158004761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7170 -4.0092850103974342e-03</internalNodes>
+          <leafValues>
+            1.3551770150661469e-01 -3.7139780819416046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7171 -7.7049341052770615e-04</internalNodes>
+          <leafValues>
+            2.6690600439906120e-02 -8.4502391517162323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7172 2.3074099794030190e-02</internalNodes>
+          <leafValues>
+            -2.6398969814181328e-02 1.8520879745483398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7173 9.9315540865063667e-03</internalNodes>
+          <leafValues>
+            2.1702500060200691e-02 -1.4147830009460449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7174 -4.3977480381727219e-02</internalNodes>
+          <leafValues>
+            -5.9306997060775757e-01 7.6594059355556965e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7175 -2.1170598920434713e-03</internalNodes>
+          <leafValues>
+            9.6989497542381287e-02 -4.9988958984613419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7176 -1.1178949847817421e-02</internalNodes>
+          <leafValues>
+            -1.5058480203151703e-01 3.1385689973831177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7177 -1.1888720327988267e-03</internalNodes>
+          <leafValues>
+            8.7665252387523651e-02 -6.8861946463584900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7178 -1.2205859646201134e-02</internalNodes>
+          <leafValues>
+            8.2670666277408600e-02 -6.5326899290084839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7179 -3.7645969539880753e-02</internalNodes>
+          <leafValues>
+            -4.8226159811019897e-01 5.5899759754538536e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7180 -1.7758710309863091e-03</internalNodes>
+          <leafValues>
+            -9.1606341302394867e-02 5.8380361646413803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7181 -1.1116299778223038e-02</internalNodes>
+          <leafValues>
+            1.4710609614849091e-01 -2.9255999252200127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7182 4.3831788934767246e-04</internalNodes>
+          <leafValues>
+            -1.0494749993085861e-01 4.4445890933275223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7183 -9.8695211112499237e-02</internalNodes>
+          <leafValues>
+            2.6521149277687073e-01 -9.5453672111034393e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7184 1.1736120097339153e-02</internalNodes>
+          <leafValues>
+            2.8968680649995804e-02 -1.5355010330677032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7185 -3.6601141095161438e-02</internalNodes>
+          <leafValues>
+            2.4063609540462494e-01 -2.2525599226355553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7186 -5.2371289581060410e-02</internalNodes>
+          <leafValues>
+            -4.9006670713424683e-01 1.0319559834897518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7187 -3.1134579330682755e-03</internalNodes>
+          <leafValues>
+            6.2287129461765289e-02 -4.5234039425849915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7188 1.0345289483666420e-03</internalNodes>
+          <leafValues>
+            -5.6548729538917542e-02 1.1970130354166031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7189 -2.3240610025823116e-03</internalNodes>
+          <leafValues>
+            -9.5265246927738190e-02 3.2402478158473969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7190 -2.7458980679512024e-02</internalNodes>
+          <leafValues>
+            2.9548159241676331e-01 -1.6016509383916855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7191 -9.3150883913040161e-03</internalNodes>
+          <leafValues>
+            -1.1465849727392197e-01 2.8171680867671967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7192 7.6356199570000172e-03</internalNodes>
+          <leafValues>
+            2.9264479875564575e-02 -1.6166350245475769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7193 1.6107590869069099e-02</internalNodes>
+          <leafValues>
+            -3.0923349782824516e-02 1.6677390038967133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7194 6.1460789293050766e-02</internalNodes>
+          <leafValues>
+            8.1282109022140503e-03 -5.4833447933197021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7195 4.3377321213483810e-02</internalNodes>
+          <leafValues>
+            -7.7782347798347473e-03 3.5578370094299316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7196 -1.5809480100870132e-02</internalNodes>
+          <leafValues>
+            -3.1237179040908813e-01 1.4910760335624218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7197 -4.3263029307126999e-02</internalNodes>
+          <leafValues>
+            4.7393178939819336e-01 -9.4731850549578667e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7198 1.0775650152936578e-03</internalNodes>
+          <leafValues>
+            -1.0892640054225922e-01 5.0780758261680603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7199 -6.8012787960469723e-03</internalNodes>
+          <leafValues>
+            -9.3841306865215302e-02 3.8555730134248734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7200 -3.8845991366542876e-04</internalNodes>
+          <leafValues>
+            6.4071871340274811e-02 -9.3577213585376740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7201 3.8177249953150749e-03</internalNodes>
+          <leafValues>
+            -4.7590740025043488e-02 7.1997672319412231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7202 -3.1246189028024673e-03</internalNodes>
+          <leafValues>
+            1.5269869565963745e-01 -4.8789650201797485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7203 6.0980509966611862e-02</internalNodes>
+          <leafValues>
+            8.0068446695804596e-03 -6.7602759599685669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7204 2.1819709800183773e-03</internalNodes>
+          <leafValues>
+            -6.8491749465465546e-02 7.5863577425479889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7205 2.4469599593430758e-03</internalNodes>
+          <leafValues>
+            -7.4371293187141418e-02 3.2011859118938446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7206 1.4674840494990349e-03</internalNodes>
+          <leafValues>
+            -1.1912509799003601e-01 4.6667739748954773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7207 -2.1786419674754143e-03</internalNodes>
+          <leafValues>
+            -6.5324276685714722e-02 7.6355278491973877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7208 -2.8284740983508527e-04</internalNodes>
+          <leafValues>
+            5.8292400091886520e-02 -8.7847188115119934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7209 1.4723110012710094e-02</internalNodes>
+          <leafValues>
+            1.9820490479469299e-01 -2.4962980300188065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7210 4.6598021872341633e-03</internalNodes>
+          <leafValues>
+            -9.3732737004756927e-02 5.4197840392589569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7211 -6.0316991060972214e-02</internalNodes>
+          <leafValues>
+            -6.2958812713623047e-01 6.8706739693880081e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7212 -3.6654649302363396e-03</internalNodes>
+          <leafValues>
+            3.6130189895629883e-02 -1.2816099822521210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7213 1.4875479973852634e-02</internalNodes>
+          <leafValues>
+            -2.4313909932971001e-02 4.6657409518957138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7214 1.1842879652976990e-01</internalNodes>
+          <leafValues>
+            1.0476130060851574e-02 -5.1786392927169800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7215 1.9809199869632721e-01</internalNodes>
+          <leafValues>
+            1.0157800279557705e-02 -4.1872209310531616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7216 -1.0167530179023743e-01</internalNodes>
+          <leafValues>
+            -8.5121291875839233e-01 4.4935508631169796e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7217 -3.0325200408697128e-02</internalNodes>
+          <leafValues>
+            -3.1803390383720398e-01 6.4301840029656887e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7218 3.4531850367784500e-02</internalNodes>
+          <leafValues>
+            -1.2561430223286152e-02 3.4778198599815369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7219 -3.5133380442857742e-02</internalNodes>
+          <leafValues>
+            1.1475030332803726e-01 -1.7527149990200996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7220 5.3501729853451252e-03</internalNodes>
+          <leafValues>
+            3.5263419151306152e-02 -1.3867680728435516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7221 3.1209299340844154e-02</internalNodes>
+          <leafValues>
+            -2.0925100892782211e-02 1.4748610556125641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7222 -5.5827602045610547e-04</internalNodes>
+          <leafValues>
+            -9.5544241368770599e-02 5.6234899908304214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7223 -2.1599860489368439e-01</internalNodes>
+          <leafValues>
+            5.9710198640823364e-01 -3.9994427934288979e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7224 7.7018201351165771e-02</internalNodes>
+          <leafValues>
+            -1.2182369828224182e-02 3.5995039343833923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7225 -2.5808349251747131e-02</internalNodes>
+          <leafValues>
+            -1.9994600117206573e-01 1.6562040895223618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7226 4.0148189291357994e-03</internalNodes>
+          <leafValues>
+            3.8874860852956772e-02 -1.1775989830493927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7227 7.4287859206378926e-06</internalNodes>
+          <leafValues>
+            3.1405460089445114e-02 -4.9142509698867798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7228 -2.8249230235815048e-03</internalNodes>
+          <leafValues>
+            -5.5889118462800980e-02 1.1791130155324936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7229 -2.2713130339980125e-02</internalNodes>
+          <leafValues>
+            1.0733339935541153e-01 -4.1647680103778839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7230 -1.0052169673144817e-02</internalNodes>
+          <leafValues>
+            -1.4102290570735931e-01 3.7707269191741943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7231 -2.1023969352245331e-01</internalNodes>
+          <leafValues>
+            -6.3184642791748047e-01 3.6316630430519581e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7232 -1.1812710203230381e-02</internalNodes>
+          <leafValues>
+            1.2123010307550430e-01 -5.0373788923025131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7233 6.3666589558124542e-03</internalNodes>
+          <leafValues>
+            3.0198849737644196e-02 -9.5920257270336151e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7234 -1.2146410346031189e-01</internalNodes>
+          <leafValues>
+            -6.8696069717407227e-01 6.8671889603137970e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7235 2.3568300530314445e-02</internalNodes>
+          <leafValues>
+            -1.0376869700849056e-02 2.6333120465278625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7236 -4.9841329455375671e-03</internalNodes>
+          <leafValues>
+            5.2314449101686478e-02 -8.6597919464111328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7237 1.4171230141073465e-03</internalNodes>
+          <leafValues>
+            -4.1445188224315643e-02 9.3332767486572266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7238 1.6522710211575031e-03</internalNodes>
+          <leafValues>
+            2.7292339131236076e-02 -1.7193740606307983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7239 -4.2191468179225922e-02</internalNodes>
+          <leafValues>
+            7.7588337659835815e-01 -2.4552440736442804e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7240 -1.5193390427157283e-03</internalNodes>
+          <leafValues>
+            2.3297169804573059e-01 -1.9499920308589935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7241 -5.9203859418630600e-03</internalNodes>
+          <leafValues>
+            -8.3495929837226868e-02 1.9756000488996506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7242 6.4658280462026596e-03</internalNodes>
+          <leafValues>
+            -4.0668301284313202e-02 1.2236029654741287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7243 -4.8110671341419220e-02</internalNodes>
+          <leafValues>
+            -3.1629499793052673e-01 1.2694340199232101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7244 5.0246939063072205e-03</internalNodes>
+          <leafValues>
+            3.1356900930404663e-02 -1.9190339744091034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7245 1.1158010363578796e-01</internalNodes>
+          <leafValues>
+            -1.4073889702558517e-02 1.7848959565162659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7246 -6.4665876328945160e-02</internalNodes>
+          <leafValues>
+            -5.6230849027633667e-01 8.2082729786634445e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7247 -5.7942468672990799e-02</internalNodes>
+          <leafValues>
+            7.7341747283935547e-01 -4.3547940440475941e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7248 -8.1669846549630165e-03</internalNodes>
+          <leafValues>
+            2.1019349992275238e-01 -2.0802220329642296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7249 2.8506839647889137e-02</internalNodes>
+          <leafValues>
+            8.1413127481937408e-02 -6.2663510441780090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7250 2.4857679381966591e-03</internalNodes>
+          <leafValues>
+            -1.5635970234870911e-01 3.5210859030485153e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7251 1.9798949360847473e-02</internalNodes>
+          <leafValues>
+            1.1353739537298679e-02 -1.6531160473823547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7252 -2.7027919888496399e-02</internalNodes>
+          <leafValues>
+            2.8912219405174255e-01 -1.6753070056438446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7253 -6.9706928916275501e-03</internalNodes>
+          <leafValues>
+            -2.5769388675689697e-01 1.6355020925402641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7254 1.1425119591876864e-03</internalNodes>
+          <leafValues>
+            -4.1056800633668900e-02 1.1580900102853775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7255 -1.3041249476373196e-03</internalNodes>
+          <leafValues>
+            5.1082979887723923e-02 -1.1724369972944260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7256 3.7698419764637947e-03</internalNodes>
+          <leafValues>
+            5.8557331562042236e-02 -8.2840107381343842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7257 -4.8689868301153183e-02</internalNodes>
+          <leafValues>
+            -3.8769158720970154e-01 8.6165666580200195e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7258 -1.1471740156412125e-01</internalNodes>
+          <leafValues>
+            1.3444100320339203e-01 -4.2848691344261169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7259 2.3503519594669342e-02</internalNodes>
+          <leafValues>
+            3.8586359005421400e-03 -4.3615299463272095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7260 -5.9582752874121070e-04</internalNodes>
+          <leafValues>
+            4.2376730591058731e-02 -1.2161590158939362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7261 5.4052029736340046e-03</internalNodes>
+          <leafValues>
+            -2.3753000423312187e-02 2.0137269794940948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7262 9.1158300638198853e-03</internalNodes>
+          <leafValues>
+            2.8088169172406197e-02 -1.9667729735374451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7263 3.3211729023605585e-03</internalNodes>
+          <leafValues>
+            -5.1258899271488190e-02 4.7993980348110199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7264 1.2975499965250492e-02</internalNodes>
+          <leafValues>
+            1.1851020157337189e-02 -3.9444020390510559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7265 -5.0546238198876381e-03</internalNodes>
+          <leafValues>
+            -1.0956159979104996e-01 4.2662780731916428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7266 -7.6824478805065155e-02</internalNodes>
+          <leafValues>
+            7.6269572973251343e-01 -6.6229291260242462e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7267 -1.8690669676288962e-03</internalNodes>
+          <leafValues>
+            4.0112659335136414e-02 -7.1398198604583740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7268 -6.0407500714063644e-03</internalNodes>
+          <leafValues>
+            1.2614290416240692e-01 -3.9585150778293610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7269 -4.5013230293989182e-02</internalNodes>
+          <leafValues>
+            -2.1871440112590790e-01 6.5213250927627087e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7270 3.8492688909173012e-03</internalNodes>
+          <leafValues>
+            -9.2213302850723267e-02 6.6925182938575745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7271 -4.3247821740806103e-03</internalNodes>
+          <leafValues>
+            1.4973750710487366e-01 -3.1123559921979904e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7272 -2.6776840910315514e-02</internalNodes>
+          <leafValues>
+            -1.1432229727506638e-01 5.3090259432792664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7273 2.0645130425691605e-03</internalNodes>
+          <leafValues>
+            -3.8483418524265289e-02 7.1507766842842102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7274 5.7206518948078156e-02</internalNodes>
+          <leafValues>
+            1.2463140301406384e-02 -3.9884459972381592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7275 7.7696829102933407e-03</internalNodes>
+          <leafValues>
+            -2.4309959262609482e-02 6.1120841652154922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7276 2.8191099409013987e-03</internalNodes>
+          <leafValues>
+            6.2243871390819550e-02 -7.9774282872676849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7277 -5.1747109740972519e-02</internalNodes>
+          <leafValues>
+            -2.0475579798221588e-01 9.8433922976255417e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7278 4.2840079404413700e-03</internalNodes>
+          <leafValues>
+            -3.6799129098653793e-02 1.2380699813365936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7279 -8.0563372466713190e-04</internalNodes>
+          <leafValues>
+            -5.3742490708827972e-02 6.8746432662010193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7280 4.6062450855970383e-02</internalNodes>
+          <leafValues>
+            7.3871058411896229e-03 -6.1133211851119995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7281 6.6807270050048828e-02</internalNodes>
+          <leafValues>
+            -1.2545309960842133e-02 1.5731689333915710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7282 2.0568699110299349e-03</internalNodes>
+          <leafValues>
+            4.3087389320135117e-02 -1.1062700301408768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7283 2.8760819695889950e-03</internalNodes>
+          <leafValues>
+            2.5800980627536774e-02 -8.4697857499122620e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7284 -4.9642049707472324e-03</internalNodes>
+          <leafValues>
+            8.3168722689151764e-02 -5.6750860065221786e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>385</maxWeakCount>
+      <stageThreshold>-1.1474020481109619e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 7285 1.5166849829256535e-02</internalNodes>
+          <leafValues>
+            -1.7501029372215271e-01 1.5165300667285919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7286 4.1852002032101154e-03</internalNodes>
+          <leafValues>
+            -1.8253259360790253e-01 1.0545530170202255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7287 -2.6159440167248249e-03</internalNodes>
+          <leafValues>
+            -2.1517610549926758e-01 7.7460259199142456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7288 2.7645078953355551e-03</internalNodes>
+          <leafValues>
+            -1.1506909877061844e-01 6.7771263420581818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7289 -2.7296729967929423e-04</internalNodes>
+          <leafValues>
+            5.5712651461362839e-02 -2.8723669052124023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7290 2.4992981343530118e-04</internalNodes>
+          <leafValues>
+            5.5202499032020569e-02 -1.5191499888896942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7291 1.3287579640746117e-03</internalNodes>
+          <leafValues>
+            -1.2567579746246338e-01 9.4094827771186829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7292 -2.4653770960867405e-03</internalNodes>
+          <leafValues>
+            4.9393590539693832e-02 -2.2239279747009277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7293 -3.2979049719870090e-03</internalNodes>
+          <leafValues>
+            -1.7367990314960480e-01 6.9391071796417236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7294 -4.9667809158563614e-02</internalNodes>
+          <leafValues>
+            3.2854220271110535e-01 -3.3067218959331512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7295 5.7844468392431736e-03</internalNodes>
+          <leafValues>
+            6.1289519071578979e-02 -1.6873429715633392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7296 2.9754149727523327e-03</internalNodes>
+          <leafValues>
+            -2.4017000198364258e-01 5.7906478643417358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7297 2.3769649851601571e-04</internalNodes>
+          <leafValues>
+            1.1141020059585571e-01 -8.6508020758628845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7298 5.4410300217568874e-03</internalNodes>
+          <leafValues>
+            -8.9257702231407166e-02 2.8492979705333710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7299 2.5746610481292009e-03</internalNodes>
+          <leafValues>
+            6.0383580625057220e-02 -1.4771540462970734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7300 -1.2155439704656601e-02</internalNodes>
+          <leafValues>
+            1.8026730418205261e-01 -3.5744961351156235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7301 5.5069979280233383e-03</internalNodes>
+          <leafValues>
+            6.1453469097614288e-02 -1.6147279739379883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7302 -3.0918378615751863e-04</internalNodes>
+          <leafValues>
+            -9.1295689344406128e-02 6.8111963570117950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7303 -7.7705271542072296e-02</internalNodes>
+          <leafValues>
+            3.3344480395317078e-01 -2.6795169338583946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7304 4.5874878764152527e-02</internalNodes>
+          <leafValues>
+            6.2387371435761452e-03 -2.2738909721374512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7305 3.1658360967412591e-04</internalNodes>
+          <leafValues>
+            -1.1297920346260071e-01 9.8602570593357086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7306 -5.2962768822908401e-02</internalNodes>
+          <leafValues>
+            -6.0117399692535400e-01 1.0004489682614803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7307 5.3028380498290062e-03</internalNodes>
+          <leafValues>
+            3.6164399236440659e-02 -2.6359859108924866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7308 -2.3473590612411499e-02</internalNodes>
+          <leafValues>
+            1.0663519799709320e-01 -3.0653990805149078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7309 -1.5029460191726685e-03</internalNodes>
+          <leafValues>
+            6.2882840633392334e-02 -1.2285350263118744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7310 -1.2232650071382523e-02</internalNodes>
+          <leafValues>
+            -2.3047080636024475e-01 4.0048789232969284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7311 -4.7428268939256668e-02</internalNodes>
+          <leafValues>
+            4.4135141372680664e-01 -1.8873579800128937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7312 3.6379251629114151e-02</internalNodes>
+          <leafValues>
+            -1.3020380400121212e-02 1.4685730636119843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7313 3.6343511193990707e-02</internalNodes>
+          <leafValues>
+            3.8788039237260818e-02 -1.9903139770030975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7314 -1.0792929679155350e-01</internalNodes>
+          <leafValues>
+            1.6177520155906677e-01 -6.3546439632773399e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7315 -9.5479741692543030e-02</internalNodes>
+          <leafValues>
+            3.7320658564567566e-01 -2.3940289393067360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7316 3.8954298943281174e-02</internalNodes>
+          <leafValues>
+            1.1239799670875072e-02 -3.4794488549232483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7317 -3.2646209001541138e-02</internalNodes>
+          <leafValues>
+            -3.1797638535499573e-01 2.1780189126729965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7318 -2.5872089900076389e-03</internalNodes>
+          <leafValues>
+            4.7268610447645187e-02 -1.5624779462814331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7319 1.2979200109839439e-02</internalNodes>
+          <leafValues>
+            -2.4394070729613304e-02 3.0341750383377075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7320 -1.7490500584244728e-02</internalNodes>
+          <leafValues>
+            1.1967100203037262e-01 -3.4825209528207779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7321 8.2290060818195343e-03</internalNodes>
+          <leafValues>
+            5.1706299185752869e-02 -1.4124310016632080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7322 8.7701035663485527e-03</internalNodes>
+          <leafValues>
+            1.2139629572629929e-02 -9.3410186469554901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7323 -2.5523800868541002e-03</internalNodes>
+          <leafValues>
+            9.1882079839706421e-02 -7.9693943262100220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7324 1.2640489730983973e-03</internalNodes>
+          <leafValues>
+            -4.2868331074714661e-02 9.8469160497188568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7325 -3.8762169424444437e-03</internalNodes>
+          <leafValues>
+            6.4477890729904175e-02 -1.1426970362663269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7326 1.5416350215673447e-03</internalNodes>
+          <leafValues>
+            -3.8240168243646622e-02 5.0880789756774902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7327 7.6829752651974559e-04</internalNodes>
+          <leafValues>
+            -1.2869219481945038e-01 5.8161370456218719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7328 1.6587260179221630e-03</internalNodes>
+          <leafValues>
+            1.6391919553279877e-01 -4.7164998948574066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7329 1.6514799790456891e-03</internalNodes>
+          <leafValues>
+            -5.9221718460321426e-02 1.3165080547332764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7330 -3.8682940066792071e-04</internalNodes>
+          <leafValues>
+            6.4493581652641296e-02 -1.0728739947080612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7331 -3.4595469478517771e-03</internalNodes>
+          <leafValues>
+            8.0743201076984406e-02 -9.2568591237068176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7332 3.5130660980939865e-02</internalNodes>
+          <leafValues>
+            1.5520620159804821e-02 -1.9732579588890076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7333 1.2025350332260132e-01</internalNodes>
+          <leafValues>
+            -2.0497029647231102e-02 4.0905651450157166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7334 7.8581331763416529e-04</internalNodes>
+          <leafValues>
+            -9.4858787953853607e-02 6.9316640496253967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7335 6.1606317758560181e-03</internalNodes>
+          <leafValues>
+            6.0556668788194656e-02 -1.2436509877443314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7336 1.3351559638977051e-02</internalNodes>
+          <leafValues>
+            1.7634969204664230e-02 -1.4649459719657898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7337 1.9873639568686485e-02</internalNodes>
+          <leafValues>
+            -2.4449799209833145e-02 2.7322331070899963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7338 -2.3918889928609133e-03</internalNodes>
+          <leafValues>
+            -4.0744900703430176e-02 4.9925319850444794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7339 8.6433859542012215e-03</internalNodes>
+          <leafValues>
+            2.8967950493097305e-02 -2.3661069571971893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7340 -8.8321920484304428e-03</internalNodes>
+          <leafValues>
+            1.2054029852151871e-01 -2.7702990919351578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7341 -4.4150479137897491e-02</internalNodes>
+          <leafValues>
+            5.0038051605224609e-01 -1.2251130305230618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7342 -4.0243011899292469e-03</internalNodes>
+          <leafValues>
+            -1.9502529501914978e-01 2.5193009525537491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7343 9.8465122282505035e-03</internalNodes>
+          <leafValues>
+            -6.0283869504928589e-02 1.2665469944477081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7344 -2.7608149684965611e-03</internalNodes>
+          <leafValues>
+            -8.3926528692245483e-02 6.0102649033069611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7345 3.9076831191778183e-02</internalNodes>
+          <leafValues>
+            1.5327650122344494e-02 -4.3197798728942871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7346 3.8136269431561232e-03</internalNodes>
+          <leafValues>
+            -3.1281091272830963e-02 7.7942118048667908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7347 2.7646059170365334e-03</internalNodes>
+          <leafValues>
+            1.7334839329123497e-02 -3.4732720255851746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7348 -3.6096980329602957e-03</internalNodes>
+          <leafValues>
+            -8.2286708056926727e-02 2.8170879930257797e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7349 3.5445080138742924e-03</internalNodes>
+          <leafValues>
+            -1.0557620227336884e-01 6.0050919651985168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7350 1.2985900044441223e-02</internalNodes>
+          <leafValues>
+            1.8597990274429321e-02 -9.4987802207469940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7351 -2.0027540624141693e-02</internalNodes>
+          <leafValues>
+            2.6007258892059326e-01 -2.7079159393906593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7352 -7.2966597974300385e-02</internalNodes>
+          <leafValues>
+            -7.6848107576370239e-01 2.3947900626808405e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7353 -2.1148719824850559e-03</internalNodes>
+          <leafValues>
+            -1.0763320326805115e-01 5.2361391484737396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7354 -7.7667146921157837e-02</internalNodes>
+          <leafValues>
+            1.7822329699993134e-01 -3.1463298946619034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7355 -4.6600410714745522e-03</internalNodes>
+          <leafValues>
+            -2.0386479794979095e-01 3.9025411009788513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7356 1.7059499397873878e-02</internalNodes>
+          <leafValues>
+            1.8954740837216377e-02 -1.7260240018367767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7357 4.3174691498279572e-02</internalNodes>
+          <leafValues>
+            -3.1685609370470047e-02 2.3346449434757233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7358 -4.8927929997444153e-01</internalNodes>
+          <leafValues>
+            -7.1043139696121216e-01 4.6672620810568333e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7359 9.1495506465435028e-02</internalNodes>
+          <leafValues>
+            1.6027629375457764e-02 -4.0538018941879272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7360 -4.6843249350786209e-02</internalNodes>
+          <leafValues>
+            6.9358861446380615e-01 -2.0055349450558424e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7361 6.0863760299980640e-03</internalNodes>
+          <leafValues>
+            -1.5218159556388855e-01 4.0408309549093246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7362 4.3676611036062241e-02</internalNodes>
+          <leafValues>
+            1.2257159687578678e-02 -2.5996598601341248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7363 -4.9580529332160950e-02</internalNodes>
+          <leafValues>
+            6.7571347951889038e-01 -8.0354865640401840e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7364 -2.8614638722501695e-04</internalNodes>
+          <leafValues>
+            3.4548770636320114e-02 -6.1849180608987808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7365 -1.1863199993968010e-02</internalNodes>
+          <leafValues>
+            -1.2061329931020737e-01 5.1416579633951187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7366 1.4754010364413261e-02</internalNodes>
+          <leafValues>
+            -2.4638049304485321e-02 1.5234139561653137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7367 -5.1772277802228928e-03</internalNodes>
+          <leafValues>
+            1.8428930640220642e-01 -4.2200319468975067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7368 -2.0033530890941620e-02</internalNodes>
+          <leafValues>
+            -2.0986419916152954e-01 2.3016780614852905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7369 4.1349478997290134e-03</internalNodes>
+          <leafValues>
+            3.8500111550092697e-02 -1.5400919318199158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7370 4.9832498189061880e-04</internalNodes>
+          <leafValues>
+            -5.6834470480680466e-02 1.1737540364265442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7371 1.5235079918056726e-03</internalNodes>
+          <leafValues>
+            -8.2305751740932465e-02 7.3340758681297302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7372 2.6669060811400414e-02</internalNodes>
+          <leafValues>
+            1.7131920903921127e-02 -3.3337280154228210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7373 -2.5192899629473686e-02</internalNodes>
+          <leafValues>
+            1.8348090350627899e-01 -3.5275999456644058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7374 1.1769080301746726e-03</internalNodes>
+          <leafValues>
+            -1.3197030127048492e-01 2.4242419749498367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7375 -6.6034111659973860e-04</internalNodes>
+          <leafValues>
+            -1.0725550353527069e-01 5.8605268597602844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7376 4.3386619538068771e-02</internalNodes>
+          <leafValues>
+            -1.6498409211635590e-02 3.9293581247329712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7377 -1.1490290053188801e-02</internalNodes>
+          <leafValues>
+            -2.6332950592041016e-01 2.4240590631961823e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7378 8.5933692753314972e-02</internalNodes>
+          <leafValues>
+            -1.6279760748147964e-02 4.1729450225830078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7379 2.0756269805133343e-03</internalNodes>
+          <leafValues>
+            5.2543889731168747e-02 -1.0574310272932053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7380 1.4016899513080716e-03</internalNodes>
+          <leafValues>
+            -4.6594541519880295e-02 1.1355359852313995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7381 -3.4351870417594910e-03</internalNodes>
+          <leafValues>
+            -1.0806330293416977e-01 5.8778531849384308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7382 -1.8299809889867902e-03</internalNodes>
+          <leafValues>
+            6.0645598918199539e-02 -6.6084399819374084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7383 -3.4186599077656865e-04</internalNodes>
+          <leafValues>
+            -1.2682560086250305e-01 4.9244668334722519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7384 1.0616290383040905e-02</internalNodes>
+          <leafValues>
+            -5.5619470775127411e-02 1.2270829826593399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7385 3.9490770548582077e-02</internalNodes>
+          <leafValues>
+            8.2882875576615334e-03 -6.6194152832031250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7386 -1.9746040925383568e-02</internalNodes>
+          <leafValues>
+            1.5761069953441620e-01 -9.3961963430047035e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7387 4.6383799053728580e-04</internalNodes>
+          <leafValues>
+            -2.0127220451831818e-01 2.6706330478191376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7388 5.1521410932764411e-04</internalNodes>
+          <leafValues>
+            -8.6019717156887054e-02 6.7131496965885162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7389 -1.1283540166914463e-02</internalNodes>
+          <leafValues>
+            -2.2754089534282684e-01 2.2250600159168243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7390 -8.4253363311290741e-03</internalNodes>
+          <leafValues>
+            1.6505259275436401e-01 -5.0438180565834045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7391 3.0604569241404533e-02</internalNodes>
+          <leafValues>
+            2.7500540018081665e-02 -2.0984129607677460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7392 5.0000958144664764e-03</internalNodes>
+          <leafValues>
+            -3.8911771029233932e-02 1.1553470045328140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7393 4.1644461452960968e-02</internalNodes>
+          <leafValues>
+            -1.4164280146360397e-02 4.4004911184310913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7394 -3.9140251465141773e-03</internalNodes>
+          <leafValues>
+            -1.1528140306472778e-01 2.7629520744085312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7395 -2.2060431074351072e-03</internalNodes>
+          <leafValues>
+            7.4794493615627289e-02 -7.5950391590595245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7396 -7.4060507118701935e-02</internalNodes>
+          <leafValues>
+            -6.0902571678161621e-01 3.8528270088136196e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7397 1.5966329956427217e-03</internalNodes>
+          <leafValues>
+            -7.0015199482440948e-02 1.1019259691238403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7398 2.0102860871702433e-03</internalNodes>
+          <leafValues>
+            -3.1859181821346283e-02 7.1592740714550018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7399 3.2757699955254793e-03</internalNodes>
+          <leafValues>
+            -5.2260760217905045e-02 1.2652389705181122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7400 3.6700100172311068e-03</internalNodes>
+          <leafValues>
+            5.4018720984458923e-02 -4.6530380845069885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7401 -5.7776779867708683e-03</internalNodes>
+          <leafValues>
+            -2.2940860688686371e-01 2.4704450741410255e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7402 3.7388929631561041e-03</internalNodes>
+          <leafValues>
+            -4.8273131251335144e-02 7.6772913336753845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7403 -1.2404560111463070e-02</internalNodes>
+          <leafValues>
+            1.1491999775171280e-01 -4.9308139830827713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7404 9.0428609400987625e-03</internalNodes>
+          <leafValues>
+            4.3013140559196472e-02 -1.4439429342746735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7405 6.1762649565935135e-03</internalNodes>
+          <leafValues>
+            -3.9362821727991104e-02 1.6073490679264069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7406 2.1051440387964249e-02</internalNodes>
+          <leafValues>
+            2.4608060717582703e-02 -1.3768480718135834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7407 2.7457328978925943e-03</internalNodes>
+          <leafValues>
+            -6.3271999359130859e-02 9.1269433498382568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7408 -1.0777959600090981e-02</internalNodes>
+          <leafValues>
+            9.1245301067829132e-02 -3.0110929161310196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7409 1.6699189320206642e-02</internalNodes>
+          <leafValues>
+            4.3539609760046005e-02 -1.5240140259265900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7410 5.4665589705109596e-03</internalNodes>
+          <leafValues>
+            -5.3575031459331512e-02 6.0266200453042984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7411 -3.2001500949263573e-03</internalNodes>
+          <leafValues>
+            1.4220920205116272e-01 -4.0823381394147873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7412 4.7289058566093445e-02</internalNodes>
+          <leafValues>
+            1.5853699296712875e-02 -2.7123591303825378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7413 -1.3604690320789814e-03</internalNodes>
+          <leafValues>
+            4.0636081248521805e-02 -1.4885699748992920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7414 6.2847061781212687e-04</internalNodes>
+          <leafValues>
+            4.1833158582448959e-02 -1.2394890189170837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7415 -3.7036079913377762e-02</internalNodes>
+          <leafValues>
+            -3.6944690346717834e-01 1.3664159923791885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7416 -2.2578550502657890e-02</internalNodes>
+          <leafValues>
+            1.1812049895524979e-01 -2.2939860820770264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7417 3.2851321157068014e-03</internalNodes>
+          <leafValues>
+            3.1136950850486755e-01 -1.8856419250369072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7418 -2.0225369930267334e-01</internalNodes>
+          <leafValues>
+            -6.2465697526931763e-01 3.9239428006112576e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7419 -4.9903858453035355e-03</internalNodes>
+          <leafValues>
+            1.0674989968538284e-01 -6.0000490397214890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7420 -2.2539479658007622e-02</internalNodes>
+          <leafValues>
+            -1.9891190528869629e-01 1.8829969689249992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7421 2.6878459379076958e-02</internalNodes>
+          <leafValues>
+            -3.1185189262032509e-02 2.0841309428215027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7422 -6.3416860066354275e-03</internalNodes>
+          <leafValues>
+            -8.3658866584300995e-02 4.0603660047054291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7423 2.8207020368427038e-03</internalNodes>
+          <leafValues>
+            -5.8255858719348907e-02 9.7203142940998077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7424 2.4739980697631836e-02</internalNodes>
+          <leafValues>
+            -1.8699239939451218e-02 9.9858507513999939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7425 7.4140671640634537e-03</internalNodes>
+          <leafValues>
+            2.9613019898533821e-02 -1.9177620112895966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7426 -8.3040986210107803e-03</internalNodes>
+          <leafValues>
+            1.2958979606628418e-01 -4.2671140283346176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7427 1.1470559984445572e-03</internalNodes>
+          <leafValues>
+            -1.5365119278430939e-01 4.1083239018917084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7428 -1.6470700502395630e-01</internalNodes>
+          <leafValues>
+            -4.1437658667564392e-01 1.3509290292859077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7429 2.4328620731830597e-01</internalNodes>
+          <leafValues>
+            -1.2499390169978142e-02 4.4623729586601257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7430 2.4545079097151756e-02</internalNodes>
+          <leafValues>
+            2.2270770743489265e-02 -1.0766860097646713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7431 -3.6004021763801575e-02</internalNodes>
+          <leafValues>
+            2.1495530009269714e-01 -2.3298330605030060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7432 1.7012679949402809e-02</internalNodes>
+          <leafValues>
+            2.8566520661115646e-02 -1.3689860701560974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7433 -1.7947000451385975e-03</internalNodes>
+          <leafValues>
+            2.6063710451126099e-02 -1.8060439825057983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7434 -3.4492081403732300e-01</internalNodes>
+          <leafValues>
+            -5.9101992845535278e-01 1.3455889420583844e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7435 -1.0471549816429615e-02</internalNodes>
+          <leafValues>
+            -6.4394369721412659e-02 8.1244252622127533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7436 6.4335219562053680e-02</internalNodes>
+          <leafValues>
+            -5.0874471664428711e-02 8.3752527832984924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7437 4.6703450381755829e-02</internalNodes>
+          <leafValues>
+            8.1825926899909973e-03 -6.2220478057861328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7438 6.7396290600299835e-02</internalNodes>
+          <leafValues>
+            -4.0585128590464592e-03 3.1115430593490601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7439 -1.8122399342246354e-04</internalNodes>
+          <leafValues>
+            6.3599228858947754e-02 -8.3870701491832733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7440 -4.6783890575170517e-02</internalNodes>
+          <leafValues>
+            -4.3748119473457336e-01 3.6999220028519630e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7441 1.2537419795989990e-01</internalNodes>
+          <leafValues>
+            -7.1869022212922573e-03 6.9267672300338745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7442 3.5549318999983370e-04</internalNodes>
+          <leafValues>
+            3.5804919898509979e-02 -4.1999049484729767e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7443 -1.8169870600104332e-02</internalNodes>
+          <leafValues>
+            -2.6467940211296082e-01 1.9274869933724403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7444 2.7509370818734169e-02</internalNodes>
+          <leafValues>
+            -9.9343024194240570e-03 1.2481729686260223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7445 -3.1984839588403702e-02</internalNodes>
+          <leafValues>
+            2.5694110989570618e-01 -2.6392020285129547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7446 -1.2891650199890137e-02</internalNodes>
+          <leafValues>
+            -1.8838110566139221e-01 1.6135750338435173e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7447 4.5009091496467590e-02</internalNodes>
+          <leafValues>
+            8.4453048184514046e-03 -5.7920891046524048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7448 3.9589041844010353e-03</internalNodes>
+          <leafValues>
+            -4.3672330677509308e-02 1.2087629735469818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7449 2.7181839104741812e-03</internalNodes>
+          <leafValues>
+            -4.0779389441013336e-02 1.2974439561367035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7450 -7.5994711369276047e-04</internalNodes>
+          <leafValues>
+            3.2954100519418716e-02 -8.6419321596622467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7451 6.6315899603068829e-03</internalNodes>
+          <leafValues>
+            3.6079831421375275e-02 -1.5763629972934723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7452 -3.6433320492506027e-03</internalNodes>
+          <leafValues>
+            -2.9832119122147560e-02 6.2801547348499298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7453 -6.4768336713314056e-02</internalNodes>
+          <leafValues>
+            -8.4351742267608643e-01 6.0920589603483677e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7454 4.1712251305580139e-01</internalNodes>
+          <leafValues>
+            3.0659181065857410e-03 -4.4269698858261108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7455 1.8854279816150665e-01</internalNodes>
+          <leafValues>
+            4.8159952275454998e-03 -9.5497727394104004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7456 2.3751270025968552e-02</internalNodes>
+          <leafValues>
+            -1.2166289612650871e-02 3.0827128887176514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7457 1.8907970516011119e-03</internalNodes>
+          <leafValues>
+            -1.2497080117464066e-01 3.7261988967657089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7458 -1.5546990325674415e-03</internalNodes>
+          <leafValues>
+            7.3636576533317566e-02 -4.9398850649595261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7459 -9.2505775392055511e-03</internalNodes>
+          <leafValues>
+            1.2446039915084839e-01 -3.8673549890518188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7460 -9.9219558760523796e-03</internalNodes>
+          <leafValues>
+            -1.2231759727001190e-01 2.7252480387687683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7461 -6.7504931939765811e-04</internalNodes>
+          <leafValues>
+            8.0792732536792755e-02 -6.1003699898719788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7462 -1.3286190107464790e-02</internalNodes>
+          <leafValues>
+            1.7295649647712708e-01 -3.0486939474940300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7463 4.3905568309128284e-03</internalNodes>
+          <leafValues>
+            2.9421260580420494e-02 -1.8230539560317993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7464 -1.8879309296607971e-02</internalNodes>
+          <leafValues>
+            -5.3837429732084274e-02 2.8330469503998756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7465 -6.9391563534736633e-02</internalNodes>
+          <leafValues>
+            5.4713129997253418e-01 -9.0404544025659561e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7466 7.8226983547210693e-02</internalNodes>
+          <leafValues>
+            6.9561759009957314e-03 -1.5992170572280884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7467 -9.5910448580980301e-03</internalNodes>
+          <leafValues>
+            8.3477370440959930e-02 -6.0714289546012878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7468 8.0856353044509888e-02</internalNodes>
+          <leafValues>
+            -3.1028070952743292e-03 8.1530278921127319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7469 -6.9029820151627064e-03</internalNodes>
+          <leafValues>
+            -6.2625996768474579e-02 7.7994093298912048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7470 3.8219179958105087e-02</internalNodes>
+          <leafValues>
+            -9.4691133126616478e-03 4.1828629374504089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7471 -7.2923908010125160e-04</internalNodes>
+          <leafValues>
+            5.4394990205764771e-02 -1.0869490355253220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7472 -1.1224360205233097e-02</internalNodes>
+          <leafValues>
+            -2.8774300217628479e-01 1.9332440569996834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7473 -2.3755239322781563e-02</internalNodes>
+          <leafValues>
+            2.9632499814033508e-01 -1.6995029523968697e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7474 2.5170940905809402e-02</internalNodes>
+          <leafValues>
+            1.8151640892028809e-02 -6.9211177527904510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7475 8.4619410336017609e-02</internalNodes>
+          <leafValues>
+            -1.2618330307304859e-02 4.0188309550285339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7476 -2.8461799956858158e-03</internalNodes>
+          <leafValues>
+            -1.6565479338169098e-01 3.5540379583835602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7477 9.9000544287264347e-04</internalNodes>
+          <leafValues>
+            -7.0647209882736206e-02 9.2070832848548889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7478 8.5722869262099266e-03</internalNodes>
+          <leafValues>
+            -1.6599319875240326e-02 6.0025580227375031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7479 7.7498499304056168e-03</internalNodes>
+          <leafValues>
+            2.5065049529075623e-02 -2.0419560372829437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7480 -5.1633790135383606e-03</internalNodes>
+          <leafValues>
+            5.6465640664100647e-02 -3.9366569370031357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7481 3.4570649731904268e-03</internalNodes>
+          <leafValues>
+            -4.8712749034166336e-02 1.1756400018930435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7482 1.5435590175911784e-03</internalNodes>
+          <leafValues>
+            -1.2385150045156479e-01 4.7240950167179108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7483 3.9221469312906265e-02</internalNodes>
+          <leafValues>
+            9.7949290648102760e-03 -5.5965268611907959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7484 -4.8019930720329285e-02</internalNodes>
+          <leafValues>
+            -2.4514609575271606e-01 1.5544380061328411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7485 1.7867749556899071e-02</internalNodes>
+          <leafValues>
+            -2.6458689942955971e-02 1.8536129593849182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7486 -7.8233405947685242e-03</internalNodes>
+          <leafValues>
+            -1.2305969744920731e-01 2.1850170567631721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7487 -4.8894518986344337e-03</internalNodes>
+          <leafValues>
+            2.5086471438407898e-01 -1.9914150238037109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7488 1.1090599745512009e-01</internalNodes>
+          <leafValues>
+            2.1982348989695311e-03 -9.6110188961029053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7489 5.3139701485633850e-03</internalNodes>
+          <leafValues>
+            -7.0207841694355011e-02 7.4792057275772095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7490 -4.0226429700851440e-03</internalNodes>
+          <leafValues>
+            -9.2982061207294464e-02 2.7642169967293739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7491 -9.9820762872695923e-02</internalNodes>
+          <leafValues>
+            -8.2527607679367065e-01 5.8367499150335789e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7492 3.2612269278615713e-03</internalNodes>
+          <leafValues>
+            3.0481850728392601e-02 -4.8289291560649872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7493 -4.1559059172868729e-02</internalNodes>
+          <leafValues>
+            5.8879297971725464e-01 -8.5169300436973572e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7494 5.4297139868140221e-03</internalNodes>
+          <leafValues>
+            1.8141800537705421e-02 -1.3948309421539307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7495 1.6756299883127213e-02</internalNodes>
+          <leafValues>
+            1.2322929687798023e-02 -4.1245520114898682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7496 -1.7563860863447189e-02</internalNodes>
+          <leafValues>
+            1.1385770142078400e-01 -3.0968630686402321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7497 1.8308760598301888e-02</internalNodes>
+          <leafValues>
+            -3.5930249840021133e-02 1.4697270095348358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7498 3.5556308925151825e-02</internalNodes>
+          <leafValues>
+            1.0190679691731930e-02 -2.5837650895118713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7499 -5.1635081035783514e-05</internalNodes>
+          <leafValues>
+            4.6089090406894684e-02 -1.1719120293855667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7500 2.5128800189122558e-04</internalNodes>
+          <leafValues>
+            -4.0896330028772354e-02 1.0669410228729248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7501 -1.5876770485192537e-03</internalNodes>
+          <leafValues>
+            1.0786730051040649e-01 -4.5890059322118759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7502 -9.5712337642908096e-03</internalNodes>
+          <leafValues>
+            -1.5212120115756989e-01 3.7137780338525772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7503 2.8643130790442228e-03</internalNodes>
+          <leafValues>
+            3.6075118929147720e-02 -1.4268599450588226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7504 -5.0454098731279373e-02</internalNodes>
+          <leafValues>
+            1.9622960686683655e-01 -2.8599070385098457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7505 -2.8714470099657774e-03</internalNodes>
+          <leafValues>
+            7.3919989168643951e-02 -8.6024001240730286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7506 4.9587138928472996e-03</internalNodes>
+          <leafValues>
+            9.4060972332954407e-03 -2.4880349636077881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7507 -7.8270390629768372e-02</internalNodes>
+          <leafValues>
+            4.3305158615112305e-01 -1.1123429983854294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7508 -6.4656808972358704e-02</internalNodes>
+          <leafValues>
+            -1.9539129734039307e-01 9.3969572335481644e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7509 -4.0213608741760254e-01</internalNodes>
+          <leafValues>
+            -9.3731278181076050e-01 4.8170168884098530e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7510 4.2917151004076004e-02</internalNodes>
+          <leafValues>
+            5.9442862402647734e-04 -7.9430317878723145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7511 2.1517940331250429e-03</internalNodes>
+          <leafValues>
+            -2.4127319455146790e-02 2.1096949279308319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7512 9.5514237880706787e-02</internalNodes>
+          <leafValues>
+            3.0073130037635565e-03 -3.0030760169029236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7513 3.5949420183897018e-02</internalNodes>
+          <leafValues>
+            9.1736158356070518e-03 -5.3301852941513062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7514 1.4061479270458221e-01</internalNodes>
+          <leafValues>
+            -1.9780038855969906e-03 5.8360362052917480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7515 -1.0000269860029221e-01</internalNodes>
+          <leafValues>
+            -4.6577060222625732e-01 1.0447300039231777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7516 -1.6898410022258759e-01</internalNodes>
+          <leafValues>
+            4.7578391432762146e-01 -3.0947721097618341e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7517 2.6123190298676491e-02</internalNodes>
+          <leafValues>
+            -1.8673470243811607e-02 2.5583058595657349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7518 8.8816967036109418e-05</internalNodes>
+          <leafValues>
+            1.2931160628795624e-01 -2.2033900022506714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7519 -2.5785199832171202e-03</internalNodes>
+          <leafValues>
+            7.7590242028236389e-02 -5.8669801801443100e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7520 -5.5829741060733795e-02</internalNodes>
+          <leafValues>
+            -5.6296068429946899e-01 8.2240002229809761e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7521 -3.5114258527755737e-02</internalNodes>
+          <leafValues>
+            -4.1525208950042725e-01 1.0237259790301323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7522 3.0091139487922192e-03</internalNodes>
+          <leafValues>
+            -3.2801661640405655e-02 1.1237899959087372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7523 -3.0068641062825918e-03</internalNodes>
+          <leafValues>
+            -1.5794169902801514e-01 3.0354220420122147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7524 -2.0059049129486084e-03</internalNodes>
+          <leafValues>
+            1.1346399784088135e-01 -3.3372201025485992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7525 -1.3963360106572509e-03</internalNodes>
+          <leafValues>
+            1.4454230666160583e-01 -5.0115231424570084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7526 -5.4588310420513153e-02</internalNodes>
+          <leafValues>
+            -9.6552258729934692e-01 2.6290758978575468e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7527 -5.0577907823026180e-03</internalNodes>
+          <leafValues>
+            -2.1536730229854584e-01 2.7823869138956070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7528 -7.4430949985980988e-02</internalNodes>
+          <leafValues>
+            5.9244579076766968e-01 -3.5832428839057684e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7529 -6.9759570062160492e-02</internalNodes>
+          <leafValues>
+            6.5854609012603760e-01 -7.1275448426604271e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7530 3.4715738729573786e-04</internalNodes>
+          <leafValues>
+            4.3214511126279831e-02 -6.5209239721298218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7531 6.5575069747865200e-03</internalNodes>
+          <leafValues>
+            4.1032981127500534e-02 -1.2200939655303955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7532 9.2287212610244751e-02</internalNodes>
+          <leafValues>
+            -2.1933389827609062e-02 8.9953176677227020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7533 5.2685599774122238e-02</internalNodes>
+          <leafValues>
+            1.6439350321888924e-02 -2.7847930788993835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7534 7.2394758462905884e-03</internalNodes>
+          <leafValues>
+            -3.3217910677194595e-02 9.7244061529636383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7535 -2.2218099329620600e-03</internalNodes>
+          <leafValues>
+            3.5860918462276459e-02 -1.3876199722290039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7536 -2.3309379816055298e-02</internalNodes>
+          <leafValues>
+            -2.7913948893547058e-01 1.6362229362130165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7537 1.4036920038051903e-04</internalNodes>
+          <leafValues>
+            -4.0096871554851532e-02 1.2379959970712662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7538 5.3702849894762039e-02</internalNodes>
+          <leafValues>
+            1.4607049524784088e-03 -8.6436408758163452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7539 4.1926259291358292e-04</internalNodes>
+          <leafValues>
+            -4.9342829734086990e-02 1.0289549827575684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7540 -1.6786300111562014e-03</internalNodes>
+          <leafValues>
+            -1.9065080583095551e-01 2.5145059451460838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7541 1.6603240743279457e-02</internalNodes>
+          <leafValues>
+            -1.8125709146261215e-02 2.6887449622154236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7542 -2.2621789947152138e-02</internalNodes>
+          <leafValues>
+            1.3145700097084045e-01 -2.5288559496402740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7543 4.4634779915213585e-03</internalNodes>
+          <leafValues>
+            5.6568209081888199e-02 -1.0306429862976074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7544 3.3281201031059027e-03</internalNodes>
+          <leafValues>
+            2.1517809480428696e-02 -1.4086639881134033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7545 -2.5311840698122978e-02</internalNodes>
+          <leafValues>
+            1.1237470060586929e-01 -4.1784498840570450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7546 -2.6119880378246307e-02</internalNodes>
+          <leafValues>
+            1.2703700363636017e-01 -2.3530310019850731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7547 -7.2608642280101776e-02</internalNodes>
+          <leafValues>
+            -3.3052888512611389e-01 2.1741159260272980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7548 5.8377808891236782e-03</internalNodes>
+          <leafValues>
+            -2.8170680627226830e-02 6.1300031840801239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7549 1.7830949509516358e-03</internalNodes>
+          <leafValues>
+            -7.6140716671943665e-02 8.4391303360462189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7550 -1.4502589404582977e-01</internalNodes>
+          <leafValues>
+            -2.8886368870735168e-01 9.4371382147073746e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7551 -2.4291570298373699e-03</internalNodes>
+          <leafValues>
+            -6.3645169138908386e-02 9.0057007968425751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7552 1.0977900028228760e-01</internalNodes>
+          <leafValues>
+            -1.4906959841027856e-03 8.9710217714309692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7553 -3.8412429857999086e-03</internalNodes>
+          <leafValues>
+            7.3980011045932770e-02 -6.9378383457660675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7554 3.9507250767201185e-04</internalNodes>
+          <leafValues>
+            -7.1166411042213440e-02 6.3150741159915924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7555 -6.6879019141197205e-03</internalNodes>
+          <leafValues>
+            -1.4211960136890411e-01 5.1007200032472610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7556 -2.1278159320354462e-01</internalNodes>
+          <leafValues>
+            1.7479549348354340e-01 -1.6866499558091164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7557 4.3913610279560089e-02</internalNodes>
+          <leafValues>
+            -7.9228030517697334e-03 5.9994518756866455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7558 3.0486818868666887e-03</internalNodes>
+          <leafValues>
+            2.7880100533366203e-02 -1.4996689558029175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7559 1.7128599574789405e-03</internalNodes>
+          <leafValues>
+            -6.1575889587402344e-02 1.0793119668960571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7560 -1.3061589561402798e-02</internalNodes>
+          <leafValues>
+            -3.5864189267158508e-01 1.2332689948379993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7561 1.4779239427298307e-03</internalNodes>
+          <leafValues>
+            -5.5280618369579315e-02 7.6400339603424072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7562 -7.4117183685302734e-02</internalNodes>
+          <leafValues>
+            3.3055660128593445e-01 -5.4406579583883286e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7563 4.1532788425683975e-02</internalNodes>
+          <leafValues>
+            1.2762749567627907e-02 -3.4091010689735413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7564 -1.6474310308694839e-02</internalNodes>
+          <leafValues>
+            -1.1935900151729584e-01 3.5997871309518814e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7565 -1.3384450227022171e-02</internalNodes>
+          <leafValues>
+            1.4927010238170624e-01 -3.7151250988245010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7566 -4.3293130584061146e-03</internalNodes>
+          <leafValues>
+            -1.5257209539413452e-01 2.0008029416203499e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7567 3.7254339549690485e-03</internalNodes>
+          <leafValues>
+            3.8249280303716660e-02 -1.3562840223312378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7568 -3.5788780078291893e-03</internalNodes>
+          <leafValues>
+            1.1951140314340591e-01 -5.1356971263885498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7569 9.0936541557312012e-02</internalNodes>
+          <leafValues>
+            -9.6294376999139786e-03 5.0582927465438843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7570 -3.1301870476454496e-03</internalNodes>
+          <leafValues>
+            2.4587530642747879e-02 -1.5752519667148590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7571 -3.0295769684016705e-03</internalNodes>
+          <leafValues>
+            -9.6669957041740417e-02 4.7402460128068924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7572 -3.1865050550550222e-03</internalNodes>
+          <leafValues>
+            3.5035319626331329e-02 -4.0841709822416306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7573 4.4836260378360748e-02</internalNodes>
+          <leafValues>
+            -7.4580628424882889e-03 6.5190207958221436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7574 -6.4811948686838150e-03</internalNodes>
+          <leafValues>
+            1.3163930177688599e-01 -3.6060128360986710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7575 -2.0486880093812943e-03</internalNodes>
+          <leafValues>
+            -1.1097510159015656e-01 5.1011908799409866e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7576 4.9175620079040527e-02</internalNodes>
+          <leafValues>
+            5.1457029767334461e-03 -8.9148598909378052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7577 8.4772880654782057e-04</internalNodes>
+          <leafValues>
+            -9.0741790831089020e-02 4.4853020459413528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7578 -1.6545709222555161e-02</internalNodes>
+          <leafValues>
+            2.5329568982124329e-01 -1.6997080296278000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7579 6.9274050183594227e-03</internalNodes>
+          <leafValues>
+            3.8941461592912674e-02 -1.3961300253868103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7580 -6.5109939314424992e-03</internalNodes>
+          <leafValues>
+            1.5610300004482269e-01 -2.4493880569934845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7581 -4.9708629958331585e-03</internalNodes>
+          <leafValues>
+            -9.8298586905002594e-02 5.7903841137886047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7582 1.3074609637260437e-01</internalNodes>
+          <leafValues>
+            -2.7071859221905470e-04 1.0000669956207275e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7583 -2.6705920696258545e-02</internalNodes>
+          <leafValues>
+            -4.2577031254768372e-01 1.0705970227718353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7584 -1.0329060256481171e-01</internalNodes>
+          <leafValues>
+            2.5896188616752625e-01 -1.8414590507745743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7585 -2.0166130736470222e-02</internalNodes>
+          <leafValues>
+            -1.1455850303173065e-01 4.0439568459987640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7586 -4.2215920984745026e-03</internalNodes>
+          <leafValues>
+            4.3039258569478989e-02 -4.8735860735177994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7587 -1.0038839653134346e-02</internalNodes>
+          <leafValues>
+            7.1608737111091614e-02 -6.6204607486724854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7588 1.5833059325814247e-02</internalNodes>
+          <leafValues>
+            -3.2066859304904938e-02 8.9950896799564362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7589 3.4065160434693098e-03</internalNodes>
+          <leafValues>
+            4.7216009348630905e-02 -1.0898789763450623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7590 -9.8251160234212875e-03</internalNodes>
+          <leafValues>
+            1.0213229805231094e-01 -5.2902109920978546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7591 1.6804629936814308e-02</internalNodes>
+          <leafValues>
+            -3.7189990282058716e-02 1.3787649571895599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7592 8.5175316780805588e-03</internalNodes>
+          <leafValues>
+            2.7141440659761429e-02 -1.3569560647010803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7593 -6.3797592883929610e-04</internalNodes>
+          <leafValues>
+            6.9217190146446228e-02 -9.0696737170219421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7594 -9.6052087610587478e-04</internalNodes>
+          <leafValues>
+            2.2472479939460754e-01 -2.4032639339566231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7595 7.2245922638103366e-04</internalNodes>
+          <leafValues>
+            -4.6731200069189072e-02 9.6905507147312164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7596 1.0769399814307690e-03</internalNodes>
+          <leafValues>
+            3.8259491324424744e-02 -6.6674157977104187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7597 4.1620191186666489e-02</internalNodes>
+          <leafValues>
+            9.3473913148045540e-03 -4.9046689271926880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7598 -8.1712089013308287e-04</internalNodes>
+          <leafValues>
+            5.2797440439462662e-02 -9.6458092331886292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7599 6.2240879051387310e-03</internalNodes>
+          <leafValues>
+            -3.5350788384675980e-02 1.6484160721302032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7600 2.0862540695816278e-03</internalNodes>
+          <leafValues>
+            3.3958710730075836e-02 -1.3114009797573090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7601 4.2804637923836708e-03</internalNodes>
+          <leafValues>
+            3.0104041099548340e-01 -1.6245450824499130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7602 -3.3040030393749475e-04</internalNodes>
+          <leafValues>
+            -1.1665459722280502e-01 3.8146208971738815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7603 2.8100309427827597e-03</internalNodes>
+          <leafValues>
+            4.1940510272979736e-02 -1.1180300265550613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7604 1.9832739606499672e-02</internalNodes>
+          <leafValues>
+            -1.1701569892466068e-02 2.0122130215167999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7605 7.0879682898521423e-02</internalNodes>
+          <leafValues>
+            -1.8197819590568542e-02 2.5429588556289673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7606 -8.3893969655036926e-02</internalNodes>
+          <leafValues>
+            -3.8719230890274048e-01 1.1727290228009224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7607 2.8477620333433151e-02</internalNodes>
+          <leafValues>
+            1.3701519928872585e-02 -3.2496619224548340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7608 1.2077310122549534e-02</internalNodes>
+          <leafValues>
+            -2.3975890129804611e-02 2.5232788920402527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7609 -7.5613409280776978e-02</internalNodes>
+          <leafValues>
+            -6.0866451263427734e-01 8.2847801968455315e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7610 -1.7563860863447189e-02</internalNodes>
+          <leafValues>
+            1.0811589658260345e-01 -2.8622759506106377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7611 1.1809109710156918e-02</internalNodes>
+          <leafValues>
+            3.4758269786834717e-02 -1.4444710314273834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7612 3.3459219336509705e-01</internalNodes>
+          <leafValues>
+            3.5104870330542326e-03 -9.1507577896118164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7613 9.8447836935520172e-02</internalNodes>
+          <leafValues>
+            -1.0290330275893211e-02 4.7943019866943359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7614 -4.0277838706970215e-02</internalNodes>
+          <leafValues>
+            -7.3793828487396240e-01 4.8832078464329243e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7615 4.6712718904018402e-03</internalNodes>
+          <leafValues>
+            2.5037309154868126e-02 -1.7003759741783142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7616 1.3958489894866943e-01</internalNodes>
+          <leafValues>
+            1.9962170626968145e-03 -7.1547168493270874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7617 6.9742716848850250e-02</internalNodes>
+          <leafValues>
+            -8.4846932440996170e-03 5.5378282070159912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7618 4.0283710695803165e-03</internalNodes>
+          <leafValues>
+            -1.6718029975891113e-02 2.3914240300655365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7619 1.0911709628999233e-02</internalNodes>
+          <leafValues>
+            1.5781659632921219e-02 -2.6813709735870361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7620 -6.7120362073183060e-03</internalNodes>
+          <leafValues>
+            1.1087659746408463e-01 -3.1365878880023956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7621 -1.3467820361256599e-02</internalNodes>
+          <leafValues>
+            -2.0741519331932068e-01 2.3459080606698990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7622 -2.1431609056890011e-03</internalNodes>
+          <leafValues>
+            7.8274592757225037e-02 -2.7959430590271950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7623 1.5163370408117771e-02</internalNodes>
+          <leafValues>
+            2.1727830171585083e-02 -1.8995440006256104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7624 -1.8551949411630630e-02</internalNodes>
+          <leafValues>
+            1.1164160072803497e-01 -3.0374029651284218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7625 -1.1083459854125977e-01</internalNodes>
+          <leafValues>
+            -5.6379908323287964e-01 7.6859779655933380e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7626 5.6210728362202644e-03</internalNodes>
+          <leafValues>
+            3.2930258661508560e-02 -1.0337010025978088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7627 3.0593289993703365e-03</internalNodes>
+          <leafValues>
+            -6.8871803581714630e-02 6.0389719903469086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7628 -6.9845258258283138e-04</internalNodes>
+          <leafValues>
+            3.8080908358097076e-02 -7.0112928748130798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7629 -1.3236569939181209e-03</internalNodes>
+          <leafValues>
+            7.5004093348979950e-02 -6.3950046896934509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7630 -1.6736539546400309e-03</internalNodes>
+          <leafValues>
+            -1.0580399632453918e-01 4.9476388841867447e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7631 7.0728380233049393e-03</internalNodes>
+          <leafValues>
+            -3.6582119762897491e-02 1.3126540184020996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7632 1.8164990469813347e-03</internalNodes>
+          <leafValues>
+            3.9953831583261490e-02 -5.1589578390121460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7633 4.1909920983016491e-03</internalNodes>
+          <leafValues>
+            4.8665199428796768e-02 -1.0598509758710861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7634 1.1940020322799683e-01</internalNodes>
+          <leafValues>
+            -6.7811049520969391e-03 7.4523490667343140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7635 -1.4965030131861567e-03</internalNodes>
+          <leafValues>
+            6.6805936396121979e-02 -6.7798472940921783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7636 -1.1722999811172485e-01</internalNodes>
+          <leafValues>
+            -8.7860488891601562e-01 1.8648250261321664e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7637 3.2925528939813375e-03</internalNodes>
+          <leafValues>
+            3.5634901374578476e-02 -1.5030789375305176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7638 6.8493567407131195e-02</internalNodes>
+          <leafValues>
+            -9.8042488098144531e-03 3.0161941051483154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7639 2.1837449166923761e-03</internalNodes>
+          <leafValues>
+            -5.3420849144458771e-02 8.5626326501369476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7640 6.9181360304355621e-03</internalNodes>
+          <leafValues>
+            -4.3685518205165863e-02 1.2706759572029114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7641 -1.5878600534051657e-03</internalNodes>
+          <leafValues>
+            -1.2640440464019775e-01 3.9026089012622833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7642 3.8289129734039307e-03</internalNodes>
+          <leafValues>
+            3.9025381207466125e-02 -7.9675689339637756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7643 1.2253260239958763e-02</internalNodes>
+          <leafValues>
+            -4.4809628278017044e-02 9.7772710025310516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7644 6.4031239598989487e-03</internalNodes>
+          <leafValues>
+            3.3579610288143158e-02 -1.3300299644470215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7645 7.0500532165169716e-03</internalNodes>
+          <leafValues>
+            -5.1121409982442856e-02 1.1772400140762329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7646 1.3216730207204819e-02</internalNodes>
+          <leafValues>
+            2.6454009115695953e-02 -1.3190220296382904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7647 6.7367991432547569e-03</internalNodes>
+          <leafValues>
+            -1.0153199546039104e-02 4.1570469737052917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7648 2.4951510131359100e-03</internalNodes>
+          <leafValues>
+            1.4631019905209541e-02 -1.6560359299182892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7649 3.8302998989820480e-02</internalNodes>
+          <leafValues>
+            7.2940620593726635e-03 -6.0744607448577881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7650 -1.6491059213876724e-02</internalNodes>
+          <leafValues>
+            1.6788350045681000e-01 -1.5062170103192329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7651 -2.7071639895439148e-02</internalNodes>
+          <leafValues>
+            -4.6381551027297974e-01 1.0335059836506844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7652 -5.8714959770441055e-02</internalNodes>
+          <leafValues>
+            1.4860999584197998e-01 -1.6663730144500732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7653 9.2380512505769730e-03</internalNodes>
+          <leafValues>
+            4.3830338865518570e-02 -1.0612689703702927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7654 3.0808299779891968e-03</internalNodes>
+          <leafValues>
+            -3.6781489849090576e-02 8.9559197425842285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7655 2.9910521116107702e-03</internalNodes>
+          <leafValues>
+            1.6019189730286598e-02 -2.9177838563919067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7656 4.4786609709262848e-02</internalNodes>
+          <leafValues>
+            -6.7814979702234268e-03 3.6695161461830139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7657 -2.9985690489411354e-03</internalNodes>
+          <leafValues>
+            -9.0316072106361389e-02 4.8048041760921478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7658 -8.9135952293872833e-03</internalNodes>
+          <leafValues>
+            1.6903600096702576e-01 -2.1880460903048515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7659 -3.9598200470209122e-02</internalNodes>
+          <leafValues>
+            -4.4884848594665527e-01 1.0027219541370869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7660 -3.7064809352159500e-02</internalNodes>
+          <leafValues>
+            -4.4183561205863953e-01 2.2891450207680464e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7661 -9.3376229051500559e-04</internalNodes>
+          <leafValues>
+            7.3633059859275818e-02 -5.8901689946651459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7662 8.0887757241725922e-02</internalNodes>
+          <leafValues>
+            -2.4963580071926117e-02 6.0303758829832077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7663 -3.0697569251060486e-02</internalNodes>
+          <leafValues>
+            -1.7819009721279144e-01 2.6090290397405624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7664 -1.8495260179042816e-01</internalNodes>
+          <leafValues>
+            3.4901228547096252e-01 -3.8219890557229519e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7665 1.1218319647014141e-02</internalNodes>
+          <leafValues>
+            -2.6781549677252769e-02 1.7431420087814331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7666 6.2761609442532063e-03</internalNodes>
+          <leafValues>
+            1.4532440342009068e-02 -1.1864569783210754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7667 -8.8509358465671539e-03</internalNodes>
+          <leafValues>
+            -1.0515689849853516e-01 5.7655680924654007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7668 -3.8575798273086548e-02</internalNodes>
+          <leafValues>
+            1.5004560351371765e-01 -3.6080200225114822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7669 -5.2720211446285248e-02</internalNodes>
+          <leafValues>
+            -4.7556790709495544e-01 1.1126070283353329e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>392</maxWeakCount>
+      <stageThreshold>-1.1210759878158569e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 7670 -3.8506588898599148e-03</internalNodes>
+          <leafValues>
+            1.1209569871425629e-01 -2.7330291271209717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7671 -4.9427259713411331e-02</internalNodes>
+          <leafValues>
+            3.9270120859146118e-01 -3.9871849119663239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7672 1.3538210187107325e-03</internalNodes>
+          <leafValues>
+            -1.5965040028095245e-01 1.2521059811115265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7673 3.9328690618276596e-03</internalNodes>
+          <leafValues>
+            -3.4043839573860168e-01 4.7437489032745361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7674 2.3011169396340847e-03</internalNodes>
+          <leafValues>
+            -2.0827749371528625e-01 7.4891701340675354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7675 5.9128052089363337e-04</internalNodes>
+          <leafValues>
+            -2.0842720568180084e-01 3.7798780947923660e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7676 1.7478190129622817e-03</internalNodes>
+          <leafValues>
+            -1.9635179638862610e-01 6.4582027494907379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7677 5.8316658250987530e-03</internalNodes>
+          <leafValues>
+            3.1582038849592209e-02 -1.9084580242633820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7678 1.2435190146788955e-03</internalNodes>
+          <leafValues>
+            -5.3213578462600708e-01 2.2162230685353279e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7679 1.6247769817709923e-03</internalNodes>
+          <leafValues>
+            -1.3276180624961853e-01 8.0135673284530640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7680 -2.2734089288860559e-03</internalNodes>
+          <leafValues>
+            -1.7344699800014496e-01 5.4782990366220474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7681 5.7859059423208237e-02</internalNodes>
+          <leafValues>
+            -1.5829589683562517e-03 -6.6367942094802856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7682 5.7728560641407967e-03</internalNodes>
+          <leafValues>
+            3.9815168827772141e-02 -2.2919249534606934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7683 -4.4039610773324966e-02</internalNodes>
+          <leafValues>
+            2.1793280541896820e-01 -2.3534009233117104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7684 3.0226248782128096e-04</internalNodes>
+          <leafValues>
+            -8.9419580996036530e-02 1.1042869836091995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7685 -3.4470859915018082e-02</internalNodes>
+          <leafValues>
+            -3.6666679382324219e-01 2.7858279645442963e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7686 3.2460398972034454e-02</internalNodes>
+          <leafValues>
+            1.5733880922198296e-02 -4.9733749032020569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7687 9.9335552658885717e-04</internalNodes>
+          <leafValues>
+            -9.1800943017005920e-02 8.4003977477550507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7688 -2.3473830893635750e-02</internalNodes>
+          <leafValues>
+            -4.4375669956207275e-01 1.5148010104894638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7689 -2.9013049788773060e-03</internalNodes>
+          <leafValues>
+            5.4642349481582642e-02 -2.0156529545783997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7690 -6.5832951804623008e-04</internalNodes>
+          <leafValues>
+            -1.2285769730806351e-01 5.6707888841629028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7691 2.0407158881425858e-03</internalNodes>
+          <leafValues>
+            -1.0899069905281067e-01 5.9933699667453766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7692 -1.3161499984562397e-02</internalNodes>
+          <leafValues>
+            1.4091959595680237e-01 -4.7396201640367508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7693 -4.2273551225662231e-03</internalNodes>
+          <leafValues>
+            -1.2498269975185394e-01 5.1124658435583115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7694 7.6580629684031010e-03</internalNodes>
+          <leafValues>
+            3.8773480802774429e-02 -1.8095690011978149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7695 -5.1912548951804638e-03</internalNodes>
+          <leafValues>
+            1.2545259296894073e-01 -4.4012580066919327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7696 1.1874590069055557e-01</internalNodes>
+          <leafValues>
+            -1.4801479876041412e-02 4.0071210265159607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7697 4.5105828903615475e-03</internalNodes>
+          <leafValues>
+            5.3336851298809052e-02 -1.5709049999713898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7698 4.5015379786491394e-02</internalNodes>
+          <leafValues>
+            -3.3278778195381165e-02 2.0535139739513397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7699 -2.0866969134658575e-03</internalNodes>
+          <leafValues>
+            4.2103528976440430e-02 -1.0361789911985397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7700 -1.3008449459448457e-03</internalNodes>
+          <leafValues>
+            6.4424470067024231e-02 -9.7897060215473175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7701 -1.3591230381280184e-03</internalNodes>
+          <leafValues>
+            7.2987347841262817e-02 -9.4451002776622772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7702 -7.4056759476661682e-03</internalNodes>
+          <leafValues>
+            -1.5320360660552979e-01 5.3242001682519913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7703 2.0208859350532293e-03</internalNodes>
+          <leafValues>
+            -3.3245529979467392e-02 6.0319710522890091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7704 -1.0342149995267391e-02</internalNodes>
+          <leafValues>
+            8.5510559380054474e-02 -8.3920828998088837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7705 2.4865860119462013e-02</internalNodes>
+          <leafValues>
+            1.2639460153877735e-02 -3.4757199883460999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7706 9.9798657000064850e-02</internalNodes>
+          <leafValues>
+            -1.8823970109224319e-02 3.4465000033378601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7707 2.1201390773057938e-02</internalNodes>
+          <leafValues>
+            -1.0467799752950668e-01 3.1494509428739548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7708 -5.1909908652305603e-03</internalNodes>
+          <leafValues>
+            -1.5792340040206909e-01 5.0269961357116699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7709 6.6961228847503662e-02</internalNodes>
+          <leafValues>
+            3.2651789952069521e-03 -5.6049168109893799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7710 1.1809109710156918e-02</internalNodes>
+          <leafValues>
+            -2.8513789176940918e-02 2.1226319670677185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7711 -1.7645660787820816e-02</internalNodes>
+          <leafValues>
+            -4.4503360986709595e-01 5.0029670819640160e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7712 -6.8918941542506218e-03</internalNodes>
+          <leafValues>
+            -4.2199620604515076e-01 1.4813040383160114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7713 2.1675550378859043e-03</internalNodes>
+          <leafValues>
+            -1.3125190138816833e-01 6.7140422761440277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7714 -3.3283489756286144e-03</internalNodes>
+          <leafValues>
+            -1.0765329748392105e-01 5.3610768169164658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7715 4.8869621008634567e-02</internalNodes>
+          <leafValues>
+            6.4427889883518219e-03 -6.4563280344009399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7716 7.2693959809839725e-03</internalNodes>
+          <leafValues>
+            -3.9603620767593384e-02 1.5369640290737152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7717 8.8849991559982300e-02</internalNodes>
+          <leafValues>
+            -1.3234400190412998e-02 2.8555288910865784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7718 1.5455950051546097e-02</internalNodes>
+          <leafValues>
+            3.9694100618362427e-02 -1.7206269502639771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7719 -1.3747200369834900e-02</internalNodes>
+          <leafValues>
+            1.0079269856214523e-01 -4.3812029063701630e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7720 -2.2805750370025635e-02</internalNodes>
+          <leafValues>
+            1.5014170110225677e-01 -4.3767798691987991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7721 2.3838039487600327e-02</internalNodes>
+          <leafValues>
+            5.3901281207799911e-02 -1.4610290527343750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7722 -1.0181629657745361e-01</internalNodes>
+          <leafValues>
+            3.1905040144920349e-01 -2.0011590793728828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7723 7.1074268780648708e-03</internalNodes>
+          <leafValues>
+            5.6244179606437683e-02 -1.2587560713291168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7724 7.6678092591464520e-04</internalNodes>
+          <leafValues>
+            -1.0704190284013748e-01 6.6436298191547394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7725 3.7424071342684329e-04</internalNodes>
+          <leafValues>
+            -3.7826299667358398e-02 4.7234989702701569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7726 -2.0078169181942940e-03</internalNodes>
+          <leafValues>
+            -9.3316286802291870e-02 6.7641608417034149e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7727 3.3469051122665405e-02</internalNodes>
+          <leafValues>
+            -2.7926150709390640e-02 2.5293371081352234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7728 -1.5507030300796032e-02</internalNodes>
+          <leafValues>
+            -5.5145150423049927e-01 1.2821160256862640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7729 -1.9248709082603455e-02</internalNodes>
+          <leafValues>
+            5.2688628435134888e-02 -3.0364990234375000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7730 -1.7556030303239822e-02</internalNodes>
+          <leafValues>
+            -3.3247348666191101e-01 1.8780380487442017e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7731 1.9324380904436111e-02</internalNodes>
+          <leafValues>
+            -3.2458461821079254e-02 9.4986997544765472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7732 -2.0367160439491272e-02</internalNodes>
+          <leafValues>
+            1.1348400264978409e-01 -5.8434821665287018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7733 5.1770661957561970e-03</internalNodes>
+          <leafValues>
+            4.7030560672283173e-02 -8.4960326552391052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7734 1.9768481142818928e-03</internalNodes>
+          <leafValues>
+            -7.0794142782688141e-02 1.0375150293111801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7735 -7.0216279709711671e-04</internalNodes>
+          <leafValues>
+            3.0781729146838188e-02 -1.0170820355415344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7736 -2.4710369762033224e-03</internalNodes>
+          <leafValues>
+            5.1577620208263397e-02 -1.1920809745788574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7737 2.3278540000319481e-02</internalNodes>
+          <leafValues>
+            3.0191570520401001e-02 -9.3937888741493225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7738 1.3673819601535797e-02</internalNodes>
+          <leafValues>
+            -2.6758959516882896e-02 2.4014200270175934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7739 -8.3967903628945351e-03</internalNodes>
+          <leafValues>
+            -5.0403770059347153e-02 2.2368110716342926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7740 4.7878470271825790e-02</internalNodes>
+          <leafValues>
+            -2.3758050054311752e-02 2.6486390829086304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7741 -2.2483520209789276e-02</internalNodes>
+          <leafValues>
+            -2.3042780160903931e-01 1.2840679846704006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7742 -1.0883989743888378e-02</internalNodes>
+          <leafValues>
+            -1.8380180001258850e-01 3.2639708369970322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7743 -4.4901989400386810e-02</internalNodes>
+          <leafValues>
+            2.4195960164070129e-01 -2.6507280766963959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7744 -8.3042927086353302e-02</internalNodes>
+          <leafValues>
+            -8.0491328239440918e-01 7.5420029461383820e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7745 -3.7240530364215374e-03</internalNodes>
+          <leafValues>
+            -8.0228239297866821e-02 3.1584471464157104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7746 -7.3502189479768276e-03</internalNodes>
+          <leafValues>
+            6.8962231278419495e-02 -9.7391247749328613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7747 5.5313981138169765e-03</internalNodes>
+          <leafValues>
+            -3.0180720612406731e-02 6.0174800455570221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7748 1.7293080687522888e-02</internalNodes>
+          <leafValues>
+            4.0732100605964661e-02 -1.5600660443305969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7749 -3.3298740163445473e-03</internalNodes>
+          <leafValues>
+            4.1001088917255402e-02 -7.6909027993679047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7750 -4.9308240413665771e-03</internalNodes>
+          <leafValues>
+            1.7031539976596832e-01 -4.0582239627838135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7751 8.6011141538619995e-03</internalNodes>
+          <leafValues>
+            3.1656920909881592e-02 -1.4050039649009705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7752 1.3674340210855007e-02</internalNodes>
+          <leafValues>
+            -2.1845709532499313e-02 3.0128660798072815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7753 -1.1375419795513153e-02</internalNodes>
+          <leafValues>
+            -1.5687340497970581e-01 2.8256019577383995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7754 -4.2750681750476360e-03</internalNodes>
+          <leafValues>
+            -1.2155970185995102e-01 5.0146799534559250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7755 1.6484759747982025e-02</internalNodes>
+          <leafValues>
+            -3.6557890474796295e-02 1.2583729624748230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7756 -3.9056900888681412e-02</internalNodes>
+          <leafValues>
+            2.4053129553794861e-01 -2.6983890682458878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7757 -5.7546719908714294e-03</internalNodes>
+          <leafValues>
+            -1.3337680697441101e-01 2.0266020670533180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7758 5.1583289168775082e-03</internalNodes>
+          <leafValues>
+            6.4666390419006348e-02 -1.1428499966859818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7759 -3.0463270377367735e-03</internalNodes>
+          <leafValues>
+            4.5018680393695831e-02 -8.1573590636253357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7760 7.4743861332535744e-03</internalNodes>
+          <leafValues>
+            3.1246710568666458e-02 -1.8929730355739594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7761 1.6480450285598636e-03</internalNodes>
+          <leafValues>
+            -2.5895040482282639e-02 1.8652880191802979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7762 4.5184311456978321e-03</internalNodes>
+          <leafValues>
+            5.4803468286991119e-02 -1.0444000363349915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7763 -3.3209871035069227e-03</internalNodes>
+          <leafValues>
+            4.3959401547908783e-02 -8.1240482628345490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7764 5.2665979601442814e-03</internalNodes>
+          <leafValues>
+            -4.4853471219539642e-02 1.1343909800052643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7765 -4.7867707908153534e-03</internalNodes>
+          <leafValues>
+            7.6319009065628052e-02 -2.8551170602440834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7766 -4.4710118323564529e-02</internalNodes>
+          <leafValues>
+            -3.4795719385147095e-01 1.4928230084478855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7767 4.3861730955541134e-03</internalNodes>
+          <leafValues>
+            7.4540950357913971e-02 -4.6298071742057800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7768 9.2240851372480392e-03</internalNodes>
+          <leafValues>
+            -5.8626178652048111e-02 9.8693408071994781e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7769 -1.1849260190501809e-03</internalNodes>
+          <leafValues>
+            1.0023140162229538e-01 -5.6729640811681747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7770 -1.8546540290117264e-02</internalNodes>
+          <leafValues>
+            -3.8236171007156372e-01 1.5141529962420464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7771 3.4743950236588717e-03</internalNodes>
+          <leafValues>
+            2.6523910462856293e-02 -1.1289829760789871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7772 1.0274019837379456e-01</internalNodes>
+          <leafValues>
+            -6.6097700037062168e-03 7.7561777830123901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7773 2.0479390025138855e-01</internalNodes>
+          <leafValues>
+            6.9657550193369389e-03 -3.5988980531692505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7774 1.2094060331583023e-01</internalNodes>
+          <leafValues>
+            1.8174450844526291e-02 -3.3531171083450317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7775 1.2224229983985424e-02</internalNodes>
+          <leafValues>
+            -3.1454049050807953e-02 7.9004973173141479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7776 1.5176460146903992e-01</internalNodes>
+          <leafValues>
+            -1.0826669633388519e-02 4.5583090186119080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7777 -9.9692150950431824e-02</internalNodes>
+          <leafValues>
+            -3.5422179102897644e-01 3.1256359070539474e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7778 -6.3465638086199760e-03</internalNodes>
+          <leafValues>
+            -1.1098819971084595e-01 5.3735308349132538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7779 -6.7007602192461491e-03</internalNodes>
+          <leafValues>
+            1.8910090625286102e-01 -3.0930159613490105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7780 -1.0101199895143509e-01</internalNodes>
+          <leafValues>
+            2.3763500154018402e-01 -2.2213969379663467e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7781 4.6111021190881729e-02</internalNodes>
+          <leafValues>
+            -3.7543330341577530e-02 4.8733759671449661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7782 1.4146809279918671e-01</internalNodes>
+          <leafValues>
+            1.1148019693791866e-02 -5.1474362611770630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7783 -1.1394499801099300e-02</internalNodes>
+          <leafValues>
+            -7.0824302732944489e-02 3.1759370118379593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7784 3.1667309813201427e-03</internalNodes>
+          <leafValues>
+            4.1177280247211456e-02 -1.4900580048561096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7785 8.9959725737571716e-03</internalNodes>
+          <leafValues>
+            -4.1186511516571045e-02 7.2816781699657440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7786 -6.1559271067380905e-02</internalNodes>
+          <leafValues>
+            -7.3937642574310303e-01 6.6859079524874687e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7787 -3.5607949830591679e-03</internalNodes>
+          <leafValues>
+            1.3260509818792343e-02 -6.1150819063186646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7788 -1.2476339936256409e-01</internalNodes>
+          <leafValues>
+            -7.8580498695373535e-01 6.2701301649212837e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7789 6.2739187479019165e-01</internalNodes>
+          <leafValues>
+            3.5465341061353683e-03 -7.3363810777664185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7790 3.4219160676002502e-02</internalNodes>
+          <leafValues>
+            8.2031572237610817e-03 -5.3330212831497192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7791 1.0574149928288534e-04</internalNodes>
+          <leafValues>
+            -5.0354700535535812e-02 4.7019489109516144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7792 -3.2112289220094681e-02</internalNodes>
+          <leafValues>
+            1.7085300385951996e-01 -3.4734141081571579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7793 -1.6140839084982872e-02</internalNodes>
+          <leafValues>
+            -6.4753092825412750e-02 5.6943111121654510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7794 1.9737280905246735e-02</internalNodes>
+          <leafValues>
+            -1.8065180629491806e-02 2.6183420419692993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7795 2.7895450592041016e-02</internalNodes>
+          <leafValues>
+            1.7641060054302216e-02 -3.0951151251792908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7796 3.5123159177601337e-03</internalNodes>
+          <leafValues>
+            -8.3447068929672241e-02 6.5015971660614014e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7797 -4.4775637798011303e-03</internalNodes>
+          <leafValues>
+            -1.2423449754714966e-01 4.7061119228601456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7798 -6.1348858289420605e-03</internalNodes>
+          <leafValues>
+            1.0248269885778427e-01 -5.9700958430767059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7799 1.4047959819436073e-02</internalNodes>
+          <leafValues>
+            1.4833379536867142e-02 -1.1229590326547623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7800 1.1907520238310099e-03</internalNodes>
+          <leafValues>
+            4.9986690282821655e-02 -1.1696290224790573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7801 1.7617389559745789e-02</internalNodes>
+          <leafValues>
+            -1.7687700688838959e-02 1.5416090190410614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7802 -4.9166870303452015e-03</internalNodes>
+          <leafValues>
+            -1.0227180272340775e-01 4.6994391828775406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7803 -3.9010820910334587e-03</internalNodes>
+          <leafValues>
+            1.4229449629783630e-01 -4.5312799513339996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7804 -1.7458139918744564e-03</internalNodes>
+          <leafValues>
+            -1.0853090137243271e-01 7.5689561665058136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7805 -1.2748650042340159e-03</internalNodes>
+          <leafValues>
+            2.2384520620107651e-02 -7.5150527060031891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7806 -7.9109556972980499e-02</internalNodes>
+          <leafValues>
+            4.8773929476737976e-01 -9.6941655501723289e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7807 -1.4103270135819912e-02</internalNodes>
+          <leafValues>
+            -2.3263689875602722e-01 1.5091559849679470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7808 -2.2076119203120470e-03</internalNodes>
+          <leafValues>
+            1.9268399477005005e-01 -2.5429060682654381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7809 3.9626058191061020e-02</internalNodes>
+          <leafValues>
+            -1.5630759298801422e-02 1.2270029634237289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7810 -7.8973636846058071e-05</internalNodes>
+          <leafValues>
+            -7.3257647454738617e-02 6.5848693251609802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7811 5.1964947488158941e-04</internalNodes>
+          <leafValues>
+            -1.1366380006074905e-01 8.1133492290973663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7812 -1.1722079943865538e-03</internalNodes>
+          <leafValues>
+            -9.7602643072605133e-02 5.9839569032192230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7813 3.9326730184257030e-03</internalNodes>
+          <leafValues>
+            -5.7026151567697525e-02 4.2226128280162811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7814 -8.7386153638362885e-02</internalNodes>
+          <leafValues>
+            -3.7896049022674561e-01 1.2869279831647873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7815 -2.1324040368199348e-02</internalNodes>
+          <leafValues>
+            3.0886441469192505e-01 -1.7734240740537643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7816 -2.3385910317301750e-03</internalNodes>
+          <leafValues>
+            -1.1322320252656937e-01 4.3914940208196640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7817 1.5183660434558988e-03</internalNodes>
+          <leafValues>
+            -1.4337620139122009e-01 3.9441708475351334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7818 -1.1085519939661026e-01</internalNodes>
+          <leafValues>
+            7.4037587642669678e-01 -6.7982021719217300e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7819 -1.0009120218455791e-02</internalNodes>
+          <leafValues>
+            -3.9203230291604996e-02 3.1749211251735687e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7820 -2.0916430279612541e-02</internalNodes>
+          <leafValues>
+            1.8927730619907379e-01 -3.0490230768918991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7821 7.4165337719023228e-03</internalNodes>
+          <leafValues>
+            4.6797450631856918e-02 -1.1113610118627548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7822 3.3599510788917542e-03</internalNodes>
+          <leafValues>
+            -4.5254990458488464e-02 1.1508409678936005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7823 -5.7189498329535127e-04</internalNodes>
+          <leafValues>
+            -6.3472077250480652e-02 5.2049949765205383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7824 -6.8120293319225311e-02</internalNodes>
+          <leafValues>
+            5.0806027650833130e-01 -9.5091843977570534e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7825 2.5180799420922995e-03</internalNodes>
+          <leafValues>
+            5.5305320769548416e-02 -1.4402769505977631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7826 5.6055251508951187e-02</internalNodes>
+          <leafValues>
+            -2.3359170183539391e-02 2.1935400366783142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7827 -4.0386710315942764e-02</internalNodes>
+          <leafValues>
+            -1.9183440506458282e-01 7.8779058530926704e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7828 3.1857648864388466e-03</internalNodes>
+          <leafValues>
+            2.7605779469013214e-02 -2.0084309577941895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7829 2.5159550830721855e-02</internalNodes>
+          <leafValues>
+            1.1265699751675129e-02 -4.3628180027008057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7830 -2.7010419871658087e-03</internalNodes>
+          <leafValues>
+            1.1336500197649002e-01 -4.6904269605875015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7831 -3.0056890100240707e-02</internalNodes>
+          <leafValues>
+            -6.2368732690811157e-01 7.3214052245020866e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7832 -1.2088020145893097e-01</internalNodes>
+          <leafValues>
+            -8.6428368091583252e-01 4.3813590891659260e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7833 4.0104859508574009e-03</internalNodes>
+          <leafValues>
+            -5.3471650928258896e-02 7.1113802492618561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7834 -2.9688570648431778e-03</internalNodes>
+          <leafValues>
+            1.0076630115509033e-01 -4.9233928322792053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7835 -3.7600689101964235e-03</internalNodes>
+          <leafValues>
+            -2.0928700268268585e-01 2.6549680158495903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7836 -1.5982619952410460e-03</internalNodes>
+          <leafValues>
+            6.1070188879966736e-02 -7.9623572528362274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7837 5.4285880178213120e-03</internalNodes>
+          <leafValues>
+            3.9766579866409302e-02 -1.1746849864721298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7838 1.0872900020331144e-03</internalNodes>
+          <leafValues>
+            -6.4596228301525116e-02 7.4964426457881927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7839 -2.8442030306905508e-03</internalNodes>
+          <leafValues>
+            1.1738350242376328e-01 -4.0159400552511215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7840 3.5546101629734039e-02</internalNodes>
+          <leafValues>
+            1.2194969691336155e-02 -4.2184820771217346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7841 -4.8542950302362442e-02</internalNodes>
+          <leafValues>
+            3.1292769312858582e-01 -1.2773830443620682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7842 -3.0732100829482079e-02</internalNodes>
+          <leafValues>
+            -5.0631237030029297e-01 1.0600729845464230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7843 1.3066929765045643e-02</internalNodes>
+          <leafValues>
+            -5.0003118813037872e-02 4.4005930423736572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7844 2.9200640320777893e-01</internalNodes>
+          <leafValues>
+            5.3693680092692375e-03 -8.9039158821105957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7845 -8.7579451501369476e-03</internalNodes>
+          <leafValues>
+            9.6666730940341949e-02 -3.1310658901929855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7846 -2.3599369451403618e-03</internalNodes>
+          <leafValues>
+            4.3046280741691589e-02 -1.0992430150508881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7847 6.9077489897608757e-03</internalNodes>
+          <leafValues>
+            -2.9174160212278366e-02 8.9174896478652954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7848 2.0849689841270447e-02</internalNodes>
+          <leafValues>
+            1.2614700198173523e-01 -4.4358100742101669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7849 -5.8846421539783478e-02</internalNodes>
+          <leafValues>
+            2.1661500632762909e-01 -8.7285088375210762e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7850 2.5576311163604259e-03</internalNodes>
+          <leafValues>
+            -1.1648210138082504e-01 5.4756019264459610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7851 3.8973900955170393e-03</internalNodes>
+          <leafValues>
+            3.5759489983320236e-02 -9.7868561744689941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7852 -1.2494160328060389e-03</internalNodes>
+          <leafValues>
+            9.1347962617874146e-02 -5.7817179709672928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7853 3.4928850363940001e-03</internalNodes>
+          <leafValues>
+            2.0634220913052559e-02 -1.4494930207729340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7854 -1.1378509923815727e-02</internalNodes>
+          <leafValues>
+            2.1203260123729706e-01 -2.4150850251317024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7855 -4.4060450047254562e-02</internalNodes>
+          <leafValues>
+            4.2267361283302307e-01 -4.7765900380909443e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7856 -8.3084795624017715e-03</internalNodes>
+          <leafValues>
+            -8.4928646683692932e-02 6.0228090733289719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7857 -9.1945994645357132e-03</internalNodes>
+          <leafValues>
+            7.2318702936172485e-02 -2.0472260192036629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7858 6.5575107932090759e-02</internalNodes>
+          <leafValues>
+            5.0813751295208931e-03 -8.9693188667297363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7859 1.8510420620441437e-01</internalNodes>
+          <leafValues>
+            2.2485901135951281e-03 -7.5125169754028320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7860 -1.7608819901943207e-01</internalNodes>
+          <leafValues>
+            -7.8969222307205200e-01 5.2678477950394154e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7861 9.8349712789058685e-02</internalNodes>
+          <leafValues>
+            2.8081049676984549e-03 -2.5828519463539124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7862 -1.8191979324910790e-04</internalNodes>
+          <leafValues>
+            -8.6206100881099701e-02 5.2294798195362091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7863 -5.2928649820387363e-03</internalNodes>
+          <leafValues>
+            -5.4600238800048828e-02 2.8304630890488625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7864 1.1537299724295735e-03</internalNodes>
+          <leafValues>
+            4.6684168279170990e-02 -1.1234779655933380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7865 -3.8274680264294147e-03</internalNodes>
+          <leafValues>
+            6.0145508497953415e-02 -8.2371100783348083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7866 -8.6957857012748718e-02</internalNodes>
+          <leafValues>
+            -4.8363038897514343e-01 9.2326821759343147e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7867 -2.4195960722863674e-03</internalNodes>
+          <leafValues>
+            -3.5221140831708908e-02 2.7081709355115891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7868 -4.7905668616294861e-03</internalNodes>
+          <leafValues>
+            5.8955200016498566e-02 -7.8748136758804321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7869 -4.0910490788519382e-03</internalNodes>
+          <leafValues>
+            -1.7550939321517944e-01 2.6454729959368706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7870 2.5641750544309616e-03</internalNodes>
+          <leafValues>
+            -3.6814831197261810e-02 1.5140229463577271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7871 5.4726968519389629e-03</internalNodes>
+          <leafValues>
+            3.1243579462170601e-02 -9.7890958189964294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7872 -1.0310260113328695e-03</internalNodes>
+          <leafValues>
+            -1.2424050271511078e-01 4.0365029126405716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7873 -1.3030169904232025e-01</internalNodes>
+          <leafValues>
+            1.7106169462203979e-01 -6.9856629706919193e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7874 3.5753389820456505e-03</internalNodes>
+          <leafValues>
+            -2.5437129661440849e-02 2.1967570483684540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7875 8.4238024428486824e-03</internalNodes>
+          <leafValues>
+            2.9582399874925613e-02 -1.7390090227127075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7876 4.1154649108648300e-02</internalNodes>
+          <leafValues>
+            -1.3265499845147133e-02 3.6282411217689514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7877 -1.8620759248733521e-02</internalNodes>
+          <leafValues>
+            -2.2806780040264130e-01 2.1502569317817688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7878 2.3307619616389275e-02</internalNodes>
+          <leafValues>
+            -2.3047760128974915e-02 2.3208670318126678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7879 4.6518299728631973e-02</internalNodes>
+          <leafValues>
+            1.0585400275886059e-02 -4.6076700091362000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7880 -8.3499401807785034e-02</internalNodes>
+          <leafValues>
+            3.7845119833946228e-01 -1.4105740003287792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7881 -9.6897013485431671e-02</internalNodes>
+          <leafValues>
+            -3.2995849847793579e-01 6.2883920036256313e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7882 6.9753699935972691e-03</internalNodes>
+          <leafValues>
+            2.4593630805611610e-02 -2.1003679931163788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7883 -3.3859949558973312e-02</internalNodes>
+          <leafValues>
+            1.8927900493144989e-01 -8.7296841666102409e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7884 1.0354740079492331e-03</internalNodes>
+          <leafValues>
+            -6.4493343234062195e-02 8.0192290246486664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7885 3.9950661361217499e-02</internalNodes>
+          <leafValues>
+            2.5073040276765823e-02 -1.1636939644813538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7886 3.0460350681096315e-03</internalNodes>
+          <leafValues>
+            -3.3754941076040268e-02 1.3324250280857086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7887 -1.5341850230470300e-03</internalNodes>
+          <leafValues>
+            6.2442861497402191e-02 -5.6061070412397385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7888 2.0531520713120699e-03</internalNodes>
+          <leafValues>
+            -8.4790043532848358e-02 5.3408049046993256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7889 2.1295580081641674e-03</internalNodes>
+          <leafValues>
+            4.0650319308042526e-02 -1.1124719679355621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7890 -1.5462029725313187e-02</internalNodes>
+          <leafValues>
+            1.3806979358196259e-01 -3.3944208174943924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7891 -2.7878239750862122e-02</internalNodes>
+          <leafValues>
+            -1.0025399923324585e-01 1.3444880023598671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7892 1.7255680635571480e-02</internalNodes>
+          <leafValues>
+            1.5361789613962173e-02 -3.6930799484252930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7893 -1.7870500683784485e-02</internalNodes>
+          <leafValues>
+            5.2870798856019974e-02 -2.5108009576797485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7894 -1.4443919993937016e-02</internalNodes>
+          <leafValues>
+            -2.2763819992542267e-01 2.0391609519720078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7895 -8.3497241139411926e-03</internalNodes>
+          <leafValues>
+            -8.7055817246437073e-02 3.2707940787076950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7896 2.7514319866895676e-02</internalNodes>
+          <leafValues>
+            -2.0628409460186958e-02 2.5977128744125366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7897 1.8610119819641113e-02</internalNodes>
+          <leafValues>
+            -8.0523788928985596e-03 1.6925090551376343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7898 -9.5786049962043762e-02</internalNodes>
+          <leafValues>
+            -5.0116628408432007e-01 8.7666641920804977e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7899 1.2036979943513870e-01</internalNodes>
+          <leafValues>
+            9.8632962908595800e-04 -1.0000280141830444e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7900 2.4782579392194748e-02</internalNodes>
+          <leafValues>
+            -1.2519709765911102e-02 3.5919609665870667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7901 -5.0353828817605972e-02</internalNodes>
+          <leafValues>
+            -3.3340519666671753e-01 6.9066900759935379e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7902 3.1298059970140457e-02</internalNodes>
+          <leafValues>
+            1.0963119566440582e-02 -4.0645220875740051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7903 7.4575231410562992e-03</internalNodes>
+          <leafValues>
+            -2.1207600831985474e-02 1.3167420029640198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7904 5.5791479535400867e-03</internalNodes>
+          <leafValues>
+            -3.4098070114850998e-02 1.2983830273151398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7905 5.9088319540023804e-03</internalNodes>
+          <leafValues>
+            -2.6940669864416122e-02 1.6839459538459778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7906 1.7543360590934753e-02</internalNodes>
+          <leafValues>
+            4.2376369237899780e-02 -1.2350399792194366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7907 -9.6103046089410782e-03</internalNodes>
+          <leafValues>
+            5.2223920822143555e-02 -2.5582559406757355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7908 2.0607879851013422e-03</internalNodes>
+          <leafValues>
+            4.0174130350351334e-02 -1.0548079758882523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7909 -5.3874161094427109e-03</internalNodes>
+          <leafValues>
+            -6.4995579421520233e-02 2.7807140722870827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7910 1.1102309823036194e-01</internalNodes>
+          <leafValues>
+            -4.9670711159706116e-03 8.1718921661376953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7911 -3.7374150007963181e-02</internalNodes>
+          <leafValues>
+            -6.2611418962478638e-01 3.0927599873393774e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7912 5.0286632031202316e-03</internalNodes>
+          <leafValues>
+            2.4978660047054291e-01 -1.8151100724935532e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7913 2.9225579928606749e-03</internalNodes>
+          <leafValues>
+            -6.0576818883419037e-02 2.6497339829802513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7914 -5.4296620190143585e-02</internalNodes>
+          <leafValues>
+            -5.7990437746047974e-01 6.5989522263407707e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7915 1.2996720150113106e-02</internalNodes>
+          <leafValues>
+            -2.6128260418772697e-02 9.7030609846115112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7916 3.3001229166984558e-02</internalNodes>
+          <leafValues>
+            1.4960479922592640e-02 -3.2304659485816956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7917 -1.1660449951887131e-01</internalNodes>
+          <leafValues>
+            2.5725141167640686e-01 -1.2625830247998238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7918 7.0706337690353394e-02</internalNodes>
+          <leafValues>
+            7.0192231796681881e-03 -6.9260591268539429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7919 -4.4549949467182159e-02</internalNodes>
+          <leafValues>
+            -7.1134221553802490e-01 4.9668429419398308e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7920 4.2873818427324295e-02</internalNodes>
+          <leafValues>
+            6.7160711623728275e-03 -5.2660852670669556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7921 2.5025280192494392e-02</internalNodes>
+          <leafValues>
+            -1.8445409834384918e-02 7.8793220221996307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7922 2.1663550287485123e-03</internalNodes>
+          <leafValues>
+            3.2540310174226761e-02 -1.3115049898624420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7923 2.5540040805935860e-02</internalNodes>
+          <leafValues>
+            -3.4693568944931030e-02 4.1404798626899719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7924 -8.3627507090568542e-02</internalNodes>
+          <leafValues>
+            -5.2143442630767822e-01 7.7060810290277004e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7925 3.7637550849467516e-03</internalNodes>
+          <leafValues>
+            -2.9463630169630051e-02 7.4424192309379578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7926 3.7175719626247883e-03</internalNodes>
+          <leafValues>
+            -4.2123001068830490e-02 1.0287009924650192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7927 -5.2892807871103287e-03</internalNodes>
+          <leafValues>
+            -1.2348390370607376e-01 3.7152700126171112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7928 -9.1878473758697510e-03</internalNodes>
+          <leafValues>
+            9.0256750583648682e-02 -5.2674051374197006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7929 -5.5448919534683228e-02</internalNodes>
+          <leafValues>
+            -5.3639650344848633e-01 2.6584670413285494e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7930 6.4754108898341656e-03</internalNodes>
+          <leafValues>
+            5.5367350578308105e-02 -9.2722631990909576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7931 -1.5773440245538950e-03</internalNodes>
+          <leafValues>
+            1.3578939437866211e-01 -4.0911730378866196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7932 -4.9912789836525917e-04</internalNodes>
+          <leafValues>
+            -1.4728380739688873e-01 5.3603630512952805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7933 1.5690509974956512e-01</internalNodes>
+          <leafValues>
+            -7.8873159363865852e-03 3.7397789955139160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7934 3.6391850560903549e-02</internalNodes>
+          <leafValues>
+            4.9765990115702152e-03 -9.1157531738281250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7935 -9.5625342801213264e-03</internalNodes>
+          <leafValues>
+            1.2767709791660309e-01 -1.4394680038094521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7936 2.4007901083678007e-03</internalNodes>
+          <leafValues>
+            -1.3107380270957947e-01 4.4731479138135910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7937 3.2929850276559591e-03</internalNodes>
+          <leafValues>
+            4.0428631007671356e-02 -5.3223561495542526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7938 -3.1314359512180090e-03</internalNodes>
+          <leafValues>
+            3.6826111376285553e-02 -1.2113159894943237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7939 5.2008330821990967e-02</internalNodes>
+          <leafValues>
+            5.9283021837472916e-03 -4.3858841061592102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7940 5.7681259931996465e-04</internalNodes>
+          <leafValues>
+            -6.9851770997047424e-02 6.4286291599273682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7941 6.1443001031875610e-03</internalNodes>
+          <leafValues>
+            3.0908059328794479e-02 -1.8229809403419495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7942 3.5959720611572266e-02</internalNodes>
+          <leafValues>
+            -4.1680991649627686e-02 1.4244790375232697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7943 -2.1290820091962814e-02</internalNodes>
+          <leafValues>
+            -9.6662320196628571e-02 5.5888749659061432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7944 -6.2724511371925473e-04</internalNodes>
+          <leafValues>
+            9.0150557458400726e-02 -6.9430753588676453e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7945 -2.5145700201392174e-03</internalNodes>
+          <leafValues>
+            -6.9526046514511108e-02 4.5552581548690796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7946 5.7874649763107300e-02</internalNodes>
+          <leafValues>
+            -2.5036580860614777e-02 2.0633180439472198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7947 1.5898469835519791e-02</internalNodes>
+          <leafValues>
+            -1.7133399844169617e-02 1.1004959791898727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7948 2.7882799506187439e-02</internalNodes>
+          <leafValues>
+            2.7713179588317871e-02 -1.6536410152912140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7949 8.8283112272620201e-03</internalNodes>
+          <leafValues>
+            -2.7497250586748123e-02 5.9822890907526016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7950 -1.5679910778999329e-02</internalNodes>
+          <leafValues>
+            -2.6984989643096924e-01 1.6398239880800247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7951 4.1906189173460007e-02</internalNodes>
+          <leafValues>
+            -8.0525986850261688e-03 3.1556311249732971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7952 -4.1068609803915024e-02</internalNodes>
+          <leafValues>
+            2.5637561082839966e-01 -1.8357910215854645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7953 3.5570110194385052e-03</internalNodes>
+          <leafValues>
+            2.9343830421566963e-02 -1.2668469548225403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7954 -2.1371750626713037e-03</internalNodes>
+          <leafValues>
+            1.2923260033130646e-01 -4.0102209895849228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7955 3.3638089895248413e-02</internalNodes>
+          <leafValues>
+            8.1196166574954987e-03 -4.0394780039787292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7956 1.0182919912040234e-02</internalNodes>
+          <leafValues>
+            -4.2566180229187012e-02 1.1843100190162659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7957 -7.0302112726494670e-04</internalNodes>
+          <leafValues>
+            3.8721978664398193e-02 -7.9703420400619507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7958 -2.8552680741995573e-03</internalNodes>
+          <leafValues>
+            9.1274276375770569e-02 -6.1691451817750931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7959 -2.9935541097074747e-03</internalNodes>
+          <leafValues>
+            -1.0913450270891190e-01 3.8736950606107712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7960 -5.3608341841027141e-04</internalNodes>
+          <leafValues>
+            -4.3252488970756531e-01 1.0958270169794559e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7961 5.1431890577077866e-02</internalNodes>
+          <leafValues>
+            4.7060111537575722e-03 -2.6765900850296021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7962 -4.8872891813516617e-02</internalNodes>
+          <leafValues>
+            2.0144729316234589e-01 -2.2844519466161728e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7963 -1.6080449521541595e-01</internalNodes>
+          <leafValues>
+            -1. 1.9577229395508766e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7964 1.8509939312934875e-02</internalNodes>
+          <leafValues>
+            1.7808660864830017e-02 -2.7871158719062805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7965 -4.2106948792934418e-02</internalNodes>
+          <leafValues>
+            -6.2493157386779785e-01 7.0520970039069653e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7966 -9.7096778452396393e-02</internalNodes>
+          <leafValues>
+            -8.4505838155746460e-01 4.4749649241566658e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7967 -9.4244757201522589e-04</internalNodes>
+          <leafValues>
+            1.9796760380268097e-01 -2.2733120247721672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7968 -1.8040809780359268e-02</internalNodes>
+          <leafValues>
+            -3.3424109220504761e-01 1.3358039781451225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7969 6.3626631163060665e-04</internalNodes>
+          <leafValues>
+            -1.0530749708414078e-01 4.4016160070896149e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7970 -3.4530549310147762e-03</internalNodes>
+          <leafValues>
+            -1.3687069714069366e-01 3.0288280919194221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7971 1.7589809373021126e-02</internalNodes>
+          <leafValues>
+            -2.8031280264258385e-02 1.8331700563430786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7972 -1.4289390528574586e-03</internalNodes>
+          <leafValues>
+            6.7616157233715057e-02 -6.4400359988212585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7973 1.4584570191800594e-02</internalNodes>
+          <leafValues>
+            -3.2548811286687851e-02 7.7070221304893494e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7974 7.4579578638076782e-01</internalNodes>
+          <leafValues>
+            9.1963959857821465e-03 -4.5680120587348938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7975 -1.2285649776458740e-01</internalNodes>
+          <leafValues>
+            -6.4423608779907227e-01 2.0847769919782877e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7976 -1.1613000184297562e-01</internalNodes>
+          <leafValues>
+            -7.9274278879165649e-01 4.9578230828046799e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7977 5.5644840002059937e-02</internalNodes>
+          <leafValues>
+            -5.7718120515346527e-03 3.0834281444549561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7978 2.0566429942846298e-02</internalNodes>
+          <leafValues>
+            -1.5474709682166576e-02 2.8002938628196716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7979 3.8393519935198128e-04</internalNodes>
+          <leafValues>
+            3.4390248358249664e-02 -1.0244189947843552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7980 4.0198508650064468e-03</internalNodes>
+          <leafValues>
+            5.2533138543367386e-02 -1.1492720246315002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7981 -7.4124410748481750e-02</internalNodes>
+          <leafValues>
+            -3.0216461420059204e-01 4.2779031209647655e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7982 -3.4346429165452719e-03</internalNodes>
+          <leafValues>
+            6.5627492964267731e-02 -6.9991588592529297e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7983 -4.3740049004554749e-03</internalNodes>
+          <leafValues>
+            -1.2934839725494385e-01 5.1233518868684769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7984 6.9464151747524738e-03</internalNodes>
+          <leafValues>
+            -3.2591849565505981e-02 1.5098060667514801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7985 -1.8434170633554459e-02</internalNodes>
+          <leafValues>
+            -3.1364220380783081e-01 9.5867328345775604e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7986 -3.2201830763369799e-03</internalNodes>
+          <leafValues>
+            -1.7494319379329681e-01 3.3579058945178986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7987 -3.2273299992084503e-02</internalNodes>
+          <leafValues>
+            2.4136200547218323e-01 -2.4392010644078255e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7988 -4.8193791881203651e-03</internalNodes>
+          <leafValues>
+            -1.3610219955444336e-01 4.1156660765409470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7989 -9.8347626626491547e-02</internalNodes>
+          <leafValues>
+            -5.3324717283248901e-01 8.8729923591017723e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7990 1.9054619595408440e-02</internalNodes>
+          <leafValues>
+            -3.2564271241426468e-02 1.6729709506034851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7991 -8.1796169281005859e-02</internalNodes>
+          <leafValues>
+            -6.4131242036819458e-01 8.7052602320909500e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7992 3.2996949739754200e-03</internalNodes>
+          <leafValues>
+            -5.9765439480543137e-02 7.1879856288433075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7993 -7.5977660715579987e-02</internalNodes>
+          <leafValues>
+            -5.0415420532226562e-01 5.6795510463416576e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7994 3.0508760362863541e-02</internalNodes>
+          <leafValues>
+            1.0317360050976276e-02 -4.3552881479263306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7995 -3.7642959505319595e-02</internalNodes>
+          <leafValues>
+            3.7324428558349609e-01 -1.7276229336857796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7996 -9.9801109172403812e-04</internalNodes>
+          <leafValues>
+            -1.4508770406246185e-01 3.0973700806498528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7997 -2.0703389309346676e-03</internalNodes>
+          <leafValues>
+            1.2285920232534409e-01 -2.5285899639129639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7998 7.1816377341747284e-02</internalNodes>
+          <leafValues>
+            7.2997398674488068e-03 -6.2621092796325684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7999 1.6781920194625854e-01</internalNodes>
+          <leafValues>
+            -1.0094069875776768e-02 2.2531180083751678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8000 1.5028619964141399e-04</internalNodes>
+          <leafValues>
+            -4.9013838171958923e-02 9.5635637640953064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8001 9.5139637589454651e-02</internalNodes>
+          <leafValues>
+            -2.3964960128068924e-03 7.8972822427749634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8002 3.8569360040128231e-03</internalNodes>
+          <leafValues>
+            4.0852431207895279e-02 -1.1976979672908783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8003 2.3172760382294655e-02</internalNodes>
+          <leafValues>
+            -8.1755416467785835e-03 3.4895899891853333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8004 1.3417989946901798e-02</internalNodes>
+          <leafValues>
+            2.9357729479670525e-02 -1.4476950466632843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8005 -1.4165779948234558e-01</internalNodes>
+          <leafValues>
+            3.4960448741912842e-01 -3.9633908309042454e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8006 5.5483141914010048e-03</internalNodes>
+          <leafValues>
+            -4.6736769378185272e-02 8.7630823254585266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8007 -4.7431029379367828e-03</internalNodes>
+          <leafValues>
+            6.2899678945541382e-02 -2.6983590796589851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8008 -6.6862776875495911e-02</internalNodes>
+          <leafValues>
+            -9.5272868871688843e-01 3.9776111952960491e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8009 2.2987840697169304e-02</internalNodes>
+          <leafValues>
+            -1.7802899703383446e-02 1.4564949274063110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8010 -2.2234279662370682e-02</internalNodes>
+          <leafValues>
+            -9.3360446393489838e-02 5.1537070423364639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8011 1.5045719919726253e-05</internalNodes>
+          <leafValues>
+            -3.0237749218940735e-02 2.6654670014977455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8012 -4.7994707711040974e-03</internalNodes>
+          <leafValues>
+            1.0105530172586441e-01 -5.0083991140127182e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8013 -2.4227909743785858e-01</internalNodes>
+          <leafValues>
+            -6.8399482965469360e-01 2.1470880601555109e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8014 4.6939790248870850e-02</internalNodes>
+          <leafValues>
+            8.1193735823035240e-03 -4.7671818733215332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8015 -6.0940280556678772e-02</internalNodes>
+          <leafValues>
+            2.3827329277992249e-01 -9.5430584624409676e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8016 2.4104740470647812e-02</internalNodes>
+          <leafValues>
+            -1.5799079090356827e-02 2.6727899909019470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8017 -4.6567570418119431e-02</internalNodes>
+          <leafValues>
+            -3.1017771363258362e-01 8.3353007212281227e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8018 1.8709240248426795e-03</internalNodes>
+          <leafValues>
+            -7.2588071227073669e-02 6.5608270466327667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8019 -5.9872400015592575e-03</internalNodes>
+          <leafValues>
+            -1.8159690499305725e-01 1.4030029997229576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8020 -7.3103660724882502e-06</internalNodes>
+          <leafValues>
+            4.0913790464401245e-02 -1.0656440258026123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8021 -2.3244550451636314e-02</internalNodes>
+          <leafValues>
+            -1.9035540521144867e-01 1.5966059640049934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8022 -1.1853489559143782e-03</internalNodes>
+          <leafValues>
+            5.9956710785627365e-02 -7.6678447425365448e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8023 -1.2981820106506348e-01</internalNodes>
+          <leafValues>
+            4.0999498963356018e-01 -5.0850748084485531e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8024 -5.1512669771909714e-02</internalNodes>
+          <leafValues>
+            -3.0527231097221375e-01 1.4186340384185314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8025 -3.9303461089730263e-03</internalNodes>
+          <leafValues>
+            -7.9763479530811310e-02 2.6248890906572342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8026 1.5822829678654671e-02</internalNodes>
+          <leafValues>
+            -1.6849309206008911e-02 2.7549791336059570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8027 1.1561570316553116e-01</internalNodes>
+          <leafValues>
+            6.7870649509131908e-03 -1.2709319591522217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8028 1.1260829633101821e-03</internalNodes>
+          <leafValues>
+            8.1908516585826874e-02 -5.8194048702716827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8029 1.5513430349528790e-02</internalNodes>
+          <leafValues>
+            -4.2989719659090042e-02 7.8364297747612000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8030 4.6268731355667114e-02</internalNodes>
+          <leafValues>
+            1.1759550310671329e-02 -3.9947330951690674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8031 7.9535972326993942e-03</internalNodes>
+          <leafValues>
+            1.6848539933562279e-02 -8.8599078357219696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8032 -1.8991220742464066e-02</internalNodes>
+          <leafValues>
+            2.4813260138034821e-01 -1.7320850864052773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8033 3.7058200687170029e-03</internalNodes>
+          <leafValues>
+            -2.1747030317783356e-02 5.8276090770959854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8034 2.5829279329627752e-03</internalNodes>
+          <leafValues>
+            5.0559278577566147e-02 -9.3193918466567993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8035 -3.1010560691356659e-02</internalNodes>
+          <leafValues>
+            2.2110439836978912e-01 -1.4786499552428722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8036 2.5402549654245377e-03</internalNodes>
+          <leafValues>
+            -8.6743600666522980e-02 5.7932410389184952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8037 -8.9100487530231476e-03</internalNodes>
+          <leafValues>
+            5.3846079856157303e-02 -4.5931909233331680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8038 4.0557151660323143e-03</internalNodes>
+          <leafValues>
+            5.9298399835824966e-02 -8.3007253706455231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8039 6.1204940080642700e-02</internalNodes>
+          <leafValues>
+            9.2248879373073578e-03 -2.1082369983196259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8040 7.7630057930946350e-03</internalNodes>
+          <leafValues>
+            -7.5927056372165680e-02 5.7865709066390991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8041 1.5921150147914886e-01</internalNodes>
+          <leafValues>
+            8.3040859317407012e-04 -1.0000480413436890e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8042 3.9196189492940903e-02</internalNodes>
+          <leafValues>
+            7.1930838748812675e-03 -6.0338622331619263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8043 1.0220289975404739e-01</internalNodes>
+          <leafValues>
+            -3.6227719392627478e-03 5.4500752687454224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8044 -1.5064980089664459e-01</internalNodes>
+          <leafValues>
+            -7.0450758934020996e-01 6.6995541565120220e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8045 1.3819299638271332e-01</internalNodes>
+          <leafValues>
+            -1.1153860017657280e-02 1.7932909727096558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8046 -3.8313010009005666e-04</internalNodes>
+          <leafValues>
+            -7.2442352771759033e-02 5.7925980538129807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8047 -2.7796919457614422e-03</internalNodes>
+          <leafValues>
+            -8.6280398070812225e-02 4.1014600545167923e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8048 3.9365138858556747e-02</internalNodes>
+          <leafValues>
+            -4.6629320830106735e-02 8.8124006986618042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8049 -6.1933819204568863e-02</internalNodes>
+          <leafValues>
+            7.0118552446365356e-01 -2.5661089457571507e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8050 -5.9742941521108150e-03</internalNodes>
+          <leafValues>
+            -1.6519010066986084e-01 3.7947021424770355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8051 7.5101079419255257e-03</internalNodes>
+          <leafValues>
+            5.4191488772630692e-02 -7.9166658222675323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8052 -9.7005672752857208e-02</internalNodes>
+          <leafValues>
+            -8.8104772567749023e-01 4.8486101441085339e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8053 -6.7751510068774223e-03</internalNodes>
+          <leafValues>
+            9.1601163148880005e-02 -4.8942770808935165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8054 -9.2599419876933098e-03</internalNodes>
+          <leafValues>
+            -1.3298119604587555e-01 4.1785500943660736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8055 1.5215040184557438e-03</internalNodes>
+          <leafValues>
+            5.2633590996265411e-02 -6.0624439269304276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8056 5.4703168570995331e-03</internalNodes>
+          <leafValues>
+            -4.7825179994106293e-02 1.1194570362567902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8057 2.5002110749483109e-02</internalNodes>
+          <leafValues>
+            -2.0354969426989555e-02 1.0175590217113495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8058 3.2576780766248703e-02</internalNodes>
+          <leafValues>
+            2.5629660114645958e-02 -1.9484190642833710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8059 -7.7732130885124207e-03</internalNodes>
+          <leafValues>
+            1.2477400153875351e-01 -3.4667998552322388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8060 1.7777189612388611e-02</internalNodes>
+          <leafValues>
+            3.3261820673942566e-02 -1.4155229926109314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8061 1.0459429584443569e-02</internalNodes>
+          <leafValues>
+            -4.4039878994226456e-02 6.1871558427810669e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>406</maxWeakCount>
+      <stageThreshold>-1.1700680255889893e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 8062 1.8751189112663269e-02</internalNodes>
+          <leafValues>
+            -1.7775079607963562e-01 1.7157439887523651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8063 -2.1875950042158365e-03</internalNodes>
+          <leafValues>
+            7.5339153409004211e-02 -2.5842121243476868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8064 -1.1698690056800842e-01</internalNodes>
+          <leafValues>
+            4.2645370960235596e-01 -3.7121698260307312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8065 3.8377330638468266e-03</internalNodes>
+          <leafValues>
+            3.5092439502477646e-02 -1.5757289528846741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8066 -1.2941210297867656e-03</internalNodes>
+          <leafValues>
+            -2.0068730413913727e-01 5.5704809725284576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8067 4.3927300721406937e-03</internalNodes>
+          <leafValues>
+            5.7497099041938782e-02 -1.9302740693092346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8068 -1.5021540457382798e-03</internalNodes>
+          <leafValues>
+            7.2378978133201599e-02 -1.4534910023212433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8069 1.2381949927657843e-03</internalNodes>
+          <leafValues>
+            -9.0413779020309448e-02 8.2838788628578186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8070 3.0004729051142931e-03</internalNodes>
+          <leafValues>
+            6.0199409723281860e-02 -1.5556170046329498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8071 4.5666601508855820e-03</internalNodes>
+          <leafValues>
+            -7.6936639845371246e-02 1.3762770593166351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8072 9.9231943022459745e-04</internalNodes>
+          <leafValues>
+            4.7918211668729782e-02 -2.0472359657287598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8073 -3.8909649010747671e-03</internalNodes>
+          <leafValues>
+            -2.1067039668560028e-01 5.9297189116477966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8074 2.4324860423803329e-03</internalNodes>
+          <leafValues>
+            -7.3611870408058167e-02 1.4165569841861725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8075 -3.3090400975197554e-03</internalNodes>
+          <leafValues>
+            -1.6489060223102570e-01 4.3310891836881638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8076 5.9596560895442963e-03</internalNodes>
+          <leafValues>
+            -2.1388399600982666e-01 4.3472908437252045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8077 9.7754271700978279e-03</internalNodes>
+          <leafValues>
+            2.7664290741086006e-02 -1.9119890034198761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8078 -3.8124300539493561e-02</internalNodes>
+          <leafValues>
+            3.1658840179443359e-01 -2.9972679913043976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8079 1.4401610242202878e-03</internalNodes>
+          <leafValues>
+            -1.6602130234241486e-01 6.1300911009311676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8080 7.5199408456683159e-04</internalNodes>
+          <leafValues>
+            -1.3568510115146637e-01 5.7345770299434662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8081 2.4780649691820145e-03</internalNodes>
+          <leafValues>
+            -7.7258758246898651e-02 5.3781200200319290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8082 9.2068109661340714e-03</internalNodes>
+          <leafValues>
+            7.4349351227283478e-02 -1.3886499404907227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8083 1.7634540796279907e-02</internalNodes>
+          <leafValues>
+            -2.6817159727215767e-02 3.4912449121475220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8084 1.0517879854887724e-03</internalNodes>
+          <leafValues>
+            8.3444483578205109e-02 -8.3271436393260956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8085 -7.2119189426302910e-03</internalNodes>
+          <leafValues>
+            1.4149050414562225e-01 -3.0853189527988434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8086 8.1929508596658707e-03</internalNodes>
+          <leafValues>
+            6.4249828457832336e-02 -1.4224460721015930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8087 -5.7932751951739192e-04</internalNodes>
+          <leafValues>
+            -6.1768930405378342e-02 3.4835230559110641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8088 4.5172017998993397e-03</internalNodes>
+          <leafValues>
+            -7.3925666511058807e-02 9.5347866415977478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8089 2.2280250489711761e-01</internalNodes>
+          <leafValues>
+            2.8079450130462646e-02 -2.6174598932266235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8090 -8.1560667604207993e-04</internalNodes>
+          <leafValues>
+            -1.1128710210323334e-01 6.1751261353492737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8091 1.9009260460734367e-02</internalNodes>
+          <leafValues>
+            -3.5914849489927292e-02 9.5332697033882141e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8092 -1.1708099627867341e-03</internalNodes>
+          <leafValues>
+            -1.7809429764747620e-01 3.8471758365631104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8093 -2.7492839843034744e-02</internalNodes>
+          <leafValues>
+            1.5674190223217010e-01 -3.6307450383901596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8094 -5.4139150306582451e-03</internalNodes>
+          <leafValues>
+            -1.6014580428600311e-01 4.5228298753499985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8095 1.1325670406222343e-02</internalNodes>
+          <leafValues>
+            -5.2679128944873810e-02 1.2411580234766006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8096 -1.3919079303741455e-01</internalNodes>
+          <leafValues>
+            -2.8573009371757507e-01 2.5642180815339088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8097 -7.6183810830116272e-02</internalNodes>
+          <leafValues>
+            2.0390880107879639e-01 -1.2701939791440964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8098 1.3947900151833892e-03</internalNodes>
+          <leafValues>
+            -1.1320529878139496e-01 5.7419300079345703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8099 4.6532237902283669e-03</internalNodes>
+          <leafValues>
+            5.7795990258455276e-02 -1.0997010022401810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8100 4.5034389942884445e-02</internalNodes>
+          <leafValues>
+            -2.8761979192495346e-02 2.2605720162391663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8101 1.6864009201526642e-02</internalNodes>
+          <leafValues>
+            3.6318089812994003e-02 -2.0162770152091980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8102 1.9251279532909393e-01</internalNodes>
+          <leafValues>
+            -1.3869989663362503e-02 5.4226338863372803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8103 -1.6758369747549295e-03</internalNodes>
+          <leafValues>
+            -1.1462789773941040e-01 4.9984849989414215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8104 -4.5270361006259918e-03</internalNodes>
+          <leafValues>
+            1.1731909960508347e-01 -6.1384700238704681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8105 5.4975082166492939e-03</internalNodes>
+          <leafValues>
+            3.2194830477237701e-02 -1.5348540246486664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8106 3.5562040284276009e-03</internalNodes>
+          <leafValues>
+            -6.3937939703464508e-02 1.0787469893693924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8107 2.1489830687642097e-03</internalNodes>
+          <leafValues>
+            -5.0976738333702087e-02 2.9315000399947166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8108 -1.0464210063219070e-02</internalNodes>
+          <leafValues>
+            1.9548749923706055e-01 -3.2784409821033478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8109 -2.9779719188809395e-02</internalNodes>
+          <leafValues>
+            -3.9286538958549500e-01 1.2266620062291622e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8110 9.6993939951062202e-04</internalNodes>
+          <leafValues>
+            -1.0772799700498581e-01 6.1684250831604004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8111 -4.0499098598957062e-02</internalNodes>
+          <leafValues>
+            -3.6696648597717285e-01 1.1805539950728416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8112 -2.3762779310345650e-03</internalNodes>
+          <leafValues>
+            -1.3933740556240082e-01 5.0010170787572861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8113 -5.1528858020901680e-03</internalNodes>
+          <leafValues>
+            9.7424000501632690e-02 -2.3820690810680389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8114 -2.8726980090141296e-02</internalNodes>
+          <leafValues>
+            2.1031719446182251e-01 -3.6088269203901291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8115 1.4215350151062012e-02</internalNodes>
+          <leafValues>
+            3.4664131700992584e-02 -1.5814340114593506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8116 2.0164670422673225e-03</internalNodes>
+          <leafValues>
+            5.0487071275711060e-02 -1.2704199552536011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8117 4.1724709444679320e-04</internalNodes>
+          <leafValues>
+            -5.6635189801454544e-02 1.0789140313863754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8118 7.3380130343139172e-03</internalNodes>
+          <leafValues>
+            5.0891719758510590e-02 -1.2210439890623093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8119 -7.5930766761302948e-02</internalNodes>
+          <leafValues>
+            2.2627210617065430e-01 -6.6569480113685131e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8120 -4.2873369529843330e-03</internalNodes>
+          <leafValues>
+            7.2104290127754211e-02 -8.0106139183044434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8121 -2.4101670831441879e-02</internalNodes>
+          <leafValues>
+            9.1355301439762115e-02 -3.4591969102621078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8122 1.9936550408601761e-02</internalNodes>
+          <leafValues>
+            -3.7764240056276321e-02 1.8896919488906860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8123 5.6939899921417236e-01</internalNodes>
+          <leafValues>
+            3.1492649577558041e-03 -5.9846472740173340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8124 1.0352060198783875e-01</internalNodes>
+          <leafValues>
+            2.3323200643062592e-02 -3.2129231095314026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8125 5.9556990861892700e-02</internalNodes>
+          <leafValues>
+            4.2170342057943344e-03 -3.3442139625549316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8126 -5.0575539469718933e-02</internalNodes>
+          <leafValues>
+            -8.4793227910995483e-01 6.6583030857145786e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8127 -5.5158971808850765e-03</internalNodes>
+          <leafValues>
+            -7.0507496595382690e-02 2.1716769784688950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8128 2.9419310390949249e-02</internalNodes>
+          <leafValues>
+            -3.6319408565759659e-02 1.7510940134525299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8129 1.0972440242767334e-02</internalNodes>
+          <leafValues>
+            1.8267199397087097e-02 -1.8641340732574463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8130 -3.8842339999973774e-03</internalNodes>
+          <leafValues>
+            -1.0735920071601868e-01 6.0849040746688843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8131 -1.1936859664274380e-04</internalNodes>
+          <leafValues>
+            5.2348621189594269e-02 -1.2701539695262909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8132 -5.0230980850756168e-03</internalNodes>
+          <leafValues>
+            5.2682720124721527e-02 -1.2703679502010345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8133 1.8986819684505463e-01</internalNodes>
+          <leafValues>
+            1.7255579587072134e-03 -3.2701051235198975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8134 -2.4319409858435392e-03</internalNodes>
+          <leafValues>
+            1.3875140249729156e-01 -4.3046601116657257e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8135 -2.0888550207018852e-03</internalNodes>
+          <leafValues>
+            -1.1241009831428528e-01 3.7676859647035599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8136 4.2116310447454453e-02</internalNodes>
+          <leafValues>
+            8.1929191946983337e-03 -6.8541908264160156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8137 2.7380110695958138e-02</internalNodes>
+          <leafValues>
+            4.4103930704295635e-03 -5.3421849012374878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8138 2.1348569542169571e-02</internalNodes>
+          <leafValues>
+            -5.1160380244255066e-02 1.0021480172872543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8139 -1.7236869782209396e-02</internalNodes>
+          <leafValues>
+            -3.9995738863945007e-01 2.0257489755749702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8140 7.8617185354232788e-03</internalNodes>
+          <leafValues>
+            2.8996279463171959e-02 -1.8014070391654968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8141 8.1942398101091385e-03</internalNodes>
+          <leafValues>
+            -2.5498030707240105e-02 8.4693931043148041e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8142 6.2367911450564861e-03</internalNodes>
+          <leafValues>
+            1.8659260123968124e-02 -2.6443660259246826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8143 2.1872919751331210e-04</internalNodes>
+          <leafValues>
+            -1.5943029522895813e-01 3.0722649767994881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8144 -6.4004249870777130e-03</internalNodes>
+          <leafValues>
+            2.8331050276756287e-01 -1.9352490082383156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8145 -1.0007199645042419e-01</internalNodes>
+          <leafValues>
+            -4.0704050660133362e-01 6.1583020724356174e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8146 1.5690149739384651e-02</internalNodes>
+          <leafValues>
+            -1.6772339120507240e-02 2.9049569368362427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8147 -7.0421490818262100e-03</internalNodes>
+          <leafValues>
+            -6.7985177040100098e-02 3.1130369752645493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8148 -1.5320030041038990e-02</internalNodes>
+          <leafValues>
+            3.6400088667869568e-01 -1.3608699664473534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8149 5.8485660701990128e-02</internalNodes>
+          <leafValues>
+            7.4363988824188709e-03 -7.5599330663681030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8150 -3.5200670827180147e-03</internalNodes>
+          <leafValues>
+            -1.3923290371894836e-01 3.7657551467418671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8151 -8.7158178212121129e-04</internalNodes>
+          <leafValues>
+            4.2339839041233063e-02 -5.3530458360910416e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8152 2.4548629298806190e-03</internalNodes>
+          <leafValues>
+            -4.4667050242424011e-02 1.3785070180892944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8153 -6.1778929084539413e-02</internalNodes>
+          <leafValues>
+            -3.5338079929351807e-01 4.5869671739637852e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8154 -3.8533521001227200e-04</internalNodes>
+          <leafValues>
+            7.2278007864952087e-02 -1.0433299839496613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8155 7.6227717101573944e-02</internalNodes>
+          <leafValues>
+            -1.1004550382494926e-02 5.0025188922882080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8156 -4.4210380874574184e-03</internalNodes>
+          <leafValues>
+            -8.6290426552295685e-02 5.8773420751094818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8157 1.5068270266056061e-02</internalNodes>
+          <leafValues>
+            -5.8916270732879639e-02 1.0025119781494141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8158 2.5007940828800201e-02</internalNodes>
+          <leafValues>
+            7.6251477003097534e-02 -8.8744960725307465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8159 -7.7328123152256012e-02</internalNodes>
+          <leafValues>
+            2.5363400578498840e-01 -1.5778530389070511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8160 3.5588641185313463e-04</internalNodes>
+          <leafValues>
+            6.2983699142932892e-02 -7.7181987464427948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8161 6.9400526583194733e-02</internalNodes>
+          <leafValues>
+            -8.9571140706539154e-03 1.5102629363536835e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8162 -1.8577709794044495e-01</internalNodes>
+          <leafValues>
+            -6.9518351554870605e-01 7.8398203477263451e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8163 -6.6014728508889675e-03</internalNodes>
+          <leafValues>
+            -5.6056641042232513e-02 2.4557920172810555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8164 4.0490310639142990e-02</internalNodes>
+          <leafValues>
+            -2.0202599465847015e-02 2.7736270427703857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8165 1.6997240018099546e-03</internalNodes>
+          <leafValues>
+            -1.1403460055589676e-01 1.9222680479288101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8166 8.4750041365623474e-02</internalNodes>
+          <leafValues>
+            1.8607510253787041e-02 -3.0505430698394775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8167 -1.6975879669189453e-02</internalNodes>
+          <leafValues>
+            1.2357109785079956e-01 -2.9016660526394844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8168 4.6773189678788185e-03</internalNodes>
+          <leafValues>
+            -4.5864760875701904e-02 1.1718840152025223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8169 -1.4066020026803017e-02</internalNodes>
+          <leafValues>
+            -1.3670490682125092e-01 1.7362629994750023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8170 5.0944689661264420e-02</internalNodes>
+          <leafValues>
+            1.3865640386939049e-02 -3.9529040455818176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8171 9.8265796899795532e-02</internalNodes>
+          <leafValues>
+            -1.2339199893176556e-02 3.6408239603042603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8172 1.1730480473488569e-03</internalNodes>
+          <leafValues>
+            6.6400513052940369e-02 -8.2091093063354492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8173 1.0979039967060089e-01</internalNodes>
+          <leafValues>
+            4.6397978439927101e-03 -6.1344558000564575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8174 4.9452850362285972e-04</internalNodes>
+          <leafValues>
+            -1.0062679648399353e-01 5.7191990315914154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8175 3.5673558712005615e-01</internalNodes>
+          <leafValues>
+            -1.4482989907264709e-02 3.9276111125946045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8176 8.7493062019348145e-03</internalNodes>
+          <leafValues>
+            -4.8551220446825027e-02 1.0460250079631805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8177 2.2463349625468254e-02</internalNodes>
+          <leafValues>
+            2.2396000102162361e-02 -1.3587850332260132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8178 1.8538760021328926e-02</internalNodes>
+          <leafValues>
+            3.0029479414224625e-02 -2.0861870050430298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8179 3.4236259758472443e-02</internalNodes>
+          <leafValues>
+            -1.0644080117344856e-02 1.6675490140914917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8180 4.0900480002164841e-02</internalNodes>
+          <leafValues>
+            -1.2056970037519932e-02 4.3773320317268372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8181 1.0512579977512360e-01</internalNodes>
+          <leafValues>
+            -9.4033451750874519e-04 7.8061622381210327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8182 7.4799366295337677e-02</internalNodes>
+          <leafValues>
+            7.8805796802043915e-03 -6.6342961788177490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8183 4.3973559513688087e-05</internalNodes>
+          <leafValues>
+            -5.8106150478124619e-02 1.0466519743204117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8184 6.6341059282422066e-03</internalNodes>
+          <leafValues>
+            1.9750369712710381e-02 -2.7033481001853943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8185 6.9901258684694767e-03</internalNodes>
+          <leafValues>
+            -3.2210368663072586e-02 5.6677810847759247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8186 -6.9424291141331196e-03</internalNodes>
+          <leafValues>
+            8.3492629230022430e-02 -6.4236722886562347e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8187 1.2524950504302979e-01</internalNodes>
+          <leafValues>
+            1.9679870456457138e-03 -8.7889492511749268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8188 -6.0555808246135712e-02</internalNodes>
+          <leafValues>
+            -6.5825527906417847e-01 7.3593561537563801e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8189 4.2092729359865189e-02</internalNodes>
+          <leafValues>
+            9.0475538745522499e-03 -3.7676310539245605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8190 1.6190059483051300e-02</internalNodes>
+          <leafValues>
+            1.4534840360283852e-02 -3.4089210629463196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8191 -2.6756960898637772e-02</internalNodes>
+          <leafValues>
+            1.6862440109252930e-01 -1.0768949985504150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8192 -5.1163539290428162e-02</internalNodes>
+          <leafValues>
+            -9.4068449735641479e-01 4.8503028228878975e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8193 -2.9093079268932343e-02</internalNodes>
+          <leafValues>
+            1.3051369786262512e-01 -2.7216060087084770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8194 -1.3433809578418732e-01</internalNodes>
+          <leafValues>
+            -5.3713047504425049e-01 1.0605730116367340e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8195 -4.0363678708672523e-03</internalNodes>
+          <leafValues>
+            -7.8597947955131531e-02 4.5609310269355774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8196 -1.6303880512714386e-01</internalNodes>
+          <leafValues>
+            6.9153147935867310e-01 -6.8249078467488289e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8197 5.3527228534221649e-02</internalNodes>
+          <leafValues>
+            -8.2422774285078049e-03 2.3649579286575317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8198 9.3209616839885712e-02</internalNodes>
+          <leafValues>
+            -7.0793349295854568e-03 6.3985627889633179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8199 -4.1583351790904999e-02</internalNodes>
+          <leafValues>
+            -4.0527749061584473e-01 1.1953369714319706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8200 1.5241269767284393e-01</internalNodes>
+          <leafValues>
+            -1.6016889363527298e-02 3.7084808945655823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8201 -1.3017480261623859e-02</internalNodes>
+          <leafValues>
+            -1.2366600334644318e-01 4.4537510722875595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8202 5.4946541786193848e-02</internalNodes>
+          <leafValues>
+            2.4852929636836052e-02 -2.1955069899559021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8203 3.0320021323859692e-04</internalNodes>
+          <leafValues>
+            -1.3367289304733276e-01 4.0226090699434280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8204 1.3891180045902729e-02</internalNodes>
+          <leafValues>
+            -2.6901820674538612e-02 1.9647410511970520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8205 1.0848880046978593e-03</internalNodes>
+          <leafValues>
+            3.6422070115804672e-02 -8.3430632948875427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8206 2.3160090204328299e-03</internalNodes>
+          <leafValues>
+            -6.1215829104185104e-02 1.1277849972248077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8207 -7.1280319243669510e-03</internalNodes>
+          <leafValues>
+            -1.4642429351806641e-01 3.1300168484449387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8208 -3.5769429523497820e-03</internalNodes>
+          <leafValues>
+            1.0159090161323547e-01 -6.0789510607719421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8209 7.6856701634824276e-03</internalNodes>
+          <leafValues>
+            4.2229469865560532e-02 -1.2583130598068237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8210 8.4121264517307281e-03</internalNodes>
+          <leafValues>
+            -4.6872619539499283e-02 1.3011389970779419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8211 7.5839929282665253e-02</internalNodes>
+          <leafValues>
+            -9.2988023534417152e-03 2.4260810017585754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8212 8.6365960305556655e-04</internalNodes>
+          <leafValues>
+            9.1133847832679749e-02 -6.1323560774326324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8213 -1.0632569901645184e-02</internalNodes>
+          <leafValues>
+            -6.7818403244018555e-02 1.9036499783396721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8214 -1.4120140112936497e-02</internalNodes>
+          <leafValues>
+            2.9123929142951965e-01 -1.7482239753007889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8215 2.0944620482623577e-03</internalNodes>
+          <leafValues>
+            -1.1744289845228195e-01 5.4129518568515778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8216 4.2378879152238369e-03</internalNodes>
+          <leafValues>
+            3.8495510816574097e-02 -1.4472819864749908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8217 -2.2818730212748051e-03</internalNodes>
+          <leafValues>
+            -1.1576230078935623e-01 2.7663499116897583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8218 9.4367301790043712e-04</internalNodes>
+          <leafValues>
+            -9.4088926911354065e-02 5.3373821079730988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8219 1.4890190213918686e-02</internalNodes>
+          <leafValues>
+            -1.1562420055270195e-02 1.0941980034112930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8220 5.2381302230060101e-03</internalNodes>
+          <leafValues>
+            3.5265430808067322e-02 -1.5212060511112213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8221 1.2663690140470862e-03</internalNodes>
+          <leafValues>
+            -3.3352568745613098e-02 7.9812049865722656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8222 -5.3786882199347019e-03</internalNodes>
+          <leafValues>
+            2.0934769511222839e-01 -2.4073069915175438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8223 -1.9063480431213975e-03</internalNodes>
+          <leafValues>
+            -2.0774979889392853e-01 2.5406830012798309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8224 3.0771149322390556e-03</internalNodes>
+          <leafValues>
+            -5.1940180361270905e-02 1.0475979745388031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8225 9.5619028434157372e-03</internalNodes>
+          <leafValues>
+            3.0633790418505669e-02 -1.0758169740438461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8226 2.0540829747915268e-02</internalNodes>
+          <leafValues>
+            -2.2028919309377670e-02 2.3570840060710907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8227 7.0854742079973221e-03</internalNodes>
+          <leafValues>
+            -4.7188248485326767e-02 8.4122747182846069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8228 -6.2047559767961502e-03</internalNodes>
+          <leafValues>
+            -1.2209820002317429e-01 4.5177329331636429e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8229 -2.3474119603633881e-02</internalNodes>
+          <leafValues>
+            -2.8770458698272705e-01 1.0876529850065708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8230 9.1368835419416428e-03</internalNodes>
+          <leafValues>
+            -3.3426750451326370e-02 2.0680120587348938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8231 1.0512090520933270e-03</internalNodes>
+          <leafValues>
+            4.7006800770759583e-02 -9.5018379390239716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8232 -6.0899247182533145e-04</internalNodes>
+          <leafValues>
+            5.3419198840856552e-02 -1.0444770008325577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8233 -7.4382261373102665e-03</internalNodes>
+          <leafValues>
+            -4.8089329153299332e-02 1.9244499504566193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8234 1.9495990127325058e-02</internalNodes>
+          <leafValues>
+            -3.0136700719594955e-02 2.0381480455398560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8235 7.7799506485462189e-02</internalNodes>
+          <leafValues>
+            4.2237630113959312e-03 -7.2407877445220947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8236 3.1717489473521709e-03</internalNodes>
+          <leafValues>
+            2.8818940743803978e-02 -1.6305699944496155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8237 -3.9012718945741653e-02</internalNodes>
+          <leafValues>
+            -2.9151159524917603e-01 1.1131940409541130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8238 -3.1845991034060717e-03</internalNodes>
+          <leafValues>
+            6.3072219491004944e-02 -7.7291563153266907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8239 1.7876720055937767e-02</internalNodes>
+          <leafValues>
+            5.1196590065956116e-02 -3.7885930389165878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8240 1.2821210548281670e-03</internalNodes>
+          <leafValues>
+            -5.7314708828926086e-02 8.7054982781410217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8241 1.0710550099611282e-01</internalNodes>
+          <leafValues>
+            -1.5561000443994999e-02 3.1525009870529175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8242 6.9577127695083618e-02</internalNodes>
+          <leafValues>
+            8.9664813131093979e-03 -5.8589607477188110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8243 -4.1071181185543537e-03</internalNodes>
+          <leafValues>
+            9.5472246408462524e-02 -3.5176470875740051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8244 -2.4557299911975861e-03</internalNodes>
+          <leafValues>
+            -1.6605280339717865e-01 3.7322919815778732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8245 -2.0908420905470848e-02</internalNodes>
+          <leafValues>
+            1.3989880681037903e-01 -2.9987450689077377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8246 -8.1008402630686760e-03</internalNodes>
+          <leafValues>
+            -1.0529220104217529e-01 7.0245787501335144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8247 -2.5671819224953651e-02</internalNodes>
+          <leafValues>
+            4.4254720211029053e-01 -1.1081459932029247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8248 -9.3759642913937569e-03</internalNodes>
+          <leafValues>
+            -6.0765031725168228e-02 8.1338323652744293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8249 5.1140699535608292e-02</internalNodes>
+          <leafValues>
+            -1.0516249574720860e-02 3.4041538834571838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8250 -4.0337219834327698e-03</internalNodes>
+          <leafValues>
+            8.5099473595619202e-02 -6.3421532511711121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8251 3.3258409239351749e-03</internalNodes>
+          <leafValues>
+            -8.4625139832496643e-02 4.7368369996547699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8252 -3.9332117885351181e-03</internalNodes>
+          <leafValues>
+            -1.2637099623680115e-01 4.2450599372386932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8253 -4.7937841154634953e-03</internalNodes>
+          <leafValues>
+            -4.2527411133050919e-02 2.5126809254288673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8254 2.5972370058298111e-03</internalNodes>
+          <leafValues>
+            4.1884120553731918e-02 -1.4374159276485443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8255 5.2807550877332687e-02</internalNodes>
+          <leafValues>
+            -1.2467020191252232e-02 4.0223389863967896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8256 -8.1413555890321732e-03</internalNodes>
+          <leafValues>
+            -1.2783770263195038e-01 3.8975879549980164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8257 2.9801739379763603e-02</internalNodes>
+          <leafValues>
+            -1.6747390851378441e-02 1.2424229830503464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8258 -8.9907720685005188e-02</internalNodes>
+          <leafValues>
+            3.1418469548225403e-01 -1.8360419198870659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8259 1.7845210433006287e-01</internalNodes>
+          <leafValues>
+            1.0455190204083920e-02 -3.2048919796943665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8260 1.8588220700621605e-02</internalNodes>
+          <leafValues>
+            -3.8541439920663834e-02 1.5135329961776733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8261 -4.5074601075612009e-05</internalNodes>
+          <leafValues>
+            5.0462849438190460e-02 -5.6574851274490356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8262 3.8339050952345133e-03</internalNodes>
+          <leafValues>
+            4.7501549124717712e-02 -1.4327140152454376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8263 8.8608250021934509e-02</internalNodes>
+          <leafValues>
+            -3.3567149657756090e-03 5.8598208427429199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8264 -7.0611469447612762e-02</internalNodes>
+          <leafValues>
+            6.0292667150497437e-01 -8.3463769406080246e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8265 -1.3958199322223663e-01</internalNodes>
+          <leafValues>
+            -9.1693513095378876e-02 1.5311989933252335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8266 7.6274941675364971e-03</internalNodes>
+          <leafValues>
+            -4.0825009346008301e-02 1.1937720328569412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8267 -7.0419587194919586e-02</internalNodes>
+          <leafValues>
+            -6.6531497240066528e-01 2.6815559249371290e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8268 2.2952680010348558e-03</internalNodes>
+          <leafValues>
+            -7.9496517777442932e-02 5.7034268975257874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8269 3.6756680347025394e-03</internalNodes>
+          <leafValues>
+            -2.9180280864238739e-02 5.6333038955926895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8270 4.6072501689195633e-02</internalNodes>
+          <leafValues>
+            1.9100179895758629e-02 -2.9163768887519836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8271 2.1738489158451557e-03</internalNodes>
+          <leafValues>
+            -2.6912130415439606e-02 2.0199960470199585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8272 -5.3164511919021606e-03</internalNodes>
+          <leafValues>
+            9.3022979795932770e-02 -7.1548640727996826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8273 -1.1198960244655609e-02</internalNodes>
+          <leafValues>
+            -1.0618919879198074e-01 4.8395581543445587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8274 1.7013610340654850e-03</internalNodes>
+          <leafValues>
+            -1.3111209869384766e-01 4.3086219578981400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8275 -1.1626269668340683e-02</internalNodes>
+          <leafValues>
+            1.5684530138969421e-01 -2.4698950350284576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8276 9.3881830573081970e-02</internalNodes>
+          <leafValues>
+            -1.2058589607477188e-02 3.7941938638687134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8277 1.2041090056300163e-02</internalNodes>
+          <leafValues>
+            2.9569109901785851e-02 -1.3328549265861511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8278 -4.1863098740577698e-03</internalNodes>
+          <leafValues>
+            6.7244023084640503e-02 -7.2228990495204926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8279 8.8373906910419464e-02</internalNodes>
+          <leafValues>
+            7.5915241613984108e-03 -6.2512797117233276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8280 -1.4876410365104675e-02</internalNodes>
+          <leafValues>
+            1.1762090027332306e-01 -4.3840218335390091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8281 1.3433529995381832e-02</internalNodes>
+          <leafValues>
+            1.9615789875388145e-02 -1.1923760175704956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8282 1.5091040730476379e-01</internalNodes>
+          <leafValues>
+            -9.9040074273943901e-03 5.6262481212615967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8283 -1.7507839947938919e-02</internalNodes>
+          <leafValues>
+            -2.3439739644527435e-01 1.8828360363841057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8284 -1.4707089960575104e-01</internalNodes>
+          <leafValues>
+            -7.4530661106109619e-01 7.0233740843832493e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8285 3.1485889106988907e-02</internalNodes>
+          <leafValues>
+            -3.6193220876157284e-03 6.9215708971023560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8286 -1.6217399388551712e-04</internalNodes>
+          <leafValues>
+            4.6460039913654327e-02 -1.0642550140619278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8287 5.6881760247051716e-04</internalNodes>
+          <leafValues>
+            -2.8816150501370430e-02 7.4378728866577148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8288 -1.9876200705766678e-02</internalNodes>
+          <leafValues>
+            -2.0997400581836700e-01 2.3018810898065567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8289 -8.7401196360588074e-03</internalNodes>
+          <leafValues>
+            1.7325100302696228e-01 -3.5786859691143036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8290 -5.0579208880662918e-02</internalNodes>
+          <leafValues>
+            -5.2024918794631958e-01 9.2388605698943138e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8291 9.3982152640819550e-02</internalNodes>
+          <leafValues>
+            3.4048059023916721e-03 -2.9207429289817810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8292 -1.3326539658010006e-02</internalNodes>
+          <leafValues>
+            1.3661830127239227e-01 -3.4405559301376343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8293 -2.2472620010375977e-02</internalNodes>
+          <leafValues>
+            -2.5913679599761963e-01 1.1266170069575310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8294 -4.1125040501356125e-02</internalNodes>
+          <leafValues>
+            -6.6921561956405640e-01 7.3854308575391769e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8295 6.9720767438411713e-02</internalNodes>
+          <leafValues>
+            5.0764488987624645e-03 -2.4747189879417419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8296 2.5198599323630333e-02</internalNodes>
+          <leafValues>
+            -1.5660049393773079e-02 2.9408401250839233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8297 4.2568319477140903e-03</internalNodes>
+          <leafValues>
+            3.8112118840217590e-02 -1.2368690222501755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8298 -1.2679009698331356e-02</internalNodes>
+          <leafValues>
+            -1.9976189732551575e-01 2.8806639835238457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8299 -1.6080659627914429e-01</internalNodes>
+          <leafValues>
+            1.8710459768772125e-01 -8.2025080919265747e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8300 1.2181399762630463e-01</internalNodes>
+          <leafValues>
+            -1.0855929926037788e-02 4.5412290096282959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8301 2.8687159065157175e-03</internalNodes>
+          <leafValues>
+            -9.8563097417354584e-03 1.9689890742301941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8302 -3.4924471401609480e-04</internalNodes>
+          <leafValues>
+            4.7955259680747986e-02 -1.2549050152301788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8303 4.3789181858301163e-02</internalNodes>
+          <leafValues>
+            5.1197651773691177e-03 -6.6044712066650391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8304 4.9425449222326279e-02</internalNodes>
+          <leafValues>
+            7.9704420641064644e-03 -5.1537191867828369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8305 1.2263789772987366e-02</internalNodes>
+          <leafValues>
+            9.8127601668238640e-03 -1.6274920105934143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8306 -6.7564379423856735e-03</internalNodes>
+          <leafValues>
+            -6.6992767155170441e-02 7.8426092863082886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8307 1.9599240273237228e-02</internalNodes>
+          <leafValues>
+            -2.4508479982614517e-02 1.7892380058765411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8308 1.3520059874281287e-03</internalNodes>
+          <leafValues>
+            -7.5853422284126282e-02 5.7282470166683197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8309 5.1610758528113365e-03</internalNodes>
+          <leafValues>
+            5.0592619925737381e-02 -9.6658922731876373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8310 2.7124589309096336e-02</internalNodes>
+          <leafValues>
+            -1.3078499585390091e-02 3.3894819021224976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8311 -7.3659062385559082e-02</internalNodes>
+          <leafValues>
+            -9.0775561332702637e-01 5.3760888986289501e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8312 -2.7619479224085808e-03</internalNodes>
+          <leafValues>
+            1.3446320593357086e-01 -3.4483309835195541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8313 -1.5638889744877815e-03</internalNodes>
+          <leafValues>
+            -1.9992120563983917e-01 1.4003699645400047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8314 4.0559601038694382e-03</internalNodes>
+          <leafValues>
+            5.3183209151029587e-02 -1.0070829838514328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8315 -3.2189621124416590e-03</internalNodes>
+          <leafValues>
+            6.2624312937259674e-02 -3.0276089906692505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8316 4.1666622273623943e-03</internalNodes>
+          <leafValues>
+            -9.1761156916618347e-02 5.8400500565767288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8317 2.0393060520291328e-02</internalNodes>
+          <leafValues>
+            4.8048538155853748e-03 -3.8386350870132446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8318 -9.9844802170991898e-03</internalNodes>
+          <leafValues>
+            -6.9473296403884888e-02 7.0034191012382507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8319 1.9515320658683777e-02</internalNodes>
+          <leafValues>
+            -3.4106500446796417e-02 1.0831409692764282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8320 8.7807718664407730e-03</internalNodes>
+          <leafValues>
+            3.6990050226449966e-02 -1.3089330494403839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8321 1.7314519500359893e-03</internalNodes>
+          <leafValues>
+            -4.2123470455408096e-02 8.4982097148895264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8322 -2.6709519326686859e-02</internalNodes>
+          <leafValues>
+            3.2326829433441162e-01 -1.5427160076797009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8323 7.8696580603718758e-03</internalNodes>
+          <leafValues>
+            3.1361158937215805e-02 -1.0568609833717346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8324 3.2152980566024780e-03</internalNodes>
+          <leafValues>
+            -6.5161801874637604e-02 7.6189488172531128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8325 -2.3215120658278465e-02</internalNodes>
+          <leafValues>
+            2.2522650659084320e-01 -1.4838770031929016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8326 -4.4935368932783604e-03</internalNodes>
+          <leafValues>
+            -1.3131460547447205e-01 4.2855940759181976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8327 -1.1850389651954174e-02</internalNodes>
+          <leafValues>
+            1.4825740456581116e-01 -2.9456850141286850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8328 -9.3039282364770770e-04</internalNodes>
+          <leafValues>
+            7.9329937696456909e-02 -7.5784526765346527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8329 -7.2138011455535889e-04</internalNodes>
+          <leafValues>
+            2.2042410448193550e-02 -2.0893280208110809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8330 1.3078770041465759e-01</internalNodes>
+          <leafValues>
+            -1.2214420363306999e-02 4.3224608898162842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8331 2.7863389253616333e-01</internalNodes>
+          <leafValues>
+            -7.4468360980972648e-04 9.9999761581420898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8332 -4.0815200656652451e-02</internalNodes>
+          <leafValues>
+            -6.1310279369354248e-01 8.2405265420675278e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8333 1.5054940013214946e-03</internalNodes>
+          <leafValues>
+            -1.8053399398922920e-02 6.5230727195739746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8334 6.5729310736060143e-03</internalNodes>
+          <leafValues>
+            3.0967630445957184e-02 -1.5021359920501709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8335 -1.4033170044422150e-01</internalNodes>
+          <leafValues>
+            -4.4641208648681641e-01 5.0997259095311165e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8336 -1.2781560420989990e-02</internalNodes>
+          <leafValues>
+            1.2579609453678131e-01 -4.6258769929409027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8337 1.3383819721639156e-02</internalNodes>
+          <leafValues>
+            7.5233832001686096e-02 -2.9858419671654701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8338 9.5225386321544647e-03</internalNodes>
+          <leafValues>
+            -4.4135529547929764e-02 1.0822969675064087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8339 -7.2484686970710754e-02</internalNodes>
+          <leafValues>
+            -1. 1.3005880173295736e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8340 3.6246789386495948e-04</internalNodes>
+          <leafValues>
+            -6.6878542304039001e-02 7.3916479945182800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8341 -1.5511980280280113e-02</internalNodes>
+          <leafValues>
+            -1.8414540588855743e-01 1.5999039635062218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8342 5.1146611571311951e-02</internalNodes>
+          <leafValues>
+            -9.4361994415521622e-03 5.4720860719680786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8343 -8.9448272774461657e-05</internalNodes>
+          <leafValues>
+            3.2970890402793884e-02 -4.5103389769792557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8344 1.0151580208912492e-03</internalNodes>
+          <leafValues>
+            4.8603180795907974e-02 -9.8257049918174744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8345 5.3570970892906189e-02</internalNodes>
+          <leafValues>
+            1.0325700044631958e-02 -1.4304420351982117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8346 1.2302629649639130e-01</internalNodes>
+          <leafValues>
+            -5.2219899371266365e-03 8.6903452873229980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8347 -6.0005468549206853e-04</internalNodes>
+          <leafValues>
+            5.3572040051221848e-02 -5.8203268796205521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8348 -4.4715698808431625e-02</internalNodes>
+          <leafValues>
+            4.4988310337066650e-01 -1.0549419559538364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8349 6.3781379722058773e-03</internalNodes>
+          <leafValues>
+            2.6184290647506714e-02 -1.0640030354261398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8350 -5.6618300732225180e-04</internalNodes>
+          <leafValues>
+            5.7264849543571472e-02 -7.7750243246555328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8351 -1.5853339573368430e-04</internalNodes>
+          <leafValues>
+            2.5316949933767319e-02 -5.7189941406250000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8352 -4.9790769815444946e-02</internalNodes>
+          <leafValues>
+            -3.7127709388732910e-01 1.3125170022249222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8353 -1.0477020405232906e-02</internalNodes>
+          <leafValues>
+            8.4245949983596802e-02 -3.6731608211994171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8354 -9.0497080236673355e-03</internalNodes>
+          <leafValues>
+            -1.6894440352916718e-01 2.8471369296312332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8355 -3.5202078521251678e-02</internalNodes>
+          <leafValues>
+            -4.3810841441154480e-01 5.8491500094532967e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8356 -2.0730090327560902e-03</internalNodes>
+          <leafValues>
+            9.4890840351581573e-02 -5.3059589117765427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8357 -5.0727208144962788e-03</internalNodes>
+          <leafValues>
+            -1.1221739649772644e-01 4.4165991246700287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8358 2.5876651052385569e-03</internalNodes>
+          <leafValues>
+            -5.5557820945978165e-02 1.1426319926977158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8359 -2.4757650680840015e-03</internalNodes>
+          <leafValues>
+            -4.8213180154561996e-02 3.1529899686574936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8360 -1.2912530452013016e-02</internalNodes>
+          <leafValues>
+            1.1486659944057465e-01 -3.8589760661125183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8361 7.0194348692893982e-02</internalNodes>
+          <leafValues>
+            3.5798270255327225e-03 -7.3008167743682861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8362 -1.2016300112009048e-01</internalNodes>
+          <leafValues>
+            -6.7217922210693359e-01 5.8088749647140503e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8363 1.3109490275382996e-01</internalNodes>
+          <leafValues>
+            1.5340699814260006e-02 -1.2917870283126831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8364 -1.1350499838590622e-01</internalNodes>
+          <leafValues>
+            4.7297981381416321e-01 -1.0574280284345150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8365 -7.1533523499965668e-02</internalNodes>
+          <leafValues>
+            -3.4910291433334351e-01 9.8157208412885666e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8366 1.5889670699834824e-02</internalNodes>
+          <leafValues>
+            -3.0149290338158607e-02 1.5134809911251068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8367 2.6840370893478394e-01</internalNodes>
+          <leafValues>
+            9.9974423646926880e-03 -1.2243749946355820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8368 -1.4922569692134857e-01</internalNodes>
+          <leafValues>
+            -1.5773139894008636e-01 2.7682509273290634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8369 -2.2858489304780960e-02</internalNodes>
+          <leafValues>
+            1.7340719699859619e-01 -2.1124770864844322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8370 -9.0983451809734106e-04</internalNodes>
+          <leafValues>
+            5.5269908159971237e-02 -8.5052981972694397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8371 -1.1462160386145115e-02</internalNodes>
+          <leafValues>
+            -1.4397600293159485e-01 1.3809709809720516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8372 8.7118431925773621e-02</internalNodes>
+          <leafValues>
+            6.4688520506024361e-03 -7.2809070348739624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8373 5.3810589015483856e-02</internalNodes>
+          <leafValues>
+            -2.8251519426703453e-02 1.3615800440311432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8374 -1.6928049735724926e-03</internalNodes>
+          <leafValues>
+            -1.0114800184965134e-01 5.2096601575613022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8375 -1.4526920393109322e-02</internalNodes>
+          <leafValues>
+            -1.0613209754228592e-01 2.7218030765652657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8376 -5.9082340449094772e-03</internalNodes>
+          <leafValues>
+            1.1257000267505646e-01 -6.1032701283693314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8377 -2.1421469748020172e-02</internalNodes>
+          <leafValues>
+            -1.5464189648628235e-01 1.1853870004415512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8378 8.0171570181846619e-02</internalNodes>
+          <leafValues>
+            5.5826799944043159e-03 -8.2389092445373535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8379 -1.0931739816442132e-03</internalNodes>
+          <leafValues>
+            -7.8393906354904175e-02 1.3433099724352360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8380 4.1605130536481738e-04</internalNodes>
+          <leafValues>
+            -4.3186139315366745e-02 1.0500840097665787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8381 -2.8376420959830284e-03</internalNodes>
+          <leafValues>
+            7.8960210084915161e-02 -4.2247280478477478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8382 -2.8522519394755363e-02</internalNodes>
+          <leafValues>
+            -1.0722970217466354e-01 4.7789189964532852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8383 4.0068081021308899e-01</internalNodes>
+          <leafValues>
+            -5.7991011999547482e-03 3.0695509910583496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8384 -8.1703867763280869e-03</internalNodes>
+          <leafValues>
+            1.0851760208606720e-01 -5.6153468787670135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8385 9.3125440180301666e-03</internalNodes>
+          <leafValues>
+            -4.4560939073562622e-02 4.3634049594402313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8386 5.8274720795452595e-03</internalNodes>
+          <leafValues>
+            3.1310841441154480e-02 -1.6053420305252075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8387 -2.9063750989735126e-03</internalNodes>
+          <leafValues>
+            3.7148229777812958e-02 -2.7310580015182495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8388 1.6421969980001450e-02</internalNodes>
+          <leafValues>
+            -3.1616371124982834e-02 1.6195470094680786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8389 -1.3876060023903847e-02</internalNodes>
+          <leafValues>
+            -1.7840880155563354e-01 2.6925239711999893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8390 -2.9935980215668678e-02</internalNodes>
+          <leafValues>
+            2.0069709420204163e-01 -2.7372730895876884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8391 8.1381313502788544e-03</internalNodes>
+          <leafValues>
+            4.0951769798994064e-02 -7.4756972491741180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8392 -5.8591389097273350e-03</internalNodes>
+          <leafValues>
+            -1.2337020039558411e-01 3.9641879498958588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8393 7.1592196822166443e-02</internalNodes>
+          <leafValues>
+            -1.0293760336935520e-02 2.2391259670257568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8394 5.0111521035432816e-02</internalNodes>
+          <leafValues>
+            2.4072999134659767e-02 -2.1443809568881989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8395 4.2603579349815845e-03</internalNodes>
+          <leafValues>
+            -2.3712050169706345e-02 7.3603406548500061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8396 6.5065422095358372e-03</internalNodes>
+          <leafValues>
+            -6.7402780055999756e-02 7.6926141977310181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8397 2.0325470250099897e-03</internalNodes>
+          <leafValues>
+            -9.9664673209190369e-02 5.7994231581687927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8398 -9.3465158715844154e-03</internalNodes>
+          <leafValues>
+            1.9432920217514038e-01 -3.1387709081172943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8399 9.5768114551901817e-03</internalNodes>
+          <leafValues>
+            2.2594990208745003e-02 -1.6090850532054901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8400 -4.6763911843299866e-02</internalNodes>
+          <leafValues>
+            -3.5020270943641663e-01 1.5035149641335011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8401 -5.0164870917797089e-02</internalNodes>
+          <leafValues>
+            1.2763389945030212e-01 -1.1035620234906673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8402 2.3148149251937866e-02</internalNodes>
+          <leafValues>
+            -2.4636579677462578e-02 2.0264349877834320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8403 -7.4168562889099121e-02</internalNodes>
+          <leafValues>
+            -9.4854289293289185e-01 2.2216918878257275e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8404 -2.0698629319667816e-02</internalNodes>
+          <leafValues>
+            -2.4585549533367157e-01 2.1370820701122284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8405 -5.8187540620565414e-02</internalNodes>
+          <leafValues>
+            3.0531001091003418e-01 -8.1265745684504509e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8406 -5.2451588213443756e-02</internalNodes>
+          <leafValues>
+            5.0567781925201416e-01 -9.7108660265803337e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8407 -4.6721640974283218e-02</internalNodes>
+          <leafValues>
+            8.0896109342575073e-01 -1.8908439669758081e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8408 -1.0385509580373764e-02</internalNodes>
+          <leafValues>
+            -2.8369909524917603e-01 1.9166229292750359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8409 5.4432367905974388e-03</internalNodes>
+          <leafValues>
+            4.1430719196796417e-02 -1.6033279895782471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8410 2.4030160158872604e-02</internalNodes>
+          <leafValues>
+            -4.3751548975706100e-02 1.0553020238876343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8411 -2.6430420577526093e-02</internalNodes>
+          <leafValues>
+            -8.7448269128799438e-02 2.8769830241799355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8412 4.8743681982159615e-03</internalNodes>
+          <leafValues>
+            3.5032961517572403e-02 -1.5881679952144623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8413 -2.5106489192694426e-03</internalNodes>
+          <leafValues>
+            8.8161677122116089e-02 -3.0205590650439262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8414 -5.2146320231258869e-03</internalNodes>
+          <leafValues>
+            -1.1350130289793015e-01 4.2001061141490936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8415 -1.0986009612679482e-02</internalNodes>
+          <leafValues>
+            8.4428779780864716e-02 -3.8272839039564133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8416 -6.0057129710912704e-02</internalNodes>
+          <leafValues>
+            -7.9249101877212524e-01 5.2951448597013950e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8417 1.3621809892356396e-02</internalNodes>
+          <leafValues>
+            -1.7419820651412010e-02 2.1612060070037842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8418 -2.2223800420761108e-02</internalNodes>
+          <leafValues>
+            2.6721641421318054e-01 -2.0207190886139870e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8419 5.8124359697103500e-02</internalNodes>
+          <leafValues>
+            6.0539757832884789e-03 -4.0927109122276306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8420 -2.8097970411181450e-02</internalNodes>
+          <leafValues>
+            -1.1217900365591049e-01 5.4144639521837234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8421 6.5278373658657074e-02</internalNodes>
+          <leafValues>
+            -7.4973162263631821e-03 1.2384270131587982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8422 -2.5233640335500240e-03</internalNodes>
+          <leafValues>
+            -1.8224379420280457e-01 2.4537850171327591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8423 1.1478599905967712e-01</internalNodes>
+          <leafValues>
+            1.9617579877376556e-02 -1.1905120313167572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8424 9.6991509199142456e-03</internalNodes>
+          <leafValues>
+            -5.3946550935506821e-02 1.1180210113525391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8425 2.9359150677919388e-02</internalNodes>
+          <leafValues>
+            -2.3395609110593796e-02 1.8534250557422638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8426 7.8490097075700760e-03</internalNodes>
+          <leafValues>
+            1.6454109549522400e-01 -4.2129490524530411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8427 4.0329899638891220e-03</internalNodes>
+          <leafValues>
+            2.4495590478181839e-02 -6.5955489873886108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8428 2.1471390128135681e-01</internalNodes>
+          <leafValues>
+            -1.0462880134582520e-02 4.7438031435012817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8429 -2.2316209506243467e-03</internalNodes>
+          <leafValues>
+            4.9796439707279205e-02 -1.0328280180692673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8430 2.1833330392837524e-02</internalNodes>
+          <leafValues>
+            -5.3884848952293396e-02 9.3277551233768463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8431 2.4430779740214348e-02</internalNodes>
+          <leafValues>
+            1.5706099569797516e-02 -2.8244438767433167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8432 1.2532520107924938e-02</internalNodes>
+          <leafValues>
+            -3.0983900651335716e-02 1.5599699318408966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8433 7.9741179943084717e-03</internalNodes>
+          <leafValues>
+            2.6650540530681610e-02 -1.3689580559730530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8434 7.9444557428359985e-02</internalNodes>
+          <leafValues>
+            6.4238710328936577e-03 -7.8485661745071411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8435 -1.7925030551850796e-03</internalNodes>
+          <leafValues>
+            3.9645589888095856e-02 -1.1497259885072708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8436 -9.0927572455257177e-04</internalNodes>
+          <leafValues>
+            6.3256889581680298e-02 -7.5250372290611267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8437 -2.6040049269795418e-02</internalNodes>
+          <leafValues>
+            1.4864259958267212e-01 -1.8506240099668503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8438 4.1452320292592049e-03</internalNodes>
+          <leafValues>
+            3.3959619700908661e-02 -1.4355990290641785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8439 5.7123368605971336e-04</internalNodes>
+          <leafValues>
+            -6.8550966680049896e-02 6.9944731891155243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8440 -4.9577720463275909e-02</internalNodes>
+          <leafValues>
+            3.9880838990211487e-01 -1.1339910328388214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8441 -1.5334860421717167e-02</internalNodes>
+          <leafValues>
+            -8.3445623517036438e-02 3.2276369631290436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8442 -1.7406089231371880e-02</internalNodes>
+          <leafValues>
+            1.3560940325260162e-01 -3.1945578753948212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8443 -2.1422259509563446e-02</internalNodes>
+          <leafValues>
+            -1.1050239950418472e-01 2.8536040335893631e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8444 1.9694769289344549e-03</internalNodes>
+          <leafValues>
+            4.3834108859300613e-02 -1.0551860183477402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8445 -1.9115379080176353e-02</internalNodes>
+          <leafValues>
+            1.4690290391445160e-01 -1.5405310317873955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8446 4.6963259577751160e-02</internalNodes>
+          <leafValues>
+            8.1654358655214310e-03 -5.8734887838363647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8447 2.0964320003986359e-01</internalNodes>
+          <leafValues>
+            3.1721789855509996e-03 -8.0437898635864258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8448 6.2511406838893890e-02</internalNodes>
+          <leafValues>
+            -1.6422789543867111e-02 3.0976039171218872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8449 -1.0126180201768875e-01</internalNodes>
+          <leafValues>
+            -6.1639147996902466e-01 7.2699659503996372e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8450 3.3980670850723982e-03</internalNodes>
+          <leafValues>
+            -1.9664889201521873e-02 2.2541929781436920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8451 -1.7059950157999992e-02</internalNodes>
+          <leafValues>
+            -1.7193520441651344e-02 6.9114550948143005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8452 3.7455849815160036e-03</internalNodes>
+          <leafValues>
+            5.1737461239099503e-02 -8.2748822867870331e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8453 8.7769806385040283e-02</internalNodes>
+          <leafValues>
+            -6.3681108877062798e-03 7.9492002725601196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8454 2.3725361097604036e-03</internalNodes>
+          <leafValues>
+            -3.0487439036369324e-01 1.4520769938826561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8455 -1.9282909110188484e-02</internalNodes>
+          <leafValues>
+            1.8806980550289154e-01 -1.3220929540693760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8456 3.8580079562962055e-03</internalNodes>
+          <leafValues>
+            3.3978439867496490e-02 -1.2854169309139252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8457 2.6525680441409349e-03</internalNodes>
+          <leafValues>
+            -3.9146900177001953e-02 9.9119357764720917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8458 9.9175602197647095e-02</internalNodes>
+          <leafValues>
+            5.0618657842278481e-03 -8.7370461225509644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8459 -7.0648840628564358e-03</internalNodes>
+          <leafValues>
+            8.5219286382198334e-02 -2.4467790499329567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8460 -5.2547529339790344e-03</internalNodes>
+          <leafValues>
+            -1.2158469855785370e-01 3.7228528410196304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8461 5.0068609416484833e-03</internalNodes>
+          <leafValues>
+            -3.5557191818952560e-02 7.8515462577342987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8462 -6.8118162453174591e-02</internalNodes>
+          <leafValues>
+            -2.6292499899864197e-01 1.8325960263609886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8463 9.3348289374262094e-04</internalNodes>
+          <leafValues>
+            -3.0107179656624794e-02 4.4869720935821533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8464 -2.1996269933879375e-03</internalNodes>
+          <leafValues>
+            1.1136700212955475e-01 -6.6201932728290558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8465 -6.6485330462455750e-03</internalNodes>
+          <leafValues>
+            -7.8398697078227997e-02 2.0472070202231407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8466 1.4126920141279697e-03</internalNodes>
+          <leafValues>
+            -5.2428670227527618e-02 8.9471399784088135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8467 5.1406599581241608e-02</internalNodes>
+          <leafValues>
+            -1.4306739903986454e-03 6.3885271549224854e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          2 7 14 4 -1.</_>
+        <_>
+          2 9 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 4 -1.</_>
+        <_>
+          7 2 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 5 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 9 -1.</_>
+        <_>
+          3 9 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 5 -1.</_>
+        <_>
+          7 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 8 -1.</_>
+        <_>
+          4 10 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          12 5 3 5 2.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 9 -1.</_>
+        <_>
+          4 3 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 8 -1.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 10 -1.</_>
+        <_>
+          4 5 5 5 2.</_>
+        <_>
+          9 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 12 -1.</_>
+        <_>
+          3 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 9 -1.</_>
+        <_>
+          5 6 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 12 -1.</_>
+        <_>
+          8 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 5 -1.</_>
+        <_>
+          8 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 2 4 4 2.</_>
+        <_>
+          5 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 8 -1.</_>
+        <_>
+          13 12 5 4 2.</_>
+        <_>
+          8 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 10 -1.</_>
+        <_>
+          4 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 10 -1.</_>
+        <_>
+          0 9 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 9 -1.</_>
+        <_>
+          3 3 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 11 -1.</_>
+        <_>
+          10 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 11 -1.</_>
+        <_>
+          8 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 8 -1.</_>
+        <_>
+          10 6 6 4 2.</_>
+        <_>
+          4 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 7 -1.</_>
+        <_>
+          11 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 7 -1.</_>
+        <_>
+          7 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          6 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 7 -1.</_>
+        <_>
+          9 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 5 9 -1.</_>
+        <_>
+          11 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 8 -1.</_>
+        <_>
+          4 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 8 -1.</_>
+        <_>
+          9 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 6 -1.</_>
+        <_>
+          4 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 5 -1.</_>
+        <_>
+          12 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 17 2 -1.</_>
+        <_>
+          3 3 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 8 -1.</_>
+        <_>
+          5 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 9 -1.</_>
+        <_>
+          14 3 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 5 -1.</_>
+        <_>
+          6 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 9 -1.</_>
+        <_>
+          15 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 9 -1.</_>
+        <_>
+          3 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 12 -1.</_>
+        <_>
+          8 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 4 -1.</_>
+        <_>
+          2 13 8 2 2.</_>
+        <_>
+          10 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 6 -1.</_>
+        <_>
+          0 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 19 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 17 3 -1.</_>
+        <_>
+          3 2 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 7 -1.</_>
+        <_>
+          8 5 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 4 -1.</_>
+        <_>
+          0 4 7 2 2.</_>
+        <_>
+          7 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 9 -1.</_>
+        <_>
+          4 14 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 16 -1.</_>
+        <_>
+          3 2 7 8 2.</_>
+        <_>
+          10 10 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 16 -1.</_>
+        <_>
+          3 1 5 8 2.</_>
+        <_>
+          8 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 2 -1.</_>
+        <_>
+          1 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 4 -1.</_>
+        <_>
+          2 12 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          9 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 9 -1.</_>
+        <_>
+          5 6 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 8 12 -1.</_>
+        <_>
+          10 10 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 3 -1.</_>
+        <_>
+          2 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 9 12 -1.</_>
+        <_>
+          10 10 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 8 -1.</_>
+        <_>
+          4 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 12 -1.</_>
+        <_>
+          9 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 18 -1.</_>
+        <_>
+          4 0 3 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 13 2 -1.</_>
+        <_>
+          5 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          10 0 4 6 2.</_>
+        <_>
+          6 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 10 -1.</_>
+        <_>
+          2 1 3 5 2.</_>
+        <_>
+          5 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 6 -1.</_>
+        <_>
+          5 7 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 5 9 -1.</_>
+        <_>
+          2 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 6 -1.</_>
+        <_>
+          14 8 5 3 2.</_>
+        <_>
+          9 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 10 -1.</_>
+        <_>
+          5 6 5 5 2.</_>
+        <_>
+          10 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 4 -1.</_>
+        <_>
+          7 6 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 16 4 -1.</_>
+        <_>
+          1 10 8 2 2.</_>
+        <_>
+          9 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 17 -1.</_>
+        <_>
+          7 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 16 -1.</_>
+        <_>
+          11 4 2 8 2.</_>
+        <_>
+          9 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          2 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 13 -1.</_>
+        <_>
+          15 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 18 -1.</_>
+        <_>
+          6 1 3 9 2.</_>
+        <_>
+          9 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 13 -1.</_>
+        <_>
+          15 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 14 -1.</_>
+        <_>
+          6 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 13 -1.</_>
+        <_>
+          14 2 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 3 -1.</_>
+        <_>
+          7 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 11 8 -1.</_>
+        <_>
+          5 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 7 4 -1.</_>
+        <_>
+          11 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 20 -1.</_>
+        <_>
+          7 0 6 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 9 -1.</_>
+        <_>
+          5 6 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 11 -1.</_>
+        <_>
+          14 3 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 10 -1.</_>
+        <_>
+          3 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 19 -1.</_>
+        <_>
+          8 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 19 -1.</_>
+        <_>
+          6 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 16 -1.</_>
+        <_>
+          8 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 12 -1.</_>
+        <_>
+          9 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 12 -1.</_>
+        <_>
+          6 6 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 13 -1.</_>
+        <_>
+          9 7 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 7 6 -1.</_>
+        <_>
+          0 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 19 3 -1.</_>
+        <_>
+          1 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 14 -1.</_>
+        <_>
+          6 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 6 -1.</_>
+        <_>
+          15 3 5 3 2.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 9 12 -1.</_>
+        <_>
+          10 10 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 8 4 -1.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 8 6 -1.</_>
+        <_>
+          11 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 13 2 -1.</_>
+        <_>
+          2 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          10 14 7 2 2.</_>
+        <_>
+          3 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 9 -1.</_>
+        <_>
+          3 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 2 -1.</_>
+        <_>
+          5 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 7 9 -1.</_>
+        <_>
+          3 3 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 5 -1.</_>
+        <_>
+          8 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 7 4 -1.</_>
+        <_>
+          11 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 15 -1.</_>
+        <_>
+          2 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 6 -1.</_>
+        <_>
+          10 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 6 -1.</_>
+        <_>
+          5 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 12 -1.</_>
+        <_>
+          0 1 7 6 2.</_>
+        <_>
+          7 7 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 9 -1.</_>
+        <_>
+          10 13 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 9 -1.</_>
+        <_>
+          0 13 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 10 -1.</_>
+        <_>
+          10 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 14 -1.</_>
+        <_>
+          9 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 3 -1.</_>
+        <_>
+          8 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 4 -1.</_>
+        <_>
+          6 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 11 -1.</_>
+        <_>
+          15 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 18 -1.</_>
+        <_>
+          7 0 2 9 2.</_>
+        <_>
+          9 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 18 -1.</_>
+        <_>
+          16 2 4 9 2.</_>
+        <_>
+          12 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 18 -1.</_>
+        <_>
+          4 2 6 9 2.</_>
+        <_>
+          10 11 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 6 -1.</_>
+        <_>
+          4 9 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 4 -1.</_>
+        <_>
+          0 9 9 2 2.</_>
+        <_>
+          9 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_>
+        <_>
+          2 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 11 -1.</_>
+        <_>
+          3 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 15 -1.</_>
+        <_>
+          16 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          3 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 15 3 -1.</_>
+        <_>
+          7 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 8 -1.</_>
+        <_>
+          3 13 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 6 -1.</_>
+        <_>
+          3 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 8 -1.</_>
+        <_>
+          5 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 8 -1.</_>
+        <_>
+          10 5 10 4 2.</_>
+        <_>
+          0 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 16 8 -1.</_>
+        <_>
+          0 9 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 15 5 -1.</_>
+        <_>
+          7 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 12 -1.</_>
+        <_>
+          10 8 4 6 2.</_>
+        <_>
+          6 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 7 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 8 -1.</_>
+        <_>
+          10 0 10 4 2.</_>
+        <_>
+          0 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 5 9 -1.</_>
+        <_>
+          5 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 7 4 -1.</_>
+        <_>
+          1 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 6 -1.</_>
+        <_>
+          11 10 6 3 2.</_>
+        <_>
+          5 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 4 -1.</_>
+        <_>
+          5 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 5 -1.</_>
+        <_>
+          9 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 19 -1.</_>
+        <_>
+          8 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 6 -1.</_>
+        <_>
+          0 3 5 3 2.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 8 -1.</_>
+        <_>
+          6 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 6 -1.</_>
+        <_>
+          7 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 8 -1.</_>
+        <_>
+          4 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 6 -1.</_>
+        <_>
+          2 7 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 12 -1.</_>
+        <_>
+          5 7 5 6 2.</_>
+        <_>
+          10 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 3 -1.</_>
+        <_>
+          6 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 6 -1.</_>
+        <_>
+          11 10 8 3 2.</_>
+        <_>
+          3 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          3 8 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 15 -1.</_>
+        <_>
+          0 10 20 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 9 -1.</_>
+        <_>
+          3 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 5 -1.</_>
+        <_>
+          10 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 5 -1.</_>
+        <_>
+          7 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 9 -1.</_>
+        <_>
+          15 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 7 -1.</_>
+        <_>
+          3 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 12 -1.</_>
+        <_>
+          2 11 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 6 -1.</_>
+        <_>
+          3 3 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 18 -1.</_>
+        <_>
+          10 2 5 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 17 -1.</_>
+        <_>
+          5 3 5 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          10 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 9 -1.</_>
+        <_>
+          5 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 13 2 -1.</_>
+        <_>
+          5 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 2 -1.</_>
+        <_>
+          5 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 2 -1.</_>
+        <_>
+          8 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          10 10 4 4 2.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 14 -1.</_>
+        <_>
+          9 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 5 -1.</_>
+        <_>
+          7 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 3 -1.</_>
+        <_>
+          3 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 4 -1.</_>
+        <_>
+          1 2 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          3 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          14 0 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          3 0 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 9 8 -1.</_>
+        <_>
+          4 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 2 -1.</_>
+        <_>
+          2 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 10 3 -1.</_>
+        <_>
+          6 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 12 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 12 -1.</_>
+        <_>
+          3 4 7 6 2.</_>
+        <_>
+          10 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 8 -1.</_>
+        <_>
+          6 10 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 4 -1.</_>
+        <_>
+          0 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 8 -1.</_>
+        <_>
+          16 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 10 -1.</_>
+        <_>
+          3 3 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 6 -1.</_>
+        <_>
+          5 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 4 -1.</_>
+        <_>
+          8 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 15 6 -1.</_>
+        <_>
+          3 17 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 6 -1.</_>
+        <_>
+          11 9 6 3 2.</_>
+        <_>
+          5 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 19 9 -1.</_>
+        <_>
+          1 3 19 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 3 -1.</_>
+        <_>
+          1 12 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 15 5 -1.</_>
+        <_>
+          8 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 6 -1.</_>
+        <_>
+          2 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 6 -1.</_>
+        <_>
+          12 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 15 -1.</_>
+        <_>
+          4 10 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 10 9 -1.</_>
+        <_>
+          7 13 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 10 -1.</_>
+        <_>
+          2 6 8 5 2.</_>
+        <_>
+          10 11 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 4 -1.</_>
+        <_>
+          10 9 10 2 2.</_>
+        <_>
+          0 11 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 7 -1.</_>
+        <_>
+          6 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 20 -1.</_>
+        <_>
+          18 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 13 2 -1.</_>
+        <_>
+          3 2 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 18 -1.</_>
+        <_>
+          18 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 5 -1.</_>
+        <_>
+          6 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 15 -1.</_>
+        <_>
+          9 3 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 6 -1.</_>
+        <_>
+          5 6 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 8 -1.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 12 -1.</_>
+        <_>
+          7 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 10 -1.</_>
+        <_>
+          5 10 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 7 4 -1.</_>
+        <_>
+          4 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 4 -1.</_>
+        <_>
+          8 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 7 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 12 -1.</_>
+        <_>
+          4 6 6 6 2.</_>
+        <_>
+          10 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 10 -1.</_>
+        <_>
+          14 1 3 5 2.</_>
+        <_>
+          11 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 16 12 -1.</_>
+        <_>
+          1 5 8 6 2.</_>
+        <_>
+          9 11 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 6 -1.</_>
+        <_>
+          4 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 10 -1.</_>
+        <_>
+          6 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 8 -1.</_>
+        <_>
+          13 1 6 4 2.</_>
+        <_>
+          7 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 18 -1.</_>
+        <_>
+          2 1 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 12 10 3 2.</_>
+        <_>
+          10 15 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 15 -1.</_>
+        <_>
+          10 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 8 -1.</_>
+        <_>
+          1 1 6 4 2.</_>
+        <_>
+          7 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 5 6 -1.</_>
+        <_>
+          11 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 5 6 -1.</_>
+        <_>
+          4 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 6 -1.</_>
+        <_>
+          4 16 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          2 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 2 -1.</_>
+        <_>
+          2 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 10 -1.</_>
+        <_>
+          10 2 9 5 2.</_>
+        <_>
+          1 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 14 -1.</_>
+        <_>
+          10 4 5 7 2.</_>
+        <_>
+          5 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 6 -1.</_>
+        <_>
+          0 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 3 -1.</_>
+        <_>
+          7 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 8 -1.</_>
+        <_>
+          5 10 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 3 -1.</_>
+        <_>
+          1 14 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_>
+        <_>
+          3 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 13 -1.</_>
+        <_>
+          1 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 8 -1.</_>
+        <_>
+          8 9 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 20 -1.</_>
+        <_>
+          16 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          2 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 19 -1.</_>
+        <_>
+          16 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 4 -1.</_>
+        <_>
+          1 0 8 2 2.</_>
+        <_>
+          9 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 14 -1.</_>
+        <_>
+          14 6 2 7 2.</_>
+        <_>
+          12 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 3 -1.</_>
+        <_>
+          2 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 10 -1.</_>
+        <_>
+          11 6 4 5 2.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          2 0 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 3 -1.</_>
+        <_>
+          5 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 14 3 -1.</_>
+        <_>
+          1 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 9 -1.</_>
+        <_>
+          15 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 10 -1.</_>
+        <_>
+          9 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 14 -1.</_>
+        <_>
+          5 4 4 7 2.</_>
+        <_>
+          9 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 8 -1.</_>
+        <_>
+          10 6 6 4 2.</_>
+        <_>
+          4 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 13 6 -1.</_>
+        <_>
+          3 4 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 7 10 -1.</_>
+        <_>
+          10 9 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 10 -1.</_>
+        <_>
+          3 4 7 5 2.</_>
+        <_>
+          10 9 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 13 -1.</_>
+        <_>
+          17 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 3 13 -1.</_>
+        <_>
+          2 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 9 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 8 -1.</_>
+        <_>
+          13 8 6 4 2.</_>
+        <_>
+          7 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 8 -1.</_>
+        <_>
+          1 8 6 4 2.</_>
+        <_>
+          7 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 10 -1.</_>
+        <_>
+          7 0 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 12 -1.</_>
+        <_>
+          4 2 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 12 9 -1.</_>
+        <_>
+          12 11 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 9 -1.</_>
+        <_>
+          7 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 10 -1.</_>
+        <_>
+          10 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 8 -1.</_>
+        <_>
+          13 12 4 4 2.</_>
+        <_>
+          9 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 9 15 -1.</_>
+        <_>
+          13 2 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 9 15 -1.</_>
+        <_>
+          4 1 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 6 -1.</_>
+        <_>
+          5 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 5 8 -1.</_>
+        <_>
+          5 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 5 8 -1.</_>
+        <_>
+          3 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 12 -1.</_>
+        <_>
+          14 1 3 6 2.</_>
+        <_>
+          11 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 8 -1.</_>
+        <_>
+          3 12 4 4 2.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 15 -1.</_>
+        <_>
+          15 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 14 8 -1.</_>
+        <_>
+          2 5 7 4 2.</_>
+        <_>
+          9 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 10 -1.</_>
+        <_>
+          3 1 3 5 2.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 19 2 -1.</_>
+        <_>
+          1 3 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 2 -1.</_>
+        <_>
+          7 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 12 -1.</_>
+        <_>
+          6 10 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 8 -1.</_>
+        <_>
+          11 1 4 4 2.</_>
+        <_>
+          7 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 6 -1.</_>
+        <_>
+          10 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 12 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 7 8 -1.</_>
+        <_>
+          12 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 14 -1.</_>
+        <_>
+          3 2 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 7 8 -1.</_>
+        <_>
+          1 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 16 -1.</_>
+        <_>
+          8 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 7 6 -1.</_>
+        <_>
+          11 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 3 -1.</_>
+        <_>
+          5 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 7 4 -1.</_>
+        <_>
+          1 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 17 6 -1.</_>
+        <_>
+          2 4 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 8 4 -1.</_>
+        <_>
+          5 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 8 -1.</_>
+        <_>
+          10 1 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 14 -1.</_>
+        <_>
+          11 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 4 -1.</_>
+        <_>
+          0 11 9 2 2.</_>
+        <_>
+          9 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 12 12 -1.</_>
+        <_>
+          2 7 6 6 2.</_>
+        <_>
+          8 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 13 2 -1.</_>
+        <_>
+          4 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 15 12 -1.</_>
+        <_>
+          0 10 15 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 11 8 -1.</_>
+        <_>
+          5 6 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 13 3 -1.</_>
+        <_>
+          2 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 9 -1.</_>
+        <_>
+          15 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 13 -1.</_>
+        <_>
+          8 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 13 -1.</_>
+        <_>
+          9 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 13 -1.</_>
+        <_>
+          9 3 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 2 4 4 2.</_>
+        <_>
+          5 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 12 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 5 -1.</_>
+        <_>
+          8 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 16 -1.</_>
+        <_>
+          0 11 20 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 6 -1.</_>
+        <_>
+          0 6 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 12 -1.</_>
+        <_>
+          9 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          5 10 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 3 -1.</_>
+        <_>
+          2 9 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          2 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          6 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 3 -1.</_>
+        <_>
+          3 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 16 -1.</_>
+        <_>
+          1 4 3 8 2.</_>
+        <_>
+          4 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 19 6 -1.</_>
+        <_>
+          1 16 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          7 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 4 -1.</_>
+        <_>
+          9 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 4 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 10 -1.</_>
+        <_>
+          6 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          5 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 2 -1.</_>
+        <_>
+          4 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 7 -1.</_>
+        <_>
+          16 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 5 10 -1.</_>
+        <_>
+          5 9 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 10 -1.</_>
+        <_>
+          8 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 9 -1.</_>
+        <_>
+          16 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          2 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 19 3 -1.</_>
+        <_>
+          1 2 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 14 -1.</_>
+        <_>
+          8 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 11 -1.</_>
+        <_>
+          13 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 9 -1.</_>
+        <_>
+          0 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 8 -1.</_>
+        <_>
+          13 2 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          4 2 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 3 -1.</_>
+        <_>
+          7 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          0 2 10 3 2.</_>
+        <_>
+          10 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 13 -1.</_>
+        <_>
+          6 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 10 -1.</_>
+        <_>
+          0 6 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 13 -1.</_>
+        <_>
+          8 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 16 -1.</_>
+        <_>
+          11 0 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 6 -1.</_>
+        <_>
+          10 13 10 3 2.</_>
+        <_>
+          0 16 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 13 -1.</_>
+        <_>
+          2 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 15 10 -1.</_>
+        <_>
+          5 15 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 15 10 -1.</_>
+        <_>
+          0 15 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 16 -1.</_>
+        <_>
+          8 0 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 4 -1.</_>
+        <_>
+          6 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 2 -1.</_>
+        <_>
+          1 4 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 13 8 -1.</_>
+        <_>
+          6 9 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 6 -1.</_>
+        <_>
+          4 2 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 4 -1.</_>
+        <_>
+          10 9 9 2 2.</_>
+        <_>
+          1 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          6 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 4 -1.</_>
+        <_>
+          9 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 4 -1.</_>
+        <_>
+          7 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 8 -1.</_>
+        <_>
+          5 7 4 4 2.</_>
+        <_>
+          9 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 3 -1.</_>
+        <_>
+          10 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 4 -1.</_>
+        <_>
+          10 0 10 2 2.</_>
+        <_>
+          0 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 3 -1.</_>
+        <_>
+          3 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 7 -1.</_>
+        <_>
+          11 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 7 -1.</_>
+        <_>
+          7 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 2 -1.</_>
+        <_>
+          1 17 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 3 -1.</_>
+        <_>
+          0 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 13 3 -1.</_>
+        <_>
+          3 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 10 -1.</_>
+        <_>
+          8 10 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 2 -1.</_>
+        <_>
+          0 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 4 -1.</_>
+        <_>
+          12 7 7 2 2.</_>
+        <_>
+          5 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 14 4 -1.</_>
+        <_>
+          1 7 7 2 2.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 9 -1.</_>
+        <_>
+          12 7 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 15 2 -1.</_>
+        <_>
+          0 9 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 18 -1.</_>
+        <_>
+          4 9 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 5 -1.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 5 10 -1.</_>
+        <_>
+          9 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          3 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 10 -1.</_>
+        <_>
+          12 7 3 5 2.</_>
+        <_>
+          9 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 9 10 -1.</_>
+        <_>
+          4 5 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 16 -1.</_>
+        <_>
+          9 2 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 16 -1.</_>
+        <_>
+          8 2 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 10 -1.</_>
+        <_>
+          5 15 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 10 -1.</_>
+        <_>
+          5 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 8 -1.</_>
+        <_>
+          15 2 4 4 2.</_>
+        <_>
+          11 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 10 -1.</_>
+        <_>
+          3 2 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 13 8 -1.</_>
+        <_>
+          4 14 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 4 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 2 4 4 2.</_>
+        <_>
+          5 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 6 -1.</_>
+        <_>
+          4 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          4 5 6 5 2.</_>
+        <_>
+          10 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 8 -1.</_>
+        <_>
+          12 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 5 6 -1.</_>
+        <_>
+          3 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          9 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          6 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          7 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 2 -1.</_>
+        <_>
+          3 2 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 18 -1.</_>
+        <_>
+          14 1 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 15 -1.</_>
+        <_>
+          5 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 4 -1.</_>
+        <_>
+          0 14 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          0 8 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 8 -1.</_>
+        <_>
+          5 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 10 -1.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 11 -1.</_>
+        <_>
+          8 9 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 20 -1.</_>
+        <_>
+          7 0 6 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 16 4 -1.</_>
+        <_>
+          2 17 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 13 2 -1.</_>
+        <_>
+          5 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          5 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 9 6 -1.</_>
+        <_>
+          10 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 6 -1.</_>
+        <_>
+          1 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 13 2 -1.</_>
+        <_>
+          3 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 3 -1.</_>
+        <_>
+          4 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 17 2 -1.</_>
+        <_>
+          0 11 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 12 -1.</_>
+        <_>
+          11 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 4 -1.</_>
+        <_>
+          0 10 8 2 2.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          3 14 7 2 2.</_>
+        <_>
+          10 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 3 -1.</_>
+        <_>
+          6 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 3 -1.</_>
+        <_>
+          7 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 8 -1.</_>
+        <_>
+          10 8 5 4 2.</_>
+        <_>
+          5 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 7 -1.</_>
+        <_>
+          7 2 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 6 -1.</_>
+        <_>
+          12 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 7 -1.</_>
+        <_>
+          3 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 2 -1.</_>
+        <_>
+          4 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 7 9 -1.</_>
+        <_>
+          0 9 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 14 -1.</_>
+        <_>
+          10 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 3 -1.</_>
+        <_>
+          3 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 6 -1.</_>
+        <_>
+          13 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 5 -1.</_>
+        <_>
+          6 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 10 -1.</_>
+        <_>
+          15 10 3 5 2.</_>
+        <_>
+          12 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          2 10 3 5 2.</_>
+        <_>
+          5 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 6 -1.</_>
+        <_>
+          4 5 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 4 -1.</_>
+        <_>
+          0 2 9 2 2.</_>
+        <_>
+          9 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 10 -1.</_>
+        <_>
+          13 10 3 5 2.</_>
+        <_>
+          10 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 10 -1.</_>
+        <_>
+          4 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 10 -1.</_>
+        <_>
+          10 0 4 5 2.</_>
+        <_>
+          6 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 14 -1.</_>
+        <_>
+          9 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 10 -1.</_>
+        <_>
+          15 1 3 5 2.</_>
+        <_>
+          12 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 18 -1.</_>
+        <_>
+          11 10 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 10 -1.</_>
+        <_>
+          2 1 3 5 2.</_>
+        <_>
+          5 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 4 -1.</_>
+        <_>
+          12 10 8 2 2.</_>
+        <_>
+          4 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 4 -1.</_>
+        <_>
+          0 10 9 2 2.</_>
+        <_>
+          9 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 8 -1.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 10 -1.</_>
+        <_>
+          0 4 9 5 2.</_>
+        <_>
+          9 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 2 -1.</_>
+        <_>
+          2 12 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 5 9 -1.</_>
+        <_>
+          4 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 8 -1.</_>
+        <_>
+          12 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 13 2 -1.</_>
+        <_>
+          1 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 8 -1.</_>
+        <_>
+          12 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 8 -1.</_>
+        <_>
+          6 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 8 -1.</_>
+        <_>
+          12 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          16 0 3 5 2.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 13 3 -1.</_>
+        <_>
+          3 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 11 6 -1.</_>
+        <_>
+          5 14 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 3 -1.</_>
+        <_>
+          0 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 10 -1.</_>
+        <_>
+          8 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          16 0 3 5 2.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 12 -1.</_>
+        <_>
+          7 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 17 2 -1.</_>
+        <_>
+          1 3 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 18 -1.</_>
+        <_>
+          12 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 6 -1.</_>
+        <_>
+          0 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 14 -1.</_>
+        <_>
+          0 6 3 7 2.</_>
+        <_>
+          3 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 6 -1.</_>
+        <_>
+          12 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 4 -1.</_>
+        <_>
+          6 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 8 -1.</_>
+        <_>
+          5 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 4 -1.</_>
+        <_>
+          11 11 8 2 2.</_>
+        <_>
+          3 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 8 -1.</_>
+        <_>
+          16 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 18 -1.</_>
+        <_>
+          7 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 8 -1.</_>
+        <_>
+          16 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 4 -1.</_>
+        <_>
+          8 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 3 -1.</_>
+        <_>
+          4 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 8 -1.</_>
+        <_>
+          2 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 12 -1.</_>
+        <_>
+          9 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 6 -1.</_>
+        <_>
+          0 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 10 -1.</_>
+        <_>
+          4 15 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 16 -1.</_>
+        <_>
+          10 4 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 16 -1.</_>
+        <_>
+          8 4 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 2 -1.</_>
+        <_>
+          7 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 2 -1.</_>
+        <_>
+          0 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 5 -1.</_>
+        <_>
+          6 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 10 -1.</_>
+        <_>
+          14 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 17 6 -1.</_>
+        <_>
+          1 7 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 10 -1.</_>
+        <_>
+          14 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 3 -1.</_>
+        <_>
+          0 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 10 -1.</_>
+        <_>
+          14 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 10 -1.</_>
+        <_>
+          3 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 13 -1.</_>
+        <_>
+          4 7 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 15 -1.</_>
+        <_>
+          14 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 15 -1.</_>
+        <_>
+          5 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 15 5 -1.</_>
+        <_>
+          8 2 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 14 -1.</_>
+        <_>
+          5 11 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 12 -1.</_>
+        <_>
+          4 6 5 6 2.</_>
+        <_>
+          9 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 10 -1.</_>
+        <_>
+          11 5 6 5 2.</_>
+        <_>
+          5 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 10 -1.</_>
+        <_>
+          3 5 6 5 2.</_>
+        <_>
+          9 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 12 -1.</_>
+        <_>
+          16 0 4 6 2.</_>
+        <_>
+          12 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          10 2 10 2 2.</_>
+        <_>
+          0 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 8 -1.</_>
+        <_>
+          8 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 20 -1.</_>
+        <_>
+          11 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 20 -1.</_>
+        <_>
+          8 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 13 -1.</_>
+        <_>
+          10 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          10 15 10 2 2.</_>
+        <_>
+          0 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 13 -1.</_>
+        <_>
+          3 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 7 6 -1.</_>
+        <_>
+          7 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 14 -1.</_>
+        <_>
+          0 9 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 8 -1.</_>
+        <_>
+          12 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          4 16 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 4 -1.</_>
+        <_>
+          10 13 9 2 2.</_>
+        <_>
+          1 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 11 4 -1.</_>
+        <_>
+          5 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 14 -1.</_>
+        <_>
+          14 6 3 7 2.</_>
+        <_>
+          11 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          3 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 12 -1.</_>
+        <_>
+          3 7 3 6 2.</_>
+        <_>
+          6 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 3 -1.</_>
+        <_>
+          7 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 3 -1.</_>
+        <_>
+          8 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 9 -1.</_>
+        <_>
+          3 3 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 4 -1.</_>
+        <_>
+          10 1 7 2 2.</_>
+        <_>
+          3 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 10 -1.</_>
+        <_>
+          11 9 5 5 2.</_>
+        <_>
+          6 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 10 -1.</_>
+        <_>
+          4 9 5 5 2.</_>
+        <_>
+          9 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 6 -1.</_>
+        <_>
+          5 9 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 7 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 3 -1.</_>
+        <_>
+          3 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 7 10 -1.</_>
+        <_>
+          6 12 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 19 -1.</_>
+        <_>
+          10 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 13 -1.</_>
+        <_>
+          12 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 8 -1.</_>
+        <_>
+          5 9 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 4 -1.</_>
+        <_>
+          1 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 11 8 -1.</_>
+        <_>
+          7 16 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 13 -1.</_>
+        <_>
+          7 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 16 4 -1.</_>
+        <_>
+          2 15 8 2 2.</_>
+        <_>
+          10 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 6 -1.</_>
+        <_>
+          10 1 9 3 2.</_>
+        <_>
+          1 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 6 -1.</_>
+        <_>
+          3 3 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 7 -1.</_>
+        <_>
+          8 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 13 12 -1.</_>
+        <_>
+          4 6 13 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 13 3 -1.</_>
+        <_>
+          3 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 6 -1.</_>
+        <_>
+          10 10 5 3 2.</_>
+        <_>
+          5 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 12 -1.</_>
+        <_>
+          3 5 6 6 2.</_>
+        <_>
+          9 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 8 -1.</_>
+        <_>
+          1 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          2 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 6 -1.</_>
+        <_>
+          7 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 4 -1.</_>
+        <_>
+          1 14 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 14 -1.</_>
+        <_>
+          0 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 6 -1.</_>
+        <_>
+          11 12 9 3 2.</_>
+        <_>
+          2 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 13 -1.</_>
+        <_>
+          7 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 7 6 -1.</_>
+        <_>
+          13 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 10 -1.</_>
+        <_>
+          2 5 8 5 2.</_>
+        <_>
+          10 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 7 -1.</_>
+        <_>
+          16 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 7 -1.</_>
+        <_>
+          6 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 4 -1.</_>
+        <_>
+          13 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 4 -1.</_>
+        <_>
+          0 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 17 6 -1.</_>
+        <_>
+          2 16 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 12 -1.</_>
+        <_>
+          7 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          8 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          7 10 3 5 2.</_>
+        <_>
+          10 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 3 -1.</_>
+        <_>
+          0 14 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 5 8 -1.</_>
+        <_>
+          13 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 6 -1.</_>
+        <_>
+          0 12 9 3 2.</_>
+        <_>
+          9 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 10 -1.</_>
+        <_>
+          15 10 3 5 2.</_>
+        <_>
+          12 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          2 10 3 5 2.</_>
+        <_>
+          5 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 3 -1.</_>
+        <_>
+          9 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 3 -1.</_>
+        <_>
+          10 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 3 -1.</_>
+        <_>
+          2 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 12 12 -1.</_>
+        <_>
+          8 8 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 6 -1.</_>
+        <_>
+          6 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 5 12 -1.</_>
+        <_>
+          9 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 8 -1.</_>
+        <_>
+          6 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 12 -1.</_>
+        <_>
+          14 0 3 6 2.</_>
+        <_>
+          11 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 12 -1.</_>
+        <_>
+          3 0 3 6 2.</_>
+        <_>
+          6 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 8 -1.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          5 9 5 4 2.</_>
+        <_>
+          10 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 13 3 -1.</_>
+        <_>
+          4 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 7 -1.</_>
+        <_>
+          14 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 7 -1.</_>
+        <_>
+          4 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 14 6 -1.</_>
+        <_>
+          13 5 7 3 2.</_>
+        <_>
+          6 8 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 6 -1.</_>
+        <_>
+          0 6 8 3 2.</_>
+        <_>
+          8 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 9 -1.</_>
+        <_>
+          12 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 9 8 -1.</_>
+        <_>
+          1 10 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 6 -1.</_>
+        <_>
+          13 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 14 -1.</_>
+        <_>
+          9 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 19 2 -1.</_>
+        <_>
+          1 3 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 13 -1.</_>
+        <_>
+          2 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          16 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          2 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 9 -1.</_>
+        <_>
+          0 14 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 10 -1.</_>
+        <_>
+          11 3 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 9 -1.</_>
+        <_>
+          7 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 8 -1.</_>
+        <_>
+          10 0 9 4 2.</_>
+        <_>
+          1 4 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 14 2 -1.</_>
+        <_>
+          3 19 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 16 -1.</_>
+        <_>
+          0 4 3 8 2.</_>
+        <_>
+          3 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 13 -1.</_>
+        <_>
+          14 6 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 12 -1.</_>
+        <_>
+          6 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 5 6 -1.</_>
+        <_>
+          11 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 4 -1.</_>
+        <_>
+          6 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 7 -1.</_>
+        <_>
+          8 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 10 -1.</_>
+        <_>
+          12 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 10 -1.</_>
+        <_>
+          15 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 10 -1.</_>
+        <_>
+          3 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 16 -1.</_>
+        <_>
+          10 0 5 8 2.</_>
+        <_>
+          5 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 3 -1.</_>
+        <_>
+          3 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 9 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 12 -1.</_>
+        <_>
+          4 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 6 -1.</_>
+        <_>
+          8 16 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 6 -1.</_>
+        <_>
+          0 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 3 -1.</_>
+        <_>
+          4 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 12 -1.</_>
+        <_>
+          6 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 13 3 -1.</_>
+        <_>
+          4 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 14 -1.</_>
+        <_>
+          11 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 4 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 7 -1.</_>
+        <_>
+          8 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 9 -1.</_>
+        <_>
+          2 14 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 7 -1.</_>
+        <_>
+          2 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 4 -1.</_>
+        <_>
+          0 10 8 2 2.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 2 -1.</_>
+        <_>
+          3 2 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 9 -1.</_>
+        <_>
+          4 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 16 4 -1.</_>
+        <_>
+          10 14 8 2 2.</_>
+        <_>
+          2 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 8 -1.</_>
+        <_>
+          0 4 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 5 -1.</_>
+        <_>
+          10 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 15 -1.</_>
+        <_>
+          7 1 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 5 -1.</_>
+        <_>
+          10 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 8 -1.</_>
+        <_>
+          6 7 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 14 -1.</_>
+        <_>
+          18 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 12 -1.</_>
+        <_>
+          4 6 6 6 2.</_>
+        <_>
+          10 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 14 -1.</_>
+        <_>
+          16 6 4 7 2.</_>
+        <_>
+          12 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 14 -1.</_>
+        <_>
+          0 6 4 7 2.</_>
+        <_>
+          4 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 16 -1.</_>
+        <_>
+          2 4 3 8 2.</_>
+        <_>
+          5 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 5 9 -1.</_>
+        <_>
+          14 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 3 -1.</_>
+        <_>
+          3 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 16 -1.</_>
+        <_>
+          5 1 3 8 2.</_>
+        <_>
+          8 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 10 -1.</_>
+        <_>
+          9 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 11 -1.</_>
+        <_>
+          7 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 6 -1.</_>
+        <_>
+          10 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 14 -1.</_>
+        <_>
+          1 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 6 -1.</_>
+        <_>
+          10 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 7 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 8 -1.</_>
+        <_>
+          2 9 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 10 -1.</_>
+        <_>
+          6 7 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 12 -1.</_>
+        <_>
+          12 3 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 12 -1.</_>
+        <_>
+          4 3 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 4 -1.</_>
+        <_>
+          11 11 9 2 2.</_>
+        <_>
+          2 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 4 -1.</_>
+        <_>
+          0 11 9 2 2.</_>
+        <_>
+          9 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 12 -1.</_>
+        <_>
+          4 7 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 4 -1.</_>
+        <_>
+          6 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 6 -1.</_>
+        <_>
+          0 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 13 -1.</_>
+        <_>
+          7 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          0 8 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 5 -1.</_>
+        <_>
+          14 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 6 -1.</_>
+        <_>
+          0 3 5 3 2.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 5 -1.</_>
+        <_>
+          9 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 8 -1.</_>
+        <_>
+          3 12 4 4 2.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 3 -1.</_>
+        <_>
+          9 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 9 -1.</_>
+        <_>
+          3 4 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 15 -1.</_>
+        <_>
+          6 6 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 3 -1.</_>
+        <_>
+          6 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 8 -1.</_>
+        <_>
+          6 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 2 -1.</_>
+        <_>
+          2 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 16 2 -1.</_>
+        <_>
+          1 4 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 13 3 -1.</_>
+        <_>
+          5 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 17 3 -1.</_>
+        <_>
+          2 9 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 6 -1.</_>
+        <_>
+          1 1 9 3 2.</_>
+        <_>
+          10 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 19 6 -1.</_>
+        <_>
+          1 3 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 6 -1.</_>
+        <_>
+          4 6 6 3 2.</_>
+        <_>
+          10 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 13 2 -1.</_>
+        <_>
+          3 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 8 6 -1.</_>
+        <_>
+          10 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          0 0 9 2 2.</_>
+        <_>
+          9 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 5 -1.</_>
+        <_>
+          9 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 15 4 -1.</_>
+        <_>
+          5 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 10 -1.</_>
+        <_>
+          12 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 12 -1.</_>
+        <_>
+          0 6 9 6 2.</_>
+        <_>
+          9 12 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 14 -1.</_>
+        <_>
+          16 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 5 6 -1.</_>
+        <_>
+          2 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 19 -1.</_>
+        <_>
+          13 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 9 6 -1.</_>
+        <_>
+          0 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 7 -1.</_>
+        <_>
+          7 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 19 -1.</_>
+        <_>
+          13 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 4 -1.</_>
+        <_>
+          0 15 7 2 2.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 14 6 -1.</_>
+        <_>
+          4 7 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 7 -1.</_>
+        <_>
+          5 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          0 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 5 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 5 -1.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 10 -1.</_>
+        <_>
+          5 8 5 5 2.</_>
+        <_>
+          10 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 10 -1.</_>
+        <_>
+          10 5 9 5 2.</_>
+        <_>
+          1 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          7 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 5 14 -1.</_>
+        <_>
+          4 10 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 6 -1.</_>
+        <_>
+          7 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 3 -1.</_>
+        <_>
+          0 1 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 6 -1.</_>
+        <_>
+          8 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 11 -1.</_>
+        <_>
+          9 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 10 -1.</_>
+        <_>
+          8 3 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 4 -1.</_>
+        <_>
+          0 6 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 14 -1.</_>
+        <_>
+          12 4 2 7 2.</_>
+        <_>
+          10 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 14 -1.</_>
+        <_>
+          12 4 2 7 2.</_>
+        <_>
+          10 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 14 -1.</_>
+        <_>
+          6 4 2 7 2.</_>
+        <_>
+          8 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 7 -1.</_>
+        <_>
+          16 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 4 -1.</_>
+        <_>
+          6 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 15 -1.</_>
+        <_>
+          7 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 17 -1.</_>
+        <_>
+          13 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 17 -1.</_>
+        <_>
+          6 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 13 -1.</_>
+        <_>
+          10 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 14 -1.</_>
+        <_>
+          10 3 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 4 -1.</_>
+        <_>
+          10 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 6 -1.</_>
+        <_>
+          13 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 19 2 -1.</_>
+        <_>
+          0 3 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 11 -1.</_>
+        <_>
+          10 9 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 9 -1.</_>
+        <_>
+          8 0 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 2 -1.</_>
+        <_>
+          3 5 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 7 -1.</_>
+        <_>
+          2 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 11 -1.</_>
+        <_>
+          10 9 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 6 7 -1.</_>
+        <_>
+          5 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 3 -1.</_>
+        <_>
+          8 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 8 -1.</_>
+        <_>
+          0 1 4 4 2.</_>
+        <_>
+          4 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 4 -1.</_>
+        <_>
+          9 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 6 -1.</_>
+        <_>
+          6 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 9 -1.</_>
+        <_>
+          4 6 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 10 -1.</_>
+        <_>
+          8 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 17 2 -1.</_>
+        <_>
+          0 4 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 6 -1.</_>
+        <_>
+          12 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 8 -1.</_>
+        <_>
+          5 6 4 4 2.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 7 6 -1.</_>
+        <_>
+          9 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 5 9 -1.</_>
+        <_>
+          13 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 5 9 -1.</_>
+        <_>
+          2 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 5 -1.</_>
+        <_>
+          14 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 11 -1.</_>
+        <_>
+          8 6 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 5 -1.</_>
+        <_>
+          14 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 6 -1.</_>
+        <_>
+          0 3 5 3 2.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 14 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 8 -1.</_>
+        <_>
+          12 15 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 7 -1.</_>
+        <_>
+          8 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 2 -1.</_>
+        <_>
+          5 16 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 12 10 3 2.</_>
+        <_>
+          10 15 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 12 -1.</_>
+        <_>
+          10 6 5 6 2.</_>
+        <_>
+          5 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 15 4 -1.</_>
+        <_>
+          1 17 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 6 -1.</_>
+        <_>
+          10 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 10 6 -1.</_>
+        <_>
+          10 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 12 4 -1.</_>
+        <_>
+          12 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 17 -1.</_>
+        <_>
+          2 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 3 -1.</_>
+        <_>
+          5 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 12 -1.</_>
+        <_>
+          6 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 5 -1.</_>
+        <_>
+          14 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 5 -1.</_>
+        <_>
+          3 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 16 -1.</_>
+        <_>
+          7 3 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 11 10 -1.</_>
+        <_>
+          4 9 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 13 3 -1.</_>
+        <_>
+          6 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 10 -1.</_>
+        <_>
+          3 4 4 5 2.</_>
+        <_>
+          7 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 6 -1.</_>
+        <_>
+          1 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 9 -1.</_>
+        <_>
+          15 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 9 -1.</_>
+        <_>
+          0 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 4 14 -1.</_>
+        <_>
+          16 6 2 7 2.</_>
+        <_>
+          14 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          2 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 7 -1.</_>
+        <_>
+          6 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 11 -1.</_>
+        <_>
+          5 9 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 12 -1.</_>
+        <_>
+          5 14 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 7 -1.</_>
+        <_>
+          3 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 3 -1.</_>
+        <_>
+          0 8 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 14 -1.</_>
+        <_>
+          0 6 3 7 2.</_>
+        <_>
+          3 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 11 12 -1.</_>
+        <_>
+          2 7 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 8 -1.</_>
+        <_>
+          1 5 4 4 2.</_>
+        <_>
+          5 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 16 -1.</_>
+        <_>
+          18 4 2 8 2.</_>
+        <_>
+          16 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 14 4 -1.</_>
+        <_>
+          13 15 7 2 2.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 7 -1.</_>
+        <_>
+          8 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 9 -1.</_>
+        <_>
+          10 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 14 -1.</_>
+        <_>
+          11 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 13 -1.</_>
+        <_>
+          11 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 13 -1.</_>
+        <_>
+          8 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 10 6 -1.</_>
+        <_>
+          10 14 5 3 2.</_>
+        <_>
+          5 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 4 -1.</_>
+        <_>
+          6 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 8 6 -1.</_>
+        <_>
+          11 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 6 -1.</_>
+        <_>
+          1 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 6 -1.</_>
+        <_>
+          2 2 6 3 2.</_>
+        <_>
+          8 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 16 -1.</_>
+        <_>
+          18 4 2 8 2.</_>
+        <_>
+          16 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 12 -1.</_>
+        <_>
+          0 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 9 6 -1.</_>
+        <_>
+          10 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 10 -1.</_>
+        <_>
+          5 2 3 5 2.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 8 -1.</_>
+        <_>
+          8 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 14 -1.</_>
+        <_>
+          11 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 14 -1.</_>
+        <_>
+          7 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 17 -1.</_>
+        <_>
+          8 3 6 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 4 -1.</_>
+        <_>
+          9 6 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 16 -1.</_>
+        <_>
+          18 4 2 8 2.</_>
+        <_>
+          16 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 14 -1.</_>
+        <_>
+          6 6 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 8 10 -1.</_>
+        <_>
+          12 9 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 10 -1.</_>
+        <_>
+          4 9 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 18 -1.</_>
+        <_>
+          13 2 3 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 18 -1.</_>
+        <_>
+          4 2 3 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 9 -1.</_>
+        <_>
+          0 9 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 3 -1.</_>
+        <_>
+          5 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 19 15 -1.</_>
+        <_>
+          0 8 19 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 9 6 -1.</_>
+        <_>
+          10 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 9 6 -1.</_>
+        <_>
+          1 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 3 -1.</_>
+        <_>
+          5 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 16 -1.</_>
+        <_>
+          0 4 2 8 2.</_>
+        <_>
+          2 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 5 6 -1.</_>
+        <_>
+          10 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 8 -1.</_>
+        <_>
+          0 14 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 7 -1.</_>
+        <_>
+          16 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          2 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 19 -1.</_>
+        <_>
+          14 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 4 -1.</_>
+        <_>
+          4 2 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 6 -1.</_>
+        <_>
+          12 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 7 6 -1.</_>
+        <_>
+          6 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 5 6 -1.</_>
+        <_>
+          10 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 9 -1.</_>
+        <_>
+          3 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 14 -1.</_>
+        <_>
+          15 5 2 7 2.</_>
+        <_>
+          13 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 9 -1.</_>
+        <_>
+          3 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 4 -1.</_>
+        <_>
+          2 17 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 6 -1.</_>
+        <_>
+          0 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 14 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 8 -1.</_>
+        <_>
+          3 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 3 -1.</_>
+        <_>
+          9 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 9 6 -1.</_>
+        <_>
+          4 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 14 -1.</_>
+        <_>
+          10 0 8 7 2.</_>
+        <_>
+          2 7 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 18 -1.</_>
+        <_>
+          3 9 14 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 10 -1.</_>
+        <_>
+          12 7 3 5 2.</_>
+        <_>
+          9 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 16 -1.</_>
+        <_>
+          3 4 2 8 2.</_>
+        <_>
+          5 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 8 6 -1.</_>
+        <_>
+          12 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 10 -1.</_>
+        <_>
+          7 0 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 15 -1.</_>
+        <_>
+          13 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 15 -1.</_>
+        <_>
+          4 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 5 -1.</_>
+        <_>
+          14 3 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          14 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 7 -1.</_>
+        <_>
+          3 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 8 -1.</_>
+        <_>
+          15 6 4 4 2.</_>
+        <_>
+          11 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 3 -1.</_>
+        <_>
+          5 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 15 3 -1.</_>
+        <_>
+          0 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 12 -1.</_>
+        <_>
+          11 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 13 3 -1.</_>
+        <_>
+          2 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 2 -1.</_>
+        <_>
+          2 2 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 10 -1.</_>
+        <_>
+          5 6 4 5 2.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 10 12 -1.</_>
+        <_>
+          13 8 5 6 2.</_>
+        <_>
+          8 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 6 -1.</_>
+        <_>
+          3 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 8 -1.</_>
+        <_>
+          10 5 9 4 2.</_>
+        <_>
+          1 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 7 -1.</_>
+        <_>
+          7 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 8 14 -1.</_>
+        <_>
+          2 6 4 7 2.</_>
+        <_>
+          6 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 9 -1.</_>
+        <_>
+          8 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 13 -1.</_>
+        <_>
+          10 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 13 2 -1.</_>
+        <_>
+          0 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 16 -1.</_>
+        <_>
+          7 11 13 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 9 -1.</_>
+        <_>
+          0 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 7 6 -1.</_>
+        <_>
+          11 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 4 -1.</_>
+        <_>
+          1 1 8 2 2.</_>
+        <_>
+          9 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          10 2 10 3 2.</_>
+        <_>
+          0 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 19 10 -1.</_>
+        <_>
+          0 9 19 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 5 -1.</_>
+        <_>
+          9 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 8 -1.</_>
+        <_>
+          1 16 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 3 -1.</_>
+        <_>
+          3 6 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 11 7 2 2.</_>
+        <_>
+          10 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          10 11 7 2 2.</_>
+        <_>
+          3 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 14 6 -1.</_>
+        <_>
+          2 7 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 9 4 -1.</_>
+        <_>
+          11 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 7 6 -1.</_>
+        <_>
+          1 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 20 4 -1.</_>
+        <_>
+          0 18 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 6 -1.</_>
+        <_>
+          0 14 6 3 2.</_>
+        <_>
+          6 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 5 -1.</_>
+        <_>
+          9 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 5 -1.</_>
+        <_>
+          6 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 6 9 -1.</_>
+        <_>
+          11 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          7 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 13 3 -1.</_>
+        <_>
+          5 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 14 3 -1.</_>
+        <_>
+          5 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 5 -1.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 5 -1.</_>
+        <_>
+          12 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 2 -1.</_>
+        <_>
+          4 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          6 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 10 -1.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 20 -1.</_>
+        <_>
+          10 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          13 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 4 -1.</_>
+        <_>
+          9 2 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 13 -1.</_>
+        <_>
+          7 4 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 12 -1.</_>
+        <_>
+          13 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 3 -1.</_>
+        <_>
+          6 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 12 -1.</_>
+        <_>
+          13 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 12 -1.</_>
+        <_>
+          5 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 13 3 -1.</_>
+        <_>
+          7 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 4 -1.</_>
+        <_>
+          0 2 9 2 2.</_>
+        <_>
+          9 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 5 -1.</_>
+        <_>
+          12 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 6 -1.</_>
+        <_>
+          9 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 3 -1.</_>
+        <_>
+          3 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 5 -1.</_>
+        <_>
+          12 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 5 -1.</_>
+        <_>
+          4 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 7 4 -1.</_>
+        <_>
+          11 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 9 5 -1.</_>
+        <_>
+          7 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 6 -1.</_>
+        <_>
+          5 5 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 14 -1.</_>
+        <_>
+          8 11 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 9 6 -1.</_>
+        <_>
+          1 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 12 -1.</_>
+        <_>
+          10 4 10 6 2.</_>
+        <_>
+          0 10 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 7 4 -1.</_>
+        <_>
+          5 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 2 -1.</_>
+        <_>
+          3 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 13 -1.</_>
+        <_>
+          9 7 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 12 -1.</_>
+        <_>
+          11 4 8 6 2.</_>
+        <_>
+          3 10 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 16 12 -1.</_>
+        <_>
+          1 4 8 6 2.</_>
+        <_>
+          9 10 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          7 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 9 -1.</_>
+        <_>
+          3 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_>
+        <_>
+          6 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 13 2 -1.</_>
+        <_>
+          3 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 4 -1.</_>
+        <_>
+          12 10 8 2 2.</_>
+        <_>
+          4 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 6 -1.</_>
+        <_>
+          12 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 11 -1.</_>
+        <_>
+          2 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          14 0 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          3 0 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 10 -1.</_>
+        <_>
+          5 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 8 -1.</_>
+        <_>
+          10 5 9 4 2.</_>
+        <_>
+          1 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 6 -1.</_>
+        <_>
+          4 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          10 0 4 6 2.</_>
+        <_>
+          6 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          7 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 10 -1.</_>
+        <_>
+          12 4 3 5 2.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 3 -1.</_>
+        <_>
+          0 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 3 -1.</_>
+        <_>
+          1 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 13 -1.</_>
+        <_>
+          6 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 9 -1.</_>
+        <_>
+          12 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 20 -1.</_>
+        <_>
+          6 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 14 -1.</_>
+        <_>
+          2 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          10 1 10 2 2.</_>
+        <_>
+          0 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          2 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          11 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 8 -1.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          7 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 3 -1.</_>
+        <_>
+          0 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 14 -1.</_>
+        <_>
+          4 5 2 7 2.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          11 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 6 -1.</_>
+        <_>
+          6 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 7 -1.</_>
+        <_>
+          7 0 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 14 9 -1.</_>
+        <_>
+          2 9 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 4 -1.</_>
+        <_>
+          10 14 9 2 2.</_>
+        <_>
+          1 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 6 -1.</_>
+        <_>
+          7 8 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 8 -1.</_>
+        <_>
+          0 1 4 4 2.</_>
+        <_>
+          4 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 8 4 -1.</_>
+        <_>
+          7 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          10 12 7 2 2.</_>
+        <_>
+          3 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 5 -1.</_>
+        <_>
+          8 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 7 -1.</_>
+        <_>
+          7 2 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 12 -1.</_>
+        <_>
+          7 7 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 10 -1.</_>
+        <_>
+          4 5 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 6 -1.</_>
+        <_>
+          0 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 14 -1.</_>
+        <_>
+          12 2 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 4 -1.</_>
+        <_>
+          0 15 7 2 2.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 14 -1.</_>
+        <_>
+          7 2 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 4 -1.</_>
+        <_>
+          0 6 7 2 2.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 9 -1.</_>
+        <_>
+          12 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 9 -1.</_>
+        <_>
+          4 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 18 -1.</_>
+        <_>
+          11 1 4 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 18 -1.</_>
+        <_>
+          5 1 4 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          8 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 6 -1.</_>
+        <_>
+          6 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 8 -1.</_>
+        <_>
+          5 9 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 14 2 -1.</_>
+        <_>
+          1 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 9 -1.</_>
+        <_>
+          15 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 9 -1.</_>
+        <_>
+          0 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 8 -1.</_>
+        <_>
+          7 5 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 12 -1.</_>
+        <_>
+          2 5 6 6 2.</_>
+        <_>
+          8 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 10 -1.</_>
+        <_>
+          5 7 5 5 2.</_>
+        <_>
+          10 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 16 3 -1.</_>
+        <_>
+          2 15 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 4 -1.</_>
+        <_>
+          0 13 9 2 2.</_>
+        <_>
+          9 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 2 -1.</_>
+        <_>
+          1 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 6 -1.</_>
+        <_>
+          13 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 16 -1.</_>
+        <_>
+          0 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 5 15 -1.</_>
+        <_>
+          13 10 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          2 10 3 5 2.</_>
+        <_>
+          5 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 9 6 -1.</_>
+        <_>
+          11 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 9 6 -1.</_>
+        <_>
+          0 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 4 -1.</_>
+        <_>
+          1 3 9 2 2.</_>
+        <_>
+          10 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_>
+        <_>
+          10 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 7 -1.</_>
+        <_>
+          7 6 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 19 -1.</_>
+        <_>
+          7 1 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 20 -1.</_>
+        <_>
+          7 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 13 -1.</_>
+        <_>
+          10 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 16 -1.</_>
+        <_>
+          2 8 18 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 15 -1.</_>
+        <_>
+          1 10 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 6 -1.</_>
+        <_>
+          11 13 5 3 2.</_>
+        <_>
+          6 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 14 3 -1.</_>
+        <_>
+          0 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 7 6 -1.</_>
+        <_>
+          1 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 12 -1.</_>
+        <_>
+          9 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 2 -1.</_>
+        <_>
+          4 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 7 -1.</_>
+        <_>
+          16 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 13 -1.</_>
+        <_>
+          2 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 3 -1.</_>
+        <_>
+          7 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 4 -1.</_>
+        <_>
+          0 1 8 2 2.</_>
+        <_>
+          8 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 4 -1.</_>
+        <_>
+          3 2 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 12 6 -1.</_>
+        <_>
+          3 13 6 3 2.</_>
+        <_>
+          9 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 9 -1.</_>
+        <_>
+          6 11 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 9 -1.</_>
+        <_>
+          0 11 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 10 7 -1.</_>
+        <_>
+          10 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 7 -1.</_>
+        <_>
+          5 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 6 -1.</_>
+        <_>
+          12 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 17 6 -1.</_>
+        <_>
+          0 15 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 10 4 -1.</_>
+        <_>
+          5 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 13 3 -1.</_>
+        <_>
+          1 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 9 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          1 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 7 -1.</_>
+        <_>
+          14 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 7 -1.</_>
+        <_>
+          3 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 14 -1.</_>
+        <_>
+          8 9 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 8 14 -1.</_>
+        <_>
+          4 9 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 3 -1.</_>
+        <_>
+          7 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 9 -1.</_>
+        <_>
+          12 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 9 12 -1.</_>
+        <_>
+          3 4 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 10 -1.</_>
+        <_>
+          13 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 10 8 -1.</_>
+        <_>
+          3 12 5 4 2.</_>
+        <_>
+          8 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 7 4 -1.</_>
+        <_>
+          12 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 6 -1.</_>
+        <_>
+          2 6 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 6 -1.</_>
+        <_>
+          13 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 5 6 -1.</_>
+        <_>
+          2 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 7 4 -1.</_>
+        <_>
+          12 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 10 -1.</_>
+        <_>
+          5 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 7 4 -1.</_>
+        <_>
+          12 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 2 -1.</_>
+        <_>
+          0 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 8 -1.</_>
+        <_>
+          13 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 8 -1.</_>
+        <_>
+          5 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 12 -1.</_>
+        <_>
+          5 7 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 7 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 6 -1.</_>
+        <_>
+          10 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 6 -1.</_>
+        <_>
+          0 9 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          10 11 5 3 2.</_>
+        <_>
+          5 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 3 -1.</_>
+        <_>
+          0 9 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 3 -1.</_>
+        <_>
+          7 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 15 5 -1.</_>
+        <_>
+          7 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 6 -1.</_>
+        <_>
+          2 9 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 5 -1.</_>
+        <_>
+          8 12 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 16 4 -1.</_>
+        <_>
+          2 16 8 2 2.</_>
+        <_>
+          10 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 7 -1.</_>
+        <_>
+          2 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 20 -1.</_>
+        <_>
+          9 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 13 -1.</_>
+        <_>
+          10 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 9 -1.</_>
+        <_>
+          5 4 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 8 -1.</_>
+        <_>
+          16 5 4 4 2.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          6 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 6 -1.</_>
+        <_>
+          13 2 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 14 -1.</_>
+        <_>
+          12 6 5 7 2.</_>
+        <_>
+          7 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          1 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 7 4 -1.</_>
+        <_>
+          2 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 6 -1.</_>
+        <_>
+          7 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 6 -1.</_>
+        <_>
+          11 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 14 -1.</_>
+        <_>
+          3 6 5 7 2.</_>
+        <_>
+          8 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          12 4 6 6 2.</_>
+        <_>
+          6 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 5 6 -1.</_>
+        <_>
+          4 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 5 -1.</_>
+        <_>
+          5 1 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 16 -1.</_>
+        <_>
+          9 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 4 -1.</_>
+        <_>
+          13 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 5 6 -1.</_>
+        <_>
+          3 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 4 -1.</_>
+        <_>
+          5 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 13 -1.</_>
+        <_>
+          4 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 10 -1.</_>
+        <_>
+          15 10 5 5 2.</_>
+        <_>
+          10 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 14 -1.</_>
+        <_>
+          4 6 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 12 -1.</_>
+        <_>
+          10 3 6 6 2.</_>
+        <_>
+          4 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 13 -1.</_>
+        <_>
+          10 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 5 -1.</_>
+        <_>
+          9 1 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 6 -1.</_>
+        <_>
+          3 2 6 3 2.</_>
+        <_>
+          9 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 4 -1.</_>
+        <_>
+          11 2 9 2 2.</_>
+        <_>
+          2 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 11 6 -1.</_>
+        <_>
+          3 4 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 12 -1.</_>
+        <_>
+          16 0 4 6 2.</_>
+        <_>
+          12 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          10 1 3 5 2.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 3 -1.</_>
+        <_>
+          0 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 3 -1.</_>
+        <_>
+          4 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 7 6 -1.</_>
+        <_>
+          3 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 7 6 -1.</_>
+        <_>
+          8 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 7 -1.</_>
+        <_>
+          6 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          10 1 10 2 2.</_>
+        <_>
+          0 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 3 -1.</_>
+        <_>
+          0 11 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 14 -1.</_>
+        <_>
+          12 1 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 10 -1.</_>
+        <_>
+          7 7 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 14 -1.</_>
+        <_>
+          15 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 5 -1.</_>
+        <_>
+          8 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 14 -1.</_>
+        <_>
+          15 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 14 -1.</_>
+        <_>
+          4 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 20 2 -1.</_>
+        <_>
+          0 17 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 14 -1.</_>
+        <_>
+          8 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 13 -1.</_>
+        <_>
+          10 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 9 -1.</_>
+        <_>
+          9 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 9 6 -1.</_>
+        <_>
+          5 13 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 6 -1.</_>
+        <_>
+          1 14 5 3 2.</_>
+        <_>
+          6 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 7 6 -1.</_>
+        <_>
+          11 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 12 -1.</_>
+        <_>
+          1 8 4 6 2.</_>
+        <_>
+          5 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 5 -1.</_>
+        <_>
+          10 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 15 5 -1.</_>
+        <_>
+          5 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 6 -1.</_>
+        <_>
+          12 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 10 -1.</_>
+        <_>
+          8 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 19 3 -1.</_>
+        <_>
+          1 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 9 -1.</_>
+        <_>
+          7 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 8 -1.</_>
+        <_>
+          15 2 4 4 2.</_>
+        <_>
+          11 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 13 -1.</_>
+        <_>
+          10 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 18 -1.</_>
+        <_>
+          3 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 10 -1.</_>
+        <_>
+          10 5 9 5 2.</_>
+        <_>
+          1 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 13 -1.</_>
+        <_>
+          7 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 6 -1.</_>
+        <_>
+          11 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 7 6 -1.</_>
+        <_>
+          4 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 3 -1.</_>
+        <_>
+          5 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 19 4 -1.</_>
+        <_>
+          1 6 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 5 -1.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 5 6 -1.</_>
+        <_>
+          11 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 12 -1.</_>
+        <_>
+          7 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 19 -1.</_>
+        <_>
+          10 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 7 6 -1.</_>
+        <_>
+          2 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 10 12 -1.</_>
+        <_>
+          10 11 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          5 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 12 -1.</_>
+        <_>
+          11 5 4 6 2.</_>
+        <_>
+          7 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 12 -1.</_>
+        <_>
+          5 5 4 6 2.</_>
+        <_>
+          9 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 8 -1.</_>
+        <_>
+          16 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          2 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 4 -1.</_>
+        <_>
+          7 6 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 13 2 -1.</_>
+        <_>
+          3 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 2 -1.</_>
+        <_>
+          3 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 13 6 -1.</_>
+        <_>
+          2 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 13 2 -1.</_>
+        <_>
+          3 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 14 -1.</_>
+        <_>
+          14 0 2 7 2.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 12 -1.</_>
+        <_>
+          4 0 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 3 -1.</_>
+        <_>
+          5 2 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 6 -1.</_>
+        <_>
+          1 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 10 -1.</_>
+        <_>
+          10 5 10 5 2.</_>
+        <_>
+          0 10 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 7 -1.</_>
+        <_>
+          6 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 14 6 -1.</_>
+        <_>
+          11 6 7 3 2.</_>
+        <_>
+          4 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 8 -1.</_>
+        <_>
+          5 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          14 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 13 2 -1.</_>
+        <_>
+          2 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 10 6 -1.</_>
+        <_>
+          1 6 5 3 2.</_>
+        <_>
+          6 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          14 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          3 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 17 -1.</_>
+        <_>
+          2 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 16 -1.</_>
+        <_>
+          2 4 3 8 2.</_>
+        <_>
+          5 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          10 6 5 4 2.</_>
+        <_>
+          5 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 8 -1.</_>
+        <_>
+          4 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 5 -1.</_>
+        <_>
+          8 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 18 -1.</_>
+        <_>
+          11 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 5 -1.</_>
+        <_>
+          10 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 4 -1.</_>
+        <_>
+          4 6 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 16 4 -1.</_>
+        <_>
+          11 15 8 2 2.</_>
+        <_>
+          3 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 16 4 -1.</_>
+        <_>
+          1 15 8 2 2.</_>
+        <_>
+          9 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 9 -1.</_>
+        <_>
+          6 14 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 13 3 -1.</_>
+        <_>
+          4 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 5 9 -1.</_>
+        <_>
+          0 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 4 -1.</_>
+        <_>
+          12 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 4 -1.</_>
+        <_>
+          0 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 6 -1.</_>
+        <_>
+          5 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 9 -1.</_>
+        <_>
+          3 9 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 9 -1.</_>
+        <_>
+          5 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 17 -1.</_>
+        <_>
+          2 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 16 -1.</_>
+        <_>
+          12 0 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 16 -1.</_>
+        <_>
+          4 0 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 6 -1.</_>
+        <_>
+          5 9 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 14 -1.</_>
+        <_>
+          8 4 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          18 5 2 7 2.</_>
+        <_>
+          16 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 8 -1.</_>
+        <_>
+          6 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 3 -1.</_>
+        <_>
+          5 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 3 -1.</_>
+        <_>
+          3 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 10 6 -1.</_>
+        <_>
+          8 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 19 -1.</_>
+        <_>
+          14 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 19 -1.</_>
+        <_>
+          5 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 9 -1.</_>
+        <_>
+          7 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 15 -1.</_>
+        <_>
+          6 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 7 -1.</_>
+        <_>
+          16 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 12 -1.</_>
+        <_>
+          2 4 7 6 2.</_>
+        <_>
+          9 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 12 5 -1.</_>
+        <_>
+          4 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 14 -1.</_>
+        <_>
+          0 6 2 7 2.</_>
+        <_>
+          2 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 8 6 -1.</_>
+        <_>
+          11 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 12 -1.</_>
+        <_>
+          7 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 12 -1.</_>
+        <_>
+          0 5 15 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 10 -1.</_>
+        <_>
+          7 8 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 16 -1.</_>
+        <_>
+          6 4 2 8 2.</_>
+        <_>
+          8 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 4 -1.</_>
+        <_>
+          7 4 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 6 -1.</_>
+        <_>
+          0 3 6 3 2.</_>
+        <_>
+          6 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 10 -1.</_>
+        <_>
+          16 1 4 5 2.</_>
+        <_>
+          12 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 10 -1.</_>
+        <_>
+          0 1 4 5 2.</_>
+        <_>
+          4 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 8 -1.</_>
+        <_>
+          10 12 4 4 2.</_>
+        <_>
+          6 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 12 -1.</_>
+        <_>
+          5 8 4 6 2.</_>
+        <_>
+          9 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 6 -1.</_>
+        <_>
+          3 11 7 3 2.</_>
+        <_>
+          10 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 12 -1.</_>
+        <_>
+          11 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 14 -1.</_>
+        <_>
+          7 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 12 -1.</_>
+        <_>
+          7 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 7 -1.</_>
+        <_>
+          4 11 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 6 -1.</_>
+        <_>
+          11 6 6 3 2.</_>
+        <_>
+          5 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 11 7 2 2.</_>
+        <_>
+          10 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 10 -1.</_>
+        <_>
+          4 0 6 5 2.</_>
+        <_>
+          10 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 15 -1.</_>
+        <_>
+          8 5 6 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 14 3 -1.</_>
+        <_>
+          1 13 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 16 3 -1.</_>
+        <_>
+          10 17 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 9 -1.</_>
+        <_>
+          9 8 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 12 -1.</_>
+        <_>
+          10 3 6 6 2.</_>
+        <_>
+          4 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 20 -1.</_>
+        <_>
+          3 0 3 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 2 -1.</_>
+        <_>
+          3 14 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 4 -1.</_>
+        <_>
+          13 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 12 -1.</_>
+        <_>
+          15 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 12 -1.</_>
+        <_>
+          3 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 12 -1.</_>
+        <_>
+          4 12 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 12 -1.</_>
+        <_>
+          3 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 13 -1.</_>
+        <_>
+          14 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 13 -1.</_>
+        <_>
+          5 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 14 -1.</_>
+        <_>
+          17 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 14 -1.</_>
+        <_>
+          2 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 14 3 -1.</_>
+        <_>
+          6 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 14 3 -1.</_>
+        <_>
+          0 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 14 6 -1.</_>
+        <_>
+          11 6 7 3 2.</_>
+        <_>
+          4 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 14 6 -1.</_>
+        <_>
+          2 6 7 3 2.</_>
+        <_>
+          9 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 16 -1.</_>
+        <_>
+          3 1 5 8 2.</_>
+        <_>
+          8 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 12 -1.</_>
+        <_>
+          10 7 7 6 2.</_>
+        <_>
+          3 13 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 13 6 -1.</_>
+        <_>
+          2 5 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 6 -1.</_>
+        <_>
+          14 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 6 -1.</_>
+        <_>
+          0 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 14 -1.</_>
+        <_>
+          4 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 3 -1.</_>
+        <_>
+          7 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 13 2 -1.</_>
+        <_>
+          4 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 6 -1.</_>
+        <_>
+          2 1 8 3 2.</_>
+        <_>
+          10 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 9 -1.</_>
+        <_>
+          9 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 8 8 -1.</_>
+        <_>
+          2 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 6 -1.</_>
+        <_>
+          13 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 14 2 -1.</_>
+        <_>
+          1 16 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 6 -1.</_>
+        <_>
+          7 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 10 -1.</_>
+        <_>
+          5 5 3 5 2.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 4 -1.</_>
+        <_>
+          5 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 20 -1.</_>
+        <_>
+          7 0 6 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 9 7 -1.</_>
+        <_>
+          3 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 10 -1.</_>
+        <_>
+          0 8 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 12 -1.</_>
+        <_>
+          9 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 4 -1.</_>
+        <_>
+          3 18 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          5 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 3 -1.</_>
+        <_>
+          6 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 6 -1.</_>
+        <_>
+          0 2 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 2 -1.</_>
+        <_>
+          2 4 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 12 -1.</_>
+        <_>
+          7 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 10 -1.</_>
+        <_>
+          12 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 2 -1.</_>
+        <_>
+          0 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          7 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 4 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          10 11 7 2 2.</_>
+        <_>
+          3 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 4 -1.</_>
+        <_>
+          3 10 7 2 2.</_>
+        <_>
+          10 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 3 -1.</_>
+        <_>
+          6 7 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 13 -1.</_>
+        <_>
+          10 3 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 4 -1.</_>
+        <_>
+          12 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 4 -1.</_>
+        <_>
+          1 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 13 3 -1.</_>
+        <_>
+          1 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 9 -1.</_>
+        <_>
+          4 0 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          0 3 10 2 2.</_>
+        <_>
+          10 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 6 -1.</_>
+        <_>
+          12 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 16 -1.</_>
+        <_>
+          7 1 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 19 -1.</_>
+        <_>
+          10 0 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 18 -1.</_>
+        <_>
+          9 0 7 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 9 -1.</_>
+        <_>
+          9 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 19 -1.</_>
+        <_>
+          5 0 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 14 -1.</_>
+        <_>
+          15 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 14 -1.</_>
+        <_>
+          4 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 13 3 -1.</_>
+        <_>
+          0 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 9 -1.</_>
+        <_>
+          12 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 8 -1.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 6 -1.</_>
+        <_>
+          0 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 8 -1.</_>
+        <_>
+          2 5 8 4 2.</_>
+        <_>
+          10 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 8 -1.</_>
+        <_>
+          16 3 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 10 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 8 -1.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 7 -1.</_>
+        <_>
+          2 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 6 -1.</_>
+        <_>
+          5 4 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 8 -1.</_>
+        <_>
+          14 4 4 4 2.</_>
+        <_>
+          10 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 8 -1.</_>
+        <_>
+          14 4 4 4 2.</_>
+        <_>
+          10 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 8 8 -1.</_>
+        <_>
+          2 4 4 4 2.</_>
+        <_>
+          6 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 20 -1.</_>
+        <_>
+          13 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 7 6 -1.</_>
+        <_>
+          3 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 4 -1.</_>
+        <_>
+          8 2 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 10 -1.</_>
+        <_>
+          6 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 3 -1.</_>
+        <_>
+          4 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 3 -1.</_>
+        <_>
+          8 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 20 -1.</_>
+        <_>
+          13 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 3 -1.</_>
+        <_>
+          2 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 20 -1.</_>
+        <_>
+          13 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 20 -1.</_>
+        <_>
+          6 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 8 -1.</_>
+        <_>
+          10 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 8 -1.</_>
+        <_>
+          5 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 7 -1.</_>
+        <_>
+          13 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 7 -1.</_>
+        <_>
+          5 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 13 -1.</_>
+        <_>
+          9 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 10 -1.</_>
+        <_>
+          3 1 3 5 2.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 12 -1.</_>
+        <_>
+          4 12 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 3 -1.</_>
+        <_>
+          4 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 3 -1.</_>
+        <_>
+          1 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 13 2 -1.</_>
+        <_>
+          6 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 16 -1.</_>
+        <_>
+          6 11 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 9 -1.</_>
+        <_>
+          10 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 9 -1.</_>
+        <_>
+          8 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 13 -1.</_>
+        <_>
+          11 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 13 -1.</_>
+        <_>
+          8 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 6 -1.</_>
+        <_>
+          0 14 6 3 2.</_>
+        <_>
+          6 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 5 6 -1.</_>
+        <_>
+          14 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 5 6 -1.</_>
+        <_>
+          1 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 6 -1.</_>
+        <_>
+          0 10 10 3 2.</_>
+        <_>
+          10 13 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          10 5 2 7 2.</_>
+        <_>
+          8 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 8 -1.</_>
+        <_>
+          6 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 9 -1.</_>
+        <_>
+          13 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 12 -1.</_>
+        <_>
+          5 0 5 6 2.</_>
+        <_>
+          10 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 7 -1.</_>
+        <_>
+          12 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 5 9 -1.</_>
+        <_>
+          2 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          0 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 18 -1.</_>
+        <_>
+          3 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 6 -1.</_>
+        <_>
+          15 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 6 -1.</_>
+        <_>
+          2 4 7 3 2.</_>
+        <_>
+          9 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 5 12 -1.</_>
+        <_>
+          3 9 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 17 15 -1.</_>
+        <_>
+          2 9 17 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 12 -1.</_>
+        <_>
+          3 4 13 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          2 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 6 -1.</_>
+        <_>
+          8 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 9 -1.</_>
+        <_>
+          6 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 7 -1.</_>
+        <_>
+          12 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 4 -1.</_>
+        <_>
+          6 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 9 -1.</_>
+        <_>
+          5 4 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 12 -1.</_>
+        <_>
+          6 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 10 -1.</_>
+        <_>
+          12 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 9 4 -1.</_>
+        <_>
+          3 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 5 9 -1.</_>
+        <_>
+          4 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 5 -1.</_>
+        <_>
+          7 7 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 8 -1.</_>
+        <_>
+          8 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 8 -1.</_>
+        <_>
+          12 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 2 -1.</_>
+        <_>
+          7 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 5 -1.</_>
+        <_>
+          6 4 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 11 -1.</_>
+        <_>
+          12 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 11 -1.</_>
+        <_>
+          5 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 10 -1.</_>
+        <_>
+          12 9 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 10 -1.</_>
+        <_>
+          5 9 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 9 -1.</_>
+        <_>
+          9 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 15 -1.</_>
+        <_>
+          7 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 10 6 -1.</_>
+        <_>
+          11 12 5 3 2.</_>
+        <_>
+          6 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 15 3 -1.</_>
+        <_>
+          5 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 10 -1.</_>
+        <_>
+          14 10 3 5 2.</_>
+        <_>
+          11 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 6 -1.</_>
+        <_>
+          4 12 5 3 2.</_>
+        <_>
+          9 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 5 -1.</_>
+        <_>
+          6 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 6 -1.</_>
+        <_>
+          2 3 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 9 6 -1.</_>
+        <_>
+          2 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 7 -1.</_>
+        <_>
+          9 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 6 -1.</_>
+        <_>
+          4 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 10 -1.</_>
+        <_>
+          15 2 3 5 2.</_>
+        <_>
+          12 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 8 -1.</_>
+        <_>
+          4 10 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 10 -1.</_>
+        <_>
+          2 2 3 5 2.</_>
+        <_>
+          5 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 14 2 -1.</_>
+        <_>
+          6 16 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 5 -1.</_>
+        <_>
+          9 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 6 -1.</_>
+        <_>
+          1 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 2 -1.</_>
+        <_>
+          2 9 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 2 -1.</_>
+        <_>
+          2 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 7 -1.</_>
+        <_>
+          11 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          8 14 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 7 -1.</_>
+        <_>
+          11 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 7 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 14 -1.</_>
+        <_>
+          9 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 15 3 -1.</_>
+        <_>
+          2 18 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 7 -1.</_>
+        <_>
+          16 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 7 -1.</_>
+        <_>
+          7 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 7 -1.</_>
+        <_>
+          16 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          2 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 13 2 -1.</_>
+        <_>
+          4 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 14 -1.</_>
+        <_>
+          2 2 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 13 -1.</_>
+        <_>
+          15 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 13 -1.</_>
+        <_>
+          3 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          10 3 10 2 2.</_>
+        <_>
+          0 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 11 -1.</_>
+        <_>
+          6 7 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 6 -1.</_>
+        <_>
+          7 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 12 -1.</_>
+        <_>
+          10 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 11 4 -1.</_>
+        <_>
+          4 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 6 -1.</_>
+        <_>
+          10 7 5 3 2.</_>
+        <_>
+          5 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 10 -1.</_>
+        <_>
+          0 5 9 5 2.</_>
+        <_>
+          9 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 4 -1.</_>
+        <_>
+          10 0 10 2 2.</_>
+        <_>
+          0 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 3 -1.</_>
+        <_>
+          2 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 2 -1.</_>
+        <_>
+          2 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          7 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 9 14 -1.</_>
+        <_>
+          13 6 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 9 14 -1.</_>
+        <_>
+          4 6 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 10 -1.</_>
+        <_>
+          8 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 8 -1.</_>
+        <_>
+          0 7 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 14 2 -1.</_>
+        <_>
+          4 10 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 6 -1.</_>
+        <_>
+          3 15 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 9 -1.</_>
+        <_>
+          6 14 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 13 9 -1.</_>
+        <_>
+          1 14 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 4 -1.</_>
+        <_>
+          7 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          6 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 10 -1.</_>
+        <_>
+          9 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 2 -1.</_>
+        <_>
+          0 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 8 -1.</_>
+        <_>
+          11 1 4 4 2.</_>
+        <_>
+          7 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 12 -1.</_>
+        <_>
+          5 7 3 6 2.</_>
+        <_>
+          8 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 3 -1.</_>
+        <_>
+          0 15 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 5 -1.</_>
+        <_>
+          6 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          7 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 19 -1.</_>
+        <_>
+          10 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 6 -1.</_>
+        <_>
+          0 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 10 18 -1.</_>
+        <_>
+          14 2 5 9 2.</_>
+        <_>
+          9 11 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 8 4 -1.</_>
+        <_>
+          6 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          9 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 19 -1.</_>
+        <_>
+          8 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 5 -1.</_>
+        <_>
+          3 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 18 -1.</_>
+        <_>
+          18 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 18 -1.</_>
+        <_>
+          18 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 18 -1.</_>
+        <_>
+          1 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 7 15 -1.</_>
+        <_>
+          7 9 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          7 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 16 -1.</_>
+        <_>
+          18 0 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 14 -1.</_>
+        <_>
+          1 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 5 -1.</_>
+        <_>
+          14 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 5 -1.</_>
+        <_>
+          3 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 4 -1.</_>
+        <_>
+          10 13 9 2 2.</_>
+        <_>
+          1 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 9 -1.</_>
+        <_>
+          7 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 13 -1.</_>
+        <_>
+          8 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 10 -1.</_>
+        <_>
+          5 0 3 5 2.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 8 -1.</_>
+        <_>
+          3 4 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 10 -1.</_>
+        <_>
+          8 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 15 2 -1.</_>
+        <_>
+          2 19 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 7 -1.</_>
+        <_>
+          10 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 4 -1.</_>
+        <_>
+          0 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 4 -1.</_>
+        <_>
+          3 16 7 2 2.</_>
+        <_>
+          10 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 12 -1.</_>
+        <_>
+          9 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 4 -1.</_>
+        <_>
+          6 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 10 -1.</_>
+        <_>
+          16 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 10 -1.</_>
+        <_>
+          6 9 4 5 2.</_>
+        <_>
+          10 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 10 -1.</_>
+        <_>
+          16 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 5 6 -1.</_>
+        <_>
+          1 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 6 -1.</_>
+        <_>
+          4 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 7 -1.</_>
+        <_>
+          9 7 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 11 -1.</_>
+        <_>
+          7 6 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 7 -1.</_>
+        <_>
+          10 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 7 -1.</_>
+        <_>
+          8 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 15 -1.</_>
+        <_>
+          11 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 10 -1.</_>
+        <_>
+          2 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          15 0 5 3 2.</_>
+        <_>
+          10 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 3 -1.</_>
+        <_>
+          1 1 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          7 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 0 5 3 2.</_>
+        <_>
+          5 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 6 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          9 6 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 18 -1.</_>
+        <_>
+          12 0 3 9 2.</_>
+        <_>
+          9 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 2 -1.</_>
+        <_>
+          10 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 6 -1.</_>
+        <_>
+          13 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 12 -1.</_>
+        <_>
+          6 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 6 -1.</_>
+        <_>
+          3 1 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 7 4 -1.</_>
+        <_>
+          9 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 15 3 -1.</_>
+        <_>
+          0 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 8 -1.</_>
+        <_>
+          11 0 4 4 2.</_>
+        <_>
+          7 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          0 3 10 2 2.</_>
+        <_>
+          10 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 3 -1.</_>
+        <_>
+          10 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 7 4 -1.</_>
+        <_>
+          4 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 3 -1.</_>
+        <_>
+          10 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 12 6 -1.</_>
+        <_>
+          2 11 6 3 2.</_>
+        <_>
+          8 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 10 -1.</_>
+        <_>
+          0 5 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 6 -1.</_>
+        <_>
+          12 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 6 -1.</_>
+        <_>
+          12 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 6 -1.</_>
+        <_>
+          0 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 12 -1.</_>
+        <_>
+          16 0 4 6 2.</_>
+        <_>
+          12 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 14 -1.</_>
+        <_>
+          7 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 9 -1.</_>
+        <_>
+          7 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 13 3 -1.</_>
+        <_>
+          5 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 8 8 -1.</_>
+        <_>
+          2 4 4 4 2.</_>
+        <_>
+          6 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 16 -1.</_>
+        <_>
+          15 4 4 8 2.</_>
+        <_>
+          11 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 16 -1.</_>
+        <_>
+          1 4 4 8 2.</_>
+        <_>
+          5 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 8 -1.</_>
+        <_>
+          4 4 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 6 -1.</_>
+        <_>
+          5 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 2 -1.</_>
+        <_>
+          5 3 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 3 -1.</_>
+        <_>
+          10 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 6 -1.</_>
+        <_>
+          1 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 3 -1.</_>
+        <_>
+          10 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 7 6 -1.</_>
+        <_>
+          0 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 8 -1.</_>
+        <_>
+          1 1 9 4 2.</_>
+        <_>
+          10 5 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 4 -1.</_>
+        <_>
+          0 15 7 2 2.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 18 -1.</_>
+        <_>
+          0 2 2 9 2.</_>
+        <_>
+          2 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 11 -1.</_>
+        <_>
+          10 6 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          10 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 7 -1.</_>
+        <_>
+          9 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 4 -1.</_>
+        <_>
+          12 2 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 6 -1.</_>
+        <_>
+          13 1 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 7 -1.</_>
+        <_>
+          3 3 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 8 -1.</_>
+        <_>
+          13 12 5 4 2.</_>
+        <_>
+          8 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 10 -1.</_>
+        <_>
+          2 9 6 5 2.</_>
+        <_>
+          8 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 6 -1.</_>
+        <_>
+          1 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 3 -1.</_>
+        <_>
+          7 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          0 1 9 2 2.</_>
+        <_>
+          9 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 8 -1.</_>
+        <_>
+          12 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 8 -1.</_>
+        <_>
+          6 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 10 -1.</_>
+        <_>
+          12 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 16 -1.</_>
+        <_>
+          7 9 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 5 8 -1.</_>
+        <_>
+          14 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 10 -1.</_>
+        <_>
+          5 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          3 14 7 2 2.</_>
+        <_>
+          10 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 13 -1.</_>
+        <_>
+          10 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 5 8 -1.</_>
+        <_>
+          14 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 5 8 -1.</_>
+        <_>
+          1 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 6 -1.</_>
+        <_>
+          14 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 3 -1.</_>
+        <_>
+          0 1 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 8 8 -1.</_>
+        <_>
+          14 12 4 4 2.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 8 -1.</_>
+        <_>
+          2 12 4 4 2.</_>
+        <_>
+          6 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 3 -1.</_>
+        <_>
+          3 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 13 -1.</_>
+        <_>
+          7 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 17 3 -1.</_>
+        <_>
+          3 10 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 3 -1.</_>
+        <_>
+          2 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 13 -1.</_>
+        <_>
+          14 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 9 6 -1.</_>
+        <_>
+          12 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 4 -1.</_>
+        <_>
+          10 10 7 2 2.</_>
+        <_>
+          3 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 6 -1.</_>
+        <_>
+          1 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 5 -1.</_>
+        <_>
+          9 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 9 6 -1.</_>
+        <_>
+          11 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 13 6 -1.</_>
+        <_>
+          4 4 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          0 5 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 15 8 -1.</_>
+        <_>
+          7 6 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 4 -1.</_>
+        <_>
+          8 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          10 10 4 4 2.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 20 -1.</_>
+        <_>
+          8 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          10 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 2 -1.</_>
+        <_>
+          3 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 3 -1.</_>
+        <_>
+          7 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 14 -1.</_>
+        <_>
+          4 6 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 9 5 -1.</_>
+        <_>
+          12 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 9 5 -1.</_>
+        <_>
+          5 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 7 -1.</_>
+        <_>
+          10 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 7 -1.</_>
+        <_>
+          8 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 8 -1.</_>
+        <_>
+          12 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 8 -1.</_>
+        <_>
+          15 12 4 4 2.</_>
+        <_>
+          11 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 8 8 -1.</_>
+        <_>
+          1 12 4 4 2.</_>
+        <_>
+          5 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 5 -1.</_>
+        <_>
+          12 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 5 -1.</_>
+        <_>
+          5 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          10 5 6 3 2.</_>
+        <_>
+          4 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 10 3 -1.</_>
+        <_>
+          7 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 8 8 -1.</_>
+        <_>
+          14 3 4 4 2.</_>
+        <_>
+          10 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 8 -1.</_>
+        <_>
+          2 3 4 4 2.</_>
+        <_>
+          6 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 3 -1.</_>
+        <_>
+          8 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 8 -1.</_>
+        <_>
+          4 1 4 4 2.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 9 -1.</_>
+        <_>
+          10 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 7 -1.</_>
+        <_>
+          5 13 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 14 -1.</_>
+        <_>
+          15 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 3 -1.</_>
+        <_>
+          6 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 7 -1.</_>
+        <_>
+          12 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 10 -1.</_>
+        <_>
+          0 9 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 3 -1.</_>
+        <_>
+          6 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 13 2 -1.</_>
+        <_>
+          2 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 8 -1.</_>
+        <_>
+          5 4 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 3 10 -1.</_>
+        <_>
+          1 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 4 7 -1.</_>
+        <_>
+          14 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 6 -1.</_>
+        <_>
+          1 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 4 7 -1.</_>
+        <_>
+          14 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 7 -1.</_>
+        <_>
+          4 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 6 -1.</_>
+        <_>
+          1 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 7 -1.</_>
+        <_>
+          12 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 7 -1.</_>
+        <_>
+          6 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_>
+        <_>
+          10 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          4 17 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 4 -1.</_>
+        <_>
+          6 3 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 3 -1.</_>
+        <_>
+          8 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 4 -1.</_>
+        <_>
+          6 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 11 -1.</_>
+        <_>
+          12 5 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          10 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 4 -1.</_>
+        <_>
+          4 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 10 -1.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 6 -1.</_>
+        <_>
+          1 14 5 3 2.</_>
+        <_>
+          6 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          12 4 6 6 2.</_>
+        <_>
+          6 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 12 -1.</_>
+        <_>
+          2 4 6 6 2.</_>
+        <_>
+          8 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 8 -1.</_>
+        <_>
+          10 5 7 4 2.</_>
+        <_>
+          3 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 7 -1.</_>
+        <_>
+          2 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 6 -1.</_>
+        <_>
+          7 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 6 -1.</_>
+        <_>
+          2 15 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 3 13 -1.</_>
+        <_>
+          17 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 3 13 -1.</_>
+        <_>
+          2 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 5 9 -1.</_>
+        <_>
+          11 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 13 3 -1.</_>
+        <_>
+          7 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 5 9 -1.</_>
+        <_>
+          11 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 9 -1.</_>
+        <_>
+          4 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 4 -1.</_>
+        <_>
+          1 2 9 2 2.</_>
+        <_>
+          10 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 6 -1.</_>
+        <_>
+          14 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 6 -1.</_>
+        <_>
+          0 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 6 -1.</_>
+        <_>
+          4 3 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 13 3 -1.</_>
+        <_>
+          2 8 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 2 -1.</_>
+        <_>
+          3 8 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 8 -1.</_>
+        <_>
+          11 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 7 -1.</_>
+        <_>
+          8 0 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 7 -1.</_>
+        <_>
+          11 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 18 -1.</_>
+        <_>
+          7 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 13 -1.</_>
+        <_>
+          13 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 14 2 -1.</_>
+        <_>
+          2 19 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 7 -1.</_>
+        <_>
+          11 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 14 -1.</_>
+        <_>
+          12 4 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 14 -1.</_>
+        <_>
+          7 4 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 3 -1.</_>
+        <_>
+          7 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 9 -1.</_>
+        <_>
+          5 8 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 8 -1.</_>
+        <_>
+          15 5 4 4 2.</_>
+        <_>
+          11 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 8 -1.</_>
+        <_>
+          5 5 4 4 2.</_>
+        <_>
+          9 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 20 -1.</_>
+        <_>
+          10 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 13 -1.</_>
+        <_>
+          8 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 6 -1.</_>
+        <_>
+          0 3 5 3 2.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 4 -1.</_>
+        <_>
+          9 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 10 -1.</_>
+        <_>
+          5 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 8 -1.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 5 -1.</_>
+        <_>
+          7 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 12 -1.</_>
+        <_>
+          7 6 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 8 -1.</_>
+        <_>
+          3 4 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 13 3 -1.</_>
+        <_>
+          4 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 5 -1.</_>
+        <_>
+          6 9 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 2 -1.</_>
+        <_>
+          5 8 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 14 4 -1.</_>
+        <_>
+          2 11 7 2 2.</_>
+        <_>
+          9 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 6 -1.</_>
+        <_>
+          4 10 6 3 2.</_>
+        <_>
+          10 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 10 -1.</_>
+        <_>
+          14 8 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          0 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 5 -1.</_>
+        <_>
+          14 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 13 2 -1.</_>
+        <_>
+          3 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 5 -1.</_>
+        <_>
+          3 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 8 -1.</_>
+        <_>
+          11 1 4 4 2.</_>
+        <_>
+          7 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 14 -1.</_>
+        <_>
+          17 4 2 7 2.</_>
+        <_>
+          15 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 14 -1.</_>
+        <_>
+          17 4 2 7 2.</_>
+        <_>
+          15 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 18 -1.</_>
+        <_>
+          1 2 2 9 2.</_>
+        <_>
+          3 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 9 -1.</_>
+        <_>
+          3 14 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 3 -1.</_>
+        <_>
+          0 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 15 -1.</_>
+        <_>
+          9 10 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 9 -1.</_>
+        <_>
+          0 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          16 0 3 5 2.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          16 0 3 5 2.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 7 -1.</_>
+        <_>
+          12 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 16 -1.</_>
+        <_>
+          7 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 17 -1.</_>
+        <_>
+          6 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 20 -1.</_>
+        <_>
+          8 0 6 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 6 -1.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 5 16 -1.</_>
+        <_>
+          9 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 9 -1.</_>
+        <_>
+          3 7 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 9 -1.</_>
+        <_>
+          15 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 10 6 -1.</_>
+        <_>
+          5 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 17 6 -1.</_>
+        <_>
+          2 16 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 6 -1.</_>
+        <_>
+          3 4 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 15 -1.</_>
+        <_>
+          2 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 10 -1.</_>
+        <_>
+          10 4 9 5 2.</_>
+        <_>
+          1 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 13 -1.</_>
+        <_>
+          1 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 12 -1.</_>
+        <_>
+          13 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          0 2 10 2 2.</_>
+        <_>
+          10 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 7 -1.</_>
+        <_>
+          9 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 12 -1.</_>
+        <_>
+          7 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 14 -1.</_>
+        <_>
+          10 0 3 7 2.</_>
+        <_>
+          7 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 8 -1.</_>
+        <_>
+          5 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 8 -1.</_>
+        <_>
+          3 4 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 5 10 -1.</_>
+        <_>
+          9 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 14 -1.</_>
+        <_>
+          8 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 5 -1.</_>
+        <_>
+          8 15 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 6 -1.</_>
+        <_>
+          1 9 5 3 2.</_>
+        <_>
+          6 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 11 -1.</_>
+        <_>
+          2 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 6 -1.</_>
+        <_>
+          7 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 8 -1.</_>
+        <_>
+          10 4 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 3 10 -1.</_>
+        <_>
+          11 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 10 -1.</_>
+        <_>
+          6 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 9 -1.</_>
+        <_>
+          8 2 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 5 -1.</_>
+        <_>
+          8 15 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 5 -1.</_>
+        <_>
+          6 15 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 9 -1.</_>
+        <_>
+          12 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 8 -1.</_>
+        <_>
+          9 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 14 -1.</_>
+        <_>
+          15 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 14 -1.</_>
+        <_>
+          3 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 13 -1.</_>
+        <_>
+          13 7 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 9 13 -1.</_>
+        <_>
+          4 7 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 12 5 -1.</_>
+        <_>
+          12 15 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 6 -1.</_>
+        <_>
+          10 14 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 3 -1.</_>
+        <_>
+          5 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 6 -1.</_>
+        <_>
+          5 5 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 7 8 -1.</_>
+        <_>
+          7 8 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 9 -1.</_>
+        <_>
+          0 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 3 -1.</_>
+        <_>
+          7 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 7 -1.</_>
+        <_>
+          6 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 9 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 12 -1.</_>
+        <_>
+          4 8 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 5 -1.</_>
+        <_>
+          12 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 5 -1.</_>
+        <_>
+          5 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 14 -1.</_>
+        <_>
+          11 4 5 7 2.</_>
+        <_>
+          6 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 14 -1.</_>
+        <_>
+          4 4 5 7 2.</_>
+        <_>
+          9 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 5 -1.</_>
+        <_>
+          13 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 13 3 -1.</_>
+        <_>
+          3 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 14 4 -1.</_>
+        <_>
+          12 16 7 2 2.</_>
+        <_>
+          5 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 5 12 -1.</_>
+        <_>
+          11 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 5 12 -1.</_>
+        <_>
+          4 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 8 -1.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 14 4 -1.</_>
+        <_>
+          1 16 7 2 2.</_>
+        <_>
+          8 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 13 2 -1.</_>
+        <_>
+          5 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 9 -1.</_>
+        <_>
+          0 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 5 -1.</_>
+        <_>
+          13 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 5 -1.</_>
+        <_>
+          4 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 13 -1.</_>
+        <_>
+          15 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 13 -1.</_>
+        <_>
+          3 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 4 -1.</_>
+        <_>
+          5 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 3 -1.</_>
+        <_>
+          0 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 11 6 -1.</_>
+        <_>
+          7 2 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 4 -1.</_>
+        <_>
+          0 12 10 2 2.</_>
+        <_>
+          10 14 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 5 -1.</_>
+        <_>
+          8 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 14 -1.</_>
+        <_>
+          7 1 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 8 -1.</_>
+        <_>
+          8 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 7 -1.</_>
+        <_>
+          8 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 9 -1.</_>
+        <_>
+          15 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 15 4 -1.</_>
+        <_>
+          2 18 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 5 -1.</_>
+        <_>
+          7 8 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 16 -1.</_>
+        <_>
+          1 4 2 8 2.</_>
+        <_>
+          3 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 10 -1.</_>
+        <_>
+          6 4 3 5 2.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 19 3 -1.</_>
+        <_>
+          1 10 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 12 -1.</_>
+        <_>
+          3 4 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 4 -1.</_>
+        <_>
+          6 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 15 3 -1.</_>
+        <_>
+          0 6 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 13 -1.</_>
+        <_>
+          12 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 14 -1.</_>
+        <_>
+          10 4 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 6 -1.</_>
+        <_>
+          12 0 5 3 2.</_>
+        <_>
+          7 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 7 -1.</_>
+        <_>
+          3 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 13 -1.</_>
+        <_>
+          18 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 6 -1.</_>
+        <_>
+          11 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 10 6 -1.</_>
+        <_>
+          4 0 5 3 2.</_>
+        <_>
+          9 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 2 -1.</_>
+        <_>
+          6 2 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 18 -1.</_>
+        <_>
+          3 9 12 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 10 -1.</_>
+        <_>
+          13 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 10 -1.</_>
+        <_>
+          1 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          10 5 6 6 2.</_>
+        <_>
+          4 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 5 -1.</_>
+        <_>
+          10 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 4 -1.</_>
+        <_>
+          9 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 11 -1.</_>
+        <_>
+          10 9 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 10 -1.</_>
+        <_>
+          11 6 4 5 2.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 6 -1.</_>
+        <_>
+          4 10 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 9 6 -1.</_>
+        <_>
+          11 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 7 6 -1.</_>
+        <_>
+          6 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 16 -1.</_>
+        <_>
+          9 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 9 16 -1.</_>
+        <_>
+          3 10 9 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 10 -1.</_>
+        <_>
+          5 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 10 -1.</_>
+        <_>
+          5 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 12 -1.</_>
+        <_>
+          13 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 6 -1.</_>
+        <_>
+          0 12 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 14 2 -1.</_>
+        <_>
+          6 16 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 7 4 -1.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 11 8 -1.</_>
+        <_>
+          6 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 12 -1.</_>
+        <_>
+          0 8 4 6 2.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 9 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 4 14 -1.</_>
+        <_>
+          2 6 2 7 2.</_>
+        <_>
+          4 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 6 -1.</_>
+        <_>
+          9 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 8 -1.</_>
+        <_>
+          2 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 8 12 -1.</_>
+        <_>
+          13 4 4 6 2.</_>
+        <_>
+          9 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 12 -1.</_>
+        <_>
+          3 4 4 6 2.</_>
+        <_>
+          7 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 8 -1.</_>
+        <_>
+          14 8 5 4 2.</_>
+        <_>
+          9 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 15 2 -1.</_>
+        <_>
+          2 19 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 9 -1.</_>
+        <_>
+          10 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 16 4 -1.</_>
+        <_>
+          8 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 14 -1.</_>
+        <_>
+          14 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 6 -1.</_>
+        <_>
+          9 11 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          8 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 6 -1.</_>
+        <_>
+          3 2 6 3 2.</_>
+        <_>
+          9 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 4 -1.</_>
+        <_>
+          12 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 4 -1.</_>
+        <_>
+          0 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 7 4 -1.</_>
+        <_>
+          2 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 4 7 -1.</_>
+        <_>
+          14 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 15 -1.</_>
+        <_>
+          4 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 7 -1.</_>
+        <_>
+          8 0 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 10 3 -1.</_>
+        <_>
+          10 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 14 -1.</_>
+        <_>
+          8 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 8 4 -1.</_>
+        <_>
+          6 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 3 -1.</_>
+        <_>
+          10 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 5 8 -1.</_>
+        <_>
+          5 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 6 -1.</_>
+        <_>
+          13 1 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 6 -1.</_>
+        <_>
+          4 1 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 4 -1.</_>
+        <_>
+          12 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 7 6 -1.</_>
+        <_>
+          3 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 3 -1.</_>
+        <_>
+          2 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 2 -1.</_>
+        <_>
+          7 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 4 -1.</_>
+        <_>
+          0 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 8 -1.</_>
+        <_>
+          10 6 8 4 2.</_>
+        <_>
+          2 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 7 -1.</_>
+        <_>
+          4 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 2 -1.</_>
+        <_>
+          6 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 6 -1.</_>
+        <_>
+          1 11 9 3 2.</_>
+        <_>
+          10 14 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 5 10 -1.</_>
+        <_>
+          10 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          7 10 3 5 2.</_>
+        <_>
+          10 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 12 -1.</_>
+        <_>
+          6 6 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 5 -1.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 2 -1.</_>
+        <_>
+          3 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 13 -1.</_>
+        <_>
+          16 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 13 -1.</_>
+        <_>
+          2 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 10 -1.</_>
+        <_>
+          12 9 3 5 2.</_>
+        <_>
+          9 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 5 9 -1.</_>
+        <_>
+          1 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 8 12 -1.</_>
+        <_>
+          16 8 4 6 2.</_>
+        <_>
+          12 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 8 -1.</_>
+        <_>
+          10 9 6 4 2.</_>
+        <_>
+          4 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 8 -1.</_>
+        <_>
+          6 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 10 -1.</_>
+        <_>
+          8 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 18 -1.</_>
+        <_>
+          17 2 2 9 2.</_>
+        <_>
+          15 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 20 -1.</_>
+        <_>
+          0 0 10 10 2.</_>
+        <_>
+          10 10 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 3 -1.</_>
+        <_>
+          5 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 4 -1.</_>
+        <_>
+          7 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 5 -1.</_>
+        <_>
+          11 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 5 -1.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 14 3 -1.</_>
+        <_>
+          6 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 8 -1.</_>
+        <_>
+          15 12 4 4 2.</_>
+        <_>
+          11 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 8 8 -1.</_>
+        <_>
+          1 12 4 4 2.</_>
+        <_>
+          5 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 3 -1.</_>
+        <_>
+          8 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 19 -1.</_>
+        <_>
+          10 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          6 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 6 -1.</_>
+        <_>
+          1 14 18 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 6 -1.</_>
+        <_>
+          5 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 8 -1.</_>
+        <_>
+          9 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 3 -1.</_>
+        <_>
+          1 12 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 2 -1.</_>
+        <_>
+          2 2 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 19 3 -1.</_>
+        <_>
+          0 10 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 7 4 -1.</_>
+        <_>
+          9 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 6 -1.</_>
+        <_>
+          0 16 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 6 -1.</_>
+        <_>
+          8 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 6 -1.</_>
+        <_>
+          6 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 12 -1.</_>
+        <_>
+          0 6 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 13 -1.</_>
+        <_>
+          14 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 13 6 -1.</_>
+        <_>
+          3 3 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 8 -1.</_>
+        <_>
+          7 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 14 -1.</_>
+        <_>
+          6 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 6 -1.</_>
+        <_>
+          7 2 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 7 4 -1.</_>
+        <_>
+          4 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 10 16 -1.</_>
+        <_>
+          9 12 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 16 12 -1.</_>
+        <_>
+          1 3 8 6 2.</_>
+        <_>
+          9 9 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 16 -1.</_>
+        <_>
+          11 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 13 3 -1.</_>
+        <_>
+          0 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 6 -1.</_>
+        <_>
+          7 9 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 8 -1.</_>
+        <_>
+          6 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 10 -1.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 12 -1.</_>
+        <_>
+          8 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 15 3 -1.</_>
+        <_>
+          4 6 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 9 4 -1.</_>
+        <_>
+          2 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 10 -1.</_>
+        <_>
+          8 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 10 -1.</_>
+        <_>
+          8 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 11 8 -1.</_>
+        <_>
+          5 11 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 6 6 -1.</_>
+        <_>
+          1 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 5 18 -1.</_>
+        <_>
+          14 8 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 5 18 -1.</_>
+        <_>
+          1 8 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 13 -1.</_>
+        <_>
+          14 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 13 -1.</_>
+        <_>
+          5 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 7 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 4 -1.</_>
+        <_>
+          2 1 8 2 2.</_>
+        <_>
+          10 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 6 -1.</_>
+        <_>
+          11 1 5 3 2.</_>
+        <_>
+          6 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 15 -1.</_>
+        <_>
+          4 5 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 6 -1.</_>
+        <_>
+          4 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 14 -1.</_>
+        <_>
+          7 0 3 7 2.</_>
+        <_>
+          10 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 10 -1.</_>
+        <_>
+          7 10 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 2 -1.</_>
+        <_>
+          0 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 15 -1.</_>
+        <_>
+          0 5 20 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 3 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 4 -1.</_>
+        <_>
+          6 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 7 -1.</_>
+        <_>
+          5 0 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 8 -1.</_>
+        <_>
+          10 0 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 8 -1.</_>
+        <_>
+          5 0 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 4 -1.</_>
+        <_>
+          5 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 4 -1.</_>
+        <_>
+          9 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 9 -1.</_>
+        <_>
+          7 0 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 2 -1.</_>
+        <_>
+          6 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 8 -1.</_>
+        <_>
+          8 0 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 14 -1.</_>
+        <_>
+          14 1 2 7 2.</_>
+        <_>
+          12 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 3 -1.</_>
+        <_>
+          6 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 6 -1.</_>
+        <_>
+          7 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 14 -1.</_>
+        <_>
+          6 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 5 -1.</_>
+        <_>
+          9 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 5 -1.</_>
+        <_>
+          6 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 7 -1.</_>
+        <_>
+          9 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 6 -1.</_>
+        <_>
+          12 1 5 3 2.</_>
+        <_>
+          7 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 13 2 -1.</_>
+        <_>
+          2 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 4 -1.</_>
+        <_>
+          10 2 9 2 2.</_>
+        <_>
+          1 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 9 5 -1.</_>
+        <_>
+          8 8 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 18 -1.</_>
+        <_>
+          17 2 2 9 2.</_>
+        <_>
+          15 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 18 -1.</_>
+        <_>
+          1 2 2 9 2.</_>
+        <_>
+          3 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_>
+        <_>
+          10 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 17 6 -1.</_>
+        <_>
+          1 9 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 4 -1.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 6 -1.</_>
+        <_>
+          1 8 5 3 2.</_>
+        <_>
+          6 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_>
+        <_>
+          10 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_>
+        <_>
+          5 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 19 -1.</_>
+        <_>
+          8 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 19 -1.</_>
+        <_>
+          6 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 13 -1.</_>
+        <_>
+          5 1 6 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 9 5 -1.</_>
+        <_>
+          8 1 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 3 -1.</_>
+        <_>
+          0 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 16 -1.</_>
+        <_>
+          10 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 5 -1.</_>
+        <_>
+          8 12 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 16 -1.</_>
+        <_>
+          10 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 16 -1.</_>
+        <_>
+          8 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 7 -1.</_>
+        <_>
+          6 1 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          10 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 9 9 -1.</_>
+        <_>
+          14 8 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 9 -1.</_>
+        <_>
+          3 8 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 5 -1.</_>
+        <_>
+          0 4 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 2 -1.</_>
+        <_>
+          1 13 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 9 -1.</_>
+        <_>
+          11 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 9 -1.</_>
+        <_>
+          4 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 4 -1.</_>
+        <_>
+          10 11 10 2 2.</_>
+        <_>
+          0 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 15 -1.</_>
+        <_>
+          15 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 15 -1.</_>
+        <_>
+          4 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 7 4 -1.</_>
+        <_>
+          9 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 5 -1.</_>
+        <_>
+          8 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 9 -1.</_>
+        <_>
+          14 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 9 -1.</_>
+        <_>
+          4 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 8 8 -1.</_>
+        <_>
+          13 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_>
+        <_>
+          3 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 7 4 -1.</_>
+        <_>
+          4 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 8 -1.</_>
+        <_>
+          9 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 10 -1.</_>
+        <_>
+          5 12 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 8 -1.</_>
+        <_>
+          5 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 10 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 5 -1.</_>
+        <_>
+          5 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 14 -1.</_>
+        <_>
+          8 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 17 6 -1.</_>
+        <_>
+          1 4 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          9 5 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 6 -1.</_>
+        <_>
+          8 4 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          12 6 7 3 2.</_>
+        <_>
+          5 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 6 -1.</_>
+        <_>
+          1 6 7 3 2.</_>
+        <_>
+          8 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 15 -1.</_>
+        <_>
+          0 10 20 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 14 -1.</_>
+        <_>
+          14 5 2 7 2.</_>
+        <_>
+          12 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          2 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 13 -1.</_>
+        <_>
+          7 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 20 -1.</_>
+        <_>
+          7 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 12 -1.</_>
+        <_>
+          11 5 4 6 2.</_>
+        <_>
+          7 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 12 -1.</_>
+        <_>
+          4 5 5 6 2.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 14 -1.</_>
+        <_>
+          14 5 2 7 2.</_>
+        <_>
+          12 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 14 -1.</_>
+        <_>
+          4 5 2 7 2.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 9 -1.</_>
+        <_>
+          14 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 2 -1.</_>
+        <_>
+          3 9 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 3 -1.</_>
+        <_>
+          0 16 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 6 -1.</_>
+        <_>
+          1 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 19 -1.</_>
+        <_>
+          7 0 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 10 -1.</_>
+        <_>
+          3 9 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 9 4 -1.</_>
+        <_>
+          11 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 10 -1.</_>
+        <_>
+          8 3 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 10 -1.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 4 -1.</_>
+        <_>
+          0 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 14 3 -1.</_>
+        <_>
+          6 13 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 6 -1.</_>
+        <_>
+          11 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 15 -1.</_>
+        <_>
+          7 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 13 2 -1.</_>
+        <_>
+          4 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 12 -1.</_>
+        <_>
+          2 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 15 -1.</_>
+        <_>
+          9 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 14 -1.</_>
+        <_>
+          8 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 17 6 -1.</_>
+        <_>
+          2 9 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 9 -1.</_>
+        <_>
+          0 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 14 2 -1.</_>
+        <_>
+          2 10 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 3 -1.</_>
+        <_>
+          5 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 14 -1.</_>
+        <_>
+          6 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 4 -1.</_>
+        <_>
+          11 0 7 2 2.</_>
+        <_>
+          4 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          0 1 10 2 2.</_>
+        <_>
+          10 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 7 6 -1.</_>
+        <_>
+          7 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 10 -1.</_>
+        <_>
+          7 2 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 13 3 -1.</_>
+        <_>
+          1 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 17 -1.</_>
+        <_>
+          18 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 10 -1.</_>
+        <_>
+          0 0 10 5 2.</_>
+        <_>
+          10 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 4 -1.</_>
+        <_>
+          11 8 7 2 2.</_>
+        <_>
+          4 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 6 -1.</_>
+        <_>
+          0 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 4 -1.</_>
+        <_>
+          11 8 7 2 2.</_>
+        <_>
+          4 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 4 -1.</_>
+        <_>
+          2 8 7 2 2.</_>
+        <_>
+          9 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 10 -1.</_>
+        <_>
+          11 4 8 5 2.</_>
+        <_>
+          3 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          6 5 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 13 2 -1.</_>
+        <_>
+          5 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 7 -1.</_>
+        <_>
+          7 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 4 13 -1.</_>
+        <_>
+          11 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 13 -1.</_>
+        <_>
+          7 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 14 3 -1.</_>
+        <_>
+          5 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 14 -1.</_>
+        <_>
+          2 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 15 3 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 16 -1.</_>
+        <_>
+          2 4 3 8 2.</_>
+        <_>
+          5 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 13 -1.</_>
+        <_>
+          13 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 20 -1.</_>
+        <_>
+          4 10 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 9 -1.</_>
+        <_>
+          8 5 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 13 -1.</_>
+        <_>
+          6 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          14 2 3 5 2.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 7 -1.</_>
+        <_>
+          7 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 7 -1.</_>
+        <_>
+          9 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 4 -1.</_>
+        <_>
+          0 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 10 -1.</_>
+        <_>
+          11 7 4 5 2.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 10 -1.</_>
+        <_>
+          5 7 4 5 2.</_>
+        <_>
+          9 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 5 -1.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 13 6 -1.</_>
+        <_>
+          3 16 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          10 12 7 2 2.</_>
+        <_>
+          3 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 6 5 -1.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 13 -1.</_>
+        <_>
+          4 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 8 -1.</_>
+        <_>
+          8 11 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 15 -1.</_>
+        <_>
+          3 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 13 -1.</_>
+        <_>
+          17 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 7 -1.</_>
+        <_>
+          5 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 13 -1.</_>
+        <_>
+          17 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 13 -1.</_>
+        <_>
+          2 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 16 -1.</_>
+        <_>
+          10 1 2 8 2.</_>
+        <_>
+          8 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 9 -1.</_>
+        <_>
+          7 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 8 -1.</_>
+        <_>
+          6 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 5 -1.</_>
+        <_>
+          3 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 7 -1.</_>
+        <_>
+          14 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 12 7 -1.</_>
+        <_>
+          6 11 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 5 -1.</_>
+        <_>
+          10 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 2 -1.</_>
+        <_>
+          2 2 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 4 -1.</_>
+        <_>
+          13 8 7 2 2.</_>
+        <_>
+          6 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          10 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 3 -1.</_>
+        <_>
+          4 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          7 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 11 -1.</_>
+        <_>
+          9 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 11 -1.</_>
+        <_>
+          9 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 15 8 -1.</_>
+        <_>
+          10 12 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 9 -1.</_>
+        <_>
+          7 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 4 -1.</_>
+        <_>
+          6 8 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 9 -1.</_>
+        <_>
+          0 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 12 -1.</_>
+        <_>
+          7 12 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 9 12 -1.</_>
+        <_>
+          5 8 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 9 -1.</_>
+        <_>
+          11 3 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 10 6 -1.</_>
+        <_>
+          11 3 5 3 2.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 6 -1.</_>
+        <_>
+          3 4 7 3 2.</_>
+        <_>
+          10 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 6 -1.</_>
+        <_>
+          9 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 6 -1.</_>
+        <_>
+          7 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 9 -1.</_>
+        <_>
+          10 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 13 2 -1.</_>
+        <_>
+          2 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 13 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 12 -1.</_>
+        <_>
+          3 7 15 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 8 -1.</_>
+        <_>
+          16 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 5 -1.</_>
+        <_>
+          4 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 15 -1.</_>
+        <_>
+          11 5 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 7 6 -1.</_>
+        <_>
+          6 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 9 -1.</_>
+        <_>
+          10 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 15 -1.</_>
+        <_>
+          8 5 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 8 -1.</_>
+        <_>
+          0 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          8 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 4 -1.</_>
+        <_>
+          10 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          10 9 5 3 2.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 8 -1.</_>
+        <_>
+          4 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 7 6 -1.</_>
+        <_>
+          13 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 7 6 -1.</_>
+        <_>
+          0 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 19 -1.</_>
+        <_>
+          4 0 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 15 8 -1.</_>
+        <_>
+          5 12 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 4 -1.</_>
+        <_>
+          13 8 7 2 2.</_>
+        <_>
+          6 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 13 3 -1.</_>
+        <_>
+          1 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          1 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          16 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 8 -1.</_>
+        <_>
+          4 0 4 4 2.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 10 -1.</_>
+        <_>
+          10 0 8 5 2.</_>
+        <_>
+          2 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 7 -1.</_>
+        <_>
+          6 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 5 -1.</_>
+        <_>
+          7 9 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 9 -1.</_>
+        <_>
+          2 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 16 -1.</_>
+        <_>
+          14 0 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 9 -1.</_>
+        <_>
+          0 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 12 -1.</_>
+        <_>
+          11 6 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 9 12 -1.</_>
+        <_>
+          0 6 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 5 12 -1.</_>
+        <_>
+          8 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 9 -1.</_>
+        <_>
+          5 9 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 2 -1.</_>
+        <_>
+          0 18 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          9 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 14 -1.</_>
+        <_>
+          6 12 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 9 -1.</_>
+        <_>
+          11 3 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 9 -1.</_>
+        <_>
+          0 3 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 14 -1.</_>
+        <_>
+          13 0 2 7 2.</_>
+        <_>
+          11 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          6 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 14 -1.</_>
+        <_>
+          13 0 2 7 2.</_>
+        <_>
+          11 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 14 -1.</_>
+        <_>
+          4 0 2 7 2.</_>
+        <_>
+          6 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 6 -1.</_>
+        <_>
+          11 13 5 3 2.</_>
+        <_>
+          6 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 4 -1.</_>
+        <_>
+          1 8 7 2 2.</_>
+        <_>
+          8 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 9 -1.</_>
+        <_>
+          11 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 9 -1.</_>
+        <_>
+          7 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 6 -1.</_>
+        <_>
+          9 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 6 -1.</_>
+        <_>
+          8 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 4 -1.</_>
+        <_>
+          6 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 4 -1.</_>
+        <_>
+          6 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 14 -1.</_>
+        <_>
+          11 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 14 -1.</_>
+        <_>
+          8 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 14 -1.</_>
+        <_>
+          0 0 10 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 10 -1.</_>
+        <_>
+          10 9 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 8 -1.</_>
+        <_>
+          10 5 8 4 2.</_>
+        <_>
+          2 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 6 -1.</_>
+        <_>
+          4 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 3 -1.</_>
+        <_>
+          0 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 9 -1.</_>
+        <_>
+          3 14 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 14 4 -1.</_>
+        <_>
+          13 15 7 2 2.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 10 6 -1.</_>
+        <_>
+          3 13 5 3 2.</_>
+        <_>
+          8 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 3 -1.</_>
+        <_>
+          0 7 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 16 3 -1.</_>
+        <_>
+          0 16 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 16 4 -1.</_>
+        <_>
+          10 16 8 2 2.</_>
+        <_>
+          2 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 13 3 -1.</_>
+        <_>
+          1 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 6 -1.</_>
+        <_>
+          11 10 6 3 2.</_>
+        <_>
+          5 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 12 6 -1.</_>
+        <_>
+          3 10 6 3 2.</_>
+        <_>
+          9 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 10 6 -1.</_>
+        <_>
+          12 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 7 6 -1.</_>
+        <_>
+          2 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 2 -1.</_>
+        <_>
+          5 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 3 -1.</_>
+        <_>
+          1 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 14 -1.</_>
+        <_>
+          18 1 2 7 2.</_>
+        <_>
+          16 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 14 -1.</_>
+        <_>
+          6 12 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 2 -1.</_>
+        <_>
+          5 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 8 -1.</_>
+        <_>
+          6 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 12 -1.</_>
+        <_>
+          10 4 5 6 2.</_>
+        <_>
+          5 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 4 -1.</_>
+        <_>
+          10 13 7 2 2.</_>
+        <_>
+          3 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 10 -1.</_>
+        <_>
+          5 9 3 5 2.</_>
+        <_>
+          8 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 7 -1.</_>
+        <_>
+          9 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 7 -1.</_>
+        <_>
+          8 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 8 6 -1.</_>
+        <_>
+          7 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 5 -1.</_>
+        <_>
+          10 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 5 -1.</_>
+        <_>
+          9 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 13 3 -1.</_>
+        <_>
+          7 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 13 3 -1.</_>
+        <_>
+          0 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 6 -1.</_>
+        <_>
+          4 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 4 -1.</_>
+        <_>
+          4 2 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 8 -1.</_>
+        <_>
+          2 12 5 4 2.</_>
+        <_>
+          7 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 10 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 2 -1.</_>
+        <_>
+          3 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 13 2 -1.</_>
+        <_>
+          4 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 12 8 2 2.</_>
+        <_>
+          10 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 11 9 -1.</_>
+        <_>
+          5 6 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 10 -1.</_>
+        <_>
+          0 7 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 10 -1.</_>
+        <_>
+          3 8 3 5 2.</_>
+        <_>
+          6 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          7 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 5 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 4 -1.</_>
+        <_>
+          1 7 9 2 2.</_>
+        <_>
+          10 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 8 -1.</_>
+        <_>
+          7 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 4 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 8 -1.</_>
+        <_>
+          8 4 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 4 -1.</_>
+        <_>
+          12 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 8 -1.</_>
+        <_>
+          4 0 4 4 2.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 7 6 -1.</_>
+        <_>
+          13 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 4 -1.</_>
+        <_>
+          5 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 14 4 -1.</_>
+        <_>
+          1 3 7 2 2.</_>
+        <_>
+          8 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 10 8 -1.</_>
+        <_>
+          7 16 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 7 8 -1.</_>
+        <_>
+          10 16 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 13 2 -1.</_>
+        <_>
+          1 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 3 -1.</_>
+        <_>
+          6 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          0 15 10 2 2.</_>
+        <_>
+          10 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 4 -1.</_>
+        <_>
+          4 6 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 11 -1.</_>
+        <_>
+          9 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 10 -1.</_>
+        <_>
+          15 10 4 5 2.</_>
+        <_>
+          11 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 10 6 -1.</_>
+        <_>
+          1 4 5 3 2.</_>
+        <_>
+          6 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 13 2 -1.</_>
+        <_>
+          7 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 10 -1.</_>
+        <_>
+          16 10 4 5 2.</_>
+        <_>
+          12 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 4 -1.</_>
+        <_>
+          0 11 9 2 2.</_>
+        <_>
+          9 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 10 -1.</_>
+        <_>
+          16 10 4 5 2.</_>
+        <_>
+          12 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 10 -1.</_>
+        <_>
+          0 10 4 5 2.</_>
+        <_>
+          4 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 14 -1.</_>
+        <_>
+          13 6 6 7 2.</_>
+        <_>
+          7 13 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 7 4 -1.</_>
+        <_>
+          1 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          10 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 7 -1.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 14 -1.</_>
+        <_>
+          12 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 17 -1.</_>
+        <_>
+          10 2 6 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 7 -1.</_>
+        <_>
+          12 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 10 -1.</_>
+        <_>
+          6 9 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 9 -1.</_>
+        <_>
+          7 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 14 -1.</_>
+        <_>
+          11 5 2 7 2.</_>
+        <_>
+          9 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          8 5 2 7 2.</_>
+        <_>
+          10 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 12 -1.</_>
+        <_>
+          11 3 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 12 -1.</_>
+        <_>
+          7 3 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 4 -1.</_>
+        <_>
+          11 10 7 2 2.</_>
+        <_>
+          4 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 7 -1.</_>
+        <_>
+          9 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 2 -1.</_>
+        <_>
+          1 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 2 -1.</_>
+        <_>
+          7 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 4 -1.</_>
+        <_>
+          4 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 4 -1.</_>
+        <_>
+          12 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 7 4 -1.</_>
+        <_>
+          1 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 14 -1.</_>
+        <_>
+          11 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 14 -1.</_>
+        <_>
+          8 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 7 -1.</_>
+        <_>
+          10 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 10 -1.</_>
+        <_>
+          2 5 3 5 2.</_>
+        <_>
+          5 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 16 -1.</_>
+        <_>
+          16 3 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 16 -1.</_>
+        <_>
+          3 3 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          14 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 13 -1.</_>
+        <_>
+          3 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 14 -1.</_>
+        <_>
+          17 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 14 -1.</_>
+        <_>
+          17 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 10 10 -1.</_>
+        <_>
+          1 10 5 5 2.</_>
+        <_>
+          6 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 10 -1.</_>
+        <_>
+          0 5 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 13 3 -1.</_>
+        <_>
+          2 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 14 -1.</_>
+        <_>
+          7 13 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 13 2 -1.</_>
+        <_>
+          0 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 10 -1.</_>
+        <_>
+          10 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 6 -1.</_>
+        <_>
+          3 13 7 3 2.</_>
+        <_>
+          10 16 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 19 -1.</_>
+        <_>
+          10 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 6 -1.</_>
+        <_>
+          1 12 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 19 -1.</_>
+        <_>
+          8 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 2 -1.</_>
+        <_>
+          0 6 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 7 -1.</_>
+        <_>
+          12 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 8 -1.</_>
+        <_>
+          6 2 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 9 -1.</_>
+        <_>
+          10 0 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 9 -1.</_>
+        <_>
+          5 0 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 5 6 -1.</_>
+        <_>
+          1 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 10 -1.</_>
+        <_>
+          4 5 6 5 2.</_>
+        <_>
+          10 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 5 9 -1.</_>
+        <_>
+          13 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          1 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 8 -1.</_>
+        <_>
+          1 12 9 4 2.</_>
+        <_>
+          10 16 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 4 -1.</_>
+        <_>
+          4 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 6 -1.</_>
+        <_>
+          6 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 10 -1.</_>
+        <_>
+          5 9 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 5 8 -1.</_>
+        <_>
+          8 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 13 10 -1.</_>
+        <_>
+          3 13 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 5 12 -1.</_>
+        <_>
+          12 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 17 -1.</_>
+        <_>
+          12 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 17 -1.</_>
+        <_>
+          7 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 13 -1.</_>
+        <_>
+          1 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 15 -1.</_>
+        <_>
+          12 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 5 15 -1.</_>
+        <_>
+          3 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 9 4 -1.</_>
+        <_>
+          10 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 2 -1.</_>
+        <_>
+          3 6 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 6 -1.</_>
+        <_>
+          10 2 7 3 2.</_>
+        <_>
+          3 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 6 -1.</_>
+        <_>
+          6 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 8 -1.</_>
+        <_>
+          11 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 13 -1.</_>
+        <_>
+          9 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 7 -1.</_>
+        <_>
+          7 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 5 -1.</_>
+        <_>
+          8 6 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 4 -1.</_>
+        <_>
+          10 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 5 6 3 2.</_>
+        <_>
+          10 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 7 8 -1.</_>
+        <_>
+          3 16 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 9 -1.</_>
+        <_>
+          2 9 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 16 2 -1.</_>
+        <_>
+          9 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 11 4 -1.</_>
+        <_>
+          5 4 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 8 -1.</_>
+        <_>
+          0 12 5 4 2.</_>
+        <_>
+          5 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 8 -1.</_>
+        <_>
+          8 1 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 8 -1.</_>
+        <_>
+          7 1 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 9 -1.</_>
+        <_>
+          3 7 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 15 5 -1.</_>
+        <_>
+          9 3 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 12 -1.</_>
+        <_>
+          0 8 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 4 -1.</_>
+        <_>
+          8 1 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 12 -1.</_>
+        <_>
+          0 8 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 9 -1.</_>
+        <_>
+          10 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 12 15 -1.</_>
+        <_>
+          6 1 4 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 3 -1.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 3 -1.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 14 -1.</_>
+        <_>
+          6 8 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          6 6 3 6 2.</_>
+        <_>
+          9 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 9 -1.</_>
+        <_>
+          10 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 9 -1.</_>
+        <_>
+          8 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 5 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 5 -1.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 9 6 -1.</_>
+        <_>
+          9 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 10 -1.</_>
+        <_>
+          5 2 3 5 2.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 18 -1.</_>
+        <_>
+          3 1 3 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 10 -1.</_>
+        <_>
+          3 1 3 5 2.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 12 -1.</_>
+        <_>
+          1 3 9 6 2.</_>
+        <_>
+          10 9 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 13 3 -1.</_>
+        <_>
+          7 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 13 3 -1.</_>
+        <_>
+          1 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 14 4 -1.</_>
+        <_>
+          13 16 7 2 2.</_>
+        <_>
+          6 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 8 -1.</_>
+        <_>
+          12 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 13 -1.</_>
+        <_>
+          7 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 3 10 -1.</_>
+        <_>
+          11 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 3 -1.</_>
+        <_>
+          1 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 6 -1.</_>
+        <_>
+          4 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 9 -1.</_>
+        <_>
+          6 11 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 4 -1.</_>
+        <_>
+          4 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 2 -1.</_>
+        <_>
+          1 13 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          5 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          12 6 5 3 2.</_>
+        <_>
+          7 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 6 -1.</_>
+        <_>
+          8 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 2 -1.</_>
+        <_>
+          4 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 9 6 -1.</_>
+        <_>
+          5 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          17 1 3 6 2.</_>
+        <_>
+          14 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          0 1 3 6 2.</_>
+        <_>
+          3 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 6 -1.</_>
+        <_>
+          12 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 2 -1.</_>
+        <_>
+          0 17 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 11 4 -1.</_>
+        <_>
+          5 18 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 13 3 -1.</_>
+        <_>
+          2 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 11 -1.</_>
+        <_>
+          16 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 6 -1.</_>
+        <_>
+          11 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 8 -1.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 15 -1.</_>
+        <_>
+          8 5 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 2 -1.</_>
+        <_>
+          0 16 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 6 -1.</_>
+        <_>
+          11 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 7 -1.</_>
+        <_>
+          11 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          7 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 6 -1.</_>
+        <_>
+          11 11 5 3 2.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 6 -1.</_>
+        <_>
+          11 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 11 10 -1.</_>
+        <_>
+          4 9 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 6 -1.</_>
+        <_>
+          11 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 6 -1.</_>
+        <_>
+          1 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 3 -1.</_>
+        <_>
+          2 3 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 13 -1.</_>
+        <_>
+          18 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 13 3 -1.</_>
+        <_>
+          5 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 7 -1.</_>
+        <_>
+          6 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 8 -1.</_>
+        <_>
+          11 2 4 4 2.</_>
+        <_>
+          7 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 8 -1.</_>
+        <_>
+          5 2 4 4 2.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 16 -1.</_>
+        <_>
+          17 3 2 8 2.</_>
+        <_>
+          15 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 8 -1.</_>
+        <_>
+          4 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 6 -1.</_>
+        <_>
+          4 16 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 14 3 -1.</_>
+        <_>
+          1 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 13 -1.</_>
+        <_>
+          18 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          1 1 9 2 2.</_>
+        <_>
+          10 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 13 -1.</_>
+        <_>
+          18 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 13 -1.</_>
+        <_>
+          1 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 2 -1.</_>
+        <_>
+          2 0 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 12 -1.</_>
+        <_>
+          2 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 6 -1.</_>
+        <_>
+          0 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 6 -1.</_>
+        <_>
+          9 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 3 -1.</_>
+        <_>
+          0 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 8 -1.</_>
+        <_>
+          5 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 6 -1.</_>
+        <_>
+          9 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 6 -1.</_>
+        <_>
+          2 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 4 -1.</_>
+        <_>
+          1 7 8 2 2.</_>
+        <_>
+          9 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 7 -1.</_>
+        <_>
+          8 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 4 -1.</_>
+        <_>
+          8 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 13 -1.</_>
+        <_>
+          3 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 11 -1.</_>
+        <_>
+          16 7 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 11 -1.</_>
+        <_>
+          2 7 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 8 -1.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 3 -1.</_>
+        <_>
+          0 11 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 8 6 -1.</_>
+        <_>
+          11 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 13 -1.</_>
+        <_>
+          10 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          9 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 18 -1.</_>
+        <_>
+          16 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 13 3 -1.</_>
+        <_>
+          4 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 19 -1.</_>
+        <_>
+          2 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 10 10 -1.</_>
+        <_>
+          13 5 5 5 2.</_>
+        <_>
+          8 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 12 -1.</_>
+        <_>
+          1 8 3 6 2.</_>
+        <_>
+          4 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 13 -1.</_>
+        <_>
+          5 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 3 -1.</_>
+        <_>
+          4 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 8 6 -1.</_>
+        <_>
+          1 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 3 -1.</_>
+        <_>
+          4 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 4 -1.</_>
+        <_>
+          0 6 7 2 2.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 16 -1.</_>
+        <_>
+          17 3 3 8 2.</_>
+        <_>
+          14 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 10 -1.</_>
+        <_>
+          1 4 9 5 2.</_>
+        <_>
+          10 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 16 -1.</_>
+        <_>
+          17 2 3 8 2.</_>
+        <_>
+          14 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 16 -1.</_>
+        <_>
+          0 2 3 8 2.</_>
+        <_>
+          3 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          14 8 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          3 8 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          8 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 8 -1.</_>
+        <_>
+          4 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 16 -1.</_>
+        <_>
+          8 4 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 7 -1.</_>
+        <_>
+          7 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 4 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 10 4 -1.</_>
+        <_>
+          7 2 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 6 -1.</_>
+        <_>
+          1 16 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          10 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 19 3 -1.</_>
+        <_>
+          1 2 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 13 2 -1.</_>
+        <_>
+          4 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 6 -1.</_>
+        <_>
+          13 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 13 3 -1.</_>
+        <_>
+          3 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 4 -1.</_>
+        <_>
+          10 15 9 2 2.</_>
+        <_>
+          1 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          4 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 6 -1.</_>
+        <_>
+          14 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 10 -1.</_>
+        <_>
+          10 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 7 -1.</_>
+        <_>
+          6 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          10 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 12 12 -1.</_>
+        <_>
+          2 11 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 9 9 -1.</_>
+        <_>
+          5 13 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 8 -1.</_>
+        <_>
+          0 12 4 4 2.</_>
+        <_>
+          4 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 6 9 -1.</_>
+        <_>
+          14 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 7 6 -1.</_>
+        <_>
+          5 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 14 -1.</_>
+        <_>
+          9 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 8 -1.</_>
+        <_>
+          8 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 14 -1.</_>
+        <_>
+          7 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 8 -1.</_>
+        <_>
+          6 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 9 -1.</_>
+        <_>
+          14 9 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 9 -1.</_>
+        <_>
+          4 9 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 15 4 -1.</_>
+        <_>
+          9 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 4 -1.</_>
+        <_>
+          8 2 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 12 -1.</_>
+        <_>
+          10 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 12 -1.</_>
+        <_>
+          8 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 7 -1.</_>
+        <_>
+          9 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 13 -1.</_>
+        <_>
+          6 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 9 -1.</_>
+        <_>
+          12 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 12 -1.</_>
+        <_>
+          5 10 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 20 -1.</_>
+        <_>
+          11 0 2 10 2.</_>
+        <_>
+          9 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 16 -1.</_>
+        <_>
+          8 0 2 8 2.</_>
+        <_>
+          10 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 11 -1.</_>
+        <_>
+          8 9 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 9 -1.</_>
+        <_>
+          0 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 12 -1.</_>
+        <_>
+          13 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 8 -1.</_>
+        <_>
+          6 12 4 4 2.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 8 -1.</_>
+        <_>
+          10 9 9 4 2.</_>
+        <_>
+          1 13 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 4 -1.</_>
+        <_>
+          6 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 12 -1.</_>
+        <_>
+          13 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 12 -1.</_>
+        <_>
+          4 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 13 3 -1.</_>
+        <_>
+          3 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 13 3 -1.</_>
+        <_>
+          7 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 14 -1.</_>
+        <_>
+          18 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 16 -1.</_>
+        <_>
+          0 8 20 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_>
+        <_>
+          6 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          0 2 10 3 2.</_>
+        <_>
+          10 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 14 -1.</_>
+        <_>
+          18 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 9 -1.</_>
+        <_>
+          7 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 7 -1.</_>
+        <_>
+          11 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 10 -1.</_>
+        <_>
+          7 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          0 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 12 -1.</_>
+        <_>
+          3 4 7 6 2.</_>
+        <_>
+          10 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 8 -1.</_>
+        <_>
+          8 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 10 -1.</_>
+        <_>
+          11 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 14 -1.</_>
+        <_>
+          7 2 6 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 8 -1.</_>
+        <_>
+          10 3 7 4 2.</_>
+        <_>
+          3 7 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 11 -1.</_>
+        <_>
+          5 9 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 8 -1.</_>
+        <_>
+          5 7 5 4 2.</_>
+        <_>
+          10 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 16 -1.</_>
+        <_>
+          16 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 4 -1.</_>
+        <_>
+          10 4 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 3 -1.</_>
+        <_>
+          4 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 14 -1.</_>
+        <_>
+          18 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 10 -1.</_>
+        <_>
+          16 1 3 5 2.</_>
+        <_>
+          13 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 10 -1.</_>
+        <_>
+          1 1 3 5 2.</_>
+        <_>
+          4 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 3 -1.</_>
+        <_>
+          3 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 13 3 -1.</_>
+        <_>
+          3 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 8 -1.</_>
+        <_>
+          15 4 4 4 2.</_>
+        <_>
+          11 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 2 -1.</_>
+        <_>
+          0 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 8 -1.</_>
+        <_>
+          15 4 4 4 2.</_>
+        <_>
+          11 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 9 -1.</_>
+        <_>
+          0 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 9 -1.</_>
+        <_>
+          3 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 8 -1.</_>
+        <_>
+          15 0 5 4 2.</_>
+        <_>
+          10 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 9 -1.</_>
+        <_>
+          0 7 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 4 -1.</_>
+        <_>
+          0 9 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 4 -1.</_>
+        <_>
+          10 2 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 7 -1.</_>
+        <_>
+          11 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 7 -1.</_>
+        <_>
+          8 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 9 7 -1.</_>
+        <_>
+          14 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 12 5 -1.</_>
+        <_>
+          10 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 8 -1.</_>
+        <_>
+          8 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 7 -1.</_>
+        <_>
+          7 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          8 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          9 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 9 -1.</_>
+        <_>
+          2 9 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 2 -1.</_>
+        <_>
+          3 9 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 15 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 4 8 -1.</_>
+        <_>
+          7 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 11 -1.</_>
+        <_>
+          2 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 8 10 -1.</_>
+        <_>
+          7 8 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 8 4 -1.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 20 -1.</_>
+        <_>
+          1 0 5 10 2.</_>
+        <_>
+          6 10 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 10 -1.</_>
+        <_>
+          10 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 4 -1.</_>
+        <_>
+          10 7 9 2 2.</_>
+        <_>
+          1 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 10 6 -1.</_>
+        <_>
+          5 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 3 -1.</_>
+        <_>
+          7 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 6 -1.</_>
+        <_>
+          2 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 5 8 -1.</_>
+        <_>
+          11 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 5 8 -1.</_>
+        <_>
+          4 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 4 -1.</_>
+        <_>
+          10 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 9 6 -1.</_>
+        <_>
+          4 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 4 -1.</_>
+        <_>
+          10 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 4 -1.</_>
+        <_>
+          0 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 16 -1.</_>
+        <_>
+          16 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 15 -1.</_>
+        <_>
+          7 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 10 6 -1.</_>
+        <_>
+          14 10 5 3 2.</_>
+        <_>
+          9 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 14 -1.</_>
+        <_>
+          3 1 7 7 2.</_>
+        <_>
+          10 8 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          18 5 2 7 2.</_>
+        <_>
+          16 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 14 -1.</_>
+        <_>
+          0 5 2 7 2.</_>
+        <_>
+          2 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 13 3 -1.</_>
+        <_>
+          5 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 17 2 -1.</_>
+        <_>
+          0 17 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 6 -1.</_>
+        <_>
+          2 12 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 9 -1.</_>
+        <_>
+          3 3 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 5 -1.</_>
+        <_>
+          9 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 4 -1.</_>
+        <_>
+          10 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 15 -1.</_>
+        <_>
+          1 8 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 12 -1.</_>
+        <_>
+          14 2 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 5 -1.</_>
+        <_>
+          4 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 8 -1.</_>
+        <_>
+          16 5 4 4 2.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 3 -1.</_>
+        <_>
+          0 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 8 -1.</_>
+        <_>
+          6 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 3 -1.</_>
+        <_>
+          9 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 3 -1.</_>
+        <_>
+          6 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 13 3 -1.</_>
+        <_>
+          4 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 7 4 -1.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 10 -1.</_>
+        <_>
+          13 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 5 -1.</_>
+        <_>
+          10 10 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 4 -1.</_>
+        <_>
+          10 1 8 2 2.</_>
+        <_>
+          2 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 3 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 17 -1.</_>
+        <_>
+          2 3 8 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 8 -1.</_>
+        <_>
+          16 5 4 4 2.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 8 -1.</_>
+        <_>
+          0 5 4 4 2.</_>
+        <_>
+          4 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 16 -1.</_>
+        <_>
+          18 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          8 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 15 3 -1.</_>
+        <_>
+          2 7 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 6 -1.</_>
+        <_>
+          2 14 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 13 -1.</_>
+        <_>
+          4 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 12 -1.</_>
+        <_>
+          10 5 5 6 2.</_>
+        <_>
+          5 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 12 -1.</_>
+        <_>
+          2 4 7 6 2.</_>
+        <_>
+          9 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 16 -1.</_>
+        <_>
+          18 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 5 -1.</_>
+        <_>
+          8 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 15 -1.</_>
+        <_>
+          16 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 15 -1.</_>
+        <_>
+          3 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 8 -1.</_>
+        <_>
+          8 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 16 -1.</_>
+        <_>
+          1 4 3 8 2.</_>
+        <_>
+          4 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 2 -1.</_>
+        <_>
+          3 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 14 -1.</_>
+        <_>
+          7 2 3 7 2.</_>
+        <_>
+          10 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 7 -1.</_>
+        <_>
+          12 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 16 -1.</_>
+        <_>
+          6 1 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 10 -1.</_>
+        <_>
+          6 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 13 -1.</_>
+        <_>
+          10 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 14 6 -1.</_>
+        <_>
+          2 6 7 3 2.</_>
+        <_>
+          9 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 9 -1.</_>
+        <_>
+          9 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 13 2 -1.</_>
+        <_>
+          3 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 8 6 -1.</_>
+        <_>
+          9 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 4 -1.</_>
+        <_>
+          2 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 13 3 -1.</_>
+        <_>
+          6 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 7 6 -1.</_>
+        <_>
+          3 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 9 -1.</_>
+        <_>
+          9 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 7 9 -1.</_>
+        <_>
+          4 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 3 -1.</_>
+        <_>
+          5 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 12 -1.</_>
+        <_>
+          1 6 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 3 -1.</_>
+        <_>
+          4 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 8 -1.</_>
+        <_>
+          10 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 8 -1.</_>
+        <_>
+          8 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 16 -1.</_>
+        <_>
+          14 0 6 8 2.</_>
+        <_>
+          8 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 6 -1.</_>
+        <_>
+          6 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          3 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 7 -1.</_>
+        <_>
+          11 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 7 -1.</_>
+        <_>
+          8 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 17 6 -1.</_>
+        <_>
+          1 16 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 3 -1.</_>
+        <_>
+          5 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 7 -1.</_>
+        <_>
+          7 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 11 -1.</_>
+        <_>
+          7 9 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 7 -1.</_>
+        <_>
+          12 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 7 -1.</_>
+        <_>
+          6 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 9 9 -1.</_>
+        <_>
+          12 10 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 10 -1.</_>
+        <_>
+          0 10 5 5 2.</_>
+        <_>
+          5 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 6 5 -1.</_>
+        <_>
+          12 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 8 5 -1.</_>
+        <_>
+          5 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 2 -1.</_>
+        <_>
+          5 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 3 -1.</_>
+        <_>
+          7 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 8 -1.</_>
+        <_>
+          5 2 4 4 2.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 14 4 -1.</_>
+        <_>
+          13 16 7 2 2.</_>
+        <_>
+          6 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_>
+        <_>
+          3 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          10 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 14 6 -1.</_>
+        <_>
+          12 3 7 3 2.</_>
+        <_>
+          5 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          0 3 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          6 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 13 14 -1.</_>
+        <_>
+          0 12 13 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 8 -1.</_>
+        <_>
+          14 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 8 -1.</_>
+        <_>
+          0 0 10 4 2.</_>
+        <_>
+          10 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 18 -1.</_>
+        <_>
+          18 1 2 9 2.</_>
+        <_>
+          16 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 9 -1.</_>
+        <_>
+          3 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          4 7 6 6 2.</_>
+        <_>
+          10 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 3 -1.</_>
+        <_>
+          7 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 6 -1.</_>
+        <_>
+          0 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 6 -1.</_>
+        <_>
+          6 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 8 -1.</_>
+        <_>
+          0 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 9 5 -1.</_>
+        <_>
+          12 3 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          2 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 6 -1.</_>
+        <_>
+          4 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 6 -1.</_>
+        <_>
+          12 1 5 3 2.</_>
+        <_>
+          7 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 4 -1.</_>
+        <_>
+          0 2 9 2 2.</_>
+        <_>
+          9 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 2 17 -1.</_>
+        <_>
+          17 1 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 19 -1.</_>
+        <_>
+          2 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 4 -1.</_>
+        <_>
+          10 9 8 2 2.</_>
+        <_>
+          2 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 8 -1.</_>
+        <_>
+          1 6 9 4 2.</_>
+        <_>
+          10 10 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 4 -1.</_>
+        <_>
+          7 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 10 -1.</_>
+        <_>
+          5 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 6 -1.</_>
+        <_>
+          5 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 10 -1.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 6 -1.</_>
+        <_>
+          8 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 5 -1.</_>
+        <_>
+          6 6 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 12 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 12 -1.</_>
+        <_>
+          1 8 5 6 2.</_>
+        <_>
+          6 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 5 6 -1.</_>
+        <_>
+          14 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 12 -1.</_>
+        <_>
+          1 3 9 6 2.</_>
+        <_>
+          10 9 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 6 -1.</_>
+        <_>
+          5 4 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 17 -1.</_>
+        <_>
+          15 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 8 -1.</_>
+        <_>
+          9 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 17 -1.</_>
+        <_>
+          4 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_>
+        <_>
+          2 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          0 0 9 2 2.</_>
+        <_>
+          9 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 8 -1.</_>
+        <_>
+          13 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 8 -1.</_>
+        <_>
+          5 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 10 6 -1.</_>
+        <_>
+          12 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 14 -1.</_>
+        <_>
+          8 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 15 4 -1.</_>
+        <_>
+          9 3 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 4 -1.</_>
+        <_>
+          6 3 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 14 -1.</_>
+        <_>
+          15 5 2 7 2.</_>
+        <_>
+          13 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 14 -1.</_>
+        <_>
+          3 5 2 7 2.</_>
+        <_>
+          5 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 7 -1.</_>
+        <_>
+          11 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 7 -1.</_>
+        <_>
+          7 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 10 6 -1.</_>
+        <_>
+          12 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 10 6 -1.</_>
+        <_>
+          3 12 5 3 2.</_>
+        <_>
+          8 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 6 -1.</_>
+        <_>
+          11 4 8 3 2.</_>
+        <_>
+          3 7 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 7 -1.</_>
+        <_>
+          6 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 14 3 -1.</_>
+        <_>
+          6 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 7 -1.</_>
+        <_>
+          6 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 7 -1.</_>
+        <_>
+          10 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 12 -1.</_>
+        <_>
+          5 4 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 18 -1.</_>
+        <_>
+          10 0 5 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 9 -1.</_>
+        <_>
+          7 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 8 -1.</_>
+        <_>
+          8 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 14 2 -1.</_>
+        <_>
+          3 19 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 7 6 -1.</_>
+        <_>
+          1 8 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 7 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 7 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 11 15 -1.</_>
+        <_>
+          8 10 11 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 9 -1.</_>
+        <_>
+          8 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 13 3 -1.</_>
+        <_>
+          4 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 12 -1.</_>
+        <_>
+          7 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          8 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 16 3 -1.</_>
+        <_>
+          10 16 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 5 -1.</_>
+        <_>
+          9 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 5 -1.</_>
+        <_>
+          8 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 11 -1.</_>
+        <_>
+          7 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 10 -1.</_>
+        <_>
+          12 6 3 5 2.</_>
+        <_>
+          9 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 10 -1.</_>
+        <_>
+          5 6 3 5 2.</_>
+        <_>
+          8 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 8 -1.</_>
+        <_>
+          12 8 8 4 2.</_>
+        <_>
+          4 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 8 -1.</_>
+        <_>
+          0 8 8 4 2.</_>
+        <_>
+          8 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 10 -1.</_>
+        <_>
+          14 8 5 5 2.</_>
+        <_>
+          9 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 10 -1.</_>
+        <_>
+          1 8 5 5 2.</_>
+        <_>
+          6 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 16 -1.</_>
+        <_>
+          14 1 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 12 -1.</_>
+        <_>
+          6 4 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 8 -1.</_>
+        <_>
+          16 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 8 -1.</_>
+        <_>
+          2 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 3 -1.</_>
+        <_>
+          5 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 6 -1.</_>
+        <_>
+          6 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 12 -1.</_>
+        <_>
+          7 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 18 -1.</_>
+        <_>
+          12 1 2 9 2.</_>
+        <_>
+          10 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 14 -1.</_>
+        <_>
+          4 6 2 7 2.</_>
+        <_>
+          6 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 10 -1.</_>
+        <_>
+          13 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 14 12 -1.</_>
+        <_>
+          1 3 7 6 2.</_>
+        <_>
+          8 9 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 9 -1.</_>
+        <_>
+          12 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 4 -1.</_>
+        <_>
+          1 14 9 2 2.</_>
+        <_>
+          10 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 14 -1.</_>
+        <_>
+          9 6 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 8 -1.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 12 -1.</_>
+        <_>
+          6 8 4 6 2.</_>
+        <_>
+          10 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 2 -1.</_>
+        <_>
+          9 0 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 6 -1.</_>
+        <_>
+          1 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          12 5 3 5 2.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 5 -1.</_>
+        <_>
+          9 1 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 13 2 -1.</_>
+        <_>
+          3 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 3 -1.</_>
+        <_>
+          4 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 6 -1.</_>
+        <_>
+          12 1 5 3 2.</_>
+        <_>
+          7 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 3 -1.</_>
+        <_>
+          5 0 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 5 -1.</_>
+        <_>
+          9 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 12 -1.</_>
+        <_>
+          0 11 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 13 3 -1.</_>
+        <_>
+          6 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 5 -1.</_>
+        <_>
+          6 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 3 -1.</_>
+        <_>
+          1 9 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 11 -1.</_>
+        <_>
+          16 0 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 6 -1.</_>
+        <_>
+          3 1 6 3 2.</_>
+        <_>
+          9 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 11 -1.</_>
+        <_>
+          2 0 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 12 -1.</_>
+        <_>
+          8 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 16 -1.</_>
+        <_>
+          1 4 3 8 2.</_>
+        <_>
+          4 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 10 -1.</_>
+        <_>
+          16 5 3 5 2.</_>
+        <_>
+          13 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 10 -1.</_>
+        <_>
+          1 5 3 5 2.</_>
+        <_>
+          4 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 16 -1.</_>
+        <_>
+          6 9 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 7 -1.</_>
+        <_>
+          8 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 13 -1.</_>
+        <_>
+          7 1 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 10 -1.</_>
+        <_>
+          8 10 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 20 -1.</_>
+        <_>
+          4 0 4 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 6 -1.</_>
+        <_>
+          10 0 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 9 -1.</_>
+        <_>
+          5 5 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 2 -1.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 3 -1.</_>
+        <_>
+          3 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 11 12 -1.</_>
+        <_>
+          0 7 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 5 -1.</_>
+        <_>
+          12 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 5 -1.</_>
+        <_>
+          6 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 8 -1.</_>
+        <_>
+          8 0 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 2 -1.</_>
+        <_>
+          0 16 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 10 3 -1.</_>
+        <_>
+          10 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 10 -1.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 6 -1.</_>
+        <_>
+          4 11 6 3 2.</_>
+        <_>
+          10 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 16 6 -1.</_>
+        <_>
+          11 12 8 3 2.</_>
+        <_>
+          3 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 16 6 -1.</_>
+        <_>
+          1 12 8 3 2.</_>
+        <_>
+          9 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 6 -1.</_>
+        <_>
+          9 0 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 6 -1.</_>
+        <_>
+          6 0 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 6 -1.</_>
+        <_>
+          5 3 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 17 -1.</_>
+        <_>
+          8 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 19 3 -1.</_>
+        <_>
+          1 10 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 18 -1.</_>
+        <_>
+          8 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 6 -1.</_>
+        <_>
+          0 13 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 9 -1.</_>
+        <_>
+          10 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 3 -1.</_>
+        <_>
+          3 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 4 -1.</_>
+        <_>
+          13 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 14 -1.</_>
+        <_>
+          4 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 17 -1.</_>
+        <_>
+          12 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 9 -1.</_>
+        <_>
+          3 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 10 -1.</_>
+        <_>
+          14 3 3 5 2.</_>
+        <_>
+          11 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 13 -1.</_>
+        <_>
+          3 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 2 -1.</_>
+        <_>
+          4 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 13 -1.</_>
+        <_>
+          5 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 17 -1.</_>
+        <_>
+          12 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 3 -1.</_>
+        <_>
+          5 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 9 -1.</_>
+        <_>
+          10 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 9 -1.</_>
+        <_>
+          5 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 9 -1.</_>
+        <_>
+          3 14 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 16 -1.</_>
+        <_>
+          10 8 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 16 -1.</_>
+        <_>
+          0 8 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 13 -1.</_>
+        <_>
+          10 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 10 -1.</_>
+        <_>
+          6 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 10 -1.</_>
+        <_>
+          11 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 16 -1.</_>
+        <_>
+          0 0 2 8 2.</_>
+        <_>
+          2 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          10 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 16 -1.</_>
+        <_>
+          0 4 2 8 2.</_>
+        <_>
+          2 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 7 6 -1.</_>
+        <_>
+          5 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 10 -1.</_>
+        <_>
+          14 3 3 5 2.</_>
+        <_>
+          11 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 10 -1.</_>
+        <_>
+          3 3 3 5 2.</_>
+        <_>
+          6 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 10 -1.</_>
+        <_>
+          6 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 16 -1.</_>
+        <_>
+          14 0 2 8 2.</_>
+        <_>
+          12 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 16 -1.</_>
+        <_>
+          4 0 2 8 2.</_>
+        <_>
+          6 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 15 7 -1.</_>
+        <_>
+          10 13 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          0 8 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 5 -1.</_>
+        <_>
+          8 13 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 12 -1.</_>
+        <_>
+          15 7 3 6 2.</_>
+        <_>
+          12 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 12 -1.</_>
+        <_>
+          2 7 3 6 2.</_>
+        <_>
+          5 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 6 -1.</_>
+        <_>
+          14 8 5 3 2.</_>
+        <_>
+          9 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 6 -1.</_>
+        <_>
+          1 8 5 3 2.</_>
+        <_>
+          6 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 13 3 -1.</_>
+        <_>
+          4 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 10 -1.</_>
+        <_>
+          0 13 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 7 -1.</_>
+        <_>
+          5 13 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 9 -1.</_>
+        <_>
+          9 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 9 8 -1.</_>
+        <_>
+          4 11 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 17 6 -1.</_>
+        <_>
+          2 15 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 8 -1.</_>
+        <_>
+          5 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 12 -1.</_>
+        <_>
+          13 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          4 5 6 6 2.</_>
+        <_>
+          10 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          10 5 5 3 2.</_>
+        <_>
+          5 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 8 -1.</_>
+        <_>
+          3 5 7 4 2.</_>
+        <_>
+          10 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 9 -1.</_>
+        <_>
+          5 9 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 8 4 -1.</_>
+        <_>
+          12 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 4 -1.</_>
+        <_>
+          0 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 8 4 -1.</_>
+        <_>
+          8 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 17 -1.</_>
+        <_>
+          12 2 4 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 17 -1.</_>
+        <_>
+          4 2 4 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 20 -1.</_>
+        <_>
+          5 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 6 -1.</_>
+        <_>
+          12 14 7 3 2.</_>
+        <_>
+          5 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 6 -1.</_>
+        <_>
+          0 14 7 3 2.</_>
+        <_>
+          7 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 10 6 -1.</_>
+        <_>
+          9 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 5 6 -1.</_>
+        <_>
+          1 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 13 -1.</_>
+        <_>
+          12 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 13 -1.</_>
+        <_>
+          7 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 9 -1.</_>
+        <_>
+          7 4 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          6 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 12 -1.</_>
+        <_>
+          9 7 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 12 -1.</_>
+        <_>
+          10 3 7 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 20 -1.</_>
+        <_>
+          1 0 4 10 2.</_>
+        <_>
+          5 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 5 -1.</_>
+        <_>
+          5 2 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 8 -1.</_>
+        <_>
+          12 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 10 -1.</_>
+        <_>
+          15 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 10 -1.</_>
+        <_>
+          0 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 10 6 -1.</_>
+        <_>
+          9 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 10 6 -1.</_>
+        <_>
+          1 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 9 -1.</_>
+        <_>
+          6 11 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 12 -1.</_>
+        <_>
+          7 12 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 2 -1.</_>
+        <_>
+          3 9 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 10 4 -1.</_>
+        <_>
+          5 18 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 17 -1.</_>
+        <_>
+          12 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 2 -1.</_>
+        <_>
+          7 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_>
+        <_>
+          8 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 10 -1.</_>
+        <_>
+          12 9 3 5 2.</_>
+        <_>
+          9 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 12 -1.</_>
+        <_>
+          2 6 8 6 2.</_>
+        <_>
+          10 12 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 6 -1.</_>
+        <_>
+          13 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 4 -1.</_>
+        <_>
+          3 6 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 2 -1.</_>
+        <_>
+          7 2 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 6 -1.</_>
+        <_>
+          7 1 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 14 3 -1.</_>
+        <_>
+          0 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 14 -1.</_>
+        <_>
+          11 6 2 7 2.</_>
+        <_>
+          9 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 2 -1.</_>
+        <_>
+          0 9 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 8 -1.</_>
+        <_>
+          8 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 11 -1.</_>
+        <_>
+          9 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 13 -1.</_>
+        <_>
+          9 3 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 6 -1.</_>
+        <_>
+          0 3 6 3 2.</_>
+        <_>
+          6 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 2 -1.</_>
+        <_>
+          3 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 7 -1.</_>
+        <_>
+          6 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 6 -1.</_>
+        <_>
+          15 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 6 -1.</_>
+        <_>
+          8 1 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 8 -1.</_>
+        <_>
+          10 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 5 -1.</_>
+        <_>
+          9 1 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 6 -1.</_>
+        <_>
+          13 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 6 -1.</_>
+        <_>
+          0 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          14 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          0 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 8 -1.</_>
+        <_>
+          6 4 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 8 -1.</_>
+        <_>
+          0 5 4 4 2.</_>
+        <_>
+          4 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 12 -1.</_>
+        <_>
+          11 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 6 -1.</_>
+        <_>
+          4 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 11 8 -1.</_>
+        <_>
+          7 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 5 -1.</_>
+        <_>
+          8 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 10 8 -1.</_>
+        <_>
+          10 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 8 -1.</_>
+        <_>
+          5 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 7 -1.</_>
+        <_>
+          15 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          3 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          10 2 10 2 2.</_>
+        <_>
+          0 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 9 -1.</_>
+        <_>
+          1 3 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 9 4 -1.</_>
+        <_>
+          10 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 11 4 -1.</_>
+        <_>
+          1 8 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 4 -1.</_>
+        <_>
+          4 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 10 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 10 -1.</_>
+        <_>
+          3 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 17 -1.</_>
+        <_>
+          18 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 2 -1.</_>
+        <_>
+          0 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 17 -1.</_>
+        <_>
+          18 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 17 -1.</_>
+        <_>
+          1 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 6 -1.</_>
+        <_>
+          2 2 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 13 -1.</_>
+        <_>
+          8 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 16 -1.</_>
+        <_>
+          7 3 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 16 2 -1.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 12 -1.</_>
+        <_>
+          11 10 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 7 -1.</_>
+        <_>
+          3 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 12 -1.</_>
+        <_>
+          16 0 4 6 2.</_>
+        <_>
+          12 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 10 -1.</_>
+        <_>
+          5 6 5 5 2.</_>
+        <_>
+          10 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 2 18 -1.</_>
+        <_>
+          10 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 8 -1.</_>
+        <_>
+          4 9 6 4 2.</_>
+        <_>
+          10 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 13 -1.</_>
+        <_>
+          18 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 4 -1.</_>
+        <_>
+          6 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 13 -1.</_>
+        <_>
+          18 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 2 17 -1.</_>
+        <_>
+          7 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 8 -1.</_>
+        <_>
+          11 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          7 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 13 -1.</_>
+        <_>
+          18 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 13 3 -1.</_>
+        <_>
+          0 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 6 -1.</_>
+        <_>
+          2 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 8 -1.</_>
+        <_>
+          12 4 7 4 2.</_>
+        <_>
+          5 8 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 5 6 3 2.</_>
+        <_>
+          10 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          10 10 4 4 2.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 5 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 6 -1.</_>
+        <_>
+          6 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 4 -1.</_>
+        <_>
+          10 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 18 -1.</_>
+        <_>
+          15 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 9 15 -1.</_>
+        <_>
+          4 2 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          7 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 5 -1.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 2 -1.</_>
+        <_>
+          4 3 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 13 3 -1.</_>
+        <_>
+          1 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 8 -1.</_>
+        <_>
+          6 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 5 9 -1.</_>
+        <_>
+          4 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 10 -1.</_>
+        <_>
+          13 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 10 -1.</_>
+        <_>
+          2 9 6 5 2.</_>
+        <_>
+          8 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 3 -1.</_>
+        <_>
+          8 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 12 -1.</_>
+        <_>
+          1 0 4 6 2.</_>
+        <_>
+          5 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 5 10 -1.</_>
+        <_>
+          5 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 10 12 -1.</_>
+        <_>
+          9 9 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 7 6 -1.</_>
+        <_>
+          1 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          5 9 5 4 2.</_>
+        <_>
+          10 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 9 -1.</_>
+        <_>
+          11 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 8 -1.</_>
+        <_>
+          6 3 4 4 2.</_>
+        <_>
+          10 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 9 4 -1.</_>
+        <_>
+          11 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 8 4 -1.</_>
+        <_>
+          12 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 8 4 -1.</_>
+        <_>
+          0 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 3 -1.</_>
+        <_>
+          0 12 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 16 -1.</_>
+        <_>
+          1 0 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 11 -1.</_>
+        <_>
+          3 2 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 8 6 -1.</_>
+        <_>
+          4 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 6 -1.</_>
+        <_>
+          3 2 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 13 3 -1.</_>
+        <_>
+          1 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 6 -1.</_>
+        <_>
+          15 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 3 -1.</_>
+        <_>
+          3 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 7 6 -1.</_>
+        <_>
+          0 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 6 -1.</_>
+        <_>
+          10 6 8 3 2.</_>
+        <_>
+          2 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 10 -1.</_>
+        <_>
+          2 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 6 -1.</_>
+        <_>
+          15 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 6 -1.</_>
+        <_>
+          5 7 5 3 2.</_>
+        <_>
+          10 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 6 -1.</_>
+        <_>
+          15 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 5 6 -1.</_>
+        <_>
+          0 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 15 -1.</_>
+        <_>
+          10 10 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 5 -1.</_>
+        <_>
+          8 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 6 -1.</_>
+        <_>
+          13 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 13 3 -1.</_>
+        <_>
+          3 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 6 -1.</_>
+        <_>
+          13 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 7 6 -1.</_>
+        <_>
+          0 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 18 -1.</_>
+        <_>
+          10 1 5 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 18 -1.</_>
+        <_>
+          5 1 5 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 5 -1.</_>
+        <_>
+          8 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 8 -1.</_>
+        <_>
+          4 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 10 -1.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 9 5 -1.</_>
+        <_>
+          12 11 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          3 11 7 2 2.</_>
+        <_>
+          10 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 4 -1.</_>
+        <_>
+          10 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 13 -1.</_>
+        <_>
+          9 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 14 -1.</_>
+        <_>
+          7 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 4 -1.</_>
+        <_>
+          10 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 4 -1.</_>
+        <_>
+          4 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          14 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 11 -1.</_>
+        <_>
+          3 1 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 9 5 -1.</_>
+        <_>
+          12 11 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 9 5 -1.</_>
+        <_>
+          5 11 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 7 -1.</_>
+        <_>
+          9 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 15 -1.</_>
+        <_>
+          2 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 15 -1.</_>
+        <_>
+          12 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 15 -1.</_>
+        <_>
+          7 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 2 -1.</_>
+        <_>
+          6 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 3 -1.</_>
+        <_>
+          0 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 7 -1.</_>
+        <_>
+          7 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 4 -1.</_>
+        <_>
+          10 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 4 -1.</_>
+        <_>
+          6 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 15 -1.</_>
+        <_>
+          8 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 8 -1.</_>
+        <_>
+          5 4 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 14 -1.</_>
+        <_>
+          6 3 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 6 -1.</_>
+        <_>
+          15 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 6 -1.</_>
+        <_>
+          0 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          8 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          10 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 19 -1.</_>
+        <_>
+          14 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 19 -1.</_>
+        <_>
+          5 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 7 -1.</_>
+        <_>
+          13 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 3 -1.</_>
+        <_>
+          7 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 8 -1.</_>
+        <_>
+          8 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 16 -1.</_>
+        <_>
+          6 10 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 9 -1.</_>
+        <_>
+          8 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 7 4 -1.</_>
+        <_>
+          2 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 7 4 -1.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 12 -1.</_>
+        <_>
+          7 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 4 -1.</_>
+        <_>
+          3 6 7 2 2.</_>
+        <_>
+          10 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 10 -1.</_>
+        <_>
+          7 4 3 5 2.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 15 -1.</_>
+        <_>
+          14 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 3 -1.</_>
+        <_>
+          0 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 15 -1.</_>
+        <_>
+          1 9 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 14 -1.</_>
+        <_>
+          5 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 4 -1.</_>
+        <_>
+          1 15 9 2 2.</_>
+        <_>
+          10 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 8 6 -1.</_>
+        <_>
+          10 15 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 7 6 -1.</_>
+        <_>
+          1 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 18 -1.</_>
+        <_>
+          13 0 5 9 2.</_>
+        <_>
+          8 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 3 -1.</_>
+        <_>
+          6 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 6 -1.</_>
+        <_>
+          15 4 5 3 2.</_>
+        <_>
+          10 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 4 -1.</_>
+        <_>
+          10 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 12 -1.</_>
+        <_>
+          10 4 6 6 2.</_>
+        <_>
+          4 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 3 -1.</_>
+        <_>
+          10 0 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 10 -1.</_>
+        <_>
+          11 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 5 15 -1.</_>
+        <_>
+          2 9 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 14 -1.</_>
+        <_>
+          17 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 14 -1.</_>
+        <_>
+          1 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 3 -1.</_>
+        <_>
+          2 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 4 -1.</_>
+        <_>
+          0 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 6 -1.</_>
+        <_>
+          2 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 15 3 -1.</_>
+        <_>
+          7 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 7 -1.</_>
+        <_>
+          12 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 6 7 -1.</_>
+        <_>
+          5 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 13 -1.</_>
+        <_>
+          14 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 8 -1.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 5 -1.</_>
+        <_>
+          8 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 13 -1.</_>
+        <_>
+          14 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 13 -1.</_>
+        <_>
+          5 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 4 -1.</_>
+        <_>
+          13 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 13 3 -1.</_>
+        <_>
+          0 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 12 -1.</_>
+        <_>
+          6 11 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 14 4 -1.</_>
+        <_>
+          2 2 7 2 2.</_>
+        <_>
+          9 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 13 -1.</_>
+        <_>
+          10 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 4 -1.</_>
+        <_>
+          13 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 7 6 -1.</_>
+        <_>
+          6 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 6 -1.</_>
+        <_>
+          8 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 10 -1.</_>
+        <_>
+          8 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 14 6 -1.</_>
+        <_>
+          2 2 7 3 2.</_>
+        <_>
+          9 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 7 -1.</_>
+        <_>
+          5 0 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 5 -1.</_>
+        <_>
+          10 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 18 -1.</_>
+        <_>
+          13 0 5 9 2.</_>
+        <_>
+          8 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 14 6 -1.</_>
+        <_>
+          2 5 7 3 2.</_>
+        <_>
+          9 8 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          10 1 3 5 2.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 10 6 -1.</_>
+        <_>
+          14 9 5 3 2.</_>
+        <_>
+          9 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 10 -1.</_>
+        <_>
+          2 13 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 19 2 -1.</_>
+        <_>
+          1 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 6 -1.</_>
+        <_>
+          4 12 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 12 -1.</_>
+        <_>
+          9 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 7 6 -1.</_>
+        <_>
+          10 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 7 6 -1.</_>
+        <_>
+          3 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 15 -1.</_>
+        <_>
+          15 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 17 10 -1.</_>
+        <_>
+          0 8 17 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 4 -1.</_>
+        <_>
+          10 0 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 6 -1.</_>
+        <_>
+          11 1 5 3 2.</_>
+        <_>
+          6 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 11 -1.</_>
+        <_>
+          6 9 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 6 -1.</_>
+        <_>
+          0 12 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 10 -1.</_>
+        <_>
+          13 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          7 10 3 5 2.</_>
+        <_>
+          10 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 15 -1.</_>
+        <_>
+          6 6 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 3 -1.</_>
+        <_>
+          0 9 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 10 -1.</_>
+        <_>
+          3 10 3 5 2.</_>
+        <_>
+          6 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 8 12 -1.</_>
+        <_>
+          15 8 4 6 2.</_>
+        <_>
+          11 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 12 -1.</_>
+        <_>
+          1 8 4 6 2.</_>
+        <_>
+          5 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 13 -1.</_>
+        <_>
+          14 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 5 9 -1.</_>
+        <_>
+          6 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 5 -1.</_>
+        <_>
+          7 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 8 -1.</_>
+        <_>
+          2 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 6 -1.</_>
+        <_>
+          5 3 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 13 -1.</_>
+        <_>
+          13 5 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 10 -1.</_>
+        <_>
+          5 9 3 5 2.</_>
+        <_>
+          8 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 3 -1.</_>
+        <_>
+          8 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 13 -1.</_>
+        <_>
+          6 5 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 10 -1.</_>
+        <_>
+          11 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 10 -1.</_>
+        <_>
+          7 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 14 -1.</_>
+        <_>
+          9 2 5 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 15 14 -1.</_>
+        <_>
+          6 2 5 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 9 -1.</_>
+        <_>
+          5 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 10 8 -1.</_>
+        <_>
+          1 3 5 4 2.</_>
+        <_>
+          6 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 14 6 -1.</_>
+        <_>
+          5 13 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 14 6 -1.</_>
+        <_>
+          8 13 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 13 3 -1.</_>
+        <_>
+          7 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          10 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 6 -1.</_>
+        <_>
+          10 0 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 6 -1.</_>
+        <_>
+          5 0 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 13 -1.</_>
+        <_>
+          12 1 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 13 -1.</_>
+        <_>
+          4 1 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 18 -1.</_>
+        <_>
+          15 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 4 -1.</_>
+        <_>
+          8 0 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 18 -1.</_>
+        <_>
+          15 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 18 -1.</_>
+        <_>
+          3 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 6 -1.</_>
+        <_>
+          8 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 5 -1.</_>
+        <_>
+          5 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 12 -1.</_>
+        <_>
+          12 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 11 6 -1.</_>
+        <_>
+          4 6 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 6 -1.</_>
+        <_>
+          11 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 8 -1.</_>
+        <_>
+          5 6 4 4 2.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 8 -1.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 4 -1.</_>
+        <_>
+          6 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 13 2 -1.</_>
+        <_>
+          1 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 7 -1.</_>
+        <_>
+          8 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 14 -1.</_>
+        <_>
+          9 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 2 -1.</_>
+        <_>
+          0 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          10 9 5 4 2.</_>
+        <_>
+          5 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 6 -1.</_>
+        <_>
+          3 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 6 -1.</_>
+        <_>
+          7 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 2 -1.</_>
+        <_>
+          3 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 5 6 -1.</_>
+        <_>
+          10 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 14 -1.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 8 -1.</_>
+        <_>
+          12 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 8 -1.</_>
+        <_>
+          4 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 14 -1.</_>
+        <_>
+          1 4 2 7 2.</_>
+        <_>
+          3 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 20 -1.</_>
+        <_>
+          12 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 5 -1.</_>
+        <_>
+          9 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 20 -1.</_>
+        <_>
+          12 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 14 -1.</_>
+        <_>
+          2 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 20 -1.</_>
+        <_>
+          12 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 20 -1.</_>
+        <_>
+          7 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          16 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 7 -1.</_>
+        <_>
+          2 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 14 -1.</_>
+        <_>
+          7 1 6 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 13 -1.</_>
+        <_>
+          11 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 4 -1.</_>
+        <_>
+          12 10 8 2 2.</_>
+        <_>
+          4 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 4 -1.</_>
+        <_>
+          0 10 9 2 2.</_>
+        <_>
+          9 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 6 -1.</_>
+        <_>
+          1 4 7 3 2.</_>
+        <_>
+          8 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 10 -1.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 10 -1.</_>
+        <_>
+          5 8 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 10 -1.</_>
+        <_>
+          11 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 10 -1.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 20 -1.</_>
+        <_>
+          6 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          7 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 8 -1.</_>
+        <_>
+          8 7 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          0 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 10 -1.</_>
+        <_>
+          11 0 8 5 2.</_>
+        <_>
+          3 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          0 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_>
+        <_>
+          3 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 8 -1.</_>
+        <_>
+          4 1 4 4 2.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 13 3 -1.</_>
+        <_>
+          0 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 13 2 -1.</_>
+        <_>
+          6 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 5 9 -1.</_>
+        <_>
+          4 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 6 -1.</_>
+        <_>
+          7 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          2 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 13 2 -1.</_>
+        <_>
+          5 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 12 -1.</_>
+        <_>
+          17 7 3 6 2.</_>
+        <_>
+          14 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 12 4 -1.</_>
+        <_>
+          7 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 15 5 -1.</_>
+        <_>
+          7 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 12 -1.</_>
+        <_>
+          10 0 3 6 2.</_>
+        <_>
+          7 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 10 -1.</_>
+        <_>
+          8 3 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          8 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 8 -1.</_>
+        <_>
+          0 7 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 12 -1.</_>
+        <_>
+          0 7 3 6 2.</_>
+        <_>
+          3 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 14 -1.</_>
+        <_>
+          12 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 8 -1.</_>
+        <_>
+          2 0 8 4 2.</_>
+        <_>
+          10 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 9 -1.</_>
+        <_>
+          9 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 8 -1.</_>
+        <_>
+          0 12 4 4 2.</_>
+        <_>
+          4 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 4 -1.</_>
+        <_>
+          0 10 8 2 2.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          10 2 10 2 2.</_>
+        <_>
+          0 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 14 -1.</_>
+        <_>
+          3 5 2 7 2.</_>
+        <_>
+          5 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 11 9 -1.</_>
+        <_>
+          5 13 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 9 -1.</_>
+        <_>
+          4 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 3 -1.</_>
+        <_>
+          3 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 15 -1.</_>
+        <_>
+          3 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 13 3 -1.</_>
+        <_>
+          7 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 7 -1.</_>
+        <_>
+          14 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 7 -1.</_>
+        <_>
+          3 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 17 -1.</_>
+        <_>
+          14 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 13 -1.</_>
+        <_>
+          10 4 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 9 -1.</_>
+        <_>
+          10 6 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 12 9 -1.</_>
+        <_>
+          6 6 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          10 14 7 2 2.</_>
+        <_>
+          3 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 4 -1.</_>
+        <_>
+          3 5 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          10 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 11 6 -1.</_>
+        <_>
+          0 16 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 17 -1.</_>
+        <_>
+          5 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 17 -1.</_>
+        <_>
+          14 3 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 9 -1.</_>
+        <_>
+          7 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 6 -1.</_>
+        <_>
+          12 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 17 -1.</_>
+        <_>
+          5 3 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 3 -1.</_>
+        <_>
+          5 15 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 6 -1.</_>
+        <_>
+          7 10 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 10 -1.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 2 -1.</_>
+        <_>
+          5 9 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 13 3 -1.</_>
+        <_>
+          0 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 17 6 -1.</_>
+        <_>
+          3 15 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 4 -1.</_>
+        <_>
+          6 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 2 -1.</_>
+        <_>
+          6 8 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 8 -1.</_>
+        <_>
+          6 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 4 -1.</_>
+        <_>
+          12 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 14 -1.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 7 -1.</_>
+        <_>
+          14 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 4 -1.</_>
+        <_>
+          4 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 7 -1.</_>
+        <_>
+          14 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 7 -1.</_>
+        <_>
+          3 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 4 -1.</_>
+        <_>
+          10 13 8 2 2.</_>
+        <_>
+          2 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 14 -1.</_>
+        <_>
+          5 9 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 13 2 -1.</_>
+        <_>
+          7 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 3 -1.</_>
+        <_>
+          4 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 4 -1.</_>
+        <_>
+          5 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 3 -1.</_>
+        <_>
+          9 0 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 8 4 -1.</_>
+        <_>
+          11 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 15 -1.</_>
+        <_>
+          0 8 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 8 -1.</_>
+        <_>
+          2 13 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 4 -1.</_>
+        <_>
+          0 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          10 5 6 6 2.</_>
+        <_>
+          4 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 5 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 16 -1.</_>
+        <_>
+          18 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 16 -1.</_>
+        <_>
+          0 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 10 -1.</_>
+        <_>
+          17 7 3 5 2.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 6 -1.</_>
+        <_>
+          0 2 6 3 2.</_>
+        <_>
+          6 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 10 -1.</_>
+        <_>
+          15 0 5 5 2.</_>
+        <_>
+          10 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 4 -1.</_>
+        <_>
+          11 7 9 2 2.</_>
+        <_>
+          2 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 14 -1.</_>
+        <_>
+          5 3 3 7 2.</_>
+        <_>
+          8 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 13 -1.</_>
+        <_>
+          10 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 10 -1.</_>
+        <_>
+          0 7 3 5 2.</_>
+        <_>
+          3 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 13 -1.</_>
+        <_>
+          14 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 8 4 -1.</_>
+        <_>
+          5 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 15 5 -1.</_>
+        <_>
+          10 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 13 -1.</_>
+        <_>
+          9 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 13 3 -1.</_>
+        <_>
+          7 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 8 -1.</_>
+        <_>
+          2 0 8 4 2.</_>
+        <_>
+          10 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 11 -1.</_>
+        <_>
+          15 7 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          7 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 8 -1.</_>
+        <_>
+          10 5 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 13 -1.</_>
+        <_>
+          5 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 12 -1.</_>
+        <_>
+          10 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 7 -1.</_>
+        <_>
+          9 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 4 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 4 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 8 -1.</_>
+        <_>
+          16 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 8 -1.</_>
+        <_>
+          7 5 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 8 -1.</_>
+        <_>
+          16 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 15 -1.</_>
+        <_>
+          4 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 13 2 -1.</_>
+        <_>
+          5 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 13 -1.</_>
+        <_>
+          3 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          6 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 15 -1.</_>
+        <_>
+          11 1 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 15 -1.</_>
+        <_>
+          6 1 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 6 -1.</_>
+        <_>
+          12 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 7 -1.</_>
+        <_>
+          2 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 16 -1.</_>
+        <_>
+          11 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 10 -1.</_>
+        <_>
+          7 1 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 8 -1.</_>
+        <_>
+          15 8 5 4 2.</_>
+        <_>
+          10 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 10 8 -1.</_>
+        <_>
+          0 8 5 4 2.</_>
+        <_>
+          5 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 16 -1.</_>
+        <_>
+          11 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 11 -1.</_>
+        <_>
+          9 9 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 3 -1.</_>
+        <_>
+          6 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 16 -1.</_>
+        <_>
+          3 1 5 8 2.</_>
+        <_>
+          8 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 10 -1.</_>
+        <_>
+          12 3 4 5 2.</_>
+        <_>
+          8 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 10 -1.</_>
+        <_>
+          4 3 4 5 2.</_>
+        <_>
+          8 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 9 6 -1.</_>
+        <_>
+          10 14 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 9 6 -1.</_>
+        <_>
+          1 14 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 14 4 -1.</_>
+        <_>
+          13 16 7 2 2.</_>
+        <_>
+          6 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 18 -1.</_>
+        <_>
+          1 6 9 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 4 -1.</_>
+        <_>
+          8 5 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 7 9 -1.</_>
+        <_>
+          1 8 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 7 -1.</_>
+        <_>
+          11 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 7 -1.</_>
+        <_>
+          7 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 15 4 -1.</_>
+        <_>
+          9 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 15 3 -1.</_>
+        <_>
+          5 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 18 -1.</_>
+        <_>
+          8 2 6 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 16 -1.</_>
+        <_>
+          7 4 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 6 -1.</_>
+        <_>
+          9 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 6 -1.</_>
+        <_>
+          1 14 5 3 2.</_>
+        <_>
+          6 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 5 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 5 9 -1.</_>
+        <_>
+          0 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 9 -1.</_>
+        <_>
+          13 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 9 -1.</_>
+        <_>
+          1 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 4 -1.</_>
+        <_>
+          5 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 12 -1.</_>
+        <_>
+          1 9 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 14 -1.</_>
+        <_>
+          2 11 13 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 6 -1.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 8 -1.</_>
+        <_>
+          2 5 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 6 -1.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 6 -1.</_>
+        <_>
+          4 2 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 2 -1.</_>
+        <_>
+          2 3 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 12 5 -1.</_>
+        <_>
+          10 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 6 -1.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 4 -1.</_>
+        <_>
+          6 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 6 -1.</_>
+        <_>
+          12 10 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 14 -1.</_>
+        <_>
+          1 5 3 7 2.</_>
+        <_>
+          4 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 9 13 -1.</_>
+        <_>
+          13 2 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 6 -1.</_>
+        <_>
+          7 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 9 -1.</_>
+        <_>
+          12 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 9 -1.</_>
+        <_>
+          5 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 2 -1.</_>
+        <_>
+          5 9 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          2 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 5 6 -1.</_>
+        <_>
+          12 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 5 6 -1.</_>
+        <_>
+          3 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          0 13 10 2 2.</_>
+        <_>
+          10 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 6 -1.</_>
+        <_>
+          2 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 10 -1.</_>
+        <_>
+          9 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 3 13 -1.</_>
+        <_>
+          2 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 16 -1.</_>
+        <_>
+          12 4 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 16 -1.</_>
+        <_>
+          6 4 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 9 5 -1.</_>
+        <_>
+          10 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 12 4 -1.</_>
+        <_>
+          8 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 6 -1.</_>
+        <_>
+          10 3 5 3 2.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 2 -1.</_>
+        <_>
+          6 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 8 4 -1.</_>
+        <_>
+          7 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          4 2 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 15 -1.</_>
+        <_>
+          0 7 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 6 -1.</_>
+        <_>
+          3 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 4 -1.</_>
+        <_>
+          0 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 2 -1.</_>
+        <_>
+          3 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 10 3 -1.</_>
+        <_>
+          9 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 3 -1.</_>
+        <_>
+          4 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 16 8 -1.</_>
+        <_>
+          4 12 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 16 8 -1.</_>
+        <_>
+          8 12 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 10 -1.</_>
+        <_>
+          16 9 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 11 12 -1.</_>
+        <_>
+          2 11 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 12 -1.</_>
+        <_>
+          9 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 15 -1.</_>
+        <_>
+          2 6 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 13 -1.</_>
+        <_>
+          17 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 2 13 -1.</_>
+        <_>
+          2 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          10 1 10 2 2.</_>
+        <_>
+          0 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          6 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 6 -1.</_>
+        <_>
+          8 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          12 0 4 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 8 -1.</_>
+        <_>
+          8 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 8 -1.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 5 -1.</_>
+        <_>
+          8 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 12 9 -1.</_>
+        <_>
+          12 10 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 9 5 -1.</_>
+        <_>
+          7 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          7 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 4 -1.</_>
+        <_>
+          12 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 15 16 -1.</_>
+        <_>
+          3 12 15 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 4 -1.</_>
+        <_>
+          0 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          9 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 8 9 -1.</_>
+        <_>
+          4 14 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 9 8 -1.</_>
+        <_>
+          14 3 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 9 8 -1.</_>
+        <_>
+          3 4 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 10 -1.</_>
+        <_>
+          12 4 3 5 2.</_>
+        <_>
+          9 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 4 -1.</_>
+        <_>
+          0 6 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 3 -1.</_>
+        <_>
+          8 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 13 3 -1.</_>
+        <_>
+          3 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_>
+        <_>
+          5 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 8 -1.</_>
+        <_>
+          11 1 4 4 2.</_>
+        <_>
+          7 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 4 -1.</_>
+        <_>
+          10 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 8 -1.</_>
+        <_>
+          1 6 9 4 2.</_>
+        <_>
+          10 10 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 13 3 -1.</_>
+        <_>
+          4 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 13 2 -1.</_>
+        <_>
+          1 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 8 -1.</_>
+        <_>
+          13 12 4 4 2.</_>
+        <_>
+          9 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 6 -1.</_>
+        <_>
+          0 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 9 -1.</_>
+        <_>
+          15 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 16 -1.</_>
+        <_>
+          0 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 9 -1.</_>
+        <_>
+          15 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 10 -1.</_>
+        <_>
+          2 5 8 5 2.</_>
+        <_>
+          10 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 2 -1.</_>
+        <_>
+          6 8 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 14 -1.</_>
+        <_>
+          10 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 7 -1.</_>
+        <_>
+          11 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 13 -1.</_>
+        <_>
+          7 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 3 -1.</_>
+        <_>
+          8 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 6 -1.</_>
+        <_>
+          12 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 7 -1.</_>
+        <_>
+          11 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 10 -1.</_>
+        <_>
+          5 9 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 18 -1.</_>
+        <_>
+          15 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 7 -1.</_>
+        <_>
+          11 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          10 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 18 -1.</_>
+        <_>
+          15 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 4 -1.</_>
+        <_>
+          4 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 3 -1.</_>
+        <_>
+          6 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 3 -1.</_>
+        <_>
+          0 7 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 8 -1.</_>
+        <_>
+          14 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 5 9 -1.</_>
+        <_>
+          1 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 16 6 -1.</_>
+        <_>
+          1 4 8 3 2.</_>
+        <_>
+          9 7 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 6 -1.</_>
+        <_>
+          9 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 6 -1.</_>
+        <_>
+          4 5 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 8 -1.</_>
+        <_>
+          9 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 6 -1.</_>
+        <_>
+          1 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 9 5 -1.</_>
+        <_>
+          11 3 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 16 -1.</_>
+        <_>
+          4 3 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 17 -1.</_>
+        <_>
+          15 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 9 7 -1.</_>
+        <_>
+          3 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 12 -1.</_>
+        <_>
+          8 4 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 9 -1.</_>
+        <_>
+          0 6 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 10 5 -1.</_>
+        <_>
+          9 9 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 5 -1.</_>
+        <_>
+          6 9 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 3 -1.</_>
+        <_>
+          9 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 3 -1.</_>
+        <_>
+          6 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          10 5 5 3 2.</_>
+        <_>
+          5 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 8 -1.</_>
+        <_>
+          3 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 2 -1.</_>
+        <_>
+          0 1 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 8 -1.</_>
+        <_>
+          12 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 8 -1.</_>
+        <_>
+          4 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 13 4 -1.</_>
+        <_>
+          7 17 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 6 -1.</_>
+        <_>
+          0 14 6 3 2.</_>
+        <_>
+          6 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 8 -1.</_>
+        <_>
+          16 11 4 4 2.</_>
+        <_>
+          12 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 8 -1.</_>
+        <_>
+          0 11 4 4 2.</_>
+        <_>
+          4 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 19 -1.</_>
+        <_>
+          6 0 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 3 -1.</_>
+        <_>
+          0 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 12 -1.</_>
+        <_>
+          7 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 4 -1.</_>
+        <_>
+          11 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 6 -1.</_>
+        <_>
+          11 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 8 6 -1.</_>
+        <_>
+          1 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 8 -1.</_>
+        <_>
+          4 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 15 -1.</_>
+        <_>
+          8 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 8 -1.</_>
+        <_>
+          14 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 10 -1.</_>
+        <_>
+          8 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 5 9 -1.</_>
+        <_>
+          2 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 3 -1.</_>
+        <_>
+          3 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 12 7 -1.</_>
+        <_>
+          9 13 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 15 -1.</_>
+        <_>
+          11 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 15 -1.</_>
+        <_>
+          8 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 7 4 -1.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 7 12 -1.</_>
+        <_>
+          5 4 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 7 4 -1.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 8 -1.</_>
+        <_>
+          3 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 5 -1.</_>
+        <_>
+          9 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 16 -1.</_>
+        <_>
+          7 0 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 8 -1.</_>
+        <_>
+          14 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 8 -1.</_>
+        <_>
+          2 8 4 4 2.</_>
+        <_>
+          6 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 8 -1.</_>
+        <_>
+          12 8 8 4 2.</_>
+        <_>
+          4 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          2 10 3 5 2.</_>
+        <_>
+          5 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 8 -1.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 16 3 -1.</_>
+        <_>
+          9 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 7 4 -1.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 7 4 -1.</_>
+        <_>
+          3 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 10 19 -1.</_>
+        <_>
+          9 0 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 13 -1.</_>
+        <_>
+          13 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 5 -1.</_>
+        <_>
+          7 4 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 7 -1.</_>
+        <_>
+          8 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 3 -1.</_>
+        <_>
+          2 1 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 7 9 -1.</_>
+        <_>
+          5 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 14 3 -1.</_>
+        <_>
+          4 6 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 7 6 -1.</_>
+        <_>
+          2 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 8 -1.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 18 -1.</_>
+        <_>
+          5 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 10 -1.</_>
+        <_>
+          15 0 5 5 2.</_>
+        <_>
+          10 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 3 -1.</_>
+        <_>
+          0 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 13 3 -1.</_>
+        <_>
+          6 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 13 -1.</_>
+        <_>
+          6 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 7 -1.</_>
+        <_>
+          6 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 3 -1.</_>
+        <_>
+          8 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 3 -1.</_>
+        <_>
+          6 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 17 3 -1.</_>
+        <_>
+          2 18 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 19 -1.</_>
+        <_>
+          9 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 12 -1.</_>
+        <_>
+          4 6 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 13 3 -1.</_>
+        <_>
+          0 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 11 12 -1.</_>
+        <_>
+          4 12 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 5 6 -1.</_>
+        <_>
+          12 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 6 -1.</_>
+        <_>
+          3 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 6 -1.</_>
+        <_>
+          13 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 17 -1.</_>
+        <_>
+          4 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 8 -1.</_>
+        <_>
+          5 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 6 -1.</_>
+        <_>
+          13 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 14 -1.</_>
+        <_>
+          7 8 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 8 -1.</_>
+        <_>
+          2 4 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 3 -1.</_>
+        <_>
+          7 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 16 -1.</_>
+        <_>
+          5 2 5 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 12 -1.</_>
+        <_>
+          5 6 15 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          9 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 5 -1.</_>
+        <_>
+          10 1 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 9 -1.</_>
+        <_>
+          4 8 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 6 -1.</_>
+        <_>
+          11 5 5 3 2.</_>
+        <_>
+          6 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 12 -1.</_>
+        <_>
+          5 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 4 -1.</_>
+        <_>
+          13 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 12 -1.</_>
+        <_>
+          0 8 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 3 -1.</_>
+        <_>
+          4 8 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 11 12 -1.</_>
+        <_>
+          4 14 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 3 -1.</_>
+        <_>
+          2 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 11 6 -1.</_>
+        <_>
+          4 4 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 8 6 -1.</_>
+        <_>
+          11 11 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 3 -1.</_>
+        <_>
+          0 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 3 -1.</_>
+        <_>
+          2 5 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 13 3 -1.</_>
+        <_>
+          6 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 7 -1.</_>
+        <_>
+          2 7 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 6 -1.</_>
+        <_>
+          11 6 5 3 2.</_>
+        <_>
+          6 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          9 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 13 -1.</_>
+        <_>
+          10 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 13 -1.</_>
+        <_>
+          9 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 12 -1.</_>
+        <_>
+          10 1 4 6 2.</_>
+        <_>
+          6 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 6 -1.</_>
+        <_>
+          4 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 10 -1.</_>
+        <_>
+          12 3 3 5 2.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 6 -1.</_>
+        <_>
+          2 3 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 16 -1.</_>
+        <_>
+          8 1 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 14 6 -1.</_>
+        <_>
+          9 1 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 14 -1.</_>
+        <_>
+          8 1 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 14 -1.</_>
+        <_>
+          6 1 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 13 -1.</_>
+        <_>
+          8 3 6 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 13 2 -1.</_>
+        <_>
+          7 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 10 6 -1.</_>
+        <_>
+          5 13 5 3 2.</_>
+        <_>
+          10 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 12 6 -1.</_>
+        <_>
+          13 2 6 3 2.</_>
+        <_>
+          7 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          4 2 6 3 2.</_>
+        <_>
+          10 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 8 -1.</_>
+        <_>
+          12 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 8 -1.</_>
+        <_>
+          0 8 8 4 2.</_>
+        <_>
+          8 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_>
+        <_>
+          10 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 8 -1.</_>
+        <_>
+          0 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 12 -1.</_>
+        <_>
+          13 2 3 6 2.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 14 -1.</_>
+        <_>
+          0 7 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 7 6 -1.</_>
+        <_>
+          11 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 8 6 -1.</_>
+        <_>
+          1 11 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 15 -1.</_>
+        <_>
+          13 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 7 15 -1.</_>
+        <_>
+          0 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 6 -1.</_>
+        <_>
+          4 6 5 3 2.</_>
+        <_>
+          9 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 4 -1.</_>
+        <_>
+          5 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 19 -1.</_>
+        <_>
+          14 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 19 -1.</_>
+        <_>
+          5 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 6 -1.</_>
+        <_>
+          12 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 5 6 -1.</_>
+        <_>
+          3 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          12 6 5 3 2.</_>
+        <_>
+          7 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 9 5 -1.</_>
+        <_>
+          6 11 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 16 -1.</_>
+        <_>
+          8 1 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 16 -1.</_>
+        <_>
+          6 1 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 5 -1.</_>
+        <_>
+          9 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 10 -1.</_>
+        <_>
+          2 10 8 5 2.</_>
+        <_>
+          10 15 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 14 -1.</_>
+        <_>
+          14 0 2 7 2.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 14 -1.</_>
+        <_>
+          4 0 2 7 2.</_>
+        <_>
+          6 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 9 -1.</_>
+        <_>
+          12 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 9 -1.</_>
+        <_>
+          6 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 20 -1.</_>
+        <_>
+          16 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 20 -1.</_>
+        <_>
+          3 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 2 14 -1.</_>
+        <_>
+          5 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 3 -1.</_>
+        <_>
+          6 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 9 6 -1.</_>
+        <_>
+          6 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 6 -1.</_>
+        <_>
+          5 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 3 -1.</_>
+        <_>
+          10 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 8 4 -1.</_>
+        <_>
+          4 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 4 -1.</_>
+        <_>
+          10 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 7 -1.</_>
+        <_>
+          8 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 12 -1.</_>
+        <_>
+          6 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 8 -1.</_>
+        <_>
+          16 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 18 -1.</_>
+        <_>
+          9 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          2 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 6 -1.</_>
+        <_>
+          14 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 3 -1.</_>
+        <_>
+          0 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 4 -1.</_>
+        <_>
+          3 10 7 2 2.</_>
+        <_>
+          10 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 17 2 -1.</_>
+        <_>
+          3 9 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 12 -1.</_>
+        <_>
+          0 11 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 6 -1.</_>
+        <_>
+          3 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 7 -1.</_>
+        <_>
+          9 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 13 2 -1.</_>
+        <_>
+          4 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 2 -1.</_>
+        <_>
+          8 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 15 -1.</_>
+        <_>
+          8 5 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 14 -1.</_>
+        <_>
+          8 6 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 8 -1.</_>
+        <_>
+          12 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 5 -1.</_>
+        <_>
+          8 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 12 -1.</_>
+        <_>
+          11 5 5 6 2.</_>
+        <_>
+          6 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 14 -1.</_>
+        <_>
+          3 5 6 7 2.</_>
+        <_>
+          9 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          7 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 12 -1.</_>
+        <_>
+          5 11 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 14 -1.</_>
+        <_>
+          13 6 2 7 2.</_>
+        <_>
+          11 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 14 -1.</_>
+        <_>
+          5 6 2 7 2.</_>
+        <_>
+          7 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 17 2 -1.</_>
+        <_>
+          3 2 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 16 -1.</_>
+        <_>
+          7 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          8 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 15 -1.</_>
+        <_>
+          8 5 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 15 -1.</_>
+        <_>
+          6 5 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 19 -1.</_>
+        <_>
+          6 0 4 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 11 4 -1.</_>
+        <_>
+          9 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          0 6 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 4 -1.</_>
+        <_>
+          5 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 4 -1.</_>
+        <_>
+          5 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 3 -1.</_>
+        <_>
+          6 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 3 -1.</_>
+        <_>
+          0 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 13 6 -1.</_>
+        <_>
+          5 6 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 11 4 -1.</_>
+        <_>
+          0 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 3 -1.</_>
+        <_>
+          5 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 4 -1.</_>
+        <_>
+          0 2 10 2 2.</_>
+        <_>
+          10 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 5 -1.</_>
+        <_>
+          14 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 5 6 -1.</_>
+        <_>
+          4 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 18 -1.</_>
+        <_>
+          6 10 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          0 8 3 6 2.</_>
+        <_>
+          3 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 10 6 -1.</_>
+        <_>
+          14 9 5 3 2.</_>
+        <_>
+          9 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 6 -1.</_>
+        <_>
+          1 9 5 3 2.</_>
+        <_>
+          6 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 13 -1.</_>
+        <_>
+          16 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 13 -1.</_>
+        <_>
+          3 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 13 -1.</_>
+        <_>
+          18 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 13 -1.</_>
+        <_>
+          1 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 16 -1.</_>
+        <_>
+          16 4 3 8 2.</_>
+        <_>
+          13 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 14 -1.</_>
+        <_>
+          4 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 13 -1.</_>
+        <_>
+          17 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 13 -1.</_>
+        <_>
+          2 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 9 -1.</_>
+        <_>
+          8 9 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 2 -1.</_>
+        <_>
+          0 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 6 -1.</_>
+        <_>
+          12 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 6 -1.</_>
+        <_>
+          5 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 6 -1.</_>
+        <_>
+          10 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          9 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 20 -1.</_>
+        <_>
+          1 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          16 5 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          16 5 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 14 -1.</_>
+        <_>
+          2 5 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 4 -1.</_>
+        <_>
+          10 11 10 2 2.</_>
+        <_>
+          0 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          10 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 6 -1.</_>
+        <_>
+          10 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 9 6 -1.</_>
+        <_>
+          1 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 5 8 -1.</_>
+        <_>
+          11 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 11 -1.</_>
+        <_>
+          11 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 11 -1.</_>
+        <_>
+          7 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          10 1 3 5 2.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 5 -1.</_>
+        <_>
+          8 2 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 17 3 -1.</_>
+        <_>
+          2 18 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 3 -1.</_>
+        <_>
+          0 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 4 10 -1.</_>
+        <_>
+          7 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 6 -1.</_>
+        <_>
+          2 14 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 3 -1.</_>
+        <_>
+          5 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 12 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 6 -1.</_>
+        <_>
+          13 1 7 3 2.</_>
+        <_>
+          6 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 6 -1.</_>
+        <_>
+          3 3 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 11 6 -1.</_>
+        <_>
+          9 7 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 13 -1.</_>
+        <_>
+          6 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 14 -1.</_>
+        <_>
+          17 5 2 7 2.</_>
+        <_>
+          15 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 3 -1.</_>
+        <_>
+          5 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 6 -1.</_>
+        <_>
+          10 10 7 3 2.</_>
+        <_>
+          3 13 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 3 -1.</_>
+        <_>
+          5 15 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 6 -1.</_>
+        <_>
+          0 1 7 3 2.</_>
+        <_>
+          7 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 4 -1.</_>
+        <_>
+          10 16 7 2 2.</_>
+        <_>
+          3 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 10 -1.</_>
+        <_>
+          0 1 3 5 2.</_>
+        <_>
+          3 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 8 8 -1.</_>
+        <_>
+          14 3 4 4 2.</_>
+        <_>
+          10 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 6 -1.</_>
+        <_>
+          1 5 5 3 2.</_>
+        <_>
+          6 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 14 -1.</_>
+        <_>
+          14 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 14 -1.</_>
+        <_>
+          4 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 4 -1.</_>
+        <_>
+          4 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 8 -1.</_>
+        <_>
+          2 3 4 4 2.</_>
+        <_>
+          6 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 16 -1.</_>
+        <_>
+          17 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 14 -1.</_>
+        <_>
+          1 5 2 7 2.</_>
+        <_>
+          3 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 10 -1.</_>
+        <_>
+          8 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 8 10 -1.</_>
+        <_>
+          4 2 4 5 2.</_>
+        <_>
+          8 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 10 8 -1.</_>
+        <_>
+          13 5 5 4 2.</_>
+        <_>
+          8 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 7 -1.</_>
+        <_>
+          16 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 16 -1.</_>
+        <_>
+          1 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 12 -1.</_>
+        <_>
+          0 6 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 7 4 -1.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 13 6 -1.</_>
+        <_>
+          2 12 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 14 -1.</_>
+        <_>
+          2 9 16 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 8 -1.</_>
+        <_>
+          4 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 15 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 4 -1.</_>
+        <_>
+          10 14 9 2 2.</_>
+        <_>
+          1 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 5 -1.</_>
+        <_>
+          4 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 19 -1.</_>
+        <_>
+          13 1 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 19 -1.</_>
+        <_>
+          4 1 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 3 -1.</_>
+        <_>
+          6 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 3 -1.</_>
+        <_>
+          0 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 7 6 -1.</_>
+        <_>
+          8 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 9 14 -1.</_>
+        <_>
+          3 3 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 9 6 -1.</_>
+        <_>
+          10 10 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 4 -1.</_>
+        <_>
+          0 1 8 2 2.</_>
+        <_>
+          8 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 7 -1.</_>
+        <_>
+          16 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 10 6 -1.</_>
+        <_>
+          0 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 7 -1.</_>
+        <_>
+          16 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 7 -1.</_>
+        <_>
+          2 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 14 -1.</_>
+        <_>
+          11 3 6 7 2.</_>
+        <_>
+          5 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 10 -1.</_>
+        <_>
+          7 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          16 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          2 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 5 6 3 2.</_>
+        <_>
+          10 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 8 -1.</_>
+        <_>
+          9 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 6 -1.</_>
+        <_>
+          8 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 14 -1.</_>
+        <_>
+          1 4 2 7 2.</_>
+        <_>
+          3 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 6 -1.</_>
+        <_>
+          10 1 10 3 2.</_>
+        <_>
+          0 4 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 6 -1.</_>
+        <_>
+          5 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 6 -1.</_>
+        <_>
+          0 5 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 8 -1.</_>
+        <_>
+          5 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 16 -1.</_>
+        <_>
+          15 4 2 8 2.</_>
+        <_>
+          13 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 18 -1.</_>
+        <_>
+          6 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 16 -1.</_>
+        <_>
+          15 4 2 8 2.</_>
+        <_>
+          13 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 16 -1.</_>
+        <_>
+          3 4 2 8 2.</_>
+        <_>
+          5 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 9 4 -1.</_>
+        <_>
+          6 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 12 -1.</_>
+        <_>
+          8 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          10 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 18 -1.</_>
+        <_>
+          17 2 3 9 2.</_>
+        <_>
+          14 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 10 8 -1.</_>
+        <_>
+          13 5 5 4 2.</_>
+        <_>
+          8 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 10 8 -1.</_>
+        <_>
+          2 5 5 4 2.</_>
+        <_>
+          7 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 12 -1.</_>
+        <_>
+          4 2 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 12 -1.</_>
+        <_>
+          8 2 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 7 -1.</_>
+        <_>
+          11 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 7 -1.</_>
+        <_>
+          7 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 4 -1.</_>
+        <_>
+          6 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 10 -1.</_>
+        <_>
+          6 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 10 8 -1.</_>
+        <_>
+          11 10 5 4 2.</_>
+        <_>
+          6 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 9 -1.</_>
+        <_>
+          4 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 18 -1.</_>
+        <_>
+          4 0 6 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 17 -1.</_>
+        <_>
+          7 1 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 8 -1.</_>
+        <_>
+          11 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 7 -1.</_>
+        <_>
+          8 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 9 -1.</_>
+        <_>
+          5 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 7 4 -1.</_>
+        <_>
+          4 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 10 8 -1.</_>
+        <_>
+          11 10 5 4 2.</_>
+        <_>
+          6 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 4 -1.</_>
+        <_>
+          12 7 7 2 2.</_>
+        <_>
+          5 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 7 -1.</_>
+        <_>
+          8 10 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 16 -1.</_>
+        <_>
+          11 2 6 8 2.</_>
+        <_>
+          5 10 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 14 4 -1.</_>
+        <_>
+          1 7 7 2 2.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 15 14 -1.</_>
+        <_>
+          3 12 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 9 -1.</_>
+        <_>
+          8 9 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 10 -1.</_>
+        <_>
+          7 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 11 -1.</_>
+        <_>
+          11 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 14 8 -1.</_>
+        <_>
+          8 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 11 -1.</_>
+        <_>
+          11 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 15 -1.</_>
+        <_>
+          7 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          8 2 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 14 -1.</_>
+        <_>
+          3 3 6 7 2.</_>
+        <_>
+          9 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 7 -1.</_>
+        <_>
+          9 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 7 -1.</_>
+        <_>
+          9 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 9 -1.</_>
+        <_>
+          0 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 9 -1.</_>
+        <_>
+          8 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 6 -1.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 14 3 -1.</_>
+        <_>
+          6 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 8 -1.</_>
+        <_>
+          6 12 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          10 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 12 -1.</_>
+        <_>
+          6 8 3 6 2.</_>
+        <_>
+          9 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          10 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 20 -1.</_>
+        <_>
+          6 10 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 13 -1.</_>
+        <_>
+          10 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 6 -1.</_>
+        <_>
+          8 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 13 -1.</_>
+        <_>
+          10 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 6 -1.</_>
+        <_>
+          8 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 7 -1.</_>
+        <_>
+          10 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 7 6 -1.</_>
+        <_>
+          3 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 5 12 -1.</_>
+        <_>
+          12 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 4 -1.</_>
+        <_>
+          4 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 14 3 -1.</_>
+        <_>
+          6 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 19 -1.</_>
+        <_>
+          13 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 13 -1.</_>
+        <_>
+          8 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 5 -1.</_>
+        <_>
+          13 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 5 -1.</_>
+        <_>
+          4 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 9 -1.</_>
+        <_>
+          8 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 5 12 -1.</_>
+        <_>
+          12 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 5 12 -1.</_>
+        <_>
+          3 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 9 -1.</_>
+        <_>
+          10 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 12 4 -1.</_>
+        <_>
+          4 18 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 18 4 -1.</_>
+        <_>
+          11 14 9 2 2.</_>
+        <_>
+          2 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 7 4 -1.</_>
+        <_>
+          6 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 8 -1.</_>
+        <_>
+          5 14 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 7 4 -1.</_>
+        <_>
+          4 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 7 4 -1.</_>
+        <_>
+          8 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 6 -1.</_>
+        <_>
+          9 10 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 2 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 8 -1.</_>
+        <_>
+          8 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 13 -1.</_>
+        <_>
+          13 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 10 -1.</_>
+        <_>
+          8 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 14 -1.</_>
+        <_>
+          12 1 4 7 2.</_>
+        <_>
+          8 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 19 -1.</_>
+        <_>
+          6 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 10 -1.</_>
+        <_>
+          12 10 3 5 2.</_>
+        <_>
+          9 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 14 -1.</_>
+        <_>
+          0 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 14 -1.</_>
+        <_>
+          18 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 14 -1.</_>
+        <_>
+          0 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 10 -1.</_>
+        <_>
+          13 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 18 -1.</_>
+        <_>
+          1 9 18 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 4 -1.</_>
+        <_>
+          10 16 9 2 2.</_>
+        <_>
+          1 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 6 -1.</_>
+        <_>
+          5 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 13 9 -1.</_>
+        <_>
+          4 10 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 10 -1.</_>
+        <_>
+          5 5 5 5 2.</_>
+        <_>
+          10 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 10 -1.</_>
+        <_>
+          12 4 4 5 2.</_>
+        <_>
+          8 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 4 -1.</_>
+        <_>
+          3 7 7 2 2.</_>
+        <_>
+          10 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 2 -1.</_>
+        <_>
+          1 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 3 -1.</_>
+        <_>
+          6 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 3 -1.</_>
+        <_>
+          0 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 6 -1.</_>
+        <_>
+          4 4 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 6 -1.</_>
+        <_>
+          0 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 6 -1.</_>
+        <_>
+          10 5 8 3 2.</_>
+        <_>
+          2 8 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 18 -1.</_>
+        <_>
+          18 2 2 9 2.</_>
+        <_>
+          16 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 15 -1.</_>
+        <_>
+          6 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 7 6 -1.</_>
+        <_>
+          10 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 14 -1.</_>
+        <_>
+          4 0 2 7 2.</_>
+        <_>
+          6 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 10 6 -1.</_>
+        <_>
+          11 3 5 3 2.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 6 -1.</_>
+        <_>
+          4 3 5 3 2.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 12 -1.</_>
+        <_>
+          4 8 13 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 7 -1.</_>
+        <_>
+          5 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 9 -1.</_>
+        <_>
+          11 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 13 -1.</_>
+        <_>
+          2 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 9 -1.</_>
+        <_>
+          11 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 8 -1.</_>
+        <_>
+          7 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          10 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 15 6 -1.</_>
+        <_>
+          5 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          10 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 4 -1.</_>
+        <_>
+          6 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 10 -1.</_>
+        <_>
+          13 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 5 -1.</_>
+        <_>
+          9 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 4 -1.</_>
+        <_>
+          7 2 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 13 3 -1.</_>
+        <_>
+          3 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 9 6 -1.</_>
+        <_>
+          10 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          0 3 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 11 -1.</_>
+        <_>
+          5 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 17 -1.</_>
+        <_>
+          14 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 9 -1.</_>
+        <_>
+          6 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 6 -1.</_>
+        <_>
+          9 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 6 -1.</_>
+        <_>
+          2 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 17 -1.</_>
+        <_>
+          14 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 17 -1.</_>
+        <_>
+          5 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 6 -1.</_>
+        <_>
+          8 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 12 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 5 9 -1.</_>
+        <_>
+          10 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 5 9 -1.</_>
+        <_>
+          5 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 18 -1.</_>
+        <_>
+          9 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 7 4 -1.</_>
+        <_>
+          6 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 9 -1.</_>
+        <_>
+          16 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 9 -1.</_>
+        <_>
+          2 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 18 -1.</_>
+        <_>
+          16 2 3 9 2.</_>
+        <_>
+          13 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 5 12 -1.</_>
+        <_>
+          2 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          3 17 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 6 -1.</_>
+        <_>
+          3 3 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 16 9 -1.</_>
+        <_>
+          4 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 16 9 -1.</_>
+        <_>
+          8 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 5 8 -1.</_>
+        <_>
+          11 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 9 -1.</_>
+        <_>
+          0 6 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 10 -1.</_>
+        <_>
+          10 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 18 -1.</_>
+        <_>
+          0 2 3 9 2.</_>
+        <_>
+          3 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 15 -1.</_>
+        <_>
+          9 10 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 13 2 -1.</_>
+        <_>
+          0 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 5 9 -1.</_>
+        <_>
+          11 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 14 6 -1.</_>
+        <_>
+          2 1 7 3 2.</_>
+        <_>
+          9 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 12 -1.</_>
+        <_>
+          12 0 3 6 2.</_>
+        <_>
+          9 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 12 -1.</_>
+        <_>
+          5 0 3 6 2.</_>
+        <_>
+          8 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 6 -1.</_>
+        <_>
+          9 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 6 -1.</_>
+        <_>
+          8 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 10 11 -1.</_>
+        <_>
+          8 3 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 10 11 -1.</_>
+        <_>
+          7 3 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 18 -1.</_>
+        <_>
+          8 2 6 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 19 -1.</_>
+        <_>
+          6 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 5 9 -1.</_>
+        <_>
+          10 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          3 15 7 2 2.</_>
+        <_>
+          10 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 16 6 -1.</_>
+        <_>
+          4 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 6 -1.</_>
+        <_>
+          8 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 14 -1.</_>
+        <_>
+          15 4 2 7 2.</_>
+        <_>
+          13 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 9 -1.</_>
+        <_>
+          3 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 7 -1.</_>
+        <_>
+          12 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 3 -1.</_>
+        <_>
+          5 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 9 -1.</_>
+        <_>
+          12 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 8 -1.</_>
+        <_>
+          3 12 4 4 2.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 2 -1.</_>
+        <_>
+          2 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 7 6 -1.</_>
+        <_>
+          13 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 8 -1.</_>
+        <_>
+          9 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 12 -1.</_>
+        <_>
+          7 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 14 -1.</_>
+        <_>
+          15 4 2 7 2.</_>
+        <_>
+          13 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 14 -1.</_>
+        <_>
+          3 4 2 7 2.</_>
+        <_>
+          5 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 2 -1.</_>
+        <_>
+          3 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 12 -1.</_>
+        <_>
+          10 10 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 9 5 -1.</_>
+        <_>
+          7 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 10 -1.</_>
+        <_>
+          12 4 8 5 2.</_>
+        <_>
+          4 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 10 -1.</_>
+        <_>
+          0 4 8 5 2.</_>
+        <_>
+          8 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 12 -1.</_>
+        <_>
+          7 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 13 -1.</_>
+        <_>
+          5 7 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 4 -1.</_>
+        <_>
+          13 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 8 -1.</_>
+        <_>
+          3 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 2 -1.</_>
+        <_>
+          0 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 4 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 8 -1.</_>
+        <_>
+          4 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 4 -1.</_>
+        <_>
+          10 6 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 4 -1.</_>
+        <_>
+          3 2 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 9 -1.</_>
+        <_>
+          13 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 9 -1.</_>
+        <_>
+          4 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 3 -1.</_>
+        <_>
+          6 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 5 -1.</_>
+        <_>
+          10 4 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 4 -1.</_>
+        <_>
+          12 1 7 2 2.</_>
+        <_>
+          5 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 14 4 -1.</_>
+        <_>
+          1 1 7 2 2.</_>
+        <_>
+          8 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 14 -1.</_>
+        <_>
+          0 6 2 7 2.</_>
+        <_>
+          2 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 9 -1.</_>
+        <_>
+          12 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 9 -1.</_>
+        <_>
+          5 12 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 9 -1.</_>
+        <_>
+          8 0 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 5 6 -1.</_>
+        <_>
+          1 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 7 4 -1.</_>
+        <_>
+          11 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 7 8 -1.</_>
+        <_>
+          7 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 3 10 -1.</_>
+        <_>
+          2 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 13 2 -1.</_>
+        <_>
+          7 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 7 4 -1.</_>
+        <_>
+          2 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 10 -1.</_>
+        <_>
+          17 1 3 5 2.</_>
+        <_>
+          14 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 10 -1.</_>
+        <_>
+          0 1 3 5 2.</_>
+        <_>
+          3 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 8 -1.</_>
+        <_>
+          12 0 4 4 2.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 9 -1.</_>
+        <_>
+          8 8 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 12 -1.</_>
+        <_>
+          9 1 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          6 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 18 -1.</_>
+        <_>
+          10 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 7 12 -1.</_>
+        <_>
+          0 9 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 9 -1.</_>
+        <_>
+          11 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 4 -1.</_>
+        <_>
+          3 9 7 2 2.</_>
+        <_>
+          10 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 17 3 -1.</_>
+        <_>
+          3 8 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 8 -1.</_>
+        <_>
+          10 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 9 -1.</_>
+        <_>
+          2 6 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 8 -1.</_>
+        <_>
+          4 4 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 6 -1.</_>
+        <_>
+          13 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 15 -1.</_>
+        <_>
+          5 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 7 -1.</_>
+        <_>
+          12 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 7 -1.</_>
+        <_>
+          6 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 8 -1.</_>
+        <_>
+          14 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 8 -1.</_>
+        <_>
+          2 8 4 4 2.</_>
+        <_>
+          6 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 10 -1.</_>
+        <_>
+          10 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 5 6 -1.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 12 -1.</_>
+        <_>
+          4 7 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 6 -1.</_>
+        <_>
+          4 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 9 10 -1.</_>
+        <_>
+          11 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 12 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 18 -1.</_>
+        <_>
+          11 7 9 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 10 -1.</_>
+        <_>
+          4 8 6 5 2.</_>
+        <_>
+          10 13 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 14 -1.</_>
+        <_>
+          6 0 4 7 2.</_>
+        <_>
+          10 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 8 -1.</_>
+        <_>
+          12 1 4 4 2.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 5 -1.</_>
+        <_>
+          8 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 8 -1.</_>
+        <_>
+          5 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 10 5 -1.</_>
+        <_>
+          5 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 15 -1.</_>
+        <_>
+          6 5 6 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 3 -1.</_>
+        <_>
+          10 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 15 3 -1.</_>
+        <_>
+          5 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 6 -1.</_>
+        <_>
+          11 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 6 -1.</_>
+        <_>
+          2 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 8 -1.</_>
+        <_>
+          15 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 4 -1.</_>
+        <_>
+          0 0 10 2 2.</_>
+        <_>
+          10 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 14 -1.</_>
+        <_>
+          10 5 3 7 2.</_>
+        <_>
+          7 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 4 -1.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 9 -1.</_>
+        <_>
+          11 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 9 -1.</_>
+        <_>
+          4 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          10 5 5 3 2.</_>
+        <_>
+          5 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 8 -1.</_>
+        <_>
+          0 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 8 -1.</_>
+        <_>
+          4 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 14 -1.</_>
+        <_>
+          16 5 2 7 2.</_>
+        <_>
+          14 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 14 -1.</_>
+        <_>
+          2 5 2 7 2.</_>
+        <_>
+          4 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 6 -1.</_>
+        <_>
+          8 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 14 -1.</_>
+        <_>
+          7 2 2 7 2.</_>
+        <_>
+          9 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 4 -1.</_>
+        <_>
+          12 7 7 2 2.</_>
+        <_>
+          5 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 14 4 -1.</_>
+        <_>
+          1 7 7 2 2.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 14 10 -1.</_>
+        <_>
+          2 6 7 5 2.</_>
+        <_>
+          9 11 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 11 -1.</_>
+        <_>
+          13 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 15 6 -1.</_>
+        <_>
+          7 13 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 4 -1.</_>
+        <_>
+          9 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 9 5 -1.</_>
+        <_>
+          6 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 17 18 -1.</_>
+        <_>
+          2 9 17 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 12 -1.</_>
+        <_>
+          1 4 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 11 -1.</_>
+        <_>
+          13 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 5 -1.</_>
+        <_>
+          6 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 2 -1.</_>
+        <_>
+          3 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 3 -1.</_>
+        <_>
+          9 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 3 -1.</_>
+        <_>
+          6 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 14 -1.</_>
+        <_>
+          12 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 13 -1.</_>
+        <_>
+          8 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 4 -1.</_>
+        <_>
+          13 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 2 -1.</_>
+        <_>
+          2 8 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 4 -1.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 10 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 8 -1.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 11 12 -1.</_>
+        <_>
+          0 10 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 14 -1.</_>
+        <_>
+          13 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 14 -1.</_>
+        <_>
+          3 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 10 -1.</_>
+        <_>
+          13 2 3 5 2.</_>
+        <_>
+          10 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 6 -1.</_>
+        <_>
+          4 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 6 -1.</_>
+        <_>
+          0 7 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 10 -1.</_>
+        <_>
+          4 2 3 5 2.</_>
+        <_>
+          7 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 5 -1.</_>
+        <_>
+          8 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 8 -1.</_>
+        <_>
+          6 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 9 -1.</_>
+        <_>
+          12 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 13 -1.</_>
+        <_>
+          9 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 15 -1.</_>
+        <_>
+          11 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 15 -1.</_>
+        <_>
+          8 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 4 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 13 -1.</_>
+        <_>
+          8 7 6 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 2 -1.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 15 3 -1.</_>
+        <_>
+          10 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 15 3 -1.</_>
+        <_>
+          5 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 8 5 -1.</_>
+        <_>
+          11 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 8 8 -1.</_>
+        <_>
+          3 1 4 4 2.</_>
+        <_>
+          7 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 10 -1.</_>
+        <_>
+          10 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 12 -1.</_>
+        <_>
+          8 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 2 -1.</_>
+        <_>
+          0 12 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 9 -1.</_>
+        <_>
+          2 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 5 -1.</_>
+        <_>
+          8 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 5 -1.</_>
+        <_>
+          6 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 14 -1.</_>
+        <_>
+          11 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          7 8 3 6 2.</_>
+        <_>
+          10 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 16 4 -1.</_>
+        <_>
+          2 17 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 2 19 -1.</_>
+        <_>
+          6 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 10 -1.</_>
+        <_>
+          10 4 3 5 2.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 15 4 -1.</_>
+        <_>
+          7 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 15 -1.</_>
+        <_>
+          12 1 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 4 -1.</_>
+        <_>
+          5 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 8 -1.</_>
+        <_>
+          6 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 8 -1.</_>
+        <_>
+          10 5 6 4 2.</_>
+        <_>
+          4 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 15 -1.</_>
+        <_>
+          6 1 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 12 -1.</_>
+        <_>
+          11 8 3 6 2.</_>
+        <_>
+          8 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 8 -1.</_>
+        <_>
+          5 6 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 14 -1.</_>
+        <_>
+          17 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 14 -1.</_>
+        <_>
+          2 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 13 -1.</_>
+        <_>
+          12 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 13 -1.</_>
+        <_>
+          7 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 13 -1.</_>
+        <_>
+          16 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 13 -1.</_>
+        <_>
+          2 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 3 -1.</_>
+        <_>
+          5 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 3 -1.</_>
+        <_>
+          8 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          10 8 3 6 2.</_>
+        <_>
+          7 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 7 -1.</_>
+        <_>
+          7 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 12 -1.</_>
+        <_>
+          12 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 4 12 -1.</_>
+        <_>
+          4 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 12 -1.</_>
+        <_>
+          3 4 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 4 -1.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 7 -1.</_>
+        <_>
+          12 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 3 -1.</_>
+        <_>
+          8 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 3 -1.</_>
+        <_>
+          0 10 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 12 -1.</_>
+        <_>
+          2 8 15 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 5 6 -1.</_>
+        <_>
+          11 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 3 -1.</_>
+        <_>
+          2 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 9 -1.</_>
+        <_>
+          10 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 12 6 -1.</_>
+        <_>
+          14 14 6 3 2.</_>
+        <_>
+          8 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 6 -1.</_>
+        <_>
+          6 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 4 -1.</_>
+        <_>
+          9 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 8 -1.</_>
+        <_>
+          2 15 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 8 -1.</_>
+        <_>
+          0 12 5 4 2.</_>
+        <_>
+          5 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 7 -1.</_>
+        <_>
+          13 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 9 -1.</_>
+        <_>
+          12 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 9 -1.</_>
+        <_>
+          3 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 11 6 -1.</_>
+        <_>
+          5 8 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 7 -1.</_>
+        <_>
+          6 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 5 -1.</_>
+        <_>
+          7 8 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 7 -1.</_>
+        <_>
+          7 3 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 8 -1.</_>
+        <_>
+          7 15 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          10 14 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 11 9 -1.</_>
+        <_>
+          5 9 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 8 -1.</_>
+        <_>
+          7 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 6 -1.</_>
+        <_>
+          6 8 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 7 -1.</_>
+        <_>
+          13 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 7 -1.</_>
+        <_>
+          5 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 10 -1.</_>
+        <_>
+          6 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 16 -1.</_>
+        <_>
+          14 4 6 8 2.</_>
+        <_>
+          8 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 16 -1.</_>
+        <_>
+          0 4 6 8 2.</_>
+        <_>
+          6 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 7 -1.</_>
+        <_>
+          10 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          8 6 2 7 2.</_>
+        <_>
+          10 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 10 18 -1.</_>
+        <_>
+          10 2 5 9 2.</_>
+        <_>
+          5 11 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 7 6 -1.</_>
+        <_>
+          6 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 5 12 -1.</_>
+        <_>
+          9 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 19 15 -1.</_>
+        <_>
+          1 10 19 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 7 4 -1.</_>
+        <_>
+          0 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 6 -1.</_>
+        <_>
+          11 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 10 6 -1.</_>
+        <_>
+          4 0 5 3 2.</_>
+        <_>
+          9 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 7 6 -1.</_>
+        <_>
+          11 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 5 -1.</_>
+        <_>
+          8 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 11 4 -1.</_>
+        <_>
+          9 6 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 10 -1.</_>
+        <_>
+          2 1 3 5 2.</_>
+        <_>
+          5 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 8 -1.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 8 -1.</_>
+        <_>
+          0 5 9 4 2.</_>
+        <_>
+          9 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 12 -1.</_>
+        <_>
+          9 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 2 -1.</_>
+        <_>
+          0 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 13 -1.</_>
+        <_>
+          11 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 14 -1.</_>
+        <_>
+          8 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 8 -1.</_>
+        <_>
+          9 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 12 -1.</_>
+        <_>
+          4 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 17 2 -1.</_>
+        <_>
+          3 4 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 6 -1.</_>
+        <_>
+          2 2 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 4 -1.</_>
+        <_>
+          8 0 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 10 6 -1.</_>
+        <_>
+          1 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 12 -1.</_>
+        <_>
+          3 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 15 5 -1.</_>
+        <_>
+          9 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 3 -1.</_>
+        <_>
+          0 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 7 -1.</_>
+        <_>
+          12 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 7 -1.</_>
+        <_>
+          6 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 6 -1.</_>
+        <_>
+          6 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 14 12 -1.</_>
+        <_>
+          1 7 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 15 5 -1.</_>
+        <_>
+          9 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 15 5 -1.</_>
+        <_>
+          6 15 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 7 -1.</_>
+        <_>
+          11 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 7 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 5 -1.</_>
+        <_>
+          8 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 2 -1.</_>
+        <_>
+          7 2 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 14 2 -1.</_>
+        <_>
+          2 6 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 14 -1.</_>
+        <_>
+          15 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 14 -1.</_>
+        <_>
+          4 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          16 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 13 -1.</_>
+        <_>
+          2 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 7 -1.</_>
+        <_>
+          2 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 8 -1.</_>
+        <_>
+          0 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 16 -1.</_>
+        <_>
+          0 1 10 8 2.</_>
+        <_>
+          10 9 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 16 -1.</_>
+        <_>
+          12 1 5 8 2.</_>
+        <_>
+          7 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 14 -1.</_>
+        <_>
+          0 1 8 7 2.</_>
+        <_>
+          8 8 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 6 -1.</_>
+        <_>
+          14 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 6 -1.</_>
+        <_>
+          1 5 5 3 2.</_>
+        <_>
+          6 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 4 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 8 -1.</_>
+        <_>
+          10 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 3 -1.</_>
+        <_>
+          0 4 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          0 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          3 17 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 6 -1.</_>
+        <_>
+          12 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 4 -1.</_>
+        <_>
+          0 14 9 2 2.</_>
+        <_>
+          9 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 9 -1.</_>
+        <_>
+          14 4 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 8 -1.</_>
+        <_>
+          2 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 5 9 -1.</_>
+        <_>
+          1 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 5 -1.</_>
+        <_>
+          8 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 14 -1.</_>
+        <_>
+          18 6 2 7 2.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 16 -1.</_>
+        <_>
+          3 1 5 8 2.</_>
+        <_>
+          8 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          10 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 20 -1.</_>
+        <_>
+          13 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 20 -1.</_>
+        <_>
+          6 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 9 7 -1.</_>
+        <_>
+          14 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          8 5 2 7 2.</_>
+        <_>
+          10 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 12 5 -1.</_>
+        <_>
+          12 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 5 -1.</_>
+        <_>
+          4 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 3 -1.</_>
+        <_>
+          6 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          1 11 8 2 2.</_>
+        <_>
+          9 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 10 -1.</_>
+        <_>
+          16 10 3 5 2.</_>
+        <_>
+          13 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 12 -1.</_>
+        <_>
+          0 5 10 6 2.</_>
+        <_>
+          10 11 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 15 2 -1.</_>
+        <_>
+          1 19 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 10 -1.</_>
+        <_>
+          16 10 3 5 2.</_>
+        <_>
+          13 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 6 -1.</_>
+        <_>
+          0 16 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 10 -1.</_>
+        <_>
+          16 10 3 5 2.</_>
+        <_>
+          13 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 2 -1.</_>
+        <_>
+          3 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 3 -1.</_>
+        <_>
+          0 8 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 10 8 -1.</_>
+        <_>
+          2 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 6 -1.</_>
+        <_>
+          8 8 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 11 6 -1.</_>
+        <_>
+          0 8 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 17 2 -1.</_>
+        <_>
+          3 11 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 10 -1.</_>
+        <_>
+          1 10 3 5 2.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 3 -1.</_>
+        <_>
+          7 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          3 14 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 8 -1.</_>
+        <_>
+          8 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 7 6 -1.</_>
+        <_>
+          3 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 13 -1.</_>
+        <_>
+          10 7 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 5 6 -1.</_>
+        <_>
+          0 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 15 4 -1.</_>
+        <_>
+          10 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 15 4 -1.</_>
+        <_>
+          5 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 10 -1.</_>
+        <_>
+          16 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 15 -1.</_>
+        <_>
+          1 5 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 13 -1.</_>
+        <_>
+          14 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 2 -1.</_>
+        <_>
+          4 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          10 0 4 6 2.</_>
+        <_>
+          6 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 4 -1.</_>
+        <_>
+          1 1 8 2 2.</_>
+        <_>
+          9 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 13 -1.</_>
+        <_>
+          18 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 13 -1.</_>
+        <_>
+          1 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 14 -1.</_>
+        <_>
+          12 2 3 7 2.</_>
+        <_>
+          9 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 7 -1.</_>
+        <_>
+          9 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 12 -1.</_>
+        <_>
+          10 8 4 6 2.</_>
+        <_>
+          6 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 3 -1.</_>
+        <_>
+          2 14 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 8 10 -1.</_>
+        <_>
+          6 8 4 5 2.</_>
+        <_>
+          10 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 3 -1.</_>
+        <_>
+          5 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 18 -1.</_>
+        <_>
+          8 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 12 -1.</_>
+        <_>
+          9 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 10 -1.</_>
+        <_>
+          7 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 7 6 -1.</_>
+        <_>
+          10 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 14 -1.</_>
+        <_>
+          0 6 2 7 2.</_>
+        <_>
+          2 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 5 -1.</_>
+        <_>
+          13 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 5 -1.</_>
+        <_>
+          4 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 7 -1.</_>
+        <_>
+          14 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 6 5 -1.</_>
+        <_>
+          4 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 12 -1.</_>
+        <_>
+          6 12 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 3 -1.</_>
+        <_>
+          0 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 6 -1.</_>
+        <_>
+          8 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 12 -1.</_>
+        <_>
+          6 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 8 -1.</_>
+        <_>
+          2 4 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 17 3 -1.</_>
+        <_>
+          1 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 2 -1.</_>
+        <_>
+          5 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          3 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 12 -1.</_>
+        <_>
+          6 4 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 2 -1.</_>
+        <_>
+          0 2 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 13 -1.</_>
+        <_>
+          16 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 13 -1.</_>
+        <_>
+          3 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 4 -1.</_>
+        <_>
+          8 4 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 4 -1.</_>
+        <_>
+          7 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 18 -1.</_>
+        <_>
+          6 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 3 -1.</_>
+        <_>
+          0 11 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 13 3 -1.</_>
+        <_>
+          7 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 2 -1.</_>
+        <_>
+          0 16 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 5 -1.</_>
+        <_>
+          7 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 8 -1.</_>
+        <_>
+          10 11 8 4 2.</_>
+        <_>
+          2 15 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 12 -1.</_>
+        <_>
+          2 6 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 11 5 3 2.</_>
+        <_>
+          10 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 7 6 -1.</_>
+        <_>
+          10 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 6 -1.</_>
+        <_>
+          5 5 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 3 -1.</_>
+        <_>
+          4 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 3 -1.</_>
+        <_>
+          1 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 4 -1.</_>
+        <_>
+          12 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 4 -1.</_>
+        <_>
+          4 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 8 -1.</_>
+        <_>
+          10 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 8 -1.</_>
+        <_>
+          5 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 3 -1.</_>
+        <_>
+          3 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 4 -1.</_>
+        <_>
+          0 7 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 12 -1.</_>
+        <_>
+          7 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 15 -1.</_>
+        <_>
+          10 0 5 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 6 -1.</_>
+        <_>
+          11 1 5 3 2.</_>
+        <_>
+          6 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 6 -1.</_>
+        <_>
+          4 1 5 3 2.</_>
+        <_>
+          9 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 3 -1.</_>
+        <_>
+          7 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 12 -1.</_>
+        <_>
+          11 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 12 -1.</_>
+        <_>
+          7 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 16 -1.</_>
+        <_>
+          10 4 2 8 2.</_>
+        <_>
+          8 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          8 6 2 7 2.</_>
+        <_>
+          10 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 9 -1.</_>
+        <_>
+          3 3 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 17 6 -1.</_>
+        <_>
+          3 7 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 19 -1.</_>
+        <_>
+          8 1 5 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 3 -1.</_>
+        <_>
+          3 2 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 3 -1.</_>
+        <_>
+          8 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 2 -1.</_>
+        <_>
+          6 8 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 3 -1.</_>
+        <_>
+          2 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 7 4 -1.</_>
+        <_>
+          8 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 15 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 13 3 -1.</_>
+        <_>
+          6 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 17 12 -1.</_>
+        <_>
+          1 9 17 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 3 -1.</_>
+        <_>
+          6 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 8 -1.</_>
+        <_>
+          2 9 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 14 -1.</_>
+        <_>
+          9 12 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 16 -1.</_>
+        <_>
+          9 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 6 -1.</_>
+        <_>
+          10 4 7 3 2.</_>
+        <_>
+          3 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 6 -1.</_>
+        <_>
+          0 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          10 5 6 3 2.</_>
+        <_>
+          4 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 19 6 -1.</_>
+        <_>
+          0 15 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 7 6 -1.</_>
+        <_>
+          3 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 10 -1.</_>
+        <_>
+          1 3 4 5 2.</_>
+        <_>
+          5 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 7 -1.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 14 -1.</_>
+        <_>
+          11 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 19 -1.</_>
+        <_>
+          7 1 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 9 -1.</_>
+        <_>
+          8 8 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 8 -1.</_>
+        <_>
+          4 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 7 6 -1.</_>
+        <_>
+          12 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 8 -1.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 10 -1.</_>
+        <_>
+          10 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 10 -1.</_>
+        <_>
+          4 14 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 7 6 -1.</_>
+        <_>
+          1 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 13 -1.</_>
+        <_>
+          13 1 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 3 -1.</_>
+        <_>
+          3 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 10 6 -1.</_>
+        <_>
+          4 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 14 -1.</_>
+        <_>
+          13 1 2 7 2.</_>
+        <_>
+          11 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 2 -1.</_>
+        <_>
+          0 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 18 -1.</_>
+        <_>
+          0 6 16 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 5 9 -1.</_>
+        <_>
+          14 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 10 -1.</_>
+        <_>
+          1 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 2 14 -1.</_>
+        <_>
+          16 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 2 14 -1.</_>
+        <_>
+          2 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 5 9 -1.</_>
+        <_>
+          14 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 5 9 -1.</_>
+        <_>
+          1 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 9 -1.</_>
+        <_>
+          8 7 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 5 6 3 2.</_>
+        <_>
+          10 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 16 -1.</_>
+        <_>
+          14 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 16 -1.</_>
+        <_>
+          5 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 12 -1.</_>
+        <_>
+          12 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 14 -1.</_>
+        <_>
+          7 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 16 -1.</_>
+        <_>
+          15 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 16 -1.</_>
+        <_>
+          1 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 8 6 -1.</_>
+        <_>
+          12 11 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 2 -1.</_>
+        <_>
+          7 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 5 -1.</_>
+        <_>
+          0 0 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 0 6 3 2.</_>
+        <_>
+          10 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 5 9 -1.</_>
+        <_>
+          14 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 2 -1.</_>
+        <_>
+          1 7 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 6 -1.</_>
+        <_>
+          7 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 10 -1.</_>
+        <_>
+          1 2 9 5 2.</_>
+        <_>
+          10 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 8 -1.</_>
+        <_>
+          13 3 4 4 2.</_>
+        <_>
+          9 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 4 -1.</_>
+        <_>
+          9 1 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 7 -1.</_>
+        <_>
+          8 5 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 7 -1.</_>
+        <_>
+          9 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 16 -1.</_>
+        <_>
+          11 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 9 7 -1.</_>
+        <_>
+          5 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 16 -1.</_>
+        <_>
+          11 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 11 -1.</_>
+        <_>
+          6 9 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 16 -1.</_>
+        <_>
+          11 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 6 -1.</_>
+        <_>
+          7 7 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 9 -1.</_>
+        <_>
+          11 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 5 9 -1.</_>
+        <_>
+          4 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 5 9 -1.</_>
+        <_>
+          14 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 16 -1.</_>
+        <_>
+          8 2 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 3 -1.</_>
+        <_>
+          3 16 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 6 -1.</_>
+        <_>
+          10 1 10 3 2.</_>
+        <_>
+          0 4 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 5 -1.</_>
+        <_>
+          8 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 14 -1.</_>
+        <_>
+          14 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 14 -1.</_>
+        <_>
+          5 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          16 0 3 5 2.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 5 -1.</_>
+        <_>
+          8 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 5 -1.</_>
+        <_>
+          6 0 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 14 -1.</_>
+        <_>
+          13 1 2 7 2.</_>
+        <_>
+          11 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 14 -1.</_>
+        <_>
+          5 1 2 7 2.</_>
+        <_>
+          7 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 13 3 -1.</_>
+        <_>
+          0 8 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 13 -1.</_>
+        <_>
+          17 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 13 -1.</_>
+        <_>
+          2 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 5 8 -1.</_>
+        <_>
+          2 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 4 -1.</_>
+        <_>
+          6 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_>
+        <_>
+          5 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 16 -1.</_>
+        <_>
+          15 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 9 -1.</_>
+        <_>
+          7 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 8 -1.</_>
+        <_>
+          3 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 10 -1.</_>
+        <_>
+          2 10 8 5 2.</_>
+        <_>
+          10 15 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          10 5 6 3 2.</_>
+        <_>
+          4 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 8 -1.</_>
+        <_>
+          5 5 5 4 2.</_>
+        <_>
+          10 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 6 -1.</_>
+        <_>
+          10 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 5 -1.</_>
+        <_>
+          5 15 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 8 -1.</_>
+        <_>
+          5 9 5 4 2.</_>
+        <_>
+          10 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 13 -1.</_>
+        <_>
+          8 7 6 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 5 -1.</_>
+        <_>
+          9 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          5 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 6 -1.</_>
+        <_>
+          3 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 7 -1.</_>
+        <_>
+          8 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 14 3 -1.</_>
+        <_>
+          4 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 9 -1.</_>
+        <_>
+          3 9 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 18 -1.</_>
+        <_>
+          7 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 10 -1.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 4 -1.</_>
+        <_>
+          3 5 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 5 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 6 -1.</_>
+        <_>
+          4 9 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 4 -1.</_>
+        <_>
+          4 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 9 4 -1.</_>
+        <_>
+          8 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 16 3 -1.</_>
+        <_>
+          1 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 3 -1.</_>
+        <_>
+          5 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 3 -1.</_>
+        <_>
+          0 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 4 -1.</_>
+        <_>
+          7 1 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 18 -1.</_>
+        <_>
+          8 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 10 -1.</_>
+        <_>
+          12 2 3 5 2.</_>
+        <_>
+          9 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 10 -1.</_>
+        <_>
+          5 2 3 5 2.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 4 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 9 8 -1.</_>
+        <_>
+          4 13 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 19 4 -1.</_>
+        <_>
+          1 17 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 7 4 -1.</_>
+        <_>
+          5 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 6 -1.</_>
+        <_>
+          0 10 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 10 -1.</_>
+        <_>
+          7 5 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 10 6 -1.</_>
+        <_>
+          0 14 5 3 2.</_>
+        <_>
+          5 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 9 -1.</_>
+        <_>
+          0 11 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 9 -1.</_>
+        <_>
+          15 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 13 3 -1.</_>
+        <_>
+          1 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 9 -1.</_>
+        <_>
+          15 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 2 -1.</_>
+        <_>
+          0 13 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 5 9 -1.</_>
+        <_>
+          15 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 9 -1.</_>
+        <_>
+          0 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 10 -1.</_>
+        <_>
+          13 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 18 -1.</_>
+        <_>
+          3 9 13 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 14 -1.</_>
+        <_>
+          12 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 14 -1.</_>
+        <_>
+          5 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 10 -1.</_>
+        <_>
+          10 8 8 5 2.</_>
+        <_>
+          2 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          10 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 9 -1.</_>
+        <_>
+          10 3 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 5 -1.</_>
+        <_>
+          7 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 8 -1.</_>
+        <_>
+          11 1 6 4 2.</_>
+        <_>
+          5 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 10 -1.</_>
+        <_>
+          5 6 3 5 2.</_>
+        <_>
+          8 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 9 -1.</_>
+        <_>
+          2 10 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 4 -1.</_>
+        <_>
+          5 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 3 -1.</_>
+        <_>
+          6 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 3 -1.</_>
+        <_>
+          4 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 4 -1.</_>
+        <_>
+          5 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 13 2 -1.</_>
+        <_>
+          4 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 10 -1.</_>
+        <_>
+          10 4 8 5 2.</_>
+        <_>
+          2 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 2 -1.</_>
+        <_>
+          0 3 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 7 -1.</_>
+        <_>
+          5 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 6 -1.</_>
+        <_>
+          3 1 5 3 2.</_>
+        <_>
+          8 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 5 9 -1.</_>
+        <_>
+          12 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 7 -1.</_>
+        <_>
+          8 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 12 -1.</_>
+        <_>
+          1 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 8 -1.</_>
+        <_>
+          14 8 4 4 2.</_>
+        <_>
+          10 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 3 -1.</_>
+        <_>
+          6 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 3 -1.</_>
+        <_>
+          3 6 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 7 8 -1.</_>
+        <_>
+          8 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 7 -1.</_>
+        <_>
+          2 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 3 -1.</_>
+        <_>
+          4 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 13 2 -1.</_>
+        <_>
+          2 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 4 -1.</_>
+        <_>
+          2 1 8 2 2.</_>
+        <_>
+          10 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 6 -1.</_>
+        <_>
+          9 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          6 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 6 -1.</_>
+        <_>
+          12 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 5 -1.</_>
+        <_>
+          7 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 8 -1.</_>
+        <_>
+          11 6 4 4 2.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          7 5 3 5 2.</_>
+        <_>
+          10 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 4 -1.</_>
+        <_>
+          10 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 4 -1.</_>
+        <_>
+          0 6 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 6 -1.</_>
+        <_>
+          4 5 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 3 -1.</_>
+        <_>
+          0 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 5 -1.</_>
+        <_>
+          8 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 12 5 -1.</_>
+        <_>
+          8 15 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 6 -1.</_>
+        <_>
+          12 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 17 3 -1.</_>
+        <_>
+          0 7 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 7 -1.</_>
+        <_>
+          11 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 2 -1.</_>
+        <_>
+          0 13 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 7 -1.</_>
+        <_>
+          12 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 14 -1.</_>
+        <_>
+          10 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 7 -1.</_>
+        <_>
+          6 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 6 -1.</_>
+        <_>
+          11 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 6 -1.</_>
+        <_>
+          2 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 12 -1.</_>
+        <_>
+          0 9 20 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 11 -1.</_>
+        <_>
+          9 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 11 -1.</_>
+        <_>
+          3 1 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 5 12 -1.</_>
+        <_>
+          9 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          0 3 10 2 2.</_>
+        <_>
+          10 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          15 0 5 3 2.</_>
+        <_>
+          10 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 10 6 -1.</_>
+        <_>
+          4 0 5 3 2.</_>
+        <_>
+          9 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 3 -1.</_>
+        <_>
+          7 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 7 4 -1.</_>
+        <_>
+          10 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 7 4 -1.</_>
+        <_>
+          3 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 7 6 -1.</_>
+        <_>
+          11 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 4 -1.</_>
+        <_>
+          2 8 7 2 2.</_>
+        <_>
+          9 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_>
+        <_>
+          10 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 6 -1.</_>
+        <_>
+          0 10 5 3 2.</_>
+        <_>
+          5 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 14 -1.</_>
+        <_>
+          16 5 2 7 2.</_>
+        <_>
+          14 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 14 -1.</_>
+        <_>
+          16 5 2 7 2.</_>
+        <_>
+          14 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 14 -1.</_>
+        <_>
+          2 5 2 7 2.</_>
+        <_>
+          4 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 12 -1.</_>
+        <_>
+          11 5 9 6 2.</_>
+        <_>
+          2 11 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 20 -1.</_>
+        <_>
+          10 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 16 -1.</_>
+        <_>
+          1 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 4 -1.</_>
+        <_>
+          6 3 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 5 16 -1.</_>
+        <_>
+          8 12 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 6 -1.</_>
+        <_>
+          1 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 12 -1.</_>
+        <_>
+          17 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 3 -1.</_>
+        <_>
+          1 4 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 12 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 10 -1.</_>
+        <_>
+          8 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 3 -1.</_>
+        <_>
+          4 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 3 12 -1.</_>
+        <_>
+          0 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 6 -1.</_>
+        <_>
+          7 13 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 7 -1.</_>
+        <_>
+          9 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 5 -1.</_>
+        <_>
+          11 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 9 5 -1.</_>
+        <_>
+          6 7 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 10 -1.</_>
+        <_>
+          14 10 4 5 2.</_>
+        <_>
+          10 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 10 -1.</_>
+        <_>
+          2 10 4 5 2.</_>
+        <_>
+          6 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 7 6 -1.</_>
+        <_>
+          3 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 5 8 -1.</_>
+        <_>
+          8 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          7 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 6 -1.</_>
+        <_>
+          10 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 3 -1.</_>
+        <_>
+          7 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 4 -1.</_>
+        <_>
+          1 3 9 2 2.</_>
+        <_>
+          10 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 8 -1.</_>
+        <_>
+          10 1 4 4 2.</_>
+        <_>
+          6 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 6 -1.</_>
+        <_>
+          11 4 9 3 2.</_>
+        <_>
+          2 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 8 -1.</_>
+        <_>
+          1 5 4 4 2.</_>
+        <_>
+          5 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 13 -1.</_>
+        <_>
+          14 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 13 -1.</_>
+        <_>
+          5 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 3 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 3 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 7 -1.</_>
+        <_>
+          9 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 12 -1.</_>
+        <_>
+          7 2 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 12 -1.</_>
+        <_>
+          12 5 3 6 2.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 12 -1.</_>
+        <_>
+          5 5 3 6 2.</_>
+        <_>
+          8 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 3 -1.</_>
+        <_>
+          5 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 12 -1.</_>
+        <_>
+          1 3 9 6 2.</_>
+        <_>
+          10 9 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 4 -1.</_>
+        <_>
+          10 11 7 2 2.</_>
+        <_>
+          3 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 14 -1.</_>
+        <_>
+          4 6 2 7 2.</_>
+        <_>
+          6 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 7 -1.</_>
+        <_>
+          11 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 7 -1.</_>
+        <_>
+          7 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 4 -1.</_>
+        <_>
+          7 3 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          10 8 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 13 -1.</_>
+        <_>
+          9 4 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 6 -1.</_>
+        <_>
+          10 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 7 6 -1.</_>
+        <_>
+          3 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 3 -1.</_>
+        <_>
+          2 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 4 -1.</_>
+        <_>
+          2 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 8 -1.</_>
+        <_>
+          12 7 8 4 2.</_>
+        <_>
+          4 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 8 -1.</_>
+        <_>
+          0 7 8 4 2.</_>
+        <_>
+          8 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 10 6 -1.</_>
+        <_>
+          12 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 10 6 -1.</_>
+        <_>
+          3 12 5 3 2.</_>
+        <_>
+          8 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 8 -1.</_>
+        <_>
+          4 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 3 -1.</_>
+        <_>
+          2 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 4 -1.</_>
+        <_>
+          11 3 9 2 2.</_>
+        <_>
+          2 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 18 -1.</_>
+        <_>
+          5 6 10 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 15 -1.</_>
+        <_>
+          14 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 15 -1.</_>
+        <_>
+          5 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 10 -1.</_>
+        <_>
+          16 4 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 10 -1.</_>
+        <_>
+          2 4 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          10 5 2 7 2.</_>
+        <_>
+          8 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 12 -1.</_>
+        <_>
+          4 6 6 6 2.</_>
+        <_>
+          10 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 19 -1.</_>
+        <_>
+          10 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 17 -1.</_>
+        <_>
+          3 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 4 -1.</_>
+        <_>
+          8 7 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 6 -1.</_>
+        <_>
+          1 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 8 -1.</_>
+        <_>
+          12 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 15 -1.</_>
+        <_>
+          0 5 20 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 6 -1.</_>
+        <_>
+          3 4 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 4 -1.</_>
+        <_>
+          0 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 15 -1.</_>
+        <_>
+          17 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 14 4 -1.</_>
+        <_>
+          2 16 7 2 2.</_>
+        <_>
+          9 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 15 -1.</_>
+        <_>
+          17 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 8 -1.</_>
+        <_>
+          3 0 4 4 2.</_>
+        <_>
+          7 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 14 3 -1.</_>
+        <_>
+          5 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 16 4 -1.</_>
+        <_>
+          1 11 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 8 -1.</_>
+        <_>
+          8 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 15 -1.</_>
+        <_>
+          2 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 6 8 -1.</_>
+        <_>
+          16 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          2 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          17 8 3 6 2.</_>
+        <_>
+          14 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          0 8 3 6 2.</_>
+        <_>
+          3 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 20 -1.</_>
+        <_>
+          16 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 20 -1.</_>
+        <_>
+          3 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 8 4 -1.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 10 -1.</_>
+        <_>
+          9 9 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 8 -1.</_>
+        <_>
+          12 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 8 -1.</_>
+        <_>
+          5 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 15 -1.</_>
+        <_>
+          14 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 9 5 -1.</_>
+        <_>
+          4 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 19 -1.</_>
+        <_>
+          10 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 19 -1.</_>
+        <_>
+          9 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 10 10 -1.</_>
+        <_>
+          6 3 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 5 -1.</_>
+        <_>
+          9 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 10 16 -1.</_>
+        <_>
+          13 1 5 8 2.</_>
+        <_>
+          8 9 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 4 -1.</_>
+        <_>
+          8 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 9 4 -1.</_>
+        <_>
+          9 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 15 -1.</_>
+        <_>
+          14 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 15 -1.</_>
+        <_>
+          4 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 17 -1.</_>
+        <_>
+          14 0 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 17 -1.</_>
+        <_>
+          3 0 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 17 2 -1.</_>
+        <_>
+          3 9 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 4 -1.</_>
+        <_>
+          6 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          4 4 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 3 -1.</_>
+        <_>
+          1 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 19 12 -1.</_>
+        <_>
+          1 9 19 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 13 15 -1.</_>
+        <_>
+          2 8 13 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 6 -1.</_>
+        <_>
+          10 1 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 3 -1.</_>
+        <_>
+          6 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 5 9 -1.</_>
+        <_>
+          15 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 14 4 -1.</_>
+        <_>
+          3 14 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 2 -1.</_>
+        <_>
+          7 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 9 -1.</_>
+        <_>
+          0 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 5 15 -1.</_>
+        <_>
+          14 10 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 5 15 -1.</_>
+        <_>
+          1 10 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 17 -1.</_>
+        <_>
+          10 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 8 -1.</_>
+        <_>
+          4 11 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 2 14 -1.</_>
+        <_>
+          5 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 8 -1.</_>
+        <_>
+          9 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 9 15 -1.</_>
+        <_>
+          3 10 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 12 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 14 -1.</_>
+        <_>
+          4 3 3 7 2.</_>
+        <_>
+          7 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 10 -1.</_>
+        <_>
+          9 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 8 -1.</_>
+        <_>
+          0 4 10 4 2.</_>
+        <_>
+          10 8 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 6 -1.</_>
+        <_>
+          11 11 5 3 2.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 8 8 -1.</_>
+        <_>
+          2 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 14 2 -1.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 14 2 -1.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 12 -1.</_>
+        <_>
+          8 4 6 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          9 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 12 -1.</_>
+        <_>
+          12 3 3 6 2.</_>
+        <_>
+          9 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 5 9 -1.</_>
+        <_>
+          6 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 8 -1.</_>
+        <_>
+          10 1 10 4 2.</_>
+        <_>
+          0 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 17 -1.</_>
+        <_>
+          8 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 5 2.</_>
+        <_>
+          14 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 8 -1.</_>
+        <_>
+          16 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 8 -1.</_>
+        <_>
+          2 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 7 -1.</_>
+        <_>
+          11 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 11 -1.</_>
+        <_>
+          8 6 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 4 -1.</_>
+        <_>
+          5 6 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 11 -1.</_>
+        <_>
+          14 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 3 -1.</_>
+        <_>
+          0 12 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 11 -1.</_>
+        <_>
+          14 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 11 -1.</_>
+        <_>
+          4 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 8 -1.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 6 -1.</_>
+        <_>
+          0 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 3 -1.</_>
+        <_>
+          2 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 2 -1.</_>
+        <_>
+          4 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 19 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 14 -1.</_>
+        <_>
+          10 0 4 7 2.</_>
+        <_>
+          6 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 12 -1.</_>
+        <_>
+          2 2 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 6 -1.</_>
+        <_>
+          9 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 7 4 -1.</_>
+        <_>
+          2 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 10 -1.</_>
+        <_>
+          5 0 3 5 2.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 13 -1.</_>
+        <_>
+          18 6 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 13 -1.</_>
+        <_>
+          1 6 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 13 -1.</_>
+        <_>
+          16 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 6 -1.</_>
+        <_>
+          6 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 6 -1.</_>
+        <_>
+          11 11 5 3 2.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 5 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 15 -1.</_>
+        <_>
+          10 3 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 15 -1.</_>
+        <_>
+          8 3 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 13 2 -1.</_>
+        <_>
+          6 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 16 4 -1.</_>
+        <_>
+          2 15 8 2 2.</_>
+        <_>
+          10 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 13 -1.</_>
+        <_>
+          2 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 9 -1.</_>
+        <_>
+          5 14 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 16 -1.</_>
+        <_>
+          0 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          10 15 10 2 2.</_>
+        <_>
+          0 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 4 -1.</_>
+        <_>
+          0 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 13 3 -1.</_>
+        <_>
+          4 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          0 0 9 2 2.</_>
+        <_>
+          9 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 15 -1.</_>
+        <_>
+          6 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          2 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          16 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 13 -1.</_>
+        <_>
+          18 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 4 10 -1.</_>
+        <_>
+          14 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 16 -1.</_>
+        <_>
+          0 3 2 8 2.</_>
+        <_>
+          2 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 6 -1.</_>
+        <_>
+          11 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 6 -1.</_>
+        <_>
+          1 14 5 3 2.</_>
+        <_>
+          6 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 9 -1.</_>
+        <_>
+          8 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 10 -1.</_>
+        <_>
+          4 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 12 -1.</_>
+        <_>
+          5 6 5 6 2.</_>
+        <_>
+          10 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 12 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 6 -1.</_>
+        <_>
+          2 3 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 8 -1.</_>
+        <_>
+          6 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 8 -1.</_>
+        <_>
+          1 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 14 -1.</_>
+        <_>
+          11 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 10 -1.</_>
+        <_>
+          11 5 3 5 2.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 12 -1.</_>
+        <_>
+          9 8 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 7 -1.</_>
+        <_>
+          15 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 7 -1.</_>
+        <_>
+          3 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 8 -1.</_>
+        <_>
+          10 7 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 5 -1.</_>
+        <_>
+          6 14 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          10 13 10 2 2.</_>
+        <_>
+          0 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 6 -1.</_>
+        <_>
+          0 10 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 2 -1.</_>
+        <_>
+          4 9 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 5 -1.</_>
+        <_>
+          3 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 5 -1.</_>
+        <_>
+          13 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 5 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 19 -1.</_>
+        <_>
+          7 0 7 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 14 -1.</_>
+        <_>
+          3 0 2 7 2.</_>
+        <_>
+          5 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 3 -1.</_>
+        <_>
+          2 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 18 -1.</_>
+        <_>
+          13 2 7 9 2.</_>
+        <_>
+          6 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 6 -1.</_>
+        <_>
+          5 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 18 -1.</_>
+        <_>
+          10 1 10 9 2.</_>
+        <_>
+          0 10 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 7 4 -1.</_>
+        <_>
+          4 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 12 -1.</_>
+        <_>
+          1 4 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 8 -1.</_>
+        <_>
+          9 0 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 5 -1.</_>
+        <_>
+          8 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 10 -1.</_>
+        <_>
+          8 0 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 13 -1.</_>
+        <_>
+          9 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 10 -1.</_>
+        <_>
+          0 4 9 5 2.</_>
+        <_>
+          9 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 6 -1.</_>
+        <_>
+          12 3 8 3 2.</_>
+        <_>
+          4 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 5 9 -1.</_>
+        <_>
+          3 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 5 -1.</_>
+        <_>
+          12 4 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 4 -1.</_>
+        <_>
+          3 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 15 -1.</_>
+        <_>
+          11 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 15 -1.</_>
+        <_>
+          8 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 8 -1.</_>
+        <_>
+          10 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 7 -1.</_>
+        <_>
+          11 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 9 5 -1.</_>
+        <_>
+          7 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 17 -1.</_>
+        <_>
+          15 3 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 13 -1.</_>
+        <_>
+          3 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 4 7 -1.</_>
+        <_>
+          11 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          2 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 7 -1.</_>
+        <_>
+          11 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 7 -1.</_>
+        <_>
+          7 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 8 -1.</_>
+        <_>
+          9 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 14 3 -1.</_>
+        <_>
+          2 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 7 4 -1.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 5 6 -1.</_>
+        <_>
+          13 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 3 -1.</_>
+        <_>
+          4 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 14 -1.</_>
+        <_>
+          5 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 5 -1.</_>
+        <_>
+          9 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 2 -1.</_>
+        <_>
+          0 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 5 -1.</_>
+        <_>
+          9 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 15 5 -1.</_>
+        <_>
+          6 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 6 -1.</_>
+        <_>
+          12 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 5 -1.</_>
+        <_>
+          6 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 8 -1.</_>
+        <_>
+          11 7 7 4 2.</_>
+        <_>
+          4 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 14 8 -1.</_>
+        <_>
+          2 7 7 4 2.</_>
+        <_>
+          9 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 20 -1.</_>
+        <_>
+          11 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 20 -1.</_>
+        <_>
+          8 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 8 -1.</_>
+        <_>
+          12 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 4 -1.</_>
+        <_>
+          10 2 7 2 2.</_>
+        <_>
+          3 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 16 -1.</_>
+        <_>
+          11 4 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 8 -1.</_>
+        <_>
+          6 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 6 -1.</_>
+        <_>
+          5 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 8 -1.</_>
+        <_>
+          4 12 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 6 -1.</_>
+        <_>
+          0 9 5 3 2.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 5 8 -1.</_>
+        <_>
+          4 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          8 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 10 -1.</_>
+        <_>
+          6 8 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 9 4 -1.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 12 8 2 2.</_>
+        <_>
+          10 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_>
+        <_>
+          10 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 8 -1.</_>
+        <_>
+          4 1 4 4 2.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 7 -1.</_>
+        <_>
+          8 12 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 12 6 -1.</_>
+        <_>
+          3 13 6 3 2.</_>
+        <_>
+          9 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 13 4 -1.</_>
+        <_>
+          4 14 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 15 -1.</_>
+        <_>
+          7 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 18 -1.</_>
+        <_>
+          12 2 8 9 2.</_>
+        <_>
+          4 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 4 -1.</_>
+        <_>
+          7 16 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 9 -1.</_>
+        <_>
+          8 0 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          7 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 12 8 -1.</_>
+        <_>
+          13 12 6 4 2.</_>
+        <_>
+          7 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 12 8 -1.</_>
+        <_>
+          1 12 6 4 2.</_>
+        <_>
+          7 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 9 -1.</_>
+        <_>
+          0 13 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 6 -1.</_>
+        <_>
+          4 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 6 -1.</_>
+        <_>
+          13 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 14 -1.</_>
+        <_>
+          8 1 2 7 2.</_>
+        <_>
+          10 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 5 6 -1.</_>
+        <_>
+          12 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 6 -1.</_>
+        <_>
+          3 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          8 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 14 -1.</_>
+        <_>
+          6 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 15 3 -1.</_>
+        <_>
+          10 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          6 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 17 -1.</_>
+        <_>
+          8 3 6 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 12 -1.</_>
+        <_>
+          8 2 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 12 -1.</_>
+        <_>
+          7 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 8 -1.</_>
+        <_>
+          8 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 10 -1.</_>
+        <_>
+          14 7 6 5 2.</_>
+        <_>
+          8 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 5 -1.</_>
+        <_>
+          10 1 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 8 -1.</_>
+        <_>
+          11 2 4 4 2.</_>
+        <_>
+          7 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 8 -1.</_>
+        <_>
+          5 2 4 4 2.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 6 -1.</_>
+        <_>
+          3 17 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 5 12 -1.</_>
+        <_>
+          3 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 9 -1.</_>
+        <_>
+          15 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          8 6 2 7 2.</_>
+        <_>
+          10 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 10 -1.</_>
+        <_>
+          5 0 4 5 2.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 7 -1.</_>
+        <_>
+          11 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 7 -1.</_>
+        <_>
+          7 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 7 6 -1.</_>
+        <_>
+          13 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 6 -1.</_>
+        <_>
+          1 3 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 17 6 -1.</_>
+        <_>
+          2 3 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 16 -1.</_>
+        <_>
+          4 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 14 -1.</_>
+        <_>
+          12 6 5 7 2.</_>
+        <_>
+          7 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 6 -1.</_>
+        <_>
+          10 9 6 3 2.</_>
+        <_>
+          4 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 3 -1.</_>
+        <_>
+          7 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 7 -1.</_>
+        <_>
+          8 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 3 -1.</_>
+        <_>
+          6 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 7 -1.</_>
+        <_>
+          10 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 8 -1.</_>
+        <_>
+          6 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 12 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 6 -1.</_>
+        <_>
+          0 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 9 -1.</_>
+        <_>
+          15 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 13 2 -1.</_>
+        <_>
+          2 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 12 -1.</_>
+        <_>
+          6 10 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 9 -1.</_>
+        <_>
+          7 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 11 4 -1.</_>
+        <_>
+          0 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 6 -1.</_>
+        <_>
+          13 12 5 3 2.</_>
+        <_>
+          8 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 6 -1.</_>
+        <_>
+          2 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 8 6 -1.</_>
+        <_>
+          12 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 8 -1.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 11 4 -1.</_>
+        <_>
+          9 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 10 -1.</_>
+        <_>
+          6 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 6 -1.</_>
+        <_>
+          4 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 8 -1.</_>
+        <_>
+          4 4 6 4 2.</_>
+        <_>
+          10 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 5 -1.</_>
+        <_>
+          5 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 12 -1.</_>
+        <_>
+          6 3 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 17 -1.</_>
+        <_>
+          13 3 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 17 -1.</_>
+        <_>
+          4 3 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          14 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 6 -1.</_>
+        <_>
+          4 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 3 -1.</_>
+        <_>
+          5 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 4 -1.</_>
+        <_>
+          0 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 13 -1.</_>
+        <_>
+          1 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 6 -1.</_>
+        <_>
+          6 4 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 4 -1.</_>
+        <_>
+          6 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 9 -1.</_>
+        <_>
+          9 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 4 -1.</_>
+        <_>
+          0 10 9 2 2.</_>
+        <_>
+          9 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 9 -1.</_>
+        <_>
+          10 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 7 -1.</_>
+        <_>
+          8 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 10 -1.</_>
+        <_>
+          12 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_>
+        <_>
+          10 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 12 -1.</_>
+        <_>
+          0 10 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 10 -1.</_>
+        <_>
+          12 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 7 -1.</_>
+        <_>
+          6 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 17 -1.</_>
+        <_>
+          3 2 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 9 5 -1.</_>
+        <_>
+          13 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 5 -1.</_>
+        <_>
+          4 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 6 -1.</_>
+        <_>
+          7 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 6 -1.</_>
+        <_>
+          12 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 9 -1.</_>
+        <_>
+          5 6 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 6 -1.</_>
+        <_>
+          12 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 12 -1.</_>
+        <_>
+          5 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 7 15 -1.</_>
+        <_>
+          9 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 7 -1.</_>
+        <_>
+          8 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 20 -1.</_>
+        <_>
+          10 0 5 10 2.</_>
+        <_>
+          5 10 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          9 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 4 -1.</_>
+        <_>
+          12 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 4 -1.</_>
+        <_>
+          2 7 8 2 2.</_>
+        <_>
+          10 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 10 -1.</_>
+        <_>
+          5 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 16 -1.</_>
+        <_>
+          6 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 10 -1.</_>
+        <_>
+          6 7 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 6 -1.</_>
+        <_>
+          2 4 7 3 2.</_>
+        <_>
+          9 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 12 -1.</_>
+        <_>
+          5 4 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 12 -1.</_>
+        <_>
+          7 5 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 11 4 -1.</_>
+        <_>
+          9 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 11 4 -1.</_>
+        <_>
+          0 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 19 6 -1.</_>
+        <_>
+          1 11 19 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          7 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 15 2 -1.</_>
+        <_>
+          5 4 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 14 6 -1.</_>
+        <_>
+          2 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 6 -1.</_>
+        <_>
+          3 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 6 -1.</_>
+        <_>
+          0 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 4 -1.</_>
+        <_>
+          13 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 4 -1.</_>
+        <_>
+          0 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 10 -1.</_>
+        <_>
+          14 1 6 5 2.</_>
+        <_>
+          8 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 8 -1.</_>
+        <_>
+          2 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 11 10 -1.</_>
+        <_>
+          5 6 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_>
+        <_>
+          8 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 4 -1.</_>
+        <_>
+          12 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 12 8 -1.</_>
+        <_>
+          6 7 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 4 -1.</_>
+        <_>
+          10 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 4 -1.</_>
+        <_>
+          6 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 3 -1.</_>
+        <_>
+          3 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 5 -1.</_>
+        <_>
+          4 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 9 -1.</_>
+        <_>
+          13 7 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 9 9 -1.</_>
+        <_>
+          4 7 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 5 -1.</_>
+        <_>
+          5 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 5 -1.</_>
+        <_>
+          9 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 2 -1.</_>
+        <_>
+          2 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 7 6 -1.</_>
+        <_>
+          2 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          7 10 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 15 -1.</_>
+        <_>
+          4 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 3 -1.</_>
+        <_>
+          3 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 16 3 -1.</_>
+        <_>
+          9 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 19 -1.</_>
+        <_>
+          12 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 19 -1.</_>
+        <_>
+          4 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 16 4 -1.</_>
+        <_>
+          0 12 8 2 2.</_>
+        <_>
+          8 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 14 -1.</_>
+        <_>
+          10 3 7 7 2.</_>
+        <_>
+          3 10 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 12 -1.</_>
+        <_>
+          5 6 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 6 -1.</_>
+        <_>
+          9 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 6 -1.</_>
+        <_>
+          1 8 7 3 2.</_>
+        <_>
+          8 11 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 10 -1.</_>
+        <_>
+          14 7 6 5 2.</_>
+        <_>
+          8 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 10 -1.</_>
+        <_>
+          0 7 6 5 2.</_>
+        <_>
+          6 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 18 -1.</_>
+        <_>
+          12 2 3 9 2.</_>
+        <_>
+          9 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 10 -1.</_>
+        <_>
+          1 10 4 5 2.</_>
+        <_>
+          5 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 4 -1.</_>
+        <_>
+          4 16 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 7 -1.</_>
+        <_>
+          7 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 5 -1.</_>
+        <_>
+          10 2 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 14 -1.</_>
+        <_>
+          5 11 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 11 4 -1.</_>
+        <_>
+          8 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 16 6 -1.</_>
+        <_>
+          0 16 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 8 6 -1.</_>
+        <_>
+          10 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 3 -1.</_>
+        <_>
+          5 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 3 -1.</_>
+        <_>
+          0 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 4 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 4 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 9 -1.</_>
+        <_>
+          9 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 9 -1.</_>
+        <_>
+          1 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 2 -1.</_>
+        <_>
+          4 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 13 2 -1.</_>
+        <_>
+          2 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 4 -1.</_>
+        <_>
+          6 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 5 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 3 -1.</_>
+        <_>
+          3 7 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 12 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 4 -1.</_>
+        <_>
+          2 6 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 9 4 -1.</_>
+        <_>
+          1 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 11 4 -1.</_>
+        <_>
+          9 6 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 3 -1.</_>
+        <_>
+          7 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 7 -1.</_>
+        <_>
+          6 0 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 15 -1.</_>
+        <_>
+          12 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 5 15 -1.</_>
+        <_>
+          3 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 11 -1.</_>
+        <_>
+          8 6 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 4 -1.</_>
+        <_>
+          1 9 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 5 -1.</_>
+        <_>
+          10 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 7 -1.</_>
+        <_>
+          9 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 6 -1.</_>
+        <_>
+          13 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 4 -1.</_>
+        <_>
+          5 6 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 11 -1.</_>
+        <_>
+          14 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 3 -1.</_>
+        <_>
+          0 12 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 11 -1.</_>
+        <_>
+          14 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 11 -1.</_>
+        <_>
+          4 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 8 -1.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 7 6 -1.</_>
+        <_>
+          0 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 6 -1.</_>
+        <_>
+          0 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 3 -1.</_>
+        <_>
+          2 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 2 -1.</_>
+        <_>
+          4 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 20 2 -1.</_>
+        <_>
+          0 19 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 14 -1.</_>
+        <_>
+          10 0 4 7 2.</_>
+        <_>
+          6 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 12 -1.</_>
+        <_>
+          2 2 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 6 -1.</_>
+        <_>
+          9 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 7 4 -1.</_>
+        <_>
+          2 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 10 -1.</_>
+        <_>
+          5 0 3 5 2.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 13 -1.</_>
+        <_>
+          18 6 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 13 -1.</_>
+        <_>
+          1 6 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 13 -1.</_>
+        <_>
+          16 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 6 -1.</_>
+        <_>
+          6 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 6 -1.</_>
+        <_>
+          11 11 5 3 2.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 5 -1.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 15 -1.</_>
+        <_>
+          10 3 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 15 -1.</_>
+        <_>
+          8 3 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 13 2 -1.</_>
+        <_>
+          6 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 16 4 -1.</_>
+        <_>
+          2 15 8 2 2.</_>
+        <_>
+          10 17 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 13 -1.</_>
+        <_>
+          2 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 9 -1.</_>
+        <_>
+          5 14 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 16 -1.</_>
+        <_>
+          0 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 4 -1.</_>
+        <_>
+          10 15 10 2 2.</_>
+        <_>
+          0 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 4 -1.</_>
+        <_>
+          0 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 10 6 -1.</_>
+        <_>
+          14 14 5 3 2.</_>
+        <_>
+          9 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 13 3 -1.</_>
+        <_>
+          4 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          0 0 9 2 2.</_>
+        <_>
+          9 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 15 -1.</_>
+        <_>
+          6 10 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          2 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          16 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 13 -1.</_>
+        <_>
+          18 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 4 10 -1.</_>
+        <_>
+          14 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 16 -1.</_>
+        <_>
+          0 3 2 8 2.</_>
+        <_>
+          2 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 6 -1.</_>
+        <_>
+          11 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 6 -1.</_>
+        <_>
+          1 14 5 3 2.</_>
+        <_>
+          6 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 9 -1.</_>
+        <_>
+          8 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 10 -1.</_>
+        <_>
+          4 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 12 -1.</_>
+        <_>
+          5 6 5 6 2.</_>
+        <_>
+          10 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 12 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 6 -1.</_>
+        <_>
+          2 3 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 8 -1.</_>
+        <_>
+          6 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 8 -1.</_>
+        <_>
+          1 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 14 -1.</_>
+        <_>
+          11 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 10 -1.</_>
+        <_>
+          11 5 3 5 2.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 12 -1.</_>
+        <_>
+          9 8 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 5 -1.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 7 -1.</_>
+        <_>
+          15 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 7 -1.</_>
+        <_>
+          3 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          6 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 8 -1.</_>
+        <_>
+          10 7 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 5 -1.</_>
+        <_>
+          6 14 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          10 13 10 2 2.</_>
+        <_>
+          0 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 7 4 -1.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 6 -1.</_>
+        <_>
+          0 10 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 2 -1.</_>
+        <_>
+          4 9 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 5 -1.</_>
+        <_>
+          3 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 5 -1.</_>
+        <_>
+          13 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 5 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 19 -1.</_>
+        <_>
+          7 0 7 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 14 -1.</_>
+        <_>
+          3 0 2 7 2.</_>
+        <_>
+          5 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 7 6 -1.</_>
+        <_>
+          13 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 3 -1.</_>
+        <_>
+          2 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 18 -1.</_>
+        <_>
+          13 2 7 9 2.</_>
+        <_>
+          6 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 6 -1.</_>
+        <_>
+          5 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 18 -1.</_>
+        <_>
+          10 1 10 9 2.</_>
+        <_>
+          0 10 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 7 4 -1.</_>
+        <_>
+          4 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 12 -1.</_>
+        <_>
+          1 4 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 8 -1.</_>
+        <_>
+          9 0 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 5 -1.</_>
+        <_>
+          8 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 15 -1.</_>
+        <_>
+          12 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 10 -1.</_>
+        <_>
+          8 0 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 13 -1.</_>
+        <_>
+          9 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 10 -1.</_>
+        <_>
+          0 4 9 5 2.</_>
+        <_>
+          9 9 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 6 -1.</_>
+        <_>
+          12 3 8 3 2.</_>
+        <_>
+          4 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 5 9 -1.</_>
+        <_>
+          3 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 5 -1.</_>
+        <_>
+          12 4 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 4 -1.</_>
+        <_>
+          3 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 15 -1.</_>
+        <_>
+          11 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 15 -1.</_>
+        <_>
+          8 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 8 -1.</_>
+        <_>
+          10 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 7 -1.</_>
+        <_>
+          11 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 9 5 -1.</_>
+        <_>
+          7 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 17 -1.</_>
+        <_>
+          15 3 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 13 -1.</_>
+        <_>
+          3 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 4 7 -1.</_>
+        <_>
+          11 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          2 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 7 -1.</_>
+        <_>
+          11 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 7 -1.</_>
+        <_>
+          7 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 8 -1.</_>
+        <_>
+          9 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 3 -1.</_>
+        <_>
+          5 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 14 3 -1.</_>
+        <_>
+          2 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 7 4 -1.</_>
+        <_>
+          8 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 5 6 -1.</_>
+        <_>
+          13 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 3 -1.</_>
+        <_>
+          4 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 14 -1.</_>
+        <_>
+          5 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 5 -1.</_>
+        <_>
+          9 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 2 -1.</_>
+        <_>
+          0 4 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 5 -1.</_>
+        <_>
+          9 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 15 5 -1.</_>
+        <_>
+          6 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 6 -1.</_>
+        <_>
+          12 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 5 -1.</_>
+        <_>
+          6 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 8 -1.</_>
+        <_>
+          11 7 7 4 2.</_>
+        <_>
+          4 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 14 8 -1.</_>
+        <_>
+          2 7 7 4 2.</_>
+        <_>
+          9 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 20 -1.</_>
+        <_>
+          11 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 20 -1.</_>
+        <_>
+          8 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 8 -1.</_>
+        <_>
+          12 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 4 -1.</_>
+        <_>
+          10 2 7 2 2.</_>
+        <_>
+          3 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 7 -1.</_>
+        <_>
+          9 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 16 -1.</_>
+        <_>
+          11 4 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 8 -1.</_>
+        <_>
+          6 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          10 10 3 5 2.</_>
+        <_>
+          7 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 6 -1.</_>
+        <_>
+          5 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 8 -1.</_>
+        <_>
+          4 12 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 6 -1.</_>
+        <_>
+          0 9 5 3 2.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 5 8 -1.</_>
+        <_>
+          4 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          8 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 10 -1.</_>
+        <_>
+          6 8 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 3 -1.</_>
+        <_>
+          2 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 4 -1.</_>
+        <_>
+          12 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 9 4 -1.</_>
+        <_>
+          9 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 12 8 2 2.</_>
+        <_>
+          10 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_>
+        <_>
+          10 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 8 -1.</_>
+        <_>
+          4 1 4 4 2.</_>
+        <_>
+          8 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 7 -1.</_>
+        <_>
+          8 12 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 12 6 -1.</_>
+        <_>
+          3 13 6 3 2.</_>
+        <_>
+          9 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 13 4 -1.</_>
+        <_>
+          4 14 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 15 -1.</_>
+        <_>
+          7 0 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 18 -1.</_>
+        <_>
+          12 2 8 9 2.</_>
+        <_>
+          4 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 4 -1.</_>
+        <_>
+          7 16 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 9 -1.</_>
+        <_>
+          8 0 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          7 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 12 8 -1.</_>
+        <_>
+          13 12 6 4 2.</_>
+        <_>
+          7 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 12 8 -1.</_>
+        <_>
+          1 12 6 4 2.</_>
+        <_>
+          7 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 9 -1.</_>
+        <_>
+          0 13 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 6 -1.</_>
+        <_>
+          4 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 6 -1.</_>
+        <_>
+          13 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 14 -1.</_>
+        <_>
+          8 1 2 7 2.</_>
+        <_>
+          10 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 5 6 -1.</_>
+        <_>
+          12 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 6 -1.</_>
+        <_>
+          3 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          8 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 14 -1.</_>
+        <_>
+          6 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 15 3 -1.</_>
+        <_>
+          10 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          6 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 17 -1.</_>
+        <_>
+          8 3 6 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 12 -1.</_>
+        <_>
+          8 2 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 12 -1.</_>
+        <_>
+          7 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 8 -1.</_>
+        <_>
+          8 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 10 -1.</_>
+        <_>
+          14 7 6 5 2.</_>
+        <_>
+          8 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 5 -1.</_>
+        <_>
+          10 1 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 8 -1.</_>
+        <_>
+          11 2 4 4 2.</_>
+        <_>
+          7 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 8 -1.</_>
+        <_>
+          5 2 4 4 2.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 6 -1.</_>
+        <_>
+          3 17 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 5 12 -1.</_>
+        <_>
+          3 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 6 -1.</_>
+        <_>
+          15 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 9 -1.</_>
+        <_>
+          15 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          8 6 2 7 2.</_>
+        <_>
+          10 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 10 -1.</_>
+        <_>
+          5 0 4 5 2.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 7 -1.</_>
+        <_>
+          11 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 7 -1.</_>
+        <_>
+          7 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 7 6 -1.</_>
+        <_>
+          13 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 6 -1.</_>
+        <_>
+          1 3 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 17 6 -1.</_>
+        <_>
+          2 3 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 16 -1.</_>
+        <_>
+          4 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 14 -1.</_>
+        <_>
+          12 6 5 7 2.</_>
+        <_>
+          7 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 6 -1.</_>
+        <_>
+          10 9 6 3 2.</_>
+        <_>
+          4 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 3 -1.</_>
+        <_>
+          7 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 7 -1.</_>
+        <_>
+          8 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 3 -1.</_>
+        <_>
+          6 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 7 -1.</_>
+        <_>
+          10 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 8 -1.</_>
+        <_>
+          6 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 12 -1.</_>
+        <_>
+          9 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 6 -1.</_>
+        <_>
+          0 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 5 9 -1.</_>
+        <_>
+          15 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 13 2 -1.</_>
+        <_>
+          2 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 12 -1.</_>
+        <_>
+          6 10 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 9 -1.</_>
+        <_>
+          7 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 11 4 -1.</_>
+        <_>
+          0 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 10 6 -1.</_>
+        <_>
+          13 12 5 3 2.</_>
+        <_>
+          8 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 6 -1.</_>
+        <_>
+          2 12 5 3 2.</_>
+        <_>
+          7 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 8 6 -1.</_>
+        <_>
+          12 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          0 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 8 -1.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 11 4 -1.</_>
+        <_>
+          9 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 5 10 -1.</_>
+        <_>
+          6 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 6 -1.</_>
+        <_>
+          4 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 8 -1.</_>
+        <_>
+          4 4 6 4 2.</_>
+        <_>
+          10 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 5 -1.</_>
+        <_>
+          5 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 12 -1.</_>
+        <_>
+          6 3 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 17 -1.</_>
+        <_>
+          13 3 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 17 -1.</_>
+        <_>
+          4 3 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          14 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 6 -1.</_>
+        <_>
+          4 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 3 -1.</_>
+        <_>
+          5 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 4 -1.</_>
+        <_>
+          0 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 13 -1.</_>
+        <_>
+          18 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 13 -1.</_>
+        <_>
+          1 2 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 13 2 -1.</_>
+        <_>
+          4 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 6 -1.</_>
+        <_>
+          6 4 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 4 -1.</_>
+        <_>
+          6 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 9 -1.</_>
+        <_>
+          9 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 4 -1.</_>
+        <_>
+          0 10 9 2 2.</_>
+        <_>
+          9 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 9 -1.</_>
+        <_>
+          10 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 7 -1.</_>
+        <_>
+          8 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 10 -1.</_>
+        <_>
+          12 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 6 -1.</_>
+        <_>
+          15 14 5 3 2.</_>
+        <_>
+          10 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 12 -1.</_>
+        <_>
+          0 10 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 10 -1.</_>
+        <_>
+          12 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 7 -1.</_>
+        <_>
+          6 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 17 -1.</_>
+        <_>
+          3 2 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 9 5 -1.</_>
+        <_>
+          13 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 5 -1.</_>
+        <_>
+          4 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 6 -1.</_>
+        <_>
+          7 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 7 6 -1.</_>
+        <_>
+          1 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 6 -1.</_>
+        <_>
+          12 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 9 -1.</_>
+        <_>
+          5 6 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 6 -1.</_>
+        <_>
+          12 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 12 -1.</_>
+        <_>
+          5 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 7 15 -1.</_>
+        <_>
+          9 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 7 -1.</_>
+        <_>
+          8 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 20 -1.</_>
+        <_>
+          10 0 5 10 2.</_>
+        <_>
+          5 10 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 10 -1.</_>
+        <_>
+          9 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 4 -1.</_>
+        <_>
+          12 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 4 -1.</_>
+        <_>
+          2 7 8 2 2.</_>
+        <_>
+          10 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 10 -1.</_>
+        <_>
+          5 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 16 -1.</_>
+        <_>
+          6 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 10 -1.</_>
+        <_>
+          6 7 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 6 -1.</_>
+        <_>
+          2 4 7 3 2.</_>
+        <_>
+          9 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 12 -1.</_>
+        <_>
+          5 4 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 12 -1.</_>
+        <_>
+          7 5 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 11 4 -1.</_>
+        <_>
+          9 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 11 4 -1.</_>
+        <_>
+          0 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 19 6 -1.</_>
+        <_>
+          1 11 19 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          7 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 15 2 -1.</_>
+        <_>
+          5 4 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 14 6 -1.</_>
+        <_>
+          2 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 6 -1.</_>
+        <_>
+          3 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 6 -1.</_>
+        <_>
+          0 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 4 -1.</_>
+        <_>
+          13 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 4 -1.</_>
+        <_>
+          0 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 10 -1.</_>
+        <_>
+          14 1 6 5 2.</_>
+        <_>
+          8 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 8 -1.</_>
+        <_>
+          2 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 11 10 -1.</_>
+        <_>
+          5 6 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_>
+        <_>
+          8 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 4 -1.</_>
+        <_>
+          12 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 12 8 -1.</_>
+        <_>
+          6 7 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 4 -1.</_>
+        <_>
+          10 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 4 -1.</_>
+        <_>
+          6 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 3 -1.</_>
+        <_>
+          3 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 5 -1.</_>
+        <_>
+          4 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 9 -1.</_>
+        <_>
+          13 7 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 9 9 -1.</_>
+        <_>
+          4 7 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 5 -1.</_>
+        <_>
+          5 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 5 -1.</_>
+        <_>
+          9 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 16 2 -1.</_>
+        <_>
+          2 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 7 6 -1.</_>
+        <_>
+          2 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          7 10 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 15 -1.</_>
+        <_>
+          4 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 3 -1.</_>
+        <_>
+          3 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 16 3 -1.</_>
+        <_>
+          9 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 19 -1.</_>
+        <_>
+          12 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 19 -1.</_>
+        <_>
+          4 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 3 -1.</_>
+        <_>
+          6 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 16 4 -1.</_>
+        <_>
+          0 12 8 2 2.</_>
+        <_>
+          8 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          13 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 14 -1.</_>
+        <_>
+          10 3 7 7 2.</_>
+        <_>
+          3 10 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 12 -1.</_>
+        <_>
+          5 6 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 6 -1.</_>
+        <_>
+          9 12 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 14 6 -1.</_>
+        <_>
+          1 8 7 3 2.</_>
+        <_>
+          8 11 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 10 -1.</_>
+        <_>
+          14 7 6 5 2.</_>
+        <_>
+          8 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 10 -1.</_>
+        <_>
+          0 7 6 5 2.</_>
+        <_>
+          6 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 18 -1.</_>
+        <_>
+          12 2 3 9 2.</_>
+        <_>
+          9 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 10 -1.</_>
+        <_>
+          1 10 4 5 2.</_>
+        <_>
+          5 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 4 -1.</_>
+        <_>
+          4 16 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 7 -1.</_>
+        <_>
+          7 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 5 -1.</_>
+        <_>
+          10 2 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 14 -1.</_>
+        <_>
+          5 11 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 11 4 -1.</_>
+        <_>
+          8 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 16 6 -1.</_>
+        <_>
+          0 16 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 8 6 -1.</_>
+        <_>
+          10 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 3 -1.</_>
+        <_>
+          5 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 3 -1.</_>
+        <_>
+          0 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 4 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 4 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 9 -1.</_>
+        <_>
+          9 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 9 -1.</_>
+        <_>
+          1 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 2 -1.</_>
+        <_>
+          4 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 13 2 -1.</_>
+        <_>
+          2 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 4 -1.</_>
+        <_>
+          6 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 5 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 3 -1.</_>
+        <_>
+          3 7 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 12 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 4 -1.</_>
+        <_>
+          2 6 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 9 4 -1.</_>
+        <_>
+          1 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 11 4 -1.</_>
+        <_>
+          9 6 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 3 -1.</_>
+        <_>
+          7 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 7 -1.</_>
+        <_>
+          6 0 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 15 -1.</_>
+        <_>
+          12 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 5 15 -1.</_>
+        <_>
+          3 5 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 7 -1.</_>
+        <_>
+          10 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 11 -1.</_>
+        <_>
+          8 6 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 4 -1.</_>
+        <_>
+          1 9 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          10 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 5 -1.</_>
+        <_>
+          10 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 7 -1.</_>
+        <_>
+          9 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 6 -1.</_>
+        <_>
+          13 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 4 -1.</_>
+        <_>
+          5 1 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 7 6 -1.</_>
+        <_>
+          7 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 12 -1.</_>
+        <_>
+          4 5 5 6 2.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 11 8 -1.</_>
+        <_>
+          8 16 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 5 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 14 -1.</_>
+        <_>
+          1 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 3 10 -1.</_>
+        <_>
+          11 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 13 3 -1.</_>
+        <_>
+          3 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 13 3 -1.</_>
+        <_>
+          6 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 6 -1.</_>
+        <_>
+          1 2 9 3 2.</_>
+        <_>
+          10 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 8 -1.</_>
+        <_>
+          12 1 6 4 2.</_>
+        <_>
+          6 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 8 -1.</_>
+        <_>
+          4 1 6 4 2.</_>
+        <_>
+          10 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 13 3 -1.</_>
+        <_>
+          4 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 4 -1.</_>
+        <_>
+          5 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 5 -1.</_>
+        <_>
+          14 2 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 13 2 -1.</_>
+        <_>
+          3 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          3 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 6 -1.</_>
+        <_>
+          14 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 10 -1.</_>
+        <_>
+          6 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 5 -1.</_>
+        <_>
+          10 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 12 -1.</_>
+        <_>
+          6 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 6 -1.</_>
+        <_>
+          14 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          3 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 3 -1.</_>
+        <_>
+          4 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 8 -1.</_>
+        <_>
+          8 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 13 -1.</_>
+        <_>
+          12 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 13 -1.</_>
+        <_>
+          7 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 2 -1.</_>
+        <_>
+          4 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 6 -1.</_>
+        <_>
+          1 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 12 4 -1.</_>
+        <_>
+          8 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          6 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 9 -1.</_>
+        <_>
+          2 3 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 12 -1.</_>
+        <_>
+          9 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 10 6 -1.</_>
+        <_>
+          2 4 5 3 2.</_>
+        <_>
+          7 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 8 16 -1.</_>
+        <_>
+          13 1 4 8 2.</_>
+        <_>
+          9 9 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 14 8 -1.</_>
+        <_>
+          2 5 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 6 -1.</_>
+        <_>
+          12 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 9 -1.</_>
+        <_>
+          3 8 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 2 -1.</_>
+        <_>
+          0 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 14 4 -1.</_>
+        <_>
+          2 13 7 2 2.</_>
+        <_>
+          9 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 7 -1.</_>
+        <_>
+          10 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 10 -1.</_>
+        <_>
+          6 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 8 -1.</_>
+        <_>
+          0 7 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 8 -1.</_>
+        <_>
+          10 0 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 19 -1.</_>
+        <_>
+          8 1 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 19 -1.</_>
+        <_>
+          6 1 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 19 -1.</_>
+        <_>
+          8 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 19 -1.</_>
+        <_>
+          6 1 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 10 -1.</_>
+        <_>
+          10 0 10 5 2.</_>
+        <_>
+          0 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 13 3 -1.</_>
+        <_>
+          0 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 13 3 -1.</_>
+        <_>
+          1 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 4 -1.</_>
+        <_>
+          13 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 19 -1.</_>
+        <_>
+          4 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 6 -1.</_>
+        <_>
+          12 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 13 3 -1.</_>
+        <_>
+          3 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 3 -1.</_>
+        <_>
+          4 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 9 -1.</_>
+        <_>
+          4 8 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 3 -1.</_>
+        <_>
+          6 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 4 -1.</_>
+        <_>
+          0 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 18 -1.</_>
+        <_>
+          12 2 7 9 2.</_>
+        <_>
+          5 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 12 -1.</_>
+        <_>
+          7 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 18 -1.</_>
+        <_>
+          12 2 7 9 2.</_>
+        <_>
+          5 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 14 18 -1.</_>
+        <_>
+          1 2 7 9 2.</_>
+        <_>
+          8 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 10 -1.</_>
+        <_>
+          10 10 4 5 2.</_>
+        <_>
+          6 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          10 10 4 4 2.</_>
+        <_>
+          6 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 7 6 -1.</_>
+        <_>
+          1 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 3 -1.</_>
+        <_>
+          4 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 9 -1.</_>
+        <_>
+          8 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 7 -1.</_>
+        <_>
+          10 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 19 6 -1.</_>
+        <_>
+          0 13 19 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 10 -1.</_>
+        <_>
+          4 6 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 2 -1.</_>
+        <_>
+          0 6 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 17 6 -1.</_>
+        <_>
+          2 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 10 6 -1.</_>
+        <_>
+          3 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 11 -1.</_>
+        <_>
+          9 0 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          2 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 7 -1.</_>
+        <_>
+          16 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 12 -1.</_>
+        <_>
+          3 8 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 6 -1.</_>
+        <_>
+          13 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 7 -1.</_>
+        <_>
+          16 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          2 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 15 -1.</_>
+        <_>
+          11 0 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 11 -1.</_>
+        <_>
+          7 5 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 3 -1.</_>
+        <_>
+          6 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 7 -1.</_>
+        <_>
+          10 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 14 -1.</_>
+        <_>
+          8 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 13 3 -1.</_>
+        <_>
+          5 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 13 -1.</_>
+        <_>
+          9 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 14 -1.</_>
+        <_>
+          11 6 2 7 2.</_>
+        <_>
+          9 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 10 -1.</_>
+        <_>
+          6 9 4 5 2.</_>
+        <_>
+          10 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 14 5 -1.</_>
+        <_>
+          7 15 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 5 -1.</_>
+        <_>
+          12 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 10 6 -1.</_>
+        <_>
+          0 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 14 4 -1.</_>
+        <_>
+          4 18 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 18 -1.</_>
+        <_>
+          8 1 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 2 -1.</_>
+        <_>
+          6 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 20 -1.</_>
+        <_>
+          10 0 7 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 7 -1.</_>
+        <_>
+          8 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 7 -1.</_>
+        <_>
+          7 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 13 -1.</_>
+        <_>
+          8 3 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 8 -1.</_>
+        <_>
+          7 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 5 -1.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 10 -1.</_>
+        <_>
+          11 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 12 6 -1.</_>
+        <_>
+          4 11 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 10 -1.</_>
+        <_>
+          11 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 10 -1.</_>
+        <_>
+          7 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 2 -1.</_>
+        <_>
+          6 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 2 -1.</_>
+        <_>
+          0 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 12 -1.</_>
+        <_>
+          15 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 12 -1.</_>
+        <_>
+          0 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          16 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 6 -1.</_>
+        <_>
+          0 14 6 3 2.</_>
+        <_>
+          6 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 14 -1.</_>
+        <_>
+          16 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 14 -1.</_>
+        <_>
+          0 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 5 -1.</_>
+        <_>
+          12 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 5 -1.</_>
+        <_>
+          4 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 14 -1.</_>
+        <_>
+          13 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 5 8 -1.</_>
+        <_>
+          5 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 14 -1.</_>
+        <_>
+          18 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          6 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          14 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 6 -1.</_>
+        <_>
+          3 4 7 3 2.</_>
+        <_>
+          10 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 6 -1.</_>
+        <_>
+          10 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 5 -1.</_>
+        <_>
+          4 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 18 -1.</_>
+        <_>
+          15 0 3 9 2.</_>
+        <_>
+          12 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 18 -1.</_>
+        <_>
+          2 0 3 9 2.</_>
+        <_>
+          5 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 14 -1.</_>
+        <_>
+          10 0 8 7 2.</_>
+        <_>
+          2 7 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 16 -1.</_>
+        <_>
+          2 0 2 8 2.</_>
+        <_>
+          4 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 4 -1.</_>
+        <_>
+          4 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 14 5 -1.</_>
+        <_>
+          6 12 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 5 -1.</_>
+        <_>
+          7 12 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 5 -1.</_>
+        <_>
+          12 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 5 -1.</_>
+        <_>
+          4 1 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 4 -1.</_>
+        <_>
+          10 10 7 2 2.</_>
+        <_>
+          3 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 4 -1.</_>
+        <_>
+          0 14 10 2 2.</_>
+        <_>
+          10 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 9 5 -1.</_>
+        <_>
+          13 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 9 5 -1.</_>
+        <_>
+          4 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 8 4 -1.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          4 5 6 3 2.</_>
+        <_>
+          10 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 5 -1.</_>
+        <_>
+          7 1 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 10 10 -1.</_>
+        <_>
+          14 2 5 5 2.</_>
+        <_>
+          9 7 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 10 10 -1.</_>
+        <_>
+          1 2 5 5 2.</_>
+        <_>
+          6 7 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 6 -1.</_>
+        <_>
+          14 3 6 3 2.</_>
+        <_>
+          8 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 4 -1.</_>
+        <_>
+          5 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 12 -1.</_>
+        <_>
+          10 3 10 6 2.</_>
+        <_>
+          0 9 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 5 5 3 2.</_>
+        <_>
+          10 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 12 -1.</_>
+        <_>
+          12 8 3 6 2.</_>
+        <_>
+          9 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 4 -1.</_>
+        <_>
+          0 8 9 2 2.</_>
+        <_>
+          9 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          10 14 7 2 2.</_>
+        <_>
+          3 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 9 -1.</_>
+        <_>
+          5 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 8 4 -1.</_>
+        <_>
+          6 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 12 -1.</_>
+        <_>
+          7 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 7 12 -1.</_>
+        <_>
+          9 11 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 9 -1.</_>
+        <_>
+          7 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 5 -1.</_>
+        <_>
+          8 13 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 7 9 -1.</_>
+        <_>
+          4 12 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 4 -1.</_>
+        <_>
+          8 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 7 -1.</_>
+        <_>
+          9 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 4 -1.</_>
+        <_>
+          0 15 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 3 -1.</_>
+        <_>
+          2 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 7 12 -1.</_>
+        <_>
+          9 11 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 17 -1.</_>
+        <_>
+          6 1 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 8 -1.</_>
+        <_>
+          8 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 12 -1.</_>
+        <_>
+          12 4 7 6 2.</_>
+        <_>
+          5 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 2 -1.</_>
+        <_>
+          9 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          6 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 12 -1.</_>
+        <_>
+          7 5 3 6 2.</_>
+        <_>
+          10 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 14 3 -1.</_>
+        <_>
+          6 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 14 3 -1.</_>
+        <_>
+          0 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 3 -1.</_>
+        <_>
+          4 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 12 -1.</_>
+        <_>
+          5 2 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 12 -1.</_>
+        <_>
+          14 5 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 16 -1.</_>
+        <_>
+          2 9 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 13 3 -1.</_>
+        <_>
+          7 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 4 -1.</_>
+        <_>
+          3 7 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 7 4 -1.</_>
+        <_>
+          9 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 14 6 -1.</_>
+        <_>
+          3 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 7 4 -1.</_>
+        <_>
+          9 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 7 4 -1.</_>
+        <_>
+          4 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          1 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 12 -1.</_>
+        <_>
+          14 5 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 12 -1.</_>
+        <_>
+          3 5 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 10 -1.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 20 -1.</_>
+        <_>
+          1 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 11 -1.</_>
+        <_>
+          8 0 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 5 -1.</_>
+        <_>
+          7 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_>
+        <_>
+          6 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 9 6 -1.</_>
+        <_>
+          7 4 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 9 8 -1.</_>
+        <_>
+          11 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 9 8 -1.</_>
+        <_>
+          6 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 10 -1.</_>
+        <_>
+          12 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 9 -1.</_>
+        <_>
+          9 9 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 9 -1.</_>
+        <_>
+          7 3 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 9 -1.</_>
+        <_>
+          8 2 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 3 -1.</_>
+        <_>
+          0 3 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          10 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 9 -1.</_>
+        <_>
+          6 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 12 -1.</_>
+        <_>
+          12 4 7 6 2.</_>
+        <_>
+          5 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          6 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 10 -1.</_>
+        <_>
+          1 10 3 5 2.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 8 -1.</_>
+        <_>
+          12 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          4 14 6 3 2.</_>
+        <_>
+          10 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 8 -1.</_>
+        <_>
+          12 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 8 -1.</_>
+        <_>
+          4 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 14 4 -1.</_>
+        <_>
+          11 11 7 2 2.</_>
+        <_>
+          4 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 14 4 -1.</_>
+        <_>
+          2 11 7 2 2.</_>
+        <_>
+          9 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          12 6 5 3 2.</_>
+        <_>
+          7 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 6 -1.</_>
+        <_>
+          3 6 5 3 2.</_>
+        <_>
+          8 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 19 -1.</_>
+        <_>
+          11 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 19 -1.</_>
+        <_>
+          7 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 2 -1.</_>
+        <_>
+          4 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 9 -1.</_>
+        <_>
+          13 4 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 7 9 -1.</_>
+        <_>
+          0 4 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 11 6 -1.</_>
+        <_>
+          9 13 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 11 6 -1.</_>
+        <_>
+          0 13 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 10 -1.</_>
+        <_>
+          10 5 8 5 2.</_>
+        <_>
+          2 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 12 -1.</_>
+        <_>
+          1 4 7 6 2.</_>
+        <_>
+          8 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 13 3 -1.</_>
+        <_>
+          2 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 6 -1.</_>
+        <_>
+          1 13 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 7 18 -1.</_>
+        <_>
+          6 11 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 6 -1.</_>
+        <_>
+          1 1 8 3 2.</_>
+        <_>
+          9 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 14 -1.</_>
+        <_>
+          18 1 2 7 2.</_>
+        <_>
+          16 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 14 -1.</_>
+        <_>
+          0 1 2 7 2.</_>
+        <_>
+          2 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          4 4 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 4 -1.</_>
+        <_>
+          0 7 7 2 2.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 9 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 13 2 -1.</_>
+        <_>
+          2 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 10 6 -1.</_>
+        <_>
+          14 12 5 3 2.</_>
+        <_>
+          9 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 10 -1.</_>
+        <_>
+          7 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 5 -1.</_>
+        <_>
+          7 2 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 17 -1.</_>
+        <_>
+          15 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 17 -1.</_>
+        <_>
+          4 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 7 6 -1.</_>
+        <_>
+          12 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 17 -1.</_>
+        <_>
+          4 2 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 18 -1.</_>
+        <_>
+          16 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 7 6 -1.</_>
+        <_>
+          3 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 12 -1.</_>
+        <_>
+          11 4 3 6 2.</_>
+        <_>
+          8 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 10 -1.</_>
+        <_>
+          4 4 6 5 2.</_>
+        <_>
+          10 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 18 -1.</_>
+        <_>
+          16 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 18 -1.</_>
+        <_>
+          2 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 18 -1.</_>
+        <_>
+          9 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 6 -1.</_>
+        <_>
+          3 5 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 12 -1.</_>
+        <_>
+          17 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 12 -1.</_>
+        <_>
+          0 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 5 9 -1.</_>
+        <_>
+          14 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 8 -1.</_>
+        <_>
+          1 4 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 4 -1.</_>
+        <_>
+          1 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 3 -1.</_>
+        <_>
+          10 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 5 -1.</_>
+        <_>
+          5 7 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 4 -1.</_>
+        <_>
+          2 6 8 2 2.</_>
+        <_>
+          10 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 5 9 -1.</_>
+        <_>
+          15 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 12 -1.</_>
+        <_>
+          11 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 6 -1.</_>
+        <_>
+          0 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 18 -1.</_>
+        <_>
+          7 10 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 6 -1.</_>
+        <_>
+          0 2 9 3 2.</_>
+        <_>
+          9 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 13 2 -1.</_>
+        <_>
+          5 9 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 10 -1.</_>
+        <_>
+          6 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 2 -1.</_>
+        <_>
+          6 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          1 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 2 -1.</_>
+        <_>
+          1 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 10 3 -1.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 4 -1.</_>
+        <_>
+          7 15 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 9 -1.</_>
+        <_>
+          8 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 11 -1.</_>
+        <_>
+          8 6 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 0 4 5 2.</_>
+        <_>
+          4 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          8 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 9 -1.</_>
+        <_>
+          8 9 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 17 -1.</_>
+        <_>
+          11 3 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 20 -1.</_>
+        <_>
+          8 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 18 -1.</_>
+        <_>
+          10 1 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 8 -1.</_>
+        <_>
+          4 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 14 -1.</_>
+        <_>
+          12 1 6 7 2.</_>
+        <_>
+          6 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 8 18 -1.</_>
+        <_>
+          6 1 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 7 -1.</_>
+        <_>
+          7 5 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 16 -1.</_>
+        <_>
+          3 4 3 8 2.</_>
+        <_>
+          6 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 14 -1.</_>
+        <_>
+          14 3 2 7 2.</_>
+        <_>
+          12 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 14 -1.</_>
+        <_>
+          4 3 2 7 2.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 6 -1.</_>
+        <_>
+          9 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 3 -1.</_>
+        <_>
+          4 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 6 -1.</_>
+        <_>
+          3 5 5 3 2.</_>
+        <_>
+          8 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 8 -1.</_>
+        <_>
+          0 4 10 4 2.</_>
+        <_>
+          10 8 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 8 -1.</_>
+        <_>
+          16 5 4 4 2.</_>
+        <_>
+          12 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 15 6 -1.</_>
+        <_>
+          1 3 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 3 -1.</_>
+        <_>
+          3 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 5 -1.</_>
+        <_>
+          10 3 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 5 -1.</_>
+        <_>
+          10 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 16 3 -1.</_>
+        <_>
+          9 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 14 -1.</_>
+        <_>
+          1 1 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 13 -1.</_>
+        <_>
+          13 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 13 -1.</_>
+        <_>
+          6 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 8 -1.</_>
+        <_>
+          4 10 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 7 6 -1.</_>
+        <_>
+          3 10 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 10 -1.</_>
+        <_>
+          0 8 20 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 6 -1.</_>
+        <_>
+          0 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 4 -1.</_>
+        <_>
+          11 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 4 -1.</_>
+        <_>
+          1 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 6 -1.</_>
+        <_>
+          5 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 10 -1.</_>
+        <_>
+          6 8 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 5 12 -1.</_>
+        <_>
+          7 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 12 -1.</_>
+        <_>
+          9 7 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 8 -1.</_>
+        <_>
+          9 3 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 16 -1.</_>
+        <_>
+          10 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 8 -1.</_>
+        <_>
+          0 10 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 16 4 -1.</_>
+        <_>
+          3 10 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 9 4 -1.</_>
+        <_>
+          10 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          7 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 13 9 -1.</_>
+        <_>
+          0 10 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 8 -1.</_>
+        <_>
+          10 11 4 4 2.</_>
+        <_>
+          6 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 4 -1.</_>
+        <_>
+          5 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 16 2 -1.</_>
+        <_>
+          4 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 7 6 -1.</_>
+        <_>
+          8 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 8 -1.</_>
+        <_>
+          7 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 12 -1.</_>
+        <_>
+          6 11 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 7 -1.</_>
+        <_>
+          14 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 10 -1.</_>
+        <_>
+          6 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 16 -1.</_>
+        <_>
+          13 4 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 16 -1.</_>
+        <_>
+          6 4 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 16 -1.</_>
+        <_>
+          10 3 2 8 2.</_>
+        <_>
+          8 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 18 -1.</_>
+        <_>
+          8 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 2 -1.</_>
+        <_>
+          4 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 2 -1.</_>
+        <_>
+          0 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 7 -1.</_>
+        <_>
+          14 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 2 -1.</_>
+        <_>
+          0 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 7 -1.</_>
+        <_>
+          14 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 7 -1.</_>
+        <_>
+          4 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 5 6 -1.</_>
+        <_>
+          2 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 5 9 -1.</_>
+        <_>
+          14 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 3 -1.</_>
+        <_>
+          5 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 17 6 -1.</_>
+        <_>
+          0 15 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 3 -1.</_>
+        <_>
+          5 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 14 -1.</_>
+        <_>
+          9 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 13 3 -1.</_>
+        <_>
+          1 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 14 -1.</_>
+        <_>
+          4 5 2 7 2.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 8 -1.</_>
+        <_>
+          2 8 4 4 2.</_>
+        <_>
+          6 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 9 -1.</_>
+        <_>
+          13 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 5 9 -1.</_>
+        <_>
+          4 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 10 -1.</_>
+        <_>
+          13 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 6 -1.</_>
+        <_>
+          10 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 13 3 -1.</_>
+        <_>
+          1 18 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 11 -1.</_>
+        <_>
+          9 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 6 -1.</_>
+        <_>
+          9 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 13 3 -1.</_>
+        <_>
+          1 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 3 -1.</_>
+        <_>
+          4 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 14 12 -1.</_>
+        <_>
+          1 2 7 6 2.</_>
+        <_>
+          8 8 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 14 -1.</_>
+        <_>
+          15 4 2 7 2.</_>
+        <_>
+          13 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 14 -1.</_>
+        <_>
+          3 4 2 7 2.</_>
+        <_>
+          5 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 7 4 -1.</_>
+        <_>
+          1 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 2 -1.</_>
+        <_>
+          1 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 7 -1.</_>
+        <_>
+          16 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 3 -1.</_>
+        <_>
+          3 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 7 -1.</_>
+        <_>
+          13 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 19 12 -1.</_>
+        <_>
+          1 11 19 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          7 9 3 5 2.</_>
+        <_>
+          10 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 3 -1.</_>
+        <_>
+          4 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 7 4 -1.</_>
+        <_>
+          3 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 15 -1.</_>
+        <_>
+          16 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 10 -1.</_>
+        <_>
+          11 0 4 5 2.</_>
+        <_>
+          7 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 2 -1.</_>
+        <_>
+          10 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 3 -1.</_>
+        <_>
+          7 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 3 -1.</_>
+        <_>
+          8 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 16 -1.</_>
+        <_>
+          6 4 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 19 -1.</_>
+        <_>
+          15 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 5 -1.</_>
+        <_>
+          12 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 10 -1.</_>
+        <_>
+          5 0 4 5 2.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 3 -1.</_>
+        <_>
+          0 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 12 -1.</_>
+        <_>
+          16 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 19 -1.</_>
+        <_>
+          3 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 7 -1.</_>
+        <_>
+          14 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 9 14 -1.</_>
+        <_>
+          4 6 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 9 -1.</_>
+        <_>
+          9 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 6 -1.</_>
+        <_>
+          8 8 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 9 -1.</_>
+        <_>
+          6 5 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 5 -1.</_>
+        <_>
+          7 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          12 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 7 6 -1.</_>
+        <_>
+          6 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 14 -1.</_>
+        <_>
+          13 6 2 7 2.</_>
+        <_>
+          11 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 14 -1.</_>
+        <_>
+          5 6 2 7 2.</_>
+        <_>
+          7 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 4 -1.</_>
+        <_>
+          13 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 14 -1.</_>
+        <_>
+          1 5 2 7 2.</_>
+        <_>
+          3 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 4 -1.</_>
+        <_>
+          10 13 9 2 2.</_>
+        <_>
+          1 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 12 -1.</_>
+        <_>
+          0 7 18 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 18 -1.</_>
+        <_>
+          4 10 14 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 10 -1.</_>
+        <_>
+          6 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 9 -1.</_>
+        <_>
+          16 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 9 -1.</_>
+        <_>
+          2 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          12 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 7 -1.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 3 -1.</_>
+        <_>
+          9 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 15 3 -1.</_>
+        <_>
+          6 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 12 -1.</_>
+        <_>
+          16 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 12 -1.</_>
+        <_>
+          7 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 12 -1.</_>
+        <_>
+          16 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 12 -1.</_>
+        <_>
+          2 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 13 -1.</_>
+        <_>
+          9 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 7 -1.</_>
+        <_>
+          2 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 4 -1.</_>
+        <_>
+          10 9 9 2 2.</_>
+        <_>
+          1 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 13 2 -1.</_>
+        <_>
+          3 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 8 -1.</_>
+        <_>
+          6 12 4 4 2.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 7 6 -1.</_>
+        <_>
+          3 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 15 6 -1.</_>
+        <_>
+          10 10 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 7 -1.</_>
+        <_>
+          10 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 7 -1.</_>
+        <_>
+          10 1 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 6 -1.</_>
+        <_>
+          1 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 6 -1.</_>
+        <_>
+          7 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 0 4 5 2.</_>
+        <_>
+          4 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 7 -1.</_>
+        <_>
+          13 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 13 -1.</_>
+        <_>
+          7 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 8 -1.</_>
+        <_>
+          10 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 8 9 -1.</_>
+        <_>
+          2 12 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 14 -1.</_>
+        <_>
+          16 4 2 7 2.</_>
+        <_>
+          14 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 7 8 -1.</_>
+        <_>
+          4 13 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 8 -1.</_>
+        <_>
+          7 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 6 -1.</_>
+        <_>
+          1 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 15 6 -1.</_>
+        <_>
+          5 10 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 5 -1.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 5 -1.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 4 -1.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 5 9 -1.</_>
+        <_>
+          5 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 3 -1.</_>
+        <_>
+          7 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 4 -1.</_>
+        <_>
+          2 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 4 -1.</_>
+        <_>
+          0 0 10 2 2.</_>
+        <_>
+          10 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 2 -1.</_>
+        <_>
+          6 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 13 3 -1.</_>
+        <_>
+          1 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 10 -1.</_>
+        <_>
+          15 0 3 5 2.</_>
+        <_>
+          12 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 13 2 -1.</_>
+        <_>
+          3 17 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 13 3 -1.</_>
+        <_>
+          1 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 9 -1.</_>
+        <_>
+          15 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          0 1 9 2 2.</_>
+        <_>
+          9 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 4 -1.</_>
+        <_>
+          5 2 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 10 -1.</_>
+        <_>
+          4 2 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 6 -1.</_>
+        <_>
+          8 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 6 -1.</_>
+        <_>
+          5 4 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 12 -1.</_>
+        <_>
+          8 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 8 -1.</_>
+        <_>
+          5 4 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 14 -1.</_>
+        <_>
+          2 4 2 7 2.</_>
+        <_>
+          4 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 6 -1.</_>
+        <_>
+          15 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 5 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 12 6 -1.</_>
+        <_>
+          8 14 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 14 -1.</_>
+        <_>
+          2 5 6 7 2.</_>
+        <_>
+          8 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 4 -1.</_>
+        <_>
+          10 10 7 2 2.</_>
+        <_>
+          3 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          8 2 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 14 -1.</_>
+        <_>
+          14 0 2 7 2.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 14 -1.</_>
+        <_>
+          4 0 2 7 2.</_>
+        <_>
+          6 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 11 -1.</_>
+        <_>
+          14 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 14 -1.</_>
+        <_>
+          1 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 13 -1.</_>
+        <_>
+          16 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 13 -1.</_>
+        <_>
+          3 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 10 10 -1.</_>
+        <_>
+          13 10 5 5 2.</_>
+        <_>
+          8 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 20 -1.</_>
+        <_>
+          7 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 6 -1.</_>
+        <_>
+          12 14 7 3 2.</_>
+        <_>
+          5 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 3 13 -1.</_>
+        <_>
+          2 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 14 -1.</_>
+        <_>
+          18 6 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 14 -1.</_>
+        <_>
+          1 6 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 9 5 -1.</_>
+        <_>
+          13 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 7 -1.</_>
+        <_>
+          4 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 16 -1.</_>
+        <_>
+          11 4 7 8 2.</_>
+        <_>
+          4 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 6 -1.</_>
+        <_>
+          12 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 3 -1.</_>
+        <_>
+          10 17 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 10 4 -1.</_>
+        <_>
+          6 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 6 -1.</_>
+        <_>
+          12 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 8 -1.</_>
+        <_>
+          9 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 15 -1.</_>
+        <_>
+          6 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 9 -1.</_>
+        <_>
+          3 9 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 8 -1.</_>
+        <_>
+          4 9 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 16 -1.</_>
+        <_>
+          2 4 7 8 2.</_>
+        <_>
+          9 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 12 3 -1.</_>
+        <_>
+          7 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 19 3 -1.</_>
+        <_>
+          1 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 10 -1.</_>
+        <_>
+          10 0 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 4 -1.</_>
+        <_>
+          6 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 5 -1.</_>
+        <_>
+          7 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 18 -1.</_>
+        <_>
+          18 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 3 -1.</_>
+        <_>
+          3 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 6 -1.</_>
+        <_>
+          12 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 6 -1.</_>
+        <_>
+          12 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 7 6 -1.</_>
+        <_>
+          1 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 12 -1.</_>
+        <_>
+          5 11 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 10 -1.</_>
+        <_>
+          4 5 5 5 2.</_>
+        <_>
+          9 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 7 -1.</_>
+        <_>
+          12 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 6 -1.</_>
+        <_>
+          4 3 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 13 2 -1.</_>
+        <_>
+          4 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          1 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 2 -1.</_>
+        <_>
+          0 14 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 4 -1.</_>
+        <_>
+          9 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 16 -1.</_>
+        <_>
+          8 4 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 16 -1.</_>
+        <_>
+          6 4 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 9 -1.</_>
+        <_>
+          12 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 7 -1.</_>
+        <_>
+          4 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 16 -1.</_>
+        <_>
+          13 0 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 18 12 -1.</_>
+        <_>
+          6 7 6 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 4 -1.</_>
+        <_>
+          8 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 4 -1.</_>
+        <_>
+          0 7 8 2 2.</_>
+        <_>
+          8 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 5 -1.</_>
+        <_>
+          10 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 16 -1.</_>
+        <_>
+          6 0 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 13 2 -1.</_>
+        <_>
+          6 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 13 2 -1.</_>
+        <_>
+          1 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 9 -1.</_>
+        <_>
+          8 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 8 -1.</_>
+        <_>
+          8 4 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 8 -1.</_>
+        <_>
+          14 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 4 8 -1.</_>
+        <_>
+          4 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          12 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 8 -1.</_>
+        <_>
+          4 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 7 -1.</_>
+        <_>
+          10 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 7 -1.</_>
+        <_>
+          7 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 5 -1.</_>
+        <_>
+          8 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          6 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 3 -1.</_>
+        <_>
+          4 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 14 -1.</_>
+        <_>
+          4 3 2 7 2.</_>
+        <_>
+          6 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 2 -1.</_>
+        <_>
+          10 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 14 -1.</_>
+        <_>
+          15 6 4 7 2.</_>
+        <_>
+          11 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 19 -1.</_>
+        <_>
+          4 0 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 10 -1.</_>
+        <_>
+          15 5 3 5 2.</_>
+        <_>
+          12 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 10 -1.</_>
+        <_>
+          2 5 3 5 2.</_>
+        <_>
+          5 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 4 -1.</_>
+        <_>
+          7 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 2 -1.</_>
+        <_>
+          9 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 9 -1.</_>
+        <_>
+          6 6 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 9 5 -1.</_>
+        <_>
+          7 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 7 -1.</_>
+        <_>
+          10 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 5 -1.</_>
+        <_>
+          8 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 4 -1.</_>
+        <_>
+          11 1 7 2 2.</_>
+        <_>
+          4 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 2 13 -1.</_>
+        <_>
+          10 1 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_>
+        <_>
+          10 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 10 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 3 -1.</_>
+        <_>
+          6 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 13 -1.</_>
+        <_>
+          3 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 5 -1.</_>
+        <_>
+          3 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 12 -1.</_>
+        <_>
+          15 10 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 16 -1.</_>
+        <_>
+          0 1 3 8 2.</_>
+        <_>
+          3 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 2 -1.</_>
+        <_>
+          0 0 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 12 -1.</_>
+        <_>
+          0 10 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          10 0 9 3 2.</_>
+        <_>
+          1 3 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 5 -1.</_>
+        <_>
+          7 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 5 -1.</_>
+        <_>
+          10 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 18 -1.</_>
+        <_>
+          11 2 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 18 -1.</_>
+        <_>
+          5 2 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 5 6 -1.</_>
+        <_>
+          12 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 14 4 -1.</_>
+        <_>
+          2 1 7 2 2.</_>
+        <_>
+          9 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 8 6 -1.</_>
+        <_>
+          12 9 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 6 -1.</_>
+        <_>
+          0 9 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 13 2 -1.</_>
+        <_>
+          7 8 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 9 -1.</_>
+        <_>
+          1 9 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 6 -1.</_>
+        <_>
+          0 10 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 13 -1.</_>
+        <_>
+          6 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 15 -1.</_>
+        <_>
+          14 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 3 -1.</_>
+        <_>
+          3 16 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 17 3 -1.</_>
+        <_>
+          0 17 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 11 6 -1.</_>
+        <_>
+          5 14 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 15 -1.</_>
+        <_>
+          5 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 9 -1.</_>
+        <_>
+          3 4 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 8 -1.</_>
+        <_>
+          0 4 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 4 -1.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 13 2 -1.</_>
+        <_>
+          2 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 3 -1.</_>
+        <_>
+          2 13 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 13 3 -1.</_>
+        <_>
+          1 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 13 3 -1.</_>
+        <_>
+          7 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 7 6 -1.</_>
+        <_>
+          5 16 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 3 -1.</_>
+        <_>
+          4 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 2 -1.</_>
+        <_>
+          3 3 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 14 -1.</_>
+        <_>
+          3 7 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 14 -1.</_>
+        <_>
+          4 8 12 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 7 -1.</_>
+        <_>
+          11 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 4 -1.</_>
+        <_>
+          6 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 8 6 -1.</_>
+        <_>
+          8 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 7 -1.</_>
+        <_>
+          7 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 5 -1.</_>
+        <_>
+          11 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 16 -1.</_>
+        <_>
+          1 0 4 8 2.</_>
+        <_>
+          5 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 18 -1.</_>
+        <_>
+          8 8 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 18 -1.</_>
+        <_>
+          6 8 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 4 -1.</_>
+        <_>
+          7 8 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 5 9 -1.</_>
+        <_>
+          1 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 10 6 -1.</_>
+        <_>
+          0 14 5 3 2.</_>
+        <_>
+          5 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 5 9 -1.</_>
+        <_>
+          9 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 4 -1.</_>
+        <_>
+          4 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 14 -1.</_>
+        <_>
+          15 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          6 9 4 4 2.</_>
+        <_>
+          10 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 7 -1.</_>
+        <_>
+          8 5 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 9 -1.</_>
+        <_>
+          8 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 16 -1.</_>
+        <_>
+          10 2 3 8 2.</_>
+        <_>
+          7 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 5 -1.</_>
+        <_>
+          9 15 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 14 4 -1.</_>
+        <_>
+          11 12 7 2 2.</_>
+        <_>
+          4 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 14 4 -1.</_>
+        <_>
+          2 12 7 2 2.</_>
+        <_>
+          9 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 3 -1.</_>
+        <_>
+          4 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 10 3 -1.</_>
+        <_>
+          5 2 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 8 -1.</_>
+        <_>
+          8 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 2 -1.</_>
+        <_>
+          10 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 9 -1.</_>
+        <_>
+          6 0 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 6 -1.</_>
+        <_>
+          3 2 5 3 2.</_>
+        <_>
+          8 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 13 -1.</_>
+        <_>
+          15 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 6 -1.</_>
+        <_>
+          11 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 6 -1.</_>
+        <_>
+          1 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 3 -1.</_>
+        <_>
+          3 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 9 -1.</_>
+        <_>
+          4 5 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 13 3 -1.</_>
+        <_>
+          0 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 14 4 -1.</_>
+        <_>
+          13 16 7 2 2.</_>
+        <_>
+          6 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 16 4 -1.</_>
+        <_>
+          12 16 8 2 2.</_>
+        <_>
+          4 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 16 4 -1.</_>
+        <_>
+          0 16 8 2 2.</_>
+        <_>
+          8 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 5 -1.</_>
+        <_>
+          8 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 5 -1.</_>
+        <_>
+          9 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 8 -1.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 12 -1.</_>
+        <_>
+          4 12 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 12 -1.</_>
+        <_>
+          1 9 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 4 -1.</_>
+        <_>
+          4 8 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 19 3 -1.</_>
+        <_>
+          1 6 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 14 -1.</_>
+        <_>
+          2 3 6 7 2.</_>
+        <_>
+          8 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 16 -1.</_>
+        <_>
+          13 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 16 -1.</_>
+        <_>
+          4 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 14 -1.</_>
+        <_>
+          8 0 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 6 -1.</_>
+        <_>
+          0 10 5 3 2.</_>
+        <_>
+          5 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 13 3 -1.</_>
+        <_>
+          7 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 10 -1.</_>
+        <_>
+          5 5 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 14 -1.</_>
+        <_>
+          15 6 4 7 2.</_>
+        <_>
+          11 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 13 -1.</_>
+        <_>
+          4 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 14 -1.</_>
+        <_>
+          15 6 4 7 2.</_>
+        <_>
+          11 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 13 -1.</_>
+        <_>
+          4 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 9 -1.</_>
+        <_>
+          9 5 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 8 14 -1.</_>
+        <_>
+          1 6 4 7 2.</_>
+        <_>
+          5 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 9 6 -1.</_>
+        <_>
+          11 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 9 -1.</_>
+        <_>
+          12 14 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 15 9 -1.</_>
+        <_>
+          2 14 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 18 4 -1.</_>
+        <_>
+          8 16 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          14 0 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          3 0 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 16 -1.</_>
+        <_>
+          15 1 2 8 2.</_>
+        <_>
+          13 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 11 -1.</_>
+        <_>
+          3 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 3 -1.</_>
+        <_>
+          6 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 10 -1.</_>
+        <_>
+          0 0 6 5 2.</_>
+        <_>
+          6 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 3 -1.</_>
+        <_>
+          4 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 7 6 -1.</_>
+        <_>
+          0 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 8 -1.</_>
+        <_>
+          13 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 8 -1.</_>
+        <_>
+          3 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 5 6 -1.</_>
+        <_>
+          15 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 13 3 -1.</_>
+        <_>
+          0 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 6 -1.</_>
+        <_>
+          14 8 5 3 2.</_>
+        <_>
+          9 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 6 -1.</_>
+        <_>
+          1 8 5 3 2.</_>
+        <_>
+          6 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 6 -1.</_>
+        <_>
+          5 8 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 2 -1.</_>
+        <_>
+          9 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 7 -1.</_>
+        <_>
+          9 1 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 7 -1.</_>
+        <_>
+          8 1 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 6 -1.</_>
+        <_>
+          0 9 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 15 2 -1.</_>
+        <_>
+          2 9 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 6 -1.</_>
+        <_>
+          0 4 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 15 2 -1.</_>
+        <_>
+          5 3 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 7 4 -1.</_>
+        <_>
+          5 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 8 -1.</_>
+        <_>
+          13 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 6 -1.</_>
+        <_>
+          12 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 9 -1.</_>
+        <_>
+          3 6 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 6 -1.</_>
+        <_>
+          12 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 5 6 -1.</_>
+        <_>
+          3 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 17 8 -1.</_>
+        <_>
+          2 13 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 7 12 -1.</_>
+        <_>
+          6 12 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 9 -1.</_>
+        <_>
+          11 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 16 -1.</_>
+        <_>
+          6 2 2 8 2.</_>
+        <_>
+          8 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 6 -1.</_>
+        <_>
+          15 4 5 3 2.</_>
+        <_>
+          10 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          6 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 7 -1.</_>
+        <_>
+          10 1 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 7 -1.</_>
+        <_>
+          7 1 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 17 -1.</_>
+        <_>
+          5 1 4 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 12 -1.</_>
+        <_>
+          12 1 3 6 2.</_>
+        <_>
+          9 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 9 15 -1.</_>
+        <_>
+          5 5 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 4 -1.</_>
+        <_>
+          12 0 8 2 2.</_>
+        <_>
+          4 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 4 -1.</_>
+        <_>
+          0 0 8 2 2.</_>
+        <_>
+          8 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 6 -1.</_>
+        <_>
+          15 4 5 3 2.</_>
+        <_>
+          10 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 13 2 -1.</_>
+        <_>
+          5 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 6 -1.</_>
+        <_>
+          0 4 5 3 2.</_>
+        <_>
+          5 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 12 5 -1.</_>
+        <_>
+          12 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 7 6 -1.</_>
+        <_>
+          11 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 6 -1.</_>
+        <_>
+          1 17 18 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 6 -1.</_>
+        <_>
+          3 3 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 6 -1.</_>
+        <_>
+          12 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 5 -1.</_>
+        <_>
+          9 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          5 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 5 -1.</_>
+        <_>
+          5 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 16 -1.</_>
+        <_>
+          12 2 3 8 2.</_>
+        <_>
+          9 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 14 -1.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 16 -1.</_>
+        <_>
+          17 4 2 8 2.</_>
+        <_>
+          15 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 8 -1.</_>
+        <_>
+          5 1 5 4 2.</_>
+        <_>
+          10 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 7 6 -1.</_>
+        <_>
+          11 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 14 3 -1.</_>
+        <_>
+          1 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 8 -1.</_>
+        <_>
+          13 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 8 -1.</_>
+        <_>
+          0 5 9 4 2.</_>
+        <_>
+          9 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 14 -1.</_>
+        <_>
+          15 5 2 7 2.</_>
+        <_>
+          13 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 13 -1.</_>
+        <_>
+          2 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 14 -1.</_>
+        <_>
+          15 5 2 7 2.</_>
+        <_>
+          13 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 14 -1.</_>
+        <_>
+          3 5 2 7 2.</_>
+        <_>
+          5 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 7 6 -1.</_>
+        <_>
+          11 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 16 -1.</_>
+        <_>
+          16 4 3 8 2.</_>
+        <_>
+          13 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 6 -1.</_>
+        <_>
+          0 9 5 3 2.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 15 -1.</_>
+        <_>
+          9 10 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 10 -1.</_>
+        <_>
+          10 2 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 16 -1.</_>
+        <_>
+          16 4 3 8 2.</_>
+        <_>
+          13 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 5 -1.</_>
+        <_>
+          7 8 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 16 -1.</_>
+        <_>
+          16 4 3 8 2.</_>
+        <_>
+          13 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 16 -1.</_>
+        <_>
+          1 4 3 8 2.</_>
+        <_>
+          4 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 4 -1.</_>
+        <_>
+          11 15 9 2 2.</_>
+        <_>
+          2 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 16 -1.</_>
+        <_>
+          7 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 4 -1.</_>
+        <_>
+          0 6 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 17 -1.</_>
+        <_>
+          14 1 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 6 -1.</_>
+        <_>
+          2 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 16 -1.</_>
+        <_>
+          14 0 3 8 2.</_>
+        <_>
+          11 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 3 -1.</_>
+        <_>
+          1 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 16 -1.</_>
+        <_>
+          3 0 3 8 2.</_>
+        <_>
+          6 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 10 3 -1.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 5 -1.</_>
+        <_>
+          7 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 6 -1.</_>
+        <_>
+          7 0 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 3 -1.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          7 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 6 -1.</_>
+        <_>
+          11 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 7 9 -1.</_>
+        <_>
+          4 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 10 6 -1.</_>
+        <_>
+          5 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 19 4 -1.</_>
+        <_>
+          0 16 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 8 -1.</_>
+        <_>
+          12 9 6 4 2.</_>
+        <_>
+          6 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 14 -1.</_>
+        <_>
+          2 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 8 -1.</_>
+        <_>
+          12 9 6 4 2.</_>
+        <_>
+          6 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 8 -1.</_>
+        <_>
+          2 9 6 4 2.</_>
+        <_>
+          8 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 18 -1.</_>
+        <_>
+          18 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 8 -1.</_>
+        <_>
+          8 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 12 -1.</_>
+        <_>
+          10 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 12 -1.</_>
+        <_>
+          12 8 3 6 2.</_>
+        <_>
+          9 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 18 -1.</_>
+        <_>
+          18 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 17 6 -1.</_>
+        <_>
+          1 7 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 6 -1.</_>
+        <_>
+          3 2 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 5 6 -1.</_>
+        <_>
+          0 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 10 -1.</_>
+        <_>
+          4 6 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 7 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 10 9 -1.</_>
+        <_>
+          6 4 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 19 -1.</_>
+        <_>
+          10 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 19 -1.</_>
+        <_>
+          5 1 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 12 -1.</_>
+        <_>
+          13 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 12 -1.</_>
+        <_>
+          3 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_>
+        <_>
+          2 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 5 -1.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 8 -1.</_>
+        <_>
+          12 5 6 4 2.</_>
+        <_>
+          6 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 8 -1.</_>
+        <_>
+          2 5 6 4 2.</_>
+        <_>
+          8 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 3 -1.</_>
+        <_>
+          5 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 3 -1.</_>
+        <_>
+          2 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 13 2 -1.</_>
+        <_>
+          7 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 3 -1.</_>
+        <_>
+          2 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 4 -1.</_>
+        <_>
+          10 14 9 2 2.</_>
+        <_>
+          1 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 10 -1.</_>
+        <_>
+          5 8 3 5 2.</_>
+        <_>
+          8 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 10 -1.</_>
+        <_>
+          12 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 3 -1.</_>
+        <_>
+          2 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 3 -1.</_>
+        <_>
+          0 2 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 4 -1.</_>
+        <_>
+          2 3 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 9 -1.</_>
+        <_>
+          0 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 15 3 -1.</_>
+        <_>
+          3 6 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 6 -1.</_>
+        <_>
+          1 5 5 3 2.</_>
+        <_>
+          6 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 12 -1.</_>
+        <_>
+          9 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 19 2 -1.</_>
+        <_>
+          0 3 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 10 -1.</_>
+        <_>
+          16 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 13 3 -1.</_>
+        <_>
+          1 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 4 -1.</_>
+        <_>
+          7 2 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 10 -1.</_>
+        <_>
+          4 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 7 -1.</_>
+        <_>
+          9 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 13 -1.</_>
+        <_>
+          5 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 6 -1.</_>
+        <_>
+          14 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 15 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 8 -1.</_>
+        <_>
+          16 0 4 4 2.</_>
+        <_>
+          12 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 9 -1.</_>
+        <_>
+          7 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 6 -1.</_>
+        <_>
+          11 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 9 5 -1.</_>
+        <_>
+          8 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 10 -1.</_>
+        <_>
+          12 9 3 5 2.</_>
+        <_>
+          9 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 10 -1.</_>
+        <_>
+          5 9 3 5 2.</_>
+        <_>
+          8 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 10 -1.</_>
+        <_>
+          16 10 3 5 2.</_>
+        <_>
+          13 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 10 -1.</_>
+        <_>
+          1 10 3 5 2.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 12 -1.</_>
+        <_>
+          10 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 12 -1.</_>
+        <_>
+          8 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 5 -1.</_>
+        <_>
+          14 1 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 3 -1.</_>
+        <_>
+          10 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 10 -1.</_>
+        <_>
+          10 2 4 5 2.</_>
+        <_>
+          6 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          0 0 4 4 2.</_>
+        <_>
+          4 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 10 -1.</_>
+        <_>
+          14 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 5 -1.</_>
+        <_>
+          3 1 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 17 -1.</_>
+        <_>
+          16 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 20 -1.</_>
+        <_>
+          4 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 17 -1.</_>
+        <_>
+          16 0 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          10 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 14 -1.</_>
+        <_>
+          8 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 14 15 -1.</_>
+        <_>
+          1 8 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 16 -1.</_>
+        <_>
+          16 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 9 -1.</_>
+        <_>
+          4 9 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 16 -1.</_>
+        <_>
+          16 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 16 -1.</_>
+        <_>
+          2 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 4 7 -1.</_>
+        <_>
+          15 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          3 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 4 -1.</_>
+        <_>
+          12 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 7 -1.</_>
+        <_>
+          3 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 6 -1.</_>
+        <_>
+          14 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 2 13 -1.</_>
+        <_>
+          2 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 11 -1.</_>
+        <_>
+          7 2 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 7 -1.</_>
+        <_>
+          8 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          10 6 10 7 2.</_>
+        <_>
+          0 13 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 15 -1.</_>
+        <_>
+          6 5 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 15 -1.</_>
+        <_>
+          16 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          7 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          10 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 6 -1.</_>
+        <_>
+          5 13 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 17 12 -1.</_>
+        <_>
+          3 13 17 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 17 12 -1.</_>
+        <_>
+          0 13 17 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 19 -1.</_>
+        <_>
+          8 0 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 7 -1.</_>
+        <_>
+          9 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 7 8 -1.</_>
+        <_>
+          9 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 19 2 -1.</_>
+        <_>
+          0 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 6 -1.</_>
+        <_>
+          11 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 3 -1.</_>
+        <_>
+          5 0 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          18 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 6 -1.</_>
+        <_>
+          0 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 7 8 -1.</_>
+        <_>
+          9 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 7 8 -1.</_>
+        <_>
+          4 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 2 -1.</_>
+        <_>
+          3 4 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 10 6 -1.</_>
+        <_>
+          6 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 7 6 -1.</_>
+        <_>
+          0 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 15 9 -1.</_>
+        <_>
+          3 14 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 20 -1.</_>
+        <_>
+          10 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 20 -1.</_>
+        <_>
+          5 0 5 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 3 -1.</_>
+        <_>
+          5 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 8 -1.</_>
+        <_>
+          5 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 18 -1.</_>
+        <_>
+          4 9 13 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 4 -1.</_>
+        <_>
+          5 0 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 3 -1.</_>
+        <_>
+          9 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 6 -1.</_>
+        <_>
+          9 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 2 -1.</_>
+        <_>
+          0 8 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 14 -1.</_>
+        <_>
+          6 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 5 12 -1.</_>
+        <_>
+          13 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 6 -1.</_>
+        <_>
+          4 4 6 3 2.</_>
+        <_>
+          10 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 8 -1.</_>
+        <_>
+          10 1 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 10 -1.</_>
+        <_>
+          1 1 3 5 2.</_>
+        <_>
+          4 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 8 -1.</_>
+        <_>
+          11 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 8 -1.</_>
+        <_>
+          1 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 12 -1.</_>
+        <_>
+          13 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 12 -1.</_>
+        <_>
+          4 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 8 -1.</_>
+        <_>
+          10 1 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 8 -1.</_>
+        <_>
+          7 1 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 10 -1.</_>
+        <_>
+          5 2 3 5 2.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          17 0 3 5 2.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          8 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 8 -1.</_>
+        <_>
+          7 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 9 -1.</_>
+        <_>
+          15 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 16 -1.</_>
+        <_>
+          1 4 2 8 2.</_>
+        <_>
+          3 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 4 -1.</_>
+        <_>
+          11 14 8 2 2.</_>
+        <_>
+          3 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 6 -1.</_>
+        <_>
+          8 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 2 -1.</_>
+        <_>
+          6 1 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 2 -1.</_>
+        <_>
+          7 1 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 8 -1.</_>
+        <_>
+          12 0 4 4 2.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 14 -1.</_>
+        <_>
+          5 4 5 7 2.</_>
+        <_>
+          10 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_>
+        <_>
+          2 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          9 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 4 -1.</_>
+        <_>
+          11 10 7 2 2.</_>
+        <_>
+          4 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 14 4 -1.</_>
+        <_>
+          2 10 7 2 2.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 6 -1.</_>
+        <_>
+          7 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 8 -1.</_>
+        <_>
+          6 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 9 4 -1.</_>
+        <_>
+          1 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 2 -1.</_>
+        <_>
+          4 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 3 -1.</_>
+        <_>
+          1 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 9 -1.</_>
+        <_>
+          9 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 7 -1.</_>
+        <_>
+          8 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 12 -1.</_>
+        <_>
+          4 8 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 5 -1.</_>
+        <_>
+          10 11 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 6 -1.</_>
+        <_>
+          4 7 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 16 -1.</_>
+        <_>
+          0 3 2 8 2.</_>
+        <_>
+          2 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 8 -1.</_>
+        <_>
+          0 4 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 8 -1.</_>
+        <_>
+          12 7 4 4 2.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 8 -1.</_>
+        <_>
+          4 7 4 4 2.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 12 -1.</_>
+        <_>
+          4 5 5 6 2.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 11 -1.</_>
+        <_>
+          2 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 11 -1.</_>
+        <_>
+          12 4 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 11 -1.</_>
+        <_>
+          5 4 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 9 -1.</_>
+        <_>
+          8 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          10 3 10 2 2.</_>
+        <_>
+          0 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 4 -1.</_>
+        <_>
+          0 15 9 2 2.</_>
+        <_>
+          9 17 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 13 3 -1.</_>
+        <_>
+          6 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 13 -1.</_>
+        <_>
+          10 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 7 -1.</_>
+        <_>
+          9 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          8 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 5 -1.</_>
+        <_>
+          8 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 5 -1.</_>
+        <_>
+          8 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 19 -1.</_>
+        <_>
+          7 1 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 20 -1.</_>
+        <_>
+          8 0 5 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 3 -1.</_>
+        <_>
+          7 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 6 -1.</_>
+        <_>
+          11 4 7 3 2.</_>
+        <_>
+          4 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 3 -1.</_>
+        <_>
+          6 8 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 5 12 -1.</_>
+        <_>
+          2 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 7 4 -1.</_>
+        <_>
+          9 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 7 4 -1.</_>
+        <_>
+          4 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 10 -1.</_>
+        <_>
+          9 6 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 17 2 -1.</_>
+        <_>
+          3 11 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 17 -1.</_>
+        <_>
+          3 0 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 12 -1.</_>
+        <_>
+          14 0 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 16 -1.</_>
+        <_>
+          4 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 7 -1.</_>
+        <_>
+          16 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          2 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 12 -1.</_>
+        <_>
+          12 1 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 9 12 -1.</_>
+        <_>
+          5 1 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 12 -1.</_>
+        <_>
+          13 5 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 12 -1.</_>
+        <_>
+          5 5 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          10 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 4 -1.</_>
+        <_>
+          6 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 11 -1.</_>
+        <_>
+          8 9 6 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 6 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 19 2 -1.</_>
+        <_>
+          1 13 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 13 3 -1.</_>
+        <_>
+          0 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 4 -1.</_>
+        <_>
+          0 8 8 2 2.</_>
+        <_>
+          8 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 8 -1.</_>
+        <_>
+          12 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 6 -1.</_>
+        <_>
+          3 15 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 6 -1.</_>
+        <_>
+          4 15 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 4 -1.</_>
+        <_>
+          7 0 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 10 -1.</_>
+        <_>
+          14 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 12 -1.</_>
+        <_>
+          2 4 7 6 2.</_>
+        <_>
+          9 10 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 10 -1.</_>
+        <_>
+          10 4 3 5 2.</_>
+        <_>
+          7 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 15 -1.</_>
+        <_>
+          1 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 19 12 -1.</_>
+        <_>
+          1 5 19 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 7 -1.</_>
+        <_>
+          7 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 16 -1.</_>
+        <_>
+          12 0 2 8 2.</_>
+        <_>
+          10 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 16 -1.</_>
+        <_>
+          6 0 2 8 2.</_>
+        <_>
+          8 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 11 -1.</_>
+        <_>
+          8 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 3 -1.</_>
+        <_>
+          0 12 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 7 4 -1.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 16 4 -1.</_>
+        <_>
+          1 14 8 2 2.</_>
+        <_>
+          9 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 13 3 -1.</_>
+        <_>
+          7 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 8 -1.</_>
+        <_>
+          1 12 9 4 2.</_>
+        <_>
+          10 16 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 10 -1.</_>
+        <_>
+          14 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 4 10 -1.</_>
+        <_>
+          2 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 12 -1.</_>
+        <_>
+          2 7 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 16 -1.</_>
+        <_>
+          7 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 12 -1.</_>
+        <_>
+          7 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 15 8 -1.</_>
+        <_>
+          7 12 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 15 4 -1.</_>
+        <_>
+          9 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 6 -1.</_>
+        <_>
+          10 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 12 -1.</_>
+        <_>
+          1 8 9 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 15 3 -1.</_>
+        <_>
+          5 17 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 17 -1.</_>
+        <_>
+          11 2 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 17 -1.</_>
+        <_>
+          7 2 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 7 -1.</_>
+        <_>
+          9 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 15 3 -1.</_>
+        <_>
+          0 12 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 11 6 -1.</_>
+        <_>
+          9 12 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 18 -1.</_>
+        <_>
+          9 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 8 -1.</_>
+        <_>
+          14 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 15 8 -1.</_>
+        <_>
+          1 15 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 10 -1.</_>
+        <_>
+          9 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 9 -1.</_>
+        <_>
+          1 9 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 2 -1.</_>
+        <_>
+          3 2 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 3 -1.</_>
+        <_>
+          0 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 2 -1.</_>
+        <_>
+          5 1 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 10 -1.</_>
+        <_>
+          7 8 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 12 -1.</_>
+        <_>
+          6 6 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 4 -1.</_>
+        <_>
+          4 5 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 5 9 -1.</_>
+        <_>
+          0 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 6 -1.</_>
+        <_>
+          7 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          4 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 17 14 -1.</_>
+        <_>
+          2 12 17 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 8 -1.</_>
+        <_>
+          0 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 15 -1.</_>
+        <_>
+          13 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 15 -1.</_>
+        <_>
+          6 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 5 -1.</_>
+        <_>
+          12 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 5 -1.</_>
+        <_>
+          4 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 3 -1.</_>
+        <_>
+          3 7 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 18 -1.</_>
+        <_>
+          7 1 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 9 4 -1.</_>
+        <_>
+          6 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          3 17 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 13 3 -1.</_>
+        <_>
+          7 17 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 4 -1.</_>
+        <_>
+          4 4 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 14 4 -1.</_>
+        <_>
+          13 4 7 2 2.</_>
+        <_>
+          6 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 10 8 -1.</_>
+        <_>
+          3 12 5 4 2.</_>
+        <_>
+          8 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 9 -1.</_>
+        <_>
+          12 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_>
+        <_>
+          7 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 10 -1.</_>
+        <_>
+          2 10 3 5 2.</_>
+        <_>
+          5 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 20 6 -1.</_>
+        <_>
+          0 15 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 16 4 -1.</_>
+        <_>
+          1 18 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 9 -1.</_>
+        <_>
+          12 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 5 9 -1.</_>
+        <_>
+          3 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 13 12 -1.</_>
+        <_>
+          5 12 13 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          5 5 5 3 2.</_>
+        <_>
+          10 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 6 -1.</_>
+        <_>
+          10 5 5 3 2.</_>
+        <_>
+          5 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 2 -1.</_>
+        <_>
+          0 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 4 -1.</_>
+        <_>
+          8 4 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 6 -1.</_>
+        <_>
+          5 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 4 -1.</_>
+        <_>
+          12 2 7 2 2.</_>
+        <_>
+          5 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 8 -1.</_>
+        <_>
+          8 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 5 8 -1.</_>
+        <_>
+          9 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 4 -1.</_>
+        <_>
+          6 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 14 4 -1.</_>
+        <_>
+          11 6 7 2 2.</_>
+        <_>
+          4 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 11 10 -1.</_>
+        <_>
+          4 9 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 12 -1.</_>
+        <_>
+          7 7 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 15 -1.</_>
+        <_>
+          8 10 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 3 -1.</_>
+        <_>
+          7 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          0 6 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 4 -1.</_>
+        <_>
+          5 5 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 8 -1.</_>
+        <_>
+          6 11 4 4 2.</_>
+        <_>
+          10 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 3 -1.</_>
+        <_>
+          5 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 4 -1.</_>
+        <_>
+          0 13 9 2 2.</_>
+        <_>
+          9 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 13 -1.</_>
+        <_>
+          11 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 13 -1.</_>
+        <_>
+          8 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 18 -1.</_>
+        <_>
+          8 0 6 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 15 -1.</_>
+        <_>
+          2 7 12 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 11 18 -1.</_>
+        <_>
+          7 7 11 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 14 -1.</_>
+        <_>
+          8 5 2 7 2.</_>
+        <_>
+          10 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 14 -1.</_>
+        <_>
+          10 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 14 -1.</_>
+        <_>
+          7 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 4 -1.</_>
+        <_>
+          3 6 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 4 -1.</_>
+        <_>
+          0 5 10 2 2.</_>
+        <_>
+          10 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 14 -1.</_>
+        <_>
+          8 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 16 -1.</_>
+        <_>
+          17 3 2 8 2.</_>
+        <_>
+          15 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 7 -1.</_>
+        <_>
+          4 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 9 -1.</_>
+        <_>
+          12 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 8 6 -1.</_>
+        <_>
+          2 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 8 -1.</_>
+        <_>
+          10 1 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 5 6 -1.</_>
+        <_>
+          4 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 4 -1.</_>
+        <_>
+          7 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 8 -1.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 6 -1.</_>
+        <_>
+          10 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 7 6 -1.</_>
+        <_>
+          3 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 12 -1.</_>
+        <_>
+          11 6 3 6 2.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 14 -1.</_>
+        <_>
+          5 6 2 7 2.</_>
+        <_>
+          7 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 2 -1.</_>
+        <_>
+          0 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 2 -1.</_>
+        <_>
+          6 16 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 19 3 -1.</_>
+        <_>
+          0 18 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          12 5 3 5 2.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 2 -1.</_>
+        <_>
+          3 4 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 17 6 -1.</_>
+        <_>
+          2 2 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 16 -1.</_>
+        <_>
+          1 3 2 8 2.</_>
+        <_>
+          3 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 6 -1.</_>
+        <_>
+          12 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 4 -1.</_>
+        <_>
+          5 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          14 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 6 -1.</_>
+        <_>
+          10 0 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          10 9 3 5 2.</_>
+        <_>
+          7 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 6 -1.</_>
+        <_>
+          6 14 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 16 -1.</_>
+        <_>
+          14 0 3 8 2.</_>
+        <_>
+          11 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 7 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 8 -1.</_>
+        <_>
+          11 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          7 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 13 -1.</_>
+        <_>
+          17 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 16 6 -1.</_>
+        <_>
+          9 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 6 -1.</_>
+        <_>
+          5 3 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 14 15 -1.</_>
+        <_>
+          6 9 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 4 -1.</_>
+        <_>
+          3 1 7 2 2.</_>
+        <_>
+          10 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 10 -1.</_>
+        <_>
+          11 3 3 5 2.</_>
+        <_>
+          8 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 10 -1.</_>
+        <_>
+          6 3 3 5 2.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 10 -1.</_>
+        <_>
+          12 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 10 -1.</_>
+        <_>
+          5 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 5 -1.</_>
+        <_>
+          11 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 6 -1.</_>
+        <_>
+          5 7 5 3 2.</_>
+        <_>
+          10 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 19 3 -1.</_>
+        <_>
+          1 11 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 13 -1.</_>
+        <_>
+          2 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 16 -1.</_>
+        <_>
+          16 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 12 -1.</_>
+        <_>
+          3 5 7 6 2.</_>
+        <_>
+          10 11 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 16 -1.</_>
+        <_>
+          16 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 16 -1.</_>
+        <_>
+          2 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          8 2 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 6 -1.</_>
+        <_>
+          3 12 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 10 -1.</_>
+        <_>
+          11 9 3 5 2.</_>
+        <_>
+          8 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 10 -1.</_>
+        <_>
+          6 9 3 5 2.</_>
+        <_>
+          9 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 10 3 -1.</_>
+        <_>
+          5 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 18 -1.</_>
+        <_>
+          8 2 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          10 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 7 6 -1.</_>
+        <_>
+          0 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 15 6 -1.</_>
+        <_>
+          10 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 15 6 -1.</_>
+        <_>
+          5 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 14 -1.</_>
+        <_>
+          2 4 2 7 2.</_>
+        <_>
+          4 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 12 -1.</_>
+        <_>
+          14 1 3 6 2.</_>
+        <_>
+          11 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 12 -1.</_>
+        <_>
+          3 1 3 6 2.</_>
+        <_>
+          6 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 6 -1.</_>
+        <_>
+          9 7 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 10 -1.</_>
+        <_>
+          1 0 3 5 2.</_>
+        <_>
+          4 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 5 -1.</_>
+        <_>
+          11 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 7 -1.</_>
+        <_>
+          3 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 8 5 -1.</_>
+        <_>
+          9 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 5 -1.</_>
+        <_>
+          7 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 19 -1.</_>
+        <_>
+          8 0 4 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 6 -1.</_>
+        <_>
+          7 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 5 6 -1.</_>
+        <_>
+          15 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 13 10 -1.</_>
+        <_>
+          3 6 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 10 -1.</_>
+        <_>
+          14 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 8 -1.</_>
+        <_>
+          0 1 10 4 2.</_>
+        <_>
+          10 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 12 -1.</_>
+        <_>
+          11 6 3 6 2.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 10 -1.</_>
+        <_>
+          10 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 14 -1.</_>
+        <_>
+          9 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 18 -1.</_>
+        <_>
+          11 1 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 18 -1.</_>
+        <_>
+          7 1 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 5 -1.</_>
+        <_>
+          7 1 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          7 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 6 -1.</_>
+        <_>
+          12 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 7 6 -1.</_>
+        <_>
+          1 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 7 4 -1.</_>
+        <_>
+          9 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 9 -1.</_>
+        <_>
+          0 5 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 9 -1.</_>
+        <_>
+          10 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 6 -1.</_>
+        <_>
+          0 1 9 3 2.</_>
+        <_>
+          9 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 3 -1.</_>
+        <_>
+          5 7 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 5 -1.</_>
+        <_>
+          3 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 9 6 -1.</_>
+        <_>
+          13 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 9 -1.</_>
+        <_>
+          0 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 19 -1.</_>
+        <_>
+          8 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 13 -1.</_>
+        <_>
+          9 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 9 6 -1.</_>
+        <_>
+          6 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 14 -1.</_>
+        <_>
+          10 4 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 14 -1.</_>
+        <_>
+          6 4 4 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 5 -1.</_>
+        <_>
+          7 1 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 19 -1.</_>
+        <_>
+          8 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 5 -1.</_>
+        <_>
+          11 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 9 5 -1.</_>
+        <_>
+          6 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 4 -1.</_>
+        <_>
+          8 1 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 18 -1.</_>
+        <_>
+          1 2 4 9 2.</_>
+        <_>
+          5 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 9 -1.</_>
+        <_>
+          11 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 9 -1.</_>
+        <_>
+          3 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 10 6 -1.</_>
+        <_>
+          13 14 5 3 2.</_>
+        <_>
+          8 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 6 -1.</_>
+        <_>
+          9 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 7 6 -1.</_>
+        <_>
+          4 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 16 -1.</_>
+        <_>
+          3 8 17 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 3 -1.</_>
+        <_>
+          0 1 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 5 9 -1.</_>
+        <_>
+          11 4 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 6 -1.</_>
+        <_>
+          4 4 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 12 9 -1.</_>
+        <_>
+          7 13 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 12 3 -1.</_>
+        <_>
+          7 10 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          10 8 3 6 2.</_>
+        <_>
+          7 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 14 5 3 2.</_>
+        <_>
+          7 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 8 -1.</_>
+        <_>
+          10 9 4 4 2.</_>
+        <_>
+          6 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          7 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 6 -1.</_>
+        <_>
+          11 6 5 3 2.</_>
+        <_>
+          6 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 6 -1.</_>
+        <_>
+          4 6 5 3 2.</_>
+        <_>
+          9 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 5 -1.</_>
+        <_>
+          9 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 10 -1.</_>
+        <_>
+          8 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 7 -1.</_>
+        <_>
+          10 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 4 -1.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 9 -1.</_>
+        <_>
+          0 3 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 8 4 -1.</_>
+        <_>
+          9 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 6 -1.</_>
+        <_>
+          4 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 4 -1.</_>
+        <_>
+          8 8 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 13 -1.</_>
+        <_>
+          1 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 11 -1.</_>
+        <_>
+          15 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 11 -1.</_>
+        <_>
+          3 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 5 -1.</_>
+        <_>
+          11 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 17 -1.</_>
+        <_>
+          6 2 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 8 -1.</_>
+        <_>
+          12 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 4 -1.</_>
+        <_>
+          6 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 9 6 -1.</_>
+        <_>
+          2 13 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 11 6 -1.</_>
+        <_>
+          9 14 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 8 -1.</_>
+        <_>
+          3 11 7 4 2.</_>
+        <_>
+          10 15 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 10 -1.</_>
+        <_>
+          8 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 3 -1.</_>
+        <_>
+          1 13 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 12 -1.</_>
+        <_>
+          9 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 6 -1.</_>
+        <_>
+          0 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 6 -1.</_>
+        <_>
+          13 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 16 -1.</_>
+        <_>
+          4 12 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 9 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 9 4 -1.</_>
+        <_>
+          0 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 6 -1.</_>
+        <_>
+          2 14 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 7 -1.</_>
+        <_>
+          9 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 12 4 -1.</_>
+        <_>
+          4 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 8 -1.</_>
+        <_>
+          13 9 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 8 -1.</_>
+        <_>
+          5 9 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 19 -1.</_>
+        <_>
+          11 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          7 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 7 6 -1.</_>
+        <_>
+          13 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 13 3 -1.</_>
+        <_>
+          1 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 13 3 -1.</_>
+        <_>
+          5 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 9 4 -1.</_>
+        <_>
+          4 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 7 6 -1.</_>
+        <_>
+          7 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 14 4 -1.</_>
+        <_>
+          3 14 7 2 2.</_>
+        <_>
+          10 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 14 -1.</_>
+        <_>
+          13 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 14 -1.</_>
+        <_>
+          0 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 16 4 -1.</_>
+        <_>
+          3 2 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 8 -1.</_>
+        <_>
+          6 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 14 -1.</_>
+        <_>
+          10 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 9 -1.</_>
+        <_>
+          1 10 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 14 -1.</_>
+        <_>
+          9 5 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 14 -1.</_>
+        <_>
+          8 5 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 15 -1.</_>
+        <_>
+          11 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 8 -1.</_>
+        <_>
+          8 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 10 9 -1.</_>
+        <_>
+          6 13 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_>
+        <_>
+          7 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 13 -1.</_>
+        <_>
+          9 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 4 -1.</_>
+        <_>
+          8 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 14 2 -1.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 14 2 -1.</_>
+        <_>
+          7 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 15 -1.</_>
+        <_>
+          16 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 10 -1.</_>
+        <_>
+          2 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 12 -1.</_>
+        <_>
+          16 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 4 12 -1.</_>
+        <_>
+          0 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 6 -1.</_>
+        <_>
+          12 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 14 -1.</_>
+        <_>
+          11 5 2 7 2.</_>
+        <_>
+          9 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 11 6 -1.</_>
+        <_>
+          0 14 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 5 -1.</_>
+        <_>
+          9 15 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          6 6 3 6 2.</_>
+        <_>
+          9 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 4 -1.</_>
+        <_>
+          7 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 10 -1.</_>
+        <_>
+          5 8 3 5 2.</_>
+        <_>
+          8 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 7 14 -1.</_>
+        <_>
+          7 11 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 8 -1.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 9 -1.</_>
+        <_>
+          9 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 9 -1.</_>
+        <_>
+          5 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 11 -1.</_>
+        <_>
+          10 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          10 1 9 2 2.</_>
+        <_>
+          1 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 16 -1.</_>
+        <_>
+          3 4 2 8 2.</_>
+        <_>
+          5 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 8 -1.</_>
+        <_>
+          10 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 7 -1.</_>
+        <_>
+          2 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 9 -1.</_>
+        <_>
+          14 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 9 -1.</_>
+        <_>
+          0 5 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 13 -1.</_>
+        <_>
+          17 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 13 -1.</_>
+        <_>
+          2 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 7 -1.</_>
+        <_>
+          6 7 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 10 -1.</_>
+        <_>
+          5 3 3 5 2.</_>
+        <_>
+          8 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 5 -1.</_>
+        <_>
+          9 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 8 -1.</_>
+        <_>
+          4 4 6 4 2.</_>
+        <_>
+          10 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 10 6 -1.</_>
+        <_>
+          13 8 5 3 2.</_>
+        <_>
+          8 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 6 -1.</_>
+        <_>
+          2 8 5 3 2.</_>
+        <_>
+          7 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 14 -1.</_>
+        <_>
+          13 5 4 7 2.</_>
+        <_>
+          9 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 13 -1.</_>
+        <_>
+          4 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 5 -1.</_>
+        <_>
+          9 14 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 14 -1.</_>
+        <_>
+          1 6 2 7 2.</_>
+        <_>
+          3 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 8 8 -1.</_>
+        <_>
+          13 6 4 4 2.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 8 -1.</_>
+        <_>
+          2 4 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 14 -1.</_>
+        <_>
+          13 5 4 7 2.</_>
+        <_>
+          9 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 8 -1.</_>
+        <_>
+          3 6 4 4 2.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 10 -1.</_>
+        <_>
+          14 3 3 5 2.</_>
+        <_>
+          11 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 10 -1.</_>
+        <_>
+          3 3 3 5 2.</_>
+        <_>
+          6 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 10 -1.</_>
+        <_>
+          15 0 4 5 2.</_>
+        <_>
+          11 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 13 3 -1.</_>
+        <_>
+          3 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 13 3 -1.</_>
+        <_>
+          5 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 12 -1.</_>
+        <_>
+          0 8 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 6 -1.</_>
+        <_>
+          12 8 8 3 2.</_>
+        <_>
+          4 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 7 6 -1.</_>
+        <_>
+          12 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 9 7 -1.</_>
+        <_>
+          5 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 15 9 -1.</_>
+        <_>
+          5 9 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 15 9 -1.</_>
+        <_>
+          0 9 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 2 -1.</_>
+        <_>
+          6 9 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 10 3 -1.</_>
+        <_>
+          8 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 5 -1.</_>
+        <_>
+          14 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 2 -1.</_>
+        <_>
+          10 6 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 8 -1.</_>
+        <_>
+          5 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 3 -1.</_>
+        <_>
+          0 4 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_>
+        <_>
+          3 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 2 -1.</_>
+        <_>
+          2 8 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 7 6 -1.</_>
+        <_>
+          10 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 19 2 -1.</_>
+        <_>
+          0 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 18 -1.</_>
+        <_>
+          13 9 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 9 5 -1.</_>
+        <_>
+          4 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 17 -1.</_>
+        <_>
+          18 0 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 16 -1.</_>
+        <_>
+          1 0 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          10 1 3 5 2.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 11 -1.</_>
+        <_>
+          4 9 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 16 -1.</_>
+        <_>
+          10 2 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 16 -1.</_>
+        <_>
+          8 2 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 12 -1.</_>
+        <_>
+          9 4 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 9 -1.</_>
+        <_>
+          7 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 13 3 -1.</_>
+        <_>
+          0 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 7 6 -1.</_>
+        <_>
+          10 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 11 6 -1.</_>
+        <_>
+          4 4 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 8 4 -1.</_>
+        <_>
+          9 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 10 -1.</_>
+        <_>
+          5 5 3 5 2.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 13 -1.</_>
+        <_>
+          16 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 13 -1.</_>
+        <_>
+          3 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 13 -1.</_>
+        <_>
+          14 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 6 -1.</_>
+        <_>
+          4 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 8 -1.</_>
+        <_>
+          0 6 20 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 13 18 -1.</_>
+        <_>
+          2 10 13 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 10 -1.</_>
+        <_>
+          9 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 14 -1.</_>
+        <_>
+          9 6 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 18 2 -1.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 3 13 -1.</_>
+        <_>
+          5 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 7 -1.</_>
+        <_>
+          13 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 7 -1.</_>
+        <_>
+          5 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 13 -1.</_>
+        <_>
+          13 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 13 -1.</_>
+        <_>
+          9 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 12 -1.</_>
+        <_>
+          8 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 8 5 -1.</_>
+        <_>
+          6 4 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 16 -1.</_>
+        <_>
+          7 4 3 8 2.</_>
+        <_>
+          10 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 13 -1.</_>
+        <_>
+          13 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 4 -1.</_>
+        <_>
+          3 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 6 -1.</_>
+        <_>
+          12 8 8 3 2.</_>
+        <_>
+          4 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 8 -1.</_>
+        <_>
+          5 15 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 17 -1.</_>
+        <_>
+          12 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 17 -1.</_>
+        <_>
+          6 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 3 -1.</_>
+        <_>
+          5 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 16 2 -1.</_>
+        <_>
+          9 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 10 -1.</_>
+        <_>
+          9 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 13 -1.</_>
+        <_>
+          6 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 13 2 -1.</_>
+        <_>
+          4 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 12 -1.</_>
+        <_>
+          3 4 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 6 -1.</_>
+        <_>
+          0 4 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 10 -1.</_>
+        <_>
+          9 5 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 20 -1.</_>
+        <_>
+          0 10 20 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 4 -1.</_>
+        <_>
+          10 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 4 -1.</_>
+        <_>
+          5 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 10 -1.</_>
+        <_>
+          15 0 4 5 2.</_>
+        <_>
+          11 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 10 -1.</_>
+        <_>
+          1 0 4 5 2.</_>
+        <_>
+          5 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 4 -1.</_>
+        <_>
+          13 3 7 2 2.</_>
+        <_>
+          6 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 4 -1.</_>
+        <_>
+          0 3 10 2 2.</_>
+        <_>
+          10 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 7 -1.</_>
+        <_>
+          6 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 16 -1.</_>
+        <_>
+          8 0 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 8 -1.</_>
+        <_>
+          7 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 11 8 -1.</_>
+        <_>
+          7 16 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 12 -1.</_>
+        <_>
+          6 0 3 6 2.</_>
+        <_>
+          9 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 12 -1.</_>
+        <_>
+          10 3 6 6 2.</_>
+        <_>
+          4 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 7 -1.</_>
+        <_>
+          4 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 7 -1.</_>
+        <_>
+          15 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 7 -1.</_>
+        <_>
+          3 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 13 2 -1.</_>
+        <_>
+          3 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 3 -1.</_>
+        <_>
+          4 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 7 6 -1.</_>
+        <_>
+          1 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 13 9 -1.</_>
+        <_>
+          6 8 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 16 6 -1.</_>
+        <_>
+          0 8 8 3 2.</_>
+        <_>
+          8 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 5 12 -1.</_>
+        <_>
+          15 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 5 12 -1.</_>
+        <_>
+          0 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 14 3 -1.</_>
+        <_>
+          5 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 9 -1.</_>
+        <_>
+          4 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 9 7 -1.</_>
+        <_>
+          14 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 5 -1.</_>
+        <_>
+          3 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 19 3 -1.</_>
+        <_>
+          0 12 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 14 4 -1.</_>
+        <_>
+          13 15 7 2 2.</_>
+        <_>
+          6 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 6 -1.</_>
+        <_>
+          0 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 11 -1.</_>
+        <_>
+          16 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 11 -1.</_>
+        <_>
+          2 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 5 -1.</_>
+        <_>
+          8 11 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 14 4 -1.</_>
+        <_>
+          1 15 7 2 2.</_>
+        <_>
+          8 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 7 9 -1.</_>
+        <_>
+          12 13 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 7 9 -1.</_>
+        <_>
+          1 13 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 8 -1.</_>
+        <_>
+          15 7 4 4 2.</_>
+        <_>
+          11 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 4 -1.</_>
+        <_>
+          6 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 19 -1.</_>
+        <_>
+          11 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 10 -1.</_>
+        <_>
+          6 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 5 -1.</_>
+        <_>
+          11 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 5 -1.</_>
+        <_>
+          6 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 15 4 -1.</_>
+        <_>
+          9 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 16 2 -1.</_>
+        <_>
+          8 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 14 -1.</_>
+        <_>
+          3 5 4 7 2.</_>
+        <_>
+          7 12 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 7 15 -1.</_>
+        <_>
+          12 7 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 7 15 -1.</_>
+        <_>
+          1 7 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 12 -1.</_>
+        <_>
+          13 6 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 10 -1.</_>
+        <_>
+          6 0 4 5 2.</_>
+        <_>
+          10 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 19 -1.</_>
+        <_>
+          11 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 8 -1.</_>
+        <_>
+          4 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 15 4 -1.</_>
+        <_>
+          9 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 19 -1.</_>
+        <_>
+          8 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 9 -1.</_>
+        <_>
+          10 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 4 -1.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 15 4 -1.</_>
+        <_>
+          9 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 4 12 -1.</_>
+        <_>
+          2 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 6 -1.</_>
+        <_>
+          10 7 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 4 -1.</_>
+        <_>
+          7 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 12 4 -1.</_>
+        <_>
+          8 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 4 -1.</_>
+        <_>
+          6 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 15 4 -1.</_>
+        <_>
+          9 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 15 4 -1.</_>
+        <_>
+          6 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 18 -1.</_>
+        <_>
+          10 0 4 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 4 -1.</_>
+        <_>
+          0 6 7 2 2.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 7 6 -1.</_>
+        <_>
+          13 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 18 -1.</_>
+        <_>
+          0 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 4 -1.</_>
+        <_>
+          13 8 7 2 2.</_>
+        <_>
+          6 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 4 -1.</_>
+        <_>
+          0 8 7 2 2.</_>
+        <_>
+          7 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 10 -1.</_>
+        <_>
+          3 7 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 7 -1.</_>
+        <_>
+          5 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 6 -1.</_>
+        <_>
+          11 4 7 3 2.</_>
+        <_>
+          4 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 10 -1.</_>
+        <_>
+          6 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 18 -1.</_>
+        <_>
+          11 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 3 15 -1.</_>
+        <_>
+          3 6 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 6 -1.</_>
+        <_>
+          7 0 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 15 -1.</_>
+        <_>
+          2 5 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          8 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 8 -1.</_>
+        <_>
+          6 8 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 12 -1.</_>
+        <_>
+          10 8 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 3 -1.</_>
+        <_>
+          6 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 14 -1.</_>
+        <_>
+          9 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 6 -1.</_>
+        <_>
+          5 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 7 6 -1.</_>
+        <_>
+          9 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 4 -1.</_>
+        <_>
+          7 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 15 3 -1.</_>
+        <_>
+          5 18 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          5 11 5 3 2.</_>
+        <_>
+          10 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 3 -1.</_>
+        <_>
+          4 5 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 9 -1.</_>
+        <_>
+          5 14 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 9 -1.</_>
+        <_>
+          2 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 14 -1.</_>
+        <_>
+          1 3 2 7 2.</_>
+        <_>
+          3 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 12 -1.</_>
+        <_>
+          13 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 13 -1.</_>
+        <_>
+          9 7 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 5 -1.</_>
+        <_>
+          10 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 5 -1.</_>
+        <_>
+          8 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 13 -1.</_>
+        <_>
+          9 5 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 12 -1.</_>
+        <_>
+          7 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          8 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 16 -1.</_>
+        <_>
+          4 3 6 8 2.</_>
+        <_>
+          10 11 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 13 -1.</_>
+        <_>
+          15 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 3 -1.</_>
+        <_>
+          3 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 20 7 -1.</_>
+        <_>
+          0 13 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 13 -1.</_>
+        <_>
+          4 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 14 -1.</_>
+        <_>
+          4 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          16 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 14 4 -1.</_>
+        <_>
+          0 6 7 2 2.</_>
+        <_>
+          7 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          16 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          0 6 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 12 -1.</_>
+        <_>
+          16 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 15 3 -1.</_>
+        <_>
+          0 9 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 6 -1.</_>
+        <_>
+          10 1 8 3 2.</_>
+        <_>
+          2 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          2 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 5 -1.</_>
+        <_>
+          12 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 4 -1.</_>
+        <_>
+          7 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 13 -1.</_>
+        <_>
+          14 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          3 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 5 -1.</_>
+        <_>
+          10 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 7 -1.</_>
+        <_>
+          8 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 7 -1.</_>
+        <_>
+          7 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 13 -1.</_>
+        <_>
+          5 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          8 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 14 -1.</_>
+        <_>
+          6 5 2 7 2.</_>
+        <_>
+          8 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 19 4 -1.</_>
+        <_>
+          1 7 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 7 6 -1.</_>
+        <_>
+          0 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 13 2 -1.</_>
+        <_>
+          6 13 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 10 -1.</_>
+        <_>
+          3 0 6 5 2.</_>
+        <_>
+          9 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          8 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 3 -1.</_>
+        <_>
+          9 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 14 6 -1.</_>
+        <_>
+          6 14 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 6 -1.</_>
+        <_>
+          7 14 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 7 -1.</_>
+        <_>
+          13 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 4 -1.</_>
+        <_>
+          6 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 6 -1.</_>
+        <_>
+          13 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 4 -1.</_>
+        <_>
+          12 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 2 4 4 2.</_>
+        <_>
+          5 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          8 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 3 -1.</_>
+        <_>
+          6 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 7 -1.</_>
+        <_>
+          7 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 16 2 -1.</_>
+        <_>
+          3 17 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 6 -1.</_>
+        <_>
+          3 3 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 3 -1.</_>
+        <_>
+          4 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 5 12 -1.</_>
+        <_>
+          1 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 13 3 -1.</_>
+        <_>
+          6 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 7 4 -1.</_>
+        <_>
+          1 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          9 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 8 -1.</_>
+        <_>
+          9 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 8 -1.</_>
+        <_>
+          16 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 3 -1.</_>
+        <_>
+          3 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 5 -1.</_>
+        <_>
+          12 2 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 7 4 -1.</_>
+        <_>
+          5 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 6 -1.</_>
+        <_>
+          11 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 6 -1.</_>
+        <_>
+          2 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 9 4 -1.</_>
+        <_>
+          10 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 13 3 -1.</_>
+        <_>
+          2 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 10 6 -1.</_>
+        <_>
+          10 15 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 6 -1.</_>
+        <_>
+          0 15 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 8 -1.</_>
+        <_>
+          10 8 8 4 2.</_>
+        <_>
+          2 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 7 -1.</_>
+        <_>
+          5 0 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 7 -1.</_>
+        <_>
+          9 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 10 9 -1.</_>
+        <_>
+          1 10 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 11 6 -1.</_>
+        <_>
+          5 5 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 13 -1.</_>
+        <_>
+          1 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 11 -1.</_>
+        <_>
+          16 1 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 14 -1.</_>
+        <_>
+          2 6 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 8 12 -1.</_>
+        <_>
+          11 8 4 6 2.</_>
+        <_>
+          7 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 8 -1.</_>
+        <_>
+          2 10 8 4 2.</_>
+        <_>
+          10 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 7 8 -1.</_>
+        <_>
+          11 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 7 8 -1.</_>
+        <_>
+          2 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 14 -1.</_>
+        <_>
+          17 6 2 7 2.</_>
+        <_>
+          15 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 14 -1.</_>
+        <_>
+          1 6 2 7 2.</_>
+        <_>
+          3 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 8 -1.</_>
+        <_>
+          15 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 8 -1.</_>
+        <_>
+          4 0 4 4 2.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 7 6 -1.</_>
+        <_>
+          7 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 3 -1.</_>
+        <_>
+          3 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          10 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 20 14 -1.</_>
+        <_>
+          0 10 20 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 12 -1.</_>
+        <_>
+          2 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 6 -1.</_>
+        <_>
+          12 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 6 -1.</_>
+        <_>
+          4 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 8 -1.</_>
+        <_>
+          14 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 4 8 -1.</_>
+        <_>
+          4 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 10 -1.</_>
+        <_>
+          16 6 3 5 2.</_>
+        <_>
+          13 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 10 -1.</_>
+        <_>
+          1 6 3 5 2.</_>
+        <_>
+          4 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 2 -1.</_>
+        <_>
+          7 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 11 4 -1.</_>
+        <_>
+          3 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 8 -1.</_>
+        <_>
+          13 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 6 8 -1.</_>
+        <_>
+          4 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_>
+        <_>
+          12 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 8 -1.</_>
+        <_>
+          0 6 4 4 2.</_>
+        <_>
+          4 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 16 2 -1.</_>
+        <_>
+          3 9 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 3 -1.</_>
+        <_>
+          0 8 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 14 3 -1.</_>
+        <_>
+          5 12 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 20 -1.</_>
+        <_>
+          9 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 9 7 -1.</_>
+        <_>
+          11 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 3 -1.</_>
+        <_>
+          10 6 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 3 -1.</_>
+        <_>
+          4 8 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 5 -1.</_>
+        <_>
+          7 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 9 7 -1.</_>
+        <_>
+          11 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 7 -1.</_>
+        <_>
+          6 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 10 -1.</_>
+        <_>
+          11 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 6 -1.</_>
+        <_>
+          1 9 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 15 -1.</_>
+        <_>
+          8 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 15 -1.</_>
+        <_>
+          6 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 14 3 -1.</_>
+        <_>
+          6 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 10 -1.</_>
+        <_>
+          1 10 3 5 2.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 13 -1.</_>
+        <_>
+          11 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 9 -1.</_>
+        <_>
+          10 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 8 -1.</_>
+        <_>
+          10 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 2 -1.</_>
+        <_>
+          3 6 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 8 -1.</_>
+        <_>
+          3 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 14 -1.</_>
+        <_>
+          18 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 14 -1.</_>
+        <_>
+          0 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 16 2 -1.</_>
+        <_>
+          3 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 9 6 -1.</_>
+        <_>
+          2 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 7 6 -1.</_>
+        <_>
+          11 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 8 -1.</_>
+        <_>
+          1 8 4 4 2.</_>
+        <_>
+          5 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 8 -1.</_>
+        <_>
+          8 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 8 -1.</_>
+        <_>
+          4 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 8 -1.</_>
+        <_>
+          15 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 5 8 -1.</_>
+        <_>
+          7 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 13 2 -1.</_>
+        <_>
+          5 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 9 12 -1.</_>
+        <_>
+          2 8 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 3 -1.</_>
+        <_>
+          3 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 8 6 -1.</_>
+        <_>
+          9 16 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 8 -1.</_>
+        <_>
+          1 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 4 -1.</_>
+        <_>
+          9 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 7 -1.</_>
+        <_>
+          6 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 15 -1.</_>
+        <_>
+          12 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 19 -1.</_>
+        <_>
+          12 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 7 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 8 4 -1.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 8 -1.</_>
+        <_>
+          9 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 14 -1.</_>
+        <_>
+          11 4 5 7 2.</_>
+        <_>
+          6 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 14 -1.</_>
+        <_>
+          4 4 5 7 2.</_>
+        <_>
+          9 11 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 15 -1.</_>
+        <_>
+          2 8 18 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 9 -1.</_>
+        <_>
+          6 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 9 -1.</_>
+        <_>
+          8 10 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 4 -1.</_>
+        <_>
+          2 8 7 2 2.</_>
+        <_>
+          9 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 10 -1.</_>
+        <_>
+          6 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 9 5 -1.</_>
+        <_>
+          7 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 4 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 7 -1.</_>
+        <_>
+          12 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 12 -1.</_>
+        <_>
+          6 7 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 8 -1.</_>
+        <_>
+          9 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 16 -1.</_>
+        <_>
+          5 3 3 8 2.</_>
+        <_>
+          8 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 6 -1.</_>
+        <_>
+          12 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 6 -1.</_>
+        <_>
+          5 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 9 -1.</_>
+        <_>
+          10 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 7 -1.</_>
+        <_>
+          7 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          12 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          6 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 6 -1.</_>
+        <_>
+          6 8 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 10 10 -1.</_>
+        <_>
+          13 10 5 5 2.</_>
+        <_>
+          8 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 15 4 -1.</_>
+        <_>
+          7 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 10 13 -1.</_>
+        <_>
+          9 6 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 10 13 -1.</_>
+        <_>
+          6 6 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 16 2 -1.</_>
+        <_>
+          4 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 16 2 -1.</_>
+        <_>
+          9 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 12 -1.</_>
+        <_>
+          15 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 12 -1.</_>
+        <_>
+          2 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 7 -1.</_>
+        <_>
+          8 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 3 -1.</_>
+        <_>
+          2 5 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 2 13 -1.</_>
+        <_>
+          16 6 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 5 -1.</_>
+        <_>
+          7 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 4 14 -1.</_>
+        <_>
+          16 6 2 7 2.</_>
+        <_>
+          14 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 3 -1.</_>
+        <_>
+          6 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 2 -1.</_>
+        <_>
+          4 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 13 10 -1.</_>
+        <_>
+          3 7 13 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 10 -1.</_>
+        <_>
+          7 7 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 7 6 -1.</_>
+        <_>
+          3 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 6 -1.</_>
+        <_>
+          4 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 6 -1.</_>
+        <_>
+          3 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 6 -1.</_>
+        <_>
+          13 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 16 -1.</_>
+        <_>
+          5 0 2 8 2.</_>
+        <_>
+          7 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 6 -1.</_>
+        <_>
+          10 14 9 3 2.</_>
+        <_>
+          1 17 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 14 3 -1.</_>
+        <_>
+          9 17 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 7 -1.</_>
+        <_>
+          16 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 15 -1.</_>
+        <_>
+          8 1 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 6 -1.</_>
+        <_>
+          13 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 13 -1.</_>
+        <_>
+          3 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 4 -1.</_>
+        <_>
+          12 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 7 4 -1.</_>
+        <_>
+          1 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 2 -1.</_>
+        <_>
+          7 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 6 -1.</_>
+        <_>
+          0 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 8 -1.</_>
+        <_>
+          8 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 10 10 -1.</_>
+        <_>
+          13 10 5 5 2.</_>
+        <_>
+          8 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 10 10 -1.</_>
+        <_>
+          2 10 5 5 2.</_>
+        <_>
+          7 15 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 6 -1.</_>
+        <_>
+          11 13 5 3 2.</_>
+        <_>
+          6 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 10 6 -1.</_>
+        <_>
+          4 13 5 3 2.</_>
+        <_>
+          9 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 12 -1.</_>
+        <_>
+          7 12 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 14 4 -1.</_>
+        <_>
+          1 14 7 2 2.</_>
+        <_>
+          8 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 7 4 -1.</_>
+        <_>
+          11 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 16 4 -1.</_>
+        <_>
+          1 17 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 8 -1.</_>
+        <_>
+          8 0 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 12 -1.</_>
+        <_>
+          0 12 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 13 2 -1.</_>
+        <_>
+          7 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 2 -1.</_>
+        <_>
+          0 12 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 19 3 -1.</_>
+        <_>
+          1 13 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 3 -1.</_>
+        <_>
+          0 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 9 -1.</_>
+        <_>
+          9 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 9 -1.</_>
+        <_>
+          5 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 13 3 -1.</_>
+        <_>
+          4 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 9 4 -1.</_>
+        <_>
+          5 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 8 -1.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 4 -1.</_>
+        <_>
+          3 8 7 2 2.</_>
+        <_>
+          10 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 6 -1.</_>
+        <_>
+          8 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 9 -1.</_>
+        <_>
+          3 8 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 12 -1.</_>
+        <_>
+          10 9 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 6 -1.</_>
+        <_>
+          0 6 9 3 2.</_>
+        <_>
+          9 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 4 -1.</_>
+        <_>
+          11 6 8 2 2.</_>
+        <_>
+          3 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 7 4 -1.</_>
+        <_>
+          4 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 7 6 -1.</_>
+        <_>
+          12 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 7 6 -1.</_>
+        <_>
+          1 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 6 -1.</_>
+        <_>
+          6 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 6 -1.</_>
+        <_>
+          0 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 13 -1.</_>
+        <_>
+          18 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 13 -1.</_>
+        <_>
+          1 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 13 3 -1.</_>
+        <_>
+          6 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 6 -1.</_>
+        <_>
+          0 13 5 3 2.</_>
+        <_>
+          5 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 8 8 -1.</_>
+        <_>
+          14 12 4 4 2.</_>
+        <_>
+          10 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 8 -1.</_>
+        <_>
+          6 10 4 4 2.</_>
+        <_>
+          10 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 7 -1.</_>
+        <_>
+          12 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 5 -1.</_>
+        <_>
+          8 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 7 6 -1.</_>
+        <_>
+          7 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 7 -1.</_>
+        <_>
+          6 13 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 9 -1.</_>
+        <_>
+          7 10 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 3 -1.</_>
+        <_>
+          1 13 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 13 2 -1.</_>
+        <_>
+          7 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 7 -1.</_>
+        <_>
+          9 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 12 10 -1.</_>
+        <_>
+          14 10 6 5 2.</_>
+        <_>
+          8 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 10 -1.</_>
+        <_>
+          0 10 6 5 2.</_>
+        <_>
+          6 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 9 -1.</_>
+        <_>
+          7 10 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 12 4 -1.</_>
+        <_>
+          7 16 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 9 4 -1.</_>
+        <_>
+          7 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 9 4 -1.</_>
+        <_>
+          4 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 19 -1.</_>
+        <_>
+          12 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 7 6 -1.</_>
+        <_>
+          6 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 15 -1.</_>
+        <_>
+          12 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 19 -1.</_>
+        <_>
+          7 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 10 -1.</_>
+        <_>
+          11 0 7 5 2.</_>
+        <_>
+          4 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 10 -1.</_>
+        <_>
+          2 0 7 5 2.</_>
+        <_>
+          9 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 13 -1.</_>
+        <_>
+          11 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 8 -1.</_>
+        <_>
+          8 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 10 -1.</_>
+        <_>
+          11 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 13 2 -1.</_>
+        <_>
+          3 19 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 8 -1.</_>
+        <_>
+          11 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 8 -1.</_>
+        <_>
+          5 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 6 -1.</_>
+        <_>
+          12 8 8 3 2.</_>
+        <_>
+          4 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 10 -1.</_>
+        <_>
+          7 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 13 -1.</_>
+        <_>
+          11 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 3 13 -1.</_>
+        <_>
+          8 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 7 -1.</_>
+        <_>
+          6 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 9 -1.</_>
+        <_>
+          10 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 12 -1.</_>
+        <_>
+          9 11 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          10 2 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 10 6 -1.</_>
+        <_>
+          13 1 5 3 2.</_>
+        <_>
+          8 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 9 10 -1.</_>
+        <_>
+          0 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 14 -1.</_>
+        <_>
+          10 8 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 14 -1.</_>
+        <_>
+          0 8 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 18 -1.</_>
+        <_>
+          0 2 2 9 2.</_>
+        <_>
+          2 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 7 -1.</_>
+        <_>
+          12 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 7 -1.</_>
+        <_>
+          5 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 17 -1.</_>
+        <_>
+          14 2 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 8 -1.</_>
+        <_>
+          2 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 10 -1.</_>
+        <_>
+          6 10 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 17 -1.</_>
+        <_>
+          5 2 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 5 -1.</_>
+        <_>
+          6 6 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 15 3 -1.</_>
+        <_>
+          5 11 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 10 6 -1.</_>
+        <_>
+          3 0 5 3 2.</_>
+        <_>
+          8 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 2 -1.</_>
+        <_>
+          0 14 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 15 -1.</_>
+        <_>
+          5 2 4 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 16 -1.</_>
+        <_>
+          8 0 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 16 -1.</_>
+        <_>
+          6 0 6 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 13 -1.</_>
+        <_>
+          14 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 17 -1.</_>
+        <_>
+          5 3 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 10 -1.</_>
+        <_>
+          13 6 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 11 -1.</_>
+        <_>
+          4 5 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 12 -1.</_>
+        <_>
+          16 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 10 -1.</_>
+        <_>
+          5 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 12 -1.</_>
+        <_>
+          16 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 12 -1.</_>
+        <_>
+          0 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 6 -1.</_>
+        <_>
+          13 0 7 3 2.</_>
+        <_>
+          6 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 19 -1.</_>
+        <_>
+          3 1 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 13 -1.</_>
+        <_>
+          17 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 13 -1.</_>
+        <_>
+          3 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 5 -1.</_>
+        <_>
+          12 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 5 -1.</_>
+        <_>
+          5 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 7 -1.</_>
+        <_>
+          12 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 10 3 -1.</_>
+        <_>
+          6 1 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 8 -1.</_>
+        <_>
+          12 0 8 4 2.</_>
+        <_>
+          4 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 7 6 -1.</_>
+        <_>
+          11 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 9 -1.</_>
+        <_>
+          3 11 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 10 -1.</_>
+        <_>
+          6 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 6 -1.</_>
+        <_>
+          15 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 6 -1.</_>
+        <_>
+          0 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 4 -1.</_>
+        <_>
+          12 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 6 -1.</_>
+        <_>
+          2 3 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 4 -1.</_>
+        <_>
+          12 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 4 -1.</_>
+        <_>
+          4 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 7 6 -1.</_>
+        <_>
+          7 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 10 -1.</_>
+        <_>
+          13 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 7 6 -1.</_>
+        <_>
+          2 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 13 3 -1.</_>
+        <_>
+          7 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 13 3 -1.</_>
+        <_>
+          0 15 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 12 -1.</_>
+        <_>
+          9 6 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 12 -1.</_>
+        <_>
+          5 6 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          9 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 8 18 -1.</_>
+        <_>
+          9 8 8 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 7 -1.</_>
+        <_>
+          10 6 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 9 9 -1.</_>
+        <_>
+          3 10 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 13 -1.</_>
+        <_>
+          15 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 15 -1.</_>
+        <_>
+          4 6 12 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          8 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 20 -1.</_>
+        <_>
+          3 10 12 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 19 3 -1.</_>
+        <_>
+          1 18 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 2 -1.</_>
+        <_>
+          9 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 9 -1.</_>
+        <_>
+          10 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 9 -1.</_>
+        <_>
+          8 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 4 -1.</_>
+        <_>
+          5 13 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 8 4 -1.</_>
+        <_>
+          2 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 7 6 -1.</_>
+        <_>
+          9 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 3 -1.</_>
+        <_>
+          3 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 8 -1.</_>
+        <_>
+          10 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 13 -1.</_>
+        <_>
+          11 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          0 0 3 5 2.</_>
+        <_>
+          3 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 18 -1.</_>
+        <_>
+          8 6 7 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 13 -1.</_>
+        <_>
+          7 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 5 -1.</_>
+        <_>
+          10 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 18 -1.</_>
+        <_>
+          9 1 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 15 -1.</_>
+        <_>
+          9 5 11 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 8 -1.</_>
+        <_>
+          0 0 8 4 2.</_>
+        <_>
+          8 4 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 14 -1.</_>
+        <_>
+          10 3 6 7 2.</_>
+        <_>
+          4 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 12 -1.</_>
+        <_>
+          5 6 3 6 2.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 11 9 -1.</_>
+        <_>
+          6 6 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 8 -1.</_>
+        <_>
+          0 0 9 4 2.</_>
+        <_>
+          9 4 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 12 -1.</_>
+        <_>
+          11 11 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 14 8 -1.</_>
+        <_>
+          2 9 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 8 -1.</_>
+        <_>
+          16 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 7 6 -1.</_>
+        <_>
+          4 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 7 6 -1.</_>
+        <_>
+          7 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 8 -1.</_>
+        <_>
+          0 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 13 -1.</_>
+        <_>
+          17 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 6 -1.</_>
+        <_>
+          4 2 5 3 2.</_>
+        <_>
+          9 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 3 -1.</_>
+        <_>
+          4 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 7 6 -1.</_>
+        <_>
+          5 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 3 -1.</_>
+        <_>
+          6 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 7 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 13 3 -1.</_>
+        <_>
+          1 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 11 9 -1.</_>
+        <_>
+          6 6 11 3 3.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_default.xml b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_default.xml
new file mode 100644
index 000000000..cbd1aa89e
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_frontalface_default.xml
@@ -0,0 +1,33314 @@
+<?xml version="1.0"?>
+<!--
+    Stump-based 24x24 discrete(?) adaboost frontal face detector.
+    Created by Rainer Lienhart.
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>24</height>
+  <width>24</width>
+  <stageParams>
+    <maxWeakCount>211</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>25</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-5.0425500869750977e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 -3.1511999666690826e-02</internalNodes>
+          <leafValues>
+            2.0875380039215088e+00 -2.2172100543975830e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 1.2396000325679779e-02</internalNodes>
+          <leafValues>
+            -1.8633940219879150e+00 1.3272049427032471e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 2.1927999332547188e-02</internalNodes>
+          <leafValues>
+            -1.5105249881744385e+00 1.0625729560852051e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 5.7529998011887074e-03</internalNodes>
+          <leafValues>
+            -8.7463897466659546e-01 1.1760339736938477e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 1.5014000236988068e-02</internalNodes>
+          <leafValues>
+            -7.7945697307586670e-01 1.2608419656753540e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 9.9371001124382019e-02</internalNodes>
+          <leafValues>
+            5.5751299858093262e-01 -1.8743000030517578e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 2.7340000960975885e-03</internalNodes>
+          <leafValues>
+            -1.6911929845809937e+00 4.4009700417518616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 -1.8859000876545906e-02</internalNodes>
+          <leafValues>
+            -1.4769539833068848e+00 4.4350099563598633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 5.9739998541772366e-03</internalNodes>
+          <leafValues>
+            -8.5909199714660645e-01 8.5255599021911621e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-4.9842400550842285e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 9 -2.1110000088810921e-02</internalNodes>
+          <leafValues>
+            1.2435649633407593e+00 -1.5713009834289551e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 2.0355999469757080e-02</internalNodes>
+          <leafValues>
+            -1.6204780340194702e+00 1.1817760467529297e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 2.1308999508619308e-02</internalNodes>
+          <leafValues>
+            -1.9415930509567261e+00 7.0069098472595215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 9.1660000383853912e-02</internalNodes>
+          <leafValues>
+            -5.5670100450515747e-01 1.7284419536590576e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 3.6288000643253326e-02</internalNodes>
+          <leafValues>
+            2.6763799786567688e-01 -2.1831810474395752e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -1.9109999760985374e-02</internalNodes>
+          <leafValues>
+            -2.6730210781097412e+00 4.5670801401138306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 8.2539999857544899e-03</internalNodes>
+          <leafValues>
+            -1.0852910280227661e+00 5.3564202785491943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 1.8355000764131546e-02</internalNodes>
+          <leafValues>
+            -3.5200199484825134e-01 9.3339198827743530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -7.0569999516010284e-03</internalNodes>
+          <leafValues>
+            9.2782098054885864e-01 -6.6349899768829346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -9.8770000040531158e-03</internalNodes>
+          <leafValues>
+            1.1577470302581787e+00 -2.9774799942970276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 1.5814000740647316e-02</internalNodes>
+          <leafValues>
+            -4.1960600018501282e-01 1.3576040267944336e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 -2.0700000226497650e-02</internalNodes>
+          <leafValues>
+            1.4590020179748535e+00 -1.9739399850368500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -1.3760800659656525e-01</internalNodes>
+          <leafValues>
+            1.1186759471893311e+00 -5.2915501594543457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 1.4318999834358692e-02</internalNodes>
+          <leafValues>
+            -3.5127198696136475e-01 1.1440860033035278e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 1.0253000073134899e-02</internalNodes>
+          <leafValues>
+            -6.0850602388381958e-01 7.7098500728607178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 9.1508001089096069e-02</internalNodes>
+          <leafValues>
+            3.8817799091339111e-01 -1.5122940540313721e+00</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-4.6551899909973145e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 25 6.9747000932693481e-02</internalNodes>
+          <leafValues>
+            -1.0130879878997803e+00 1.4687349796295166e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 3.1502999365329742e-02</internalNodes>
+          <leafValues>
+            -1.6463639736175537e+00 1.0000629425048828e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 1.4260999858379364e-02</internalNodes>
+          <leafValues>
+            4.6480301022529602e-01 -1.5959889888763428e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 1.4453000389039516e-02</internalNodes>
+          <leafValues>
+            -6.5511900186538696e-01 8.3021801710128784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -3.0509999487549067e-03</internalNodes>
+          <leafValues>
+            -1.3982310295104980e+00 4.2550599575042725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 3.2722998410463333e-02</internalNodes>
+          <leafValues>
+            -5.0702601671218872e-01 1.0526109933853149e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -7.2960001416504383e-03</internalNodes>
+          <leafValues>
+            3.6356899142265320e-01 -1.3464889526367188e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 5.0425000488758087e-02</internalNodes>
+          <leafValues>
+            -3.0461400747299194e-01 1.4504129886627197e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 4.6879000961780548e-02</internalNodes>
+          <leafValues>
+            -4.0286201238632202e-01 1.2145609855651855e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -6.9358997046947479e-02</internalNodes>
+          <leafValues>
+            1.0539360046386719e+00 -4.5719701051712036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -4.9033999443054199e-02</internalNodes>
+          <leafValues>
+            -1.6253089904785156e+00 1.5378999710083008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 8.4827996790409088e-02</internalNodes>
+          <leafValues>
+            2.8402999043464661e-01 -1.5662059783935547e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -1.7229999648407102e-03</internalNodes>
+          <leafValues>
+            -1.0147459506988525e+00 2.3294800519943237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 1.1562199890613556e-01</internalNodes>
+          <leafValues>
+            -1.6732899844646454e-01 1.2804069519042969e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 -5.1279999315738678e-02</internalNodes>
+          <leafValues>
+            1.5162390470504761e+00 -3.0271100997924805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -4.2706999927759171e-02</internalNodes>
+          <leafValues>
+            1.7631920576095581e+00 -5.1832001656293869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 3.7178099155426025e-01</internalNodes>
+          <leafValues>
+            -3.1389200687408447e-01 1.5357979536056519e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 1.9412999972701073e-02</internalNodes>
+          <leafValues>
+            -1.0017599910497665e-01 9.3655401468276978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 1.7439000308513641e-02</internalNodes>
+          <leafValues>
+            -4.0379899740219116e-01 9.6293002367019653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 3.9638999849557877e-02</internalNodes>
+          <leafValues>
+            1.7039099335670471e-01 -2.9602990150451660e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 -9.1469995677471161e-03</internalNodes>
+          <leafValues>
+            8.8786798715591431e-01 -4.3818700313568115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 1.7219999572262168e-03</internalNodes>
+          <leafValues>
+            -3.7218600511550903e-01 4.0018901228904724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 3.0231000855565071e-02</internalNodes>
+          <leafValues>
+            6.5924003720283508e-02 -2.6469180583953857e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -7.8795999288558960e-02</internalNodes>
+          <leafValues>
+            -1.7491459846496582e+00 2.8475299477577209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 2.1110000088810921e-03</internalNodes>
+          <leafValues>
+            -9.3908101320266724e-01 2.3205199837684631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 2.7091000229120255e-02</internalNodes>
+          <leafValues>
+            -5.2664000540971756e-02 1.0756820440292358e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 -4.4964998960494995e-02</internalNodes>
+          <leafValues>
+            -1.8294479846954346e+00 9.9561996757984161e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>32</maxWeakCount>
+      <stageThreshold>-4.4531588554382324e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 52 -6.5701000392436981e-02</internalNodes>
+          <leafValues>
+            1.1558510065078735e+00 -1.0716359615325928e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 1.5839999541640282e-02</internalNodes>
+          <leafValues>
+            -1.5634720325469971e+00 7.6877099275588989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 1.4570899307727814e-01</internalNodes>
+          <leafValues>
+            -5.7450097799301147e-01 1.3808720111846924e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 6.1389999464154243e-03</internalNodes>
+          <leafValues>
+            -1.4570560455322266e+00 5.1610302925109863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 6.7179999314248562e-03</internalNodes>
+          <leafValues>
+            -8.3533602952957153e-01 5.8522200584411621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 1.8518000841140747e-02</internalNodes>
+          <leafValues>
+            -3.1312099099159241e-01 1.1696679592132568e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 1.9958000630140305e-02</internalNodes>
+          <leafValues>
+            -4.3442600965499878e-01 9.5446902513504028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -2.7755001187324524e-01</internalNodes>
+          <leafValues>
+            1.4906179904937744e+00 -1.3815900683403015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 9.1859996318817139e-03</internalNodes>
+          <leafValues>
+            -9.6361500024795532e-01 2.7665498852729797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -3.7737999111413956e-02</internalNodes>
+          <leafValues>
+            -2.4464108943939209e+00 2.3619599640369415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 1.8463000655174255e-02</internalNodes>
+          <leafValues>
+            1.7539200186729431e-01 -1.3423130512237549e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -1.1114999651908875e-02</internalNodes>
+          <leafValues>
+            4.8710799217224121e-01 -8.9851897954940796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 3.3927999436855316e-02</internalNodes>
+          <leafValues>
+            1.7874200642108917e-01 -1.6342279911041260e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -3.5649001598358154e-02</internalNodes>
+          <leafValues>
+            -1.9607399702072144e+00 1.8102499842643738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -1.1438000015914440e-02</internalNodes>
+          <leafValues>
+            9.9010699987411499e-01 -3.8103199005126953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 -6.5236002206802368e-02</internalNodes>
+          <leafValues>
+            -2.5794160366058350e+00 2.4753600358963013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -4.2272001504898071e-02</internalNodes>
+          <leafValues>
+            1.4411840438842773e+00 -2.9508298635482788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 1.9219999667257071e-03</internalNodes>
+          <leafValues>
+            -4.9608600139617920e-01 6.3173598051071167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -1.2921799719333649e-01</internalNodes>
+          <leafValues>
+            -2.3314270973205566e+00 5.4496999830007553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 2.2931000217795372e-02</internalNodes>
+          <leafValues>
+            -8.4447097778320312e-01 3.8738098740577698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 -3.4120000898838043e-02</internalNodes>
+          <leafValues>
+            -1.4431500434875488e+00 9.8422996699810028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 2.6223000138998032e-02</internalNodes>
+          <leafValues>
+            1.8223099410533905e-01 -1.2586519718170166e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 2.2236999124288559e-02</internalNodes>
+          <leafValues>
+            6.9807998836040497e-02 -2.3820950984954834e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 -5.8240001089870930e-03</internalNodes>
+          <leafValues>
+            3.9332500100135803e-01 -2.7542799711227417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 4.3653000146150589e-02</internalNodes>
+          <leafValues>
+            1.4832699298858643e-01 -1.1368780136108398e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 5.7266999036073685e-02</internalNodes>
+          <leafValues>
+            2.4628099799156189e-01 -1.2687400579452515e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 2.3409998975694180e-03</internalNodes>
+          <leafValues>
+            -7.5448900461196899e-01 2.7163800597190857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 1.2996000237762928e-02</internalNodes>
+          <leafValues>
+            -3.6394900083541870e-01 7.0959198474884033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -2.6517000049352646e-02</internalNodes>
+          <leafValues>
+            -2.3221859931945801e+00 3.5744000226259232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -5.8400002308189869e-03</internalNodes>
+          <leafValues>
+            4.2194300889968872e-01 -4.8184998333454132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 -1.6568999737501144e-02</internalNodes>
+          <leafValues>
+            1.1099940538406372e+00 -3.4849700331687927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -6.8157002329826355e-02</internalNodes>
+          <leafValues>
+            -3.3269989490509033e+00 2.1299000084400177e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>52</maxWeakCount>
+      <stageThreshold>-4.3864588737487793e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 84 3.9974000304937363e-02</internalNodes>
+          <leafValues>
+            -1.2173449993133545e+00 1.0826710462570190e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.8819500505924225e-01</internalNodes>
+          <leafValues>
+            -4.8289400339126587e-01 1.4045250415802002e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 7.8027002513408661e-02</internalNodes>
+          <leafValues>
+            -1.0782150030136108e+00 7.4040299654006958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 1.1899999663000926e-04</internalNodes>
+          <leafValues>
+            -1.2019979953765869e+00 3.7749201059341431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 8.5056997835636139e-02</internalNodes>
+          <leafValues>
+            -4.3939098715782166e-01 1.2647340297698975e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 8.9720003306865692e-03</internalNodes>
+          <leafValues>
+            -1.8440499901771545e-01 4.5726400613784790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 8.8120000436902046e-03</internalNodes>
+          <leafValues>
+            3.0396699905395508e-01 -9.5991098880767822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -2.3507999256253242e-02</internalNodes>
+          <leafValues>
+            1.2487529516220093e+00 4.6227999031543732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 7.0039997808635235e-03</internalNodes>
+          <leafValues>
+            -5.9442102909088135e-01 5.3963297605514526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 3.3851999789476395e-02</internalNodes>
+          <leafValues>
+            2.8496098518371582e-01 -1.4895249605178833e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 -3.2530000898987055e-03</internalNodes>
+          <leafValues>
+            4.8120799660682678e-01 -5.2712398767471313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 2.9097000136971474e-02</internalNodes>
+          <leafValues>
+            2.6743900775909424e-01 -1.6007850170135498e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -8.4790000692009926e-03</internalNodes>
+          <leafValues>
+            -1.3107639551162720e+00 1.5243099629878998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -1.0795000009238720e-02</internalNodes>
+          <leafValues>
+            4.5613598823547363e-01 -7.2050899267196655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -2.4620000272989273e-02</internalNodes>
+          <leafValues>
+            -1.7320619821548462e+00 6.8363003432750702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 3.7380000576376915e-03</internalNodes>
+          <leafValues>
+            -1.9303299486637115e-01 6.8243497610092163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -1.2264000251889229e-02</internalNodes>
+          <leafValues>
+            -1.6095290184020996e+00 7.5268000364303589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -4.8670000396668911e-03</internalNodes>
+          <leafValues>
+            7.4286502599716187e-01 -2.1510200202465057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 7.6725997030735016e-02</internalNodes>
+          <leafValues>
+            -2.6835098862648010e-01 1.3094140291213989e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 2.8578000143170357e-02</internalNodes>
+          <leafValues>
+            -5.8793000876903534e-02 1.2196329832077026e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 1.9694000482559204e-02</internalNodes>
+          <leafValues>
+            -3.5142898559570312e-01 8.4926998615264893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 -2.9093999415636063e-02</internalNodes>
+          <leafValues>
+            -1.0507299900054932e+00 2.9806300997734070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 -2.9144000262022018e-02</internalNodes>
+          <leafValues>
+            8.2547801733016968e-01 -3.2687199115753174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 1.9741000607609749e-02</internalNodes>
+          <leafValues>
+            2.0452600717544556e-01 -8.3760201930999756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 4.3299999088048935e-03</internalNodes>
+          <leafValues>
+            2.0577900111675262e-01 -6.6829800605773926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -3.5500999540090561e-02</internalNodes>
+          <leafValues>
+            -1.2969900369644165e+00 1.3897499442100525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 -1.6172999516129494e-02</internalNodes>
+          <leafValues>
+            -1.3110569715499878e+00 7.5751997530460358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 -2.2151000797748566e-02</internalNodes>
+          <leafValues>
+            -1.0524389743804932e+00 1.9241100549697876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -2.2707000374794006e-02</internalNodes>
+          <leafValues>
+            -1.3735309839248657e+00 6.6780999302864075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 1.6607999801635742e-02</internalNodes>
+          <leafValues>
+            -3.7135999649763107e-02 7.7846401929855347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -1.3309000059962273e-02</internalNodes>
+          <leafValues>
+            -9.9850702285766602e-01 1.2248100340366364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -3.3732000738382339e-02</internalNodes>
+          <leafValues>
+            1.4461359977722168e+00 1.3151999562978745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 1.6935000196099281e-02</internalNodes>
+          <leafValues>
+            -3.7121298909187317e-01 5.2842199802398682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 3.3259999472647905e-03</internalNodes>
+          <leafValues>
+            -5.7568502426147461e-01 3.9261901378631592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 8.3644002676010132e-02</internalNodes>
+          <leafValues>
+            1.6116000711917877e-02 -2.1173279285430908e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 2.5785198807716370e-01</internalNodes>
+          <leafValues>
+            -8.1609003245830536e-02 9.8782497644424438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -3.6566998809576035e-02</internalNodes>
+          <leafValues>
+            -1.1512110233306885e+00 9.6459001302719116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -1.6445999965071678e-02</internalNodes>
+          <leafValues>
+            3.7315499782562256e-01 -1.4585399627685547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -3.7519999314099550e-03</internalNodes>
+          <leafValues>
+            2.6179298758506775e-01 -5.8156698942184448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 -6.3660000450909138e-03</internalNodes>
+          <leafValues>
+            7.5477397441864014e-01 -1.7055200040340424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -3.8499999791383743e-03</internalNodes>
+          <leafValues>
+            2.2653999924659729e-01 -6.3876402378082275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 -4.5494001358747482e-02</internalNodes>
+          <leafValues>
+            -1.2640299797058105e+00 2.5260698795318604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -2.3941000923514366e-02</internalNodes>
+          <leafValues>
+            8.7068402767181396e-01 -2.7104699611663818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -7.7558003365993500e-02</internalNodes>
+          <leafValues>
+            -1.3901610374450684e+00 2.3612299561500549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 2.3614000529050827e-02</internalNodes>
+          <leafValues>
+            6.6140003502368927e-02 -1.2645419836044312e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -2.5750000495463610e-03</internalNodes>
+          <leafValues>
+            -5.3841698169708252e-01 3.0379098653793335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 1.2010800093412399e-01</internalNodes>
+          <leafValues>
+            -3.5343000292778015e-01 5.2866202592849731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 2.2899999748915434e-03</internalNodes>
+          <leafValues>
+            -5.8701997995376587e-01 2.4061000347137451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 6.9716997444629669e-02</internalNodes>
+          <leafValues>
+            -3.3348900079727173e-01 5.1916301250457764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -4.6670001000165939e-02</internalNodes>
+          <leafValues>
+            6.9795399904251099e-01 -1.4895999804139137e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -5.0129000097513199e-02</internalNodes>
+          <leafValues>
+            8.6146199703216553e-01 -2.5986000895500183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 3.0147999525070190e-02</internalNodes>
+          <leafValues>
+            1.9332799315452576e-01 -5.9131097793579102e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-4.1299300193786621e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 136 9.1085001826286316e-02</internalNodes>
+          <leafValues>
+            -8.9233100414276123e-01 1.0434230566024780e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 1.2818999588489532e-02</internalNodes>
+          <leafValues>
+            -1.2597670555114746e+00 5.5317097902297974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.5931999310851097e-02</internalNodes>
+          <leafValues>
+            -8.6254400014877319e-01 6.3731801509857178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 2.2780001163482666e-03</internalNodes>
+          <leafValues>
+            -7.4639201164245605e-01 5.3155601024627686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 3.1840998679399490e-02</internalNodes>
+          <leafValues>
+            -1.2650489807128906e+00 3.6153900623321533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 2.6960000395774841e-03</internalNodes>
+          <leafValues>
+            -9.8290401697158813e-01 3.6013001203536987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -1.2055000290274620e-02</internalNodes>
+          <leafValues>
+            6.4068400859832764e-01 -5.0125002861022949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 2.1324999630451202e-02</internalNodes>
+          <leafValues>
+            -2.4034999310970306e-01 8.5448002815246582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 3.0486000701785088e-02</internalNodes>
+          <leafValues>
+            -3.4273600578308105e-01 1.1428849697113037e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -4.5079998672008514e-02</internalNodes>
+          <leafValues>
+            1.0976949930191040e+00 -1.7974600195884705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -7.1700997650623322e-02</internalNodes>
+          <leafValues>
+            1.5735000371932983e+00 -3.1433498859405518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 5.9218000620603561e-02</internalNodes>
+          <leafValues>
+            -2.7582401037216187e-01 1.0448570251464844e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 6.7010000348091125e-03</internalNodes>
+          <leafValues>
+            -1.0974019765853882e+00 1.9801199436187744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 4.1046999394893646e-02</internalNodes>
+          <leafValues>
+            3.0547699332237244e-01 -1.3287999629974365e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -8.5499999113380909e-04</internalNodes>
+          <leafValues>
+            2.5807100534439087e-01 -7.0052897930145264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 -3.0360000208020210e-02</internalNodes>
+          <leafValues>
+            -1.2306419610977173e+00 2.2609399259090424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -1.2930000200867653e-02</internalNodes>
+          <leafValues>
+            4.0758600831031799e-01 -5.1234501600265503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 3.7367999553680420e-02</internalNodes>
+          <leafValues>
+            -9.4755001366138458e-02 6.1765098571777344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 2.4434000253677368e-02</internalNodes>
+          <leafValues>
+            -4.1100600361824036e-01 4.7630500793457031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 5.7007998228073120e-02</internalNodes>
+          <leafValues>
+            2.5249299407005310e-01 -6.8669801950454712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -1.6313999891281128e-02</internalNodes>
+          <leafValues>
+            -9.3928402662277222e-01 1.1448100209236145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.7648899555206299e-01</internalNodes>
+          <leafValues>
+            1.2451089620590210e+00 -5.6519001722335815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 1.7614600062370300e-01</internalNodes>
+          <leafValues>
+            -3.2528200745582581e-01 8.2791501283645630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -7.3910001665353775e-03</internalNodes>
+          <leafValues>
+            3.4783700108528137e-01 -1.7929099500179291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 6.0890998691320419e-02</internalNodes>
+          <leafValues>
+            5.5098000913858414e-02 -1.5480779409408569e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 -2.9123000800609589e-02</internalNodes>
+          <leafValues>
+            -1.0255639553070068e+00 2.4106900393962860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -4.5648999512195587e-02</internalNodes>
+          <leafValues>
+            1.0301599502563477e+00 -3.1672099232673645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 3.7333000451326370e-02</internalNodes>
+          <leafValues>
+            2.1620599925518036e-01 -8.2589900493621826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -2.4411000311374664e-02</internalNodes>
+          <leafValues>
+            -1.5957959890365601e+00 5.1139000803232193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 -5.9806998819112778e-02</internalNodes>
+          <leafValues>
+            -1.0312290191650391e+00 1.3092300295829773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -3.0106000602245331e-02</internalNodes>
+          <leafValues>
+            -1.4781630039215088e+00 3.7211999297142029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 7.4209999293088913e-03</internalNodes>
+          <leafValues>
+            -2.4024100601673126e-01 4.9333998560905457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 -2.1909999195486307e-03</internalNodes>
+          <leafValues>
+            2.8941500186920166e-01 -5.7259601354598999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 2.0860999822616577e-02</internalNodes>
+          <leafValues>
+            -2.3148399591445923e-01 6.3765901327133179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 -6.6990000195801258e-03</internalNodes>
+          <leafValues>
+            -1.2107750177383423e+00 6.4018003642559052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 1.8758000805974007e-02</internalNodes>
+          <leafValues>
+            2.4461300671100616e-01 -9.9786698818206787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 -4.4323001056909561e-02</internalNodes>
+          <leafValues>
+            -1.3699189424514771e+00 3.6051999777555466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 2.2859999909996986e-02</internalNodes>
+          <leafValues>
+            2.1288399398326874e-01 -1.0397620201110840e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 -9.8600005730986595e-04</internalNodes>
+          <leafValues>
+            3.2443600893020630e-01 -5.4291802644729614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 1.7239000648260117e-02</internalNodes>
+          <leafValues>
+            -2.8323900699615479e-01 4.4468200206756592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -3.4531001001596451e-02</internalNodes>
+          <leafValues>
+            -2.3107020854949951e+00 -3.1399999279528856e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 6.7006997764110565e-02</internalNodes>
+          <leafValues>
+            2.8715699911117554e-01 -6.4481002092361450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 2.3776899278163910e-01</internalNodes>
+          <leafValues>
+            -2.7174800634384155e-01 8.0219101905822754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -1.2903000228106976e-02</internalNodes>
+          <leafValues>
+            -1.5317620038986206e+00 2.1423600614070892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 1.0514999739825726e-02</internalNodes>
+          <leafValues>
+            7.7037997543811798e-02 -1.0581140518188477e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 1.6969000920653343e-02</internalNodes>
+          <leafValues>
+            1.4306700229644775e-01 -8.5828399658203125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 -7.2460002265870571e-03</internalNodes>
+          <leafValues>
+            -1.1020129919052124e+00 6.4906999468803406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 1.0556999593973160e-02</internalNodes>
+          <leafValues>
+            1.3964000158011913e-02 6.3601499795913696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 6.1380001716315746e-03</internalNodes>
+          <leafValues>
+            -3.4545901417732239e-01 5.6296801567077637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 1.3158000074326992e-02</internalNodes>
+          <leafValues>
+            1.9927300512790680e-01 -1.5040320158004761e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 3.1310000922530890e-03</internalNodes>
+          <leafValues>
+            -4.0903699398040771e-01 3.7796398997306824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -1.0920699685811996e-01</internalNodes>
+          <leafValues>
+            -2.2227079868316650e+00 1.2178199738264084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 8.1820003688335419e-03</internalNodes>
+          <leafValues>
+            -2.8652000427246094e-01 6.7890799045562744e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>62</maxWeakCount>
+      <stageThreshold>-4.0218091011047363e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 189 3.1346999108791351e-02</internalNodes>
+          <leafValues>
+            -8.8884598016738892e-01 9.4936800003051758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 3.1918000429868698e-02</internalNodes>
+          <leafValues>
+            -1.1146880388259888e+00 4.8888999223709106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 6.5939999185502529e-03</internalNodes>
+          <leafValues>
+            -1.0097689628601074e+00 4.9723801016807556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 2.6148000732064247e-02</internalNodes>
+          <leafValues>
+            2.5991299748420715e-01 -1.2537480592727661e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 1.2845000252127647e-02</internalNodes>
+          <leafValues>
+            -5.7138597965240479e-01 5.9659498929977417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 2.6344999670982361e-02</internalNodes>
+          <leafValues>
+            -5.5203199386596680e-01 3.0217400193214417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 -1.5083000063896179e-02</internalNodes>
+          <leafValues>
+            -1.2871240377426147e+00 2.2354200482368469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -3.8887001574039459e-02</internalNodes>
+          <leafValues>
+            1.7425049543380737e+00 -9.9747002124786377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -5.7029998861253262e-03</internalNodes>
+          <leafValues>
+            -1.0523240566253662e+00 1.8362599611282349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 -1.4860000228509307e-03</internalNodes>
+          <leafValues>
+            5.6784200668334961e-01 -4.6742001175880432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -2.8486000373959541e-02</internalNodes>
+          <leafValues>
+            1.3082909584045410e+00 -2.6460900902748108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 6.6224999725818634e-02</internalNodes>
+          <leafValues>
+            -4.6210700273513794e-01 4.1749599575996399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 8.8569996878504753e-03</internalNodes>
+          <leafValues>
+            -4.1474899649620056e-01 5.9204798936843872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 1.1355999857187271e-02</internalNodes>
+          <leafValues>
+            3.6103099584579468e-01 -4.5781201124191284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -2.7679998893290758e-03</internalNodes>
+          <leafValues>
+            -8.9238899946212769e-01 1.4199000597000122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 1.1246999725699425e-02</internalNodes>
+          <leafValues>
+            2.9353401064872742e-01 -9.7330600023269653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 7.1970000863075256e-03</internalNodes>
+          <leafValues>
+            -7.9334902763366699e-01 1.8313400447368622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 3.1768999993801117e-02</internalNodes>
+          <leafValues>
+            1.5523099899291992e-01 -1.3245639801025391e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 2.5173999369144440e-02</internalNodes>
+          <leafValues>
+            3.4214999526739120e-02 -2.0948131084442139e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 7.5360001064836979e-03</internalNodes>
+          <leafValues>
+            -3.9450600743293762e-01 5.1333999633789062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 3.2873000949621201e-02</internalNodes>
+          <leafValues>
+            8.8372997939586639e-02 -1.2814120054244995e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -2.7379998937249184e-03</internalNodes>
+          <leafValues>
+            5.5286502838134766e-01 -4.6384999155998230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -3.8075000047683716e-02</internalNodes>
+          <leafValues>
+            -1.8497270345687866e+00 4.5944001525640488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 -3.8984000682830811e-02</internalNodes>
+          <leafValues>
+            -4.8223701119422913e-01 3.4760600328445435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 2.8029999230057001e-03</internalNodes>
+          <leafValues>
+            -4.5154699683189392e-01 4.2806300520896912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -5.4145999252796173e-02</internalNodes>
+          <leafValues>
+            -8.4520798921585083e-01 1.6674900054931641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 -8.3280000835657120e-03</internalNodes>
+          <leafValues>
+            3.5348299145698547e-01 -4.7163200378417969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 3.3778000622987747e-02</internalNodes>
+          <leafValues>
+            1.8463100492954254e-01 -1.6686669588088989e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -1.1238099634647369e-01</internalNodes>
+          <leafValues>
+            -1.2521569728851318e+00 3.5992000252008438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -1.0408000089228153e-02</internalNodes>
+          <leafValues>
+            -8.1620401144027710e-01 2.3428599536418915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -4.9439999274909496e-03</internalNodes>
+          <leafValues>
+            -9.2584699392318726e-01 1.0034800320863724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 -9.3029998242855072e-03</internalNodes>
+          <leafValues>
+            5.6499302387237549e-01 -1.8881900608539581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -1.1749999597668648e-02</internalNodes>
+          <leafValues>
+            8.0302399396896362e-01 -3.8277000188827515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 -2.3217000067234039e-02</internalNodes>
+          <leafValues>
+            -8.4926998615264893e-01 1.9671200215816498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 1.6866000369191170e-02</internalNodes>
+          <leafValues>
+            -4.0591898560523987e-01 5.0695300102233887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -2.4031000211834908e-02</internalNodes>
+          <leafValues>
+            -1.5297520160675049e+00 2.3344999551773071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -3.6945998668670654e-02</internalNodes>
+          <leafValues>
+            6.3007700443267822e-01 -3.1780400872230530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 -6.1563998460769653e-02</internalNodes>
+          <leafValues>
+            5.8627897500991821e-01 -1.2107999995350838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 2.1661000326275826e-02</internalNodes>
+          <leafValues>
+            -2.5623700022697449e-01 1.0409849882125854e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 -3.6710000131279230e-03</internalNodes>
+          <leafValues>
+            2.9171100258827209e-01 -8.3287298679351807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 4.4849000871181488e-02</internalNodes>
+          <leafValues>
+            -3.9633199572563171e-01 4.5662000775337219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 5.7195000350475311e-02</internalNodes>
+          <leafValues>
+            2.1023899316787720e-01 -1.5004800558090210e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 -1.1342000216245651e-02</internalNodes>
+          <leafValues>
+            4.4071298837661743e-01 -3.8653799891471863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 -1.2004000134766102e-02</internalNodes>
+          <leafValues>
+            9.3954598903656006e-01 -1.0589499771595001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 2.2515999153256416e-02</internalNodes>
+          <leafValues>
+            9.4480002298951149e-03 -1.6799509525299072e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -1.9809000194072723e-02</internalNodes>
+          <leafValues>
+            -1.0133639574050903e+00 2.4146600067615509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 1.5891000628471375e-02</internalNodes>
+          <leafValues>
+            -3.7507599592208862e-01 4.6614098548889160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -9.1420002281665802e-03</internalNodes>
+          <leafValues>
+            -8.0484098196029663e-01 1.7816999554634094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -4.4740000739693642e-03</internalNodes>
+          <leafValues>
+            -1.0562069416046143e+00 7.3305003345012665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 1.2742500007152557e-01</internalNodes>
+          <leafValues>
+            2.0165599882602692e-01 -1.5467929840087891e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 4.7703001648187637e-02</internalNodes>
+          <leafValues>
+            -3.7937799096107483e-01 3.7885999679565430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 5.3608000278472900e-02</internalNodes>
+          <leafValues>
+            2.1220499277114868e-01 -1.2399710416793823e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -3.9680998772382736e-02</internalNodes>
+          <leafValues>
+            -1.0257550477981567e+00 5.1282998174428940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -6.7327000200748444e-02</internalNodes>
+          <leafValues>
+            -1.0304750204086304e+00 2.3005299270153046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 1.3337600231170654e-01</internalNodes>
+          <leafValues>
+            -2.0869000256061554e-01 1.2272510528564453e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 -2.0919300615787506e-01</internalNodes>
+          <leafValues>
+            8.7929898500442505e-01 -4.4254999607801437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 -6.5589003264904022e-02</internalNodes>
+          <leafValues>
+            1.0443429946899414e+00 -2.1682099997997284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 6.1882998794317245e-02</internalNodes>
+          <leafValues>
+            1.3798199594020844e-01 -1.9009059667587280e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -2.5578999891877174e-02</internalNodes>
+          <leafValues>
+            -1.6607600450515747e+00 5.8439997956156731e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -3.4827001392841339e-02</internalNodes>
+          <leafValues>
+            7.9940402507781982e-01 -8.2406997680664062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -1.8209999427199364e-02</internalNodes>
+          <leafValues>
+            -9.6073997020721436e-01 6.6320002079010010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 1.5070999972522259e-02</internalNodes>
+          <leafValues>
+            1.9899399578571320e-01 -7.6433002948760986e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>72</maxWeakCount>
+      <stageThreshold>-3.8832089900970459e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 251 4.6324998140335083e-02</internalNodes>
+          <leafValues>
+            -1.0362670421600342e+00 8.2201498746871948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 1.5406999737024307e-02</internalNodes>
+          <leafValues>
+            -1.2327589988708496e+00 2.9647698998451233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 1.2808999978005886e-02</internalNodes>
+          <leafValues>
+            -7.5852298736572266e-01 5.7985502481460571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 4.9150999635457993e-02</internalNodes>
+          <leafValues>
+            -3.8983899354934692e-01 8.9680302143096924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 1.2621000409126282e-02</internalNodes>
+          <leafValues>
+            -7.1799302101135254e-01 5.0440901517868042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 -1.8768999725580215e-02</internalNodes>
+          <leafValues>
+            5.5147600173950195e-01 -7.0555400848388672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 4.1965000331401825e-02</internalNodes>
+          <leafValues>
+            -4.4782099127769470e-01 7.0985502004623413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -5.1401998847723007e-02</internalNodes>
+          <leafValues>
+            -1.0932120084762573e+00 2.6701900362968445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -7.0960998535156250e-02</internalNodes>
+          <leafValues>
+            8.3618402481079102e-01 -3.8318100571632385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 1.6745999455451965e-02</internalNodes>
+          <leafValues>
+            -2.5733101367950439e-01 2.5966501235961914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 -6.2400000169873238e-03</internalNodes>
+          <leafValues>
+            3.1631499528884888e-01 -5.8796900510787964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -3.9397999644279480e-02</internalNodes>
+          <leafValues>
+            -1.0491210222244263e+00 1.6822400689125061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 0.</internalNodes>
+          <leafValues>
+            1.6144199669361115e-01 -8.7876898050308228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 -2.2307999432086945e-02</internalNodes>
+          <leafValues>
+            -6.9053500890731812e-01 2.3607000708580017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 1.8919999711215496e-03</internalNodes>
+          <leafValues>
+            2.4989199638366699e-01 -5.6583297252655029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 1.0730000212788582e-03</internalNodes>
+          <leafValues>
+            -5.0415802001953125e-01 3.8374501466751099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 3.9230998605489731e-02</internalNodes>
+          <leafValues>
+            4.2619001120328903e-02 -1.3875889778137207e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 6.2238000333309174e-02</internalNodes>
+          <leafValues>
+            1.4119400084018707e-01 -1.0688860416412354e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 2.1399999968707561e-03</internalNodes>
+          <leafValues>
+            -8.9622402191162109e-01 1.9796399772167206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 9.1800000518560410e-04</internalNodes>
+          <leafValues>
+            -4.5337298512458801e-01 4.3532699346542358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -6.9169998168945312e-03</internalNodes>
+          <leafValues>
+            3.3822798728942871e-01 -4.4793000817298889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 -2.3866999894380569e-02</internalNodes>
+          <leafValues>
+            -7.8908598423004150e-01 2.2511799633502960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 -1.0262800008058548e-01</internalNodes>
+          <leafValues>
+            -2.2831439971923828e+00 -5.3960001096129417e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -9.5239998772740364e-03</internalNodes>
+          <leafValues>
+            3.9346700906753540e-01 -5.2242201566696167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 3.9877001196146011e-02</internalNodes>
+          <leafValues>
+            3.2799001783132553e-02 -1.5079489946365356e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -1.3144999742507935e-02</internalNodes>
+          <leafValues>
+            -1.0839990377426147e+00 1.8482400476932526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -5.0590999424457550e-02</internalNodes>
+          <leafValues>
+            -1.8822289705276489e+00 -2.2199999075382948e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 2.4917000904679298e-02</internalNodes>
+          <leafValues>
+            1.4593400061130524e-01 -2.2196519374847412e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 -7.6370001770555973e-03</internalNodes>
+          <leafValues>
+            -1.0164569616317749e+00 5.8797001838684082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 4.2911998927593231e-02</internalNodes>
+          <leafValues>
+            1.5443000197410583e-01 -1.1843889951705933e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 2.3000000510364771e-04</internalNodes>
+          <leafValues>
+            -7.7305799722671509e-01 1.2189900130033493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 9.0929996222257614e-03</internalNodes>
+          <leafValues>
+            -1.1450099945068359e-01 7.1091300249099731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 1.1145000346004963e-02</internalNodes>
+          <leafValues>
+            7.0000998675823212e-02 -1.0534820556640625e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 -5.2453000098466873e-02</internalNodes>
+          <leafValues>
+            -1.7594360113143921e+00 1.9523799419403076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -2.3020699620246887e-01</internalNodes>
+          <leafValues>
+            9.5840299129486084e-01 -2.5045698881149292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -1.6365999355912209e-02</internalNodes>
+          <leafValues>
+            4.6731901168823242e-01 -2.1108399331569672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -1.7208000645041466e-02</internalNodes>
+          <leafValues>
+            7.0835697650909424e-01 -2.8018298745155334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 -3.6648001521825790e-02</internalNodes>
+          <leafValues>
+            -1.1013339757919312e+00 2.4341100454330444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -1.0304999537765980e-02</internalNodes>
+          <leafValues>
+            -1.0933129787445068e+00 5.6258998811244965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 -1.3713000342249870e-02</internalNodes>
+          <leafValues>
+            -2.6438099145889282e-01 1.9821000099182129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 2.9308000579476357e-02</internalNodes>
+          <leafValues>
+            -2.2142399847507477e-01 1.0525950193405151e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 2.4077000096440315e-02</internalNodes>
+          <leafValues>
+            1.8485699594020844e-01 -1.7203969955444336e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 6.1280000954866409e-03</internalNodes>
+          <leafValues>
+            -9.2721498012542725e-01 5.8752998709678650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -2.2377999499440193e-02</internalNodes>
+          <leafValues>
+            1.9646559953689575e+00 2.7785999700427055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 -7.0440000854432583e-03</internalNodes>
+          <leafValues>
+            2.1427600085735321e-01 -4.8407599329948425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 -4.0603000670671463e-02</internalNodes>
+          <leafValues>
+            -1.1754349470138550e+00 1.6061200201511383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -2.4466000497341156e-02</internalNodes>
+          <leafValues>
+            -1.1239900588989258e+00 4.1110001504421234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 2.5309999473392963e-03</internalNodes>
+          <leafValues>
+            -1.7169700562953949e-01 3.2178801298141479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -1.9588999450206757e-02</internalNodes>
+          <leafValues>
+            8.2720202207565308e-01 -2.6376700401306152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -2.9635999351739883e-02</internalNodes>
+          <leafValues>
+            -1.1524770259857178e+00 1.4999300241470337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 -1.5030000358819962e-02</internalNodes>
+          <leafValues>
+            -1.0491830110549927e+00 4.0160998702049255e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 -6.0715001076459885e-02</internalNodes>
+          <leafValues>
+            -1.0903840065002441e+00 1.5330800414085388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 -1.2790000066161156e-02</internalNodes>
+          <leafValues>
+            4.2248600721359253e-01 -4.2399200797080994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -2.0247999578714371e-02</internalNodes>
+          <leafValues>
+            -9.1866999864578247e-01 1.8485699594020844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 -3.0683999881148338e-02</internalNodes>
+          <leafValues>
+            -1.5958670377731323e+00 2.5760000571608543e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 -2.0718000829219818e-02</internalNodes>
+          <leafValues>
+            -6.6299998760223389e-01 3.1037199497222900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -1.7290000105276704e-03</internalNodes>
+          <leafValues>
+            1.9183400273323059e-01 -6.5084999799728394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 -3.1394001096487045e-02</internalNodes>
+          <leafValues>
+            -6.3643002510070801e-01 1.5408399701118469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 1.9003000110387802e-02</internalNodes>
+          <leafValues>
+            -1.8919399380683899e-01 1.5294510126113892e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 6.1769997701048851e-03</internalNodes>
+          <leafValues>
+            -1.0597900301218033e-01 6.4859598875045776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 -1.0165999643504620e-02</internalNodes>
+          <leafValues>
+            -1.0802700519561768e+00 3.7176001816987991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -1.4169999631121755e-03</internalNodes>
+          <leafValues>
+            3.4157499670982361e-01 -9.7737997770309448e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -4.0799998678267002e-03</internalNodes>
+          <leafValues>
+            4.7624599933624268e-01 -3.4366300702095032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -4.4096998870372772e-02</internalNodes>
+          <leafValues>
+            9.7634297609329224e-01 -1.9173000007867813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -6.0669999569654465e-02</internalNodes>
+          <leafValues>
+            -2.1752851009368896e+00 -2.8925999999046326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -3.2931998372077942e-02</internalNodes>
+          <leafValues>
+            -6.4383101463317871e-01 1.6494099795818329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -1.4722800254821777e-01</internalNodes>
+          <leafValues>
+            -1.4745830297470093e+00 2.5839998852461576e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 -1.1930000036954880e-02</internalNodes>
+          <leafValues>
+            4.2441400885581970e-01 -1.7712600529193878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 1.4517900347709656e-01</internalNodes>
+          <leafValues>
+            2.5444999337196350e-02 -1.2779400348663330e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 5.1447998732328415e-02</internalNodes>
+          <leafValues>
+            1.5678399801254272e-01 -1.5188430547714233e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 3.1479999888688326e-03</internalNodes>
+          <leafValues>
+            -4.0424400568008423e-01 3.2429701089859009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -4.3600000441074371e-02</internalNodes>
+          <leafValues>
+            -1.9932260513305664e+00 1.5018600225448608e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>83</maxWeakCount>
+      <stageThreshold>-3.8424909114837646e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 323 1.2899599969387054e-01</internalNodes>
+          <leafValues>
+            -6.2161999940872192e-01 1.1116520166397095e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -9.1261997818946838e-02</internalNodes>
+          <leafValues>
+            1.0143059492111206e+00 -6.1335200071334839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 1.4271999709308147e-02</internalNodes>
+          <leafValues>
+            -1.0261659622192383e+00 3.9779999852180481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 3.2889999449253082e-02</internalNodes>
+          <leafValues>
+            -1.1386079788208008e+00 2.8690800070762634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 1.2590000405907631e-02</internalNodes>
+          <leafValues>
+            -5.6645601987838745e-01 4.5172399282455444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 1.4661000110208988e-02</internalNodes>
+          <leafValues>
+            3.0505999922752380e-01 -6.8129599094390869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 -3.3555999398231506e-02</internalNodes>
+          <leafValues>
+            -1.7208939790725708e+00 6.1439000070095062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 1.4252699911594391e-01</internalNodes>
+          <leafValues>
+            2.3192200064659119e-01 -1.7297149896621704e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 -6.2079997733235359e-03</internalNodes>
+          <leafValues>
+            -1.2163300514221191e+00 1.2160199880599976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 1.8178999423980713e-02</internalNodes>
+          <leafValues>
+            3.2553699612617493e-01 -8.1003999710083008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 2.5036999955773354e-02</internalNodes>
+          <leafValues>
+            -3.1698799133300781e-01 6.7361402511596680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 4.6560999006032944e-02</internalNodes>
+          <leafValues>
+            -1.1089800298213959e-01 8.4082502126693726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 -8.9999996125698090e-03</internalNodes>
+          <leafValues>
+            3.9574500918388367e-01 -4.7624599933624268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 4.0805999189615250e-02</internalNodes>
+          <leafValues>
+            -1.8000000272877514e-04 9.4570702314376831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 -3.4221999347209930e-02</internalNodes>
+          <leafValues>
+            7.5206297636032104e-01 -3.1531500816345215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -3.9716001600027084e-02</internalNodes>
+          <leafValues>
+            -8.3139598369598389e-01 1.7744399607181549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 2.5170000735670328e-03</internalNodes>
+          <leafValues>
+            -5.9377998113632202e-01 2.4657000601291656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 2.7428999543190002e-02</internalNodes>
+          <leafValues>
+            1.5998399257659912e-01 -4.2781999707221985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 3.4986000508069992e-02</internalNodes>
+          <leafValues>
+            3.5055998712778091e-02 -1.5988600254058838e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 4.4970000162720680e-03</internalNodes>
+          <leafValues>
+            -5.2034300565719604e-01 3.7828299403190613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 2.7699999045580626e-03</internalNodes>
+          <leafValues>
+            -5.3182601928710938e-01 2.4951000511646271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 3.5174001008272171e-02</internalNodes>
+          <leafValues>
+            1.9983400404453278e-01 -1.4446129798889160e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 2.5970999151468277e-02</internalNodes>
+          <leafValues>
+            4.4426999986171722e-02 -1.3622980117797852e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -1.5783999115228653e-02</internalNodes>
+          <leafValues>
+            -9.1020399332046509e-01 2.7190300822257996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -7.5880000367760658e-03</internalNodes>
+          <leafValues>
+            9.2064999043941498e-02 -8.1628900766372681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 2.0754000172019005e-02</internalNodes>
+          <leafValues>
+            2.1185700595378876e-01 -7.4729001522064209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 5.9829000383615494e-02</internalNodes>
+          <leafValues>
+            -2.7301099896430969e-01 8.0923300981521606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 3.9039000868797302e-02</internalNodes>
+          <leafValues>
+            -1.0432299971580505e-01 8.6226201057434082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 2.1665999665856361e-02</internalNodes>
+          <leafValues>
+            6.2709003686904907e-02 -9.8894298076629639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -2.7496999129652977e-02</internalNodes>
+          <leafValues>
+            -9.2690998315811157e-01 1.5586300194263458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 1.0462000034749508e-02</internalNodes>
+          <leafValues>
+            1.3418099284172058e-01 -7.0386397838592529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 2.4870999157428741e-02</internalNodes>
+          <leafValues>
+            1.9706700742244720e-01 -4.0263301134109497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 -1.6036000102758408e-02</internalNodes>
+          <leafValues>
+            -1.1409829854965210e+00 7.3997996747493744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 4.8627000302076340e-02</internalNodes>
+          <leafValues>
+            1.6990399360656738e-01 -7.2152197360992432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 1.2619999470189214e-03</internalNodes>
+          <leafValues>
+            -4.7389799356460571e-01 2.6254999637603760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 -8.8035002350807190e-02</internalNodes>
+          <leafValues>
+            -2.1606519222259521e+00 1.4554800093173981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 1.8356999382376671e-02</internalNodes>
+          <leafValues>
+            4.4750999659299850e-02 -1.0766370296478271e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 3.5275001078844070e-02</internalNodes>
+          <leafValues>
+            -3.2919000834226608e-02 1.2153890132904053e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -2.0392900705337524e-01</internalNodes>
+          <leafValues>
+            -1.3187999725341797e+00 1.5503999777138233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -1.6619000583887100e-02</internalNodes>
+          <leafValues>
+            3.6850199103355408e-01 -1.5283699333667755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 3.7739001214504242e-02</internalNodes>
+          <leafValues>
+            -2.5727799534797668e-01 7.0655298233032227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 2.2720000706613064e-03</internalNodes>
+          <leafValues>
+            -7.7602997422218323e-02 3.3367800712585449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 -1.4802999794483185e-02</internalNodes>
+          <leafValues>
+            -7.8524798154830933e-01 7.6934002339839935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -4.8319000750780106e-02</internalNodes>
+          <leafValues>
+            1.7022320032119751e+00 4.9722000956535339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -2.9539000242948532e-02</internalNodes>
+          <leafValues>
+            7.7670699357986450e-01 -2.4534299969673157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -4.6169001609086990e-02</internalNodes>
+          <leafValues>
+            -1.4922779798507690e+00 1.2340000271797180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 -2.8064999729394913e-02</internalNodes>
+          <leafValues>
+            -2.1345369815826416e+00 -2.5797000154852867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 -5.7339998893439770e-03</internalNodes>
+          <leafValues>
+            5.6982600688934326e-01 -1.2056600302457809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 -1.0111000388860703e-02</internalNodes>
+          <leafValues>
+            6.7911398410797119e-01 -2.6638001203536987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 1.1359999887645245e-02</internalNodes>
+          <leafValues>
+            2.4789799749851227e-01 -6.4493000507354736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 5.1809001713991165e-02</internalNodes>
+          <leafValues>
+            1.4716000296175480e-02 -1.2395579814910889e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 3.3291999250650406e-02</internalNodes>
+          <leafValues>
+            -8.2559995353221893e-03 1.0168470144271851e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -1.4494000002741814e-02</internalNodes>
+          <leafValues>
+            4.5066800713539124e-01 -3.6250999569892883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -3.4221999347209930e-02</internalNodes>
+          <leafValues>
+            -9.5292502641677856e-01 2.0684599876403809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -8.0654002726078033e-02</internalNodes>
+          <leafValues>
+            -2.0139501094818115e+00 -2.3084999993443489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 -8.9399999706074595e-04</internalNodes>
+          <leafValues>
+            3.9572000503540039e-01 -2.9351300001144409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 9.7162000834941864e-02</internalNodes>
+          <leafValues>
+            -2.4980300664901733e-01 1.0859220027923584e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 3.6614000797271729e-02</internalNodes>
+          <leafValues>
+            -5.7844001799821854e-02 1.2162159681320190e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 5.1693998277187347e-02</internalNodes>
+          <leafValues>
+            4.3062999844551086e-02 -1.0636160373687744e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -2.4557000026106834e-02</internalNodes>
+          <leafValues>
+            -4.8946800827980042e-01 1.7182900011539459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 3.2736799120903015e-01</internalNodes>
+          <leafValues>
+            -2.9688599705696106e-01 5.1798301935195923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 7.6959999278187752e-03</internalNodes>
+          <leafValues>
+            -5.9805899858474731e-01 2.4803200364112854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 1.6172200441360474e-01</internalNodes>
+          <leafValues>
+            -2.9613999649882317e-02 -2.3162529468536377e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 -4.7889999113976955e-03</internalNodes>
+          <leafValues>
+            3.7457901239395142e-01 -3.2779198884963989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -1.8402999266982079e-02</internalNodes>
+          <leafValues>
+            -9.9692702293395996e-01 7.2948001325130463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 7.7665001153945923e-02</internalNodes>
+          <leafValues>
+            1.4175699651241302e-01 -1.7238730192184448e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 1.8921000882983208e-02</internalNodes>
+          <leafValues>
+            -2.1273100376129150e-01 1.0165189504623413e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -7.9397998750209808e-02</internalNodes>
+          <leafValues>
+            -1.3164349794387817e+00 1.4981999993324280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -6.8037003278732300e-02</internalNodes>
+          <leafValues>
+            4.9421998858451843e-01 -2.9091000556945801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 -6.1010001227259636e-03</internalNodes>
+          <leafValues>
+            4.2430499196052551e-01 -3.3899301290512085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 3.1927000731229782e-02</internalNodes>
+          <leafValues>
+            -3.1046999618411064e-02 -2.3459999561309814e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -2.9843999072909355e-02</internalNodes>
+          <leafValues>
+            -7.8989601135253906e-01 1.5417699515819550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -8.0541998147964478e-02</internalNodes>
+          <leafValues>
+            -2.2509229183197021e+00 -3.0906999483704567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 3.8109999150037766e-03</internalNodes>
+          <leafValues>
+            -2.5577300786972046e-01 2.3785500228404999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 3.3647000789642334e-02</internalNodes>
+          <leafValues>
+            -2.2541399300098419e-01 9.2307400703430176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 8.2809999585151672e-03</internalNodes>
+          <leafValues>
+            -2.8896200656890869e-01 3.1046199798583984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 1.0104399919509888e-01</internalNodes>
+          <leafValues>
+            -3.4864000976085663e-02 -2.7102620601654053e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -1.0009000077843666e-02</internalNodes>
+          <leafValues>
+            5.9715402126312256e-01 -3.3831000328063965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 7.1919998154044151e-03</internalNodes>
+          <leafValues>
+            -4.7738000750541687e-01 2.2686000168323517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 2.4969000369310379e-02</internalNodes>
+          <leafValues>
+            2.2877700626850128e-01 -1.0435529947280884e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 2.7908000349998474e-01</internalNodes>
+          <leafValues>
+            -2.5818100571632385e-01 7.6780498027801514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -4.4213000684976578e-02</internalNodes>
+          <leafValues>
+            -5.9798002243041992e-01 2.8039899468421936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 -1.4136999845504761e-02</internalNodes>
+          <leafValues>
+            7.0987302064895630e-01 -2.5645199418067932e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>91</maxWeakCount>
+      <stageThreshold>-3.6478610038757324e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 406 1.3771200180053711e-01</internalNodes>
+          <leafValues>
+            -5.5870598554611206e-01 1.0953769683837891e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 3.4460999071598053e-02</internalNodes>
+          <leafValues>
+            -7.1171897649765015e-01 5.2899599075317383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 1.8580000847578049e-02</internalNodes>
+          <leafValues>
+            -1.1157519817352295e+00 4.0593999624252319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 2.5041999295353889e-02</internalNodes>
+          <leafValues>
+            -4.0892499685287476e-01 7.4129998683929443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 5.7179000228643417e-02</internalNodes>
+          <leafValues>
+            -3.8054299354553223e-01 7.3647701740264893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 1.4932000078260899e-02</internalNodes>
+          <leafValues>
+            -6.9945502281188965e-01 3.7950998544692993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 8.8900001719594002e-03</internalNodes>
+          <leafValues>
+            -5.4558598995208740e-01 3.6332499980926514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 3.0435999855399132e-02</internalNodes>
+          <leafValues>
+            -1.0124599933624268e-01 7.9585897922515869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -4.4160000979900360e-02</internalNodes>
+          <leafValues>
+            8.4410899877548218e-01 -3.2976400852203369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 1.8461000174283981e-02</internalNodes>
+          <leafValues>
+            2.6326599717140198e-01 -9.6736502647399902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 1.0614999569952488e-02</internalNodes>
+          <leafValues>
+            1.5251900255680084e-01 -1.0589870214462280e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 -4.5974001288414001e-02</internalNodes>
+          <leafValues>
+            -1.9918340444564819e+00 1.3629099726676941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 8.2900002598762512e-02</internalNodes>
+          <leafValues>
+            -3.2037198543548584e-01 6.0304200649261475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 -8.9130001142621040e-03</internalNodes>
+          <leafValues>
+            5.9586602449417114e-01 -2.1139599382877350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 4.2814001441001892e-02</internalNodes>
+          <leafValues>
+            2.2925000637769699e-02 -1.4679330587387085e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -8.7139997631311417e-03</internalNodes>
+          <leafValues>
+            -4.3989500403404236e-01 2.0439699292182922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -4.3390002101659775e-03</internalNodes>
+          <leafValues>
+            -8.9066797494888306e-01 1.0469999909400940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 8.0749997869133949e-03</internalNodes>
+          <leafValues>
+            2.1164199709892273e-01 -4.0231600403785706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 9.6739001572132111e-02</internalNodes>
+          <leafValues>
+            1.3319999910891056e-02 -1.6085360050201416e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 -3.0536999925971031e-02</internalNodes>
+          <leafValues>
+            1.0063740015029907e+00 -1.3413299620151520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 -6.0855999588966370e-02</internalNodes>
+          <leafValues>
+            -1.4689979553222656e+00 9.4240000471472740e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -3.8162000477313995e-02</internalNodes>
+          <leafValues>
+            -8.1636399030685425e-01 2.6171201467514038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 -9.6960002556443214e-03</internalNodes>
+          <leafValues>
+            1.1561699956655502e-01 -7.1693199872970581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 4.8902999609708786e-02</internalNodes>
+          <leafValues>
+            1.3050499558448792e-01 -1.6448370218276978e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -4.1611999273300171e-02</internalNodes>
+          <leafValues>
+            -1.1795840263366699e+00 2.5017000734806061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 -2.0188000053167343e-02</internalNodes>
+          <leafValues>
+            6.3188201189041138e-01 -1.0490400344133377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 -9.7900000400841236e-04</internalNodes>
+          <leafValues>
+            1.8507799506187439e-01 -5.3565901517868042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -3.3622000366449356e-02</internalNodes>
+          <leafValues>
+            -9.3127602338790894e-01 2.0071500539779663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 1.9455999135971069e-02</internalNodes>
+          <leafValues>
+            3.8029000163078308e-02 -1.0112210512161255e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 -3.1800000579096377e-04</internalNodes>
+          <leafValues>
+            3.6457699537277222e-01 -2.7610900998115540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -3.8899999344721437e-04</internalNodes>
+          <leafValues>
+            1.9665899872779846e-01 -5.3410500288009644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -9.3496002256870270e-02</internalNodes>
+          <leafValues>
+            -1.6772350072860718e+00 2.0727099478244781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 -7.7877998352050781e-02</internalNodes>
+          <leafValues>
+            -3.0760629177093506e+00 -3.5803999751806259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 1.6947999596595764e-02</internalNodes>
+          <leafValues>
+            2.1447399258613586e-01 -7.1376299858093262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 -2.1459000185132027e-02</internalNodes>
+          <leafValues>
+            -1.1468060016632080e+00 1.5855999663472176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 -1.2865999713540077e-02</internalNodes>
+          <leafValues>
+            8.3812397718429565e-01 -6.5944001078605652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 7.8220004215836525e-03</internalNodes>
+          <leafValues>
+            -2.8026801347732544e-01 7.9376900196075439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 1.0294400155544281e-01</internalNodes>
+          <leafValues>
+            1.7832300066947937e-01 -6.8412202596664429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -3.7487998604774475e-02</internalNodes>
+          <leafValues>
+            9.6189999580383301e-01 -2.1735599637031555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 2.5505999103188515e-02</internalNodes>
+          <leafValues>
+            1.0103999637067318e-02 1.2461110353469849e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 6.6700001480057836e-04</internalNodes>
+          <leafValues>
+            -5.3488200902938843e-01 1.4746299386024475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -2.8867900371551514e-01</internalNodes>
+          <leafValues>
+            8.2172799110412598e-01 -1.4948000200092793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 9.1294996440410614e-02</internalNodes>
+          <leafValues>
+            -1.9605399668216705e-01 1.0803170204162598e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 1.2056600302457809e-01</internalNodes>
+          <leafValues>
+            -2.3848999291658401e-02 1.1392610073089600e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -7.3775000870227814e-02</internalNodes>
+          <leafValues>
+            -1.3583840131759644e+00 -4.2039998807013035e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 -3.3128000795841217e-02</internalNodes>
+          <leafValues>
+            -6.4483201503753662e-01 2.4142199754714966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 -4.3937001377344131e-02</internalNodes>
+          <leafValues>
+            8.4285402297973633e-01 -2.0624800026416779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 1.8110199272632599e-01</internalNodes>
+          <leafValues>
+            1.9212099909782410e-01 -1.2222139835357666e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -1.1850999668240547e-02</internalNodes>
+          <leafValues>
+            -7.2677397727966309e-01 5.2687998861074448e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 4.5920000411570072e-03</internalNodes>
+          <leafValues>
+            -3.6305201053619385e-01 2.9223799705505371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 7.0620002225041389e-03</internalNodes>
+          <leafValues>
+            5.8116000145673752e-02 -6.7161601781845093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -2.3715000599622726e-02</internalNodes>
+          <leafValues>
+            4.7142100334167480e-01 1.8580000847578049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 -6.7171998322010040e-02</internalNodes>
+          <leafValues>
+            -1.1331889629364014e+00 2.3780999705195427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 -6.5310001373291016e-02</internalNodes>
+          <leafValues>
+            9.8253500461578369e-01 2.8362000361084938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 2.2791000083088875e-02</internalNodes>
+          <leafValues>
+            -2.8213700652122498e-01 5.8993399143218994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 -1.9037999212741852e-02</internalNodes>
+          <leafValues>
+            -6.3711500167846680e-01 2.6514598727226257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -6.8689999170601368e-03</internalNodes>
+          <leafValues>
+            3.7487301230430603e-01 -3.3232098817825317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -4.0146000683307648e-02</internalNodes>
+          <leafValues>
+            -1.3048729896545410e+00 1.5724299848079681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -4.0530998259782791e-02</internalNodes>
+          <leafValues>
+            -2.0458049774169922e+00 -2.6925999671220779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.2253999710083008e-02</internalNodes>
+          <leafValues>
+            7.7649402618408203e-01 -4.2971000075340271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -2.7219999581575394e-02</internalNodes>
+          <leafValues>
+            1.7424400150775909e-01 -4.4600901007652283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -8.8366001844406128e-02</internalNodes>
+          <leafValues>
+            -1.5036419630050659e+00 1.4289900660514832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -7.9159997403621674e-03</internalNodes>
+          <leafValues>
+            2.8666698932647705e-01 -3.7923699617385864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -4.1960000991821289e-02</internalNodes>
+          <leafValues>
+            1.3846950531005859e+00 6.5026998519897461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 4.5662999153137207e-02</internalNodes>
+          <leafValues>
+            -2.2452299296855927e-01 7.9521000385284424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 -1.4090600609779358e-01</internalNodes>
+          <leafValues>
+            -1.5879319906234741e+00 1.1359000205993652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 -5.9216000139713287e-02</internalNodes>
+          <leafValues>
+            -1.1945960521697998e+00 -7.1640000678598881e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 4.3390002101659775e-03</internalNodes>
+          <leafValues>
+            -1.5528699755668640e-01 4.0664499998092651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -2.0369999110698700e-03</internalNodes>
+          <leafValues>
+            2.5927901268005371e-01 -3.8368299603462219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 2.7516499161720276e-01</internalNodes>
+          <leafValues>
+            -8.8497996330261230e-02 7.6787501573562622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 -2.6601999998092651e-02</internalNodes>
+          <leafValues>
+            7.5024497509002686e-01 -2.2621999680995941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 4.0906000882387161e-02</internalNodes>
+          <leafValues>
+            1.2158600240945816e-01 -1.4566910266876221e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 5.5320002138614655e-03</internalNodes>
+          <leafValues>
+            -3.6611500382423401e-01 2.5968599319458008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 3.1879000365734100e-02</internalNodes>
+          <leafValues>
+            -7.5019001960754395e-02 4.8484799265861511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 -4.1482001543045044e-02</internalNodes>
+          <leafValues>
+            7.8220397233963013e-01 -2.1992200613021851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -9.6130996942520142e-02</internalNodes>
+          <leafValues>
+            -8.9456301927566528e-01 1.4680700004100800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -1.1568999849259853e-02</internalNodes>
+          <leafValues>
+            8.2714098691940308e-01 -2.0275600254535675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 1.8312999978661537e-02</internalNodes>
+          <leafValues>
+            1.6367999836802483e-02 2.7306801080703735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 -3.4166000783443451e-02</internalNodes>
+          <leafValues>
+            1.1307320594787598e+00 -1.8810899555683136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 -2.4476999416947365e-02</internalNodes>
+          <leafValues>
+            -5.7791298627853394e-01 1.5812499821186066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 4.8957001417875290e-02</internalNodes>
+          <leafValues>
+            -2.2564999759197235e-02 -1.6373280286788940e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -2.0702999085187912e-02</internalNodes>
+          <leafValues>
+            -5.4512101411819458e-01 2.4086999893188477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -2.3002000525593758e-02</internalNodes>
+          <leafValues>
+            -1.2236540317535400e+00 -7.3440000414848328e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 6.4585000276565552e-02</internalNodes>
+          <leafValues>
+            1.4695599675178528e-01 -4.4967499375343323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 1.2666000053286552e-02</internalNodes>
+          <leafValues>
+            -2.7873900532722473e-01 4.3876600265502930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -1.2002999894320965e-02</internalNodes>
+          <leafValues>
+            -2.4289099872112274e-01 2.5350099802017212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -2.6443999260663986e-02</internalNodes>
+          <leafValues>
+            -8.5864800214767456e-01 2.6025999337434769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -2.5547999888658524e-02</internalNodes>
+          <leafValues>
+            6.9287902116775513e-01 -2.1160000469535589e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 3.9115000516176224e-02</internalNodes>
+          <leafValues>
+            -1.6589100658893585e-01 1.5209139585494995e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 -6.0330000706017017e-03</internalNodes>
+          <leafValues>
+            4.3856900930404663e-01 -2.1613700687885284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -3.3936999738216400e-02</internalNodes>
+          <leafValues>
+            -9.7998398542404175e-01 2.2133000195026398e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>99</maxWeakCount>
+      <stageThreshold>-3.8700489997863770e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 497 4.0672998875379562e-02</internalNodes>
+          <leafValues>
+            -9.0474700927734375e-01 6.4410597085952759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 2.5609999895095825e-02</internalNodes>
+          <leafValues>
+            -7.9216998815536499e-01 5.7489997148513794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 1.9959500432014465e-01</internalNodes>
+          <leafValues>
+            -3.0099600553512573e-01 1.3143850564956665e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 1.2404999695718288e-02</internalNodes>
+          <leafValues>
+            -8.9882999658584595e-01 2.9205799102783203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 3.9207998663187027e-02</internalNodes>
+          <leafValues>
+            -4.1955199837684631e-01 5.3463298082351685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -3.0843999236822128e-02</internalNodes>
+          <leafValues>
+            4.5793399214744568e-01 -4.4629099965095520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -3.5523001104593277e-02</internalNodes>
+          <leafValues>
+            9.1310501098632812e-01 -2.7373200654983521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 -6.1650000512599945e-02</internalNodes>
+          <leafValues>
+            -1.4697799682617188e+00 2.0364099740982056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -1.1739999987185001e-02</internalNodes>
+          <leafValues>
+            -1.0482879877090454e+00 6.7801997065544128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 6.6933996975421906e-02</internalNodes>
+          <leafValues>
+            2.9274499416351318e-01 -5.2282899618148804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -2.0631000399589539e-02</internalNodes>
+          <leafValues>
+            -1.2855139970779419e+00 4.4550999999046326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -2.2357000038027763e-02</internalNodes>
+          <leafValues>
+            -8.5753798484802246e-01 1.8434000015258789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 1.1500000255182385e-03</internalNodes>
+          <leafValues>
+            1.6405500471591949e-01 -6.9125002622604370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 3.5872999578714371e-02</internalNodes>
+          <leafValues>
+            1.5756499767303467e-01 -8.4262597560882568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 3.0659999698400497e-02</internalNodes>
+          <leafValues>
+            2.1637000143527985e-02 -1.3634690046310425e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 5.5559999309480190e-03</internalNodes>
+          <leafValues>
+            -1.6737000644207001e-01 2.5888401269912720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 -6.1160000041127205e-03</internalNodes>
+          <leafValues>
+            -9.7271800041198730e-01 6.6100001335144043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -3.0316999182105064e-02</internalNodes>
+          <leafValues>
+            9.8474198579788208e-01 -1.6448000445961952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -9.7200004383921623e-03</internalNodes>
+          <leafValues>
+            4.7604700922966003e-01 -3.2516700029373169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 -5.7126998901367188e-02</internalNodes>
+          <leafValues>
+            -9.5920699834823608e-01 1.9938200712203979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 4.0059997700154781e-03</internalNodes>
+          <leafValues>
+            -5.2612501382827759e-01 2.2428700327873230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 3.3734001219272614e-02</internalNodes>
+          <leafValues>
+            1.7070099711418152e-01 -1.0737580060958862e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -3.4641999751329422e-02</internalNodes>
+          <leafValues>
+            -1.1343129873275757e+00 3.6540001630783081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 4.6923000365495682e-02</internalNodes>
+          <leafValues>
+            2.5832301378250122e-01 -7.1535801887512207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 -8.7660001590847969e-03</internalNodes>
+          <leafValues>
+            1.9640900194644928e-01 -5.3355097770690918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 6.5627999603748322e-02</internalNodes>
+          <leafValues>
+            -5.1194999366998672e-02 9.7610700130462646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 -4.4165000319480896e-02</internalNodes>
+          <leafValues>
+            1.0631920099258423e+00 -2.3462599515914917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 1.7304999753832817e-02</internalNodes>
+          <leafValues>
+            -1.8582899868488312e-01 4.5889899134635925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 3.3135998994112015e-02</internalNodes>
+          <leafValues>
+            -2.9381999745965004e-02 -2.6651329994201660e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -2.1029999479651451e-02</internalNodes>
+          <leafValues>
+            9.9979901313781738e-01 2.4937000125646591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 2.9783999547362328e-02</internalNodes>
+          <leafValues>
+            -2.9605999588966370e-02 -2.1695868968963623e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 5.5291999131441116e-02</internalNodes>
+          <leafValues>
+            -7.5599999399855733e-04 7.4651998281478882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 -3.3597998321056366e-02</internalNodes>
+          <leafValues>
+            -1.5274159908294678e+00 1.1060000397264957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 1.9602999091148376e-02</internalNodes>
+          <leafValues>
+            3.3574998378753662e-02 9.9526202678680420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 -2.0787000656127930e-02</internalNodes>
+          <leafValues>
+            7.6612901687622070e-01 -2.4670800566673279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 3.2536000013351440e-02</internalNodes>
+          <leafValues>
+            1.6263400018215179e-01 -6.1134302616119385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 -1.0788000188767910e-02</internalNodes>
+          <leafValues>
+            -9.7839701175689697e-01 2.8969999402761459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -9.9560003727674484e-03</internalNodes>
+          <leafValues>
+            4.6145799756050110e-01 -1.3510499894618988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -3.7489999085664749e-03</internalNodes>
+          <leafValues>
+            2.5458198785781860e-01 -5.1955598592758179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 -4.1779998689889908e-02</internalNodes>
+          <leafValues>
+            -8.0565100908279419e-01 1.5208500623703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -3.4221000969409943e-02</internalNodes>
+          <leafValues>
+            -1.3137799501419067e+00 -3.5800000187009573e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 1.0130000300705433e-02</internalNodes>
+          <leafValues>
+            2.0175799727439880e-01 -6.1339598894119263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -8.9849002659320831e-02</internalNodes>
+          <leafValues>
+            9.7632801532745361e-01 -2.0884799957275391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 2.6097999885678291e-02</internalNodes>
+          <leafValues>
+            -1.8807999789714813e-01 4.7705799341201782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -3.7539999466389418e-03</internalNodes>
+          <leafValues>
+            -6.7980402708053589e-01 1.1288800090551376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 3.1973000615835190e-02</internalNodes>
+          <leafValues>
+            1.8951700627803802e-01 -1.4967479705810547e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 1.9332999363541603e-02</internalNodes>
+          <leafValues>
+            -2.3609900474548340e-01 8.1320500373840332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 1.9490000559017062e-03</internalNodes>
+          <leafValues>
+            2.4830399453639984e-01 -6.9211997091770172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -4.4146999716758728e-02</internalNodes>
+          <leafValues>
+            -1.0418920516967773e+00 4.8053000122308731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 -4.4681999832391739e-02</internalNodes>
+          <leafValues>
+            5.1346302032470703e-01 -7.3799998499453068e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -1.0757499933242798e-01</internalNodes>
+          <leafValues>
+            1.6202019453048706e+00 -1.8667599558830261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 -1.2846800684928894e-01</internalNodes>
+          <leafValues>
+            2.9869480133056641e+00 9.5427997410297394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -4.4757999479770660e-02</internalNodes>
+          <leafValues>
+            6.0405302047729492e-01 -2.7058699727058411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 -4.3990999460220337e-02</internalNodes>
+          <leafValues>
+            -6.1790502071380615e-01 1.5997199714183807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -1.2268999963998795e-01</internalNodes>
+          <leafValues>
+            6.6327202320098877e-01 -2.3636999726295471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 -1.9982999190688133e-02</internalNodes>
+          <leafValues>
+            -1.1228660345077515e+00 1.9616700708866119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -1.5527999959886074e-02</internalNodes>
+          <leafValues>
+            -1.0770269632339478e+00 2.0693000406026840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -4.8971001058816910e-02</internalNodes>
+          <leafValues>
+            8.1168299913406372e-01 -1.7252000048756599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 5.5975999683141708e-02</internalNodes>
+          <leafValues>
+            -2.2529000416398048e-02 -1.7356760501861572e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -9.8580000922083855e-03</internalNodes>
+          <leafValues>
+            6.7881399393081665e-01 -5.8180000633001328e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 1.3481000438332558e-02</internalNodes>
+          <leafValues>
+            5.7847999036312103e-02 -7.7255302667617798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 6.5609999001026154e-03</internalNodes>
+          <leafValues>
+            -1.3146899640560150e-01 6.7055797576904297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 7.1149999275803566e-03</internalNodes>
+          <leafValues>
+            -3.7880599498748779e-01 3.0978998541831970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 4.8159998841583729e-03</internalNodes>
+          <leafValues>
+            -5.8470398187637329e-01 2.5602099299430847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 9.5319999381899834e-03</internalNodes>
+          <leafValues>
+            -3.0217000842094421e-01 4.1253298521041870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 -2.7474999427795410e-02</internalNodes>
+          <leafValues>
+            5.9154701232910156e-01 1.7963999882340431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 -3.9519999176263809e-02</internalNodes>
+          <leafValues>
+            9.6913498640060425e-01 -2.1020300686359406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 -3.0658999457955360e-02</internalNodes>
+          <leafValues>
+            9.1155898571014404e-01 4.0550000965595245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -1.4680000022053719e-03</internalNodes>
+          <leafValues>
+            -6.0489797592163086e-01 1.6960899531841278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 1.9077600538730621e-01</internalNodes>
+          <leafValues>
+            4.3515000492334366e-02 8.1892901659011841e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 5.1790000870823860e-03</internalNodes>
+          <leafValues>
+            -9.3617302179336548e-01 2.4937000125646591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 2.4126000702381134e-02</internalNodes>
+          <leafValues>
+            1.8175500631332397e-01 -3.4185901284217834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 -2.6383999735116959e-02</internalNodes>
+          <leafValues>
+            -1.2912579774856567e+00 -3.4280000254511833e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 5.4139997810125351e-03</internalNodes>
+          <leafValues>
+            -4.6291999518871307e-02 2.5269600749015808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 5.4216001182794571e-02</internalNodes>
+          <leafValues>
+            -1.2848000042140484e-02 -1.4304540157318115e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 2.3799999326001853e-04</internalNodes>
+          <leafValues>
+            -2.6676699519157410e-01 3.3588299155235291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 1.5216999687254429e-02</internalNodes>
+          <leafValues>
+            -5.1367300748825073e-01 1.3005100190639496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 1.7007999122142792e-02</internalNodes>
+          <leafValues>
+            4.1575899720191956e-01 -3.1241199374198914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 3.0496999621391296e-02</internalNodes>
+          <leafValues>
+            -2.4820999801158905e-01 7.0828497409820557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 6.5430002287030220e-03</internalNodes>
+          <leafValues>
+            -2.2637000679969788e-01 1.9184599816799164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 1.4163999259471893e-01</internalNodes>
+          <leafValues>
+            6.5227001905441284e-02 -8.8809502124786377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 1.9338000565767288e-02</internalNodes>
+          <leafValues>
+            1.8891200423240662e-01 -2.7397701144218445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -1.7324000597000122e-02</internalNodes>
+          <leafValues>
+            -9.4866698980331421e-01 2.4196999147534370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 -6.2069999985396862e-03</internalNodes>
+          <leafValues>
+            3.6938399076461792e-01 -1.7494900524616241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -1.6109000891447067e-02</internalNodes>
+          <leafValues>
+            9.6159499883651733e-01 -2.0005300641059875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -1.0122500360012054e-01</internalNodes>
+          <leafValues>
+            -3.0699110031127930e+00 1.1363799870014191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -7.5509999878704548e-03</internalNodes>
+          <leafValues>
+            2.2921000421047211e-01 -4.5645099878311157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 4.4247999787330627e-02</internalNodes>
+          <leafValues>
+            -3.1599999056197703e-04 3.9225301146507263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -1.1636000126600266e-01</internalNodes>
+          <leafValues>
+            9.5233702659606934e-01 -2.0201599597930908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 4.7360002063214779e-03</internalNodes>
+          <leafValues>
+            -9.9177002906799316e-02 2.0370499789714813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 2.2459000349044800e-02</internalNodes>
+          <leafValues>
+            8.7280003353953362e-03 -1.0217070579528809e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -1.2109000235795975e-02</internalNodes>
+          <leafValues>
+            6.4812600612640381e-01 -9.0149000287055969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 5.6120000779628754e-02</internalNodes>
+          <leafValues>
+            -3.6759998649358749e-02 -1.9275590181350708e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 -8.7379999458789825e-03</internalNodes>
+          <leafValues>
+            6.9261300563812256e-01 -6.8374998867511749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 6.6399998031556606e-03</internalNodes>
+          <leafValues>
+            -4.0569800138473511e-01 1.8625700473785400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 -1.8131999298930168e-02</internalNodes>
+          <leafValues>
+            -6.4518201351165771e-01 2.1976399421691895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -2.2718999534845352e-02</internalNodes>
+          <leafValues>
+            9.7776198387145996e-01 -1.8654300272464752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 1.2705000117421150e-02</internalNodes>
+          <leafValues>
+            -1.0546600073575974e-01 3.7404099106788635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 -1.3682999648153782e-02</internalNodes>
+          <leafValues>
+            6.1064100265502930e-01 -2.6881098747253418e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>115</maxWeakCount>
+      <stageThreshold>-3.7160909175872803e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 596 3.1357999891042709e-02</internalNodes>
+          <leafValues>
+            -1.0183910131454468e+00 5.7528597116470337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 9.3050003051757812e-02</internalNodes>
+          <leafValues>
+            -4.1297501325607300e-01 1.0091199874877930e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 2.5949999690055847e-02</internalNodes>
+          <leafValues>
+            -5.8587902784347534e-01 5.6606197357177734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 1.6472000628709793e-02</internalNodes>
+          <leafValues>
+            -9.2857497930526733e-01 3.0924499034881592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -1.8779999809339643e-03</internalNodes>
+          <leafValues>
+            1.1951000243425369e-01 -1.1180130243301392e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -9.0129999443888664e-03</internalNodes>
+          <leafValues>
+            -5.7849502563476562e-01 3.3154401183128357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 2.2547999396920204e-02</internalNodes>
+          <leafValues>
+            -3.8325101137161255e-01 5.2462202310562134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 -3.7780001759529114e-02</internalNodes>
+          <leafValues>
+            1.1790670156478882e+00 -3.4166999161243439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -5.3799999877810478e-03</internalNodes>
+          <leafValues>
+            -8.6265897750854492e-01 1.1867900192737579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -2.3893000558018684e-02</internalNodes>
+          <leafValues>
+            -7.4950599670410156e-01 2.1011400222778320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -2.6521999388933182e-02</internalNodes>
+          <leafValues>
+            9.2128598690032959e-01 -2.8252801299095154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 1.2280000373721123e-02</internalNodes>
+          <leafValues>
+            2.6662799715995789e-01 -7.0013600587844849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 9.6594996750354767e-02</internalNodes>
+          <leafValues>
+            -2.8453999757766724e-01 7.3168998956680298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 -2.7414999902248383e-02</internalNodes>
+          <leafValues>
+            -6.1492699384689331e-01 1.5576200187206268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -1.5767000615596771e-02</internalNodes>
+          <leafValues>
+            5.7551199197769165e-01 -3.4362199902534485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 -2.1100000012665987e-03</internalNodes>
+          <leafValues>
+            3.2599699497222900e-01 -1.3008299469947815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 1.2006999924778938e-02</internalNodes>
+          <leafValues>
+            8.9322999119758606e-02 -9.6025598049163818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -1.5421999618411064e-02</internalNodes>
+          <leafValues>
+            3.4449499845504761e-01 -4.6711999177932739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 -4.1579999960958958e-03</internalNodes>
+          <leafValues>
+            2.3696300387382507e-01 -5.2563297748565674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -2.1185999736189842e-02</internalNodes>
+          <leafValues>
+            -7.4267697334289551e-01 2.1702000498771667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -1.7077000811696053e-02</internalNodes>
+          <leafValues>
+            -9.0471798181533813e-01 6.6012002527713776e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -4.0849998593330383e-02</internalNodes>
+          <leafValues>
+            -3.4446600079536438e-01 2.1503700315952301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -8.1930002197623253e-03</internalNodes>
+          <leafValues>
+            -9.3388599157333374e-01 5.0471000373363495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 -1.9238000735640526e-02</internalNodes>
+          <leafValues>
+            -5.3203701972961426e-01 1.7240600287914276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -4.4192001223564148e-02</internalNodes>
+          <leafValues>
+            9.2075002193450928e-01 -2.2148500382900238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 -6.2392000108957291e-02</internalNodes>
+          <leafValues>
+            -7.1053802967071533e-01 1.8323899805545807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 -1.0079999919980764e-03</internalNodes>
+          <leafValues>
+            -8.7063097953796387e-01 5.5330000817775726e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 2.3870000615715981e-02</internalNodes>
+          <leafValues>
+            -2.2854200005531311e-01 5.2415597438812256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 2.1391000598669052e-02</internalNodes>
+          <leafValues>
+            -3.0325898528099060e-01 5.5860602855682373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 2.0254999399185181e-02</internalNodes>
+          <leafValues>
+            2.6901501417160034e-01 -7.0261800289154053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -2.8772000223398209e-02</internalNodes>
+          <leafValues>
+            -1.1835030317306519e+00 4.6512000262737274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 3.4199999645352364e-03</internalNodes>
+          <leafValues>
+            -5.4652100801467896e-01 2.5962498784065247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 5.6983001530170441e-02</internalNodes>
+          <leafValues>
+            -2.6982900500297546e-01 5.8170700073242188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 -9.3892000615596771e-02</internalNodes>
+          <leafValues>
+            -9.1046398878097534e-01 1.9677700102329254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 1.7699999734759331e-02</internalNodes>
+          <leafValues>
+            -4.4003298878669739e-01 2.1349500119686127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 2.2844199836254120e-01</internalNodes>
+          <leafValues>
+            2.3605000227689743e-02 7.7171599864959717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -1.8287500739097595e-01</internalNodes>
+          <leafValues>
+            7.9228597879409790e-01 -2.4644799530506134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 -6.9891996681690216e-02</internalNodes>
+          <leafValues>
+            8.0267798900604248e-01 -3.6072000861167908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 1.5297000296413898e-02</internalNodes>
+          <leafValues>
+            -2.0072300732135773e-01 1.1030600070953369e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 6.7500001750886440e-03</internalNodes>
+          <leafValues>
+            -4.5967999845743179e-02 7.2094500064849854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -1.5983000397682190e-02</internalNodes>
+          <leafValues>
+            -9.0357202291488647e-01 4.4987998902797699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 1.3088000006973743e-02</internalNodes>
+          <leafValues>
+            3.5297098755836487e-01 -3.7710601091384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 1.3061000034213066e-02</internalNodes>
+          <leafValues>
+            -1.9583599269390106e-01 1.1198940277099609e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -3.9907000958919525e-02</internalNodes>
+          <leafValues>
+            -1.3998429775238037e+00 1.9145099818706512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 1.5026999637484550e-02</internalNodes>
+          <leafValues>
+            2.3600000422447920e-03 -1.1611249446868896e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 -2.0517999306321144e-02</internalNodes>
+          <leafValues>
+            -4.8908099532127380e-01 1.6743400692939758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -2.2359000518918037e-02</internalNodes>
+          <leafValues>
+            -1.2202980518341064e+00 -1.1975999921560287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -7.9150004312396049e-03</internalNodes>
+          <leafValues>
+            3.7228098511695862e-01 -8.5063003003597260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 1.5258000232279301e-02</internalNodes>
+          <leafValues>
+            -2.9412600398063660e-01 5.9406399726867676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -3.1665999442338943e-02</internalNodes>
+          <leafValues>
+            -1.4395569562911987e+00 1.3578799366950989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -3.0773999169468880e-02</internalNodes>
+          <leafValues>
+            -2.2545371055603027e+00 -3.3971000462770462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -1.5483000315725803e-02</internalNodes>
+          <leafValues>
+            3.7700700759887695e-01 1.5847999602556229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 3.5167001187801361e-02</internalNodes>
+          <leafValues>
+            -2.9446101188659668e-01 5.3159099817276001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -1.7906000837683678e-02</internalNodes>
+          <leafValues>
+            -9.9788200855255127e-01 1.6235999763011932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 -3.1799999997019768e-03</internalNodes>
+          <leafValues>
+            4.7657001763582230e-02 -7.5249898433685303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 1.5720000490546227e-02</internalNodes>
+          <leafValues>
+            1.4873799681663513e-01 -6.5375399589538574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 2.9864000156521797e-02</internalNodes>
+          <leafValues>
+            -1.4952000230550766e-02 -1.2275190353393555e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 2.9899999499320984e-03</internalNodes>
+          <leafValues>
+            -1.4263699948787689e-01 4.3272799253463745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 8.4749996662139893e-02</internalNodes>
+          <leafValues>
+            -1.9280999898910522e-02 -1.1946409940719604e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -5.8724999427795410e-02</internalNodes>
+          <leafValues>
+            -1.7328219413757324e+00 1.4374700188636780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 4.4755998998880386e-02</internalNodes>
+          <leafValues>
+            -2.4140599370002747e-01 5.4019999504089355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 4.0369000285863876e-02</internalNodes>
+          <leafValues>
+            5.7680001482367516e-03 5.6578099727630615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 3.7735998630523682e-02</internalNodes>
+          <leafValues>
+            3.8180999457836151e-02 -7.9370397329330444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 6.0752999037504196e-02</internalNodes>
+          <leafValues>
+            7.6453000307083130e-02 1.4813209772109985e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 -1.9832000136375427e-02</internalNodes>
+          <leafValues>
+            -1.6971720457077026e+00 -2.7370000258088112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -1.6592699289321899e-01</internalNodes>
+          <leafValues>
+            6.2976002693176270e-01 3.1762998551130295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 6.9014996290206909e-02</internalNodes>
+          <leafValues>
+            -3.3463200926780701e-01 3.0076700448989868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 1.1358000338077545e-02</internalNodes>
+          <leafValues>
+            2.2741499543190002e-01 -3.8224700093269348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 1.7000000225380063e-03</internalNodes>
+          <leafValues>
+            1.9223800301551819e-01 -5.2735102176666260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 7.9769000411033630e-02</internalNodes>
+          <leafValues>
+            9.1491997241973877e-02 2.1049048900604248e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -5.7144001126289368e-02</internalNodes>
+          <leafValues>
+            -1.7452130317687988e+00 -4.0910001844167709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 7.3830001056194305e-03</internalNodes>
+          <leafValues>
+            -2.4214799702167511e-01 3.5577800869941711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 -1.8040999770164490e-02</internalNodes>
+          <leafValues>
+            1.1779999732971191e+00 -1.7676700651645660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 9.4503000378608704e-02</internalNodes>
+          <leafValues>
+            1.3936099410057068e-01 -1.2993700504302979e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 5.4210000671446323e-03</internalNodes>
+          <leafValues>
+            -5.4608601331710815e-01 1.3916400074958801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 7.0290002040565014e-03</internalNodes>
+          <leafValues>
+            -2.1597200632095337e-01 3.9258098602294922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 3.4515999257564545e-02</internalNodes>
+          <leafValues>
+            6.3188999891281128e-02 -7.2108101844787598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -5.1924999803304672e-02</internalNodes>
+          <leafValues>
+            6.8667602539062500e-01 6.3272997736930847e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -6.9162003695964813e-02</internalNodes>
+          <leafValues>
+            1.7411810159683228e+00 -1.6619299352169037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 -5.5229999125003815e-03</internalNodes>
+          <leafValues>
+            3.0694699287414551e-01 -1.6662900149822235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 6.8599998950958252e-02</internalNodes>
+          <leafValues>
+            -2.1405400335788727e-01 7.3185002803802490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -6.7038998007774353e-02</internalNodes>
+          <leafValues>
+            -7.9360598325729370e-01 2.0525799691677094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 -2.1005000919103622e-02</internalNodes>
+          <leafValues>
+            3.7344399094581604e-01 -2.9618600010871887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 2.0278999581933022e-02</internalNodes>
+          <leafValues>
+            -1.5200000256299973e-02 4.0555301308631897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -4.7107998281717300e-02</internalNodes>
+          <leafValues>
+            1.2116849422454834e+00 -1.7464299499988556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 1.8768499791622162e-01</internalNodes>
+          <leafValues>
+            -2.2909000515937805e-02 6.9645798206329346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 -4.3228998780250549e-02</internalNodes>
+          <leafValues>
+            -1.0602480173110962e+00 -5.5599998449906707e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 2.0004000514745712e-02</internalNodes>
+          <leafValues>
+            -3.2751001417636871e-02 5.3805100917816162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 8.0880001187324524e-03</internalNodes>
+          <leafValues>
+            3.7548001855611801e-02 -7.4768900871276855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 2.7101000770926476e-02</internalNodes>
+          <leafValues>
+            -8.1790000200271606e-02 3.3387100696563721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 -9.1746002435684204e-02</internalNodes>
+          <leafValues>
+            -1.9213509559631348e+00 -3.8952998816967010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 -1.2454999610781670e-02</internalNodes>
+          <leafValues>
+            4.8360601067543030e-01 1.8168000504374504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 1.4649000018835068e-02</internalNodes>
+          <leafValues>
+            -1.9906699657440186e-01 7.2815400362014771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 2.9101999476552010e-02</internalNodes>
+          <leafValues>
+            1.9871099293231964e-01 -4.9216800928115845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 8.7799998000264168e-03</internalNodes>
+          <leafValues>
+            -1.9499599933624268e-01 7.7317398786544800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 -5.4740000516176224e-02</internalNodes>
+          <leafValues>
+            1.8087190389633179e+00 6.8323001265525818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -1.4798000454902649e-02</internalNodes>
+          <leafValues>
+            7.8064900636672974e-01 -1.8709599971771240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 2.5012999773025513e-02</internalNodes>
+          <leafValues>
+            1.5285299718379974e-01 -1.6021020412445068e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 4.6548001468181610e-02</internalNodes>
+          <leafValues>
+            -1.6738200187683105e-01 1.1902060508728027e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 1.7624000087380409e-02</internalNodes>
+          <leafValues>
+            -1.0285499691963196e-01 3.9175900816917419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 1.6319599747657776e-01</internalNodes>
+          <leafValues>
+            -3.5624001175165176e-02 -1.6098170280456543e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 1.3137999922037125e-02</internalNodes>
+          <leafValues>
+            -5.6359000504016876e-02 5.4158902168273926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -1.5665000304579735e-02</internalNodes>
+          <leafValues>
+            2.8063100576400757e-01 -3.1708601117134094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 8.0554001033306122e-02</internalNodes>
+          <leafValues>
+            1.2640400230884552e-01 -1.0297529697418213e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 3.5363998264074326e-02</internalNodes>
+          <leafValues>
+            2.0752999931573868e-02 -7.9105597734451294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 3.2986998558044434e-02</internalNodes>
+          <leafValues>
+            1.9057099521160126e-01 -8.3839899301528931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 1.2195000424981117e-02</internalNodes>
+          <leafValues>
+            7.3729000985622406e-02 -6.2780702114105225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 4.3065998703241348e-02</internalNodes>
+          <leafValues>
+            4.7384999692440033e-02 1.5712939500808716e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 3.0326999723911285e-02</internalNodes>
+          <leafValues>
+            -2.7314600348472595e-01 3.8572001457214355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 3.5493001341819763e-02</internalNodes>
+          <leafValues>
+            5.4593998938798904e-02 5.2583402395248413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -1.4596999622881413e-02</internalNodes>
+          <leafValues>
+            3.8152599334716797e-01 -2.8332400321960449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 1.2606999836862087e-02</internalNodes>
+          <leafValues>
+            1.5455099940299988e-01 -3.0501499772071838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 1.0172000154852867e-02</internalNodes>
+          <leafValues>
+            2.3637000471353531e-02 -8.7217897176742554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 2.8843000531196594e-02</internalNodes>
+          <leafValues>
+            1.6090999543666840e-01 -2.0277599990367889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 5.5100000463426113e-04</internalNodes>
+          <leafValues>
+            -6.1545401811599731e-01 8.0935999751091003e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>127</maxWeakCount>
+      <stageThreshold>-3.5645289421081543e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 711 4.8344001173973083e-02</internalNodes>
+          <leafValues>
+            -8.4904599189758301e-01 5.6974399089813232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 3.2460000365972519e-02</internalNodes>
+          <leafValues>
+            -8.1417298316955566e-01 4.4781699776649475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 3.3339999616146088e-02</internalNodes>
+          <leafValues>
+            -3.6423799395561218e-01 6.7937397956848145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 6.4019998535513878e-03</internalNodes>
+          <leafValues>
+            -1.1885459423065186e+00 1.9238699972629547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -5.6889997795224190e-03</internalNodes>
+          <leafValues>
+            3.3085298538208008e-01 -7.1334099769592285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 1.2698000296950340e-02</internalNodes>
+          <leafValues>
+            -5.0990802049636841e-01 1.1376299709081650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 6.0549997724592686e-03</internalNodes>
+          <leafValues>
+            -1.0470550060272217e+00 2.0222599804401398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 2.6420000940561295e-03</internalNodes>
+          <leafValues>
+            -5.0559401512145996e-01 3.6441200971603394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -1.6925999894738197e-02</internalNodes>
+          <leafValues>
+            -9.9541902542114258e-01 1.2602199614048004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 2.8235999867320061e-02</internalNodes>
+          <leafValues>
+            -9.4137996435165405e-02 5.7780402898788452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 1.0428999550640583e-02</internalNodes>
+          <leafValues>
+            2.3272900283336639e-01 -5.2569699287414551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 9.8860003054141998e-03</internalNodes>
+          <leafValues>
+            -1.0316299647092819e-01 4.7657600045204163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 2.6015000417828560e-02</internalNodes>
+          <leafValues>
+            -1.0920000495389104e-03 -1.5581729412078857e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 -2.5537999346852303e-02</internalNodes>
+          <leafValues>
+            -6.5451401472091675e-01 1.8843199312686920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -3.5310001112520695e-03</internalNodes>
+          <leafValues>
+            2.8140598535537720e-01 -4.4575300812721252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 9.2449998483061790e-03</internalNodes>
+          <leafValues>
+            1.5612000226974487e-01 -2.1370999515056610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 2.1030999720096588e-02</internalNodes>
+          <leafValues>
+            -2.9170298576354980e-01 5.2234101295471191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 -5.1063001155853271e-02</internalNodes>
+          <leafValues>
+            1.3661290407180786e+00 3.0465999618172646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 -6.2330000102519989e-02</internalNodes>
+          <leafValues>
+            1.2207020521163940e+00 -2.2434400022029877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 -3.2963000237941742e-02</internalNodes>
+          <leafValues>
+            -8.2016801834106445e-01 1.4531899988651276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -3.7418000400066376e-02</internalNodes>
+          <leafValues>
+            -1.2218099832534790e+00 1.9448999315500259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 1.2402799725532532e-01</internalNodes>
+          <leafValues>
+            1.2082300335168839e-01 -9.8729300498962402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -8.9229997247457504e-03</internalNodes>
+          <leafValues>
+            -1.1688489913940430e+00 2.1105000749230385e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 -5.9879999607801437e-02</internalNodes>
+          <leafValues>
+            -1.0689330101013184e+00 1.9860200583934784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 6.2620001845061779e-03</internalNodes>
+          <leafValues>
+            -3.6229598522186279e-01 3.8000801205635071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 -1.7673000693321228e-02</internalNodes>
+          <leafValues>
+            4.9094098806381226e-01 -1.4606699347496033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 1.7579000443220139e-02</internalNodes>
+          <leafValues>
+            5.8728098869323730e-01 -2.7774399518966675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 5.1560001447796822e-03</internalNodes>
+          <leafValues>
+            -7.5194999575614929e-02 6.0193097591400146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -1.0599999688565731e-02</internalNodes>
+          <leafValues>
+            2.7637401223182678e-01 -3.7794300913810730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 2.0884099602699280e-01</internalNodes>
+          <leafValues>
+            -5.3599998354911804e-03 1.0317809581756592e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -2.6412999257445335e-02</internalNodes>
+          <leafValues>
+            8.2336401939392090e-01 -2.2480599582195282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 5.8892000466585159e-02</internalNodes>
+          <leafValues>
+            1.3098299503326416e-01 -1.1853699684143066e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -1.1579000391066074e-02</internalNodes>
+          <leafValues>
+            -9.0667802095413208e-01 4.4126998633146286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 4.5988000929355621e-02</internalNodes>
+          <leafValues>
+            1.0143999941647053e-02 1.0740900039672852e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 -2.2838000208139420e-02</internalNodes>
+          <leafValues>
+            1.7791990041732788e+00 -1.7315499484539032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -8.1709995865821838e-03</internalNodes>
+          <leafValues>
+            5.7386302947998047e-01 -7.4106000363826752e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 3.5359999164938927e-03</internalNodes>
+          <leafValues>
+            -3.2072898745536804e-01 4.0182501077651978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 4.9444999545812607e-02</internalNodes>
+          <leafValues>
+            1.9288000464439392e-01 -1.2166700363159180e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 3.5139999818056822e-03</internalNodes>
+          <leafValues>
+            6.9568000733852386e-02 -7.1323698759078979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -3.0996000394225121e-02</internalNodes>
+          <leafValues>
+            -3.8862198591232300e-01 1.8098799884319305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 8.6452998220920563e-02</internalNodes>
+          <leafValues>
+            -2.5792999193072319e-02 -1.5453219413757324e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 -1.3652600347995758e-01</internalNodes>
+          <leafValues>
+            -1.9199420213699341e+00 1.6613300144672394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -5.7689999230206013e-03</internalNodes>
+          <leafValues>
+            -1.2822589874267578e+00 -1.5907999128103256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -1.7899999395012856e-02</internalNodes>
+          <leafValues>
+            -4.0409898757934570e-01 2.3591600358486176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 -1.9969999790191650e-02</internalNodes>
+          <leafValues>
+            -7.2891902923583984e-01 5.6235000491142273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -5.7493001222610474e-02</internalNodes>
+          <leafValues>
+            5.7830798625946045e-01 -1.5796000137925148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 -8.3056002855300903e-02</internalNodes>
+          <leafValues>
+            9.1511601209640503e-01 -2.1121400594711304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 -5.3771000355482101e-02</internalNodes>
+          <leafValues>
+            -5.1931297779083252e-01 1.8576000630855560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -8.3670001477003098e-03</internalNodes>
+          <leafValues>
+            2.4109700322151184e-01 -3.9648601412773132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 5.5406998842954636e-02</internalNodes>
+          <leafValues>
+            1.6771200299263000e-01 -2.5664970874786377e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -6.7180998623371124e-02</internalNodes>
+          <leafValues>
+            -1.3658570051193237e+00 -1.4232000336050987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 -2.3900000378489494e-02</internalNodes>
+          <leafValues>
+            -1.7084569931030273e+00 1.6507799923419952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 5.5949999950826168e-03</internalNodes>
+          <leafValues>
+            -3.1373998522758484e-01 3.2837900519371033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 2.1294999867677689e-02</internalNodes>
+          <leafValues>
+            1.4953400194644928e-01 -4.8579800128936768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -2.4613000452518463e-02</internalNodes>
+          <leafValues>
+            7.4346399307250977e-01 -2.2305199503898621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -1.9626000896096230e-02</internalNodes>
+          <leafValues>
+            -4.0918299555778503e-01 1.8893200159072876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 -5.3266000002622604e-02</internalNodes>
+          <leafValues>
+            8.1381601095199585e-01 -2.0853699743747711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 7.1290000341832638e-03</internalNodes>
+          <leafValues>
+            3.2996100187301636e-01 -5.9937399625778198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -2.2486999630928040e-02</internalNodes>
+          <leafValues>
+            -1.2551610469818115e+00 -2.0413000136613846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -8.2310996949672699e-02</internalNodes>
+          <leafValues>
+            1.3821430206298828e+00 5.9308998286724091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 1.3097000122070312e-01</internalNodes>
+          <leafValues>
+            -3.5843998193740845e-02 -1.5396369695663452e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 1.4293000102043152e-02</internalNodes>
+          <leafValues>
+            -1.8475200235843658e-01 3.7455001473426819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 6.3479999080300331e-03</internalNodes>
+          <leafValues>
+            -4.4901099801063538e-01 1.3876999914646149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -4.6055000275373459e-02</internalNodes>
+          <leafValues>
+            6.7832601070404053e-01 -1.7071999609470367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 5.7693999260663986e-02</internalNodes>
+          <leafValues>
+            -1.1955999769270420e-02 -1.2261159420013428e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -6.0609998181462288e-03</internalNodes>
+          <leafValues>
+            3.3958598971366882e-01 6.2800000887364149e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 -5.2163001149892807e-02</internalNodes>
+          <leafValues>
+            -1.0621069669723511e+00 -1.3779999688267708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 4.6572998166084290e-02</internalNodes>
+          <leafValues>
+            1.4538800716400146e-01 -1.2384550571441650e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 7.5309998355805874e-03</internalNodes>
+          <leafValues>
+            -2.4467700719833374e-01 5.1377099752426147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 2.1615000441670418e-02</internalNodes>
+          <leafValues>
+            1.3072599470615387e-01 -7.0996797084808350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 -1.7864000052213669e-02</internalNodes>
+          <leafValues>
+            -1.0474660396575928e+00 4.9599999329075217e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -3.7195000797510147e-02</internalNodes>
+          <leafValues>
+            -1.5126730203628540e+00 1.4801399409770966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 -3.1100001069717109e-04</internalNodes>
+          <leafValues>
+            1.3971500098705292e-01 -4.6867498755455017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 2.5042999535799026e-02</internalNodes>
+          <leafValues>
+            2.8632000088691711e-01 -4.1794699430465698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 9.3449996784329414e-03</internalNodes>
+          <leafValues>
+            -2.7336201071739197e-01 4.3444699048995972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 3.2363999634981155e-02</internalNodes>
+          <leafValues>
+            1.8438899517059326e-01 -9.5019298791885376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -6.2299999408423901e-03</internalNodes>
+          <leafValues>
+            3.2581999897956848e-01 -3.0815601348876953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 5.1488999277353287e-02</internalNodes>
+          <leafValues>
+            1.1416000127792358e-01 -1.9795479774475098e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -2.6449000462889671e-02</internalNodes>
+          <leafValues>
+            -1.1067299842834473e+00 -8.5519999265670776e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 -1.5420000068843365e-02</internalNodes>
+          <leafValues>
+            8.0138701200485229e-01 -3.2035000622272491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 1.9456999376416206e-02</internalNodes>
+          <leafValues>
+            -2.6449498534202576e-01 3.8753899931907654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 3.3620998263359070e-02</internalNodes>
+          <leafValues>
+            1.6052000224590302e-02 5.8840900659561157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 2.8906000778079033e-02</internalNodes>
+          <leafValues>
+            1.5216000378131866e-02 -9.4723600149154663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 2.0300000323913991e-04</internalNodes>
+          <leafValues>
+            -3.0766001343727112e-01 2.1235899627208710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -4.9141999334096909e-02</internalNodes>
+          <leafValues>
+            -1.6058609485626221e+00 -3.1094999983906746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 7.6425999402999878e-02</internalNodes>
+          <leafValues>
+            7.4758999049663544e-02 1.1639410257339478e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 2.3897999897599220e-02</internalNodes>
+          <leafValues>
+            -6.4320000819861889e-03 -1.1150749921798706e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 3.8970001041889191e-03</internalNodes>
+          <leafValues>
+            -2.4105699360370636e-01 2.0858900249004364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 -8.9445002377033234e-02</internalNodes>
+          <leafValues>
+            1.9157789945602417e+00 -1.5721100568771362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -1.5008999966084957e-02</internalNodes>
+          <leafValues>
+            -2.5174099206924438e-01 1.8179899454116821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 -1.1145999655127525e-02</internalNodes>
+          <leafValues>
+            -6.9349497556686401e-01 4.4927999377250671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 9.4578996300697327e-02</internalNodes>
+          <leafValues>
+            1.8102100491523743e-01 -7.4978601932525635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 5.5038899183273315e-01</internalNodes>
+          <leafValues>
+            -3.0974000692367554e-02 -1.6746139526367188e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 4.1381001472473145e-02</internalNodes>
+          <leafValues>
+            6.3910000026226044e-02 7.6561200618743896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 2.4771999567747116e-02</internalNodes>
+          <leafValues>
+            1.1380000039935112e-02 -8.8559401035308838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 5.0999000668525696e-02</internalNodes>
+          <leafValues>
+            1.4890299737453461e-01 -2.4634211063385010e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -1.6893999651074409e-02</internalNodes>
+          <leafValues>
+            3.8870999217033386e-01 -2.9880300164222717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 -1.2162300199270248e-01</internalNodes>
+          <leafValues>
+            -1.5542800426483154e+00 1.6300800442695618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -3.6049999762326479e-03</internalNodes>
+          <leafValues>
+            2.1842800080776215e-01 -3.7312099337577820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 1.1575400084257126e-01</internalNodes>
+          <leafValues>
+            -4.7061000019311905e-02 5.9403699636459351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 3.6903999745845795e-02</internalNodes>
+          <leafValues>
+            -2.5508600473403931e-01 5.5397301912307739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 1.1483999900519848e-02</internalNodes>
+          <leafValues>
+            -1.8129499256610870e-01 4.0682798624038696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -2.0233999937772751e-02</internalNodes>
+          <leafValues>
+            5.4311197996139526e-01 -2.3822399973869324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -2.8765000402927399e-02</internalNodes>
+          <leafValues>
+            -6.9172298908233643e-01 1.5943300724029541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -5.8320001699030399e-03</internalNodes>
+          <leafValues>
+            2.9447799921035767e-01 -3.4005999565124512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -5.5468998849391937e-02</internalNodes>
+          <leafValues>
+            9.2200797796249390e-01 9.4093002378940582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.4801000244915485e-02</internalNodes>
+          <leafValues>
+            -7.9539698362350464e-01 3.1521998345851898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 -7.0940000005066395e-03</internalNodes>
+          <leafValues>
+            3.3096000552177429e-01 -5.0886999815702438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -4.5124001801013947e-02</internalNodes>
+          <leafValues>
+            -1.3719749450683594e+00 -2.1408999338746071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 6.4377002418041229e-02</internalNodes>
+          <leafValues>
+            6.3901998102664948e-02 9.1478300094604492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -1.4727000147104263e-02</internalNodes>
+          <leafValues>
+            3.6050599813461304e-01 -2.8614500164985657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 4.5007001608610153e-02</internalNodes>
+          <leafValues>
+            -1.5619699656963348e-01 5.3160297870635986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 -1.1330000124871731e-03</internalNodes>
+          <leafValues>
+            1.3422900438308716e-01 -4.4358900189399719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 4.9451000988483429e-02</internalNodes>
+          <leafValues>
+            1.0571800172328949e-01 -2.5589139461517334e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 2.9102999716997147e-02</internalNodes>
+          <leafValues>
+            -1.0088000446557999e-02 -1.1073939800262451e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 3.4786000847816467e-02</internalNodes>
+          <leafValues>
+            -2.7719999197870493e-03 5.6700998544692993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -6.1309998854994774e-03</internalNodes>
+          <leafValues>
+            -4.6889400482177734e-01 1.2636399269104004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 1.5525000169873238e-02</internalNodes>
+          <leafValues>
+            -8.4279999136924744e-03 8.7469202280044556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 2.9249999206513166e-03</internalNodes>
+          <leafValues>
+            -3.4434300661087036e-01 2.0851600170135498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -5.3571000695228577e-02</internalNodes>
+          <leafValues>
+            1.4982949495315552e+00 5.7328000664710999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -1.9217999652028084e-02</internalNodes>
+          <leafValues>
+            -9.9234098196029663e-01 -9.3919998034834862e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 -5.5282998830080032e-02</internalNodes>
+          <leafValues>
+            -5.7682299613952637e-01 1.6860599815845490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 5.6336000561714172e-02</internalNodes>
+          <leafValues>
+            -3.3775001764297485e-02 -1.3889650106430054e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -2.3824000731110573e-02</internalNodes>
+          <leafValues>
+            4.0182098746299744e-01 1.8360000103712082e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 1.7810000572353601e-03</internalNodes>
+          <leafValues>
+            1.8145999312400818e-01 -4.1743400692939758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -3.7689000368118286e-02</internalNodes>
+          <leafValues>
+            5.4683101177215576e-01 1.8219999969005585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -2.4144999682903290e-02</internalNodes>
+          <leafValues>
+            6.8352097272872925e-01 -1.9650200009346008e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>135</maxWeakCount>
+      <stageThreshold>-3.7025990486145020e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 838 2.7444999665021896e-02</internalNodes>
+          <leafValues>
+            -8.9984202384948730e-01 5.1876497268676758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 1.1554100364446640e-01</internalNodes>
+          <leafValues>
+            -5.6524401903152466e-01 7.0551300048828125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 -2.2297000512480736e-02</internalNodes>
+          <leafValues>
+            3.6079999804496765e-01 -6.6864597797393799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 1.3325000181794167e-02</internalNodes>
+          <leafValues>
+            -5.5573397874832153e-01 3.5789999365806580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -3.8060001097619534e-03</internalNodes>
+          <leafValues>
+            -1.0713000297546387e+00 1.8850000202655792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 -2.6819999329745770e-03</internalNodes>
+          <leafValues>
+            -7.1584302186965942e-01 2.6344498991966248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 3.3819999080151320e-03</internalNodes>
+          <leafValues>
+            -4.6930798888206482e-01 2.6658400893211365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 3.7643000483512878e-02</internalNodes>
+          <leafValues>
+            2.1098700165748596e-01 -1.0804339647293091e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 -1.3861999846994877e-02</internalNodes>
+          <leafValues>
+            6.6912001371383667e-01 -2.7942800521850586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 -2.7350001037120819e-03</internalNodes>
+          <leafValues>
+            -9.5332300662994385e-01 2.4051299691200256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 -3.8336999714374542e-02</internalNodes>
+          <leafValues>
+            8.1432801485061646e-01 -2.4919399619102478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -3.4697998315095901e-02</internalNodes>
+          <leafValues>
+            1.2330100536346436e+00 6.8600000813603401e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 2.3360999301075935e-02</internalNodes>
+          <leafValues>
+            -3.0794700980186462e-01 7.0714497566223145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 3.5057999193668365e-02</internalNodes>
+          <leafValues>
+            2.1205900609493256e-01 -1.4399830102920532e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 -1.3256999664008617e-02</internalNodes>
+          <leafValues>
+            -9.0260702371597290e-01 4.8610001802444458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 1.2740000151097775e-02</internalNodes>
+          <leafValues>
+            2.2655199468135834e-01 -4.4643801450729370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 3.6400000099092722e-03</internalNodes>
+          <leafValues>
+            -3.9817899465560913e-01 3.4665399789810181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 1.0064700245857239e-01</internalNodes>
+          <leafValues>
+            1.8383599817752838e-01 -1.3410769701004028e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 0.</internalNodes>
+          <leafValues>
+            1.5536400675773621e-01 -5.1582497358322144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 1.1708999983966351e-02</internalNodes>
+          <leafValues>
+            2.1651400625705719e-01 -7.2705197334289551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -3.5964999347925186e-02</internalNodes>
+          <leafValues>
+            -1.4789500236511230e+00 -2.4317000061273575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 -2.1236000582575798e-02</internalNodes>
+          <leafValues>
+            -1.6844099760055542e-01 1.9526599347591400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 1.4874000102281570e-02</internalNodes>
+          <leafValues>
+            3.7335999310016632e-02 -8.7557297945022583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -5.1409997977316380e-03</internalNodes>
+          <leafValues>
+            3.3466500043869019e-01 -2.4109700322151184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 2.3450000211596489e-02</internalNodes>
+          <leafValues>
+            5.5320002138614655e-03 -1.2509720325469971e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 -2.5062000378966331e-02</internalNodes>
+          <leafValues>
+            4.5212399959564209e-01 -8.4469996392726898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -7.7400001464411616e-04</internalNodes>
+          <leafValues>
+            1.5249900519847870e-01 -4.8486500978469849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 -4.0483999997377396e-02</internalNodes>
+          <leafValues>
+            -1.3024920225143433e+00 1.7983500659465790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 2.8170999139547348e-02</internalNodes>
+          <leafValues>
+            -2.4410900473594666e-01 6.2271100282669067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 4.5692998915910721e-02</internalNodes>
+          <leafValues>
+            2.8122000396251678e-02 9.2394399642944336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 3.9707001298666000e-02</internalNodes>
+          <leafValues>
+            -2.2332799434661865e-01 7.7674001455307007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 5.0517000257968903e-02</internalNodes>
+          <leafValues>
+            2.0319999754428864e-01 -1.0895930528640747e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -1.7266999930143356e-02</internalNodes>
+          <leafValues>
+            6.8598401546478271e-01 -2.3304499685764313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 8.0186001956462860e-02</internalNodes>
+          <leafValues>
+            -1.0292000137269497e-02 6.1881101131439209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 9.7676001489162445e-02</internalNodes>
+          <leafValues>
+            -2.0070299506187439e-01 1.0088349580764771e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 -1.5572000294923782e-02</internalNodes>
+          <leafValues>
+            4.7615298628807068e-01 4.5623999089002609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -1.5305000357329845e-02</internalNodes>
+          <leafValues>
+            -1.1077369451522827e+00 4.5239999890327454e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -1.6485000029206276e-02</internalNodes>
+          <leafValues>
+            1.0152939558029175e+00 1.6327999532222748e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 -2.6141999289393425e-02</internalNodes>
+          <leafValues>
+            4.1723299026489258e-01 -2.8645500540733337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 8.8679995387792587e-03</internalNodes>
+          <leafValues>
+            2.1404999494552612e-01 -1.6772800683975220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 -2.6886999607086182e-02</internalNodes>
+          <leafValues>
+            -1.1564220190048218e+00 -1.0324000380933285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 7.7789998613297939e-03</internalNodes>
+          <leafValues>
+            3.5359498858451843e-01 -2.9611301422119141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 -1.5974000096321106e-02</internalNodes>
+          <leafValues>
+            -1.5374109745025635e+00 -2.9958000406622887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 2.0866999402642250e-02</internalNodes>
+          <leafValues>
+            2.0244100689888000e-01 -7.1270197629928589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 8.5482001304626465e-02</internalNodes>
+          <leafValues>
+            -2.5932999327778816e-02 -1.5156569480895996e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 2.3872999474406242e-02</internalNodes>
+          <leafValues>
+            1.6803400218486786e-01 -3.8806200027465820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -3.9105001837015152e-02</internalNodes>
+          <leafValues>
+            -1.1958349943161011e+00 -2.0361000671982765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 -7.7946998178958893e-02</internalNodes>
+          <leafValues>
+            -1.0898950099945068e+00 1.4530299603939056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -1.6876000910997391e-02</internalNodes>
+          <leafValues>
+            2.8049701452255249e-01 -4.1336300969123840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 1.1875600367784500e-01</internalNodes>
+          <leafValues>
+            -4.3490998446941376e-02 4.1263699531555176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.5624199807643890e-01</internalNodes>
+          <leafValues>
+            -2.6429599523544312e-01 5.5127799510955811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -4.5908000320196152e-02</internalNodes>
+          <leafValues>
+            6.0189199447631836e-01 1.8921000882983208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -1.0309999808669090e-02</internalNodes>
+          <leafValues>
+            3.8152998685836792e-01 -2.9507899284362793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 9.5769003033638000e-02</internalNodes>
+          <leafValues>
+            1.3246500492095947e-01 -4.6266800165176392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 1.3686999678611755e-02</internalNodes>
+          <leafValues>
+            1.1738699674606323e-01 -5.1664102077484131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 2.3990001063793898e-03</internalNodes>
+          <leafValues>
+            -3.4007599949836731e-01 2.0953500270843506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 3.3264998346567154e-02</internalNodes>
+          <leafValues>
+            -1.7052799463272095e-01 1.4366799592971802e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 -3.3206000924110413e-02</internalNodes>
+          <leafValues>
+            6.1295700073242188e-01 -4.1549999266862869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 2.7979998849332333e-03</internalNodes>
+          <leafValues>
+            -4.8554301261901855e-01 1.3372699916362762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 -6.5792001783847809e-02</internalNodes>
+          <leafValues>
+            -4.0257668495178223e+00 1.0876700282096863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 2.1430000197142363e-03</internalNodes>
+          <leafValues>
+            -3.9179998636245728e-01 2.2427099943161011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 2.2363999858498573e-02</internalNodes>
+          <leafValues>
+            -8.6429998278617859e-02 3.7785199284553528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -5.7410001754760742e-02</internalNodes>
+          <leafValues>
+            1.1454069614410400e+00 -1.9736599922180176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 6.6550001502037048e-03</internalNodes>
+          <leafValues>
+            -2.1105000749230385e-02 5.8453398942947388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 1.2326999567449093e-02</internalNodes>
+          <leafValues>
+            3.7817001342773438e-02 -6.6987001895904541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -8.1869997084140778e-03</internalNodes>
+          <leafValues>
+            5.6366002559661865e-01 -7.6877996325492859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 3.6681000143289566e-02</internalNodes>
+          <leafValues>
+            -1.7343300580978394e-01 1.1670149564743042e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 -4.0220400691032410e-01</internalNodes>
+          <leafValues>
+            1.2640819549560547e+00 4.3398998677730560e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -2.2126000374555588e-02</internalNodes>
+          <leafValues>
+            6.6978102922439575e-01 -2.1605299413204193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 -1.3156999833881855e-02</internalNodes>
+          <leafValues>
+            -4.1198599338531494e-01 2.0215000212192535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -1.2860000133514404e-02</internalNodes>
+          <leafValues>
+            -9.1582697629928589e-01 3.9232999086380005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 2.1627999842166901e-02</internalNodes>
+          <leafValues>
+            3.8719999138265848e-03 3.5668200254440308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 1.1896000243723392e-02</internalNodes>
+          <leafValues>
+            -3.7303900718688965e-01 1.9235099852085114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -1.9548999145627022e-02</internalNodes>
+          <leafValues>
+            -4.2374899983406067e-01 2.4429599940776825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 6.4444996416568756e-02</internalNodes>
+          <leafValues>
+            -1.6558900475502014e-01 1.2697030305862427e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 1.0898499935865402e-01</internalNodes>
+          <leafValues>
+            1.4894300699234009e-01 -2.1534640789031982e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -3.4077998250722885e-02</internalNodes>
+          <leafValues>
+            1.3779460191726685e+00 -1.6198499500751495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 -3.7489999085664749e-03</internalNodes>
+          <leafValues>
+            -3.3828601241111755e-01 2.1152900159358978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 -1.0971999727189541e-02</internalNodes>
+          <leafValues>
+            7.6517897844314575e-01 -1.9692599773406982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -1.1485000140964985e-02</internalNodes>
+          <leafValues>
+            -6.9271200895309448e-01 2.1657100319862366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 2.5984000414609909e-02</internalNodes>
+          <leafValues>
+            -1.1983999982476234e-02 -9.9697297811508179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 4.2159999720752239e-03</internalNodes>
+          <leafValues>
+            -1.0205700248479843e-01 4.8884400725364685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 -4.7697000205516815e-02</internalNodes>
+          <leafValues>
+            1.0666010379791260e+00 -1.7576299607753754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 4.0300001273863018e-04</internalNodes>
+          <leafValues>
+            1.8524800240993500e-01 -7.4790000915527344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 1.1539600044488907e-01</internalNodes>
+          <leafValues>
+            -2.2019700706005096e-01 5.4509997367858887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 1.6021000221371651e-02</internalNodes>
+          <leafValues>
+            2.5487500429153442e-01 -5.0740098953247070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 5.6632000952959061e-02</internalNodes>
+          <leafValues>
+            -1.1256000027060509e-02 -9.5968097448348999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -1.0726000182330608e-02</internalNodes>
+          <leafValues>
+            -2.8544700145721436e-01 1.6994799673557281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 1.2420000135898590e-01</internalNodes>
+          <leafValues>
+            -3.6139998584985733e-02 -1.3132710456848145e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 -5.3799999877810478e-03</internalNodes>
+          <leafValues>
+            3.3092701435089111e-01 1.3307999819517136e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 1.1908000335097313e-02</internalNodes>
+          <leafValues>
+            -3.4830299019813538e-01 2.4041900038719177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -4.3007999658584595e-02</internalNodes>
+          <leafValues>
+            -1.4390469789505005e+00 1.5599599480628967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 -3.3149998635053635e-02</internalNodes>
+          <leafValues>
+            -1.1805850267410278e+00 -1.2347999960184097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -2.1341999992728233e-02</internalNodes>
+          <leafValues>
+            2.2119441032409668e+00 6.2737002968788147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 -1.2218999676406384e-02</internalNodes>
+          <leafValues>
+            -1.8709750175476074e+00 -4.5499999076128006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 -1.6860999166965485e-02</internalNodes>
+          <leafValues>
+            -7.6912701129913330e-01 1.5330000221729279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -2.4999999441206455e-03</internalNodes>
+          <leafValues>
+            -6.2987399101257324e-01 5.1600001752376556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -4.5037999749183655e-02</internalNodes>
+          <leafValues>
+            8.5428899526596069e-01 6.2600001692771912e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 3.9057999849319458e-02</internalNodes>
+          <leafValues>
+            -3.2458998262882233e-02 -1.3325669765472412e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 6.6720000468194485e-03</internalNodes>
+          <leafValues>
+            -1.9423599541187286e-01 3.7328699231147766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 -1.6361000016331673e-02</internalNodes>
+          <leafValues>
+            2.0605869293212891e+00 -1.5042699873447418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 6.1719999648630619e-03</internalNodes>
+          <leafValues>
+            -1.1610999703407288e-01 2.5455400347709656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 4.5722000300884247e-02</internalNodes>
+          <leafValues>
+            -1.6340000554919243e-02 -1.0449140071868896e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 4.1209999471902847e-03</internalNodes>
+          <leafValues>
+            -4.1997998952865601e-02 3.9680999517440796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 -1.7800000205170363e-04</internalNodes>
+          <leafValues>
+            -6.6422599554061890e-01 3.3443000167608261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 7.1109998971223831e-03</internalNodes>
+          <leafValues>
+            -5.8231998234987259e-02 3.7857300043106079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 -4.9864001572132111e-02</internalNodes>
+          <leafValues>
+            6.1019402742385864e-01 -2.1005700528621674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -2.5011999532580376e-02</internalNodes>
+          <leafValues>
+            -5.7100099325180054e-01 1.7848399281501770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 3.0939999967813492e-02</internalNodes>
+          <leafValues>
+            5.6363001465797424e-02 -6.4731001853942871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 4.6271000057458878e-02</internalNodes>
+          <leafValues>
+            1.7482399940490723e-01 -9.8909401893615723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -3.1870000530034304e-03</internalNodes>
+          <leafValues>
+            -6.6804802417755127e-01 3.2267000526189804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -2.4351999163627625e-02</internalNodes>
+          <leafValues>
+            2.9444900155067444e-01 -1.3599999947473407e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 1.1974000371992588e-02</internalNodes>
+          <leafValues>
+            -2.8345099091529846e-01 4.7171199321746826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 1.3070000335574150e-02</internalNodes>
+          <leafValues>
+            -1.0834600031375885e-01 5.7193297147750854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 5.9163000434637070e-02</internalNodes>
+          <leafValues>
+            -5.0939001142978668e-02 -1.9059720039367676e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 -4.1094999760389328e-02</internalNodes>
+          <leafValues>
+            4.5104598999023438e-01 -9.7599998116493225e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 -8.3989001810550690e-02</internalNodes>
+          <leafValues>
+            -2.0349199771881104e+00 -5.1019001752138138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 4.4619001448154449e-02</internalNodes>
+          <leafValues>
+            1.7041100561618805e-01 -1.2278720140457153e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 2.4419000372290611e-02</internalNodes>
+          <leafValues>
+            -2.1796999499201775e-02 -1.0822949409484863e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 -4.3870001100003719e-03</internalNodes>
+          <leafValues>
+            3.0466699600219727e-01 -3.7066599726676941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 2.4607999250292778e-02</internalNodes>
+          <leafValues>
+            -3.1169500946998596e-01 2.3657299578189850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -8.5182003676891327e-02</internalNodes>
+          <leafValues>
+            -1.7982350587844849e+00 1.5254299342632294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 2.1844999864697456e-02</internalNodes>
+          <leafValues>
+            -5.1888000220060349e-02 -1.9017189741134644e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 -1.6829000785946846e-02</internalNodes>
+          <leafValues>
+            2.1025900542736053e-01 2.1656999364495277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 3.2547999173402786e-02</internalNodes>
+          <leafValues>
+            -2.0292599499225616e-01 6.0944002866744995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 2.4709999561309814e-03</internalNodes>
+          <leafValues>
+            -9.5371198654174805e-01 1.8568399548530579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 5.5415999144315720e-02</internalNodes>
+          <leafValues>
+            -1.4405299723148346e-01 2.1506340503692627e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 -1.0635499656200409e-01</internalNodes>
+          <leafValues>
+            -1.0911970138549805e+00 1.3228000700473785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -7.9889995977282524e-03</internalNodes>
+          <leafValues>
+            1.0253400355577469e-01 -5.1744902133941650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 7.5567997992038727e-02</internalNodes>
+          <leafValues>
+            5.8965001255273819e-02 1.2354209423065186e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 -9.2805996537208557e-02</internalNodes>
+          <leafValues>
+            -1.3431650400161743e+00 -3.4462999552488327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 4.9431998282670975e-02</internalNodes>
+          <leafValues>
+            4.9601998180150986e-02 1.6054730415344238e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -1.1772999539971352e-02</internalNodes>
+          <leafValues>
+            -1.0261050462722778e+00 -4.1559999808669090e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 8.5886001586914062e-02</internalNodes>
+          <leafValues>
+            8.4642998874187469e-02 9.5220798254013062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 8.1031002104282379e-02</internalNodes>
+          <leafValues>
+            -1.4687100052833557e-01 1.9359990358352661e+00</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>136</maxWeakCount>
+      <stageThreshold>-3.4265899658203125e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 973 -3.3840999007225037e-02</internalNodes>
+          <leafValues>
+            6.5889501571655273e-01 -6.9755297899246216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 1.5410000458359718e-02</internalNodes>
+          <leafValues>
+            -9.0728402137756348e-01 3.0478599667549133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 5.4905999451875687e-02</internalNodes>
+          <leafValues>
+            -4.9774798750877380e-01 5.7132601737976074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 2.1390000358223915e-02</internalNodes>
+          <leafValues>
+            -4.2565199732780457e-01 5.8096802234649658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 7.8849997371435165e-03</internalNodes>
+          <leafValues>
+            -4.7905999422073364e-01 4.3016499280929565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -3.7544999271631241e-02</internalNodes>
+          <leafValues>
+            5.0861597061157227e-01 -1.9985899329185486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 1.5925799310207367e-01</internalNodes>
+          <leafValues>
+            -2.3263600468635559e-01 1.0993319749832153e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 -6.8939998745918274e-02</internalNodes>
+          <leafValues>
+            4.0569001436233521e-01 5.6855000555515289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -3.3695001155138016e-02</internalNodes>
+          <leafValues>
+            4.5132800936698914e-01 -3.3332800865173340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 -6.3314996659755707e-02</internalNodes>
+          <leafValues>
+            -8.5015702247619629e-01 2.2341699898242950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 7.3699997738003731e-03</internalNodes>
+          <leafValues>
+            -9.3082201480865479e-01 5.9216998517513275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -9.5969997346401215e-03</internalNodes>
+          <leafValues>
+            -1.2794899940490723e+00 1.8447299301624298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -1.3067999482154846e-01</internalNodes>
+          <leafValues>
+            5.8426898717880249e-01 -2.6007199287414551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 5.7402998208999634e-02</internalNodes>
+          <leafValues>
+            -5.3789000958204269e-02 7.1175599098205566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -7.2340001352131367e-03</internalNodes>
+          <leafValues>
+            -8.6962199211120605e-01 7.5214996933937073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 3.1098999083042145e-02</internalNodes>
+          <leafValues>
+            -7.5006999075412750e-02 9.0781599283218384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 3.5854000598192215e-02</internalNodes>
+          <leafValues>
+            -2.4795499444007874e-01 7.2272098064422607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 -3.1534999608993530e-02</internalNodes>
+          <leafValues>
+            -1.1238329410552979e+00 2.0988300442695618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.9437000155448914e-02</internalNodes>
+          <leafValues>
+            -1.4499390125274658e+00 -1.5100000426173210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -7.2420001961290836e-03</internalNodes>
+          <leafValues>
+            5.3864902257919312e-01 -1.1375399678945541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 8.1639997661113739e-03</internalNodes>
+          <leafValues>
+            6.6889002919197083e-02 -7.6872897148132324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 -4.3653000146150589e-02</internalNodes>
+          <leafValues>
+            1.1413530111312866e+00 4.0217000991106033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 2.6569999754428864e-02</internalNodes>
+          <leafValues>
+            -2.4719099700450897e-01 5.9295099973678589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 3.2216999679803848e-02</internalNodes>
+          <leafValues>
+            -4.0024999529123306e-02 3.2688000798225403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 -7.2236001491546631e-02</internalNodes>
+          <leafValues>
+            5.8729398250579834e-01 -2.5396001338958740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 3.1424999237060547e-02</internalNodes>
+          <leafValues>
+            1.5315100550651550e-01 -5.6042098999023438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -4.7699999413453043e-04</internalNodes>
+          <leafValues>
+            1.6958899796009064e-01 -5.2626699209213257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 2.7189999818801880e-03</internalNodes>
+          <leafValues>
+            -1.4944599568843842e-01 2.9658699035644531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 3.2875001430511475e-02</internalNodes>
+          <leafValues>
+            -3.9943501353263855e-01 2.5156599283218384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 -1.4553000219166279e-02</internalNodes>
+          <leafValues>
+            2.7972599864006042e-01 -4.7203800082206726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 3.8017999380826950e-02</internalNodes>
+          <leafValues>
+            -2.9200001154094934e-03 -1.1300059556961060e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 2.8659999370574951e-03</internalNodes>
+          <leafValues>
+            4.1111800074577332e-01 -2.6220801472663879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -4.1606999933719635e-02</internalNodes>
+          <leafValues>
+            -1.4293819665908813e+00 -1.9132999703288078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 -2.4802999570965767e-02</internalNodes>
+          <leafValues>
+            -2.5013598799705505e-01 1.5978699922561646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 1.0098000057041645e-02</internalNodes>
+          <leafValues>
+            4.3738998472690582e-02 -6.9986099004745483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -2.0947000011801720e-02</internalNodes>
+          <leafValues>
+            -9.4137799739837646e-01 2.3204000294208527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 2.2458000108599663e-02</internalNodes>
+          <leafValues>
+            -2.7185800671577454e-01 4.5319199562072754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 -3.7110999226570129e-02</internalNodes>
+          <leafValues>
+            -1.0314660072326660e+00 1.4421799778938293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 -1.0648000054061413e-02</internalNodes>
+          <leafValues>
+            6.3107001781463623e-01 -2.5520798563957214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 5.5422998964786530e-02</internalNodes>
+          <leafValues>
+            1.6206599771976471e-01 -1.7722640037536621e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 2.1601999178528786e-02</internalNodes>
+          <leafValues>
+            -2.5016099214553833e-01 5.4119801521301270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 8.7000000348780304e-05</internalNodes>
+          <leafValues>
+            -2.9008901119232178e-01 3.3507999777793884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 1.4406000263988972e-02</internalNodes>
+          <leafValues>
+            -7.8840004280209541e-03 -1.1677219867706299e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 1.0777399688959122e-01</internalNodes>
+          <leafValues>
+            1.1292000114917755e-01 -2.4940319061279297e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 3.5943999886512756e-02</internalNodes>
+          <leafValues>
+            -1.9480599462985992e-01 9.5757502317428589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 -3.9510000497102737e-03</internalNodes>
+          <leafValues>
+            3.0927801132202148e-01 -2.5530201196670532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 2.0942000672221184e-02</internalNodes>
+          <leafValues>
+            -7.6319999061524868e-03 -1.0086350440979004e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -2.9877999797463417e-02</internalNodes>
+          <leafValues>
+            -4.6027699112892151e-01 1.9507199525833130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 2.5971999391913414e-02</internalNodes>
+          <leafValues>
+            -1.2187999673187733e-02 -1.0035500526428223e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 1.0603000409901142e-02</internalNodes>
+          <leafValues>
+            -7.5969003140926361e-02 4.1669899225234985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 8.5819996893405914e-03</internalNodes>
+          <leafValues>
+            -2.6648598909378052e-01 3.9111500978469849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 2.1270999684929848e-02</internalNodes>
+          <leafValues>
+            1.8273900449275970e-01 -3.6052298545837402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 7.4518002569675446e-02</internalNodes>
+          <leafValues>
+            -1.8938399851322174e-01 9.2658001184463501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 4.6569998376071453e-03</internalNodes>
+          <leafValues>
+            -1.4506199955940247e-01 3.3294600248336792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 1.7119999974966049e-03</internalNodes>
+          <leafValues>
+            -5.2464002370834351e-01 8.9879997074604034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 9.8500004969537258e-04</internalNodes>
+          <leafValues>
+            -3.8381999731063843e-01 2.4392999708652496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 2.8233999386429787e-02</internalNodes>
+          <leafValues>
+            -5.7879998348653316e-03 -1.2617139816284180e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -3.2678000628948212e-02</internalNodes>
+          <leafValues>
+            -5.7953298091888428e-01 1.6955299675464630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 2.2536000236868858e-02</internalNodes>
+          <leafValues>
+            2.2281000390648842e-02 -8.7869602441787720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 -2.1657999604940414e-02</internalNodes>
+          <leafValues>
+            -6.5108501911163330e-01 1.2966899573802948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 7.6799998059868813e-03</internalNodes>
+          <leafValues>
+            -3.3965200185775757e-01 2.2013300657272339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 1.4592000283300877e-02</internalNodes>
+          <leafValues>
+            1.5077300369739532e-01 -5.0452399253845215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 2.7868000790476799e-02</internalNodes>
+          <leafValues>
+            -2.5045299530029297e-01 4.5741999149322510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 5.6940000504255295e-03</internalNodes>
+          <leafValues>
+            -1.0948500037193298e-01 5.5757802724838257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 -1.0002999566495419e-02</internalNodes>
+          <leafValues>
+            -9.7366297245025635e-01 1.8467999994754791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 -4.0719998069107533e-03</internalNodes>
+          <leafValues>
+            3.8222199678421021e-01 -1.6921100020408630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 -2.2593999281525612e-02</internalNodes>
+          <leafValues>
+            -1.0391089916229248e+00 5.1839998923242092e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -3.9579998701810837e-02</internalNodes>
+          <leafValues>
+            -5.5109229087829590e+00 1.1163999885320663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 -1.7537999898195267e-02</internalNodes>
+          <leafValues>
+            9.5485800504684448e-01 -1.8584500253200531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 9.0300003066658974e-03</internalNodes>
+          <leafValues>
+            1.0436000302433968e-02 8.2114797830581665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 -7.9539995640516281e-03</internalNodes>
+          <leafValues>
+            2.2632899880409241e-01 -3.4568199515342712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 2.7091000229120255e-02</internalNodes>
+          <leafValues>
+            1.6430099308490753e-01 -1.3926379680633545e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 -2.0625999197363853e-02</internalNodes>
+          <leafValues>
+            -8.6366099119186401e-01 2.3880000226199627e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 -7.1989998221397400e-02</internalNodes>
+          <leafValues>
+            -2.8192629814147949e+00 1.1570499837398529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 -2.6964999735355377e-02</internalNodes>
+          <leafValues>
+            -1.2946130037307739e+00 -2.4661000818014145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 -4.7377999871969223e-02</internalNodes>
+          <leafValues>
+            -8.1306397914886475e-01 1.1831399798393250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -1.0895600169897079e-01</internalNodes>
+          <leafValues>
+            6.5937900543212891e-01 -2.0843900740146637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 1.3574000447988510e-02</internalNodes>
+          <leafValues>
+            7.4240001849830151e-03 5.3152197599411011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 -6.6920001991093159e-03</internalNodes>
+          <leafValues>
+            3.0655801296234131e-01 -3.1084299087524414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 -3.9070001803338528e-03</internalNodes>
+          <leafValues>
+            2.5576499104499817e-01 -5.2932001650333405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 -3.7613000720739365e-02</internalNodes>
+          <leafValues>
+            -1.4350049495697021e+00 -1.5448000282049179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 8.6329998448491096e-03</internalNodes>
+          <leafValues>
+            -1.6884399950504303e-01 4.2124900221824646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -3.2097000628709793e-02</internalNodes>
+          <leafValues>
+            -6.4979398250579834e-01 4.1110001504421234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 5.8495998382568359e-02</internalNodes>
+          <leafValues>
+            -5.2963998168706894e-02 6.3368302583694458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -4.0901999920606613e-02</internalNodes>
+          <leafValues>
+            -9.2101097106933594e-01 9.0640000998973846e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 -1.9925000146031380e-02</internalNodes>
+          <leafValues>
+            5.3759998083114624e-01 -6.2996998429298401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 -4.6020001173019409e-03</internalNodes>
+          <leafValues>
+            -5.4333502054214478e-01 8.4104999899864197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 1.6824999824166298e-02</internalNodes>
+          <leafValues>
+            1.5563699603080750e-01 -4.0171200037002563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 9.4790002331137657e-03</internalNodes>
+          <leafValues>
+            -2.4245299398899078e-01 5.1509499549865723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 -1.9534999504685402e-02</internalNodes>
+          <leafValues>
+            -5.1118397712707520e-01 1.3831999897956848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 1.0746000334620476e-02</internalNodes>
+          <leafValues>
+            -2.1854999661445618e-01 6.2828701734542847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 3.7927001714706421e-02</internalNodes>
+          <leafValues>
+            1.1640299856662750e-01 -2.7301959991455078e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 1.6390999779105186e-02</internalNodes>
+          <leafValues>
+            -1.4635999687016010e-02 -1.0797250270843506e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 -1.9785000011324883e-02</internalNodes>
+          <leafValues>
+            1.2166420221328735e+00 3.3275000751018524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 1.1067000217735767e-02</internalNodes>
+          <leafValues>
+            -2.5388300418853760e-01 4.4038599729537964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 5.2479999139904976e-03</internalNodes>
+          <leafValues>
+            2.2496800124645233e-01 -2.4216499924659729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 -1.1141999624669552e-02</internalNodes>
+          <leafValues>
+            2.5018098950386047e-01 -3.0811500549316406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 -1.0666999965906143e-02</internalNodes>
+          <leafValues>
+            -3.2729101181030273e-01 2.6168298721313477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 1.0545299947261810e-01</internalNodes>
+          <leafValues>
+            -5.5750001221895218e-02 -1.9605729579925537e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 5.4827999323606491e-02</internalNodes>
+          <leafValues>
+            -1.9519999623298645e-03 7.3866099119186401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 1.7760999500751495e-02</internalNodes>
+          <leafValues>
+            -3.0647200345993042e-01 2.6346999406814575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 -3.1185999512672424e-02</internalNodes>
+          <leafValues>
+            -2.4600900709629059e-01 1.7082199454307556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 -5.7296000421047211e-02</internalNodes>
+          <leafValues>
+            4.7033500671386719e-01 -2.6048299670219421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 -1.1312000453472137e-02</internalNodes>
+          <leafValues>
+            3.8628900051116943e-01 -2.8817000985145569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 3.0592000111937523e-02</internalNodes>
+          <leafValues>
+            -4.8826001584529877e-02 -1.7638969421386719e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 1.8489999929443002e-03</internalNodes>
+          <leafValues>
+            2.1099899709224701e-01 -2.5940999388694763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 1.1419000104069710e-02</internalNodes>
+          <leafValues>
+            -1.6829599440097809e-01 1.0278660058975220e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 8.1403002142906189e-02</internalNodes>
+          <leafValues>
+            1.1531999707221985e-01 -1.2482399940490723e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 5.3495999425649643e-02</internalNodes>
+          <leafValues>
+            -4.6303998678922653e-02 -1.7165969610214233e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 -2.3948000743985176e-02</internalNodes>
+          <leafValues>
+            -4.0246599912643433e-01 2.0562100410461426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 6.7690000869333744e-03</internalNodes>
+          <leafValues>
+            -3.3152300119400024e-01 2.0683400332927704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 -3.2343998551368713e-02</internalNodes>
+          <leafValues>
+            -7.2632801532745361e-01 2.0073500275611877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 3.7863001227378845e-02</internalNodes>
+          <leafValues>
+            -1.5631000697612762e-01 1.6697460412979126e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 1.5440000221133232e-02</internalNodes>
+          <leafValues>
+            1.9487400352954865e-01 -3.5384199023246765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 -4.4376000761985779e-02</internalNodes>
+          <leafValues>
+            8.2093602418899536e-01 -1.8193599581718445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 -2.3102000355720520e-02</internalNodes>
+          <leafValues>
+            -4.3044099211692810e-01 1.2375400215387344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 1.9400000572204590e-02</internalNodes>
+          <leafValues>
+            -2.9726000502705574e-02 -1.1597590446472168e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 1.0385700315237045e-01</internalNodes>
+          <leafValues>
+            1.1149899661540985e-01 -4.6835222244262695e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 -1.8964000046253204e-02</internalNodes>
+          <leafValues>
+            2.1773819923400879e+00 -1.4544400572776794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 3.8750998675823212e-02</internalNodes>
+          <leafValues>
+            -4.9446001648902893e-02 3.4018298983573914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 2.2766999900341034e-02</internalNodes>
+          <leafValues>
+            -3.2802999019622803e-01 3.0531400442123413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 -3.1357001513242722e-02</internalNodes>
+          <leafValues>
+            1.1520819664001465e+00 2.7305999770760536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 9.6909999847412109e-03</internalNodes>
+          <leafValues>
+            -3.8799500465393066e-01 2.1512599289417267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 -4.9284998327493668e-02</internalNodes>
+          <leafValues>
+            -1.6774909496307373e+00 1.5774199366569519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 -3.9510998874902725e-02</internalNodes>
+          <leafValues>
+            -9.7647899389266968e-01 -1.0552000254392624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 4.7997999936342239e-02</internalNodes>
+          <leafValues>
+            2.0843900740146637e-01 -6.8992799520492554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 5.1422998309135437e-02</internalNodes>
+          <leafValues>
+            -1.6665300726890564e-01 1.2149239778518677e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 1.4279999770224094e-02</internalNodes>
+          <leafValues>
+            2.3627699911594391e-01 -4.1396799683570862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 -9.1611996293067932e-02</internalNodes>
+          <leafValues>
+            -9.2830902338027954e-01 -1.8345000222325325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 6.5080001950263977e-03</internalNodes>
+          <leafValues>
+            -7.3647201061248779e-01 1.9497099518775940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 3.5723000764846802e-02</internalNodes>
+          <leafValues>
+            1.4197799563407898e-01 -4.2089301347732544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 5.0638001412153244e-02</internalNodes>
+          <leafValues>
+            1.1644000187516212e-02 7.8486597537994385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 -1.4613999985158443e-02</internalNodes>
+          <leafValues>
+            -1.1909500360488892e+00 -3.5128001123666763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 -3.8662999868392944e-02</internalNodes>
+          <leafValues>
+            2.4314730167388916e+00 6.5647996962070465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 -4.0346998721361160e-02</internalNodes>
+          <leafValues>
+            7.1755301952362061e-01 -1.9108299911022186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 2.3902000859379768e-02</internalNodes>
+          <leafValues>
+            1.5646199882030487e-01 -7.9294800758361816e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>137</maxWeakCount>
+      <stageThreshold>-3.5125269889831543e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1109 8.5640000179409981e-03</internalNodes>
+          <leafValues>
+            -8.1450700759887695e-01 5.8875298500061035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 -1.3292600214481354e-01</internalNodes>
+          <leafValues>
+            9.3213397264480591e-01 -2.9367300868034363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 9.8400004208087921e-03</internalNodes>
+          <leafValues>
+            -5.6462901830673218e-01 4.1647699475288391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 5.0889998674392700e-03</internalNodes>
+          <leafValues>
+            -7.9232800006866455e-01 1.6975000500679016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 -6.1039000749588013e-02</internalNodes>
+          <leafValues>
+            -1.4169000387191772e+00 2.5020999833941460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 -4.6599999768659472e-04</internalNodes>
+          <leafValues>
+            3.7982499599456787e-01 -4.1567099094390869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 3.3889999613165855e-03</internalNodes>
+          <leafValues>
+            -4.0768599510192871e-01 3.5548499226570129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 2.1006999537348747e-02</internalNodes>
+          <leafValues>
+            -2.4080100655555725e-01 8.6112701892852783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 7.5559997931122780e-03</internalNodes>
+          <leafValues>
+            -8.7467199563980103e-01 9.8572000861167908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 2.4779999628663063e-02</internalNodes>
+          <leafValues>
+            1.5566200017929077e-01 -6.9229799509048462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -3.5620000213384628e-02</internalNodes>
+          <leafValues>
+            -1.1472270488739014e+00 3.6359999328851700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 1.9810000434517860e-02</internalNodes>
+          <leafValues>
+            1.5516200661659241e-01 -6.9520097970962524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 1.5019999817013741e-02</internalNodes>
+          <leafValues>
+            4.1990000754594803e-02 -9.6622800827026367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 -2.3137999698519707e-02</internalNodes>
+          <leafValues>
+            4.3396899104118347e-01 2.4160000029951334e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 -1.8743000924587250e-02</internalNodes>
+          <leafValues>
+            4.3481099605560303e-01 -3.2522499561309814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 4.5080000162124634e-01</internalNodes>
+          <leafValues>
+            -9.4573996961116791e-02 7.2421300411224365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 1.1854999698698521e-02</internalNodes>
+          <leafValues>
+            -3.8133099675178528e-01 3.0098399519920349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -2.4830000475049019e-02</internalNodes>
+          <leafValues>
+            8.9300602674484253e-01 -1.0295899957418442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -4.4743001461029053e-02</internalNodes>
+          <leafValues>
+            8.6280298233032227e-01 -2.1716499328613281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 -1.4600000344216824e-02</internalNodes>
+          <leafValues>
+            6.0069400072097778e-01 -1.5906299650669098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 -2.4527000263333321e-02</internalNodes>
+          <leafValues>
+            -1.5872869491577148e+00 -2.1817000582814217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 2.3024000227451324e-02</internalNodes>
+          <leafValues>
+            1.6853399574756622e-01 -3.8106900453567505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 -2.4917000904679298e-02</internalNodes>
+          <leafValues>
+            5.0810897350311279e-01 -2.7279898524284363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 1.0130000300705433e-03</internalNodes>
+          <leafValues>
+            -4.3138799071311951e-01 2.6438099145889282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 1.5603000298142433e-02</internalNodes>
+          <leafValues>
+            -3.1624200940132141e-01 5.5715900659561157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 -2.6685999706387520e-02</internalNodes>
+          <leafValues>
+            1.0553920269012451e+00 2.9074000194668770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 1.3940000208094716e-03</internalNodes>
+          <leafValues>
+            -7.1873801946640015e-01 6.5390996634960175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 -6.4799998654052615e-04</internalNodes>
+          <leafValues>
+            2.4884399771690369e-01 -2.0978200435638428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 -3.1888000667095184e-02</internalNodes>
+          <leafValues>
+            -6.8844497203826904e-01 6.3589997589588165e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 -4.9290000461041927e-03</internalNodes>
+          <leafValues>
+            -5.9152501821517944e-01 2.7943599224090576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 3.1168000772595406e-02</internalNodes>
+          <leafValues>
+            4.5223999768495560e-02 -8.8639199733734131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 -3.3663000911474228e-02</internalNodes>
+          <leafValues>
+            -6.1590200662612915e-01 1.5749299526214600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 1.1966999620199203e-02</internalNodes>
+          <leafValues>
+            -3.0606698989868164e-01 4.2293301224708557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 -3.4680001437664032e-02</internalNodes>
+          <leafValues>
+            -1.3734940290451050e+00 1.5908700227737427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 9.9290004000067711e-03</internalNodes>
+          <leafValues>
+            -5.5860197544097900e-01 1.2119200080633163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 5.9574998915195465e-02</internalNodes>
+          <leafValues>
+            4.9720001406967640e-03 8.2055401802062988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 -6.5428003668785095e-02</internalNodes>
+          <leafValues>
+            1.5651429891586304e+00 -1.6817499697208405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -9.2895999550819397e-02</internalNodes>
+          <leafValues>
+            -1.5794529914855957e+00 1.4661799371242523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 -4.1184000670909882e-02</internalNodes>
+          <leafValues>
+            -1.5518720149993896e+00 -2.9969999566674232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 2.1447999402880669e-02</internalNodes>
+          <leafValues>
+            1.7196300625801086e-01 -6.9343197345733643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 -2.5569999590516090e-02</internalNodes>
+          <leafValues>
+            -1.3061310052871704e+00 -2.4336999282240868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 -4.1200999170541763e-02</internalNodes>
+          <leafValues>
+            -1.3821059465408325e+00 1.4801800251007080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 -1.7668999731540680e-02</internalNodes>
+          <leafValues>
+            -7.0889997482299805e-01 3.6524001508951187e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 9.0060001239180565e-03</internalNodes>
+          <leafValues>
+            -4.0913999080657959e-02 8.0373102426528931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 -1.1652999557554722e-02</internalNodes>
+          <leafValues>
+            5.7546800374984741e-01 -2.4991700053215027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -7.4780001305043697e-03</internalNodes>
+          <leafValues>
+            -4.9280899763107300e-01 1.9810900092124939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 8.5499999113380909e-04</internalNodes>
+          <leafValues>
+            -4.8858100175857544e-01 1.3563099503517151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -3.0538000166416168e-02</internalNodes>
+          <leafValues>
+            -6.0278397798538208e-01 1.8522000312805176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 -1.8846999853849411e-02</internalNodes>
+          <leafValues>
+            2.3565599322319031e-01 -3.5136300325393677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 -8.1129996106028557e-03</internalNodes>
+          <leafValues>
+            -8.1304997205734253e-02 2.1069599688053131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 -3.4830000251531601e-02</internalNodes>
+          <leafValues>
+            -1.2065670490264893e+00 -1.4251999557018280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 1.9021000713109970e-02</internalNodes>
+          <leafValues>
+            2.3349900543689728e-01 -4.5664900541305542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 -1.9004000350832939e-02</internalNodes>
+          <leafValues>
+            -8.1075799465179443e-01 1.3140000402927399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 -8.9057996869087219e-02</internalNodes>
+          <leafValues>
+            6.1542397737503052e-01 3.2983001321554184e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 6.8620000965893269e-03</internalNodes>
+          <leafValues>
+            -2.9583099484443665e-01 2.7003699541091919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 -2.8240999206900597e-02</internalNodes>
+          <leafValues>
+            -6.1102700233459473e-01 1.7357499897480011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 -3.2099999953061342e-04</internalNodes>
+          <leafValues>
+            -5.3322899341583252e-01 6.8539001047611237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 -1.0829100012779236e-01</internalNodes>
+          <leafValues>
+            -1.2879559993743896e+00 1.1801700294017792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 1.5878999605774879e-02</internalNodes>
+          <leafValues>
+            -1.7072600126266479e-01 1.1103910207748413e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 8.6859995499253273e-03</internalNodes>
+          <leafValues>
+            -1.0995099693536758e-01 4.6010500192642212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 -2.5234999135136604e-02</internalNodes>
+          <leafValues>
+            1.0220669507980347e+00 -1.8694299459457397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 -1.3508999720215797e-02</internalNodes>
+          <leafValues>
+            -7.8316599130630493e-01 1.4202600717544556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 -7.7149998396635056e-03</internalNodes>
+          <leafValues>
+            -8.8060700893402100e-01 1.1060000397264957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 7.1580000221729279e-02</internalNodes>
+          <leafValues>
+            1.1369399726390839e-01 -1.1032789945602417e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 -1.3554000295698643e-02</internalNodes>
+          <leafValues>
+            -8.1096500158309937e-01 3.4080001059919596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 2.9450000729411840e-03</internalNodes>
+          <leafValues>
+            -7.2879999876022339e-02 3.4998100996017456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 -5.0833001732826233e-02</internalNodes>
+          <leafValues>
+            -1.2868590354919434e+00 -2.8842000290751457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 -8.7989997118711472e-03</internalNodes>
+          <leafValues>
+            4.7613599896430969e-01 -1.4690400660037994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 2.1424399316310883e-01</internalNodes>
+          <leafValues>
+            -5.9702001512050629e-02 -2.4802260398864746e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 1.3962999917566776e-02</internalNodes>
+          <leafValues>
+            1.7420299351215363e-01 -4.3911001086235046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 4.2502000927925110e-02</internalNodes>
+          <leafValues>
+            -1.9965299963951111e-01 7.0654797554016113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 1.9827999174594879e-02</internalNodes>
+          <leafValues>
+            -6.9136001169681549e-02 6.1643397808074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 -3.3560000360012054e-02</internalNodes>
+          <leafValues>
+            -1.2740780115127563e+00 -2.5673000141978264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 6.3542999327182770e-02</internalNodes>
+          <leafValues>
+            1.2403500080108643e-01 -1.0776289701461792e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 2.1933000534772873e-02</internalNodes>
+          <leafValues>
+            1.4952000230550766e-02 -7.1023499965667725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 -7.8424997627735138e-02</internalNodes>
+          <leafValues>
+            6.2033998966217041e-01 3.3610999584197998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 1.4390000142157078e-02</internalNodes>
+          <leafValues>
+            -3.6324599385261536e-01 1.7308300733566284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -6.7309997975826263e-02</internalNodes>
+          <leafValues>
+            5.2374100685119629e-01 1.2799999676644802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 1.3047499954700470e-01</internalNodes>
+          <leafValues>
+            -1.7122499644756317e-01 1.1235200166702271e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 -4.6245999634265900e-02</internalNodes>
+          <leafValues>
+            -1.1908329725265503e+00 1.7425599694252014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -2.9842000454664230e-02</internalNodes>
+          <leafValues>
+            8.3930599689483643e-01 -1.8064199388027191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 -3.8099999073892832e-04</internalNodes>
+          <leafValues>
+            3.5532799363136292e-01 -2.3842300474643707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 -2.2378999739885330e-02</internalNodes>
+          <leafValues>
+            -8.7943899631500244e-01 -7.8399997437372804e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 -1.5569999814033508e-03</internalNodes>
+          <leafValues>
+            -1.4253300428390503e-01 2.5876200199127197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 1.2013000436127186e-02</internalNodes>
+          <leafValues>
+            -2.9015499353408813e-01 2.6051101088523865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 2.4384999647736549e-02</internalNodes>
+          <leafValues>
+            -3.1438998878002167e-02 5.8695900440216064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 -4.7180999070405960e-02</internalNodes>
+          <leafValues>
+            6.9430100917816162e-01 -2.1816100180149078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 -2.4893999099731445e-02</internalNodes>
+          <leafValues>
+            -6.4599299430847168e-01 1.5611599385738373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 2.1944999694824219e-02</internalNodes>
+          <leafValues>
+            -2.7742000296711922e-02 -1.1346880197525024e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 1.8809899687767029e-01</internalNodes>
+          <leafValues>
+            -1.0076000355184078e-02 1.2429029941558838e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 -7.7872000634670258e-02</internalNodes>
+          <leafValues>
+            8.5008001327514648e-01 -1.9015499949455261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 -4.8769000917673111e-02</internalNodes>
+          <leafValues>
+            -2.0763080120086670e+00 1.2179400026798248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 -1.7115000635385513e-02</internalNodes>
+          <leafValues>
+            -8.5687297582626343e-01 7.8760003671050072e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 -2.7499999850988388e-03</internalNodes>
+          <leafValues>
+            3.8645499944686890e-01 -1.1391499638557434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 -9.8793998360633850e-02</internalNodes>
+          <leafValues>
+            -1.7233899831771851e+00 -5.6063000112771988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 -2.1936999633908272e-02</internalNodes>
+          <leafValues>
+            5.4749399423599243e-01 -4.2481999844312668e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 6.1096999794244766e-02</internalNodes>
+          <leafValues>
+            -3.8945000618696213e-02 -1.0807880163192749e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 -2.4563999846577644e-02</internalNodes>
+          <leafValues>
+            5.8311098814010620e-01 -9.7599998116493225e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 3.3752001821994781e-02</internalNodes>
+          <leafValues>
+            -1.3795999810099602e-02 -8.4730297327041626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 3.8199000060558319e-02</internalNodes>
+          <leafValues>
+            1.5114299952983856e-01 -7.9473400115966797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 -2.0117999985814095e-02</internalNodes>
+          <leafValues>
+            5.1579099893569946e-01 -2.1445399522781372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 2.4734999984502792e-02</internalNodes>
+          <leafValues>
+            -2.2105000913143158e-02 4.2917698621749878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 -2.4357000365853310e-02</internalNodes>
+          <leafValues>
+            -8.6201298236846924e-01 -3.6760000512003899e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 -2.6442000642418861e-02</internalNodes>
+          <leafValues>
+            -4.5397499203681946e-01 2.2462800145149231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 -3.4429999068379402e-03</internalNodes>
+          <leafValues>
+            1.3073000311851501e-01 -3.8622701168060303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 1.0701700299978256e-01</internalNodes>
+          <leafValues>
+            1.3158600032329559e-01 -7.9306900501251221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 4.5152999460697174e-02</internalNodes>
+          <leafValues>
+            -2.5296801328659058e-01 4.0672400593757629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 4.4349998235702515e-02</internalNodes>
+          <leafValues>
+            2.2613000124692917e-02 7.9618102312088013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 1.0839999886229634e-03</internalNodes>
+          <leafValues>
+            -3.9158400893211365e-01 1.1639100313186646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 7.1433000266551971e-02</internalNodes>
+          <leafValues>
+            8.2466997206211090e-02 1.2530590295791626e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 3.5838000476360321e-02</internalNodes>
+          <leafValues>
+            -1.8203300237655640e-01 7.7078700065612793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -2.0839000120759010e-02</internalNodes>
+          <leafValues>
+            -6.1744397878646851e-01 1.5891399979591370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 4.2525801062583923e-01</internalNodes>
+          <leafValues>
+            -4.8978000879287720e-02 -1.8422030210494995e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 1.1408000253140926e-02</internalNodes>
+          <leafValues>
+            1.7918199300765991e-01 -1.5383499860763550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 -1.5364999882876873e-02</internalNodes>
+          <leafValues>
+            -8.4016501903533936e-01 -1.0280000278726220e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 -1.5212000347673893e-02</internalNodes>
+          <leafValues>
+            -1.8995699286460876e-01 1.7130999267101288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 -1.8972000107169151e-02</internalNodes>
+          <leafValues>
+            -7.9541999101638794e-01 6.6800001077353954e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 -3.3330000005662441e-03</internalNodes>
+          <leafValues>
+            -2.3530800640583038e-01 2.4730099737644196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 9.3248002231121063e-02</internalNodes>
+          <leafValues>
+            -5.4758001118898392e-02 -1.8324300050735474e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 -1.2555000372231007e-02</internalNodes>
+          <leafValues>
+            2.6385200023651123e-01 -3.8526400923728943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 -2.7070000767707825e-02</internalNodes>
+          <leafValues>
+            -6.6929799318313599e-01 2.0340999588370323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 -2.3677000775933266e-02</internalNodes>
+          <leafValues>
+            6.7265301942825317e-01 -1.4344000257551670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 -1.4275000430643559e-02</internalNodes>
+          <leafValues>
+            3.0186399817466736e-01 -2.8514400124549866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 2.8096999973058701e-02</internalNodes>
+          <leafValues>
+            1.4766000211238861e-01 -1.4078520536422729e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 5.0840001553297043e-02</internalNodes>
+          <leafValues>
+            -1.8613600730895996e-01 7.9953002929687500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 1.1505999602377415e-02</internalNodes>
+          <leafValues>
+            1.9118399918079376e-01 -8.5035003721714020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 -1.4661000110208988e-02</internalNodes>
+          <leafValues>
+            4.5239299535751343e-01 -2.2205199301242828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 2.2842499613761902e-01</internalNodes>
+          <leafValues>
+            1.3488399982452393e-01 -1.2894610166549683e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 1.1106900125741959e-01</internalNodes>
+          <leafValues>
+            -2.0753799378871918e-01 5.4561597108840942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 3.2450000289827585e-03</internalNodes>
+          <leafValues>
+            3.2053700089454651e-01 -1.6403500735759735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 8.5309997200965881e-02</internalNodes>
+          <leafValues>
+            -2.0210500061511993e-01 5.3296798467636108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 2.2048000246286392e-02</internalNodes>
+          <leafValues>
+            1.5698599815368652e-01 -1.7014099657535553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 -1.5676999464631081e-02</internalNodes>
+          <leafValues>
+            -6.2863498926162720e-01 4.0761999785900116e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 3.3112901449203491e-01</internalNodes>
+          <leafValues>
+            1.6609300673007965e-01 -1.0326379537582397e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 8.8470000773668289e-03</internalNodes>
+          <leafValues>
+            -2.5076198577880859e-01 3.1660598516464233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 4.6080000698566437e-02</internalNodes>
+          <leafValues>
+            1.5352100133895874e-01 -1.6333500146865845e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 -3.7703000009059906e-02</internalNodes>
+          <leafValues>
+            5.6873798370361328e-01 -2.0102599263191223e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>159</maxWeakCount>
+      <stageThreshold>-3.5939640998840332e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1246 -8.1808999180793762e-02</internalNodes>
+          <leafValues>
+            5.7124799489974976e-01 -6.7438799142837524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 2.1761199831962585e-01</internalNodes>
+          <leafValues>
+            -3.8610199093818665e-01 9.0343999862670898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 1.4878000132739544e-02</internalNodes>
+          <leafValues>
+            2.2241599857807159e-01 -1.2779350280761719e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 5.2434999495744705e-02</internalNodes>
+          <leafValues>
+            -2.8690400719642639e-01 7.5742298364639282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1250 9.1429995372891426e-03</internalNodes>
+          <leafValues>
+            -6.4880400896072388e-01 2.2268800437450409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 7.9169999808073044e-03</internalNodes>
+          <leafValues>
+            -2.9253599047660828e-01 3.1030198931694031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -2.6084000244736671e-02</internalNodes>
+          <leafValues>
+            4.5532700419425964e-01 -3.8500601053237915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 -2.9400000348687172e-03</internalNodes>
+          <leafValues>
+            -5.1264399290084839e-01 2.7432298660278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 5.7130001485347748e-02</internalNodes>
+          <leafValues>
+            1.5788000077009201e-02 -1.2133100032806396e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 -6.1309998854994774e-03</internalNodes>
+          <leafValues>
+            3.9174601435661316e-01 -3.0866798758506775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 -4.0405001491308212e-02</internalNodes>
+          <leafValues>
+            1.1901949644088745e+00 -2.0347100496292114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 -2.0297000184655190e-02</internalNodes>
+          <leafValues>
+            -6.8239498138427734e-01 2.0458699762821198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 -1.7188999801874161e-02</internalNodes>
+          <leafValues>
+            -8.4939897060394287e-01 3.8433000445365906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 -2.4215999990701675e-02</internalNodes>
+          <leafValues>
+            -1.1039420366287231e+00 1.5975099802017212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 5.6869000196456909e-02</internalNodes>
+          <leafValues>
+            -1.9595299661159515e-01 1.1806850433349609e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 3.6199999158270657e-04</internalNodes>
+          <leafValues>
+            -4.0847799181938171e-01 3.2938599586486816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 9.9790003150701523e-03</internalNodes>
+          <leafValues>
+            -2.9673001170158386e-01 4.1547900438308716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 -5.2625000476837158e-02</internalNodes>
+          <leafValues>
+            -1.3069299459457397e+00 1.7862600088119507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 -1.3748999685049057e-02</internalNodes>
+          <leafValues>
+            2.3665800690650940e-01 -4.4536599516868591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 -3.0517000705003738e-02</internalNodes>
+          <leafValues>
+            2.9018300771713257e-01 -1.1210100352764130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 -3.0037501454353333e-01</internalNodes>
+          <leafValues>
+            -2.4237680435180664e+00 -4.2830999940633774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 -3.5990998148918152e-02</internalNodes>
+          <leafValues>
+            8.8206499814987183e-01 -4.7012999653816223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 -5.5112000554800034e-02</internalNodes>
+          <leafValues>
+            8.0119001865386963e-01 -2.0490999519824982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 3.3762000501155853e-02</internalNodes>
+          <leafValues>
+            1.4617599546909332e-01 -1.1349489688873291e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 -8.2710003480315208e-03</internalNodes>
+          <leafValues>
+            -8.1604897975921631e-01 1.8988000229001045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 -5.4399999789893627e-03</internalNodes>
+          <leafValues>
+            -7.0980900526046753e-01 2.2343699634075165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 3.1059999018907547e-03</internalNodes>
+          <leafValues>
+            -7.2808599472045898e-01 4.0224999189376831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 5.3651999682188034e-02</internalNodes>
+          <leafValues>
+            1.7170900106430054e-01 -1.1163710355758667e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 -1.2541399896144867e-01</internalNodes>
+          <leafValues>
+            2.7680370807647705e+00 -1.4611500501632690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 9.2542000114917755e-02</internalNodes>
+          <leafValues>
+            1.1609800159931183e-01 -3.9635529518127441e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 3.8513999432325363e-02</internalNodes>
+          <leafValues>
+            -7.6399999670684338e-03 -9.8780900239944458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 -2.0200000144541264e-03</internalNodes>
+          <leafValues>
+            2.3059999942779541e-01 -7.4970299005508423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 9.7599998116493225e-03</internalNodes>
+          <leafValues>
+            -3.1137999892234802e-01 3.0287799239158630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 2.4095000699162483e-02</internalNodes>
+          <leafValues>
+            -4.9529999494552612e-02 5.2690100669860840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 -1.7982000485062599e-02</internalNodes>
+          <leafValues>
+            -1.1610640287399292e+00 -5.7000000961124897e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 -1.0555000044405460e-02</internalNodes>
+          <leafValues>
+            -2.7189099788665771e-01 2.3597699403762817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 -7.2889998555183411e-03</internalNodes>
+          <leafValues>
+            -5.4219102859497070e-01 8.1914000213146210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1283 2.3939000442624092e-02</internalNodes>
+          <leafValues>
+            1.7975799739360809e-01 -6.7049497365951538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 -1.8365999683737755e-02</internalNodes>
+          <leafValues>
+            6.2664300203323364e-01 -2.0970100164413452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 1.5715999528765678e-02</internalNodes>
+          <leafValues>
+            2.4193699657917023e-01 -1.0444309711456299e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 -4.8804000020027161e-02</internalNodes>
+          <leafValues>
+            -9.4060599803924561e-01 -3.7519999314099550e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 6.7130001261830330e-03</internalNodes>
+          <leafValues>
+            -7.5432002544403076e-02 6.1575299501419067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 9.7770001739263535e-03</internalNodes>
+          <leafValues>
+            3.9285000413656235e-02 -8.4810298681259155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 1.4744999818503857e-02</internalNodes>
+          <leafValues>
+            1.6968999803066254e-01 -5.0906401872634888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 9.7079001367092133e-02</internalNodes>
+          <leafValues>
+            -3.3103000372648239e-02 -1.2706379890441895e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 4.8285998404026031e-02</internalNodes>
+          <leafValues>
+            9.4329997897148132e-02 2.7203190326690674e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 9.7810002043843269e-03</internalNodes>
+          <leafValues>
+            -3.9533400535583496e-01 1.5363800525665283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 -3.9893999695777893e-02</internalNodes>
+          <leafValues>
+            -2.2767400741577148e-01 1.3913999497890472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 2.2848000749945641e-02</internalNodes>
+          <leafValues>
+            -2.7391999959945679e-01 3.4199500083923340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 6.7179999314248562e-03</internalNodes>
+          <leafValues>
+            -1.0874299705028534e-01 4.8125401139259338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 5.9599999338388443e-02</internalNodes>
+          <leafValues>
+            -4.9522001296281815e-02 -2.0117089748382568e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1297 6.9340001791715622e-03</internalNodes>
+          <leafValues>
+            1.5037499368190765e-01 -1.1271899938583374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 1.5757000073790550e-02</internalNodes>
+          <leafValues>
+            -2.0885000005364418e-02 -1.1651979684829712e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 -4.9690000712871552e-02</internalNodes>
+          <leafValues>
+            -8.0213499069213867e-01 1.4372299611568451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 5.2347000688314438e-02</internalNodes>
+          <leafValues>
+            -2.0836700499057770e-01 6.1677598953247070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 2.2430999204516411e-02</internalNodes>
+          <leafValues>
+            2.0305900275707245e-01 -7.5326198339462280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 4.1142001748085022e-02</internalNodes>
+          <leafValues>
+            -1.8118199706077576e-01 1.0033359527587891e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 -2.1632000803947449e-02</internalNodes>
+          <leafValues>
+            4.9998998641967773e-01 -3.4662999212741852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 -8.2808002829551697e-02</internalNodes>
+          <leafValues>
+            1.1711900234222412e+00 -1.8433600664138794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 8.5060000419616699e-03</internalNodes>
+          <leafValues>
+            -6.3225001096725464e-02 2.9024899005889893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 7.8905001282691956e-02</internalNodes>
+          <leafValues>
+            -2.3274500668048859e-01 5.9695798158645630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 -9.0207003057003021e-02</internalNodes>
+          <leafValues>
+            -8.2211899757385254e-01 1.7772200703620911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 -2.9269000515341759e-02</internalNodes>
+          <leafValues>
+            6.0860699415206909e-01 -2.1468900144100189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 6.9499998353421688e-03</internalNodes>
+          <leafValues>
+            -4.2665999382734299e-02 6.0512101650238037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 -8.0629996955394745e-03</internalNodes>
+          <leafValues>
+            -1.1508270502090454e+00 -2.7286000549793243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 1.9595999270677567e-02</internalNodes>
+          <leafValues>
+            -9.1880001127719879e-03 5.6857800483703613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 -1.4884999953210354e-02</internalNodes>
+          <leafValues>
+            3.7658798694610596e-01 -2.7149501442909241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 2.5217000395059586e-02</internalNodes>
+          <leafValues>
+            -9.9991001188755035e-02 2.4664700031280518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 -1.5855999663472176e-02</internalNodes>
+          <leafValues>
+            6.6826701164245605e-01 -2.0614700019359589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 2.9441000893712044e-02</internalNodes>
+          <leafValues>
+            1.5832200646400452e-01 -7.6060897111892700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 -8.5279997438192368e-03</internalNodes>
+          <leafValues>
+            3.8212299346923828e-01 -2.5407800078392029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 2.4421999230980873e-02</internalNodes>
+          <leafValues>
+            1.5105099976062775e-01 -2.8752899169921875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 -3.3886998891830444e-02</internalNodes>
+          <leafValues>
+            -6.8002802133560181e-01 3.4327000379562378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 -2.0810000132769346e-03</internalNodes>
+          <leafValues>
+            2.5413900613784790e-01 -2.6859098672866821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 3.0358999967575073e-02</internalNodes>
+          <leafValues>
+            -3.0842000618577003e-02 -1.1476809978485107e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 4.0210001170635223e-03</internalNodes>
+          <leafValues>
+            -3.5253798961639404e-01 2.9868099093437195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 2.7681000530719757e-02</internalNodes>
+          <leafValues>
+            -3.8148999214172363e-02 -1.3262039422988892e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 7.9039996489882469e-03</internalNodes>
+          <leafValues>
+            -2.3737000301480293e-02 7.0503002405166626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 4.4031001627445221e-02</internalNodes>
+          <leafValues>
+            1.0674899816513062e-01 -4.5261201262474060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 -3.2370999455451965e-02</internalNodes>
+          <leafValues>
+            4.6674901247024536e-01 -6.1546999961137772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 2.0933000370860100e-02</internalNodes>
+          <leafValues>
+            -2.8447899222373962e-01 4.3845599889755249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 2.5227999314665794e-02</internalNodes>
+          <leafValues>
+            -2.2537000477313995e-02 7.0389097929000854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 6.5520000644028187e-03</internalNodes>
+          <leafValues>
+            -3.2554900646209717e-01 2.4023699760437012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 -5.8557998389005661e-02</internalNodes>
+          <leafValues>
+            -1.2227720022201538e+00 1.1668799817562103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 3.1899999827146530e-02</internalNodes>
+          <leafValues>
+            -1.9305000081658363e-02 -1.0973169803619385e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 -3.0445000156760216e-02</internalNodes>
+          <leafValues>
+            6.5582501888275146e-01 7.5090996921062469e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 1.4933000318706036e-02</internalNodes>
+          <leafValues>
+            -5.2155798673629761e-01 1.1523099988698959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 -4.9008000642061234e-02</internalNodes>
+          <leafValues>
+            -7.8303998708724976e-01 1.6657200455665588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 8.3158999681472778e-02</internalNodes>
+          <leafValues>
+            -2.6879999786615372e-03 -8.5282301902770996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 2.3902999237179756e-02</internalNodes>
+          <leafValues>
+            -5.1010999828577042e-02 4.1999098658561707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 1.6428999602794647e-02</internalNodes>
+          <leafValues>
+            1.9232999533414841e-02 -6.5049099922180176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 -1.1838000267744064e-02</internalNodes>
+          <leafValues>
+            -6.2409800291061401e-01 1.5411199629306793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 -1.6799999866634607e-04</internalNodes>
+          <leafValues>
+            1.7589199542999268e-01 -3.4338700771331787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 1.9193999469280243e-02</internalNodes>
+          <leafValues>
+            4.3418999761343002e-02 7.9069197177886963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 -1.0032000020146370e-02</internalNodes>
+          <leafValues>
+            4.5648899674415588e-01 -2.2494800388813019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 -1.4004000462591648e-02</internalNodes>
+          <leafValues>
+            3.3570998907089233e-01 -4.8799999058246613e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 -1.0319899767637253e-01</internalNodes>
+          <leafValues>
+            -2.3378000259399414e+00 -5.8933001011610031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 -9.5697000622749329e-02</internalNodes>
+          <leafValues>
+            -6.6153901815414429e-01 2.0098599791526794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 -4.1480999439954758e-02</internalNodes>
+          <leafValues>
+            4.5939201116561890e-01 -2.2314099967479706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 2.4099999573081732e-03</internalNodes>
+          <leafValues>
+            -2.6898598670959473e-01 2.4922999739646912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 1.0724999755620956e-01</internalNodes>
+          <leafValues>
+            -1.8640199303627014e-01 7.2769802808761597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 3.1870000530034304e-03</internalNodes>
+          <leafValues>
+            -2.4608999490737915e-02 2.8643900156021118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 2.9167000204324722e-02</internalNodes>
+          <leafValues>
+            -3.4683000296354294e-02 -1.1162580251693726e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 1.1287000030279160e-02</internalNodes>
+          <leafValues>
+            6.3760001212358475e-03 6.6632097959518433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 -1.2001000344753265e-02</internalNodes>
+          <leafValues>
+            4.2420101165771484e-01 -2.6279801130294800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 -1.2695999816060066e-02</internalNodes>
+          <leafValues>
+            -2.1957000717520714e-02 1.8936799466609955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1352 2.4597000330686569e-02</internalNodes>
+          <leafValues>
+            -3.4963998943567276e-02 -1.0989320278167725e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 4.5953001827001572e-02</internalNodes>
+          <leafValues>
+            1.1109799891710281e-01 -2.9306049346923828e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 -2.7241000905632973e-02</internalNodes>
+          <leafValues>
+            2.9101699590682983e-01 -2.7407899498939514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 4.0063999593257904e-02</internalNodes>
+          <leafValues>
+            1.1877900362014771e-01 -6.2801802158355713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 2.3055000230669975e-02</internalNodes>
+          <leafValues>
+            1.4813800156116486e-01 -3.7007498741149902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 -2.3737000301480293e-02</internalNodes>
+          <leafValues>
+            -5.3724801540374756e-01 1.9358199834823608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1358 7.7522002160549164e-02</internalNodes>
+          <leafValues>
+            -6.0194000601768494e-02 -1.9489669799804688e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 -1.3345000334084034e-02</internalNodes>
+          <leafValues>
+            -4.5229598879814148e-01 1.8741500377655029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 -2.1719999611377716e-02</internalNodes>
+          <leafValues>
+            1.2144249677658081e+00 -1.5365800261497498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 -7.1474999189376831e-02</internalNodes>
+          <leafValues>
+            -2.3047130107879639e+00 1.0999900102615356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 -5.4999999701976776e-03</internalNodes>
+          <leafValues>
+            -7.1855199337005615e-01 2.0100999623537064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 2.6740999892354012e-02</internalNodes>
+          <leafValues>
+            7.3545001447200775e-02 9.8786002397537231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 -3.9407998323440552e-02</internalNodes>
+          <leafValues>
+            -1.2227380275726318e+00 -4.3506998568773270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 2.5888999924063683e-02</internalNodes>
+          <leafValues>
+            1.3409300148487091e-01 -1.1770780086517334e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 4.8925001174211502e-02</internalNodes>
+          <leafValues>
+            -3.0810000374913216e-02 -9.3479502201080322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 3.6892998963594437e-02</internalNodes>
+          <leafValues>
+            1.3333700597286224e-01 -1.4998290538787842e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1368 7.8929997980594635e-02</internalNodes>
+          <leafValues>
+            -1.4538800716400146e-01 1.5631790161132812e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 2.9006000608205795e-02</internalNodes>
+          <leafValues>
+            1.9383700191974640e-01 -6.7642802000045776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 6.3089998438954353e-03</internalNodes>
+          <leafValues>
+            -3.7465399503707886e-01 1.0857500135898590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 -6.5830998122692108e-02</internalNodes>
+          <leafValues>
+            8.1059402227401733e-01 3.0201999470591545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 -6.8965002894401550e-02</internalNodes>
+          <leafValues>
+            8.3772599697113037e-01 -1.7140999436378479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 -1.1669100075960159e-01</internalNodes>
+          <leafValues>
+            -9.4647198915481567e-01 1.3123199343681335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 -1.3060000492259860e-03</internalNodes>
+          <leafValues>
+            4.6007998287677765e-02 -5.2011597156524658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 -4.4558998197317123e-02</internalNodes>
+          <leafValues>
+            -1.9423669576644897e+00 1.3200700283050537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 5.1033001393079758e-02</internalNodes>
+          <leafValues>
+            -2.1480999886989594e-01 4.8673900961875916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 -3.1578000634908676e-02</internalNodes>
+          <leafValues>
+            5.9989798069000244e-01 7.9159997403621674e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 2.1020000800490379e-02</internalNodes>
+          <leafValues>
+            -2.2069500386714935e-01 5.4046201705932617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 -1.3824200630187988e-01</internalNodes>
+          <leafValues>
+            6.2957501411437988e-01 -2.1712999790906906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 5.2228998392820358e-02</internalNodes>
+          <leafValues>
+            -2.3360900580883026e-01 4.9760800600051880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 2.5884000584483147e-02</internalNodes>
+          <leafValues>
+            1.8041999638080597e-01 -2.2039200365543365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 -1.2138999998569489e-02</internalNodes>
+          <leafValues>
+            -6.9731897115707397e-01 1.5712000429630280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -2.4237999692559242e-02</internalNodes>
+          <leafValues>
+            3.4593299031257629e-01 7.1469999849796295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 -2.5272000581026077e-02</internalNodes>
+          <leafValues>
+            -8.7583297491073608e-01 -9.8240002989768982e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 1.2597000226378441e-02</internalNodes>
+          <leafValues>
+            2.3649999499320984e-01 -2.8731200098991394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 5.7330999523401260e-02</internalNodes>
+          <leafValues>
+            -6.1530999839305878e-02 -2.2326040267944336e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 1.6671000048518181e-02</internalNodes>
+          <leafValues>
+            -1.9850100576877594e-01 4.0810701251029968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 -2.2818999364972115e-02</internalNodes>
+          <leafValues>
+            9.6487599611282349e-01 -2.0245699584484100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 3.7000001611886546e-05</internalNodes>
+          <leafValues>
+            -5.8908998966217041e-02 2.7055400609970093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 -7.6700001955032349e-03</internalNodes>
+          <leafValues>
+            -4.5317101478576660e-01 8.9628003537654877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 9.4085998833179474e-02</internalNodes>
+          <leafValues>
+            1.1604599654674530e-01 -1.0951169729232788e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 -6.2267001718282700e-02</internalNodes>
+          <leafValues>
+            1.8096530437469482e+00 -1.4773200452327728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 1.7416000366210938e-02</internalNodes>
+          <leafValues>
+            2.3068200051784515e-01 -4.2417600750923157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1394 -2.2066000849008560e-02</internalNodes>
+          <leafValues>
+            4.9270299077033997e-01 -2.0630900561809540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 -1.0404000058770180e-02</internalNodes>
+          <leafValues>
+            6.0924297571182251e-01 2.8130000457167625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 -9.3670003116130829e-03</internalNodes>
+          <leafValues>
+            4.0171200037002563e-01 -2.1681700646877289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 -2.9039999470114708e-02</internalNodes>
+          <leafValues>
+            -8.4876501560211182e-01 1.4246800541877747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 -2.1061999723315239e-02</internalNodes>
+          <leafValues>
+            -7.9198300838470459e-01 -1.2595999985933304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 -3.7000998854637146e-02</internalNodes>
+          <leafValues>
+            -6.7488902807235718e-01 1.2830400466918945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 1.0735999792814255e-02</internalNodes>
+          <leafValues>
+            3.6779999732971191e-02 -6.3393002748489380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 1.6367599368095398e-01</internalNodes>
+          <leafValues>
+            1.3803899288177490e-01 -4.7189000248908997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 9.4917997717857361e-02</internalNodes>
+          <leafValues>
+            -1.3855700194835663e-01 1.9492419958114624e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1403 3.5261999815702438e-02</internalNodes>
+          <leafValues>
+            1.3721899688243866e-01 -2.1186530590057373e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 1.2811000458896160e-02</internalNodes>
+          <leafValues>
+            -2.0008100569248199e-01 4.9507799744606018e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>155</maxWeakCount>
+      <stageThreshold>-3.3933560848236084e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1405 1.3904400169849396e-01</internalNodes>
+          <leafValues>
+            -4.6581199765205383e-01 7.6431602239608765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 1.1916999705135822e-02</internalNodes>
+          <leafValues>
+            -9.4398999214172363e-01 3.9726299047470093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 -1.0006999596953392e-02</internalNodes>
+          <leafValues>
+            3.2718798518180847e-01 -6.3367402553558350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 -6.0479999519884586e-03</internalNodes>
+          <leafValues>
+            2.7427899837493896e-01 -5.7446998357772827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 -1.2489999644458294e-03</internalNodes>
+          <leafValues>
+            2.3629300296306610e-01 -6.8593502044677734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 3.2382000237703323e-02</internalNodes>
+          <leafValues>
+            -5.7630199193954468e-01 2.7492699027061462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 -1.3957999646663666e-02</internalNodes>
+          <leafValues>
+            -6.1061501502990723e-01 2.4541600048542023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 1.1159999994561076e-03</internalNodes>
+          <leafValues>
+            -5.6539100408554077e-01 2.7179300785064697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 2.7000000045518391e-05</internalNodes>
+          <leafValues>
+            -8.0235999822616577e-01 1.1509100347757339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 -2.5700000696815550e-04</internalNodes>
+          <leafValues>
+            -8.1205898523330688e-01 2.3844699561595917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 4.0460000745952129e-03</internalNodes>
+          <leafValues>
+            1.3909600675106049e-01 -6.6163200139999390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 1.4356000348925591e-02</internalNodes>
+          <leafValues>
+            -1.6485199332237244e-01 4.1901698708534241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 -5.5374998599290848e-02</internalNodes>
+          <leafValues>
+            1.4425870180130005e+00 -1.8820199370384216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 9.3594998121261597e-02</internalNodes>
+          <leafValues>
+            1.3548299670219421e-01 -9.1636097431182861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 2.6624999940395355e-02</internalNodes>
+          <leafValues>
+            -3.3748298883438110e-01 3.9233601093292236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 3.7469998933374882e-03</internalNodes>
+          <leafValues>
+            -1.1615400016307831e-01 4.4399300217628479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 -3.1886000186204910e-02</internalNodes>
+          <leafValues>
+            -9.9498301744461060e-01 1.6120000509545207e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 -2.2600000724196434e-02</internalNodes>
+          <leafValues>
+            -4.8067399859428406e-01 1.7007300257682800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 2.5202000513672829e-02</internalNodes>
+          <leafValues>
+            3.5580001771450043e-02 -8.0215400457382202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 -3.1036999076604843e-02</internalNodes>
+          <leafValues>
+            -1.0895340442657471e+00 1.8081900477409363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 -2.6475999504327774e-02</internalNodes>
+          <leafValues>
+            9.5671200752258301e-01 -2.1049399673938751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 -1.3853999786078930e-02</internalNodes>
+          <leafValues>
+            -1.0370320081710815e+00 2.2166700661182404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -6.2925003468990326e-02</internalNodes>
+          <leafValues>
+            9.0199398994445801e-01 -1.9085299968719482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 -4.4750999659299850e-02</internalNodes>
+          <leafValues>
+            -1.0119110345840454e+00 1.4691199362277985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 -2.0428000018000603e-02</internalNodes>
+          <leafValues>
+            6.1624497175216675e-01 -2.3552699387073517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 -8.0329999327659607e-03</internalNodes>
+          <leafValues>
+            -8.3279997110366821e-02 2.1728700399398804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 8.7280003353953362e-03</internalNodes>
+          <leafValues>
+            6.5458998084068298e-02 -6.0318702459335327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 -2.7202000841498375e-02</internalNodes>
+          <leafValues>
+            -9.3447399139404297e-01 1.5270000696182251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 -1.6471000388264656e-02</internalNodes>
+          <leafValues>
+            -8.4177100658416748e-01 1.3332000002264977e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 -1.3744000345468521e-02</internalNodes>
+          <leafValues>
+            6.0567200183868408e-01 -9.2021003365516663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 2.9164999723434448e-02</internalNodes>
+          <leafValues>
+            -2.8114000335335732e-02 -1.4014569520950317e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 3.7457000464200974e-02</internalNodes>
+          <leafValues>
+            1.3080599904060364e-01 -4.9382498860359192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 -2.5070000439882278e-02</internalNodes>
+          <leafValues>
+            -1.1289390325546265e+00 -1.4600000344216824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 -6.3812002539634705e-02</internalNodes>
+          <leafValues>
+            7.5871598720550537e-01 -1.8200000049546361e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 -9.3900002539157867e-03</internalNodes>
+          <leafValues>
+            2.9936400055885315e-01 -2.9487800598144531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 -7.6000002445653081e-04</internalNodes>
+          <leafValues>
+            1.9725000485777855e-02 1.9993899762630463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 -2.1740999072790146e-02</internalNodes>
+          <leafValues>
+            -8.5247898101806641e-01 4.9169998615980148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 -1.7869999632239342e-02</internalNodes>
+          <leafValues>
+            -5.9985999017953873e-02 1.5222500264644623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 -2.4831000715494156e-02</internalNodes>
+          <leafValues>
+            3.5603401064872742e-01 -2.6259899139404297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 1.5715500712394714e-01</internalNodes>
+          <leafValues>
+            1.5599999460391700e-04 1.0428730249404907e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 6.9026999175548553e-02</internalNodes>
+          <leafValues>
+            -3.3006999641656876e-02 -1.1796669960021973e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 -1.1021999642252922e-02</internalNodes>
+          <leafValues>
+            5.8987700939178467e-01 -5.7647999376058578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 -1.3834999874234200e-02</internalNodes>
+          <leafValues>
+            5.9502798318862915e-01 -2.4418599903583527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 -3.0941000208258629e-02</internalNodes>
+          <leafValues>
+            -1.1723799705505371e+00 1.6907000541687012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 2.1258000284433365e-02</internalNodes>
+          <leafValues>
+            -1.8900999799370766e-02 -1.0684759616851807e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 9.3079999089241028e-02</internalNodes>
+          <leafValues>
+            1.6305600106716156e-01 -1.3375270366668701e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 2.9635999351739883e-02</internalNodes>
+          <leafValues>
+            -2.2524799406528473e-01 4.5400100946426392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 -1.2199999764561653e-04</internalNodes>
+          <leafValues>
+            2.7409100532531738e-01 -3.7371399998664856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -4.2098000645637512e-02</internalNodes>
+          <leafValues>
+            -7.5828802585601807e-01 1.7137000337243080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 -2.2505000233650208e-02</internalNodes>
+          <leafValues>
+            -2.2759300470352173e-01 2.3698699474334717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 -1.2862999923527241e-02</internalNodes>
+          <leafValues>
+            1.9252400100231171e-01 -3.2127100229263306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 2.7860000729560852e-02</internalNodes>
+          <leafValues>
+            1.6723699867725372e-01 -1.0209059715270996e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 -2.7807999402284622e-02</internalNodes>
+          <leafValues>
+            1.2824759483337402e+00 -1.7225299775600433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 -6.1630001291632652e-03</internalNodes>
+          <leafValues>
+            -5.4072898626327515e-01 2.3885700106620789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 -2.0436000078916550e-02</internalNodes>
+          <leafValues>
+            6.3355398178100586e-01 -2.1090599894523621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 -1.2307999655604362e-02</internalNodes>
+          <leafValues>
+            -4.9778199195861816e-01 1.7402599751949310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 -4.0493998676538467e-02</internalNodes>
+          <leafValues>
+            -1.1848740577697754e+00 -3.3890999853610992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 2.9657000675797462e-02</internalNodes>
+          <leafValues>
+            2.1740999072790146e-02 1.0069919824600220e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 6.8379999138414860e-03</internalNodes>
+          <leafValues>
+            2.9217999428510666e-02 -5.9906297922134399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1464 1.6164999455213547e-02</internalNodes>
+          <leafValues>
+            -2.1000799536705017e-01 3.7637299299240112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1465 5.0193000584840775e-02</internalNodes>
+          <leafValues>
+            2.5319999549537897e-03 -7.1668201684951782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1466 1.9680000841617584e-03</internalNodes>
+          <leafValues>
+            -2.1921400725841522e-01 3.2298699021339417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1467 2.4979999288916588e-02</internalNodes>
+          <leafValues>
+            -9.6840001642704010e-03 -7.7572900056838989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1468 -1.5809999778866768e-02</internalNodes>
+          <leafValues>
+            4.4637501239776611e-01 -6.1760000884532928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1469 3.7206999957561493e-02</internalNodes>
+          <leafValues>
+            -2.0495399832725525e-01 5.7722198963165283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1470 -7.9264998435974121e-02</internalNodes>
+          <leafValues>
+            -7.6745402812957764e-01 1.2550400197505951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1471 -1.7152000218629837e-02</internalNodes>
+          <leafValues>
+            -1.4121830463409424e+00 -5.1704000681638718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1472 3.2740000635385513e-02</internalNodes>
+          <leafValues>
+            1.9334000349044800e-01 -6.3633698225021362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1473 -1.1756999790668488e-01</internalNodes>
+          <leafValues>
+            8.4325402975082397e-01 -1.8018600344657898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1474 1.2057200074195862e-01</internalNodes>
+          <leafValues>
+            1.2530000507831573e-01 -2.1213600635528564e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1475 4.2779999785125256e-03</internalNodes>
+          <leafValues>
+            -4.6604400873184204e-01 8.9643999934196472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1476 -7.2544999420642853e-02</internalNodes>
+          <leafValues>
+            5.1826500892639160e-01 1.6823999583721161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1477 1.7710599303245544e-01</internalNodes>
+          <leafValues>
+            -3.0910000205039978e-02 -1.1046639680862427e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1478 8.4229996427893639e-03</internalNodes>
+          <leafValues>
+            2.4445800483226776e-01 -3.8613098859786987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1479 -1.3035000301897526e-02</internalNodes>
+          <leafValues>
+            9.8004400730133057e-01 -1.7016500234603882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1480 1.8912000581622124e-02</internalNodes>
+          <leafValues>
+            2.0248499512672424e-01 -3.8545900583267212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1481 2.1447999402880669e-02</internalNodes>
+          <leafValues>
+            -2.5717198848724365e-01 3.5181200504302979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1482 6.3357003033161163e-02</internalNodes>
+          <leafValues>
+            1.6994799673557281e-01 -9.1383802890777588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1483 -3.2435998320579529e-02</internalNodes>
+          <leafValues>
+            -8.5681599378585815e-01 -2.1680999547243118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1484 -2.3564999923110008e-02</internalNodes>
+          <leafValues>
+            5.6115597486495972e-01 -2.2400000307243317e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1485 1.8789000809192657e-02</internalNodes>
+          <leafValues>
+            -2.5459799170494080e-01 3.4512901306152344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1486 3.1042000278830528e-02</internalNodes>
+          <leafValues>
+            7.5719999149441719e-03 3.4800198674201965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1487 -1.1226999573409557e-02</internalNodes>
+          <leafValues>
+            -6.0219800472259521e-01 4.2814999818801880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1488 -1.2845999561250210e-02</internalNodes>
+          <leafValues>
+            4.2020401358604431e-01 -5.3801000118255615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1489 -1.2791999615728855e-02</internalNodes>
+          <leafValues>
+            2.2724500298500061e-01 -3.2398000359535217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1490 6.8651996552944183e-02</internalNodes>
+          <leafValues>
+            9.3532003462314606e-02 10.</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1491 5.2789999172091484e-03</internalNodes>
+          <leafValues>
+            -2.6926299929618835e-01 3.3303201198577881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1492 -3.8779001682996750e-02</internalNodes>
+          <leafValues>
+            -7.2365301847457886e-01 1.7806500196456909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1493 6.1820000410079956e-03</internalNodes>
+          <leafValues>
+            -3.5119399428367615e-01 1.6586300730705261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1494 1.7515200376510620e-01</internalNodes>
+          <leafValues>
+            1.1623100191354752e-01 -1.5419290065765381e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1495 1.1627999693155289e-01</internalNodes>
+          <leafValues>
+            -9.1479998081922531e-03 -9.9842602014541626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1496 -2.2964000701904297e-02</internalNodes>
+          <leafValues>
+            2.0565399527549744e-01 1.5432000160217285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1497 -5.1410000771284103e-02</internalNodes>
+          <leafValues>
+            5.8072400093078613e-01 -2.0118400454521179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1498 2.2474199533462524e-01</internalNodes>
+          <leafValues>
+            1.8728999421000481e-02 1.0829299688339233e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1499 9.4860000535845757e-03</internalNodes>
+          <leafValues>
+            -3.3171299099922180e-01 1.9902999699115753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1500 -1.1846300214529037e-01</internalNodes>
+          <leafValues>
+            1.3711010217666626e+00 6.8926997482776642e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1501 3.7810999900102615e-02</internalNodes>
+          <leafValues>
+            -9.3600002583116293e-04 -8.3996999263763428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1502 2.2202000021934509e-02</internalNodes>
+          <leafValues>
+            -1.1963999830186367e-02 3.6673998832702637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1503 -3.6366000771522522e-02</internalNodes>
+          <leafValues>
+            3.7866500020027161e-01 -2.7714800834655762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1504 -1.3184699416160583e-01</internalNodes>
+          <leafValues>
+            -2.7481179237365723e+00 1.0666900128126144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1505 -4.1655998677015305e-02</internalNodes>
+          <leafValues>
+            4.7524300217628479e-01 -2.3249800503253937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1506 -3.3151999115943909e-02</internalNodes>
+          <leafValues>
+            -5.7929402589797974e-01 1.7434400320053101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1507 1.5769999474287033e-02</internalNodes>
+          <leafValues>
+            -1.1284000240266323e-02 -8.3701401948928833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1508 -3.9363000541925430e-02</internalNodes>
+          <leafValues>
+            3.4821599721908569e-01 -1.7455400526523590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1509 -6.7849002778530121e-02</internalNodes>
+          <leafValues>
+            1.4225699901580811e+00 -1.4765599370002747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1510 -2.6775000616908073e-02</internalNodes>
+          <leafValues>
+            2.3947000503540039e-01 1.3271999545395374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1511 3.9919000118970871e-02</internalNodes>
+          <leafValues>
+            -8.9999996125698090e-03 -7.5938898324966431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1512 1.0065600275993347e-01</internalNodes>
+          <leafValues>
+            -1.8685000017285347e-02 7.6245301961898804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1513 -8.1022001802921295e-02</internalNodes>
+          <leafValues>
+            -9.0439099073410034e-01 -8.5880002006888390e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1514 -2.1258000284433365e-02</internalNodes>
+          <leafValues>
+            -2.1319599449634552e-01 2.1919700503349304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1515 -1.0630999691784382e-02</internalNodes>
+          <leafValues>
+            1.9598099589347839e-01 -3.5768100619316101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1516 8.1300002057105303e-04</internalNodes>
+          <leafValues>
+            -9.2794999480247498e-02 2.6145899295806885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1517 3.4650000743567944e-03</internalNodes>
+          <leafValues>
+            -5.5336099863052368e-01 2.7386000379920006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1518 1.8835999071598053e-02</internalNodes>
+          <leafValues>
+            1.8446099758148193e-01 -6.6934299468994141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1519 -2.5631999596953392e-02</internalNodes>
+          <leafValues>
+            1.9382879734039307e+00 -1.4708900451660156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1520 -4.0939999744296074e-03</internalNodes>
+          <leafValues>
+            -2.6451599597930908e-01 2.0733200013637543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1521 -8.9199998183175921e-04</internalNodes>
+          <leafValues>
+            -5.5031597614288330e-01 5.0374999642372131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1522 -4.9518000334501266e-02</internalNodes>
+          <leafValues>
+            -2.5615389347076416e+00 1.3141700625419617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1523 1.1680999770760536e-02</internalNodes>
+          <leafValues>
+            -2.4819800257682800e-01 3.9982700347900391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1524 3.4563999623060226e-02</internalNodes>
+          <leafValues>
+            1.6178800165653229e-01 -7.1418899297714233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1525 -8.2909995689988136e-03</internalNodes>
+          <leafValues>
+            2.2180099785327911e-01 -2.9181700944900513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1526 -2.2358000278472900e-02</internalNodes>
+          <leafValues>
+            3.1044098734855652e-01 -2.7280000504106283e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1527 -3.0801000073552132e-02</internalNodes>
+          <leafValues>
+            -9.5672702789306641e-01 -8.3400001749396324e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1528 4.3779000639915466e-02</internalNodes>
+          <leafValues>
+            1.2556900084018707e-01 -1.1759619712829590e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1529 4.3046001344919205e-02</internalNodes>
+          <leafValues>
+            -5.8876998722553253e-02 -1.8568470478057861e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1530 2.7188999578356743e-02</internalNodes>
+          <leafValues>
+            4.2858000844717026e-02 3.9036700129508972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1531 9.4149997457861900e-03</internalNodes>
+          <leafValues>
+            -4.3567001819610596e-02 -1.1094470024108887e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1532 9.4311997294425964e-02</internalNodes>
+          <leafValues>
+            4.0256999433040619e-02 9.8442298173904419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1533 1.7025099694728851e-01</internalNodes>
+          <leafValues>
+            2.9510000720620155e-02 -6.9509297609329224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1534 -4.7148000448942184e-02</internalNodes>
+          <leafValues>
+            1.0338569879531860e+00 6.7602001130580902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1535 1.1186300218105316e-01</internalNodes>
+          <leafValues>
+            -6.8682998418807983e-02 -2.4985830783843994e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1536 -1.4353999868035316e-02</internalNodes>
+          <leafValues>
+            -5.9481900930404663e-01 1.5001699328422546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1537 3.4024000167846680e-02</internalNodes>
+          <leafValues>
+            -6.4823001623153687e-02 -2.1382639408111572e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1538 2.1601999178528786e-02</internalNodes>
+          <leafValues>
+            5.5309999734163284e-02 7.8292900323867798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1539 2.1771999076008797e-02</internalNodes>
+          <leafValues>
+            -7.1279997937381268e-03 -7.2148102521896362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1540 8.2416996359825134e-02</internalNodes>
+          <leafValues>
+            1.4609499275684357e-01 -1.3636670112609863e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1541 8.4671996533870697e-02</internalNodes>
+          <leafValues>
+            -1.7784699797630310e-01 7.2857701778411865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1542 -5.5128000676631927e-02</internalNodes>
+          <leafValues>
+            -5.9402400255203247e-01 1.9357800483703613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1543 -6.4823001623153687e-02</internalNodes>
+          <leafValues>
+            -1.0783840417861938e+00 -4.0734000504016876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1544 -2.2769000381231308e-02</internalNodes>
+          <leafValues>
+            7.7900201082229614e-01 3.4960000775754452e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1545 5.4756000638008118e-02</internalNodes>
+          <leafValues>
+            -6.5683998167514801e-02 -1.8188409805297852e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1546 -8.9000001025851816e-05</internalNodes>
+          <leafValues>
+            -1.7891999334096909e-02 2.0768299698829651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1547 9.8361998796463013e-02</internalNodes>
+          <leafValues>
+            -5.5946998298168182e-02 -1.4153920412063599e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1548 -7.0930002257227898e-03</internalNodes>
+          <leafValues>
+            3.4135299921035767e-01 -1.2089899927377701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1549 5.0278000533580780e-02</internalNodes>
+          <leafValues>
+            -2.6286700367927551e-01 2.5797298550605774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1550 -5.7870000600814819e-03</internalNodes>
+          <leafValues>
+            -1.3178600370883942e-01 1.7350199818611145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1551 1.3973999768495560e-02</internalNodes>
+          <leafValues>
+            2.8518000617623329e-02 -6.1152201890945435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1552 2.1449999883770943e-02</internalNodes>
+          <leafValues>
+            2.6181999593973160e-02 3.0306598544120789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1553 -2.9214000329375267e-02</internalNodes>
+          <leafValues>
+            4.4940599799156189e-01 -2.2803099453449249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1554 4.8099999548867345e-04</internalNodes>
+          <leafValues>
+            -1.9879999756813049e-01 2.0744499564170837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1555 1.7109999898821115e-03</internalNodes>
+          <leafValues>
+            -5.4037201404571533e-01 6.7865997552871704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1556 8.6660003289580345e-03</internalNodes>
+          <leafValues>
+            -1.3128000311553478e-02 5.2297902107238770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1557 6.3657999038696289e-02</internalNodes>
+          <leafValues>
+            6.8299002945423126e-02 -4.9235099554061890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1558 -2.7968000620603561e-02</internalNodes>
+          <leafValues>
+            6.8183898925781250e-01 7.8781001269817352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1559 4.8953998833894730e-02</internalNodes>
+          <leafValues>
+            -2.0622399449348450e-01 5.0388097763061523e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>169</maxWeakCount>
+      <stageThreshold>-3.2396929264068604e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1560 -2.9312999919056892e-02</internalNodes>
+          <leafValues>
+            7.1284699440002441e-01 -5.8230698108673096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1561 1.2415099889039993e-01</internalNodes>
+          <leafValues>
+            -3.6863499879837036e-01 6.0067200660705566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1562 7.9349996522068977e-03</internalNodes>
+          <leafValues>
+            -8.6008298397064209e-01 2.1724699437618256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1563 3.0365999788045883e-02</internalNodes>
+          <leafValues>
+            -2.7186998724937439e-01 6.1247897148132324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1564 2.5218000635504723e-02</internalNodes>
+          <leafValues>
+            -3.4748300909996033e-01 5.0427699089050293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1565 1.0014000348746777e-02</internalNodes>
+          <leafValues>
+            -3.1898999214172363e-01 4.1376799345016479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1566 -1.6775000840425491e-02</internalNodes>
+          <leafValues>
+            -6.9048100709915161e-01 9.4830997288227081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1567 -2.6950000319629908e-03</internalNodes>
+          <leafValues>
+            -2.0829799771308899e-01 2.3737199604511261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1568 4.2257998138666153e-02</internalNodes>
+          <leafValues>
+            -4.9366700649261475e-01 1.8170599639415741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1569 -4.8505000770092010e-02</internalNodes>
+          <leafValues>
+            1.3429640531539917e+00 3.9769001305103302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1570 2.8992999345064163e-02</internalNodes>
+          <leafValues>
+            4.6496000140905380e-02 -8.1643497943878174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1571 -4.0089000016450882e-02</internalNodes>
+          <leafValues>
+            -7.1197801828384399e-01 2.2553899884223938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1572 -4.1021998971700668e-02</internalNodes>
+          <leafValues>
+            1.0057929754257202e+00 -1.9690200686454773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1573 1.1838000267744064e-02</internalNodes>
+          <leafValues>
+            -1.2600000016391277e-02 8.0767101049423218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1574 -2.1328000351786613e-02</internalNodes>
+          <leafValues>
+            -8.2023900747299194e-01 2.0524999126791954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1575 -2.3904999718070030e-02</internalNodes>
+          <leafValues>
+            5.4210501909255981e-01 -7.4767000973224640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1576 1.8008999526500702e-02</internalNodes>
+          <leafValues>
+            -3.3827701210975647e-01 4.2358601093292236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1577 -4.3614000082015991e-02</internalNodes>
+          <leafValues>
+            -1.1983489990234375e+00 1.5566200017929077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1578 -9.2449998483061790e-03</internalNodes>
+          <leafValues>
+            -8.9029997587203979e-01 1.1003999970853329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1579 4.7485001385211945e-02</internalNodes>
+          <leafValues>
+            1.6664099693298340e-01 -9.0764498710632324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1580 -1.4233999885618687e-02</internalNodes>
+          <leafValues>
+            6.2695199251174927e-01 -2.5791200995445251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1581 3.8010000716894865e-03</internalNodes>
+          <leafValues>
+            -2.8229999542236328e-01 2.6624599099159241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1582 3.4330000635236502e-03</internalNodes>
+          <leafValues>
+            -6.3771998882293701e-01 9.8422996699810028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1583 -2.9221000149846077e-02</internalNodes>
+          <leafValues>
+            -7.6769900321960449e-01 2.2634500265121460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1584 -6.4949998632073402e-03</internalNodes>
+          <leafValues>
+            4.5600101351737976e-01 -2.6528900861740112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1585 -3.0034000054001808e-02</internalNodes>
+          <leafValues>
+            -7.6551097631454468e-01 1.4009299874305725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1586 7.8360000625252724e-03</internalNodes>
+          <leafValues>
+            4.6755999326705933e-02 -7.2356200218200684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1587 8.8550001382827759e-03</internalNodes>
+          <leafValues>
+            -4.9141999334096909e-02 5.1472699642181396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1588 9.5973998308181763e-02</internalNodes>
+          <leafValues>
+            -2.0068999379873276e-02 -1.0850950479507446e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1589 -3.2876998186111450e-02</internalNodes>
+          <leafValues>
+            -9.5875298976898193e-01 1.4543600380420685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1590 -1.3384000398218632e-02</internalNodes>
+          <leafValues>
+            -7.0013600587844849e-01 2.9157999902963638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1591 1.5235999599099159e-02</internalNodes>
+          <leafValues>
+            -2.8235700726509094e-01 2.5367999076843262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1592 1.2054000049829483e-02</internalNodes>
+          <leafValues>
+            -2.5303399562835693e-01 4.6526700258255005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1593 -7.6295003294944763e-02</internalNodes>
+          <leafValues>
+            -6.9915801286697388e-01 1.3217200338840485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1594 -1.2040000408887863e-02</internalNodes>
+          <leafValues>
+            4.5894598960876465e-01 -2.3856499791145325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1595 2.1916000172495842e-02</internalNodes>
+          <leafValues>
+            1.8268600106239319e-01 -6.1629700660705566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1596 -2.7330000884830952e-03</internalNodes>
+          <leafValues>
+            -6.3257902860641479e-01 3.4219000488519669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1597 -4.8652000725269318e-02</internalNodes>
+          <leafValues>
+            -1.0297729969024658e+00 1.7386500537395477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1598 -1.0463999584317207e-02</internalNodes>
+          <leafValues>
+            3.4757301211357117e-01 -2.7464100718498230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1599 -6.6550001502037048e-03</internalNodes>
+          <leafValues>
+            -2.8980299830436707e-01 2.4037900567054749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1600 8.5469996556639671e-03</internalNodes>
+          <leafValues>
+            -4.4340500235557556e-01 1.4267399907112122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1601 1.9913999363780022e-02</internalNodes>
+          <leafValues>
+            1.7740400135517120e-01 -2.4096299707889557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1602 2.2012999281287193e-02</internalNodes>
+          <leafValues>
+            -1.0812000371515751e-02 -9.4690799713134766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1603 -5.2179001271724701e-02</internalNodes>
+          <leafValues>
+            1.6547499895095825e+00 9.6487000584602356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1604 1.9698999822139740e-02</internalNodes>
+          <leafValues>
+            -6.7560002207756042e-03 -8.6311501264572144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1605 2.3040000349283218e-02</internalNodes>
+          <leafValues>
+            -2.3519999813288450e-03 3.8531300425529480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1606 -1.5038000419735909e-02</internalNodes>
+          <leafValues>
+            -6.1905699968338013e-01 3.1077999621629715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1607 -4.9956001341342926e-02</internalNodes>
+          <leafValues>
+            7.0657497644424438e-01 4.7880999743938446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1608 -6.9269999861717224e-02</internalNodes>
+          <leafValues>
+            3.9212900400161743e-01 -2.3848000168800354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1609 4.7399997711181641e-03</internalNodes>
+          <leafValues>
+            -2.4309000000357628e-02 2.5386300683021545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1610 -3.3923998475074768e-02</internalNodes>
+          <leafValues>
+            4.6930399537086487e-01 -2.3321899771690369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1611 -1.6231000423431396e-02</internalNodes>
+          <leafValues>
+            3.2319200038909912e-01 -2.0545600354671478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1612 -5.0193000584840775e-02</internalNodes>
+          <leafValues>
+            -1.2277870178222656e+00 -4.0798000991344452e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1613 5.6944001466035843e-02</internalNodes>
+          <leafValues>
+            4.5184001326560974e-02 6.0197502374649048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1614 4.0936999022960663e-02</internalNodes>
+          <leafValues>
+            -1.6772800683975220e-01 8.9819300174713135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1615 -3.0839999672025442e-03</internalNodes>
+          <leafValues>
+            3.3716198801994324e-01 -2.7240800857543945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1616 -3.2600000500679016e-02</internalNodes>
+          <leafValues>
+            -8.5446500778198242e-01 1.9664999097585678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1617 9.8480999469757080e-02</internalNodes>
+          <leafValues>
+            5.4742000997066498e-02 6.3827300071716309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1618 -3.8185000419616699e-02</internalNodes>
+          <leafValues>
+            5.2274698019027710e-01 -2.3384800553321838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1619 -4.5917000621557236e-02</internalNodes>
+          <leafValues>
+            6.2829202413558960e-01 3.2859001308679581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1620 -1.1955499649047852e-01</internalNodes>
+          <leafValues>
+            -6.1572700738906860e-01 3.4680001437664032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1621 -1.2044399976730347e-01</internalNodes>
+          <leafValues>
+            -8.4380000829696655e-01 1.6530700027942657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1622 7.0619001984596252e-02</internalNodes>
+          <leafValues>
+            -6.3261002302169800e-02 -1.9863929748535156e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1623 8.4889996796846390e-03</internalNodes>
+          <leafValues>
+            -1.7663399875164032e-01 3.8011199235916138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1624 2.2710999473929405e-02</internalNodes>
+          <leafValues>
+            -2.7605999261140823e-02 -9.1921401023864746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1625 4.9700000090524554e-04</internalNodes>
+          <leafValues>
+            -2.4293200671672821e-01 2.2878900170326233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1626 3.4651998430490494e-02</internalNodes>
+          <leafValues>
+            -2.3705999553203583e-01 5.4010999202728271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1627 -4.4700000435113907e-03</internalNodes>
+          <leafValues>
+            3.9078998565673828e-01 -1.2693800032138824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1628 2.3643000051379204e-02</internalNodes>
+          <leafValues>
+            -2.6663699746131897e-01 3.2312598824501038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1629 1.2813000008463860e-02</internalNodes>
+          <leafValues>
+            1.7540800571441650e-01 -6.0787999629974365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1630 -1.1250999756157398e-02</internalNodes>
+          <leafValues>
+            -1.0852589607238770e+00 -2.8046000748872757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1631 -4.1535001248121262e-02</internalNodes>
+          <leafValues>
+            7.1887397766113281e-01 2.7982000261545181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1632 -9.3470998108386993e-02</internalNodes>
+          <leafValues>
+            -1.1906319856643677e+00 -4.4810999184846878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1633 -2.7249999344348907e-02</internalNodes>
+          <leafValues>
+            6.2942498922348022e-01 9.5039997249841690e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1634 -2.1759999915957451e-02</internalNodes>
+          <leafValues>
+            1.3233649730682373e+00 -1.5027000010013580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1635 -9.6890004351735115e-03</internalNodes>
+          <leafValues>
+            -3.3947101235389709e-01 1.7085799574851990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1636 6.9395996630191803e-02</internalNodes>
+          <leafValues>
+            -2.5657799839973450e-01 4.7652098536491394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1637 3.1208999454975128e-02</internalNodes>
+          <leafValues>
+            1.4154000580310822e-01 -3.4942001104354858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1638 -4.9727000296115875e-02</internalNodes>
+          <leafValues>
+            -1.1675560474395752e+00 -4.0757998824119568e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1639 -2.0301999524235725e-02</internalNodes>
+          <leafValues>
+            -3.9486399292945862e-01 1.5814900398254395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1640 -1.5367000363767147e-02</internalNodes>
+          <leafValues>
+            4.9300000071525574e-01 -2.0092099905014038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1641 -5.0735000520944595e-02</internalNodes>
+          <leafValues>
+            1.8736059665679932e+00 8.6730003356933594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1642 -2.0726000890135765e-02</internalNodes>
+          <leafValues>
+            -8.8938397169113159e-01 -7.3199998587369919e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1643 -3.0993999913334846e-02</internalNodes>
+          <leafValues>
+            -1.1664899587631226e+00 1.4274600148200989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1644 -4.4269999489188194e-03</internalNodes>
+          <leafValues>
+            -6.6815102100372314e-01 4.4120000675320625e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1645 -4.5743998140096664e-02</internalNodes>
+          <leafValues>
+            -4.7955200076103210e-01 1.5121999382972717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1646 1.6698999330401421e-02</internalNodes>
+          <leafValues>
+            1.2048599869012833e-01 -4.5235899090766907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1647 3.2210000790655613e-03</internalNodes>
+          <leafValues>
+            -7.7615000307559967e-02 2.7846598625183105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1648 2.4434000253677368e-02</internalNodes>
+          <leafValues>
+            -1.9987100362777710e-01 6.7253702878952026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1649 -7.9677999019622803e-02</internalNodes>
+          <leafValues>
+            9.2222398519515991e-01 9.2557996511459351e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1650 4.4530000537633896e-02</internalNodes>
+          <leafValues>
+            -2.6690500974655151e-01 3.3320501446723938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1651 -1.2528300285339355e-01</internalNodes>
+          <leafValues>
+            -5.4253101348876953e-01 1.3976299762725830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1652 1.7971999943256378e-02</internalNodes>
+          <leafValues>
+            1.8219999969005585e-02 -6.8048501014709473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1653 1.9184000790119171e-02</internalNodes>
+          <leafValues>
+            -1.2583999894559383e-02 5.4126697778701782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1654 4.0024001151323318e-02</internalNodes>
+          <leafValues>
+            -1.7638799548149109e-01 7.8810399770736694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1655 1.3558999635279179e-02</internalNodes>
+          <leafValues>
+            2.0737600326538086e-01 -4.7744300961494446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1656 1.6220999881625175e-02</internalNodes>
+          <leafValues>
+            2.3076999932527542e-02 -6.1182099580764771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1657 1.1229000054299831e-02</internalNodes>
+          <leafValues>
+            -1.7728000879287720e-02 4.1764199733734131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1658 3.9193000644445419e-02</internalNodes>
+          <leafValues>
+            -1.8948499858379364e-01 7.4019300937652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1659 -9.5539996400475502e-03</internalNodes>
+          <leafValues>
+            4.0947100520133972e-01 -1.3508899509906769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1660 2.7878999710083008e-02</internalNodes>
+          <leafValues>
+            -2.0350700616836548e-01 6.1625397205352783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1661 -2.3600999265909195e-02</internalNodes>
+          <leafValues>
+            -1.6967060565948486e+00 1.4633199572563171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1662 2.6930000633001328e-02</internalNodes>
+          <leafValues>
+            -3.0401999130845070e-02 -1.0909470319747925e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1663 2.8999999631196260e-04</internalNodes>
+          <leafValues>
+            -2.0076000690460205e-01 2.2314099967479706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1664 -4.1124999523162842e-02</internalNodes>
+          <leafValues>
+            -4.5242199301719666e-01 5.7392001152038574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1665 6.6789998672902584e-03</internalNodes>
+          <leafValues>
+            2.3824900388717651e-01 -2.1262100338935852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1666 4.7864999622106552e-02</internalNodes>
+          <leafValues>
+            -1.8194800615310669e-01 6.1918401718139648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1667 -3.1679999083280563e-03</internalNodes>
+          <leafValues>
+            -2.7393200993537903e-01 2.5017300248146057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1668 -8.6230002343654633e-03</internalNodes>
+          <leafValues>
+            -4.6280300617218018e-01 4.2397998273372650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1669 -7.4350000359117985e-03</internalNodes>
+          <leafValues>
+            4.1796800494194031e-01 -1.7079999670386314e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1670 -1.8769999733194709e-03</internalNodes>
+          <leafValues>
+            1.4602300524711609e-01 -3.3721101284027100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1671 -8.6226001381874084e-02</internalNodes>
+          <leafValues>
+            7.5143402814865112e-01 1.0711999610066414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1672 4.6833999454975128e-02</internalNodes>
+          <leafValues>
+            -1.9119599461555481e-01 4.8414900898933411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1673 -9.2000002041459084e-05</internalNodes>
+          <leafValues>
+            3.5220399498939514e-01 -1.7333300411701202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1674 -1.6343999654054642e-02</internalNodes>
+          <leafValues>
+            -6.4397698640823364e-01 9.0680001303553581e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1675 4.5703999698162079e-02</internalNodes>
+          <leafValues>
+            1.8216000869870186e-02 3.1970798969268799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1676 -2.7382999658584595e-02</internalNodes>
+          <leafValues>
+            1.0564049482345581e+00 -1.7276400327682495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1677 -2.7602000162005424e-02</internalNodes>
+          <leafValues>
+            2.9715499281883240e-01 -9.4600003212690353e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1678 7.6939999125897884e-03</internalNodes>
+          <leafValues>
+            -2.1660299599170685e-01 4.7385200858116150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1679 -7.0500001311302185e-04</internalNodes>
+          <leafValues>
+            2.4048799276351929e-01 -2.6776000857353210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1680 1.1054199934005737e-01</internalNodes>
+          <leafValues>
+            -3.3539000898599625e-02 -1.0233880281448364e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1681 6.8765997886657715e-02</internalNodes>
+          <leafValues>
+            -4.3239998631179333e-03 5.7153397798538208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1682 1.7999999690800905e-03</internalNodes>
+          <leafValues>
+            7.7574998140335083e-02 -4.2092698812484741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1683 1.9232000410556793e-01</internalNodes>
+          <leafValues>
+            8.2021996378898621e-02 2.8810169696807861e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1684 1.5742099285125732e-01</internalNodes>
+          <leafValues>
+            -1.3708199560642242e-01 2.0890059471130371e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1685 -4.9387000501155853e-02</internalNodes>
+          <leafValues>
+            -1.8610910177230835e+00 1.4332099258899689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1686 5.1929000765085220e-02</internalNodes>
+          <leafValues>
+            -1.8737000226974487e-01 5.4231601953506470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1687 4.9965001642704010e-02</internalNodes>
+          <leafValues>
+            1.4175300300121307e-01 -1.5625779628753662e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1688 -4.2633000761270523e-02</internalNodes>
+          <leafValues>
+            1.6059479713439941e+00 -1.4712899923324585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1689 -3.7553999572992325e-02</internalNodes>
+          <leafValues>
+            -8.0974900722503662e-01 1.3256999850273132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1690 -3.7174999713897705e-02</internalNodes>
+          <leafValues>
+            -1.3945020437240601e+00 -5.7055000215768814e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1691 1.3945999555289745e-02</internalNodes>
+          <leafValues>
+            3.3427000045776367e-02 5.7474797964096069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1692 -4.4800000614486635e-04</internalNodes>
+          <leafValues>
+            -5.5327498912811279e-01 2.1952999755740166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1693 3.1993001699447632e-02</internalNodes>
+          <leafValues>
+            2.0340999588370323e-02 3.7459200620651245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1694 -4.2799999937415123e-03</internalNodes>
+          <leafValues>
+            4.4428700208663940e-01 -2.2999699413776398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1695 9.8550003021955490e-03</internalNodes>
+          <leafValues>
+            1.8315799534320831e-01 -4.0964999794960022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1696 9.3356996774673462e-02</internalNodes>
+          <leafValues>
+            -6.3661001622676849e-02 -1.6929290294647217e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1697 1.7209999263286591e-02</internalNodes>
+          <leafValues>
+            2.0153899490833282e-01 -4.6061098575592041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1698 8.4319999441504478e-03</internalNodes>
+          <leafValues>
+            -3.2003998756408691e-01 1.5312199294567108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1699 -1.4054999686777592e-02</internalNodes>
+          <leafValues>
+            8.6882400512695312e-01 3.2575000077486038e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1700 -7.7180000953376293e-03</internalNodes>
+          <leafValues>
+            6.3686698675155640e-01 -1.8425500392913818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1701 2.8005000203847885e-02</internalNodes>
+          <leafValues>
+            1.7357499897480011e-01 -4.7883599996566772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1702 -1.8884999677538872e-02</internalNodes>
+          <leafValues>
+            2.4101600050926208e-01 -2.6547598838806152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1703 -1.8585000187158585e-02</internalNodes>
+          <leafValues>
+            5.4232501983642578e-01 5.3633000701665878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1704 -3.6437001079320908e-02</internalNodes>
+          <leafValues>
+            2.3908898830413818e+00 -1.3634699583053589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1705 3.2455001026391983e-02</internalNodes>
+          <leafValues>
+            1.5910699963569641e-01 -6.7581498622894287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1706 5.9781998395919800e-02</internalNodes>
+          <leafValues>
+            -2.3479999508708715e-03 -7.3053699731826782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1707 9.8209995776414871e-03</internalNodes>
+          <leafValues>
+            -1.1444099992513657e-01 3.0570301413536072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1708 -3.5163998603820801e-02</internalNodes>
+          <leafValues>
+            -1.0511469841003418e+00 -3.3103000372648239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1709 2.7429999317973852e-03</internalNodes>
+          <leafValues>
+            -2.0135399699211121e-01 3.2754099369049072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1710 8.1059997901320457e-03</internalNodes>
+          <leafValues>
+            -2.1383500099182129e-01 4.3362098932266235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1711 8.8942997157573700e-02</internalNodes>
+          <leafValues>
+            1.0940899699926376e-01 -4.7609338760375977e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1712 -3.0054999515414238e-02</internalNodes>
+          <leafValues>
+            -1.7169300317764282e+00 -6.0919001698493958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1713 -2.1734999492764473e-02</internalNodes>
+          <leafValues>
+            6.4778900146484375e-01 -3.2830998301506042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1714 3.7648998200893402e-02</internalNodes>
+          <leafValues>
+            -1.0060000233352184e-02 -7.6569098234176636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1715 2.7189999818801880e-03</internalNodes>
+          <leafValues>
+            1.9888900220394135e-01 -8.2479000091552734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1716 -1.0548000223934650e-02</internalNodes>
+          <leafValues>
+            -8.6613601446151733e-01 -2.5986000895500183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1717 1.2966300547122955e-01</internalNodes>
+          <leafValues>
+            1.3911999762058258e-01 -2.2271950244903564e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1718 -1.7676999792456627e-02</internalNodes>
+          <leafValues>
+            3.3967700600624084e-01 -2.3989599943161011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1719 -7.7051997184753418e-02</internalNodes>
+          <leafValues>
+            -2.5017969608306885e+00 1.2841999530792236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1720 -1.9230000674724579e-02</internalNodes>
+          <leafValues>
+            5.0641202926635742e-01 -1.9751599431037903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1721 -5.1222998648881912e-02</internalNodes>
+          <leafValues>
+            -2.9333369731903076e+00 1.3858500123023987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1722 2.0830000285059214e-03</internalNodes>
+          <leafValues>
+            -6.0043597221374512e-01 2.9718000441789627e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1723 2.5418000295758247e-02</internalNodes>
+          <leafValues>
+            3.3915799856185913e-01 -1.4392000436782837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1724 -2.3905999958515167e-02</internalNodes>
+          <leafValues>
+            -1.1082680225372314e+00 -4.7377001494169235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1725 -6.3740001060068607e-03</internalNodes>
+          <leafValues>
+            4.4533699750900269e-01 -6.7052997648715973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1726 -3.7698999047279358e-02</internalNodes>
+          <leafValues>
+            -1.0406579971313477e+00 -4.1790001094341278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1727 2.1655100584030151e-01</internalNodes>
+          <leafValues>
+            3.3863000571727753e-02 8.2017302513122559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1728 -1.3400999829173088e-02</internalNodes>
+          <leafValues>
+            5.2903497219085693e-01 -1.9133000075817108e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>196</maxWeakCount>
+      <stageThreshold>-3.2103500366210938e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1729 7.1268998086452484e-02</internalNodes>
+          <leafValues>
+            -5.3631198406219482e-01 6.0715299844741821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1730 5.6111000478267670e-02</internalNodes>
+          <leafValues>
+            -5.0141602754592896e-01 4.3976101279258728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1731 4.0463998913764954e-02</internalNodes>
+          <leafValues>
+            -3.2922199368476868e-01 5.4834699630737305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1732 6.3155002892017365e-02</internalNodes>
+          <leafValues>
+            -3.1701698899269104e-01 4.6152999997138977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1733 1.0320999659597874e-02</internalNodes>
+          <leafValues>
+            1.0694999992847443e-01 -9.8243898153305054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1734 6.2606997787952423e-02</internalNodes>
+          <leafValues>
+            -1.4329700171947479e-01 7.1095001697540283e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1735 -3.9416000247001648e-02</internalNodes>
+          <leafValues>
+            9.4380199909210205e-01 -2.1572099626064301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1736 -5.3960001096129417e-03</internalNodes>
+          <leafValues>
+            -5.4611998796463013e-01 2.5303798913955688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1737 1.0773199796676636e-01</internalNodes>
+          <leafValues>
+            1.2496000155806541e-02 -1.0809199810028076e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1738 1.6982000321149826e-02</internalNodes>
+          <leafValues>
+            -3.1536400318145752e-01 5.1239997148513794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1739 3.1216999515891075e-02</internalNodes>
+          <leafValues>
+            -4.5199999585747719e-03 -1.2443480491638184e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1740 -2.3106999695301056e-02</internalNodes>
+          <leafValues>
+            -7.6492899656295776e-01 2.0640599727630615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1741 -1.1203999631106853e-02</internalNodes>
+          <leafValues>
+            2.4092699587345123e-01 -3.5142099857330322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1742 -4.7479998320341110e-03</internalNodes>
+          <leafValues>
+            -9.7007997334003448e-02 2.0638099312782288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1743 -1.7358999699354172e-02</internalNodes>
+          <leafValues>
+            -7.9020297527313232e-01 2.1852999925613403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1744 1.8851999193429947e-02</internalNodes>
+          <leafValues>
+            -1.0394600033760071e-01 5.4844200611114502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1745 7.2249998338520527e-03</internalNodes>
+          <leafValues>
+            -4.0409401059150696e-01 2.6763799786567688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1746 1.8915999680757523e-02</internalNodes>
+          <leafValues>
+            2.0508000254631042e-01 -1.0206340551376343e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1747 3.1156999990344048e-02</internalNodes>
+          <leafValues>
+            1.2400000123307109e-03 -8.7293499708175659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1748 2.0951999351382256e-02</internalNodes>
+          <leafValues>
+            -5.5559999309480190e-03 8.0356198549270630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1749 1.1291000060737133e-02</internalNodes>
+          <leafValues>
+            -3.6478400230407715e-01 2.2767899930477142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1750 -5.7011000812053680e-02</internalNodes>
+          <leafValues>
+            -1.4295619726181030e+00 1.4322000741958618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1751 7.2194002568721771e-02</internalNodes>
+          <leafValues>
+            -4.1850000619888306e-02 -1.9111829996109009e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1752 -1.9874000921845436e-02</internalNodes>
+          <leafValues>
+            2.6425498723983765e-01 -3.2617700099945068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1753 -1.6692999750375748e-02</internalNodes>
+          <leafValues>
+            -8.3907800912857056e-01 4.0799999260343611e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1754 -3.9834998548030853e-02</internalNodes>
+          <leafValues>
+            -4.8858499526977539e-01 1.6436100006103516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1755 2.7009999379515648e-02</internalNodes>
+          <leafValues>
+            -1.8862499296665192e-01 8.3419400453567505e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1756 -3.9420002140104771e-03</internalNodes>
+          <leafValues>
+            2.3231500387191772e-01 -7.2360001504421234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1757 2.2833000868558884e-02</internalNodes>
+          <leafValues>
+            -3.5884000360965729e-02 -1.1549400091171265e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1758 -6.8888001143932343e-02</internalNodes>
+          <leafValues>
+            -1.7837309837341309e+00 1.5159000456333160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1759 4.3097000569105148e-02</internalNodes>
+          <leafValues>
+            -2.1608099341392517e-01 5.0624102354049683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1760 8.6239995434880257e-03</internalNodes>
+          <leafValues>
+            -1.7795599997043610e-01 2.8957900404930115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1761 1.4561000280082226e-02</internalNodes>
+          <leafValues>
+            -1.1408000253140926e-02 -8.9402002096176147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1762 -1.1501000262796879e-02</internalNodes>
+          <leafValues>
+            3.0171999335289001e-01 -4.3659001588821411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1763 -1.0971499979496002e-01</internalNodes>
+          <leafValues>
+            -9.5147097110748291e-01 -1.9973000511527061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1764 4.5228000730276108e-02</internalNodes>
+          <leafValues>
+            3.3110998570919037e-02 9.6619802713394165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1765 -2.7047999203205109e-02</internalNodes>
+          <leafValues>
+            9.7963601350784302e-01 -1.7261900007724762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1766 1.8030999228358269e-02</internalNodes>
+          <leafValues>
+            -2.0801000297069550e-02 2.7385899424552917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1767 5.0524998456239700e-02</internalNodes>
+          <leafValues>
+            -5.6802999228239059e-02 -1.7775089740753174e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1768 -2.9923999682068825e-02</internalNodes>
+          <leafValues>
+            6.5329200029373169e-01 -2.3537000641226768e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1769 3.8058001548051834e-02</internalNodes>
+          <leafValues>
+            2.6317000389099121e-02 -7.0665699243545532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1770 1.8563899397850037e-01</internalNodes>
+          <leafValues>
+            -5.6039998307824135e-03 3.2873699069023132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1771 -4.0670000016689301e-03</internalNodes>
+          <leafValues>
+            3.4204798936843872e-01 -3.0171599984169006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1772 1.0108999907970428e-02</internalNodes>
+          <leafValues>
+            -7.3600001633167267e-03 5.7981598377227783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1773 -1.1567000299692154e-02</internalNodes>
+          <leafValues>
+            -5.2722197771072388e-01 4.6447999775409698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1774 -6.5649999305605888e-03</internalNodes>
+          <leafValues>
+            -5.8529102802276611e-01 1.9101899862289429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1775 1.0582000017166138e-02</internalNodes>
+          <leafValues>
+            2.1073000505566597e-02 -6.8892598152160645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1776 -2.0304000005125999e-02</internalNodes>
+          <leafValues>
+            -3.6400699615478516e-01 1.5338799357414246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1777 2.3529999889433384e-03</internalNodes>
+          <leafValues>
+            3.6164000630378723e-02 -5.9825098514556885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1778 -1.4690000098198652e-03</internalNodes>
+          <leafValues>
+            -1.4707699418067932e-01 3.7507998943328857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1779 8.6449999362230301e-03</internalNodes>
+          <leafValues>
+            -2.1708500385284424e-01 5.1936799287796021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1780 -2.4326000362634659e-02</internalNodes>
+          <leafValues>
+            -1.0846769809722900e+00 1.4084799587726593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1781 7.4418999254703522e-02</internalNodes>
+          <leafValues>
+            -1.5513800084590912e-01 1.1822769641876221e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1782 1.7077999189496040e-02</internalNodes>
+          <leafValues>
+            4.4231001287698746e-02 9.1561102867126465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1783 -2.4577999487519264e-02</internalNodes>
+          <leafValues>
+            -1.5504100322723389e+00 -5.4745998233556747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1784 3.0205000191926956e-02</internalNodes>
+          <leafValues>
+            1.6662800312042236e-01 -1.0001239776611328e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1785 1.2136000208556652e-02</internalNodes>
+          <leafValues>
+            -7.7079099416732788e-01 -4.8639997839927673e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1786 8.6717002093791962e-02</internalNodes>
+          <leafValues>
+            1.1061699688434601e-01 -1.6857999563217163e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1787 -4.2309001088142395e-02</internalNodes>
+          <leafValues>
+            1.1075930595397949e+00 -1.5438599884510040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1788 -2.6420000940561295e-03</internalNodes>
+          <leafValues>
+            2.7451899647712708e-01 -1.8456199765205383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1789 -5.6662000715732574e-02</internalNodes>
+          <leafValues>
+            -8.0625599622726440e-01 -1.6928000375628471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1790 2.3475000634789467e-02</internalNodes>
+          <leafValues>
+            1.4187699556350708e-01 -2.5500899553298950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1791 -2.0803000777959824e-02</internalNodes>
+          <leafValues>
+            1.9826300442218781e-01 -3.1171199679374695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1792 7.2599998675286770e-03</internalNodes>
+          <leafValues>
+            -5.0590999424457550e-02 4.1923800110816956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1793 3.4160000085830688e-01</internalNodes>
+          <leafValues>
+            -1.6674900054931641e-01 9.2748600244522095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1794 6.2029999680817127e-03</internalNodes>
+          <leafValues>
+            -1.2625899910926819e-01 4.0445300936698914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1795 3.2692000269889832e-02</internalNodes>
+          <leafValues>
+            -3.2634999603033066e-02 -9.8939800262451172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1796 2.1100000594742596e-04</internalNodes>
+          <leafValues>
+            -6.4534001052379608e-02 2.5473698973655701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1797 7.2100001852959394e-04</internalNodes>
+          <leafValues>
+            -3.6618599295616150e-01 1.1973100155591965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1798 5.4490998387336731e-02</internalNodes>
+          <leafValues>
+            1.2073499709367752e-01 -1.0291390419006348e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1799 -1.0141000151634216e-02</internalNodes>
+          <leafValues>
+            -5.2177202701568604e-01 3.3734999597072601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1800 -1.8815999850630760e-02</internalNodes>
+          <leafValues>
+            6.5181797742843628e-01 1.3399999588727951e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1801 -5.3480002097785473e-03</internalNodes>
+          <leafValues>
+            1.7370699346065521e-01 -3.4132000803947449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1802 -1.0847000405192375e-02</internalNodes>
+          <leafValues>
+            -1.9699899852275848e-01 1.5045499801635742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1803 -4.9926001578569412e-02</internalNodes>
+          <leafValues>
+            -5.0888502597808838e-01 3.0762000009417534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1804 1.2160000391304493e-02</internalNodes>
+          <leafValues>
+            -6.9251999258995056e-02 1.8745499849319458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1805 -2.2189998999238014e-03</internalNodes>
+          <leafValues>
+            -4.0849098563194275e-01 7.9954996705055237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1806 3.1580000650137663e-03</internalNodes>
+          <leafValues>
+            -2.1124599874019623e-01 2.2366400063037872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1807 4.1439998894929886e-03</internalNodes>
+          <leafValues>
+            -4.9900299310684204e-01 6.2917001545429230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1808 -7.3730000294744968e-03</internalNodes>
+          <leafValues>
+            -2.0553299784660339e-01 2.2096699476242065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1809 5.1812000572681427e-02</internalNodes>
+          <leafValues>
+            1.8096800148487091e-01 -4.3495801091194153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1810 1.8340000882744789e-02</internalNodes>
+          <leafValues>
+            1.5200000256299973e-02 3.7991699576377869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1811 1.7490799725055695e-01</internalNodes>
+          <leafValues>
+            -2.0920799672603607e-01 4.0013000369071960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1812 5.3993999958038330e-02</internalNodes>
+          <leafValues>
+            2.4751600623130798e-01 -2.6712900400161743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1813 -3.2033199071884155e-01</internalNodes>
+          <leafValues>
+            -1.9094380140304565e+00 -6.6960997879505157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1814 -2.7060000225901604e-02</internalNodes>
+          <leafValues>
+            -7.1371299028396606e-01 1.5904599428176880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1815 7.7463999390602112e-02</internalNodes>
+          <leafValues>
+            -1.6970199346542358e-01 7.7552998065948486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1816 2.3771999403834343e-02</internalNodes>
+          <leafValues>
+            1.9021899998188019e-01 -6.0162097215652466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1817 1.1501000262796879e-02</internalNodes>
+          <leafValues>
+            7.7039999887347221e-03 -6.1730301380157471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1818 3.2616000622510910e-02</internalNodes>
+          <leafValues>
+            1.7159199714660645e-01 -7.0978200435638428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1819 -4.4383000582456589e-02</internalNodes>
+          <leafValues>
+            -2.2606229782104492e+00 -7.3276996612548828e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1820 -5.8476001024246216e-02</internalNodes>
+          <leafValues>
+            2.4087750911712646e+00 8.3091996610164642e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1821 1.9303999841213226e-02</internalNodes>
+          <leafValues>
+            -2.7082300186157227e-01 2.7369999885559082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1822 -4.4705998152494431e-02</internalNodes>
+          <leafValues>
+            3.1355598568916321e-01 -6.2492001801729202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1823 -6.0334999114274979e-02</internalNodes>
+          <leafValues>
+            -1.4515119791030884e+00 -5.8761000633239746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1824 1.1667000129818916e-02</internalNodes>
+          <leafValues>
+            -1.8084999173879623e-02 5.0479698181152344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1825 2.8009999543428421e-02</internalNodes>
+          <leafValues>
+            -2.3302899301052094e-01 3.0708700418472290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1826 6.5397001802921295e-02</internalNodes>
+          <leafValues>
+            1.4135900139808655e-01 -5.0010901689529419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1827 9.6239997074007988e-03</internalNodes>
+          <leafValues>
+            -2.2054600715637207e-01 3.9191201329231262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1828 2.5510000996291637e-03</internalNodes>
+          <leafValues>
+            -1.1381500214338303e-01 2.0032300055027008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1829 3.1847000122070312e-02</internalNodes>
+          <leafValues>
+            2.5476999580860138e-02 -5.3326398134231567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1830 3.3055000007152557e-02</internalNodes>
+          <leafValues>
+            1.7807699739933014e-01 -6.2793898582458496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1831 4.7600999474525452e-02</internalNodes>
+          <leafValues>
+            -1.4747899770736694e-01 1.4204180240631104e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1832 -1.9571999087929726e-02</internalNodes>
+          <leafValues>
+            -5.2693498134613037e-01 1.5838600695133209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1833 -5.4730001837015152e-02</internalNodes>
+          <leafValues>
+            8.8231599330902100e-01 -1.6627800464630127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1834 -2.2686000913381577e-02</internalNodes>
+          <leafValues>
+            -4.8386898636817932e-01 1.5000100433826447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1835 1.0713200271129608e-01</internalNodes>
+          <leafValues>
+            -2.1336199343204498e-01 4.2333900928497314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1836 -3.6380000412464142e-02</internalNodes>
+          <leafValues>
+            -7.4198000133037567e-02 1.4589400589466095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1837 1.3935999944806099e-02</internalNodes>
+          <leafValues>
+            -2.4911600351333618e-01 2.6771199703216553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1838 2.0991999655961990e-02</internalNodes>
+          <leafValues>
+            8.7959999218583107e-03 4.3064999580383301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1839 4.9118999391794205e-02</internalNodes>
+          <leafValues>
+            -1.7591999471187592e-01 6.9282901287078857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1840 3.6315999925136566e-02</internalNodes>
+          <leafValues>
+            1.3145299255847931e-01 -3.3597299456596375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1841 4.1228000074625015e-02</internalNodes>
+          <leafValues>
+            -4.5692000538110733e-02 -1.3515930175781250e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1842 1.5672000125050545e-02</internalNodes>
+          <leafValues>
+            1.7544099688529968e-01 -6.0550000518560410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1843 -1.6286000609397888e-02</internalNodes>
+          <leafValues>
+            -1.1308189630508423e+00 -3.9533000439405441e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1844 -3.0229999683797359e-03</internalNodes>
+          <leafValues>
+            -2.2454300522804260e-01 2.3628099262714386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1845 -1.3786299526691437e-01</internalNodes>
+          <leafValues>
+            4.5376899838447571e-01 -2.1098700165748596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1846 -9.6760001033544540e-03</internalNodes>
+          <leafValues>
+            -1.5105099976062775e-01 2.0781700313091278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1847 -2.4839999154210091e-02</internalNodes>
+          <leafValues>
+            -6.8350297212600708e-01 -8.0040004104375839e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1848 -1.3964399695396423e-01</internalNodes>
+          <leafValues>
+            6.5011298656463623e-01 4.6544000506401062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1849 -8.2153998315334320e-02</internalNodes>
+          <leafValues>
+            4.4887199997901917e-01 -2.3591999709606171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1850 3.8449999410659075e-03</internalNodes>
+          <leafValues>
+            -8.8173002004623413e-02 2.7346798777580261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1851 -6.6579999402165413e-03</internalNodes>
+          <leafValues>
+            -4.6866598725318909e-01 7.7001996338367462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1852 -1.5898000448942184e-02</internalNodes>
+          <leafValues>
+            2.9268398880958557e-01 -2.1941000595688820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1853 -5.0946000963449478e-02</internalNodes>
+          <leafValues>
+            -1.2093789577484131e+00 -4.2109999805688858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1854 1.6837999224662781e-02</internalNodes>
+          <leafValues>
+            -4.5595999807119370e-02 5.0180697441101074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1855 1.5918999910354614e-02</internalNodes>
+          <leafValues>
+            -2.6904299855232239e-01 2.6516300439834595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1856 3.6309999413788319e-03</internalNodes>
+          <leafValues>
+            -1.3046100735664368e-01 3.1807100772857666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1857 -8.6144998669624329e-02</internalNodes>
+          <leafValues>
+            1.9443659782409668e+00 -1.3978299498558044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1858 3.3140998333692551e-02</internalNodes>
+          <leafValues>
+            1.5266799926757812e-01 -3.0866000801324844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1859 -3.9679999463260174e-03</internalNodes>
+          <leafValues>
+            -7.1202301979064941e-01 -1.3844000175595284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1860 -2.4008000269532204e-02</internalNodes>
+          <leafValues>
+            9.2007797956466675e-01 4.6723999083042145e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1861 8.7320003658533096e-03</internalNodes>
+          <leafValues>
+            -2.2567300498485565e-01 3.1931799650192261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1862 -2.7786999940872192e-02</internalNodes>
+          <leafValues>
+            -7.2337102890014648e-01 1.7018599808216095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1863 -1.9455300271511078e-01</internalNodes>
+          <leafValues>
+            1.2461860179901123e+00 -1.4736199378967285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1864 -1.0869699716567993e-01</internalNodes>
+          <leafValues>
+            -1.4465179443359375e+00 1.2145300209522247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1865 -1.9494999200105667e-02</internalNodes>
+          <leafValues>
+            -7.8153097629547119e-01 -2.3732999339699745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1866 3.0650000553578138e-03</internalNodes>
+          <leafValues>
+            -8.5471397638320923e-01 1.6686999797821045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1867 5.9193998575210571e-02</internalNodes>
+          <leafValues>
+            -1.4853699505329132e-01 1.1273469924926758e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1868 -5.4207999259233475e-02</internalNodes>
+          <leafValues>
+            5.4726999998092651e-01 3.5523999482393265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1869 -3.9324998855590820e-02</internalNodes>
+          <leafValues>
+            3.6642599105834961e-01 -2.0543999969959259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1870 8.2278996706008911e-02</internalNodes>
+          <leafValues>
+            -3.5007998347282410e-02 5.3994202613830566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1871 -7.4479999020695686e-03</internalNodes>
+          <leafValues>
+            -6.1537498235702515e-01 -3.5319998860359192e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1872 7.3770000599324703e-03</internalNodes>
+          <leafValues>
+            -6.5591000020503998e-02 4.1961398720741272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1873 7.0779998786747456e-03</internalNodes>
+          <leafValues>
+            -3.4129500389099121e-01 1.2536799907684326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1874 -1.5581999905407429e-02</internalNodes>
+          <leafValues>
+            -3.0240398645401001e-01 2.1511000394821167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1875 -2.7399999089539051e-03</internalNodes>
+          <leafValues>
+            7.6553001999855042e-02 -4.1060501337051392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1876 -7.0600003004074097e-02</internalNodes>
+          <leafValues>
+            -9.7356200218200684e-01 1.1241800338029861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1877 -1.1706000193953514e-02</internalNodes>
+          <leafValues>
+            1.8560700118541718e-01 -2.9755198955535889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1878 7.1499997284263372e-04</internalNodes>
+          <leafValues>
+            -5.9650000184774399e-02 2.4824699759483337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1879 -3.6866001784801483e-02</internalNodes>
+          <leafValues>
+            3.2751700282096863e-01 -2.3059600591659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1880 -3.2526999711990356e-02</internalNodes>
+          <leafValues>
+            -2.9320299625396729e-01 1.5427699685096741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1881 -7.4813999235630035e-02</internalNodes>
+          <leafValues>
+            -1.2143570184707642e+00 -5.2244000136852264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1882 4.1469998657703400e-02</internalNodes>
+          <leafValues>
+            1.3062499463558197e-01 -2.3274369239807129e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1883 -2.8880000114440918e-02</internalNodes>
+          <leafValues>
+            -6.6074597835540771e-01 -9.0960003435611725e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1884 4.6381998807191849e-02</internalNodes>
+          <leafValues>
+            1.6630199551582336e-01 -6.6949498653411865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1885 2.5424998998641968e-01</internalNodes>
+          <leafValues>
+            -5.4641999304294586e-02 -1.2676080465316772e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1886 2.4000001139938831e-03</internalNodes>
+          <leafValues>
+            2.0276799798011780e-01 1.4667999930679798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1887 -8.2805998623371124e-02</internalNodes>
+          <leafValues>
+            -7.8713601827621460e-01 -2.4468999356031418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1888 -1.1438000015914440e-02</internalNodes>
+          <leafValues>
+            2.8623399138450623e-01 -3.0894000083208084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1889 -1.2913399934768677e-01</internalNodes>
+          <leafValues>
+            1.7292929887771606e+00 -1.4293900132179260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1890 3.8552999496459961e-02</internalNodes>
+          <leafValues>
+            1.9232999533414841e-02 3.7732601165771484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1891 1.0191400349140167e-01</internalNodes>
+          <leafValues>
+            -7.4533998966217041e-02 -3.3868899345397949e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1892 -1.9068000838160515e-02</internalNodes>
+          <leafValues>
+            3.1814101338386536e-01 1.9261000677943230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1893 -6.0775000602006912e-02</internalNodes>
+          <leafValues>
+            7.6936298608779907e-01 -1.7644000053405762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1894 2.4679999798536301e-02</internalNodes>
+          <leafValues>
+            1.8396499752998352e-01 -3.0868801474571228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1895 2.6759000495076180e-02</internalNodes>
+          <leafValues>
+            -2.3454900085926056e-01 3.3056598901748657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1896 1.4969999901950359e-02</internalNodes>
+          <leafValues>
+            1.7213599383831024e-01 -1.8248899281024933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1897 2.6142999529838562e-02</internalNodes>
+          <leafValues>
+            -4.6463999897241592e-02 -1.1318379640579224e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1898 -3.7512000650167465e-02</internalNodes>
+          <leafValues>
+            8.0404001474380493e-01 6.9660000503063202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1899 -5.3229997865855694e-03</internalNodes>
+          <leafValues>
+            -8.1884402036666870e-01 -1.8224999308586121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1900 1.7813000828027725e-02</internalNodes>
+          <leafValues>
+            1.4957800507545471e-01 -1.8667200207710266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1901 -3.4010000526905060e-02</internalNodes>
+          <leafValues>
+            -7.2852301597595215e-01 -1.6615999862551689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1902 -1.5953000634908676e-02</internalNodes>
+          <leafValues>
+            5.6944000720977783e-01 1.3832000084221363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1903 1.9743999466300011e-02</internalNodes>
+          <leafValues>
+            4.0525000542402267e-02 -4.1773399710655212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1904 -1.0374800115823746e-01</internalNodes>
+          <leafValues>
+            -1.9825149774551392e+00 1.1960200220346451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1905 -1.9285000860691071e-02</internalNodes>
+          <leafValues>
+            5.0230598449707031e-01 -1.9745899736881256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1906 -1.2780000455677509e-02</internalNodes>
+          <leafValues>
+            4.0195000171661377e-01 -2.6957999914884567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1907 -1.6352999955415726e-02</internalNodes>
+          <leafValues>
+            -7.6608800888061523e-01 -2.4209000170230865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1908 -1.2763699889183044e-01</internalNodes>
+          <leafValues>
+            8.6578500270843506e-01 6.4205996692180634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1909 1.9068999215960503e-02</internalNodes>
+          <leafValues>
+            -5.5929797887802124e-01 -1.6880000475794077e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1910 3.2480999827384949e-02</internalNodes>
+          <leafValues>
+            4.0722001343965530e-02 4.8925098776817322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1911 9.4849998131394386e-03</internalNodes>
+          <leafValues>
+            -1.9231900572776794e-01 5.1139700412750244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1912 5.0470000132918358e-03</internalNodes>
+          <leafValues>
+            1.8706800043582916e-01 -1.6113600134849548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1913 4.1267998516559601e-02</internalNodes>
+          <leafValues>
+            -4.8817999660968781e-02 -1.1326299905776978e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1914 -7.6358996331691742e-02</internalNodes>
+          <leafValues>
+            1.4169390201568604e+00 8.7319999933242798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1915 -7.2834998369216919e-02</internalNodes>
+          <leafValues>
+            1.3189860582351685e+00 -1.4819100499153137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1916 5.9576999396085739e-02</internalNodes>
+          <leafValues>
+            4.8376999795436859e-02 8.5611802339553833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1917 2.0263999700546265e-02</internalNodes>
+          <leafValues>
+            -2.1044099330902100e-01 3.3858999609947205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1918 -8.0301001667976379e-02</internalNodes>
+          <leafValues>
+            -1.2464400529861450e+00 1.1857099831104279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1919 -1.7835000529885292e-02</internalNodes>
+          <leafValues>
+            2.5782299041748047e-01 -2.4564799666404724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1920 1.1431000195443630e-02</internalNodes>
+          <leafValues>
+            2.2949799895286560e-01 -2.9497599601745605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1921 -2.5541000068187714e-02</internalNodes>
+          <leafValues>
+            -8.6252999305725098e-01 -7.0400000549852848e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1922 -7.6899997657164931e-04</internalNodes>
+          <leafValues>
+            3.1511399149894714e-01 -1.4349000155925751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1923 -1.4453999698162079e-02</internalNodes>
+          <leafValues>
+            2.5148499011993408e-01 -2.8232899308204651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1924 8.6730001494288445e-03</internalNodes>
+          <leafValues>
+            2.6601400971412659e-01 -2.8190800547599792e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>197</maxWeakCount>
+      <stageThreshold>-3.2772979736328125e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1925 5.4708998650312424e-02</internalNodes>
+          <leafValues>
+            -5.4144299030303955e-01 6.1043000221252441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1926 -1.0838799923658371e-01</internalNodes>
+          <leafValues>
+            7.1739900112152100e-01 -4.1196098923683167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1927 2.2996999323368073e-02</internalNodes>
+          <leafValues>
+            -5.8269798755645752e-01 2.9645600914955139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1928 2.7540000155568123e-03</internalNodes>
+          <leafValues>
+            -7.4243897199630737e-01 1.4183300733566284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1929 -2.1520000882446766e-03</internalNodes>
+          <leafValues>
+            1.7879900336265564e-01 -6.8548601865768433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1930 -2.2559000179171562e-02</internalNodes>
+          <leafValues>
+            -1.0775549411773682e+00 1.2388999760150909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1931 8.3025000989437103e-02</internalNodes>
+          <leafValues>
+            2.4500999599695206e-02 -1.0251879692077637e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1932 -6.6740000620484352e-03</internalNodes>
+          <leafValues>
+            -4.5283100008964539e-01 2.1230199933052063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1933 7.6485000550746918e-02</internalNodes>
+          <leafValues>
+            -2.6972699165344238e-01 4.8580199480056763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1934 5.4910001344978809e-03</internalNodes>
+          <leafValues>
+            -4.8871201276779175e-01 3.1616398692131042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1935 -1.0414999909698963e-02</internalNodes>
+          <leafValues>
+            4.1512900590896606e-01 -3.0044800043106079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1936 2.7607999742031097e-02</internalNodes>
+          <leafValues>
+            1.6203799843788147e-01 -9.9868500232696533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1937 -2.3272000253200531e-02</internalNodes>
+          <leafValues>
+            -1.1024399995803833e+00 2.1124999970197678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1938 -5.5619999766349792e-02</internalNodes>
+          <leafValues>
+            6.5033102035522461e-01 -2.7938000857830048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1939 -4.0631998330354691e-02</internalNodes>
+          <leafValues>
+            4.2117300629615784e-01 -2.6763799786567688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1940 -7.3560001328587532e-03</internalNodes>
+          <leafValues>
+            3.5277798771858215e-01 -3.7854000926017761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1941 1.7007000744342804e-02</internalNodes>
+          <leafValues>
+            -2.9189500212669373e-01 4.1053798794746399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1942 -3.7034001201391220e-02</internalNodes>
+          <leafValues>
+            -1.3216309547424316e+00 1.2966500222682953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1943 -1.9633000716567039e-02</internalNodes>
+          <leafValues>
+            -8.7702298164367676e-01 1.0799999581649899e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1944 -2.3546999320387840e-02</internalNodes>
+          <leafValues>
+            2.6106101274490356e-01 -2.1481400728225708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1945 -4.3352998793125153e-02</internalNodes>
+          <leafValues>
+            -9.9089699983596802e-01 -9.9560003727674484e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1946 -2.2183999419212341e-02</internalNodes>
+          <leafValues>
+            6.3454401493072510e-01 -5.6547001004219055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1947 1.6530999913811684e-02</internalNodes>
+          <leafValues>
+            2.4664999917149544e-02 -7.3326802253723145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1948 -3.2744001597166061e-02</internalNodes>
+          <leafValues>
+            -5.6297200918197632e-01 1.6640299558639526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1949 7.1415998041629791e-02</internalNodes>
+          <leafValues>
+            -3.0000001424923539e-04 -9.3286401033401489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1950 8.0999999772757292e-04</internalNodes>
+          <leafValues>
+            -9.5380000770092010e-02 2.5184699892997742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1951 -8.4090000018477440e-03</internalNodes>
+          <leafValues>
+            -6.5496802330017090e-01 6.7300997674465179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1952 -1.7254000529646873e-02</internalNodes>
+          <leafValues>
+            -4.6492999792098999e-01 1.6070899367332458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1953 -1.8641000613570213e-02</internalNodes>
+          <leafValues>
+            -1.0594010353088379e+00 -1.9617000594735146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1954 -9.1979997232556343e-03</internalNodes>
+          <leafValues>
+            5.0716197490692139e-01 -1.5339200198650360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1955 1.8538000062108040e-02</internalNodes>
+          <leafValues>
+            -3.0498200654983521e-01 7.3506200313568115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1956 -5.0335001200437546e-02</internalNodes>
+          <leafValues>
+            -1.1140480041503906e+00 1.8000100553035736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1957 -2.3529000580310822e-02</internalNodes>
+          <leafValues>
+            -8.6907899379730225e-01 -1.2459999881684780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1958 -2.7100000530481339e-02</internalNodes>
+          <leafValues>
+            6.5942901372909546e-01 -3.5323999822139740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1959 6.5879998728632927e-03</internalNodes>
+          <leafValues>
+            -2.2953400015830994e-01 4.2425099015235901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1960 2.3360000923275948e-02</internalNodes>
+          <leafValues>
+            1.8356199562549591e-01 -9.8587298393249512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1961 1.2946999631822109e-02</internalNodes>
+          <leafValues>
+            -3.3147400617599487e-01 2.1323199570178986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1962 -6.6559999249875546e-03</internalNodes>
+          <leafValues>
+            -1.1951400339603424e-01 2.9752799868583679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1963 -2.2570999339222908e-02</internalNodes>
+          <leafValues>
+            3.8499400019645691e-01 -2.4434499442577362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1964 -6.3813999295234680e-02</internalNodes>
+          <leafValues>
+            -8.9383500814437866e-01 1.4217500388622284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1965 -4.9945000559091568e-02</internalNodes>
+          <leafValues>
+            5.3864401578903198e-01 -2.0485299825668335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1966 6.8319998681545258e-03</internalNodes>
+          <leafValues>
+            -5.6678999215364456e-02 3.9970999956130981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1967 -5.5835999548435211e-02</internalNodes>
+          <leafValues>
+            -1.5239470005035400e+00 -5.1183000206947327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1968 3.1957000494003296e-01</internalNodes>
+          <leafValues>
+            7.4574001133441925e-02 1.2447799444198608e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1969 8.0955997109413147e-02</internalNodes>
+          <leafValues>
+            -1.9665500521659851e-01 5.9889698028564453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1970 -1.4911999925971031e-02</internalNodes>
+          <leafValues>
+            -6.4020597934722900e-01 1.5807600319385529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1971 4.6709001064300537e-02</internalNodes>
+          <leafValues>
+            8.5239000618457794e-02 -4.5487201213836670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1972 6.0539999976754189e-03</internalNodes>
+          <leafValues>
+            -4.3184000253677368e-01 2.2452600300312042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1973 -3.4375999122858047e-02</internalNodes>
+          <leafValues>
+            4.0202501416206360e-01 -2.3903599381446838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1974 -3.4924000501632690e-02</internalNodes>
+          <leafValues>
+            5.2870100736618042e-01 3.9709001779556274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1975 3.0030000489205122e-03</internalNodes>
+          <leafValues>
+            -3.8754299283027649e-01 1.4192600548267365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1976 -1.4132999815046787e-02</internalNodes>
+          <leafValues>
+            8.7528401613235474e-01 8.5507996380329132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1977 -6.7940000444650650e-03</internalNodes>
+          <leafValues>
+            -1.1649219989776611e+00 -3.3943001180887222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1978 -5.2886001765727997e-02</internalNodes>
+          <leafValues>
+            1.0930680036544800e+00 5.1187001168727875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1979 -2.1079999860376120e-03</internalNodes>
+          <leafValues>
+            1.3696199655532837e-01 -3.3849999308586121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1980 1.8353000283241272e-02</internalNodes>
+          <leafValues>
+            1.3661600649356842e-01 -4.0777799487113953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1981 1.2671999633312225e-02</internalNodes>
+          <leafValues>
+            -1.4936000108718872e-02 -8.1707501411437988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1982 1.2924999929964542e-02</internalNodes>
+          <leafValues>
+            1.7625099420547485e-01 -3.2491698861122131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1983 -1.7921000719070435e-02</internalNodes>
+          <leafValues>
+            -5.2745401859283447e-01 4.4443000108003616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1984 1.9160000374540687e-03</internalNodes>
+          <leafValues>
+            -1.0978599637746811e-01 2.2067500650882721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1985 -1.4697999693453312e-02</internalNodes>
+          <leafValues>
+            3.9067798852920532e-01 -2.2224999964237213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1986 -1.4972999691963196e-02</internalNodes>
+          <leafValues>
+            -2.5450900197029114e-01 1.7790000140666962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1987 1.4636999927461147e-02</internalNodes>
+          <leafValues>
+            -2.5125000625848770e-02 -8.7121301889419556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1988 -1.0974000208079815e-02</internalNodes>
+          <leafValues>
+            7.9082798957824707e-01 2.0121000707149506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1989 -9.1599998995661736e-03</internalNodes>
+          <leafValues>
+            -4.7906899452209473e-01 5.2232000976800919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1990 4.6179997734725475e-03</internalNodes>
+          <leafValues>
+            -1.7244599759578705e-01 3.4527799487113953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1991 2.3476999253034592e-02</internalNodes>
+          <leafValues>
+            3.7760001141577959e-03 -6.5333700180053711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1992 3.1766999512910843e-02</internalNodes>
+          <leafValues>
+            1.6364000737667084e-02 5.8723700046539307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1993 -1.8419999629259109e-02</internalNodes>
+          <leafValues>
+            1.9993899762630463e-01 -3.2056498527526855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1994 1.9543999806046486e-02</internalNodes>
+          <leafValues>
+            1.8450200557708740e-01 -2.3793600499629974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1995 4.1159498691558838e-01</internalNodes>
+          <leafValues>
+            -6.0382001101970673e-02 -1.6072119474411011e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1996 -4.1595999151468277e-02</internalNodes>
+          <leafValues>
+            -3.2756200432777405e-01 1.5058000385761261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1997 -1.0335999540984631e-02</internalNodes>
+          <leafValues>
+            -6.2394398450851440e-01 1.3112000189721584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1998 1.2392999604344368e-02</internalNodes>
+          <leafValues>
+            -3.3114999532699585e-02 5.5579900741577148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1999 -8.7270000949501991e-03</internalNodes>
+          <leafValues>
+            1.9883200526237488e-01 -3.7635600566864014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2000 1.6295000910758972e-02</internalNodes>
+          <leafValues>
+            2.0373000204563141e-01 -4.2800799012184143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2001 -1.0483999736607075e-02</internalNodes>
+          <leafValues>
+            -5.6847000122070312e-01 4.4199001044034958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2002 -1.2431999668478966e-02</internalNodes>
+          <leafValues>
+            7.4641901254653931e-01 4.3678998947143555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2003 -5.0374999642372131e-02</internalNodes>
+          <leafValues>
+            8.5090100765228271e-01 -1.7773799598217010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2004 4.9548000097274780e-02</internalNodes>
+          <leafValues>
+            1.6784900426864624e-01 -2.9877498745918274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2005 -4.1085001081228256e-02</internalNodes>
+          <leafValues>
+            -1.3302919864654541e+00 -4.9182001501321793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2006 1.0069999843835831e-03</internalNodes>
+          <leafValues>
+            -6.0538999736309052e-02 1.8483200669288635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2007 -5.0142999738454819e-02</internalNodes>
+          <leafValues>
+            7.6447701454162598e-01 -1.8356999754905701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2008 -8.7879998609423637e-03</internalNodes>
+          <leafValues>
+            2.2655999660491943e-01 -6.3156999647617340e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2009 -5.0170999020338058e-02</internalNodes>
+          <leafValues>
+            -1.5899070501327515e+00 -6.1255000531673431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2010 1.0216099768877029e-01</internalNodes>
+          <leafValues>
+            1.2071800231933594e-01 -1.4120110273361206e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2011 -1.4372999779880047e-02</internalNodes>
+          <leafValues>
+            -1.3116970062255859e+00 -5.1936000585556030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2012 1.0281999595463276e-02</internalNodes>
+          <leafValues>
+            -2.1639999467879534e-03 4.4247201085090637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2013 -1.1814000084996223e-02</internalNodes>
+          <leafValues>
+            6.5378099679946899e-01 -1.8723699450492859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2014 7.2114996612071991e-02</internalNodes>
+          <leafValues>
+            7.1846999228000641e-02 8.1496298313140869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2015 -1.9001999869942665e-02</internalNodes>
+          <leafValues>
+            -6.7427200078964233e-01 -4.3200000072829425e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2016 -4.6990001574158669e-03</internalNodes>
+          <leafValues>
+            3.3311501145362854e-01 5.5794000625610352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2017 -5.8157000690698624e-02</internalNodes>
+          <leafValues>
+            4.5572298765182495e-01 -2.0305100083351135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2018 1.1360000353306532e-03</internalNodes>
+          <leafValues>
+            -4.4686999171972275e-02 2.2681899368762970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2019 -4.9414999783039093e-02</internalNodes>
+          <leafValues>
+            2.6694598793983459e-01 -2.6116999983787537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2020 -1.1913800239562988e-01</internalNodes>
+          <leafValues>
+            -8.3017998933792114e-01 1.3248500227928162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2021 -1.8303999677300453e-02</internalNodes>
+          <leafValues>
+            -6.7499202489852905e-01 1.7092000693082809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2022 -7.9199997708201408e-03</internalNodes>
+          <leafValues>
+            -7.2287000715732574e-02 1.4425800740718842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2023 5.1925998181104660e-02</internalNodes>
+          <leafValues>
+            3.0921999365091324e-02 -5.5860602855682373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2024 6.6724002361297607e-02</internalNodes>
+          <leafValues>
+            1.3666400313377380e-01 -2.9411000013351440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2025 -1.3778000138700008e-02</internalNodes>
+          <leafValues>
+            -5.9443902969360352e-01 1.5300000086426735e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2026 -1.7760999500751495e-02</internalNodes>
+          <leafValues>
+            4.0496501326560974e-01 -3.3559999428689480e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2027 -4.2234998196363449e-02</internalNodes>
+          <leafValues>
+            -1.0897940397262573e+00 -4.0224999189376831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2028 -1.3524999842047691e-02</internalNodes>
+          <leafValues>
+            2.8921899199485779e-01 -2.5194799900054932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2029 -1.1106000281870365e-02</internalNodes>
+          <leafValues>
+            6.5312802791595459e-01 -1.8053700029850006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2030 -1.2284599989652634e-01</internalNodes>
+          <leafValues>
+            -1.9570649862289429e+00 1.4815400540828705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2031 4.7715999186038971e-02</internalNodes>
+          <leafValues>
+            -2.2875599563121796e-01 3.4233701229095459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2032 3.1817000359296799e-02</internalNodes>
+          <leafValues>
+            1.5976299345493317e-01 -1.0091969966888428e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2033 4.2570000514388084e-03</internalNodes>
+          <leafValues>
+            -3.8881298899650574e-01 8.4210000932216644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2034 -6.1372999101877213e-02</internalNodes>
+          <leafValues>
+            1.7152810096740723e+00 5.9324998408555984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2035 -2.7030000928789377e-03</internalNodes>
+          <leafValues>
+            -3.8161700963973999e-01 8.5127003490924835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2036 -6.8544000387191772e-02</internalNodes>
+          <leafValues>
+            -3.0925889015197754e+00 1.1788000166416168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2037 1.0372500121593475e-01</internalNodes>
+          <leafValues>
+            -1.3769300282001495e-01 1.9009410142898560e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2038 1.5799000859260559e-02</internalNodes>
+          <leafValues>
+            -6.2660001218318939e-02 2.5917699933052063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2039 -9.8040001466870308e-03</internalNodes>
+          <leafValues>
+            -5.6291598081588745e-01 4.3923001736402512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2040 -9.0229995548725128e-03</internalNodes>
+          <leafValues>
+            2.5287100672721863e-01 -4.1225999593734741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2041 -6.3754998147487640e-02</internalNodes>
+          <leafValues>
+            -2.6178569793701172e+00 -7.4005998671054840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2042 3.8954999297857285e-02</internalNodes>
+          <leafValues>
+            5.9032998979091644e-02 8.5945600271224976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2043 -3.9802998304367065e-02</internalNodes>
+          <leafValues>
+            9.3600499629974365e-01 -1.5639400482177734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2044 5.0301998853683472e-02</internalNodes>
+          <leafValues>
+            1.3725900650024414e-01 -2.5549728870391846e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2045 4.6250000596046448e-02</internalNodes>
+          <leafValues>
+            -1.3964000158011913e-02 -7.1026200056076050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2046 6.2196001410484314e-02</internalNodes>
+          <leafValues>
+            5.9526000171899796e-02 1.6509100198745728e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2047 -6.4776003360748291e-02</internalNodes>
+          <leafValues>
+            7.1368998289108276e-01 -1.7270000278949738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2048 2.7522999793291092e-02</internalNodes>
+          <leafValues>
+            1.4631600677967072e-01 -8.1428997218608856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2049 3.9900001138448715e-04</internalNodes>
+          <leafValues>
+            -3.7144500017166138e-01 1.0152699798345566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2050 -4.3299999088048935e-03</internalNodes>
+          <leafValues>
+            -2.3756299912929535e-01 2.6798400282859802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2051 4.7297000885009766e-02</internalNodes>
+          <leafValues>
+            -2.7682000771164894e-02 -8.4910297393798828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2052 1.2508999556303024e-02</internalNodes>
+          <leafValues>
+            1.8730199337005615e-01 -5.6001102924346924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2053 4.5899000018835068e-02</internalNodes>
+          <leafValues>
+            -1.5601199865341187e-01 9.7073000669479370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2054 1.9853399693965912e-01</internalNodes>
+          <leafValues>
+            1.4895500242710114e-01 -1.1015529632568359e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2055 1.6674999147653580e-02</internalNodes>
+          <leafValues>
+            -1.6615299880504608e-01 8.2210999727249146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2056 1.9829999655485153e-03</internalNodes>
+          <leafValues>
+            -7.1249999105930328e-02 2.8810900449752808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2057 2.2447999566793442e-02</internalNodes>
+          <leafValues>
+            -2.0981000736355782e-02 -7.8416502475738525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2058 -1.3913000002503395e-02</internalNodes>
+          <leafValues>
+            -1.8165799975395203e-01 2.0491799712181091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2059 -7.7659999951720238e-03</internalNodes>
+          <leafValues>
+            -4.5595899224281311e-01 6.3576996326446533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2060 -1.3209000229835510e-02</internalNodes>
+          <leafValues>
+            2.6632300019264221e-01 -1.7795999348163605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2061 4.9052998423576355e-02</internalNodes>
+          <leafValues>
+            -1.5476800501346588e-01 1.1069979667663574e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2062 2.0263999700546265e-02</internalNodes>
+          <leafValues>
+            6.8915002048015594e-02 6.9867497682571411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2063 -1.6828000545501709e-02</internalNodes>
+          <leafValues>
+            2.7607199549674988e-01 -2.5139200687408447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2064 -1.6939499974250793e-01</internalNodes>
+          <leafValues>
+            -3.0767529010772705e+00 1.1617500334978104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2065 -1.1336100101470947e-01</internalNodes>
+          <leafValues>
+            -1.4639229774475098e+00 -5.1447000354528427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2066 -7.7685996890068054e-02</internalNodes>
+          <leafValues>
+            8.8430202007293701e-01 4.3306998908519745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2067 -1.5568000264465809e-02</internalNodes>
+          <leafValues>
+            1.3672499358654022e-01 -3.4505501389503479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2068 -6.6018998622894287e-02</internalNodes>
+          <leafValues>
+            -1.0300110578536987e+00 1.1601399630308151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2069 8.3699999377131462e-03</internalNodes>
+          <leafValues>
+            7.6429001986980438e-02 -4.4002500176429749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2070 3.5402998328208923e-02</internalNodes>
+          <leafValues>
+            1.1979500204324722e-01 -7.2668302059173584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2071 -3.9051000028848648e-02</internalNodes>
+          <leafValues>
+            6.7375302314758301e-01 -1.8196000158786774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2072 -9.7899995744228363e-03</internalNodes>
+          <leafValues>
+            2.1264599263668060e-01 3.6756001412868500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2073 -2.3047000169754028e-02</internalNodes>
+          <leafValues>
+            4.4742199778556824e-01 -2.0986700057983398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2074 3.1169999856501818e-03</internalNodes>
+          <leafValues>
+            3.7544000893831253e-02 2.7808201313018799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2075 1.3136000372469425e-02</internalNodes>
+          <leafValues>
+            -1.9842399656772614e-01 5.4335701465606689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2076 1.4782000333070755e-02</internalNodes>
+          <leafValues>
+            1.3530600070953369e-01 -1.1153600364923477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2077 -6.0139000415802002e-02</internalNodes>
+          <leafValues>
+            8.4039300680160522e-01 -1.6711600124835968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2078 5.1998998969793320e-02</internalNodes>
+          <leafValues>
+            1.7372000217437744e-01 -7.8547602891921997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2079 2.4792000651359558e-02</internalNodes>
+          <leafValues>
+            -1.7739200592041016e-01 6.6752600669860840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2080 -1.2014999985694885e-02</internalNodes>
+          <leafValues>
+            -1.4263699948787689e-01 1.6070500016212463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2081 -9.8655998706817627e-02</internalNodes>
+          <leafValues>
+            1.0429769754409790e+00 -1.5770199894905090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2082 1.1758299916982651e-01</internalNodes>
+          <leafValues>
+            1.0955700278282166e-01 -4.4920377731323242e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2083 -1.8922999501228333e-02</internalNodes>
+          <leafValues>
+            -7.8543400764465332e-01 1.2984000146389008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2084 -2.8390999883413315e-02</internalNodes>
+          <leafValues>
+            -6.0569900274276733e-01 1.2903499603271484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2085 1.3182999566197395e-02</internalNodes>
+          <leafValues>
+            -1.4415999874472618e-02 -7.3210501670837402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2086 -1.1653000116348267e-01</internalNodes>
+          <leafValues>
+            -2.0442469120025635e+00 1.4053100347518921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2087 -3.8880000356584787e-03</internalNodes>
+          <leafValues>
+            -4.1861599683761597e-01 7.8704997897148132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2088 3.1229000538587570e-02</internalNodes>
+          <leafValues>
+            2.4632999673485756e-02 4.1870400309562683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2089 2.5198999792337418e-02</internalNodes>
+          <leafValues>
+            -1.7557799816131592e-01 6.4710599184036255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2090 -2.8124000877141953e-02</internalNodes>
+          <leafValues>
+            -2.2005599737167358e-01 1.4121000468730927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2091 3.6499001085758209e-02</internalNodes>
+          <leafValues>
+            -6.8426996469497681e-02 -2.3410849571228027e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2092 -7.2292998433113098e-02</internalNodes>
+          <leafValues>
+            1.2898750305175781e+00 8.4875002503395081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2093 -4.1671000421047211e-02</internalNodes>
+          <leafValues>
+            -1.1630970239639282e+00 -5.3752999752759933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2094 4.7703001648187637e-02</internalNodes>
+          <leafValues>
+            7.0101000368595123e-02 7.3676502704620361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2095 6.5793000161647797e-02</internalNodes>
+          <leafValues>
+            -1.7755299806594849e-01 6.9780498743057251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2096 1.3904999941587448e-02</internalNodes>
+          <leafValues>
+            2.1936799585819244e-01 -2.0390799641609192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2097 -2.7730999514460564e-02</internalNodes>
+          <leafValues>
+            6.1867898702621460e-01 -1.7804099619388580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2098 -1.5879999846220016e-02</internalNodes>
+          <leafValues>
+            -4.6484100818634033e-01 1.8828600645065308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2099 7.4128001928329468e-02</internalNodes>
+          <leafValues>
+            -1.2858100235462189e-01 3.2792479991912842e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2100 -8.9000002481043339e-04</internalNodes>
+          <leafValues>
+            -3.0117601156234741e-01 2.3818799853324890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2101 1.7965000122785568e-02</internalNodes>
+          <leafValues>
+            -2.2284999489784241e-01 2.9954001307487488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2102 -2.5380000006407499e-03</internalNodes>
+          <leafValues>
+            2.5064399838447571e-01 -1.3665600121021271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2103 -9.0680001303553581e-03</internalNodes>
+          <leafValues>
+            2.9017499089241028e-01 -2.8929701447486877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2104 4.9169998615980148e-02</internalNodes>
+          <leafValues>
+            1.9156399369239807e-01 -6.8328702449798584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2105 -3.0680999159812927e-02</internalNodes>
+          <leafValues>
+            -7.5677001476287842e-01 -1.3279999606311321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2106 1.0017400234937668e-01</internalNodes>
+          <leafValues>
+            8.4453999996185303e-02 1.0888710021972656e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2107 3.1950001139193773e-03</internalNodes>
+          <leafValues>
+            -2.6919400691986084e-01 1.9537900388240814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2108 3.5503000020980835e-02</internalNodes>
+          <leafValues>
+            1.3632300496101379e-01 -5.6917202472686768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2109 4.5900000259280205e-04</internalNodes>
+          <leafValues>
+            -4.0443998575210571e-01 1.4074799418449402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2110 2.5258999317884445e-02</internalNodes>
+          <leafValues>
+            1.6243200004100800e-01 -5.5741798877716064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2111 -5.1549999043345451e-03</internalNodes>
+          <leafValues>
+            3.1132599711418152e-01 -2.2756099700927734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2112 1.5869999770075083e-03</internalNodes>
+          <leafValues>
+            -2.6867699623107910e-01 1.9565400481224060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2113 -1.6204999759793282e-02</internalNodes>
+          <leafValues>
+            1.5486499667167664e-01 -3.4057798981666565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2114 -2.9624000191688538e-02</internalNodes>
+          <leafValues>
+            1.1466799974441528e+00 9.0557999908924103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2115 -1.5930000226944685e-03</internalNodes>
+          <leafValues>
+            -7.1257501840591431e-01 -7.0400000549852848e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2116 -5.4019000381231308e-02</internalNodes>
+          <leafValues>
+            4.1537499427795410e-01 2.7246000245213509e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2117 -6.6211000084877014e-02</internalNodes>
+          <leafValues>
+            -1.3340090513229370e+00 -4.7352999448776245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2118 2.7940999716520309e-02</internalNodes>
+          <leafValues>
+            1.4446300268173218e-01 -5.1518398523330688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2119 2.8957000002264977e-02</internalNodes>
+          <leafValues>
+            -4.9966000020503998e-02 -1.1929039955139160e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2120 -2.0424999296665192e-02</internalNodes>
+          <leafValues>
+            6.3881301879882812e-01 3.8141001015901566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2121 1.2416999787092209e-02</internalNodes>
+          <leafValues>
+            -2.1547000110149384e-01 4.9477699398994446e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>181</maxWeakCount>
+      <stageThreshold>-3.3196411132812500e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2122 4.3274000287055969e-02</internalNodes>
+          <leafValues>
+            -8.0494397878646851e-01 3.9897298812866211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2123 1.8615500628948212e-01</internalNodes>
+          <leafValues>
+            -3.1655299663543701e-01 6.8877297639846802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2124 3.1860999763011932e-02</internalNodes>
+          <leafValues>
+            -6.4266198873519897e-01 2.5550898909568787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2125 1.4022000133991241e-02</internalNodes>
+          <leafValues>
+            -4.5926600694656372e-01 3.1171199679374695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2126 -6.3029997982084751e-03</internalNodes>
+          <leafValues>
+            4.6026900410652161e-01 -2.7438500523567200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2127 -5.4310001432895660e-03</internalNodes>
+          <leafValues>
+            3.6608600616455078e-01 -2.7205801010131836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2128 1.6822999343276024e-02</internalNodes>
+          <leafValues>
+            2.3476999253034592e-02 -8.8443797826766968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2129 2.6039000600576401e-02</internalNodes>
+          <leafValues>
+            1.7488799989223480e-01 -5.4564702510833740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2130 -2.6720000430941582e-02</internalNodes>
+          <leafValues>
+            -9.6396499872207642e-01 2.3524999618530273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2131 -1.7041999846696854e-02</internalNodes>
+          <leafValues>
+            -7.0848798751831055e-01 2.1468099951744080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2132 5.9569999575614929e-03</internalNodes>
+          <leafValues>
+            7.3601000010967255e-02 -6.8225598335266113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2133 -2.8679999522864819e-03</internalNodes>
+          <leafValues>
+            -7.4935001134872437e-01 2.3803399503231049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2134 -4.3774999678134918e-02</internalNodes>
+          <leafValues>
+            6.8323302268981934e-01 -2.1380299329757690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2135 5.1633000373840332e-02</internalNodes>
+          <leafValues>
+            -1.2566499412059784e-01 6.7523801326751709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2136 8.1780003383755684e-03</internalNodes>
+          <leafValues>
+            7.0689998567104340e-02 -8.0665898323059082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2137 -5.2841998636722565e-02</internalNodes>
+          <leafValues>
+            9.5433902740478516e-01 1.6548000276088715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2138 5.2583999931812286e-02</internalNodes>
+          <leafValues>
+            -2.8414401412010193e-01 4.7129800915718079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2139 -1.2659000232815742e-02</internalNodes>
+          <leafValues>
+            3.8445401191711426e-01 -6.2288001179695129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2140 1.1694000102579594e-02</internalNodes>
+          <leafValues>
+            5.6000000768108293e-05 -1.0173139572143555e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2141 -2.3918999359011650e-02</internalNodes>
+          <leafValues>
+            8.4921300411224365e-01 5.7399999350309372e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2142 -6.1673998832702637e-02</internalNodes>
+          <leafValues>
+            -9.2571401596069336e-01 -1.7679999582469463e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2143 -1.8279999494552612e-03</internalNodes>
+          <leafValues>
+            -5.4372298717498779e-01 2.4932399392127991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2144 3.5257998853921890e-02</internalNodes>
+          <leafValues>
+            -7.3719997890293598e-03 -9.3963998556137085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2145 -1.8438000231981277e-02</internalNodes>
+          <leafValues>
+            7.2136700153350830e-01 1.0491999797523022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2146 -3.8389001041650772e-02</internalNodes>
+          <leafValues>
+            1.9272600114345551e-01 -3.5832101106643677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2147 9.9720999598503113e-02</internalNodes>
+          <leafValues>
+            1.1354199796915054e-01 -1.6304190158843994e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2148 8.4462001919746399e-02</internalNodes>
+          <leafValues>
+            -5.3420998156070709e-02 -1.6981120109558105e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2149 4.0270000696182251e-02</internalNodes>
+          <leafValues>
+            -1.0783199965953827e-01 5.1926600933074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2150 5.8935999870300293e-02</internalNodes>
+          <leafValues>
+            -1.8053700029850006e-01 9.5119798183441162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2151 1.4957000315189362e-01</internalNodes>
+          <leafValues>
+            1.6785299777984619e-01 -1.1591869592666626e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2152 6.9399998756125569e-04</internalNodes>
+          <leafValues>
+            2.0491400361061096e-01 -3.3118200302124023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2153 -3.3369001001119614e-02</internalNodes>
+          <leafValues>
+            9.3468099832534790e-01 -2.9639999847859144e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2154 9.3759996816515923e-03</internalNodes>
+          <leafValues>
+            3.7000000011175871e-03 -7.7549797296524048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2155 4.3193999677896500e-02</internalNodes>
+          <leafValues>
+            -2.2040000185370445e-03 7.4589699506759644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2156 -6.7555002868175507e-02</internalNodes>
+          <leafValues>
+            7.2292101383209229e-01 -1.8404200673103333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2157 -3.1168600916862488e-01</internalNodes>
+          <leafValues>
+            1.0014270544052124e+00 3.4003000706434250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2158 2.9743999242782593e-02</internalNodes>
+          <leafValues>
+            -4.6356000006198883e-02 -1.2781809568405151e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2159 1.0737000033259392e-02</internalNodes>
+          <leafValues>
+            1.4812000095844269e-02 6.6649997234344482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2160 -2.8841000050306320e-02</internalNodes>
+          <leafValues>
+            -9.4222599267959595e-01 -2.0796999335289001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2161 -5.7649998925626278e-03</internalNodes>
+          <leafValues>
+            -4.3541899323463440e-01 2.3386000096797943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2162 2.8410999104380608e-02</internalNodes>
+          <leafValues>
+            -1.7615799605846405e-01 8.5765302181243896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2163 -2.9007999226450920e-02</internalNodes>
+          <leafValues>
+            5.7978099584579468e-01 2.8565999120473862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2164 2.4965999647974968e-02</internalNodes>
+          <leafValues>
+            -2.2729000076651573e-02 -9.6773099899291992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2165 1.2036000378429890e-02</internalNodes>
+          <leafValues>
+            -1.4214700460433960e-01 5.1687997579574585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2166 -4.2514000087976456e-02</internalNodes>
+          <leafValues>
+            9.7273802757263184e-01 -1.8119800090789795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2167 1.0276000015437603e-02</internalNodes>
+          <leafValues>
+            -8.3099998533725739e-02 3.1762799620628357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2168 -6.9191999733448029e-02</internalNodes>
+          <leafValues>
+            -2.0668580532073975e+00 -6.0173999518156052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2169 -4.6769999898970127e-03</internalNodes>
+          <leafValues>
+            4.4131800532341003e-01 2.3209000006318092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2170 -1.3923999853432178e-02</internalNodes>
+          <leafValues>
+            2.8606700897216797e-01 -2.9152700304985046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2171 -1.5333999879658222e-02</internalNodes>
+          <leafValues>
+            -5.7414501905441284e-01 2.3063300549983978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2172 -1.0239000432193279e-02</internalNodes>
+          <leafValues>
+            3.4479200839996338e-01 -2.6080399751663208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2173 -5.0988998264074326e-02</internalNodes>
+          <leafValues>
+            5.6154102087020874e-01 6.1218999326229095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2174 3.0689999461174011e-02</internalNodes>
+          <leafValues>
+            -1.4772799611091614e-01 1.6378489732742310e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2175 -1.1223999783396721e-02</internalNodes>
+          <leafValues>
+            2.4006199836730957e-01 -4.4864898920059204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2176 -6.2899999320507050e-03</internalNodes>
+          <leafValues>
+            4.3119499087333679e-01 -2.3808999359607697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2177 7.8590996563434601e-02</internalNodes>
+          <leafValues>
+            1.9865000620484352e-02 8.0853801965713501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2178 -1.0178999975323677e-02</internalNodes>
+          <leafValues>
+            1.8193200230598450e-01 -3.2877799868583679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2179 3.1227000057697296e-02</internalNodes>
+          <leafValues>
+            1.4973899722099304e-01 -1.4180339574813843e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2180 4.0196999907493591e-02</internalNodes>
+          <leafValues>
+            -1.9760499894618988e-01 5.8508199453353882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2181 1.6138000413775444e-02</internalNodes>
+          <leafValues>
+            5.0000002374872565e-04 3.9050000905990601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2182 -4.5519001781940460e-02</internalNodes>
+          <leafValues>
+            1.2646820545196533e+00 -1.5632599592208862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2183 -1.8130000680685043e-02</internalNodes>
+          <leafValues>
+            6.5148502588272095e-01 1.0235999710857868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2184 -1.4001999981701374e-02</internalNodes>
+          <leafValues>
+            -1.0344820022583008e+00 -3.2182998955249786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2185 -3.8816001266241074e-02</internalNodes>
+          <leafValues>
+            -4.7874298691749573e-01 1.6290700435638428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2186 3.1656000763177872e-02</internalNodes>
+          <leafValues>
+            -2.0983399450778961e-01 5.4575902223587036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2187 -1.0839999653398991e-02</internalNodes>
+          <leafValues>
+            5.1898801326751709e-01 -1.5080000273883343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2188 1.2032999657094479e-02</internalNodes>
+          <leafValues>
+            -2.1107600629329681e-01 7.5937002897262573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2189 7.0772998034954071e-02</internalNodes>
+          <leafValues>
+            1.8048800528049469e-01 -7.4048501253128052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2190 5.3139799833297729e-01</internalNodes>
+          <leafValues>
+            -1.4491699635982513e-01 1.5360039472579956e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2191 -1.4774000272154808e-02</internalNodes>
+          <leafValues>
+            -2.8153699636459351e-01 2.0407299697399139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2192 -2.2410000674426556e-03</internalNodes>
+          <leafValues>
+            -4.4876301288604736e-01 5.3989000618457794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2193 4.9968000501394272e-02</internalNodes>
+          <leafValues>
+            4.1514001786708832e-02 2.9417100548744202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2194 -4.7701999545097351e-02</internalNodes>
+          <leafValues>
+            3.9674299955368042e-01 -2.8301799297332764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2195 -9.1311000287532806e-02</internalNodes>
+          <leafValues>
+            2.1994259357452393e+00 8.7964996695518494e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2196 3.8070000708103180e-02</internalNodes>
+          <leafValues>
+            -2.8025600314140320e-01 2.5156199932098389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2197 -1.5538999810814857e-02</internalNodes>
+          <leafValues>
+            3.4157499670982361e-01 1.7924999818205833e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2198 -1.5445999801158905e-02</internalNodes>
+          <leafValues>
+            2.8680199384689331e-01 -2.5135898590087891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2199 -5.7388000190258026e-02</internalNodes>
+          <leafValues>
+            6.3830000162124634e-01 8.8597998023033142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2200 -5.9440000914037228e-03</internalNodes>
+          <leafValues>
+            7.9016998410224915e-02 -4.0774899721145630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2201 -6.9968998432159424e-02</internalNodes>
+          <leafValues>
+            -4.4644200801849365e-01 1.7219600081443787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2202 -2.5064999237656593e-02</internalNodes>
+          <leafValues>
+            -9.8270201683044434e-01 -3.5388000309467316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2203 1.7216000705957413e-02</internalNodes>
+          <leafValues>
+            2.2705900669097900e-01 -8.0550098419189453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2204 -4.4279001653194427e-02</internalNodes>
+          <leafValues>
+            8.3951997756958008e-01 -1.7429600656032562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2205 4.3988998979330063e-02</internalNodes>
+          <leafValues>
+            1.1557199805974960e-01 -1.9666889905929565e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2206 1.5907000750303268e-02</internalNodes>
+          <leafValues>
+            -3.7576001137495041e-02 -1.0311100482940674e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2207 -9.2754997313022614e-02</internalNodes>
+          <leafValues>
+            -1.3530019521713257e+00 1.2141299992799759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2208 7.1037001907825470e-02</internalNodes>
+          <leafValues>
+            -1.7684300243854523e-01 7.4485200643539429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2209 5.7762000709772110e-02</internalNodes>
+          <leafValues>
+            1.2835599482059479e-01 -4.4444200396537781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2210 -1.6432000324130058e-02</internalNodes>
+          <leafValues>
+            8.0152702331542969e-01 -1.7491699755191803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2211 2.3939000442624092e-02</internalNodes>
+          <leafValues>
+            1.6144999861717224e-01 -1.2364500015974045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2212 1.2636000290513039e-02</internalNodes>
+          <leafValues>
+            1.5411999821662903e-01 -3.3293798565864563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2213 -5.4347999393939972e-02</internalNodes>
+          <leafValues>
+            -1.8400700092315674e+00 1.4835999906063080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2214 -1.3261999934911728e-02</internalNodes>
+          <leafValues>
+            -8.0838799476623535e-01 -2.7726000174880028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2215 6.1340001411736012e-03</internalNodes>
+          <leafValues>
+            -1.3785000145435333e-01 3.2858499884605408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2216 2.8991000726819038e-02</internalNodes>
+          <leafValues>
+            -2.5516999885439873e-02 -8.3387202024459839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2217 -2.1986000239849091e-02</internalNodes>
+          <leafValues>
+            -7.3739999532699585e-01 1.7887100577354431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2218 5.3269998170435429e-03</internalNodes>
+          <leafValues>
+            -4.5449298620223999e-01 6.8791002035140991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2219 8.6047999560832977e-02</internalNodes>
+          <leafValues>
+            2.1008500456809998e-01 -3.7808901071548462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2220 -8.5549997165799141e-03</internalNodes>
+          <leafValues>
+            4.0134999155998230e-01 -2.1074099838733673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2221 6.7790001630783081e-03</internalNodes>
+          <leafValues>
+            -2.1648999303579330e-02 4.5421499013900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2222 -6.3959998078644276e-03</internalNodes>
+          <leafValues>
+            -4.9818599224090576e-01 7.5907997786998749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2223 8.9469999074935913e-03</internalNodes>
+          <leafValues>
+            1.7857700586318970e-01 -2.8454899787902832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2224 3.2589999027550220e-03</internalNodes>
+          <leafValues>
+            4.6624999493360519e-02 -5.5206298828125000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2225 4.1476998478174210e-02</internalNodes>
+          <leafValues>
+            1.7550499737262726e-01 -2.0703999698162079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2226 -6.7449999041855335e-03</internalNodes>
+          <leafValues>
+            -4.6392598748207092e-01 6.9303996860980988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2227 3.0564999207854271e-02</internalNodes>
+          <leafValues>
+            5.1734998822212219e-02 7.5550502538681030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2228 -7.4780001305043697e-03</internalNodes>
+          <leafValues>
+            1.4893899857997894e-01 -3.1906801462173462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2229 8.9088998734951019e-02</internalNodes>
+          <leafValues>
+            1.3738800585269928e-01 -1.1379710435867310e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2230 7.3230001144111156e-03</internalNodes>
+          <leafValues>
+            -2.8829199075698853e-01 1.9088600575923920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2231 -1.8205000087618828e-02</internalNodes>
+          <leafValues>
+            -3.0178600549697876e-01 1.6795800626277924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2232 -2.5828000158071518e-02</internalNodes>
+          <leafValues>
+            -9.8137998580932617e-01 -1.9860999658703804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2233 1.0936199873685837e-01</internalNodes>
+          <leafValues>
+            4.8790000379085541e-02 5.3118300437927246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2234 -1.1424999684095383e-02</internalNodes>
+          <leafValues>
+            2.3705999553203583e-01 -2.7925300598144531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2235 -5.7565998286008835e-02</internalNodes>
+          <leafValues>
+            4.7255399823188782e-01 6.5171003341674805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2236 1.0278300195932388e-01</internalNodes>
+          <leafValues>
+            -2.0765100419521332e-01 5.0947701930999756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2237 2.7041999623179436e-02</internalNodes>
+          <leafValues>
+            1.6421200335025787e-01 -1.4508620500564575e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2238 -1.3635000213980675e-02</internalNodes>
+          <leafValues>
+            -5.6543898582458496e-01 2.3788999766111374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2239 -3.2158198952674866e-01</internalNodes>
+          <leafValues>
+            -3.5602829456329346e+00 1.1801300197839737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2240 2.0458100736141205e-01</internalNodes>
+          <leafValues>
+            -3.7016000598669052e-02 -1.0225499868392944e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2241 -7.0347003638744354e-02</internalNodes>
+          <leafValues>
+            -5.6491899490356445e-01 1.8525199592113495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2242 3.7831000983715057e-02</internalNodes>
+          <leafValues>
+            -2.9901999980211258e-02 -8.2921499013900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2243 -7.0298001170158386e-02</internalNodes>
+          <leafValues>
+            -5.3172302246093750e-01 1.4430199563503265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2244 6.3221000134944916e-02</internalNodes>
+          <leafValues>
+            -2.2041200101375580e-01 4.7952198982238770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2245 3.6393001675605774e-02</internalNodes>
+          <leafValues>
+            1.4222699403762817e-01 -6.1193901300430298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2246 4.0099998004734516e-03</internalNodes>
+          <leafValues>
+            -3.4560799598693848e-01 1.1738699674606323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2247 -4.9106001853942871e-02</internalNodes>
+          <leafValues>
+            9.5984101295471191e-01 6.4934998750686646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2248 -7.1583002805709839e-02</internalNodes>
+          <leafValues>
+            1.7385669946670532e+00 -1.4252899587154388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2249 -3.8008999079465866e-02</internalNodes>
+          <leafValues>
+            1.3872820138931274e+00 6.6188000142574310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2250 -3.1570000573992729e-03</internalNodes>
+          <leafValues>
+            5.3677000105381012e-02 -5.4048001766204834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2251 1.9458999857306480e-02</internalNodes>
+          <leafValues>
+            -9.3620002269744873e-02 3.9131000638008118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2252 1.1293999850749969e-02</internalNodes>
+          <leafValues>
+            3.7223998457193375e-02 -5.4251801967620850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2253 -3.3495001494884491e-02</internalNodes>
+          <leafValues>
+            9.5307898521423340e-01 3.7696998566389084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2254 9.2035003006458282e-02</internalNodes>
+          <leafValues>
+            -1.3488399982452393e-01 2.2897069454193115e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2255 3.7529999390244484e-03</internalNodes>
+          <leafValues>
+            2.2824199497699738e-01 -5.9983700513839722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2256 1.2848000042140484e-02</internalNodes>
+          <leafValues>
+            -2.2005200386047363e-01 3.7221899628639221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2257 -1.4316199719905853e-01</internalNodes>
+          <leafValues>
+            1.2855789661407471e+00 4.7237001359462738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2258 -9.6879996359348297e-02</internalNodes>
+          <leafValues>
+            -3.9550929069519043e+00 -7.2903998196125031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2259 -8.8459998369216919e-03</internalNodes>
+          <leafValues>
+            3.7674999237060547e-01 -4.6484000980854034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2260 1.5900000929832458e-02</internalNodes>
+          <leafValues>
+            -2.4457000195980072e-02 -8.0034798383712769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2261 7.0372000336647034e-02</internalNodes>
+          <leafValues>
+            1.7019000649452209e-01 -6.3068997859954834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2262 -3.7953998893499374e-02</internalNodes>
+          <leafValues>
+            -9.3667197227478027e-01 -4.1214000433683395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2263 5.1597899198532104e-01</internalNodes>
+          <leafValues>
+            1.3080599904060364e-01 -1.5802290439605713e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2264 -3.2843001186847687e-02</internalNodes>
+          <leafValues>
+            -1.1441620588302612e+00 -4.9173999577760696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2265 -3.6357000470161438e-02</internalNodes>
+          <leafValues>
+            4.9606400728225708e-01 -3.4458998590707779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2266 6.8080001510679722e-03</internalNodes>
+          <leafValues>
+            -3.0997800827026367e-01 1.7054800689220428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2267 -1.6114000231027603e-02</internalNodes>
+          <leafValues>
+            -3.7904599308967590e-01 1.6078999638557434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2268 8.4530003368854523e-03</internalNodes>
+          <leafValues>
+            -1.8655499815940857e-01 5.6367701292037964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2269 -1.3752399384975433e-01</internalNodes>
+          <leafValues>
+            -5.8989900350570679e-01 1.1749500036239624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2270 1.7688000202178955e-01</internalNodes>
+          <leafValues>
+            -1.5424899756908417e-01 9.2911100387573242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2271 7.9309996217489243e-03</internalNodes>
+          <leafValues>
+            3.2190701365470886e-01 -1.6392600536346436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2272 1.0971800237894058e-01</internalNodes>
+          <leafValues>
+            -1.5876500308513641e-01 1.0186259746551514e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2273 -3.0293000862002373e-02</internalNodes>
+          <leafValues>
+            7.5587302446365356e-01 3.1794998794794083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2274 -2.3118000477552414e-02</internalNodes>
+          <leafValues>
+            -8.8451498746871948e-01 -9.5039997249841690e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2275 -3.0900000128895044e-03</internalNodes>
+          <leafValues>
+            2.3838299512863159e-01 -1.1606200039386749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2276 -3.3392000943422318e-02</internalNodes>
+          <leafValues>
+            -1.8738139867782593e+00 -6.8502999842166901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2277 1.3190000317990780e-02</internalNodes>
+          <leafValues>
+            1.2919899821281433e-01 -6.7512202262878418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2278 1.4661000110208988e-02</internalNodes>
+          <leafValues>
+            -2.4829000234603882e-02 -7.4396800994873047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2279 -1.3248000293970108e-02</internalNodes>
+          <leafValues>
+            4.6820199489593506e-01 -2.4165000766515732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2280 -1.6218999400734901e-02</internalNodes>
+          <leafValues>
+            4.0083798766136169e-01 -2.1255700290203094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2281 -2.9052000492811203e-02</internalNodes>
+          <leafValues>
+            -1.5650019645690918e+00 1.4375899732112885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2282 -1.0153199732303619e-01</internalNodes>
+          <leafValues>
+            -1.9220689535140991e+00 -6.9559998810291290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2283 3.7753999233245850e-02</internalNodes>
+          <leafValues>
+            1.3396799564361572e-01 -2.2639141082763672e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2284 -2.8555598855018616e-01</internalNodes>
+          <leafValues>
+            1.0215270519256592e+00 -1.5232199430465698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2285 1.5360699594020844e-01</internalNodes>
+          <leafValues>
+            -9.7409002482891083e-02 4.1662400960922241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2286 -2.1199999901000410e-04</internalNodes>
+          <leafValues>
+            1.1271899938583374e-01 -4.1653999686241150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2287 -2.0597999915480614e-02</internalNodes>
+          <leafValues>
+            6.0540497303009033e-01 6.2467999756336212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2288 3.7353999912738800e-02</internalNodes>
+          <leafValues>
+            -1.8919000029563904e-01 4.6464699506759644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2289 5.7275000959634781e-02</internalNodes>
+          <leafValues>
+            1.1565300077199936e-01 -1.3213009834289551e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2290 5.1029999740421772e-03</internalNodes>
+          <leafValues>
+            -2.8061500191688538e-01 1.9313399493694305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2291 -5.4644998162984848e-02</internalNodes>
+          <leafValues>
+            7.2428500652313232e-01 7.5447998940944672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2292 2.5349000468850136e-02</internalNodes>
+          <leafValues>
+            -1.9481800496578217e-01 4.6032801270484924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2293 2.4311000481247902e-02</internalNodes>
+          <leafValues>
+            1.5564100444316864e-01 -4.9913901090621948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2294 3.5962000489234924e-02</internalNodes>
+          <leafValues>
+            -5.8573000133037567e-02 -1.5418399572372437e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2295 -1.0000699758529663e-01</internalNodes>
+          <leafValues>
+            -1.6100039482116699e+00 1.1450500041246414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2296 8.4435999393463135e-02</internalNodes>
+          <leafValues>
+            -6.1406999826431274e-02 -1.4673349857330322e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2297 1.5947999432682991e-02</internalNodes>
+          <leafValues>
+            1.6287900507450104e-01 -1.1026400327682495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2298 3.3824000507593155e-02</internalNodes>
+          <leafValues>
+            -1.7932699620723724e-01 5.7218402624130249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2299 -6.1996001750230789e-02</internalNodes>
+          <leafValues>
+            4.6511812210083008e+00 9.4534002244472504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2300 6.9876998662948608e-02</internalNodes>
+          <leafValues>
+            -1.6985900700092316e-01 8.7028998136520386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2301 -2.7916999533772469e-02</internalNodes>
+          <leafValues>
+            9.1042500734329224e-01 5.6827001273632050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2302 -1.2764000333845615e-02</internalNodes>
+          <leafValues>
+            2.2066700458526611e-01 -2.7769100666046143e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>199</maxWeakCount>
+      <stageThreshold>-3.2573320865631104e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2303 2.1662000566720963e-02</internalNodes>
+          <leafValues>
+            -8.9868897199630737e-01 2.9436299204826355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2304 1.0044500231742859e-01</internalNodes>
+          <leafValues>
+            -3.7659201025962830e-01 6.0891002416610718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2305 2.6003999635577202e-02</internalNodes>
+          <leafValues>
+            -3.8128501176834106e-01 3.9217400550842285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2306 2.8441000729799271e-02</internalNodes>
+          <leafValues>
+            -1.8182300031185150e-01 5.8927202224731445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2307 3.8612000644207001e-02</internalNodes>
+          <leafValues>
+            -2.2399599850177765e-01 6.3779997825622559e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2308 -4.6594999730587006e-02</internalNodes>
+          <leafValues>
+            7.0812201499938965e-01 -1.4666199684143066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2309 -4.2791999876499176e-02</internalNodes>
+          <leafValues>
+            4.7680398821830750e-01 -2.9233199357986450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2310 3.7960000336170197e-03</internalNodes>
+          <leafValues>
+            -1.8510299921035767e-01 5.2626699209213257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2311 4.2348999530076981e-02</internalNodes>
+          <leafValues>
+            3.9244998246431351e-02 -8.9197701215744019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2312 1.9598999992012978e-02</internalNodes>
+          <leafValues>
+            -2.3358400166034698e-01 4.4146499037742615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2313 8.7400001939386129e-04</internalNodes>
+          <leafValues>
+            -4.6063598990440369e-01 1.7689600586891174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2314 -4.3629999272525311e-03</internalNodes>
+          <leafValues>
+            3.3493199944496155e-01 -2.9893401265144348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2315 1.6973000019788742e-02</internalNodes>
+          <leafValues>
+            -1.6408699750900269e-01 1.5993679761886597e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2316 3.6063998937606812e-02</internalNodes>
+          <leafValues>
+            2.2601699829101562e-01 -5.3186100721359253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2317 -7.0864997804164886e-02</internalNodes>
+          <leafValues>
+            1.5220500528812408e-01 -4.1914600133895874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2318 -6.3075996935367584e-02</internalNodes>
+          <leafValues>
+            -1.4874019622802734e+00 1.2953700125217438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2319 2.9670000076293945e-02</internalNodes>
+          <leafValues>
+            -1.9145900011062622e-01 9.8184901475906372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2320 3.7873998284339905e-02</internalNodes>
+          <leafValues>
+            1.3459500670433044e-01 -5.6316298246383667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2321 -3.3289000391960144e-02</internalNodes>
+          <leafValues>
+            -1.0828030109405518e+00 -1.1504000052809715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2322 -3.1608998775482178e-02</internalNodes>
+          <leafValues>
+            -5.9224498271942139e-01 1.3394799828529358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2323 1.0740000288933516e-03</internalNodes>
+          <leafValues>
+            -4.9185800552368164e-01 9.4446003437042236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2324 -7.1556001901626587e-02</internalNodes>
+          <leafValues>
+            5.9710198640823364e-01 -3.9553001523017883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2325 -8.1170000135898590e-02</internalNodes>
+          <leafValues>
+            -1.1817820072174072e+00 -2.8254000470042229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2326 4.4860001653432846e-03</internalNodes>
+          <leafValues>
+            -6.1028099060058594e-01 2.2619099915027618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2327 -4.2176000773906708e-02</internalNodes>
+          <leafValues>
+            -1.1435619592666626e+00 -2.9001999646425247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2328 -6.5640002489089966e-02</internalNodes>
+          <leafValues>
+            -1.6470279693603516e+00 1.2810300290584564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2329 1.8188999965786934e-02</internalNodes>
+          <leafValues>
+            -3.1149399280548096e-01 2.5739601254463196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2330 -5.1520001143217087e-02</internalNodes>
+          <leafValues>
+            -6.9206899404525757e-01 1.5270799398422241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2331 -4.7150999307632446e-02</internalNodes>
+          <leafValues>
+            -7.1868300437927246e-01 2.6879999786615372e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2332 1.7488999292254448e-02</internalNodes>
+          <leafValues>
+            2.2371199727058411e-01 -5.5381798744201660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2333 -2.5264000520110130e-02</internalNodes>
+          <leafValues>
+            1.0319819450378418e+00 -1.7496499419212341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2334 -4.0745001286268234e-02</internalNodes>
+          <leafValues>
+            4.4961598515510559e-01 3.9349000900983810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2335 -3.7666998803615570e-02</internalNodes>
+          <leafValues>
+            -8.5475701093673706e-01 -1.2463999912142754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2336 -1.3411000370979309e-02</internalNodes>
+          <leafValues>
+            5.7845598459243774e-01 -1.7467999830842018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2337 -7.8999997640494257e-05</internalNodes>
+          <leafValues>
+            -3.7749201059341431e-01 1.3961799442768097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2338 -1.1415000073611736e-02</internalNodes>
+          <leafValues>
+            -2.6186600327491760e-01 2.3712499439716339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2339 3.7200000137090683e-02</internalNodes>
+          <leafValues>
+            -2.8626000508666039e-02 -1.2945239543914795e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2340 3.4050000831484795e-03</internalNodes>
+          <leafValues>
+            2.0531399548053741e-01 -1.8747499585151672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2341 -2.2483000531792641e-02</internalNodes>
+          <leafValues>
+            6.7027199268341064e-01 -1.9594000279903412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2342 2.3274999111890793e-02</internalNodes>
+          <leafValues>
+            1.7405399680137634e-01 -3.2746300101280212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2343 -1.3917000032961369e-02</internalNodes>
+          <leafValues>
+            -8.3954298496246338e-01 -6.3760001212358475e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2344 7.5429999269545078e-03</internalNodes>
+          <leafValues>
+            -3.4194998443126678e-02 5.8998197317123413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2345 -1.1539000086486340e-02</internalNodes>
+          <leafValues>
+            4.2142799496650696e-01 -2.3510499298572540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2346 5.2501998841762543e-02</internalNodes>
+          <leafValues>
+            6.9303996860980988e-02 7.3226499557495117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2347 5.2715998142957687e-02</internalNodes>
+          <leafValues>
+            -1.5688100457191467e-01 1.0907289981842041e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2348 -1.1726000346243382e-02</internalNodes>
+          <leafValues>
+            -7.0934301614761353e-01 1.6828800737857819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2349 9.5945999026298523e-02</internalNodes>
+          <leafValues>
+            -1.6192899644374847e-01 1.0072519779205322e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2350 -1.5871999785304070e-02</internalNodes>
+          <leafValues>
+            3.9008399844169617e-01 -5.3777001798152924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2351 3.4818001091480255e-02</internalNodes>
+          <leafValues>
+            1.7179999500513077e-02 -9.3941801786422729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2352 3.4791998565196991e-02</internalNodes>
+          <leafValues>
+            5.0462998449802399e-02 5.4465699195861816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2353 1.6284000128507614e-02</internalNodes>
+          <leafValues>
+            -2.6981300115585327e-01 4.0365299582481384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2354 -4.4319000095129013e-02</internalNodes>
+          <leafValues>
+            8.4399998188018799e-01 3.2882999628782272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2355 -5.5689997971057892e-03</internalNodes>
+          <leafValues>
+            1.5309399366378784e-01 -3.4959799051284790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2356 -6.5842002630233765e-02</internalNodes>
+          <leafValues>
+            -9.2711198329925537e-01 1.6800999641418457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2357 -7.3337003588676453e-02</internalNodes>
+          <leafValues>
+            5.1614499092102051e-01 -2.0236000418663025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2358 1.6450000926852226e-02</internalNodes>
+          <leafValues>
+            1.3950599730014801e-01 -4.9301299452781677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2359 -9.2630004510283470e-03</internalNodes>
+          <leafValues>
+            -9.0101999044418335e-01 -1.6116000711917877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2360 5.9139998629689217e-03</internalNodes>
+          <leafValues>
+            1.9858199357986450e-01 -1.6731299459934235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2361 -8.4699998842552304e-04</internalNodes>
+          <leafValues>
+            9.4005003571510315e-02 -4.1570898890495300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2362 2.0532900094985962e-01</internalNodes>
+          <leafValues>
+            -6.0022000223398209e-02 7.0993602275848389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2363 -1.6883000731468201e-02</internalNodes>
+          <leafValues>
+            2.4392199516296387e-01 -3.0551800131797791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2364 -1.9111000001430511e-02</internalNodes>
+          <leafValues>
+            6.1229902505874634e-01 2.4252999573945999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2365 -2.5962999090552330e-02</internalNodes>
+          <leafValues>
+            9.0764999389648438e-01 -1.6722099483013153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2366 -2.1762000396847725e-02</internalNodes>
+          <leafValues>
+            -3.1384700536727905e-01 2.0134599506855011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2367 -2.4119999259710312e-02</internalNodes>
+          <leafValues>
+            -6.6588401794433594e-01 7.4559999629855156e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2368 4.7129999846220016e-02</internalNodes>
+          <leafValues>
+            5.9533998370170593e-02 8.7804502248764038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2369 -4.5984998345375061e-02</internalNodes>
+          <leafValues>
+            8.0067998170852661e-01 -1.7252300679683685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2370 2.6507999747991562e-02</internalNodes>
+          <leafValues>
+            1.8774099647998810e-01 -6.0850602388381958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2371 -4.8615001142024994e-02</internalNodes>
+          <leafValues>
+            5.8644098043441772e-01 -1.9427700340747833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2372 -1.8562000244855881e-02</internalNodes>
+          <leafValues>
+            -2.5587901473045349e-01 1.6326199471950531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2373 1.2678000144660473e-02</internalNodes>
+          <leafValues>
+            -1.4228000305593014e-02 -7.6738101243972778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2374 -1.1919999960809946e-03</internalNodes>
+          <leafValues>
+            2.0495000481605530e-01 -1.1404299736022949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2375 -4.9088999629020691e-02</internalNodes>
+          <leafValues>
+            -1.0740849971771240e+00 -3.8940999656915665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2376 -1.7436999827623367e-02</internalNodes>
+          <leafValues>
+            -5.7973802089691162e-01 1.8584500253200531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2377 -1.4770000241696835e-02</internalNodes>
+          <leafValues>
+            -6.6150301694869995e-01 5.3119999356567860e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2378 -2.2905200719833374e-01</internalNodes>
+          <leafValues>
+            -4.8305100202560425e-01 1.2326399981975555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2379 -1.2707099318504333e-01</internalNodes>
+          <leafValues>
+            5.7452601194381714e-01 -1.9420400261878967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2380 1.0339000262320042e-02</internalNodes>
+          <leafValues>
+            -5.4641999304294586e-02 2.4501800537109375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2381 6.9010001607239246e-03</internalNodes>
+          <leafValues>
+            1.2180600315332413e-01 -3.8797399401664734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2382 2.9025399684906006e-01</internalNodes>
+          <leafValues>
+            1.0966199636459351e-01 -30.</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2383 -2.3804999887943268e-01</internalNodes>
+          <leafValues>
+            -1.7352679967880249e+00 -6.3809998333454132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2384 6.2481001019477844e-02</internalNodes>
+          <leafValues>
+            1.3523000478744507e-01 -7.0301097631454468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2385 4.7109997831285000e-03</internalNodes>
+          <leafValues>
+            -4.6984100341796875e-01 6.0341998934745789e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2386 -2.7815999463200569e-02</internalNodes>
+          <leafValues>
+            6.9807600975036621e-01 1.3719999697059393e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2387 -1.7020000144839287e-02</internalNodes>
+          <leafValues>
+            1.6870440244674683e+00 -1.4314800500869751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2388 -4.9754999577999115e-02</internalNodes>
+          <leafValues>
+            7.9497700929641724e-01 7.7199999941512942e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2389 -7.4732996523380280e-02</internalNodes>
+          <leafValues>
+            -1.0132360458374023e+00 -1.9388999789953232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2390 3.2009001821279526e-02</internalNodes>
+          <leafValues>
+            1.4412100613117218e-01 -4.2139101028442383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2391 -9.4463996589183807e-02</internalNodes>
+          <leafValues>
+            5.0682598352432251e-01 -2.0478899776935577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2392 -1.5426999889314175e-02</internalNodes>
+          <leafValues>
+            -1.5811300277709961e-01 1.7806899547576904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2393 -4.0540001355111599e-03</internalNodes>
+          <leafValues>
+            -5.4366701841354370e-01 3.1235000118613243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2394 3.0080000869929790e-03</internalNodes>
+          <leafValues>
+            -1.7376799881458282e-01 3.0441701412200928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2395 -1.0091999545693398e-02</internalNodes>
+          <leafValues>
+            2.5103801488876343e-01 -2.6224100589752197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2396 -3.8818001747131348e-02</internalNodes>
+          <leafValues>
+            9.3226701021194458e-01 7.2659999132156372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2397 3.4651998430490494e-02</internalNodes>
+          <leafValues>
+            -3.3934999257326126e-02 -8.5707902908325195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2398 -4.6729999594390392e-03</internalNodes>
+          <leafValues>
+            3.4969300031661987e-01 -4.8517998307943344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2399 6.8499997723847628e-04</internalNodes>
+          <leafValues>
+            6.6573001444339752e-02 -4.4973799586296082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2400 3.5317000001668930e-02</internalNodes>
+          <leafValues>
+            1.4275799691677094e-01 -4.6726399660110474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2401 -2.3569999262690544e-02</internalNodes>
+          <leafValues>
+            -1.0286079645156860e+00 -4.5288000255823135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2402 -1.9109999993816018e-03</internalNodes>
+          <leafValues>
+            -1.9652199745178223e-01 2.8661000728607178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2403 -1.6659000888466835e-02</internalNodes>
+          <leafValues>
+            -7.7532202005386353e-01 -8.3280000835657120e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2404 6.6062200069427490e-01</internalNodes>
+          <leafValues>
+            1.3232499361038208e-01 -3.5266680717468262e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2405 1.0970599949359894e-01</internalNodes>
+          <leafValues>
+            -1.5547199547290802e-01 1.4674140214920044e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2406 1.3500999659299850e-02</internalNodes>
+          <leafValues>
+            1.5233400464057922e-01 -1.3020930290222168e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2407 -2.2871999070048332e-02</internalNodes>
+          <leafValues>
+            -7.1325999498367310e-01 -8.7040001526474953e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2408 -8.1821002066135406e-02</internalNodes>
+          <leafValues>
+            1.1127580404281616e+00 8.3219997584819794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2409 -5.2728001028299332e-02</internalNodes>
+          <leafValues>
+            9.3165099620819092e-01 -1.7103999853134155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2410 -2.5242000818252563e-02</internalNodes>
+          <leafValues>
+            -1.9733799993991852e-01 2.5359401106834412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2411 -4.3818999081850052e-02</internalNodes>
+          <leafValues>
+            4.1815200448036194e-01 -2.4585500359535217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2412 -1.8188999965786934e-02</internalNodes>
+          <leafValues>
+            -5.1743197441101074e-01 2.0174199342727661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2413 2.3466000333428383e-02</internalNodes>
+          <leafValues>
+            -4.3071001768112183e-02 -1.0636579990386963e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2414 3.4216001629829407e-02</internalNodes>
+          <leafValues>
+            5.3780999034643173e-02 4.9707201123237610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2415 2.5692999362945557e-02</internalNodes>
+          <leafValues>
+            -2.3800100386142731e-01 4.1651499271392822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2416 -2.6565000414848328e-02</internalNodes>
+          <leafValues>
+            -8.8574802875518799e-01 1.3365900516510010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2417 6.0942001640796661e-02</internalNodes>
+          <leafValues>
+            -2.0669700205326080e-01 5.8309000730514526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2418 1.4474500715732574e-01</internalNodes>
+          <leafValues>
+            1.3282300531864166e-01 -3.1449348926544189e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2419 5.3410999476909637e-02</internalNodes>
+          <leafValues>
+            -1.7325200140476227e-01 6.9190698862075806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2420 1.1408000253140926e-02</internalNodes>
+          <leafValues>
+            5.4822001606225967e-02 3.0240398645401001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2421 -2.3179999552667141e-03</internalNodes>
+          <leafValues>
+            1.5820899605751038e-01 -3.1973201036453247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2422 -2.9695000499486923e-02</internalNodes>
+          <leafValues>
+            7.1274799108505249e-01 5.8136001229286194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2423 2.7249999344348907e-02</internalNodes>
+          <leafValues>
+            -1.5754100680351257e-01 9.2143797874450684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2424 -3.6200000904500484e-03</internalNodes>
+          <leafValues>
+            -3.4548398852348328e-01 2.0220999419689178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2425 -1.2578999623656273e-02</internalNodes>
+          <leafValues>
+            -5.5650299787521362e-01 2.0388999953866005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2426 -8.8849000632762909e-02</internalNodes>
+          <leafValues>
+            -3.6100010871887207e+00 1.3164199888706207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2427 -1.9256999716162682e-02</internalNodes>
+          <leafValues>
+            5.1908999681472778e-01 -1.9284300506114960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2428 -1.6666999086737633e-02</internalNodes>
+          <leafValues>
+            -8.7499998509883881e-02 1.5812499821186066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2429 1.2931999750435352e-02</internalNodes>
+          <leafValues>
+            2.7405999600887299e-02 -5.5123901367187500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2430 -1.3431999832391739e-02</internalNodes>
+          <leafValues>
+            2.3457799851894379e-01 -4.3235000222921371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2431 1.8810000270605087e-02</internalNodes>
+          <leafValues>
+            -3.9680998772382736e-02 -9.4373297691345215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2432 -6.4349998719990253e-03</internalNodes>
+          <leafValues>
+            4.5703700184822083e-01 -4.0520001202821732e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2433 -2.4249000474810600e-02</internalNodes>
+          <leafValues>
+            -7.6248002052307129e-01 -1.9857000559568405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2434 -2.9667999595403671e-02</internalNodes>
+          <leafValues>
+            -3.7412509918212891e+00 1.1250600218772888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2435 5.1150000654160976e-03</internalNodes>
+          <leafValues>
+            -6.3781797885894775e-01 1.1223999783396721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2436 -5.7819997891783714e-03</internalNodes>
+          <leafValues>
+            1.9374400377273560e-01 -8.2042001187801361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2437 1.6606999561190605e-02</internalNodes>
+          <leafValues>
+            -1.6192099452018738e-01 1.1334990262985229e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2438 3.8228001445531845e-02</internalNodes>
+          <leafValues>
+            2.1105000749230385e-02 7.6264202594757080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2439 -5.7094000279903412e-02</internalNodes>
+          <leafValues>
+            -1.6974929571151733e+00 -5.9762001037597656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2440 -5.3883001208305359e-02</internalNodes>
+          <leafValues>
+            1.1850190162658691e+00 9.0966999530792236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2441 -2.6110000908374786e-03</internalNodes>
+          <leafValues>
+            -4.0941199660301208e-01 8.3820998668670654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2442 2.9714399576187134e-01</internalNodes>
+          <leafValues>
+            1.5529899299144745e-01 -1.0995409488677979e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2443 -8.9063003659248352e-02</internalNodes>
+          <leafValues>
+            4.8947200179100037e-01 -2.0041200518608093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2444 -5.6193001568317413e-02</internalNodes>
+          <leafValues>
+            -2.4581399559974670e-01 1.4365500211715698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2445 3.7004999816417694e-02</internalNodes>
+          <leafValues>
+            -4.8168998211622238e-02 -1.2310709953308105e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2446 -8.4840003401041031e-03</internalNodes>
+          <leafValues>
+            4.3372601270675659e-01 1.3779999688267708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2447 -2.4379999376833439e-03</internalNodes>
+          <leafValues>
+            1.8949699401855469e-01 -3.2294198870658875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2448 -7.1639999747276306e-02</internalNodes>
+          <leafValues>
+            -4.3979001045227051e-01 2.2730199992656708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2449 5.2260002121329308e-03</internalNodes>
+          <leafValues>
+            -2.0548400282859802e-01 5.0933301448822021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2450 -6.1360001564025879e-03</internalNodes>
+          <leafValues>
+            3.1157198548316956e-01 7.0680998265743256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2451 1.5595000237226486e-02</internalNodes>
+          <leafValues>
+            -3.0934798717498779e-01 1.5627700090408325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2452 2.5995999574661255e-02</internalNodes>
+          <leafValues>
+            1.3821600377559662e-01 -1.7616599798202515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2453 -1.2085000053048134e-02</internalNodes>
+          <leafValues>
+            -5.1070201396942139e-01 5.8440998196601868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2454 -6.7836001515388489e-02</internalNodes>
+          <leafValues>
+            4.7757101058959961e-01 -7.1446001529693604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2455 -1.4715000055730343e-02</internalNodes>
+          <leafValues>
+            4.5238900184631348e-01 -1.9861400127410889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2456 2.5118999183177948e-02</internalNodes>
+          <leafValues>
+            1.2954899668693542e-01 -8.6266398429870605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2457 1.8826000392436981e-02</internalNodes>
+          <leafValues>
+            -4.1570000350475311e-02 -1.1354700326919556e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2458 -2.1263999864459038e-02</internalNodes>
+          <leafValues>
+            -3.4738001227378845e-01 1.5779499709606171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2459 9.4609996303915977e-03</internalNodes>
+          <leafValues>
+            4.8639997839927673e-03 -6.1654800176620483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2460 2.2957700490951538e-01</internalNodes>
+          <leafValues>
+            8.1372998654842377e-02 6.9841402769088745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2461 -3.8061998784542084e-02</internalNodes>
+          <leafValues>
+            1.1616369485855103e+00 -1.4976699650287628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2462 -1.3484999537467957e-02</internalNodes>
+          <leafValues>
+            -3.2036399841308594e-01 1.7365099489688873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2463 3.6238998174667358e-02</internalNodes>
+          <leafValues>
+            -1.8158499896526337e-01 6.1956697702407837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2464 6.7210001870989799e-03</internalNodes>
+          <leafValues>
+            7.9600000753998756e-04 4.2441400885581970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2465 9.6525996923446655e-02</internalNodes>
+          <leafValues>
+            -1.4696800708770752e-01 1.2525680065155029e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2466 -3.5656999796628952e-02</internalNodes>
+          <leafValues>
+            -3.9781698584556580e-01 1.4191399514675140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2467 1.0772000066936016e-02</internalNodes>
+          <leafValues>
+            -1.8194000422954559e-01 5.9762197732925415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2468 7.9279996454715729e-02</internalNodes>
+          <leafValues>
+            1.4642499387264252e-01 -7.8836899995803833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2469 3.2841000705957413e-02</internalNodes>
+          <leafValues>
+            -6.2408000230789185e-02 -1.4227490425109863e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2470 -2.7781000360846519e-02</internalNodes>
+          <leafValues>
+            3.4033098816871643e-01 3.0670000240206718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2471 -4.0339999832212925e-03</internalNodes>
+          <leafValues>
+            3.1084701418876648e-01 -2.2595700621604919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2472 7.4260002002120018e-03</internalNodes>
+          <leafValues>
+            -3.8936998695135117e-02 3.1702101230621338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2473 1.1213999986648560e-01</internalNodes>
+          <leafValues>
+            -1.7578299343585968e-01 6.5056598186492920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2474 -1.1878100037574768e-01</internalNodes>
+          <leafValues>
+            -1.0092990398406982e+00 1.1069700121879578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2475 -4.1584998369216919e-02</internalNodes>
+          <leafValues>
+            -5.3806400299072266e-01 1.9905000925064087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2476 -2.7966000139713287e-02</internalNodes>
+          <leafValues>
+            4.8143199086189270e-01 3.3590998500585556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2477 -1.2506400048732758e-01</internalNodes>
+          <leafValues>
+            2.6352199912071228e-01 -2.5737899541854858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2478 2.3666900396347046e-01</internalNodes>
+          <leafValues>
+            3.6508001387119293e-02 9.0655601024627686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2479 -2.9475999996066093e-02</internalNodes>
+          <leafValues>
+            -6.0048800706863403e-01 9.5880003646016121e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2480 3.7792999297380447e-02</internalNodes>
+          <leafValues>
+            1.5506200492382050e-01 -9.5733499526977539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2481 7.2044000029563904e-02</internalNodes>
+          <leafValues>
+            -1.4525899291038513e-01 1.3676730394363403e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2482 9.7759999334812164e-03</internalNodes>
+          <leafValues>
+            1.2915999628603458e-02 2.1640899777412415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2483 5.2154000848531723e-02</internalNodes>
+          <leafValues>
+            -1.6359999775886536e-02 -8.8356298208236694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2484 -4.3790999799966812e-02</internalNodes>
+          <leafValues>
+            3.5829600691795349e-01 6.5131001174449921e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2485 -3.8378998637199402e-02</internalNodes>
+          <leafValues>
+            1.1961040496826172e+00 -1.4971500635147095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2486 -9.8838999867439270e-02</internalNodes>
+          <leafValues>
+            -6.1834001541137695e-01 1.2786200642585754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2487 -1.2190700322389603e-01</internalNodes>
+          <leafValues>
+            -1.8276120424270630e+00 -6.4862996339797974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2488 -1.1981700360774994e-01</internalNodes>
+          <leafValues>
+            -30. 1.1323300004005432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2489 3.0910000205039978e-02</internalNodes>
+          <leafValues>
+            -2.3934000730514526e-01 3.6332899332046509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2490 1.0800999589264393e-02</internalNodes>
+          <leafValues>
+            -3.5140000283718109e-02 2.7707898616790771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2491 5.6844998151063919e-02</internalNodes>
+          <leafValues>
+            -1.5524299442768097e-01 1.0802700519561768e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2492 1.0280000278726220e-03</internalNodes>
+          <leafValues>
+            -6.1202999204397202e-02 2.0508000254631042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2493 -2.8273999691009521e-02</internalNodes>
+          <leafValues>
+            -6.4778000116348267e-01 2.3917000740766525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2494 -1.6013599932193756e-01</internalNodes>
+          <leafValues>
+            1.0892050266265869e+00 5.8389000594615936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2495 4.9629998393356800e-03</internalNodes>
+          <leafValues>
+            -2.5806298851966858e-01 2.0834599435329437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2496 4.6937000006437302e-02</internalNodes>
+          <leafValues>
+            1.3886299729347229e-01 -1.5662620067596436e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2497 2.4286000058054924e-02</internalNodes>
+          <leafValues>
+            -2.0728300511837006e-01 5.2430999279022217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2498 7.0202000439167023e-02</internalNodes>
+          <leafValues>
+            1.4796899259090424e-01 -1.3095090389251709e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2499 9.8120002076029778e-03</internalNodes>
+          <leafValues>
+            2.7906000614166260e-02 -5.0864601135253906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2500 -5.6200999766588211e-02</internalNodes>
+          <leafValues>
+            1.2618130445480347e+00 6.3801996409893036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2501 1.0982800275087357e-01</internalNodes>
+          <leafValues>
+            -1.2850099802017212e-01 3.0776169300079346e+00</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>211</maxWeakCount>
+      <stageThreshold>-3.3703000545501709e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2502 2.0910000428557396e-02</internalNodes>
+          <leafValues>
+            -6.8559402227401733e-01 3.8984298706054688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2503 3.5032000392675400e-02</internalNodes>
+          <leafValues>
+            -4.7724398970603943e-01 4.5027199387550354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2504 3.9799001067876816e-02</internalNodes>
+          <leafValues>
+            -4.7011101245880127e-01 4.2702499032020569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2505 -4.8409998416900635e-03</internalNodes>
+          <leafValues>
+            2.5614300370216370e-01 -6.6556298732757568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2506 2.3439999204128981e-03</internalNodes>
+          <leafValues>
+            -4.8083499073982239e-01 2.8013798594474792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2507 2.5312999263405800e-02</internalNodes>
+          <leafValues>
+            -2.3948200047016144e-01 4.4191798567771912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2508 -3.2193001359701157e-02</internalNodes>
+          <leafValues>
+            7.6086699962615967e-01 -2.5059100985527039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2509 7.5409002602100372e-02</internalNodes>
+          <leafValues>
+            -3.4974598884582520e-01 3.4380298852920532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2510 -1.8469000235199928e-02</internalNodes>
+          <leafValues>
+            -7.9085600376129150e-01 3.4788001328706741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2511 -1.2802000157535076e-02</internalNodes>
+          <leafValues>
+            4.7107800841331482e-01 -6.0006000101566315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2512 -2.6598000898957253e-02</internalNodes>
+          <leafValues>
+            6.7116099596023560e-01 -2.4257500469684601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2513 2.1988999098539352e-02</internalNodes>
+          <leafValues>
+            2.4717499315738678e-01 -4.8301699757575989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2514 1.4654099941253662e-01</internalNodes>
+          <leafValues>
+            -2.1504099667072296e-01 7.2055900096893311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2515 3.5310001112520695e-03</internalNodes>
+          <leafValues>
+            2.7930998802185059e-01 -3.4339898824691772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2516 9.4010001048445702e-03</internalNodes>
+          <leafValues>
+            5.5861998349428177e-02 -8.2143598794937134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2517 -8.6390003561973572e-03</internalNodes>
+          <leafValues>
+            -9.9620598554611206e-01 1.8874999880790710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2518 -3.9193000644445419e-02</internalNodes>
+          <leafValues>
+            -1.1945559978485107e+00 -2.9198000207543373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2519 2.4855000898241997e-02</internalNodes>
+          <leafValues>
+            1.4987599849700928e-01 -5.4137802124023438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2520 -3.4995000809431076e-02</internalNodes>
+          <leafValues>
+            -1.4210180044174194e+00 -4.2314000427722931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2521 -1.8378999084234238e-02</internalNodes>
+          <leafValues>
+            -2.8242599964141846e-01 1.5581800043582916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2522 -1.3592000119388103e-02</internalNodes>
+          <leafValues>
+            4.7317099571228027e-01 -2.1937200427055359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2523 6.2629999592900276e-03</internalNodes>
+          <leafValues>
+            -5.9714000672101974e-02 6.0625898838043213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2524 -1.8478000536561012e-02</internalNodes>
+          <leafValues>
+            -8.5647201538085938e-01 -1.3783999718725681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2525 1.4236000366508961e-02</internalNodes>
+          <leafValues>
+            1.6654799878597260e-01 -2.7713999152183533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2526 -3.2547000795602798e-02</internalNodes>
+          <leafValues>
+            -1.1728240251541138e+00 -4.0185000747442245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2527 -2.6410000864416361e-03</internalNodes>
+          <leafValues>
+            2.6514300704002380e-01 -5.6343000382184982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2528 -8.7799999164417386e-04</internalNodes>
+          <leafValues>
+            3.6556001752614975e-02 -5.5075198411941528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2529 4.7371998429298401e-02</internalNodes>
+          <leafValues>
+            -4.2614001780748367e-02 4.8194900155067444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2530 -7.0790001191198826e-03</internalNodes>
+          <leafValues>
+            2.8698998689651489e-01 -3.2923001050949097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2531 -4.3145999312400818e-02</internalNodes>
+          <leafValues>
+            -1.4065419435501099e+00 1.2836399674415588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2532 2.0592000335454941e-02</internalNodes>
+          <leafValues>
+            -2.1435299515724182e-01 5.3981798887252808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2533 -2.2367000579833984e-02</internalNodes>
+          <leafValues>
+            3.3718299865722656e-01 4.5212000608444214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2534 5.0039999186992645e-02</internalNodes>
+          <leafValues>
+            -2.5121700763702393e-01 4.1750499606132507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2535 6.1794999986886978e-02</internalNodes>
+          <leafValues>
+            4.0084999054670334e-02 6.8779802322387695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2536 -4.1861999779939651e-02</internalNodes>
+          <leafValues>
+            5.3027397394180298e-01 -2.2901999950408936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2537 -3.1959998887032270e-03</internalNodes>
+          <leafValues>
+            2.5161498785018921e-01 -2.1514600515365601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2538 2.4255000054836273e-02</internalNodes>
+          <leafValues>
+            7.2320001199841499e-03 -7.2519099712371826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2539 -1.7303999513387680e-02</internalNodes>
+          <leafValues>
+            -4.9958199262619019e-01 1.8394500017166138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2540 -4.1470001451671124e-03</internalNodes>
+          <leafValues>
+            8.5211999714374542e-02 -4.6364700794219971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2541 -1.4369999989867210e-02</internalNodes>
+          <leafValues>
+            -5.2258902788162231e-01 2.3892599344253540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2542 -9.0399999171495438e-03</internalNodes>
+          <leafValues>
+            -6.3250398635864258e-01 3.2551001757383347e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2543 -1.2373100221157074e-01</internalNodes>
+          <leafValues>
+            1.2856210470199585e+00 7.6545000076293945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2544 -8.2221999764442444e-02</internalNodes>
+          <leafValues>
+            8.3208197355270386e-01 -1.8590599298477173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2545 6.5659001469612122e-02</internalNodes>
+          <leafValues>
+            1.1298800259828568e-01 -30.</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2546 -3.1582999974489212e-02</internalNodes>
+          <leafValues>
+            -1.3485900163650513e+00 -4.7097001224756241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2547 -7.9636000096797943e-02</internalNodes>
+          <leafValues>
+            -1.3533639907836914e+00 1.5668800473213196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2548 -1.8880000337958336e-02</internalNodes>
+          <leafValues>
+            4.0300300717353821e-01 -2.5148901343345642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2549 -5.0149997696280479e-03</internalNodes>
+          <leafValues>
+            -2.6287099719047546e-01 1.8582500517368317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2550 -1.2218000367283821e-02</internalNodes>
+          <leafValues>
+            5.8692401647567749e-01 -1.9427700340747833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2551 1.2710000155493617e-03</internalNodes>
+          <leafValues>
+            -1.6688999533653259e-01 2.3006899654865265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2552 2.9743999242782593e-02</internalNodes>
+          <leafValues>
+            1.2520000338554382e-02 -6.6723597049713135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2553 2.8175000101327896e-02</internalNodes>
+          <leafValues>
+            -1.7060000449419022e-02 6.4579397439956665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2554 3.0345000326633453e-02</internalNodes>
+          <leafValues>
+            -2.4178700149059296e-01 3.4878900647163391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2555 -1.7325999215245247e-02</internalNodes>
+          <leafValues>
+            -5.3599399328231812e-01 2.0995999872684479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2556 -8.4178000688552856e-02</internalNodes>
+          <leafValues>
+            7.5093299150466919e-01 -1.7593200504779816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2557 7.4950000271201134e-03</internalNodes>
+          <leafValues>
+            -1.6188099980354309e-01 3.0657500028610229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2558 5.6494999676942825e-02</internalNodes>
+          <leafValues>
+            -1.7318800091743469e-01 1.0016150474548340e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2559 -5.2939997985959053e-03</internalNodes>
+          <leafValues>
+            2.3417599499225616e-01 -6.5347000956535339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2560 -1.4945000410079956e-02</internalNodes>
+          <leafValues>
+            2.5018900632858276e-01 -3.0591198801994324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2561 5.4919000715017319e-02</internalNodes>
+          <leafValues>
+            1.3121999800205231e-01 -9.3765097856521606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2562 -1.9721999764442444e-02</internalNodes>
+          <leafValues>
+            -8.3978497982025146e-01 -2.3473000153899193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2563 -6.7158997058868408e-02</internalNodes>
+          <leafValues>
+            2.3586840629577637e+00 8.2970999181270599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2564 -1.4325999654829502e-02</internalNodes>
+          <leafValues>
+            1.8814499676227570e-01 -3.1221601366996765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2565 2.9841000214219093e-02</internalNodes>
+          <leafValues>
+            1.4825099706649780e-01 -8.4681701660156250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2566 5.1883000880479813e-02</internalNodes>
+          <leafValues>
+            -4.3731000274419785e-02 -1.3366169929504395e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2567 4.1127000004053116e-02</internalNodes>
+          <leafValues>
+            1.7660099267959595e-01 -6.0904097557067871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2568 -1.2865099310874939e-01</internalNodes>
+          <leafValues>
+            -9.8701000213623047e-01 -3.7785001099109650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2569 2.4170000106096268e-03</internalNodes>
+          <leafValues>
+            -1.6119599342346191e-01 3.2675701379776001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2570 7.7030002139508724e-03</internalNodes>
+          <leafValues>
+            -2.3841500282287598e-01 2.9319399595260620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2571 4.5520000159740448e-02</internalNodes>
+          <leafValues>
+            1.4424599707126617e-01 -1.5010160207748413e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2572 -7.8700996935367584e-02</internalNodes>
+          <leafValues>
+            -1.0394560098648071e+00 -4.5375999063253403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2573 7.8619997948408127e-03</internalNodes>
+          <leafValues>
+            1.9633600115776062e-01 -1.4472399652004242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2574 -1.3458999805152416e-02</internalNodes>
+          <leafValues>
+            -9.0634697675704956e-01 -3.8049001246690750e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2575 2.8827000409364700e-02</internalNodes>
+          <leafValues>
+            -2.9473999515175819e-02 6.0058397054672241e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2576 -2.7365999296307564e-02</internalNodes>
+          <leafValues>
+            -9.9804002046585083e-01 -3.8653001189231873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2577 -7.2917997837066650e-02</internalNodes>
+          <leafValues>
+            7.3361498117446899e-01 5.7440001517534256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2578 -1.3988999649882317e-02</internalNodes>
+          <leafValues>
+            2.7892601490020752e-01 -2.6516300439834595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2579 4.3242998421192169e-02</internalNodes>
+          <leafValues>
+            4.7760000452399254e-03 3.5925900936126709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2580 2.9533000662922859e-02</internalNodes>
+          <leafValues>
+            -2.0083999633789062e-01 5.1202899217605591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2581 -3.1897000968456268e-02</internalNodes>
+          <leafValues>
+            6.4721697568893433e-01 -1.3760000001639128e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2582 3.7868998944759369e-02</internalNodes>
+          <leafValues>
+            -1.8363800644874573e-01 6.1343097686767578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2583 -2.2417999804019928e-02</internalNodes>
+          <leafValues>
+            -2.9187899827957153e-01 1.8194800615310669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2584 5.8958999812602997e-02</internalNodes>
+          <leafValues>
+            -6.6451996564865112e-02 -1.9290030002593994e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2585 3.1222999095916748e-02</internalNodes>
+          <leafValues>
+            -1.2732000090181828e-02 6.1560797691345215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2586 3.7484999746084213e-02</internalNodes>
+          <leafValues>
+            -2.0856900513172150e-01 4.4363999366760254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2587 -2.0966000854969025e-02</internalNodes>
+          <leafValues>
+            -3.5712799429893494e-01 2.4252200126647949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2588 -2.5477999821305275e-02</internalNodes>
+          <leafValues>
+            1.0846560001373291e+00 -1.5054400265216827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2589 -7.2570000775158405e-03</internalNodes>
+          <leafValues>
+            2.1302600204944611e-01 -1.8308199942111969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2590 -5.0983000546693802e-02</internalNodes>
+          <leafValues>
+            5.1736801862716675e-01 -1.8833099305629730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2591 -2.0640000700950623e-02</internalNodes>
+          <leafValues>
+            -4.4030201435089111e-01 2.2745999693870544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2592 1.0672999545931816e-02</internalNodes>
+          <leafValues>
+            3.5059999674558640e-02 -5.1665002107620239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2593 3.1895998865365982e-02</internalNodes>
+          <leafValues>
+            1.3228000141680241e-02 3.4915199875831604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2594 -2.3824999108910561e-02</internalNodes>
+          <leafValues>
+            3.4118801355361938e-01 -2.1510200202465057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2595 -6.0680001042783260e-03</internalNodes>
+          <leafValues>
+            3.2937398552894592e-01 -2.8523799777030945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2596 2.3881999775767326e-02</internalNodes>
+          <leafValues>
+            -2.5333800911903381e-01 2.6296100020408630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2597 2.7966000139713287e-02</internalNodes>
+          <leafValues>
+            1.4049099385738373e-01 -4.9887099862098694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2598 1.4603000134229660e-02</internalNodes>
+          <leafValues>
+            -1.5395999886095524e-02 -7.6958000659942627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2599 1.0872399806976318e-01</internalNodes>
+          <leafValues>
+            1.9069600105285645e-01 -3.2393100857734680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2600 -1.4038000255823135e-02</internalNodes>
+          <leafValues>
+            3.4924700856208801e-01 -2.2358700633049011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2601 4.0440000593662262e-03</internalNodes>
+          <leafValues>
+            -3.8329001516103745e-02 5.1177299022674561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2602 -4.9769999459385872e-03</internalNodes>
+          <leafValues>
+            -4.2888298630714417e-01 4.9173999577760696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2603 -8.5183002054691315e-02</internalNodes>
+          <leafValues>
+            6.6624599695205688e-01 7.8079998493194580e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2604 2.1559998858720064e-03</internalNodes>
+          <leafValues>
+            -4.9135199189186096e-01 6.9555997848510742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2605 3.6384499073028564e-01</internalNodes>
+          <leafValues>
+            1.2997099757194519e-01 -1.8949509859085083e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2606 2.2082500159740448e-01</internalNodes>
+          <leafValues>
+            -5.7211998850107193e-02 -1.4281120300292969e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2607 -1.6140000894665718e-02</internalNodes>
+          <leafValues>
+            -5.7589399814605713e-01 1.8062500655651093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2608 -4.8330001533031464e-02</internalNodes>
+          <leafValues>
+            9.7308498620986938e-01 -1.6513000428676605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2609 1.7529999837279320e-02</internalNodes>
+          <leafValues>
+            1.7932699620723724e-01 -2.7948901057243347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2610 -3.4309998154640198e-02</internalNodes>
+          <leafValues>
+            -8.1072497367858887e-01 -1.6596000641584396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2611 -4.5830002054572105e-03</internalNodes>
+          <leafValues>
+            2.7908998727798462e-01 -7.4519999325275421e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2612 1.2896400690078735e-01</internalNodes>
+          <leafValues>
+            -1.3508500158786774e-01 2.5411539077758789e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2613 3.0361000448465347e-02</internalNodes>
+          <leafValues>
+            -6.8419001996517181e-02 2.8734099864959717e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2614 4.4086001813411713e-02</internalNodes>
+          <leafValues>
+            -1.8135899305343628e-01 6.5413200855255127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2615 3.0159999150782824e-03</internalNodes>
+          <leafValues>
+            -1.5690499544143677e-01 2.6963800191879272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2616 -2.6336999610066414e-02</internalNodes>
+          <leafValues>
+            2.9175600409507751e-01 -2.5274100899696350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2617 -2.7866000309586525e-02</internalNodes>
+          <leafValues>
+            4.4387501478195190e-01 5.5038001388311386e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2618 1.1725000105798244e-02</internalNodes>
+          <leafValues>
+            -1.9346499443054199e-01 4.6656700968742371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2619 1.5689999563619494e-03</internalNodes>
+          <leafValues>
+            -8.2360003143548965e-03 2.5700899958610535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2620 -3.5550000611692667e-03</internalNodes>
+          <leafValues>
+            -4.2430898547172546e-01 7.1174003183841705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2621 -3.1695000827312469e-02</internalNodes>
+          <leafValues>
+            -8.5393500328063965e-01 1.6916200518608093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2622 -3.2097000628709793e-02</internalNodes>
+          <leafValues>
+            8.3784902095794678e-01 -1.7597299814224243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2623 1.5544199943542480e-01</internalNodes>
+          <leafValues>
+            9.9550001323223114e-02 2.3873300552368164e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2624 8.8045999407768250e-02</internalNodes>
+          <leafValues>
+            -1.8725299835205078e-01 6.2384301424026489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2625 -1.6720000421628356e-03</internalNodes>
+          <leafValues>
+            2.5008699297904968e-01 -6.5118998289108276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2626 9.3409996479749680e-03</internalNodes>
+          <leafValues>
+            -3.5378900170326233e-01 1.0715000331401825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2627 3.7138000130653381e-02</internalNodes>
+          <leafValues>
+            1.6387000679969788e-01 -9.1718399524688721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2628 8.0183997750282288e-02</internalNodes>
+          <leafValues>
+            -1.4812999963760376e-01 1.4895190000534058e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2629 -7.9100002767518163e-04</internalNodes>
+          <leafValues>
+            -2.1326899528503418e-01 1.9676400721073151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2630 -5.0400001928210258e-03</internalNodes>
+          <leafValues>
+            -7.1318697929382324e-01 1.8240000354126096e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2631 1.1962399631738663e-01</internalNodes>
+          <leafValues>
+            3.3098999410867691e-02 1.0441709756851196e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2632 -4.5280000194907188e-03</internalNodes>
+          <leafValues>
+            -2.7308499813079834e-01 2.7229800820350647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2633 -2.9639000073075294e-02</internalNodes>
+          <leafValues>
+            3.6225798726081848e-01 5.6795001029968262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2634 2.6650000363588333e-02</internalNodes>
+          <leafValues>
+            -4.8041000962257385e-02 -9.6723502874374390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2635 4.4422000646591187e-02</internalNodes>
+          <leafValues>
+            1.3052900135517120e-01 -3.5077300667762756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2636 -2.4359999224543571e-02</internalNodes>
+          <leafValues>
+            -1.0766899585723877e+00 -5.1222998648881912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2637 1.9734999164938927e-02</internalNodes>
+          <leafValues>
+            2.6238000020384789e-02 2.8070500493049622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2638 5.4930001497268677e-03</internalNodes>
+          <leafValues>
+            -2.6111298799514771e-01 2.1011400222778320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2639 -2.3200300335884094e-01</internalNodes>
+          <leafValues>
+            -1.7748440504074097e+00 1.1482600122690201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2640 -2.5614000856876373e-02</internalNodes>
+          <leafValues>
+            2.9900801181793213e-01 -2.2502499818801880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2641 -6.4949998632073402e-03</internalNodes>
+          <leafValues>
+            1.9563800096511841e-01 -9.9762998521327972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2642 3.9840000681579113e-03</internalNodes>
+          <leafValues>
+            -4.3021500110626221e-01 8.1261001527309418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2643 -3.5813000053167343e-02</internalNodes>
+          <leafValues>
+            -5.0987398624420166e-01 1.6345900297164917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2644 -1.4169000089168549e-02</internalNodes>
+          <leafValues>
+            7.7978098392486572e-01 -1.7476299405097961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2645 -1.2642100453376770e-01</internalNodes>
+          <leafValues>
+            -6.3047897815704346e-01 1.2728300690650940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2646 6.8677999079227448e-02</internalNodes>
+          <leafValues>
+            -4.6447999775409698e-02 -1.1128979921340942e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2647 8.5864998400211334e-02</internalNodes>
+          <leafValues>
+            1.1835400015115738e-01 -4.8235158920288086e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2648 1.5511999838054180e-02</internalNodes>
+          <leafValues>
+            -1.7467999830842018e-02 -6.3693398237228394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2649 8.1091001629829407e-02</internalNodes>
+          <leafValues>
+            8.6133003234863281e-02 2.4559431076049805e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2650 1.8495000898838043e-02</internalNodes>
+          <leafValues>
+            4.0229000151157379e-02 -5.0858199596405029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2651 -8.6320996284484863e-02</internalNodes>
+          <leafValues>
+            -1.9006760120391846e+00 1.1019100248813629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2652 7.2355002164840698e-02</internalNodes>
+          <leafValues>
+            -6.2111999839544296e-02 -1.4165179729461670e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2653 -7.8179001808166504e-02</internalNodes>
+          <leafValues>
+            8.8849300146102905e-01 4.2369998991489410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2654 9.6681997179985046e-02</internalNodes>
+          <leafValues>
+            -2.2094200551509857e-01 3.3575099706649780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2655 -3.9875999093055725e-02</internalNodes>
+          <leafValues>
+            5.7804799079895020e-01 4.5347999781370163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2656 -9.5349997282028198e-03</internalNodes>
+          <leafValues>
+            -5.4175698757171631e-01 3.2399999909102917e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2657 4.0600000647827983e-04</internalNodes>
+          <leafValues>
+            -8.1549003720283508e-02 3.5837900638580322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2658 1.2107999995350838e-02</internalNodes>
+          <leafValues>
+            -2.0280399918556213e-01 4.3768000602722168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2659 -2.0873999223113060e-02</internalNodes>
+          <leafValues>
+            4.1469898819923401e-01 -4.5568000525236130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2660 5.7888001203536987e-02</internalNodes>
+          <leafValues>
+            -2.9009999707341194e-02 -9.1822302341461182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2661 1.3200000103097409e-04</internalNodes>
+          <leafValues>
+            -1.1772400140762329e-01 2.0000000298023224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2662 -1.7137000337243080e-02</internalNodes>
+          <leafValues>
+            3.3004799485206604e-01 -2.3055200278759003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2663 3.0655000358819962e-02</internalNodes>
+          <leafValues>
+            -2.1545000374317169e-02 2.6878198981285095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2664 -7.8699999721720815e-04</internalNodes>
+          <leafValues>
+            -4.4100698828697205e-01 4.9157999455928802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2665 8.8036999106407166e-02</internalNodes>
+          <leafValues>
+            1.1782000213861465e-01 -2.8293309211730957e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2666 -3.9028998464345932e-02</internalNodes>
+          <leafValues>
+            9.1777199506759644e-01 -1.5827399492263794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2667 8.0105997622013092e-02</internalNodes>
+          <leafValues>
+            1.1289200186729431e-01 -1.9937280416488647e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2668 3.9538998156785965e-02</internalNodes>
+          <leafValues>
+            -1.4357399940490723e-01 1.3085240125656128e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2669 2.0684000104665756e-02</internalNodes>
+          <leafValues>
+            2.0048099756240845e-01 -4.4186998158693314e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2670 -6.7037999629974365e-02</internalNodes>
+          <leafValues>
+            3.2618600130081177e-01 -2.0550400018692017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2671 4.6815000474452972e-02</internalNodes>
+          <leafValues>
+            1.5825299918651581e-01 -9.5535099506378174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2672 7.8443996608257294e-02</internalNodes>
+          <leafValues>
+            -7.4651002883911133e-02 -2.1161499023437500e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2673 6.6380001604557037e-02</internalNodes>
+          <leafValues>
+            1.1641900241374969e-01 -1.6113519668579102e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2674 3.0053999274969101e-02</internalNodes>
+          <leafValues>
+            -1.6562600433826447e-01 7.0025402307510376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2675 1.7119999974966049e-02</internalNodes>
+          <leafValues>
+            2.2627699375152588e-01 -4.0114998817443848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2676 2.0073000341653824e-02</internalNodes>
+          <leafValues>
+            -1.9389699399471283e-01 4.4420298933982849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2677 3.3101998269557953e-02</internalNodes>
+          <leafValues>
+            1.1637499928474426e-01 -1.5771679878234863e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2678 -1.4882000163197517e-02</internalNodes>
+          <leafValues>
+            -8.9680302143096924e-01 -4.2010001838207245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2679 -1.0281000286340714e-02</internalNodes>
+          <leafValues>
+            3.5602998733520508e-01 -1.3124000281095505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2680 -2.8695000335574150e-02</internalNodes>
+          <leafValues>
+            -4.6039599180221558e-01 2.6801999658346176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2681 -4.7189998440444469e-03</internalNodes>
+          <leafValues>
+            2.3788799345493317e-01 -6.5518997609615326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2682 3.2201600074768066e-01</internalNodes>
+          <leafValues>
+            -2.8489999473094940e-02 -8.4234601259231567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2683 -1.7045000568032265e-02</internalNodes>
+          <leafValues>
+            -5.0938802957534790e-01 1.6057600080966949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2684 -7.3469998314976692e-03</internalNodes>
+          <leafValues>
+            -5.4154998064041138e-01 4.7320001758635044e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2685 -3.0001999810338020e-02</internalNodes>
+          <leafValues>
+            -8.8785797357559204e-01 1.3621799647808075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2686 -1.1292999610304832e-02</internalNodes>
+          <leafValues>
+            8.0615198612213135e-01 -1.6159500181674957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2687 4.7749998047947884e-03</internalNodes>
+          <leafValues>
+            1.2968000024557114e-02 5.5079901218414307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2688 5.0710001960396767e-03</internalNodes>
+          <leafValues>
+            -4.5728001743555069e-02 -1.0766259431838989e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2689 1.9344100356101990e-01</internalNodes>
+          <leafValues>
+            7.1262001991271973e-02 1.1694519519805908e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2690 5.3750001825392246e-03</internalNodes>
+          <leafValues>
+            -1.9736200571060181e-01 3.8206899166107178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2691 -6.8276003003120422e-02</internalNodes>
+          <leafValues>
+            -5.4372339248657227e+00 1.1151900142431259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2692 -3.4933000802993774e-02</internalNodes>
+          <leafValues>
+            4.4793400168418884e-01 -1.8657900393009186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2693 5.1219998858869076e-03</internalNodes>
+          <leafValues>
+            -1.4871999621391296e-02 1.8413899838924408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2694 9.5311999320983887e-02</internalNodes>
+          <leafValues>
+            -1.5117099881172180e-01 9.4991499185562134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2695 -6.2849000096321106e-02</internalNodes>
+          <leafValues>
+            4.6473601460456848e-01 3.8405001163482666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2696 -1.7040699720382690e-01</internalNodes>
+          <leafValues>
+            -1.6499999761581421e+00 -6.3236996531486511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2697 1.0583999566733837e-02</internalNodes>
+          <leafValues>
+            -3.8348998874425888e-02 4.1913801431655884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2698 -4.1579000651836395e-02</internalNodes>
+          <leafValues>
+            3.4461900591850281e-01 -2.1187700331211090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2699 1.2718600034713745e-01</internalNodes>
+          <leafValues>
+            1.2398199737071991e-01 -2.1254889965057373e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2700 8.2557000219821930e-02</internalNodes>
+          <leafValues>
+            -6.2024001032114029e-02 -1.4875819683074951e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2701 8.5293002426624298e-02</internalNodes>
+          <leafValues>
+            1.7087999731302261e-02 3.2076600193977356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2702 5.5544000118970871e-02</internalNodes>
+          <leafValues>
+            -2.7414000034332275e-01 1.8976399302482605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2703 4.5650000683963299e-03</internalNodes>
+          <leafValues>
+            -1.7920200526714325e-01 2.7967301011085510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2704 1.2997999787330627e-02</internalNodes>
+          <leafValues>
+            -3.2297500967979431e-01 2.6941800117492676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2705 5.7891998440027237e-02</internalNodes>
+          <leafValues>
+            1.2644399702548981e-01 -6.0713499784469604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2706 -2.2824000567197800e-02</internalNodes>
+          <leafValues>
+            -4.9682098627090454e-01 2.2376999258995056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2707 4.8312000930309296e-02</internalNodes>
+          <leafValues>
+            4.3607000261545181e-02 4.8537799715995789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2708 2.5714000687003136e-02</internalNodes>
+          <leafValues>
+            -4.2950998991727829e-02 -9.3023502826690674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2709 6.9269998930394650e-03</internalNodes>
+          <leafValues>
+            -2.9680000152438879e-03 3.4296301007270813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2710 -3.4446999430656433e-02</internalNodes>
+          <leafValues>
+            -1.5299769639968872e+00 -6.1014998704195023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2711 2.9387999325990677e-02</internalNodes>
+          <leafValues>
+            3.7595998495817184e-02 6.4172399044036865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2712 -2.4319998919963837e-03</internalNodes>
+          <leafValues>
+            9.9088996648788452e-02 -3.9688101410865784e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>200</maxWeakCount>
+      <stageThreshold>-2.9928278923034668e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2713 -9.5944002270698547e-02</internalNodes>
+          <leafValues>
+            6.2419098615646362e-01 -4.5875200629234314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2714 1.6834000125527382e-02</internalNodes>
+          <leafValues>
+            -9.3072801828384399e-01 2.1563600003719330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2715 2.6049999520182610e-02</internalNodes>
+          <leafValues>
+            -4.0532299876213074e-01 4.2256599664688110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2716 3.6500001442618668e-04</internalNodes>
+          <leafValues>
+            9.5288001000881195e-02 -6.3298100233078003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2717 -6.6940002143383026e-03</internalNodes>
+          <leafValues>
+            3.7243801355361938e-01 -3.0332401394844055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2718 1.8874000757932663e-02</internalNodes>
+          <leafValues>
+            -2.3357200622558594e-01 4.0330699086189270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2719 -1.6300000424962491e-04</internalNodes>
+          <leafValues>
+            4.2886998504400253e-02 -7.7796798944473267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2720 -7.6259002089500427e-02</internalNodes>
+          <leafValues>
+            -4.9628499150276184e-01 1.6335399448871613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2721 5.0149001181125641e-02</internalNodes>
+          <leafValues>
+            3.2747000455856323e-02 -8.0047899484634399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2722 -2.9239999130368233e-03</internalNodes>
+          <leafValues>
+            -5.0002801418304443e-01 2.5480601191520691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2723 1.6243999823927879e-02</internalNodes>
+          <leafValues>
+            3.8913000375032425e-02 -7.0724898576736450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2724 3.7811998277902603e-02</internalNodes>
+          <leafValues>
+            -6.6267997026443481e-02 7.3868799209594727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2725 -1.2319999746978283e-02</internalNodes>
+          <leafValues>
+            4.8696398735046387e-01 -2.4485599994659424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2726 5.8003999292850494e-02</internalNodes>
+          <leafValues>
+            1.3459099829196930e-01 -1.3232100009918213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2727 4.8630000092089176e-03</internalNodes>
+          <leafValues>
+            -4.4172900915145874e-01 1.4005599915981293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2728 4.5690998435020447e-02</internalNodes>
+          <leafValues>
+            3.1217999756336212e-02 8.9818298816680908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2729 2.1321000531315804e-02</internalNodes>
+          <leafValues>
+            1.2008000165224075e-02 -8.6066198348999023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2730 1.5679100155830383e-01</internalNodes>
+          <leafValues>
+            1.4055999927222729e-02 8.5332900285720825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2731 -1.0328999720513821e-02</internalNodes>
+          <leafValues>
+            2.9022800922393799e-01 -2.9478800296783447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2732 2.4290001019835472e-03</internalNodes>
+          <leafValues>
+            -4.0439900755882263e-01 1.9400200247764587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2733 -2.3338999599218369e-02</internalNodes>
+          <leafValues>
+            3.2945200800895691e-01 -2.5712698698043823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2734 -6.8970001302659512e-03</internalNodes>
+          <leafValues>
+            -5.3352999687194824e-01 2.1635200083255768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2735 -3.4403000026941299e-02</internalNodes>
+          <leafValues>
+            -1.4425489902496338e+00 -4.4682998210191727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2736 -2.1235000342130661e-02</internalNodes>
+          <leafValues>
+            -7.9017502069473267e-01 1.9084100425243378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2737 2.0620001014322042e-03</internalNodes>
+          <leafValues>
+            -2.6931199431419373e-01 3.1488001346588135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2738 -4.2190002277493477e-03</internalNodes>
+          <leafValues>
+            -5.4464399814605713e-01 1.6574600338935852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2739 -1.4334999956190586e-02</internalNodes>
+          <leafValues>
+            2.2105000913143158e-02 -6.2342500686645508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2740 -8.2120001316070557e-03</internalNodes>
+          <leafValues>
+            -4.9884998798370361e-01 1.9237099587917328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2741 -9.3350000679492950e-03</internalNodes>
+          <leafValues>
+            -7.9131197929382324e-01 -1.4143999665975571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2742 -3.7937998771667480e-02</internalNodes>
+          <leafValues>
+            7.9841297864913940e-01 -3.3799000084400177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2743 4.7059999778866768e-03</internalNodes>
+          <leafValues>
+            -3.3163401484489441e-01 2.0726299285888672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2744 -4.4499998912215233e-03</internalNodes>
+          <leafValues>
+            -2.7256301045417786e-01 1.8402199447154999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2745 5.2189999260008335e-03</internalNodes>
+          <leafValues>
+            -5.3096002340316772e-01 5.2607998251914978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2746 -9.5399999991059303e-03</internalNodes>
+          <leafValues>
+            -5.6485402584075928e-01 1.9269399344921112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2747 4.4969998300075531e-02</internalNodes>
+          <leafValues>
+            -1.7411500215530396e-01 9.5382601022720337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2748 1.4209000393748283e-02</internalNodes>
+          <leafValues>
+            -9.1949000954627991e-02 2.4836100637912750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2749 1.6380199790000916e-01</internalNodes>
+          <leafValues>
+            -5.8497000485658646e-02 -1.6404409408569336e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2750 2.5579999200999737e-03</internalNodes>
+          <leafValues>
+            2.3447999358177185e-01 -9.2734001576900482e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2751 -3.8499999791383743e-03</internalNodes>
+          <leafValues>
+            1.7880700528621674e-01 -3.5844099521636963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2752 -2.5221999734640121e-02</internalNodes>
+          <leafValues>
+            -4.2903000116348267e-01 2.0244500041007996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2753 -1.9415000453591347e-02</internalNodes>
+          <leafValues>
+            5.8016300201416016e-01 -1.8806399405002594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2754 1.4419999904930592e-02</internalNodes>
+          <leafValues>
+            3.2846998423337936e-02 8.1980502605438232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2755 5.1582999527454376e-02</internalNodes>
+          <leafValues>
+            6.9176003336906433e-02 -4.5866298675537109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2756 -3.7960000336170197e-02</internalNodes>
+          <leafValues>
+            -1.2553000450134277e+00 1.4332899451255798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2757 -2.9560999944806099e-02</internalNodes>
+          <leafValues>
+            5.3151798248291016e-01 -2.0596499741077423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2758 -3.9110999554395676e-02</internalNodes>
+          <leafValues>
+            1.1658719778060913e+00 5.3897000849246979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2759 -2.9159000143408775e-02</internalNodes>
+          <leafValues>
+            3.9307600259780884e-01 -2.2184500098228455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2760 -8.3617001771926880e-02</internalNodes>
+          <leafValues>
+            -7.3744499683380127e-01 1.4268200099468231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2761 4.2004001140594482e-01</internalNodes>
+          <leafValues>
+            -1.4277400076389313e-01 1.7894840240478516e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2762 6.0005001723766327e-02</internalNodes>
+          <leafValues>
+            1.1976700276136398e-01 -1.8886189460754395e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2763 -1.8981000408530235e-02</internalNodes>
+          <leafValues>
+            -1.4148449897766113e+00 -5.6522998958826065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2764 -6.0049998573958874e-03</internalNodes>
+          <leafValues>
+            4.4170799851417542e-01 -1.0200800001621246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2765 -5.8214001357555389e-02</internalNodes>
+          <leafValues>
+            -1.3918470144271851e+00 -4.8268999904394150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2766 -1.2271000072360039e-02</internalNodes>
+          <leafValues>
+            5.1317697763442993e-01 -9.3696996569633484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2767 4.6585999429225922e-02</internalNodes>
+          <leafValues>
+            -5.7484000921249390e-02 -1.4283169507980347e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2768 1.2110000243410468e-03</internalNodes>
+          <leafValues>
+            -8.0891996622085571e-02 3.2333201169967651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2769 -8.8642001152038574e-02</internalNodes>
+          <leafValues>
+            -8.6449098587036133e-01 -3.3146999776363373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2770 -2.3184999823570251e-02</internalNodes>
+          <leafValues>
+            5.2162200212478638e-01 -1.6168000176548958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2771 4.3090000748634338e-02</internalNodes>
+          <leafValues>
+            -1.6153800487518311e-01 1.0915000438690186e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2772 2.0599999697878957e-04</internalNodes>
+          <leafValues>
+            -1.7091499269008636e-01 3.1236699223518372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2773 8.9159999042749405e-03</internalNodes>
+          <leafValues>
+            -6.7039998248219490e-03 -6.8810397386550903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2774 -1.7752999439835548e-02</internalNodes>
+          <leafValues>
+            6.3292801380157471e-01 -4.2360001243650913e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2775 6.2299999408423901e-03</internalNodes>
+          <leafValues>
+            -3.3637198805809021e-01 1.2790599465370178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2776 2.2770000621676445e-02</internalNodes>
+          <leafValues>
+            -3.4703999757766724e-02 3.9141800999641418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2777 -2.1534999832510948e-02</internalNodes>
+          <leafValues>
+            6.4765101671218872e-01 -2.0097799599170685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2778 6.1758998781442642e-02</internalNodes>
+          <leafValues>
+            5.4297000169754028e-02 9.0700101852416992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2779 -7.8069999814033508e-02</internalNodes>
+          <leafValues>
+            6.5523397922515869e-01 -1.9754399359226227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2780 1.1315000243484974e-02</internalNodes>
+          <leafValues>
+            1.9385300576686859e-01 -5.1707297563552856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2781 -2.5590000674128532e-02</internalNodes>
+          <leafValues>
+            -9.3096500635147095e-01 -3.1546998769044876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2782 -3.8058999925851822e-02</internalNodes>
+          <leafValues>
+            -6.8326902389526367e-01 1.2709100544452667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2783 9.7970003262162209e-03</internalNodes>
+          <leafValues>
+            1.5523999929428101e-02 -6.3347899913787842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2784 -1.3841999694705009e-02</internalNodes>
+          <leafValues>
+            1.0060529708862305e+00 6.2812998890876770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2785 8.3459997549653053e-03</internalNodes>
+          <leafValues>
+            -2.3383200168609619e-01 3.0982699990272522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2786 -7.1439996361732483e-02</internalNodes>
+          <leafValues>
+            -7.2505402565002441e-01 1.7148299515247345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2787 1.0006000287830830e-02</internalNodes>
+          <leafValues>
+            -2.2071999311447144e-01 3.5266199707984924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2788 1.1005300283432007e-01</internalNodes>
+          <leafValues>
+            1.6662000119686127e-01 -7.4318999052047729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2789 3.5310998558998108e-02</internalNodes>
+          <leafValues>
+            -2.3982700705528259e-01 4.1435998678207397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2790 -1.1174699664115906e-01</internalNodes>
+          <leafValues>
+            5.1045399904251099e-01 2.2319999989122152e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2791 -1.1367800086736679e-01</internalNodes>
+          <leafValues>
+            9.0475201606750488e-01 -1.6615299880504608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2792 1.6667999327182770e-02</internalNodes>
+          <leafValues>
+            1.4024500548839569e-01 -5.2178502082824707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2793 -8.0340001732110977e-03</internalNodes>
+          <leafValues>
+            -6.6178399324417114e-01 3.7640000227838755e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2794 -3.3096998929977417e-02</internalNodes>
+          <leafValues>
+            8.0185902118682861e-01 5.9385001659393311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2795 1.2547999620437622e-02</internalNodes>
+          <leafValues>
+            -3.3545500040054321e-01 1.4578600227832794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2796 -4.2073998600244522e-02</internalNodes>
+          <leafValues>
+            -5.5509102344512939e-01 1.3266600668430328e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2797 2.5221999734640121e-02</internalNodes>
+          <leafValues>
+            -6.1631999909877777e-02 -1.3678770065307617e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2798 -2.4268999695777893e-02</internalNodes>
+          <leafValues>
+            3.4185099601745605e-01 -7.4160001240670681e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2799 -1.2280000373721123e-02</internalNodes>
+          <leafValues>
+            2.7745801210403442e-01 -3.1033900380134583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2800 -1.1377099901437759e-01</internalNodes>
+          <leafValues>
+            1.1719540357589722e+00 8.3681002259254456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2801 -8.4771998226642609e-02</internalNodes>
+          <leafValues>
+            8.1694799661636353e-01 -1.7837500572204590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2802 -2.4552000686526299e-02</internalNodes>
+          <leafValues>
+            -1.8627299368381500e-01 1.4340099692344666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2803 -9.0269995853304863e-03</internalNodes>
+          <leafValues>
+            3.2659199833869934e-01 -2.3541299998760223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2804 1.1177999898791313e-02</internalNodes>
+          <leafValues>
+            1.9761200249195099e-01 -2.1701000630855560e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2805 -2.9366999864578247e-02</internalNodes>
+          <leafValues>
+            -9.3414801359176636e-01 -2.1704999729990959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2806 6.3640000298619270e-03</internalNodes>
+          <leafValues>
+            2.5573000311851501e-02 4.6412798762321472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2807 1.4026000164449215e-02</internalNodes>
+          <leafValues>
+            -2.1228599548339844e-01 4.0078800916671753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2808 -1.3341999612748623e-02</internalNodes>
+          <leafValues>
+            7.4202698469161987e-01 2.9001999646425247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2809 2.8422799706459045e-01</internalNodes>
+          <leafValues>
+            -1.9243599474430084e-01 4.3631199002265930e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2810 -2.3724000155925751e-01</internalNodes>
+          <leafValues>
+            6.9736397266387939e-01 6.9307997822761536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2811 -1.1169700324535370e-01</internalNodes>
+          <leafValues>
+            3.9147201180458069e-01 -2.0922000706195831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2812 1.2787500023841858e-01</internalNodes>
+          <leafValues>
+            -7.2555996477603912e-02 3.6088201403617859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2813 -6.2900997698307037e-02</internalNodes>
+          <leafValues>
+            9.5424997806549072e-01 -1.5402799844741821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2814 1.7439000308513641e-02</internalNodes>
+          <leafValues>
+            -5.1134999841451645e-02 2.7750301361083984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2815 1.2319999514147639e-03</internalNodes>
+          <leafValues>
+            7.5627997517585754e-02 -3.6456099152565002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2816 2.7495000511407852e-02</internalNodes>
+          <leafValues>
+            5.1844000816345215e-02 4.1562598943710327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2817 -4.3543998152017593e-02</internalNodes>
+          <leafValues>
+            7.1969997882843018e-01 -1.7132200300693512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2818 1.1025999672710896e-02</internalNodes>
+          <leafValues>
+            1.4354600012302399e-01 -6.5403002500534058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2819 2.0865999162197113e-02</internalNodes>
+          <leafValues>
+            4.0089000016450882e-02 -4.5743298530578613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2820 -2.2304000332951546e-02</internalNodes>
+          <leafValues>
+            5.3855001926422119e-01 7.1662999689579010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2821 3.2492000609636307e-02</internalNodes>
+          <leafValues>
+            -4.5991998165845871e-02 -1.0047069787979126e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2822 1.2269999831914902e-02</internalNodes>
+          <leafValues>
+            3.4334998577833176e-02 4.2431798577308655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2823 8.3820000290870667e-03</internalNodes>
+          <leafValues>
+            -2.5850600004196167e-01 2.6263499259948730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2824 3.7353999912738800e-02</internalNodes>
+          <leafValues>
+            1.5692499279975891e-01 -1.0429090261459351e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2825 -1.4111000113189220e-02</internalNodes>
+          <leafValues>
+            -7.3177701234817505e-01 -2.0276999101042747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2826 5.7066999375820160e-02</internalNodes>
+          <leafValues>
+            8.3360001444816589e-02 1.5661499500274658e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2827 4.9680001102387905e-03</internalNodes>
+          <leafValues>
+            -3.5318198800086975e-01 1.4698399603366852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2828 -2.4492999538779259e-02</internalNodes>
+          <leafValues>
+            2.8325900435447693e-01 -3.4640000667423010e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2829 -1.1254999786615372e-02</internalNodes>
+          <leafValues>
+            -8.4017497301101685e-01 -3.6251999437808990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2830 3.4533001482486725e-02</internalNodes>
+          <leafValues>
+            1.4998500049114227e-01 -8.7367099523544312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2831 2.4303000420331955e-02</internalNodes>
+          <leafValues>
+            -1.8787500262260437e-01 5.9483999013900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2832 -7.8790001571178436e-03</internalNodes>
+          <leafValues>
+            4.4315698742866516e-01 -5.6570999324321747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2833 3.5142000764608383e-02</internalNodes>
+          <leafValues>
+            -5.6494999676942825e-02 -1.3617190122604370e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2834 4.6259998343884945e-03</internalNodes>
+          <leafValues>
+            -3.1161698698997498e-01 2.5447699427604675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2835 -8.3131000399589539e-02</internalNodes>
+          <leafValues>
+            1.6424349546432495e+00 -1.4429399371147156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2836 -1.4015999622642994e-02</internalNodes>
+          <leafValues>
+            -7.7819502353668213e-01 1.7173300683498383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2837 1.2450000504031777e-03</internalNodes>
+          <leafValues>
+            -2.3191399872303009e-01 2.8527900576591492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2838 -1.6803000122308731e-02</internalNodes>
+          <leafValues>
+            -3.5965099930763245e-01 2.0412999391555786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2839 -7.6747998595237732e-02</internalNodes>
+          <leafValues>
+            7.8050500154495239e-01 -1.5612800419330597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2840 -2.3671999573707581e-01</internalNodes>
+          <leafValues>
+            1.1813700199127197e+00 7.8111998736858368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2841 -1.0057400166988373e-01</internalNodes>
+          <leafValues>
+            -4.7104099392890930e-01 7.9172998666763306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2842 1.3239999534562230e-03</internalNodes>
+          <leafValues>
+            2.2262699902057648e-01 -3.7099799513816833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2843 2.2152999415993690e-02</internalNodes>
+          <leafValues>
+            -3.8649000227451324e-02 -9.2274999618530273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2844 -1.1246199905872345e-01</internalNodes>
+          <leafValues>
+            4.1899600625038147e-01 8.0411002039909363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2845 1.6481000930070877e-02</internalNodes>
+          <leafValues>
+            -1.6756699979305267e-01 7.1842402219772339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2846 6.8113997578620911e-02</internalNodes>
+          <leafValues>
+            1.5719899535179138e-01 -8.7681102752685547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2847 1.6011999920010567e-02</internalNodes>
+          <leafValues>
+            -4.1600000113248825e-03 -5.9327799081802368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2848 4.6640001237392426e-03</internalNodes>
+          <leafValues>
+            -3.0153999105095863e-02 4.8345300555229187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2849 6.7579997703433037e-03</internalNodes>
+          <leafValues>
+            -2.2667400538921356e-01 3.3662301301956177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2850 4.7289999201893806e-03</internalNodes>
+          <leafValues>
+            -6.0373999178409576e-02 3.1458100676536560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2851 2.5869999080896378e-03</internalNodes>
+          <leafValues>
+            -2.9872599244117737e-01 1.7787499725818634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2852 2.8989999555051327e-03</internalNodes>
+          <leafValues>
+            2.1890200674533844e-01 -2.9567098617553711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2853 -3.0053999274969101e-02</internalNodes>
+          <leafValues>
+            1.2150429487228394e+00 -1.4354999363422394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2854 1.4181000180542469e-02</internalNodes>
+          <leafValues>
+            1.2451999820768833e-02 5.5490100383758545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2855 -6.0527000576257706e-02</internalNodes>
+          <leafValues>
+            -1.4933999776840210e+00 -6.5227001905441284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2856 -1.9882999360561371e-02</internalNodes>
+          <leafValues>
+            -3.8526400923728943e-01 1.9761200249195099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2857 3.1218999996781349e-02</internalNodes>
+          <leafValues>
+            -2.1281200647354126e-01 2.9446500539779663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2858 1.8271999433636665e-02</internalNodes>
+          <leafValues>
+            9.7200000891461968e-04 6.6814202070236206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2859 1.1089999461546540e-03</internalNodes>
+          <leafValues>
+            -6.2467902898788452e-01 -1.6599999507889152e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2860 -3.6713998764753342e-02</internalNodes>
+          <leafValues>
+            -4.2333900928497314e-01 1.2084700167179108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2861 1.2044000439345837e-02</internalNodes>
+          <leafValues>
+            2.5882000103592873e-02 -5.0732398033142090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2862 7.4749000370502472e-02</internalNodes>
+          <leafValues>
+            1.3184699416160583e-01 -2.1739600598812103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2863 -2.3473200201988220e-01</internalNodes>
+          <leafValues>
+            1.1775610446929932e+00 -1.5114699304103851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2864 1.4096499979496002e-01</internalNodes>
+          <leafValues>
+            3.3991001546382904e-02 3.9923098683357239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2865 6.1789997853338718e-03</internalNodes>
+          <leafValues>
+            -3.1806701421737671e-01 1.1681699752807617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2866 -5.7216998189687729e-02</internalNodes>
+          <leafValues>
+            8.4399098157882690e-01 8.3889000117778778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2867 -5.5227000266313553e-02</internalNodes>
+          <leafValues>
+            3.6888301372528076e-01 -1.8913400173187256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2868 -2.1583000198006630e-02</internalNodes>
+          <leafValues>
+            -5.2161800861358643e-01 1.5772600471973419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2869 2.5747999548912048e-02</internalNodes>
+          <leafValues>
+            -5.9921998530626297e-02 -1.0674990415573120e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2870 -1.3098999857902527e-02</internalNodes>
+          <leafValues>
+            7.8958398103713989e-01 5.2099999040365219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2871 2.2799998987466097e-03</internalNodes>
+          <leafValues>
+            -1.1704430580139160e+00 -5.9356998652219772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2872 8.8060004636645317e-03</internalNodes>
+          <leafValues>
+            4.1717998683452606e-02 6.6352599859237671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2873 -8.9699998497962952e-03</internalNodes>
+          <leafValues>
+            -3.5862699151039124e-01 6.0458000749349594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2874 4.0230001322925091e-03</internalNodes>
+          <leafValues>
+            2.0979399979114532e-01 -2.4806000292301178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2875 2.5017000734806061e-02</internalNodes>
+          <leafValues>
+            -1.8795900046825409e-01 3.9547100663185120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2876 -5.9009999968111515e-03</internalNodes>
+          <leafValues>
+            2.5663900375366211e-01 -9.4919003546237946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2877 4.3850000947713852e-03</internalNodes>
+          <leafValues>
+            3.3139001578092575e-02 -4.6075400710105896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2878 -3.3771999180316925e-02</internalNodes>
+          <leafValues>
+            -9.8881602287292480e-01 1.4636899530887604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2879 4.4523000717163086e-02</internalNodes>
+          <leafValues>
+            -1.3286699354648590e-01 1.5796790122985840e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2880 -4.0929000824689865e-02</internalNodes>
+          <leafValues>
+            3.3877098560333252e-01 7.4970997869968414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2881 3.9351999759674072e-02</internalNodes>
+          <leafValues>
+            -1.8327899277210236e-01 4.6980699896812439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2882 -7.0322997868061066e-02</internalNodes>
+          <leafValues>
+            -9.8322701454162598e-01 1.1808100342750549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2883 3.5743001848459244e-02</internalNodes>
+          <leafValues>
+            -3.3050999045372009e-02 -8.3610898256301880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2884 -4.2961999773979187e-02</internalNodes>
+          <leafValues>
+            1.1670809984207153e+00 8.0692000687122345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2885 -2.1007999777793884e-02</internalNodes>
+          <leafValues>
+            6.3869798183441162e-01 -1.7626300454139709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2886 -1.5742200613021851e-01</internalNodes>
+          <leafValues>
+            -2.3302499949932098e-01 1.2517499923706055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2887 7.8659998252987862e-03</internalNodes>
+          <leafValues>
+            -2.2037999331951141e-01 2.7196800708770752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2888 2.3622000589966774e-02</internalNodes>
+          <leafValues>
+            1.6127300262451172e-01 -4.3329000473022461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2889 7.4692003428936005e-02</internalNodes>
+          <leafValues>
+            -1.6991999745368958e-01 5.8884900808334351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2890 -6.4799998654052615e-04</internalNodes>
+          <leafValues>
+            2.5842899084091187e-01 -3.5911999642848969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2891 -1.6290999948978424e-02</internalNodes>
+          <leafValues>
+            -7.6764398813247681e-01 -2.0472999662160873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2892 -3.3133998513221741e-02</internalNodes>
+          <leafValues>
+            -2.7180099487304688e-01 1.4325700700283051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2893 4.8797998577356339e-02</internalNodes>
+          <leafValues>
+            7.6408997178077698e-02 -4.1445198655128479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2894 2.2869999520480633e-03</internalNodes>
+          <leafValues>
+            -3.8628999143838882e-02 2.0753799378871918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2895 4.5304000377655029e-02</internalNodes>
+          <leafValues>
+            -1.7777900397777557e-01 6.3461399078369141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2896 1.0705800354480743e-01</internalNodes>
+          <leafValues>
+            1.8972299993038177e-01 -5.1236200332641602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2897 -4.0525000542402267e-02</internalNodes>
+          <leafValues>
+            7.0614999532699585e-01 -1.7803299427032471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2898 3.1968999654054642e-02</internalNodes>
+          <leafValues>
+            6.8149998784065247e-02 6.8733102083206177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2899 -5.7617001235485077e-02</internalNodes>
+          <leafValues>
+            7.5170499086380005e-01 -1.5764999389648438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2900 1.3593999668955803e-02</internalNodes>
+          <leafValues>
+            1.9411900639533997e-01 -2.4561899900436401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2901 7.1396000683307648e-02</internalNodes>
+          <leafValues>
+            -4.6881001442670822e-02 -8.8198298215866089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2902 -1.4895999804139137e-02</internalNodes>
+          <leafValues>
+            -4.4532400369644165e-01 1.7679899930953979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2903 -1.0026000440120697e-02</internalNodes>
+          <leafValues>
+            6.5122699737548828e-01 -1.6709999740123749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2904 3.7589999847114086e-03</internalNodes>
+          <leafValues>
+            -5.8301001787185669e-02 3.4483298659324646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2905 1.6263000667095184e-02</internalNodes>
+          <leafValues>
+            -1.5581500530242920e-01 8.6432701349258423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2906 -4.0176000446081161e-02</internalNodes>
+          <leafValues>
+            -6.1028599739074707e-01 1.1796399950981140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2907 2.7080999687314034e-02</internalNodes>
+          <leafValues>
+            -4.9601998180150986e-02 -8.9990001916885376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2908 5.2420001477003098e-02</internalNodes>
+          <leafValues>
+            1.1297199875116348e-01 -1.0833640098571777e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2909 -1.9160000607371330e-02</internalNodes>
+          <leafValues>
+            -7.9880100488662720e-01 -3.4079000353813171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2910 -3.7730000913143158e-03</internalNodes>
+          <leafValues>
+            -1.9124099612236023e-01 2.1535199880599976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2911 7.5762003660202026e-02</internalNodes>
+          <leafValues>
+            -1.3421699404716492e-01 1.6807060241699219e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2912 -2.2173000499606133e-02</internalNodes>
+          <leafValues>
+            4.8600998520851135e-01 3.6160000599920750e-03</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          6 4 12 9 -1.</_>
+        <_>
+          6 7 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 7 -1.</_>
+        <_>
+          10 4 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 9 -1.</_>
+        <_>
+          3 12 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 6 -1.</_>
+        <_>
+          8 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 19 -1.</_>
+        <_>
+          5 5 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 16 -1.</_>
+        <_>
+          6 13 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 6 -1.</_>
+        <_>
+          5 11 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 10 -1.</_>
+        <_>
+          11 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 7 6 -1.</_>
+        <_>
+          4 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          6 8 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 7 -1.</_>
+        <_>
+          10 4 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 19 12 -1.</_>
+        <_>
+          1 12 19 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 3 -1.</_>
+        <_>
+          8 2 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 15 -1.</_>
+        <_>
+          9 14 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 10 -1.</_>
+        <_>
+          5 11 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 9 -1.</_>
+        <_>
+          5 3 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 9 6 -1.</_>
+        <_>
+          16 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          9 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 10 -1.</_>
+        <_>
+          12 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 4 9 -1.</_>
+        <_>
+          4 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 11 -1.</_>
+        <_>
+          20 0 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 13 -1.</_>
+        <_>
+          8 6 8 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 10 6 -1.</_>
+        <_>
+          7 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 12 -1.</_>
+        <_>
+          5 13 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 3 -1.</_>
+        <_>
+          8 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 15 6 -1.</_>
+        <_>
+          5 11 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 14 -1.</_>
+        <_>
+          9 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 10 -1.</_>
+        <_>
+          11 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 12 -1.</_>
+        <_>
+          6 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          9 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 13 6 -1.</_>
+        <_>
+          5 8 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 15 -1.</_>
+        <_>
+          18 1 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 15 -1.</_>
+        <_>
+          4 1 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 24 15 -1.</_>
+        <_>
+          8 8 8 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 12 -1.</_>
+        <_>
+          5 6 7 6 2.</_>
+        <_>
+          12 12 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 21 12 -1.</_>
+        <_>
+          2 16 21 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          10 1 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 20 10 -1.</_>
+        <_>
+          2 13 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 13 -1.</_>
+        <_>
+          2 1 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 2 4 13 -1.</_>
+        <_>
+          20 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 22 19 -1.</_>
+        <_>
+          11 5 11 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 9 -1.</_>
+        <_>
+          20 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 11 -1.</_>
+        <_>
+          2 3 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 9 -1.</_>
+        <_>
+          12 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 19 3 -1.</_>
+        <_>
+          0 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 9 -1.</_>
+        <_>
+          12 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 9 -1.</_>
+        <_>
+          10 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 14 -1.</_>
+        <_>
+          12 5 7 7 2.</_>
+        <_>
+          5 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 4 11 -1.</_>
+        <_>
+          17 13 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 9 -1.</_>
+        <_>
+          0 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 9 -1.</_>
+        <_>
+          6 7 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 6 -1.</_>
+        <_>
+          10 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 5 -1.</_>
+        <_>
+          8 1 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 18 6 -1.</_>
+        <_>
+          4 12 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 12 6 -1.</_>
+        <_>
+          2 17 6 3 2.</_>
+        <_>
+          8 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 4 13 -1.</_>
+        <_>
+          19 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 13 -1.</_>
+        <_>
+          3 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 23 -1.</_>
+        <_>
+          8 1 8 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 12 -1.</_>
+        <_>
+          1 11 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 14 -1.</_>
+        <_>
+          14 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 16 6 -1.</_>
+        <_>
+          3 12 8 3 2.</_>
+        <_>
+          11 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          6 8 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 12 -1.</_>
+        <_>
+          8 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          1 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 12 -1.</_>
+        <_>
+          4 10 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 20 -1.</_>
+        <_>
+          2 1 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 2 -1.</_>
+        <_>
+          3 1 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 20 14 -1.</_>
+        <_>
+          1 5 10 7 2.</_>
+        <_>
+          11 12 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 12 -1.</_>
+        <_>
+          5 12 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 7 9 -1.</_>
+        <_>
+          3 17 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 9 6 -1.</_>
+        <_>
+          14 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 9 6 -1.</_>
+        <_>
+          1 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 8 10 -1.</_>
+        <_>
+          15 6 4 5 2.</_>
+        <_>
+          11 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 14 -1.</_>
+        <_>
+          5 5 7 7 2.</_>
+        <_>
+          12 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 5 -1.</_>
+        <_>
+          10 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          9 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 18 4 -1.</_>
+        <_>
+          9 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 9 -1.</_>
+        <_>
+          6 3 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 6 -1.</_>
+        <_>
+          8 0 8 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 12 -1.</_>
+        <_>
+          4 11 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 6 -1.</_>
+        <_>
+          11 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 24 3 -1.</_>
+        <_>
+          8 20 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 4 -1.</_>
+        <_>
+          9 13 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 12 -1.</_>
+        <_>
+          9 18 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 18 2 -1.</_>
+        <_>
+          1 23 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 10 -1.</_>
+        <_>
+          10 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 10 -1.</_>
+        <_>
+          6 12 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 10 4 -1.</_>
+        <_>
+          0 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 2 -1.</_>
+        <_>
+          6 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 3 -1.</_>
+        <_>
+          1 2 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 15 -1.</_>
+        <_>
+          5 4 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 4 10 -1.</_>
+        <_>
+          20 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 10 -1.</_>
+        <_>
+          2 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 20 6 -1.</_>
+        <_>
+          12 16 10 3 2.</_>
+        <_>
+          2 19 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 9 -1.</_>
+        <_>
+          4 12 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 6 -1.</_>
+        <_>
+          8 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 12 6 -1.</_>
+        <_>
+          17 8 6 3 2.</_>
+        <_>
+          11 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_>
+        <_>
+          6 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 9 6 -1.</_>
+        <_>
+          8 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 6 -1.</_>
+        <_>
+          0 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 10 -1.</_>
+        <_>
+          12 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 12 3 -1.</_>
+        <_>
+          9 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 20 2 -1.</_>
+        <_>
+          2 11 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 12 -1.</_>
+        <_>
+          2 9 9 6 2.</_>
+        <_>
+          11 15 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 24 -1.</_>
+        <_>
+          3 0 9 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 10 -1.</_>
+        <_>
+          5 6 7 5 2.</_>
+        <_>
+          12 11 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 12 -1.</_>
+        <_>
+          14 5 5 6 2.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 12 -1.</_>
+        <_>
+          4 5 6 6 2.</_>
+        <_>
+          10 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 18 3 -1.</_>
+        <_>
+          4 15 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 8 -1.</_>
+        <_>
+          6 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 18 6 -1.</_>
+        <_>
+          3 19 18 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 18 -1.</_>
+        <_>
+          10 6 4 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 14 -1.</_>
+        <_>
+          8 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 19 2 -1.</_>
+        <_>
+          3 3 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 22 13 -1.</_>
+        <_>
+          12 8 11 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 11 4 -1.</_>
+        <_>
+          8 11 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 15 10 -1.</_>
+        <_>
+          5 12 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 12 6 -1.</_>
+        <_>
+          16 16 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 6 -1.</_>
+        <_>
+          4 16 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 5 12 -1.</_>
+        <_>
+          19 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          8 2 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          6 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 6 -1.</_>
+        <_>
+          10 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 6 -1.</_>
+        <_>
+          9 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 22 15 -1.</_>
+        <_>
+          0 12 22 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 17 9 -1.</_>
+        <_>
+          4 4 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          9 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 8 -1.</_>
+        <_>
+          18 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 7 -1.</_>
+        <_>
+          3 1 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 22 -1.</_>
+        <_>
+          18 0 3 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 22 -1.</_>
+        <_>
+          3 0 3 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 8 16 -1.</_>
+        <_>
+          16 7 4 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 19 6 -1.</_>
+        <_>
+          2 12 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 12 -1.</_>
+        <_>
+          9 13 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 17 6 -1.</_>
+        <_>
+          2 17 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 14 -1.</_>
+        <_>
+          14 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 10 -1.</_>
+        <_>
+          5 6 4 5 2.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 9 11 -1.</_>
+        <_>
+          18 8 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 11 -1.</_>
+        <_>
+          3 8 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 18 -1.</_>
+        <_>
+          8 15 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 14 -1.</_>
+        <_>
+          7 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 8 -1.</_>
+        <_>
+          8 14 8 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 14 -1.</_>
+        <_>
+          10 10 9 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 6 -1.</_>
+        <_>
+          14 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 16 -1.</_>
+        <_>
+          7 0 5 8 2.</_>
+        <_>
+          12 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 6 -1.</_>
+        <_>
+          13 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 4 -1.</_>
+        <_>
+          12 3 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 6 -1.</_>
+        <_>
+          13 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 20 4 -1.</_>
+        <_>
+          1 1 10 2 2.</_>
+        <_>
+          11 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 9 6 -1.</_>
+        <_>
+          13 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 6 -1.</_>
+        <_>
+          8 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 10 6 -1.</_>
+        <_>
+          8 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 9 -1.</_>
+        <_>
+          8 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 6 -1.</_>
+        <_>
+          7 5 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 3 -1.</_>
+        <_>
+          0 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 3 -1.</_>
+        <_>
+          1 11 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 8 -1.</_>
+        <_>
+          9 11 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 6 -1.</_>
+        <_>
+          12 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 6 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 11 6 -1.</_>
+        <_>
+          7 12 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 4 -1.</_>
+        <_>
+          0 13 12 2 2.</_>
+        <_>
+          12 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 22 12 -1.</_>
+        <_>
+          13 4 11 6 2.</_>
+        <_>
+          2 10 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 20 17 -1.</_>
+        <_>
+          12 0 10 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 24 -1.</_>
+        <_>
+          14 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 24 -1.</_>
+        <_>
+          9 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 22 -1.</_>
+        <_>
+          14 1 1 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 2 22 -1.</_>
+        <_>
+          9 1 1 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 18 -1.</_>
+        <_>
+          18 6 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 6 -1.</_>
+        <_>
+          6 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 9 4 -1.</_>
+        <_>
+          13 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 18 3 -1.</_>
+        <_>
+          3 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 8 18 -1.</_>
+        <_>
+          13 4 4 9 2.</_>
+        <_>
+          9 13 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 4 -1.</_>
+        <_>
+          6 2 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 14 6 -1.</_>
+        <_>
+          6 11 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          10 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 16 -1.</_>
+        <_>
+          10 13 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 9 16 -1.</_>
+        <_>
+          4 4 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 18 9 -1.</_>
+        <_>
+          5 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 5 8 -1.</_>
+        <_>
+          9 19 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 4 9 -1.</_>
+        <_>
+          20 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          2 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 22 19 2 -1.</_>
+        <_>
+          5 23 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 9 -1.</_>
+        <_>
+          2 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 19 18 -1.</_>
+        <_>
+          5 12 19 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          2 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 14 12 -1.</_>
+        <_>
+          13 5 7 6 2.</_>
+        <_>
+          6 11 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 2 -1.</_>
+        <_>
+          0 2 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 3 -1.</_>
+        <_>
+          1 3 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 7 9 -1.</_>
+        <_>
+          2 11 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 22 4 -1.</_>
+        <_>
+          13 12 11 2 2.</_>
+        <_>
+          2 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 22 4 -1.</_>
+        <_>
+          0 12 11 2 2.</_>
+        <_>
+          11 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 11 -1.</_>
+        <_>
+          11 7 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 6 -1.</_>
+        <_>
+          10 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 10 -1.</_>
+        <_>
+          11 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          6 10 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 15 -1.</_>
+        <_>
+          18 6 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 18 3 -1.</_>
+        <_>
+          3 16 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 9 -1.</_>
+        <_>
+          18 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 16 6 -1.</_>
+        <_>
+          1 5 8 3 2.</_>
+        <_>
+          9 8 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 24 14 -1.</_>
+        <_>
+          0 4 12 7 2.</_>
+        <_>
+          12 11 12 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 13 -1.</_>
+        <_>
+          13 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 13 -1.</_>
+        <_>
+          9 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 9 -1.</_>
+        <_>
+          13 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 9 -1.</_>
+        <_>
+          10 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 9 6 -1.</_>
+        <_>
+          13 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 14 6 -1.</_>
+        <_>
+          2 18 7 3 2.</_>
+        <_>
+          9 21 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 18 4 -1.</_>
+        <_>
+          12 18 9 2 2.</_>
+        <_>
+          3 20 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 15 4 -1.</_>
+        <_>
+          5 20 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 15 9 -1.</_>
+        <_>
+          14 15 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 4 -1.</_>
+        <_>
+          4 6 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 15 10 -1.</_>
+        <_>
+          5 14 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 14 -1.</_>
+        <_>
+          12 9 5 7 2.</_>
+        <_>
+          7 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          9 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 3 -1.</_>
+        <_>
+          3 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 3 -1.</_>
+        <_>
+          0 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 18 4 -1.</_>
+        <_>
+          12 16 9 2 2.</_>
+        <_>
+          3 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 14 6 -1.</_>
+        <_>
+          4 6 7 3 2.</_>
+        <_>
+          11 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 18 -1.</_>
+        <_>
+          13 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 18 -1.</_>
+        <_>
+          10 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 10 -1.</_>
+        <_>
+          10 7 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 21 4 -1.</_>
+        <_>
+          8 20 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 5 18 -1.</_>
+        <_>
+          10 14 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 6 -1.</_>
+        <_>
+          0 2 12 3 2.</_>
+        <_>
+          12 5 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 8 -1.</_>
+        <_>
+          12 1 11 4 2.</_>
+        <_>
+          1 5 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 9 -1.</_>
+        <_>
+          4 3 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 19 -1.</_>
+        <_>
+          8 0 8 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 21 18 3 -1.</_>
+        <_>
+          11 21 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 4 -1.</_>
+        <_>
+          9 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 4 -1.</_>
+        <_>
+          10 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 6 16 -1.</_>
+        <_>
+          20 8 3 8 2.</_>
+        <_>
+          17 16 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 20 4 -1.</_>
+        <_>
+          1 15 10 2 2.</_>
+        <_>
+          11 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 10 6 -1.</_>
+        <_>
+          14 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 9 -1.</_>
+        <_>
+          3 3 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 7 15 -1.</_>
+        <_>
+          15 11 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 13 -1.</_>
+        <_>
+          11 1 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 6 14 -1.</_>
+        <_>
+          17 2 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 12 10 -1.</_>
+        <_>
+          3 14 6 5 2.</_>
+        <_>
+          9 19 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 14 -1.</_>
+        <_>
+          4 2 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 5 12 -1.</_>
+        <_>
+          10 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 24 5 -1.</_>
+        <_>
+          8 17 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 12 -1.</_>
+        <_>
+          15 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 12 -1.</_>
+        <_>
+          3 1 3 6 2.</_>
+        <_>
+          6 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 6 -1.</_>
+        <_>
+          12 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 6 -1.</_>
+        <_>
+          6 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 16 -1.</_>
+        <_>
+          14 14 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 13 6 -1.</_>
+        <_>
+          1 14 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 9 -1.</_>
+        <_>
+          13 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 6 -1.</_>
+        <_>
+          10 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 9 -1.</_>
+        <_>
+          12 2 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 9 -1.</_>
+        <_>
+          9 2 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 12 6 -1.</_>
+        <_>
+          6 20 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          9 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 3 -1.</_>
+        <_>
+          7 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 21 -1.</_>
+        <_>
+          8 10 8 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 12 -1.</_>
+        <_>
+          7 8 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          0 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 2 20 -1.</_>
+        <_>
+          15 2 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          0 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 21 -1.</_>
+        <_>
+          15 3 1 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 23 -1.</_>
+        <_>
+          8 0 1 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 9 4 -1.</_>
+        <_>
+          15 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 4 -1.</_>
+        <_>
+          0 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 9 6 -1.</_>
+        <_>
+          8 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 18 4 -1.</_>
+        <_>
+          9 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 19 -1.</_>
+        <_>
+          8 0 8 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 8 12 -1.</_>
+        <_>
+          9 7 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 10 -1.</_>
+        <_>
+          12 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 12 -1.</_>
+        <_>
+          12 9 5 6 2.</_>
+        <_>
+          7 15 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 19 -1.</_>
+        <_>
+          6 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 10 -1.</_>
+        <_>
+          16 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 12 -1.</_>
+        <_>
+          2 0 3 6 2.</_>
+        <_>
+          5 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 2 -1.</_>
+        <_>
+          0 12 24 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 13 4 -1.</_>
+        <_>
+          4 11 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 9 -1.</_>
+        <_>
+          9 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 16 4 -1.</_>
+        <_>
+          0 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 6 9 -1.</_>
+        <_>
+          18 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 9 -1.</_>
+        <_>
+          0 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 4 -1.</_>
+        <_>
+          8 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 9 -1.</_>
+        <_>
+          10 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 15 -1.</_>
+        <_>
+          14 3 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 15 -1.</_>
+        <_>
+          8 3 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 9 4 -1.</_>
+        <_>
+          15 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 7 -1.</_>
+        <_>
+          8 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 10 -1.</_>
+        <_>
+          9 19 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 8 -1.</_>
+        <_>
+          7 17 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 16 -1.</_>
+        <_>
+          14 13 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          2 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 19 3 -1.</_>
+        <_>
+          5 19 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 18 -1.</_>
+        <_>
+          13 4 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 18 -1.</_>
+        <_>
+          10 4 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 18 9 -1.</_>
+        <_>
+          9 3 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 14 -1.</_>
+        <_>
+          8 1 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 9 6 -1.</_>
+        <_>
+          12 19 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 20 16 -1.</_>
+        <_>
+          1 3 10 8 2.</_>
+        <_>
+          11 11 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 12 -1.</_>
+        <_>
+          15 5 3 6 2.</_>
+        <_>
+          12 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 16 -1.</_>
+        <_>
+          1 2 11 8 2.</_>
+        <_>
+          12 10 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 5 10 -1.</_>
+        <_>
+          10 19 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          3 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 10 -1.</_>
+        <_>
+          12 14 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          8 2 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 9 -1.</_>
+        <_>
+          6 7 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 5 -1.</_>
+        <_>
+          10 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 12 -1.</_>
+        <_>
+          5 12 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 8 10 -1.</_>
+        <_>
+          4 14 4 5 2.</_>
+        <_>
+          8 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 14 -1.</_>
+        <_>
+          11 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 16 -1.</_>
+        <_>
+          7 14 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 8 -1.</_>
+        <_>
+          9 7 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 2 -1.</_>
+        <_>
+          2 4 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 19 6 -1.</_>
+        <_>
+          3 14 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 6 14 -1.</_>
+        <_>
+          16 6 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 12 -1.</_>
+        <_>
+          9 9 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 6 18 -1.</_>
+        <_>
+          21 6 3 9 2.</_>
+        <_>
+          18 15 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 18 -1.</_>
+        <_>
+          0 6 3 9 2.</_>
+        <_>
+          3 15 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          18 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 15 6 -1.</_>
+        <_>
+          3 20 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          18 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 18 2 -1.</_>
+        <_>
+          5 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 6 -1.</_>
+        <_>
+          6 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          10 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 6 -1.</_>
+        <_>
+          3 8 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 15 -1.</_>
+        <_>
+          5 5 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 9 6 -1.</_>
+        <_>
+          11 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          8 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 4 -1.</_>
+        <_>
+          9 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 19 -1.</_>
+        <_>
+          13 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 19 -1.</_>
+        <_>
+          9 1 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 6 9 -1.</_>
+        <_>
+          18 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 18 3 -1.</_>
+        <_>
+          1 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 10 9 -1.</_>
+        <_>
+          14 16 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 22 4 -1.</_>
+        <_>
+          1 13 11 2 2.</_>
+        <_>
+          12 15 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 6 -1.</_>
+        <_>
+          12 6 8 3 2.</_>
+        <_>
+          4 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 22 -1.</_>
+        <_>
+          1 0 9 11 2.</_>
+        <_>
+          10 11 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 8 14 -1.</_>
+        <_>
+          14 7 4 7 2.</_>
+        <_>
+          10 14 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 20 -1.</_>
+        <_>
+          0 4 3 10 2.</_>
+        <_>
+          3 14 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 9 -1.</_>
+        <_>
+          17 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 9 -1.</_>
+        <_>
+          5 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 6 12 -1.</_>
+        <_>
+          18 12 3 6 2.</_>
+        <_>
+          15 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 12 -1.</_>
+        <_>
+          3 12 3 6 2.</_>
+        <_>
+          6 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 6 -1.</_>
+        <_>
+          0 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 19 3 -1.</_>
+        <_>
+          4 15 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 19 3 -1.</_>
+        <_>
+          2 14 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 10 6 -1.</_>
+        <_>
+          14 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 12 -1.</_>
+        <_>
+          6 0 5 6 2.</_>
+        <_>
+          11 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 6 12 -1.</_>
+        <_>
+          20 1 3 6 2.</_>
+        <_>
+          17 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 12 -1.</_>
+        <_>
+          1 1 3 6 2.</_>
+        <_>
+          4 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 6 9 -1.</_>
+        <_>
+          16 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 9 12 -1.</_>
+        <_>
+          7 9 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 12 -1.</_>
+        <_>
+          12 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 8 -1.</_>
+        <_>
+          4 4 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 3 -1.</_>
+        <_>
+          8 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 21 23 -1.</_>
+        <_>
+          7 1 7 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 17 4 -1.</_>
+        <_>
+          6 11 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 11 18 -1.</_>
+        <_>
+          1 6 11 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 13 6 -1.</_>
+        <_>
+          6 17 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 6 -1.</_>
+        <_>
+          0 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 15 4 -1.</_>
+        <_>
+          13 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 9 -1.</_>
+        <_>
+          9 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 18 3 -1.</_>
+        <_>
+          12 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 4 -1.</_>
+        <_>
+          8 14 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 12 -1.</_>
+        <_>
+          16 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 3 -1.</_>
+        <_>
+          0 4 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 10 6 -1.</_>
+        <_>
+          14 19 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 18 3 -1.</_>
+        <_>
+          7 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 18 9 -1.</_>
+        <_>
+          5 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 9 -1.</_>
+        <_>
+          4 6 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 12 -1.</_>
+        <_>
+          16 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 18 4 -1.</_>
+        <_>
+          6 7 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 10 -1.</_>
+        <_>
+          11 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 9 -1.</_>
+        <_>
+          11 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 21 -1.</_>
+        <_>
+          12 1 9 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 7 -1.</_>
+        <_>
+          6 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 9 -1.</_>
+        <_>
+          10 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          8 2 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 5 12 -1.</_>
+        <_>
+          14 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 5 12 -1.</_>
+        <_>
+          5 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 17 -1.</_>
+        <_>
+          3 1 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 19 9 -1.</_>
+        <_>
+          3 4 19 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 12 6 -1.</_>
+        <_>
+          3 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 4 19 -1.</_>
+        <_>
+          20 4 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 10 7 -1.</_>
+        <_>
+          5 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 12 -1.</_>
+        <_>
+          13 7 5 6 2.</_>
+        <_>
+          8 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 12 -1.</_>
+        <_>
+          6 7 5 6 2.</_>
+        <_>
+          11 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 6 -1.</_>
+        <_>
+          12 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 21 4 -1.</_>
+        <_>
+          8 20 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 9 6 -1.</_>
+        <_>
+          9 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 9 6 -1.</_>
+        <_>
+          10 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          13 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 14 -1.</_>
+        <_>
+          9 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 9 6 -1.</_>
+        <_>
+          14 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 5 -1.</_>
+        <_>
+          8 8 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 6 11 -1.</_>
+        <_>
+          20 3 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 11 14 -1.</_>
+        <_>
+          6 12 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 9 -1.</_>
+        <_>
+          18 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 6 -1.</_>
+        <_>
+          7 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 9 -1.</_>
+        <_>
+          18 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 9 -1.</_>
+        <_>
+          0 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 9 4 -1.</_>
+        <_>
+          9 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 19 2 -1.</_>
+        <_>
+          0 23 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 14 6 9 -1.</_>
+        <_>
+          17 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 9 -1.</_>
+        <_>
+          1 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 9 -1.</_>
+        <_>
+          14 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 9 -1.</_>
+        <_>
+          8 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 7 -1.</_>
+        <_>
+          9 9 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 10 -1.</_>
+        <_>
+          9 17 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 18 3 -1.</_>
+        <_>
+          6 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          1 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 11 12 -1.</_>
+        <_>
+          10 12 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          5 6 7 3 2.</_>
+        <_>
+          12 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 4 -1.</_>
+        <_>
+          5 6 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 2 -1.</_>
+        <_>
+          0 1 22 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 24 -1.</_>
+        <_>
+          8 0 8 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 4 -1.</_>
+        <_>
+          10 15 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 9 -1.</_>
+        <_>
+          6 11 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 7 12 -1.</_>
+        <_>
+          4 16 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 6 -1.</_>
+        <_>
+          12 2 11 3 2.</_>
+        <_>
+          1 5 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 14 3 -1.</_>
+        <_>
+          12 20 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 16 -1.</_>
+        <_>
+          12 0 12 8 2.</_>
+        <_>
+          0 8 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 18 4 -1.</_>
+        <_>
+          3 13 9 2 2.</_>
+        <_>
+          12 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 22 2 -1.</_>
+        <_>
+          2 11 22 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 11 8 -1.</_>
+        <_>
+          6 7 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 6 -1.</_>
+        <_>
+          14 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 6 -1.</_>
+        <_>
+          0 9 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 10 -1.</_>
+        <_>
+          19 0 5 5 2.</_>
+        <_>
+          14 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 4 -1.</_>
+        <_>
+          12 1 12 2 2.</_>
+        <_>
+          0 3 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 16 6 -1.</_>
+        <_>
+          13 15 8 3 2.</_>
+        <_>
+          5 18 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 16 6 -1.</_>
+        <_>
+          3 15 8 3 2.</_>
+        <_>
+          11 18 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 21 10 -1.</_>
+        <_>
+          0 18 21 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 24 -1.</_>
+        <_>
+          15 0 2 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 11 -1.</_>
+        <_>
+          9 4 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 6 -1.</_>
+        <_>
+          12 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 2 20 -1.</_>
+        <_>
+          1 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 24 -1.</_>
+        <_>
+          15 0 2 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 24 -1.</_>
+        <_>
+          7 0 2 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 14 -1.</_>
+        <_>
+          19 7 3 7 2.</_>
+        <_>
+          16 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 12 -1.</_>
+        <_>
+          6 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 14 -1.</_>
+        <_>
+          8 5 8 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 10 6 -1.</_>
+        <_>
+          5 15 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 14 -1.</_>
+        <_>
+          2 7 3 7 2.</_>
+        <_>
+          5 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 9 15 -1.</_>
+        <_>
+          18 2 3 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          2 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 10 14 -1.</_>
+        <_>
+          17 2 5 7 2.</_>
+        <_>
+          12 9 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 18 -1.</_>
+        <_>
+          12 6 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 15 6 -1.</_>
+        <_>
+          14 5 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 10 -1.</_>
+        <_>
+          10 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 9 7 -1.</_>
+        <_>
+          6 3 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 3 -1.</_>
+        <_>
+          6 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 6 -1.</_>
+        <_>
+          11 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 12 -1.</_>
+        <_>
+          12 13 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          10 6 2 9 2.</_>
+        <_>
+          12 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 6 9 -1.</_>
+        <_>
+          16 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 13 -1.</_>
+        <_>
+          6 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 21 3 -1.</_>
+        <_>
+          9 2 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 5 12 -1.</_>
+        <_>
+          5 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 10 -1.</_>
+        <_>
+          10 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 5 8 -1.</_>
+        <_>
+          8 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 11 9 -1.</_>
+        <_>
+          6 3 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 5 -1.</_>
+        <_>
+          10 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 5 -1.</_>
+        <_>
+          8 0 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 23 6 -1.</_>
+        <_>
+          1 12 23 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          9 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 21 6 -1.</_>
+        <_>
+          3 8 21 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 12 -1.</_>
+        <_>
+          2 5 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 10 -1.</_>
+        <_>
+          8 12 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 12 -1.</_>
+        <_>
+          10 7 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 10 6 -1.</_>
+        <_>
+          0 19 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 9 6 -1.</_>
+        <_>
+          14 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 16 -1.</_>
+        <_>
+          9 14 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 9 6 -1.</_>
+        <_>
+          14 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 9 6 -1.</_>
+        <_>
+          1 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 9 6 -1.</_>
+        <_>
+          15 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 6 -1.</_>
+        <_>
+          0 11 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 6 9 -1.</_>
+        <_>
+          19 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 18 3 -1.</_>
+        <_>
+          2 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 21 6 -1.</_>
+        <_>
+          3 17 21 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 6 -1.</_>
+        <_>
+          9 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 6 9 -1.</_>
+        <_>
+          18 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          0 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 10 -1.</_>
+        <_>
+          12 0 8 5 2.</_>
+        <_>
+          4 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 16 -1.</_>
+        <_>
+          2 0 5 8 2.</_>
+        <_>
+          7 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 5 -1.</_>
+        <_>
+          14 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 5 -1.</_>
+        <_>
+          5 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 6 10 -1.</_>
+        <_>
+          18 3 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 6 -1.</_>
+        <_>
+          5 11 6 3 2.</_>
+        <_>
+          11 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 0 3 18 -1.</_>
+        <_>
+          22 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 9 7 -1.</_>
+        <_>
+          11 8 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 10 -1.</_>
+        <_>
+          7 12 4 5 2.</_>
+        <_>
+          11 17 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 0 3 18 -1.</_>
+        <_>
+          22 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          12 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 9 6 -1.</_>
+        <_>
+          15 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 3 -1.</_>
+        <_>
+          0 3 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 9 -1.</_>
+        <_>
+          13 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 12 -1.</_>
+        <_>
+          14 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          6 10 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 21 -1.</_>
+        <_>
+          14 3 1 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 8 -1.</_>
+        <_>
+          6 5 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 8 -1.</_>
+        <_>
+          3 4 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 3 -1.</_>
+        <_>
+          3 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 4 -1.</_>
+        <_>
+          12 13 12 2 2.</_>
+        <_>
+          0 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 9 -1.</_>
+        <_>
+          12 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 9 -1.</_>
+        <_>
+          13 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 22 -1.</_>
+        <_>
+          8 2 2 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 8 14 -1.</_>
+        <_>
+          20 10 4 7 2.</_>
+        <_>
+          16 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 15 -1.</_>
+        <_>
+          3 9 16 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 8 14 -1.</_>
+        <_>
+          20 10 4 7 2.</_>
+        <_>
+          16 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 14 -1.</_>
+        <_>
+          0 10 4 7 2.</_>
+        <_>
+          4 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 11 6 -1.</_>
+        <_>
+          10 17 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 9 -1.</_>
+        <_>
+          8 7 8 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 16 -1.</_>
+        <_>
+          13 1 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 16 -1.</_>
+        <_>
+          9 1 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 16 8 -1.</_>
+        <_>
+          13 5 8 4 2.</_>
+        <_>
+          5 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 9 -1.</_>
+        <_>
+          0 12 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 9 -1.</_>
+        <_>
+          3 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 9 6 -1.</_>
+        <_>
+          8 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 8 10 -1.</_>
+        <_>
+          2 13 4 5 2.</_>
+        <_>
+          6 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 18 -1.</_>
+        <_>
+          15 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 3 -1.</_>
+        <_>
+          3 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 6 11 -1.</_>
+        <_>
+          19 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 11 -1.</_>
+        <_>
+          3 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 4 9 -1.</_>
+        <_>
+          19 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 9 -1.</_>
+        <_>
+          3 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 18 9 -1.</_>
+        <_>
+          4 15 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 4 -1.</_>
+        <_>
+          6 11 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 9 6 -1.</_>
+        <_>
+          15 4 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 9 6 -1.</_>
+        <_>
+          0 4 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 17 -1.</_>
+        <_>
+          17 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 17 -1.</_>
+        <_>
+          5 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 9 4 -1.</_>
+        <_>
+          8 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 18 -1.</_>
+        <_>
+          6 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 12 -1.</_>
+        <_>
+          5 8 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 12 -1.</_>
+        <_>
+          10 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 14 15 -1.</_>
+        <_>
+          10 12 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 15 -1.</_>
+        <_>
+          0 12 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 9 6 -1.</_>
+        <_>
+          15 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          0 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 14 -1.</_>
+        <_>
+          14 6 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 9 -1.</_>
+        <_>
+          11 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 15 -1.</_>
+        <_>
+          14 6 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 15 -1.</_>
+        <_>
+          8 6 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 8 9 -1.</_>
+        <_>
+          15 3 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 21 -1.</_>
+        <_>
+          3 0 3 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 8 12 -1.</_>
+        <_>
+          11 13 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 12 -1.</_>
+        <_>
+          6 7 5 6 2.</_>
+        <_>
+          11 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          12 6 2 9 2.</_>
+        <_>
+          10 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          0 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 18 3 -1.</_>
+        <_>
+          3 15 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 8 10 -1.</_>
+        <_>
+          3 14 4 5 2.</_>
+        <_>
+          7 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 24 4 -1.</_>
+        <_>
+          12 12 12 2 2.</_>
+        <_>
+          0 14 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 3 20 -1.</_>
+        <_>
+          1 2 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 10 8 -1.</_>
+        <_>
+          17 16 5 4 2.</_>
+        <_>
+          12 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 10 8 -1.</_>
+        <_>
+          2 16 5 4 2.</_>
+        <_>
+          7 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 9 -1.</_>
+        <_>
+          7 3 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 3 -1.</_>
+        <_>
+          8 0 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 15 4 -1.</_>
+        <_>
+          3 10 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 6 -1.</_>
+        <_>
+          10 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 14 6 -1.</_>
+        <_>
+          5 16 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 10 -1.</_>
+        <_>
+          11 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 7 -1.</_>
+        <_>
+          3 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 6 -1.</_>
+        <_>
+          18 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 3 -1.</_>
+        <_>
+          3 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 14 18 -1.</_>
+        <_>
+          9 12 14 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 24 3 -1.</_>
+        <_>
+          8 20 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 7 -1.</_>
+        <_>
+          13 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 6 -1.</_>
+        <_>
+          4 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 7 -1.</_>
+        <_>
+          8 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 11 12 -1.</_>
+        <_>
+          7 8 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 10 4 -1.</_>
+        <_>
+          6 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 15 -1.</_>
+        <_>
+          11 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 10 6 -1.</_>
+        <_>
+          13 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 11 -1.</_>
+        <_>
+          5 7 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 9 -1.</_>
+        <_>
+          10 17 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 9 -1.</_>
+        <_>
+          10 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 10 4 -1.</_>
+        <_>
+          14 3 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          6 6 6 3 2.</_>
+        <_>
+          12 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 8 10 -1.</_>
+        <_>
+          12 8 4 5 2.</_>
+        <_>
+          8 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 16 -1.</_>
+        <_>
+          7 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 9 4 -1.</_>
+        <_>
+          8 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 9 -1.</_>
+        <_>
+          5 5 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 19 8 -1.</_>
+        <_>
+          3 20 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 8 -1.</_>
+        <_>
+          5 0 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 16 18 -1.</_>
+        <_>
+          5 2 8 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 11 -1.</_>
+        <_>
+          8 11 8 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 18 5 -1.</_>
+        <_>
+          3 3 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 3 -1.</_>
+        <_>
+          1 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 18 3 -1.</_>
+        <_>
+          5 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 9 6 -1.</_>
+        <_>
+          1 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 23 10 -1.</_>
+        <_>
+          1 14 23 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 3 -1.</_>
+        <_>
+          3 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 3 -1.</_>
+        <_>
+          6 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 22 -1.</_>
+        <_>
+          7 2 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 10 6 -1.</_>
+        <_>
+          14 19 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 10 6 -1.</_>
+        <_>
+          1 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 12 -1.</_>
+        <_>
+          13 3 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          12 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 9 6 -1.</_>
+        <_>
+          15 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 9 -1.</_>
+        <_>
+          5 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 19 -1.</_>
+        <_>
+          15 5 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 6 -1.</_>
+        <_>
+          6 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 19 -1.</_>
+        <_>
+          15 5 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          0 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 18 3 -1.</_>
+        <_>
+          5 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 4 -1.</_>
+        <_>
+          7 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 8 10 -1.</_>
+        <_>
+          17 4 4 5 2.</_>
+        <_>
+          13 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          10 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 9 8 -1.</_>
+        <_>
+          15 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 12 -1.</_>
+        <_>
+          0 10 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 14 6 -1.</_>
+        <_>
+          14 6 7 3 2.</_>
+        <_>
+          7 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 19 -1.</_>
+        <_>
+          8 5 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 15 20 -1.</_>
+        <_>
+          13 4 5 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 15 20 -1.</_>
+        <_>
+          6 4 5 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 6 -1.</_>
+        <_>
+          13 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 6 -1.</_>
+        <_>
+          8 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 14 -1.</_>
+        <_>
+          17 2 3 7 2.</_>
+        <_>
+          14 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 14 -1.</_>
+        <_>
+          4 2 3 7 2.</_>
+        <_>
+          7 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 7 -1.</_>
+        <_>
+          12 4 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 9 -1.</_>
+        <_>
+          11 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 10 -1.</_>
+        <_>
+          11 4 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 10 -1.</_>
+        <_>
+          9 4 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 10 6 -1.</_>
+        <_>
+          8 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 21 6 -1.</_>
+        <_>
+          1 20 21 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 12 6 -1.</_>
+        <_>
+          9 2 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 6 -1.</_>
+        <_>
+          9 2 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 12 6 -1.</_>
+        <_>
+          18 5 6 3 2.</_>
+        <_>
+          12 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 9 -1.</_>
+        <_>
+          8 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 20 6 -1.</_>
+        <_>
+          2 9 20 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 6 -1.</_>
+        <_>
+          0 5 6 3 2.</_>
+        <_>
+          6 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 8 10 -1.</_>
+        <_>
+          18 14 4 5 2.</_>
+        <_>
+          14 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 8 10 -1.</_>
+        <_>
+          2 14 4 5 2.</_>
+        <_>
+          6 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 20 13 -1.</_>
+        <_>
+          2 11 10 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 5 -1.</_>
+        <_>
+          12 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 16 6 -1.</_>
+        <_>
+          13 6 8 3 2.</_>
+        <_>
+          5 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 9 4 -1.</_>
+        <_>
+          1 21 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 12 5 -1.</_>
+        <_>
+          11 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 12 -1.</_>
+        <_>
+          3 5 7 6 2.</_>
+        <_>
+          10 11 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 9 6 -1.</_>
+        <_>
+          12 4 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 19 3 -1.</_>
+        <_>
+          2 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 6 9 -1.</_>
+        <_>
+          18 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 2 -1.</_>
+        <_>
+          3 8 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 2 4 18 -1.</_>
+        <_>
+          22 2 2 9 2.</_>
+        <_>
+          20 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 20 3 -1.</_>
+        <_>
+          2 19 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 22 3 -1.</_>
+        <_>
+          1 10 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 18 -1.</_>
+        <_>
+          0 2 2 9 2.</_>
+        <_>
+          2 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 4 23 -1.</_>
+        <_>
+          19 0 2 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 19 -1.</_>
+        <_>
+          3 3 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          20 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 12 -1.</_>
+        <_>
+          13 0 6 6 2.</_>
+        <_>
+          7 6 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 6 -1.</_>
+        <_>
+          0 3 12 3 2.</_>
+        <_>
+          12 6 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 10 -1.</_>
+        <_>
+          10 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 15 -1.</_>
+        <_>
+          8 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 17 6 -1.</_>
+        <_>
+          4 14 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 8 -1.</_>
+        <_>
+          2 5 9 4 2.</_>
+        <_>
+          11 9 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 14 6 -1.</_>
+        <_>
+          14 6 7 3 2.</_>
+        <_>
+          7 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 6 -1.</_>
+        <_>
+          3 6 7 3 2.</_>
+        <_>
+          10 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 18 -1.</_>
+        <_>
+          17 5 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 18 -1.</_>
+        <_>
+          6 5 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 14 4 -1.</_>
+        <_>
+          10 12 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 9 4 -1.</_>
+        <_>
+          4 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 9 -1.</_>
+        <_>
+          2 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 8 -1.</_>
+        <_>
+          10 3 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 5 -1.</_>
+        <_>
+          5 1 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 7 8 -1.</_>
+        <_>
+          12 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 22 4 -1.</_>
+        <_>
+          0 14 22 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 15 -1.</_>
+        <_>
+          15 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 7 8 -1.</_>
+        <_>
+          5 11 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 4 -1.</_>
+        <_>
+          8 20 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 4 -1.</_>
+        <_>
+          1 4 22 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 6 17 -1.</_>
+        <_>
+          19 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 18 -1.</_>
+        <_>
+          8 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 12 -1.</_>
+        <_>
+          20 0 3 6 2.</_>
+        <_>
+          17 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 9 12 -1.</_>
+        <_>
+          15 11 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 18 2 -1.</_>
+        <_>
+          2 23 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 12 6 -1.</_>
+        <_>
+          16 10 6 3 2.</_>
+        <_>
+          10 13 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 11 -1.</_>
+        <_>
+          2 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 4 10 -1.</_>
+        <_>
+          20 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 17 -1.</_>
+        <_>
+          3 3 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 9 -1.</_>
+        <_>
+          0 16 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 6 12 -1.</_>
+        <_>
+          16 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 12 -1.</_>
+        <_>
+          2 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 19 3 -1.</_>
+        <_>
+          1 6 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 9 7 -1.</_>
+        <_>
+          14 8 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 9 -1.</_>
+        <_>
+          3 11 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 3 -1.</_>
+        <_>
+          3 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 12 -1.</_>
+        <_>
+          10 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 14 -1.</_>
+        <_>
+          3 9 9 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 9 -1.</_>
+        <_>
+          2 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 18 -1.</_>
+        <_>
+          12 5 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 18 -1.</_>
+        <_>
+          10 5 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 10 -1.</_>
+        <_>
+          12 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 11 -1.</_>
+        <_>
+          11 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 18 3 -1.</_>
+        <_>
+          4 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 20 3 -1.</_>
+        <_>
+          0 17 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 12 -1.</_>
+        <_>
+          9 13 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 8 8 -1.</_>
+        <_>
+          8 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 12 -1.</_>
+        <_>
+          13 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 14 -1.</_>
+        <_>
+          5 9 7 7 2.</_>
+        <_>
+          12 16 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 10 -1.</_>
+        <_>
+          12 0 12 5 2.</_>
+        <_>
+          0 5 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 2 -1.</_>
+        <_>
+          1 12 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 5 12 -1.</_>
+        <_>
+          19 9 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 12 -1.</_>
+        <_>
+          0 9 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 8 18 -1.</_>
+        <_>
+          20 6 4 9 2.</_>
+        <_>
+          16 15 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 18 -1.</_>
+        <_>
+          0 6 4 9 2.</_>
+        <_>
+          4 15 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 12 12 -1.</_>
+        <_>
+          18 5 6 6 2.</_>
+        <_>
+          12 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          9 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 11 -1.</_>
+        <_>
+          11 13 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 12 -1.</_>
+        <_>
+          0 5 6 6 2.</_>
+        <_>
+          6 11 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 23 3 -1.</_>
+        <_>
+          1 3 23 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 19 3 -1.</_>
+        <_>
+          1 16 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 11 4 -1.</_>
+        <_>
+          13 19 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 5 -1.</_>
+        <_>
+          4 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 10 4 -1.</_>
+        <_>
+          12 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 9 -1.</_>
+        <_>
+          4 9 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 9 6 -1.</_>
+        <_>
+          15 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          1 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 20 8 -1.</_>
+        <_>
+          13 10 10 4 2.</_>
+        <_>
+          3 14 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 18 -1.</_>
+        <_>
+          5 0 3 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 9 10 -1.</_>
+        <_>
+          16 11 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 5 -1.</_>
+        <_>
+          5 2 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 21 6 -1.</_>
+        <_>
+          10 4 7 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 14 -1.</_>
+        <_>
+          7 0 5 7 2.</_>
+        <_>
+          12 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 12 4 -1.</_>
+        <_>
+          12 19 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 23 4 -1.</_>
+        <_>
+          0 8 23 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 8 10 -1.</_>
+        <_>
+          17 10 4 5 2.</_>
+        <_>
+          13 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 9 4 -1.</_>
+        <_>
+          15 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 4 -1.</_>
+        <_>
+          0 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 6 -1.</_>
+        <_>
+          8 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 6 -1.</_>
+        <_>
+          12 3 12 3 2.</_>
+        <_>
+          0 6 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 3 -1.</_>
+        <_>
+          2 5 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 4 -1.</_>
+        <_>
+          12 0 12 2 2.</_>
+        <_>
+          0 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 3 -1.</_>
+        <_>
+          1 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 6 -1.</_>
+        <_>
+          0 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 18 3 -1.</_>
+        <_>
+          6 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 10 -1.</_>
+        <_>
+          10 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 8 -1.</_>
+        <_>
+          8 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 8 -1.</_>
+        <_>
+          12 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 11 -1.</_>
+        <_>
+          8 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 8 9 -1.</_>
+        <_>
+          13 9 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 21 6 -1.</_>
+        <_>
+          1 9 21 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 12 -1.</_>
+        <_>
+          15 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 11 12 -1.</_>
+        <_>
+          6 13 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 10 8 -1.</_>
+        <_>
+          18 8 5 4 2.</_>
+        <_>
+          13 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 3 -1.</_>
+        <_>
+          11 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 18 4 -1.</_>
+        <_>
+          12 11 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 22 -1.</_>
+        <_>
+          0 11 22 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 8 -1.</_>
+        <_>
+          11 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 14 -1.</_>
+        <_>
+          8 3 3 7 2.</_>
+        <_>
+          11 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 18 8 -1.</_>
+        <_>
+          9 10 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 14 -1.</_>
+        <_>
+          10 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 20 -1.</_>
+        <_>
+          4 13 16 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 10 -1.</_>
+        <_>
+          11 4 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 16 4 -1.</_>
+        <_>
+          5 2 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 4 -1.</_>
+        <_>
+          8 5 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          15 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 5 -1.</_>
+        <_>
+          12 4 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 10 4 -1.</_>
+        <_>
+          12 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 10 4 -1.</_>
+        <_>
+          7 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 12 5 -1.</_>
+        <_>
+          11 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 10 -1.</_>
+        <_>
+          3 10 4 5 2.</_>
+        <_>
+          7 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 8 -1.</_>
+        <_>
+          14 12 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 24 3 -1.</_>
+        <_>
+          8 21 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 18 4 -1.</_>
+        <_>
+          9 20 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 9 6 -1.</_>
+        <_>
+          1 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 10 4 -1.</_>
+        <_>
+          11 19 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 12 -1.</_>
+        <_>
+          9 18 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 6 -1.</_>
+        <_>
+          12 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 9 -1.</_>
+        <_>
+          1 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 12 4 -1.</_>
+        <_>
+          6 18 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 20 3 -1.</_>
+        <_>
+          1 6 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 9 -1.</_>
+        <_>
+          8 4 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 9 4 -1.</_>
+        <_>
+          2 21 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 18 -1.</_>
+        <_>
+          11 7 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 12 -1.</_>
+        <_>
+          7 2 4 6 2.</_>
+        <_>
+          11 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 9 8 -1.</_>
+        <_>
+          14 10 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 5 -1.</_>
+        <_>
+          9 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 6 -1.</_>
+        <_>
+          14 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 9 -1.</_>
+        <_>
+          7 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 12 -1.</_>
+        <_>
+          4 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 21 6 -1.</_>
+        <_>
+          9 0 7 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 15 -1.</_>
+        <_>
+          11 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 2 -1.</_>
+        <_>
+          2 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 8 6 -1.</_>
+        <_>
+          8 20 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 2 -1.</_>
+        <_>
+          3 1 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 6 -1.</_>
+        <_>
+          11 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 5 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          2 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 2 4 9 -1.</_>
+        <_>
+          20 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 9 -1.</_>
+        <_>
+          2 2 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 4 -1.</_>
+        <_>
+          12 1 12 2 2.</_>
+        <_>
+          0 3 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 6 -1.</_>
+        <_>
+          0 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 9 6 -1.</_>
+        <_>
+          14 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 19 3 -1.</_>
+        <_>
+          0 16 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 22 12 -1.</_>
+        <_>
+          12 5 11 6 2.</_>
+        <_>
+          1 11 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 6 -1.</_>
+        <_>
+          8 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 20 3 -1.</_>
+        <_>
+          4 3 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 10 -1.</_>
+        <_>
+          10 14 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 16 6 -1.</_>
+        <_>
+          14 12 8 3 2.</_>
+        <_>
+          6 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 8 9 -1.</_>
+        <_>
+          2 16 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 14 -1.</_>
+        <_>
+          14 8 3 7 2.</_>
+        <_>
+          11 15 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 16 6 -1.</_>
+        <_>
+          2 12 8 3 2.</_>
+        <_>
+          10 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 16 8 -1.</_>
+        <_>
+          5 20 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 12 -1.</_>
+        <_>
+          9 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 10 -1.</_>
+        <_>
+          12 2 4 5 2.</_>
+        <_>
+          8 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          6 6 6 3 2.</_>
+        <_>
+          12 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 9 -1.</_>
+        <_>
+          12 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 6 9 -1.</_>
+        <_>
+          18 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 6 -1.</_>
+        <_>
+          5 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 21 3 -1.</_>
+        <_>
+          10 21 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 6 -1.</_>
+        <_>
+          2 3 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 7 6 -1.</_>
+        <_>
+          13 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 14 -1.</_>
+        <_>
+          6 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 9 -1.</_>
+        <_>
+          11 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 14 -1.</_>
+        <_>
+          7 8 3 7 2.</_>
+        <_>
+          10 15 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 4 16 -1.</_>
+        <_>
+          18 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 10 -1.</_>
+        <_>
+          11 14 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 5 -1.</_>
+        <_>
+          10 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 23 3 -1.</_>
+        <_>
+          0 13 23 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 12 -1.</_>
+        <_>
+          15 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 5 -1.</_>
+        <_>
+          4 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 10 4 -1.</_>
+        <_>
+          13 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 12 -1.</_>
+        <_>
+          7 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 6 -1.</_>
+        <_>
+          14 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 6 -1.</_>
+        <_>
+          7 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 18 13 -1.</_>
+        <_>
+          12 11 6 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 13 -1.</_>
+        <_>
+          6 11 6 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 12 6 -1.</_>
+        <_>
+          16 16 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 21 3 -1.</_>
+        <_>
+          0 7 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 12 6 -1.</_>
+        <_>
+          16 16 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 14 -1.</_>
+        <_>
+          5 14 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 19 2 -1.</_>
+        <_>
+          5 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 4 -1.</_>
+        <_>
+          5 6 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 18 4 -1.</_>
+        <_>
+          9 18 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 9 -1.</_>
+        <_>
+          9 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 11 4 -1.</_>
+        <_>
+          13 5 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 6 -1.</_>
+        <_>
+          5 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 4 23 -1.</_>
+        <_>
+          19 1 2 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 23 -1.</_>
+        <_>
+          3 1 2 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 18 3 -1.</_>
+        <_>
+          5 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 11 4 -1.</_>
+        <_>
+          0 5 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 20 3 -1.</_>
+        <_>
+          2 17 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 13 4 -1.</_>
+        <_>
+          5 5 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 22 15 -1.</_>
+        <_>
+          1 9 11 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 14 3 -1.</_>
+        <_>
+          10 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 4 -1.</_>
+        <_>
+          8 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 4 -1.</_>
+        <_>
+          11 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 9 -1.</_>
+        <_>
+          12 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          4 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 10 -1.</_>
+        <_>
+          12 3 4 5 2.</_>
+        <_>
+          8 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 6 -1.</_>
+        <_>
+          3 6 8 3 2.</_>
+        <_>
+          11 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          5 9 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 6 -1.</_>
+        <_>
+          4 5 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 18 2 -1.</_>
+        <_>
+          6 4 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 6 -1.</_>
+        <_>
+          10 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 3 -1.</_>
+        <_>
+          0 2 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 10 6 -1.</_>
+        <_>
+          0 19 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 18 3 -1.</_>
+        <_>
+          3 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 16 -1.</_>
+        <_>
+          2 5 3 8 2.</_>
+        <_>
+          5 13 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 11 6 -1.</_>
+        <_>
+          7 8 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 22 -1.</_>
+        <_>
+          5 13 12 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 10 -1.</_>
+        <_>
+          10 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 18 -1.</_>
+        <_>
+          9 6 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 6 9 -1.</_>
+        <_>
+          18 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 10 -1.</_>
+        <_>
+          9 7 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 9 -1.</_>
+        <_>
+          12 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 10 -1.</_>
+        <_>
+          11 9 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 10 -1.</_>
+        <_>
+          13 14 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 10 -1.</_>
+        <_>
+          9 14 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 9 -1.</_>
+        <_>
+          4 11 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 20 3 -1.</_>
+        <_>
+          2 12 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 13 -1.</_>
+        <_>
+          13 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 13 -1.</_>
+        <_>
+          9 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 7 -1.</_>
+        <_>
+          9 1 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 9 -1.</_>
+        <_>
+          1 14 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 6 -1.</_>
+        <_>
+          8 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 15 6 -1.</_>
+        <_>
+          3 11 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 19 2 -1.</_>
+        <_>
+          5 11 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 7 16 -1.</_>
+        <_>
+          8 14 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 6 -1.</_>
+        <_>
+          9 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 12 -1.</_>
+        <_>
+          0 11 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 18 3 -1.</_>
+        <_>
+          6 5 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 6 -1.</_>
+        <_>
+          4 16 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 9 4 -1.</_>
+        <_>
+          13 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 14 -1.</_>
+        <_>
+          5 8 7 7 2.</_>
+        <_>
+          12 15 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 22 6 -1.</_>
+        <_>
+          12 16 11 3 2.</_>
+        <_>
+          1 19 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 10 -1.</_>
+        <_>
+          14 5 5 5 2.</_>
+        <_>
+          9 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 10 -1.</_>
+        <_>
+          5 5 5 5 2.</_>
+        <_>
+          10 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 6 -1.</_>
+        <_>
+          12 6 8 3 2.</_>
+        <_>
+          4 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 9 -1.</_>
+        <_>
+          0 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 8 14 -1.</_>
+        <_>
+          20 10 4 7 2.</_>
+        <_>
+          16 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 12 -1.</_>
+        <_>
+          9 18 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 12 -1.</_>
+        <_>
+          12 10 4 6 2.</_>
+        <_>
+          8 16 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 9 -1.</_>
+        <_>
+          10 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 16 -1.</_>
+        <_>
+          14 4 4 8 2.</_>
+        <_>
+          10 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 10 6 -1.</_>
+        <_>
+          7 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 14 -1.</_>
+        <_>
+          12 6 7 7 2.</_>
+        <_>
+          5 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 20 2 -1.</_>
+        <_>
+          2 12 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 4 16 -1.</_>
+        <_>
+          18 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 10 -1.</_>
+        <_>
+          1 11 6 5 2.</_>
+        <_>
+          7 16 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 4 -1.</_>
+        <_>
+          6 11 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 7 -1.</_>
+        <_>
+          12 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 16 -1.</_>
+        <_>
+          14 4 4 8 2.</_>
+        <_>
+          10 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 16 -1.</_>
+        <_>
+          6 4 4 8 2.</_>
+        <_>
+          10 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 9 6 -1.</_>
+        <_>
+          11 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 16 12 -1.</_>
+        <_>
+          1 5 8 6 2.</_>
+        <_>
+          9 11 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 8 -1.</_>
+        <_>
+          9 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 18 -1.</_>
+        <_>
+          7 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 5 14 -1.</_>
+        <_>
+          17 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 5 14 -1.</_>
+        <_>
+          2 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 10 6 -1.</_>
+        <_>
+          7 7 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 23 18 -1.</_>
+        <_>
+          1 9 23 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 21 3 -1.</_>
+        <_>
+          8 1 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 12 6 -1.</_>
+        <_>
+          3 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 8 16 -1.</_>
+        <_>
+          20 8 4 8 2.</_>
+        <_>
+          16 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 24 4 -1.</_>
+        <_>
+          8 19 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 8 16 -1.</_>
+        <_>
+          20 8 4 8 2.</_>
+        <_>
+          16 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 16 -1.</_>
+        <_>
+          0 8 4 8 2.</_>
+        <_>
+          4 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 10 -1.</_>
+        <_>
+          8 17 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 5 8 -1.</_>
+        <_>
+          5 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 19 2 -1.</_>
+        <_>
+          4 2 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 24 9 -1.</_>
+        <_>
+          8 12 8 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 8 -1.</_>
+        <_>
+          6 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 3 -1.</_>
+        <_>
+          0 1 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 3 4 11 -1.</_>
+        <_>
+          20 3 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 8 -1.</_>
+        <_>
+          12 11 6 4 2.</_>
+        <_>
+          6 15 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_>
+        <_>
+          6 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 18 3 -1.</_>
+        <_>
+          6 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 3 4 9 -1.</_>
+        <_>
+          20 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 9 -1.</_>
+        <_>
+          2 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 9 19 -1.</_>
+        <_>
+          18 0 3 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 19 -1.</_>
+        <_>
+          3 0 3 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 8 -1.</_>
+        <_>
+          13 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 8 -1.</_>
+        <_>
+          8 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 19 3 -1.</_>
+        <_>
+          5 12 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 18 4 -1.</_>
+        <_>
+          9 20 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 16 6 -1.</_>
+        <_>
+          6 8 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 6 -1.</_>
+        <_>
+          9 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 14 -1.</_>
+        <_>
+          10 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 15 12 -1.</_>
+        <_>
+          1 11 15 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 5 -1.</_>
+        <_>
+          11 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 9 -1.</_>
+        <_>
+          7 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 8 -1.</_>
+        <_>
+          5 5 6 4 2.</_>
+        <_>
+          11 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 11 6 -1.</_>
+        <_>
+          13 14 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 21 3 -1.</_>
+        <_>
+          0 14 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 12 -1.</_>
+        <_>
+          12 1 4 6 2.</_>
+        <_>
+          8 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 12 -1.</_>
+        <_>
+          1 0 3 6 2.</_>
+        <_>
+          4 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 21 2 -1.</_>
+        <_>
+          2 3 21 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 19 3 -1.</_>
+        <_>
+          2 3 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 6 14 -1.</_>
+        <_>
+          20 10 3 7 2.</_>
+        <_>
+          17 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 14 -1.</_>
+        <_>
+          1 10 3 7 2.</_>
+        <_>
+          4 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 14 14 -1.</_>
+        <_>
+          14 6 7 7 2.</_>
+        <_>
+          7 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 6 -1.</_>
+        <_>
+          0 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 8 9 -1.</_>
+        <_>
+          15 17 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 4 -1.</_>
+        <_>
+          1 1 11 2 2.</_>
+        <_>
+          12 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 9 6 -1.</_>
+        <_>
+          9 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 3 -1.</_>
+        <_>
+          0 16 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 7 9 -1.</_>
+        <_>
+          16 17 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 4 -1.</_>
+        <_>
+          12 3 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 5 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 10 -1.</_>
+        <_>
+          12 1 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 10 -1.</_>
+        <_>
+          10 1 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 6 9 -1.</_>
+        <_>
+          15 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 9 -1.</_>
+        <_>
+          3 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 19 -1.</_>
+        <_>
+          16 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 9 -1.</_>
+        <_>
+          3 3 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 19 -1.</_>
+        <_>
+          16 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 4 -1.</_>
+        <_>
+          12 3 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 9 -1.</_>
+        <_>
+          10 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 19 -1.</_>
+        <_>
+          7 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 12 -1.</_>
+        <_>
+          11 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 5 -1.</_>
+        <_>
+          11 7 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 18 -1.</_>
+        <_>
+          12 3 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 12 -1.</_>
+        <_>
+          11 3 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 19 3 -1.</_>
+        <_>
+          3 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 3 -1.</_>
+        <_>
+          2 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 18 4 -1.</_>
+        <_>
+          12 13 9 2 2.</_>
+        <_>
+          3 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 9 -1.</_>
+        <_>
+          5 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 20 4 -1.</_>
+        <_>
+          14 1 10 2 2.</_>
+        <_>
+          4 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 4 -1.</_>
+        <_>
+          0 1 10 2 2.</_>
+        <_>
+          10 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 6 -1.</_>
+        <_>
+          10 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 8 -1.</_>
+        <_>
+          8 2 8 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 18 3 -1.</_>
+        <_>
+          5 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 6 -1.</_>
+        <_>
+          11 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 5 -1.</_>
+        <_>
+          11 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 5 -1.</_>
+        <_>
+          9 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 6 -1.</_>
+        <_>
+          5 2 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 5 12 -1.</_>
+        <_>
+          10 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 14 -1.</_>
+        <_>
+          7 9 4 7 2.</_>
+        <_>
+          11 16 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 22 6 -1.</_>
+        <_>
+          12 5 11 3 2.</_>
+        <_>
+          1 8 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 4 -1.</_>
+        <_>
+          12 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 19 3 -1.</_>
+        <_>
+          2 19 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 4 -1.</_>
+        <_>
+          12 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          1 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 4 -1.</_>
+        <_>
+          12 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 3 -1.</_>
+        <_>
+          0 1 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 4 -1.</_>
+        <_>
+          5 2 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 6 -1.</_>
+        <_>
+          6 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 9 -1.</_>
+        <_>
+          14 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 13 4 -1.</_>
+        <_>
+          5 22 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 12 -1.</_>
+        <_>
+          9 13 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 21 3 -1.</_>
+        <_>
+          8 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 9 6 -1.</_>
+        <_>
+          11 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 7 -1.</_>
+        <_>
+          6 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 10 8 -1.</_>
+        <_>
+          17 10 5 4 2.</_>
+        <_>
+          12 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 24 3 -1.</_>
+        <_>
+          8 15 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 6 -1.</_>
+        <_>
+          8 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 9 -1.</_>
+        <_>
+          4 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 4 -1.</_>
+        <_>
+          12 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 6 -1.</_>
+        <_>
+          9 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 14 10 -1.</_>
+        <_>
+          16 9 7 5 2.</_>
+        <_>
+          9 14 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 14 10 -1.</_>
+        <_>
+          1 9 7 5 2.</_>
+        <_>
+          8 14 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 17 -1.</_>
+        <_>
+          11 7 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 20 -1.</_>
+        <_>
+          3 4 3 10 2.</_>
+        <_>
+          6 14 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 9 -1.</_>
+        <_>
+          12 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 9 -1.</_>
+        <_>
+          12 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 16 -1.</_>
+        <_>
+          3 8 3 8 2.</_>
+        <_>
+          6 16 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 4 -1.</_>
+        <_>
+          12 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 9 4 -1.</_>
+        <_>
+          3 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 6 -1.</_>
+        <_>
+          13 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 10 -1.</_>
+        <_>
+          5 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 12 6 -1.</_>
+        <_>
+          11 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 8 -1.</_>
+        <_>
+          9 4 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 10 8 -1.</_>
+        <_>
+          17 16 5 4 2.</_>
+        <_>
+          12 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 10 8 -1.</_>
+        <_>
+          2 16 5 4 2.</_>
+        <_>
+          7 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 4 -1.</_>
+        <_>
+          12 0 12 2 2.</_>
+        <_>
+          0 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 9 6 -1.</_>
+        <_>
+          0 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 24 6 -1.</_>
+        <_>
+          12 4 12 3 2.</_>
+        <_>
+          0 7 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 4 -1.</_>
+        <_>
+          5 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 4 -1.</_>
+        <_>
+          12 1 11 2 2.</_>
+        <_>
+          1 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 18 -1.</_>
+        <_>
+          9 15 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 20 4 -1.</_>
+        <_>
+          2 11 20 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 14 -1.</_>
+        <_>
+          5 9 14 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 6 -1.</_>
+        <_>
+          4 5 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 19 3 -1.</_>
+        <_>
+          2 4 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 4 -1.</_>
+        <_>
+          7 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 15 -1.</_>
+        <_>
+          0 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 21 3 -1.</_>
+        <_>
+          2 11 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 6 -1.</_>
+        <_>
+          6 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 14 9 -1.</_>
+        <_>
+          6 7 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 9 -1.</_>
+        <_>
+          11 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 9 9 -1.</_>
+        <_>
+          15 11 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 21 -1.</_>
+        <_>
+          8 7 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 22 19 2 -1.</_>
+        <_>
+          3 23 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 20 3 -1.</_>
+        <_>
+          2 16 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 4 13 -1.</_>
+        <_>
+          19 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 8 -1.</_>
+        <_>
+          1 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 9 -1.</_>
+        <_>
+          14 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 9 -1.</_>
+        <_>
+          4 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 10 -1.</_>
+        <_>
+          14 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 10 -1.</_>
+        <_>
+          8 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 6 -1.</_>
+        <_>
+          14 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 6 -1.</_>
+        <_>
+          4 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 21 -1.</_>
+        <_>
+          8 2 8 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 13 -1.</_>
+        <_>
+          3 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 4 21 -1.</_>
+        <_>
+          20 0 2 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 20 -1.</_>
+        <_>
+          2 4 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 9 6 -1.</_>
+        <_>
+          8 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 7 9 -1.</_>
+        <_>
+          16 15 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 3 -1.</_>
+        <_>
+          12 21 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 6 9 -1.</_>
+        <_>
+          11 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 10 -1.</_>
+        <_>
+          12 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 9 -1.</_>
+        <_>
+          10 5 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 10 4 -1.</_>
+        <_>
+          14 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 14 -1.</_>
+        <_>
+          5 5 7 7 2.</_>
+        <_>
+          12 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 12 6 -1.</_>
+        <_>
+          18 8 6 3 2.</_>
+        <_>
+          12 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 12 -1.</_>
+        <_>
+          6 6 6 6 2.</_>
+        <_>
+          12 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 10 -1.</_>
+        <_>
+          13 13 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 20 8 -1.</_>
+        <_>
+          1 10 10 4 2.</_>
+        <_>
+          11 14 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 9 6 -1.</_>
+        <_>
+          15 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          9 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 5 14 -1.</_>
+        <_>
+          10 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 6 -1.</_>
+        <_>
+          3 6 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 8 9 -1.</_>
+        <_>
+          16 6 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 10 -1.</_>
+        <_>
+          9 13 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 9 6 -1.</_>
+        <_>
+          15 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 9 6 -1.</_>
+        <_>
+          0 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 9 6 -1.</_>
+        <_>
+          13 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 6 -1.</_>
+        <_>
+          2 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 18 3 -1.</_>
+        <_>
+          5 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 3 -1.</_>
+        <_>
+          1 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 18 3 -1.</_>
+        <_>
+          5 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 19 2 -1.</_>
+        <_>
+          1 2 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 11 -1.</_>
+        <_>
+          16 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 15 6 -1.</_>
+        <_>
+          9 15 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 11 -1.</_>
+        <_>
+          16 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 11 -1.</_>
+        <_>
+          6 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          18 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 4 -1.</_>
+        <_>
+          1 2 11 2 2.</_>
+        <_>
+          12 4 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 21 12 -1.</_>
+        <_>
+          9 0 7 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 3 -1.</_>
+        <_>
+          0 13 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 9 -1.</_>
+        <_>
+          14 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 18 3 -1.</_>
+        <_>
+          3 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 8 9 -1.</_>
+        <_>
+          16 6 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 3 -1.</_>
+        <_>
+          3 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 9 -1.</_>
+        <_>
+          11 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 9 -1.</_>
+        <_>
+          11 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 18 -1.</_>
+        <_>
+          15 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 18 -1.</_>
+        <_>
+          8 0 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 7 9 -1.</_>
+        <_>
+          17 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 9 6 -1.</_>
+        <_>
+          3 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 21 3 -1.</_>
+        <_>
+          3 19 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 9 -1.</_>
+        <_>
+          0 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 22 3 -1.</_>
+        <_>
+          2 8 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 16 -1.</_>
+        <_>
+          0 3 12 8 2.</_>
+        <_>
+          12 11 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 9 4 -1.</_>
+        <_>
+          13 19 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 8 -1.</_>
+        <_>
+          5 5 6 4 2.</_>
+        <_>
+          11 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          12 6 7 3 2.</_>
+        <_>
+          5 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 14 6 -1.</_>
+        <_>
+          5 16 7 3 2.</_>
+        <_>
+          12 19 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          18 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 20 10 -1.</_>
+        <_>
+          13 4 10 5 2.</_>
+        <_>
+          3 9 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 9 8 -1.</_>
+        <_>
+          5 13 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 21 15 -1.</_>
+        <_>
+          9 1 7 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 14 8 -1.</_>
+        <_>
+          12 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 4 -1.</_>
+        <_>
+          6 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 6 -1.</_>
+        <_>
+          9 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 6 -1.</_>
+        <_>
+          8 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 18 2 -1.</_>
+        <_>
+          6 5 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          2 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 15 -1.</_>
+        <_>
+          20 0 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 13 -1.</_>
+        <_>
+          2 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          8 2 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 18 4 -1.</_>
+        <_>
+          12 13 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 4 -1.</_>
+        <_>
+          9 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 3 -1.</_>
+        <_>
+          11 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 19 3 -1.</_>
+        <_>
+          4 15 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 20 -1.</_>
+        <_>
+          10 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 9 6 -1.</_>
+        <_>
+          8 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 15 4 -1.</_>
+        <_>
+          7 9 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 7 -1.</_>
+        <_>
+          12 4 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 9 -1.</_>
+        <_>
+          0 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 9 -1.</_>
+        <_>
+          18 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 16 6 -1.</_>
+        <_>
+          0 18 8 3 2.</_>
+        <_>
+          8 21 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 14 6 -1.</_>
+        <_>
+          16 18 7 3 2.</_>
+        <_>
+          9 21 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 20 4 -1.</_>
+        <_>
+          1 20 10 2 2.</_>
+        <_>
+          11 22 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 20 6 -1.</_>
+        <_>
+          12 8 10 3 2.</_>
+        <_>
+          2 11 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 9 -1.</_>
+        <_>
+          9 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 8 -1.</_>
+        <_>
+          12 5 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 8 -1.</_>
+        <_>
+          8 5 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 16 -1.</_>
+        <_>
+          4 0 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 6 12 -1.</_>
+        <_>
+          15 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 12 -1.</_>
+        <_>
+          3 8 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 22 -1.</_>
+        <_>
+          4 11 15 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 6 -1.</_>
+        <_>
+          0 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 6 -1.</_>
+        <_>
+          0 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 10 -1.</_>
+        <_>
+          14 0 4 5 2.</_>
+        <_>
+          10 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 16 -1.</_>
+        <_>
+          3 0 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 4 10 -1.</_>
+        <_>
+          10 17 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 10 6 -1.</_>
+        <_>
+          8 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 22 18 2 -1.</_>
+        <_>
+          12 22 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 11 6 -1.</_>
+        <_>
+          7 9 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 10 -1.</_>
+        <_>
+          0 0 6 5 2.</_>
+        <_>
+          6 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 6 -1.</_>
+        <_>
+          16 1 6 3 2.</_>
+        <_>
+          10 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 9 4 -1.</_>
+        <_>
+          7 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 16 -1.</_>
+        <_>
+          10 7 5 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 13 -1.</_>
+        <_>
+          11 10 6 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 6 -1.</_>
+        <_>
+          12 2 6 3 2.</_>
+        <_>
+          6 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 9 -1.</_>
+        <_>
+          3 12 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 8 6 -1.</_>
+        <_>
+          16 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 6 -1.</_>
+        <_>
+          0 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 11 -1.</_>
+        <_>
+          0 3 12 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 10 -1.</_>
+        <_>
+          0 13 4 5 2.</_>
+        <_>
+          4 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 10 -1.</_>
+        <_>
+          10 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 21 -1.</_>
+        <_>
+          10 9 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 15 9 -1.</_>
+        <_>
+          4 7 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 6 -1.</_>
+        <_>
+          8 1 8 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 5 16 -1.</_>
+        <_>
+          9 14 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          9 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 12 -1.</_>
+        <_>
+          6 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 8 -1.</_>
+        <_>
+          8 6 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 20 2 -1.</_>
+        <_>
+          4 4 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 3 -1.</_>
+        <_>
+          8 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 10 6 -1.</_>
+        <_>
+          7 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 18 -1.</_>
+        <_>
+          1 4 2 9 2.</_>
+        <_>
+          3 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          15 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 9 -1.</_>
+        <_>
+          7 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 9 6 -1.</_>
+        <_>
+          9 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 2 -1.</_>
+        <_>
+          3 1 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 4 -1.</_>
+        <_>
+          0 10 10 2 2.</_>
+        <_>
+          10 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 12 -1.</_>
+        <_>
+          10 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 12 -1.</_>
+        <_>
+          6 5 3 6 2.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 22 -1.</_>
+        <_>
+          15 0 9 11 2.</_>
+        <_>
+          6 11 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 22 -1.</_>
+        <_>
+          0 0 9 11 2.</_>
+        <_>
+          9 11 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 11 -1.</_>
+        <_>
+          20 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          2 2 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          0 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 20 2 -1.</_>
+        <_>
+          2 3 20 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 6 9 -1.</_>
+        <_>
+          18 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 9 -1.</_>
+        <_>
+          0 3 22 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 6 9 -1.</_>
+        <_>
+          17 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 9 -1.</_>
+        <_>
+          0 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 6 -1.</_>
+        <_>
+          0 8 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 10 -1.</_>
+        <_>
+          2 2 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 9 -1.</_>
+        <_>
+          17 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 9 -1.</_>
+        <_>
+          5 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 9 6 -1.</_>
+        <_>
+          15 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 23 6 -1.</_>
+        <_>
+          0 17 23 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 18 3 -1.</_>
+        <_>
+          5 16 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 10 -1.</_>
+        <_>
+          13 8 4 5 2.</_>
+        <_>
+          9 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 6 -1.</_>
+        <_>
+          8 7 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 10 -1.</_>
+        <_>
+          13 8 4 5 2.</_>
+        <_>
+          9 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 12 -1.</_>
+        <_>
+          8 0 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 10 -1.</_>
+        <_>
+          13 8 4 5 2.</_>
+        <_>
+          9 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 9 -1.</_>
+        <_>
+          10 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          12 6 2 9 2.</_>
+        <_>
+          10 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 4 -1.</_>
+        <_>
+          11 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 10 -1.</_>
+        <_>
+          13 8 4 5 2.</_>
+        <_>
+          9 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 8 10 -1.</_>
+        <_>
+          7 8 4 5 2.</_>
+        <_>
+          11 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 14 -1.</_>
+        <_>
+          14 10 3 7 2.</_>
+        <_>
+          11 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 19 -1.</_>
+        <_>
+          12 5 3 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 12 6 -1.</_>
+        <_>
+          12 12 6 3 2.</_>
+        <_>
+          6 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 6 -1.</_>
+        <_>
+          1 9 9 3 2.</_>
+        <_>
+          10 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 8 10 -1.</_>
+        <_>
+          20 14 4 5 2.</_>
+        <_>
+          16 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 22 8 -1.</_>
+        <_>
+          0 9 11 4 2.</_>
+        <_>
+          11 13 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 12 6 -1.</_>
+        <_>
+          14 18 6 3 2.</_>
+        <_>
+          8 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 18 -1.</_>
+        <_>
+          0 6 10 9 2.</_>
+        <_>
+          10 15 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 20 12 -1.</_>
+        <_>
+          13 6 10 6 2.</_>
+        <_>
+          3 12 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 10 8 -1.</_>
+        <_>
+          0 16 5 4 2.</_>
+        <_>
+          5 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 19 3 -1.</_>
+        <_>
+          0 12 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 9 -1.</_>
+        <_>
+          14 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 22 4 -1.</_>
+        <_>
+          1 7 11 2 2.</_>
+        <_>
+          12 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 7 12 -1.</_>
+        <_>
+          13 10 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 11 9 -1.</_>
+        <_>
+          4 10 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 10 8 -1.</_>
+        <_>
+          17 10 5 4 2.</_>
+        <_>
+          12 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 9 7 -1.</_>
+        <_>
+          5 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 6 9 -1.</_>
+        <_>
+          16 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 12 -1.</_>
+        <_>
+          3 16 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 6 -1.</_>
+        <_>
+          14 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          10 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 23 -1.</_>
+        <_>
+          11 1 2 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 6 -1.</_>
+        <_>
+          0 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 18 3 -1.</_>
+        <_>
+          4 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 13 14 -1.</_>
+        <_>
+          5 9 13 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 8 12 -1.</_>
+        <_>
+          19 0 4 6 2.</_>
+        <_>
+          15 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          0 0 4 6 2.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 7 -1.</_>
+        <_>
+          8 2 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 9 -1.</_>
+        <_>
+          3 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 12 -1.</_>
+        <_>
+          17 8 3 6 2.</_>
+        <_>
+          14 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 12 -1.</_>
+        <_>
+          4 8 3 6 2.</_>
+        <_>
+          7 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 5 15 -1.</_>
+        <_>
+          16 10 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 15 -1.</_>
+        <_>
+          3 10 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 9 -1.</_>
+        <_>
+          18 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 15 -1.</_>
+        <_>
+          1 12 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 12 8 -1.</_>
+        <_>
+          17 15 6 4 2.</_>
+        <_>
+          11 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          0 2 12 2 2.</_>
+        <_>
+          12 4 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 19 -1.</_>
+        <_>
+          15 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 19 -1.</_>
+        <_>
+          8 1 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          22 1 2 20 -1.</_>
+        <_>
+          22 1 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 20 -1.</_>
+        <_>
+          1 1 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 6 12 -1.</_>
+        <_>
+          20 11 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 12 -1.</_>
+        <_>
+          2 11 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 14 -1.</_>
+        <_>
+          3 13 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 8 -1.</_>
+        <_>
+          6 14 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 12 -1.</_>
+        <_>
+          7 13 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 5 -1.</_>
+        <_>
+          11 18 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 20 3 -1.</_>
+        <_>
+          4 22 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 12 -1.</_>
+        <_>
+          9 12 3 6 2.</_>
+        <_>
+          12 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 18 3 -1.</_>
+        <_>
+          4 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 3 -1.</_>
+        <_>
+          3 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 9 -1.</_>
+        <_>
+          18 7 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 9 6 -1.</_>
+        <_>
+          2 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 18 4 -1.</_>
+        <_>
+          13 14 9 2 2.</_>
+        <_>
+          4 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 14 -1.</_>
+        <_>
+          7 7 3 7 2.</_>
+        <_>
+          10 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 12 6 -1.</_>
+        <_>
+          13 13 6 3 2.</_>
+        <_>
+          7 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 9 -1.</_>
+        <_>
+          10 7 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          12 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 10 -1.</_>
+        <_>
+          0 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 6 -1.</_>
+        <_>
+          11 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 6 -1.</_>
+        <_>
+          2 12 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 9 -1.</_>
+        <_>
+          13 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 9 -1.</_>
+        <_>
+          5 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 9 6 -1.</_>
+        <_>
+          9 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 6 -1.</_>
+        <_>
+          5 19 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 20 3 -1.</_>
+        <_>
+          3 3 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 6 -1.</_>
+        <_>
+          6 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 24 -1.</_>
+        <_>
+          12 0 1 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 15 4 -1.</_>
+        <_>
+          8 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 12 -1.</_>
+        <_>
+          9 18 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 8 -1.</_>
+        <_>
+          1 15 6 4 2.</_>
+        <_>
+          7 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 8 14 -1.</_>
+        <_>
+          19 10 4 7 2.</_>
+        <_>
+          15 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 8 14 -1.</_>
+        <_>
+          1 9 4 7 2.</_>
+        <_>
+          5 16 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 9 10 -1.</_>
+        <_>
+          9 16 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 6 -1.</_>
+        <_>
+          6 9 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 9 -1.</_>
+        <_>
+          12 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 7 -1.</_>
+        <_>
+          10 8 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 10 -1.</_>
+        <_>
+          14 4 4 5 2.</_>
+        <_>
+          10 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 9 -1.</_>
+        <_>
+          4 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 12 -1.</_>
+        <_>
+          8 6 8 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 14 -1.</_>
+        <_>
+          6 7 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 5 8 -1.</_>
+        <_>
+          19 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 8 -1.</_>
+        <_>
+          0 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 6 6 -1.</_>
+        <_>
+          17 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 6 -1.</_>
+        <_>
+          1 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 9 -1.</_>
+        <_>
+          18 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 18 6 -1.</_>
+        <_>
+          3 5 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 9 6 -1.</_>
+        <_>
+          2 5 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 10 8 -1.</_>
+        <_>
+          14 3 5 4 2.</_>
+        <_>
+          9 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 8 -1.</_>
+        <_>
+          5 3 5 4 2.</_>
+        <_>
+          10 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 12 -1.</_>
+        <_>
+          10 11 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 11 -1.</_>
+        <_>
+          11 11 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 7 -1.</_>
+        <_>
+          12 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 18 3 -1.</_>
+        <_>
+          5 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 9 -1.</_>
+        <_>
+          10 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 7 -1.</_>
+        <_>
+          11 1 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 6 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 11 -1.</_>
+        <_>
+          14 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 11 -1.</_>
+        <_>
+          8 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 18 -1.</_>
+        <_>
+          12 0 4 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 10 5 -1.</_>
+        <_>
+          7 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 22 3 -1.</_>
+        <_>
+          2 21 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 20 -1.</_>
+        <_>
+          1 4 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 4 -1.</_>
+        <_>
+          8 2 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 10 -1.</_>
+        <_>
+          6 7 4 5 2.</_>
+        <_>
+          10 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 14 -1.</_>
+        <_>
+          17 0 3 7 2.</_>
+        <_>
+          14 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 5 8 -1.</_>
+        <_>
+          4 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 20 9 -1.</_>
+        <_>
+          2 3 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 8 -1.</_>
+        <_>
+          6 7 6 4 2.</_>
+        <_>
+          12 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 6 -1.</_>
+        <_>
+          9 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 10 4 -1.</_>
+        <_>
+          7 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 9 -1.</_>
+        <_>
+          10 5 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 8 -1.</_>
+        <_>
+          8 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 17 -1.</_>
+        <_>
+          18 4 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 17 -1.</_>
+        <_>
+          18 4 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 17 -1.</_>
+        <_>
+          4 4 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 19 3 -1.</_>
+        <_>
+          5 19 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 18 -1.</_>
+        <_>
+          11 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 18 -1.</_>
+        <_>
+          15 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 18 -1.</_>
+        <_>
+          7 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 10 8 -1.</_>
+        <_>
+          12 11 5 4 2.</_>
+        <_>
+          7 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          12 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 8 -1.</_>
+        <_>
+          2 9 8 4 2.</_>
+        <_>
+          10 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 9 -1.</_>
+        <_>
+          14 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 9 -1.</_>
+        <_>
+          10 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 9 -1.</_>
+        <_>
+          14 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 12 6 -1.</_>
+        <_>
+          3 14 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 9 6 -1.</_>
+        <_>
+          14 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          1 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 3 -1.</_>
+        <_>
+          3 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 22 6 -1.</_>
+        <_>
+          1 9 22 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 6 6 -1.</_>
+        <_>
+          18 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 6 6 -1.</_>
+        <_>
+          0 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 16 6 -1.</_>
+        <_>
+          5 14 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 9 4 -1.</_>
+        <_>
+          6 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 9 -1.</_>
+        <_>
+          14 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 9 -1.</_>
+        <_>
+          4 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 6 23 -1.</_>
+        <_>
+          17 1 2 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 24 3 -1.</_>
+        <_>
+          8 21 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 24 4 -1.</_>
+        <_>
+          8 20 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 23 -1.</_>
+        <_>
+          5 1 2 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 18 3 -1.</_>
+        <_>
+          3 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 22 4 -1.</_>
+        <_>
+          12 16 11 2 2.</_>
+        <_>
+          1 18 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 6 -1.</_>
+        <_>
+          0 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 21 3 -1.</_>
+        <_>
+          9 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 12 6 -1.</_>
+        <_>
+          2 18 6 3 2.</_>
+        <_>
+          8 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 4 -1.</_>
+        <_>
+          0 7 24 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 12 -1.</_>
+        <_>
+          10 13 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 9 -1.</_>
+        <_>
+          8 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 9 -1.</_>
+        <_>
+          11 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 20 3 -1.</_>
+        <_>
+          2 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 12 6 -1.</_>
+        <_>
+          1 18 6 3 2.</_>
+        <_>
+          7 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 13 -1.</_>
+        <_>
+          13 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 4 -1.</_>
+        <_>
+          12 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 13 -1.</_>
+        <_>
+          10 1 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 18 -1.</_>
+        <_>
+          7 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 10 5 -1.</_>
+        <_>
+          14 3 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 12 8 -1.</_>
+        <_>
+          10 15 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 9 -1.</_>
+        <_>
+          11 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 9 -1.</_>
+        <_>
+          10 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 14 -1.</_>
+        <_>
+          20 0 3 7 2.</_>
+        <_>
+          17 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 14 -1.</_>
+        <_>
+          1 0 3 7 2.</_>
+        <_>
+          4 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 16 -1.</_>
+        <_>
+          17 0 3 8 2.</_>
+        <_>
+          14 8 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 10 -1.</_>
+        <_>
+          9 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 18 6 -1.</_>
+        <_>
+          12 17 9 3 2.</_>
+        <_>
+          3 20 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 22 4 -1.</_>
+        <_>
+          12 20 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 10 5 -1.</_>
+        <_>
+          14 3 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 5 -1.</_>
+        <_>
+          5 3 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 12 16 -1.</_>
+        <_>
+          16 6 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 16 -1.</_>
+        <_>
+          4 6 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 5 15 -1.</_>
+        <_>
+          10 14 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 21 2 -1.</_>
+        <_>
+          1 19 21 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 9 6 -1.</_>
+        <_>
+          15 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 4 -1.</_>
+        <_>
+          12 1 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 12 -1.</_>
+        <_>
+          12 0 6 6 2.</_>
+        <_>
+          6 6 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 12 -1.</_>
+        <_>
+          8 10 4 6 2.</_>
+        <_>
+          12 16 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 10 8 -1.</_>
+        <_>
+          19 16 5 4 2.</_>
+        <_>
+          14 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 10 8 -1.</_>
+        <_>
+          0 16 5 4 2.</_>
+        <_>
+          5 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 12 5 -1.</_>
+        <_>
+          14 12 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 10 8 -1.</_>
+        <_>
+          6 16 5 4 2.</_>
+        <_>
+          11 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 6 -1.</_>
+        <_>
+          13 6 6 3 2.</_>
+        <_>
+          7 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 18 -1.</_>
+        <_>
+          9 6 2 9 2.</_>
+        <_>
+          11 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 14 -1.</_>
+        <_>
+          13 9 3 7 2.</_>
+        <_>
+          10 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 14 -1.</_>
+        <_>
+          8 9 3 7 2.</_>
+        <_>
+          11 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 11 12 -1.</_>
+        <_>
+          7 10 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 16 -1.</_>
+        <_>
+          4 8 3 8 2.</_>
+        <_>
+          7 16 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 4 21 -1.</_>
+        <_>
+          17 10 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 4 21 -1.</_>
+        <_>
+          3 10 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 18 -1.</_>
+        <_>
+          14 1 4 9 2.</_>
+        <_>
+          10 10 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 16 8 -1.</_>
+        <_>
+          2 5 8 4 2.</_>
+        <_>
+          10 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 12 -1.</_>
+        <_>
+          3 10 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 12 -1.</_>
+        <_>
+          4 14 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 8 20 -1.</_>
+        <_>
+          19 4 4 10 2.</_>
+        <_>
+          15 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 9 6 -1.</_>
+        <_>
+          10 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 8 20 -1.</_>
+        <_>
+          19 4 4 10 2.</_>
+        <_>
+          15 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 20 -1.</_>
+        <_>
+          1 4 4 10 2.</_>
+        <_>
+          5 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 8 14 -1.</_>
+        <_>
+          15 8 4 7 2.</_>
+        <_>
+          11 15 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 14 -1.</_>
+        <_>
+          5 8 4 7 2.</_>
+        <_>
+          9 15 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 5 8 -1.</_>
+        <_>
+          10 17 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 7 9 -1.</_>
+        <_>
+          4 16 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 10 -1.</_>
+        <_>
+          0 18 24 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 8 11 -1.</_>
+        <_>
+          8 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 16 -1.</_>
+        <_>
+          14 2 4 8 2.</_>
+        <_>
+          10 10 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 6 -1.</_>
+        <_>
+          0 2 12 3 2.</_>
+        <_>
+          12 5 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 9 -1.</_>
+        <_>
+          6 3 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 12 -1.</_>
+        <_>
+          1 2 6 6 2.</_>
+        <_>
+          7 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 9 -1.</_>
+        <_>
+          18 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 10 -1.</_>
+        <_>
+          4 3 4 5 2.</_>
+        <_>
+          8 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 21 18 3 -1.</_>
+        <_>
+          6 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 3 -1.</_>
+        <_>
+          1 11 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 9 -1.</_>
+        <_>
+          2 11 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 12 6 -1.</_>
+        <_>
+          18 8 6 3 2.</_>
+        <_>
+          12 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_>
+        <_>
+          6 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 9 -1.</_>
+        <_>
+          12 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 9 6 -1.</_>
+        <_>
+          7 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 7 12 -1.</_>
+        <_>
+          9 14 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 6 -1.</_>
+        <_>
+          7 13 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 18 4 -1.</_>
+        <_>
+          12 15 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 16 -1.</_>
+        <_>
+          7 4 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 9 -1.</_>
+        <_>
+          12 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 9 -1.</_>
+        <_>
+          10 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 12 10 -1.</_>
+        <_>
+          15 11 6 5 2.</_>
+        <_>
+          9 16 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 14 6 -1.</_>
+        <_>
+          3 8 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 17 8 -1.</_>
+        <_>
+          4 6 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 21 -1.</_>
+        <_>
+          6 9 12 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 9 -1.</_>
+        <_>
+          8 4 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 3 -1.</_>
+        <_>
+          12 7 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 10 -1.</_>
+        <_>
+          11 11 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 3 -1.</_>
+        <_>
+          2 12 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 9 4 -1.</_>
+        <_>
+          8 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          0 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 6 -1.</_>
+        <_>
+          0 13 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 20 6 -1.</_>
+        <_>
+          2 12 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 12 -1.</_>
+        <_>
+          12 5 8 6 2.</_>
+        <_>
+          4 11 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 10 4 -1.</_>
+        <_>
+          7 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 8 -1.</_>
+        <_>
+          9 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 7 10 -1.</_>
+        <_>
+          17 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 10 -1.</_>
+        <_>
+          0 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 6 12 -1.</_>
+        <_>
+          19 1 3 6 2.</_>
+        <_>
+          16 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 19 8 -1.</_>
+        <_>
+          1 4 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 9 4 -1.</_>
+        <_>
+          12 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 9 4 -1.</_>
+        <_>
+          3 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 10 6 -1.</_>
+        <_>
+          12 4 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 18 2 -1.</_>
+        <_>
+          12 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 9 -1.</_>
+        <_>
+          12 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 9 -1.</_>
+        <_>
+          10 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 10 -1.</_>
+        <_>
+          14 5 4 5 2.</_>
+        <_>
+          10 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 13 -1.</_>
+        <_>
+          10 4 4 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 6 -1.</_>
+        <_>
+          13 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 3 -1.</_>
+        <_>
+          7 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 10 6 -1.</_>
+        <_>
+          7 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 21 5 -1.</_>
+        <_>
+          9 0 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 9 -1.</_>
+        <_>
+          0 11 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 7 -1.</_>
+        <_>
+          3 3 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 12 6 -1.</_>
+        <_>
+          15 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 20 6 -1.</_>
+        <_>
+          2 8 10 3 2.</_>
+        <_>
+          12 11 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 10 4 -1.</_>
+        <_>
+          13 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 18 -1.</_>
+        <_>
+          4 11 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 4 9 -1.</_>
+        <_>
+          20 4 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 14 -1.</_>
+        <_>
+          8 13 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 6 -1.</_>
+        <_>
+          12 1 12 3 2.</_>
+        <_>
+          0 4 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 9 -1.</_>
+        <_>
+          2 4 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 3 -1.</_>
+        <_>
+          3 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 16 6 -1.</_>
+        <_>
+          3 19 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 6 9 -1.</_>
+        <_>
+          13 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          5 6 7 3 2.</_>
+        <_>
+          12 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 8 10 -1.</_>
+        <_>
+          17 5 4 5 2.</_>
+        <_>
+          13 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 20 3 -1.</_>
+        <_>
+          2 3 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 6 -1.</_>
+        <_>
+          12 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 11 -1.</_>
+        <_>
+          12 3 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 11 -1.</_>
+        <_>
+          10 3 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 10 -1.</_>
+        <_>
+          12 3 4 5 2.</_>
+        <_>
+          8 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 18 -1.</_>
+        <_>
+          12 1 1 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 6 -1.</_>
+        <_>
+          12 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 19 3 -1.</_>
+        <_>
+          0 3 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 6 -1.</_>
+        <_>
+          9 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 5 -1.</_>
+        <_>
+          7 8 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 15 -1.</_>
+        <_>
+          13 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 3 -1.</_>
+        <_>
+          1 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 14 6 -1.</_>
+        <_>
+          9 9 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 18 3 -1.</_>
+        <_>
+          2 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_>
+        <_>
+          6 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 7 8 -1.</_>
+        <_>
+          9 17 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 20 3 -1.</_>
+        <_>
+          2 18 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 4 -1.</_>
+        <_>
+          4 2 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 6 6 -1.</_>
+        <_>
+          17 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          0 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 6 -1.</_>
+        <_>
+          0 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 12 6 -1.</_>
+        <_>
+          15 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 9 -1.</_>
+        <_>
+          3 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 8 10 -1.</_>
+        <_>
+          20 13 4 5 2.</_>
+        <_>
+          16 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 4 -1.</_>
+        <_>
+          8 14 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 6 6 -1.</_>
+        <_>
+          13 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 8 10 -1.</_>
+        <_>
+          0 13 4 5 2.</_>
+        <_>
+          4 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 6 -1.</_>
+        <_>
+          0 17 24 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 8 -1.</_>
+        <_>
+          5 2 6 4 2.</_>
+        <_>
+          11 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 9 6 -1.</_>
+        <_>
+          11 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 4 -1.</_>
+        <_>
+          4 5 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 10 -1.</_>
+        <_>
+          10 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 5 8 -1.</_>
+        <_>
+          8 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 12 -1.</_>
+        <_>
+          11 9 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 12 -1.</_>
+        <_>
+          4 9 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 9 -1.</_>
+        <_>
+          14 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 20 12 -1.</_>
+        <_>
+          2 8 20 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 17 16 -1.</_>
+        <_>
+          4 12 17 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 7 6 -1.</_>
+        <_>
+          8 10 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 23 2 -1.</_>
+        <_>
+          1 10 23 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 4 9 -1.</_>
+        <_>
+          13 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 13 -1.</_>
+        <_>
+          10 1 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 22 18 2 -1.</_>
+        <_>
+          4 23 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 6 -1.</_>
+        <_>
+          6 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 24 -1.</_>
+        <_>
+          14 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 24 -1.</_>
+        <_>
+          9 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 18 10 -1.</_>
+        <_>
+          9 2 6 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 6 -1.</_>
+        <_>
+          9 13 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          9 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 11 -1.</_>
+        <_>
+          11 1 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 4 -1.</_>
+        <_>
+          9 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 18 -1.</_>
+        <_>
+          12 0 5 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 16 -1.</_>
+        <_>
+          14 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 16 -1.</_>
+        <_>
+          8 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 6 -1.</_>
+        <_>
+          18 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 2 -1.</_>
+        <_>
+          3 6 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 6 -1.</_>
+        <_>
+          18 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 6 -1.</_>
+        <_>
+          0 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 11 6 -1.</_>
+        <_>
+          13 13 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 4 -1.</_>
+        <_>
+          10 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 10 7 -1.</_>
+        <_>
+          11 9 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 7 -1.</_>
+        <_>
+          8 9 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 6 6 -1.</_>
+        <_>
+          16 4 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          5 6 5 4 2.</_>
+        <_>
+          10 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 21 16 3 -1.</_>
+        <_>
+          7 21 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 16 3 -1.</_>
+        <_>
+          9 21 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 22 14 -1.</_>
+        <_>
+          13 5 11 7 2.</_>
+        <_>
+          2 12 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 10 -1.</_>
+        <_>
+          3 10 4 5 2.</_>
+        <_>
+          7 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 12 -1.</_>
+        <_>
+          20 0 3 6 2.</_>
+        <_>
+          17 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 18 -1.</_>
+        <_>
+          7 2 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          15 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 7 9 -1.</_>
+        <_>
+          0 15 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 8 10 -1.</_>
+        <_>
+          19 13 4 5 2.</_>
+        <_>
+          15 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 12 -1.</_>
+        <_>
+          1 0 3 6 2.</_>
+        <_>
+          4 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 8 10 -1.</_>
+        <_>
+          1 13 4 5 2.</_>
+        <_>
+          5 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 19 2 -1.</_>
+        <_>
+          3 22 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 13 -1.</_>
+        <_>
+          8 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 18 3 -1.</_>
+        <_>
+          5 11 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 12 -1.</_>
+        <_>
+          9 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 15 -1.</_>
+        <_>
+          11 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 4 -1.</_>
+        <_>
+          4 3 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 3 -1.</_>
+        <_>
+          6 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 8 -1.</_>
+        <_>
+          5 1 5 4 2.</_>
+        <_>
+          10 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 12 6 -1.</_>
+        <_>
+          17 18 6 3 2.</_>
+        <_>
+          11 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 3 -1.</_>
+        <_>
+          11 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 4 -1.</_>
+        <_>
+          1 10 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 9 6 -1.</_>
+        <_>
+          10 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 5 -1.</_>
+        <_>
+          10 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 7 -1.</_>
+        <_>
+          11 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 10 -1.</_>
+        <_>
+          11 2 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 10 -1.</_>
+        <_>
+          9 2 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 18 6 -1.</_>
+        <_>
+          15 4 9 3 2.</_>
+        <_>
+          6 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 9 -1.</_>
+        <_>
+          0 8 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 21 6 -1.</_>
+        <_>
+          2 9 21 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 22 16 -1.</_>
+        <_>
+          0 4 11 8 2.</_>
+        <_>
+          11 12 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 22 -1.</_>
+        <_>
+          9 11 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 12 -1.</_>
+        <_>
+          9 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 12 18 -1.</_>
+        <_>
+          18 0 6 9 2.</_>
+        <_>
+          12 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 18 -1.</_>
+        <_>
+          0 0 6 9 2.</_>
+        <_>
+          6 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 22 4 -1.</_>
+        <_>
+          12 1 11 2 2.</_>
+        <_>
+          1 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 4 -1.</_>
+        <_>
+          3 2 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 22 6 -1.</_>
+        <_>
+          2 7 22 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 9 -1.</_>
+        <_>
+          5 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 9 -1.</_>
+        <_>
+          12 14 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 9 -1.</_>
+        <_>
+          10 14 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 18 3 -1.</_>
+        <_>
+          5 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 13 -1.</_>
+        <_>
+          9 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 4 -1.</_>
+        <_>
+          7 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 6 -1.</_>
+        <_>
+          9 2 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 18 3 -1.</_>
+        <_>
+          4 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 12 -1.</_>
+        <_>
+          0 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 9 -1.</_>
+        <_>
+          11 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 13 -1.</_>
+        <_>
+          11 10 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 18 2 -1.</_>
+        <_>
+          6 18 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 9 -1.</_>
+        <_>
+          11 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 8 -1.</_>
+        <_>
+          5 6 5 4 2.</_>
+        <_>
+          10 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 5 8 -1.</_>
+        <_>
+          14 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 5 8 -1.</_>
+        <_>
+          5 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 9 6 -1.</_>
+        <_>
+          14 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 23 15 -1.</_>
+        <_>
+          0 7 23 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 12 -1.</_>
+        <_>
+          16 6 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 9 -1.</_>
+        <_>
+          4 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 4 -1.</_>
+        <_>
+          8 20 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 11 6 -1.</_>
+        <_>
+          13 13 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 11 6 -1.</_>
+        <_>
+          0 13 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 6 -1.</_>
+        <_>
+          12 9 12 3 2.</_>
+        <_>
+          0 12 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 8 8 -1.</_>
+        <_>
+          6 20 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 14 6 -1.</_>
+        <_>
+          10 18 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 21 3 -1.</_>
+        <_>
+          1 2 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 3 -1.</_>
+        <_>
+          0 2 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 8 5 -1.</_>
+        <_>
+          6 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 21 3 -1.</_>
+        <_>
+          9 11 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 12 6 -1.</_>
+        <_>
+          1 18 6 3 2.</_>
+        <_>
+          7 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 10 -1.</_>
+        <_>
+          10 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 10 -1.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 12 -1.</_>
+        <_>
+          9 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 6 -1.</_>
+        <_>
+          10 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 19 2 -1.</_>
+        <_>
+          3 15 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 10 -1.</_>
+        <_>
+          7 7 5 5 2.</_>
+        <_>
+          12 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 18 12 -1.</_>
+        <_>
+          3 12 9 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 12 -1.</_>
+        <_>
+          10 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 9 -1.</_>
+        <_>
+          3 3 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 11 -1.</_>
+        <_>
+          10 0 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 13 -1.</_>
+        <_>
+          4 0 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 16 6 -1.</_>
+        <_>
+          5 11 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 12 -1.</_>
+        <_>
+          8 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          9 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 20 3 -1.</_>
+        <_>
+          2 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 10 -1.</_>
+        <_>
+          9 6 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 9 6 -1.</_>
+        <_>
+          7 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 6 16 -1.</_>
+        <_>
+          19 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 16 -1.</_>
+        <_>
+          3 1 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 9 -1.</_>
+        <_>
+          14 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          0 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          9 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 6 -1.</_>
+        <_>
+          6 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 16 -1.</_>
+        <_>
+          14 15 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 12 -1.</_>
+        <_>
+          4 10 7 6 2.</_>
+        <_>
+          11 16 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 6 -1.</_>
+        <_>
+          7 8 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 20 -1.</_>
+        <_>
+          9 2 2 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 9 -1.</_>
+        <_>
+          14 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          12 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 9 -1.</_>
+        <_>
+          14 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 14 4 -1.</_>
+        <_>
+          5 22 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 12 -1.</_>
+        <_>
+          4 10 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 21 4 -1.</_>
+        <_>
+          3 2 21 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 9 -1.</_>
+        <_>
+          4 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 5 8 -1.</_>
+        <_>
+          16 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 16 -1.</_>
+        <_>
+          4 0 8 8 2.</_>
+        <_>
+          12 8 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 6 -1.</_>
+        <_>
+          13 6 7 3 2.</_>
+        <_>
+          6 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 15 -1.</_>
+        <_>
+          10 10 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 12 8 -1.</_>
+        <_>
+          15 15 6 4 2.</_>
+        <_>
+          9 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 4 -1.</_>
+        <_>
+          12 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          12 6 7 3 2.</_>
+        <_>
+          5 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 10 -1.</_>
+        <_>
+          3 6 9 5 2.</_>
+        <_>
+          12 11 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 21 -1.</_>
+        <_>
+          12 0 6 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 21 -1.</_>
+        <_>
+          8 0 8 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 3 -1.</_>
+        <_>
+          6 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 6 -1.</_>
+        <_>
+          0 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 19 2 -1.</_>
+        <_>
+          4 4 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 2 -1.</_>
+        <_>
+          0 4 24 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 9 4 -1.</_>
+        <_>
+          15 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 4 -1.</_>
+        <_>
+          0 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 18 2 -1.</_>
+        <_>
+          6 16 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 18 3 -1.</_>
+        <_>
+          3 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 23 -1.</_>
+        <_>
+          13 0 1 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          6 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 23 -1.</_>
+        <_>
+          10 0 1 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 10 -1.</_>
+        <_>
+          10 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 12 -1.</_>
+        <_>
+          7 12 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 14 -1.</_>
+        <_>
+          17 9 3 7 2.</_>
+        <_>
+          14 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 9 -1.</_>
+        <_>
+          2 3 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 5 12 -1.</_>
+        <_>
+          11 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 10 -1.</_>
+        <_>
+          1 4 6 5 2.</_>
+        <_>
+          7 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 9 4 -1.</_>
+        <_>
+          15 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 10 -1.</_>
+        <_>
+          1 2 4 5 2.</_>
+        <_>
+          5 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 5 12 -1.</_>
+        <_>
+          10 5 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 24 -1.</_>
+        <_>
+          11 0 7 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 10 4 -1.</_>
+        <_>
+          7 19 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 10 -1.</_>
+        <_>
+          10 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 6 9 -1.</_>
+        <_>
+          15 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          3 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 6 9 -1.</_>
+        <_>
+          15 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 9 -1.</_>
+        <_>
+          7 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          12 6 2 9 2.</_>
+        <_>
+          10 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 11 -1.</_>
+        <_>
+          9 3 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 9 4 -1.</_>
+        <_>
+          15 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 8 -1.</_>
+        <_>
+          5 8 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 15 9 -1.</_>
+        <_>
+          8 4 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 10 -1.</_>
+        <_>
+          7 2 4 5 2.</_>
+        <_>
+          11 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 12 -1.</_>
+        <_>
+          12 2 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 12 -1.</_>
+        <_>
+          9 2 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 4 -1.</_>
+        <_>
+          7 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 10 -1.</_>
+        <_>
+          10 3 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 16 6 -1.</_>
+        <_>
+          13 6 8 3 2.</_>
+        <_>
+          5 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 9 -1.</_>
+        <_>
+          9 1 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 18 5 -1.</_>
+        <_>
+          9 8 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 22 -1.</_>
+        <_>
+          0 0 12 11 2.</_>
+        <_>
+          12 11 12 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 9 6 -1.</_>
+        <_>
+          14 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 24 8 -1.</_>
+        <_>
+          0 20 24 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 22 4 -1.</_>
+        <_>
+          12 19 11 2 2.</_>
+        <_>
+          1 21 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 9 6 -1.</_>
+        <_>
+          1 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 9 -1.</_>
+        <_>
+          11 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 12 6 -1.</_>
+        <_>
+          16 18 6 3 2.</_>
+        <_>
+          10 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 12 6 -1.</_>
+        <_>
+          2 18 6 3 2.</_>
+        <_>
+          8 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 16 9 -1.</_>
+        <_>
+          8 6 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 18 3 -1.</_>
+        <_>
+          5 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 6 -1.</_>
+        <_>
+          2 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 10 9 -1.</_>
+        <_>
+          14 5 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 3 -1.</_>
+        <_>
+          3 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 15 6 -1.</_>
+        <_>
+          9 4 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 15 6 -1.</_>
+        <_>
+          4 10 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 4 -1.</_>
+        <_>
+          12 5 12 2 2.</_>
+        <_>
+          0 7 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 12 -1.</_>
+        <_>
+          9 8 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 12 -1.</_>
+        <_>
+          0 12 3 6 2.</_>
+        <_>
+          3 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 10 6 -1.</_>
+        <_>
+          14 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 9 -1.</_>
+        <_>
+          2 10 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 10 9 -1.</_>
+        <_>
+          11 17 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 8 -1.</_>
+        <_>
+          7 6 5 4 2.</_>
+        <_>
+          12 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 6 -1.</_>
+        <_>
+          13 6 7 3 2.</_>
+        <_>
+          6 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 7 -1.</_>
+        <_>
+          7 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 12 -1.</_>
+        <_>
+          17 10 3 6 2.</_>
+        <_>
+          14 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 12 -1.</_>
+        <_>
+          4 10 3 6 2.</_>
+        <_>
+          7 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 8 6 -1.</_>
+        <_>
+          13 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 14 -1.</_>
+        <_>
+          10 3 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 18 -1.</_>
+        <_>
+          18 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 16 12 -1.</_>
+        <_>
+          12 12 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 14 -1.</_>
+        <_>
+          17 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 14 -1.</_>
+        <_>
+          5 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 12 20 -1.</_>
+        <_>
+          16 2 4 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 20 -1.</_>
+        <_>
+          4 2 4 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 6 17 -1.</_>
+        <_>
+          18 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 17 -1.</_>
+        <_>
+          4 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 9 6 -1.</_>
+        <_>
+          15 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 9 6 -1.</_>
+        <_>
+          0 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 13 -1.</_>
+        <_>
+          20 1 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 13 -1.</_>
+        <_>
+          2 1 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 9 -1.</_>
+        <_>
+          16 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 7 -1.</_>
+        <_>
+          9 10 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 12 6 -1.</_>
+        <_>
+          12 11 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 6 -1.</_>
+        <_>
+          0 11 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 9 -1.</_>
+        <_>
+          5 10 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 3 -1.</_>
+        <_>
+          0 16 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 8 10 -1.</_>
+        <_>
+          12 10 4 5 2.</_>
+        <_>
+          8 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 13 9 -1.</_>
+        <_>
+          5 7 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 18 -1.</_>
+        <_>
+          10 8 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 4 -1.</_>
+        <_>
+          6 11 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 15 12 -1.</_>
+        <_>
+          3 6 15 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 12 5 -1.</_>
+        <_>
+          16 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 3 -1.</_>
+        <_>
+          6 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 24 5 -1.</_>
+        <_>
+          8 14 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 18 -1.</_>
+        <_>
+          6 1 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 14 -1.</_>
+        <_>
+          10 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 9 -1.</_>
+        <_>
+          11 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 6 -1.</_>
+        <_>
+          14 2 6 3 2.</_>
+        <_>
+          8 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 17 4 -1.</_>
+        <_>
+          0 6 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 5 8 -1.</_>
+        <_>
+          16 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 5 8 -1.</_>
+        <_>
+          3 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 2 -1.</_>
+        <_>
+          6 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 5 -1.</_>
+        <_>
+          4 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 12 -1.</_>
+        <_>
+          17 3 3 6 2.</_>
+        <_>
+          14 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 12 -1.</_>
+        <_>
+          2 12 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 21 3 -1.</_>
+        <_>
+          2 4 21 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 12 -1.</_>
+        <_>
+          4 3 3 6 2.</_>
+        <_>
+          7 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 12 6 -1.</_>
+        <_>
+          18 8 6 3 2.</_>
+        <_>
+          12 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 16 9 -1.</_>
+        <_>
+          8 15 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 18 5 -1.</_>
+        <_>
+          6 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 6 -1.</_>
+        <_>
+          6 6 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 6 -1.</_>
+        <_>
+          14 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 15 11 -1.</_>
+        <_>
+          8 0 5 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 3 18 -1.</_>
+        <_>
+          15 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 18 -1.</_>
+        <_>
+          6 9 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 8 -1.</_>
+        <_>
+          14 5 5 4 2.</_>
+        <_>
+          9 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 8 -1.</_>
+        <_>
+          4 4 8 4 2.</_>
+        <_>
+          12 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 3 -1.</_>
+        <_>
+          7 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 13 -1.</_>
+        <_>
+          8 0 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 10 9 -1.</_>
+        <_>
+          8 4 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          0 3 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 14 6 -1.</_>
+        <_>
+          17 13 7 3 2.</_>
+        <_>
+          10 16 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 6 -1.</_>
+        <_>
+          0 13 7 3 2.</_>
+        <_>
+          7 16 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 2 3 21 -1.</_>
+        <_>
+          21 2 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 5 12 -1.</_>
+        <_>
+          0 13 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 12 6 -1.</_>
+        <_>
+          12 8 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 20 3 -1.</_>
+        <_>
+          1 9 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 19 3 -1.</_>
+        <_>
+          5 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          1 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 14 12 -1.</_>
+        <_>
+          6 14 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 18 -1.</_>
+        <_>
+          5 12 14 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 7 -1.</_>
+        <_>
+          14 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 4 -1.</_>
+        <_>
+          1 17 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 9 -1.</_>
+        <_>
+          11 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 4 -1.</_>
+        <_>
+          0 8 9 2 2.</_>
+        <_>
+          9 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 20 6 -1.</_>
+        <_>
+          13 10 10 3 2.</_>
+        <_>
+          3 13 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 20 6 -1.</_>
+        <_>
+          1 10 10 3 2.</_>
+        <_>
+          11 13 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 2 -1.</_>
+        <_>
+          0 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 8 -1.</_>
+        <_>
+          1 12 10 4 2.</_>
+        <_>
+          11 16 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 7 -1.</_>
+        <_>
+          14 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 9 7 -1.</_>
+        <_>
+          7 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 5 -1.</_>
+        <_>
+          12 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 5 -1.</_>
+        <_>
+          8 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 10 -1.</_>
+        <_>
+          13 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 20 2 -1.</_>
+        <_>
+          11 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 6 -1.</_>
+        <_>
+          9 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 21 3 -1.</_>
+        <_>
+          7 1 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 13 9 -1.</_>
+        <_>
+          6 7 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 5 -1.</_>
+        <_>
+          10 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 6 -1.</_>
+        <_>
+          10 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 5 8 -1.</_>
+        <_>
+          6 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          15 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 6 -1.</_>
+        <_>
+          8 10 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 4 -1.</_>
+        <_>
+          11 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 21 3 -1.</_>
+        <_>
+          8 20 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 2 -1.</_>
+        <_>
+          1 11 22 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 9 -1.</_>
+        <_>
+          15 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 9 -1.</_>
+        <_>
+          7 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 20 -1.</_>
+        <_>
+          20 2 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 20 -1.</_>
+        <_>
+          2 2 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 14 -1.</_>
+        <_>
+          14 7 3 7 2.</_>
+        <_>
+          11 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 9 -1.</_>
+        <_>
+          2 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 9 4 -1.</_>
+        <_>
+          12 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 9 4 -1.</_>
+        <_>
+          1 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 15 6 -1.</_>
+        <_>
+          7 8 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 18 -1.</_>
+        <_>
+          8 8 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 6 -1.</_>
+        <_>
+          12 6 6 3 2.</_>
+        <_>
+          6 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 20 4 -1.</_>
+        <_>
+          2 19 10 2 2.</_>
+        <_>
+          12 21 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 6 9 -1.</_>
+        <_>
+          14 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 14 -1.</_>
+        <_>
+          3 5 9 7 2.</_>
+        <_>
+          12 12 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 18 -1.</_>
+        <_>
+          17 6 2 9 2.</_>
+        <_>
+          15 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 18 -1.</_>
+        <_>
+          5 6 2 9 2.</_>
+        <_>
+          7 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 9 -1.</_>
+        <_>
+          13 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 6 9 -1.</_>
+        <_>
+          13 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          12 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 6 -1.</_>
+        <_>
+          12 1 8 3 2.</_>
+        <_>
+          4 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 11 -1.</_>
+        <_>
+          11 13 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 6 12 -1.</_>
+        <_>
+          20 1 3 6 2.</_>
+        <_>
+          17 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 3 -1.</_>
+        <_>
+          1 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 10 8 -1.</_>
+        <_>
+          7 17 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 10 6 -1.</_>
+        <_>
+          6 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 4 -1.</_>
+        <_>
+          9 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 12 -1.</_>
+        <_>
+          1 1 3 6 2.</_>
+        <_>
+          4 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 5 12 -1.</_>
+        <_>
+          19 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 8 -1.</_>
+        <_>
+          4 0 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 19 3 -1.</_>
+        <_>
+          3 6 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 6 -1.</_>
+        <_>
+          1 5 6 3 2.</_>
+        <_>
+          7 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 21 8 -1.</_>
+        <_>
+          9 1 7 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 8 -1.</_>
+        <_>
+          4 5 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 3 -1.</_>
+        <_>
+          6 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 14 -1.</_>
+        <_>
+          4 11 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 10 -1.</_>
+        <_>
+          15 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 18 3 -1.</_>
+        <_>
+          9 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 12 6 -1.</_>
+        <_>
+          12 18 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 9 -1.</_>
+        <_>
+          6 15 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 8 -1.</_>
+        <_>
+          15 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 8 -1.</_>
+        <_>
+          3 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 18 6 -1.</_>
+        <_>
+          14 9 9 3 2.</_>
+        <_>
+          5 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 12 6 -1.</_>
+        <_>
+          1 15 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 10 6 -1.</_>
+        <_>
+          14 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 6 -1.</_>
+        <_>
+          0 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 6 9 -1.</_>
+        <_>
+          15 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 6 9 -1.</_>
+        <_>
+          3 16 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 8 -1.</_>
+        <_>
+          9 5 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 12 6 -1.</_>
+        <_>
+          1 18 6 3 2.</_>
+        <_>
+          7 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 19 10 4 -1.</_>
+        <_>
+          13 21 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 10 4 -1.</_>
+        <_>
+          1 21 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 18 3 -1.</_>
+        <_>
+          6 20 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 10 -1.</_>
+        <_>
+          8 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 6 -1.</_>
+        <_>
+          0 2 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          0 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 20 6 -1.</_>
+        <_>
+          14 9 10 3 2.</_>
+        <_>
+          4 12 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 19 8 -1.</_>
+        <_>
+          1 19 19 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 6 -1.</_>
+        <_>
+          14 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 21 14 -1.</_>
+        <_>
+          8 10 7 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 8 -1.</_>
+        <_>
+          10 10 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 4 -1.</_>
+        <_>
+          11 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 9 -1.</_>
+        <_>
+          10 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          9 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 13 -1.</_>
+        <_>
+          14 4 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 13 -1.</_>
+        <_>
+          8 4 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 6 -1.</_>
+        <_>
+          11 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 6 -1.</_>
+        <_>
+          3 6 8 3 2.</_>
+        <_>
+          11 9 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 16 14 -1.</_>
+        <_>
+          13 4 8 7 2.</_>
+        <_>
+          5 11 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 4 -1.</_>
+        <_>
+          0 0 12 2 2.</_>
+        <_>
+          12 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 6 -1.</_>
+        <_>
+          12 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 4 -1.</_>
+        <_>
+          11 1 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 7 9 -1.</_>
+        <_>
+          10 17 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 8 10 -1.</_>
+        <_>
+          8 3 4 5 2.</_>
+        <_>
+          12 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 5 -1.</_>
+        <_>
+          11 3 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 13 -1.</_>
+        <_>
+          10 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 19 -1.</_>
+        <_>
+          12 2 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 6 -1.</_>
+        <_>
+          10 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 22 20 2 -1.</_>
+        <_>
+          4 22 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 24 4 -1.</_>
+        <_>
+          0 16 12 2 2.</_>
+        <_>
+          12 18 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 5 -1.</_>
+        <_>
+          11 3 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 8 14 -1.</_>
+        <_>
+          1 10 4 7 2.</_>
+        <_>
+          5 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 6 6 -1.</_>
+        <_>
+          11 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 24 -1.</_>
+        <_>
+          6 0 5 12 2.</_>
+        <_>
+          11 12 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 14 14 -1.</_>
+        <_>
+          14 5 7 7 2.</_>
+        <_>
+          7 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 8 -1.</_>
+        <_>
+          7 8 5 4 2.</_>
+        <_>
+          12 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 6 -1.</_>
+        <_>
+          12 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 3 -1.</_>
+        <_>
+          12 6 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 5 -1.</_>
+        <_>
+          11 3 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 22 4 -1.</_>
+        <_>
+          1 13 11 2 2.</_>
+        <_>
+          12 15 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 12 6 -1.</_>
+        <_>
+          9 14 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 9 6 -1.</_>
+        <_>
+          0 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 23 6 -1.</_>
+        <_>
+          1 7 23 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 19 12 -1.</_>
+        <_>
+          1 10 19 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 21 -1.</_>
+        <_>
+          9 8 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 19 18 3 -1.</_>
+        <_>
+          9 19 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 9 -1.</_>
+        <_>
+          11 14 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 12 -1.</_>
+        <_>
+          11 6 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 6 9 -1.</_>
+        <_>
+          18 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 9 -1.</_>
+        <_>
+          4 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 22 -1.</_>
+        <_>
+          15 1 2 11 2.</_>
+        <_>
+          13 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 12 -1.</_>
+        <_>
+          1 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 7 9 -1.</_>
+        <_>
+          14 10 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 18 4 -1.</_>
+        <_>
+          3 12 9 2 2.</_>
+        <_>
+          12 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 22 -1.</_>
+        <_>
+          15 1 2 11 2.</_>
+        <_>
+          13 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 22 -1.</_>
+        <_>
+          7 1 2 11 2.</_>
+        <_>
+          9 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 20 4 -1.</_>
+        <_>
+          14 7 10 2 2.</_>
+        <_>
+          4 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 7 -1.</_>
+        <_>
+          12 10 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 4 -1.</_>
+        <_>
+          7 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 15 -1.</_>
+        <_>
+          0 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 8 12 -1.</_>
+        <_>
+          19 0 4 6 2.</_>
+        <_>
+          15 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 12 -1.</_>
+        <_>
+          1 0 4 6 2.</_>
+        <_>
+          5 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 16 -1.</_>
+        <_>
+          16 5 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 16 -1.</_>
+        <_>
+          6 5 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 16 -1.</_>
+        <_>
+          17 0 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 16 -1.</_>
+        <_>
+          5 0 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 24 3 -1.</_>
+        <_>
+          0 3 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 4 -1.</_>
+        <_>
+          7 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 23 8 -1.</_>
+        <_>
+          1 4 23 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 19 3 -1.</_>
+        <_>
+          1 18 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 2 -1.</_>
+        <_>
+          6 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 9 6 -1.</_>
+        <_>
+          1 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 6 9 -1.</_>
+        <_>
+          15 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 9 -1.</_>
+        <_>
+          3 18 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 20 6 -1.</_>
+        <_>
+          4 17 20 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 14 -1.</_>
+        <_>
+          0 10 3 7 2.</_>
+        <_>
+          3 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 3 -1.</_>
+        <_>
+          6 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 9 7 -1.</_>
+        <_>
+          7 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 18 5 -1.</_>
+        <_>
+          12 10 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 5 -1.</_>
+        <_>
+          6 10 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 18 9 -1.</_>
+        <_>
+          9 2 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 10 -1.</_>
+        <_>
+          4 6 5 5 2.</_>
+        <_>
+          9 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 14 4 9 -1.</_>
+        <_>
+          20 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 4 9 -1.</_>
+        <_>
+          2 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 20 -1.</_>
+        <_>
+          13 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 21 12 3 -1.</_>
+        <_>
+          12 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 20 -1.</_>
+        <_>
+          13 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 10 8 -1.</_>
+        <_>
+          1 16 5 4 2.</_>
+        <_>
+          6 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 20 -1.</_>
+        <_>
+          13 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 19 -1.</_>
+        <_>
+          2 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 20 -1.</_>
+        <_>
+          13 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 9 -1.</_>
+        <_>
+          2 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 19 4 -1.</_>
+        <_>
+          3 9 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 9 6 -1.</_>
+        <_>
+          7 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 7 6 -1.</_>
+        <_>
+          17 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 8 -1.</_>
+        <_>
+          5 4 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 8 6 -1.</_>
+        <_>
+          16 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 6 -1.</_>
+        <_>
+          0 4 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 4 -1.</_>
+        <_>
+          15 0 9 2 2.</_>
+        <_>
+          6 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 8 -1.</_>
+        <_>
+          9 7 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 9 -1.</_>
+        <_>
+          4 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 9 -1.</_>
+        <_>
+          12 5 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          10 6 2 9 2.</_>
+        <_>
+          12 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 20 -1.</_>
+        <_>
+          13 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 20 -1.</_>
+        <_>
+          9 1 2 10 2.</_>
+        <_>
+          11 11 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 18 6 -1.</_>
+        <_>
+          14 9 9 3 2.</_>
+        <_>
+          5 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 9 -1.</_>
+        <_>
+          8 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 8 6 -1.</_>
+        <_>
+          10 16 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 8 -1.</_>
+        <_>
+          0 0 9 4 2.</_>
+        <_>
+          9 4 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 14 12 -1.</_>
+        <_>
+          13 5 7 6 2.</_>
+        <_>
+          6 11 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 15 7 -1.</_>
+        <_>
+          9 3 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 10 6 -1.</_>
+        <_>
+          14 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 10 -1.</_>
+        <_>
+          0 16 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 22 3 -1.</_>
+        <_>
+          1 11 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 10 -1.</_>
+        <_>
+          10 9 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 12 -1.</_>
+        <_>
+          16 2 3 6 2.</_>
+        <_>
+          13 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          10 6 2 9 2.</_>
+        <_>
+          12 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 16 -1.</_>
+        <_>
+          12 8 5 8 2.</_>
+        <_>
+          7 16 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 12 -1.</_>
+        <_>
+          8 1 4 6 2.</_>
+        <_>
+          12 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 14 -1.</_>
+        <_>
+          13 1 6 7 2.</_>
+        <_>
+          7 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 12 6 -1.</_>
+        <_>
+          2 16 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 6 6 -1.</_>
+        <_>
+          11 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 6 -1.</_>
+        <_>
+          7 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 10 -1.</_>
+        <_>
+          13 4 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 19 3 -1.</_>
+        <_>
+          0 20 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 8 -1.</_>
+        <_>
+          12 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 8 22 -1.</_>
+        <_>
+          8 12 8 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 8 -1.</_>
+        <_>
+          12 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 8 -1.</_>
+        <_>
+          6 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 9 -1.</_>
+        <_>
+          14 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 4 -1.</_>
+        <_>
+          0 8 24 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 10 6 -1.</_>
+        <_>
+          14 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 6 -1.</_>
+        <_>
+          0 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 19 3 -1.</_>
+        <_>
+          4 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 19 3 -1.</_>
+        <_>
+          1 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 9 -1.</_>
+        <_>
+          4 3 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 5 -1.</_>
+        <_>
+          8 1 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 15 -1.</_>
+        <_>
+          3 11 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 22 18 2 -1.</_>
+        <_>
+          6 23 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 9 -1.</_>
+        <_>
+          2 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 6 9 -1.</_>
+        <_>
+          18 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 9 -1.</_>
+        <_>
+          0 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 10 -1.</_>
+        <_>
+          11 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 16 -1.</_>
+        <_>
+          9 14 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 10 -1.</_>
+        <_>
+          7 12 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 13 -1.</_>
+        <_>
+          3 3 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 13 -1.</_>
+        <_>
+          18 1 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 9 -1.</_>
+        <_>
+          7 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 6 11 -1.</_>
+        <_>
+          18 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 11 -1.</_>
+        <_>
+          3 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 15 6 -1.</_>
+        <_>
+          9 14 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 20 3 -1.</_>
+        <_>
+          2 3 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          10 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 14 -1.</_>
+        <_>
+          5 6 6 7 2.</_>
+        <_>
+          11 13 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 6 -1.</_>
+        <_>
+          10 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 9 -1.</_>
+        <_>
+          12 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 20 -1.</_>
+        <_>
+          4 1 6 10 2.</_>
+        <_>
+          10 11 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 18 3 -1.</_>
+        <_>
+          6 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 18 3 -1.</_>
+        <_>
+          9 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 18 3 -1.</_>
+        <_>
+          9 20 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 12 15 -1.</_>
+        <_>
+          10 2 4 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 3 -1.</_>
+        <_>
+          2 4 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 4 18 -1.</_>
+        <_>
+          21 4 2 9 2.</_>
+        <_>
+          19 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 19 3 -1.</_>
+        <_>
+          0 2 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 4 -1.</_>
+        <_>
+          5 2 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 5 -1.</_>
+        <_>
+          12 2 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 22 14 -1.</_>
+        <_>
+          1 2 11 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 9 -1.</_>
+        <_>
+          10 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 18 3 -1.</_>
+        <_>
+          6 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 18 -1.</_>
+        <_>
+          9 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 20 3 -1.</_>
+        <_>
+          2 1 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 5 12 -1.</_>
+        <_>
+          5 8 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 5 -1.</_>
+        <_>
+          12 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 12 -1.</_>
+        <_>
+          9 12 3 6 2.</_>
+        <_>
+          12 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 8 10 -1.</_>
+        <_>
+          18 14 4 5 2.</_>
+        <_>
+          14 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 8 10 -1.</_>
+        <_>
+          2 14 4 5 2.</_>
+        <_>
+          6 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 12 6 -1.</_>
+        <_>
+          16 18 6 3 2.</_>
+        <_>
+          10 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 9 -1.</_>
+        <_>
+          1 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 20 -1.</_>
+        <_>
+          12 3 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 14 6 -1.</_>
+        <_>
+          4 6 7 3 2.</_>
+        <_>
+          11 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 13 -1.</_>
+        <_>
+          10 5 4 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 15 -1.</_>
+        <_>
+          5 9 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 15 4 -1.</_>
+        <_>
+          14 16 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 14 -1.</_>
+        <_>
+          7 8 3 7 2.</_>
+        <_>
+          10 15 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 6 -1.</_>
+        <_>
+          7 8 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 3 -1.</_>
+        <_>
+          2 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 8 -1.</_>
+        <_>
+          5 5 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 18 -1.</_>
+        <_>
+          7 10 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 3 -1.</_>
+        <_>
+          0 11 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 13 -1.</_>
+        <_>
+          2 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 10 -1.</_>
+        <_>
+          20 0 4 5 2.</_>
+        <_>
+          16 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 9 -1.</_>
+        <_>
+          5 4 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 18 3 -1.</_>
+        <_>
+          5 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 3 -1.</_>
+        <_>
+          0 2 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 11 -1.</_>
+        <_>
+          13 4 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 10 -1.</_>
+        <_>
+          0 0 4 5 2.</_>
+        <_>
+          4 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 18 3 -1.</_>
+        <_>
+          4 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 18 3 -1.</_>
+        <_>
+          2 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 10 -1.</_>
+        <_>
+          12 0 9 5 2.</_>
+        <_>
+          3 5 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 21 -1.</_>
+        <_>
+          12 3 10 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 3 -1.</_>
+        <_>
+          6 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 6 -1.</_>
+        <_>
+          0 9 6 3 2.</_>
+        <_>
+          6 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 21 4 -1.</_>
+        <_>
+          10 14 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 21 4 -1.</_>
+        <_>
+          7 14 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 18 3 -1.</_>
+        <_>
+          11 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 18 3 -1.</_>
+        <_>
+          7 21 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 4 18 -1.</_>
+        <_>
+          21 4 2 9 2.</_>
+        <_>
+          19 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 3 -1.</_>
+        <_>
+          3 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 4 18 -1.</_>
+        <_>
+          21 4 2 9 2.</_>
+        <_>
+          19 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 10 6 -1.</_>
+        <_>
+          7 17 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 11 9 -1.</_>
+        <_>
+          9 16 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 10 -1.</_>
+        <_>
+          0 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 9 6 -1.</_>
+        <_>
+          15 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 18 -1.</_>
+        <_>
+          1 5 2 9 2.</_>
+        <_>
+          3 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 10 -1.</_>
+        <_>
+          13 8 4 5 2.</_>
+        <_>
+          9 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 8 10 -1.</_>
+        <_>
+          7 8 4 5 2.</_>
+        <_>
+          11 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 12 5 -1.</_>
+        <_>
+          13 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 7 -1.</_>
+        <_>
+          10 8 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 12 5 -1.</_>
+        <_>
+          13 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 7 -1.</_>
+        <_>
+          10 6 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 12 5 -1.</_>
+        <_>
+          13 8 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 18 -1.</_>
+        <_>
+          10 11 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 12 -1.</_>
+        <_>
+          5 11 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 11 4 -1.</_>
+        <_>
+          0 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 10 -1.</_>
+        <_>
+          11 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 11 6 -1.</_>
+        <_>
+          2 19 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 9 6 -1.</_>
+        <_>
+          15 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 2 -1.</_>
+        <_>
+          1 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 13 -1.</_>
+        <_>
+          10 4 4 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 3 -1.</_>
+        <_>
+          0 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 18 3 -1.</_>
+        <_>
+          6 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 9 6 -1.</_>
+        <_>
+          0 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 9 6 -1.</_>
+        <_>
+          13 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 9 6 -1.</_>
+        <_>
+          2 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 16 -1.</_>
+        <_>
+          13 1 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 16 -1.</_>
+        <_>
+          8 1 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 6 10 -1.</_>
+        <_>
+          13 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 10 -1.</_>
+        <_>
+          9 5 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 24 -1.</_>
+        <_>
+          12 0 2 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 4 20 -1.</_>
+        <_>
+          3 4 2 10 2.</_>
+        <_>
+          5 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 18 5 -1.</_>
+        <_>
+          10 5 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 9 -1.</_>
+        <_>
+          7 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 15 8 -1.</_>
+        <_>
+          12 2 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 8 -1.</_>
+        <_>
+          7 2 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 9 -1.</_>
+        <_>
+          10 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 12 -1.</_>
+        <_>
+          3 4 3 6 2.</_>
+        <_>
+          6 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 18 -1.</_>
+        <_>
+          16 0 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 18 -1.</_>
+        <_>
+          4 0 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 6 -1.</_>
+        <_>
+          0 9 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 3 -1.</_>
+        <_>
+          11 7 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 15 -1.</_>
+        <_>
+          10 8 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 14 -1.</_>
+        <_>
+          12 0 5 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 8 10 -1.</_>
+        <_>
+          17 10 4 5 2.</_>
+        <_>
+          13 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 9 -1.</_>
+        <_>
+          5 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 6 8 -1.</_>
+        <_>
+          16 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 8 -1.</_>
+        <_>
+          5 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 12 -1.</_>
+        <_>
+          3 10 18 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 16 4 -1.</_>
+        <_>
+          4 14 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 15 -1.</_>
+        <_>
+          4 14 16 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 10 -1.</_>
+        <_>
+          3 10 4 5 2.</_>
+        <_>
+          7 15 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 16 6 -1.</_>
+        <_>
+          16 18 8 3 2.</_>
+        <_>
+          8 21 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 5 -1.</_>
+        <_>
+          6 16 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 9 4 -1.</_>
+        <_>
+          14 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 9 6 -1.</_>
+        <_>
+          7 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 12 -1.</_>
+        <_>
+          4 14 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 19 6 -1.</_>
+        <_>
+          0 15 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 9 6 -1.</_>
+        <_>
+          10 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 23 -1.</_>
+        <_>
+          6 0 1 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 24 6 -1.</_>
+        <_>
+          0 10 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 12 -1.</_>
+        <_>
+          0 9 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 19 18 -1.</_>
+        <_>
+          3 9 19 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 12 -1.</_>
+        <_>
+          9 11 3 6 2.</_>
+        <_>
+          12 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 24 8 -1.</_>
+        <_>
+          12 5 12 4 2.</_>
+        <_>
+          0 9 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 9 4 -1.</_>
+        <_>
+          6 20 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 10 6 -1.</_>
+        <_>
+          8 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 20 3 -1.</_>
+        <_>
+          2 8 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 7 20 -1.</_>
+        <_>
+          12 10 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 7 20 -1.</_>
+        <_>
+          5 10 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 18 -1.</_>
+        <_>
+          14 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 12 -1.</_>
+        <_>
+          10 8 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 8 -1.</_>
+        <_>
+          12 9 6 4 2.</_>
+        <_>
+          6 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 14 -1.</_>
+        <_>
+          7 14 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 12 16 -1.</_>
+        <_>
+          17 2 6 8 2.</_>
+        <_>
+          11 10 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 9 4 -1.</_>
+        <_>
+          13 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 22 4 -1.</_>
+        <_>
+          0 12 11 2 2.</_>
+        <_>
+          11 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 22 6 -1.</_>
+        <_>
+          12 12 11 3 2.</_>
+        <_>
+          1 15 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 6 -1.</_>
+        <_>
+          9 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 9 -1.</_>
+        <_>
+          10 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 18 7 -1.</_>
+        <_>
+          9 8 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 6 -1.</_>
+        <_>
+          0 8 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 24 10 -1.</_>
+        <_>
+          8 11 8 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 18 21 -1.</_>
+        <_>
+          9 3 6 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 10 -1.</_>
+        <_>
+          9 12 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 10 8 -1.</_>
+        <_>
+          15 16 5 4 2.</_>
+        <_>
+          10 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 6 12 -1.</_>
+        <_>
+          15 10 3 6 2.</_>
+        <_>
+          12 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 12 -1.</_>
+        <_>
+          6 10 3 6 2.</_>
+        <_>
+          9 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 6 12 -1.</_>
+        <_>
+          19 12 3 6 2.</_>
+        <_>
+          16 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 12 -1.</_>
+        <_>
+          2 12 3 6 2.</_>
+        <_>
+          5 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 9 -1.</_>
+        <_>
+          12 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 9 -1.</_>
+        <_>
+          10 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 20 10 4 -1.</_>
+        <_>
+          14 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 10 4 -1.</_>
+        <_>
+          5 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 9 6 -1.</_>
+        <_>
+          11 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 4 -1.</_>
+        <_>
+          3 4 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 10 4 -1.</_>
+        <_>
+          10 3 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 4 -1.</_>
+        <_>
+          5 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 3 19 -1.</_>
+        <_>
+          20 2 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 9 8 -1.</_>
+        <_>
+          7 12 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 12 -1.</_>
+        <_>
+          4 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 3 -1.</_>
+        <_>
+          8 1 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 4 -1.</_>
+        <_>
+          6 10 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 4 10 -1.</_>
+        <_>
+          19 3 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 9 6 -1.</_>
+        <_>
+          3 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 22 -1.</_>
+        <_>
+          20 0 2 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 22 -1.</_>
+        <_>
+          2 0 2 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 19 3 -1.</_>
+        <_>
+          5 16 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 15 -1.</_>
+        <_>
+          10 12 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 18 3 -1.</_>
+        <_>
+          0 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 10 15 -1.</_>
+        <_>
+          7 8 10 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 3 -1.</_>
+        <_>
+          1 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 9 6 -1.</_>
+        <_>
+          11 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 24 14 -1.</_>
+        <_>
+          0 17 24 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 8 10 -1.</_>
+        <_>
+          17 9 4 5 2.</_>
+        <_>
+          13 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 9 -1.</_>
+        <_>
+          12 5 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 8 10 -1.</_>
+        <_>
+          17 9 4 5 2.</_>
+        <_>
+          13 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 10 10 -1.</_>
+        <_>
+          7 11 5 5 2.</_>
+        <_>
+          12 16 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 18 4 -1.</_>
+        <_>
+          13 13 9 2 2.</_>
+        <_>
+          4 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 2 -1.</_>
+        <_>
+          0 1 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 24 6 -1.</_>
+        <_>
+          8 18 8 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 16 -1.</_>
+        <_>
+          6 12 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 9 -1.</_>
+        <_>
+          0 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 7 9 -1.</_>
+        <_>
+          13 18 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 12 6 -1.</_>
+        <_>
+          3 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 6 9 -1.</_>
+        <_>
+          12 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 15 8 -1.</_>
+        <_>
+          2 19 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 16 -1.</_>
+        <_>
+          9 14 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 12 -1.</_>
+        <_>
+          6 10 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 9 -1.</_>
+        <_>
+          14 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 9 -1.</_>
+        <_>
+          5 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 9 -1.</_>
+        <_>
+          12 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 18 -1.</_>
+        <_>
+          6 6 2 9 2.</_>
+        <_>
+          8 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 12 -1.</_>
+        <_>
+          17 9 3 6 2.</_>
+        <_>
+          14 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 12 -1.</_>
+        <_>
+          4 9 3 6 2.</_>
+        <_>
+          7 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 9 6 -1.</_>
+        <_>
+          14 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 18 4 -1.</_>
+        <_>
+          0 20 9 2 2.</_>
+        <_>
+          9 22 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 9 6 -1.</_>
+        <_>
+          13 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 9 6 -1.</_>
+        <_>
+          2 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 4 22 -1.</_>
+        <_>
+          21 2 2 11 2.</_>
+        <_>
+          19 13 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 4 22 -1.</_>
+        <_>
+          1 2 2 11 2.</_>
+        <_>
+          3 13 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 24 -1.</_>
+        <_>
+          15 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 16 4 -1.</_>
+        <_>
+          11 20 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 18 -1.</_>
+        <_>
+          13 6 2 9 2.</_>
+        <_>
+          11 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 14 -1.</_>
+        <_>
+          7 9 5 7 2.</_>
+        <_>
+          12 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 9 -1.</_>
+        <_>
+          14 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 7 9 -1.</_>
+        <_>
+          3 9 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 4 20 -1.</_>
+        <_>
+          22 4 2 10 2.</_>
+        <_>
+          20 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 9 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 14 -1.</_>
+        <_>
+          12 0 5 7 2.</_>
+        <_>
+          7 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 6 -1.</_>
+        <_>
+          11 1 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 24 -1.</_>
+        <_>
+          15 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 24 -1.</_>
+        <_>
+          8 0 1 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 7 -1.</_>
+        <_>
+          13 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 7 -1.</_>
+        <_>
+          8 12 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 19 -1.</_>
+        <_>
+          9 5 6 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 6 -1.</_>
+        <_>
+          8 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 6 -1.</_>
+        <_>
+          12 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 10 8 -1.</_>
+        <_>
+          3 16 5 4 2.</_>
+        <_>
+          8 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 8 5 15 -1.</_>
+        <_>
+          19 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 15 -1.</_>
+        <_>
+          0 13 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 4 20 -1.</_>
+        <_>
+          22 4 2 10 2.</_>
+        <_>
+          20 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 20 -1.</_>
+        <_>
+          0 4 2 10 2.</_>
+        <_>
+          2 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 4 -1.</_>
+        <_>
+          7 7 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 14 4 -1.</_>
+        <_>
+          11 19 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 12 3 -1.</_>
+        <_>
+          10 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 3 -1.</_>
+        <_>
+          0 2 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 14 20 -1.</_>
+        <_>
+          14 2 7 10 2.</_>
+        <_>
+          7 12 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 9 -1.</_>
+        <_>
+          2 13 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 19 -1.</_>
+        <_>
+          13 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 14 3 -1.</_>
+        <_>
+          8 11 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 16 20 -1.</_>
+        <_>
+          15 1 8 10 2.</_>
+        <_>
+          7 11 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 21 9 -1.</_>
+        <_>
+          7 10 7 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 15 5 -1.</_>
+        <_>
+          11 19 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 6 -1.</_>
+        <_>
+          11 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 16 20 -1.</_>
+        <_>
+          15 1 8 10 2.</_>
+        <_>
+          7 11 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 20 -1.</_>
+        <_>
+          1 1 8 10 2.</_>
+        <_>
+          9 11 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 12 -1.</_>
+        <_>
+          16 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 12 -1.</_>
+        <_>
+          5 10 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 8 -1.</_>
+        <_>
+          12 6 5 4 2.</_>
+        <_>
+          7 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          4 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 4 -1.</_>
+        <_>
+          6 7 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 5 15 -1.</_>
+        <_>
+          9 7 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 9 6 -1.</_>
+        <_>
+          15 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 11 10 -1.</_>
+        <_>
+          6 5 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 12 -1.</_>
+        <_>
+          12 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 9 4 -1.</_>
+        <_>
+          7 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 6 -1.</_>
+        <_>
+          6 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          10 6 2 9 2.</_>
+        <_>
+          12 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 9 -1.</_>
+        <_>
+          12 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 10 6 -1.</_>
+        <_>
+          3 20 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 20 3 -1.</_>
+        <_>
+          4 15 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 9 6 -1.</_>
+        <_>
+          2 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 19 -1.</_>
+        <_>
+          13 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 19 -1.</_>
+        <_>
+          9 0 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 22 2 -1.</_>
+        <_>
+          1 5 22 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 6 -1.</_>
+        <_>
+          0 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 24 18 -1.</_>
+        <_>
+          0 9 24 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 16 8 -1.</_>
+        <_>
+          3 6 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 6 -1.</_>
+        <_>
+          3 8 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 10 -1.</_>
+        <_>
+          5 1 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 9 6 -1.</_>
+        <_>
+          16 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 6 -1.</_>
+        <_>
+          5 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 10 -1.</_>
+        <_>
+          6 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 20 4 -1.</_>
+        <_>
+          12 2 10 2 2.</_>
+        <_>
+          2 4 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 19 3 -1.</_>
+        <_>
+          2 12 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 9 -1.</_>
+        <_>
+          12 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 9 -1.</_>
+        <_>
+          10 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 9 -1.</_>
+        <_>
+          13 8 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 9 9 -1.</_>
+        <_>
+          6 11 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 5 -1.</_>
+        <_>
+          9 9 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 2 20 -1.</_>
+        <_>
+          2 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 8 6 -1.</_>
+        <_>
+          14 20 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 2 -1.</_>
+        <_>
+          3 22 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 15 6 -1.</_>
+        <_>
+          10 4 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 6 -1.</_>
+        <_>
+          2 17 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 6 9 -1.</_>
+        <_>
+          17 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 20 4 -1.</_>
+        <_>
+          2 12 10 2 2.</_>
+        <_>
+          12 14 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 24 6 -1.</_>
+        <_>
+          0 19 24 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 9 4 -1.</_>
+        <_>
+          7 18 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 22 -1.</_>
+        <_>
+          17 1 2 11 2.</_>
+        <_>
+          15 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 22 -1.</_>
+        <_>
+          5 1 2 11 2.</_>
+        <_>
+          7 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 8 9 -1.</_>
+        <_>
+          11 16 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 9 -1.</_>
+        <_>
+          8 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 18 -1.</_>
+        <_>
+          11 10 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 6 -1.</_>
+        <_>
+          5 8 6 3 2.</_>
+        <_>
+          11 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 5 8 -1.</_>
+        <_>
+          15 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 8 -1.</_>
+        <_>
+          4 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 12 -1.</_>
+        <_>
+          15 6 3 6 2.</_>
+        <_>
+          12 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          6 6 3 6 2.</_>
+        <_>
+          9 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 8 -1.</_>
+        <_>
+          12 9 7 4 2.</_>
+        <_>
+          5 13 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 14 -1.</_>
+        <_>
+          9 8 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 12 -1.</_>
+        <_>
+          12 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 18 -1.</_>
+        <_>
+          4 5 2 9 2.</_>
+        <_>
+          6 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 18 -1.</_>
+        <_>
+          4 12 16 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 7 20 -1.</_>
+        <_>
+          5 14 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 8 12 -1.</_>
+        <_>
+          14 14 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 14 -1.</_>
+        <_>
+          9 10 3 7 2.</_>
+        <_>
+          12 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 6 -1.</_>
+        <_>
+          12 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 18 -1.</_>
+        <_>
+          10 4 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 22 14 -1.</_>
+        <_>
+          12 4 11 7 2.</_>
+        <_>
+          1 11 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 2 -1.</_>
+        <_>
+          2 8 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 12 -1.</_>
+        <_>
+          12 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 7 -1.</_>
+        <_>
+          9 5 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 12 -1.</_>
+        <_>
+          12 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 12 -1.</_>
+        <_>
+          8 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 10 22 -1.</_>
+        <_>
+          7 13 10 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 3 20 -1.</_>
+        <_>
+          1 1 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 18 4 -1.</_>
+        <_>
+          13 13 9 2 2.</_>
+        <_>
+          4 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 4 -1.</_>
+        <_>
+          2 13 9 2 2.</_>
+        <_>
+          11 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 6 -1.</_>
+        <_>
+          15 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 6 -1.</_>
+        <_>
+          0 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 24 -1.</_>
+        <_>
+          15 0 9 12 2.</_>
+        <_>
+          6 12 9 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          6 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 4 -1.</_>
+        <_>
+          8 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 6 -1.</_>
+        <_>
+          1 9 9 3 2.</_>
+        <_>
+          10 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 18 3 -1.</_>
+        <_>
+          6 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 8 -1.</_>
+        <_>
+          10 7 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 6 12 -1.</_>
+        <_>
+          12 12 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 18 3 -1.</_>
+        <_>
+          3 15 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 7 -1.</_>
+        <_>
+          18 17 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 10 6 -1.</_>
+        <_>
+          1 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 7 -1.</_>
+        <_>
+          18 17 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 3 19 -1.</_>
+        <_>
+          11 3 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 7 -1.</_>
+        <_>
+          18 17 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 11 9 -1.</_>
+        <_>
+          6 4 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 7 -1.</_>
+        <_>
+          18 17 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 11 6 -1.</_>
+        <_>
+          6 8 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 8 5 -1.</_>
+        <_>
+          16 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 20 19 -1.</_>
+        <_>
+          12 4 10 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 21 6 -1.</_>
+        <_>
+          9 1 7 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 14 -1.</_>
+        <_>
+          6 5 6 7 2.</_>
+        <_>
+          12 12 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 8 5 -1.</_>
+        <_>
+          6 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 8 5 -1.</_>
+        <_>
+          16 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 5 -1.</_>
+        <_>
+          4 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 7 -1.</_>
+        <_>
+          18 17 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 10 -1.</_>
+        <_>
+          8 6 4 5 2.</_>
+        <_>
+          12 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 9 9 -1.</_>
+        <_>
+          18 15 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 9 -1.</_>
+        <_>
+          3 15 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 9 7 -1.</_>
+        <_>
+          15 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 7 -1.</_>
+        <_>
+          6 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 10 8 -1.</_>
+        <_>
+          18 15 5 4 2.</_>
+        <_>
+          13 19 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 12 -1.</_>
+        <_>
+          0 1 3 6 2.</_>
+        <_>
+          3 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 12 -1.</_>
+        <_>
+          13 0 3 6 2.</_>
+        <_>
+          10 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 12 -1.</_>
+        <_>
+          7 0 5 6 2.</_>
+        <_>
+          12 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 8 -1.</_>
+        <_>
+          4 1 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 19 3 -1.</_>
+        <_>
+          0 22 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 18 4 -1.</_>
+        <_>
+          15 9 9 2 2.</_>
+        <_>
+          6 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 9 6 -1.</_>
+        <_>
+          3 6 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 15 -1.</_>
+        <_>
+          9 6 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 6 -1.</_>
+        <_>
+          8 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 9 -1.</_>
+        <_>
+          5 4 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 20 -1.</_>
+        <_>
+          3 0 4 10 2.</_>
+        <_>
+          7 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 7 9 -1.</_>
+        <_>
+          5 3 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 5 -1.</_>
+        <_>
+          10 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 14 -1.</_>
+        <_>
+          4 1 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 22 4 -1.</_>
+        <_>
+          2 14 22 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 6 6 -1.</_>
+        <_>
+          8 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 7 -1.</_>
+        <_>
+          18 1 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 17 18 -1.</_>
+        <_>
+          4 12 17 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 6 -1.</_>
+        <_>
+          6 0 6 3 2.</_>
+        <_>
+          12 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 18 4 -1.</_>
+        <_>
+          13 7 9 2 2.</_>
+        <_>
+          4 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 6 -1.</_>
+        <_>
+          4 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 10 12 -1.</_>
+        <_>
+          12 9 5 6 2.</_>
+        <_>
+          7 15 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 3 -1.</_>
+        <_>
+          8 1 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          13 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 6 -1.</_>
+        <_>
+          8 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 19 3 -1.</_>
+        <_>
+          3 11 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          0 5 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 16 10 6 -1.</_>
+        <_>
+          14 18 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 10 6 -1.</_>
+        <_>
+          0 18 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 9 6 -1.</_>
+        <_>
+          14 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 9 6 -1.</_>
+        <_>
+          0 20 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 9 6 -1.</_>
+        <_>
+          14 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 9 -1.</_>
+        <_>
+          8 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 12 -1.</_>
+        <_>
+          15 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 8 8 -1.</_>
+        <_>
+          8 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 18 3 -1.</_>
+        <_>
+          10 20 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 12 -1.</_>
+        <_>
+          7 8 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 12 3 -1.</_>
+        <_>
+          7 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          12 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 18 3 -1.</_>
+        <_>
+          11 20 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 18 3 -1.</_>
+        <_>
+          7 20 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 6 20 -1.</_>
+        <_>
+          21 1 3 10 2.</_>
+        <_>
+          18 11 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 20 -1.</_>
+        <_>
+          0 1 3 10 2.</_>
+        <_>
+          3 11 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 4 18 -1.</_>
+        <_>
+          15 3 2 9 2.</_>
+        <_>
+          13 12 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 12 -1.</_>
+        <_>
+          0 6 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 12 6 -1.</_>
+        <_>
+          18 9 6 3 2.</_>
+        <_>
+          12 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 18 -1.</_>
+        <_>
+          7 3 2 9 2.</_>
+        <_>
+          9 12 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 9 -1.</_>
+        <_>
+          16 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 6 -1.</_>
+        <_>
+          0 9 6 3 2.</_>
+        <_>
+          6 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 8 20 -1.</_>
+        <_>
+          18 4 4 10 2.</_>
+        <_>
+          14 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 8 20 -1.</_>
+        <_>
+          2 4 4 10 2.</_>
+        <_>
+          6 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 9 6 -1.</_>
+        <_>
+          14 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 9 6 -1.</_>
+        <_>
+          1 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 18 3 -1.</_>
+        <_>
+          9 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 9 6 -1.</_>
+        <_>
+          5 15 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 18 3 -1.</_>
+        <_>
+          5 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 7 -1.</_>
+        <_>
+          11 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 6 -1.</_>
+        <_>
+          12 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 9 6 -1.</_>
+        <_>
+          9 1 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 14 6 -1.</_>
+        <_>
+          12 6 7 3 2.</_>
+        <_>
+          5 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 13 -1.</_>
+        <_>
+          10 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 6 -1.</_>
+        <_>
+          12 11 6 3 2.</_>
+        <_>
+          6 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 15 -1.</_>
+        <_>
+          9 1 6 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 7 -1.</_>
+        <_>
+          13 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 6 -1.</_>
+        <_>
+          3 6 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 9 -1.</_>
+        <_>
+          9 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 24 -1.</_>
+        <_>
+          13 0 2 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 24 -1.</_>
+        <_>
+          9 0 2 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 5 12 -1.</_>
+        <_>
+          11 13 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 9 6 -1.</_>
+        <_>
+          7 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 18 6 -1.</_>
+        <_>
+          5 9 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 5 12 -1.</_>
+        <_>
+          8 13 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 17 6 -1.</_>
+        <_>
+          4 19 17 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 14 -1.</_>
+        <_>
+          0 3 9 7 2.</_>
+        <_>
+          9 10 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 24 2 -1.</_>
+        <_>
+          0 2 24 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 3 -1.</_>
+        <_>
+          0 16 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 14 12 -1.</_>
+        <_>
+          3 9 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          10 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 10 -1.</_>
+        <_>
+          12 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 9 -1.</_>
+        <_>
+          7 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 21 7 -1.</_>
+        <_>
+          9 0 7 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 5 -1.</_>
+        <_>
+          10 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 8 -1.</_>
+        <_>
+          11 7 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 18 -1.</_>
+        <_>
+          9 6 3 9 2.</_>
+        <_>
+          12 15 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 8 10 -1.</_>
+        <_>
+          19 14 4 5 2.</_>
+        <_>
+          15 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 10 -1.</_>
+        <_>
+          1 14 4 5 2.</_>
+        <_>
+          5 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 10 -1.</_>
+        <_>
+          15 0 4 5 2.</_>
+        <_>
+          11 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 10 -1.</_>
+        <_>
+          5 0 4 5 2.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 5 -1.</_>
+        <_>
+          6 1 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 18 2 -1.</_>
+        <_>
+          10 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 20 6 -1.</_>
+        <_>
+          12 8 10 3 2.</_>
+        <_>
+          2 11 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 7 -1.</_>
+        <_>
+          10 6 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 16 -1.</_>
+        <_>
+          14 5 4 8 2.</_>
+        <_>
+          10 13 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 16 8 -1.</_>
+        <_>
+          3 9 8 4 2.</_>
+        <_>
+          11 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 10 4 -1.</_>
+        <_>
+          7 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 10 8 -1.</_>
+        <_>
+          7 12 5 4 2.</_>
+        <_>
+          12 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 15 4 -1.</_>
+        <_>
+          14 19 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 9 -1.</_>
+        <_>
+          7 0 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 10 8 -1.</_>
+        <_>
+          18 4 5 4 2.</_>
+        <_>
+          13 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 18 4 -1.</_>
+        <_>
+          9 16 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 10 12 -1.</_>
+        <_>
+          13 7 5 6 2.</_>
+        <_>
+          8 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 10 12 -1.</_>
+        <_>
+          6 7 5 6 2.</_>
+        <_>
+          11 13 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 18 7 -1.</_>
+        <_>
+          10 6 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 18 3 -1.</_>
+        <_>
+          0 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 18 3 -1.</_>
+        <_>
+          3 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 10 -1.</_>
+        <_>
+          4 4 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 24 -1.</_>
+        <_>
+          16 0 4 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 15 -1.</_>
+        <_>
+          8 0 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 8 24 -1.</_>
+        <_>
+          16 0 4 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 9 -1.</_>
+        <_>
+          7 4 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 9 6 -1.</_>
+        <_>
+          15 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 6 -1.</_>
+        <_>
+          3 9 9 3 2.</_>
+        <_>
+          12 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 9 -1.</_>
+        <_>
+          18 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 9 -1.</_>
+        <_>
+          0 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 18 4 -1.</_>
+        <_>
+          13 7 9 2 2.</_>
+        <_>
+          4 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 12 20 -1.</_>
+        <_>
+          2 1 6 10 2.</_>
+        <_>
+          8 11 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 23 -1.</_>
+        <_>
+          17 0 3 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 18 -1.</_>
+        <_>
+          1 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 10 6 -1.</_>
+        <_>
+          8 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 6 -1.</_>
+        <_>
+          0 6 10 3 2.</_>
+        <_>
+          10 9 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 12 5 -1.</_>
+        <_>
+          15 12 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 3 19 -1.</_>
+        <_>
+          1 4 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 3 18 -1.</_>
+        <_>
+          20 1 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 3 18 -1.</_>
+        <_>
+          3 1 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 18 3 -1.</_>
+        <_>
+          9 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 9 -1.</_>
+        <_>
+          9 4 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 14 7 -1.</_>
+        <_>
+          7 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 14 7 -1.</_>
+        <_>
+          10 13 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 9 6 -1.</_>
+        <_>
+          11 15 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 8 10 -1.</_>
+        <_>
+          4 14 4 5 2.</_>
+        <_>
+          8 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 10 -1.</_>
+        <_>
+          10 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 16 -1.</_>
+        <_>
+          3 16 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 9 6 -1.</_>
+        <_>
+          15 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 9 6 -1.</_>
+        <_>
+          0 12 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 9 -1.</_>
+        <_>
+          6 10 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 5 8 -1.</_>
+        <_>
+          9 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 6 9 -1.</_>
+        <_>
+          10 15 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 7 6 -1.</_>
+        <_>
+          16 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 22 -1.</_>
+        <_>
+          10 1 2 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 3 -1.</_>
+        <_>
+          6 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 19 3 -1.</_>
+        <_>
+          0 19 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 6 24 -1.</_>
+        <_>
+          17 0 3 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 6 -1.</_>
+        <_>
+          5 13 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 10 14 -1.</_>
+        <_>
+          14 6 5 7 2.</_>
+        <_>
+          9 13 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 8 10 -1.</_>
+        <_>
+          1 6 4 5 2.</_>
+        <_>
+          5 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 5 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 6 -1.</_>
+        <_>
+          10 7 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 14 14 -1.</_>
+        <_>
+          14 8 7 7 2.</_>
+        <_>
+          7 15 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 14 14 -1.</_>
+        <_>
+          3 8 7 7 2.</_>
+        <_>
+          10 15 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 13 4 -1.</_>
+        <_>
+          9 10 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 12 -1.</_>
+        <_>
+          3 2 3 6 2.</_>
+        <_>
+          6 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 17 6 -1.</_>
+        <_>
+          6 13 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 17 6 -1.</_>
+        <_>
+          1 13 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 8 9 -1.</_>
+        <_>
+          16 10 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 9 -1.</_>
+        <_>
+          0 10 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 24 10 -1.</_>
+        <_>
+          12 9 12 5 2.</_>
+        <_>
+          0 14 12 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 15 8 -1.</_>
+        <_>
+          8 2 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 18 8 -1.</_>
+        <_>
+          10 2 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 4 -1.</_>
+        <_>
+          0 1 9 2 2.</_>
+        <_>
+          9 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 2 3 18 -1.</_>
+        <_>
+          21 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 3 19 -1.</_>
+        <_>
+          2 3 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 6 16 -1.</_>
+        <_>
+          20 8 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 16 -1.</_>
+        <_>
+          2 8 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 11 6 -1.</_>
+        <_>
+          8 20 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 5 -1.</_>
+        <_>
+          8 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 5 -1.</_>
+        <_>
+          11 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 6 -1.</_>
+        <_>
+          9 3 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 12 5 -1.</_>
+        <_>
+          7 6 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 7 -1.</_>
+        <_>
+          12 8 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 9 6 -1.</_>
+        <_>
+          11 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 9 -1.</_>
+        <_>
+          8 17 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 9 6 -1.</_>
+        <_>
+          11 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 20 -1.</_>
+        <_>
+          4 3 8 10 2.</_>
+        <_>
+          12 13 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 10 12 -1.</_>
+        <_>
+          12 6 5 6 2.</_>
+        <_>
+          7 12 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 12 -1.</_>
+        <_>
+          0 6 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 11 6 -1.</_>
+        <_>
+          12 19 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 8 -1.</_>
+        <_>
+          4 7 6 4 2.</_>
+        <_>
+          10 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 8 10 -1.</_>
+        <_>
+          12 11 4 5 2.</_>
+        <_>
+          8 16 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 9 -1.</_>
+        <_>
+          11 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 22 -1.</_>
+        <_>
+          15 0 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 22 -1.</_>
+        <_>
+          8 0 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 18 4 -1.</_>
+        <_>
+          13 7 9 2 2.</_>
+        <_>
+          4 9 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 15 -1.</_>
+        <_>
+          10 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 13 -1.</_>
+        <_>
+          9 0 9 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 24 -1.</_>
+        <_>
+          17 0 1 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 24 -1.</_>
+        <_>
+          6 0 1 24 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 5 8 -1.</_>
+        <_>
+          10 19 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 18 2 -1.</_>
+        <_>
+          2 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 20 3 -1.</_>
+        <_>
+          2 9 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 6 -1.</_>
+        <_>
+          7 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 19 10 -1.</_>
+        <_>
+          3 7 19 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 19 3 -1.</_>
+        <_>
+          2 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 9 4 -1.</_>
+        <_>
+          15 8 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 8 -1.</_>
+        <_>
+          8 2 6 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 14 4 -1.</_>
+        <_>
+          10 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 16 -1.</_>
+        <_>
+          7 4 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 9 16 -1.</_>
+        <_>
+          18 8 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 9 16 -1.</_>
+        <_>
+          3 8 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 6 14 -1.</_>
+        <_>
+          20 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 14 -1.</_>
+        <_>
+          2 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 22 -1.</_>
+        <_>
+          17 0 2 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 22 -1.</_>
+        <_>
+          5 0 2 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 12 20 -1.</_>
+        <_>
+          16 2 4 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 20 -1.</_>
+        <_>
+          4 2 4 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 9 -1.</_>
+        <_>
+          11 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 16 -1.</_>
+        <_>
+          12 0 3 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 18 6 -1.</_>
+        <_>
+          3 4 9 3 2.</_>
+        <_>
+          12 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 16 8 -1.</_>
+        <_>
+          13 5 8 4 2.</_>
+        <_>
+          5 9 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 6 -1.</_>
+        <_>
+          0 15 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 9 6 -1.</_>
+        <_>
+          8 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 6 -1.</_>
+        <_>
+          9 2 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 10 8 -1.</_>
+        <_>
+          19 1 5 4 2.</_>
+        <_>
+          14 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 12 -1.</_>
+        <_>
+          9 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 9 -1.</_>
+        <_>
+          6 7 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 6 -1.</_>
+        <_>
+          10 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 5 -1.</_>
+        <_>
+          5 1 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 8 -1.</_>
+        <_>
+          12 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 12 6 -1.</_>
+        <_>
+          3 14 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 12 6 -1.</_>
+        <_>
+          15 18 6 3 2.</_>
+        <_>
+          9 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 6 -1.</_>
+        <_>
+          4 16 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 7 18 -1.</_>
+        <_>
+          11 12 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 18 3 -1.</_>
+        <_>
+          9 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 19 2 -1.</_>
+        <_>
+          5 4 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          4 2 6 3 2.</_>
+        <_>
+          10 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 9 -1.</_>
+        <_>
+          11 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 9 -1.</_>
+        <_>
+          10 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 5 15 -1.</_>
+        <_>
+          16 14 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 5 15 -1.</_>
+        <_>
+          3 14 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 6 -1.</_>
+        <_>
+          13 6 7 3 2.</_>
+        <_>
+          6 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          8 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 24 5 -1.</_>
+        <_>
+          8 16 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 20 3 -1.</_>
+        <_>
+          10 20 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 18 2 -1.</_>
+        <_>
+          5 11 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 10 -1.</_>
+        <_>
+          2 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 20 3 -1.</_>
+        <_>
+          2 2 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 11 -1.</_>
+        <_>
+          11 13 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 8 -1.</_>
+        <_>
+          9 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 9 -1.</_>
+        <_>
+          9 15 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 18 2 -1.</_>
+        <_>
+          5 12 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 15 6 -1.</_>
+        <_>
+          2 8 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 18 3 -1.</_>
+        <_>
+          6 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 18 -1.</_>
+        <_>
+          6 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 6 10 -1.</_>
+        <_>
+          20 3 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 10 -1.</_>
+        <_>
+          2 3 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 9 -1.</_>
+        <_>
+          10 5 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 9 -1.</_>
+        <_>
+          10 5 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 20 3 -1.</_>
+        <_>
+          3 3 20 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 13 4 -1.</_>
+        <_>
+          5 4 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 7 14 -1.</_>
+        <_>
+          17 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 14 -1.</_>
+        <_>
+          0 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 10 6 -1.</_>
+        <_>
+          9 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 6 -1.</_>
+        <_>
+          10 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 18 -1.</_>
+        <_>
+          11 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 18 3 -1.</_>
+        <_>
+          6 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 10 -1.</_>
+        <_>
+          4 11 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 15 4 -1.</_>
+        <_>
+          9 9 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 6 -1.</_>
+        <_>
+          5 6 6 3 2.</_>
+        <_>
+          11 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 9 -1.</_>
+        <_>
+          6 4 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 12 -1.</_>
+        <_>
+          7 9 3 6 2.</_>
+        <_>
+          10 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 13 6 -1.</_>
+        <_>
+          11 7 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 22 13 -1.</_>
+        <_>
+          12 11 11 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 6 6 -1.</_>
+        <_>
+          18 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 6 -1.</_>
+        <_>
+          0 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 3 -1.</_>
+        <_>
+          0 7 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 10 6 -1.</_>
+        <_>
+          0 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 18 3 -1.</_>
+        <_>
+          6 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 2 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 3 19 -1.</_>
+        <_>
+          20 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 16 -1.</_>
+        <_>
+          4 6 6 8 2.</_>
+        <_>
+          10 14 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 4 18 -1.</_>
+        <_>
+          21 6 2 9 2.</_>
+        <_>
+          19 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 18 -1.</_>
+        <_>
+          1 6 2 9 2.</_>
+        <_>
+          3 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 18 3 -1.</_>
+        <_>
+          3 22 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 9 4 -1.</_>
+        <_>
+          0 21 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 12 6 -1.</_>
+        <_>
+          18 18 6 3 2.</_>
+        <_>
+          12 21 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 9 4 -1.</_>
+        <_>
+          7 20 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 10 8 -1.</_>
+        <_>
+          17 16 5 4 2.</_>
+        <_>
+          12 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 10 8 -1.</_>
+        <_>
+          2 16 5 4 2.</_>
+        <_>
+          7 20 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 10 12 -1.</_>
+        <_>
+          19 0 5 6 2.</_>
+        <_>
+          14 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 12 -1.</_>
+        <_>
+          0 0 5 6 2.</_>
+        <_>
+          5 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 9 6 -1.</_>
+        <_>
+          15 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 9 6 -1.</_>
+        <_>
+          0 16 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 10 6 -1.</_>
+        <_>
+          14 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 10 6 -1.</_>
+        <_>
+          0 16 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 18 2 -1.</_>
+        <_>
+          5 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 3 -1.</_>
+        <_>
+          0 19 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 18 12 -1.</_>
+        <_>
+          12 5 9 6 2.</_>
+        <_>
+          3 11 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 7 9 -1.</_>
+        <_>
+          5 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 19 15 -1.</_>
+        <_>
+          4 5 19 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 4 -1.</_>
+        <_>
+          3 2 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 16 12 -1.</_>
+        <_>
+          4 12 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 15 -1.</_>
+        <_>
+          10 3 6 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 2 19 -1.</_>
+        <_>
+          16 4 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 19 -1.</_>
+        <_>
+          7 4 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 8 10 -1.</_>
+        <_>
+          17 14 4 5 2.</_>
+        <_>
+          13 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 8 10 -1.</_>
+        <_>
+          3 14 4 5 2.</_>
+        <_>
+          7 19 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 18 -1.</_>
+        <_>
+          12 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 6 -1.</_>
+        <_>
+          5 11 6 3 2.</_>
+        <_>
+          11 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 10 -1.</_>
+        <_>
+          14 5 4 5 2.</_>
+        <_>
+          10 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 10 -1.</_>
+        <_>
+          6 4 6 5 2.</_>
+        <_>
+          12 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 18 10 -1.</_>
+        <_>
+          15 8 9 5 2.</_>
+        <_>
+          6 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 10 -1.</_>
+        <_>
+          0 8 9 5 2.</_>
+        <_>
+          9 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 18 -1.</_>
+        <_>
+          12 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 3 -1.</_>
+        <_>
+          0 15 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 18 -1.</_>
+        <_>
+          12 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 18 -1.</_>
+        <_>
+          9 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 18 3 -1.</_>
+        <_>
+          6 15 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 3 -1.</_>
+        <_>
+          0 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 22 3 -1.</_>
+        <_>
+          2 6 22 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 21 10 -1.</_>
+        <_>
+          7 0 7 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 18 17 -1.</_>
+        <_>
+          12 3 6 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 17 -1.</_>
+        <_>
+          6 3 6 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 24 11 -1.</_>
+        <_>
+          8 12 8 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 16 6 -1.</_>
+        <_>
+          4 13 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 8 -1.</_>
+        <_>
+          12 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 7 -1.</_>
+        <_>
+          10 14 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 6 14 -1.</_>
+        <_>
+          18 10 3 7 2.</_>
+        <_>
+          15 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 14 -1.</_>
+        <_>
+          3 10 3 7 2.</_>
+        <_>
+          6 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 18 2 -1.</_>
+        <_>
+          6 13 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 6 -1.</_>
+        <_>
+          5 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 9 4 -1.</_>
+        <_>
+          12 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 9 6 -1.</_>
+        <_>
+          0 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 18 -1.</_>
+        <_>
+          12 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 3 18 -1.</_>
+        <_>
+          11 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 10 -1.</_>
+        <_>
+          11 12 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 9 -1.</_>
+        <_>
+          1 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 16 6 -1.</_>
+        <_>
+          14 9 8 3 2.</_>
+        <_>
+          6 12 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 9 6 -1.</_>
+        <_>
+          1 10 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 16 6 -1.</_>
+        <_>
+          7 9 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 3 -1.</_>
+        <_>
+          0 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 9 -1.</_>
+        <_>
+          12 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          12 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          12 6 2 9 2.</_>
+        <_>
+          10 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          10 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 9 -1.</_>
+        <_>
+          9 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 9 -1.</_>
+        <_>
+          1 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 24 3 -1.</_>
+        <_>
+          0 4 24 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 4 -1.</_>
+        <_>
+          6 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 8 10 -1.</_>
+        <_>
+          12 9 4 5 2.</_>
+        <_>
+          8 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 13 9 -1.</_>
+        <_>
+          5 5 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 16 9 -1.</_>
+        <_>
+          4 7 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 9 -1.</_>
+        <_>
+          4 7 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 6 -1.</_>
+        <_>
+          8 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 6 -1.</_>
+        <_>
+          1 9 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 13 9 -1.</_>
+        <_>
+          10 8 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 13 9 -1.</_>
+        <_>
+          1 8 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 24 6 -1.</_>
+        <_>
+          12 4 12 3 2.</_>
+        <_>
+          0 7 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 10 9 -1.</_>
+        <_>
+          1 17 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 18 3 -1.</_>
+        <_>
+          5 18 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 3 -1.</_>
+        <_>
+          0 17 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          9 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 22 4 -1.</_>
+        <_>
+          1 20 11 2 2.</_>
+        <_>
+          12 22 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 8 6 -1.</_>
+        <_>
+          8 17 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 15 -1.</_>
+        <_>
+          8 11 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 18 3 -1.</_>
+        <_>
+          5 5 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 10 -1.</_>
+        <_>
+          9 8 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 12 3 -1.</_>
+        <_>
+          6 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 6 -1.</_>
+        <_>
+          2 6 9 3 2.</_>
+        <_>
+          11 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 18 -1.</_>
+        <_>
+          12 6 2 9 2.</_>
+        <_>
+          10 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          10 5 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 2 18 -1.</_>
+        <_>
+          14 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 18 -1.</_>
+        <_>
+          8 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 10 6 -1.</_>
+        <_>
+          9 2 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 12 -1.</_>
+        <_>
+          12 1 9 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 17 22 -1.</_>
+        <_>
+          5 13 17 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 16 6 -1.</_>
+        <_>
+          14 9 8 3 2.</_>
+        <_>
+          6 12 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 18 -1.</_>
+        <_>
+          9 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 9 -1.</_>
+        <_>
+          14 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 9 -1.</_>
+        <_>
+          8 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 12 -1.</_>
+        <_>
+          11 1 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 4 -1.</_>
+        <_>
+          5 11 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 19 3 -1.</_>
+        <_>
+          5 9 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 8 -1.</_>
+        <_>
+          9 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 15 -1.</_>
+        <_>
+          11 14 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 14 -1.</_>
+        <_>
+          2 0 3 7 2.</_>
+        <_>
+          5 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 6 14 -1.</_>
+        <_>
+          18 1 3 7 2.</_>
+        <_>
+          15 8 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 14 -1.</_>
+        <_>
+          3 1 3 7 2.</_>
+        <_>
+          6 8 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 18 4 -1.</_>
+        <_>
+          12 20 9 2 2.</_>
+        <_>
+          3 22 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 20 -1.</_>
+        <_>
+          5 0 2 10 2.</_>
+        <_>
+          7 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 8 12 -1.</_>
+        <_>
+          20 8 4 6 2.</_>
+        <_>
+          16 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 12 -1.</_>
+        <_>
+          0 8 4 6 2.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 10 8 -1.</_>
+        <_>
+          18 13 5 4 2.</_>
+        <_>
+          13 17 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 10 8 -1.</_>
+        <_>
+          1 13 5 4 2.</_>
+        <_>
+          6 17 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 15 -1.</_>
+        <_>
+          15 13 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 15 -1.</_>
+        <_>
+          5 13 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 16 12 -1.</_>
+        <_>
+          6 15 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 12 -1.</_>
+        <_>
+          2 15 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 7 9 -1.</_>
+        <_>
+          14 15 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 21 -1.</_>
+        <_>
+          10 8 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 9 4 -1.</_>
+        <_>
+          13 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 17 9 -1.</_>
+        <_>
+          3 13 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 8 15 -1.</_>
+        <_>
+          13 13 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 15 -1.</_>
+        <_>
+          3 13 8 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 10 8 -1.</_>
+        <_>
+          16 14 5 4 2.</_>
+        <_>
+          11 18 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 22 6 -1.</_>
+        <_>
+          0 18 11 3 2.</_>
+        <_>
+          11 21 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 24 4 -1.</_>
+        <_>
+          0 16 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 20 12 3 -1.</_>
+        <_>
+          12 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 6 12 -1.</_>
+        <_>
+          21 12 3 6 2.</_>
+        <_>
+          18 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 12 -1.</_>
+        <_>
+          0 12 3 6 2.</_>
+        <_>
+          3 18 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 22 10 -1.</_>
+        <_>
+          1 6 11 5 2.</_>
+        <_>
+          12 11 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 2 -1.</_>
+        <_>
+          0 19 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 19 3 -1.</_>
+        <_>
+          3 16 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 3 -1.</_>
+        <_>
+          0 14 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 9 6 -1.</_>
+        <_>
+          15 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 6 -1.</_>
+        <_>
+          0 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 9 6 -1.</_>
+        <_>
+          12 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 9 6 -1.</_>
+        <_>
+          3 19 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 20 -1.</_>
+        <_>
+          17 2 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 24 8 -1.</_>
+        <_>
+          0 17 24 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 22 -1.</_>
+        <_>
+          12 1 3 11 2.</_>
+        <_>
+          9 12 3 11 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_fullbody.xml b/venv/Lib/site-packages/cv2/data/haarcascade_fullbody.xml
new file mode 100644
index 000000000..3ef752cb6
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_fullbody.xml
@@ -0,0 +1,17030 @@
+<?xml version="1.0"?>
+<!--
+   14x28 fullbody detector (see the detailed description below). 
+
+//////////////////////////////////////////////////////////////////////////
+| Contributors License Agreement
+| IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+|   By downloading, copying, installing or using the software you agree 
+|   to this license.
+|   If you do not agree to this license, do not download, install,
+|   copy or use the software.
+|
+| Copyright (c) 2004, Hannes Kruppa and Bernt Schiele (ETH Zurich, Switzerland).
+|  All rights reserved.
+|
+| Redistribution and use in source and binary forms, with or without
+| modification, are permitted provided that the following conditions are
+| met:
+|
+|    * Redistributions of source code must retain the above copyright
+|       notice, this list of conditions and the following disclaimer.
+|    * Redistributions in binary form must reproduce the above
+|      copyright notice, this list of conditions and the following
+|      disclaimer in the documentation and/or other materials provided
+|      with the distribution.  
+|    * The name of Contributor may not used to endorse or promote products 
+|      derived from this software without specific prior written permission.
+|
+| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+| "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+| LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+| A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+| CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+| EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+| PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+| PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+| LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+| NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+| Top
+//////////////////////////////////////////////////////////////////////////
+
+"Haar"-based Detectors For Pedestrian Detection
+===============================================
+by Hannes Kruppa and Bernt Schiele, ETH Zurich, Switzerland
+
+This archive provides the following three detectors:
+- upper body detector (most fun, useful in many scenarios!)
+- lower body detector
+- full body detector
+
+These detectors have been successfully applied to pedestrian detection
+in still images. They can be directly passed as parameters to the
+program HaarFaceDetect.
+NOTE: These detectors deal with frontal and backside views but not
+with side views (also see "Known limitations" below).
+
+RESEARCHERS:
+If you are using any of the detectors or involved ideas please cite
+this paper (available at www.vision.ethz.ch/publications/):
+
+@InProceedings{Kruppa03-bmvc,
+  author =       "Hannes Kruppa, Modesto Castrillon-Santana and Bernt Schiele",
+  title =        "Fast and Robust Face Finding via Local Context."
+  booktitle =    "Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance"
+  year =         "2003",
+  month =        "October"
+}
+
+COMMERCIAL:
+If you have any commercial interest in this work please contact 
+hkruppa@inf.ethz.ch
+
+
+ADDITIONAL INFORMATION 
+====================== 
+Check out the demo movie, e.g. using mplayer or any (Windows/Linux-) player
+that can play back .mpg movies.
+Under Linux that's:
+> ffplay demo.mpg
+or:
+> mplayer demo.mpg
+
+The movie shows a person walking towards the camera in a realistic
+indoor setting. Using ffplay or mplayer you can pause and continue the
+movie by pressing the space bar.
+
+Detections coming from the different detectors are visualized using
+different line styles: 
+upper body : dotted line
+lower body : dashed line
+full body  : solid line
+
+You will notice that successful detections containing the target do
+not sit tightly on the body but also include some of the background
+left and right.  This is not a bug but accurately reflects the
+employed training data which also includes portions of the background
+to ensure proper silhouette representation. If you want to get a
+feeling for the training data check out the CBCL data set:
+http://www.ai.mit.edu/projects/cbcl/software-datasets/PedestrianData.html
+
+There is also a small number of false alarms in this sequence.  
+NOTE: This is per frame detection, not tracking (which is also one of
+the reasons why it is not mislead by the person's shadow on the back
+wall). 
+
+On an Intel Xeon 1.7GHz machine the detectors operate at something
+between 6Hz to 14 Hz (on 352 x 288 frames per second) depending on the
+detector. The detectors work as well on much lower image resolutions
+which is always an interesting possibility for speed-ups or
+"coarse-to-fine" search strategies.
+
+Additional information e.g. on training parameters, detector
+combination, detecting other types of objects (e.g. cars) etc. is
+available in my PhD thesis report (available end of June). Check out
+www.vision.ethz.ch/kruppa/
+
+
+KNOWN LIMITATIONS
+==================
+1) The detectors only support frontal and back views but not sideviews.
+   Sideviews are trickier and it makes a lot of sense to include additional
+   modalities for their detection, e.g. motion information. I recommend
+   Viola and Jones' ICCV 2003 paper if this further interests you.
+
+2) Don't expect these detectors to be as accurate as a frontal face detector.
+   A frontal face as a pattern is pretty distinct with respect to other
+   patterns occurring in the world (i.e. image "background"). This is not so
+   for upper, lower and especially full bodies, because they have to rely
+   on fragile silhouette information rather than internal (facial) features.
+   Still, we found especially the upper body detector to perform amazingly well.
+   In contrast to a face detector these detectors will also work at very low
+   image resolutions 
+
+Acknowledgements
+================
+Thanks to Martin Spengler, ETH Zurich, for providing the demo movie.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>28</height>
+  <width>14</width>
+  <stageParams>
+    <maxWeakCount>107</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>30</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.2288980484008789e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 -5.5820569396018982e-02</internalNodes>
+          <leafValues>
+            5.8697921037673950e-01 -6.2811422348022461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -3.8861181586980820e-02</internalNodes>
+          <leafValues>
+            -7.0916819572448730e-01 2.6821210980415344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -2.6740878820419312e-01</internalNodes>
+          <leafValues>
+            8.3082962036132812e-01 -2.2599589824676514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 9.6419736742973328e-02</internalNodes>
+          <leafValues>
+            -1.1697849631309509e-01 8.7254559993743896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 -1.0798710398375988e-02</internalNodes>
+          <leafValues>
+            -5.7219749689102173e-01 2.5325658917427063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 1.1365639977157116e-02</internalNodes>
+          <leafValues>
+            1.9650830328464508e-01 -7.2744637727737427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 -5.0216919044032693e-04</internalNodes>
+          <leafValues>
+            2.4435159564018250e-01 -5.1973581314086914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 -2.8462480753660202e-02</internalNodes>
+          <leafValues>
+            -8.3607292175292969e-01 1.1158040165901184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 1.3473170110955834e-03</internalNodes>
+          <leafValues>
+            -3.8406538963317871e-01 2.6767989993095398e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.0969949960708618e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 9 -1.0743220336735249e-02</internalNodes>
+          <leafValues>
+            4.7747328877449036e-01 -6.2392932176589966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 -1.3188569573685527e-03</internalNodes>
+          <leafValues>
+            2.1242660284042358e-01 -2.4162709712982178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -5.5571161210536957e-03</internalNodes>
+          <leafValues>
+            3.6147859692573547e-01 -3.7251719832420349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -1.3893410563468933e-01</internalNodes>
+          <leafValues>
+            -6.7900502681732178e-01 1.1280310153961182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 2.6465829461812973e-02</internalNodes>
+          <leafValues>
+            1.2474969774484634e-01 -8.2852339744567871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -8.9386843144893646e-02</internalNodes>
+          <leafValues>
+            7.4271762371063232e-01 -1.7019319534301758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -2.1335419267416000e-02</internalNodes>
+          <leafValues>
+            -7.1750187873840332e-01 1.5566180646419525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 5.5709101259708405e-02</internalNodes>
+          <leafValues>
+            -1.5310040116310120e-01 7.1804767847061157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -6.9709950685501099e-01</internalNodes>
+          <leafValues>
+            8.1154191493988037e-01 -1.0886389762163162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 2.0205999910831451e-01</internalNodes>
+          <leafValues>
+            7.6398417353630066e-02 -7.3011511564254761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -7.1882657706737518e-02</internalNodes>
+          <leafValues>
+            -7.1488589048385620e-01 1.6517649590969086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 -1.9228760153055191e-02</internalNodes>
+          <leafValues>
+            -3.9868369698524475e-01 4.0557239204645157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 1.1500229593366385e-03</internalNodes>
+          <leafValues>
+            -3.8260778784751892e-01 3.1855079531669617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 2.3252779617905617e-02</internalNodes>
+          <leafValues>
+            5.4390400648117065e-02 -7.0669990777969360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -3.2618120894767344e-04</internalNodes>
+          <leafValues>
+            2.2610600292682648e-01 -4.0709879994392395e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>14</maxWeakCount>
+      <stageThreshold>-1.2285970449447632e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 24 -1.2910200655460358e-01</internalNodes>
+          <leafValues>
+            7.6003128290176392e-01 -2.3405790328979492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 6.7449256777763367e-02</internalNodes>
+          <leafValues>
+            1.7179529368877411e-01 -8.4364777803421021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 1.2663270346820354e-02</internalNodes>
+          <leafValues>
+            2.2913210093975067e-01 -7.3072457313537598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 -4.2741331271827221e-03</internalNodes>
+          <leafValues>
+            6.2420479953289032e-02 -4.0985938906669617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -2.3143950849771500e-02</internalNodes>
+          <leafValues>
+            -8.3971828222274780e-01 2.0115749537944794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -5.5371038615703583e-04</internalNodes>
+          <leafValues>
+            1.5369419753551483e-01 -4.4038110971450806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 -9.5239803194999695e-03</internalNodes>
+          <leafValues>
+            -6.3186800479888916e-01 1.6250230371952057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 2.8307670727372169e-02</internalNodes>
+          <leafValues>
+            -7.2599969804286957e-02 3.7919989228248596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -4.5148018747568130e-02</internalNodes>
+          <leafValues>
+            7.4493628740310669e-01 -1.5581710636615753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 1.0014739632606506e-01</internalNodes>
+          <leafValues>
+            1.7949639260768890e-01 -6.4644080400466919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 7.3245721869170666e-03</internalNodes>
+          <leafValues>
+            1.7763899266719818e-01 -5.7654058933258057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 1.1875670403242111e-02</internalNodes>
+          <leafValues>
+            -3.1129720807075500e-01 1.6321399807929993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 -2.5479039177298546e-02</internalNodes>
+          <leafValues>
+            6.2692481279373169e-01 -1.1333750188350677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -7.9196523874998093e-03</internalNodes>
+          <leafValues>
+            -7.7624428272247314e-01 1.5427610278129578e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>22</maxWeakCount>
+      <stageThreshold>-1.1200269460678101e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 38 -8.5809278488159180e-01</internalNodes>
+          <leafValues>
+            7.8796839714050293e-01 -2.2135549783706665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 -1.6491119749844074e-03</internalNodes>
+          <leafValues>
+            2.5673401355743408e-01 -4.3194240331649780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -2.5882309302687645e-02</internalNodes>
+          <leafValues>
+            -8.7551230192184448e-01 8.8385626673698425e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 -4.7666151076555252e-03</internalNodes>
+          <leafValues>
+            -4.7022369503974915e-01 2.2800800204277039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -8.3729699254035950e-02</internalNodes>
+          <leafValues>
+            6.3385730981826782e-01 -1.4888319373130798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 -4.0685739368200302e-02</internalNodes>
+          <leafValues>
+            -9.3931788206100464e-01 1.0598939843475819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -5.0759920850396156e-03</internalNodes>
+          <leafValues>
+            -4.5554420351982117e-01 1.7864370346069336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 2.3427829146385193e-03</internalNodes>
+          <leafValues>
+            -2.1434280276298523e-01 1.5531420707702637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 2.7649151161313057e-04</internalNodes>
+          <leafValues>
+            -3.3348160982131958e-01 2.2780239582061768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 1.6941839829087257e-02</internalNodes>
+          <leafValues>
+            7.4140816926956177e-02 -5.6262052059173584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 4.7558981180191040e-01</internalNodes>
+          <leafValues>
+            -1.0861130058765411e-01 8.2985258102416992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 5.8000627905130386e-03</internalNodes>
+          <leafValues>
+            1.3249030709266663e-01 -5.1620399951934814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -7.4477560818195343e-02</internalNodes>
+          <leafValues>
+            -5.5545568466186523e-01 1.2344320118427277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 -3.5143009154126048e-04</internalNodes>
+          <leafValues>
+            6.8190753459930420e-02 -1.3616859912872314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 7.3454021476209164e-03</internalNodes>
+          <leafValues>
+            1.3678510487079620e-01 -5.3645122051239014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -1.5471279621124268e-02</internalNodes>
+          <leafValues>
+            2.6180639863014221e-01 -1.0545810312032700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 5.6055500172078609e-03</internalNodes>
+          <leafValues>
+            -2.5746351480484009e-01 2.8795930743217468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -2.4552858667448163e-04</internalNodes>
+          <leafValues>
+            1.0099930316209793e-01 -2.6119679212570190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 -3.3138900995254517e-02</internalNodes>
+          <leafValues>
+            -8.3779567480087280e-01 1.1327689886093140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 3.5591889172792435e-02</internalNodes>
+          <leafValues>
+            8.2336090505123138e-02 -6.2505662441253662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 2.0834030210971832e-01</internalNodes>
+          <leafValues>
+            6.9524437189102173e-02 -8.6881148815155029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -2.8165400028228760e-02</internalNodes>
+          <leafValues>
+            -5.9799849987030029e-01 8.0329902470111847e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.0664960145950317e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 60 -2.6740709319710732e-02</internalNodes>
+          <leafValues>
+            3.8912421464920044e-01 -4.9827679991722107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -1.2516999850049615e-03</internalNodes>
+          <leafValues>
+            1.3123430311679840e-01 -3.6368998885154724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -4.1634511202573776e-02</internalNodes>
+          <leafValues>
+            5.7444751262664795e-01 -1.3932879269123077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 1.0096579790115356e-02</internalNodes>
+          <leafValues>
+            9.9073797464370728e-02 -2.2956989705562592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -1.9090399146080017e-02</internalNodes>
+          <leafValues>
+            -5.5153107643127441e-01 1.5110069513320923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -3.1481068581342697e-02</internalNodes>
+          <leafValues>
+            -4.5884269475936890e-01 1.7579549551010132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -1.7687549814581871e-02</internalNodes>
+          <leafValues>
+            4.4711831212043762e-01 -1.5292930603027344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 -4.3685659766197205e-03</internalNodes>
+          <leafValues>
+            1.2185490131378174e-01 -1.6688570380210876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 8.9326845481991768e-03</internalNodes>
+          <leafValues>
+            -1.3333690166473389e-01 6.3753342628479004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 -5.0706309266388416e-03</internalNodes>
+          <leafValues>
+            -1.1220289766788483e-01 6.9824352860450745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -5.9803090989589691e-03</internalNodes>
+          <leafValues>
+            -5.1842898130416870e-01 1.6099199652671814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 2.9967839363962412e-03</internalNodes>
+          <leafValues>
+            4.1065338999032974e-02 -1.9455850124359131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 3.8641549181193113e-03</internalNodes>
+          <leafValues>
+            1.6673240065574646e-01 -4.3569779396057129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 6.8349428474903107e-03</internalNodes>
+          <leafValues>
+            -1.7162640392780304e-01 1.4818060398101807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 4.3158490210771561e-02</internalNodes>
+          <leafValues>
+            8.3203509449958801e-02 -7.7821850776672363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 7.6560080051422119e-03</internalNodes>
+          <leafValues>
+            8.4740802645683289e-02 -4.9738150835037231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -3.1110988929867744e-03</internalNodes>
+          <leafValues>
+            2.5827148556709290e-01 -2.5552031397819519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 1.1870309710502625e-01</internalNodes>
+          <leafValues>
+            -9.0944238007068634e-02 7.2286212444305420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 1.6875969246029854e-02</internalNodes>
+          <leafValues>
+            1.2629170715808868e-01 -5.5205297470092773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 -1.0887029930017889e-04</internalNodes>
+          <leafValues>
+            8.1648796796798706e-02 -1.6937020421028137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 2.8222990222275257e-03</internalNodes>
+          <leafValues>
+            1.6411300003528595e-01 -3.5218268632888794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -5.2425849437713623e-01</internalNodes>
+          <leafValues>
+            4.8906171321868896e-01 -1.2674759328365326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 3.6927509307861328e-01</internalNodes>
+          <leafValues>
+            8.6115993559360504e-02 -6.7184638977050781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -1.6883780062198639e-01</internalNodes>
+          <leafValues>
+            -8.4915691614151001e-01 5.4833348840475082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -1.9279260188341141e-02</internalNodes>
+          <leafValues>
+            -7.8011512756347656e-01 6.2202680855989456e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>22</maxWeakCount>
+      <stageThreshold>-1.2319500446319580e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 85 -2.0901350677013397e-01</internalNodes>
+          <leafValues>
+            6.9808167219161987e-01 -3.4573590755462646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 -4.8061009147204459e-04</internalNodes>
+          <leafValues>
+            2.0923900604248047e-01 -2.4147640168666840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 -2.4844119325280190e-03</internalNodes>
+          <leafValues>
+            2.7636009454727173e-01 -4.1990399360656738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -2.1536289714276791e-03</internalNodes>
+          <leafValues>
+            2.4710460007190704e-01 -3.0677899718284607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 5.8911990374326706e-02</internalNodes>
+          <leafValues>
+            -7.0834763348102570e-02 7.1133142709732056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -2.3095219512470067e-04</internalNodes>
+          <leafValues>
+            1.7148600518703461e-01 -3.6168378591537476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -3.1396400183439255e-02</internalNodes>
+          <leafValues>
+            -8.0131882429122925e-01 1.0042560100555420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 -3.5601970739662647e-03</internalNodes>
+          <leafValues>
+            9.9432766437530518e-02 -1.4848260581493378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 -4.3389322236180305e-03</internalNodes>
+          <leafValues>
+            -5.6621241569519043e-01 1.4096799492835999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 2.1326710283756256e-01</internalNodes>
+          <leafValues>
+            4.8158209770917892e-02 -7.4858909845352173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 1.0042529553174973e-02</internalNodes>
+          <leafValues>
+            1.0428400337696075e-01 -5.5387377738952637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -2.6825280860066414e-02</internalNodes>
+          <leafValues>
+            5.7281607389450073e-01 -8.2537978887557983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 8.3760882262140512e-04</internalNodes>
+          <leafValues>
+            -2.5626900792121887e-01 2.5898420810699463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -7.6051978394389153e-03</internalNodes>
+          <leafValues>
+            -5.8677357435226440e-01 5.1210779696702957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 -1.1935640126466751e-01</internalNodes>
+          <leafValues>
+            -4.5530828833580017e-01 1.2570330500602722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 6.6083478741347790e-03</internalNodes>
+          <leafValues>
+            -1.6316379606723785e-01 4.6659541130065918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 1.7303509637713432e-02</internalNodes>
+          <leafValues>
+            -1.2391400337219238e-01 5.9755408763885498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 5.4382272064685822e-03</internalNodes>
+          <leafValues>
+            1.3838729262351990e-01 -5.5069202184677124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 2.4591449182480574e-03</internalNodes>
+          <leafValues>
+            -3.9927339553833008e-01 1.5387089550495148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 3.5056238994002342e-03</internalNodes>
+          <leafValues>
+            -1.6146700084209442e-01 1.6086600720882416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 -2.3172689543571323e-04</internalNodes>
+          <leafValues>
+            1.7059360444545746e-01 -3.5409420728683472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 1.1914529837667942e-02</internalNodes>
+          <leafValues>
+            1.6265639662742615e-01 -4.1463181376457214e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>18</maxWeakCount>
+      <stageThreshold>-1.1912549734115601e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 107 -4.5429700985550880e-03</internalNodes>
+          <leafValues>
+            4.2964971065521240e-01 -5.6915849447250366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 4.6804840676486492e-03</internalNodes>
+          <leafValues>
+            -1.0380080342292786e-01 2.5453719496726990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 3.5870380233973265e-03</internalNodes>
+          <leafValues>
+            -3.6577078700065613e-01 3.9343339204788208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 -3.4428331255912781e-01</internalNodes>
+          <leafValues>
+            7.3125761747360229e-01 -1.5060240030288696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 3.3054459840059280e-02</internalNodes>
+          <leafValues>
+            1.7657589912414551e-01 -5.1060509681701660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -2.1190310362726450e-03</internalNodes>
+          <leafValues>
+            8.6859323084354401e-02 -1.7733760178089142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 1.3780740089714527e-02</internalNodes>
+          <leafValues>
+            -1.2247169762849808e-01 6.6472941637039185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 2.4847950786352158e-02</internalNodes>
+          <leafValues>
+            2.3976799845695496e-01 -3.2456618547439575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -1.3126630336046219e-02</internalNodes>
+          <leafValues>
+            4.9461808800697327e-01 -2.0954379439353943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -1.6886189579963684e-02</internalNodes>
+          <leafValues>
+            -1.3973990082740784e-01 7.5013160705566406e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 -5.2776751108467579e-03</internalNodes>
+          <leafValues>
+            -3.8919359445571899e-01 1.8921519815921783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 -2.0325549412518740e-03</internalNodes>
+          <leafValues>
+            2.4965450167655945e-01 -1.7960360646247864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 -1.8056800588965416e-02</internalNodes>
+          <leafValues>
+            -5.3683072328567505e-01 1.0615479946136475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -2.8815109282732010e-02</internalNodes>
+          <leafValues>
+            5.3303200006484985e-01 -7.8712686896324158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -6.0971658676862717e-02</internalNodes>
+          <leafValues>
+            -8.5663092136383057e-01 8.1721447408199310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -6.2022160738706589e-02</internalNodes>
+          <leafValues>
+            -6.7228960990905762e-01 8.2316987216472626e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 -6.2961759977042675e-03</internalNodes>
+          <leafValues>
+            2.7192309498786926e-01 -2.3713490366935730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 4.9608140252530575e-03</internalNodes>
+          <leafValues>
+            -1.4295519888401031e-01 2.9380369186401367e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>30</maxWeakCount>
+      <stageThreshold>-1.1750839948654175e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 125 -8.7001353502273560e-02</internalNodes>
+          <leafValues>
+            6.3087427616119385e-01 -2.6264131069183350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -4.5627020299434662e-03</internalNodes>
+          <leafValues>
+            1.4641839265823364e-01 -5.2321881055831909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -4.1381991468369961e-03</internalNodes>
+          <leafValues>
+            2.1747599542140961e-01 -3.2107940316200256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -1.9443330529611558e-04</internalNodes>
+          <leafValues>
+            1.4305000007152557e-01 -4.4748461246490479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -2.6125069707632065e-03</internalNodes>
+          <leafValues>
+            -3.5936230421066284e-01 2.0934499800205231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 -3.5238351672887802e-02</internalNodes>
+          <leafValues>
+            -5.5879557132720947e-01 1.1818339675664902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 2.3880550637841225e-02</internalNodes>
+          <leafValues>
+            -1.2345419824123383e-01 6.4505738019943237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -3.5878319758921862e-03</internalNodes>
+          <leafValues>
+            2.3340910673141479e-01 -2.9905730485916138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -3.4388148784637451e-01</internalNodes>
+          <leafValues>
+            6.3334107398986816e-01 -8.6101479828357697e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -2.5634190533310175e-03</internalNodes>
+          <leafValues>
+            -3.0992001295089722e-01 8.8213436305522919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 4.7002349048852921e-02</internalNodes>
+          <leafValues>
+            7.3533393442630768e-02 -7.5965261459350586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 7.1428148075938225e-03</internalNodes>
+          <leafValues>
+            -1.6981430351734161e-01 4.1982281208038330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -3.7736629601567984e-03</internalNodes>
+          <leafValues>
+            -5.5664837360382080e-01 1.0060050338506699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 2.2179849445819855e-02</internalNodes>
+          <leafValues>
+            -7.6009899377822876e-02 6.3711041212081909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 2.9807379178237170e-05</internalNodes>
+          <leafValues>
+            -2.7143061161041260e-01 2.1503789722919464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 -1.4308329809864517e-05</internalNodes>
+          <leafValues>
+            1.3090610504150391e-01 -2.8089499473571777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -1.1500260233879089e-01</internalNodes>
+          <leafValues>
+            -7.1986222267150879e-01 7.6884172856807709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -2.5318590924143791e-02</internalNodes>
+          <leafValues>
+            4.5250499248504639e-01 -9.0481691062450409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -4.8698320984840393e-02</internalNodes>
+          <leafValues>
+            -7.4177128076553345e-01 6.7692406475543976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 -5.0045289099216461e-03</internalNodes>
+          <leafValues>
+            1.3680170476436615e-01 -1.1860919743776321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 7.5120502151548862e-03</internalNodes>
+          <leafValues>
+            9.1260991990566254e-02 -5.6960678100585938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -5.4631778039038181e-03</internalNodes>
+          <leafValues>
+            1.1702360212802887e-01 -1.4761230349540710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 1.5256009995937347e-02</internalNodes>
+          <leafValues>
+            -1.0768359899520874e-01 6.4716261625289917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -2.1900620311498642e-02</internalNodes>
+          <leafValues>
+            -6.0776418447494507e-01 6.4449213445186615e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 2.1267218980938196e-03</internalNodes>
+          <leafValues>
+            -2.3115469515323639e-01 2.1813300251960754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -3.1501919031143188e-02</internalNodes>
+          <leafValues>
+            -1.3678109645843506e-01 6.6003270447254181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 1.8107969313859940e-02</internalNodes>
+          <leafValues>
+            1.0865720361471176e-01 -4.4673460721969604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -1.1059570312500000e-01</internalNodes>
+          <leafValues>
+            4.6954178810119629e-01 -1.1268380284309387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 2.2349569480866194e-03</internalNodes>
+          <leafValues>
+            -2.9884970188140869e-01 1.8147529661655426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 4.6504188328981400e-02</internalNodes>
+          <leafValues>
+            1.2846769392490387e-01 -2.6609849929809570e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-1.1861419677734375e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 155 -4.8820599913597107e-02</internalNodes>
+          <leafValues>
+            4.2807990312576294e-01 -5.5154949426651001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 1.4779040357097983e-03</internalNodes>
+          <leafValues>
+            -1.8688060343265533e-01 1.9038289785385132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.0012290440499783e-02</internalNodes>
+          <leafValues>
+            3.8451421260833740e-01 -2.1723049879074097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -5.1000278443098068e-02</internalNodes>
+          <leafValues>
+            -7.6136952638626099e-01 1.3625900261104107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 5.2959132008254528e-03</internalNodes>
+          <leafValues>
+            -2.3021429777145386e-01 2.8536239266395569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -4.8654139041900635e-02</internalNodes>
+          <leafValues>
+            7.0992070436477661e-01 -4.9203149974346161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 8.8448636233806610e-03</internalNodes>
+          <leafValues>
+            -3.1505361199378967e-01 2.0899020135402679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 1.0062800347805023e-01</internalNodes>
+          <leafValues>
+            6.6908989101648331e-03 6.7013871669769287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 -7.0256260223686695e-03</internalNodes>
+          <leafValues>
+            -3.9408329129219055e-01 1.7433549463748932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -2.1224319934844971e-03</internalNodes>
+          <leafValues>
+            1.6996310651302338e-01 -3.0237409472465515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 9.9532064050436020e-03</internalNodes>
+          <leafValues>
+            -1.4202840626239777e-01 4.5167461037635803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 1.2565069831907749e-02</internalNodes>
+          <leafValues>
+            7.3175877332687378e-02 -6.1700421571731567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 -1.7854310572147369e-03</internalNodes>
+          <leafValues>
+            1.4909860491752625e-01 -3.2865241169929504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 -4.0306518785655499e-03</internalNodes>
+          <leafValues>
+            -4.5713710784912109e-01 1.0815720260143280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 -7.3099560104310513e-03</internalNodes>
+          <leafValues>
+            -6.5592771768569946e-01 6.5615788102149963e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 -3.3843431621789932e-02</internalNodes>
+          <leafValues>
+            5.0412368774414062e-01 -6.1626069247722626e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 3.8319290615618229e-04</internalNodes>
+          <leafValues>
+            -2.5153478980064392e-01 2.0271340012550354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 -2.6169361080974340e-03</internalNodes>
+          <leafValues>
+            2.2497959434986115e-01 -2.1958619356155396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -4.5606079511344433e-03</internalNodes>
+          <leafValues>
+            -4.6598041057586670e-01 1.2348009645938873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 1.0822789743542671e-02</internalNodes>
+          <leafValues>
+            -9.6618972718715668e-02 4.6412429213523865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -5.3171347826719284e-03</internalNodes>
+          <leafValues>
+            -5.5634248256683350e-01 9.4623282551765442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -9.3140971148386598e-04</internalNodes>
+          <leafValues>
+            1.0143929719924927e-01 -1.0564240068197250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 8.4296840941533446e-04</internalNodes>
+          <leafValues>
+            -1.3243100047111511e-01 3.5351079702377319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 -2.7806960046291351e-02</internalNodes>
+          <leafValues>
+            -6.5050601959228516e-01 3.3153589814901352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 6.9245469057932496e-04</internalNodes>
+          <leafValues>
+            -2.6702880859375000e-01 2.1129630506038666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -1.2787230312824249e-02</internalNodes>
+          <leafValues>
+            2.1593640744686127e-01 -8.6767077445983887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -6.1678601196035743e-04</internalNodes>
+          <leafValues>
+            1.6959980130195618e-01 -2.9248940944671631e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>-1.0550270080566406e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 182 -5.1706928759813309e-02</internalNodes>
+          <leafValues>
+            4.6942698955535889e-01 -5.1280671358108521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 5.5232150480151176e-03</internalNodes>
+          <leafValues>
+            -2.4982389807701111e-01 6.3005810976028442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -9.2110745608806610e-03</internalNodes>
+          <leafValues>
+            3.7530669569969177e-01 -2.2910380363464355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 4.1729960590600967e-02</internalNodes>
+          <leafValues>
+            -1.1262010037899017e-01 6.7508697509765625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 4.5255841687321663e-03</internalNodes>
+          <leafValues>
+            -2.6939728856086731e-01 2.4889509379863739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -8.5208792006596923e-04</internalNodes>
+          <leafValues>
+            2.0098550617694855e-01 -2.3001730442047119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -3.4569639246910810e-03</internalNodes>
+          <leafValues>
+            -3.6372348666191101e-01 2.7142500877380371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 -8.8200360536575317e-02</internalNodes>
+          <leafValues>
+            -7.5951957702636719e-01 -7.2166309691965580e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -2.3253160179592669e-04</internalNodes>
+          <leafValues>
+            1.4738219976425171e-01 -4.2548701167106628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 1.9258400425314903e-02</internalNodes>
+          <leafValues>
+            -8.4830872714519501e-02 5.9487771987915039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -3.1915740109980106e-03</internalNodes>
+          <leafValues>
+            -4.2638280987739563e-01 1.3357159495353699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -2.2229040041565895e-02</internalNodes>
+          <leafValues>
+            -4.2298269271850586e-01 3.6127958446741104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -5.3123440593481064e-03</internalNodes>
+          <leafValues>
+            2.9349780082702637e-01 -2.2197869420051575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 5.6796981953084469e-03</internalNodes>
+          <leafValues>
+            8.0412790179252625e-02 -1.9725289940834045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 3.2511178869754076e-03</internalNodes>
+          <leafValues>
+            -1.6628390550613403e-01 3.3107280731201172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 2.5559039786458015e-03</internalNodes>
+          <leafValues>
+            6.7350171506404877e-02 -2.4642370641231537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 3.1239999458193779e-02</internalNodes>
+          <leafValues>
+            -6.7393511533737183e-02 8.2851767539978027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -4.4333371333777905e-03</internalNodes>
+          <leafValues>
+            -3.8048321008682251e-01 1.4248619973659515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -3.9497618563473225e-03</internalNodes>
+          <leafValues>
+            -3.5660448670387268e-01 1.8685440719127655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -1.4043290168046951e-02</internalNodes>
+          <leafValues>
+            5.3222888708114624e-01 -7.8980803489685059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 4.2212791740894318e-03</internalNodes>
+          <leafValues>
+            -1.9841830432415009e-01 3.1367298960685730e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>43</maxWeakCount>
+      <stageThreshold>-1.1214250326156616e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 203 -1.5278789401054382e-01</internalNodes>
+          <leafValues>
+            5.4140037298202515e-01 -1.8756979703903198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 -7.0655636489391327e-02</internalNodes>
+          <leafValues>
+            3.4003350138664246e-01 -1.4459669589996338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 -2.1033229306340218e-02</internalNodes>
+          <leafValues>
+            -5.5878472328186035e-01 1.1598149687051773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 -9.5666358247399330e-03</internalNodes>
+          <leafValues>
+            1.0890080034732819e-01 -2.0365689694881439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -4.2720541357994080e-02</internalNodes>
+          <leafValues>
+            -9.4030022621154785e-01 6.3606321811676025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 -4.5477859675884247e-03</internalNodes>
+          <leafValues>
+            3.4227019548416138e-01 -1.7053720355033875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 3.7029080558568239e-03</internalNodes>
+          <leafValues>
+            8.3720892667770386e-02 -4.6139541268348694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -1.1458870023488998e-01</internalNodes>
+          <leafValues>
+            6.0027849674224854e-01 -1.7764480784535408e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 5.7319342158734798e-03</internalNodes>
+          <leafValues>
+            -2.5590109825134277e-01 2.0062319934368134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 -7.0237793028354645e-02</internalNodes>
+          <leafValues>
+            2.5359788537025452e-01 -2.9503619298338890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 1.3983179815113544e-02</internalNodes>
+          <leafValues>
+            1.1456400156021118e-01 -3.9683538675308228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 1.8175759911537170e-01</internalNodes>
+          <leafValues>
+            5.0749950110912323e-02 -8.3061927556991577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 3.0185490846633911e-02</internalNodes>
+          <leafValues>
+            -2.6683610677719116e-01 1.4070799946784973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 7.5633287429809570e-01</internalNodes>
+          <leafValues>
+            -4.1416618973016739e-02 9.0957278013229370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -8.5228988900780678e-03</internalNodes>
+          <leafValues>
+            1.6142499446868896e-01 -2.7549099922180176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -4.9996669404208660e-03</internalNodes>
+          <leafValues>
+            -1.1666730046272278e-01 6.0298819094896317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -5.9932802105322480e-04</internalNodes>
+          <leafValues>
+            1.3015550374984741e-01 -3.1072840094566345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 -9.6063673496246338e-02</internalNodes>
+          <leafValues>
+            -8.5259348154067993e-01 1.5970790758728981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -7.0154820568859577e-03</internalNodes>
+          <leafValues>
+            -4.5490509271621704e-01 7.7178090810775757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 -8.7620541453361511e-03</internalNodes>
+          <leafValues>
+            4.8034501075744629e-01 -8.1306837499141693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 -3.9868508465588093e-03</internalNodes>
+          <leafValues>
+            2.2495600581169128e-01 -2.0447289943695068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -5.7335309684276581e-02</internalNodes>
+          <leafValues>
+            -5.6859737634658813e-01 5.2798101678490639e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 1.9260890549048781e-03</internalNodes>
+          <leafValues>
+            1.4920340478420258e-01 -3.1059908866882324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 2.1118070930242538e-02</internalNodes>
+          <leafValues>
+            4.1174301877617836e-03 -5.2401381731033325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -1.1973599903285503e-03</internalNodes>
+          <leafValues>
+            2.3353399336338043e-01 -2.0193660259246826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 4.5973812229931355e-03</internalNodes>
+          <leafValues>
+            5.9917010366916656e-02 -1.1878310143947601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 2.8869660571217537e-02</internalNodes>
+          <leafValues>
+            -9.4110779464244843e-02 4.5966941118240356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 -3.7549799308180809e-03</internalNodes>
+          <leafValues>
+            1.2161179631948471e-01 -1.4811019599437714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 4.2033549398183823e-03</internalNodes>
+          <leafValues>
+            1.0903070122003555e-01 -3.8700520992279053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 7.2994068264961243e-02</internalNodes>
+          <leafValues>
+            -3.4046798944473267e-02 3.0610039830207825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 1.6667179763317108e-02</internalNodes>
+          <leafValues>
+            1.3168589770793915e-01 -3.8485860824584961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -2.8268690221011639e-03</internalNodes>
+          <leafValues>
+            6.4782157540321350e-02 -2.2371709346771240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 3.7736070808023214e-03</internalNodes>
+          <leafValues>
+            -1.5592969954013824e-01 2.5413069128990173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -3.6936940159648657e-03</internalNodes>
+          <leafValues>
+            2.5576528906822205e-01 -1.5768060088157654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -6.6801063716411591e-02</internalNodes>
+          <leafValues>
+            -7.4346089363098145e-01 5.4915640503168106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 1.5752790495753288e-02</internalNodes>
+          <leafValues>
+            -9.8638102412223816e-02 4.3119820952415466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 9.0647127944976091e-04</internalNodes>
+          <leafValues>
+            1.1339239776134491e-01 -4.1574460268020630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 -2.1695699542760849e-02</internalNodes>
+          <leafValues>
+            4.6949240565299988e-01 -5.5732611566781998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -1.4639029977843165e-03</internalNodes>
+          <leafValues>
+            -3.0617880821228027e-01 1.4398169517517090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -1.7810560762882233e-02</internalNodes>
+          <leafValues>
+            3.0411729216575623e-01 -4.6758800745010376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -5.6027648970484734e-03</internalNodes>
+          <leafValues>
+            -5.2942901849746704e-01 7.8287117183208466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 1.9500569906085730e-03</internalNodes>
+          <leafValues>
+            -9.5949448645114899e-02 1.9031670689582825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 1.0641569644212723e-01</internalNodes>
+          <leafValues>
+            4.7288440167903900e-02 -8.6525350809097290e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>-1.1566660404205322e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 246 1.8256990239024162e-02</internalNodes>
+          <leafValues>
+            -5.5564939975738525e-01 4.3546560406684875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -1.1249440163373947e-01</internalNodes>
+          <leafValues>
+            6.1800277233123779e-01 -2.1641810238361359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 2.0443440880626440e-03</internalNodes>
+          <leafValues>
+            -3.1379559636116028e-01 2.6424890756607056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 6.2505697133019567e-04</internalNodes>
+          <leafValues>
+            -2.3659600317478180e-01 2.1169990301132202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 1.3297300320118666e-03</internalNodes>
+          <leafValues>
+            -3.1339448690414429e-01 3.0449068546295166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -4.6840369701385498e-02</internalNodes>
+          <leafValues>
+            5.3759092092514038e-01 -1.8081139773130417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 -6.4874291419982910e-01</internalNodes>
+          <leafValues>
+            6.6768437623977661e-01 -9.1247849166393280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 9.6183530986309052e-03</internalNodes>
+          <leafValues>
+            1.4733779430389404e-01 -3.2193028926849365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 2.2117879707366228e-03</internalNodes>
+          <leafValues>
+            1.5755419433116913e-01 -3.6799180507659912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 4.9280291423201561e-03</internalNodes>
+          <leafValues>
+            -8.3405740559101105e-02 6.8260177969932556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 1.3977079652249813e-02</internalNodes>
+          <leafValues>
+            -1.0702060163021088e-01 4.8326531052589417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -1.0333389946026728e-04</internalNodes>
+          <leafValues>
+            1.3645449280738831e-01 -3.1777021288871765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -2.2287340834736824e-03</internalNodes>
+          <leafValues>
+            2.1791179478168488e-01 -1.9923299551010132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -3.2301511615514755e-02</internalNodes>
+          <leafValues>
+            3.3135131001472473e-01 -2.0617039874196053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 2.3240039125084877e-02</internalNodes>
+          <leafValues>
+            5.9672571718692780e-02 -6.4993959665298462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 3.5599120892584324e-03</internalNodes>
+          <leafValues>
+            -1.4818920195102692e-01 2.9893338680267334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 1.5469759702682495e-02</internalNodes>
+          <leafValues>
+            -7.5569599866867065e-02 5.2314680814743042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -1.6372289974242449e-04</internalNodes>
+          <leafValues>
+            1.0446730256080627e-01 -2.0943340659141541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 -2.9369019903242588e-03</internalNodes>
+          <leafValues>
+            -4.3197739124298096e-01 1.0765810310840607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -7.8579207183793187e-04</internalNodes>
+          <leafValues>
+            -2.4614779651165009e-01 2.1554739773273468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 1.1156699620187283e-02</internalNodes>
+          <leafValues>
+            -8.1820882856845856e-02 6.7338067293167114e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>49</maxWeakCount>
+      <stageThreshold>-1.0953630208969116e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 267 -1.8473519384860992e-01</internalNodes>
+          <leafValues>
+            5.4758828878402710e-01 -2.2319069504737854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -2.8615030460059643e-03</internalNodes>
+          <leafValues>
+            1.9264279305934906e-01 -2.2989100217819214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 1.7970189452171326e-01</internalNodes>
+          <leafValues>
+            -6.4573682844638824e-02 8.0322009325027466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -5.2812729030847549e-02</internalNodes>
+          <leafValues>
+            2.8784981369972229e-01 -8.8289387524127960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 6.9000339135527611e-03</internalNodes>
+          <leafValues>
+            1.0979209840297699e-01 -4.8886889219284058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 4.0469530969858170e-02</internalNodes>
+          <leafValues>
+            6.1697468161582947e-02 -7.2907817363739014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 4.5191249810159206e-03</internalNodes>
+          <leafValues>
+            -2.7972379326820374e-01 1.7065159976482391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -3.8400939665734768e-03</internalNodes>
+          <leafValues>
+            -2.8329300880432129e-01 1.1611709743738174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -7.1505218511447310e-04</internalNodes>
+          <leafValues>
+            1.5870480239391327e-01 -2.8253421187400818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 3.0127899721264839e-02</internalNodes>
+          <leafValues>
+            -3.6236338317394257e-02 5.3369390964508057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -1.9907640293240547e-02</internalNodes>
+          <leafValues>
+            -3.2229989767074585e-01 1.4933170378208160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 -3.1435668468475342e-02</internalNodes>
+          <leafValues>
+            2.0812889933586121e-01 -9.6762210130691528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 -1.9912680611014366e-02</internalNodes>
+          <leafValues>
+            -3.2928928732872009e-01 1.2732729315757751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 4.0626749396324158e-02</internalNodes>
+          <leafValues>
+            1.6985720023512840e-02 -5.2226179838180542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 1.6589110018685460e-03</internalNodes>
+          <leafValues>
+            -2.3795670270919800e-01 2.0775599777698517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 1.9869199022650719e-03</internalNodes>
+          <leafValues>
+            -1.3493759930133820e-01 1.2050859630107880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 -4.1985820978879929e-02</internalNodes>
+          <leafValues>
+            4.4601130485534668e-01 -7.6145969331264496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 7.0260182023048401e-02</internalNodes>
+          <leafValues>
+            1.5833569690585136e-02 -3.8182300329208374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -1.7992800101637840e-02</internalNodes>
+          <leafValues>
+            -3.6973980069160461e-01 1.0451599955558777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -1.0420969873666763e-01</internalNodes>
+          <leafValues>
+            5.1836878061294556e-01 -2.2372400388121605e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 5.3277369588613510e-02</internalNodes>
+          <leafValues>
+            7.4715927243232727e-02 -5.8489412069320679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 9.6819162368774414e-02</internalNodes>
+          <leafValues>
+            -7.8130746260285378e-03 -9.0531897544860840e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -2.2317610681056976e-01</internalNodes>
+          <leafValues>
+            4.7848999500274658e-01 -8.9570246636867523e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 1.3523760251700878e-02</internalNodes>
+          <leafValues>
+            6.5158583223819733e-02 -1.4030559360980988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -7.1465343236923218e-02</internalNodes>
+          <leafValues>
+            -8.8997572660446167e-01 3.8111008703708649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 2.4734560400247574e-02</internalNodes>
+          <leafValues>
+            -3.2858259975910187e-02 3.5368600487709045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -4.2641810141503811e-03</internalNodes>
+          <leafValues>
+            1.2885729968547821e-01 -2.7788180112838745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 4.3246541172266006e-02</internalNodes>
+          <leafValues>
+            -2.6344619691371918e-02 3.3333760499954224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 5.2720978856086731e-03</internalNodes>
+          <leafValues>
+            9.6122108399868011e-02 -3.8203689455986023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 -6.4102048054337502e-03</internalNodes>
+          <leafValues>
+            1.6924449801445007e-01 -7.5236052274703979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 1.7747100442647934e-02</internalNodes>
+          <leafValues>
+            -6.5126739442348480e-02 5.3720867633819580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 1.6466729342937469e-01</internalNodes>
+          <leafValues>
+            2.6764029636979103e-02 -6.9506132602691650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -7.6354909688234329e-03</internalNodes>
+          <leafValues>
+            1.7261630296707153e-01 -2.0242890715599060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -7.6648168265819550e-02</internalNodes>
+          <leafValues>
+            2.2567149996757507e-01 -3.5044141113758087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 2.9634330421686172e-03</internalNodes>
+          <leafValues>
+            1.0679820179939270e-01 -3.0704519152641296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 -1.8968040123581886e-02</internalNodes>
+          <leafValues>
+            -6.5349531173706055e-01 4.5328449457883835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 6.2272930145263672e-01</internalNodes>
+          <leafValues>
+            2.9418470337986946e-02 -7.7416032552719116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 3.1170540023595095e-03</internalNodes>
+          <leafValues>
+            -1.9263580441474915e-01 1.0082499682903290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 -1.0179740190505981e-01</internalNodes>
+          <leafValues>
+            5.0667291879653931e-01 -7.5845532119274139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 -8.7539367377758026e-02</internalNodes>
+          <leafValues>
+            -8.0127829313278198e-01 3.9741981774568558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -4.0089199319481850e-03</internalNodes>
+          <leafValues>
+            1.5867359936237335e-01 -2.0390710234642029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 -1.7252740263938904e-01</internalNodes>
+          <leafValues>
+            -4.8556509613990784e-01 6.6162437200546265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 2.2747491020709276e-03</internalNodes>
+          <leafValues>
+            1.0839290171861649e-01 -2.6120510697364807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 8.7025731801986694e-02</internalNodes>
+          <leafValues>
+            -4.5612849295139313e-02 3.0642318725585938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 3.3302091062068939e-02</internalNodes>
+          <leafValues>
+            9.8511956632137299e-02 -4.0321010351181030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -5.5495370179414749e-03</internalNodes>
+          <leafValues>
+            6.7809469997882843e-02 -1.9448509812355042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -7.5916801579296589e-03</internalNodes>
+          <leafValues>
+            -3.3229979872703552e-01 1.0552299767732620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -5.4776940494775772e-02</internalNodes>
+          <leafValues>
+            3.1344750523567200e-01 -9.2561431229114532e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 1.7293309792876244e-02</internalNodes>
+          <leafValues>
+            -1.0366520285606384e-01 4.5732820034027100e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>40</maxWeakCount>
+      <stageThreshold>-1.0216970443725586e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 316 -2.2501630708575249e-02</internalNodes>
+          <leafValues>
+            5.2293592691421509e-01 -1.7968380451202393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -1.8166720867156982e-02</internalNodes>
+          <leafValues>
+            1.4281089603900909e-01 -3.0268448591232300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 3.1680259853601456e-02</internalNodes>
+          <leafValues>
+            1.5708820521831512e-01 -3.2303369045257568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -2.3476250469684601e-02</internalNodes>
+          <leafValues>
+            -4.5576000213623047e-01 1.0300090163946152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 4.5688278973102570e-02</internalNodes>
+          <leafValues>
+            6.7873537540435791e-02 -7.4623328447341919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -7.4609883129596710e-02</internalNodes>
+          <leafValues>
+            2.0548540353775024e-01 -1.0097859799861908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -4.5903101563453674e-02</internalNodes>
+          <leafValues>
+            6.6662758588790894e-01 -6.9071657955646515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 -5.7763070799410343e-04</internalNodes>
+          <leafValues>
+            1.1386449635028839e-01 -1.2278319895267487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -4.1800830513238907e-04</internalNodes>
+          <leafValues>
+            1.9999989867210388e-01 -2.2372670471668243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 2.4581039324402809e-03</internalNodes>
+          <leafValues>
+            1.0073749721050262e-01 -3.6323159933090210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 6.7467048764228821e-02</internalNodes>
+          <leafValues>
+            5.4200690239667892e-02 -6.0347068309783936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 -3.8971859961748123e-02</internalNodes>
+          <leafValues>
+            4.0277591347694397e-01 -1.1299470067024231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 1.6628159582614899e-01</internalNodes>
+          <leafValues>
+            4.8290308564901352e-02 -8.1269222497940063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 5.5140322074294090e-03</internalNodes>
+          <leafValues>
+            6.0484610497951508e-02 -5.4575890302658081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 1.2837080284953117e-03</internalNodes>
+          <leafValues>
+            -2.8150710463523865e-01 1.2785549461841583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 3.3840160816907883e-02</internalNodes>
+          <leafValues>
+            -6.1925090849399567e-02 5.4461580514907837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 1.4224560000002384e-02</internalNodes>
+          <leafValues>
+            -8.3702072501182556e-02 5.5404889583587646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -1.4315280714072287e-04</internalNodes>
+          <leafValues>
+            1.5318620204925537e-01 -2.8312870860099792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 -1.3604390434920788e-02</internalNodes>
+          <leafValues>
+            -6.3229328393936157e-01 5.6792028248310089e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 -1.7952319979667664e-01</internalNodes>
+          <leafValues>
+            -7.7471101284027100e-01 -1.2696949997916818e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 -6.3834888860583305e-03</internalNodes>
+          <leafValues>
+            1.2864939868450165e-01 -3.1159159541130066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 -1.8140509724617004e-01</internalNodes>
+          <leafValues>
+            -7.0704931020736694e-01 3.0992519110441208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 3.4940429031848907e-03</internalNodes>
+          <leafValues>
+            1.0192289948463440e-01 -3.3393231034278870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 4.0861740708351135e-02</internalNodes>
+          <leafValues>
+            3.1267888844013214e-02 -4.3739050626754761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 3.6993999034166336e-02</internalNodes>
+          <leafValues>
+            -6.2453608959913254e-02 5.7605278491973877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -7.7690118923783302e-03</internalNodes>
+          <leafValues>
+            -6.0737371444702148e-01 6.9758452475070953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 7.1885702200233936e-03</internalNodes>
+          <leafValues>
+            -1.4034010469913483e-01 2.4509570002555847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 -3.0558679252862930e-02</internalNodes>
+          <leafValues>
+            -2.6109099388122559e-01 2.0893760025501251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 -1.3949500396847725e-02</internalNodes>
+          <leafValues>
+            -4.5984518527984619e-01 7.2996988892555237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -1.7439149320125580e-01</internalNodes>
+          <leafValues>
+            2.7917501330375671e-01 -7.0309691131114960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -5.6514460593461990e-03</internalNodes>
+          <leafValues>
+            -5.8335387706756592e-01 4.8543170094490051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -5.6718150153756142e-03</internalNodes>
+          <leafValues>
+            -2.0645590126514435e-01 5.9949990361928940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -2.9772339985356666e-05</internalNodes>
+          <leafValues>
+            1.6627080738544464e-01 -1.8144470453262329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 -6.2705092132091522e-03</internalNodes>
+          <leafValues>
+            2.5829210877418518e-01 -1.3548080623149872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -5.2028051577508450e-03</internalNodes>
+          <leafValues>
+            -2.9585519433021545e-01 1.0223600268363953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 -3.6721840500831604e-02</internalNodes>
+          <leafValues>
+            1.1443459987640381e-01 -1.5670689940452576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 7.8717432916164398e-02</internalNodes>
+          <leafValues>
+            2.9407389461994171e-02 -8.9653927087783813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 9.0856212377548218e-01</internalNodes>
+          <leafValues>
+            -5.6400269269943237e-02 6.9543528556823730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -5.2952598780393600e-03</internalNodes>
+          <leafValues>
+            1.8282440304756165e-01 -2.0518480241298676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 -5.2672341465950012e-02</internalNodes>
+          <leafValues>
+            -6.8133538961410522e-01 3.6046069115400314e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>51</maxWeakCount>
+      <stageThreshold>-1.0450960397720337e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 356 -2.1731309592723846e-01</internalNodes>
+          <leafValues>
+            5.9716808795928955e-01 -2.2432699799537659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -3.4627959132194519e-01</internalNodes>
+          <leafValues>
+            5.3741937875747681e-01 -8.7782189249992371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 1.0713579831644893e-03</internalNodes>
+          <leafValues>
+            -3.5920229554176331e-01 1.5685929358005524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 -6.1267141252756119e-02</internalNodes>
+          <leafValues>
+            -7.1003252267837524e-01 2.0527899265289307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 3.1281840056180954e-02</internalNodes>
+          <leafValues>
+            -7.4646763503551483e-02 5.9689122438430786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -1.2337400112301111e-03</internalNodes>
+          <leafValues>
+            1.5949830412864685e-01 -2.7181199193000793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -3.4508139360696077e-03</internalNodes>
+          <leafValues>
+            2.0255160331726074e-01 -1.9399139285087585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 -7.0481761358678341e-03</internalNodes>
+          <leafValues>
+            -5.5100089311599731e-01 7.0738323032855988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 2.2950200736522675e-01</internalNodes>
+          <leafValues>
+            -8.7573416531085968e-02 6.0446268320083618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 -2.2578560747206211e-03</internalNodes>
+          <leafValues>
+            -8.5306502878665924e-02 1.0997729748487473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -9.7562908194959164e-04</internalNodes>
+          <leafValues>
+            9.7412303090095520e-02 -3.6251759529113770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 5.3088109940290451e-02</internalNodes>
+          <leafValues>
+            -3.5328660160303116e-03 -6.0694789886474609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 1.5448880149051547e-03</internalNodes>
+          <leafValues>
+            -2.2419139742851257e-01 1.7832720279693604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 1.2375700287520885e-02</internalNodes>
+          <leafValues>
+            -3.5778950899839401e-02 2.9557931423187256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 5.9611927717924118e-03</internalNodes>
+          <leafValues>
+            -7.3603026568889618e-02 4.8699569702148438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 8.3732418715953827e-03</internalNodes>
+          <leafValues>
+            9.5786556601524353e-02 -3.9222580194473267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 -7.9954452812671661e-03</internalNodes>
+          <leafValues>
+            -2.9597011208534241e-01 1.3246519863605499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 1.7624149098992348e-02</internalNodes>
+          <leafValues>
+            1.1629760265350342e-02 -3.7594190239906311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -8.1538967788219452e-04</internalNodes>
+          <leafValues>
+            1.8403179943561554e-01 -2.1106949448585510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 6.5910838544368744e-02</internalNodes>
+          <leafValues>
+            3.8050938397645950e-02 -8.7356221675872803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -8.1749828532338142e-03</internalNodes>
+          <leafValues>
+            -3.0115619301795959e-01 8.1345446407794952e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -3.8275010883808136e-02</internalNodes>
+          <leafValues>
+            3.8238960504531860e-01 -5.5969979614019394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 3.2501420937478542e-03</internalNodes>
+          <leafValues>
+            -2.1520890295505524e-01 1.3417840003967285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 5.6356219574809074e-03</internalNodes>
+          <leafValues>
+            -9.1598346829414368e-02 2.6930230855941772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 -5.1177428103983402e-03</internalNodes>
+          <leafValues>
+            -3.0092298984527588e-01 1.0440470278263092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 -6.0195129364728928e-02</internalNodes>
+          <leafValues>
+            1.8512830138206482e-01 -6.3004150986671448e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 4.6473558992147446e-02</internalNodes>
+          <leafValues>
+            3.7559378892183304e-02 -8.1117790937423706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 2.2262150887399912e-03</internalNodes>
+          <leafValues>
+            -1.2262800335884094e-01 8.3288192749023438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 1.6670780256390572e-02</internalNodes>
+          <leafValues>
+            -5.2774429321289062e-02 5.4887998104095459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -6.3093528151512146e-02</internalNodes>
+          <leafValues>
+            -7.4702072143554688e-01 2.7049509808421135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 -7.7139958739280701e-04</internalNodes>
+          <leafValues>
+            9.2177063226699829e-02 -2.9994431138038635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -8.9107893407344818e-02</internalNodes>
+          <leafValues>
+            -3.8937440514564514e-01 2.9831759631633759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -1.7469590238761157e-04</internalNodes>
+          <leafValues>
+            1.6117650270462036e-01 -2.0639100670814514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -2.1986931096762419e-03</internalNodes>
+          <leafValues>
+            1.4286069571971893e-01 -1.2366549670696259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 2.1864708978682756e-03</internalNodes>
+          <leafValues>
+            -1.7435190081596375e-01 1.6586010158061981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 1.2738450430333614e-02</internalNodes>
+          <leafValues>
+            4.8340078443288803e-02 -8.1297926604747772e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 -1.2383400462567806e-02</internalNodes>
+          <leafValues>
+            -3.7464460730552673e-01 8.1205978989601135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 -1.2094350159168243e-01</internalNodes>
+          <leafValues>
+            -9.1908979415893555e-01 1.7007840797305107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 4.8902980983257294e-02</internalNodes>
+          <leafValues>
+            -7.0619069039821625e-02 5.1363438367843628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -1.9585320260375738e-03</internalNodes>
+          <leafValues>
+            9.9808372557163239e-02 -1.0681519657373428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -2.9645320773124695e-01</internalNodes>
+          <leafValues>
+            -9.1213762760162354e-01 3.2292358577251434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 1.0741979628801346e-01</internalNodes>
+          <leafValues>
+            -2.3814958985894918e-03 -7.1836417913436890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -4.2040441185235977e-02</internalNodes>
+          <leafValues>
+            3.0848339200019836e-01 -9.9647372961044312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 6.8270778283476830e-03</internalNodes>
+          <leafValues>
+            8.3302132785320282e-02 -3.6433839797973633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -1.1072089895606041e-02</internalNodes>
+          <leafValues>
+            -2.5886499881744385e-01 1.2579409778118134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 -1.6399029642343521e-02</internalNodes>
+          <leafValues>
+            3.0191990733146667e-01 -4.9352090805768967e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -2.0852450688835233e-04</internalNodes>
+          <leafValues>
+            1.2508730590343475e-01 -2.1993610262870789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 -3.0174860730767250e-02</internalNodes>
+          <leafValues>
+            -6.5353047847747803e-01 1.0185699909925461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -3.9148568175733089e-03</internalNodes>
+          <leafValues>
+            -2.0781719684600830e-01 1.2460950016975403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 -2.7260989882051945e-03</internalNodes>
+          <leafValues>
+            1.2443950027227402e-01 -1.5540640056133270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 1.7432900145649910e-02</internalNodes>
+          <leafValues>
+            -5.9761889278888702e-02 4.9430638551712036e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>-9.2809242010116577e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 407 -2.1454410254955292e-01</internalNodes>
+          <leafValues>
+            5.1646298170089722e-01 -2.2012180089950562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 1.3796210289001465e-02</internalNodes>
+          <leafValues>
+            5.0541419535875320e-02 -2.3305070400238037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 9.6883601509034634e-04</internalNodes>
+          <leafValues>
+            -2.4793210625648499e-01 2.0536769926548004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 -6.6670728847384453e-03</internalNodes>
+          <leafValues>
+            -2.2546489536762238e-01 6.4493361860513687e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 2.1733778994530439e-03</internalNodes>
+          <leafValues>
+            -2.1164029836654663e-01 2.1819859743118286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -1.2321940157562494e-03</internalNodes>
+          <leafValues>
+            6.7792296409606934e-02 -1.1661940068006516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 -5.9950752183794975e-03</internalNodes>
+          <leafValues>
+            -4.2384910583496094e-01 1.3204540312290192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 2.6942830532789230e-02</internalNodes>
+          <leafValues>
+            -1.0161910206079483e-01 4.8092079162597656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 6.6907003521919250e-02</internalNodes>
+          <leafValues>
+            -8.4552347660064697e-02 4.9274548888206482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -1.6729519702494144e-03</internalNodes>
+          <leafValues>
+            9.2197872698307037e-02 -2.2954310476779938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 1.3808730058372021e-02</internalNodes>
+          <leafValues>
+            -6.0905098915100098e-02 5.8490061759948730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -2.3627160117030144e-02</internalNodes>
+          <leafValues>
+            -8.8347977399826050e-01 9.7397705540060997e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 -1.3927640393376350e-02</internalNodes>
+          <leafValues>
+            -6.5309441089630127e-01 5.2886508405208588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 3.6122989840805531e-03</internalNodes>
+          <leafValues>
+            -2.6369398832321167e-01 1.0595279932022095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 -5.2949450910091400e-02</internalNodes>
+          <leafValues>
+            -7.3409342765808105e-01 4.7014039009809494e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 1.7414819449186325e-02</internalNodes>
+          <leafValues>
+            1.7683740705251694e-02 -5.8782297372817993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -3.2427799305878580e-04</internalNodes>
+          <leafValues>
+            1.3886380195617676e-01 -3.0609750747680664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 -4.3613791465759277e-02</internalNodes>
+          <leafValues>
+            5.4857110977172852e-01 -6.7348852753639221e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 -9.3427510000765324e-04</internalNodes>
+          <leafValues>
+            1.8392640352249146e-01 -1.7492470145225525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 7.9606421291828156e-02</internalNodes>
+          <leafValues>
+            4.5652151107788086e-02 -6.3910657167434692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -2.5120750069618225e-02</internalNodes>
+          <leafValues>
+            1.0046990215778351e-01 -2.7824568748474121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 3.2976910471916199e-02</internalNodes>
+          <leafValues>
+            -5.9311199933290482e-02 6.5328377485275269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 -3.7845480255782604e-03</internalNodes>
+          <leafValues>
+            -2.4190320074558258e-01 1.3097280263900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 9.4495685771107674e-03</internalNodes>
+          <leafValues>
+            -9.3100033700466156e-02 2.3785820603370667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 2.5168890133500099e-03</internalNodes>
+          <leafValues>
+            1.3604310154914856e-01 -2.8159540891647339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 2.6242460589855909e-03</internalNodes>
+          <leafValues>
+            8.9834272861480713e-02 -3.7729039788246155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -4.4626198709011078e-02</internalNodes>
+          <leafValues>
+            3.8320839405059814e-01 -9.6285469830036163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 1.4027470024302602e-04</internalNodes>
+          <leafValues>
+            -1.7261759936809540e-01 1.6574309766292572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 3.9115909487009048e-02</internalNodes>
+          <leafValues>
+            7.8652113676071167e-02 -3.5689839720726013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -6.6682003438472748e-02</internalNodes>
+          <leafValues>
+            -8.8001507520675659e-01 9.0465601533651352e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 6.3860351219773293e-03</internalNodes>
+          <leafValues>
+            -7.5936213135719299e-02 3.8622769713401794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 4.3549899011850357e-02</internalNodes>
+          <leafValues>
+            -2.5680009275674820e-02 7.4085921049118042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 1.8360930262133479e-03</internalNodes>
+          <leafValues>
+            1.1183869838714600e-01 -3.3362200856208801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 1.6189280431717634e-03</internalNodes>
+          <leafValues>
+            1.8969060853123665e-02 -1.5130129456520081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 2.8807038906961679e-03</internalNodes>
+          <leafValues>
+            9.4285592436790466e-02 -3.1100749969482422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -3.2489649951457977e-02</internalNodes>
+          <leafValues>
+            -2.1908520162105560e-01 1.1370900273323059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 -3.8253709673881531e-02</internalNodes>
+          <leafValues>
+            3.7908008694648743e-01 -6.8298138678073883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -1.8478769809007645e-02</internalNodes>
+          <leafValues>
+            2.9623249173164368e-01 -6.0682911425828934e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 1.5569750219583511e-02</internalNodes>
+          <leafValues>
+            8.5731290280818939e-02 -3.3175340294837952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 -1.7486449796706438e-03</internalNodes>
+          <leafValues>
+            1.2554299831390381e-01 -1.9797539710998535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 9.0995557606220245e-02</internalNodes>
+          <leafValues>
+            -6.7590013146400452e-02 5.2676147222518921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -6.0815969482064247e-03</internalNodes>
+          <leafValues>
+            2.1883159875869751e-01 -1.5794619917869568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 1.3633850030601025e-02</internalNodes>
+          <leafValues>
+            1.2463530153036118e-01 -2.3396529257297516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -3.2046619057655334e-01</internalNodes>
+          <leafValues>
+            4.5808508992195129e-01 -2.7573259547352791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 -3.6630940157920122e-03</internalNodes>
+          <leafValues>
+            -2.4003350734710693e-01 1.2256260216236115e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>46</maxWeakCount>
+      <stageThreshold>-8.5974782705307007e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 452 -1.5901359915733337e-01</internalNodes>
+          <leafValues>
+            4.3535038828849792e-01 -1.7064349353313446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -8.1815905869007111e-03</internalNodes>
+          <leafValues>
+            -4.6280708909034729e-01 8.8514603674411774e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -7.1978997766564135e-06</internalNodes>
+          <leafValues>
+            1.6246670484542847e-01 -3.1899040937423706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 1.4128180220723152e-02</internalNodes>
+          <leafValues>
+            4.3259881436824799e-02 -5.9328877925872803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -9.5496661961078644e-03</internalNodes>
+          <leafValues>
+            -6.3987672328948975e-01 4.6203929930925369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -2.4156800936907530e-03</internalNodes>
+          <leafValues>
+            2.6009899377822876e-01 -1.7099030315876007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 4.4057718478143215e-03</internalNodes>
+          <leafValues>
+            -2.2679199278354645e-01 1.6393969953060150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 -3.3825438469648361e-02</internalNodes>
+          <leafValues>
+            -7.2834062576293945e-01 5.1699958741664886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 2.9628010466694832e-02</internalNodes>
+          <leafValues>
+            3.4399930387735367e-02 -6.9400608539581299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 1.2294690310955048e-01</internalNodes>
+          <leafValues>
+            3.3281920477747917e-03 -7.6602149009704590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -9.8816171288490295e-02</internalNodes>
+          <leafValues>
+            3.1439980864524841e-01 -1.0131180286407471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -3.3952430821955204e-03</internalNodes>
+          <leafValues>
+            3.3362209796905518e-02 -1.3168929517269135e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 2.4586699903011322e-02</internalNodes>
+          <leafValues>
+            -6.5227553248405457e-02 6.8169701099395752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 7.8804800286889076e-03</internalNodes>
+          <leafValues>
+            1.2926100194454193e-01 -4.3783390522003174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -9.1016880469396710e-04</internalNodes>
+          <leafValues>
+            1.3692790269851685e-01 -1.9827769696712494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 1.6178259626030922e-02</internalNodes>
+          <leafValues>
+            9.9287502467632294e-02 -3.4090539813041687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -1.0527680069208145e-01</internalNodes>
+          <leafValues>
+            -9.1738772392272949e-01 3.2674968242645264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -3.7090498954057693e-02</internalNodes>
+          <leafValues>
+            4.2047971487045288e-01 -7.1002766489982605e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 3.8721140474081039e-02</internalNodes>
+          <leafValues>
+            -7.3284432291984558e-02 4.8204809427261353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 -3.4923329949378967e-03</internalNodes>
+          <leafValues>
+            -2.8713211417198181e-01 1.0397130250930786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 -1.1214460246264935e-02</internalNodes>
+          <leafValues>
+            -5.1632231473922729e-01 5.4384410381317139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -2.2951549908611923e-04</internalNodes>
+          <leafValues>
+            -1.6355240345001221e-01 7.7216558158397675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 2.5744609534740448e-02</internalNodes>
+          <leafValues>
+            -5.7303100824356079e-02 4.9525278806686401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 3.7998620420694351e-02</internalNodes>
+          <leafValues>
+            2.7654580771923065e-02 -4.8470789194107056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 2.3906941059976816e-03</internalNodes>
+          <leafValues>
+            -2.0106680691242218e-01 1.6209079325199127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -1.2891319394111633e-01</internalNodes>
+          <leafValues>
+            -6.9726997613906860e-01 1.7226759344339371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 9.4630720559507608e-04</internalNodes>
+          <leafValues>
+            -2.7104228734970093e-01 1.0894539952278137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 3.2807278912514448e-03</internalNodes>
+          <leafValues>
+            -4.1949510574340820e-02 8.2179002463817596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 5.1204498857259750e-02</internalNodes>
+          <leafValues>
+            4.8180408775806427e-02 -6.6344922780990601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -4.5751508325338364e-02</internalNodes>
+          <leafValues>
+            1.9350789487361908e-01 -3.7223301827907562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 1.4391579665243626e-02</internalNodes>
+          <leafValues>
+            1.0828830301761627e-01 -2.3524640500545502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -7.6694227755069733e-03</internalNodes>
+          <leafValues>
+            7.7429883182048798e-02 -4.6658441424369812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 -4.9375209957361221e-02</internalNodes>
+          <leafValues>
+            3.5604238510131836e-01 -8.1731930375099182e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 4.9358978867530823e-02</internalNodes>
+          <leafValues>
+            5.0106838345527649e-02 -5.9273171424865723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 5.3014289587736130e-02</internalNodes>
+          <leafValues>
+            3.3155430108308792e-02 -7.0783668756484985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -1.2086739763617516e-02</internalNodes>
+          <leafValues>
+            1.4943680167198181e-01 -1.8973240256309509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -1.3579580187797546e-01</internalNodes>
+          <leafValues>
+            4.5863440632820129e-01 -7.1998342871665955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 1.9633909687399864e-03</internalNodes>
+          <leafValues>
+            -1.0420600324869156e-01 1.8465609848499298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 9.3589266762137413e-03</internalNodes>
+          <leafValues>
+            5.3957458585500717e-02 -4.7337940335273743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 4.3361759744584560e-03</internalNodes>
+          <leafValues>
+            -5.7173401117324829e-02 5.0958871841430664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 8.5009206086397171e-03</internalNodes>
+          <leafValues>
+            9.4076819717884064e-02 -2.9265969991683960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -1.9089920446276665e-02</internalNodes>
+          <leafValues>
+            3.5426521301269531e-01 -5.5876109749078751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -1.6061830101534724e-03</internalNodes>
+          <leafValues>
+            1.6634060442447662e-01 -1.5939429402351379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 -7.8830653801560402e-03</internalNodes>
+          <leafValues>
+            -2.6064670085906982e-01 5.5236898362636566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -3.2838371116667986e-03</internalNodes>
+          <leafValues>
+            -2.4924349784851074e-01 1.4288279414176941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 1.9204219803214073e-02</internalNodes>
+          <leafValues>
+            -2.6132659986615181e-02 3.2939550280570984e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>55</maxWeakCount>
+      <stageThreshold>-8.6706262826919556e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 498 -1.0141430050134659e-01</internalNodes>
+          <leafValues>
+            4.7197818756103516e-01 -1.8123960494995117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 -7.6708722114562988e-01</internalNodes>
+          <leafValues>
+            4.3214419484138489e-01 -1.0705640166997910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 8.0198869109153748e-03</internalNodes>
+          <leafValues>
+            8.4858916699886322e-02 -5.0163632631301880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 4.2173888534307480e-02</internalNodes>
+          <leafValues>
+            4.3612729758024216e-02 -6.5135252475738525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 4.0101539343595505e-03</internalNodes>
+          <leafValues>
+            -2.4151140451431274e-01 1.7029179632663727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -1.3389269588515162e-03</internalNodes>
+          <leafValues>
+            -1.8421310186386108e-01 9.2217013239860535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 3.3321550581604242e-03</internalNodes>
+          <leafValues>
+            -1.6709089279174805e-01 1.9239999353885651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 1.5524900518357754e-03</internalNodes>
+          <leafValues>
+            1.1113339662551880e-01 -3.1200349330902100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 2.3809259757399559e-02</internalNodes>
+          <leafValues>
+            -6.4096599817276001e-02 5.6162089109420776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 2.8085429221391678e-02</internalNodes>
+          <leafValues>
+            -2.2390459477901459e-01 1.6832110285758972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -4.7726151533424854e-03</internalNodes>
+          <leafValues>
+            -4.6150028705596924e-01 4.9433000385761261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 1.0531850159168243e-01</internalNodes>
+          <leafValues>
+            3.4683290868997574e-02 -6.4283651113510132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -7.2594000957906246e-03</internalNodes>
+          <leafValues>
+            -4.0418758988380432e-01 6.0901068150997162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 8.7005542591214180e-03</internalNodes>
+          <leafValues>
+            -7.5832478702068329e-02 8.9484892785549164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -5.3671520203351974e-02</internalNodes>
+          <leafValues>
+            7.3710972070693970e-01 -4.0993150323629379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 3.4521210938692093e-02</internalNodes>
+          <leafValues>
+            -1.3731540180742741e-02 2.7299648523330688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -7.2156880050897598e-03</internalNodes>
+          <leafValues>
+            1.2723149359226227e-01 -2.3329609632492065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 1.7666360363364220e-03</internalNodes>
+          <leafValues>
+            5.7977691292762756e-02 -2.0036549866199493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 3.8101759273558855e-03</internalNodes>
+          <leafValues>
+            7.3866911232471466e-02 -3.0780071020126343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 -2.5019630789756775e-02</internalNodes>
+          <leafValues>
+            4.3502670526504517e-01 -4.8294428735971451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 9.7328815609216690e-03</internalNodes>
+          <leafValues>
+            -8.3063952624797821e-02 3.0008700489997864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -3.3074519596993923e-03</internalNodes>
+          <leafValues>
+            1.3591299951076508e-01 -2.2476670145988464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 -1.9178609549999237e-01</internalNodes>
+          <leafValues>
+            -8.7936902046203613e-01 2.7915079146623611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 6.0892169130966067e-04</internalNodes>
+          <leafValues>
+            -2.2891379892826080e-01 1.0236170142889023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 -7.7072591520845890e-03</internalNodes>
+          <leafValues>
+            -2.4917750060558319e-01 9.4315156340599060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 -1.0916110128164291e-01</internalNodes>
+          <leafValues>
+            5.5664068460464478e-01 -4.7419041395187378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -6.3703782856464386e-02</internalNodes>
+          <leafValues>
+            -2.1503069996833801e-01 1.0655879974365234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -2.6704160496592522e-02</internalNodes>
+          <leafValues>
+            3.3017820119857788e-01 -9.3569032847881317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 -2.7289129793643951e-03</internalNodes>
+          <leafValues>
+            8.6531341075897217e-02 -2.6623091101646423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -1.0575050115585327e-01</internalNodes>
+          <leafValues>
+            -1. 5.9039499610662460e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 1.8904829397797585e-02</internalNodes>
+          <leafValues>
+            -6.2077309936285019e-02 4.7796338796615601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 -1.6396720707416534e-01</internalNodes>
+          <leafValues>
+            -1. 1.0493510402739048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 1.0453710332512856e-02</internalNodes>
+          <leafValues>
+            1.2688960134983063e-01 -2.0351530611515045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 1.3724270462989807e-01</internalNodes>
+          <leafValues>
+            9.6491426229476929e-03 -3.7908729910850525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -5.0359591841697693e-03</internalNodes>
+          <leafValues>
+            -2.5936231017112732e-01 1.1745890229940414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 6.5677291713654995e-03</internalNodes>
+          <leafValues>
+            -6.0465291142463684e-02 1.5637819468975067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -3.0346989631652832e-02</internalNodes>
+          <leafValues>
+            3.8403400778770447e-01 -6.1477359384298325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 1.7546329647302628e-02</internalNodes>
+          <leafValues>
+            2.8643229976296425e-02 -4.7679468989372253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 -4.5566740445792675e-03</internalNodes>
+          <leafValues>
+            -3.1261089444160461e-01 1.0885629802942276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -6.9851092994213104e-02</internalNodes>
+          <leafValues>
+            -7.0994102954864502e-01 1.8536770716309547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 -1.4962710338295437e-05</internalNodes>
+          <leafValues>
+            1.0287140309810638e-01 -2.2921159863471985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -7.2705000638961792e-02</internalNodes>
+          <leafValues>
+            4.2520120739936829e-01 -2.8236340731382370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 3.7338290363550186e-02</internalNodes>
+          <leafValues>
+            -7.6630033552646637e-02 3.2374149560928345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 2.8690960258245468e-02</internalNodes>
+          <leafValues>
+            3.0029499903321266e-02 -8.4007978439331055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 1.0019769892096519e-02</internalNodes>
+          <leafValues>
+            -7.9071857035160065e-02 3.4019070863723755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 -3.9540659636259079e-03</internalNodes>
+          <leafValues>
+            -2.4449679255485535e-01 1.1845660209655762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 -8.2879550755023956e-03</internalNodes>
+          <leafValues>
+            1.0628750175237656e-01 -2.2044150531291962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -3.4582480788230896e-02</internalNodes>
+          <leafValues>
+            -7.1333628892898560e-01 2.9727920889854431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 -1.4701869804412127e-03</internalNodes>
+          <leafValues>
+            1.2630669772624969e-01 -1.8260860443115234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -1.8792560324072838e-02</internalNodes>
+          <leafValues>
+            4.4159510731697083e-01 -6.2980100512504578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 -1.9830280914902687e-02</internalNodes>
+          <leafValues>
+            -2.8308698534965515e-01 9.2180028557777405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -1.6321459412574768e-01</internalNodes>
+          <leafValues>
+            -4.1355830430984497e-01 1.1562050320208073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 7.5624987483024597e-02</internalNodes>
+          <leafValues>
+            2.2105440497398376e-02 -9.1430252790451050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -2.2491789422929287e-03</internalNodes>
+          <leafValues>
+            9.1926686465740204e-02 -1.0633769631385803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 -6.3310638070106506e-02</internalNodes>
+          <leafValues>
+            -7.7100628614425659e-01 2.7047479525208473e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>60</maxWeakCount>
+      <stageThreshold>-8.9544051885604858e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 553 -1.7043270170688629e-01</internalNodes>
+          <leafValues>
+            4.7425061464309692e-01 -1.8581479787826538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 2.7967130765318871e-02</internalNodes>
+          <leafValues>
+            -8.6291179060935974e-02 5.3257989883422852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 2.0941249385941774e-04</internalNodes>
+          <leafValues>
+            -2.7199700474739075e-01 1.3615070283412933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -3.3637240529060364e-02</internalNodes>
+          <leafValues>
+            2.8299760818481445e-01 -2.2356469184160233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 -4.5356429181993008e-03</internalNodes>
+          <leafValues>
+            1.6135759651660919e-01 -2.0162500441074371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 3.3124668989330530e-03</internalNodes>
+          <leafValues>
+            -7.9677619040012360e-02 1.4375239610671997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -5.4888740181922913e-02</internalNodes>
+          <leafValues>
+            6.6563862562179565e-01 -5.3526669740676880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 5.3796600550413132e-03</internalNodes>
+          <leafValues>
+            -9.6400886774063110e-02 9.3223050236701965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -6.0283239930868149e-02</internalNodes>
+          <leafValues>
+            -5.4325622320175171e-01 5.4515969008207321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 8.4590855985879898e-03</internalNodes>
+          <leafValues>
+            5.0189521163702011e-02 -3.7638399004936218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 2.8549430426210165e-03</internalNodes>
+          <leafValues>
+            1.3105809688568115e-01 -2.4903079867362976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 -2.0608250051736832e-02</internalNodes>
+          <leafValues>
+            -4.3393260240554810e-01 6.0918930917978287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -1.0088419541716576e-02</internalNodes>
+          <leafValues>
+            2.9433688521385193e-01 -1.0092660039663315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -5.9431340545415878e-02</internalNodes>
+          <leafValues>
+            -9.0102052688598633e-01 2.7330689132213593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 -2.4024050217121840e-03</internalNodes>
+          <leafValues>
+            1.2758029997348785e-01 -1.9134059548377991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -2.7372820302844048e-02</internalNodes>
+          <leafValues>
+            -2.8051578998565674e-01 1.0892979800701141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 -7.3817551136016846e-02</internalNodes>
+          <leafValues>
+            3.6636620759963989e-01 -7.1261473000049591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -6.9365866482257843e-02</internalNodes>
+          <leafValues>
+            4.4759741425514221e-01 -3.5112198442220688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 -1.2530760141089559e-03</internalNodes>
+          <leafValues>
+            1.0481069982051849e-01 -2.5331568717956543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -3.2429681159555912e-03</internalNodes>
+          <leafValues>
+            -2.1083809435367584e-01 8.9755013585090637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 1.6115259379148483e-02</internalNodes>
+          <leafValues>
+            -5.8019161224365234e-02 5.5759441852569580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 6.2562932725995779e-04</internalNodes>
+          <leafValues>
+            -2.1611200273036957e-01 1.2215120345354080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 -7.6641827821731567e-01</internalNodes>
+          <leafValues>
+            -6.3647639751434326e-01 3.3915121108293533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 -7.4419458542251959e-06</internalNodes>
+          <leafValues>
+            9.5346711575984955e-02 -2.3950740694999695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 -3.7739300751127303e-04</internalNodes>
+          <leafValues>
+            1.4481280744075775e-01 -1.8476490676403046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 7.6729603111743927e-02</internalNodes>
+          <leafValues>
+            1.1742720380425453e-02 -9.6213918924331665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -4.4697099365293980e-03</internalNodes>
+          <leafValues>
+            -2.3385390639305115e-01 1.0464339703321457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 7.5911812484264374e-02</internalNodes>
+          <leafValues>
+            6.7219119518995285e-03 -4.2311188578605652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -8.3202589303255081e-03</internalNodes>
+          <leafValues>
+            3.2122060656547546e-01 -8.3661839365959167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 -3.7233818322420120e-02</internalNodes>
+          <leafValues>
+            1.1662390083074570e-01 -2.3976010084152222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -2.1381198894232512e-03</internalNodes>
+          <leafValues>
+            8.4755808115005493e-02 -2.5149530172348022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -4.4315438717603683e-03</internalNodes>
+          <leafValues>
+            -1.0990399867296219e-01 6.6713362932205200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -1.0959600098431110e-02</internalNodes>
+          <leafValues>
+            2.8818470239639282e-01 -7.7696867287158966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 3.4907169640064240e-02</internalNodes>
+          <leafValues>
+            -1.1712339706718922e-02 3.9965820312500000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 -1.3335079886019230e-02</internalNodes>
+          <leafValues>
+            -4.9896249175071716e-01 5.3193040192127228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -3.7070110440254211e-02</internalNodes>
+          <leafValues>
+            -5.9346628189086914e-01 1.2502389959990978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 -9.1118857264518738e-02</internalNodes>
+          <leafValues>
+            -6.0664188861846924e-01 3.0223639681935310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 -6.7527957260608673e-02</internalNodes>
+          <leafValues>
+            3.2593071460723877e-01 -3.2810360193252563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 -2.6317719370126724e-02</internalNodes>
+          <leafValues>
+            -7.6599878072738647e-01 2.5263689458370209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 3.7877839058637619e-02</internalNodes>
+          <leafValues>
+            1.7415969632565975e-03 -9.1090667247772217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 1.6833839472383261e-03</internalNodes>
+          <leafValues>
+            -6.4769007265567780e-02 3.5946249961853027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 -4.2451170884305611e-05</internalNodes>
+          <leafValues>
+            6.2228899449110031e-02 -8.5069350898265839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 2.7713281451724470e-04</internalNodes>
+          <leafValues>
+            -1.7252549529075623e-01 1.2511169910430908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -3.0400960240513086e-03</internalNodes>
+          <leafValues>
+            1.5032739937305450e-01 -1.4423249661922455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 -5.4823148995637894e-02</internalNodes>
+          <leafValues>
+            3.4711471199989319e-01 -6.3294216990470886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 1.4232549583539367e-03</internalNodes>
+          <leafValues>
+            7.3755688965320587e-02 -2.7084198594093323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 -3.3660030458122492e-03</internalNodes>
+          <leafValues>
+            -2.3144030570983887e-01 8.8216871023178101e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -1.1405759723857045e-03</internalNodes>
+          <leafValues>
+            1.5687429904937744e-01 -1.3379560410976410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 3.7445020861923695e-03</internalNodes>
+          <leafValues>
+            -1.2132400274276733e-01 2.2723269462585449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 1.6585510224103928e-02</internalNodes>
+          <leafValues>
+            5.4631579667329788e-02 -1.0117000341415405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 -2.9970710165798664e-03</internalNodes>
+          <leafValues>
+            1.7258630692958832e-01 -1.4288370311260223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -3.0509869102388620e-03</internalNodes>
+          <leafValues>
+            1.0889530181884766e-01 -1.2865459918975830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -2.7037179097533226e-02</internalNodes>
+          <leafValues>
+            -2.1809040009975433e-01 1.0335580259561539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -1.4020490460097790e-02</internalNodes>
+          <leafValues>
+            1.7013829946517944e-01 -4.6483799815177917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 4.0001110173761845e-03</internalNodes>
+          <leafValues>
+            6.1452940106391907e-02 -3.5107728838920593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 1.1888570152223110e-02</internalNodes>
+          <leafValues>
+            -6.5659493207931519e-02 3.4128171205520630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.0041910223662853e-02</internalNodes>
+          <leafValues>
+            1.0645069926977158e-01 -2.3905399441719055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -8.3469128003343940e-04</internalNodes>
+          <leafValues>
+            1.1359920352697372e-01 -1.2456230074167252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 -8.4286198019981384e-02</internalNodes>
+          <leafValues>
+            4.4472348690032959e-01 -4.6677689999341965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -1.2084700167179108e-02</internalNodes>
+          <leafValues>
+            -3.1389999389648438e-01 8.1864818930625916e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>69</maxWeakCount>
+      <stageThreshold>-8.5815817117691040e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 613 -6.6878342628479004e-01</internalNodes>
+          <leafValues>
+            4.1411510109901428e-01 -1.8810300529003143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 3.4350738860666752e-04</internalNodes>
+          <leafValues>
+            -1.5680180490016937e-01 1.0782240331172943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 2.6565280277282000e-03</internalNodes>
+          <leafValues>
+            -2.2030730545520782e-01 2.1439610421657562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -1.9296359270811081e-02</internalNodes>
+          <leafValues>
+            4.2026680707931519e-01 -6.8671546876430511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -6.6540208645164967e-03</internalNodes>
+          <leafValues>
+            -2.3488819599151611e-01 1.6749989986419678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 1.5521990135312080e-02</internalNodes>
+          <leafValues>
+            1.9785670563578606e-02 -3.9180341362953186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 8.0317907035350800e-02</internalNodes>
+          <leafValues>
+            -1.9278699532151222e-02 5.8520817756652832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -1.0220059752464294e-01</internalNodes>
+          <leafValues>
+            -8.1461167335510254e-01 8.9545976370573044e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 -1.0618870146572590e-02</internalNodes>
+          <leafValues>
+            1.8044769763946533e-01 -2.1122869849205017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 9.8658069968223572e-02</internalNodes>
+          <leafValues>
+            -4.9179349094629288e-02 2.1871259808540344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -6.6758222877979279e-02</internalNodes>
+          <leafValues>
+            -2.6649540662765503e-01 1.0707940161228180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 -2.9256459325551987e-02</internalNodes>
+          <leafValues>
+            -7.8809207677841187e-01 5.6176739744842052e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -1.2126189656555653e-02</internalNodes>
+          <leafValues>
+            1.0218500345945358e-01 -2.2899429500102997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -5.4919619113206863e-02</internalNodes>
+          <leafValues>
+            -5.3647202253341675e-01 1.4213330112397671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 -4.0985811501741409e-03</internalNodes>
+          <leafValues>
+            -3.1650361418724060e-01 7.6794192194938660e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 -6.2581077218055725e-02</internalNodes>
+          <leafValues>
+            -4.8726239800453186e-01 9.1610476374626160e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 4.9834471195936203e-02</internalNodes>
+          <leafValues>
+            -7.5687482953071594e-02 2.9998108744621277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 1.0333029925823212e-01</internalNodes>
+          <leafValues>
+            3.3387999981641769e-02 -5.6652718782424927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 -2.6153959333896637e-02</internalNodes>
+          <leafValues>
+            4.4663658738136292e-01 -5.7146150618791580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 6.8949297070503235e-02</internalNodes>
+          <leafValues>
+            6.6676470451056957e-03 -9.9968850612640381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 2.1299200598150492e-03</internalNodes>
+          <leafValues>
+            -1.8253549933433533e-01 1.2543450295925140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 -4.4991839677095413e-02</internalNodes>
+          <leafValues>
+            -5.6401151418685913e-01 3.7286750972270966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 2.2533860057592392e-02</internalNodes>
+          <leafValues>
+            -4.2648501694202423e-02 5.9839051961898804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 1.9274459779262543e-01</internalNodes>
+          <leafValues>
+            3.0479490756988525e-02 -8.4564548730850220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -9.2559499898925424e-04</internalNodes>
+          <leafValues>
+            -2.0614519715309143e-01 1.1016649752855301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 -3.6584408953785896e-03</internalNodes>
+          <leafValues>
+            9.1432936489582062e-02 -8.2888223230838776e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 3.3741090446710587e-03</internalNodes>
+          <leafValues>
+            8.0734901130199432e-02 -3.0495160818099976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 -5.1757801324129105e-02</internalNodes>
+          <leafValues>
+            -8.0067127943038940e-01 2.8978339396417141e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 1.0498389601707458e-03</internalNodes>
+          <leafValues>
+            -1.8396970629692078e-01 1.3429929316043854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 7.5232777744531631e-03</internalNodes>
+          <leafValues>
+            -3.1206240877509117e-02 1.2124940007925034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -7.1075286541599780e-05</internalNodes>
+          <leafValues>
+            8.4017656743526459e-02 -2.5043961405754089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 1.1362830176949501e-02</internalNodes>
+          <leafValues>
+            -7.6280519366264343e-02 2.0559790730476379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -2.4097480345517397e-03</internalNodes>
+          <leafValues>
+            -1.5042850375175476e-01 1.6493639349937439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 2.4056989699602127e-02</internalNodes>
+          <leafValues>
+            1.4566550031304359e-02 -9.0886771678924561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -2.3983620107173920e-02</internalNodes>
+          <leafValues>
+            3.9107671380043030e-01 -5.4178200662136078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 -2.1438319236040115e-02</internalNodes>
+          <leafValues>
+            -4.8545840382575989e-01 4.0402751415967941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 1.5210740268230438e-02</internalNodes>
+          <leafValues>
+            3.4481588751077652e-02 -5.4406332969665527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 1.1712989769876003e-02</internalNodes>
+          <leafValues>
+            -6.5206751227378845e-02 4.1007021069526672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 6.3996820244938135e-04</internalNodes>
+          <leafValues>
+            -1.4772899448871613e-01 1.5154249966144562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -3.4567480906844139e-03</internalNodes>
+          <leafValues>
+            6.3351117074489594e-02 -1.4297829568386078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -1.2475489638745785e-03</internalNodes>
+          <leafValues>
+            -1.8521060049533844e-01 1.3410830497741699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 6.6904430277645588e-03</internalNodes>
+          <leafValues>
+            1.4112530648708344e-01 -1.8778939545154572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -6.9181032478809357e-02</internalNodes>
+          <leafValues>
+            3.4451478719711304e-01 -8.4655232727527618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -6.7893281579017639e-02</internalNodes>
+          <leafValues>
+            -7.0076942443847656e-01 2.3327259346842766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -8.5538747953251004e-04</internalNodes>
+          <leafValues>
+            9.2393256723880768e-02 -2.1416470408439636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 1.7967769503593445e-01</internalNodes>
+          <leafValues>
+            2.9103670269250870e-02 -7.8690862655639648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -2.9843579977750778e-03</internalNodes>
+          <leafValues>
+            1.6117380559444427e-01 -1.2868699431419373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 1.9973449409008026e-02</internalNodes>
+          <leafValues>
+            3.6350231617689133e-02 -5.9400641918182373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -8.3998020272701979e-04</internalNodes>
+          <leafValues>
+            1.1332140117883682e-01 -1.9175720214843750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 5.0804121419787407e-03</internalNodes>
+          <leafValues>
+            5.3663559257984161e-02 -2.7940011024475098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 7.3341121897101402e-03</internalNodes>
+          <leafValues>
+            -1.6792379319667816e-01 1.2119220197200775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 7.6924441382288933e-03</internalNodes>
+          <leafValues>
+            -6.9076187908649445e-02 1.8550349771976471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 2.0062309340573847e-04</internalNodes>
+          <leafValues>
+            -2.0654049515724182e-01 9.7337253391742706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 2.6919560506939888e-02</internalNodes>
+          <leafValues>
+            -2.3648599162697792e-02 6.4873528480529785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 -2.7951570227742195e-03</internalNodes>
+          <leafValues>
+            -2.0725600421428680e-01 1.0188090056180954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 7.8026622533798218e-02</internalNodes>
+          <leafValues>
+            8.9439805597066879e-03 -3.9990609884262085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -1.0000459849834442e-01</internalNodes>
+          <leafValues>
+            3.7361750006675720e-01 -5.5814821273088455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -1.4978240430355072e-01</internalNodes>
+          <leafValues>
+            3.8677608966827393e-01 -5.5641401559114456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 3.3566348254680634e-02</internalNodes>
+          <leafValues>
+            7.5311936438083649e-02 -3.2007390260696411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 -2.1213890612125397e-01</internalNodes>
+          <leafValues>
+            -5.9270721673965454e-01 4.9450621008872986e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -1.4402889646589756e-02</internalNodes>
+          <leafValues>
+            3.2471069693565369e-01 -5.8492168784141541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -1.8413169309496880e-02</internalNodes>
+          <leafValues>
+            -9.6801750361919403e-02 1.0343659669160843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 1.6228349879384041e-02</internalNodes>
+          <leafValues>
+            -6.0577668249607086e-02 3.1738010048866272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -6.7683439701795578e-03</internalNodes>
+          <leafValues>
+            -1.9742150604724884e-01 2.7996420860290527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -1.9165309146046638e-02</internalNodes>
+          <leafValues>
+            -2.5684070587158203e-01 8.3432748913764954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 2.8667549486272037e-04</internalNodes>
+          <leafValues>
+            -1.5241080522537231e-01 1.4404779672622681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 9.4157401472330093e-03</internalNodes>
+          <leafValues>
+            -7.3207639157772064e-02 3.3655610680580139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 2.3321900516748428e-02</internalNodes>
+          <leafValues>
+            -6.1898268759250641e-02 8.3489909768104553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 -1.1910670436918736e-02</internalNodes>
+          <leafValues>
+            -1.9628530740737915e-01 9.6807330846786499e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>63</maxWeakCount>
+      <stageThreshold>-7.2787708044052124e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 682 -9.4191312789916992e-02</internalNodes>
+          <leafValues>
+            4.7028279304504395e-01 -1.4449509978294373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 -6.9314462598413229e-04</internalNodes>
+          <leafValues>
+            1.7749489843845367e-01 -1.8127989768981934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 -1.2782390415668488e-01</internalNodes>
+          <leafValues>
+            2.9733940958976746e-01 -1.0098580271005630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -2.5297680404037237e-03</internalNodes>
+          <leafValues>
+            1.0854879766702652e-01 -1.3471469283103943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 -2.5406670756638050e-03</internalNodes>
+          <leafValues>
+            -2.7025818824768066e-01 1.0289029777050018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 -1.5717690112069249e-03</internalNodes>
+          <leafValues>
+            1.7058460414409637e-01 -1.0923519730567932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 1.4790190383791924e-02</internalNodes>
+          <leafValues>
+            2.3690680041909218e-02 -5.1412177085876465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 -1.1837840080261230e-02</internalNodes>
+          <leafValues>
+            1.5754750370979309e-01 -2.7252310886979103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -3.8180808769538999e-04</internalNodes>
+          <leafValues>
+            1.0274309664964676e-01 -2.1815380454063416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 5.0768889486789703e-02</internalNodes>
+          <leafValues>
+            7.3335068300366402e-03 -8.5053902864456177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 2.2738629952073097e-02</internalNodes>
+          <leafValues>
+            -4.3974649161100388e-02 5.0167572498321533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 7.3323072865605354e-04</internalNodes>
+          <leafValues>
+            -9.8431721329689026e-02 1.1515360325574875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 1.1889509623870254e-03</internalNodes>
+          <leafValues>
+            -2.2443179786205292e-01 1.0813289880752563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 -3.2934029586613178e-03</internalNodes>
+          <leafValues>
+            7.1840867400169373e-02 -8.0868020653724670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -3.0113169923424721e-03</internalNodes>
+          <leafValues>
+            -2.9698678851127625e-01 7.9700268805027008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -1.5521480236202478e-03</internalNodes>
+          <leafValues>
+            1.8694180250167847e-01 -1.1467470228672028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -1.0300680063664913e-02</internalNodes>
+          <leafValues>
+            -2.9109370708465576e-01 6.7836336791515350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -2.6368349790573120e-03</internalNodes>
+          <leafValues>
+            1.1284109950065613e-01 -7.3468528687953949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 -3.2815459417179227e-04</internalNodes>
+          <leafValues>
+            8.1921890377998352e-02 -2.4893359839916229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -3.4514568746089935e-02</internalNodes>
+          <leafValues>
+            4.2230990529060364e-01 -3.4608390182256699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 2.1102999744471163e-04</internalNodes>
+          <leafValues>
+            -1.9479750096797943e-01 1.1572039872407913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 -4.4254157692193985e-03</internalNodes>
+          <leafValues>
+            -1.9316120445728302e-01 5.8137431740760803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 -1.7686230130493641e-03</internalNodes>
+          <leafValues>
+            -1.7518809437751770e-01 1.4515039324760437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 -3.3355921041220427e-03</internalNodes>
+          <leafValues>
+            2.2621470689773560e-01 -1.0195499658584595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 4.5241121202707291e-02</internalNodes>
+          <leafValues>
+            3.3572640269994736e-02 -6.6535997390747070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -2.7708040550351143e-02</internalNodes>
+          <leafValues>
+            -4.7514501214027405e-01 1.6605619341135025e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -6.0042630881071091e-02</internalNodes>
+          <leafValues>
+            2.7002659440040588e-01 -7.5283601880073547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 9.3657420948147774e-03</internalNodes>
+          <leafValues>
+            -5.2090760320425034e-02 3.4359771013259888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 2.2545119747519493e-02</internalNodes>
+          <leafValues>
+            4.5823760330677032e-02 -5.3111177682876587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 -6.6756099462509155e-02</internalNodes>
+          <leafValues>
+            5.1867592334747314e-01 -1.0766089893877506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 4.3578571639955044e-03</internalNodes>
+          <leafValues>
+            -1.6680300235748291e-01 1.3410590589046478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -3.6338180303573608e-02</internalNodes>
+          <leafValues>
+            -5.4825192689895630e-01 1.8291600048542023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 -4.5509558171033859e-02</internalNodes>
+          <leafValues>
+            3.9119181036949158e-01 -5.4338268935680389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 6.2883161008358002e-03</internalNodes>
+          <leafValues>
+            9.5495186746120453e-02 -2.4893720448017120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 1.5809159958735108e-03</internalNodes>
+          <leafValues>
+            -1.6792270541191101e-01 1.1553759872913361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -1.5780210494995117e-01</internalNodes>
+          <leafValues>
+            -6.9598740339279175e-01 3.1015299260616302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -5.0400748848915100e-02</internalNodes>
+          <leafValues>
+            -6.1013418436050415e-01 2.5600189343094826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -8.3708087913691998e-04</internalNodes>
+          <leafValues>
+            6.3689701259136200e-02 -3.2572910189628601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 5.2259840071201324e-02</internalNodes>
+          <leafValues>
+            -5.2639529109001160e-02 4.3018800020217896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 6.6796218743547797e-04</internalNodes>
+          <leafValues>
+            8.0761440098285675e-02 -2.5092118978500366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 -3.6306399852037430e-02</internalNodes>
+          <leafValues>
+            7.2837859392166138e-01 -2.8703549876809120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 -7.5823411345481873e-02</internalNodes>
+          <leafValues>
+            -7.6045262813568115e-01 1.3166300021111965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 -5.5567082017660141e-03</internalNodes>
+          <leafValues>
+            1.1258409917354584e-01 -1.9850979745388031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 3.1275521032512188e-03</internalNodes>
+          <leafValues>
+            -1.0436189919710159e-01 1.0283000022172928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 2.7931319549679756e-02</internalNodes>
+          <leafValues>
+            4.7023560851812363e-02 -4.7727531194686890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 1.5156970359385014e-02</internalNodes>
+          <leafValues>
+            -4.9909379333257675e-02 2.1705010533332825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 6.8009081296622753e-03</internalNodes>
+          <leafValues>
+            1.1713290214538574e-01 -2.2082920372486115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 -4.3796948157250881e-03</internalNodes>
+          <leafValues>
+            1.7191199958324432e-01 -8.9668810367584229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 -6.9269728846848011e-03</internalNodes>
+          <leafValues>
+            8.8258482515811920e-02 -2.6454809308052063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -2.0586250722408295e-01</internalNodes>
+          <leafValues>
+            -5.0262999534606934e-01 4.0832251310348511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 -1.1398729839129373e-04</internalNodes>
+          <leafValues>
+            1.0535170137882233e-01 -1.9488720595836639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 3.6993779242038727e-02</internalNodes>
+          <leafValues>
+            -5.4779630154371262e-02 2.2932989895343781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 4.7788480296730995e-03</internalNodes>
+          <leafValues>
+            9.1294333338737488e-02 -2.4968950450420380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 1.1999059934169054e-03</internalNodes>
+          <leafValues>
+            -9.2685289680957794e-02 1.1050710082054138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 2.0830740686506033e-03</internalNodes>
+          <leafValues>
+            -1.0583080351352692e-01 1.7405270040035248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 2.7166489511728287e-02</internalNodes>
+          <leafValues>
+            1.1538780294358730e-02 -1.0000569820404053e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -4.3531907722353935e-03</internalNodes>
+          <leafValues>
+            -2.6105979084968567e-01 7.8109443187713623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -1.6676170751452446e-02</internalNodes>
+          <leafValues>
+            -6.3766658306121826e-01 1.2807319872081280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 -1.7588710179552436e-03</internalNodes>
+          <leafValues>
+            1.5328720211982727e-01 -1.4830219745635986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -1.3470610138028860e-03</internalNodes>
+          <leafValues>
+            1.1022730171680450e-01 -1.1166580021381378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 -7.7226730063557625e-03</internalNodes>
+          <leafValues>
+            2.6749759912490845e-01 -8.4375701844692230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 2.4557989090681076e-02</internalNodes>
+          <leafValues>
+            1.1705229990184307e-02 -6.9936311244964600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -4.1882451623678207e-03</internalNodes>
+          <leafValues>
+            -2.0845660567283630e-01 1.1073870211839676e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>67</maxWeakCount>
+      <stageThreshold>-7.7944219112396240e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 745 -3.0925211310386658e-01</internalNodes>
+          <leafValues>
+            3.1520840525627136e-01 -1.6629250347614288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 3.8660250604152679e-02</internalNodes>
+          <leafValues>
+            -5.7934600859880447e-02 4.5278790593147278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 -1.8853870034217834e-01</internalNodes>
+          <leafValues>
+            -8.2013928890228271e-01 3.0941359698772430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 7.1423681220039725e-04</internalNodes>
+          <leafValues>
+            1.0280930250883102e-01 -2.4902869760990143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -7.2074443101882935e-02</internalNodes>
+          <leafValues>
+            3.3171579241752625e-01 -7.3685511946678162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 9.4616664573550224e-03</internalNodes>
+          <leafValues>
+            3.2647788524627686e-02 -3.6112511157989502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -4.6513080596923828e-02</internalNodes>
+          <leafValues>
+            -4.7550851106643677e-01 5.6877400726079941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 -3.4777458757162094e-02</internalNodes>
+          <leafValues>
+            -6.3515567779541016e-01 3.1314119696617126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -1.4840300427749753e-03</internalNodes>
+          <leafValues>
+            9.2628233134746552e-02 -2.5283080339431763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 8.3039281889796257e-03</internalNodes>
+          <leafValues>
+            3.3991388976573944e-02 -1.8357479572296143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 2.7342209592461586e-02</internalNodes>
+          <leafValues>
+            -5.1393941044807434e-02 5.5958998203277588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 5.8637421578168869e-02</internalNodes>
+          <leafValues>
+            -5.7350661605596542e-02 1.4842259883880615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 -3.7032511085271835e-02</internalNodes>
+          <leafValues>
+            -4.0602868795394897e-01 6.6790133714675903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 8.9913606643676758e-03</internalNodes>
+          <leafValues>
+            -1.9094319641590118e-01 5.9438090771436691e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -5.9351198375225067e-02</internalNodes>
+          <leafValues>
+            -8.7097257375717163e-01 2.1483449265360832e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 3.7055540084838867e-01</internalNodes>
+          <leafValues>
+            -4.0396090596914291e-02 6.0631322860717773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -8.4517069626599550e-04</internalNodes>
+          <leafValues>
+            1.3660719990730286e-01 -1.5541790425777435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 1.0664479807019234e-02</internalNodes>
+          <leafValues>
+            3.4129761159420013e-02 -2.3508089780807495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 3.7040449678897858e-03</internalNodes>
+          <leafValues>
+            1.1293920129537582e-01 -1.5596470236778259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 2.3328550159931183e-02</internalNodes>
+          <leafValues>
+            3.6770980805158615e-02 -1.6631129384040833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 2.0906640216708183e-02</internalNodes>
+          <leafValues>
+            -7.3391966521739960e-02 3.2708668708801270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 2.0865180995315313e-03</internalNodes>
+          <leafValues>
+            9.6375763416290283e-02 -2.1638840436935425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 1.2039430439472198e-03</internalNodes>
+          <leafValues>
+            -1.7018699645996094e-01 1.0815030336380005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 3.3848760649561882e-03</internalNodes>
+          <leafValues>
+            -1.0820890218019485e-01 9.0751953423023224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -1.5309279784560204e-02</internalNodes>
+          <leafValues>
+            -6.2071442604064941e-01 3.1353730708360672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 2.1820720285177231e-02</internalNodes>
+          <leafValues>
+            -5.7232249528169632e-02 2.9141768813133240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 5.8554150164127350e-03</internalNodes>
+          <leafValues>
+            5.5810708552598953e-02 -3.4557789564132690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -8.8380590081214905e-02</internalNodes>
+          <leafValues>
+            -5.8971607685089111e-01 3.2257869839668274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -3.6303598433732986e-02</internalNodes>
+          <leafValues>
+            6.7906290292739868e-01 -3.1298439949750900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 6.7714422941207886e-02</internalNodes>
+          <leafValues>
+            2.8151830658316612e-02 -7.5963890552520752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -1.7487880541011691e-03</internalNodes>
+          <leafValues>
+            1.3521270453929901e-01 -1.4939880371093750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 5.7627420872449875e-02</internalNodes>
+          <leafValues>
+            1.4716790057718754e-02 -6.4088898897171021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 4.8004398122429848e-03</internalNodes>
+          <leafValues>
+            5.7510860264301300e-02 -3.0728340148925781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 1.5568589791655540e-02</internalNodes>
+          <leafValues>
+            -2.6860829442739487e-02 3.9390829205513000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -9.9650640040636063e-03</internalNodes>
+          <leafValues>
+            3.2090151309967041e-01 -5.8974441140890121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 -9.1902203857898712e-03</internalNodes>
+          <leafValues>
+            -3.8006910681724548e-01 3.5807169973850250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 3.0834939330816269e-02</internalNodes>
+          <leafValues>
+            4.0354121476411819e-02 -5.0782901048660278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -6.4900278812274337e-04</internalNodes>
+          <leafValues>
+            9.5597133040428162e-02 -1.8812850117683411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 -3.9334357716143131e-03</internalNodes>
+          <leafValues>
+            -2.0279949903488159e-01 1.0514850169420242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 -2.1477680653333664e-02</internalNodes>
+          <leafValues>
+            -3.2985571026802063e-01 3.5263378173112869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -2.7516249567270279e-02</internalNodes>
+          <leafValues>
+            3.4558650851249695e-01 -7.2544910013675690e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -7.2914459742605686e-03</internalNodes>
+          <leafValues>
+            1.0051680356264114e-01 -1.3560770452022552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -5.6135728955268860e-02</internalNodes>
+          <leafValues>
+            4.0078470110893250e-01 -5.1991838961839676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 1.3679620623588562e-01</internalNodes>
+          <leafValues>
+            -1.6432780772447586e-02 5.6100088357925415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -2.4549920111894608e-02</internalNodes>
+          <leafValues>
+            -1.8187479674816132e-01 1.4125369489192963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 4.6405121684074402e-03</internalNodes>
+          <leafValues>
+            -1.6500659286975861e-01 1.4912450313568115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -2.1023359149694443e-02</internalNodes>
+          <leafValues>
+            -1.9611929357051849e-01 9.9226936697959900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 -4.8856949433684349e-03</internalNodes>
+          <leafValues>
+            1.1330509930849075e-01 -8.0172486603260040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 -1.7337809503078461e-01</internalNodes>
+          <leafValues>
+            -8.3458930253982544e-01 2.3691669106483459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 -9.2903972836211324e-04</internalNodes>
+          <leafValues>
+            8.5904203355312347e-02 -1.0580120235681534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -1.0562090203166008e-02</internalNodes>
+          <leafValues>
+            2.6989871263504028e-01 -6.7542143166065216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 1.5071259811520576e-02</internalNodes>
+          <leafValues>
+            5.8657489717006683e-02 -3.2436290383338928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 -1.8616430461406708e-02</internalNodes>
+          <leafValues>
+            3.5660719871520996e-01 -5.3099378943443298e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 8.4412463009357452e-02</internalNodes>
+          <leafValues>
+            1.7715929076075554e-02 -4.5803558826446533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 5.1138769835233688e-02</internalNodes>
+          <leafValues>
+            1.7407679930329323e-02 -9.4110202789306641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -1.0613460093736649e-02</internalNodes>
+          <leafValues>
+            -6.0632371902465820e-01 3.0793670564889908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 1.8357619643211365e-02</internalNodes>
+          <leafValues>
+            -7.7268190681934357e-02 2.9780578613281250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 -8.4444461390376091e-04</internalNodes>
+          <leafValues>
+            7.8023009002208710e-02 -2.5017648935317993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 -6.2388968653976917e-03</internalNodes>
+          <leafValues>
+            -4.8017698526382446e-01 3.9185639470815659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 -3.5363171249628067e-02</internalNodes>
+          <leafValues>
+            -1. 9.3268742784857750e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 -7.3558121919631958e-02</internalNodes>
+          <leafValues>
+            -7.7895337343215942e-01 1.8441500142216682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 -8.7034203112125397e-02</internalNodes>
+          <leafValues>
+            4.3624061346054077e-01 -1.7716599628329277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -8.0721646547317505e-02</internalNodes>
+          <leafValues>
+            2.7296718955039978e-01 -6.6346958279609680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 1.0344590246677399e-01</internalNodes>
+          <leafValues>
+            9.0693607926368713e-03 -6.6438651084899902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 9.3807540833950043e-03</internalNodes>
+          <leafValues>
+            7.1242772042751312e-02 -2.7381658554077148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 -7.1806147694587708e-02</internalNodes>
+          <leafValues>
+            -9.1222041845321655e-01 8.0809993669390678e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 -1.9418599549680948e-03</internalNodes>
+          <leafValues>
+            1.8472340703010559e-01 -1.1344549804925919e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>68</maxWeakCount>
+      <stageThreshold>-7.3019427061080933e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 812 3.0328959226608276e-02</internalNodes>
+          <leafValues>
+            -1.7539510130882263e-01 3.6945340037345886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -8.2631781697273254e-02</internalNodes>
+          <leafValues>
+            2.2216479480266571e-01 -8.7577551603317261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 2.5548380799591541e-03</internalNodes>
+          <leafValues>
+            -1.5091089904308319e-01 1.4608770608901978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -1.4431839808821678e-03</internalNodes>
+          <leafValues>
+            6.2405250966548920e-02 -1.8302099406719208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 4.3006289750337601e-02</internalNodes>
+          <leafValues>
+            8.5711486637592316e-02 -4.4278779625892639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -1.7748139798641205e-01</internalNodes>
+          <leafValues>
+            -6.7308551073074341e-01 2.1622380241751671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 9.9723696708679199e-02</internalNodes>
+          <leafValues>
+            -4.2775660753250122e-02 6.9088941812515259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -1.7957199364900589e-02</internalNodes>
+          <leafValues>
+            8.8784933090209961e-02 -2.9352998733520508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 5.8914110995829105e-03</internalNodes>
+          <leafValues>
+            2.6884179562330246e-02 -3.9257821440696716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -1.2439199490472674e-03</internalNodes>
+          <leafValues>
+            8.3695329725742340e-02 -1.3524650037288666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -6.3109956681728363e-02</internalNodes>
+          <leafValues>
+            6.8365001678466797e-01 -1.1174580082297325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 5.3107268176972866e-03</internalNodes>
+          <leafValues>
+            7.3095791041851044e-02 -3.3228519558906555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 -9.6346868667751551e-04</internalNodes>
+          <leafValues>
+            9.3923456966876984e-02 -2.6014220714569092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -2.0377680659294128e-02</internalNodes>
+          <leafValues>
+            2.3682409524917603e-01 -5.1811341196298599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -1.5610749833285809e-02</internalNodes>
+          <leafValues>
+            -4.8465269804000854e-01 4.2128730565309525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 4.5497290790081024e-02</internalNodes>
+          <leafValues>
+            5.7874252088367939e-03 -5.2637368440628052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 -1.2244869954884052e-02</internalNodes>
+          <leafValues>
+            3.0523040890693665e-01 -7.9311266541481018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 -5.5875871330499649e-03</internalNodes>
+          <leafValues>
+            7.2504900395870209e-02 -1.0300940275192261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -1.3237710110843182e-02</internalNodes>
+          <leafValues>
+            -2.1259979903697968e-01 1.4112070202827454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -1.6236070543527603e-02</internalNodes>
+          <leafValues>
+            -3.6822131276130676e-01 1.6904499381780624e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 8.7341741891577840e-04</internalNodes>
+          <leafValues>
+            -1.7513209581375122e-01 1.1717790365219116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 7.8164516016840935e-03</internalNodes>
+          <leafValues>
+            -4.0935669094324112e-02 3.8136309385299683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 1.4803799786022864e-05</internalNodes>
+          <leafValues>
+            -1.1581300199031830e-01 1.8054120242595673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 3.6272540688514709e-02</internalNodes>
+          <leafValues>
+            1.5196749940514565e-02 -4.6037960052490234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -3.8026720285415649e-03</internalNodes>
+          <leafValues>
+            1.3440360128879547e-01 -1.6124980151653290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -1.4585750177502632e-02</internalNodes>
+          <leafValues>
+            -2.8331491351127625e-01 7.4682116508483887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 1.4677370199933648e-03</internalNodes>
+          <leafValues>
+            -1.3493220508098602e-01 1.4244909584522247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 -1.3981569558382034e-02</internalNodes>
+          <leafValues>
+            2.1735540032386780e-01 -5.2886679768562317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 -6.3076039077714086e-04</internalNodes>
+          <leafValues>
+            1.4901949465274811e-01 -1.3620099425315857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -1.4475540257990360e-02</internalNodes>
+          <leafValues>
+            -1.9180099666118622e-01 1.0607130080461502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -3.2217580825090408e-02</internalNodes>
+          <leafValues>
+            2.8091669082641602e-01 -8.5046291351318359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 3.4460560418665409e-03</internalNodes>
+          <leafValues>
+            7.4571870267391205e-02 -2.7108609676361084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 -4.3949890881776810e-02</internalNodes>
+          <leafValues>
+            4.4002100825309753e-01 -4.5509129762649536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 -1.1966270394623280e-02</internalNodes>
+          <leafValues>
+            6.3286870718002319e-02 -1.9805380702018738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 -4.3486028909683228e-01</internalNodes>
+          <leafValues>
+            -7.6205497980117798e-01 2.1508129313588142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 3.9887550473213196e-01</internalNodes>
+          <leafValues>
+            8.0703729763627052e-03 -8.4284877777099609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 -4.4802378863096237e-02</internalNodes>
+          <leafValues>
+            -6.8417382240295410e-01 2.2474979981780052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -1.0935150086879730e-01</internalNodes>
+          <leafValues>
+            2.1119509637355804e-01 -3.9731640368700027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 3.0923409387469292e-02</internalNodes>
+          <leafValues>
+            4.4779401272535324e-02 -3.5875031352043152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 1.3285979628562927e-02</internalNodes>
+          <leafValues>
+            -4.8151660710573196e-02 3.7119218707084656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 -3.9830091409385204e-03</internalNodes>
+          <leafValues>
+            1.2781530618667603e-01 -1.9959120452404022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 1.4184620231389999e-02</internalNodes>
+          <leafValues>
+            -3.9896048605442047e-02 2.4085929989814758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 1.6680279513821006e-03</internalNodes>
+          <leafValues>
+            -1.8107059597969055e-01 9.3981906771659851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 -2.2055890411138535e-02</internalNodes>
+          <leafValues>
+            -2.8798168897628784e-01 3.0038369819521904e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 -6.0371801257133484e-02</internalNodes>
+          <leafValues>
+            2.9529640078544617e-01 -6.4714096486568451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 5.9291448444128036e-02</internalNodes>
+          <leafValues>
+            8.4209917113184929e-03 -5.8830922842025757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 3.2637149095535278e-02</internalNodes>
+          <leafValues>
+            3.2118339091539383e-02 -5.1192921400070190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 -9.8897633142769337e-04</internalNodes>
+          <leafValues>
+            1.3382619619369507e-01 -1.1545710265636444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 -3.5560440272092819e-02</internalNodes>
+          <leafValues>
+            -1.5159629285335541e-01 1.0519140213727951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 9.8722549155354500e-03</internalNodes>
+          <leafValues>
+            9.3462042510509491e-02 -2.5988951325416565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 7.1953269653022289e-03</internalNodes>
+          <leafValues>
+            -8.6937829852104187e-02 2.8372770547866821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 2.4437099695205688e-02</internalNodes>
+          <leafValues>
+            -3.9930108934640884e-02 3.9243239164352417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 5.2195340394973755e-03</internalNodes>
+          <leafValues>
+            4.9804110080003738e-02 -3.1846821308135986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 2.3442960809916258e-03</internalNodes>
+          <leafValues>
+            -5.4469950497150421e-02 3.3718121051788330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 4.7694300301373005e-03</internalNodes>
+          <leafValues>
+            7.1476787328720093e-02 -3.1018280982971191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -1.4517470262944698e-02</internalNodes>
+          <leafValues>
+            7.8642480075359344e-02 -1.4538839459419250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 4.4710729271173477e-02</internalNodes>
+          <leafValues>
+            -2.5051780045032501e-02 6.4730519056320190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 1.6867399215698242e-02</internalNodes>
+          <leafValues>
+            2.9088959097862244e-02 -3.9030238986015320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -9.0343318879604340e-04</internalNodes>
+          <leafValues>
+            8.7722577154636383e-02 -1.6588549315929413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -8.2187339663505554e-02</internalNodes>
+          <leafValues>
+            -8.4238857030868530e-01 9.8376423120498657e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 1.8525390187278390e-03</internalNodes>
+          <leafValues>
+            -1.2251490354537964e-01 1.2000189721584320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 -9.3228723853826523e-03</internalNodes>
+          <leafValues>
+            7.8422851860523224e-02 -1.3231949508190155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 2.2730689495801926e-02</internalNodes>
+          <leafValues>
+            -3.3696789294481277e-02 4.4383940100669861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 1.0286659747362137e-01</internalNodes>
+          <leafValues>
+            1.7917430028319359e-02 -5.8341610431671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 -9.9547371268272400e-02</internalNodes>
+          <leafValues>
+            -9.5365560054779053e-01 1.2582040391862392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 1.6412759199738503e-02</internalNodes>
+          <leafValues>
+            1.6067119315266609e-02 -4.1402378678321838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 -2.5932409334927797e-03</internalNodes>
+          <leafValues>
+            5.2763499319553375e-02 -3.0404600501060486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 9.5953093841671944e-03</internalNodes>
+          <leafValues>
+            8.3528086543083191e-02 -1.1780069768428802e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>66</maxWeakCount>
+      <stageThreshold>-6.8558442592620850e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 880 -3.5430109500885010e-01</internalNodes>
+          <leafValues>
+            3.1792920827865601e-01 -1.8512800335884094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -1.4761329628527164e-02</internalNodes>
+          <leafValues>
+            3.4065079689025879e-01 -8.6621738970279694e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 -1.1580450087785721e-01</internalNodes>
+          <leafValues>
+            -7.2353202104568481e-01 3.4404840320348740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 -4.4705160689773038e-05</internalNodes>
+          <leafValues>
+            8.2497082650661469e-02 -2.1311110258102417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -5.8883379097096622e-05</internalNodes>
+          <leafValues>
+            1.0809300094842911e-01 -1.8269860744476318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 3.7944849580526352e-02</internalNodes>
+          <leafValues>
+            -2.4756550788879395e-02 4.5866918563842773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -2.1807940211147070e-03</internalNodes>
+          <leafValues>
+            1.5783859789371490e-01 -1.7752459645271301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 -4.5430101454257965e-02</internalNodes>
+          <leafValues>
+            -3.7249541282653809e-01 5.7393261231482029e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.9972559530287981e-03</internalNodes>
+          <leafValues>
+            -1.9175310432910919e-01 1.1995170265436172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -2.2458820239990018e-05</internalNodes>
+          <leafValues>
+            9.1529168188571930e-02 -1.3080990314483643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -3.7994279991835356e-03</internalNodes>
+          <leafValues>
+            -2.0454970002174377e-01 1.4146579802036285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -2.7970419614575803e-04</internalNodes>
+          <leafValues>
+            1.1078160256147385e-01 -1.8713960051536560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 -3.9631421677768230e-03</internalNodes>
+          <leafValues>
+            -3.7749990820884705e-01 5.6935790926218033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -1.4290240360423923e-03</internalNodes>
+          <leafValues>
+            -1.9449859857559204e-01 9.8834916949272156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 2.1182179450988770e-02</internalNodes>
+          <leafValues>
+            -8.7030410766601562e-02 2.8888610005378723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 8.7332521798089147e-04</internalNodes>
+          <leafValues>
+            -1.1729159951210022e-01 1.2506540119647980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 2.6135759428143501e-02</internalNodes>
+          <leafValues>
+            -3.9572428911924362e-02 6.2252640724182129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 4.3046330101788044e-03</internalNodes>
+          <leafValues>
+            1.1582309752702713e-01 -1.9618239998817444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 1.5224959934130311e-03</internalNodes>
+          <leafValues>
+            -1.8586060404777527e-01 1.1688389629125595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -7.4201932875439525e-04</internalNodes>
+          <leafValues>
+            9.8724737763404846e-02 -2.5791341066360474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -2.5593061000108719e-03</internalNodes>
+          <leafValues>
+            1.7307940125465393e-01 -1.2067069858312607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 -9.5563217997550964e-02</internalNodes>
+          <leafValues>
+            3.4646418690681458e-01 -1.3142139650881290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 1.3280790299177170e-02</internalNodes>
+          <leafValues>
+            1.2056879699230194e-01 -2.0627740025520325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 1.8245529383420944e-02</internalNodes>
+          <leafValues>
+            -6.7242950201034546e-02 4.6858128160238266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 -6.1288971453905106e-02</internalNodes>
+          <leafValues>
+            -6.6364967823028564e-01 2.9319150373339653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 -2.6133419945836067e-02</internalNodes>
+          <leafValues>
+            2.0848380029201508e-01 -2.7202930301427841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -3.2300818711519241e-02</internalNodes>
+          <leafValues>
+            -6.2726408243179321e-01 3.0091879889369011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 5.0284489989280701e-02</internalNodes>
+          <leafValues>
+            1.5047290362417698e-03 -5.9630411863327026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -1.8137119710445404e-02</internalNodes>
+          <leafValues>
+            2.9262909293174744e-01 -6.9213449954986572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 1.0980300139635801e-03</internalNodes>
+          <leafValues>
+            1.0316859930753708e-01 -1.6558070480823517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 3.9596110582351685e-03</internalNodes>
+          <leafValues>
+            -5.7063579559326172e-02 3.3744910359382629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 3.1622028909623623e-03</internalNodes>
+          <leafValues>
+            8.8302358984947205e-02 -2.7917590737342834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 8.4337368607521057e-03</internalNodes>
+          <leafValues>
+            8.6311057209968567e-02 -2.5153660774230957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 2.3408479988574982e-02</internalNodes>
+          <leafValues>
+            -3.7011519074440002e-02 2.5571560859680176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -1.9710899796336889e-03</internalNodes>
+          <leafValues>
+            1.4960870146751404e-01 -1.3213759660720825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 -3.1434781849384308e-02</internalNodes>
+          <leafValues>
+            2.7072909474372864e-01 -2.4784140288829803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 -2.0984669681638479e-03</internalNodes>
+          <leafValues>
+            -2.2842940688133240e-01 9.2392489314079285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -1.0477580130100250e-01</internalNodes>
+          <leafValues>
+            1.3740949332714081e-01 -5.8604940772056580e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 1.2558500282466412e-02</internalNodes>
+          <leafValues>
+            9.4428263604640961e-02 -2.3187640309333801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 2.6465631090104580e-03</internalNodes>
+          <leafValues>
+            -2.0493589341640472e-01 9.2889577150344849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 2.8069379925727844e-01</internalNodes>
+          <leafValues>
+            4.0848400443792343e-02 -4.6177521347999573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 -4.5882318168878555e-02</internalNodes>
+          <leafValues>
+            -7.1715551614761353e-01 9.1696027666330338e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 -1.3070689747110009e-03</internalNodes>
+          <leafValues>
+            1.6250529885292053e-01 -1.1437030136585236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 6.8374760448932648e-03</internalNodes>
+          <leafValues>
+            -6.7564792931079865e-02 2.1927219629287720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -5.8329561725258827e-03</internalNodes>
+          <leafValues>
+            -3.5843908786773682e-01 5.7467628270387650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -4.0936999022960663e-02</internalNodes>
+          <leafValues>
+            -5.5129498243331909e-01 1.3819620013237000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 1.8727440387010574e-02</internalNodes>
+          <leafValues>
+            -5.2844639867544174e-02 3.4427130222320557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 1.0303989984095097e-03</internalNodes>
+          <leafValues>
+            -9.4872146844863892e-02 1.1235869675874710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -2.6228028582409024e-04</internalNodes>
+          <leafValues>
+            6.3875511288642883e-02 -3.0397358536720276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -2.6861110702157021e-02</internalNodes>
+          <leafValues>
+            1.7592920362949371e-01 -6.2506988644599915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 3.1061280518770218e-02</internalNodes>
+          <leafValues>
+            -7.2171129286289215e-02 3.1532520055770874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -7.1269841864705086e-03</internalNodes>
+          <leafValues>
+            -1.2540310621261597e-01 1.0068179666996002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 -2.7709340676665306e-02</internalNodes>
+          <leafValues>
+            -8.0085551738739014e-01 2.5742180645465851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 4.2209450155496597e-02</internalNodes>
+          <leafValues>
+            2.7846070006489754e-02 -5.6140202283859253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 6.2995860353112221e-03</internalNodes>
+          <leafValues>
+            1.0806919634342194e-01 -2.0114520192146301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 2.0048789680004120e-02</internalNodes>
+          <leafValues>
+            -5.8164618909358978e-02 1.8885469436645508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 -7.8481709351763129e-05</internalNodes>
+          <leafValues>
+            8.2995712757110596e-02 -2.1331989765167236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 -8.9945547282695770e-02</internalNodes>
+          <leafValues>
+            -7.9307717084884644e-01 7.8350491821765900e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 7.7181761153042316e-03</internalNodes>
+          <leafValues>
+            4.1435040533542633e-02 -3.7721860408782959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 5.3638177923858166e-03</internalNodes>
+          <leafValues>
+            -9.3567937612533569e-02 1.4666350185871124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 1.4555330388247967e-02</internalNodes>
+          <leafValues>
+            -5.6989211589097977e-02 3.4367969632148743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 1.0583730041980743e-01</internalNodes>
+          <leafValues>
+            3.0579300597310066e-02 -5.8684998750686646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 2.7123570907860994e-04</internalNodes>
+          <leafValues>
+            8.5480518639087677e-02 -2.2808749973773956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 -7.3196433484554291e-02</internalNodes>
+          <leafValues>
+            -5.1212561130523682e-01 9.6583841368556023e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 8.3729642210528255e-04</internalNodes>
+          <leafValues>
+            -1.7978319525718689e-01 1.4117470383644104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 1.9459549803286791e-03</internalNodes>
+          <leafValues>
+            8.7605938315391541e-02 -2.0442050695419312e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>78</maxWeakCount>
+      <stageThreshold>-3.0717300415039062e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 946 -8.5505366325378418e-02</internalNodes>
+          <leafValues>
+            2.6714649796485901e-01 -1.8152849376201630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 -3.7014279514551163e-02</internalNodes>
+          <leafValues>
+            3.7405461072921753e-01 -7.0312701165676117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 1.6834780573844910e-02</internalNodes>
+          <leafValues>
+            8.9160107076168060e-02 -2.4566100537776947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 9.7268886747770011e-05</internalNodes>
+          <leafValues>
+            -1.9830940663814545e-01 1.4981469511985779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 5.2984068170189857e-03</internalNodes>
+          <leafValues>
+            -1.5779909491539001e-01 1.7095419764518738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 -2.3770859465003014e-02</internalNodes>
+          <leafValues>
+            -2.5096279382705688e-01 3.2790731638669968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 -1.4852959662675858e-02</internalNodes>
+          <leafValues>
+            2.7263158559799194e-01 -7.2188302874565125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 -8.2722969353199005e-02</internalNodes>
+          <leafValues>
+            -6.6801771521568298e-02 1.3384120166301727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 6.4472708618268371e-04</internalNodes>
+          <leafValues>
+            -1.9309680163860321e-01 1.3628469407558441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -4.3215509504079819e-04</internalNodes>
+          <leafValues>
+            5.7426910847425461e-02 -7.2983436286449432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 -7.5133621066925116e-06</internalNodes>
+          <leafValues>
+            1.2174469977617264e-01 -1.8166640400886536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 2.0493609830737114e-02</internalNodes>
+          <leafValues>
+            -6.1657600104808807e-02 3.8570550084114075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 -5.9959441423416138e-03</internalNodes>
+          <leafValues>
+            -1.8091249465942383e-01 1.1791180074214935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -9.3910521268844604e-01</internalNodes>
+          <leafValues>
+            3.1374409794807434e-01 -5.9216298162937164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 -2.4341490119695663e-02</internalNodes>
+          <leafValues>
+            -3.7053358554840088e-01 5.5251110345125198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 -7.6796777546405792e-02</internalNodes>
+          <leafValues>
+            1.3754889369010925e-01 -5.8201938867568970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 -8.2179326564073563e-03</internalNodes>
+          <leafValues>
+            -2.5679248571395874e-01 9.9195696413516998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 -5.1702618598937988e-02</internalNodes>
+          <leafValues>
+            -5.2937638759613037e-01 2.7275180444121361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 6.3065597787499428e-03</internalNodes>
+          <leafValues>
+            -1.0400679707527161e-01 2.0388899743556976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 3.6337040364742279e-02</internalNodes>
+          <leafValues>
+            1.3178840279579163e-02 -3.8717061281204224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -2.7929339557886124e-03</internalNodes>
+          <leafValues>
+            1.2351000308990479e-01 -2.0460779964923859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 -1.4435379765927792e-02</internalNodes>
+          <leafValues>
+            -5.0111377239227295e-01 3.7262540310621262e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 6.4411992207169533e-03</internalNodes>
+          <leafValues>
+            -6.0557190328836441e-02 3.0578470230102539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -1.2598140165209770e-03</internalNodes>
+          <leafValues>
+            5.3200751543045044e-02 -1.6916200518608093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -6.9105648435652256e-03</internalNodes>
+          <leafValues>
+            -3.6398649215698242e-01 4.2843151837587357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 -5.2663110196590424e-02</internalNodes>
+          <leafValues>
+            4.4169178605079651e-01 -3.2096829265356064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 -4.0925059467554092e-02</internalNodes>
+          <leafValues>
+            -5.5673360824584961e-01 2.9191689565777779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 -2.1683140657842159e-03</internalNodes>
+          <leafValues>
+            6.6585853695869446e-02 -1.1715179681777954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 1.7480919137597084e-02</internalNodes>
+          <leafValues>
+            -6.7747853696346283e-02 3.4224361181259155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 1.3032980263233185e-01</internalNodes>
+          <leafValues>
+            1.0853439569473267e-02 -5.9894740581512451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 5.1362451631575823e-04</internalNodes>
+          <leafValues>
+            -1.8810969591140747e-01 1.0938909649848938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 -3.8764420896768570e-02</internalNodes>
+          <leafValues>
+            -2.6928341388702393e-01 2.0156569778919220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -4.8952922224998474e-03</internalNodes>
+          <leafValues>
+            -2.3670850694179535e-01 7.0693537592887878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 8.4380611777305603e-02</internalNodes>
+          <leafValues>
+            -6.1777111142873764e-02 1.5130819380283356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 -5.4832860827445984e-02</internalNodes>
+          <leafValues>
+            -4.9945160746574402e-01 3.5915810614824295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -5.4148300550878048e-03</internalNodes>
+          <leafValues>
+            8.2116909325122833e-02 -1.3672749698162079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 1.2813720107078552e-01</internalNodes>
+          <leafValues>
+            -3.9755281060934067e-02 6.0340911149978638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -4.4217561371624470e-03</internalNodes>
+          <leafValues>
+            -7.4642613530158997e-02 1.0235700011253357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -7.1978997766564135e-06</internalNodes>
+          <leafValues>
+            7.4595592916011810e-02 -2.9046559333801270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 7.3321886360645294e-02</internalNodes>
+          <leafValues>
+            -2.1364469081163406e-02 6.9809699058532715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -2.2566469386219978e-02</internalNodes>
+          <leafValues>
+            -5.3714770078659058e-01 3.6509968340396881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -2.9338080435991287e-02</internalNodes>
+          <leafValues>
+            1.0626199841499329e-01 -3.1652290374040604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 1.3684090226888657e-02</internalNodes>
+          <leafValues>
+            -5.7709541171789169e-02 3.0355650186538696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 -8.2646618830040097e-04</internalNodes>
+          <leafValues>
+            1.2958580255508423e-01 -1.3603089749813080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 3.9828647859394550e-03</internalNodes>
+          <leafValues>
+            5.0734668970108032e-02 -3.3896729350090027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -2.0535979419946671e-02</internalNodes>
+          <leafValues>
+            2.6028490066528320e-01 -7.2259396314620972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 -1.4932189881801605e-01</internalNodes>
+          <leafValues>
+            -5.4172599315643311e-01 4.4534388929605484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 -1.7894789576530457e-02</internalNodes>
+          <leafValues>
+            4.7149929404258728e-01 -3.0801070854067802e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 4.7443818766623735e-04</internalNodes>
+          <leafValues>
+            -1.9686989486217499e-01 1.2433020025491714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -4.0598851628601551e-03</internalNodes>
+          <leafValues>
+            1.4028669893741608e-01 -4.7751329839229584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 -1.1755799874663353e-02</internalNodes>
+          <leafValues>
+            -2.6237910985946655e-01 5.9933070093393326e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 -1.8559649586677551e-02</internalNodes>
+          <leafValues>
+            1.0493250191211700e-01 -3.2159261405467987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 3.4838409628719091e-03</internalNodes>
+          <leafValues>
+            7.9499892890453339e-02 -2.0486010611057281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -6.2133308500051498e-02</internalNodes>
+          <leafValues>
+            -3.5091090202331543e-01 1.2265560217201710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 -4.4008668512105942e-02</internalNodes>
+          <leafValues>
+            2.6838389039039612e-01 -8.8284887373447418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 3.0750890728086233e-03</internalNodes>
+          <leafValues>
+            -4.5581929385662079e-02 1.9343300163745880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 -8.9865371584892273e-02</internalNodes>
+          <leafValues>
+            -4.8605358600616455e-01 4.5101881027221680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -1.6210540197789669e-03</internalNodes>
+          <leafValues>
+            8.7722256779670715e-02 -1.6689349710941315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -2.9370939359068871e-02</internalNodes>
+          <leafValues>
+            -4.2794701457023621e-01 4.5566789805889130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -8.5921816527843475e-02</internalNodes>
+          <leafValues>
+            -6.9077378511428833e-01 1.5122929587960243e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 6.7258282797411084e-04</internalNodes>
+          <leafValues>
+            -1.1166089773178101e-01 1.5630759298801422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 1.7752440180629492e-03</internalNodes>
+          <leafValues>
+            -4.5409418642520905e-02 7.7933087944984436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 1.5036190234241076e-05</internalNodes>
+          <leafValues>
+            -1.6349479556083679e-01 1.0864420235157013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 1.8150300020352006e-03</internalNodes>
+          <leafValues>
+            9.6329912543296814e-02 -1.1818060278892517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 -6.7588366568088531e-02</internalNodes>
+          <leafValues>
+            2.2657020390033722e-01 -9.0492926537990570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 1.8347490578889847e-02</internalNodes>
+          <leafValues>
+            1.6350140795111656e-02 -4.4877880811691284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -1.0822510346770287e-02</internalNodes>
+          <leafValues>
+            -4.9622350931167603e-01 4.0703330188989639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 1.7427999526262283e-02</internalNodes>
+          <leafValues>
+            -3.5475689917802811e-02 3.0856430530548096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 -7.8753121197223663e-02</internalNodes>
+          <leafValues>
+            -6.7144078016281128e-01 2.6170469820499420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 7.3261657962575555e-04</internalNodes>
+          <leafValues>
+            -1.0309589654207230e-01 6.4503982663154602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 2.8185009956359863e-02</internalNodes>
+          <leafValues>
+            -5.5124811828136444e-02 3.1133919954299927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 -1.5536470338702202e-02</internalNodes>
+          <leafValues>
+            -8.5527300834655762e-02 4.9024209380149841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 -2.6290729641914368e-02</internalNodes>
+          <leafValues>
+            -6.5267199277877808e-01 2.4495759978890419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 -6.8586082197725773e-03</internalNodes>
+          <leafValues>
+            -5.8548830449581146e-02 2.8735989332199097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -3.0750960577279329e-03</internalNodes>
+          <leafValues>
+            8.6425736546516418e-02 -2.2627249360084534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 5.6799430400133133e-02</internalNodes>
+          <leafValues>
+            2.9048459604382515e-02 -3.6798200011253357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 3.7182599306106567e-02</internalNodes>
+          <leafValues>
+            -3.5062279552221298e-02 4.5094621181488037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 -3.5590359475463629e-03</internalNodes>
+          <leafValues>
+            -1.7892469465732574e-01 6.8459518253803253e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>77</maxWeakCount>
+      <stageThreshold>-3.0740200042724609e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1024 -5.8595160953700542e-03</internalNodes>
+          <leafValues>
+            2.0132589340209961e-01 -2.6587140560150146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 -5.9507137537002563e-01</internalNodes>
+          <leafValues>
+            3.6134061217308044e-01 -1.2203159928321838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 4.1726600378751755e-02</internalNodes>
+          <leafValues>
+            -5.2889000624418259e-02 3.9082470536231995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 4.7253750264644623e-02</internalNodes>
+          <leafValues>
+            1.4923909679055214e-02 -5.0544148683547974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 9.8612194415181875e-04</internalNodes>
+          <leafValues>
+            -2.0337739586830139e-01 1.1030670255422592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -7.2683179751038551e-03</internalNodes>
+          <leafValues>
+            -2.0899240672588348e-01 1.4733150601387024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -2.9695410281419754e-02</internalNodes>
+          <leafValues>
+            6.6190290451049805e-01 -6.7257620394229889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -1.3097229599952698e-01</internalNodes>
+          <leafValues>
+            1.7485789954662323e-01 -8.1029571592807770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 1.7316760495305061e-02</internalNodes>
+          <leafValues>
+            -4.8908680677413940e-02 4.6843668818473816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -1.0221409797668457e-01</internalNodes>
+          <leafValues>
+            -2.2275149822235107e-01 7.7479638159275055e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 2.9453460592776537e-03</internalNodes>
+          <leafValues>
+            3.9738278836011887e-02 -2.8107449412345886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -4.5425590127706528e-02</internalNodes>
+          <leafValues>
+            2.4193780124187469e-01 1.3621949590742588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 2.2699350956827402e-03</internalNodes>
+          <leafValues>
+            -1.6247589886188507e-01 1.6063609719276428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 1.1421869695186615e-01</internalNodes>
+          <leafValues>
+            1.5750480815768242e-02 -5.7382887601852417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 -4.1054069995880127e-02</internalNodes>
+          <leafValues>
+            3.0522629618644714e-01 -5.5898960679769516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 1.1980540119111538e-02</internalNodes>
+          <leafValues>
+            1.7477169632911682e-02 -4.0707069635391235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 1.2105259811505675e-03</internalNodes>
+          <leafValues>
+            -1.7840960621833801e-01 1.0353209823369980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 -2.2351980209350586e-02</internalNodes>
+          <leafValues>
+            -4.7567600011825562e-01 3.7311390042304993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 2.2135479375720024e-02</internalNodes>
+          <leafValues>
+            -5.4137628525495529e-02 4.2861071228981018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 -1.5875579789280891e-02</internalNodes>
+          <leafValues>
+            6.6373616456985474e-02 -1.6455489397048950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 6.0371369123458862e-02</internalNodes>
+          <leafValues>
+            3.8663931190967560e-02 -4.6496200561523438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 -5.1881238818168640e-02</internalNodes>
+          <leafValues>
+            -5.6141299009323120e-01 5.4471958428621292e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 1.9330360228195786e-03</internalNodes>
+          <leafValues>
+            -1.3475979864597321e-01 1.3747330009937286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 -4.3940469622612000e-03</internalNodes>
+          <leafValues>
+            -9.3405917286872864e-02 3.5123821347951889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 -5.2314151078462601e-02</internalNodes>
+          <leafValues>
+            7.5311762094497681e-01 -2.9210770502686501e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -5.6897811591625214e-02</internalNodes>
+          <leafValues>
+            -9.1858989000320435e-01 2.8862420469522476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -2.1614639461040497e-01</internalNodes>
+          <leafValues>
+            -1. 6.9490820169448853e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 1.8479259312152863e-01</internalNodes>
+          <leafValues>
+            -8.8357992470264435e-02 1.9002689421176910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 -5.6834658607840538e-03</internalNodes>
+          <leafValues>
+            -1.7791560292243958e-01 9.8286077380180359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 -8.2448042929172516e-02</internalNodes>
+          <leafValues>
+            -3.4058651328086853e-01 1.5612719580531120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 -7.5926659628748894e-03</internalNodes>
+          <leafValues>
+            2.5929468870162964e-01 -6.9370441138744354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -2.9748380184173584e-03</internalNodes>
+          <leafValues>
+            5.4534178227186203e-02 -1.2630839645862579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 -1.6377970576286316e-01</internalNodes>
+          <leafValues>
+            -8.3725690841674805e-01 2.2446790710091591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -3.8845320232212543e-03</internalNodes>
+          <leafValues>
+            -2.1008059382438660e-01 9.1814376413822174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 -5.5496331304311752e-02</internalNodes>
+          <leafValues>
+            5.2739220857620239e-01 -3.8561638444662094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 4.5041809789836407e-03</internalNodes>
+          <leafValues>
+            3.8907989859580994e-02 -2.1077489852905273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 5.7516310364007950e-02</internalNodes>
+          <leafValues>
+            -5.4442461580038071e-02 3.4977319836616516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 -5.4960879497230053e-03</internalNodes>
+          <leafValues>
+            1.0459329932928085e-01 -2.2956989705562592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 5.8753142366185784e-04</internalNodes>
+          <leafValues>
+            7.4045538902282715e-02 -2.3731130361557007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 1.1216119676828384e-01</internalNodes>
+          <leafValues>
+            -2.5916000828146935e-02 1.1389470100402832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 2.1753750741481781e-01</internalNodes>
+          <leafValues>
+            1.9727870821952820e-02 -9.6220922470092773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 -1.4632700476795435e-03</internalNodes>
+          <leafValues>
+            -9.4052821397781372e-02 6.4389176666736603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 -8.6313979700207710e-03</internalNodes>
+          <leafValues>
+            2.5036060810089111e-01 -7.2234652936458588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 -1.9858509302139282e-02</internalNodes>
+          <leafValues>
+            -1.2698090076446533e-01 7.9051487147808075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 -1.3804109767079353e-04</internalNodes>
+          <leafValues>
+            1.4466640353202820e-01 -1.1444070190191269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 2.6781240478157997e-02</internalNodes>
+          <leafValues>
+            1.7647750675678253e-02 -8.3157891035079956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 1.9331119954586029e-02</internalNodes>
+          <leafValues>
+            -4.5500081032514572e-02 5.0110948085784912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 4.1692070662975311e-02</internalNodes>
+          <leafValues>
+            2.2502349689602852e-02 -3.8992220163345337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 1.1296980082988739e-01</internalNodes>
+          <leafValues>
+            -3.2494839280843735e-02 5.3929620981216431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 3.1683610286563635e-03</internalNodes>
+          <leafValues>
+            -1.7195589840412140e-01 9.3619801104068756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 5.3966748528182507e-03</internalNodes>
+          <leafValues>
+            5.7677630335092545e-02 -3.0436149239540100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 -1.3829180598258972e-01</internalNodes>
+          <leafValues>
+            -5.2158790826797485e-01 1.8444910645484924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 -1.2594119645655155e-02</internalNodes>
+          <leafValues>
+            2.2748909890651703e-01 -6.9325000047683716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 -1.6514480113983154e-02</internalNodes>
+          <leafValues>
+            1.6279229521751404e-01 -3.4446150064468384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 -1.6392849385738373e-02</internalNodes>
+          <leafValues>
+            -1.4277680218219757e-01 1.6290099918842316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 -3.4606490284204483e-02</internalNodes>
+          <leafValues>
+            -4.0356379747390747e-01 8.3033805713057518e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 -6.8894061259925365e-03</internalNodes>
+          <leafValues>
+            2.6890090107917786e-01 -6.9450862705707550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 -1.1879400350153446e-02</internalNodes>
+          <leafValues>
+            2.1395209431648254e-01 -2.0930450409650803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 -1.9165100529789925e-03</internalNodes>
+          <leafValues>
+            6.8464219570159912e-02 -3.1453219056129456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 1.3729350175708532e-03</internalNodes>
+          <leafValues>
+            -6.0340028256177902e-02 2.7572840452194214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 2.4278028868138790e-03</internalNodes>
+          <leafValues>
+            -2.3944500088691711e-01 8.4658838808536530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 2.1290169097483158e-03</internalNodes>
+          <leafValues>
+            8.6938478052616119e-02 -2.8218480944633484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 -5.2569470426533371e-05</internalNodes>
+          <leafValues>
+            1.3682359457015991e-01 -1.1980649828910828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 1.5957899391651154e-02</internalNodes>
+          <leafValues>
+            -3.9610300213098526e-02 2.4825170636177063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 8.9294081553816795e-03</internalNodes>
+          <leafValues>
+            8.1123508512973785e-02 -2.6561570167541504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 4.9925308674573898e-02</internalNodes>
+          <leafValues>
+            1.5018629841506481e-02 -3.6647871136665344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 -1.7374839633703232e-02</internalNodes>
+          <leafValues>
+            3.3971020579338074e-01 -5.4494149982929230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 -7.8357063233852386e-02</internalNodes>
+          <leafValues>
+            -4.9435839056968689e-01 8.4990533068776131e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 -8.9894477277994156e-03</internalNodes>
+          <leafValues>
+            -2.3209859430789948e-01 7.1379087865352631e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 -1.5932919923216105e-03</internalNodes>
+          <leafValues>
+            8.2504719495773315e-02 -9.3123182654380798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 2.6272730901837349e-03</internalNodes>
+          <leafValues>
+            -1.3213430345058441e-01 1.3099829852581024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 -5.9108160436153412e-02</internalNodes>
+          <leafValues>
+            -3.7229761481285095e-01 4.5574661344289780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 3.5086690913885832e-03</internalNodes>
+          <leafValues>
+            8.9478462934494019e-02 -1.8543410301208496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 1.5465220436453819e-02</internalNodes>
+          <leafValues>
+            -3.0604820698499680e-02 2.0754580199718475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 -1.1749019846320152e-02</internalNodes>
+          <leafValues>
+            3.9200168848037720e-01 -4.1100859642028809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 4.8413608223199844e-02</internalNodes>
+          <leafValues>
+            3.7391050718724728e-03 -8.5701841115951538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 -1.1499889660626650e-03</internalNodes>
+          <leafValues>
+            -2.2441549599170685e-01 7.1305088698863983e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>89</maxWeakCount>
+      <stageThreshold>-3.0760700225830078e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1101 -3.2420051097869873e-01</internalNodes>
+          <leafValues>
+            4.1447758674621582e-01 -1.0684230178594589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 -2.1065689623355865e-01</internalNodes>
+          <leafValues>
+            2.3302809894084930e-01 -9.4695799052715302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 -2.1540550515055656e-02</internalNodes>
+          <leafValues>
+            -2.8891721367835999e-01 7.0666067302227020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 5.9726871550083160e-03</internalNodes>
+          <leafValues>
+            -9.0559490025043488e-02 2.2989599406719208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 2.6468100026249886e-02</internalNodes>
+          <leafValues>
+            -5.0254050642251968e-02 3.9346438646316528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 -7.2531126439571381e-02</internalNodes>
+          <leafValues>
+            -3.9421468973159790e-01 7.5547359883785248e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 -4.3684918433427811e-02</internalNodes>
+          <leafValues>
+            -5.7553547620773315e-01 5.1893319934606552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 1.1670660227537155e-01</internalNodes>
+          <leafValues>
+            -2.5791339576244354e-03 -8.2597649097442627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 -8.2381166517734528e-02</internalNodes>
+          <leafValues>
+            7.5818961858749390e-01 -2.6576930657029152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 -2.3157079704105854e-03</internalNodes>
+          <leafValues>
+            6.6858686506748199e-02 -3.0407869815826416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 -1.6678189858794212e-02</internalNodes>
+          <leafValues>
+            3.8525319099426270e-01 -4.8842679709196091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 -3.0678999610245228e-03</internalNodes>
+          <leafValues>
+            -2.7150988578796387e-01 6.4561262726783752e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 -8.3884904161095619e-03</internalNodes>
+          <leafValues>
+            -2.8267300128936768e-01 7.0778891444206238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 2.1357910707592964e-02</internalNodes>
+          <leafValues>
+            -6.6106483340263367e-02 3.1867539882659912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 -4.0636979974806309e-03</internalNodes>
+          <leafValues>
+            1.1739840358495712e-01 -1.5105929970741272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 -1.1475679930299520e-03</internalNodes>
+          <leafValues>
+            6.4262896776199341e-02 -7.4472077190876007e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 1.8145689740777016e-02</internalNodes>
+          <leafValues>
+            -5.6946009397506714e-02 4.2107149958610535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 5.0288350321352482e-03</internalNodes>
+          <leafValues>
+            8.3866670727729797e-02 -3.3929398655891418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -5.7916361838579178e-02</internalNodes>
+          <leafValues>
+            4.5170179009437561e-01 -4.3198868632316589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 3.1025299802422523e-02</internalNodes>
+          <leafValues>
+            2.8000740334391594e-02 -1.6818940639495850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 8.2134291529655457e-02</internalNodes>
+          <leafValues>
+            1.9999530166387558e-02 -7.6910507678985596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 7.3666572570800781e-02</internalNodes>
+          <leafValues>
+            -1.2391459895297885e-03 -1.0004559755325317e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 1.5681830700486898e-04</internalNodes>
+          <leafValues>
+            -1.2154590338468552e-01 1.3561969995498657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 4.5130930840969086e-02</internalNodes>
+          <leafValues>
+            4.7123869881033897e-03 -2.9671049118041992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 -5.1468348829075694e-04</internalNodes>
+          <leafValues>
+            1.4606890082359314e-01 -1.3600480556488037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -1.4981119893491268e-02</internalNodes>
+          <leafValues>
+            -1.7933659255504608e-01 5.3928699344396591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -2.7151789516210556e-02</internalNodes>
+          <leafValues>
+            -6.7529010772705078e-01 2.3046780377626419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 -6.6578023135662079e-02</internalNodes>
+          <leafValues>
+            -6.5586429834365845e-01 4.7667929902672768e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 -3.3119178842753172e-03</internalNodes>
+          <leafValues>
+            1.2255000323057175e-01 -1.6333930194377899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 -1.5811180695891380e-02</internalNodes>
+          <leafValues>
+            -4.4731178879737854e-01 8.9029967784881592e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 -5.6757620768621564e-05</internalNodes>
+          <leafValues>
+            1.4944350719451904e-01 -1.0686829686164856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 1.0602490045130253e-02</internalNodes>
+          <leafValues>
+            2.1685829386115074e-02 -3.2208129763603210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 2.1245649550110102e-03</internalNodes>
+          <leafValues>
+            -2.0425739884376526e-01 8.2330957055091858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 4.7638580203056335e-02</internalNodes>
+          <leafValues>
+            -3.2728441059589386e-02 4.4726258516311646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 -1.1300199665129185e-02</internalNodes>
+          <leafValues>
+            2.5546020269393921e-01 -6.9969899952411652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 -1.1472209589555860e-03</internalNodes>
+          <leafValues>
+            4.7467790544033051e-02 -2.2220790386199951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 1.8008640035986900e-02</internalNodes>
+          <leafValues>
+            -6.0860209167003632e-02 2.9082441329956055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 -1.1634260416030884e-02</internalNodes>
+          <leafValues>
+            -3.1474921107292175e-01 8.3630897104740143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 6.5580541267991066e-03</internalNodes>
+          <leafValues>
+            -1.2121830135583878e-01 1.3124500215053558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 -2.3253620602190495e-03</internalNodes>
+          <leafValues>
+            -8.7138622999191284e-02 7.0476517081260681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 2.1486220881342888e-02</internalNodes>
+          <leafValues>
+            -3.5936549305915833e-02 4.3737021088600159e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 1.2589399516582489e-01</internalNodes>
+          <leafValues>
+            1.2443150393664837e-02 -9.2822617292404175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 -2.2191529569681734e-04</internalNodes>
+          <leafValues>
+            6.9798342883586884e-02 -3.2106238603591919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 -5.8175198733806610e-02</internalNodes>
+          <leafValues>
+            -7.7025629580020905e-02 9.6747986972332001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 -4.5887380838394165e-04</internalNodes>
+          <leafValues>
+            1.1412449926137924e-01 -1.4719170331954956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -4.0837019681930542e-02</internalNodes>
+          <leafValues>
+            4.7654581069946289e-01 -4.9737568944692612e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 -9.7786840051412582e-03</internalNodes>
+          <leafValues>
+            -2.0513780415058136e-01 8.4468983113765717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 2.7964261174201965e-01</internalNodes>
+          <leafValues>
+            -3.0034869909286499e-02 6.9526249170303345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 -8.8869117200374603e-02</internalNodes>
+          <leafValues>
+            2.4081839621067047e-01 -7.0576377213001251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 -1.4095460064709187e-02</internalNodes>
+          <leafValues>
+            -1.0456439852714539e-01 4.6604979783296585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 2.6836670003831387e-03</internalNodes>
+          <leafValues>
+            6.0495968908071518e-02 -2.5784969329833984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 8.7051279842853546e-02</internalNodes>
+          <leafValues>
+            -2.4173669517040253e-02 2.4043059349060059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 -1.0178039781749249e-02</internalNodes>
+          <leafValues>
+            2.5469788908958435e-01 -9.2890508472919464e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -9.0314531698822975e-03</internalNodes>
+          <leafValues>
+            -2.6343479752540588e-01 7.0848807692527771e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 -6.7082298919558525e-03</internalNodes>
+          <leafValues>
+            2.3313470184803009e-01 -7.6271809637546539e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -6.7614473402500153e-02</internalNodes>
+          <leafValues>
+            -5.2013260126113892e-01 1.3785160146653652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 -3.9636880159378052e-01</internalNodes>
+          <leafValues>
+            -7.6267188787460327e-01 2.0686520263552666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 1.2813470093533397e-03</internalNodes>
+          <leafValues>
+            -1.4046239852905273e-01 1.2711919844150543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 8.4416065365076065e-03</internalNodes>
+          <leafValues>
+            7.4712827801704407e-02 -2.5663131475448608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 1.4749030015082099e-05</internalNodes>
+          <leafValues>
+            -1.4015120267868042e-01 1.5210489928722382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 -4.5073211193084717e-02</internalNodes>
+          <leafValues>
+            -6.4262861013412476e-01 2.5925450026988983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 7.7068619430065155e-03</internalNodes>
+          <leafValues>
+            3.2485689967870712e-02 -2.0377029478549957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 5.9383822372183204e-04</internalNodes>
+          <leafValues>
+            -1.2950329482555389e-01 1.6219380497932434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 -1.3042639475315809e-03</internalNodes>
+          <leafValues>
+            8.6318843066692352e-02 -1.9224709272384644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 6.4417850226163864e-03</internalNodes>
+          <leafValues>
+            -7.1506053209304810e-02 3.0627349019050598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 -1.5630330890417099e-02</internalNodes>
+          <leafValues>
+            4.9515549093484879e-02 -1.4840349555015564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 1.1395620182156563e-02</internalNodes>
+          <leafValues>
+            6.3355296850204468e-02 -2.5576409697532654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 4.7544430941343307e-02</internalNodes>
+          <leafValues>
+            4.8167328350245953e-03 -7.8987777233123779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 8.3856023848056793e-03</internalNodes>
+          <leafValues>
+            -4.3012011796236038e-02 4.1108319163322449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 -1.6369849909096956e-03</internalNodes>
+          <leafValues>
+            8.2473292946815491e-02 -7.8956812620162964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 -1.6513109207153320e-02</internalNodes>
+          <leafValues>
+            -5.0692492723464966e-01 3.9071910083293915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 1.0358359664678574e-01</internalNodes>
+          <leafValues>
+            2.0772270858287811e-02 -6.9371747970581055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 3.3361840993165970e-02</internalNodes>
+          <leafValues>
+            -4.4479008764028549e-02 4.6392819285392761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 -2.8664430603384972e-02</internalNodes>
+          <leafValues>
+            -4.5883670449256897e-01 3.5676170140504837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 -1.1209170043002814e-04</internalNodes>
+          <leafValues>
+            8.4344513714313507e-02 -2.1555650234222412e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 1.7690200358629227e-02</internalNodes>
+          <leafValues>
+            9.7461966797709465e-03 -8.5261541604995728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 -2.1878469735383987e-02</internalNodes>
+          <leafValues>
+            2.6345950365066528e-01 -7.0220641791820526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 -1.2424430251121521e-01</internalNodes>
+          <leafValues>
+            -2.8659409284591675e-01 2.1816140040755272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 6.5736092627048492e-02</internalNodes>
+          <leafValues>
+            2.3600580170750618e-02 -7.0263791084289551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 -4.4633701443672180e-02</internalNodes>
+          <leafValues>
+            -9.5776432752609253e-01 3.5877549089491367e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 -6.4271576702594757e-02</internalNodes>
+          <leafValues>
+            6.0099518299102783e-01 -2.8557619079947472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 5.6516240874771029e-05</internalNodes>
+          <leafValues>
+            -1.3485489785671234e-01 1.1080929636955261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 1.3419260503724217e-03</internalNodes>
+          <leafValues>
+            9.8325006663799286e-02 -1.6883499920368195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 -2.1889729425311089e-02</internalNodes>
+          <leafValues>
+            -2.1880550682544708e-01 2.9620679095387459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 -1.9670790061354637e-03</internalNodes>
+          <leafValues>
+            9.7642809152603149e-02 -1.8062870204448700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -7.6196521520614624e-02</internalNodes>
+          <leafValues>
+            -8.6387622356414795e-01 7.3730680160224438e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 -7.9841358819976449e-04</internalNodes>
+          <leafValues>
+            1.5353679656982422e-01 -1.2105809897184372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 -8.2246732199564576e-04</internalNodes>
+          <leafValues>
+            4.0794339030981064e-02 -1.3737790286540985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -3.0324649997055531e-03</internalNodes>
+          <leafValues>
+            1.2088210135698318e-01 -1.4088730514049530e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>107</maxWeakCount>
+      <stageThreshold>-3.0838300704956055e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1190 -5.2718650549650192e-02</internalNodes>
+          <leafValues>
+            2.5985679030418396e-01 -1.5721979737281799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 5.1614670082926750e-03</internalNodes>
+          <leafValues>
+            -1.0271859914064407e-01 5.9346981346607208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 6.7699067294597626e-02</internalNodes>
+          <leafValues>
+            -7.7311262488365173e-02 2.8602010011672974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 -3.3822011202573776e-02</internalNodes>
+          <leafValues>
+            -5.6999057531356812e-01 4.0684528648853302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 -5.3746398538351059e-02</internalNodes>
+          <leafValues>
+            -4.7421398758888245e-01 6.2751591205596924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 -3.0559560284018517e-02</internalNodes>
+          <leafValues>
+            7.1638780832290649e-01 -1.7423950135707855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 -3.3822011202573776e-02</internalNodes>
+          <leafValues>
+            -6.7283177375793457e-01 -1.2177439639344811e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 2.7876009698957205e-04</internalNodes>
+          <leafValues>
+            -7.0205226540565491e-02 1.1648730188608170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 -2.5016230065375566e-03</internalNodes>
+          <leafValues>
+            1.2915210425853729e-01 -1.3576079905033112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 9.0835839509963989e-02</internalNodes>
+          <leafValues>
+            4.1303969919681549e-03 4.0111660957336426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 -2.5603260844945908e-02</internalNodes>
+          <leafValues>
+            -1.0059480369091034e-01 1.8819159269332886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 -5.2134461700916290e-02</internalNodes>
+          <leafValues>
+            2.5282728672027588e-01 -1.1447659879922867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 3.8462068885564804e-02</internalNodes>
+          <leafValues>
+            5.5828869342803955e-02 -5.7635480165481567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 -1.4195869443938136e-03</internalNodes>
+          <leafValues>
+            4.5769099146127701e-02 -1.6001120209693909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 -7.6488167047500610e-02</internalNodes>
+          <leafValues>
+            -5.2531337738037109e-01 5.2011650055646896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 1.2786199804395437e-03</internalNodes>
+          <leafValues>
+            7.6051406562328339e-02 -2.5104090571403503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 -1.2661969522014260e-03</internalNodes>
+          <leafValues>
+            -1.2411650270223618e-01 1.6375949978828430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 -9.0841390192508698e-03</internalNodes>
+          <leafValues>
+            2.2613930702209473e-01 -5.4559618234634399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 7.4418167059775442e-05</internalNodes>
+          <leafValues>
+            -1.6488799452781677e-01 1.0864400118589401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 -2.5643699336796999e-03</internalNodes>
+          <leafValues>
+            -1.8933239579200745e-01 1.0298830270767212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 -3.4997228533029556e-02</internalNodes>
+          <leafValues>
+            2.3746269941329956e-01 -8.2390688359737396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 -1.9422829151153564e-02</internalNodes>
+          <leafValues>
+            -9.9691540002822876e-02 4.0376558899879456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 -5.9601478278636932e-02</internalNodes>
+          <leafValues>
+            -9.1162431240081787e-01 1.8367420881986618e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 3.4046408534049988e-01</internalNodes>
+          <leafValues>
+            6.0519641265273094e-03 -4.4584161043167114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 6.5878271125257015e-03</internalNodes>
+          <leafValues>
+            -9.5767751336097717e-02 1.8087559938430786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 5.3841830231249332e-03</internalNodes>
+          <leafValues>
+            5.2658561617136002e-02 -4.5202389359474182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 7.9094972461462021e-03</internalNodes>
+          <leafValues>
+            3.8064301013946533e-02 -4.5984381437301636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 -1.7566539347171783e-02</internalNodes>
+          <leafValues>
+            1.1139140278100967e-01 -2.9564509168267250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 -1.1352599831297994e-03</internalNodes>
+          <leafValues>
+            1.0825510323047638e-01 -1.8355409801006317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 1.4237280189990997e-01</internalNodes>
+          <leafValues>
+            -3.1995229423046112e-02 3.8099318742752075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -1.0024409741163254e-01</internalNodes>
+          <leafValues>
+            -7.7461862564086914e-01 2.3992599919438362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 -1.2453799694776535e-01</internalNodes>
+          <leafValues>
+            2.1255059540271759e-01 -9.1748759150505066e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 1.9641380012035370e-01</internalNodes>
+          <leafValues>
+            3.3028271049261093e-02 -6.0223150253295898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 -4.1467338800430298e-02</internalNodes>
+          <leafValues>
+            -8.8264447450637817e-01 1.3399540446698666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 -3.0020199716091156e-02</internalNodes>
+          <leafValues>
+            5.8158951997756958e-01 -3.9801310747861862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 1.9002150744199753e-02</internalNodes>
+          <leafValues>
+            -2.4508230388164520e-02 3.2259100675582886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 -1.0837280191481113e-02</internalNodes>
+          <leafValues>
+            -2.5428688526153564e-01 7.3384523391723633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 -2.4493860080838203e-02</internalNodes>
+          <leafValues>
+            1.4883559942245483e-01 -3.6729950457811356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 4.7652618959546089e-03</internalNodes>
+          <leafValues>
+            1.2693640589714050e-01 -1.9157619774341583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 -1.2438010424375534e-02</internalNodes>
+          <leafValues>
+            7.1727007627487183e-02 -2.5421911478042603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 2.1275319159030914e-02</internalNodes>
+          <leafValues>
+            -4.9392588436603546e-02 5.2715432643890381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 -6.7369833588600159e-02</internalNodes>
+          <leafValues>
+            -4.6891281008720398e-01 4.2881548404693604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 -1.0925510432571173e-03</internalNodes>
+          <leafValues>
+            1.1250150203704834e-01 -1.3688379526138306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 -9.7863428294658661e-02</internalNodes>
+          <leafValues>
+            -8.5167092084884644e-01 7.9745445400476456e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 -2.0980979315936565e-03</internalNodes>
+          <leafValues>
+            7.2556197643280029e-02 -2.1253560483455658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 4.4975668191909790e-02</internalNodes>
+          <leafValues>
+            -6.4254011958837509e-03 6.7334640026092529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 -2.0970530807971954e-02</internalNodes>
+          <leafValues>
+            -1.5341369807720184e-01 1.1229439824819565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 7.1862142067402601e-04</internalNodes>
+          <leafValues>
+            -1.3690039515495300e-01 1.2323109805583954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 1.1921999976038933e-02</internalNodes>
+          <leafValues>
+            -5.2036911249160767e-02 3.5095539689064026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 -1.2956890277564526e-02</internalNodes>
+          <leafValues>
+            8.7813578546047211e-02 -2.8173919767141342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 -2.7972649782896042e-02</internalNodes>
+          <leafValues>
+            -5.9018450975418091e-01 2.4770129472017288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 -6.0088839381933212e-03</internalNodes>
+          <leafValues>
+            -6.5963357686996460e-02 3.6277290433645248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 -4.0854439139366150e-03</internalNodes>
+          <leafValues>
+            1.8211939930915833e-01 -8.9567668735980988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 6.3200960867106915e-03</internalNodes>
+          <leafValues>
+            2.3888850584626198e-02 -1.0606460273265839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 2.0633619278669357e-02</internalNodes>
+          <leafValues>
+            -3.8176801055669785e-02 5.2134162187576294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 -2.5221719406545162e-03</internalNodes>
+          <leafValues>
+            4.6510368585586548e-02 -9.3957871198654175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1246 -4.6648699790239334e-03</internalNodes>
+          <leafValues>
+            -2.3734979331493378e-01 8.0608420073986053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 2.5844529736787081e-03</internalNodes>
+          <leafValues>
+            -2.4275559931993484e-02 2.2888250648975372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 -1.4966880371503066e-05</internalNodes>
+          <leafValues>
+            9.9380202591419220e-02 -1.9830170273780823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 6.2676537781953812e-03</internalNodes>
+          <leafValues>
+            -7.4367232620716095e-02 2.2790339589118958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1250 2.6347549632191658e-02</internalNodes>
+          <leafValues>
+            1.9285459071397781e-02 -8.8683319091796875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 -6.0268949717283249e-02</internalNodes>
+          <leafValues>
+            1.2562690675258636e-01 -3.3716868609189987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -3.8371770642697811e-03</internalNodes>
+          <leafValues>
+            -1.7735309898853302e-01 8.8588736951351166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 -3.5063549876213074e-03</internalNodes>
+          <leafValues>
+            -8.7100908160209656e-02 5.6650858372449875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 -8.1536881625652313e-03</internalNodes>
+          <leafValues>
+            2.5863811373710632e-01 -5.9690609574317932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 3.8574129343032837e-02</internalNodes>
+          <leafValues>
+            8.4148198366165161e-03 -4.3409061431884766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 -3.9269659668207169e-02</internalNodes>
+          <leafValues>
+            3.5469511151313782e-01 -4.3248169124126434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 -1.7512469785287976e-03</internalNodes>
+          <leafValues>
+            8.6816087365150452e-02 -9.6924632787704468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 -8.4061250090599060e-02</internalNodes>
+          <leafValues>
+            -6.5256571769714355e-01 2.4765320122241974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 -4.3417539447546005e-02</internalNodes>
+          <leafValues>
+            -5.6205427646636963e-01 9.8713487386703491e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 -1.3643169775605202e-02</internalNodes>
+          <leafValues>
+            2.4562139809131622e-01 -6.0552708804607391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 1.6490360721945763e-02</internalNodes>
+          <leafValues>
+            3.8866888731718063e-02 -2.7715849876403809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 -1.4422900043427944e-02</internalNodes>
+          <leafValues>
+            -2.2820469737052917e-01 5.9026841074228287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 2.7178740128874779e-03</internalNodes>
+          <leafValues>
+            -1.1887180060148239e-01 1.2192229926586151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 6.3701239414513111e-03</internalNodes>
+          <leafValues>
+            -1.7167779803276062e-01 9.9555417895317078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 8.1290200352668762e-02</internalNodes>
+          <leafValues>
+            -2.2509740665555000e-02 2.4472869932651520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 -1.4793650188948959e-04</internalNodes>
+          <leafValues>
+            8.0845691263675690e-02 -2.1680369973182678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 -6.9097941741347313e-04</internalNodes>
+          <leafValues>
+            6.2281239777803421e-02 -1.4082409441471100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 -1.1455359868705273e-02</internalNodes>
+          <leafValues>
+            -1.1722529679536819e-01 1.5948510169982910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 -1.6334399580955505e-01</internalNodes>
+          <leafValues>
+            -3.4727150201797485e-01 1.1003250256180763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 -6.8652302026748657e-02</internalNodes>
+          <leafValues>
+            2.5441581010818481e-01 -7.8778758645057678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 6.9226641207933426e-03</internalNodes>
+          <leafValues>
+            -2.9800569638609886e-02 2.0455279946327209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 -1.0851600021123886e-01</internalNodes>
+          <leafValues>
+            -4.7375029325485229e-01 4.0704440325498581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 5.8868151158094406e-02</internalNodes>
+          <leafValues>
+            1.3014429714530706e-03 -1.0001180171966553e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 1.5332780312746763e-03</internalNodes>
+          <leafValues>
+            -1.6441990435123444e-01 9.9495269358158112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 -2.5576220359653234e-03</internalNodes>
+          <leafValues>
+            8.1458933651447296e-02 -9.0945683419704437e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 3.6009950563311577e-03</internalNodes>
+          <leafValues>
+            8.6760893464088440e-02 -1.9872209429740906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 1.0986080393195152e-02</internalNodes>
+          <leafValues>
+            -4.8230320215225220e-02 1.9264499843120575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 -4.4403300853446126e-04</internalNodes>
+          <leafValues>
+            2.0115670561790466e-01 -8.3059810101985931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 2.9464240651577711e-04</internalNodes>
+          <leafValues>
+            -1.2808699905872345e-01 6.6652536392211914e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 -4.1320081800222397e-02</internalNodes>
+          <leafValues>
+            -5.3510922193527222e-01 2.9578590765595436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 8.1929996609687805e-02</internalNodes>
+          <leafValues>
+            -1.6939610242843628e-02 7.6524221897125244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 1.4758399687707424e-02</internalNodes>
+          <leafValues>
+            2.7206780388951302e-02 -6.2607800960540771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1283 -1.7577099800109863e-01</internalNodes>
+          <leafValues>
+            1.0328330099582672e-01 -5.1863618195056915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 -1.0492449626326561e-02</internalNodes>
+          <leafValues>
+            -1.9424819946289062e-01 8.5835307836532593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 -5.6793028488755226e-03</internalNodes>
+          <leafValues>
+            1.6252349317073822e-01 -1.1607410013675690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 -7.7026091516017914e-02</internalNodes>
+          <leafValues>
+            -1.6585369408130646e-01 1.0487639904022217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 8.8255241513252258e-02</internalNodes>
+          <leafValues>
+            -4.2857029475271702e-03 1.0002230405807495e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 -2.5600788649171591e-04</internalNodes>
+          <leafValues>
+            1.3218410313129425e-01 -1.4754749834537506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 3.4532468765974045e-02</internalNodes>
+          <leafValues>
+            -4.7874059528112411e-02 2.7708581089973450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 1.0978250205516815e-01</internalNodes>
+          <leafValues>
+            -2.1606300026178360e-02 8.5059100389480591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 3.6717768758535385e-02</internalNodes>
+          <leafValues>
+            1.6276430338621140e-02 -8.9000707864761353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 -6.1206728219985962e-02</internalNodes>
+          <leafValues>
+            5.4838019609451294e-01 -3.1625121831893921e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 2.9046889394521713e-03</internalNodes>
+          <leafValues>
+            4.1483800858259201e-02 -8.6054533720016479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 6.9003179669380188e-02</internalNodes>
+          <leafValues>
+            -2.6552880182862282e-02 6.0647368431091309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 7.0049421628937125e-04</internalNodes>
+          <leafValues>
+            -1.9934299588203430e-01 7.5443200767040253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 3.4873239696025848e-02</internalNodes>
+          <leafValues>
+            3.9036870002746582e-02 -4.2251279950141907e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>71</maxWeakCount>
+      <stageThreshold>-3.0640199661254883e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1297 5.4466608911752701e-02</internalNodes>
+          <leafValues>
+            -1.3182820379734039e-01 2.7660441398620605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 -2.1856650710105896e-02</internalNodes>
+          <leafValues>
+            2.5475510954856873e-01 -8.4045611321926117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 6.6198781132698059e-03</internalNodes>
+          <leafValues>
+            7.1489393711090088e-02 -2.6304081082344055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 8.8211596012115479e-03</internalNodes>
+          <leafValues>
+            -1.3396710157394409e-01 1.4222930371761322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 -2.3251229524612427e-01</internalNodes>
+          <leafValues>
+            -3.4628748893737793e-01 5.6767478585243225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 2.8472349047660828e-01</internalNodes>
+          <leafValues>
+            8.6089121177792549e-03 -1.0012650489807129e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 4.2303521186113358e-02</internalNodes>
+          <leafValues>
+            -9.1637752950191498e-02 1.9090470671653748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 4.9781981855630875e-02</internalNodes>
+          <leafValues>
+            2.9709989205002785e-02 -3.5961869359016418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 -4.8924300819635391e-02</internalNodes>
+          <leafValues>
+            -3.8387179374694824e-01 5.5182989686727524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 -7.7399803558364511e-05</internalNodes>
+          <leafValues>
+            -1.2758800387382507e-01 9.4793520867824554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 -2.4455290287733078e-02</internalNodes>
+          <leafValues>
+            4.6911829710006714e-01 -5.1782071590423584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 2.5210820138454437e-02</internalNodes>
+          <leafValues>
+            4.4035088270902634e-02 -1.7653049528598785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 -4.7570910304784775e-02</internalNodes>
+          <leafValues>
+            -5.3332722187042236e-01 4.6693909913301468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 -1.4046980440616608e-01</internalNodes>
+          <leafValues>
+            3.2798460125923157e-01 -6.5607719123363495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 -1.0932429879903793e-01</internalNodes>
+          <leafValues>
+            -5.9276747703552246e-01 3.0543249100446701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 -9.8567470908164978e-02</internalNodes>
+          <leafValues>
+            3.6753898859024048e-01 -6.6568426787853241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 -7.6861098408699036e-02</internalNodes>
+          <leafValues>
+            -1.3722559809684753e-01 1.7806069552898407e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 -2.1035360172390938e-02</internalNodes>
+          <leafValues>
+            4.3632039427757263e-01 -2.9524799436330795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 1.3428479433059692e-03</internalNodes>
+          <leafValues>
+            -2.4420669674873352e-01 1.1969459801912308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 -3.4433171153068542e-02</internalNodes>
+          <leafValues>
+            2.7110278606414795e-01 -7.5950436294078827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 1.7944410210475326e-03</internalNodes>
+          <leafValues>
+            -1.7997020483016968e-01 1.3508750498294830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 -9.6644267439842224e-02</internalNodes>
+          <leafValues>
+            -7.6689988374710083e-01 1.5435869805514812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 2.5092919822782278e-03</internalNodes>
+          <leafValues>
+            -1.2506179511547089e-01 1.8814159929752350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 -2.2511319257318974e-03</internalNodes>
+          <leafValues>
+            7.8268818557262421e-02 -7.2636753320693970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 -7.4670952017186210e-06</internalNodes>
+          <leafValues>
+            7.6933227479457855e-02 -2.6148709654808044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 2.6573959738016129e-02</internalNodes>
+          <leafValues>
+            2.2534679621458054e-02 -1.6299429535865784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 1.7086470499634743e-02</internalNodes>
+          <leafValues>
+            -5.8232828974723816e-02 3.6095941066741943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 3.0147018842399120e-03</internalNodes>
+          <leafValues>
+            1.2817589938640594e-01 -1.8230159580707550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 9.4206426292657852e-03</internalNodes>
+          <leafValues>
+            8.9825786650180817e-02 -2.6877298951148987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 7.5143040157854557e-04</internalNodes>
+          <leafValues>
+            8.8295407593250275e-02 -2.3304849863052368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 -1.0687969624996185e-02</internalNodes>
+          <leafValues>
+            3.0612778663635254e-01 -6.5760366618633270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 7.5001686811447144e-02</internalNodes>
+          <leafValues>
+            4.3955240398645401e-03 -7.5094991922378540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 5.0849020481109619e-02</internalNodes>
+          <leafValues>
+            2.0524559542536736e-02 -8.3406442403793335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 2.3555630818009377e-02</internalNodes>
+          <leafValues>
+            3.6320169456303120e-03 -8.8322782516479492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 -1.6827480867505074e-02</internalNodes>
+          <leafValues>
+            -6.5697771310806274e-01 2.3138659074902534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 1.9977349787950516e-02</internalNodes>
+          <leafValues>
+            -2.3847330361604691e-02 3.2636478543281555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 3.1397528946399689e-02</internalNodes>
+          <leafValues>
+            -3.6343611776828766e-02 4.4792640209197998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 -9.3282759189605713e-02</internalNodes>
+          <leafValues>
+            -5.2942079305648804e-01 6.3824458047747612e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 -7.7012612018734217e-04</internalNodes>
+          <leafValues>
+            1.5420450270175934e-01 -1.5751419961452484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 4.6891491860151291e-02</internalNodes>
+          <leafValues>
+            1.1802299879491329e-02 -7.3092728853225708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 -3.4607138950377703e-03</internalNodes>
+          <leafValues>
+            1.1565960198640823e-01 -1.7568419873714447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 -3.3493418246507645e-02</internalNodes>
+          <leafValues>
+            -6.8049472570419312e-01 5.1433579064905643e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 -5.5793918669223785e-02</internalNodes>
+          <leafValues>
+            -5.3908890485763550e-01 3.2008830457925797e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 5.1339478231966496e-03</internalNodes>
+          <leafValues>
+            -6.6114626824855804e-02 3.1760030984878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 3.0386429280042648e-03</internalNodes>
+          <leafValues>
+            8.1462718546390533e-02 -2.4291920661926270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 -3.1149981077760458e-04</internalNodes>
+          <leafValues>
+            4.6723391860723495e-02 -8.4542676806449890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 1.8326110439375043e-03</internalNodes>
+          <leafValues>
+            -1.2830300629138947e-01 1.5127150714397430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 -2.5878880172967911e-02</internalNodes>
+          <leafValues>
+            -2.1160699427127838e-01 2.9811259359121323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 -1.3985199620947242e-03</internalNodes>
+          <leafValues>
+            1.9801080226898193e-01 -1.0368689894676208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 2.4663188960403204e-03</internalNodes>
+          <leafValues>
+            2.4554869160056114e-02 -1.0830429941415787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 -1.3155230553820729e-03</internalNodes>
+          <leafValues>
+            -2.1984469890594482e-01 9.3965977430343628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 -1.0562440007925034e-01</internalNodes>
+          <leafValues>
+            -7.9747790098190308e-01 8.9689819142222404e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 -3.0508160125464201e-03</internalNodes>
+          <leafValues>
+            1.3266490399837494e-01 -1.3734680414199829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 2.9857279732823372e-02</internalNodes>
+          <leafValues>
+            9.6069881692528725e-03 -3.0116540193557739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 3.0972119420766830e-02</internalNodes>
+          <leafValues>
+            3.0091350898146629e-02 -5.7279831171035767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1352 1.0772749781608582e-01</internalNodes>
+          <leafValues>
+            -1.1804240057244897e-03 -9.9987578392028809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 -5.1501881331205368e-02</internalNodes>
+          <leafValues>
+            2.7181380987167358e-01 -6.8161502480506897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 -2.5288289412856102e-02</internalNodes>
+          <leafValues>
+            4.5067310333251953e-01 -1.6520980745553970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 -4.2859618552029133e-03</internalNodes>
+          <leafValues>
+            3.7213888764381409e-01 -4.9761738628149033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 -2.3194460198283195e-02</internalNodes>
+          <leafValues>
+            -2.0697650313377380e-01 4.1071210056543350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 1.6878530383110046e-02</internalNodes>
+          <leafValues>
+            5.6408129632472992e-02 -3.7614488601684570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1358 -2.9601169750094414e-02</internalNodes>
+          <leafValues>
+            2.7207991480827332e-01 -7.3090076446533203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 -1.0797269642353058e-01</internalNodes>
+          <leafValues>
+            -4.9193540215492249e-01 3.6118570715188980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 2.5317850708961487e-01</internalNodes>
+          <leafValues>
+            8.8794529438018799e-03 -3.4746390581130981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 -7.5927868485450745e-02</internalNodes>
+          <leafValues>
+            -5.2568101882934570e-01 3.0029149726033211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 3.5496079362928867e-03</internalNodes>
+          <leafValues>
+            6.1817318201065063e-02 -2.3450049757957458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 -1.0419470258057117e-02</internalNodes>
+          <leafValues>
+            9.5470182597637177e-02 -1.9764930009841919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 -1.6242120414972305e-02</internalNodes>
+          <leafValues>
+            3.5856780409812927e-01 -5.2510499954223633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 -1.4503370039165020e-03</internalNodes>
+          <leafValues>
+            -1.8003490567207336e-01 9.5208331942558289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 1.9696209579706192e-02</internalNodes>
+          <leafValues>
+            3.7537660449743271e-02 -4.8065909743309021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 3.4964820370078087e-03</internalNodes>
+          <leafValues>
+            -9.7187377512454987e-02 1.7569050192832947e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>96</maxWeakCount>
+      <stageThreshold>-3.0804899215698242e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1368 -1.4011229574680328e-01</internalNodes>
+          <leafValues>
+            3.5787770152091980e-01 -1.2125530093908310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 -1.0008949786424637e-02</internalNodes>
+          <leafValues>
+            2.6330929994583130e-01 -8.9008018374443054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 -1.1394180357456207e-02</internalNodes>
+          <leafValues>
+            4.3228828907012939e-01 -5.0159178674221039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 2.3134359717369080e-01</internalNodes>
+          <leafValues>
+            6.3841762021183968e-03 -7.0292097330093384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 1.2646619975566864e-01</internalNodes>
+          <leafValues>
+            4.2768001556396484e-02 -4.3919000029563904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 4.6616248786449432e-02</internalNodes>
+          <leafValues>
+            1.9250590354204178e-02 5.4499799013137817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 2.2037800401449203e-02</internalNodes>
+          <leafValues>
+            -8.5108749568462372e-02 3.3848780393600464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 3.1345561146736145e-02</internalNodes>
+          <leafValues>
+            2.2690940648317337e-02 -5.1671189069747925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 -2.1140639483928680e-01</internalNodes>
+          <leafValues>
+            2.9412490129470825e-01 -4.6479560434818268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 -6.6334113478660583e-02</internalNodes>
+          <leafValues>
+            -1.3444049656391144e-01 1.2842020392417908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 4.0738668292760849e-02</internalNodes>
+          <leafValues>
+            2.3405810818076134e-02 -8.0233561992645264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 -4.1470870375633240e-02</internalNodes>
+          <leafValues>
+            1.4620569348335266e-01 -1.9590210169553757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 1.8456790596246719e-02</internalNodes>
+          <leafValues>
+            -3.6185469478368759e-02 5.1238268613815308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 3.7538509350270033e-03</internalNodes>
+          <leafValues>
+            -1.5587760508060455e-01 1.0312390327453613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 -2.8798980638384819e-03</internalNodes>
+          <leafValues>
+            -1.2225770205259323e-01 1.7551769316196442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -3.2762341201305389e-02</internalNodes>
+          <leafValues>
+            -4.7169759869575500e-01 3.0380319803953171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 -3.9022210985422134e-02</internalNodes>
+          <leafValues>
+            3.5106760263442993e-01 -6.6119261085987091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 -4.4674798846244812e-02</internalNodes>
+          <leafValues>
+            -3.9958310127258301e-01 2.1066389977931976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 5.3343027830123901e-03</internalNodes>
+          <leafValues>
+            7.9137377440929413e-02 -2.1176779270172119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 1.5521169640123844e-02</internalNodes>
+          <leafValues>
+            3.4438930451869965e-02 -5.7202047109603882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 -8.0842437455430627e-04</internalNodes>
+          <leafValues>
+            1.1951749771833420e-01 -1.4325830340385437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 2.7754740789532661e-02</internalNodes>
+          <leafValues>
+            -3.2436888664960861e-02 3.0749228596687317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 -3.4786630421876907e-03</internalNodes>
+          <leafValues>
+            1.5688750147819519e-01 -1.5649950504302979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 -2.7840979397296906e-02</internalNodes>
+          <leafValues>
+            -1.2932580709457397e-01 1.5408019721508026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 -2.0033390319440514e-04</internalNodes>
+          <leafValues>
+            1.0591139644384384e-01 -2.3829479515552521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 6.3352532684803009e-02</internalNodes>
+          <leafValues>
+            -3.5057701170444489e-02 1.1119090020656586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1394 -1.0634259879589081e-01</internalNodes>
+          <leafValues>
+            -6.7938178777694702e-01 2.7465900406241417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 1.9035820150747895e-04</internalNodes>
+          <leafValues>
+            -1.1908160150051117e-01 1.1334689706563950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 -1.3564240187406540e-02</internalNodes>
+          <leafValues>
+            2.7505800127983093e-01 -6.8315982818603516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 2.1096229553222656e-02</internalNodes>
+          <leafValues>
+            -1.0987949557602406e-02 3.9935430884361267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 -2.4880920536816120e-03</internalNodes>
+          <leafValues>
+            -2.1849539875984192e-01 8.9293807744979858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 1.2370670214295387e-02</internalNodes>
+          <leafValues>
+            -9.5645450055599213e-02 5.6633960455656052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 -1.2036350369453430e-01</internalNodes>
+          <leafValues>
+            -5.3174102306365967e-01 3.5775080323219299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 -6.7138060927391052e-02</internalNodes>
+          <leafValues>
+            2.1456840634346008e-01 -8.7389126420021057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 -1.2161920219659805e-01</internalNodes>
+          <leafValues>
+            -1.8160809576511383e-01 1.4573550224304199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1403 2.0479459315538406e-02</internalNodes>
+          <leafValues>
+            -5.5715341120958328e-02 6.1189219355583191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 2.1847079042345285e-03</internalNodes>
+          <leafValues>
+            -9.5258213579654694e-02 2.0591090619564056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1405 4.0952740237116814e-03</internalNodes>
+          <leafValues>
+            -1.1867360025644302e-01 4.6696461737155914e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 -3.5035728942602873e-03</internalNodes>
+          <leafValues>
+            2.3321969807147980e-01 -7.5537599623203278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 -1.0467019863426685e-02</internalNodes>
+          <leafValues>
+            -1.2448009848594666e-01 5.0595261156558990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 -1.5020829625427723e-02</internalNodes>
+          <leafValues>
+            9.1991908848285675e-02 -2.2077399492263794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 4.4499050825834274e-02</internalNodes>
+          <leafValues>
+            3.4101899713277817e-02 -5.3422772884368896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 8.1879837671294808e-04</internalNodes>
+          <leafValues>
+            -1.9193440675735474e-01 1.0177730023860931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 -2.9793549329042435e-02</internalNodes>
+          <leafValues>
+            4.1442748904228210e-01 -2.0298149436712265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 1.6614329069852829e-02</internalNodes>
+          <leafValues>
+            1.0457099974155426e-01 -1.8352369964122772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 -2.2510789334774017e-02</internalNodes>
+          <leafValues>
+            1.8911230564117432e-01 -3.3867038786411285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 2.0407250151038170e-02</internalNodes>
+          <leafValues>
+            -5.8524370193481445e-02 3.5967621207237244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 3.0294319149106741e-03</internalNodes>
+          <leafValues>
+            -1.4031639695167542e-01 5.4849781095981598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 5.8518280275166035e-04</internalNodes>
+          <leafValues>
+            9.5523588359355927e-02 -1.9650359451770782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 1.7756339162588120e-02</internalNodes>
+          <leafValues>
+            1.6195869073271751e-02 -5.8534300327301025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 -3.2687620259821415e-03</internalNodes>
+          <leafValues>
+            -3.0802598595619202e-01 6.5568111836910248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 3.4140530042350292e-03</internalNodes>
+          <leafValues>
+            -8.2502417266368866e-02 9.9890269339084625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 6.3527207821607590e-03</internalNodes>
+          <leafValues>
+            -3.5163778811693192e-02 5.4237622022628784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 2.0045090932399035e-03</internalNodes>
+          <leafValues>
+            -1.0081720352172852e-01 9.6935041248798370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 6.9825910031795502e-03</internalNodes>
+          <leafValues>
+            -1.6012389957904816e-01 1.1348509788513184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 4.5963011682033539e-02</internalNodes>
+          <leafValues>
+            6.1929170042276382e-03 -8.8551759719848633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 3.7062391638755798e-02</internalNodes>
+          <leafValues>
+            2.0128250122070312e-02 -8.0933511257171631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 -4.1522808372974396e-02</internalNodes>
+          <leafValues>
+            2.0597919821739197e-01 -3.1927939504384995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 1.6521860659122467e-01</internalNodes>
+          <leafValues>
+            2.5524839758872986e-02 -6.2951612472534180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -2.3188880085945129e-01</internalNodes>
+          <leafValues>
+            1.3953979313373566e-01 -6.1611790210008621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 -2.8150070458650589e-02</internalNodes>
+          <leafValues>
+            -1.3676370680332184e-01 1.1677569895982742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 2.0499450620263815e-03</internalNodes>
+          <leafValues>
+            -1.5855039656162262e-01 1.3511709868907928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 1.2636490282602608e-04</internalNodes>
+          <leafValues>
+            -1.5024340152740479e-01 1.3739089667797089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 2.4286638945341110e-03</internalNodes>
+          <leafValues>
+            7.9247459769248962e-02 -2.5959441065788269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 -2.1873589605093002e-02</internalNodes>
+          <leafValues>
+            3.5590508580207825e-01 -6.1835918575525284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 -5.8419788256287575e-03</internalNodes>
+          <leafValues>
+            -1.0219120234251022e-01 3.9997130632400513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 -2.6236099656671286e-03</internalNodes>
+          <leafValues>
+            1.2129990011453629e-01 -1.4861150085926056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 1.4590419828891754e-01</internalNodes>
+          <leafValues>
+            -3.6884650588035583e-02 4.1484919190406799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 -8.6298510432243347e-03</internalNodes>
+          <leafValues>
+            2.5522458553314209e-01 -6.9871626794338226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 -3.9153471589088440e-02</internalNodes>
+          <leafValues>
+            -8.5533118247985840e-01 1.4639239758253098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 3.8482698798179626e-01</internalNodes>
+          <leafValues>
+            1.7361119389533997e-02 -7.9790550470352173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 -6.3598138513043523e-04</internalNodes>
+          <leafValues>
+            1.1518269777297974e-01 -1.4216409623622894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 5.9026381932199001e-03</internalNodes>
+          <leafValues>
+            7.0523656904697418e-02 -2.3031190037727356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 -1.1841119703603908e-04</internalNodes>
+          <leafValues>
+            1.0401789844036102e-01 -1.7126679420471191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 8.1962659955024719e-02</internalNodes>
+          <leafValues>
+            2.7799099683761597e-02 -5.8331722021102905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 -7.9551688395440578e-04</internalNodes>
+          <leafValues>
+            1.2568520009517670e-01 -1.0317719727754593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 -1.5588940680027008e-01</internalNodes>
+          <leafValues>
+            6.2890201807022095e-01 -2.5191979482769966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 -1.3456310145556927e-02</internalNodes>
+          <leafValues>
+            -3.2471698522567749e-01 5.5486921221017838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 -2.1507199853658676e-02</internalNodes>
+          <leafValues>
+            2.8819179534912109e-01 -6.1176139861345291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 -1.9042069092392921e-02</internalNodes>
+          <leafValues>
+            -6.0552909970283508e-02 8.9629061520099640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 -9.1205362696200609e-04</internalNodes>
+          <leafValues>
+            1.2385459989309311e-01 -1.3584870100021362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 3.8202628493309021e-02</internalNodes>
+          <leafValues>
+            1.9218420609831810e-02 -8.4488832950592041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 5.1787391304969788e-02</internalNodes>
+          <leafValues>
+            -5.4830659180879593e-02 3.3352980017662048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 -1.3860349357128143e-01</internalNodes>
+          <leafValues>
+            -2.7164599299430847e-01 1.0680199600756168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 -3.9325959980487823e-02</internalNodes>
+          <leafValues>
+            -7.6043432950973511e-01 1.9320670515298843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -1.1157010449096560e-03</internalNodes>
+          <leafValues>
+            6.9478519260883331e-02 -2.0327170193195343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 -4.2068599723279476e-03</internalNodes>
+          <leafValues>
+            1.6007219254970551e-01 -1.0982350260019302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 3.7919029127806425e-03</internalNodes>
+          <leafValues>
+            -8.3800643682479858e-02 2.5154781341552734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 -3.1430590897798538e-02</internalNodes>
+          <leafValues>
+            -5.0590312480926514e-01 3.7667378783226013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 -4.3412651866674423e-03</internalNodes>
+          <leafValues>
+            5.8591969311237335e-02 -1.7271269857883453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 -5.6401407346129417e-04</internalNodes>
+          <leafValues>
+            1.0131839662790298e-01 -1.6737550497055054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 -1.7139960080385208e-02</internalNodes>
+          <leafValues>
+            4.9619451165199280e-02 -1.1812750250101089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 -2.3868490010499954e-02</internalNodes>
+          <leafValues>
+            -9.5875509083271027e-02 1.8404319882392883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 -8.7408810853958130e-02</internalNodes>
+          <leafValues>
+            1.4144630730152130e-01 -5.7713828980922699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 -3.9170090109109879e-02</internalNodes>
+          <leafValues>
+            -6.1036241054534912e-01 2.2308109328150749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 5.3361579775810242e-02</internalNodes>
+          <leafValues>
+            1.5027640387415886e-02 -6.5409141778945923e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          1 5 12 21 -1.</_>
+        <_>
+          5 5 4 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 26 -1.</_>
+        <_>
+          9 15 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 23 -1.</_>
+        <_>
+          5 4 4 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 9 -1.</_>
+        <_>
+          4 7 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 16 -1.</_>
+        <_>
+          3 20 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 6 -1.</_>
+        <_>
+          4 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 25 12 3 -1.</_>
+        <_>
+          5 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 12 -1.</_>
+        <_>
+          4 2 2 6 2.</_>
+        <_>
+          6 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 11 -1.</_>
+        <_>
+          5 15 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 6 -1.</_>
+        <_>
+          8 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 6 -1.</_>
+        <_>
+          4 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 5 28 -1.</_>
+        <_>
+          8 14 5 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 10 4 -1.</_>
+        <_>
+          7 24 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 11 -1.</_>
+        <_>
+          5 15 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 14 3 -1.</_>
+        <_>
+          7 25 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 13 -1.</_>
+        <_>
+          5 11 4 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 21 -1.</_>
+        <_>
+          5 9 4 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 28 -1.</_>
+        <_>
+          10 14 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 28 -1.</_>
+        <_>
+          1 14 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          8 5 3 4 2.</_>
+        <_>
+          5 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 8 -1.</_>
+        <_>
+          3 5 3 4 2.</_>
+        <_>
+          6 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 4 12 -1.</_>
+        <_>
+          12 16 2 6 2.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          4 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 21 -1.</_>
+        <_>
+          5 5 4 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 12 -1.</_>
+        <_>
+          7 15 6 6 2.</_>
+        <_>
+          1 21 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 3 -1.</_>
+        <_>
+          6 25 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 8 -1.</_>
+        <_>
+          8 14 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 25 8 3 -1.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 4 -1.</_>
+        <_>
+          5 24 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 6 -1.</_>
+        <_>
+          3 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 7 -1.</_>
+        <_>
+          8 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 7 -1.</_>
+        <_>
+          4 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 18 -1.</_>
+        <_>
+          1 3 6 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 4 8 -1.</_>
+        <_>
+          3 20 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 18 -1.</_>
+        <_>
+          6 19 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 13 -1.</_>
+        <_>
+          5 8 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 27 -1.</_>
+        <_>
+          5 9 4 9 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 12 7 -1.</_>
+        <_>
+          5 20 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 10 3 -1.</_>
+        <_>
+          7 25 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 14 2 -1.</_>
+        <_>
+          0 26 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 9 -1.</_>
+        <_>
+          5 15 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 23 6 5 -1.</_>
+        <_>
+          8 23 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 14 2 -1.</_>
+        <_>
+          7 26 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 2 18 -1.</_>
+        <_>
+          8 19 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 12 -1.</_>
+        <_>
+          4 4 2 6 2.</_>
+        <_>
+          6 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 24 9 4 -1.</_>
+        <_>
+          7 24 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 15 -1.</_>
+        <_>
+          5 8 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 2 12 -1.</_>
+        <_>
+          11 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 7 16 -1.</_>
+        <_>
+          2 12 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 6 -1.</_>
+        <_>
+          3 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 8 -1.</_>
+        <_>
+          10 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 7 -1.</_>
+        <_>
+          2 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 3 -1.</_>
+        <_>
+          6 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 3 -1.</_>
+        <_>
+          4 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 4 -1.</_>
+        <_>
+          1 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 12 -1.</_>
+        <_>
+          7 2 7 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 6 -1.</_>
+        <_>
+          7 19 7 3 2.</_>
+        <_>
+          0 22 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          5 14 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 4 -1.</_>
+        <_>
+          5 24 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 14 -1.</_>
+        <_>
+          2 1 2 7 2.</_>
+        <_>
+          4 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 6 -1.</_>
+        <_>
+          10 3 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 6 4 -1.</_>
+        <_>
+          4 3 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 14 8 -1.</_>
+        <_>
+          0 16 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 7 -1.</_>
+        <_>
+          7 15 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 8 -1.</_>
+        <_>
+          5 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 4 8 -1.</_>
+        <_>
+          9 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 8 -1.</_>
+        <_>
+          3 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 7 -1.</_>
+        <_>
+          9 18 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 7 -1.</_>
+        <_>
+          3 18 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 6 -1.</_>
+        <_>
+          7 5 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          7 5 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 12 -1.</_>
+        <_>
+          5 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 11 -1.</_>
+        <_>
+          4 7 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 4 -1.</_>
+        <_>
+          6 13 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 22 6 4 -1.</_>
+        <_>
+          5 22 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 14 2 -1.</_>
+        <_>
+          7 26 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 18 -1.</_>
+        <_>
+          5 9 4 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 9 22 -1.</_>
+        <_>
+          0 17 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 24 -1.</_>
+        <_>
+          7 1 6 12 2.</_>
+        <_>
+          1 13 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 23 -1.</_>
+        <_>
+          5 4 4 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 22 6 5 -1.</_>
+        <_>
+          5 22 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 22 6 5 -1.</_>
+        <_>
+          6 22 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 6 -1.</_>
+        <_>
+          5 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 8 -1.</_>
+        <_>
+          4 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 5 12 -1.</_>
+        <_>
+          6 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 14 6 -1.</_>
+        <_>
+          0 20 7 3 2.</_>
+        <_>
+          7 23 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 6 -1.</_>
+        <_>
+          8 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          7 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 12 15 -1.</_>
+        <_>
+          2 18 12 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 12 -1.</_>
+        <_>
+          0 16 2 6 2.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 26 -1.</_>
+        <_>
+          10 2 1 13 2.</_>
+        <_>
+          9 15 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 26 -1.</_>
+        <_>
+          3 2 1 13 2.</_>
+        <_>
+          4 15 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 12 -1.</_>
+        <_>
+          4 5 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 12 -1.</_>
+        <_>
+          7 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 15 -1.</_>
+        <_>
+          6 10 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 18 -1.</_>
+        <_>
+          0 19 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 8 12 -1.</_>
+        <_>
+          9 16 4 6 2.</_>
+        <_>
+          5 22 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 8 3 -1.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 8 -1.</_>
+        <_>
+          7 17 7 4 2.</_>
+        <_>
+          0 21 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 6 4 -1.</_>
+        <_>
+          5 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 23 9 4 -1.</_>
+        <_>
+          8 23 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 23 9 5 -1.</_>
+        <_>
+          3 23 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 22 -1.</_>
+        <_>
+          5 4 4 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 5 24 -1.</_>
+        <_>
+          1 10 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 23 12 4 -1.</_>
+        <_>
+          5 23 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 12 -1.</_>
+        <_>
+          5 16 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 12 11 -1.</_>
+        <_>
+          1 17 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 6 -1.</_>
+        <_>
+          8 17 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 6 -1.</_>
+        <_>
+          7 16 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 5 16 -1.</_>
+        <_>
+          2 20 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 14 -1.</_>
+        <_>
+          7 13 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 6 -1.</_>
+        <_>
+          0 11 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 7 -1.</_>
+        <_>
+          4 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 8 13 -1.</_>
+        <_>
+          5 13 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          10 2 2 6 2.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 12 -1.</_>
+        <_>
+          2 2 2 6 2.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 24 8 3 -1.</_>
+        <_>
+          6 24 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 14 6 -1.</_>
+        <_>
+          0 21 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 4 -1.</_>
+        <_>
+          4 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 5 -1.</_>
+        <_>
+          5 2 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 21 -1.</_>
+        <_>
+          4 8 2 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 2 12 -1.</_>
+        <_>
+          11 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 5 -1.</_>
+        <_>
+          7 17 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 12 -1.</_>
+        <_>
+          2 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 12 -1.</_>
+        <_>
+          8 13 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 6 -1.</_>
+        <_>
+          6 17 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 6 -1.</_>
+        <_>
+          6 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 12 -1.</_>
+        <_>
+          1 11 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 12 -1.</_>
+        <_>
+          8 13 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 12 -1.</_>
+        <_>
+          8 14 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 3 -1.</_>
+        <_>
+          4 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 8 -1.</_>
+        <_>
+          7 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 4 8 -1.</_>
+        <_>
+          5 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 24 6 4 -1.</_>
+        <_>
+          8 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 6 6 -1.</_>
+        <_>
+          4 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 5 8 -1.</_>
+        <_>
+          8 15 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 5 -1.</_>
+        <_>
+          6 15 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 7 -1.</_>
+        <_>
+          4 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 15 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 22 -1.</_>
+        <_>
+          7 15 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 22 -1.</_>
+        <_>
+          4 4 6 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 12 -1.</_>
+        <_>
+          8 3 2 6 2.</_>
+        <_>
+          6 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          8 5 3 4 2.</_>
+        <_>
+          5 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 8 -1.</_>
+        <_>
+          3 5 3 4 2.</_>
+        <_>
+          6 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 18 -1.</_>
+        <_>
+          5 19 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 6 -1.</_>
+        <_>
+          7 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 4 -1.</_>
+        <_>
+          7 6 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 24 8 3 -1.</_>
+        <_>
+          6 24 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 5 -1.</_>
+        <_>
+          4 11 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 4 12 -1.</_>
+        <_>
+          2 3 2 6 2.</_>
+        <_>
+          4 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 4 6 -1.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 12 -1.</_>
+        <_>
+          7 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 6 -1.</_>
+        <_>
+          7 16 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 6 -1.</_>
+        <_>
+          4 4 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          7 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 12 -1.</_>
+        <_>
+          7 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 12 -1.</_>
+        <_>
+          6 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 2 -1.</_>
+        <_>
+          2 25 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 12 -1.</_>
+        <_>
+          3 16 2 6 2.</_>
+        <_>
+          5 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 24 8 3 -1.</_>
+        <_>
+          6 24 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 2 -1.</_>
+        <_>
+          6 25 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 27 -1.</_>
+        <_>
+          4 10 6 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 6 4 -1.</_>
+        <_>
+          6 21 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 12 -1.</_>
+        <_>
+          4 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 4 -1.</_>
+        <_>
+          6 0 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 14 -1.</_>
+        <_>
+          7 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 6 -1.</_>
+        <_>
+          6 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 4 -1.</_>
+        <_>
+          6 24 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 12 4 -1.</_>
+        <_>
+          4 24 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 12 -1.</_>
+        <_>
+          9 13 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 4 6 -1.</_>
+        <_>
+          3 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 12 -1.</_>
+        <_>
+          8 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 12 -1.</_>
+        <_>
+          5 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 3 -1.</_>
+        <_>
+          4 1 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 23 -1.</_>
+        <_>
+          5 4 1 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 21 4 7 -1.</_>
+        <_>
+          9 21 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 12 -1.</_>
+        <_>
+          6 14 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 3 12 -1.</_>
+        <_>
+          9 13 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 12 -1.</_>
+        <_>
+          4 13 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 8 20 -1.</_>
+        <_>
+          3 7 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 12 8 -1.</_>
+        <_>
+          5 18 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          6 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 12 8 -1.</_>
+        <_>
+          5 18 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 8 4 -1.</_>
+        <_>
+          4 24 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 24 -1.</_>
+        <_>
+          7 2 1 12 2.</_>
+        <_>
+          6 14 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 12 -1.</_>
+        <_>
+          5 8 2 6 2.</_>
+        <_>
+          7 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 6 -1.</_>
+        <_>
+          7 3 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 7 -1.</_>
+        <_>
+          2 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 6 -1.</_>
+        <_>
+          7 3 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          7 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 10 19 -1.</_>
+        <_>
+          2 7 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 11 24 -1.</_>
+        <_>
+          0 16 11 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 21 -1.</_>
+        <_>
+          5 8 4 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 12 8 -1.</_>
+        <_>
+          3 18 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 4 8 -1.</_>
+        <_>
+          9 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 6 -1.</_>
+        <_>
+          4 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 9 -1.</_>
+        <_>
+          7 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 8 -1.</_>
+        <_>
+          3 17 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 13 -1.</_>
+        <_>
+          10 15 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 10 -1.</_>
+        <_>
+          9 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 10 -1.</_>
+        <_>
+          3 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 22 2 4 -1.</_>
+        <_>
+          7 22 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 22 4 2 -1.</_>
+        <_>
+          7 22 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 9 -1.</_>
+        <_>
+          7 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 11 -1.</_>
+        <_>
+          4 7 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 8 -1.</_>
+        <_>
+          8 6 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 16 -1.</_>
+        <_>
+          5 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 8 -1.</_>
+        <_>
+          8 6 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 3 -1.</_>
+        <_>
+          6 24 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 4 -1.</_>
+        <_>
+          3 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 4 -1.</_>
+        <_>
+          4 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 6 -1.</_>
+        <_>
+          6 14 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 13 -1.</_>
+        <_>
+          7 11 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 12 3 -1.</_>
+        <_>
+          4 24 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 12 -1.</_>
+        <_>
+          9 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 4 6 -1.</_>
+        <_>
+          2 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 10 16 -1.</_>
+        <_>
+          2 3 5 8 2.</_>
+        <_>
+          7 11 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 16 -1.</_>
+        <_>
+          4 20 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 11 -1.</_>
+        <_>
+          4 15 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 10 -1.</_>
+        <_>
+          3 4 3 5 2.</_>
+        <_>
+          6 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 4 -1.</_>
+        <_>
+          8 24 6 2 2.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 12 4 -1.</_>
+        <_>
+          0 24 6 2 2.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 18 -1.</_>
+        <_>
+          5 8 4 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 10 6 -1.</_>
+        <_>
+          2 22 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 26 12 2 -1.</_>
+        <_>
+          7 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 4 -1.</_>
+        <_>
+          5 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          4 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 12 -1.</_>
+        <_>
+          5 4 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          10 4 3 4 2.</_>
+        <_>
+          7 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 4 -1.</_>
+        <_>
+          0 18 7 2 2.</_>
+        <_>
+          7 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 3 12 -1.</_>
+        <_>
+          5 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 2 13 -1.</_>
+        <_>
+          8 9 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 6 -1.</_>
+        <_>
+          7 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 8 5 -1.</_>
+        <_>
+          3 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 12 -1.</_>
+        <_>
+          6 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 10 17 -1.</_>
+        <_>
+          5 7 5 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 4 -1.</_>
+        <_>
+          3 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 24 -1.</_>
+        <_>
+          5 8 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 9 4 -1.</_>
+        <_>
+          6 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 4 -1.</_>
+        <_>
+          7 14 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 23 9 4 -1.</_>
+        <_>
+          8 23 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 9 4 -1.</_>
+        <_>
+          3 22 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 22 4 6 -1.</_>
+        <_>
+          9 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 24 6 4 -1.</_>
+        <_>
+          4 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 8 9 -1.</_>
+        <_>
+          6 19 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 8 9 -1.</_>
+        <_>
+          4 19 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 12 4 -1.</_>
+        <_>
+          5 22 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 7 -1.</_>
+        <_>
+          7 19 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 6 8 -1.</_>
+        <_>
+          8 20 3 4 2.</_>
+        <_>
+          5 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 6 8 -1.</_>
+        <_>
+          3 20 3 4 2.</_>
+        <_>
+          6 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 14 -1.</_>
+        <_>
+          8 1 2 7 2.</_>
+        <_>
+          6 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 12 -1.</_>
+        <_>
+          2 2 2 6 2.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 4 -1.</_>
+        <_>
+          7 4 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 6 -1.</_>
+        <_>
+          7 4 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 5 -1.</_>
+        <_>
+          7 3 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 5 6 -1.</_>
+        <_>
+          7 3 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 4 -1.</_>
+        <_>
+          7 3 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 8 18 -1.</_>
+        <_>
+          3 8 8 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 9 12 -1.</_>
+        <_>
+          7 19 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 12 6 -1.</_>
+        <_>
+          7 21 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 8 -1.</_>
+        <_>
+          9 18 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 4 -1.</_>
+        <_>
+          5 16 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 10 6 -1.</_>
+        <_>
+          4 17 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 8 -1.</_>
+        <_>
+          3 18 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 6 -1.</_>
+        <_>
+          9 3 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 8 6 -1.</_>
+        <_>
+          5 17 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 12 9 -1.</_>
+        <_>
+          6 22 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 14 -1.</_>
+        <_>
+          2 0 2 7 2.</_>
+        <_>
+          4 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 14 -1.</_>
+        <_>
+          9 9 5 7 2.</_>
+        <_>
+          4 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 12 -1.</_>
+        <_>
+          0 16 2 6 2.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 24 8 4 -1.</_>
+        <_>
+          3 24 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 22 -1.</_>
+        <_>
+          0 16 14 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 8 -1.</_>
+        <_>
+          6 17 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 10 14 -1.</_>
+        <_>
+          0 9 5 7 2.</_>
+        <_>
+          5 16 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 9 9 -1.</_>
+        <_>
+          3 6 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 6 -1.</_>
+        <_>
+          5 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 9 -1.</_>
+        <_>
+          5 3 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 12 -1.</_>
+        <_>
+          4 7 3 6 2.</_>
+        <_>
+          7 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 18 -1.</_>
+        <_>
+          8 13 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 18 -1.</_>
+        <_>
+          4 13 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 12 4 -1.</_>
+        <_>
+          6 22 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 8 8 -1.</_>
+        <_>
+          3 16 4 4 2.</_>
+        <_>
+          7 20 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 10 -1.</_>
+        <_>
+          7 7 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 10 -1.</_>
+        <_>
+          4 8 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 17 -1.</_>
+        <_>
+          4 5 5 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 24 -1.</_>
+        <_>
+          7 4 7 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 7 -1.</_>
+        <_>
+          6 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 10 8 -1.</_>
+        <_>
+          2 20 5 4 2.</_>
+        <_>
+          7 24 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          6 7 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 6 -1.</_>
+        <_>
+          6 4 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 6 -1.</_>
+        <_>
+          6 3 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 6 -1.</_>
+        <_>
+          7 4 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          5 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 6 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 6 -1.</_>
+        <_>
+          4 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 14 -1.</_>
+        <_>
+          3 19 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 2 12 -1.</_>
+        <_>
+          11 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 6 6 -1.</_>
+        <_>
+          3 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 4 -1.</_>
+        <_>
+          3 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 12 8 -1.</_>
+        <_>
+          5 20 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 12 8 -1.</_>
+        <_>
+          3 20 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 12 -1.</_>
+        <_>
+          5 10 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 10 4 -1.</_>
+        <_>
+          4 12 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 10 4 -1.</_>
+        <_>
+          4 2 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 13 -1.</_>
+        <_>
+          4 15 6 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 2 12 -1.</_>
+        <_>
+          11 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 12 -1.</_>
+        <_>
+          3 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 6 -1.</_>
+        <_>
+          8 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 6 -1.</_>
+        <_>
+          4 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 12 14 -1.</_>
+        <_>
+          5 13 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 12 -1.</_>
+        <_>
+          2 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 21 4 6 -1.</_>
+        <_>
+          9 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 4 6 -1.</_>
+        <_>
+          3 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          10 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 4 6 -1.</_>
+        <_>
+          4 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 12 14 -1.</_>
+        <_>
+          5 13 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 6 -1.</_>
+        <_>
+          6 3 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 24 -1.</_>
+        <_>
+          5 8 4 8 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 8 -1.</_>
+        <_>
+          4 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 8 -1.</_>
+        <_>
+          2 6 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 18 -1.</_>
+        <_>
+          4 8 6 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 24 -1.</_>
+        <_>
+          3 8 8 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 6 6 -1.</_>
+        <_>
+          3 21 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 3 -1.</_>
+        <_>
+          5 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 3 -1.</_>
+        <_>
+          5 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 6 -1.</_>
+        <_>
+          5 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 6 -1.</_>
+        <_>
+          4 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 20 4 6 -1.</_>
+        <_>
+          10 20 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 8 21 -1.</_>
+        <_>
+          3 8 8 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 12 -1.</_>
+        <_>
+          9 16 2 6 2.</_>
+        <_>
+          7 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 25 12 3 -1.</_>
+        <_>
+          5 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 12 -1.</_>
+        <_>
+          9 16 2 6 2.</_>
+        <_>
+          7 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 12 -1.</_>
+        <_>
+          3 16 2 6 2.</_>
+        <_>
+          5 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 7 -1.</_>
+        <_>
+          7 17 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 4 7 -1.</_>
+        <_>
+          5 17 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 15 -1.</_>
+        <_>
+          6 8 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 22 2 4 -1.</_>
+        <_>
+          7 22 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 22 4 2 -1.</_>
+        <_>
+          7 22 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 3 -1.</_>
+        <_>
+          1 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 12 -1.</_>
+        <_>
+          4 15 3 6 2.</_>
+        <_>
+          7 21 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 3 12 -1.</_>
+        <_>
+          8 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 18 -1.</_>
+        <_>
+          2 9 2 9 2.</_>
+        <_>
+          4 18 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 6 -1.</_>
+        <_>
+          8 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 12 -1.</_>
+        <_>
+          0 16 2 6 2.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 12 4 -1.</_>
+        <_>
+          6 22 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 9 4 -1.</_>
+        <_>
+          3 24 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 12 -1.</_>
+        <_>
+          9 17 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 6 -1.</_>
+        <_>
+          4 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 6 -1.</_>
+        <_>
+          4 10 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 12 4 -1.</_>
+        <_>
+          4 22 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 9 7 -1.</_>
+        <_>
+          7 21 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 22 4 6 -1.</_>
+        <_>
+          7 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 12 -1.</_>
+        <_>
+          10 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 3 12 -1.</_>
+        <_>
+          3 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 6 -1.</_>
+        <_>
+          8 4 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 4 -1.</_>
+        <_>
+          6 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 16 -1.</_>
+        <_>
+          8 6 4 8 2.</_>
+        <_>
+          4 14 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 8 16 -1.</_>
+        <_>
+          2 6 4 8 2.</_>
+        <_>
+          6 14 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 8 -1.</_>
+        <_>
+          6 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 10 -1.</_>
+        <_>
+          4 6 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 7 -1.</_>
+        <_>
+          10 12 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 6 -1.</_>
+        <_>
+          4 12 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 7 -1.</_>
+        <_>
+          5 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 16 -1.</_>
+        <_>
+          1 11 6 8 2.</_>
+        <_>
+          7 19 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 13 -1.</_>
+        <_>
+          7 9 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 4 -1.</_>
+        <_>
+          3 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 22 4 6 -1.</_>
+        <_>
+          9 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 4 -1.</_>
+        <_>
+          2 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 12 -1.</_>
+        <_>
+          8 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 8 3 -1.</_>
+        <_>
+          6 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 19 -1.</_>
+        <_>
+          4 7 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 12 -1.</_>
+        <_>
+          8 9 2 6 2.</_>
+        <_>
+          6 15 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 6 -1.</_>
+        <_>
+          1 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 22 8 6 -1.</_>
+        <_>
+          8 22 4 3 2.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 8 6 -1.</_>
+        <_>
+          2 22 4 3 2.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 4 6 -1.</_>
+        <_>
+          9 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 6 -1.</_>
+        <_>
+          3 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 4 -1.</_>
+        <_>
+          4 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 6 -1.</_>
+        <_>
+          7 3 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 24 6 4 -1.</_>
+        <_>
+          6 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 12 3 -1.</_>
+        <_>
+          5 21 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 2 7 -1.</_>
+        <_>
+          7 17 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 7 2 -1.</_>
+        <_>
+          7 17 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 16 -1.</_>
+        <_>
+          6 20 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 9 4 -1.</_>
+        <_>
+          5 24 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 2 -1.</_>
+        <_>
+          2 25 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 2 -1.</_>
+        <_>
+          6 25 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 8 -1.</_>
+        <_>
+          4 15 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 6 -1.</_>
+        <_>
+          7 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 10 7 -1.</_>
+        <_>
+          2 2 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 25 -1.</_>
+        <_>
+          3 1 6 25 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 6 -1.</_>
+        <_>
+          4 14 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 12 -1.</_>
+        <_>
+          7 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 12 -1.</_>
+        <_>
+          7 7 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 6 6 -1.</_>
+        <_>
+          6 20 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 4 -1.</_>
+        <_>
+          3 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 9 18 -1.</_>
+        <_>
+          3 11 3 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 6 -1.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 12 -1.</_>
+        <_>
+          10 8 2 6 2.</_>
+        <_>
+          8 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 8 -1.</_>
+        <_>
+          4 10 3 4 2.</_>
+        <_>
+          7 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 6 -1.</_>
+        <_>
+          7 15 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 4 -1.</_>
+        <_>
+          7 15 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 13 15 -1.</_>
+        <_>
+          1 14 13 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 25 -1.</_>
+        <_>
+          6 1 1 25 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 12 -1.</_>
+        <_>
+          7 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 16 -1.</_>
+        <_>
+          0 7 2 8 2.</_>
+        <_>
+          2 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 4 -1.</_>
+        <_>
+          4 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 8 -1.</_>
+        <_>
+          11 5 3 4 2.</_>
+        <_>
+          8 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 14 -1.</_>
+        <_>
+          1 14 6 7 2.</_>
+        <_>
+          7 21 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 18 -1.</_>
+        <_>
+          9 7 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 8 -1.</_>
+        <_>
+          0 18 7 4 2.</_>
+        <_>
+          7 22 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 23 -1.</_>
+        <_>
+          6 3 4 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 9 -1.</_>
+        <_>
+          10 18 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 8 3 -1.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 4 6 -1.</_>
+        <_>
+          3 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 2 12 -1.</_>
+        <_>
+          6 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 6 14 -1.</_>
+        <_>
+          2 14 3 7 2.</_>
+        <_>
+          5 21 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 6 -1.</_>
+        <_>
+          6 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 8 6 -1.</_>
+        <_>
+          0 18 4 3 2.</_>
+        <_>
+          4 21 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 11 -1.</_>
+        <_>
+          9 13 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 12 7 -1.</_>
+        <_>
+          4 16 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 9 -1.</_>
+        <_>
+          7 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 9 -1.</_>
+        <_>
+          5 15 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 8 -1.</_>
+        <_>
+          10 18 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 9 6 -1.</_>
+        <_>
+          2 9 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 12 6 -1.</_>
+        <_>
+          1 12 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 12 -1.</_>
+        <_>
+          3 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 4 -1.</_>
+        <_>
+          3 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 6 -1.</_>
+        <_>
+          4 8 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 26 12 2 -1.</_>
+        <_>
+          1 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          7 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 5 -1.</_>
+        <_>
+          7 5 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 13 -1.</_>
+        <_>
+          6 9 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 6 10 -1.</_>
+        <_>
+          8 18 3 5 2.</_>
+        <_>
+          5 23 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 6 10 -1.</_>
+        <_>
+          3 18 3 5 2.</_>
+        <_>
+          6 23 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 6 -1.</_>
+        <_>
+          7 15 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 23 9 5 -1.</_>
+        <_>
+          3 23 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 7 6 -1.</_>
+        <_>
+          7 15 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 7 -1.</_>
+        <_>
+          7 15 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 12 -1.</_>
+        <_>
+          10 2 3 6 2.</_>
+        <_>
+          7 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          7 5 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 10 -1.</_>
+        <_>
+          10 3 3 5 2.</_>
+        <_>
+          7 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 10 -1.</_>
+        <_>
+          1 3 3 5 2.</_>
+        <_>
+          4 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 4 -1.</_>
+        <_>
+          1 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 4 -1.</_>
+        <_>
+          5 1 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 10 -1.</_>
+        <_>
+          0 5 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 10 18 -1.</_>
+        <_>
+          0 8 5 9 2.</_>
+        <_>
+          5 17 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 21 8 7 -1.</_>
+        <_>
+          4 21 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 8 6 -1.</_>
+        <_>
+          5 21 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 8 -1.</_>
+        <_>
+          6 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 12 -1.</_>
+        <_>
+          9 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 12 -1.</_>
+        <_>
+          4 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 25 12 3 -1.</_>
+        <_>
+          7 25 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 3 5 -1.</_>
+        <_>
+          8 21 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 11 -1.</_>
+        <_>
+          5 15 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 21 -1.</_>
+        <_>
+          5 8 4 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 4 6 -1.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 23 9 4 -1.</_>
+        <_>
+          8 23 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 23 9 4 -1.</_>
+        <_>
+          3 23 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 12 -1.</_>
+        <_>
+          8 3 2 6 2.</_>
+        <_>
+          6 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 24 -1.</_>
+        <_>
+          6 4 1 12 2.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 6 -1.</_>
+        <_>
+          4 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 20 -1.</_>
+        <_>
+          4 18 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 3 12 -1.</_>
+        <_>
+          2 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 16 -1.</_>
+        <_>
+          8 16 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 6 -1.</_>
+        <_>
+          3 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 9 -1.</_>
+        <_>
+          9 14 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 9 -1.</_>
+        <_>
+          3 14 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 18 -1.</_>
+        <_>
+          10 0 2 9 2.</_>
+        <_>
+          8 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 18 -1.</_>
+        <_>
+          2 0 2 9 2.</_>
+        <_>
+          4 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 12 -1.</_>
+        <_>
+          11 14 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 2 12 -1.</_>
+        <_>
+          2 14 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 12 -1.</_>
+        <_>
+          9 11 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 6 -1.</_>
+        <_>
+          4 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 9 -1.</_>
+        <_>
+          4 1 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 20 -1.</_>
+        <_>
+          1 3 6 10 2.</_>
+        <_>
+          7 13 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 10 -1.</_>
+        <_>
+          7 8 3 5 2.</_>
+        <_>
+          4 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 3 -1.</_>
+        <_>
+          6 5 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 7 -1.</_>
+        <_>
+          5 15 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 12 -1.</_>
+        <_>
+          4 18 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 16 -1.</_>
+        <_>
+          5 16 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 12 6 -1.</_>
+        <_>
+          4 21 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 8 7 -1.</_>
+        <_>
+          4 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 8 7 -1.</_>
+        <_>
+          6 17 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 5 -1.</_>
+        <_>
+          7 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 6 -1.</_>
+        <_>
+          7 4 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 7 -1.</_>
+        <_>
+          8 3 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 7 6 -1.</_>
+        <_>
+          6 3 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 22 -1.</_>
+        <_>
+          7 4 1 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 22 -1.</_>
+        <_>
+          6 4 1 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 12 -1.</_>
+        <_>
+          7 8 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 12 -1.</_>
+        <_>
+          6 8 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 10 5 -1.</_>
+        <_>
+          3 8 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 16 -1.</_>
+        <_>
+          10 8 2 8 2.</_>
+        <_>
+          8 16 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 16 -1.</_>
+        <_>
+          2 8 2 8 2.</_>
+        <_>
+          4 16 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 12 4 -1.</_>
+        <_>
+          7 21 6 2 2.</_>
+        <_>
+          1 23 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 12 -1.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 4 -1.</_>
+        <_>
+          4 12 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 12 -1.</_>
+        <_>
+          2 12 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 6 8 -1.</_>
+        <_>
+          7 17 3 4 2.</_>
+        <_>
+          4 21 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 3 -1.</_>
+        <_>
+          6 16 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 5 -1.</_>
+        <_>
+          10 21 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 6 -1.</_>
+        <_>
+          7 18 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 24 -1.</_>
+        <_>
+          9 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 24 -1.</_>
+        <_>
+          2 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 25 12 3 -1.</_>
+        <_>
+          5 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 14 -1.</_>
+        <_>
+          4 4 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 4 6 -1.</_>
+        <_>
+          7 18 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 4 -1.</_>
+        <_>
+          7 4 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 7 4 -1.</_>
+        <_>
+          7 1 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 4 -1.</_>
+        <_>
+          7 2 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 6 -1.</_>
+        <_>
+          5 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 8 8 -1.</_>
+        <_>
+          7 20 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 5 -1.</_>
+        <_>
+          6 15 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 10 6 -1.</_>
+        <_>
+          7 7 5 3 2.</_>
+        <_>
+          2 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 4 4 -1.</_>
+        <_>
+          6 21 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 24 12 4 -1.</_>
+        <_>
+          4 24 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 6 -1.</_>
+        <_>
+          6 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 24 -1.</_>
+        <_>
+          7 4 6 12 2.</_>
+        <_>
+          1 16 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 15 -1.</_>
+        <_>
+          4 9 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 8 -1.</_>
+        <_>
+          11 3 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 13 -1.</_>
+        <_>
+          5 9 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 6 -1.</_>
+        <_>
+          6 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 8 3 -1.</_>
+        <_>
+          6 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 8 -1.</_>
+        <_>
+          7 11 3 4 2.</_>
+        <_>
+          4 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 27 -1.</_>
+        <_>
+          0 9 14 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          5 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 12 -1.</_>
+        <_>
+          5 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 9 -1.</_>
+        <_>
+          6 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 9 -1.</_>
+        <_>
+          4 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 6 -1.</_>
+        <_>
+          9 5 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 4 -1.</_>
+        <_>
+          5 5 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 21 -1.</_>
+        <_>
+          4 1 6 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 25 12 3 -1.</_>
+        <_>
+          5 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 10 -1.</_>
+        <_>
+          9 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 9 3 -1.</_>
+        <_>
+          3 17 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 10 -1.</_>
+        <_>
+          9 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 10 -1.</_>
+        <_>
+          3 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 9 4 -1.</_>
+        <_>
+          4 12 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 5 -1.</_>
+        <_>
+          5 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 18 -1.</_>
+        <_>
+          7 15 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 6 6 -1.</_>
+        <_>
+          2 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 6 5 -1.</_>
+        <_>
+          5 21 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 6 5 -1.</_>
+        <_>
+          6 21 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 21 2 5 -1.</_>
+        <_>
+          9 21 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 8 -1.</_>
+        <_>
+          0 17 3 4 2.</_>
+        <_>
+          3 21 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 6 -1.</_>
+        <_>
+          6 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 14 -1.</_>
+        <_>
+          2 1 3 7 2.</_>
+        <_>
+          5 8 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 5 6 -1.</_>
+        <_>
+          6 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 6 -1.</_>
+        <_>
+          6 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 6 -1.</_>
+        <_>
+          4 8 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 4 -1.</_>
+        <_>
+          3 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 6 -1.</_>
+        <_>
+          7 6 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 4 -1.</_>
+        <_>
+          4 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 21 -1.</_>
+        <_>
+          8 1 2 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 20 -1.</_>
+        <_>
+          4 2 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 5 -1.</_>
+        <_>
+          10 21 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 24 6 4 -1.</_>
+        <_>
+          3 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 6 -1.</_>
+        <_>
+          6 2 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 2 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 4 13 2 -1.</_>
+        <_>
+          1 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 7 -1.</_>
+        <_>
+          7 11 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 16 6 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 24 -1.</_>
+        <_>
+          5 11 4 8 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 12 4 -1.</_>
+        <_>
+          8 24 6 2 2.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 12 4 -1.</_>
+        <_>
+          0 24 6 2 2.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 24 -1.</_>
+        <_>
+          7 4 1 12 2.</_>
+        <_>
+          6 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 6 -1.</_>
+        <_>
+          6 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 9 -1.</_>
+        <_>
+          6 6 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 7 -1.</_>
+        <_>
+          6 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 10 7 -1.</_>
+        <_>
+          3 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 10 7 -1.</_>
+        <_>
+          6 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 12 -1.</_>
+        <_>
+          7 5 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 9 12 -1.</_>
+        <_>
+          4 5 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 25 8 3 -1.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 7 -1.</_>
+        <_>
+          3 16 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 4 7 -1.</_>
+        <_>
+          9 17 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 7 -1.</_>
+        <_>
+          3 17 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 7 -1.</_>
+        <_>
+          7 0 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 7 4 -1.</_>
+        <_>
+          7 0 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 5 6 -1.</_>
+        <_>
+          9 3 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 12 -1.</_>
+        <_>
+          0 10 3 6 2.</_>
+        <_>
+          3 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 12 -1.</_>
+        <_>
+          10 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 12 -1.</_>
+        <_>
+          2 3 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 10 10 -1.</_>
+        <_>
+          7 7 5 5 2.</_>
+        <_>
+          2 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 9 -1.</_>
+        <_>
+          5 16 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 14 11 -1.</_>
+        <_>
+          0 11 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 5 6 -1.</_>
+        <_>
+          4 18 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 20 2 6 -1.</_>
+        <_>
+          11 20 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 6 -1.</_>
+        <_>
+          3 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 3 6 -1.</_>
+        <_>
+          11 15 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 3 -1.</_>
+        <_>
+          3 15 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 3 5 -1.</_>
+        <_>
+          8 21 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 12 -1.</_>
+        <_>
+          10 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 2 -1.</_>
+        <_>
+          5 15 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 2 7 -1.</_>
+        <_>
+          7 18 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 5 3 -1.</_>
+        <_>
+          6 21 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 16 2 10 -1.</_>
+        <_>
+          10 16 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 16 10 2 -1.</_>
+        <_>
+          4 16 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 12 6 -1.</_>
+        <_>
+          4 17 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 8 -1.</_>
+        <_>
+          4 15 3 4 2.</_>
+        <_>
+          7 19 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 4 -1.</_>
+        <_>
+          9 19 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 6 -1.</_>
+        <_>
+          5 19 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 12 4 -1.</_>
+        <_>
+          1 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 12 -1.</_>
+        <_>
+          0 2 4 6 2.</_>
+        <_>
+          4 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 16 -1.</_>
+        <_>
+          6 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 4 -1.</_>
+        <_>
+          2 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 18 -1.</_>
+        <_>
+          5 19 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 12 -1.</_>
+        <_>
+          0 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 12 4 -1.</_>
+        <_>
+          7 22 6 2 2.</_>
+        <_>
+          1 24 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 7 2 -1.</_>
+        <_>
+          2 19 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 14 -1.</_>
+        <_>
+          0 11 3 7 2.</_>
+        <_>
+          3 18 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 10 -1.</_>
+        <_>
+          7 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 6 -1.</_>
+        <_>
+          2 17 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 12 -1.</_>
+        <_>
+          9 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 6 3 -1.</_>
+        <_>
+          5 17 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 8 -1.</_>
+        <_>
+          10 2 2 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 6 -1.</_>
+        <_>
+          8 6 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 21 -1.</_>
+        <_>
+          4 14 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 18 -1.</_>
+        <_>
+          3 0 4 9 2.</_>
+        <_>
+          7 9 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 9 10 -1.</_>
+        <_>
+          6 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 21 4 3 -1.</_>
+        <_>
+          6 22 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 23 12 5 -1.</_>
+        <_>
+          6 23 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 3 12 -1.</_>
+        <_>
+          5 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 2 7 -1.</_>
+        <_>
+          7 17 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 10 -1.</_>
+        <_>
+          0 5 7 5 2.</_>
+        <_>
+          7 10 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 4 -1.</_>
+        <_>
+          3 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 4 -1.</_>
+        <_>
+          5 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          7 0 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 10 7 -1.</_>
+        <_>
+          7 3 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 4 21 -1.</_>
+        <_>
+          5 7 2 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 24 -1.</_>
+        <_>
+          7 2 1 12 2.</_>
+        <_>
+          6 14 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 16 -1.</_>
+        <_>
+          3 8 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 12 -1.</_>
+        <_>
+          9 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 6 -1.</_>
+        <_>
+          5 4 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 4 9 -1.</_>
+        <_>
+          3 19 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 16 -1.</_>
+        <_>
+          10 10 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 5 2 -1.</_>
+        <_>
+          5 18 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 4 -1.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 8 -1.</_>
+        <_>
+          8 5 3 4 2.</_>
+        <_>
+          5 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 8 -1.</_>
+        <_>
+          3 5 3 4 2.</_>
+        <_>
+          6 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 12 -1.</_>
+        <_>
+          10 3 4 6 2.</_>
+        <_>
+          6 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 2 12 -1.</_>
+        <_>
+          2 10 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 7 -1.</_>
+        <_>
+          4 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 21 2 5 -1.</_>
+        <_>
+          9 21 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 8 6 -1.</_>
+        <_>
+          0 15 4 3 2.</_>
+        <_>
+          4 18 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 13 3 -1.</_>
+        <_>
+          1 2 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 2 -1.</_>
+        <_>
+          7 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_>
+        <_>
+          2 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 12 6 -1.</_>
+        <_>
+          3 20 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 8 7 -1.</_>
+        <_>
+          6 15 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 12 -1.</_>
+        <_>
+          4 10 3 6 2.</_>
+        <_>
+          7 16 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 6 -1.</_>
+        <_>
+          7 0 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 4 -1.</_>
+        <_>
+          7 0 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 18 8 6 -1.</_>
+        <_>
+          10 18 4 3 2.</_>
+        <_>
+          6 21 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 4 -1.</_>
+        <_>
+          6 0 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 10 6 -1.</_>
+        <_>
+          7 15 5 3 2.</_>
+        <_>
+          2 18 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 4 8 -1.</_>
+        <_>
+          0 17 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 14 9 -1.</_>
+        <_>
+          0 12 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 24 9 4 -1.</_>
+        <_>
+          5 24 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 24 12 4 -1.</_>
+        <_>
+          4 24 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 10 8 -1.</_>
+        <_>
+          0 11 5 4 2.</_>
+        <_>
+          5 15 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 4 -1.</_>
+        <_>
+          5 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 17 -1.</_>
+        <_>
+          2 8 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 12 -1.</_>
+        <_>
+          10 2 2 6 2.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 12 -1.</_>
+        <_>
+          2 2 2 6 2.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 14 -1.</_>
+        <_>
+          12 7 2 7 2.</_>
+        <_>
+          10 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 14 -1.</_>
+        <_>
+          0 7 2 7 2.</_>
+        <_>
+          2 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 6 -1.</_>
+        <_>
+          4 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 3 -1.</_>
+        <_>
+          6 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 12 3 -1.</_>
+        <_>
+          2 6 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 9 5 -1.</_>
+        <_>
+          5 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 15 -1.</_>
+        <_>
+          0 6 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 18 -1.</_>
+        <_>
+          3 7 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 9 10 -1.</_>
+        <_>
+          4 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 6 -1.</_>
+        <_>
+          7 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 21 -1.</_>
+        <_>
+          7 4 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 3 -1.</_>
+        <_>
+          5 18 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 4 -1.</_>
+        <_>
+          7 16 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 2 -1.</_>
+        <_>
+          7 16 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 20 2 6 -1.</_>
+        <_>
+          8 20 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 20 6 2 -1.</_>
+        <_>
+          6 20 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 6 -1.</_>
+        <_>
+          8 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 16 -1.</_>
+        <_>
+          2 1 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 10 -1.</_>
+        <_>
+          12 14 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 2 -1.</_>
+        <_>
+          2 14 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 27 -1.</_>
+        <_>
+          5 10 2 9 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 8 22 -1.</_>
+        <_>
+          4 6 4 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 13 -1.</_>
+        <_>
+          6 6 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 6 6 -1.</_>
+        <_>
+          5 13 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 26 12 2 -1.</_>
+        <_>
+          2 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 9 -1.</_>
+        <_>
+          6 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 24 6 4 -1.</_>
+        <_>
+          6 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 9 -1.</_>
+        <_>
+          4 16 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 8 9 -1.</_>
+        <_>
+          6 16 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          7 5 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 6 -1.</_>
+        <_>
+          7 15 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 10 12 -1.</_>
+        <_>
+          3 19 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 10 3 -1.</_>
+        <_>
+          7 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 8 21 -1.</_>
+        <_>
+          3 8 8 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 6 -1.</_>
+        <_>
+          4 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 8 4 -1.</_>
+        <_>
+          4 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          7 5 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 10 -1.</_>
+        <_>
+          2 8 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 8 10 -1.</_>
+        <_>
+          5 4 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 8 6 -1.</_>
+        <_>
+          7 16 4 3 2.</_>
+        <_>
+          3 19 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 24 -1.</_>
+        <_>
+          3 3 1 12 2.</_>
+        <_>
+          4 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 4 12 -1.</_>
+        <_>
+          10 16 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 4 12 -1.</_>
+        <_>
+          2 16 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 12 -1.</_>
+        <_>
+          9 12 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 5 6 -1.</_>
+        <_>
+          3 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 10 8 -1.</_>
+        <_>
+          2 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 12 -1.</_>
+        <_>
+          4 12 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 4 12 -1.</_>
+        <_>
+          5 16 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 22 4 2 -1.</_>
+        <_>
+          7 22 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 22 8 6 -1.</_>
+        <_>
+          10 22 4 3 2.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 2 14 -1.</_>
+        <_>
+          2 14 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 3 5 -1.</_>
+        <_>
+          10 21 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 20 5 3 -1.</_>
+        <_>
+          4 21 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 5 -1.</_>
+        <_>
+          7 15 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 10 6 -1.</_>
+        <_>
+          1 17 5 3 2.</_>
+        <_>
+          6 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 3 -1.</_>
+        <_>
+          5 3 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 5 6 -1.</_>
+        <_>
+          7 3 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 12 -1.</_>
+        <_>
+          8 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 12 -1.</_>
+        <_>
+          5 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 13 -1.</_>
+        <_>
+          8 11 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 21 -1.</_>
+        <_>
+          6 5 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 9 11 -1.</_>
+        <_>
+          7 13 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 9 11 -1.</_>
+        <_>
+          4 13 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 8 10 -1.</_>
+        <_>
+          9 18 4 5 2.</_>
+        <_>
+          5 23 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 14 -1.</_>
+        <_>
+          0 5 7 7 2.</_>
+        <_>
+          7 12 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 15 -1.</_>
+        <_>
+          10 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 20 -1.</_>
+        <_>
+          5 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 2 -1.</_>
+        <_>
+          2 5 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 3 -1.</_>
+        <_>
+          0 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 6 -1.</_>
+        <_>
+          7 18 7 3 2.</_>
+        <_>
+          0 21 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 15 -1.</_>
+        <_>
+          3 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 4 -1.</_>
+        <_>
+          8 1 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 6 -1.</_>
+        <_>
+          2 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 12 -1.</_>
+        <_>
+          3 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 4 6 -1.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 24 6 4 -1.</_>
+        <_>
+          8 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 9 -1.</_>
+        <_>
+          4 3 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 4 -1.</_>
+        <_>
+          8 3 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 22 -1.</_>
+        <_>
+          2 0 3 11 2.</_>
+        <_>
+          5 11 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 8 10 -1.</_>
+        <_>
+          10 18 4 5 2.</_>
+        <_>
+          6 23 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 6 6 -1.</_>
+        <_>
+          2 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 6 -1.</_>
+        <_>
+          8 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 6 -1.</_>
+        <_>
+          0 15 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 6 6 -1.</_>
+        <_>
+          3 16 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 21 -1.</_>
+        <_>
+          7 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 3 -1.</_>
+        <_>
+          3 15 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 6 -1.</_>
+        <_>
+          7 3 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 16 -1.</_>
+        <_>
+          4 9 4 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 8 16 -1.</_>
+        <_>
+          6 9 4 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 7 24 -1.</_>
+        <_>
+          4 9 7 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 6 -1.</_>
+        <_>
+          3 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 4 -1.</_>
+        <_>
+          5 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 6 -1.</_>
+        <_>
+          7 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 4 -1.</_>
+        <_>
+          4 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 24 6 4 -1.</_>
+        <_>
+          4 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          8 0 3 4 2.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          8 0 3 4 2.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 6 -1.</_>
+        <_>
+          7 4 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 8 -1.</_>
+        <_>
+          6 2 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          8 2 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 4 -1.</_>
+        <_>
+          8 18 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 20 6 8 -1.</_>
+        <_>
+          1 20 3 4 2.</_>
+        <_>
+          4 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 2 12 -1.</_>
+        <_>
+          9 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 2 12 -1.</_>
+        <_>
+          4 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 4 -1.</_>
+        <_>
+          5 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 4 -1.</_>
+        <_>
+          6 3 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 24 -1.</_>
+        <_>
+          7 4 3 12 2.</_>
+        <_>
+          4 16 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 12 -1.</_>
+        <_>
+          7 13 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 12 -1.</_>
+        <_>
+          7 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 14 -1.</_>
+        <_>
+          7 4 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 25 -1.</_>
+        <_>
+          6 3 2 25 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 21 -1.</_>
+        <_>
+          6 4 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 12 -1.</_>
+        <_>
+          7 6 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 20 -1.</_>
+        <_>
+          5 4 2 10 2.</_>
+        <_>
+          7 14 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 24 -1.</_>
+        <_>
+          8 12 2 8 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 24 -1.</_>
+        <_>
+          6 1 6 24 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 22 -1.</_>
+        <_>
+          7 17 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 4 9 -1.</_>
+        <_>
+          4 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 8 -1.</_>
+        <_>
+          6 6 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          7 5 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 6 -1.</_>
+        <_>
+          5 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 10 -1.</_>
+        <_>
+          0 5 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 24 -1.</_>
+        <_>
+          7 8 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 15 -1.</_>
+        <_>
+          2 8 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 23 12 3 -1.</_>
+        <_>
+          5 23 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 22 8 6 -1.</_>
+        <_>
+          10 22 4 3 2.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 14 6 -1.</_>
+        <_>
+          0 22 7 3 2.</_>
+        <_>
+          7 25 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 3 -1.</_>
+        <_>
+          2 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 9 -1.</_>
+        <_>
+          4 5 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 12 -1.</_>
+        <_>
+          5 4 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 3 -1.</_>
+        <_>
+          1 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 3 -1.</_>
+        <_>
+          5 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 2 12 -1.</_>
+        <_>
+          2 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 12 5 -1.</_>
+        <_>
+          5 20 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 4 -1.</_>
+        <_>
+          6 16 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 21 -1.</_>
+        <_>
+          7 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 12 -1.</_>
+        <_>
+          2 2 2 6 2.</_>
+        <_>
+          4 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 22 8 6 -1.</_>
+        <_>
+          7 22 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 6 -1.</_>
+        <_>
+          0 1 5 3 2.</_>
+        <_>
+          5 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 9 6 -1.</_>
+        <_>
+          3 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 19 -1.</_>
+        <_>
+          7 7 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 16 -1.</_>
+        <_>
+          7 10 4 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 4 15 -1.</_>
+        <_>
+          10 18 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 10 10 -1.</_>
+        <_>
+          2 1 5 5 2.</_>
+        <_>
+          7 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 2 7 -1.</_>
+        <_>
+          7 19 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 9 6 -1.</_>
+        <_>
+          5 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 10 14 -1.</_>
+        <_>
+          9 13 5 7 2.</_>
+        <_>
+          4 20 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 15 -1.</_>
+        <_>
+          5 12 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 24 -1.</_>
+        <_>
+          7 2 1 12 2.</_>
+        <_>
+          6 14 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 12 -1.</_>
+        <_>
+          5 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 24 6 4 -1.</_>
+        <_>
+          8 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 6 4 -1.</_>
+        <_>
+          3 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 4 -1.</_>
+        <_>
+          4 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 9 -1.</_>
+        <_>
+          5 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 6 -1.</_>
+        <_>
+          9 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 8 8 -1.</_>
+        <_>
+          2 20 4 4 2.</_>
+        <_>
+          6 24 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 8 -1.</_>
+        <_>
+          11 15 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 2 -1.</_>
+        <_>
+          3 15 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 4 6 -1.</_>
+        <_>
+          2 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 14 2 -1.</_>
+        <_>
+          0 26 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 6 8 -1.</_>
+        <_>
+          3 20 3 4 2.</_>
+        <_>
+          6 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 12 -1.</_>
+        <_>
+          5 13 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 12 2 -1.</_>
+        <_>
+          1 22 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 12 4 -1.</_>
+        <_>
+          0 24 6 2 2.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 4 -1.</_>
+        <_>
+          5 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 3 -1.</_>
+        <_>
+          0 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 6 -1.</_>
+        <_>
+          7 4 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 6 -1.</_>
+        <_>
+          7 4 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 8 -1.</_>
+        <_>
+          8 3 3 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 5 -1.</_>
+        <_>
+          3 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 12 -1.</_>
+        <_>
+          9 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 22 -1.</_>
+        <_>
+          7 0 1 22 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 12 -1.</_>
+        <_>
+          9 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 12 -1.</_>
+        <_>
+          4 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 12 -1.</_>
+        <_>
+          7 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 12 -1.</_>
+        <_>
+          6 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 10 -1.</_>
+        <_>
+          8 8 3 5 2.</_>
+        <_>
+          5 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 10 -1.</_>
+        <_>
+          2 8 5 5 2.</_>
+        <_>
+          7 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          10 9 3 5 2.</_>
+        <_>
+          7 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 3 -1.</_>
+        <_>
+          0 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 12 -1.</_>
+        <_>
+          9 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 12 6 -1.</_>
+        <_>
+          6 20 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 8 -1.</_>
+        <_>
+          2 10 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 6 -1.</_>
+        <_>
+          0 15 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 16 -1.</_>
+        <_>
+          1 14 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 12 -1.</_>
+        <_>
+          8 7 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 3 -1.</_>
+        <_>
+          0 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 7 -1.</_>
+        <_>
+          2 17 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 24 6 4 -1.</_>
+        <_>
+          6 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 7 -1.</_>
+        <_>
+          3 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 18 -1.</_>
+        <_>
+          10 9 3 9 2.</_>
+        <_>
+          7 18 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 12 5 -1.</_>
+        <_>
+          4 22 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 10 -1.</_>
+        <_>
+          10 9 3 5 2.</_>
+        <_>
+          7 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 10 -1.</_>
+        <_>
+          1 9 3 5 2.</_>
+        <_>
+          4 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 22 4 6 -1.</_>
+        <_>
+          8 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 8 -1.</_>
+        <_>
+          0 16 3 4 2.</_>
+        <_>
+          3 20 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 8 -1.</_>
+        <_>
+          4 2 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 9 -1.</_>
+        <_>
+          5 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 19 -1.</_>
+        <_>
+          10 8 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          5 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 7 6 -1.</_>
+        <_>
+          7 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 12 -1.</_>
+        <_>
+          1 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 17 -1.</_>
+        <_>
+          12 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 17 -1.</_>
+        <_>
+          1 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 14 -1.</_>
+        <_>
+          5 20 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 4 -1.</_>
+        <_>
+          6 15 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 17 8 6 -1.</_>
+        <_>
+          7 17 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 8 6 -1.</_>
+        <_>
+          3 17 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 6 -1.</_>
+        <_>
+          5 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 8 13 -1.</_>
+        <_>
+          5 13 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 4 -1.</_>
+        <_>
+          3 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          7 5 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 8 -1.</_>
+        <_>
+          7 9 3 4 2.</_>
+        <_>
+          4 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 24 -1.</_>
+        <_>
+          6 4 1 12 2.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 24 6 4 -1.</_>
+        <_>
+          7 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 5 3 -1.</_>
+        <_>
+          6 21 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 15 9 12 -1.</_>
+        <_>
+          6 19 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 8 7 -1.</_>
+        <_>
+          3 20 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 14 -1.</_>
+        <_>
+          10 12 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 14 -1.</_>
+        <_>
+          3 12 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 4 -1.</_>
+        <_>
+          3 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_>
+        <_>
+          7 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 24 -1.</_>
+        <_>
+          5 10 4 8 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 3 -1.</_>
+        <_>
+          7 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 8 8 -1.</_>
+        <_>
+          6 15 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 4 -1.</_>
+        <_>
+          6 16 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 3 12 -1.</_>
+        <_>
+          5 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 12 -1.</_>
+        <_>
+          8 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 12 -1.</_>
+        <_>
+          5 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 6 -1.</_>
+        <_>
+          10 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 24 -1.</_>
+        <_>
+          5 4 1 12 2.</_>
+        <_>
+          6 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 4 6 -1.</_>
+        <_>
+          2 17 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 12 -1.</_>
+        <_>
+          11 11 3 6 2.</_>
+        <_>
+          8 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 10 -1.</_>
+        <_>
+          3 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 6 -1.</_>
+        <_>
+          7 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 10 3 -1.</_>
+        <_>
+          6 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 6 -1.</_>
+        <_>
+          7 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 4 -1.</_>
+        <_>
+          7 6 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 6 -1.</_>
+        <_>
+          7 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 8 -1.</_>
+        <_>
+          4 6 3 4 2.</_>
+        <_>
+          7 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 16 -1.</_>
+        <_>
+          8 20 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 3 -1.</_>
+        <_>
+          5 4 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 13 -1.</_>
+        <_>
+          8 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 10 14 -1.</_>
+        <_>
+          1 1 5 7 2.</_>
+        <_>
+          6 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 8 3 -1.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 13 -1.</_>
+        <_>
+          7 13 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 24 6 4 -1.</_>
+        <_>
+          4 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 7 -1.</_>
+        <_>
+          8 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 3 -1.</_>
+        <_>
+          0 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 6 -1.</_>
+        <_>
+          4 8 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 7 4 -1.</_>
+        <_>
+          3 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 18 -1.</_>
+        <_>
+          5 16 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 5 26 -1.</_>
+        <_>
+          4 14 5 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 22 8 6 -1.</_>
+        <_>
+          10 22 4 3 2.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 8 6 -1.</_>
+        <_>
+          0 22 4 3 2.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 8 6 -1.</_>
+        <_>
+          9 21 4 3 2.</_>
+        <_>
+          5 24 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 4 -1.</_>
+        <_>
+          6 0 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 5 -1.</_>
+        <_>
+          6 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 12 -1.</_>
+        <_>
+          6 6 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 7 -1.</_>
+        <_>
+          8 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 7 -1.</_>
+        <_>
+          4 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 3 -1.</_>
+        <_>
+          6 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 9 5 -1.</_>
+        <_>
+          4 11 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 4 14 -1.</_>
+        <_>
+          12 3 2 7 2.</_>
+        <_>
+          10 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 14 -1.</_>
+        <_>
+          0 2 2 7 2.</_>
+        <_>
+          2 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 13 6 -1.</_>
+        <_>
+          1 11 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 2 -1.</_>
+        <_>
+          7 17 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 6 -1.</_>
+        <_>
+          11 16 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 3 -1.</_>
+        <_>
+          3 16 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 19 2 7 -1.</_>
+        <_>
+          7 19 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 18 12 9 -1.</_>
+        <_>
+          3 18 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 2 7 -1.</_>
+        <_>
+          7 19 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 19 7 2 -1.</_>
+        <_>
+          7 19 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 13 -1.</_>
+        <_>
+          8 15 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 8 7 -1.</_>
+        <_>
+          4 16 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 10 6 -1.</_>
+        <_>
+          9 21 5 3 2.</_>
+        <_>
+          4 24 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 10 6 -1.</_>
+        <_>
+          0 21 5 3 2.</_>
+        <_>
+          5 24 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 7 -1.</_>
+        <_>
+          10 16 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 20 12 4 -1.</_>
+        <_>
+          0 20 6 2 2.</_>
+        <_>
+          6 22 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 10 -1.</_>
+        <_>
+          4 14 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 6 4 -1.</_>
+        <_>
+          6 18 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 16 -1.</_>
+        <_>
+          11 19 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 14 -1.</_>
+        <_>
+          3 10 3 7 2.</_>
+        <_>
+          6 17 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 6 -1.</_>
+        <_>
+          6 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 12 -1.</_>
+        <_>
+          6 16 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 18 -1.</_>
+        <_>
+          6 9 4 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 10 -1.</_>
+        <_>
+          3 4 3 5 2.</_>
+        <_>
+          6 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 4 -1.</_>
+        <_>
+          7 18 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 4 6 -1.</_>
+        <_>
+          7 18 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 13 -1.</_>
+        <_>
+          6 8 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 12 -1.</_>
+        <_>
+          3 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 12 -1.</_>
+        <_>
+          5 15 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 12 -1.</_>
+        <_>
+          5 15 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 9 9 -1.</_>
+        <_>
+          7 19 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 5 4 -1.</_>
+        <_>
+          6 17 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 8 -1.</_>
+        <_>
+          9 14 3 4 2.</_>
+        <_>
+          6 18 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 6 8 -1.</_>
+        <_>
+          2 14 3 4 2.</_>
+        <_>
+          5 18 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 16 -1.</_>
+        <_>
+          8 2 5 8 2.</_>
+        <_>
+          3 10 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 12 -1.</_>
+        <_>
+          6 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 23 6 4 -1.</_>
+        <_>
+          8 23 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 14 -1.</_>
+        <_>
+          4 2 2 7 2.</_>
+        <_>
+          6 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 6 -1.</_>
+        <_>
+          7 7 4 3 2.</_>
+        <_>
+          3 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 6 -1.</_>
+        <_>
+          2 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 24 -1.</_>
+        <_>
+          7 6 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 14 -1.</_>
+        <_>
+          0 13 3 7 2.</_>
+        <_>
+          3 20 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 10 6 -1.</_>
+        <_>
+          9 19 5 3 2.</_>
+        <_>
+          4 22 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 10 6 -1.</_>
+        <_>
+          0 19 5 3 2.</_>
+        <_>
+          5 22 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 8 10 -1.</_>
+        <_>
+          8 18 4 5 2.</_>
+        <_>
+          4 23 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 8 10 -1.</_>
+        <_>
+          2 18 4 5 2.</_>
+        <_>
+          6 23 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 4 14 -1.</_>
+        <_>
+          5 14 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 10 16 -1.</_>
+        <_>
+          1 2 5 8 2.</_>
+        <_>
+          6 10 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 16 -1.</_>
+        <_>
+          0 20 14 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 10 6 -1.</_>
+        <_>
+          2 3 5 3 2.</_>
+        <_>
+          7 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 26 -1.</_>
+        <_>
+          10 14 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 18 -1.</_>
+        <_>
+          0 18 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 21 4 6 -1.</_>
+        <_>
+          8 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 8 -1.</_>
+        <_>
+          5 6 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 21 4 6 -1.</_>
+        <_>
+          9 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 4 7 -1.</_>
+        <_>
+          9 20 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 10 12 -1.</_>
+        <_>
+          6 4 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 24 -1.</_>
+        <_>
+          6 9 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 21 4 6 -1.</_>
+        <_>
+          4 21 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 26 -1.</_>
+        <_>
+          10 14 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 26 -1.</_>
+        <_>
+          1 14 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 14 -1.</_>
+        <_>
+          8 9 6 7 2.</_>
+        <_>
+          2 16 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 8 -1.</_>
+        <_>
+          4 15 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 18 -1.</_>
+        <_>
+          5 15 9 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 9 4 -1.</_>
+        <_>
+          4 0 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          5 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 4 -1.</_>
+        <_>
+          3 9 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 6 -1.</_>
+        <_>
+          8 16 6 3 2.</_>
+        <_>
+          2 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 22 -1.</_>
+        <_>
+          1 2 4 11 2.</_>
+        <_>
+          5 13 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 6 7 -1.</_>
+        <_>
+          9 19 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 18 -1.</_>
+        <_>
+          6 13 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 16 -1.</_>
+        <_>
+          5 12 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 6 2 -1.</_>
+        <_>
+          5 20 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 19 3 6 -1.</_>
+        <_>
+          11 20 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 22 12 6 -1.</_>
+        <_>
+          4 22 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 3 -1.</_>
+        <_>
+          2 25 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 6 3 -1.</_>
+        <_>
+          3 20 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 20 6 7 -1.</_>
+        <_>
+          9 20 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 12 10 -1.</_>
+        <_>
+          4 17 4 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 12 4 -1.</_>
+        <_>
+          4 18 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 6 7 -1.</_>
+        <_>
+          3 19 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 22 4 6 -1.</_>
+        <_>
+          10 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 2 24 -1.</_>
+        <_>
+          1 4 1 12 2.</_>
+        <_>
+          2 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 10 -1.</_>
+        <_>
+          10 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 10 -1.</_>
+        <_>
+          2 5 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 15 -1.</_>
+        <_>
+          9 10 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 15 -1.</_>
+        <_>
+          4 10 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 17 -1.</_>
+        <_>
+          9 7 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 17 -1.</_>
+        <_>
+          4 7 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 13 -1.</_>
+        <_>
+          10 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 13 -1.</_>
+        <_>
+          3 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 5 -1.</_>
+        <_>
+          4 3 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 6 -1.</_>
+        <_>
+          4 2 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 8 -1.</_>
+        <_>
+          7 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 12 -1.</_>
+        <_>
+          7 4 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 6 -1.</_>
+        <_>
+          10 17 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          7 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 21 -1.</_>
+        <_>
+          4 5 6 21 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 18 -1.</_>
+        <_>
+          2 9 12 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 4 -1.</_>
+        <_>
+          4 1 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 13 -1.</_>
+        <_>
+          7 13 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 12 -1.</_>
+        <_>
+          1 1 3 6 2.</_>
+        <_>
+          4 7 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 6 -1.</_>
+        <_>
+          9 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 6 -1.</_>
+        <_>
+          3 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 13 -1.</_>
+        <_>
+          9 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 13 -1.</_>
+        <_>
+          3 2 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 28 -1.</_>
+        <_>
+          6 0 2 28 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 3 -1.</_>
+        <_>
+          0 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 20 4 7 -1.</_>
+        <_>
+          10 20 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 12 -1.</_>
+        <_>
+          6 8 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 4 8 -1.</_>
+        <_>
+          5 16 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          8 0 3 4 2.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 20 4 7 -1.</_>
+        <_>
+          10 20 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 12 -1.</_>
+        <_>
+          5 15 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 6 -1.</_>
+        <_>
+          7 16 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 9 -1.</_>
+        <_>
+          6 2 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 2 -1.</_>
+        <_>
+          2 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 2 -1.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 4 -1.</_>
+        <_>
+          6 1 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 6 -1.</_>
+        <_>
+          0 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 4 -1.</_>
+        <_>
+          5 6 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 2 -1.</_>
+        <_>
+          1 9 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 8 -1.</_>
+        <_>
+          8 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 8 -1.</_>
+        <_>
+          0 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 12 -1.</_>
+        <_>
+          11 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 12 -1.</_>
+        <_>
+          3 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 12 -1.</_>
+        <_>
+          11 15 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 6 16 -1.</_>
+        <_>
+          1 12 3 8 2.</_>
+        <_>
+          4 20 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 5 -1.</_>
+        <_>
+          4 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 8 3 -1.</_>
+        <_>
+          3 17 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 3 -1.</_>
+        <_>
+          6 25 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 10 8 -1.</_>
+        <_>
+          1 10 5 4 2.</_>
+        <_>
+          6 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 6 -1.</_>
+        <_>
+          7 12 7 3 2.</_>
+        <_>
+          0 15 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 8 8 -1.</_>
+        <_>
+          2 20 4 4 2.</_>
+        <_>
+          6 24 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 2 7 -1.</_>
+        <_>
+          12 16 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 17 12 4 -1.</_>
+        <_>
+          4 17 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 14 -1.</_>
+        <_>
+          7 9 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 14 -1.</_>
+        <_>
+          5 9 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 9 12 -1.</_>
+        <_>
+          6 12 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 19 -1.</_>
+        <_>
+          7 4 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 19 -1.</_>
+        <_>
+          5 5 2 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 10 18 -1.</_>
+        <_>
+          2 10 5 9 2.</_>
+        <_>
+          7 19 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 9 15 -1.</_>
+        <_>
+          3 8 9 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 12 -1.</_>
+        <_>
+          3 11 8 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 8 -1.</_>
+        <_>
+          6 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 12 -1.</_>
+        <_>
+          2 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 18 -1.</_>
+        <_>
+          11 12 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 18 -1.</_>
+        <_>
+          0 12 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 6 -1.</_>
+        <_>
+          7 8 5 3 2.</_>
+        <_>
+          2 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 23 -1.</_>
+        <_>
+          1 3 1 23 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 5 -1.</_>
+        <_>
+          7 3 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 28 -1.</_>
+        <_>
+          2 14 10 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 8 6 -1.</_>
+        <_>
+          10 17 4 3 2.</_>
+        <_>
+          6 20 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 14 -1.</_>
+        <_>
+          4 13 2 7 2.</_>
+        <_>
+          6 20 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 12 -1.</_>
+        <_>
+          12 7 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 5 -1.</_>
+        <_>
+          4 3 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 12 -1.</_>
+        <_>
+          12 7 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 12 -1.</_>
+        <_>
+          1 7 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 5 -1.</_>
+        <_>
+          5 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 8 -1.</_>
+        <_>
+          5 9 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 12 -1.</_>
+        <_>
+          2 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 3 6 -1.</_>
+        <_>
+          12 17 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 12 -1.</_>
+        <_>
+          6 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 3 6 -1.</_>
+        <_>
+          12 17 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 14 -1.</_>
+        <_>
+          7 6 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 8 11 -1.</_>
+        <_>
+          5 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 22 -1.</_>
+        <_>
+          6 3 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          5 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 4 -1.</_>
+        <_>
+          4 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 25 8 3 -1.</_>
+        <_>
+          5 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 4 -1.</_>
+        <_>
+          4 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 10 8 -1.</_>
+        <_>
+          4 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 6 -1.</_>
+        <_>
+          0 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 25 8 3 -1.</_>
+        <_>
+          5 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 6 -1.</_>
+        <_>
+          0 13 5 3 2.</_>
+        <_>
+          5 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 15 -1.</_>
+        <_>
+          7 7 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 15 -1.</_>
+        <_>
+          0 6 14 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 8 8 -1.</_>
+        <_>
+          6 6 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 8 -1.</_>
+        <_>
+          0 12 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 6 -1.</_>
+        <_>
+          8 3 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 6 -1.</_>
+        <_>
+          0 3 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 25 8 3 -1.</_>
+        <_>
+          5 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 6 -1.</_>
+        <_>
+          6 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 12 4 -1.</_>
+        <_>
+          4 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 6 -1.</_>
+        <_>
+          6 4 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 4 -1.</_>
+        <_>
+          4 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 4 -1.</_>
+        <_>
+          6 15 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 4 -1.</_>
+        <_>
+          4 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 4 -1.</_>
+        <_>
+          4 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 12 -1.</_>
+        <_>
+          9 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 12 -1.</_>
+        <_>
+          4 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 28 -1.</_>
+        <_>
+          6 0 4 28 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 28 -1.</_>
+        <_>
+          4 0 4 28 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 8 -1.</_>
+        <_>
+          8 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 22 8 6 -1.</_>
+        <_>
+          0 22 4 3 2.</_>
+        <_>
+          4 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 4 4 -1.</_>
+        <_>
+          8 21 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 6 -1.</_>
+        <_>
+          6 15 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 9 -1.</_>
+        <_>
+          6 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 17 -1.</_>
+        <_>
+          6 8 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 12 -1.</_>
+        <_>
+          7 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 12 -1.</_>
+        <_>
+          7 11 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 12 -1.</_>
+        <_>
+          0 12 7 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 24 -1.</_>
+        <_>
+          0 10 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 8 -1.</_>
+        <_>
+          8 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 24 12 4 -1.</_>
+        <_>
+          4 24 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 18 -1.</_>
+        <_>
+          5 18 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 3 22 -1.</_>
+        <_>
+          2 4 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 2 12 -1.</_>
+        <_>
+          11 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 12 -1.</_>
+        <_>
+          2 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 6 -1.</_>
+        <_>
+          8 1 4 3 2.</_>
+        <_>
+          4 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 8 6 -1.</_>
+        <_>
+          2 1 4 3 2.</_>
+        <_>
+          6 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 20 -1.</_>
+        <_>
+          4 10 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 9 6 -1.</_>
+        <_>
+          0 8 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 16 -1.</_>
+        <_>
+          3 8 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 16 -1.</_>
+        <_>
+          3 19 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 12 -1.</_>
+        <_>
+          7 9 3 6 2.</_>
+        <_>
+          4 15 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 4 3 -1.</_>
+        <_>
+          6 21 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 12 2 -1.</_>
+        <_>
+          2 7 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 4 -1.</_>
+        <_>
+          4 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 5 -1.</_>
+        <_>
+          8 1 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 6 -1.</_>
+        <_>
+          7 4 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 6 20 -1.</_>
+        <_>
+          4 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 13 -1.</_>
+        <_>
+          4 8 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 8 -1.</_>
+        <_>
+          7 0 7 4 2.</_>
+        <_>
+          0 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 6 -1.</_>
+        <_>
+          7 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 12 -1.</_>
+        <_>
+          6 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 4 7 -1.</_>
+        <_>
+          4 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 19 -1.</_>
+        <_>
+          7 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 15 -1.</_>
+        <_>
+          5 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 3 -1.</_>
+        <_>
+          1 12 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 5 6 -1.</_>
+        <_>
+          1 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 13 3 -1.</_>
+        <_>
+          0 14 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 4 -1.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 4 -1.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 22 4 6 -1.</_>
+        <_>
+          8 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 4 6 -1.</_>
+        <_>
+          4 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 22 4 6 -1.</_>
+        <_>
+          8 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 22 4 6 -1.</_>
+        <_>
+          4 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 3 -1.</_>
+        <_>
+          0 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 7 2 -1.</_>
+        <_>
+          7 19 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 12 -1.</_>
+        <_>
+          6 13 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 26 12 2 -1.</_>
+        <_>
+          6 26 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 25 12 3 -1.</_>
+        <_>
+          2 25 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 24 14 4 -1.</_>
+        <_>
+          0 24 7 2 2.</_>
+        <_>
+          7 26 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 12 -1.</_>
+        <_>
+          12 3 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 12 -1.</_>
+        <_>
+          3 2 2 6 2.</_>
+        <_>
+          5 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 17 -1.</_>
+        <_>
+          7 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 7 -1.</_>
+        <_>
+          5 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 12 -1.</_>
+        <_>
+          7 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 12 -1.</_>
+        <_>
+          6 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 17 -1.</_>
+        <_>
+          7 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 8 -1.</_>
+        <_>
+          3 8 4 4 2.</_>
+        <_>
+          7 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 3 12 -1.</_>
+        <_>
+          9 15 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 10 12 -1.</_>
+        <_>
+          0 16 5 6 2.</_>
+        <_>
+          5 22 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 22 -1.</_>
+        <_>
+          10 2 4 11 2.</_>
+        <_>
+          6 13 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 25 12 3 -1.</_>
+        <_>
+          6 25 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 12 14 -1.</_>
+        <_>
+          2 14 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 8 10 -1.</_>
+        <_>
+          4 14 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 14 -1.</_>
+        <_>
+          7 13 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 6 14 -1.</_>
+        <_>
+          5 13 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 13 -1.</_>
+        <_>
+          6 12 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 13 -1.</_>
+        <_>
+          4 12 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 22 10 6 -1.</_>
+        <_>
+          8 22 5 3 2.</_>
+        <_>
+          3 25 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 10 6 -1.</_>
+        <_>
+          1 22 5 3 2.</_>
+        <_>
+          6 25 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 9 -1.</_>
+        <_>
+          8 8 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          0 8 6 3 2.</_>
+        <_>
+          6 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 13 -1.</_>
+        <_>
+          10 6 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 24 -1.</_>
+        <_>
+          0 14 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 8 -1.</_>
+        <_>
+          11 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 17 -1.</_>
+        <_>
+          6 1 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 8 -1.</_>
+        <_>
+          7 5 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 12 -1.</_>
+        <_>
+          4 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 18 -1.</_>
+        <_>
+          8 9 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 12 -1.</_>
+        <_>
+          4 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 12 -1.</_>
+        <_>
+          5 4 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 12 -1.</_>
+        <_>
+          5 4 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 5 -1.</_>
+        <_>
+          5 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 21 -1.</_>
+        <_>
+          7 5 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 24 -1.</_>
+        <_>
+          1 0 3 12 2.</_>
+        <_>
+          4 12 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 6 -1.</_>
+        <_>
+          9 19 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 24 9 4 -1.</_>
+        <_>
+          8 24 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 8 6 -1.</_>
+        <_>
+          2 20 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 22 6 6 -1.</_>
+        <_>
+          9 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 6 6 -1.</_>
+        <_>
+          3 22 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 6 11 -1.</_>
+        <_>
+          3 15 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 4 -1.</_>
+        <_>
+          4 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 11 -1.</_>
+        <_>
+          2 16 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 6 6 -1.</_>
+        <_>
+          10 16 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 12 -1.</_>
+        <_>
+          4 20 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 18 -1.</_>
+        <_>
+          8 16 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 5 16 -1.</_>
+        <_>
+          0 20 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 16 -1.</_>
+        <_>
+          11 16 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 12 -1.</_>
+        <_>
+          0 13 7 6 2.</_>
+        <_>
+          7 19 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 10 16 -1.</_>
+        <_>
+          8 12 5 8 2.</_>
+        <_>
+          3 20 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 5 12 -1.</_>
+        <_>
+          3 17 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 18 -1.</_>
+        <_>
+          8 6 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 14 -1.</_>
+        <_>
+          6 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 11 -1.</_>
+        <_>
+          5 15 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 8 11 -1.</_>
+        <_>
+          5 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 5 -1.</_>
+        <_>
+          5 4 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 25 -1.</_>
+        <_>
+          5 3 4 25 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 6 6 -1.</_>
+        <_>
+          10 16 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 6 -1.</_>
+        <_>
+          2 16 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 14 -1.</_>
+        <_>
+          8 13 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 12 -1.</_>
+        <_>
+          2 8 2 6 2.</_>
+        <_>
+          4 14 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 14 -1.</_>
+        <_>
+          8 13 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 14 -1.</_>
+        <_>
+          5 13 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 6 -1.</_>
+        <_>
+          5 5 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 4 -1.</_>
+        <_>
+          3 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 12 -1.</_>
+        <_>
+          11 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 3 -1.</_>
+        <_>
+          4 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 12 8 -1.</_>
+        <_>
+          7 13 6 4 2.</_>
+        <_>
+          1 17 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 10 10 -1.</_>
+        <_>
+          7 18 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 6 -1.</_>
+        <_>
+          5 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 3 -1.</_>
+        <_>
+          0 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 8 -1.</_>
+        <_>
+          11 1 3 4 2.</_>
+        <_>
+          8 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          0 1 3 4 2.</_>
+        <_>
+          3 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 2 7 -1.</_>
+        <_>
+          7 18 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 7 2 -1.</_>
+        <_>
+          7 18 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 22 9 4 -1.</_>
+        <_>
+          7 22 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 5 6 -1.</_>
+        <_>
+          0 7 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 12 -1.</_>
+        <_>
+          11 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 3 12 -1.</_>
+        <_>
+          0 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 8 -1.</_>
+        <_>
+          8 0 3 4 2.</_>
+        <_>
+          5 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 12 -1.</_>
+        <_>
+          8 3 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 9 8 -1.</_>
+        <_>
+          0 8 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 4 -1.</_>
+        <_>
+          4 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 4 10 -1.</_>
+        <_>
+          3 18 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 6 -1.</_>
+        <_>
+          9 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 3 -1.</_>
+        <_>
+          1 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 6 -1.</_>
+        <_>
+          9 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 3 -1.</_>
+        <_>
+          0 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 4 6 -1.</_>
+        <_>
+          9 19 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 4 6 -1.</_>
+        <_>
+          3 19 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 15 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 4 4 -1.</_>
+        <_>
+          6 21 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          9 3 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 4 6 -1.</_>
+        <_>
+          3 3 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 15 -1.</_>
+        <_>
+          8 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 15 -1.</_>
+        <_>
+          3 12 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 12 -1.</_>
+        <_>
+          9 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 12 -1.</_>
+        <_>
+          3 18 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 5 6 -1.</_>
+        <_>
+          8 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 5 6 -1.</_>
+        <_>
+          1 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 8 -1.</_>
+        <_>
+          3 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 14 -1.</_>
+        <_>
+          4 4 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 7 16 -1.</_>
+        <_>
+          5 18 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 10 -1.</_>
+        <_>
+          6 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 12 -1.</_>
+        <_>
+          5 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 18 -1.</_>
+        <_>
+          4 6 2 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 12 4 -1.</_>
+        <_>
+          1 12 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 2 -1.</_>
+        <_>
+          7 15 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 24 6 4 -1.</_>
+        <_>
+          4 24 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 5 4 -1.</_>
+        <_>
+          4 19 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 25 -1.</_>
+        <_>
+          6 1 3 25 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 12 -1.</_>
+        <_>
+          6 13 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 13 -1.</_>
+        <_>
+          7 4 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 19 -1.</_>
+        <_>
+          10 2 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 19 -1.</_>
+        <_>
+          2 2 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 13 -1.</_>
+        <_>
+          10 1 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 13 -1.</_>
+        <_>
+          2 1 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 8 3 -1.</_>
+        <_>
+          3 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 10 18 -1.</_>
+        <_>
+          2 11 10 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 9 12 -1.</_>
+        <_>
+          6 12 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 4 -1.</_>
+        <_>
+          4 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 8 -1.</_>
+        <_>
+          9 8 5 4 2.</_>
+        <_>
+          4 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 6 -1.</_>
+        <_>
+          4 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 6 10 -1.</_>
+        <_>
+          7 10 3 5 2.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 8 14 -1.</_>
+        <_>
+          3 9 4 7 2.</_>
+        <_>
+          7 16 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 20 -1.</_>
+        <_>
+          7 7 3 10 2.</_>
+        <_>
+          4 17 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 8 -1.</_>
+        <_>
+          3 0 3 4 2.</_>
+        <_>
+          6 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 6 -1.</_>
+        <_>
+          7 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 8 -1.</_>
+        <_>
+          3 7 4 4 2.</_>
+        <_>
+          7 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 4 -1.</_>
+        <_>
+          5 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 9 -1.</_>
+        <_>
+          0 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 12 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 10 6 -1.</_>
+        <_>
+          1 9 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 12 -1.</_>
+        <_>
+          0 10 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 4 -1.</_>
+        <_>
+          3 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 4 12 -1.</_>
+        <_>
+          2 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_>
+        <_>
+          2 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 4 4 -1.</_>
+        <_>
+          6 21 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 16 2 12 -1.</_>
+        <_>
+          9 16 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 5 4 -1.</_>
+        <_>
+          4 19 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 7 -1.</_>
+        <_>
+          5 6 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 12 -1.</_>
+        <_>
+          3 9 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 9 21 -1.</_>
+        <_>
+          3 7 3 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 5 18 -1.</_>
+        <_>
+          2 10 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 7 -1.</_>
+        <_>
+          8 1 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 16 -1.</_>
+        <_>
+          1 3 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 8 -1.</_>
+        <_>
+          9 18 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 12 9 -1.</_>
+        <_>
+          3 18 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 3 -1.</_>
+        <_>
+          5 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          6 1 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 13 -1.</_>
+        <_>
+          7 9 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 6 -1.</_>
+        <_>
+          6 1 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 11 -1.</_>
+        <_>
+          6 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 11 -1.</_>
+        <_>
+          6 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 8 -1.</_>
+        <_>
+          8 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 20 4 8 -1.</_>
+        <_>
+          3 20 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 22 4 6 -1.</_>
+        <_>
+          9 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 22 4 6 -1.</_>
+        <_>
+          3 22 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 22 -1.</_>
+        <_>
+          10 0 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 8 6 -1.</_>
+        <_>
+          5 21 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 15 -1.</_>
+        <_>
+          7 11 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 4 -1.</_>
+        <_>
+          6 1 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_>
+        <_>
+          2 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 4 -1.</_>
+        <_>
+          0 16 6 2 2.</_>
+        <_>
+          6 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 12 -1.</_>
+        <_>
+          6 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 14 -1.</_>
+        <_>
+          4 20 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 9 15 -1.</_>
+        <_>
+          6 14 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 9 4 -1.</_>
+        <_>
+          7 13 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 7 -1.</_>
+        <_>
+          3 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 4 6 -1.</_>
+        <_>
+          6 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 11 -1.</_>
+        <_>
+          6 9 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 12 -1.</_>
+        <_>
+          1 15 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 12 -1.</_>
+        <_>
+          9 0 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 4 16 -1.</_>
+        <_>
+          2 4 2 8 2.</_>
+        <_>
+          4 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 5 14 -1.</_>
+        <_>
+          5 15 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 22 -1.</_>
+        <_>
+          3 0 1 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 25 8 3 -1.</_>
+        <_>
+          6 25 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 8 22 -1.</_>
+        <_>
+          1 17 8 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 8 -1.</_>
+        <_>
+          7 15 3 4 2.</_>
+        <_>
+          4 19 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 14 -1.</_>
+        <_>
+          5 13 2 7 2.</_>
+        <_>
+          7 20 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 10 12 -1.</_>
+        <_>
+          7 16 5 6 2.</_>
+        <_>
+          2 22 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 8 3 -1.</_>
+        <_>
+          4 15 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 3 -1.</_>
+        <_>
+          2 1 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 9 22 -1.</_>
+        <_>
+          3 5 3 22 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 4 -1.</_>
+        <_>
+          4 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 2 -1.</_>
+        <_>
+          4 14 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 4 -1.</_>
+        <_>
+          8 12 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 8 4 -1.</_>
+        <_>
+          4 17 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 6 -1.</_>
+        <_>
+          5 15 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 14 -1.</_>
+        <_>
+          5 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          6 10 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 12 6 -1.</_>
+        <_>
+          1 20 6 3 2.</_>
+        <_>
+          7 23 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 4 -1.</_>
+        <_>
+          4 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 9 6 -1.</_>
+        <_>
+          1 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 4 -1.</_>
+        <_>
+          5 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 8 6 -1.</_>
+        <_>
+          3 3 4 3 2.</_>
+        <_>
+          7 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 23 6 5 -1.</_>
+        <_>
+          6 23 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 4 -1.</_>
+        <_>
+          0 3 6 2 2.</_>
+        <_>
+          6 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 18 -1.</_>
+        <_>
+          7 10 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 6 -1.</_>
+        <_>
+          6 12 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 6 -1.</_>
+        <_>
+          5 15 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 12 -1.</_>
+        <_>
+          0 5 2 6 2.</_>
+        <_>
+          2 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 16 -1.</_>
+        <_>
+          12 4 2 8 2.</_>
+        <_>
+          10 12 2 8 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_lefteye_2splits.xml b/venv/Lib/site-packages/cv2/data/haarcascade_lefteye_2splits.xml
new file mode 100644
index 000000000..9a9ef58fb
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_lefteye_2splits.xml
@@ -0,0 +1,7390 @@
+<?xml version="1.0"?>
+<!--
+    Tree-based 20x20 left eye detector.
+    The detector is trained by 6665 positive samples from FERET, VALID and BioID face databases. 
+    Created by Shiqi Yu (http://yushiqi.cn/research/eyedetection).
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>33</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>5</maxWeakCount>
+      <stageThreshold>-2.3924100399017334e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 0 2.7325989678502083e-02 -1 -2 1 -7.0568458177149296e-03</internalNodes>
+          <leafValues>
+            -9.0600621700286865e-01 9.3385708332061768e-01
+            -4.5859959721565247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2 -1.2538699805736542e-01 -1 -2 3
+            -1.1487299948930740e-01</internalNodes>
+          <leafValues>
+            7.2463721036911011e-01 5.3034168481826782e-01
+            -8.3221220970153809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 4 -5.8309938758611679e-02 -1 -2 5
+            -1.7684370279312134e-02</internalNodes>
+          <leafValues>
+            6.5408891439437866e-01 2.9482871294021606e-01
+            -7.4809581041336060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 6 3.5937170032411814e-03 -1 -2 7 -1.3436110457405448e-03</internalNodes>
+          <leafValues>
+            -5.0303918123245239e-01 6.5995341539382935e-01
+            -5.5740857124328613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 8 -2.1795940119773149e-03 -1 -2 9 1.1514870449900627e-02</internalNodes>
+          <leafValues>
+            -4.2016351222991943e-01 5.9694331884384155e-01
+            -8.0508047342300415e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>7</maxWeakCount>
+      <stageThreshold>-2.6498730182647705e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 10 -2.2485560178756714e-01 -1 -2 11
+            -9.6008004620671272e-03</internalNodes>
+          <leafValues>
+            -8.1363201141357422e-01 9.0863138437271118e-01
+            -3.2208970189094543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 12 7.4219167232513428e-02 -1 -2 13
+            -5.3165741264820099e-03</internalNodes>
+          <leafValues>
+            -7.5329452753067017e-01 8.6339497566223145e-01
+            -3.3463571220636368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 14 -2.1913449745625257e-03 -1 -2 15
+            1.1800959706306458e-02</internalNodes>
+          <leafValues>
+            -5.5720347166061401e-01 -3.2359680533409119e-01
+            6.4163821935653687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 16 -7.6179709285497665e-03 -1 -2 17
+            -9.0587511658668518e-03</internalNodes>
+          <leafValues>
+            -5.3167867660522461e-01 -7.3611450195312500e-01
+            5.5660772323608398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 18 -4.9959779717028141e-03 -1 -2 19
+            8.0803930759429932e-03</internalNodes>
+          <leafValues>
+            -4.1476911306381226e-01 5.9278357028961182e-01
+            -6.7384922504425049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 20 1.9909010734409094e-03 -1 -2 21
+            1.6845749923959374e-03</internalNodes>
+          <leafValues>
+            -4.2145928740501404e-01 5.4679220914840698e-01
+            -7.5099450349807739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 22 -5.0781872123479843e-03 -1 -2 23
+            2.6645609177649021e-03</internalNodes>
+          <leafValues>
+            -3.9899548888206482e-01 5.8940601348876953e-01
+            -4.6778041124343872e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>8</maxWeakCount>
+      <stageThreshold>-2.3828399181365967e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 24 -2.5301438570022583e-01 -1 -2 25
+            2.9663778841495514e-03</internalNodes>
+          <leafValues>
+            -7.5402587652206421e-01 -3.5279649496078491e-01
+            8.7992298603057861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 26 -4.7127649188041687e-02 -1 -2 27
+            1.9500750349834561e-03</internalNodes>
+          <leafValues>
+            -5.2234899997711182e-01 -3.0379909276962280e-01
+            7.5204378366470337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 28 -7.1481026709079742e-02 -1 -2 29
+            2.2189730405807495e-01</internalNodes>
+          <leafValues>
+            6.5841901302337646e-01 -6.0907202959060669e-01
+            5.6842160224914551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 30 3.3842820674180984e-02 -1 -2 31
+            -5.1714561413973570e-04</internalNodes>
+          <leafValues>
+            -6.4311647415161133e-01 5.4620361328125000e-01
+            -3.9984148740768433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 32 -3.4458211157470942e-03 -1 -2 33
+            2.4395729415118694e-03</internalNodes>
+          <leafValues>
+            -4.5636838674545288e-01 4.7798189520835876e-01
+            -9.1247087717056274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 34 2.1385070867836475e-03 -1 -2 35
+            1.8324409611523151e-03</internalNodes>
+          <leafValues>
+            -8.3617758750915527e-01 3.3462798595428467e-01
+            -7.5008547306060791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 36 1.1167610064148903e-03 -1 -2 37
+            9.9106997367925942e-05</internalNodes>
+          <leafValues>
+            -6.9083797931671143e-01 -3.4561330080032349e-01
+            4.1183179616928101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 38 1.5447770245373249e-02 -1 -2 39
+            -3.2244939357042313e-02</internalNodes>
+          <leafValues>
+            3.6980190873146057e-01 6.1112838983535767e-01
+            -5.5685341358184814e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-2.1312201023101807e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 40 -1.2251129746437073e-01 -1 -2 41
+            -1.4230609871447086e-02</internalNodes>
+          <leafValues>
+            -6.7026627063751221e-01 8.7802392244338989e-01
+            -1.8784180283546448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 42 -5.9833219274878502e-03 -1 -2 43
+            7.7085137367248535e-02</internalNodes>
+          <leafValues>
+            -5.8122849464416504e-01 -5.0395351648330688e-01
+            6.7387360334396362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 44 -1.1086189746856689e-01 -1 -2 45
+            9.4604760408401489e-02</internalNodes>
+          <leafValues>
+            6.3432037830352783e-01 -4.9726390838623047e-01
+            3.8787439465522766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 46 1.7696130089461803e-04 -1 -2 47
+            2.0120320841670036e-03</internalNodes>
+          <leafValues>
+            -6.3938802480697632e-01 -3.5313910245895386e-01
+            5.1538437604904175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 48 -1.6102839726954699e-03 -1 -2 49
+            1.6666069859638810e-03</internalNodes>
+          <leafValues>
+            -5.1915901899337769e-01 4.0478190779685974e-01
+            -6.9496357440948486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 50 -7.1480998303741217e-04 -1 -2 51
+            -4.7647571191191673e-03</internalNodes>
+          <leafValues>
+            -4.8945188522338867e-01 -5.0037759542465210e-01
+            4.0796059370040894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 52 7.8659597784280777e-03 -1 -2 53
+            -1.2938310392200947e-03</internalNodes>
+          <leafValues>
+            -3.3636429905891418e-01 -6.7621380090713501e-01
+            4.7010248899459839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 54 -3.6533139063976705e-04 -1 -2 55
+            2.0565679296851158e-03</internalNodes>
+          <leafValues>
+            -4.7071608901023865e-01 4.1323411464691162e-01
+            -5.5526417493820190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 56 7.8385717642959207e-05 -1 -2 57
+            1.7511800397187471e-03</internalNodes>
+          <leafValues>
+            -5.1521158218383789e-01 3.3417248725891113e-01
+            -7.9558157920837402e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-2.0176210403442383e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 58 -6.4695239067077637e-02 -1 -2 59
+            9.5212170854210854e-03</internalNodes>
+          <leafValues>
+            -6.1326402425765991e-01 -5.4831558465957642e-01
+            7.8652447462081909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 60 -9.8109766840934753e-02 -1 -2 61
+            -8.5938459634780884e-01</internalNodes>
+          <leafValues>
+            6.9113308191299438e-01 4.5364680886268616e-01
+            -5.0026148557662964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 62 -8.9836172759532928e-02 -1 -2 63
+            2.6945930439978838e-03</internalNodes>
+          <leafValues>
+            -5.2928781509399414e-01 -3.8199779391288757e-01
+            5.7821297645568848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 64 2.5973599404096603e-03 -1 -2 65
+            -3.0058110132813454e-03</internalNodes>
+          <leafValues>
+            -9.1928368806838989e-01 -8.0213797092437744e-01
+            2.9259279370307922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 66 -4.5496290549635887e-03 -1 -2 67
+            4.7376728616654873e-03</internalNodes>
+          <leafValues>
+            -4.3678951263427734e-01 4.1010880470275879e-01
+            -7.2692811489105225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 68 4.6190437860786915e-03 -1 -2 69
+            4.5377281494438648e-03</internalNodes>
+          <leafValues>
+            -8.4895151853561401e-01 3.0124679207801819e-01
+            -7.0301771163940430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 70 -2.4952790699899197e-03 -1 -2 71
+            -5.1753767766058445e-03</internalNodes>
+          <leafValues>
+            -4.6784749627113342e-01 -7.4530351161956787e-01
+            4.0011820197105408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 72 -5.2049742080271244e-03 -1 -2 73
+            -8.7892003357410431e-02</internalNodes>
+          <leafValues>
+            4.8669269680976868e-01 8.3493947982788086e-01
+            -3.3827719092369080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 74 6.9997250102460384e-03 -1 -2 75
+            -9.0990252792835236e-03</internalNodes>
+          <leafValues>
+            -2.9039889574050903e-01 6.2315821647644043e-01
+            -3.5424730181694031e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>11</maxWeakCount>
+      <stageThreshold>-2.2212049961090088e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 76 -5.5702101439237595e-02 -1 -2 77
+            3.4033291041851044e-02</internalNodes>
+          <leafValues>
+            -6.9841581583023071e-01 -3.9509189128875732e-01
+            8.0313128232955933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 78 -4.6199060976505280e-02 -1 -2 79
+            -4.8061669804155827e-03</internalNodes>
+          <leafValues>
+            -4.8860380053520203e-01 8.0775612592697144e-01
+            -7.4490822851657867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 80 1.8170489929616451e-03 -1 -2 81
+            -3.6162370815873146e-03</internalNodes>
+          <leafValues>
+            -3.8043528795242310e-01 6.0451722145080566e-01
+            -2.2582240402698517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 82 -1.5706950798630714e-02 -1 -2 83
+            4.3929950334131718e-03</internalNodes>
+          <leafValues>
+            -3.7577998638153076e-01 5.4214221239089966e-01
+            -3.7388241291046143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 84 -1.0047219984699041e-04 -1 -2 85
+            -8.6475118994712830e-02</internalNodes>
+          <leafValues>
+            -4.7433409094810486e-01 5.0186318159103394e-01
+            -2.1136230230331421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 86 -7.7960766851902008e-02 -1 -2 87
+            9.8561286926269531e-02</internalNodes>
+          <leafValues>
+            5.7337349653244019e-01 -3.2515558600425720e-01
+            5.3035980463027954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 88 -5.4359167814254761e-01 -1 -2 89
+            -4.4177699834108353e-02</internalNodes>
+          <leafValues>
+            5.9464299678802490e-01 2.9671078920364380e-01
+            -3.8474830985069275e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 90 -8.8016409426927567e-04 -1 -2 91
+            2.6359390467405319e-03</internalNodes>
+          <leafValues>
+            -3.2000589370727539e-01 -1.7586140334606171e-01
+            4.8360350728034973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 92 -1.4203689992427826e-02 -1 -2 93
+            -7.3902818257920444e-05</internalNodes>
+          <leafValues>
+            -7.7882087230682373e-01 3.0619418621063232e-01
+            -3.3196049928665161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 94 4.6157240867614746e-03 -1 -2 95
+            1.1152310296893120e-02</internalNodes>
+          <leafValues>
+            4.9689778685569763e-01 -5.3435891866683960e-01
+            9.7229443490505219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 96 -6.0547702014446259e-03 -1 -2 97
+            -2.1118740551173687e-03</internalNodes>
+          <leafValues>
+            -8.3811217546463013e-01 6.3617032766342163e-01
+            -4.8299189656972885e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-2.1328830718994141e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 98 -1.2956829741597176e-02 -1 -2 99
+            -2.7141019701957703e-02</internalNodes>
+          <leafValues>
+            -6.4874732494354248e-01 7.6293057203292847e-01
+            -3.3947870135307312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 100 4.5119998976588249e-03 -1 -2 101
+            1.2516690418124199e-02</internalNodes>
+          <leafValues>
+            -5.0059837102890015e-01 -3.6873328685760498e-01
+            5.9888631105422974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 102 -6.0557941906154156e-03 -1 -2 103
+            -4.6923749148845673e-02</internalNodes>
+          <leafValues>
+            -3.8940930366516113e-01 6.3268911838531494e-01
+            -2.6270028948783875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 104 -2.4018269032239914e-03 -1 -2 105
+            -1.5936089679598808e-02</internalNodes>
+          <leafValues>
+            -5.0517928600311279e-01 6.5526002645492554e-01
+            -1.7308109998703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 106 1.4000290073454380e-02 -1 -2 107
+            1.3202779926359653e-02</internalNodes>
+          <leafValues>
+            -4.1653230786323547e-01 -4.9121969938278198e-01
+            3.7397938966751099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 108 -2.7658580802381039e-04 -1 -2 109
+            -4.8634149134159088e-03</internalNodes>
+          <leafValues>
+            -4.5382869243621826e-01 -5.9796881675720215e-01
+            3.1217721104621887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 110 2.7654920704662800e-03 -1 -2 111
+            2.5534769892692566e-01</internalNodes>
+          <leafValues>
+            -7.6476567983627319e-01 -3.4267220646142960e-02
+            7.0786577463150024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 112 4.6812961809337139e-03 -1 -2 113
+            6.5162130631506443e-03</internalNodes>
+          <leafValues>
+            -7.8790861368179321e-01 1.8877579271793365e-01
+            -7.9132258892059326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 114 5.7325329631567001e-02 -1 -2 115
+            -1.2718330137431622e-02</internalNodes>
+          <leafValues>
+            6.2349188327789307e-01 3.0860608816146851e-01
+            -3.2784330844879150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 116 -6.7374261561781168e-04 -1 -2 117
+            5.6564649567008018e-03</internalNodes>
+          <leafValues>
+            -4.5451548695564270e-01 2.7431339025497437e-01
+            -7.8447937965393066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 118 3.1134090386331081e-03 -1 -2 119
+            2.4249779526144266e-03</internalNodes>
+          <leafValues>
+            3.9738771319389343e-01 -3.5198271274566650e-01
+            3.0490091443061829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 120 -5.5641461163759232e-02 -1 -2 121
+            4.3548129498958588e-02</internalNodes>
+          <leafValues>
+            4.5575490593910217e-01 -3.3370929956436157e-01
+            2.9501429200172424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 122 8.0783379962667823e-04 -1 -2 123
+            1.8713270546868443e-03</internalNodes>
+          <leafValues>
+            2.2460040450096130e-01 -6.6048407554626465e-01
+            1.5031670033931732e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.9884539842605591e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 124 -4.3516629934310913e-01 -1 -2 125
+            6.2595037743449211e-03</internalNodes>
+          <leafValues>
+            -4.9959290027618408e-01 -2.3639589548110962e-01
+            7.9975378513336182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 126 -6.6518150269985199e-03 -1 -2 127
+            -5.7092090137302876e-03</internalNodes>
+          <leafValues>
+            -5.4752808809280396e-01 6.4273327589035034e-01
+            -2.1511809527873993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 128 1.9450180232524872e-02 -1 -2 129
+            -5.4476498626172543e-03</internalNodes>
+          <leafValues>
+            -5.3605002164840698e-01 5.5794501304626465e-01
+            -2.1474960446357727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 130 -1.6347589553333819e-04 -1 -2 131
+            7.1614650078117847e-03</internalNodes>
+          <leafValues>
+            -5.5962842702865601e-01 -1.6604369878768921e-01
+            4.6805259585380554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 132 -1.3145170174539089e-02 -1 -2 133
+            -1.1436809785664082e-02</internalNodes>
+          <leafValues>
+            -4.1279909014701843e-01 3.7901800870895386e-01
+            -4.1791579127311707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 134 -7.2912001051008701e-03 -1 -2 135
+            -5.2170921117067337e-04</internalNodes>
+          <leafValues>
+            -7.6089668273925781e-01 3.2527619600296021e-01
+            -3.0110970139503479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 136 3.3754010219126940e-03 -1 -2 137
+            2.5100160855799913e-03</internalNodes>
+          <leafValues>
+            -7.8373962640762329e-01 1.8525449931621552e-01
+            -5.8084958791732788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 138 -1.2884209863841534e-03 -1 -2 139
+            -1.8726480193436146e-03</internalNodes>
+          <leafValues>
+            2.7339500188827515e-01 1.6819879412651062e-01
+            -5.1986902952194214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 140 2.4010189808905125e-03 -1 -2 141
+            4.8938081599771976e-03</internalNodes>
+          <leafValues>
+            -8.2964670658111572e-01 1.6796599328517914e-01
+            -6.5530872344970703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 142 3.1223020050674677e-03 -1 -2 143
+            5.0366491079330444e-02</internalNodes>
+          <leafValues>
+            -4.3521308898925781e-01 -5.8327801525592804e-03
+            7.0878309011459351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 144 3.6151800304651260e-02 -1 -2 145
+            -1.3426589965820312e-01</internalNodes>
+          <leafValues>
+            4.4979161024093628e-01 3.9472430944442749e-01
+            -3.7588629126548767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 146 -2.7791369706392288e-02 -1 -2 147
+            -1.2712170369923115e-02</internalNodes>
+          <leafValues>
+            -2.9488721489906311e-01 -7.2011739015579224e-01
+            3.6595028638839722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 148 -3.8276749546639621e-04 -1 -2 149
+            -6.1330529861152172e-03</internalNodes>
+          <leafValues>
+            -4.0581339597702026e-01 -5.2725958824157715e-01
+            3.6040499806404114e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>16</maxWeakCount>
+      <stageThreshold>-2.0902318954467773e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 150 -4.7748669981956482e-02 -1 -2 151
+            4.6201851218938828e-03</internalNodes>
+          <leafValues>
+            -5.9902387857437134e-01 -2.4887490272521973e-01
+            6.9201582670211792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 152 -8.5353456437587738e-02 -1 -2 153
+            -7.0110969245433807e-03</internalNodes>
+          <leafValues>
+            -5.1715832948684692e-01 5.6950652599334717e-01
+            -2.4749420583248138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 154 -7.6567470096051693e-03 -1 -2 155
+            -3.5919491201639175e-02</internalNodes>
+          <leafValues>
+            -3.7316519021987915e-01 4.9438580870628357e-01
+            -3.9586681127548218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 156 -7.4326626956462860e-02 -1 -2 157
+            9.0118587017059326e-02</internalNodes>
+          <leafValues>
+            5.6755977869033813e-01 -3.8921171426773071e-01
+            3.1079098582267761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 158 1.6736460849642754e-02 -1 -2 159
+            1.8592580454424024e-03</internalNodes>
+          <leafValues>
+            -3.6674138903617859e-01 3.4875720739364624e-01
+            -5.7483112812042236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 160 7.5264140032231808e-03 -1 -2 161
+            -3.5309391096234322e-03</internalNodes>
+          <leafValues>
+            6.7878991365432739e-01 4.8617920279502869e-01
+            -2.5660640001296997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 162 -4.9510748795000836e-05 -1 -2 163
+            -6.8923248909413815e-03</internalNodes>
+          <leafValues>
+            -4.5661240816116333e-01 -5.7134729623794556e-01
+            3.2921048998832703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 164 6.1156069859862328e-03 -1 -2 165
+            -5.5014882236719131e-03</internalNodes>
+          <leafValues>
+            -7.1315360069274902e-01 -5.9139078855514526e-01
+            1.9805949926376343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 166 -4.2378060519695282e-02 -1 -2 167
+            2.2011259570717812e-03</internalNodes>
+          <leafValues>
+            -3.8239300251007080e-01 3.3457010984420776e-01
+            -4.3032339215278625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 168 2.1217379253357649e-03 -1 -2 169
+            6.4385468140244484e-03</internalNodes>
+          <leafValues>
+            -6.8310022354125977e-01 2.0478610694408417e-01
+            -6.1793941259384155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 170 3.1177410855889320e-03 -1 -2 171
+            4.2230269173160195e-04</internalNodes>
+          <leafValues>
+            5.1137161254882812e-01 -3.6440208554267883e-01
+            2.1073049306869507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 172 -6.5657291561365128e-03 -1 -2 173
+            2.5686610024422407e-03</internalNodes>
+          <leafValues>
+            -6.4581501483917236e-01 2.7643561363220215e-01
+            -3.4198498725891113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 174 -6.2437567976303399e-05 -1 -2 175
+            -3.6269261036068201e-03</internalNodes>
+          <leafValues>
+            -3.1758078932762146e-01 -8.1051957607269287e-01
+            2.7218630909919739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 176 -3.4638389479368925e-03 -1 -2 177
+            -7.4930191040039062e-02</internalNodes>
+          <leafValues>
+            -3.9515769481658936e-01 -5.4353868961334229e-01
+            2.6106119155883789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 178 -9.7247250378131866e-03 -1 -2 179
+            4.5450199395418167e-03</internalNodes>
+          <leafValues>
+            4.1124871373176575e-01 -3.1576550006866455e-01
+            3.9046970009803772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 180 -2.7354240883141756e-03 -1 -2 181
+            -1.6969470307230949e-02</internalNodes>
+          <leafValues>
+            -7.4906748533248901e-01 -6.2437218427658081e-01
+            1.8387380242347717e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.9407310485839844e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 182 -2.4978699162602425e-02 -1 -2 183
+            -5.8007869869470596e-02</internalNodes>
+          <leafValues>
+            -6.0697889328002930e-01 7.1478021144866943e-01
+            -2.9943239688873291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 184 -5.1753749139606953e-03 -1 -2 185
+            -8.9618662605062127e-04</internalNodes>
+          <leafValues>
+            -3.5297989845275879e-01 5.4417461156845093e-01
+            -3.9789950847625732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 186 -2.8718139219563454e-05 -1 -2 187
+            4.7620530240237713e-03</internalNodes>
+          <leafValues>
+            -4.8898181319236755e-01 -3.1144559383392334e-01
+            4.6786791086196899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 188 1.9751280546188354e-02 -1 -2 189
+            -1.2683609966188669e-03</internalNodes>
+          <leafValues>
+            -4.3020489811897278e-01 -5.4090851545333862e-01
+            3.9797520637512207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 190 -4.5749718992738053e-05 -1 -2 191
+            2.4090509396046400e-03</internalNodes>
+          <leafValues>
+            -4.4518938660621643e-01 2.8822308778762817e-01
+            -5.4514312744140625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 192 -4.5728669501841068e-03 -1 -2 193
+            8.9018214493989944e-03</internalNodes>
+          <leafValues>
+            5.5039870738983154e-01 -4.1598889231681824e-01
+            1.7468899488449097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 194 -1.2056449800729752e-01 -1 -2 195
+            4.6919930726289749e-02</internalNodes>
+          <leafValues>
+            6.8890577554702759e-01 -4.2266309261322021e-01
+            1.7010940611362457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 196 -4.2390259914100170e-03 -1 -2 197
+            3.2174249645322561e-03</internalNodes>
+          <leafValues>
+            -6.3045340776443481e-01 -3.6097949743270874e-01
+            2.4933730065822601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 198 -8.5738790221512318e-04 -1 -2 199
+            -1.8432449549436569e-02</internalNodes>
+          <leafValues>
+            3.0993479490280151e-01 9.7758449614048004e-02
+            -5.0742352008819580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 200 5.8692828752100468e-03 -1 -2 201
+            -6.8751699291169643e-03</internalNodes>
+          <leafValues>
+            -7.4556058645248413e-01 -6.7458391189575195e-01
+            1.5918810665607452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 202 -6.8542227381840348e-05 -1 -2 203
+            -1.0658579878509045e-02</internalNodes>
+          <leafValues>
+            -4.1279420256614685e-01 3.7002709507942200e-01
+            -2.1731729805469513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 204 -1.8811509944498539e-03 -1 -2 205
+            -2.2309130057692528e-02</internalNodes>
+          <leafValues>
+            5.7902830839157104e-01 1.9725680351257324e-01
+            -3.2475191354751587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 206 6.5826578065752983e-04 -1 -2 207
+            -5.0781588070094585e-03</internalNodes>
+          <leafValues>
+            -6.0630238056182861e-01 -7.7123302221298218e-01
+            1.8186129629611969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 208 5.6215081363916397e-02 -1 -2 209
+            -3.7720590829849243e-02</internalNodes>
+          <leafValues>
+            5.0561398267745972e-01 3.6052110791206360e-01
+            -3.2743760943412781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 210 3.9480631239712238e-03 -1 -2 211
+            -2.4269670248031616e-03</internalNodes>
+          <leafValues>
+            -7.5788182020187378e-01 5.2076101303100586e-01
+            -6.1021361500024796e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>-2.1061589717864990e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 212 -1.6906699165701866e-02 -1 -2 213
+            2.5327840819954872e-02</internalNodes>
+          <leafValues>
+            -4.7501268982887268e-01 -4.4016760587692261e-01
+            6.0885351896286011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 214 -1.5663320198655128e-02 -1 -2 215
+            -1.6101899743080139e-01</internalNodes>
+          <leafValues>
+            5.7100051641464233e-01 4.0989148616790771e-01
+            -3.8142371177673340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 216 1.6885380318854004e-04 -1 -2 217
+            -3.0552360694855452e-03</internalNodes>
+          <leafValues>
+            -4.7958490252494812e-01 4.2852300405502319e-01
+            -2.8252631425857544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 218 4.8042940907180309e-03 -1 -2 219
+            -5.0092511810362339e-03</internalNodes>
+          <leafValues>
+            -6.8659138679504395e-01 -5.9033542871475220e-01
+            1.9732500612735748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 220 -3.7119518965482712e-02 -1 -2 221
+            3.7857799325138330e-03</internalNodes>
+          <leafValues>
+            -4.3130961060523987e-01 3.3596190810203552e-01
+            -3.7401720881462097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 222 -1.0869850404560566e-02 -1 -2 223
+            4.0577541221864522e-04</internalNodes>
+          <leafValues>
+            5.4841208457946777e-01 -5.0022697448730469e-01
+            5.1423858851194382e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 224 5.0201490521430969e-03 -1 -2 225
+            2.5601210072636604e-03</internalNodes>
+          <leafValues>
+            -5.9016227722167969e-01 1.9469800591468811e-01
+            -6.4648360013961792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 226 -1.2395749799907207e-03 -1 -2 227
+            -5.1075750961899757e-03</internalNodes>
+          <leafValues>
+            -2.7762159705162048e-01 -6.1149162054061890e-01
+            3.5250389575958252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 228 -6.4853738876990974e-05 -1 -2 229
+            2.3282810579985380e-03</internalNodes>
+          <leafValues>
+            -3.4008860588073730e-01 2.7134749293327332e-01
+            -6.6915398836135864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 230 -1.5571110416203737e-03 -1 -2 231
+            2.3992219939827919e-03</internalNodes>
+          <leafValues>
+            -4.1144248843193054e-01 2.5939700007438660e-01
+            -4.0380299091339111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 232 7.7784422319382429e-04 -1 -2 233
+            3.2334199640899897e-03</internalNodes>
+          <leafValues>
+            2.9523921012878418e-01 -5.8436852693557739e-01
+            -1.7936639487743378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 234 -5.6113858590833843e-05 -1 -2 235
+            1.9111000001430511e-03</internalNodes>
+          <leafValues>
+            -3.5021650791168213e-01 2.6312610507011414e-01
+            -6.1549347639083862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 236 -3.4321150742471218e-03 -1 -2 237
+            -1.4541969634592533e-02</internalNodes>
+          <leafValues>
+            3.7493300437927246e-01 4.3788930773735046e-01
+            -3.0131611227989197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 238 -2.5027070194482803e-02 -1 -2 239
+            -3.1183639075607061e-03</internalNodes>
+          <leafValues>
+            -5.2829748392105103e-01 -8.1336849927902222e-01
+            1.7928420007228851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 240 2.9415208846330643e-03 -1 -2 241
+            -2.4807679001241922e-03</internalNodes>
+          <leafValues>
+            -4.7243058681488037e-01 -6.0058331489562988e-01
+            2.1497109532356262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 242 -4.2498838156461716e-03 -1 -2 243
+            7.6959328725934029e-03</internalNodes>
+          <leafValues>
+            -3.3230608701705933e-01 2.1247069537639618e-01
+            -8.1967252492904663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 244 -6.1426039785146713e-02 -1 -2 245
+            5.3176790475845337e-02</internalNodes>
+          <leafValues>
+            5.2200448513031006e-01 -2.9851761460304260e-01
+            2.8654190897941589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 246 2.5695779186207801e-05 -1 -2 247
+            2.4311970919370651e-03</internalNodes>
+          <leafValues>
+            -3.4719291329383850e-01 -1.2133490294218063e-01
+            3.8965350389480591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 248 5.6956289336085320e-03 -1 -2 249
+            -6.6630227956920862e-04</internalNodes>
+          <leafValues>
+            -6.6364032030105591e-01 2.7921909093856812e-01
+            -2.1624849736690521e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>20</maxWeakCount>
+      <stageThreshold>-2.0051579475402832e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 250 -2.8509549796581268e-02 -1 -2 251
+            -1.6429109498858452e-02</internalNodes>
+          <leafValues>
+            -5.5133241415023804e-01 6.0328769683837891e-01
+            -3.0009600520133972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 252 -5.8078952133655548e-03 -1 -2 253
+            -1.4670349657535553e-02</internalNodes>
+          <leafValues>
+            -4.8640519380569458e-01 4.4786658883094788e-01
+            -3.5448360443115234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 254 -1.0694459779188037e-03 -1 -2 255
+            -5.0697539001703262e-02</internalNodes>
+          <leafValues>
+            -3.8593119382858276e-01 4.3865600228309631e-01
+            -3.1134051084518433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 256 -7.2318017482757568e-02 -1 -2 257
+            -1.6740759834647179e-02</internalNodes>
+          <leafValues>
+            5.5695492029190063e-01 3.4036931395530701e-01
+            -3.7713068723678589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 258 1.2923260219395161e-02 -1 -2 259
+            -2.0832989830523729e-03</internalNodes>
+          <leafValues>
+            2.6987180113792419e-01 7.2217263281345367e-02
+            -5.0617259740829468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 260 2.9217539122328162e-04 -1 -2 261
+            4.6477448195219040e-03</internalNodes>
+          <leafValues>
+            -4.7199469804763794e-01 -2.0233640074729919e-01
+            3.6684620380401611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 262 1.6355320112779737e-03 -1 -2 263
+            6.0143060982227325e-03</internalNodes>
+          <leafValues>
+            -3.3369150757789612e-01 2.6335370540618896e-01
+            -7.5315129756927490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 264 -1.9768040627241135e-02 -1 -2 265
+            5.0995801575481892e-03</internalNodes>
+          <leafValues>
+            -7.3396641016006470e-01 -1.0626330226659775e-01
+            3.7877479195594788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 266 2.1737320348620415e-03 -1 -2 267
+            2.3621059954166412e-02</internalNodes>
+          <leafValues>
+            -4.5873621106147766e-01 -3.7341989576816559e-02
+            5.0312960147857666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 268 4.7070439904928207e-02 -1 -2 269
+            4.8429161310195923e-02</internalNodes>
+          <leafValues>
+            3.9159670472145081e-01 -2.7507638931274414e-01
+            3.6923450231552124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 270 7.1763257437851280e-05 -1 -2 271
+            -4.0031517855823040e-03</internalNodes>
+          <leafValues>
+            -2.6133701205253601e-01 -4.6118479967117310e-01
+            3.4101578593254089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 272 2.5536299217492342e-03 -1 -2 273
+            -2.5720898993313313e-03</internalNodes>
+          <leafValues>
+            4.4237849116325378e-01 4.3066531419754028e-01
+            -2.8360688686370850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 274 8.7512210011482239e-03 -1 -2 275
+            5.7346918620169163e-03</internalNodes>
+          <leafValues>
+            -7.7647632360458374e-01 1.4551159739494324e-01
+            -7.5074160099029541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 276 -6.6438838839530945e-03 -1 -2 277
+            -3.4590701106935740e-03</internalNodes>
+          <leafValues>
+            4.0350550413131714e-01 2.8769719600677490e-01
+            -2.8021600842475891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 278 9.9742468446493149e-03 -1 -2 279
+            1.3233659788966179e-02</internalNodes>
+          <leafValues>
+            -6.0677021741867065e-01 1.5478080511093140e-01
+            -7.0759147405624390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 280 -5.0271311774849892e-03 -1 -2 281
+            -1.2092100223526359e-04</internalNodes>
+          <leafValues>
+            -7.3897778987884521e-01 2.3473000526428223e-01
+            -2.4400579929351807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 282 -1.2881499715149403e-03 -1 -2 283
+            6.2854858115315437e-03</internalNodes>
+          <leafValues>
+            -2.8901669383049011e-01 2.8100869059562683e-01
+            -5.6933850049972534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 284 5.6929360143840313e-03 -1 -2 285
+            -5.3880861960351467e-03</internalNodes>
+          <leafValues>
+            -7.8456932306289673e-01 2.6201328635215759e-01
+            -2.2232030332088470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 286 4.8205819912254810e-03 -1 -2 287
+            3.4279188513755798e-01</internalNodes>
+          <leafValues>
+            5.6795972585678101e-01 -1.8314230442047119e-01
+            5.4108071327209473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 288 5.1370919682085514e-03 -1 -2 289
+            -9.1285221278667450e-03</internalNodes>
+          <leafValues>
+            -3.9116761088371277e-01 5.3076338768005371e-01
+            -3.0019309371709824e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>-2.1121981143951416e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 290 -5.1386129111051559e-02 -1 -2 291
+            5.1850839518010616e-03</internalNodes>
+          <leafValues>
+            -5.3148782253265381e-01 -2.4744540452957153e-01
+            6.1181622743606567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 292 -1.5259400010108948e-02 -1 -2 293
+            2.5995150208473206e-02</internalNodes>
+          <leafValues>
+            -4.3303629755973816e-01 4.3979901820421219e-02
+            7.3829138278961182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 294 -3.2312370836734772e-02 -1 -2 295
+            1.3700700365006924e-02</internalNodes>
+          <leafValues>
+            -3.9609751105308533e-01 -2.7643880248069763e-01
+            4.2535358667373657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 296 -2.2647869773209095e-03 -1 -2 297
+            -6.8290620110929012e-03</internalNodes>
+          <leafValues>
+            -3.2005569338798523e-01 -5.1682972908020020e-01
+            3.6975708603858948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 298 -2.2481549531221390e-03 -1 -2 299
+            4.5944549143314362e-02</internalNodes>
+          <leafValues>
+            -3.6244350671768188e-01 -1.3187309959903359e-03
+            6.3217681646347046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 300 1.8755620112642646e-03 -1 -2 301
+            -1.9700559787452221e-03</internalNodes>
+          <leafValues>
+            -7.1403390169143677e-01 -5.8730661869049072e-01
+            1.7592810094356537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 302 -6.5721389837563038e-03 -1 -2 303
+            -1.1746180243790150e-02</internalNodes>
+          <leafValues>
+            -3.6347511410713196e-01 3.1440791487693787e-01
+            -4.0111118555068970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 304 -1.6494120063725859e-04 -1 -2 305
+            -7.2169408667832613e-05</internalNodes>
+          <leafValues>
+            -3.7792590260505676e-01 5.2791112661361694e-01
+            -1.0790319740772247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 306 1.9697639800142497e-04 -1 -2 307
+            -1.1423509567975998e-02</internalNodes>
+          <leafValues>
+            -4.7097641229629517e-01 -8.5209292173385620e-01
+            1.7662869393825531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 308 -4.5562228187918663e-03 -1 -2 309
+            -4.4720191508531570e-03</internalNodes>
+          <leafValues>
+            -8.0601161718368530e-01 -6.1500209569931030e-01
+            1.2908309698104858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 310 -1.7765410011634231e-03 -1 -2 311
+            -7.8799277544021606e-03</internalNodes>
+          <leafValues>
+            3.1382599472999573e-01 3.0394628643989563e-01
+            -3.7204921245574951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 312 -1.4284689677879214e-03 -1 -2 313
+            -1.8939910223707557e-03</internalNodes>
+          <leafValues>
+            5.0413030385971069e-01 3.4823760390281677e-01
+            -2.3673820495605469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 314 -3.1496640294790268e-03 -1 -2 315
+            -1.0716119781136513e-02</internalNodes>
+          <leafValues>
+            -6.6812378168106079e-01 -4.8515519499778748e-01
+            1.9036419689655304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 316 -6.8033537827432156e-03 -1 -2 317
+            1.4902319759130478e-02</internalNodes>
+          <leafValues>
+            -5.6979268789291382e-01 1.3098250329494476e-01
+            -7.1448272466659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 318 -3.4170228987932205e-02 -1 -2 319
+            -1.4779250323772430e-01</internalNodes>
+          <leafValues>
+            5.0575131177902222e-01 2.8233268857002258e-01
+            -2.7205321192741394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 320 -5.5842810979811475e-05 -1 -2 321
+            3.9885081350803375e-02</internalNodes>
+          <leafValues>
+            -2.6936730742454529e-01 5.6696129031479359e-03
+            6.3975161314010620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 322 1.2483130209147930e-02 -1 -2 323
+            -3.2864511013031006e-04</internalNodes>
+          <leafValues>
+            -7.4533742666244507e-01 3.6449620127677917e-01
+            -9.6498817205429077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 324 -1.4710469986312091e-04 -1 -2 325
+            -2.7814340591430664e-01</internalNodes>
+          <leafValues>
+            1.4060440659523010e-01 5.7002830505371094e-01
+            -4.8755478858947754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 326 -1.3452640268951654e-03 -1 -2 327
+            9.1500842245295644e-04</internalNodes>
+          <leafValues>
+            3.9255830645561218e-01 -3.0215170979499817e-01
+            3.6698031425476074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 328 -3.4133149310946465e-03 -1 -2 329
+            5.1169008947908878e-03</internalNodes>
+          <leafValues>
+            -6.4085817337036133e-01 -2.3052580654621124e-01
+            2.4285919964313507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 330 8.8846698403358459e-02 -1 -2 331
+            6.1080828309059143e-03</internalNodes>
+          <leafValues>
+            4.5381888747215271e-01 -3.5880088806152344e-01
+            1.3209380209445953e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.8701590299606323e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 332 -1.5930000692605972e-02 -1 -2 333
+            2.7407450601458549e-02</internalNodes>
+          <leafValues>
+            -3.5245341062545776e-01 -6.0236789286136627e-02
+            7.2715848684310913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 334 -8.5037678480148315e-02 -1 -2 335
+            -1.1508919997140765e-03</internalNodes>
+          <leafValues>
+            -4.3576711416244507e-01 4.6471679210662842e-01
+            -3.5896891355514526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 336 -6.4599298639222980e-04 -1 -2 337
+            5.5495807901024818e-03</internalNodes>
+          <leafValues>
+            -3.1371060013771057e-01 4.1225919127464294e-01
+            -4.9400448799133301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 338 -1.1472150217741728e-03 -1 -2 339
+            -6.4546810463070869e-03</internalNodes>
+          <leafValues>
+            -3.9192581176757812e-01 -6.9197827577590942e-01
+            2.6103940606117249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 340 -1.1414250358939171e-02 -1 -2 341
+            1.1582579463720322e-03</internalNodes>
+          <leafValues>
+            3.2361420989036560e-01 -3.8304999470710754e-01
+            2.8015980124473572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 342 -6.1077292775735259e-04 -1 -2 343
+            1.1812780285254121e-03</internalNodes>
+          <leafValues>
+            -3.7471079826354980e-01 -1.7685219645500183e-01
+            3.5498109459877014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 344 7.9117231070995331e-03 -1 -2 345
+            -9.0904926764778793e-05</internalNodes>
+          <leafValues>
+            -6.9681918621063232e-01 2.0756739377975464e-01
+            -4.4282090663909912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 346 2.8638960793614388e-03 -1 -2 347
+            1.2769990134984255e-03</internalNodes>
+          <leafValues>
+            -4.1364789009094238e-01 -2.1157020330429077e-01
+            3.1919568777084351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 348 -7.5440858490765095e-03 -1 -2 349
+            5.4467269219458103e-03</internalNodes>
+          <leafValues>
+            -7.5495690107345581e-01 1.3229879736900330e-01
+            -6.7695891857147217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 350 1.3641830300912261e-03 -1 -2 351
+            1.3810779899358749e-02</internalNodes>
+          <leafValues>
+            -4.2168149352073669e-01 1.5719360113143921e-01
+            -6.7965167760848999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 352 5.0265640020370483e-02 -1 -2 353
+            4.7765119234099984e-05</internalNodes>
+          <leafValues>
+            7.4369138479232788e-01 -3.8102349638938904e-01
+            1.0605350136756897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 354 1.4666689932346344e-01 -1 -2 355
+            -3.0426830053329468e-01</internalNodes>
+          <leafValues>
+            5.3409832715988159e-01 3.7783610820770264e-01
+            -2.1534620225429535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 356 -3.2244708854705095e-03 -1 -2 357
+            -1.7187190242111683e-03</internalNodes>
+          <leafValues>
+            2.8274241089820862e-01 1.0677109658718109e-01
+            -4.4204118847846985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 358 -8.4115704521536827e-03 -1 -2 359
+            -2.3220919072628021e-02</internalNodes>
+          <leafValues>
+            -8.3557051420211792e-01 -5.1933908462524414e-01
+            1.3181640207767487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 360 -6.3912221230566502e-03 -1 -2 361
+            -3.0661540222354233e-04</internalNodes>
+          <leafValues>
+            -6.8552321195602417e-01 2.2192850708961487e-01
+            -2.3945030570030212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 362 1.8742750398814678e-03 -1 -2 363
+            -2.8299540281295776e-02</internalNodes>
+          <leafValues>
+            -4.7218438982963562e-01 -6.8186718225479126e-01
+            1.5923790633678436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 364 7.9352483153343201e-03 -1 -2 365
+            -8.7599940598011017e-03</internalNodes>
+          <leafValues>
+            -7.3135781288146973e-01 -6.0014718770980835e-01
+            1.0350330173969269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 366 -5.5426149629056454e-03 -1 -2 367
+            -1.8066290067508817e-03</internalNodes>
+          <leafValues>
+            -5.9360408782958984e-01 2.5533521175384521e-01
+            -1.7036439478397369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 368 -8.3993803709745407e-03 -1 -2 369
+            -1.9515500171110034e-03</internalNodes>
+          <leafValues>
+            -2.3953610658645630e-01 3.7252411246299744e-01
+            -1.2982900440692902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 370 -2.2850139066576958e-03 -1 -2 371
+            -6.1910818330943584e-03</internalNodes>
+          <leafValues>
+            5.0227212905883789e-01 4.4551658630371094e-01
+            -1.6307780146598816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 372 1.1659320443868637e-03 -1 -2 373
+            -2.1016779355704784e-03</internalNodes>
+          <leafValues>
+            3.4809079766273499e-01 3.1531378626823425e-01
+            -3.4710261225700378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 374 -9.1615924611687660e-03 -1 -2 375
+            -2.0036540925502777e-02</internalNodes>
+          <leafValues>
+            -6.8623197078704834e-01 -6.8991881608963013e-01
+            1.2962220609188080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 376 2.7148448862135410e-03 -1 -2 377
+            2.2834159899502993e-03</internalNodes>
+          <leafValues>
+            4.7745740413665771e-01 -1.3344570063054562e-02
+            -6.1795878410339355e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.9807859659194946e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 378 -3.2838471233844757e-02 -1 -2 379
+            -7.5696408748626709e-03</internalNodes>
+          <leafValues>
+            -5.1984071731567383e-01 6.3690251111984253e-01
+            -1.1562170088291168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 380 5.4125871509313583e-02 -1 -2 381
+            2.7004599571228027e-01</internalNodes>
+          <leafValues>
+            5.0340247154235840e-01 -3.4640678763389587e-01
+            3.7651509046554565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 382 7.0261410437524319e-03 -1 -2 383
+            3.1245660502463579e-03</internalNodes>
+          <leafValues>
+            -4.1046440601348877e-01 -4.1382190585136414e-01
+            3.7550741434097290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 384 -1.8708549905568361e-03 -1 -2 385
+            -1.4969009906053543e-02</internalNodes>
+          <leafValues>
+            -3.7827330827713013e-01 3.9941680431365967e-01
+            -2.2254510223865509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 386 3.4136420581489801e-03 -1 -2 387
+            2.3454260081052780e-03</internalNodes>
+          <leafValues>
+            -5.4667568206787109e-01 1.6618840396404266e-01
+            -6.3203942775726318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 388 -1.1689099483191967e-03 -1 -2 389
+            -7.8206984326243401e-03</internalNodes>
+          <leafValues>
+            -4.4972181320190430e-01 -5.7166117429733276e-01
+            1.8599990010261536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 390 -2.6324259117245674e-02 -1 -2 391
+            -9.1647548833861947e-04</internalNodes>
+          <leafValues>
+            -7.8041112422943115e-01 2.3100090026855469e-01
+            -2.1224120259284973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 392 -2.3702960461378098e-03 -1 -2 393
+            -9.2874821275472641e-03</internalNodes>
+          <leafValues>
+            2.7304211258888245e-01 2.3200799524784088e-01
+            -3.4602558612823486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 394 2.9221060685813427e-03 -1 -2 395
+            -1.4097889652475715e-03</internalNodes>
+          <leafValues>
+            -6.9972628355026245e-01 4.8019358515739441e-01
+            -4.2650200426578522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 396 9.3326548812910914e-04 -1 -2 397
+            -5.6837309151887894e-02</internalNodes>
+          <leafValues>
+            3.7708479166030884e-01 4.6375161409378052e-01
+            -2.0441579818725586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 398 -9.1405760031193495e-05 -1 -2 399
+            -1.1147770099341869e-02</internalNodes>
+          <leafValues>
+            -2.9447770118713379e-01 3.6579200625419617e-01
+            -1.6106230020523071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 400 8.0759642878547311e-04 -1 -2 401
+            1.7215589759871364e-03</internalNodes>
+          <leafValues>
+            -3.8769969344139099e-01 1.7790059745311737e-01
+            -5.9673792123794556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 402 1.4305640012025833e-02 -1 -2 403
+            -3.8885008543729782e-02</internalNodes>
+          <leafValues>
+            -2.8887918591499329e-01 3.6497229337692261e-01
+            -1.3762719929218292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 404 -3.4479280002415180e-03 -1 -2 405
+            3.0168178677558899e-01</internalNodes>
+          <leafValues>
+            1.8110840022563934e-01 -3.5425490140914917e-01
+            4.2958360910415649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 406 2.8582389932125807e-03 -1 -2 407
+            1.4091320335865021e-03</internalNodes>
+          <leafValues>
+            5.2957808971405029e-01 -2.1234430372714996e-01
+            3.1428509950637817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 408 -1.6597079811617732e-03 -1 -2 409
+            8.7804382201284170e-04</internalNodes>
+          <leafValues>
+            -6.3348418474197388e-01 -5.5315300822257996e-02
+            3.9389958977699280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 410 2.0211800001561642e-03 -1 -2 411
+            -6.8409871309995651e-03</internalNodes>
+          <leafValues>
+            -4.7127309441566467e-01 -6.4065527915954590e-01
+            1.4861440658569336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 412 4.7200761735439301e-02 -1 -2 413
+            4.9684080295264721e-03</internalNodes>
+          <leafValues>
+            4.1216409206390381e-01 -3.2404300570487976e-01
+            1.5755960345268250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 414 3.7529911845922470e-02 -1 -2 415
+            -1.1665089987218380e-02</internalNodes>
+          <leafValues>
+            4.1328459978103638e-01 2.5467500090599060e-01
+            -3.1303560733795166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 416 -6.8298257247079164e-05 -1 -2 417
+            1.5325429849326611e-02</internalNodes>
+          <leafValues>
+            -2.7212071418762207e-01 2.2946609556674957e-01
+            -6.7345708608627319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 418 8.5185896605253220e-03 -1 -2 419
+            -2.6828479021787643e-03</internalNodes>
+          <leafValues>
+            -7.1114671230316162e-01 1.5511700510978699e-01
+            -3.5444891452789307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 420 1.3791749952360988e-03 -1 -2 421
+            -3.3968368370551616e-05</internalNodes>
+          <leafValues>
+            3.6916270852088928e-01 5.9150930494070053e-02
+            -4.6007719635963440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 422 5.8259358629584312e-03 -1 -2 423
+            -8.1688696518540382e-03</internalNodes>
+          <leafValues>
+            -5.4986697435379028e-01 -5.0567412376403809e-01
+            1.5189670026302338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 424 -2.3251199163496494e-03 -1 -2 425
+            -4.8669208772480488e-03</internalNodes>
+          <leafValues>
+            3.4904810786247253e-01 5.3138560056686401e-01
+            -2.1413469314575195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 426 4.3380381539463997e-03 -1 -2 427
+            3.4176679328083992e-03</internalNodes>
+          <leafValues>
+            -7.8248262405395508e-01 1.2460789829492569e-01
+            -5.5297750234603882e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 428 5.5309730768203735e-01 -1 -2 429
+            2.3636389523744583e-03</internalNodes>
+          <leafValues>
+            4.6573078632354736e-01 -3.3309051394462585e-01
+            9.4380050897598267e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.9697020053863525e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 430 -2.2934280335903168e-02 -1 -2 431
+            -4.2665850371122360e-02</internalNodes>
+          <leafValues>
+            -4.4716298580169678e-01 5.4085898399353027e-01
+            -3.3589279651641846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 432 -9.8418388515710831e-03 -1 -2 433
+            -1.1932349763810635e-02</internalNodes>
+          <leafValues>
+            3.9958000183105469e-01 3.4219118952751160e-01
+            -4.2416951060295105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 434 -2.4437010288238525e-02 -1 -2 435
+            -4.9987169913947582e-03</internalNodes>
+          <leafValues>
+            -3.7337359786033630e-01 4.0358328819274902e-01
+            -3.5199370980262756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 436 1.8582950579002500e-03 -1 -2 437
+            2.7540219016373158e-03</internalNodes>
+          <leafValues>
+            -4.4158118963241577e-01 -2.8722938895225525e-01
+            3.3857241272926331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 438 -3.4452530089765787e-03 -1 -2 439
+            -5.9277489781379700e-03</internalNodes>
+          <leafValues>
+            -3.1821981072425842e-01 -6.5073519945144653e-01
+            2.7109220623970032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 440 -1.2391789641696960e-04 -1 -2 441
+            -7.3327139019966125e-02</internalNodes>
+          <leafValues>
+            -3.3467200398445129e-01 -5.9646248817443848e-01
+            2.2861810028553009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 442 -8.3964750170707703e-02 -1 -2 443
+            -8.1644707825034857e-04</internalNodes>
+          <leafValues>
+            -2.2525189816951752e-01 3.8213649392127991e-01
+            -3.3410450816154480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 444 -1.5207779593765736e-02 -1 -2 445
+            4.6894788742065430e-02</internalNodes>
+          <leafValues>
+            3.0742698907852173e-01 -3.8833889365196228e-01
+            2.3177519440650940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 446 -1.0398440062999725e-01 -1 -2 447
+            3.9815339259803295e-03</internalNodes>
+          <leafValues>
+            7.1321141719818115e-01 -2.3310199379920959e-01
+            2.9247841238975525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 448 2.5737080723047256e-03 -1 -2 449
+            9.1035291552543640e-04</internalNodes>
+          <leafValues>
+            -5.5017340183258057e-01 -1.8228930234909058e-01
+            2.8370320796966553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 450 6.4211348071694374e-03 -1 -2 451
+            -5.8243819512426853e-03</internalNodes>
+          <leafValues>
+            -4.8581978678703308e-01 2.4608190357685089e-01
+            -2.1565020084381104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 452 -4.0043629705905914e-02 -1 -2 453
+            8.4683427121490240e-04</internalNodes>
+          <leafValues>
+            -6.3880550861358643e-01 -6.0435589402914047e-02
+            4.3711128830909729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 454 1.2964580208063126e-02 -1 -2 455
+            -2.2524749510921538e-04</internalNodes>
+          <leafValues>
+            5.9495061635971069e-01 8.6831472814083099e-02
+            -3.6362320184707642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 456 -1.7258729785680771e-03 -1 -2 457
+            -7.2289421223104000e-03</internalNodes>
+          <leafValues>
+            -6.4707720279693604e-01 -6.8775367736816406e-01
+            1.3838720321655273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 458 2.5079259648919106e-03 -1 -2 459
+            -1.9473560387268662e-03</internalNodes>
+          <leafValues>
+            3.0659309029579163e-01 2.2967760264873505e-01
+            -3.4737649559974670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 460 7.4747111648321152e-03 -1 -2 461
+            1.0328400094294921e-04</internalNodes>
+          <leafValues>
+            -6.5191787481307983e-01 -2.0725889503955841e-01
+            2.2402130067348480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 462 -7.8996885567903519e-03 -1 -2 463
+            4.2833909392356873e-03</internalNodes>
+          <leafValues>
+            -7.2479170560836792e-01 1.3954970240592957e-01
+            -4.3086060881614685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 464 6.3452741596847773e-04 -1 -2 465
+            -5.4966621100902557e-03</internalNodes>
+          <leafValues>
+            2.9792639613151550e-01 -5.6205391883850098e-01
+            -2.9608119279146194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 466 3.1408690847456455e-03 -1 -2 467
+            -5.0443639047443867e-03</internalNodes>
+          <leafValues>
+            -6.1322140693664551e-01 -5.3060102462768555e-01
+            1.2507459521293640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 468 4.5964870601892471e-02 -1 -2 469
+            -5.3749699145555496e-03</internalNodes>
+          <leafValues>
+            3.8188719749450684e-01 1.4089010655879974e-01
+            -3.5535690188407898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 470 2.9262059833854437e-03 -1 -2 471
+            5.2230368601158261e-04</internalNodes>
+          <leafValues>
+            -6.0886657238006592e-01 -7.1441568434238434e-02
+            3.6275258660316467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 472 -4.4181118719279766e-03 -1 -2 473
+            4.3349149636924267e-03</internalNodes>
+          <leafValues>
+            -7.6458007097244263e-01 1.1246410012245178e-01
+            -5.4553848505020142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 474 2.6483018882572651e-03 -1 -2 475
+            -1.0814110282808542e-03</internalNodes>
+          <leafValues>
+            2.3542310297489166e-01 1.4422300457954407e-01
+            -3.4401959180831909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 476 -5.4296739108394831e-05 -1 -2 477
+            5.5393581278622150e-03</internalNodes>
+          <leafValues>
+            -2.8607460856437683e-01 1.9345289468765259e-01
+            -5.0549429655075073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 478 3.3703099936246872e-02 -1 -2 479
+            -1.2178930046502501e-04</internalNodes>
+          <leafValues>
+            3.8302558660507202e-01 6.6414177417755127e-02
+            -4.8530051112174988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 480 -1.7803770024329424e-03 -1 -2 481
+            -5.6019638577708974e-05</internalNodes>
+          <leafValues>
+            4.4113549590110779e-01 1.2396749854087830e-01
+            -2.6292270421981812e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>30</maxWeakCount>
+      <stageThreshold>-2.0330519676208496e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 482 3.1982790678739548e-03 -1 -2 483
+            -1.5240450156852603e-03</internalNodes>
+          <leafValues>
+            5.4208421707153320e-01 8.2784838974475861e-02
+            -5.0164830684661865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 484 -1.2284429743885994e-02 -1 -2 485
+            -8.3555448800325394e-03</internalNodes>
+          <leafValues>
+            4.4174939393997192e-01 3.5863399505615234e-01
+            -3.6254858970642090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 486 4.1357800364494324e-02 -1 -2 487
+            2.2308749612420797e-03</internalNodes>
+          <leafValues>
+            4.7858810424804688e-01 -6.0390347242355347e-01
+            -8.7199418339878321e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 488 -5.4160541296005249e-01 -1 -2 489
+            7.9009458422660828e-03</internalNodes>
+          <leafValues>
+            -3.2536658644676208e-01 -3.6415100097656250e-01
+            4.0501600503921509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 490 -2.7236728928983212e-03 -1 -2 491
+            2.1041880827397108e-03</internalNodes>
+          <leafValues>
+            -2.7644181251525879e-01 3.4068119525909424e-01
+            -4.1922488808631897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 492 1.2688159476965666e-03 -1 -2 493
+            -4.2881062254309654e-03</internalNodes>
+          <leafValues>
+            -5.4520767927169800e-01 3.0060088634490967e-01
+            -1.5233190357685089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 494 -4.8890449106693268e-03 -1 -2 495
+            5.0922110676765442e-03</internalNodes>
+          <leafValues>
+            -3.7665820121765137e-01 2.1803319454193115e-01
+            -5.7126522064208984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 496 -7.0944731123745441e-03 -1 -2 497
+            2.5431890040636063e-02</internalNodes>
+          <leafValues>
+            5.1921921968460083e-01 -2.1260249614715576e-01
+            3.0566200613975525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 498 -6.7461907747201622e-05 -1 -2 499
+            -8.5350889712572098e-03</internalNodes>
+          <leafValues>
+            -3.3406749367713928e-01 3.5043460130691528e-01
+            -9.0384833514690399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 500 -4.1117807850241661e-03 -1 -2 501
+            6.3964081928133965e-03</internalNodes>
+          <leafValues>
+            -6.9683700799942017e-01 1.1542639881372452e-01
+            -6.6645371913909912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 502 9.8322751000523567e-04 -1 -2 503
+            -5.5737968068569899e-04</internalNodes>
+          <leafValues>
+            3.5695379972457886e-01 2.3081110417842865e-01
+            -2.8862631320953369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 504 2.8798289131373167e-03 -1 -2 505
+            -7.7164517715573311e-03</internalNodes>
+          <leafValues>
+            -5.9923267364501953e-01 3.6074900627136230e-01
+            -8.1827618181705475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 506 3.7285129074007273e-03 -1 -2 507
+            -1.3161109760403633e-02</internalNodes>
+          <leafValues>
+            -3.7732011079788208e-01 6.7023038864135742e-01
+            1.5114549547433853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 508 -3.8966130465269089e-02 -1 -2 509
+            -5.7413699105381966e-03</internalNodes>
+          <leafValues>
+            -3.1252211332321167e-01 3.3947479724884033e-01
+            -1.6011409461498260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 510 1.2538330256938934e-01 -1 -2 511
+            -9.7243122756481171e-02</internalNodes>
+          <leafValues>
+            7.3721152544021606e-01 5.0288981199264526e-01
+            -1.3284370303153992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 512 -2.0128490868955851e-03 -1 -2 513
+            3.5349070094525814e-03</internalNodes>
+          <leafValues>
+            4.1367891430854797e-01 -1.5923270583152771e-01
+            4.4056579470634460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 514 4.4846540689468384e-01 -1 -2 515
+            -1.0387780144810677e-02</internalNodes>
+          <leafValues>
+            5.9423661231994629e-01 3.0399119853973389e-01
+            -1.8287350237369537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 516 -1.4210389927029610e-03 -1 -2 517
+            3.6446070298552513e-03</internalNodes>
+          <leafValues>
+            -4.5361068844795227e-01 1.5766820311546326e-01
+            -6.2608838081359863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 518 3.2253630924969912e-03 -1 -2 519
+            9.8893349058926105e-04</internalNodes>
+          <leafValues>
+            -4.1410240530967712e-01 -1.0757800191640854e-01
+            3.1156888604164124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 520 -2.7107829228043556e-03 -1 -2 521
+            -6.9264871999621391e-03</internalNodes>
+          <leafValues>
+            -7.5352817773818970e-01 2.7464428544044495e-01
+            -1.1728949844837189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 522 -3.7942770868539810e-02 -1 -2 523
+            1.3486459851264954e-02</internalNodes>
+          <leafValues>
+            2.6936548948287964e-01 -3.1532868742942810e-01
+            2.5785440206527710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 524 2.7866458985954523e-03 -1 -2 525
+            3.2895719632506371e-03</internalNodes>
+          <leafValues>
+            -6.8431657552719116e-01 1.2949100136756897e-01
+            -4.4475141167640686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 526 1.7910100286826491e-03 -1 -2 527
+            3.3694170415401459e-03</internalNodes>
+          <leafValues>
+            -5.6237429380416870e-01 -6.1936769634485245e-02
+            3.6794289946556091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 528 6.5897632157430053e-04 -1 -2 529
+            -3.2603838917566463e-05</internalNodes>
+          <leafValues>
+            -2.7705720067024231e-01 2.7426779270172119e-01
+            -2.2369539737701416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 530 -6.0175720602273941e-02 -1 -2 531
+            -2.1217610687017441e-02</internalNodes>
+          <leafValues>
+            -7.4174910783767700e-01 -4.5034751296043396e-01
+            1.1426000297069550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 532 -2.2632910404354334e-03 -1 -2 533
+            6.0313078574836254e-03</internalNodes>
+          <leafValues>
+            -3.0538588762283325e-01 2.0562660694122314e-01
+            -4.0689799189567566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 534 5.7578482665121555e-04 -1 -2 535
+            -9.3677162658423185e-04</internalNodes>
+          <leafValues>
+            3.5098749399185181e-01 2.1616159379482269e-01
+            -2.4415770173072815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 536 -3.7626568228006363e-02 -1 -2 537
+            4.4729812070727348e-03</internalNodes>
+          <leafValues>
+            -5.9113681316375732e-01 1.5792270004749298e-01
+            -3.2226279377937317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 538 -7.1853301487863064e-03 -1 -2 539
+            4.0520228445529938e-02</internalNodes>
+          <leafValues>
+            -5.9519052505493164e-01 -6.6688463091850281e-02
+            3.4030249714851379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 540 -6.1968388035893440e-03 -1 -2 541
+            1.0311529971659184e-02</internalNodes>
+          <leafValues>
+            -6.7287462949752808e-01 1.0683239996433258e-01
+            -5.4825967550277710e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>-1.9516259431838989e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 542 -1.9320519641041756e-02 -1 -2 543
+            -1.5126460231840611e-02</internalNodes>
+          <leafValues>
+            -3.8712570071220398e-01 6.4468181133270264e-01
+            -1.2727110087871552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 544 -6.0182690620422363e-02 -1 -2 545
+            -1.3576049823313951e-03</internalNodes>
+          <leafValues>
+            -3.0819109082221985e-01 4.8021888732910156e-01
+            -3.3428680896759033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 546 -5.6930771097540855e-03 -1 -2 547
+            -8.0942036584019661e-03</internalNodes>
+          <leafValues>
+            -3.3166080713272095e-01 4.7517481446266174e-01
+            -7.4761562049388885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 548 6.8413332337513566e-04 -1 -2 549
+            -1.1520589888095856e-01</internalNodes>
+          <leafValues>
+            -3.5741969943046570e-01 2.6105090975761414e-01
+            -3.1773808598518372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 550 -9.1124046593904495e-03 -1 -2 551
+            5.4891068430151790e-05</internalNodes>
+          <leafValues>
+            -5.8540707826614380e-01 -2.2981899976730347e-01
+            2.3482909798622131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 552 -9.5622539520263672e-03 -1 -2 553
+            -8.2032606005668640e-03</internalNodes>
+          <leafValues>
+            3.9155280590057373e-01 4.3179950118064880e-01
+            -2.3173290491104126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 554 -4.0035760030150414e-03 -1 -2 555
+            2.5406230706721544e-03</internalNodes>
+          <leafValues>
+            -5.8700478076934814e-01 1.7990030348300934e-01
+            -4.1681569814682007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 556 1.9435470458120108e-03 -1 -2 557
+            8.4362342022359371e-04</internalNodes>
+          <leafValues>
+            3.0340009927749634e-01 -3.0661040544509888e-01
+            2.3646999895572662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 558 -5.3103519603610039e-03 -1 -2 559
+            -3.5526719875633717e-03</internalNodes>
+          <leafValues>
+            -5.6304818391799927e-01 -5.5695772171020508e-01
+            1.5022790431976318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 560 7.1414401754736900e-03 -1 -2 561
+            -1.1435860069468617e-03</internalNodes>
+          <leafValues>
+            -6.7626637220382690e-01 3.7873879075050354e-01
+            -7.4442893266677856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 562 -3.1177429482340813e-03 -1 -2 563
+            -7.7415622770786285e-02</internalNodes>
+          <leafValues>
+            -6.2568587064743042e-01 3.9839410781860352e-01
+            -5.5262319743633270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 564 -3.9252988994121552e-02 -1 -2 565
+            2.2049970924854279e-02</internalNodes>
+          <leafValues>
+            3.4094831347465515e-01 -2.4413719773292542e-01
+            4.3050870299339294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 566 -2.2205871064215899e-03 -1 -2 567
+            2.8649640735238791e-03</internalNodes>
+          <leafValues>
+            2.8309720754623413e-01 -3.5401880741119385e-01
+            2.1054570376873016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 568 5.8806730521610007e-05 -1 -2 569
+            -6.6595021635293961e-03</internalNodes>
+          <leafValues>
+            -2.7014040946960449e-01 -5.9313482046127319e-01
+            2.1892869472503662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 570 1.6931600868701935e-02 -1 -2 571
+            4.7026639804244041e-03</internalNodes>
+          <leafValues>
+            -1.1279620230197906e-01 4.9212211370468140e-01
+            -3.9702880382537842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 572 1.7478819936513901e-03 -1 -2 573
+            -2.0893230102956295e-03</internalNodes>
+          <leafValues>
+            -2.2339369356632233e-01 -4.3157818913459778e-01
+            2.5373139977455139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 574 1.1534850113093853e-02 -1 -2 575
+            8.7350117973983288e-04</internalNodes>
+          <leafValues>
+            -7.0668542385101318e-01 -7.2509132325649261e-02
+            3.9975029230117798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 576 -7.2836421895772219e-04 -1 -2 577
+            1.2666890397667885e-03</internalNodes>
+          <leafValues>
+            -2.3567649722099304e-01 2.2582389414310455e-01
+            -4.2317348718643188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 578 -8.4794021677225828e-04 -1 -2 579
+            3.6212441325187683e-01</internalNodes>
+          <leafValues>
+            -2.8307029604911804e-01 1.6724239289760590e-01
+            -7.6826947927474976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 580 -1.9437649752944708e-03 -1 -2 581
+            -4.1159680113196373e-03</internalNodes>
+          <leafValues>
+            -2.7229419350624084e-01 -6.4211308956146240e-01
+            1.8810230493545532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 582 2.3254039697349072e-03 -1 -2 583
+            -1.4815620379522443e-03</internalNodes>
+          <leafValues>
+            2.8516888618469238e-01 4.2574208974838257e-01
+            -2.1113610267639160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 584 -6.6233296820428222e-05 -1 -2 585
+            -3.3756431192159653e-02</internalNodes>
+          <leafValues>
+            -2.8205850720405579e-01 -8.1803041696548462e-01
+            1.7053669691085815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 586 -9.4350927975028753e-04 -1 -2 587
+            1.0650219628587365e-03</internalNodes>
+          <leafValues>
+            1.5273140370845795e-01 -4.2650490999221802e-01
+            1.5235939621925354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 588 -1.2905279872938991e-03 -1 -2 589
+            9.6549028530716896e-03</internalNodes>
+          <leafValues>
+            1.7365390062332153e-01 -3.9721599221229553e-01
+            1.7953179776668549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 590 1.3434770517051220e-03 -1 -2 591
+            5.5220007197931409e-04</internalNodes>
+          <leafValues>
+            -6.9609320163726807e-01 -7.2258770465850830e-02
+            3.4493291378021240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 592 3.5795350559055805e-03 -1 -2 593
+            -1.0585499927401543e-02</internalNodes>
+          <leafValues>
+            -4.8070669174194336e-01 -3.2975581288337708e-01
+            1.4686919748783112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 594 3.5636040847748518e-03 -1 -2 595
+            -1.0298290103673935e-01</internalNodes>
+          <leafValues>
+            -6.1415022611618042e-01 -7.2366482019424438e-01
+            8.4447070956230164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 596 -2.9605759307742119e-02 -1 -2 597
+            -3.4580599516630173e-02</internalNodes>
+          <leafValues>
+            4.7113609313964844e-01 -4.3128991127014160e-01
+            2.4623470380902290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 598 4.7923368401825428e-03 -1 -2 599
+            1.7058040248230100e-03</internalNodes>
+          <leafValues>
+            -4.6270799636840820e-01 1.4738570153713226e-01
+            -3.7818890810012817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 600 -3.3174119889736176e-03 -1 -2 601
+            -1.7022279789671302e-03</internalNodes>
+          <leafValues>
+            2.7929860353469849e-01 2.6326990127563477e-01
+            -2.5129210948944092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 602 -8.1695342669263482e-04 -1 -2 603
+            -1.4184829778969288e-03</internalNodes>
+          <leafValues>
+            -1.2859649956226349e-01 5.8855402469635010e-01
+            -5.0085168331861496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 604 -1.0478599928319454e-02 -1 -2 605
+            3.1981911510229111e-02</internalNodes>
+          <leafValues>
+            1.4732900261878967e-01 -4.1299548745155334e-01
+            3.4442049264907837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 606 4.5543849468231201e-02 -1 -2 607
+            2.3574009537696838e-02</internalNodes>
+          <leafValues>
+            4.8842081427574158e-01 -4.6383219957351685e-01
+            3.7443768233060837e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>29</maxWeakCount>
+      <stageThreshold>-1.7628519535064697e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 608 -3.2347131520509720e-02 -1 -2 609
+            -7.4855431914329529e-02</internalNodes>
+          <leafValues>
+            -4.1153168678283691e-01 5.4409480094909668e-01
+            -2.1043080091476440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 610 -5.9164799749851227e-02 -1 -2 611
+            -5.0734709948301315e-03</internalNodes>
+          <leafValues>
+            4.6945521235466003e-01 8.0933347344398499e-02
+            -4.0436869859695435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 612 6.6304411739110947e-03 -1 -2 613
+            2.2804280743002892e-02</internalNodes>
+          <leafValues>
+            -3.1943950057029724e-01 -3.5277611017227173e-01
+            3.6358159780502319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 614 3.4148059785366058e-03 -1 -2 615
+            -6.0696629807353020e-03</internalNodes>
+          <leafValues>
+            -4.2139899730682373e-01 2.8190940618515015e-01
+            -2.5727981328964233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 616 -3.3271780703216791e-03 -1 -2 617
+            1.2381239794194698e-02</internalNodes>
+          <leafValues>
+            -3.3380180597305298e-01 2.5831120088696480e-02
+            5.8200639486312866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 618 -7.8561902046203613e-02 -1 -2 619
+            -7.6863910071551800e-03</internalNodes>
+          <leafValues>
+            5.7080817222595215e-01 1.9097380340099335e-01
+            -2.4749469757080078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 620 3.9404830895364285e-03 -1 -2 621
+            -7.0624810177832842e-05</internalNodes>
+          <leafValues>
+            -3.5295888781547546e-01 2.8438061475753784e-01
+            -1.6469420492649078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 622 -2.2568539716303349e-03 -1 -2 623
+            -3.5595949739217758e-03</internalNodes>
+          <leafValues>
+            -4.6189218759536743e-01 2.4525940418243408e-01
+            -1.8984979391098022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 624 -3.0113100074231625e-03 -1 -2 625
+            -6.2748990021646023e-03</internalNodes>
+          <leafValues>
+            3.0594390630722046e-01 1.4716149866580963e-01
+            -3.3265221118927002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 626 2.5835279375314713e-03 -1 -2 627
+            3.2576550729572773e-03</internalNodes>
+          <leafValues>
+            -7.4853891134262085e-01 -1.4949619770050049e-01
+            2.6293671131134033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 628 -2.6957978843711317e-04 -1 -2 629
+            -4.4593680649995804e-03</internalNodes>
+          <leafValues>
+            -2.9468360543251038e-01 -4.5905289053916931e-01
+            2.2235380113124847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 630 2.2841650061309338e-03 -1 -2 631
+            -6.7595718428492546e-04</internalNodes>
+          <leafValues>
+            -6.3815939426422119e-01 -3.1756940484046936e-01
+            1.4903070032596588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 632 6.1428439803421497e-03 -1 -2 633
+            2.7392068877816200e-03</internalNodes>
+          <leafValues>
+            2.4187029898166656e-01 -3.1487539410591125e-01
+            2.3589129745960236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 634 -2.0209311041980982e-03 -1 -2 635
+            2.6892140507698059e-02</internalNodes>
+          <leafValues>
+            2.5389561057090759e-01 -3.4391039609909058e-01
+            2.3010760545730591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 636 1.4671060256659985e-02 -1 -2 637
+            -1.2444119900465012e-02</internalNodes>
+          <leafValues>
+            5.9517538547515869e-01 3.7335929274559021e-01
+            -1.4540639519691467e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 638 2.0527220331132412e-03 -1 -2 639
+            -1.7088990658521652e-02</internalNodes>
+          <leafValues>
+            -2.1135020256042480e-01 -7.2516232728958130e-01
+            2.3358739912509918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 640 -9.8585523664951324e-03 -1 -2 641
+            -1.0541190393269062e-02</internalNodes>
+          <leafValues>
+            4.5390421152114868e-01 3.5500058531761169e-01
+            -1.7118500173091888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 642 4.0034228004515171e-03 -1 -2 643
+            -1.1889140121638775e-02</internalNodes>
+          <leafValues>
+            -7.0433962345123291e-01 4.0436559915542603e-01
+            -4.6263620257377625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 644 -2.0685700699687004e-02 -1 -2 645
+            -7.9243928194046021e-03</internalNodes>
+          <leafValues>
+            -6.4347600936889648e-01 -5.3632920980453491e-01
+            1.1002989858388901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 646 1.2431150535121560e-03 -1 -2 647
+            -4.2312019504606724e-03</internalNodes>
+          <leafValues>
+            4.1220021247863770e-01 7.9887658357620239e-02
+            -3.0926740169525146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 648 9.8197339102625847e-03 -1 -2 649
+            4.5455411076545715e-02</internalNodes>
+          <leafValues>
+            -6.0976761579513550e-01 1.0621140152215958e-01
+            -6.4687371253967285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 650 2.6892758905887604e-03 -1 -2 651
+            -1.5172710409387946e-03</internalNodes>
+          <leafValues>
+            -4.9122989177703857e-01 1.7578749358654022e-01
+            -2.6818940043449402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 652 6.2014168361201882e-04 -1 -2 653
+            -2.0233519899193197e-04</internalNodes>
+          <leafValues>
+            2.5500729680061340e-01 7.2745857760310173e-03
+            -5.0815272331237793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 654 3.1760020647197962e-03 -1 -2 655
+            -1.2668699491769075e-03</internalNodes>
+          <leafValues>
+            4.3849268555641174e-01 1.6349400579929352e-01
+            -2.9128161072731018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 656 5.1056100055575371e-03 -1 -2 657
+            -1.5026510227471590e-03</internalNodes>
+          <leafValues>
+            -7.5001358985900879e-01 2.7198830246925354e-01
+            -9.9486798048019409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 658 -3.6238620523363352e-03 -1 -2 659
+            7.6577658765017986e-03</internalNodes>
+          <leafValues>
+            -6.0396248102188110e-01 1.0938379913568497e-01
+            -5.3007638454437256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 660 -3.1830249354243279e-03 -1 -2 661
+            1.0931329801678658e-02</internalNodes>
+          <leafValues>
+            -4.7724890708923340e-01 -4.3065819889307022e-02
+            3.8945859670639038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 662 -1.0047679534181952e-03 -1 -2 663
+            -4.6660430729389191e-02</internalNodes>
+          <leafValues>
+            4.1553598642349243e-01 3.0159878730773926e-01
+            -1.6184380650520325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 664 3.2002381049096584e-03 -1 -2 665
+            -1.7367519903928041e-03</internalNodes>
+          <leafValues>
+            -5.4621779918670654e-01 -2.1987779438495636e-01
+            1.9606420397758484e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>-1.8088439702987671e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 666 1.7160519957542419e-02 -1 -2 667
+            1.4503560028970242e-02</internalNodes>
+          <leafValues>
+            -3.2273009419441223e-01 -3.9438620209693909e-01
+            5.7922977209091187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 668 -9.0323518961668015e-03 -1 -2 669
+            -6.9836131297051907e-03</internalNodes>
+          <leafValues>
+            -4.1536870598793030e-01 3.5515859723091125e-01
+            -3.8177150487899780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 670 -1.9220909103751183e-02 -1 -2 671
+            -4.0087159723043442e-02</internalNodes>
+          <leafValues>
+            4.5315900444984436e-01 1.7228379845619202e-01
+            -3.1110560894012451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 672 5.6549701839685440e-03 -1 -2 673
+            -1.1611269786953926e-02</internalNodes>
+          <leafValues>
+            -4.0461608767509460e-01 2.9034239053726196e-01
+            -2.2078509628772736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 674 -1.0576159693300724e-03 -1 -2 675
+            -1.3360800221562386e-03</internalNodes>
+          <leafValues>
+            3.5851669311523438e-01 1.5968900173902512e-02
+            -4.1990101337432861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 676 5.2302791737020016e-03 -1 -2 677
+            -2.7848479803651571e-03</internalNodes>
+          <leafValues>
+            -4.9663281440734863e-01 -5.2960211038589478e-01
+            1.5535449981689453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 678 -2.5654129683971405e-02 -1 -2 679
+            -6.8942131474614143e-03</internalNodes>
+          <leafValues>
+            -5.9309178590774536e-01 2.4318109452724457e-01
+            -1.8231940269470215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 680 -6.9622750743292272e-05 -1 -2 681
+            -6.4154611900448799e-03</internalNodes>
+          <leafValues>
+            -3.2716289162635803e-01 -5.0821667909622192e-01
+            1.9543349742889404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 682 -6.7164386564400047e-05 -1 -2 683
+            2.2416690364480019e-02</internalNodes>
+          <leafValues>
+            1.8602199852466583e-01 -3.9281991124153137e-01
+            1.3279129564762115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 684 8.4287580102682114e-03 -1 -2 685
+            -8.7357551092281938e-04</internalNodes>
+          <leafValues>
+            -5.5447560548782349e-01 4.7158730030059814e-01
+            -3.8492478430271149e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 686 -4.7496971092186868e-05 -1 -2 687
+            4.5816078782081604e-03</internalNodes>
+          <leafValues>
+            -2.5197029113769531e-01 2.0250399410724640e-01
+            -6.1638081073760986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 688 -1.1175150051712990e-02 -1 -2 689
+            -7.4238609522581100e-03</internalNodes>
+          <leafValues>
+            -2.7771198749542236e-01 -5.0103437900543213e-01
+            1.9318529963493347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 690 -3.0201480258256197e-03 -1 -2 691
+            -3.0343679245561361e-03</internalNodes>
+          <leafValues>
+            -6.5904247760772705e-01 3.1962481141090393e-01
+            -1.0512910038232803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 692 -1.0971290059387684e-02 -1 -2 693
+            1.2000739661743864e-04</internalNodes>
+          <leafValues>
+            3.2707008719444275e-01 -4.1679269075393677e-01
+            1.1645200103521347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 694 2.1552699618041515e-03 -1 -2 695
+            1.5970800304785371e-03</internalNodes>
+          <leafValues>
+            1.5389390289783478e-01 -4.2979270219802856e-01
+            1.9192950427532196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 696 -4.3590939603745937e-03 -1 -2 697
+            -6.5752048976719379e-03</internalNodes>
+          <leafValues>
+            -8.6613738536834717e-01 3.5298541188240051e-01
+            -7.2624720633029938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 698 3.5486191045492887e-03 -1 -2 699
+            1.7437560018151999e-03</internalNodes>
+          <leafValues>
+            -3.6141040921211243e-01 -4.0250919759273529e-02
+            4.1119590401649475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 700 6.5892767452169210e-05 -1 -2 701
+            1.2217169627547264e-02</internalNodes>
+          <leafValues>
+            1.5523989498615265e-01 -3.6567229032516479e-01
+            2.5159689784049988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 702 6.0199309140443802e-02 -1 -2 703
+            -9.1684371232986450e-02</internalNodes>
+          <leafValues>
+            -6.8959599733352661e-01 -6.6311872005462646e-01
+            9.4827361404895782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 704 8.9392811059951782e-04 -1 -2 705
+            -1.1146500473842025e-03</internalNodes>
+          <leafValues>
+            2.8731009364128113e-01 3.6127060651779175e-01
+            -2.4054229259490967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 706 -1.1042780242860317e-02 -1 -2 707
+            3.7769351154565811e-02</internalNodes>
+          <leafValues>
+            -7.1686691045761108e-01 1.1125349998474121e-01
+            -5.6320947408676147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 708 5.5979429744184017e-03 -1 -2 709
+            -2.5462140329182148e-03</internalNodes>
+          <leafValues>
+            -5.6998908519744873e-01 2.6734578609466553e-01
+            -1.0527700185775757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 710 -1.7929819878190756e-03 -1 -2 711
+            -8.9686378487385809e-05</internalNodes>
+          <leafValues>
+            1.7712120711803436e-01 1.6762410104274750e-01
+            -4.1336658596992493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 712 -6.8254990037530661e-04 -1 -2 713
+            4.0599349886178970e-03</internalNodes>
+          <leafValues>
+            -3.1327050924301147e-01 2.0312629640102386e-01
+            -4.6360948681831360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 714 1.5843180008232594e-03 -1 -2 715
+            -4.6101640909910202e-02</internalNodes>
+          <leafValues>
+            2.6413089036941528e-01 2.4587640166282654e-01
+            -3.1151199340820312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 716 1.5759950038045645e-03 -1 -2 717
+            3.5904631018638611e-02</internalNodes>
+          <leafValues>
+            -3.6593970656394958e-01 -1.3352620415389538e-02
+            4.9500739574432373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 718 1.9230529665946960e-02 -1 -2 719
+            1.3461830094456673e-02</internalNodes>
+          <leafValues>
+            1.8603560328483582e-01 -4.2704311013221741e-01
+            1.4756950736045837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 720 6.3534970395267010e-03 -1 -2 721
+            4.7998740337789059e-03</internalNodes>
+          <leafValues>
+            -5.8824592828750610e-01 1.3966129720211029e-01
+            -3.6948320269584656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 722 -9.7894563805311918e-04 -1 -2 723
+            1.8534340197220445e-03</internalNodes>
+          <leafValues>
+            4.3156591057777405e-01 -1.9053110480308533e-01
+            2.6868799328804016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 724 5.5962381884455681e-04 -1 -2 725
+            -8.1787789240479469e-03</internalNodes>
+          <leafValues>
+            -3.0545750260353088e-01 -7.2353351116180420e-01
+            1.6197769343852997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 726 -6.4591833506710827e-05 -1 -2 727
+            -4.2282380163669586e-03</internalNodes>
+          <leafValues>
+            -1.6121749579906464e-01 4.2441681027412415e-01
+            -1.1488209664821625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 728 -3.2379399053752422e-03 -1 -2 729
+            -4.7763898037374020e-03</internalNodes>
+          <leafValues>
+            -8.2811427116394043e-01 3.9157009124755859e-01
+            -3.7677429616451263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 730 -6.1182728968560696e-03 -1 -2 731
+            3.1565790995955467e-03</internalNodes>
+          <leafValues>
+            3.0208829045295715e-01 -1.9045789539813995e-01
+            3.0219689011573792e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          8 12 3 8 -1.</_>
+        <_>
+          8 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 9 -1.</_>
+        <_>
+          7 11 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 11 12 -1.</_>
+        <_>
+          8 11 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 7 8 -1.</_>
+        <_>
+          1 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 6 -1.</_>
+        <_>
+          7 9 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 7 4 -1.</_>
+        <_>
+          0 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 4 4 -1.</_>
+        <_>
+          18 13 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 2 3 -1.</_>
+        <_>
+          17 15 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 2 -1.</_>
+        <_>
+          2 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 6 -1.</_>
+        <_>
+          7 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 12 -1.</_>
+        <_>
+          8 11 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 10 -1.</_>
+        <_>
+          5 6 2 5 2.</_>
+        <_>
+          7 11 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 11 8 -1.</_>
+        <_>
+          8 16 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 8 -1.</_>
+        <_>
+          0 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 6 -1.</_>
+        <_>
+          3 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 6 -1.</_>
+        <_>
+          14 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 9 7 -1.</_>
+        <_>
+          8 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 3 -1.</_>
+        <_>
+          8 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 4 -1.</_>
+        <_>
+          0 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 3 -1.</_>
+        <_>
+          2 1 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 6 2 -1.</_>
+        <_>
+          3 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 4 2 -1.</_>
+        <_>
+          8 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 12 2 -1.</_>
+        <_>
+          6 11 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 1 -1.</_>
+        <_>
+          16 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 12 -1.</_>
+        <_>
+          8 11 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 1 6 -1.</_>
+        <_>
+          16 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 5 6 -1.</_>
+        <_>
+          7 9 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 6 -1.</_>
+        <_>
+          18 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 8 -1.</_>
+        <_>
+          0 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 15 12 -1.</_>
+        <_>
+          3 5 15 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 8 -1.</_>
+        <_>
+          11 16 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 9 -1.</_>
+        <_>
+          4 0 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 4 -1.</_>
+        <_>
+          2 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 4 2 -1.</_>
+        <_>
+          11 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 3 -1.</_>
+        <_>
+          6 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 3 2 -1.</_>
+        <_>
+          13 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 8 -1.</_>
+        <_>
+          1 0 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 4 2 -1.</_>
+        <_>
+          5 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 6 6 -1.</_>
+        <_>
+          17 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 4 -1.</_>
+        <_>
+          8 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 4 9 -1.</_>
+        <_>
+          9 9 4 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 8 -1.</_>
+        <_>
+          5 8 2 4 2.</_>
+        <_>
+          7 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 11 8 -1.</_>
+        <_>
+          8 16 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 6 -1.</_>
+        <_>
+          3 3 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 12 -1.</_>
+        <_>
+          7 4 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 7 2 -1.</_>
+        <_>
+          0 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 3 -1.</_>
+        <_>
+          18 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 1 -1.</_>
+        <_>
+          5 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 2 -1.</_>
+        <_>
+          3 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 19 4 -1.</_>
+        <_>
+          0 18 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 8 2 -1.</_>
+        <_>
+          11 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 1 -1.</_>
+        <_>
+          9 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 4 -1.</_>
+        <_>
+          0 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 4 -1.</_>
+        <_>
+          0 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 5 2 -1.</_>
+        <_>
+          15 16 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 8 -1.</_>
+        <_>
+          11 9 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 8 -1.</_>
+        <_>
+          15 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 6 -1.</_>
+        <_>
+          2 3 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 15 -1.</_>
+        <_>
+          6 10 6 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 12 6 -1.</_>
+        <_>
+          7 13 4 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 7 -1.</_>
+        <_>
+          18 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 2 -1.</_>
+        <_>
+          9 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 3 -1.</_>
+        <_>
+          9 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 6 -1.</_>
+        <_>
+          2 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 4 4 -1.</_>
+        <_>
+          5 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 6 -1.</_>
+        <_>
+          4 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          2 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 3 -1.</_>
+        <_>
+          6 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 6 -1.</_>
+        <_>
+          9 3 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 2 -1.</_>
+        <_>
+          10 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 7 6 -1.</_>
+        <_>
+          4 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 10 2 -1.</_>
+        <_>
+          15 18 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 1 -1.</_>
+        <_>
+          9 13 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 6 -1.</_>
+        <_>
+          8 10 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 8 -1.</_>
+        <_>
+          14 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 4 -1.</_>
+        <_>
+          12 10 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 3 -1.</_>
+        <_>
+          2 12 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 2 6 -1.</_>
+        <_>
+          19 11 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 10 -1.</_>
+        <_>
+          0 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 12 -1.</_>
+        <_>
+          7 4 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 9 8 -1.</_>
+        <_>
+          4 3 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 12 -1.</_>
+        <_>
+          14 12 2 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 6 -1.</_>
+        <_>
+          4 4 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 8 -1.</_>
+        <_>
+          3 4 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 20 -1.</_>
+        <_>
+          0 5 17 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 6 -1.</_>
+        <_>
+          4 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 6 -1.</_>
+        <_>
+          3 10 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 4 -1.</_>
+        <_>
+          4 14 3 2 2.</_>
+        <_>
+          7 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 8 -1.</_>
+        <_>
+          10 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 6 -1.</_>
+        <_>
+          1 1 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 8 4 -1.</_>
+        <_>
+          5 4 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 5 -1.</_>
+        <_>
+          1 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 8 2 -1.</_>
+        <_>
+          7 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 9 8 -1.</_>
+        <_>
+          11 11 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 3 -1.</_>
+        <_>
+          18 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 6 -1.</_>
+        <_>
+          16 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 3 -1.</_>
+        <_>
+          2 12 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 7 6 -1.</_>
+        <_>
+          6 8 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 6 -1.</_>
+        <_>
+          0 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 5 -1.</_>
+        <_>
+          5 2 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 10 3 -1.</_>
+        <_>
+          13 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 8 -1.</_>
+        <_>
+          8 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 6 -1.</_>
+        <_>
+          1 1 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 4 -1.</_>
+        <_>
+          1 1 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 1 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 7 15 -1.</_>
+        <_>
+          5 5 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 2 -1.</_>
+        <_>
+          18 1 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 6 2 -1.</_>
+        <_>
+          6 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 5 -1.</_>
+        <_>
+          7 1 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 8 -1.</_>
+        <_>
+          14 0 3 4 2.</_>
+        <_>
+          17 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 18 -1.</_>
+        <_>
+          5 2 2 9 2.</_>
+        <_>
+          7 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 2 -1.</_>
+        <_>
+          9 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 3 -1.</_>
+        <_>
+          10 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 2 -1.</_>
+        <_>
+          10 10 2 1 2.</_>
+        <_>
+          12 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 6 -1.</_>
+        <_>
+          4 4 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 8 -1.</_>
+        <_>
+          5 3 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 4 2 -1.</_>
+        <_>
+          2 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 8 1 -1.</_>
+        <_>
+          4 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          8 11 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 6 -1.</_>
+        <_>
+          18 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 8 -1.</_>
+        <_>
+          0 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 5 6 -1.</_>
+        <_>
+          15 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 9 -1.</_>
+        <_>
+          2 7 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 1 -1.</_>
+        <_>
+          16 12 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 8 2 -1.</_>
+        <_>
+          15 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 11 -1.</_>
+        <_>
+          3 1 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 4 -1.</_>
+        <_>
+          7 9 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 3 -1.</_>
+        <_>
+          8 17 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 4 -1.</_>
+        <_>
+          0 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 1 3 -1.</_>
+        <_>
+          2 2 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 2 3 -1.</_>
+        <_>
+          18 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 8 -1.</_>
+        <_>
+          3 12 1 4 2.</_>
+        <_>
+          4 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 3 -1.</_>
+        <_>
+          4 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 2 -1.</_>
+        <_>
+          12 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 3 -1.</_>
+        <_>
+          17 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 5 2 -1.</_>
+        <_>
+          7 15 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 5 -1.</_>
+        <_>
+          6 0 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 5 8 -1.</_>
+        <_>
+          6 5 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 8 -1.</_>
+        <_>
+          3 5 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 15 6 -1.</_>
+        <_>
+          7 14 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 5 -1.</_>
+        <_>
+          14 3 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 2 -1.</_>
+        <_>
+          5 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 2 -1.</_>
+        <_>
+          5 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 4 -1.</_>
+        <_>
+          11 10 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          4 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 12 -1.</_>
+        <_>
+          15 12 2 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 10 -1.</_>
+        <_>
+          0 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 4 -1.</_>
+        <_>
+          2 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 6 -1.</_>
+        <_>
+          5 7 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 16 4 -1.</_>
+        <_>
+          3 3 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 10 9 -1.</_>
+        <_>
+          6 5 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 10 -1.</_>
+        <_>
+          17 10 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 4 3 -1.</_>
+        <_>
+          6 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 9 -1.</_>
+        <_>
+          1 0 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 2 -1.</_>
+        <_>
+          2 6 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 3 -1.</_>
+        <_>
+          9 16 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 6 2 -1.</_>
+        <_>
+          9 17 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 6 -1.</_>
+        <_>
+          4 5 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 3 -1.</_>
+        <_>
+          7 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 4 -1.</_>
+        <_>
+          4 1 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 4 2 -1.</_>
+        <_>
+          13 11 2 1 2.</_>
+        <_>
+          15 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          14 10 1 1 2.</_>
+        <_>
+          15 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 3 -1.</_>
+        <_>
+          18 8 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 2 -1.</_>
+        <_>
+          18 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 2 -1.</_>
+        <_>
+          0 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 2 5 -1.</_>
+        <_>
+          11 1 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 3 12 -1.</_>
+        <_>
+          1 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 2 -1.</_>
+        <_>
+          2 10 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          7 13 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 4 -1.</_>
+        <_>
+          7 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 4 2 -1.</_>
+        <_>
+          6 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 20 1 -1.</_>
+        <_>
+          10 19 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 5 -1.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 9 -1.</_>
+        <_>
+          10 11 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 2 -1.</_>
+        <_>
+          2 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 1 -1.</_>
+        <_>
+          18 14 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 2 2 4 -1.</_>
+        <_>
+          2 2 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 5 -1.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 5 4 -1.</_>
+        <_>
+          7 15 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 3 2 -1.</_>
+        <_>
+          17 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 2 -1.</_>
+        <_>
+          0 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 1 3 -1.</_>
+        <_>
+          2 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 4 -1.</_>
+        <_>
+          11 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 8 -1.</_>
+        <_>
+          16 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 9 6 -1.</_>
+        <_>
+          2 5 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 17 8 -1.</_>
+        <_>
+          0 6 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 5 3 -1.</_>
+        <_>
+          15 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 2 8 -1.</_>
+        <_>
+          2 15 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 3 -1.</_>
+        <_>
+          4 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 9 7 -1.</_>
+        <_>
+          6 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 7 -1.</_>
+        <_>
+          14 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 2 2 -1.</_>
+        <_>
+          3 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 1 -1.</_>
+        <_>
+          3 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 6 -1.</_>
+        <_>
+          4 9 3 3 2.</_>
+        <_>
+          7 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 1 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 3 -1.</_>
+        <_>
+          5 0 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 1 -1.</_>
+        <_>
+          18 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 9 -1.</_>
+        <_>
+          4 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 4 -1.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 1 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 1 -1.</_>
+        <_>
+          17 2 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 8 2 -1.</_>
+        <_>
+          7 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 3 8 -1.</_>
+        <_>
+          15 16 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 3 -1.</_>
+        <_>
+          5 11 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 9 -1.</_>
+        <_>
+          5 3 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 2 -1.</_>
+        <_>
+          19 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 9 8 -1.</_>
+        <_>
+          4 3 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 3 -1.</_>
+        <_>
+          2 7 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 3 -1.</_>
+        <_>
+          2 7 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 1 12 -1.</_>
+        <_>
+          13 11 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 15 -1.</_>
+        <_>
+          0 5 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 3 -1.</_>
+        <_>
+          6 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 3 2 -1.</_>
+        <_>
+          3 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 4 3 -1.</_>
+        <_>
+          16 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          11 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 3 -1.</_>
+        <_>
+          14 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 3 2 -1.</_>
+        <_>
+          5 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 2 -1.</_>
+        <_>
+          1 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 5 -1.</_>
+        <_>
+          5 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 3 8 -1.</_>
+        <_>
+          1 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 1 3 -1.</_>
+        <_>
+          4 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 1 -1.</_>
+        <_>
+          5 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 4 9 -1.</_>
+        <_>
+          11 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 2 -1.</_>
+        <_>
+          0 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 3 -1.</_>
+        <_>
+          0 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 4 -1.</_>
+        <_>
+          12 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 3 -1.</_>
+        <_>
+          15 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 12 1 6 -1.</_>
+        <_>
+          18 12 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 17 3 2 -1.</_>
+        <_>
+          5 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 2 -1.</_>
+        <_>
+          18 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 1 -1.</_>
+        <_>
+          18 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 5 -1.</_>
+        <_>
+          9 12 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 2 7 -1.</_>
+        <_>
+          8 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 14 6 -1.</_>
+        <_>
+          4 6 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 11 6 -1.</_>
+        <_>
+          2 5 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 2 -1.</_>
+        <_>
+          18 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 6 -1.</_>
+        <_>
+          18 11 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 3 -1.</_>
+        <_>
+          18 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 6 -1.</_>
+        <_>
+          18 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 8 -1.</_>
+        <_>
+          4 7 3 4 2.</_>
+        <_>
+          7 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 2 -1.</_>
+        <_>
+          11 11 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 7 -1.</_>
+        <_>
+          3 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 8 -1.</_>
+        <_>
+          15 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 8 -1.</_>
+        <_>
+          3 10 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 6 -1.</_>
+        <_>
+          7 9 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 6 -1.</_>
+        <_>
+          4 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 2 -1.</_>
+        <_>
+          4 1 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 6 -1.</_>
+        <_>
+          14 8 3 3 2.</_>
+        <_>
+          17 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 8 -1.</_>
+        <_>
+          4 12 1 4 2.</_>
+        <_>
+          5 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 7 2 -1.</_>
+        <_>
+          0 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 1 4 -1.</_>
+        <_>
+          9 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 8 -1.</_>
+        <_>
+          19 10 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 8 -1.</_>
+        <_>
+          7 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 6 -1.</_>
+        <_>
+          3 2 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 8 2 -1.</_>
+        <_>
+          10 10 4 1 2.</_>
+        <_>
+          14 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 2 3 -1.</_>
+        <_>
+          2 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 13 6 -1.</_>
+        <_>
+          5 3 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 13 6 -1.</_>
+        <_>
+          4 6 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 5 -1.</_>
+        <_>
+          8 1 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 1 -1.</_>
+        <_>
+          8 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 4 -1.</_>
+        <_>
+          6 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 2 -1.</_>
+        <_>
+          14 12 2 1 2.</_>
+        <_>
+          16 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 4 2 -1.</_>
+        <_>
+          13 11 2 1 2.</_>
+        <_>
+          15 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 3 -1.</_>
+        <_>
+          16 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 5 -1.</_>
+        <_>
+          11 0 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 1 3 -1.</_>
+        <_>
+          7 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 2 -1.</_>
+        <_>
+          7 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 2 3 -1.</_>
+        <_>
+          17 8 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 5 -1.</_>
+        <_>
+          13 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 3 -1.</_>
+        <_>
+          0 1 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 2 -1.</_>
+        <_>
+          2 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 2 -1.</_>
+        <_>
+          13 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 3 -1.</_>
+        <_>
+          18 9 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 1 3 -1.</_>
+        <_>
+          14 16 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 2 -1.</_>
+        <_>
+          8 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 4 -1.</_>
+        <_>
+          9 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 19 -1.</_>
+        <_>
+          13 0 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 8 4 -1.</_>
+        <_>
+          12 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 2 -1.</_>
+        <_>
+          14 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 4 -1.</_>
+        <_>
+          12 10 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          4 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 7 -1.</_>
+        <_>
+          3 2 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 2 -1.</_>
+        <_>
+          8 0 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 6 -1.</_>
+        <_>
+          15 13 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 10 4 -1.</_>
+        <_>
+          12 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 4 5 -1.</_>
+        <_>
+          2 11 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 4 2 -1.</_>
+        <_>
+          3 15 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 6 -1.</_>
+        <_>
+          0 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 6 -1.</_>
+        <_>
+          6 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 4 2 -1.</_>
+        <_>
+          7 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 4 2 -1.</_>
+        <_>
+          7 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 7 4 -1.</_>
+        <_>
+          3 5 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 12 -1.</_>
+        <_>
+          7 8 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 1 -1.</_>
+        <_>
+          5 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 2 1 -1.</_>
+        <_>
+          5 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 7 2 -1.</_>
+        <_>
+          13 17 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 2 3 -1.</_>
+        <_>
+          7 15 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 5 -1.</_>
+        <_>
+          10 2 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 6 -1.</_>
+        <_>
+          8 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 3 -1.</_>
+        <_>
+          4 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          6 13 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 2 -1.</_>
+        <_>
+          5 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 1 -1.</_>
+        <_>
+          11 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 3 -1.</_>
+        <_>
+          12 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 10 -1.</_>
+        <_>
+          19 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 3 -1.</_>
+        <_>
+          3 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 5 -1.</_>
+        <_>
+          9 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 2 -1.</_>
+        <_>
+          5 0 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 13 9 -1.</_>
+        <_>
+          5 3 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 2 -1.</_>
+        <_>
+          0 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 6 -1.</_>
+        <_>
+          1 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 4 -1.</_>
+        <_>
+          18 0 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 2 -1.</_>
+        <_>
+          4 13 1 1 2.</_>
+        <_>
+          5 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 4 1 -1.</_>
+        <_>
+          2 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 12 -1.</_>
+        <_>
+          3 6 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 1 -1.</_>
+        <_>
+          13 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 3 1 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 8 4 -1.</_>
+        <_>
+          3 13 4 2 2.</_>
+        <_>
+          7 15 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 3 -1.</_>
+        <_>
+          6 9 6 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 5 -1.</_>
+        <_>
+          11 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 9 1 -1.</_>
+        <_>
+          8 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 4 -1.</_>
+        <_>
+          4 0 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 8 -1.</_>
+        <_>
+          7 11 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 15 2 1 -1.</_>
+        <_>
+          18 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 4 -1.</_>
+        <_>
+          3 13 1 2 2.</_>
+        <_>
+          4 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 3 -1.</_>
+        <_>
+          3 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 7 -1.</_>
+        <_>
+          1 1 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 9 -1.</_>
+        <_>
+          5 0 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 3 -1.</_>
+        <_>
+          14 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 4 -1.</_>
+        <_>
+          0 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          12 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 2 2 -1.</_>
+        <_>
+          17 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 2 -1.</_>
+        <_>
+          17 11 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 13 10 1 -1.</_>
+        <_>
+          12 13 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 3 -1.</_>
+        <_>
+          9 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 6 2 -1.</_>
+        <_>
+          11 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 6 2 -1.</_>
+        <_>
+          10 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 1 -1.</_>
+        <_>
+          18 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 2 11 -1.</_>
+        <_>
+          18 7 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 4 -1.</_>
+        <_>
+          8 2 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 3 -1.</_>
+        <_>
+          7 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 5 -1.</_>
+        <_>
+          10 3 3 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 9 -1.</_>
+        <_>
+          6 3 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 4 3 -1.</_>
+        <_>
+          3 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 5 -1.</_>
+        <_>
+          1 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 3 -1.</_>
+        <_>
+          2 3 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 1 -1.</_>
+        <_>
+          4 13 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 6 -1.</_>
+        <_>
+          6 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 2 1 -1.</_>
+        <_>
+          2 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 1 3 -1.</_>
+        <_>
+          3 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 9 -1.</_>
+        <_>
+          2 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 2 -1.</_>
+        <_>
+          16 7 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 4 -1.</_>
+        <_>
+          9 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 6 2 -1.</_>
+        <_>
+          9 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 4 -1.</_>
+        <_>
+          3 14 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 7 3 -1.</_>
+        <_>
+          5 9 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 1 -1.</_>
+        <_>
+          15 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 2 -1.</_>
+        <_>
+          5 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          6 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 2 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 1 -1.</_>
+        <_>
+          17 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 3 -1.</_>
+        <_>
+          18 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 8 -1.</_>
+        <_>
+          13 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 2 -1.</_>
+        <_>
+          8 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          16 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 4 -1.</_>
+        <_>
+          8 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 1 6 -1.</_>
+        <_>
+          12 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 4 -1.</_>
+        <_>
+          4 0 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 11 12 -1.</_>
+        <_>
+          5 5 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 8 -1.</_>
+        <_>
+          18 12 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 6 -1.</_>
+        <_>
+          18 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 4 -1.</_>
+        <_>
+          2 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 4 -1.</_>
+        <_>
+          5 8 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 2 -1.</_>
+        <_>
+          6 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 1 -1.</_>
+        <_>
+          7 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 2 -1.</_>
+        <_>
+          10 14 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 3 -1.</_>
+        <_>
+          3 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 8 -1.</_>
+        <_>
+          4 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 3 -1.</_>
+        <_>
+          4 5 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 6 -1.</_>
+        <_>
+          4 11 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 3 -1.</_>
+        <_>
+          14 12 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 17 4 3 -1.</_>
+        <_>
+          12 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 2 -1.</_>
+        <_>
+          13 11 1 1 2.</_>
+        <_>
+          14 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 2 -1.</_>
+        <_>
+          13 11 1 1 2.</_>
+        <_>
+          14 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 5 6 -1.</_>
+        <_>
+          8 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 10 4 -1.</_>
+        <_>
+          0 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 1 -1.</_>
+        <_>
+          18 12 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 18 2 2 -1.</_>
+        <_>
+          8 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 4 -1.</_>
+        <_>
+          9 6 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 8 -1.</_>
+        <_>
+          6 12 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 1 -1.</_>
+        <_>
+          8 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 19 -1.</_>
+        <_>
+          14 0 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 2 -1.</_>
+        <_>
+          8 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 5 -1.</_>
+        <_>
+          9 11 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 3 2 -1.</_>
+        <_>
+          8 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 2 2 -1.</_>
+        <_>
+          5 13 1 1 2.</_>
+        <_>
+          6 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 3 -1.</_>
+        <_>
+          18 0 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 6 -1.</_>
+        <_>
+          4 4 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 4 -1.</_>
+        <_>
+          10 0 5 2 2.</_>
+        <_>
+          15 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 6 -1.</_>
+        <_>
+          5 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 6 -1.</_>
+        <_>
+          12 1 4 3 2.</_>
+        <_>
+          16 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 2 1 -1.</_>
+        <_>
+          1 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 2 4 -1.</_>
+        <_>
+          16 7 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 17 5 3 -1.</_>
+        <_>
+          15 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 8 -1.</_>
+        <_>
+          8 12 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          6 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 6 -1.</_>
+        <_>
+          14 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 4 -1.</_>
+        <_>
+          18 1 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 10 -1.</_>
+        <_>
+          5 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          6 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 3 -1.</_>
+        <_>
+          12 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 1 3 -1.</_>
+        <_>
+          2 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 8 1 -1.</_>
+        <_>
+          4 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 12 -1.</_>
+        <_>
+          6 7 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 6 2 -1.</_>
+        <_>
+          15 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 7 -1.</_>
+        <_>
+          12 10 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 12 -1.</_>
+        <_>
+          16 12 1 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 3 -1.</_>
+        <_>
+          6 11 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 3 -1.</_>
+        <_>
+          4 10 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 7 -1.</_>
+        <_>
+          5 1 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 18 -1.</_>
+        <_>
+          0 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 4 -1.</_>
+        <_>
+          8 14 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 16 4 4 -1.</_>
+        <_>
+          16 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 4 8 -1.</_>
+        <_>
+          2 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 3 2 -1.</_>
+        <_>
+          3 16 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 2 1 -1.</_>
+        <_>
+          2 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 8 -1.</_>
+        <_>
+          18 10 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 18 3 -1.</_>
+        <_>
+          6 12 6 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 2 -1.</_>
+        <_>
+          16 11 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 5 4 -1.</_>
+        <_>
+          9 3 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          6 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 8 6 -1.</_>
+        <_>
+          3 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 2 -1.</_>
+        <_>
+          18 1 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 2 3 -1.</_>
+        <_>
+          18 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 8 -1.</_>
+        <_>
+          17 6 1 4 2.</_>
+        <_>
+          18 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 4 -1.</_>
+        <_>
+          18 6 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 4 8 -1.</_>
+        <_>
+          0 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 8 -1.</_>
+        <_>
+          0 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 2 2 -1.</_>
+        <_>
+          14 11 1 1 2.</_>
+        <_>
+          15 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 3 3 -1.</_>
+        <_>
+          14 12 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 5 2 -1.</_>
+        <_>
+          14 13 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 12 1 2 -1.</_>
+        <_>
+          19 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 7 -1.</_>
+        <_>
+          7 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 3 2 -1.</_>
+        <_>
+          12 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 2 -1.</_>
+        <_>
+          12 13 2 1 2.</_>
+        <_>
+          14 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          16 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 1 2 -1.</_>
+        <_>
+          14 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          17 1 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 2 -1.</_>
+        <_>
+          17 1 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 2 -1.</_>
+        <_>
+          12 13 1 1 2.</_>
+        <_>
+          13 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 4 2 -1.</_>
+        <_>
+          7 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 1 3 -1.</_>
+        <_>
+          2 4 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 2 3 -1.</_>
+        <_>
+          2 5 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 6 -1.</_>
+        <_>
+          3 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 5 -1.</_>
+        <_>
+          12 2 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 1 3 -1.</_>
+        <_>
+          3 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 2 -1.</_>
+        <_>
+          13 12 1 1 2.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 4 3 -1.</_>
+        <_>
+          6 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 3 3 -1.</_>
+        <_>
+          17 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 8 -1.</_>
+        <_>
+          0 12 1 4 2.</_>
+        <_>
+          1 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 1 3 -1.</_>
+        <_>
+          3 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 2 -1.</_>
+        <_>
+          0 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 7 -1.</_>
+        <_>
+          11 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 9 -1.</_>
+        <_>
+          2 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 2 2 -1.</_>
+        <_>
+          2 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 2 -1.</_>
+        <_>
+          13 12 1 1 2.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 1 -1.</_>
+        <_>
+          19 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 1 -1.</_>
+        <_>
+          5 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 4 1 -1.</_>
+        <_>
+          7 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 3 -1.</_>
+        <_>
+          6 11 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 4 3 -1.</_>
+        <_>
+          7 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 3 -1.</_>
+        <_>
+          6 0 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 15 5 2 -1.</_>
+        <_>
+          15 16 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 12 -1.</_>
+        <_>
+          6 12 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 4 -1.</_>
+        <_>
+          8 6 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 3 -1.</_>
+        <_>
+          2 12 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 3 -1.</_>
+        <_>
+          4 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 3 -1.</_>
+        <_>
+          18 11 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 1 4 -1.</_>
+        <_>
+          16 12 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 9 -1.</_>
+        <_>
+          4 0 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 5 -1.</_>
+        <_>
+          10 3 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 3 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 6 -1.</_>
+        <_>
+          7 3 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 2 2 -1.</_>
+        <_>
+          0 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 5 -1.</_>
+        <_>
+          14 9 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 7 -1.</_>
+        <_>
+          12 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_>
+        <_>
+          12 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 1 -1.</_>
+        <_>
+          13 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 1 -1.</_>
+        <_>
+          18 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 6 -1.</_>
+        <_>
+          14 2 3 3 2.</_>
+        <_>
+          17 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 8 4 -1.</_>
+        <_>
+          12 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 3 3 -1.</_>
+        <_>
+          6 12 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          4 5 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 8 3 8 -1.</_>
+        <_>
+          1 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 6 -1.</_>
+        <_>
+          9 2 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 7 6 -1.</_>
+        <_>
+          5 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 1 -1.</_>
+        <_>
+          11 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 4 2 -1.</_>
+        <_>
+          12 12 2 1 2.</_>
+        <_>
+          14 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 19 -1.</_>
+        <_>
+          13 1 7 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 14 1 -1.</_>
+        <_>
+          13 9 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 1 -1.</_>
+        <_>
+          18 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 1 -1.</_>
+        <_>
+          16 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 3 -1.</_>
+        <_>
+          4 8 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 12 3 3 -1.</_>
+        <_>
+          14 13 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 2 -1.</_>
+        <_>
+          11 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 3 -1.</_>
+        <_>
+          9 13 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 7 6 -1.</_>
+        <_>
+          4 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          11 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 4 -1.</_>
+        <_>
+          0 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 4 -1.</_>
+        <_>
+          8 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 1 3 -1.</_>
+        <_>
+          1 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 2 -1.</_>
+        <_>
+          9 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 13 2 5 -1.</_>
+        <_>
+          19 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 3 6 -1.</_>
+        <_>
+          3 11 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 12 -1.</_>
+        <_>
+          0 9 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 5 -1.</_>
+        <_>
+          15 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 2 -1.</_>
+        <_>
+          16 12 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 4 2 -1.</_>
+        <_>
+          16 9 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 2 1 -1.</_>
+        <_>
+          6 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 2 -1.</_>
+        <_>
+          13 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 8 -1.</_>
+        <_>
+          13 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 10 -1.</_>
+        <_>
+          5 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 2 -1.</_>
+        <_>
+          6 14 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 19 4 -1.</_>
+        <_>
+          0 7 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 2 -1.</_>
+        <_>
+          18 5 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 4 -1.</_>
+        <_>
+          18 4 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 8 2 -1.</_>
+        <_>
+          7 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 8 -1.</_>
+        <_>
+          0 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 15 6 -1.</_>
+        <_>
+          0 11 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 1 -1.</_>
+        <_>
+          18 14 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          2 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 2 -1.</_>
+        <_>
+          2 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 3 2 -1.</_>
+        <_>
+          3 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 15 6 -1.</_>
+        <_>
+          7 13 5 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 3 -1.</_>
+        <_>
+          8 15 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          8 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 3 -1.</_>
+        <_>
+          6 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 7 3 -1.</_>
+        <_>
+          5 9 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 1 -1.</_>
+        <_>
+          18 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 2 -1.</_>
+        <_>
+          18 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 1 3 -1.</_>
+        <_>
+          11 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 5 -1.</_>
+        <_>
+          4 6 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 3 -1.</_>
+        <_>
+          6 6 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 6 -1.</_>
+        <_>
+          0 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 2 -1.</_>
+        <_>
+          14 12 1 1 2.</_>
+        <_>
+          15 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 3 -1.</_>
+        <_>
+          4 16 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 4 -1.</_>
+        <_>
+          3 3 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 8 -1.</_>
+        <_>
+          6 0 7 4 2.</_>
+        <_>
+          13 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 8 -1.</_>
+        <_>
+          4 2 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 1 -1.</_>
+        <_>
+          13 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 1 -1.</_>
+        <_>
+          17 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 18 2 2 -1.</_>
+        <_>
+          18 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 2 -1.</_>
+        <_>
+          5 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 11 3 -1.</_>
+        <_>
+          2 9 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 2 3 -1.</_>
+        <_>
+          1 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 2 5 -1.</_>
+        <_>
+          19 12 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 3 -1.</_>
+        <_>
+          18 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 2 -1.</_>
+        <_>
+          14 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 2 -1.</_>
+        <_>
+          13 11 1 1 2.</_>
+        <_>
+          14 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 4 -1.</_>
+        <_>
+          14 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 11 1 3 -1.</_>
+        <_>
+          19 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 4 -1.</_>
+        <_>
+          0 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 20 -1.</_>
+        <_>
+          0 0 10 10 2.</_>
+        <_>
+          10 10 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 3 -1.</_>
+        <_>
+          10 13 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 2 -1.</_>
+        <_>
+          13 10 2 1 2.</_>
+        <_>
+          15 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 11 1 1 2.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 6 -1.</_>
+        <_>
+          3 10 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 9 -1.</_>
+        <_>
+          2 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 2 1 -1.</_>
+        <_>
+          8 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 8 1 -1.</_>
+        <_>
+          8 18 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 1 4 -1.</_>
+        <_>
+          3 12 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 11 3 3 -1.</_>
+        <_>
+          6 12 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 1 -1.</_>
+        <_>
+          10 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 2 1 -1.</_>
+        <_>
+          1 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 5 -1.</_>
+        <_>
+          12 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 0 6 10 2.</_>
+        <_>
+          14 10 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 1 4 -1.</_>
+        <_>
+          3 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 16 4 -1.</_>
+        <_>
+          8 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 5 4 -1.</_>
+        <_>
+          6 10 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 2 -1.</_>
+        <_>
+          5 12 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 1 -1.</_>
+        <_>
+          1 14 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 1 3 -1.</_>
+        <_>
+          3 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 9 -1.</_>
+        <_>
+          4 10 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 4 -1.</_>
+        <_>
+          5 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 2 -1.</_>
+        <_>
+          8 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 6 -1.</_>
+        <_>
+          5 2 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 3 -1.</_>
+        <_>
+          11 2 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 2 -1.</_>
+        <_>
+          8 1 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 15 9 -1.</_>
+        <_>
+          4 7 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 6 -1.</_>
+        <_>
+          7 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 9 9 -1.</_>
+        <_>
+          11 11 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 4 -1.</_>
+        <_>
+          9 2 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 3 -1.</_>
+        <_>
+          2 12 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 3 -1.</_>
+        <_>
+          18 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 2 10 -1.</_>
+        <_>
+          10 15 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 4 -1.</_>
+        <_>
+          4 8 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 1 -1.</_>
+        <_>
+          3 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 6 -1.</_>
+        <_>
+          0 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 10 2 -1.</_>
+        <_>
+          8 10 5 1 2.</_>
+        <_>
+          13 11 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 5 6 -1.</_>
+        <_>
+          5 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 1 -1.</_>
+        <_>
+          6 1 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 12 -1.</_>
+        <_>
+          0 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 1 -1.</_>
+        <_>
+          1 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 3 -1.</_>
+        <_>
+          10 13 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 3 -1.</_>
+        <_>
+          11 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          10 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 2 -1.</_>
+        <_>
+          7 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 6 2 -1.</_>
+        <_>
+          15 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 1 -1.</_>
+        <_>
+          3 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 15 4 1 -1.</_>
+        <_>
+          2 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 2 -1.</_>
+        <_>
+          18 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 3 -1.</_>
+        <_>
+          19 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 2 -1.</_>
+        <_>
+          16 11 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 3 -1.</_>
+        <_>
+          15 13 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 1 -1.</_>
+        <_>
+          16 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 9 6 -1.</_>
+        <_>
+          2 4 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 2 -1.</_>
+        <_>
+          17 1 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 4 -1.</_>
+        <_>
+          7 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 2 -1.</_>
+        <_>
+          7 6 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 6 -1.</_>
+        <_>
+          13 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 3 -1.</_>
+        <_>
+          5 8 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 9 3 -1.</_>
+        <_>
+          5 9 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 3 -1.</_>
+        <_>
+          2 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 5 4 -1.</_>
+        <_>
+          9 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 7 -1.</_>
+        <_>
+          3 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 2 -1.</_>
+        <_>
+          17 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 2 -1.</_>
+        <_>
+          14 12 1 1 2.</_>
+        <_>
+          15 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 1 -1.</_>
+        <_>
+          7 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 11 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 14 12 4 -1.</_>
+        <_>
+          3 14 6 2 2.</_>
+        <_>
+          9 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 1 3 -1.</_>
+        <_>
+          4 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 2 -1.</_>
+        <_>
+          9 13 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 11 2 2 -1.</_>
+        <_>
+          14 11 1 1 2.</_>
+        <_>
+          15 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 7 2 -1.</_>
+        <_>
+          13 11 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 1 2 -1.</_>
+        <_>
+          7 13 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          6 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 5 -1.</_>
+        <_>
+          9 2 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 4 2 -1.</_>
+        <_>
+          3 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 4 3 -1.</_>
+        <_>
+          13 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 5 3 -1.</_>
+        <_>
+          15 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 4 3 -1.</_>
+        <_>
+          15 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 16 3 -1.</_>
+        <_>
+          4 17 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 2 -1.</_>
+        <_>
+          0 14 1 1 2.</_>
+        <_>
+          1 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 6 -1.</_>
+        <_>
+          7 4 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 1 3 -1.</_>
+        <_>
+          2 6 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 2 2 -1.</_>
+        <_>
+          2 7 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 11 5 3 -1.</_>
+        <_>
+          5 12 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 6 -1.</_>
+        <_>
+          16 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 11 -1.</_>
+        <_>
+          3 1 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 3 -1.</_>
+        <_>
+          6 11 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 4 -1.</_>
+        <_>
+          8 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 2 -1.</_>
+        <_>
+          10 15 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 18 -1.</_>
+        <_>
+          0 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 2 -1.</_>
+        <_>
+          4 13 1 1 2.</_>
+        <_>
+          5 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 6 -1.</_>
+        <_>
+          9 12 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          5 8 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 3 -1.</_>
+        <_>
+          5 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 14 1 -1.</_>
+        <_>
+          1 4 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 8 3 -1.</_>
+        <_>
+          14 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 2 1 -1.</_>
+        <_>
+          4 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 16 2 2 -1.</_>
+        <_>
+          6 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 17 4 2 -1.</_>
+        <_>
+          4 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          5 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 2 -1.</_>
+        <_>
+          15 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 2 2 -1.</_>
+        <_>
+          3 12 1 1 2.</_>
+        <_>
+          4 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 1 -1.</_>
+        <_>
+          1 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 2 -1.</_>
+        <_>
+          18 1 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 3 9 -1.</_>
+        <_>
+          3 11 1 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 2 -1.</_>
+        <_>
+          16 8 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 16 3 3 -1.</_>
+        <_>
+          5 16 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 1 -1.</_>
+        <_>
+          10 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 3 2.</_>
+        <_>
+          17 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 1 -1.</_>
+        <_>
+          17 2 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 19 20 1 -1.</_>
+        <_>
+          10 19 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 6 1 -1.</_>
+        <_>
+          3 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 4 3 -1.</_>
+        <_>
+          10 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 3 -1.</_>
+        <_>
+          5 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 3 -1.</_>
+        <_>
+          18 8 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 4 -1.</_>
+        <_>
+          18 2 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 1 -1.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 4 -1.</_>
+        <_>
+          6 5 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 7 -1.</_>
+        <_>
+          9 0 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 5 9 -1.</_>
+        <_>
+          0 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          14 10 1 1 2.</_>
+        <_>
+          15 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 11 1 1 2.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 4 -1.</_>
+        <_>
+          11 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 12 8 -1.</_>
+        <_>
+          6 12 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 2 -1.</_>
+        <_>
+          3 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 5 -1.</_>
+        <_>
+          1 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 4 4 -1.</_>
+        <_>
+          3 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 4 -1.</_>
+        <_>
+          13 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 4 -1.</_>
+        <_>
+          2 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 9 -1.</_>
+        <_>
+          7 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 2 3 -1.</_>
+        <_>
+          13 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 15 3 -1.</_>
+        <_>
+          8 10 5 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 1 -1.</_>
+        <_>
+          16 11 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 8 -1.</_>
+        <_>
+          1 2 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 15 6 -1.</_>
+        <_>
+          2 6 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 6 -1.</_>
+        <_>
+          6 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 3 -1.</_>
+        <_>
+          16 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 4 3 -1.</_>
+        <_>
+          16 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          15 10 1 1 2.</_>
+        <_>
+          16 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 3 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 2 2 -1.</_>
+        <_>
+          2 16 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 7 -1.</_>
+        <_>
+          4 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 16 1 1 2.</_>
+        <_>
+          1 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          8 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 3 -1.</_>
+        <_>
+          0 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 4 -1.</_>
+        <_>
+          10 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 4 6 -1.</_>
+        <_>
+          16 4 2 3 2.</_>
+        <_>
+          18 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 4 2 -1.</_>
+        <_>
+          11 12 2 1 2.</_>
+        <_>
+          13 13 2 1 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_licence_plate_rus_16stages.xml b/venv/Lib/site-packages/cv2/data/haarcascade_licence_plate_rus_16stages.xml
new file mode 100644
index 000000000..50b7f6a1e
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_licence_plate_rus_16stages.xml
@@ -0,0 +1,1404 @@
+<?xml version="1.0"?>
+<opencv_storage>
+<!-- Automatically converted from haarcascade2, window size = 64x16 -->
+<haarcascade_pltzzz64x16_16STG type_id="opencv-haar-classifier">
+  <size>
+    64 16</size>
+  <stages>
+    <_>
+      <!-- stage 0 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  32 2 8 6 -1.</_>
+                <_>
+                  32 4 8 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.6915600746870041e-002</threshold>
+            <left_val>-9.5547717809677124e-001</left_val>
+            <right_val>8.9129137992858887e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 4 6 10 -1.</_>
+                <_>
+                  3 4 3 10 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.4228349328041077e-002</threshold>
+            <left_val>-9.2089319229125977e-001</left_val>
+            <right_val>8.8723921775817871e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  55 0 8 6 -1.</_>
+                <_>
+                  55 0 4 3 2.</_>
+                <_>
+                  59 3 4 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.0168660432100296e-002</threshold>
+            <left_val>8.8940089941024780e-001</left_val>
+            <right_val>-7.7847331762313843e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  44 7 4 9 -1.</_>
+                <_>
+                  44 10 4 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.0863260142505169e-003</threshold>
+            <left_val>-8.7998157739639282e-001</left_val>
+            <right_val>5.8651781082153320e-001</right_val></_></_></trees>
+      <stage_threshold>-2.0683259963989258e+000</stage_threshold>
+      <parent>-1</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 1 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  29 1 16 4 -1.</_>
+                <_>
+                  29 3 16 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.9062159359455109e-002</threshold>
+            <left_val>-8.7765061855316162e-001</left_val>
+            <right_val>8.5373121500015259e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 5 9 8 -1.</_>
+                <_>
+                  3 5 3 8 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.3903399705886841e-002</threshold>
+            <left_val>-9.2079448699951172e-001</left_val>
+            <right_val>7.5155001878738403e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  44 0 20 14 -1.</_>
+                <_>
+                  44 0 10 7 2.</_>
+                <_>
+                  54 7 10 7 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-3.5404648631811142e-002</threshold>
+            <left_val>6.7834627628326416e-001</left_val>
+            <right_val>-9.0937072038650513e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  41 7 6 9 -1.</_>
+                <_>
+                  43 7 2 9 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.2988721765577793e-003</threshold>
+            <left_val>-8.1054258346557617e-001</left_val>
+            <right_val>5.8985030651092529e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 4 21 4 -1.</_>
+                <_>
+                  7 4 7 4 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>3.4959490876644850e-003</threshold>
+            <left_val>-9.7632282972335815e-001</left_val>
+            <right_val>4.5473039150238037e-001</right_val></_></_></trees>
+      <stage_threshold>-1.6632349491119385e+000</stage_threshold>
+      <parent>0</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 2 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  31 2 11 6 -1.</_>
+                <_>
+                  31 4 11 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.3864099755883217e-002</threshold>
+            <left_val>-9.3137168884277344e-001</left_val>
+            <right_val>8.2478952407836914e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 3 6 11 -1.</_>
+                <_>
+                  59 3 3 11 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.5775209069252014e-002</threshold>
+            <left_val>8.5526448488235474e-001</left_val>
+            <right_val>-8.7574672698974609e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  32 14 32 2 -1.</_>
+                <_>
+                  32 15 32 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.0646049864590168e-002</threshold>
+            <left_val>8.5167151689529419e-001</left_val>
+            <right_val>-6.7789041996002197e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 2 8 14 -1.</_>
+                <_>
+                  4 2 4 14 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.7000989764928818e-002</threshold>
+            <left_val>-8.0041092634201050e-001</left_val>
+            <right_val>6.4893317222595215e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  19 0 22 6 -1.</_>
+                <_>
+                  19 0 11 3 2.</_>
+                <_>
+                  30 3 11 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>5.2989721298217773e-003</threshold>
+            <left_val>-9.5342522859573364e-001</left_val>
+            <right_val>5.0140267610549927e-001</right_val></_></_></trees>
+      <stage_threshold>-1.3346730470657349e+000</stage_threshold>
+      <parent>1</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 3 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 0 6 6 -1.</_>
+                <_>
+                  56 0 3 3 2.</_>
+                <_>
+                  59 3 3 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-6.9233630783855915e-003</threshold>
+            <left_val>8.2654470205307007e-001</left_val>
+            <right_val>-8.5396027565002441e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  32 0 14 12 -1.</_>
+                <_>
+                  32 0 7 6 2.</_>
+                <_>
+                  39 6 7 6 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.2539249658584595e-001</threshold>
+            <left_val>-1.2996139936149120e-002</left_val>
+            <right_val>-3.2377028808593750e+003</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  2 1 43 4 -1.</_>
+                <_>
+                  2 3 43 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.3474893569946289e-002</threshold>
+            <left_val>-6.4648061990737915e-001</left_val>
+            <right_val>8.2302427291870117e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  34 10 30 5 -1.</_>
+                <_>
+                  44 10 10 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>4.2217150330543518e-002</threshold>
+            <left_val>-7.5190877914428711e-001</left_val>
+            <right_val>6.3705182075500488e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 9 9 5 -1.</_>
+                <_>
+                  3 9 3 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.0000640302896500e-002</threshold>
+            <left_val>-6.2077498435974121e-001</left_val>
+            <right_val>6.1317932605743408e-001</right_val></_></_></trees>
+      <stage_threshold>-1.6521669626235962e+000</stage_threshold>
+      <parent>2</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 4 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  2 1 43 6 -1.</_>
+                <_>
+                  2 3 43 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>9.2297486960887909e-002</threshold>
+            <left_val>-7.2764229774475098e-001</left_val>
+            <right_val>8.0554759502410889e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  53 4 9 8 -1.</_>
+                <_>
+                  56 4 3 8 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.7613969519734383e-002</threshold>
+            <left_val>-7.0769268274307251e-001</left_val>
+            <right_val>7.3315787315368652e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  36 4 14 8 -1.</_>
+                <_>
+                  36 4 7 4 2.</_>
+                <_>
+                  43 8 7 4 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.2465449981391430e-002</threshold>
+            <left_val>-8.4359270334243774e-001</left_val>
+            <right_val>5.7046437263488770e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  14 14 49 2 -1.</_>
+                <_>
+                  14 15 49 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.3886829614639282e-002</threshold>
+            <left_val>8.2656508684158325e-001</left_val>
+            <right_val>-5.2783298492431641e-001</right_val></_></_></trees>
+      <stage_threshold>-1.4523630142211914e+000</stage_threshold>
+      <parent>3</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 5 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 5 4 9 -1.</_>
+                <_>
+                  2 5 2 9 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.8821349367499352e-002</threshold>
+            <left_val>-8.1122857332229614e-001</left_val>
+            <right_val>6.9127470254898071e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  21 1 38 4 -1.</_>
+                <_>
+                  21 3 38 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.1703320592641830e-002</threshold>
+            <left_val>-7.6482647657394409e-001</left_val>
+            <right_val>6.4212161302566528e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  44 12 18 3 -1.</_>
+                <_>
+                  53 12 9 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.6298670321702957e-002</threshold>
+            <left_val>5.0207728147506714e-001</left_val>
+            <right_val>-8.4020161628723145e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  10 4 9 3 -1.</_>
+                <_>
+                  13 4 3 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-4.9458951689302921e-003</threshold>
+            <left_val>6.1991941928863525e-001</left_val>
+            <right_val>-6.1633539199829102e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  40 4 10 4 -1.</_>
+                <_>
+                  45 4 5 4 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-5.1894597709178925e-003</threshold>
+            <left_val>4.4975179433822632e-001</left_val>
+            <right_val>-8.0651968717575073e-001</right_val></_></_>
+        <_>
+          <!-- tree 5 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  17 14 47 2 -1.</_>
+                <_>
+                  17 15 47 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.8824130296707153e-002</threshold>
+            <left_val>6.1992841958999634e-001</left_val>
+            <right_val>-5.5643159151077271e-001</right_val></_></_>
+        <_>
+          <!-- tree 6 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  8 5 4 7 -1.</_>
+                <_>
+                  10 5 2 7 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>5.6571601890027523e-003</threshold>
+            <left_val>-4.8346561193466187e-001</left_val>
+            <right_val>6.8647360801696777e-001</right_val></_></_></trees>
+      <stage_threshold>-2.2358059883117676e+000</stage_threshold>
+      <parent>4</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 6 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 0 6 6 -1.</_>
+                <_>
+                  56 0 3 3 2.</_>
+                <_>
+                  59 3 3 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-9.1503243893384933e-003</threshold>
+            <left_val>6.8174481391906738e-001</left_val>
+            <right_val>-7.7866071462631226e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 0 6 6 -1.</_>
+                <_>
+                  0 0 3 3 2.</_>
+                <_>
+                  3 3 3 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>7.4933180585503578e-003</threshold>
+            <left_val>-6.8696027994155884e-001</left_val>
+            <right_val>6.6913938522338867e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  13 4 48 2 -1.</_>
+                <_>
+                  29 4 16 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>4.5296419411897659e-002</threshold>
+            <left_val>-7.3576509952545166e-001</left_val>
+            <right_val>5.9453499317169189e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  42 1 6 15 -1.</_>
+                <_>
+                  42 6 6 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.1669679544866085e-002</threshold>
+            <left_val>-8.4733831882476807e-001</left_val>
+            <right_val>4.5461329817771912e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  30 8 3 5 -1.</_>
+                <_>
+                  31 8 1 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.5769430212676525e-003</threshold>
+            <left_val>-5.8270388841629028e-001</left_val>
+            <right_val>7.7900522947311401e-001</right_val></_></_>
+        <_>
+          <!-- tree 5 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  55 10 8 6 -1.</_>
+                <_>
+                  55 13 8 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.4139170525595546e-003</threshold>
+            <left_val>4.5126929879188538e-001</left_val>
+            <right_val>-9.0696328878402710e-001</right_val></_></_></trees>
+      <stage_threshold>-1.8782069683074951e+000</stage_threshold>
+      <parent>5</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 7 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  4 6 4 7 -1.</_>
+                <_>
+                  6 6 2 7 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-5.3149578161537647e-003</threshold>
+            <left_val>6.5218788385391235e-001</left_val>
+            <right_val>-7.9464268684387207e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 3 6 8 -1.</_>
+                <_>
+                  59 3 3 8 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.2906960919499397e-002</threshold>
+            <left_val>6.6433382034301758e-001</left_val>
+            <right_val>-7.3633247613906860e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  37 2 4 6 -1.</_>
+                <_>
+                  37 4 4 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>9.4887977465987206e-003</threshold>
+            <left_val>-8.2612031698226929e-001</left_val>
+            <right_val>4.9333500862121582e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 10 30 6 -1.</_>
+                <_>
+                  0 12 30 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>4.5138411223888397e-002</threshold>
+            <left_val>-5.4704028367996216e-001</left_val>
+            <right_val>7.6927912235260010e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 4 21 12 -1.</_>
+                <_>
+                  7 4 7 12 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.5049019604921341e-002</threshold>
+            <left_val>-8.6739641427993774e-001</left_val>
+            <right_val>5.2807968854904175e-001</right_val></_></_></trees>
+      <stage_threshold>-1.0597369670867920e+000</stage_threshold>
+      <parent>6</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 8 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  44 0 1 14 -1.</_>
+                <_>
+                  44 7 1 7 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.6414438188076019e-003</threshold>
+            <left_val>-7.7290147542953491e-001</left_val>
+            <right_val>6.9723731279373169e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  54 3 4 3 -1.</_>
+                <_>
+                  56 3 2 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.4703629314899445e-003</threshold>
+            <left_val>-7.4289917945861816e-001</left_val>
+            <right_val>6.6825848817825317e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  32 0 30 6 -1.</_>
+                <_>
+                  32 0 15 3 2.</_>
+                <_>
+                  47 3 15 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.2910499945282936e-002</threshold>
+            <left_val>4.3986389040946960e-001</left_val>
+            <right_val>-9.0588808059692383e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 8 9 7 -1.</_>
+                <_>
+                  3 8 3 7 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>3.4193221479654312e-002</threshold>
+            <left_val>-6.9507479667663574e-001</left_val>
+            <right_val>6.2501090764999390e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  30 10 3 3 -1.</_>
+                <_>
+                  31 10 1 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.5060020377859473e-003</threshold>
+            <left_val>-6.8670761585235596e-001</left_val>
+            <right_val>8.2241541147232056e-001</right_val></_></_>
+        <_>
+          <!-- tree 5 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  21 3 24 4 -1.</_>
+                <_>
+                  29 3 8 4 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.9838380467263050e-005</threshold>
+            <left_val>-9.2727631330490112e-001</left_val>
+            <right_val>6.4723730087280273e-001</right_val></_></_>
+        <_>
+          <!-- tree 6 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  42 3 12 6 -1.</_>
+                <_>
+                  46 3 4 6 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.2170299416757189e-005</threshold>
+            <left_val>5.6555831432342529e-001</left_val>
+            <right_val>-9.6788132190704346e-001</right_val></_></_></trees>
+      <stage_threshold>-1.4993519783020020e+000</stage_threshold>
+      <parent>7</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 9 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 9 6 6 -1.</_>
+                <_>
+                  59 9 3 6 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.1395259760320187e-002</threshold>
+            <left_val>7.1383631229400635e-001</left_val>
+            <right_val>-8.7429678440093994e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  6 4 1 6 -1.</_>
+                <_>
+                  6 7 1 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.1864590235054493e-003</threshold>
+            <left_val>8.5311782360076904e-001</left_val>
+            <right_val>-6.4777731895446777e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 0 12 4 -1.</_>
+                <_>
+                  0 0 6 2 2.</_>
+                <_>
+                  6 2 6 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.3193720262497663e-003</threshold>
+            <left_val>-7.6411879062652588e-001</left_val>
+            <right_val>7.1867972612380981e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  43 12 18 2 -1.</_>
+                <_>
+                  52 12 9 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-7.9916073009371758e-003</threshold>
+            <left_val>6.6442942619323730e-001</left_val>
+            <right_val>-7.9540950059890747e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  9 5 2 8 -1.</_>
+                <_>
+                  10 5 1 8 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.4212740352377295e-003</threshold>
+            <left_val>-6.3904231786727905e-001</left_val>
+            <right_val>7.5050598382949829e-001</right_val></_></_></trees>
+      <stage_threshold>-8.4829801321029663e-001</stage_threshold>
+      <parent>8</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 10 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  1 9 6 3 -1.</_>
+                <_>
+                  3 9 2 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.4091659151017666e-003</threshold>
+            <left_val>-8.8425230979919434e-001</left_val>
+            <right_val>9.9953681230545044e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  56 8 2 8 -1.</_>
+                <_>
+                  56 12 2 4 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-6.3316390151157975e-004</threshold>
+            <left_val>8.3822172880172729e-001</left_val>
+            <right_val>-9.8322170972824097e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  24 2 6 13 -1.</_>
+                <_>
+                  26 2 2 13 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-6.4947169448714703e-005</threshold>
+            <left_val>1.</left_val>
+            <right_val>-9.1822808980941772e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  33 7 24 4 -1.</_>
+                <_>
+                  41 7 8 4 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>5.3404141217470169e-003</threshold>
+            <left_val>-9.4317251443862915e-001</left_val>
+            <right_val>9.0425151586532593e-001</right_val></_></_></trees>
+      <stage_threshold>-6.0007210820913315e-002</stage_threshold>
+      <parent>9</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 11 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  1 1 57 4 -1.</_>
+                <_>
+                  1 3 57 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.0755469650030136e-001</threshold>
+            <left_val>-7.1647202968597412e-001</left_val>
+            <right_val>8.7827038764953613e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 2 6 14 -1.</_>
+                <_>
+                  3 2 3 14 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>3.1668949872255325e-002</threshold>
+            <left_val>-8.7051069736480713e-001</left_val>
+            <right_val>5.8807212114334106e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  52 3 6 10 -1.</_>
+                <_>
+                  54 3 2 10 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-1.0572380386292934e-002</threshold>
+            <left_val>6.2438100576400757e-001</left_val>
+            <right_val>-7.4027371406555176e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  1 14 61 2 -1.</_>
+                <_>
+                  1 15 61 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.7396259829401970e-002</threshold>
+            <left_val>8.9776748418807983e-001</left_val>
+            <right_val>-5.2986758947372437e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  28 0 11 12 -1.</_>
+                <_>
+                  28 4 11 4 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.5918649509549141e-002</threshold>
+            <left_val>-8.6482518911361694e-001</left_val>
+            <right_val>5.3121817111968994e-001</right_val></_></_></trees>
+      <stage_threshold>-9.6125108003616333e-001</stage_threshold>
+      <parent>10</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 12 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  22 1 41 4 -1.</_>
+                <_>
+                  22 3 41 2 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>7.1039132773876190e-002</threshold>
+            <left_val>-7.5719678401947021e-001</left_val>
+            <right_val>7.5645631551742554e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  41 6 6 8 -1.</_>
+                <_>
+                  43 6 2 8 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>7.6241148635745049e-003</threshold>
+            <left_val>-7.9783838987350464e-001</left_val>
+            <right_val>7.1733069419860840e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  50 9 14 5 -1.</_>
+                <_>
+                  57 9 7 5 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.7092639356851578e-002</threshold>
+            <left_val>6.0071170330047607e-001</left_val>
+            <right_val>-8.4794402122497559e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  4 1 12 5 -1.</_>
+                <_>
+                  10 1 6 5 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-8.1267888890579343e-004</threshold>
+            <left_val>5.9364068508148193e-001</left_val>
+            <right_val>-8.9295238256454468e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  37 9 3 3 -1.</_>
+                <_>
+                  38 9 1 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>8.3705072756856680e-004</threshold>
+            <left_val>-6.4887362718582153e-001</left_val>
+            <right_val>7.8537952899932861e-001</right_val></_></_></trees>
+      <stage_threshold>-1.0618970394134521e+000</stage_threshold>
+      <parent>11</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 13 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  54 0 10 6 -1.</_>
+                <_>
+                  54 0 5 3 2.</_>
+                <_>
+                  59 3 5 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-9.7556859254837036e-003</threshold>
+            <left_val>7.6982218027114868e-001</left_val>
+            <right_val>-8.5293501615524292e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  47 0 6 11 -1.</_>
+                <_>
+                  49 0 2 11 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-8.6617246270179749e-003</threshold>
+            <left_val>8.4029090404510498e-001</left_val>
+            <right_val>-7.1949690580368042e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  19 2 20 2 -1.</_>
+                <_>
+                  19 3 20 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.6897840425372124e-002</threshold>
+            <left_val>-5.3601992130279541e-001</left_val>
+            <right_val>9.5484441518783569e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  14 4 6 11 -1.</_>
+                <_>
+                  17 4 3 11 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>4.7526158596156165e-005</threshold>
+            <left_val>-7.6412862539291382e-001</left_val>
+            <right_val>7.5398761034011841e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  31 9 33 2 -1.</_>
+                <_>
+                  42 9 11 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>6.5607670694589615e-003</threshold>
+            <left_val>-9.9346441030502319e-001</left_val>
+            <right_val>6.4864277839660645e-001</right_val></_></_></trees>
+      <stage_threshold>-7.3307347297668457e-001</stage_threshold>
+      <parent>12</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 14 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  6 1 53 6 -1.</_>
+                <_>
+                  6 3 53 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.0103269666433334e-001</threshold>
+            <left_val>-7.3275578022003174e-001</left_val>
+            <right_val>8.4619927406311035e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  49 9 4 6 -1.</_>
+                <_>
+                  49 9 2 3 2.</_>
+                <_>
+                  51 12 2 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.8920811018906534e-004</threshold>
+            <left_val>7.1564781665802002e-001</left_val>
+            <right_val>-8.8221758604049683e-001</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 9 30 7 -1.</_>
+                <_>
+                  10 9 10 7 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.0838840156793594e-002</threshold>
+            <left_val>-8.7420248985290527e-001</left_val>
+            <right_val>6.0648679733276367e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  40 4 6 2 -1.</_>
+                <_>
+                  42 4 2 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>5.0803890917450190e-004</threshold>
+            <left_val>-9.0554022789001465e-001</left_val>
+            <right_val>6.4213967323303223e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  1 9 6 1 -1.</_>
+                <_>
+                  3 9 2 1 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.3357039317488670e-003</threshold>
+            <left_val>-9.2574918270111084e-001</left_val>
+            <right_val>8.6384928226470947e-001</right_val></_></_>
+        <_>
+          <!-- tree 5 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  47 3 4 10 -1.</_>
+                <_>
+                  47 8 4 5 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>8.0239427916239947e-005</threshold>
+            <left_val>-9.9618428945541382e-001</left_val>
+            <right_val>9.5355111360549927e-001</right_val></_></_>
+        <_>
+          <!-- tree 6 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  31 5 30 11 -1.</_>
+                <_>
+                  41 5 10 11 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>3.2030208967626095e-003</threshold>
+            <left_val>-1.</left_val>
+            <right_val>1.0001050233840942e+000</right_val></_></_>
+        <_>
+          <!-- tree 7 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 0 2 1 -1.</_>
+                <_>
+                  1 0 1 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>0.</threshold>
+            <left_val>0.</left_val>
+            <right_val>-1.</right_val></_></_>
+        <_>
+          <!-- tree 8 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  21 3 42 5 -1.</_>
+                <_>
+                  35 3 14 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.6143440045416355e-003</threshold>
+            <left_val>-1.</left_val>
+            <right_val>1.0002139806747437e+000</right_val></_></_>
+        <_>
+          <!-- tree 9 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 0 2 1 -1.</_>
+                <_>
+                  1 0 1 1 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>0.</threshold>
+            <left_val>0.</left_val>
+            <right_val>-1.</right_val></_></_>
+        <_>
+          <!-- tree 10 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  8 5 30 9 -1.</_>
+                <_>
+                  8 8 30 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-7.0475979009643197e-004</threshold>
+            <left_val>1.</left_val>
+            <right_val>-9.9976968765258789e-001</right_val></_></_>
+        <_>
+          <!-- tree 11 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  3 12 33 3 -1.</_>
+                <_>
+                  14 12 11 3 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.1271279547363520e-003</threshold>
+            <left_val>-9.9694627523422241e-001</left_val>
+            <right_val>1.0002720355987549e+000</right_val></_></_>
+        <_>
+          <!-- tree 12 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 0 3 2 -1.</_>
+                <_>
+                  1 0 1 2 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.4224430671893060e-004</threshold>
+            <left_val>1.</left_val>
+            <right_val>-1.</right_val></_></_>
+        <_>
+          <!-- tree 13 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  46 4 3 8 -1.</_>
+                <_>
+                  47 4 1 8 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>7.4700301047414541e-004</threshold>
+            <left_val>-9.9108231067657471e-001</left_val>
+            <right_val>9.9941182136535645e-001</right_val></_></_></trees>
+      <stage_threshold>-1.0991690158843994e+000</stage_threshold>
+      <parent>13</parent>
+      <next>-1</next></_>
+    <_>
+      <!-- stage 15 -->
+      <trees>
+        <_>
+          <!-- tree 0 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  1 2 6 5 -1.</_>
+                <_>
+                  3 2 2 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>1.7227890202775598e-003</threshold>
+            <left_val>-9.3608891963958740e-001</left_val>
+            <right_val>8.7251222133636475e-001</right_val></_></_>
+        <_>
+          <!-- tree 1 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  0 3 18 5 -1.</_>
+                <_>
+                  6 3 6 5 3.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>2.7599320746958256e-003</threshold>
+            <left_val>-9.9757021665573120e-001</left_val>
+            <right_val>1.0000289678573608e+000</right_val></_></_>
+        <_>
+          <!-- tree 2 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  3 1 6 14 -1.</_>
+                <_>
+                  6 1 3 14 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-8.9444358309265226e-005</threshold>
+            <left_val>1.</left_val>
+            <right_val>-9.9264812469482422e-001</right_val></_></_>
+        <_>
+          <!-- tree 3 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  3 6 2 10 -1.</_>
+                <_>
+                  3 11 2 5 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.7962020249105990e-004</threshold>
+            <left_val>8.2833290100097656e-001</left_val>
+            <right_val>-9.8444151878356934e-001</right_val></_></_>
+        <_>
+          <!-- tree 4 -->
+          <_>
+            <!-- root node -->
+            <feature>
+              <rects>
+                <_>
+                  42 0 4 6 -1.</_>
+                <_>
+                  42 0 2 3 2.</_>
+                <_>
+                  44 3 2 3 2.</_></rects>
+              <tilted>0</tilted></feature>
+            <threshold>-2.7560539820115082e-005</threshold>
+            <left_val>1.</left_val>
+            <right_val>-9.9543339014053345e-001</right_val></_></_></trees>
+      <stage_threshold>-9.1314977407455444e-001</stage_threshold>
+      <parent>14</parent>
+      <next>-1</next></_></stages></haarcascade_pltzzz64x16_16STG>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_lowerbody.xml b/venv/Lib/site-packages/cv2/data/haarcascade_lowerbody.xml
new file mode 100644
index 000000000..7fa27c7e2
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_lowerbody.xml
@@ -0,0 +1,14056 @@
+<?xml version="1.0"?>
+<!--
+   19x23 lowerbody detector (see the detailed description below). 
+
+//////////////////////////////////////////////////////////////////////////
+| Contributors License Agreement
+| IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+|   By downloading, copying, installing or using the software you agree 
+|   to this license.
+|   If you do not agree to this license, do not download, install,
+|   copy or use the software.
+|
+| Copyright (c) 2004, Hannes Kruppa and Bernt Schiele (ETH Zurich, Switzerland).
+|  All rights reserved.
+|
+| Redistribution and use in source and binary forms, with or without
+| modification, are permitted provided that the following conditions are
+| met:
+|
+|    * Redistributions of source code must retain the above copyright
+|       notice, this list of conditions and the following disclaimer.
+|    * Redistributions in binary form must reproduce the above
+|      copyright notice, this list of conditions and the following
+|      disclaimer in the documentation and/or other materials provided
+|      with the distribution.  
+|    * The name of Contributor may not used to endorse or promote products 
+|      derived from this software without specific prior written permission.
+|
+| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+| "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+| LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+| A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+| CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+| EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+| PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+| PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+| LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+| NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+| Top
+//////////////////////////////////////////////////////////////////////////
+
+"Haar"-based Detectors For Pedestrian Detection
+===============================================
+by Hannes Kruppa and Bernt Schiele, ETH Zurich, Switzerland
+
+This archive provides the following three detectors:
+- upper body detector (most fun, useful in many scenarios!)
+- lower body detector
+- full body detector
+
+These detectors have been successfully applied to pedestrian detection
+in still images. They can be directly passed as parameters to the
+program HaarFaceDetect.
+NOTE: These detectors deal with frontal and backside views but not
+with side views (also see "Known limitations" below).
+
+RESEARCHERS:
+If you are using any of the detectors or involved ideas please cite
+this paper (available at www.vision.ethz.ch/publications/):
+
+@InProceedings{Kruppa03-bmvc,
+  author =       "Hannes Kruppa, Modesto Castrillon-Santana and Bernt Schiele",
+  title =        "Fast and Robust Face Finding via Local Context."
+  booktitle =    "Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance"
+  year =         "2003",
+  month =        "October"
+}
+
+COMMERCIAL:
+If you have any commercial interest in this work please contact 
+hkruppa@inf.ethz.ch
+
+
+ADDITIONAL INFORMATION 
+====================== 
+Check out the demo movie, e.g. using mplayer or any (Windows/Linux-) player
+that can play back .mpg movies.
+Under Linux that's:
+> ffplay demo.mpg
+or:
+> mplayer demo.mpg
+
+The movie shows a person walking towards the camera in a realistic
+indoor setting. Using ffplay or mplayer you can pause and continue the
+movie by pressing the space bar.
+
+Detections coming from the different detectors are visualized using
+different line styles: 
+upper body : dotted line
+lower body : dashed line
+full body  : solid line
+
+You will notice that successful detections containing the target do
+not sit tightly on the body but also include some of the background
+left and right.  This is not a bug but accurately reflects the
+employed training data which also includes portions of the background
+to ensure proper silhouette representation. If you want to get a
+feeling for the training data check out the CBCL data set:
+http://www.ai.mit.edu/projects/cbcl/software-datasets/PedestrianData.html
+
+There is also a small number of false alarms in this sequence.  
+NOTE: This is per frame detection, not tracking (which is also one of
+the reasons why it is not mislead by the person's shadow on the back
+wall). 
+
+On an Intel Xeon 1.7GHz machine the detectors operate at something
+between 6Hz to 14 Hz (on 352 x 288 frames per second) depending on the
+detector. The detectors work as well on much lower image resolutions
+which is always an interesting possibility for speed-ups or
+"coarse-to-fine" search strategies.
+
+Additional information e.g. on training parameters, detector
+combination, detecting other types of objects (e.g. cars) etc. is
+available in my PhD thesis report (available end of June). Check out
+www.vision.ethz.ch/kruppa/
+
+
+KNOWN LIMITATIONS
+==================
+1) The detectors only support frontal and back views but not sideviews.
+   Sideviews are trickier and it makes a lot of sense to include additional
+   modalities for their detection, e.g. motion information. I recommend
+   Viola and Jones' ICCV 2003 paper if this further interests you.
+
+2) Don't expect these detectors to be as accurate as a frontal face detector.
+   A frontal face as a pattern is pretty distinct with respect to other
+   patterns occurring in the world (i.e. image "background"). This is not so
+   for upper, lower and especially full bodies, because they have to rely
+   on fragile silhouette information rather than internal (facial) features.
+   Still, we found especially the upper body detector to perform amazingly well.
+   In contrast to a face detector these detectors will also work at very low
+   image resolutions 
+
+Acknowledgements
+================
+Thanks to Martin Spengler, ETH Zurich, for providing the demo movie.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>23</height>
+  <width>19</width>
+  <stageParams>
+    <maxWeakCount>89</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>27</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>17</maxWeakCount>
+      <stageThreshold>-1.4308550357818604e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 -1.6869869083166122e-02</internalNodes>
+          <leafValues>
+            5.4657417535781860e-01 -6.3678038120269775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 2.5349899660795927e-03</internalNodes>
+          <leafValues>
+            -3.7605491280555725e-01 3.2378101348876953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -2.4709459394216537e-02</internalNodes>
+          <leafValues>
+            -6.7979127168655396e-01 2.0501059293746948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 8.2436859607696533e-02</internalNodes>
+          <leafValues>
+            2.0588639378547668e-01 -8.4938430786132812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 -8.2128931535407901e-04</internalNodes>
+          <leafValues>
+            3.1891921162605286e-01 -4.6469458937644958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 2.3016959428787231e-02</internalNodes>
+          <leafValues>
+            1.8670299649238586e-01 -7.0330899953842163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 6.6386149264872074e-03</internalNodes>
+          <leafValues>
+            1.6370490193367004e-01 -8.4604722261428833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 7.6682120561599731e-04</internalNodes>
+          <leafValues>
+            -3.9852690696716309e-01 2.3113329708576202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 1.1731679737567902e-01</internalNodes>
+          <leafValues>
+            1.0445039719343185e-01 -8.8510942459106445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 1.5421230345964432e-02</internalNodes>
+          <leafValues>
+            -2.7859508991241455e-01 2.8921920061111450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 3.4018948674201965e-02</internalNodes>
+          <leafValues>
+            -1.4287669956684113e-01 7.7801531553268433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 3.4638870507478714e-02</internalNodes>
+          <leafValues>
+            1.8644079566001892e-01 -6.0324841737747192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -3.7503659725189209e-01</internalNodes>
+          <leafValues>
+            9.2781841754913330e-01 -1.5421600639820099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -5.6011971086263657e-02</internalNodes>
+          <leafValues>
+            -5.8591067790985107e-01 1.9547510147094727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -1.4878909569233656e-03</internalNodes>
+          <leafValues>
+            2.8139349818229675e-01 -4.1853010654449463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -1.4495699666440487e-02</internalNodes>
+          <leafValues>
+            -7.2273969650268555e-01 9.4288460910320282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 -5.6178281083703041e-03</internalNodes>
+          <leafValues>
+            -5.9551960229873657e-01 1.5202650427818298e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.1907930374145508e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 17 -3.1839120201766491e-03</internalNodes>
+          <leafValues>
+            4.0025138854980469e-01 -6.8473160266876221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 3.5989920143038034e-03</internalNodes>
+          <leafValues>
+            -5.1895952224731445e-01 3.0101141333580017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 1.8804630264639854e-02</internalNodes>
+          <leafValues>
+            1.5554919838905334e-01 -8.0477172136306763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 5.2497140131890774e-03</internalNodes>
+          <leafValues>
+            1.3780809938907623e-01 -6.0767507553100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -1.4204799663275480e-03</internalNodes>
+          <leafValues>
+            3.2319429516792297e-01 -4.3407461047172546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -2.5174349546432495e-02</internalNodes>
+          <leafValues>
+            -7.0780879259109497e-01 9.3106329441070557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 3.2285219058394432e-03</internalNodes>
+          <leafValues>
+            -3.2510471343994141e-01 3.3571699261665344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 9.4993412494659424e-02</internalNodes>
+          <leafValues>
+            8.2439087331295013e-02 -8.7549537420272827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -6.5919090993702412e-03</internalNodes>
+          <leafValues>
+            -7.3804199695587158e-01 1.3853749632835388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 -1.1146620381623507e-03</internalNodes>
+          <leafValues>
+            1.7917269468307495e-01 -2.7955859899520874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 1.3349019922316074e-02</internalNodes>
+          <leafValues>
+            1.3057829439640045e-01 -6.9802671670913696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -3.5181451588869095e-02</internalNodes>
+          <leafValues>
+            4.6535360813140869e-01 -1.0698779672384262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 3.1874589622020721e-02</internalNodes>
+          <leafValues>
+            -1.3565389811992645e-01 7.9047888517379761e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>-1.3129220008850098e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 30 -1.0647430084645748e-02</internalNodes>
+          <leafValues>
+            3.8079029321670532e-01 -5.8672338724136353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -7.3214493691921234e-02</internalNodes>
+          <leafValues>
+            -7.9550951719284058e-01 1.7223259806632996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 6.0464427806437016e-03</internalNodes>
+          <leafValues>
+            1.6532160341739655e-01 -6.9376647472381592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 7.3225022060796618e-04</internalNodes>
+          <leafValues>
+            -3.3247160911560059e-01 2.3669970035552979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -1.0990080423653126e-02</internalNodes>
+          <leafValues>
+            -6.9136887788772583e-01 2.1058270335197449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -1.5282750246115029e-04</internalNodes>
+          <leafValues>
+            2.0305849611759186e-01 -4.6551659703254700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 2.4822261184453964e-04</internalNodes>
+          <leafValues>
+            -4.2122921347618103e-01 2.7335309982299805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -8.4205856546759605e-03</internalNodes>
+          <leafValues>
+            -4.3744468688964844e-01 5.8831848204135895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -3.6992791295051575e-01</internalNodes>
+          <leafValues>
+            9.1070818901062012e-01 -8.7207540869712830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 6.1259930953383446e-03</internalNodes>
+          <leafValues>
+            1.1886730045080185e-01 -1.8520170450210571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -6.0144090093672276e-03</internalNodes>
+          <leafValues>
+            -6.3057059049606323e-01 1.4577180147171021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 8.5623031482100487e-03</internalNodes>
+          <leafValues>
+            -2.9369381070137024e-01 3.2411348819732666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -1.3966850005090237e-02</internalNodes>
+          <leafValues>
+            -8.0650371313095093e-01 1.1267790198326111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 -4.1734468191862106e-02</internalNodes>
+          <leafValues>
+            7.7495330572128296e-01 -7.8866302967071533e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -2.7996799326501787e-04</internalNodes>
+          <leafValues>
+            2.7783310413360596e-01 -3.5196089744567871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 1.9588569179177284e-02</internalNodes>
+          <leafValues>
+            -6.5759636461734772e-02 5.2414137125015259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 9.2163113877177238e-03</internalNodes>
+          <leafValues>
+            -1.5525479614734650e-01 5.4835391044616699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -2.1458569914102554e-02</internalNodes>
+          <leafValues>
+            -5.2255308628082275e-01 8.2208268344402313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 3.6805770359933376e-03</internalNodes>
+          <leafValues>
+            -2.4434129893779755e-01 3.6122488975524902e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.3777279853820801e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 49 -8.3544738590717316e-03</internalNodes>
+          <leafValues>
+            2.8173181414604187e-01 -4.9728131294250488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -5.5724289268255234e-03</internalNodes>
+          <leafValues>
+            -6.5505301952362061e-01 1.9406059384346008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 -5.7714767754077911e-03</internalNodes>
+          <leafValues>
+            -6.2230938673019409e-01 2.7622398734092712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 2.2995889186859131e-02</internalNodes>
+          <leafValues>
+            1.9798569381237030e-02 -7.8324538469314575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -1.1443760013207793e-03</internalNodes>
+          <leafValues>
+            2.8108718991279602e-01 -4.8214849829673767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 -2.5917509198188782e-01</internalNodes>
+          <leafValues>
+            -6.8214958906173706e-01 -3.3729869755916297e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -3.0133039690554142e-03</internalNodes>
+          <leafValues>
+            -6.5704411268234253e-01 1.3693599402904510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 5.4540671408176422e-03</internalNodes>
+          <leafValues>
+            8.6931817233562469e-02 -7.0567971467971802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 6.6230311058461666e-03</internalNodes>
+          <leafValues>
+            1.6634289920330048e-01 -5.1772958040237427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 -1.2561669573187828e-02</internalNodes>
+          <leafValues>
+            9.0290471911430359e-02 -1.6850970685482025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 4.2890738695859909e-02</internalNodes>
+          <leafValues>
+            1.2977810204029083e-01 -5.8218061923980713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -1.3341030571609735e-03</internalNodes>
+          <leafValues>
+            1.3694329559803009e-01 -1.9437809288501740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -4.1247460991144180e-02</internalNodes>
+          <leafValues>
+            6.8543851375579834e-01 -1.3039450347423553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -9.1503392904996872e-03</internalNodes>
+          <leafValues>
+            -1.1895430088043213e-01 6.7576698958873749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -1.7151240026578307e-03</internalNodes>
+          <leafValues>
+            2.6475539803504944e-01 -3.0487450957298279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 2.0843200385570526e-01</internalNodes>
+          <leafValues>
+            1.2401489913463593e-01 -4.7014111280441284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 7.2393968701362610e-02</internalNodes>
+          <leafValues>
+            9.6924379467964172e-02 -7.7347749471664429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -1.5335980569943786e-03</internalNodes>
+          <leafValues>
+            1.7991219460964203e-01 -2.5788331031799316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 4.8640500754117966e-03</internalNodes>
+          <leafValues>
+            1.1392980068922043e-01 -5.5173867940902710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -1.6523050144314766e-03</internalNodes>
+          <leafValues>
+            1.5154689550399780e-01 -2.2901679575443268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 7.5348757207393646e-02</internalNodes>
+          <leafValues>
+            -1.4630889892578125e-01 6.8105882406234741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -8.2630068063735962e-03</internalNodes>
+          <leafValues>
+            -7.2783601284027100e-01 1.0281019657850266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -5.5124741047620773e-03</internalNodes>
+          <leafValues>
+            -6.3059347867965698e-01 9.3257799744606018e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.0618749856948853e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 72 -9.3849105760455132e-03</internalNodes>
+          <leafValues>
+            5.2500581741333008e-01 -4.3231061100959778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -1.3772470410913229e-03</internalNodes>
+          <leafValues>
+            2.0698480308055878e-01 -4.2718759179115295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 2.6320109143853188e-02</internalNodes>
+          <leafValues>
+            1.5825170278549194e-01 -6.5509521961212158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 -4.5488759875297546e-02</internalNodes>
+          <leafValues>
+            -4.9510109424591064e-01 1.7998820543289185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -4.7006201930344105e-03</internalNodes>
+          <leafValues>
+            3.3971160650253296e-01 -3.6917701363563538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -1.3270860072225332e-03</internalNodes>
+          <leafValues>
+            3.0907860398292542e-01 -1.9771750271320343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 9.3802614137530327e-03</internalNodes>
+          <leafValues>
+            9.4488449394702911e-02 -7.3198097944259644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 4.3565612286329269e-03</internalNodes>
+          <leafValues>
+            1.1520200222730637e-01 -5.4008102416992188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 8.1178937107324600e-03</internalNodes>
+          <leafValues>
+            -1.5956309437751770e-01 5.3777867555618286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -8.7829083204269409e-03</internalNodes>
+          <leafValues>
+            5.6634718179702759e-01 -1.3279379904270172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 2.1944850683212280e-02</internalNodes>
+          <leafValues>
+            1.5901289880275726e-01 -5.1751822233200073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 4.9510098993778229e-02</internalNodes>
+          <leafValues>
+            1.1067640036344528e-02 -4.9972468614578247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -2.1175360307097435e-03</internalNodes>
+          <leafValues>
+            2.6490759849548340e-01 -2.4565629661083221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.0379469953477383e-02</internalNodes>
+          <leafValues>
+            1.2624099850654602e-01 -4.0877240896224976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 2.4977258872240782e-03</internalNodes>
+          <leafValues>
+            -1.9723020493984222e-01 3.8866749405860901e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>18</maxWeakCount>
+      <stageThreshold>-9.5461457967758179e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 87 -6.1489548534154892e-03</internalNodes>
+          <leafValues>
+            4.0187481045722961e-01 -5.2397370338439941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 5.0464540719985962e-02</internalNodes>
+          <leafValues>
+            1.3049679994583130e-01 -5.8651441335678101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 -5.5906269699335098e-02</internalNodes>
+          <leafValues>
+            -5.1229542493820190e-01 2.4392889440059662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 1.4281509816646576e-01</internalNodes>
+          <leafValues>
+            -1.5180160291492939e-02 -6.9593918323516846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 4.1162770241498947e-02</internalNodes>
+          <leafValues>
+            1.3673730194568634e-01 -6.4158838987350464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 -1.6468750312924385e-02</internalNodes>
+          <leafValues>
+            2.6339039206504822e-01 -2.2083680331707001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 2.4763140827417374e-02</internalNodes>
+          <leafValues>
+            1.0897739976644516e-01 -6.5213900804519653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 4.3008858337998390e-03</internalNodes>
+          <leafValues>
+            -1.8299630284309387e-01 4.3614229559898376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 3.4035290591418743e-03</internalNodes>
+          <leafValues>
+            -2.4363580346107483e-01 2.8224369883537292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -2.2210620343685150e-02</internalNodes>
+          <leafValues>
+            -5.4645758867263794e-01 1.3542969524860382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -2.6968019083142281e-02</internalNodes>
+          <leafValues>
+            6.5300947427749634e-01 -1.4297309517860413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -3.4927908331155777e-02</internalNodes>
+          <leafValues>
+            -5.2346628904342651e-01 1.0084570199251175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 3.6263581365346909e-02</internalNodes>
+          <leafValues>
+            1.5110149979591370e-01 -5.4185849428176880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -3.8526788353919983e-02</internalNodes>
+          <leafValues>
+            -8.6942279338836670e-01 3.7176769226789474e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 2.5399168953299522e-03</internalNodes>
+          <leafValues>
+            -2.6125881075859070e-01 2.7278441190719604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 -1.2931150384247303e-02</internalNodes>
+          <leafValues>
+            -4.9501579999923706e-01 9.1383516788482666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 1.1981350369751453e-02</internalNodes>
+          <leafValues>
+            -1.2059610337018967e-01 6.3848638534545898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 -7.4320413172245026e-02</internalNodes>
+          <leafValues>
+            4.6591779589653015e-01 -4.0265668183565140e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>14</maxWeakCount>
+      <stageThreshold>-1.1777880191802979e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 105 -6.9070039317011833e-03</internalNodes>
+          <leafValues>
+            4.3197679519653320e-01 -5.1717847585678101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 -8.1628039479255676e-03</internalNodes>
+          <leafValues>
+            2.7116540074348450e-01 -3.2803410291671753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 1.8852509558200836e-02</internalNodes>
+          <leafValues>
+            1.5548799932003021e-01 -5.5243927240371704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 3.4079391509294510e-02</internalNodes>
+          <leafValues>
+            1.5272259712219238e-01 -6.5318012237548828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -3.2038250938057899e-03</internalNodes>
+          <leafValues>
+            3.4725460410118103e-01 -2.7734228968620300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 2.1410689223557711e-03</internalNodes>
+          <leafValues>
+            -6.8888276815414429e-02 2.4079489707946777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 1.4620450139045715e-01</internalNodes>
+          <leafValues>
+            1.5766879916191101e-01 -5.4515862464904785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -6.2386798672378063e-03</internalNodes>
+          <leafValues>
+            3.2899579405784607e-01 -1.6970640420913696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 7.7623138204216957e-03</internalNodes>
+          <leafValues>
+            1.6352510452270508e-01 -5.1879328489303589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 3.7800080608576536e-03</internalNodes>
+          <leafValues>
+            -1.8464370071887970e-01 4.8660078644752502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 2.2303969599306583e-03</internalNodes>
+          <leafValues>
+            -1.7057199776172638e-01 4.7744798660278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 2.4544890038669109e-03</internalNodes>
+          <leafValues>
+            -3.3550649881362915e-01 2.5369268655776978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 -2.1707419306039810e-02</internalNodes>
+          <leafValues>
+            -4.8321890830993652e-01 1.6075029969215393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 1.7421970143914223e-02</internalNodes>
+          <leafValues>
+            7.9877912998199463e-02 -7.5137257575988770e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>34</maxWeakCount>
+      <stageThreshold>-1.2834340333938599e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 119 8.8802073150873184e-03</internalNodes>
+          <leafValues>
+            -4.4682410359382629e-01 2.6062530279159546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -3.0198058811947703e-04</internalNodes>
+          <leafValues>
+            1.5258400142192841e-01 -3.5206508636474609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 6.7998501472175121e-03</internalNodes>
+          <leafValues>
+            1.2259320169687271e-01 -6.8427437543869019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 2.7802670374512672e-03</internalNodes>
+          <leafValues>
+            -3.3681631088256836e-01 1.8518559634685516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 -1.1553820222616196e-02</internalNodes>
+          <leafValues>
+            -6.9871348142623901e-01 1.3079600036144257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -2.6563290506601334e-02</internalNodes>
+          <leafValues>
+            -7.0277881622314453e-01 1.7791330814361572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 -2.5158381322398782e-04</internalNodes>
+          <leafValues>
+            2.4779480695724487e-01 -3.9787930250167847e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 3.5748310387134552e-02</internalNodes>
+          <leafValues>
+            -3.8043439388275146e-02 4.7976261377334595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -1.9973930902779102e-03</internalNodes>
+          <leafValues>
+            2.5774869322776794e-01 -3.1990098953247070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -1.1007110029459000e-01</internalNodes>
+          <leafValues>
+            -4.9102869629859924e-01 2.3104630410671234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 -2.2225650027394295e-03</internalNodes>
+          <leafValues>
+            2.3825299739837646e-01 -2.8415530920028687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 -7.7874241396784782e-03</internalNodes>
+          <leafValues>
+            -3.8951370120048523e-01 5.5762890726327896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 5.6415859609842300e-02</internalNodes>
+          <leafValues>
+            -9.3521721661090851e-02 7.2561162710189819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -3.5978010855615139e-03</internalNodes>
+          <leafValues>
+            1.9452190399169922e-01 -1.9651280343532562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -7.2716898284852505e-03</internalNodes>
+          <leafValues>
+            3.4169870615005493e-01 -2.2851559519767761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 7.1941758506000042e-03</internalNodes>
+          <leafValues>
+            7.2148866951465607e-02 -4.5313501358032227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 -4.1034761816263199e-03</internalNodes>
+          <leafValues>
+            -5.1336747407913208e-01 1.3323569297790527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -3.4210970625281334e-03</internalNodes>
+          <leafValues>
+            -4.2383781075477600e-01 8.4852807223796844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 4.1890922002494335e-03</internalNodes>
+          <leafValues>
+            -1.3398550450801849e-01 4.3749558925628662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.1827970156446099e-03</internalNodes>
+          <leafValues>
+            -2.9739010334014893e-01 2.2126840054988861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -4.1196551173925400e-02</internalNodes>
+          <leafValues>
+            -5.0735759735107422e-01 1.3243959844112396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 2.9593890067189932e-03</internalNodes>
+          <leafValues>
+            -1.4052620530128479e-01 6.1360880732536316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -5.0226859748363495e-03</internalNodes>
+          <leafValues>
+            -4.7495970129966736e-01 1.2069150060415268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -1.5097860246896744e-02</internalNodes>
+          <leafValues>
+            2.7555391192436218e-01 -5.3780451416969299e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -2.7190970256924629e-02</internalNodes>
+          <leafValues>
+            7.5995457172393799e-01 -7.4793189764022827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 1.9893879070878029e-02</internalNodes>
+          <leafValues>
+            -6.7238640040159225e-03 7.3972767591476440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 7.7208830043673515e-03</internalNodes>
+          <leafValues>
+            9.3071162700653076e-02 -6.5780252218246460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -1.1565990280359983e-03</internalNodes>
+          <leafValues>
+            9.4645917415618896e-02 -1.6407909989356995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 2.6069190353155136e-03</internalNodes>
+          <leafValues>
+            -1.3877980411052704e-01 4.7349870204925537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -5.3586110472679138e-02</internalNodes>
+          <leafValues>
+            -3.7349641323089600e-01 2.5728559121489525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 1.5184599906206131e-03</internalNodes>
+          <leafValues>
+            -2.2478710114955902e-01 2.3574599623680115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -3.7061560899019241e-02</internalNodes>
+          <leafValues>
+            -6.1827117204666138e-01 8.2348063588142395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 -2.6311799883842468e-02</internalNodes>
+          <leafValues>
+            -6.0057657957077026e-01 7.7768869698047638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -8.7947428226470947e-02</internalNodes>
+          <leafValues>
+            3.8841038942337036e-01 -8.1545598804950714e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>20</maxWeakCount>
+      <stageThreshold>-1.2891789674758911e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 153 -2.9038030654191971e-02</internalNodes>
+          <leafValues>
+            5.0635957717895508e-01 -4.3462699651718140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 3.9044669829308987e-03</internalNodes>
+          <leafValues>
+            -1.9009789824485779e-01 5.1840317249298096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 2.9162769205868244e-03</internalNodes>
+          <leafValues>
+            -3.4351310133934021e-01 2.4016310274600983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -8.9670084416866302e-03</internalNodes>
+          <leafValues>
+            -4.2667150497436523e-01 1.2316550314426422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -2.4935540277510881e-03</internalNodes>
+          <leafValues>
+            3.6086550354957581e-01 -1.8381460011005402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -4.8912568017840385e-03</internalNodes>
+          <leafValues>
+            -6.4749848842620850e-01 1.0856709629297256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -4.0970719419419765e-03</internalNodes>
+          <leafValues>
+            2.2143830358982086e-01 -3.1505578756332397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 4.3956499546766281e-02</internalNodes>
+          <leafValues>
+            -1.0780169814825058e-01 7.1893501281738281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 1.9277370302006602e-03</internalNodes>
+          <leafValues>
+            2.0247739553451538e-01 -4.0381088852882385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 9.4976946711540222e-03</internalNodes>
+          <leafValues>
+            4.3494019657373428e-02 -2.9908061027526855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 3.5389279946684837e-03</internalNodes>
+          <leafValues>
+            -1.5109489858150482e-01 5.1864242553710938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -2.2064079530537128e-03</internalNodes>
+          <leafValues>
+            2.3006440699100494e-01 -3.3191001415252686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 3.9085410535335541e-03</internalNodes>
+          <leafValues>
+            -3.4253311157226562e-01 2.2951880097389221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 2.6973709464073181e-03</internalNodes>
+          <leafValues>
+            1.1976680159568787e-01 -3.5321989655494690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 -2.1321459207683802e-03</internalNodes>
+          <leafValues>
+            1.8206289410591125e-01 -2.8434100747108459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 2.6955150533467531e-03</internalNodes>
+          <leafValues>
+            7.4593842029571533e-02 -3.0896648764610291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 -6.0222679749131203e-03</internalNodes>
+          <leafValues>
+            1.8041500449180603e-01 -2.7531668543815613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 -8.9143458753824234e-03</internalNodes>
+          <leafValues>
+            2.4166099727153778e-01 -1.4506129920482635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 2.3474939167499542e-02</internalNodes>
+          <leafValues>
+            -1.2354619801044464e-01 6.5625041723251343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 -5.6602950207889080e-03</internalNodes>
+          <leafValues>
+            -3.3785250782966614e-01 1.1194559931755066e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>20</maxWeakCount>
+      <stageThreshold>-1.0202569961547852e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 173 -6.9699093699455261e-02</internalNodes>
+          <leafValues>
+            5.0786459445953369e-01 -4.7562688589096069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 2.1672779694199562e-02</internalNodes>
+          <leafValues>
+            -2.9134199023246765e-01 3.4561529755592346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -4.7600260004401207e-03</internalNodes>
+          <leafValues>
+            3.6477440595626831e-01 -1.9551509618759155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -4.6418169513344765e-03</internalNodes>
+          <leafValues>
+            -5.6445592641830444e-01 9.8486669361591339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -6.0006938874721527e-03</internalNodes>
+          <leafValues>
+            -6.3645982742309570e-01 1.4379170536994934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 1.9073469564318657e-02</internalNodes>
+          <leafValues>
+            -3.4218288958072662e-02 5.5043292045593262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 4.7993380576372147e-02</internalNodes>
+          <leafValues>
+            -8.5889510810375214e-02 7.6790231466293335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -3.6511209327727556e-03</internalNodes>
+          <leafValues>
+            2.0186069607734680e-01 -2.9832679033279419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 -1.4485770370811224e-03</internalNodes>
+          <leafValues>
+            -5.1293247938156128e-01 1.3695690035820007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 -3.3748829737305641e-03</internalNodes>
+          <leafValues>
+            -4.0975129604339600e-01 1.1581440269947052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 2.3586750030517578e-03</internalNodes>
+          <leafValues>
+            1.7582429945468903e-01 -4.5439630746841431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -2.2074829787015915e-02</internalNodes>
+          <leafValues>
+            4.6775639057159424e-01 -4.6358831226825714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 7.0953248068690300e-03</internalNodes>
+          <leafValues>
+            -3.2100531458854675e-01 2.2119350731372833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 -2.0119780674576759e-03</internalNodes>
+          <leafValues>
+            5.4601740092039108e-02 -9.7853101789951324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 4.9847508780658245e-03</internalNodes>
+          <leafValues>
+            -1.3063269853591919e-01 5.2815079689025879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -5.3485459648072720e-03</internalNodes>
+          <leafValues>
+            -4.2115539312362671e-01 1.1927159875631332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 2.5243330746889114e-03</internalNodes>
+          <leafValues>
+            1.2105660140514374e-01 -4.5177119970321655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -2.4893151130527258e-03</internalNodes>
+          <leafValues>
+            1.2249600142240524e-01 -1.1200980097055435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 4.3740491382777691e-03</internalNodes>
+          <leafValues>
+            -1.0549320280551910e-01 6.0806149244308472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -7.3214988224208355e-03</internalNodes>
+          <leafValues>
+            4.7615110874176025e-01 -6.8390920758247375e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>24</maxWeakCount>
+      <stageThreshold>-1.0336159467697144e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 193 -4.2286239564418793e-02</internalNodes>
+          <leafValues>
+            3.6749860644340515e-01 -4.3680980801582336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 3.8884699344635010e-02</internalNodes>
+          <leafValues>
+            -3.5438889265060425e-01 2.7009218931198120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 1.5983959892764688e-03</internalNodes>
+          <leafValues>
+            -3.2200628519058228e-01 2.5404900312423706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 3.9249849505722523e-03</internalNodes>
+          <leafValues>
+            1.6477300226688385e-01 -4.2043879628181458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 1.5850430354475975e-03</internalNodes>
+          <leafValues>
+            -2.5503370165824890e-01 3.1559389829635620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 -3.4282119013369083e-03</internalNodes>
+          <leafValues>
+            -4.0074288845062256e-01 1.1993350088596344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -3.3538821153342724e-03</internalNodes>
+          <leafValues>
+            3.0459630489349365e-01 -2.2311030328273773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -6.7664748057723045e-03</internalNodes>
+          <leafValues>
+            3.2396519184112549e-01 -9.2932380735874176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -6.7180307814851403e-04</internalNodes>
+          <leafValues>
+            -3.2457518577575684e-01 2.1808999776840210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 2.8931829147040844e-03</internalNodes>
+          <leafValues>
+            1.2530609965324402e-01 -4.8582470417022705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -3.3115309197455645e-03</internalNodes>
+          <leafValues>
+            4.0534108877182007e-01 -2.2432869672775269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 8.8509041815996170e-03</internalNodes>
+          <leafValues>
+            1.2155570089817047e-01 -6.0243481397628784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 5.4662628099322319e-03</internalNodes>
+          <leafValues>
+            -1.6978119313716888e-01 4.0752619504928589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 4.7559391707181931e-02</internalNodes>
+          <leafValues>
+            -8.1737041473388672e-02 6.9865119457244873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 3.1745019368827343e-03</internalNodes>
+          <leafValues>
+            1.7419810593128204e-01 -3.7237030267715454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 -5.1520839333534241e-03</internalNodes>
+          <leafValues>
+            2.7799358963966370e-01 -2.5311779975891113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -4.8141111619770527e-03</internalNodes>
+          <leafValues>
+            -5.8466029167175293e-01 1.5894299745559692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 2.1967150270938873e-02</internalNodes>
+          <leafValues>
+            -1.0052759945392609e-01 4.7374871373176575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -6.0128211043775082e-03</internalNodes>
+          <leafValues>
+            1.9820199906826019e-01 -4.2172819375991821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 4.5052049681544304e-03</internalNodes>
+          <leafValues>
+            1.7064809799194336e-02 -4.8947790265083313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 -1.3302109437063336e-03</internalNodes>
+          <leafValues>
+            1.8670339882373810e-01 -2.9437661170959473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -7.3667510878294706e-04</internalNodes>
+          <leafValues>
+            -1.4788800477981567e-01 1.0121300071477890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 -1.4602739829570055e-03</internalNodes>
+          <leafValues>
+            -4.3107959628105164e-01 1.2479860335588455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 3.4185629338026047e-02</internalNodes>
+          <leafValues>
+            -5.7933650910854340e-02 5.4917758703231812e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>-1.0450899600982666e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 217 3.0665110796689987e-02</internalNodes>
+          <leafValues>
+            -3.9953279495239258e-01 3.3617529273033142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 2.8893710114061832e-03</internalNodes>
+          <leafValues>
+            -3.8745269179344177e-01 3.0567520856857300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -1.1876110220327973e-03</internalNodes>
+          <leafValues>
+            2.2150239348411560e-01 -2.9632321000099182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 4.0173018351197243e-03</internalNodes>
+          <leafValues>
+            1.3102529942989349e-01 -4.8803418874740601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 4.4870697893202305e-03</internalNodes>
+          <leafValues>
+            -3.3282509446144104e-01 1.6376070678234100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 3.2539520412683487e-02</internalNodes>
+          <leafValues>
+            -5.9164509177207947e-02 6.9953370094299316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 -8.9682880789041519e-03</internalNodes>
+          <leafValues>
+            -5.6289541721343994e-01 1.1756320297718048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -6.1743397964164615e-04</internalNodes>
+          <leafValues>
+            1.5408250689506531e-01 -2.7350011467933655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -3.1031211256049573e-04</internalNodes>
+          <leafValues>
+            1.8013550341129303e-01 -3.7572589516639709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 2.8775030747056007e-02</internalNodes>
+          <leafValues>
+            -3.4200929105281830e-02 2.7645361423492432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -6.1647972324863076e-04</internalNodes>
+          <leafValues>
+            1.7953120172023773e-01 -3.5178318619728088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 2.1818219684064388e-03</internalNodes>
+          <leafValues>
+            -1.4532999694347382e-01 1.4900140464305878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 -2.4263889063149691e-03</internalNodes>
+          <leafValues>
+            -4.6981298923492432e-01 9.5262229442596436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 2.5438209995627403e-02</internalNodes>
+          <leafValues>
+            -2.1531460806727409e-02 3.3266928791999817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 7.9593079863116145e-04</internalNodes>
+          <leafValues>
+            1.2254969775676727e-01 -3.5679769515991211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 5.6763447355479002e-04</internalNodes>
+          <leafValues>
+            -1.3694189488887787e-01 1.0818839818239212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 8.7481308728456497e-03</internalNodes>
+          <leafValues>
+            -9.0849868953227997e-02 5.0112378597259521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -4.7468831762671471e-03</internalNodes>
+          <leafValues>
+            1.1629249900579453e-01 -1.4651729725301266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 3.0644210055470467e-03</internalNodes>
+          <leafValues>
+            -2.2739639878273010e-01 2.7780678868293762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 3.1514191068708897e-03</internalNodes>
+          <leafValues>
+            3.5710681229829788e-02 -3.2296779751777649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -3.8335900753736496e-03</internalNodes>
+          <leafValues>
+            -4.8395419120788574e-01 9.2689603567123413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 -3.6972409579902887e-03</internalNodes>
+          <leafValues>
+            1.6351610422134399e-01 -1.4657320082187653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 6.7644561640918255e-03</internalNodes>
+          <leafValues>
+            8.0342940986156464e-02 -5.0272989273071289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 5.7455507339909673e-04</internalNodes>
+          <leafValues>
+            -1.9531010091304779e-01 1.2394949793815613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 1.0008309967815876e-02</internalNodes>
+          <leafValues>
+            -1.5030139684677124e-01 2.7990019321441650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -7.2150952182710171e-03</internalNodes>
+          <leafValues>
+            1.6882060468196869e-01 -1.2279219925403595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 1.1310850270092487e-02</internalNodes>
+          <leafValues>
+            -9.6786908805370331e-02 6.4601618051528931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 1.0049899667501450e-01</internalNodes>
+          <leafValues>
+            2.0610159263014793e-02 -9.9988579750061035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 1.3250860385596752e-02</internalNodes>
+          <leafValues>
+            9.3147717416286469e-02 -4.8156800866127014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 -3.9085310697555542e-01</internalNodes>
+          <leafValues>
+            7.1057820320129395e-01 -1.6548840329051018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 2.4332199245691299e-02</internalNodes>
+          <leafValues>
+            1.4528210461139679e-01 -2.8366720676422119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 1.0354409459978342e-03</internalNodes>
+          <leafValues>
+            -2.0017370581626892e-01 1.8794250488281250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -7.1747899055480957e-01</internalNodes>
+          <leafValues>
+            6.6637128591537476e-01 -5.2656259387731552e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>42</maxWeakCount>
+      <stageThreshold>-1.0599969625473022e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 250 1.9620559178292751e-03</internalNodes>
+          <leafValues>
+            -4.1077700257301331e-01 1.8896859884262085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 2.1331369876861572e-02</internalNodes>
+          <leafValues>
+            9.2599019408226013e-02 -3.9660450816154480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 -2.3037450388073921e-02</internalNodes>
+          <leafValues>
+            -7.2293937206268311e-01 9.6411719918251038e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 -5.0521228462457657e-02</internalNodes>
+          <leafValues>
+            1.8302009999752045e-01 -1.9482779502868652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 2.5330919772386551e-02</internalNodes>
+          <leafValues>
+            1.0334759950637817e-01 -5.8018290996551514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -4.3120220652781427e-04</internalNodes>
+          <leafValues>
+            1.3374519348144531e-01 -2.1300980448722839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 -1.4295669643615838e-05</internalNodes>
+          <leafValues>
+            1.8420490622520447e-01 -3.0300238728523254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -2.8645719867199659e-03</internalNodes>
+          <leafValues>
+            1.7371790111064911e-01 -2.1612820029258728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 1.0322510264813900e-02</internalNodes>
+          <leafValues>
+            1.1071330308914185e-01 -4.2402949929237366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 1.3879509642720222e-02</internalNodes>
+          <leafValues>
+            -1.0993299633264542e-01 5.5458897352218628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 -1.7010340234264731e-03</internalNodes>
+          <leafValues>
+            -3.1409528851509094e-01 1.5474779903888702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 -2.7375848731026053e-04</internalNodes>
+          <leafValues>
+            1.4674690365791321e-01 -1.2817619740962982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 3.9977379143238068e-02</internalNodes>
+          <leafValues>
+            -6.3540339469909668e-02 6.0685801506042480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -1.2663399800658226e-02</internalNodes>
+          <leafValues>
+            1.0982260107994080e-01 -1.2707209587097168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 1.0186760127544403e-01</internalNodes>
+          <leafValues>
+            8.8505871593952179e-02 -5.7165622711181641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 -1.0695089586079121e-03</internalNodes>
+          <leafValues>
+            3.4594889730215073e-02 -9.9618308246135712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 -3.4467370714992285e-03</internalNodes>
+          <leafValues>
+            2.2871519625186920e-01 -1.9664469361305237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 -1.2329400330781937e-01</internalNodes>
+          <leafValues>
+            -1.0825649648904800e-01 2.4728389456868172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -5.8832589536905289e-02</internalNodes>
+          <leafValues>
+            5.5791580677032471e-01 -7.7630676329135895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 9.7795920446515083e-03</internalNodes>
+          <leafValues>
+            9.4951488077640533e-02 -5.3767371177673340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 1.1116569861769676e-02</internalNodes>
+          <leafValues>
+            -8.9288607239723206e-02 4.6695429086685181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -1.5398260205984116e-02</internalNodes>
+          <leafValues>
+            9.0432487428188324e-02 -1.2233799695968628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 5.8570769615471363e-03</internalNodes>
+          <leafValues>
+            1.0859709978103638e-01 -4.0961760282516479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 6.6174753010272980e-02</internalNodes>
+          <leafValues>
+            -4.4282642193138599e-03 -8.8055539131164551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 -1.0636489838361740e-02</internalNodes>
+          <leafValues>
+            -4.4541570544242859e-01 1.0953740030527115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 -3.1363599002361298e-02</internalNodes>
+          <leafValues>
+            8.0546891689300537e-01 -4.9883890897035599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 9.8021561279892921e-04</internalNodes>
+          <leafValues>
+            -2.3428329825401306e-01 1.6934409737586975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 5.3463829681277275e-03</internalNodes>
+          <leafValues>
+            -1.0729180276393890e-01 2.5447541475296021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 -5.1919990219175816e-03</internalNodes>
+          <leafValues>
+            -5.1496618986129761e-01 8.5118137300014496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 1.8721649423241615e-02</internalNodes>
+          <leafValues>
+            -8.4052212536334991e-02 4.7836899757385254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 3.7875440903007984e-03</internalNodes>
+          <leafValues>
+            -2.3145659267902374e-01 1.6052989661693573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 6.8765478208661079e-03</internalNodes>
+          <leafValues>
+            9.6559382975101471e-02 -2.3832960426807404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -5.4661519825458527e-03</internalNodes>
+          <leafValues>
+            -3.7871730327606201e-01 8.7851487100124359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 -1.5829449519515038e-02</internalNodes>
+          <leafValues>
+            5.2159512042999268e-01 -7.3916867375373840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 1.2771990150213242e-02</internalNodes>
+          <leafValues>
+            1.0658729821443558e-01 -3.2850459218025208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 4.7000780701637268e-02</internalNodes>
+          <leafValues>
+            -2.9548000544309616e-02 4.8469349741935730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 1.1224800255149603e-03</internalNodes>
+          <leafValues>
+            -2.1395659446716309e-01 1.5407760441303253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -1.0136750061064959e-03</internalNodes>
+          <leafValues>
+            2.3574739694595337e-01 -1.4536799490451813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 5.2841319702565670e-03</internalNodes>
+          <leafValues>
+            8.0536216497421265e-02 -3.6417248845100403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -1.7608689144253731e-02</internalNodes>
+          <leafValues>
+            5.3858822584152222e-01 -3.5741850733757019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 3.4710608422756195e-02</internalNodes>
+          <leafValues>
+            -4.3261460959911346e-02 7.7817600965499878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 1.6450349241495132e-02</internalNodes>
+          <leafValues>
+            4.1815090924501419e-02 -3.4912678599357605e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>-1.0216469764709473e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 292 -1.7846419941633940e-03</internalNodes>
+          <leafValues>
+            2.2014810144901276e-01 -3.6912658810615540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -6.1350408941507339e-04</internalNodes>
+          <leafValues>
+            -3.0695998668670654e-01 9.7717791795730591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -2.5726810563355684e-03</internalNodes>
+          <leafValues>
+            -3.7789058685302734e-01 1.7042149603366852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 8.8661757763475180e-04</internalNodes>
+          <leafValues>
+            -3.7929078936576843e-01 9.3289971351623535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 3.5716239362955093e-02</internalNodes>
+          <leafValues>
+            7.3169313371181488e-02 -6.1792898178100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 3.5162840038537979e-02</internalNodes>
+          <leafValues>
+            -1.2328250333666801e-02 4.4894638657569885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -5.8216741308569908e-03</internalNodes>
+          <leafValues>
+            -4.9501991271972656e-01 8.8005952537059784e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -7.7909301035106182e-04</internalNodes>
+          <leafValues>
+            1.1154119670391083e-01 -2.8316551446914673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -6.8164491094648838e-03</internalNodes>
+          <leafValues>
+            1.8434180319309235e-01 -2.3727069795131683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 9.0218139812350273e-03</internalNodes>
+          <leafValues>
+            -5.3773559629917145e-02 2.6174989342689514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 -6.7481878213584423e-03</internalNodes>
+          <leafValues>
+            -5.0475108623504639e-01 7.6614417135715485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 7.5771231204271317e-03</internalNodes>
+          <leafValues>
+            -1.1926110088825226e-01 3.4210419654846191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -4.6335519291460514e-03</internalNodes>
+          <leafValues>
+            -4.9088281393051147e-01 6.9542020559310913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 4.1346959769725800e-03</internalNodes>
+          <leafValues>
+            -8.1591427326202393e-02 4.7879660129547119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 -9.8444558680057526e-03</internalNodes>
+          <leafValues>
+            2.0124210417270660e-01 -2.3769280314445496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -3.4897070378065109e-02</internalNodes>
+          <leafValues>
+            -9.1024678945541382e-01 1.8579540774226189e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 -3.5042490344494581e-04</internalNodes>
+          <leafValues>
+            1.2479469925165176e-01 -3.0717149376869202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 -9.4668623059988022e-03</internalNodes>
+          <leafValues>
+            1.1332949995994568e-01 -1.6115890443325043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 2.2053409367799759e-02</internalNodes>
+          <leafValues>
+            -7.9784400761127472e-02 6.0739010572433472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 -7.2947797889355570e-05</internalNodes>
+          <leafValues>
+            1.4449119567871094e-01 -1.3706150650978088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -7.5134839862585068e-03</internalNodes>
+          <leafValues>
+            -3.0744421482086182e-01 1.0279080271720886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 1.0311939753592014e-02</internalNodes>
+          <leafValues>
+            -7.0246197283267975e-02 4.8307010531425476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 9.4670448452234268e-03</internalNodes>
+          <leafValues>
+            7.0281803607940674e-02 -4.7069519758224487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -3.0116239562630653e-02</internalNodes>
+          <leafValues>
+            5.2378559112548828e-01 -3.7109669297933578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -1.2667849659919739e-02</internalNodes>
+          <leafValues>
+            -6.0825890302658081e-01 5.0444670021533966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 2.2987429983913898e-03</internalNodes>
+          <leafValues>
+            -1.1808679997920990e-01 1.7393890023231506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 2.5533209554851055e-03</internalNodes>
+          <leafValues>
+            -1.6625979542732239e-01 1.9768959283828735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -3.3218199014663696e-01</internalNodes>
+          <leafValues>
+            -9.5407789945602417e-01 4.1291080415248871e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 5.4485369473695755e-03</internalNodes>
+          <leafValues>
+            -9.1220542788505554e-02 3.9834749698638916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 4.7633191570639610e-03</internalNodes>
+          <leafValues>
+            -1.2069889903068542e-01 1.6169339418411255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 4.4371229596436024e-03</internalNodes>
+          <leafValues>
+            8.5928186774253845e-02 -4.4427189230918884e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 2.7019889093935490e-03</internalNodes>
+          <leafValues>
+            -1.9511219859123230e-01 7.1141660213470459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -1.4219670556485653e-03</internalNodes>
+          <leafValues>
+            1.9089500606060028e-01 -1.8880489468574524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 -6.9531630724668503e-03</internalNodes>
+          <leafValues>
+            -2.6191520690917969e-01 7.7488146722316742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -2.6554360985755920e-01</internalNodes>
+          <leafValues>
+            4.7893580794334412e-01 -7.8830257058143616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 5.4960828274488449e-03</internalNodes>
+          <leafValues>
+            6.4748808741569519e-02 -4.0898790955543518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 1.6060929745435715e-02</internalNodes>
+          <leafValues>
+            9.4868503510951996e-02 -3.5040768980979919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 -3.5279421135783195e-03</internalNodes>
+          <leafValues>
+            2.2704540193080902e-01 -1.5011039376258850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 1.5189720317721367e-02</internalNodes>
+          <leafValues>
+            -8.6033642292022705e-02 5.0375241041183472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 9.8117031157016754e-03</internalNodes>
+          <leafValues>
+            9.1945856809616089e-02 -2.7134710550308228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 -8.9835934340953827e-03</internalNodes>
+          <leafValues>
+            -3.5721930861473083e-01 1.1564330011606216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 2.5472430512309074e-02</internalNodes>
+          <leafValues>
+            -3.8861878216266632e-02 5.0707322359085083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 1.3594819465652108e-03</internalNodes>
+          <leafValues>
+            -1.5127420425415039e-01 2.3332439363002777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 1.4673129655420780e-02</internalNodes>
+          <leafValues>
+            7.6386481523513794e-02 -4.3126261234283447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 -2.1757239475846291e-02</internalNodes>
+          <leafValues>
+            6.0306608676910400e-01 -5.7926669716835022e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>49</maxWeakCount>
+      <stageThreshold>-1.0149190425872803e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 337 -1.9122850149869919e-02</internalNodes>
+          <leafValues>
+            2.1423059701919556e-01 -4.0178310871124268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -4.0749661275185645e-04</internalNodes>
+          <leafValues>
+            1.0837800055742264e-01 -9.7847007215023041e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 1.8419560045003891e-02</internalNodes>
+          <leafValues>
+            9.4817012548446655e-02 -4.4825899600982666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 -3.0946850893087685e-04</internalNodes>
+          <leafValues>
+            1.1567220091819763e-01 -6.9291338324546814e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 2.4416830390691757e-02</internalNodes>
+          <leafValues>
+            -2.6403778791427612e-01 1.4588509500026703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 3.9483308792114258e-03</internalNodes>
+          <leafValues>
+            7.8703567385673523e-02 -3.9770650863647461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 1.5498059801757336e-02</internalNodes>
+          <leafValues>
+            -6.8623371422290802e-02 6.3598757982254028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 1.0397369973361492e-02</internalNodes>
+          <leafValues>
+            5.3116258233785629e-02 -2.4757599830627441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 1.0350650409236550e-03</internalNodes>
+          <leafValues>
+            -2.2953610122203827e-01 2.1623679995536804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -6.9717521546408534e-04</internalNodes>
+          <leafValues>
+            1.6330949962139130e-01 -2.7930000424385071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 1.1055100476369262e-03</internalNodes>
+          <leafValues>
+            -2.6721170544624329e-01 1.3809490203857422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 1.8128760159015656e-02</internalNodes>
+          <leafValues>
+            7.8602522611618042e-02 -3.3748328685760498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 -1.4303029747679830e-03</internalNodes>
+          <leafValues>
+            1.5668049454689026e-01 -2.5422498583793640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 1.0650220327079296e-02</internalNodes>
+          <leafValues>
+            -4.1638601571321487e-02 3.2634070515632629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 -1.0680139530450106e-03</internalNodes>
+          <leafValues>
+            1.7996980249881744e-01 -2.0673060417175293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -8.0095082521438599e-03</internalNodes>
+          <leafValues>
+            -2.8778979182243347e-01 7.5492449104785919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 -1.1857559904456139e-02</internalNodes>
+          <leafValues>
+            -5.5485212802886963e-01 4.7465000301599503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -1.9440150260925293e-01</internalNodes>
+          <leafValues>
+            4.9564599990844727e-01 -6.8522267043590546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 1.2786169536411762e-02</internalNodes>
+          <leafValues>
+            -5.8201011270284653e-02 5.1194858551025391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 1.1360739590600133e-03</internalNodes>
+          <leafValues>
+            -2.1216529607772827e-01 1.4639540016651154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -3.7541511119343340e-04</internalNodes>
+          <leafValues>
+            1.1406060308218002e-01 -2.7936661243438721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 6.2142009846866131e-03</internalNodes>
+          <leafValues>
+            2.8568789362907410e-02 -3.2485058903694153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 4.5166439376771450e-03</internalNodes>
+          <leafValues>
+            -9.5556378364562988e-02 3.6032339930534363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 -1.7354219453409314e-03</internalNodes>
+          <leafValues>
+            -8.0804876983165741e-02 5.3851570934057236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -6.9608418270945549e-03</internalNodes>
+          <leafValues>
+            -6.0131508111953735e-01 4.5509491115808487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 8.7833311408758163e-03</internalNodes>
+          <leafValues>
+            -9.4497971236705780e-02 3.1924161314964294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 -2.0243569742888212e-03</internalNodes>
+          <leafValues>
+            2.6737558841705322e-01 -1.1679279804229736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 5.6362948380410671e-03</internalNodes>
+          <leafValues>
+            4.6491090208292007e-02 -2.3982259631156921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 -2.1751220338046551e-03</internalNodes>
+          <leafValues>
+            -3.1831741333007812e-01 1.1634550243616104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 2.5424890220165253e-02</internalNodes>
+          <leafValues>
+            7.5600057840347290e-02 -3.7359631061553955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 3.9950129576027393e-04</internalNodes>
+          <leafValues>
+            -2.6206868886947632e-01 1.4345559477806091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -3.9724060334265232e-03</internalNodes>
+          <leafValues>
+            2.0395089685916901e-01 -1.1896310001611710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 2.4637179449200630e-03</internalNodes>
+          <leafValues>
+            -1.3687339425086975e-01 3.4098258614540100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 1.4397709630429745e-02</internalNodes>
+          <leafValues>
+            2.4846889078617096e-02 -6.5415948629379272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 -1.4848919818177819e-05</internalNodes>
+          <leafValues>
+            1.3884930312633514e-01 -2.1077479422092438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 -3.8339510560035706e-02</internalNodes>
+          <leafValues>
+            5.8668392896652222e-01 -3.6245860159397125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 -5.4605712648481131e-04</internalNodes>
+          <leafValues>
+            2.1259330213069916e-01 -1.3791069388389587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 1.3036499731242657e-02</internalNodes>
+          <leafValues>
+            5.0619971007108688e-02 -2.3150099813938141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -2.4273560848087072e-03</internalNodes>
+          <leafValues>
+            2.4302999675273895e-01 -1.1315950006246567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 -6.3351681455969810e-03</internalNodes>
+          <leafValues>
+            -3.5549488663673401e-01 9.4948403537273407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -5.7510860264301300e-02</internalNodes>
+          <leafValues>
+            4.9378138780593872e-01 -6.0664121061563492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 6.8376341369003057e-04</internalNodes>
+          <leafValues>
+            -1.9417250156402588e-01 1.4234590530395508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 8.8113872334361076e-03</internalNodes>
+          <leafValues>
+            4.7562059015035629e-02 -5.8416491746902466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 1.0788169689476490e-02</internalNodes>
+          <leafValues>
+            -4.6855889260768890e-02 1.6548010706901550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 -1.3571690069511533e-03</internalNodes>
+          <leafValues>
+            -3.2510679960250854e-01 9.4090476632118225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -1.0195979848504066e-02</internalNodes>
+          <leafValues>
+            -1.4696849882602692e-01 2.6246059685945511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 -1.2560819741338491e-03</internalNodes>
+          <leafValues>
+            2.2853380441665649e-01 -1.6265660524368286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 6.6750420955941081e-04</internalNodes>
+          <leafValues>
+            -1.3430669903755188e-01 1.3987569510936737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 2.0975170191377401e-03</internalNodes>
+          <leafValues>
+            -1.2987610697746277e-01 1.9978469610214233e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-9.3152678012847900e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 386 -3.6917610559612513e-03</internalNodes>
+          <leafValues>
+            2.2682790458202362e-01 -4.1167381405830383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -9.4609148800373077e-03</internalNodes>
+          <leafValues>
+            1.6305020451545715e-01 -2.2949010133743286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 3.3874800428748131e-03</internalNodes>
+          <leafValues>
+            7.7644690871238708e-02 -4.7465118765830994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 3.3596849534660578e-03</internalNodes>
+          <leafValues>
+            -1.4722810685634613e-01 1.3755659759044647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 -2.2649099119007587e-03</internalNodes>
+          <leafValues>
+            -2.9027861356735229e-01 1.2261869758367538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -5.5420072749257088e-04</internalNodes>
+          <leafValues>
+            1.1591990292072296e-01 -2.3066529631614685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 1.9706019666045904e-03</internalNodes>
+          <leafValues>
+            1.1808300018310547e-01 -3.7879431247711182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 1.7503080889582634e-02</internalNodes>
+          <leafValues>
+            -9.4161599874496460e-02 4.7933238744735718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -2.9575270600616932e-03</internalNodes>
+          <leafValues>
+            1.7336699366569519e-01 -3.1673321127891541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 -2.6238700747489929e-01</internalNodes>
+          <leafValues>
+            -7.4405288696289062e-01 8.9512793347239494e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 5.5493800900876522e-03</internalNodes>
+          <leafValues>
+            -2.4088740348815918e-01 1.4212040603160858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -1.4842569828033447e-02</internalNodes>
+          <leafValues>
+            5.5166311562061310e-02 -8.5363000631332397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -1.8193490803241730e-02</internalNodes>
+          <leafValues>
+            -7.5389099121093750e-01 4.4062498956918716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 -1.9381130114197731e-03</internalNodes>
+          <leafValues>
+            1.4762139320373535e-01 -1.4214770495891571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 -6.1375028453767300e-03</internalNodes>
+          <leafValues>
+            -5.4175209999084473e-01 5.2872691303491592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 1.6630079597234726e-02</internalNodes>
+          <leafValues>
+            -6.0005810111761093e-02 5.2294141054153442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -9.7470665350556374e-03</internalNodes>
+          <leafValues>
+            -3.1776770949363708e-01 9.4077728688716888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 -3.9159679412841797e-01</internalNodes>
+          <leafValues>
+            5.1550501585006714e-01 -8.6178213357925415e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 1.0457860305905342e-02</internalNodes>
+          <leafValues>
+            -5.4442230612039566e-02 5.5086338520050049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 9.2479586601257324e-02</internalNodes>
+          <leafValues>
+            9.5865959301590919e-03 -7.5205242633819580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 -1.3383329845964909e-02</internalNodes>
+          <leafValues>
+            -2.5909280776977539e-01 1.2255199998617172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 -1.9297929480671883e-02</internalNodes>
+          <leafValues>
+            -1.8686549365520477e-01 4.2670380324125290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 -1.1118740076199174e-03</internalNodes>
+          <leafValues>
+            1.4586099982261658e-01 -2.2742809355258942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 2.3209059610962868e-02</internalNodes>
+          <leafValues>
+            2.1769199520349503e-02 -2.4001930654048920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 6.9435071200132370e-03</internalNodes>
+          <leafValues>
+            -8.4814570844173431e-02 3.8388100266456604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -1.0249669849872589e-01</internalNodes>
+          <leafValues>
+            -7.0618611574172974e-01 1.2580949813127518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -1.4036430045962334e-02</internalNodes>
+          <leafValues>
+            -3.8427880406379700e-01 8.7678723037242889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 6.8071340210735798e-03</internalNodes>
+          <leafValues>
+            -7.5941346585750580e-02 7.6014332473278046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 4.8163239844143391e-03</internalNodes>
+          <leafValues>
+            -1.6402910649776459e-01 2.0124110579490662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 -3.0274710152298212e-03</internalNodes>
+          <leafValues>
+            -2.8118729591369629e-01 6.8671241402626038e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -1.6530510038137436e-03</internalNodes>
+          <leafValues>
+            2.1427379548549652e-01 -1.3038359582424164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 -3.9757499471306801e-03</internalNodes>
+          <leafValues>
+            -2.3737999796867371e-01 5.1290549337863922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 6.9589749909937382e-03</internalNodes>
+          <leafValues>
+            -1.3246279954910278e-01 2.3703409731388092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 7.2270620148628950e-04</internalNodes>
+          <leafValues>
+            5.0478070974349976e-02 -1.3544809818267822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 1.5057729557156563e-02</internalNodes>
+          <leafValues>
+            -6.6954463720321655e-02 4.5368999242782593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 6.5838429145514965e-03</internalNodes>
+          <leafValues>
+            3.9054669439792633e-02 -1.9516509771347046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -2.9128929600119591e-03</internalNodes>
+          <leafValues>
+            1.7604969441890717e-01 -1.5639689564704895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 6.4386397600173950e-01</internalNodes>
+          <leafValues>
+            -1.1777699925005436e-02 1.0000569820404053e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 5.1160277798771858e-03</internalNodes>
+          <leafValues>
+            9.5464669167995453e-02 -3.7832370400428772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 6.8325497210025787e-02</internalNodes>
+          <leafValues>
+            -3.9297499461099505e-04 -9.9986249208450317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 4.4071719050407410e-02</internalNodes>
+          <leafValues>
+            2.8716549277305603e-02 -9.0306490659713745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -1.5712520107626915e-02</internalNodes>
+          <leafValues>
+            2.4888029694557190e-01 -5.3066261112689972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 -3.9486829191446304e-03</internalNodes>
+          <leafValues>
+            -5.0214129686355591e-01 5.2089609205722809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 1.1841469677165151e-03</internalNodes>
+          <leafValues>
+            6.2122888863086700e-02 -1.6479890048503876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -1.1385709792375565e-01</internalNodes>
+          <leafValues>
+            5.6728571653366089e-01 -3.8864318281412125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 6.2493737787008286e-03</internalNodes>
+          <leafValues>
+            8.7858140468597412e-02 -2.8675949573516846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 -2.3781529162079096e-03</internalNodes>
+          <leafValues>
+            2.6684141159057617e-01 -9.3291386961936951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 -6.3620522618293762e-02</internalNodes>
+          <leafValues>
+            1.5153369307518005e-01 -1.5354029834270477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 7.9275481402873993e-03</internalNodes>
+          <leafValues>
+            8.8268518447875977e-02 -3.1872791051864624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 1.0556660126894712e-03</internalNodes>
+          <leafValues>
+            -1.0226110368967056e-01 6.0546699911355972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 9.1879200190305710e-03</internalNodes>
+          <leafValues>
+            8.0963402986526489e-02 -3.5031539201736450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 3.9727380499243736e-03</internalNodes>
+          <leafValues>
+            -1.0334850102663040e-01 2.7450188994407654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 1.7149309860542417e-03</internalNodes>
+          <leafValues>
+            -1.2329679727554321e-01 2.1561819314956665e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>55</maxWeakCount>
+      <stageThreshold>-9.3984860181808472e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 439 -1.4547890052199364e-02</internalNodes>
+          <leafValues>
+            -5.7042872905731201e-01 1.0164090245962143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 -1.2570459512062371e-04</internalNodes>
+          <leafValues>
+            7.7566891908645630e-02 -2.9524150490760803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 9.4022490084171295e-03</internalNodes>
+          <leafValues>
+            -3.2618519663810730e-01 1.3688039779663086e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -5.1469001919031143e-03</internalNodes>
+          <leafValues>
+            -2.2486360371112823e-01 1.4886389672756195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 -3.1212199246510863e-04</internalNodes>
+          <leafValues>
+            1.1287149786949158e-01 -3.2888731360435486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 1.8742609769105911e-02</internalNodes>
+          <leafValues>
+            -1.8080070614814758e-02 3.0115321278572083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 2.9675778932869434e-03</internalNodes>
+          <leafValues>
+            -2.5948849320411682e-01 1.3308060169219971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 -3.0295079573988914e-02</internalNodes>
+          <leafValues>
+            -6.0041320323944092e-01 3.3516548573970795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 6.4835487864911556e-03</internalNodes>
+          <leafValues>
+            -7.7768087387084961e-02 4.6268320083618164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 2.2889559622853994e-03</internalNodes>
+          <leafValues>
+            6.0411829501390457e-02 -1.7498730123043060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 -1.6078320331871510e-03</internalNodes>
+          <leafValues>
+            -2.9557180404663086e-01 1.5449790656566620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -2.3348669707775116e-01</internalNodes>
+          <leafValues>
+            -6.3751947879791260e-01 1.3748309575021267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 5.8999718166887760e-03</internalNodes>
+          <leafValues>
+            1.2713789939880371e-01 -3.2689490914344788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 1.2073719874024391e-02</internalNodes>
+          <leafValues>
+            1.6614260151982307e-02 -2.2707170248031616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -5.6356011191383004e-04</internalNodes>
+          <leafValues>
+            1.6879190504550934e-01 -1.9605310261249542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 1.7435080371797085e-03</internalNodes>
+          <leafValues>
+            -1.3831000030040741e-01 2.2103509306907654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 6.6066621802747250e-03</internalNodes>
+          <leafValues>
+            4.4354528188705444e-02 -6.7365241050720215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -5.9419698081910610e-03</internalNodes>
+          <leafValues>
+            1.7569009959697723e-01 -1.3697220385074615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 4.9261527601629496e-04</internalNodes>
+          <leafValues>
+            -2.1035130321979523e-01 1.3241830468177795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 -3.6582869943231344e-03</internalNodes>
+          <leafValues>
+            1.5420369803905487e-01 -1.0563220083713531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 -1.4477679505944252e-03</internalNodes>
+          <leafValues>
+            -2.8920960426330566e-01 1.4950390160083771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -1.0310580255463719e-03</internalNodes>
+          <leafValues>
+            8.8572971522808075e-02 -9.0375833213329315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 3.2927519641816616e-03</internalNodes>
+          <leafValues>
+            -1.1087729781866074e-01 3.0003741383552551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -1.6668019816279411e-03</internalNodes>
+          <leafValues>
+            -6.2054108828306198e-02 2.2652259469032288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 1.3452100101858377e-03</internalNodes>
+          <leafValues>
+            9.2012971639633179e-02 -3.5944160819053650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -1.4981569722294807e-02</internalNodes>
+          <leafValues>
+            3.6636090278625488e-01 -6.4556807279586792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 6.2536462210118771e-03</internalNodes>
+          <leafValues>
+            6.9381363689899445e-02 -4.1023838520050049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 5.0937399268150330e-02</internalNodes>
+          <leafValues>
+            1.7869930714368820e-02 -6.0524070262908936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 1.0756580159068108e-03</internalNodes>
+          <leafValues>
+            -2.3777949810028076e-01 1.4223319292068481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 -4.1086040437221527e-03</internalNodes>
+          <leafValues>
+            1.4915379881858826e-01 -1.9213069975376129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -1.3338520191609859e-02</internalNodes>
+          <leafValues>
+            -4.9711030721664429e-01 6.5755158662796021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 3.1997971236705780e-02</internalNodes>
+          <leafValues>
+            -6.4927592873573303e-02 6.6577041149139404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 -4.9686059355735779e-02</internalNodes>
+          <leafValues>
+            5.0676888227462769e-01 -6.4676910638809204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 6.0286428779363632e-03</internalNodes>
+          <leafValues>
+            8.8214896619319916e-02 -2.7923619747161865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -6.9053061306476593e-03</internalNodes>
+          <leafValues>
+            -6.1452347040176392e-01 3.5631489008665085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 5.8130919933319092e-03</internalNodes>
+          <leafValues>
+            -9.3653626739978790e-02 9.9817357957363129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -1.1030419729650021e-02</internalNodes>
+          <leafValues>
+            4.5798170566558838e-01 -6.5124973654747009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 -1.5703570097684860e-03</internalNodes>
+          <leafValues>
+            4.7113660722970963e-02 -1.3347460329532623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 4.6482901088893414e-03</internalNodes>
+          <leafValues>
+            7.3932677507400513e-02 -4.2145860195159912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 5.0479872152209282e-04</internalNodes>
+          <leafValues>
+            -2.0517270267009735e-01 9.5128253102302551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 2.6125760748982430e-02</internalNodes>
+          <leafValues>
+            -6.8816967308521271e-02 4.2644789814949036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 6.4811189658939838e-03</internalNodes>
+          <leafValues>
+            1.1302389949560165e-01 -4.7021061182022095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -4.5484181493520737e-02</internalNodes>
+          <leafValues>
+            5.4101467132568359e-01 -5.6804839521646500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 6.8956136703491211e-02</internalNodes>
+          <leafValues>
+            3.4444119781255722e-02 -1.7411549389362335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -2.0358948968350887e-03</internalNodes>
+          <leafValues>
+            1.3366940617561340e-01 -2.0985920727252960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 1.4390050200745463e-03</internalNodes>
+          <leafValues>
+            -1.6449619829654694e-01 9.8886348307132721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 3.0180480331182480e-02</internalNodes>
+          <leafValues>
+            8.7635383009910583e-02 -3.9464119076728821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -3.8663588929921389e-03</internalNodes>
+          <leafValues>
+            1.5964619815349579e-01 -1.1840829998254776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 1.0753490030765533e-02</internalNodes>
+          <leafValues>
+            -5.7142060250043869e-02 5.0125277042388916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 1.0978150181472301e-02</internalNodes>
+          <leafValues>
+            3.5985160619020462e-02 -3.8646480441093445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -7.8152219066396356e-04</internalNodes>
+          <leafValues>
+            1.8248090147972107e-01 -1.6435949504375458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 -6.9936108775436878e-03</internalNodes>
+          <leafValues>
+            -2.6556238532066345e-01 9.4436101615428925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 2.3125730454921722e-02</internalNodes>
+          <leafValues>
+            -5.9101939201354980e-02 5.7359057664871216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -1.7055520787835121e-02</internalNodes>
+          <leafValues>
+            -5.4567247629165649e-01 2.7153130620718002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 1.5192289836704731e-02</internalNodes>
+          <leafValues>
+            9.2580981552600861e-02 -2.9735139012336731e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-8.2538652420043945e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 494 -2.1589139476418495e-02</internalNodes>
+          <leafValues>
+            3.3779260516166687e-01 -2.6725459098815918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 6.3885431736707687e-03</internalNodes>
+          <leafValues>
+            -2.6759129762649536e-01 2.1438689529895782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -2.4394609499722719e-03</internalNodes>
+          <leafValues>
+            1.8841089308261871e-01 -2.3495130240917206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 3.9824391715228558e-03</internalNodes>
+          <leafValues>
+            4.6689908951520920e-02 -1.7984829843044281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 -3.1252959161065519e-04</internalNodes>
+          <leafValues>
+            1.7267709970474243e-01 -1.8782779574394226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 3.3181109465658665e-03</internalNodes>
+          <leafValues>
+            1.2081120163202286e-01 -3.2373869419097900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -7.0711369626224041e-03</internalNodes>
+          <leafValues>
+            -2.7498379349708557e-01 1.3868269324302673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 4.4392608106136322e-03</internalNodes>
+          <leafValues>
+            -2.2279019653797150e-01 1.7155140638351440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 2.1352670155465603e-03</internalNodes>
+          <leafValues>
+            -1.1322859674692154e-01 2.8428959846496582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -4.0205409750342369e-03</internalNodes>
+          <leafValues>
+            -2.4542550742626190e-01 9.4957500696182251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 -6.5228617750108242e-03</internalNodes>
+          <leafValues>
+            3.2106789946556091e-01 -9.7372367978096008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 4.4146090658614412e-05</internalNodes>
+          <leafValues>
+            -1.5269330143928528e-01 8.5128836333751678e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 4.7606039792299271e-02</internalNodes>
+          <leafValues>
+            7.9339757561683655e-02 -2.9599419236183167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 4.0928661823272705e-02</internalNodes>
+          <leafValues>
+            -3.5142261534929276e-02 3.7593579292297363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -1.1161889880895615e-02</internalNodes>
+          <leafValues>
+            -2.6747810840606689e-01 8.9181788265705109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 -2.9888451099395752e-01</internalNodes>
+          <leafValues>
+            4.8014399409294128e-01 -7.2485052049160004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 1.1514360085129738e-02</internalNodes>
+          <leafValues>
+            -5.9218250215053558e-02 4.0962639451026917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 -2.6182739529758692e-03</internalNodes>
+          <leafValues>
+            -1.8478739261627197e-01 3.9801560342311859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -1.2829460320062935e-04</internalNodes>
+          <leafValues>
+            1.0710919648408890e-01 -2.4155279994010925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 -6.9328160025179386e-03</internalNodes>
+          <leafValues>
+            -2.9845720529556274e-01 4.5657958835363388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -6.3937888480722904e-03</internalNodes>
+          <leafValues>
+            1.8363510072231293e-01 -1.4049419760704041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 4.1702711023390293e-03</internalNodes>
+          <leafValues>
+            -5.1890019327402115e-02 1.0211580246686935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 1.0390999726951122e-02</internalNodes>
+          <leafValues>
+            -1.3426989316940308e-01 1.9137309491634369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 1.3004739768803120e-02</internalNodes>
+          <leafValues>
+            -4.5922718942165375e-02 3.0526930093765259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 -4.0645021945238113e-03</internalNodes>
+          <leafValues>
+            -4.8477160930633545e-01 6.9338463246822357e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -3.7050418904982507e-04</internalNodes>
+          <leafValues>
+            1.0090719908475876e-01 -6.8911276757717133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 8.8882551062852144e-04</internalNodes>
+          <leafValues>
+            -1.6742789745330811e-01 1.8965889513492584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 -4.8583559691905975e-03</internalNodes>
+          <leafValues>
+            -4.0789389610290527e-01 5.1483351737260818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 4.4327960349619389e-03</internalNodes>
+          <leafValues>
+            -1.4262509346008301e-01 1.8987190723419189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 2.0999709144234657e-02</internalNodes>
+          <leafValues>
+            9.2153772711753845e-02 -3.0773550271987915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -2.2740170825272799e-03</internalNodes>
+          <leafValues>
+            1.5176279842853546e-01 -1.6528700292110443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -1.5075540170073509e-02</internalNodes>
+          <leafValues>
+            -3.1039240956306458e-01 6.5696939826011658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 9.5290662720799446e-03</internalNodes>
+          <leafValues>
+            -6.7693017423152924e-02 4.0692031383514404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 1.2057139538228512e-03</internalNodes>
+          <leafValues>
+            4.3188188225030899e-02 -1.8454369902610779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -2.4757070466876030e-02</internalNodes>
+          <leafValues>
+            6.6890978813171387e-01 -3.4418709576129913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 3.0408669263124466e-03</internalNodes>
+          <leafValues>
+            -1.3256159424781799e-01 9.5131039619445801e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -1.5181970084086061e-03</internalNodes>
+          <leafValues>
+            1.2939499318599701e-01 -1.8558539450168610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 -2.4845359846949577e-02</internalNodes>
+          <leafValues>
+            -7.3013377189636230e-01 9.4545418396592140e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -8.1413304433226585e-03</internalNodes>
+          <leafValues>
+            1.1521799862384796e-01 -1.9038149714469910e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 -4.2350329458713531e-03</internalNodes>
+          <leafValues>
+            7.2733633220195770e-02 -1.0841889679431915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 9.9135711789131165e-03</internalNodes>
+          <leafValues>
+            -8.4218956530094147e-02 4.7613239288330078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -2.7879870031028986e-03</internalNodes>
+          <leafValues>
+            -1.2846939265727997e-01 6.5720662474632263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 2.6451589073985815e-03</internalNodes>
+          <leafValues>
+            8.9269757270812988e-02 -2.6216679811477661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -2.6683490723371506e-02</internalNodes>
+          <leafValues>
+            8.9870773255825043e-02 -9.6914090216159821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 3.1197380740195513e-03</internalNodes>
+          <leafValues>
+            -1.1731740087270737e-01 2.2004860639572144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -2.3388290405273438e-01</internalNodes>
+          <leafValues>
+            -9.0905857086181641e-01 5.6871720589697361e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 1.0922820307314396e-02</internalNodes>
+          <leafValues>
+            8.5061840713024139e-02 -3.0725648999214172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 9.4858808442950249e-03</internalNodes>
+          <leafValues>
+            -2.2317569702863693e-02 3.3745709061622620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -5.1413412438705564e-04</internalNodes>
+          <leafValues>
+            1.4860659837722778e-01 -1.5598359704017639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 6.5561588853597641e-03</internalNodes>
+          <leafValues>
+            6.6693432629108429e-02 -2.9945740103721619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 9.8293996416032314e-04</internalNodes>
+          <leafValues>
+            -1.9923539459705353e-01 1.4816479384899139e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -1.8866109894588590e-03</internalNodes>
+          <leafValues>
+            8.6462371051311493e-02 -1.6101740300655365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 2.7264489326626062e-03</internalNodes>
+          <leafValues>
+            -8.2049086689949036e-02 3.8679501414299011e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>60</maxWeakCount>
+      <stageThreshold>-8.3464938402175903e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 547 -1.2602520175278187e-02</internalNodes>
+          <leafValues>
+            2.2423070669174194e-01 -3.3462178707122803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 2.5659699458628893e-03</internalNodes>
+          <leafValues>
+            8.5756540298461914e-02 -3.2376360893249512e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -1.2003120500594378e-03</internalNodes>
+          <leafValues>
+            1.4650370180606842e-01 -3.0306750535964966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 4.7978968359529972e-03</internalNodes>
+          <leafValues>
+            -2.4725909531116486e-01 5.2705809473991394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -5.9380318270996213e-04</internalNodes>
+          <leafValues>
+            -1.8883049488067627e-01 1.5490350127220154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 8.1017091870307922e-03</internalNodes>
+          <leafValues>
+            1.0764879733324051e-01 -2.4738930165767670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -6.8427261430770159e-04</internalNodes>
+          <leafValues>
+            1.8282850086688995e-01 -1.6550099849700928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 4.5279348269104958e-03</internalNodes>
+          <leafValues>
+            -5.5668760091066360e-02 4.1382691264152527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 3.8289420772343874e-03</internalNodes>
+          <leafValues>
+            -2.2222219407558441e-01 1.5282329916954041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -6.2229200266301632e-03</internalNodes>
+          <leafValues>
+            -3.2351690530776978e-01 6.8372547626495361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 -6.1763478443026543e-03</internalNodes>
+          <leafValues>
+            -3.9912268519401550e-01 7.7707469463348389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 -8.7820261716842651e-02</internalNodes>
+          <leafValues>
+            5.8577078580856323e-01 -5.3584650158882141e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -6.8017458543181419e-03</internalNodes>
+          <leafValues>
+            -4.3307110667228699e-01 6.2693849205970764e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 1.0741569567471743e-03</internalNodes>
+          <leafValues>
+            -1.1966490000486374e-01 5.5397849529981613e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -3.0490919947624207e-02</internalNodes>
+          <leafValues>
+            -2.3663240671157837e-01 1.0002999752759933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 5.1879119127988815e-02</internalNodes>
+          <leafValues>
+            -3.6418840289115906e-02 7.3392897844314575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 8.6805049795657396e-04</internalNodes>
+          <leafValues>
+            -1.7705479264259338e-01 1.4985239505767822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 4.8424140550196171e-03</internalNodes>
+          <leafValues>
+            -4.6208251267671585e-02 1.3162529468536377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 9.1674225404858589e-03</internalNodes>
+          <leafValues>
+            9.9181063473224640e-02 -2.0292450487613678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -5.6356228888034821e-03</internalNodes>
+          <leafValues>
+            8.7860167026519775e-02 -3.7438090890645981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 -3.8375150412321091e-02</internalNodes>
+          <leafValues>
+            4.9721479415893555e-01 -4.3815169483423233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 8.9894384145736694e-03</internalNodes>
+          <leafValues>
+            9.4126552343368530e-02 -3.0227750539779663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 -1.1650560190901160e-04</internalNodes>
+          <leafValues>
+            1.3361050188541412e-01 -1.8932069838047028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -6.6462112590670586e-04</internalNodes>
+          <leafValues>
+            7.7972702682018280e-02 -1.3508260250091553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 -1.2656490318477154e-02</internalNodes>
+          <leafValues>
+            -3.6913019418716431e-01 6.4613893628120422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -4.3929531238973141e-03</internalNodes>
+          <leafValues>
+            2.6696819067001343e-01 -8.8650099933147430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 -1.2583639472723007e-03</internalNodes>
+          <leafValues>
+            2.0614829659461975e-01 -1.0952439904212952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -1.1131940409541130e-02</internalNodes>
+          <leafValues>
+            -4.1352048516273499e-01 6.2840126454830170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 3.0703889206051826e-03</internalNodes>
+          <leafValues>
+            -1.5591779351234436e-01 1.5018209815025330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 3.5361549817025661e-03</internalNodes>
+          <leafValues>
+            6.2573492527008057e-02 -2.1869969367980957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 2.8864629566669464e-02</internalNodes>
+          <leafValues>
+            -6.9561749696731567e-02 4.4892778992652893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -7.1035906672477722e-02</internalNodes>
+          <leafValues>
+            2.0991979539394379e-01 -3.6562878638505936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 -1.1107679456472397e-03</internalNodes>
+          <leafValues>
+            -3.3020168542861938e-01 7.9758942127227783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 7.9184047877788544e-02</internalNodes>
+          <leafValues>
+            -1.3226009905338287e-02 3.8603660464286804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 1.3353509828448296e-02</internalNodes>
+          <leafValues>
+            5.8410558849573135e-02 -3.9250770211219788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 5.0049051642417908e-02</internalNodes>
+          <leafValues>
+            -2.3318229243159294e-02 7.4593770503997803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -2.1859000623226166e-01</internalNodes>
+          <leafValues>
+            -8.4585267305374146e-01 2.5940530002117157e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 1.0064110159873962e-02</internalNodes>
+          <leafValues>
+            -1.0959850251674652e-01 2.1068529784679413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 7.5430879369378090e-03</internalNodes>
+          <leafValues>
+            5.3567539900541306e-02 -3.3617278933525085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 1.5817210078239441e-02</internalNodes>
+          <leafValues>
+            -1.9042259082198143e-02 2.2196899354457855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 -1.7135319649241865e-04</internalNodes>
+          <leafValues>
+            1.7667369544506073e-01 -1.2068530172109604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 6.6670849919319153e-03</internalNodes>
+          <leafValues>
+            7.0071838796138763e-02 -2.2137600183486938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 2.7946738991886377e-03</internalNodes>
+          <leafValues>
+            -1.0509230196475983e-01 1.9277399778366089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 -1.5057970304042101e-03</internalNodes>
+          <leafValues>
+            6.0012888163328171e-02 -1.2378510087728500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 8.5329543799161911e-03</internalNodes>
+          <leafValues>
+            -4.7611240297555923e-02 3.9985141158103943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 4.2939469218254089e-02</internalNodes>
+          <leafValues>
+            3.1611390411853790e-02 -1.9731660187244415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 2.0308220759034157e-02</internalNodes>
+          <leafValues>
+            3.5055190324783325e-02 -5.1969397068023682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 -7.7673741616308689e-03</internalNodes>
+          <leafValues>
+            -1.8817919492721558e-01 5.6889228522777557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 2.1762759424746037e-03</internalNodes>
+          <leafValues>
+            -9.0948157012462616e-02 2.4575869739055634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -1.9813690334558487e-02</internalNodes>
+          <leafValues>
+            5.2904421091079712e-01 -3.8754951208829880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 1.3035159558057785e-02</internalNodes>
+          <leafValues>
+            6.7918822169303894e-02 -3.0413469672203064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 -1.9664920400828123e-03</internalNodes>
+          <leafValues>
+            -2.0626169443130493e-01 9.6140593290328979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 -2.6359891053289175e-03</internalNodes>
+          <leafValues>
+            2.5085249543190002e-01 -8.3200961351394653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -2.2968810517340899e-03</internalNodes>
+          <leafValues>
+            2.9634681344032288e-01 -5.8743689209222794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -3.8644939195364714e-03</internalNodes>
+          <leafValues>
+            1.9411550462245941e-01 -1.0827559977769852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 4.4517841160995886e-05</internalNodes>
+          <leafValues>
+            -2.4451869726181030e-01 1.0293029993772507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 1.9567341078072786e-03</internalNodes>
+          <leafValues>
+            -1.0519249737262726e-01 2.2499999403953552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 1.4188109897077084e-02</internalNodes>
+          <leafValues>
+            3.2100718468427658e-02 -5.9142422676086426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 -1.3274629600346088e-04</internalNodes>
+          <leafValues>
+            7.4577853083610535e-02 -2.7654591202735901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 2.0996380597352982e-02</internalNodes>
+          <leafValues>
+            -4.5735489577054977e-02 3.2947731018066406e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>68</maxWeakCount>
+      <stageThreshold>-7.0352667570114136e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 607 -3.9841078221797943e-02</internalNodes>
+          <leafValues>
+            1.5186519920825958e-01 -2.9055249691009521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 1.1327869724482298e-03</internalNodes>
+          <leafValues>
+            -1.1921630054712296e-01 1.2098889797925949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.0022070491686463e-03</internalNodes>
+          <leafValues>
+            1.2088630348443985e-01 -2.5621330738067627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 6.3866227865219116e-02</internalNodes>
+          <leafValues>
+            4.7628100961446762e-02 -8.6150348186492920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 -3.0986019410192966e-03</internalNodes>
+          <leafValues>
+            -3.1975808739662170e-01 9.1434687376022339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 6.5784230828285217e-03</internalNodes>
+          <leafValues>
+            -8.0473050475120544e-02 3.6123031377792358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 4.5082601718604565e-03</internalNodes>
+          <leafValues>
+            -1.8215750157833099e-01 1.4672499895095825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 -1.6526240855455399e-02</internalNodes>
+          <leafValues>
+            -1.2954659759998322e-01 6.6522419452667236e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -4.1868099942803383e-03</internalNodes>
+          <leafValues>
+            -2.6552608609199524e-01 1.1237680166959763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 5.6613027118146420e-04</internalNodes>
+          <leafValues>
+            1.1822649836540222e-01 -1.6119679808616638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 2.0279800519347191e-03</internalNodes>
+          <leafValues>
+            -2.2618439793586731e-01 1.1263699829578400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -1.1969150044023991e-02</internalNodes>
+          <leafValues>
+            -2.7523440122604370e-01 8.3603866398334503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 -2.8411731123924255e-01</internalNodes>
+          <leafValues>
+            4.0216109156608582e-01 -7.7971749007701874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 -3.6587871145457029e-03</internalNodes>
+          <leafValues>
+            -2.9723858833312988e-01 6.3484713435173035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 9.2046172358095646e-04</internalNodes>
+          <leafValues>
+            7.7872820198535919e-02 -2.9539081454277039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 1.3571759685873985e-02</internalNodes>
+          <leafValues>
+            -7.2430767118930817e-02 3.4849750995635986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -3.1399999279528856e-03</internalNodes>
+          <leafValues>
+            -2.2088779509067535e-01 1.0072159767150879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 6.9894008338451385e-03</internalNodes>
+          <leafValues>
+            5.9188209474086761e-02 -1.4137220382690430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -5.9609091840684414e-04</internalNodes>
+          <leafValues>
+            1.3563929498195648e-01 -1.5081329643726349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 1.6805849736556411e-03</internalNodes>
+          <leafValues>
+            -7.8348256647586823e-02 7.7357366681098938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 -5.7250040117651224e-04</internalNodes>
+          <leafValues>
+            2.3572799563407898e-01 -1.1594360321760178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 4.3474160134792328e-02</internalNodes>
+          <leafValues>
+            8.2836961373686790e-03 -3.7428310513496399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 6.0316640883684158e-04</internalNodes>
+          <leafValues>
+            -1.7846900224685669e-01 1.6185760498046875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 2.6881720870733261e-02</internalNodes>
+          <leafValues>
+            7.2419442236423492e-02 -1.7971959710121155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 -4.9273878335952759e-02</internalNodes>
+          <leafValues>
+            4.6386399865150452e-01 -5.0276938825845718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -6.7225202918052673e-02</internalNodes>
+          <leafValues>
+            -1. 1.3532400131225586e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 2.0203770697116852e-01</internalNodes>
+          <leafValues>
+            -3.8748100399971008e-02 5.7211977243423462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 3.1489748507738113e-02</internalNodes>
+          <leafValues>
+            4.5488908886909485e-02 -1.2539370357990265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 -5.7097017997875810e-04</internalNodes>
+          <leafValues>
+            1.9619710743427277e-01 -1.0944739729166031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 -7.8234989196062088e-03</internalNodes>
+          <leafValues>
+            6.7954361438751221e-02 -7.2075963020324707e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -2.1555390208959579e-02</internalNodes>
+          <leafValues>
+            -2.8890660405158997e-01 9.9806018173694611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 -8.3767198026180267e-02</internalNodes>
+          <leafValues>
+            -4.3685078620910645e-01 1.0792650282382965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -3.5752300173044205e-03</internalNodes>
+          <leafValues>
+            1.1191669851541519e-01 -1.9461460411548615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 1.2265419587492943e-02</internalNodes>
+          <leafValues>
+            -6.5728217363357544e-02 3.2739359140396118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 2.8762801084667444e-03</internalNodes>
+          <leafValues>
+            -1.8723809719085693e-01 1.1246989667415619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 7.4190571904182434e-03</internalNodes>
+          <leafValues>
+            5.1525920629501343e-02 -2.6615419983863831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -4.9716630019247532e-03</internalNodes>
+          <leafValues>
+            1.5384270250797272e-01 -1.5141449868679047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 2.0294899120926857e-02</internalNodes>
+          <leafValues>
+            -1.9532799720764160e-02 3.0571049451828003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 1.3469019904732704e-02</internalNodes>
+          <leafValues>
+            6.2345318496227264e-02 -3.6343741416931152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 6.8610929884016514e-03</internalNodes>
+          <leafValues>
+            -6.2487348914146423e-02 2.8820911049842834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -5.9594889171421528e-04</internalNodes>
+          <leafValues>
+            8.5537739098072052e-02 -2.4081380665302277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 -4.0149871259927750e-02</internalNodes>
+          <leafValues>
+            -1. 1.5480610309168696e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -2.7885669842362404e-03</internalNodes>
+          <leafValues>
+            -2.2338689863681793e-01 1.1001159995794296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 -7.9318676143884659e-03</internalNodes>
+          <leafValues>
+            1.3043269515037537e-01 -2.8859179466962814e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -2.9607459509861656e-05</internalNodes>
+          <leafValues>
+            1.1876039952039719e-01 -1.7018820345401764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 2.6092668995261192e-03</internalNodes>
+          <leafValues>
+            -6.9877780973911285e-02 1.5036509931087494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -4.5970208942890167e-02</internalNodes>
+          <leafValues>
+            5.6322151422500610e-01 -3.6318130791187286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 9.0047682169824839e-04</internalNodes>
+          <leafValues>
+            3.2461058348417282e-02 -1.8973889946937561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -5.1712408661842346e-02</internalNodes>
+          <leafValues>
+            -8.5045510530471802e-01 2.0679740235209465e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -1.4172409474849701e-01</internalNodes>
+          <leafValues>
+            -9.1004508733749390e-01 3.8531969767063856e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -6.9771192967891693e-02</internalNodes>
+          <leafValues>
+            4.2144781351089478e-01 -5.5162269622087479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -7.5836889445781708e-03</internalNodes>
+          <leafValues>
+            -4.2189291119575500e-01 6.1964530497789383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 -1.2404819717630744e-03</internalNodes>
+          <leafValues>
+            1.7558629810810089e-01 -1.3540640473365784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 1.0614699684083462e-02</internalNodes>
+          <leafValues>
+            4.5083239674568176e-02 -2.5765570998191833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 1.7647630302235484e-03</internalNodes>
+          <leafValues>
+            -1.1009249836206436e-01 2.4041210114955902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 3.7170480936765671e-03</internalNodes>
+          <leafValues>
+            -7.6920822262763977e-02 2.0119519531726837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 1.5280679799616337e-02</internalNodes>
+          <leafValues>
+            5.8605119585990906e-02 -3.6220121383666992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -8.1635616719722748e-02</internalNodes>
+          <leafValues>
+            5.2819788455963135e-01 -4.3608970940113068e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 -2.4431939236819744e-03</internalNodes>
+          <leafValues>
+            -2.4369360506534576e-01 8.4384277462959290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -1.2289900332689285e-03</internalNodes>
+          <leafValues>
+            1.0332729667425156e-01 -9.7442328929901123e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 6.9271848769858479e-04</internalNodes>
+          <leafValues>
+            -1.1367750167846680e-01 1.6121849417686462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 9.9380649626255035e-03</internalNodes>
+          <leafValues>
+            5.2774678915739059e-02 -1.5222820639610291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -1.8377749249339104e-02</internalNodes>
+          <leafValues>
+            4.6800789237022400e-01 -4.2411230504512787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -3.0569550581276417e-03</internalNodes>
+          <leafValues>
+            1.2866629660129547e-01 -9.8308563232421875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 -1.8440110143274069e-03</internalNodes>
+          <leafValues>
+            -2.7592489123344421e-01 1.0050299763679504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 5.6205368600785732e-03</internalNodes>
+          <leafValues>
+            -7.0716217160224915e-02 1.6734069585800171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 3.4157470799982548e-03</internalNodes>
+          <leafValues>
+            5.2378088235855103e-02 -5.0982749462127686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 -3.0376210343092680e-03</internalNodes>
+          <leafValues>
+            1.4243629574775696e-01 -6.3037060201168060e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>67</maxWeakCount>
+      <stageThreshold>-7.4644768238067627e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 675 1.0126640088856220e-02</internalNodes>
+          <leafValues>
+            -2.1863789856433868e-01 1.7513489723205566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -2.6893198955804110e-03</internalNodes>
+          <leafValues>
+            -3.2822969555854797e-01 9.9838256835937500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 -1.5573530457913876e-02</internalNodes>
+          <leafValues>
+            1.9594019651412964e-01 -2.2535979747772217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 4.9326270818710327e-03</internalNodes>
+          <leafValues>
+            4.9988470971584320e-02 -5.3175377845764160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -7.6638202881440520e-04</internalNodes>
+          <leafValues>
+            -2.6926669478416443e-01 1.1751429736614227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -1.2552300177048892e-04</internalNodes>
+          <leafValues>
+            6.9110788404941559e-02 -8.1727392971515656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 -1.4519299838866573e-05</internalNodes>
+          <leafValues>
+            1.1483950167894363e-01 -2.3017129302024841e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 -1.6113840043544769e-02</internalNodes>
+          <leafValues>
+            5.0956588983535767e-01 -3.7494029849767685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 5.5138790048658848e-03</internalNodes>
+          <leafValues>
+            -7.8787550330162048e-02 2.3771439492702484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 8.7763823568820953e-02</internalNodes>
+          <leafValues>
+            1.3863979838788509e-02 -8.9777380228042603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -1.2825570069253445e-02</internalNodes>
+          <leafValues>
+            -3.9504998922348022e-01 5.5546328425407410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 8.2099979044869542e-04</internalNodes>
+          <leafValues>
+            -1.2663979828357697e-01 1.9081629812717438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 -1.2775770155712962e-03</internalNodes>
+          <leafValues>
+            1.1065080016851425e-01 -1.9801099598407745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 -2.5229719281196594e-01</internalNodes>
+          <leafValues>
+            -8.1039828062057495e-01 8.3870543166995049e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 7.0347747532650828e-04</internalNodes>
+          <leafValues>
+            -2.1380549669265747e-01 9.8673596978187561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 1.0717480443418026e-02</internalNodes>
+          <leafValues>
+            8.4470443427562714e-02 -2.6063749194145203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 5.1081487908959389e-03</internalNodes>
+          <leafValues>
+            -5.5732220411300659e-02 4.1447860002517700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -1.9006159156560898e-02</internalNodes>
+          <leafValues>
+            -3.7475249171257019e-01 7.9524833709001541e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 1.1136929970234632e-03</internalNodes>
+          <leafValues>
+            -2.2650149464607239e-01 1.0789389908313751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 1.1141769587993622e-02</internalNodes>
+          <leafValues>
+            -4.2054798454046249e-02 1.3697710633277893e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 1.2054879916831851e-03</internalNodes>
+          <leafValues>
+            9.2105977237224579e-02 -2.3083679378032684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -2.0797130127903074e-04</internalNodes>
+          <leafValues>
+            8.4210596978664398e-02 -6.6967681050300598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -1.6412649303674698e-02</internalNodes>
+          <leafValues>
+            4.2269191145896912e-01 -4.9638699740171432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 7.0363390259444714e-03</internalNodes>
+          <leafValues>
+            9.0550661087036133e-02 -2.7322870492935181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -8.4774550050497055e-03</internalNodes>
+          <leafValues>
+            -1.9004869461059570e-01 1.0416539758443832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 -8.7799631059169769e-02</internalNodes>
+          <leafValues>
+            -1. 4.5551471412181854e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -4.6731110662221909e-02</internalNodes>
+          <leafValues>
+            4.1607761383056641e-01 -6.7924611270427704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 7.4915830045938492e-03</internalNodes>
+          <leafValues>
+            4.7516189515590668e-02 -4.4306200742721558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 8.6966790258884430e-03</internalNodes>
+          <leafValues>
+            -3.9423149079084396e-02 5.2188277244567871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 -6.4137862063944340e-03</internalNodes>
+          <leafValues>
+            -2.4749429523944855e-01 1.1350250244140625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 6.4909840002655983e-03</internalNodes>
+          <leafValues>
+            -2.0237590372562408e-01 1.1887309700250626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 1.1677639558911324e-03</internalNodes>
+          <leafValues>
+            -9.8187439143657684e-02 1.4470459520816803e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 8.0650653690099716e-03</internalNodes>
+          <leafValues>
+            3.0806429684162140e-02 -5.7410538196563721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 -6.1450549401342869e-03</internalNodes>
+          <leafValues>
+            1.4213280379772186e-01 -1.2155479937791824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 3.3926900941878557e-03</internalNodes>
+          <leafValues>
+            -6.9425463676452637e-02 3.7945500016212463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 2.5861251354217529e-01</internalNodes>
+          <leafValues>
+            -8.0964984372258186e-03 5.7324391603469849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 4.6327650547027588e-02</internalNodes>
+          <leafValues>
+            9.3428269028663635e-02 -2.9274320602416992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 -1.4053919585421681e-05</internalNodes>
+          <leafValues>
+            5.9584300965070724e-02 -1.2193849682807922e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -5.5521689355373383e-03</internalNodes>
+          <leafValues>
+            -3.0268138647079468e-01 7.9481996595859528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 -7.1974180638790131e-02</internalNodes>
+          <leafValues>
+            5.9862488508224487e-01 -3.2414238899946213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -1.1097419774159789e-03</internalNodes>
+          <leafValues>
+            -2.2289000451564789e-01 9.4809576869010925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 1.1012280359864235e-02</internalNodes>
+          <leafValues>
+            -5.0954710692167282e-02 2.1996709704399109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -1.0663530230522156e-01</internalNodes>
+          <leafValues>
+            -7.8257107734680176e-01 2.3075709119439125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 2.6826610788702965e-02</internalNodes>
+          <leafValues>
+            -3.3334378153085709e-02 3.2825571298599243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 1.6480779275298119e-02</internalNodes>
+          <leafValues>
+            2.4793079122900963e-02 -7.9102367162704468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 1.4533529756590724e-03</internalNodes>
+          <leafValues>
+            -4.7377821058034897e-02 1.8299889564514160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 4.6536721289157867e-02</internalNodes>
+          <leafValues>
+            -4.2217779904603958e-02 4.7201961278915405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 1.3604049570858479e-02</internalNodes>
+          <leafValues>
+            7.1543172001838684e-02 -2.8175559639930725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 2.9868748970329762e-03</internalNodes>
+          <leafValues>
+            -1.2019319832324982e-01 1.5165250003337860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 7.5455583631992340e-02</internalNodes>
+          <leafValues>
+            7.6729329302906990e-03 -3.7560600042343140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -2.1207109093666077e-03</internalNodes>
+          <leafValues>
+            1.1624389886856079e-01 -1.5187309682369232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 4.6092201955616474e-03</internalNodes>
+          <leafValues>
+            5.2315160632133484e-02 -2.3050600290298462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 1.0207670275121927e-03</internalNodes>
+          <leafValues>
+            -1.1380010098218918e-01 1.7626440525054932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 6.2532532028853893e-03</internalNodes>
+          <leafValues>
+            6.1674360185861588e-02 -3.4915238618850708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 2.8322400525212288e-02</internalNodes>
+          <leafValues>
+            -3.9958149194717407e-02 5.2392977476119995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 -1.6342360526323318e-02</internalNodes>
+          <leafValues>
+            -1.2563559412956238e-01 4.0041740983724594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -1.8282469827681780e-03</internalNodes>
+          <leafValues>
+            9.1135032474994659e-02 -1.9224719703197479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 4.4616919010877609e-02</internalNodes>
+          <leafValues>
+            -1.7582910135388374e-02 3.0281931161880493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 3.5677649429999292e-04</internalNodes>
+          <leafValues>
+            -8.7897412478923798e-02 2.2339150309562683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 -4.5413200859911740e-04</internalNodes>
+          <leafValues>
+            6.5522827208042145e-02 -9.9679380655288696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 1.5353029593825340e-03</internalNodes>
+          <leafValues>
+            6.8590000271797180e-02 -2.9728370904922485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 2.1600390318781137e-03</internalNodes>
+          <leafValues>
+            -8.9736528694629669e-02 8.0284543335437775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 -5.9745612088590860e-04</internalNodes>
+          <leafValues>
+            2.1873860061168671e-01 -1.1398520320653915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 -1.2356050312519073e-02</internalNodes>
+          <leafValues>
+            -2.9350760579109192e-01 6.4420320093631744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -3.2670930027961731e-01</internalNodes>
+          <leafValues>
+            3.8920149207115173e-01 -4.9165409058332443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 8.7828626856207848e-03</internalNodes>
+          <leafValues>
+            8.6186192929744720e-02 -2.2631849348545074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 3.3569689840078354e-03</internalNodes>
+          <leafValues>
+            -9.1194286942481995e-02 2.1264100074768066e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>75</maxWeakCount>
+      <stageThreshold>-7.8030252456665039e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 742 -1.5290499664843082e-02</internalNodes>
+          <leafValues>
+            1.6011320054531097e-01 -2.1511940658092499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -5.9956451877951622e-03</internalNodes>
+          <leafValues>
+            -1.8299789726734161e-01 3.7886500358581543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 6.2301359139382839e-04</internalNodes>
+          <leafValues>
+            -1.2199199944734573e-01 2.1163250505924225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 5.8087380602955818e-04</internalNodes>
+          <leafValues>
+            -2.2747389972209930e-01 7.6958037912845612e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -2.8277048841118813e-03</internalNodes>
+          <leafValues>
+            2.7597460150718689e-01 -7.8942306339740753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 2.1096320822834969e-02</internalNodes>
+          <leafValues>
+            4.1295919567346573e-02 -3.2933080196380615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -2.2117430344223976e-03</internalNodes>
+          <leafValues>
+            2.4672569334506989e-01 -7.3121666908264160e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -2.3275949060916901e-03</internalNodes>
+          <leafValues>
+            -2.2825109958648682e-01 7.9285196959972382e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -4.4754869304597378e-03</internalNodes>
+          <leafValues>
+            1.1744049936532974e-01 -1.9801409542560577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 -2.5716619566082954e-03</internalNodes>
+          <leafValues>
+            3.7658710032701492e-02 -1.2148059904575348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 1.5387970488518476e-03</internalNodes>
+          <leafValues>
+            -5.5973250418901443e-02 3.6923429369926453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -3.3066518604755402e-02</internalNodes>
+          <leafValues>
+            3.9160001277923584e-01 -7.7862940728664398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -8.5727721452713013e-02</internalNodes>
+          <leafValues>
+            -2.5174748897552490e-01 1.3543550670146942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 -7.0333289913833141e-03</internalNodes>
+          <leafValues>
+            1.3328710198402405e-01 -1.5664640069007874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -6.8310517235659063e-05</internalNodes>
+          <leafValues>
+            9.9454201757907867e-02 -2.3412980139255524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 -6.0546118766069412e-04</internalNodes>
+          <leafValues>
+            -1.7742669582366943e-01 1.0017810016870499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 -2.2480569314211607e-03</internalNodes>
+          <leafValues>
+            -3.6424639821052551e-01 5.3501259535551071e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -1.5090550296008587e-03</internalNodes>
+          <leafValues>
+            7.7575050294399261e-02 -9.4920717179775238e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 -5.8666180848376825e-05</internalNodes>
+          <leafValues>
+            1.2585939466953278e-01 -1.4529819786548615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 3.5532109905034304e-03</internalNodes>
+          <leafValues>
+            -9.8626613616943359e-02 7.4326246976852417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 -1.4601859729737043e-03</internalNodes>
+          <leafValues>
+            -3.3026841282844543e-01 6.3813462853431702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 -2.3586049792356789e-04</internalNodes>
+          <leafValues>
+            1.0846760123968124e-01 -1.0571049898862839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 1.4756060205399990e-02</internalNodes>
+          <leafValues>
+            -5.9472840279340744e-02 3.7792891263961792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -1.6795310378074646e-01</internalNodes>
+          <leafValues>
+            -6.6773468255996704e-01 1.7404930666089058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 3.2017670571804047e-02</internalNodes>
+          <leafValues>
+            -2.3720450699329376e-01 9.6205927431583405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 -6.1111792456358671e-04</internalNodes>
+          <leafValues>
+            1.3566890358924866e-01 -6.8121932446956635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 -1.1586040258407593e-02</internalNodes>
+          <leafValues>
+            -2.9761460423469543e-01 6.4853250980377197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 -1.1290679685771465e-03</internalNodes>
+          <leafValues>
+            1.3520470261573792e-01 -9.0693503618240356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 1.8352170009166002e-03</internalNodes>
+          <leafValues>
+            -9.6694603562355042e-02 1.8725989758968353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 -2.7584248781204224e-01</internalNodes>
+          <leafValues>
+            2.7460220456123352e-01 -1.6176709905266762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -5.2487280219793320e-02</internalNodes>
+          <leafValues>
+            -2.6295030117034912e-01 8.4279276430606842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -2.8409080579876900e-02</internalNodes>
+          <leafValues>
+            4.4033178687095642e-01 -4.6736340969800949e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 1.2234229594469070e-02</internalNodes>
+          <leafValues>
+            7.1391902863979340e-02 -2.9463478922843933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 3.7752088159322739e-02</internalNodes>
+          <leafValues>
+            -3.2507140189409256e-02 6.2293910980224609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -1.3006339780986309e-02</internalNodes>
+          <leafValues>
+            -3.5619509220123291e-01 5.7085920125246048e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 -3.7061918992549181e-03</internalNodes>
+          <leafValues>
+            1.7485049366950989e-01 -1.0506869852542877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 -4.8177209682762623e-03</internalNodes>
+          <leafValues>
+            1.4761090278625488e-01 -1.3700130581855774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -3.0726719647645950e-02</internalNodes>
+          <leafValues>
+            -2.1432609856128693e-01 3.4535329788923264e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 1.0044399648904800e-02</internalNodes>
+          <leafValues>
+            8.2472868263721466e-02 -2.1329440176486969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 3.3808979787863791e-04</internalNodes>
+          <leafValues>
+            -5.6368399411439896e-02 8.4050692617893219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -3.4935539588332176e-04</internalNodes>
+          <leafValues>
+            1.5510140359401703e-01 -1.5465189516544342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 8.5416442016139627e-04</internalNodes>
+          <leafValues>
+            7.4811212718486786e-02 -2.0761939883232117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 -7.4278831016272306e-04</internalNodes>
+          <leafValues>
+            2.0695370435714722e-01 -1.1315040290355682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -4.1803911328315735e-02</internalNodes>
+          <leafValues>
+            7.7375417947769165e-01 -2.7391599491238594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -8.9303712593391538e-04</internalNodes>
+          <leafValues>
+            -2.8926849365234375e-01 8.3425313234329224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 2.0034189801663160e-03</internalNodes>
+          <leafValues>
+            5.7899519801139832e-02 -2.1817860007286072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 7.4933562427759171e-04</internalNodes>
+          <leafValues>
+            -1.3606220483779907e-01 1.6150030493736267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -8.9645422995090485e-02</internalNodes>
+          <leafValues>
+            -9.5717740058898926e-01 5.8882208541035652e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 -6.5244808793067932e-03</internalNodes>
+          <leafValues>
+            1.4521969854831696e-01 -1.6119849681854248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -2.8723690193146467e-03</internalNodes>
+          <leafValues>
+            1.0670810192823410e-01 -3.0505739152431488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 2.2762219887226820e-03</internalNodes>
+          <leafValues>
+            -1.4573380351066589e-01 1.5590649843215942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 4.3706637807190418e-03</internalNodes>
+          <leafValues>
+            -2.4369299411773682e-02 2.0724129676818848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 1.1989739723503590e-03</internalNodes>
+          <leafValues>
+            8.8461942970752716e-02 -2.2536410391330719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 -6.1923090834170580e-04</internalNodes>
+          <leafValues>
+            1.5108090639114380e-01 -9.9106341600418091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 -1.0555429616943002e-03</internalNodes>
+          <leafValues>
+            1.5399299561977386e-01 -1.4410500228404999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 2.3101890459656715e-02</internalNodes>
+          <leafValues>
+            -2.6107529178261757e-02 2.5875169038772583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 6.7337458021938801e-03</internalNodes>
+          <leafValues>
+            6.4629636704921722e-02 -3.2299819588661194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 1.4084229478612542e-03</internalNodes>
+          <leafValues>
+            8.5755072534084320e-02 -1.4947549998760223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -2.3923629487399012e-04</internalNodes>
+          <leafValues>
+            1.8700890243053436e-01 -1.0941530019044876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 2.2198690567165613e-04</internalNodes>
+          <leafValues>
+            -1.9517560303211212e-01 5.9587858617305756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 2.8156230691820383e-03</internalNodes>
+          <leafValues>
+            -8.9527882635593414e-02 2.2894319891929626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 7.8730508685112000e-03</internalNodes>
+          <leafValues>
+            6.4139701426029205e-02 -1.7174859344959259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 1.0448540560901165e-03</internalNodes>
+          <leafValues>
+            -2.0927239954471588e-01 1.1022809892892838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 -1.8041099607944489e-01</internalNodes>
+          <leafValues>
+            2.5460541248321533e-01 -3.1580239534378052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 -1.8916819989681244e-01</internalNodes>
+          <leafValues>
+            -8.1439048051834106e-01 3.0212750658392906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -4.8934340476989746e-02</internalNodes>
+          <leafValues>
+            4.8329269886016846e-01 -3.1813390552997589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 -6.2278551049530506e-03</internalNodes>
+          <leafValues>
+            -2.2463080286979675e-01 9.3202292919158936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -3.6263489164412022e-03</internalNodes>
+          <leafValues>
+            9.7239963710308075e-02 -2.2094939649105072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 2.0688530057668686e-02</internalNodes>
+          <leafValues>
+            -3.9044689387083054e-02 6.9668918848037720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 -6.5703191794455051e-03</internalNodes>
+          <leafValues>
+            -1.5919350087642670e-01 3.7697389721870422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 -2.7691440191119909e-03</internalNodes>
+          <leafValues>
+            -2.1777799725532532e-01 1.1075550317764282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -2.5391899980604649e-03</internalNodes>
+          <leafValues>
+            7.6753303408622742e-02 -1.2121020257472992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 1.4522899873554707e-02</internalNodes>
+          <leafValues>
+            -4.6935468912124634e-02 4.4322049617767334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -4.8549640923738480e-03</internalNodes>
+          <leafValues>
+            -4.1040301322937012e-01 4.7296289354562759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -3.6202149931341410e-03</internalNodes>
+          <leafValues>
+            3.6707898974418640e-01 -5.0583109259605408e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>79</maxWeakCount>
+      <stageThreshold>-8.1366151571273804e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 817 9.7794737666845322e-03</internalNodes>
+          <leafValues>
+            -1.9873769581317902e-01 1.8754990398883820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 2.5764610618352890e-03</internalNodes>
+          <leafValues>
+            -1.6544049978256226e-01 1.1968299746513367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 6.6844018874689937e-04</internalNodes>
+          <leafValues>
+            8.1187427043914795e-02 -2.6954218745231628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 1.8919180147349834e-03</internalNodes>
+          <leafValues>
+            8.2398690283298492e-02 -1.9564670324325562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -8.2977651618421078e-04</internalNodes>
+          <leafValues>
+            -2.1381169557571411e-01 1.0152959823608398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -2.5124829262495041e-03</internalNodes>
+          <leafValues>
+            2.6497021317481995e-01 -8.1728130578994751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 4.9220919609069824e-03</internalNodes>
+          <leafValues>
+            -1.3837899267673492e-01 1.7047420144081116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 1.5432259533554316e-03</internalNodes>
+          <leafValues>
+            -2.3483499884605408e-01 1.2624679505825043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -7.5272549875080585e-03</internalNodes>
+          <leafValues>
+            -2.1902580559253693e-01 7.8214943408966064e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -3.2087319414131343e-04</internalNodes>
+          <leafValues>
+            9.9803313612937927e-02 -1.0052630305290222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -5.6291592773050070e-04</internalNodes>
+          <leafValues>
+            1.4587800204753876e-01 -1.3194470107555389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 -3.4248359501361847e-02</internalNodes>
+          <leafValues>
+            7.3179531097412109e-01 -2.5754369795322418e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 5.5207060649991035e-03</internalNodes>
+          <leafValues>
+            7.3829427361488342e-02 -2.4615940451622009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 3.3663161098957062e-02</internalNodes>
+          <leafValues>
+            -5.0750829279422760e-02 5.1054477691650391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 1.0605139657855034e-02</internalNodes>
+          <leafValues>
+            -1.9593380391597748e-01 9.6162728965282440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 3.6454470828175545e-03</internalNodes>
+          <leafValues>
+            -1.0274770110845566e-01 1.8021290004253387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 3.1658720225095749e-02</internalNodes>
+          <leafValues>
+            7.7415347099304199e-02 -2.3498320579528809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 6.0496449470520020e-02</internalNodes>
+          <leafValues>
+            7.9810861498117447e-03 -5.8126330375671387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -2.1451190696097910e-04</internalNodes>
+          <leafValues>
+            -2.7141410112380981e-01 7.2448231279850006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -8.9069753885269165e-03</internalNodes>
+          <leafValues>
+            1.0864660143852234e-01 -3.7890978157520294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -3.1367139890789986e-03</internalNodes>
+          <leafValues>
+            2.3194080591201782e-01 -8.3242997527122498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 -8.2477089017629623e-04</internalNodes>
+          <leafValues>
+            1.3757370412349701e-01 -4.0709521621465683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 -3.8041090010665357e-04</internalNodes>
+          <leafValues>
+            9.9655948579311371e-02 -2.0115250349044800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 3.0412159394472837e-03</internalNodes>
+          <leafValues>
+            4.8606388270854950e-02 -2.9261159896850586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 -2.7135149575769901e-03</internalNodes>
+          <leafValues>
+            -2.0402909815311432e-01 8.7270192801952362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -1.1454220116138458e-01</internalNodes>
+          <leafValues>
+            2.6342248916625977e-01 -2.8976829722523689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 -7.9219061881303787e-03</internalNodes>
+          <leafValues>
+            -2.3954220116138458e-01 7.8425459563732147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 -6.4272403717041016e-02</internalNodes>
+          <leafValues>
+            3.8651049137115479e-01 -3.4981280565261841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 2.0820159465074539e-02</internalNodes>
+          <leafValues>
+            3.6676738411188126e-02 -5.0909721851348877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 4.7503421083092690e-03</internalNodes>
+          <leafValues>
+            -4.9171518534421921e-02 1.8542270362377167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 -9.3589037656784058e-02</internalNodes>
+          <leafValues>
+            6.2822377681732178e-01 -2.5140469893813133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 -6.8223377456888556e-04</internalNodes>
+          <leafValues>
+            4.0090799331665039e-02 -1.0250650346279144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -8.3058718591928482e-03</internalNodes>
+          <leafValues>
+            -2.1625949442386627e-01 8.5505023598670959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 5.5919620208442211e-03</internalNodes>
+          <leafValues>
+            -6.5724261105060577e-02 6.1939451843500137e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 1.8336649518460035e-03</internalNodes>
+          <leafValues>
+            -1.0324809700250626e-01 2.5134149193763733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 -4.4351099058985710e-03</internalNodes>
+          <leafValues>
+            -1.5100279450416565e-01 3.7323009222745895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 -4.7271270304918289e-03</internalNodes>
+          <leafValues>
+            1.3500709831714630e-01 -1.5250219404697418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 5.3573452169075608e-04</internalNodes>
+          <leafValues>
+            -6.0964770615100861e-02 7.1996733546257019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 -1.3135100016370416e-04</internalNodes>
+          <leafValues>
+            1.2902179360389709e-01 -1.3107609748840332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 4.0799290873110294e-03</internalNodes>
+          <leafValues>
+            4.9433309584856033e-02 -1.9467090070247650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -3.1066180672496557e-03</internalNodes>
+          <leafValues>
+            2.3984549939632416e-01 -7.1281567215919495e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 1.0999400168657303e-02</internalNodes>
+          <leafValues>
+            2.9017930850386620e-02 -3.8504680991172791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 1.5001590363681316e-03</internalNodes>
+          <leafValues>
+            -8.3652436733245850e-02 1.8141129612922668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 1.3700149953365326e-02</internalNodes>
+          <leafValues>
+            3.6753259599208832e-02 -4.5086589455604553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 3.9507630281150341e-03</internalNodes>
+          <leafValues>
+            -6.9417111575603485e-02 2.1540710330009460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 -8.5161393508315086e-03</internalNodes>
+          <leafValues>
+            1.0704089701175690e-01 -1.4857380092144012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 1.7032850300893188e-03</internalNodes>
+          <leafValues>
+            -8.1896521151065826e-02 3.2398068904876709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -1.0852930136024952e-02</internalNodes>
+          <leafValues>
+            -1.3142329454421997e-01 9.9990189075469971e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 -3.7832378875464201e-03</internalNodes>
+          <leafValues>
+            9.7596637904644012e-02 -1.6081459820270538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 1.3263260014355183e-02</internalNodes>
+          <leafValues>
+            6.8189077079296112e-02 -1.4820660650730133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -4.4276300817728043e-02</internalNodes>
+          <leafValues>
+            5.3883999586105347e-01 -3.4769881516695023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 -1.6476439312100410e-02</internalNodes>
+          <leafValues>
+            -6.9341838359832764e-01 3.0285930261015892e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 1.5063960105180740e-02</internalNodes>
+          <leafValues>
+            5.0365351140499115e-02 -3.2215261459350586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 5.3230069577693939e-02</internalNodes>
+          <leafValues>
+            4.0058908052742481e-03 -1.0000929832458496e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -1.2282089889049530e-01</internalNodes>
+          <leafValues>
+            4.0438568592071533e-01 -5.4661169648170471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 -8.0205321311950684e-02</internalNodes>
+          <leafValues>
+            -1.8915909528732300e-01 3.5704288631677628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 -1.1679669842123985e-03</internalNodes>
+          <leafValues>
+            -2.7641400694847107e-01 5.9974398463964462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -3.1197320204228163e-03</internalNodes>
+          <leafValues>
+            1.1307190358638763e-01 -7.2880730032920837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 3.6612390540540218e-03</internalNodes>
+          <leafValues>
+            -4.7828570008277893e-02 3.9067369699478149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 4.6034730039536953e-03</internalNodes>
+          <leafValues>
+            -4.7448419034481049e-02 3.6146968603134155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -1.0733479866757989e-03</internalNodes>
+          <leafValues>
+            1.1264870315790176e-01 -2.9074960947036743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 -1.8310690298676491e-02</internalNodes>
+          <leafValues>
+            9.6729353070259094e-02 -1.0150820016860962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -6.8194739520549774e-02</internalNodes>
+          <leafValues>
+            -2.2048689424991608e-01 1.0977990180253983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 8.9977607131004333e-03</internalNodes>
+          <leafValues>
+            -2.9652440920472145e-02 1.5059219300746918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 2.6954131317324936e-04</internalNodes>
+          <leafValues>
+            -1.9917850196361542e-01 9.4677992165088654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 5.9090729337185621e-04</internalNodes>
+          <leafValues>
+            -1.3240300118923187e-01 6.3088178634643555e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 5.5691739544272423e-03</internalNodes>
+          <leafValues>
+            1.0318289697170258e-01 -1.9276739656925201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -9.9434129893779755e-02</internalNodes>
+          <leafValues>
+            2.5911080837249756e-01 -4.3947871774435043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 -9.6295922994613647e-03</internalNodes>
+          <leafValues>
+            -3.6871969699859619e-01 4.6506170183420181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -1.7397940391674638e-03</internalNodes>
+          <leafValues>
+            1.3736039400100708e-01 -6.9822482764720917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 -1.3269430026412010e-02</internalNodes>
+          <leafValues>
+            4.5216149091720581e-01 -3.8461238145828247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 2.5604839902371168e-03</internalNodes>
+          <leafValues>
+            5.4858781397342682e-02 -2.4963529407978058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -1.9173050532117486e-03</internalNodes>
+          <leafValues>
+            -2.5733208656311035e-01 6.7481383681297302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -3.7461649626493454e-02</internalNodes>
+          <leafValues>
+            5.9668248891830444e-01 -1.8121080473065376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 -1.9658938981592655e-03</internalNodes>
+          <leafValues>
+            1.9501520693302155e-01 -9.0026341378688812e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 -3.2596408855170012e-03</internalNodes>
+          <leafValues>
+            -3.5647168755531311e-01 4.6495281159877777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -1.2043650262057781e-02</internalNodes>
+          <leafValues>
+            3.7508749961853027e-01 -5.3072199225425720e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 4.1690650396049023e-03</internalNodes>
+          <leafValues>
+            -4.1845761239528656e-02 1.1177790164947510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 1.4214499853551388e-02</internalNodes>
+          <leafValues>
+            7.1965761482715607e-02 -2.6777520775794983e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>81</maxWeakCount>
+      <stageThreshold>-3.0813199996948242e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 896 -1.2230969965457916e-02</internalNodes>
+          <leafValues>
+            1.4567610621452332e-01 -2.4045179784297943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 -5.5717672221362591e-03</internalNodes>
+          <leafValues>
+            -1.8789610266685486e-01 4.0596708655357361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 -5.5606552632525563e-04</internalNodes>
+          <leafValues>
+            1.6649569571018219e-01 -1.1817839741706848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 8.3173572784289718e-04</internalNodes>
+          <leafValues>
+            -1.4224030077457428e-01 4.1616160422563553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -8.7869318667799234e-04</internalNodes>
+          <leafValues>
+            -1.6430449485778809e-01 1.5523290634155273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 -1.3641480356454849e-02</internalNodes>
+          <leafValues>
+            3.0867528915405273e-01 -2.7172269299626350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 1.4917860426066909e-05</internalNodes>
+          <leafValues>
+            -1.5592050552368164e-01 1.0176579654216766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 8.7703643366694450e-03</internalNodes>
+          <leafValues>
+            6.1582878232002258e-02 -3.0546051263809204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 7.5755198486149311e-03</internalNodes>
+          <leafValues>
+            -6.8759873509407043e-02 2.9675748944282532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 4.9841161817312241e-02</internalNodes>
+          <leafValues>
+            1.0127910412847996e-02 -7.9213422536849976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -1.1090819723904133e-02</internalNodes>
+          <leafValues>
+            1.8339020013809204e-01 -1.0113699734210968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 -8.5937082767486572e-02</internalNodes>
+          <leafValues>
+            -4.1994568705558777e-01 1.5568479895591736e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -1.0151329915970564e-03</internalNodes>
+          <leafValues>
+            1.1474460363388062e-01 -1.6091680526733398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -1.3470250181853771e-02</internalNodes>
+          <leafValues>
+            -3.0626448988914490e-01 5.3186140954494476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 1.6635110601782799e-02</internalNodes>
+          <leafValues>
+            -4.3458938598632812e-02 4.4043311476707458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -2.2650870960205793e-03</internalNodes>
+          <leafValues>
+            1.5985119342803955e-01 -1.2725980579853058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 7.0288166403770447e-02</internalNodes>
+          <leafValues>
+            6.4891628921031952e-02 -2.3496179282665253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 2.9186379164457321e-02</internalNodes>
+          <leafValues>
+            -2.0920279622077942e-01 8.9257873594760895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -5.0624469295144081e-03</internalNodes>
+          <leafValues>
+            3.4374091029167175e-01 -6.2093049287796021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 2.9356318991631269e-03</internalNodes>
+          <leafValues>
+            -1.4249369502067566e-01 4.5412261039018631e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 -6.7740739323198795e-03</internalNodes>
+          <leafValues>
+            3.1641799211502075e-01 -4.9601629376411438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 -1.4607170305680484e-04</internalNodes>
+          <leafValues>
+            1.0752049833536148e-01 -1.1540039628744125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -3.5684450995177031e-03</internalNodes>
+          <leafValues>
+            -4.1672629117965698e-01 4.2202819138765335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 -2.0149808842688799e-03</internalNodes>
+          <leafValues>
+            1.0860130190849304e-01 -1.6349700093269348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 -8.7240645661950111e-03</internalNodes>
+          <leafValues>
+            -2.2000640630722046e-01 9.0927027165889740e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 7.3565947823226452e-03</internalNodes>
+          <leafValues>
+            -1.0335700213909149e-01 1.6051970422267914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 3.4252731129527092e-03</internalNodes>
+          <leafValues>
+            -6.9635637104511261e-02 3.1490880250930786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 -5.7803248055279255e-03</internalNodes>
+          <leafValues>
+            -4.3639171123504639e-01 3.6127548664808273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -2.9641189612448215e-03</internalNodes>
+          <leafValues>
+            2.1797280013561249e-01 -7.7875941991806030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 2.4028679355978966e-02</internalNodes>
+          <leafValues>
+            2.5940960273146629e-02 -5.7640588283538818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 8.1514477729797363e-02</internalNodes>
+          <leafValues>
+            -3.4380380064249039e-02 5.7957500219345093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 6.7858170950785279e-04</internalNodes>
+          <leafValues>
+            1.0398740321397781e-01 -2.3831090331077576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 4.2639520019292831e-02</internalNodes>
+          <leafValues>
+            -4.1167970746755600e-02 4.0556749701499939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 -4.0414459072053432e-03</internalNodes>
+          <leafValues>
+            -3.8652890920639038e-01 5.3053580224514008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 4.2280308902263641e-02</internalNodes>
+          <leafValues>
+            1.5058529563248158e-02 -9.6623957157135010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -7.3401766712777317e-05</internalNodes>
+          <leafValues>
+            8.4438636898994446e-02 -1.0468550026416779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 4.7503020614385605e-03</internalNodes>
+          <leafValues>
+            -3.8135491311550140e-02 4.3066629767417908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 1.7291309777647257e-03</internalNodes>
+          <leafValues>
+            7.5733587145805359e-02 -1.5384200215339661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -4.8985757166519761e-04</internalNodes>
+          <leafValues>
+            1.3722479343414307e-01 -1.2631259858608246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 -2.2209450253285468e-04</internalNodes>
+          <leafValues>
+            5.1139138638973236e-02 -6.6661313176155090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 1.1202819878235459e-03</internalNodes>
+          <leafValues>
+            -1.0968499630689621e-01 1.5611450374126434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 -2.0596029236912727e-02</internalNodes>
+          <leafValues>
+            -4.5425260066986084e-01 5.6112911552190781e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 -5.1287859678268433e-03</internalNodes>
+          <leafValues>
+            -3.9422529935836792e-01 4.4144820421934128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -4.3597300536930561e-03</internalNodes>
+          <leafValues>
+            1.9391660392284393e-01 -6.5949328243732452e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 4.7703061136417091e-04</internalNodes>
+          <leafValues>
+            -1.1900710314512253e-01 1.6375440359115601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 -1.0993770323693752e-02</internalNodes>
+          <leafValues>
+            -2.9915741086006165e-01 2.8793500736355782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 8.1108389422297478e-03</internalNodes>
+          <leafValues>
+            -4.8145949840545654e-02 3.8399958610534668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 -3.6698309704661369e-03</internalNodes>
+          <leafValues>
+            8.8712036609649658e-02 -3.0650860071182251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 1.3895990559831262e-03</internalNodes>
+          <leafValues>
+            -5.5156201124191284e-02 3.5109901428222656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 1.2493750546127558e-03</internalNodes>
+          <leafValues>
+            -1.8023060262203217e-01 1.3490100204944611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 5.5981278419494629e-03</internalNodes>
+          <leafValues>
+            7.9764246940612793e-02 -2.7847459912300110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 -3.8133479654788971e-02</internalNodes>
+          <leafValues>
+            3.5153418779373169e-01 -1.7089430242776871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -4.6064890921115875e-03</internalNodes>
+          <leafValues>
+            -2.2194199264049530e-01 1.0675799846649170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -2.3793010413646698e-01</internalNodes>
+          <leafValues>
+            4.0079510211944580e-01 -6.2151808291673660e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 1.2010410428047180e-02</internalNodes>
+          <leafValues>
+            5.8646921068429947e-02 -3.5234829783439636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 8.4618777036666870e-03</internalNodes>
+          <leafValues>
+            -4.1455499827861786e-02 3.9362218976020813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 -1.4482599683105946e-02</internalNodes>
+          <leafValues>
+            -2.7049958705902100e-01 6.9400496780872345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 2.5672810152173042e-03</internalNodes>
+          <leafValues>
+            -8.2357987761497498e-02 2.2959560155868530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 6.8167857825756073e-03</internalNodes>
+          <leafValues>
+            8.5212066769599915e-02 -2.2813120484352112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -6.4145028591156006e-04</internalNodes>
+          <leafValues>
+            1.3260249793529510e-01 -8.1091962754726410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 3.8798429886810482e-04</internalNodes>
+          <leafValues>
+            -2.1800529956817627e-01 8.2977667450904846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 2.6308000087738037e-02</internalNodes>
+          <leafValues>
+            -2.5558909401297569e-02 5.8989650011062622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 2.0907879807054996e-03</internalNodes>
+          <leafValues>
+            5.7611741125583649e-02 -3.0286490917205811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -1.1132369749248028e-02</internalNodes>
+          <leafValues>
+            -1.3822869956493378e-01 4.2258080095052719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 -1.5296150231733918e-03</internalNodes>
+          <leafValues>
+            9.1749697923660278e-02 -2.2181099653244019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 6.7247601691633463e-04</internalNodes>
+          <leafValues>
+            -6.7084349691867828e-02 7.9762071371078491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 1.0386659763753414e-02</internalNodes>
+          <leafValues>
+            -7.4621170759201050e-02 2.2916689515113831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 6.2723900191485882e-04</internalNodes>
+          <leafValues>
+            -8.6500599980354309e-02 9.7814910113811493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 1.5324779786169529e-02</internalNodes>
+          <leafValues>
+            8.0094330012798309e-02 -2.2011950612068176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 -8.7603963911533356e-03</internalNodes>
+          <leafValues>
+            3.1290820240974426e-01 -5.9373341500759125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -2.3745700309518725e-04</internalNodes>
+          <leafValues>
+            1.1855959892272949e-01 -1.4514200389385223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 -1.0718279518187046e-03</internalNodes>
+          <leafValues>
+            1.2567649781703949e-01 -5.3101938217878342e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 5.3873867727816105e-04</internalNodes>
+          <leafValues>
+            -1.0715659707784653e-01 1.6037760674953461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 -6.9268636405467987e-02</internalNodes>
+          <leafValues>
+            -7.9294067621231079e-01 8.2057341933250427e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 1.0430130176246166e-02</internalNodes>
+          <leafValues>
+            5.1620200276374817e-02 -3.3472689986228943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 7.1888908743858337e-02</internalNodes>
+          <leafValues>
+            1.5941270394250751e-03 -8.5840928554534912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 2.0217420533299446e-02</internalNodes>
+          <leafValues>
+            -3.9817400276660919e-02 4.6351060271263123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 5.8006029576063156e-03</internalNodes>
+          <leafValues>
+            -2.1701389923691750e-02 9.9040143191814423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 3.5261210054159164e-02</internalNodes>
+          <leafValues>
+            1.7082870006561279e-02 -1.0000469684600830e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 -4.5255878567695618e-01</internalNodes>
+          <leafValues>
+            -9.1292119026184082e-01 5.2670161239802837e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -7.5286221690475941e-03</internalNodes>
+          <leafValues>
+            -5.2581560611724854e-01 2.2044740617275238e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>89</maxWeakCount>
+      <stageThreshold>-3.0780099868774414e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 977 2.9085609130561352e-03</internalNodes>
+          <leafValues>
+            -2.0195980370044708e-01 1.6118539869785309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -6.4552230760455132e-03</internalNodes>
+          <leafValues>
+            -1.8676100671291351e-01 3.5359650850296021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 2.7815890498459339e-03</internalNodes>
+          <leafValues>
+            -1.2228749692440033e-01 2.0362569391727448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 -7.6125850901007652e-03</internalNodes>
+          <leafValues>
+            -3.6965709924697876e-01 3.9566628634929657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 -2.5900858640670776e-01</internalNodes>
+          <leafValues>
+            6.4312630891799927e-01 3.1312569626607001e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 4.6097189188003540e-03</internalNodes>
+          <leafValues>
+            -2.7262160554528236e-02 2.1891650557518005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -1.4135500416159630e-02</internalNodes>
+          <leafValues>
+            7.6006792485713959e-02 -2.6031088829040527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 -5.9708990156650543e-03</internalNodes>
+          <leafValues>
+            -1.9146460294723511e-01 1.1078900098800659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -1.0699110571295023e-03</internalNodes>
+          <leafValues>
+            9.0127058327198029e-02 -1.9876359403133392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 1.5315730124711990e-02</internalNodes>
+          <leafValues>
+            5.1883369684219360e-02 -3.1069299578666687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -7.3937349952757359e-05</internalNodes>
+          <leafValues>
+            1.0555309802293777e-01 -1.6768750548362732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 -8.1876888871192932e-02</internalNodes>
+          <leafValues>
+            4.6053099632263184e-01 -3.8276348263025284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 -8.8246334344148636e-03</internalNodes>
+          <leafValues>
+            -3.3107680082321167e-01 6.9674566388130188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 -3.7569031119346619e-03</internalNodes>
+          <leafValues>
+            -2.7566310763359070e-01 6.9375626742839813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -3.6343189422041178e-03</internalNodes>
+          <leafValues>
+            1.6658850014209747e-01 -1.2031579762697220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 2.1979490295052528e-02</internalNodes>
+          <leafValues>
+            -2.2316349670290947e-02 3.4402579069137573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 6.1386551707983017e-02</internalNodes>
+          <leafValues>
+            1.7906000837683678e-02 -8.8129872083663940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 2.7061739936470985e-02</internalNodes>
+          <leafValues>
+            -3.2444350421428680e-02 2.8866448998451233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 -9.5964036881923676e-03</internalNodes>
+          <leafValues>
+            -3.0743318796157837e-01 5.2499480545520782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 -1.7550870543345809e-03</internalNodes>
+          <leafValues>
+            1.0434249788522720e-01 -1.1126209795475006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 1.6808100044727325e-03</internalNodes>
+          <leafValues>
+            -1.1712419986724854e-01 1.5606869757175446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 -1.3623350532725453e-03</internalNodes>
+          <leafValues>
+            2.2637459635734558e-01 -8.6454801261425018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 -3.6580429878085852e-03</internalNodes>
+          <leafValues>
+            -3.9829111099243164e-01 4.7143589705228806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 5.2668720483779907e-02</internalNodes>
+          <leafValues>
+            -1.9696790724992752e-02 4.2998239398002625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 -3.4802549635060132e-04</internalNodes>
+          <leafValues>
+            9.1115236282348633e-02 -2.0480670034885406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 1.2204200029373169e-03</internalNodes>
+          <leafValues>
+            3.3061511814594269e-02 -1.7324869334697723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -9.4577670097351074e-03</internalNodes>
+          <leafValues>
+            2.9774200916290283e-01 -5.8979131281375885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -1.7641530139371753e-03</internalNodes>
+          <leafValues>
+            -9.6304766833782196e-02 6.5304636955261230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 8.1057827919721603e-03</internalNodes>
+          <leafValues>
+            5.7158369570970535e-02 -3.1123921275138855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 1.3963400386273861e-02</internalNodes>
+          <leafValues>
+            -3.5234641283750534e-02 3.5719850659370422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 -3.1854680273681879e-03</internalNodes>
+          <leafValues>
+            -2.1528400480747223e-01 7.6040878891944885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -4.3546650558710098e-03</internalNodes>
+          <leafValues>
+            -8.3892293274402618e-02 2.8290690854191780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 -1.6740639694035053e-03</internalNodes>
+          <leafValues>
+            1.5145839750766754e-01 -1.1756320297718048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 -2.7018489781767130e-03</internalNodes>
+          <leafValues>
+            1.3833570480346680e-01 -5.0832830369472504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 2.2117499611340463e-04</internalNodes>
+          <leafValues>
+            -2.3960849642753601e-01 7.5004346668720245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 2.2773200646042824e-02</internalNodes>
+          <leafValues>
+            -2.2433629259467125e-02 3.7049260735511780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 9.5928199589252472e-03</internalNodes>
+          <leafValues>
+            9.7205437719821930e-02 -1.7737109959125519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 3.3168029040098190e-03</internalNodes>
+          <leafValues>
+            -5.6414358317852020e-02 9.1938421130180359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 -2.3929888848215342e-03</internalNodes>
+          <leafValues>
+            2.1076680719852448e-01 -9.2880353331565857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 -1.0766570456326008e-02</internalNodes>
+          <leafValues>
+            -1.2974379956722260e-01 5.9958908706903458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 9.9714798852801323e-04</internalNodes>
+          <leafValues>
+            -1.4279229938983917e-01 1.4279709756374359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 -6.6825798712670803e-03</internalNodes>
+          <leafValues>
+            -2.3819839954376221e-01 4.8119660466909409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 -3.7201410159468651e-03</internalNodes>
+          <leafValues>
+            1.9953179359436035e-01 -9.0783573687076569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -1.8553409725427628e-02</internalNodes>
+          <leafValues>
+            -2.6621541380882263e-01 2.2872749716043472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 3.0256200116127729e-03</internalNodes>
+          <leafValues>
+            -9.1106131672859192e-02 2.4559549987316132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 -6.2146309763193130e-02</internalNodes>
+          <leafValues>
+            -1. 5.2797337993979454e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 1.7690609674900770e-03</internalNodes>
+          <leafValues>
+            -1.9379650056362152e-01 9.5696106553077698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 -4.3277359509374946e-05</internalNodes>
+          <leafValues>
+            1.1374049633741379e-01 -1.3504849374294281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 1.2779419776052237e-03</internalNodes>
+          <leafValues>
+            7.9606160521507263e-02 -2.3597019910812378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 -4.4742479920387268e-02</internalNodes>
+          <leafValues>
+            1.8557150661945343e-01 -3.4167829900979996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 2.7726130792871118e-04</internalNodes>
+          <leafValues>
+            -5.7937718927860260e-02 2.8903219103813171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 5.6225471198558807e-02</internalNodes>
+          <leafValues>
+            1.3840789906680584e-02 -7.7199739217758179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 8.6825769394636154e-03</internalNodes>
+          <leafValues>
+            -1.8263089656829834e-01 1.1423269659280777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -2.4038869887590408e-03</internalNodes>
+          <leafValues>
+            -1.9004139304161072e-01 6.5928563475608826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 1.2840219773352146e-02</internalNodes>
+          <leafValues>
+            -3.6279100924730301e-02 4.5519340038299561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 1.1061480036005378e-03</internalNodes>
+          <leafValues>
+            -6.3054688274860382e-02 8.1609472632408142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -4.6486179344356060e-03</internalNodes>
+          <leafValues>
+            -2.7108541131019592e-01 8.0167703330516815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 6.4021991565823555e-03</internalNodes>
+          <leafValues>
+            -6.6946588456630707e-02 1.0634910315275192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -8.2370378077030182e-02</internalNodes>
+          <leafValues>
+            3.4517300128936768e-01 -4.8468429595232010e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 -3.7429828196763992e-02</internalNodes>
+          <leafValues>
+            -6.9630950689315796e-01 1.3054380193352699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 1.0500400327146053e-02</internalNodes>
+          <leafValues>
+            9.6028283238410950e-02 -2.6362740993499756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 6.8851239979267120e-02</internalNodes>
+          <leafValues>
+            3.7341150455176830e-03 -9.9989157915115356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 1.0171310277655721e-03</internalNodes>
+          <leafValues>
+            -2.3500110208988190e-01 9.1097183525562286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -2.9057949781417847e-02</internalNodes>
+          <leafValues>
+            5.9977847337722778e-01 -3.6899000406265259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 2.2022729739546776e-02</internalNodes>
+          <leafValues>
+            5.8034650981426239e-02 -3.2748758792877197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 -4.3123541399836540e-03</internalNodes>
+          <leafValues>
+            2.2153949737548828e-01 -6.1332020908594131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 1.0949710384011269e-02</internalNodes>
+          <leafValues>
+            2.1837379783391953e-02 -7.4662190675735474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 4.3610740453004837e-02</internalNodes>
+          <leafValues>
+            -4.5098949223756790e-02 2.8109139204025269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 7.7252179384231567e-02</internalNodes>
+          <leafValues>
+            2.0801780745387077e-02 -8.6648237705230713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 -2.4023890495300293e-02</internalNodes>
+          <leafValues>
+            3.9884421229362488e-01 -3.5227119922637939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 1.9559780135750771e-02</internalNodes>
+          <leafValues>
+            3.5944730043411255e-02 -5.1469117403030396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 2.5917299091815948e-02</internalNodes>
+          <leafValues>
+            -1.2942669913172722e-02 4.1695970296859741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -4.6949301031418145e-04</internalNodes>
+          <leafValues>
+            1.6665999591350555e-01 -9.0680040419101715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -8.4590032696723938e-02</internalNodes>
+          <leafValues>
+            -5.9283781051635742e-01 7.2113061323761940e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 -8.9234940242022276e-04</internalNodes>
+          <leafValues>
+            1.7458200454711914e-01 -1.0072509944438934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 -2.4009350687265396e-02</internalNodes>
+          <leafValues>
+            -3.9131438732147217e-01 2.2361040115356445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 -4.7586968867108226e-04</internalNodes>
+          <leafValues>
+            1.8306100368499756e-01 -1.2541130185127258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 2.9483099933713675e-03</internalNodes>
+          <leafValues>
+            6.5301053225994110e-02 -2.0387080311775208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 3.6947780754417181e-03</internalNodes>
+          <leafValues>
+            -6.0878321528434753e-02 3.0403020977973938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 -2.9413169249892235e-03</internalNodes>
+          <leafValues>
+            -3.0284491181373596e-01 4.7550499439239502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -7.1274640504270792e-04</internalNodes>
+          <leafValues>
+            1.6200789809226990e-01 -1.1822160333395004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 2.4309750646352768e-02</internalNodes>
+          <leafValues>
+            -1.1442789807915688e-02 2.0453959703445435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 -9.1473112115636468e-04</internalNodes>
+          <leafValues>
+            -2.0707829296588898e-01 7.5701341032981873e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 -3.6473390646278858e-03</internalNodes>
+          <leafValues>
+            2.4093860387802124e-01 -8.3565562963485718e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 1.2513220310211182e-02</internalNodes>
+          <leafValues>
+            4.1536040604114532e-02 -3.7487721443176270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 6.2148571014404297e-03</internalNodes>
+          <leafValues>
+            2.0434129983186722e-02 -9.0057849884033203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 -2.0954229403287172e-03</internalNodes>
+          <leafValues>
+            1.1625260114669800e-01 -1.8561770021915436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 -2.1173250675201416e-01</internalNodes>
+          <leafValues>
+            -1. 2.4372090119868517e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 1.0188589803874493e-03</internalNodes>
+          <leafValues>
+            -7.5683966279029846e-02 2.9555431008338928e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>77</maxWeakCount>
+      <stageThreshold>-3.0694400787353516e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1066 -2.4422600865364075e-02</internalNodes>
+          <leafValues>
+            2.0446979999542236e-01 -2.2299669682979584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 1.0574000189080834e-03</internalNodes>
+          <leafValues>
+            -1.4355170726776123e-01 8.5603542625904083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 2.5123930536210537e-03</internalNodes>
+          <leafValues>
+            1.0997679829597473e-01 -2.3044809699058533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 1.2112739682197571e-01</internalNodes>
+          <leafValues>
+            3.3267501741647720e-02 -9.9910151958465576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 2.9103590641170740e-03</internalNodes>
+          <leafValues>
+            -1.0391929745674133e-01 1.9292880594730377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 -8.6717177182435989e-03</internalNodes>
+          <leafValues>
+            -2.7087220549583435e-01 9.9762901663780212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 6.1140959151089191e-03</internalNodes>
+          <leafValues>
+            -1.1517100036144257e-01 2.0429219305515289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 2.0590990781784058e-02</internalNodes>
+          <leafValues>
+            -3.3107578754425049e-02 4.6375459432601929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 1.1507490416988730e-03</internalNodes>
+          <leafValues>
+            7.6014623045921326e-02 -2.7485209703445435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 6.5449788235127926e-03</internalNodes>
+          <leafValues>
+            -1.1266589909791946e-01 5.0031568855047226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 1.6102850204333663e-03</internalNodes>
+          <leafValues>
+            -1.8794959783554077e-01 1.1234410107135773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 2.8527909889817238e-03</internalNodes>
+          <leafValues>
+            4.0457468479871750e-02 -8.4716461598873138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 -4.0883300825953484e-03</internalNodes>
+          <leafValues>
+            1.2509189546108246e-01 -1.4850109815597534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 1.6648479504510760e-03</internalNodes>
+          <leafValues>
+            -1.0346720367670059e-01 5.3585231304168701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 -3.1635090708732605e-03</internalNodes>
+          <leafValues>
+            -3.3729389309883118e-01 6.1192918568849564e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 -1.0922599583864212e-02</internalNodes>
+          <leafValues>
+            4.5238488912582397e-01 -5.7903379201889038e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 -3.3356929197907448e-03</internalNodes>
+          <leafValues>
+            3.3880978822708130e-01 -6.4470112323760986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 -3.0014500021934509e-02</internalNodes>
+          <leafValues>
+            -8.2835501432418823e-01 2.4696119129657745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 -3.0110439658164978e-01</internalNodes>
+          <leafValues>
+            -8.3429050445556641e-01 1.4369309879839420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 -4.2447918094694614e-03</internalNodes>
+          <leafValues>
+            -1.2281739711761475e-01 2.8134100139141083e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 7.7825621701776981e-03</internalNodes>
+          <leafValues>
+            -6.9222308695316315e-02 2.5814509391784668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 -1.2726710177958012e-02</internalNodes>
+          <leafValues>
+            1.0745859891176224e-01 -7.6575823128223419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 4.7346940264105797e-03</internalNodes>
+          <leafValues>
+            4.4127859175205231e-02 -3.8045680522918701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 3.4512639977037907e-03</internalNodes>
+          <leafValues>
+            -4.2947210371494293e-02 4.6074831485748291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 5.6996050989255309e-04</internalNodes>
+          <leafValues>
+            6.6926121711730957e-02 -2.9685848951339722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 -5.3889099508523941e-02</internalNodes>
+          <leafValues>
+            -1. 3.9760880172252655e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 1.0263220174238086e-03</internalNodes>
+          <leafValues>
+            -1.1138930171728134e-01 1.7764210700988770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 3.9374440908432007e-02</internalNodes>
+          <leafValues>
+            1.2977429665625095e-02 -6.3669937849044800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 1.8777979537844658e-02</internalNodes>
+          <leafValues>
+            -3.9334569126367569e-02 4.5990169048309326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 1.5851920470595360e-03</internalNodes>
+          <leafValues>
+            -1.0917869955301285e-01 5.6247789412736893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 -1.0857740417122841e-02</internalNodes>
+          <leafValues>
+            -2.0176340639591217e-01 9.0685456991195679e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 4.4399261474609375e-02</internalNodes>
+          <leafValues>
+            1.9891490228474140e-03 -9.9981158971786499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 -1.7311190022155643e-03</internalNodes>
+          <leafValues>
+            1.4699029922485352e-01 -1.4069539308547974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 -1.6609770245850086e-03</internalNodes>
+          <leafValues>
+            1.6190530359745026e-01 -5.5535599589347839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 -4.3332851491868496e-03</internalNodes>
+          <leafValues>
+            -3.3971568942070007e-01 4.3209198862314224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 -4.4786658691009507e-05</internalNodes>
+          <leafValues>
+            1.0217490047216415e-01 -1.0289809852838516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 -1.2255939655005932e-02</internalNodes>
+          <leafValues>
+            4.6331259608268738e-01 -3.8829129189252853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 3.1728390604257584e-02</internalNodes>
+          <leafValues>
+            -1.0918959975242615e-02 1.9252130389213562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 8.6054168641567230e-03</internalNodes>
+          <leafValues>
+            5.3962308913469315e-02 -3.3835870027542114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 2.4249579291790724e-03</internalNodes>
+          <leafValues>
+            -4.3876059353351593e-02 2.4977789819240570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 -1.9957860931754112e-03</internalNodes>
+          <leafValues>
+            1.1398400366306305e-01 -1.7925310134887695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 4.6042509377002716e-02</internalNodes>
+          <leafValues>
+            2.0680939778685570e-03 -8.7673932313919067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 2.4898271076381207e-03</internalNodes>
+          <leafValues>
+            -6.9595612585544586e-02 2.6142540574073792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 1.0052820434793830e-03</internalNodes>
+          <leafValues>
+            4.5501660555601120e-02 -1.2399580329656601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 9.0297553688287735e-03</internalNodes>
+          <leafValues>
+            -7.1272410452365875e-02 2.2919359803199768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 1.2028490193188190e-02</internalNodes>
+          <leafValues>
+            2.0230330526828766e-02 -3.4052988886833191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 2.3313730489462614e-03</internalNodes>
+          <leafValues>
+            8.7259337306022644e-02 -2.3195190727710724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 9.5184362726286054e-04</internalNodes>
+          <leafValues>
+            -2.3168809711933136e-01 5.5022191256284714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 9.6378661692142487e-03</internalNodes>
+          <leafValues>
+            -4.1655559092760086e-02 4.2928260564804077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 1.3566980138421059e-02</internalNodes>
+          <leafValues>
+            4.5669659972190857e-02 -2.2501240670681000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 3.3653501421213150e-02</internalNodes>
+          <leafValues>
+            -6.7861579358577728e-02 3.6967611312866211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 -6.0395020991563797e-02</internalNodes>
+          <leafValues>
+            -9.0887361764907837e-01 3.8193699438124895e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 1.3169209705665708e-03</internalNodes>
+          <leafValues>
+            -1.5941339731216431e-01 1.4766550064086914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -9.7704064100980759e-03</internalNodes>
+          <leafValues>
+            -1.2848410010337830e-01 4.7832399606704712e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 -4.5100511051714420e-03</internalNodes>
+          <leafValues>
+            1.2574909627437592e-01 -2.1964469552040100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 -2.0346629898995161e-03</internalNodes>
+          <leafValues>
+            -1.8574400246143341e-01 4.9177091568708420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 1.3294390402734280e-02</internalNodes>
+          <leafValues>
+            9.1497242450714111e-02 -2.1343930065631866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 -4.0054250508546829e-02</internalNodes>
+          <leafValues>
+            3.1770059466362000e-01 -3.1080769374966621e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 2.5492990389466286e-02</internalNodes>
+          <leafValues>
+            3.8877040147781372e-02 -4.5658990740776062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 -3.8089688867330551e-02</internalNodes>
+          <leafValues>
+            6.6615498065948486e-01 -1.9895339384675026e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -2.1308319270610809e-01</internalNodes>
+          <leafValues>
+            -8.6534178256988525e-01 2.0898429676890373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -8.9727543294429779e-02</internalNodes>
+          <leafValues>
+            2.5725919008255005e-01 -4.6261668205261230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 2.5075700134038925e-02</internalNodes>
+          <leafValues>
+            4.1259508579969406e-02 -3.7666648626327515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 2.3366149514913559e-02</internalNodes>
+          <leafValues>
+            -7.2202831506729126e-02 2.4737030267715454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 2.8038409072905779e-04</internalNodes>
+          <leafValues>
+            -7.9473547637462616e-02 2.2478230297565460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 8.2364194095134735e-03</internalNodes>
+          <leafValues>
+            5.1211010664701462e-02 -1.3328659534454346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 5.3922779858112335e-02</internalNodes>
+          <leafValues>
+            1.7108399420976639e-02 -8.9256042242050171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 2.7015779633074999e-03</internalNodes>
+          <leafValues>
+            -1.8405599892139435e-01 1.2830390036106110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 -1.6505690291523933e-02</internalNodes>
+          <leafValues>
+            6.2239181995391846e-01 -2.6413690298795700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 -1.8418730469420552e-03</internalNodes>
+          <leafValues>
+            -1.2646800279617310e-01 4.8690851777791977e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 5.1953629590570927e-03</internalNodes>
+          <leafValues>
+            4.5653700828552246e-02 -3.2519981265068054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 5.0785308703780174e-03</internalNodes>
+          <leafValues>
+            4.0703259408473969e-02 -2.0620769262313843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 5.0687040202319622e-03</internalNodes>
+          <leafValues>
+            -7.6456248760223389e-02 2.5867408514022827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 -1.1892319656908512e-02</internalNodes>
+          <leafValues>
+            -2.2366219758987427e-01 3.0855409801006317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 2.4257500190287828e-03</internalNodes>
+          <leafValues>
+            -7.1597889065742493e-02 2.6108819246292114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 -1.1990379542112350e-02</internalNodes>
+          <leafValues>
+            2.2678479552268982e-01 -1.0305509716272354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 -2.2772200405597687e-02</internalNodes>
+          <leafValues>
+            -2.3770140111446381e-01 7.6630853116512299e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>78</maxWeakCount>
+      <stageThreshold>-3.0664699554443359e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1143 3.3625920768827200e-03</internalNodes>
+          <leafValues>
+            -1.8268440663814545e-01 1.5935519337654114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 4.4937757775187492e-03</internalNodes>
+          <leafValues>
+            -8.9438192546367645e-02 2.8422310948371887e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 -8.8971032528206706e-04</internalNodes>
+          <leafValues>
+            9.5665588974952698e-02 -1.9407069683074951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 2.6789100375026464e-03</internalNodes>
+          <leafValues>
+            -1.0152669996023178e-01 1.7864160239696503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 -4.0554129518568516e-03</internalNodes>
+          <leafValues>
+            -2.3337660729885101e-01 1.2279739975929260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 -1.7742250114679337e-02</internalNodes>
+          <leafValues>
+            1.9190870225429535e-01 -3.1710729002952576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 3.0996970599517226e-04</internalNodes>
+          <leafValues>
+            -1.9344709813594818e-01 9.9541679024696350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 -3.7737619131803513e-03</internalNodes>
+          <leafValues>
+            -2.0298850536346436e-01 7.9316012561321259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 1.4448439469560981e-03</internalNodes>
+          <leafValues>
+            -5.9811491519212723e-02 4.1375398635864258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 4.1589159518480301e-03</internalNodes>
+          <leafValues>
+            -9.2934109270572662e-02 7.7575348317623138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 9.7764004021883011e-03</internalNodes>
+          <leafValues>
+            5.3027391433715820e-02 -3.6435180902481079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -2.8739850968122482e-03</internalNodes>
+          <leafValues>
+            1.2728120386600494e-01 -3.2182350754737854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 4.3552028946578503e-03</internalNodes>
+          <leafValues>
+            -1.4472070336341858e-01 1.4171679317951202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -1.2132039666175842e-01</internalNodes>
+          <leafValues>
+            1.5284240245819092e-01 -2.6948520913720131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 7.5531532056629658e-03</internalNodes>
+          <leafValues>
+            1.0153439640998840e-01 -1.8715800344944000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 4.8978552222251892e-03</internalNodes>
+          <leafValues>
+            2.8034990653395653e-02 -1.4224380254745483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 -1.8711129669100046e-03</internalNodes>
+          <leafValues>
+            1.5129889547824860e-01 -1.3912929594516754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 4.1867699474096298e-02</internalNodes>
+          <leafValues>
+            1.8230549991130829e-02 -5.6771957874298096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 -8.4031058941036463e-04</internalNodes>
+          <leafValues>
+            1.5392039716243744e-01 -1.2112110108137131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 3.6289851414039731e-04</internalNodes>
+          <leafValues>
+            -7.9913586378097534e-02 7.0097483694553375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 -4.4498889474198222e-04</internalNodes>
+          <leafValues>
+            1.6784679889678955e-01 -1.3805930316448212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 2.2194290068000555e-03</internalNodes>
+          <leafValues>
+            5.8453138917684555e-02 -1.2374790012836456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 -2.5759059935808182e-03</internalNodes>
+          <leafValues>
+            2.2619499266147614e-01 -8.6251437664031982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 5.8989811688661575e-02</internalNodes>
+          <leafValues>
+            6.9204131141304970e-03 -7.3367577791213989e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 -2.7889141440391541e-01</internalNodes>
+          <leafValues>
+            4.6728101372718811e-01 -3.8612861186265945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 -5.3824000060558319e-03</internalNodes>
+          <leafValues>
+            -1.6939850151538849e-01 6.1394538730382919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 -8.9165568351745605e-04</internalNodes>
+          <leafValues>
+            -2.4867910146713257e-01 7.6590277254581451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 1.2071889825165272e-02</internalNodes>
+          <leafValues>
+            8.9360373094677925e-03 -2.7028709650039673e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 3.8453561137430370e-04</internalNodes>
+          <leafValues>
+            9.9488303065299988e-02 -2.1522629261016846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 -2.2118990309536457e-03</internalNodes>
+          <leafValues>
+            4.0786389261484146e-02 -1.1563809961080551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 2.0960820838809013e-02</internalNodes>
+          <leafValues>
+            -3.1355928629636765e-02 7.1006178855895996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 -3.9021030534058809e-03</internalNodes>
+          <leafValues>
+            -1.7460019886493683e-01 4.0775351226329803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 -4.5169141230871901e-05</internalNodes>
+          <leafValues>
+            1.2105180323123932e-01 -1.6618220508098602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 6.9195672869682312e-02</internalNodes>
+          <leafValues>
+            7.6447450555860996e-03 -5.9211570024490356e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 -1.1615910334512591e-03</internalNodes>
+          <leafValues>
+            2.2584970295429230e-01 -9.1772772371768951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 4.5347518607741222e-05</internalNodes>
+          <leafValues>
+            -2.0863719284534454e-01 9.0364061295986176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 -1.9045149907469749e-02</internalNodes>
+          <leafValues>
+            4.2344009876251221e-01 -4.6018179506063461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 4.1966438293457031e-03</internalNodes>
+          <leafValues>
+            -2.8369670733809471e-02 3.0800709128379822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 2.5357000413350761e-04</internalNodes>
+          <leafValues>
+            -2.8971961140632629e-01 7.5374223291873932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 1.0817909985780716e-01</internalNodes>
+          <leafValues>
+            -1.4286429621279240e-02 7.2823339700698853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 -5.5140778422355652e-03</internalNodes>
+          <leafValues>
+            -1.8854649364948273e-01 1.1378549784421921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 5.5264509283006191e-03</internalNodes>
+          <leafValues>
+            7.0834018290042877e-02 -1.8397599458694458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 6.4198831096291542e-03</internalNodes>
+          <leafValues>
+            -1.1449480056762695e-01 1.9120390713214874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 1.9314220547676086e-01</internalNodes>
+          <leafValues>
+            1.4066229574382305e-02 -6.9772118330001831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 4.0670208632946014e-02</internalNodes>
+          <leafValues>
+            -2.4279089644551277e-02 7.8828179836273193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 -2.1965131163597107e-03</internalNodes>
+          <leafValues>
+            -2.0105579495429993e-01 5.1050510257482529e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -4.7381771728396416e-03</internalNodes>
+          <leafValues>
+            2.5222310423851013e-01 -7.3429226875305176e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 7.1773640811443329e-02</internalNodes>
+          <leafValues>
+            -9.0609909966588020e-03 9.2946898937225342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 6.9466611603274941e-04</internalNodes>
+          <leafValues>
+            1.0625690221786499e-01 -1.9162459671497345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 2.6388010010123253e-03</internalNodes>
+          <leafValues>
+            6.3330717384815216e-02 -2.0404089987277985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 -3.1406691414304078e-04</internalNodes>
+          <leafValues>
+            1.7990510165691376e-01 -9.8495960235595703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 -5.8691151207312942e-04</internalNodes>
+          <leafValues>
+            8.5071258246898651e-02 -7.6974540948867798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 1.0376359568908811e-03</internalNodes>
+          <leafValues>
+            -1.1096309870481491e-01 1.5985070168972015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 1.6373570542782545e-03</internalNodes>
+          <leafValues>
+            1.1128730326890945e-01 -1.2352730333805084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 -7.3773309122771025e-04</internalNodes>
+          <leafValues>
+            1.2890860438346863e-01 -1.4294579625129700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 -1.6841450706124306e-02</internalNodes>
+          <leafValues>
+            -2.4231070280075073e-01 2.0597470924258232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 -3.0590690672397614e-02</internalNodes>
+          <leafValues>
+            3.3513951301574707e-01 -4.7183569520711899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 1.0214540176093578e-02</internalNodes>
+          <leafValues>
+            5.5497199296951294e-02 -2.3405939340591431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 -1.1853770120069385e-03</internalNodes>
+          <leafValues>
+            9.2074163258075714e-02 -1.7347140610218048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 1.1729650432243943e-03</internalNodes>
+          <leafValues>
+            -8.4075942635536194e-02 2.0689530670642853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 1.0894170030951500e-02</internalNodes>
+          <leafValues>
+            5.6475941091775894e-02 -3.1677180528640747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 -2.0437049679458141e-03</internalNodes>
+          <leafValues>
+            1.8796369433403015e-01 -9.8889023065567017e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 -5.7676038704812527e-03</internalNodes>
+          <leafValues>
+            -2.5189259648323059e-01 7.5108267366886139e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 6.9624483585357666e-02</internalNodes>
+          <leafValues>
+            -1.7661379650235176e-02 4.3390399217605591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 -3.1853429391048849e-04</internalNodes>
+          <leafValues>
+            -2.9378080368041992e-01 5.8162420988082886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 1.7543470021337271e-03</internalNodes>
+          <leafValues>
+            2.6858489960432053e-02 -1.5225639939308167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 1.2951970566064119e-03</internalNodes>
+          <leafValues>
+            -7.1769118309020996e-02 3.8101229071617126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 2.0549140870571136e-02</internalNodes>
+          <leafValues>
+            -2.3171430453658104e-02 2.7228319644927979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 2.7475480455905199e-03</internalNodes>
+          <leafValues>
+            6.7207306623458862e-02 -2.7162951231002808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 5.2633951418101788e-03</internalNodes>
+          <leafValues>
+            -1.3931609690189362e-01 1.1821229755878448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 -5.2199261263012886e-03</internalNodes>
+          <leafValues>
+            -3.3213511109352112e-01 4.7329191118478775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 9.9096707999706268e-03</internalNodes>
+          <leafValues>
+            -6.9706782698631287e-02 1.9954280555248260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 -1.0334379971027374e-01</internalNodes>
+          <leafValues>
+            4.2418560385704041e-01 -3.9896268397569656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 -1.3322319835424423e-02</internalNodes>
+          <leafValues>
+            -2.5508868694305420e-01 4.1351031512022018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 1.7832260346040130e-03</internalNodes>
+          <leafValues>
+            -1.7664439976215363e-01 1.0336239635944366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 6.3282333314418793e-02</internalNodes>
+          <leafValues>
+            1.2395679950714111e-02 -4.6355250477790833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 -5.1022358238697052e-03</internalNodes>
+          <leafValues>
+            4.0670639276504517e-01 -5.0193451344966888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 3.9891529828310013e-02</internalNodes>
+          <leafValues>
+            3.7219129502773285e-02 -5.5696451663970947e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          3 4 12 16 -1.</_>
+        <_>
+          7 4 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 20 -1.</_>
+        <_>
+          11 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 4 22 -1.</_>
+        <_>
+          4 12 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 7 12 -1.</_>
+        <_>
+          9 14 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 10 -1.</_>
+        <_>
+          6 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 18 5 -1.</_>
+        <_>
+          1 18 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 10 6 -1.</_>
+        <_>
+          6 20 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 20 -1.</_>
+        <_>
+          0 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 14 -1.</_>
+        <_>
+          3 7 16 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 13 -1.</_>
+        <_>
+          7 1 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 12 -1.</_>
+        <_>
+          10 8 9 6 2.</_>
+        <_>
+          1 14 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 21 -1.</_>
+        <_>
+          7 0 5 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 18 -1.</_>
+        <_>
+          10 5 9 9 2.</_>
+        <_>
+          1 14 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 15 3 -1.</_>
+        <_>
+          7 19 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 20 12 3 -1.</_>
+        <_>
+          7 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 14 2 -1.</_>
+        <_>
+          8 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 6 -1.</_>
+        <_>
+          6 16 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 20 -1.</_>
+        <_>
+          8 13 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 18 3 -1.</_>
+        <_>
+          9 19 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 5 -1.</_>
+        <_>
+          5 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 14 -1.</_>
+        <_>
+          5 9 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 18 -1.</_>
+        <_>
+          12 12 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 9 -1.</_>
+        <_>
+          3 14 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 11 8 -1.</_>
+        <_>
+          7 17 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 10 -1.</_>
+        <_>
+          0 7 3 5 2.</_>
+        <_>
+          3 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 13 -1.</_>
+        <_>
+          10 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 13 -1.</_>
+        <_>
+          7 6 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 8 -1.</_>
+        <_>
+          8 2 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 19 12 -1.</_>
+        <_>
+          0 17 19 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 6 5 -1.</_>
+        <_>
+          3 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 15 3 -1.</_>
+        <_>
+          5 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 8 4 -1.</_>
+        <_>
+          9 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 6 -1.</_>
+        <_>
+          3 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 5 6 -1.</_>
+        <_>
+          14 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 14 -1.</_>
+        <_>
+          7 2 5 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 5 6 -1.</_>
+        <_>
+          14 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 5 6 -1.</_>
+        <_>
+          0 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 8 -1.</_>
+        <_>
+          3 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 14 2 -1.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 15 -1.</_>
+        <_>
+          9 4 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 8 5 -1.</_>
+        <_>
+          5 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 15 -1.</_>
+        <_>
+          9 4 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 15 -1.</_>
+        <_>
+          8 4 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 8 8 -1.</_>
+        <_>
+          15 11 4 4 2.</_>
+        <_>
+          11 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 7 -1.</_>
+        <_>
+          6 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 8 13 -1.</_>
+        <_>
+          7 1 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 18 2 -1.</_>
+        <_>
+          9 21 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 8 5 -1.</_>
+        <_>
+          7 18 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 8 6 -1.</_>
+        <_>
+          8 17 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 7 10 -1.</_>
+        <_>
+          10 2 7 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 14 -1.</_>
+        <_>
+          3 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 16 -1.</_>
+        <_>
+          15 7 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 15 -1.</_>
+        <_>
+          3 8 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 14 -1.</_>
+        <_>
+          14 0 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 8 9 -1.</_>
+        <_>
+          9 6 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 15 11 8 -1.</_>
+        <_>
+          8 17 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 10 -1.</_>
+        <_>
+          7 7 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 9 8 -1.</_>
+        <_>
+          10 17 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 9 8 -1.</_>
+        <_>
+          0 17 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 17 18 -1.</_>
+        <_>
+          2 10 17 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 2 -1.</_>
+        <_>
+          2 0 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 10 -1.</_>
+        <_>
+          6 0 3 5 2.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 11 -1.</_>
+        <_>
+          7 4 5 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 4 8 -1.</_>
+        <_>
+          15 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 4 8 -1.</_>
+        <_>
+          2 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 11 -1.</_>
+        <_>
+          7 6 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 16 4 -1.</_>
+        <_>
+          7 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 10 8 -1.</_>
+        <_>
+          9 3 5 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 7 10 -1.</_>
+        <_>
+          12 6 7 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 5 -1.</_>
+        <_>
+          5 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 14 3 -1.</_>
+        <_>
+          9 20 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 14 2 -1.</_>
+        <_>
+          4 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 14 -1.</_>
+        <_>
+          9 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 14 -1.</_>
+        <_>
+          9 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 16 -1.</_>
+        <_>
+          5 11 9 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 8 -1.</_>
+        <_>
+          11 17 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 7 6 -1.</_>
+        <_>
+          4 19 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 8 -1.</_>
+        <_>
+          10 13 8 4 2.</_>
+        <_>
+          2 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 15 3 -1.</_>
+        <_>
+          2 19 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 15 3 -1.</_>
+        <_>
+          7 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 11 16 -1.</_>
+        <_>
+          8 4 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 18 -1.</_>
+        <_>
+          0 6 19 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 11 16 -1.</_>
+        <_>
+          8 4 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 4 20 -1.</_>
+        <_>
+          0 6 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 15 4 -1.</_>
+        <_>
+          8 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 6 -1.</_>
+        <_>
+          0 9 9 3 2.</_>
+        <_>
+          9 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 14 -1.</_>
+        <_>
+          9 5 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 8 -1.</_>
+        <_>
+          3 0 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 6 -1.</_>
+        <_>
+          10 6 9 3 2.</_>
+        <_>
+          1 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 15 -1.</_>
+        <_>
+          8 7 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 10 -1.</_>
+        <_>
+          11 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 10 -1.</_>
+        <_>
+          0 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 9 5 -1.</_>
+        <_>
+          5 16 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 11 -1.</_>
+        <_>
+          13 11 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 11 -1.</_>
+        <_>
+          7 8 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 5 -1.</_>
+        <_>
+          8 7 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 15 3 -1.</_>
+        <_>
+          7 11 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          7 1 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 14 4 -1.</_>
+        <_>
+          5 1 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 10 -1.</_>
+        <_>
+          10 9 9 5 2.</_>
+        <_>
+          1 14 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 14 -1.</_>
+        <_>
+          9 7 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 19 16 -1.</_>
+        <_>
+          0 9 19 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 14 -1.</_>
+        <_>
+          10 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 14 6 -1.</_>
+        <_>
+          2 11 7 3 2.</_>
+        <_>
+          9 14 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 14 -1.</_>
+        <_>
+          10 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 14 -1.</_>
+        <_>
+          8 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 5 6 -1.</_>
+        <_>
+          7 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 15 -1.</_>
+        <_>
+          5 11 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 10 -1.</_>
+        <_>
+          11 0 3 5 2.</_>
+        <_>
+          8 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 21 -1.</_>
+        <_>
+          5 9 2 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 10 4 -1.</_>
+        <_>
+          9 19 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 4 8 -1.</_>
+        <_>
+          4 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 22 -1.</_>
+        <_>
+          11 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 15 3 -1.</_>
+        <_>
+          5 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 8 4 -1.</_>
+        <_>
+          10 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 8 4 -1.</_>
+        <_>
+          5 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 10 -1.</_>
+        <_>
+          13 2 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 9 -1.</_>
+        <_>
+          9 4 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 10 -1.</_>
+        <_>
+          10 7 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 9 -1.</_>
+        <_>
+          7 1 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 7 -1.</_>
+        <_>
+          7 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 10 -1.</_>
+        <_>
+          10 7 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 2 -1.</_>
+        <_>
+          9 7 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 16 4 7 -1.</_>
+        <_>
+          13 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 10 -1.</_>
+        <_>
+          8 9 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 14 4 -1.</_>
+        <_>
+          12 18 7 2 2.</_>
+        <_>
+          5 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 3 -1.</_>
+        <_>
+          5 1 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 22 -1.</_>
+        <_>
+          11 11 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 8 -1.</_>
+        <_>
+          5 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 14 -1.</_>
+        <_>
+          11 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 14 -1.</_>
+        <_>
+          7 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 20 -1.</_>
+        <_>
+          11 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 16 4 -1.</_>
+        <_>
+          5 19 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 20 -1.</_>
+        <_>
+          11 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 2 20 -1.</_>
+        <_>
+          7 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 22 -1.</_>
+        <_>
+          11 11 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 4 -1.</_>
+        <_>
+          0 18 7 2 2.</_>
+        <_>
+          7 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 8 -1.</_>
+        <_>
+          10 1 9 4 2.</_>
+        <_>
+          1 5 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 4 -1.</_>
+        <_>
+          9 8 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 3 -1.</_>
+        <_>
+          8 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 8 -1.</_>
+        <_>
+          8 1 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 15 -1.</_>
+        <_>
+          9 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 9 6 -1.</_>
+        <_>
+          4 14 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 3 -1.</_>
+        <_>
+          0 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 10 3 -1.</_>
+        <_>
+          5 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 6 -1.</_>
+        <_>
+          9 5 5 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 14 -1.</_>
+        <_>
+          7 4 5 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 6 7 -1.</_>
+        <_>
+          3 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 12 5 -1.</_>
+        <_>
+          11 18 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 15 3 -1.</_>
+        <_>
+          1 19 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 12 4 -1.</_>
+        <_>
+          8 19 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 12 -1.</_>
+        <_>
+          5 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 16 3 -1.</_>
+        <_>
+          3 20 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 15 8 -1.</_>
+        <_>
+          0 17 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 4 7 -1.</_>
+        <_>
+          12 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 15 3 -1.</_>
+        <_>
+          6 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 4 -1.</_>
+        <_>
+          10 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 4 -1.</_>
+        <_>
+          6 0 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 16 -1.</_>
+        <_>
+          7 4 5 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 12 -1.</_>
+        <_>
+          4 6 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 14 2 -1.</_>
+        <_>
+          4 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 16 2 -1.</_>
+        <_>
+          8 21 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 14 -1.</_>
+        <_>
+          9 7 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 12 -1.</_>
+        <_>
+          5 0 8 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 16 5 -1.</_>
+        <_>
+          7 17 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 5 -1.</_>
+        <_>
+          3 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          13 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 6 -1.</_>
+        <_>
+          3 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 14 -1.</_>
+        <_>
+          9 7 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 20 -1.</_>
+        <_>
+          7 13 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 15 -1.</_>
+        <_>
+          9 6 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 15 -1.</_>
+        <_>
+          8 6 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 12 -1.</_>
+        <_>
+          16 11 3 6 2.</_>
+        <_>
+          13 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 12 -1.</_>
+        <_>
+          0 11 3 6 2.</_>
+        <_>
+          3 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 14 -1.</_>
+        <_>
+          11 2 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 14 -1.</_>
+        <_>
+          7 2 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 14 -1.</_>
+        <_>
+          12 5 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 10 -1.</_>
+        <_>
+          7 4 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 22 -1.</_>
+        <_>
+          4 11 11 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 4 -1.</_>
+        <_>
+          0 19 7 2 2.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 7 -1.</_>
+        <_>
+          8 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 15 -1.</_>
+        <_>
+          8 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 14 -1.</_>
+        <_>
+          12 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 14 -1.</_>
+        <_>
+          6 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 17 -1.</_>
+        <_>
+          6 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 12 3 -1.</_>
+        <_>
+          4 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 14 -1.</_>
+        <_>
+          6 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 15 18 -1.</_>
+        <_>
+          7 3 5 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 7 -1.</_>
+        <_>
+          9 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 7 -1.</_>
+        <_>
+          9 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 19 -1.</_>
+        <_>
+          8 3 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 19 -1.</_>
+        <_>
+          5 3 6 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 14 -1.</_>
+        <_>
+          13 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 12 6 -1.</_>
+        <_>
+          1 18 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 14 -1.</_>
+        <_>
+          13 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 14 -1.</_>
+        <_>
+          5 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 4 -1.</_>
+        <_>
+          9 0 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 22 -1.</_>
+        <_>
+          6 12 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 10 6 -1.</_>
+        <_>
+          12 17 5 3 2.</_>
+        <_>
+          7 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 5 -1.</_>
+        <_>
+          9 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 15 8 -1.</_>
+        <_>
+          1 4 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 6 -1.</_>
+        <_>
+          6 0 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 10 3 -1.</_>
+        <_>
+          7 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 10 3 -1.</_>
+        <_>
+          9 19 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 6 5 -1.</_>
+        <_>
+          6 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 9 -1.</_>
+        <_>
+          11 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 9 -1.</_>
+        <_>
+          6 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 14 -1.</_>
+        <_>
+          12 9 2 7 2.</_>
+        <_>
+          10 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 7 -1.</_>
+        <_>
+          4 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 9 -1.</_>
+        <_>
+          12 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 9 -1.</_>
+        <_>
+          5 13 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 10 6 -1.</_>
+        <_>
+          14 13 5 3 2.</_>
+        <_>
+          9 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 10 -1.</_>
+        <_>
+          7 10 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 14 -1.</_>
+        <_>
+          12 9 2 7 2.</_>
+        <_>
+          10 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 14 -1.</_>
+        <_>
+          5 9 2 7 2.</_>
+        <_>
+          7 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 4 7 -1.</_>
+        <_>
+          12 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 7 -1.</_>
+        <_>
+          5 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 7 6 -1.</_>
+        <_>
+          8 19 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 15 3 -1.</_>
+        <_>
+          5 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 6 8 -1.</_>
+        <_>
+          9 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 3 -1.</_>
+        <_>
+          9 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 3 -1.</_>
+        <_>
+          5 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 10 -1.</_>
+        <_>
+          10 4 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 10 4 -1.</_>
+        <_>
+          9 4 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          10 8 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 12 -1.</_>
+        <_>
+          5 8 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 9 8 -1.</_>
+        <_>
+          5 8 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 15 21 -1.</_>
+        <_>
+          7 8 5 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 9 7 -1.</_>
+        <_>
+          4 16 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 18 -1.</_>
+        <_>
+          10 5 6 9 2.</_>
+        <_>
+          4 14 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 15 3 -1.</_>
+        <_>
+          6 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 13 -1.</_>
+        <_>
+          7 4 8 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 10 8 -1.</_>
+        <_>
+          9 3 5 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 19 8 4 -1.</_>
+        <_>
+          11 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 8 4 -1.</_>
+        <_>
+          4 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 22 -1.</_>
+        <_>
+          6 0 3 11 2.</_>
+        <_>
+          9 11 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 14 -1.</_>
+        <_>
+          9 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 14 -1.</_>
+        <_>
+          6 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 10 -1.</_>
+        <_>
+          13 16 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 5 -1.</_>
+        <_>
+          5 0 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 7 -1.</_>
+        <_>
+          9 0 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 23 -1.</_>
+        <_>
+          9 0 9 23 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 15 -1.</_>
+        <_>
+          9 13 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 7 -1.</_>
+        <_>
+          5 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 15 -1.</_>
+        <_>
+          9 13 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 13 -1.</_>
+        <_>
+          7 2 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 2 -1.</_>
+        <_>
+          3 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 15 7 -1.</_>
+        <_>
+          7 12 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 15 -1.</_>
+        <_>
+          9 13 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 15 9 -1.</_>
+        <_>
+          5 14 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 12 8 -1.</_>
+        <_>
+          9 15 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 8 -1.</_>
+        <_>
+          4 15 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 14 -1.</_>
+        <_>
+          5 5 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 14 -1.</_>
+        <_>
+          12 5 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 9 -1.</_>
+        <_>
+          3 10 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 10 -1.</_>
+        <_>
+          6 8 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 6 6 -1.</_>
+        <_>
+          6 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 10 -1.</_>
+        <_>
+          10 10 9 5 2.</_>
+        <_>
+          1 15 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 4 -1.</_>
+        <_>
+          6 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 19 3 -1.</_>
+        <_>
+          0 7 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 6 -1.</_>
+        <_>
+          9 11 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 5 -1.</_>
+        <_>
+          10 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 9 4 -1.</_>
+        <_>
+          0 5 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 17 2 -1.</_>
+        <_>
+          1 19 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 8 -1.</_>
+        <_>
+          9 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 14 -1.</_>
+        <_>
+          9 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 14 -1.</_>
+        <_>
+          9 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 4 -1.</_>
+        <_>
+          10 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 10 3 -1.</_>
+        <_>
+          5 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 12 -1.</_>
+        <_>
+          8 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 7 -1.</_>
+        <_>
+          5 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 12 6 -1.</_>
+        <_>
+          12 17 6 3 2.</_>
+        <_>
+          6 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 6 -1.</_>
+        <_>
+          9 16 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 14 -1.</_>
+        <_>
+          14 0 2 7 2.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 14 2 -1.</_>
+        <_>
+          8 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 8 4 -1.</_>
+        <_>
+          9 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 4 -1.</_>
+        <_>
+          5 0 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 5 -1.</_>
+        <_>
+          10 1 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 10 -1.</_>
+        <_>
+          2 13 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 14 -1.</_>
+        <_>
+          9 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 2 -1.</_>
+        <_>
+          9 7 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 16 15 3 -1.</_>
+        <_>
+          7 16 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 17 -1.</_>
+        <_>
+          9 1 4 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 8 4 -1.</_>
+        <_>
+          9 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 19 8 4 -1.</_>
+        <_>
+          6 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 7 -1.</_>
+        <_>
+          10 0 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 7 -1.</_>
+        <_>
+          5 0 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 7 4 -1.</_>
+        <_>
+          12 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 14 -1.</_>
+        <_>
+          9 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 15 3 -1.</_>
+        <_>
+          2 19 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 7 -1.</_>
+        <_>
+          9 1 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 15 -1.</_>
+        <_>
+          12 5 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 10 -1.</_>
+        <_>
+          0 10 3 5 2.</_>
+        <_>
+          3 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 15 -1.</_>
+        <_>
+          12 5 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 15 -1.</_>
+        <_>
+          6 5 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 12 -1.</_>
+        <_>
+          6 5 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 12 16 -1.</_>
+        <_>
+          7 4 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 7 -1.</_>
+        <_>
+          13 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 16 -1.</_>
+        <_>
+          1 7 2 8 2.</_>
+        <_>
+          3 15 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 22 -1.</_>
+        <_>
+          11 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 14 3 -1.</_>
+        <_>
+          1 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 12 5 -1.</_>
+        <_>
+          11 18 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 19 -1.</_>
+        <_>
+          5 0 8 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 12 6 -1.</_>
+        <_>
+          9 17 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 4 -1.</_>
+        <_>
+          7 11 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 3 14 -1.</_>
+        <_>
+          11 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 15 8 -1.</_>
+        <_>
+          7 11 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 7 8 -1.</_>
+        <_>
+          11 6 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 7 -1.</_>
+        <_>
+          8 6 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 3 14 -1.</_>
+        <_>
+          11 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 14 -1.</_>
+        <_>
+          7 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 12 -1.</_>
+        <_>
+          7 0 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 16 -1.</_>
+        <_>
+          6 2 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 15 7 -1.</_>
+        <_>
+          6 4 5 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 8 -1.</_>
+        <_>
+          12 17 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 12 12 -1.</_>
+        <_>
+          6 15 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 5 6 -1.</_>
+        <_>
+          12 18 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 16 -1.</_>
+        <_>
+          0 8 19 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 15 3 -1.</_>
+        <_>
+          9 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 8 -1.</_>
+        <_>
+          9 0 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 6 -1.</_>
+        <_>
+          11 15 6 3 2.</_>
+        <_>
+          5 18 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 6 -1.</_>
+        <_>
+          2 15 6 3 2.</_>
+        <_>
+          8 18 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 5 -1.</_>
+        <_>
+          11 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 4 -1.</_>
+        <_>
+          0 19 7 2 2.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 7 -1.</_>
+        <_>
+          1 14 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 8 -1.</_>
+        <_>
+          5 1 4 4 2.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 12 -1.</_>
+        <_>
+          9 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 4 -1.</_>
+        <_>
+          9 0 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 15 3 -1.</_>
+        <_>
+          9 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 15 3 -1.</_>
+        <_>
+          5 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 9 -1.</_>
+        <_>
+          6 6 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 12 -1.</_>
+        <_>
+          7 6 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 9 -1.</_>
+        <_>
+          6 7 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 16 -1.</_>
+        <_>
+          13 6 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 9 -1.</_>
+        <_>
+          7 5 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 16 -1.</_>
+        <_>
+          13 6 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 16 -1.</_>
+        <_>
+          5 6 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 15 -1.</_>
+        <_>
+          13 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 15 -1.</_>
+        <_>
+          5 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 8 8 -1.</_>
+        <_>
+          8 2 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 5 -1.</_>
+        <_>
+          9 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 11 16 -1.</_>
+        <_>
+          4 11 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 5 8 -1.</_>
+        <_>
+          7 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 17 3 -1.</_>
+        <_>
+          1 19 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 14 2 -1.</_>
+        <_>
+          8 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 5 6 -1.</_>
+        <_>
+          2 19 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 5 12 -1.</_>
+        <_>
+          13 15 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 16 3 -1.</_>
+        <_>
+          1 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 9 -1.</_>
+        <_>
+          7 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 14 -1.</_>
+        <_>
+          6 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 6 7 -1.</_>
+        <_>
+          13 16 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 3 15 -1.</_>
+        <_>
+          2 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 8 -1.</_>
+        <_>
+          14 0 4 4 2.</_>
+        <_>
+          10 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 3 14 -1.</_>
+        <_>
+          2 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 5 9 -1.</_>
+        <_>
+          13 16 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 5 9 -1.</_>
+        <_>
+          1 16 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 9 6 -1.</_>
+        <_>
+          4 17 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 10 3 -1.</_>
+        <_>
+          7 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 5 -1.</_>
+        <_>
+          9 0 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 2 15 -1.</_>
+        <_>
+          2 8 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 18 -1.</_>
+        <_>
+          15 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 21 14 2 -1.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 8 4 -1.</_>
+        <_>
+          9 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 21 16 2 -1.</_>
+        <_>
+          9 21 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 4 -1.</_>
+        <_>
+          6 0 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 5 -1.</_>
+        <_>
+          6 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 10 -1.</_>
+        <_>
+          10 5 8 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 8 -1.</_>
+        <_>
+          0 5 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 10 -1.</_>
+        <_>
+          10 5 8 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 7 -1.</_>
+        <_>
+          4 16 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 12 -1.</_>
+        <_>
+          7 6 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 9 -1.</_>
+        <_>
+          7 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 8 7 -1.</_>
+        <_>
+          12 9 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 18 -1.</_>
+        <_>
+          0 1 9 9 2.</_>
+        <_>
+          9 10 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          9 9 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          9 9 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 4 -1.</_>
+        <_>
+          5 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          9 9 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 8 -1.</_>
+        <_>
+          10 9 2 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 19 -1.</_>
+        <_>
+          15 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 19 -1.</_>
+        <_>
+          2 0 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 14 -1.</_>
+        <_>
+          13 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 3 -1.</_>
+        <_>
+          0 5 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 10 -1.</_>
+        <_>
+          8 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 10 6 -1.</_>
+        <_>
+          3 17 5 3 2.</_>
+        <_>
+          8 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 14 -1.</_>
+        <_>
+          13 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 5 -1.</_>
+        <_>
+          5 7 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 9 -1.</_>
+        <_>
+          15 5 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 14 -1.</_>
+        <_>
+          7 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 12 -1.</_>
+        <_>
+          10 8 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 9 -1.</_>
+        <_>
+          9 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 7 8 -1.</_>
+        <_>
+          10 6 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 7 8 -1.</_>
+        <_>
+          2 6 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 14 -1.</_>
+        <_>
+          5 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 7 8 -1.</_>
+        <_>
+          12 17 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 20 -1.</_>
+        <_>
+          6 5 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 16 4 -1.</_>
+        <_>
+          10 1 8 2 2.</_>
+        <_>
+          2 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 10 -1.</_>
+        <_>
+          4 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 8 8 -1.</_>
+        <_>
+          12 8 4 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 12 8 -1.</_>
+        <_>
+          3 10 6 4 2.</_>
+        <_>
+          9 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 10 -1.</_>
+        <_>
+          8 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 5 9 -1.</_>
+        <_>
+          7 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 17 3 -1.</_>
+        <_>
+          1 5 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 14 3 -1.</_>
+        <_>
+          2 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 14 2 -1.</_>
+        <_>
+          2 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 19 8 4 -1.</_>
+        <_>
+          10 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 5 22 -1.</_>
+        <_>
+          5 11 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 8 4 -1.</_>
+        <_>
+          10 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 8 4 -1.</_>
+        <_>
+          5 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 9 -1.</_>
+        <_>
+          8 12 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 9 5 -1.</_>
+        <_>
+          4 16 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 10 14 -1.</_>
+        <_>
+          8 8 5 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 7 6 -1.</_>
+        <_>
+          10 5 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          9 5 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 9 10 -1.</_>
+        <_>
+          10 4 9 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 10 9 -1.</_>
+        <_>
+          9 4 5 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 7 8 -1.</_>
+        <_>
+          12 17 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 7 8 -1.</_>
+        <_>
+          0 17 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 19 4 -1.</_>
+        <_>
+          0 17 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 15 -1.</_>
+        <_>
+          10 8 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 4 14 -1.</_>
+        <_>
+          4 7 2 7 2.</_>
+        <_>
+          6 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 15 -1.</_>
+        <_>
+          12 8 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 15 -1.</_>
+        <_>
+          6 8 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 4 11 -1.</_>
+        <_>
+          8 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 11 -1.</_>
+        <_>
+          9 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 10 -1.</_>
+        <_>
+          10 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 7 -1.</_>
+        <_>
+          5 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 16 3 -1.</_>
+        <_>
+          3 18 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 10 -1.</_>
+        <_>
+          2 12 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 12 6 -1.</_>
+        <_>
+          10 14 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 6 -1.</_>
+        <_>
+          3 14 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 4 -1.</_>
+        <_>
+          11 0 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 10 -1.</_>
+        <_>
+          9 0 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 3 -1.</_>
+        <_>
+          9 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 3 -1.</_>
+        <_>
+          5 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 8 -1.</_>
+        <_>
+          10 5 4 4 2.</_>
+        <_>
+          6 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 14 -1.</_>
+        <_>
+          5 6 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 10 -1.</_>
+        <_>
+          12 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 10 -1.</_>
+        <_>
+          5 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 6 -1.</_>
+        <_>
+          9 15 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 6 -1.</_>
+        <_>
+          6 15 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 8 -1.</_>
+        <_>
+          8 9 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 4 -1.</_>
+        <_>
+          7 2 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 7 -1.</_>
+        <_>
+          9 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 17 -1.</_>
+        <_>
+          7 2 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 15 -1.</_>
+        <_>
+          11 6 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 4 -1.</_>
+        <_>
+          4 0 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 8 -1.</_>
+        <_>
+          11 5 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 8 -1.</_>
+        <_>
+          0 5 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 14 -1.</_>
+        <_>
+          11 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 10 3 -1.</_>
+        <_>
+          9 4 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 11 -1.</_>
+        <_>
+          11 8 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 8 -1.</_>
+        <_>
+          3 17 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 8 12 -1.</_>
+        <_>
+          10 17 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 14 -1.</_>
+        <_>
+          7 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 10 -1.</_>
+        <_>
+          10 9 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 6 -1.</_>
+        <_>
+          8 11 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 16 4 -1.</_>
+        <_>
+          5 6 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 2 14 -1.</_>
+        <_>
+          12 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 11 -1.</_>
+        <_>
+          11 7 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 11 2 -1.</_>
+        <_>
+          8 7 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 5 -1.</_>
+        <_>
+          7 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 5 -1.</_>
+        <_>
+          8 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 10 6 -1.</_>
+        <_>
+          12 17 5 3 2.</_>
+        <_>
+          7 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 15 -1.</_>
+        <_>
+          8 6 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 3 -1.</_>
+        <_>
+          5 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 14 -1.</_>
+        <_>
+          9 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 10 -1.</_>
+        <_>
+          10 8 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 9 18 -1.</_>
+        <_>
+          6 9 3 6 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 12 -1.</_>
+        <_>
+          13 0 5 6 2.</_>
+        <_>
+          8 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 12 11 -1.</_>
+        <_>
+          4 12 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 15 9 -1.</_>
+        <_>
+          7 7 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 10 10 -1.</_>
+        <_>
+          8 7 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 10 -1.</_>
+        <_>
+          10 8 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 18 6 5 -1.</_>
+        <_>
+          5 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 14 -1.</_>
+        <_>
+          5 0 2 7 2.</_>
+        <_>
+          7 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 12 -1.</_>
+        <_>
+          13 0 5 6 2.</_>
+        <_>
+          8 6 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 18 -1.</_>
+        <_>
+          2 0 4 9 2.</_>
+        <_>
+          6 9 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 4 -1.</_>
+        <_>
+          10 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 2 -1.</_>
+        <_>
+          9 9 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 10 -1.</_>
+        <_>
+          15 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 3 10 -1.</_>
+        <_>
+          1 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 7 -1.</_>
+        <_>
+          15 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 7 -1.</_>
+        <_>
+          6 15 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 20 -1.</_>
+        <_>
+          10 2 8 10 2.</_>
+        <_>
+          2 12 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 7 6 -1.</_>
+        <_>
+          4 19 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 15 6 -1.</_>
+        <_>
+          3 18 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 3 -1.</_>
+        <_>
+          0 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 18 -1.</_>
+        <_>
+          2 0 2 9 2.</_>
+        <_>
+          4 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 8 -1.</_>
+        <_>
+          10 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 8 -1.</_>
+        <_>
+          5 2 4 4 2.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 3 -1.</_>
+        <_>
+          6 0 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 4 -1.</_>
+        <_>
+          10 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 4 -1.</_>
+        <_>
+          5 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 8 2 -1.</_>
+        <_>
+          9 9 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 15 9 -1.</_>
+        <_>
+          9 7 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 14 -1.</_>
+        <_>
+          9 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 16 -1.</_>
+        <_>
+          9 6 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 16 -1.</_>
+        <_>
+          4 6 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 5 6 -1.</_>
+        <_>
+          2 18 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 19 12 4 -1.</_>
+        <_>
+          11 19 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 12 4 -1.</_>
+        <_>
+          4 19 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 7 -1.</_>
+        <_>
+          10 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 9 -1.</_>
+        <_>
+          7 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 17 -1.</_>
+        <_>
+          7 3 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 21 14 2 -1.</_>
+        <_>
+          3 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 12 3 -1.</_>
+        <_>
+          6 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 22 -1.</_>
+        <_>
+          9 11 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 14 -1.</_>
+        <_>
+          6 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 16 -1.</_>
+        <_>
+          7 11 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 8 -1.</_>
+        <_>
+          1 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 15 3 -1.</_>
+        <_>
+          7 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 12 6 -1.</_>
+        <_>
+          1 17 6 3 2.</_>
+        <_>
+          7 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 9 -1.</_>
+        <_>
+          8 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 9 -1.</_>
+        <_>
+          9 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 5 20 -1.</_>
+        <_>
+          7 6 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 16 -1.</_>
+        <_>
+          3 7 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 10 -1.</_>
+        <_>
+          8 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 12 -1.</_>
+        <_>
+          5 7 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 10 -1.</_>
+        <_>
+          2 6 3 5 2.</_>
+        <_>
+          5 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          9 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 12 -1.</_>
+        <_>
+          0 10 9 6 2.</_>
+        <_>
+          9 16 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 14 -1.</_>
+        <_>
+          9 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 14 -1.</_>
+        <_>
+          8 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 6 -1.</_>
+        <_>
+          1 15 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 5 -1.</_>
+        <_>
+          4 17 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 12 6 -1.</_>
+        <_>
+          9 17 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 8 -1.</_>
+        <_>
+          4 15 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 19 3 -1.</_>
+        <_>
+          0 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 16 3 -1.</_>
+        <_>
+          1 9 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 6 -1.</_>
+        <_>
+          6 8 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 10 14 -1.</_>
+        <_>
+          4 7 5 7 2.</_>
+        <_>
+          9 14 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 10 -1.</_>
+        <_>
+          5 0 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 13 -1.</_>
+        <_>
+          7 0 5 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 6 -1.</_>
+        <_>
+          8 6 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 7 -1.</_>
+        <_>
+          4 16 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 8 -1.</_>
+        <_>
+          12 6 4 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 6 -1.</_>
+        <_>
+          7 7 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 3 -1.</_>
+        <_>
+          1 8 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 11 -1.</_>
+        <_>
+          8 4 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 7 -1.</_>
+        <_>
+          15 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 12 6 -1.</_>
+        <_>
+          3 11 6 3 2.</_>
+        <_>
+          9 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 3 16 -1.</_>
+        <_>
+          14 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 16 -1.</_>
+        <_>
+          4 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 16 8 -1.</_>
+        <_>
+          10 9 8 4 2.</_>
+        <_>
+          2 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 19 -1.</_>
+        <_>
+          4 0 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 8 10 -1.</_>
+        <_>
+          8 1 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 18 6 -1.</_>
+        <_>
+          6 14 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 9 -1.</_>
+        <_>
+          9 9 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 15 8 -1.</_>
+        <_>
+          5 14 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 20 15 3 -1.</_>
+        <_>
+          8 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 18 2 -1.</_>
+        <_>
+          0 16 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 17 3 -1.</_>
+        <_>
+          2 16 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 19 4 -1.</_>
+        <_>
+          0 2 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 4 -1.</_>
+        <_>
+          4 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 21 -1.</_>
+        <_>
+          4 0 1 21 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 8 4 -1.</_>
+        <_>
+          6 20 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 14 3 -1.</_>
+        <_>
+          1 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 9 5 -1.</_>
+        <_>
+          12 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 19 3 -1.</_>
+        <_>
+          0 19 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 14 -1.</_>
+        <_>
+          14 8 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 12 7 -1.</_>
+        <_>
+          5 6 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 16 -1.</_>
+        <_>
+          6 6 8 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 20 -1.</_>
+        <_>
+          4 1 8 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 14 -1.</_>
+        <_>
+          14 9 2 7 2.</_>
+        <_>
+          12 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 14 -1.</_>
+        <_>
+          3 9 2 7 2.</_>
+        <_>
+          5 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 10 -1.</_>
+        <_>
+          14 11 3 5 2.</_>
+        <_>
+          11 16 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 10 -1.</_>
+        <_>
+          2 11 3 5 2.</_>
+        <_>
+          5 16 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 16 9 -1.</_>
+        <_>
+          6 8 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 17 10 6 -1.</_>
+        <_>
+          2 17 5 3 2.</_>
+        <_>
+          7 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 7 -1.</_>
+        <_>
+          13 9 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 7 8 -1.</_>
+        <_>
+          6 9 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 16 -1.</_>
+        <_>
+          7 11 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 10 -1.</_>
+        <_>
+          7 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 5 -1.</_>
+        <_>
+          8 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 18 -1.</_>
+        <_>
+          5 1 8 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 18 3 -1.</_>
+        <_>
+          6 20 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 14 -1.</_>
+        <_>
+          9 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 2 -1.</_>
+        <_>
+          2 4 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 16 -1.</_>
+        <_>
+          11 0 5 8 2.</_>
+        <_>
+          6 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 5 6 -1.</_>
+        <_>
+          2 17 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 4 8 -1.</_>
+        <_>
+          12 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 4 8 -1.</_>
+        <_>
+          3 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 10 -1.</_>
+        <_>
+          14 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 10 -1.</_>
+        <_>
+          2 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 12 16 -1.</_>
+        <_>
+          7 9 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 4 9 -1.</_>
+        <_>
+          8 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 10 5 -1.</_>
+        <_>
+          7 18 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 14 -1.</_>
+        <_>
+          4 7 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 9 15 -1.</_>
+        <_>
+          11 6 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 8 -1.</_>
+        <_>
+          0 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 13 -1.</_>
+        <_>
+          15 0 2 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 4 -1.</_>
+        <_>
+          4 0 13 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 5 -1.</_>
+        <_>
+          9 3 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 9 5 -1.</_>
+        <_>
+          7 3 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 4 -1.</_>
+        <_>
+          7 1 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 12 -1.</_>
+        <_>
+          0 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 5 -1.</_>
+        <_>
+          5 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 5 -1.</_>
+        <_>
+          9 0 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 14 -1.</_>
+        <_>
+          10 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 9 8 -1.</_>
+        <_>
+          3 7 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 16 9 -1.</_>
+        <_>
+          6 7 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 2 -1.</_>
+        <_>
+          7 19 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 20 10 3 -1.</_>
+        <_>
+          8 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 20 10 3 -1.</_>
+        <_>
+          6 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 10 -1.</_>
+        <_>
+          16 9 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 21 16 2 -1.</_>
+        <_>
+          8 21 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 15 3 -1.</_>
+        <_>
+          4 7 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 14 -1.</_>
+        <_>
+          7 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 10 5 -1.</_>
+        <_>
+          7 18 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 10 5 -1.</_>
+        <_>
+          7 18 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 16 -1.</_>
+        <_>
+          11 0 5 8 2.</_>
+        <_>
+          6 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 10 16 -1.</_>
+        <_>
+          3 0 5 8 2.</_>
+        <_>
+          8 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 4 -1.</_>
+        <_>
+          6 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 19 3 -1.</_>
+        <_>
+          0 3 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 4 -1.</_>
+        <_>
+          7 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 3 -1.</_>
+        <_>
+          0 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 3 -1.</_>
+        <_>
+          1 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 6 -1.</_>
+        <_>
+          3 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 10 -1.</_>
+        <_>
+          5 5 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 9 4 -1.</_>
+        <_>
+          5 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 6 -1.</_>
+        <_>
+          5 4 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 9 6 -1.</_>
+        <_>
+          1 17 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 14 9 -1.</_>
+        <_>
+          5 16 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 3 -1.</_>
+        <_>
+          7 13 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 15 -1.</_>
+        <_>
+          12 8 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 15 -1.</_>
+        <_>
+          6 8 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 14 -1.</_>
+        <_>
+          12 5 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 14 -1.</_>
+        <_>
+          6 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 14 -1.</_>
+        <_>
+          12 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 22 -1.</_>
+        <_>
+          0 0 4 11 2.</_>
+        <_>
+          4 11 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 8 -1.</_>
+        <_>
+          13 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 16 7 -1.</_>
+        <_>
+          5 13 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 8 -1.</_>
+        <_>
+          13 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 8 -1.</_>
+        <_>
+          4 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 6 -1.</_>
+        <_>
+          10 7 5 3 2.</_>
+        <_>
+          5 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 8 4 -1.</_>
+        <_>
+          4 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 15 3 -1.</_>
+        <_>
+          3 16 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 4 16 -1.</_>
+        <_>
+          7 2 2 8 2.</_>
+        <_>
+          9 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 12 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 12 -1.</_>
+        <_>
+          7 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 2 -1.</_>
+        <_>
+          3 16 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 17 8 -1.</_>
+        <_>
+          0 17 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 9 10 -1.</_>
+        <_>
+          10 3 9 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 10 -1.</_>
+        <_>
+          7 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 7 15 -1.</_>
+        <_>
+          7 13 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 20 -1.</_>
+        <_>
+          5 0 8 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 9 5 -1.</_>
+        <_>
+          12 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 9 5 -1.</_>
+        <_>
+          4 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 12 -1.</_>
+        <_>
+          12 7 4 6 2.</_>
+        <_>
+          8 13 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 13 -1.</_>
+        <_>
+          4 9 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 4 -1.</_>
+        <_>
+          12 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 3 -1.</_>
+        <_>
+          0 7 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 18 7 -1.</_>
+        <_>
+          1 16 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 15 5 -1.</_>
+        <_>
+          5 18 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 8 -1.</_>
+        <_>
+          10 5 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 8 -1.</_>
+        <_>
+          7 5 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 5 -1.</_>
+        <_>
+          7 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 15 -1.</_>
+        <_>
+          7 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 4 -1.</_>
+        <_>
+          4 0 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 14 -1.</_>
+        <_>
+          5 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 14 4 -1.</_>
+        <_>
+          5 17 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 2 14 -1.</_>
+        <_>
+          3 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 7 -1.</_>
+        <_>
+          12 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 7 -1.</_>
+        <_>
+          5 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 9 15 -1.</_>
+        <_>
+          11 5 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 15 -1.</_>
+        <_>
+          5 5 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 16 -1.</_>
+        <_>
+          16 5 1 16 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 16 2 -1.</_>
+        <_>
+          3 5 16 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 9 -1.</_>
+        <_>
+          11 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          7 6 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 8 -1.</_>
+        <_>
+          14 0 4 4 2.</_>
+        <_>
+          10 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 4 -1.</_>
+        <_>
+          7 0 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 9 -1.</_>
+        <_>
+          11 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 10 -1.</_>
+        <_>
+          5 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 5 -1.</_>
+        <_>
+          11 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 9 -1.</_>
+        <_>
+          6 11 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 7 4 -1.</_>
+        <_>
+          12 12 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 8 -1.</_>
+        <_>
+          1 0 4 4 2.</_>
+        <_>
+          5 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 9 10 -1.</_>
+        <_>
+          10 4 9 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 8 -1.</_>
+        <_>
+          1 1 6 4 2.</_>
+        <_>
+          7 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 16 2 -1.</_>
+        <_>
+          2 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 14 -1.</_>
+        <_>
+          8 3 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 7 -1.</_>
+        <_>
+          9 1 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 12 -1.</_>
+        <_>
+          3 14 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 7 -1.</_>
+        <_>
+          10 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 6 7 -1.</_>
+        <_>
+          7 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 14 8 -1.</_>
+        <_>
+          5 7 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 5 -1.</_>
+        <_>
+          5 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 7 -1.</_>
+        <_>
+          12 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 7 -1.</_>
+        <_>
+          5 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 12 -1.</_>
+        <_>
+          13 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 12 -1.</_>
+        <_>
+          2 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 16 8 -1.</_>
+        <_>
+          10 2 8 4 2.</_>
+        <_>
+          2 6 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 9 -1.</_>
+        <_>
+          7 5 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 12 -1.</_>
+        <_>
+          8 13 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 3 15 -1.</_>
+        <_>
+          3 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 16 4 -1.</_>
+        <_>
+          5 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_>
+        <_>
+          6 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 2 14 -1.</_>
+        <_>
+          9 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 10 -1.</_>
+        <_>
+          8 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 14 -1.</_>
+        <_>
+          9 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 16 -1.</_>
+        <_>
+          6 11 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 16 -1.</_>
+        <_>
+          5 0 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 11 -1.</_>
+        <_>
+          13 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 3 -1.</_>
+        <_>
+          7 18 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 12 11 -1.</_>
+        <_>
+          9 9 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 16 9 -1.</_>
+        <_>
+          5 7 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 7 -1.</_>
+        <_>
+          11 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 12 12 -1.</_>
+        <_>
+          7 15 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 7 -1.</_>
+        <_>
+          11 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 10 -1.</_>
+        <_>
+          6 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 14 -1.</_>
+        <_>
+          13 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 14 -1.</_>
+        <_>
+          5 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 16 -1.</_>
+        <_>
+          7 11 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 4 7 -1.</_>
+        <_>
+          4 16 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 7 -1.</_>
+        <_>
+          4 16 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 5 6 -1.</_>
+        <_>
+          14 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 6 -1.</_>
+        <_>
+          6 0 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 7 -1.</_>
+        <_>
+          4 0 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 22 -1.</_>
+        <_>
+          5 11 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 8 4 -1.</_>
+        <_>
+          11 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 8 -1.</_>
+        <_>
+          9 0 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 17 14 2 -1.</_>
+        <_>
+          5 18 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 14 3 -1.</_>
+        <_>
+          1 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 12 -1.</_>
+        <_>
+          10 5 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 12 -1.</_>
+        <_>
+          5 5 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 18 -1.</_>
+        <_>
+          6 9 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 9 -1.</_>
+        <_>
+          3 0 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 14 -1.</_>
+        <_>
+          10 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 5 9 -1.</_>
+        <_>
+          7 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 14 -1.</_>
+        <_>
+          10 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 8 -1.</_>
+        <_>
+          12 10 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 7 -1.</_>
+        <_>
+          8 6 5 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 15 7 4 -1.</_>
+        <_>
+          12 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 7 4 -1.</_>
+        <_>
+          0 17 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 16 -1.</_>
+        <_>
+          15 6 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 4 8 -1.</_>
+        <_>
+          3 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 19 3 -1.</_>
+        <_>
+          0 15 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 7 -1.</_>
+        <_>
+          3 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 11 -1.</_>
+        <_>
+          14 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 6 -1.</_>
+        <_>
+          0 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 3 -1.</_>
+        <_>
+          4 0 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 3 -1.</_>
+        <_>
+          8 0 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 7 4 -1.</_>
+        <_>
+          12 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 4 -1.</_>
+        <_>
+          0 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 7 -1.</_>
+        <_>
+          10 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 4 11 -1.</_>
+        <_>
+          3 12 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 4 -1.</_>
+        <_>
+          2 11 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 9 3 -1.</_>
+        <_>
+          6 12 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 16 -1.</_>
+        <_>
+          8 6 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 14 4 -1.</_>
+        <_>
+          2 6 7 2 2.</_>
+        <_>
+          9 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 10 6 -1.</_>
+        <_>
+          10 6 5 3 2.</_>
+        <_>
+          5 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 14 -1.</_>
+        <_>
+          1 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 9 5 -1.</_>
+        <_>
+          13 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 3 -1.</_>
+        <_>
+          3 10 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 18 9 5 -1.</_>
+        <_>
+          13 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 9 5 -1.</_>
+        <_>
+          3 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 9 -1.</_>
+        <_>
+          9 8 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 9 -1.</_>
+        <_>
+          6 8 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 14 -1.</_>
+        <_>
+          10 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 20 15 3 -1.</_>
+        <_>
+          7 20 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 5 -1.</_>
+        <_>
+          8 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 14 -1.</_>
+        <_>
+          7 6 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 14 -1.</_>
+        <_>
+          10 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 14 -1.</_>
+        <_>
+          8 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 8 -1.</_>
+        <_>
+          12 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 3 -1.</_>
+        <_>
+          0 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 20 10 3 -1.</_>
+        <_>
+          5 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 7 4 -1.</_>
+        <_>
+          6 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 9 -1.</_>
+        <_>
+          5 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 7 -1.</_>
+        <_>
+          15 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 10 -1.</_>
+        <_>
+          5 13 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 4 10 -1.</_>
+        <_>
+          12 12 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 7 -1.</_>
+        <_>
+          5 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 14 -1.</_>
+        <_>
+          15 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 12 -1.</_>
+        <_>
+          2 0 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 14 4 -1.</_>
+        <_>
+          12 19 7 2 2.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 9 10 -1.</_>
+        <_>
+          0 17 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 5 6 -1.</_>
+        <_>
+          14 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 8 4 -1.</_>
+        <_>
+          0 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 16 3 -1.</_>
+        <_>
+          3 17 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 16 5 -1.</_>
+        <_>
+          6 0 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 10 -1.</_>
+        <_>
+          0 5 17 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 15 -1.</_>
+        <_>
+          9 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 20 -1.</_>
+        <_>
+          0 7 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 10 -1.</_>
+        <_>
+          8 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 10 -1.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 17 -1.</_>
+        <_>
+          12 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 17 -1.</_>
+        <_>
+          6 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 14 -1.</_>
+        <_>
+          13 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 10 -1.</_>
+        <_>
+          9 2 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 21 14 2 -1.</_>
+        <_>
+          4 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 4 -1.</_>
+        <_>
+          9 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 6 -1.</_>
+        <_>
+          3 0 6 3 2.</_>
+        <_>
+          9 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 8 -1.</_>
+        <_>
+          10 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 12 8 -1.</_>
+        <_>
+          4 13 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 8 -1.</_>
+        <_>
+          10 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 8 -1.</_>
+        <_>
+          7 8 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 8 10 -1.</_>
+        <_>
+          9 13 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 8 9 -1.</_>
+        <_>
+          6 14 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 9 5 -1.</_>
+        <_>
+          12 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 4 7 -1.</_>
+        <_>
+          9 15 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 12 4 -1.</_>
+        <_>
+          4 19 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 8 -1.</_>
+        <_>
+          8 15 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 8 -1.</_>
+        <_>
+          12 5 4 4 2.</_>
+        <_>
+          8 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 7 4 -1.</_>
+        <_>
+          0 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 8 -1.</_>
+        <_>
+          11 3 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 12 17 3 -1.</_>
+        <_>
+          1 13 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 15 -1.</_>
+        <_>
+          14 8 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 14 3 -1.</_>
+        <_>
+          2 13 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 7 6 -1.</_>
+        <_>
+          6 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 6 -1.</_>
+        <_>
+          2 2 6 3 2.</_>
+        <_>
+          8 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 5 -1.</_>
+        <_>
+          11 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 5 -1.</_>
+        <_>
+          4 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 20 -1.</_>
+        <_>
+          1 2 9 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 8 -1.</_>
+        <_>
+          9 5 5 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 7 10 -1.</_>
+        <_>
+          7 13 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 14 -1.</_>
+        <_>
+          8 7 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 16 -1.</_>
+        <_>
+          15 7 2 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 7 -1.</_>
+        <_>
+          4 0 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 4 7 -1.</_>
+        <_>
+          11 7 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 6 15 -1.</_>
+        <_>
+          7 4 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 13 -1.</_>
+        <_>
+          9 10 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 4 7 -1.</_>
+        <_>
+          3 14 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 14 -1.</_>
+        <_>
+          12 1 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 8 -1.</_>
+        <_>
+          7 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 7 -1.</_>
+        <_>
+          11 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 7 -1.</_>
+        <_>
+          6 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 9 9 -1.</_>
+        <_>
+          10 5 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 12 12 -1.</_>
+        <_>
+          6 5 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 14 4 -1.</_>
+        <_>
+          11 19 7 2 2.</_>
+        <_>
+          4 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 14 4 -1.</_>
+        <_>
+          1 19 7 2 2.</_>
+        <_>
+          8 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 9 5 -1.</_>
+        <_>
+          12 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 9 5 -1.</_>
+        <_>
+          4 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 6 -1.</_>
+        <_>
+          11 4 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 8 7 6 -1.</_>
+        <_>
+          6 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 14 2 -1.</_>
+        <_>
+          5 18 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 3 -1.</_>
+        <_>
+          5 7 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 11 -1.</_>
+        <_>
+          13 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 4 11 -1.</_>
+        <_>
+          4 9 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 14 -1.</_>
+        <_>
+          13 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 14 -1.</_>
+        <_>
+          5 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 5 6 -1.</_>
+        <_>
+          7 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 17 4 -1.</_>
+        <_>
+          0 14 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 10 -1.</_>
+        <_>
+          12 7 2 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 12 12 -1.</_>
+        <_>
+          6 13 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 12 8 -1.</_>
+        <_>
+          7 15 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_>
+        <_>
+          6 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 7 8 -1.</_>
+        <_>
+          0 17 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 8 -1.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 14 -1.</_>
+        <_>
+          6 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 7 4 -1.</_>
+        <_>
+          12 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_>
+        <_>
+          7 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 7 8 -1.</_>
+        <_>
+          6 15 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 15 -1.</_>
+        <_>
+          8 7 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 5 6 -1.</_>
+        <_>
+          11 19 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 10 -1.</_>
+        <_>
+          4 0 3 5 2.</_>
+        <_>
+          7 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 7 6 -1.</_>
+        <_>
+          9 12 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 2 -1.</_>
+        <_>
+          9 0 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 18 8 -1.</_>
+        <_>
+          10 10 9 4 2.</_>
+        <_>
+          1 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 15 3 -1.</_>
+        <_>
+          1 19 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 14 3 -1.</_>
+        <_>
+          4 19 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 19 18 -1.</_>
+        <_>
+          0 9 19 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 20 -1.</_>
+        <_>
+          4 10 11 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 18 -1.</_>
+        <_>
+          5 9 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 20 -1.</_>
+        <_>
+          9 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 6 -1.</_>
+        <_>
+          1 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 6 6 -1.</_>
+        <_>
+          12 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 2 14 -1.</_>
+        <_>
+          4 8 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 5 12 -1.</_>
+        <_>
+          7 15 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 5 12 -1.</_>
+        <_>
+          5 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 16 -1.</_>
+        <_>
+          15 0 2 8 2.</_>
+        <_>
+          13 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 8 -1.</_>
+        <_>
+          7 0 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 7 -1.</_>
+        <_>
+          15 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 7 8 -1.</_>
+        <_>
+          0 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 6 -1.</_>
+        <_>
+          6 8 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 14 -1.</_>
+        <_>
+          7 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 6 6 -1.</_>
+        <_>
+          13 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 12 -1.</_>
+        <_>
+          5 17 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 17 6 6 -1.</_>
+        <_>
+          13 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 14 -1.</_>
+        <_>
+          0 15 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 6 5 -1.</_>
+        <_>
+          13 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 14 -1.</_>
+        <_>
+          5 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 8 -1.</_>
+        <_>
+          15 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 3 12 -1.</_>
+        <_>
+          1 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 6 5 -1.</_>
+        <_>
+          12 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 4 8 -1.</_>
+        <_>
+          0 19 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 6 8 -1.</_>
+        <_>
+          15 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          2 11 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 14 3 -1.</_>
+        <_>
+          5 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 7 6 -1.</_>
+        <_>
+          0 17 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 10 -1.</_>
+        <_>
+          10 8 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 7 -1.</_>
+        <_>
+          5 11 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 16 -1.</_>
+        <_>
+          8 0 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 14 -1.</_>
+        <_>
+          7 6 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 15 -1.</_>
+        <_>
+          12 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 10 4 -1.</_>
+        <_>
+          9 8 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 14 -1.</_>
+        <_>
+          8 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 14 -1.</_>
+        <_>
+          9 1 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 18 9 -1.</_>
+        <_>
+          7 17 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 7 9 -1.</_>
+        <_>
+          6 12 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 2 -1.</_>
+        <_>
+          1 12 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 16 -1.</_>
+        <_>
+          7 11 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 3 -1.</_>
+        <_>
+          2 11 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 7 9 -1.</_>
+        <_>
+          6 15 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 15 3 -1.</_>
+        <_>
+          4 11 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 4 -1.</_>
+        <_>
+          0 19 7 2 2.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 14 3 -1.</_>
+        <_>
+          5 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 3 14 -1.</_>
+        <_>
+          2 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 7 -1.</_>
+        <_>
+          11 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 6 7 -1.</_>
+        <_>
+          6 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 6 -1.</_>
+        <_>
+          6 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 16 -1.</_>
+        <_>
+          6 2 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 15 -1.</_>
+        <_>
+          16 4 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 5 -1.</_>
+        <_>
+          6 12 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 14 -1.</_>
+        <_>
+          9 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 7 4 -1.</_>
+        <_>
+          0 18 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 14 3 -1.</_>
+        <_>
+          5 17 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 15 -1.</_>
+        <_>
+          1 4 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 6 -1.</_>
+        <_>
+          10 4 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 6 -1.</_>
+        <_>
+          1 4 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 16 -1.</_>
+        <_>
+          12 6 2 8 2.</_>
+        <_>
+          10 14 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 18 -1.</_>
+        <_>
+          7 1 2 9 2.</_>
+        <_>
+          9 10 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 7 -1.</_>
+        <_>
+          8 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 7 -1.</_>
+        <_>
+          9 4 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 14 -1.</_>
+        <_>
+          7 0 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 2 14 -1.</_>
+        <_>
+          3 1 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 4 -1.</_>
+        <_>
+          0 18 7 2 2.</_>
+        <_>
+          7 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_>
+        <_>
+          6 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 10 -1.</_>
+        <_>
+          4 9 3 5 2.</_>
+        <_>
+          7 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 6 -1.</_>
+        <_>
+          10 17 9 3 2.</_>
+        <_>
+          1 20 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 21 -1.</_>
+        <_>
+          7 7 2 7 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 7 -1.</_>
+        <_>
+          6 7 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 3 -1.</_>
+        <_>
+          7 0 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 5 -1.</_>
+        <_>
+          8 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 3 14 -1.</_>
+        <_>
+          8 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 9 -1.</_>
+        <_>
+          3 17 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 6 6 -1.</_>
+        <_>
+          4 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 20 -1.</_>
+        <_>
+          5 6 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 12 7 -1.</_>
+        <_>
+          4 16 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 9 4 -1.</_>
+        <_>
+          5 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 6 -1.</_>
+        <_>
+          3 2 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 7 8 -1.</_>
+        <_>
+          11 15 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 8 -1.</_>
+        <_>
+          3 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 6 -1.</_>
+        <_>
+          6 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 7 6 -1.</_>
+        <_>
+          8 19 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 5 8 -1.</_>
+        <_>
+          5 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 19 2 -1.</_>
+        <_>
+          0 16 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 7 4 -1.</_>
+        <_>
+          6 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 21 -1.</_>
+        <_>
+          9 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 15 4 -1.</_>
+        <_>
+          5 19 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 20 10 3 -1.</_>
+        <_>
+          9 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 15 3 -1.</_>
+        <_>
+          0 18 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 5 -1.</_>
+        <_>
+          12 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 7 6 -1.</_>
+        <_>
+          6 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 3 -1.</_>
+        <_>
+          3 16 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 20 10 3 -1.</_>
+        <_>
+          5 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 8 4 -1.</_>
+        <_>
+          6 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 7 6 -1.</_>
+        <_>
+          1 19 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 12 4 -1.</_>
+        <_>
+          11 17 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 6 7 -1.</_>
+        <_>
+          5 15 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 12 7 -1.</_>
+        <_>
+          6 7 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 12 12 -1.</_>
+        <_>
+          1 13 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 5 9 -1.</_>
+        <_>
+          12 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 5 9 -1.</_>
+        <_>
+          2 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 7 -1.</_>
+        <_>
+          14 8 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 10 -1.</_>
+        <_>
+          5 9 4 5 2.</_>
+        <_>
+          9 14 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 6 -1.</_>
+        <_>
+          10 11 8 3 2.</_>
+        <_>
+          2 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 16 -1.</_>
+        <_>
+          9 4 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 14 -1.</_>
+        <_>
+          9 9 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 4 14 -1.</_>
+        <_>
+          8 9 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 12 4 -1.</_>
+        <_>
+          11 17 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 12 4 -1.</_>
+        <_>
+          4 17 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 10 -1.</_>
+        <_>
+          16 12 3 5 2.</_>
+        <_>
+          13 17 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 6 -1.</_>
+        <_>
+          3 17 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 8 -1.</_>
+        <_>
+          12 4 3 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 15 -1.</_>
+        <_>
+          8 6 5 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 4 -1.</_>
+        <_>
+          10 10 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 9 7 -1.</_>
+        <_>
+          4 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 18 6 -1.</_>
+        <_>
+          10 17 9 3 2.</_>
+        <_>
+          1 20 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 3 -1.</_>
+        <_>
+          5 1 13 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 9 -1.</_>
+        <_>
+          11 1 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 3 -1.</_>
+        <_>
+          8 1 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 12 -1.</_>
+        <_>
+          13 1 6 6 2.</_>
+        <_>
+          7 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 6 -1.</_>
+        <_>
+          7 4 8 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 8 4 -1.</_>
+        <_>
+          11 11 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 8 -1.</_>
+        <_>
+          8 11 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 4 -1.</_>
+        <_>
+          10 10 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 7 -1.</_>
+        <_>
+          9 10 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 14 -1.</_>
+        <_>
+          9 7 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 7 -1.</_>
+        <_>
+          8 6 5 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 3 -1.</_>
+        <_>
+          3 7 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 17 -1.</_>
+        <_>
+          5 5 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 18 -1.</_>
+        <_>
+          15 0 3 9 2.</_>
+        <_>
+          12 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 16 -1.</_>
+        <_>
+          3 4 3 8 2.</_>
+        <_>
+          6 12 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 18 -1.</_>
+        <_>
+          15 0 3 9 2.</_>
+        <_>
+          12 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 4 -1.</_>
+        <_>
+          0 1 8 2 2.</_>
+        <_>
+          8 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 12 5 -1.</_>
+        <_>
+          6 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 10 -1.</_>
+        <_>
+          3 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 7 12 -1.</_>
+        <_>
+          11 7 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 6 -1.</_>
+        <_>
+          0 8 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 7 6 -1.</_>
+        <_>
+          12 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 7 6 -1.</_>
+        <_>
+          0 5 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 8 -1.</_>
+        <_>
+          15 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 2 -1.</_>
+        <_>
+          0 18 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 8 -1.</_>
+        <_>
+          15 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 2 -1.</_>
+        <_>
+          0 18 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_>
+        <_>
+          6 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 6 8 -1.</_>
+        <_>
+          2 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 14 -1.</_>
+        <_>
+          14 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 7 -1.</_>
+        <_>
+          8 0 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 8 -1.</_>
+        <_>
+          10 0 4 4 2.</_>
+        <_>
+          6 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 8 -1.</_>
+        <_>
+          5 0 4 4 2.</_>
+        <_>
+          9 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 16 7 -1.</_>
+        <_>
+          3 7 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 16 7 -1.</_>
+        <_>
+          8 7 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 10 8 -1.</_>
+        <_>
+          7 11 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 9 -1.</_>
+        <_>
+          14 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 9 -1.</_>
+        <_>
+          3 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 11 -1.</_>
+        <_>
+          4 3 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 13 3 -1.</_>
+        <_>
+          4 6 13 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 9 -1.</_>
+        <_>
+          9 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 12 -1.</_>
+        <_>
+          1 0 7 6 2.</_>
+        <_>
+          8 6 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 4 -1.</_>
+        <_>
+          10 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 12 -1.</_>
+        <_>
+          5 10 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 22 -1.</_>
+        <_>
+          11 11 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 19 14 4 -1.</_>
+        <_>
+          0 19 7 2 2.</_>
+        <_>
+          7 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 8 -1.</_>
+        <_>
+          10 8 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 14 -1.</_>
+        <_>
+          5 0 2 7 2.</_>
+        <_>
+          7 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 4 10 -1.</_>
+        <_>
+          8 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 8 2 -1.</_>
+        <_>
+          9 8 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 19 3 -1.</_>
+        <_>
+          0 8 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 19 2 -1.</_>
+        <_>
+          0 9 19 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 18 4 -1.</_>
+        <_>
+          10 6 9 2 2.</_>
+        <_>
+          1 8 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 8 18 -1.</_>
+        <_>
+          6 1 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 12 -1.</_>
+        <_>
+          11 11 5 6 2.</_>
+        <_>
+          6 17 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 9 11 -1.</_>
+        <_>
+          6 7 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 14 -1.</_>
+        <_>
+          11 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 12 7 -1.</_>
+        <_>
+          6 16 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 15 6 -1.</_>
+        <_>
+          7 15 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 7 -1.</_>
+        <_>
+          7 2 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 14 -1.</_>
+        <_>
+          9 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 14 -1.</_>
+        <_>
+          8 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 18 12 5 -1.</_>
+        <_>
+          11 18 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 15 3 -1.</_>
+        <_>
+          1 19 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          5 10 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 4 9 -1.</_>
+        <_>
+          12 11 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 9 4 -1.</_>
+        <_>
+          7 11 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 16 -1.</_>
+        <_>
+          15 11 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 5 6 -1.</_>
+        <_>
+          1 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 5 6 -1.</_>
+        <_>
+          12 19 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 3 14 -1.</_>
+        <_>
+          6 2 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 9 -1.</_>
+        <_>
+          8 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 10 5 -1.</_>
+        <_>
+          7 7 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 20 -1.</_>
+        <_>
+          6 0 2 10 2.</_>
+        <_>
+          8 10 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 9 -1.</_>
+        <_>
+          14 11 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 3 -1.</_>
+        <_>
+          5 11 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 14 -1.</_>
+        <_>
+          9 6 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 9 -1.</_>
+        <_>
+          8 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 9 -1.</_>
+        <_>
+          9 1 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 12 6 -1.</_>
+        <_>
+          13 17 6 3 2.</_>
+        <_>
+          7 20 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 10 6 -1.</_>
+        <_>
+          8 4 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 8 -1.</_>
+        <_>
+          15 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 8 -1.</_>
+        <_>
+          5 5 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 8 -1.</_>
+        <_>
+          15 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 8 -1.</_>
+        <_>
+          0 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 5 -1.</_>
+        <_>
+          10 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 21 14 2 -1.</_>
+        <_>
+          5 21 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 9 -1.</_>
+        <_>
+          9 3 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 8 -1.</_>
+        <_>
+          12 1 6 4 2.</_>
+        <_>
+          6 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 11 -1.</_>
+        <_>
+          9 10 5 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 15 -1.</_>
+        <_>
+          13 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 12 -1.</_>
+        <_>
+          8 3 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 10 8 -1.</_>
+        <_>
+          8 2 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 19 6 -1.</_>
+        <_>
+          0 6 19 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 16 -1.</_>
+        <_>
+          4 4 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 5 -1.</_>
+        <_>
+          7 1 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 18 -1.</_>
+        <_>
+          10 5 7 9 2.</_>
+        <_>
+          3 14 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 5 6 -1.</_>
+        <_>
+          1 20 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 14 -1.</_>
+        <_>
+          2 0 2 7 2.</_>
+        <_>
+          4 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 2 10 -1.</_>
+        <_>
+          10 2 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 3 -1.</_>
+        <_>
+          8 2 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 10 6 -1.</_>
+        <_>
+          11 2 5 3 2.</_>
+        <_>
+          6 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          1 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 10 6 -1.</_>
+        <_>
+          11 2 5 3 2.</_>
+        <_>
+          6 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 6 -1.</_>
+        <_>
+          3 2 5 3 2.</_>
+        <_>
+          8 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 20 -1.</_>
+        <_>
+          7 5 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 12 7 -1.</_>
+        <_>
+          5 10 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 14 4 -1.</_>
+        <_>
+          0 18 7 2 2.</_>
+        <_>
+          7 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 15 -1.</_>
+        <_>
+          10 7 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 5 -1.</_>
+        <_>
+          9 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 2 17 -1.</_>
+        <_>
+          9 4 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 2 17 -1.</_>
+        <_>
+          9 4 1 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 9 5 -1.</_>
+        <_>
+          11 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 18 9 5 -1.</_>
+        <_>
+          5 18 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 6 5 -1.</_>
+        <_>
+          12 18 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 6 5 -1.</_>
+        <_>
+          8 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          15 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 9 -1.</_>
+        <_>
+          2 17 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          15 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 10 -1.</_>
+        <_>
+          2 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 12 -1.</_>
+        <_>
+          12 5 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 18 7 4 -1.</_>
+        <_>
+          6 20 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 4 12 -1.</_>
+        <_>
+          15 8 2 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 4 -1.</_>
+        <_>
+          4 8 12 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 13 5 9 -1.</_>
+        <_>
+          14 16 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 5 9 -1.</_>
+        <_>
+          0 16 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 7 6 -1.</_>
+        <_>
+          12 16 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 6 6 -1.</_>
+        <_>
+          1 19 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 4 -1.</_>
+        <_>
+          7 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 3 -1.</_>
+        <_>
+          0 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 9 6 -1.</_>
+        <_>
+          12 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 15 9 -1.</_>
+        <_>
+          7 17 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 8 8 -1.</_>
+        <_>
+          9 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 14 -1.</_>
+        <_>
+          5 9 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 13 -1.</_>
+        <_>
+          12 10 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 4 13 -1.</_>
+        <_>
+          5 10 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 14 2 -1.</_>
+        <_>
+          5 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 2 -1.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 10 -1.</_>
+        <_>
+          16 12 3 5 2.</_>
+        <_>
+          13 17 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 6 10 -1.</_>
+        <_>
+          0 12 3 5 2.</_>
+        <_>
+          3 17 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 5 12 -1.</_>
+        <_>
+          12 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 5 12 -1.</_>
+        <_>
+          2 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 7 4 -1.</_>
+        <_>
+          6 10 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 14 3 -1.</_>
+        <_>
+          0 18 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 15 -1.</_>
+        <_>
+          12 7 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 9 6 -1.</_>
+        <_>
+          4 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 9 7 -1.</_>
+        <_>
+          13 9 3 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 7 9 -1.</_>
+        <_>
+          6 9 7 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 4 -1.</_>
+        <_>
+          5 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 14 -1.</_>
+        <_>
+          0 13 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 22 -1.</_>
+        <_>
+          10 1 9 11 2.</_>
+        <_>
+          1 12 9 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 17 3 -1.</_>
+        <_>
+          1 6 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 5 -1.</_>
+        <_>
+          13 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 16 3 -1.</_>
+        <_>
+          0 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 17 -1.</_>
+        <_>
+          12 6 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 17 -1.</_>
+        <_>
+          4 6 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 2 -1.</_>
+        <_>
+          1 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 2 16 -1.</_>
+        <_>
+          1 5 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 10 -1.</_>
+        <_>
+          15 17 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 16 3 -1.</_>
+        <_>
+          1 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 12 -1.</_>
+        <_>
+          6 12 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 8 -1.</_>
+        <_>
+          3 17 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 8 8 -1.</_>
+        <_>
+          9 17 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 10 -1.</_>
+        <_>
+          5 0 4 5 2.</_>
+        <_>
+          9 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 18 6 -1.</_>
+        <_>
+          10 4 9 3 2.</_>
+        <_>
+          1 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 9 6 -1.</_>
+        <_>
+          3 18 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 14 4 -1.</_>
+        <_>
+          3 18 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 9 6 -1.</_>
+        <_>
+          2 5 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 19 3 -1.</_>
+        <_>
+          0 4 19 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 16 4 -1.</_>
+        <_>
+          1 4 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 14 -1.</_>
+        <_>
+          14 0 3 7 2.</_>
+        <_>
+          11 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 9 6 -1.</_>
+        <_>
+          3 17 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 8 7 -1.</_>
+        <_>
+          9 16 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 10 5 -1.</_>
+        <_>
+          8 14 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 14 -1.</_>
+        <_>
+          13 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 14 -1.</_>
+        <_>
+          5 9 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 6 14 -1.</_>
+        <_>
+          13 9 3 7 2.</_>
+        <_>
+          10 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 5 -1.</_>
+        <_>
+          9 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          7 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 11 21 -1.</_>
+        <_>
+          2 7 11 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 12 -1.</_>
+        <_>
+          8 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 6 14 -1.</_>
+        <_>
+          3 9 3 7 2.</_>
+        <_>
+          6 16 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 8 7 -1.</_>
+        <_>
+          12 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 8 7 -1.</_>
+        <_>
+          3 7 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 9 20 -1.</_>
+        <_>
+          8 2 3 20 3.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_profileface.xml b/venv/Lib/site-packages/cv2/data/haarcascade_profileface.xml
new file mode 100644
index 000000000..486d8e3d8
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_profileface.xml
@@ -0,0 +1,29690 @@
+<?xml version="1.0"?>
+<!--
+    20x20 profile face detector.
+    Contributed by David Bradley from Princeton University.
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>195</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>26</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>3</maxWeakCount>
+      <stageThreshold>-1.1856809854507446e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 1.1384399840608239e-03</internalNodes>
+          <leafValues>
+            -8.3771979808807373e-01 7.3413830995559692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -1.1342350393533707e-02</internalNodes>
+          <leafValues>
+            6.2702018022537231e-01 -7.2396302223205566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -1.1023089755326509e-03</internalNodes>
+          <leafValues>
+            3.7600189447402954e-01 -6.6088408231735229e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.4913179874420166e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3 -1.9553869962692261e-02</internalNodes>
+          <leafValues>
+            4.9245831370353699e-01 -6.3396167755126953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 2.2794529795646667e-03</internalNodes>
+          <leafValues>
+            -6.4604967832565308e-01 3.5818460583686829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 2.4270440917462111e-03</internalNodes>
+          <leafValues>
+            -4.7253230214118958e-01 2.8494310379028320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 1.9644061103463173e-03</internalNodes>
+          <leafValues>
+            1.6999539732933044e-01 -7.7868157625198364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 2.2895270958542824e-03</internalNodes>
+          <leafValues>
+            1.5551710128784180e-01 -6.6725099086761475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 -3.0143910553306341e-03</internalNodes>
+          <leafValues>
+            -6.8721300363540649e-01 1.4604569971561432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 -1.7399009317159653e-02</internalNodes>
+          <leafValues>
+            7.2524380683898926e-01 -1.6572900116443634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 9.0722442837432027e-04</internalNodes>
+          <leafValues>
+            -4.6388080716133118e-01 2.3604999482631683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -1.5043979510664940e-03</internalNodes>
+          <leafValues>
+            -7.5959628820419312e-01 1.1436919867992401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 1.0804689675569534e-01</internalNodes>
+          <leafValues>
+            -1.2865519523620605e-01 7.9092341661453247e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -1.1923050042241812e-03</internalNodes>
+          <leafValues>
+            -6.2403547763824463e-01 1.4847490191459656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -2.0571390166878700e-02</internalNodes>
+          <leafValues>
+            4.0808489918708801e-01 -2.1287000179290771e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>27</maxWeakCount>
+      <stageThreshold>-1.9596290588378906e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 15 -3.6899209022521973e-02</internalNodes>
+          <leafValues>
+            5.3308618068695068e-01 -4.0872651338577271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 2.4960909504443407e-03</internalNodes>
+          <leafValues>
+            -6.9489312171936035e-01 2.7125179767608643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 2.4068039783742279e-04</internalNodes>
+          <leafValues>
+            -5.6208252906799316e-01 2.1930350363254547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -5.8021828532218933e-02</internalNodes>
+          <leafValues>
+            6.9060617685317993e-01 -1.5082140266895294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 1.1526979506015778e-03</internalNodes>
+          <leafValues>
+            1.3925389945507050e-01 -6.6311657428741455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 7.4388440698385239e-03</internalNodes>
+          <leafValues>
+            -3.3333170413970947e-01 3.1699380278587341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 -1.4158539706841111e-03</internalNodes>
+          <leafValues>
+            -6.8007302284240723e-01 1.3243320584297180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 8.8562711607664824e-04</internalNodes>
+          <leafValues>
+            -3.8672161102294922e-01 1.9732959568500519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 2.5714060757309198e-03</internalNodes>
+          <leafValues>
+            1.2035659700632095e-01 -7.3177069425582886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 1.8255549948662519e-03</internalNodes>
+          <leafValues>
+            7.7979840338230133e-02 -7.7196091413497925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 -1.1993020307272673e-03</internalNodes>
+          <leafValues>
+            1.6821229457855225e-01 -4.1479128599166870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 2.3179080337285995e-02</internalNodes>
+          <leafValues>
+            7.5337320566177368e-02 -7.1047067642211914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 4.6539418399333954e-02</internalNodes>
+          <leafValues>
+            -1.0464839637279510e-01 6.6270697116851807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -1.7157640540972352e-03</internalNodes>
+          <leafValues>
+            -4.9618211388587952e-01 1.6275240480899811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 -1.2778829783201218e-02</internalNodes>
+          <leafValues>
+            4.6254539489746094e-01 -1.6027900576591492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 -1.5214820206165314e-01</internalNodes>
+          <leafValues>
+            -7.0592701435089111e-01 1.0022509843111038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 3.1789899803698063e-03</internalNodes>
+          <leafValues>
+            1.2345749884843826e-01 -3.9093419909477234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -2.2882770281285048e-03</internalNodes>
+          <leafValues>
+            3.7081500887870789e-01 -1.6210420429706573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -2.9806189704686403e-03</internalNodes>
+          <leafValues>
+            1.8087059259414673e-01 -3.3239859342575073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -1.5072739915922284e-03</internalNodes>
+          <leafValues>
+            -4.9472311139106750e-01 9.8288856446743011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 1.9225040450692177e-03</internalNodes>
+          <leafValues>
+            -1.7791110277175903e-01 3.0773329734802246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 1.9025449873879552e-03</internalNodes>
+          <leafValues>
+            8.4794998168945312e-02 -5.9020972251892090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -3.5421559587121010e-03</internalNodes>
+          <leafValues>
+            3.1175771355628967e-01 -1.4392930269241333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -2.9751660767942667e-03</internalNodes>
+          <leafValues>
+            -6.3649141788482666e-01 8.2639887928962708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 1.0003290139138699e-02</internalNodes>
+          <leafValues>
+            -1.1699260026216507e-01 4.2387530207633972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 -1.9193530315533280e-03</internalNodes>
+          <leafValues>
+            -4.7115838527679443e-01 1.1038240045309067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 2.5070620700716972e-02</internalNodes>
+          <leafValues>
+            4.8775929957628250e-02 -8.0351328849792480e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>28</maxWeakCount>
+      <stageThreshold>-1.9849590063095093e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 42 1.4214799739420414e-02</internalNodes>
+          <leafValues>
+            -6.3577878475189209e-01 3.3461728692054749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 -1.2525909580290318e-02</internalNodes>
+          <leafValues>
+            3.2766130566596985e-01 -4.1331529617309570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -2.2514370357384905e-05</internalNodes>
+          <leafValues>
+            2.3102630674839020e-01 -5.4282051324844360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 1.8600060138851404e-03</internalNodes>
+          <leafValues>
+            1.7933349311351776e-01 -6.9131940603256226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 7.8344792127609253e-03</internalNodes>
+          <leafValues>
+            9.1071300208568573e-02 -7.8126847743988037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -4.2322301305830479e-03</internalNodes>
+          <leafValues>
+            2.0658409595489502e-01 -4.2906031012535095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -7.5860600918531418e-04</internalNodes>
+          <leafValues>
+            2.0730710029602051e-01 -4.2070311307907104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 -3.5626380704343319e-03</internalNodes>
+          <leafValues>
+            -6.3227087259292603e-01 1.3118620216846466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -4.9960161559283733e-03</internalNodes>
+          <leafValues>
+            -7.5112378597259521e-01 7.8203327953815460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 7.3098740540444851e-03</internalNodes>
+          <leafValues>
+            9.3428641557693481e-02 -6.6310107707977295e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 2.2772040392737836e-04</internalNodes>
+          <leafValues>
+            -3.4148821234703064e-01 2.0008200407028198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 8.3124160300940275e-04</internalNodes>
+          <leafValues>
+            -2.5448161363601685e-01 2.5857710838317871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 -7.5492179021239281e-03</internalNodes>
+          <leafValues>
+            -6.6138988733291626e-01 8.3004422485828400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -3.8039948791265488e-02</internalNodes>
+          <leafValues>
+            -8.2163572311401367e-01 5.9231590479612350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 2.8484580107033253e-03</internalNodes>
+          <leafValues>
+            8.9729957282543182e-02 -5.8333742618560791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 4.8181698657572269e-03</internalNodes>
+          <leafValues>
+            9.3960560858249664e-02 -5.7619768381118774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 -1.1190489865839481e-02</internalNodes>
+          <leafValues>
+            -6.2544298171997070e-01 7.3608897626399994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -6.4537129364907742e-03</internalNodes>
+          <leafValues>
+            5.5123388767242432e-01 -1.0020790249109268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 3.3225629013031721e-03</internalNodes>
+          <leafValues>
+            -1.0797890275716782e-01 5.3664940595626831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 4.6705761924386024e-03</internalNodes>
+          <leafValues>
+            8.8321126997470856e-02 -6.7683601379394531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -1.1613310314714909e-02</internalNodes>
+          <leafValues>
+            -5.0711882114410400e-01 7.6556630432605743e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -3.7515610456466675e-02</internalNodes>
+          <leafValues>
+            -7.2936272621154785e-01 5.9448610991239548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 2.3086030036211014e-02</internalNodes>
+          <leafValues>
+            5.0718959420919418e-02 -7.8459781408309937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -7.1651988946541678e-06</internalNodes>
+          <leafValues>
+            1.6686220467090607e-01 -2.5713220238685608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 7.1611627936363220e-04</internalNodes>
+          <leafValues>
+            1.0636030137538910e-01 -4.2793640494346619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 4.1476460173726082e-03</internalNodes>
+          <leafValues>
+            -1.2069659680128098e-01 4.1993188858032227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -2.5815099943429232e-03</internalNodes>
+          <leafValues>
+            4.8718088865280151e-01 -1.0045810043811798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 -1.7147070029750466e-03</internalNodes>
+          <leafValues>
+            -4.6096310019493103e-01 1.0375110059976578e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>28</maxWeakCount>
+      <stageThreshold>-1.8260079622268677e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 70 -6.1202719807624817e-02</internalNodes>
+          <leafValues>
+            3.9079108834266663e-01 -3.9401251077651978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -1.4643670292571187e-03</internalNodes>
+          <leafValues>
+            -7.3697841167449951e-01 1.5660220384597778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 7.2080420795828104e-04</internalNodes>
+          <leafValues>
+            2.1675530076026917e-01 -5.8012658357620239e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 6.4895692048594356e-04</internalNodes>
+          <leafValues>
+            -7.2308099269866943e-01 1.2785249948501587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 -1.7158190021291375e-03</internalNodes>
+          <leafValues>
+            -7.7100431919097900e-01 1.0210309922695160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 -2.2490581031888723e-03</internalNodes>
+          <leafValues>
+            -6.0623127222061157e-01 1.2427269667387009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 5.3841978311538696e-02</internalNodes>
+          <leafValues>
+            -1.7169749736785889e-01 5.3350567817687988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -1.3288970291614532e-01</internalNodes>
+          <leafValues>
+            5.5924367904663086e-01 -1.8954899907112122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 9.0965389972552657e-04</internalNodes>
+          <leafValues>
+            -4.7166430950164795e-01 1.6924260556697845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 6.0799147468060255e-04</internalNodes>
+          <leafValues>
+            1.1347220093011856e-01 -5.9846878051757812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 1.6072629392147064e-01</internalNodes>
+          <leafValues>
+            -1.0295519977807999e-01 6.6487199068069458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -1.7097239615395665e-03</internalNodes>
+          <leafValues>
+            -4.7276279330253601e-01 1.3392050564289093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 1.1734620202332735e-03</internalNodes>
+          <leafValues>
+            -2.2795589268207550e-01 2.6135650277137756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -1.5138329472392797e-03</internalNodes>
+          <leafValues>
+            -5.5395001173019409e-01 1.1028339713811874e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -2.1774161141365767e-03</internalNodes>
+          <leafValues>
+            -6.2228900194168091e-01 7.8486673533916473e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 -2.7727920096367598e-03</internalNodes>
+          <leafValues>
+            4.6141120791435242e-01 -1.3496559858322144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 9.3199027469381690e-04</internalNodes>
+          <leafValues>
+            1.0162770003080368e-01 -5.1631838083267212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 2.9746659565716982e-03</internalNodes>
+          <leafValues>
+            -1.2999209761619568e-01 4.2117300629615784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 -5.0399480387568474e-03</internalNodes>
+          <leafValues>
+            -6.3706171512603760e-01 7.7624127268791199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 2.3414850234985352e-02</internalNodes>
+          <leafValues>
+            7.2182796895503998e-02 -5.9831130504608154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -1.0927390540018678e-03</internalNodes>
+          <leafValues>
+            -4.1664880514144897e-01 1.1829990148544312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -1.6441360348835588e-03</internalNodes>
+          <leafValues>
+            1.8583069741725922e-01 -2.7551019191741943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 -2.5736279785633087e-02</internalNodes>
+          <leafValues>
+            -7.5146478414535522e-01 6.3907749950885773e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 -2.8924590442329645e-03</internalNodes>
+          <leafValues>
+            -5.6780880689620972e-01 7.3297739028930664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 -5.2889231592416763e-03</internalNodes>
+          <leafValues>
+            -6.3738888502120972e-01 6.8686947226524353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 3.2964269630610943e-03</internalNodes>
+          <leafValues>
+            -2.5062951445579529e-01 1.5989780426025391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 2.4914439767599106e-02</internalNodes>
+          <leafValues>
+            5.5260978639125824e-02 -7.6208770275115967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -1.5088500455021858e-02</internalNodes>
+          <leafValues>
+            3.7033379077911377e-01 -1.2003959715366364e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-1.9446740150451660e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 98 -1.1857179924845695e-02</internalNodes>
+          <leafValues>
+            2.9421558976173401e-01 -5.1703310012817383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 2.0991980563849211e-03</internalNodes>
+          <leafValues>
+            -6.1471748352050781e-01 2.0648500323295593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -1.5772449842188507e-04</internalNodes>
+          <leafValues>
+            2.2870740294456482e-01 -5.5258047580718994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -2.0669099467340857e-04</internalNodes>
+          <leafValues>
+            1.2070009857416153e-01 -5.4926127195358276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 2.2675560321658850e-03</internalNodes>
+          <leafValues>
+            1.5354810655117035e-01 -4.6074301004409790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 1.4469499699771404e-02</internalNodes>
+          <leafValues>
+            -1.8976309895515442e-01 4.2071411013603210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 -1.2127560330554843e-03</internalNodes>
+          <leafValues>
+            -4.5139861106872559e-01 9.9425867199897766e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 2.1505509503185749e-03</internalNodes>
+          <leafValues>
+            1.0200879722833633e-01 -6.2064242362976074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 -1.6638869419693947e-03</internalNodes>
+          <leafValues>
+            -7.0367491245269775e-01 7.7214680612087250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 1.0530210565775633e-03</internalNodes>
+          <leafValues>
+            -3.2453960180282593e-01 1.7616109549999237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 1.1836409568786621e-02</internalNodes>
+          <leafValues>
+            -1.3507820665836334e-01 4.2641130089759827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 9.6512871095910668e-04</internalNodes>
+          <leafValues>
+            9.4502769410610199e-02 -4.8544931411743164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 7.5651629595085979e-04</internalNodes>
+          <leafValues>
+            -2.9959529638290405e-01 1.6867619752883911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 1.0839150287210941e-02</internalNodes>
+          <leafValues>
+            -1.1121030151844025e-01 4.6914410591125488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -5.1439419388771057e-02</internalNodes>
+          <leafValues>
+            4.1726920008659363e-01 -1.1776400357484818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 3.4927250817418098e-03</internalNodes>
+          <leafValues>
+            9.2512279748916626e-02 -5.2599352598190308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -1.3926399871706963e-02</internalNodes>
+          <leafValues>
+            -6.6633498668670654e-01 5.2386458963155746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 4.5590959489345551e-03</internalNodes>
+          <leafValues>
+            -9.3383841216564178e-02 4.3774750828742981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -3.7318699061870575e-02</internalNodes>
+          <leafValues>
+            -5.9583687782287598e-01 7.2627849876880646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 1.2496879789978266e-03</internalNodes>
+          <leafValues>
+            6.9537237286567688e-02 -4.8772460222244263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 -3.7307639140635729e-03</internalNodes>
+          <leafValues>
+            3.2699251174926758e-01 -1.1739090085029602e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 2.1144179627299309e-03</internalNodes>
+          <leafValues>
+            9.2889092862606049e-02 -4.1788020730018616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -6.4239342464134097e-04</internalNodes>
+          <leafValues>
+            -2.9332190752029419e-01 1.3107809424400330e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -3.1379980500787497e-03</internalNodes>
+          <leafValues>
+            3.2445520162582397e-01 -1.1506850272417068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -3.9186969399452209e-02</internalNodes>
+          <leafValues>
+            -7.9360449314117432e-01 5.0053481012582779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 4.4646807946264744e-03</internalNodes>
+          <leafValues>
+            5.4776020348072052e-02 -5.6535738706588745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 8.6451368406414986e-04</internalNodes>
+          <leafValues>
+            -1.7471200227737427e-01 1.9758160412311554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 2.4237011093646288e-03</internalNodes>
+          <leafValues>
+            -9.5296189188957214e-02 4.0760260820388794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -2.5377490092068911e-03</internalNodes>
+          <leafValues>
+            -6.2454742193222046e-01 6.9920547306537628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -7.3309220169903710e-06</internalNodes>
+          <leafValues>
+            1.2249249964952469e-01 -2.8157269954681396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 -1.8882560543715954e-03</internalNodes>
+          <leafValues>
+            -6.2670397758483887e-01 6.5820932388305664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 6.0609861975535750e-04</internalNodes>
+          <leafValues>
+            -2.5481408834457397e-01 1.2902240455150604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 2.3213759995996952e-03</internalNodes>
+          <leafValues>
+            -9.7430117428302765e-02 3.2456091046333313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 -1.8534410046413541e-03</internalNodes>
+          <leafValues>
+            -4.4065341353416443e-01 8.2968853414058685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 2.3999500554054976e-03</internalNodes>
+          <leafValues>
+            -1.2041269987821579e-01 2.8288060426712036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 -8.1356197595596313e-02</internalNodes>
+          <leafValues>
+            -7.3972231149673462e-01 4.6568300575017929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -2.9865680262446404e-03</internalNodes>
+          <leafValues>
+            1.6334620118141174e-01 -1.9834910333156586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 2.8128880076110363e-03</internalNodes>
+          <leafValues>
+            1.1837379634380341e-01 -2.9398199915885925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -1.0060790181159973e-01</internalNodes>
+          <leafValues>
+            -7.3717647790908813e-01 4.2510021477937698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 1.1854549666168168e-04</internalNodes>
+          <leafValues>
+            1.0471060127019882e-01 -2.9139861464500427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 2.2375308908522129e-03</internalNodes>
+          <leafValues>
+            -9.6042059361934662e-02 3.4045928716659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -4.4986992143094540e-03</internalNodes>
+          <leafValues>
+            -5.8234661817550659e-01 5.6236840784549713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 -3.6484538577497005e-04</internalNodes>
+          <leafValues>
+            -2.7956131100654602e-01 1.0113990306854248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -7.9940296709537506e-03</internalNodes>
+          <leafValues>
+            2.7775949239730835e-01 -1.1941230297088623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -5.1547219045460224e-03</internalNodes>
+          <leafValues>
+            -6.0229510068893433e-01 4.8917140811681747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -8.1772619159892201e-04</internalNodes>
+          <leafValues>
+            1.7660500109195709e-01 -1.6407689452171326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 6.7434698343276978e-02</internalNodes>
+          <leafValues>
+            4.0761459618806839e-02 -7.1865761280059814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -2.4103289470076561e-03</internalNodes>
+          <leafValues>
+            1.7671680450439453e-01 -1.6081850230693817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -3.5183799918740988e-03</internalNodes>
+          <leafValues>
+            -4.3078601360321045e-01 7.0671632885932922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 -1.4561560419679154e-05</internalNodes>
+          <leafValues>
+            1.2714700400829315e-01 -2.3387859761714935e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -4.7951821237802505e-02</internalNodes>
+          <leafValues>
+            -7.9085767269134521e-01 3.6803081631660461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 2.1735159680247307e-03</internalNodes>
+          <leafValues>
+            -1.3089279830455780e-01 2.5330349802970886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -3.4542270004749298e-03</internalNodes>
+          <leafValues>
+            5.1025247573852539e-01 -7.5337253510951996e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>54</maxWeakCount>
+      <stageThreshold>-1.8389279842376709e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 151 4.5243161730468273e-03</internalNodes>
+          <leafValues>
+            -3.0485519766807556e-01 5.1908642053604126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 2.3372350260615349e-03</internalNodes>
+          <leafValues>
+            -4.2904540896415710e-01 2.9052159190177917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 -4.4243237935006618e-03</internalNodes>
+          <leafValues>
+            2.1068570017814636e-01 -4.5954981446266174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 -1.2887439690530300e-02</internalNodes>
+          <leafValues>
+            1.9138230383396149e-01 -4.5879068970680237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 -5.2370920457178727e-05</internalNodes>
+          <leafValues>
+            1.4141489565372467e-01 -5.0267368555068970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -4.7738491557538509e-03</internalNodes>
+          <leafValues>
+            -4.8760831356048584e-01 1.2341009825468063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 9.6315861446782947e-04</internalNodes>
+          <leafValues>
+            1.3367399573326111e-01 -4.4793748855590820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -8.9140303432941437e-02</internalNodes>
+          <leafValues>
+            5.0387668609619141e-01 -1.5923009812831879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 1.7201449954882264e-03</internalNodes>
+          <leafValues>
+            -2.0535360276699066e-01 2.4340680241584778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -2.6712119579315186e-03</internalNodes>
+          <leafValues>
+            -6.3319712877273560e-01 5.3035650402307510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 3.7353280931711197e-02</internalNodes>
+          <leafValues>
+            -1.1360249668359756e-01 4.6645331382751465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -3.1510960310697556e-02</internalNodes>
+          <leafValues>
+            -6.8820482492446899e-01 6.9371856749057770e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 1.5293819829821587e-02</internalNodes>
+          <leafValues>
+            -1.0043840110301971e-01 4.6267789602279663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 5.4966909810900688e-03</internalNodes>
+          <leafValues>
+            -9.3514643609523773e-02 4.5127061009407043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 -4.6311439946293831e-03</internalNodes>
+          <leafValues>
+            -6.4314597845077515e-01 8.5003547370433807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 8.0943357897922397e-04</internalNodes>
+          <leafValues>
+            7.9738967120647430e-02 -4.9320799112319946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 2.9745940119028091e-02</internalNodes>
+          <leafValues>
+            7.8420467674732208e-02 -5.0482439994812012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 9.7070122137665749e-04</internalNodes>
+          <leafValues>
+            5.8135438710451126e-02 -5.7035177946090698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 2.4534659460186958e-03</internalNodes>
+          <leafValues>
+            -1.1259060353040695e-01 3.6852970719337463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 1.9709810148924589e-03</internalNodes>
+          <leafValues>
+            7.7185310423374176e-02 -5.2683860063552856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 4.8643019981682301e-03</internalNodes>
+          <leafValues>
+            -1.0479539632797241e-01 4.1474440693855286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 1.0143260005861521e-03</internalNodes>
+          <leafValues>
+            -1.4731560647487640e-01 2.8671079874038696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -9.5099088503047824e-04</internalNodes>
+          <leafValues>
+            -3.8070049881935120e-01 8.8108353316783905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 -5.6730289943516254e-03</internalNodes>
+          <leafValues>
+            2.4818900227546692e-01 -1.3696339726448059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 1.6987899318337440e-02</internalNodes>
+          <leafValues>
+            -8.0896042287349701e-02 5.2781671285629272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -7.5278789736330509e-03</internalNodes>
+          <leafValues>
+            -4.6880009770393372e-01 8.9389666914939880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 3.3948529511690140e-02</internalNodes>
+          <leafValues>
+            5.0594791769981384e-02 -6.7399561405181885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 8.3328841719776392e-04</internalNodes>
+          <leafValues>
+            -1.8931360542774200e-01 1.9607099890708923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -5.9632491320371628e-04</internalNodes>
+          <leafValues>
+            -3.6229288578033447e-01 1.0544770210981369e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 3.0905720777809620e-03</internalNodes>
+          <leafValues>
+            5.7209629565477371e-02 -5.5316972732543945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 3.5152619238942862e-03</internalNodes>
+          <leafValues>
+            -1.2211070209741592e-01 2.9369899630546570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 7.9333729809150100e-04</internalNodes>
+          <leafValues>
+            7.5977906584739685e-02 -4.4539821147918701e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 -1.1189360171556473e-02</internalNodes>
+          <leafValues>
+            -5.0596517324447632e-01 5.7438369840383530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.1787790572270751e-03</internalNodes>
+          <leafValues>
+            3.0799698829650879e-01 -1.0762230306863785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 5.4418851505033672e-05</internalNodes>
+          <leafValues>
+            -2.5997561216354370e-01 1.3138440251350403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 -7.2562302193546202e-06</internalNodes>
+          <leafValues>
+            1.5439839661121368e-01 -2.1094700694084167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -8.3436258137226105e-04</internalNodes>
+          <leafValues>
+            1.3689869642257690e-01 -2.4367660284042358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -3.3380609005689621e-02</internalNodes>
+          <leafValues>
+            -6.7477357387542725e-01 5.0986740738153458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 7.4093497823923826e-04</internalNodes>
+          <leafValues>
+            9.1248527169227600e-02 -3.5220760107040405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -2.0966369193047285e-03</internalNodes>
+          <leafValues>
+            1.9110049307346344e-01 -1.6380029916763306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 -6.9339506328105927e-02</internalNodes>
+          <leafValues>
+            -8.7700867652893066e-01 3.5726629197597504e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -5.7089990004897118e-03</internalNodes>
+          <leafValues>
+            -6.8067228794097900e-01 3.5545960068702698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 6.8668760359287262e-03</internalNodes>
+          <leafValues>
+            -6.4886868000030518e-02 5.2265900373458862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 5.4602831369265914e-04</internalNodes>
+          <leafValues>
+            1.0924419760704041e-01 -3.0285251140594482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 6.4349039457738400e-03</internalNodes>
+          <leafValues>
+            -1.6561950743198395e-01 1.9022129476070404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -1.0112419724464417e-02</internalNodes>
+          <leafValues>
+            7.4523001909255981e-01 -3.8347329944372177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -7.5152877252548933e-04</internalNodes>
+          <leafValues>
+            -2.8147280216217041e-01 1.1321689933538437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 2.8225290589034557e-03</internalNodes>
+          <leafValues>
+            -1.2364400178194046e-01 2.5608530640602112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 2.2058798931539059e-03</internalNodes>
+          <leafValues>
+            5.7334281504154205e-02 -5.6152081489562988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 2.8164181113243103e-01</internalNodes>
+          <leafValues>
+            4.2092379182577133e-02 -6.4923799037933350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 -4.2593148536980152e-03</internalNodes>
+          <leafValues>
+            -6.4854997396469116e-01 4.3502658605575562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 2.6586679741740227e-03</internalNodes>
+          <leafValues>
+            -9.3526139855384827e-02 3.4158730506896973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 2.0971989724785089e-03</internalNodes>
+          <leafValues>
+            -1.1068929731845856e-01 3.1760269403457642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 -1.0267860488966107e-03</internalNodes>
+          <leafValues>
+            -3.7612101435661316e-01 9.8973110318183899e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>56</maxWeakCount>
+      <stageThreshold>-1.8807189464569092e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 205 2.6354179717600346e-03</internalNodes>
+          <leafValues>
+            -5.2496808767318726e-01 2.7711030840873718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 2.6279650628566742e-03</internalNodes>
+          <leafValues>
+            -3.2195448875427246e-01 3.7013629078865051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -5.8889109641313553e-03</internalNodes>
+          <leafValues>
+            2.3777529597282410e-01 -4.1800329089164734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 1.9291159696877003e-03</internalNodes>
+          <leafValues>
+            -4.7122061252593994e-01 1.3692170381546021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -1.5205480158329010e-02</internalNodes>
+          <leafValues>
+            -3.9618429541587830e-01 1.7402400076389313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 2.3393579758703709e-03</internalNodes>
+          <leafValues>
+            -3.8508901000022888e-01 1.5659110248088837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 4.2395621538162231e-02</internalNodes>
+          <leafValues>
+            1.0478709638118744e-01 -6.2164002656936646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 -5.6959640234708786e-02</internalNodes>
+          <leafValues>
+            5.1225858926773071e-01 -1.2684780359268188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 -7.2845568865886889e-06</internalNodes>
+          <leafValues>
+            1.5136890113353729e-01 -3.1185621023178101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 -7.9633750021457672e-02</internalNodes>
+          <leafValues>
+            -8.4324747323989868e-01 4.4978428632020950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 5.9168688021600246e-03</internalNodes>
+          <leafValues>
+            -1.0745979845523834e-01 4.7434100508689880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -1.4736950397491455e-03</internalNodes>
+          <leafValues>
+            3.6067450046539307e-01 -1.4760640263557434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -3.9630971848964691e-02</internalNodes>
+          <leafValues>
+            -6.5838980674743652e-01 7.4866786599159241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 6.2401412287726998e-04</internalNodes>
+          <leafValues>
+            -2.6195651292800903e-01 1.5652139484882355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 -2.3399210476782173e-05</internalNodes>
+          <leafValues>
+            1.2157510221004486e-01 -3.0320811271667480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 3.0802030116319656e-02</internalNodes>
+          <leafValues>
+            4.4408731162548065e-02 -6.6609877347946167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 1.4787449617870152e-04</internalNodes>
+          <leafValues>
+            -2.4449509382247925e-01 1.4723050594329834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 4.8630568198859692e-03</internalNodes>
+          <leafValues>
+            -1.1267810314893723e-01 3.2596799731254578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 6.2191881239414215e-02</internalNodes>
+          <leafValues>
+            5.7439960539340973e-02 -6.4031070470809937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 1.4668420189991593e-03</internalNodes>
+          <leafValues>
+            9.5356643199920654e-02 -3.3727881312370300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -1.4742349776497576e-05</internalNodes>
+          <leafValues>
+            1.9759610295295715e-01 -1.7083899676799774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 -3.2495670020580292e-02</internalNodes>
+          <leafValues>
+            -3.6848729848861694e-01 9.0363331139087677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -1.5333830378949642e-03</internalNodes>
+          <leafValues>
+            3.2256379723548889e-01 -1.0416819900274277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 -2.7998909354209900e-02</internalNodes>
+          <leafValues>
+            -4.9097910523414612e-01 8.2653783261775970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 4.9783890135586262e-03</internalNodes>
+          <leafValues>
+            7.3238030076026917e-02 -4.4057780504226685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 6.8226028233766556e-03</internalNodes>
+          <leafValues>
+            7.6766029000282288e-02 -4.1460910439491272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 1.1497880332171917e-02</internalNodes>
+          <leafValues>
+            -9.1440111398696899e-02 4.0099748969078064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 -1.1003069579601288e-02</internalNodes>
+          <leafValues>
+            -5.7417541742324829e-01 7.2776727378368378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 4.9345887964591384e-04</internalNodes>
+          <leafValues>
+            -1.3353590667247772e-01 2.4575209617614746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 2.2130589932203293e-03</internalNodes>
+          <leafValues>
+            -1.0753840208053589e-01 3.1632119417190552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 5.1011620089411736e-03</internalNodes>
+          <leafValues>
+            7.8985318541526794e-02 -4.2948201298713684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -3.7305638194084167e-02</internalNodes>
+          <leafValues>
+            -6.7921191453933716e-01 4.5049939304590225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -6.1271698214113712e-03</internalNodes>
+          <leafValues>
+            2.3062059283256531e-01 -1.4559289813041687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 7.6517700217664242e-03</internalNodes>
+          <leafValues>
+            -9.0355172753334045e-02 4.3072968721389771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 -1.1280870065093040e-02</internalNodes>
+          <leafValues>
+            -4.7850719094276428e-01 7.4674449861049652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 -1.4724049833603203e-05</internalNodes>
+          <leafValues>
+            1.4459890127182007e-01 -2.2535640001296997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -1.9895960576832294e-03</internalNodes>
+          <leafValues>
+            -6.1527568101882935e-01 5.4905921220779419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 1.6876959707587957e-03</internalNodes>
+          <leafValues>
+            -9.7619786858558655e-02 3.3004701137542725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 9.8390737548470497e-03</internalNodes>
+          <leafValues>
+            4.0972411632537842e-02 -7.5515109300613403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 1.3243829598650336e-03</internalNodes>
+          <leafValues>
+            -1.0046280175447464e-01 3.0665108561515808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 3.1150300055742264e-03</internalNodes>
+          <leafValues>
+            8.9804470539093018e-02 -3.3524599671363831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 7.3907422120100819e-06</internalNodes>
+          <leafValues>
+            -2.2410400211811066e-01 1.3288240134716034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 3.2559569925069809e-02</internalNodes>
+          <leafValues>
+            5.0113398581743240e-02 -5.4240328073501587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -2.9865119140595198e-03</internalNodes>
+          <leafValues>
+            2.8385341167449951e-01 -1.1164219677448273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 1.6058710170909762e-03</internalNodes>
+          <leafValues>
+            -1.2024080008268356e-01 2.9032671451568604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 2.2018649615347385e-03</internalNodes>
+          <leafValues>
+            7.8110128641128540e-02 -4.3846049904823303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 -5.7107508182525635e-03</internalNodes>
+          <leafValues>
+            -3.2608801126480103e-01 9.2941299080848694e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 8.9503038907423615e-04</internalNodes>
+          <leafValues>
+            -1.3504159450531006e-01 2.2331899404525757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 7.7259249985218048e-02</internalNodes>
+          <leafValues>
+            7.3221340775489807e-02 -4.1714018583297729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 -1.0145610198378563e-02</internalNodes>
+          <leafValues>
+            -2.7330970764160156e-01 1.4099189639091492e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -7.0878718361200299e-06</internalNodes>
+          <leafValues>
+            1.2602959573268890e-01 -2.3253719508647919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 -8.0232005566358566e-03</internalNodes>
+          <leafValues>
+            -6.2682849168777466e-01 4.4199578464031219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -1.5409339684993029e-03</internalNodes>
+          <leafValues>
+            3.2154878973960876e-01 -9.5819726586341858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 -1.3815560378134251e-03</internalNodes>
+          <leafValues>
+            2.3909060657024384e-01 -1.0845059901475906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 -8.5559524595737457e-03</internalNodes>
+          <leafValues>
+            -6.2880992889404297e-01 4.6904459595680237e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 1.4967939932830632e-05</internalNodes>
+          <leafValues>
+            -1.7331050336360931e-01 1.6265609860420227e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>68</maxWeakCount>
+      <stageThreshold>-1.7268099784851074e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 261 -9.2911375686526299e-03</internalNodes>
+          <leafValues>
+            2.6676508784294128e-01 -4.8681628704071045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -1.0201609693467617e-03</internalNodes>
+          <leafValues>
+            2.1469169855117798e-01 -4.2971470952033997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 1.8099240260198712e-03</internalNodes>
+          <leafValues>
+            -4.7085261344909668e-01 1.7293150722980499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 -6.3195452094078064e-02</internalNodes>
+          <leafValues>
+            5.5868512392044067e-01 -1.1922080069780350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 1.5157799934968352e-03</internalNodes>
+          <leafValues>
+            -3.3087429404258728e-01 1.4256539940834045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 -3.1134260352700949e-03</internalNodes>
+          <leafValues>
+            3.1897360086441040e-01 -1.5563400089740753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 6.7187240347266197e-03</internalNodes>
+          <leafValues>
+            1.1308009922504425e-01 -4.6142110228538513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -1.4929190001566894e-05</internalNodes>
+          <leafValues>
+            1.1303120106458664e-01 -3.8268089294433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 -1.9974811002612114e-03</internalNodes>
+          <leafValues>
+            -6.7833811044692993e-01 5.5562671273946762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 4.4361899199429899e-05</internalNodes>
+          <leafValues>
+            -2.1478720009326935e-01 1.7524589598178864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -9.4379335641860962e-03</internalNodes>
+          <leafValues>
+            -2.9008820652961731e-01 1.0494410246610641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 1.0263459989801049e-04</internalNodes>
+          <leafValues>
+            -3.6809450387954712e-01 1.1580110341310501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 -4.3512079864740372e-02</internalNodes>
+          <leafValues>
+            -5.7967478036880493e-01 4.5160628855228424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 2.3894330952316523e-03</internalNodes>
+          <leafValues>
+            -1.2443830072879791e-01 2.5726899504661560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 3.6203579511493444e-03</internalNodes>
+          <leafValues>
+            4.8385269939899445e-02 -6.4456540346145630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -4.2086638859473169e-04</internalNodes>
+          <leafValues>
+            -2.9963639378547668e-01 9.7508132457733154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -3.6320161074399948e-02</internalNodes>
+          <leafValues>
+            3.2499030232429504e-01 -1.0373180359601974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 5.5678240023553371e-03</internalNodes>
+          <leafValues>
+            -1.2865519523620605e-01 2.7721390128135681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 1.4324679505079985e-03</internalNodes>
+          <leafValues>
+            6.3044667243957520e-02 -5.0411659479141235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 1.2268769787624478e-03</internalNodes>
+          <leafValues>
+            -1.7073589563369751e-01 1.7944329977035522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 4.0125530213117599e-03</internalNodes>
+          <leafValues>
+            7.2100132703781128e-02 -4.1321611404418945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 4.7377590090036392e-03</internalNodes>
+          <leafValues>
+            -9.0100876986980438e-02 3.4303799271583557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 4.3965759687125683e-03</internalNodes>
+          <leafValues>
+            5.4753091186285019e-02 -5.9175938367843628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 1.8952810205519199e-03</internalNodes>
+          <leafValues>
+            4.0120709687471390e-02 -6.4907258749008179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -1.3425230281427503e-03</internalNodes>
+          <leafValues>
+            3.0321699380874634e-01 -1.1009240150451660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 -4.6405740082263947e-02</internalNodes>
+          <leafValues>
+            -4.6026471257209778e-01 7.0307031273841858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 2.5875549763441086e-02</internalNodes>
+          <leafValues>
+            3.8987319916486740e-02 -6.4847522974014282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 1.0986380511894822e-03</internalNodes>
+          <leafValues>
+            -1.6458760201931000e-01 1.8133540451526642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -3.9583959733135998e-04</internalNodes>
+          <leafValues>
+            9.7805656492710114e-02 -2.7554351091384888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 -4.5633990317583084e-02</internalNodes>
+          <leafValues>
+            -5.4276019334793091e-01 5.4855771362781525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -4.7068470157682896e-03</internalNodes>
+          <leafValues>
+            4.0961420536041260e-01 -6.9687090814113617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 2.0004810357932001e-04</internalNodes>
+          <leafValues>
+            1.2908969819545746e-01 -2.1091359853744507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 1.1126570170745254e-03</internalNodes>
+          <leafValues>
+            -2.2213070094585419e-01 1.2458589673042297e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -1.4747029636055231e-03</internalNodes>
+          <leafValues>
+            2.9185178875923157e-01 -9.0756237506866455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 4.3162931688129902e-03</internalNodes>
+          <leafValues>
+            6.1542909592390060e-02 -5.1068651676177979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 2.0302709890529513e-04</internalNodes>
+          <leafValues>
+            -1.5639910101890564e-01 1.6466440260410309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 3.4639390651136637e-04</internalNodes>
+          <leafValues>
+            1.0773540288209915e-01 -2.5532799959182739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 1.5631220303475857e-03</internalNodes>
+          <leafValues>
+            -9.5428019762039185e-02 2.5450360774993896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 5.5476918350905180e-04</internalNodes>
+          <leafValues>
+            7.9774253070354462e-02 -3.0791428685188293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 2.7690480928868055e-03</internalNodes>
+          <leafValues>
+            -9.1900892555713654e-02 3.0198639631271362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 1.1085179867222905e-03</internalNodes>
+          <leafValues>
+            6.2624886631965637e-02 -4.1680490970611572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 3.4288389142602682e-03</internalNodes>
+          <leafValues>
+            -5.7473558932542801e-02 4.7293519973754883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 -2.0233790855854750e-03</internalNodes>
+          <leafValues>
+            -2.4128660559654236e-01 1.0806660354137421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -9.1446418082341552e-04</internalNodes>
+          <leafValues>
+            1.7990960180759430e-01 -1.6031919419765472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 3.8880690932273865e-02</internalNodes>
+          <leafValues>
+            3.9132621139287949e-02 -6.4085322618484497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 1.2836069799959660e-03</internalNodes>
+          <leafValues>
+            5.2912048995494843e-02 -4.3914559483528137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 3.5828219261020422e-03</internalNodes>
+          <leafValues>
+            -9.7462162375450134e-02 3.0772930383682251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 2.3203529417514801e-03</internalNodes>
+          <leafValues>
+            -1.0929799824953079e-01 2.6735728979110718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 1.1978139809798449e-04</internalNodes>
+          <leafValues>
+            1.1623129993677139e-01 -2.3586340248584747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 -2.8259279206395149e-03</internalNodes>
+          <leafValues>
+            -4.1935729980468750e-01 5.7008400559425354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 2.4410230107605457e-03</internalNodes>
+          <leafValues>
+            4.2706880718469620e-02 -5.3362858295440674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 2.6899650692939758e-03</internalNodes>
+          <leafValues>
+            -1.1351829767227173e-01 2.4779020249843597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 -3.1081750057637691e-03</internalNodes>
+          <leafValues>
+            -2.9488921165466309e-01 8.2543209195137024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -6.6210748627781868e-03</internalNodes>
+          <leafValues>
+            2.2958689928054810e-01 -1.1443620175123215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 4.6786409802734852e-03</internalNodes>
+          <leafValues>
+            -1.2875209748744965e-01 2.6777699589729309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -1.2973829871043563e-03</internalNodes>
+          <leafValues>
+            -2.7280429005622864e-01 9.6471726894378662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 2.9523740522563457e-03</internalNodes>
+          <leafValues>
+            -8.7040692567825317e-02 2.9207450151443481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 -1.6173559706658125e-03</internalNodes>
+          <leafValues>
+            -4.0207850933074951e-01 6.5386466681957245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -7.5417757034301758e-02</internalNodes>
+          <leafValues>
+            -8.9723330736160278e-01 2.4602690711617470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 -2.5402200408279896e-03</internalNodes>
+          <leafValues>
+            1.5258650481700897e-01 -1.5025460720062256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 3.7864660844206810e-03</internalNodes>
+          <leafValues>
+            7.6477207243442535e-02 -3.3881941437721252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -1.4005510136485100e-02</internalNodes>
+          <leafValues>
+            4.4426390528678894e-01 -5.9003930538892746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 5.5956508731469512e-04</internalNodes>
+          <leafValues>
+            7.4007123708724976e-02 -3.5604709386825562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 2.5946850655600429e-04</internalNodes>
+          <leafValues>
+            -2.8126189112663269e-01 8.7399207055568695e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 4.4409232214093208e-03</internalNodes>
+          <leafValues>
+            2.8623659163713455e-02 -7.7284187078475952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -2.3343560751527548e-03</internalNodes>
+          <leafValues>
+            3.5460600256919861e-01 -7.1207538247108459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 9.7654951969161630e-04</internalNodes>
+          <leafValues>
+            -1.0138420015573502e-01 2.2545370459556580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 -4.3227209243923426e-04</internalNodes>
+          <leafValues>
+            -2.1095879375934601e-01 1.2273149937391281e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>70</maxWeakCount>
+      <stageThreshold>-1.6056820154190063e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 329 -1.2480209581553936e-02</internalNodes>
+          <leafValues>
+            2.6112109422683716e-01 -4.7001519799232483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 3.5450961440801620e-02</internalNodes>
+          <leafValues>
+            -2.0008459687232971e-01 4.7718611359596252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 2.0369330886751413e-03</internalNodes>
+          <leafValues>
+            -4.7703158855438232e-01 1.5132640302181244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 -4.3946420191787183e-05</internalNodes>
+          <leafValues>
+            1.2288480252027512e-01 -5.1796287298202515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -3.8480788934975863e-03</internalNodes>
+          <leafValues>
+            4.1113680601119995e-01 -1.4595329761505127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 -2.8316550888121128e-03</internalNodes>
+          <leafValues>
+            2.8710970282554626e-01 -1.7629599571228027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 2.5026081129908562e-03</internalNodes>
+          <leafValues>
+            7.9668842256069183e-02 -5.7808011770248413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 3.0812958721071482e-04</internalNodes>
+          <leafValues>
+            8.2838706672191620e-02 -4.2540180683135986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 6.1186961829662323e-04</internalNodes>
+          <leafValues>
+            1.3641810417175293e-01 -3.0591419339179993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -1.4354350241774227e-05</internalNodes>
+          <leafValues>
+            1.4197489619255066e-01 -2.5681999325752258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 1.6148330178111792e-03</internalNodes>
+          <leafValues>
+            -2.6239329576492310e-01 1.3288390636444092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 2.0318101160228252e-03</internalNodes>
+          <leafValues>
+            7.5749568641185760e-02 -4.3141460418701172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 9.5563679933547974e-03</internalNodes>
+          <leafValues>
+            -9.1424480080604553e-02 4.0004569292068481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -7.8439561184495687e-04</internalNodes>
+          <leafValues>
+            -3.6619931459426880e-01 9.1777816414833069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 -3.9661130867898464e-03</internalNodes>
+          <leafValues>
+            2.3698210716247559e-01 -1.4281649887561798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 -2.3194469977170229e-03</internalNodes>
+          <leafValues>
+            -4.2245340347290039e-01 7.8684106469154358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -7.3490202426910400e-02</internalNodes>
+          <leafValues>
+            -6.2218552827835083e-01 4.0496870875358582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 -3.6803178954869509e-03</internalNodes>
+          <leafValues>
+            1.2612029910087585e-01 -2.0990429818630219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -4.1019290685653687e-02</internalNodes>
+          <leafValues>
+            -8.0316942930221558e-01 2.7993949130177498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -4.8213129048235714e-04</internalNodes>
+          <leafValues>
+            1.4825980365276337e-01 -1.7869630455970764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 -1.6598250716924667e-02</internalNodes>
+          <leafValues>
+            4.1442281007766724e-01 -6.4051687717437744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 -1.0631670011207461e-03</internalNodes>
+          <leafValues>
+            -3.3466520905494690e-01 8.2425996661186218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 1.8658409826457500e-03</internalNodes>
+          <leafValues>
+            -1.3119789958000183e-01 2.3183380067348480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -2.5827190838754177e-03</internalNodes>
+          <leafValues>
+            3.8415950536727905e-01 -8.4121666848659515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 1.7159619601443410e-03</internalNodes>
+          <leafValues>
+            7.6971538364887238e-02 -4.1098991036415100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -3.9140181615948677e-03</internalNodes>
+          <leafValues>
+            -6.2508618831634521e-01 3.8418460637331009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 4.2724498780444264e-04</internalNodes>
+          <leafValues>
+            8.6016573011875153e-02 -2.6975229382514954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 3.3992920070886612e-03</internalNodes>
+          <leafValues>
+            -1.0176510363817215e-01 2.7030828595161438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 -3.6457281559705734e-02</internalNodes>
+          <leafValues>
+            -4.9261981248855591e-01 5.5854249745607376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 1.6230379696935415e-03</internalNodes>
+          <leafValues>
+            5.7567078620195389e-02 -4.2053499817848206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 4.6655549667775631e-03</internalNodes>
+          <leafValues>
+            -9.1158397495746613e-02 3.2095280289649963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 3.1331549398601055e-03</internalNodes>
+          <leafValues>
+            -9.6932657063007355e-02 3.4073451161384583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 -1.6835830174386501e-03</internalNodes>
+          <leafValues>
+            -3.6766248941421509e-01 8.2226082682609558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 2.7728650718927383e-02</internalNodes>
+          <leafValues>
+            4.0117498487234116e-02 -6.5198391675949097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 9.5015309751033783e-02</internalNodes>
+          <leafValues>
+            2.3065119981765747e-02 -8.8881981372833252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 7.4755616486072540e-02</internalNodes>
+          <leafValues>
+            -6.3946872949600220e-02 4.7399708628654480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 1.6693340614438057e-02</internalNodes>
+          <leafValues>
+            4.6477258205413818e-02 -7.1152418851852417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 1.2088769581168890e-03</internalNodes>
+          <leafValues>
+            -1.1359269917011261e-01 2.2424149513244629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -6.1751517932862043e-04</internalNodes>
+          <leafValues>
+            -3.1268230080604553e-01 8.5018932819366455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 8.5786692798137665e-03</internalNodes>
+          <leafValues>
+            -1.5559460222721100e-01 1.5640939772129059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 6.1184767400845885e-04</internalNodes>
+          <leafValues>
+            9.4403937458992004e-02 -2.6520138978958130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 -3.4570440184324980e-03</internalNodes>
+          <leafValues>
+            1.5146060287952423e-01 -1.6220529377460480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 1.3953070156276226e-03</internalNodes>
+          <leafValues>
+            -9.9996216595172882e-02 2.4998310208320618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 3.5910680890083313e-03</internalNodes>
+          <leafValues>
+            8.1011682748794556e-02 -3.0081549286842346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 5.4192831739783287e-03</internalNodes>
+          <leafValues>
+            6.7650042474269867e-02 -3.2355660200119019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 -1.1379310162737966e-03</internalNodes>
+          <leafValues>
+            1.8887449800968170e-01 -1.2729729712009430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 9.1047259047627449e-03</internalNodes>
+          <leafValues>
+            1.0160540044307709e-01 -2.2280150651931763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 6.5050171688199043e-03</internalNodes>
+          <leafValues>
+            -7.2986416518688202e-02 3.5770270228385925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -1.4676549653813709e-05</internalNodes>
+          <leafValues>
+            1.4693109691143036e-01 -1.7403540015220642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 -9.4403158873319626e-03</internalNodes>
+          <leafValues>
+            -2.6536750793457031e-01 9.6619546413421631e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 -4.2933300137519836e-03</internalNodes>
+          <leafValues>
+            2.5656831264495850e-01 -1.0550209879875183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 4.3133171275258064e-03</internalNodes>
+          <leafValues>
+            6.5936572849750519e-02 -4.5719939470291138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 5.8854468166828156e-02</internalNodes>
+          <leafValues>
+            6.7918263375759125e-02 -3.3078071475028992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -2.8407620266079903e-03</internalNodes>
+          <leafValues>
+            2.3953500390052795e-01 -9.2092156410217285e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 9.6359942108392715e-04</internalNodes>
+          <leafValues>
+            -1.0982380062341690e-01 2.6462998986244202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 -1.4724590073456056e-05</internalNodes>
+          <leafValues>
+            1.1111160367727280e-01 -2.2704580426216125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 -8.0675468780100346e-04</internalNodes>
+          <leafValues>
+            -3.6335140466690063e-01 7.8122653067111969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 7.3296198388561606e-04</internalNodes>
+          <leafValues>
+            -1.5605129301548004e-01 1.5184900164604187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 6.3753738068044186e-03</internalNodes>
+          <leafValues>
+            -7.1957953274250031e-02 2.9723879694938660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 4.6390579082071781e-03</internalNodes>
+          <leafValues>
+            3.5969600081443787e-02 -6.1132347583770752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -7.1079272311180830e-04</internalNodes>
+          <leafValues>
+            -2.8806841373443604e-01 6.9314628839492798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 2.9162289574742317e-03</internalNodes>
+          <leafValues>
+            -7.5968459248542786e-02 3.2681688666343689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -1.7853140830993652e-02</internalNodes>
+          <leafValues>
+            4.4206309318542480e-01 -4.8174031078815460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 8.3874985575675964e-03</internalNodes>
+          <leafValues>
+            4.8913899809122086e-02 -5.4415327310562134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 2.9458320568664931e-05</internalNodes>
+          <leafValues>
+            -2.1131239831447601e-01 1.0629370063543320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -9.8192706704139709e-02</internalNodes>
+          <leafValues>
+            3.5318240523338318e-01 -6.9296866655349731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 4.6140368795022368e-04</internalNodes>
+          <leafValues>
+            9.6270777285099030e-02 -2.5811928510665894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -2.4016610404942185e-04</internalNodes>
+          <leafValues>
+            -2.2976429760456085e-01 9.9984891712665558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 3.7882480770349503e-02</internalNodes>
+          <leafValues>
+            -1.0365439951419830e-01 2.3164770007133484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 3.2621581340208650e-04</internalNodes>
+          <leafValues>
+            9.7933940589427948e-02 -2.3689700663089752e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>85</maxWeakCount>
+      <stageThreshold>-1.5173089504241943e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 399 -3.6744121462106705e-02</internalNodes>
+          <leafValues>
+            3.4079340100288391e-01 -3.1779891252517700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 2.1955010015517473e-03</internalNodes>
+          <leafValues>
+            -2.8729590773582458e-01 2.5869798660278320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 8.3034839481115341e-03</internalNodes>
+          <leafValues>
+            -2.1800449490547180e-01 2.6759269833564758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 2.6289420202374458e-03</internalNodes>
+          <leafValues>
+            -3.6006081104278564e-01 1.4639839529991150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 1.9458869937807322e-03</internalNodes>
+          <leafValues>
+            1.3677720725536346e-01 -4.2058759927749634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -2.1704390645027161e-02</internalNodes>
+          <leafValues>
+            4.8903319239616394e-01 -9.8091572523117065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 4.2956420220434666e-03</internalNodes>
+          <leafValues>
+            -2.7825561165809631e-01 1.5712629258632660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 4.9894629046320915e-04</internalNodes>
+          <leafValues>
+            1.1003810167312622e-01 -3.3779421448707581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 2.4652799591422081e-02</internalNodes>
+          <leafValues>
+            4.5820660889148712e-02 -5.4710537195205688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 -2.3075740784406662e-02</internalNodes>
+          <leafValues>
+            -4.9801421165466309e-01 6.7044779658317566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 1.1991280131042004e-02</internalNodes>
+          <leafValues>
+            -7.0877023041248322e-02 4.8294249176979065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 1.5430679544806480e-02</internalNodes>
+          <leafValues>
+            -6.5949738025665283e-02 4.5236849784851074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -4.5555769465863705e-03</internalNodes>
+          <leafValues>
+            -4.4665691256523132e-01 6.7877657711505890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 -4.4582979753613472e-03</internalNodes>
+          <leafValues>
+            3.3656919002532959e-01 -9.4792358577251434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 1.3494009908754379e-04</internalNodes>
+          <leafValues>
+            -3.0288851261138916e-01 1.0293830186128616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -4.2500188574194908e-03</internalNodes>
+          <leafValues>
+            4.2550128698348999e-01 -7.2956383228302002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 -1.4293759595602751e-03</internalNodes>
+          <leafValues>
+            -3.0116760730743408e-01 9.0039253234863281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 -6.3978550024330616e-03</internalNodes>
+          <leafValues>
+            4.1943550109863281e-01 -7.9320870339870453e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 2.6083870325237513e-03</internalNodes>
+          <leafValues>
+            8.3598926663398743e-02 -4.1897168755531311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 8.6870808154344559e-03</internalNodes>
+          <leafValues>
+            -6.3015699386596680e-02 5.2644741535186768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 -1.0380990570411086e-03</internalNodes>
+          <leafValues>
+            -3.6220151185989380e-01 8.0301038920879364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 4.4070050120353699e-01</internalNodes>
+          <leafValues>
+            3.4913059324026108e-02 -7.2764492034912109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 3.3689520787447691e-03</internalNodes>
+          <leafValues>
+            5.7332780212163925e-02 -4.8633271455764771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 1.7443710239604115e-03</internalNodes>
+          <leafValues>
+            -1.0994660109281540e-01 2.7023580670356750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 5.3788698278367519e-04</internalNodes>
+          <leafValues>
+            -2.7439421415328979e-01 1.0063380002975464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 1.0072899749502540e-03</internalNodes>
+          <leafValues>
+            1.0756769776344299e-01 -2.3221600055694580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 -8.2518812268972397e-03</internalNodes>
+          <leafValues>
+            -6.5216302871704102e-01 3.5704229027032852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 3.5490558948367834e-03</internalNodes>
+          <leafValues>
+            -8.4254868328571320e-02 3.1767430901527405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -1.1033359915018082e-02</internalNodes>
+          <leafValues>
+            4.1271620988845825e-01 -6.2587052583694458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 3.2278439030051231e-03</internalNodes>
+          <leafValues>
+            7.1266986429691315e-02 -4.1172251105308533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 1.7540389299392700e-01</internalNodes>
+          <leafValues>
+            3.4958980977535248e-02 -6.3775068521499634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -4.8067080206237733e-04</internalNodes>
+          <leafValues>
+            -2.4503110349178314e-01 9.8930649459362030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 -1.8284550169482827e-03</internalNodes>
+          <leafValues>
+            1.3486519455909729e-01 -1.9799900054931641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 1.7096720403060317e-03</internalNodes>
+          <leafValues>
+            -1.0525950044393539e-01 2.1005709469318390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 3.9468301110900939e-04</internalNodes>
+          <leafValues>
+            8.0952547490596771e-02 -2.7405399084091187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 2.3097719531506300e-03</internalNodes>
+          <leafValues>
+            1.2338220328092575e-01 -1.9958800077438354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 3.1529190018773079e-03</internalNodes>
+          <leafValues>
+            -1.0612549632787704e-01 2.2089600563049316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -1.9097010372206569e-03</internalNodes>
+          <leafValues>
+            -2.5094708800315857e-01 8.7022580206394196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -1.2370609911158681e-03</internalNodes>
+          <leafValues>
+            3.0760520696640015e-01 -7.5937293469905853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 3.7081091431900859e-04</internalNodes>
+          <leafValues>
+            -1.6065080463886261e-01 1.3480199873447418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 3.4268848598003387e-02</internalNodes>
+          <leafValues>
+            3.5260949283838272e-02 -6.3547158241271973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 4.6664681285619736e-03</internalNodes>
+          <leafValues>
+            -5.2494861185550690e-02 4.3242320418357849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 1.0423569940030575e-02</internalNodes>
+          <leafValues>
+            5.1612429320812225e-02 -5.0745230913162231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 1.1215180158615112e-02</internalNodes>
+          <leafValues>
+            -3.8614250719547272e-02 5.7645928859710693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 -7.3029109444178175e-06</internalNodes>
+          <leafValues>
+            1.2052319943904877e-01 -1.7274369299411774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -4.9072802066802979e-03</internalNodes>
+          <leafValues>
+            -3.4818550944328308e-01 5.9116441756486893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 1.9488829420879483e-03</internalNodes>
+          <leafValues>
+            -8.8861227035522461e-02 2.4020899832248688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 1.3313010276760906e-04</internalNodes>
+          <leafValues>
+            -1.4657719433307648e-01 1.9929920136928558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -1.4298240421339869e-03</internalNodes>
+          <leafValues>
+            -3.9005228877067566e-01 5.9909418225288391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -6.4831459894776344e-03</internalNodes>
+          <leafValues>
+            1.8141369521617889e-01 -1.1655449867248535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 7.2958500823006034e-06</internalNodes>
+          <leafValues>
+            -1.8219240009784698e-01 1.1812780052423477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 4.1690681246109307e-04</internalNodes>
+          <leafValues>
+            1.0591679811477661e-01 -2.0353710651397705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 5.1982058212161064e-03</internalNodes>
+          <leafValues>
+            -3.5962641239166260e-02 6.0264211893081665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 -4.0649957954883575e-03</internalNodes>
+          <leafValues>
+            2.0696419477462769e-01 -9.8599843680858612e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -4.7734950203448534e-04</internalNodes>
+          <leafValues>
+            -2.4629549682140350e-01 9.3174271285533905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 5.2415160462260246e-03</internalNodes>
+          <leafValues>
+            3.6528520286083221e-02 -5.4934787750244141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 3.7873629480600357e-03</internalNodes>
+          <leafValues>
+            -5.7597089558839798e-02 3.8733980059623718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -1.4434250260819681e-05</internalNodes>
+          <leafValues>
+            1.1292859911918640e-01 -1.7447079718112946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 4.2011599987745285e-02</internalNodes>
+          <leafValues>
+            -4.6556860208511353e-02 4.5454800128936768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 7.9663433134555817e-03</internalNodes>
+          <leafValues>
+            4.2258739471435547e-02 -5.3702521324157715e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 5.3092982852831483e-04</internalNodes>
+          <leafValues>
+            -9.7918719053268433e-02 2.1795919537544250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 5.2906107157468796e-04</internalNodes>
+          <leafValues>
+            7.7961057424545288e-02 -2.8867539763450623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 -1.9556249678134918e-01</internalNodes>
+          <leafValues>
+            -7.6475739479064941e-01 2.7276000007987022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 -1.1559950187802315e-02</internalNodes>
+          <leafValues>
+            3.3526000380516052e-01 -6.3614986836910248e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -1.4005659520626068e-01</internalNodes>
+          <leafValues>
+            -7.6232051849365234e-01 2.8024470433592796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 4.4643289584200829e-05</internalNodes>
+          <leafValues>
+            -2.0320929586887360e-01 9.9391698837280273e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 3.9411801844835281e-03</internalNodes>
+          <leafValues>
+            4.9936279654502869e-02 -3.7584540247917175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -4.5965691097080708e-03</internalNodes>
+          <leafValues>
+            3.3031210303306580e-01 -6.3809931278228760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -6.9790292764082551e-04</internalNodes>
+          <leafValues>
+            1.6093710064888000e-01 -1.3192920386791229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 6.1886821640655398e-04</internalNodes>
+          <leafValues>
+            7.4621193110942841e-02 -3.3021458983421326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -3.2755140215158463e-02</internalNodes>
+          <leafValues>
+            -4.0643560886383057e-01 4.9308661371469498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 3.3697509206831455e-03</internalNodes>
+          <leafValues>
+            4.0627099573612213e-02 -4.9757328629493713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 3.7391821388155222e-04</internalNodes>
+          <leafValues>
+            -1.4931799471378326e-01 1.6517969965934753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 -4.0217190980911255e-03</internalNodes>
+          <leafValues>
+            2.9531970620155334e-01 -7.6642103493213654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -7.2943832492455840e-04</internalNodes>
+          <leafValues>
+            -2.7355810999870300e-01 7.9243987798690796e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -5.7726111263036728e-03</internalNodes>
+          <leafValues>
+            3.4741240739822388e-01 -7.6087206602096558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -2.1122458856552839e-03</internalNodes>
+          <leafValues>
+            1.7290510237216949e-01 -1.2444470077753067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 4.4956691563129425e-03</internalNodes>
+          <leafValues>
+            3.0218729749321938e-02 -7.4003338813781738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -1.1419389629736543e-03</internalNodes>
+          <leafValues>
+            -2.3494489490985870e-01 7.6911546289920807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 2.7658098842948675e-03</internalNodes>
+          <leafValues>
+            -9.1666661202907562e-02 2.1009710431098938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -7.2281848406419158e-04</internalNodes>
+          <leafValues>
+            -2.5587469339370728e-01 7.5378142297267914e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 1.8604539800435305e-03</internalNodes>
+          <leafValues>
+            -9.4511069357395172e-02 1.9726920127868652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 -2.8568008565343916e-04</internalNodes>
+          <leafValues>
+            -2.1073310077190399e-01 9.7290039062500000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -3.8796100765466690e-02</internalNodes>
+          <leafValues>
+            -7.8724592924118042e-01 2.4410309270024300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -1.2119869701564312e-02</internalNodes>
+          <leafValues>
+            3.6466810107231140e-01 -5.7907499372959137e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>93</maxWeakCount>
+      <stageThreshold>-1.6563049554824829e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 484 5.6008538231253624e-03</internalNodes>
+          <leafValues>
+            -3.8491588830947876e-01 3.3817461133003235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 -3.7205789703875780e-03</internalNodes>
+          <leafValues>
+            2.4614119529724121e-01 -3.0673781037330627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -2.5333440862596035e-03</internalNodes>
+          <leafValues>
+            1.2531200051307678e-01 -4.2720189690589905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -7.3425087612122297e-04</internalNodes>
+          <leafValues>
+            1.3314330577850342e-01 -3.5111570358276367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -1.4792960428167135e-04</internalNodes>
+          <leafValues>
+            1.2545309960842133e-01 -3.8591191172599792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 -4.8976339399814606e-02</internalNodes>
+          <leafValues>
+            3.6456748843193054e-01 -1.1494780331850052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 1.0917349718511105e-03</internalNodes>
+          <leafValues>
+            7.9005338251590729e-02 -4.1399830579757690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 5.4457997903227806e-03</internalNodes>
+          <leafValues>
+            -1.1921840161085129e-01 3.3085560798645020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 1.5979419695213437e-03</internalNodes>
+          <leafValues>
+            4.1181199252605438e-02 -5.5028229951858521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 -1.3023250503465533e-03</internalNodes>
+          <leafValues>
+            8.2839436829090118e-02 -3.5719320178031921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 4.8810569569468498e-04</internalNodes>
+          <leafValues>
+            -2.0928630232810974e-01 1.4972810447216034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 2.1033850498497486e-03</internalNodes>
+          <leafValues>
+            5.1839418709278107e-02 -6.1099958419799805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 1.1984360404312611e-02</internalNodes>
+          <leafValues>
+            4.1022349148988724e-02 -5.8985722064971924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 -1.1898590251803398e-02</internalNodes>
+          <leafValues>
+            4.5844998955726624e-01 -6.4714707434177399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 5.3713661618530750e-03</internalNodes>
+          <leafValues>
+            -6.1560470610857010e-02 4.1204369068145752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 4.3421140871942043e-03</internalNodes>
+          <leafValues>
+            6.0501661151647568e-02 -4.8703390359878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 6.6142519935965538e-03</internalNodes>
+          <leafValues>
+            4.6873189508914948e-02 -5.0346171855926514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 1.2339729582890868e-03</internalNodes>
+          <leafValues>
+            -8.1538438796997070e-02 3.0428299307823181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -1.2975660152733326e-02</internalNodes>
+          <leafValues>
+            -4.7834330797195435e-01 4.8681490123271942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -1.7806360265240073e-03</internalNodes>
+          <leafValues>
+            3.7698730826377869e-01 -6.8126037716865540e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 7.8339744359254837e-03</internalNodes>
+          <leafValues>
+            5.4501280188560486e-02 -4.6738588809967041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 -6.0113701038062572e-03</internalNodes>
+          <leafValues>
+            5.4870051145553589e-01 -4.4434640556573868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 -2.0694560371339321e-03</internalNodes>
+          <leafValues>
+            -3.7755548954010010e-01 6.4383402466773987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 4.7843591310083866e-03</internalNodes>
+          <leafValues>
+            4.6252150088548660e-02 -5.2633982896804810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -6.2808818183839321e-03</internalNodes>
+          <leafValues>
+            3.9451861381530762e-01 -6.9051302969455719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 1.6099009662866592e-03</internalNodes>
+          <leafValues>
+            -1.0316190123558044e-01 2.7321669459342957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -8.2392559852451086e-04</internalNodes>
+          <leafValues>
+            -2.8039410710334778e-01 8.4601573646068573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 -1.0123319923877716e-02</internalNodes>
+          <leafValues>
+            3.3635950088500977e-01 -6.1322949826717377e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 1.0525720193982124e-02</internalNodes>
+          <leafValues>
+            4.6165600419044495e-02 -5.1672130823135376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 -2.6774499565362930e-02</internalNodes>
+          <leafValues>
+            -5.0325971841812134e-01 3.9857819676399231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 4.0248301811516285e-03</internalNodes>
+          <leafValues>
+            -6.1501380056142807e-02 3.6659809947013855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -4.6271650353446603e-04</internalNodes>
+          <leafValues>
+            -2.6439830660820007e-01 8.1311263144016266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 -5.1834900659741834e-05</internalNodes>
+          <leafValues>
+            1.1154399812221527e-01 -2.0269370079040527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 4.8874281346797943e-03</internalNodes>
+          <leafValues>
+            -6.9644987583160400e-02 3.3612030744552612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 1.2638230621814728e-01</internalNodes>
+          <leafValues>
+            3.6813639104366302e-02 -6.5849918127059937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 -8.0248164013028145e-03</internalNodes>
+          <leafValues>
+            4.6601921319961548e-01 -4.8885859549045563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 -1.1518909595906734e-03</internalNodes>
+          <leafValues>
+            -4.0466758608818054e-01 5.8572851121425629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 9.8190037533640862e-04</internalNodes>
+          <leafValues>
+            -1.3197229802608490e-01 1.7744350433349609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 -1.9447980448603630e-02</internalNodes>
+          <leafValues>
+            -6.8489527702331543e-01 3.3834591507911682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 -7.2442039709130768e-06</internalNodes>
+          <leafValues>
+            1.1553110182285309e-01 -1.8726129829883575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -1.7039060592651367e-02</internalNodes>
+          <leafValues>
+            -3.5105291008949280e-01 6.7737713456153870e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 1.1186580173671246e-02</internalNodes>
+          <leafValues>
+            -9.3420043587684631e-02 2.1077099442481995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 7.6585268834605813e-04</internalNodes>
+          <leafValues>
+            6.5965756773948669e-02 -3.2127881050109863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 1.4231950626708567e-04</internalNodes>
+          <leafValues>
+            -1.5460130572319031e-01 1.3757640123367310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -5.5553209967911243e-03</internalNodes>
+          <leafValues>
+            3.1319350004196167e-01 -6.4753532409667969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 1.2308239820413291e-04</internalNodes>
+          <leafValues>
+            9.7666621208190918e-02 -2.2251069545745850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -1.6092039877548814e-03</internalNodes>
+          <leafValues>
+            -3.6215591430664062e-01 6.4452558755874634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 -1.5626100357621908e-03</internalNodes>
+          <leafValues>
+            2.2588780522346497e-01 -9.5551103353500366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -5.0116342026740313e-04</internalNodes>
+          <leafValues>
+            -2.2289219498634338e-01 8.9174531400203705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 3.7322030402719975e-04</internalNodes>
+          <leafValues>
+            9.1969013214111328e-02 -2.1129919588565826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -2.2882660850882530e-03</internalNodes>
+          <leafValues>
+            3.8989049196243286e-01 -5.3455859422683716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -4.6884030103683472e-02</internalNodes>
+          <leafValues>
+            -6.2357091903686523e-01 3.2194521278142929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 1.8901260336861014e-03</internalNodes>
+          <leafValues>
+            -7.2615146636962891e-02 2.7420088648796082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 1.5805330127477646e-02</internalNodes>
+          <leafValues>
+            2.8601830825209618e-02 -6.9608169794082642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 3.2644178718328476e-02</internalNodes>
+          <leafValues>
+            -4.0772251784801483e-02 5.0873398780822754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 6.5482832724228501e-04</internalNodes>
+          <leafValues>
+            8.5724912583827972e-02 -2.7580630779266357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 -1.1142930015921593e-02</internalNodes>
+          <leafValues>
+            8.7326012551784515e-02 -2.0914819836616516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -5.8072229148820043e-04</internalNodes>
+          <leafValues>
+            -2.9471421241760254e-01 6.6337890923023224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -7.4414577102288604e-04</internalNodes>
+          <leafValues>
+            1.8017959594726562e-01 -1.0654629766941071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 7.6460661366581917e-03</internalNodes>
+          <leafValues>
+            -6.3608147203922272e-02 3.1582340598106384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 3.2617211341857910e-02</internalNodes>
+          <leafValues>
+            3.2606441527605057e-02 -6.0541188716888428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -3.4527231007814407e-02</internalNodes>
+          <leafValues>
+            -5.9770858287811279e-01 2.7888769283890724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 3.2211719080805779e-03</internalNodes>
+          <leafValues>
+            -4.9183920025825500e-02 4.0305620431900024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -4.1549839079380035e-04</internalNodes>
+          <leafValues>
+            1.3533140718936920e-01 -1.5845330059528351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 2.5140501093119383e-03</internalNodes>
+          <leafValues>
+            6.3218571245670319e-02 -3.0768528580665588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 -2.0818209648132324e-01</internalNodes>
+          <leafValues>
+            -7.5750261545181274e-01 2.2695960476994514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 -2.6067279279232025e-02</internalNodes>
+          <leafValues>
+            -7.4959957599639893e-01 1.9375480711460114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 -5.8264029212296009e-04</internalNodes>
+          <leafValues>
+            9.4658233225345612e-02 -1.9919820129871368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 -3.2769259996712208e-03</internalNodes>
+          <leafValues>
+            1.6214330494403839e-01 -1.2322030216455460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 1.3998829526826739e-03</internalNodes>
+          <leafValues>
+            -1.0849200189113617e-01 2.3151659965515137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -1.2055980041623116e-02</internalNodes>
+          <leafValues>
+            -2.4002850055694580e-01 9.3272961676120758e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 3.1805539038032293e-03</internalNodes>
+          <leafValues>
+            7.6264120638370514e-02 -2.5435069203376770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -1.0693799704313278e-03</internalNodes>
+          <leafValues>
+            2.2258889675140381e-01 -9.0730242431163788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 -2.9467688873410225e-03</internalNodes>
+          <leafValues>
+            -3.4242698550224304e-01 6.0581039637327194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 8.8108901400119066e-04</internalNodes>
+          <leafValues>
+            -7.8326202929019928e-02 2.6911988854408264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 2.8118939371779561e-04</internalNodes>
+          <leafValues>
+            9.8370827734470367e-02 -2.1947909891605377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 -1.8574869260191917e-02</internalNodes>
+          <leafValues>
+            2.6729720830917358e-01 -7.1240752935409546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -2.4810349568724632e-02</internalNodes>
+          <leafValues>
+            -6.8322032690048218e-01 2.9446309432387352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 2.8904930222779512e-03</internalNodes>
+          <leafValues>
+            7.6161012053489685e-02 -2.4025200307369232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 3.5410430282354355e-03</internalNodes>
+          <leafValues>
+            -1.0742089897394180e-01 1.8509419262409210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 -8.4244477329775691e-04</internalNodes>
+          <leafValues>
+            1.8727229535579681e-01 -1.1407770216464996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 -2.5338360574096441e-03</internalNodes>
+          <leafValues>
+            -3.5870191454887390e-01 5.1251661032438278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 1.9654980860650539e-03</internalNodes>
+          <leafValues>
+            -1.4064720273017883e-01 1.3041019439697266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 3.1574100255966187e-01</internalNodes>
+          <leafValues>
+            2.9550969600677490e-02 -6.3157892227172852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -2.9846638790331781e-04</internalNodes>
+          <leafValues>
+            -2.2911080718040466e-01 7.8875422477722168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 -1.1545480042695999e-01</internalNodes>
+          <leafValues>
+            -8.1895941495895386e-01 2.2261450067162514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -3.5817299038171768e-02</internalNodes>
+          <leafValues>
+            -3.0612939596176147e-01 6.0644190758466721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 1.7071690410375595e-02</internalNodes>
+          <leafValues>
+            -6.1134841293096542e-02 3.2152679562568665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 -2.1385080181062222e-03</internalNodes>
+          <leafValues>
+            -5.4798161983489990e-01 3.8667369633913040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 6.5424457192420959e-02</internalNodes>
+          <leafValues>
+            1.7884260043501854e-02 -8.5628831386566162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -1.3419929891824722e-02</internalNodes>
+          <leafValues>
+            3.0995100736618042e-01 -6.7559666931629181e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 1.8939709290862083e-02</internalNodes>
+          <leafValues>
+            2.8729729354381561e-02 -7.5338190793991089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 -2.9120460152626038e-02</internalNodes>
+          <leafValues>
+            -7.3594617843627930e-01 2.0359549671411514e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>79</maxWeakCount>
+      <stageThreshold>-1.5920439958572388e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 577 -1.3419030234217644e-02</internalNodes>
+          <leafValues>
+            3.0538010597229004e-01 -4.1782331466674805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 1.7404999816790223e-03</internalNodes>
+          <leafValues>
+            -2.7101579308509827e-01 3.5409560799598694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 7.7174860052764416e-03</internalNodes>
+          <leafValues>
+            -3.1271371245384216e-01 2.1189980208873749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 -1.4514879694615956e-05</internalNodes>
+          <leafValues>
+            1.6157090663909912e-01 -3.3522731065750122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 -1.4871519852022175e-05</internalNodes>
+          <leafValues>
+            1.4571620523929596e-01 -2.9369521141052246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 582 1.5004149463493377e-04</internalNodes>
+          <leafValues>
+            -4.0149879455566406e-01 1.0407949984073639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 1.8634879961609840e-03</internalNodes>
+          <leafValues>
+            4.9062840640544891e-02 -6.5208268165588379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -2.9590800404548645e-03</internalNodes>
+          <leafValues>
+            2.8804430365562439e-01 -1.3293409347534180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 3.3067780896089971e-04</internalNodes>
+          <leafValues>
+            3.9615370333194733e-02 -4.1540861129760742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 -1.6816710121929646e-03</internalNodes>
+          <leafValues>
+            1.3032579421997070e-01 -2.3237510025501251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 3.4896740689873695e-03</internalNodes>
+          <leafValues>
+            6.8852916359901428e-02 -4.7176009416580200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 1.6204500570893288e-03</internalNodes>
+          <leafValues>
+            -1.0996960103511810e-01 3.4887188673019409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 1.9125849939882755e-04</internalNodes>
+          <leafValues>
+            -2.0317320525646210e-01 1.4775620400905609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 2.2485259920358658e-02</internalNodes>
+          <leafValues>
+            5.1929730921983719e-02 -5.4815691709518433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 1.0035949759185314e-02</internalNodes>
+          <leafValues>
+            -1.0943319648504257e-01 2.6000571250915527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 4.0091630071401596e-02</internalNodes>
+          <leafValues>
+            3.8657050579786301e-02 -7.4724602699279785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 1.5319019556045532e-02</internalNodes>
+          <leafValues>
+            2.8579369187355042e-02 -7.7717798948287964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 9.0913427993655205e-04</internalNodes>
+          <leafValues>
+            -1.5049549937248230e-01 1.7363379895687103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 -6.0226190835237503e-03</internalNodes>
+          <leafValues>
+            -4.7704491019248962e-01 5.8185670524835587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 7.8066787682473660e-04</internalNodes>
+          <leafValues>
+            -1.6349339485168457e-01 1.6236920654773712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 -1.1492020450532436e-02</internalNodes>
+          <leafValues>
+            -5.6185477972030640e-01 4.6009611338376999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 8.9691327884793282e-03</internalNodes>
+          <leafValues>
+            6.6570483148097992e-02 -3.3824840188026428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 7.2241941234096885e-04</internalNodes>
+          <leafValues>
+            -1.2882669270038605e-01 1.9002969563007355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 1.4879239643050823e-05</internalNodes>
+          <leafValues>
+            -2.1765929460525513e-01 1.3151009380817413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 8.7159732356667519e-03</internalNodes>
+          <leafValues>
+            4.8188239336013794e-02 -5.2367717027664185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 -1.3809900265187025e-03</internalNodes>
+          <leafValues>
+            -3.1734630465507507e-01 6.7012362182140350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 1.4004110358655453e-02</internalNodes>
+          <leafValues>
+            -7.2155177593231201e-02 3.4900391101837158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -1.2883460149168968e-02</internalNodes>
+          <leafValues>
+            -5.9674298763275146e-01 3.9219990372657776e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 9.9220760166645050e-03</internalNodes>
+          <leafValues>
+            -7.3617048561573029e-02 3.5491651296615601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -1.0360360145568848e-02</internalNodes>
+          <leafValues>
+            -4.9655780196189880e-01 5.4516721516847610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 5.9103948296979070e-04</internalNodes>
+          <leafValues>
+            -9.1649092733860016e-02 2.3738409578800201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 1.4986419955675956e-05</internalNodes>
+          <leafValues>
+            -1.5624360740184784e-01 1.4216689765453339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 6.2526292167603970e-03</internalNodes>
+          <leafValues>
+            4.6570941805839539e-02 -4.3861261010169983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 9.0722978115081787e-02</internalNodes>
+          <leafValues>
+            2.3544119670987129e-02 -7.5557678937911987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 1.2880839640274644e-03</internalNodes>
+          <leafValues>
+            -1.0999819636344910e-01 1.9954189658164978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -5.3202832350507379e-04</internalNodes>
+          <leafValues>
+            -2.3681020736694336e-01 9.4349831342697144e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 1.4669039519503713e-03</internalNodes>
+          <leafValues>
+            -6.0417938977479935e-02 3.5437929630279541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 2.5929270312190056e-02</internalNodes>
+          <leafValues>
+            3.0205380171537399e-02 -7.1175122261047363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 -7.2257839143276215e-02</internalNodes>
+          <leafValues>
+            -7.6830059289932251e-01 2.2078540176153183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -2.5999830104410648e-03</internalNodes>
+          <leafValues>
+            2.2878250479698181e-01 -9.2575646936893463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 4.2036110162734985e-01</internalNodes>
+          <leafValues>
+            3.4129150211811066e-02 -6.3944667577743530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -2.1722039673477411e-03</internalNodes>
+          <leafValues>
+            -2.0458799600601196e-01 9.6727348864078522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 -1.8573250621557236e-02</internalNodes>
+          <leafValues>
+            -7.2321742773056030e-01 2.6587400585412979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 2.1321140229701996e-03</internalNodes>
+          <leafValues>
+            -7.9263173043727875e-02 2.9004418849945068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 1.4585970347980037e-05</internalNodes>
+          <leafValues>
+            -1.5812200307846069e-01 1.2857919931411743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 -2.5919941067695618e-01</internalNodes>
+          <leafValues>
+            -8.3206391334533691e-01 2.1327629685401917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -1.2713880278170109e-02</internalNodes>
+          <leafValues>
+            -4.8670661449432373e-01 3.5282909870147705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 2.1182969212532043e-03</internalNodes>
+          <leafValues>
+            -4.8141859471797943e-02 4.3498820066452026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 4.9225408583879471e-03</internalNodes>
+          <leafValues>
+            5.9389010071754456e-02 -3.5719910264015198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 7.1720690466463566e-03</internalNodes>
+          <leafValues>
+            -7.2721220552921295e-02 3.1716778874397278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 1.5319329686462879e-03</internalNodes>
+          <leafValues>
+            7.6105281710624695e-02 -2.9826408624649048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 -2.6141680777072906e-02</internalNodes>
+          <leafValues>
+            -4.8129829764366150e-01 4.1991200298070908e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 -7.1861818469187710e-06</internalNodes>
+          <leafValues>
+            1.0385909676551819e-01 -2.5540891289710999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 -5.8513309340924025e-04</internalNodes>
+          <leafValues>
+            2.1552430093288422e-01 -1.0446780174970627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 7.3564669582992792e-04</internalNodes>
+          <leafValues>
+            8.2850307226181030e-02 -2.3229689896106720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -4.4216000242158771e-04</internalNodes>
+          <leafValues>
+            1.9849689304828644e-01 -1.1084359884262085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 6.6545000299811363e-03</internalNodes>
+          <leafValues>
+            2.9844839125871658e-02 -6.3819402456283569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 -1.4856060261081439e-05</internalNodes>
+          <leafValues>
+            1.0647810250520706e-01 -1.6304740309715271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 4.4933347962796688e-03</internalNodes>
+          <leafValues>
+            -5.8312181383371353e-02 3.2200211286544800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 3.8110970053821802e-03</internalNodes>
+          <leafValues>
+            7.1237437427043915e-02 -2.7149480581283569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -3.8309019058942795e-02</internalNodes>
+          <leafValues>
+            -6.2387478351593018e-01 2.9790399596095085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 -2.5534629821777344e-03</internalNodes>
+          <leafValues>
+            2.0947620272636414e-01 -9.3472570180892944e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -2.9908109354437329e-05</internalNodes>
+          <leafValues>
+            1.4771899580955505e-01 -1.2858720123767853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 2.0549520850181580e-03</internalNodes>
+          <leafValues>
+            -9.3603983521461487e-02 2.1911169588565826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 3.3064800663851202e-04</internalNodes>
+          <leafValues>
+            -1.4430660009384155e-01 1.6905060410499573e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 4.0969369001686573e-04</internalNodes>
+          <leafValues>
+            8.9844956994056702e-02 -2.1793210506439209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -5.1680381875485182e-04</internalNodes>
+          <leafValues>
+            -2.7330860495567322e-01 7.2490707039833069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -1.2285299599170685e-02</internalNodes>
+          <leafValues>
+            -5.7899951934814453e-01 2.8828129172325134e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 1.4923219569027424e-03</internalNodes>
+          <leafValues>
+            -8.9748427271842957e-02 2.1315790712833405e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 3.7809570785611868e-03</internalNodes>
+          <leafValues>
+            5.6869130581617355e-02 -3.2580479979515076e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -1.3630799949169159e-01</internalNodes>
+          <leafValues>
+            -5.1958292722702026e-01 3.4014869481325150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 2.1192250773310661e-02</internalNodes>
+          <leafValues>
+            -5.9815749526023865e-02 4.3134000897407532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -2.2501780185848475e-03</internalNodes>
+          <leafValues>
+            -3.2725110650062561e-01 6.9494038820266724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 -1.3309439644217491e-02</internalNodes>
+          <leafValues>
+            5.5684721469879150e-01 -3.8055110722780228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 -4.8674400895833969e-02</internalNodes>
+          <leafValues>
+            3.7503889203071594e-01 -4.8045299947261810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -1.4651560377387796e-05</internalNodes>
+          <leafValues>
+            9.3043543398380280e-02 -2.2984559834003448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -7.7605661936104298e-03</internalNodes>
+          <leafValues>
+            3.8858211040496826e-01 -5.4669309407472610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 2.4429330602288246e-02</internalNodes>
+          <leafValues>
+            4.5898649841547012e-02 -5.1061111688613892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -2.1317049686331302e-04</internalNodes>
+          <leafValues>
+            -2.0513610541820526e-01 1.0507310181856155e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>105</maxWeakCount>
+      <stageThreshold>-1.6632529497146606e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 656 -5.7014292106032372e-03</internalNodes>
+          <leafValues>
+            2.7576211094856262e-01 -3.3123719692230225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 657 -4.4359369203448296e-03</internalNodes>
+          <leafValues>
+            1.5587480366230011e-01 -5.0288617610931396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -5.0388257950544357e-03</internalNodes>
+          <leafValues>
+            1.6109010577201843e-01 -3.5196068882942200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 8.0847437493503094e-04</internalNodes>
+          <leafValues>
+            -3.3315700292587280e-01 1.4446459710597992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 2.1605329588055611e-02</internalNodes>
+          <leafValues>
+            -8.6723573505878448e-02 5.9101939201354980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 -1.8266839906573296e-02</internalNodes>
+          <leafValues>
+            5.0261861085891724e-01 -8.4620863199234009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 -8.3384668687358499e-04</internalNodes>
+          <leafValues>
+            -3.0832511186599731e-01 1.1352760344743729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 -1.5336600132286549e-02</internalNodes>
+          <leafValues>
+            -6.8610608577728271e-01 3.3057838678359985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -5.0607877783477306e-03</internalNodes>
+          <leafValues>
+            3.4399279952049255e-01 -9.2118233442306519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 -1.4741700397280511e-05</internalNodes>
+          <leafValues>
+            1.1778169870376587e-01 -2.5235179066658020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 -1.1485730065032840e-03</internalNodes>
+          <leafValues>
+            -2.9050019383430481e-01 8.3533048629760742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 2.8824089094996452e-03</internalNodes>
+          <leafValues>
+            -9.0674236416816711e-02 3.1274148821830750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 -2.9224360361695290e-02</internalNodes>
+          <leafValues>
+            -6.9156378507614136e-01 3.3279780298471451e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 2.1423520520329475e-03</internalNodes>
+          <leafValues>
+            -1.0087729990482330e-01 2.4603089690208435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 -3.3471059054136276e-02</internalNodes>
+          <leafValues>
+            -5.0953942537307739e-01 5.5052071809768677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 1.4763450053578708e-05</internalNodes>
+          <leafValues>
+            -1.7823149263858795e-01 1.2816399335861206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 1.6341559588909149e-02</internalNodes>
+          <leafValues>
+            -1.3254739344120026e-01 1.9663499295711517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 2.2475779987871647e-03</internalNodes>
+          <leafValues>
+            7.9048447310924530e-02 -2.9476320743560791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 4.6113221906125546e-03</internalNodes>
+          <leafValues>
+            -7.6338447630405426e-02 3.2394409179687500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 2.8979079797863960e-03</internalNodes>
+          <leafValues>
+            -1.0839050263166428e-01 2.6353389024734497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 1.3482819776982069e-03</internalNodes>
+          <leafValues>
+            7.9134561121463776e-02 -3.4839859604835510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 4.6576592139899731e-03</internalNodes>
+          <leafValues>
+            7.6356090605258942e-02 -3.1110540032386780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 -3.9915097877383232e-03</internalNodes>
+          <leafValues>
+            -3.4151628613471985e-01 8.2623466849327087e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 6.0268798843026161e-03</internalNodes>
+          <leafValues>
+            -9.6277832984924316e-02 2.6347661018371582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -4.1388701647520065e-03</internalNodes>
+          <leafValues>
+            2.3571729660034180e-01 -9.4335287809371948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 -1.0371750220656395e-02</internalNodes>
+          <leafValues>
+            -7.2972798347473145e-01 3.3645220100879669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 1.0373629629611969e-01</internalNodes>
+          <leafValues>
+            3.1347069889307022e-02 -5.8245128393173218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 -1.8832299974747002e-04</internalNodes>
+          <leafValues>
+            1.6663299500942230e-01 -1.3723160326480865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 -6.0749921249225736e-04</internalNodes>
+          <leafValues>
+            -2.7257540822029114e-01 8.1483371555805206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 2.3499270901083946e-03</internalNodes>
+          <leafValues>
+            -1.0285440087318420e-01 2.1854889392852783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 -3.1354159582406282e-03</internalNodes>
+          <leafValues>
+            -4.9246039986610413e-01 4.4747360050678253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 1.5564589994028211e-03</internalNodes>
+          <leafValues>
+            5.3096260875463486e-02 -4.0526211261749268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 6.3236099667847157e-03</internalNodes>
+          <leafValues>
+            -7.9116806387901306e-02 2.8413718938827515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 -4.8074051737785339e-03</internalNodes>
+          <leafValues>
+            2.9990258812904358e-01 -8.2824081182479858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 7.6432302594184875e-02</internalNodes>
+          <leafValues>
+            3.9146371185779572e-02 -5.7314342260360718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 7.0249952841550112e-04</internalNodes>
+          <leafValues>
+            5.2832871675491333e-02 -3.3245471119880676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -8.2157138967886567e-04</internalNodes>
+          <leafValues>
+            -2.1230019629001617e-01 8.8145829737186432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 -1.0148280300199986e-02</internalNodes>
+          <leafValues>
+            -2.2071610391139984e-01 9.6597403287887573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -1.7348809540271759e-01</internalNodes>
+          <leafValues>
+            -5.9822201728820801e-01 3.2547060400247574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 4.3031540699303150e-03</internalNodes>
+          <leafValues>
+            -6.8253546953201294e-02 2.8981029987335205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -7.3378678280278109e-06</internalNodes>
+          <leafValues>
+            7.5155563652515411e-02 -2.5863590836524963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 1.9277239916846156e-03</internalNodes>
+          <leafValues>
+            1.0856460034847260e-01 -1.6595140099525452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 -4.2054480873048306e-03</internalNodes>
+          <leafValues>
+            1.9811309874057770e-01 -9.1941706836223602e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 1.1466189753264189e-03</internalNodes>
+          <leafValues>
+            4.2078729718923569e-02 -4.3991029262542725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 -6.7244949750602245e-03</internalNodes>
+          <leafValues>
+            3.4456861019134521e-01 -5.7096958160400391e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -1.4554189874615986e-05</internalNodes>
+          <leafValues>
+            1.1632560193538666e-01 -1.6252210736274719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -2.6114559732377529e-03</internalNodes>
+          <leafValues>
+            2.8084969520568848e-01 -6.8243041634559631e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 -1.9477460591588169e-04</internalNodes>
+          <leafValues>
+            -1.9368860125541687e-01 9.3413226306438446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 2.6438338682055473e-04</internalNodes>
+          <leafValues>
+            9.9354371428489685e-02 -2.1586629748344421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 2.0134719088673592e-03</internalNodes>
+          <leafValues>
+            -6.1209201812744141e-02 2.9120978713035583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 -2.6024359464645386e-01</internalNodes>
+          <leafValues>
+            -8.3802181482315063e-01 2.1150760352611542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -1.5944700688123703e-02</internalNodes>
+          <leafValues>
+            -6.3974797725677490e-01 2.2144839167594910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 6.7249889252707362e-04</internalNodes>
+          <leafValues>
+            -1.4014090597629547e-01 1.2326350063085556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 1.3042770326137543e-02</internalNodes>
+          <leafValues>
+            2.4306889623403549e-02 -6.6303068399429321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 -1.4540290067088790e-05</internalNodes>
+          <leafValues>
+            9.0137362480163574e-02 -1.7409169673919678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 1.7920829355716705e-02</internalNodes>
+          <leafValues>
+            2.5644620880484581e-02 -6.5067142248153687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 1.6542300581932068e-03</internalNodes>
+          <leafValues>
+            -1.0385700315237045e-01 1.6688160598278046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 3.5362090915441513e-02</internalNodes>
+          <leafValues>
+            2.3093009367585182e-02 -6.9009417295455933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 3.3049840567400679e-05</internalNodes>
+          <leafValues>
+            -1.7408940196037292e-01 9.3873098492622375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 3.3775588963180780e-03</internalNodes>
+          <leafValues>
+            -5.8522459119558334e-02 3.0490559339523315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 7.3239738121628761e-03</internalNodes>
+          <leafValues>
+            4.0999408811330795e-02 -4.6160981059074402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 -2.9797051101922989e-03</internalNodes>
+          <leafValues>
+            5.1136761903762817e-01 -3.6246869713068008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 2.0306499209254980e-03</internalNodes>
+          <leafValues>
+            6.5309353172779083e-02 -2.6698499917984009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -6.8856950383633375e-04</internalNodes>
+          <leafValues>
+            -1.7604120075702667e-01 9.9361896514892578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 1.5746579738333821e-03</internalNodes>
+          <leafValues>
+            -1.0312269628047943e-01 1.6940550506114960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 1.5011089853942394e-03</internalNodes>
+          <leafValues>
+            -8.8128447532653809e-02 1.8899090588092804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 1.3503979425877333e-04</internalNodes>
+          <leafValues>
+            9.4145476818084717e-02 -1.8483440577983856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 5.5570588447153568e-03</internalNodes>
+          <leafValues>
+            2.9959060251712799e-02 -5.5482620000839233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 724 9.4529995694756508e-03</internalNodes>
+          <leafValues>
+            -5.3136389702558517e-02 4.0138289332389832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -6.1030662618577480e-04</internalNodes>
+          <leafValues>
+            -2.7060449123382568e-01 6.6881351172924042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 -1.1329240351915359e-01</internalNodes>
+          <leafValues>
+            -6.5178507566452026e-01 2.5042990222573280e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 -2.0354389562271535e-04</internalNodes>
+          <leafValues>
+            1.0892420262098312e-01 -1.5174369513988495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 -1.4983189757913351e-03</internalNodes>
+          <leafValues>
+            2.7388730645179749e-01 -5.8467049151659012e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 7.5277159921824932e-03</internalNodes>
+          <leafValues>
+            4.0991529822349548e-02 -4.2739889025688171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 3.6209179088473320e-03</internalNodes>
+          <leafValues>
+            -6.7309238016605377e-02 2.6064750552177429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 1.2153049930930138e-02</internalNodes>
+          <leafValues>
+            5.0768271088600159e-02 -3.8319081068038940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 4.6126339584589005e-02</internalNodes>
+          <leafValues>
+            2.4232989177107811e-02 -6.5039527416229248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 7.1408541407436132e-04</internalNodes>
+          <leafValues>
+            -1.3476370275020599e-01 1.2208549678325653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 -4.4331620447337627e-03</internalNodes>
+          <leafValues>
+            1.9939610362052917e-01 -1.0218709707260132e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 1.3099729549139738e-03</internalNodes>
+          <leafValues>
+            7.4517026543617249e-02 -2.4503719806671143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 2.6161450659856200e-04</internalNodes>
+          <leafValues>
+            -8.4287956357002258e-02 1.9924600422382355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 -2.7577539440244436e-03</internalNodes>
+          <leafValues>
+            -6.8734467029571533e-01 2.4851109832525253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 6.9469690322875977e-02</internalNodes>
+          <leafValues>
+            3.8438729941844940e-02 -3.9717179536819458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 -1.3031469425186515e-03</internalNodes>
+          <leafValues>
+            2.0089949667453766e-01 -9.1723307967185974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 1.3012000126764178e-03</internalNodes>
+          <leafValues>
+            -9.5305852591991425e-02 1.9248190522193909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 -3.9377259090542793e-03</internalNodes>
+          <leafValues>
+            -3.9224091172218323e-01 4.3738011270761490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 9.6125707030296326e-02</internalNodes>
+          <leafValues>
+            -4.3269440531730652e-02 3.7441849708557129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 -1.9181859493255615e-01</internalNodes>
+          <leafValues>
+            -6.1320561170578003e-01 2.8775539249181747e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -3.2945619896054268e-03</internalNodes>
+          <leafValues>
+            -2.2446820139884949e-01 7.7655017375946045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 -8.5190916433930397e-03</internalNodes>
+          <leafValues>
+            4.4720551371574402e-01 -4.1310388594865799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -4.9431469291448593e-02</internalNodes>
+          <leafValues>
+            -5.1819682121276855e-01 3.6863740533590317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 2.3110879585146904e-02</internalNodes>
+          <leafValues>
+            -3.3078420907258987e-02 5.9146630764007568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 -4.3400399590609595e-05</internalNodes>
+          <leafValues>
+            1.1395029723644257e-01 -1.9526299834251404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 5.4926839657127857e-03</internalNodes>
+          <leafValues>
+            6.1616070568561554e-02 -2.5591990351676941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 1.1886029969900846e-03</internalNodes>
+          <leafValues>
+            -6.8509116768836975e-02 2.4291250109672546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 8.8473428040742874e-03</internalNodes>
+          <leafValues>
+            7.6467283070087433e-02 -2.3176389932632446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 2.3952820338308811e-03</internalNodes>
+          <leafValues>
+            -4.4620860368013382e-02 4.5811769366264343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 -1.5011220239102840e-04</internalNodes>
+          <leafValues>
+            -1.6560749709606171e-01 1.0622239857912064e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -2.3465899750590324e-02</internalNodes>
+          <leafValues>
+            -2.4931310117244720e-01 6.6179357469081879e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 -6.6368370316922665e-03</internalNodes>
+          <leafValues>
+            1.4358420670032501e-01 -1.1510509997606277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 1.1986029567196965e-03</internalNodes>
+          <leafValues>
+            -9.8347522318363190e-02 1.7605540156364441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 7.9502072185277939e-03</internalNodes>
+          <leafValues>
+            3.5481378436088562e-02 -5.0176638364791870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 -4.5950649655424058e-04</internalNodes>
+          <leafValues>
+            -1.6928760707378387e-01 9.3400083482265472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -1.9301069900393486e-02</internalNodes>
+          <leafValues>
+            4.1836661100387573e-01 -5.1140110939741135e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 4.0163499116897583e-01</internalNodes>
+          <leafValues>
+            2.9358919709920883e-02 -6.4768058061599731e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>114</maxWeakCount>
+      <stageThreshold>-1.5384509563446045e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 761 -3.6284290254116058e-02</internalNodes>
+          <leafValues>
+            4.2841899394989014e-01 -2.5840431451797485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 3.0520830303430557e-02</internalNodes>
+          <leafValues>
+            -2.9715040326118469e-01 2.1756610274314880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 3.3444820437580347e-03</internalNodes>
+          <leafValues>
+            -2.1734359860420227e-01 1.9754439592361450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 -1.3315919786691666e-03</internalNodes>
+          <leafValues>
+            1.5535929799079895e-01 -2.3133680224418640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 -1.9773480016738176e-03</internalNodes>
+          <leafValues>
+            -4.2001301050186157e-01 8.8554427027702332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -3.7038238951936364e-04</internalNodes>
+          <leafValues>
+            1.2769789993762970e-01 -2.3879130184650421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 -7.3736459016799927e-03</internalNodes>
+          <leafValues>
+            -4.0720060467720032e-01 2.9765319079160690e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 -2.1873020159546286e-05</internalNodes>
+          <leafValues>
+            1.2338209897279739e-01 -2.2237089276313782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 4.5575048716273159e-05</internalNodes>
+          <leafValues>
+            -2.3092910647392273e-01 1.2953619658946991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -1.1247170157730579e-02</internalNodes>
+          <leafValues>
+            -5.4762738943099976e-01 4.1907660663127899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 -8.9430268853902817e-03</internalNodes>
+          <leafValues>
+            2.7945289015769958e-01 -9.0801216661930084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 1.4646670024376363e-05</internalNodes>
+          <leafValues>
+            -1.6777880489826202e-01 1.4968040585517883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 -6.5398351289331913e-03</internalNodes>
+          <leafValues>
+            3.3654621243476868e-01 -7.1987256407737732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 3.3825531136244535e-03</internalNodes>
+          <leafValues>
+            4.9931880086660385e-02 -4.5806300640106201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 2.7450500056147575e-03</internalNodes>
+          <leafValues>
+            3.6119509488344193e-02 -5.7113862037658691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 1.0356379672884941e-02</internalNodes>
+          <leafValues>
+            -5.3049158304929733e-02 4.2121198773384094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 3.1687319278717041e-03</internalNodes>
+          <leafValues>
+            6.2849938869476318e-02 -3.4674918651580811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 1.3616570504382253e-03</internalNodes>
+          <leafValues>
+            -9.0661056339740753e-02 2.5257480144500732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 -2.2238260135054588e-03</internalNodes>
+          <leafValues>
+            2.6595190167427063e-01 -9.6649080514907837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 1.1090899817645550e-02</internalNodes>
+          <leafValues>
+            8.6638063192367554e-02 -3.0103358626365662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 -6.7766150459647179e-04</internalNodes>
+          <leafValues>
+            9.4277828931808472e-02 -2.1464149653911591e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -3.3104580361396074e-03</internalNodes>
+          <leafValues>
+            -5.9162640571594238e-01 3.2738488167524338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 2.3221869487315416e-03</internalNodes>
+          <leafValues>
+            -9.5557250082492828e-02 2.0546199381351471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 3.0947118648327887e-04</internalNodes>
+          <leafValues>
+            -1.2992270290851593e-01 1.7704719305038452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 -3.2214168459177017e-02</internalNodes>
+          <leafValues>
+            -6.4662492275238037e-01 3.1749259680509567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 -8.3192758029326797e-04</internalNodes>
+          <leafValues>
+            -3.0666750669479370e-01 6.1040591448545456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 3.9188290247693658e-04</internalNodes>
+          <leafValues>
+            -1.5795469284057617e-01 1.1830350011587143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 -3.6203738301992416e-02</internalNodes>
+          <leafValues>
+            -2.2731229662895203e-01 8.3183012902736664e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 2.6437509804964066e-03</internalNodes>
+          <leafValues>
+            -7.6691061258316040e-02 2.3545509576797485e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 -3.4368310589343309e-03</internalNodes>
+          <leafValues>
+            3.6057031154632568e-01 -7.3672987520694733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -5.5921601597219706e-04</internalNodes>
+          <leafValues>
+            -2.5343179702758789e-01 7.8275643289089203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 4.3010139052057639e-05</internalNodes>
+          <leafValues>
+            -1.8223099410533905e-01 9.7539380192756653e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 5.3192679770290852e-03</internalNodes>
+          <leafValues>
+            -7.6901949942111969e-02 2.4221810698509216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 -6.9484501145780087e-03</internalNodes>
+          <leafValues>
+            -5.8275872468948364e-01 3.4601949155330658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 1.2447779998183250e-02</internalNodes>
+          <leafValues>
+            2.3883659392595291e-02 -6.1712497472763062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 1.0083100060001016e-03</internalNodes>
+          <leafValues>
+            -7.5152181088924408e-02 2.4744270741939545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 -2.3544009309262037e-03</internalNodes>
+          <leafValues>
+            3.1459400057792664e-01 -6.5026231110095978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 4.5676861191168427e-04</internalNodes>
+          <leafValues>
+            7.9758197069168091e-02 -2.3777219653129578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 6.6723190248012543e-03</internalNodes>
+          <leafValues>
+            3.8779199123382568e-02 -4.6045419573783875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 7.1861818469187710e-06</internalNodes>
+          <leafValues>
+            -1.3110539317131042e-01 1.2532530725002289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 3.0392590910196304e-02</internalNodes>
+          <leafValues>
+            2.9670530930161476e-02 -5.3870928287506104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 1.4835850379313342e-05</internalNodes>
+          <leafValues>
+            -1.5778580307960510e-01 1.0566859692335129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 1.4415860176086426e-02</internalNodes>
+          <leafValues>
+            -7.6271347701549530e-02 3.0597710609436035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 3.2787520904093981e-03</internalNodes>
+          <leafValues>
+            4.4464308768510818e-02 -3.8928028941154480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 1.0770520195364952e-02</internalNodes>
+          <leafValues>
+            -3.9324011653661728e-02 4.1493979096412659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 5.4678268497809768e-04</internalNodes>
+          <leafValues>
+            5.8721691370010376e-02 -2.7546930313110352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 -1.8106499919667840e-03</internalNodes>
+          <leafValues>
+            1.8281750380992889e-01 -9.3675427138805389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 1.1771249771118164e-01</internalNodes>
+          <leafValues>
+            2.3175759240984917e-02 -7.0696681737899780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -3.1166549888439476e-04</internalNodes>
+          <leafValues>
+            -2.0585930347442627e-01 7.6573841273784637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 -9.7939418628811836e-03</internalNodes>
+          <leafValues>
+            4.8732680082321167e-01 -3.4746028482913971e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 1.0002780472859740e-03</internalNodes>
+          <leafValues>
+            -1.1003620177507401e-01 1.5490560233592987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 812 6.9929230958223343e-03</internalNodes>
+          <leafValues>
+            3.2923609018325806e-02 -5.4326117038726807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 3.4163020551204681e-02</internalNodes>
+          <leafValues>
+            1.8062820658087730e-02 -7.0809149742126465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -2.0808410644531250e-01</internalNodes>
+          <leafValues>
+            -6.7879611253738403e-01 2.0255820825695992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 2.4889659835025668e-04</internalNodes>
+          <leafValues>
+            -1.7719520628452301e-01 8.8152356445789337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -9.3355607241392136e-03</internalNodes>
+          <leafValues>
+            1.7948059737682343e-01 -9.4474621117115021e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 2.9192469082772732e-04</internalNodes>
+          <leafValues>
+            -1.3786169886589050e-01 1.3819259405136108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 9.1989226639270782e-03</internalNodes>
+          <leafValues>
+            -1.0269109904766083e-01 1.7618100345134735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 6.8165437551215291e-04</internalNodes>
+          <leafValues>
+            7.4821308255195618e-02 -2.3621830344200134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 -1.4507620107906405e-05</internalNodes>
+          <leafValues>
+            9.5861770212650299e-02 -1.7785739898681641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 1.7662490427028388e-04</internalNodes>
+          <leafValues>
+            -1.3805359601974487e-01 1.3394320011138916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 -1.7513500060886145e-03</internalNodes>
+          <leafValues>
+            7.7623583376407623e-02 -2.3174029588699341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 5.1342020742595196e-03</internalNodes>
+          <leafValues>
+            3.0363969504833221e-02 -5.2420848608016968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 9.4114318490028381e-03</internalNodes>
+          <leafValues>
+            -5.8994568884372711e-02 3.0291381478309631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -1.0448819957673550e-03</internalNodes>
+          <leafValues>
+            -1.7124690115451813e-01 1.0156030207872391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -6.3579198904335499e-03</internalNodes>
+          <leafValues>
+            3.1986710429191589e-01 -5.0694450736045837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 -6.3502117991447449e-03</internalNodes>
+          <leafValues>
+            -5.2413272857666016e-01 3.1800068914890289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 1.2251759879291058e-02</internalNodes>
+          <leafValues>
+            1.6559680923819542e-02 -7.9422187805175781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 -1.4000720344483852e-02</internalNodes>
+          <leafValues>
+            -5.4444402456283569e-01 2.4652559310197830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 1.9229920580983162e-03</internalNodes>
+          <leafValues>
+            -7.6944977045059204e-02 2.1888209879398346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -3.4030789975076914e-03</internalNodes>
+          <leafValues>
+            3.0143401026725769e-01 -5.8023329824209213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 -2.7728609740734100e-02</internalNodes>
+          <leafValues>
+            -5.6704998016357422e-01 3.0071720480918884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 1.4990579802542925e-04</internalNodes>
+          <leafValues>
+            9.1404616832733154e-02 -1.6989429295063019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -1.4532960449287202e-05</internalNodes>
+          <leafValues>
+            1.0442660003900528e-01 -1.3983349502086639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 2.8315950185060501e-02</internalNodes>
+          <leafValues>
+            1.7812129110097885e-02 -8.1201279163360596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -1.7363600200042129e-03</internalNodes>
+          <leafValues>
+            1.9688630104064941e-01 -7.6398819684982300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -2.2081490606069565e-02</internalNodes>
+          <leafValues>
+            4.4497510790824890e-01 -3.3445868641138077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 1.2189210392534733e-03</internalNodes>
+          <leafValues>
+            4.9154780805110931e-02 -3.7790310382843018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 -5.4838892538100481e-04</internalNodes>
+          <leafValues>
+            -2.2823029756546021e-01 8.0446496605873108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 -9.3702552840113640e-04</internalNodes>
+          <leafValues>
+            2.5258961319923401e-01 -6.5389201045036316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 1.2496720068156719e-02</internalNodes>
+          <leafValues>
+            3.8215879350900650e-02 -4.0465530753135681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -1.6764370724558830e-02</internalNodes>
+          <leafValues>
+            -1.4508719742298126e-01 1.2119810283184052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 5.6504327803850174e-03</internalNodes>
+          <leafValues>
+            -8.7139137089252472e-02 2.2194419801235199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 5.2610319107770920e-04</internalNodes>
+          <leafValues>
+            8.7222076952457428e-02 -2.0502470433712006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 1.5574200078845024e-03</internalNodes>
+          <leafValues>
+            -1.7036689817905426e-01 9.4435282051563263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 2.5609090924263000e-01</internalNodes>
+          <leafValues>
+            1.7790110781788826e-02 -7.4050921201705933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 3.3561999443918467e-03</internalNodes>
+          <leafValues>
+            -4.2667269706726074e-02 3.7573391199111938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 4.7072928398847580e-02</internalNodes>
+          <leafValues>
+            3.2015219330787659e-02 -6.4522278308868408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 -2.2168930154293776e-03</internalNodes>
+          <leafValues>
+            2.0757040381431580e-01 -7.7372692525386810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 5.0796428695321083e-03</internalNodes>
+          <leafValues>
+            4.1829328984022141e-02 -3.7722969055175781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 7.0120906457304955e-05</internalNodes>
+          <leafValues>
+            8.1031888723373413e-02 -1.8506260216236115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 -5.2204862004145980e-04</internalNodes>
+          <leafValues>
+            1.2528459727764130e-01 -1.3090319931507111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 -6.1609707772731781e-03</internalNodes>
+          <leafValues>
+            3.1177788972854614e-01 -5.1252178847789764e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 -2.8424879908561707e-01</internalNodes>
+          <leafValues>
+            -7.0340508222579956e-01 2.2811079397797585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 -4.1746720671653748e-02</internalNodes>
+          <leafValues>
+            -7.8914260864257812e-01 1.6686350107192993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 -1.0051350109279156e-03</internalNodes>
+          <leafValues>
+            -2.2181299328804016e-01 6.1887398362159729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -1.3900640187785029e-03</internalNodes>
+          <leafValues>
+            1.8797479569911957e-01 -7.6582401990890503e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -4.0118378819897771e-04</internalNodes>
+          <leafValues>
+            -1.7291170358657837e-01 8.6806759238243103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 -2.9202610676293261e-05</internalNodes>
+          <leafValues>
+            9.2319779098033905e-02 -1.7136460542678833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 -2.6532830670475960e-03</internalNodes>
+          <leafValues>
+            3.9422848820686340e-01 -3.9826449006795883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 -7.8933471813797951e-03</internalNodes>
+          <leafValues>
+            -4.3326890468597412e-01 3.6603361368179321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 8.7933447211980820e-03</internalNodes>
+          <leafValues>
+            -3.3205948770046234e-02 4.8740789294242859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 1.2014759704470634e-02</internalNodes>
+          <leafValues>
+            2.2244220599532127e-02 -8.1597268581390381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 2.1147020161151886e-03</internalNodes>
+          <leafValues>
+            6.4942933619022369e-02 -2.0959229767322540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 -9.9916034378111362e-04</internalNodes>
+          <leafValues>
+            1.5402349829673767e-01 -1.0149469971656799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 -7.6499581336975098e-04</internalNodes>
+          <leafValues>
+            2.0236450433731079e-01 -7.1199662983417511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 -4.2193511035293341e-04</internalNodes>
+          <leafValues>
+            1.1521430313587189e-01 -1.2845459580421448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 -4.1548791341483593e-04</internalNodes>
+          <leafValues>
+            -2.1168529987335205e-01 7.0376142859458923e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 1.5300279483199120e-03</internalNodes>
+          <leafValues>
+            6.1263758689165115e-02 -2.2269320487976074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 -2.6573969516903162e-03</internalNodes>
+          <leafValues>
+            3.8462328910827637e-01 -3.8276020437479019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -2.1988600492477417e-01</internalNodes>
+          <leafValues>
+            -5.1546782255172729e-01 2.8099389746785164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 -8.7377207819372416e-04</internalNodes>
+          <leafValues>
+            1.0149329900741577e-01 -1.3990689814090729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 7.5169820338487625e-03</internalNodes>
+          <leafValues>
+            -6.1671640723943710e-02 2.5486430525779724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 -1.3438290625344962e-04</internalNodes>
+          <leafValues>
+            -1.6618040204048157e-01 8.8938876986503601e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>117</maxWeakCount>
+      <stageThreshold>-1.5079799890518188e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 875 3.5007519181817770e-03</internalNodes>
+          <leafValues>
+            -2.8256690502166748e-01 3.3628109097480774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 4.1042729280889034e-03</internalNodes>
+          <leafValues>
+            -1.5877629816532135e-01 3.4091961383819580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 9.8724407143890858e-04</internalNodes>
+          <leafValues>
+            -4.6094760298728943e-01 1.1771719902753830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 -4.0168981067836285e-03</internalNodes>
+          <leafValues>
+            1.3994920253753662e-01 -3.8476601243019104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -4.2784500867128372e-02</internalNodes>
+          <leafValues>
+            3.1519949436187744e-01 -1.1673810333013535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 -5.6273501832038164e-04</internalNodes>
+          <leafValues>
+            8.2315109670162201e-02 -3.3594700694084167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -4.3416650441940874e-05</internalNodes>
+          <leafValues>
+            1.0691779851913452e-01 -2.5068029761314392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 1.5347570180892944e-02</internalNodes>
+          <leafValues>
+            9.7383828833699226e-03 -6.4612430334091187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 1.8295480404049158e-03</internalNodes>
+          <leafValues>
+            8.9164443314075470e-02 -2.9637640714645386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 3.2098879455588758e-04</internalNodes>
+          <leafValues>
+            -2.3136790096759796e-01 1.1478479951620102e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 1.0728760389611125e-03</internalNodes>
+          <leafValues>
+            -1.2982189655303955e-01 1.9653689861297607e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -4.9566011875867844e-03</internalNodes>
+          <leafValues>
+            3.5313999652862549e-01 -7.6989777386188507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 -1.6319400165230036e-03</internalNodes>
+          <leafValues>
+            -2.3701989650726318e-01 1.0319659858942032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.9862050190567970e-02</internalNodes>
+          <leafValues>
+            5.9187598526477814e-02 -4.0955111384391785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 -9.5205483958125114e-03</internalNodes>
+          <leafValues>
+            3.9061769843101501e-01 -5.7647578418254852e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -1.0885810479521751e-03</internalNodes>
+          <leafValues>
+            -5.2902680635452271e-01 4.4961001724004745e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 3.5348529927432537e-03</internalNodes>
+          <leafValues>
+            -9.2707537114620209e-02 2.4449980258941650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 892 5.7174800895154476e-03</internalNodes>
+          <leafValues>
+            5.7306189090013504e-02 -3.9878991246223450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 -1.4010589802637696e-03</internalNodes>
+          <leafValues>
+            1.0757780075073242e-01 -1.9520820677280426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -2.2306239698082209e-03</internalNodes>
+          <leafValues>
+            -6.1328327655792236e-01 2.7875339612364769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 -5.0583072006702423e-03</internalNodes>
+          <leafValues>
+            -5.4739731550216675e-01 3.0482530593872070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 1.3725720345973969e-01</internalNodes>
+          <leafValues>
+            2.8162300586700439e-02 -6.0817748308181763e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 3.7828299682587385e-03</internalNodes>
+          <leafValues>
+            -1.2640979886054993e-01 1.3382309675216675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 -1.0629029944539070e-02</internalNodes>
+          <leafValues>
+            -1.7343379557132721e-01 9.9954582750797272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 5.6623672135174274e-03</internalNodes>
+          <leafValues>
+            -5.2419230341911316e-02 3.2940819859504700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 -4.5901038683950901e-03</internalNodes>
+          <leafValues>
+            1.8784660100936890e-01 -9.2681042850017548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 7.1088741533458233e-03</internalNodes>
+          <leafValues>
+            3.2605409622192383e-02 -5.7968139648437500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 -1.9310249481350183e-03</internalNodes>
+          <leafValues>
+            -2.8707239031791687e-01 5.8658700436353683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 3.5559700336307287e-03</internalNodes>
+          <leafValues>
+            -6.2841393053531647e-02 3.0232760310173035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 2.1007249597460032e-04</internalNodes>
+          <leafValues>
+            -1.2029449641704559e-01 2.0722889900207520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 3.0181880574673414e-03</internalNodes>
+          <leafValues>
+            4.2764421552419662e-02 -4.5567208528518677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -2.0919379312545061e-03</internalNodes>
+          <leafValues>
+            -5.8067041635513306e-01 2.4772390723228455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 4.9380292184650898e-03</internalNodes>
+          <leafValues>
+            -6.7825779318809509e-02 2.6715460419654846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 1.0227119782939553e-03</internalNodes>
+          <leafValues>
+            -1.1050579696893692e-01 1.7136010527610779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -9.1216713190078735e-02</internalNodes>
+          <leafValues>
+            -5.5617409944534302e-01 3.1176509335637093e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 1.9377609714865685e-03</internalNodes>
+          <leafValues>
+            5.2470069378614426e-02 -3.3402100205421448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 -4.5235231518745422e-03</internalNodes>
+          <leafValues>
+            -3.8628038763999939e-01 4.4883530586957932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 1.1070469627156854e-03</internalNodes>
+          <leafValues>
+            -9.4648011028766632e-02 1.7694370448589325e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 -1.4522889629006386e-02</internalNodes>
+          <leafValues>
+            -4.4854640960693359e-01 4.0654070675373077e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 2.0895639434456825e-02</internalNodes>
+          <leafValues>
+            3.5988390445709229e-02 -4.4317048788070679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 7.3273790803796146e-06</internalNodes>
+          <leafValues>
+            -1.9736979901790619e-01 8.8131763041019440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 -1.4750339687452652e-05</internalNodes>
+          <leafValues>
+            8.8203012943267822e-02 -1.9387699663639069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 1.0160019621253014e-02</internalNodes>
+          <leafValues>
+            -7.3683522641658783e-02 2.7725589275360107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 1.4658429790870287e-05</internalNodes>
+          <leafValues>
+            -1.3514040410518646e-01 1.1165390163660049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 2.9789519030600786e-03</internalNodes>
+          <leafValues>
+            -5.6356389075517654e-02 2.9033899307250977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 6.7907930351793766e-03</internalNodes>
+          <leafValues>
+            -5.5468060076236725e-02 2.9650750756263733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 3.5746619105339050e-02</internalNodes>
+          <leafValues>
+            4.4232271611690521e-02 -3.7943100929260254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 -8.6023868061602116e-04</internalNodes>
+          <leafValues>
+            -2.5524240732192993e-01 6.3983328640460968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 -3.2749359961599112e-03</internalNodes>
+          <leafValues>
+            5.1642370223999023e-01 -3.0802410095930099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -1.4287419617176056e-04</internalNodes>
+          <leafValues>
+            -1.7014829814434052e-01 9.0200550854206085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -5.9252060949802399e-02</internalNodes>
+          <leafValues>
+            4.4787400960922241e-01 -3.4802999347448349e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 4.9169741570949554e-02</internalNodes>
+          <leafValues>
+            4.3797228485345840e-02 -3.9337700605392456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 2.4047859478741884e-03</internalNodes>
+          <leafValues>
+            -8.5982158780097961e-02 1.7597770690917969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -8.8569998741149902e-02</internalNodes>
+          <leafValues>
+            -2.9694429039955139e-01 5.6752521544694901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 3.5266599152237177e-03</internalNodes>
+          <leafValues>
+            -5.4160539060831070e-02 3.2359990477561951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 -1.4674359590571839e-05</internalNodes>
+          <leafValues>
+            1.0095299780368805e-01 -1.7195940017700195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 -1.0672880336642265e-02</internalNodes>
+          <leafValues>
+            -3.9103358983993530e-01 3.9687499403953552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 -1.3177569955587387e-02</internalNodes>
+          <leafValues>
+            2.7460250258445740e-01 -5.5524408817291260e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 -2.0427990239113569e-03</internalNodes>
+          <leafValues>
+            -3.2616940140724182e-01 5.1151938736438751e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 2.5430709123611450e-02</internalNodes>
+          <leafValues>
+            3.4412149339914322e-02 -3.9120680093765259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 6.6575622186064720e-03</internalNodes>
+          <leafValues>
+            -6.2124639749526978e-02 2.5493910908699036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 -2.4922629818320274e-02</internalNodes>
+          <leafValues>
+            -7.5617647171020508e-01 2.0520050078630447e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 6.4869478344917297e-02</internalNodes>
+          <leafValues>
+            1.3535760343074799e-02 -8.5182607173919678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 -1.9129139836877584e-03</internalNodes>
+          <leafValues>
+            -2.0609579980373383e-01 6.8809613585472107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -2.7280850335955620e-03</internalNodes>
+          <leafValues>
+            1.3853220641613007e-01 -1.1308959871530533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 3.9647668600082397e-03</internalNodes>
+          <leafValues>
+            -8.5980050265789032e-02 1.8867929279804230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 8.6866566562093794e-05</internalNodes>
+          <leafValues>
+            -1.3409359753131866e-01 1.1543890088796616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 -1.0680439881980419e-03</internalNodes>
+          <leafValues>
+            2.4043959379196167e-01 -5.9584230184555054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 6.4973197877407074e-03</internalNodes>
+          <leafValues>
+            3.5721741616725922e-02 -4.3827891349792480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 3.3825050923041999e-04</internalNodes>
+          <leafValues>
+            7.5188770890235901e-02 -1.9240869581699371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 2.4638089817017317e-03</internalNodes>
+          <leafValues>
+            -3.8108248263597488e-02 4.1398531198501587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 7.1629788726568222e-04</internalNodes>
+          <leafValues>
+            6.7675560712814331e-02 -2.3129940032958984e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 -1.1354340240359306e-03</internalNodes>
+          <leafValues>
+            1.6413919627666473e-01 -9.8224140703678131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 -4.6024488983675838e-04</internalNodes>
+          <leafValues>
+            7.8879103064537048e-02 -1.8191289901733398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -8.1474315375089645e-03</internalNodes>
+          <leafValues>
+            -1.8627829849720001e-01 7.7696673572063446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -3.3882331103086472e-02</internalNodes>
+          <leafValues>
+            4.1818460822105408e-01 -4.0109351277351379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 -4.3395790271461010e-03</internalNodes>
+          <leafValues>
+            1.8961839377880096e-01 -8.3509556949138641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 2.4691419675946236e-03</internalNodes>
+          <leafValues>
+            4.3756991624832153e-02 -3.8284140825271606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 8.7688177824020386e-02</internalNodes>
+          <leafValues>
+            2.3466430604457855e-02 -5.9991317987442017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 7.1277258939517196e-06</internalNodes>
+          <leafValues>
+            -1.4574949443340302e-01 9.4181038439273834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -2.2863550111651421e-03</internalNodes>
+          <leafValues>
+            2.2176849842071533e-01 -6.2630541622638702e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 -1.4718780221301131e-05</internalNodes>
+          <leafValues>
+            1.1210440099239349e-01 -1.3407769799232483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 2.9124629218131304e-03</internalNodes>
+          <leafValues>
+            -6.1113931238651276e-02 2.6921069622039795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 -7.2532321792095900e-04</internalNodes>
+          <leafValues>
+            -1.8317590653896332e-01 9.0204723179340363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -1.7109309555962682e-03</internalNodes>
+          <leafValues>
+            -2.9150980710983276e-01 5.6865800172090530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 3.5050138831138611e-02</internalNodes>
+          <leafValues>
+            2.4259999394416809e-02 -5.9926068782806396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 2.5119259953498840e-02</internalNodes>
+          <leafValues>
+            -4.6499390155076981e-02 3.3078059554100037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 1.3924979604780674e-02</internalNodes>
+          <leafValues>
+            5.4394099861383438e-02 -3.2431459426879883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 1.2507860083132982e-03</internalNodes>
+          <leafValues>
+            -8.6275100708007812e-02 1.6083979606628418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 3.2347340602427721e-03</internalNodes>
+          <leafValues>
+            4.0214668959379196e-02 -3.3414369821548462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 2.3993090726435184e-03</internalNodes>
+          <leafValues>
+            -3.6099448800086975e-02 4.0332961082458496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -6.4468860626220703e-02</internalNodes>
+          <leafValues>
+            -9.2355471849441528e-01 1.7104439437389374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 2.6983879506587982e-02</internalNodes>
+          <leafValues>
+            -4.1323971003293991e-02 3.8095420598983765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 -1.4244250451156404e-05</internalNodes>
+          <leafValues>
+            9.8453678190708160e-02 -1.3854749500751495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 3.6304299719631672e-03</internalNodes>
+          <leafValues>
+            2.2532820701599121e-02 -5.7740187644958496e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 -2.7509450446814299e-03</internalNodes>
+          <leafValues>
+            2.8656649589538574e-01 -4.9012679606676102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 3.4084690269082785e-03</internalNodes>
+          <leafValues>
+            3.8566160947084427e-02 -3.5187271237373352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 -2.0442469976842403e-03</internalNodes>
+          <leafValues>
+            1.5499830245971680e-01 -8.1280998885631561e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 -3.3763761166483164e-04</internalNodes>
+          <leafValues>
+            -1.8969820439815521e-01 7.3497541248798370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 -1.9649739842861891e-03</internalNodes>
+          <leafValues>
+            2.4030299484729767e-01 -5.3698450326919556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 2.6115038781426847e-04</internalNodes>
+          <leafValues>
+            -1.0585899651050568e-01 1.4551800489425659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -2.4496200494468212e-03</internalNodes>
+          <leafValues>
+            -3.3511948585510254e-01 4.3949641287326813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 2.5791170075535774e-02</internalNodes>
+          <leafValues>
+            1.9443970173597336e-02 -6.3135677576065063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -1.7996380338445306e-03</internalNodes>
+          <leafValues>
+            1.5620160102844238e-01 -8.9669622480869293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 -5.5190739221870899e-03</internalNodes>
+          <leafValues>
+            3.8429600000381470e-01 -3.9308220148086548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 9.3076081248000264e-04</internalNodes>
+          <leafValues>
+            5.3146060556173325e-02 -2.7482900023460388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 2.7754770126193762e-03</internalNodes>
+          <leafValues>
+            -5.3488280624151230e-02 2.4878840148448944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 1.9387940410524607e-03</internalNodes>
+          <leafValues>
+            7.5177863240242004e-02 -1.9432419538497925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -4.0069930255413055e-03</internalNodes>
+          <leafValues>
+            -2.7330648899078369e-01 6.2000360339879990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 7.4540930800139904e-03</internalNodes>
+          <leafValues>
+            -5.0977949053049088e-02 2.7055469155311584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 -1.6338729765266180e-03</internalNodes>
+          <leafValues>
+            1.0920850187540054e-01 -1.4821110665798187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 -1.1626870185136795e-01</internalNodes>
+          <leafValues>
+            -9.4307368993759155e-01 1.4511439949274063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -1.2051310390233994e-02</internalNodes>
+          <leafValues>
+            -3.0964991450309753e-01 3.7726309150457382e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 1.5592000447213650e-02</internalNodes>
+          <leafValues>
+            -3.8526348769664764e-02 3.6706140637397766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 -1.1198739521205425e-03</internalNodes>
+          <leafValues>
+            -1.4644260704517365e-01 9.6057042479515076e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 -1.4623399692936800e-05</internalNodes>
+          <leafValues>
+            1.0641819983720779e-01 -1.3394460082054138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.0319639742374420e-01</internalNodes>
+          <leafValues>
+            -7.0196557044982910e-01 1.8891770392656326e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>121</maxWeakCount>
+      <stageThreshold>-1.4499469995498657e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 992 -3.7469431757926941e-02</internalNodes>
+          <leafValues>
+            2.9079249501228333e-01 -3.5205191373825073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 4.0861819870769978e-03</internalNodes>
+          <leafValues>
+            -2.9098600149154663e-01 1.8445029854774475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 -9.2446897178888321e-04</internalNodes>
+          <leafValues>
+            1.1087530106306076e-01 -4.1064518690109253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 995 8.5803697584196925e-04</internalNodes>
+          <leafValues>
+            -2.2129820287227631e-01 1.5465059876441956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 2.3659599537495524e-04</internalNodes>
+          <leafValues>
+            -3.2185178995132446e-01 1.1183690279722214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 -3.5021029412746429e-02</internalNodes>
+          <leafValues>
+            2.2721460461616516e-01 -1.4156529307365417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 -3.4688229206949472e-03</internalNodes>
+          <leafValues>
+            -4.0247380733489990e-01 4.3791528791189194e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 5.0372090190649033e-03</internalNodes>
+          <leafValues>
+            -1.2387280166149139e-01 2.2701320052146912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 -1.1929610045626760e-03</internalNodes>
+          <leafValues>
+            -4.8692488670349121e-01 5.2568510174751282e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 9.5561221241950989e-03</internalNodes>
+          <leafValues>
+            -4.6204000711441040e-02 5.1149028539657593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 1.1109219631180167e-03</internalNodes>
+          <leafValues>
+            4.5496881008148193e-02 -4.5278310775756836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 5.7835641200654209e-05</internalNodes>
+          <leafValues>
+            -1.5641710162162781e-01 1.3276909291744232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -9.4595848349854350e-04</internalNodes>
+          <leafValues>
+            -2.8471308946609497e-01 6.4549557864665985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 8.8587577920407057e-04</internalNodes>
+          <leafValues>
+            6.5990276634693146e-02 -3.2505878806114197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 2.1180589683353901e-03</internalNodes>
+          <leafValues>
+            -7.1820907294750214e-02 3.3132740855216980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 -1.6004469245672226e-02</internalNodes>
+          <leafValues>
+            -4.9266660213470459e-01 3.5758759826421738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 1.4956319937482476e-03</internalNodes>
+          <leafValues>
+            -8.3095543086528778e-02 2.7613210678100586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 7.5204619206488132e-03</internalNodes>
+          <leafValues>
+            2.6987679302692413e-02 -6.5507948398590088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 -1.4567610378435347e-05</internalNodes>
+          <leafValues>
+            1.1181929707527161e-01 -1.8279710412025452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 1.5564640052616596e-03</internalNodes>
+          <leafValues>
+            -1.5681059658527374e-01 1.1271400004625320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -3.6522798240184784e-02</internalNodes>
+          <leafValues>
+            -1.4254869520664215e-01 1.3022269308567047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 9.4677843153476715e-03</internalNodes>
+          <leafValues>
+            -4.3431900441646576e-02 3.6521318554878235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 -1.4508370441035368e-05</internalNodes>
+          <leafValues>
+            8.4056511521339417e-02 -2.0373860001564026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 9.7979931160807610e-04</internalNodes>
+          <leafValues>
+            -9.2570282518863678e-02 1.9765810668468475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 1.4909260244166944e-05</internalNodes>
+          <leafValues>
+            -1.4167930185794830e-01 1.2542089819908142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 -2.1510709484573454e-04</internalNodes>
+          <leafValues>
+            2.0154480636119843e-01 -8.0978751182556152e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 -1.3552160235121846e-03</internalNodes>
+          <leafValues>
+            -3.9648211002349854e-01 4.5137099921703339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 8.4163509309291840e-03</internalNodes>
+          <leafValues>
+            -7.5962640345096588e-02 2.2327689826488495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 -3.0116800917312503e-04</internalNodes>
+          <leafValues>
+            -1.9837650656700134e-01 8.5917882621288300e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 9.7665376961231232e-04</internalNodes>
+          <leafValues>
+            6.1060719192028046e-02 -3.1315010786056519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 1.9718110561370850e-03</internalNodes>
+          <leafValues>
+            -5.4124880582094193e-02 3.2931008934974670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 6.4220376312732697e-02</internalNodes>
+          <leafValues>
+            3.1034920364618301e-02 -5.8339309692382812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 -4.8852190375328064e-03</internalNodes>
+          <leafValues>
+            1.8666909635066986e-01 -8.5492432117462158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 -2.5309080956503749e-04</internalNodes>
+          <leafValues>
+            -1.6574999690055847e-01 9.2472381889820099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 2.9818940674886107e-05</internalNodes>
+          <leafValues>
+            -1.4195050299167633e-01 1.0154379904270172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 -1.0288760066032410e-02</internalNodes>
+          <leafValues>
+            2.5133699178695679e-01 -5.9286661446094513e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 -2.9165179512347095e-05</internalNodes>
+          <leafValues>
+            1.2957669794559479e-01 -1.1733850091695786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -2.0741471089422703e-03</internalNodes>
+          <leafValues>
+            -2.2633939981460571e-01 6.6792942583560944e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 1.1343799997121096e-03</internalNodes>
+          <leafValues>
+            -6.3913702964782715e-02 2.7956250309944153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 -1.5007710317149758e-05</internalNodes>
+          <leafValues>
+            1.3454750180244446e-01 -1.1705060303211212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 4.9826782196760178e-03</internalNodes>
+          <leafValues>
+            2.6505010202527046e-02 -6.0010671615600586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 -3.4576859325170517e-03</internalNodes>
+          <leafValues>
+            3.1286209821701050e-01 -5.4155170917510986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 5.4344828240573406e-03</internalNodes>
+          <leafValues>
+            2.8702750802040100e-02 -5.6824082136154175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -1.4558049770130310e-05</internalNodes>
+          <leafValues>
+            1.0756780207157135e-01 -1.3127699494361877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 1.5321969985961914e-03</internalNodes>
+          <leafValues>
+            -1.1911620199680328e-01 1.4021439850330353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 -2.2449430078268051e-02</internalNodes>
+          <leafValues>
+            -3.3376368880271912e-01 4.9373220652341843e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 1.1923030018806458e-02</internalNodes>
+          <leafValues>
+            6.3558742403984070e-02 -2.4746930599212646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 2.0685950294137001e-02</internalNodes>
+          <leafValues>
+            -6.1905119568109512e-02 2.6367300748825073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 5.0756777636706829e-04</internalNodes>
+          <leafValues>
+            -1.2528319656848907e-01 1.4505800604820251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 9.2508539091795683e-04</internalNodes>
+          <leafValues>
+            5.9009589254856110e-02 -2.6204380393028259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 8.6694798665121198e-04</internalNodes>
+          <leafValues>
+            -8.8942721486091614e-02 1.7795750498771667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 4.7340960009023547e-04</internalNodes>
+          <leafValues>
+            6.8137630820274353e-02 -2.1880300343036652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 9.0366601943969727e-02</internalNodes>
+          <leafValues>
+            1.8516469746828079e-02 -6.5736871957778931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 2.0585930906236172e-03</internalNodes>
+          <leafValues>
+            -4.5568998903036118e-02 3.2879421114921570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 -4.0761628188192844e-03</internalNodes>
+          <leafValues>
+            -3.5896709561347961e-01 4.0903490036725998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 3.2309619709849358e-03</internalNodes>
+          <leafValues>
+            -5.8772470802068710e-02 2.5518509745597839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 2.0424150861799717e-03</internalNodes>
+          <leafValues>
+            4.3209441006183624e-02 -3.3393308520317078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 -2.8341729193925858e-04</internalNodes>
+          <leafValues>
+            -1.6685059666633606e-01 8.1555336713790894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 -1.0859699686989188e-03</internalNodes>
+          <leafValues>
+            1.7807449400424957e-01 -9.2171236872673035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 -2.0089520141482353e-02</internalNodes>
+          <leafValues>
+            -3.5236391425132751e-01 4.4607751071453094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 -1.8073120154440403e-03</internalNodes>
+          <leafValues>
+            3.0220940709114075e-01 -5.2047580480575562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 1.0337149724364281e-02</internalNodes>
+          <leafValues>
+            2.4787139147520065e-02 -6.8838161230087280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 -2.4023749865591526e-03</internalNodes>
+          <leafValues>
+            3.3173340559005737e-01 -4.6199489384889603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -5.8347097365185618e-04</internalNodes>
+          <leafValues>
+            -1.8856820464134216e-01 7.7347792685031891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 -2.1759211085736752e-03</internalNodes>
+          <leafValues>
+            3.3067348599433899e-01 -4.0855869650840759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -1.1984390439465642e-03</internalNodes>
+          <leafValues>
+            -2.1580339968204498e-01 6.8534582853317261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 1.4474330237135291e-03</internalNodes>
+          <leafValues>
+            -5.8074928820133209e-02 2.3362369835376740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 5.1625841297209263e-04</internalNodes>
+          <leafValues>
+            7.5655579566955566e-02 -2.0956470072269440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 -1.4388939598575234e-03</internalNodes>
+          <leafValues>
+            -3.0948141217231750e-01 5.8159999549388885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 -1.7495449865236878e-03</internalNodes>
+          <leafValues>
+            1.0236290097236633e-01 -1.5715239942073822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 1.6774939373135567e-02</internalNodes>
+          <leafValues>
+            2.3711699992418289e-02 -5.8594572544097900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 -8.3265192806720734e-03</internalNodes>
+          <leafValues>
+            3.0943349003791809e-01 -4.8807561397552490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 -4.4853150029666722e-05</internalNodes>
+          <leafValues>
+            1.0615509748458862e-01 -1.3089710474014282e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 5.9908269904553890e-03</internalNodes>
+          <leafValues>
+            8.0168873071670532e-02 -1.6817809641361237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 1.4110070187598467e-03</internalNodes>
+          <leafValues>
+            -6.9941587746143341e-02 2.2045080363750458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 4.1205998510122299e-02</internalNodes>
+          <leafValues>
+            3.1721431761980057e-02 -4.4176858663558960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 1.5044870087876916e-04</internalNodes>
+          <leafValues>
+            -1.2152300029993057e-01 1.1241420358419418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 -4.8399530351161957e-03</internalNodes>
+          <leafValues>
+            2.8244999051094055e-01 -5.1606610417366028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 -1.0831269901245832e-03</internalNodes>
+          <leafValues>
+            -1.6978019475936890e-01 8.3731047809123993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 -1.3483200222253799e-02</internalNodes>
+          <leafValues>
+            2.8269320726394653e-01 -5.2228599786758423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 5.9854640858247876e-04</internalNodes>
+          <leafValues>
+            -1.3749149441719055e-01 1.2280890345573425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 -6.4943352481350303e-04</internalNodes>
+          <leafValues>
+            -1.6931599378585815e-01 8.8171690702438354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 -6.3191158697009087e-03</internalNodes>
+          <leafValues>
+            1.6245460510253906e-01 -8.6300060153007507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 -2.5179239455610514e-03</internalNodes>
+          <leafValues>
+            -3.1853398680686951e-01 5.2688188850879669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 -4.6924971044063568e-02</internalNodes>
+          <leafValues>
+            -6.5773141384124756e-01 2.0505079999566078e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 -9.6446421230211854e-04</internalNodes>
+          <leafValues>
+            -2.7256599068641663e-01 4.5441299676895142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1078 1.5073099639266729e-03</internalNodes>
+          <leafValues>
+            -5.0479460507631302e-02 2.8486481308937073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 1.6149930655956268e-02</internalNodes>
+          <leafValues>
+            3.8769058883190155e-02 -3.6149570345878601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 1.9126510247588158e-02</internalNodes>
+          <leafValues>
+            -3.6233641207218170e-02 4.7573548555374146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 -1.2546279467642307e-03</internalNodes>
+          <leafValues>
+            1.1009909957647324e-01 -1.5554140508174896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 -1.4754529729543719e-05</internalNodes>
+          <leafValues>
+            9.6549153327941895e-02 -1.3947430253028870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 1.5680169686675072e-02</internalNodes>
+          <leafValues>
+            2.3214520886540413e-02 -5.7713180780410767e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 1.2293360196053982e-02</internalNodes>
+          <leafValues>
+            -5.7809889316558838e-02 2.3951390385627747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 -9.6596255898475647e-03</internalNodes>
+          <leafValues>
+            2.4098740518093109e-01 -6.5823532640933990e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 4.4940081425011158e-03</internalNodes>
+          <leafValues>
+            5.4532490670681000e-02 -3.1474688649177551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 1.1480580084025860e-02</internalNodes>
+          <leafValues>
+            1.7419299110770226e-02 -7.4722832441329956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 -6.5499639511108398e-01</internalNodes>
+          <leafValues>
+            -4.5483970642089844e-01 2.6187120005488396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 -1.5746919962111861e-04</internalNodes>
+          <leafValues>
+            8.4341458976268768e-02 -1.8240310251712799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 -1.0111900046467781e-03</internalNodes>
+          <leafValues>
+            -2.0862899720668793e-01 6.7676216363906860e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 1.8488839268684387e-02</internalNodes>
+          <leafValues>
+            -3.5499621182680130e-02 4.1342151165008545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 -3.8888910785317421e-04</internalNodes>
+          <leafValues>
+            1.5692460536956787e-01 -8.6299479007720947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 -4.5315301977097988e-03</internalNodes>
+          <leafValues>
+            -4.3912211060523987e-01 3.4103620797395706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 3.3536020666360855e-02</internalNodes>
+          <leafValues>
+            -3.2231528311967850e-02 4.7096571326255798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 2.0854349713772535e-03</internalNodes>
+          <leafValues>
+            -7.6001010835170746e-02 1.7373880743980408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 -1.4060589819564484e-05</internalNodes>
+          <leafValues>
+            8.5960999131202698e-02 -1.6348780691623688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 4.2995680123567581e-02</internalNodes>
+          <leafValues>
+            2.2033119574189186e-02 -5.9274291992187500e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 2.4928380735218525e-03</internalNodes>
+          <leafValues>
+            -6.3020773231983185e-02 2.1398860216140747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 1.4520809600071516e-05</internalNodes>
+          <leafValues>
+            -1.1218129843473434e-01 1.1997319757938385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 2.1152360364794731e-02</internalNodes>
+          <leafValues>
+            3.0270710587501526e-02 -4.4600808620452881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 2.1028789342381060e-04</internalNodes>
+          <leafValues>
+            8.0384418368339539e-02 -1.7209020256996155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 1.0620340472087264e-03</internalNodes>
+          <leafValues>
+            -6.4051970839500427e-02 2.1304920315742493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 -2.5768030900508165e-03</internalNodes>
+          <leafValues>
+            -5.2309602499008179e-01 2.6146469637751579e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 4.7555579803884029e-03</internalNodes>
+          <leafValues>
+            3.6213729530572891e-02 -3.4408730268478394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 -5.9062540531158447e-01</internalNodes>
+          <leafValues>
+            -9.1701269149780273e-01 1.3416379690170288e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 -9.7031831741333008e-02</internalNodes>
+          <leafValues>
+            4.8288398981094360e-01 -3.2344181090593338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 1.4890159945935011e-03</internalNodes>
+          <leafValues>
+            4.0591750293970108e-02 -3.8898488879203796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 2.4702500086277723e-03</internalNodes>
+          <leafValues>
+            -6.3159219920635223e-02 2.1322609484195709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 -2.9705299530178308e-03</internalNodes>
+          <leafValues>
+            1.4960889518260956e-01 -1.0181649774312973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 1.5555499494075775e-01</internalNodes>
+          <leafValues>
+            3.6674879491329193e-02 -3.5983988642692566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 1.4113659970462322e-02</internalNodes>
+          <leafValues>
+            1.3834640383720398e-02 -8.7112957239151001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 -9.5594127196818590e-04</internalNodes>
+          <leafValues>
+            -2.2359329462051392e-01 5.5646751075983047e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>137</maxWeakCount>
+      <stageThreshold>-1.4971179962158203e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1113 2.3068320006132126e-02</internalNodes>
+          <leafValues>
+            -3.0734539031982422e-01 2.5758111476898193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 -1.1603030376136303e-02</internalNodes>
+          <leafValues>
+            1.7347939312458038e-01 -2.9917559027671814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 -1.0232869535684586e-03</internalNodes>
+          <leafValues>
+            1.9289019703865051e-01 -2.4926829338073730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 1.2194960378110409e-02</internalNodes>
+          <leafValues>
+            8.7591417133808136e-02 -4.0853890776634216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 -1.2484550243243575e-03</internalNodes>
+          <leafValues>
+            1.6345569491386414e-01 -1.8811899423599243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 3.2145460136234760e-04</internalNodes>
+          <leafValues>
+            7.9135909676551819e-02 -3.7722501158714294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -7.9707789700478315e-04</internalNodes>
+          <leafValues>
+            -2.6377388834953308e-01 9.6936263144016266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 7.0924922823905945e-02</internalNodes>
+          <leafValues>
+            -1.2538060545921326e-01 2.5267291069030762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 2.5408361107110977e-03</internalNodes>
+          <leafValues>
+            -1.3923250138759613e-01 1.4974319934844971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 -6.9253891706466675e-04</internalNodes>
+          <leafValues>
+            -3.1363919377326965e-01 3.9419740438461304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 2.5845640338957310e-03</internalNodes>
+          <leafValues>
+            -7.0067122578620911e-02 2.8096580505371094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 -1.6803950071334839e-02</internalNodes>
+          <leafValues>
+            -4.6254080533981323e-01 3.6509469151496887e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 -2.1332600153982639e-03</internalNodes>
+          <leafValues>
+            2.2691309452056885e-01 -8.4447480738162994e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -5.5397138930857182e-04</internalNodes>
+          <leafValues>
+            -2.0728160440921783e-01 1.0041700303554535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -1.4573110092896968e-05</internalNodes>
+          <leafValues>
+            8.8534340262413025e-02 -2.0813420414924622e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 8.0281507689505816e-04</internalNodes>
+          <leafValues>
+            -8.8521443307399750e-02 1.9553969800472260e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 3.6762449890375137e-03</internalNodes>
+          <leafValues>
+            -8.3966277539730072e-02 2.4232700467109680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 -1.6549570136703551e-04</internalNodes>
+          <leafValues>
+            -1.9402000308036804e-01 1.0044509917497635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 5.5225789546966553e-03</internalNodes>
+          <leafValues>
+            4.6014141291379929e-02 -4.1095688939094543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 1.1023939587175846e-03</internalNodes>
+          <leafValues>
+            -2.1053719520568848e-01 8.4169827401638031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 -2.1610360592603683e-02</internalNodes>
+          <leafValues>
+            -3.4724879264831543e-01 5.1196940243244171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 -1.4869699953123927e-05</internalNodes>
+          <leafValues>
+            1.1187150329351425e-01 -1.6249230504035950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 3.1727060675621033e-02</internalNodes>
+          <leafValues>
+            3.7546031177043915e-02 -4.5357111096382141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 -6.5588178113102913e-03</internalNodes>
+          <leafValues>
+            2.9756790399551392e-01 -6.1539310961961746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 3.7398359272629023e-03</internalNodes>
+          <leafValues>
+            -6.9362841546535492e-02 2.2881920635700226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 -2.1445790771394968e-03</internalNodes>
+          <leafValues>
+            -3.0691981315612793e-01 5.7085540145635605e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 1.4241340104490519e-03</internalNodes>
+          <leafValues>
+            4.7747720032930374e-02 -3.5141488909721375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 1.8902820302173495e-03</internalNodes>
+          <leafValues>
+            1.1250650137662888e-01 -1.5074999630451202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 -6.4917900599539280e-03</internalNodes>
+          <leafValues>
+            2.8712779283523560e-01 -6.2573678791522980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 -8.7750004604458809e-03</internalNodes>
+          <leafValues>
+            -5.4141241312026978e-01 2.9559530317783356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 9.3647688627243042e-02</internalNodes>
+          <leafValues>
+            -5.6943789124488831e-02 2.9638379812240601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 -4.4028809497831389e-05</internalNodes>
+          <leafValues>
+            1.0726290196180344e-01 -1.5169329941272736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 7.9690842540003359e-05</internalNodes>
+          <leafValues>
+            8.7704338133335114e-02 -1.8157640099525452e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -6.6510448232293129e-03</internalNodes>
+          <leafValues>
+            2.1250769495964050e-01 -7.8765399754047394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 2.1358320116996765e-01</internalNodes>
+          <leafValues>
+            3.2704930752515793e-02 -4.9895349144935608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 -9.8035410046577454e-02</internalNodes>
+          <leafValues>
+            -6.3620072603225708e-01 2.4300750344991684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 -3.6894609220325947e-03</internalNodes>
+          <leafValues>
+            -5.7873171567916870e-01 2.5343220680952072e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 4.7867568209767342e-03</internalNodes>
+          <leafValues>
+            -6.9719798862934113e-02 2.4641029536724091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 4.0250780875794590e-04</internalNodes>
+          <leafValues>
+            -1.1852599680423737e-01 1.7163689434528351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 -3.8258030544966459e-03</internalNodes>
+          <leafValues>
+            -3.1708711385726929e-01 5.2796650677919388e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 2.9255099434521981e-05</internalNodes>
+          <leafValues>
+            -1.2157870084047318e-01 1.2443509697914124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -5.5969221284613013e-04</internalNodes>
+          <leafValues>
+            -2.3942449688911438e-01 6.1564020812511444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 1.6149280127137899e-03</internalNodes>
+          <leafValues>
+            -8.9536681771278381e-02 1.9396179914474487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -5.9165759012103081e-03</internalNodes>
+          <leafValues>
+            -6.0741347074508667e-01 2.4107500910758972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 4.5592039823532104e-03</internalNodes>
+          <leafValues>
+            -5.4090119898319244e-02 2.8721129894256592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 -5.1767788827419281e-02</internalNodes>
+          <leafValues>
+            -6.4853471517562866e-01 2.4329099804162979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 -1.0635569691658020e-02</internalNodes>
+          <leafValues>
+            3.2359760999679565e-01 -5.0231788307428360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 2.5121110957115889e-04</internalNodes>
+          <leafValues>
+            9.5274448394775391e-02 -1.4859940111637115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 1.3107099803164601e-03</internalNodes>
+          <leafValues>
+            -1.1612690240144730e-01 1.2647250294685364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 -7.3629721999168396e-02</internalNodes>
+          <leafValues>
+            -6.2977832555770874e-01 2.4197410792112350e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 5.1864539273083210e-04</internalNodes>
+          <leafValues>
+            8.0843970179557800e-02 -1.8038350343704224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 -2.0541099365800619e-03</internalNodes>
+          <leafValues>
+            2.0690770447254181e-01 -7.1559637784957886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 -7.2738518938422203e-03</internalNodes>
+          <leafValues>
+            -1.8049220740795135e-01 8.4618158638477325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 -7.0418710820376873e-03</internalNodes>
+          <leafValues>
+            -5.5255848169326782e-01 2.4243000894784927e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 2.3678881116211414e-03</internalNodes>
+          <leafValues>
+            -7.4315063655376434e-02 2.2013199329376221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 -4.1341409087181091e-03</internalNodes>
+          <leafValues>
+            -3.1461110711097717e-01 5.7645540684461594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 5.9597631916403770e-03</internalNodes>
+          <leafValues>
+            2.1551210433244705e-02 -6.6399222612380981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 -1.4643320355389733e-05</internalNodes>
+          <leafValues>
+            1.0325399786233902e-01 -1.4378640055656433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 -8.0324069131165743e-04</internalNodes>
+          <leafValues>
+            -2.8026849031448364e-01 5.2175540477037430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 -1.7860220745205879e-02</internalNodes>
+          <leafValues>
+            3.1547638773918152e-01 -4.7295480966567993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 8.5229711839929223e-04</internalNodes>
+          <leafValues>
+            -1.0860790312290192e-01 1.6905729472637177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 8.8618341833353043e-03</internalNodes>
+          <leafValues>
+            2.0629420876502991e-02 -7.1686798334121704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 4.1418620385229588e-03</internalNodes>
+          <leafValues>
+            3.1313210725784302e-02 -3.9753648638725281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 -9.6616581082344055e-02</internalNodes>
+          <leafValues>
+            4.2378899455070496e-01 -3.2291099429130554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 -8.4853649139404297e-02</internalNodes>
+          <leafValues>
+            -4.8360210657119751e-01 3.4420508891344070e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 -2.7399489656090736e-02</internalNodes>
+          <leafValues>
+            -2.8981518745422363e-01 4.6805508434772491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1179 1.9653420895338058e-03</internalNodes>
+          <leafValues>
+            -7.6221130788326263e-02 1.8894240260124207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 -9.0222749859094620e-03</internalNodes>
+          <leafValues>
+            -5.8255058526992798e-01 2.6038780808448792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 1.7859010398387909e-01</internalNodes>
+          <leafValues>
+            1.4113079756498337e-02 -7.5876772403717041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 2.6170860510319471e-03</internalNodes>
+          <leafValues>
+            -4.2011409997940063e-02 3.4582638740539551e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 -1.8247140105813742e-03</internalNodes>
+          <leafValues>
+            -2.5125750899314880e-01 5.4113451391458511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 1.0635840008035302e-03</internalNodes>
+          <leafValues>
+            -6.9988057017326355e-02 2.1111090481281281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 -8.5794121026992798e-02</internalNodes>
+          <leafValues>
+            -5.2950221300125122e-01 2.4234309792518616e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -2.4844249710440636e-03</internalNodes>
+          <leafValues>
+            2.2798889875411987e-01 -5.7894941419363022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 2.4517390411347151e-03</internalNodes>
+          <leafValues>
+            4.7758270055055618e-02 -2.9931840300559998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 7.2088139131665230e-03</internalNodes>
+          <leafValues>
+            8.9190460741519928e-02 -1.4663650095462799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 -6.0728411190211773e-03</internalNodes>
+          <leafValues>
+            2.9773110151290894e-01 -4.4187791645526886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 2.9379719868302345e-02</internalNodes>
+          <leafValues>
+            1.8384920433163643e-02 -7.2799599170684814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 3.5265460610389709e-02</internalNodes>
+          <leafValues>
+            -4.0345128625631332e-02 3.4369349479675293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 8.0668088048696518e-04</internalNodes>
+          <leafValues>
+            -1.0171490162611008e-01 1.3324069976806641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 -1.4964640140533447e-03</internalNodes>
+          <leafValues>
+            -2.3296439647674561e-01 5.9193279594182968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 2.6136979460716248e-02</internalNodes>
+          <leafValues>
+            1.7993519082665443e-02 -7.3094600439071655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 1.8663259223103523e-02</internalNodes>
+          <leafValues>
+            1.4693800359964371e-02 -7.2105181217193604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 -5.0944439863087609e-05</internalNodes>
+          <leafValues>
+            9.8113812506198883e-02 -1.3487009704113007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 -5.5268028518185019e-04</internalNodes>
+          <leafValues>
+            -1.1313900351524353e-01 1.1931320279836655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 5.4916120134294033e-03</internalNodes>
+          <leafValues>
+            -6.8996928632259369e-02 2.2312630712985992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 3.1243199482560158e-02</internalNodes>
+          <leafValues>
+            -3.2394438982009888e-02 3.9250150322914124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 2.7375440113246441e-03</internalNodes>
+          <leafValues>
+            3.6713510751724243e-02 -4.0632349252700806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 9.0960890054702759e-02</internalNodes>
+          <leafValues>
+            2.7709199115633965e-02 -4.1612899303436279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 -4.2210621177218854e-04</internalNodes>
+          <leafValues>
+            -1.5993569791316986e-01 7.8440353274345398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 -2.3689800873398781e-03</internalNodes>
+          <leafValues>
+            1.4372199773788452e-01 -9.0417243540287018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 4.5116269029676914e-03</internalNodes>
+          <leafValues>
+            -6.8068206310272217e-02 2.1011069416999817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 -1.4441140228882432e-03</internalNodes>
+          <leafValues>
+            -1.3376539945602417e-01 1.1816109716892242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 2.1477979607880116e-03</internalNodes>
+          <leafValues>
+            -9.8067082464694977e-02 1.7571650445461273e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 2.2534599527716637e-02</internalNodes>
+          <leafValues>
+            5.3246740251779556e-02 -2.8085210919380188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 -1.6165290027856827e-02</internalNodes>
+          <leafValues>
+            2.6058629155158997e-01 -5.6349318474531174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 1.3157909736037254e-02</internalNodes>
+          <leafValues>
+            4.4960599392652512e-02 -3.1084328889846802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 -2.5218630209565163e-02</internalNodes>
+          <leafValues>
+            -1.2245389819145203e-01 1.1707650125026703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 -1.0043029760709032e-04</internalNodes>
+          <leafValues>
+            6.2668606638908386e-02 -2.3665410280227661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 2.2884309291839600e-02</internalNodes>
+          <leafValues>
+            -5.6393388658761978e-02 2.6951891183853149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 -3.7653960753232241e-03</internalNodes>
+          <leafValues>
+            2.4265049397945404e-01 -6.0327839106321335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 -1.2131360126659274e-03</internalNodes>
+          <leafValues>
+            -2.2581340372562408e-01 6.3866272568702698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 3.6897920072078705e-03</internalNodes>
+          <leafValues>
+            -7.5056307017803192e-02 1.7121140658855438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 3.9484380977228284e-04</internalNodes>
+          <leafValues>
+            7.2925560176372528e-02 -1.8006080389022827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 -2.8756330721080303e-03</internalNodes>
+          <leafValues>
+            2.3332679271697998e-01 -5.8312799781560898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 -1.2939549982547760e-02</internalNodes>
+          <leafValues>
+            -5.9966820478439331e-01 2.4746209383010864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 4.8920139670372009e-03</internalNodes>
+          <leafValues>
+            -5.0808548927307129e-02 2.7142828702926636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -6.3685458153486252e-03</internalNodes>
+          <leafValues>
+            -1.7759549617767334e-01 7.8720703721046448e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 9.1700062155723572e-02</internalNodes>
+          <leafValues>
+            -2.4316219612956047e-02 5.6610620021820068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 -2.9075080528855324e-03</internalNodes>
+          <leafValues>
+            -5.3473442792892456e-01 2.6738349348306656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 -3.9782752282917500e-03</internalNodes>
+          <leafValues>
+            1.7898949980735779e-01 -7.3634162545204163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 3.8189089391380548e-03</internalNodes>
+          <leafValues>
+            9.6640147268772125e-02 -1.2615419924259186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 -6.1400169506669044e-03</internalNodes>
+          <leafValues>
+            -2.8025910258293152e-01 4.8952069133520126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 4.6048378571867943e-03</internalNodes>
+          <leafValues>
+            -3.5297919064760208e-02 3.6271721124649048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 6.9598153233528137e-02</internalNodes>
+          <leafValues>
+            2.8236450627446175e-02 -4.7523179650306702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 8.2954921526834369e-04</internalNodes>
+          <leafValues>
+            6.5010666847229004e-02 -1.9608500599861145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 1.0073450393974781e-02</internalNodes>
+          <leafValues>
+            2.4091430008411407e-02 -5.2702528238296509e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 -4.9964170902967453e-02</internalNodes>
+          <leafValues>
+            2.7060431241989136e-01 -5.2939768880605698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 -2.3425720632076263e-02</internalNodes>
+          <leafValues>
+            -6.5538042783737183e-01 2.0399950444698334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 4.5370758743956685e-04</internalNodes>
+          <leafValues>
+            -1.0145729780197144e-01 1.2575489282608032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 -9.4329239800572395e-04</internalNodes>
+          <leafValues>
+            -2.3677830398082733e-01 5.2147369831800461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 -2.5503130163997412e-03</internalNodes>
+          <leafValues>
+            1.8695800006389618e-01 -6.4383536577224731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 -2.1031149663031101e-03</internalNodes>
+          <leafValues>
+            -4.0381109714508057e-01 2.8763780370354652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 2.3942890111356974e-03</internalNodes>
+          <leafValues>
+            -5.8961909264326096e-02 2.0151209831237793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 3.4859919105656445e-04</internalNodes>
+          <leafValues>
+            -1.1594740301370621e-01 1.1559849977493286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 6.5279641421511769e-04</internalNodes>
+          <leafValues>
+            -9.6583247184753418e-02 1.4546130597591400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 6.6208152566105127e-04</internalNodes>
+          <leafValues>
+            5.5666640400886536e-02 -2.3408170044422150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 -1.1246719956398010e-01</internalNodes>
+          <leafValues>
+            -7.2129100561141968e-01 1.6700809821486473e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 2.4760260712355375e-03</internalNodes>
+          <leafValues>
+            -7.0752441883087158e-02 1.6832010447978973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 -8.7723489850759506e-03</internalNodes>
+          <leafValues>
+            -4.8666760325431824e-01 2.6006119325757027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 2.8840279206633568e-02</internalNodes>
+          <leafValues>
+            3.3308699727058411e-02 -3.4549170732498169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 4.7115320921875536e-04</internalNodes>
+          <leafValues>
+            5.8610469102859497e-02 -2.1334120631217957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 -7.5157210230827332e-03</internalNodes>
+          <leafValues>
+            3.7866720557212830e-01 -3.6307640373706818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1246 -1.7479779489804059e-04</internalNodes>
+          <leafValues>
+            -1.8687920272350311e-01 7.0380441844463348e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 6.9826189428567886e-03</internalNodes>
+          <leafValues>
+            -7.5376212596893311e-02 1.8541449308395386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 -2.5053499266505241e-03</internalNodes>
+          <leafValues>
+            -4.7345471382141113e-01 2.6765290647745132e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 6.5240712137892842e-04</internalNodes>
+          <leafValues>
+            -1.1398679763078690e-01 1.1460109800100327e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>153</maxWeakCount>
+      <stageThreshold>-1.5120370388031006e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1250 2.7968829497694969e-02</internalNodes>
+          <leafValues>
+            -2.4054290354251862e-01 3.3976718783378601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 4.7484100796282291e-03</internalNodes>
+          <leafValues>
+            -1.8598410487174988e-01 2.6523759961128235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -9.6774380654096603e-03</internalNodes>
+          <leafValues>
+            1.3574579358100891e-01 -3.1734740734100342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 1.0649940231814981e-03</internalNodes>
+          <leafValues>
+            -5.0356131792068481e-01 7.0383183658123016e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 3.0151519458740950e-03</internalNodes>
+          <leafValues>
+            -1.7585769295692444e-01 1.6750140488147736e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 7.6821137918159366e-04</internalNodes>
+          <leafValues>
+            -2.3158560693264008e-01 1.2748460471630096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 -5.6622780859470367e-02</internalNodes>
+          <leafValues>
+            3.0103230476379395e-01 -1.1525429785251617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 4.7889677807688713e-03</internalNodes>
+          <leafValues>
+            -6.8797349929809570e-02 3.5774651169776917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 3.7908130325376987e-03</internalNodes>
+          <leafValues>
+            1.1250580102205276e-01 -2.3389840126037598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 -3.6302749067544937e-03</internalNodes>
+          <leafValues>
+            -2.7425950765609741e-01 6.0180071741342545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 1.4986160211265087e-02</internalNodes>
+          <leafValues>
+            5.8370150625705719e-02 -3.5088211297988892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 6.1338639352470636e-04</internalNodes>
+          <leafValues>
+            -1.0045500099658966e-01 1.8004140257835388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 1.7827099654823542e-03</internalNodes>
+          <leafValues>
+            -5.8504570275545120e-02 2.8165730834007263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 1.0279649868607521e-03</internalNodes>
+          <leafValues>
+            4.6049151569604874e-02 -4.1633561253547668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 -1.4470520000031684e-05</internalNodes>
+          <leafValues>
+            9.7594477236270905e-02 -1.7005239427089691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 7.2919862577691674e-04</internalNodes>
+          <leafValues>
+            -8.9277692139148712e-02 1.9683800637722015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 -1.2752750189974904e-03</internalNodes>
+          <leafValues>
+            -2.1324349939823151e-01 7.7781319618225098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 2.7510570362210274e-02</internalNodes>
+          <leafValues>
+            9.8059087991714478e-02 -1.8463979661464691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 3.9082998409867287e-03</internalNodes>
+          <leafValues>
+            -9.8240077495574951e-02 1.7902830243110657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 2.8285238659009337e-04</internalNodes>
+          <leafValues>
+            6.4882382750511169e-02 -2.5903809070587158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 5.8698928914964199e-03</internalNodes>
+          <leafValues>
+            -4.8436500132083893e-02 3.5584059357643127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 5.2106438670307398e-04</internalNodes>
+          <leafValues>
+            6.4200893044471741e-02 -2.4268729984760284e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 -3.8013618905097246e-03</internalNodes>
+          <leafValues>
+            3.1349530816078186e-01 -4.9372490495443344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 -3.5830549895763397e-03</internalNodes>
+          <leafValues>
+            -1.9015640020370483e-01 8.5928887128829956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 7.3326388373970985e-03</internalNodes>
+          <leafValues>
+            -8.7244078516960144e-02 1.8596029281616211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 6.8118958733975887e-04</internalNodes>
+          <leafValues>
+            9.0353183448314667e-02 -1.7380879819393158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 -2.4127468932420015e-03</internalNodes>
+          <leafValues>
+            2.6583871245384216e-01 -6.2018260359764099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 4.4389287941157818e-03</internalNodes>
+          <leafValues>
+            3.8672439754009247e-02 -4.4039198756217957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 2.9394390367087908e-05</internalNodes>
+          <leafValues>
+            -1.3116660714149475e-01 1.2389960139989853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 5.2613918669521809e-03</internalNodes>
+          <leafValues>
+            -5.4326139390468597e-02 3.1434679031372070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 2.3712380789220333e-03</internalNodes>
+          <leafValues>
+            3.5234931856393814e-02 -4.5936021208763123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 -2.4774149060249329e-03</internalNodes>
+          <leafValues>
+            -3.2579651474952698e-01 4.1676308959722519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 5.1308068213984370e-04</internalNodes>
+          <leafValues>
+            -9.8032839596271515e-02 1.5209600329399109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1283 -7.6761870877817273e-04</internalNodes>
+          <leafValues>
+            -2.0944289863109589e-01 6.9563657045364380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 4.1551832109689713e-03</internalNodes>
+          <leafValues>
+            -5.9142418205738068e-02 2.4788859486579895e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 1.4315149746835232e-02</internalNodes>
+          <leafValues>
+            2.4713350459933281e-02 -6.2663692235946655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 8.9347898028790951e-04</internalNodes>
+          <leafValues>
+            -1.3387380540370941e-01 1.0626660287380219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 -5.8425782481208444e-04</internalNodes>
+          <leafValues>
+            -2.1583810448646545e-01 6.7552872002124786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 8.9712149929255247e-04</internalNodes>
+          <leafValues>
+            -1.5998089313507080e-01 9.6859596669673920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 -4.4576660729944706e-03</internalNodes>
+          <leafValues>
+            -4.6839779615402222e-01 3.4481108188629150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 1.6316650435328484e-02</internalNodes>
+          <leafValues>
+            1.6176480799913406e-02 -7.6990699768066406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 -1.9581869710236788e-03</internalNodes>
+          <leafValues>
+            2.3423190414905548e-01 -6.3605003058910370e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 2.9628631472587585e-01</internalNodes>
+          <leafValues>
+            3.8007281720638275e-02 -3.8991358876228333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 -9.1676972806453705e-04</internalNodes>
+          <leafValues>
+            1.2086489796638489e-01 -1.0912480205297470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 -2.5543299852870405e-04</internalNodes>
+          <leafValues>
+            -1.8755780160427094e-01 7.1104221045970917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 8.2945115864276886e-03</internalNodes>
+          <leafValues>
+            -3.9912570267915726e-02 3.3551681041717529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 -5.8387689292430878e-02</internalNodes>
+          <leafValues>
+            -3.3475118875503540e-01 4.1011139750480652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1297 1.0927469702437520e-03</internalNodes>
+          <leafValues>
+            -8.3243489265441895e-02 1.6046769917011261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 1.0653319768607616e-03</internalNodes>
+          <leafValues>
+            -1.1920040100812912e-01 1.0561779886484146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 -3.5323720425367355e-02</internalNodes>
+          <leafValues>
+            2.8399449586868286e-01 -4.7650910913944244e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 6.7976478021591902e-04</internalNodes>
+          <leafValues>
+            5.9223521500825882e-02 -2.2741270065307617e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 -2.4810519069433212e-02</internalNodes>
+          <leafValues>
+            -6.5788549184799194e-01 1.8828939646482468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 4.5880349352955818e-03</internalNodes>
+          <leafValues>
+            -5.0799869000911713e-02 2.6886260509490967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 3.9034360088407993e-03</internalNodes>
+          <leafValues>
+            -5.9183020144701004e-02 2.2644530236721039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 1.2360659986734390e-01</internalNodes>
+          <leafValues>
+            2.2052299231290817e-02 -6.7844098806381226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 -3.7856408744119108e-04</internalNodes>
+          <leafValues>
+            -2.1715499460697174e-01 5.7522300630807877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 2.8562229126691818e-02</internalNodes>
+          <leafValues>
+            -3.4095268696546555e-02 4.2474791407585144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 2.2348840720951557e-03</internalNodes>
+          <leafValues>
+            -3.5655528306961060e-02 3.5050040483474731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 1.9211059436202049e-02</internalNodes>
+          <leafValues>
+            2.5078350678086281e-02 -5.9314918518066406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 1.5611639618873596e-01</internalNodes>
+          <leafValues>
+            2.3612640798091888e-02 -4.8740550875663757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 -1.2261980446055532e-03</internalNodes>
+          <leafValues>
+            -3.0421718955039978e-01 3.9526391774415970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 3.6561759188771248e-03</internalNodes>
+          <leafValues>
+            -7.7627539634704590e-02 2.0262609422206879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 1.1567790061235428e-03</internalNodes>
+          <leafValues>
+            5.5682398378849030e-02 -2.4368490278720856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 6.2764538452029228e-03</internalNodes>
+          <leafValues>
+            -6.4452603459358215e-02 2.1183019876480103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 1.2091239914298058e-02</internalNodes>
+          <leafValues>
+            2.0667979493737221e-02 -6.2231677770614624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 3.7568950210697949e-04</internalNodes>
+          <leafValues>
+            7.3670476675033569e-02 -1.7809109389781952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 3.8157668896019459e-03</internalNodes>
+          <leafValues>
+            3.3845711499452591e-02 -3.6262959241867065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 -1.3252210337668657e-03</internalNodes>
+          <leafValues>
+            1.4732490479946136e-01 -8.1727422773838043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 2.1575710270553827e-03</internalNodes>
+          <leafValues>
+            -6.8624198436737061e-02 1.7562319338321686e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 -6.4548188820481300e-03</internalNodes>
+          <leafValues>
+            -5.8159267902374268e-01 2.3020049557089806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 -8.1042833626270294e-03</internalNodes>
+          <leafValues>
+            -3.5549208521842957e-01 3.5372331738471985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 1.6489460540469736e-04</internalNodes>
+          <leafValues>
+            7.4472688138484955e-02 -1.5718360245227814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 -1.9494029693305492e-03</internalNodes>
+          <leafValues>
+            3.5157081484794617e-01 -3.6213818937540054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 -1.5267659910023212e-04</internalNodes>
+          <leafValues>
+            -1.4115719497203827e-01 8.4802761673927307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 2.3890420794487000e-02</internalNodes>
+          <leafValues>
+            1.9317669793963432e-02 -6.3186031579971313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 -4.4950367882847786e-03</internalNodes>
+          <leafValues>
+            2.1254129707813263e-01 -5.9143088757991791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 2.8725271113216877e-03</internalNodes>
+          <leafValues>
+            3.2794039696455002e-02 -3.9505231380462646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 2.0885460544377565e-03</internalNodes>
+          <leafValues>
+            -8.5443787276744843e-02 1.4347669482231140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 -4.4343829154968262e-01</internalNodes>
+          <leafValues>
+            -4.0052318572998047e-01 2.9428049921989441e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 2.0199170336127281e-02</internalNodes>
+          <leafValues>
+            4.0000550448894501e-02 -3.1763339042663574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 1.4570879749953747e-02</internalNodes>
+          <leafValues>
+            1.3662800192832947e-02 -8.6441951990127563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 -3.8080150261521339e-03</internalNodes>
+          <leafValues>
+            4.0930721163749695e-01 -3.3838968724012375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 1.0009920224547386e-03</internalNodes>
+          <leafValues>
+            -8.2600250840187073e-02 1.3928790390491486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 1.1500980472192168e-03</internalNodes>
+          <leafValues>
+            6.9677546620368958e-02 -1.7433060705661774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 3.4720861003734171e-04</internalNodes>
+          <leafValues>
+            6.6659383475780487e-02 -1.7403809726238251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 2.7565560303628445e-03</internalNodes>
+          <leafValues>
+            -2.9285680502653122e-02 4.0243569016456604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 -2.4124220013618469e-02</internalNodes>
+          <leafValues>
+            -3.2424208521842957e-01 3.7330508232116699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 -1.3989120721817017e-01</internalNodes>
+          <leafValues>
+            -6.5967488288879395e-01 1.7929619178175926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 3.0997680500149727e-02</internalNodes>
+          <leafValues>
+            1.4100589789450169e-02 -6.9532638788223267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 4.6191760338842869e-04</internalNodes>
+          <leafValues>
+            -6.7944146692752838e-02 1.8066139519214630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 3.4264490008354187e-02</internalNodes>
+          <leafValues>
+            2.2298639640212059e-02 -5.8638918399810791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 3.9756381884217262e-03</internalNodes>
+          <leafValues>
+            -4.1803721338510513e-02 3.1669101119041443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 -3.4192908788099885e-04</internalNodes>
+          <leafValues>
+            -1.5810790657997131e-01 7.7484056353569031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 7.1672953665256500e-02</internalNodes>
+          <leafValues>
+            -2.3302769288420677e-02 5.2465027570724487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 7.1812322130426764e-04</internalNodes>
+          <leafValues>
+            4.8268780112266541e-02 -2.7771729230880737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 -1.8881190335378051e-03</internalNodes>
+          <leafValues>
+            8.3184987306594849e-02 -1.4802010357379913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 -1.2498029973357916e-03</internalNodes>
+          <leafValues>
+            2.5329118967056274e-01 -4.9769390374422073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 -1.2756100296974182e-01</internalNodes>
+          <leafValues>
+            -6.7970567941665649e-01 2.0871700718998909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 -1.4621549780713394e-05</internalNodes>
+          <leafValues>
+            7.9338513314723969e-02 -1.5043739974498749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 3.5788679961115122e-03</internalNodes>
+          <leafValues>
+            -5.5469110608100891e-02 2.4075509607791901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 9.4902152195572853e-03</internalNodes>
+          <leafValues>
+            2.8637239709496498e-02 -5.3680288791656494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 1.0283050127327442e-02</internalNodes>
+          <leafValues>
+            1.1550529859960079e-02 -7.7501267194747925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1352 -4.2507290840148926e-02</internalNodes>
+          <leafValues>
+            -8.8770490884780884e-01 9.7261751070618629e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 3.6155930138193071e-04</internalNodes>
+          <leafValues>
+            6.4407013356685638e-02 -1.7109510302543640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 -3.4245628863573074e-02</internalNodes>
+          <leafValues>
+            2.4231609702110291e-01 -4.7188870608806610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 -1.2806710600852966e-01</internalNodes>
+          <leafValues>
+            -5.4869401454925537e-01 2.1854300051927567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 5.3918339312076569e-02</internalNodes>
+          <leafValues>
+            -2.5415059179067612e-02 4.8263218998908997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 -3.7711810320615768e-02</internalNodes>
+          <leafValues>
+            1.4176939427852631e-01 -8.8871710002422333e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1358 -2.8310909867286682e-01</internalNodes>
+          <leafValues>
+            -6.4925712347030640e-01 2.0563820376992226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 -1.1926019564270973e-02</internalNodes>
+          <leafValues>
+            -2.1756759285926819e-01 5.1851660013198853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 3.7750680348835886e-04</internalNodes>
+          <leafValues>
+            7.2340622544288635e-02 -1.6360169649124146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 1.5865910798311234e-02</internalNodes>
+          <leafValues>
+            -7.9940237104892731e-02 1.6453659534454346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 7.1175709366798401e-02</internalNodes>
+          <leafValues>
+            3.1589020043611526e-02 -4.1988191008567810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 5.8520520105957985e-03</internalNodes>
+          <leafValues>
+            2.3279080167412758e-02 -4.8604270815849304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 -1.3924130471423268e-03</internalNodes>
+          <leafValues>
+            1.6908380389213562e-01 -7.3783926665782928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 -1.8412459758110344e-04</internalNodes>
+          <leafValues>
+            1.2232059985399246e-01 -1.0313989967107773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 2.2130980505608022e-04</internalNodes>
+          <leafValues>
+            -8.1976376473903656e-02 1.6332870721817017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 2.0723740453831851e-04</internalNodes>
+          <leafValues>
+            9.2730201780796051e-02 -1.3733580708503723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1368 -3.8736319402232766e-04</internalNodes>
+          <leafValues>
+            -2.0004619657993317e-01 8.4838382899761200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 3.2468559220433235e-03</internalNodes>
+          <leafValues>
+            -5.6439258158206940e-02 2.2364979982376099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 9.3086768174543977e-04</internalNodes>
+          <leafValues>
+            3.1926579773426056e-02 -3.9701279997825623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 1.0306099429726601e-03</internalNodes>
+          <leafValues>
+            -6.0154888778924942e-02 2.0189760625362396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 -7.6027261093258858e-04</internalNodes>
+          <leafValues>
+            1.4901119470596313e-01 -9.9665373563766479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 -4.0442569297738373e-04</internalNodes>
+          <leafValues>
+            -1.9113409519195557e-01 7.4125148355960846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 -4.7783120535314083e-03</internalNodes>
+          <leafValues>
+            -3.5730269551277161e-01 3.6531679332256317e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 -7.7672587940469384e-04</internalNodes>
+          <leafValues>
+            1.0242869704961777e-01 -1.2974999845027924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 -5.7417969219386578e-03</internalNodes>
+          <leafValues>
+            -1.6698950529098511e-01 7.0111282169818878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 -1.0879320092499256e-02</internalNodes>
+          <leafValues>
+            4.4120571017265320e-01 -2.9255589470267296e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 6.4163492061197758e-04</internalNodes>
+          <leafValues>
+            -1.1195279657840729e-01 1.0681179910898209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 1.8341830000281334e-02</internalNodes>
+          <leafValues>
+            1.6387680172920227e-01 -8.0189116299152374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 -1.5051739756017923e-03</internalNodes>
+          <leafValues>
+            -2.2313259541988373e-01 6.1541710048913956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 4.4345208443701267e-03</internalNodes>
+          <leafValues>
+            -6.6646136343479156e-02 2.2299060225486755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 -1.4749550246051513e-05</internalNodes>
+          <leafValues>
+            1.1597889661788940e-01 -1.0377810150384903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -2.6539659593254328e-03</internalNodes>
+          <leafValues>
+            1.3116030395030975e-01 -8.6488783359527588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 2.7743550017476082e-03</internalNodes>
+          <leafValues>
+            4.1064068675041199e-02 -3.1225061416625977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 1.1590829817578197e-03</internalNodes>
+          <leafValues>
+            6.4309477806091309e-02 -1.7413079738616943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 9.2315068468451500e-04</internalNodes>
+          <leafValues>
+            -8.2974001765251160e-02 1.4439080655574799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 -8.2323597744107246e-03</internalNodes>
+          <leafValues>
+            3.0380389094352722e-01 -4.1229110211133957e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 3.5314110573381186e-03</internalNodes>
+          <leafValues>
+            3.9511259645223618e-02 -3.3097168803215027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 5.7490761391818523e-03</internalNodes>
+          <leafValues>
+            1.9821660593152046e-02 -5.8780592679977417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 7.8584970906376839e-03</internalNodes>
+          <leafValues>
+            -4.9952238798141479e-02 2.7249589562416077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 -1.4245980310079176e-05</internalNodes>
+          <leafValues>
+            8.8010340929031372e-02 -1.3228349387645721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 6.9364177761599422e-04</internalNodes>
+          <leafValues>
+            -6.7391887307167053e-02 1.7463630437850952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 -2.9837749898433685e-02</internalNodes>
+          <leafValues>
+            -5.1709812879562378e-01 2.4871410802006721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1394 7.1383598260581493e-03</internalNodes>
+          <leafValues>
+            6.7430503666400909e-02 -1.9037249684333801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 1.7582569271326065e-02</internalNodes>
+          <leafValues>
+            -3.6622371524572372e-02 3.5335469245910645e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 -1.2527840444818139e-03</internalNodes>
+          <leafValues>
+            -2.1730649471282959e-01 6.1200018972158432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 7.4575009057298303e-04</internalNodes>
+          <leafValues>
+            -6.4467661082744598e-02 1.9775040447711945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 -7.2683871258050203e-04</internalNodes>
+          <leafValues>
+            -1.7233370244503021e-01 7.1719951927661896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 2.6301289908587933e-03</internalNodes>
+          <leafValues>
+            -3.9274338632822037e-02 3.3066290616989136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 -1.4553769688063767e-05</internalNodes>
+          <leafValues>
+            7.9698577523231506e-02 -1.7852419614791870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 -4.5518940896727145e-04</internalNodes>
+          <leafValues>
+            -1.6662250459194183e-01 7.5660362839698792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 -4.0261688991449773e-04</internalNodes>
+          <leafValues>
+            -1.4214369654655457e-01 8.1017293035984039e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>161</maxWeakCount>
+      <stageThreshold>-1.4741109609603882e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1403 -8.3439666777849197e-03</internalNodes>
+          <leafValues>
+            3.1942158937454224e-01 -2.6766449213027954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 7.8073277836665511e-04</internalNodes>
+          <leafValues>
+            -3.4852638840675354e-01 1.3628880679607391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1405 8.6505862418562174e-04</internalNodes>
+          <leafValues>
+            -2.5323680043220520e-01 1.7417639493942261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 -2.0879819930996746e-04</internalNodes>
+          <leafValues>
+            8.8503703474998474e-02 -3.6038509011268616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 -7.4667241424322128e-03</internalNodes>
+          <leafValues>
+            1.6120630502700806e-01 -1.7366449534893036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 -6.9383758818730712e-04</internalNodes>
+          <leafValues>
+            9.6873007714748383e-02 -2.6793479919433594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 -4.7926991101121530e-05</internalNodes>
+          <leafValues>
+            9.1756246984004974e-02 -2.6212221384048462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 -1.5861799474805593e-03</internalNodes>
+          <leafValues>
+            -6.1400872468948364e-01 -7.4168378487229347e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 4.4573731429409236e-05</internalNodes>
+          <leafValues>
+            -1.4841860532760620e-01 1.3855740427970886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 5.0104141701012850e-04</internalNodes>
+          <leafValues>
+            5.9088941663503647e-02 -2.9596069455146790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 -4.7243628650903702e-03</internalNodes>
+          <leafValues>
+            1.7092029750347137e-01 -1.0624700039625168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 3.9171050302684307e-03</internalNodes>
+          <leafValues>
+            8.8605202734470367e-02 -2.2775200009346008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 8.8675727602094412e-04</internalNodes>
+          <leafValues>
+            -1.6839639842510223e-01 1.1958680301904678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 -4.2634559795260429e-03</internalNodes>
+          <leafValues>
+            -3.3663240075111389e-01 4.7266270965337753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 6.8006501533091068e-03</internalNodes>
+          <leafValues>
+            -5.9237081557512283e-02 3.1675300002098083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 -1.3168989680707455e-02</internalNodes>
+          <leafValues>
+            3.7162569165229797e-01 -4.2714890092611313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 7.3881301796063781e-04</internalNodes>
+          <leafValues>
+            5.9158101677894592e-02 -3.0953711271286011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 1.7939460230991244e-03</internalNodes>
+          <leafValues>
+            -8.4615282714366913e-02 2.0452530682086945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 1.6819390002638102e-03</internalNodes>
+          <leafValues>
+            -8.6703762412071228e-02 2.0580549538135529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 -2.5033599231392145e-03</internalNodes>
+          <leafValues>
+            -4.3473190069198608e-01 3.8707830011844635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 3.3658559550531209e-04</internalNodes>
+          <leafValues>
+            -1.0717310011386871e-01 1.5238380432128906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 1.3037879951298237e-02</internalNodes>
+          <leafValues>
+            4.4682659208774567e-02 -4.0395650267601013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 1.3743729505222291e-04</internalNodes>
+          <leafValues>
+            -2.1432510018348694e-01 6.8643413484096527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 3.7178888916969299e-01</internalNodes>
+          <leafValues>
+            3.4502930939197540e-02 -4.5998379588127136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -7.1649150922894478e-03</internalNodes>
+          <leafValues>
+            2.6640880107879639e-01 -5.4557949304580688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 -7.1985478280112147e-04</internalNodes>
+          <leafValues>
+            -1.4415690302848816e-01 9.8254486918449402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 1.6854539513587952e-02</internalNodes>
+          <leafValues>
+            2.8428679332137108e-02 -4.5227599143981934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 1.3624729588627815e-02</internalNodes>
+          <leafValues>
+            -6.0474298894405365e-02 2.2715990245342255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 1.3620140030980110e-02</internalNodes>
+          <leafValues>
+            7.9177603125572205e-02 -1.8104650080204010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 -4.4976719655096531e-03</internalNodes>
+          <leafValues>
+            2.1300099790096283e-01 -7.1392573416233063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 7.1611418388783932e-04</internalNodes>
+          <leafValues>
+            -9.4237379729747772e-02 1.5830449759960175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 7.0651061832904816e-04</internalNodes>
+          <leafValues>
+            4.8840671777725220e-02 -2.9152449965476990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 -3.1002271175384521e-01</internalNodes>
+          <leafValues>
+            -3.8511890172958374e-01 3.4369651228189468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 4.3721711263060570e-03</internalNodes>
+          <leafValues>
+            -4.6880301088094711e-02 2.9952910542488098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 -1.4383009634912014e-02</internalNodes>
+          <leafValues>
+            -4.5463728904724121e-01 3.4184519201517105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 -3.7763800937682390e-03</internalNodes>
+          <leafValues>
+            -5.6709027290344238e-01 2.1684719249606133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 -3.4393940586596727e-03</internalNodes>
+          <leafValues>
+            2.8183689713478088e-01 -5.2640009671449661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 -3.5846829414367676e-03</internalNodes>
+          <leafValues>
+            -2.9227399826049805e-01 5.2231520414352417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 3.6200750619173050e-03</internalNodes>
+          <leafValues>
+            -5.3378768265247345e-02 2.6364138722419739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 7.6435408554971218e-03</internalNodes>
+          <leafValues>
+            3.6897629499435425e-02 -3.9242339134216309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 3.5417820326983929e-03</internalNodes>
+          <leafValues>
+            3.5689998418092728e-02 -3.5601079463958740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 -2.4041049182415009e-03</internalNodes>
+          <leafValues>
+            1.6313059628009796e-01 -8.9239962399005890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 6.5479031763970852e-03</internalNodes>
+          <leafValues>
+            3.6708708852529526e-02 -3.4187689423561096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 -1.2350000441074371e-02</internalNodes>
+          <leafValues>
+            2.6157799363136292e-01 -5.2475821226835251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 1.4726500012329780e-05</internalNodes>
+          <leafValues>
+            -1.7869140207767487e-01 7.7807463705539703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 -2.1563619375228882e-02</internalNodes>
+          <leafValues>
+            -6.3926118612289429e-01 1.9050199538469315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 5.0762481987476349e-03</internalNodes>
+          <leafValues>
+            -5.1665481179952621e-02 2.9126250743865967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 -5.9531949460506439e-02</internalNodes>
+          <leafValues>
+            -7.5291550159454346e-01 2.0238230004906654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 -1.6808489337563515e-02</internalNodes>
+          <leafValues>
+            -4.2833268642425537e-01 2.5997729972004890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 3.4431689418852329e-03</internalNodes>
+          <leafValues>
+            -5.4912570863962173e-02 2.4233500659465790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -1.0451589478179812e-03</internalNodes>
+          <leafValues>
+            -2.6243540644645691e-01 4.5748569071292877e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 -4.8333409358747303e-04</internalNodes>
+          <leafValues>
+            8.9791953563690186e-02 -1.2892110645771027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 -4.7575961798429489e-03</internalNodes>
+          <leafValues>
+            -3.1868740916252136e-01 3.6020528525114059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 -1.0407149791717529e-01</internalNodes>
+          <leafValues>
+            5.1398742198944092e-01 -2.3598119616508484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 9.6292654052376747e-03</internalNodes>
+          <leafValues>
+            -4.7965578734874725e-02 2.1790429949760437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 5.9226430021226406e-03</internalNodes>
+          <leafValues>
+            6.4275130629539490e-02 -1.8210859596729279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 1.6943799331784248e-02</internalNodes>
+          <leafValues>
+            -3.7509348243474960e-02 3.1458830833435059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 -6.5468349494040012e-03</internalNodes>
+          <leafValues>
+            -1.5812429785728455e-01 9.0520747005939484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 9.4754863530397415e-03</internalNodes>
+          <leafValues>
+            4.8995878547430038e-02 -2.7853849530220032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 -4.9254479818046093e-03</internalNodes>
+          <leafValues>
+            3.1902191042900085e-01 -4.5609470456838608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 -9.4199541490525007e-04</internalNodes>
+          <leafValues>
+            -1.6472989320755005e-01 7.3966227471828461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1464 7.0046652108430862e-03</internalNodes>
+          <leafValues>
+            -3.6342341452836990e-02 3.3846628665924072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1465 -9.1483298456296325e-04</internalNodes>
+          <leafValues>
+            1.0460989922285080e-01 -1.1206439882516861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1466 -1.8404760339763016e-04</internalNodes>
+          <leafValues>
+            1.4215709269046783e-01 -8.7627373635768890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1467 -3.1692520133219659e-04</internalNodes>
+          <leafValues>
+            -1.6067850589752197e-01 7.0096842944622040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1468 2.3108009248971939e-02</internalNodes>
+          <leafValues>
+            -5.3784500807523727e-02 2.0780019462108612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1469 6.3212551176548004e-03</internalNodes>
+          <leafValues>
+            2.9342239722609520e-02 -3.8378500938415527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1470 7.3698158375918865e-03</internalNodes>
+          <leafValues>
+            -4.1625689715147018e-02 2.6526549458503723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1471 3.3730969298630953e-03</internalNodes>
+          <leafValues>
+            3.7753321230411530e-02 -3.0138298869132996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1472 -6.4016957767307758e-03</internalNodes>
+          <leafValues>
+            2.1839860081672668e-01 -5.4551340639591217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1473 1.3553920201957226e-02</internalNodes>
+          <leafValues>
+            2.8121260926127434e-02 -4.3601170182228088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1474 -6.7636291496455669e-03</internalNodes>
+          <leafValues>
+            -1.6322250664234161e-01 6.7339658737182617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1475 -1.3078070478513837e-03</internalNodes>
+          <leafValues>
+            1.2315399944782257e-01 -1.0096319764852524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1476 -7.6282368972897530e-03</internalNodes>
+          <leafValues>
+            2.5165349245071411e-01 -5.0460711121559143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1477 7.9994397237896919e-03</internalNodes>
+          <leafValues>
+            7.3020651936531067e-02 -1.8877799808979034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1478 -3.1321209389716387e-03</internalNodes>
+          <leafValues>
+            2.7653199434280396e-01 -4.3276838958263397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1479 -4.0931310504674911e-02</internalNodes>
+          <leafValues>
+            -6.5518248081207275e-01 1.8600920215249062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1480 7.0344978012144566e-03</internalNodes>
+          <leafValues>
+            2.1914770826697350e-02 -4.8595818877220154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1481 -2.5299859698861837e-03</internalNodes>
+          <leafValues>
+            1.4030769467353821e-01 -8.0566473305225372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1482 3.8867890834808350e-03</internalNodes>
+          <leafValues>
+            -8.9075699448585510e-02 1.6832409799098969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1483 3.8210590719245374e-04</internalNodes>
+          <leafValues>
+            6.5200872719287872e-02 -1.8599529564380646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1484 1.0954789817333221e-01</internalNodes>
+          <leafValues>
+            1.5036020427942276e-02 -8.6908358335494995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1485 -1.4177490083966404e-04</internalNodes>
+          <leafValues>
+            -1.4669269323348999e-01 7.9050153493881226e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1486 2.0990408957004547e-03</internalNodes>
+          <leafValues>
+            -4.6489678323268890e-02 2.3045249283313751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1487 -2.3089480237103999e-04</internalNodes>
+          <leafValues>
+            -1.6784009337425232e-01 6.9773100316524506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1488 -4.3103471398353577e-04</internalNodes>
+          <leafValues>
+            8.1758759915828705e-02 -1.2939240038394928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1489 -2.9572288622148335e-04</internalNodes>
+          <leafValues>
+            -1.9068230688571930e-01 5.8420080691576004e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1490 -4.0046018548309803e-03</internalNodes>
+          <leafValues>
+            1.2948529422283173e-01 -8.1599622964859009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1491 1.4935520084691234e-05</internalNodes>
+          <leafValues>
+            -1.3364720344543457e-01 9.8664022982120514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1492 5.7824450777843595e-04</internalNodes>
+          <leafValues>
+            5.9095639735460281e-02 -1.8318089842796326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1493 1.3251320458948612e-02</internalNodes>
+          <leafValues>
+            -7.1488671004772186e-02 1.5635989606380463e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1494 7.1273561843554489e-06</internalNodes>
+          <leafValues>
+            -1.2283089756965637e-01 9.7752511501312256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1495 1.4193489914759994e-03</internalNodes>
+          <leafValues>
+            -8.1696748733520508e-02 1.3701570034027100e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1496 -8.0165416002273560e-03</internalNodes>
+          <leafValues>
+            2.4697229266166687e-01 -5.6527040898799896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1497 -2.3803471121937037e-03</internalNodes>
+          <leafValues>
+            -3.7901589274406433e-01 3.4532550722360611e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1498 -4.8633730039000511e-03</internalNodes>
+          <leafValues>
+            6.5441012382507324e-01 -1.9296199083328247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1499 -1.4388219824468251e-05</internalNodes>
+          <leafValues>
+            7.5101882219314575e-02 -1.4394460618495941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1500 1.4798780284763779e-05</internalNodes>
+          <leafValues>
+            -1.0807389765977859e-01 9.6213810145854950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1501 2.4176139384508133e-02</internalNodes>
+          <leafValues>
+            2.6983680203557014e-02 -4.0708479285240173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1502 -3.9851912297308445e-03</internalNodes>
+          <leafValues>
+            2.1786700189113617e-01 -5.4170310497283936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1503 -2.5377580896019936e-03</internalNodes>
+          <leafValues>
+            -1.5314599871635437e-01 8.8059239089488983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1504 2.1663319785147905e-03</internalNodes>
+          <leafValues>
+            1.0252720117568970e-01 -1.2039250135421753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1505 3.5593929351307452e-04</internalNodes>
+          <leafValues>
+            -8.2267768681049347e-02 1.3228890299797058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1506 1.1394560569897294e-03</internalNodes>
+          <leafValues>
+            -8.6393490433692932e-02 1.5693899989128113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1507 5.5563818663358688e-02</internalNodes>
+          <leafValues>
+            1.7108110710978508e-02 -7.0473742485046387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1508 5.5514591932296753e-01</internalNodes>
+          <leafValues>
+            1.3345389626920223e-02 -6.9916892051696777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1509 -4.6235490590333939e-03</internalNodes>
+          <leafValues>
+            -2.3983679711818695e-01 3.9515350013971329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1510 -4.5803869143128395e-03</internalNodes>
+          <leafValues>
+            4.2900869250297546e-01 -2.6430539786815643e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1511 7.0851319469511509e-03</internalNodes>
+          <leafValues>
+            1.1231079697608948e-01 -1.0711509734392166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1512 -4.0524810901843011e-04</internalNodes>
+          <leafValues>
+            -2.5740951299667358e-01 4.6670019626617432e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1513 -4.9121538177132607e-03</internalNodes>
+          <leafValues>
+            2.7129280567169189e-01 -4.3966241180896759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1514 -1.9348099827766418e-02</internalNodes>
+          <leafValues>
+            -4.0643858909606934e-01 2.9176769778132439e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1515 -1.3842330081388354e-03</internalNodes>
+          <leafValues>
+            2.3537209630012512e-01 -5.0227548927068710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1516 6.2752598896622658e-03</internalNodes>
+          <leafValues>
+            2.8113570064306259e-02 -3.9913201332092285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1517 1.4853129869152326e-05</internalNodes>
+          <leafValues>
+            -1.0750629752874374e-01 1.0206390172243118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1518 -1.1780710192397237e-03</internalNodes>
+          <leafValues>
+            1.8112790584564209e-01 -5.8998040854930878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1519 -3.2166391611099243e-02</internalNodes>
+          <leafValues>
+            -9.8135101795196533e-01 1.1817139573395252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1520 2.8749080374836922e-03</internalNodes>
+          <leafValues>
+            5.0774369388818741e-02 -2.0650039613246918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1521 -3.5098160151392221e-03</internalNodes>
+          <leafValues>
+            1.4354039728641510e-01 -7.8006736934185028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1522 -7.2203627787530422e-03</internalNodes>
+          <leafValues>
+            2.3853950202465057e-01 -4.6176180243492126e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1523 2.0837699994444847e-03</internalNodes>
+          <leafValues>
+            2.2801460698246956e-02 -5.0945621728897095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1524 3.6175400018692017e-02</internalNodes>
+          <leafValues>
+            1.4734740369021893e-02 -6.1349362134933472e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1525 7.5545758008956909e-03</internalNodes>
+          <leafValues>
+            1.6166130080819130e-02 -5.8863008022308350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1526 -2.6058950461447239e-03</internalNodes>
+          <leafValues>
+            3.6436009407043457e-01 -3.4624300897121429e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1527 6.4669351559132338e-04</internalNodes>
+          <leafValues>
+            6.3444733619689941e-02 -1.8953520059585571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1528 -3.1747641041874886e-03</internalNodes>
+          <leafValues>
+            4.2877858877182007e-01 -2.6968790218234062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1529 -2.3839730769395828e-02</internalNodes>
+          <leafValues>
+            -3.6871370673179626e-01 3.3688500523567200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1530 1.1973649961873889e-03</internalNodes>
+          <leafValues>
+            -6.2898509204387665e-02 1.9179169833660126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1531 4.4593929487746209e-05</internalNodes>
+          <leafValues>
+            -1.1022660136222839e-01 1.2159959971904755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1532 9.1575905680656433e-03</internalNodes>
+          <leafValues>
+            2.5353889912366867e-02 -4.9928730726242065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1533 2.3933469783514738e-03</internalNodes>
+          <leafValues>
+            4.8282090574502945e-02 -2.2685450315475464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1534 -1.1994830565527081e-03</internalNodes>
+          <leafValues>
+            1.0886570066213608e-01 -1.0669539868831635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1535 2.1603968925774097e-03</internalNodes>
+          <leafValues>
+            -7.6076626777648926e-02 1.6507959365844727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1536 -1.6556339338421822e-02</internalNodes>
+          <leafValues>
+            -5.4167211055755615e-01 2.0711649209260941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1537 -8.8350269943475723e-03</internalNodes>
+          <leafValues>
+            -3.6710909008979797e-01 2.8870400041341782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1538 -1.4592399566026870e-05</internalNodes>
+          <leafValues>
+            7.8724071383476257e-02 -1.3622610270977020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1539 -1.4897900400683284e-03</internalNodes>
+          <leafValues>
+            1.1436119675636292e-01 -1.0104899853467941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1540 -3.9764028042554855e-03</internalNodes>
+          <leafValues>
+            -1.0250560194253922e-01 1.0466060042381287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1541 -7.2657042182981968e-03</internalNodes>
+          <leafValues>
+            2.2982269525527954e-01 -4.5155581086874008e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1542 8.9115025475621223e-03</internalNodes>
+          <leafValues>
+            2.9681159183382988e-02 -4.4235008955001831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1543 -1.8145949579775333e-03</internalNodes>
+          <leafValues>
+            2.3911419510841370e-01 -4.6856120228767395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1544 -3.7546321749687195e-02</internalNodes>
+          <leafValues>
+            -1.8569689989089966e-01 6.1533749103546143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1545 -1.0010029654949903e-03</internalNodes>
+          <leafValues>
+            1.4361350238323212e-01 -8.6990483105182648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1546 -3.7357229739427567e-03</internalNodes>
+          <leafValues>
+            2.0245459675788879e-01 -6.1167530715465546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1547 -1.4672010365757160e-05</internalNodes>
+          <leafValues>
+            8.8180869817733765e-02 -1.3037009537220001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1548 9.4379713118541986e-05</internalNodes>
+          <leafValues>
+            5.5626530200242996e-02 -2.0025369524955750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1549 1.5706509293522686e-04</internalNodes>
+          <leafValues>
+            -9.8335877060890198e-02 1.1518850177526474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1550 -8.1810058327391744e-04</internalNodes>
+          <leafValues>
+            -2.1701550483703613e-01 5.2880410104990005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1551 -5.1689259707927704e-02</internalNodes>
+          <leafValues>
+            5.7715278863906860e-01 -1.8761100247502327e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1552 -9.0719409286975861e-02</internalNodes>
+          <leafValues>
+            -3.6278849840164185e-01 3.6741130053997040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1553 -1.0959040373563766e-02</internalNodes>
+          <leafValues>
+            1.6787180304527283e-01 -6.9725647568702698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1554 3.7122920621186495e-03</internalNodes>
+          <leafValues>
+            6.0360308736562729e-02 -2.0567069947719574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1555 -1.9315730780363083e-02</internalNodes>
+          <leafValues>
+            -5.7397401332855225e-01 1.9705319777131081e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1556 -2.7051189914345741e-02</internalNodes>
+          <leafValues>
+            3.4983208775520325e-01 -3.6084290593862534e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1557 2.1742910146713257e-02</internalNodes>
+          <leafValues>
+            2.2767079994082451e-02 -6.5319198369979858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1558 9.9608592689037323e-02</internalNodes>
+          <leafValues>
+            -3.1259559094905853e-02 3.8271111249923706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1559 4.6517839655280113e-03</internalNodes>
+          <leafValues>
+            1.0088030248880386e-01 -1.2396019697189331e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1560 -1.4784580343984999e-05</internalNodes>
+          <leafValues>
+            7.9683482646942139e-02 -1.5573020279407501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1561 -1.6718909610062838e-03</internalNodes>
+          <leafValues>
+            1.7077329754829407e-01 -6.7733809351921082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1562 1.4456630196946207e-05</internalNodes>
+          <leafValues>
+            -1.0106030106544495e-01 1.1116830259561539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1563 -2.7084909379482269e-03</internalNodes>
+          <leafValues>
+            1.1312720179557800e-01 -1.0880629718303680e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>159</maxWeakCount>
+      <stageThreshold>-1.3943890333175659e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1564 -2.2686859592795372e-02</internalNodes>
+          <leafValues>
+            2.7316910028457642e-01 -2.7358779311180115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1565 4.2952829971909523e-04</internalNodes>
+          <leafValues>
+            -2.5107958912849426e-01 1.5740729868412018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1566 2.5115790776908398e-03</internalNodes>
+          <leafValues>
+            -2.2002549469470978e-01 1.5660229325294495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1567 -6.3958892133086920e-04</internalNodes>
+          <leafValues>
+            7.2609938681125641e-02 -3.8278979063034058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1568 2.6575280353426933e-03</internalNodes>
+          <leafValues>
+            -1.1523439735174179e-01 2.3414239287376404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1569 -7.5916409492492676e-02</internalNodes>
+          <leafValues>
+            3.2517579197883606e-01 -8.2622267305850983e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1570 1.4966350136091933e-05</internalNodes>
+          <leafValues>
+            -3.5640290379524231e-01 5.2353590726852417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1571 -1.4678399566037115e-05</internalNodes>
+          <leafValues>
+            1.0198219865560532e-01 -2.2452689707279205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1572 5.2314779168227687e-05</internalNodes>
+          <leafValues>
+            -1.7757849395275116e-01 1.0107079893350601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1573 1.4088390162214637e-04</internalNodes>
+          <leafValues>
+            -1.5139770507812500e-01 1.3872760534286499e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1574 -2.3411789909005165e-02</internalNodes>
+          <leafValues>
+            -1.6435989737510681e-01 1.0702139884233475e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1575 2.3284659255295992e-03</internalNodes>
+          <leafValues>
+            -8.0950729548931122e-02 2.2333970665931702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1576 -3.3611140679568052e-03</internalNodes>
+          <leafValues>
+            -4.4329941272735596e-01 3.4489039331674576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1577 5.8458978310227394e-04</internalNodes>
+          <leafValues>
+            -1.1083470284938812e-01 1.7215029895305634e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1578 -3.3180968603119254e-04</internalNodes>
+          <leafValues>
+            6.9152593612670898e-02 -2.6321241259574890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1579 -8.8515877723693848e-04</internalNodes>
+          <leafValues>
+            -3.4764730930328369e-01 4.3258201330900192e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1580 1.4169749920256436e-04</internalNodes>
+          <leafValues>
+            -1.4600689709186554e-01 1.0149820148944855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1581 1.4851680025458336e-03</internalNodes>
+          <leafValues>
+            2.9983170330524445e-02 -4.1786131262779236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1582 -7.5329327955842018e-04</internalNodes>
+          <leafValues>
+            -2.1557639539241791e-01 6.4534209668636322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1583 1.4260539785027504e-02</internalNodes>
+          <leafValues>
+            -8.0013327300548553e-02 1.9511990249156952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1584 -1.4687920156575274e-05</internalNodes>
+          <leafValues>
+            9.7121663391590118e-02 -1.3502350449562073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1585 -9.8925074562430382e-03</internalNodes>
+          <leafValues>
+            -5.1035261154174805e-01 2.9335800558328629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1586 -1.8316040514037013e-03</internalNodes>
+          <leafValues>
+            3.2676079869270325e-01 -4.5014020055532455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1587 8.6495577124878764e-04</internalNodes>
+          <leafValues>
+            -7.7836513519287109e-02 1.8764939904212952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1588 1.4902660250663757e-01</internalNodes>
+          <leafValues>
+            1.9568990916013718e-02 -6.2450677156448364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1589 -1.7126720398664474e-02</internalNodes>
+          <leafValues>
+            -1.8141449987888336e-01 7.3048681020736694e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1590 -1.7061959952116013e-03</internalNodes>
+          <leafValues>
+            3.1236839294433594e-01 -4.4152028858661652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1591 3.8261809386312962e-03</internalNodes>
+          <leafValues>
+            5.1518529653549194e-02 -2.9330030083656311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1592 3.8093670736998320e-03</internalNodes>
+          <leafValues>
+            -7.6707206666469574e-02 1.7574439942836761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1593 -3.4228331060148776e-04</internalNodes>
+          <leafValues>
+            -2.3458020389080048e-01 6.1726640909910202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1594 -4.1697870939970016e-02</internalNodes>
+          <leafValues>
+            4.3929129838943481e-01 -3.6892820149660110e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1595 1.9080520723946393e-04</internalNodes>
+          <leafValues>
+            -1.3488939404487610e-01 9.7168661653995514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1596 2.6400710339657962e-04</internalNodes>
+          <leafValues>
+            -1.6539520025253296e-01 7.3270231485366821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1597 7.9839164391160011e-03</internalNodes>
+          <leafValues>
+            -3.3527340739965439e-02 3.6535859107971191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1598 -1.4267410151660442e-02</internalNodes>
+          <leafValues>
+            4.6739241480827332e-01 -2.7154419571161270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1599 -9.4726070528849959e-05</internalNodes>
+          <leafValues>
+            -1.5017749369144440e-01 8.7657302618026733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1600 -2.9629279742948711e-04</internalNodes>
+          <leafValues>
+            -1.6194540262222290e-01 7.3863230645656586e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1601 2.3301010951399803e-03</internalNodes>
+          <leafValues>
+            -7.9925157129764557e-02 1.5778550505638123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1602 3.6623800406232476e-04</internalNodes>
+          <leafValues>
+            -8.7019346654415131e-02 2.0495669543743134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1603 -4.4499669224023819e-02</internalNodes>
+          <leafValues>
+            -2.9891410470008850e-01 4.5648001134395599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1604 -6.0768700204789639e-03</internalNodes>
+          <leafValues>
+            2.3746150732040405e-01 -5.3580708801746368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1605 6.6064862767234445e-04</internalNodes>
+          <leafValues>
+            5.9221439063549042e-02 -2.3569910228252411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1606 7.4699260294437408e-03</internalNodes>
+          <leafValues>
+            5.1304049789905548e-02 -2.3386649787425995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1607 -6.7128022201359272e-03</internalNodes>
+          <leafValues>
+            2.7061641216278076e-01 -5.0031121820211411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1608 4.6589970588684082e-03</internalNodes>
+          <leafValues>
+            4.4932201504707336e-02 -3.0730488896369934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1609 4.9815201200544834e-03</internalNodes>
+          <leafValues>
+            -4.8255410045385361e-02 2.6853010058403015e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1610 9.9244136363267899e-03</internalNodes>
+          <leafValues>
+            1.9446769729256630e-02 -7.0352387428283691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1611 6.1988402158021927e-03</internalNodes>
+          <leafValues>
+            -3.5107269883155823e-02 3.5460400581359863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1612 8.8433362543582916e-03</internalNodes>
+          <leafValues>
+            4.5328389853239059e-02 -2.7485930919647217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1613 1.1110560037195683e-02</internalNodes>
+          <leafValues>
+            2.2391419857740402e-02 -5.0172042846679688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1614 -6.9408811395987868e-04</internalNodes>
+          <leafValues>
+            1.7079490423202515e-01 -6.3849426805973053e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1615 8.0377031117677689e-03</internalNodes>
+          <leafValues>
+            8.8937461376190186e-02 -1.6416129469871521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1616 1.4750069567526225e-05</internalNodes>
+          <leafValues>
+            -1.3713030517101288e-01 9.6981123089790344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1617 1.2381490087136626e-03</internalNodes>
+          <leafValues>
+            -6.9491222500801086e-02 1.6551379859447479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1618 2.6584148872643709e-04</internalNodes>
+          <leafValues>
+            -9.6803613007068634e-02 1.2020370364189148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1619 -5.4076651576906443e-04</internalNodes>
+          <leafValues>
+            -2.3185379803180695e-01 4.8987850546836853e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1620 -5.1092808134853840e-03</internalNodes>
+          <leafValues>
+            3.0391758680343628e-01 -4.0800470858812332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1621 1.5575919533148408e-03</internalNodes>
+          <leafValues>
+            -1.0150980204343796e-01 1.4465929567813873e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1622 2.8396019712090492e-02</internalNodes>
+          <leafValues>
+            1.5098540484905243e-01 -8.8314309716224670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1623 1.5096530551090837e-03</internalNodes>
+          <leafValues>
+            5.1589738577604294e-02 -2.6199528574943542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1624 1.4308419777080417e-03</internalNodes>
+          <leafValues>
+            -4.5497849583625793e-02 2.7584540843963623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1625 1.3030369579792023e-01</internalNodes>
+          <leafValues>
+            2.0329989492893219e-02 -5.7491821050643921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1626 -3.3548770006746054e-03</internalNodes>
+          <leafValues>
+            1.2289950251579285e-01 -8.9937411248683929e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1627 2.7094839140772820e-02</internalNodes>
+          <leafValues>
+            1.4342390000820160e-02 -7.8952521085739136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1628 -3.6210110783576965e-01</internalNodes>
+          <leafValues>
+            -6.2560427188873291e-01 1.4021329581737518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1629 -6.6879601217806339e-04</internalNodes>
+          <leafValues>
+            2.1966129541397095e-01 -5.2415199577808380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1630 -3.7389241158962250e-02</internalNodes>
+          <leafValues>
+            -4.7313681244850159e-01 2.5704499334096909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1631 -7.4386061169207096e-03</internalNodes>
+          <leafValues>
+            -5.2914857864379883e-01 2.0038880407810211e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1632 1.0443119704723358e-01</internalNodes>
+          <leafValues>
+            -2.2909460589289665e-02 5.1592028141021729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1633 -6.1161867051851004e-05</internalNodes>
+          <leafValues>
+            7.7016606926918030e-02 -1.4625400304794312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1634 6.5830379026010633e-04</internalNodes>
+          <leafValues>
+            7.0015281438827515e-02 -1.5569929778575897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1635 9.7367232665419579e-03</internalNodes>
+          <leafValues>
+            -3.1582240015268326e-02 3.2754561305046082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1636 -2.9574360232800245e-03</internalNodes>
+          <leafValues>
+            -3.4247711300849915e-01 3.2184720039367676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1637 1.6319820424541831e-03</internalNodes>
+          <leafValues>
+            -4.9400478601455688e-02 2.2656440734863281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1638 1.3844939880073071e-02</internalNodes>
+          <leafValues>
+            2.0476659759879112e-02 -5.4600667953491211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1639 3.1580299139022827e-02</internalNodes>
+          <leafValues>
+            -4.2422048747539520e-02 2.9091480374336243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1640 8.6624026298522949e-03</internalNodes>
+          <leafValues>
+            5.4432898759841919e-02 -2.1892189979553223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1641 -4.6714721247553825e-04</internalNodes>
+          <leafValues>
+            -1.8205730617046356e-01 7.1491912007331848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1642 4.1834521107375622e-03</internalNodes>
+          <leafValues>
+            -6.7491203546524048e-02 1.7285770177841187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1643 -5.3335628472268581e-03</internalNodes>
+          <leafValues>
+            -8.4681749343872070e-01 1.3804829679429531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1644 7.8782793134450912e-03</internalNodes>
+          <leafValues>
+            -4.8166718333959579e-02 2.4242730438709259e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1645 3.8775329012423754e-03</internalNodes>
+          <leafValues>
+            2.4311149492859840e-02 -4.9763259291648865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1646 -1.6564880206715316e-04</internalNodes>
+          <leafValues>
+            5.5546380579471588e-02 -1.9554230570793152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1647 1.8993400037288666e-02</internalNodes>
+          <leafValues>
+            -3.6479089409112930e-02 2.8472718596458435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1648 -3.4308759495615959e-03</internalNodes>
+          <leafValues>
+            -3.2813000679016113e-01 3.6524198949337006e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1649 1.4614370229537599e-05</internalNodes>
+          <leafValues>
+            -1.0106439888477325e-01 1.0622490197420120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1650 1.5978919342160225e-02</internalNodes>
+          <leafValues>
+            3.0059399083256721e-02 -3.9310181140899658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1651 -2.2245719446800649e-04</internalNodes>
+          <leafValues>
+            1.8586489558219910e-01 -7.2151653468608856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1652 2.0615909248590469e-02</internalNodes>
+          <leafValues>
+            1.5250990167260170e-02 -7.8391200304031372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1653 2.8645060956478119e-04</internalNodes>
+          <leafValues>
+            6.8745598196983337e-02 -1.5308310091495514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1654 -5.9233439969830215e-05</internalNodes>
+          <leafValues>
+            -1.2545019388198853e-01 9.8448492586612701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1655 -7.6257862383499742e-04</internalNodes>
+          <leafValues>
+            2.1546240150928497e-01 -5.3760219365358353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1656 -1.4181639999151230e-03</internalNodes>
+          <leafValues>
+            -1.9876889884471893e-01 5.1982138305902481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1657 -4.4716868549585342e-02</internalNodes>
+          <leafValues>
+            -7.5508397817611694e-01 1.2906449846923351e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1658 -1.3735699467360973e-03</internalNodes>
+          <leafValues>
+            2.2003139555454254e-01 -5.1394689828157425e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1659 -1.5352779999375343e-02</internalNodes>
+          <leafValues>
+            -2.1422849595546722e-01 5.3781170397996902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1660 1.3817439787089825e-02</internalNodes>
+          <leafValues>
+            -3.5158120095729828e-02 2.9399091005325317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1661 8.7981626391410828e-02</internalNodes>
+          <leafValues>
+            1.6688749194145203e-02 -7.2053599357604980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1662 4.0486121177673340e-01</internalNodes>
+          <leafValues>
+            9.4695771113038063e-03 -8.2725608348846436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1663 1.9231239566579461e-03</internalNodes>
+          <leafValues>
+            -5.8016318827867508e-02 1.7696020007133484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1664 -4.0756969247013330e-04</internalNodes>
+          <leafValues>
+            8.7600946426391602e-02 -1.2633720040321350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1665 -2.3862780071794987e-03</internalNodes>
+          <leafValues>
+            -4.0085569024085999e-01 2.7183029800653458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1666 5.6235089898109436e-02</internalNodes>
+          <leafValues>
+            -1.7541319131851196e-02 7.3818737268447876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1667 4.9810402560979128e-04</internalNodes>
+          <leafValues>
+            -7.6487071812152863e-02 1.2697990238666534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1668 5.3285917965695262e-04</internalNodes>
+          <leafValues>
+            5.9596300125122070e-02 -1.7600339651107788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1669 5.9949647402390838e-04</internalNodes>
+          <leafValues>
+            -8.2509063184261322e-02 1.3002809882164001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1670 -2.0725550712086260e-04</internalNodes>
+          <leafValues>
+            9.3374222517013550e-02 -1.1726769804954529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1671 8.1314949784427881e-04</internalNodes>
+          <leafValues>
+            -8.0063126981258392e-02 1.4701730012893677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1672 -3.4973450237885118e-04</internalNodes>
+          <leafValues>
+            1.1057929694652557e-01 -1.0881700366735458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1673 -2.1448899805545807e-01</internalNodes>
+          <leafValues>
+            -3.1701159477233887e-01 4.1711531579494476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1674 5.9010740369558334e-04</internalNodes>
+          <leafValues>
+            4.6280328184366226e-02 -2.3512250185012817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1675 -1.2093999981880188e-01</internalNodes>
+          <leafValues>
+            -6.8957090377807617e-01 1.4982040040194988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1676 1.0181350260972977e-01</internalNodes>
+          <leafValues>
+            1.1298139579594135e-02 -7.1199649572372437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1677 3.5208329558372498e-01</internalNodes>
+          <leafValues>
+            1.2944510206580162e-02 -6.7572408914566040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1678 -1.4602140254282858e-05</internalNodes>
+          <leafValues>
+            6.9550313055515289e-02 -1.4288060367107391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1679 -2.3212860524654388e-01</internalNodes>
+          <leafValues>
+            -7.5287401676177979e-01 1.1394330300390720e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1680 -1.4764709630981088e-03</internalNodes>
+          <leafValues>
+            1.3547790050506592e-01 -8.5470907390117645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1681 9.9324379116296768e-03</internalNodes>
+          <leafValues>
+            -4.8758801072835922e-02 2.4582690000534058e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1682 -2.6857290416955948e-02</internalNodes>
+          <leafValues>
+            -4.3975710868835449e-01 2.5082239881157875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1683 -7.3618912138044834e-03</internalNodes>
+          <leafValues>
+            1.2384700030088425e-01 -9.7226209938526154e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1684 -1.9785730168223381e-02</internalNodes>
+          <leafValues>
+            -5.0932317972183228e-01 2.3481979966163635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1685 -1.4635100342275109e-05</internalNodes>
+          <leafValues>
+            9.4043917953968048e-02 -1.2145669758319855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1686 -5.4067030549049377e-02</internalNodes>
+          <leafValues>
+            -5.4586207866668701e-01 1.9500140100717545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1687 1.1532169766724110e-02</internalNodes>
+          <leafValues>
+            -7.6409153640270233e-02 1.3763970136642456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1688 -4.4358540326356888e-03</internalNodes>
+          <leafValues>
+            1.2359759956598282e-01 -9.1719299554824829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1689 8.3216017810627818e-04</internalNodes>
+          <leafValues>
+            6.3659071922302246e-02 -2.0440760254859924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1690 -1.2503969669342041e-01</internalNodes>
+          <leafValues>
+            -4.1524758934974670e-01 2.7199100703001022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1691 4.9618318676948547e-02</internalNodes>
+          <leafValues>
+            1.5955109149217606e-02 -6.1666852235794067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1692 -3.0613599810749292e-03</internalNodes>
+          <leafValues>
+            3.6662209033966064e-01 -3.3449448645114899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1693 3.5273379180580378e-03</internalNodes>
+          <leafValues>
+            3.1757980585098267e-02 -3.8478809595108032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1694 -6.6726570948958397e-03</internalNodes>
+          <leafValues>
+            3.2095840573310852e-01 -3.4408681094646454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1695 -2.5795500259846449e-03</internalNodes>
+          <leafValues>
+            -3.7870529294013977e-01 2.8562130406498909e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1696 7.8417789191007614e-03</internalNodes>
+          <leafValues>
+            -2.0479770377278328e-02 5.1704108715057373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1697 3.1101319473236799e-04</internalNodes>
+          <leafValues>
+            -1.0809139907360077e-01 9.7204521298408508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1698 2.6113479398190975e-03</internalNodes>
+          <leafValues>
+            -8.1770427525043488e-02 1.4691209793090820e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1699 7.3472261428833008e-03</internalNodes>
+          <leafValues>
+            2.5131259113550186e-02 -4.3025061488151550e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1700 1.3528259296435863e-04</internalNodes>
+          <leafValues>
+            -1.4751060307025909e-01 6.7584678530693054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1701 -5.1026898290729150e-05</internalNodes>
+          <leafValues>
+            -1.2161359935998917e-01 8.4333047270774841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1702 1.1552199721336365e-03</internalNodes>
+          <leafValues>
+            -5.4663829505443573e-02 1.9773660600185394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1703 -8.2931712269783020e-02</internalNodes>
+          <leafValues>
+            -5.1923328638076782e-01 2.0582359284162521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1704 -4.6260739327408373e-04</internalNodes>
+          <leafValues>
+            8.5588268935680389e-02 -1.1725299805402756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1705 6.7906372714787722e-04</internalNodes>
+          <leafValues>
+            4.5980118215084076e-02 -2.2628420591354370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1706 1.4090019976720214e-03</internalNodes>
+          <leafValues>
+            -4.7628920525312424e-02 2.2722719609737396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1707 2.8954911231994629e-01</internalNodes>
+          <leafValues>
+            1.6701240092515945e-02 -6.3967019319534302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1708 1.9376130774617195e-02</internalNodes>
+          <leafValues>
+            -2.2569410502910614e-02 5.0590497255325317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1709 4.2641081381589174e-04</internalNodes>
+          <leafValues>
+            6.6041722893714905e-02 -1.6666300594806671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1710 1.7502580303698778e-03</internalNodes>
+          <leafValues>
+            -5.8077909052371979e-02 1.9512599706649780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1711 -3.2605750020593405e-03</internalNodes>
+          <leafValues>
+            -2.9101881384849548e-01 3.8328718394041061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1712 1.9519040361046791e-03</internalNodes>
+          <leafValues>
+            5.9565968811511993e-02 -1.6910600662231445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1713 -3.2053990289568901e-03</internalNodes>
+          <leafValues>
+            1.9927769899368286e-01 -5.6053258478641510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1714 1.7617279663681984e-03</internalNodes>
+          <leafValues>
+            5.0697531551122665e-02 -2.1276649832725525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1715 -6.0043102130293846e-03</internalNodes>
+          <leafValues>
+            -1.3699269294738770e-01 8.2275278866291046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1716 2.4830829352140427e-03</internalNodes>
+          <leafValues>
+            -5.1561661064624786e-02 2.1684220433235168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1717 -1.0821930319070816e-01</internalNodes>
+          <leafValues>
+            -7.8375291824340820e-01 1.4433650299906731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1718 -7.5229378417134285e-03</internalNodes>
+          <leafValues>
+            1.3453729450702667e-01 -9.0582698583602905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1719 3.0750989913940430e-02</internalNodes>
+          <leafValues>
+            1.1081690341234207e-01 -9.9475599825382233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1720 -2.8948320541530848e-03</internalNodes>
+          <leafValues>
+            1.9005739688873291e-01 -5.2639260888099670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1721 2.7011099737137556e-03</internalNodes>
+          <leafValues>
+            5.8573558926582336e-02 -1.9851949810981750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1722 1.2562989722937346e-03</internalNodes>
+          <leafValues>
+            -7.3565311729907990e-02 1.5436840057373047e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>173</maxWeakCount>
+      <stageThreshold>-1.4785599708557129e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1723 -2.1460579708218575e-02</internalNodes>
+          <leafValues>
+            3.2505050301551819e-01 -2.0890380442142487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1724 7.6785432174801826e-03</internalNodes>
+          <leafValues>
+            -1.3231310248374939e-01 3.0525839328765869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1725 3.4118059556931257e-03</internalNodes>
+          <leafValues>
+            -3.0793079733848572e-01 1.1010979861021042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1726 -1.4710490177094471e-05</internalNodes>
+          <leafValues>
+            9.5858857035636902e-02 -2.9641860723495483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1727 1.0538049973547459e-02</internalNodes>
+          <leafValues>
+            -7.9252541065216064e-02 3.7234848737716675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1728 -2.5260078837163746e-04</internalNodes>
+          <leafValues>
+            6.7121110856533051e-02 -3.0784338712692261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1729 -3.5665810573846102e-03</internalNodes>
+          <leafValues>
+            1.4667609333992004e-01 -1.7083789408206940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1730 -1.2677359627559781e-03</internalNodes>
+          <leafValues>
+            -4.9063721299171448e-01 2.0374119281768799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1731 -6.7669381387531757e-03</internalNodes>
+          <leafValues>
+            2.5767329335212708e-01 -7.4175901710987091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1732 -6.0447258874773979e-04</internalNodes>
+          <leafValues>
+            -1.9196410477161407e-01 9.1349847614765167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1733 -2.5375590194016695e-03</internalNodes>
+          <leafValues>
+            -3.5663878917694092e-01 5.1547251641750336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1734 -7.0200557820498943e-03</internalNodes>
+          <leafValues>
+            3.9719080924987793e-01 -4.3967988342046738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1735 -5.7049379684031010e-03</internalNodes>
+          <leafValues>
+            -5.0015491247177124e-01 2.9825929552316666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1736 1.4744909713044763e-03</internalNodes>
+          <leafValues>
+            5.8546211570501328e-02 -2.6139810681343079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1737 9.2834811657667160e-03</internalNodes>
+          <leafValues>
+            -4.2836759239435196e-02 3.3443170785903931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1738 9.9660153500735760e-04</internalNodes>
+          <leafValues>
+            -1.0425110161304474e-01 1.6191780567169189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1739 -7.5932733714580536e-02</internalNodes>
+          <leafValues>
+            -3.7356320023536682e-01 4.3075688183307648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1740 5.5370710470015183e-05</internalNodes>
+          <leafValues>
+            -1.4570540189743042e-01 1.1560150235891342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1741 1.4746849956281949e-05</internalNodes>
+          <leafValues>
+            -1.2972679734230042e-01 1.1747740209102631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1742 -1.4875919441692531e-04</internalNodes>
+          <leafValues>
+            -1.8002930283546448e-01 7.8782692551612854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1743 3.3751460723578930e-03</internalNodes>
+          <leafValues>
+            -7.7242009341716766e-02 1.8596859276294708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1744 3.4271259210072458e-04</internalNodes>
+          <leafValues>
+            -1.5393340587615967e-01 1.0472580045461655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1745 -4.5711229904554784e-04</internalNodes>
+          <leafValues>
+            -2.2300529479980469e-01 6.1818670481443405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1746 3.2788628595881164e-04</internalNodes>
+          <leafValues>
+            7.9448707401752472e-02 -1.8889829516410828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1747 -9.6754019614309072e-04</internalNodes>
+          <leafValues>
+            1.3137130439281464e-01 -1.0801070183515549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1748 1.0537009686231613e-02</internalNodes>
+          <leafValues>
+            2.2138269618153572e-02 -5.7479751110076904e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1749 5.6796409189701080e-03</internalNodes>
+          <leafValues>
+            -5.6034579873085022e-02 2.4849580228328705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1750 -8.8083967566490173e-03</internalNodes>
+          <leafValues>
+            -3.7167680263519287e-01 4.2726948857307434e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1751 -2.8319710865616798e-02</internalNodes>
+          <leafValues>
+            -6.2387847900390625e-01 2.0844049751758575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1752 1.3637860305607319e-02</internalNodes>
+          <leafValues>
+            1.4434239827096462e-02 -7.1537137031555176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1753 1.1822770349681377e-02</internalNodes>
+          <leafValues>
+            -4.3181091547012329e-02 3.0682548880577087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1754 -6.1035697581246495e-04</internalNodes>
+          <leafValues>
+            -2.0418339967727661e-01 6.2115620821714401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1755 -5.6125568225979805e-03</internalNodes>
+          <leafValues>
+            3.6485010385513306e-01 -3.5448960959911346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1756 1.4603640011046082e-05</internalNodes>
+          <leafValues>
+            -9.6096910536289215e-02 1.2142290174961090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1757 1.9061230123043060e-03</internalNodes>
+          <leafValues>
+            5.3135868161916733e-02 -2.2978909313678741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1758 -3.6644220817834139e-03</internalNodes>
+          <leafValues>
+            1.9614529609680176e-01 -6.8556912243366241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1759 1.2336249928921461e-03</internalNodes>
+          <leafValues>
+            -8.7000347673892975e-02 1.3920229673385620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1760 5.4660569876432419e-03</internalNodes>
+          <leafValues>
+            2.2660890594124794e-02 -4.8329529166221619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1761 -6.1730947345495224e-04</internalNodes>
+          <leafValues>
+            -2.1959540247917175e-01 5.5258519947528839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1762 2.9604700393974781e-03</internalNodes>
+          <leafValues>
+            -5.0548229366540909e-02 2.7476710081100464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1763 2.8015000745654106e-02</internalNodes>
+          <leafValues>
+            1.8874650821089745e-02 -6.0498368740081787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1764 -7.1651988946541678e-06</internalNodes>
+          <leafValues>
+            1.0836219787597656e-01 -1.0606969892978668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1765 -1.6367150470614433e-02</internalNodes>
+          <leafValues>
+            2.8645038604736328e-01 -3.7137690931558609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1766 1.0280719725415111e-03</internalNodes>
+          <leafValues>
+            5.6318141520023346e-02 -2.1795029938220978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1767 1.3662660494446754e-03</internalNodes>
+          <leafValues>
+            -4.6803500503301620e-02 2.3804000020027161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1768 7.6626739464700222e-03</internalNodes>
+          <leafValues>
+            2.1595260128378868e-02 -5.6847488880157471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1769 -4.5117521658539772e-03</internalNodes>
+          <leafValues>
+            -3.5794979333877563e-01 3.0485490337014198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1770 -4.3773967772722244e-03</internalNodes>
+          <leafValues>
+            2.3192660510540009e-01 -5.3999818861484528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1771 -7.2474628686904907e-03</internalNodes>
+          <leafValues>
+            -4.3440380692481995e-01 2.6374189183115959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1772 7.9146260395646095e-04</internalNodes>
+          <leafValues>
+            -9.9924586713314056e-02 1.1088500171899796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1773 6.4166806638240814e-02</internalNodes>
+          <leafValues>
+            1.8938669934868813e-02 -5.7849419116973877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1774 -1.1797840124927461e-04</internalNodes>
+          <leafValues>
+            -1.4889569580554962e-01 6.8777203559875488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1775 1.2801289558410645e-02</internalNodes>
+          <leafValues>
+            5.6179329752922058e-02 -2.0865969359874725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1776 -2.7018740773200989e-02</internalNodes>
+          <leafValues>
+            4.5356890559196472e-01 -2.5054579600691795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1777 -6.9431727752089500e-03</internalNodes>
+          <leafValues>
+            -5.2916550636291504e-01 2.1800139918923378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1778 3.3396780490875244e-03</internalNodes>
+          <leafValues>
+            -3.7295959889888763e-02 3.1198439002037048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1779 -3.8888349081389606e-04</internalNodes>
+          <leafValues>
+            -1.5630130469799042e-01 7.0981830358505249e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1780 -7.1400677552446723e-04</internalNodes>
+          <leafValues>
+            2.1799430251121521e-01 -5.4069280624389648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1781 1.2549630366265774e-02</internalNodes>
+          <leafValues>
+            1.7357179895043373e-02 -7.8320449590682983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1782 -1.4623020433646161e-05</internalNodes>
+          <leafValues>
+            7.8640103340148926e-02 -1.4212970435619354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1783 -1.2133170384913683e-03</internalNodes>
+          <leafValues>
+            -3.1371229887008667e-01 3.4287638962268829e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1784 3.6882720887660980e-03</internalNodes>
+          <leafValues>
+            -3.8382381200790405e-02 3.0124679207801819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1785 -1.4818239833402913e-05</internalNodes>
+          <leafValues>
+            1.2561169266700745e-01 -9.1703377664089203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1786 3.0302109662443399e-03</internalNodes>
+          <leafValues>
+            -2.9543070122599602e-02 3.7889540195465088e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1787 5.9340851294109598e-05</internalNodes>
+          <leafValues>
+            -1.7745719850063324e-01 7.0102430880069733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1788 -2.9449560315697454e-05</internalNodes>
+          <leafValues>
+            1.2052319943904877e-01 -1.1128979921340942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1789 -1.7771139740943909e-02</internalNodes>
+          <leafValues>
+            -4.7108310461044312e-01 2.5600789114832878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1790 7.6775359921157360e-03</internalNodes>
+          <leafValues>
+            -4.0757879614830017e-02 2.7021768689155579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1791 -1.8513019382953644e-01</internalNodes>
+          <leafValues>
+            -3.0238750576972961e-01 3.8790911436080933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1792 2.7697190642356873e-02</internalNodes>
+          <leafValues>
+            2.6712810620665550e-02 -4.4166600704193115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1793 -2.0427649840712547e-02</internalNodes>
+          <leafValues>
+            2.5086608529090881e-01 -5.5672701448202133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1794 9.0200370177626610e-03</internalNodes>
+          <leafValues>
+            4.7344069927930832e-02 -2.7445980906486511e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1795 -1.2504979968070984e-03</internalNodes>
+          <leafValues>
+            -1.4971190690994263e-01 7.9667650163173676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1796 -1.0021160356700420e-02</internalNodes>
+          <leafValues>
+            2.4248859286308289e-01 -4.9217909574508667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1797 2.6042328681796789e-04</internalNodes>
+          <leafValues>
+            6.3192427158355713e-02 -1.8544280529022217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1798 1.1920549441128969e-03</internalNodes>
+          <leafValues>
+            -8.6547911167144775e-02 1.3552339375019073e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1799 3.0391330365091562e-03</internalNodes>
+          <leafValues>
+            -7.2965219616889954e-02 1.6479800641536713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1800 -2.9615699531859718e-05</internalNodes>
+          <leafValues>
+            8.2047976553440094e-02 -1.4502969384193420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1801 -1.2226340360939503e-02</internalNodes>
+          <leafValues>
+            -5.3014177083969116e-01 2.0405799150466919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1802 -2.8124889358878136e-02</internalNodes>
+          <leafValues>
+            -5.5148762464523315e-01 1.7688119783997536e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1803 -4.8307109624147415e-02</internalNodes>
+          <leafValues>
+            -8.2579791545867920e-01 1.1020540259778500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1804 4.6184109523892403e-03</internalNodes>
+          <leafValues>
+            3.2069969922304153e-02 -3.0115368962287903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1805 -8.4275740664452314e-04</internalNodes>
+          <leafValues>
+            1.7034439742565155e-01 -6.3009433448314667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1806 6.3863280229270458e-03</internalNodes>
+          <leafValues>
+            1.6307299956679344e-02 -7.1346491575241089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1807 -7.7203067485243082e-04</internalNodes>
+          <leafValues>
+            1.6715280711650848e-01 -6.6192783415317535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1808 -2.2645338904112577e-03</internalNodes>
+          <leafValues>
+            -3.5107091069221497e-01 2.8168670833110809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1809 -3.7738790269941092e-03</internalNodes>
+          <leafValues>
+            5.2762818336486816e-01 -2.0222609862685204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1810 5.8204168453812599e-03</internalNodes>
+          <leafValues>
+            7.0864066481590271e-02 -1.4675390720367432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1811 -1.2069250456988811e-02</internalNodes>
+          <leafValues>
+            2.3928099870681763e-01 -4.4312968850135803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1812 3.3203759230673313e-03</internalNodes>
+          <leafValues>
+            -6.5749533474445343e-02 2.0277680456638336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1813 2.1621929481625557e-03</internalNodes>
+          <leafValues>
+            6.7407980561256409e-02 -1.8125349283218384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1814 1.2229150161147118e-02</internalNodes>
+          <leafValues>
+            2.2559309378266335e-02 -4.9180999398231506e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1815 -6.7253508605062962e-03</internalNodes>
+          <leafValues>
+            -1.5290050208568573e-01 6.9786652922630310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1816 2.3579499684274197e-03</internalNodes>
+          <leafValues>
+            4.9212101846933365e-02 -2.0838280022144318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1817 -2.2950689308345318e-03</internalNodes>
+          <leafValues>
+            1.2400440126657486e-01 -9.6624918282032013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1818 1.0958530474454165e-03</internalNodes>
+          <leafValues>
+            -7.3270753026008606e-02 1.5208619832992554e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1819 -1.3427219819277525e-03</internalNodes>
+          <leafValues>
+            1.2233039736747742e-01 -9.5689877867698669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1820 5.4691417608410120e-04</internalNodes>
+          <leafValues>
+            -1.3924160599708557e-01 8.4381736814975739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1821 8.4598818793892860e-03</internalNodes>
+          <leafValues>
+            8.9689873158931732e-02 -1.3318899273872375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1822 -9.1597117483615875e-02</internalNodes>
+          <leafValues>
+            -6.1854732036590576e-01 2.2867869585752487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1823 -1.1090439511463046e-03</internalNodes>
+          <leafValues>
+            5.8513749390840530e-02 -1.8806450068950653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1824 2.2256910597207025e-05</internalNodes>
+          <leafValues>
+            -8.4488280117511749e-02 1.2780910730361938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1825 -1.5437819820363075e-04</internalNodes>
+          <leafValues>
+            -1.2228029966354370e-01 8.6046978831291199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1826 -2.6862788945436478e-03</internalNodes>
+          <leafValues>
+            -2.4487000703811646e-01 4.4255960732698441e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1827 -4.0478641167283058e-03</internalNodes>
+          <leafValues>
+            2.7030688524246216e-01 -4.2200870811939240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1828 -5.3340241312980652e-02</internalNodes>
+          <leafValues>
+            -7.6232349872589111e-01 1.4388039708137512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1829 2.8256059158593416e-03</internalNodes>
+          <leafValues>
+            -2.9877070337533951e-02 3.9692971110343933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1830 1.4443730004131794e-02</internalNodes>
+          <leafValues>
+            3.0186710879206657e-02 -3.6606648564338684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1831 1.3111650478094816e-03</internalNodes>
+          <leafValues>
+            -4.8140369355678558e-02 2.2434459626674652e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1832 1.6730680363252759e-03</internalNodes>
+          <leafValues>
+            -5.9983398765325546e-02 1.6394190490245819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1833 2.3517120629549026e-02</internalNodes>
+          <leafValues>
+            2.4109700694680214e-02 -4.0492439270019531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1834 -3.5689130891114473e-03</internalNodes>
+          <leafValues>
+            3.1903558969497681e-01 -3.4295879304409027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1835 -2.8193008620291948e-04</internalNodes>
+          <leafValues>
+            -1.4874160289764404e-01 7.0669896900653839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1836 1.0215859860181808e-01</internalNodes>
+          <leafValues>
+            1.2840500101447105e-02 -7.7848541736602783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1837 -1.9175480306148529e-01</internalNodes>
+          <leafValues>
+            -7.5706577301025391e-01 1.0587760247290134e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1838 5.3162658587098122e-03</internalNodes>
+          <leafValues>
+            -4.0066570043563843e-02 2.6050180196762085e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1839 -1.1487120063975453e-03</internalNodes>
+          <leafValues>
+            -1.8017220497131348e-01 6.1610430479049683e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1840 -2.8316730260848999e-01</internalNodes>
+          <leafValues>
+            -8.4913408756256104e-01 1.1647139675915241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1841 3.3731758594512939e-02</internalNodes>
+          <leafValues>
+            1.2357609719038010e-01 -7.7482230961322784e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1842 9.8635945469141006e-03</internalNodes>
+          <leafValues>
+            4.3958030641078949e-02 -2.5541779398918152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1843 -3.1564768869429827e-03</internalNodes>
+          <leafValues>
+            1.8942989408969879e-01 -5.8221038430929184e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1844 1.5572150005027652e-03</internalNodes>
+          <leafValues>
+            -1.0376139730215073e-01 1.4107349514961243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1845 6.2360420823097229e-02</internalNodes>
+          <leafValues>
+            9.6462322399020195e-03 -8.5804969072341919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1846 1.1480550165288150e-04</internalNodes>
+          <leafValues>
+            -8.4419928491115570e-02 1.1312700062990189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1847 -5.9252730570733547e-03</internalNodes>
+          <leafValues>
+            -3.1650778651237488e-01 3.2079849392175674e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1848 -2.4660851340740919e-04</internalNodes>
+          <leafValues>
+            8.8697679340839386e-02 -1.1085110157728195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1849 1.6946049872785807e-03</internalNodes>
+          <leafValues>
+            -5.9657149016857147e-02 2.0904210209846497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1850 9.0623252617660910e-05</internalNodes>
+          <leafValues>
+            7.7441960573196411e-02 -1.2806339561939240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1851 1.1666920036077499e-03</internalNodes>
+          <leafValues>
+            -6.1748579144477844e-02 1.5702450275421143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1852 1.2541549513116479e-03</internalNodes>
+          <leafValues>
+            4.4608380645513535e-02 -2.3140360414981842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1853 -6.0275900177657604e-03</internalNodes>
+          <leafValues>
+            9.5281846821308136e-02 -1.0283090174198151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1854 -2.0472849905490875e-01</internalNodes>
+          <leafValues>
+            -4.1114759445190430e-01 2.3537550121545792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1855 1.7691280692815781e-02</internalNodes>
+          <leafValues>
+            -3.9257150143384933e-02 2.8564441204071045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1856 -1.2875649333000183e-01</internalNodes>
+          <leafValues>
+            -8.2030779123306274e-01 1.1735290288925171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1857 1.2868089834228158e-03</internalNodes>
+          <leafValues>
+            5.0858870148658752e-02 -1.7848010361194611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1858 -4.5859832316637039e-03</internalNodes>
+          <leafValues>
+            1.6802109777927399e-01 -6.1582598835229874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1859 4.6391240903176367e-04</internalNodes>
+          <leafValues>
+            6.6747047007083893e-02 -1.4237800240516663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1860 -4.4439961202442646e-03</internalNodes>
+          <leafValues>
+            4.5714980363845825e-01 -2.1746810525655746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1861 3.8220020942389965e-03</internalNodes>
+          <leafValues>
+            1.8094329163432121e-02 -6.0244542360305786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1862 1.3894500443711877e-03</internalNodes>
+          <leafValues>
+            3.4007851034402847e-02 -2.7153480052947998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1863 -7.2111929766833782e-03</internalNodes>
+          <leafValues>
+            2.7312570810317993e-01 -3.6855131387710571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1864 1.6509749693796039e-03</internalNodes>
+          <leafValues>
+            -8.4407016634941101e-02 1.3134449720382690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1865 -5.0506892148405313e-04</internalNodes>
+          <leafValues>
+            -1.4193339645862579e-01 7.3628053069114685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1866 -1.1205329559743404e-02</internalNodes>
+          <leafValues>
+            3.0093750357627869e-01 -3.4171391278505325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1867 -3.4860160667449236e-04</internalNodes>
+          <leafValues>
+            -2.4538309872150421e-01 5.9823978692293167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1868 7.3347258148714900e-04</internalNodes>
+          <leafValues>
+            -6.1770260334014893e-02 1.6367949545383453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1869 -9.2969406396150589e-03</internalNodes>
+          <leafValues>
+            -3.0236640572547913e-01 3.9257898926734924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1870 2.3957120254635811e-02</internalNodes>
+          <leafValues>
+            -2.3900719359517097e-02 4.8340830206871033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1871 3.6422210541786626e-05</internalNodes>
+          <leafValues>
+            -1.2283039838075638e-01 9.1258950531482697e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1872 5.0458200275897980e-02</internalNodes>
+          <leafValues>
+            1.3529149815440178e-02 -7.7827727794647217e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1873 -9.8683983087539673e-03</internalNodes>
+          <leafValues>
+            -4.4060459733009338e-01 2.0404359325766563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1874 -1.0851239785552025e-02</internalNodes>
+          <leafValues>
+            2.0165500044822693e-01 -5.2248589694499969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1875 1.7670930537860841e-04</internalNodes>
+          <leafValues>
+            -1.3691440224647522e-01 8.3170592784881592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1876 1.2582179624587297e-04</internalNodes>
+          <leafValues>
+            6.1275351792573929e-02 -1.6542710363864899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1877 -7.0588971721008420e-04</internalNodes>
+          <leafValues>
+            1.5219129621982574e-01 -6.6164620220661163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1878 1.1355109745636582e-03</internalNodes>
+          <leafValues>
+            -5.4115369915962219e-02 2.1311099827289581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1879 -3.7436310667544603e-03</internalNodes>
+          <leafValues>
+            -2.3469850420951843e-01 4.9591001123189926e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1880 1.2309269513934851e-03</internalNodes>
+          <leafValues>
+            -7.5196012854576111e-02 1.4646540582180023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1881 3.6228948738425970e-04</internalNodes>
+          <leafValues>
+            -9.7789406776428223e-02 1.2091729789972305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1882 7.5996189843863249e-04</internalNodes>
+          <leafValues>
+            6.9713920354843140e-02 -1.6278789937496185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1883 -1.8509250367060304e-03</internalNodes>
+          <leafValues>
+            -1.8382890522480011e-01 5.7501520961523056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1884 7.9539678990840912e-03</internalNodes>
+          <leafValues>
+            -5.8848708868026733e-02 1.8846440315246582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1885 -3.1013600528240204e-04</internalNodes>
+          <leafValues>
+            -1.4575460553169250e-01 7.2403199970722198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1886 1.6956350300461054e-03</internalNodes>
+          <leafValues>
+            7.0550262928009033e-02 -1.6740930080413818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1887 2.9058079235255718e-05</internalNodes>
+          <leafValues>
+            -1.0341589897871017e-01 9.5376282930374146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1888 1.4466919936239719e-02</internalNodes>
+          <leafValues>
+            -1.7532069236040115e-02 5.4767167568206787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1889 -5.7156499475240707e-02</internalNodes>
+          <leafValues>
+            -7.4789309501647949e-01 1.6394419595599174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1890 3.0681469943374395e-03</internalNodes>
+          <leafValues>
+            3.8702819496393204e-02 -2.4164369702339172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1891 3.7490210961550474e-03</internalNodes>
+          <leafValues>
+            -5.6555431336164474e-02 2.0308320224285126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1892 -1.0643450077623129e-03</internalNodes>
+          <leafValues>
+            -2.8211921453475952e-01 3.5207509994506836e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1893 -8.9807435870170593e-03</internalNodes>
+          <leafValues>
+            2.1754769980907440e-01 -5.0628181546926498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1894 2.4643479264341295e-04</internalNodes>
+          <leafValues>
+            7.2727531194686890e-02 -1.4768819510936737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1895 2.2197801154106855e-03</internalNodes>
+          <leafValues>
+            -3.6754861474037170e-02 2.6939278841018677e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>169</maxWeakCount>
+      <stageThreshold>-1.3372850418090820e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1896 -3.5328421741724014e-02</internalNodes>
+          <leafValues>
+            2.4123990535736084e-01 -2.7961900830268860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1897 2.6829841081053019e-03</internalNodes>
+          <leafValues>
+            -1.6362559795379639e-01 2.3433500528335571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1898 2.1330378949642181e-03</internalNodes>
+          <leafValues>
+            -2.0100639760494232e-01 1.5679529309272766e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1899 4.2972870869562030e-04</internalNodes>
+          <leafValues>
+            -3.7790980935096741e-01 7.4083693325519562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1900 -3.4645918756723404e-02</internalNodes>
+          <leafValues>
+            3.0556240677833557e-01 -8.3546526730060577e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1901 -1.4237920368032064e-05</internalNodes>
+          <leafValues>
+            8.2699142396450043e-02 -2.3583950102329254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1902 4.9165110103785992e-03</internalNodes>
+          <leafValues>
+            -1.9556050002574921e-01 9.6965387463569641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1903 6.0989488847553730e-03</internalNodes>
+          <leafValues>
+            7.8470550477504730e-02 -2.3209640383720398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1904 7.4874181300401688e-03</internalNodes>
+          <leafValues>
+            7.1725919842720032e-03 -5.1566261053085327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1905 4.2871991172432899e-03</internalNodes>
+          <leafValues>
+            4.0530510246753693e-02 -4.1086289286613464e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1906 1.6856180503964424e-02</internalNodes>
+          <leafValues>
+            -7.7506266534328461e-02 2.3657779395580292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1907 -1.0347689967602491e-03</internalNodes>
+          <leafValues>
+            -4.6704441308975220e-01 3.4468568861484528e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1908 1.6820980235934258e-03</internalNodes>
+          <leafValues>
+            -6.7206740379333496e-02 2.3671430349349976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1909 -1.2018240056931973e-02</internalNodes>
+          <leafValues>
+            -2.2372600436210632e-01 7.4281953275203705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1910 1.3802549801766872e-03</internalNodes>
+          <leafValues>
+            -9.9990189075469971e-02 1.5270860493183136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1911 -1.4281070232391357e-01</internalNodes>
+          <leafValues>
+            -2.8344118595123291e-01 6.2299348413944244e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1912 -1.5463490039110184e-02</internalNodes>
+          <leafValues>
+            2.9084190726280212e-01 -5.3395688533782959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1913 -9.9617196246981621e-04</internalNodes>
+          <leafValues>
+            -3.6011821031570435e-01 4.1922971606254578e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1914 -2.6956679299473763e-02</internalNodes>
+          <leafValues>
+            -4.3736729025840759e-01 3.1731128692626953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1915 -8.7780617177486420e-03</internalNodes>
+          <leafValues>
+            -5.0374472141265869e-01 2.5146849453449249e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1916 4.2969950300175697e-05</internalNodes>
+          <leafValues>
+            -1.5406499803066254e-01 8.8478356599807739e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1917 -6.2619051896035671e-03</internalNodes>
+          <leafValues>
+            2.2435919940471649e-01 -5.9849821031093597e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1918 -6.4296770142391324e-04</internalNodes>
+          <leafValues>
+            -2.4377089738845825e-01 5.9389740228652954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1919 -1.5573870041407645e-04</internalNodes>
+          <leafValues>
+            -1.6867999732494354e-01 7.8476317226886749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1920 4.1139780660159886e-04</internalNodes>
+          <leafValues>
+            -8.9017570018768311e-02 1.4019380509853363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1921 1.8635790329426527e-03</internalNodes>
+          <leafValues>
+            3.8603689521551132e-02 -3.2118970155715942e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1922 1.6059159534052014e-03</internalNodes>
+          <leafValues>
+            -7.8801520168781281e-02 1.5801469981670380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1923 8.6740078404545784e-04</internalNodes>
+          <leafValues>
+            5.4134480655193329e-02 -2.3538430035114288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1924 -7.9801032552495599e-04</internalNodes>
+          <leafValues>
+            1.3330009579658508e-01 -9.5731817185878754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1925 -4.8548211343586445e-03</internalNodes>
+          <leafValues>
+            -2.0736059546470642e-01 6.1038620769977570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1926 -1.1426740325987339e-02</internalNodes>
+          <leafValues>
+            1.7201809585094452e-01 -7.1152277290821075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1927 8.7062492966651917e-03</internalNodes>
+          <leafValues>
+            -7.2185672819614410e-02 1.9082969427108765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1928 -1.1634400580078363e-03</internalNodes>
+          <leafValues>
+            -1.3751690089702606e-01 9.1818131506443024e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1929 6.8914610892534256e-03</internalNodes>
+          <leafValues>
+            9.6225969493389130e-02 -1.3246159255504608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1930 -2.2426620125770569e-03</internalNodes>
+          <leafValues>
+            3.5683241486549377e-01 -3.6280050873756409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1931 1.2301520444452763e-02</internalNodes>
+          <leafValues>
+            4.6940989792346954e-02 -3.0623328685760498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1932 3.9963610470294952e-03</internalNodes>
+          <leafValues>
+            -8.2999393343925476e-02 1.5486459434032440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1933 -2.2026189981261268e-05</internalNodes>
+          <leafValues>
+            1.1778099834918976e-01 -1.1899650096893311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1934 5.8708270080387592e-04</internalNodes>
+          <leafValues>
+            5.6864660233259201e-02 -2.2509899735450745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1935 -5.8760121464729309e-03</internalNodes>
+          <leafValues>
+            2.6625269651412964e-01 -4.4570129364728928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1936 4.3262130930088460e-04</internalNodes>
+          <leafValues>
+            5.8049838989973068e-02 -2.1173800528049469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1937 4.7852578572928905e-03</internalNodes>
+          <leafValues>
+            -4.0710568428039551e-02 2.9509121179580688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1938 4.5480159315047786e-05</internalNodes>
+          <leafValues>
+            -1.8201610445976257e-01 6.0179539024829865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1939 2.5633929762989283e-03</internalNodes>
+          <leafValues>
+            -8.7039761245250702e-02 1.2692840397357941e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1940 -4.7383471392095089e-03</internalNodes>
+          <leafValues>
+            2.3961830139160156e-01 -4.9914900213479996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1941 4.4647231698036194e-03</internalNodes>
+          <leafValues>
+            4.0540020912885666e-02 -3.2467570900917053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1942 -6.7061209119856358e-03</internalNodes>
+          <leafValues>
+            -3.2789680361747742e-01 3.2299648970365524e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1943 7.1761049330234528e-02</internalNodes>
+          <leafValues>
+            -2.3713670670986176e-02 4.7772058844566345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1944 3.0584860593080521e-02</internalNodes>
+          <leafValues>
+            1.6793910413980484e-02 -7.8061228990554810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1945 3.8672669325023890e-03</internalNodes>
+          <leafValues>
+            -2.4876890704035759e-02 5.1260662078857422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1946 -5.2802208811044693e-02</internalNodes>
+          <leafValues>
+            -5.0759661197662354e-01 2.3873040452599525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1947 -6.5651582553982735e-04</internalNodes>
+          <leafValues>
+            -2.0122329890727997e-01 4.9672801047563553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1948 8.5785267874598503e-03</internalNodes>
+          <leafValues>
+            -4.5007020235061646e-02 2.3518909513950348e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1949 -1.2620680499821901e-03</internalNodes>
+          <leafValues>
+            -1.9962050020694733e-01 5.5564209818840027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1950 1.4215289615094662e-02</internalNodes>
+          <leafValues>
+            -4.6983979642391205e-02 2.0781150460243225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1951 1.6393810510635376e-01</internalNodes>
+          <leafValues>
+            1.4973269775509834e-02 -6.5025687217712402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1952 1.4837640523910522e-01</internalNodes>
+          <leafValues>
+            8.1885885447263718e-03 -9.4296187162399292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1953 1.4631190424552187e-05</internalNodes>
+          <leafValues>
+            -1.2383759766817093e-01 8.2489579916000366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1954 -3.3909391611814499e-02</internalNodes>
+          <leafValues>
+            -2.2818760573863983e-01 4.3302498757839203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1955 3.8288589566946030e-03</internalNodes>
+          <leafValues>
+            -3.7276919931173325e-02 2.7613049745559692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1956 8.0947913229465485e-03</internalNodes>
+          <leafValues>
+            2.8445359319448471e-02 -3.9388808608055115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1957 -7.0019601844251156e-04</internalNodes>
+          <leafValues>
+            1.2199380248785019e-01 -9.2714257538318634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1958 3.4412490203976631e-03</internalNodes>
+          <leafValues>
+            -4.8972681164741516e-02 2.0617230236530304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1959 -1.6337490081787109e-01</internalNodes>
+          <leafValues>
+            -6.1850237846374512e-01 1.6467820852994919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1960 6.5640709362924099e-03</internalNodes>
+          <leafValues>
+            1.1007189750671387e-01 -9.2340007424354553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1961 4.4708838686347008e-04</internalNodes>
+          <leafValues>
+            -1.3933309912681580e-01 7.7039696276187897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1962 1.7568700015544891e-02</internalNodes>
+          <leafValues>
+            9.7569692879915237e-03 -8.0032902956008911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1963 -1.9571769516915083e-03</internalNodes>
+          <leafValues>
+            2.8000330924987793e-01 -3.6428239196538925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1964 5.1913037896156311e-04</internalNodes>
+          <leafValues>
+            5.3515341132879257e-02 -1.9425579905509949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1965 9.6273031085729599e-03</internalNodes>
+          <leafValues>
+            3.1317751854658127e-02 -3.1802541017532349e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1966 -5.0332810729742050e-02</internalNodes>
+          <leafValues>
+            5.6659060716629028e-01 -1.8494980409741402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1967 -6.4624901860952377e-03</internalNodes>
+          <leafValues>
+            -4.1894671320915222e-01 2.7350850403308868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1968 -5.2857249975204468e-03</internalNodes>
+          <leafValues>
+            1.7756509780883789e-01 -5.8377739042043686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1969 9.9454462528228760e-02</internalNodes>
+          <leafValues>
+            1.6487719491124153e-02 -5.8526170253753662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1970 2.1917840058449656e-04</internalNodes>
+          <leafValues>
+            -1.0714250057935715e-01 9.1884173452854156e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1971 -4.3873358663404360e-05</internalNodes>
+          <leafValues>
+            7.8036926686763763e-02 -1.2723919749259949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1972 -6.7227642284706235e-04</internalNodes>
+          <leafValues>
+            -2.5709420442581177e-01 3.8843378424644470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1973 1.1754270235542208e-04</internalNodes>
+          <leafValues>
+            -7.9695962369441986e-02 1.2093970179557800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1974 4.6061190962791443e-01</internalNodes>
+          <leafValues>
+            1.3886069878935814e-02 -6.5241271257400513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1975 1.1115600354969501e-02</internalNodes>
+          <leafValues>
+            1.3871660456061363e-02 -6.0222518444061279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1976 9.0776477009057999e-03</internalNodes>
+          <leafValues>
+            -3.6118660122156143e-02 2.5702419877052307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1977 -4.9597548786550760e-04</internalNodes>
+          <leafValues>
+            1.1017049849033356e-01 -8.9249506592750549e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1978 1.5807070303708315e-03</internalNodes>
+          <leafValues>
+            4.8131279647350311e-02 -2.0215910673141479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1979 -6.9012932479381561e-02</internalNodes>
+          <leafValues>
+            -8.1536060571670532e-01 1.0660010389983654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1980 1.9330780196469277e-04</internalNodes>
+          <leafValues>
+            -1.1231829971075058e-01 8.5046432912349701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1981 7.8813207801431417e-04</internalNodes>
+          <leafValues>
+            -5.5200818926095963e-02 1.7654439806938171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1982 9.5367128960788250e-04</internalNodes>
+          <leafValues>
+            5.4411198943853378e-02 -1.8674199283123016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1983 -2.3191540967673063e-03</internalNodes>
+          <leafValues>
+            -2.7544409036636353e-01 3.8513321429491043e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1984 9.5087959198281169e-04</internalNodes>
+          <leafValues>
+            -6.8218901753425598e-02 1.6082139313220978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1985 9.5385108143091202e-03</internalNodes>
+          <leafValues>
+            -3.8826879113912582e-02 3.0370831489562988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1986 -1.4489189721643925e-02</internalNodes>
+          <leafValues>
+            -4.6989730000495911e-01 2.3550020530819893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1987 1.0756050236523151e-02</internalNodes>
+          <leafValues>
+            2.0565100014209747e-02 -4.7243130207061768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1988 -2.0074830390512943e-03</internalNodes>
+          <leafValues>
+            -2.7946698665618896e-01 3.6021549254655838e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1989 -1.7316909506917000e-03</internalNodes>
+          <leafValues>
+            2.0902790129184723e-01 -4.6300981193780899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1990 1.5234799683094025e-01</internalNodes>
+          <leafValues>
+            1.4934250153601170e-02 -6.0461127758026123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1991 6.3340878114104271e-04</internalNodes>
+          <leafValues>
+            5.0307150930166245e-02 -1.8277199566364288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1992 -8.2793915644288063e-03</internalNodes>
+          <leafValues>
+            3.6463031172752380e-01 -2.6474289596080780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1993 1.3667670078575611e-02</internalNodes>
+          <leafValues>
+            1.2511620298027992e-02 -8.9023828506469727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1994 2.0979309920221567e-03</internalNodes>
+          <leafValues>
+            -8.0247193574905396e-02 1.2989950180053711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1995 -8.9776562526822090e-03</internalNodes>
+          <leafValues>
+            1.7411080002784729e-01 -6.1771109700202942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1996 1.2094390112906694e-03</internalNodes>
+          <leafValues>
+            6.8711720407009125e-02 -1.6561290621757507e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1997 6.8200258538126945e-03</internalNodes>
+          <leafValues>
+            5.7795759290456772e-02 -1.8231619894504547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1998 -1.8268059939146042e-03</internalNodes>
+          <leafValues>
+            1.3340330123901367e-01 -7.5343966484069824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1999 7.9908408224582672e-03</internalNodes>
+          <leafValues>
+            -4.5094471424818039e-02 2.4594159424304962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2000 -2.5262041017413139e-03</internalNodes>
+          <leafValues>
+            -2.0763960480690002e-01 5.2334129810333252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2001 -7.4825510382652283e-02</internalNodes>
+          <leafValues>
+            -5.4688757658004761e-01 1.7803389579057693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2002 -3.3099399879574776e-03</internalNodes>
+          <leafValues>
+            3.3455818891525269e-01 -2.8966419398784637e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2003 8.2276277244091034e-03</internalNodes>
+          <leafValues>
+            4.1579861193895340e-02 -2.6652270555496216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2004 3.1686299480497837e-03</internalNodes>
+          <leafValues>
+            -4.1817110031843185e-02 2.9769781231880188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2005 1.5170290134847164e-02</internalNodes>
+          <leafValues>
+            4.3392360210418701e-02 -2.4617969989776611e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2006 -1.5946379862725735e-03</internalNodes>
+          <leafValues>
+            1.5057189762592316e-01 -7.3017738759517670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2007 -8.5226353257894516e-03</internalNodes>
+          <leafValues>
+            -1.5050080418586731e-01 6.9656036794185638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2008 -1.1418120004236698e-02</internalNodes>
+          <leafValues>
+            1.2974749505519867e-01 -9.5122329890727997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2009 -2.8856399655342102e-01</internalNodes>
+          <leafValues>
+            -2.1124540269374847e-01 4.7410819679498672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2010 -3.9014229550957680e-03</internalNodes>
+          <leafValues>
+            -2.6843780279159546e-01 3.8698658347129822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2011 -3.5567739978432655e-03</internalNodes>
+          <leafValues>
+            2.3385030031204224e-01 -4.5723881572484970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2012 -6.4394129440188408e-03</internalNodes>
+          <leafValues>
+            -6.0463881492614746e-01 1.6156049445271492e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2013 -7.4861319735646248e-03</internalNodes>
+          <leafValues>
+            1.6867969930171967e-01 -5.5975880473852158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2014 2.3621210129931569e-04</internalNodes>
+          <leafValues>
+            5.3596749901771545e-02 -2.1872919797897339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2015 2.6099249720573425e-02</internalNodes>
+          <leafValues>
+            -5.3937491029500961e-02 2.2728930413722992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2016 -1.7809759592637420e-03</internalNodes>
+          <leafValues>
+            8.6759522557258606e-02 -1.2009979784488678e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2017 -1.1987469770247117e-04</internalNodes>
+          <leafValues>
+            -1.5347549319267273e-01 7.0707783102989197e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2018 -6.8248361349105835e-03</internalNodes>
+          <leafValues>
+            -3.7341019511222839e-01 2.6779960840940475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2019 -1.3119089999236166e-04</internalNodes>
+          <leafValues>
+            -1.1640869826078415e-01 8.7211161851882935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2020 -1.8228540429845452e-03</internalNodes>
+          <leafValues>
+            1.5664499998092651e-01 -6.8006090819835663e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2021 2.6267999783158302e-03</internalNodes>
+          <leafValues>
+            -3.6987219005823135e-02 2.6393121480941772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2022 -7.0677183568477631e-02</internalNodes>
+          <leafValues>
+            -2.8295999765396118e-01 3.5035520792007446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2023 1.8061319366097450e-02</internalNodes>
+          <leafValues>
+            -2.8041649609804153e-02 3.5313779115676880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2024 9.2649407451972365e-04</internalNodes>
+          <leafValues>
+            4.4600278139114380e-02 -2.2788539528846741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2025 -5.3023721557110548e-04</internalNodes>
+          <leafValues>
+            -2.0866680145263672e-01 6.2718503177165985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2026 3.6058931145817041e-03</internalNodes>
+          <leafValues>
+            -6.7796908318996429e-02 1.4900009334087372e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2027 8.5915643721818924e-03</internalNodes>
+          <leafValues>
+            -4.5626759529113770e-02 2.3078480362892151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2028 -8.8329352438449860e-03</internalNodes>
+          <leafValues>
+            -4.1117089986801147e-01 2.8230689465999603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2029 4.0959479520097375e-04</internalNodes>
+          <leafValues>
+            5.3656630218029022e-02 -1.8243549764156342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2030 -2.5011589750647545e-03</internalNodes>
+          <leafValues>
+            1.6313549876213074e-01 -6.0954701155424118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2031 -1.4622169546782970e-02</internalNodes>
+          <leafValues>
+            -4.9988400936126709e-01 1.8572760745882988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2032 -6.3790678977966309e-02</internalNodes>
+          <leafValues>
+            -4.8329600691795349e-01 1.7903389409184456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2033 -1.6671139746904373e-02</internalNodes>
+          <leafValues>
+            -2.6661589741706848e-01 3.4886009991168976e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2034 -1.2526069767773151e-02</internalNodes>
+          <leafValues>
+            3.4061339497566223e-01 -2.8094800189137459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2035 4.8325158655643463e-02</internalNodes>
+          <leafValues>
+            -3.3176191151142120e-02 2.9025658965110779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2036 1.3246550224721432e-03</internalNodes>
+          <leafValues>
+            3.7181440740823746e-02 -2.6850658655166626e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2037 -2.2221319377422333e-01</internalNodes>
+          <leafValues>
+            -8.9892768859863281e-01 1.0064439848065376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2038 1.2954319827258587e-03</internalNodes>
+          <leafValues>
+            -1.0161759704351425e-01 9.0588621795177460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2039 1.3794669881463051e-02</internalNodes>
+          <leafValues>
+            -7.4244648218154907e-02 1.4314259588718414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2040 8.5643801139667630e-04</internalNodes>
+          <leafValues>
+            5.9753969311714172e-02 -1.8660190701484680e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2041 -2.3317540064454079e-02</internalNodes>
+          <leafValues>
+            -6.9259917736053467e-01 1.3667319901287556e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2042 1.6281680436804891e-03</internalNodes>
+          <leafValues>
+            -6.1060748994350433e-02 1.5505290031433105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2043 -1.2380329892039299e-02</internalNodes>
+          <leafValues>
+            -1.5146850049495697e-01 6.1767600476741791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2044 1.8393599893897772e-03</internalNodes>
+          <leafValues>
+            -3.7167988717556000e-02 2.4822179973125458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2045 3.5529870074242353e-03</internalNodes>
+          <leafValues>
+            -2.9200790449976921e-02 3.3592289686203003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2046 1.0305979521945119e-03</internalNodes>
+          <leafValues>
+            3.7694081664085388e-02 -2.9085698723793030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2047 2.9916960556874983e-05</internalNodes>
+          <leafValues>
+            -8.8014192879199982e-02 1.0515210032463074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2048 -4.1505339322611690e-04</internalNodes>
+          <leafValues>
+            6.5726242959499359e-02 -1.5021100640296936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2049 -1.4631619706051424e-05</internalNodes>
+          <leafValues>
+            7.8170351684093475e-02 -1.1962439864873886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2050 -4.3779090046882629e-03</internalNodes>
+          <leafValues>
+            2.0752459764480591e-01 -5.2089329808950424e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2051 4.7036199248395860e-04</internalNodes>
+          <leafValues>
+            6.3348479568958282e-02 -1.8767729401588440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2052 1.4788640328333713e-05</internalNodes>
+          <leafValues>
+            -9.5828853547573090e-02 1.1213099956512451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2053 3.7048431113362312e-04</internalNodes>
+          <leafValues>
+            -9.8723009228706360e-02 9.8647676408290863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2054 -1.8590339459478855e-03</internalNodes>
+          <leafValues>
+            -2.6873630285263062e-01 3.8352578878402710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2055 -7.0764529518783092e-03</internalNodes>
+          <leafValues>
+            -1.5984000265598297e-01 5.7841330766677856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2056 1.4920010231435299e-02</internalNodes>
+          <leafValues>
+            -5.1178149878978729e-02 1.9242909550666809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2057 -5.0713191740214825e-03</internalNodes>
+          <leafValues>
+            1.3863259553909302e-01 -1.1121229827404022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2058 -1.5005500055849552e-02</internalNodes>
+          <leafValues>
+            4.8583930730819702e-01 -1.8811760470271111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2059 -2.0439480431377888e-03</internalNodes>
+          <leafValues>
+            -3.2754859328269958e-01 2.7816310524940491e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2060 -1.3060690253041685e-04</internalNodes>
+          <leafValues>
+            9.8868042230606079e-02 -8.4957577288150787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2061 8.8742617517709732e-03</internalNodes>
+          <leafValues>
+            -2.5235600769519806e-02 3.2389879226684570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2062 7.0397509261965752e-04</internalNodes>
+          <leafValues>
+            5.6327521800994873e-02 -1.7392079532146454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2063 -2.5402469560503960e-02</internalNodes>
+          <leafValues>
+            1.9675390422344208e-01 -4.7362301498651505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2064 -9.3743661418557167e-03</internalNodes>
+          <leafValues>
+            -1.5204219520092010e-01 5.9932630509138107e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>178</maxWeakCount>
+      <stageThreshold>-1.3418790102005005e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2065 4.0453020483255386e-02</internalNodes>
+          <leafValues>
+            -2.3637829720973969e-01 2.8865531086921692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2066 -1.1056049726903439e-02</internalNodes>
+          <leafValues>
+            1.6062900424003601e-01 -2.6259741187095642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2067 -3.9778949576430023e-04</internalNodes>
+          <leafValues>
+            1.1591099947690964e-01 -2.7081018686294556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2068 1.0191530454903841e-03</internalNodes>
+          <leafValues>
+            -2.0969370007514954e-01 1.3642899692058563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2069 3.6101979203522205e-03</internalNodes>
+          <leafValues>
+            -2.1725459396839142e-01 1.2617790699005127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2070 4.4545531272888184e-04</internalNodes>
+          <leafValues>
+            -1.5974539518356323e-01 1.2596489489078522e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2071 5.8226222172379494e-03</internalNodes>
+          <leafValues>
+            -1.5484449267387390e-01 9.7783811390399933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2072 -2.1416260860860348e-03</internalNodes>
+          <leafValues>
+            -3.6377671360969543e-01 4.0103349834680557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2073 -2.6691620587371290e-04</internalNodes>
+          <leafValues>
+            8.4470756351947784e-02 -1.7496100068092346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2074 -5.4352330043911934e-03</internalNodes>
+          <leafValues>
+            -3.1830930709838867e-01 4.9786038696765900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2075 -1.5426309546455741e-03</internalNodes>
+          <leafValues>
+            -2.1333709359169006e-01 6.4884513616561890e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2076 -2.7932289522141218e-03</internalNodes>
+          <leafValues>
+            2.5483250617980957e-01 -6.5170928835868835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2077 1.3845940120518208e-03</internalNodes>
+          <leafValues>
+            3.9304580539464951e-02 -3.7404829263687134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2078 -3.2193479128181934e-03</internalNodes>
+          <leafValues>
+            2.6290428638458252e-01 -5.6396361440420151e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2079 -9.7977351397275925e-03</internalNodes>
+          <leafValues>
+            3.2044389843940735e-01 -4.6382289379835129e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2080 -1.7625789623707533e-03</internalNodes>
+          <leafValues>
+            1.5050819516181946e-01 -8.8892437517642975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2081 -3.6096889525651932e-02</internalNodes>
+          <leafValues>
+            -4.3137839436531067e-01 3.1785801053047180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2082 2.0813369192183018e-03</internalNodes>
+          <leafValues>
+            -6.5957918763160706e-02 1.9275289773941040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2083 -6.0533690266311169e-03</internalNodes>
+          <leafValues>
+            -3.1374609470367432e-01 5.1007431000471115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2084 3.7253410555422306e-03</internalNodes>
+          <leafValues>
+            -6.1402589082717896e-02 2.5631371140480042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2085 5.0668260082602501e-03</internalNodes>
+          <leafValues>
+            5.7962730526924133e-02 -2.4340160191059113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2086 2.8038739692419767e-03</internalNodes>
+          <leafValues>
+            -7.0329703390598297e-02 2.1375860273838043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2087 1.5925259795039892e-03</internalNodes>
+          <leafValues>
+            2.6637760922312737e-02 -5.1129138469696045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2088 2.9422679290291853e-05</internalNodes>
+          <leafValues>
+            -2.1710200607776642e-01 6.4985051751136780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2089 -2.2399190129362978e-05</internalNodes>
+          <leafValues>
+            8.1582568585872650e-02 -1.5135610103607178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2090 6.7072827368974686e-04</internalNodes>
+          <leafValues>
+            1.0502190142869949e-01 -1.1787360161542892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2091 -1.5262300148606300e-03</internalNodes>
+          <leafValues>
+            -3.4620371460914612e-01 3.9244089275598526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2092 1.8151829717680812e-03</internalNodes>
+          <leafValues>
+            -7.4669457972049713e-02 1.6847759485244751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2093 5.8078771689906716e-04</internalNodes>
+          <leafValues>
+            -9.7952410578727722e-02 1.4192749559879303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2094 -8.9623313397169113e-03</internalNodes>
+          <leafValues>
+            -1.9601620733737946e-01 6.6268041729927063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2095 1.1146809905767441e-01</internalNodes>
+          <leafValues>
+            1.7000140622258186e-02 -6.4917707443237305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2096 -1.7872039461508393e-04</internalNodes>
+          <leafValues>
+            -1.4053599536418915e-01 8.0108702182769775e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2097 -4.6587768010795116e-03</internalNodes>
+          <leafValues>
+            1.9530229270458221e-01 -5.8602340519428253e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2098 3.4576000180095434e-03</internalNodes>
+          <leafValues>
+            5.9805799275636673e-02 -2.1990789473056793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2099 -1.9979270291514695e-04</internalNodes>
+          <leafValues>
+            -1.3726149499416351e-01 8.3430230617523193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2100 -4.8079751431941986e-03</internalNodes>
+          <leafValues>
+            5.5041921138763428e-01 -2.0715299993753433e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2101 -7.3389292083447799e-06</internalNodes>
+          <leafValues>
+            7.5302027165889740e-02 -1.4486590027809143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2102 -3.5799799952656031e-03</internalNodes>
+          <leafValues>
+            2.6277220249176025e-01 -4.2550459504127502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2103 1.1689850362017751e-03</internalNodes>
+          <leafValues>
+            -1.0984169691801071e-01 1.2971849739551544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2104 3.2639548182487488e-02</internalNodes>
+          <leafValues>
+            3.1038379296660423e-02 -3.9474260807037354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2105 1.1596709955483675e-03</internalNodes>
+          <leafValues>
+            5.2021898329257965e-02 -2.2035829722881317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2106 -1.4262240147218108e-03</internalNodes>
+          <leafValues>
+            1.0745699703693390e-01 -1.0067079961299896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2107 -2.3668329417705536e-01</internalNodes>
+          <leafValues>
+            -7.3174351453781128e-01 1.6999609768390656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2108 1.9279429398011416e-04</internalNodes>
+          <leafValues>
+            -1.3248440623283386e-01 7.8186027705669403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2109 -1.7292149364948273e-02</internalNodes>
+          <leafValues>
+            -9.7199842333793640e-02 1.1069560050964355e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2110 -1.2431619688868523e-03</internalNodes>
+          <leafValues>
+            1.7741470038890839e-01 -7.2548337280750275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2111 2.1754560293629766e-05</internalNodes>
+          <leafValues>
+            -9.6952050924301147e-02 1.0899409651756287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2112 3.0975879053585231e-04</internalNodes>
+          <leafValues>
+            6.2249891459941864e-02 -1.7384719848632812e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2113 -1.1590570211410522e-02</internalNodes>
+          <leafValues>
+            2.6162809133529663e-01 -4.1994079947471619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2114 1.8150920048356056e-02</internalNodes>
+          <leafValues>
+            2.6353549212217331e-02 -4.4685411453247070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2115 8.0223509576171637e-04</internalNodes>
+          <leafValues>
+            -1.2143869698047638e-01 8.7092787027359009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2116 -1.4258639421314001e-03</internalNodes>
+          <leafValues>
+            1.9236080348491669e-01 -5.2987430244684219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2117 -2.4536260752938688e-04</internalNodes>
+          <leafValues>
+            -1.6683700680732727e-01 6.5604820847511292e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2118 2.2050029656384140e-05</internalNodes>
+          <leafValues>
+            -9.3477472662925720e-02 1.0711719840764999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2119 4.7658861149102449e-04</internalNodes>
+          <leafValues>
+            -8.0596633255481720e-02 1.2512689828872681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2120 4.0533850551582873e-04</internalNodes>
+          <leafValues>
+            6.8990617990493774e-02 -1.5740759670734406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2121 -1.6471749171614647e-02</internalNodes>
+          <leafValues>
+            -5.9667861461639404e-01 1.8876109272241592e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2122 2.2267159074544907e-03</internalNodes>
+          <leafValues>
+            -4.5803830027580261e-02 2.3071089386940002e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2123 4.9383189529180527e-02</internalNodes>
+          <leafValues>
+            1.9837729632854462e-02 -5.9306108951568604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2124 8.6411498486995697e-03</internalNodes>
+          <leafValues>
+            2.8697369620203972e-02 -3.5161119699478149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2125 -4.8241391777992249e-03</internalNodes>
+          <leafValues>
+            2.2474339604377747e-01 -4.8463210463523865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2126 -8.6174849420785904e-03</internalNodes>
+          <leafValues>
+            -5.7088959217071533e-01 1.9183190539479256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2127 -5.7220697635784745e-04</internalNodes>
+          <leafValues>
+            1.1697269976139069e-01 -8.8938057422637939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2128 1.1997730471193790e-03</internalNodes>
+          <leafValues>
+            8.4181122481822968e-02 -1.2565499544143677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2129 2.6049909647554159e-03</internalNodes>
+          <leafValues>
+            5.9500031173229218e-02 -2.0638149976730347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2130 -1.4789920533075929e-03</internalNodes>
+          <leafValues>
+            2.5114980340003967e-01 -4.7535050660371780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2131 -2.5746721029281616e-01</internalNodes>
+          <leafValues>
+            -7.3038768768310547e-01 1.5440680086612701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2132 -1.2104290071874857e-03</internalNodes>
+          <leafValues>
+            1.8646970391273499e-01 -5.5789809674024582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2133 3.4140399657189846e-04</internalNodes>
+          <leafValues>
+            6.7707672715187073e-02 -1.5597160160541534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2134 3.1749058980494738e-03</internalNodes>
+          <leafValues>
+            3.5003460943698883e-02 -2.9529309272766113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2135 4.4338819384574890e-01</internalNodes>
+          <leafValues>
+            1.4550019986927509e-02 -6.1034661531448364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2136 3.9458259940147400e-02</internalNodes>
+          <leafValues>
+            -4.5779328793287277e-02 2.2927519679069519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2137 3.0410829931497574e-03</internalNodes>
+          <leafValues>
+            1.6304129734635353e-02 -5.7491117715835571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2138 -1.4853020012378693e-01</internalNodes>
+          <leafValues>
+            -5.6220901012420654e-01 1.5771050006151199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2139 4.4339009036775678e-05</internalNodes>
+          <leafValues>
+            -9.1284371912479401e-02 1.0920979827642441e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2140 2.2139810025691986e-03</internalNodes>
+          <leafValues>
+            -4.7668289393186569e-02 2.2291789948940277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2141 8.7831966578960419e-02</internalNodes>
+          <leafValues>
+            2.6718059554696083e-02 -4.0396329760551453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2142 -2.2798930294811726e-03</internalNodes>
+          <leafValues>
+            -1.6160930693149567e-01 6.6071107983589172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2143 -1.4653969628852792e-05</internalNodes>
+          <leafValues>
+            8.5298359394073486e-02 -1.2724019587039948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2144 1.2313240440562367e-03</internalNodes>
+          <leafValues>
+            -6.5917477011680603e-02 1.6606420278549194e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2145 4.5110988616943359e-01</internalNodes>
+          <leafValues>
+            1.3457960449159145e-02 -7.1525502204895020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2146 -2.4518640711903572e-02</internalNodes>
+          <leafValues>
+            -4.3282639980316162e-01 2.0400719717144966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2147 -1.1901959805982187e-04</internalNodes>
+          <leafValues>
+            8.9420333504676819e-02 -1.1834760010242462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2148 -1.3584910193458200e-03</internalNodes>
+          <leafValues>
+            2.4722290039062500e-01 -4.3907400220632553e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2149 6.9289728999137878e-03</internalNodes>
+          <leafValues>
+            -5.6832619011402130e-02 1.6665740311145782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2150 -6.9041848182678223e-03</internalNodes>
+          <leafValues>
+            -1.2742209434509277e-01 7.9310603439807892e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2151 1.2964820489287376e-03</internalNodes>
+          <leafValues>
+            7.2462439537048340e-02 -1.6863870620727539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2152 2.3060059174895287e-02</internalNodes>
+          <leafValues>
+            -5.0913080573081970e-02 2.1664789319038391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2153 -4.0960568934679031e-02</internalNodes>
+          <leafValues>
+            -5.6479138135910034e-01 1.9609550014138222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2154 7.4867479270324111e-05</internalNodes>
+          <leafValues>
+            -6.9450333714485168e-02 1.4615139365196228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2155 -6.8458272144198418e-03</internalNodes>
+          <leafValues>
+            6.6049978137016296e-02 -2.0840729773044586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2156 1.9395649433135986e-02</internalNodes>
+          <leafValues>
+            1.6168899834156036e-02 -5.6396162509918213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2157 -1.6121419321279973e-04</internalNodes>
+          <leafValues>
+            -1.3194569945335388e-01 7.4094116687774658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2158 6.6511691547930241e-03</internalNodes>
+          <leafValues>
+            -5.5261820554733276e-02 1.9894389808177948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2159 4.5172171667218208e-03</internalNodes>
+          <leafValues>
+            3.2863661646842957e-02 -3.0980890989303589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2160 -4.0247041732072830e-02</internalNodes>
+          <leafValues>
+            -6.8980348110198975e-01 1.2438739649951458e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2161 7.2544030444987584e-06</internalNodes>
+          <leafValues>
+            -9.5949873328208923e-02 9.7919799387454987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2162 -1.6025650501251221e-01</internalNodes>
+          <leafValues>
+            4.9472638964653015e-01 -1.8643429502844810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2163 5.0598900998011231e-04</internalNodes>
+          <leafValues>
+            -1.2216579914093018e-01 8.6699098348617554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2164 -1.0506899654865265e-01</internalNodes>
+          <leafValues>
+            -8.5855627059936523e-01 8.2870386540889740e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2165 -1.8218380212783813e-01</internalNodes>
+          <leafValues>
+            -5.8477312326431274e-01 1.3160600326955318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2166 1.6435410827398300e-02</internalNodes>
+          <leafValues>
+            1.6296360641717911e-02 -5.5137562751770020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2167 1.9282519817352295e-02</internalNodes>
+          <leafValues>
+            -2.5027479976415634e-02 4.3645161390304565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2168 3.4772949293255806e-03</internalNodes>
+          <leafValues>
+            3.1632781028747559e-02 -2.9246759414672852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2169 2.2620869800448418e-02</internalNodes>
+          <leafValues>
+            -2.3985739797353745e-02 4.3105301260948181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2170 -1.8172320723533630e-01</internalNodes>
+          <leafValues>
+            -1.8037860095500946e-01 5.1903489977121353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2171 -4.3819830752909184e-03</internalNodes>
+          <leafValues>
+            -2.8302851319313049e-01 3.3024039119482040e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2172 -1.5246120281517506e-02</internalNodes>
+          <leafValues>
+            2.3519919812679291e-01 -4.1242249310016632e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2173 3.9043289422988892e-01</internalNodes>
+          <leafValues>
+            2.8530629351735115e-02 -3.5845771431922913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2174 3.9103450253605843e-03</internalNodes>
+          <leafValues>
+            -5.1523748785257339e-02 1.7829769849777222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2175 -1.0847560130059719e-02</internalNodes>
+          <leafValues>
+            -4.8355281352996826e-01 1.8765790387988091e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2176 5.7015339843928814e-03</internalNodes>
+          <leafValues>
+            1.2250830419361591e-02 -7.0457488298416138e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2177 -1.1917110532522202e-03</internalNodes>
+          <leafValues>
+            1.8404430150985718e-01 -5.0144620239734650e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2178 4.0988530963659286e-04</internalNodes>
+          <leafValues>
+            -9.7399666905403137e-02 1.0874579846858978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2179 4.5295488089323044e-03</internalNodes>
+          <leafValues>
+            4.5356839895248413e-02 -2.1069140732288361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2180 -5.4893731139600277e-03</internalNodes>
+          <leafValues>
+            2.9642790555953979e-01 -3.5870831459760666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2181 1.9906361121684313e-03</internalNodes>
+          <leafValues>
+            3.4332871437072754e-02 -3.1506469845771790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2182 8.3358466625213623e-02</internalNodes>
+          <leafValues>
+            1.9684519618749619e-02 -4.4279980659484863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2183 3.0363420955836773e-03</internalNodes>
+          <leafValues>
+            -3.3693831413984299e-02 2.6669681072235107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2184 5.7799968868494034e-02</internalNodes>
+          <leafValues>
+            8.5875885561108589e-03 -9.8965817689895630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2185 -7.8585641458630562e-03</internalNodes>
+          <leafValues>
+            2.0088459551334381e-01 -4.6583641320466995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2186 1.9253200152888894e-03</internalNodes>
+          <leafValues>
+            4.7922369092702866e-02 -2.2640110552310944e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2187 1.0996909812092781e-02</internalNodes>
+          <leafValues>
+            1.6258660703897476e-02 -5.4048168659210205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2188 1.6405170026700944e-04</internalNodes>
+          <leafValues>
+            -1.1542510241270065e-01 7.6001413166522980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2189 5.3780381567776203e-03</internalNodes>
+          <leafValues>
+            1.1179029941558838e-01 -8.4179848432540894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2190 2.2905960213392973e-03</internalNodes>
+          <leafValues>
+            -5.7969480752944946e-02 1.6899429261684418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2191 6.3102580606937408e-03</internalNodes>
+          <leafValues>
+            4.1471399366855621e-02 -2.0478209853172302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2192 -1.4342570304870605e-01</internalNodes>
+          <leafValues>
+            -7.8573477268218994e-01 1.1634309776127338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2193 1.2364640133455396e-03</internalNodes>
+          <leafValues>
+            -5.1800731569528580e-02 1.7734350264072418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2194 -2.0046550780534744e-02</internalNodes>
+          <leafValues>
+            -3.1420910358428955e-01 2.8849070891737938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2195 1.0868109762668610e-01</internalNodes>
+          <leafValues>
+            1.6183530911803246e-02 -5.1956307888031006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2196 5.1173489540815353e-02</internalNodes>
+          <leafValues>
+            -3.2460309565067291e-02 3.1230181455612183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2197 1.3251069933176041e-02</internalNodes>
+          <leafValues>
+            2.3655060678720474e-02 -4.4210249185562134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2198 -2.0110961049795151e-03</internalNodes>
+          <leafValues>
+            1.0359399765729904e-01 -9.3961462378501892e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2199 -3.2843051012605429e-03</internalNodes>
+          <leafValues>
+            3.3196929097175598e-01 -2.9921280220150948e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2200 8.8341237278655171e-04</internalNodes>
+          <leafValues>
+            5.9891819953918457e-02 -1.6192750632762909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2201 8.4265992045402527e-03</internalNodes>
+          <leafValues>
+            -3.6928750574588776e-02 2.3691199719905853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2202 -1.4503750207950361e-05</internalNodes>
+          <leafValues>
+            7.7373847365379333e-02 -1.3290609419345856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2203 8.0891689285635948e-03</internalNodes>
+          <leafValues>
+            2.8817569836974144e-02 -3.0961230397224426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2204 1.0339939966797829e-02</internalNodes>
+          <leafValues>
+            -2.4850569665431976e-02 3.7060049176216125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2205 -2.2790539078414440e-03</internalNodes>
+          <leafValues>
+            -2.2051370143890381e-01 4.1877530515193939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2206 -1.7716860165819526e-03</internalNodes>
+          <leafValues>
+            1.4205080270767212e-01 -6.5252363681793213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2207 -6.9317207671701908e-03</internalNodes>
+          <leafValues>
+            -3.3556079864501953e-01 2.7605969458818436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2208 -4.2506060563027859e-03</internalNodes>
+          <leafValues>
+            2.3591980338096619e-01 -3.7345319986343384e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2209 1.5317599754780531e-03</internalNodes>
+          <leafValues>
+            3.9657011628150940e-02 -2.3438200354576111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2210 1.4941049739718437e-03</internalNodes>
+          <leafValues>
+            -6.0311999171972275e-02 1.4468440413475037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2211 -5.2249869331717491e-03</internalNodes>
+          <leafValues>
+            -4.0660250186920166e-01 2.3257270455360413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2212 6.4759532688185573e-04</internalNodes>
+          <leafValues>
+            6.4828239381313324e-02 -1.2987309694290161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2213 3.2836120226420462e-04</internalNodes>
+          <leafValues>
+            6.1917629092931747e-02 -1.4835810661315918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2214 -3.4691279288381338e-03</internalNodes>
+          <leafValues>
+            1.5662840008735657e-01 -5.7200349867343903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2215 4.5903379213996232e-04</internalNodes>
+          <leafValues>
+            5.2517898380756378e-02 -1.9093179702758789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2216 -2.6641879230737686e-03</internalNodes>
+          <leafValues>
+            1.5235909819602966e-01 -6.8154700100421906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2217 -8.2513149827718735e-03</internalNodes>
+          <leafValues>
+            3.6680310964584351e-01 -2.8480609878897667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2218 7.1076201274991035e-03</internalNodes>
+          <leafValues>
+            1.5445350110530853e-01 -6.7992970347404480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2219 -4.3808001279830933e-01</internalNodes>
+          <leafValues>
+            -2.8871530294418335e-01 3.6639489233493805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2220 6.3719082390889525e-04</internalNodes>
+          <leafValues>
+            -1.5995030105113983e-01 5.9860341250896454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2221 -1.9303169392514974e-04</internalNodes>
+          <leafValues>
+            8.6703971028327942e-02 -1.0924819856882095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2222 3.0723758973181248e-03</internalNodes>
+          <leafValues>
+            4.8543959856033325e-02 -1.7700059711933136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2223 1.8341860268265009e-03</internalNodes>
+          <leafValues>
+            -5.1901239901781082e-02 1.8232129514217377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2224 6.3172310590744019e-02</internalNodes>
+          <leafValues>
+            2.3308899253606796e-02 -4.2870610952377319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2225 2.4458649568259716e-03</internalNodes>
+          <leafValues>
+            -8.6425289511680603e-02 1.1974500119686127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2226 1.1953969951719046e-03</internalNodes>
+          <leafValues>
+            1.1685889959335327e-01 -1.0430490225553513e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2227 3.1024610507301986e-04</internalNodes>
+          <leafValues>
+            6.2281988561153412e-02 -1.9196020066738129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2228 -3.1970158219337463e-02</internalNodes>
+          <leafValues>
+            -6.4184898138046265e-01 1.3087569735944271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2229 -1.0163170518353581e-03</internalNodes>
+          <leafValues>
+            -2.5210660696029663e-01 3.4096211194992065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2230 -5.1776540931314230e-04</internalNodes>
+          <leafValues>
+            1.1874090135097504e-01 -8.2813777029514313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2231 -4.0794219821691513e-03</internalNodes>
+          <leafValues>
+            -1.6135309636592865e-01 6.5708972513675690e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2232 9.9409874528646469e-03</internalNodes>
+          <leafValues>
+            -3.0160220339894295e-02 3.5104531049728394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2233 1.9788760691881180e-03</internalNodes>
+          <leafValues>
+            -4.4945359230041504e-02 2.3295649886131287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2234 1.0975249856710434e-01</internalNodes>
+          <leafValues>
+            1.6620220616459846e-02 -6.0423362255096436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2235 -9.2024728655815125e-03</internalNodes>
+          <leafValues>
+            -5.6000357866287231e-01 1.4122909866273403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2236 5.8626191457733512e-04</internalNodes>
+          <leafValues>
+            -1.0622119903564453e-01 8.4198087453842163e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2237 3.3601750619709492e-03</internalNodes>
+          <leafValues>
+            -2.1583529189229012e-02 4.1820129752159119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2238 -4.8143669962882996e-02</internalNodes>
+          <leafValues>
+            -7.2092157602310181e-01 1.4954459853470325e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2239 1.2209859676659107e-02</internalNodes>
+          <leafValues>
+            2.1544290706515312e-02 -3.5482150316238403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2240 -3.9961449801921844e-02</internalNodes>
+          <leafValues>
+            -8.8848268985748291e-01 9.4328429549932480e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2241 1.5312479808926582e-03</internalNodes>
+          <leafValues>
+            -6.4070880413055420e-02 1.3569630682468414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2242 8.9791123173199594e-05</internalNodes>
+          <leafValues>
+            5.0932768732309341e-02 -1.8393670022487640e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>195</maxWeakCount>
+      <stageThreshold>-1.3934370279312134e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2243 -3.8741368800401688e-02</internalNodes>
+          <leafValues>
+            2.8778830170631409e-01 -2.3312190175056458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2244 -2.5511500425636768e-03</internalNodes>
+          <leafValues>
+            2.5108599662780762e-01 -2.1116070449352264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2245 -2.7973129181191325e-04</internalNodes>
+          <leafValues>
+            8.9916922152042389e-02 -3.4069269895553589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2246 1.1981100542470813e-03</internalNodes>
+          <leafValues>
+            -2.2542229294776917e-01 1.3602660596370697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2247 -5.6686070747673512e-03</internalNodes>
+          <leafValues>
+            8.2847259938716888e-02 -2.8080710768699646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2248 -2.7642669738270342e-04</internalNodes>
+          <leafValues>
+            1.0485479980707169e-01 -1.8848650157451630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2249 2.0516710355877876e-03</internalNodes>
+          <leafValues>
+            3.4714280627667904e-03 -4.8608478903770447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2250 -1.4435249795496929e-05</internalNodes>
+          <leafValues>
+            8.4275819361209869e-02 -1.9356100261211395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2251 7.4418791336938739e-04</internalNodes>
+          <leafValues>
+            -1.2526750564575195e-01 1.1769519746303558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2252 -4.9923241138458252e-02</internalNodes>
+          <leafValues>
+            -4.0080299973487854e-01 2.7910390868782997e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2253 9.2694535851478577e-03</internalNodes>
+          <leafValues>
+            -9.1088913381099701e-02 1.7550450563430786e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2254 -7.4646030552685261e-03</internalNodes>
+          <leafValues>
+            1.6380469501018524e-01 -1.0385499894618988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2255 -8.1985909491777420e-03</internalNodes>
+          <leafValues>
+            -1.9168980419635773e-01 8.5415020585060120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2256 -8.1690691877156496e-04</internalNodes>
+          <leafValues>
+            -3.0793309211730957e-01 4.0833581238985062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2257 2.8902110643684864e-03</internalNodes>
+          <leafValues>
+            -5.0324201583862305e-02 2.9259419441223145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2258 8.0008199438452721e-03</internalNodes>
+          <leafValues>
+            -4.6863578259944916e-02 3.1964871287345886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2259 -5.8349180035293102e-03</internalNodes>
+          <leafValues>
+            -1.5489180386066437e-01 8.8137261569499969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2260 -1.2492289533838630e-03</internalNodes>
+          <leafValues>
+            -3.6294621229171753e-01 3.6120988428592682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2261 2.2950479760766029e-02</internalNodes>
+          <leafValues>
+            -4.7119770199060440e-02 2.8532719612121582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2262 -6.9193239323794842e-03</internalNodes>
+          <leafValues>
+            1.7873649299144745e-01 -7.3547556996345520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2263 -1.9392240210436285e-04</internalNodes>
+          <leafValues>
+            1.3911420106887817e-01 -9.2489100992679596e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2264 1.9811228848993778e-03</internalNodes>
+          <leafValues>
+            4.3448008596897125e-02 -3.0942690372467041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2265 1.6018489375710487e-02</internalNodes>
+          <leafValues>
+            -3.9718918502330780e-02 3.4248939156532288e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2266 9.3541406095027924e-03</internalNodes>
+          <leafValues>
+            3.2482650130987167e-02 -4.4502100348472595e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2267 -1.3822780456393957e-03</internalNodes>
+          <leafValues>
+            2.1627070009708405e-01 -5.6410200893878937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2268 2.5065820664167404e-02</internalNodes>
+          <leafValues>
+            2.3123230785131454e-02 -5.3954011201858521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2269 5.9798579663038254e-02</internalNodes>
+          <leafValues>
+            2.8747579082846642e-02 -3.6572590470314026e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2270 -2.7519159484654665e-03</internalNodes>
+          <leafValues>
+            1.7491349577903748e-01 -6.3990972936153412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2271 -3.2093640416860580e-02</internalNodes>
+          <leafValues>
+            -2.5695550441741943e-01 4.0945108979940414e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2272 -2.3349749390035868e-03</internalNodes>
+          <leafValues>
+            1.5433880686759949e-01 -7.2836689651012421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2273 2.6897678617388010e-04</internalNodes>
+          <leafValues>
+            7.2721242904663086e-02 -1.5513220429420471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2274 -8.9813407976180315e-04</internalNodes>
+          <leafValues>
+            -2.0699620246887207e-01 5.3738221526145935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2275 3.8521869573742151e-03</internalNodes>
+          <leafValues>
+            3.6562010645866394e-02 -2.8075969219207764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2276 1.3440090231597424e-02</internalNodes>
+          <leafValues>
+            -3.6046478897333145e-02 3.1876960396766663e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2277 7.7129118144512177e-03</internalNodes>
+          <leafValues>
+            9.5960013568401337e-02 -1.1787489801645279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2278 2.1991880203131586e-04</internalNodes>
+          <leafValues>
+            -1.3249869644641876e-01 8.4939576685428619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2279 -7.4781170114874840e-03</internalNodes>
+          <leafValues>
+            -2.3073039948940277e-01 5.0310928374528885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2280 8.9175272732973099e-03</internalNodes>
+          <leafValues>
+            -5.3924769163131714e-02 2.0320640504360199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2281 2.2819850128144026e-03</internalNodes>
+          <leafValues>
+            3.5264909267425537e-02 -3.0841338634490967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2282 2.6413009036332369e-03</internalNodes>
+          <leafValues>
+            -3.2939229160547256e-02 3.1721460819244385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2283 -1.4605689793825150e-03</internalNodes>
+          <leafValues>
+            -1.7154279351234436e-01 6.3374556601047516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2284 -3.1993410084396601e-03</internalNodes>
+          <leafValues>
+            3.4501680731773376e-01 -3.0717490240931511e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2285 2.3919229861348867e-03</internalNodes>
+          <leafValues>
+            2.0887520164251328e-02 -4.8564168810844421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2286 -3.5997610539197922e-03</internalNodes>
+          <leafValues>
+            2.8900530934333801e-01 -3.5605821758508682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2287 -1.4754279618500732e-05</internalNodes>
+          <leafValues>
+            7.2744622826576233e-02 -1.4580619335174561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2288 1.5968360006809235e-02</internalNodes>
+          <leafValues>
+            1.2548550032079220e-02 -6.7445451021194458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2289 -4.0752082131803036e-03</internalNodes>
+          <leafValues>
+            3.1447470188140869e-01 -3.2155450433492661e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2290 7.5432872108649462e-05</internalNodes>
+          <leafValues>
+            -9.9738657474517822e-02 8.9665092527866364e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2291 -3.9632249623537064e-02</internalNodes>
+          <leafValues>
+            2.7617400884628296e-01 -3.4800730645656586e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2292 2.9354610887821764e-05</internalNodes>
+          <leafValues>
+            -1.4023000001907349e-01 8.8519610464572906e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2293 3.1818989664316177e-02</internalNodes>
+          <leafValues>
+            2.9925649985671043e-02 -3.3958339691162109e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2294 1.2690100073814392e-01</internalNodes>
+          <leafValues>
+            1.1263390071690083e-02 -8.9932328462600708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2295 -3.5952320322394371e-03</internalNodes>
+          <leafValues>
+            1.7751759290695190e-01 -5.8113489300012589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2296 -1.9231259822845459e-02</internalNodes>
+          <leafValues>
+            -3.3173981308937073e-01 4.0587101131677628e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2297 2.2836721036583185e-03</internalNodes>
+          <leafValues>
+            3.7206009030342102e-02 -2.8370648622512817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2298 -1.6381660243496299e-03</internalNodes>
+          <leafValues>
+            1.4629170298576355e-01 -6.7781522870063782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2299 2.1173330023884773e-03</internalNodes>
+          <leafValues>
+            2.0773969590663910e-02 -4.3928679823875427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2300 6.4710620790719986e-03</internalNodes>
+          <leafValues>
+            -7.2133928537368774e-02 1.3981610536575317e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2301 -3.1431620009243488e-03</internalNodes>
+          <leafValues>
+            -1.9903449714183807e-01 4.7544669359922409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2302 1.6056640306487679e-03</internalNodes>
+          <leafValues>
+            -3.9751898497343063e-02 2.5931739807128906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2303 4.8740832135081291e-03</internalNodes>
+          <leafValues>
+            3.4082379192113876e-02 -2.7611988782882690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2304 -9.6354109700769186e-05</internalNodes>
+          <leafValues>
+            -1.0709609836339951e-01 8.3503186702728271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2305 7.7706458978354931e-03</internalNodes>
+          <leafValues>
+            -3.0095349997282028e-02 2.9493871331214905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2306 1.3028859393671155e-04</internalNodes>
+          <leafValues>
+            -1.1232890188694000e-01 9.4578683376312256e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2307 1.2239719508215785e-03</internalNodes>
+          <leafValues>
+            5.1999621093273163e-02 -1.8106269836425781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2308 -8.7549741147086024e-04</internalNodes>
+          <leafValues>
+            1.4276699721813202e-01 -7.5098946690559387e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2309 -8.8081993162631989e-02</internalNodes>
+          <leafValues>
+            -7.0848828554153442e-01 1.4353640377521515e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2310 -3.2854160666465759e-01</internalNodes>
+          <leafValues>
+            -4.9687421321868896e-01 1.6604600474238396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2311 9.8696127533912659e-03</internalNodes>
+          <leafValues>
+            1.9364370033144951e-02 -4.9978300929069519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2312 -2.7273639570921659e-03</internalNodes>
+          <leafValues>
+            2.9612520337104797e-01 -3.2831400632858276e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2313 9.9100142717361450e-02</internalNodes>
+          <leafValues>
+            1.9799079746007919e-02 -4.7344958782196045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2314 -6.3501899130642414e-03</internalNodes>
+          <leafValues>
+            -5.1504719257354736e-01 1.6986010596156120e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2315 2.9596920285257511e-05</internalNodes>
+          <leafValues>
+            -1.0923019796609879e-01 8.9656107127666473e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2316 2.1247670054435730e-02</internalNodes>
+          <leafValues>
+            -4.1462190449237823e-02 2.2684270143508911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2317 -7.2977989912033081e-02</internalNodes>
+          <leafValues>
+            -6.3227838277816772e-01 1.6678869724273682e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2318 1.6230919957160950e-01</internalNodes>
+          <leafValues>
+            -2.5661909952759743e-02 3.7533140182495117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2319 -1.4590819773729891e-05</internalNodes>
+          <leafValues>
+            8.5613600909709930e-02 -1.1900989711284637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2320 2.7719149366021156e-03</internalNodes>
+          <leafValues>
+            -5.4649248719215393e-02 2.0311379432678223e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2321 -8.7484354153275490e-03</internalNodes>
+          <leafValues>
+            -7.3674517869949341e-01 1.5571890398859978e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2322 1.3679199852049351e-02</internalNodes>
+          <leafValues>
+            7.8902930021286011e-02 -1.1590500175952911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2323 -1.1001150123775005e-02</internalNodes>
+          <leafValues>
+            3.1690821051597595e-01 -3.2384991645812988e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2324 3.2964799902401865e-04</internalNodes>
+          <leafValues>
+            5.0016529858112335e-02 -2.0451450347900391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2325 2.7753270696848631e-03</internalNodes>
+          <leafValues>
+            -6.7407429218292236e-02 1.5935909748077393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2326 -2.8740249108523130e-03</internalNodes>
+          <leafValues>
+            2.2455960512161255e-01 -5.1031488925218582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2327 8.1631669308990240e-04</internalNodes>
+          <leafValues>
+            6.9849550724029541e-02 -1.4791619777679443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2328 3.7573580630123615e-03</internalNodes>
+          <leafValues>
+            3.1594600528478622e-02 -3.1387978792190552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2329 -3.4902389161288738e-03</internalNodes>
+          <leafValues>
+            1.1638429760932922e-01 -8.5947930812835693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2330 -2.9415320605039597e-02</internalNodes>
+          <leafValues>
+            6.8403428792953491e-01 -1.6140609979629517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2331 -8.8095385581254959e-03</internalNodes>
+          <leafValues>
+            -2.0775319635868073e-01 4.9950890243053436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2332 -1.5459939837455750e-02</internalNodes>
+          <leafValues>
+            -4.8748460412025452e-01 2.0065559074282646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2333 -3.6481369286775589e-02</internalNodes>
+          <leafValues>
+            -5.2395141124725342e-01 1.5850989148020744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2334 -8.8937362306751311e-05</internalNodes>
+          <leafValues>
+            -1.3299320638179779e-01 6.6926807165145874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2335 1.4536709932144731e-04</internalNodes>
+          <leafValues>
+            8.7170369923114777e-02 -1.0435820370912552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2336 1.5216879546642303e-01</internalNodes>
+          <leafValues>
+            1.6140580177307129e-02 -6.4970171451568604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2337 -4.2344830580987036e-04</internalNodes>
+          <leafValues>
+            1.8045839667320251e-01 -5.2974540740251541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2338 1.0672640055418015e-03</internalNodes>
+          <leafValues>
+            2.0548380911350250e-02 -4.8242041468620300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2339 1.5491680242121220e-02</internalNodes>
+          <leafValues>
+            -5.1540851593017578e-02 1.8363960087299347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2340 6.1393307987600565e-04</internalNodes>
+          <leafValues>
+            2.9983729124069214e-02 -3.1031700968742371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2341 -1.4619939975091256e-05</internalNodes>
+          <leafValues>
+            1.0368499904870987e-01 -9.1634131968021393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2342 6.9900648668408394e-03</internalNodes>
+          <leafValues>
+            1.4683909714221954e-02 -5.9485381841659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2343 -5.3000110201537609e-03</internalNodes>
+          <leafValues>
+            -1.2457770109176636e-01 7.0542782545089722e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2344 5.0289987120777369e-04</internalNodes>
+          <leafValues>
+            -7.7135689556598663e-02 1.2228710204362869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2345 1.1190979741513729e-02</internalNodes>
+          <leafValues>
+            5.0308059900999069e-02 -1.8091809749603271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2346 1.7019819468259811e-02</internalNodes>
+          <leafValues>
+            -3.8816768676042557e-02 3.0851981043815613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2347 -5.8241572696715593e-04</internalNodes>
+          <leafValues>
+            1.2537799775600433e-01 -7.6115481555461884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2348 2.0036669448018074e-02</internalNodes>
+          <leafValues>
+            4.9899481236934662e-02 -1.8082989752292633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2349 -5.4328818805515766e-03</internalNodes>
+          <leafValues>
+            2.3409770429134369e-01 -4.2385410517454147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2350 -2.9535360226873308e-05</internalNodes>
+          <leafValues>
+            5.7630240917205811e-02 -1.5753529965877533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2351 -1.0352370142936707e-01</internalNodes>
+          <leafValues>
+            7.1587741374969482e-01 -1.2989929877221584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2352 -1.2122269719839096e-02</internalNodes>
+          <leafValues>
+            -1.4788970351219177e-01 6.6566437482833862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2353 3.0254870653152466e-03</internalNodes>
+          <leafValues>
+            -5.4378628730773926e-02 1.7140829563140869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2354 -5.8111078105866909e-03</internalNodes>
+          <leafValues>
+            2.4422149360179901e-01 -5.7652641087770462e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2355 8.2830740138888359e-03</internalNodes>
+          <leafValues>
+            2.2720400243997574e-02 -4.2961999773979187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2356 1.2375120073556900e-02</internalNodes>
+          <leafValues>
+            2.2810289636254311e-02 -3.7505629658699036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2357 1.9211210310459137e-02</internalNodes>
+          <leafValues>
+            1.1791059747338295e-02 -6.5529459714889526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2358 3.1843129545450211e-04</internalNodes>
+          <leafValues>
+            6.4130060374736786e-02 -1.3995569944381714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2359 8.4224628517404199e-04</internalNodes>
+          <leafValues>
+            -5.4134279489517212e-02 1.7525580525398254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2360 -1.6085049510002136e-01</internalNodes>
+          <leafValues>
+            -9.4571417570114136e-01 7.8549478203058243e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2361 -1.6774870455265045e-03</internalNodes>
+          <leafValues>
+            -1.9166129827499390e-01 4.5787028968334198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2362 -1.8989649834111333e-03</internalNodes>
+          <leafValues>
+            1.5783150494098663e-01 -6.5896913409233093e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2363 4.0205760160461068e-04</internalNodes>
+          <leafValues>
+            -7.3599092662334442e-02 1.3118380308151245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2364 2.4369959719479084e-03</internalNodes>
+          <leafValues>
+            2.3522870615124702e-02 -4.2745968699455261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2365 -2.8488409952842630e-05</internalNodes>
+          <leafValues>
+            6.3280619680881500e-02 -1.3599009811878204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2366 1.9538639113306999e-02</internalNodes>
+          <leafValues>
+            -2.1458270028233528e-02 4.7534748911857605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2367 -1.6530340071767569e-03</internalNodes>
+          <leafValues>
+            -1.5323260426521301e-01 5.9455979615449905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2368 -2.1052840165793896e-03</internalNodes>
+          <leafValues>
+            1.1017639935016632e-01 -8.3118103444576263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2369 -4.5266482047736645e-03</internalNodes>
+          <leafValues>
+            2.5815379619598389e-01 -3.5743940621614456e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2370 -1.6275560483336449e-04</internalNodes>
+          <leafValues>
+            -1.3548290729522705e-01 6.9295726716518402e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2371 -3.3048219047486782e-03</internalNodes>
+          <leafValues>
+            1.7806029319763184e-01 -5.2156440913677216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2372 -5.1905210129916668e-03</internalNodes>
+          <leafValues>
+            -3.4897321462631226e-01 2.5990990921854973e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2373 1.1190810054540634e-01</internalNodes>
+          <leafValues>
+            2.9962029308080673e-02 -2.9597550630569458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2374 -5.2873138338327408e-03</internalNodes>
+          <leafValues>
+            1.8564499914646149e-01 -5.0216298550367355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2375 2.6098049711436033e-03</internalNodes>
+          <leafValues>
+            -7.3559276759624481e-02 1.4365130662918091e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2376 -2.8581928927451372e-03</internalNodes>
+          <leafValues>
+            -1.2605139613151550e-01 7.5433082878589630e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2377 -2.9555680157500319e-05</internalNodes>
+          <leafValues>
+            1.0733310133218765e-01 -1.0386200249195099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2378 5.9023561334470287e-05</internalNodes>
+          <leafValues>
+            -1.3029119372367859e-01 7.6478391885757446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2379 -4.3344721198081970e-02</internalNodes>
+          <leafValues>
+            -6.9299221038818359e-01 1.4173300005495548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2380 -4.6946998685598373e-02</internalNodes>
+          <leafValues>
+            -5.5803751945495605e-01 1.2422920204699039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2381 -1.5189060010015965e-02</internalNodes>
+          <leafValues>
+            3.7049770355224609e-01 -2.5564119219779968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2382 1.6361879184842110e-02</internalNodes>
+          <leafValues>
+            2.7049979194998741e-02 -3.4278920292854309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2383 4.0752839297056198e-02</internalNodes>
+          <leafValues>
+            9.3995258212089539e-03 -8.8683712482452393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2384 -1.0879869572818279e-02</internalNodes>
+          <leafValues>
+            5.3260582685470581e-01 -1.9450860098004341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2385 -7.7538257755804807e-05</internalNodes>
+          <leafValues>
+            -1.1696249991655350e-01 7.7288232743740082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2386 -4.0953079587779939e-04</internalNodes>
+          <leafValues>
+            1.6214360296726227e-01 -5.3711488842964172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2387 -1.8464239314198494e-02</internalNodes>
+          <leafValues>
+            -5.0844788551330566e-01 1.9838189706206322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2388 -5.6788129732012749e-03</internalNodes>
+          <leafValues>
+            3.0203920602798462e-01 -3.0203990638256073e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2389 3.8324110209941864e-04</internalNodes>
+          <leafValues>
+            -1.6841089725494385e-01 5.4902028292417526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2390 6.4761550165712833e-03</internalNodes>
+          <leafValues>
+            9.5140263438224792e-02 -1.0746160149574280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2391 -2.4377859663218260e-03</internalNodes>
+          <leafValues>
+            -1.5647719800472260e-01 6.3407607376575470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2392 5.4156291298568249e-04</internalNodes>
+          <leafValues>
+            -6.5962299704551697e-02 1.8441629409790039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2393 2.7917029336094856e-02</internalNodes>
+          <leafValues>
+            -2.7590230107307434e-02 3.5032740235328674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2394 4.6622849185951054e-04</internalNodes>
+          <leafValues>
+            4.9628820270299911e-02 -2.2624179720878601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2395 -3.7316799163818359e-02</internalNodes>
+          <leafValues>
+            -4.2978170514106750e-01 2.1337680518627167e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2396 -2.6047111023217440e-03</internalNodes>
+          <leafValues>
+            3.6650991439819336e-01 -2.5405049324035645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2397 5.1927138119935989e-03</internalNodes>
+          <leafValues>
+            2.6877930387854576e-02 -3.3478578925132751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2398 3.0462879221886396e-03</internalNodes>
+          <leafValues>
+            -3.0848290771245956e-02 2.9788359999656677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2399 -4.1325599886476994e-04</internalNodes>
+          <leafValues>
+            7.2986789047718048e-02 -1.2147530168294907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2400 -1.1456120014190674e-01</internalNodes>
+          <leafValues>
+            3.1955468654632568e-01 -3.3379800617694855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2401 -1.3044059742242098e-03</internalNodes>
+          <leafValues>
+            -2.0625290274620056e-01 5.4634369909763336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2402 4.5045089791528881e-05</internalNodes>
+          <leafValues>
+            -1.1376550048589706e-01 7.8123383224010468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2403 1.8890319624915719e-03</internalNodes>
+          <leafValues>
+            -6.5578728914260864e-02 1.7001299560070038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2404 -5.4107961477711797e-04</internalNodes>
+          <leafValues>
+            -1.8184140324592590e-01 5.1611810922622681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2405 4.4150161556899548e-03</internalNodes>
+          <leafValues>
+            -3.6324780434370041e-02 2.4938449263572693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2406 -2.1878050640225410e-02</internalNodes>
+          <leafValues>
+            -1.7643679678440094e-01 5.4811108857393265e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2407 -2.0328219980001450e-03</internalNodes>
+          <leafValues>
+            9.4266183674335480e-02 -9.7129411995410919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2408 2.6754371356219053e-04</internalNodes>
+          <leafValues>
+            5.7487931102514267e-02 -1.5442019701004028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2409 1.4061420224606991e-03</internalNodes>
+          <leafValues>
+            -5.0268959254026413e-02 1.8814170360565186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2410 2.0725419744849205e-04</internalNodes>
+          <leafValues>
+            7.7659189701080322e-02 -1.2538130581378937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2411 1.8001600401476026e-03</internalNodes>
+          <leafValues>
+            -4.2675640434026718e-02 2.2430649399757385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2412 -4.6744230203330517e-03</internalNodes>
+          <leafValues>
+            -3.3480471372604370e-01 2.9364420101046562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2413 7.2110369801521301e-03</internalNodes>
+          <leafValues>
+            -5.2441328763961792e-02 1.8891569972038269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2414 2.3627521004527807e-03</internalNodes>
+          <leafValues>
+            3.4400060772895813e-02 -2.7200448513031006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2415 -1.3181479880586267e-03</internalNodes>
+          <leafValues>
+            1.7767719924449921e-01 -5.6363631039857864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2416 -1.7586319881957024e-04</internalNodes>
+          <leafValues>
+            9.1534242033958435e-02 -1.0412310063838959e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2417 -2.5801590527407825e-04</internalNodes>
+          <leafValues>
+            -1.1226779967546463e-01 8.1381812691688538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2418 9.6790950919967145e-05</internalNodes>
+          <leafValues>
+            -1.1881929636001587e-01 7.1883186697959900e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2419 8.2001117989420891e-03</internalNodes>
+          <leafValues>
+            -4.0254529565572739e-02 2.2790899872779846e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2420 -6.7277951166033745e-04</internalNodes>
+          <leafValues>
+            -7.0979103446006775e-02 1.2775769829750061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2421 3.7424470065161586e-04</internalNodes>
+          <leafValues>
+            6.7096449434757233e-02 -1.3645760715007782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2422 2.5741120334714651e-03</internalNodes>
+          <leafValues>
+            -5.4319828748703003e-02 1.6720260679721832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2423 4.3884690967388451e-04</internalNodes>
+          <leafValues>
+            8.2114033401012421e-02 -1.1024679988622665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2424 -4.8180628567934036e-02</internalNodes>
+          <leafValues>
+            -7.2217732667922974e-01 1.2223210185766220e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2425 9.9836904555559158e-03</internalNodes>
+          <leafValues>
+            1.2195640243589878e-02 -6.7448061704635620e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2426 -1.2344559654593468e-03</internalNodes>
+          <leafValues>
+            1.7145380377769470e-01 -5.5381339043378830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2427 -2.7302911039441824e-03</internalNodes>
+          <leafValues>
+            -1.3044339418411255e-01 7.4266709387302399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2428 5.5562541820108891e-04</internalNodes>
+          <leafValues>
+            -1.0187319666147232e-01 1.0454159975051880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2429 1.5140359755605459e-03</internalNodes>
+          <leafValues>
+            8.2843840122222900e-02 -1.1898560076951981e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2430 -7.2555973019916564e-05</internalNodes>
+          <leafValues>
+            -1.2512299418449402e-01 7.1132406592369080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2431 -2.4981278693303466e-04</internalNodes>
+          <leafValues>
+            -1.3125610351562500e-01 6.8963102996349335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2432 -6.0206428170204163e-03</internalNodes>
+          <leafValues>
+            2.1284450590610504e-01 -4.7603111714124680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2433 -7.2469102451577783e-04</internalNodes>
+          <leafValues>
+            1.0499659925699234e-01 -8.5549630224704742e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2434 6.3740357290953398e-04</internalNodes>
+          <leafValues>
+            5.4655481129884720e-02 -1.7353290319442749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2435 1.0901190340518951e-02</internalNodes>
+          <leafValues>
+            -5.2832279354333878e-02 1.8752649426460266e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2436 7.0734010078012943e-03</internalNodes>
+          <leafValues>
+            6.2958806753158569e-02 -1.6468439996242523e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2437 1.3333789538592100e-03</internalNodes>
+          <leafValues>
+            -1.2590870261192322e-01 9.4716809689998627e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>171</maxWeakCount>
+      <stageThreshold>-1.2739679813385010e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2438 6.2053989619016647e-02</internalNodes>
+          <leafValues>
+            -2.5427028536796570e-01 2.3591099679470062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2439 5.9534627944231033e-03</internalNodes>
+          <leafValues>
+            -2.2544360160827637e-01 1.7751939594745636e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2440 7.2477371431887150e-03</internalNodes>
+          <leafValues>
+            -1.1398050189018250e-01 2.7556711435317993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2441 -2.2824530024081469e-03</internalNodes>
+          <leafValues>
+            8.6277678608894348e-02 -3.1412398815155029e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2442 1.1776019819080830e-02</internalNodes>
+          <leafValues>
+            -6.2360338866710663e-02 3.4443479776382446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2443 4.3855342082679272e-03</internalNodes>
+          <leafValues>
+            1.8105769529938698e-02 -5.0128728151321411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2444 1.5859069302678108e-02</internalNodes>
+          <leafValues>
+            -7.8765146434307098e-02 2.6402598619461060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2445 3.0654110014438629e-03</internalNodes>
+          <leafValues>
+            3.3250238746404648e-02 -4.3427819013595581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2446 2.5912460405379534e-03</internalNodes>
+          <leafValues>
+            4.0578570216894150e-02 -4.9658200144767761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2447 3.0834769131615758e-04</internalNodes>
+          <leafValues>
+            -1.4615769684314728e-01 1.2339019775390625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2448 -2.4314899928867817e-03</internalNodes>
+          <leafValues>
+            7.2739332914352417e-02 -1.9999310374259949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2449 -1.8934230320155621e-03</internalNodes>
+          <leafValues>
+            -2.3373599350452423e-01 5.6464370340108871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2450 4.4724289327859879e-03</internalNodes>
+          <leafValues>
+            4.7042880207300186e-02 -3.1258741021156311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2451 1.5810050535947084e-04</internalNodes>
+          <leafValues>
+            -1.3098309934139252e-01 1.0137090086936951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2452 1.8755989149212837e-02</internalNodes>
+          <leafValues>
+            -3.8183789700269699e-02 3.7149110436439514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2453 -7.4876967119053006e-04</internalNodes>
+          <leafValues>
+            1.9981959462165833e-01 -6.0278389602899551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2454 -9.3861011555418372e-04</internalNodes>
+          <leafValues>
+            8.7467707693576813e-02 -1.6001270711421967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2455 -1.3442989438772202e-03</internalNodes>
+          <leafValues>
+            -3.3072051405906677e-01 3.6564111709594727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2456 -1.1384190293028951e-03</internalNodes>
+          <leafValues>
+            -2.0630060136318207e-01 5.6614480912685394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2457 2.5966269895434380e-03</internalNodes>
+          <leafValues>
+            -6.2676019966602325e-02 1.9195850193500519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2458 1.2499650474637747e-03</internalNodes>
+          <leafValues>
+            5.7390280067920685e-02 -1.9605259597301483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2459 1.1832700110971928e-03</internalNodes>
+          <leafValues>
+            -8.5788756608963013e-02 1.3682979345321655e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2460 -5.1836138591170311e-03</internalNodes>
+          <leafValues>
+            3.1635698676109314e-01 -4.6736460179090500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2461 -1.3185790181159973e-01</internalNodes>
+          <leafValues>
+            -6.2279629707336426e-01 1.8798090517520905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2462 1.8653980223461986e-03</internalNodes>
+          <leafValues>
+            3.8837268948554993e-02 -3.0104321241378784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2463 7.3482480365782976e-04</internalNodes>
+          <leafValues>
+            -7.6612047851085663e-02 1.5002079308032990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2464 -1.5738410002086312e-04</internalNodes>
+          <leafValues>
+            -1.6588360071182251e-01 7.0020452141761780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2465 5.1779212662950158e-04</internalNodes>
+          <leafValues>
+            7.4801079928874969e-02 -1.6358199715614319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2466 7.5904270634055138e-03</internalNodes>
+          <leafValues>
+            -5.1050990819931030e-02 2.4487720429897308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2467 -1.1010250076651573e-02</internalNodes>
+          <leafValues>
+            -5.8380401134490967e-01 2.0622009411454201e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2468 1.1621849983930588e-01</internalNodes>
+          <leafValues>
+            2.5175059214234352e-02 -4.1262671351432800e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2469 -7.4468040838837624e-04</internalNodes>
+          <leafValues>
+            1.2729789316654205e-01 -8.9675500988960266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2470 1.1765309609472752e-02</internalNodes>
+          <leafValues>
+            2.0906679332256317e-02 -5.3172761201858521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2471 -4.4441698119044304e-03</internalNodes>
+          <leafValues>
+            1.4282639324665070e-01 -7.8762412071228027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2472 -4.3369788909330964e-04</internalNodes>
+          <leafValues>
+            -2.2131459414958954e-01 5.4554950445890427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2473 -1.9204010022804141e-03</internalNodes>
+          <leafValues>
+            -2.5610721111297607e-01 4.0600918233394623e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2474 -2.9081690590828657e-03</internalNodes>
+          <leafValues>
+            2.0206320285797119e-01 -5.6222829967737198e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2475 -1.4549949810316321e-05</internalNodes>
+          <leafValues>
+            9.0000502765178680e-02 -1.1770520359277725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2476 -5.3217669483274221e-04</internalNodes>
+          <leafValues>
+            -1.5299430489540100e-01 6.8925492465496063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2477 -1.4590179547667503e-02</internalNodes>
+          <leafValues>
+            2.1776519715785980e-01 -5.1850430667400360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2478 -4.0213059401139617e-04</internalNodes>
+          <leafValues>
+            9.4017893075942993e-02 -1.1027640104293823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2479 -2.3089889436960220e-03</internalNodes>
+          <leafValues>
+            2.4792349338531494e-01 -5.7857040315866470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2480 3.1196139752864838e-04</internalNodes>
+          <leafValues>
+            -1.4021940529346466e-01 7.7247492969036102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2481 -9.1317007318139076e-03</internalNodes>
+          <leafValues>
+            4.0242809057235718e-01 -2.8953509405255318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2482 4.2655199649743736e-04</internalNodes>
+          <leafValues>
+            5.3114388138055801e-02 -2.1355339884757996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2483 3.9956220425665379e-03</internalNodes>
+          <leafValues>
+            4.4066920876502991e-02 -2.2994419932365417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2484 -1.4012040337547660e-03</internalNodes>
+          <leafValues>
+            2.7106899023056030e-01 -4.5171830803155899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2485 3.6064770072698593e-02</internalNodes>
+          <leafValues>
+            3.3628080040216446e-02 -3.2830131053924561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2486 -1.3408949598670006e-04</internalNodes>
+          <leafValues>
+            -1.3888040184974670e-01 8.0078050494194031e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2487 -6.9480319507420063e-03</internalNodes>
+          <leafValues>
+            -3.9315450191497803e-01 2.7302930131554604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2488 -1.4855440240353346e-03</internalNodes>
+          <leafValues>
+            1.9761669635772705e-01 -5.1562070846557617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2489 -1.3757539913058281e-02</internalNodes>
+          <leafValues>
+            -5.5620980262756348e-01 1.8301570788025856e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2490 8.4021147340536118e-03</internalNodes>
+          <leafValues>
+            1.3690480031073093e-02 -6.3171321153640747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2491 -1.7845979891717434e-04</internalNodes>
+          <leafValues>
+            -1.4535990357398987e-01 6.3921131193637848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2492 -1.1326850391924381e-02</internalNodes>
+          <leafValues>
+            6.5870612859725952e-01 -1.6460629180073738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2493 1.5268150018528104e-03</internalNodes>
+          <leafValues>
+            -6.0389541089534760e-02 1.5454010665416718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2494 -6.0069989413022995e-03</internalNodes>
+          <leafValues>
+            2.5859731435775757e-01 -4.9466971307992935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2495 -7.4241221882402897e-03</internalNodes>
+          <leafValues>
+            -3.8806110620498657e-01 2.9393190518021584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2496 -3.9992430247366428e-03</internalNodes>
+          <leafValues>
+            -1.3788199424743652e-01 7.7991880476474762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2497 1.0202969860984012e-04</internalNodes>
+          <leafValues>
+            7.2710737586021423e-02 -1.7032580077648163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2498 4.0135599556379020e-04</internalNodes>
+          <leafValues>
+            -9.2788018286228180e-02 1.2305440008640289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2499 -9.7611807286739349e-03</internalNodes>
+          <leafValues>
+            -3.6630520224571228e-01 2.9748899862170219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2500 -3.0745539069175720e-01</internalNodes>
+          <leafValues>
+            -7.8651821613311768e-01 1.3058690354228020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2501 -6.0231718234717846e-03</internalNodes>
+          <leafValues>
+            -5.0900238752365112e-01 1.8171619623899460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2502 -2.3784159566275775e-04</internalNodes>
+          <leafValues>
+            -9.9822521209716797e-02 1.0530869662761688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2503 1.3516229810193181e-03</internalNodes>
+          <leafValues>
+            -6.6444016993045807e-02 1.5425109863281250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2504 -1.6924949595704675e-03</internalNodes>
+          <leafValues>
+            -4.4133850932121277e-01 2.5100700557231903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2505 1.0610929457470775e-03</internalNodes>
+          <leafValues>
+            -6.0577899217605591e-02 1.7217910289764404e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2506 5.6644581491127610e-04</internalNodes>
+          <leafValues>
+            -7.8687779605388641e-02 1.6784669458866119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2507 -1.3955390080809593e-02</internalNodes>
+          <leafValues>
+            -5.7841098308563232e-01 1.9087139517068863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2508 -1.8862909637391567e-03</internalNodes>
+          <leafValues>
+            6.2118150293827057e-02 -1.6523399949073792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2509 1.6784170642495155e-02</internalNodes>
+          <leafValues>
+            -3.0380919575691223e-02 3.6105319857597351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2510 -1.4158519661577884e-05</internalNodes>
+          <leafValues>
+            7.2182632982730865e-02 -1.4407490193843842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2511 7.3750452138483524e-03</internalNodes>
+          <leafValues>
+            2.9791580513119698e-02 -2.9277870059013367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2512 8.0517530441284180e-03</internalNodes>
+          <leafValues>
+            -4.4681299477815628e-02 2.1760399639606476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2513 -7.9519696533679962e-02</internalNodes>
+          <leafValues>
+            -6.5208691358566284e-01 1.4618909917771816e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2514 1.2065700255334377e-02</internalNodes>
+          <leafValues>
+            2.9202880337834358e-02 -2.9454120993614197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2515 -1.0122699663043022e-02</internalNodes>
+          <leafValues>
+            2.7746239304542542e-01 -4.3713569641113281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2516 -1.8515810370445251e-01</internalNodes>
+          <leafValues>
+            -4.6136859059333801e-01 2.4093240499496460e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2517 -8.0726131796836853e-02</internalNodes>
+          <leafValues>
+            -4.4673430919647217e-01 2.0845459774136543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2518 1.5173270367085934e-03</internalNodes>
+          <leafValues>
+            -5.1575969904661179e-02 1.8063379824161530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2519 -1.1184819974005222e-02</internalNodes>
+          <leafValues>
+            -3.5373958945274353e-01 2.7059540152549744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2520 -3.5008399281650782e-03</internalNodes>
+          <leafValues>
+            2.0548710227012634e-01 -4.6032059937715530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2521 1.4720410108566284e-03</internalNodes>
+          <leafValues>
+            -6.3871711492538452e-02 1.8168300390243530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2522 -4.5021830010227859e-04</internalNodes>
+          <leafValues>
+            -1.6353920102119446e-01 5.9327740222215652e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2523 6.1653478769585490e-04</internalNodes>
+          <leafValues>
+            6.9089323282241821e-02 -1.9156040251255035e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2524 1.4797239564359188e-03</internalNodes>
+          <leafValues>
+            -5.2241999655961990e-02 1.8631340563297272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2525 -1.4754989933862817e-05</internalNodes>
+          <leafValues>
+            7.3586143553256989e-02 -1.5092320740222931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2526 8.6423632455989718e-04</internalNodes>
+          <leafValues>
+            6.6930077970027924e-02 -1.3976100087165833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2527 -4.1005611419677734e-03</internalNodes>
+          <leafValues>
+            2.0946699380874634e-01 -4.7175008803606033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2528 -2.1505339536815882e-03</internalNodes>
+          <leafValues>
+            -5.2753841876983643e-01 1.7665250226855278e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2529 7.8334724530577660e-03</internalNodes>
+          <leafValues>
+            -4.5125011354684830e-02 2.0374919474124908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2530 -3.2690390944480896e-03</internalNodes>
+          <leafValues>
+            -1.3836699724197388e-01 7.0653162896633148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2531 3.9274748414754868e-03</internalNodes>
+          <leafValues>
+            6.8428598344326019e-02 -1.6210170090198517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2532 7.6534547843039036e-03</internalNodes>
+          <leafValues>
+            -9.3162156641483307e-02 9.9912680685520172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2533 -3.2620150595903397e-02</internalNodes>
+          <leafValues>
+            3.5453549027442932e-01 -3.0765339732170105e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2534 -1.8247209489345551e-02</internalNodes>
+          <leafValues>
+            -3.8171181082725525e-01 2.7764180675148964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2535 -8.0104079097509384e-04</internalNodes>
+          <leafValues>
+            -1.4329099655151367e-01 6.4936630427837372e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2536 -1.0993109643459320e-01</internalNodes>
+          <leafValues>
+            8.7319427728652954e-01 -1.1242670007050037e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2537 -3.0508199706673622e-02</internalNodes>
+          <leafValues>
+            -6.1269849538803101e-01 1.9372699782252312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2538 -1.9187819212675095e-02</internalNodes>
+          <leafValues>
+            2.8533020615577698e-01 -3.6832328885793686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2539 2.3266570642590523e-03</internalNodes>
+          <leafValues>
+            4.7289360314607620e-02 -2.1252959966659546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2540 -1.4535760274156928e-03</internalNodes>
+          <leafValues>
+            1.3778920471668243e-01 -7.4501492083072662e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2541 -1.0573640465736389e-03</internalNodes>
+          <leafValues>
+            -2.2186830639839172e-01 4.2039170861244202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2542 1.7203199677169323e-03</internalNodes>
+          <leafValues>
+            -6.9299750030040741e-02 1.3794890046119690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2543 -1.4716150471940637e-03</internalNodes>
+          <leafValues>
+            2.4296709895133972e-01 -4.0795009583234787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2544 -5.2822660654783249e-03</internalNodes>
+          <leafValues>
+            -3.1959480047225952e-01 3.4215260297060013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2545 -4.7165742143988609e-03</internalNodes>
+          <leafValues>
+            3.0581191182136536e-01 -3.1772918999195099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2546 7.3668370023369789e-03</internalNodes>
+          <leafValues>
+            6.1085078865289688e-02 -1.6390019655227661e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2547 -7.6594999991357327e-03</internalNodes>
+          <leafValues>
+            -4.6472349762916565e-01 1.8869750201702118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2548 7.6969028450548649e-03</internalNodes>
+          <leafValues>
+            -1.8191590905189514e-02 5.5395811796188354e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2549 -5.6195858633145690e-04</internalNodes>
+          <leafValues>
+            9.7618483006954193e-02 -1.0844089835882187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2550 -1.4587530131393578e-05</internalNodes>
+          <leafValues>
+            7.4585132300853729e-02 -1.2353610247373581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2551 -9.5779378898441792e-04</internalNodes>
+          <leafValues>
+            1.6370140016078949e-01 -5.8610081672668457e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2552 8.0253500491380692e-03</internalNodes>
+          <leafValues>
+            2.6857670396566391e-02 -4.1507768630981445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2553 1.6938529442995787e-03</internalNodes>
+          <leafValues>
+            4.8536270856857300e-02 -1.7888469994068146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2554 -4.3334178626537323e-03</internalNodes>
+          <leafValues>
+            1.9798220694065094e-01 -4.8085059970617294e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2555 -2.2440029715653509e-04</internalNodes>
+          <leafValues>
+            -1.5113249421119690e-01 6.0428649187088013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2556 -1.1392509564757347e-02</internalNodes>
+          <leafValues>
+            3.2737928628921509e-01 -2.9751259833574295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2557 -9.3984175473451614e-03</internalNodes>
+          <leafValues>
+            -1.2912990152835846e-01 7.6302282512187958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2558 8.7430170970037580e-04</internalNodes>
+          <leafValues>
+            -9.7556166350841522e-02 9.7808010876178741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2559 7.5171617791056633e-03</internalNodes>
+          <leafValues>
+            6.5084353089332581e-02 -1.5419410169124603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2560 -2.7937069535255432e-03</internalNodes>
+          <leafValues>
+            1.5009529888629913e-01 -6.3355393707752228e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2561 -3.4385098842903972e-04</internalNodes>
+          <leafValues>
+            1.2404289841651917e-01 -7.5780630111694336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2562 8.7557926774024963e-02</internalNodes>
+          <leafValues>
+            -1.5905940905213356e-02 5.6607347726821899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2563 -9.3594435602426529e-03</internalNodes>
+          <leafValues>
+            -3.3039200305938721e-01 3.0874710530042648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2564 -6.7703737877309322e-03</internalNodes>
+          <leafValues>
+            1.7960870265960693e-01 -5.1310319453477859e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2565 -6.2513751909136772e-03</internalNodes>
+          <leafValues>
+            -5.7952338457107544e-01 1.5425769612193108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2566 -2.5206409394741058e-02</internalNodes>
+          <leafValues>
+            -6.3777071237564087e-01 1.3051119633018970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2567 -1.1819769861176610e-03</internalNodes>
+          <leafValues>
+            -2.0478110015392303e-01 4.0494531393051147e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2568 -1.0458839824423194e-03</internalNodes>
+          <leafValues>
+            1.4812879264354706e-01 -6.2631592154502869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2569 -2.5445020291954279e-03</internalNodes>
+          <leafValues>
+            1.3021010160446167e-01 -6.9430023431777954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2570 -8.0673627555370331e-02</internalNodes>
+          <leafValues>
+            -2.8054219484329224e-01 3.8956280797719955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2571 -1.4390920114237815e-04</internalNodes>
+          <leafValues>
+            1.0780519992113113e-01 -9.6550762653350830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2572 7.6481432188302279e-04</internalNodes>
+          <leafValues>
+            6.0667239129543304e-02 -1.5742610394954681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2573 -3.4516688901931047e-04</internalNodes>
+          <leafValues>
+            1.1415769904851913e-01 -8.8832370936870575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2574 -2.2118249908089638e-03</internalNodes>
+          <leafValues>
+            2.2988039255142212e-01 -5.0498738884925842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2575 9.4616543501615524e-03</internalNodes>
+          <leafValues>
+            1.9827060401439667e-02 -5.0633531808853149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2576 1.0567939607426524e-03</internalNodes>
+          <leafValues>
+            3.8744639605283737e-02 -2.3509359359741211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2577 2.9194469098001719e-03</internalNodes>
+          <leafValues>
+            -6.1895478516817093e-02 1.5313319861888885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2578 -1.0768010281026363e-02</internalNodes>
+          <leafValues>
+            -5.5298101902008057e-01 1.7847239971160889e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2579 -1.0197740048170090e-03</internalNodes>
+          <leafValues>
+            1.1559300124645233e-01 -8.0185852944850922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2580 1.8127029761672020e-04</internalNodes>
+          <leafValues>
+            5.6652870029211044e-02 -1.6549369692802429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2581 7.1620188464294188e-06</internalNodes>
+          <leafValues>
+            -9.1480091214179993e-02 9.7915090620517731e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2582 5.2910070866346359e-02</internalNodes>
+          <leafValues>
+            -1.3591200113296509e-02 6.6090220212936401e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2583 4.0185371041297913e-01</internalNodes>
+          <leafValues>
+            1.9574489444494247e-02 -4.9015858769416809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2584 -1.7914770171046257e-02</internalNodes>
+          <leafValues>
+            -8.8317036628723145e-02 1.0532960295677185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2585 -1.4578569789591711e-05</internalNodes>
+          <leafValues>
+            7.8513152897357941e-02 -1.2300349771976471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2586 6.4994548447430134e-03</internalNodes>
+          <leafValues>
+            -4.0843468159437180e-02 2.9337158799171448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2587 9.5762982964515686e-02</internalNodes>
+          <leafValues>
+            1.9332479685544968e-02 -5.3444057703018188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2588 1.4263469893194269e-05</internalNodes>
+          <leafValues>
+            -8.8897533714771271e-02 1.0632789880037308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2589 2.2215039934962988e-03</internalNodes>
+          <leafValues>
+            -4.0777951478958130e-02 2.6405128836631775e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2590 3.1875250861048698e-03</internalNodes>
+          <leafValues>
+            5.9725038707256317e-02 -1.6202959418296814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2591 9.6069589257240295e-02</internalNodes>
+          <leafValues>
+            1.1318460106849670e-02 -7.9110687971115112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2592 1.9584870897233486e-03</internalNodes>
+          <leafValues>
+            -3.9252020418643951e-02 2.3639929294586182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2593 -1.8468469381332397e-01</internalNodes>
+          <leafValues>
+            -5.8974397182464600e-01 1.5758410096168518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2594 2.1685050160158426e-04</internalNodes>
+          <leafValues>
+            4.6320449560880661e-02 -1.8274679780006409e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2595 1.8809709697961807e-02</internalNodes>
+          <leafValues>
+            -4.3357118964195251e-02 2.7832600474357605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2596 -6.2639699317514896e-03</internalNodes>
+          <leafValues>
+            -1.3891190290451050e-01 7.7115900814533234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2597 3.2622940489090979e-04</internalNodes>
+          <leafValues>
+            -9.1803021728992462e-02 1.0588289797306061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2598 5.3745559416711330e-03</internalNodes>
+          <leafValues>
+            1.0803489945828915e-02 -7.6716458797454834e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2599 2.8126770630478859e-03</internalNodes>
+          <leafValues>
+            -5.9618860483169556e-02 1.6133050620555878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2600 -6.5314618404954672e-04</internalNodes>
+          <leafValues>
+            -8.5690811276435852e-02 1.1540769785642624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2601 -1.7845110269263387e-03</internalNodes>
+          <leafValues>
+            8.1831991672515869e-02 -1.2700800597667694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2602 3.0969830695539713e-03</internalNodes>
+          <leafValues>
+            6.8366639316082001e-02 -1.4475439488887787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2603 -4.1442047804594040e-03</internalNodes>
+          <leafValues>
+            1.8632030487060547e-01 -5.4030310362577438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2604 -4.9972519278526306e-02</internalNodes>
+          <leafValues>
+            -1.2800359725952148e-01 8.5049159824848175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2605 -1.0743910446763039e-02</internalNodes>
+          <leafValues>
+            1.3701729476451874e-01 -7.7366456389427185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2606 -3.0474149389192462e-04</internalNodes>
+          <leafValues>
+            -1.6938340663909912e-01 5.7971168309450150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2607 3.6023318767547607e-02</internalNodes>
+          <leafValues>
+            1.3561300002038479e-02 -6.3279747962951660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2608 2.5479190517216921e-03</internalNodes>
+          <leafValues>
+            -4.3824359774589539e-02 2.2150419652462006e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          8 7 2 6 -1.</_>
+        <_>
+          8 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 10 7 -1.</_>
+        <_>
+          13 3 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 6 -1.</_>
+        <_>
+          10 14 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 8 -1.</_>
+        <_>
+          14 4 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 5 4 -1.</_>
+        <_>
+          5 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 6 -1.</_>
+        <_>
+          8 4 3 3 2.</_>
+        <_>
+          11 7 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 5 2 -1.</_>
+        <_>
+          10 15 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 4 -1.</_>
+        <_>
+          7 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 3 3 -1.</_>
+        <_>
+          11 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 11 -1.</_>
+        <_>
+          4 5 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 6 -1.</_>
+        <_>
+          8 10 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 2 -1.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 17 -1.</_>
+        <_>
+          4 3 3 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 3 -1.</_>
+        <_>
+          11 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 9 -1.</_>
+        <_>
+          4 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 6 -1.</_>
+        <_>
+          14 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 9 6 -1.</_>
+        <_>
+          7 10 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          5 8 3 3 2.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 18 -1.</_>
+        <_>
+          4 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 4 -1.</_>
+        <_>
+          10 14 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 9 -1.</_>
+        <_>
+          7 3 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 3 -1.</_>
+        <_>
+          11 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 5 2 -1.</_>
+        <_>
+          4 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 3 -1.</_>
+        <_>
+          11 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 3 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 8 -1.</_>
+        <_>
+          9 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 13 -1.</_>
+        <_>
+          8 3 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 4 12 -1.</_>
+        <_>
+          4 6 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 2 -1.</_>
+        <_>
+          12 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 11 -1.</_>
+        <_>
+          4 5 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 13 12 -1.</_>
+        <_>
+          3 12 13 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 6 -1.</_>
+        <_>
+          7 7 3 3 2.</_>
+        <_>
+          10 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 2 -1.</_>
+        <_>
+          5 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 14 3 -1.</_>
+        <_>
+          12 4 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 2 -1.</_>
+        <_>
+          11 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 1 3 -1.</_>
+        <_>
+          12 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 3 -1.</_>
+        <_>
+          4 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 2 -1.</_>
+        <_>
+          9 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 13 -1.</_>
+        <_>
+          4 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 3 -1.</_>
+        <_>
+          15 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 4 4 -1.</_>
+        <_>
+          12 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 9 -1.</_>
+        <_>
+          8 10 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 0 6 3 2.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 6 -1.</_>
+        <_>
+          5 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 4 -1.</_>
+        <_>
+          12 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 8 -1.</_>
+        <_>
+          11 11 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 5 6 -1.</_>
+        <_>
+          5 7 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 6 -1.</_>
+        <_>
+          10 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 4 -1.</_>
+        <_>
+          11 15 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 3 -1.</_>
+        <_>
+          8 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 2 -1.</_>
+        <_>
+          8 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 2 -1.</_>
+        <_>
+          10 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          6 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 8 -1.</_>
+        <_>
+          9 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 8 -1.</_>
+        <_>
+          5 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 2 -1.</_>
+        <_>
+          13 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 4 -1.</_>
+        <_>
+          9 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 1 8 -1.</_>
+        <_>
+          14 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          10 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 1 12 -1.</_>
+        <_>
+          12 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 14 6 -1.</_>
+        <_>
+          2 8 7 3 2.</_>
+        <_>
+          9 11 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 17 -1.</_>
+        <_>
+          12 3 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 2 -1.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 1 -1.</_>
+        <_>
+          14 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 3 -1.</_>
+        <_>
+          12 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 10 10 -1.</_>
+        <_>
+          13 2 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 1 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 1 4 -1.</_>
+        <_>
+          12 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 6 -1.</_>
+        <_>
+          8 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 3 -1.</_>
+        <_>
+          12 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          10 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 6 -1.</_>
+        <_>
+          6 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 19 -1.</_>
+        <_>
+          4 0 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 9 -1.</_>
+        <_>
+          5 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 2 -1.</_>
+        <_>
+          13 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 15 -1.</_>
+        <_>
+          5 3 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 2 3 -1.</_>
+        <_>
+          13 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          6 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 1 -1.</_>
+        <_>
+          9 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 1 -1.</_>
+        <_>
+          10 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 1 2 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 4 -1.</_>
+        <_>
+          11 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 14 -1.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 4 -1.</_>
+        <_>
+          14 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 3 6 -1.</_>
+        <_>
+          4 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 8 -1.</_>
+        <_>
+          5 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 3 2 -1.</_>
+        <_>
+          10 1 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 3 -1.</_>
+        <_>
+          11 1 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 8 -1.</_>
+        <_>
+          9 12 4 4 2.</_>
+        <_>
+          13 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 4 -1.</_>
+        <_>
+          10 13 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 12 -1.</_>
+        <_>
+          4 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 5 -1.</_>
+        <_>
+          13 3 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 3 6 -1.</_>
+        <_>
+          7 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 4 -1.</_>
+        <_>
+          5 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 6 -1.</_>
+        <_>
+          11 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 2 -1.</_>
+        <_>
+          8 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 4 -1.</_>
+        <_>
+          2 0 4 2 2.</_>
+        <_>
+          6 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 5 -1.</_>
+        <_>
+          12 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 3 -1.</_>
+        <_>
+          12 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 2 -1.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 9 -1.</_>
+        <_>
+          3 6 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 3 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 2 -1.</_>
+        <_>
+          5 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 7 -1.</_>
+        <_>
+          4 8 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 15 -1.</_>
+        <_>
+          3 3 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 4 3 -1.</_>
+        <_>
+          12 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 20 -1.</_>
+        <_>
+          9 0 1 10 2.</_>
+        <_>
+          10 10 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          6 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 10 -1.</_>
+        <_>
+          5 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 1 -1.</_>
+        <_>
+          9 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 2 -1.</_>
+        <_>
+          15 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 2 -1.</_>
+        <_>
+          15 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 12 -1.</_>
+        <_>
+          8 5 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 3 -1.</_>
+        <_>
+          8 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          6 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 1 -1.</_>
+        <_>
+          13 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 5 2 -1.</_>
+        <_>
+          10 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 3 -1.</_>
+        <_>
+          11 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 6 -1.</_>
+        <_>
+          7 4 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 3 -1.</_>
+        <_>
+          12 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 3 -1.</_>
+        <_>
+          8 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 10 -1.</_>
+        <_>
+          7 11 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 18 2 -1.</_>
+        <_>
+          6 18 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 1 8 -1.</_>
+        <_>
+          0 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 10 -1.</_>
+        <_>
+          1 8 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 2 -1.</_>
+        <_>
+          9 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 3 -1.</_>
+        <_>
+          10 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 1 3 -1.</_>
+        <_>
+          13 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 13 3 -1.</_>
+        <_>
+          2 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 4 -1.</_>
+        <_>
+          11 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 3 -1.</_>
+        <_>
+          8 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 8 -1.</_>
+        <_>
+          3 6 6 4 2.</_>
+        <_>
+          9 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 0 4 2 2.</_>
+        <_>
+          16 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 3 3 -1.</_>
+        <_>
+          10 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 2 -1.</_>
+        <_>
+          10 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 5 6 -1.</_>
+        <_>
+          6 14 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 4 -1.</_>
+        <_>
+          11 6 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 6 -1.</_>
+        <_>
+          6 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 16 7 -1.</_>
+        <_>
+          11 1 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 6 -1.</_>
+        <_>
+          12 14 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 9 8 -1.</_>
+        <_>
+          6 10 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 14 -1.</_>
+        <_>
+          4 0 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 1 9 -1.</_>
+        <_>
+          8 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 2 -1.</_>
+        <_>
+          11 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 4 13 -1.</_>
+        <_>
+          4 7 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 20 -1.</_>
+        <_>
+          19 0 1 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 3 -1.</_>
+        <_>
+          7 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 1 4 -1.</_>
+        <_>
+          13 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          12 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 6 -1.</_>
+        <_>
+          3 6 6 3 2.</_>
+        <_>
+          9 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 2 -1.</_>
+        <_>
+          10 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 3 -1.</_>
+        <_>
+          6 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 1 3 -1.</_>
+        <_>
+          13 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 3 3 -1.</_>
+        <_>
+          6 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 3 -1.</_>
+        <_>
+          5 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 1 3 -1.</_>
+        <_>
+          15 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 12 -1.</_>
+        <_>
+          4 8 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 14 -1.</_>
+        <_>
+          4 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 2 -1.</_>
+        <_>
+          9 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 4 -1.</_>
+        <_>
+          8 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 4 -1.</_>
+        <_>
+          5 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 1 -1.</_>
+        <_>
+          8 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 16 2 3 -1.</_>
+        <_>
+          12 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 6 3 -1.</_>
+        <_>
+          3 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 2 1 -1.</_>
+        <_>
+          14 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 4 4 -1.</_>
+        <_>
+          11 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 1 -1.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 3 -1.</_>
+        <_>
+          8 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 10 -1.</_>
+        <_>
+          5 13 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 2 -1.</_>
+        <_>
+          0 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 4 -1.</_>
+        <_>
+          4 11 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 12 3 -1.</_>
+        <_>
+          5 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 3 -1.</_>
+        <_>
+          9 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 3 -1.</_>
+        <_>
+          8 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 1 2 -1.</_>
+        <_>
+          1 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 7 6 -1.</_>
+        <_>
+          5 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 4 -1.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 3 -1.</_>
+        <_>
+          5 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 1 -1.</_>
+        <_>
+          8 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 11 16 -1.</_>
+        <_>
+          0 8 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 2 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 2 -1.</_>
+        <_>
+          13 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 6 -1.</_>
+        <_>
+          8 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 8 -1.</_>
+        <_>
+          10 0 5 4 2.</_>
+        <_>
+          15 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 12 -1.</_>
+        <_>
+          9 11 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 12 -1.</_>
+        <_>
+          6 3 6 6 2.</_>
+        <_>
+          12 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 4 6 -1.</_>
+        <_>
+          5 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 10 -1.</_>
+        <_>
+          5 7 5 5 2.</_>
+        <_>
+          10 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 15 -1.</_>
+        <_>
+          4 1 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          13 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 6 -1.</_>
+        <_>
+          6 14 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          5 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 3 -1.</_>
+        <_>
+          6 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 8 -1.</_>
+        <_>
+          3 7 6 4 2.</_>
+        <_>
+          9 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 6 -1.</_>
+        <_>
+          6 4 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 5 4 -1.</_>
+        <_>
+          11 13 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 2 -1.</_>
+        <_>
+          7 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 7 -1.</_>
+        <_>
+          4 13 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 5 9 -1.</_>
+        <_>
+          11 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 15 9 -1.</_>
+        <_>
+          4 6 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 2 2 -1.</_>
+        <_>
+          15 13 1 1 2.</_>
+        <_>
+          16 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 13 -1.</_>
+        <_>
+          9 5 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 15 -1.</_>
+        <_>
+          6 6 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 3 -1.</_>
+        <_>
+          13 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 4 -1.</_>
+        <_>
+          0 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 9 3 -1.</_>
+        <_>
+          4 9 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 2 -1.</_>
+        <_>
+          8 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 2 2 -1.</_>
+        <_>
+          4 15 1 1 2.</_>
+        <_>
+          5 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 3 -1.</_>
+        <_>
+          6 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 6 -1.</_>
+        <_>
+          6 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 10 -1.</_>
+        <_>
+          5 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 10 -1.</_>
+        <_>
+          4 6 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 5 -1.</_>
+        <_>
+          4 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 2 -1.</_>
+        <_>
+          13 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 1 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 1 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 1 3 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 5 3 -1.</_>
+        <_>
+          10 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 1 3 -1.</_>
+        <_>
+          7 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 2 -1.</_>
+        <_>
+          12 5 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          10 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 5 9 -1.</_>
+        <_>
+          12 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 4 -1.</_>
+        <_>
+          12 0 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          6 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 12 -1.</_>
+        <_>
+          1 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 5 10 -1.</_>
+        <_>
+          1 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 2 -1.</_>
+        <_>
+          10 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 8 -1.</_>
+        <_>
+          9 5 1 4 2.</_>
+        <_>
+          10 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 3 1 -1.</_>
+        <_>
+          18 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 3 -1.</_>
+        <_>
+          5 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 7 2 -1.</_>
+        <_>
+          11 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 8 -1.</_>
+        <_>
+          13 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 5 -1.</_>
+        <_>
+          14 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 6 -1.</_>
+        <_>
+          9 7 2 3 2.</_>
+        <_>
+          11 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 6 -1.</_>
+        <_>
+          10 10 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 17 -1.</_>
+        <_>
+          4 1 2 17 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 9 4 -1.</_>
+        <_>
+          7 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 4 -1.</_>
+        <_>
+          8 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 2 -1.</_>
+        <_>
+          9 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 4 -1.</_>
+        <_>
+          11 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 1 3 -1.</_>
+        <_>
+          13 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 4 1 -1.</_>
+        <_>
+          12 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 12 -1.</_>
+        <_>
+          5 4 5 6 2.</_>
+        <_>
+          10 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 5 6 -1.</_>
+        <_>
+          4 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 8 -1.</_>
+        <_>
+          5 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 3 -1.</_>
+        <_>
+          7 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 2 -1.</_>
+        <_>
+          8 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 16 -1.</_>
+        <_>
+          2 3 2 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 12 -1.</_>
+        <_>
+          3 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          12 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 13 -1.</_>
+        <_>
+          19 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 5 4 -1.</_>
+        <_>
+          9 16 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 3 -1.</_>
+        <_>
+          10 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 1 3 -1.</_>
+        <_>
+          12 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 14 -1.</_>
+        <_>
+          9 6 3 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 4 -1.</_>
+        <_>
+          6 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 11 9 -1.</_>
+        <_>
+          7 6 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 9 6 -1.</_>
+        <_>
+          10 6 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 1 -1.</_>
+        <_>
+          1 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 6 -1.</_>
+        <_>
+          9 4 2 3 2.</_>
+        <_>
+          11 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 2 -1.</_>
+        <_>
+          7 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 1 2 -1.</_>
+        <_>
+          1 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 3 -1.</_>
+        <_>
+          7 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 2 -1.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 3 -1.</_>
+        <_>
+          6 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 3 -1.</_>
+        <_>
+          11 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 3 1 -1.</_>
+        <_>
+          18 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 1 -1.</_>
+        <_>
+          13 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 4 -1.</_>
+        <_>
+          14 0 3 2 2.</_>
+        <_>
+          17 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 6 -1.</_>
+        <_>
+          12 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 2 -1.</_>
+        <_>
+          14 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 4 3 -1.</_>
+        <_>
+          6 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          5 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 1 -1.</_>
+        <_>
+          10 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 3 -1.</_>
+        <_>
+          10 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 1 -1.</_>
+        <_>
+          10 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 3 -1.</_>
+        <_>
+          7 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 1 6 -1.</_>
+        <_>
+          1 6 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 11 -1.</_>
+        <_>
+          4 2 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 18 -1.</_>
+        <_>
+          4 2 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 2 -1.</_>
+        <_>
+          8 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 1 -1.</_>
+        <_>
+          8 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 6 -1.</_>
+        <_>
+          3 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 3 17 -1.</_>
+        <_>
+          4 2 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 1 -1.</_>
+        <_>
+          8 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 6 -1.</_>
+        <_>
+          3 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 1 2 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 6 -1.</_>
+        <_>
+          7 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 3 -1.</_>
+        <_>
+          11 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 2 -1.</_>
+        <_>
+          17 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 1 4 -1.</_>
+        <_>
+          15 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 11 -1.</_>
+        <_>
+          14 0 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 6 -1.</_>
+        <_>
+          7 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 6 -1.</_>
+        <_>
+          8 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 4 6 -1.</_>
+        <_>
+          11 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 2 -1.</_>
+        <_>
+          5 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 2 -1.</_>
+        <_>
+          4 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 3 -1.</_>
+        <_>
+          11 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 6 -1.</_>
+        <_>
+          5 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 2 3 -1.</_>
+        <_>
+          17 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 1 -1.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 4 -1.</_>
+        <_>
+          8 5 3 2 2.</_>
+        <_>
+          11 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 3 -1.</_>
+        <_>
+          11 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 7 -1.</_>
+        <_>
+          4 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 1 2 -1.</_>
+        <_>
+          11 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 3 5 -1.</_>
+        <_>
+          4 9 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 3 -1.</_>
+        <_>
+          11 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 6 12 -1.</_>
+        <_>
+          3 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 5 6 -1.</_>
+        <_>
+          3 7 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 11 -1.</_>
+        <_>
+          8 6 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 6 -1.</_>
+        <_>
+          7 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 8 -1.</_>
+        <_>
+          3 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 1 -1.</_>
+        <_>
+          7 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 2 3 -1.</_>
+        <_>
+          13 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 3 -1.</_>
+        <_>
+          10 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 3 -1.</_>
+        <_>
+          19 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 5 3 -1.</_>
+        <_>
+          5 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 4 -1.</_>
+        <_>
+          9 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 3 -1.</_>
+        <_>
+          12 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 3 -1.</_>
+        <_>
+          5 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          6 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 8 2 -1.</_>
+        <_>
+          8 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 8 -1.</_>
+        <_>
+          14 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 5 -1.</_>
+        <_>
+          12 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 2 -1.</_>
+        <_>
+          7 14 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 3 -1.</_>
+        <_>
+          13 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 14 12 -1.</_>
+        <_>
+          6 3 7 6 2.</_>
+        <_>
+          13 9 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 10 -1.</_>
+        <_>
+          16 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 4 -1.</_>
+        <_>
+          0 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 2 -1.</_>
+        <_>
+          11 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          12 0 4 1 2.</_>
+        <_>
+          16 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 14 6 -1.</_>
+        <_>
+          3 12 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 4 -1.</_>
+        <_>
+          7 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 1 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 5 10 -1.</_>
+        <_>
+          11 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 4 4 -1.</_>
+        <_>
+          3 16 2 2 2.</_>
+        <_>
+          5 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 3 -1.</_>
+        <_>
+          7 2 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 20 -1.</_>
+        <_>
+          4 0 4 10 2.</_>
+        <_>
+          8 10 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 4 -1.</_>
+        <_>
+          4 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 2 -1.</_>
+        <_>
+          11 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 3 -1.</_>
+        <_>
+          11 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 14 1 -1.</_>
+        <_>
+          13 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 3 -1.</_>
+        <_>
+          6 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 2 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 2 1 -1.</_>
+        <_>
+          10 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 3 -1.</_>
+        <_>
+          6 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 6 -1.</_>
+        <_>
+          9 9 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 7 -1.</_>
+        <_>
+          10 12 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 3 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 11 -1.</_>
+        <_>
+          12 5 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 2 -1.</_>
+        <_>
+          2 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 16 -1.</_>
+        <_>
+          12 0 4 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 11 -1.</_>
+        <_>
+          14 0 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 6 -1.</_>
+        <_>
+          6 5 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 4 -1.</_>
+        <_>
+          8 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 12 -1.</_>
+        <_>
+          13 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 14 -1.</_>
+        <_>
+          10 13 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 10 1 -1.</_>
+        <_>
+          6 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 13 6 -1.</_>
+        <_>
+          4 4 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 3 -1.</_>
+        <_>
+          12 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 9 -1.</_>
+        <_>
+          6 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 10 -1.</_>
+        <_>
+          6 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 4 -1.</_>
+        <_>
+          3 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 6 -1.</_>
+        <_>
+          4 8 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 6 -1.</_>
+        <_>
+          12 12 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 3 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          5 8 3 3 2.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 1 -1.</_>
+        <_>
+          4 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 3 -1.</_>
+        <_>
+          10 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 4 3 -1.</_>
+        <_>
+          10 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 1 -1.</_>
+        <_>
+          10 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 14 -1.</_>
+        <_>
+          2 7 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 2 -1.</_>
+        <_>
+          10 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 3 -1.</_>
+        <_>
+          8 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 5 2 -1.</_>
+        <_>
+          4 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 6 -1.</_>
+        <_>
+          0 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 1 6 -1.</_>
+        <_>
+          13 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 3 -1.</_>
+        <_>
+          6 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 7 3 -1.</_>
+        <_>
+          3 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 5 3 -1.</_>
+        <_>
+          10 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 5 20 -1.</_>
+        <_>
+          4 10 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 2 -1.</_>
+        <_>
+          7 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 15 -1.</_>
+        <_>
+          18 5 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 7 3 -1.</_>
+        <_>
+          6 16 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 6 2 -1.</_>
+        <_>
+          10 14 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 1 9 -1.</_>
+        <_>
+          13 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 4 -1.</_>
+        <_>
+          3 0 2 2 2.</_>
+        <_>
+          5 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 6 -1.</_>
+        <_>
+          0 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 1 -1.</_>
+        <_>
+          6 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          6 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 7 -1.</_>
+        <_>
+          8 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          8 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 1 -1.</_>
+        <_>
+          7 8 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 8 -1.</_>
+        <_>
+          9 7 1 4 2.</_>
+        <_>
+          10 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 5 -1.</_>
+        <_>
+          15 2 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 3 -1.</_>
+        <_>
+          6 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 1 2 -1.</_>
+        <_>
+          6 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 3 -1.</_>
+        <_>
+          12 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 12 3 -1.</_>
+        <_>
+          5 14 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 1 -1.</_>
+        <_>
+          12 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 2 3 -1.</_>
+        <_>
+          14 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 2 -1.</_>
+        <_>
+          8 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 3 11 -1.</_>
+        <_>
+          3 7 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 2 1 -1.</_>
+        <_>
+          1 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 4 -1.</_>
+        <_>
+          18 10 1 2 2.</_>
+        <_>
+          19 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 2 -1.</_>
+        <_>
+          14 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 12 -1.</_>
+        <_>
+          13 5 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 3 -1.</_>
+        <_>
+          12 5 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 1 2 -1.</_>
+        <_>
+          14 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 16 -1.</_>
+        <_>
+          3 8 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 5 -1.</_>
+        <_>
+          4 11 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 6 -1.</_>
+        <_>
+          4 8 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 3 5 -1.</_>
+        <_>
+          12 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 2 6 -1.</_>
+        <_>
+          18 10 1 3 2.</_>
+        <_>
+          19 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 6 1 -1.</_>
+        <_>
+          16 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 7 6 -1.</_>
+        <_>
+          5 13 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 6 6 -1.</_>
+        <_>
+          2 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 3 3 -1.</_>
+        <_>
+          11 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 3 -1.</_>
+        <_>
+          7 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 5 3 -1.</_>
+        <_>
+          5 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 1 -1.</_>
+        <_>
+          7 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 3 -1.</_>
+        <_>
+          4 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 4 8 -1.</_>
+        <_>
+          2 2 2 4 2.</_>
+        <_>
+          4 6 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 3 -1.</_>
+        <_>
+          12 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 3 -1.</_>
+        <_>
+          9 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 3 -1.</_>
+        <_>
+          8 9 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          10 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 2 -1.</_>
+        <_>
+          4 0 4 1 2.</_>
+        <_>
+          8 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 1 2 -1.</_>
+        <_>
+          0 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 8 4 -1.</_>
+        <_>
+          8 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 9 3 -1.</_>
+        <_>
+          4 18 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 8 -1.</_>
+        <_>
+          10 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 6 -1.</_>
+        <_>
+          10 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 10 5 -1.</_>
+        <_>
+          12 2 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 6 -1.</_>
+        <_>
+          9 7 2 3 2.</_>
+        <_>
+          11 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 1 6 -1.</_>
+        <_>
+          12 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          4 2 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 1 3 -1.</_>
+        <_>
+          10 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          6 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 3 -1.</_>
+        <_>
+          10 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 16 9 -1.</_>
+        <_>
+          4 6 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          7 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 3 -1.</_>
+        <_>
+          10 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 8 -1.</_>
+        <_>
+          11 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 3 5 -1.</_>
+        <_>
+          2 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 2 -1.</_>
+        <_>
+          7 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 3 -1.</_>
+        <_>
+          10 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 3 -1.</_>
+        <_>
+          11 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 3 -1.</_>
+        <_>
+          10 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 7 3 -1.</_>
+        <_>
+          11 4 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 2 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 3 -1.</_>
+        <_>
+          8 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 3 -1.</_>
+        <_>
+          10 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 2 -1.</_>
+        <_>
+          5 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 8 4 -1.</_>
+        <_>
+          4 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 4 -1.</_>
+        <_>
+          6 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 2 -1.</_>
+        <_>
+          4 0 2 1 2.</_>
+        <_>
+          6 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 2 -1.</_>
+        <_>
+          13 10 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 2 -1.</_>
+        <_>
+          13 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 1 -1.</_>
+        <_>
+          12 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 6 -1.</_>
+        <_>
+          6 9 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 3 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 2 -1.</_>
+        <_>
+          14 11 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 1 -1.</_>
+        <_>
+          12 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 1 -1.</_>
+        <_>
+          10 11 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 5 -1.</_>
+        <_>
+          3 13 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 1 -1.</_>
+        <_>
+          15 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 1 -1.</_>
+        <_>
+          15 0 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 3 -1.</_>
+        <_>
+          5 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 2 -1.</_>
+        <_>
+          12 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 2 3 -1.</_>
+        <_>
+          12 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 1 3 -1.</_>
+        <_>
+          8 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 3 -1.</_>
+        <_>
+          0 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 3 -1.</_>
+        <_>
+          0 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 2 -1.</_>
+        <_>
+          4 8 1 1 2.</_>
+        <_>
+          5 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 8 10 -1.</_>
+        <_>
+          3 6 4 5 2.</_>
+        <_>
+          7 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 1 3 -1.</_>
+        <_>
+          6 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 8 -1.</_>
+        <_>
+          13 0 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          10 0 5 3 2.</_>
+        <_>
+          15 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 2 -1.</_>
+        <_>
+          17 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 14 -1.</_>
+        <_>
+          14 0 6 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 2 1 -1.</_>
+        <_>
+          11 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 6 -1.</_>
+        <_>
+          18 9 1 3 2.</_>
+        <_>
+          19 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 16 -1.</_>
+        <_>
+          18 4 1 8 2.</_>
+        <_>
+          19 12 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 11 -1.</_>
+        <_>
+          8 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          7 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 5 -1.</_>
+        <_>
+          7 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 4 -1.</_>
+        <_>
+          11 16 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 18 -1.</_>
+        <_>
+          3 9 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 7 3 -1.</_>
+        <_>
+          1 8 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 6 -1.</_>
+        <_>
+          5 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 10 -1.</_>
+        <_>
+          4 8 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 2 -1.</_>
+        <_>
+          4 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 10 3 -1.</_>
+        <_>
+          8 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 2 -1.</_>
+        <_>
+          8 15 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 2 -1.</_>
+        <_>
+          6 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 3 -1.</_>
+        <_>
+          17 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 1 3 -1.</_>
+        <_>
+          8 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 3 -1.</_>
+        <_>
+          18 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 5 6 -1.</_>
+        <_>
+          5 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 3 -1.</_>
+        <_>
+          13 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 10 -1.</_>
+        <_>
+          6 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 4 -1.</_>
+        <_>
+          5 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 1 -1.</_>
+        <_>
+          4 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 2 -1.</_>
+        <_>
+          7 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 6 -1.</_>
+        <_>
+          8 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 10 -1.</_>
+        <_>
+          10 10 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 2 2 -1.</_>
+        <_>
+          13 8 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 4 -1.</_>
+        <_>
+          15 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 2 -1.</_>
+        <_>
+          8 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 6 -1.</_>
+        <_>
+          10 14 3 3 2.</_>
+        <_>
+          13 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 1 3 -1.</_>
+        <_>
+          13 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 8 -1.</_>
+        <_>
+          4 4 5 4 2.</_>
+        <_>
+          9 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 6 -1.</_>
+        <_>
+          5 1 3 3 2.</_>
+        <_>
+          8 4 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 3 -1.</_>
+        <_>
+          11 11 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 6 -1.</_>
+        <_>
+          3 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 0 6 3 2.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 4 -1.</_>
+        <_>
+          7 8 1 2 2.</_>
+        <_>
+          8 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 7 10 -1.</_>
+        <_>
+          11 6 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 2 -1.</_>
+        <_>
+          10 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 3 -1.</_>
+        <_>
+          12 11 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 2 -1.</_>
+        <_>
+          6 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 2 -1.</_>
+        <_>
+          12 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 9 -1.</_>
+        <_>
+          11 6 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 3 -1.</_>
+        <_>
+          11 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          10 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 6 -1.</_>
+        <_>
+          7 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 6 -1.</_>
+        <_>
+          3 0 2 3 2.</_>
+        <_>
+          5 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 17 -1.</_>
+        <_>
+          6 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 6 3 -1.</_>
+        <_>
+          12 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 8 1 -1.</_>
+        <_>
+          14 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 5 3 -1.</_>
+        <_>
+          13 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          6 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 3 10 -1.</_>
+        <_>
+          13 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 3 -1.</_>
+        <_>
+          7 7 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 1 3 -1.</_>
+        <_>
+          6 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 3 -1.</_>
+        <_>
+          6 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 3 -1.</_>
+        <_>
+          11 4 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 2 3 -1.</_>
+        <_>
+          13 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 8 4 -1.</_>
+        <_>
+          6 16 4 2 2.</_>
+        <_>
+          10 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 15 -1.</_>
+        <_>
+          11 5 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          10 0 5 3 2.</_>
+        <_>
+          15 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 16 -1.</_>
+        <_>
+          12 2 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 2 -1.</_>
+        <_>
+          7 12 1 1 2.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 1 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 4 -1.</_>
+        <_>
+          7 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 16 6 -1.</_>
+        <_>
+          0 15 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 3 -1.</_>
+        <_>
+          7 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 2 2 -1.</_>
+        <_>
+          15 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 2 2 -1.</_>
+        <_>
+          17 12 1 1 2.</_>
+        <_>
+          18 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 19 -1.</_>
+        <_>
+          12 1 1 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 19 4 -1.</_>
+        <_>
+          1 13 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 2 10 -1.</_>
+        <_>
+          17 8 1 5 2.</_>
+        <_>
+          18 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 20 -1.</_>
+        <_>
+          9 10 11 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 12 -1.</_>
+        <_>
+          4 1 6 6 2.</_>
+        <_>
+          10 7 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 6 -1.</_>
+        <_>
+          6 11 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 4 -1.</_>
+        <_>
+          19 1 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 15 -1.</_>
+        <_>
+          15 0 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 2 -1.</_>
+        <_>
+          7 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 8 -1.</_>
+        <_>
+          6 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 4 -1.</_>
+        <_>
+          9 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 2 -1.</_>
+        <_>
+          0 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 4 -1.</_>
+        <_>
+          7 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 2 -1.</_>
+        <_>
+          11 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 2 -1.</_>
+        <_>
+          5 8 1 1 2.</_>
+        <_>
+          6 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 3 -1.</_>
+        <_>
+          12 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 2 -1.</_>
+        <_>
+          10 8 1 1 2.</_>
+        <_>
+          11 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 2 -1.</_>
+        <_>
+          7 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 1 -1.</_>
+        <_>
+          14 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 6 -1.</_>
+        <_>
+          16 9 1 3 2.</_>
+        <_>
+          17 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 6 -1.</_>
+        <_>
+          17 4 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 7 6 -1.</_>
+        <_>
+          13 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 4 4 -1.</_>
+        <_>
+          16 10 2 2 2.</_>
+        <_>
+          18 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 2 -1.</_>
+        <_>
+          11 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 3 -1.</_>
+        <_>
+          6 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 4 2 -1.</_>
+        <_>
+          4 15 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 1 -1.</_>
+        <_>
+          1 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 4 8 -1.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 7 3 -1.</_>
+        <_>
+          9 18 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 3 -1.</_>
+        <_>
+          7 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 4 3 -1.</_>
+        <_>
+          12 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 9 11 -1.</_>
+        <_>
+          14 7 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 4 5 -1.</_>
+        <_>
+          18 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 3 4 -1.</_>
+        <_>
+          10 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 8 -1.</_>
+        <_>
+          3 11 1 4 2.</_>
+        <_>
+          4 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 18 -1.</_>
+        <_>
+          13 2 3 9 2.</_>
+        <_>
+          16 11 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 5 2 -1.</_>
+        <_>
+          9 13 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 10 -1.</_>
+        <_>
+          11 8 2 5 2.</_>
+        <_>
+          13 13 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 1 -1.</_>
+        <_>
+          10 11 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 1 2 -1.</_>
+        <_>
+          1 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 3 -1.</_>
+        <_>
+          8 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 10 3 -1.</_>
+        <_>
+          13 5 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 6 -1.</_>
+        <_>
+          5 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 3 7 -1.</_>
+        <_>
+          3 8 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 6 -1.</_>
+        <_>
+          3 10 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 2 -1.</_>
+        <_>
+          15 0 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 4 -1.</_>
+        <_>
+          8 7 2 2 2.</_>
+        <_>
+          10 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 3 -1.</_>
+        <_>
+          4 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 2 -1.</_>
+        <_>
+          8 12 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 1 4 -1.</_>
+        <_>
+          17 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 3 -1.</_>
+        <_>
+          6 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 8 -1.</_>
+        <_>
+          7 9 3 4 2.</_>
+        <_>
+          10 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 3 -1.</_>
+        <_>
+          5 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 4 9 -1.</_>
+        <_>
+          7 13 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 1 -1.</_>
+        <_>
+          6 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 19 -1.</_>
+        <_>
+          2 1 2 19 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 2 -1.</_>
+        <_>
+          8 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 4 -1.</_>
+        <_>
+          9 12 1 2 2.</_>
+        <_>
+          10 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 10 -1.</_>
+        <_>
+          12 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 8 -1.</_>
+        <_>
+          10 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 2 6 -1.</_>
+        <_>
+          5 3 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 3 3 -1.</_>
+        <_>
+          5 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 8 -1.</_>
+        <_>
+          10 7 1 4 2.</_>
+        <_>
+          11 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 10 -1.</_>
+        <_>
+          2 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 2 -1.</_>
+        <_>
+          8 11 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 1 -1.</_>
+        <_>
+          11 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 4 3 -1.</_>
+        <_>
+          4 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 2 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 1 -1.</_>
+        <_>
+          8 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 3 -1.</_>
+        <_>
+          5 6 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 5 3 -1.</_>
+        <_>
+          5 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 9 -1.</_>
+        <_>
+          10 10 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 2 -1.</_>
+        <_>
+          17 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 10 4 -1.</_>
+        <_>
+          4 9 5 2 2.</_>
+        <_>
+          9 11 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 10 -1.</_>
+        <_>
+          5 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 5 -1.</_>
+        <_>
+          11 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 4 -1.</_>
+        <_>
+          9 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 15 6 -1.</_>
+        <_>
+          5 13 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 6 -1.</_>
+        <_>
+          16 0 2 3 2.</_>
+        <_>
+          18 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 2 -1.</_>
+        <_>
+          11 12 1 1 2.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 5 -1.</_>
+        <_>
+          7 6 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 1 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 2 -1.</_>
+        <_>
+          6 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 3 1 -1.</_>
+        <_>
+          17 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 8 -1.</_>
+        <_>
+          14 5 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 4 -1.</_>
+        <_>
+          5 13 2 2 2.</_>
+        <_>
+          7 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 3 -1.</_>
+        <_>
+          6 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 2 10 -1.</_>
+        <_>
+          9 2 1 5 2.</_>
+        <_>
+          10 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 2 -1.</_>
+        <_>
+          9 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 4 -1.</_>
+        <_>
+          15 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 3 -1.</_>
+        <_>
+          7 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 8 2 -1.</_>
+        <_>
+          7 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 2 -1.</_>
+        <_>
+          13 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 2 -1.</_>
+        <_>
+          13 11 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 4 -1.</_>
+        <_>
+          0 10 1 2 2.</_>
+        <_>
+          1 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 8 -1.</_>
+        <_>
+          0 8 1 4 2.</_>
+        <_>
+          1 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 5 3 -1.</_>
+        <_>
+          6 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 4 -1.</_>
+        <_>
+          19 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 1 -1.</_>
+        <_>
+          15 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 3 -1.</_>
+        <_>
+          9 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 3 -1.</_>
+        <_>
+          5 14 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 3 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 14 6 -1.</_>
+        <_>
+          2 17 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 4 -1.</_>
+        <_>
+          7 5 1 2 2.</_>
+        <_>
+          8 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 17 1 1 2.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 3 5 -1.</_>
+        <_>
+          10 3 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 3 -1.</_>
+        <_>
+          6 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 4 -1.</_>
+        <_>
+          12 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 10 -1.</_>
+        <_>
+          4 8 3 5 2.</_>
+        <_>
+          7 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 2 6 -1.</_>
+        <_>
+          5 3 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 6 -1.</_>
+        <_>
+          5 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 8 -1.</_>
+        <_>
+          5 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 2 -1.</_>
+        <_>
+          5 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 1 3 -1.</_>
+        <_>
+          12 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 15 -1.</_>
+        <_>
+          5 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 3 3 -1.</_>
+        <_>
+          6 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 3 -1.</_>
+        <_>
+          12 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 15 3 -1.</_>
+        <_>
+          7 2 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 5 -1.</_>
+        <_>
+          12 0 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 8 -1.</_>
+        <_>
+          13 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 4 -1.</_>
+        <_>
+          9 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 16 -1.</_>
+        <_>
+          5 2 3 8 2.</_>
+        <_>
+          8 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 3 -1.</_>
+        <_>
+          13 7 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 1 -1.</_>
+        <_>
+          13 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 8 -1.</_>
+        <_>
+          0 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 15 -1.</_>
+        <_>
+          8 5 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 2 -1.</_>
+        <_>
+          8 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 1 2 -1.</_>
+        <_>
+          1 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 11 -1.</_>
+        <_>
+          9 2 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 6 -1.</_>
+        <_>
+          9 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 8 -1.</_>
+        <_>
+          13 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 6 4 -1.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 20 14 -1.</_>
+        <_>
+          10 6 10 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 0 6 3 2.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 9 -1.</_>
+        <_>
+          8 10 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 6 -1.</_>
+        <_>
+          10 14 3 3 2.</_>
+        <_>
+          13 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 10 -1.</_>
+        <_>
+          8 7 2 5 2.</_>
+        <_>
+          10 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 3 3 -1.</_>
+        <_>
+          15 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          16 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 1 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 7 -1.</_>
+        <_>
+          12 7 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 2 18 -1.</_>
+        <_>
+          9 0 1 9 2.</_>
+        <_>
+          10 9 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 4 -1.</_>
+        <_>
+          4 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 2 2 -1.</_>
+        <_>
+          14 10 1 1 2.</_>
+        <_>
+          15 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 2 -1.</_>
+        <_>
+          5 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 4 3 -1.</_>
+        <_>
+          10 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 3 -1.</_>
+        <_>
+          12 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 2 8 -1.</_>
+        <_>
+          3 0 1 4 2.</_>
+        <_>
+          4 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 5 3 -1.</_>
+        <_>
+          14 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 1 3 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 2 3 -1.</_>
+        <_>
+          5 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 6 -1.</_>
+        <_>
+          4 6 5 3 2.</_>
+        <_>
+          9 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 7 4 -1.</_>
+        <_>
+          9 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 4 -1.</_>
+        <_>
+          10 11 1 2 2.</_>
+        <_>
+          11 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          5 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 2 -1.</_>
+        <_>
+          5 14 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 8 4 -1.</_>
+        <_>
+          7 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 1 -1.</_>
+        <_>
+          9 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 1 4 -1.</_>
+        <_>
+          6 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 6 -1.</_>
+        <_>
+          8 0 6 3 2.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 1 -1.</_>
+        <_>
+          8 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 2 -1.</_>
+        <_>
+          7 9 1 1 2.</_>
+        <_>
+          8 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 14 4 6 -1.</_>
+        <_>
+          15 14 2 3 2.</_>
+        <_>
+          17 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 4 -1.</_>
+        <_>
+          7 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 9 -1.</_>
+        <_>
+          11 11 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 1 -1.</_>
+        <_>
+          18 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 1 -1.</_>
+        <_>
+          18 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 2 -1.</_>
+        <_>
+          0 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 7 3 -1.</_>
+        <_>
+          9 16 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 2 -1.</_>
+        <_>
+          16 0 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 1 14 -1.</_>
+        <_>
+          5 7 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 1 2 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 6 -1.</_>
+        <_>
+          7 2 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 2 -1.</_>
+        <_>
+          8 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 3 -1.</_>
+        <_>
+          5 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 2 -1.</_>
+        <_>
+          18 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 10 -1.</_>
+        <_>
+          18 0 1 5 2.</_>
+        <_>
+          19 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 13 6 -1.</_>
+        <_>
+          0 4 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 0 1 1 2.</_>
+        <_>
+          1 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 4 -1.</_>
+        <_>
+          7 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 4 10 -1.</_>
+        <_>
+          9 9 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 16 -1.</_>
+        <_>
+          2 8 9 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 2 8 -1.</_>
+        <_>
+          10 3 1 4 2.</_>
+        <_>
+          11 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 3 -1.</_>
+        <_>
+          5 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 3 -1.</_>
+        <_>
+          5 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 10 -1.</_>
+        <_>
+          3 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 2 1 -1.</_>
+        <_>
+          2 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 5 -1.</_>
+        <_>
+          13 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 9 6 -1.</_>
+        <_>
+          6 7 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 2 3 -1.</_>
+        <_>
+          13 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 4 -1.</_>
+        <_>
+          7 15 3 2 2.</_>
+        <_>
+          10 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 3 -1.</_>
+        <_>
+          10 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 2 6 -1.</_>
+        <_>
+          3 2 1 3 2.</_>
+        <_>
+          4 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 5 -1.</_>
+        <_>
+          11 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 5 2 -1.</_>
+        <_>
+          12 10 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 10 1 -1.</_>
+        <_>
+          9 11 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 2 -1.</_>
+        <_>
+          6 12 3 1 2.</_>
+        <_>
+          9 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 4 -1.</_>
+        <_>
+          3 12 4 2 2.</_>
+        <_>
+          7 14 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 1 3 -1.</_>
+        <_>
+          0 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 1 -1.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 6 -1.</_>
+        <_>
+          3 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 6 -1.</_>
+        <_>
+          8 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 3 -1.</_>
+        <_>
+          12 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 3 -1.</_>
+        <_>
+          12 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 2 -1.</_>
+        <_>
+          6 10 1 1 2.</_>
+        <_>
+          7 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 9 6 -1.</_>
+        <_>
+          3 13 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 7 10 -1.</_>
+        <_>
+          4 13 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 11 3 -1.</_>
+        <_>
+          6 9 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 1 14 -1.</_>
+        <_>
+          6 12 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 5 10 -1.</_>
+        <_>
+          13 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 13 15 -1.</_>
+        <_>
+          2 5 13 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          7 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 4 -1.</_>
+        <_>
+          7 5 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 3 -1.</_>
+        <_>
+          7 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 4 -1.</_>
+        <_>
+          9 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 7 2 -1.</_>
+        <_>
+          8 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 2 -1.</_>
+        <_>
+          5 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 6 -1.</_>
+        <_>
+          4 14 1 3 2.</_>
+        <_>
+          5 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 13 -1.</_>
+        <_>
+          4 7 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 9 -1.</_>
+        <_>
+          8 3 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 3 -1.</_>
+        <_>
+          9 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 2 6 -1.</_>
+        <_>
+          16 14 1 3 2.</_>
+        <_>
+          17 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 3 -1.</_>
+        <_>
+          11 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 2 -1.</_>
+        <_>
+          11 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 2 -1.</_>
+        <_>
+          8 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 5 -1.</_>
+        <_>
+          14 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 2 -1.</_>
+        <_>
+          6 15 4 1 2.</_>
+        <_>
+          10 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 4 -1.</_>
+        <_>
+          14 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 1 6 -1.</_>
+        <_>
+          1 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          12 0 4 1 2.</_>
+        <_>
+          16 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 1 -1.</_>
+        <_>
+          6 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 4 -1.</_>
+        <_>
+          8 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 1 -1.</_>
+        <_>
+          8 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 2 3 -1.</_>
+        <_>
+          0 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 2 -1.</_>
+        <_>
+          3 17 1 1 2.</_>
+        <_>
+          4 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 9 -1.</_>
+        <_>
+          12 0 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 3 -1.</_>
+        <_>
+          11 0 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 3 2.</_>
+        <_>
+          17 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 1 2 -1.</_>
+        <_>
+          15 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 1 6 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          6 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 6 -1.</_>
+        <_>
+          6 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 2 -1.</_>
+        <_>
+          13 6 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 15 -1.</_>
+        <_>
+          4 1 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 6 -1.</_>
+        <_>
+          5 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 1 -1.</_>
+        <_>
+          13 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 2 -1.</_>
+        <_>
+          8 4 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 8 -1.</_>
+        <_>
+          12 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 4 -1.</_>
+        <_>
+          15 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          6 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 6 -1.</_>
+        <_>
+          7 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 9 -1.</_>
+        <_>
+          7 11 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 3 -1.</_>
+        <_>
+          5 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 2 -1.</_>
+        <_>
+          11 12 1 1 2.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 5 3 -1.</_>
+        <_>
+          5 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 1 -1.</_>
+        <_>
+          8 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 6 -1.</_>
+        <_>
+          12 0 4 3 2.</_>
+        <_>
+          16 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 3 -1.</_>
+        <_>
+          9 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 15 -1.</_>
+        <_>
+          8 5 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 4 -1.</_>
+        <_>
+          3 0 4 2 2.</_>
+        <_>
+          7 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 1 -1.</_>
+        <_>
+          10 11 10 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 3 2 -1.</_>
+        <_>
+          4 14 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 8 -1.</_>
+        <_>
+          4 11 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 5 -1.</_>
+        <_>
+          8 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 3 3 -1.</_>
+        <_>
+          14 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 2 -1.</_>
+        <_>
+          6 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 1 -1.</_>
+        <_>
+          6 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 3 -1.</_>
+        <_>
+          12 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 3 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 12 9 -1.</_>
+        <_>
+          1 12 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 3 -1.</_>
+        <_>
+          12 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 5 3 -1.</_>
+        <_>
+          10 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 6 -1.</_>
+        <_>
+          5 14 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 14 -1.</_>
+        <_>
+          6 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 5 2 -1.</_>
+        <_>
+          2 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 1 2 -1.</_>
+        <_>
+          10 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 6 -1.</_>
+        <_>
+          7 16 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 1 -1.</_>
+        <_>
+          9 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 4 -1.</_>
+        <_>
+          4 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 8 -1.</_>
+        <_>
+          4 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 2 -1.</_>
+        <_>
+          12 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          16 10 1 1 2.</_>
+        <_>
+          17 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 8 -1.</_>
+        <_>
+          7 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 10 -1.</_>
+        <_>
+          4 5 4 5 2.</_>
+        <_>
+          8 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 3 -1.</_>
+        <_>
+          7 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 14 -1.</_>
+        <_>
+          10 13 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 3 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 1 4 -1.</_>
+        <_>
+          13 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 4 -1.</_>
+        <_>
+          3 9 6 2 2.</_>
+        <_>
+          9 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 6 -1.</_>
+        <_>
+          7 16 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 2 -1.</_>
+        <_>
+          11 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 10 4 -1.</_>
+        <_>
+          3 4 5 2 2.</_>
+        <_>
+          8 6 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 3 -1.</_>
+        <_>
+          4 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 4 -1.</_>
+        <_>
+          5 3 3 2 2.</_>
+        <_>
+          8 5 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 10 -1.</_>
+        <_>
+          9 8 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 3 -1.</_>
+        <_>
+          10 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 7 -1.</_>
+        <_>
+          4 4 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 11 -1.</_>
+        <_>
+          4 3 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 5 3 -1.</_>
+        <_>
+          7 15 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 3 4 -1.</_>
+        <_>
+          10 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 1 -1.</_>
+        <_>
+          12 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 1 -1.</_>
+        <_>
+          1 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 8 -1.</_>
+        <_>
+          17 0 1 4 2.</_>
+        <_>
+          18 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 2 -1.</_>
+        <_>
+          8 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 9 -1.</_>
+        <_>
+          8 7 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 9 3 -1.</_>
+        <_>
+          9 8 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 4 -1.</_>
+        <_>
+          13 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 2 -1.</_>
+        <_>
+          9 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 4 10 -1.</_>
+        <_>
+          15 8 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 1 2 -1.</_>
+        <_>
+          9 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 8 2 -1.</_>
+        <_>
+          7 15 4 1 2.</_>
+        <_>
+          11 16 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 9 -1.</_>
+        <_>
+          7 5 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 4 -1.</_>
+        <_>
+          7 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 4 -1.</_>
+        <_>
+          11 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 4 -1.</_>
+        <_>
+          12 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 9 3 -1.</_>
+        <_>
+          8 9 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 5 -1.</_>
+        <_>
+          8 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 4 3 -1.</_>
+        <_>
+          7 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 4 3 -1.</_>
+        <_>
+          15 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          16 10 1 1 2.</_>
+        <_>
+          17 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 9 -1.</_>
+        <_>
+          8 6 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 6 -1.</_>
+        <_>
+          10 0 5 3 2.</_>
+        <_>
+          15 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 2 -1.</_>
+        <_>
+          13 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 3 1 -1.</_>
+        <_>
+          11 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 1 3 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 4 3 -1.</_>
+        <_>
+          11 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 6 -1.</_>
+        <_>
+          14 10 3 3 2.</_>
+        <_>
+          17 13 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 1 2 -1.</_>
+        <_>
+          1 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 1 3 -1.</_>
+        <_>
+          6 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 1 3 -1.</_>
+        <_>
+          7 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 2 -1.</_>
+        <_>
+          9 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 9 -1.</_>
+        <_>
+          6 8 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 10 -1.</_>
+        <_>
+          3 3 1 5 2.</_>
+        <_>
+          4 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 1 -1.</_>
+        <_>
+          4 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 1 -1.</_>
+        <_>
+          3 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 3 -1.</_>
+        <_>
+          7 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 9 -1.</_>
+        <_>
+          7 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 1 9 -1.</_>
+        <_>
+          7 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 10 -1.</_>
+        <_>
+          16 7 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 10 -1.</_>
+        <_>
+          16 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 6 -1.</_>
+        <_>
+          2 14 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 1 -1.</_>
+        <_>
+          4 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 3 6 -1.</_>
+        <_>
+          2 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 1 -1.</_>
+        <_>
+          9 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 1 -1.</_>
+        <_>
+          11 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 10 -1.</_>
+        <_>
+          16 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 7 -1.</_>
+        <_>
+          14 5 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 5 4 2 2.</_>
+        <_>
+          12 7 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 8 -1.</_>
+        <_>
+          11 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 4 -1.</_>
+        <_>
+          6 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 2 -1.</_>
+        <_>
+          7 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 11 -1.</_>
+        <_>
+          4 2 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 8 -1.</_>
+        <_>
+          8 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 6 -1.</_>
+        <_>
+          5 4 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 2 -1.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 2 -1.</_>
+        <_>
+          4 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 3 -1.</_>
+        <_>
+          13 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 19 4 1 -1.</_>
+        <_>
+          11 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 3 -1.</_>
+        <_>
+          15 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 11 4 -1.</_>
+        <_>
+          5 13 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 4 -1.</_>
+        <_>
+          6 14 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 1 3 -1.</_>
+        <_>
+          7 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 3 -1.</_>
+        <_>
+          10 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 1 -1.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 16 -1.</_>
+        <_>
+          7 1 6 8 2.</_>
+        <_>
+          13 9 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 7 -1.</_>
+        <_>
+          14 5 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 2 10 -1.</_>
+        <_>
+          18 8 1 5 2.</_>
+        <_>
+          19 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          13 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 1 -1.</_>
+        <_>
+          4 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 2 1 -1.</_>
+        <_>
+          6 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 1 2 -1.</_>
+        <_>
+          11 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 1 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 7 2 -1.</_>
+        <_>
+          5 10 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 1 -1.</_>
+        <_>
+          12 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 2 2 -1.</_>
+        <_>
+          12 0 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 2 -1.</_>
+        <_>
+          5 0 1 1 2.</_>
+        <_>
+          6 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 6 -1.</_>
+        <_>
+          8 5 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 12 -1.</_>
+        <_>
+          18 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 1 -1.</_>
+        <_>
+          12 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 1 -1.</_>
+        <_>
+          6 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 6 -1.</_>
+        <_>
+          7 14 3 3 2.</_>
+        <_>
+          10 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 1 2 -1.</_>
+        <_>
+          11 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 12 4 -1.</_>
+        <_>
+          3 9 6 2 2.</_>
+        <_>
+          9 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 2 -1.</_>
+        <_>
+          5 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 1 -1.</_>
+        <_>
+          7 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 2 -1.</_>
+        <_>
+          9 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 2 -1.</_>
+        <_>
+          8 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 1 -1.</_>
+        <_>
+          9 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          5 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 12 -1.</_>
+        <_>
+          8 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 7 -1.</_>
+        <_>
+          8 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 11 -1.</_>
+        <_>
+          11 4 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 3 -1.</_>
+        <_>
+          9 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 1 2 -1.</_>
+        <_>
+          0 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 1 -1.</_>
+        <_>
+          7 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 2 -1.</_>
+        <_>
+          13 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 10 12 -1.</_>
+        <_>
+          4 4 5 6 2.</_>
+        <_>
+          9 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 2 2 -1.</_>
+        <_>
+          5 18 1 1 2.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 3 3 -1.</_>
+        <_>
+          7 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 3 -1.</_>
+        <_>
+          5 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 2 3 -1.</_>
+        <_>
+          11 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 1 3 -1.</_>
+        <_>
+          11 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 2 -1.</_>
+        <_>
+          7 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 14 1 -1.</_>
+        <_>
+          10 11 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 1 -1.</_>
+        <_>
+          6 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 3 3 -1.</_>
+        <_>
+          14 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 2 2 -1.</_>
+        <_>
+          4 17 1 1 2.</_>
+        <_>
+          5 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 2 2 -1.</_>
+        <_>
+          18 12 1 1 2.</_>
+        <_>
+          19 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 3 -1.</_>
+        <_>
+          7 11 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 3 -1.</_>
+        <_>
+          9 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 6 -1.</_>
+        <_>
+          4 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 4 -1.</_>
+        <_>
+          3 11 3 2 2.</_>
+        <_>
+          6 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 3 -1.</_>
+        <_>
+          2 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 4 -1.</_>
+        <_>
+          15 0 2 2 2.</_>
+        <_>
+          17 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 10 -1.</_>
+        <_>
+          5 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 1 3 -1.</_>
+        <_>
+          7 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 4 -1.</_>
+        <_>
+          3 10 8 2 2.</_>
+        <_>
+          11 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 3 -1.</_>
+        <_>
+          5 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 8 -1.</_>
+        <_>
+          10 9 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 4 -1.</_>
+        <_>
+          6 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 1 4 -1.</_>
+        <_>
+          8 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 1 6 -1.</_>
+        <_>
+          1 6 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 3 -1.</_>
+        <_>
+          5 2 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 2 -1.</_>
+        <_>
+          0 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 4 -1.</_>
+        <_>
+          5 10 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 1 -1.</_>
+        <_>
+          9 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 11 1 1 2.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 2 -1.</_>
+        <_>
+          7 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 4 -1.</_>
+        <_>
+          8 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 6 -1.</_>
+        <_>
+          8 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 2 3 -1.</_>
+        <_>
+          15 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 7 -1.</_>
+        <_>
+          12 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 8 4 -1.</_>
+        <_>
+          7 16 4 2 2.</_>
+        <_>
+          11 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 4 -1.</_>
+        <_>
+          5 16 6 2 2.</_>
+        <_>
+          11 18 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 3 -1.</_>
+        <_>
+          10 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 18 -1.</_>
+        <_>
+          10 0 10 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 5 -1.</_>
+        <_>
+          11 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 2 -1.</_>
+        <_>
+          13 5 2 1 2.</_>
+        <_>
+          15 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 11 -1.</_>
+        <_>
+          12 4 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 1 -1.</_>
+        <_>
+          6 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 3 -1.</_>
+        <_>
+          17 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 6 -1.</_>
+        <_>
+          6 13 4 3 2.</_>
+        <_>
+          10 16 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 3 10 -1.</_>
+        <_>
+          18 5 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 2 -1.</_>
+        <_>
+          14 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 9 -1.</_>
+        <_>
+          5 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 2 -1.</_>
+        <_>
+          15 15 1 1 2.</_>
+        <_>
+          16 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 5 -1.</_>
+        <_>
+          8 13 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 8 -1.</_>
+        <_>
+          9 7 1 4 2.</_>
+        <_>
+          10 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 2 2 -1.</_>
+        <_>
+          4 12 1 1 2.</_>
+        <_>
+          5 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 1 -1.</_>
+        <_>
+          8 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 4 -1.</_>
+        <_>
+          13 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 20 -1.</_>
+        <_>
+          2 10 18 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 7 12 -1.</_>
+        <_>
+          11 8 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 2 -1.</_>
+        <_>
+          14 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 4 1 -1.</_>
+        <_>
+          6 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 4 -1.</_>
+        <_>
+          5 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 18 -1.</_>
+        <_>
+          0 11 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 3 -1.</_>
+        <_>
+          5 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 2 -1.</_>
+        <_>
+          9 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 15 4 -1.</_>
+        <_>
+          5 9 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 8 -1.</_>
+        <_>
+          10 0 5 4 2.</_>
+        <_>
+          15 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 4 -1.</_>
+        <_>
+          10 8 2 2 2.</_>
+        <_>
+          12 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 10 -1.</_>
+        <_>
+          5 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 4 -1.</_>
+        <_>
+          8 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 2 -1.</_>
+        <_>
+          12 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 12 -1.</_>
+        <_>
+          7 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 18 -1.</_>
+        <_>
+          2 0 2 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 10 6 -1.</_>
+        <_>
+          6 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 2 -1.</_>
+        <_>
+          13 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 1 10 -1.</_>
+        <_>
+          6 15 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 4 -1.</_>
+        <_>
+          9 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 2 -1.</_>
+        <_>
+          7 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 1 -1.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 1 2 -1.</_>
+        <_>
+          1 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 6 3 -1.</_>
+        <_>
+          10 17 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 6 -1.</_>
+        <_>
+          9 4 2 3 2.</_>
+        <_>
+          11 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 10 1 -1.</_>
+        <_>
+          15 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 1 2 -1.</_>
+        <_>
+          9 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 6 -1.</_>
+        <_>
+          7 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 8 2 -1.</_>
+        <_>
+          1 18 4 1 2.</_>
+        <_>
+          5 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 3 -1.</_>
+        <_>
+          5 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 5 6 -1.</_>
+        <_>
+          4 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 1 -1.</_>
+        <_>
+          7 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 1 6 -1.</_>
+        <_>
+          11 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 3 -1.</_>
+        <_>
+          6 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 2 10 -1.</_>
+        <_>
+          10 4 1 5 2.</_>
+        <_>
+          11 9 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 13 -1.</_>
+        <_>
+          11 4 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 2 2 -1.</_>
+        <_>
+          11 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 1 2 -1.</_>
+        <_>
+          13 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 10 -1.</_>
+        <_>
+          0 5 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 15 -1.</_>
+        <_>
+          14 5 2 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 2 3 -1.</_>
+        <_>
+          11 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 3 -1.</_>
+        <_>
+          5 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 3 2 -1.</_>
+        <_>
+          5 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 3 6 -1.</_>
+        <_>
+          12 14 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 2 1 -1.</_>
+        <_>
+          13 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 1 2 -1.</_>
+        <_>
+          16 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 3 4 -1.</_>
+        <_>
+          18 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 2 3 -1.</_>
+        <_>
+          9 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 4 -1.</_>
+        <_>
+          6 7 1 2 2.</_>
+        <_>
+          7 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 12 2 -1.</_>
+        <_>
+          7 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 3 -1.</_>
+        <_>
+          5 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 2 1 -1.</_>
+        <_>
+          2 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 5 -1.</_>
+        <_>
+          5 4 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 14 2 -1.</_>
+        <_>
+          13 7 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 17 2 3 -1.</_>
+        <_>
+          14 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 3 -1.</_>
+        <_>
+          6 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 16 -1.</_>
+        <_>
+          11 11 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 5 3 -1.</_>
+        <_>
+          9 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 3 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 8 4 -1.</_>
+        <_>
+          3 8 4 2 2.</_>
+        <_>
+          7 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 2 3 -1.</_>
+        <_>
+          10 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 1 6 -1.</_>
+        <_>
+          14 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 1 3 -1.</_>
+        <_>
+          13 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 6 -1.</_>
+        <_>
+          8 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 3 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 5 -1.</_>
+        <_>
+          9 2 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 3 3 -1.</_>
+        <_>
+          13 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 14 -1.</_>
+        <_>
+          12 7 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 7 10 -1.</_>
+        <_>
+          2 7 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 6 11 -1.</_>
+        <_>
+          8 5 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 3 3 -1.</_>
+        <_>
+          6 18 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 8 -1.</_>
+        <_>
+          9 5 1 4 2.</_>
+        <_>
+          10 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 16 -1.</_>
+        <_>
+          14 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 1 3 -1.</_>
+        <_>
+          10 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 3 2 -1.</_>
+        <_>
+          8 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 1 3 -1.</_>
+        <_>
+          10 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 14 6 -1.</_>
+        <_>
+          5 14 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 1 3 -1.</_>
+        <_>
+          9 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 5 4 -1.</_>
+        <_>
+          6 13 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 8 -1.</_>
+        <_>
+          6 9 5 4 2.</_>
+        <_>
+          11 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 6 -1.</_>
+        <_>
+          18 9 1 3 2.</_>
+        <_>
+          19 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 2 -1.</_>
+        <_>
+          9 12 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 12 -1.</_>
+        <_>
+          8 8 3 6 2.</_>
+        <_>
+          11 14 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 5 -1.</_>
+        <_>
+          13 7 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 4 3 -1.</_>
+        <_>
+          10 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 15 -1.</_>
+        <_>
+          13 4 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 4 2 -1.</_>
+        <_>
+          6 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 1 -1.</_>
+        <_>
+          16 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 8 -1.</_>
+        <_>
+          16 3 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 6 4 -1.</_>
+        <_>
+          13 16 3 2 2.</_>
+        <_>
+          16 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 7 -1.</_>
+        <_>
+          12 5 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 2 -1.</_>
+        <_>
+          18 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 4 -1.</_>
+        <_>
+          11 0 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 2 2 -1.</_>
+        <_>
+          1 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 6 -1.</_>
+        <_>
+          5 12 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 2 -1.</_>
+        <_>
+          5 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 11 2 -1.</_>
+        <_>
+          4 15 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 8 3 -1.</_>
+        <_>
+          4 14 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 10 -1.</_>
+        <_>
+          3 7 3 5 2.</_>
+        <_>
+          6 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 4 -1.</_>
+        <_>
+          7 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 10 6 -1.</_>
+        <_>
+          2 14 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 12 -1.</_>
+        <_>
+          5 13 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 7 4 -1.</_>
+        <_>
+          9 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 4 -1.</_>
+        <_>
+          2 0 4 2 2.</_>
+        <_>
+          6 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 4 -1.</_>
+        <_>
+          4 0 2 2 2.</_>
+        <_>
+          6 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 2 -1.</_>
+        <_>
+          7 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 3 4 -1.</_>
+        <_>
+          3 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 2 1 -1.</_>
+        <_>
+          2 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 3 -1.</_>
+        <_>
+          15 13 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 7 3 -1.</_>
+        <_>
+          9 16 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 2 -1.</_>
+        <_>
+          7 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 10 -1.</_>
+        <_>
+          3 5 6 5 2.</_>
+        <_>
+          9 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 5 -1.</_>
+        <_>
+          10 2 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 1 -1.</_>
+        <_>
+          10 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 4 -1.</_>
+        <_>
+          3 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 10 -1.</_>
+        <_>
+          11 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 7 8 -1.</_>
+        <_>
+          8 10 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 8 4 -1.</_>
+        <_>
+          6 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 2 -1.</_>
+        <_>
+          1 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 4 2 -1.</_>
+        <_>
+          15 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 5 -1.</_>
+        <_>
+          12 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 9 1 -1.</_>
+        <_>
+          14 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 4 -1.</_>
+        <_>
+          15 10 1 2 2.</_>
+        <_>
+          16 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 3 -1.</_>
+        <_>
+          18 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 7 3 -1.</_>
+        <_>
+          4 11 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 1 -1.</_>
+        <_>
+          9 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 3 -1.</_>
+        <_>
+          7 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 3 -1.</_>
+        <_>
+          7 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 3 -1.</_>
+        <_>
+          7 16 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 1 3 -1.</_>
+        <_>
+          14 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 10 6 -1.</_>
+        <_>
+          2 17 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 5 3 -1.</_>
+        <_>
+          5 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 6 -1.</_>
+        <_>
+          7 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 5 6 -1.</_>
+        <_>
+          0 8 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 4 -1.</_>
+        <_>
+          6 12 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 9 2 -1.</_>
+        <_>
+          4 10 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 1 2 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 4 4 -1.</_>
+        <_>
+          8 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 1 -1.</_>
+        <_>
+          12 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          5 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 12 -1.</_>
+        <_>
+          14 1 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 9 -1.</_>
+        <_>
+          6 10 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          11 7 4 3 2.</_>
+        <_>
+          15 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 7 3 -1.</_>
+        <_>
+          8 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 18 -1.</_>
+        <_>
+          5 2 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 6 -1.</_>
+        <_>
+          6 11 4 3 2.</_>
+        <_>
+          10 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 4 7 -1.</_>
+        <_>
+          7 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 5 -1.</_>
+        <_>
+          8 8 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 1 3 -1.</_>
+        <_>
+          7 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 2 -1.</_>
+        <_>
+          10 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 1 -1.</_>
+        <_>
+          12 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 2 -1.</_>
+        <_>
+          6 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 2 12 -1.</_>
+        <_>
+          11 2 1 6 2.</_>
+        <_>
+          12 8 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 6 -1.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 2 -1.</_>
+        <_>
+          4 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 1 2 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 4 -1.</_>
+        <_>
+          4 0 1 2 2.</_>
+        <_>
+          5 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 2 1 -1.</_>
+        <_>
+          16 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 3 1 -1.</_>
+        <_>
+          4 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 10 4 -1.</_>
+        <_>
+          5 11 5 2 2.</_>
+        <_>
+          10 13 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 3 -1.</_>
+        <_>
+          4 11 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 4 6 -1.</_>
+        <_>
+          15 2 2 3 2.</_>
+        <_>
+          17 5 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 1 4 -1.</_>
+        <_>
+          5 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 19 2 1 -1.</_>
+        <_>
+          12 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 2 -1.</_>
+        <_>
+          7 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 1 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 2 -1.</_>
+        <_>
+          7 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          6 8 1 1 2.</_>
+        <_>
+          7 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 4 -1.</_>
+        <_>
+          4 8 1 2 2.</_>
+        <_>
+          5 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 7 3 -1.</_>
+        <_>
+          10 5 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 6 -1.</_>
+        <_>
+          5 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 3 -1.</_>
+        <_>
+          10 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 3 -1.</_>
+        <_>
+          9 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 3 2 -1.</_>
+        <_>
+          10 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 2 -1.</_>
+        <_>
+          10 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 3 1 -1.</_>
+        <_>
+          18 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 16 -1.</_>
+        <_>
+          9 8 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 6 -1.</_>
+        <_>
+          17 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 10 9 -1.</_>
+        <_>
+          4 13 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 5 -1.</_>
+        <_>
+          4 3 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 2 6 -1.</_>
+        <_>
+          6 3 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 6 -1.</_>
+        <_>
+          5 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 4 -1.</_>
+        <_>
+          8 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 3 -1.</_>
+        <_>
+          8 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 3 6 -1.</_>
+        <_>
+          9 8 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 12 12 -1.</_>
+        <_>
+          4 3 6 6 2.</_>
+        <_>
+          10 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 2 -1.</_>
+        <_>
+          13 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 2 -1.</_>
+        <_>
+          9 3 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 2 -1.</_>
+        <_>
+          18 14 1 1 2.</_>
+        <_>
+          19 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 2 -1.</_>
+        <_>
+          8 6 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 20 5 -1.</_>
+        <_>
+          10 14 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 2 1 -1.</_>
+        <_>
+          10 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 5 3 -1.</_>
+        <_>
+          5 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 2 -1.</_>
+        <_>
+          10 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 5 3 -1.</_>
+        <_>
+          6 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 8 -1.</_>
+        <_>
+          12 12 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 9 -1.</_>
+        <_>
+          4 6 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 3 -1.</_>
+        <_>
+          12 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 10 2 -1.</_>
+        <_>
+          5 17 5 1 2.</_>
+        <_>
+          10 18 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 2 3 -1.</_>
+        <_>
+          5 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 4 -1.</_>
+        <_>
+          6 14 1 2 2.</_>
+        <_>
+          7 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 3 -1.</_>
+        <_>
+          10 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 3 -1.</_>
+        <_>
+          19 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 2 2 -1.</_>
+        <_>
+          16 13 1 1 2.</_>
+        <_>
+          17 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 1 -1.</_>
+        <_>
+          1 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          4 12 3 3 2.</_>
+        <_>
+          7 15 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 4 3 -1.</_>
+        <_>
+          5 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 3 2 -1.</_>
+        <_>
+          11 16 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 2 -1.</_>
+        <_>
+          1 0 5 1 2.</_>
+        <_>
+          6 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 14 -1.</_>
+        <_>
+          11 0 9 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 7 -1.</_>
+        <_>
+          17 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 4 -1.</_>
+        <_>
+          6 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 3 1 -1.</_>
+        <_>
+          16 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 5 3 -1.</_>
+        <_>
+          7 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 6 3 -1.</_>
+        <_>
+          14 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 2 1 -1.</_>
+        <_>
+          17 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 2 -1.</_>
+        <_>
+          17 0 1 1 2.</_>
+        <_>
+          18 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 6 -1.</_>
+        <_>
+          1 2 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 18 -1.</_>
+        <_>
+          3 7 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 1 12 -1.</_>
+        <_>
+          5 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 2 -1.</_>
+        <_>
+          16 9 1 1 2.</_>
+        <_>
+          17 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 11 -1.</_>
+        <_>
+          5 2 1 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 2 2 -1.</_>
+        <_>
+          14 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 10 -1.</_>
+        <_>
+          10 0 5 5 2.</_>
+        <_>
+          15 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 2 -1.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 8 -1.</_>
+        <_>
+          11 0 3 4 2.</_>
+        <_>
+          14 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 2 -1.</_>
+        <_>
+          5 0 1 1 2.</_>
+        <_>
+          6 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 9 11 -1.</_>
+        <_>
+          6 1 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 2 -1.</_>
+        <_>
+          10 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 4 2 -1.</_>
+        <_>
+          12 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 1 6 -1.</_>
+        <_>
+          13 9 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 2 -1.</_>
+        <_>
+          8 10 3 1 2.</_>
+        <_>
+          11 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 6 -1.</_>
+        <_>
+          4 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 3 -1.</_>
+        <_>
+          17 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 14 -1.</_>
+        <_>
+          10 2 4 7 2.</_>
+        <_>
+          14 9 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 8 7 -1.</_>
+        <_>
+          16 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 18 1 -1.</_>
+        <_>
+          7 2 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 19 -1.</_>
+        <_>
+          4 1 4 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 12 -1.</_>
+        <_>
+          4 0 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 5 12 -1.</_>
+        <_>
+          13 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 1 4 -1.</_>
+        <_>
+          7 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 3 -1.</_>
+        <_>
+          5 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 12 4 -1.</_>
+        <_>
+          6 7 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 2 6 -1.</_>
+        <_>
+          9 1 1 3 2.</_>
+        <_>
+          10 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 3 -1.</_>
+        <_>
+          7 8 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 1 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 2 -1.</_>
+        <_>
+          5 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 4 1 -1.</_>
+        <_>
+          2 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 1 -1.</_>
+        <_>
+          2 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 3 -1.</_>
+        <_>
+          7 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 2 -1.</_>
+        <_>
+          10 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 2 -1.</_>
+        <_>
+          17 10 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 1 -1.</_>
+        <_>
+          8 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 5 3 -1.</_>
+        <_>
+          14 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 2 3 -1.</_>
+        <_>
+          8 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 7 -1.</_>
+        <_>
+          8 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 6 -1.</_>
+        <_>
+          4 2 1 3 2.</_>
+        <_>
+          5 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 3 -1.</_>
+        <_>
+          4 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 7 12 -1.</_>
+        <_>
+          8 10 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 10 -1.</_>
+        <_>
+          8 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 5 -1.</_>
+        <_>
+          5 3 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 1 -1.</_>
+        <_>
+          10 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 4 -1.</_>
+        <_>
+          4 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 3 3 -1.</_>
+        <_>
+          13 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 2 3 -1.</_>
+        <_>
+          2 14 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 4 -1.</_>
+        <_>
+          5 0 1 2 2.</_>
+        <_>
+          6 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 4 3 -1.</_>
+        <_>
+          5 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 6 -1.</_>
+        <_>
+          6 12 1 3 2.</_>
+        <_>
+          7 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 2 -1.</_>
+        <_>
+          7 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 5 -1.</_>
+        <_>
+          11 10 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 2 1 -1.</_>
+        <_>
+          12 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 2 -1.</_>
+        <_>
+          6 7 1 1 2.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 5 -1.</_>
+        <_>
+          7 3 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 8 -1.</_>
+        <_>
+          7 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 3 -1.</_>
+        <_>
+          7 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 4 -1.</_>
+        <_>
+          10 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 3 3 -1.</_>
+        <_>
+          13 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 2 -1.</_>
+        <_>
+          7 13 2 1 2.</_>
+        <_>
+          9 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 1 2 -1.</_>
+        <_>
+          10 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 3 -1.</_>
+        <_>
+          9 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 3 -1.</_>
+        <_>
+          9 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 8 1 -1.</_>
+        <_>
+          13 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 2 -1.</_>
+        <_>
+          6 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 3 -1.</_>
+        <_>
+          6 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 6 -1.</_>
+        <_>
+          12 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 2 -1.</_>
+        <_>
+          7 0 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 6 -1.</_>
+        <_>
+          9 7 2 3 2.</_>
+        <_>
+          11 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 4 -1.</_>
+        <_>
+          13 10 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 2 -1.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 2 2 -1.</_>
+        <_>
+          14 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 2 1 -1.</_>
+        <_>
+          16 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 3 -1.</_>
+        <_>
+          7 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 3 -1.</_>
+        <_>
+          9 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 3 -1.</_>
+        <_>
+          9 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 6 -1.</_>
+        <_>
+          13 14 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 8 -1.</_>
+        <_>
+          18 9 1 4 2.</_>
+        <_>
+          19 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 7 3 -1.</_>
+        <_>
+          5 6 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 2 -1.</_>
+        <_>
+          10 13 1 1 2.</_>
+        <_>
+          11 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 2 -1.</_>
+        <_>
+          9 13 2 1 2.</_>
+        <_>
+          11 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 6 -1.</_>
+        <_>
+          7 12 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 4 -1.</_>
+        <_>
+          13 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 18 -1.</_>
+        <_>
+          8 9 12 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 2 10 -1.</_>
+        <_>
+          18 9 1 5 2.</_>
+        <_>
+          19 14 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 6 -1.</_>
+        <_>
+          14 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 14 -1.</_>
+        <_>
+          11 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 8 4 -1.</_>
+        <_>
+          6 16 4 2 2.</_>
+        <_>
+          10 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 5 12 -1.</_>
+        <_>
+          5 7 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 6 3 -1.</_>
+        <_>
+          4 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 1 3 -1.</_>
+        <_>
+          6 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 1 -1.</_>
+        <_>
+          14 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 9 -1.</_>
+        <_>
+          11 2 9 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 2 4 -1.</_>
+        <_>
+          4 16 1 2 2.</_>
+        <_>
+          5 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 8 -1.</_>
+        <_>
+          16 1 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 3 -1.</_>
+        <_>
+          11 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 4 -1.</_>
+        <_>
+          9 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_>
+        <_>
+          9 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 3 -1.</_>
+        <_>
+          9 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 3 -1.</_>
+        <_>
+          7 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 4 3 -1.</_>
+        <_>
+          11 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 3 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 3 -1.</_>
+        <_>
+          8 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_>
+        <_>
+          8 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 9 1 -1.</_>
+        <_>
+          7 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 6 -1.</_>
+        <_>
+          5 7 1 3 2.</_>
+        <_>
+          6 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 8 -1.</_>
+        <_>
+          4 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 19 -1.</_>
+        <_>
+          8 0 1 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 3 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 1 -1.</_>
+        <_>
+          10 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 6 -1.</_>
+        <_>
+          16 6 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 5 3 -1.</_>
+        <_>
+          10 16 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 5 14 -1.</_>
+        <_>
+          13 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 4 -1.</_>
+        <_>
+          3 0 2 2 2.</_>
+        <_>
+          5 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 13 -1.</_>
+        <_>
+          8 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 16 -1.</_>
+        <_>
+          4 2 1 8 2.</_>
+        <_>
+          5 10 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 3 -1.</_>
+        <_>
+          8 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 2 12 -1.</_>
+        <_>
+          5 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 4 -1.</_>
+        <_>
+          9 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 5 4 -1.</_>
+        <_>
+          13 11 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          12 0 4 1 2.</_>
+        <_>
+          16 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 4 -1.</_>
+        <_>
+          14 0 3 2 2.</_>
+        <_>
+          17 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 6 2 -1.</_>
+        <_>
+          6 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 1 -1.</_>
+        <_>
+          14 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 3 -1.</_>
+        <_>
+          6 0 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          6 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 3 -1.</_>
+        <_>
+          5 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 2 4 -1.</_>
+        <_>
+          5 13 1 2 2.</_>
+        <_>
+          6 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 3 3 -1.</_>
+        <_>
+          4 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 2 -1.</_>
+        <_>
+          1 9 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 12 -1.</_>
+        <_>
+          6 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 4 -1.</_>
+        <_>
+          7 14 3 2 2.</_>
+        <_>
+          10 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 8 4 -1.</_>
+        <_>
+          8 16 4 2 2.</_>
+        <_>
+          12 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 10 6 -1.</_>
+        <_>
+          5 12 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 1 3 -1.</_>
+        <_>
+          6 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 6 -1.</_>
+        <_>
+          3 13 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 3 -1.</_>
+        <_>
+          10 15 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 4 2 -1.</_>
+        <_>
+          5 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 3 -1.</_>
+        <_>
+          5 14 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 1 2 -1.</_>
+        <_>
+          1 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 4 -1.</_>
+        <_>
+          4 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 1 2 -1.</_>
+        <_>
+          1 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 1 3 -1.</_>
+        <_>
+          5 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 19 2 1 -1.</_>
+        <_>
+          11 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 4 4 -1.</_>
+        <_>
+          6 6 2 2 2.</_>
+        <_>
+          8 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 2 -1.</_>
+        <_>
+          6 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 2 -1.</_>
+        <_>
+          5 4 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 1 -1.</_>
+        <_>
+          5 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 1 -1.</_>
+        <_>
+          1 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 11 -1.</_>
+        <_>
+          3 4 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 1 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 1 6 -1.</_>
+        <_>
+          7 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 4 -1.</_>
+        <_>
+          7 2 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 2 -1.</_>
+        <_>
+          13 7 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 2 -1.</_>
+        <_>
+          16 15 1 1 2.</_>
+        <_>
+          17 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 1 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 5 2 -1.</_>
+        <_>
+          4 5 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 9 -1.</_>
+        <_>
+          4 6 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          7 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 1 -1.</_>
+        <_>
+          7 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 5 -1.</_>
+        <_>
+          9 8 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 1 3 -1.</_>
+        <_>
+          9 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 1 -1.</_>
+        <_>
+          12 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 7 6 -1.</_>
+        <_>
+          13 9 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 18 -1.</_>
+        <_>
+          10 2 10 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 3 -1.</_>
+        <_>
+          12 6 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 3 2 -1.</_>
+        <_>
+          8 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 11 6 -1.</_>
+        <_>
+          4 11 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 7 6 -1.</_>
+        <_>
+          7 10 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 8 -1.</_>
+        <_>
+          15 7 1 4 2.</_>
+        <_>
+          16 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 6 -1.</_>
+        <_>
+          4 12 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 2 -1.</_>
+        <_>
+          7 13 1 1 2.</_>
+        <_>
+          8 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 4 -1.</_>
+        <_>
+          8 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 3 -1.</_>
+        <_>
+          8 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 8 -1.</_>
+        <_>
+          15 6 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 6 -1.</_>
+        <_>
+          4 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 10 3 -1.</_>
+        <_>
+          0 18 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 7 2 -1.</_>
+        <_>
+          5 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 1 3 -1.</_>
+        <_>
+          13 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 16 -1.</_>
+        <_>
+          9 2 2 8 2.</_>
+        <_>
+          11 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          6 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 4 -1.</_>
+        <_>
+          9 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 3 -1.</_>
+        <_>
+          18 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          16 10 1 1 2.</_>
+        <_>
+          17 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 6 -1.</_>
+        <_>
+          14 4 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 10 2 1 -1.</_>
+        <_>
+          18 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 4 -1.</_>
+        <_>
+          17 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 6 3 -1.</_>
+        <_>
+          11 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 4 -1.</_>
+        <_>
+          4 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 5 -1.</_>
+        <_>
+          4 5 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 1 -1.</_>
+        <_>
+          5 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 2 -1.</_>
+        <_>
+          14 0 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 1 2 -1.</_>
+        <_>
+          9 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 5 6 -1.</_>
+        <_>
+          15 14 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 10 4 -1.</_>
+        <_>
+          4 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 6 4 -1.</_>
+        <_>
+          7 16 3 2 2.</_>
+        <_>
+          10 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 7 3 -1.</_>
+        <_>
+          9 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 2 -1.</_>
+        <_>
+          4 8 1 1 2.</_>
+        <_>
+          5 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 20 2 -1.</_>
+        <_>
+          10 17 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 6 -1.</_>
+        <_>
+          4 7 1 3 2.</_>
+        <_>
+          5 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 1 2 -1.</_>
+        <_>
+          11 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 5 2 -1.</_>
+        <_>
+          10 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 3 3 -1.</_>
+        <_>
+          8 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 1 -1.</_>
+        <_>
+          10 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 11 12 -1.</_>
+        <_>
+          8 10 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 12 -1.</_>
+        <_>
+          2 10 13 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 4 -1.</_>
+        <_>
+          0 15 5 2 2.</_>
+        <_>
+          5 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 2 -1.</_>
+        <_>
+          7 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 2 -1.</_>
+        <_>
+          12 1 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 7 -1.</_>
+        <_>
+          9 8 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 2 -1.</_>
+        <_>
+          11 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 15 4 -1.</_>
+        <_>
+          8 14 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 2 14 -1.</_>
+        <_>
+          7 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 2 -1.</_>
+        <_>
+          11 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 1 3 -1.</_>
+        <_>
+          5 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 3 3 -1.</_>
+        <_>
+          11 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 4 -1.</_>
+        <_>
+          13 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 5 -1.</_>
+        <_>
+          14 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 2 -1.</_>
+        <_>
+          8 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 1 10 -1.</_>
+        <_>
+          16 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 10 4 -1.</_>
+        <_>
+          6 13 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 2 -1.</_>
+        <_>
+          6 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 11 -1.</_>
+        <_>
+          4 6 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 3 2 -1.</_>
+        <_>
+          6 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 1 2 -1.</_>
+        <_>
+          10 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 1 -1.</_>
+        <_>
+          14 0 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 2 2 -1.</_>
+        <_>
+          6 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 5 -1.</_>
+        <_>
+          14 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          6 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 3 -1.</_>
+        <_>
+          11 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 2 -1.</_>
+        <_>
+          6 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 16 8 -1.</_>
+        <_>
+          12 2 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 2 -1.</_>
+        <_>
+          10 12 1 1 2.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 2 -1.</_>
+        <_>
+          11 7 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 1 3 -1.</_>
+        <_>
+          13 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 3 -1.</_>
+        <_>
+          13 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 4 -1.</_>
+        <_>
+          4 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 1 -1.</_>
+        <_>
+          11 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 10 -1.</_>
+        <_>
+          10 6 1 5 2.</_>
+        <_>
+          11 11 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 3 1 -1.</_>
+        <_>
+          17 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 7 12 -1.</_>
+        <_>
+          9 9 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 10 18 -1.</_>
+        <_>
+          4 1 5 9 2.</_>
+        <_>
+          9 10 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 2 2 -1.</_>
+        <_>
+          17 12 1 1 2.</_>
+        <_>
+          18 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 2 -1.</_>
+        <_>
+          12 6 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 5 2 -1.</_>
+        <_>
+          4 8 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 1 2 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 7 6 -1.</_>
+        <_>
+          6 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 2 8 -1.</_>
+        <_>
+          13 11 1 4 2.</_>
+        <_>
+          14 15 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 2 -1.</_>
+        <_>
+          10 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 4 -1.</_>
+        <_>
+          4 1 1 2 2.</_>
+        <_>
+          5 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 8 -1.</_>
+        <_>
+          4 0 1 4 2.</_>
+        <_>
+          5 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 2 1 -1.</_>
+        <_>
+          7 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 1 3 -1.</_>
+        <_>
+          14 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 2 -1.</_>
+        <_>
+          5 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 15 -1.</_>
+        <_>
+          5 6 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 14 -1.</_>
+        <_>
+          11 5 2 7 2.</_>
+        <_>
+          13 12 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 3 1 -1.</_>
+        <_>
+          10 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 5 6 -1.</_>
+        <_>
+          4 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 3 3 -1.</_>
+        <_>
+          5 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 5 -1.</_>
+        <_>
+          9 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 2 -1.</_>
+        <_>
+          5 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 3 3 -1.</_>
+        <_>
+          7 14 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 3 -1.</_>
+        <_>
+          7 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 2 9 -1.</_>
+        <_>
+          4 6 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 2 -1.</_>
+        <_>
+          4 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 2 2 -1.</_>
+        <_>
+          10 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 6 -1.</_>
+        <_>
+          7 8 6 3 2.</_>
+        <_>
+          13 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 3 2 -1.</_>
+        <_>
+          14 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 6 2 -1.</_>
+        <_>
+          5 17 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 4 3 -1.</_>
+        <_>
+          8 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 2 -1.</_>
+        <_>
+          14 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 3 -1.</_>
+        <_>
+          8 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 17 9 -1.</_>
+        <_>
+          1 10 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 8 -1.</_>
+        <_>
+          5 14 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 2 -1.</_>
+        <_>
+          18 1 1 1 2.</_>
+        <_>
+          19 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 11 6 -1.</_>
+        <_>
+          0 3 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 3 -1.</_>
+        <_>
+          3 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 10 3 -1.</_>
+        <_>
+          10 11 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 15 18 -1.</_>
+        <_>
+          0 9 15 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 2 2 -1.</_>
+        <_>
+          15 11 1 1 2.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 3 -1.</_>
+        <_>
+          17 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 4 -1.</_>
+        <_>
+          9 4 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 4 -1.</_>
+        <_>
+          12 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 2 -1.</_>
+        <_>
+          9 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 1 2 -1.</_>
+        <_>
+          6 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 8 -1.</_>
+        <_>
+          4 7 1 4 2.</_>
+        <_>
+          5 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 3 2 -1.</_>
+        <_>
+          10 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 1 3 -1.</_>
+        <_>
+          9 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 1 6 -1.</_>
+        <_>
+          6 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 13 6 -1.</_>
+        <_>
+          5 8 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 12 -1.</_>
+        <_>
+          8 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 4 -1.</_>
+        <_>
+          7 12 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 4 3 -1.</_>
+        <_>
+          5 15 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 1 -1.</_>
+        <_>
+          11 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 4 3 -1.</_>
+        <_>
+          4 16 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 2 -1.</_>
+        <_>
+          12 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 8 2 -1.</_>
+        <_>
+          15 10 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 6 2 -1.</_>
+        <_>
+          17 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 2 -1.</_>
+        <_>
+          8 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 1 -1.</_>
+        <_>
+          12 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 6 -1.</_>
+        <_>
+          12 8 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 1 2 -1.</_>
+        <_>
+          11 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 3 9 -1.</_>
+        <_>
+          13 9 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 3 -1.</_>
+        <_>
+          0 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 1 3 -1.</_>
+        <_>
+          0 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 2 2 -1.</_>
+        <_>
+          3 8 1 1 2.</_>
+        <_>
+          4 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 6 -1.</_>
+        <_>
+          4 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 9 -1.</_>
+        <_>
+          4 12 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 2 -1.</_>
+        <_>
+          7 13 1 1 2.</_>
+        <_>
+          8 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 10 6 -1.</_>
+        <_>
+          3 6 5 3 2.</_>
+        <_>
+          8 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 4 6 -1.</_>
+        <_>
+          11 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 14 3 -1.</_>
+        <_>
+          9 12 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 11 18 -1.</_>
+        <_>
+          0 9 11 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 4 2 -1.</_>
+        <_>
+          4 18 2 1 2.</_>
+        <_>
+          6 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 4 6 -1.</_>
+        <_>
+          7 13 2 3 2.</_>
+        <_>
+          9 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 1 -1.</_>
+        <_>
+          9 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 8 6 -1.</_>
+        <_>
+          5 14 4 3 2.</_>
+        <_>
+          9 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 3 -1.</_>
+        <_>
+          7 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 4 2 -1.</_>
+        <_>
+          14 4 2 1 2.</_>
+        <_>
+          16 5 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 3 -1.</_>
+        <_>
+          7 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 4 2 -1.</_>
+        <_>
+          7 14 2 1 2.</_>
+        <_>
+          9 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 6 -1.</_>
+        <_>
+          10 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 1 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 18 7 -1.</_>
+        <_>
+          11 5 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 1 2 -1.</_>
+        <_>
+          18 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 6 -1.</_>
+        <_>
+          4 17 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 20 -1.</_>
+        <_>
+          10 0 2 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 18 -1.</_>
+        <_>
+          12 9 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 2 1 -1.</_>
+        <_>
+          13 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 13 -1.</_>
+        <_>
+          3 6 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 3 4 -1.</_>
+        <_>
+          4 15 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 6 -1.</_>
+        <_>
+          4 13 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 9 2 -1.</_>
+        <_>
+          6 11 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 6 8 -1.</_>
+        <_>
+          3 11 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 7 -1.</_>
+        <_>
+          17 0 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 2 6 -1.</_>
+        <_>
+          16 1 1 3 2.</_>
+        <_>
+          17 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 6 10 -1.</_>
+        <_>
+          3 7 3 5 2.</_>
+        <_>
+          6 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 7 -1.</_>
+        <_>
+          5 0 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 2 -1.</_>
+        <_>
+          5 2 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 1 2 -1.</_>
+        <_>
+          6 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 6 -1.</_>
+        <_>
+          4 14 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 9 3 -1.</_>
+        <_>
+          6 11 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 2 -1.</_>
+        <_>
+          4 14 1 1 2.</_>
+        <_>
+          5 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 2 -1.</_>
+        <_>
+          12 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 6 -1.</_>
+        <_>
+          18 5 1 3 2.</_>
+        <_>
+          19 8 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 1 2 -1.</_>
+        <_>
+          0 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 1 -1.</_>
+        <_>
+          11 4 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 3 -1.</_>
+        <_>
+          5 5 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 6 4 -1.</_>
+        <_>
+          3 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 6 1 -1.</_>
+        <_>
+          14 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 3 3 -1.</_>
+        <_>
+          6 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 2 2 -1.</_>
+        <_>
+          4 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 3 -1.</_>
+        <_>
+          8 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 10 14 -1.</_>
+        <_>
+          5 5 5 7 2.</_>
+        <_>
+          10 12 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 2 6 -1.</_>
+        <_>
+          16 7 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 3 -1.</_>
+        <_>
+          19 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 2 2 -1.</_>
+        <_>
+          3 6 1 1 2.</_>
+        <_>
+          4 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 10 -1.</_>
+        <_>
+          5 1 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 1 -1.</_>
+        <_>
+          7 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 1 -1.</_>
+        <_>
+          16 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 1 3 -1.</_>
+        <_>
+          6 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 4 -1.</_>
+        <_>
+          6 14 1 2 2.</_>
+        <_>
+          7 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 5 -1.</_>
+        <_>
+          1 7 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 8 -1.</_>
+        <_>
+          18 0 1 4 2.</_>
+        <_>
+          19 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 2 -1.</_>
+        <_>
+          8 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 8 3 -1.</_>
+        <_>
+          8 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 2 2 -1.</_>
+        <_>
+          8 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 11 -1.</_>
+        <_>
+          15 8 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 9 5 -1.</_>
+        <_>
+          14 15 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 15 -1.</_>
+        <_>
+          9 4 4 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 8 -1.</_>
+        <_>
+          16 12 1 4 2.</_>
+        <_>
+          17 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 10 6 -1.</_>
+        <_>
+          7 16 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 4 -1.</_>
+        <_>
+          6 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 8 2 -1.</_>
+        <_>
+          13 5 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 4 -1.</_>
+        <_>
+          6 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 7 6 -1.</_>
+        <_>
+          10 10 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 1 4 -1.</_>
+        <_>
+          12 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 4 -1.</_>
+        <_>
+          3 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 6 -1.</_>
+        <_>
+          8 7 3 3 2.</_>
+        <_>
+          11 10 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 2 -1.</_>
+        <_>
+          7 0 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 1 3 -1.</_>
+        <_>
+          13 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 3 4 -1.</_>
+        <_>
+          3 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 2 -1.</_>
+        <_>
+          6 5 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 2 3 -1.</_>
+        <_>
+          11 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 3 -1.</_>
+        <_>
+          7 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 4 -1.</_>
+        <_>
+          6 12 1 2 2.</_>
+        <_>
+          7 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 1 -1.</_>
+        <_>
+          12 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 4 -1.</_>
+        <_>
+          7 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 3 3 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 12 3 -1.</_>
+        <_>
+          14 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 2 -1.</_>
+        <_>
+          12 10 2 1 2.</_>
+        <_>
+          14 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 1 2 -1.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 1 2 -1.</_>
+        <_>
+          6 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 3 -1.</_>
+        <_>
+          5 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 3 -1.</_>
+        <_>
+          5 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          12 0 4 1 2.</_>
+        <_>
+          16 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 8 -1.</_>
+        <_>
+          11 11 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 6 -1.</_>
+        <_>
+          5 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 6 6 -1.</_>
+        <_>
+          6 2 3 3 2.</_>
+        <_>
+          9 5 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 1 6 -1.</_>
+        <_>
+          11 6 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 16 -1.</_>
+        <_>
+          18 3 1 8 2.</_>
+        <_>
+          19 11 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 2 -1.</_>
+        <_>
+          11 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 3 -1.</_>
+        <_>
+          7 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 1 -1.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 2 -1.</_>
+        <_>
+          15 7 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 3 -1.</_>
+        <_>
+          4 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 19 6 1 -1.</_>
+        <_>
+          11 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 1 3 -1.</_>
+        <_>
+          10 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 3 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 5 -1.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 1 2 -1.</_>
+        <_>
+          14 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 3 -1.</_>
+        <_>
+          13 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 1 -1.</_>
+        <_>
+          16 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 1 3 -1.</_>
+        <_>
+          9 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 2 8 -1.</_>
+        <_>
+          9 5 1 4 2.</_>
+        <_>
+          10 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 4 -1.</_>
+        <_>
+          6 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 2 -1.</_>
+        <_>
+          5 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 2 4 -1.</_>
+        <_>
+          12 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 6 -1.</_>
+        <_>
+          13 7 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 14 -1.</_>
+        <_>
+          5 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 1 2 -1.</_>
+        <_>
+          9 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 14 12 -1.</_>
+        <_>
+          6 5 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 7 6 -1.</_>
+        <_>
+          13 9 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 3 3 -1.</_>
+        <_>
+          14 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 3 1 -1.</_>
+        <_>
+          18 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 2 -1.</_>
+        <_>
+          9 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 1 -1.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 2 -1.</_>
+        <_>
+          5 8 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 2 1 -1.</_>
+        <_>
+          12 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 1 -1.</_>
+        <_>
+          12 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 1 3 -1.</_>
+        <_>
+          9 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 1 2 -1.</_>
+        <_>
+          12 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 3 -1.</_>
+        <_>
+          13 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 2 -1.</_>
+        <_>
+          6 10 1 1 2.</_>
+        <_>
+          7 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 1 9 -1.</_>
+        <_>
+          17 5 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 6 -1.</_>
+        <_>
+          4 7 1 3 2.</_>
+        <_>
+          5 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 11 18 -1.</_>
+        <_>
+          0 10 11 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 8 -1.</_>
+        <_>
+          7 10 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 4 -1.</_>
+        <_>
+          2 14 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 1 -1.</_>
+        <_>
+          12 0 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 2 -1.</_>
+        <_>
+          5 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 1 -1.</_>
+        <_>
+          11 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 3 3 -1.</_>
+        <_>
+          7 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 5 3 -1.</_>
+        <_>
+          4 14 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 6 2 -1.</_>
+        <_>
+          9 17 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 5 3 -1.</_>
+        <_>
+          11 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 15 -1.</_>
+        <_>
+          6 0 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 8 4 -1.</_>
+        <_>
+          9 18 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 2 -1.</_>
+        <_>
+          0 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 4 2 -1.</_>
+        <_>
+          9 11 2 1 2.</_>
+        <_>
+          11 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 2 -1.</_>
+        <_>
+          4 13 1 1 2.</_>
+        <_>
+          5 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 1 2 -1.</_>
+        <_>
+          6 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 18 2 2 -1.</_>
+        <_>
+          14 18 1 1 2.</_>
+        <_>
+          15 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 5 6 -1.</_>
+        <_>
+          7 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 6 -1.</_>
+        <_>
+          8 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 6 2 -1.</_>
+        <_>
+          9 9 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 4 -1.</_>
+        <_>
+          6 6 3 2 2.</_>
+        <_>
+          9 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 1 6 -1.</_>
+        <_>
+          10 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 14 -1.</_>
+        <_>
+          5 2 6 7 2.</_>
+        <_>
+          11 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 2 -1.</_>
+        <_>
+          13 6 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          16 0 2 4 2.</_>
+        <_>
+          18 4 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 1 -1.</_>
+        <_>
+          4 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 4 -1.</_>
+        <_>
+          4 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 1 6 -1.</_>
+        <_>
+          4 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 15 1 -1.</_>
+        <_>
+          8 7 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 6 5 -1.</_>
+        <_>
+          4 15 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 8 4 -1.</_>
+        <_>
+          15 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 4 -1.</_>
+        <_>
+          16 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 2 -1.</_>
+        <_>
+          19 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 3 -1.</_>
+        <_>
+          7 15 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 10 -1.</_>
+        <_>
+          4 10 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 2 -1.</_>
+        <_>
+          18 17 1 1 2.</_>
+        <_>
+          19 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 4 -1.</_>
+        <_>
+          3 12 3 2 2.</_>
+        <_>
+          6 14 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          5 17 1 1 2.</_>
+        <_>
+          6 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 2 3 -1.</_>
+        <_>
+          7 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 1 3 -1.</_>
+        <_>
+          7 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 1 -1.</_>
+        <_>
+          1 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 9 6 -1.</_>
+        <_>
+          11 10 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 9 16 -1.</_>
+        <_>
+          12 4 3 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 5 3 -1.</_>
+        <_>
+          14 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 3 2 -1.</_>
+        <_>
+          9 18 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 11 16 -1.</_>
+        <_>
+          4 8 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 15 -1.</_>
+        <_>
+          2 9 12 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 11 4 -1.</_>
+        <_>
+          3 15 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 3 -1.</_>
+        <_>
+          7 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 3 -1.</_>
+        <_>
+          6 6 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 9 -1.</_>
+        <_>
+          5 3 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 2 2 -1.</_>
+        <_>
+          16 8 1 1 2.</_>
+        <_>
+          17 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 2 -1.</_>
+        <_>
+          12 10 4 1 2.</_>
+        <_>
+          16 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 8 -1.</_>
+        <_>
+          7 2 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 3 -1.</_>
+        <_>
+          7 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 1 3 -1.</_>
+        <_>
+          17 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 3 2 -1.</_>
+        <_>
+          16 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 3 -1.</_>
+        <_>
+          11 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 11 -1.</_>
+        <_>
+          16 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 8 -1.</_>
+        <_>
+          12 0 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 8 4 -1.</_>
+        <_>
+          7 15 4 2 2.</_>
+        <_>
+          11 17 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 16 6 -1.</_>
+        <_>
+          4 16 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 6 -1.</_>
+        <_>
+          6 12 1 3 2.</_>
+        <_>
+          7 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 4 -1.</_>
+        <_>
+          7 14 3 2 2.</_>
+        <_>
+          10 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 4 -1.</_>
+        <_>
+          0 0 1 2 2.</_>
+        <_>
+          1 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 1 3 -1.</_>
+        <_>
+          15 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 3 1 -1.</_>
+        <_>
+          8 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 1 2 -1.</_>
+        <_>
+          1 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 3 2 -1.</_>
+        <_>
+          4 14 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 3 5 -1.</_>
+        <_>
+          4 13 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 4 -1.</_>
+        <_>
+          8 2 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 4 -1.</_>
+        <_>
+          10 3 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 1 2 -1.</_>
+        <_>
+          9 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 2 -1.</_>
+        <_>
+          7 12 1 1 2.</_>
+        <_>
+          8 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 4 -1.</_>
+        <_>
+          4 11 2 2 2.</_>
+        <_>
+          6 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 4 -1.</_>
+        <_>
+          12 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 2 -1.</_>
+        <_>
+          9 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 6 -1.</_>
+        <_>
+          13 9 3 3 2.</_>
+        <_>
+          16 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 5 -1.</_>
+        <_>
+          15 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 4 -1.</_>
+        <_>
+          9 8 3 2 2.</_>
+        <_>
+          12 10 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 3 3 -1.</_>
+        <_>
+          11 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 2 1 -1.</_>
+        <_>
+          14 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 2 -1.</_>
+        <_>
+          4 5 1 1 2.</_>
+        <_>
+          5 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 2 -1.</_>
+        <_>
+          4 5 1 1 2.</_>
+        <_>
+          5 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 6 -1.</_>
+        <_>
+          7 11 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 3 -1.</_>
+        <_>
+          6 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 2 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 4 -1.</_>
+        <_>
+          14 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 11 3 -1.</_>
+        <_>
+          6 9 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 2 -1.</_>
+        <_>
+          13 11 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 6 -1.</_>
+        <_>
+          13 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 5 2 -1.</_>
+        <_>
+          3 15 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 2 -1.</_>
+        <_>
+          11 0 4 1 2.</_>
+        <_>
+          15 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 6 -1.</_>
+        <_>
+          13 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 1 -1.</_>
+        <_>
+          13 0 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 3 -1.</_>
+        <_>
+          8 2 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 3 -1.</_>
+        <_>
+          12 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 13 3 6 -1.</_>
+        <_>
+          17 15 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 3 -1.</_>
+        <_>
+          12 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 1 -1.</_>
+        <_>
+          16 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 11 -1.</_>
+        <_>
+          13 4 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 4 4 -1.</_>
+        <_>
+          13 9 2 2 2.</_>
+        <_>
+          15 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 1 6 -1.</_>
+        <_>
+          8 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 6 -1.</_>
+        <_>
+          5 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 4 8 -1.</_>
+        <_>
+          4 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 1 2 -1.</_>
+        <_>
+          11 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 7 10 -1.</_>
+        <_>
+          11 6 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 9 6 -1.</_>
+        <_>
+          7 13 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 8 1 -1.</_>
+        <_>
+          8 9 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 3 -1.</_>
+        <_>
+          11 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 6 -1.</_>
+        <_>
+          8 2 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 2 2 -1.</_>
+        <_>
+          11 13 1 1 2.</_>
+        <_>
+          12 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 9 -1.</_>
+        <_>
+          7 13 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 3 -1.</_>
+        <_>
+          5 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 6 -1.</_>
+        <_>
+          11 8 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 4 -1.</_>
+        <_>
+          13 7 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 6 -1.</_>
+        <_>
+          7 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 4 6 -1.</_>
+        <_>
+          10 6 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 1 -1.</_>
+        <_>
+          13 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 1 -1.</_>
+        <_>
+          6 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 18 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          5 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 3 -1.</_>
+        <_>
+          12 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 4 -1.</_>
+        <_>
+          16 0 2 2 2.</_>
+        <_>
+          18 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 8 10 -1.</_>
+        <_>
+          4 5 4 5 2.</_>
+        <_>
+          8 10 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 4 5 -1.</_>
+        <_>
+          5 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 6 2 -1.</_>
+        <_>
+          5 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 8 1 -1.</_>
+        <_>
+          12 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 15 6 -1.</_>
+        <_>
+          0 7 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 3 2 -1.</_>
+        <_>
+          9 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 6 -1.</_>
+        <_>
+          7 11 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          5 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 1 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 1 3 -1.</_>
+        <_>
+          17 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 4 -1.</_>
+        <_>
+          11 9 2 2 2.</_>
+        <_>
+          13 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 2 -1.</_>
+        <_>
+          10 15 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 8 -1.</_>
+        <_>
+          11 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 5 6 -1.</_>
+        <_>
+          11 10 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 2 6 -1.</_>
+        <_>
+          5 2 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 5 2 -1.</_>
+        <_>
+          6 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          10 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 7 3 -1.</_>
+        <_>
+          12 4 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 8 -1.</_>
+        <_>
+          8 1 6 4 2.</_>
+        <_>
+          14 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 20 -1.</_>
+        <_>
+          12 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 2 2 -1.</_>
+        <_>
+          17 1 1 1 2.</_>
+        <_>
+          18 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 7 6 -1.</_>
+        <_>
+          2 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 1 -1.</_>
+        <_>
+          8 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 11 3 -1.</_>
+        <_>
+          4 18 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 3 2 -1.</_>
+        <_>
+          8 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 13 -1.</_>
+        <_>
+          4 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 14 -1.</_>
+        <_>
+          5 2 6 7 2.</_>
+        <_>
+          11 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 6 -1.</_>
+        <_>
+          0 3 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 2 1 -1.</_>
+        <_>
+          6 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 13 -1.</_>
+        <_>
+          10 7 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 8 -1.</_>
+        <_>
+          7 2 1 4 2.</_>
+        <_>
+          8 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 4 -1.</_>
+        <_>
+          7 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 2 1 -1.</_>
+        <_>
+          8 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 2 -1.</_>
+        <_>
+          4 0 2 1 2.</_>
+        <_>
+          6 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 8 -1.</_>
+        <_>
+          3 14 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 5 10 -1.</_>
+        <_>
+          10 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 3 4 -1.</_>
+        <_>
+          13 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 3 -1.</_>
+        <_>
+          13 11 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 2 2 -1.</_>
+        <_>
+          16 12 1 1 2.</_>
+        <_>
+          17 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 2 1 -1.</_>
+        <_>
+          17 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 5 -1.</_>
+        <_>
+          6 1 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 8 6 -1.</_>
+        <_>
+          5 9 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 2 -1.</_>
+        <_>
+          6 10 4 1 2.</_>
+        <_>
+          10 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 8 -1.</_>
+        <_>
+          6 9 2 4 2.</_>
+        <_>
+          8 13 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 8 4 -1.</_>
+        <_>
+          4 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 6 -1.</_>
+        <_>
+          14 13 1 3 2.</_>
+        <_>
+          15 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 2 1 -1.</_>
+        <_>
+          13 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 1 -1.</_>
+        <_>
+          16 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 14 -1.</_>
+        <_>
+          0 7 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 3 -1.</_>
+        <_>
+          12 5 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 3 3 -1.</_>
+        <_>
+          5 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 8 -1.</_>
+        <_>
+          5 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 3 15 -1.</_>
+        <_>
+          5 2 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 4 -1.</_>
+        <_>
+          17 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 1 3 -1.</_>
+        <_>
+          10 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 17 3 2 -1.</_>
+        <_>
+          9 17 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 1 3 -1.</_>
+        <_>
+          10 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 4 4 -1.</_>
+        <_>
+          6 7 2 2 2.</_>
+        <_>
+          8 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 4 -1.</_>
+        <_>
+          8 7 2 2 2.</_>
+        <_>
+          10 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 2 7 -1.</_>
+        <_>
+          16 8 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 3 2 -1.</_>
+        <_>
+          9 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 3 1 -1.</_>
+        <_>
+          17 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 14 -1.</_>
+        <_>
+          3 2 6 7 2.</_>
+        <_>
+          9 9 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 2 3 -1.</_>
+        <_>
+          7 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 2 6 -1.</_>
+        <_>
+          8 13 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 6 -1.</_>
+        <_>
+          8 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 4 6 -1.</_>
+        <_>
+          6 16 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 6 -1.</_>
+        <_>
+          12 12 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 1 12 -1.</_>
+        <_>
+          0 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 10 -1.</_>
+        <_>
+          3 3 1 5 2.</_>
+        <_>
+          4 8 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 2 8 -1.</_>
+        <_>
+          3 3 1 4 2.</_>
+        <_>
+          4 7 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 1 12 -1.</_>
+        <_>
+          9 10 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 4 -1.</_>
+        <_>
+          3 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 1 4 -1.</_>
+        <_>
+          9 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 4 -1.</_>
+        <_>
+          4 6 3 2 2.</_>
+        <_>
+          7 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          7 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 14 -1.</_>
+        <_>
+          8 4 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 3 -1.</_>
+        <_>
+          7 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 5 -1.</_>
+        <_>
+          7 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 10 -1.</_>
+        <_>
+          4 4 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 14 -1.</_>
+        <_>
+          9 6 9 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 3 5 -1.</_>
+        <_>
+          12 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 18 4 2 -1.</_>
+        <_>
+          3 18 2 1 2.</_>
+        <_>
+          5 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 2 -1.</_>
+        <_>
+          7 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 3 10 -1.</_>
+        <_>
+          10 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 8 10 -1.</_>
+        <_>
+          13 0 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 13 -1.</_>
+        <_>
+          11 2 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 7 -1.</_>
+        <_>
+          9 3 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 2 -1.</_>
+        <_>
+          12 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 2 8 -1.</_>
+        <_>
+          11 7 1 4 2.</_>
+        <_>
+          12 11 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 2 -1.</_>
+        <_>
+          0 7 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 3 -1.</_>
+        <_>
+          6 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 2 -1.</_>
+        <_>
+          4 7 1 1 2.</_>
+        <_>
+          5 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 10 9 -1.</_>
+        <_>
+          9 5 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 4 -1.</_>
+        <_>
+          9 0 5 2 2.</_>
+        <_>
+          14 2 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 1 -1.</_>
+        <_>
+          8 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 1 -1.</_>
+        <_>
+          8 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 3 -1.</_>
+        <_>
+          4 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 3 -1.</_>
+        <_>
+          4 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          6 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 1 3 -1.</_>
+        <_>
+          18 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 5 -1.</_>
+        <_>
+          18 0 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 3 -1.</_>
+        <_>
+          11 3 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 5 -1.</_>
+        <_>
+          17 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 4 6 -1.</_>
+        <_>
+          0 9 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 4 12 -1.</_>
+        <_>
+          12 7 2 6 2.</_>
+        <_>
+          14 13 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 3 -1.</_>
+        <_>
+          11 7 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 3 -1.</_>
+        <_>
+          12 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 20 -1.</_>
+        <_>
+          14 0 3 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 2 6 -1.</_>
+        <_>
+          5 5 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 11 -1.</_>
+        <_>
+          3 7 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 2 1 -1.</_>
+        <_>
+          3 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 6 -1.</_>
+        <_>
+          5 14 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 3 -1.</_>
+        <_>
+          6 18 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 11 12 -1.</_>
+        <_>
+          5 12 11 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 2 -1.</_>
+        <_>
+          16 10 1 1 2.</_>
+        <_>
+          17 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 3 1 -1.</_>
+        <_>
+          16 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 3 -1.</_>
+        <_>
+          13 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 3 4 -1.</_>
+        <_>
+          6 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 14 -1.</_>
+        <_>
+          6 13 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 1 -1.</_>
+        <_>
+          12 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 6 -1.</_>
+        <_>
+          9 13 3 3 2.</_>
+        <_>
+          12 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 1 -1.</_>
+        <_>
+          11 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          9 13 1 3 2.</_>
+        <_>
+          10 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 4 2 -1.</_>
+        <_>
+          13 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          10 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 1 12 -1.</_>
+        <_>
+          5 12 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 6 -1.</_>
+        <_>
+          4 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 9 3 -1.</_>
+        <_>
+          4 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 3 -1.</_>
+        <_>
+          5 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 3 -1.</_>
+        <_>
+          8 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 19 6 1 -1.</_>
+        <_>
+          13 19 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 8 -1.</_>
+        <_>
+          18 4 1 4 2.</_>
+        <_>
+          19 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 3 -1.</_>
+        <_>
+          17 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 8 4 -1.</_>
+        <_>
+          16 15 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 10 -1.</_>
+        <_>
+          14 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 18 -1.</_>
+        <_>
+          11 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 6 -1.</_>
+        <_>
+          8 7 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 4 2 -1.</_>
+        <_>
+          12 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 8 -1.</_>
+        <_>
+          6 7 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 12 -1.</_>
+        <_>
+          6 3 6 6 2.</_>
+        <_>
+          12 9 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 2 -1.</_>
+        <_>
+          6 10 2 1 2.</_>
+        <_>
+          8 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 10 -1.</_>
+        <_>
+          2 2 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 2 -1.</_>
+        <_>
+          11 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 2 -1.</_>
+        <_>
+          6 8 5 1 2.</_>
+        <_>
+          11 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 6 -1.</_>
+        <_>
+          6 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 1 -1.</_>
+        <_>
+          11 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 2 1 -1.</_>
+        <_>
+          8 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 3 1 -1.</_>
+        <_>
+          3 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 3 3 -1.</_>
+        <_>
+          2 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 2 -1.</_>
+        <_>
+          12 0 4 1 2.</_>
+        <_>
+          16 1 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 8 -1.</_>
+        <_>
+          9 6 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 1 3 -1.</_>
+        <_>
+          6 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 7 2 -1.</_>
+        <_>
+          8 13 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 12 -1.</_>
+        <_>
+          6 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 2 3 -1.</_>
+        <_>
+          6 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 1 3 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 1 2 -1.</_>
+        <_>
+          8 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 4 6 -1.</_>
+        <_>
+          7 11 2 3 2.</_>
+        <_>
+          9 14 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 3 -1.</_>
+        <_>
+          10 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 2 3 -1.</_>
+        <_>
+          12 11 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 3 -1.</_>
+        <_>
+          6 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 6 -1.</_>
+        <_>
+          6 12 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 12 -1.</_>
+        <_>
+          5 12 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 2 1 -1.</_>
+        <_>
+          2 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 3 -1.</_>
+        <_>
+          8 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 4 -1.</_>
+        <_>
+          4 6 4 2 2.</_>
+        <_>
+          8 8 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 3 1 -1.</_>
+        <_>
+          1 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 2 -1.</_>
+        <_>
+          4 1 1 1 2.</_>
+        <_>
+          5 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 1 6 -1.</_>
+        <_>
+          14 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 3 3 -1.</_>
+        <_>
+          5 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 4 -1.</_>
+        <_>
+          2 3 6 2 2.</_>
+        <_>
+          8 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 3 2 -1.</_>
+        <_>
+          11 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 8 1 -1.</_>
+        <_>
+          16 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 13 -1.</_>
+        <_>
+          15 0 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 8 -1.</_>
+        <_>
+          12 12 1 4 2.</_>
+        <_>
+          13 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 12 -1.</_>
+        <_>
+          4 13 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 2 4 -1.</_>
+        <_>
+          10 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 3 1 -1.</_>
+        <_>
+          5 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 1 3 -1.</_>
+        <_>
+          18 6 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 1 -1.</_>
+        <_>
+          9 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 6 -1.</_>
+        <_>
+          12 7 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 4 -1.</_>
+        <_>
+          18 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 2 -1.</_>
+        <_>
+          3 10 1 1 2.</_>
+        <_>
+          4 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 8 -1.</_>
+        <_>
+          17 4 1 4 2.</_>
+        <_>
+          18 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 1 3 -1.</_>
+        <_>
+          7 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 2 1 -1.</_>
+        <_>
+          1 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 2 4 -1.</_>
+        <_>
+          7 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 19 3 1 -1.</_>
+        <_>
+          5 19 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 4 5 -1.</_>
+        <_>
+          4 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 4 -1.</_>
+        <_>
+          4 11 2 2 2.</_>
+        <_>
+          6 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 6 -1.</_>
+        <_>
+          4 13 1 3 2.</_>
+        <_>
+          5 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 3 4 -1.</_>
+        <_>
+          8 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 2 -1.</_>
+        <_>
+          18 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 2 -1.</_>
+        <_>
+          10 5 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 6 3 -1.</_>
+        <_>
+          12 4 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 2 2 -1.</_>
+        <_>
+          17 12 1 1 2.</_>
+        <_>
+          18 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 15 8 -1.</_>
+        <_>
+          10 12 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 2 2 -1.</_>
+        <_>
+          4 18 1 1 2.</_>
+        <_>
+          5 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 2 2 -1.</_>
+        <_>
+          0 15 1 1 2.</_>
+        <_>
+          1 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 1 6 -1.</_>
+        <_>
+          5 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 18 14 -1.</_>
+        <_>
+          1 7 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 7 6 -1.</_>
+        <_>
+          6 5 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 2 1 -1.</_>
+        <_>
+          7 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 16 9 -1.</_>
+        <_>
+          4 14 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 2 -1.</_>
+        <_>
+          17 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 2 -1.</_>
+        <_>
+          7 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 3 -1.</_>
+        <_>
+          6 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 10 -1.</_>
+        <_>
+          7 11 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 1 2 -1.</_>
+        <_>
+          10 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 17 2 2 -1.</_>
+        <_>
+          6 17 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 18 -1.</_>
+        <_>
+          11 0 9 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 3 -1.</_>
+        <_>
+          14 11 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 1 -1.</_>
+        <_>
+          14 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 2 2 -1.</_>
+        <_>
+          15 10 1 1 2.</_>
+        <_>
+          16 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 8 -1.</_>
+        <_>
+          4 11 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 12 -1.</_>
+        <_>
+          8 1 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 8 -1.</_>
+        <_>
+          8 3 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 12 -1.</_>
+        <_>
+          11 4 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 4 5 -1.</_>
+        <_>
+          18 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 2 3 -1.</_>
+        <_>
+          15 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 10 6 -1.</_>
+        <_>
+          14 7 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 11 -1.</_>
+        <_>
+          13 7 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 16 1 2 -1.</_>
+        <_>
+          19 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 15 12 1 -1.</_>
+        <_>
+          14 15 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 6 3 -1.</_>
+        <_>
+          10 16 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 4 -1.</_>
+        <_>
+          6 8 5 2 2.</_>
+        <_>
+          11 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 1 3 -1.</_>
+        <_>
+          10 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 9 12 -1.</_>
+        <_>
+          10 7 9 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 1 4 -1.</_>
+        <_>
+          10 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 18 4 -1.</_>
+        <_>
+          1 7 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 12 6 -1.</_>
+        <_>
+          12 4 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 3 -1.</_>
+        <_>
+          13 2 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 4 -1.</_>
+        <_>
+          14 0 3 2 2.</_>
+        <_>
+          17 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 3 -1.</_>
+        <_>
+          9 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 8 4 -1.</_>
+        <_>
+          5 14 4 2 2.</_>
+        <_>
+          9 16 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 14 14 -1.</_>
+        <_>
+          8 6 7 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 2 -1.</_>
+        <_>
+          13 4 3 1 2.</_>
+        <_>
+          16 5 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 6 -1.</_>
+        <_>
+          8 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 20 -1.</_>
+        <_>
+          8 10 12 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 3 -1.</_>
+        <_>
+          9 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 18 8 2 -1.</_>
+        <_>
+          10 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 2 -1.</_>
+        <_>
+          9 12 2 1 2.</_>
+        <_>
+          11 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 2 -1.</_>
+        <_>
+          4 14 1 1 2.</_>
+        <_>
+          5 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 3 2 -1.</_>
+        <_>
+          5 15 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 3 -1.</_>
+        <_>
+          13 1 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 2 3 -1.</_>
+        <_>
+          6 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 2 -1.</_>
+        <_>
+          15 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 7 -1.</_>
+        <_>
+          3 13 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 1 -1.</_>
+        <_>
+          18 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 4 -1.</_>
+        <_>
+          9 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 8 4 -1.</_>
+        <_>
+          7 16 4 2 2.</_>
+        <_>
+          11 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 16 4 3 -1.</_>
+        <_>
+          11 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 2 -1.</_>
+        <_>
+          3 10 3 1 2.</_>
+        <_>
+          6 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 2 -1.</_>
+        <_>
+          12 7 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 2 -1.</_>
+        <_>
+          11 7 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 3 10 -1.</_>
+        <_>
+          14 6 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 4 3 -1.</_>
+        <_>
+          17 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 10 -1.</_>
+        <_>
+          3 10 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 2 -1.</_>
+        <_>
+          5 0 1 1 2.</_>
+        <_>
+          6 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 3 6 -1.</_>
+        <_>
+          3 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 9 10 -1.</_>
+        <_>
+          7 6 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 9 5 -1.</_>
+        <_>
+          9 10 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 9 -1.</_>
+        <_>
+          11 5 1 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 4 -1.</_>
+        <_>
+          4 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 2 -1.</_>
+        <_>
+          4 6 1 1 2.</_>
+        <_>
+          5 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 3 -1.</_>
+        <_>
+          0 3 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 8 4 -1.</_>
+        <_>
+          12 0 4 2 2.</_>
+        <_>
+          16 2 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 2 -1.</_>
+        <_>
+          11 1 4 1 2.</_>
+        <_>
+          15 2 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 7 3 -1.</_>
+        <_>
+          12 3 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 2 -1.</_>
+        <_>
+          4 6 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 6 -1.</_>
+        <_>
+          4 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 4 -1.</_>
+        <_>
+          13 12 3 2 2.</_>
+        <_>
+          16 14 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 2 4 -1.</_>
+        <_>
+          13 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 3 3 -1.</_>
+        <_>
+          15 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 2 3 -1.</_>
+        <_>
+          14 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 8 -1.</_>
+        <_>
+          18 4 1 4 2.</_>
+        <_>
+          19 8 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 2 4 -1.</_>
+        <_>
+          7 14 1 2 2.</_>
+        <_>
+          8 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 6 -1.</_>
+        <_>
+          14 5 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 7 1 2 -1.</_>
+        <_>
+          19 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 6 2 -1.</_>
+        <_>
+          8 8 3 1 2.</_>
+        <_>
+          11 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 6 1 3 -1.</_>
+        <_>
+          19 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 7 3 -1.</_>
+        <_>
+          7 9 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 6 -1.</_>
+        <_>
+          18 6 1 3 2.</_>
+        <_>
+          19 9 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 8 6 -1.</_>
+        <_>
+          5 10 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 15 -1.</_>
+        <_>
+          10 1 9 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 5 4 -1.</_>
+        <_>
+          11 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 3 -1.</_>
+        <_>
+          11 12 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 2 4 -1.</_>
+        <_>
+          0 9 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 2 -1.</_>
+        <_>
+          6 12 2 1 2.</_>
+        <_>
+          8 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 8 -1.</_>
+        <_>
+          7 11 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 2 4 -1.</_>
+        <_>
+          9 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 6 6 -1.</_>
+        <_>
+          9 12 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 4 2 -1.</_>
+        <_>
+          12 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 8 1 -1.</_>
+        <_>
+          4 4 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 1 2 -1.</_>
+        <_>
+          14 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 6 -1.</_>
+        <_>
+          8 7 1 3 2.</_>
+        <_>
+          9 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 10 6 -1.</_>
+        <_>
+          5 8 5 3 2.</_>
+        <_>
+          10 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          5 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 15 -1.</_>
+        <_>
+          6 7 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 4 -1.</_>
+        <_>
+          7 6 1 2 2.</_>
+        <_>
+          8 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 3 -1.</_>
+        <_>
+          5 10 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 2 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_>
+        <_>
+          16 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 6 -1.</_>
+        <_>
+          4 13 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 6 -1.</_>
+        <_>
+          6 0 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 12 4 -1.</_>
+        <_>
+          4 11 6 2 2.</_>
+        <_>
+          10 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 3 -1.</_>
+        <_>
+          7 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 2 -1.</_>
+        <_>
+          9 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 8 -1.</_>
+        <_>
+          8 0 6 4 2.</_>
+        <_>
+          14 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 4 -1.</_>
+        <_>
+          10 8 2 2 2.</_>
+        <_>
+          12 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 1 6 -1.</_>
+        <_>
+          12 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 10 -1.</_>
+        <_>
+          6 5 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 6 -1.</_>
+        <_>
+          11 0 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 2 6 -1.</_>
+        <_>
+          9 7 1 3 2.</_>
+        <_>
+          10 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 3 1 -1.</_>
+        <_>
+          9 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 2 -1.</_>
+        <_>
+          11 15 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 6 2 -1.</_>
+        <_>
+          12 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 6 -1.</_>
+        <_>
+          8 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 6 -1.</_>
+        <_>
+          7 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 3 -1.</_>
+        <_>
+          5 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 12 -1.</_>
+        <_>
+          5 4 5 6 2.</_>
+        <_>
+          10 10 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 2 -1.</_>
+        <_>
+          5 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          5 12 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 9 -1.</_>
+        <_>
+          8 13 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 6 -1.</_>
+        <_>
+          7 10 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 14 -1.</_>
+        <_>
+          4 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 6 -1.</_>
+        <_>
+          4 10 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 2 -1.</_>
+        <_>
+          4 8 1 1 2.</_>
+        <_>
+          5 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 2 3 -1.</_>
+        <_>
+          10 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 4 -1.</_>
+        <_>
+          6 14 4 2 2.</_>
+        <_>
+          10 16 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 3 4 -1.</_>
+        <_>
+          6 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 1 10 -1.</_>
+        <_>
+          15 11 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 6 -1.</_>
+        <_>
+          7 3 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 4 -1.</_>
+        <_>
+          4 9 1 2 2.</_>
+        <_>
+          5 11 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 12 -1.</_>
+        <_>
+          9 7 3 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 2 3 -1.</_>
+        <_>
+          8 6 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 3 -1.</_>
+        <_>
+          0 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 3 -1.</_>
+        <_>
+          0 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 15 3 5 -1.</_>
+        <_>
+          12 15 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 6 -1.</_>
+        <_>
+          8 8 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 3 12 -1.</_>
+        <_>
+          5 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 2 2 -1.</_>
+        <_>
+          7 9 1 1 2.</_>
+        <_>
+          8 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 12 -1.</_>
+        <_>
+          4 8 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 7 3 -1.</_>
+        <_>
+          4 6 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 3 -1.</_>
+        <_>
+          13 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 2 -1.</_>
+        <_>
+          4 0 1 1 2.</_>
+        <_>
+          5 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 3 11 -1.</_>
+        <_>
+          12 8 1 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 2 2 -1.</_>
+        <_>
+          4 0 1 1 2.</_>
+        <_>
+          5 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 2 2 -1.</_>
+        <_>
+          9 3 1 1 2.</_>
+        <_>
+          10 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 3 2 -1.</_>
+        <_>
+          8 11 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 1 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 2 -1.</_>
+        <_>
+          10 8 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 3 1 -1.</_>
+        <_>
+          18 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 2 4 -1.</_>
+        <_>
+          12 6 1 2 2.</_>
+        <_>
+          13 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 9 11 -1.</_>
+        <_>
+          11 3 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 2 -1.</_>
+        <_>
+          11 8 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 9 -1.</_>
+        <_>
+          12 8 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 17 -1.</_>
+        <_>
+          15 0 2 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 4 -1.</_>
+        <_>
+          7 6 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 7 -1.</_>
+        <_>
+          7 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 3 2 -1.</_>
+        <_>
+          8 5 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 6 2 -1.</_>
+        <_>
+          7 15 3 1 2.</_>
+        <_>
+          10 16 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 7 -1.</_>
+        <_>
+          4 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 17 5 3 -1.</_>
+        <_>
+          11 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 2 2 -1.</_>
+        <_>
+          17 11 1 1 2.</_>
+        <_>
+          18 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 6 3 -1.</_>
+        <_>
+          10 18 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 1 2 -1.</_>
+        <_>
+          2 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 3 -1.</_>
+        <_>
+          8 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 1 2 -1.</_>
+        <_>
+          7 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 2 2 -1.</_>
+        <_>
+          2 16 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 20 -1.</_>
+        <_>
+          4 0 1 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 12 -1.</_>
+        <_>
+          14 2 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 2 3 -1.</_>
+        <_>
+          5 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 2 2 -1.</_>
+        <_>
+          3 4 1 1 2.</_>
+        <_>
+          4 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 3 -1.</_>
+        <_>
+          10 15 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 4 -1.</_>
+        <_>
+          6 13 1 2 2.</_>
+        <_>
+          7 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 7 -1.</_>
+        <_>
+          13 8 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 10 -1.</_>
+        <_>
+          8 9 3 5 2.</_>
+        <_>
+          11 14 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 16 2 -1.</_>
+        <_>
+          10 10 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 15 6 -1.</_>
+        <_>
+          10 3 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 2 1 -1.</_>
+        <_>
+          11 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 4 4 -1.</_>
+        <_>
+          11 11 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 4 -1.</_>
+        <_>
+          12 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 10 14 -1.</_>
+        <_>
+          1 3 5 7 2.</_>
+        <_>
+          6 10 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 4 -1.</_>
+        <_>
+          8 2 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 2 1 -1.</_>
+        <_>
+          11 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 5 3 -1.</_>
+        <_>
+          5 13 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 1 3 -1.</_>
+        <_>
+          7 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 6 3 -1.</_>
+        <_>
+          10 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 1 3 -1.</_>
+        <_>
+          6 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          2 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 11 6 -1.</_>
+        <_>
+          8 10 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 10 8 -1.</_>
+        <_>
+          2 6 5 4 2.</_>
+        <_>
+          7 10 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 2 -1.</_>
+        <_>
+          11 2 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 6 3 -1.</_>
+        <_>
+          15 9 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 1 2 -1.</_>
+        <_>
+          5 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 3 1 -1.</_>
+        <_>
+          2 7 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 8 6 -1.</_>
+        <_>
+          4 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 1 2 -1.</_>
+        <_>
+          11 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 1 2 -1.</_>
+        <_>
+          12 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 10 4 -1.</_>
+        <_>
+          10 15 5 2 2.</_>
+        <_>
+          15 17 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 1 2 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 1 -1.</_>
+        <_>
+          7 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 2 -1.</_>
+        <_>
+          12 3 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 5 -1.</_>
+        <_>
+          7 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 3 1 -1.</_>
+        <_>
+          4 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 5 -1.</_>
+        <_>
+          7 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 3 -1.</_>
+        <_>
+          7 7 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 8 -1.</_>
+        <_>
+          7 8 2 4 2.</_>
+        <_>
+          9 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 12 -1.</_>
+        <_>
+          4 6 14 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 2 6 -1.</_>
+        <_>
+          4 14 1 3 2.</_>
+        <_>
+          5 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 4 -1.</_>
+        <_>
+          7 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 15 -1.</_>
+        <_>
+          6 9 10 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 6 -1.</_>
+        <_>
+          6 13 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 3 -1.</_>
+        <_>
+          6 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 3 -1.</_>
+        <_>
+          6 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 3 7 -1.</_>
+        <_>
+          10 13 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 5 2 -1.</_>
+        <_>
+          2 9 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 8 -1.</_>
+        <_>
+          15 1 1 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 1 2 -1.</_>
+        <_>
+          2 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 2 2 -1.</_>
+        <_>
+          8 6 1 1 2.</_>
+        <_>
+          9 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 12 -1.</_>
+        <_>
+          4 9 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 8 4 -1.</_>
+        <_>
+          5 9 4 2 2.</_>
+        <_>
+          9 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 4 4 -1.</_>
+        <_>
+          9 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 2 -1.</_>
+        <_>
+          5 11 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 2 1 -1.</_>
+        <_>
+          7 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 1 -1.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 4 8 -1.</_>
+        <_>
+          13 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 3 10 -1.</_>
+        <_>
+          10 4 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 9 2 -1.</_>
+        <_>
+          3 18 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 3 3 -1.</_>
+        <_>
+          15 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 2 2 -1.</_>
+        <_>
+          9 12 1 1 2.</_>
+        <_>
+          10 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 7 3 -1.</_>
+        <_>
+          13 13 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 2 -1.</_>
+        <_>
+          14 11 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 5 14 -1.</_>
+        <_>
+          14 12 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 5 3 -1.</_>
+        <_>
+          4 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 5 3 -1.</_>
+        <_>
+          5 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 4 5 -1.</_>
+        <_>
+          10 14 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 2 1 -1.</_>
+        <_>
+          10 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 2 -1.</_>
+        <_>
+          6 10 3 1 2.</_>
+        <_>
+          9 11 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 7 6 -1.</_>
+        <_>
+          10 15 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 8 -1.</_>
+        <_>
+          4 1 1 4 2.</_>
+        <_>
+          5 5 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 4 -1.</_>
+        <_>
+          3 6 3 2 2.</_>
+        <_>
+          6 8 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 3 13 -1.</_>
+        <_>
+          16 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 6 -1.</_>
+        <_>
+          16 10 1 3 2.</_>
+        <_>
+          17 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 19 2 1 -1.</_>
+        <_>
+          14 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 2 1 -1.</_>
+        <_>
+          8 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 4 -1.</_>
+        <_>
+          5 10 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 2 4 -1.</_>
+        <_>
+          4 7 1 2 2.</_>
+        <_>
+          5 9 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 5 4 -1.</_>
+        <_>
+          10 9 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 16 -1.</_>
+        <_>
+          7 4 4 8 2.</_>
+        <_>
+          11 12 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 10 6 -1.</_>
+        <_>
+          5 9 5 3 2.</_>
+        <_>
+          10 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          5 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 4 8 -1.</_>
+        <_>
+          12 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 2 -1.</_>
+        <_>
+          8 14 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 5 6 -1.</_>
+        <_>
+          3 14 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 2 -1.</_>
+        <_>
+          16 0 1 1 2.</_>
+        <_>
+          17 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 3 4 -1.</_>
+        <_>
+          14 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 3 1 -1.</_>
+        <_>
+          16 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 5 -1.</_>
+        <_>
+          16 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 18 -1.</_>
+        <_>
+          10 10 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 2 -1.</_>
+        <_>
+          11 6 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 2 1 -1.</_>
+        <_>
+          6 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 3 3 -1.</_>
+        <_>
+          4 4 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 1 3 -1.</_>
+        <_>
+          11 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 3 3 -1.</_>
+        <_>
+          16 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 5 12 -1.</_>
+        <_>
+          15 14 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 10 -1.</_>
+        <_>
+          4 0 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 1 2 -1.</_>
+        <_>
+          15 16 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 2 -1.</_>
+        <_>
+          15 0 2 1 2.</_>
+        <_>
+          17 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 1 -1.</_>
+        <_>
+          18 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 1 3 -1.</_>
+        <_>
+          8 14 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 2 6 -1.</_>
+        <_>
+          9 1 1 3 2.</_>
+        <_>
+          10 4 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 3 -1.</_>
+        <_>
+          1 13 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 3 3 -1.</_>
+        <_>
+          12 15 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 1 -1.</_>
+        <_>
+          12 6 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 3 7 -1.</_>
+        <_>
+          13 5 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 2 -1.</_>
+        <_>
+          8 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 2 -1.</_>
+        <_>
+          7 1 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 5 -1.</_>
+        <_>
+          14 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 6 -1.</_>
+        <_>
+          15 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 4 3 -1.</_>
+        <_>
+          8 7 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 1 9 -1.</_>
+        <_>
+          6 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 7 6 -1.</_>
+        <_>
+          3 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 3 -1.</_>
+        <_>
+          6 7 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 1 -1.</_>
+        <_>
+          6 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 4 4 -1.</_>
+        <_>
+          4 5 2 2 2.</_>
+        <_>
+          6 7 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 2 3 -1.</_>
+        <_>
+          8 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 7 -1.</_>
+        <_>
+          7 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 3 5 -1.</_>
+        <_>
+          11 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 13 -1.</_>
+        <_>
+          12 4 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 3 3 -1.</_>
+        <_>
+          3 13 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 2 -1.</_>
+        <_>
+          5 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 1 3 -1.</_>
+        <_>
+          0 5 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 6 -1.</_>
+        <_>
+          9 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 12 -1.</_>
+        <_>
+          9 7 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 6 3 -1.</_>
+        <_>
+          9 12 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 12 -1.</_>
+        <_>
+          8 10 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 15 -1.</_>
+        <_>
+          11 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 6 4 -1.</_>
+        <_>
+          8 16 3 2 2.</_>
+        <_>
+          11 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 10 6 -1.</_>
+        <_>
+          6 7 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 3 4 -1.</_>
+        <_>
+          3 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 3 -1.</_>
+        <_>
+          9 14 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 6 -1.</_>
+        <_>
+          3 0 2 3 2.</_>
+        <_>
+          5 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 1 -1.</_>
+        <_>
+          8 9 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 2 3 -1.</_>
+        <_>
+          11 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 1 -1.</_>
+        <_>
+          6 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 12 -1.</_>
+        <_>
+          17 4 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 6 -1.</_>
+        <_>
+          11 13 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 7 -1.</_>
+        <_>
+          11 13 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 1 -1.</_>
+        <_>
+          8 5 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 8 -1.</_>
+        <_>
+          19 2 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 1 -1.</_>
+        <_>
+          6 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 6 -1.</_>
+        <_>
+          8 7 2 3 2.</_>
+        <_>
+          10 10 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 2 -1.</_>
+        <_>
+          8 3 1 1 2.</_>
+        <_>
+          9 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 3 -1.</_>
+        <_>
+          18 6 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 4 -1.</_>
+        <_>
+          18 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 2 4 -1.</_>
+        <_>
+          8 2 1 2 2.</_>
+        <_>
+          9 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 2 2 -1.</_>
+        <_>
+          5 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 1 -1.</_>
+        <_>
+          5 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 9 10 -1.</_>
+        <_>
+          10 14 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 1 -1.</_>
+        <_>
+          7 4 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 1 3 -1.</_>
+        <_>
+          8 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 2 1 -1.</_>
+        <_>
+          7 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 3 9 -1.</_>
+        <_>
+          5 12 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 7 3 -1.</_>
+        <_>
+          5 14 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 10 -1.</_>
+        <_>
+          9 6 1 5 2.</_>
+        <_>
+          10 11 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 18 -1.</_>
+        <_>
+          13 10 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 2 3 -1.</_>
+        <_>
+          5 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 7 -1.</_>
+        <_>
+          10 10 1 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 13 -1.</_>
+        <_>
+          18 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 1 2 -1.</_>
+        <_>
+          13 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 3 2 -1.</_>
+        <_>
+          7 15 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 2 3 -1.</_>
+        <_>
+          5 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 1 6 -1.</_>
+        <_>
+          16 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 2 2 -1.</_>
+        <_>
+          1 6 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 8 -1.</_>
+        <_>
+          3 12 2 4 2.</_>
+        <_>
+          5 16 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 8 -1.</_>
+        <_>
+          7 2 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 6 -1.</_>
+        <_>
+          6 7 1 3 2.</_>
+        <_>
+          7 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 2 -1.</_>
+        <_>
+          7 12 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 13 2 -1.</_>
+        <_>
+          4 10 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 5 1 2 -1.</_>
+        <_>
+          19 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 9 1 -1.</_>
+        <_>
+          7 8 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 2 1 -1.</_>
+        <_>
+          9 8 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 2 10 -1.</_>
+        <_>
+          3 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 1 -1.</_>
+        <_>
+          7 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 3 3 -1.</_>
+        <_>
+          15 5 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 2 -1.</_>
+        <_>
+          4 8 1 1 2.</_>
+        <_>
+          5 9 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 9 2 -1.</_>
+        <_>
+          8 17 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 2 3 -1.</_>
+        <_>
+          6 8 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 2 2 -1.</_>
+        <_>
+          12 11 1 1 2.</_>
+        <_>
+          13 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 2 4 -1.</_>
+        <_>
+          15 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 2 3 -1.</_>
+        <_>
+          5 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 3 -1.</_>
+        <_>
+          6 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 1 6 -1.</_>
+        <_>
+          6 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 5 9 -1.</_>
+        <_>
+          6 12 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 2 -1.</_>
+        <_>
+          8 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 2 -1.</_>
+        <_>
+          10 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 6 -1.</_>
+        <_>
+          8 10 2 3 2.</_>
+        <_>
+          10 13 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 9 20 -1.</_>
+        <_>
+          5 0 3 20 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 4 -1.</_>
+        <_>
+          12 3 1 2 2.</_>
+        <_>
+          13 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 10 -1.</_>
+        <_>
+          16 0 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 4 -1.</_>
+        <_>
+          14 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 1 2 -1.</_>
+        <_>
+          14 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 3 1 -1.</_>
+        <_>
+          17 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 2 2 -1.</_>
+        <_>
+          16 11 1 1 2.</_>
+        <_>
+          17 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 1 -1.</_>
+        <_>
+          15 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 14 9 -1.</_>
+        <_>
+          10 2 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 2 -1.</_>
+        <_>
+          11 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 2 1 -1.</_>
+        <_>
+          14 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 3 -1.</_>
+        <_>
+          7 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 4 2 -1.</_>
+        <_>
+          18 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 8 8 -1.</_>
+        <_>
+          4 12 4 4 2.</_>
+        <_>
+          8 16 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 5 -1.</_>
+        <_>
+          16 8 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 2 -1.</_>
+        <_>
+          13 8 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 5 -1.</_>
+        <_>
+          12 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 10 -1.</_>
+        <_>
+          16 9 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 3 1 -1.</_>
+        <_>
+          5 18 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 4 4 -1.</_>
+        <_>
+          4 13 2 2 2.</_>
+        <_>
+          6 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 2 3 -1.</_>
+        <_>
+          6 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 1 3 -1.</_>
+        <_>
+          6 16 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 1 -1.</_>
+        <_>
+          8 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 3 1 -1.</_>
+        <_>
+          8 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 1 -1.</_>
+        <_>
+          11 10 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 2 1 -1.</_>
+        <_>
+          12 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 1 6 -1.</_>
+        <_>
+          7 11 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 3 -1.</_>
+        <_>
+          7 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 1 3 -1.</_>
+        <_>
+          13 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 2 4 -1.</_>
+        <_>
+          5 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 6 -1.</_>
+        <_>
+          8 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 13 -1.</_>
+        <_>
+          8 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 10 8 -1.</_>
+        <_>
+          8 4 5 4 2.</_>
+        <_>
+          13 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 9 6 -1.</_>
+        <_>
+          11 3 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          13 0 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 15 -1.</_>
+        <_>
+          12 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 9 -1.</_>
+        <_>
+          4 11 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 1 16 -1.</_>
+        <_>
+          11 10 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 14 -1.</_>
+        <_>
+          12 8 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 4 -1.</_>
+        <_>
+          12 1 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 2 -1.</_>
+        <_>
+          9 8 2 1 2.</_>
+        <_>
+          11 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 2 2 -1.</_>
+        <_>
+          18 3 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 3 2 -1.</_>
+        <_>
+          3 6 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 2 2 -1.</_>
+        <_>
+          9 9 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 6 1 -1.</_>
+        <_>
+          8 15 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 2 4 -1.</_>
+        <_>
+          16 10 1 2 2.</_>
+        <_>
+          17 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 6 -1.</_>
+        <_>
+          6 6 5 3 2.</_>
+        <_>
+          11 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 3 -1.</_>
+        <_>
+          13 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 2 -1.</_>
+        <_>
+          13 0 2 1 2.</_>
+        <_>
+          15 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 2 -1.</_>
+        <_>
+          10 0 5 1 2.</_>
+        <_>
+          15 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 1 -1.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          4 9 1 1 2.</_>
+        <_>
+          5 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 2 3 -1.</_>
+        <_>
+          6 9 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 3 -1.</_>
+        <_>
+          2 13 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 2 -1.</_>
+        <_>
+          2 0 5 1 2.</_>
+        <_>
+          7 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 2 2 -1.</_>
+        <_>
+          6 3 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 2 -1.</_>
+        <_>
+          5 11 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 5 10 -1.</_>
+        <_>
+          11 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 4 3 -1.</_>
+        <_>
+          5 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 12 -1.</_>
+        <_>
+          9 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 10 3 5 -1.</_>
+        <_>
+          17 10 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 2 4 -1.</_>
+        <_>
+          15 12 1 2 2.</_>
+        <_>
+          16 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 8 -1.</_>
+        <_>
+          8 0 6 4 2.</_>
+        <_>
+          14 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 5 3 -1.</_>
+        <_>
+          14 2 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 6 -1.</_>
+        <_>
+          3 2 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 2 2 -1.</_>
+        <_>
+          7 5 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 12 1 -1.</_>
+        <_>
+          11 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 7 2 -1.</_>
+        <_>
+          13 10 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 1 3 -1.</_>
+        <_>
+          5 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 15 2 -1.</_>
+        <_>
+          5 4 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 9 13 -1.</_>
+        <_>
+          6 0 3 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 2 -1.</_>
+        <_>
+          7 10 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 2 -1.</_>
+        <_>
+          8 3 2 1 2.</_>
+        <_>
+          10 4 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 6 -1.</_>
+        <_>
+          8 7 1 3 2.</_>
+        <_>
+          9 10 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 2 3 -1.</_>
+        <_>
+          9 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          6 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 1 2 -1.</_>
+        <_>
+          0 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 1 6 -1.</_>
+        <_>
+          7 2 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 2 5 -1.</_>
+        <_>
+          15 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 1 -1.</_>
+        <_>
+          7 2 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 5 2 -1.</_>
+        <_>
+          11 14 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 1 3 -1.</_>
+        <_>
+          13 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 17 12 2 -1.</_>
+        <_>
+          11 17 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 13 20 -1.</_>
+        <_>
+          0 10 13 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 10 12 -1.</_>
+        <_>
+          4 13 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 2 2 -1.</_>
+        <_>
+          11 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 4 4 -1.</_>
+        <_>
+          11 11 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 5 -1.</_>
+        <_>
+          12 9 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 4 -1.</_>
+        <_>
+          17 9 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 1 -1.</_>
+        <_>
+          16 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 11 -1.</_>
+        <_>
+          16 3 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 10 -1.</_>
+        <_>
+          4 3 5 5 2.</_>
+        <_>
+          9 8 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 14 9 -1.</_>
+        <_>
+          6 7 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 2 4 -1.</_>
+        <_>
+          8 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 8 -1.</_>
+        <_>
+          5 9 3 4 2.</_>
+        <_>
+          8 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 4 4 -1.</_>
+        <_>
+          5 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 1 3 -1.</_>
+        <_>
+          7 15 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 3 1 -1.</_>
+        <_>
+          10 10 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 2 4 -1.</_>
+        <_>
+          4 8 1 2 2.</_>
+        <_>
+          5 10 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 2 5 -1.</_>
+        <_>
+          15 6 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 7 -1.</_>
+        <_>
+          15 7 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 7 -1.</_>
+        <_>
+          17 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 6 5 -1.</_>
+        <_>
+          11 11 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 4 -1.</_>
+        <_>
+          10 8 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 14 -1.</_>
+        <_>
+          1 2 4 7 2.</_>
+        <_>
+          5 9 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 3 1 -1.</_>
+        <_>
+          11 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 4 -1.</_>
+        <_>
+          9 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 2 -1.</_>
+        <_>
+          7 14 3 1 2.</_>
+        <_>
+          10 15 3 1 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_righteye_2splits.xml b/venv/Lib/site-packages/cv2/data/haarcascade_righteye_2splits.xml
new file mode 100644
index 000000000..db4571cde
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_righteye_2splits.xml
@@ -0,0 +1,7407 @@
+<?xml version="1.0"?>
+<!--
+    Tree-based 20x20 right eye detector.
+    The detector is trained by 6665 positive samples from FERET, VALID and BioID face databases. 
+    Created by Shiqi Yu (http://yushiqi.cn/research/eyedetection).
+
+////////////////////////////////////////////////////////////////////////////////////////
+
+  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+
+  By downloading, copying, installing or using the software you agree to this license.
+  If you do not agree to this license, do not download, install,
+  copy or use the software.
+
+
+                        Intel License Agreement
+                For Open Source Computer Vision Library
+
+ Copyright (C) 2000, Intel Corporation, all rights reserved.
+ Third party copyrights are property of their respective owners.
+
+ Redistribution and use in source and binary forms, with or without modification,
+ are permitted provided that the following conditions are met:
+
+   * Redistribution's of source code must retain the above copyright notice,
+     this list of conditions and the following disclaimer.
+
+   * Redistribution's in binary form must reproduce the above copyright notice,
+     this list of conditions and the following disclaimer in the documentation
+     and/or other materials provided with the distribution.
+
+   * The name of Intel Corporation may not be used to endorse or promote products
+     derived from this software without specific prior written permission.
+
+ This software is provided by the copyright holders and contributors "as is" and
+ any express or implied warranties, including, but not limited to, the implied
+ warranties of merchantability and fitness for a particular purpose are disclaimed.
+ In no event shall the Intel Corporation or contributors be liable for any direct,
+ indirect, incidental, special, exemplary, or consequential damages
+ (including, but not limited to, procurement of substitute goods or services;
+ loss of use, data, or profits; or business interruption) however caused
+ and on any theory of liability, whether in contract, strict liability,
+ or tort (including negligence or otherwise) arising in any way out of
+ the use of this software, even if advised of the possibility of such damage.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>20</width>
+  <stageParams>
+    <maxWeakCount>34</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>5</maxWeakCount>
+      <stageThreshold>-2.2325520515441895e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 0 -4.8210550099611282e-02 -1 -2 1
+            -4.1576199233531952e-02</internalNodes>
+          <leafValues>
+            -8.6140447854995728e-01 9.1769057512283325e-01
+            -2.1284009516239166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 2 9.3528684228658676e-03 -1 -2 3 -2.2144919785205275e-04</internalNodes>
+          <leafValues>
+            -6.9785767793655396e-01 7.9523372650146484e-01
+            -4.8948091268539429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 4 -2.1853350102901459e-02 -1 -2 5 9.9672928452491760e-02</internalNodes>
+          <leafValues>
+            7.0574641227722168e-01 -7.0666241645812988e-01
+            7.9210978746414185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 6 -2.1664820611476898e-02 -1 -2 7
+            -7.5680727604776621e-04</internalNodes>
+          <leafValues>
+            -6.0898607969284058e-01 7.1685701608657837e-01
+            -3.0464568734169006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 8 -1.3333049602806568e-02 -1 -2 9 9.2925298959016800e-03</internalNodes>
+          <leafValues>
+            -4.6844691038131714e-01 6.4235931634902954e-01
+            -5.1180428266525269e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>5</maxWeakCount>
+      <stageThreshold>-2.1598019599914551e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 10 -3.3948719501495361e-01 -1 -2 11
+            -1.3672479987144470e-01</internalNodes>
+          <leafValues>
+            7.7913260459899902e-01 2.6421278715133667e-01
+            -8.7910091876983643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 12 3.1394500285387039e-02 -1 -2 13
+            -1.0828140191733837e-02</internalNodes>
+          <leafValues>
+            -6.9956701993942261e-01 7.6504492759704590e-01
+            -4.3719211220741272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 14 -4.2506768368184566e-03 -1 -2 15
+            -2.2675469517707825e-02</internalNodes>
+          <leafValues>
+            -5.7561582326889038e-01 7.4080592393875122e-01
+            -3.6677250266075134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 16 3.9161480963230133e-02 -1 -2 17
+            -3.1934089493006468e-03</internalNodes>
+          <leafValues>
+            6.4045161008834839e-01 1.6047589480876923e-01
+            -7.1010977029800415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 18 2.5321990251541138e-02 -1 -2 19
+            7.7583367237821221e-04</internalNodes>
+          <leafValues>
+            4.9574860930442810e-01 -7.1737897396087646e-01
+            -1.8581770360469818e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>8</maxWeakCount>
+      <stageThreshold>-2.3451159000396729e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 20 -2.6554059982299805e-01 -1 -2 21
+            -2.2532779723405838e-02</internalNodes>
+          <leafValues>
+            -8.4712451696395874e-01 8.7977188825607300e-01
+            -3.3394691348075867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 22 8.5310067515820265e-04 -1 -2 23
+            1.5820249973330647e-04</internalNodes>
+          <leafValues>
+            -8.2032448053359985e-01 -7.5176358222961426e-01
+            6.7769712209701538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 24 -1.0837490117410198e-04 -1 -2 25
+            2.6810260023921728e-03</internalNodes>
+          <leafValues>
+            -8.3314001560211182e-01 5.3844749927520752e-01
+            -7.6534157991409302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 26 8.5202371701598167e-04 -1 -2 27
+            -1.2241739779710770e-02</internalNodes>
+          <leafValues>
+            -7.7514898777008057e-01 6.3240152597427368e-01
+            -6.3395208120346069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 28 6.2314196838997304e-05 -1 -2 29
+            -7.1911108493804932e-01</internalNodes>
+          <leafValues>
+            4.4290411472320557e-01 8.0135929584503174e-01
+            -5.3431099653244019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 30 -2.4280339479446411e-02 -1 -2 31
+            3.4558640327304602e-03</internalNodes>
+          <leafValues>
+            -6.7797917127609253e-01 4.9030610918998718e-01
+            -8.8447982072830200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 32 -6.2993327446747571e-05 -1 -2 33
+            -4.6443562023341656e-03</internalNodes>
+          <leafValues>
+            -5.7883417606353760e-01 -8.5878807306289673e-01
+            5.2454602718353271e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 34 -4.0299328247783706e-05 -1 -2 35
+            -3.7485519424080849e-03</internalNodes>
+          <leafValues>
+            -5.2713459730148315e-01 -8.5626190900802612e-01
+            4.8944610357284546e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>10</maxWeakCount>
+      <stageThreshold>-2.3431489467620850e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 36 -3.8377079367637634e-01 -1 -2 37
+            -1.3837030529975891e-01</internalNodes>
+          <leafValues>
+            7.1715021133422852e-01 3.4392359852790833e-01
+            -7.9931277036666870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 38 3.3107071067206562e-04 -1 -2 39
+            -5.1273438148200512e-03</internalNodes>
+          <leafValues>
+            -6.8352431058883667e-01 5.8250617980957031e-01
+            -4.0955001115798950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 40 -2.6100680232048035e-02 -1 -2 41
+            -1.0628979653120041e-03</internalNodes>
+          <leafValues>
+            -4.3713301420211792e-01 7.0680737495422363e-01
+            -2.6817938685417175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 42 -9.7854852676391602e-02 -1 -2 43
+            -1.1829820275306702e-01</internalNodes>
+          <leafValues>
+            7.3940038681030273e-01 6.3814181089401245e-01
+            -3.8721871376037598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 44 -7.5409049168229103e-03 -1 -2 45
+            2.6851659640669823e-03</internalNodes>
+          <leafValues>
+            -4.8803019523620605e-01 3.9083468914031982e-01
+            -6.5561538934707642e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 46 1.6870240215212107e-03 -1 -2 47
+            -3.8136160001158714e-03</internalNodes>
+          <leafValues>
+            -4.9891749024391174e-01 -6.6405588388442993e-01
+            4.0650749206542969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 48 2.0289309322834015e-03 -1 -2 49
+            -7.6308869756758213e-03</internalNodes>
+          <leafValues>
+            -6.9989210367202759e-01 4.3206840753555298e-01
+            -2.9664969444274902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 50 -3.3815231290645897e-04 -1 -2 51
+            7.5163291767239571e-03</internalNodes>
+          <leafValues>
+            -4.6808540821075439e-01 3.6521491408348083e-01
+            -7.6014542579650879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 52 6.1479508876800537e-02 -1 -2 53
+            -4.6286579221487045e-02</internalNodes>
+          <leafValues>
+            5.6990629434585571e-01 2.2625060379505157e-01
+            -4.5330780744552612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 54 4.6903551556169987e-03 -1 -2 55
+            1.8803169950842857e-03</internalNodes>
+          <leafValues>
+            -7.7286708354949951e-01 2.7349120378494263e-01
+            -6.6667830944061279e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>8</maxWeakCount>
+      <stageThreshold>-2.1268370151519775e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 56 -5.5420672893524170e-01 -1 -2 57
+            -6.9329799152910709e-03</internalNodes>
+          <leafValues>
+            -6.0620260238647461e-01 7.8542029857635498e-01
+            -3.5522121191024780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 58 -2.1169960498809814e-02 -1 -2 59
+            -6.7428398132324219e-01</internalNodes>
+          <leafValues>
+            5.2947688102722168e-01 4.6065220236778259e-01
+            -7.0058208703994751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 60 -4.2725078761577606e-02 -1 -2 61
+            -1.0109329596161842e-02</internalNodes>
+          <leafValues>
+            -5.9904807806015015e-01 6.8109220266342163e-01
+            -2.0731879770755768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 62 6.5861130133271217e-03 -1 -2 63
+            -7.6380418613553047e-03</internalNodes>
+          <leafValues>
+            -5.2420848608016968e-01 -7.0169782638549805e-01
+            4.4100138545036316e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 64 -9.7681581974029541e-02 -1 -2 65
+            1.0197360068559647e-02</internalNodes>
+          <leafValues>
+            5.7708740234375000e-01 -9.8518550395965576e-02
+            -8.8111698627471924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 66 -2.5724549777805805e-03 -1 -2 67
+            2.6594230439513922e-03</internalNodes>
+          <leafValues>
+            -8.3233338594436646e-01 3.0995351076126099e-01
+            -8.1609177589416504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 68 -1.0042720241472125e-03 -1 -2 69
+            2.6080000679939985e-03</internalNodes>
+          <leafValues>
+            -4.3558520078659058e-01 3.3566600084304810e-01
+            -8.1889331340789795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 70 4.9724509008228779e-03 -1 -2 71
+            1.2243240140378475e-02</internalNodes>
+          <leafValues>
+            -7.7048182487487793e-01 2.2534200549125671e-01
+            -6.8695551156997681e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>10</maxWeakCount>
+      <stageThreshold>-2.0604379177093506e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 72 -5.7784929871559143e-02 -1 -2 73
+            -1.7517809756100178e-03</internalNodes>
+          <leafValues>
+            -7.0516008138656616e-01 8.5655921697616577e-01
+            -9.2403419315814972e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 74 -1.1522379703819752e-02 -1 -2 75
+            -3.8323760963976383e-03</internalNodes>
+          <leafValues>
+            -4.2749640345573425e-01 7.5913530588150024e-01
+            -1.0894049704074860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 76 -8.0922387540340424e-02 -1 -2 77
+            -6.2537011690437794e-03</internalNodes>
+          <leafValues>
+            -3.1364768743515015e-01 6.9995921850204468e-01
+            -1.1805690079927444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 78 -1.2227860093116760e-01 -1 -2 79
+            -6.4168110489845276e-02</internalNodes>
+          <leafValues>
+            5.2072501182556152e-01 3.9272749423980713e-01
+            -4.2194411158561707e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 80 -5.3712888620793819e-04 -1 -2 81
+            -2.8175620827823877e-03</internalNodes>
+          <leafValues>
+            -4.9524548649787903e-01 4.1350141167640686e-01
+            -3.8919278979301453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 82 -3.6368549335747957e-03 -1 -2 83
+            -1.3223909772932529e-03</internalNodes>
+          <leafValues>
+            6.7615020275115967e-01 4.3426999449729919e-01
+            -3.7642130255699158e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 84 3.7143539520911872e-04 -1 -2 85
+            -5.0255712121725082e-03</internalNodes>
+          <leafValues>
+            -5.5630880594253540e-01 -5.2328592538833618e-01
+            3.4646821022033691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 86 -9.2711612523999065e-05 -1 -2 87
+            1.9847028888761997e-03</internalNodes>
+          <leafValues>
+            -4.9652668833732605e-01 3.3401641249656677e-01
+            -6.2446892261505127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 88 4.7203440219163895e-02 -1 -2 89
+            -6.8562600063160062e-05</internalNodes>
+          <leafValues>
+            5.7562619447708130e-01 2.6172660291194916e-02
+            -6.0849070549011230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 90 7.5034219771623611e-03 -1 -2 91
+            6.3834791071712971e-03</internalNodes>
+          <leafValues>
+            -6.8576759099960327e-01 -1.7312510311603546e-01
+            3.8560429215431213e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-2.3187489509582520e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 92 -1.5584450215101242e-02 -1 -2 93
+            1.4557019807398319e-02</internalNodes>
+          <leafValues>
+            -6.6648960113525391e-01 -4.3745130300521851e-01
+            7.2227817773818970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 94 -5.7889888994395733e-03 -1 -2 95
+            -8.1936769187450409e-02</internalNodes>
+          <leafValues>
+            -4.3183240294456482e-01 6.8467652797698975e-01
+            -2.2546729445457458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 96 -4.2995368130505085e-03 -1 -2 97
+            -1.3736640103161335e-02</internalNodes>
+          <leafValues>
+            -5.2409631013870239e-01 6.1626207828521729e-01
+            -3.5893160104751587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 98 -4.8069912008941174e-03 -1 -2 99
+            -7.7131099998950958e-02</internalNodes>
+          <leafValues>
+            -4.2382389307022095e-01 6.0599362850189209e-01
+            -3.1555330753326416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 100 4.4640208943746984e-04 -1 -2 101
+            3.4841578453779221e-02</internalNodes>
+          <leafValues>
+            -4.9206110835075378e-01 -4.1017889976501465e-02
+            6.1330878734588623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 102 8.2969048526138067e-04 -1 -2 103
+            -7.8510129242204130e-05</internalNodes>
+          <leafValues>
+            -4.5479419827461243e-01 4.0007328987121582e-01
+            -2.0888769626617432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 104 4.6054688282310963e-03 -1 -2 105
+            -7.1904482319951057e-03</internalNodes>
+          <leafValues>
+            -6.7931377887725830e-01 4.7060671448707581e-01
+            -1.4138610661029816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 106 -5.5724480189383030e-03 -1 -2 107
+            -7.0458237314596772e-04</internalNodes>
+          <leafValues>
+            -7.0525509119033813e-01 3.6097851395606995e-01
+            -1.8361540138721466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 108 1.8595060333609581e-02 -1 -2 109
+            5.0072550773620605e-02</internalNodes>
+          <leafValues>
+            4.1765761375427246e-01 -4.1869449615478516e-01
+            2.8186509013175964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 110 -2.0355919376015663e-02 -1 -2 111
+            -2.8686519712209702e-02</internalNodes>
+          <leafValues>
+            -3.6494150757789612e-01 -5.3867787122726440e-01
+            3.4767881035804749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 112 -7.1101690991781652e-05 -1 -2 113
+            2.0686469506472349e-03</internalNodes>
+          <leafValues>
+            -4.0156790614128113e-01 3.2963660359382629e-01
+            -7.0951050519943237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 114 1.1430920567363501e-03 -1 -2 115
+            -8.8636036962270737e-03</internalNodes>
+          <leafValues>
+            4.4172981381416321e-01 1.8426130712032318e-01
+            -4.1275170445442200e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-2.2203750610351562e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 116 -7.7637642621994019e-02 -1 -2 117
+            -8.4830820560455322e-03</internalNodes>
+          <leafValues>
+            -4.9321529269218445e-01 7.8138542175292969e-01
+            -3.6062291264533997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 118 -1.7180460272356868e-03 -1 -2 119
+            2.4740949273109436e-02</internalNodes>
+          <leafValues>
+            -4.7690048813819885e-01 -3.2420080900192261e-01
+            5.9280002117156982e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 120 3.3028100151568651e-03 -1 -2 121
+            -3.4622039645910263e-02</internalNodes>
+          <leafValues>
+            -5.3991597890853882e-01 5.2076727151870728e-01
+            -3.3530798554420471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 122 -7.1505777304992080e-04 -1 -2 123
+            -9.0145105496048927e-03</internalNodes>
+          <leafValues>
+            -4.8981699347496033e-01 -7.7969801425933838e-01
+            3.6586359143257141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 124 -1.0250939521938562e-03 -1 -2 125
+            -5.5693178437650204e-03</internalNodes>
+          <leafValues>
+            -4.6970510482788086e-01 -6.9695621728897095e-01
+            3.5025438666343689e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 126 1.3235070509836078e-03 -1 -2 127
+            -3.3737940248101950e-03</internalNodes>
+          <leafValues>
+            -4.4707980751991272e-01 -5.6195151805877686e-01
+            3.1833809614181519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 128 -6.4095242123585194e-05 -1 -2 129
+            -2.7294119354337454e-03</internalNodes>
+          <leafValues>
+            -3.5473638772964478e-01 4.1285240650177002e-01
+            -3.1416821479797363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 130 6.3087652961257845e-05 -1 -2 131
+            -1.5436099842190742e-02</internalNodes>
+          <leafValues>
+            -3.5946568846702576e-01 -6.1329078674316406e-01
+            3.4301999211311340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 132 -2.1025019232183695e-03 -1 -2 133
+            -1.6849569976329803e-02</internalNodes>
+          <leafValues>
+            -7.6962250471115112e-01 3.6569809913635254e-01
+            -2.1210379898548126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 134 5.6847798987291753e-05 -1 -2 135
+            5.9984489344060421e-03</internalNodes>
+          <leafValues>
+            -4.0466558933258057e-01 2.8503778576850891e-01
+            -5.8756178617477417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 136 6.1389962211251259e-03 -1 -2 137
+            -2.8117469628341496e-04</internalNodes>
+          <leafValues>
+            -8.7189829349517822e-01 2.5182509422302246e-01
+            -3.1868219375610352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 138 -4.5429798774421215e-03 -1 -2 139
+            -3.2167110592126846e-02</internalNodes>
+          <leafValues>
+            -3.6724218726158142e-01 -7.9481202363967896e-01
+            2.8887200355529785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 140 5.0912089645862579e-03 -1 -2 141
+            -1.5173070132732391e-03</internalNodes>
+          <leafValues>
+            -7.1477490663528442e-01 4.4514629244804382e-01
+            -9.5207341015338898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 142 -6.0079508693888783e-04 -1 -2 143
+            4.4868541881442070e-03</internalNodes>
+          <leafValues>
+            -3.6021450161933899e-01 2.8276360034942627e-01
+            -7.2084128856658936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 144 -3.7957848981022835e-03 -1 -2 145
+            -9.1829998418688774e-03</internalNodes>
+          <leafValues>
+            -2.8717440366744995e-01 5.0479042530059814e-01
+            -7.0781037211418152e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>17</maxWeakCount>
+      <stageThreshold>-2.1757249832153320e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 146 -5.5760249495506287e-02 -1 -2 147
+            -5.9436690062284470e-02</internalNodes>
+          <leafValues>
+            -5.5854648351669312e-01 6.8943697214126587e-01
+            -3.7195080518722534e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 148 -5.4637178778648376e-02 -1 -2 149
+            2.3608359694480896e-01</internalNodes>
+          <leafValues>
+            5.3040331602096558e-01 -4.7355309128761292e-01
+            4.6322488784790039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 150 -9.4560505822300911e-03 -1 -2 151
+            -5.3182709962129593e-02</internalNodes>
+          <leafValues>
+            -3.2544779777526855e-01 6.3468569517135620e-01
+            -2.8268361091613770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 152 -1.0638199746608734e-02 -1 -2 153
+            -2.1207019686698914e-02</internalNodes>
+          <leafValues>
+            -5.5776351690292358e-01 3.9049190282821655e-01
+            -4.2111930251121521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 154 -5.6731878430582583e-05 -1 -2 155
+            -4.4976451317779720e-04</internalNodes>
+          <leafValues>
+            -4.1803309321403503e-01 3.7355789542198181e-01
+            -3.9199641346931458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 156 2.7574670966714621e-03 -1 -2 157
+            2.5649419985711575e-03</internalNodes>
+          <leafValues>
+            -7.9104632139205933e-01 1.9258180260658264e-01
+            -7.5344461202621460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 158 -9.4359368085861206e-03 -1 -2 159
+            1.4136210083961487e-03</internalNodes>
+          <leafValues>
+            4.4834750890731812e-01 -3.3878430724143982e-01
+            4.4291919469833374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 160 3.9976350963115692e-03 -1 -2 161
+            -1.5278969658538699e-03</internalNodes>
+          <leafValues>
+            -6.6637581586837769e-01 3.1292399764060974e-01
+            -2.8027990460395813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 162 -3.2376639865105972e-05 -1 -2 163
+            1.6323389718309045e-03</internalNodes>
+          <leafValues>
+            -4.6672090888023376e-01 2.7995559573173523e-01
+            -6.1321508884429932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 164 7.7096219174563885e-03 -1 -2 165
+            -7.8599318861961365e-02</internalNodes>
+          <leafValues>
+            2.0352549850940704e-01 7.2726912796497345e-02
+            -6.8677097558975220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 166 -3.6581400781869888e-03 -1 -2 167
+            -4.2612198740243912e-02</internalNodes>
+          <leafValues>
+            -6.8079459667205811e-01 -8.4551781415939331e-01
+            1.5990570187568665e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 168 -4.8822778626345098e-04 -1 -2 169
+            -4.6951142139732838e-03</internalNodes>
+          <leafValues>
+            -4.7945699095726013e-01 -8.2234281301498413e-01
+            2.0431579649448395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 170 6.1706348787993193e-05 -1 -2 171
+            1.3809910044074059e-02</internalNodes>
+          <leafValues>
+            -3.1742820143699646e-01 3.0769300460815430e-01
+            -4.3544968962669373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 172 -4.2187729850411415e-03 -1 -2 173
+            -3.9540808647871017e-03</internalNodes>
+          <leafValues>
+            6.2499982118606567e-01 1.3225209712982178e-01
+            -3.9745101332664490e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 174 2.2203531116247177e-03 -1 -2 175
+            6.2806582718621939e-05</internalNodes>
+          <leafValues>
+            -6.0045331716537476e-01 -2.2429980337619781e-01
+            2.9768520593643188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 176 2.3292789701372385e-03 -1 -2 177
+            -5.3711822256445885e-03</internalNodes>
+          <leafValues>
+            -7.5982081890106201e-01 2.6484918594360352e-01
+            -2.6005539298057556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 178 6.4782587287481874e-05 -1 -2 179
+            7.6606678776443005e-03</internalNodes>
+          <leafValues>
+            -3.2119300961494446e-01 2.4176409840583801e-01
+            -8.3822727203369141e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>-2.2618789672851562e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 180 -1.4848279766738415e-02 -1 -2 181
+            -1.6066679963842034e-03</internalNodes>
+          <leafValues>
+            -5.3391128778457642e-01 7.6002711057662964e-01
+            -2.1091739833354950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 182 -1.5651920437812805e-01 -1 -2 183
+            -5.5439779534935951e-03</internalNodes>
+          <leafValues>
+            -4.2818549275398254e-01 6.5620750188827515e-01
+            -2.2949840128421783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 184 -1.9448339939117432e-02 -1 -2 185
+            7.6653067953884602e-03</internalNodes>
+          <leafValues>
+            -4.4212520122528076e-01 -3.3950591087341309e-01
+            4.6587219834327698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 186 -2.1142010390758514e-01 -1 -2 187
+            -1.0628429800271988e-01</internalNodes>
+          <leafValues>
+            5.5007970333099365e-01 6.8280947208404541e-01
+            -3.0987739562988281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 188 -5.2653599530458450e-02 -1 -2 189
+            -5.3522300731856376e-05</internalNodes>
+          <leafValues>
+            -3.4818819165229797e-01 5.0566762685775757e-01
+            -2.5229519605636597e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 190 -5.7972650974988937e-03 -1 -2 191
+            -3.7428899668157101e-03</internalNodes>
+          <leafValues>
+            3.0238011479377747e-01 2.2873230278491974e-01
+            -4.8366579413414001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 192 -5.2694038458866999e-05 -1 -2 193
+            -1.1983739677816629e-03</internalNodes>
+          <leafValues>
+            -3.7988960742950439e-01 -6.7442452907562256e-01
+            2.8611260652542114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 194 2.2544799372553825e-02 -1 -2 195
+            3.1783939339220524e-03</internalNodes>
+          <leafValues>
+            4.7565719485282898e-01 -2.8893348574638367e-01
+            5.5509638786315918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 196 3.4742769785225391e-03 -1 -2 197
+            -8.1408787518739700e-03</internalNodes>
+          <leafValues>
+            -5.9826552867889404e-01 -5.5933791399002075e-01
+            2.2349210083484650e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 198 -3.0238809995353222e-03 -1 -2 199
+            -5.9159598313271999e-03</internalNodes>
+          <leafValues>
+            4.5917978882789612e-01 6.2234902381896973e-01
+            -2.4468150734901428e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 200 2.3184430319815874e-03 -1 -2 201
+            7.7198208309710026e-03</internalNodes>
+          <leafValues>
+            -6.0478079319000244e-01 2.1004509925842285e-01
+            -6.4331281185150146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 202 -5.5973320268094540e-03 -1 -2 203
+            2.0320380281191319e-04</internalNodes>
+          <leafValues>
+            -7.1625810861587524e-01 -3.8018029928207397e-01
+            2.1336899697780609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 204 -3.8205389864742756e-03 -1 -2 205
+            4.8883338458836079e-03</internalNodes>
+          <leafValues>
+            -3.5957258939743042e-01 2.6471930742263794e-01
+            -5.8996689319610596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 206 -1.3334590476006269e-03 -1 -2 207
+            -1.5447080368176103e-03</internalNodes>
+          <leafValues>
+            3.2258489727973938e-01 3.6971050500869751e-01
+            -3.1308570504188538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 208 7.5150746852159500e-05 -1 -2 209
+            -1.1108840117231011e-03</internalNodes>
+          <leafValues>
+            -3.4674531221389771e-01 -5.7477539777755737e-01
+            2.9201140999794006e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 210 -1.6881119518075138e-04 -1 -2 211
+            -1.2814450019504875e-04</internalNodes>
+          <leafValues>
+            -3.6041781306266785e-01 3.5043209791183472e-01
+            -2.2014050185680389e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 212 1.9546970725059509e-02 -1 -2 213
+            -1.1061180382966995e-02</internalNodes>
+          <leafValues>
+            4.1295918822288513e-01 2.5962719321250916e-01
+            -3.4875950217247009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 214 1.8147419905290008e-03 -1 -2 215
+            -7.1724010631442070e-03</internalNodes>
+          <leafValues>
+            -5.2019888162612915e-01 2.7452668547630310e-01
+            -2.6828849315643311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 216 2.2158189676702023e-03 -1 -2 217
+            -9.6856858581304550e-03</internalNodes>
+          <leafValues>
+            -5.7340908050537109e-01 -5.8028572797775269e-01
+            1.8564410507678986e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>19</maxWeakCount>
+      <stageThreshold>-2.0994780063629150e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 218 -1.2065219692885876e-02 -1 -2 219
+            -4.9067771434783936e-01</internalNodes>
+          <leafValues>
+            6.1679571866989136e-01 1.4063939452171326e-01
+            -5.5357742309570312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 220 -6.6585717722773552e-03 -1 -2 221
+            1.5827560797333717e-02</internalNodes>
+          <leafValues>
+            -5.1332288980484009e-01 -3.6301520466804504e-01
+            4.3343341350555420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 222 -1.4081180095672607e-02 -1 -2 223
+            -1.2139449827373028e-02</internalNodes>
+          <leafValues>
+            5.4223722219467163e-01 4.4281288981437683e-01
+            -3.4171119332313538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 224 7.8055798076093197e-03 -1 -2 225
+            -7.0759910158813000e-05</internalNodes>
+          <leafValues>
+            -4.8659759759902954e-01 3.4818679094314575e-01
+            -3.2806739211082458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 226 -1.8199630081653595e-02 -1 -2 227
+            -2.5289389304816723e-03</internalNodes>
+          <leafValues>
+            5.6594151258468628e-01 1.1310060322284698e-01
+            -4.0772381424903870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 228 1.0156990028917789e-03 -1 -2 229
+            2.9432660085149109e-04</internalNodes>
+          <leafValues>
+            -5.9842979907989502e-01 2.8439450263977051e-01
+            -3.2190230488777161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 230 2.0865290425717831e-03 -1 -2 231
+            -1.7371569992974401e-03</internalNodes>
+          <leafValues>
+            -7.8285712003707886e-01 3.3585301041603088e-01
+            -2.0582370460033417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 232 -7.0026202592998743e-05 -1 -2 233
+            -1.4891549944877625e-03</internalNodes>
+          <leafValues>
+            -3.9109349250793457e-01 -4.6953418850898743e-01
+            2.7609241008758545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 234 -1.1788429692387581e-02 -1 -2 235
+            -1.5155089786276221e-03</internalNodes>
+          <leafValues>
+            -4.0114149451255798e-01 -7.4290478229522705e-01
+            2.7695629000663757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 236 6.8396717309951782e-02 -1 -2 237
+            -7.6441407203674316e-02</internalNodes>
+          <leafValues>
+            4.5235648751258850e-01 4.2848169803619385e-01
+            -3.1636309623718262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 238 6.8310201168060303e-02 -1 -2 239
+            -6.4508013427257538e-02</internalNodes>
+          <leafValues>
+            5.1404279470443726e-01 1.8081870675086975e-01
+            -3.4217950701713562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 240 -2.8335719835013151e-03 -1 -2 241
+            -9.9732237868010998e-04</internalNodes>
+          <leafValues>
+            -6.9509768486022949e-01 -4.3724590539932251e-01
+            2.0226080715656281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 242 -2.2869910299777985e-01 -1 -2 243
+            2.9855249449610710e-03</internalNodes>
+          <leafValues>
+            6.4662200212478638e-01 8.1149758771061897e-03
+            -6.0210299491882324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 244 -2.9535989742726088e-03 -1 -2 245
+            -2.1225619129836559e-03</internalNodes>
+          <leafValues>
+            -7.2013127803802490e-01 5.0875622034072876e-01
+            -5.9366609901189804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 246 -2.9382819775491953e-03 -1 -2 247
+            -5.8961478061974049e-03</internalNodes>
+          <leafValues>
+            3.9287531375885010e-01 4.1866040229797363e-01
+            -2.5405511260032654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 248 2.5730929337441921e-03 -1 -2 249
+            1.6647739335894585e-02</internalNodes>
+          <leafValues>
+            -5.8707278966903687e-01 1.9208480417728424e-01
+            -6.0388940572738647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 250 2.4041840806603432e-03 -1 -2 251
+            -9.0452830772846937e-04</internalNodes>
+          <leafValues>
+            -5.7192337512969971e-01 3.4860768914222717e-01
+            -1.3049240410327911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 252 4.0814210660755634e-03 -1 -2 253
+            3.3811479806900024e-03</internalNodes>
+          <leafValues>
+            5.1778018474578857e-01 -6.3828541897237301e-03
+            -6.1447817087173462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 254 -2.7499340940266848e-03 -1 -2 255
+            -4.8207710497081280e-03</internalNodes>
+          <leafValues>
+            -6.5407788753509521e-01 -6.0029619932174683e-01
+            1.4374589920043945e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>-2.1254189014434814e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 256 7.9710120335221291e-03 -1 -2 257
+            -9.7160867881029844e-04</internalNodes>
+          <leafValues>
+            -6.1992239952087402e-01 5.4877161979675293e-01
+            -4.0606960654258728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 258 -1.0945869609713554e-02 -1 -2 259
+            -6.1174821108579636e-02</internalNodes>
+          <leafValues>
+            4.6936869621276855e-01 3.0570849776268005e-01
+            -4.4459891319274902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 260 -2.3100150283426046e-03 -1 -2 261
+            -4.7585051506757736e-02</internalNodes>
+          <leafValues>
+            -3.7816441059112549e-01 4.8865839838981628e-01
+            -2.9728868603706360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 262 -2.5944279041141272e-03 -1 -2 263
+            -3.9469371549785137e-03</internalNodes>
+          <leafValues>
+            -5.4405367374420166e-01 3.6382490396499634e-01
+            -3.0469849705696106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 264 3.1871569808572531e-04 -1 -2 265
+            -2.6655721012502909e-03</internalNodes>
+          <leafValues>
+            -4.6822971105575562e-01 3.3131968975067139e-01
+            -2.9918238520622253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 266 -3.9534650743007660e-02 -1 -2 267
+            -9.4085611635819077e-04</internalNodes>
+          <leafValues>
+            -3.5316830873489380e-01 4.4447100162506104e-01
+            -1.1088660359382629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 268 6.9526307925116271e-05 -1 -2 269
+            -9.6976682543754578e-03</internalNodes>
+          <leafValues>
+            -3.9403268694877625e-01 5.7181888818740845e-01
+            -1.6370950266718864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 270 3.9469040930271149e-02 -1 -2 271
+            -8.2811042666435242e-03</internalNodes>
+          <leafValues>
+            6.9152122735977173e-01 1.3349990546703339e-01
+            -4.7064480185508728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 272 -4.3219728395342827e-03 -1 -2 273
+            -5.5436040274798870e-03</internalNodes>
+          <leafValues>
+            3.8239258527755737e-01 1.5645879507064819e-01
+            -4.1088208556175232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 274 -5.9953341406071559e-05 -1 -2 275
+            -5.9089371934533119e-03</internalNodes>
+          <leafValues>
+            -3.9221799373626709e-01 -5.9083867073059082e-01
+            2.7924481034278870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 276 -4.4721391052007675e-02 -1 -2 277
+            4.1267018765211105e-02</internalNodes>
+          <leafValues>
+            4.1454491019248962e-01 -3.2242009043693542e-01
+            3.7849879264831543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 278 5.6728709751041606e-05 -1 -2 279
+            -6.2427870929241180e-02</internalNodes>
+          <leafValues>
+            -3.2228040695190430e-01 -5.9666448831558228e-01
+            2.8915780782699585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 280 -5.6994128972291946e-03 -1 -2 281
+            7.5202910229563713e-03</internalNodes>
+          <leafValues>
+            3.7499341368675232e-01 -2.8132459521293640e-01
+            5.0988858938217163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 282 -3.3640549518167973e-03 -1 -2 283
+            -6.8076648749411106e-03</internalNodes>
+          <leafValues>
+            -6.3978207111358643e-01 -7.3105818033218384e-01
+            1.4475250244140625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 284 1.2633459642529488e-02 -1 -2 285
+            -2.9199919663369656e-03</internalNodes>
+          <leafValues>
+            -7.7725297212600708e-01 2.3258599638938904e-01
+            -2.0490600168704987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 286 -3.0582249164581299e-02 -1 -2 287
+            -2.7796169742941856e-03</internalNodes>
+          <leafValues>
+            -6.5738821029663086e-01 -5.4888349771499634e-01
+            1.3837890326976776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 288 -7.6163080520927906e-03 -1 -2 289
+            -1.8409560434520245e-03</internalNodes>
+          <leafValues>
+            -3.5912349820137024e-01 2.2404469549655914e-01
+            -3.7881860136985779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 290 -3.9200261235237122e-02 -1 -2 291
+            -2.2543789818882942e-03</internalNodes>
+          <leafValues>
+            5.0090551376342773e-01 3.1364008784294128e-01
+            -2.2131860256195068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 292 2.3894659243524075e-03 -1 -2 293
+            -1.0725490283221006e-03</internalNodes>
+          <leafValues>
+            -5.8699512481689453e-01 4.7141209244728088e-01
+            -3.2570488750934601e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 294 8.9095337898470461e-05 -1 -2 295
+            1.6920049674808979e-03</internalNodes>
+          <leafValues>
+            -3.0444309115409851e-01 3.0280891060829163e-01
+            -3.8902729749679565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 296 1.1784000322222710e-02 -1 -2 297
+            3.9335917681455612e-03</internalNodes>
+          <leafValues>
+            -6.8993437290191650e-01 -6.7763939499855042e-02
+            4.6499788761138916e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>22</maxWeakCount>
+      <stageThreshold>-2.0614759922027588e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 298 1.1430840007960796e-02 -1 -2 299
+            -3.2242920249700546e-02</internalNodes>
+          <leafValues>
+            -3.9274570345878601e-01 6.5568798780441284e-01
+            -3.1068810820579529e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 300 -1.8382760463282466e-03 -1 -2 301
+            -1.0764399915933609e-01</internalNodes>
+          <leafValues>
+            -4.0825068950653076e-01 4.3280079960823059e-01
+            -4.2263451218605042e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 302 -2.3866090923547745e-03 -1 -2 303
+            8.6586214601993561e-03</internalNodes>
+          <leafValues>
+            -4.6435201168060303e-01 -4.0673071146011353e-01
+            4.1267868876457214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 304 -1.6437229933217168e-03 -1 -2 305
+            -9.8511137068271637e-02</internalNodes>
+          <leafValues>
+            -2.1344049274921417e-01 6.8432319164276123e-01
+            -9.7035013139247894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 306 4.4292360544204712e-03 -1 -2 307
+            4.6966210938990116e-03</internalNodes>
+          <leafValues>
+            -3.9498910307884216e-01 -1.1345980316400528e-01
+            4.9681991338729858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 308 -8.8480701670050621e-03 -1 -2 309
+            -6.7258379422128201e-03</internalNodes>
+          <leafValues>
+            -3.1293100118637085e-01 -6.1635792255401611e-01
+            3.1764769554138184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 310 2.0052040927112103e-03 -1 -2 311
+            -1.3407340273261070e-02</internalNodes>
+          <leafValues>
+            3.1724271178245544e-01 1.9735060632228851e-01
+            -3.7199181318283081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 312 -4.4199679978191853e-03 -1 -2 313
+            -3.2800938934087753e-02</internalNodes>
+          <leafValues>
+            -5.7164478302001953e-01 3.0599930882453918e-01
+            -1.7397969961166382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 314 4.9407979531679302e-05 -1 -2 315
+            4.1550169698894024e-03</internalNodes>
+          <leafValues>
+            -2.8270530700683594e-01 2.9686808586120605e-01
+            -4.8494309186935425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 316 -7.5589967309497297e-05 -1 -2 317
+            -3.2147730235010386e-03</internalNodes>
+          <leafValues>
+            -3.8531139492988586e-01 -6.3306808471679688e-01
+            2.3434750735759735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 318 1.6021779738366604e-03 -1 -2 319
+            -1.9478019326925278e-02</internalNodes>
+          <leafValues>
+            -2.9579049348831177e-01 -4.9625208973884583e-01
+            2.6092579960823059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 320 -2.5193750858306885e-02 -1 -2 321
+            -4.6487729996442795e-02</internalNodes>
+          <leafValues>
+            3.9384880661964417e-01 2.2168830037117004e-01
+            -2.9691740870475769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 322 4.3414267711341381e-03 -1 -2 323
+            -2.4886759929358959e-03</internalNodes>
+          <leafValues>
+            -6.7661178112030029e-01 2.0509929955005646e-01
+            -2.9771140217781067e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 324 -5.8827269822359085e-03 -1 -2 325
+            9.0498890494927764e-04</internalNodes>
+          <leafValues>
+            -6.1301797628402710e-01 -3.4023219347000122e-01
+            1.8168209493160248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 326 -9.8338901996612549e-02 -1 -2 327
+            5.6141808629035950e-02</internalNodes>
+          <leafValues>
+            4.7729569673538208e-01 -2.2904439270496368e-01
+            3.4410089254379272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 328 -5.5787130258977413e-03 -1 -2 329
+            1.5108759980648756e-03</internalNodes>
+          <leafValues>
+            -3.5910171270370483e-01 2.4900430440902710e-01
+            -4.3798071146011353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 330 -6.0129738412797451e-03 -1 -2 331
+            -7.9341192031279206e-04</internalNodes>
+          <leafValues>
+            3.1164181232452393e-01 2.6759660243988037e-01
+            -3.6802908778190613e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 332 6.1855330131947994e-03 -1 -2 333
+            -7.3785060085356236e-03</internalNodes>
+          <leafValues>
+            -7.2153317928314209e-01 -5.3714382648468018e-01
+            1.3824890553951263e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 334 -6.7488732747733593e-04 -1 -2 335
+            -1.3102099765092134e-03</internalNodes>
+          <leafValues>
+            3.7406051158905029e-01 1.9003790616989136e-01
+            -3.1632271409034729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 336 4.9453211249783635e-04 -1 -2 337
+            1.2824690202251077e-03</internalNodes>
+          <leafValues>
+            -2.3283170163631439e-01 3.0463808774948120e-01
+            -4.8092108964920044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 338 -2.2624820470809937e-02 -1 -2 339
+            4.3685249984264374e-03</internalNodes>
+          <leafValues>
+            -6.8783479928970337e-01 1.2403090298175812e-01
+            -7.9220730066299438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 340 5.6756488047540188e-03 -1 -2 341
+            -8.1769213080406189e-02</internalNodes>
+          <leafValues>
+            1.7611420154571533e-01 3.8942161202430725e-01
+            -4.5094010233879089e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>24</maxWeakCount>
+      <stageThreshold>-1.9795049428939819e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 342 -2.0003549754619598e-02 -1 -2 343
+            -3.2621208578348160e-02</internalNodes>
+          <leafValues>
+            -5.6650751829147339e-01 5.0807082653045654e-01
+            -4.5345708727836609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 344 1.0668139904737473e-02 -1 -2 345
+            -1.6276689246296883e-02</internalNodes>
+          <leafValues>
+            -3.2316839694976807e-01 6.0189497470855713e-01
+            -2.4059510231018066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 346 -2.8211208991706371e-03 -1 -2 347
+            -1.4291180297732353e-02</internalNodes>
+          <leafValues>
+            -4.7181150317192078e-01 5.1280087232589722e-01
+            -1.0744000226259232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 348 1.0120410006493330e-03 -1 -2 349
+            -5.9822672046720982e-03</internalNodes>
+          <leafValues>
+            -3.8844698667526245e-01 4.6928858757019043e-01
+            -9.1355919837951660e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 350 -2.4705699179321527e-03 -1 -2 351
+            2.4079859722405672e-03</internalNodes>
+          <leafValues>
+            -4.5964410901069641e-01 2.1830670535564423e-01
+            -5.9373402595520020e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 352 -1.4312269631773233e-03 -1 -2 353
+            2.9141810955479741e-04</internalNodes>
+          <leafValues>
+            -2.4731670320034027e-01 -2.5972241163253784e-01
+            3.8206368684768677e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 354 -3.2818811014294624e-03 -1 -2 355
+            -1.0365940397605300e-03</internalNodes>
+          <leafValues>
+            -7.7180129289627075e-01 2.3569859564304352e-01
+            -2.2067700326442719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 356 -2.2078400943428278e-03 -1 -2 357
+            3.5239339340478182e-03</internalNodes>
+          <leafValues>
+            3.0886119604110718e-01 -2.8496000170707703e-01
+            4.7544300556182861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 358 -6.1774807982146740e-03 -1 -2 359
+            -3.2023619860410690e-03</internalNodes>
+          <leafValues>
+            -7.0318382978439331e-01 -5.1361310482025146e-01
+            1.5656259655952454e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 360 -8.7003601947799325e-04 -1 -2 361
+            -3.8079950027167797e-03</internalNodes>
+          <leafValues>
+            -2.9925128817558289e-01 5.5215638875961304e-01
+            -8.0608041025698185e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 362 4.9994210712611675e-03 -1 -2 363
+            -1.0323170572519302e-03</internalNodes>
+          <leafValues>
+            -4.3541741371154785e-01 5.4992151260375977e-01
+            -5.0770761445164680e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 364 6.9215619005262852e-03 -1 -2 365
+            -8.1578325480222702e-03</internalNodes>
+          <leafValues>
+            3.3900010585784912e-01 3.4354889392852783e-01
+            -2.4483889341354370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 366 -1.6159559600055218e-03 -1 -2 367
+            4.7165839932858944e-03</internalNodes>
+          <leafValues>
+            -7.4653702974319458e-01 1.1855059862136841e-01
+            -7.1803867816925049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 368 -1.6093119978904724e-02 -1 -2 369
+            -5.9861610643565655e-03</internalNodes>
+          <leafValues>
+            -3.2987210154533386e-01 3.1263980269432068e-01
+            -2.3194029927253723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 370 6.4122617244720459e-02 -1 -2 371
+            2.1518159657716751e-02</internalNodes>
+          <leafValues>
+            4.6239149570465088e-01 -2.4277320504188538e-01
+            4.0963909029960632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 372 -2.8541380167007446e-01 -1 -2 373
+            2.7372559998184443e-04</internalNodes>
+          <leafValues>
+            4.4521799683570862e-01 -4.7307610511779785e-01
+            7.6739721000194550e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 374 -6.4039281569421291e-03 -1 -2 375
+            1.4279670082032681e-02</internalNodes>
+          <leafValues>
+            -5.6167787313461304e-01 -6.7311890423297882e-02
+            4.3806758522987366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 376 -1.3179860077798367e-02 -1 -2 377
+            6.6828072071075439e-02</internalNodes>
+          <leafValues>
+            -6.7672669887542725e-01 -3.2182909548282623e-02
+            5.1308721303939819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 378 6.3021448440849781e-03 -1 -2 379
+            -1.6806010389700532e-03</internalNodes>
+          <leafValues>
+            -2.0082660019397736e-01 -5.1767241954803467e-01
+            3.8576510548591614e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 380 -1.5057720011100173e-03 -1 -2 381
+            1.1699240421876311e-03</internalNodes>
+          <leafValues>
+            3.9358091354370117e-01 -2.5579568743705750e-01
+            3.1927299499511719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 382 7.2735180146992207e-03 -1 -2 383
+            7.8693883551750332e-05</internalNodes>
+          <leafValues>
+            -7.1667242050170898e-01 -1.8908829987049103e-01
+            2.3849080502986908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 384 1.9624589476734400e-03 -1 -2 385
+            -3.1472831033170223e-03</internalNodes>
+          <leafValues>
+            -5.1583772897720337e-01 4.8033049702644348e-01
+            -3.6237910389900208e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 386 5.0133569166064262e-03 -1 -2 387
+            -6.5994369797408581e-03</internalNodes>
+          <leafValues>
+            -5.2729338407516479e-01 -6.9400531053543091e-01
+            1.2275890260934830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 388 -4.2700361460447311e-02 -1 -2 389
+            -3.5096149076707661e-05</internalNodes>
+          <leafValues>
+            -6.8218547105789185e-01 1.2160310149192810e-01
+            -4.2142289876937866e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>24</maxWeakCount>
+      <stageThreshold>-1.9048260450363159e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 390 8.7128365412354469e-03 -1 -2 391
+            -4.0675927884876728e-03</internalNodes>
+          <leafValues>
+            -4.4048839807510376e-01 6.0030102729797363e-01
+            -2.6042649149894714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 392 -8.3933398127555847e-02 -1 -2 393
+            -2.2626180201768875e-02</internalNodes>
+          <leafValues>
+            -3.7943989038467407e-01 5.2529489994049072e-01
+            -3.2733321189880371e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 394 -3.5725389607250690e-03 -1 -2 395
+            -1.6297569964081049e-03</internalNodes>
+          <leafValues>
+            -2.6030939817428589e-01 4.8434230685234070e-01
+            -3.8363268971443176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 396 -8.0011576414108276e-02 -1 -2 397
+            -9.6061453223228455e-02</internalNodes>
+          <leafValues>
+            3.9579561352729797e-01 4.2874181270599365e-01
+            -2.9096639156341553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 398 -9.3183852732181549e-03 -1 -2 399
+            9.2205153778195381e-03</internalNodes>
+          <leafValues>
+            -3.9325499534606934e-01 -2.9857379198074341e-01
+            3.1733301281929016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 400 2.3208750411868095e-02 -1 -2 401
+            1.6389730153605342e-03</internalNodes>
+          <leafValues>
+            3.9295229315757751e-01 -5.4035997390747070e-01
+            -2.1836880594491959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 402 2.8872499242424965e-03 -1 -2 403
+            4.7465260140597820e-03</internalNodes>
+          <leafValues>
+            -7.8172737360000610e-01 1.4474189281463623e-01
+            -6.4237701892852783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 404 -5.7432148605585098e-03 -1 -2 405
+            -8.5324952378869057e-03</internalNodes>
+          <leafValues>
+            -6.5556287765502930e-01 2.2090309858322144e-01
+            -2.5790300965309143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 406 -8.8752172887325287e-03 -1 -2 407
+            -7.7129527926445007e-03</internalNodes>
+          <leafValues>
+            4.6596860885620117e-01 2.5279781222343445e-01
+            -2.6170450448989868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 408 7.6909800991415977e-03 -1 -2 409
+            2.6657560374587774e-03</internalNodes>
+          <leafValues>
+            -5.9350818395614624e-01 1.6969729959964752e-01
+            -5.4123950004577637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 410 -4.4685939792543650e-04 -1 -2 411
+            -1.5998890157788992e-03</internalNodes>
+          <leafValues>
+            -3.0383870005607605e-01 -5.4817748069763184e-01
+            2.4971559643745422e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 412 1.9368670182302594e-03 -1 -2 413
+            -2.4878541007637978e-03</internalNodes>
+          <leafValues>
+            -6.3200348615646362e-01 4.7051379084587097e-01
+            -4.5187219977378845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 414 -2.8134910389780998e-03 -1 -2 415
+            -1.4107710449025035e-03</internalNodes>
+          <leafValues>
+            3.9270851016044617e-01 1.8017080426216125e-01
+            -2.5714579224586487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 416 -6.9013070315122604e-03 -1 -2 417
+            -1.1458620429039001e-03</internalNodes>
+          <leafValues>
+            -5.3386241197586060e-01 2.8174358606338501e-01
+            -1.6080249845981598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 418 9.2800445854663849e-03 -1 -2 419
+            -4.1281301528215408e-02</internalNodes>
+          <leafValues>
+            -3.0028960108757019e-01 -6.2409067153930664e-01
+            2.0549909770488739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 420 -3.5625360906124115e-02 -1 -2 421
+            -4.1647539474070072e-03</internalNodes>
+          <leafValues>
+            -5.2529340982437134e-01 -6.3538008928298950e-01
+            1.2846650183200836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 422 -9.5598259940743446e-04 -1 -2 423
+            -8.9347851462662220e-04</internalNodes>
+          <leafValues>
+            2.6505509018898010e-01 1.8266810476779938e-01
+            -3.7531790137290955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 424 2.5431478861719370e-03 -1 -2 425
+            -1.5853889286518097e-02</internalNodes>
+          <leafValues>
+            -6.1057221889495850e-01 3.0754768848419189e-01
+            -9.8143920302391052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 426 -4.1315760463476181e-02 -1 -2 427
+            -6.8226549774408340e-04</internalNodes>
+          <leafValues>
+            4.9247589707374573e-01 6.2975943088531494e-02
+            -4.2634299397468567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 428 6.3098431564867496e-04 -1 -2 429
+            -2.8946860693395138e-03</internalNodes>
+          <leafValues>
+            3.1397339701652527e-01 2.8590971231460571e-01
+            -2.5623229146003723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 430 -1.0244140401482582e-02 -1 -2 431
+            -1.6979850828647614e-02</internalNodes>
+          <leafValues>
+            -6.9737482070922852e-01 -7.3125731945037842e-01
+            1.0389179736375809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 432 -7.0198569446802139e-03 -1 -2 433
+            -6.0688778758049011e-03</internalNodes>
+          <leafValues>
+            -3.5070639848709106e-01 -5.3395807743072510e-01
+            1.7334850132465363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 434 -9.6911415457725525e-03 -1 -2 435
+            8.5460003465414047e-03</internalNodes>
+          <leafValues>
+            5.6399798393249512e-01 -2.4716490507125854e-01
+            1.8216520547866821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 436 -4.9479231238365173e-03 -1 -2 437
+            1.9269150216132402e-03</internalNodes>
+          <leafValues>
+            -2.8333988785743713e-01 -6.8196073174476624e-02
+            3.7787199020385742e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>28</maxWeakCount>
+      <stageThreshold>-1.9407349824905396e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 438 -2.8639819473028183e-02 -1 -2 439
+            -4.2176660150289536e-02</internalNodes>
+          <leafValues>
+            -3.7718260288238525e-01 7.2298699617385864e-01
+            -7.6141163706779480e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 440 -2.2537210024893284e-03 -1 -2 441
+            -3.0683329328894615e-02</internalNodes>
+          <leafValues>
+            -3.2727459073066711e-01 5.1505237817764282e-01
+            -2.2235199809074402e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 442 -1.2341269850730896e-01 -1 -2 443
+            -2.3674150928854942e-02</internalNodes>
+          <leafValues>
+            4.4699010252952576e-01 3.4708538651466370e-01
+            -3.1773900985717773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 444 3.1951239798218012e-03 -1 -2 445
+            -1.4915530337020755e-03</internalNodes>
+          <leafValues>
+            -4.9775049090385437e-01 2.6384419202804565e-01
+            -3.8912549614906311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 446 8.8097527623176575e-04 -1 -2 447
+            -5.8355771005153656e-02</internalNodes>
+          <leafValues>
+            -4.0939790010452271e-01 3.2287618517875671e-01
+            -2.3045599460601807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 448 5.1132370717823505e-03 -1 -2 449
+            -4.5418320223689079e-03</internalNodes>
+          <leafValues>
+            -5.1353681087493896e-01 5.3011757135391235e-01
+            -3.0649330466985703e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 450 1.6811339883133769e-03 -1 -2 451
+            2.8129699639976025e-03</internalNodes>
+          <leafValues>
+            -5.3161472082138062e-01 -6.7524053156375885e-02
+            3.8542249798774719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 452 2.1835418883711100e-03 -1 -2 453
+            -2.4335379712283611e-03</internalNodes>
+          <leafValues>
+            -6.4298832416534424e-01 -6.6313308477401733e-01
+            1.3882370293140411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 454 3.0736608896404505e-03 -1 -2 455
+            -9.6425544470548630e-03</internalNodes>
+          <leafValues>
+            -6.3433158397674561e-01 3.8696160912513733e-01
+            -6.8737797439098358e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 456 -7.2082108817994595e-03 -1 -2 457
+            -8.0191977322101593e-03</internalNodes>
+          <leafValues>
+            1.6121250391006470e-01 3.8011130690574646e-01
+            -4.1397979855537415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 458 -7.2479159571230412e-03 -1 -2 459
+            -2.2631640732288361e-01</internalNodes>
+          <leafValues>
+            2.4351879954338074e-01 6.0667949914932251e-01
+            -2.2521880269050598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 460 -7.0091613451950252e-05 -1 -2 461
+            -1.8161399662494659e-01</internalNodes>
+          <leafValues>
+            1.7115320265293121e-01 5.2725982666015625e-01
+            -3.5247540473937988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 462 -9.4038434326648712e-03 -1 -2 463
+            -2.1289030555635691e-03</internalNodes>
+          <leafValues>
+            3.4970518946647644e-01 5.5878698825836182e-02
+            -4.9816590547561646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 464 -5.1798550412058830e-03 -1 -2 465
+            -6.5030192490667105e-04</internalNodes>
+          <leafValues>
+            -6.3095641136169434e-01 3.5856458544731140e-01
+            -7.8281052410602570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 466 -1.0555930435657501e-02 -1 -2 467
+            -5.1852981559932232e-03</internalNodes>
+          <leafValues>
+            -5.5502831935882568e-01 3.5548681020736694e-01
+            -6.8892292678356171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 468 -7.8725479543209076e-03 -1 -2 469
+            -6.5342970192432404e-03</internalNodes>
+          <leafValues>
+            -4.8596179485321045e-01 2.1178959310054779e-01
+            -2.3174080252647400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 470 -1.3909920118749142e-02 -1 -2 471
+            1.5418450348079205e-03</internalNodes>
+          <leafValues>
+            5.9936982393264771e-01 -9.5086917281150818e-03
+            -6.4796131849288940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 472 -1.1549900518730283e-03 -1 -2 473
+            -3.2687030732631683e-02</internalNodes>
+          <leafValues>
+            -2.7501720190048218e-01 -6.7336207628250122e-01
+            1.9520400464534760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 474 -2.6422590017318726e-01 -1 -2 475
+            6.9438670761883259e-03</internalNodes>
+          <leafValues>
+            3.6986869573593140e-01 -3.0029740929603577e-01
+            1.4998969435691833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 476 -1.2077920138835907e-02 -1 -2 477
+            -1.3986700214445591e-03</internalNodes>
+          <leafValues>
+            4.1644129157066345e-01 4.1248729825019836e-01
+            -1.9533659517765045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 478 1.3138339854776859e-02 -1 -2 479
+            7.2417110204696655e-03</internalNodes>
+          <leafValues>
+            -6.4204931259155273e-01 1.1359360069036484e-01
+            -7.3838871717453003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 480 -7.4837901629507542e-03 -1 -2 481
+            6.8022231571376324e-03</internalNodes>
+          <leafValues>
+            -6.9246298074722290e-01 9.2873439192771912e-02
+            -6.0047471523284912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 482 4.5322909951210022e-01 -1 -2 483
+            -5.5721630342304707e-03</internalNodes>
+          <leafValues>
+            5.6260532140731812e-01 7.7820159494876862e-02
+            -3.3990600705146790e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 484 3.1583961099386215e-02 -1 -2 485
+            -5.7926177978515625e-03</internalNodes>
+          <leafValues>
+            3.2292670011520386e-01 1.5534450113773346e-01
+            -3.5717839002609253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 486 -7.6025379821658134e-03 -1 -2 487
+            9.5151038840413094e-04</internalNodes>
+          <leafValues>
+            -5.1859498023986816e-01 -2.9570670798420906e-02
+            4.6027511358261108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 488 1.9723300356417894e-03 -1 -2 489
+            2.3158260155469179e-03</internalNodes>
+          <leafValues>
+            3.6926651000976562e-01 -2.1299740672111511e-01
+            2.6948541402816772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 490 2.1179600153118372e-03 -1 -2 491
+            -2.6946600992232561e-03</internalNodes>
+          <leafValues>
+            -4.8369500041007996e-01 1.8545660376548767e-01
+            -2.9411968588829041e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 492 5.8865409344434738e-02 -1 -2 493
+            -6.8408921360969543e-03</internalNodes>
+          <leafValues>
+            -4.6770378947257996e-01 -6.6371321678161621e-01
+            1.2721349298954010e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.8931059837341309e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 494 -1.2766489759087563e-02 -1 -2 495
+            3.7821640726178885e-03</internalNodes>
+          <leafValues>
+            -3.7968099117279053e-01 -1.6001829504966736e-01
+            6.1953288316726685e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 496 -3.3049881458282471e-02 -1 -2 497
+            4.5050241053104401e-02</internalNodes>
+          <leafValues>
+            -3.6825481057167053e-01 9.3770343810319901e-03
+            7.1570581197738647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 498 -3.5275409463793039e-03 -1 -2 499
+            2.2250709589570761e-03</internalNodes>
+          <leafValues>
+            -3.7336608767509460e-01 -6.6712491214275360e-02
+            4.9906119704246521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 500 1.3609490124508739e-03 -1 -2 501
+            -2.9087859392166138e-01</internalNodes>
+          <leafValues>
+            1.7162929475307465e-01 3.6158901453018188e-01
+            -5.0871372222900391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 502 3.3148950897157192e-03 -1 -2 503
+            -8.8641437469050288e-04</internalNodes>
+          <leafValues>
+            -7.1788138151168823e-01 2.5713619589805603e-01
+            -1.7978949844837189e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 504 1.1313590221107006e-03 -1 -2 505
+            -3.0621800106018782e-03</internalNodes>
+          <leafValues>
+            3.5387420654296875e-01 3.0790808796882629e-01
+            -3.1217241287231445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 506 2.5443620979785919e-03 -1 -2 507
+            -6.7088878713548183e-03</internalNodes>
+          <leafValues>
+            -5.6788551807403564e-01 2.1222899854183197e-01
+            -2.6821109652519226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 508 -1.6446809470653534e-01 -1 -2 509
+            4.0828108787536621e-02</internalNodes>
+          <leafValues>
+            4.9016961455345154e-01 -3.1217470765113831e-01
+            2.4748149514198303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 510 -3.6051510833203793e-03 -1 -2 511
+            -2.3608640767633915e-03</internalNodes>
+          <leafValues>
+            3.4355860948562622e-01 2.6566460728645325e-01
+            -2.8644719719886780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 512 1.2965350179001689e-03 -1 -2 513
+            6.0111000202596188e-03</internalNodes>
+          <leafValues>
+            -2.9317760467529297e-01 2.1941700577735901e-01
+            -6.0014218091964722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 514 -6.1628420371562243e-04 -1 -2 515
+            2.0573718938976526e-03</internalNodes>
+          <leafValues>
+            -3.1292331218719482e-01 2.8763169050216675e-01
+            -3.7320709228515625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 516 -7.7166007831692696e-03 -1 -2 517
+            -2.8222459368407726e-03</internalNodes>
+          <leafValues>
+            -7.1683251857757568e-01 4.2501831054687500e-01
+            -5.3294889628887177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 518 -7.3861207056324929e-05 -1 -2 519
+            5.8680498041212559e-03</internalNodes>
+          <leafValues>
+            1.4903450012207031e-01 -5.8436650037765503e-01
+            1.0724759846925735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 520 -7.9013723880052567e-03 -1 -2 521
+            2.7825690340250731e-03</internalNodes>
+          <leafValues>
+            -3.4319949150085449e-01 1.7655360698699951e-01
+            -6.1473757028579712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 522 3.2751538674347103e-04 -1 -2 523
+            3.0700899660587311e-02</internalNodes>
+          <leafValues>
+            -3.3837568759918213e-01 1.8566130101680756e-01
+            -5.3450268507003784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 524 5.6932470761239529e-03 -1 -2 525
+            2.1375140547752380e-01</internalNodes>
+          <leafValues>
+            -5.1750451326370239e-01 1.2332399934530258e-01
+            -6.4288139343261719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 526 -4.4024959206581116e-03 -1 -2 527
+            -4.5719969784840941e-04</internalNodes>
+          <leafValues>
+            5.8535677194595337e-01 2.3368820548057556e-01
+            -1.9039009511470795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 528 -4.2587839998304844e-03 -1 -2 529
+            -2.3462621029466391e-03</internalNodes>
+          <leafValues>
+            -5.1190847158432007e-01 -4.7164770960807800e-01
+            1.4783400297164917e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 530 -6.5065571106970310e-05 -1 -2 531
+            -5.5082160979509354e-03</internalNodes>
+          <leafValues>
+            -2.9886341094970703e-01 -4.8508960008621216e-01
+            2.0014910399913788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 532 1.8942790105938911e-02 -1 -2 533
+            6.9123771972954273e-03</internalNodes>
+          <leafValues>
+            3.1028950214385986e-01 -2.8701239824295044e-01
+            2.0534069836139679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 534 8.1696882843971252e-03 -1 -2 535
+            1.0069769807159901e-02</internalNodes>
+          <leafValues>
+            4.5810830593109131e-01 -2.4175919592380524e-01
+            1.7593820393085480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 536 2.1663580555468798e-03 -1 -2 537
+            1.0505730286240578e-02</internalNodes>
+          <leafValues>
+            -4.9877908825874329e-01 1.6231280565261841e-01
+            -4.2988869547843933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 538 5.7576788822188973e-04 -1 -2 539
+            -3.0608899891376495e-02</internalNodes>
+          <leafValues>
+            -3.1012570858001709e-01 -7.4064302444458008e-01
+            1.6217179596424103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 540 -1.3430659659206867e-02 -1 -2 541
+            1.1859040241688490e-03</internalNodes>
+          <leafValues>
+            4.5505639910697937e-01 -2.7227258682250977e-01
+            2.2475010156631470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 542 -4.9311347538605332e-04 -1 -2 543
+            -2.4509918875992298e-03</internalNodes>
+          <leafValues>
+            -3.9598318934440613e-01 2.5004211068153381e-01
+            -1.6140510141849518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 544 1.3641949743032455e-02 -1 -2 545
+            -3.6733329296112061e-02</internalNodes>
+          <leafValues>
+            -6.4525490999221802e-01 3.4197059273719788e-01
+            -6.5968327224254608e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>29</maxWeakCount>
+      <stageThreshold>-1.9677840471267700e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 1 546 1.3613830087706447e-03 -1 -2 547
+            1.2211060151457787e-02</internalNodes>
+          <leafValues>
+            -3.4383928775787354e-01 -4.0358600020408630e-01
+            5.7873630523681641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 548 3.2929528970271349e-03 -1 -2 549
+            -2.4831980466842651e-02</internalNodes>
+          <leafValues>
+            -2.2164349257946014e-01 5.4256910085678101e-01
+            -4.7585600614547729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 550 -3.4081530570983887e-01 -1 -2 551
+            6.0929641127586365e-02</internalNodes>
+          <leafValues>
+            5.3438740968704224e-01 -2.6015359163284302e-01
+            3.7626558542251587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 552 -1.4399300562217832e-03 -1 -2 553
+            -7.5711178779602051e-01</internalNodes>
+          <leafValues>
+            -4.1635149717330933e-01 4.7764539718627930e-01
+            -1.2374229729175568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 554 -5.9891431592404842e-03 -1 -2 555
+            -8.9398561976850033e-04</internalNodes>
+          <leafValues>
+            2.1848620474338531e-01 1.7726029455661774e-01
+            -5.4815018177032471e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 556 2.9013510793447495e-03 -1 -2 557
+            4.4361278414726257e-03</internalNodes>
+          <leafValues>
+            -5.6709182262420654e-01 1.4183780550956726e-01
+            -5.8784419298171997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 558 -5.3319290600484237e-05 -1 -2 559
+            2.5481029879301786e-03</internalNodes>
+          <leafValues>
+            -3.4821888804435730e-01 1.9745320081710815e-01
+            -5.5979222059249878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 560 7.4882939457893372e-02 -1 -2 561
+            4.8816308379173279e-02</internalNodes>
+          <leafValues>
+            4.6647951006889343e-01 -2.2575210034847260e-01
+            3.2325819134712219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 562 -3.9128339849412441e-03 -1 -2 563
+            -1.3820629566907883e-02</internalNodes>
+          <leafValues>
+            -5.9772872924804688e-01 2.6031211018562317e-01
+            -2.0211410522460938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 564 9.4047200400382280e-04 -1 -2 565
+            -4.6419431455433369e-03</internalNodes>
+          <leafValues>
+            -3.4005248546600342e-01 -4.5187801122665405e-01
+            2.1054859459400177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 566 -3.1960941851139069e-02 -1 -2 567
+            -1.2651160068344325e-04</internalNodes>
+          <leafValues>
+            -2.0826019346714020e-01 3.8553190231323242e-01
+            -2.3116420209407806e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 568 -5.0413709133863449e-02 -1 -2 569
+            -2.0950778853148222e-03</internalNodes>
+          <leafValues>
+            2.2846159338951111e-01 3.2639551162719727e-01
+            -3.4385430812835693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 570 -1.1017880402505398e-02 -1 -2 571
+            -9.7415763884782791e-03</internalNodes>
+          <leafValues>
+            -7.7388781309127808e-01 3.6731991171836853e-01
+            -6.5746001899242401e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 572 5.3386680519906804e-05 -1 -2 573
+            5.9820311143994331e-03</internalNodes>
+          <leafValues>
+            -3.5571750998497009e-01 1.7653119564056396e-01
+            -4.6110078692436218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 574 -1.9558269996196032e-03 -1 -2 575
+            7.6739699579775333e-03</internalNodes>
+          <leafValues>
+            -3.6172690987586975e-01 1.8038579821586609e-01
+            -4.0452030301094055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 576 4.2935381643474102e-03 -1 -2 577
+            1.4181300066411495e-03</internalNodes>
+          <leafValues>
+            5.2086359262466431e-01 -2.2085809707641602e-01
+            2.7357560396194458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 578 -2.8263099491596222e-02 -1 -2 579
+            6.3434068579226732e-04</internalNodes>
+          <leafValues>
+            -6.3833731412887573e-01 1.5636380016803741e-01
+            -3.2148900628089905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 580 -7.2387307882308960e-03 -1 -2 581
+            -9.9928081035614014e-03</internalNodes>
+          <leafValues>
+            2.3126259446144104e-01 3.0397319793701172e-01
+            -2.4478439986705780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 582 6.4995248976629227e-05 -1 -2 583
+            -5.3049270063638687e-03</internalNodes>
+          <leafValues>
+            1.5132980048656464e-01 2.0417870581150055e-01
+            -4.6260431408882141e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 584 -1.6613099724054337e-02 -1 -2 585
+            -1.1630290187895298e-02</internalNodes>
+          <leafValues>
+            3.3399769663810730e-01 3.7053430080413818e-01
+            -1.9361549615859985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 586 1.9068180117756128e-03 -1 -2 587
+            -5.6926468387246132e-03</internalNodes>
+          <leafValues>
+            -3.8105058670043945e-01 5.0645208358764648e-01
+            6.5170922316610813e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 588 -2.2453670680988580e-04 -1 -2 589
+            9.5565039664506912e-03</internalNodes>
+          <leafValues>
+            -3.1526011228561401e-01 -5.3035598993301392e-01
+            2.0532760024070740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 590 3.1540619675070047e-03 -1 -2 591
+            -3.0681329965591431e-01</internalNodes>
+          <leafValues>
+            -4.5928329229354858e-01 5.0717717409133911e-01
+            -1.4439250342547894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 592 2.8239809907972813e-03 -1 -2 593
+            -3.3063529990613461e-03</internalNodes>
+          <leafValues>
+            -1.5437939763069153e-01 -4.3571388721466064e-01
+            3.9342719316482544e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 594 3.7848789361305535e-04 -1 -2 595
+            -3.0488630291074514e-03</internalNodes>
+          <leafValues>
+            2.5212600827217102e-01 4.6662339568138123e-01
+            -2.2792230546474457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 596 -1.4724380336701870e-02 -1 -2 597
+            3.6062300205230713e-02</internalNodes>
+          <leafValues>
+            -7.8602111339569092e-01 -6.8571321666240692e-02
+            3.6698839068412781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 598 -2.2327410988509655e-03 -1 -2 599
+            -7.8541820403188467e-04</internalNodes>
+          <leafValues>
+            -5.9740197658538818e-01 2.0273469388484955e-01
+            -1.7221680283546448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 600 7.8553898492828012e-04 -1 -2 601
+            1.0078109800815582e-02</internalNodes>
+          <leafValues>
+            -4.3407449126243591e-01 1.2464140355587006e-01
+            -4.8391419649124146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 602 2.0928790792822838e-02 -1 -2 603
+            1.3340089935809374e-03</internalNodes>
+          <leafValues>
+            5.6864207983016968e-01 1.4524639584124088e-02
+            -4.6003210544586182e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>34</maxWeakCount>
+      <stageThreshold>-1.9657919406890869e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 604 -1.5313959680497646e-02 -1 -2 605
+            -1.4265860430896282e-02</internalNodes>
+          <leafValues>
+            -3.4347689151763916e-01 5.8209532499313354e-01
+            -3.5527399182319641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 606 1.2652979930862784e-03 -1 -2 607
+            -7.3807648732326925e-05</internalNodes>
+          <leafValues>
+            -3.1498318910598755e-01 4.7249591350555420e-01
+            -2.6380801200866699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 608 -3.8527030497789383e-02 -1 -2 609
+            -1.4758770354092121e-02</internalNodes>
+          <leafValues>
+            4.1556850075721741e-01 1.5677249431610107e-01
+            -3.7650239467620850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 610 -1.5448270132765174e-03 -1 -2 611
+            6.4564580097794533e-03</internalNodes>
+          <leafValues>
+            -3.5932019352912903e-01 2.1276639401912689e-01
+            -7.2287178039550781e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 612 1.0267349891364574e-02 -1 -2 613
+            -8.6422899039462209e-04</internalNodes>
+          <leafValues>
+            -4.6045809984207153e-01 2.4920259416103363e-01
+            -2.6721361279487610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 614 3.2311889808624983e-03 -1 -2 615
+            1.3676529750227928e-02</internalNodes>
+          <leafValues>
+            -4.0939199924468994e-01 -2.7391690760850906e-02
+            4.5259070396423340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 616 3.2787120435386896e-03 -1 -2 617
+            -1.4256529975682497e-03</internalNodes>
+          <leafValues>
+            -7.0025652647018433e-01 2.5787800550460815e-01
+            -1.5093439817428589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 618 -2.2095029707998037e-03 -1 -2 619
+            -8.7701372802257538e-02</internalNodes>
+          <leafValues>
+            3.5148110985755920e-01 4.1978740692138672e-01
+            -2.3600180447101593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 620 -2.8805620968341827e-03 -1 -2 621
+            -2.5028509553521872e-03</internalNodes>
+          <leafValues>
+            3.0479869246482849e-01 1.3316699862480164e-01
+            -3.1691300868988037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 622 -5.1710562547668815e-04 -1 -2 623
+            6.7088729701936245e-03</internalNodes>
+          <leafValues>
+            -3.5199090838432312e-01 2.0163150131702423e-01
+            -6.0948008298873901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 624 -7.6058752834796906e-02 -1 -2 625
+            -3.0889140907675028e-03</internalNodes>
+          <leafValues>
+            -6.3694208860397339e-01 -7.9025340080261230e-01
+            1.0366079956293106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 626 2.5740528944879770e-03 -1 -2 627
+            -5.4877097718417645e-03</internalNodes>
+          <leafValues>
+            -4.5424199104309082e-01 2.1481299400329590e-01
+            -1.9329510629177094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 628 -1.2507289648056030e-03 -1 -2 629
+            -4.3231048621237278e-03</internalNodes>
+          <leafValues>
+            -2.1651449799537659e-01 -6.2799078226089478e-01
+            2.4270740151405334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 630 4.3724630959331989e-03 -1 -2 631
+            7.4632692849263549e-04</internalNodes>
+          <leafValues>
+            -5.1889377832412720e-01 -1.1378680169582367e-01
+            2.8224378824234009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 632 -1.3375070411711931e-03 -1 -2 633
+            -2.9367550741881132e-03</internalNodes>
+          <leafValues>
+            2.4589119851589203e-01 2.4335819482803345e-01
+            -2.9112818837165833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 634 6.3193867390509695e-05 -1 -2 635
+            -5.1338938064873219e-03</internalNodes>
+          <leafValues>
+            -2.5806590914726257e-01 -4.6110409498214722e-01
+            2.4333980679512024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 636 4.9400608986616135e-03 -1 -2 637
+            -5.6112580932676792e-03</internalNodes>
+          <leafValues>
+            -3.9632990956306458e-01 2.4502380192279816e-01
+            -1.5639010071754456e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 638 4.2950599454343319e-03 -1 -2 639
+            4.5142881572246552e-03</internalNodes>
+          <leafValues>
+            -4.7671678662300110e-01 1.0698430240154266e-01
+            -9.0471321344375610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 640 7.5297639705240726e-03 -1 -2 641
+            -1.2225280515849590e-03</internalNodes>
+          <leafValues>
+            4.1239809989929199e-01 2.8488171100616455e-01
+            -1.9815699756145477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 642 -3.4703810233622789e-03 -1 -2 643
+            8.3724651485681534e-03</internalNodes>
+          <leafValues>
+            -4.4967961311340332e-01 1.5324249863624573e-01
+            -3.8666850328445435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 644 -3.3934618841158226e-05 -1 -2 645
+            -2.7241709828376770e-01</internalNodes>
+          <leafValues>
+            -3.1429070234298706e-01 -5.5842101573944092e-01
+            1.6627819836139679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 646 -2.7582740876823664e-03 -1 -2 647
+            2.5530489161610603e-02</internalNodes>
+          <leafValues>
+            2.7189570665359497e-01 -1.9172009825706482e-01
+            4.3780499696731567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 648 4.2080380953848362e-03 -1 -2 649
+            -8.2151442766189575e-03</internalNodes>
+          <leafValues>
+            -4.4684138894081116e-01 2.2786709666252136e-01
+            -1.7441789805889130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 650 -2.9405429959297180e-03 -1 -2 651
+            -9.4840265810489655e-03</internalNodes>
+          <leafValues>
+            -7.2643548250198364e-01 2.0794290304183960e-01
+            -1.5239919722080231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 652 4.2596450075507164e-03 -1 -2 653
+            -1.7117479583248496e-03</internalNodes>
+          <leafValues>
+            6.1772680282592773e-01 -7.1106612682342529e-01
+            -6.1875251121819019e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 654 -1.3266160385683179e-03 -1 -2 655
+            9.1314306482672691e-03</internalNodes>
+          <leafValues>
+            1.7181269824504852e-01 -4.1138759255409241e-01
+            1.8124279379844666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 656 6.8382360041141510e-03 -1 -2 657
+            7.5181988067924976e-03</internalNodes>
+          <leafValues>
+            -5.7601082324981689e-01 -1.0819079726934433e-01
+            2.9561421275138855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 658 -7.2788819670677185e-03 -1 -2 659
+            -1.8039470538496971e-02</internalNodes>
+          <leafValues>
+            -5.8113521337509155e-01 4.5183068513870239e-01
+            -2.7083089575171471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 660 -1.0126599809154868e-03 -1 -2 661
+            -6.7263199016451836e-03</internalNodes>
+          <leafValues>
+            2.4344119429588318e-01 1.6870440542697906e-01
+            -2.7007728815078735e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 662 -3.2334970310330391e-03 -1 -2 663
+            -7.7852200774941593e-05</internalNodes>
+          <leafValues>
+            -6.0048222541809082e-01 2.4241769313812256e-01
+            -1.2413249909877777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 664 -6.7774722992908210e-05 -1 -2 665
+            7.1789676439948380e-05</internalNodes>
+          <leafValues>
+            1.5729150176048279e-01 -5.2893507480621338e-01
+            -3.1665571033954620e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 666 1.0024299845099449e-02 -1 -2 667
+            9.4298496842384338e-03</internalNodes>
+          <leafValues>
+            -4.8646959662437439e-01 1.1240869760513306e-01
+            -4.2570489645004272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 668 -7.4433721601963043e-04 -1 -2 669
+            1.1660560034215450e-02</internalNodes>
+          <leafValues>
+            2.7540761232376099e-01 -2.3117260634899139e-01
+            2.2442330420017242e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 670 3.9079408161342144e-03 -1 -2 671
+            1.6550149768590927e-02</internalNodes>
+          <leafValues>
+            -6.3519638776779175e-01 1.0619100183248520e-01
+            -4.7654989361763000e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>32</maxWeakCount>
+      <stageThreshold>-1.7649420499801636e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            1 0 672 -1.8439030274748802e-02 -1 -2 673
+            -5.3364519029855728e-02</internalNodes>
+          <leafValues>
+            -4.8745709657669067e-01 5.1037812232971191e-01
+            -2.2670130431652069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 674 -7.5706318020820618e-02 -1 -2 675
+            -1.5329009620472789e-03</internalNodes>
+          <leafValues>
+            4.1487750411033630e-01 8.5764937102794647e-02
+            -4.3470910191535950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 676 -2.4494890123605728e-02 -1 -2 677
+            -3.8144161226227880e-04</internalNodes>
+          <leafValues>
+            -2.7532699704170227e-01 3.8043969869613647e-01
+            -4.3967849016189575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 678 -8.8816778734326363e-03 -1 -2 679
+            -3.9625130593776703e-02</internalNodes>
+          <leafValues>
+            -4.3258818984031677e-01 2.4481220543384552e-01
+            -2.6193639636039734e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 680 -3.5907390993088484e-03 -1 -2 681
+            3.7008870393037796e-02</internalNodes>
+          <leafValues>
+            -3.6199480295181274e-01 2.2637460380792618e-02
+            5.5778437852859497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 682 7.8503930126316845e-05 -1 -2 683
+            -4.7969701699912548e-03</internalNodes>
+          <leafValues>
+            -3.3861130475997925e-01 3.1856098771095276e-01
+            -1.6600249707698822e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 684 -1.1298010125756264e-02 -1 -2 685
+            -4.4886539690196514e-03</internalNodes>
+          <leafValues>
+            3.7305471301078796e-01 2.9692959785461426e-01
+            -2.5235760211944580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 686 -2.2497780155390501e-03 -1 -2 687
+            2.9247230850160122e-03</internalNodes>
+          <leafValues>
+            3.4263029694557190e-01 -5.6593239307403564e-02
+            -7.0626032352447510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 688 1.7976630479097366e-03 -1 -2 689
+            1.9808609504252672e-03</internalNodes>
+          <leafValues>
+            -5.4180228710174561e-01 -2.5643008947372437e-01
+            1.8446870148181915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 690 -4.7688339836895466e-03 -1 -2 691
+            -1.5755610540509224e-02</internalNodes>
+          <leafValues>
+            -2.9698228836059570e-01 2.8959378600120544e-01
+            -1.6480749845504761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 692 -1.1919640004634857e-02 -1 -2 693
+            4.2308131232857704e-03</internalNodes>
+          <leafValues>
+            -5.8567219972610474e-01 1.3601270318031311e-01
+            -4.8162451386451721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 694 2.0548550412058830e-02 -1 -2 695
+            -7.3943338356912136e-03</internalNodes>
+          <leafValues>
+            3.0143499374389648e-01 4.6367760747671127e-02
+            -4.2379519343376160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 696 -6.2137800268828869e-03 -1 -2 697
+            1.4182809973135591e-03</internalNodes>
+          <leafValues>
+            4.5724278688430786e-01 -3.0143639445304871e-01
+            1.8204510211944580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 698 4.1609420441091061e-03 -1 -2 699
+            -3.7915320135653019e-03</internalNodes>
+          <leafValues>
+            -5.2654838562011719e-01 -5.8677071332931519e-01
+            1.1703660339117050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 700 2.0879150833934546e-03 -1 -2 701
+            1.5018540434539318e-03</internalNodes>
+          <leafValues>
+            -3.5307729244232178e-01 1.8624800443649292e-01
+            -3.2729730010032654e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 702 2.1248809993267059e-02 -1 -2 703
+            -5.5249751312658191e-04</internalNodes>
+          <leafValues>
+            -3.1979259848594666e-01 2.3370230197906494e-01
+            -1.7386199533939362e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 704 -3.0085169710218906e-03 -1 -2 705
+            -1.1611919617280364e-03</internalNodes>
+          <leafValues>
+            1.7596049606800079e-01 1.6033430397510529e-01
+            -3.9680978655815125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 706 -3.9655580185353756e-03 -1 -2 707
+            -6.5836100839078426e-03</internalNodes>
+          <leafValues>
+            3.6691769957542419e-01 -6.2966358661651611e-01
+            -2.4926450103521347e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 708 -9.0950471349060535e-04 -1 -2 709
+            -5.7984529994428158e-03</internalNodes>
+          <leafValues>
+            3.9574980735778809e-01 1.7492240667343140e-01
+            -2.6837408542633057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 710 -5.7758802175521851e-01 -1 -2 711
+            -1.5161310322582722e-02</internalNodes>
+          <leafValues>
+            5.9611392021179199e-01 -6.6131639480590820e-01
+            3.3608361263759434e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 712 7.6604672358371317e-05 -1 -2 713
+            2.7769979089498520e-02</internalNodes>
+          <leafValues>
+            2.0401589572429657e-01 -3.2097330689430237e-01
+            2.2317400574684143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 714 -2.6336179580539465e-03 -1 -2 715
+            8.3722146227955818e-03</internalNodes>
+          <leafValues>
+            -3.9656499028205872e-01 1.3883970677852631e-01
+            -5.8006221055984497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 716 -7.0203031646087766e-04 -1 -2 717
+            -4.8448870074935257e-04</internalNodes>
+          <leafValues>
+            2.7777281403541565e-01 2.1628519892692566e-01
+            -2.9692250490188599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 718 -3.3638171851634979e-02 -1 -2 719
+            4.4241230934858322e-03</internalNodes>
+          <leafValues>
+            3.5791969299316406e-01 -8.6632027523592114e-04
+            -5.5872720479965210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 720 1.1545260436832905e-02 -1 -2 721
+            -1.5816639643162489e-03</internalNodes>
+          <leafValues>
+            3.3837619423866272e-01 2.8660699725151062e-02
+            -3.5041970014572144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 722 1.3838140293955803e-02 -1 -2 723
+            2.8327409178018570e-02</internalNodes>
+          <leafValues>
+            -7.7886807918548584e-01 -1.8604910001158714e-02
+            6.2147867679595947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 724 -8.8482163846492767e-03 -1 -2 725
+            -1.1661020107567310e-03</internalNodes>
+          <leafValues>
+            2.6369819045066833e-01 1.0302580147981644e-01
+            -3.2680010795593262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 726 -3.2252211123704910e-02 -1 -2 727
+            -9.4921119511127472e-02</internalNodes>
+          <leafValues>
+            -5.0046241283416748e-01 -7.2761011123657227e-01
+            1.0330100357532501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            1 0 728 2.5177269708365202e-03 -1 -2 729
+            -4.0892168879508972e-02</internalNodes>
+          <leafValues>
+            -6.3938027620315552e-01 -5.7345229387283325e-01
+            8.1502526998519897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 730 -1.9293189980089664e-03 -1 -2 731
+            -1.4116390375420451e-03</internalNodes>
+          <leafValues>
+            2.4177229404449463e-01 8.0363817512989044e-02
+            -3.6146539449691772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 732 -3.8812779821455479e-03 -1 -2 733
+            4.4630360789597034e-03</internalNodes>
+          <leafValues>
+            -5.7638782262802124e-01 9.1835789382457733e-02
+            -6.8039101362228394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 1 734 2.9870839789509773e-03 -1 -2 735
+            9.4975335523486137e-03</internalNodes>
+          <leafValues>
+            -1.0236640274524689e-01 4.9150609970092773e-01
+            -3.8011389970779419e-01</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          8 7 3 12 -1.</_>
+        <_>
+          8 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 3 -1.</_>
+        <_>
+          10 9 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 13 2 6 -1.</_>
+        <_>
+          9 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 8 -1.</_>
+        <_>
+          11 2 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 5 12 -1.</_>
+        <_>
+          8 4 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 3 12 -1.</_>
+        <_>
+          1 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 7 -1.</_>
+        <_>
+          1 11 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 7 -1.</_>
+        <_>
+          9 12 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 9 -1.</_>
+        <_>
+          15 4 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          8 11 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 20 -1.</_>
+        <_>
+          15 5 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 5 8 -1.</_>
+        <_>
+          0 16 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 8 -1.</_>
+        <_>
+          12 2 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 8 -1.</_>
+        <_>
+          19 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 3 12 -1.</_>
+        <_>
+          9 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 8 -1.</_>
+        <_>
+          1 6 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 4 -1.</_>
+        <_>
+          2 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 6 8 -1.</_>
+        <_>
+          9 7 3 4 2.</_>
+        <_>
+          12 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 18 7 2 -1.</_>
+        <_>
+          13 19 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          8 11 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 12 -1.</_>
+        <_>
+          0 12 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 8 -1.</_>
+        <_>
+          18 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 1 8 -1.</_>
+        <_>
+          16 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 9 -1.</_>
+        <_>
+          12 1 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          15 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 2 4 -1.</_>
+        <_>
+          2 16 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 3 -1.</_>
+        <_>
+          9 12 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 5 2 -1.</_>
+        <_>
+          0 19 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 12 -1.</_>
+        <_>
+          7 11 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 12 -1.</_>
+        <_>
+          4 0 8 6 2.</_>
+        <_>
+          12 6 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 2 5 -1.</_>
+        <_>
+          9 3 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 16 1 3 -1.</_>
+        <_>
+          17 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 6 -1.</_>
+        <_>
+          1 9 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 4 -1.</_>
+        <_>
+          4 3 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 12 12 -1.</_>
+        <_>
+          8 11 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 8 -1.</_>
+        <_>
+          10 4 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 9 -1.</_>
+        <_>
+          19 0 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 1 4 -1.</_>
+        <_>
+          4 13 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 6 2 -1.</_>
+        <_>
+          12 10 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 7 -1.</_>
+        <_>
+          15 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 13 8 -1.</_>
+        <_>
+          4 2 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 7 8 -1.</_>
+        <_>
+          9 5 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 9 -1.</_>
+        <_>
+          10 0 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 4 -1.</_>
+        <_>
+          15 3 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 4 -1.</_>
+        <_>
+          0 18 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 17 2 1 -1.</_>
+        <_>
+          3 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 3 -1.</_>
+        <_>
+          16 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 4 -1.</_>
+        <_>
+          10 11 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 3 -1.</_>
+        <_>
+          18 1 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 12 6 -1.</_>
+        <_>
+          2 4 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 16 -1.</_>
+        <_>
+          15 6 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 6 -1.</_>
+        <_>
+          13 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 3 -1.</_>
+        <_>
+          12 3 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 12 -1.</_>
+        <_>
+          7 11 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 9 -1.</_>
+        <_>
+          12 1 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 10 -1.</_>
+        <_>
+          18 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 15 -1.</_>
+        <_>
+          8 10 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 4 12 -1.</_>
+        <_>
+          1 12 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 2 -1.</_>
+        <_>
+          8 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 15 -1.</_>
+        <_>
+          18 0 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 8 -1.</_>
+        <_>
+          15 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 9 -1.</_>
+        <_>
+          5 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 6 -1.</_>
+        <_>
+          10 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 3 3 -1.</_>
+        <_>
+          11 17 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          11 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 4 -1.</_>
+        <_>
+          15 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 2 -1.</_>
+        <_>
+          9 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 4 5 -1.</_>
+        <_>
+          7 1 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 5 -1.</_>
+        <_>
+          4 0 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 3 -1.</_>
+        <_>
+          10 9 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 3 -1.</_>
+        <_>
+          15 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 4 -1.</_>
+        <_>
+          9 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 6 -1.</_>
+        <_>
+          17 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 9 -1.</_>
+        <_>
+          3 12 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 4 -1.</_>
+        <_>
+          9 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 6 -1.</_>
+        <_>
+          1 3 16 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 6 -1.</_>
+        <_>
+          2 2 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 9 -1.</_>
+        <_>
+          1 11 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 1 8 -1.</_>
+        <_>
+          18 11 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 2 -1.</_>
+        <_>
+          11 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 1 -1.</_>
+        <_>
+          12 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 4 8 -1.</_>
+        <_>
+          17 0 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 17 4 3 -1.</_>
+        <_>
+          14 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 1 2 -1.</_>
+        <_>
+          15 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 3 -1.</_>
+        <_>
+          14 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 8 -1.</_>
+        <_>
+          3 2 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 1 2 -1.</_>
+        <_>
+          18 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 8 3 -1.</_>
+        <_>
+          8 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 1 9 -1.</_>
+        <_>
+          9 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 9 2 -1.</_>
+        <_>
+          9 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 5 6 -1.</_>
+        <_>
+          0 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 4 -1.</_>
+        <_>
+          15 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 2 -1.</_>
+        <_>
+          8 10 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 8 -1.</_>
+        <_>
+          19 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 8 -1.</_>
+        <_>
+          11 2 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 4 -1.</_>
+        <_>
+          2 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 13 9 -1.</_>
+        <_>
+          7 11 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 6 -1.</_>
+        <_>
+          19 1 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 8 -1.</_>
+        <_>
+          7 6 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 9 2 -1.</_>
+        <_>
+          11 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 2 3 -1.</_>
+        <_>
+          11 7 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 6 2 -1.</_>
+        <_>
+          6 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 7 -1.</_>
+        <_>
+          8 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 6 2 -1.</_>
+        <_>
+          7 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 2 -1.</_>
+        <_>
+          18 6 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 4 -1.</_>
+        <_>
+          6 4 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 4 -1.</_>
+        <_>
+          13 0 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 6 -1.</_>
+        <_>
+          11 11 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 6 -1.</_>
+        <_>
+          16 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 2 -1.</_>
+        <_>
+          19 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 3 -1.</_>
+        <_>
+          19 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 4 -1.</_>
+        <_>
+          13 12 1 2 2.</_>
+        <_>
+          14 14 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 3 5 -1.</_>
+        <_>
+          15 10 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 8 3 -1.</_>
+        <_>
+          10 9 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 4 -1.</_>
+        <_>
+          6 8 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 6 -1.</_>
+        <_>
+          1 11 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 5 6 -1.</_>
+        <_>
+          0 16 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 4 6 -1.</_>
+        <_>
+          18 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 7 -1.</_>
+        <_>
+          15 7 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 4 -1.</_>
+        <_>
+          19 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 2 -1.</_>
+        <_>
+          16 1 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 5 -1.</_>
+        <_>
+          15 12 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 15 2 3 -1.</_>
+        <_>
+          17 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 16 3 4 -1.</_>
+        <_>
+          14 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 2 -1.</_>
+        <_>
+          16 16 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 1 2 -1.</_>
+        <_>
+          18 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 1 6 -1.</_>
+        <_>
+          9 11 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 1 -1.</_>
+        <_>
+          19 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 4 -1.</_>
+        <_>
+          16 3 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 2 -1.</_>
+        <_>
+          9 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 9 7 -1.</_>
+        <_>
+          9 13 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 2 -1.</_>
+        <_>
+          1 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 3 4 -1.</_>
+        <_>
+          0 17 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 4 5 -1.</_>
+        <_>
+          9 1 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 9 -1.</_>
+        <_>
+          12 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 4 -1.</_>
+        <_>
+          10 10 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 5 4 -1.</_>
+        <_>
+          15 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 3 2 -1.</_>
+        <_>
+          18 2 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 5 -1.</_>
+        <_>
+          14 11 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 4 3 -1.</_>
+        <_>
+          10 7 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 1 -1.</_>
+        <_>
+          5 0 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 6 5 -1.</_>
+        <_>
+          3 13 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 5 -1.</_>
+        <_>
+          14 10 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 6 -1.</_>
+        <_>
+          9 10 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 6 -1.</_>
+        <_>
+          13 9 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 7 6 -1.</_>
+        <_>
+          7 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 10 12 -1.</_>
+        <_>
+          3 5 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 4 -1.</_>
+        <_>
+          15 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 9 -1.</_>
+        <_>
+          2 12 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 11 -1.</_>
+        <_>
+          12 0 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 1 8 -1.</_>
+        <_>
+          13 11 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 2 -1.</_>
+        <_>
+          19 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 1 2 -1.</_>
+        <_>
+          2 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 16 1 3 -1.</_>
+        <_>
+          15 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 2 -1.</_>
+        <_>
+          6 12 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 2 2 -1.</_>
+        <_>
+          4 11 1 1 2.</_>
+        <_>
+          5 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 2 -1.</_>
+        <_>
+          18 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 8 -1.</_>
+        <_>
+          16 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 3 -1.</_>
+        <_>
+          19 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 3 -1.</_>
+        <_>
+          14 0 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 15 17 -1.</_>
+        <_>
+          8 3 5 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 4 4 -1.</_>
+        <_>
+          9 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 8 1 -1.</_>
+        <_>
+          1 11 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 2 4 -1.</_>
+        <_>
+          3 11 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 17 4 3 -1.</_>
+        <_>
+          5 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 1 -1.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 3 -1.</_>
+        <_>
+          11 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 2 -1.</_>
+        <_>
+          4 11 2 1 2.</_>
+        <_>
+          6 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 4 -1.</_>
+        <_>
+          4 11 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 1 -1.</_>
+        <_>
+          17 2 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 18 1 2 -1.</_>
+        <_>
+          4 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 2 -1.</_>
+        <_>
+          10 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 4 -1.</_>
+        <_>
+          11 12 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 1 -1.</_>
+        <_>
+          19 2 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 2 -1.</_>
+        <_>
+          9 0 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 8 2 -1.</_>
+        <_>
+          8 13 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 4 -1.</_>
+        <_>
+          15 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 17 9 -1.</_>
+        <_>
+          3 11 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 3 -1.</_>
+        <_>
+          2 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 6 -1.</_>
+        <_>
+          12 3 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 3 6 -1.</_>
+        <_>
+          0 17 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 9 -1.</_>
+        <_>
+          3 3 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 6 -1.</_>
+        <_>
+          8 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 18 3 -1.</_>
+        <_>
+          7 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 4 -1.</_>
+        <_>
+          16 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 4 5 -1.</_>
+        <_>
+          14 11 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 2 -1.</_>
+        <_>
+          19 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 3 -1.</_>
+        <_>
+          19 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 8 4 -1.</_>
+        <_>
+          7 4 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 3 2 -1.</_>
+        <_>
+          10 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 2 -1.</_>
+        <_>
+          16 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 15 3 2 -1.</_>
+        <_>
+          16 15 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          7 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 1 -1.</_>
+        <_>
+          14 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 1 3 -1.</_>
+        <_>
+          3 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 4 -1.</_>
+        <_>
+          10 2 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 3 -1.</_>
+        <_>
+          14 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 18 8 2 -1.</_>
+        <_>
+          12 19 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 7 -1.</_>
+        <_>
+          9 12 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 18 6 2 -1.</_>
+        <_>
+          6 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 3 -1.</_>
+        <_>
+          12 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 2 2 -1.</_>
+        <_>
+          13 12 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 2 1 -1.</_>
+        <_>
+          19 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 4 1 -1.</_>
+        <_>
+          6 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 5 2 -1.</_>
+        <_>
+          0 12 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 2 -1.</_>
+        <_>
+          18 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 6 -1.</_>
+        <_>
+          1 2 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 1 -1.</_>
+        <_>
+          3 3 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 3 1 -1.</_>
+        <_>
+          17 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 10 1 6 -1.</_>
+        <_>
+          12 12 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 1 1 3 -1.</_>
+        <_>
+          2 2 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 3 -1.</_>
+        <_>
+          2 1 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 14 8 1 -1.</_>
+        <_>
+          8 14 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 9 -1.</_>
+        <_>
+          7 11 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 18 -1.</_>
+        <_>
+          19 6 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 3 6 -1.</_>
+        <_>
+          1 16 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 7 3 -1.</_>
+        <_>
+          6 11 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 7 3 -1.</_>
+        <_>
+          6 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 8 -1.</_>
+        <_>
+          17 1 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 2 4 -1.</_>
+        <_>
+          10 6 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 7 2 -1.</_>
+        <_>
+          6 12 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 6 -1.</_>
+        <_>
+          18 12 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 2 -1.</_>
+        <_>
+          19 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 2 -1.</_>
+        <_>
+          17 10 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 18 4 2 -1.</_>
+        <_>
+          7 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 4 4 -1.</_>
+        <_>
+          3 12 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 2 -1.</_>
+        <_>
+          19 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 3 -1.</_>
+        <_>
+          19 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 12 3 -1.</_>
+        <_>
+          7 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 4 1 -1.</_>
+        <_>
+          7 18 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 6 -1.</_>
+        <_>
+          5 5 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 6 -1.</_>
+        <_>
+          9 4 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 11 9 -1.</_>
+        <_>
+          7 3 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 8 9 -1.</_>
+        <_>
+          2 3 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 3 -1.</_>
+        <_>
+          6 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 18 3 2 -1.</_>
+        <_>
+          0 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 19 -1.</_>
+        <_>
+          6 0 5 19 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 2 3 -1.</_>
+        <_>
+          2 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          11 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 3 2 -1.</_>
+        <_>
+          12 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 2 -1.</_>
+        <_>
+          11 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          10 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 1 -1.</_>
+        <_>
+          18 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 13 -1.</_>
+        <_>
+          14 0 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 1 -1.</_>
+        <_>
+          17 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 1 2 -1.</_>
+        <_>
+          5 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 4 2 -1.</_>
+        <_>
+          2 11 2 1 2.</_>
+        <_>
+          4 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 15 2 3 -1.</_>
+        <_>
+          15 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 17 4 2 -1.</_>
+        <_>
+          9 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 3 -1.</_>
+        <_>
+          0 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 6 2 -1.</_>
+        <_>
+          12 13 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 1 2 -1.</_>
+        <_>
+          2 14 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 8 3 -1.</_>
+        <_>
+          5 11 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 8 -1.</_>
+        <_>
+          13 2 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 7 -1.</_>
+        <_>
+          15 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 15 4 -1.</_>
+        <_>
+          8 11 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 9 -1.</_>
+        <_>
+          12 1 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 7 -1.</_>
+        <_>
+          2 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 1 4 -1.</_>
+        <_>
+          0 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 6 -1.</_>
+        <_>
+          19 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 9 9 -1.</_>
+        <_>
+          11 11 9 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 8 3 -1.</_>
+        <_>
+          11 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 2 2 -1.</_>
+        <_>
+          19 4 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          9 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 3 4 -1.</_>
+        <_>
+          13 2 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 3 -1.</_>
+        <_>
+          12 6 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 1 3 -1.</_>
+        <_>
+          9 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 3 -1.</_>
+        <_>
+          9 13 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 1 2 -1.</_>
+        <_>
+          17 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 16 2 2 -1.</_>
+        <_>
+          16 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 6 -1.</_>
+        <_>
+          6 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 8 -1.</_>
+        <_>
+          5 2 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 2 1 -1.</_>
+        <_>
+          18 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 9 -1.</_>
+        <_>
+          14 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 7 3 -1.</_>
+        <_>
+          6 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 2 -1.</_>
+        <_>
+          3 12 3 1 2.</_>
+        <_>
+          6 13 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 1 2 -1.</_>
+        <_>
+          2 10 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 3 -1.</_>
+        <_>
+          12 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 2 6 5 -1.</_>
+        <_>
+          9 2 2 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 6 3 -1.</_>
+        <_>
+          15 13 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 8 -1.</_>
+        <_>
+          17 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 3 -1.</_>
+        <_>
+          9 3 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 2 12 -1.</_>
+        <_>
+          15 6 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 14 4 2 -1.</_>
+        <_>
+          11 14 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 5 4 -1.</_>
+        <_>
+          9 4 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 3 -1.</_>
+        <_>
+          14 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 3 -1.</_>
+        <_>
+          18 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 4 1 -1.</_>
+        <_>
+          6 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 2 2 -1.</_>
+        <_>
+          5 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 1 2 -1.</_>
+        <_>
+          2 11 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 6 -1.</_>
+        <_>
+          18 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 2 -1.</_>
+        <_>
+          10 5 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 2 -1.</_>
+        <_>
+          13 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 4 -1.</_>
+        <_>
+          9 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 2 5 -1.</_>
+        <_>
+          1 11 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 20 9 -1.</_>
+        <_>
+          0 11 20 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 1 6 -1.</_>
+        <_>
+          18 3 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 7 -1.</_>
+        <_>
+          17 1 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 2 4 -1.</_>
+        <_>
+          4 13 1 2 2.</_>
+        <_>
+          5 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 6 -1.</_>
+        <_>
+          7 9 6 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 5 4 -1.</_>
+        <_>
+          0 18 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 3 4 -1.</_>
+        <_>
+          8 15 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 3 -1.</_>
+        <_>
+          11 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 7 -1.</_>
+        <_>
+          13 3 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 8 -1.</_>
+        <_>
+          13 12 1 4 2.</_>
+        <_>
+          14 16 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 5 -1.</_>
+        <_>
+          14 11 1 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 5 -1.</_>
+        <_>
+          11 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 2 -1.</_>
+        <_>
+          8 11 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 2 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 2 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 17 1 2 -1.</_>
+        <_>
+          15 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 1 3 -1.</_>
+        <_>
+          16 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 10 -1.</_>
+        <_>
+          19 0 1 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          16 2 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 4 -1.</_>
+        <_>
+          12 0 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 15 6 -1.</_>
+        <_>
+          0 5 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 4 4 -1.</_>
+        <_>
+          6 1 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 7 -1.</_>
+        <_>
+          9 13 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 18 6 2 -1.</_>
+        <_>
+          8 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 5 2 -1.</_>
+        <_>
+          0 16 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 12 6 -1.</_>
+        <_>
+          4 3 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 13 8 -1.</_>
+        <_>
+          5 2 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 6 -1.</_>
+        <_>
+          15 12 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          6 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 2 2 -1.</_>
+        <_>
+          6 11 1 1 2.</_>
+        <_>
+          7 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 3 3 2 -1.</_>
+        <_>
+          18 4 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 3 -1.</_>
+        <_>
+          17 4 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 3 1 -1.</_>
+        <_>
+          13 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 2 -1.</_>
+        <_>
+          12 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 1 2 -1.</_>
+        <_>
+          10 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 13 1 6 -1.</_>
+        <_>
+          17 13 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 14 2 4 -1.</_>
+        <_>
+          16 14 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 3 -1.</_>
+        <_>
+          4 0 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 1 -1.</_>
+        <_>
+          13 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 5 -1.</_>
+        <_>
+          8 15 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 8 5 -1.</_>
+        <_>
+          8 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 5 12 -1.</_>
+        <_>
+          0 11 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 2 -1.</_>
+        <_>
+          14 0 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 5 -1.</_>
+        <_>
+          14 9 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 9 -1.</_>
+        <_>
+          2 11 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 6 -1.</_>
+        <_>
+          6 11 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 18 4 2 -1.</_>
+        <_>
+          12 19 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 2 -1.</_>
+        <_>
+          16 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 9 1 10 -1.</_>
+        <_>
+          19 9 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 4 4 -1.</_>
+        <_>
+          12 5 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 5 -1.</_>
+        <_>
+          15 12 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 6 -1.</_>
+        <_>
+          18 0 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 16 3 3 -1.</_>
+        <_>
+          14 16 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 4 2 -1.</_>
+        <_>
+          7 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          10 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 15 2 3 -1.</_>
+        <_>
+          13 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 4 -1.</_>
+        <_>
+          12 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 1 3 -1.</_>
+        <_>
+          4 13 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 2 -1.</_>
+        <_>
+          1 11 3 1 2.</_>
+        <_>
+          4 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 2 3 -1.</_>
+        <_>
+          4 8 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          5 12 1 1 2.</_>
+        <_>
+          6 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          8 9 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 5 3 -1.</_>
+        <_>
+          7 9 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 19 4 1 -1.</_>
+        <_>
+          7 19 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 4 -1.</_>
+        <_>
+          6 0 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 8 -1.</_>
+        <_>
+          8 0 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 3 4 -1.</_>
+        <_>
+          11 12 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 20 6 -1.</_>
+        <_>
+          5 4 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 4 -1.</_>
+        <_>
+          13 2 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 14 15 -1.</_>
+        <_>
+          7 5 7 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 18 3 2 -1.</_>
+        <_>
+          1 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 3 3 -1.</_>
+        <_>
+          2 7 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          0 1 3 4 2.</_>
+        <_>
+          3 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 6 -1.</_>
+        <_>
+          7 0 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 15 8 -1.</_>
+        <_>
+          1 3 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 1 -1.</_>
+        <_>
+          8 0 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 1 2 -1.</_>
+        <_>
+          3 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 4 1 -1.</_>
+        <_>
+          4 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 2 2 -1.</_>
+        <_>
+          4 11 1 1 2.</_>
+        <_>
+          5 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 3 -1.</_>
+        <_>
+          18 3 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 2 1 -1.</_>
+        <_>
+          17 3 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 3 2 -1.</_>
+        <_>
+          0 12 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 4 2 -1.</_>
+        <_>
+          4 11 2 1 2.</_>
+        <_>
+          6 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 11 -1.</_>
+        <_>
+          11 0 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 15 2 3 -1.</_>
+        <_>
+          17 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 8 1 -1.</_>
+        <_>
+          2 11 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 13 1 6 -1.</_>
+        <_>
+          17 13 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 2 -1.</_>
+        <_>
+          13 13 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 10 -1.</_>
+        <_>
+          19 5 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 7 9 -1.</_>
+        <_>
+          2 11 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 20 2 -1.</_>
+        <_>
+          5 11 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 1 -1.</_>
+        <_>
+          8 14 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 8 7 -1.</_>
+        <_>
+          12 3 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 5 9 -1.</_>
+        <_>
+          7 3 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 6 -1.</_>
+        <_>
+          0 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 2 6 -1.</_>
+        <_>
+          4 12 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 14 -1.</_>
+        <_>
+          18 0 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 6 -1.</_>
+        <_>
+          6 2 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 12 2 -1.</_>
+        <_>
+          8 19 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 17 4 3 -1.</_>
+        <_>
+          11 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 1 4 -1.</_>
+        <_>
+          4 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 2 -1.</_>
+        <_>
+          18 6 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 3 4 -1.</_>
+        <_>
+          11 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 4 3 -1.</_>
+        <_>
+          9 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 3 -1.</_>
+        <_>
+          9 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 4 -1.</_>
+        <_>
+          18 5 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 0 2 3 -1.</_>
+        <_>
+          18 1 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 2 -1.</_>
+        <_>
+          18 2 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 3 -1.</_>
+        <_>
+          19 2 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 18 4 2 -1.</_>
+        <_>
+          9 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 4 2 -1.</_>
+        <_>
+          2 13 2 1 2.</_>
+        <_>
+          4 14 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 2 -1.</_>
+        <_>
+          3 11 2 1 2.</_>
+        <_>
+          5 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 2 -1.</_>
+        <_>
+          2 10 2 1 2.</_>
+        <_>
+          4 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 2 3 -1.</_>
+        <_>
+          4 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 4 6 -1.</_>
+        <_>
+          3 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 8 -1.</_>
+        <_>
+          16 0 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 9 -1.</_>
+        <_>
+          12 0 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 8 1 -1.</_>
+        <_>
+          1 11 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 1 3 -1.</_>
+        <_>
+          2 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 2 2 -1.</_>
+        <_>
+          14 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 3 4 -1.</_>
+        <_>
+          5 12 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 4 3 -1.</_>
+        <_>
+          7 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 6 -1.</_>
+        <_>
+          14 1 2 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 4 -1.</_>
+        <_>
+          8 6 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 5 -1.</_>
+        <_>
+          10 3 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 2 2 -1.</_>
+        <_>
+          13 12 1 1 2.</_>
+        <_>
+          14 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          7 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 3 3 -1.</_>
+        <_>
+          4 8 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 4 -1.</_>
+        <_>
+          15 11 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 9 -1.</_>
+        <_>
+          14 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 3 -1.</_>
+        <_>
+          16 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 13 -1.</_>
+        <_>
+          19 7 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 1 -1.</_>
+        <_>
+          8 0 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 5 4 -1.</_>
+        <_>
+          11 12 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 13 2 4 -1.</_>
+        <_>
+          18 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 9 2 -1.</_>
+        <_>
+          9 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 8 -1.</_>
+        <_>
+          3 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 3 -1.</_>
+        <_>
+          15 12 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 4 -1.</_>
+        <_>
+          14 8 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 6 -1.</_>
+        <_>
+          4 3 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 17 2 -1.</_>
+        <_>
+          0 1 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 1 6 -1.</_>
+        <_>
+          2 17 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 3 3 -1.</_>
+        <_>
+          2 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 2 9 -1.</_>
+        <_>
+          19 2 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 8 -1.</_>
+        <_>
+          7 11 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 4 -1.</_>
+        <_>
+          18 7 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 13 2 2 -1.</_>
+        <_>
+          7 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 16 1 3 -1.</_>
+        <_>
+          14 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 16 6 4 -1.</_>
+        <_>
+          11 16 3 2 2.</_>
+        <_>
+          14 18 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 1 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 2 -1.</_>
+        <_>
+          19 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 6 -1.</_>
+        <_>
+          13 3 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 3 -1.</_>
+        <_>
+          8 11 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 8 -1.</_>
+        <_>
+          19 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 0 3 3 2.</_>
+        <_>
+          17 3 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          9 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 10 12 -1.</_>
+        <_>
+          6 6 5 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 2 1 -1.</_>
+        <_>
+          11 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 7 10 -1.</_>
+        <_>
+          8 6 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 3 3 -1.</_>
+        <_>
+          14 12 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 13 4 4 -1.</_>
+        <_>
+          10 13 2 2 2.</_>
+        <_>
+          12 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 15 2 3 -1.</_>
+        <_>
+          14 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 3 1 -1.</_>
+        <_>
+          14 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 3 -1.</_>
+        <_>
+          12 4 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 7 3 2 2.</_>
+        <_>
+          4 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 4 2 -1.</_>
+        <_>
+          16 8 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 9 6 -1.</_>
+        <_>
+          13 4 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 2 -1.</_>
+        <_>
+          14 2 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 18 4 2 -1.</_>
+        <_>
+          6 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 8 -1.</_>
+        <_>
+          1 12 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 19 18 1 -1.</_>
+        <_>
+          10 19 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 20 -1.</_>
+        <_>
+          8 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 1 -1.</_>
+        <_>
+          9 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 3 -1.</_>
+        <_>
+          7 10 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 2 -1.</_>
+        <_>
+          3 11 1 1 2.</_>
+        <_>
+          4 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 2 -1.</_>
+        <_>
+          14 0 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 9 1 -1.</_>
+        <_>
+          9 0 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 1 4 -1.</_>
+        <_>
+          3 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 3 3 -1.</_>
+        <_>
+          0 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 15 12 -1.</_>
+        <_>
+          8 8 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 6 -1.</_>
+        <_>
+          9 13 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 12 6 -1.</_>
+        <_>
+          2 3 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 6 1 -1.</_>
+        <_>
+          3 3 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 5 3 -1.</_>
+        <_>
+          2 5 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 2 -1.</_>
+        <_>
+          2 12 1 1 2.</_>
+        <_>
+          3 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          9 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 4 -1.</_>
+        <_>
+          10 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 1 -1.</_>
+        <_>
+          18 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 3 -1.</_>
+        <_>
+          8 11 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 8 -1.</_>
+        <_>
+          2 12 6 4 2.</_>
+        <_>
+          8 16 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 3 -1.</_>
+        <_>
+          12 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 14 9 1 -1.</_>
+        <_>
+          8 14 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 4 6 -1.</_>
+        <_>
+          13 13 2 3 2.</_>
+        <_>
+          15 16 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 1 -1.</_>
+        <_>
+          11 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 4 -1.</_>
+        <_>
+          16 0 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 13 2 2 -1.</_>
+        <_>
+          2 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          5 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 4 -1.</_>
+        <_>
+          0 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 11 -1.</_>
+        <_>
+          7 8 7 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 17 4 3 -1.</_>
+        <_>
+          5 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 3 5 -1.</_>
+        <_>
+          4 12 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 1 3 -1.</_>
+        <_>
+          5 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 2 -1.</_>
+        <_>
+          4 10 2 1 2.</_>
+        <_>
+          6 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 3 1 -1.</_>
+        <_>
+          16 10 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 7 -1.</_>
+        <_>
+          7 0 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 17 6 -1.</_>
+        <_>
+          2 5 17 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 6 -1.</_>
+        <_>
+          2 6 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 2 -1.</_>
+        <_>
+          2 9 3 1 2.</_>
+        <_>
+          5 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 2 -1.</_>
+        <_>
+          3 11 2 1 2.</_>
+        <_>
+          5 12 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 4 2 -1.</_>
+        <_>
+          18 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 3 2 -1.</_>
+        <_>
+          16 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 2 -1.</_>
+        <_>
+          0 12 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 3 -1.</_>
+        <_>
+          3 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 18 6 2 -1.</_>
+        <_>
+          5 18 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 2 -1.</_>
+        <_>
+          12 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 2 -1.</_>
+        <_>
+          19 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 1 -1.</_>
+        <_>
+          7 0 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 3 4 -1.</_>
+        <_>
+          10 11 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 16 1 3 -1.</_>
+        <_>
+          13 17 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 4 -1.</_>
+        <_>
+          19 1 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 13 5 6 -1.</_>
+        <_>
+          15 15 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 3 3 -1.</_>
+        <_>
+          17 5 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 16 14 -1.</_>
+        <_>
+          12 6 8 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 3 1 -1.</_>
+        <_>
+          11 12 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 2 2 -1.</_>
+        <_>
+          5 12 1 1 2.</_>
+        <_>
+          6 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 5 -1.</_>
+        <_>
+          10 3 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 3 -1.</_>
+        <_>
+          18 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 17 1 2 -1.</_>
+        <_>
+          19 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 7 6 -1.</_>
+        <_>
+          10 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 13 4 -1.</_>
+        <_>
+          2 1 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 2 -1.</_>
+        <_>
+          2 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 8 -1.</_>
+        <_>
+          3 3 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 1 3 -1.</_>
+        <_>
+          2 1 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          10 0 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 3 2 -1.</_>
+        <_>
+          18 10 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 6 -1.</_>
+        <_>
+          16 10 4 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 7 3 -1.</_>
+        <_>
+          6 10 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 3 4 -1.</_>
+        <_>
+          2 11 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 1 6 -1.</_>
+        <_>
+          15 8 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 12 -1.</_>
+        <_>
+          19 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 5 2 -1.</_>
+        <_>
+          2 0 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 11 6 -1.</_>
+        <_>
+          1 5 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 4 -1.</_>
+        <_>
+          14 13 1 2 2.</_>
+        <_>
+          15 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 10 3 -1.</_>
+        <_>
+          13 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 1 4 -1.</_>
+        <_>
+          6 13 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 3 9 -1.</_>
+        <_>
+          3 12 1 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 9 -1.</_>
+        <_>
+          9 3 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 6 4 -1.</_>
+        <_>
+          12 0 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 5 -1.</_>
+        <_>
+          12 5 2 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 18 12 -1.</_>
+        <_>
+          7 11 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 4 -1.</_>
+        <_>
+          16 12 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 3 -1.</_>
+        <_>
+          14 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 1 -1.</_>
+        <_>
+          15 10 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 2 -1.</_>
+        <_>
+          18 8 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 2 -1.</_>
+        <_>
+          19 4 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 8 -1.</_>
+        <_>
+          3 4 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 6 -1.</_>
+        <_>
+          1 2 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 1 -1.</_>
+        <_>
+          17 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 3 -1.</_>
+        <_>
+          9 14 2 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 6 2 -1.</_>
+        <_>
+          11 19 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 5 3 -1.</_>
+        <_>
+          15 18 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 4 -1.</_>
+        <_>
+          8 1 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 1 2 -1.</_>
+        <_>
+          5 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 6 -1.</_>
+        <_>
+          3 13 2 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 2 -1.</_>
+        <_>
+          3 12 2 1 2.</_>
+        <_>
+          5 13 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 3 -1.</_>
+        <_>
+          2 1 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 10 3 3 -1.</_>
+        <_>
+          9 11 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 3 -1.</_>
+        <_>
+          0 17 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 12 1 -1.</_>
+        <_>
+          6 13 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 9 -1.</_>
+        <_>
+          15 2 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          9 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 4 -1.</_>
+        <_>
+          10 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 10 -1.</_>
+        <_>
+          15 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 1 4 -1.</_>
+        <_>
+          3 11 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 11 3 3 -1.</_>
+        <_>
+          10 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 3 3 -1.</_>
+        <_>
+          5 13 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 2 1 -1.</_>
+        <_>
+          18 6 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 1 4 -1.</_>
+        <_>
+          16 2 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 13 4 -1.</_>
+        <_>
+          2 6 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 6 2 -1.</_>
+        <_>
+          14 4 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 8 1 3 -1.</_>
+        <_>
+          2 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 3 -1.</_>
+        <_>
+          7 8 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 3 -1.</_>
+        <_>
+          10 8 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 8 -1.</_>
+        <_>
+          10 15 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 15 2 3 -1.</_>
+        <_>
+          12 16 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 20 -1.</_>
+        <_>
+          6 0 6 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 1 -1.</_>
+        <_>
+          5 0 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 3 -1.</_>
+        <_>
+          0 1 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 2 -1.</_>
+        <_>
+          14 13 1 1 2.</_>
+        <_>
+          15 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 2 -1.</_>
+        <_>
+          12 10 2 1 2.</_>
+        <_>
+          14 11 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 4 -1.</_>
+        <_>
+          9 0 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 2 -1.</_>
+        <_>
+          7 3 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 11 -1.</_>
+        <_>
+          2 5 2 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 3 1 -1.</_>
+        <_>
+          13 8 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 2 -1.</_>
+        <_>
+          2 2 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 7 3 -1.</_>
+        <_>
+          12 6 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 3 4 -1.</_>
+        <_>
+          14 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 3 2 -1.</_>
+        <_>
+          8 12 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 4 8 -1.</_>
+        <_>
+          0 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 2 6 -1.</_>
+        <_>
+          14 13 1 3 2.</_>
+        <_>
+          15 16 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 17 1 2 -1.</_>
+        <_>
+          16 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 6 -1.</_>
+        <_>
+          10 2 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 3 -1.</_>
+        <_>
+          4 11 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 12 -1.</_>
+        <_>
+          19 8 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 1 6 -1.</_>
+        <_>
+          19 4 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 12 3 -1.</_>
+        <_>
+          14 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 2 3 -1.</_>
+        <_>
+          1 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 4 9 -1.</_>
+        <_>
+          18 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 6 4 -1.</_>
+        <_>
+          9 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 1 -1.</_>
+        <_>
+          17 3 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 12 3 6 -1.</_>
+        <_>
+          16 12 1 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 3 -1.</_>
+        <_>
+          14 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 15 4 -1.</_>
+        <_>
+          3 5 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 3 4 -1.</_>
+        <_>
+          12 11 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 3 3 -1.</_>
+        <_>
+          11 11 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 4 -1.</_>
+        <_>
+          19 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 3 -1.</_>
+        <_>
+          15 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 2 -1.</_>
+        <_>
+          2 10 4 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 18 4 2 -1.</_>
+        <_>
+          10 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 4 9 -1.</_>
+        <_>
+          11 0 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 5 6 -1.</_>
+        <_>
+          15 12 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 4 2 -1.</_>
+        <_>
+          3 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 4 1 -1.</_>
+        <_>
+          3 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 2 -1.</_>
+        <_>
+          16 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 2 -1.</_>
+        <_>
+          2 6 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 17 6 1 -1.</_>
+        <_>
+          12 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 19 6 1 -1.</_>
+        <_>
+          17 19 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 18 1 2 -1.</_>
+        <_>
+          17 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 3 1 9 -1.</_>
+        <_>
+          19 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 3 3 -1.</_>
+        <_>
+          9 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 3 -1.</_>
+        <_>
+          2 1 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 16 2 2 -1.</_>
+        <_>
+          17 16 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 3 3 -1.</_>
+        <_>
+          6 12 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 2 2 -1.</_>
+        <_>
+          3 11 1 1 2.</_>
+        <_>
+          4 12 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 2 2 -1.</_>
+        <_>
+          16 9 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 2 2 -1.</_>
+        <_>
+          4 9 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 3 -1.</_>
+        <_>
+          2 11 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 20 -1.</_>
+        <_>
+          0 0 10 10 2.</_>
+        <_>
+          10 10 10 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 16 5 3 -1.</_>
+        <_>
+          7 17 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 6 -1.</_>
+        <_>
+          12 3 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 4 7 -1.</_>
+        <_>
+          7 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 6 -1.</_>
+        <_>
+          12 5 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 18 4 2 -1.</_>
+        <_>
+          6 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 6 8 -1.</_>
+        <_>
+          9 7 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 16 2 4 -1.</_>
+        <_>
+          18 16 1 2 2.</_>
+        <_>
+          19 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 18 2 2 -1.</_>
+        <_>
+          12 18 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 5 2 -1.</_>
+        <_>
+          3 3 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 4 -1.</_>
+        <_>
+          7 3 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 2 -1.</_>
+        <_>
+          2 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 1 -1.</_>
+        <_>
+          8 1 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 10 -1.</_>
+        <_>
+          12 1 1 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 4 -1.</_>
+        <_>
+          5 1 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 13 3 2 -1.</_>
+        <_>
+          5 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 3 -1.</_>
+        <_>
+          7 12 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 17 4 3 -1.</_>
+        <_>
+          8 17 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 19 2 1 -1.</_>
+        <_>
+          6 19 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 2 -1.</_>
+        <_>
+          0 9 1 1 2.</_>
+        <_>
+          1 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 2 2 -1.</_>
+        <_>
+          0 9 1 1 2.</_>
+        <_>
+          1 10 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 2 2 -1.</_>
+        <_>
+          6 9 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 5 3 -1.</_>
+        <_>
+          0 11 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 2 2 -1.</_>
+        <_>
+          3 10 1 1 2.</_>
+        <_>
+          4 11 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 1 -1.</_>
+        <_>
+          6 10 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 1 -1.</_>
+        <_>
+          18 5 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 2 7 -1.</_>
+        <_>
+          17 1 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 13 9 2 -1.</_>
+        <_>
+          9 13 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 6 -1.</_>
+        <_>
+          4 11 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 4 -1.</_>
+        <_>
+          1 3 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 3 3 -1.</_>
+        <_>
+          15 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 2 -1.</_>
+        <_>
+          4 11 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 10 -1.</_>
+        <_>
+          12 0 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 16 4 -1.</_>
+        <_>
+          5 12 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 9 -1.</_>
+        <_>
+          15 11 2 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 1 8 -1.</_>
+        <_>
+          19 4 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 10 6 -1.</_>
+        <_>
+          8 5 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 2 1 -1.</_>
+        <_>
+          19 7 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 1 12 -1.</_>
+        <_>
+          19 7 1 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 3 3 -1.</_>
+        <_>
+          9 12 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 3 3 -1.</_>
+        <_>
+          8 12 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 3 2 -1.</_>
+        <_>
+          7 13 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 15 3 2 -1.</_>
+        <_>
+          17 15 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 3 -1.</_>
+        <_>
+          12 6 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 2 4 -1.</_>
+        <_>
+          0 17 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 7 2 -1.</_>
+        <_>
+          12 9 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 7 -1.</_>
+        <_>
+          10 5 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 17 8 3 -1.</_>
+        <_>
+          8 17 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 4 3 -1.</_>
+        <_>
+          0 18 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 10 6 -1.</_>
+        <_>
+          5 3 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 2 -1.</_>
+        <_>
+          6 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 3 -1.</_>
+        <_>
+          7 9 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 1 3 -1.</_>
+        <_>
+          10 9 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 2 -1.</_>
+        <_>
+          17 2 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 10 1 2 -1.</_>
+        <_>
+          2 10 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 1 2 -1.</_>
+        <_>
+          2 9 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 2 3 -1.</_>
+        <_>
+          2 10 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 12 6 -1.</_>
+        <_>
+          2 14 6 3 2.</_>
+        <_>
+          8 17 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 17 1 2 -1.</_>
+        <_>
+          15 17 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 11 3 3 -1.</_>
+        <_>
+          18 12 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 3 2 -1.</_>
+        <_>
+          14 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 18 4 2 -1.</_>
+        <_>
+          18 18 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 14 2 4 -1.</_>
+        <_>
+          17 15 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 3 1 -1.</_>
+        <_>
+          13 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 3 3 -1.</_>
+        <_>
+          12 13 1 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 20 -1.</_>
+        <_>
+          8 0 8 20 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 8 5 -1.</_>
+        <_>
+          5 0 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 1 -1.</_>
+        <_>
+          1 0 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 19 4 -1.</_>
+        <_>
+          1 4 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 3 4 -1.</_>
+        <_>
+          13 7 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 3 3 -1.</_>
+        <_>
+          16 7 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 2 2 -1.</_>
+        <_>
+          3 13 1 1 2.</_>
+        <_>
+          4 14 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 2 2 -1.</_>
+        <_>
+          2 12 1 1 2.</_>
+        <_>
+          3 13 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 19 4 -1.</_>
+        <_>
+          0 4 19 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 7 3 4 -1.</_>
+        <_>
+          18 8 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 4 -1.</_>
+        <_>
+          5 9 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 11 4 6 -1.</_>
+        <_>
+          15 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 6 -1.</_>
+        <_>
+          18 5 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 4 -1.</_>
+        <_>
+          14 3 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 5 4 -1.</_>
+        <_>
+          7 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 2 -1.</_>
+        <_>
+          12 12 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 3 4 -1.</_>
+        <_>
+          16 13 3 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 5 9 -1.</_>
+        <_>
+          14 10 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 1 3 -1.</_>
+        <_>
+          0 13 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 3 6 -1.</_>
+        <_>
+          4 8 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 9 1 -1.</_>
+        <_>
+          3 9 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 6 2 -1.</_>
+        <_>
+          0 9 3 1 2.</_>
+        <_>
+          3 10 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 4 -1.</_>
+        <_>
+          4 2 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 2 3 -1.</_>
+        <_>
+          18 4 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 3 3 -1.</_>
+        <_>
+          6 17 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 6 3 -1.</_>
+        <_>
+          1 17 6 1 3.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_russian_plate_number.xml b/venv/Lib/site-packages/cv2/data/haarcascade_russian_plate_number.xml
new file mode 100644
index 000000000..39f5fcdd8
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_russian_plate_number.xml
@@ -0,0 +1,2656 @@
+<?xml version="1.0"?>
+<opencv_storage>
+<cascade>
+  <stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>20</height>
+  <width>60</width>
+  <stageParams>
+    <boostType>GAB</boostType>
+    <minHitRate>9.9500000476837158e-001</minHitRate>
+    <maxFalseAlarm>5.0000000000000000e-001</maxFalseAlarm>
+    <weightTrimRate>9.4999999999999996e-001</weightTrimRate>
+    <maxDepth>1</maxDepth>
+    <maxWeakCount>100</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount>
+    <featSize>1</featSize>
+    <mode>ALL</mode></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <!-- stage 0 -->
+    <_>
+      <maxWeakCount>6</maxWeakCount>
+      <stageThreshold>-1.3110191822052002e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 193 1.0079263709485531e-002</internalNodes>
+          <leafValues>
+            -8.1339186429977417e-001 5.0277775526046753e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 -2.2060684859752655e-002</internalNodes>
+          <leafValues>
+            7.9418992996215820e-001 -5.0896102190017700e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -4.8777908086776733e-002</internalNodes>
+          <leafValues>
+            7.1656656265258789e-001 -4.1640335321426392e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 1.0387318208813667e-002</internalNodes>
+          <leafValues>
+            3.7618312239646912e-001 -8.5504144430160522e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 -9.4083719886839390e-004</internalNodes>
+          <leafValues>
+            4.2658549547195435e-001 -5.7729166746139526e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -8.2391249015927315e-003</internalNodes>
+          <leafValues>
+            8.2346975803375244e-001 -3.7503159046173096e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 1 -->
+    <_>
+      <maxWeakCount>6</maxWeakCount>
+      <stageThreshold>-1.1759783029556274e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 21 1.7386786639690399e-001</internalNodes>
+          <leafValues>
+            -6.8139964342117310e-001 6.0767590999603271e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -1.9797295331954956e-002</internalNodes>
+          <leafValues>
+            7.8072130680084229e-001 -4.4399836659431458e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -1.0154811898246408e-003</internalNodes>
+          <leafValues>
+            3.3383268117904663e-001 -7.6357340812683105e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 2.4954911321401596e-002</internalNodes>
+          <leafValues>
+            -3.9979115128517151e-001 6.8620890378952026e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 2.8837744612246752e-003</internalNodes>
+          <leafValues>
+            -2.7928480505943298e-001 7.9980146884918213e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 -3.8839362561702728e-002</internalNodes>
+          <leafValues>
+            -7.8442335128784180e-001 3.4929576516151428e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 2 -->
+    <_>
+      <maxWeakCount>6</maxWeakCount>
+      <stageThreshold>-1.7856997251510620e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 34 2.7977079153060913e-002</internalNodes>
+          <leafValues>
+            -5.8424139022827148e-001 6.6850829124450684e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 1.9148588180541992e-002</internalNodes>
+          <leafValues>
+            -6.5457659959793091e-001 4.0804430842399597e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.1955041438341141e-002</internalNodes>
+          <leafValues>
+            -4.2002618312835693e-001 5.6217432022094727e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 -2.1218564361333847e-002</internalNodes>
+          <leafValues>
+            7.1812576055526733e-001 -3.0354043841362000e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 2.0117280655540526e-004</internalNodes>
+          <leafValues>
+            -6.1749500036239624e-001 3.5549193620681763e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 3.9725980604998767e-004</internalNodes>
+          <leafValues>
+            -2.6844096183776855e-001 7.6771658658981323e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 3 -->
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.1837021112442017e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 202 -1.3291766867041588e-002</internalNodes>
+          <leafValues>
+            4.5248869061470032e-001 -5.8849954605102539e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 -4.8353265970945358e-002</internalNodes>
+          <leafValues>
+            7.0951640605926514e-001 -3.2546108961105347e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 2.6532993651926517e-003</internalNodes>
+          <leafValues>
+            -2.5343564152717590e-001 7.6588714122772217e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 -3.8548894226551056e-002</internalNodes>
+          <leafValues>
+            5.8126109838485718e-001 -3.0813106894493103e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 -6.8602780811488628e-004</internalNodes>
+          <leafValues>
+            2.6361095905303955e-001 -7.2226840257644653e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 -2.5726919993758202e-002</internalNodes>
+          <leafValues>
+            -8.7153857946395874e-001 1.9438524544239044e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 8.4192806389182806e-004</internalNodes>
+          <leafValues>
+            -3.6150649189949036e-001 5.2065432071685791e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 -2.6956878136843443e-003</internalNodes>
+          <leafValues>
+            5.9945529699325562e-001 -2.8344830870628357e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 3.0572075396776199e-002</internalNodes>
+          <leafValues>
+            -3.0688971281051636e-001 5.7261526584625244e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 4 -->
+    <_>
+      <maxWeakCount>8</maxWeakCount>
+      <stageThreshold>-1.4687808752059937e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 5 3.1486168503761292e-002</internalNodes>
+          <leafValues>
+            -5.7836848497390747e-001 3.7931033968925476e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 2.8311354108154774e-003</internalNodes>
+          <leafValues>
+            -5.7888329029083252e-001 3.2841828465461731e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -4.2060948908329010e-002</internalNodes>
+          <leafValues>
+            5.5578106641769409e-001 -3.2662427425384521e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 6.2936875037848949e-003</internalNodes>
+          <leafValues>
+            -2.1032968163490295e-001 7.8646916151046753e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 7.0570126175880432e-002</internalNodes>
+          <leafValues>
+            -4.3683132529258728e-001 4.0298295021057129e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 2.5173835456371307e-003</internalNodes>
+          <leafValues>
+            -2.0461565256118774e-001 8.2858163118362427e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 1.5648975968360901e-003</internalNodes>
+          <leafValues>
+            -2.4848082661628723e-001 6.0209411382675171e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -3.5970686003565788e-003</internalNodes>
+          <leafValues>
+            2.3294737935066223e-001 -6.5612471103668213e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 5 -->
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.1029583215713501e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 27 -1.1257569491863251e-001</internalNodes>
+          <leafValues>
+            3.3181819319725037e-001 -5.3901344537734985e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 3.8014666642993689e-003</internalNodes>
+          <leafValues>
+            -3.6430206894874573e-001 4.5984184741973877e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 9.8789634648710489e-004</internalNodes>
+          <leafValues>
+            -2.6661416888237000e-001 5.6971323490142822e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 2.1719809621572495e-002</internalNodes>
+          <leafValues>
+            1.8432702124118805e-001 -8.2999354600906372e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 5.1051773130893707e-002</internalNodes>
+          <leafValues>
+            1.4391148090362549e-001 -9.4541704654693604e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 1.8956036074087024e-003</internalNodes>
+          <leafValues>
+            -6.0830104351043701e-001 2.6091885566711426e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -5.8700828813016415e-003</internalNodes>
+          <leafValues>
+            6.9104760885238647e-001 -2.6916843652725220e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 -1.1522199492901564e-003</internalNodes>
+          <leafValues>
+            -6.9503885507583618e-001 2.4749211966991425e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -5.1933946087956429e-003</internalNodes>
+          <leafValues>
+            5.8551025390625000e-001 -3.0389472842216492e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 6 -->
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-9.0274518728256226e-001</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 205 -1.4383997768163681e-002</internalNodes>
+          <leafValues>
+            4.5400592684745789e-001 -4.9917897582054138e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -3.3369414508342743e-002</internalNodes>
+          <leafValues>
+            -9.3247985839843750e-001 1.4586758613586426e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 5.2380945999175310e-004</internalNodes>
+          <leafValues>
+            -2.8349643945693970e-001 6.4983856678009033e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 6.1231426661834121e-004</internalNodes>
+          <leafValues>
+            -1.8502233922481537e-001 6.5052211284637451e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 1.7017847858369350e-003</internalNodes>
+          <leafValues>
+            2.2008989751338959e-001 -7.2277534008026123e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 2.6139442343264818e-003</internalNodes>
+          <leafValues>
+            1.8238025903701782e-001 -7.6262325048446655e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 -2.0020073279738426e-003</internalNodes>
+          <leafValues>
+            5.6799399852752686e-001 -2.8219676017761230e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 1.9273828947916627e-003</internalNodes>
+          <leafValues>
+            -2.0913636684417725e-001 7.9203850030899048e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -9.4476283993571997e-004</internalNodes>
+          <leafValues>
+            -8.2361942529678345e-001 2.4256958067417145e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 7 -->
+    <_>
+      <maxWeakCount>10</maxWeakCount>
+      <stageThreshold>-1.4518526792526245e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 162 1.6756314784288406e-002</internalNodes>
+          <leafValues>
+            -6.9359332323074341e-001 5.1373954862356186e-002</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 2.4082964286208153e-002</internalNodes>
+          <leafValues>
+            -3.3989402651786804e-001 4.5332714915275574e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 1.2284796684980392e-003</internalNodes>
+          <leafValues>
+            -2.2297365963459015e-001 6.1439812183380127e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -1.4379122294485569e-003</internalNodes>
+          <leafValues>
+            -6.9444245100021362e-001 2.0446482300758362e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -1.8713285680860281e-003</internalNodes>
+          <leafValues>
+            6.7942184209823608e-001 -2.7580419182777405e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -4.7389674000442028e-003</internalNodes>
+          <leafValues>
+            -7.0437240600585938e-001 2.6915156841278076e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 7.4071279959753156e-004</internalNodes>
+          <leafValues>
+            -2.9220902919769287e-001 5.3538239002227783e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 -2.2739455103874207e-001</internalNodes>
+          <leafValues>
+            6.6916191577911377e-001 -2.1987228095531464e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 -1.0255509987473488e-003</internalNodes>
+          <leafValues>
+            6.3346290588378906e-001 -2.2717863321304321e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 2.4775355122983456e-003</internalNodes>
+          <leafValues>
+            -5.4297816753387451e-001 3.1877547502517700e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 8 -->
+    <_>
+      <maxWeakCount>11</maxWeakCount>
+      <stageThreshold>-1.3153649568557739e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 6 1.9131936132907867e-002</internalNodes>
+          <leafValues>
+            -6.0168600082397461e-001 1.9141913950443268e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -4.5855185016989708e-003</internalNodes>
+          <leafValues>
+            2.1901632845401764e-001 -5.7136750221252441e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -1.9026801455765963e-003</internalNodes>
+          <leafValues>
+            -8.0075079202651978e-001 1.6502076387405396e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -3.2767035067081451e-002</internalNodes>
+          <leafValues>
+            5.1496404409408569e-001 -2.5474679470062256e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 6.3941581174731255e-004</internalNodes>
+          <leafValues>
+            -1.9851709902286530e-001 6.7218667268753052e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 1.5573646873235703e-002</internalNodes>
+          <leafValues>
+            -1.7564551532268524e-001 7.0536541938781738e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 9.5508026424795389e-004</internalNodes>
+          <leafValues>
+            -1.9691802561283112e-001 6.1125624179840088e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 9.0427603572607040e-003</internalNodes>
+          <leafValues>
+            1.6518253087997437e-001 -8.7012130022048950e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 8.1576988101005554e-002</internalNodes>
+          <leafValues>
+            1.4075902104377747e-001 -8.4871828556060791e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -5.1994959358125925e-004</internalNodes>
+          <leafValues>
+            2.1803210675716400e-001 -5.4628211259841919e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 -2.3009868338704109e-002</internalNodes>
+          <leafValues>
+            -7.9586231708526611e-001 1.5989699959754944e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 9 -->
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.4625015258789063e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1 2.6759501546621323e-002</internalNodes>
+          <leafValues>
+            -6.0482984781265259e-001 1.4906832575798035e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 3.0343931168317795e-002</internalNodes>
+          <leafValues>
+            -4.7357541322708130e-001 2.6279065012931824e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 1.2678599450737238e-003</internalNodes>
+          <leafValues>
+            -1.9493983685970306e-001 6.9734728336334229e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 1.8607920501381159e-003</internalNodes>
+          <leafValues>
+            1.5611934661865234e-001 -9.0542370080947876e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.3872641138732433e-003</internalNodes>
+          <leafValues>
+            5.3263407945632935e-001 -3.0192303657531738e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -6.9969398900866508e-003</internalNodes>
+          <leafValues>
+            -9.4549953937530518e-001 1.5575224161148071e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 1.1245720088481903e-003</internalNodes>
+          <leafValues>
+            -2.6688691973686218e-001 5.5608308315277100e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -2.8279949910938740e-003</internalNodes>
+          <leafValues>
+            -9.1861122846603394e-001 1.3309663534164429e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 7.1019242750480771e-004</internalNodes>
+          <leafValues>
+            -3.0977895855903625e-001 4.3846300244331360e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 -4.1933014988899231e-002</internalNodes>
+          <leafValues>
+            -8.9102542400360107e-001 1.5866196155548096e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 1.6568358987569809e-002</internalNodes>
+          <leafValues>
+            1.2731756269931793e-001 -8.5553413629531860e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 2.0309074316173792e-003</internalNodes>
+          <leafValues>
+            -2.3260365426540375e-001 6.7330485582351685e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 -1.7069760942831635e-003</internalNodes>
+          <leafValues>
+            -7.1925789117813110e-001 1.9108834862709045e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 10 -->
+    <_>
+      <maxWeakCount>14</maxWeakCount>
+      <stageThreshold>-1.4959813356399536e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 4 1.4695923775434494e-002</internalNodes>
+          <leafValues>
+            -6.2167906761169434e-001 2.1172638237476349e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -1.6501215286552906e-003</internalNodes>
+          <leafValues>
+            1.9353884458541870e-001 -5.7780367136001587e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 7.0121872704476118e-004</internalNodes>
+          <leafValues>
+            -2.2979106009006500e-001 5.3033334016799927e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 9.4158272258937359e-004</internalNodes>
+          <leafValues>
+            1.6849038004875183e-001 -7.4897718429565430e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 -2.0684124901890755e-003</internalNodes>
+          <leafValues>
+            6.7936712503433228e-001 -1.9317412376403809e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -1.8305826233699918e-004</internalNodes>
+          <leafValues>
+            -7.0275229215621948e-001 1.7971208691596985e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 5.5587477982044220e-004</internalNodes>
+          <leafValues>
+            -2.4448128044605255e-001 5.0703984498977661e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 4.3448276119306684e-004</internalNodes>
+          <leafValues>
+            1.3497908413410187e-001 -8.5621362924575806e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -1.2359691318124533e-003</internalNodes>
+          <leafValues>
+            6.1710417270660400e-001 -2.2301279008388519e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 -6.9627340417355299e-004</internalNodes>
+          <leafValues>
+            -6.4706987142562866e-001 2.3951497673988342e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 1.0683680884540081e-003</internalNodes>
+          <leafValues>
+            -2.8343605995178223e-001 4.9318629503250122e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 1.7104238213505596e-004</internalNodes>
+          <leafValues>
+            -2.7171039581298828e-001 4.2520308494567871e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 8.2368971779942513e-003</internalNodes>
+          <leafValues>
+            1.6359315812587738e-001 -7.3864609003067017e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 -5.9884190559387207e-003</internalNodes>
+          <leafValues>
+            3.8030940294265747e-001 -3.0763563513755798e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 11 -->
+    <_>
+      <maxWeakCount>9</maxWeakCount>
+      <stageThreshold>-1.1183819770812988e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 187 -1.4863962307572365e-002</internalNodes>
+          <leafValues>
+            1.1989101022481918e-001 -6.6138857603073120e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 2.4736612103879452e-003</internalNodes>
+          <leafValues>
+            -5.2778661251068115e-001 2.3012125492095947e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -4.8899287357926369e-003</internalNodes>
+          <leafValues>
+            6.0186779499053955e-001 -2.0681641995906830e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 1.5796069055795670e-002</internalNodes>
+          <leafValues>
+            1.4610521495342255e-001 -8.2099527120590210e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 5.9720675926655531e-004</internalNodes>
+          <leafValues>
+            -2.3587301373481750e-001 4.8323699831962585e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 -1.9448818638920784e-003</internalNodes>
+          <leafValues>
+            6.4417767524719238e-001 -2.0953170955181122e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 1.9433414854574949e-004</internalNodes>
+          <leafValues>
+            2.0600238442420959e-001 -7.2418999671936035e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 -1.5097535215318203e-002</internalNodes>
+          <leafValues>
+            -8.7151485681533813e-001 1.2594890594482422e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 82 -3.9843879640102386e-003</internalNodes>
+          <leafValues>
+            4.3801131844520569e-001 -2.9676589369773865e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 12 -->
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.5434337854385376e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 105 1.1273270938545465e-003</internalNodes>
+          <leafValues>
+            -4.7976878285408020e-001 3.6627906560897827e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 9.7806821577250957e-004</internalNodes>
+          <leafValues>
+            -2.7689707279205322e-001 5.1295894384384155e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 1.6528377309441566e-002</internalNodes>
+          <leafValues>
+            -4.5259797573089600e-001 2.4290211498737335e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 1.1040373938158154e-003</internalNodes>
+          <leafValues>
+            -3.2714816927909851e-001 3.4566244482994080e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -1.7780361231416464e-003</internalNodes>
+          <leafValues>
+            -6.9511681795120239e-001 1.8829824030399323e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 4.6280334936454892e-004</internalNodes>
+          <leafValues>
+            -2.3864887654781342e-001 5.3136289119720459e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 -1.4975425438024104e-004</internalNodes>
+          <leafValues>
+            -6.6509884595870972e-001 2.1483559906482697e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 -1.4625370968133211e-003</internalNodes>
+          <leafValues>
+            2.6556470990180969e-001 -4.9002227187156677e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -2.6019819779321551e-004</internalNodes>
+          <leafValues>
+            -7.0160359144210815e-001 1.6359129548072815e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 2.2371641534846276e-004</internalNodes>
+          <leafValues>
+            1.2919521331787109e-001 -6.9767206907272339e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -1.0447315871715546e-002</internalNodes>
+          <leafValues>
+            2.1837629377841949e-001 -4.6482038497924805e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 -9.2897024005651474e-003</internalNodes>
+          <leafValues>
+            6.4918082952499390e-001 -2.0495061576366425e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 13 -->
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.4440233707427979e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 9 8.5356216877698898e-003</internalNodes>
+          <leafValues>
+            -5.3151458501815796e-001 2.2357723116874695e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 1.5294685726985335e-003</internalNodes>
+          <leafValues>
+            -6.0895460844039917e-001 1.7429886758327484e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 1.8610086990520358e-003</internalNodes>
+          <leafValues>
+            -2.5480428338050842e-001 4.2150071263313293e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 1.5735558699816465e-003</internalNodes>
+          <leafValues>
+            -1.6832062602043152e-001 4.8567819595336914e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -6.7992787808179855e-004</internalNodes>
+          <leafValues>
+            3.9894598722457886e-001 -3.0744269490242004e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 4.9857296049594879e-002</internalNodes>
+          <leafValues>
+            -1.5370152890682220e-001 6.7523348331451416e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -2.8339058160781860e-002</internalNodes>
+          <leafValues>
+            5.0540882349014282e-001 -2.9473617672920227e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 -7.7956825494766235e-002</internalNodes>
+          <leafValues>
+            4.0387043356895447e-001 -3.0287107825279236e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 -3.6115488037467003e-003</internalNodes>
+          <leafValues>
+            6.3856112957000732e-001 -1.6917882859706879e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 3.3940275898203254e-004</internalNodes>
+          <leafValues>
+            1.3713537156581879e-001 -7.8120291233062744e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 4.0043061599135399e-003</internalNodes>
+          <leafValues>
+            1.5233094990253448e-001 -6.3939732313156128e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 -4.4601649278774858e-004</internalNodes>
+          <leafValues>
+            2.1333815157413483e-001 -4.7728902101516724e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 14 -->
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.2532578706741333e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 204 -2.0341124385595322e-002</internalNodes>
+          <leafValues>
+            2.4170616269111633e-001 -4.9161517620086670e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 8.9040049351751804e-004</internalNodes>
+          <leafValues>
+            -2.8570893406867981e-001 4.2666998505592346e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -3.3259526826441288e-003</internalNodes>
+          <leafValues>
+            4.2626520991325378e-001 -2.3811897635459900e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -3.1714607030153275e-002</internalNodes>
+          <leafValues>
+            -8.5494768619537354e-001 1.1712870001792908e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -1.1553820222616196e-002</internalNodes>
+          <leafValues>
+            2.2675493359565735e-001 -4.9640509486198425e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -6.7727260291576385e-002</internalNodes>
+          <leafValues>
+            -8.6705064773559570e-001 9.8765812814235687e-002</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -3.1611192971467972e-003</internalNodes>
+          <leafValues>
+            3.9449846744537354e-001 -2.8210711479187012e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 4.3221906526014209e-004</internalNodes>
+          <leafValues>
+            1.1805476248264313e-001 -9.0178310871124268e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -2.2296360111795366e-004</internalNodes>
+          <leafValues>
+            1.7324598133563995e-001 -5.2877873182296753e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -2.1440195851027966e-003</internalNodes>
+          <leafValues>
+            5.5513423681259155e-001 -1.9791823625564575e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -4.5122690498828888e-003</internalNodes>
+          <leafValues>
+            5.5083745718002319e-001 -1.8810540437698364e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 -3.5149464383721352e-003</internalNodes>
+          <leafValues>
+            5.5467557907104492e-001 -2.2856147587299347e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 -4.4786706566810608e-003</internalNodes>
+          <leafValues>
+            -7.9106998443603516e-001 1.7836479842662811e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 15 -->
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.1898330450057983e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 1.5206767246127129e-002</internalNodes>
+          <leafValues>
+            -4.9173194169998169e-001 2.7093595266342163e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 6.9564773002639413e-004</internalNodes>
+          <leafValues>
+            -2.3066598176956177e-001 5.4028344154357910e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 -8.3668017759919167e-004</internalNodes>
+          <leafValues>
+            4.4658055901527405e-001 -2.7778497338294983e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -3.8321319967508316e-002</internalNodes>
+          <leafValues>
+            -7.9069298505783081e-001 1.8700349330902100e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -2.1063965687062591e-004</internalNodes>
+          <leafValues>
+            -6.3163763284683228e-001 1.8656146526336670e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 3.6907330155372620e-002</internalNodes>
+          <leafValues>
+            9.9319733679294586e-002 -7.6762360334396362e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 8.1071127206087112e-003</internalNodes>
+          <leafValues>
+            -2.8561261296272278e-001 3.4748569130897522e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 6.2815943965688348e-004</internalNodes>
+          <leafValues>
+            1.6656193137168884e-001 -5.4635977745056152e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 2.8582263621501625e-004</internalNodes>
+          <leafValues>
+            -2.4100163578987122e-001 4.5410770177841187e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -1.9862279295921326e-002</internalNodes>
+          <leafValues>
+            -9.4317340850830078e-001 1.2513674795627594e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 1.1506280861794949e-003</internalNodes>
+          <leafValues>
+            -2.4514634907245636e-001 4.6452957391738892e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 2.3451185552403331e-004</internalNodes>
+          <leafValues>
+            1.2489952147006989e-001 -8.0278074741363525e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 6.7837134702131152e-004</internalNodes>
+          <leafValues>
+            -2.5017899274826050e-001 4.3841627240180969e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 3.1583159579895437e-004</internalNodes>
+          <leafValues>
+            1.5951988101005554e-001 -7.4524724483489990e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 7.2623658925294876e-003</internalNodes>
+          <leafValues>
+            1.2511830031871796e-001 -6.5659755468368530e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 16 -->
+    <_>
+      <maxWeakCount>15</maxWeakCount>
+      <stageThreshold>-1.2416906356811523e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2 7.5144092552363873e-003</internalNodes>
+          <leafValues>
+            -5.9518074989318848e-001 5.3793102502822876e-002</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -6.4494344405829906e-004</internalNodes>
+          <leafValues>
+            2.0429474115371704e-001 -4.3661779165267944e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 3.3831471228040755e-004</internalNodes>
+          <leafValues>
+            -2.1566553413867950e-001 4.7118204832077026e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 2.8320802375674248e-003</internalNodes>
+          <leafValues>
+            1.3322307169437408e-001 -8.3729231357574463e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 1.6218879027292132e-003</internalNodes>
+          <leafValues>
+            -2.0889574289321899e-001 4.7114694118499756e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 2.7122153551317751e-004</internalNodes>
+          <leafValues>
+            1.1475630849599838e-001 -7.8029519319534302e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 8.8358242064714432e-003</internalNodes>
+          <leafValues>
+            1.2460929155349731e-001 -7.6791721582412720e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 9.7634072881191969e-004</internalNodes>
+          <leafValues>
+            -2.0806105434894562e-001 5.1318311691284180e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 -2.1239042282104492e-002</internalNodes>
+          <leafValues>
+            -8.7171542644500732e-001 1.2721680104732513e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 7.1797124110162258e-004</internalNodes>
+          <leafValues>
+            -3.0763280391693115e-001 3.7504923343658447e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 2.7504155412316322e-002</internalNodes>
+          <leafValues>
+            1.5651945769786835e-001 -7.9516488313674927e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 1.0624636197462678e-003</internalNodes>
+          <leafValues>
+            1.3473348319530487e-001 -6.9174814224243164e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -8.1248432397842407e-002</internalNodes>
+          <leafValues>
+            -8.5117286443710327e-001 1.0601779073476791e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 -2.2936165332794189e-002</internalNodes>
+          <leafValues>
+            3.9202499389648438e-001 -2.9867398738861084e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -1.3326616026461124e-003</internalNodes>
+          <leafValues>
+            4.7240665555000305e-001 -2.6287403702735901e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 17 -->
+    <_>
+      <maxWeakCount>13</maxWeakCount>
+      <stageThreshold>-1.3383979797363281e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 3 3.2254494726657867e-002</internalNodes>
+          <leafValues>
+            -6.5151512622833252e-001 7.9947575926780701e-002</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 -1.1810796568170190e-003</internalNodes>
+          <leafValues>
+            2.5173431634902954e-001 -4.5536977052688599e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 8.0361258005723357e-004</internalNodes>
+          <leafValues>
+            -2.1178695559501648e-001 4.9318632483482361e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 6.6201295703649521e-004</internalNodes>
+          <leafValues>
+            -1.9441033899784088e-001 4.6225026249885559e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 3.4565184614621103e-004</internalNodes>
+          <leafValues>
+            -2.1175089478492737e-001 4.6985754370689392e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -5.6433549616485834e-004</internalNodes>
+          <leafValues>
+            -7.9713624715805054e-001 1.8714086711406708e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 5.8492692187428474e-004</internalNodes>
+          <leafValues>
+            -3.9330720901489258e-001 2.4242231249809265e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 2.5043603032827377e-002</internalNodes>
+          <leafValues>
+            1.3490234315395355e-001 -7.5923883914947510e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 -1.8510785885155201e-003</internalNodes>
+          <leafValues>
+            4.1279399394989014e-001 -2.7271771430969238e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -2.5741360150277615e-004</internalNodes>
+          <leafValues>
+            -6.3662034273147583e-001 1.8135882914066315e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.5121832489967346e-002</internalNodes>
+          <leafValues>
+            2.5249326229095459e-001 -3.8438034057617188e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -1.5006031841039658e-002</internalNodes>
+          <leafValues>
+            -8.4878319501876831e-001 1.1718367785215378e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 4.9880752339959145e-004</internalNodes>
+          <leafValues>
+            -2.6755046844482422e-001 4.5769825577735901e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 18 -->
+    <_>
+      <maxWeakCount>12</maxWeakCount>
+      <stageThreshold>-1.2097512483596802e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 195 -1.1614991351962090e-002</internalNodes>
+          <leafValues>
+            1.4465409517288208e-001 -5.9521216154098511e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 3.9767110138200223e-004</internalNodes>
+          <leafValues>
+            -4.2697989940643311e-001 2.4382311105728149e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -4.6969857066869736e-002</internalNodes>
+          <leafValues>
+            -9.3969690799713135e-001 1.2196484953165054e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 5.5550434626638889e-004</internalNodes>
+          <leafValues>
+            -1.8246935307979584e-001 6.5156191587448120e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 2.9468833236023784e-004</internalNodes>
+          <leafValues>
+            1.5099152922630310e-001 -7.8840750455856323e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 1.2439775280654430e-002</internalNodes>
+          <leafValues>
+            1.4981375634670258e-001 -7.5917595624923706e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 6.6337559837847948e-004</internalNodes>
+          <leafValues>
+            -2.5185841321945190e-001 5.9387433528900146e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -6.8454549182206392e-004</internalNodes>
+          <leafValues>
+            5.1199448108673096e-001 -2.5247576832771301e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 1.4808592386543751e-003</internalNodes>
+          <leafValues>
+            2.2439701855182648e-001 -5.8184891939163208e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 6.0307271778583527e-003</internalNodes>
+          <leafValues>
+            -4.3553912639617920e-001 2.8183382749557495e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -1.9170897081494331e-002</internalNodes>
+          <leafValues>
+            -8.5707378387451172e-001 1.4850790798664093e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 3.0278289341367781e-004</internalNodes>
+          <leafValues>
+            -3.1547480821609497e-001 4.1798374056816101e-001</leafValues></_></weakClassifiers></_>
+    <!-- stage 19 -->
+    <_>
+      <maxWeakCount>10</maxWeakCount>
+      <stageThreshold>-1.2253109216690063e+000</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 181 4.6847470104694366e-002</internalNodes>
+          <leafValues>
+            -4.9239391088485718e-001 5.2287584543228149e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 2.2181579843163490e-003</internalNodes>
+          <leafValues>
+            -4.2569425702095032e-001 3.6892616748809814e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 6.1082182219251990e-004</internalNodes>
+          <leafValues>
+            1.7654621601104736e-001 -8.2656937837600708e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 1.7401995137333870e-002</internalNodes>
+          <leafValues>
+            2.7770876884460449e-001 -5.6393522024154663e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 5.2314018830657005e-004</internalNodes>
+          <leafValues>
+            -3.6257097125053406e-001 4.6126455068588257e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 2.1581796463578939e-003</internalNodes>
+          <leafValues>
+            1.9110183417797089e-001 -6.8012320995330811e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -1.3209994649514556e-003</internalNodes>
+          <leafValues>
+            6.7618584632873535e-001 -2.6087108254432678e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 -1.2237254530191422e-002</internalNodes>
+          <leafValues>
+            -5.7184767723083496e-001 3.0778104066848755e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 8.7829465046525002e-003</internalNodes>
+          <leafValues>
+            1.6890920698642731e-001 -7.8835797309875488e-001</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 7.5588272884488106e-003</internalNodes>
+          <leafValues>
+            1.5143942832946777e-001 -8.2572847604751587e-001</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          0 0 10 10 -1.</_>
+        <_>
+          0 0 5 5 2.</_>
+        <_>
+          5 5 5 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 16 -1.</_>
+        <_>
+          6 0 6 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 10 6 -1.</_>
+        <_>
+          5 3 5 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 21 16 -1.</_>
+        <_>
+          7 3 7 16 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 9 -1.</_>
+        <_>
+          4 4 8 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 10 12 -1.</_>
+        <_>
+          5 4 5 12 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 14 7 -1.</_>
+        <_>
+          7 7 7 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 7 -1.</_>
+        <_>
+          6 9 6 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 60 3 -1.</_>
+        <_>
+          30 9 30 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 8 3 -1.</_>
+        <_>
+          4 10 4 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 1 2 -1.</_>
+        <_>
+          0 12 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 51 12 -1.</_>
+        <_>
+          1 4 51 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 15 7 -1.</_>
+        <_>
+          6 3 5 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 30 6 -1.</_>
+        <_>
+          1 7 15 3 2.</_>
+        <_>
+          16 10 15 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 12 1 2 -1.</_>
+        <_>
+          1 13 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 16 -1.</_>
+        <_>
+          2 6 18 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 29 4 -1.</_>
+        <_>
+          2 5 29 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 1 2 -1.</_>
+        <_>
+          2 10 1 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 40 6 -1.</_>
+        <_>
+          2 17 40 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 22 6 -1.</_>
+        <_>
+          3 2 22 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 2 38 2 -1.</_>
+        <_>
+          3 2 19 1 2.</_>
+        <_>
+          22 3 19 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 51 16 -1.</_>
+        <_>
+          3 8 51 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 7 3 8 -1.</_>
+        <_>
+          4 7 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 1 3 -1.</_>
+        <_>
+          3 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 3 5 -1.</_>
+        <_>
+          5 8 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 4 9 -1.</_>
+        <_>
+          5 8 2 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 36 9 -1.</_>
+        <_>
+          16 11 12 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 14 49 6 -1.</_>
+        <_>
+          4 17 49 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 17 6 -1.</_>
+        <_>
+          5 2 17 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 3 1 -1.</_>
+        <_>
+          6 1 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 8 2 -1.</_>
+        <_>
+          7 1 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 36 9 -1.</_>
+        <_>
+          17 2 12 9 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 33 17 -1.</_>
+        <_>
+          16 3 11 17 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 30 19 -1.</_>
+        <_>
+          16 0 10 19 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 29 4 -1.</_>
+        <_>
+          6 5 29 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 16 16 -1.</_>
+        <_>
+          14 4 8 16 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 54 1 -1.</_>
+        <_>
+          33 9 27 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 18 -1.</_>
+        <_>
+          8 0 2 18 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 12 15 -1.</_>
+        <_>
+          13 3 6 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 20 5 -1.</_>
+        <_>
+          12 4 10 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 3 -1.</_>
+        <_>
+          7 5 6 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 36 6 -1.</_>
+        <_>
+          19 4 12 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 28 4 -1.</_>
+        <_>
+          14 5 14 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 7 4 11 -1.</_>
+        <_>
+          8 7 2 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 7 -1.</_>
+        <_>
+          13 9 6 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 21 4 -1.</_>
+        <_>
+          8 3 21 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 28 6 -1.</_>
+        <_>
+          15 4 14 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 38 6 -1.</_>
+        <_>
+          8 10 38 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 14 25 4 -1.</_>
+        <_>
+          8 15 25 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 12 4 -1.</_>
+        <_>
+          12 2 6 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 24 3 -1.</_>
+        <_>
+          15 5 12 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 40 12 -1.</_>
+        <_>
+          9 12 40 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 8 2 -1.</_>
+        <_>
+          12 2 4 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 9 2 -1.</_>
+        <_>
+          13 2 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 3 3 -1.</_>
+        <_>
+          11 6 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 32 20 -1.</_>
+        <_>
+          19 0 16 20 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 1 4 -1.</_>
+        <_>
+          11 5 1 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 4 3 -1.</_>
+        <_>
+          12 9 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 3 7 -1.</_>
+        <_>
+          12 9 1 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 9 2 -1.</_>
+        <_>
+          15 3 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 6 -1.</_>
+        <_>
+          14 6 2 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 42 10 -1.</_>
+        <_>
+          26 10 14 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 14 11 3 -1.</_>
+        <_>
+          12 15 11 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 14 -1.</_>
+        <_>
+          15 4 2 14 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 6 -1.</_>
+        <_>
+          14 8 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 32 2 -1.</_>
+        <_>
+          21 11 16 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 25 6 -1.</_>
+        <_>
+          13 16 25 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 16 21 3 -1.</_>
+        <_>
+          20 16 7 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 2 -1.</_>
+        <_>
+          15 2 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 24 8 -1.</_>
+        <_>
+          20 2 12 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 13 36 6 -1.</_>
+        <_>
+          23 13 18 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 8 3 -1.</_>
+        <_>
+          14 15 8 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 14 45 6 -1.</_>
+        <_>
+          14 17 45 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 18 9 2 -1.</_>
+        <_>
+          17 18 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 9 4 1 -1.</_>
+        <_>
+          16 9 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 10 19 4 -1.</_>
+        <_>
+          15 12 19 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 28 8 -1.</_>
+        <_>
+          16 2 28 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 36 18 -1.</_>
+        <_>
+          28 2 12 18 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 24 6 -1.</_>
+        <_>
+          22 6 12 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 24 6 -1.</_>
+        <_>
+          17 3 24 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 3 15 12 -1.</_>
+        <_>
+          22 7 5 4 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 15 11 3 -1.</_>
+        <_>
+          17 16 11 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 6 10 -1.</_>
+        <_>
+          20 5 2 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 6 18 3 -1.</_>
+        <_>
+          24 6 6 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 11 3 1 -1.</_>
+        <_>
+          19 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 6 32 2 -1.</_>
+        <_>
+          27 6 16 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 8 3 1 -1.</_>
+        <_>
+          20 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 14 11 -1.</_>
+        <_>
+          26 9 7 11 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 10 3 3 -1.</_>
+        <_>
+          20 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 13 7 3 -1.</_>
+        <_>
+          19 14 7 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 14 13 3 -1.</_>
+        <_>
+          19 15 13 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 0 15 20 -1.</_>
+        <_>
+          25 0 5 20 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 9 3 1 -1.</_>
+        <_>
+          21 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 10 3 2 -1.</_>
+        <_>
+          21 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 1 21 6 -1.</_>
+        <_>
+          21 3 21 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 8 4 3 -1.</_>
+        <_>
+          22 8 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 9 3 4 -1.</_>
+        <_>
+          22 9 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 10 4 2 -1.</_>
+        <_>
+          22 10 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 11 24 2 -1.</_>
+        <_>
+          27 11 12 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 18 4 1 -1.</_>
+        <_>
+          22 18 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 3 4 1 -1.</_>
+        <_>
+          23 3 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 6 2 6 -1.</_>
+        <_>
+          22 6 1 3 2.</_>
+        <_>
+          23 9 1 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 7 3 3 -1.</_>
+        <_>
+          23 8 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 8 3 5 -1.</_>
+        <_>
+          23 8 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 9 3 2 -1.</_>
+        <_>
+          23 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 8 3 3 -1.</_>
+        <_>
+          24 8 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          23 10 3 2 -1.</_>
+        <_>
+          24 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          24 3 20 17 -1.</_>
+        <_>
+          29 3 10 17 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          24 4 14 6 -1.</_>
+        <_>
+          31 4 7 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          24 18 9 2 -1.</_>
+        <_>
+          27 18 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          25 5 8 4 -1.</_>
+        <_>
+          25 5 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          25 6 22 14 -1.</_>
+        <_>
+          36 6 11 14 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          25 12 28 8 -1.</_>
+        <_>
+          25 14 28 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          25 14 9 3 -1.</_>
+        <_>
+          25 15 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 2 27 18 -1.</_>
+        <_>
+          35 2 9 18 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 3 22 3 -1.</_>
+        <_>
+          26 4 22 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 4 8 4 -1.</_>
+        <_>
+          30 4 4 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 4 20 6 -1.</_>
+        <_>
+          31 4 10 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 7 1 12 -1.</_>
+        <_>
+          22 11 1 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 9 3 3 -1.</_>
+        <_>
+          27 9 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 13 9 3 -1.</_>
+        <_>
+          26 14 9 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 3 15 6 -1.</_>
+        <_>
+          32 3 5 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 9 3 1 -1.</_>
+        <_>
+          28 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 9 3 2 -1.</_>
+        <_>
+          28 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 10 3 3 -1.</_>
+        <_>
+          28 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 11 3 2 -1.</_>
+        <_>
+          28 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 2 10 4 -1.</_>
+        <_>
+          28 2 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 8 32 6 -1.</_>
+        <_>
+          28 10 32 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 10 3 1 -1.</_>
+        <_>
+          29 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 11 3 1 -1.</_>
+        <_>
+          29 11 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 15 5 4 -1.</_>
+        <_>
+          28 16 5 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 16 23 4 -1.</_>
+        <_>
+          28 17 23 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 19 6 1 -1.</_>
+        <_>
+          30 19 2 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 3 9 4 -1.</_>
+        <_>
+          32 3 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 5 9 1 -1.</_>
+        <_>
+          32 5 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 8 3 6 -1.</_>
+        <_>
+          30 8 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 9 3 1 -1.</_>
+        <_>
+          30 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 11 10 4 -1.</_>
+        <_>
+          29 13 10 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 11 26 8 -1.</_>
+        <_>
+          29 13 26 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 0 16 6 -1.</_>
+        <_>
+          30 3 16 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 2 30 6 -1.</_>
+        <_>
+          30 2 15 3 2.</_>
+        <_>
+          45 5 15 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 3 9 4 -1.</_>
+        <_>
+          33 3 3 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 5 9 4 -1.</_>
+        <_>
+          30 6 9 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 10 3 2 -1.</_>
+        <_>
+          31 10 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 14 18 6 -1.</_>
+        <_>
+          36 14 6 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 3 4 3 -1.</_>
+        <_>
+          32 3 2 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 7 4 9 -1.</_>
+        <_>
+          32 7 2 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 11 3 2 -1.</_>
+        <_>
+          32 11 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 11 3 3 -1.</_>
+        <_>
+          32 11 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          32 4 3 2 -1.</_>
+        <_>
+          33 4 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          32 6 18 6 -1.</_>
+        <_>
+          32 6 9 3 2.</_>
+        <_>
+          41 9 9 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 1 22 6 -1.</_>
+        <_>
+          33 4 22 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 3 4 2 -1.</_>
+        <_>
+          34 3 2 2 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 3 4 4 -1.</_>
+        <_>
+          34 3 2 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 5 4 1 -1.</_>
+        <_>
+          34 5 2 1 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 9 3 6 -1.</_>
+        <_>
+          34 9 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 10 3 3 -1.</_>
+        <_>
+          34 10 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 8 4 7 -1.</_>
+        <_>
+          35 8 2 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 9 3 5 -1.</_>
+        <_>
+          35 9 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 18 9 2 -1.</_>
+        <_>
+          37 18 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          35 0 8 6 -1.</_>
+        <_>
+          37 0 4 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          35 9 3 2 -1.</_>
+        <_>
+          36 9 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          36 9 24 9 -1.</_>
+        <_>
+          42 9 12 9 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          37 1 16 18 -1.</_>
+        <_>
+          41 1 8 18 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          37 11 20 8 -1.</_>
+        <_>
+          42 11 10 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          38 8 15 12 -1.</_>
+        <_>
+          38 12 15 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          39 6 12 8 -1.</_>
+        <_>
+          45 6 6 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          40 8 8 4 -1.</_>
+        <_>
+          40 8 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          40 10 3 1 -1.</_>
+        <_>
+          41 10 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          40 10 3 5 -1.</_>
+        <_>
+          41 10 1 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          40 13 12 6 -1.</_>
+        <_>
+          43 13 6 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          41 5 7 15 -1.</_>
+        <_>
+          41 10 7 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          41 6 12 6 -1.</_>
+        <_>
+          45 6 4 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          41 7 12 7 -1.</_>
+        <_>
+          45 7 4 7 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          41 8 12 12 -1.</_>
+        <_>
+          45 8 4 12 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          41 9 3 6 -1.</_>
+        <_>
+          42 9 1 6 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          42 2 3 13 -1.</_>
+        <_>
+          43 2 1 13 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          42 4 18 10 -1.</_>
+        <_>
+          42 4 9 5 2.</_>
+        <_>
+          51 9 9 5 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          42 5 18 8 -1.</_>
+        <_>
+          42 5 9 4 2.</_>
+        <_>
+          51 9 9 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          42 7 2 7 -1.</_>
+        <_>
+          43 7 1 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          42 14 12 5 -1.</_>
+        <_>
+          46 14 4 5 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          43 1 10 9 -1.</_>
+        <_>
+          40 4 10 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          43 6 6 6 -1.</_>
+        <_>
+          43 9 6 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 0 8 20 -1.</_>
+        <_>
+          46 0 4 20 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 2 16 12 -1.</_>
+        <_>
+          44 2 8 6 2.</_>
+        <_>
+          52 8 8 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 5 3 8 -1.</_>
+        <_>
+          45 5 1 8 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 8 3 4 -1.</_>
+        <_>
+          45 8 1 4 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 12 16 4 -1.</_>
+        <_>
+          52 12 8 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          44 13 10 3 -1.</_>
+        <_>
+          49 13 5 3 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          45 19 9 1 -1.</_>
+        <_>
+          48 19 3 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          46 3 8 8 -1.</_>
+        <_>
+          50 3 4 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          47 12 10 6 -1.</_>
+        <_>
+          52 12 5 6 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          48 0 4 13 -1.</_>
+        <_>
+          49 0 2 13 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          48 5 3 12 -1.</_>
+        <_>
+          45 8 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          48 9 12 8 -1.</_>
+        <_>
+          54 9 6 8 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          48 13 12 4 -1.</_>
+        <_>
+          54 13 6 4 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          49 8 3 1 -1.</_>
+        <_>
+          50 8 1 1 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          49 8 3 2 -1.</_>
+        <_>
+          50 8 1 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          49 8 3 3 -1.</_>
+        <_>
+          50 8 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          50 9 3 3 -1.</_>
+        <_>
+          51 10 1 1 9.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          51 8 3 3 -1.</_>
+        <_>
+          52 8 1 3 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          52 6 6 10 -1.</_>
+        <_>
+          54 6 2 10 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          52 7 8 7 -1.</_>
+        <_>
+          56 7 4 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          52 8 8 4 -1.</_>
+        <_>
+          52 8 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          54 3 6 15 -1.</_>
+        <_>
+          57 3 3 15 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          54 8 6 7 -1.</_>
+        <_>
+          57 8 3 7 2.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          57 11 3 6 -1.</_>
+        <_>
+          57 13 3 2 3.</_></rects>
+      <tilted>0</tilted></_>
+    <_>
+      <rects>
+        <_>
+          59 8 1 3 -1.</_>
+        <_>
+          59 9 1 1 3.</_></rects>
+      <tilted>0</tilted></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_smile.xml b/venv/Lib/site-packages/cv2/data/haarcascade_smile.xml
new file mode 100644
index 000000000..bbdd896ad
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_smile.xml
@@ -0,0 +1,6729 @@
+<?xml version="1.0"?>
+<!--
+  Smile detector
+  Contributed by Oscar Deniz Suarez
+  More information can be found at http://visilab.etsii.uclm.es/personas/oscar/oscar.html
+
+//////////////////////////////////////////////////////////////////////////
+| Contributors License Agreement
+| IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+|   By downloading, copying, installing or using the software you agree
+|   to this license.
+|   If you do not agree to this license, do not download, install,
+|   copy or use the software.
+|
+| Copyright (c) 2011, Modesto Castrillon-Santana (IUSIANI, Universidad de
+| Las Palmas de Gran Canaria, Spain).
+|  All rights reserved.
+|
+| Redistribution and use in source and binary forms, with or without
+| modification, are permitted provided that the following conditions are
+| met:
+|
+|    * Redistributions of source code must retain the above copyright
+|       notice, this list of conditions and the following disclaimer.
+|    * Redistributions in binary form must reproduce the above
+|      copyright notice, this list of conditions and the following
+|      disclaimer in the documentation and/or other materials provided
+|      with the distribution.
+|    * The name of Contributor may not used to endorse or promote products
+|      derived from this software without specific prior written permission.
+|
+| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+| "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+| LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+| A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+| CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+| EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+| PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+| PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+| LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+| NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+| Top
+//////////////////////////////////////////////////////////////////////////
+
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>18</height>
+  <width>36</width>
+  <stageParams>
+    <maxWeakCount>53</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>20</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>11</maxWeakCount>
+      <stageThreshold>-1.2678639888763428e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 -4.8783610691316426e-04</internalNodes>
+          <leafValues>
+            5.9219348430633545e-01 -4.4163608551025391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 -4.2209611274302006e-04</internalNodes>
+          <leafValues>
+            3.0318650603294373e-01 -3.2912918925285339e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -4.9940118333324790e-04</internalNodes>
+          <leafValues>
+            4.8563310503959656e-01 -4.2923060059547424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 3.7289198487997055e-02</internalNodes>
+          <leafValues>
+            -2.8667300939559937e-01 5.9979999065399170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 1.4334049774333835e-03</internalNodes>
+          <leafValues>
+            -3.4893131256103516e-01 4.0482750535011292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 -7.7213020995259285e-03</internalNodes>
+          <leafValues>
+            7.5714188814163208e-01 -1.2225949764251709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 8.1067271530628204e-03</internalNodes>
+          <leafValues>
+            -1.6657720506191254e-01 7.5096148252487183e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 -7.7238711528480053e-03</internalNodes>
+          <leafValues>
+            6.2662792205810547e-01 -1.9127459824085236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 4.4225031160749495e-04</internalNodes>
+          <leafValues>
+            -2.3944470286369324e-01 4.4840618968009949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 -1.6867710510268807e-03</internalNodes>
+          <leafValues>
+            -1.8439069390296936e-01 9.1782413423061371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 1.4625620096921921e-02</internalNodes>
+          <leafValues>
+            1.6168059408664703e-01 -8.1501179933547974e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>11</maxWeakCount>
+      <stageThreshold>-1.5844069719314575e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 11 3.8141138851642609e-02</internalNodes>
+          <leafValues>
+            -3.3275881409645081e-01 7.7833342552185059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 -1.3136120105627924e-04</internalNodes>
+          <leafValues>
+            3.6353090405464172e-01 -3.2043468952178955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 -3.8757019210606813e-03</internalNodes>
+          <leafValues>
+            7.1352392435073853e-01 -3.5185989737510681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 1.4266290236264467e-03</internalNodes>
+          <leafValues>
+            6.8100847303867340e-02 -6.1727327108383179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 -2.4605958606116474e-04</internalNodes>
+          <leafValues>
+            5.7271498441696167e-01 -3.7860998511314392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 -3.1822640448808670e-02</internalNodes>
+          <leafValues>
+            -6.3484561443328857e-01 1.1641839891672134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 -1.7130950465798378e-02</internalNodes>
+          <leafValues>
+            -6.2793147563934326e-01 3.2479470968246460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -9.3903783708810806e-03</internalNodes>
+          <leafValues>
+            -2.7578958868980408e-01 2.2330729663372040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 2.2802520543336868e-03</internalNodes>
+          <leafValues>
+            1.8977640569210052e-01 -6.8817621469497681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 20 2.6840099599212408e-03</internalNodes>
+          <leafValues>
+            -2.2350500524044037e-01 1.3725799322128296e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 1.0604639537632465e-02</internalNodes>
+          <leafValues>
+            -2.1426230669021606e-01 5.6207871437072754e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>17</maxWeakCount>
+      <stageThreshold>-1.3820559978485107e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 22 -3.1677199876867235e-04</internalNodes>
+          <leafValues>
+            4.6595481038093567e-01 -3.7425819039344788e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 -5.5120628327131271e-02</internalNodes>
+          <leafValues>
+            5.4179787635803223e-01 -2.2657650709152222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 -6.4742640824988484e-04</internalNodes>
+          <leafValues>
+            3.7703070044517517e-01 -3.3486440777778625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 3.9507839083671570e-01</internalNodes>
+          <leafValues>
+            -1.8144419789314270e-01 8.1325918436050415e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 4.0509410202503204e-02</internalNodes>
+          <leafValues>
+            -9.5369413495063782e-02 8.0595618486404419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 4.8735421150922775e-03</internalNodes>
+          <leafValues>
+            -1.4023660123348236e-01 6.1643028259277344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 1.0578040033578873e-02</internalNodes>
+          <leafValues>
+            1.2932670116424561e-01 -7.4823349714279175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 9.2986393719911575e-03</internalNodes>
+          <leafValues>
+            5.8940600603818893e-02 -4.4107300043106079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 -5.0301607698202133e-03</internalNodes>
+          <leafValues>
+            -6.6309732198715210e-01 1.8104769289493561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -1.0947990085696802e-04</internalNodes>
+          <leafValues>
+            2.2112590074539185e-01 -2.7309039235115051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -1.1685509979724884e-01</internalNodes>
+          <leafValues>
+            -7.7205967903137207e-01 1.2481659650802612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 -4.3603649828583002e-05</internalNodes>
+          <leafValues>
+            1.3670609891414642e-01 -1.6127939522266388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -1.5056360280141234e-04</internalNodes>
+          <leafValues>
+            4.4860461354255676e-01 -2.1711289882659912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -1.6394609585404396e-02</internalNodes>
+          <leafValues>
+            -6.5827351808547974e-01 1.6745500266551971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 -1.4482860453426838e-02</internalNodes>
+          <leafValues>
+            -6.8345147371292114e-01 1.3456159830093384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 3.9269471017178148e-05</internalNodes>
+          <leafValues>
+            -1.4998139441013336e-01 1.6017720103263855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 7.4323131702840328e-03</internalNodes>
+          <leafValues>
+            -1.6848459839820862e-01 5.3963989019393921e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>18</maxWeakCount>
+      <stageThreshold>-1.3879380226135254e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 39 -4.3472499237395823e-04</internalNodes>
+          <leafValues>
+            4.3949240446090698e-01 -4.2248758673667908e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 3.2995320856571198e-02</internalNodes>
+          <leafValues>
+            -1.9798250496387482e-01 5.9534871578216553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 -4.1011828579939902e-04</internalNodes>
+          <leafValues>
+            4.4403061270713806e-01 -3.0748468637466431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -8.1969738006591797e-02</internalNodes>
+          <leafValues>
+            -5.3334367275238037e-01 1.6718100011348724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 1.7778700217604637e-02</internalNodes>
+          <leafValues>
+            -2.0450179278850555e-01 5.1444131135940552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 2.2834699600934982e-02</internalNodes>
+          <leafValues>
+            -1.4846070110797882e-01 5.6242787837982178e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 3.8604341447353363e-02</internalNodes>
+          <leafValues>
+            -1.2731470167636871e-01 8.1494480371475220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -7.3286908445879817e-04</internalNodes>
+          <leafValues>
+            -3.7193441390991211e-01 6.7616499960422516e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -2.3229040205478668e-02</internalNodes>
+          <leafValues>
+            7.1232062578201294e-01 -1.1589390039443970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -1.9575359299778938e-02</internalNodes>
+          <leafValues>
+            -6.8990731239318848e-01 1.3999509811401367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 4.1991271427832544e-04</internalNodes>
+          <leafValues>
+            -1.8354649841785431e-01 4.9435558915138245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -5.7089749723672867e-02</internalNodes>
+          <leafValues>
+            6.2607848644256592e-01 -7.8576847910881042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 2.5699699297547340e-02</internalNodes>
+          <leafValues>
+            1.1557140201330185e-01 -8.1935191154479980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 3.2579619437456131e-02</internalNodes>
+          <leafValues>
+            -1.1767739802598953e-01 4.2776221036911011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 53 -2.0592249929904938e-02</internalNodes>
+          <leafValues>
+            4.8685240745544434e-01 -2.1318539977073669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 -1.7485279589891434e-02</internalNodes>
+          <leafValues>
+            -5.2287340164184570e-01 1.3397049903869629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 8.9153228327631950e-04</internalNodes>
+          <leafValues>
+            9.6304491162300110e-02 -6.8863070011138916e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 5.7533901184797287e-02</internalNodes>
+          <leafValues>
+            -8.7080523371696472e-02 4.0480649471282959e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.3538850545883179e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 57 -4.6606198884546757e-04</internalNodes>
+          <leafValues>
+            4.2773741483688354e-01 -3.5420769453048706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 3.0554559826850891e-01</internalNodes>
+          <leafValues>
+            -1.6392810642719269e-01 8.6065232753753662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 -1.1449400335550308e-02</internalNodes>
+          <leafValues>
+            5.9727329015731812e-01 -2.3234340548515320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 6.3891541212797165e-03</internalNodes>
+          <leafValues>
+            -1.2915410101413727e-01 6.1052042245864868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 -8.4334248676896095e-03</internalNodes>
+          <leafValues>
+            4.7928538918495178e-01 -1.9002729654312134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 5.3808931261301041e-02</internalNodes>
+          <leafValues>
+            -1.1493770033121109e-01 5.3394538164138794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 -4.7580219688825309e-04</internalNodes>
+          <leafValues>
+            -3.4598541259765625e-01 2.5488048791885376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 -1.3450840197037905e-04</internalNodes>
+          <leafValues>
+            2.2414590418338776e-01 -1.9550070166587830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 5.0016911700367928e-04</internalNodes>
+          <leafValues>
+            -1.9720549881458282e-01 4.9677640199661255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 1.5063269995152950e-02</internalNodes>
+          <leafValues>
+            1.0630770027637482e-01 -4.1138210892677307e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 7.7588870190083981e-03</internalNodes>
+          <leafValues>
+            -1.5373119711875916e-01 4.8931619524955750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 4.5410118997097015e-02</internalNodes>
+          <leafValues>
+            -7.3559306561946869e-02 2.7737921476364136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 -1.4599669724702835e-02</internalNodes>
+          <leafValues>
+            -7.0966827869415283e-01 9.7515560686588287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 1.7236070707440376e-02</internalNodes>
+          <leafValues>
+            1.6869539394974709e-02 -5.7388329505920410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 1.4230710454285145e-02</internalNodes>
+          <leafValues>
+            9.4714500010013580e-02 -7.8395259380340576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 -4.3706860393285751e-02</internalNodes>
+          <leafValues>
+            6.0979652404785156e-01 -1.5601889789104462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -6.2343222089111805e-04</internalNodes>
+          <leafValues>
+            3.4851190447807312e-01 -2.1704910695552826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 1.9245050847530365e-02</internalNodes>
+          <leafValues>
+            -1.1710979789495468e-01 3.0701160430908203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 2.7035778760910034e-01</internalNodes>
+          <leafValues>
+            -9.0096436440944672e-02 7.6656961441040039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -3.5394480801187456e-04</internalNodes>
+          <leafValues>
+            -2.0024789869785309e-01 1.2493360042572021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -3.6013960838317871e-02</internalNodes>
+          <leafValues>
+            6.7028558254241943e-01 -1.0571879893541336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 9.2952791601419449e-03</internalNodes>
+          <leafValues>
+            -1.0574710369110107e-01 4.5093879103660583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 -3.3304709359072149e-04</internalNodes>
+          <leafValues>
+            2.7933821082115173e-01 -2.4576769769191742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -2.9147620807634667e-05</internalNodes>
+          <leafValues>
+            8.5813812911510468e-02 -9.5469586551189423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 4.4382669148035347e-04</internalNodes>
+          <leafValues>
+            -2.0220080018043518e-01 5.4543578624725342e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.3707510232925415e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 82 7.9610757529735565e-03</internalNodes>
+          <leafValues>
+            -3.6722078919410706e-01 4.3154349923133850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 6.3394829630851746e-02</internalNodes>
+          <leafValues>
+            -2.0739710330963135e-01 5.7426017522811890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -5.3193349391222000e-02</internalNodes>
+          <leafValues>
+            7.2550922632217407e-01 -1.4342020452022552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 1.5460769645869732e-02</internalNodes>
+          <leafValues>
+            -9.6053816378116608e-02 7.5785237550735474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 -1.7643140628933907e-02</internalNodes>
+          <leafValues>
+            6.6815620660781860e-01 -1.4176729321479797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 9.5065636560320854e-03</internalNodes>
+          <leafValues>
+            -9.6259742975234985e-02 4.6996331214904785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 4.0446049533784389e-03</internalNodes>
+          <leafValues>
+            -1.9732519984245300e-01 4.2838010191917419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 3.2312041148543358e-03</internalNodes>
+          <leafValues>
+            1.1861690133810043e-01 -6.1039632558822632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -4.0159050375223160e-02</internalNodes>
+          <leafValues>
+            -4.1664341092109680e-01 2.1672329306602478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 2.8524258732795715e-01</internalNodes>
+          <leafValues>
+            -1.0435750335454941e-01 8.5733968019485474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 -4.9264221452176571e-03</internalNodes>
+          <leafValues>
+            4.7060468792915344e-01 -1.3997459411621094e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 1.3781700283288956e-02</internalNodes>
+          <leafValues>
+            -1.2713569402694702e-01 4.4618919491767883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 -4.9873598618432879e-04</internalNodes>
+          <leafValues>
+            4.7026631236076355e-01 -1.5483739972114563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 -1.5621389320585877e-04</internalNodes>
+          <leafValues>
+            1.8854810297489166e-01 -7.7839776873588562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 -3.7597760092467070e-04</internalNodes>
+          <leafValues>
+            5.7697701454162598e-01 -1.3356220722198486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 -1.0665910318493843e-02</internalNodes>
+          <leafValues>
+            -4.1065299510955811e-01 1.5562120079994202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -3.4135230816900730e-03</internalNodes>
+          <leafValues>
+            -7.6363432407379150e-01 1.0209649801254272e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 5.6471868447260931e-05</internalNodes>
+          <leafValues>
+            -1.6443930566310883e-01 2.2908419370651245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 2.1611599368043244e-04</internalNodes>
+          <leafValues>
+            -1.6290329396724701e-01 4.5756360888481140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -1.0822719894349575e-02</internalNodes>
+          <leafValues>
+            -2.4462530016899109e-01 1.3888940215110779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 -1.5084910206496716e-02</internalNodes>
+          <leafValues>
+            -5.7813477516174316e-01 1.1564119905233383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 2.5715960189700127e-02</internalNodes>
+          <leafValues>
+            3.9631199091672897e-02 -6.5270012617111206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 2.6093570049852133e-03</internalNodes>
+          <leafValues>
+            1.1421889811754227e-01 -5.6801080703735352e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>26</maxWeakCount>
+      <stageThreshold>-1.3303329944610596e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 105 -5.1861900836229324e-02</internalNodes>
+          <leafValues>
+            7.0431172847747803e-01 -2.2143700718879700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 -5.0341628491878510e-02</internalNodes>
+          <leafValues>
+            -4.6397829055786133e-01 2.8047460317611694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 2.5709730386734009e-01</internalNodes>
+          <leafValues>
+            -1.3124279677867889e-01 8.2395941019058228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 1.1031899601221085e-02</internalNodes>
+          <leafValues>
+            -1.4258140325546265e-01 6.3823902606964111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 1.8565090373158455e-02</internalNodes>
+          <leafValues>
+            -1.5123879909515381e-01 5.9881192445755005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 1.7502350732684135e-02</internalNodes>
+          <leafValues>
+            -1.2619799375534058e-01 3.8178038597106934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 7.2723729535937309e-03</internalNodes>
+          <leafValues>
+            -1.5103289484977722e-01 5.8128422498703003e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 8.1504750996828079e-03</internalNodes>
+          <leafValues>
+            -6.5464757382869720e-02 5.6397551298141479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -1.8552739173173904e-02</internalNodes>
+          <leafValues>
+            5.3157097101211548e-01 -1.2526570260524750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 -2.3101480677723885e-02</internalNodes>
+          <leafValues>
+            -6.7949390411376953e-01 1.1046259850263596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -1.8539339362177998e-04</internalNodes>
+          <leafValues>
+            3.0100038647651672e-01 -2.1206699311733246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 1.7319120466709137e-02</internalNodes>
+          <leafValues>
+            -9.3738131225109100e-02 2.1008560061454773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 1.4305620454251766e-02</internalNodes>
+          <leafValues>
+            1.8005949258804321e-01 -3.9776718616485596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 2.5763340294361115e-02</internalNodes>
+          <leafValues>
+            8.7056998163461685e-03 -6.2894952297210693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 -1.5383340418338776e-02</internalNodes>
+          <leafValues>
+            -5.3415471315383911e-01 1.0380730032920837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 1.0605469578877091e-03</internalNodes>
+          <leafValues>
+            -9.0128518640995026e-02 1.6792120039463043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 3.5230729263275862e-03</internalNodes>
+          <leafValues>
+            -1.7110690474510193e-01 3.2596540451049805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -1.0789279825985432e-02</internalNodes>
+          <leafValues>
+            3.6109921336174011e-01 -6.6339150071144104e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 2.7950939536094666e-01</internalNodes>
+          <leafValues>
+            -7.4605897068977356e-02 7.3369878530502319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 124 3.8369540125131607e-03</internalNodes>
+          <leafValues>
+            4.4873539358377457e-02 -1.8602700531482697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 1.6195949865505099e-03</internalNodes>
+          <leafValues>
+            -1.3922490179538727e-01 4.3437001109123230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 1.1647949926555157e-02</internalNodes>
+          <leafValues>
+            -7.4357591569423676e-02 5.4201442003250122e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -5.9066400863230228e-03</internalNodes>
+          <leafValues>
+            -7.0557588338851929e-01 8.6433619260787964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 3.9686840772628784e-01</internalNodes>
+          <leafValues>
+            -7.4898369610309601e-02 9.4062858819961548e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 5.7663779705762863e-02</internalNodes>
+          <leafValues>
+            -9.6558406949043274e-02 5.4182428121566772e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 6.0319568961858749e-02</internalNodes>
+          <leafValues>
+            -6.6501073539257050e-02 6.4023548364639282e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>37</maxWeakCount>
+      <stageThreshold>-1.5300060510635376e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 131 1.9050249829888344e-02</internalNodes>
+          <leafValues>
+            -4.4433408975601196e-01 4.3948569893836975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -2.0198300480842590e-02</internalNodes>
+          <leafValues>
+            -3.1706219911575317e-01 1.0432930290699005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 2.1478030830621719e-02</internalNodes>
+          <leafValues>
+            -3.5024839639663696e-01 2.6355370879173279e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 -1.0187759995460510e-01</internalNodes>
+          <leafValues>
+            -5.9889578819274902e-01 1.7685799300670624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 1.0974160395562649e-02</internalNodes>
+          <leafValues>
+            -1.4895239472389221e-01 6.0115218162536621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -1.1476710438728333e-02</internalNodes>
+          <leafValues>
+            4.0665709972381592e-01 -1.2404689937829971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -2.3431150242686272e-02</internalNodes>
+          <leafValues>
+            -7.1487832069396973e-01 1.4278119802474976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 1.4963559806346893e-03</internalNodes>
+          <leafValues>
+            -1.7045859992504120e-01 1.7193080484867096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -5.4855772759765387e-04</internalNodes>
+          <leafValues>
+            3.1553238630294800e-01 -2.1444450318813324e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 7.4912630021572113e-02</internalNodes>
+          <leafValues>
+            9.1240562498569489e-02 -6.3951212167739868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 6.8816398270428181e-03</internalNodes>
+          <leafValues>
+            -1.4904409646987915e-01 4.7952368855476379e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 -3.8212578743696213e-02</internalNodes>
+          <leafValues>
+            5.2887737751007080e-01 -6.1894729733467102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 4.4051730073988438e-03</internalNodes>
+          <leafValues>
+            -1.1934129893779755e-01 5.0613421201705933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 2.3966899141669273e-02</internalNodes>
+          <leafValues>
+            -8.9720509946346283e-02 3.3152779936790466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 -3.4162990748882294e-02</internalNodes>
+          <leafValues>
+            5.3134781122207642e-01 -1.4666500687599182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 1.9642219413071871e-03</internalNodes>
+          <leafValues>
+            9.0783588588237762e-02 -4.3032559752464294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 9.6757910796441138e-05</internalNodes>
+          <leafValues>
+            2.2552539408206940e-01 -2.8220710158348083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 -3.2862399239093065e-03</internalNodes>
+          <leafValues>
+            4.0515020489692688e-01 -1.1776199936866760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 1.1688309721648693e-02</internalNodes>
+          <leafValues>
+            -9.1857127845287323e-02 6.2834888696670532e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -6.0287420637905598e-03</internalNodes>
+          <leafValues>
+            3.9261808991432190e-01 -1.2287150323390961e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 -1.3721340335905552e-02</internalNodes>
+          <leafValues>
+            -5.5298799276351929e-01 9.1041281819343567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 7.5626641511917114e-02</internalNodes>
+          <leafValues>
+            -4.4929590076208115e-02 1.7442759871482849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 9.3434482812881470e-02</internalNodes>
+          <leafValues>
+            -8.4593951702117920e-02 6.0131162405014038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 5.8748829178512096e-03</internalNodes>
+          <leafValues>
+            -4.4131498783826828e-02 3.9565709233283997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 4.0064537897706032e-03</internalNodes>
+          <leafValues>
+            -1.1414399743080139e-01 3.7925380468368530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 2.2945459932088852e-02</internalNodes>
+          <leafValues>
+            2.4673189967870712e-02 -4.1521999239921570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.2810460291802883e-02</internalNodes>
+          <leafValues>
+            -5.1557427644729614e-01 9.1319613158702850e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 2.0425529778003693e-01</internalNodes>
+          <leafValues>
+            -6.5927542746067047e-02 7.5942492485046387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 4.9796327948570251e-03</internalNodes>
+          <leafValues>
+            1.0806279629468918e-01 -5.0016272068023682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 2.8397630900144577e-02</internalNodes>
+          <leafValues>
+            -3.7152960896492004e-02 5.4010647535324097e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 6.0867150314152241e-03</internalNodes>
+          <leafValues>
+            -1.1978609859943390e-01 3.5692268610000610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -2.1456899412441999e-04</internalNodes>
+          <leafValues>
+            1.8740150332450867e-01 -8.8417202234268188e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 2.8941858909092844e-04</internalNodes>
+          <leafValues>
+            -1.2597979605197906e-01 3.9982271194458008e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 -1.3047619722783566e-03</internalNodes>
+          <leafValues>
+            1.5499970316886902e-01 -7.5386047363281250e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 -1.2975010089576244e-02</internalNodes>
+          <leafValues>
+            -5.5344110727310181e-01 8.2354247570037842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 7.7442410401999950e-03</internalNodes>
+          <leafValues>
+            2.7699800208210945e-02 -3.4835991263389587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 2.4850629270076752e-03</internalNodes>
+          <leafValues>
+            -1.2976129353046417e-01 3.7908831238746643e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>21</maxWeakCount>
+      <stageThreshold>-1.4114329814910889e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 168 -4.0386881679296494e-02</internalNodes>
+          <leafValues>
+            5.9603548049926758e-01 -3.5741761326789856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 169 -6.6068649175576866e-05</internalNodes>
+          <leafValues>
+            4.4628980755805969e-01 -3.5959470272064209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 3.7622239906340837e-03</internalNodes>
+          <leafValues>
+            1.7947019636631012e-01 -7.5631511211395264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 -3.0967719852924347e-02</internalNodes>
+          <leafValues>
+            -2.8847050666809082e-01 7.6870530843734741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 3.0566560104489326e-02</internalNodes>
+          <leafValues>
+            1.4003600180149078e-01 -7.1755367517471313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 9.9054910242557526e-04</internalNodes>
+          <leafValues>
+            8.2915589213371277e-02 -2.9197171330451965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 1.2577700428664684e-02</internalNodes>
+          <leafValues>
+            1.5380719304084778e-01 -4.6882930397987366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 1.2392920255661011e-01</internalNodes>
+          <leafValues>
+            -9.0823858976364136e-02 7.3837572336196899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 3.7737488746643066e-01</internalNodes>
+          <leafValues>
+            -5.4232951253652573e-02 9.2291218042373657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 1.0996370017528534e-01</internalNodes>
+          <leafValues>
+            9.1596268117427826e-02 -6.5977168083190918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 -1.2721329694613814e-03</internalNodes>
+          <leafValues>
+            3.3475750684738159e-01 -1.8290689587593079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 4.6906251460313797e-02</internalNodes>
+          <leafValues>
+            -8.3971053361892700e-02 6.9847589731216431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 3.2869930146262050e-04</internalNodes>
+          <leafValues>
+            1.8794630467891693e-01 -2.9290059208869934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 1.7333080177195370e-04</internalNodes>
+          <leafValues>
+            -2.6964160799980164e-01 3.4947571158409119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 1.9800959154963493e-02</internalNodes>
+          <leafValues>
+            -1.4679229259490967e-01 4.3995618820190430e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 2.0056760695297271e-04</internalNodes>
+          <leafValues>
+            -1.3727410137653351e-01 2.2213310003280640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.4923149719834328e-03</internalNodes>
+          <leafValues>
+            3.4735259413719177e-01 -1.5948210656642914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -4.2736999603221193e-05</internalNodes>
+          <leafValues>
+            3.1527870893478394e-01 -2.3066949844360352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 6.6625140607357025e-04</internalNodes>
+          <leafValues>
+            -2.0131100714206696e-01 2.8691890835762024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 1.3850460163666867e-05</internalNodes>
+          <leafValues>
+            -2.0219239592552185e-01 2.3073309659957886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 4.0972631424665451e-02</internalNodes>
+          <leafValues>
+            7.9543180763721466e-02 -8.0795639753341675e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>23</maxWeakCount>
+      <stageThreshold>-1.3777890205383301e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 189 -4.6982929110527039e-02</internalNodes>
+          <leafValues>
+            7.0822530984878540e-01 -3.7034240365028381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -7.5753079727292061e-04</internalNodes>
+          <leafValues>
+            -1.2550309300422668e-01 1.3944420218467712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 1.5327299945056438e-02</internalNodes>
+          <leafValues>
+            2.1613539755344391e-01 -5.6293952465057373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 1.8147040158510208e-02</internalNodes>
+          <leafValues>
+            -3.2079648226499557e-02 3.2347559928894043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 4.7347191721200943e-02</internalNodes>
+          <leafValues>
+            -1.7381580173969269e-01 5.7580447196960449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -5.9837941080331802e-02</internalNodes>
+          <leafValues>
+            4.7797870635986328e-01 -1.0260280221700668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 -5.2796799689531326e-02</internalNodes>
+          <leafValues>
+            -4.7988489270210266e-01 1.8787759542465210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 -2.4385429918766022e-02</internalNodes>
+          <leafValues>
+            -3.0841669440269470e-01 8.7605630978941917e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 2.5288300588726997e-02</internalNodes>
+          <leafValues>
+            1.3914039731025696e-01 -7.1094942092895508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 -2.1612450480461121e-02</internalNodes>
+          <leafValues>
+            -2.3282539844512939e-01 8.0994680523872375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 3.4023479092866182e-03</internalNodes>
+          <leafValues>
+            -2.2989900410175323e-01 3.7889510393142700e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 1.1274600028991699e-01</internalNodes>
+          <leafValues>
+            -1.5474709682166576e-02 5.7030540704727173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 3.4516870975494385e-02</internalNodes>
+          <leafValues>
+            -1.2300080060958862e-01 5.6775367259979248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 7.8984811902046204e-02</internalNodes>
+          <leafValues>
+            -1.4242169260978699e-01 4.6941858530044556e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -1.5377859584987164e-02</internalNodes>
+          <leafValues>
+            6.3946861028671265e-01 -1.1236190050840378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 -2.2373620595317334e-04</internalNodes>
+          <leafValues>
+            5.5583298206329346e-01 -2.7247580885887146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 -2.4762390181422234e-02</internalNodes>
+          <leafValues>
+            -5.0404858589172363e-01 1.4077790081501007e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 -9.4061157142277807e-05</internalNodes>
+          <leafValues>
+            3.7195280194282532e-01 -2.2502990067005157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 -2.0256359130144119e-02</internalNodes>
+          <leafValues>
+            5.1051008701324463e-01 -1.4298759400844574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 4.8122879117727280e-02</internalNodes>
+          <leafValues>
+            -6.6979512572288513e-02 3.6622309684753418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -2.3787800222635269e-02</internalNodes>
+          <leafValues>
+            5.0813251733779907e-01 -1.2908150255680084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -1.0520319920033216e-03</internalNodes>
+          <leafValues>
+            -1.5604670345783234e-01 6.6213317215442657e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 -2.6640200521796942e-03</internalNodes>
+          <leafValues>
+            -7.2545582056045532e-01 8.2365453243255615e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>25</maxWeakCount>
+      <stageThreshold>-1.3266400098800659e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 212 -5.0224620848894119e-02</internalNodes>
+          <leafValues>
+            7.0845657587051392e-01 -2.5585499405860901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 1.4072869904339314e-02</internalNodes>
+          <leafValues>
+            6.3033178448677063e-02 -5.9838529676198959e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 1.7804009839892387e-02</internalNodes>
+          <leafValues>
+            1.9414719939231873e-01 -5.8444267511367798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 215 1.3046739995479584e-01</internalNodes>
+          <leafValues>
+            -1.1516980081796646e-01 8.5040301084518433e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 1.7506800591945648e-02</internalNodes>
+          <leafValues>
+            -2.0718969404697418e-01 4.6438288688659668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -7.4240020476281643e-03</internalNodes>
+          <leafValues>
+            -6.6565167903900146e-01 1.4034989476203918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -3.4571118652820587e-02</internalNodes>
+          <leafValues>
+            6.5112978219985962e-01 -1.4901919662952423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 4.2270249687135220e-03</internalNodes>
+          <leafValues>
+            -1.6027219826355577e-03 3.8956061005592346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 -5.0662040710449219e-02</internalNodes>
+          <leafValues>
+            5.8035767078399658e-01 -1.5141439437866211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -7.0715770125389099e-03</internalNodes>
+          <leafValues>
+            5.3008967638015747e-01 -1.4498309791088104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 -1.1863510124385357e-02</internalNodes>
+          <leafValues>
+            6.7297422885894775e-01 -1.1063549667596817e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 -6.0520030558109283e-02</internalNodes>
+          <leafValues>
+            -3.3164489269256592e-01 2.1195560693740845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -7.7340779826045036e-03</internalNodes>
+          <leafValues>
+            -6.9414401054382324e-01 7.2705313563346863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -3.2486140727996826e-02</internalNodes>
+          <leafValues>
+            -5.1850819587707520e-01 5.9212621301412582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 8.3279706537723541e-02</internalNodes>
+          <leafValues>
+            1.2067940086126328e-01 -5.3095632791519165e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 7.8782817581668496e-04</internalNodes>
+          <leafValues>
+            -2.7376559376716614e-01 2.7162519097328186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 -1.7539180815219879e-02</internalNodes>
+          <leafValues>
+            -5.6902301311492920e-01 1.2287370115518570e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 -5.8226347900927067e-03</internalNodes>
+          <leafValues>
+            4.3865859508514404e-01 -1.4937420189380646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 -1.0057560168206692e-02</internalNodes>
+          <leafValues>
+            -6.6168862581253052e-01 1.1445429921150208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 9.0345427393913269e-02</internalNodes>
+          <leafValues>
+            -6.6665247082710266e-02 2.8706479072570801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 -6.7587293684482574e-02</internalNodes>
+          <leafValues>
+            -5.3637611865997314e-01 1.1237519979476929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 -8.1747528165578842e-03</internalNodes>
+          <leafValues>
+            4.4342419505119324e-01 -1.2977659702301025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -1.1550550349056721e-02</internalNodes>
+          <leafValues>
+            3.2731580734252930e-01 -1.7007610201835632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 -1.7406829283572733e-04</internalNodes>
+          <leafValues>
+            1.3278679549694061e-01 -1.0812939703464508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 4.6040047891438007e-03</internalNodes>
+          <leafValues>
+            -1.2265820056200027e-01 4.4125801324844360e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>17</maxWeakCount>
+      <stageThreshold>-1.4497200250625610e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 237 -4.6943280845880508e-02</internalNodes>
+          <leafValues>
+            6.0943442583084106e-01 -2.6378008723258972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 -1.6899159527383745e-04</internalNodes>
+          <leafValues>
+            1.6658750176429749e-01 -1.2541960179805756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 2.7983370237052441e-03</internalNodes>
+          <leafValues>
+            1.9057449698448181e-01 -6.5680772066116333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 4.0413960814476013e-03</internalNodes>
+          <leafValues>
+            -1.7317469418048859e-01 6.3620752096176147e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 -8.6033362895250320e-03</internalNodes>
+          <leafValues>
+            6.0258418321609497e-01 -2.3169369995594025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 8.8247945532202721e-03</internalNodes>
+          <leafValues>
+            -1.7565830051898956e-01 7.1041667461395264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 -9.2786159366369247e-03</internalNodes>
+          <leafValues>
+            -6.8908572196960449e-01 1.7896500229835510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 6.0826768167316914e-03</internalNodes>
+          <leafValues>
+            -1.7063720524311066e-01 5.3757482767105103e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 -3.9007369428873062e-02</internalNodes>
+          <leafValues>
+            -6.8346357345581055e-01 1.4417080581188202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 -7.0337951183319092e-02</internalNodes>
+          <leafValues>
+            -6.5085667371749878e-01 1.0085479915142059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 3.3166699111461639e-02</internalNodes>
+          <leafValues>
+            -1.9325719773769379e-01 4.7798651456832886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 7.5288906693458557e-02</internalNodes>
+          <leafValues>
+            -6.9567732512950897e-02 4.1250649094581604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -7.0501729846000671e-02</internalNodes>
+          <leafValues>
+            7.1573007106781006e-01 -1.0222700238227844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 1.2249490246176720e-02</internalNodes>
+          <leafValues>
+            -1.0612429678440094e-01 6.2959581613540649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 7.0644676685333252e-02</internalNodes>
+          <leafValues>
+            -9.7374632954597473e-02 6.7622041702270508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 1.6248880326747894e-01</internalNodes>
+          <leafValues>
+            5.2713360637426376e-02 -8.4946572780609131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 1.3808250427246094e-01</internalNodes>
+          <leafValues>
+            1.4064790308475494e-01 -4.7647210955619812e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>20</maxWeakCount>
+      <stageThreshold>-1.4622910022735596e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 254 -4.1882339864969254e-02</internalNodes>
+          <leafValues>
+            -8.0774527788162231e-01 2.6409670710563660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 -5.3622990846633911e-02</internalNodes>
+          <leafValues>
+            5.5807042121887207e-01 -2.4989689886569977e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 9.3709938228130341e-03</internalNodes>
+          <leafValues>
+            2.6501700282096863e-01 -5.9906947612762451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 1.3909730128943920e-02</internalNodes>
+          <leafValues>
+            -1.4709180593490601e-01 7.3546671867370605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 1.9003570079803467e-02</internalNodes>
+          <leafValues>
+            -1.8875110149383545e-01 7.4874222278594971e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 5.9199850074946880e-03</internalNodes>
+          <leafValues>
+            -1.5995639562606812e-01 5.6735777854919434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 260 -2.4705139920115471e-02</internalNodes>
+          <leafValues>
+            7.5569921731948853e-01 -1.2350880354642868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 1.6058359295129776e-02</internalNodes>
+          <leafValues>
+            -1.2824609875679016e-01 5.1294547319412231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 8.8288700208067894e-03</internalNodes>
+          <leafValues>
+            -1.6866639256477356e-01 6.1521852016448975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 1.7556339502334595e-02</internalNodes>
+          <leafValues>
+            -1.0901699960231781e-01 5.8031761646270752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 4.2188119143247604e-02</internalNodes>
+          <leafValues>
+            1.4866240322589874e-01 -6.9222331047058105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 5.0687207840383053e-04</internalNodes>
+          <leafValues>
+            3.1580869108438492e-02 -3.7009951472282410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 2.7651190757751465e-03</internalNodes>
+          <leafValues>
+            -2.1337540447711945e-01 4.7043010592460632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 -1.2231520377099514e-03</internalNodes>
+          <leafValues>
+            -7.8189671039581299e-01 2.0954260602593422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 8.5432287305593491e-03</internalNodes>
+          <leafValues>
+            -1.4553520083427429e-01 6.7895042896270752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 -2.0657219283748418e-04</internalNodes>
+          <leafValues>
+            2.4376240372657776e-01 -6.7558802664279938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 -4.6798270195722580e-03</internalNodes>
+          <leafValues>
+            6.6841697692871094e-01 -1.3887880742549896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 1.2201759964227676e-01</internalNodes>
+          <leafValues>
+            1.1028160154819489e-01 -7.5307422876358032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 2.0404340699315071e-02</internalNodes>
+          <leafValues>
+            1.6453839838504791e-01 -5.2231621742248535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 8.0343370791524649e-04</internalNodes>
+          <leafValues>
+            -1.3012850284576416e-01 2.6358529925346375e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>28</maxWeakCount>
+      <stageThreshold>-1.3885619640350342e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 274 7.2791710495948792e-02</internalNodes>
+          <leafValues>
+            -1.3727900385856628e-01 8.2915747165679932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 7.5939209200441837e-03</internalNodes>
+          <leafValues>
+            -1.6780120134353638e-01 5.6839722394943237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -2.3562390357255936e-02</internalNodes>
+          <leafValues>
+            6.5005600452423096e-01 -1.4245350658893585e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 1.7392950132489204e-02</internalNodes>
+          <leafValues>
+            -1.5291449427604675e-01 3.4253540635108948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 7.1825802326202393e-02</internalNodes>
+          <leafValues>
+            -9.9131137132644653e-02 8.2796788215637207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 1.3673800043761730e-02</internalNodes>
+          <leafValues>
+            -4.1787270456552505e-02 5.0781482458114624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 -2.8585959225893021e-02</internalNodes>
+          <leafValues>
+            7.0115321874618530e-01 -1.3144710659980774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -4.1845720261335373e-04</internalNodes>
+          <leafValues>
+            2.8454670310020447e-01 -3.1232029199600220e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -5.2095681428909302e-02</internalNodes>
+          <leafValues>
+            4.1812941431999207e-01 -1.6993130743503571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 3.2256329432129860e-03</internalNodes>
+          <leafValues>
+            -9.0466208755970001e-02 3.0086231231689453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 3.4771639853715897e-02</internalNodes>
+          <leafValues>
+            -8.4216788411140442e-02 7.8016638755798340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -1.3356630224734545e-03</internalNodes>
+          <leafValues>
+            3.3164530992507935e-01 -1.6960920393466949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 2.5101980566978455e-01</internalNodes>
+          <leafValues>
+            -1.3920469582080841e-01 6.6338932514190674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 -9.9689997732639313e-03</internalNodes>
+          <leafValues>
+            -3.7138170003890991e-01 1.2900120019912720e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 1.4303729869425297e-02</internalNodes>
+          <leafValues>
+            1.5729199349880219e-01 -5.0938212871551514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 -7.0856059901416302e-03</internalNodes>
+          <leafValues>
+            4.6567910909652710e-01 -6.6270820796489716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 -4.6260809176601470e-04</internalNodes>
+          <leafValues>
+            2.9337310791015625e-01 -2.3339860141277313e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 -3.4435480833053589e-02</internalNodes>
+          <leafValues>
+            7.0024740695953369e-01 -1.0133510082960129e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 -7.2570890188217163e-03</internalNodes>
+          <leafValues>
+            -5.6286412477493286e-01 1.3148620724678040e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 4.8352940939366817e-04</internalNodes>
+          <leafValues>
+            2.6227489113807678e-02 -2.6050800085067749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -1.2999939732253551e-02</internalNodes>
+          <leafValues>
+            5.3117001056671143e-01 -1.2023050338029861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 -1.0009329998865724e-03</internalNodes>
+          <leafValues>
+            3.9641299843788147e-01 -1.5995159745216370e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 4.1314200498163700e-03</internalNodes>
+          <leafValues>
+            -1.4929920434951782e-01 4.2959120869636536e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 8.7364455685019493e-03</internalNodes>
+          <leafValues>
+            -1.1271020025014877e-01 4.9456471204757690e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 2.6352869463153183e-04</internalNodes>
+          <leafValues>
+            -1.2124919891357422e-01 4.9439379572868347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -5.3885959088802338e-02</internalNodes>
+          <leafValues>
+            7.0355987548828125e-01 -1.3230550102889538e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 4.2885672301054001e-03</internalNodes>
+          <leafValues>
+            -1.7540550231933594e-01 3.5679468512535095e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 7.9539399594068527e-03</internalNodes>
+          <leafValues>
+            -9.9884003400802612e-02 3.1371670961380005e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>53</maxWeakCount>
+      <stageThreshold>-1.2766569852828979e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 302 5.6752368807792664e-02</internalNodes>
+          <leafValues>
+            -3.2576480507850647e-01 3.7375938892364502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 303 7.0906039327383041e-03</internalNodes>
+          <leafValues>
+            -1.3918629288673401e-01 1.5039840340614319e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -4.1298821568489075e-02</internalNodes>
+          <leafValues>
+            4.7026079893112183e-01 -1.6179360449314117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 4.7750189900398254e-01</internalNodes>
+          <leafValues>
+            -1.0061579942703247e-01 7.6350742578506470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 4.2266491055488586e-01</internalNodes>
+          <leafValues>
+            -3.5190910100936890e-02 8.3031260967254639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -3.3031899482011795e-02</internalNodes>
+          <leafValues>
+            -3.7505549192428589e-01 4.8902619630098343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 1.1923770216526464e-04</internalNodes>
+          <leafValues>
+            -2.6614668965339661e-01 2.2346520423889160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 4.2101400904357433e-03</internalNodes>
+          <leafValues>
+            8.7575968354940414e-03 -5.9383517503738403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 3.3337279455736279e-04</internalNodes>
+          <leafValues>
+            -2.1227659285068512e-01 2.4735039472579956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 1.1793890036642551e-02</internalNodes>
+          <leafValues>
+            -6.8997949361801147e-02 5.8980828523635864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 -1.1432079970836639e-01</internalNodes>
+          <leafValues>
+            -7.7333682775497437e-01 6.2862291932106018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 8.2401007413864136e-02</internalNodes>
+          <leafValues>
+            1.6825279220938683e-02 -6.1700117588043213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 1.8126150593161583e-02</internalNodes>
+          <leafValues>
+            9.9533468484878540e-02 -3.8309159874916077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 8.9282449334859848e-03</internalNodes>
+          <leafValues>
+            -1.0109739750623703e-01 2.9483050107955933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 -1.7437100410461426e-02</internalNodes>
+          <leafValues>
+            4.6149870753288269e-01 -1.0506360232830048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -1.1280310340225697e-02</internalNodes>
+          <leafValues>
+            4.5611649751663208e-01 -1.0131160169839859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 7.0190089754760265e-03</internalNodes>
+          <leafValues>
+            -1.3686269521713257e-01 4.1732659935951233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 -3.2439709175378084e-03</internalNodes>
+          <leafValues>
+            2.3216480016708374e-01 -1.7915369570255280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 3.5615891218185425e-01</internalNodes>
+          <leafValues>
+            -4.8626810312271118e-02 9.5373457670211792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 3.8440749049186707e-03</internalNodes>
+          <leafValues>
+            -1.0288280248641968e-01 3.6717781424522400e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 6.0950029641389847e-02</internalNodes>
+          <leafValues>
+            5.6141741573810577e-02 -6.4585697650909424e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 1.8149229884147644e-01</internalNodes>
+          <leafValues>
+            3.0806390568614006e-02 -4.6048960089683533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -9.2359259724617004e-02</internalNodes>
+          <leafValues>
+            -4.5248210430145264e-01 8.8152237236499786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 7.6072998344898224e-03</internalNodes>
+          <leafValues>
+            -9.7122326493263245e-02 2.1552249789237976e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -4.6946710790507495e-04</internalNodes>
+          <leafValues>
+            -4.0893718600273132e-01 8.0042190849781036e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 1.0301820293534547e-04</internalNodes>
+          <leafValues>
+            -1.1530359834432602e-01 2.7955350279808044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 2.7936851256527007e-04</internalNodes>
+          <leafValues>
+            -1.1396100372076035e-01 2.9316601157188416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 2.4675959348678589e-01</internalNodes>
+          <leafValues>
+            -3.8595631718635559e-02 8.2649981975555420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 -8.4232958033680916e-03</internalNodes>
+          <leafValues>
+            3.2995969057083130e-01 -1.1645369976758957e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 -4.2311567813158035e-03</internalNodes>
+          <leafValues>
+            2.7142119407653809e-01 -1.0811480134725571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 1.5653009759262204e-03</internalNodes>
+          <leafValues>
+            7.8253783285617828e-02 -5.2097660303115845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -5.0341398455202579e-03</internalNodes>
+          <leafValues>
+            2.9488059878349304e-01 -4.6960510313510895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 1.4283140189945698e-03</internalNodes>
+          <leafValues>
+            -1.3794599473476410e-01 2.4323709309101105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 1.9031369686126709e-01</internalNodes>
+          <leafValues>
+            -5.2093509584665298e-02 6.8708032369613647e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 8.1368777900934219e-03</internalNodes>
+          <leafValues>
+            -5.3311519324779510e-02 5.8272719383239746e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 -4.6728368848562241e-02</internalNodes>
+          <leafValues>
+            3.5525360703468323e-01 -1.7806259915232658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 1.4317169785499573e-02</internalNodes>
+          <leafValues>
+            -1.2626640498638153e-01 2.6961010694503784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 -9.6109732985496521e-02</internalNodes>
+          <leafValues>
+            3.4117481112480164e-01 -3.9217609912157059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 7.4878811836242676e-02</internalNodes>
+          <leafValues>
+            -6.4819902181625366e-02 5.6711381673812866e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 -5.1972299843328074e-05</internalNodes>
+          <leafValues>
+            2.8742098808288574e-01 -1.6428899765014648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -2.0099039829801768e-04</internalNodes>
+          <leafValues>
+            2.6590210199356079e-01 -1.2990359961986542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 1.5583490021526814e-02</internalNodes>
+          <leafValues>
+            3.6322619765996933e-02 -8.8743317127227783e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 6.7313341423869133e-03</internalNodes>
+          <leafValues>
+            1.6281859576702118e-01 -1.9716200232505798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -4.5251410454511642e-02</internalNodes>
+          <leafValues>
+            -2.0315009355545044e-01 1.5734089910984039e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 2.8729529003612697e-04</internalNodes>
+          <leafValues>
+            -1.2449590116739273e-01 2.5658228993415833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 -2.1028579212725163e-03</internalNodes>
+          <leafValues>
+            -5.0887292623519897e-01 3.4083180129528046e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -3.9328099228441715e-03</internalNodes>
+          <leafValues>
+            -3.3933758735656738e-01 9.3055568635463715e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 3.1205590348690748e-03</internalNodes>
+          <leafValues>
+            -2.2794060409069061e-02 2.3793530464172363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 7.8028678894042969e-02</internalNodes>
+          <leafValues>
+            -4.4503621757030487e-02 6.7763942480087280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 4.2476978152990341e-02</internalNodes>
+          <leafValues>
+            9.2582106590270996e-02 -3.5363018512725830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 -2.5768300518393517e-02</internalNodes>
+          <leafValues>
+            -9.0919911861419678e-01 2.6692839339375496e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 6.1444669961929321e-02</internalNodes>
+          <leafValues>
+            -2.4954399093985558e-02 7.2120499610900879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 3.5776318982243538e-03</internalNodes>
+          <leafValues>
+            1.7728990316390991e-01 -1.9723449647426605e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>38</maxWeakCount>
+      <stageThreshold>-1.4061349630355835e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 355 2.8585961461067200e-01</internalNodes>
+          <leafValues>
+            -1.5396049618721008e-01 6.6246771812438965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 9.2271259054541588e-03</internalNodes>
+          <leafValues>
+            -1.0746339708566666e-01 4.3118068575859070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 2.2924109362065792e-03</internalNodes>
+          <leafValues>
+            -1.9830130040645599e-01 3.8422289490699768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 1.4004509896039963e-02</internalNodes>
+          <leafValues>
+            -1.9249489903450012e-01 3.4424918889999390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 9.6023201942443848e-02</internalNodes>
+          <leafValues>
+            1.2990599870681763e-01 -6.0653048753738403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 6.1803720891475677e-03</internalNodes>
+          <leafValues>
+            -1.9046460092067719e-01 1.8918620049953461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 361 8.2172285765409470e-03</internalNodes>
+          <leafValues>
+            -2.5182679295539856e-01 2.6644590497016907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 -1.4542760327458382e-03</internalNodes>
+          <leafValues>
+            2.7102690935134888e-01 -1.2041489779949188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 3.0185449868440628e-03</internalNodes>
+          <leafValues>
+            -1.3538609445095062e-01 4.7336030006408691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 -3.4214779734611511e-03</internalNodes>
+          <leafValues>
+            -5.0499719381332397e-01 1.0424809902906418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 9.5980763435363770e-03</internalNodes>
+          <leafValues>
+            -1.0347290337085724e-01 5.8372837305068970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 4.1849957779049873e-03</internalNodes>
+          <leafValues>
+            5.8896709233522415e-02 -4.6232289075851440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -4.6107750385999680e-03</internalNodes>
+          <leafValues>
+            3.7835618853569031e-01 -1.2590229511260986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 2.8978679329156876e-03</internalNodes>
+          <leafValues>
+            -1.3699549436569214e-01 2.5951480865478516e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 4.2606070637702942e-03</internalNodes>
+          <leafValues>
+            8.8233962655067444e-02 -6.3902848958969116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 -4.2996238917112350e-03</internalNodes>
+          <leafValues>
+            -7.9539728164672852e-01 1.7093559727072716e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 3.5423618555068970e-01</internalNodes>
+          <leafValues>
+            -5.9345040470361710e-02 8.5579198598861694e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 -3.0245838570408523e-04</internalNodes>
+          <leafValues>
+            3.1470650434494019e-01 -1.4486099779605865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 2.7169490233063698e-02</internalNodes>
+          <leafValues>
+            -1.2492950260639191e-01 4.2809039354324341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 3.4571529831737280e-03</internalNodes>
+          <leafValues>
+            3.9709329605102539e-02 -7.0891571044921875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 2.1742798853665590e-03</internalNodes>
+          <leafValues>
+            6.5872453153133392e-02 -6.9496941566467285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 2.5263810530304909e-02</internalNodes>
+          <leafValues>
+            -1.1693959683179855e-01 1.9049769639968872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -2.4720989167690277e-02</internalNodes>
+          <leafValues>
+            -4.9657958745956421e-01 1.0175380110740662e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 1.0384880006313324e-02</internalNodes>
+          <leafValues>
+            -1.1486739665269852e-01 3.3741530776023865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 5.0045028328895569e-03</internalNodes>
+          <leafValues>
+            -1.0963550209999084e-01 3.9255198836326599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 7.1279620751738548e-03</internalNodes>
+          <leafValues>
+            -6.4908191561698914e-02 4.0420401096343994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 1.9700419157743454e-02</internalNodes>
+          <leafValues>
+            -7.9375877976417542e-02 5.3082340955734253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 4.2097331024706364e-03</internalNodes>
+          <leafValues>
+            4.0797021239995956e-02 -6.0440987348556519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 4.4459570199251175e-03</internalNodes>
+          <leafValues>
+            -1.0386230051517487e-01 4.0935981273651123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 -5.9610428288578987e-03</internalNodes>
+          <leafValues>
+            -5.2914947271347046e-01 8.0539450049400330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 5.7519221445545554e-04</internalNodes>
+          <leafValues>
+            6.3804402947425842e-02 -5.8636617660522461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 6.0524851083755493e-02</internalNodes>
+          <leafValues>
+            -3.3712800592184067e-02 2.6311159133911133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -1.0353810153901577e-02</internalNodes>
+          <leafValues>
+            -4.7920021414756775e-01 8.0043956637382507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -2.2777510806918144e-02</internalNodes>
+          <leafValues>
+            -3.1162750720977783e-01 1.1899980157613754e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 -2.2468879818916321e-02</internalNodes>
+          <leafValues>
+            -6.6083461046218872e-01 5.2234489470720291e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 5.8432162040844560e-04</internalNodes>
+          <leafValues>
+            5.4630339145660400e-02 -4.6395659446716309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -3.6177870351821184e-03</internalNodes>
+          <leafValues>
+            6.7447042465209961e-01 -5.8789528906345367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 3.0088860541582108e-02</internalNodes>
+          <leafValues>
+            3.3133521676063538e-02 -4.6461370587348938e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>40</maxWeakCount>
+      <stageThreshold>-1.3384460210800171e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 393 -7.2600990533828735e-02</internalNodes>
+          <leafValues>
+            6.3907092809677124e-01 -1.5124550461769104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 3.4712558984756470e-01</internalNodes>
+          <leafValues>
+            -7.9024657607078552e-02 7.9550421237945557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 3.4297230839729309e-01</internalNodes>
+          <leafValues>
+            -1.2300959974527359e-01 6.5728098154067993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 3.5616940259933472e-01</internalNodes>
+          <leafValues>
+            -5.3733438253402710e-02 8.2851082086563110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 6.0840700753033161e-03</internalNodes>
+          <leafValues>
+            -1.2847210466861725e-01 3.3822679519653320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 -1.6281309945043176e-04</internalNodes>
+          <leafValues>
+            3.0356609821319580e-01 -2.5182029604911804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 1.1281900107860565e-02</internalNodes>
+          <leafValues>
+            -8.3914346992969513e-02 4.3475928902626038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 7.4357059784233570e-03</internalNodes>
+          <leafValues>
+            -6.7088037729263306e-02 3.7227979302406311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 -9.0576216578483582e-02</internalNodes>
+          <leafValues>
+            -5.8319610357284546e-01 8.0146759748458862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 8.8247694075107574e-03</internalNodes>
+          <leafValues>
+            1.2901930510997772e-01 -4.7603130340576172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 -2.6147770695388317e-03</internalNodes>
+          <leafValues>
+            -4.0002208948135376e-01 1.1246310174465179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -2.5541300419718027e-04</internalNodes>
+          <leafValues>
+            3.2386159896850586e-01 -2.3331870138645172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 405 2.6547629386186600e-02</internalNodes>
+          <leafValues>
+            7.2333872318267822e-02 -5.8378398418426514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 -5.1383141428232193e-02</internalNodes>
+          <leafValues>
+            -2.2446189820766449e-01 4.0949739515781403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 3.3701129723340273e-03</internalNodes>
+          <leafValues>
+            -1.6717089712619781e-01 2.5526970624923706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 -2.2581920493394136e-03</internalNodes>
+          <leafValues>
+            -9.2079228162765503e-01 3.4371060319244862e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 -1.3282749569043517e-04</internalNodes>
+          <leafValues>
+            1.8573220074176788e-01 -2.2498969733715057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 -2.8032590635120869e-03</internalNodes>
+          <leafValues>
+            -8.5897541046142578e-01 4.6384520828723907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 1.3141379458829761e-03</internalNodes>
+          <leafValues>
+            7.9627066850662231e-02 -4.6105968952178955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 6.3884541392326355e-02</internalNodes>
+          <leafValues>
+            -5.3440149873495102e-02 8.1045001745223999e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 -1.9811019301414490e-03</internalNodes>
+          <leafValues>
+            -6.3825148344039917e-01 7.6643556356430054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 1.3359859585762024e-02</internalNodes>
+          <leafValues>
+            -9.5037549734115601e-02 6.2533348798751831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 -1.0935300088021904e-04</internalNodes>
+          <leafValues>
+            1.7479540407657623e-01 -2.2876030206680298e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 1.1910630390048027e-02</internalNodes>
+          <leafValues>
+            -7.7041983604431152e-02 5.0458377599716187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 2.3951700329780579e-01</internalNodes>
+          <leafValues>
+            -6.5122887492179871e-02 5.0420749187469482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 3.9831408858299255e-01</internalNodes>
+          <leafValues>
+            -2.9999820515513420e-02 7.9685479402542114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 6.1875800602138042e-03</internalNodes>
+          <leafValues>
+            -8.5339173674583435e-02 3.9451768994331360e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 -9.4047123566269875e-03</internalNodes>
+          <leafValues>
+            -4.3441331386566162e-01 8.2619100809097290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 1.1736630462110043e-02</internalNodes>
+          <leafValues>
+            6.9483160972595215e-02 -4.8706498742103577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 -1.5176770277321339e-02</internalNodes>
+          <leafValues>
+            -5.8541208505630493e-01 3.2879561185836792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 3.0744259711354971e-03</internalNodes>
+          <leafValues>
+            -1.3146080076694489e-01 2.5466740131378174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 2.9391339048743248e-03</internalNodes>
+          <leafValues>
+            -1.0860230028629303e-01 2.7834960818290710e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 2.1510310471057892e-03</internalNodes>
+          <leafValues>
+            -1.5750579535961151e-01 2.0877860486507416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 5.3775361739099026e-03</internalNodes>
+          <leafValues>
+            -1.3207030296325684e-01 3.7672939896583557e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 2.2174179553985596e-02</internalNodes>
+          <leafValues>
+            -9.0180292725563049e-02 4.1575270891189575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 -1.9948610570281744e-03</internalNodes>
+          <leafValues>
+            2.5608581304550171e-01 -9.9084928631782532e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 3.1557559967041016e-02</internalNodes>
+          <leafValues>
+            7.4188999831676483e-02 -5.4940229654312134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 -4.3111158447572961e-05</internalNodes>
+          <leafValues>
+            3.0324628949165344e-01 -1.7781810462474823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 -3.2675920519977808e-03</internalNodes>
+          <leafValues>
+            -6.7212432622909546e-01 5.9188328683376312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 4.2293380829505622e-04</internalNodes>
+          <leafValues>
+            -1.1034099757671356e-01 1.2573179602622986e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>-1.2722699642181396e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 433 -4.2562019079923630e-02</internalNodes>
+          <leafValues>
+            3.3346658945083618e-01 -2.9861980676651001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 4.1827198863029480e-01</internalNodes>
+          <leafValues>
+            -9.5138698816299438e-02 7.5709921121597290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 -2.0256379619240761e-02</internalNodes>
+          <leafValues>
+            4.7783890366554260e-01 -1.4592100679874420e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -1.8948309123516083e-02</internalNodes>
+          <leafValues>
+            -3.8727501034736633e-01 5.2479889243841171e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 -4.0550589561462402e-02</internalNodes>
+          <leafValues>
+            5.4646247625350952e-01 -8.1399857997894287e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 5.1872748136520386e-01</internalNodes>
+          <leafValues>
+            -2.7930539101362228e-02 8.4580981731414795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 2.0713619887828827e-01</internalNodes>
+          <leafValues>
+            -5.8850869536399841e-02 7.9601562023162842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 8.1972572952508926e-03</internalNodes>
+          <leafValues>
+            -9.9966369569301605e-02 4.9831560254096985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 1.7445389181375504e-02</internalNodes>
+          <leafValues>
+            6.8040959537029266e-02 -5.6699818372726440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 -5.6310281157493591e-02</internalNodes>
+          <leafValues>
+            -6.8628042936325073e-01 7.4222557246685028e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 1.8095560371875763e-01</internalNodes>
+          <leafValues>
+            -5.2808128297328949e-02 8.4483182430267334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 -2.3450690787285566e-03</internalNodes>
+          <leafValues>
+            2.8396940231323242e-01 -1.1123369634151459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 3.8937770295888186e-03</internalNodes>
+          <leafValues>
+            6.5499313175678253e-02 -5.7920962572097778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 3.9383721741614863e-05</internalNodes>
+          <leafValues>
+            -3.0930471420288086e-01 4.2237108945846558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 3.3899158239364624e-02</internalNodes>
+          <leafValues>
+            3.0707539990544319e-02 -7.2299808263778687e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -3.3644389361143112e-02</internalNodes>
+          <leafValues>
+            4.2664441466331482e-01 -7.2005778551101685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 449 3.8807760924100876e-02</internalNodes>
+          <leafValues>
+            -4.1713520884513855e-02 6.5995568037033081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -3.9149548683781177e-05</internalNodes>
+          <leafValues>
+            4.9335500597953796e-01 -2.4260109663009644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 -2.7580570895224810e-04</internalNodes>
+          <leafValues>
+            1.7910109460353851e-01 -2.1925190091133118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 1.2636659666895866e-02</internalNodes>
+          <leafValues>
+            -7.1233622729778290e-02 2.5342619419097900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 -3.3681739587336779e-03</internalNodes>
+          <leafValues>
+            3.3100861310958862e-01 -1.0207779705524445e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -4.1184529662132263e-02</internalNodes>
+          <leafValues>
+            -4.7871989011764526e-01 2.7444809675216675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 1.7285279929637909e-02</internalNodes>
+          <leafValues>
+            -2.3733820021152496e-01 1.5414300560951233e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -5.8373320847749710e-02</internalNodes>
+          <leafValues>
+            3.6355251073837280e-01 -6.2911927700042725e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 2.5229319930076599e-02</internalNodes>
+          <leafValues>
+            -9.4345822930335999e-02 4.3224421143531799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 4.7925519756972790e-03</internalNodes>
+          <leafValues>
+            4.8664271831512451e-02 -4.7046890854835510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 -1.3549529830925167e-04</internalNodes>
+          <leafValues>
+            1.9361880421638489e-01 -1.9338470697402954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -1.7969410866498947e-02</internalNodes>
+          <leafValues>
+            2.9000860452651978e-01 -5.4545279592275620e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 1.1141040362417698e-02</internalNodes>
+          <leafValues>
+            -1.0802250355482101e-01 3.3327960968017578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 3.9759509265422821e-02</internalNodes>
+          <leafValues>
+            1.9240869209170341e-02 -4.8899960517883301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 -2.2652709856629372e-02</internalNodes>
+          <leafValues>
+            -5.0369280576705933e-01 8.0773733556270599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 1.0915650054812431e-03</internalNodes>
+          <leafValues>
+            6.5554052591323853e-02 -2.4443879723548889e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 6.8754747509956360e-02</internalNodes>
+          <leafValues>
+            8.9196808636188507e-02 -3.5653901100158691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -3.3071058988571167e-01</internalNodes>
+          <leafValues>
+            4.6495699882507324e-01 -5.8183699846267700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -1.9307229667901993e-02</internalNodes>
+          <leafValues>
+            -4.4157180190086365e-01 8.3050116896629333e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 3.4808758646249771e-02</internalNodes>
+          <leafValues>
+            5.3480580449104309e-02 -5.0377398729324341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -3.8908151327632368e-04</internalNodes>
+          <leafValues>
+            3.4271261096000671e-01 -8.9923180639743805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 -2.1421869751065969e-03</internalNodes>
+          <leafValues>
+            -6.0642802715301514e-01 5.5589240044355392e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 1.1015810072422028e-01</internalNodes>
+          <leafValues>
+            -5.4774720221757889e-02 6.8780910968780518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 3.0875208904035389e-04</internalNodes>
+          <leafValues>
+            -5.5834218859672546e-02 9.3168236315250397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 2.1960400044918060e-03</internalNodes>
+          <leafValues>
+            5.3955748677253723e-02 -6.0503059625625610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -1.2606250122189522e-02</internalNodes>
+          <leafValues>
+            -4.6864029765129089e-01 5.9943869709968567e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 -2.7497899718582630e-03</internalNodes>
+          <leafValues>
+            2.8942531347274780e-01 -1.1297850310802460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 6.0962641239166260e-01</internalNodes>
+          <leafValues>
+            -4.7885991632938385e-02 5.9465491771697998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 4.5023251324892044e-02</internalNodes>
+          <leafValues>
+            6.3831068575382233e-02 -5.2956801652908325e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.3022350072860718e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 478 1.5907280147075653e-02</internalNodes>
+          <leafValues>
+            -3.8192328810691833e-01 2.9411768913269043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -3.0483009293675423e-02</internalNodes>
+          <leafValues>
+            6.4014548063278198e-01 -1.1338239908218384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 2.5841239839792252e-02</internalNodes>
+          <leafValues>
+            -1.7654690146446228e-01 2.5563400983810425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 1.2160619720816612e-02</internalNodes>
+          <leafValues>
+            -4.9461990594863892e-02 3.4733989834785461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -1.5910159796476364e-02</internalNodes>
+          <leafValues>
+            4.7966769337654114e-01 -1.3009509444236755e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 3.5282061435282230e-04</internalNodes>
+          <leafValues>
+            -3.4184929728507996e-01 2.3091129958629608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 6.7633582511916757e-04</internalNodes>
+          <leafValues>
+            -1.5432509779930115e-01 2.6687300205230713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 -5.9936139732599258e-02</internalNodes>
+          <leafValues>
+            -4.8802581429481506e-01 9.3327447772026062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -1.1342409998178482e-01</internalNodes>
+          <leafValues>
+            -6.5771442651748657e-01 5.9166818857192993e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 -4.3361280113458633e-03</internalNodes>
+          <leafValues>
+            -1.5936520695686340e-01 5.0237040966749191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -1.8627740209922194e-03</internalNodes>
+          <leafValues>
+            3.0730259418487549e-01 -1.2540669739246368e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 1.2653009966015816e-02</internalNodes>
+          <leafValues>
+            -1.0044930130243301e-01 3.7496179342269897e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 6.9118577241897583e-01</internalNodes>
+          <leafValues>
+            -4.7146409749984741e-02 8.3212441205978394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -2.6093868655152619e-04</internalNodes>
+          <leafValues>
+            3.1987738609313965e-01 -2.7183309197425842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -7.6345056295394897e-02</internalNodes>
+          <leafValues>
+            4.3091300129890442e-01 -9.0888269245624542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 2.8098300099372864e-03</internalNodes>
+          <leafValues>
+            5.8731120079755783e-02 -6.1996752023696899e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -1.3322039740160108e-04</internalNodes>
+          <leafValues>
+            2.0000059902667999e-01 -2.0120109617710114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 -1.3717629946768284e-02</internalNodes>
+          <leafValues>
+            -7.3095452785491943e-01 2.7178529649972916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 -6.2303808517754078e-03</internalNodes>
+          <leafValues>
+            -5.4780989885330200e-01 6.8749949336051941e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 4.9922719597816467e-02</internalNodes>
+          <leafValues>
+            -4.7304309904575348e-02 8.2423102855682373e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 -1.9126719562336802e-03</internalNodes>
+          <leafValues>
+            -5.3940171003341675e-01 7.7447593212127686e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 1.1384560493752360e-03</internalNodes>
+          <leafValues>
+            -9.6537686884403229e-02 1.5485690534114838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -2.4732090532779694e-03</internalNodes>
+          <leafValues>
+            3.5590788722038269e-01 -9.3169830739498138e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 -7.1464257780462503e-04</internalNodes>
+          <leafValues>
+            1.4520190656185150e-01 -7.4194207787513733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -2.0437149330973625e-02</internalNodes>
+          <leafValues>
+            4.4163769483566284e-01 -8.0942437052726746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -4.0483791381120682e-03</internalNodes>
+          <leafValues>
+            -5.9992778301239014e-01 3.3025380223989487e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 1.1148050427436829e-02</internalNodes>
+          <leafValues>
+            -1.1358329653739929e-01 3.2644999027252197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 9.8842009902000427e-03</internalNodes>
+          <leafValues>
+            5.5404480546712875e-02 -3.2730978727340698e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 3.1296359375119209e-03</internalNodes>
+          <leafValues>
+            7.7408656477928162e-02 -4.5953071117401123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 2.9721839819103479e-03</internalNodes>
+          <leafValues>
+            -1.2917269766330719e-01 1.5523110330104828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 2.0554479211568832e-02</internalNodes>
+          <leafValues>
+            8.7600469589233398e-02 -4.5774188637733459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 -2.3027280345559120e-02</internalNodes>
+          <leafValues>
+            3.5488089919090271e-01 -2.0566919818520546e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 510 -8.3903772756457329e-03</internalNodes>
+          <leafValues>
+            -4.3240728974342346e-01 9.2067979276180267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 -1.1431539896875620e-03</internalNodes>
+          <leafValues>
+            3.9591339230537415e-01 -2.3192889988422394e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -4.9133709399029613e-04</internalNodes>
+          <leafValues>
+            4.2749640345573425e-01 -8.5524216294288635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 5.1292928401380777e-04</internalNodes>
+          <leafValues>
+            -1.6196739673614502e-01 1.9614970684051514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -5.8478871360421181e-03</internalNodes>
+          <leafValues>
+            -5.9116369485855103e-01 6.2448240816593170e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -9.4133049249649048e-02</internalNodes>
+          <leafValues>
+            4.7701609134674072e-01 -5.6710161268711090e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 1.0079269850393757e-04</internalNodes>
+          <leafValues>
+            -1.6257099807262421e-01 2.1402290463447571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 3.2930231100181118e-05</internalNodes>
+          <leafValues>
+            -1.8596050143241882e-01 1.9647690653800964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 -1.1743210052372888e-04</internalNodes>
+          <leafValues>
+            3.1821349263191223e-01 -1.3287380337715149e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 1.2751810252666473e-01</internalNodes>
+          <leafValues>
+            3.0140079557895660e-02 -7.4110358953475952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 8.0326296389102936e-02</internalNodes>
+          <leafValues>
+            4.1555039584636688e-02 -8.2636839151382446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 1.6904190415516496e-03</internalNodes>
+          <leafValues>
+            -1.0290619730949402e-01 2.9724180698394775e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>47</maxWeakCount>
+      <stageThreshold>-1.1933319568634033e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 522 -4.6122789382934570e-02</internalNodes>
+          <leafValues>
+            4.4252589344978333e-01 -2.9913198947906494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 3.6723318696022034e-01</internalNodes>
+          <leafValues>
+            -6.3011750578880310e-02 7.7125382423400879e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -3.0962929595261812e-03</internalNodes>
+          <leafValues>
+            3.5142418742179871e-01 -1.7306439578533173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 9.2647131532430649e-03</internalNodes>
+          <leafValues>
+            -1.6072809696197510e-01 1.8532909452915192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 3.1748649198561907e-03</internalNodes>
+          <leafValues>
+            -1.9688999652862549e-01 2.4097280204296112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 8.0439839512109756e-03</internalNodes>
+          <leafValues>
+            8.9862972497940063e-02 -3.6552259325981140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 3.2752490043640137e-01</internalNodes>
+          <leafValues>
+            -5.6879680603742599e-02 7.7493369579315186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 -1.9074430689215660e-02</internalNodes>
+          <leafValues>
+            -2.8953808546066284e-01 6.2291670590639114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -2.0501749590039253e-02</internalNodes>
+          <leafValues>
+            -6.2625300884246826e-01 6.8276971578598022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 5.3187010053079575e-05</internalNodes>
+          <leafValues>
+            -2.5149559974670410e-01 2.6131960749626160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 3.3275580499321222e-03</internalNodes>
+          <leafValues>
+            -1.1990779638290405e-01 3.6519300937652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 5.8408430777490139e-03</internalNodes>
+          <leafValues>
+            -8.2748517394065857e-02 2.3650820553302765e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 -4.6462330967187881e-02</internalNodes>
+          <leafValues>
+            -6.9285649061203003e-01 7.8197672963142395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 -3.7785700988024473e-03</internalNodes>
+          <leafValues>
+            3.4372571110725403e-01 -1.0275450348854065e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 1.6655459767207503e-03</internalNodes>
+          <leafValues>
+            -1.1605279892683029e-01 3.7162029743194580e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -5.7107670727418736e-05</internalNodes>
+          <leafValues>
+            4.5893669128417969e-01 -2.1236430108547211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 -9.0066380798816681e-03</internalNodes>
+          <leafValues>
+            -5.9533411264419556e-01 8.0876402556896210e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -1.3789710402488708e-01</internalNodes>
+          <leafValues>
+            3.9570671319961548e-01 -8.9885376393795013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 5.7599872350692749e-01</internalNodes>
+          <leafValues>
+            -5.3810819983482361e-02 8.1703948974609375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 -2.3918158840388060e-03</internalNodes>
+          <leafValues>
+            1.3933740556240082e-01 -4.2155928909778595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 2.4896071408875287e-04</internalNodes>
+          <leafValues>
+            -1.4858660101890564e-01 2.6263329386711121e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 3.3062491565942764e-02</internalNodes>
+          <leafValues>
+            3.0659910291433334e-02 -3.2318601012229919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 4.4321879744529724e-02</internalNodes>
+          <leafValues>
+            4.7853820025920868e-02 -7.8135901689529419e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -1.8718190491199493e-02</internalNodes>
+          <leafValues>
+            1.2012620270252228e-01 -1.1211469769477844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 9.2309370636940002e-02</internalNodes>
+          <leafValues>
+            4.2463079094886780e-02 -8.0097001791000366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 9.0665437281131744e-02</internalNodes>
+          <leafValues>
+            -2.2304529324173927e-02 1.2847979366779327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 -5.8294929563999176e-02</internalNodes>
+          <leafValues>
+            -3.9368540048599243e-01 9.5482140779495239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 4.6649780124425888e-03</internalNodes>
+          <leafValues>
+            -6.5641947090625763e-02 3.6407178640365601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 5.2480432204902172e-03</internalNodes>
+          <leafValues>
+            6.8765781819820404e-02 -5.0508302450180054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 2.5315659586340189e-03</internalNodes>
+          <leafValues>
+            -9.3347169458866119e-02 1.6496129333972931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 2.4391160695813596e-04</internalNodes>
+          <leafValues>
+            -1.8885439634323120e-01 1.6956700384616852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 -6.3037211075425148e-03</internalNodes>
+          <leafValues>
+            3.8263529539108276e-01 -5.9042099863290787e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 2.2754059173166752e-03</internalNodes>
+          <leafValues>
+            -1.2248820066452026e-01 2.8283658623695374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 -2.7694869041442871e-01</internalNodes>
+          <leafValues>
+            4.8514971137046814e-01 -4.0482539683580399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 5.8051547966897488e-03</internalNodes>
+          <leafValues>
+            -8.3558417856693268e-02 4.2151498794555664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 2.4654529988765717e-03</internalNodes>
+          <leafValues>
+            -1.2816859781742096e-01 2.0776629447937012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 7.8863510861992836e-03</internalNodes>
+          <leafValues>
+            -1.7197540402412415e-01 2.0790819823741913e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -1.1817130260169506e-02</internalNodes>
+          <leafValues>
+            -5.7880669832229614e-01 5.8959141373634338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 -6.4139917492866516e-02</internalNodes>
+          <leafValues>
+            -6.3689261674880981e-01 4.1797500103712082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -1.2179970508441329e-03</internalNodes>
+          <leafValues>
+            2.3568700253963470e-01 -8.0515258014202118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 2.8652620967477560e-03</internalNodes>
+          <leafValues>
+            -9.3137197196483612e-02 3.9025950431823730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 -5.7746102102100849e-03</internalNodes>
+          <leafValues>
+            -5.7539868354797363e-01 5.9677690267562866e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 6.5377086400985718e-02</internalNodes>
+          <leafValues>
+            3.4166071563959122e-02 -7.4253422021865845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 1.6265710815787315e-02</internalNodes>
+          <leafValues>
+            5.3654260933399200e-02 -2.3658609390258789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 2.2717609535902739e-03</internalNodes>
+          <leafValues>
+            5.3359109908342361e-02 -5.4940742254257202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 2.2626020014286041e-01</internalNodes>
+          <leafValues>
+            -4.2046058923006058e-02 7.7912521362304688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 -2.9377460479736328e-02</internalNodes>
+          <leafValues>
+            -5.9470587968826294e-01 5.4817870259284973e-02</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          0 0 2 4 -1.</_>
+        <_>
+          0 2 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 10 2 8 -1.</_>
+        <_>
+          34 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 8 -1.</_>
+        <_>
+          0 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 18 10 -1.</_>
+        <_>
+          24 0 9 5 2.</_>
+        <_>
+          15 5 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 4 -1.</_>
+        <_>
+          7 0 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 6 4 -1.</_>
+        <_>
+          15 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 8 3 -1.</_>
+        <_>
+          13 7 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 8 4 -1.</_>
+        <_>
+          14 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 2 8 -1.</_>
+        <_>
+          0 14 2 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 0 2 16 -1.</_>
+        <_>
+          35 0 1 8 2.</_>
+        <_>
+          34 8 1 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          3 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 28 3 -1.</_>
+        <_>
+          11 7 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 0 2 2 -1.</_>
+        <_>
+          34 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 4 6 -1.</_>
+        <_>
+          0 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 0 2 2 -1.</_>
+        <_>
+          34 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 9 12 -1.</_>
+        <_>
+          20 5 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 9 12 -1.</_>
+        <_>
+          13 5 3 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 32 1 -1.</_>
+        <_>
+          4 0 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 3 -1.</_>
+        <_>
+          1 0 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          32 7 4 7 -1.</_>
+        <_>
+          33 8 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 6 -1.</_>
+        <_>
+          7 0 4 3 2.</_>
+        <_>
+          11 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 1 8 9 -1.</_>
+        <_>
+          29 3 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 1 8 -1.</_>
+        <_>
+          1 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 30 9 -1.</_>
+        <_>
+          13 9 10 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 6 -1.</_>
+        <_>
+          12 7 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 6 3 -1.</_>
+        <_>
+          16 5 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          0 0 1 9 2.</_>
+        <_>
+          1 9 1 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 2 2 14 -1.</_>
+        <_>
+          35 2 1 7 2.</_>
+        <_>
+          34 9 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 2 14 -1.</_>
+        <_>
+          0 2 1 7 2.</_>
+        <_>
+          1 9 1 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 0 1 4 -1.</_>
+        <_>
+          35 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 24 18 -1.</_>
+        <_>
+          5 0 12 9 2.</_>
+        <_>
+          17 9 12 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 16 1 2 -1.</_>
+        <_>
+          35 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 1 2 -1.</_>
+        <_>
+          0 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 8 12 -1.</_>
+        <_>
+          19 6 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 13 -1.</_>
+        <_>
+          13 5 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 16 1 2 -1.</_>
+        <_>
+          35 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 12 3 -1.</_>
+        <_>
+          10 10 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 8 -1.</_>
+        <_>
+          0 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 10 10 -1.</_>
+        <_>
+          25 0 5 5 2.</_>
+        <_>
+          20 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 4 -1.</_>
+        <_>
+          0 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 13 18 -1.</_>
+        <_>
+          19 9 13 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 6 -1.</_>
+        <_>
+          4 0 7 3 2.</_>
+        <_>
+          11 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 6 6 -1.</_>
+        <_>
+          16 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 7 8 -1.</_>
+        <_>
+          13 9 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          33 0 3 1 -1.</_>
+        <_>
+          34 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 10 4 -1.</_>
+        <_>
+          6 2 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 2 6 16 -1.</_>
+        <_>
+          18 2 3 8 2.</_>
+        <_>
+          15 10 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 8 -1.</_>
+        <_>
+          0 14 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 4 6 6 -1.</_>
+        <_>
+          29 6 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 8 8 -1.</_>
+        <_>
+          16 5 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 5 6 6 -1.</_>
+        <_>
+          29 7 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          7 7 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 12 9 -1.</_>
+        <_>
+          15 5 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 1 -1.</_>
+        <_>
+          1 0 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 18 6 -1.</_>
+        <_>
+          15 6 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 6 -1.</_>
+        <_>
+          0 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 30 6 -1.</_>
+        <_>
+          13 8 10 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 12 4 -1.</_>
+        <_>
+          11 8 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 9 3 -1.</_>
+        <_>
+          14 9 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 7 4 -1.</_>
+        <_>
+          14 9 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 18 6 -1.</_>
+        <_>
+          12 9 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 10 -1.</_>
+        <_>
+          7 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 10 1 6 -1.</_>
+        <_>
+          35 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 6 -1.</_>
+        <_>
+          0 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 13 9 5 -1.</_>
+        <_>
+          21 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 9 6 4 -1.</_>
+        <_>
+          15 10 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 18 8 -1.</_>
+        <_>
+          16 6 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 3 -1.</_>
+        <_>
+          12 14 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          32 0 4 6 -1.</_>
+        <_>
+          32 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 4 6 -1.</_>
+        <_>
+          2 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 0 6 7 -1.</_>
+        <_>
+          29 2 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 4 -1.</_>
+        <_>
+          0 2 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 8 6 4 -1.</_>
+        <_>
+          29 10 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 27 6 -1.</_>
+        <_>
+          13 11 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          31 14 2 3 -1.</_>
+        <_>
+          31 14 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 5 6 -1.</_>
+        <_>
+          8 2 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 11 3 -1.</_>
+        <_>
+          14 8 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 2 6 -1.</_>
+        <_>
+          0 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 13 2 4 -1.</_>
+        <_>
+          34 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 2 4 -1.</_>
+        <_>
+          0 15 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 12 -1.</_>
+        <_>
+          3 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 22 12 -1.</_>
+        <_>
+          25 0 11 6 2.</_>
+        <_>
+          14 6 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 7 6 -1.</_>
+        <_>
+          6 3 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 14 3 -1.</_>
+        <_>
+          12 6 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 7 4 -1.</_>
+        <_>
+          6 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 6 4 -1.</_>
+        <_>
+          18 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 6 -1.</_>
+        <_>
+          4 7 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          33 0 3 4 -1.</_>
+        <_>
+          34 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 18 -1.</_>
+        <_>
+          9 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 24 6 -1.</_>
+        <_>
+          14 8 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 4 -1.</_>
+        <_>
+          16 9 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 13 4 -1.</_>
+        <_>
+          13 9 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 14 1 4 -1.</_>
+        <_>
+          35 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 1 4 -1.</_>
+        <_>
+          0 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 9 7 -1.</_>
+        <_>
+          18 6 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 3 4 -1.</_>
+        <_>
+          1 0 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 16 2 2 -1.</_>
+        <_>
+          35 16 1 1 2.</_>
+        <_>
+          34 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 16 1 1 2.</_>
+        <_>
+          1 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          22 0 10 4 -1.</_>
+        <_>
+          22 0 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 4 6 14 -1.</_>
+        <_>
+          15 4 3 7 2.</_>
+        <_>
+          18 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 8 10 -1.</_>
+        <_>
+          17 3 4 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 5 -1.</_>
+        <_>
+          1 0 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 6 -1.</_>
+        <_>
+          5 3 8 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 0 11 18 -1.</_>
+        <_>
+          19 9 11 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 24 6 -1.</_>
+        <_>
+          14 10 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 10 3 -1.</_>
+        <_>
+          14 7 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 7 11 4 -1.</_>
+        <_>
+          12 8 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 16 6 -1.</_>
+        <_>
+          26 0 8 3 2.</_>
+        <_>
+          18 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 7 3 -1.</_>
+        <_>
+          4 4 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 4 -1.</_>
+        <_>
+          18 5 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 10 4 -1.</_>
+        <_>
+          4 4 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 8 10 -1.</_>
+        <_>
+          18 8 4 5 2.</_>
+        <_>
+          14 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 1 -1.</_>
+        <_>
+          5 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 10 8 -1.</_>
+        <_>
+          25 0 5 4 2.</_>
+        <_>
+          20 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 10 8 -1.</_>
+        <_>
+          13 0 5 4 2.</_>
+        <_>
+          18 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 5 6 13 -1.</_>
+        <_>
+          23 5 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 13 -1.</_>
+        <_>
+          11 5 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 5 5 3 -1.</_>
+        <_>
+          27 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 3 6 -1.</_>
+        <_>
+          10 2 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          26 6 3 6 -1.</_>
+        <_>
+          26 8 3 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 36 7 -1.</_>
+        <_>
+          18 11 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 5 5 3 -1.</_>
+        <_>
+          27 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 5 3 -1.</_>
+        <_>
+          4 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 6 4 4 -1.</_>
+        <_>
+          29 7 2 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 15 8 2 -1.</_>
+        <_>
+          16 15 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 30 6 -1.</_>
+        <_>
+          13 7 10 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 16 6 -1.</_>
+        <_>
+          6 9 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 12 6 -1.</_>
+        <_>
+          14 12 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 10 -1.</_>
+        <_>
+          6 0 6 5 2.</_>
+        <_>
+          12 5 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          25 2 7 16 -1.</_>
+        <_>
+          25 10 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 18 7 -1.</_>
+        <_>
+          15 6 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 26 18 -1.</_>
+        <_>
+          18 0 13 9 2.</_>
+        <_>
+          5 9 13 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 10 3 -1.</_>
+        <_>
+          10 7 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 6 6 4 -1.</_>
+        <_>
+          17 7 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 6 7 -1.</_>
+        <_>
+          18 6 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          26 6 5 4 -1.</_>
+        <_>
+          26 7 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 1 6 -1.</_>
+        <_>
+          0 15 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 18 14 -1.</_>
+        <_>
+          18 4 9 7 2.</_>
+        <_>
+          9 11 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 3 -1.</_>
+        <_>
+          6 6 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          27 5 6 3 -1.</_>
+        <_>
+          29 7 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 3 3 -1.</_>
+        <_>
+          6 9 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 5 6 5 -1.</_>
+        <_>
+          30 7 2 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 6 -1.</_>
+        <_>
+          6 7 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 0 4 1 -1.</_>
+        <_>
+          31 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 1 -1.</_>
+        <_>
+          3 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 4 3 -1.</_>
+        <_>
+          17 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 7 4 -1.</_>
+        <_>
+          12 4 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 9 3 -1.</_>
+        <_>
+          14 10 9 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 21 1 -1.</_>
+        <_>
+          8 17 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 9 20 4 -1.</_>
+        <_>
+          12 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 22 4 -1.</_>
+        <_>
+          14 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          25 0 3 3 -1.</_>
+        <_>
+          26 1 1 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 3 -1.</_>
+        <_>
+          14 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 9 3 -1.</_>
+        <_>
+          22 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 3 -1.</_>
+        <_>
+          11 4 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 36 3 -1.</_>
+        <_>
+          12 16 12 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 2 -1.</_>
+        <_>
+          2 0 4 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 9 2 9 -1.</_>
+        <_>
+          19 12 2 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 8 3 -1.</_>
+        <_>
+          13 8 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 4 2 2 -1.</_>
+        <_>
+          31 4 1 1 2.</_>
+        <_>
+          30 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 2 2 -1.</_>
+        <_>
+          4 4 1 1 2.</_>
+        <_>
+          5 5 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 7 4 3 -1.</_>
+        <_>
+          18 8 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 1 8 -1.</_>
+        <_>
+          9 0 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          25 6 10 3 -1.</_>
+        <_>
+          25 7 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 10 3 -1.</_>
+        <_>
+          1 7 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 12 -1.</_>
+        <_>
+          6 6 7 6 2.</_>
+        <_>
+          13 12 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          31 14 3 4 -1.</_>
+        <_>
+          31 16 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 2 4 -1.</_>
+        <_>
+          1 14 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 12 5 -1.</_>
+        <_>
+          19 0 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 14 -1.</_>
+        <_>
+          12 0 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 1 8 7 -1.</_>
+        <_>
+          30 3 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 14 20 4 -1.</_>
+        <_>
+          8 14 10 2 2.</_>
+        <_>
+          18 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 24 3 -1.</_>
+        <_>
+          14 12 8 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 27 6 -1.</_>
+        <_>
+          13 7 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 22 18 -1.</_>
+        <_>
+          18 0 11 9 2.</_>
+        <_>
+          7 9 11 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 2 -1.</_>
+        <_>
+          16 1 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 36 1 -1.</_>
+        <_>
+          9 17 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 1 -1.</_>
+        <_>
+          5 5 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 15 2 1 -1.</_>
+        <_>
+          34 15 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 8 16 4 -1.</_>
+        <_>
+          7 9 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 10 1 6 -1.</_>
+        <_>
+          35 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 3 4 -1.</_>
+        <_>
+          13 9 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 10 1 6 -1.</_>
+        <_>
+          35 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 1 4 -1.</_>
+        <_>
+          11 1 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          35 10 1 6 -1.</_>
+        <_>
+          35 12 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 1 14 -1.</_>
+        <_>
+          18 0 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 16 12 -1.</_>
+        <_>
+          5 6 8 6 2.</_>
+        <_>
+          13 12 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 7 8 -1.</_>
+        <_>
+          16 3 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 4 8 10 -1.</_>
+        <_>
+          14 4 4 5 2.</_>
+        <_>
+          18 9 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          22 0 9 3 -1.</_>
+        <_>
+          25 0 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 26 8 -1.</_>
+        <_>
+          0 10 13 4 2.</_>
+        <_>
+          13 14 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 16 8 -1.</_>
+        <_>
+          23 10 8 4 2.</_>
+        <_>
+          15 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 24 18 -1.</_>
+        <_>
+          6 0 12 9 2.</_>
+        <_>
+          18 9 12 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 9 6 -1.</_>
+        <_>
+          21 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 9 6 -1.</_>
+        <_>
+          12 0 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 1 5 14 -1.</_>
+        <_>
+          30 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 5 14 -1.</_>
+        <_>
+          1 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 26 6 -1.</_>
+        <_>
+          23 8 13 3 2.</_>
+        <_>
+          10 11 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 28 6 -1.</_>
+        <_>
+          0 8 14 3 2.</_>
+        <_>
+          14 11 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 24 12 -1.</_>
+        <_>
+          24 0 12 6 2.</_>
+        <_>
+          12 6 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 2 -1.</_>
+        <_>
+          3 1 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 16 3 2 -1.</_>
+        <_>
+          33 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 9 14 -1.</_>
+        <_>
+          15 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 16 8 2 -1.</_>
+        <_>
+          32 16 4 1 2.</_>
+        <_>
+          28 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 6 -1.</_>
+        <_>
+          15 10 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 22 6 -1.</_>
+        <_>
+          24 6 11 3 2.</_>
+        <_>
+          13 9 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 26 4 -1.</_>
+        <_>
+          0 10 13 2 2.</_>
+        <_>
+          13 12 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          24 16 4 2 -1.</_>
+        <_>
+          24 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 3 2 -1.</_>
+        <_>
+          9 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 18 8 -1.</_>
+        <_>
+          3 7 9 4 2.</_>
+        <_>
+          12 11 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          23 0 8 4 -1.</_>
+        <_>
+          23 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 4 -1.</_>
+        <_>
+          9 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 24 3 -1.</_>
+        <_>
+          14 11 8 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 5 6 -1.</_>
+        <_>
+          5 7 5 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 16 26 2 -1.</_>
+        <_>
+          18 16 13 1 2.</_>
+        <_>
+          5 17 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 24 4 -1.</_>
+        <_>
+          0 7 12 2 2.</_>
+        <_>
+          12 9 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          23 14 13 4 -1.</_>
+        <_>
+          23 15 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 18 8 -1.</_>
+        <_>
+          2 10 9 4 2.</_>
+        <_>
+          11 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 6 4 -1.</_>
+        <_>
+          15 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 24 2 -1.</_>
+        <_>
+          0 6 12 1 2.</_>
+        <_>
+          12 7 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 18 18 -1.</_>
+        <_>
+          17 9 18 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 11 2 -1.</_>
+        <_>
+          1 1 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 8 12 -1.</_>
+        <_>
+          19 6 4 6 2.</_>
+        <_>
+          15 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 32 12 -1.</_>
+        <_>
+          2 1 16 6 2.</_>
+        <_>
+          18 7 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 10 7 8 -1.</_>
+        <_>
+          29 12 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 8 10 -1.</_>
+        <_>
+          12 2 4 5 2.</_>
+        <_>
+          16 7 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 6 4 -1.</_>
+        <_>
+          15 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 26 8 -1.</_>
+        <_>
+          23 9 13 4 2.</_>
+        <_>
+          10 13 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 22 10 -1.</_>
+        <_>
+          7 8 11 5 2.</_>
+        <_>
+          18 13 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 8 3 -1.</_>
+        <_>
+          14 10 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 9 -1.</_>
+        <_>
+          11 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 14 2 2 -1.</_>
+        <_>
+          29 14 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 13 8 3 -1.</_>
+        <_>
+          14 14 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 7 8 -1.</_>
+        <_>
+          9 5 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 13 1 4 -1.</_>
+        <_>
+          28 13 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 13 4 1 -1.</_>
+        <_>
+          8 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 9 4 3 -1.</_>
+        <_>
+          16 10 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 10 4 -1.</_>
+        <_>
+          13 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 8 3 -1.</_>
+        <_>
+          14 9 8 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 2 -1.</_>
+        <_>
+          4 12 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 10 6 3 -1.</_>
+        <_>
+          16 11 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 13 -1.</_>
+        <_>
+          12 5 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 36 8 -1.</_>
+        <_>
+          18 0 18 4 2.</_>
+        <_>
+          0 4 18 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 8 12 -1.</_>
+        <_>
+          1 5 4 6 2.</_>
+        <_>
+          5 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 8 18 10 -1.</_>
+        <_>
+          27 8 9 5 2.</_>
+        <_>
+          18 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 10 -1.</_>
+        <_>
+          0 8 9 5 2.</_>
+        <_>
+          9 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 14 3 -1.</_>
+        <_>
+          11 6 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 16 6 -1.</_>
+        <_>
+          10 8 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 24 16 -1.</_>
+        <_>
+          19 2 12 8 2.</_>
+        <_>
+          7 10 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 15 -1.</_>
+        <_>
+          6 6 6 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 6 -1.</_>
+        <_>
+          12 5 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 0 6 11 -1.</_>
+        <_>
+          31 2 2 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 9 1 -1.</_>
+        <_>
+          5 11 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 17 3 -1.</_>
+        <_>
+          10 7 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 6 2 -1.</_>
+        <_>
+          20 8 2 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 11 12 3 -1.</_>
+        <_>
+          13 12 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 8 8 -1.</_>
+        <_>
+          2 3 4 4 2.</_>
+        <_>
+          6 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 12 18 4 -1.</_>
+        <_>
+          27 12 9 2 2.</_>
+        <_>
+          18 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 11 3 -1.</_>
+        <_>
+          11 6 11 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 14 4 -1.</_>
+        <_>
+          14 8 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 16 10 -1.</_>
+        <_>
+          9 8 8 5 2.</_>
+        <_>
+          17 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 5 3 -1.</_>
+        <_>
+          13 11 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 3 -1.</_>
+        <_>
+          6 6 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 5 3 -1.</_>
+        <_>
+          10 6 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 34 10 -1.</_>
+        <_>
+          19 5 17 5 2.</_>
+        <_>
+          2 10 17 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 3 -1.</_>
+        <_>
+          6 5 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          35 6 1 6 -1.</_>
+        <_>
+          35 8 1 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 13 6 -1.</_>
+        <_>
+          10 8 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 6 4 -1.</_>
+        <_>
+          15 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 11 4 -1.</_>
+        <_>
+          4 3 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 6 10 6 -1.</_>
+        <_>
+          31 6 5 3 2.</_>
+        <_>
+          26 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 11 8 -1.</_>
+        <_>
+          10 9 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 2 4 9 -1.</_>
+        <_>
+          29 3 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 10 4 -1.</_>
+        <_>
+          7 3 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 0 5 2 -1.</_>
+        <_>
+          31 1 5 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 16 12 -1.</_>
+        <_>
+          10 10 16 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 3 -1.</_>
+        <_>
+          18 5 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 6 -1.</_>
+        <_>
+          11 12 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 8 1 10 -1.</_>
+        <_>
+          35 13 1 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 36 8 -1.</_>
+        <_>
+          18 10 18 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 8 -1.</_>
+        <_>
+          19 7 3 4 2.</_>
+        <_>
+          16 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 4 -1.</_>
+        <_>
+          7 6 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 11 4 3 -1.</_>
+        <_>
+          21 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 1 8 -1.</_>
+        <_>
+          0 13 1 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 7 6 4 -1.</_>
+        <_>
+          29 9 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 14 8 4 -1.</_>
+        <_>
+          12 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 17 2 1 -1.</_>
+        <_>
+          18 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 11 4 -1.</_>
+        <_>
+          10 5 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 12 2 4 -1.</_>
+        <_>
+          17 13 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 5 3 -1.</_>
+        <_>
+          13 5 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 11 2 -1.</_>
+        <_>
+          13 13 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 2 -1.</_>
+        <_>
+          1 16 1 1 2.</_>
+        <_>
+          2 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 7 6 4 -1.</_>
+        <_>
+          29 9 2 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 6 -1.</_>
+        <_>
+          4 9 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 6 4 5 -1.</_>
+        <_>
+          31 7 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 20 7 -1.</_>
+        <_>
+          13 5 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 2 3 12 -1.</_>
+        <_>
+          30 8 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 4 -1.</_>
+        <_>
+          4 2 12 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 36 6 -1.</_>
+        <_>
+          12 10 12 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 30 6 -1.</_>
+        <_>
+          13 7 10 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 12 9 -1.</_>
+        <_>
+          18 4 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 6 1 -1.</_>
+        <_>
+          3 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 0 1 2 -1.</_>
+        <_>
+          34 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 2 1 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 3 3 8 -1.</_>
+        <_>
+          32 4 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 26 12 -1.</_>
+        <_>
+          5 6 13 6 2.</_>
+        <_>
+          18 12 13 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 12 9 -1.</_>
+        <_>
+          18 4 4 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 10 10 -1.</_>
+        <_>
+          13 7 5 5 2.</_>
+        <_>
+          18 12 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 5 4 6 -1.</_>
+        <_>
+          31 6 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 4 -1.</_>
+        <_>
+          5 6 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 5 4 5 -1.</_>
+        <_>
+          30 6 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 5 4 -1.</_>
+        <_>
+          6 6 5 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 36 1 -1.</_>
+        <_>
+          12 0 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 24 6 -1.</_>
+        <_>
+          14 5 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 6 3 -1.</_>
+        <_>
+          15 13 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 17 -1.</_>
+        <_>
+          14 1 3 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 18 10 -1.</_>
+        <_>
+          18 1 9 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 10 -1.</_>
+        <_>
+          9 1 9 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 7 4 5 -1.</_>
+        <_>
+          31 8 2 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 1 3 -1.</_>
+        <_>
+          0 11 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          33 16 2 2 -1.</_>
+        <_>
+          34 16 1 1 2.</_>
+        <_>
+          33 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 2 -1.</_>
+        <_>
+          1 16 1 1 2.</_>
+        <_>
+          2 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 36 3 -1.</_>
+        <_>
+          12 9 12 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 8 4 -1.</_>
+        <_>
+          14 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 5 3 -1.</_>
+        <_>
+          17 10 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 1 2 -1.</_>
+        <_>
+          4 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 0 3 2 -1.</_>
+        <_>
+          31 0 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 3 -1.</_>
+        <_>
+          5 0 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 36 5 -1.</_>
+        <_>
+          0 13 18 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 3 -1.</_>
+        <_>
+          5 4 4 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 7 6 3 -1.</_>
+        <_>
+          30 9 2 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 7 3 6 -1.</_>
+        <_>
+          6 9 3 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 18 10 -1.</_>
+        <_>
+          23 5 9 5 2.</_>
+        <_>
+          14 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 18 10 -1.</_>
+        <_>
+          4 5 9 5 2.</_>
+        <_>
+          13 10 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          32 17 3 1 -1.</_>
+        <_>
+          33 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 17 3 1 -1.</_>
+        <_>
+          2 17 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 26 2 -1.</_>
+        <_>
+          18 0 13 1 2.</_>
+        <_>
+          5 1 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 27 9 -1.</_>
+        <_>
+          9 6 9 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 18 12 -1.</_>
+        <_>
+          13 6 18 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 4 1 -1.</_>
+        <_>
+          1 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 13 1 3 -1.</_>
+        <_>
+          28 14 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          23 7 3 3 -1.</_>
+        <_>
+          24 7 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 12 6 -1.</_>
+        <_>
+          11 3 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 26 8 -1.</_>
+        <_>
+          18 10 13 4 2.</_>
+        <_>
+          5 14 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 9 6 -1.</_>
+        <_>
+          14 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 12 3 -1.</_>
+        <_>
+          18 13 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 12 3 -1.</_>
+        <_>
+          14 13 4 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 27 6 -1.</_>
+        <_>
+          13 8 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 5 4 -1.</_>
+        <_>
+          17 10 5 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 2 -1.</_>
+        <_>
+          0 0 8 1 2.</_>
+        <_>
+          8 1 8 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          22 0 8 8 -1.</_>
+        <_>
+          26 0 4 4 2.</_>
+        <_>
+          22 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 32 12 -1.</_>
+        <_>
+          1 0 16 6 2.</_>
+        <_>
+          17 6 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 7 6 10 -1.</_>
+        <_>
+          31 7 3 5 2.</_>
+        <_>
+          28 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 10 -1.</_>
+        <_>
+          2 7 3 5 2.</_>
+        <_>
+          5 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 10 3 3 -1.</_>
+        <_>
+          20 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 3 3 -1.</_>
+        <_>
+          13 11 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 6 2 -1.</_>
+        <_>
+          19 16 2 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 11 7 3 -1.</_>
+        <_>
+          13 12 7 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          25 13 3 2 -1.</_>
+        <_>
+          25 13 3 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 4 4 -1.</_>
+        <_>
+          13 11 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 16 18 2 -1.</_>
+        <_>
+          26 16 9 1 2.</_>
+        <_>
+          17 17 9 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 13 4 1 -1.</_>
+        <_>
+          9 13 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 1 2 1 -1.</_>
+        <_>
+          34 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 24 6 -1.</_>
+        <_>
+          13 6 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          33 16 3 2 -1.</_>
+        <_>
+          33 17 3 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 36 1 -1.</_>
+        <_>
+          18 17 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 1 2 1 -1.</_>
+        <_>
+          34 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 1 1 2 -1.</_>
+        <_>
+          2 1 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 0 8 10 -1.</_>
+        <_>
+          24 2 4 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 8 12 -1.</_>
+        <_>
+          12 4 4 6 2.</_>
+        <_>
+          16 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          26 6 6 6 -1.</_>
+        <_>
+          29 6 3 3 2.</_>
+        <_>
+          26 9 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 4 6 -1.</_>
+        <_>
+          5 6 2 3 2.</_>
+        <_>
+          7 9 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 5 2 4 -1.</_>
+        <_>
+          29 5 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 18 3 -1.</_>
+        <_>
+          7 5 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          29 13 2 3 -1.</_>
+        <_>
+          28 14 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 3 3 -1.</_>
+        <_>
+          8 6 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 16 22 2 -1.</_>
+        <_>
+          18 16 11 1 2.</_>
+        <_>
+          7 17 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 1 3 -1.</_>
+        <_>
+          0 3 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 20 6 -1.</_>
+        <_>
+          26 3 10 3 2.</_>
+        <_>
+          16 6 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 8 6 -1.</_>
+        <_>
+          12 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 34 8 -1.</_>
+        <_>
+          18 8 17 4 2.</_>
+        <_>
+          1 12 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 8 8 -1.</_>
+        <_>
+          14 9 4 4 2.</_>
+        <_>
+          18 13 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 0 1 3 -1.</_>
+        <_>
+          35 1 1 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 3 5 -1.</_>
+        <_>
+          16 8 1 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 10 1 -1.</_>
+        <_>
+          19 0 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 9 6 -1.</_>
+        <_>
+          7 5 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 24 6 -1.</_>
+        <_>
+          14 8 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 27 6 -1.</_>
+        <_>
+          13 10 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 27 6 -1.</_>
+        <_>
+          14 6 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 5 6 -1.</_>
+        <_>
+          5 8 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 0 1 2 -1.</_>
+        <_>
+          35 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 3 -1.</_>
+        <_>
+          3 4 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          29 5 2 4 -1.</_>
+        <_>
+          29 5 1 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 28 16 -1.</_>
+        <_>
+          3 0 14 8 2.</_>
+        <_>
+          17 8 14 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          31 0 4 2 -1.</_>
+        <_>
+          31 0 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 3 9 -1.</_>
+        <_>
+          4 12 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          32 16 4 2 -1.</_>
+        <_>
+          32 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 1 10 -1.</_>
+        <_>
+          17 0 1 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 14 8 -1.</_>
+        <_>
+          17 4 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 11 4 -1.</_>
+        <_>
+          6 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 0 1 2 -1.</_>
+        <_>
+          35 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 1 2 -1.</_>
+        <_>
+          0 1 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          33 0 2 1 -1.</_>
+        <_>
+          33 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 1 2 -1.</_>
+        <_>
+          3 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 17 36 1 -1.</_>
+        <_>
+          9 17 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 3 1 -1.</_>
+        <_>
+          8 14 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 14 8 -1.</_>
+        <_>
+          17 4 7 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 4 2 -1.</_>
+        <_>
+          0 17 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 10 3 -1.</_>
+        <_>
+          13 13 10 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 36 6 -1.</_>
+        <_>
+          18 12 18 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 27 6 -1.</_>
+        <_>
+          14 5 9 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 3 -1.</_>
+        <_>
+          8 6 5 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 12 4 -1.</_>
+        <_>
+          15 7 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 8 4 -1.</_>
+        <_>
+          15 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 14 6 4 -1.</_>
+        <_>
+          16 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 5 3 -1.</_>
+        <_>
+          14 11 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          25 3 6 4 -1.</_>
+        <_>
+          25 4 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 8 -1.</_>
+        <_>
+          3 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 4 5 6 -1.</_>
+        <_>
+          27 6 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 9 -1.</_>
+        <_>
+          4 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 9 2 4 -1.</_>
+        <_>
+          21 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 34 4 -1.</_>
+        <_>
+          1 10 17 2 2.</_>
+        <_>
+          18 12 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 15 2 3 -1.</_>
+        <_>
+          34 16 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 2 2 -1.</_>
+        <_>
+          3 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          33 0 1 2 -1.</_>
+        <_>
+          33 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 8 -1.</_>
+        <_>
+          6 2 10 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 30 6 -1.</_>
+        <_>
+          13 8 10 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 10 4 -1.</_>
+        <_>
+          13 8 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 6 12 -1.</_>
+        <_>
+          19 5 3 6 2.</_>
+        <_>
+          16 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 4 6 -1.</_>
+        <_>
+          8 3 4 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 7 33 6 -1.</_>
+        <_>
+          13 9 11 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 30 3 -1.</_>
+        <_>
+          13 7 10 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 6 3 -1.</_>
+        <_>
+          15 12 6 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 12 -1.</_>
+        <_>
+          14 5 3 6 2.</_>
+        <_>
+          17 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 26 6 -1.</_>
+        <_>
+          18 12 13 3 2.</_>
+        <_>
+          5 15 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 27 3 -1.</_>
+        <_>
+          13 13 9 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 11 4 3 -1.</_>
+        <_>
+          16 12 4 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 4 2 -1.</_>
+        <_>
+          6 13 2 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 17 2 1 -1.</_>
+        <_>
+          34 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 1 12 -1.</_>
+        <_>
+          16 0 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 17 34 1 -1.</_>
+        <_>
+          2 17 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 18 4 -1.</_>
+        <_>
+          5 4 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 17 2 1 -1.</_>
+        <_>
+          34 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 2 -1.</_>
+        <_>
+          0 1 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 16 3 -1.</_>
+        <_>
+          15 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 3 3 -1.</_>
+        <_>
+          13 10 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 4 8 14 -1.</_>
+        <_>
+          22 4 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 20 6 -1.</_>
+        <_>
+          12 5 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          26 3 6 6 -1.</_>
+        <_>
+          28 5 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 6 -1.</_>
+        <_>
+          8 5 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          34 0 2 3 -1.</_>
+        <_>
+          34 0 1 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 16 2 2 -1.</_>
+        <_>
+          0 17 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 6 4 8 -1.</_>
+        <_>
+          31 7 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 7 4 -1.</_>
+        <_>
+          5 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          20 4 8 14 -1.</_>
+        <_>
+          22 4 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 14 -1.</_>
+        <_>
+          10 4 4 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 17 6 1 -1.</_>
+        <_>
+          19 17 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 20 6 -1.</_>
+        <_>
+          10 0 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 22 18 -1.</_>
+        <_>
+          8 0 11 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 8 12 -1.</_>
+        <_>
+          13 2 4 6 2.</_>
+        <_>
+          17 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 10 14 8 -1.</_>
+        <_>
+          18 10 7 4 2.</_>
+        <_>
+          11 14 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 2 2 -1.</_>
+        <_>
+          1 16 1 1 2.</_>
+        <_>
+          2 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 0 2 1 -1.</_>
+        <_>
+          34 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 24 4 -1.</_>
+        <_>
+          12 3 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 2 3 -1.</_>
+        <_>
+          19 2 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 1 2 -1.</_>
+        <_>
+          2 0 1 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 3 6 8 -1.</_>
+        <_>
+          18 3 3 4 2.</_>
+        <_>
+          15 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 4 2 -1.</_>
+        <_>
+          14 6 4 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 30 9 -1.</_>
+        <_>
+          13 10 10 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 12 9 -1.</_>
+        <_>
+          12 8 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 16 5 -1.</_>
+        <_>
+          14 8 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 1 4 10 -1.</_>
+        <_>
+          31 2 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 10 8 -1.</_>
+        <_>
+          11 2 10 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          32 2 2 14 -1.</_>
+        <_>
+          32 2 1 14 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 2 -1.</_>
+        <_>
+          4 2 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          30 14 6 4 -1.</_>
+        <_>
+          30 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 1 4 -1.</_>
+        <_>
+          11 15 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 14 18 -1.</_>
+        <_>
+          18 0 7 9 2.</_>
+        <_>
+          11 9 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 20 9 -1.</_>
+        <_>
+          10 1 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 3 8 3 -1.</_>
+        <_>
+          23 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 2 4 -1.</_>
+        <_>
+          13 10 2 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 11 2 -1.</_>
+        <_>
+          14 10 11 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 36 9 -1.</_>
+        <_>
+          12 5 12 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 12 2 6 -1.</_>
+        <_>
+          34 15 2 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 14 6 -1.</_>
+        <_>
+          11 6 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          31 0 4 1 -1.</_>
+        <_>
+          31 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 1 -1.</_>
+        <_>
+          3 0 2 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 14 6 4 -1.</_>
+        <_>
+          21 14 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          13 14 2 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 36 1 -1.</_>
+        <_>
+          9 14 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 2 -1.</_>
+        <_>
+          5 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          26 3 5 3 -1.</_>
+        <_>
+          26 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 1 3 -1.</_>
+        <_>
+          15 9 1 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 11 2 3 -1.</_>
+        <_>
+          21 12 2 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 4 -1.</_>
+        <_>
+          8 6 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          31 0 2 2 -1.</_>
+        <_>
+          31 0 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 3 9 -1.</_>
+        <_>
+          6 7 3 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 11 2 -1.</_>
+        <_>
+          19 0 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 2 -1.</_>
+        <_>
+          5 0 2 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          22 0 14 4 -1.</_>
+        <_>
+          29 0 7 2 2.</_>
+        <_>
+          22 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 13 -1.</_>
+        <_>
+          15 1 2 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 3 8 4 -1.</_>
+        <_>
+          23 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 8 4 -1.</_>
+        <_>
+          9 3 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          32 14 2 2 -1.</_>
+        <_>
+          33 14 1 1 2.</_>
+        <_>
+          32 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 2 2 -1.</_>
+        <_>
+          2 14 1 1 2.</_>
+        <_>
+          3 15 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          35 5 1 12 -1.</_>
+        <_>
+          35 9 1 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 1 9 -1.</_>
+        <_>
+          0 10 1 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 15 6 -1.</_>
+        <_>
+          12 4 15 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 2 1 -1.</_>
+        <_>
+          1 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 17 2 1 -1.</_>
+        <_>
+          34 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 2 1 -1.</_>
+        <_>
+          1 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 16 10 -1.</_>
+        <_>
+          15 0 8 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 24 8 -1.</_>
+        <_>
+          5 10 12 4 2.</_>
+        <_>
+          17 14 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 4 3 3 -1.</_>
+        <_>
+          27 5 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 12 -1.</_>
+        <_>
+          6 6 7 6 2.</_>
+        <_>
+          13 12 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 24 6 -1.</_>
+        <_>
+          14 7 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 4 -1.</_>
+        <_>
+          12 7 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          30 7 6 10 -1.</_>
+        <_>
+          33 7 3 5 2.</_>
+        <_>
+          30 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          3 12 3 3 2.</_>
+        <_>
+          6 15 3 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 13 2 -1.</_>
+        <_>
+          20 0 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 24 6 -1.</_>
+        <_>
+          14 12 8 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 8 8 -1.</_>
+        <_>
+          19 4 4 4 2.</_>
+        <_>
+          15 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 8 8 -1.</_>
+        <_>
+          13 4 4 4 2.</_>
+        <_>
+          17 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 16 2 2 -1.</_>
+        <_>
+          34 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 3 -1.</_>
+        <_>
+          12 7 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          21 7 4 4 -1.</_>
+        <_>
+          21 8 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 30 4 -1.</_>
+        <_>
+          2 8 15 2 2.</_>
+        <_>
+          17 10 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          27 4 3 4 -1.</_>
+        <_>
+          27 5 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 3 4 -1.</_>
+        <_>
+          5 5 3 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          34 16 2 2 -1.</_>
+        <_>
+          34 16 1 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 34 2 -1.</_>
+        <_>
+          0 16 17 1 2.</_>
+        <_>
+          17 17 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 15 12 -1.</_>
+        <_>
+          12 9 15 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 36 6 -1.</_>
+        <_>
+          12 10 12 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          25 4 6 2 -1.</_>
+        <_>
+          25 5 6 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 17 2 1 -1.</_>
+        <_>
+          1 17 1 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 9 9 -1.</_>
+        <_>
+          19 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 9 -1.</_>
+        <_>
+          14 0 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 5 16 5 -1.</_>
+        <_>
+          24 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 16 9 -1.</_>
+        <_>
+          4 3 8 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 26 12 -1.</_>
+        <_>
+          20 6 13 6 2.</_>
+        <_>
+          7 12 13 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 24 12 -1.</_>
+        <_>
+          5 6 12 6 2.</_>
+        <_>
+          17 12 12 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 3 12 -1.</_>
+        <_>
+          18 4 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 1 -1.</_>
+        <_>
+          3 13 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          21 12 14 2 -1.</_>
+        <_>
+          28 12 7 1 2.</_>
+        <_>
+          21 13 7 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 2 3 -1.</_>
+        <_>
+          2 13 1 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          26 8 3 2 -1.</_>
+        <_>
+          27 9 1 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 2 3 -1.</_>
+        <_>
+          9 9 2 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 18 18 -1.</_>
+        <_>
+          12 0 9 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 3 3 -1.</_>
+        <_>
+          7 10 3 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          28 5 5 6 -1.</_>
+        <_>
+          28 7 5 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 9 8 -1.</_>
+        <_>
+          9 1 9 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 36 2 -1.</_>
+        <_>
+          18 0 18 1 2.</_>
+        <_>
+          0 1 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 26 6 -1.</_>
+        <_>
+          5 0 13 3 2.</_>
+        <_>
+          18 3 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          28 3 3 3 -1.</_>
+        <_>
+          28 4 3 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 5 3 -1.</_>
+        <_>
+          5 4 5 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 8 2 -1.</_>
+        <_>
+          16 12 4 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 9 14 -1.</_>
+        <_>
+          16 0 3 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          23 0 10 1 -1.</_>
+        <_>
+          23 0 5 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 14 2 2 -1.</_>
+        <_>
+          8 14 1 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 36 3 -1.</_>
+        <_>
+          12 13 12 1 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 34 4 -1.</_>
+        <_>
+          0 13 17 2 2.</_>
+        <_>
+          17 15 17 2 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/data/haarcascade_upperbody.xml b/venv/Lib/site-packages/cv2/data/haarcascade_upperbody.xml
new file mode 100644
index 000000000..3c75aa692
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/data/haarcascade_upperbody.xml
@@ -0,0 +1,28134 @@
+<?xml version="1.0"?>
+<!--
+   22x18 upperbody detector (see the detailed description below). 
+
+//////////////////////////////////////////////////////////////////////////
+| Contributors License Agreement
+| IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
+|   By downloading, copying, installing or using the software you agree 
+|   to this license.
+|   If you do not agree to this license, do not download, install,
+|   copy or use the software.
+|
+| Copyright (c) 2004, Hannes Kruppa and Bernt Schiele (ETH Zurich, Switzerland).
+|  All rights reserved.
+|
+| Redistribution and use in source and binary forms, with or without
+| modification, are permitted provided that the following conditions are
+| met:
+|
+|    * Redistributions of source code must retain the above copyright
+|       notice, this list of conditions and the following disclaimer.
+|    * Redistributions in binary form must reproduce the above
+|      copyright notice, this list of conditions and the following
+|      disclaimer in the documentation and/or other materials provided
+|      with the distribution.  
+|    * The name of Contributor may not used to endorse or promote products 
+|      derived from this software without specific prior written permission.
+|
+| THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+| "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+| LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+| A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+| CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+| EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+| PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+| PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+| LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+| NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+| SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.  Back to
+| Top
+//////////////////////////////////////////////////////////////////////////
+
+"Haar"-based Detectors For Pedestrian Detection
+===============================================
+by Hannes Kruppa and Bernt Schiele, ETH Zurich, Switzerland
+
+This archive provides the following three detectors:
+- upper body detector (most fun, useful in many scenarios!)
+- lower body detector
+- full body detector
+
+These detectors have been successfully applied to pedestrian detection
+in still images. They can be directly passed as parameters to the
+program HaarFaceDetect.
+NOTE: These detectors deal with frontal and backside views but not
+with side views (also see "Known limitations" below).
+
+RESEARCHERS:
+If you are using any of the detectors or involved ideas please cite
+this paper (available at www.vision.ethz.ch/publications/):
+
+@InProceedings{Kruppa03-bmvc,
+  author =       "Hannes Kruppa, Modesto Castrillon-Santana and Bernt Schiele",
+  title =        "Fast and Robust Face Finding via Local Context."
+  booktitle =    "Joint IEEE International Workshop on Visual Surveillance and Performance Evaluation of Tracking and Surveillance"
+  year =         "2003",
+  month =        "October"
+}
+
+COMMERCIAL:
+If you have any commercial interest in this work please contact 
+hkruppa@inf.ethz.ch
+
+
+ADDITIONAL INFORMATION 
+====================== 
+Check out the demo movie, e.g. using mplayer or any (Windows/Linux-) player
+that can play back .mpg movies.
+Under Linux that's:
+> ffplay demo.mpg
+or:
+> mplayer demo.mpg
+
+The movie shows a person walking towards the camera in a realistic
+indoor setting. Using ffplay or mplayer you can pause and continue the
+movie by pressing the space bar.
+
+Detections coming from the different detectors are visualized using
+different line styles: 
+upper body : dotted line
+lower body : dashed line
+full body  : solid line
+
+You will notice that successful detections containing the target do
+not sit tightly on the body but also include some of the background
+left and right.  This is not a bug but accurately reflects the
+employed training data which also includes portions of the background
+to ensure proper silhouette representation. If you want to get a
+feeling for the training data check out the CBCL data set:
+http://www.ai.mit.edu/projects/cbcl/software-datasets/PedestrianData.html
+
+There is also a small number of false alarms in this sequence.  
+NOTE: This is per frame detection, not tracking (which is also one of
+the reasons why it is not mislead by the person's shadow on the back
+wall). 
+
+On an Intel Xeon 1.7GHz machine the detectors operate at something
+between 6Hz to 14 Hz (on 352 x 288 frames per second) depending on the
+detector. The detectors work as well on much lower image resolutions
+which is always an interesting possibility for speed-ups or
+"coarse-to-fine" search strategies.
+
+Additional information e.g. on training parameters, detector
+combination, detecting other types of objects (e.g. cars) etc. is
+available in my PhD thesis report (available end of June). Check out
+www.vision.ethz.ch/kruppa/
+
+
+KNOWN LIMITATIONS
+==================
+1) The detectors only support frontal and back views but not sideviews.
+   Sideviews are trickier and it makes a lot of sense to include additional
+   modalities for their detection, e.g. motion information. I recommend
+   Viola and Jones' ICCV 2003 paper if this further interests you.
+
+2) Don't expect these detectors to be as accurate as a frontal face detector.
+   A frontal face as a pattern is pretty distinct with respect to other
+   patterns occurring in the world (i.e. image "background"). This is not so
+   for upper, lower and especially full bodies, because they have to rely
+   on fragile silhouette information rather than internal (facial) features.
+   Still, we found especially the upper body detector to perform amazingly well.
+   In contrast to a face detector these detectors will also work at very low
+   image resolutions 
+
+Acknowledgements
+================
+Thanks to Martin Spengler, ETH Zurich, for providing the demo movie.
+-->
+<opencv_storage>
+<cascade type_id="opencv-cascade-classifier"><stageType>BOOST</stageType>
+  <featureType>HAAR</featureType>
+  <height>18</height>
+  <width>22</width>
+  <stageParams>
+    <maxWeakCount>152</maxWeakCount></stageParams>
+  <featureParams>
+    <maxCatCount>0</maxCatCount></featureParams>
+  <stageNum>30</stageNum>
+  <stages>
+    <_>
+      <maxWeakCount>20</maxWeakCount>
+      <stageThreshold>-1.1264339685440063e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 0 -1.3696029782295227e-02</internalNodes>
+          <leafValues>
+            4.5076468586921692e-01 -4.2179030179977417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1 1.2441449798643589e-02</internalNodes>
+          <leafValues>
+            1.6493250429630280e-01 -7.4793487787246704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2 -2.7094660326838493e-03</internalNodes>
+          <leafValues>
+            3.1004700064659119e-01 -3.7617141008377075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 3 -1.0008010268211365e-01</internalNodes>
+          <leafValues>
+            7.6182198524475098e-01 -7.4556976556777954e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 4 -2.5114119052886963e-01</internalNodes>
+          <leafValues>
+            -6.4154028892517090e-01 1.5139220654964447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 5 -1.0510650277137756e-01</internalNodes>
+          <leafValues>
+            7.1459370851516724e-01 -1.4498579502105713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 6 -8.8448017835617065e-02</internalNodes>
+          <leafValues>
+            7.5773179531097412e-01 -6.8586893379688263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 7 1.0874910280108452e-02</internalNodes>
+          <leafValues>
+            1.4610609412193298e-01 -5.4263710975646973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 8 1.2690570205450058e-02</internalNodes>
+          <leafValues>
+            1.1674589663743973e-01 -4.9649459123611450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 9 -3.2198399305343628e-02</internalNodes>
+          <leafValues>
+            -3.8529390096664429e-01 9.8437972366809845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 10 -3.4077179152518511e-03</internalNodes>
+          <leafValues>
+            2.5200870633125305e-01 -2.2382549941539764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 11 3.0324390158057213e-02</internalNodes>
+          <leafValues>
+            -1.0534449666738510e-01 6.5735417604446411e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 12 4.1930507868528366e-03</internalNodes>
+          <leafValues>
+            1.2872399389743805e-01 -5.3160661458969116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 13 8.0501407384872437e-02</internalNodes>
+          <leafValues>
+            4.1696660220623016e-02 -7.2123032808303833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 14 -3.4822080284357071e-02</internalNodes>
+          <leafValues>
+            -4.9751108884811401e-01 1.3959939777851105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 15 7.5519368983805180e-03</internalNodes>
+          <leafValues>
+            -9.2147678136825562e-02 1.1294340342283249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 16 -1.7572140321135521e-02</internalNodes>
+          <leafValues>
+            -5.6784427165985107e-01 9.3572810292243958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 17 5.2012042142450809e-03</internalNodes>
+          <leafValues>
+            -7.9238079488277435e-02 6.1878960579633713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 18 -3.0798919498920441e-02</internalNodes>
+          <leafValues>
+            -5.6658512353897095e-01 9.5271490514278412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 19 -1.3465429656207561e-03</internalNodes>
+          <leafValues>
+            2.4011470377445221e-01 -2.6026639342308044e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>33</maxWeakCount>
+      <stageThreshold>-1.1226719617843628e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 20 1.9108939450234175e-03</internalNodes>
+          <leafValues>
+            -4.6240958571434021e-01 3.0612170696258545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 21 9.5464065670967102e-03</internalNodes>
+          <leafValues>
+            9.1956138610839844e-02 -5.3501170873641968e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 22 -4.3402809649705887e-02</internalNodes>
+          <leafValues>
+            5.6817841529846191e-01 -1.1284930258989334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 23 5.0386030226945877e-02</internalNodes>
+          <leafValues>
+            -8.0316931009292603e-02 7.3521858453750610e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 24 -6.8480317713692784e-04</internalNodes>
+          <leafValues>
+            2.5798648595809937e-01 -2.8049409389495850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 25 1.1548049747943878e-01</internalNodes>
+          <leafValues>
+            9.2065572738647461e-02 -7.5556892156600952e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 26 -1.9348369678482413e-03</internalNodes>
+          <leafValues>
+            2.9440790414810181e-01 -2.4102710187435150e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 27 -4.3528810143470764e-02</internalNodes>
+          <leafValues>
+            4.9202969670295715e-01 -3.9650101214647293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 28 -3.0218150466680527e-02</internalNodes>
+          <leafValues>
+            7.7227920293807983e-01 -8.6786523461341858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 29 2.4536589160561562e-02</internalNodes>
+          <leafValues>
+            9.5944821834564209e-02 -4.8642969131469727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 30 2.3958990350365639e-02</internalNodes>
+          <leafValues>
+            1.0437840223312378e-01 -5.1219838857650757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 31 -2.5370830669999123e-02</internalNodes>
+          <leafValues>
+            -3.1981548666954041e-01 9.1486573219299316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 32 -1.8606419907882810e-03</internalNodes>
+          <leafValues>
+            2.2783969342708588e-01 -2.4307970702648163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 33 2.2550800815224648e-02</internalNodes>
+          <leafValues>
+            6.9207556545734406e-02 -3.0054280161857605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 34 -4.9752090126276016e-02</internalNodes>
+          <leafValues>
+            -6.1078047752380371e-01 9.4472773373126984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 35 -2.6602389290928841e-02</internalNodes>
+          <leafValues>
+            5.9581768512725830e-01 -9.2046052217483521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 36 1.0760000348091125e-01</internalNodes>
+          <leafValues>
+            1.0278519988059998e-01 -5.4303371906280518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 37 1.7690699547529221e-02</internalNodes>
+          <leafValues>
+            6.6057138144969940e-02 -6.3213908672332764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 38 -6.2409918755292892e-02</internalNodes>
+          <leafValues>
+            6.8724197149276733e-01 -6.7070558667182922e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 39 -1.9801619928330183e-03</internalNodes>
+          <leafValues>
+            9.4411551952362061e-02 -8.7819486856460571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 40 6.3668429851531982e-02</internalNodes>
+          <leafValues>
+            1.1531739681959152e-01 -4.8129761219024658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 41 -3.0797829851508141e-02</internalNodes>
+          <leafValues>
+            3.5854768753051758e-01 -1.2593799829483032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 42 -1.8353419727645814e-04</internalNodes>
+          <leafValues>
+            1.4788399636745453e-01 -2.8546810150146484e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 43 1.7074620118364692e-03</internalNodes>
+          <leafValues>
+            7.9929657280445099e-02 -2.5233370065689087e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 44 -1.5325199812650681e-02</internalNodes>
+          <leafValues>
+            -5.7711857557296753e-01 9.8908327519893646e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 45 4.1389189660549164e-02</internalNodes>
+          <leafValues>
+            -6.5550796687602997e-02 5.7363802194595337e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 46 -4.5577771379612386e-04</internalNodes>
+          <leafValues>
+            2.2593089938163757e-01 -1.9105580449104309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 47 -1.3455689884722233e-02</internalNodes>
+          <leafValues>
+            -4.0233930945396423e-01 8.6477622389793396e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 48 -3.7978399544954300e-02</internalNodes>
+          <leafValues>
+            5.5257588624954224e-01 -8.1541016697883606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 49 -1.7197500914335251e-02</internalNodes>
+          <leafValues>
+            -1.8363009393215179e-01 5.1999870687723160e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 50 -1.2581580085679889e-03</internalNodes>
+          <leafValues>
+            1.8830040097236633e-01 -2.5726661086082458e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 51 6.7725107073783875e-02</internalNodes>
+          <leafValues>
+            -8.0956451594829559e-02 7.1803241968154907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 52 3.5489428788423538e-02</internalNodes>
+          <leafValues>
+            1.0068070143461227e-01 -5.3774142265319824e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>29</maxWeakCount>
+      <stageThreshold>-1.0127470493316650e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 53 -5.3695798851549625e-03</internalNodes>
+          <leafValues>
+            2.7479499578475952e-01 -3.4178960323333740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 54 6.2695867381989956e-04</internalNodes>
+          <leafValues>
+            -9.8646633327007294e-02 1.0728420317173004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 55 -1.6484269872307777e-02</internalNodes>
+          <leafValues>
+            -6.4972907304763794e-01 9.6037752926349640e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 56 -2.2104099392890930e-02</internalNodes>
+          <leafValues>
+            -4.5984488725662231e-01 1.6304630041122437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 57 1.1904139816761017e-01</internalNodes>
+          <leafValues>
+            -9.9600397050380707e-02 7.3729759454727173e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 58 -2.0222070161253214e-03</internalNodes>
+          <leafValues>
+            2.1029269695281982e-01 -2.4577130377292633e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 59 6.7500352859497070e-02</internalNodes>
+          <leafValues>
+            -1.2467789649963379e-01 5.7654231786727905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 60 -1.9655939936637878e-01</internalNodes>
+          <leafValues>
+            -6.0891747474670410e-01 9.9672056734561920e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 61 4.9431171268224716e-02</internalNodes>
+          <leafValues>
+            1.3752749562263489e-01 -4.5580869913101196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 62 2.3380089551210403e-02</internalNodes>
+          <leafValues>
+            4.7141890972852707e-02 -3.5027709603309631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 63 1.3998650247231126e-03</internalNodes>
+          <leafValues>
+            -2.0643049478530884e-01 2.4322299659252167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 64 1.1432689614593983e-02</internalNodes>
+          <leafValues>
+            5.5187370628118515e-02 -3.2619899511337280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 65 4.8775069415569305e-02</internalNodes>
+          <leafValues>
+            -6.8992510437965393e-02 7.1171808242797852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 66 6.5284021198749542e-02</internalNodes>
+          <leafValues>
+            3.7155740428715944e-03 5.9318971633911133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 67 6.1603228095918894e-04</internalNodes>
+          <leafValues>
+            -2.3272520303726196e-01 2.0441530644893646e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 68 -1.0527499951422215e-02</internalNodes>
+          <leafValues>
+            -3.1773790717124939e-01 1.0171309858560562e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 69 1.6231339424848557e-02</internalNodes>
+          <leafValues>
+            9.1734193265438080e-02 -4.7143009305000305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 70 3.8958500954322517e-04</internalNodes>
+          <leafValues>
+            -1.2997549772262573e-01 1.3475489616394043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 71 -4.4165689498186111e-02</internalNodes>
+          <leafValues>
+            -6.0331028699874878e-01 6.4766876399517059e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 72 -1.3663209974765778e-02</internalNodes>
+          <leafValues>
+            -5.2762842178344727e-01 6.3485741615295410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 73 -8.8231859263032675e-04</internalNodes>
+          <leafValues>
+            1.4510250091552734e-01 -2.7845200896263123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 74 -2.7819190174341202e-02</internalNodes>
+          <leafValues>
+            4.3640869855880737e-01 -8.5191860795021057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 75 6.2560990452766418e-02</internalNodes>
+          <leafValues>
+            1.0027889907360077e-01 -4.2235919833183289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 76 -4.4808178790844977e-04</internalNodes>
+          <leafValues>
+            1.4851489663124084e-01 -1.7731289565563202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 77 -2.1363180130720139e-02</internalNodes>
+          <leafValues>
+            -6.1334460973739624e-01 6.0539398342370987e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 78 -6.9122329354286194e-02</internalNodes>
+          <leafValues>
+            -8.6845761537551880e-01 3.9347749203443527e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 79 -3.0542839318513870e-02</internalNodes>
+          <leafValues>
+            -6.4021718502044678e-01 4.9593821167945862e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 80 -1.0101160034537315e-02</internalNodes>
+          <leafValues>
+            -1.6199150681495667e-01 5.7256899774074554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 81 -2.2010109387338161e-04</internalNodes>
+          <leafValues>
+            2.1350930631160736e-01 -2.0198999345302582e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>42</maxWeakCount>
+      <stageThreshold>-1.0684469938278198e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 82 5.7967850007116795e-03</internalNodes>
+          <leafValues>
+            -3.3844178915023804e-01 2.5066271424293518e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 83 6.3795179128646851e-02</internalNodes>
+          <leafValues>
+            -4.2111620306968689e-02 3.5746571421623230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 84 -6.4332038164138794e-02</internalNodes>
+          <leafValues>
+            -5.0660789012908936e-01 1.1717739701271057e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 85 -1.1574289947748184e-01</internalNodes>
+          <leafValues>
+            -5.6678497791290283e-01 9.5880903303623199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 86 -3.9005130529403687e-03</internalNodes>
+          <leafValues>
+            -4.1498228907585144e-01 1.4858320355415344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 87 1.2512929737567902e-02</internalNodes>
+          <leafValues>
+            5.3696669638156891e-02 -1.4163960516452789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 88 1.5871099894866347e-03</internalNodes>
+          <leafValues>
+            -2.5962340831756592e-01 1.9418330490589142e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 89 1.6291120648384094e-01</internalNodes>
+          <leafValues>
+            -6.1243768781423569e-02 7.8567212820053101e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 90 -3.3258220553398132e-01</internalNodes>
+          <leafValues>
+            7.8020131587982178e-01 -4.4036459177732468e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 91 -1.0288899764418602e-02</internalNodes>
+          <leafValues>
+            -1.5289680659770966e-01 6.2096230685710907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 92 2.8956029564142227e-02</internalNodes>
+          <leafValues>
+            8.4707796573638916e-02 -4.7820711135864258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 93 -3.2221511355601251e-04</internalNodes>
+          <leafValues>
+            1.3951259851455688e-01 -1.8819390237331390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 94 1.5835289657115936e-01</internalNodes>
+          <leafValues>
+            6.6667810082435608e-02 -5.4572361707687378e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 95 -4.2584311217069626e-02</internalNodes>
+          <leafValues>
+            2.7040338516235352e-01 -5.6654509156942368e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 96 2.7505140751600266e-02</internalNodes>
+          <leafValues>
+            4.9271158874034882e-02 -7.3157638311386108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 97 8.6879700422286987e-02</internalNodes>
+          <leafValues>
+            -1.7532400786876678e-02 8.6782652139663696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 98 -2.0130439661443233e-03</internalNodes>
+          <leafValues>
+            1.6593940556049347e-01 -2.5266230106353760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 99 4.2330170981585979e-04</internalNodes>
+          <leafValues>
+            9.4223551452159882e-02 -2.4629700183868408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 100 1.5194499865174294e-02</internalNodes>
+          <leafValues>
+            7.3695637285709381e-02 -5.0068622827529907e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 101 -6.1203669756650925e-03</internalNodes>
+          <leafValues>
+            2.1381899714469910e-01 -1.6738100349903107e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 102 2.0660240203142166e-02</internalNodes>
+          <leafValues>
+            -8.0636158585548401e-02 5.7828348875045776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 103 -6.0398250818252563e-02</internalNodes>
+          <leafValues>
+            -6.3411772251129150e-01 5.0899010151624680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 104 3.5386480391025543e-02</internalNodes>
+          <leafValues>
+            7.3191151022911072e-02 -5.6426662206649780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 105 -6.5997838973999023e-02</internalNodes>
+          <leafValues>
+            3.2833808660507202e-01 -2.6310259476304054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 106 1.1004590196534991e-03</internalNodes>
+          <leafValues>
+            -2.3114609718322754e-01 2.0206519961357117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 107 8.4488153457641602e-02</internalNodes>
+          <leafValues>
+            7.4589841067790985e-02 -4.3710339069366455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 108 -2.9235990718007088e-02</internalNodes>
+          <leafValues>
+            6.5064769983291626e-01 -5.4531838744878769e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 109 -3.3916950225830078e-02</internalNodes>
+          <leafValues>
+            -2.8804349899291992e-01 3.2172881066799164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 110 -7.9108700156211853e-03</internalNodes>
+          <leafValues>
+            -3.3660379052162170e-01 1.0100690275430679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 111 5.1930431276559830e-02</internalNodes>
+          <leafValues>
+            3.2920960336923599e-02 -1.3176530599594116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 112 -6.8586103618144989e-02</internalNodes>
+          <leafValues>
+            5.2153557538986206e-01 -6.6718578338623047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 113 -1.9451669650152326e-03</internalNodes>
+          <leafValues>
+            1.5396790206432343e-01 -1.9895760715007782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 114 7.1366228163242340e-02</internalNodes>
+          <leafValues>
+            -8.2927159965038300e-02 4.5292338728904724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 115 -2.6624239981174469e-02</internalNodes>
+          <leafValues>
+            -4.4009739160537720e-01 1.0267119854688644e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 116 2.5266060605645180e-02</internalNodes>
+          <leafValues>
+            5.5799201130867004e-02 -5.5569338798522949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 117 5.5255689658224583e-03</internalNodes>
+          <leafValues>
+            -1.3640299439430237e-01 2.8255200386047363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 118 -2.9929999727755785e-03</internalNodes>
+          <leafValues>
+            -3.2421571016311646e-01 1.2122060358524323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 119 2.2192109376192093e-02</internalNodes>
+          <leafValues>
+            -6.0741018503904343e-02 4.3473160266876221e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 120 -9.4268741086125374e-03</internalNodes>
+          <leafValues>
+            -3.3458408713340759e-01 1.0029699653387070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 121 3.4395330585539341e-03</internalNodes>
+          <leafValues>
+            -8.3829909563064575e-02 1.7925940454006195e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 122 -3.2996390946209431e-03</internalNodes>
+          <leafValues>
+            1.9990429282188416e-01 -2.1068470180034637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 123 2.6152150705456734e-02</internalNodes>
+          <leafValues>
+            -8.0667406320571899e-02 3.5581269860267639e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>-1.1520069837570190e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 124 -2.2792650386691093e-02</internalNodes>
+          <leafValues>
+            4.0725260972976685e-01 -3.3609920740127563e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 125 -5.7334620505571365e-03</internalNodes>
+          <leafValues>
+            2.6882189512252808e-01 -2.2775350511074066e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 126 9.6941202878952026e-02</internalNodes>
+          <leafValues>
+            -8.0905012786388397e-02 7.4328738451004028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 127 -2.8288999572396278e-02</internalNodes>
+          <leafValues>
+            4.5610108971595764e-01 -6.1096340417861938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 128 3.8522849790751934e-03</internalNodes>
+          <leafValues>
+            -2.5241801142692566e-01 2.0907109975814819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 129 2.3100129328668118e-03</internalNodes>
+          <leafValues>
+            -1.4713400602340698e-01 1.5460389852523804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 130 1.1361920041963458e-03</internalNodes>
+          <leafValues>
+            1.7680479586124420e-01 -3.0537289381027222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 131 2.4962890893220901e-02</internalNodes>
+          <leafValues>
+            -1.2652909755706787e-01 3.7442651391029358e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 132 -5.8984099887311459e-03</internalNodes>
+          <leafValues>
+            2.6738989353179932e-01 -1.7762570083141327e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 133 1.1804900132119656e-02</internalNodes>
+          <leafValues>
+            6.6077977418899536e-02 -3.3482131361961365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 134 6.4400159753859043e-03</internalNodes>
+          <leafValues>
+            1.0994800180196762e-01 -3.6303481459617615e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 135 -8.9407369494438171e-02</internalNodes>
+          <leafValues>
+            -4.3580460548400879e-01 1.4944310300052166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 136 -3.1404230743646622e-02</internalNodes>
+          <leafValues>
+            6.9523447751998901e-01 -5.4854288697242737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 137 -1.4607949554920197e-01</internalNodes>
+          <leafValues>
+            -2.5650060176849365e-01 5.6956540793180466e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 138 2.1142649929970503e-03</internalNodes>
+          <leafValues>
+            -2.4987550079822540e-01 1.6792559623718262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 139 -1.5119359828531742e-02</internalNodes>
+          <leafValues>
+            -3.0179870128631592e-01 1.0393589735031128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 140 2.5620959699153900e-02</internalNodes>
+          <leafValues>
+            -7.4821300804615021e-02 5.3600782155990601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 141 -1.4417800307273865e-01</internalNodes>
+          <leafValues>
+            -2.0490899682044983e-01 7.4457786977291107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 142 2.5954779237508774e-02</internalNodes>
+          <leafValues>
+            -9.0574868023395538e-02 4.8442208766937256e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 143 -2.1130720153450966e-02</internalNodes>
+          <leafValues>
+            -2.2689810395240784e-01 6.4876057207584381e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 144 1.6474459320306778e-02</internalNodes>
+          <leafValues>
+            1.0768000036478043e-01 -3.6570599675178528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 145 1.0922150313854218e-01</internalNodes>
+          <leafValues>
+            5.6827351450920105e-02 -3.4728559851646423e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 146 -7.4581061198841780e-05</internalNodes>
+          <leafValues>
+            1.3904270529747009e-01 -2.5942608714103699e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 147 -2.7753600850701332e-02</internalNodes>
+          <leafValues>
+            3.8111299276351929e-01 -4.2896129190921783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 148 3.2721430063247681e-02</internalNodes>
+          <leafValues>
+            -9.0872153639793396e-02 3.9289179444313049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 149 5.5606258101761341e-03</internalNodes>
+          <leafValues>
+            8.4002248942852020e-02 -1.9396039843559265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 150 -1.0710290074348450e-01</internalNodes>
+          <leafValues>
+            -5.8981472253799438e-01 5.6862760335206985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 151 -8.0517623573541641e-03</internalNodes>
+          <leafValues>
+            1.1790599673986435e-01 -1.1595659703016281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 152 -1.3850019872188568e-01</internalNodes>
+          <leafValues>
+            -9.0805321931838989e-01 4.1411358863115311e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 153 2.8620919212698936e-02</internalNodes>
+          <leafValues>
+            1.9928589463233948e-02 -7.3697662353515625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 154 2.6208970695734024e-02</internalNodes>
+          <leafValues>
+            -6.1577551066875458e-02 6.0899931192398071e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 155 2.6527039706707001e-02</internalNodes>
+          <leafValues>
+            5.7193860411643982e-02 -6.2992326915264130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 156 -4.4622488319873810e-02</internalNodes>
+          <leafValues>
+            -3.3318150043487549e-01 9.3214571475982666e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 157 -1.4283119700849056e-02</internalNodes>
+          <leafValues>
+            1.9125230610370636e-01 -1.1530569940805435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 158 -1.9681209232658148e-03</internalNodes>
+          <leafValues>
+            -3.1295120716094971e-01 9.9682807922363281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 159 5.2851080894470215e-02</internalNodes>
+          <leafValues>
+            -5.8919548988342285e-02 5.7887911796569824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 160 -6.3711861148476601e-03</internalNodes>
+          <leafValues>
+            1.9182190299034119e-01 -1.9094540178775787e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 161 -6.4727910794317722e-03</internalNodes>
+          <leafValues>
+            -2.4721039831638336e-01 1.2252929806709290e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 162 -1.6690989956259727e-02</internalNodes>
+          <leafValues>
+            -4.9174660444259644e-01 5.0315100699663162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 163 -1.4882409945130348e-02</internalNodes>
+          <leafValues>
+            1.9646610319614410e-01 -5.8250389993190765e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 164 1.7529709264636040e-02</internalNodes>
+          <leafValues>
+            7.6357498764991760e-02 -3.6559268832206726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 165 4.2221389710903168e-02</internalNodes>
+          <leafValues>
+            -3.1560491770505905e-02 3.6011269688606262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 166 -6.5581746399402618e-02</internalNodes>
+          <leafValues>
+            3.4334710240364075e-01 -8.8556960225105286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 167 1.6703210771083832e-02</internalNodes>
+          <leafValues>
+            4.8210039734840393e-02 -1.5273620188236237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 168 -6.9328742101788521e-03</internalNodes>
+          <leafValues>
+            -3.0573639273643494e-01 1.1821140348911285e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>46</maxWeakCount>
+      <stageThreshold>-1.0648390054702759e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 169 -6.3434438779950142e-03</internalNodes>
+          <leafValues>
+            3.3840280771255493e-01 -3.3474850654602051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 170 5.2472548559308052e-03</internalNodes>
+          <leafValues>
+            -9.3596532940864563e-02 1.6791179776191711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 171 -3.6585088819265366e-02</internalNodes>
+          <leafValues>
+            5.3676098585128784e-01 -8.5433527827262878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 172 5.3153699263930321e-03</internalNodes>
+          <leafValues>
+            -1.2804119288921356e-01 1.4443910121917725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 173 -3.9569609798491001e-03</internalNodes>
+          <leafValues>
+            1.8605449795722961e-01 -2.2311410307884216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 174 3.3965419977903366e-02</internalNodes>
+          <leafValues>
+            2.7835709974169731e-02 -5.1203387975692749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 175 -1.4852879568934441e-02</internalNodes>
+          <leafValues>
+            -4.6814951300621033e-01 1.1351560056209564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 176 -2.9641329310834408e-03</internalNodes>
+          <leafValues>
+            2.6591798663139343e-01 -2.8183770179748535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 177 -1.0795590281486511e-01</internalNodes>
+          <leafValues>
+            -5.7527697086334229e-01 1.0991639643907547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 178 2.1237600594758987e-02</internalNodes>
+          <leafValues>
+            -1.0451590269804001e-01 4.6613770723342896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 179 -2.6189640164375305e-02</internalNodes>
+          <leafValues>
+            4.2544820904731750e-01 -9.2278912663459778e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 180 -3.5010561347007751e-02</internalNodes>
+          <leafValues>
+            -7.1801197528839111e-01 7.2877250611782074e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 181 1.5026619621494319e-05</internalNodes>
+          <leafValues>
+            -2.7199760079383850e-01 1.0682159662246704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 182 -2.7760250493884087e-02</internalNodes>
+          <leafValues>
+            -5.0185692310333252e-01 1.0118210315704346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 183 -3.7439178675413132e-02</internalNodes>
+          <leafValues>
+            -3.7141519784927368e-01 8.3709038794040680e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 184 -1.4152259565889835e-02</internalNodes>
+          <leafValues>
+            3.0982801318168640e-01 -7.3767662048339844e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 185 -1.2331079691648483e-02</internalNodes>
+          <leafValues>
+            -3.9507681131362915e-01 8.3215177059173584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 186 2.6666349731385708e-03</internalNodes>
+          <leafValues>
+            -1.3776129484176636e-01 2.4245689809322357e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 187 -2.9443199746310711e-03</internalNodes>
+          <leafValues>
+            2.4460780620574951e-01 -1.3937890529632568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 188 -1.5788920223712921e-01</internalNodes>
+          <leafValues>
+            -5.6832242012023926e-01 3.6140721291303635e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 189 2.1553030237555504e-03</internalNodes>
+          <leafValues>
+            8.3660557866096497e-02 -4.1380259394645691e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 190 -8.5367091000080109e-02</internalNodes>
+          <leafValues>
+            -5.7053291797637939e-01 5.2995659410953522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 191 3.4761740826070309e-03</internalNodes>
+          <leafValues>
+            -1.2189819663763046e-01 2.6553291082382202e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 192 -2.4104220792651176e-02</internalNodes>
+          <leafValues>
+            -5.2315437793731689e-01 2.5505660101771355e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 193 -3.0729150399565697e-02</internalNodes>
+          <leafValues>
+            -4.6735408902168274e-01 7.0844426751136780e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 194 -1.1937420349568129e-03</internalNodes>
+          <leafValues>
+            1.4596860110759735e-01 -2.3086270689964294e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 195 3.2304100692272186e-02</internalNodes>
+          <leafValues>
+            -6.5350927412509918e-02 5.5091381072998047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 196 1.4955499768257141e-01</internalNodes>
+          <leafValues>
+            1.5002089552581310e-02 -8.9400452375411987e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 197 -4.7254669480025768e-03</internalNodes>
+          <leafValues>
+            1.4857460558414459e-01 -2.1019940078258514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 198 3.6360718309879303e-02</internalNodes>
+          <leafValues>
+            2.8547950088977814e-02 -6.3668930530548096e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 199 -2.7109999209642410e-02</internalNodes>
+          <leafValues>
+            4.9661910533905029e-01 -7.3661573231220245e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 200 -9.5398407429456711e-03</internalNodes>
+          <leafValues>
+            -1.9384680688381195e-01 5.8507081121206284e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 201 1.0541989654302597e-01</internalNodes>
+          <leafValues>
+            -7.4785731732845306e-02 4.3781110644340515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 202 6.3801761716604233e-03</internalNodes>
+          <leafValues>
+            5.3971529006958008e-02 -3.3829790353775024e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 203 -2.2759849205613136e-02</internalNodes>
+          <leafValues>
+            -5.9374898672103882e-01 4.8046529293060303e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 204 -1.7323749139904976e-02</internalNodes>
+          <leafValues>
+            -1.6034699976444244e-01 1.5187160111963749e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 205 2.9854409396648407e-02</internalNodes>
+          <leafValues>
+            -6.5698243677616119e-02 4.5057341456413269e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 206 2.3269839584827423e-02</internalNodes>
+          <leafValues>
+            3.8805499672889709e-02 -3.5354879498481750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 207 4.0833871811628342e-02</internalNodes>
+          <leafValues>
+            4.9404840916395187e-02 -5.6222450733184814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 208 -1.2498889863491058e-01</internalNodes>
+          <leafValues>
+            6.7763668298721313e-01 -1.5484940260648727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 209 -6.5579377114772797e-02</internalNodes>
+          <leafValues>
+            6.7363232374191284e-01 -4.5269690454006195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 210 -3.7901759147644043e-01</internalNodes>
+          <leafValues>
+            -4.9853721261024475e-01 2.3955229669809341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 211 2.9792459681630135e-03</internalNodes>
+          <leafValues>
+            -1.8436419963836670e-01 1.6265830397605896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 212 1.3803659938275814e-02</internalNodes>
+          <leafValues>
+            6.3698217272758484e-02 -4.3389800190925598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 213 3.5606899764388800e-03</internalNodes>
+          <leafValues>
+            -1.1455070227384567e-01 2.3618610203266144e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 214 8.8772783055901527e-03</internalNodes>
+          <leafValues>
+            8.6416840553283691e-02 -1.7590980231761932e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>45</maxWeakCount>
+      <stageThreshold>-9.5069932937622070e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 215 -6.7344820126891136e-03</internalNodes>
+          <leafValues>
+            3.0758589506149292e-01 -2.9761791229248047e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 216 -1.3902880251407623e-02</internalNodes>
+          <leafValues>
+            2.0400699973106384e-01 -2.2967250645160675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 217 -4.1963551193475723e-02</internalNodes>
+          <leafValues>
+            -5.6575411558151245e-01 8.6745493113994598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 218 -5.9794791013700888e-05</internalNodes>
+          <leafValues>
+            1.5832610428333282e-01 -2.3109050095081329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 219 8.4739532321691513e-03</internalNodes>
+          <leafValues>
+            -1.1501230299472809e-01 3.9758589863777161e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 220 -6.5317057073116302e-02</internalNodes>
+          <leafValues>
+            -2.3887279629707336e-01 1.1391709744930267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 221 -4.2358501814305782e-03</internalNodes>
+          <leafValues>
+            2.2337220609188080e-01 -2.4218839406967163e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 222 4.6229299157857895e-02</internalNodes>
+          <leafValues>
+            9.6837401390075684e-02 -5.3427702188491821e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 223 5.2246701670810580e-05</internalNodes>
+          <leafValues>
+            -2.4189360439777374e-01 1.5932360291481018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 224 -4.1420090943574905e-02</internalNodes>
+          <leafValues>
+            -3.4044981002807617e-01 4.3712481856346130e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 225 -1.0224279947578907e-02</internalNodes>
+          <leafValues>
+            -2.4752390384674072e-01 1.5512530505657196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 226 6.8581208586692810e-02</internalNodes>
+          <leafValues>
+            9.7173796966671944e-03 -6.1821222305297852e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 227 -4.0700301527976990e-02</internalNodes>
+          <leafValues>
+            -6.0284787416458130e-01 7.0963069796562195e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 228 -8.9998699724674225e-02</internalNodes>
+          <leafValues>
+            4.6664720773696899e-01 -4.8549890518188477e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 229 1.5307360328733921e-02</internalNodes>
+          <leafValues>
+            1.4783670008182526e-01 -2.7114608883857727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 230 3.7016849964857101e-03</internalNodes>
+          <leafValues>
+            -1.5153409540653229e-01 2.0931409299373627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 231 -3.1937099993228912e-02</internalNodes>
+          <leafValues>
+            -7.2332257032394409e-01 3.7420161068439484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 232 4.7493908554315567e-02</internalNodes>
+          <leafValues>
+            4.9000091850757599e-02 -4.8303189873695374e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 233 4.4620381668210030e-03</internalNodes>
+          <leafValues>
+            -1.7698319256305695e-01 1.9820910692214966e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 234 -8.1284176558256149e-03</internalNodes>
+          <leafValues>
+            1.1222189664840698e-01 -5.0805520266294479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 235 -1.2596019543707371e-02</internalNodes>
+          <leafValues>
+            4.3889060616493225e-01 -8.2898952066898346e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 236 -1.0689930059015751e-03</internalNodes>
+          <leafValues>
+            6.8766087293624878e-02 -8.2667008042335510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 237 -4.8213090747594833e-02</internalNodes>
+          <leafValues>
+            -4.6671348810195923e-01 7.4310712516307831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 238 -2.3418650380335748e-04</internalNodes>
+          <leafValues>
+            8.8725142180919647e-02 -1.0919640213251114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 239 1.0095000267028809e-01</internalNodes>
+          <leafValues>
+            5.5444270372390747e-02 -5.5205368995666504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 240 3.2340411096811295e-02</internalNodes>
+          <leafValues>
+            4.9762740731239319e-02 -3.6636400222778320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 241 1.7699210345745087e-01</internalNodes>
+          <leafValues>
+            -7.3765642940998077e-02 5.4300791025161743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 242 -1.8634319712873548e-04</internalNodes>
+          <leafValues>
+            9.5718666911125183e-02 -1.8214109539985657e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 243 6.6473139449954033e-03</internalNodes>
+          <leafValues>
+            -1.2173130363225937e-01 3.0331039428710938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 244 -9.9276658147573471e-03</internalNodes>
+          <leafValues>
+            3.2638520002365112e-01 -8.8533706963062286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 245 5.2587099373340607e-02</internalNodes>
+          <leafValues>
+            1.1303950101137161e-01 -3.3436870574951172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 246 4.9553681164979935e-03</internalNodes>
+          <leafValues>
+            -1.3183289766311646e-01 9.7614809870719910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 247 -2.3817660287022591e-02</internalNodes>
+          <leafValues>
+            -4.1027650237083435e-01 8.4849812090396881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 248 -1.1363780125975609e-02</internalNodes>
+          <leafValues>
+            1.8874420225620270e-01 -8.3536416292190552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 249 -1.9515539752319455e-03</internalNodes>
+          <leafValues>
+            1.8985089659690857e-01 -1.7776779830455780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 250 -1.3576669618487358e-02</internalNodes>
+          <leafValues>
+            2.0975759625434875e-01 -3.7115450948476791e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 251 1.6466820612549782e-02</internalNodes>
+          <leafValues>
+            -8.2349412143230438e-02 3.8047221302986145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 252 -1.0136260092258453e-01</internalNodes>
+          <leafValues>
+            -1.1633230000734329e-01 6.7804910242557526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 253 -1.0248430073261261e-01</internalNodes>
+          <leafValues>
+            -2.8850209712982178e-01 1.2139680236577988e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 254 -2.8717568516731262e-01</internalNodes>
+          <leafValues>
+            4.6935141086578369e-01 -8.2954309880733490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 255 5.0812978297472000e-02</internalNodes>
+          <leafValues>
+            5.5393878370523453e-02 -6.2383282184600830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 256 9.1063417494297028e-02</internalNodes>
+          <leafValues>
+            -2.3379560559988022e-02 4.7155299782752991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 257 -5.1845338195562363e-02</internalNodes>
+          <leafValues>
+            -6.9031542539596558e-01 4.5454118400812149e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 258 1.5031239390373230e-01</internalNodes>
+          <leafValues>
+            4.5906711369752884e-02 -5.2067738771438599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 259 4.1596319526433945e-02</internalNodes>
+          <leafValues>
+            5.3706299513578415e-02 -4.8782169818878174e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>43</maxWeakCount>
+      <stageThreshold>-8.5045951604843140e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 260 -5.9847710654139519e-03</internalNodes>
+          <leafValues>
+            2.7858960628509521e-01 -3.0923390388488770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 261 -3.9032639469951391e-03</internalNodes>
+          <leafValues>
+            2.2257049381732941e-01 -2.8928229212760925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 262 -2.2362179151969030e-05</internalNodes>
+          <leafValues>
+            1.4084370434284210e-01 -3.0143168568611145e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 263 -9.1167002916336060e-02</internalNodes>
+          <leafValues>
+            -6.7608010768890381e-01 5.6040819734334946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 264 5.2755638957023621e-02</internalNodes>
+          <leafValues>
+            7.4688747525215149e-02 -6.3256257772445679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 265 6.9458536803722382e-02</internalNodes>
+          <leafValues>
+            -1.1754920333623886e-01 6.3863641023635864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 266 -4.8209438100457191e-03</internalNodes>
+          <leafValues>
+            2.9225930571556091e-01 -1.3872410356998444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 267 3.2156750559806824e-02</internalNodes>
+          <leafValues>
+            7.5575239956378937e-02 -5.7927912473678589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 268 -4.4298470020294189e-02</internalNodes>
+          <leafValues>
+            4.0226811170578003e-01 -1.0264609754085541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 269 -7.0452108047902584e-03</internalNodes>
+          <leafValues>
+            1.5128499269485474e-01 -5.6725870817899704e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 270 5.1606830675154924e-04</internalNodes>
+          <leafValues>
+            -2.3022100329399109e-01 1.6343879699707031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 271 -6.1528358608484268e-02</internalNodes>
+          <leafValues>
+            2.5559040904045105e-01 -4.6751510351896286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 272 -5.1367811858654022e-02</internalNodes>
+          <leafValues>
+            -2.4755829572677612e-01 1.4305450022220612e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 273 9.0107098221778870e-03</internalNodes>
+          <leafValues>
+            -1.0648769885301590e-01 3.1271860003471375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 274 2.2352259606122971e-02</internalNodes>
+          <leafValues>
+            1.5494219958782196e-01 -3.1736290454864502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 275 3.1493891030550003e-02</internalNodes>
+          <leafValues>
+            7.2037532925605774e-02 -2.8946670889854431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 276 -5.2064459770917892e-02</internalNodes>
+          <leafValues>
+            -2.7082020044326782e-01 1.2260189652442932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 277 -6.1549381352961063e-03</internalNodes>
+          <leafValues>
+            1.6442950069904327e-01 -1.0657779872417450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 278 3.0305041000247002e-03</internalNodes>
+          <leafValues>
+            -1.5234139561653137e-01 2.0446379482746124e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 279 -6.8027540110051632e-03</internalNodes>
+          <leafValues>
+            7.1448147296905518e-02 -4.1458301246166229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 280 6.8647533655166626e-02</internalNodes>
+          <leafValues>
+            -5.2833538502454758e-02 5.7638901472091675e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 281 -9.2883080244064331e-02</internalNodes>
+          <leafValues>
+            -2.6236709952354431e-01 8.2425810396671295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 282 -5.2907038480043411e-03</internalNodes>
+          <leafValues>
+            1.4090450108051300e-01 -2.2050650417804718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 283 1.5640209894627333e-03</internalNodes>
+          <leafValues>
+            -1.0143549740314484e-01 1.3026970624923706e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 284 1.0752620175480843e-02</internalNodes>
+          <leafValues>
+            9.1515362262725830e-02 -3.2133978605270386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 285 -2.1106360480189323e-02</internalNodes>
+          <leafValues>
+            -2.7410230040550232e-01 9.1773197054862976e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 286 4.8663117922842503e-03</internalNodes>
+          <leafValues>
+            -1.5258720517158508e-01 1.9711069762706757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 287 6.5396472811698914e-02</internalNodes>
+          <leafValues>
+            6.5921088680624962e-03 -6.4343088865280151e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 288 4.4902609661221504e-03</internalNodes>
+          <leafValues>
+            -1.0377249866724014e-01 2.8005209565162659e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 289 4.6614840626716614e-02</internalNodes>
+          <leafValues>
+            5.4715849459171295e-02 -5.2179151773452759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 290 1.1597450077533722e-01</internalNodes>
+          <leafValues>
+            3.9613999426364899e-02 -6.4784902334213257e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 291 5.7222661562263966e-03</internalNodes>
+          <leafValues>
+            -5.4838169366121292e-02 1.2828019261360168e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 292 -4.1633259505033493e-02</internalNodes>
+          <leafValues>
+            -8.0665838718414307e-01 3.5942289978265762e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 293 -4.7252390533685684e-02</internalNodes>
+          <leafValues>
+            -7.9193192720413208e-01 1.2737370096147060e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 294 -1.6451090341433883e-03</internalNodes>
+          <leafValues>
+            2.0376729965209961e-01 -1.3230639696121216e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 295 2.5758889969438314e-03</internalNodes>
+          <leafValues>
+            -6.3503406941890717e-02 1.3530080020427704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 296 2.0758589729666710e-02</internalNodes>
+          <leafValues>
+            4.7286979854106903e-02 -5.8212000131607056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 297 -2.8601480647921562e-02</internalNodes>
+          <leafValues>
+            -4.1221970319747925e-01 2.4210980162024498e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 298 -2.8691580519080162e-02</internalNodes>
+          <leafValues>
+            -5.5404680967330933e-01 4.5068629086017609e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 299 -2.6637869887053967e-03</internalNodes>
+          <leafValues>
+            1.2570230662822723e-01 -1.6319499909877777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 300 -4.4750720262527466e-03</internalNodes>
+          <leafValues>
+            -2.7138069272041321e-01 1.0293100029230118e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 301 4.0937099605798721e-02</internalNodes>
+          <leafValues>
+            -3.2065469771623611e-02 1.3092640042304993e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 302 7.5827181339263916e-02</internalNodes>
+          <leafValues>
+            -5.1221519708633423e-02 5.6596297025680542e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>58</maxWeakCount>
+      <stageThreshold>-9.1252201795578003e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 303 -4.2669968679547310e-03</internalNodes>
+          <leafValues>
+            1.7704419791698456e-01 -2.8265419602394104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 304 -2.2577939555048943e-02</internalNodes>
+          <leafValues>
+            2.3657959699630737e-01 -4.2326368391513824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 305 -9.8107997328042984e-03</internalNodes>
+          <leafValues>
+            -3.8568308949470520e-01 9.0982303023338318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 306 3.8510379381477833e-03</internalNodes>
+          <leafValues>
+            -1.0270400345325470e-01 1.9267590343952179e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 307 -2.0688450895249844e-03</internalNodes>
+          <leafValues>
+            1.6656570136547089e-01 -2.1394389867782593e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 308 -5.8368500322103500e-02</internalNodes>
+          <leafValues>
+            3.4833571314811707e-01 -8.0605462193489075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 309 5.6290920823812485e-02</internalNodes>
+          <leafValues>
+            -6.1617989093065262e-02 6.9421827793121338e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 310 5.5776340886950493e-03</internalNodes>
+          <leafValues>
+            7.8374862670898438e-02 -4.0764930844306946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 311 5.0974669866263866e-03</internalNodes>
+          <leafValues>
+            1.5001790225505829e-01 -2.7620849013328552e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 312 2.4134019389748573e-02</internalNodes>
+          <leafValues>
+            -3.7685971707105637e-02 4.0111309289932251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 313 2.6251180097460747e-03</internalNodes>
+          <leafValues>
+            -1.8986889719963074e-01 1.6666570305824280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 314 -2.3179719224572182e-02</internalNodes>
+          <leafValues>
+            -6.0807460546493530e-01 3.3016931265592575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 315 -1.7960369586944580e-03</internalNodes>
+          <leafValues>
+            1.8328389525413513e-01 -1.6300560534000397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 316 1.1327250301837921e-01</internalNodes>
+          <leafValues>
+            1.6392359510064125e-02 -3.8521450757980347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 317 -1.1120930314064026e-02</internalNodes>
+          <leafValues>
+            -2.6789391040802002e-01 1.2030880153179169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 318 8.9298561215400696e-03</internalNodes>
+          <leafValues>
+            -6.4766243100166321e-02 5.2446700632572174e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 319 3.0264519155025482e-02</internalNodes>
+          <leafValues>
+            -5.3343709558248520e-02 4.9170601367950439e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 320 1.3036240637302399e-01</internalNodes>
+          <leafValues>
+            9.9123492836952209e-03 -8.0775249004364014e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 321 -4.8941900022327900e-03</internalNodes>
+          <leafValues>
+            1.4153289794921875e-01 -2.4222679436206818e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 322 -1.8009349703788757e-02</internalNodes>
+          <leafValues>
+            -1.8352709710597992e-01 5.3784269839525223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 323 6.3028637669049203e-05</internalNodes>
+          <leafValues>
+            -2.0836220681667328e-01 1.3861179351806641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 324 -3.8127291202545166e-01</internalNodes>
+          <leafValues>
+            -7.6527822017669678e-01 3.4578099846839905e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 325 1.6168570145964622e-02</internalNodes>
+          <leafValues>
+            -7.8577049076557159e-02 3.6086350679397583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 326 -2.0725380629301071e-02</internalNodes>
+          <leafValues>
+            -3.2905191183090210e-01 8.1693336367607117e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 327 -1.4763489889446646e-04</internalNodes>
+          <leafValues>
+            1.0449170321226120e-01 -2.7624139189720154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 328 -1.6959169879555702e-02</internalNodes>
+          <leafValues>
+            -2.4150790274143219e-01 5.4569680243730545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 329 -1.5221100300550461e-02</internalNodes>
+          <leafValues>
+            4.1033148765563965e-01 -6.8333253264427185e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 330 -9.6041243523359299e-03</internalNodes>
+          <leafValues>
+            -3.3569648861885071e-01 8.6250491440296173e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 331 -1.6476860037073493e-03</internalNodes>
+          <leafValues>
+            1.6236330568790436e-01 -1.9044490158557892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 332 -1.0705839842557907e-01</internalNodes>
+          <leafValues>
+            -8.6767107248306274e-01 7.3941340669989586e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 333 -1.8818160519003868e-02</internalNodes>
+          <leafValues>
+            -3.6879110336303711e-01 6.8846642971038818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 334 -5.6142187677323818e-03</internalNodes>
+          <leafValues>
+            1.7322039604187012e-01 -1.2514470517635345e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 335 7.3969298973679543e-03</internalNodes>
+          <leafValues>
+            -8.5467368364334106e-02 3.2027161121368408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 336 9.4870915636420250e-03</internalNodes>
+          <leafValues>
+            6.3168406486511230e-02 -2.0918910205364227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 337 1.8458140548318624e-03</internalNodes>
+          <leafValues>
+            -1.5436279773712158e-01 1.8517020344734192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 338 -1.9747359678149223e-02</internalNodes>
+          <leafValues>
+            3.3071118593215942e-01 -7.6775848865509033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 339 3.2421160489320755e-02</internalNodes>
+          <leafValues>
+            8.2021132111549377e-02 -4.0147501230239868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 340 2.9075390193611383e-03</internalNodes>
+          <leafValues>
+            -7.7174037694931030e-02 1.0620699822902679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 341 1.5189359895884991e-02</internalNodes>
+          <leafValues>
+            6.0363899916410446e-02 -4.1365239024162292e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 342 -3.0683739110827446e-02</internalNodes>
+          <leafValues>
+            4.3470621109008789e-01 -5.9381321072578430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 343 -1.0973449796438217e-02</internalNodes>
+          <leafValues>
+            -2.9535230994224548e-01 8.5516467690467834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 344 -3.9540361613035202e-02</internalNodes>
+          <leafValues>
+            -2.8765881061553955e-01 3.4472968429327011e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 345 -3.7935871630907059e-02</internalNodes>
+          <leafValues>
+            3.8199868798255920e-01 -8.5364766418933868e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 346 3.0669810250401497e-02</internalNodes>
+          <leafValues>
+            4.4738098978996277e-02 -1.7703640460968018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 347 1.7194509506225586e-01</internalNodes>
+          <leafValues>
+            -5.9214178472757339e-02 4.9291038513183594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 348 -6.7055500112473965e-03</internalNodes>
+          <leafValues>
+            1.6410259902477264e-01 -2.1826469898223877e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 349 -3.8577869534492493e-01</internalNodes>
+          <leafValues>
+            -6.7176771163940430e-01 4.2349591851234436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 350 2.7213040739297867e-02</internalNodes>
+          <leafValues>
+            1.2266149744391441e-02 -2.2954210638999939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 351 -1.9294980913400650e-02</internalNodes>
+          <leafValues>
+            -5.8373439311981201e-01 3.8380999118089676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 352 7.6792249456048012e-03</internalNodes>
+          <leafValues>
+            -4.7490350902080536e-02 1.5964460372924805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 353 6.0242269682930782e-05</internalNodes>
+          <leafValues>
+            -1.1734239757061005e-01 1.8236650526523590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 354 -6.6498141677584499e-05</internalNodes>
+          <leafValues>
+            7.4745140969753265e-02 -1.6989439725875854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 355 4.3275849893689156e-03</internalNodes>
+          <leafValues>
+            7.3789797723293304e-02 -2.8444349765777588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 356 -3.3140469342470169e-02</internalNodes>
+          <leafValues>
+            -4.0606608986854553e-01 1.0028730146586895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 357 9.9181402474641800e-03</internalNodes>
+          <leafValues>
+            -7.9339787364006042e-02 2.8190010786056519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 358 -2.3577339015901089e-03</internalNodes>
+          <leafValues>
+            1.5301220118999481e-01 -1.0475979745388031e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 359 -2.6200819760560989e-02</internalNodes>
+          <leafValues>
+            -5.4185032844543457e-01 4.4369250535964966e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 360 4.7328658401966095e-02</internalNodes>
+          <leafValues>
+            1.8897749483585358e-02 -8.2665932178497314e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-1.1653599739074707e+00</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 361 2.9921719804406166e-02</internalNodes>
+          <leafValues>
+            -3.2315000891685486e-01 5.1092821359634399e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 362 5.6147608906030655e-02</internalNodes>
+          <leafValues>
+            -1.2574400007724762e-01 6.6749179363250732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 363 -1.3759849593043327e-02</internalNodes>
+          <leafValues>
+            4.0691190958023071e-01 -2.1075299382209778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 364 -4.3788701295852661e-03</internalNodes>
+          <leafValues>
+            2.7940139174461365e-01 -2.0955459773540497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 365 1.9208889454603195e-02</internalNodes>
+          <leafValues>
+            -8.9800693094730377e-02 5.0936561822891235e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 366 -8.9393591042608023e-04</internalNodes>
+          <leafValues>
+            1.0703620314598083e-01 -1.2294200062751770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 367 -6.2918022740632296e-04</internalNodes>
+          <leafValues>
+            -3.7847930192947388e-01 1.3008819520473480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 368 -1.6248769825324416e-03</internalNodes>
+          <leafValues>
+            1.7750020325183868e-01 -2.7811211347579956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 369 -4.6151960268616676e-03</internalNodes>
+          <leafValues>
+            2.4071510136127472e-01 -1.4269010722637177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 370 5.7162828743457794e-02</internalNodes>
+          <leafValues>
+            -1.8474869430065155e-02 4.5086058974266052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 371 -3.8265369366854429e-03</internalNodes>
+          <leafValues>
+            2.5951761007308960e-01 -1.1455159634351730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 372 -4.5235190540552139e-02</internalNodes>
+          <leafValues>
+            -3.3849009871482849e-01 3.4538950771093369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 373 3.8135750219225883e-03</internalNodes>
+          <leafValues>
+            1.1333999782800674e-01 -2.7620390057563782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 374 4.5108258724212646e-02</internalNodes>
+          <leafValues>
+            2.8602050617337227e-02 -1.5837669372558594e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 375 -2.7794970665127039e-03</internalNodes>
+          <leafValues>
+            2.8897428512573242e-01 -1.0822720080614090e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 376 5.6366869248449802e-03</internalNodes>
+          <leafValues>
+            -1.0184790194034576e-01 7.8787103295326233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 377 -5.2986819297075272e-02</internalNodes>
+          <leafValues>
+            5.2964997291564941e-01 -6.5543353557586670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 378 7.4737891554832458e-02</internalNodes>
+          <leafValues>
+            2.6320660486817360e-02 -3.0487209558486938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 379 4.1559520177543163e-03</internalNodes>
+          <leafValues>
+            -2.2977170348167419e-01 1.5662179887294769e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 380 -2.9388200491666794e-03</internalNodes>
+          <leafValues>
+            -1.6916410624980927e-01 9.6996672451496124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 381 -1.3065510429441929e-02</internalNodes>
+          <leafValues>
+            4.0258568525314331e-01 -7.1614369750022888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 382 -3.4928251057863235e-02</internalNodes>
+          <leafValues>
+            -4.9449989199638367e-01 2.2547820582985878e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 383 2.1728971041738987e-03</internalNodes>
+          <leafValues>
+            -1.5552569925785065e-01 2.0136219263076782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 384 1.4387349598109722e-02</internalNodes>
+          <leafValues>
+            3.6348100751638412e-02 -2.9468619823455811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 385 6.7830132320523262e-03</internalNodes>
+          <leafValues>
+            -8.2248352468013763e-02 3.3857500553131104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 386 -7.2883836925029755e-02</internalNodes>
+          <leafValues>
+            -3.4577670693397522e-01 1.9601320847868919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 387 -4.5158518478274345e-03</internalNodes>
+          <leafValues>
+            1.7059490084648132e-01 -1.9742819666862488e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 388 -1.3742079958319664e-02</internalNodes>
+          <leafValues>
+            -2.1214349567890167e-01 3.3953689038753510e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 389 7.8056701458990574e-03</internalNodes>
+          <leafValues>
+            7.1426697075366974e-02 -3.4223988652229309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 390 2.1649990230798721e-02</internalNodes>
+          <leafValues>
+            -6.1925049871206284e-02 3.7267661094665527e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 391 -6.7706637084484100e-02</internalNodes>
+          <leafValues>
+            -3.0304160714149475e-01 9.4357587397098541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 392 -2.1855749655514956e-03</internalNodes>
+          <leafValues>
+            1.0831770300865173e-01 -1.5530540049076080e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 393 -2.5483060162514448e-03</internalNodes>
+          <leafValues>
+            -2.4103440344333649e-01 9.2916287481784821e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 394 -6.7207813262939453e-02</internalNodes>
+          <leafValues>
+            -6.6259348392486572e-01 1.6074649989604950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 395 4.7799371182918549e-02</internalNodes>
+          <leafValues>
+            -4.4412638992071152e-02 6.0569787025451660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 396 -9.1178417205810547e-02</internalNodes>
+          <leafValues>
+            2.4761490523815155e-01 -3.4762401133775711e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 397 -3.8592480123043060e-03</internalNodes>
+          <leafValues>
+            -2.5366741418838501e-01 1.0194999724626541e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 398 2.4100970476865768e-03</internalNodes>
+          <leafValues>
+            -1.2133970111608505e-01 1.9767910242080688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 399 -5.3831469267606735e-03</internalNodes>
+          <leafValues>
+            1.7103940248489380e-01 -1.6189830005168915e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 400 9.1004222631454468e-03</internalNodes>
+          <leafValues>
+            -6.0921549797058105e-02 1.7695249617099762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 401 2.2724110167473555e-03</internalNodes>
+          <leafValues>
+            -9.0476967394351959e-02 2.7440631389617920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 402 -8.0621562898159027e-02</internalNodes>
+          <leafValues>
+            -8.8045567274093628e-01 1.7193239182233810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 403 3.8965709973126650e-03</internalNodes>
+          <leafValues>
+            -1.7037920653820038e-01 1.7979580163955688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 404 -4.3093641288578510e-03</internalNodes>
+          <leafValues>
+            -2.9382050037384033e-01 8.6317472159862518e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>44</maxWeakCount>
+      <stageThreshold>-9.4284927845001221e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 405 -6.3116192817687988e-02</internalNodes>
+          <leafValues>
+            5.5512517690658569e-01 -3.5997709631919861e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 406 8.4350287914276123e-02</internalNodes>
+          <leafValues>
+            -1.2531270086765289e-01 5.3567689657211304e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 407 -2.1390730142593384e-01</internalNodes>
+          <leafValues>
+            7.5156861543655396e-01 -8.8270872831344604e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 408 -2.9744980856776237e-02</internalNodes>
+          <leafValues>
+            2.0106209814548492e-01 -1.2106689810752869e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 409 -1.1987680196762085e-01</internalNodes>
+          <leafValues>
+            6.4692199230194092e-01 -7.7747613191604614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 410 3.0843529384583235e-03</internalNodes>
+          <leafValues>
+            -6.3067637383937836e-02 7.7889077365398407e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 411 -4.5560211874544621e-03</internalNodes>
+          <leafValues>
+            1.8972270190715790e-01 -1.9929079711437225e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 412 4.4629329931922257e-04</internalNodes>
+          <leafValues>
+            1.4051589369773865e-01 -3.0292418599128723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 413 -6.4954371191561222e-03</internalNodes>
+          <leafValues>
+            3.1942290067672729e-01 -1.1072000116109848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 414 -2.1751760505139828e-03</internalNodes>
+          <leafValues>
+            1.6477259993553162e-01 -8.0424778163433075e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 415 6.5875840373337269e-03</internalNodes>
+          <leafValues>
+            1.4716550707817078e-01 -3.0198150873184204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 416 2.0701209083199501e-02</internalNodes>
+          <leafValues>
+            -4.2996689677238464e-02 4.0123820304870605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 417 2.5877119041979313e-03</internalNodes>
+          <leafValues>
+            1.2630540132522583e-01 -2.7518120408058167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 418 -1.0545079596340656e-02</internalNodes>
+          <leafValues>
+            1.9637629389762878e-01 -3.9772778749465942e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 419 6.2396968714892864e-03</internalNodes>
+          <leafValues>
+            -8.3563409745693207e-02 3.6655488610267639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 420 1.4458670280873775e-02</internalNodes>
+          <leafValues>
+            6.3301697373390198e-02 -5.8498907089233398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 421 3.1263440847396851e-02</internalNodes>
+          <leafValues>
+            -1.0675270110368729e-01 3.4852859377861023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 422 1.4865349512547255e-03</internalNodes>
+          <leafValues>
+            1.3709670305252075e-01 -1.3731659948825836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 423 -1.7898039368446916e-04</internalNodes>
+          <leafValues>
+            1.7839649319648743e-01 -2.5751718878746033e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 424 7.7714473009109497e-02</internalNodes>
+          <leafValues>
+            5.7081848382949829e-02 -2.4273400008678436e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 425 2.2228270769119263e-02</internalNodes>
+          <leafValues>
+            1.4593790471553802e-01 -2.0994609594345093e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 426 1.6969949938356876e-03</internalNodes>
+          <leafValues>
+            -1.4418889582157135e-01 2.7375409007072449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 427 -2.0023470744490623e-02</internalNodes>
+          <leafValues>
+            -3.7556248903274536e-01 8.1627696752548218e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 428 3.8644319865852594e-03</internalNodes>
+          <leafValues>
+            -6.4490430057048798e-02 1.5921689569950104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 429 -3.0527650378644466e-03</internalNodes>
+          <leafValues>
+            2.6751521229743958e-01 -1.0531850159168243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 430 5.6112320162355900e-03</internalNodes>
+          <leafValues>
+            -6.8567730486392975e-02 2.1234990656375885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 431 4.6622268855571747e-03</internalNodes>
+          <leafValues>
+            1.4254149794578552e-01 -2.0892719924449921e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 432 2.4710448924452066e-03</internalNodes>
+          <leafValues>
+            7.2614386677742004e-02 -1.8833909928798676e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 433 1.2655000202357769e-02</internalNodes>
+          <leafValues>
+            -8.3605259656906128e-02 4.3262240290641785e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 434 -1.7724519595503807e-02</internalNodes>
+          <leafValues>
+            1.7432230710983276e-01 -2.8479820117354393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 435 -7.2321272455155849e-04</internalNodes>
+          <leafValues>
+            1.5343970060348511e-01 -2.4012179672718048e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 436 -6.2155709601938725e-03</internalNodes>
+          <leafValues>
+            2.5166681408882141e-01 -8.5519887506961823e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 437 4.1632771492004395e-02</internalNodes>
+          <leafValues>
+            5.0593800842761993e-02 -6.0965442657470703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 438 2.3918300867080688e-02</internalNodes>
+          <leafValues>
+            -3.6809660494327545e-02 3.9055478572845459e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 439 -7.4353138916194439e-03</internalNodes>
+          <leafValues>
+            1.5018579363822937e-01 -1.8627819418907166e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 440 -2.0571449771523476e-02</internalNodes>
+          <leafValues>
+            -2.8574559092521667e-01 4.8302378505468369e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 441 -7.3831980116665363e-03</internalNodes>
+          <leafValues>
+            3.6680561304092407e-01 -9.6067756414413452e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 442 9.7222924232482910e-03</internalNodes>
+          <leafValues>
+            6.3898019492626190e-02 -1.7262579500675201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 443 -2.1807629615068436e-02</internalNodes>
+          <leafValues>
+            1.8027269840240479e-01 -1.9109119474887848e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 444 5.8147668838500977e-02</internalNodes>
+          <leafValues>
+            8.5709961131215096e-03 -4.6250829100608826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 445 -9.4539504498243332e-03</internalNodes>
+          <leafValues>
+            -2.8908729553222656e-01 1.1421570181846619e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 446 -2.1080709993839264e-02</internalNodes>
+          <leafValues>
+            3.7570050358772278e-01 -2.5591030716896057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 447 -4.0629571303725243e-03</internalNodes>
+          <leafValues>
+            2.7146670222282410e-01 -1.0845380276441574e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 448 -1.2826620042324066e-01</internalNodes>
+          <leafValues>
+            1. -1.0962430387735367e-03</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>61</maxWeakCount>
+      <stageThreshold>-9.5620310306549072e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 449 -1.2662290036678314e-01</internalNodes>
+          <leafValues>
+            6.2268221378326416e-01 -1.4810459315776825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 450 -7.0846290327608585e-03</internalNodes>
+          <leafValues>
+            2.0133779942989349e-01 -1.7728950083255768e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 451 1.1459200084209442e-01</internalNodes>
+          <leafValues>
+            -8.8975846767425537e-02 5.7395541667938232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 452 3.3472150098532438e-03</internalNodes>
+          <leafValues>
+            7.5708203017711639e-02 -2.8222179412841797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 453 5.1924228668212891e-02</internalNodes>
+          <leafValues>
+            -1.3948489725589752e-01 2.5681090354919434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 454 -4.1343908756971359e-02</internalNodes>
+          <leafValues>
+            2.2414180636405945e-01 -4.3653670698404312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 455 -3.2056469470262527e-02</internalNodes>
+          <leafValues>
+            -5.9409761428833008e-01 5.1891159266233444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 456 -4.0590870194137096e-03</internalNodes>
+          <leafValues>
+            1.6402080655097961e-01 -1.5528389811515808e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 457 -9.1876718215644360e-05</internalNodes>
+          <leafValues>
+            1.0587870329618454e-01 -2.8261598944664001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 458 2.8358219191431999e-02</internalNodes>
+          <leafValues>
+            5.7384029030799866e-02 -6.7094147205352783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 459 -7.4662521481513977e-02</internalNodes>
+          <leafValues>
+            5.6916707754135132e-01 -4.8785641789436340e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 460 -3.6556490231305361e-03</internalNodes>
+          <leafValues>
+            2.2369490563869476e-01 -1.2202149629592896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 461 3.1778779812157154e-03</internalNodes>
+          <leafValues>
+            1.2240319699048996e-01 -2.7681729197502136e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 462 3.8044340908527374e-02</internalNodes>
+          <leafValues>
+            2.3216400295495987e-02 -5.3732901811599731e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 463 8.7831392884254456e-03</internalNodes>
+          <leafValues>
+            -7.4337556958198547e-02 3.2851231098175049e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 464 -5.9818099252879620e-03</internalNodes>
+          <leafValues>
+            -1.9504779577255249e-01 6.6976852715015411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 465 -1.6369449440389872e-03</internalNodes>
+          <leafValues>
+            1.4674800634384155e-01 -1.8024149537086487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 466 -9.9193133413791656e-02</internalNodes>
+          <leafValues>
+            6.8363517522811890e-01 -2.9652720317244530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 467 -1.0352009907364845e-02</internalNodes>
+          <leafValues>
+            3.4225308895111084e-01 -8.1141538918018341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 468 2.5637909770011902e-02</internalNodes>
+          <leafValues>
+            5.1416900008916855e-02 -1.6697999835014343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 469 -1.2416959507390857e-03</internalNodes>
+          <leafValues>
+            1.2488900125026703e-01 -2.1346220374107361e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 470 1.5018839621916413e-03</internalNodes>
+          <leafValues>
+            9.7934387624263763e-02 -2.6385021209716797e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 471 -3.2703679054975510e-02</internalNodes>
+          <leafValues>
+            5.7504880428314209e-01 -4.5875400304794312e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 472 2.1297169849276543e-02</internalNodes>
+          <leafValues>
+            6.1069380491971970e-02 -2.2480219602584839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 473 -8.8358018547296524e-04</internalNodes>
+          <leafValues>
+            9.5625787973403931e-02 -2.7564591169357300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 474 -3.6556860432028770e-03</internalNodes>
+          <leafValues>
+            2.4107089638710022e-01 -1.0359519720077515e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 475 3.4300461411476135e-02</internalNodes>
+          <leafValues>
+            3.9062701165676117e-02 -6.2445348501205444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 476 1.1492350138723850e-02</internalNodes>
+          <leafValues>
+            -6.9246053695678711e-02 3.8258171081542969e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 477 -3.1294790096580982e-03</internalNodes>
+          <leafValues>
+            1.1273369938135147e-01 -2.3122510313987732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 478 -4.0945871733129025e-03</internalNodes>
+          <leafValues>
+            -1.7195980250835419e-01 1.3112659752368927e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 479 -3.0921408906579018e-03</internalNodes>
+          <leafValues>
+            -2.5460389256477356e-01 9.6659161150455475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 480 -4.1672129184007645e-02</internalNodes>
+          <leafValues>
+            2.7327769994735718e-01 -6.3094623386859894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 481 1.1384460143744946e-02</internalNodes>
+          <leafValues>
+            -7.1872517466545105e-02 4.1160398721694946e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 482 -2.3934150114655495e-02</internalNodes>
+          <leafValues>
+            1.3192340731620789e-01 -1.7954839766025543e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 483 -3.1554169952869415e-02</internalNodes>
+          <leafValues>
+            -5.8792132139205933e-01 4.1782889515161514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 484 -2.4033859372138977e-02</internalNodes>
+          <leafValues>
+            -1.5534760057926178e-01 2.7700260281562805e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 485 3.1589470803737640e-02</internalNodes>
+          <leafValues>
+            -3.9150279015302658e-02 6.0951721668243408e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 486 -2.4214860051870346e-02</internalNodes>
+          <leafValues>
+            -2.4587619304656982e-01 9.1133296489715576e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 487 1.9322870066389441e-03</internalNodes>
+          <leafValues>
+            -1.1647839844226837e-01 1.8819290399551392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 488 -3.6017759703099728e-03</internalNodes>
+          <leafValues>
+            9.7600512206554413e-02 -4.8918090760707855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 489 3.1516118906438351e-03</internalNodes>
+          <leafValues>
+            6.5808869898319244e-02 -3.1577658653259277e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 490 -6.3677072525024414e-02</internalNodes>
+          <leafValues>
+            -8.6415481567382812e-01 -9.9097320344299078e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 491 -3.9085028693079948e-03</internalNodes>
+          <leafValues>
+            2.0826210081577301e-01 -1.0560230165719986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 492 -2.6837719604372978e-02</internalNodes>
+          <leafValues>
+            -1.8375129997730255e-01 2.9545329511165619e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 493 3.1312298960983753e-03</internalNodes>
+          <leafValues>
+            -1.2626689672470093e-01 1.6888590157032013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 494 -7.3491871356964111e-02</internalNodes>
+          <leafValues>
+            -1. 5.6774187833070755e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 495 1.8034819513559341e-02</internalNodes>
+          <leafValues>
+            -6.8617410957813263e-02 3.3438131213188171e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 496 6.8655997514724731e-02</internalNodes>
+          <leafValues>
+            4.6462309546768665e-03 -8.0664628744125366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 497 -4.6970890834927559e-03</internalNodes>
+          <leafValues>
+            -2.0121769607067108e-01 1.1580040305852890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 498 4.6783890575170517e-02</internalNodes>
+          <leafValues>
+            -3.5802699625492096e-02 4.1625639796257019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 499 4.5946058817207813e-03</internalNodes>
+          <leafValues>
+            8.8457576930522919e-02 -2.6894488930702209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 500 -1.3852829579263926e-03</internalNodes>
+          <leafValues>
+            8.1391222774982452e-02 -1.4880420267581940e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 501 2.1788759157061577e-02</internalNodes>
+          <leafValues>
+            -9.1640457510948181e-02 2.1261249482631683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 502 -1.3380090240389109e-04</internalNodes>
+          <leafValues>
+            9.6424743533134460e-02 -1.4717370271682739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 503 -4.7990411520004272e-02</internalNodes>
+          <leafValues>
+            -6.1987131834030151e-01 3.8760710507631302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 504 2.0026009529829025e-02</internalNodes>
+          <leafValues>
+            -3.5972420126199722e-02 1.9393420219421387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 505 1.0723130544647574e-03</internalNodes>
+          <leafValues>
+            -1.9447499513626099e-01 1.2064950168132782e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 506 2.2665090858936310e-02</internalNodes>
+          <leafValues>
+            4.8719439655542374e-02 -2.3640799522399902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 507 -1.1042109690606594e-02</internalNodes>
+          <leafValues>
+            -2.6107341051101685e-01 1.0075490176677704e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 508 -1.2811049818992615e-02</internalNodes>
+          <leafValues>
+            1.5199629962444305e-01 -8.8552959263324738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 509 -3.6628648638725281e-02</internalNodes>
+          <leafValues>
+            3.8858860731124878e-01 -7.7304549515247345e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>72</maxWeakCount>
+      <stageThreshold>-8.7708407640457153e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 510 -5.4606638848781586e-02</internalNodes>
+          <leafValues>
+            5.5801349878311157e-01 -1.4168889820575714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 511 3.3533740788698196e-02</internalNodes>
+          <leafValues>
+            -2.7386279776692390e-02 4.4381770491600037e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 512 -9.9635301157832146e-03</internalNodes>
+          <leafValues>
+            2.5193908810615540e-01 -1.4647540450096130e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 513 1.8188880058005452e-03</internalNodes>
+          <leafValues>
+            -1.1264120042324066e-01 1.1523260176181793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 514 -4.8793829977512360e-02</internalNodes>
+          <leafValues>
+            5.1317107677459717e-01 -7.8665018081665039e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 515 -1.3357769697904587e-02</internalNodes>
+          <leafValues>
+            -1.4197979867458344e-01 1.1862599849700928e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 516 1.1562240542843938e-03</internalNodes>
+          <leafValues>
+            -2.0949220657348633e-01 1.5693040192127228e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 517 -6.2384512275457382e-03</internalNodes>
+          <leafValues>
+            -1.4336450397968292e-01 1.1303550004959106e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 518 4.4234818778932095e-03</internalNodes>
+          <leafValues>
+            -1.0358580201864243e-01 2.4589489400386810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 519 5.2964448928833008e-02</internalNodes>
+          <leafValues>
+            1.2561550363898277e-02 -6.2551808357238770e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 520 5.5844681337475777e-03</internalNodes>
+          <leafValues>
+            8.3967886865139008e-02 -2.4653799831867218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 521 -4.1809541289694607e-04</internalNodes>
+          <leafValues>
+            6.9588072597980499e-02 -1.3558819890022278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 522 -8.9637134224176407e-03</internalNodes>
+          <leafValues>
+            -3.0442738533020020e-01 6.9894723594188690e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 523 2.4479050189256668e-02</internalNodes>
+          <leafValues>
+            -3.1651828438043594e-02 2.0308789610862732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 524 -2.5842329487204552e-02</internalNodes>
+          <leafValues>
+            5.0401061773300171e-01 -6.3922062516212463e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 525 -2.0785620436072350e-03</internalNodes>
+          <leafValues>
+            1.0980220139026642e-01 -1.1839559674263000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 526 6.8030342459678650e-02</internalNodes>
+          <leafValues>
+            4.2290739715099335e-02 -5.1855510473251343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 527 -7.0639760233461857e-03</internalNodes>
+          <leafValues>
+            -2.0031100511550903e-01 2.4955609813332558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 528 -3.4848200157284737e-03</internalNodes>
+          <leafValues>
+            2.3135329782962799e-01 -9.6989557147026062e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 529 1.3147160410881042e-02</internalNodes>
+          <leafValues>
+            -3.7450950592756271e-02 2.5842788815498352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 530 -1.4271659776568413e-02</internalNodes>
+          <leafValues>
+            -3.0110171437263489e-01 7.9672336578369141e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 531 1.2653480283915997e-02</internalNodes>
+          <leafValues>
+            4.9039140343666077e-02 -1.4988109469413757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 532 -4.4893440790474415e-03</internalNodes>
+          <leafValues>
+            1.7208859324455261e-01 -1.5355649590492249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 533 3.2365400344133377e-02</internalNodes>
+          <leafValues>
+            -9.0493112802505493e-02 3.5779160261154175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 534 4.6125808730721474e-03</internalNodes>
+          <leafValues>
+            1.1445190012454987e-01 -2.6519489288330078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 535 2.8645930811762810e-02</internalNodes>
+          <leafValues>
+            -3.5988539457321167e-02 3.0025520920753479e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 536 -2.3571979254484177e-02</internalNodes>
+          <leafValues>
+            -2.4872820079326630e-01 9.1967120766639709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 537 -1.0739799588918686e-02</internalNodes>
+          <leafValues>
+            -2.1367760002613068e-01 9.6477411687374115e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 538 2.3728659376502037e-02</internalNodes>
+          <leafValues>
+            -7.0916198194026947e-02 4.3828758597373962e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 539 -3.2800701260566711e-01</internalNodes>
+          <leafValues>
+            5.8840030431747437e-01 -3.1756788492202759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 540 7.5008560997957829e-06</internalNodes>
+          <leafValues>
+            -1.8288560211658478e-01 1.2022940069437027e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 541 3.0071409419178963e-02</internalNodes>
+          <leafValues>
+            2.7802020311355591e-02 -4.3224281072616577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 542 -2.1936609409749508e-03</internalNodes>
+          <leafValues>
+            1.3592420518398285e-01 -1.4038629829883575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 543 2.0174339413642883e-02</internalNodes>
+          <leafValues>
+            -6.1628919094800949e-02 3.1579768657684326e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 544 9.7460206598043442e-03</internalNodes>
+          <leafValues>
+            8.8958032429218292e-02 -2.2594009339809418e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 545 -1.2958340346813202e-02</internalNodes>
+          <leafValues>
+            -1.2200850248336792e-01 8.6518086493015289e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 546 1.1445499956607819e-02</internalNodes>
+          <leafValues>
+            -6.4182333648204803e-02 3.0279749631881714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 547 -3.3802569378167391e-03</internalNodes>
+          <leafValues>
+            1.1177670210599899e-01 -1.2922379374504089e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 548 2.0366210490465164e-02</internalNodes>
+          <leafValues>
+            1.0104539990425110e-01 -2.5991159677505493e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 549 3.8058649748563766e-02</internalNodes>
+          <leafValues>
+            1.3168349862098694e-02 -7.5580632686614990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 550 2.3050000891089439e-03</internalNodes>
+          <leafValues>
+            -1.0766649991273880e-01 1.8757669627666473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 551 5.1847118884325027e-02</internalNodes>
+          <leafValues>
+            -2.2320529446005821e-02 1.8795830011367798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 552 1.1383029632270336e-02</internalNodes>
+          <leafValues>
+            6.0226161032915115e-02 -3.5961788892745972e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 553 8.2553178071975708e-03</internalNodes>
+          <leafValues>
+            -8.5131391882896423e-02 2.3493440449237823e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 554 -2.6984339579939842e-02</internalNodes>
+          <leafValues>
+            -2.1479399502277374e-01 9.3656733632087708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 555 -1.0289980098605156e-02</internalNodes>
+          <leafValues>
+            5.8254890143871307e-02 -8.3950929343700409e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 556 -1.4419780200114474e-05</internalNodes>
+          <leafValues>
+            1.0392870008945465e-01 -1.7317299544811249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 557 1.0065140202641487e-02</internalNodes>
+          <leafValues>
+            -4.1311118751764297e-02 1.7616020143032074e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 558 -1.4870229642838240e-04</internalNodes>
+          <leafValues>
+            1.5657539665699005e-01 -1.2030059844255447e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 559 -3.1059589236974716e-03</internalNodes>
+          <leafValues>
+            1.1674880236387253e-01 -9.1372460126876831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 560 1.0708030313253403e-02</internalNodes>
+          <leafValues>
+            -7.7608227729797363e-02 2.7916100621223450e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 561 -9.7792129963636398e-03</internalNodes>
+          <leafValues>
+            -2.9060921072959900e-01 7.1562640368938446e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 562 2.0121980458498001e-02</internalNodes>
+          <leafValues>
+            4.3994959443807602e-02 -4.2539501190185547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 563 -6.3295163214206696e-02</internalNodes>
+          <leafValues>
+            3.7034231424331665e-01 -5.2549809217453003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 564 -8.7289556860923767e-02</internalNodes>
+          <leafValues>
+            -6.4299279451370239e-01 3.1952869147062302e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 565 2.0398540422320366e-02</internalNodes>
+          <leafValues>
+            -4.5955598354339600e-02 4.6266159415245056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 566 -4.0313000790774822e-03</internalNodes>
+          <leafValues>
+            1.3840849697589874e-01 -1.7980839312076569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 567 -1.5734519809484482e-02</internalNodes>
+          <leafValues>
+            -1.8477180600166321e-01 6.9983080029487610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 568 3.3332880120724440e-03</internalNodes>
+          <leafValues>
+            1.1277650296688080e-01 -1.9513790309429169e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 569 4.3689161539077759e-02</internalNodes>
+          <leafValues>
+            5.9510939754545689e-03 -5.5423438549041748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 570 -2.0920610986649990e-03</internalNodes>
+          <leafValues>
+            1.9163469970226288e-01 -9.7136110067367554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 571 2.0574270747601986e-03</internalNodes>
+          <leafValues>
+            -1.0197430104017258e-01 1.4083810150623322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 572 8.8018123060464859e-03</internalNodes>
+          <leafValues>
+            1.1987809836864471e-01 -1.5638549625873566e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 573 -1.6882529482245445e-02</internalNodes>
+          <leafValues>
+            -1.8438099324703217e-01 1.9492870196700096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 574 -6.1647890834137797e-04</internalNodes>
+          <leafValues>
+            1.0665109753608704e-01 -2.2164009511470795e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 575 1.0317339911125600e-04</internalNodes>
+          <leafValues>
+            -1.1228899657726288e-01 1.3858650624752045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 576 1.5316329896450043e-02</internalNodes>
+          <leafValues>
+            -5.0639409571886063e-02 4.1119828820228577e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 577 1.0660690255463123e-02</internalNodes>
+          <leafValues>
+            5.8820810168981552e-02 -1.6454669833183289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 578 -1.9296869635581970e-02</internalNodes>
+          <leafValues>
+            3.9260959625244141e-01 -5.2761189639568329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 579 1.0018110275268555e-02</internalNodes>
+          <leafValues>
+            1.0068470239639282e-01 -1.9756269454956055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 580 -2.7263790369033813e-02</internalNodes>
+          <leafValues>
+            3.5332089662551880e-01 -5.5305551737546921e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 581 5.4494310170412064e-03</internalNodes>
+          <leafValues>
+            6.7253768444061279e-02 -1.8384470045566559e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>75</maxWeakCount>
+      <stageThreshold>-8.5267168283462524e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 582 -5.7434860616922379e-02</internalNodes>
+          <leafValues>
+            5.0582551956176758e-01 -1.2274570018053055e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 583 -1.2750659883022308e-01</internalNodes>
+          <leafValues>
+            5.7605969905853271e-01 -4.3710928410291672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 584 -6.3675642013549805e-02</internalNodes>
+          <leafValues>
+            5.7122522592544556e-01 -4.9968320876359940e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 585 -1.1928480118513107e-02</internalNodes>
+          <leafValues>
+            2.1641939878463745e-01 -1.8480269610881805e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 586 1.3247699826024473e-04</internalNodes>
+          <leafValues>
+            -2.2685679793357849e-01 1.0648279637098312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 587 6.4140267204493284e-04</internalNodes>
+          <leafValues>
+            9.4751678407192230e-02 -2.6892009377479553e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 588 -2.9463530518114567e-03</internalNodes>
+          <leafValues>
+            1.3910910487174988e-01 -1.7091070115566254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 589 5.3384741768240929e-03</internalNodes>
+          <leafValues>
+            8.3969242870807648e-02 -9.5441989600658417e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 590 5.8703150600194931e-02</internalNodes>
+          <leafValues>
+            -6.9647520780563354e-02 3.3629441261291504e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 591 -2.5406300555914640e-03</internalNodes>
+          <leafValues>
+            9.6176013350486755e-02 -1.5758140385150909e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 592 -3.1899519264698029e-02</internalNodes>
+          <leafValues>
+            -2.7956488728523254e-01 7.0359513163566589e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 593 -3.2022708654403687e-01</internalNodes>
+          <leafValues>
+            -9.0805047750473022e-01 7.5922380201518536e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 594 3.5796251147985458e-02</internalNodes>
+          <leafValues>
+            -5.0070770084857941e-02 4.2101579904556274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 595 -1.9079160690307617e-01</internalNodes>
+          <leafValues>
+            -2.2061030566692352e-01 6.5184786915779114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 596 -1.2181829661130905e-02</internalNodes>
+          <leafValues>
+            1.3479439914226532e-01 -1.6667750477790833e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 597 -3.2165799289941788e-02</internalNodes>
+          <leafValues>
+            -2.5105410814285278e-01 1.9344560801982880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 598 3.6299630999565125e-02</internalNodes>
+          <leafValues>
+            -5.9490781277418137e-02 4.0007731318473816e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 599 2.0224580541253090e-02</internalNodes>
+          <leafValues>
+            5.6489799171686172e-02 -1.3418239355087280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 600 -2.5393130257725716e-02</internalNodes>
+          <leafValues>
+            3.6507838964462280e-01 -6.6002182662487030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 601 -1.2022369541227818e-02</internalNodes>
+          <leafValues>
+            -1.7655059695243835e-01 7.3997639119625092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 602 4.7965139150619507e-02</internalNodes>
+          <leafValues>
+            4.4668558984994888e-02 -4.4584980607032776e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 603 -2.0564019680023193e-01</internalNodes>
+          <leafValues>
+            -7.3254501819610596e-01 1.9955230876803398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 604 -1.6601709648966789e-03</internalNodes>
+          <leafValues>
+            1.1633270233869553e-01 -1.5488509833812714e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 605 8.6899623274803162e-02</internalNodes>
+          <leafValues>
+            -5.4107550531625748e-02 2.6952400803565979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 606 -1.1374129680916667e-03</internalNodes>
+          <leafValues>
+            -1.4314429461956024e-01 1.2444330006837845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 607 3.0976340174674988e-02</internalNodes>
+          <leafValues>
+            2.9864860698580742e-02 -3.2607930898666382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 608 2.6978010311722755e-02</internalNodes>
+          <leafValues>
+            -4.5098248869180679e-02 3.6128848791122437e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 609 1.9421820342540741e-01</internalNodes>
+          <leafValues>
+            3.2255191355943680e-02 -6.8981701135635376e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 610 -2.0443359389901161e-02</internalNodes>
+          <leafValues>
+            2.9300108551979065e-01 -6.4483217895030975e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 611 -4.0420450270175934e-02</internalNodes>
+          <leafValues>
+            -7.6823359727859497e-01 1.2281980365514755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 612 -1.2641429901123047e-02</internalNodes>
+          <leafValues>
+            -2.7573791146278381e-01 6.1901118606328964e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 613 -3.9670299738645554e-02</internalNodes>
+          <leafValues>
+            3.2828390598297119e-01 -2.0364999771118164e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 614 2.0246729254722595e-02</internalNodes>
+          <leafValues>
+            -5.8393601328134537e-02 3.3060538768768311e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 615 8.9611168950796127e-03</internalNodes>
+          <leafValues>
+            9.0096317231655121e-02 -2.2343009710311890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 616 -8.3055719733238220e-03</internalNodes>
+          <leafValues>
+            1.4175349473953247e-01 -1.2607260048389435e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 617 -2.8248139642528258e-05</internalNodes>
+          <leafValues>
+            9.4516962766647339e-02 -2.1810370683670044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 618 -5.1939398981630802e-03</internalNodes>
+          <leafValues>
+            1.3304319977760315e-01 -1.3341580331325531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 619 1.1773110181093216e-01</internalNodes>
+          <leafValues>
+            2.9586199671030045e-02 -2.4020829796791077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 620 6.7896701395511627e-02</internalNodes>
+          <leafValues>
+            8.0913707613945007e-02 -2.3454460501670837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 621 -2.6683699339628220e-02</internalNodes>
+          <leafValues>
+            3.0590981245040894e-01 -6.4152047038078308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 622 3.5058211069554090e-03</internalNodes>
+          <leafValues>
+            8.9341968297958374e-02 -2.2773680090904236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 623 -6.5844372147694230e-04</internalNodes>
+          <leafValues>
+            1.2458139657974243e-01 -9.1352440416812897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 624 7.2530400939285755e-03</internalNodes>
+          <leafValues>
+            -6.9285176694393158e-02 2.5482881069183350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 625 -2.8056129813194275e-02</internalNodes>
+          <leafValues>
+            -2.0867039263248444e-01 3.3539578318595886e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 626 -5.1205180585384369e-02</internalNodes>
+          <leafValues>
+            -2.4107429385185242e-01 6.4439408481121063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 627 2.9234649613499641e-02</internalNodes>
+          <leafValues>
+            -5.0803840160369873e-02 3.6485049128532410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 628 -1.0219520330429077e-01</internalNodes>
+          <leafValues>
+            4.0123480558395386e-01 -4.2902119457721710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 629 1.5104969963431358e-02</internalNodes>
+          <leafValues>
+            1.0481490194797516e-01 -1.8472430109977722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 630 -1.2570650316774845e-02</internalNodes>
+          <leafValues>
+            -2.0540939271450043e-01 9.3013197183609009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 631 1.2253070250153542e-02</internalNodes>
+          <leafValues>
+            -5.9285100549459457e-02 2.3927310109138489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 632 -2.6166990399360657e-02</internalNodes>
+          <leafValues>
+            -6.9966787099838257e-01 2.4906709790229797e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 633 7.0817661471664906e-03</internalNodes>
+          <leafValues>
+            2.4173120036721230e-02 -5.5144792795181274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 634 2.1426850929856300e-02</internalNodes>
+          <leafValues>
+            6.4168840646743774e-02 -2.5997900962829590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 635 1.8189709633588791e-02</internalNodes>
+          <leafValues>
+            3.5838250070810318e-02 -1.8020580708980560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 636 1.7415799200534821e-02</internalNodes>
+          <leafValues>
+            -8.3862036466598511e-02 3.3338528871536255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 637 -1.4878029469400644e-03</internalNodes>
+          <leafValues>
+            1.2078859657049179e-01 -1.2769320607185364e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 638 7.5296638533473015e-03</internalNodes>
+          <leafValues>
+            -7.0014707744121552e-02 3.2181090116500854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 639 -6.1499018222093582e-02</internalNodes>
+          <leafValues>
+            4.6469798684120178e-01 -1.0073710232973099e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 640 -1.9133290334139019e-04</internalNodes>
+          <leafValues>
+            -1.4094290137290955e-01 1.3830110430717468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 641 -2.4422289803624153e-02</internalNodes>
+          <leafValues>
+            -2.5292310118675232e-01 6.7684173583984375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 642 -2.6136320829391479e-01</internalNodes>
+          <leafValues>
+            3.4003540873527527e-01 -5.8462549000978470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 643 -7.6046779751777649e-02</internalNodes>
+          <leafValues>
+            -7.8514158725738525e-01 5.2708541043102741e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 644 -3.0279329512268305e-03</internalNodes>
+          <leafValues>
+            1.8527059257030487e-01 -9.0691961348056793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 645 -8.0219199880957603e-03</internalNodes>
+          <leafValues>
+            -1.2540580332279205e-01 3.0594889074563980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 646 -2.0705960690975189e-01</internalNodes>
+          <leafValues>
+            -7.5411921739578247e-01 2.1201130002737045e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 647 -9.5322817564010620e-02</internalNodes>
+          <leafValues>
+            -2.9623070359230042e-01 1.3138709589838982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 648 9.5921624451875687e-03</internalNodes>
+          <leafValues>
+            8.4324322640895844e-02 -2.1746580302715302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 649 -1.3089469633996487e-02</internalNodes>
+          <leafValues>
+            9.3607500195503235e-02 -6.5754130482673645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 650 1.1732880026102066e-02</internalNodes>
+          <leafValues>
+            -8.0039046704769135e-02 2.3291939496994019e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 651 1.5239049494266510e-01</internalNodes>
+          <leafValues>
+            9.9299130961298943e-03 -6.5196067094802856e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 652 -6.4591512084007263e-02</internalNodes>
+          <leafValues>
+            2.8372219204902649e-01 -6.0058828443288803e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 653 -5.5493030697107315e-02</internalNodes>
+          <leafValues>
+            2.6659101247787476e-01 -1.0336419567465782e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 654 -5.0287410616874695e-02</internalNodes>
+          <leafValues>
+            -6.9501471519470215e-01 2.7849879115819931e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 655 -4.7794249653816223e-01</internalNodes>
+          <leafValues>
+            -9.2871952056884766e-01 5.9050112031400204e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 656 -1.4398519881069660e-02</internalNodes>
+          <leafValues>
+            -4.5541068911552429e-01 3.6409981548786163e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>67</maxWeakCount>
+      <stageThreshold>-7.4186658859252930e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 657 1.9511899445205927e-03</internalNodes>
+          <leafValues>
+            -2.4936990439891815e-01 1.4111639559268951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 658 -4.6634670346975327e-02</internalNodes>
+          <leafValues>
+            3.7840589880943298e-01 -7.8401736915111542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 659 1.6193749383091927e-02</internalNodes>
+          <leafValues>
+            7.5213313102722168e-02 -4.1991469264030457e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 660 -1.2459639401640743e-04</internalNodes>
+          <leafValues>
+            6.8576186895370483e-02 -1.7935420572757721e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 661 7.3257791809737682e-03</internalNodes>
+          <leafValues>
+            1.0322099924087524e-01 -2.6099279522895813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 662 -1.5020779756014235e-05</internalNodes>
+          <leafValues>
+            7.3122598230838776e-02 -1.6718889772891998e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 663 -3.4522008150815964e-02</internalNodes>
+          <leafValues>
+            -3.9326989650726318e-01 7.6727166771888733e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 664 -8.2679510116577148e-02</internalNodes>
+          <leafValues>
+            -7.4677819013595581e-01 1.5530600212514400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 665 8.2162402570247650e-02</internalNodes>
+          <leafValues>
+            -6.9249503314495087e-02 3.7914600968360901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 666 3.4187830984592438e-02</internalNodes>
+          <leafValues>
+            4.2608659714460373e-02 -1.5429890155792236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 667 -1.7891369760036469e-02</internalNodes>
+          <leafValues>
+            -3.0639570951461792e-01 7.8118398785591125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 668 3.3130999654531479e-02</internalNodes>
+          <leafValues>
+            -5.6183800101280212e-02 3.7405240535736084e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 669 -5.7486710138618946e-03</internalNodes>
+          <leafValues>
+            1.2490350008010864e-01 -2.0527860522270203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 670 3.3536829054355621e-02</internalNodes>
+          <leafValues>
+            -4.8344220966100693e-02 2.6724401116371155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 671 2.4723829701542854e-02</internalNodes>
+          <leafValues>
+            8.3678968250751495e-02 -3.3730649948120117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 672 2.2355809342116117e-03</internalNodes>
+          <leafValues>
+            1.0374590009450912e-01 -1.3071919977664948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 673 -2.4322168901562691e-03</internalNodes>
+          <leafValues>
+            1.5645089745521545e-01 -1.3284459710121155e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 674 2.5999119505286217e-02</internalNodes>
+          <leafValues>
+            -8.0343127250671387e-02 2.1610119938850403e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 675 3.6965688195778057e-05</internalNodes>
+          <leafValues>
+            -1.7871010303497314e-01 1.0563120245933533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 676 -1.6291500627994537e-01</internalNodes>
+          <leafValues>
+            -6.9141697883605957e-01 2.2374730557203293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 677 1.3008140027523041e-01</internalNodes>
+          <leafValues>
+            -4.2769040912389755e-02 4.6373569965362549e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 678 2.7658540755510330e-02</internalNodes>
+          <leafValues>
+            -3.7108600139617920e-02 3.8386580348014832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 679 -1.0020419955253601e-02</internalNodes>
+          <leafValues>
+            -2.6328051090240479e-01 7.4858680367469788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 680 -3.0459940433502197e-02</internalNodes>
+          <leafValues>
+            3.2300901412963867e-01 -2.5858370587229729e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 681 1.3251040363684297e-03</internalNodes>
+          <leafValues>
+            1.4447669684886932e-01 -2.1082170307636261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 682 -2.7931010350584984e-02</internalNodes>
+          <leafValues>
+            1.4374519884586334e-01 -1.6162300109863281e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 683 -8.8642723858356476e-03</internalNodes>
+          <leafValues>
+            2.3000620305538177e-01 -9.5095098018646240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 684 -1.2213969603180885e-02</internalNodes>
+          <leafValues>
+            -2.4646399915218353e-01 6.5522022545337677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 685 -4.8737529665231705e-02</internalNodes>
+          <leafValues>
+            -7.9127711057662964e-01 2.5416409596800804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 686 6.1185289174318314e-02</internalNodes>
+          <leafValues>
+            -1.2226430408190936e-04 -9.0545868873596191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 687 2.6453679427504539e-02</internalNodes>
+          <leafValues>
+            2.6562800630927086e-02 -6.3954341411590576e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 688 8.8589917868375778e-03</internalNodes>
+          <leafValues>
+            5.4145850241184235e-02 -2.1601280570030212e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 689 3.4847941249608994e-02</internalNodes>
+          <leafValues>
+            -4.5749358832836151e-02 4.3935400247573853e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 690 -1.4598210155963898e-01</internalNodes>
+          <leafValues>
+            -5.5561769008636475e-01 9.5249973237514496e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 691 -5.0456568598747253e-02</internalNodes>
+          <leafValues>
+            -7.5287848711013794e-01 2.0214710384607315e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 692 -8.5443779826164246e-02</internalNodes>
+          <leafValues>
+            -1. -1.3681349810212851e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 693 1.3248980045318604e-02</internalNodes>
+          <leafValues>
+            6.3400700688362122e-02 -2.5411811470985413e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 694 -6.5935611724853516e-01</internalNodes>
+          <leafValues>
+            -1. 7.7378489077091217e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 695 5.0879311747848988e-03</internalNodes>
+          <leafValues>
+            -8.3207741379737854e-02 1.8876290321350098e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 696 -3.4071630798280239e-03</internalNodes>
+          <leafValues>
+            1.4578290283679962e-01 -9.1960333287715912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 697 -2.1656269207596779e-02</internalNodes>
+          <leafValues>
+            -6.5364891290664673e-01 2.7129750698804855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 698 9.4357347115874290e-03</internalNodes>
+          <leafValues>
+            6.4360111951828003e-02 -2.3885479569435120e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 699 -7.5177568942308426e-03</internalNodes>
+          <leafValues>
+            2.4519060552120209e-01 -6.8221837282180786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 700 1.6067629680037498e-02</internalNodes>
+          <leafValues>
+            7.6069780625402927e-03 -3.1668719649314880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 701 -1.8057749839499593e-03</internalNodes>
+          <leafValues>
+            1.2710370123386383e-01 -1.2145719677209854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 702 -4.4154901057481766e-02</internalNodes>
+          <leafValues>
+            -4.8579609394073486e-01 2.3444859310984612e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 703 7.5462698005139828e-03</internalNodes>
+          <leafValues>
+            6.8430766463279724e-02 -2.3316520452499390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 704 1.0868260264396667e-01</internalNodes>
+          <leafValues>
+            -4.1663911193609238e-02 3.9452219009399414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 705 6.1248701810836792e-01</internalNodes>
+          <leafValues>
+            2.0702170208096504e-02 -9.8494791984558105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 706 4.9828290939331055e-02</internalNodes>
+          <leafValues>
+            2.7304550167173147e-03 -4.0181699395179749e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 707 -7.2768718004226685e-02</internalNodes>
+          <leafValues>
+            3.2676479220390320e-01 -4.9144338816404343e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 708 2.4314310401678085e-02</internalNodes>
+          <leafValues>
+            -7.8135710209608078e-03 5.8223301172256470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 709 -1.7177179688587785e-04</internalNodes>
+          <leafValues>
+            8.1669911742210388e-02 -2.0376220345497131e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 710 -4.0095269680023193e-02</internalNodes>
+          <leafValues>
+            5.4681521654129028e-01 -1.7179539427161217e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 711 -8.9634567499160767e-02</internalNodes>
+          <leafValues>
+            -8.1614011526107788e-01 2.1283889189362526e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 712 1.8692140281200409e-01</internalNodes>
+          <leafValues>
+            8.3980746567249298e-03 -6.0185301303863525e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 713 -4.3038379400968552e-02</internalNodes>
+          <leafValues>
+            -8.7898987531661987e-01 1.4930729754269123e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 714 -1.8602630007080734e-04</internalNodes>
+          <leafValues>
+            4.0156241506338120e-02 -8.2604438066482544e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 715 -1.4392189914360642e-03</internalNodes>
+          <leafValues>
+            -1.7102399468421936e-01 9.1203540563583374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 716 4.2160619050264359e-02</internalNodes>
+          <leafValues>
+            -3.5861019045114517e-02 1.5174309909343719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 717 7.5991409830749035e-03</internalNodes>
+          <leafValues>
+            1.0874529927968979e-01 -1.6147160530090332e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 718 -5.7539329864084721e-03</internalNodes>
+          <leafValues>
+            -2.5677061080932617e-01 5.8457151055335999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 719 -2.7736749500036240e-02</internalNodes>
+          <leafValues>
+            2.2325170040130615e-01 -7.4071511626243591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 720 -2.5676110759377480e-02</internalNodes>
+          <leafValues>
+            1.8831080198287964e-01 -5.3860381245613098e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 721 1.5890730544924736e-02</internalNodes>
+          <leafValues>
+            5.1709540188312531e-02 -3.8476571440696716e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 722 -8.6374267935752869e-02</internalNodes>
+          <leafValues>
+            -5.5680698156356812e-01 9.4922119751572609e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 723 1.9480630289763212e-03</internalNodes>
+          <leafValues>
+            -1.0807219892740250e-01 1.4771680533885956e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>88</maxWeakCount>
+      <stageThreshold>-8.3640968799591064e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 724 -6.8531660363078117e-03</internalNodes>
+          <leafValues>
+            2.8935509920120239e-01 -2.7689141035079956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 725 -6.9217637181282043e-02</internalNodes>
+          <leafValues>
+            3.4909790754318237e-01 -4.9741089344024658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 726 -1.3092979788780212e-01</internalNodes>
+          <leafValues>
+            4.2791560292243958e-01 -9.6156008541584015e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 727 -2.9759139579255134e-05</internalNodes>
+          <leafValues>
+            1.1675780266523361e-01 -2.4678389728069305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 728 -4.7100789844989777e-02</internalNodes>
+          <leafValues>
+            3.7259110808372498e-01 -5.9072919189929962e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 729 4.4124510139226913e-02</internalNodes>
+          <leafValues>
+            7.8904099762439728e-02 -2.5528541207313538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 730 4.2540309950709343e-03</internalNodes>
+          <leafValues>
+            -2.3612380027770996e-01 1.2856779992580414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 731 -1.0833570268005133e-03</internalNodes>
+          <leafValues>
+            1.4347310364246368e-01 -1.4203630387783051e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 732 5.9925230743829161e-05</internalNodes>
+          <leafValues>
+            -1.9927270710468292e-01 8.8502913713455200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 733 -7.3021486401557922e-02</internalNodes>
+          <leafValues>
+            -8.0666261911392212e-01 3.2041858881711960e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 734 7.9495050013065338e-03</internalNodes>
+          <leafValues>
+            -6.5878443419933319e-02 2.7071261405944824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 735 -3.3911041100509465e-04</internalNodes>
+          <leafValues>
+            1.3490739464759827e-01 -1.3354760408401489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 736 -2.6010179892182350e-02</internalNodes>
+          <leafValues>
+            -2.8074580430984497e-01 7.7902659773826599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 737 -3.1153090298175812e-02</internalNodes>
+          <leafValues>
+            2.7022659778594971e-01 -2.6994340121746063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 738 1.0946249589323997e-02</internalNodes>
+          <leafValues>
+            -1.5993720293045044e-01 1.0350699722766876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 739 7.3101207613945007e-02</internalNodes>
+          <leafValues>
+            -4.1365791112184525e-03 5.2339828014373779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 740 3.0207149684429169e-02</internalNodes>
+          <leafValues>
+            -4.9229420721530914e-02 4.2848989367485046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 741 6.4985260367393494e-02</internalNodes>
+          <leafValues>
+            3.9118612185120583e-03 -1.0003379583358765e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 742 -2.9119249433279037e-02</internalNodes>
+          <leafValues>
+            -7.7025991678237915e-01 2.3930810391902924e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 743 5.0458308309316635e-02</internalNodes>
+          <leafValues>
+            6.9283558987081051e-03 -5.1854777336120605e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 744 -3.8890179246664047e-02</internalNodes>
+          <leafValues>
+            -4.8176848888397217e-01 3.0270289629697800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 745 5.8319371193647385e-02</internalNodes>
+          <leafValues>
+            -2.2101389244198799e-02 2.8393501043319702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 746 -1.0803690180182457e-02</internalNodes>
+          <leafValues>
+            1.2842060625553131e-01 -1.3849779963493347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 747 9.4525264576077461e-03</internalNodes>
+          <leafValues>
+            -5.7194419205188751e-02 1.7759050428867340e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 748 1.5229170210659504e-02</internalNodes>
+          <leafValues>
+            1.0501170158386230e-01 -2.0518389344215393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 749 -8.9435698464512825e-04</internalNodes>
+          <leafValues>
+            6.8668253719806671e-02 -1.4666010439395905e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 750 -1.8322499468922615e-02</internalNodes>
+          <leafValues>
+            -2.3613719642162323e-01 8.3538331091403961e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 751 2.5474189314991236e-03</internalNodes>
+          <leafValues>
+            -8.4731526672840118e-02 1.7211520671844482e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 752 -1.4951790217310190e-03</internalNodes>
+          <leafValues>
+            1.8642990291118622e-01 -1.2753330171108246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 753 2.4796150624752045e-02</internalNodes>
+          <leafValues>
+            3.2923560589551926e-02 -4.0954729914665222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 754 -2.8976860921829939e-03</internalNodes>
+          <leafValues>
+            1.4480039477348328e-01 -1.0404679924249649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 755 7.0361169055104256e-03</internalNodes>
+          <leafValues>
+            -6.7916557192802429e-02 2.1544350683689117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 756 -1.1870389804244041e-02</internalNodes>
+          <leafValues>
+            -2.5537449121475220e-01 7.4443407356739044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 757 2.4765899870544672e-03</internalNodes>
+          <leafValues>
+            6.8313367664813995e-02 -1.6111320257186890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 758 2.1284550428390503e-02</internalNodes>
+          <leafValues>
+            3.7090871483087540e-02 -4.6916520595550537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 759 -1.0369479656219482e-02</internalNodes>
+          <leafValues>
+            1.0807839781045914e-01 -6.0489870607852936e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 760 1.0732480324804783e-02</internalNodes>
+          <leafValues>
+            -5.8582380414009094e-02 3.1958609819412231e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 761 -2.3235160112380981e-01</internalNodes>
+          <leafValues>
+            -1. 8.2511743530631065e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 762 -6.0572529037017375e-05</internalNodes>
+          <leafValues>
+            8.0201767385005951e-02 -2.3583050072193146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 763 -2.7367009315639734e-03</internalNodes>
+          <leafValues>
+            1.5369090437889099e-01 -7.8800879418849945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 764 3.1168010085821152e-02</internalNodes>
+          <leafValues>
+            -4.1852951049804688e-02 3.7374469637870789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 765 4.5415129512548447e-02</internalNodes>
+          <leafValues>
+            6.6594500094652176e-03 -9.9975287914276123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 766 -1.3742819428443909e-03</internalNodes>
+          <leafValues>
+            1.0587850213050842e-01 -1.9234779477119446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 767 3.0089360661804676e-03</internalNodes>
+          <leafValues>
+            9.4038642942905426e-02 -1.5442730486392975e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 768 -7.1071386337280273e-02</internalNodes>
+          <leafValues>
+            -5.4955267906188965e-01 2.5523129850625992e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 769 1.0958979837596416e-03</internalNodes>
+          <leafValues>
+            -6.1327658593654633e-02 5.7677619159221649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 770 -2.3706799373030663e-02</internalNodes>
+          <leafValues>
+            2.9486098885536194e-01 -6.6553473472595215e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 771 6.8882037885487080e-03</internalNodes>
+          <leafValues>
+            7.3861703276634216e-02 -2.5727730989456177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 772 -4.9158040434122086e-02</internalNodes>
+          <leafValues>
+            3.2406309247016907e-01 -5.2785839885473251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 773 7.1369417011737823e-02</internalNodes>
+          <leafValues>
+            1.3209920376539230e-02 -7.4821132421493530e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 774 -8.4517486393451691e-03</internalNodes>
+          <leafValues>
+            -2.0652799308300018e-01 9.3139596283435822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 775 -1.5554410219192505e-01</internalNodes>
+          <leafValues>
+            -5.0736141204833984e-01 1.1575420387089252e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 776 -4.5976821333169937e-02</internalNodes>
+          <leafValues>
+            3.3433321118354797e-01 -5.6558281183242798e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 777 1.7900219187140465e-02</internalNodes>
+          <leafValues>
+            3.4091990441083908e-02 -2.8565031290054321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 778 6.7351139150559902e-03</internalNodes>
+          <leafValues>
+            -6.6538818180561066e-02 2.3322120308876038e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 779 6.4544100314378738e-03</internalNodes>
+          <leafValues>
+            4.7224499285221100e-02 -1.4422370493412018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 780 -1.1029049754142761e-02</internalNodes>
+          <leafValues>
+            -2.6442399621009827e-01 6.2542691826820374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 781 -3.3727919217199087e-03</internalNodes>
+          <leafValues>
+            1.2575919926166534e-01 -6.8357646465301514e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 782 -2.2960419300943613e-03</internalNodes>
+          <leafValues>
+            -1.5573309361934662e-01 9.4681970775127411e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 783 -7.9503163695335388e-02</internalNodes>
+          <leafValues>
+            -3.8246139883995056e-01 1.7201259732246399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 784 -2.5240880250930786e-01</internalNodes>
+          <leafValues>
+            3.0139809846878052e-01 -5.8942809700965881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 785 3.6313079297542572e-02</internalNodes>
+          <leafValues>
+            2.1105870604515076e-02 -2.0811690390110016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 786 6.8737521767616272e-02</internalNodes>
+          <leafValues>
+            -3.2400298863649368e-02 5.1345300674438477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 787 -2.1814550459384918e-01</internalNodes>
+          <leafValues>
+            -7.0093291997909546e-01 1.6260979697108269e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 788 -1.9770899415016174e-01</internalNodes>
+          <leafValues>
+            -6.7817360162734985e-01 1.7937550321221352e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 789 -1.0131119936704636e-01</internalNodes>
+          <leafValues>
+            3.6470630764961243e-01 -4.9969438463449478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 790 5.4146698676049709e-03</internalNodes>
+          <leafValues>
+            6.6086590290069580e-02 -2.3327399790287018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 791 -4.0590178221464157e-02</internalNodes>
+          <leafValues>
+            2.1464720368385315e-01 -4.3033309280872345e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 792 -1.3324919855222106e-03</internalNodes>
+          <leafValues>
+            1.2975679337978363e-01 -1.2794280052185059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 793 5.7570589706301689e-03</internalNodes>
+          <leafValues>
+            4.3469998985528946e-02 -1.1977300047874451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 794 -4.0872758254408836e-03</internalNodes>
+          <leafValues>
+            -2.0180100202560425e-01 9.2624872922897339e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 795 2.1345280110836029e-02</internalNodes>
+          <leafValues>
+            -2.6310870423913002e-02 2.9142528772354126e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 796 -2.4241849314421415e-03</internalNodes>
+          <leafValues>
+            1.7131569981575012e-01 -1.1723010241985321e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 797 6.0677550733089447e-02</internalNodes>
+          <leafValues>
+            -4.8347217962145805e-03 5.6577122211456299e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 798 3.1573011074215174e-04</internalNodes>
+          <leafValues>
+            -1.1499550193548203e-01 1.3094860315322876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 799 -1.4639530563727021e-03</internalNodes>
+          <leafValues>
+            1.0708429664373398e-01 -8.2188747823238373e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 800 -8.1629276275634766e-02</internalNodes>
+          <leafValues>
+            -7.0090162754058838e-01 2.1318640559911728e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 801 -2.2923630604054779e-04</internalNodes>
+          <leafValues>
+            5.2449010312557220e-02 -5.7273399084806442e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 802 8.6732655763626099e-03</internalNodes>
+          <leafValues>
+            -1.0944409668445587e-01 1.4530800282955170e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 803 -9.5603411318734288e-04</internalNodes>
+          <leafValues>
+            5.4728660732507706e-02 -7.6677009463310242e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 804 -5.6814689189195633e-02</internalNodes>
+          <leafValues>
+            -7.2493737936019897e-01 1.7791330814361572e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 805 6.4268838614225388e-03</internalNodes>
+          <leafValues>
+            -3.7768699228763580e-02 8.3454750478267670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 806 5.2451258525252342e-03</internalNodes>
+          <leafValues>
+            -7.5806751847267151e-02 2.1549069881439209e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 807 6.7577441222965717e-03</internalNodes>
+          <leafValues>
+            7.7163867652416229e-02 -2.4957199394702911e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 808 -5.7494179345667362e-03</internalNodes>
+          <leafValues>
+            1.4245559275150299e-01 -1.2740920484066010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 809 -6.7760650999844074e-03</internalNodes>
+          <leafValues>
+            -2.3316009342670441e-01 3.9975211024284363e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 810 3.5247279447503388e-04</internalNodes>
+          <leafValues>
+            -1.3083159923553467e-01 1.1577410250902176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 811 1.4523849822580814e-03</internalNodes>
+          <leafValues>
+            -9.2724457383155823e-02 6.5486960113048553e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>80</maxWeakCount>
+      <stageThreshold>-7.2322398424148560e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 812 -3.1163799762725830e-01</internalNodes>
+          <leafValues>
+            3.8062000274658203e-01 -1.1115840077400208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 813 -3.0338248610496521e-01</internalNodes>
+          <leafValues>
+            5.1236808300018311e-01 -5.0459731370210648e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 814 -1.0945170186460018e-02</internalNodes>
+          <leafValues>
+            -2.2292029857635498e-01 1.0548099875450134e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 815 -2.8011079877614975e-02</internalNodes>
+          <leafValues>
+            7.0687793195247650e-02 -8.6478509008884430e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 816 -5.2256159484386444e-02</internalNodes>
+          <leafValues>
+            5.7856267690658569e-01 -8.7944902479648590e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 817 -5.9455442242324352e-03</internalNodes>
+          <leafValues>
+            -2.5641980767250061e-01 9.4584532082080841e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 818 2.5594399776309729e-03</internalNodes>
+          <leafValues>
+            -2.5718480348587036e-01 1.2882429361343384e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 819 -1.2099260091781616e-01</internalNodes>
+          <leafValues>
+            -1.2293220311403275e-01 2.5829430669546127e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 820 -4.4208219647407532e-01</internalNodes>
+          <leafValues>
+            -7.4546551704406738e-01 4.2586710304021835e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 821 -6.6842641681432724e-03</internalNodes>
+          <leafValues>
+            1.3515649735927582e-01 -1.6409300267696381e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 822 9.8270708695054054e-03</internalNodes>
+          <leafValues>
+            -8.0305352807044983e-02 2.9853299260139465e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 823 5.8638598769903183e-02</internalNodes>
+          <leafValues>
+            2.7556419372558594e-02 -8.2242500782012939e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 824 -3.0546959023922682e-03</internalNodes>
+          <leafValues>
+            -1.9292749464511871e-01 1.1082729697227478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 825 -7.3340102098882198e-03</internalNodes>
+          <leafValues>
+            -2.4307939410209656e-01 6.6744603216648102e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 826 -1.0526229627430439e-02</internalNodes>
+          <leafValues>
+            -3.1136021018028259e-01 6.2850847840309143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 827 1.0481160134077072e-01</internalNodes>
+          <leafValues>
+            1.2621720321476460e-02 -6.7376089096069336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 828 9.4269379042088985e-04</internalNodes>
+          <leafValues>
+            -1.7071670293807983e-01 1.0280650109052658e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 829 8.4397383034229279e-03</internalNodes>
+          <leafValues>
+            -5.3014568984508514e-02 8.8599078357219696e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 830 -3.0551670119166374e-02</internalNodes>
+          <leafValues>
+            3.5264891386032104e-01 -6.9148473441600800e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 831 -4.9112379550933838e-02</internalNodes>
+          <leafValues>
+            -5.8219379186630249e-01 1.4043220318853855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 832 5.8098030276596546e-03</internalNodes>
+          <leafValues>
+            7.0872433483600616e-02 -2.5362819433212280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 833 2.5541070848703384e-02</internalNodes>
+          <leafValues>
+            -4.5136939734220505e-02 4.0674450993537903e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 834 -4.8711288720369339e-02</internalNodes>
+          <leafValues>
+            -7.0240157842636108e-01 2.4317869916558266e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 835 -3.2624390721321106e-01</internalNodes>
+          <leafValues>
+            -5.0619047880172729e-01 5.5445302277803421e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 836 -1.8120040476787835e-04</internalNodes>
+          <leafValues>
+            1.3132590055465698e-01 -1.2139549851417542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 837 -1.2980769574642181e-01</internalNodes>
+          <leafValues>
+            -6.8208992481231689e-01 1.6414549201726913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 838 8.3528067916631699e-03</internalNodes>
+          <leafValues>
+            3.0040390789508820e-02 -5.0909137725830078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 839 5.4547088220715523e-03</internalNodes>
+          <leafValues>
+            -8.2402072846889496e-02 1.8007980287075043e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 840 -3.1699541211128235e-01</internalNodes>
+          <leafValues>
+            -8.6613011360168457e-01 1.8229139968752861e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 841 5.8424862800166011e-04</internalNodes>
+          <leafValues>
+            4.2409729212522507e-02 -1.3118089735507965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 842 -9.7046848386526108e-03</internalNodes>
+          <leafValues>
+            -2.7432689070701599e-01 5.5920429527759552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 843 1.6834320500493050e-02</internalNodes>
+          <leafValues>
+            -8.3306416869163513e-02 6.7792758345603943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 844 -3.0685380101203918e-02</internalNodes>
+          <leafValues>
+            4.2126908898353577e-01 -4.5339331030845642e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 845 4.1394919157028198e-02</internalNodes>
+          <leafValues>
+            1.9971750676631927e-02 -1.9722190499305725e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 846 3.4910149872303009e-02</internalNodes>
+          <leafValues>
+            -5.3826879709959030e-02 3.5040271282196045e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 847 -5.2495039999485016e-03</internalNodes>
+          <leafValues>
+            -1.1363890022039413e-01 5.5080570280551910e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 848 1.2045619636774063e-01</internalNodes>
+          <leafValues>
+            1.7451599240303040e-02 -9.3958032131195068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 849 4.2130421847105026e-02</internalNodes>
+          <leafValues>
+            -1.4343280345201492e-02 6.0059851408004761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 850 1.9120849668979645e-02</internalNodes>
+          <leafValues>
+            8.5864506661891937e-02 -1.8586499989032745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 851 8.4470612928271294e-03</internalNodes>
+          <leafValues>
+            -6.9452181458473206e-02 7.3461420834064484e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 852 1.7696130089461803e-03</internalNodes>
+          <leafValues>
+            -7.9996660351753235e-02 1.9479809701442719e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 853 5.7995948940515518e-02</internalNodes>
+          <leafValues>
+            2.7633000165224075e-02 -5.4097008705139160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 854 -7.9884022474288940e-02</internalNodes>
+          <leafValues>
+            -5.4307681322097778e-01 2.3219829425215721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 855 6.6576242446899414e-02</internalNodes>
+          <leafValues>
+            6.8416809663176537e-03 -8.1224560737609863e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 856 6.4169943332672119e-02</internalNodes>
+          <leafValues>
+            -2.4846689775586128e-02 6.0798132419586182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 857 -2.9404780268669128e-01</internalNodes>
+          <leafValues>
+            -1. 4.6440181322395802e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 858 -9.5727723091840744e-03</internalNodes>
+          <leafValues>
+            -1.4157359302043915e-01 1.0121650248765945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 859 -2.3574449121952057e-02</internalNodes>
+          <leafValues>
+            1.1715450137853622e-01 -1.3184690475463867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 860 -5.1256217993795872e-03</internalNodes>
+          <leafValues>
+            -1.7623250186443329e-01 1.0177359730005264e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 861 9.7663059830665588e-02</internalNodes>
+          <leafValues>
+            4.4896239414811134e-03 -8.0415552854537964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 862 3.2088689506053925e-02</internalNodes>
+          <leafValues>
+            -5.8048430830240250e-02 3.0194890499114990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 863 -8.6517207324504852e-02</internalNodes>
+          <leafValues>
+            -7.5529891252517700e-01 2.8089359402656555e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 864 -2.8540970757603645e-02</internalNodes>
+          <leafValues>
+            -3.5085019469261169e-01 4.4081591069698334e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 865 -5.3844689391553402e-03</internalNodes>
+          <leafValues>
+            9.2348903417587280e-02 -7.0033848285675049e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 866 -2.2280439734458923e-02</internalNodes>
+          <leafValues>
+            2.4949419498443604e-01 -7.0658676326274872e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 867 5.1025422289967537e-03</internalNodes>
+          <leafValues>
+            6.0899689793586731e-02 -1.5473949909210205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 868 3.7133800797164440e-03</internalNodes>
+          <leafValues>
+            -8.7124302983283997e-02 1.7195260524749756e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 869 -4.0405280888080597e-03</internalNodes>
+          <leafValues>
+            1.5054519474506378e-01 -9.9685050547122955e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 870 4.8944901674985886e-02</internalNodes>
+          <leafValues>
+            2.0637780427932739e-02 -7.1113997697830200e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 871 -4.0832208469510078e-03</internalNodes>
+          <leafValues>
+            -1.6104909777641296e-01 8.8675007224082947e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 872 -2.2145630791783333e-03</internalNodes>
+          <leafValues>
+            -2.1901540458202362e-01 1.0045240074396133e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 873 -6.4257450401782990e-02</internalNodes>
+          <leafValues>
+            -5.7694709300994873e-01 1.0253880172967911e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 874 1.1895420029759407e-02</internalNodes>
+          <leafValues>
+            -7.0560596883296967e-02 2.6147291064262390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 875 -4.4988259673118591e-02</internalNodes>
+          <leafValues>
+            -6.8440282344818115e-01 9.9674779921770096e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 876 6.3484339043498039e-03</internalNodes>
+          <leafValues>
+            8.4738656878471375e-02 -1.6299989819526672e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 877 -5.6587439030408859e-02</internalNodes>
+          <leafValues>
+            4.8960050940513611e-01 -1.9641140475869179e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 878 3.5853400826454163e-02</internalNodes>
+          <leafValues>
+            1.9695440307259560e-02 -6.8108338117599487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 879 -4.5450981706380844e-03</internalNodes>
+          <leafValues>
+            6.9072656333446503e-02 -9.1276638209819794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 880 1.0608570277690887e-01</internalNodes>
+          <leafValues>
+            -4.9993991851806641e-02 3.2139471173286438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 881 -4.5924410223960876e-02</internalNodes>
+          <leafValues>
+            -8.2744181156158447e-01 1.2149419635534286e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 882 -1.2273239903151989e-02</internalNodes>
+          <leafValues>
+            -3.0669289827346802e-01 5.1693398505449295e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 883 8.0667391419410706e-02</internalNodes>
+          <leafValues>
+            2.1730009466409683e-03 -1.0002529621124268e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 884 -2.3044859990477562e-02</internalNodes>
+          <leafValues>
+            4.5085349678993225e-01 -3.6273978650569916e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 885 1.8702909350395203e-02</internalNodes>
+          <leafValues>
+            4.6945460140705109e-02 -2.1796269714832306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 886 -9.6820026636123657e-02</internalNodes>
+          <leafValues>
+            4.0398910641670227e-01 -3.7819091230630875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 887 6.0525789856910706e-02</internalNodes>
+          <leafValues>
+            1.5727160498499870e-02 -4.5661678910255432e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 888 1.0418569669127464e-02</internalNodes>
+          <leafValues>
+            6.2726646661758423e-02 -2.4441179633140564e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 889 1.0726209729909897e-02</internalNodes>
+          <leafValues>
+            -7.1968853473663330e-02 2.2099970281124115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 890 -2.7160700410604477e-03</internalNodes>
+          <leafValues>
+            1.2882749736309052e-01 -1.4629630744457245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 891 8.5867568850517273e-03</internalNodes>
+          <leafValues>
+            -6.8645663559436798e-02 2.5840589404106140e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>103</maxWeakCount>
+      <stageThreshold>-7.6886308193206787e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 892 -2.5851670652627945e-02</internalNodes>
+          <leafValues>
+            1.8011799454689026e-01 -2.4745930731296539e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 893 1.4054620265960693e-01</internalNodes>
+          <leafValues>
+            -5.1319289952516556e-02 4.0766909718513489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 894 -2.7255079150199890e-01</internalNodes>
+          <leafValues>
+            4.9941259622573853e-01 -4.5033931732177734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 895 1.3978329952806234e-03</internalNodes>
+          <leafValues>
+            5.3600508719682693e-02 -2.1793389320373535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 896 -3.5059880465269089e-02</internalNodes>
+          <leafValues>
+            -2.9943290352821350e-01 8.9991323649883270e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 897 -3.2894399482756853e-03</internalNodes>
+          <leafValues>
+            1.0264199972152710e-01 -9.4711251556873322e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 898 1.8242290616035461e-01</internalNodes>
+          <leafValues>
+            2.5626670569181442e-02 -6.8765729665756226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 899 -7.8741081058979034e-02</internalNodes>
+          <leafValues>
+            1.0810419917106628e-01 -1.4497520029544830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 900 1.3945129700005054e-02</internalNodes>
+          <leafValues>
+            -7.1371912956237793e-02 3.1315749883651733e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 901 4.4680278748273849e-02</internalNodes>
+          <leafValues>
+            -3.0446149408817291e-02 3.9263629913330078e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 902 -2.6441770605742931e-03</internalNodes>
+          <leafValues>
+            1.1596699804067612e-01 -1.7800450325012207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 903 -5.1071979105472565e-03</internalNodes>
+          <leafValues>
+            -1.1739940196275711e-01 6.7823447287082672e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 904 -3.2582178711891174e-02</internalNodes>
+          <leafValues>
+            -5.9129017591476440e-01 3.3352021127939224e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 905 -2.7755839750170708e-02</internalNodes>
+          <leafValues>
+            -7.0649361610412598e-01 1.6761489212512970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 906 -6.0038521041860804e-05</internalNodes>
+          <leafValues>
+            7.3832668364048004e-02 -2.2933359444141388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 907 3.0506180599331856e-02</internalNodes>
+          <leafValues>
+            -3.8056060671806335e-02 4.4115358591079712e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 908 -6.2056961469352245e-03</internalNodes>
+          <leafValues>
+            -1.7757239937782288e-01 9.3707472085952759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 909 -8.0766230821609497e-03</internalNodes>
+          <leafValues>
+            -2.0256699621677399e-01 7.4059642851352692e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 910 -3.3209908753633499e-02</internalNodes>
+          <leafValues>
+            4.6372228860855103e-01 -3.4903008490800858e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 911 3.5530608147382736e-02</internalNodes>
+          <leafValues>
+            -3.1679518520832062e-02 4.5202499628067017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 912 1.6297640278935432e-02</internalNodes>
+          <leafValues>
+            4.4189039617776871e-02 -3.4845370054244995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 913 9.9985357373952866e-03</internalNodes>
+          <leafValues>
+            -4.8255320638418198e-02 1.6078050434589386e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 914 -5.2390778437256813e-03</internalNodes>
+          <leafValues>
+            2.3236599564552307e-01 -7.6032742857933044e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 915 -3.2508899457752705e-03</internalNodes>
+          <leafValues>
+            5.4369390010833740e-02 -9.1040253639221191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 916 5.5640790611505508e-02</internalNodes>
+          <leafValues>
+            -3.8811128586530685e-02 4.2034021019935608e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 917 3.3998981118202209e-02</internalNodes>
+          <leafValues>
+            2.2251330316066742e-02 -3.5615360736846924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 918 -4.3103890493512154e-03</internalNodes>
+          <leafValues>
+            1.1287429928779602e-01 -1.7630730569362640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 919 -7.9246461391448975e-03</internalNodes>
+          <leafValues>
+            -1.0992339998483658e-01 3.5099629312753677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 920 4.4273380190134048e-02</internalNodes>
+          <leafValues>
+            2.8094569221138954e-02 -6.0921418666839600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 921 5.9907328337430954e-02</internalNodes>
+          <leafValues>
+            9.7544339951127768e-04 -9.0523207187652588e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 922 3.3378869295120239e-02</internalNodes>
+          <leafValues>
+            1.7723279073834419e-02 -8.5254609584808350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 923 1.4694170095026493e-02</internalNodes>
+          <leafValues>
+            -4.9031510949134827e-02 2.7998331189155579e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 924 -5.3877499885857105e-03</internalNodes>
+          <leafValues>
+            1.8219049274921417e-01 -8.2382522523403168e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 925 -1.7976889386773109e-02</internalNodes>
+          <leafValues>
+            -1.9384689629077911e-01 8.4984757006168365e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 926 -4.4651641510426998e-03</internalNodes>
+          <leafValues>
+            1.7632910609245300e-01 -9.5075771212577820e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 927 6.9372296333312988e-02</internalNodes>
+          <leafValues>
+            3.1770321074873209e-03 -6.7554402351379395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 928 -1.7002269625663757e-02</internalNodes>
+          <leafValues>
+            -3.3827948570251465e-01 4.4731728732585907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 929 1.7274240031838417e-02</internalNodes>
+          <leafValues>
+            -2.4769710376858711e-02 1.1852029711008072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 930 4.0388729423284531e-02</internalNodes>
+          <leafValues>
+            -3.2967679202556610e-02 4.7323140501976013e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 931 1.4215400442481041e-02</internalNodes>
+          <leafValues>
+            2.9846860095858574e-02 -4.4157060980796814e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 932 4.1627719998359680e-02</internalNodes>
+          <leafValues>
+            -4.5953918248414993e-02 3.2978388667106628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 933 -1.7416840419173241e-03</internalNodes>
+          <leafValues>
+            8.7286308407783508e-02 -8.8862203061580658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 934 -9.8077040165662766e-03</internalNodes>
+          <leafValues>
+            -2.1026679873466492e-01 7.7401876449584961e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 935 2.1836649626493454e-02</internalNodes>
+          <leafValues>
+            4.3211769312620163e-02 -1.5330420434474945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 936 -7.0743098855018616e-02</internalNodes>
+          <leafValues>
+            3.3019039034843445e-01 -5.2747949957847595e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 937 -1.1181020177900791e-02</internalNodes>
+          <leafValues>
+            -1.1493939906358719e-01 2.7858460322022438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 938 -1.4623560011386871e-02</internalNodes>
+          <leafValues>
+            3.2327070832252502e-01 -4.4166058301925659e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 939 -9.6702557057142258e-03</internalNodes>
+          <leafValues>
+            -1.8157319724559784e-01 3.6154530942440033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 940 8.3439601585268974e-03</internalNodes>
+          <leafValues>
+            -5.2473910152912140e-02 2.7444839477539062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 941 2.2970559075474739e-02</internalNodes>
+          <leafValues>
+            3.4930050373077393e-02 -1.5773670375347137e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 942 -8.2734245806932449e-03</internalNodes>
+          <leafValues>
+            1.1612790077924728e-01 -1.1965770274400711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 943 8.7074404582381248e-03</internalNodes>
+          <leafValues>
+            -4.0829788893461227e-02 1.0481330007314682e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 944 -1.8825819715857506e-02</internalNodes>
+          <leafValues>
+            -3.8794550299644470e-01 4.7350700944662094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 945 -7.2092940099537373e-03</internalNodes>
+          <leafValues>
+            -1.9886960089206696e-01 7.5952850282192230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 946 1.6543369565624744e-04</internalNodes>
+          <leafValues>
+            -1.0674829781055450e-01 1.5510599315166473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 947 8.9294537901878357e-03</internalNodes>
+          <leafValues>
+            -6.7059643566608429e-02 9.0206786990165710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 948 3.1991640571504831e-03</internalNodes>
+          <leafValues>
+            7.4445746839046478e-02 -1.9682839512825012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 949 -1.1280879698460922e-04</internalNodes>
+          <leafValues>
+            7.9703390598297119e-02 -1.3661189377307892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 950 -6.9613799452781677e-02</internalNodes>
+          <leafValues>
+            -2.1010529994964600e-01 6.5771616995334625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 951 -2.6066679507493973e-02</internalNodes>
+          <leafValues>
+            2.8696510195732117e-01 -5.7495791465044022e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 952 1.2050740420818329e-02</internalNodes>
+          <leafValues>
+            -4.6820510178804398e-02 2.7994769811630249e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 953 -3.9625849574804306e-02</internalNodes>
+          <leafValues>
+            -3.7054508924484253e-01 1.1476139537990093e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 954 -2.7379901148378849e-03</internalNodes>
+          <leafValues>
+            9.4371132552623749e-02 -1.6203230619430542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 955 -6.5262563526630402e-02</internalNodes>
+          <leafValues>
+            -6.7808389663696289e-01 1.9430469721555710e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 956 2.3191619664430618e-02</internalNodes>
+          <leafValues>
+            2.6134310290217400e-02 -4.6664249897003174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 957 4.7741930931806564e-02</internalNodes>
+          <leafValues>
+            -2.5291189551353455e-02 2.9092490673065186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 958 -1.2830020487308502e-01</internalNodes>
+          <leafValues>
+            -8.7187117338180542e-01 1.3883540406823158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 959 -4.2689260095357895e-02</internalNodes>
+          <leafValues>
+            -6.7644822597503662e-01 6.8771280348300934e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 960 6.2811248935759068e-03</internalNodes>
+          <leafValues>
+            -6.4803749322891235e-02 2.0994420349597931e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 961 2.7532080188393593e-02</internalNodes>
+          <leafValues>
+            1.5366540290415287e-02 -2.1457369625568390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 962 -3.4494648571126163e-04</internalNodes>
+          <leafValues>
+            1.1829499900341034e-01 -1.0641119629144669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 963 -3.2187011092901230e-02</internalNodes>
+          <leafValues>
+            2.0676319301128387e-01 -2.7804749086499214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 964 -2.4451729841530323e-03</internalNodes>
+          <leafValues>
+            -1.8970219790935516e-01 7.6612837612628937e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 965 3.9631120860576630e-02</internalNodes>
+          <leafValues>
+            1.1457280255854130e-02 -4.4112280011177063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 966 -9.0082110837101936e-03</internalNodes>
+          <leafValues>
+            -2.0329099893569946e-01 7.1997888386249542e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 967 -6.0594908893108368e-02</internalNodes>
+          <leafValues>
+            2.5831830501556396e-01 -3.2274000346660614e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 968 3.3678639680147171e-02</internalNodes>
+          <leafValues>
+            3.6565639078617096e-02 -3.3233150839805603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 969 1.4565410092473030e-02</internalNodes>
+          <leafValues>
+            -4.9269210547208786e-02 1.8280670046806335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 970 4.0103439241647720e-03</internalNodes>
+          <leafValues>
+            -1.2435600161552429e-01 1.1247640103101730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 971 1.7989509506151080e-03</internalNodes>
+          <leafValues>
+            -5.4675988852977753e-02 1.0701840370893478e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 972 -1.6359580331481993e-04</internalNodes>
+          <leafValues>
+            8.1755228340625763e-02 -1.6235500574111938e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 973 -3.1993899494409561e-02</internalNodes>
+          <leafValues>
+            1.8631230294704437e-01 -1.7350630834698677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 974 -8.1737667322158813e-02</internalNodes>
+          <leafValues>
+            -7.5961482524871826e-01 1.4419900253415108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 975 -8.8262550532817841e-02</internalNodes>
+          <leafValues>
+            -1. 5.3146481513977051e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 976 -5.7997900992631912e-02</internalNodes>
+          <leafValues>
+            -8.9391511678695679e-01 1.2495099566876888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 977 2.0691409707069397e-02</internalNodes>
+          <leafValues>
+            -3.7167508155107498e-02 9.7208552062511444e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 978 -6.0336058959364891e-03</internalNodes>
+          <leafValues>
+            1.7547790706157684e-01 -8.6916856467723846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 979 1.5789760649204254e-01</internalNodes>
+          <leafValues>
+            3.0604960396885872e-02 -2.2199299931526184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 980 3.3271119464188814e-03</internalNodes>
+          <leafValues>
+            1.1201520264148712e-01 -1.6384710371494293e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 981 1.1383239924907684e-01</internalNodes>
+          <leafValues>
+            1.8078039865940809e-03 -9.9981439113616943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 982 3.9188969880342484e-02</internalNodes>
+          <leafValues>
+            -3.9494428783655167e-02 3.4139481186866760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 983 -4.7382968477904797e-03</internalNodes>
+          <leafValues>
+            -8.1601403653621674e-02 3.5498451441526413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 984 2.3458160459995270e-02</internalNodes>
+          <leafValues>
+            -4.0767479687929153e-02 3.4792768955230713e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 985 1.6505220904946327e-02</internalNodes>
+          <leafValues>
+            2.0170280709862709e-02 -1.5532009303569794e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 986 2.0262949168682098e-02</internalNodes>
+          <leafValues>
+            2.1292379125952721e-02 -6.2611502408981323e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 987 -9.1393236070871353e-03</internalNodes>
+          <leafValues>
+            -1.3637480139732361e-01 6.3891842961311340e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 988 -5.6207980960607529e-02</internalNodes>
+          <leafValues>
+            4.0671119093894958e-01 -3.3258218318223953e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 989 6.6868839785456657e-03</internalNodes>
+          <leafValues>
+            6.4174309372901917e-02 -9.3966238200664520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 990 5.8862278237938881e-03</internalNodes>
+          <leafValues>
+            -6.5789960324764252e-02 2.0181339979171753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 991 -1.1517380177974701e-01</internalNodes>
+          <leafValues>
+            -1. 2.5347759947180748e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 992 5.5793710052967072e-03</internalNodes>
+          <leafValues>
+            7.0642203092575073e-02 -1.9637429714202881e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 993 3.2180000096559525e-02</internalNodes>
+          <leafValues>
+            -1.4737719669938087e-02 2.2420160472393036e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 994 -9.1598782455548644e-04</internalNodes>
+          <leafValues>
+            1.1478749662637711e-01 -1.1767079681158066e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>83</maxWeakCount>
+      <stageThreshold>-7.7573090791702271e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 995 9.1346232220530510e-03</internalNodes>
+          <leafValues>
+            8.8698662817478180e-02 -3.8595649600028992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 996 -2.4696369655430317e-03</internalNodes>
+          <leafValues>
+            1.6772060096263885e-01 -1.4649170637130737e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 997 5.8935020118951797e-02</internalNodes>
+          <leafValues>
+            -1.3394000008702278e-02 6.1832672357559204e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 998 -8.9100059121847153e-03</internalNodes>
+          <leafValues>
+            -2.6950231194496155e-01 7.2939813137054443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 999 1.7743879929184914e-02</internalNodes>
+          <leafValues>
+            -5.0217188894748688e-02 4.3166020512580872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1000 1.1056650429964066e-02</internalNodes>
+          <leafValues>
+            3.9155859500169754e-02 -5.2860772609710693e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1001 1.6161320731043816e-02</internalNodes>
+          <leafValues>
+            6.9581039249897003e-02 -3.7610140442848206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1002 -2.7879089117050171e-02</internalNodes>
+          <leafValues>
+            2.3220659792423248e-01 -5.5979579687118530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1003 -1.1556839570403099e-02</internalNodes>
+          <leafValues>
+            -3.1231081485748291e-01 7.4339963495731354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1004 -6.9651477038860321e-02</internalNodes>
+          <leafValues>
+            -4.1905689239501953e-01 6.9694789126515388e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1005 -5.0344727933406830e-03</internalNodes>
+          <leafValues>
+            1.3183620572090149e-01 -1.9702030718326569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1006 -8.6098119616508484e-02</internalNodes>
+          <leafValues>
+            6.5727752447128296e-01 -9.5664570108056068e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1007 2.5546319782733917e-02</internalNodes>
+          <leafValues>
+            -4.0136341005563736e-02 5.4847037792205811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1008 -2.6870880275964737e-02</internalNodes>
+          <leafValues>
+            -2.5306650996208191e-01 4.4181719422340393e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1009 9.5859682187438011e-03</internalNodes>
+          <leafValues>
+            -8.1882461905479431e-02 2.6894670724868774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1010 2.6683809235692024e-02</internalNodes>
+          <leafValues>
+            2.6593349874019623e-02 -4.4127041101455688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1011 -1.4490840025246143e-02</internalNodes>
+          <leafValues>
+            -3.5697469115257263e-01 7.0072941482067108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1012 -2.2448399104177952e-03</internalNodes>
+          <leafValues>
+            2.0088230073451996e-01 -1.2228170037269592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1013 4.8795710317790508e-03</internalNodes>
+          <leafValues>
+            4.5820981264114380e-02 -3.9498189091682434e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1014 -6.1262990348041058e-03</internalNodes>
+          <leafValues>
+            -1.8826089799404144e-01 7.8812077641487122e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1015 1.6952969133853912e-02</internalNodes>
+          <leafValues>
+            -6.1684221029281616e-02 3.3603700995445251e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1016 -4.5547191984951496e-03</internalNodes>
+          <leafValues>
+            -1.9471390545368195e-01 5.3147189319133759e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1017 -1.2753040064126253e-03</internalNodes>
+          <leafValues>
+            1.4800879359245300e-01 -1.4244349300861359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1018 2.2060280665755272e-02</internalNodes>
+          <leafValues>
+            -3.5406738519668579e-02 3.3775308728218079e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1019 2.1050389856100082e-02</internalNodes>
+          <leafValues>
+            4.2289130389690399e-02 -4.5886451005935669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1020 9.5637209713459015e-02</internalNodes>
+          <leafValues>
+            -1.3171649537980556e-02 5.5534982681274414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1021 -3.6728319246321917e-03</internalNodes>
+          <leafValues>
+            -1.8842899799346924e-01 9.5458142459392548e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1022 1.6345079347956926e-04</internalNodes>
+          <leafValues>
+            -6.0444809496402740e-02 1.0536730289459229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1023 2.5338289141654968e-01</internalNodes>
+          <leafValues>
+            1.6026260331273079e-02 -9.9994468688964844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1024 -4.6113330870866776e-02</internalNodes>
+          <leafValues>
+            5.4247987270355225e-01 -2.7890209108591080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1025 5.2588270045816898e-03</internalNodes>
+          <leafValues>
+            7.9867303371429443e-02 -2.0700709521770477e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1026 -1.3449570536613464e-01</internalNodes>
+          <leafValues>
+            -4.1270101070404053e-01 8.1500215455889702e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1027 1.6953679732978344e-03</internalNodes>
+          <leafValues>
+            1.1035349965095520e-01 -1.6802120208740234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1028 3.9492141455411911e-02</internalNodes>
+          <leafValues>
+            -1.3410010375082493e-02 3.8447639346122742e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1029 -9.3634781660512090e-04</internalNodes>
+          <leafValues>
+            1.0986819863319397e-01 -1.7310489714145660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1030 -4.4495709240436554e-02</internalNodes>
+          <leafValues>
+            1.9471199810504913e-01 -4.0768899023532867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1031 6.0630109161138535e-02</internalNodes>
+          <leafValues>
+            -4.2252369225025177e-02 5.1412987709045410e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1032 7.5067640282213688e-03</internalNodes>
+          <leafValues>
+            4.2086970061063766e-02 -1.6080400347709656e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1033 9.9260415881872177e-03</internalNodes>
+          <leafValues>
+            6.4119532704353333e-02 -2.6215308904647827e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1034 6.0528520494699478e-02</internalNodes>
+          <leafValues>
+            2.4189969524741173e-02 -3.6608389019966125e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1035 -6.8054231815040112e-03</internalNodes>
+          <leafValues>
+            1.2508389353752136e-01 -1.3889710605144501e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1036 -2.0940289832651615e-03</internalNodes>
+          <leafValues>
+            1.3996599614620209e-01 -8.2706399261951447e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1037 -9.6904346719384193e-03</internalNodes>
+          <leafValues>
+            2.6681360602378845e-01 -7.1576990187168121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1038 1.8320349976420403e-02</internalNodes>
+          <leafValues>
+            3.1321980059146881e-02 -2.3460610210895538e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1039 5.0429959082975984e-04</internalNodes>
+          <leafValues>
+            -1.1669719964265823e-01 1.6514649987220764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1040 -4.7016288153827190e-03</internalNodes>
+          <leafValues>
+            -1.2006150186061859e-01 5.9200428426265717e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1041 -1.9926870241761208e-02</internalNodes>
+          <leafValues>
+            -3.9485099911689758e-01 4.1143018752336502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1042 7.4013080447912216e-03</internalNodes>
+          <leafValues>
+            -7.6331257820129395e-02 2.1065360307693481e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1043 1.4879629947245121e-02</internalNodes>
+          <leafValues>
+            4.7979071736335754e-02 -3.4014761447906494e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1044 1.5527559816837311e-01</internalNodes>
+          <leafValues>
+            3.2225880771875381e-02 -4.6938079595565796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1045 -7.0786331780254841e-03</internalNodes>
+          <leafValues>
+            1.2199480086565018e-01 -1.2004940211772919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1046 2.9872169718146324e-02</internalNodes>
+          <leafValues>
+            -4.3677508831024170e-02 2.3529820144176483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1047 3.0555170029401779e-02</internalNodes>
+          <leafValues>
+            3.1775880604982376e-02 -5.7825452089309692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1048 1.0284570045769215e-02</internalNodes>
+          <leafValues>
+            4.7202810645103455e-02 -2.9566499590873718e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1049 1.9808709621429443e-02</internalNodes>
+          <leafValues>
+            -4.5775938779115677e-02 3.3231019973754883e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1050 2.7218880131840706e-02</internalNodes>
+          <leafValues>
+            2.5577219203114510e-02 -3.3180880546569824e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1051 1.4097680337727070e-02</internalNodes>
+          <leafValues>
+            5.2157420665025711e-02 -2.9358381032943726e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1052 2.4286569654941559e-01</internalNodes>
+          <leafValues>
+            1.4692460186779499e-02 -6.9854879379272461e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1053 1.2419570237398148e-02</internalNodes>
+          <leafValues>
+            -4.7105878591537476e-02 3.6695051193237305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1054 1.3503880472853780e-03</internalNodes>
+          <leafValues>
+            5.3791359066963196e-02 -2.0953659713268280e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1055 -1.5626290813088417e-02</internalNodes>
+          <leafValues>
+            2.7888458967208862e-01 -6.0053750872612000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1056 1.5850139781832695e-02</internalNodes>
+          <leafValues>
+            -3.0324909836053848e-02 1.0287520289421082e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1057 -4.0868919342756271e-02</internalNodes>
+          <leafValues>
+            -8.0402207374572754e-01 1.7601499333977699e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1058 6.4108639955520630e-02</internalNodes>
+          <leafValues>
+            2.5845379568636417e-03 -5.3854942321777344e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1059 4.9927100539207458e-02</internalNodes>
+          <leafValues>
+            2.1863300353288651e-02 -6.1780720949172974e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1060 1.4655419625341892e-02</internalNodes>
+          <leafValues>
+            1.9663369283080101e-02 -2.0426170527935028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1061 -2.4094810709357262e-02</internalNodes>
+          <leafValues>
+            3.7609130144119263e-01 -4.0954101830720901e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1062 2.9417769983410835e-02</internalNodes>
+          <leafValues>
+            -8.6903842166066170e-03 4.0447419881820679e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1063 -1.4158640056848526e-02</internalNodes>
+          <leafValues>
+            3.7811711430549622e-01 -4.0321640670299530e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1064 -4.6754989773035049e-02</internalNodes>
+          <leafValues>
+            2.2104309499263763e-01 -2.8996109962463379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1065 -1.1437949724495411e-02</internalNodes>
+          <leafValues>
+            -2.5033089518547058e-01 5.8214288204908371e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1066 -4.2598780244588852e-02</internalNodes>
+          <leafValues>
+            3.7562200427055359e-01 -1.6349090263247490e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1067 -1.5201159752905369e-02</internalNodes>
+          <leafValues>
+            -3.5637819766998291e-01 3.8690369576215744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1068 4.3378848582506180e-02</internalNodes>
+          <leafValues>
+            3.3045639283955097e-03 -4.6729469299316406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1069 5.5153011344373226e-03</internalNodes>
+          <leafValues>
+            -8.3583608269691467e-02 1.8793170154094696e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1070 -7.8126927837729454e-03</internalNodes>
+          <leafValues>
+            -1.6586859524250031e-01 4.3801128864288330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1071 4.1652601212263107e-02</internalNodes>
+          <leafValues>
+            -3.1804520636796951e-02 4.3517521023750305e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1072 3.4417589195072651e-03</internalNodes>
+          <leafValues>
+            4.2282279580831528e-02 -1.3088959455490112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1073 1.3004569336771965e-04</internalNodes>
+          <leafValues>
+            -1.1260010302066803e-01 1.3964599370956421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1074 -7.7347733080387115e-02</internalNodes>
+          <leafValues>
+            7.0750647783279419e-01 -5.4134069941937923e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1075 -1.6143550164997578e-03</internalNodes>
+          <leafValues>
+            1.1920420080423355e-01 -1.1884269863367081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1076 -9.8279246594756842e-04</internalNodes>
+          <leafValues>
+            6.3156276941299438e-02 -5.2781101316213608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1077 -4.5667469501495361e-02</internalNodes>
+          <leafValues>
+            -3.4500870108604431e-01 4.4600728899240494e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>101</maxWeakCount>
+      <stageThreshold>-6.9763368368148804e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1078 7.3315978050231934e-02</internalNodes>
+          <leafValues>
+            -1.1410109698772430e-01 4.0035811066627502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1079 2.5275669991970062e-02</internalNodes>
+          <leafValues>
+            -7.2013877332210541e-02 3.6095780134201050e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1080 1.8873859196901321e-02</internalNodes>
+          <leafValues>
+            -1.7234370112419128e-01 1.8223220109939575e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1081 7.4607720307540148e-05</internalNodes>
+          <leafValues>
+            -8.1627286970615387e-02 8.8888503611087799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1082 4.2250280966982245e-04</internalNodes>
+          <leafValues>
+            -1.2840239703655243e-01 1.1791419982910156e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1083 1.4402460306882858e-02</internalNodes>
+          <leafValues>
+            2.0960340276360512e-02 1.9024699926376343e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1084 -2.0460959058254957e-03</internalNodes>
+          <leafValues>
+            9.5712497830390930e-02 -2.1517060697078705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1085 7.1128448471426964e-03</internalNodes>
+          <leafValues>
+            -5.6100480258464813e-02 2.0984320342540741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1086 -6.5832170657813549e-03</internalNodes>
+          <leafValues>
+            -2.1138189733028412e-01 7.6094150543212891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1087 -4.1252959636040032e-04</internalNodes>
+          <leafValues>
+            1.3107340037822723e-01 -1.5670859813690186e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1088 -4.4330831617116928e-02</internalNodes>
+          <leafValues>
+            5.4048037528991699e-01 -1.9059479236602783e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1089 1.1700130067765713e-02</internalNodes>
+          <leafValues>
+            5.1712401211261749e-02 -1.7216169834136963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1090 3.5091140307486057e-03</internalNodes>
+          <leafValues>
+            -7.6767951250076294e-02 1.7776259779930115e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1091 1.5597569756209850e-02</internalNodes>
+          <leafValues>
+            3.8307890295982361e-02 -1.4730019867420197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1092 -3.6285370588302612e-02</internalNodes>
+          <leafValues>
+            3.5347661375999451e-01 -4.5018490403890610e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1093 -4.5118298381567001e-02</internalNodes>
+          <leafValues>
+            -5.7074141502380371e-01 1.0646710172295570e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1094 1.3734580017626286e-02</internalNodes>
+          <leafValues>
+            6.6018357872962952e-02 -2.0480890572071075e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1095 -2.7120979502797127e-02</internalNodes>
+          <leafValues>
+            4.8094209283590317e-02 -5.1394961774349213e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1096 -1.5354059869423509e-03</internalNodes>
+          <leafValues>
+            -2.3548009991645813e-01 5.3074609488248825e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1097 3.6000818945467472e-03</internalNodes>
+          <leafValues>
+            -5.8944340795278549e-02 1.1825410276651382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1098 6.8916529417037964e-03</internalNodes>
+          <leafValues>
+            -5.0014488399028778e-02 2.6909399032592773e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1099 3.5373449791222811e-03</internalNodes>
+          <leafValues>
+            -1.2947039306163788e-01 8.8697038590908051e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1100 -4.1431561112403870e-03</internalNodes>
+          <leafValues>
+            -1.7883630096912384e-01 6.9098107516765594e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1101 -1.0762579739093781e-01</internalNodes>
+          <leafValues>
+            -1. 4.7263409942388535e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1102 9.7946207970380783e-03</internalNodes>
+          <leafValues>
+            -5.4038770496845245e-02 2.4115470051765442e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1103 1.0054280050098896e-02</internalNodes>
+          <leafValues>
+            -8.0624893307685852e-02 1.1627560108900070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1104 -8.7350717512890697e-04</internalNodes>
+          <leafValues>
+            -1.8193979561328888e-01 7.7468506991863251e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1105 9.4283261569216847e-04</internalNodes>
+          <leafValues>
+            4.6265050768852234e-02 -2.2732029855251312e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1106 3.5424059024080634e-04</internalNodes>
+          <leafValues>
+            -1.1824289709329605e-01 1.1095699667930603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1107 -3.8587789982557297e-02</internalNodes>
+          <leafValues>
+            -3.0286869406700134e-01 3.1856179703027010e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1108 -4.9504679627716541e-03</internalNodes>
+          <leafValues>
+            1.3758100569248199e-01 -9.1690346598625183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1109 -2.5453630834817886e-02</internalNodes>
+          <leafValues>
+            -2.3013520240783691e-01 1.9747929647564888e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1110 1.5836700797080994e-02</internalNodes>
+          <leafValues>
+            -4.5252159237861633e-02 2.9337081313133240e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1111 1.0379879735410213e-02</internalNodes>
+          <leafValues>
+            5.9706691652536392e-02 -1.6415530443191528e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1112 4.3178450316190720e-02</internalNodes>
+          <leafValues>
+            6.3460536301136017e-02 -2.1360489726066589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1113 -2.2508678957819939e-03</internalNodes>
+          <leafValues>
+            1.0645110160112381e-01 -5.9539180248975754e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1114 5.0743711180984974e-03</internalNodes>
+          <leafValues>
+            -9.4377033412456512e-02 2.2999720275402069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1115 -3.0670650303363800e-02</internalNodes>
+          <leafValues>
+            2.5975760817527771e-01 -2.3188209161162376e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1116 2.4162670597434044e-03</internalNodes>
+          <leafValues>
+            8.7919056415557861e-02 -1.9287380576133728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1117 -9.3405842781066895e-03</internalNodes>
+          <leafValues>
+            -1.0935559868812561e-01 2.9358500614762306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1118 2.0513730123639107e-02</internalNodes>
+          <leafValues>
+            -5.2511349320411682e-02 3.0545449256896973e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1119 -4.3630380183458328e-02</internalNodes>
+          <leafValues>
+            -4.5310449600219727e-01 1.8261570483446121e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1120 3.4857920836657286e-03</internalNodes>
+          <leafValues>
+            -9.7093120217323303e-02 1.4877100288867950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1121 1.0411609895527363e-02</internalNodes>
+          <leafValues>
+            4.2915731668472290e-02 -2.4849639832973480e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1122 -7.5155291706323624e-03</internalNodes>
+          <leafValues>
+            -2.6623341441154480e-01 5.1602318882942200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1123 7.2157550603151321e-03</internalNodes>
+          <leafValues>
+            -6.1878159642219543e-02 1.8314969539642334e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1124 9.1090862406417727e-04</internalNodes>
+          <leafValues>
+            -9.7420282661914825e-02 1.2223699688911438e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1125 -4.0069910883903503e-01</internalNodes>
+          <leafValues>
+            -8.1831091642379761e-01 4.7453590668737888e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1126 -4.8033627681434155e-03</internalNodes>
+          <leafValues>
+            9.4193987548351288e-02 -1.4436510205268860e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1127 -2.1147429943084717e-02</internalNodes>
+          <leafValues>
+            2.9532408714294434e-01 -4.4751271605491638e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1128 1.8602259457111359e-02</internalNodes>
+          <leafValues>
+            -4.2993780225515366e-02 2.9706719517707825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1129 -8.1051718443632126e-03</internalNodes>
+          <leafValues>
+            1.2369229644536972e-01 -1.3246449828147888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1130 -8.3215925842523575e-03</internalNodes>
+          <leafValues>
+            -1.9022589921951294e-01 8.9151017367839813e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1131 3.1376329716295004e-03</internalNodes>
+          <leafValues>
+            4.1584819555282593e-02 -7.9552896320819855e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1132 1.6556069254875183e-02</internalNodes>
+          <leafValues>
+            4.4908858835697174e-02 -3.6947301030158997e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1133 2.9919730499386787e-02</internalNodes>
+          <leafValues>
+            -3.7720259279012680e-02 2.4280619621276855e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1134 -5.1988288760185242e-02</internalNodes>
+          <leafValues>
+            -6.9372260570526123e-01 1.8926780670881271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1135 7.5528107583522797e-02</internalNodes>
+          <leafValues>
+            -1.2611350044608116e-02 2.5732690095901489e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1136 -2.5031189434230328e-03</internalNodes>
+          <leafValues>
+            1.3807280361652374e-01 -9.1662466526031494e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1137 -5.9646938461810350e-04</internalNodes>
+          <leafValues>
+            -6.3654616475105286e-02 2.5937270373106003e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1138 1.0319340042769909e-02</internalNodes>
+          <leafValues>
+            8.3791837096214294e-02 -1.7408309876918793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1139 9.3816686421632767e-03</internalNodes>
+          <leafValues>
+            2.7871530503034592e-02 -1.1141580343246460e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1140 1.0023410432040691e-02</internalNodes>
+          <leafValues>
+            -6.9966249167919159e-02 2.1900640428066254e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1141 -8.3700200775638223e-04</internalNodes>
+          <leafValues>
+            1.0097689926624298e-01 -1.4261360466480255e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1142 2.2468710318207741e-02</internalNodes>
+          <leafValues>
+            9.4028212130069733e-02 -1.3807420432567596e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1143 3.9115209132432938e-02</internalNodes>
+          <leafValues>
+            -5.3969398140907288e-03 6.5187507867813110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1144 -1.5670569846406579e-03</internalNodes>
+          <leafValues>
+            7.0886030793190002e-02 -2.0010609924793243e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1145 6.0749892145395279e-03</internalNodes>
+          <leafValues>
+            3.5395938903093338e-02 -4.3918590992689133e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1146 -4.3166890740394592e-02</internalNodes>
+          <leafValues>
+            5.9881848096847534e-01 -2.3480180650949478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1147 2.3302088957279921e-03</internalNodes>
+          <leafValues>
+            -7.2818689048290253e-02 4.3940208852291107e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1148 5.5236589163541794e-02</internalNodes>
+          <leafValues>
+            -3.5117920488119125e-02 3.6355149745941162e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1149 2.7774399146437645e-02</internalNodes>
+          <leafValues>
+            3.0074290931224823e-02 -1.0026770085096359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1150 8.4784086793661118e-03</internalNodes>
+          <leafValues>
+            -5.6243300437927246e-02 2.1711349487304688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1151 1.3269360177218914e-02</internalNodes>
+          <leafValues>
+            4.3138369917869568e-02 -1.6429780423641205e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1152 -3.4072279930114746e-02</internalNodes>
+          <leafValues>
+            3.9418798685073853e-01 -3.2914638519287109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1153 -5.9365970082581043e-03</internalNodes>
+          <leafValues>
+            6.4854122698307037e-02 -8.6971588432788849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1154 -5.1997308619320393e-03</internalNodes>
+          <leafValues>
+            -2.1710740029811859e-01 6.5441012382507324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1155 3.0441130511462688e-03</internalNodes>
+          <leafValues>
+            -4.7171641141176224e-02 9.4662867486476898e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1156 -2.2375459957402200e-04</internalNodes>
+          <leafValues>
+            1.1739899963140488e-01 -1.0451590269804001e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1157 4.9494139850139618e-02</internalNodes>
+          <leafValues>
+            9.9552040919661522e-03 -8.8205021619796753e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1158 7.7127031981945038e-02</internalNodes>
+          <leafValues>
+            -3.6638759076595306e-02 3.7156999111175537e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1159 -3.7054829299449921e-03</internalNodes>
+          <leafValues>
+            4.6213079243898392e-02 -7.9498499631881714e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1160 1.3655430078506470e-01</internalNodes>
+          <leafValues>
+            2.0802579820156097e-02 -6.4692282676696777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1161 -1.6919399797916412e-01</internalNodes>
+          <leafValues>
+            -9.0144991874694824e-01 4.3158119660802186e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1162 5.2525149658322334e-03</internalNodes>
+          <leafValues>
+            8.6686216294765472e-02 -1.5751640498638153e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1163 5.7952258735895157e-02</internalNodes>
+          <leafValues>
+            1.3485850067809224e-03 -1.0001620054244995e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1164 -3.0681459233164787e-02</internalNodes>
+          <leafValues>
+            -6.7346888780593872e-01 1.7730809748172760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1165 -2.8556400910019875e-02</internalNodes>
+          <leafValues>
+            2.4913530051708221e-01 -2.1807359531521797e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1166 5.8311191387474537e-03</internalNodes>
+          <leafValues>
+            1.0109650343656540e-01 -1.2586539983749390e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1167 2.8870739042758942e-03</internalNodes>
+          <leafValues>
+            -4.5462280511856079e-02 1.4794190227985382e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1168 -5.3575891070067883e-03</internalNodes>
+          <leafValues>
+            1.0845459997653961e-01 -2.0636059343814850e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1169 2.0851830020546913e-02</internalNodes>
+          <leafValues>
+            -2.5641430169343948e-02 1.2000799924135208e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1170 2.9372319113463163e-03</internalNodes>
+          <leafValues>
+            -5.8832980692386627e-02 2.3967139422893524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1171 1.0109069757163525e-02</internalNodes>
+          <leafValues>
+            4.4724740087985992e-02 -2.5024959444999695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1172 6.2002640217542648e-02</internalNodes>
+          <leafValues>
+            3.1236680224537849e-02 -3.8775479793548584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1173 1.7331680282950401e-03</internalNodes>
+          <leafValues>
+            -7.6642520725727081e-02 5.8738309890031815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1174 -4.6648900955915451e-02</internalNodes>
+          <leafValues>
+            4.7800371050834656e-01 -2.8223259374499321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1175 -4.0585011243820190e-02</internalNodes>
+          <leafValues>
+            1.9591329991817474e-01 -2.9608549550175667e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1176 1.4297359623014927e-02</internalNodes>
+          <leafValues>
+            8.0422781407833099e-02 -2.0024399459362030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1177 -1.4215649571269751e-03</internalNodes>
+          <leafValues>
+            9.7693942487239838e-02 -1.3090120255947113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1178 5.2683628164231777e-03</internalNodes>
+          <leafValues>
+            -5.8376371860504150e-02 2.4378040432929993e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>104</maxWeakCount>
+      <stageThreshold>-6.8976742029190063e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1179 -2.6198190171271563e-03</internalNodes>
+          <leafValues>
+            1.8673700094223022e-01 -1.9126529991626740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1180 -2.8629099950194359e-02</internalNodes>
+          <leafValues>
+            1.2887109816074371e-01 -2.6186849921941757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1181 7.1718869730830193e-03</internalNodes>
+          <leafValues>
+            8.8158592581748962e-02 -2.0327340066432953e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1182 1.1641040444374084e-02</internalNodes>
+          <leafValues>
+            -2.1058250218629837e-02 1.7591789364814758e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1183 5.6764329783618450e-03</internalNodes>
+          <leafValues>
+            4.9941159784793854e-02 -2.7329298853874207e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1184 -4.4392690062522888e-02</internalNodes>
+          <leafValues>
+            5.6766128540039062e-01 -1.8674779683351517e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1185 1.3367610517889261e-04</internalNodes>
+          <leafValues>
+            -1.2990309298038483e-01 1.3542290031909943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1186 -4.4111948460340500e-02</internalNodes>
+          <leafValues>
+            2.2684830427169800e-01 -1.3318399898707867e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1187 2.9443150851875544e-03</internalNodes>
+          <leafValues>
+            4.3161459267139435e-02 -2.9311171174049377e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1188 3.5300010349601507e-03</internalNodes>
+          <leafValues>
+            7.7193722128868103e-02 -2.6324981451034546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1189 1.0119210183620453e-01</internalNodes>
+          <leafValues>
+            -5.4924260824918747e-02 3.2430219650268555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1190 -2.2348569706082344e-02</internalNodes>
+          <leafValues>
+            3.0803111195564270e-01 -2.2518489509820938e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1191 6.4755380153656006e-03</internalNodes>
+          <leafValues>
+            -1.2045770138502121e-01 1.3186110556125641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1192 1.0904319584369659e-02</internalNodes>
+          <leafValues>
+            1.0217989981174469e-01 -1.8308849632740021e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1193 -1.1256629601120949e-02</internalNodes>
+          <leafValues>
+            -2.9186639189720154e-01 5.5491220206022263e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1194 3.6791800521314144e-03</internalNodes>
+          <leafValues>
+            -5.0614688545465469e-02 8.2663312554359436e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1195 -9.1721288859844208e-02</internalNodes>
+          <leafValues>
+            -7.7127552032470703e-01 1.9312959164381027e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1196 4.0099889039993286e-02</internalNodes>
+          <leafValues>
+            7.8663527965545654e-03 -8.1302827596664429e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1197 -5.4956428706645966e-02</internalNodes>
+          <leafValues>
+            2.9059520363807678e-01 -5.9825580567121506e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1198 2.4804650247097015e-01</internalNodes>
+          <leafValues>
+            1.1665189638733864e-02 -6.9121950864791870e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1199 -3.4284800291061401e-02</internalNodes>
+          <leafValues>
+            4.5358398556709290e-01 -3.2071251422166824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1200 2.5439230725169182e-02</internalNodes>
+          <leafValues>
+            1.9467150792479515e-02 -3.7927991151809692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1201 -1.2720660306513309e-02</internalNodes>
+          <leafValues>
+            -2.1211430430412292e-01 6.1533831059932709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1202 1.0831000283360481e-02</internalNodes>
+          <leafValues>
+            -5.1443681120872498e-02 1.6947689652442932e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1203 -2.1931570023298264e-02</internalNodes>
+          <leafValues>
+            2.4839389324188232e-01 -5.6636359542608261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1204 2.9397898912429810e-01</internalNodes>
+          <leafValues>
+            1.1411529965698719e-02 -9.3696069717407227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1205 -1.6342259943485260e-02</internalNodes>
+          <leafValues>
+            -3.1589549779891968e-01 4.4371981173753738e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1206 -4.4280499219894409e-02</internalNodes>
+          <leafValues>
+            2.0337340235710144e-01 -2.1462319418787956e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1207 2.6503309607505798e-01</internalNodes>
+          <leafValues>
+            1.1633150279521942e-02 -9.1220170259475708e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1208 -7.6378479599952698e-02</internalNodes>
+          <leafValues>
+            1.8688270449638367e-01 -1.9672080874443054e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1209 -1.0061570443212986e-02</internalNodes>
+          <leafValues>
+            -2.6462039351463318e-01 4.6620260924100876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1210 2.4921730160713196e-02</internalNodes>
+          <leafValues>
+            -1.9131390377879143e-02 2.0154500007629395e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1211 1.5098409676284064e-05</internalNodes>
+          <leafValues>
+            -1.6241690516471863e-01 7.6183967292308807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1212 -1.0081910341978073e-01</internalNodes>
+          <leafValues>
+            -1. 7.4751500505954027e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1213 6.5058596432209015e-02</internalNodes>
+          <leafValues>
+            -4.0468640625476837e-02 3.5160079598426819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1214 -1.2190239876508713e-01</internalNodes>
+          <leafValues>
+            -5.3624558448791504e-01 1.8637020140886307e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1215 -9.8520738538354635e-04</internalNodes>
+          <leafValues>
+            1.1398199945688248e-01 -1.1298830062150955e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1216 -2.5300619006156921e-01</internalNodes>
+          <leafValues>
+            -4.3375909328460693e-01 1.2367400340735912e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1217 7.5246659107506275e-03</internalNodes>
+          <leafValues>
+            6.7355476319789886e-02 -1.8583969771862030e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1218 4.8102210275828838e-03</internalNodes>
+          <leafValues>
+            -6.5870061516761780e-02 1.2848910689353943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1219 -1.4562129508703947e-03</internalNodes>
+          <leafValues>
+            1.8110689520835876e-01 -1.1248459666967392e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1220 -5.6546321138739586e-03</internalNodes>
+          <leafValues>
+            1.0369840264320374e-01 -1.4115570485591888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1221 -3.1951289623975754e-02</internalNodes>
+          <leafValues>
+            -3.2971608638763428e-01 4.8281811177730560e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1222 4.2190380394458771e-02</internalNodes>
+          <leafValues>
+            -1.1644810438156128e-02 1.3701300323009491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1223 1.2606659904122353e-02</internalNodes>
+          <leafValues>
+            -6.0395881533622742e-02 2.4210059642791748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1224 -6.0083861462771893e-03</internalNodes>
+          <leafValues>
+            9.5677606761455536e-02 -2.0248259603977203e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1225 4.0676388889551163e-02</internalNodes>
+          <leafValues>
+            -3.8506429642438889e-02 3.9824029803276062e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1226 -1.3010219670832157e-02</internalNodes>
+          <leafValues>
+            -7.7870443463325500e-02 3.2533310353755951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1227 -5.6646969169378281e-02</internalNodes>
+          <leafValues>
+            -9.5293551683425903e-01 1.7375659197568893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1228 3.7307970225811005e-02</internalNodes>
+          <leafValues>
+            -3.3261440694332123e-02 4.6856319904327393e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1229 -2.7986379340291023e-02</internalNodes>
+          <leafValues>
+            -4.6356698870658875e-01 2.8524029999971390e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1230 -7.5014896690845490e-02</internalNodes>
+          <leafValues>
+            2.4519899487495422e-01 -1.5830159187316895e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1231 2.7673080563545227e-02</internalNodes>
+          <leafValues>
+            -3.6458358168601990e-02 3.7215578556060791e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1232 -1.7312960699200630e-02</internalNodes>
+          <leafValues>
+            -2.2117659449577332e-01 4.3232619762420654e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1233 -5.8893948793411255e-02</internalNodes>
+          <leafValues>
+            3.9726749062538147e-01 -3.7632528692483902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1234 1.3193679973483086e-02</internalNodes>
+          <leafValues>
+            2.4857729673385620e-02 -1.7514359951019287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1235 3.8230679929256439e-02</internalNodes>
+          <leafValues>
+            2.9635110870003700e-02 -4.3452748656272888e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1236 1.6845399513840675e-02</internalNodes>
+          <leafValues>
+            3.9338748902082443e-02 -2.3765720427036285e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1237 -1.1559460312128067e-01</internalNodes>
+          <leafValues>
+            -4.0006878972053528e-01 3.2390538603067398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1238 -1.7385910032317042e-03</internalNodes>
+          <leafValues>
+            4.8545818775892258e-02 -6.1474680900573730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1239 -3.3697668462991714e-02</internalNodes>
+          <leafValues>
+            2.4345000088214874e-01 -6.5504603087902069e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1240 -3.4722799062728882e-01</internalNodes>
+          <leafValues>
+            -3.3612060546875000e-01 1.5501200221478939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1241 5.8668039739131927e-02</internalNodes>
+          <leafValues>
+            6.8068057298660278e-02 -2.2104929387569427e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1242 2.3718189448118210e-02</internalNodes>
+          <leafValues>
+            -1.4779569581151009e-02 4.7328341007232666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1243 2.8812700882554054e-02</internalNodes>
+          <leafValues>
+            3.3309880644083023e-02 -4.6797698736190796e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1244 4.1023749858140945e-02</internalNodes>
+          <leafValues>
+            -2.8293000534176826e-02 4.9427551031112671e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1245 -1.2017590051982552e-04</internalNodes>
+          <leafValues>
+            1.0363650321960449e-01 -1.2107490003108978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1246 -1.0908070206642151e-01</internalNodes>
+          <leafValues>
+            -1. 3.2971999607980251e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1247 -4.5967359095811844e-02</internalNodes>
+          <leafValues>
+            6.4819461107254028e-01 -1.9233519211411476e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1248 -1.9345719367265701e-02</internalNodes>
+          <leafValues>
+            -3.3145549893379211e-01 3.9008539170026779e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1249 1.2312790378928185e-02</internalNodes>
+          <leafValues>
+            4.1029628366231918e-02 -2.7943921089172363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1250 2.1535221021622419e-03</internalNodes>
+          <leafValues>
+            -6.7545056343078613e-02 1.1647740006446838e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1251 -3.2158788293600082e-02</internalNodes>
+          <leafValues>
+            5.4741638898849487e-01 -2.3730229586362839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1252 -2.7592359110713005e-02</internalNodes>
+          <leafValues>
+            -7.5319421291351318e-01 8.4066214039921761e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1253 2.2264510393142700e-02</internalNodes>
+          <leafValues>
+            1.2146740220487118e-02 -9.0291297435760498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1254 1.5361379832029343e-02</internalNodes>
+          <leafValues>
+            -3.1641189008951187e-02 3.2132801413536072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1255 -1.2360660359263420e-02</internalNodes>
+          <leafValues>
+            2.9248631000518799e-01 -4.5303758233785629e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1256 2.2978749126195908e-02</internalNodes>
+          <leafValues>
+            -1.2054479680955410e-02 1.9060949981212616e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1257 2.3296380415558815e-02</internalNodes>
+          <leafValues>
+            3.1409051269292831e-02 -5.1856082677841187e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1258 5.7384249521419406e-04</internalNodes>
+          <leafValues>
+            -1.0293489694595337e-01 8.1548452377319336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1259 -3.3020470291376114e-02</internalNodes>
+          <leafValues>
+            4.2470559477806091e-01 -4.4794678688049316e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1260 -2.1713029593229294e-02</internalNodes>
+          <leafValues>
+            -1.4825260639190674e-01 1.2959879823029041e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1261 -9.7430922323837876e-05</internalNodes>
+          <leafValues>
+            1.1899639666080475e-01 -1.4753970503807068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1262 -9.2907734215259552e-03</internalNodes>
+          <leafValues>
+            -1.1635430157184601e-01 5.4104641079902649e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1263 3.7244848906993866e-02</internalNodes>
+          <leafValues>
+            -3.4421201795339584e-02 3.7943929433822632e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1264 1.5277029573917389e-01</internalNodes>
+          <leafValues>
+            7.2725401259958744e-03 -3.4155088663101196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1265 -1.2663450092077255e-02</internalNodes>
+          <leafValues>
+            -3.0596670508384705e-01 3.8231261074542999e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1266 -7.4888423085212708e-02</internalNodes>
+          <leafValues>
+            -3.4658950567245483e-01 1.5501650050282478e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1267 -4.0114589035511017e-02</internalNodes>
+          <leafValues>
+            3.2629820704460144e-01 -4.1313670575618744e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1268 -9.6492111682891846e-02</internalNodes>
+          <leafValues>
+            1.0172849893569946e-01 -1.7156010493636131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1269 -1.6712839901447296e-01</internalNodes>
+          <leafValues>
+            -7.7655118703842163e-01 1.8029559403657913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1270 -8.2981940358877182e-03</internalNodes>
+          <leafValues>
+            -1.4397139847278595e-01 5.8948140591382980e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1271 -3.7844169419258833e-03</internalNodes>
+          <leafValues>
+            1.7095179855823517e-01 -7.8256443142890930e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1272 -1.6076420247554779e-01</internalNodes>
+          <leafValues>
+            2.3138229548931122e-01 -1.3428050093352795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1273 6.4544437918812037e-04</internalNodes>
+          <leafValues>
+            -1.4424400031566620e-01 8.3287820219993591e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1274 2.2737309336662292e-02</internalNodes>
+          <leafValues>
+            -3.4155819565057755e-02 3.5519808530807495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1275 -3.9030050393193960e-03</internalNodes>
+          <leafValues>
+            -1.8736769258975983e-01 6.4628012478351593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1276 -5.1145430654287338e-02</internalNodes>
+          <leafValues>
+            6.6892707347869873e-01 -1.1180049739778042e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1277 -6.0482369735836983e-03</internalNodes>
+          <leafValues>
+            1.8622750043869019e-01 -6.3018701970577240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1278 1.1743569746613503e-02</internalNodes>
+          <leafValues>
+            2.5449279695749283e-02 -1.3331249356269836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1279 8.4120890824124217e-04</internalNodes>
+          <leafValues>
+            -9.3333467841148376e-02 1.3315880298614502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1280 -3.7756171077489853e-02</internalNodes>
+          <leafValues>
+            -2.3138800263404846e-01 4.0569789707660675e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1281 -2.0867560058832169e-02</internalNodes>
+          <leafValues>
+            1.0056090354919434e-01 -1.1744190007448196e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1282 -3.9802178740501404e-02</internalNodes>
+          <leafValues>
+            -1.1585719883441925e-01 1.2668189406394958e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>111</maxWeakCount>
+      <stageThreshold>-6.8169009685516357e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1283 8.4546189755201340e-03</internalNodes>
+          <leafValues>
+            -1.6289660334587097e-01 1.9834390282630920e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1284 5.1610451191663742e-02</internalNodes>
+          <leafValues>
+            -3.0827090144157410e-02 3.3742550015449524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1285 -6.4909443259239197e-02</internalNodes>
+          <leafValues>
+            2.8602281212806702e-01 -5.9848651289939880e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1286 -4.3951408006250858e-03</internalNodes>
+          <leafValues>
+            1.1302659660577774e-01 -1.2632089853286743e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1287 -8.2756802439689636e-02</internalNodes>
+          <leafValues>
+            -6.0790950059890747e-01 2.1967180073261261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1288 -4.8698862083256245e-03</internalNodes>
+          <leafValues>
+            8.5866190493106842e-02 -8.9009523391723633e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1289 9.1512441635131836e-02</internalNodes>
+          <leafValues>
+            -5.3345348685979843e-02 2.6732870936393738e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1290 3.6815661005675793e-03</internalNodes>
+          <leafValues>
+            7.0915699005126953e-02 -1.7941209673881531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1291 6.3032708130776882e-03</internalNodes>
+          <leafValues>
+            1.2378150224685669e-01 -1.2391480058431625e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1292 5.8764131972566247e-04</internalNodes>
+          <leafValues>
+            -6.3813656568527222e-02 9.5545768737792969e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1293 1.4680320397019386e-02</internalNodes>
+          <leafValues>
+            -4.9183528870344162e-02 2.9040598869323730e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1294 3.5624930169433355e-03</internalNodes>
+          <leafValues>
+            -9.7563147544860840e-02 4.8932831734418869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1295 -7.4473340064287186e-03</internalNodes>
+          <leafValues>
+            -1.5952460467815399e-01 8.4772646427154541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1296 5.4010991007089615e-02</internalNodes>
+          <leafValues>
+            -2.0565150305628777e-02 5.7340717315673828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1297 -2.3613919038325548e-03</internalNodes>
+          <leafValues>
+            1.4957650005817413e-01 -7.5148113071918488e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1298 4.0665458887815475e-02</internalNodes>
+          <leafValues>
+            1.4762399718165398e-02 -5.9685671329498291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1299 9.3258380889892578e-02</internalNodes>
+          <leafValues>
+            1.3036210089921951e-02 -6.8643862009048462e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1300 2.8593749739229679e-03</internalNodes>
+          <leafValues>
+            -5.4904639720916748e-02 9.8074667155742645e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1301 -4.9756402149796486e-03</internalNodes>
+          <leafValues>
+            1.6751970350742340e-01 -8.2563832402229309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1302 -2.2061138879507780e-03</internalNodes>
+          <leafValues>
+            7.1486182510852814e-02 -8.4684796631336212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1303 4.3787518516182899e-03</internalNodes>
+          <leafValues>
+            7.5296439230442047e-02 -1.6988970339298248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1304 -4.9143321812152863e-03</internalNodes>
+          <leafValues>
+            1.6274330019950867e-01 -5.7579189538955688e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1305 -3.0191219411790371e-03</internalNodes>
+          <leafValues>
+            -1.2450099736452103e-01 1.1526980251073837e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1306 6.8227178417146206e-03</internalNodes>
+          <leafValues>
+            3.7166971713304520e-02 -1.0093449801206589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1307 3.5116981714963913e-02</internalNodes>
+          <leafValues>
+            -4.2997431010007858e-02 3.2959198951721191e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1308 -1.4400649815797806e-03</internalNodes>
+          <leafValues>
+            -9.8922260105609894e-02 6.7108891904354095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1309 -4.6699359081685543e-03</internalNodes>
+          <leafValues>
+            -1.8003439903259277e-01 6.8038396537303925e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1310 3.7647720426321030e-02</internalNodes>
+          <leafValues>
+            -2.1031750366091728e-02 1.6627119481563568e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1311 5.1745469681918621e-03</internalNodes>
+          <leafValues>
+            -1.1846090108156204e-01 1.0919190198183060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1312 7.7274879440665245e-03</internalNodes>
+          <leafValues>
+            -5.5097330361604691e-02 2.2752280533313751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1313 2.9158849269151688e-02</internalNodes>
+          <leafValues>
+            7.7885583043098450e-02 -1.7775520682334900e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1314 2.9885378899052739e-04</internalNodes>
+          <leafValues>
+            -7.8875280916690826e-02 5.1163110882043839e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1315 1.4456070493906736e-04</internalNodes>
+          <leafValues>
+            -1.6097649931907654e-01 8.1574030220508575e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1316 4.7840740531682968e-02</internalNodes>
+          <leafValues>
+            1.4210550114512444e-02 -3.1316679716110229e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1317 4.3943468481302261e-02</internalNodes>
+          <leafValues>
+            -3.1002480536699295e-02 4.2450350522994995e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1318 -1.7603389918804169e-01</internalNodes>
+          <leafValues>
+            -2.1625219285488129e-01 1.3710640370845795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1319 -2.7010550722479820e-02</internalNodes>
+          <leafValues>
+            4.5448291301727295e-01 -2.8507620096206665e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1320 6.4534661360085011e-03</internalNodes>
+          <leafValues>
+            -4.9660708755254745e-02 8.3071723580360413e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1321 -7.1115070022642612e-03</internalNodes>
+          <leafValues>
+            -2.2509810328483582e-01 6.5033361315727234e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1322 -2.5184849277138710e-02</internalNodes>
+          <leafValues>
+            -1.7480330169200897e-01 1.8751099705696106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1323 -8.8047432655002922e-05</internalNodes>
+          <leafValues>
+            1.2677890062332153e-01 -1.0704579949378967e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1324 -3.6020219326019287e-02</internalNodes>
+          <leafValues>
+            2.4649600684642792e-01 -4.9772080034017563e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1325 7.6084570027887821e-03</internalNodes>
+          <leafValues>
+            1.0041440278291702e-01 -1.3673840463161469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1326 -8.2404967397451401e-03</internalNodes>
+          <leafValues>
+            1.1703260242938995e-01 -5.2781961858272552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1327 -7.2474818443879485e-04</internalNodes>
+          <leafValues>
+            -1.1650030314922333e-01 1.1333490163087845e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1328 -7.8272278187796474e-05</internalNodes>
+          <leafValues>
+            6.4425677061080933e-02 -1.5894609689712524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1329 -2.0254699047654867e-03</internalNodes>
+          <leafValues>
+            -1.7027080059051514e-01 7.1216866374015808e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1330 -1.1882030218839645e-01</internalNodes>
+          <leafValues>
+            3.2878550887107849e-01 -1.5325210057199001e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1331 -1.6258429735898972e-02</internalNodes>
+          <leafValues>
+            2.1848890185356140e-01 -5.6253198534250259e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1332 -6.8429792299866676e-03</internalNodes>
+          <leafValues>
+            -2.3313499987125397e-01 5.7107821106910706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1333 3.4939710050821304e-02</internalNodes>
+          <leafValues>
+            -2.7333829551935196e-02 4.5651969313621521e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1334 2.2979779541492462e-01</internalNodes>
+          <leafValues>
+            1.4508989639580250e-02 -8.7165087461471558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1335 4.3360598385334015e-02</internalNodes>
+          <leafValues>
+            8.4467595443129539e-03 -8.7500327825546265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1336 -1.1806190013885498e-03</internalNodes>
+          <leafValues>
+            7.8186698257923126e-02 -5.2834209054708481e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1337 -4.1772681474685669e-01</internalNodes>
+          <leafValues>
+            -8.0729222297668457e-01 1.3048130087554455e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1338 -4.6315230429172516e-02</internalNodes>
+          <leafValues>
+            2.9375079274177551e-01 -3.5192389041185379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1339 -4.0271300822496414e-02</internalNodes>
+          <leafValues>
+            -5.8174532651901245e-01 1.9768500700592995e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1340 -4.3012440204620361e-02</internalNodes>
+          <leafValues>
+            1.0882510244846344e-01 -2.6977609843015671e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1341 2.8285770677030087e-03</internalNodes>
+          <leafValues>
+            7.6837047934532166e-02 -1.5720550715923309e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1342 -3.3204611390829086e-02</internalNodes>
+          <leafValues>
+            -2.3152589797973633e-01 1.5932539477944374e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1343 -4.8097351100295782e-04</internalNodes>
+          <leafValues>
+            1.1043740063905716e-01 -1.1589460074901581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1344 2.9704240150749683e-03</internalNodes>
+          <leafValues>
+            -3.4243740141391754e-02 6.9107398390769958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1345 1.1893190443515778e-02</internalNodes>
+          <leafValues>
+            8.0122880637645721e-02 -2.0503090322017670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1346 -6.3963606953620911e-02</internalNodes>
+          <leafValues>
+            -8.5530751943588257e-01 6.4783529378473759e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1347 -5.6093540042638779e-03</internalNodes>
+          <leafValues>
+            1.6278949379920959e-01 -1.0079070180654526e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1348 7.5979339890182018e-03</internalNodes>
+          <leafValues>
+            5.4123409092426300e-02 -1.2431269884109497e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1349 1.3480819761753082e-02</internalNodes>
+          <leafValues>
+            -6.3751302659511566e-02 2.5250628590583801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1350 -9.4613758847117424e-04</internalNodes>
+          <leafValues>
+            4.2835868895053864e-02 -7.6837100088596344e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1351 -3.8062490522861481e-02</internalNodes>
+          <leafValues>
+            1.9252179563045502e-01 -6.3947133719921112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1352 1.2410899996757507e-01</internalNodes>
+          <leafValues>
+            7.9416595399379730e-03 -4.2653021216392517e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1353 -9.2228442430496216e-02</internalNodes>
+          <leafValues>
+            -5.5210620164871216e-01 2.8964910656213760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1354 1.5106770209968090e-02</internalNodes>
+          <leafValues>
+            2.7609340846538544e-02 -1.6688449680805206e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1355 -2.3654250428080559e-02</internalNodes>
+          <leafValues>
+            -3.4379678964614868e-01 3.9513330906629562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1356 4.7881390899419785e-02</internalNodes>
+          <leafValues>
+            8.0661084502935410e-03 -1.8185199797153473e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1357 8.5415288805961609e-02</internalNodes>
+          <leafValues>
+            -4.6752408146858215e-02 2.7169001102447510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1358 3.1524940859526396e-03</internalNodes>
+          <leafValues>
+            -8.6421400308609009e-02 6.8336002528667450e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1359 -3.0099870637059212e-03</internalNodes>
+          <leafValues>
+            8.9336208999156952e-02 -1.3626849651336670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1360 -5.8112520724534988e-02</internalNodes>
+          <leafValues>
+            -1.9748120009899139e-01 2.6536440476775169e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1361 1.2775669991970062e-01</internalNodes>
+          <leafValues>
+            -4.9838040024042130e-02 3.4896400570869446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1362 1.2011290341615677e-01</internalNodes>
+          <leafValues>
+            -6.3313432037830353e-03 3.7937548756599426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1363 4.7567482106387615e-03</internalNodes>
+          <leafValues>
+            1.0490419715642929e-01 -1.3542570173740387e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1364 -1.5902349725365639e-02</internalNodes>
+          <leafValues>
+            6.1786301434040070e-02 -9.8376080393791199e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1365 -5.6423708796501160e-02</internalNodes>
+          <leafValues>
+            -6.3371032476425171e-01 2.0224599167704582e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1366 -7.9641327261924744e-02</internalNodes>
+          <leafValues>
+            -1. 8.7428308324888349e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1367 -2.0731301046907902e-03</internalNodes>
+          <leafValues>
+            1.3846459984779358e-01 -9.5865301787853241e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1368 5.8470368385314941e-03</internalNodes>
+          <leafValues>
+            -5.7033840566873550e-02 1.1691799759864807e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1369 -2.6138950139284134e-02</internalNodes>
+          <leafValues>
+            -2.2362439334392548e-01 5.5546630173921585e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1370 -6.5781630109995604e-04</internalNodes>
+          <leafValues>
+            9.2999227344989777e-02 -8.4152117371559143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1371 -5.6041389703750610e-02</internalNodes>
+          <leafValues>
+            3.5072851181030273e-01 -3.1472280621528625e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1372 9.7799800336360931e-02</internalNodes>
+          <leafValues>
+            1.0124430060386658e-02 -3.7714061141014099e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1373 4.5515140518546104e-03</internalNodes>
+          <leafValues>
+            -7.8311361372470856e-02 1.4166970551013947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1374 1.0168380104005337e-02</internalNodes>
+          <leafValues>
+            5.2113991230726242e-02 -2.4422790110111237e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1375 6.2885403633117676e-02</internalNodes>
+          <leafValues>
+            -1.8255509436130524e-02 6.2847292423248291e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1376 -4.8064131289720535e-02</internalNodes>
+          <leafValues>
+            -8.6817431449890137e-01 6.6064838320016861e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1377 1.8479900434613228e-02</internalNodes>
+          <leafValues>
+            6.9977812469005585e-02 -1.5929399430751801e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1378 2.4549840018153191e-02</internalNodes>
+          <leafValues>
+            -1.7519120126962662e-02 1.7961919307708740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1379 3.9227470755577087e-02</internalNodes>
+          <leafValues>
+            -4.7417990863323212e-02 2.7945789694786072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1380 4.1248198598623276e-02</internalNodes>
+          <leafValues>
+            1.1459370143711567e-02 -4.3477478623390198e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1381 -8.4321142639964819e-04</internalNodes>
+          <leafValues>
+            1.2758859992027283e-01 -9.7010560333728790e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1382 -1.3688740320503712e-02</internalNodes>
+          <leafValues>
+            -1.6236190497875214e-01 4.3290950357913971e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1383 -5.5982511490583420e-02</internalNodes>
+          <leafValues>
+            -7.5431138277053833e-01 1.5797710046172142e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1384 7.3578268289566040e-02</internalNodes>
+          <leafValues>
+            -1.4777439646422863e-03 -1.0000350475311279e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1385 3.7084969226270914e-03</internalNodes>
+          <leafValues>
+            -9.7184643149375916e-02 1.2435329705476761e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1386 -1.4889879821566865e-05</internalNodes>
+          <leafValues>
+            7.1465343236923218e-02 -1.6840849816799164e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1387 1.0487560182809830e-01</internalNodes>
+          <leafValues>
+            1.5076650306582451e-02 -7.1159482002258301e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1388 1.2587489560246468e-02</internalNodes>
+          <leafValues>
+            -2.0771300420165062e-02 1.7468680441379547e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1389 -2.2228389570955187e-04</internalNodes>
+          <leafValues>
+            1.1781640350818634e-01 -9.2627458274364471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1390 -7.7760413289070129e-02</internalNodes>
+          <leafValues>
+            -7.4605411291122437e-01 3.6328181158751249e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1391 4.5043420046567917e-02</internalNodes>
+          <leafValues>
+            2.2217869758605957e-02 -5.0052911043167114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1392 3.5614410880953074e-03</internalNodes>
+          <leafValues>
+            -5.1213219761848450e-02 8.9986503124237061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1393 -7.4102368671447039e-04</internalNodes>
+          <leafValues>
+            1.3938049972057343e-01 -1.0272219777107239e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>107</maxWeakCount>
+      <stageThreshold>-6.0689288377761841e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1394 -8.5600130259990692e-03</internalNodes>
+          <leafValues>
+            1.6578909754753113e-01 -1.6412919759750366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1395 3.0798809602856636e-02</internalNodes>
+          <leafValues>
+            -3.3495649695396423e-02 2.8578650951385498e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1396 -3.7319411057978868e-04</internalNodes>
+          <leafValues>
+            1.2523449957370758e-01 -1.2115170061588287e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1397 -1.9253849983215332e-02</internalNodes>
+          <leafValues>
+            -8.7740883231163025e-02 3.9066571742296219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1398 -8.5401646792888641e-03</internalNodes>
+          <leafValues>
+            1.3152270019054413e-01 -1.3007740676403046e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1399 1.2424349784851074e-01</internalNodes>
+          <leafValues>
+            1.9019979983568192e-02 -7.8247052431106567e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1400 4.0093418210744858e-02</internalNodes>
+          <leafValues>
+            -4.0743768215179443e-02 3.8851749897003174e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1401 -4.4169559259898961e-05</internalNodes>
+          <leafValues>
+            4.5526970177888870e-02 -8.8063806295394897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1402 -1.7662849277257919e-02</internalNodes>
+          <leafValues>
+            -3.1371811032295227e-01 5.1794338971376419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1403 5.2368510514497757e-02</internalNodes>
+          <leafValues>
+            -3.5845998674631119e-02 1.5009739995002747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1404 -2.8719279915094376e-02</internalNodes>
+          <leafValues>
+            -1.9849379360675812e-01 7.8099071979522705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1405 6.9435790181159973e-02</internalNodes>
+          <leafValues>
+            -5.5073730647563934e-02 2.1780849993228912e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1406 5.4794438183307648e-02</internalNodes>
+          <leafValues>
+            -3.0223689973354340e-02 6.2993967533111572e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1407 -1.5315500088036060e-02</internalNodes>
+          <leafValues>
+            -1.5052799880504608e-01 2.0194370299577713e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1408 2.9001969844102859e-02</internalNodes>
+          <leafValues>
+            -2.0738989114761353e-02 4.5645099878311157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1409 -2.3264769464731216e-02</internalNodes>
+          <leafValues>
+            1.4672529697418213e-01 -3.8081351667642593e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1410 1.9063109531998634e-02</internalNodes>
+          <leafValues>
+            7.2921238839626312e-02 -2.2723700106143951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1411 1.2208239641040564e-03</internalNodes>
+          <leafValues>
+            7.3471322655677795e-02 -1.9122929871082306e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1412 -1.7565910518169403e-01</internalNodes>
+          <leafValues>
+            2.5924688577651978e-01 -5.6015118956565857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1413 -3.8042131811380386e-02</internalNodes>
+          <leafValues>
+            1.6113610565662384e-01 -4.3758820742368698e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1414 3.0130259692668915e-02</internalNodes>
+          <leafValues>
+            5.7830829173326492e-02 -2.9774171113967896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1415 2.0089220255613327e-02</internalNodes>
+          <leafValues>
+            -6.0509629547595978e-02 3.3441681414842606e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1416 2.6193389203399420e-04</internalNodes>
+          <leafValues>
+            -1.5175449848175049e-01 1.1094109714031219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1417 4.0310628712177277e-02</internalNodes>
+          <leafValues>
+            1.7477119341492653e-02 -1.4185379445552826e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1418 -2.9343019705265760e-03</internalNodes>
+          <leafValues>
+            -1.6960139572620392e-01 9.3530252575874329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1419 1.4554520137608051e-02</internalNodes>
+          <leafValues>
+            -7.5844526290893555e-02 2.7771660685539246e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1420 3.4086001105606556e-03</internalNodes>
+          <leafValues>
+            7.3933310806751251e-02 -1.9626590609550476e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1421 -6.7988429218530655e-03</internalNodes>
+          <leafValues>
+            -2.0132480561733246e-01 5.8276038616895676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1422 -5.0457930192351341e-03</internalNodes>
+          <leafValues>
+            1.9446060061454773e-01 -7.1691580116748810e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1423 1.0465010069310665e-02</internalNodes>
+          <leafValues>
+            -4.7314591705799103e-02 1.9316110014915466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1424 -1.6713530058041215e-03</internalNodes>
+          <leafValues>
+            9.2915147542953491e-02 -1.1890129745006561e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1425 -4.2704358696937561e-02</internalNodes>
+          <leafValues>
+            1.6961039602756500e-01 -2.0632650703191757e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1426 2.0367829501628876e-01</internalNodes>
+          <leafValues>
+            2.3246899247169495e-02 -4.9420261383056641e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1427 -8.3379482384771109e-04</internalNodes>
+          <leafValues>
+            5.0001069903373718e-02 -7.3779806494712830e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1428 1.7854769527912140e-01</internalNodes>
+          <leafValues>
+            1.5588290058076382e-02 -7.7650082111358643e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1429 -1.3535289466381073e-01</internalNodes>
+          <leafValues>
+            -5.2299112081527710e-01 3.1595760956406593e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1430 4.6555269509553909e-02</internalNodes>
+          <leafValues>
+            -4.1891060769557953e-02 3.0324798822402954e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1431 2.2663649171590805e-02</internalNodes>
+          <leafValues>
+            3.8851160556077957e-02 -8.5196226835250854e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1432 -2.3027729988098145e-01</internalNodes>
+          <leafValues>
+            -9.3503099679946899e-01 1.3942349702119827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1433 2.5714140385389328e-02</internalNodes>
+          <leafValues>
+            -9.1460775583982468e-03 7.8063201904296875e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1434 -7.3728510869841557e-06</internalNodes>
+          <leafValues>
+            6.2730923295021057e-02 -2.0042170584201813e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1435 -1.9757889211177826e-02</internalNodes>
+          <leafValues>
+            -2.3434729874134064e-01 1.4600900001823902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1436 -4.1893101297318935e-03</internalNodes>
+          <leafValues>
+            1.4971399307250977e-01 -6.9368869066238403e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1437 1.1314969742670655e-03</internalNodes>
+          <leafValues>
+            -6.9203592836856842e-02 1.0447440296411514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1438 6.3914088532328606e-03</internalNodes>
+          <leafValues>
+            5.6134030222892761e-02 -1.9862769544124603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1439 -3.7047569639980793e-03</internalNodes>
+          <leafValues>
+            9.6817292273044586e-02 -9.5282286405563354e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1440 3.0627459287643433e-02</internalNodes>
+          <leafValues>
+            -5.0079640001058578e-02 2.6023888587951660e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1441 3.2444439828395844e-02</internalNodes>
+          <leafValues>
+            3.1099939718842506e-02 -2.0788609981536865e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1442 1.1651559732854366e-02</internalNodes>
+          <leafValues>
+            -5.8311950415372849e-02 2.5374108552932739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1443 -3.6515220999717712e-02</internalNodes>
+          <leafValues>
+            -2.6749190688133240e-01 2.0536249503493309e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1444 1.7474630847573280e-02</internalNodes>
+          <leafValues>
+            4.7416981309652328e-02 -3.3719009160995483e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1445 -1.5204170485958457e-03</internalNodes>
+          <leafValues>
+            5.8933809399604797e-02 -9.5844946801662445e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1446 4.7761179506778717e-02</internalNodes>
+          <leafValues>
+            1.0849700309336185e-02 -8.6635017395019531e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1447 -6.3569113612174988e-02</internalNodes>
+          <leafValues>
+            2.5858598947525024e-01 -1.8156580626964569e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1448 -1.7476839711889625e-03</internalNodes>
+          <leafValues>
+            7.5750246644020081e-02 -1.4295279979705811e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1449 -4.6762558631598949e-03</internalNodes>
+          <leafValues>
+            -9.1223396360874176e-02 1.3135279715061188e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1450 2.2202100604772568e-02</internalNodes>
+          <leafValues>
+            -5.3397450596094131e-02 2.0743979513645172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1451 -2.4647359549999237e-01</internalNodes>
+          <leafValues>
+            -4.5610219240188599e-01 3.5777890589088202e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1452 5.0148782320320606e-03</internalNodes>
+          <leafValues>
+            8.8871829211711884e-02 -1.6236490011215210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1453 -4.2023971676826477e-02</internalNodes>
+          <leafValues>
+            1.2805579602718353e-01 -1.1926759965717793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1454 -1.0895519703626633e-01</internalNodes>
+          <leafValues>
+            -6.6466122865676880e-01 1.5905549749732018e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1455 -3.6672928929328918e-01</internalNodes>
+          <leafValues>
+            3.6374801397323608e-01 -3.1206229701638222e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1456 9.5884501934051514e-03</internalNodes>
+          <leafValues>
+            9.1073550283908844e-02 -1.2492360174655914e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1457 1.6124530229717493e-03</internalNodes>
+          <leafValues>
+            3.3751979470252991e-02 -5.8749239891767502e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1458 -1.7882430925965309e-02</internalNodes>
+          <leafValues>
+            2.0992769300937653e-01 -6.3215233385562897e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1459 -6.6655018599703908e-05</internalNodes>
+          <leafValues>
+            5.5020030587911606e-02 -1.7908810079097748e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1460 -1.0912610217928886e-02</internalNodes>
+          <leafValues>
+            -1.7878860235214233e-01 6.4088903367519379e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1461 -1.9031569827347994e-03</internalNodes>
+          <leafValues>
+            1.1012560129165649e-01 -6.2576442956924438e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1462 4.7322059981524944e-03</internalNodes>
+          <leafValues>
+            6.0611810535192490e-02 -1.7521250247955322e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1463 1.7955000698566437e-01</internalNodes>
+          <leafValues>
+            -2.6413710787892342e-02 5.1463198661804199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1464 -1.8869279883801937e-03</internalNodes>
+          <leafValues>
+            7.0732869207859039e-02 -1.8977560102939606e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1465 -3.5322420299053192e-03</internalNodes>
+          <leafValues>
+            9.5800288021564484e-02 -4.9251660704612732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1466 1.0818409500643611e-03</internalNodes>
+          <leafValues>
+            -9.7082488238811493e-02 1.4092449843883514e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1467 -9.5455259084701538e-02</internalNodes>
+          <leafValues>
+            -6.8376517295837402e-01 8.8187018409371376e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1468 1.6179149970412254e-03</internalNodes>
+          <leafValues>
+            -9.5129579305648804e-02 1.1351480334997177e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1469 6.5547877550125122e-01</internalNodes>
+          <leafValues>
+            9.7635984420776367e-03 -5.6581187248229980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1470 -7.7973723411560059e-02</internalNodes>
+          <leafValues>
+            3.5573729872703552e-01 -3.3126130700111389e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1471 2.0209029316902161e-02</internalNodes>
+          <leafValues>
+            3.9301611483097076e-02 -1.3580250740051270e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1472 9.0323589742183685e-02</internalNodes>
+          <leafValues>
+            -1.5932930633425713e-02 6.9409132003784180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1473 -6.2048831023275852e-03</internalNodes>
+          <leafValues>
+            -1.7037659883499146e-01 6.8090677261352539e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1474 -1.5737250447273254e-02</internalNodes>
+          <leafValues>
+            1.6250109672546387e-01 -6.6528938710689545e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1475 -3.5397041589021683e-02</internalNodes>
+          <leafValues>
+            -8.9766547083854675e-02 4.9135740846395493e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1476 3.2850861549377441e-02</internalNodes>
+          <leafValues>
+            8.5158139467239380e-02 -1.3002319633960724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1477 -8.4024056792259216e-02</internalNodes>
+          <leafValues>
+            3.0658489465713501e-01 -3.9313621819019318e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1478 2.1347659640014172e-03</internalNodes>
+          <leafValues>
+            8.3386950194835663e-02 -1.2239480018615723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1479 1.7922610044479370e-01</internalNodes>
+          <leafValues>
+            2.6004109531641006e-03 -9.9989092350006104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1480 1.1854390054941177e-01</internalNodes>
+          <leafValues>
+            1.1098369956016541e-02 -8.9629507064819336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1481 -2.7351840399205685e-03</internalNodes>
+          <leafValues>
+            1.1589130014181137e-01 -6.3589207828044891e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1482 6.6092880442738533e-03</internalNodes>
+          <leafValues>
+            -7.9491429030895233e-02 1.8501229584217072e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1483 -2.1072009578347206e-02</internalNodes>
+          <leafValues>
+            -1.4708499610424042e-01 2.6071280241012573e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1484 1.3411619700491428e-02</internalNodes>
+          <leafValues>
+            4.8645589500665665e-02 -2.2041800618171692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1485 -2.0661540329456329e-02</internalNodes>
+          <leafValues>
+            2.1374049782752991e-01 -2.2243229672312737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1486 -1.0939250141382217e-01</internalNodes>
+          <leafValues>
+            -7.9235088825225830e-01 1.1932499706745148e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1487 5.4573271423578262e-02</internalNodes>
+          <leafValues>
+            -8.7064085528254509e-03 3.8226109743118286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1488 -2.7845989912748337e-02</internalNodes>
+          <leafValues>
+            4.2096340656280518e-01 -3.4300819039344788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1489 1.4973179996013641e-01</internalNodes>
+          <leafValues>
+            5.5857440456748009e-03 -7.1027070283889771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1490 5.4548021405935287e-02</internalNodes>
+          <leafValues>
+            1.9289769232273102e-02 -5.5061852931976318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1491 5.4990737698972225e-03</internalNodes>
+          <leafValues>
+            4.3643891811370850e-02 -1.2233699858188629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1492 3.5988059244118631e-04</internalNodes>
+          <leafValues>
+            -9.5005020499229431e-02 1.2501640617847443e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1493 -5.1003068685531616e-02</internalNodes>
+          <leafValues>
+            -3.4648188948631287e-01 1.4124399982392788e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1494 -5.9379130601882935e-02</internalNodes>
+          <leafValues>
+            6.8840432167053223e-01 -2.0780999213457108e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1495 6.8976037204265594e-02</internalNodes>
+          <leafValues>
+            8.5678137838840485e-03 -6.9098550081253052e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1496 -4.3954830616712570e-03</internalNodes>
+          <leafValues>
+            -1.7382889986038208e-01 6.9105990231037140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1497 1.3838030397891998e-02</internalNodes>
+          <leafValues>
+            -2.9398119077086449e-02 1.9685789942741394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1498 -7.5316978618502617e-03</internalNodes>
+          <leafValues>
+            -3.5790848731994629e-01 3.9685450494289398e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1499 -8.8299706578254700e-02</internalNodes>
+          <leafValues>
+            -2.3770420253276825e-01 3.0232321005314589e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1500 -4.4138759374618530e-02</internalNodes>
+          <leafValues>
+            2.6541408896446228e-01 -5.1865179091691971e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>107</maxWeakCount>
+      <stageThreshold>-5.6881058216094971e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1501 -9.2582583427429199e-02</internalNodes>
+          <leafValues>
+            3.6183288693428040e-01 -7.8275963664054871e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1502 -4.8143980093300343e-03</internalNodes>
+          <leafValues>
+            -1.2681719660758972e-01 6.7723788321018219e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1503 3.2365128397941589e-02</internalNodes>
+          <leafValues>
+            -4.6087108552455902e-02 3.2692021131515503e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1504 -1.7028570175170898e-02</internalNodes>
+          <leafValues>
+            9.1306403279304504e-02 -1.1660590022802353e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1505 -1.1308620125055313e-01</internalNodes>
+          <leafValues>
+            -7.9631358385086060e-01 5.8426991105079651e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1506 -3.5633759107440710e-03</internalNodes>
+          <leafValues>
+            -8.2610622048377991e-02 1.0166700184345245e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1507 -2.4109560251235962e-01</internalNodes>
+          <leafValues>
+            2.7927228808403015e-01 -8.0744966864585876e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1508 2.2599289193749428e-02</internalNodes>
+          <leafValues>
+            5.1744598895311356e-02 -2.8865408897399902e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1509 2.0002270117402077e-02</internalNodes>
+          <leafValues>
+            -5.7962361723184586e-02 2.9044789075851440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1510 -1.9348099594935775e-03</internalNodes>
+          <leafValues>
+            9.8808683454990387e-02 -1.2368459999561310e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1511 -7.5757717713713646e-03</internalNodes>
+          <leafValues>
+            -2.0071910321712494e-01 9.2741288244724274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1512 3.3381819725036621e-02</internalNodes>
+          <leafValues>
+            -3.4530758857727051e-02 3.0876499414443970e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1513 4.7418981790542603e-02</internalNodes>
+          <leafValues>
+            -1.3563269376754761e-01 1.1016750335693359e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1514 -5.4173129610717297e-03</internalNodes>
+          <leafValues>
+            -1.6050089895725250e-01 7.2612293064594269e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1515 -9.6942558884620667e-03</internalNodes>
+          <leafValues>
+            -1.6376489400863647e-01 8.4426470100879669e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1516 -6.0632169246673584e-02</internalNodes>
+          <leafValues>
+            1.6474419832229614e-01 -2.6981400325894356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1517 5.0302860327064991e-03</internalNodes>
+          <leafValues>
+            -1.0996829718351364e-01 1.3480730354785919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1518 -8.7792202830314636e-02</internalNodes>
+          <leafValues>
+            -6.8317967653274536e-01 1.0834610089659691e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1519 3.0390409752726555e-02</internalNodes>
+          <leafValues>
+            -4.2450569570064545e-02 3.0770599842071533e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1520 -5.1566340029239655e-02</internalNodes>
+          <leafValues>
+            -6.2840008735656738e-01 9.7069833427667618e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1521 -4.2446999577805400e-04</internalNodes>
+          <leafValues>
+            8.4595613181591034e-02 -1.8075129389762878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1522 -1.2135359644889832e-01</internalNodes>
+          <leafValues>
+            -1.2717489898204803e-01 9.6575058996677399e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1523 -1.5150560066103935e-02</internalNodes>
+          <leafValues>
+            9.3037553131580353e-02 -1.3127900660037994e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1524 3.9446409791707993e-02</internalNodes>
+          <leafValues>
+            2.5543639436364174e-02 -1.1460640281438828e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1525 -8.2465475425124168e-03</internalNodes>
+          <leafValues>
+            2.4008710682392120e-01 -5.1680248230695724e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1526 3.5262361168861389e-02</internalNodes>
+          <leafValues>
+            -3.3555049449205399e-02 2.0575499534606934e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1527 1.1703060008585453e-02</internalNodes>
+          <leafValues>
+            2.3529250174760818e-02 -4.9983900785446167e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1528 4.2969968169927597e-02</internalNodes>
+          <leafValues>
+            -1.2683330103754997e-02 5.4043388366699219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1529 -1.5811799094080925e-02</internalNodes>
+          <leafValues>
+            3.9564150571823120e-01 -3.5568390041589737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1530 4.6253358013927937e-03</internalNodes>
+          <leafValues>
+            5.2370540797710419e-02 -2.2989930212497711e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1531 -1.5898230485618114e-03</internalNodes>
+          <leafValues>
+            1.3792009651660919e-01 -8.6783193051815033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1532 6.2329089269042015e-04</internalNodes>
+          <leafValues>
+            -8.6643829941749573e-02 5.7710029184818268e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1533 7.0994929410517216e-03</internalNodes>
+          <leafValues>
+            7.5797617435455322e-02 -1.6898870468139648e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1534 6.9608777761459351e-02</internalNodes>
+          <leafValues>
+            -1.2454699724912643e-02 2.0845200121402740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1535 -1.8759520724415779e-02</internalNodes>
+          <leafValues>
+            -5.5008620023727417e-01 2.1040279418230057e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1536 4.6513788402080536e-02</internalNodes>
+          <leafValues>
+            -2.5904009118676186e-02 1.8322019279003143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1537 2.1638579666614532e-02</internalNodes>
+          <leafValues>
+            -3.8873910903930664e-02 2.9919698834419250e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1538 -7.6772570610046387e-02</internalNodes>
+          <leafValues>
+            -1. 3.9020550902932882e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1539 4.0535528212785721e-02</internalNodes>
+          <leafValues>
+            1.8880680203437805e-02 -6.6033887863159180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1540 4.0338758379220963e-02</internalNodes>
+          <leafValues>
+            9.2877401039004326e-03 -3.4422031044960022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1541 4.3404240161180496e-02</internalNodes>
+          <leafValues>
+            -2.2111779078841209e-02 5.1227712631225586e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1542 1.6895130276679993e-02</internalNodes>
+          <leafValues>
+            3.0058480799198151e-02 -1.8648600578308105e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1543 3.0269259586930275e-03</internalNodes>
+          <leafValues>
+            -1.3979099690914154e-01 8.7544560432434082e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1544 -3.7171840667724609e-01</internalNodes>
+          <leafValues>
+            -2.9676678776741028e-01 1.6241550445556641e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1545 -2.5798739865422249e-02</internalNodes>
+          <leafValues>
+            -4.3713501095771790e-01 2.6768149808049202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1546 -9.0826600790023804e-03</internalNodes>
+          <leafValues>
+            9.9548496305942535e-02 -3.8500539958477020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1547 -1.7977179959416389e-03</internalNodes>
+          <leafValues>
+            1.3810199499130249e-01 -7.5387232005596161e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1548 1.2435699999332428e-01</internalNodes>
+          <leafValues>
+            4.6064029447734356e-03 -3.6909800767898560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1549 -1.2901489622890949e-02</internalNodes>
+          <leafValues>
+            -2.0433300733566284e-01 5.3133610635995865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1550 -1.3352099806070328e-02</internalNodes>
+          <leafValues>
+            -1.0512170195579529e-01 5.9746239334344864e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1551 -3.0650520697236061e-02</internalNodes>
+          <leafValues>
+            3.4366500377655029e-01 -3.9617810398340225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1552 2.0778391044586897e-03</internalNodes>
+          <leafValues>
+            -5.0755288451910019e-02 7.2930753231048584e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1553 -6.1161179095506668e-02</internalNodes>
+          <leafValues>
+            7.8371667861938477e-01 -1.3940130360424519e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1554 -6.6681973636150360e-02</internalNodes>
+          <leafValues>
+            -6.7010307312011719e-01 4.2770858854055405e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1555 2.7359850704669952e-02</internalNodes>
+          <leafValues>
+            2.4253180250525475e-02 -4.2671859264373779e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1556 -2.4731201119720936e-03</internalNodes>
+          <leafValues>
+            9.6493236720561981e-02 -5.7433839887380600e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1557 -1.0721489787101746e-02</internalNodes>
+          <leafValues>
+            -2.1575610339641571e-01 4.4256970286369324e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1558 -1.3936980068683624e-01</internalNodes>
+          <leafValues>
+            -3.6377531290054321e-01 1.0005139745771885e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1559 -5.6867711246013641e-02</internalNodes>
+          <leafValues>
+            3.0327269434928894e-01 -3.7230789661407471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1560 -6.5776512026786804e-02</internalNodes>
+          <leafValues>
+            -1. 1.2443619780242443e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1561 -1.5500129666179419e-03</internalNodes>
+          <leafValues>
+            1.2898580729961395e-01 -8.5528247058391571e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1562 8.7909551803022623e-04</internalNodes>
+          <leafValues>
+            -7.9906381666660309e-02 1.2847130000591278e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1563 2.9614660888910294e-03</internalNodes>
+          <leafValues>
+            8.9433841407299042e-02 -1.7047980427742004e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1564 -5.0735038518905640e-01</internalNodes>
+          <leafValues>
+            -8.4197628498077393e-01 2.3592109791934490e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1565 3.5409200936555862e-02</internalNodes>
+          <leafValues>
+            1.7137490212917328e-02 -5.9052079916000366e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1566 -4.6220239251852036e-02</internalNodes>
+          <leafValues>
+            4.7383689880371094e-01 -1.1423089541494846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1567 4.0875099599361420e-02</internalNodes>
+          <leafValues>
+            -2.6714079082012177e-02 4.2139878869056702e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1568 -5.7651810348033905e-02</internalNodes>
+          <leafValues>
+            5.6021291017532349e-01 -9.5757292583584785e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1569 3.3733060117810965e-03</internalNodes>
+          <leafValues>
+            7.2323620319366455e-02 -1.5510480105876923e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1570 -3.4096160531044006e-01</internalNodes>
+          <leafValues>
+            -1. -3.1605950789526105e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1571 -5.5850511416792870e-03</internalNodes>
+          <leafValues>
+            -1.5768070518970490e-01 7.3625743389129639e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1572 -1.1067239940166473e-01</internalNodes>
+          <leafValues>
+            2.3640440404415131e-01 -1.2670779600739479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1573 4.3246410787105560e-02</internalNodes>
+          <leafValues>
+            -4.9346420913934708e-02 3.0113101005554199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1574 -5.8916499838232994e-03</internalNodes>
+          <leafValues>
+            -1.4727650582790375e-01 6.1345700174570084e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1575 -2.8674090572167188e-05</internalNodes>
+          <leafValues>
+            1.1539240181446075e-01 -1.4692650735378265e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1576 2.6174910366535187e-02</internalNodes>
+          <leafValues>
+            -2.2960580885410309e-02 2.1004410088062286e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1577 -1.9902619533240795e-03</internalNodes>
+          <leafValues>
+            9.7250632941722870e-02 -1.3244929909706116e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1578 -1.6960840672254562e-02</internalNodes>
+          <leafValues>
+            -3.1949061155319214e-01 3.6188289523124695e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1579 -1.5634739398956299e-01</internalNodes>
+          <leafValues>
+            3.1934529542922974e-01 -4.1917070746421814e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1580 -2.3863950371742249e-01</internalNodes>
+          <leafValues>
+            3.8183578848838806e-01 -8.6567532271146774e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1581 -7.7641502022743225e-02</internalNodes>
+          <leafValues>
+            -3.3156651258468628e-01 3.3491149544715881e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1582 -4.5257899910211563e-02</internalNodes>
+          <leafValues>
+            4.6058529615402222e-01 -3.1354859471321106e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1583 -3.3390790224075317e-02</internalNodes>
+          <leafValues>
+            -7.2974747419357300e-01 1.6206990927457809e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1584 7.3079466819763184e-02</internalNodes>
+          <leafValues>
+            -1.9201450049877167e-02 3.4011909365653992e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1585 -5.4536230862140656e-02</internalNodes>
+          <leafValues>
+            3.3227160573005676e-01 -3.3163428306579590e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1586 3.9552688598632812e-02</internalNodes>
+          <leafValues>
+            1.1817559599876404e-02 -3.2131719589233398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1587 5.9160130331292748e-04</internalNodes>
+          <leafValues>
+            -1.1766350269317627e-01 8.8002361357212067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1588 3.5379730165004730e-02</internalNodes>
+          <leafValues>
+            1.8286190927028656e-02 -1.6206890344619751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1589 2.0152490586042404e-02</internalNodes>
+          <leafValues>
+            2.2825939580798149e-02 -4.3034788966178894e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1590 -2.9185289517045021e-02</internalNodes>
+          <leafValues>
+            1.8256959319114685e-01 -1.6376309096813202e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1591 -2.1705780178308487e-02</internalNodes>
+          <leafValues>
+            -6.6977721452713013e-01 1.6782360151410103e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1592 4.2584270238876343e-02</internalNodes>
+          <leafValues>
+            -1.6852499917149544e-02 3.4360399842262268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1593 -1.2663739919662476e-01</internalNodes>
+          <leafValues>
+            2.6748588681221008e-01 -3.6107789725065231e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1594 1.4260070025920868e-01</internalNodes>
+          <leafValues>
+            1.4445270411670208e-02 -1.9729509949684143e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1595 5.3560931235551834e-02</internalNodes>
+          <leafValues>
+            1.7324799671769142e-02 -5.9609222412109375e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1596 -5.9380959719419479e-03</internalNodes>
+          <leafValues>
+            -6.5156273543834686e-02 5.9645600616931915e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1597 -6.6497321240603924e-03</internalNodes>
+          <leafValues>
+            1.4270019531250000e-01 -7.9669818282127380e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1598 -3.0137640424072742e-03</internalNodes>
+          <leafValues>
+            1.3996289670467377e-01 -9.4831757247447968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1599 -1.7213050276041031e-02</internalNodes>
+          <leafValues>
+            -1.7265740036964417e-01 6.9451652467250824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1600 1.0775709897279739e-01</internalNodes>
+          <leafValues>
+            -4.6757548116147518e-03 9.2161870002746582e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1601 5.8738540858030319e-02</internalNodes>
+          <leafValues>
+            -4.2458981275558472e-02 2.8832349181175232e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1602 -3.0475479364395142e-01</internalNodes>
+          <leafValues>
+            -1. 2.6918480216409080e-05</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1603 2.0395779609680176e-01</internalNodes>
+          <leafValues>
+            2.5317989289760590e-02 -5.0275158882141113e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1604 -9.7794281318783760e-03</internalNodes>
+          <leafValues>
+            -1.9060879945755005e-01 3.0577139928936958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1605 -2.2775499150156975e-02</internalNodes>
+          <leafValues>
+            2.7048370242118835e-01 -5.1001209765672684e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1606 9.8080374300479889e-03</internalNodes>
+          <leafValues>
+            2.4180250242352486e-02 -7.5000837445259094e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1607 -1.1130969971418381e-02</internalNodes>
+          <leafValues>
+            -2.3825749754905701e-01 6.4388722181320190e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>123</maxWeakCount>
+      <stageThreshold>-6.5824240446090698e-01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1608 -2.1380689740180969e-01</internalNodes>
+          <leafValues>
+            2.7686640620231628e-01 -9.2777818441390991e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1609 -3.3374479971826077e-03</internalNodes>
+          <leafValues>
+            1.4119230210781097e-01 -5.1907159388065338e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1610 -2.8738550841808319e-02</internalNodes>
+          <leafValues>
+            -3.6243250966072083e-01 3.1938020139932632e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1611 -3.5554158966988325e-03</internalNodes>
+          <leafValues>
+            1.1969120055437088e-01 -5.2306748926639557e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1612 -1.0732459835708141e-02</internalNodes>
+          <leafValues>
+            2.8602668642997742e-01 -6.0555059462785721e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1613 8.7310239672660828e-02</internalNodes>
+          <leafValues>
+            -3.3613391220569611e-02 4.7786781191825867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1614 2.1971999667584896e-03</internalNodes>
+          <leafValues>
+            6.0207970440387726e-02 -2.1543750166893005e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1615 -7.4302748544141650e-05</internalNodes>
+          <leafValues>
+            1.4141289889812469e-01 -1.2711560726165771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1616 -2.9314011335372925e-01</internalNodes>
+          <leafValues>
+            -5.5598288774490356e-01 7.8105749562382698e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1617 7.7996537089347839e-02</internalNodes>
+          <leafValues>
+            -2.0238140597939491e-02 2.2233769297599792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1618 4.9733570776879787e-03</internalNodes>
+          <leafValues>
+            -1.5410329401493073e-01 9.8874516785144806e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1619 -6.2232650816440582e-02</internalNodes>
+          <leafValues>
+            -2.5253909826278687e-01 2.5864329189062119e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1620 -7.4750548228621483e-03</internalNodes>
+          <leafValues>
+            -1.9071790575981140e-01 8.4528200328350067e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1621 2.2246010601520538e-02</internalNodes>
+          <leafValues>
+            -3.1024629250168800e-02 1.5289239585399628e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1622 -1.2305259704589844e-02</internalNodes>
+          <leafValues>
+            1.1693249642848969e-01 -1.1092559993267059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1623 -1.3985290424898267e-03</internalNodes>
+          <leafValues>
+            -2.0435670018196106e-01 8.7592259049415588e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1624 3.6361250281333923e-01</internalNodes>
+          <leafValues>
+            -1.8750319257378578e-02 8.5054528713226318e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1625 -3.8815739098936319e-03</internalNodes>
+          <leafValues>
+            8.0643877387046814e-02 -1.0520999878644943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1626 -5.2500631660223007e-02</internalNodes>
+          <leafValues>
+            3.8002520799636841e-01 -3.6049079149961472e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1627 -7.9602311598137021e-04</internalNodes>
+          <leafValues>
+            3.3794969320297241e-02 -7.5603879988193512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1628 -2.0066089928150177e-02</internalNodes>
+          <leafValues>
+            -4.3842989206314087e-01 3.3389199525117874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1629 -2.4233239237219095e-03</internalNodes>
+          <leafValues>
+            -9.3005247414112091e-02 4.9772828817367554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1630 -6.8737422116100788e-03</internalNodes>
+          <leafValues>
+            2.0374830067157745e-01 -5.8165848255157471e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1631 6.5535600297152996e-03</internalNodes>
+          <leafValues>
+            -7.0293396711349487e-02 1.4400149881839752e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1632 -1.6780680045485497e-02</internalNodes>
+          <leafValues>
+            -3.2226520776748657e-01 4.3717250227928162e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1633 2.5448070839047432e-02</internalNodes>
+          <leafValues>
+            4.3461918830871582e-02 -1.5376989543437958e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1634 3.4656568896025419e-03</internalNodes>
+          <leafValues>
+            -6.3119992613792419e-02 2.1394529938697815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1635 1.0132250189781189e-01</internalNodes>
+          <leafValues>
+            -1.7095830291509628e-02 1.8853299319744110e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1636 1.0714309662580490e-01</internalNodes>
+          <leafValues>
+            3.5406891256570816e-02 -3.4869039058685303e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1637 -1.4500999823212624e-02</internalNodes>
+          <leafValues>
+            3.7903580814599991e-02 -4.9169208854436874e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1638 -1.5354759991168976e-01</internalNodes>
+          <leafValues>
+            3.5048320889472961e-01 -3.2774008810520172e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1639 -6.5137587487697601e-02</internalNodes>
+          <leafValues>
+            -4.1380020976066589e-01 7.3137627914547920e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1640 -2.9204839374870062e-03</internalNodes>
+          <leafValues>
+            -1.3756680488586426e-01 9.0795390307903290e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1641 -3.4104570746421814e-01</internalNodes>
+          <leafValues>
+            -6.7252027988433838e-01 1.5200230292975903e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1642 -4.4478259951574728e-05</internalNodes>
+          <leafValues>
+            9.6579946577548981e-02 -1.0403420031070709e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1643 -1.1172229796648026e-01</internalNodes>
+          <leafValues>
+            -4.2234420776367188e-01 4.9457307904958725e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1644 2.0429869182407856e-03</internalNodes>
+          <leafValues>
+            9.9474698305130005e-02 -1.0384540259838104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1645 -7.2571309283375740e-03</internalNodes>
+          <leafValues>
+            -1.5049630403518677e-01 2.9724840074777603e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1646 -8.4451176226139069e-03</internalNodes>
+          <leafValues>
+            9.5648579299449921e-02 -1.1805369704961777e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1647 -3.0194969847798347e-02</internalNodes>
+          <leafValues>
+            4.6570628881454468e-01 -1.4386899769306183e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1648 5.7423918042331934e-04</internalNodes>
+          <leafValues>
+            -1.0382310301065445e-01 1.5052829682826996e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1649 8.2014611689373851e-04</internalNodes>
+          <leafValues>
+            -7.5132526457309723e-02 1.0363759845495224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1650 7.0748180150985718e-03</internalNodes>
+          <leafValues>
+            6.6062167286872864e-02 -1.7638419568538666e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1651 4.8304669559001923e-02</internalNodes>
+          <leafValues>
+            -1.7767660319805145e-02 2.6820158958435059e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1652 7.9041812568902969e-03</internalNodes>
+          <leafValues>
+            5.1522739231586456e-02 -2.0632369816303253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1653 8.4705486893653870e-02</internalNodes>
+          <leafValues>
+            7.2250380180776119e-03 -5.9514737129211426e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1654 3.9120440487749875e-04</internalNodes>
+          <leafValues>
+            -1.0663530230522156e-01 1.1103810369968414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1655 1.5959320589900017e-02</internalNodes>
+          <leafValues>
+            -4.8573691397905350e-02 2.5832009315490723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1656 -1.8649259582161903e-03</internalNodes>
+          <leafValues>
+            1.1551269888877869e-01 -1.5048590302467346e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1657 1.2727979570627213e-02</internalNodes>
+          <leafValues>
+            4.7930240631103516e-02 -3.0310231447219849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1658 -1.5954229747876525e-03</internalNodes>
+          <leafValues>
+            -1.5537570416927338e-01 8.3214886486530304e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1659 2.0234890282154083e-01</internalNodes>
+          <leafValues>
+            1.1625860352069139e-03 -1.0000209808349609e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1660 -3.9196871221065521e-02</internalNodes>
+          <leafValues>
+            3.0884549021720886e-01 -4.4524021446704865e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1661 1.5810640528798103e-02</internalNodes>
+          <leafValues>
+            -1.5927329659461975e-02 1.0144449770450592e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1662 -2.1568681113421917e-03</internalNodes>
+          <leafValues>
+            9.5205381512641907e-02 -1.2910960614681244e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1663 -3.4604359418153763e-02</internalNodes>
+          <leafValues>
+            2.7843558788299561e-01 -1.0775060392916203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1664 -2.6206790935248137e-03</internalNodes>
+          <leafValues>
+            -1.3744530081748962e-01 9.2945456504821777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1665 4.6692821197211742e-03</internalNodes>
+          <leafValues>
+            -5.8331821113824844e-02 1.5733839571475983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1666 7.8623533248901367e-02</internalNodes>
+          <leafValues>
+            1.1130830273032188e-02 -9.7138148546218872e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1667 3.9556730538606644e-02</internalNodes>
+          <leafValues>
+            2.1708509884774685e-03 -4.3425449728965759e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1668 4.0571438148617744e-03</internalNodes>
+          <leafValues>
+            8.6120717227458954e-02 -1.5579399466514587e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1669 -1.5014669857919216e-02</internalNodes>
+          <leafValues>
+            1.3523979485034943e-01 -2.5724019855260849e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1670 4.6183250378817320e-04</internalNodes>
+          <leafValues>
+            -1.0766889899969101e-01 1.3633869588375092e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1671 5.2875209599733353e-02</internalNodes>
+          <leafValues>
+            5.4555749520659447e-03 -3.9382910728454590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1672 -5.9510860592126846e-02</internalNodes>
+          <leafValues>
+            2.8690820932388306e-01 -4.2876079678535461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1673 1.6650360077619553e-02</internalNodes>
+          <leafValues>
+            2.8605299070477486e-02 -3.0349490046501160e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1674 1.4959629625082016e-02</internalNodes>
+          <leafValues>
+            -5.2699029445648193e-02 2.1825259923934937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1675 -9.6224267035722733e-03</internalNodes>
+          <leafValues>
+            -2.1431450545787811e-01 4.8350628465414047e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1676 -4.5304261147975922e-02</internalNodes>
+          <leafValues>
+            -8.7308478355407715e-01 1.2449770234525204e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1677 -7.4465242214500904e-03</internalNodes>
+          <leafValues>
+            -1.3586209714412689e-01 3.3087320625782013e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1678 -1.1953880311921239e-03</internalNodes>
+          <leafValues>
+            1.4848570525646210e-01 -8.5291646420955658e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1679 5.6622507981956005e-03</internalNodes>
+          <leafValues>
+            -5.3212448954582214e-02 1.2967950105667114e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1680 1.3971360400319099e-02</internalNodes>
+          <leafValues>
+            2.5338830426335335e-02 -4.2097410559654236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1681 -4.5216218568384647e-03</internalNodes>
+          <leafValues>
+            1.2621529400348663e-01 -6.3135430216789246e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1682 4.7776158899068832e-03</internalNodes>
+          <leafValues>
+            -6.2899917364120483e-02 1.7724449932575226e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1683 -5.8305878192186356e-03</internalNodes>
+          <leafValues>
+            8.7906002998352051e-02 -1.5553380548954010e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1684 -1.5879280865192413e-02</internalNodes>
+          <leafValues>
+            -1.2694430351257324e-01 1.0280299931764603e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1685 1.9526369869709015e-03</internalNodes>
+          <leafValues>
+            -7.6803453266620636e-02 4.7297749668359756e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1686 2.4521650746464729e-02</internalNodes>
+          <leafValues>
+            -2.7714680880308151e-02 4.0350469946861267e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1687 -8.4529399871826172e-02</internalNodes>
+          <leafValues>
+            1. -2.1367999725043774e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1688 1.6844070050865412e-03</internalNodes>
+          <leafValues>
+            7.4043400585651398e-02 -1.6334819793701172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1689 1.3399059884250164e-02</internalNodes>
+          <leafValues>
+            -4.2453180998563766e-02 2.4164129793643951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1690 4.4182639569044113e-02</internalNodes>
+          <leafValues>
+            1.8039569258689880e-02 -6.4396840333938599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1691 3.8327239453792572e-02</internalNodes>
+          <leafValues>
+            7.5849238783121109e-03 -3.6534211039543152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1692 2.5997089687734842e-03</internalNodes>
+          <leafValues>
+            -8.8553480803966522e-02 1.3763660192489624e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1693 1.0775480419397354e-02</internalNodes>
+          <leafValues>
+            4.5753169804811478e-02 -1.1956000328063965e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1694 -2.0433649420738220e-02</internalNodes>
+          <leafValues>
+            2.2020170092582703e-01 -5.1925841718912125e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1695 -1.2402729690074921e-01</internalNodes>
+          <leafValues>
+            8.8846582174301147e-01 -5.1234480924904346e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1696 4.7838478349149227e-03</internalNodes>
+          <leafValues>
+            5.3047031164169312e-02 -2.1085900068283081e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1697 -4.5895349234342575e-02</internalNodes>
+          <leafValues>
+            4.4482690095901489e-01 -1.5117119997739792e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1698 1.4473790302872658e-02</internalNodes>
+          <leafValues>
+            -4.5201409608125687e-02 2.3556250333786011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1699 1.8887920305132866e-03</internalNodes>
+          <leafValues>
+            7.6443381607532501e-02 -1.6385370492935181e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1700 -1.9082069396972656e-01</internalNodes>
+          <leafValues>
+            6.4662021398544312e-01 -1.8242619931697845e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1701 7.2158463299274445e-02</internalNodes>
+          <leafValues>
+            6.2836478464305401e-03 -7.4822348356246948e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1702 9.7802944947034121e-04</internalNodes>
+          <leafValues>
+            7.9063102602958679e-02 -1.3163650035858154e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1703 4.8602250171825290e-04</internalNodes>
+          <leafValues>
+            -4.2594909667968750e-02 6.9462761282920837e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1704 -1.0882800444960594e-02</internalNodes>
+          <leafValues>
+            -2.4503070116043091e-01 5.2326161414384842e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1705 1.1573769734241068e-04</internalNodes>
+          <leafValues>
+            -6.6729307174682617e-02 8.7088912725448608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1706 2.0960739348083735e-03</internalNodes>
+          <leafValues>
+            -7.6154567301273346e-02 1.3598169386386871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1707 4.3664351105690002e-02</internalNodes>
+          <leafValues>
+            8.4812156856060028e-03 -8.1097167730331421e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1708 -1.1464370181784034e-03</internalNodes>
+          <leafValues>
+            1.2721230089664459e-01 -8.4783419966697693e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1709 -5.5613541044294834e-03</internalNodes>
+          <leafValues>
+            -1.9722530245780945e-01 5.4411068558692932e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1710 3.4083850681781769e-02</internalNodes>
+          <leafValues>
+            -3.2338548451662064e-02 3.4062281250953674e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1711 5.1227081567049026e-02</internalNodes>
+          <leafValues>
+            -1.3262039981782436e-02 2.3953630030155182e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1712 3.3531729131937027e-02</internalNodes>
+          <leafValues>
+            2.0279919728636742e-02 -4.8339051008224487e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1713 1.5396219678223133e-02</internalNodes>
+          <leafValues>
+            -2.9320189729332924e-02 1.5866099298000336e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1714 -1.7550770193338394e-02</internalNodes>
+          <leafValues>
+            2.7488970756530762e-01 -3.7798319011926651e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1715 -7.5705647468566895e-02</internalNodes>
+          <leafValues>
+            -8.2214397192001343e-01 3.8814740255475044e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1716 -5.3475350141525269e-03</internalNodes>
+          <leafValues>
+            -1.6710759699344635e-01 7.7180616557598114e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1717 -3.3435279037803411e-03</internalNodes>
+          <leafValues>
+            -1.0673490166664124e-01 4.7575470060110092e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1718 1.9328270107507706e-02</internalNodes>
+          <leafValues>
+            -4.6563290059566498e-02 2.4716560542583466e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1719 8.5368983447551727e-02</internalNodes>
+          <leafValues>
+            2.3296920582652092e-02 -5.0002247095108032e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1720 2.5927850510925055e-03</internalNodes>
+          <leafValues>
+            -1.1182250082492828e-01 1.1046089977025986e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1721 -9.1061238199472427e-03</internalNodes>
+          <leafValues>
+            4.7107011079788208e-02 -5.5807661265134811e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1722 1.0170699656009674e-01</internalNodes>
+          <leafValues>
+            -1.5966609120368958e-02 6.9857317209243774e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1723 2.2854980081319809e-02</internalNodes>
+          <leafValues>
+            -1.7226219177246094e-02 1.2225689738988876e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1724 -1.6577079892158508e-02</internalNodes>
+          <leafValues>
+            -2.2225829958915710e-01 5.6578300893306732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1725 -2.3641420528292656e-02</internalNodes>
+          <leafValues>
+            -2.7734050154685974e-01 1.6076890751719475e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1726 5.6385230273008347e-03</internalNodes>
+          <leafValues>
+            4.5439280569553375e-02 -2.2549630701541901e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1727 5.7422029785811901e-03</internalNodes>
+          <leafValues>
+            -7.8568778932094574e-02 1.5234960615634918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1728 -4.3363519944250584e-04</internalNodes>
+          <leafValues>
+            9.5920950174331665e-02 -1.1274240165948868e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1729 1.0267919860780239e-02</internalNodes>
+          <leafValues>
+            -4.9332991242408752e-02 2.4810829758644104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1730 1.3865719549357891e-02</internalNodes>
+          <leafValues>
+            7.0547938346862793e-02 -1.8594330549240112e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>127</maxWeakCount>
+      <stageThreshold>-3.0620599746704102e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1731 -4.6980630606412888e-02</internalNodes>
+          <leafValues>
+            1.7078550159931183e-01 -1.5687310695648193e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1732 -1.1967960000038147e-01</internalNodes>
+          <leafValues>
+            5.1738417148590088e-01 -1.1747590266168118e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1733 -2.8477180749177933e-02</internalNodes>
+          <leafValues>
+            2.3505200445652008e-01 -5.7424411177635193e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1734 1.9697479903697968e-01</internalNodes>
+          <leafValues>
+            -9.3123828992247581e-04 1.0037239789962769e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1735 7.9039083793759346e-03</internalNodes>
+          <leafValues>
+            8.3357498049736023e-02 -1.6527499258518219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1736 3.9338979870080948e-02</internalNodes>
+          <leafValues>
+            -6.5605872077867389e-04 3.2361468672752380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1737 -1.5762429684400558e-03</internalNodes>
+          <leafValues>
+            9.1129466891288757e-02 -1.4164330065250397e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1738 2.0851049339398742e-04</internalNodes>
+          <leafValues>
+            -1.3802680373191833e-01 7.7212989330291748e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1739 -2.6843539671972394e-04</internalNodes>
+          <leafValues>
+            1.3646720349788666e-01 -9.4255752861499786e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1740 8.8506387546658516e-03</internalNodes>
+          <leafValues>
+            2.4603420868515968e-02 -1.6884680092334747e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1741 -8.4813922876492143e-04</internalNodes>
+          <leafValues>
+            -1.3972400128841400e-01 1.1566729843616486e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1742 -3.7090150726726279e-05</internalNodes>
+          <leafValues>
+            7.5284272432327271e-02 -1.7708149552345276e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1743 -2.1533910185098648e-02</internalNodes>
+          <leafValues>
+            2.0233030617237091e-01 -6.6978476941585541e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1744 1.1713660322129726e-02</internalNodes>
+          <leafValues>
+            8.6853489279747009e-02 -1.1251810193061829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1745 -9.8365638405084610e-03</internalNodes>
+          <leafValues>
+            3.0164790153503418e-01 -5.0179660320281982e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1746 -6.2104999087750912e-03</internalNodes>
+          <leafValues>
+            6.8224228918552399e-02 -9.4441823661327362e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1747 -2.0034300163388252e-02</internalNodes>
+          <leafValues>
+            -2.8657549619674683e-01 4.5728500932455063e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1748 -2.2154829639475793e-04</internalNodes>
+          <leafValues>
+            7.1603760123252869e-02 -8.7115049362182617e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1749 -5.2436119876801968e-03</internalNodes>
+          <leafValues>
+            1.3439500331878662e-01 -9.0288907289505005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1750 -1.1711229570209980e-02</internalNodes>
+          <leafValues>
+            1.4874699711799622e-01 -2.5951780378818512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1751 5.8587929233908653e-03</internalNodes>
+          <leafValues>
+            -6.6982023417949677e-02 1.8096329271793365e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1752 1.0432569682598114e-01</internalNodes>
+          <leafValues>
+            1.0209330357611179e-02 -7.9540812969207764e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1753 -1.7049130052328110e-02</internalNodes>
+          <leafValues>
+            -2.0516310632228851e-01 6.4470991492271423e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1754 2.5877699255943298e-02</internalNodes>
+          <leafValues>
+            -3.0079720541834831e-02 1.6041970252990723e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1755 -4.0637338533997536e-03</internalNodes>
+          <leafValues>
+            1.0870960354804993e-01 -1.1665400117635727e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1756 -1.9286720082163811e-02</internalNodes>
+          <leafValues>
+            -1.2503950297832489e-01 2.8055189177393913e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1757 -7.2130301305151079e-06</internalNodes>
+          <leafValues>
+            1.1845260113477707e-01 -1.2367019802331924e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1758 -2.6098350062966347e-03</internalNodes>
+          <leafValues>
+            -1.4498670399188995e-01 8.2318760454654694e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1759 3.2303779153153300e-04</internalNodes>
+          <leafValues>
+            -9.5855496823787689e-02 1.1992660164833069e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1760 -1.1308960383757949e-03</internalNodes>
+          <leafValues>
+            1.2882959842681885e-01 -8.2697473466396332e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1761 1.7176469787955284e-02</internalNodes>
+          <leafValues>
+            3.6024659872055054e-02 -3.0873811244964600e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1762 -1.0515330359339714e-02</internalNodes>
+          <leafValues>
+            9.6330337226390839e-02 -1.0785780102014542e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1763 5.0583500415086746e-02</internalNodes>
+          <leafValues>
+            -3.4715801477432251e-02 4.5134508609771729e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1764 8.7582931155338883e-04</internalNodes>
+          <leafValues>
+            -9.5677152276039124e-02 7.3631688952445984e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1765 -3.1957220286130905e-02</internalNodes>
+          <leafValues>
+            -3.1473490595817566e-01 3.6329280585050583e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1766 5.9863331262022257e-04</internalNodes>
+          <leafValues>
+            -4.2676690965890884e-02 5.4342899471521378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1767 -6.6270949319005013e-03</internalNodes>
+          <leafValues>
+            7.3510922491550446e-02 -1.7309080064296722e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1768 -7.3186516761779785e-02</internalNodes>
+          <leafValues>
+            6.8777692317962646e-01 -5.6781149469316006e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1769 2.0290840417146683e-02</internalNodes>
+          <leafValues>
+            -4.0720541030168533e-02 3.0450868606567383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1770 -3.0989840161055326e-03</internalNodes>
+          <leafValues>
+            -1.2787370383739471e-01 5.4329689592123032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1771 -1.1258859885856509e-03</internalNodes>
+          <leafValues>
+            1.1980079859495163e-01 -8.3477236330509186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1772 3.9993048994801939e-04</internalNodes>
+          <leafValues>
+            -9.5427073538303375e-02 7.6952911913394928e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1773 1.1202540248632431e-02</internalNodes>
+          <leafValues>
+            2.5125309824943542e-02 -4.0314701199531555e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1774 -2.1753970533609390e-02</internalNodes>
+          <leafValues>
+            -2.3042400181293488e-01 1.5338519588112831e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1775 7.6912459917366505e-05</internalNodes>
+          <leafValues>
+            -9.5581486821174622e-02 1.0388170182704926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1776 9.1011539101600647e-02</internalNodes>
+          <leafValues>
+            -8.7168300524353981e-03 7.5593751668930054e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1777 -4.3160789646208286e-03</internalNodes>
+          <leafValues>
+            1.3494439423084259e-01 -7.0152096450328827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1778 -5.0581190735101700e-02</internalNodes>
+          <leafValues>
+            -6.6112691164016724e-01 2.2676400840282440e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1779 -8.3926003426313400e-03</internalNodes>
+          <leafValues>
+            -1.2883609533309937e-01 7.7920481562614441e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1780 5.5040661245584488e-02</internalNodes>
+          <leafValues>
+            7.7853789553046227e-03 -2.7820050716400146e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1781 -4.1862551122903824e-02</internalNodes>
+          <leafValues>
+            4.3335449695587158e-01 -2.9194639995694160e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1782 -7.4230520986020565e-03</internalNodes>
+          <leafValues>
+            1.3154500722885132e-01 -3.2047510147094727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1783 1.9948489498347044e-03</internalNodes>
+          <leafValues>
+            8.3299688994884491e-02 -1.1662559956312180e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1784 4.1851431131362915e-02</internalNodes>
+          <leafValues>
+            4.1461169719696045e-02 -1.2815159559249878e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1785 2.7844381332397461e-01</internalNodes>
+          <leafValues>
+            -2.2612810134887695e-02 5.2236318588256836e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1786 -7.1095931343734264e-03</internalNodes>
+          <leafValues>
+            1.2902510166168213e-01 -2.7944799512624741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1787 1.1175610125064850e-02</internalNodes>
+          <leafValues>
+            5.1366660743951797e-02 -1.9559539854526520e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1788 -1.0364210233092308e-02</internalNodes>
+          <leafValues>
+            -7.2631381452083588e-02 1.5199509263038635e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1789 -9.4094304367899895e-03</internalNodes>
+          <leafValues>
+            -2.0993369817733765e-01 5.3346861153841019e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1790 -1.0375010222196579e-01</internalNodes>
+          <leafValues>
+            -3.3693191409111023e-01 3.9442018605768681e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1791 -9.5977628370746970e-04</internalNodes>
+          <leafValues>
+            1.0307610034942627e-01 -1.0574100166559219e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1792 -5.5816810578107834e-02</internalNodes>
+          <leafValues>
+            2.6074001193046570e-01 -4.4885180890560150e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1793 -1.3430939614772797e-01</internalNodes>
+          <leafValues>
+            -8.1660747528076172e-01 1.5410860069096088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1794 6.0456950217485428e-02</internalNodes>
+          <leafValues>
+            -3.0265029054135084e-03 -9.9991780519485474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1795 2.4359079077839851e-02</internalNodes>
+          <leafValues>
+            2.4191310629248619e-02 -4.6632158756256104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1796 5.2735779434442520e-02</internalNodes>
+          <leafValues>
+            -2.4266760796308517e-02 2.1460479497909546e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1797 -5.5626039393246174e-03</internalNodes>
+          <leafValues>
+            1.0879939794540405e-01 -1.2120909988880157e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1798 9.0855263173580170e-02</internalNodes>
+          <leafValues>
+            1.0956900223391131e-04 -9.9975770711898804e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1799 -3.4681189805269241e-02</internalNodes>
+          <leafValues>
+            -4.5409980416297913e-01 2.3691149428486824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1800 -2.9579090551123954e-05</internalNodes>
+          <leafValues>
+            4.8031318932771683e-02 -4.9872968345880508e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1801 2.6277130469679832e-02</internalNodes>
+          <leafValues>
+            -2.9456760734319687e-02 3.3974370360374451e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1802 -4.6276021748781204e-02</internalNodes>
+          <leafValues>
+            4.5496609807014465e-01 -1.0359579697251320e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1803 1.2048200005665421e-04</internalNodes>
+          <leafValues>
+            -1.0575199872255325e-01 1.0096730291843414e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1804 6.8154390901327133e-03</internalNodes>
+          <leafValues>
+            2.8495609760284424e-02 -9.9765069782733917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1805 1.6169620212167501e-03</internalNodes>
+          <leafValues>
+            -1.3256169855594635e-01 8.7828978896141052e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1806 1.4563379809260368e-02</internalNodes>
+          <leafValues>
+            -4.3079901486635208e-02 2.5113260746002197e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1807 2.0352909341454506e-02</internalNodes>
+          <leafValues>
+            3.9463639259338379e-02 -3.2518970966339111e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1808 -2.0789269357919693e-02</internalNodes>
+          <leafValues>
+            1.8993359804153442e-01 -2.1271999925374985e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1809 3.1780101358890533e-02</internalNodes>
+          <leafValues>
+            -2.3768220096826553e-02 4.3957829475402832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1810 1.2459229677915573e-01</internalNodes>
+          <leafValues>
+            6.5275398083031178e-03 -9.9991798400878906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1811 -8.4007039666175842e-02</internalNodes>
+          <leafValues>
+            -3.5620281100273132e-01 2.8916560113430023e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1812 9.6772145479917526e-03</internalNodes>
+          <leafValues>
+            6.4073942601680756e-02 -1.5482710301876068e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1813 1.0405039787292480e-01</internalNodes>
+          <leafValues>
+            -2.2652050480246544e-02 5.7623207569122314e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1814 4.0814410895109177e-02</internalNodes>
+          <leafValues>
+            -3.7368569523096085e-02 7.7298507094383240e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1815 -4.6916189789772034e-01</internalNodes>
+          <leafValues>
+            -7.7304631471633911e-01 1.3607080094516277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1816 -1.3723419606685638e-01</internalNodes>
+          <leafValues>
+            -1. -1.7328710528090596e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1817 3.7569448351860046e-02</internalNodes>
+          <leafValues>
+            3.1412709504365921e-02 -3.5512429475784302e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1818 -1.2645379640161991e-02</internalNodes>
+          <leafValues>
+            -7.1322880685329437e-02 4.1889548301696777e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1819 3.9933860301971436e-02</internalNodes>
+          <leafValues>
+            -3.3447001129388809e-02 3.5932940244674683e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1820 1.7207439988851547e-02</internalNodes>
+          <leafValues>
+            2.6126530021429062e-02 -7.7634379267692566e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1821 5.9702228754758835e-02</internalNodes>
+          <leafValues>
+            -2.3717980831861496e-02 5.7321798801422119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1822 7.9917803406715393e-02</internalNodes>
+          <leafValues>
+            -9.7547564655542374e-03 4.3467441201210022e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1823 1.1351720243692398e-01</internalNodes>
+          <leafValues>
+            -3.8921970874071121e-02 2.6120808720588684e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1824 4.8379451036453247e-01</internalNodes>
+          <leafValues>
+            7.8452667221426964e-03 -6.5024161338806152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1825 -1.0045070201158524e-01</internalNodes>
+          <leafValues>
+            -8.0072021484375000e-01 1.2250199913978577e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1826 2.7176019549369812e-01</internalNodes>
+          <leafValues>
+            4.4636582024395466e-03 -6.9393122196197510e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1827 -1.2301249802112579e-01</internalNodes>
+          <leafValues>
+            3.2483839988708496e-01 -3.3841550350189209e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1828 6.1188749969005585e-02</internalNodes>
+          <leafValues>
+            7.1536018513143063e-03 -7.7817517518997192e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1829 -7.8828241676092148e-03</internalNodes>
+          <leafValues>
+            -1.9754239916801453e-01 6.7795433104038239e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1830 -2.5584879517555237e-01</internalNodes>
+          <leafValues>
+            -1. 1.4300020411610603e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1831 1.3098469376564026e-01</internalNodes>
+          <leafValues>
+            -1.6668310388922691e-02 7.4547207355499268e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1832 -8.4553077816963196e-02</internalNodes>
+          <leafValues>
+            -6.3423901796340942e-01 8.3142798393964767e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1833 -8.8297717273235321e-02</internalNodes>
+          <leafValues>
+            -8.5705971717834473e-01 1.0549940168857574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1834 -1.0374879837036133e-01</internalNodes>
+          <leafValues>
+            1.2073180079460144e-01 -2.2488579154014587e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1835 1.4872249448671937e-03</internalNodes>
+          <leafValues>
+            -1.1096440255641937e-01 1.0405410081148148e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1836 2.1364030241966248e-01</internalNodes>
+          <leafValues>
+            7.3841079138219357e-03 -4.9760338664054871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1837 2.6294309645891190e-02</internalNodes>
+          <leafValues>
+            -6.3212700188159943e-02 2.6284760236740112e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1838 -2.6777000166475773e-03</internalNodes>
+          <leafValues>
+            5.6488350033760071e-02 -1.0174310207366943e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1839 -2.1261540241539478e-03</internalNodes>
+          <leafValues>
+            -1.6442880034446716e-01 6.6159963607788086e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1840 -8.2200914621353149e-03</internalNodes>
+          <leafValues>
+            -1.6132779419422150e-01 8.3515472710132599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1841 -1.1701880022883415e-02</internalNodes>
+          <leafValues>
+            2.1516199409961700e-01 -5.9116050601005554e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1842 -7.0460740244016051e-04</internalNodes>
+          <leafValues>
+            9.6142299473285675e-02 -1.3008759915828705e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1843 -1.9671309273689985e-03</internalNodes>
+          <leafValues>
+            1.2605039775371552e-01 -8.8542640209197998e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1844 -9.5004076138138771e-03</internalNodes>
+          <leafValues>
+            -2.3604579269886017e-01 4.5922629535198212e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1845 2.6802370324730873e-02</internalNodes>
+          <leafValues>
+            -4.8966769129037857e-02 2.3887130618095398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1846 2.2177420556545258e-02</internalNodes>
+          <leafValues>
+            -1.2560590170323849e-02 2.7084270119667053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1847 9.3382880091667175e-02</internalNodes>
+          <leafValues>
+            3.3835850656032562e-02 -3.9707890152931213e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1848 -1.3151080347597599e-02</internalNodes>
+          <leafValues>
+            -1.1364260315895081e-01 2.5930739939212799e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1849 2.6929581072181463e-03</internalNodes>
+          <leafValues>
+            6.8202346563339233e-02 -1.6290910542011261e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1850 -5.7519129477441311e-03</internalNodes>
+          <leafValues>
+            1.3197720050811768e-01 -5.7711899280548096e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1851 -1.1071159970015287e-03</internalNodes>
+          <leafValues>
+            1.4550089836120605e-01 -7.7300041913986206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1852 3.1805180013179779e-02</internalNodes>
+          <leafValues>
+            1.4181279577314854e-02 -2.1803429722785950e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1853 4.0729498863220215e-01</internalNodes>
+          <leafValues>
+            -1.3772940263152122e-02 7.4853348731994629e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1854 7.0173077285289764e-02</internalNodes>
+          <leafValues>
+            1.1535810306668282e-02 -8.6094629764556885e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1855 -1.9437450100667775e-04</internalNodes>
+          <leafValues>
+            6.3009992241859436e-02 -1.5111440420150757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1856 3.9425559341907501e-02</internalNodes>
+          <leafValues>
+            2.4115329608321190e-02 -4.7253820300102234e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1857 2.6128459721803665e-03</internalNodes>
+          <leafValues>
+            5.3963150829076767e-02 -1.7429760098457336e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>152</maxWeakCount>
+      <stageThreshold>-3.0691600799560547e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 1858 1.0468430072069168e-01</internalNodes>
+          <leafValues>
+            -4.7570109367370605e-02 4.2454048991203308e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1859 -4.2946420609951019e-02</internalNodes>
+          <leafValues>
+            1.6328890621662140e-01 -1.2655169703066349e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1860 -8.1577729433774948e-03</internalNodes>
+          <leafValues>
+            1.0235799849033356e-01 -1.0876630246639252e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1861 2.1813691128045321e-03</internalNodes>
+          <leafValues>
+            8.7985247373580933e-02 -5.5899761617183685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1862 -6.5157511271536350e-03</internalNodes>
+          <leafValues>
+            8.2863852381706238e-02 -1.3736319541931152e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1863 2.4716500192880630e-02</internalNodes>
+          <leafValues>
+            1.6755210235714912e-02 1.3371250033378601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1864 -5.9396267170086503e-04</internalNodes>
+          <leafValues>
+            -1.3771370053291321e-01 1.0501290112733841e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1865 2.9373820871114731e-02</internalNodes>
+          <leafValues>
+            -4.4581398367881775e-02 4.2731860280036926e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1866 -1.6576919704675674e-02</internalNodes>
+          <leafValues>
+            -2.9827460646629333e-01 2.9718369245529175e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1867 9.4569493085145950e-03</internalNodes>
+          <leafValues>
+            5.3616948425769806e-02 -7.6675526797771454e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1868 7.4581913650035858e-02</internalNodes>
+          <leafValues>
+            -4.6554408967494965e-02 3.0179610848426819e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1869 -3.8055621087551117e-02</internalNodes>
+          <leafValues>
+            -2.8255119919776917e-01 2.0355690270662308e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1870 1.1065539903938770e-02</internalNodes>
+          <leafValues>
+            -5.3942598402500153e-02 2.3132629692554474e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1871 1.3538219965994358e-02</internalNodes>
+          <leafValues>
+            2.8102980926632881e-02 -2.1802890300750732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1872 4.6914750710129738e-03</internalNodes>
+          <leafValues>
+            6.3617020845413208e-02 -1.7460820078849792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1873 4.3054440617561340e-01</internalNodes>
+          <leafValues>
+            -2.1062379702925682e-02 5.7197797298431396e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1874 1.4298999449238181e-03</internalNodes>
+          <leafValues>
+            -1.6780039668083191e-01 7.6851062476634979e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1875 2.7855230495333672e-02</internalNodes>
+          <leafValues>
+            -3.5647969692945480e-02 2.8956910967826843e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1876 1.4391670003533363e-02</internalNodes>
+          <leafValues>
+            8.3300426602363586e-02 -1.2951320409774780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1877 -7.7637381851673126e-02</internalNodes>
+          <leafValues>
+            -1. 8.1426621181890368e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1878 1.6051199287176132e-02</internalNodes>
+          <leafValues>
+            -5.4008588194847107e-02 2.1967799961566925e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1879 -7.0988729596138000e-02</internalNodes>
+          <leafValues>
+            6.1602139472961426e-01 -1.6476400196552277e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1880 -5.8310989290475845e-02</internalNodes>
+          <leafValues>
+            -9.5955359935760498e-01 1.2517100200057030e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1881 -7.9547446221113205e-03</internalNodes>
+          <leafValues>
+            -9.3684002757072449e-02 3.3896960318088531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1882 -4.9685798585414886e-02</internalNodes>
+          <leafValues>
+            3.1466799974441528e-01 -2.9716050252318382e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1883 9.7751528024673462e-02</internalNodes>
+          <leafValues>
+            7.5905729318037629e-04 -6.7009872198104858e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1884 7.5908802449703217e-02</internalNodes>
+          <leafValues>
+            1.6073329374194145e-02 -6.6251361370086670e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1885 1.3333460083231330e-03</internalNodes>
+          <leafValues>
+            5.2241399884223938e-02 -1.8808710575103760e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1886 6.9728610105812550e-04</internalNodes>
+          <leafValues>
+            -8.9044801890850067e-02 1.6642339527606964e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1887 2.0889509469270706e-02</internalNodes>
+          <leafValues>
+            2.1368719637393951e-02 -1.6083440184593201e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1888 -1.7649700166657567e-03</internalNodes>
+          <leafValues>
+            1.2398529797792435e-01 -8.5922397673130035e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1889 2.7779850643128157e-03</internalNodes>
+          <leafValues>
+            -4.4366151094436646e-02 2.9322549700737000e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1890 7.9974532127380371e-04</internalNodes>
+          <leafValues>
+            -1.2351520359516144e-01 8.8818296790122986e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1891 7.0215959567576647e-04</internalNodes>
+          <leafValues>
+            -8.0154180526733398e-02 1.4544290304183960e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1892 -4.0604420006275177e-02</internalNodes>
+          <leafValues>
+            -3.6047580838203430e-01 3.4314859658479691e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1893 -4.1686851531267166e-02</internalNodes>
+          <leafValues>
+            -2.0927760004997253e-01 8.5808392614126205e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1894 -4.6390198171138763e-02</internalNodes>
+          <leafValues>
+            5.3768527507781982e-01 -2.2632500156760216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1895 -1.5822030603885651e-01</internalNodes>
+          <leafValues>
+            -1. 1.4312319690361619e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1896 -7.5683370232582092e-02</internalNodes>
+          <leafValues>
+            -8.0503028631210327e-01 1.2843839824199677e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1897 -5.7808328419923782e-02</internalNodes>
+          <leafValues>
+            3.8675680756568909e-01 -1.2630320154130459e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1898 -4.5112581574358046e-05</internalNodes>
+          <leafValues>
+            7.4958987534046173e-02 -1.3433749973773956e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1899 3.9205480366945267e-02</internalNodes>
+          <leafValues>
+            2.1980579942464828e-02 -4.5748621225357056e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1900 4.4945240020751953e-02</internalNodes>
+          <leafValues>
+            -2.3763459175825119e-02 4.8715281486511230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1901 -5.7849191129207611e-02</internalNodes>
+          <leafValues>
+            3.5563638806343079e-01 -6.2380530871450901e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1902 -1.0397239774465561e-01</internalNodes>
+          <leafValues>
+            -6.2262791395187378e-01 1.5022880397737026e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1903 -2.5238281488418579e-01</internalNodes>
+          <leafValues>
+            -5.9059482812881470e-01 -1.9238379900343716e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1904 1.9675880670547485e-01</internalNodes>
+          <leafValues>
+            1.2625159695744514e-02 -7.2753208875656128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1905 3.7412419915199280e-02</internalNodes>
+          <leafValues>
+            -2.3478340357542038e-02 1.2147639691829681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1906 -8.0470675602555275e-03</internalNodes>
+          <leafValues>
+            -1.8167789280414581e-01 4.9743499606847763e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1907 4.1297491639852524e-02</internalNodes>
+          <leafValues>
+            1.0259049944579601e-02 -1.4679500460624695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1908 -5.0735730677843094e-02</internalNodes>
+          <leafValues>
+            2.2679640352725983e-01 -4.9807049334049225e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1909 -3.6145109334029257e-04</internalNodes>
+          <leafValues>
+            4.1798278689384460e-02 -7.0410832762718201e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1910 -1.2359450012445450e-01</internalNodes>
+          <leafValues>
+            5.8283501863479614e-01 -1.6822429373860359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1911 5.7071618735790253e-02</internalNodes>
+          <leafValues>
+            -4.0532071143388748e-02 1.7078270018100739e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1912 5.8561540208756924e-03</internalNodes>
+          <leafValues>
+            -1.3827900588512421e-01 8.2565233111381531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1913 -1.1472850292921066e-01</internalNodes>
+          <leafValues>
+            -4.6754041314125061e-01 3.4348990302532911e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1914 2.0518699660897255e-02</internalNodes>
+          <leafValues>
+            8.1507943570613861e-02 -1.6894109547138214e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1915 5.4629769176244736e-02</internalNodes>
+          <leafValues>
+            -7.4763749726116657e-03 2.3640379309654236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1916 -6.9312967360019684e-02</internalNodes>
+          <leafValues>
+            3.0071571469306946e-01 -3.4785300493240356e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1917 -7.4176848866045475e-03</internalNodes>
+          <leafValues>
+            -2.8766560554504395e-01 4.7531820833683014e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1918 1.0223260149359703e-02</internalNodes>
+          <leafValues>
+            -3.0834799632430077e-02 3.9249539375305176e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1919 -2.7346659451723099e-02</internalNodes>
+          <leafValues>
+            -1.5695489943027496e-01 1.3967529870569706e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1920 3.3875100314617157e-02</internalNodes>
+          <leafValues>
+            2.6063309982419014e-02 -3.9006409049034119e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1921 4.5174721628427505e-02</internalNodes>
+          <leafValues>
+            8.9199207723140717e-03 -5.6769150495529175e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1922 1.1488229967653751e-02</internalNodes>
+          <leafValues>
+            -4.5491419732570648e-02 2.5109928846359253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1923 -1.0496149770915508e-02</internalNodes>
+          <leafValues>
+            6.4895443618297577e-02 -1.0623539984226227e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1924 6.0881208628416061e-03</internalNodes>
+          <leafValues>
+            8.0929182469844818e-02 -1.4776149392127991e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1925 -2.6524660643190145e-03</internalNodes>
+          <leafValues>
+            1.2062519788742065e-01 -7.2674863040447235e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1926 2.3559860419481993e-03</internalNodes>
+          <leafValues>
+            -8.1811271607875824e-02 1.4126540720462799e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1927 -2.6777219772338867e-01</internalNodes>
+          <leafValues>
+            -7.8083831071853638e-01 4.4526048004627228e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1928 1.5965799987316132e-01</internalNodes>
+          <leafValues>
+            2.8381649404764175e-02 -3.8967838883399963e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1929 5.1899369806051254e-02</internalNodes>
+          <leafValues>
+            -3.4305319190025330e-02 1.5921010076999664e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1930 -1.3652780326083302e-03</internalNodes>
+          <leafValues>
+            -1.3755479454994202e-01 7.2719998657703400e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1931 2.2497299313545227e-01</internalNodes>
+          <leafValues>
+            -4.8017292283475399e-03 9.9994850158691406e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1932 3.1434150878340006e-03</internalNodes>
+          <leafValues>
+            5.5151570588350296e-02 -1.6643160581588745e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1933 -6.2940339557826519e-03</internalNodes>
+          <leafValues>
+            6.2896028161048889e-02 -6.0436379164457321e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1934 5.1301911473274231e-02</internalNodes>
+          <leafValues>
+            -3.1671810895204544e-02 3.8534939289093018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1935 -6.6980808973312378e-02</internalNodes>
+          <leafValues>
+            -1.0925900191068649e-01 8.9958757162094116e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1936 5.1464758813381195e-02</internalNodes>
+          <leafValues>
+            2.6210019364953041e-02 -4.2159339785575867e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1937 -9.0982139110565186e-02</internalNodes>
+          <leafValues>
+            3.2760378718376160e-01 -7.8134387731552124e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1938 5.2848970517516136e-03</internalNodes>
+          <leafValues>
+            -7.9399570822715759e-02 1.4998179674148560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1939 -1.5017699915915728e-03</internalNodes>
+          <leafValues>
+            9.7703106701374054e-02 -7.3532037436962128e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1940 -2.5415199343115091e-03</internalNodes>
+          <leafValues>
+            6.7801132798194885e-02 -1.4883249998092651e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1941 4.4252820312976837e-02</internalNodes>
+          <leafValues>
+            1.6475830227136612e-02 -2.2880180180072784e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1942 -3.3457159996032715e-02</internalNodes>
+          <leafValues>
+            4.1966789960861206e-01 -3.2553531229496002e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1943 1.3529899716377258e-01</internalNodes>
+          <leafValues>
+            9.0894084423780441e-03 -7.3839122056961060e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1944 -3.7440970540046692e-02</internalNodes>
+          <leafValues>
+            -4.2613020539283752e-01 2.3972390219569206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1945 -1.4479730452876538e-05</internalNodes>
+          <leafValues>
+            5.6783780455589294e-02 -1.5888829529285431e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1946 -1.1839280277490616e-01</internalNodes>
+          <leafValues>
+            5.0500631332397461e-01 -2.1859649568796158e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1947 -8.5000684484839439e-03</internalNodes>
+          <leafValues>
+            5.2339930087327957e-02 -4.5925021171569824e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1948 -1.4189509674906731e-02</internalNodes>
+          <leafValues>
+            -2.3597060143947601e-01 4.0358349680900574e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1949 7.3599420487880707e-02</internalNodes>
+          <leafValues>
+            3.2680039294064045e-03 -5.8853602409362793e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1950 5.4971270263195038e-02</internalNodes>
+          <leafValues>
+            -2.0196519792079926e-02 5.5482727289199829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1951 -2.2816160693764687e-02</internalNodes>
+          <leafValues>
+            -1.7589579522609711e-01 1.7851740121841431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1952 2.3204670287668705e-03</internalNodes>
+          <leafValues>
+            -8.1749923527240753e-02 1.2833079695701599e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1953 -1.0797909647226334e-01</internalNodes>
+          <leafValues>
+            -1. 1.7423679819330573e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1954 -4.1111931204795837e-02</internalNodes>
+          <leafValues>
+            5.8432698249816895e-01 -1.8878869712352753e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1955 -3.5695650149136782e-03</internalNodes>
+          <leafValues>
+            -1.7558470368385315e-01 6.4731426537036896e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1956 -6.6358670592308044e-02</internalNodes>
+          <leafValues>
+            -1. 9.2067662626504898e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1957 -1.8944580107927322e-02</internalNodes>
+          <leafValues>
+            2.5783088803291321e-01 -1.8944939598441124e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1958 -1.2871269881725311e-01</internalNodes>
+          <leafValues>
+            -5.8477258682250977e-01 1.4466489665210247e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1959 2.4218629114329815e-03</internalNodes>
+          <leafValues>
+            -7.3590897023677826e-02 7.0332102477550507e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1960 2.9718460515141487e-02</internalNodes>
+          <leafValues>
+            -2.3011969402432442e-02 4.0542769432067871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1961 1.7555029690265656e-01</internalNodes>
+          <leafValues>
+            2.0808730274438858e-02 -3.7285649776458740e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1962 3.7122450768947601e-02</internalNodes>
+          <leafValues>
+            -2.7959629893302917e-02 3.5908779501914978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1963 -3.8044541142880917e-03</internalNodes>
+          <leafValues>
+            -1.3337990641593933e-01 9.2061348259449005e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1964 -1.0930700227618217e-02</internalNodes>
+          <leafValues>
+            2.3196309804916382e-01 -4.4535879045724869e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1965 1.6103629767894745e-01</internalNodes>
+          <leafValues>
+            -8.7691349908709526e-03 2.2045169770717621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1966 2.5971230119466782e-02</internalNodes>
+          <leafValues>
+            6.4421012997627258e-02 -1.8919080495834351e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1967 1.2638209760189056e-01</internalNodes>
+          <leafValues>
+            -1.0362179949879646e-02 1.7057189345359802e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1968 -9.1393403708934784e-03</internalNodes>
+          <leafValues>
+            -1.3828249275684357e-01 8.6790062487125397e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1969 1.7722090706229210e-02</internalNodes>
+          <leafValues>
+            3.9719890803098679e-02 -1.2294259667396545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1970 -8.2425750792026520e-02</internalNodes>
+          <leafValues>
+            3.0023100972175598e-01 -3.3165920525789261e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1971 4.3892528861761093e-02</internalNodes>
+          <leafValues>
+            -1.3056339696049690e-02 9.8728686571121216e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1972 3.5575369838625193e-03</internalNodes>
+          <leafValues>
+            1.1186280101537704e-01 -9.2797823250293732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1973 -1.5298820100724697e-02</internalNodes>
+          <leafValues>
+            -1.3007879257202148e-01 2.3159010335803032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1974 -2.6504450943320990e-03</internalNodes>
+          <leafValues>
+            1.3526280224323273e-01 -7.3355458676815033e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1975 4.1636861860752106e-02</internalNodes>
+          <leafValues>
+            -1.9068980589509010e-02 3.5857999324798584e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1976 -7.5290258973836899e-03</internalNodes>
+          <leafValues>
+            -1.8672360479831696e-01 5.8248449116945267e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1977 -4.0031488984823227e-02</internalNodes>
+          <leafValues>
+            2.2969779372215271e-01 -1.4608230441808701e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1978 -1.3624709844589233e-01</internalNodes>
+          <leafValues>
+            -8.7086462974548340e-01 1.1211199685931206e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1979 4.5124008320271969e-03</internalNodes>
+          <leafValues>
+            -3.5644959658384323e-02 1.0103099793195724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1980 5.4118070751428604e-02</internalNodes>
+          <leafValues>
+            -1.4689410105347633e-02 6.7652267217636108e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1981 -3.4553959965705872e-02</internalNodes>
+          <leafValues>
+            2.1854560077190399e-01 -9.7846649587154388e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1982 -2.5520840659737587e-02</internalNodes>
+          <leafValues>
+            -4.6898001432418823e-01 2.4060370400547981e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1983 -3.5473700612783432e-02</internalNodes>
+          <leafValues>
+            1.3427549600601196e-01 -2.1438699215650558e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1984 2.8683411073870957e-04</internalNodes>
+          <leafValues>
+            -9.7300283610820770e-02 1.0760939866304398e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1985 -7.8717589378356934e-02</internalNodes>
+          <leafValues>
+            -1. 2.7187850791960955e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1986 -1.5701749362051487e-04</internalNodes>
+          <leafValues>
+            1.1199659854173660e-01 -9.9441379308700562e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1987 1.6026569530367851e-02</internalNodes>
+          <leafValues>
+            3.4198261797428131e-02 -1.9100490212440491e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1988 -1.9164729863405228e-02</internalNodes>
+          <leafValues>
+            8.9024826884269714e-02 -1.1919700354337692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1989 -3.9445150643587112e-02</internalNodes>
+          <leafValues>
+            -1.0717990249395370e-01 3.7615209817886353e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1990 2.2417430300265551e-03</internalNodes>
+          <leafValues>
+            -9.0581007301807404e-02 1.7547470331192017e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1991 -3.8842540234327316e-03</internalNodes>
+          <leafValues>
+            9.2697329819202423e-02 -4.2431369423866272e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1992 -2.1914629265666008e-02</internalNodes>
+          <leafValues>
+            -2.8017508983612061e-01 3.7537671625614166e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1993 -3.7512119859457016e-02</internalNodes>
+          <leafValues>
+            3.6218520998954773e-01 -1.7507450655102730e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1994 -8.4374047582969069e-04</internalNodes>
+          <leafValues>
+            1.2348400056362152e-01 -8.0245867371559143e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1995 -2.6424999814480543e-03</internalNodes>
+          <leafValues>
+            5.2565738558769226e-02 -8.3335436880588531e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1996 -9.2836812138557434e-02</internalNodes>
+          <leafValues>
+            -4.2060381174087524e-01 2.3360429331660271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1997 8.2463070750236511e-02</internalNodes>
+          <leafValues>
+            -2.9815400484949350e-03 7.8999197483062744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1998 -6.9864951074123383e-02</internalNodes>
+          <leafValues>
+            7.3802971839904785e-01 -1.4021299779415131e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 1999 4.5439340174198151e-02</internalNodes>
+          <leafValues>
+            -1.1321160010993481e-02 1.9973699748516083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2000 -5.0297789275646210e-02</internalNodes>
+          <leafValues>
+            6.0764670372009277e-01 -1.7632890492677689e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2001 6.0456149280071259e-02</internalNodes>
+          <leafValues>
+            -5.9354598633944988e-03 3.1622889637947083e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2002 -4.6769347973167896e-03</internalNodes>
+          <leafValues>
+            -1.8090610206127167e-01 5.9660188853740692e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2003 3.6530068609863520e-04</internalNodes>
+          <leafValues>
+            -9.1220043599605560e-02 1.1092729866504669e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2004 -1.9491260871291161e-02</internalNodes>
+          <leafValues>
+            -3.7075570225715637e-01 2.8416309505701065e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2005 2.0056450739502907e-02</internalNodes>
+          <leafValues>
+            -5.8159679174423218e-02 7.8105233609676361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2006 -3.9371181279420853e-02</internalNodes>
+          <leafValues>
+            2.9012489318847656e-01 -4.1875660419464111e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2007 2.1523650735616684e-02</internalNodes>
+          <leafValues>
+            1.6573080793023109e-02 -2.3614850640296936e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2008 -3.1294699292629957e-03</internalNodes>
+          <leafValues>
+            -1.6466400027275085e-01 6.2233809381723404e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2009 2.8589619323611259e-03</internalNodes>
+          <leafValues>
+            -3.8098409771919250e-02 5.5751629173755646e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>135</maxWeakCount>
+      <stageThreshold>-3.0609300613403320e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2010 -2.0576130598783493e-02</internalNodes>
+          <leafValues>
+            1.7351129651069641e-01 -1.5058030188083649e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2011 1.6125949099659920e-02</internalNodes>
+          <leafValues>
+            -4.1612371802330017e-02 2.3984450101852417e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2012 -1.2352580204606056e-02</internalNodes>
+          <leafValues>
+            9.7780853509902954e-02 -1.2391830235719681e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2013 -5.7473899796605110e-03</internalNodes>
+          <leafValues>
+            7.7615208923816681e-02 -9.6236728131771088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2014 2.9579061083495617e-03</internalNodes>
+          <leafValues>
+            -6.7683719098567963e-02 2.6594209671020508e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2015 -8.3472225815057755e-03</internalNodes>
+          <leafValues>
+            -1.1188179999589920e-01 1.3736370205879211e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2016 -5.8408780023455620e-04</internalNodes>
+          <leafValues>
+            4.5943111181259155e-02 -1.6486530005931854e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2017 -3.5136839142069221e-04</internalNodes>
+          <leafValues>
+            9.7791008651256561e-02 -6.4357861876487732e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2018 8.4126877482049167e-05</internalNodes>
+          <leafValues>
+            -1.3847629725933075e-01 8.8727742433547974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2019 -2.6592490077018738e-01</internalNodes>
+          <leafValues>
+            -6.7525398731231689e-01 1.6188669949769974e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2020 4.3727741576731205e-03</internalNodes>
+          <leafValues>
+            7.2884798049926758e-02 -1.2560360133647919e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2021 -2.2660531103610992e-03</internalNodes>
+          <leafValues>
+            8.7269246578216553e-02 -6.8355433642864227e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2022 -6.5290732309222221e-03</internalNodes>
+          <leafValues>
+            -1.2197560071945190e-01 8.0927930772304535e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2023 9.6436247229576111e-02</internalNodes>
+          <leafValues>
+            -8.2637304440140724e-03 4.9127399921417236e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2024 -4.3594818562269211e-02</internalNodes>
+          <leafValues>
+            4.5575308799743652e-01 -2.5600390508770943e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2025 -2.1098319441080093e-02</internalNodes>
+          <leafValues>
+            -1.1892750114202499e-01 2.3539589717984200e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2026 -2.5200019590556622e-03</internalNodes>
+          <leafValues>
+            1.2724469602108002e-01 -9.0751722455024719e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2027 -8.9241685345768929e-03</internalNodes>
+          <leafValues>
+            -1.1514320224523544e-01 4.3497029691934586e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2028 3.4590170253068209e-03</internalNodes>
+          <leafValues>
+            6.3537172973155975e-02 -1.8261429667472839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2029 -3.6076800897717476e-03</internalNodes>
+          <leafValues>
+            1.2005910277366638e-01 -5.2449110895395279e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2030 5.3778890520334244e-02</internalNodes>
+          <leafValues>
+            -1.8675789237022400e-02 5.2313017845153809e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2031 4.5245189219713211e-02</internalNodes>
+          <leafValues>
+            -1.7504919320344925e-02 2.1871849894523621e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2032 1.3272929936647415e-03</internalNodes>
+          <leafValues>
+            7.8659959137439728e-02 -1.3551670312881470e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2033 1.2393640354275703e-02</internalNodes>
+          <leafValues>
+            2.8952300548553467e-02 -7.2149537503719330e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2034 -3.7702780216932297e-02</internalNodes>
+          <leafValues>
+            4.1850051283836365e-01 -3.0355349183082581e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2035 -4.8910409212112427e-02</internalNodes>
+          <leafValues>
+            3.7365001440048218e-01 -5.6771109811961651e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2036 -5.9961699880659580e-03</internalNodes>
+          <leafValues>
+            -2.0756420493125916e-01 7.0438846945762634e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2037 5.6631930172443390e-02</internalNodes>
+          <leafValues>
+            -1.7292939126491547e-02 2.5498399138450623e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2038 3.1650230288505554e-02</internalNodes>
+          <leafValues>
+            -2.0658250898122787e-02 4.8398271203041077e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2039 -2.1152989938855171e-02</internalNodes>
+          <leafValues>
+            2.0028789341449738e-01 -2.4872610345482826e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2040 8.7676532566547394e-02</internalNodes>
+          <leafValues>
+            -2.4999700486660004e-02 4.1126599907875061e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2041 5.3299881517887115e-02</internalNodes>
+          <leafValues>
+            -8.6766229942440987e-03 3.7446591258049011e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2042 -2.6251509552821517e-04</internalNodes>
+          <leafValues>
+            9.9231846630573273e-02 -1.1989200115203857e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2043 -8.5897604003548622e-03</internalNodes>
+          <leafValues>
+            -1.8593010306358337e-01 3.4370779991149902e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2044 1.6940470784902573e-02</internalNodes>
+          <leafValues>
+            -3.4768261015415192e-02 2.7288261055946350e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2045 5.0596110522747040e-02</internalNodes>
+          <leafValues>
+            3.6170349922031164e-03 -3.9460760354995728e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2046 -8.3048436790704727e-03</internalNodes>
+          <leafValues>
+            9.8577797412872314e-02 -1.1666280031204224e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2047 1.0586270131170750e-02</internalNodes>
+          <leafValues>
+            3.9117150008678436e-02 -8.5843667387962341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2048 -3.2558601349592209e-02</internalNodes>
+          <leafValues>
+            -3.7352150678634644e-01 2.5410100817680359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2049 -3.2352130860090256e-02</internalNodes>
+          <leafValues>
+            2.6129978895187378e-01 -2.8631040826439857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2050 2.5547049939632416e-02</internalNodes>
+          <leafValues>
+            3.3884890377521515e-02 -3.0452328920364380e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2051 4.2252440005540848e-02</internalNodes>
+          <leafValues>
+            8.9510334655642509e-03 -2.4091260135173798e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2052 3.8109479937702417e-03</internalNodes>
+          <leafValues>
+            -7.2638936340808868e-02 1.4634390175342560e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2053 2.0821709185838699e-02</internalNodes>
+          <leafValues>
+            -3.6271940916776657e-02 1.8324719369411469e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2054 2.6497790589928627e-02</internalNodes>
+          <leafValues>
+            2.8160110116004944e-02 -3.9517199993133545e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2055 2.0283530652523041e-01</internalNodes>
+          <leafValues>
+            -9.3782292678952217e-03 4.4868949055671692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2056 -1.7996610701084137e-01</internalNodes>
+          <leafValues>
+            -7.9595959186553955e-01 1.2027840130031109e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2057 -7.0968091487884521e-02</internalNodes>
+          <leafValues>
+            -7.6951277256011963e-01 1.0918079642578959e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2058 2.7555041015148163e-03</internalNodes>
+          <leafValues>
+            7.0150263607501984e-02 -1.2915180623531342e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2059 -7.7004402875900269e-02</internalNodes>
+          <leafValues>
+            -4.9155071377754211e-01 2.8067480307072401e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2060 -2.0257910713553429e-02</internalNodes>
+          <leafValues>
+            2.3568239808082581e-01 -4.3432798236608505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2061 -8.6421817541122437e-02</internalNodes>
+          <leafValues>
+            -3.4541681408882141e-01 1.1248850263655186e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2062 -6.7245952785015106e-02</internalNodes>
+          <leafValues>
+            -6.8752902746200562e-01 1.1868669651448727e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2063 -1.2990389764308929e-01</internalNodes>
+          <leafValues>
+            -7.9069268703460693e-01 2.5537670589983463e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2064 -3.0394670367240906e-01</internalNodes>
+          <leafValues>
+            -8.9989352226257324e-01 8.1501724198460579e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2065 -4.1988548636436462e-01</internalNodes>
+          <leafValues>
+            -7.7303320169448853e-01 1.3665149454027414e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2066 -1.6851289570331573e-01</internalNodes>
+          <leafValues>
+            2.4319399893283844e-01 -4.1280739009380341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2067 2.8788880445063114e-03</internalNodes>
+          <leafValues>
+            2.0577169954776764e-02 -1.8590900301933289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2068 -4.0223840624094009e-02</internalNodes>
+          <leafValues>
+            4.3099269270896912e-01 -2.3104710504412651e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2069 3.9687040261924267e-03</internalNodes>
+          <leafValues>
+            4.3601520359516144e-02 -9.2233568429946899e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2070 -2.7650719508528709e-02</internalNodes>
+          <leafValues>
+            -6.1707872152328491e-01 1.4680569991469383e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2071 -2.3034301120787859e-03</internalNodes>
+          <leafValues>
+            9.0349592268466949e-02 -6.1664551496505737e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2072 -2.9040789231657982e-02</internalNodes>
+          <leafValues>
+            2.7737939357757568e-01 -3.9218869060277939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2073 1.3288260437548161e-02</internalNodes>
+          <leafValues>
+            3.1138259917497635e-02 -1.3558749854564667e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2074 3.3968928619287908e-05</internalNodes>
+          <leafValues>
+            -1.3562929630279541e-01 7.6467581093311310e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2075 -6.8583860993385315e-03</internalNodes>
+          <leafValues>
+            -1.0365810245275497e-01 2.5939159095287323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2076 -1.4360919594764709e-02</internalNodes>
+          <leafValues>
+            -2.1136499941349030e-01 5.2973140031099319e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2077 -1.7468679696321487e-02</internalNodes>
+          <leafValues>
+            -1.0518109798431396e-01 1.7715079709887505e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2078 -9.8544567823410034e-02</internalNodes>
+          <leafValues>
+            2.5649461150169373e-01 -4.4229641556739807e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2079 -2.8123459778726101e-03</internalNodes>
+          <leafValues>
+            -7.3800362646579742e-02 1.5400940179824829e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2080 2.1941340528428555e-03</internalNodes>
+          <leafValues>
+            -1.4216299355030060e-01 8.9139223098754883e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2081 4.6820759773254395e-02</internalNodes>
+          <leafValues>
+            2.9364090412855148e-02 -6.2754891812801361e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2082 3.2891759276390076e-01</internalNodes>
+          <leafValues>
+            1.3015690259635448e-02 -7.8347128629684448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2083 -2.0470520481467247e-02</internalNodes>
+          <leafValues>
+            -7.6814353466033936e-02 3.9800468832254410e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2084 8.8677026331424713e-02</internalNodes>
+          <leafValues>
+            -4.0312368422746658e-02 2.8453868627548218e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2085 -1.1557979742065072e-03</internalNodes>
+          <leafValues>
+            4.2199321091175079e-02 -4.1446208953857422e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2086 6.0524538159370422e-02</internalNodes>
+          <leafValues>
+            -1.6918700188398361e-02 6.7237138748168945e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2087 4.0830459445714951e-02</internalNodes>
+          <leafValues>
+            1.3364840298891068e-02 -3.1113299727439880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2088 -3.1132870353758335e-03</internalNodes>
+          <leafValues>
+            -1.7262780666351318e-01 5.9382218867540359e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2089 -4.3638627976179123e-03</internalNodes>
+          <leafValues>
+            1.7265330255031586e-01 -6.2423970550298691e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2090 -3.2834090292453766e-02</internalNodes>
+          <leafValues>
+            4.0275371074676514e-01 -2.5799039751291275e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2091 6.4377002418041229e-02</internalNodes>
+          <leafValues>
+            -4.7380630858242512e-03 7.5221067667007446e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2092 2.7642730623483658e-02</internalNodes>
+          <leafValues>
+            3.7644479423761368e-02 -2.9220271110534668e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2093 2.2171199321746826e-02</internalNodes>
+          <leafValues>
+            -2.4654069915413857e-02 2.0533810555934906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2094 1.5859310515224934e-03</internalNodes>
+          <leafValues>
+            8.9463792741298676e-02 -1.2611730396747589e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2095 -1.8872050568461418e-02</internalNodes>
+          <leafValues>
+            1.3072650134563446e-01 -3.6953710019588470e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2096 -1.3306169770658016e-02</internalNodes>
+          <leafValues>
+            -2.2963209450244904e-01 4.2687188833951950e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2097 -7.0407122373580933e-02</internalNodes>
+          <leafValues>
+            -7.1117508411407471e-01 6.6957580856978893e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2098 4.1748929768800735e-02</internalNodes>
+          <leafValues>
+            -3.2927870750427246e-02 3.0035281181335449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2099 5.3282231092453003e-03</internalNodes>
+          <leafValues>
+            5.1811750978231430e-02 -1.9069090485572815e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2100 2.4094989057630301e-03</internalNodes>
+          <leafValues>
+            -8.0687969923019409e-02 1.2510129809379578e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2101 -6.2405979260802269e-03</internalNodes>
+          <leafValues>
+            1.0740630328655243e-01 -3.9979010820388794e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2102 -6.7312467098236084e-01</internalNodes>
+          <leafValues>
+            -1. 1.0070810094475746e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2103 -9.2983558773994446e-02</internalNodes>
+          <leafValues>
+            -1. -2.4261360522359610e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2104 3.3629760146141052e-02</internalNodes>
+          <leafValues>
+            2.4122869595885277e-02 -4.1387900710105896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2105 2.3880619555711746e-02</internalNodes>
+          <leafValues>
+            9.6614202484488487e-03 -2.1973779797554016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2106 1.2738780351355672e-03</internalNodes>
+          <leafValues>
+            -8.3555117249488831e-02 1.2269689887762070e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2107 1.8414139747619629e-02</internalNodes>
+          <leafValues>
+            3.0798140913248062e-02 -3.5609170794487000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2108 -5.6469578295946121e-02</internalNodes>
+          <leafValues>
+            8.8631778955459595e-01 -1.2698300182819366e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2109 -4.6219761134125292e-04</internalNodes>
+          <leafValues>
+            3.4681901335716248e-02 -8.2850828766822815e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2110 -1.9060859456658363e-02</internalNodes>
+          <leafValues>
+            3.5369411110877991e-01 -2.7611760422587395e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2111 1.5762279508635402e-03</internalNodes>
+          <leafValues>
+            4.0939908474683762e-02 -2.2517409920692444e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2112 2.0101880654692650e-02</internalNodes>
+          <leafValues>
+            -2.3995550349354744e-02 4.1091251373291016e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2113 2.7211669366806746e-03</internalNodes>
+          <leafValues>
+            2.8122449293732643e-02 -1.4200119674205780e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2114 -1.0944429785013199e-01</internalNodes>
+          <leafValues>
+            9.5085740089416504e-01 -9.4355372712016106e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2115 -1.2755279894918203e-03</internalNodes>
+          <leafValues>
+            5.6902900338172913e-02 -8.3429783582687378e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2116 -8.0578401684761047e-02</internalNodes>
+          <leafValues>
+            -9.5139288902282715e-01 8.2268668338656425e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2117 -1.2047989666461945e-01</internalNodes>
+          <leafValues>
+            -3.0273869633674622e-01 2.8489340096712112e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2118 -1.8294970691204071e-01</internalNodes>
+          <leafValues>
+            2.3866130411624908e-01 -6.2773942947387695e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2119 -1.7106409370899200e-01</internalNodes>
+          <leafValues>
+            -5.9394681453704834e-01 3.1515269074589014e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2120 -7.3414877057075500e-02</internalNodes>
+          <leafValues>
+            -8.6933082342147827e-01 1.0084389708936214e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2121 2.4238299578428268e-02</internalNodes>
+          <leafValues>
+            -2.1756110712885857e-02 1.6218559443950653e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2122 -7.1713668294250965e-03</internalNodes>
+          <leafValues>
+            -9.7345590591430664e-02 9.2148497700691223e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2123 -3.3344399183988571e-02</internalNodes>
+          <leafValues>
+            7.4645392596721649e-02 -2.2160679101943970e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2124 7.2907900903373957e-04</internalNodes>
+          <leafValues>
+            -9.4971813261508942e-02 1.1826740205287933e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2125 -1.0217289673164487e-03</internalNodes>
+          <leafValues>
+            5.6426230818033218e-02 -3.7573829293251038e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2126 -8.4900937508791685e-04</internalNodes>
+          <leafValues>
+            -1.3883149623870850e-01 7.0047326385974884e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2127 9.9850513041019440e-02</internalNodes>
+          <leafValues>
+            -1.4011589810252190e-02 2.6115679740905762e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2128 -1.3090069591999054e-01</internalNodes>
+          <leafValues>
+            7.1379351615905762e-01 -1.1643799953162670e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2129 9.1210529208183289e-03</internalNodes>
+          <leafValues>
+            4.5402809977531433e-02 -2.1830010414123535e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2130 2.0106479525566101e-01</internalNodes>
+          <leafValues>
+            -2.0753270015120506e-02 5.1230221986770630e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2131 4.7389309853315353e-02</internalNodes>
+          <leafValues>
+            9.4779124483466148e-03 -4.7942391037940979e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2132 -5.7118538767099380e-02</internalNodes>
+          <leafValues>
+            3.9166051149368286e-01 -2.6703910902142525e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2133 -8.3700623363256454e-03</internalNodes>
+          <leafValues>
+            -1.3399459421634674e-01 4.8460900783538818e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2134 4.0913890115916729e-03</internalNodes>
+          <leafValues>
+            -5.9489779174327850e-02 1.7438539862632751e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2135 7.1899488568305969e-02</internalNodes>
+          <leafValues>
+            1.1723180301487446e-02 -3.6274778842926025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2136 -3.6888250615447760e-03</internalNodes>
+          <leafValues>
+            7.5763627886772156e-02 -1.5033599734306335e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2137 -7.4795219115912914e-03</internalNodes>
+          <leafValues>
+            1.5027859807014465e-01 -4.5870490372180939e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2138 -1.2582589872181416e-02</internalNodes>
+          <leafValues>
+            -1.9915549457073212e-01 6.3917450606822968e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2139 3.5687079653143883e-03</internalNodes>
+          <leafValues>
+            -1.2117239832878113e-01 1.0956080257892609e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2140 1.7363800434395671e-03</internalNodes>
+          <leafValues>
+            1.2258529663085938e-01 -9.3556262552738190e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2141 -1.4523629797622561e-03</internalNodes>
+          <leafValues>
+            9.6722528338432312e-02 -8.0739699304103851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2142 3.1017749570310116e-03</internalNodes>
+          <leafValues>
+            -6.9076471030712128e-02 1.5396459400653839e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2143 -8.5509587079286575e-03</internalNodes>
+          <leafValues>
+            -1.5186290442943573e-01 4.0346920490264893e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2144 -1.8966189818456769e-03</internalNodes>
+          <leafValues>
+            1.2172549962997437e-01 -9.8543442785739899e-02</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>135</maxWeakCount>
+      <stageThreshold>-3.0601499557495117e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2145 -2.3754740133881569e-02</internalNodes>
+          <leafValues>
+            1.7095300555229187e-01 -1.1534280329942703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2146 -7.3806629516184330e-03</internalNodes>
+          <leafValues>
+            8.8067196309566498e-02 -4.0317770093679428e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2147 1.1198900174349546e-03</internalNodes>
+          <leafValues>
+            -7.9895302653312683e-02 1.3448899984359741e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2148 3.3718731254339218e-02</internalNodes>
+          <leafValues>
+            -1.5220030210912228e-02 2.9914170503616333e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2149 -2.8022660990245640e-04</internalNodes>
+          <leafValues>
+            6.3599728047847748e-02 -1.5619190037250519e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2150 -3.9523928426206112e-03</internalNodes>
+          <leafValues>
+            -9.7961323335766792e-03 1.0571649670600891e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2151 2.1397129166871309e-03</internalNodes>
+          <leafValues>
+            8.9953586459159851e-02 -1.4483779668807983e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2152 -6.7521296441555023e-02</internalNodes>
+          <leafValues>
+            2.0932430028915405e-01 -5.3923811763525009e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2153 1.0378950275480747e-02</internalNodes>
+          <leafValues>
+            -6.4177162945270538e-02 2.7814629673957825e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2154 6.2903137877583504e-03</internalNodes>
+          <leafValues>
+            -4.9253720790147781e-02 8.2168422639369965e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2155 9.3974275514483452e-03</internalNodes>
+          <leafValues>
+            8.4537737071514130e-02 -2.2885300219058990e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2156 1.0120930150151253e-02</internalNodes>
+          <leafValues>
+            3.3337119966745377e-02 -8.1664256751537323e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2157 3.1531939748674631e-03</internalNodes>
+          <leafValues>
+            -1.0220990329980850e-01 1.1837360262870789e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2158 7.5137287378311157e-02</internalNodes>
+          <leafValues>
+            2.7504051104187965e-03 -1.0000959634780884e+00</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2159 -2.3692219983786345e-03</internalNodes>
+          <leafValues>
+            9.9092483520507812e-02 -1.1425189673900604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2160 -2.4510379880666733e-02</internalNodes>
+          <leafValues>
+            2.8708320856094360e-01 -1.6148800030350685e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2161 -1.9670750480145216e-03</internalNodes>
+          <leafValues>
+            -1.1531370133161545e-01 8.6816556751728058e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2162 3.0845379456877708e-02</internalNodes>
+          <leafValues>
+            -2.4090610444545746e-02 1.9607549905776978e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2163 2.3816309869289398e-02</internalNodes>
+          <leafValues>
+            3.2824039459228516e-02 -3.5710439085960388e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2164 -4.0199130773544312e-02</internalNodes>
+          <leafValues>
+            -5.2850788831710815e-01 6.0749719850718975e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2165 -6.8876100704073906e-03</internalNodes>
+          <leafValues>
+            2.2058850526809692e-01 -5.9151489287614822e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2166 -2.5466730585321784e-04</internalNodes>
+          <leafValues>
+            7.1897879242897034e-02 -8.4962032735347748e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2167 9.8468195647001266e-03</internalNodes>
+          <leafValues>
+            4.1366759687662125e-02 -2.3984520137310028e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2168 2.7934400364756584e-02</internalNodes>
+          <leafValues>
+            -2.3647159337997437e-02 2.4738009274005890e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2169 -2.2960390895605087e-02</internalNodes>
+          <leafValues>
+            -4.5187929272651672e-01 2.2305779159069061e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2170 3.2323438790626824e-04</internalNodes>
+          <leafValues>
+            -8.7536007165908813e-02 7.8490957617759705e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2171 3.1954899430274963e-02</internalNodes>
+          <leafValues>
+            -2.6202389970421791e-02 3.9204901456832886e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2172 1.9027979578822851e-03</internalNodes>
+          <leafValues>
+            6.2762781977653503e-02 -1.6107350587844849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2173 -3.2691629603505135e-03</internalNodes>
+          <leafValues>
+            1.0168000310659409e-01 -1.0432480275630951e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2174 1.0040200315415859e-02</internalNodes>
+          <leafValues>
+            -2.8046580031514168e-02 1.2117899954319000e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2175 -3.4158680588006973e-02</internalNodes>
+          <leafValues>
+            -2.8974449634552002e-01 3.5282660275697708e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2176 1.7615250544622540e-03</internalNodes>
+          <leafValues>
+            -5.5583070963621140e-02 7.4158452451229095e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2177 -2.1134650334715843e-02</internalNodes>
+          <leafValues>
+            2.5130590796470642e-01 -4.0354639291763306e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2178 2.9759369790554047e-02</internalNodes>
+          <leafValues>
+            3.8029540330171585e-02 -1.4226369559764862e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2179 1.4866080135107040e-02</internalNodes>
+          <leafValues>
+            -3.9721690118312836e-02 2.7522540092468262e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2180 -3.5829428583383560e-02</internalNodes>
+          <leafValues>
+            -3.3451971411705017e-01 9.6839247271418571e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2181 -3.2887340057641268e-03</internalNodes>
+          <leafValues>
+            -1.4258219301700592e-01 6.8576209247112274e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2182 4.2714878916740417e-02</internalNodes>
+          <leafValues>
+            -1.4240439981222153e-02 3.8765299320220947e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2183 1.2328879674896598e-03</internalNodes>
+          <leafValues>
+            7.8623853623867035e-02 -1.1869420111179352e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2184 -1.0447620414197445e-02</internalNodes>
+          <leafValues>
+            -1.4882990717887878e-01 3.1571168452501297e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2185 1.2656359933316708e-02</internalNodes>
+          <leafValues>
+            -4.6572461724281311e-02 2.6212608814239502e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2186 4.9849718809127808e-02</internalNodes>
+          <leafValues>
+            1.7015339806675911e-02 -1.4268730580806732e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2187 -1.8607240170240402e-02</internalNodes>
+          <leafValues>
+            2.3338650166988373e-01 -4.7094941139221191e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2188 -5.4397370666265488e-02</internalNodes>
+          <leafValues>
+            -4.0511301159858704e-01 8.1606470048427582e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2189 2.9153900686651468e-03</internalNodes>
+          <leafValues>
+            -8.9313946664333344e-02 1.3335379958152771e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2190 -5.9154080227017403e-03</internalNodes>
+          <leafValues>
+            -2.0414529740810394e-01 4.8475701361894608e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2191 -1.9841329194605350e-03</internalNodes>
+          <leafValues>
+            1.3428109884262085e-01 -7.5892791152000427e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2192 -4.4047520495951176e-03</internalNodes>
+          <leafValues>
+            4.1852138936519623e-02 -1.0119090229272842e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2193 1.7982879653573036e-02</internalNodes>
+          <leafValues>
+            4.3978679925203323e-02 -2.5054019689559937e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2194 -7.8059501945972443e-02</internalNodes>
+          <leafValues>
+            -3.3025071024894714e-01 6.3089421018958092e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2195 7.2548650205135345e-03</internalNodes>
+          <leafValues>
+            -1.0872170329093933e-01 9.9411018192768097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2196 -2.7871869970113039e-03</internalNodes>
+          <leafValues>
+            1.3659299910068512e-01 -8.4799639880657196e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2197 -9.3798413872718811e-03</internalNodes>
+          <leafValues>
+            -1.1872450262308121e-01 7.9108059406280518e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2198 -5.4926410317420959e-02</internalNodes>
+          <leafValues>
+            1.4382070302963257e-01 -3.0072269961237907e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2199 -4.4219079427421093e-03</internalNodes>
+          <leafValues>
+            1.0666429996490479e-01 -1.0838100314140320e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2200 1.0763059835880995e-03</internalNodes>
+          <leafValues>
+            2.7380989864468575e-02 -5.5446051061153412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2201 -7.2514012455940247e-02</internalNodes>
+          <leafValues>
+            -1.0893449932336807e-01 1.0097540169954300e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2202 -1.6472190618515015e-01</internalNodes>
+          <leafValues>
+            3.0365368723869324e-01 -4.3666210025548935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2203 7.9837806522846222e-02</internalNodes>
+          <leafValues>
+            -1.0828680358827114e-02 8.9977437257766724e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2204 -5.2413612138479948e-04</internalNodes>
+          <leafValues>
+            8.5230633616447449e-02 -1.2053979933261871e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2205 -2.1632270887494087e-02</internalNodes>
+          <leafValues>
+            -2.1092039346694946e-01 6.5582543611526489e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2206 1.2691530585289001e-01</internalNodes>
+          <leafValues>
+            -4.5935749076306820e-03 4.5089641213417053e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2207 9.5472350716590881e-02</internalNodes>
+          <leafValues>
+            -2.0798899233341217e-02 5.2474659681320190e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2208 -8.2936078310012817e-02</internalNodes>
+          <leafValues>
+            8.4976738691329956e-01 -5.0510508008301258e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2209 7.7482969500124454e-03</internalNodes>
+          <leafValues>
+            -5.5318288505077362e-02 1.7145830392837524e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2210 -2.1768439561128616e-02</internalNodes>
+          <leafValues>
+            -1.5947930514812469e-01 6.0873799026012421e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2211 -1.1072609777329490e-04</internalNodes>
+          <leafValues>
+            7.8877292573451996e-02 -1.3177630305290222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2212 3.1122909858822823e-03</internalNodes>
+          <leafValues>
+            -4.3046839535236359e-02 6.2392581254243851e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2213 -2.8692940250039101e-03</internalNodes>
+          <leafValues>
+            1.3746979832649231e-01 -8.0494217574596405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2214 1.0575760155916214e-01</internalNodes>
+          <leafValues>
+            1.0569440200924873e-03 -9.9993818998336792e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2215 4.6192679554224014e-02</internalNodes>
+          <leafValues>
+            1.7228020355105400e-02 -5.2604919672012329e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2216 -2.5476190447807312e-01</internalNodes>
+          <leafValues>
+            -6.2927299737930298e-01 1.3698619790375233e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2217 -2.7374029159545898e-03</internalNodes>
+          <leafValues>
+            1.2747539579868317e-01 -6.9591522216796875e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2218 2.1854760125279427e-03</internalNodes>
+          <leafValues>
+            4.1854761540889740e-02 -2.6481458544731140e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2219 -2.4050710722804070e-02</internalNodes>
+          <leafValues>
+            -2.6191109418869019e-01 3.4489940851926804e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2220 1.0211429744958878e-01</internalNodes>
+          <leafValues>
+            -1.5302860178053379e-02 3.9992758631706238e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2221 1.0281659662723541e-01</internalNodes>
+          <leafValues>
+            -2.9020670801401138e-02 3.6887159943580627e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2222 3.9206489920616150e-02</internalNodes>
+          <leafValues>
+            8.9045017957687378e-03 -4.3242999911308289e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2223 -3.7830859422683716e-02</internalNodes>
+          <leafValues>
+            -6.2731212377548218e-01 1.4882829971611500e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2224 1.2507890351116657e-02</internalNodes>
+          <leafValues>
+            -1.7865059897303581e-02 1.4156140387058258e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2225 -1.5477590262889862e-02</internalNodes>
+          <leafValues>
+            3.1676650047302246e-01 -3.3510830253362656e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2226 -4.5885699801146984e-03</internalNodes>
+          <leafValues>
+            -1.5222150087356567e-01 7.3211863636970520e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2227 -2.0505970343947411e-02</internalNodes>
+          <leafValues>
+            1.1725380271673203e-01 -9.7457922995090485e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2228 -1.3098320364952087e-01</internalNodes>
+          <leafValues>
+            5.4338067770004272e-01 -5.8803129941225052e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2229 4.7888278961181641e-02</internalNodes>
+          <leafValues>
+            -2.7120810002088547e-02 3.5723638534545898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2230 2.5441530346870422e-01</internalNodes>
+          <leafValues>
+            2.5680949911475182e-03 -9.9988257884979248e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2231 2.0652529783546925e-03</internalNodes>
+          <leafValues>
+            -9.4255000352859497e-02 1.0068359971046448e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2232 3.0141780152916908e-02</internalNodes>
+          <leafValues>
+            -1.5984520316123962e-02 2.4209509789943695e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2233 1.2305500358343124e-01</internalNodes>
+          <leafValues>
+            4.3902460485696793e-02 -2.9046860337257385e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2234 1.1436889879405499e-02</internalNodes>
+          <leafValues>
+            3.1826701015233994e-02 -1.0569609701633453e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2235 1.4229659922420979e-02</internalNodes>
+          <leafValues>
+            -6.4518727362155914e-02 1.6178989410400391e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2236 -1.9808039069175720e-02</internalNodes>
+          <leafValues>
+            2.0909899473190308e-01 -2.7245460078120232e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2237 -3.2634709030389786e-02</internalNodes>
+          <leafValues>
+            -4.6265149116516113e-01 2.3877989500761032e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2238 8.1568211317062378e-02</internalNodes>
+          <leafValues>
+            -1.0983820073306561e-02 7.4517530202865601e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2239 1.7331159906461835e-03</internalNodes>
+          <leafValues>
+            6.2832579016685486e-02 -1.5800160169601440e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2240 4.1524558328092098e-03</internalNodes>
+          <leafValues>
+            2.8520949184894562e-02 -8.3923816680908203e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2241 2.0917340589221567e-04</internalNodes>
+          <leafValues>
+            -1.6536650061607361e-01 8.3170376718044281e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2242 -6.9550168700516224e-04</internalNodes>
+          <leafValues>
+            5.7298898696899414e-02 -9.8668128252029419e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2243 1.0114730149507523e-01</internalNodes>
+          <leafValues>
+            -2.7031859382987022e-02 5.0937288999557495e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2244 2.0371530205011368e-02</internalNodes>
+          <leafValues>
+            -1.5991339460015297e-02 2.1110190451145172e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2245 1.9490359723567963e-01</internalNodes>
+          <leafValues>
+            1.1169149540364742e-02 -8.0626577138900757e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2246 -1.5187750104814768e-03</internalNodes>
+          <leafValues>
+            8.8670432567596436e-02 -6.5779693424701691e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2247 -2.2300280761555769e-05</internalNodes>
+          <leafValues>
+            7.0237100124359131e-02 -1.3656799495220184e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2248 7.0241810753941536e-03</internalNodes>
+          <leafValues>
+            4.5264270156621933e-02 -1.2246630340814590e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2249 -5.8513730764389038e-03</internalNodes>
+          <leafValues>
+            1.4548699557781219e-01 -7.7512867748737335e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2250 -1.2228869833052158e-02</internalNodes>
+          <leafValues>
+            -1.5762320160865784e-01 3.3091600984334946e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2251 -2.7475339174270630e-01</internalNodes>
+          <leafValues>
+            4.1415899991989136e-01 -2.3306179791688919e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2252 -8.3073312416672707e-03</internalNodes>
+          <leafValues>
+            -6.6158972680568695e-02 4.5423369854688644e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2253 1.4967099763453007e-02</internalNodes>
+          <leafValues>
+            3.9580021053552628e-02 -2.4474979937076569e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2254 3.5121920518577099e-03</internalNodes>
+          <leafValues>
+            -3.2608591020107269e-02 7.2080552577972412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2255 6.0676191933453083e-03</internalNodes>
+          <leafValues>
+            -6.6284246742725372e-02 1.6455779969692230e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2256 -6.0948841273784637e-03</internalNodes>
+          <leafValues>
+            -1.6784119606018066e-01 6.8097747862339020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2257 -4.4710501097142696e-03</internalNodes>
+          <leafValues>
+            1.4348860085010529e-01 -7.5286053121089935e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2258 2.7629999443888664e-02</internalNodes>
+          <leafValues>
+            -6.0715568251907825e-03 4.6235299110412598e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2259 -4.1778348386287689e-03</internalNodes>
+          <leafValues>
+            -9.4480186700820923e-02 1.0268689692020416e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2260 -1.4997010293882340e-04</internalNodes>
+          <leafValues>
+            4.5903969556093216e-02 -1.2689989805221558e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2261 9.3421656638383865e-03</internalNodes>
+          <leafValues>
+            -4.7851350158452988e-02 2.3776920139789581e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2262 -9.0454798191785812e-03</internalNodes>
+          <leafValues>
+            -1.4881759881973267e-01 2.5717660784721375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2263 -1.0563050163909793e-03</internalNodes>
+          <leafValues>
+            -1.2465219944715500e-01 8.2118943333625793e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2264 -1.5602169558405876e-02</internalNodes>
+          <leafValues>
+            3.0471551418304443e-01 -2.4503290653228760e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2265 -8.9588612318038940e-03</internalNodes>
+          <leafValues>
+            -2.3624059557914734e-01 4.6290140599012375e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2266 -7.6452922075986862e-03</internalNodes>
+          <leafValues>
+            1.1393140256404877e-01 -2.6573060080409050e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2267 -1.9294900819659233e-02</internalNodes>
+          <leafValues>
+            2.8820019960403442e-01 -3.5906881093978882e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2268 8.6250286549329758e-03</internalNodes>
+          <leafValues>
+            6.1006020754575729e-02 -1.6832630336284637e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2269 2.5883490219712257e-02</internalNodes>
+          <leafValues>
+            -4.0142849087715149e-02 2.3263120651245117e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2270 -7.4946112930774689e-02</internalNodes>
+          <leafValues>
+            7.1168798208236694e-01 -6.0237408615648746e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2271 -2.6808120310306549e-04</internalNodes>
+          <leafValues>
+            7.7717900276184082e-02 -1.5358750522136688e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2272 6.1041440814733505e-02</internalNodes>
+          <leafValues>
+            -3.4070160239934921e-02 2.5833290815353394e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2273 -4.7920648939907551e-03</internalNodes>
+          <leafValues>
+            -1.5077829360961914e-01 8.4577240049839020e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2274 -1.2610630691051483e-01</internalNodes>
+          <leafValues>
+            -4.8404538631439209e-01 8.6965439841151237e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2275 -2.2879270836710930e-02</internalNodes>
+          <leafValues>
+            6.7734187841415405e-01 -1.4856100082397461e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2276 -6.2760512810200453e-04</internalNodes>
+          <leafValues>
+            5.0910349935293198e-02 -1.4076440036296844e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2277 -1.0543179698288441e-02</internalNodes>
+          <leafValues>
+            -9.0707249939441681e-02 1.1281900107860565e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2278 -2.4953829124569893e-03</internalNodes>
+          <leafValues>
+            8.9523762464523315e-02 -7.5541287660598755e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2279 6.0986150056123734e-02</internalNodes>
+          <leafValues>
+            -3.2006978988647461e-02 3.3000910282135010e-01</leafValues></_></weakClassifiers></_>
+    <_>
+      <maxWeakCount>143</maxWeakCount>
+      <stageThreshold>-3.0555000305175781e+01</stageThreshold>
+      <weakClassifiers>
+        <_>
+          <internalNodes>
+            0 -1 2280 -4.1241809725761414e-02</internalNodes>
+          <leafValues>
+            2.4841840565204620e-01 -6.9879129528999329e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2281 -7.4663497507572174e-02</internalNodes>
+          <leafValues>
+            -7.5433689355850220e-01 4.0493709966540337e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2282 -2.3803679272532463e-02</internalNodes>
+          <leafValues>
+            2.4313099682331085e-01 -4.5283928513526917e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2283 3.2028619199991226e-02</internalNodes>
+          <leafValues>
+            -1.2230539694428444e-02 3.9811220765113831e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2284 3.8454410969279706e-04</internalNodes>
+          <leafValues>
+            6.9244839251041412e-02 -1.7288799583911896e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2285 -2.0599530544131994e-03</internalNodes>
+          <leafValues>
+            4.5083250850439072e-02 -6.3824482262134552e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2286 5.9174500405788422e-02</internalNodes>
+          <leafValues>
+            1.3756089843809605e-02 5.8063977956771851e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2287 -8.1204501911997795e-03</internalNodes>
+          <leafValues>
+            -7.9060196876525879e-02 3.2097879797220230e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2288 -5.4362448863685131e-03</internalNodes>
+          <leafValues>
+            8.0285012722015381e-02 -1.3880789279937744e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2289 4.0768779814243317e-02</internalNodes>
+          <leafValues>
+            3.5265129059553146e-02 -1.6821040213108063e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2290 -1.0705769993364811e-02</internalNodes>
+          <leafValues>
+            -1.3227799534797668e-01 9.7147703170776367e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2291 -2.1374409552663565e-03</internalNodes>
+          <leafValues>
+            -1.1135129630565643e-01 1.0501199960708618e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2292 -6.0069030150771141e-03</internalNodes>
+          <leafValues>
+            7.9701423645019531e-02 -1.4503550529479980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2293 6.8584359250962734e-03</internalNodes>
+          <leafValues>
+            -2.8629170730710030e-02 1.5494349598884583e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2294 8.4308702498674393e-03</internalNodes>
+          <leafValues>
+            -6.8725876510143280e-02 1.3571439683437347e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2295 -3.1918209046125412e-02</internalNodes>
+          <leafValues>
+            -9.0021647512912750e-02 7.0172756910324097e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2296 1.4346960186958313e-01</internalNodes>
+          <leafValues>
+            3.7936199456453323e-02 -3.3849731087684631e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2297 -5.3501531481742859e-02</internalNodes>
+          <leafValues>
+            -1. -1.3069049455225468e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2298 -4.3198501225560904e-04</internalNodes>
+          <leafValues>
+            6.3140459358692169e-02 -1.4891080558300018e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2299 -3.6825511604547501e-02</internalNodes>
+          <leafValues>
+            1.6418960690498352e-01 -3.6547198891639709e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2300 -9.3230612576007843e-02</internalNodes>
+          <leafValues>
+            -8.1855481863021851e-01 1.0488729923963547e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2301 -7.5886500999331474e-03</internalNodes>
+          <leafValues>
+            9.6189923584461212e-02 -3.2392729073762894e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2302 1.9316580146551132e-03</internalNodes>
+          <leafValues>
+            -9.7133457660675049e-02 9.6836537122726440e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2303 -1.7610849440097809e-01</internalNodes>
+          <leafValues>
+            -1. 3.9064860902726650e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2304 -4.5753358863294125e-03</internalNodes>
+          <leafValues>
+            -1.4245940744876862e-01 7.2629533708095551e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2305 -7.1555696427822113e-02</internalNodes>
+          <leafValues>
+            7.0124769210815430e-01 -8.1192785874009132e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2306 -5.1939189434051514e-03</internalNodes>
+          <leafValues>
+            -1.7593400180339813e-01 6.6920258104801178e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2307 9.7410175949335098e-03</internalNodes>
+          <leafValues>
+            -4.0632858872413635e-02 1.5366269648075104e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2308 -1.9197730347514153e-02</internalNodes>
+          <leafValues>
+            8.8404722511768341e-02 -1.1119589954614639e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2309 7.7713979408144951e-03</internalNodes>
+          <leafValues>
+            -5.1531080156564713e-02 2.3341870307922363e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2310 4.6741779893636703e-02</internalNodes>
+          <leafValues>
+            5.8658950030803680e-02 -2.1825340390205383e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2311 -6.7051820456981659e-02</internalNodes>
+          <leafValues>
+            -7.6968950033187866e-01 2.2733330260962248e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2312 1.0403609834611416e-02</internalNodes>
+          <leafValues>
+            -5.7208269834518433e-02 1.9874769449234009e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2313 6.8136617541313171e-02</internalNodes>
+          <leafValues>
+            1.0924750007688999e-02 -2.3514769971370697e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2314 5.5462731979787350e-03</internalNodes>
+          <leafValues>
+            7.6430208981037140e-02 -1.5048150718212128e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2315 3.5827890038490295e-02</internalNodes>
+          <leafValues>
+            5.2330200560390949e-03 -9.0509557723999023e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2316 1.0099080391228199e-02</internalNodes>
+          <leafValues>
+            -4.9438349902629852e-02 1.9236649572849274e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2317 -7.3000352131202817e-04</internalNodes>
+          <leafValues>
+            8.0038689076900482e-02 -5.9875860810279846e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2318 -6.2627308070659637e-02</internalNodes>
+          <leafValues>
+            -6.8771952390670776e-01 1.4409339986741543e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2319 4.1463607922196388e-03</internalNodes>
+          <leafValues>
+            6.2068879604339600e-02 -1.4138600230216980e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2320 -1.4136059582233429e-01</internalNodes>
+          <leafValues>
+            5.9439867734909058e-01 -1.6910530626773834e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2321 7.0147067308425903e-02</internalNodes>
+          <leafValues>
+            3.5781029146164656e-03 -8.4541380405426025e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2322 1.8181180348619819e-03</internalNodes>
+          <leafValues>
+            -5.9031128883361816e-02 1.7709979414939880e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2323 6.3149541616439819e-02</internalNodes>
+          <leafValues>
+            -7.9691512510180473e-03 2.4575470387935638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2324 1.7065559513866901e-03</internalNodes>
+          <leafValues>
+            -1.3776679337024689e-01 7.2286598384380341e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2325 -4.1844159364700317e-02</internalNodes>
+          <leafValues>
+            -1.0204549878835678e-01 1.9412880763411522e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2326 6.1876028776168823e-02</internalNodes>
+          <leafValues>
+            1.7572570592164993e-02 -5.9611201286315918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2327 8.6206607520580292e-02</internalNodes>
+          <leafValues>
+            -8.3246696740388870e-03 5.9274739027023315e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2328 1.5561250038444996e-02</internalNodes>
+          <leafValues>
+            5.5908791720867157e-02 -2.0174680650234222e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2329 1.9683360587805510e-03</internalNodes>
+          <leafValues>
+            8.4109783172607422e-02 -9.5114283263683319e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2330 -3.2295130658894777e-03</internalNodes>
+          <leafValues>
+            1.9859789311885834e-01 -6.0371041297912598e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2331 4.3861459940671921e-02</internalNodes>
+          <leafValues>
+            -7.5495638884603977e-03 2.7785310149192810e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2332 -7.1588042192161083e-04</internalNodes>
+          <leafValues>
+            1.0671679675579071e-01 -1.1605340242385864e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2333 -1.1585080064833164e-02</internalNodes>
+          <leafValues>
+            1.3923209905624390e-01 -7.2681717574596405e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2334 -2.4132030084729195e-02</internalNodes>
+          <leafValues>
+            -3.4343299269676208e-01 2.8587639331817627e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2335 -5.9670167975127697e-03</internalNodes>
+          <leafValues>
+            6.2854968011379242e-02 -6.3237912952899933e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2336 -5.7298261672258377e-02</internalNodes>
+          <leafValues>
+            3.3512100577354431e-01 -3.4425679594278336e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2337 -1.4440530538558960e-01</internalNodes>
+          <leafValues>
+            -1. -2.0486500579863787e-04</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2338 -1.6152009367942810e-02</internalNodes>
+          <leafValues>
+            -1.8017260730266571e-01 6.0698080807924271e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2339 3.1132341246120632e-04</internalNodes>
+          <leafValues>
+            -8.7393969297409058e-02 1.0814479738473892e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2340 -3.4905138891190290e-03</internalNodes>
+          <leafValues>
+            1.3089099526405334e-01 -8.2502506673336029e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2341 -5.1078200340270996e-02</internalNodes>
+          <leafValues>
+            -6.6744989156723022e-01 9.7670806571841240e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2342 2.3027899861335754e-01</internalNodes>
+          <leafValues>
+            8.9318687096238136e-03 -8.8892549276351929e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2343 3.3260289579629898e-02</internalNodes>
+          <leafValues>
+            -3.8846820592880249e-02 1.1871550232172012e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2344 3.6332090385258198e-03</internalNodes>
+          <leafValues>
+            -8.1865288317203522e-02 1.2006369978189468e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2345 -1.3659459364134818e-04</internalNodes>
+          <leafValues>
+            2.9094040393829346e-02 -8.6412712931632996e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2346 4.2663831263780594e-03</internalNodes>
+          <leafValues>
+            5.9642590582370758e-02 -1.6777870059013367e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2347 -3.7726368755102158e-02</internalNodes>
+          <leafValues>
+            2.5201418995857239e-01 -1.1480459943413734e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2348 -3.7723951041698456e-02</internalNodes>
+          <leafValues>
+            3.6150801181793213e-01 -2.5164980441331863e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2349 -3.5217531025409698e-02</internalNodes>
+          <leafValues>
+            -2.0768259465694427e-01 1.5659499913454056e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2350 -2.6250150054693222e-02</internalNodes>
+          <leafValues>
+            6.4363038539886475e-01 -1.3971080072224140e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2351 7.1132831275463104e-02</internalNodes>
+          <leafValues>
+            5.0701410509645939e-03 -8.1053668260574341e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2352 2.8358760755509138e-03</internalNodes>
+          <leafValues>
+            8.0034732818603516e-02 -1.1766050010919571e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2353 3.4837881103157997e-03</internalNodes>
+          <leafValues>
+            6.9709457457065582e-02 -1.2136720120906830e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2354 2.9538539820350707e-05</internalNodes>
+          <leafValues>
+            -1.7090520262718201e-01 7.0092067122459412e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2355 2.6345230638980865e-02</internalNodes>
+          <leafValues>
+            -1.1046449653804302e-02 3.5467839241027832e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2356 3.3180779428221285e-04</internalNodes>
+          <leafValues>
+            -8.9763849973678589e-02 1.0402739793062210e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2357 9.9607985466718674e-03</internalNodes>
+          <leafValues>
+            -1.0574670135974884e-01 8.7481163442134857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2358 6.9068476557731628e-02</internalNodes>
+          <leafValues>
+            -2.3135760799050331e-02 3.7765979766845703e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2359 -3.3804871141910553e-02</internalNodes>
+          <leafValues>
+            -8.0052927136421204e-02 6.6171988844871521e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2360 -2.1103899925947189e-03</internalNodes>
+          <leafValues>
+            7.2913236916065216e-02 -1.6986669600009918e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2361 7.1675583720207214e-02</internalNodes>
+          <leafValues>
+            -2.2668020799756050e-02 4.3757459521293640e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2362 -1.7637129873037338e-02</internalNodes>
+          <leafValues>
+            1.4710550010204315e-01 -7.7648147940635681e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2363 2.1559430751949549e-03</internalNodes>
+          <leafValues>
+            -4.4561479240655899e-02 8.0616250634193420e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2364 -2.9923371039330959e-03</internalNodes>
+          <leafValues>
+            1.6013230383396149e-01 -7.2628170251846313e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2365 -2.8351619839668274e-02</internalNodes>
+          <leafValues>
+            -2.4835529923439026e-01 7.8493626788258553e-03</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2366 -5.3842412307858467e-03</internalNodes>
+          <leafValues>
+            -1.3290390372276306e-01 7.8615352511405945e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2367 1.6513720154762268e-02</internalNodes>
+          <leafValues>
+            -3.0867580324411392e-02 2.2910499572753906e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2368 -2.3480059579014778e-02</internalNodes>
+          <leafValues>
+            -3.4656900167465210e-01 2.8477910906076431e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2369 6.4804457128047943e-02</internalNodes>
+          <leafValues>
+            3.2681180164217949e-03 -8.1848317384719849e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2370 2.9363438952714205e-03</internalNodes>
+          <leafValues>
+            6.8371996283531189e-02 -1.6038259863853455e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2371 1.9352639093995094e-02</internalNodes>
+          <leafValues>
+            1.2330809608101845e-02 -1.7751510441303253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2372 -1.4157049590721726e-03</internalNodes>
+          <leafValues>
+            1.6248740255832672e-01 -8.4821969270706177e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2373 -3.2165680080652237e-02</internalNodes>
+          <leafValues>
+            2.5495579838752747e-01 -1.5387820079922676e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2374 9.9883928894996643e-02</internalNodes>
+          <leafValues>
+            1.1630980297923088e-02 -8.6939221620559692e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2375 -8.5509859491139650e-04</internalNodes>
+          <leafValues>
+            3.7509139627218246e-02 -4.1315130889415741e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2376 1.9948679953813553e-02</internalNodes>
+          <leafValues>
+            -3.3211439847946167e-02 2.6546698808670044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2377 -1.6821360215544701e-02</internalNodes>
+          <leafValues>
+            -1.9504530727863312e-01 4.5578271150588989e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2378 -8.1685081124305725e-02</internalNodes>
+          <leafValues>
+            8.0823719501495361e-01 -1.0028379969298840e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2379 -3.9467110764235258e-04</internalNodes>
+          <leafValues>
+            3.7868868559598923e-02 -7.4321702122688293e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2380 -4.1939578950405121e-02</internalNodes>
+          <leafValues>
+            -7.5310271978378296e-01 1.2494780123233795e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2381 1.2319780141115189e-01</internalNodes>
+          <leafValues>
+            1.5212129801511765e-03 -8.7456828355789185e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2382 4.3162349611520767e-03</internalNodes>
+          <leafValues>
+            9.5917366445064545e-02 -9.8286882042884827e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2383 1.7064419807866216e-03</internalNodes>
+          <leafValues>
+            -6.7283846437931061e-02 5.8372668921947479e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2384 6.8853497505187988e-02</internalNodes>
+          <leafValues>
+            3.9853271096944809e-02 -2.7014040946960449e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2385 1.5133110573515296e-03</internalNodes>
+          <leafValues>
+            3.6803830415010452e-02 -7.8638777136802673e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2386 1.6671700403094292e-02</internalNodes>
+          <leafValues>
+            -5.2208479493856430e-02 2.5476139783859253e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2387 -2.4927379563450813e-03</internalNodes>
+          <leafValues>
+            -6.8352922797203064e-02 3.9182528853416443e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2388 1.7946650041267276e-03</internalNodes>
+          <leafValues>
+            7.5641617178916931e-02 -1.8443019688129425e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2389 6.5764516592025757e-02</internalNodes>
+          <leafValues>
+            -2.7957379817962646e-02 1.3770729303359985e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2390 -3.2415628433227539e-02</internalNodes>
+          <leafValues>
+            2.4957719445228577e-01 -3.8401741534471512e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2391 1.5985220670700073e-01</internalNodes>
+          <leafValues>
+            2.3139530792832375e-02 -4.5876979827880859e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2392 3.3003050833940506e-02</internalNodes>
+          <leafValues>
+            -2.8549650683999062e-02 3.6482268571853638e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2393 8.3292415365576744e-03</internalNodes>
+          <leafValues>
+            2.3422110825777054e-02 -1.2992739677429199e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2394 -1.4707380533218384e-01</internalNodes>
+          <leafValues>
+            -1. 1.0342770256102085e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2395 1.0625930130481720e-01</internalNodes>
+          <leafValues>
+            2.8901589103043079e-03 -6.2105101346969604e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2396 4.7905001789331436e-02</internalNodes>
+          <leafValues>
+            -2.5437310338020325e-02 3.8595038652420044e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2397 4.3562948703765869e-02</internalNodes>
+          <leafValues>
+            1.2963670305907726e-02 -3.1574508547782898e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2398 -6.6401511430740356e-02</internalNodes>
+          <leafValues>
+            3.7184339761734009e-01 -2.4248229339718819e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2399 1.0357169667258859e-03</internalNodes>
+          <leafValues>
+            -3.3857159316539764e-02 7.2818137705326080e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2400 -1.0010260343551636e-01</internalNodes>
+          <leafValues>
+            -2.6162430644035339e-01 4.0561348199844360e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2401 -1.4029429852962494e-01</internalNodes>
+          <leafValues>
+            1.6186380386352539e-01 -3.7463869899511337e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2402 -3.6629181355237961e-02</internalNodes>
+          <leafValues>
+            -3.7988689541816711e-01 2.2493759170174599e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2403 1.8527939915657043e-01</internalNodes>
+          <leafValues>
+            -3.4648380242288113e-03 9.9972921609878540e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2404 1.3452930375933647e-02</internalNodes>
+          <leafValues>
+            6.6191017627716064e-02 -1.5208050608634949e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2405 8.4628060460090637e-02</internalNodes>
+          <leafValues>
+            -3.2134260982275009e-02 2.2877800464630127e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2406 -8.7568372488021851e-02</internalNodes>
+          <leafValues>
+            4.3229681253433228e-01 -2.4735029786825180e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2407 2.6502339169383049e-02</internalNodes>
+          <leafValues>
+            2.3526629433035851e-02 -2.9849499464035034e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2408 -1.8273059278726578e-02</internalNodes>
+          <leafValues>
+            5.0878030061721802e-01 -1.9735949113965034e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2409 -1.1995369568467140e-03</internalNodes>
+          <leafValues>
+            7.4867762625217438e-02 -7.3861390352249146e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2410 3.1381230801343918e-02</internalNodes>
+          <leafValues>
+            -2.6280479505658150e-02 3.6583951115608215e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2411 2.3178670555353165e-02</internalNodes>
+          <leafValues>
+            3.7155259400606155e-02 -2.5468569993972778e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2412 -1.3644699938595295e-02</internalNodes>
+          <leafValues>
+            2.0717699825763702e-01 -4.2792771011590958e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2413 7.8315278515219688e-03</internalNodes>
+          <leafValues>
+            3.6028519272804260e-02 -8.0337040126323700e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2414 -1.0035780258476734e-02</internalNodes>
+          <leafValues>
+            -2.2253769636154175e-01 4.2950030416250229e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2415 -5.1132131367921829e-02</internalNodes>
+          <leafValues>
+            3.0586650967597961e-01 -2.7054589241743088e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2416 -6.9544702768325806e-02</internalNodes>
+          <leafValues>
+            3.4688460826873779e-01 -3.1736221164464951e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2417 -2.4079360067844391e-02</internalNodes>
+          <leafValues>
+            1.3291560113430023e-01 -3.0277779325842857e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2418 -6.6630518995225430e-03</internalNodes>
+          <leafValues>
+            -1.8473480641841888e-01 7.8750252723693848e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2419 4.3147690594196320e-02</internalNodes>
+          <leafValues>
+            -9.1566536575555801e-03 2.9485818743705750e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2420 -1.3808339834213257e-02</internalNodes>
+          <leafValues>
+            -2.8479158878326416e-01 3.2622188329696655e-02</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2421 1.6351899504661560e-01</internalNodes>
+          <leafValues>
+            -3.7377059925347567e-03 5.6042182445526123e-01</leafValues></_>
+        <_>
+          <internalNodes>
+            0 -1 2422 -2.4086149409413338e-02</internalNodes>
+          <leafValues>
+            1.5841430425643921e-01 -6.6294513642787933e-02</leafValues></_></weakClassifiers></_></stages>
+  <features>
+    <_>
+      <rects>
+        <_>
+          5 5 12 6 -1.</_>
+        <_>
+          9 5 4 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 10 4 -1.</_>
+        <_>
+          7 15 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 9 4 -1.</_>
+        <_>
+          6 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 6 -1.</_>
+        <_>
+          15 6 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 1 22 14 -1.</_>
+        <_>
+          11 1 11 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 4 -1.</_>
+        <_>
+          6 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 5 -1.</_>
+        <_>
+          7 6 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_>
+        <_>
+          5 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 6 -1.</_>
+        <_>
+          7 12 4 3 2.</_>
+        <_>
+          11 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 2 18 -1.</_>
+        <_>
+          20 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 12 -1.</_>
+        <_>
+          10 6 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 6 -1.</_>
+        <_>
+          10 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 2 -1.</_>
+        <_>
+          5 16 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 2 18 -1.</_>
+        <_>
+          20 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          0 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          13 7 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 4 -1.</_>
+        <_>
+          2 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 7 4 -1.</_>
+        <_>
+          13 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 12 -1.</_>
+        <_>
+          4 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 10 -1.</_>
+        <_>
+          6 8 3 5 2.</_>
+        <_>
+          9 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 6 -1.</_>
+        <_>
+          11 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 8 3 -1.</_>
+        <_>
+          5 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 4 -1.</_>
+        <_>
+          6 11 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 3 -1.</_>
+        <_>
+          10 6 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 22 5 -1.</_>
+        <_>
+          0 13 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 14 3 -1.</_>
+        <_>
+          9 13 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 10 -1.</_>
+        <_>
+          11 5 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 10 2 -1.</_>
+        <_>
+          11 5 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 8 8 -1.</_>
+        <_>
+          18 0 4 4 2.</_>
+        <_>
+          14 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 10 -1.</_>
+        <_>
+          5 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 12 -1.</_>
+        <_>
+          16 6 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 4 -1.</_>
+        <_>
+          3 3 6 2 2.</_>
+        <_>
+          9 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 20 3 -1.</_>
+        <_>
+          7 2 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 8 -1.</_>
+        <_>
+          11 7 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 18 3 -1.</_>
+        <_>
+          4 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 14 -1.</_>
+        <_>
+          3 3 8 7 2.</_>
+        <_>
+          11 10 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 4 -1.</_>
+        <_>
+          7 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 4 7 -1.</_>
+        <_>
+          10 7 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 5 -1.</_>
+        <_>
+          11 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 22 4 -1.</_>
+        <_>
+          11 6 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 12 -1.</_>
+        <_>
+          17 6 3 6 2.</_>
+        <_>
+          14 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 4 -1.</_>
+        <_>
+          4 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 6 4 -1.</_>
+        <_>
+          12 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 4 -1.</_>
+        <_>
+          4 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          12 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 3 -1.</_>
+        <_>
+          8 1 11 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 4 -1.</_>
+        <_>
+          13 0 6 2 2.</_>
+        <_>
+          7 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 6 -1.</_>
+        <_>
+          8 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 3 8 -1.</_>
+        <_>
+          15 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 7 -1.</_>
+        <_>
+          9 2 4 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 4 -1.</_>
+        <_>
+          9 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 4 7 -1.</_>
+        <_>
+          7 3 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 6 4 -1.</_>
+        <_>
+          5 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 6 -1.</_>
+        <_>
+          13 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 14 6 2 2.</_>
+        <_>
+          11 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 16 6 -1.</_>
+        <_>
+          11 12 8 3 2.</_>
+        <_>
+          3 15 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 4 -1.</_>
+        <_>
+          6 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 10 -1.</_>
+        <_>
+          14 0 5 5 2.</_>
+        <_>
+          9 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 20 11 -1.</_>
+        <_>
+          1 7 10 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 12 3 -1.</_>
+        <_>
+          9 0 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 6 6 -1.</_>
+        <_>
+          13 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 8 -1.</_>
+        <_>
+          5 2 12 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 8 6 -1.</_>
+        <_>
+          18 0 4 3 2.</_>
+        <_>
+          14 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 6 -1.</_>
+        <_>
+          9 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 6 -1.</_>
+        <_>
+          13 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 6 -1.</_>
+        <_>
+          7 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 8 6 -1.</_>
+        <_>
+          17 0 4 3 2.</_>
+        <_>
+          13 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 6 -1.</_>
+        <_>
+          0 0 4 3 2.</_>
+        <_>
+          4 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 6 -1.</_>
+        <_>
+          12 0 5 3 2.</_>
+        <_>
+          7 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 22 2 -1.</_>
+        <_>
+          11 15 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 4 -1.</_>
+        <_>
+          5 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 17 3 -1.</_>
+        <_>
+          3 10 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 16 10 -1.</_>
+        <_>
+          3 8 8 5 2.</_>
+        <_>
+          11 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 6 -1.</_>
+        <_>
+          14 0 5 3 2.</_>
+        <_>
+          9 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 4 -1.</_>
+        <_>
+          3 0 6 2 2.</_>
+        <_>
+          9 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 3 -1.</_>
+        <_>
+          4 10 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 11 4 -1.</_>
+        <_>
+          1 16 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 6 -1.</_>
+        <_>
+          13 0 6 3 2.</_>
+        <_>
+          7 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 10 6 -1.</_>
+        <_>
+          3 0 5 3 2.</_>
+        <_>
+          8 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 3 -1.</_>
+        <_>
+          6 0 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 4 -1.</_>
+        <_>
+          14 8 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 5 16 -1.</_>
+        <_>
+          0 10 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 22 5 -1.</_>
+        <_>
+          0 3 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 3 -1.</_>
+        <_>
+          10 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 14 -1.</_>
+        <_>
+          15 0 1 14 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 14 2 -1.</_>
+        <_>
+          7 0 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 5 -1.</_>
+        <_>
+          6 11 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          14 1 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 3 -1.</_>
+        <_>
+          4 1 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 4 6 -1.</_>
+        <_>
+          14 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 22 7 -1.</_>
+        <_>
+          11 10 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 11 -1.</_>
+        <_>
+          11 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 4 -1.</_>
+        <_>
+          3 14 8 2 2.</_>
+        <_>
+          11 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          14 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          11 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 4 -1.</_>
+        <_>
+          0 0 6 2 2.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 4 6 -1.</_>
+        <_>
+          15 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 4 6 -1.</_>
+        <_>
+          5 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 4 7 -1.</_>
+        <_>
+          18 5 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 5 7 4 -1.</_>
+        <_>
+          4 5 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 12 3 -1.</_>
+        <_>
+          13 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 3 -1.</_>
+        <_>
+          5 6 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 10 -1.</_>
+        <_>
+          11 0 11 5 2.</_>
+        <_>
+          0 5 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 3 -1.</_>
+        <_>
+          2 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 8 6 -1.</_>
+        <_>
+          17 3 4 3 2.</_>
+        <_>
+          13 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 4 -1.</_>
+        <_>
+          4 14 7 2 2.</_>
+        <_>
+          11 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 11 -1.</_>
+        <_>
+          11 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 11 4 -1.</_>
+        <_>
+          11 2 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 3 -1.</_>
+        <_>
+          10 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 4 6 -1.</_>
+        <_>
+          9 7 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 6 -1.</_>
+        <_>
+          11 11 8 3 2.</_>
+        <_>
+          3 14 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 6 -1.</_>
+        <_>
+          1 3 4 3 2.</_>
+        <_>
+          5 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 3 -1.</_>
+        <_>
+          5 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 4 -1.</_>
+        <_>
+          11 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 15 3 -1.</_>
+        <_>
+          7 4 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 4 -1.</_>
+        <_>
+          6 8 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 3 -1.</_>
+        <_>
+          10 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 3 -1.</_>
+        <_>
+          6 7 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 9 4 -1.</_>
+        <_>
+          10 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 16 -1.</_>
+        <_>
+          6 10 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 6 -1.</_>
+        <_>
+          10 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 3 -1.</_>
+        <_>
+          6 11 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 8 -1.</_>
+        <_>
+          17 9 3 4 2.</_>
+        <_>
+          14 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 10 6 8 -1.</_>
+        <_>
+          14 10 3 4 2.</_>
+        <_>
+          11 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 2 -1.</_>
+        <_>
+          5 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 14 4 -1.</_>
+        <_>
+          5 11 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 8 -1.</_>
+        <_>
+          2 9 3 4 2.</_>
+        <_>
+          5 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 4 -1.</_>
+        <_>
+          15 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 4 -1.</_>
+        <_>
+          4 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 8 5 -1.</_>
+        <_>
+          13 5 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 2 -1.</_>
+        <_>
+          11 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 9 12 -1.</_>
+        <_>
+          15 10 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 8 -1.</_>
+        <_>
+          5 10 3 4 2.</_>
+        <_>
+          8 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 12 -1.</_>
+        <_>
+          9 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 2 -1.</_>
+        <_>
+          11 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 12 -1.</_>
+        <_>
+          10 4 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 8 5 -1.</_>
+        <_>
+          5 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 4 -1.</_>
+        <_>
+          14 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 9 -1.</_>
+        <_>
+          11 3 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 4 -1.</_>
+        <_>
+          7 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 6 10 -1.</_>
+        <_>
+          13 7 3 5 2.</_>
+        <_>
+          10 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 6 10 -1.</_>
+        <_>
+          6 7 3 5 2.</_>
+        <_>
+          9 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 2 -1.</_>
+        <_>
+          7 0 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 9 -1.</_>
+        <_>
+          2 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 6 15 -1.</_>
+        <_>
+          12 2 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 6 15 -1.</_>
+        <_>
+          7 2 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 12 4 -1.</_>
+        <_>
+          7 13 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 14 -1.</_>
+        <_>
+          4 4 2 7 2.</_>
+        <_>
+          6 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 9 12 -1.</_>
+        <_>
+          15 10 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 9 12 -1.</_>
+        <_>
+          4 10 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 8 12 -1.</_>
+        <_>
+          17 6 4 6 2.</_>
+        <_>
+          13 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 3 -1.</_>
+        <_>
+          11 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 3 -1.</_>
+        <_>
+          9 5 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 2 18 -1.</_>
+        <_>
+          10 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 2 -1.</_>
+        <_>
+          4 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 4 -1.</_>
+        <_>
+          6 0 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 4 -1.</_>
+        <_>
+          13 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 4 -1.</_>
+        <_>
+          5 0 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 14 4 -1.</_>
+        <_>
+          14 9 7 2 2.</_>
+        <_>
+          7 11 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 18 -1.</_>
+        <_>
+          1 0 4 9 2.</_>
+        <_>
+          5 9 4 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 4 -1.</_>
+        <_>
+          13 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 6 -1.</_>
+        <_>
+          9 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 6 4 -1.</_>
+        <_>
+          6 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 7 -1.</_>
+        <_>
+          13 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 6 4 -1.</_>
+        <_>
+          6 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 5 -1.</_>
+        <_>
+          13 7 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 3 -1.</_>
+        <_>
+          9 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 6 -1.</_>
+        <_>
+          13 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 6 -1.</_>
+        <_>
+          5 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          15 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 10 -1.</_>
+        <_>
+          10 2 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          15 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          5 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 6 -1.</_>
+        <_>
+          11 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 6 -1.</_>
+        <_>
+          5 12 4 3 2.</_>
+        <_>
+          9 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 6 -1.</_>
+        <_>
+          11 11 6 3 2.</_>
+        <_>
+          5 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 22 8 -1.</_>
+        <_>
+          0 9 11 4 2.</_>
+        <_>
+          11 13 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 13 3 -1.</_>
+        <_>
+          6 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 8 6 -1.</_>
+        <_>
+          0 2 4 3 2.</_>
+        <_>
+          4 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 3 -1.</_>
+        <_>
+          4 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 12 3 -1.</_>
+        <_>
+          4 10 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 5 16 -1.</_>
+        <_>
+          16 10 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 7 4 -1.</_>
+        <_>
+          6 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 20 8 -1.</_>
+        <_>
+          11 7 10 4 2.</_>
+        <_>
+          1 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 3 -1.</_>
+        <_>
+          5 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 6 4 -1.</_>
+        <_>
+          13 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 5 8 -1.</_>
+        <_>
+          1 4 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 13 8 -1.</_>
+        <_>
+          5 4 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 4 8 -1.</_>
+        <_>
+          9 5 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 8 -1.</_>
+        <_>
+          9 4 8 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 8 -1.</_>
+        <_>
+          13 4 4 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 14 4 -1.</_>
+        <_>
+          15 0 7 2 2.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 12 4 -1.</_>
+        <_>
+          0 10 6 2 2.</_>
+        <_>
+          6 12 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 14 4 -1.</_>
+        <_>
+          15 0 7 2 2.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 14 -1.</_>
+        <_>
+          7 4 8 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 13 6 4 -1.</_>
+        <_>
+          13 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 6 4 -1.</_>
+        <_>
+          3 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 10 -1.</_>
+        <_>
+          11 5 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 10 2 -1.</_>
+        <_>
+          11 5 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 18 4 -1.</_>
+        <_>
+          13 0 9 2 2.</_>
+        <_>
+          4 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 4 6 -1.</_>
+        <_>
+          6 5 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 6 6 6 -1.</_>
+        <_>
+          14 8 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 6 -1.</_>
+        <_>
+          8 8 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 18 12 -1.</_>
+        <_>
+          4 0 9 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          2 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 6 -1.</_>
+        <_>
+          7 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 12 -1.</_>
+        <_>
+          8 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 6 6 -1.</_>
+        <_>
+          15 5 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 3 -1.</_>
+        <_>
+          6 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 3 -1.</_>
+        <_>
+          8 6 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 22 2 -1.</_>
+        <_>
+          11 11 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 4 -1.</_>
+        <_>
+          6 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 12 -1.</_>
+        <_>
+          14 0 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 10 6 4 -1.</_>
+        <_>
+          8 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 6 -1.</_>
+        <_>
+          11 12 10 3 2.</_>
+        <_>
+          1 15 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 3 -1.</_>
+        <_>
+          9 15 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 10 -1.</_>
+        <_>
+          13 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 10 4 -1.</_>
+        <_>
+          9 0 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 10 -1.</_>
+        <_>
+          13 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 3 10 -1.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 4 -1.</_>
+        <_>
+          11 4 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 10 20 8 -1.</_>
+        <_>
+          0 10 10 4 2.</_>
+        <_>
+          10 14 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 6 7 -1.</_>
+        <_>
+          17 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 9 4 -1.</_>
+        <_>
+          4 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 8 -1.</_>
+        <_>
+          15 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 7 -1.</_>
+        <_>
+          3 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 4 -1.</_>
+        <_>
+          12 6 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 2 -1.</_>
+        <_>
+          11 2 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 11 8 -1.</_>
+        <_>
+          11 4 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 22 6 -1.</_>
+        <_>
+          0 1 11 3 2.</_>
+        <_>
+          11 4 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 7 -1.</_>
+        <_>
+          7 1 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 4 6 -1.</_>
+        <_>
+          16 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 7 -1.</_>
+        <_>
+          6 11 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 6 -1.</_>
+        <_>
+          13 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 3 -1.</_>
+        <_>
+          0 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 3 -1.</_>
+        <_>
+          6 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 22 10 -1.</_>
+        <_>
+          0 4 11 5 2.</_>
+        <_>
+          11 9 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 8 4 -1.</_>
+        <_>
+          14 3 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 6 -1.</_>
+        <_>
+          5 5 6 3 2.</_>
+        <_>
+          11 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 6 -1.</_>
+        <_>
+          13 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 13 -1.</_>
+        <_>
+          10 4 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 13 -1.</_>
+        <_>
+          12 3 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 6 -1.</_>
+        <_>
+          11 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 12 15 -1.</_>
+        <_>
+          11 7 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 12 15 -1.</_>
+        <_>
+          7 7 4 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 12 -1.</_>
+        <_>
+          9 6 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 12 -1.</_>
+        <_>
+          8 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 8 7 -1.</_>
+        <_>
+          10 9 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 7 -1.</_>
+        <_>
+          8 9 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 22 14 -1.</_>
+        <_>
+          11 4 11 7 2.</_>
+        <_>
+          0 11 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 6 -1.</_>
+        <_>
+          2 14 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 4 -1.</_>
+        <_>
+          14 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 4 -1.</_>
+        <_>
+          6 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 6 5 -1.</_>
+        <_>
+          15 6 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 5 6 -1.</_>
+        <_>
+          7 6 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 8 6 -1.</_>
+        <_>
+          13 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 10 8 -1.</_>
+        <_>
+          6 12 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 2 -1.</_>
+        <_>
+          2 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 8 3 -1.</_>
+        <_>
+          5 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 4 -1.</_>
+        <_>
+          14 7 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 2 -1.</_>
+        <_>
+          10 0 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 4 6 -1.</_>
+        <_>
+          17 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 9 -1.</_>
+        <_>
+          7 3 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 12 -1.</_>
+        <_>
+          3 6 16 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 10 -1.</_>
+        <_>
+          11 0 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 22 14 -1.</_>
+        <_>
+          11 3 11 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 7 -1.</_>
+        <_>
+          12 3 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 11 4 -1.</_>
+        <_>
+          10 2 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 4 -1.</_>
+        <_>
+          14 7 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 12 -1.</_>
+        <_>
+          5 11 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 20 9 -1.</_>
+        <_>
+          2 6 10 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 18 3 -1.</_>
+        <_>
+          7 9 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 6 -1.</_>
+        <_>
+          13 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 4 -1.</_>
+        <_>
+          11 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 6 -1.</_>
+        <_>
+          7 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 8 -1.</_>
+        <_>
+          16 1 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 3 -1.</_>
+        <_>
+          9 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 4 -1.</_>
+        <_>
+          2 9 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 10 4 -1.</_>
+        <_>
+          11 1 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 8 -1.</_>
+        <_>
+          16 1 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 3 -1.</_>
+        <_>
+          6 1 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 4 -1.</_>
+        <_>
+          16 0 6 2 2.</_>
+        <_>
+          10 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 3 -1.</_>
+        <_>
+          5 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 14 3 -1.</_>
+        <_>
+          8 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 4 -1.</_>
+        <_>
+          0 0 6 2 2.</_>
+        <_>
+          6 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 14 4 -1.</_>
+        <_>
+          15 0 7 2 2.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 8 6 -1.</_>
+        <_>
+          0 5 4 3 2.</_>
+        <_>
+          4 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 4 -1.</_>
+        <_>
+          14 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 10 4 -1.</_>
+        <_>
+          11 12 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 6 -1.</_>
+        <_>
+          12 8 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 6 -1.</_>
+        <_>
+          10 8 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 10 -1.</_>
+        <_>
+          2 8 3 5 2.</_>
+        <_>
+          5 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 9 -1.</_>
+        <_>
+          12 4 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 4 -1.</_>
+        <_>
+          2 0 6 2 2.</_>
+        <_>
+          8 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 9 -1.</_>
+        <_>
+          12 6 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 9 4 -1.</_>
+        <_>
+          10 4 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 13 8 5 -1.</_>
+        <_>
+          13 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 8 5 -1.</_>
+        <_>
+          5 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 8 3 -1.</_>
+        <_>
+          7 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 4 -1.</_>
+        <_>
+          11 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 8 -1.</_>
+        <_>
+          12 8 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 1 6 8 -1.</_>
+        <_>
+          7 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 14 6 4 -1.</_>
+        <_>
+          14 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 3 -1.</_>
+        <_>
+          10 8 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 12 -1.</_>
+        <_>
+          8 7 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 6 -1.</_>
+        <_>
+          8 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 3 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 6 -1.</_>
+        <_>
+          9 5 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 6 -1.</_>
+        <_>
+          9 6 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 6 -1.</_>
+        <_>
+          13 6 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 8 6 4 -1.</_>
+        <_>
+          12 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 8 3 -1.</_>
+        <_>
+          9 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 22 13 -1.</_>
+        <_>
+          0 5 11 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 9 6 -1.</_>
+        <_>
+          5 12 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 3 10 -1.</_>
+        <_>
+          19 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 16 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 10 4 -1.</_>
+        <_>
+          10 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 14 3 -1.</_>
+        <_>
+          1 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 4 -1.</_>
+        <_>
+          11 14 8 2 2.</_>
+        <_>
+          3 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 6 4 -1.</_>
+        <_>
+          3 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 11 4 -1.</_>
+        <_>
+          10 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 11 4 -1.</_>
+        <_>
+          1 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 6 -1.</_>
+        <_>
+          9 5 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 3 -1.</_>
+        <_>
+          4 6 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 7 6 -1.</_>
+        <_>
+          12 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 16 4 -1.</_>
+        <_>
+          1 4 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 15 3 -1.</_>
+        <_>
+          4 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 6 -1.</_>
+        <_>
+          2 4 9 3 2.</_>
+        <_>
+          11 7 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 13 -1.</_>
+        <_>
+          14 5 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 6 4 -1.</_>
+        <_>
+          4 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 5 -1.</_>
+        <_>
+          8 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 4 6 -1.</_>
+        <_>
+          10 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 12 4 -1.</_>
+        <_>
+          6 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 10 3 -1.</_>
+        <_>
+          8 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 12 -1.</_>
+        <_>
+          12 2 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 16 -1.</_>
+        <_>
+          7 2 7 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 20 4 -1.</_>
+        <_>
+          6 5 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 15 -1.</_>
+        <_>
+          9 1 9 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 6 8 -1.</_>
+        <_>
+          15 4 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 13 4 -1.</_>
+        <_>
+          4 15 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 12 -1.</_>
+        <_>
+          12 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 15 2 -1.</_>
+        <_>
+          0 17 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 6 4 -1.</_>
+        <_>
+          12 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          5 14 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          12 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 15 3 -1.</_>
+        <_>
+          0 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 14 3 -1.</_>
+        <_>
+          6 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 7 6 -1.</_>
+        <_>
+          4 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 6 -1.</_>
+        <_>
+          11 6 5 3 2.</_>
+        <_>
+          6 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 16 2 -1.</_>
+        <_>
+          3 0 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 9 -1.</_>
+        <_>
+          5 12 12 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 6 -1.</_>
+        <_>
+          6 12 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 6 -1.</_>
+        <_>
+          7 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 3 12 -1.</_>
+        <_>
+          6 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          14 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 3 -1.</_>
+        <_>
+          10 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 14 4 -1.</_>
+        <_>
+          4 15 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 11 3 -1.</_>
+        <_>
+          9 5 11 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 4 9 -1.</_>
+        <_>
+          12 5 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 13 3 -1.</_>
+        <_>
+          0 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 10 -1.</_>
+        <_>
+          16 2 3 5 2.</_>
+        <_>
+          13 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 10 -1.</_>
+        <_>
+          3 2 3 5 2.</_>
+        <_>
+          6 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 11 -1.</_>
+        <_>
+          11 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 12 3 -1.</_>
+        <_>
+          4 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 12 -1.</_>
+        <_>
+          12 1 2 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 11 4 -1.</_>
+        <_>
+          11 2 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 9 -1.</_>
+        <_>
+          11 0 2 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 4 -1.</_>
+        <_>
+          11 0 9 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 10 -1.</_>
+        <_>
+          19 2 3 5 2.</_>
+        <_>
+          16 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          10 1 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 8 -1.</_>
+        <_>
+          12 1 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 3 -1.</_>
+        <_>
+          10 1 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 1 4 12 -1.</_>
+        <_>
+          19 1 2 6 2.</_>
+        <_>
+          17 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 5 -1.</_>
+        <_>
+          8 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 13 -1.</_>
+        <_>
+          10 4 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 6 8 -1.</_>
+        <_>
+          19 3 3 4 2.</_>
+        <_>
+          16 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 8 -1.</_>
+        <_>
+          0 3 3 4 2.</_>
+        <_>
+          3 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 12 4 -1.</_>
+        <_>
+          16 9 6 2 2.</_>
+        <_>
+          10 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 9 12 -1.</_>
+        <_>
+          4 6 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 6 -1.</_>
+        <_>
+          15 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 3 -1.</_>
+        <_>
+          11 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 16 20 2 -1.</_>
+        <_>
+          2 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 10 6 -1.</_>
+        <_>
+          1 8 5 3 2.</_>
+        <_>
+          6 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 16 14 -1.</_>
+        <_>
+          14 3 8 7 2.</_>
+        <_>
+          6 10 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 8 -1.</_>
+        <_>
+          1 4 3 4 2.</_>
+        <_>
+          4 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 12 4 -1.</_>
+        <_>
+          7 3 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 6 9 -1.</_>
+        <_>
+          4 9 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 10 4 -1.</_>
+        <_>
+          12 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 5 -1.</_>
+        <_>
+          5 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 6 6 -1.</_>
+        <_>
+          17 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 6 6 -1.</_>
+        <_>
+          3 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          10 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 16 -1.</_>
+        <_>
+          5 10 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 18 14 -1.</_>
+        <_>
+          4 9 18 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 14 -1.</_>
+        <_>
+          5 11 12 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 20 8 -1.</_>
+        <_>
+          7 5 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 7 -1.</_>
+        <_>
+          8 0 5 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 5 8 -1.</_>
+        <_>
+          12 0 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 13 -1.</_>
+        <_>
+          10 4 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 4 -1.</_>
+        <_>
+          7 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 12 -1.</_>
+        <_>
+          9 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 3 12 -1.</_>
+        <_>
+          4 4 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 15 -1.</_>
+        <_>
+          12 3 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 7 6 -1.</_>
+        <_>
+          5 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          9 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 2 -1.</_>
+        <_>
+          5 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 6 -1.</_>
+        <_>
+          6 12 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 9 4 -1.</_>
+        <_>
+          11 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 4 -1.</_>
+        <_>
+          8 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 12 -1.</_>
+        <_>
+          14 10 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 9 12 -1.</_>
+        <_>
+          5 10 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 12 2 -1.</_>
+        <_>
+          5 10 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 16 3 -1.</_>
+        <_>
+          4 3 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 3 -1.</_>
+        <_>
+          0 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 12 3 -1.</_>
+        <_>
+          10 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 3 -1.</_>
+        <_>
+          11 14 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 8 3 -1.</_>
+        <_>
+          8 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 8 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 3 11 -1.</_>
+        <_>
+          16 2 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 10 4 -1.</_>
+        <_>
+          7 2 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 5 15 3 -1.</_>
+        <_>
+          5 6 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 9 5 -1.</_>
+        <_>
+          8 1 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 18 -1.</_>
+        <_>
+          15 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 5 16 -1.</_>
+        <_>
+          6 8 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 8 -1.</_>
+        <_>
+          12 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 2 -1.</_>
+        <_>
+          11 4 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 3 -1.</_>
+        <_>
+          14 0 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 20 13 -1.</_>
+        <_>
+          5 2 10 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 8 -1.</_>
+        <_>
+          12 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 8 -1.</_>
+        <_>
+          6 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          9 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 14 2 -1.</_>
+        <_>
+          7 1 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 10 -1.</_>
+        <_>
+          4 13 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 4 -1.</_>
+        <_>
+          14 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 17 8 -1.</_>
+        <_>
+          1 11 17 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 7 6 -1.</_>
+        <_>
+          10 15 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 9 -1.</_>
+        <_>
+          10 1 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 4 11 -1.</_>
+        <_>
+          11 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 9 -1.</_>
+        <_>
+          8 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 4 -1.</_>
+        <_>
+          14 3 6 2 2.</_>
+        <_>
+          8 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 7 4 -1.</_>
+        <_>
+          5 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 13 -1.</_>
+        <_>
+          13 0 2 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 13 4 -1.</_>
+        <_>
+          9 0 13 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 9 4 9 -1.</_>
+        <_>
+          12 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 12 2 -1.</_>
+        <_>
+          7 4 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 10 6 -1.</_>
+        <_>
+          17 5 5 3 2.</_>
+        <_>
+          12 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 17 3 -1.</_>
+        <_>
+          1 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 6 8 -1.</_>
+        <_>
+          18 4 3 4 2.</_>
+        <_>
+          15 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 14 -1.</_>
+        <_>
+          3 2 2 7 2.</_>
+        <_>
+          5 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 4 -1.</_>
+        <_>
+          14 8 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 4 16 -1.</_>
+        <_>
+          14 1 2 8 2.</_>
+        <_>
+          12 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 6 8 -1.</_>
+        <_>
+          7 0 3 4 2.</_>
+        <_>
+          10 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 5 -1.</_>
+        <_>
+          8 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 12 -1.</_>
+        <_>
+          7 5 3 6 2.</_>
+        <_>
+          10 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 6 6 -1.</_>
+        <_>
+          15 5 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 10 3 8 -1.</_>
+        <_>
+          6 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 3 -1.</_>
+        <_>
+          4 1 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 3 -1.</_>
+        <_>
+          4 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 10 10 -1.</_>
+        <_>
+          3 0 5 5 2.</_>
+        <_>
+          8 5 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          5 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 10 3 -1.</_>
+        <_>
+          11 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 15 10 3 -1.</_>
+        <_>
+          12 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 3 -1.</_>
+        <_>
+          5 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 17 14 -1.</_>
+        <_>
+          3 7 17 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 16 -1.</_>
+        <_>
+          9 0 2 8 2.</_>
+        <_>
+          11 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 8 -1.</_>
+        <_>
+          11 8 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 3 -1.</_>
+        <_>
+          0 10 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 20 8 -1.</_>
+        <_>
+          11 5 10 4 2.</_>
+        <_>
+          1 9 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 13 3 -1.</_>
+        <_>
+          1 9 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 14 3 -1.</_>
+        <_>
+          8 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 14 2 -1.</_>
+        <_>
+          4 17 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 6 -1.</_>
+        <_>
+          12 2 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 3 -1.</_>
+        <_>
+          10 2 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 10 -1.</_>
+        <_>
+          16 1 3 5 2.</_>
+        <_>
+          13 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 10 3 -1.</_>
+        <_>
+          10 1 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          13 2 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          9 2 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 10 -1.</_>
+        <_>
+          16 1 3 5 2.</_>
+        <_>
+          13 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 10 -1.</_>
+        <_>
+          3 1 3 5 2.</_>
+        <_>
+          6 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 6 10 -1.</_>
+        <_>
+          17 7 3 5 2.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 8 -1.</_>
+        <_>
+          3 2 3 4 2.</_>
+        <_>
+          6 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 9 4 -1.</_>
+        <_>
+          14 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 15 8 -1.</_>
+        <_>
+          1 12 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 4 -1.</_>
+        <_>
+          9 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 7 6 -1.</_>
+        <_>
+          6 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 5 -1.</_>
+        <_>
+          9 5 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          2 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 4 -1.</_>
+        <_>
+          14 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 6 8 -1.</_>
+        <_>
+          11 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          9 4 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 10 3 -1.</_>
+        <_>
+          5 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 9 -1.</_>
+        <_>
+          12 6 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 3 -1.</_>
+        <_>
+          10 6 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 4 -1.</_>
+        <_>
+          12 6 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 8 -1.</_>
+        <_>
+          10 6 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 5 12 -1.</_>
+        <_>
+          13 0 5 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 3 12 4 -1.</_>
+        <_>
+          4 3 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 5 -1.</_>
+        <_>
+          15 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 3 -1.</_>
+        <_>
+          1 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 5 -1.</_>
+        <_>
+          15 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 5 -1.</_>
+        <_>
+          4 7 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 4 -1.</_>
+        <_>
+          12 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 6 -1.</_>
+        <_>
+          5 12 6 3 2.</_>
+        <_>
+          11 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 2 9 -1.</_>
+        <_>
+          11 5 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 2 -1.</_>
+        <_>
+          11 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 12 9 4 -1.</_>
+        <_>
+          13 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 6 6 -1.</_>
+        <_>
+          8 6 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 3 -1.</_>
+        <_>
+          0 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 3 -1.</_>
+        <_>
+          8 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 5 6 -1.</_>
+        <_>
+          8 7 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 3 -1.</_>
+        <_>
+          12 6 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 4 6 -1.</_>
+        <_>
+          6 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 4 -1.</_>
+        <_>
+          6 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 8 7 -1.</_>
+        <_>
+          8 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 9 -1.</_>
+        <_>
+          12 4 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 8 22 4 -1.</_>
+        <_>
+          11 8 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 3 -1.</_>
+        <_>
+          3 10 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 9 3 -1.</_>
+        <_>
+          10 4 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 4 6 -1.</_>
+        <_>
+          9 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 6 -1.</_>
+        <_>
+          9 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 16 5 -1.</_>
+        <_>
+          10 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 3 -1.</_>
+        <_>
+          12 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 12 2 -1.</_>
+        <_>
+          10 4 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 3 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 10 3 -1.</_>
+        <_>
+          9 6 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 8 -1.</_>
+        <_>
+          13 1 3 4 2.</_>
+        <_>
+          10 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 6 -1.</_>
+        <_>
+          11 1 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 4 -1.</_>
+        <_>
+          11 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 12 3 -1.</_>
+        <_>
+          2 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 8 4 -1.</_>
+        <_>
+          11 3 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 6 -1.</_>
+        <_>
+          1 0 4 3 2.</_>
+        <_>
+          5 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 3 -1.</_>
+        <_>
+          8 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 4 8 -1.</_>
+        <_>
+          11 3 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 10 -1.</_>
+        <_>
+          9 0 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 14 2 -1.</_>
+        <_>
+          4 17 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 12 3 -1.</_>
+        <_>
+          10 12 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 6 -1.</_>
+        <_>
+          5 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 6 4 -1.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 10 4 -1.</_>
+        <_>
+          5 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 16 4 -1.</_>
+        <_>
+          11 1 8 2 2.</_>
+        <_>
+          3 3 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 11 4 -1.</_>
+        <_>
+          0 3 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 11 6 -1.</_>
+        <_>
+          6 11 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 5 10 -1.</_>
+        <_>
+          8 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 6 -1.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 6 -1.</_>
+        <_>
+          2 3 6 3 2.</_>
+        <_>
+          8 6 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 9 -1.</_>
+        <_>
+          13 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 7 9 -1.</_>
+        <_>
+          2 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 6 -1.</_>
+        <_>
+          12 1 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 13 3 -1.</_>
+        <_>
+          3 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 3 -1.</_>
+        <_>
+          8 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 7 12 -1.</_>
+        <_>
+          3 9 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 4 -1.</_>
+        <_>
+          12 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 4 -1.</_>
+        <_>
+          4 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 15 2 -1.</_>
+        <_>
+          6 2 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 3 12 -1.</_>
+        <_>
+          5 3 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 2 12 -1.</_>
+        <_>
+          14 4 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          10 1 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 9 14 5 -1.</_>
+        <_>
+          4 9 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 10 3 -1.</_>
+        <_>
+          10 3 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 12 7 6 -1.</_>
+        <_>
+          9 14 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 10 -1.</_>
+        <_>
+          1 8 4 5 2.</_>
+        <_>
+          5 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 5 -1.</_>
+        <_>
+          9 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 8 10 -1.</_>
+        <_>
+          7 11 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 4 -1.</_>
+        <_>
+          9 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 2 -1.</_>
+        <_>
+          5 16 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 10 6 -1.</_>
+        <_>
+          6 6 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 6 -1.</_>
+        <_>
+          9 14 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 5 -1.</_>
+        <_>
+          6 11 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 4 -1.</_>
+        <_>
+          10 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 6 -1.</_>
+        <_>
+          2 6 18 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 11 -1.</_>
+        <_>
+          8 4 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 11 2 -1.</_>
+        <_>
+          11 5 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 18 9 -1.</_>
+        <_>
+          9 9 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 10 9 -1.</_>
+        <_>
+          8 2 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 6 -1.</_>
+        <_>
+          16 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 6 -1.</_>
+        <_>
+          8 5 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 10 4 -1.</_>
+        <_>
+          11 3 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 6 -1.</_>
+        <_>
+          6 3 4 3 2.</_>
+        <_>
+          10 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 15 -1.</_>
+        <_>
+          16 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 15 -1.</_>
+        <_>
+          3 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 16 -1.</_>
+        <_>
+          8 2 6 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 9 -1.</_>
+        <_>
+          5 12 13 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 3 -1.</_>
+        <_>
+          11 7 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 4 -1.</_>
+        <_>
+          10 0 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 5 -1.</_>
+        <_>
+          10 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 6 -1.</_>
+        <_>
+          8 9 6 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 3 -1.</_>
+        <_>
+          10 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 14 8 4 -1.</_>
+        <_>
+          13 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 4 -1.</_>
+        <_>
+          1 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 3 10 -1.</_>
+        <_>
+          12 5 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 3 -1.</_>
+        <_>
+          10 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 6 -1.</_>
+        <_>
+          11 12 9 3 2.</_>
+        <_>
+          2 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 6 -1.</_>
+        <_>
+          5 2 4 3 2.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 8 -1.</_>
+        <_>
+          1 10 3 4 2.</_>
+        <_>
+          4 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 15 9 -1.</_>
+        <_>
+          12 5 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 15 9 -1.</_>
+        <_>
+          5 5 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 7 -1.</_>
+        <_>
+          12 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 14 6 2 2.</_>
+        <_>
+          11 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          10 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 3 12 -1.</_>
+        <_>
+          9 1 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 6 7 -1.</_>
+        <_>
+          14 2 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 12 9 -1.</_>
+        <_>
+          5 3 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 7 6 -1.</_>
+        <_>
+          8 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 3 -1.</_>
+        <_>
+          6 12 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 16 -1.</_>
+        <_>
+          5 6 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 7 6 -1.</_>
+        <_>
+          4 6 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          11 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 2 -1.</_>
+        <_>
+          7 0 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 2 -1.</_>
+        <_>
+          5 15 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 6 -1.</_>
+        <_>
+          3 13 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 8 -1.</_>
+        <_>
+          11 5 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 15 12 3 -1.</_>
+        <_>
+          8 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 15 3 -1.</_>
+        <_>
+          9 13 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 4 -1.</_>
+        <_>
+          2 3 6 2 2.</_>
+        <_>
+          8 5 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 4 7 -1.</_>
+        <_>
+          17 5 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 7 4 -1.</_>
+        <_>
+          5 4 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 3 -1.</_>
+        <_>
+          8 2 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 18 9 -1.</_>
+        <_>
+          8 5 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 6 4 -1.</_>
+        <_>
+          15 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 3 -1.</_>
+        <_>
+          0 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 4 -1.</_>
+        <_>
+          16 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 14 6 -1.</_>
+        <_>
+          7 9 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 8 4 -1.</_>
+        <_>
+          13 5 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 8 -1.</_>
+        <_>
+          9 5 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 14 -1.</_>
+        <_>
+          12 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 20 5 -1.</_>
+        <_>
+          6 13 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 14 -1.</_>
+        <_>
+          12 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 14 -1.</_>
+        <_>
+          7 11 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 4 -1.</_>
+        <_>
+          16 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 6 -1.</_>
+        <_>
+          6 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 14 -1.</_>
+        <_>
+          7 11 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 16 2 -1.</_>
+        <_>
+          1 17 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 4 -1.</_>
+        <_>
+          3 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 9 -1.</_>
+        <_>
+          6 12 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 6 5 -1.</_>
+        <_>
+          3 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 4 -1.</_>
+        <_>
+          11 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 8 2 -1.</_>
+        <_>
+          7 8 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 13 7 4 -1.</_>
+        <_>
+          10 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 20 2 -1.</_>
+        <_>
+          11 16 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 14 4 -1.</_>
+        <_>
+          5 12 7 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 4 6 -1.</_>
+        <_>
+          8 8 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 2 2 14 -1.</_>
+        <_>
+          17 2 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 4 -1.</_>
+        <_>
+          11 1 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 3 -1.</_>
+        <_>
+          9 7 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 6 4 -1.</_>
+        <_>
+          5 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 9 12 4 -1.</_>
+        <_>
+          16 9 6 2 2.</_>
+        <_>
+          10 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 4 -1.</_>
+        <_>
+          9 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 2 6 -1.</_>
+        <_>
+          11 9 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 9 14 9 -1.</_>
+        <_>
+          3 12 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 16 6 -1.</_>
+        <_>
+          5 12 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 10 6 -1.</_>
+        <_>
+          5 12 5 3 2.</_>
+        <_>
+          10 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 18 5 -1.</_>
+        <_>
+          4 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 5 -1.</_>
+        <_>
+          9 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 16 3 -1.</_>
+        <_>
+          4 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 2 -1.</_>
+        <_>
+          5 1 15 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 9 -1.</_>
+        <_>
+          13 5 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 2 -1.</_>
+        <_>
+          9 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 5 -1.</_>
+        <_>
+          6 11 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 13 3 -1.</_>
+        <_>
+          3 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 4 12 -1.</_>
+        <_>
+          20 5 2 6 2.</_>
+        <_>
+          18 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 5 6 -1.</_>
+        <_>
+          4 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 8 -1.</_>
+        <_>
+          15 1 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 2 -1.</_>
+        <_>
+          7 1 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 5 4 12 -1.</_>
+        <_>
+          20 5 2 6 2.</_>
+        <_>
+          18 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 2 -1.</_>
+        <_>
+          10 4 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 20 4 -1.</_>
+        <_>
+          7 4 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 8 3 -1.</_>
+        <_>
+          5 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 5 4 12 -1.</_>
+        <_>
+          20 5 2 6 2.</_>
+        <_>
+          18 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 12 -1.</_>
+        <_>
+          0 5 2 6 2.</_>
+        <_>
+          2 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 18 -1.</_>
+        <_>
+          6 9 14 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 12 3 -1.</_>
+        <_>
+          4 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 14 3 -1.</_>
+        <_>
+          8 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 14 3 -1.</_>
+        <_>
+          4 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 14 -1.</_>
+        <_>
+          11 2 3 7 2.</_>
+        <_>
+          8 9 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 4 -1.</_>
+        <_>
+          0 14 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 7 4 -1.</_>
+        <_>
+          11 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 7 3 -1.</_>
+        <_>
+          10 8 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          10 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 14 -1.</_>
+        <_>
+          2 0 2 7 2.</_>
+        <_>
+          4 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 18 5 -1.</_>
+        <_>
+          8 6 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 18 -1.</_>
+        <_>
+          8 0 6 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 8 -1.</_>
+        <_>
+          14 2 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 12 18 -1.</_>
+        <_>
+          4 0 6 9 2.</_>
+        <_>
+          10 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 14 6 4 -1.</_>
+        <_>
+          12 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 6 4 -1.</_>
+        <_>
+          4 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 2 6 -1.</_>
+        <_>
+          11 8 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 10 20 6 -1.</_>
+        <_>
+          1 10 10 3 2.</_>
+        <_>
+          11 13 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 9 -1.</_>
+        <_>
+          10 4 7 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 3 4 6 -1.</_>
+        <_>
+          5 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 12 -1.</_>
+        <_>
+          13 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 3 -1.</_>
+        <_>
+          11 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 12 11 -1.</_>
+        <_>
+          12 6 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 9 -1.</_>
+        <_>
+          11 8 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          11 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 12 4 -1.</_>
+        <_>
+          7 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 7 -1.</_>
+        <_>
+          12 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 4 -1.</_>
+        <_>
+          11 0 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 12 -1.</_>
+        <_>
+          12 6 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 12 -1.</_>
+        <_>
+          8 6 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 6 -1.</_>
+        <_>
+          6 12 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 6 -1.</_>
+        <_>
+          14 6 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 13 20 5 -1.</_>
+        <_>
+          6 13 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 14 6 4 -1.</_>
+        <_>
+          8 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 3 -1.</_>
+        <_>
+          4 7 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 15 -1.</_>
+        <_>
+          16 0 1 15 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 12 2 -1.</_>
+        <_>
+          9 3 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 6 -1.</_>
+        <_>
+          9 1 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 3 -1.</_>
+        <_>
+          10 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 6 -1.</_>
+        <_>
+          10 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 16 3 -1.</_>
+        <_>
+          1 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 12 3 -1.</_>
+        <_>
+          9 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 6 -1.</_>
+        <_>
+          0 0 11 3 2.</_>
+        <_>
+          11 3 11 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 6 -1.</_>
+        <_>
+          10 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 8 5 -1.</_>
+        <_>
+          10 0 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 10 -1.</_>
+        <_>
+          13 5 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 4 -1.</_>
+        <_>
+          9 5 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 2 8 -1.</_>
+        <_>
+          15 1 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 2 -1.</_>
+        <_>
+          7 1 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 11 -1.</_>
+        <_>
+          18 1 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 6 -1.</_>
+        <_>
+          9 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 12 -1.</_>
+        <_>
+          17 6 3 6 2.</_>
+        <_>
+          14 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 6 -1.</_>
+        <_>
+          8 14 6 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 16 10 -1.</_>
+        <_>
+          3 8 8 5 2.</_>
+        <_>
+          11 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 6 -1.</_>
+        <_>
+          15 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 18 10 -1.</_>
+        <_>
+          2 8 9 5 2.</_>
+        <_>
+          11 13 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          10 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 12 3 -1.</_>
+        <_>
+          1 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 14 4 -1.</_>
+        <_>
+          15 0 7 2 2.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 14 4 -1.</_>
+        <_>
+          2 5 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 3 -1.</_>
+        <_>
+          8 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 8 -1.</_>
+        <_>
+          1 0 4 4 2.</_>
+        <_>
+          5 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 8 6 -1.</_>
+        <_>
+          17 0 4 3 2.</_>
+        <_>
+          13 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 6 -1.</_>
+        <_>
+          1 0 4 3 2.</_>
+        <_>
+          5 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 5 -1.</_>
+        <_>
+          9 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 8 3 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 6 9 -1.</_>
+        <_>
+          10 6 6 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 9 6 -1.</_>
+        <_>
+          12 6 3 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 18 3 -1.</_>
+        <_>
+          4 12 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 15 4 -1.</_>
+        <_>
+          5 13 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 12 4 6 -1.</_>
+        <_>
+          15 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 4 6 -1.</_>
+        <_>
+          3 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 6 6 -1.</_>
+        <_>
+          11 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 7 -1.</_>
+        <_>
+          9 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 8 -1.</_>
+        <_>
+          16 10 3 4 2.</_>
+        <_>
+          13 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 8 -1.</_>
+        <_>
+          3 10 3 4 2.</_>
+        <_>
+          6 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 8 4 -1.</_>
+        <_>
+          7 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 11 -1.</_>
+        <_>
+          10 5 3 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          10 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 6 6 -1.</_>
+        <_>
+          6 9 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 12 8 -1.</_>
+        <_>
+          12 6 4 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 12 3 -1.</_>
+        <_>
+          6 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 8 -1.</_>
+        <_>
+          17 3 3 4 2.</_>
+        <_>
+          14 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 13 3 -1.</_>
+        <_>
+          0 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 6 -1.</_>
+        <_>
+          14 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 6 -1.</_>
+        <_>
+          3 2 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 14 3 -1.</_>
+        <_>
+          8 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 15 -1.</_>
+        <_>
+          8 2 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 16 4 -1.</_>
+        <_>
+          4 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 20 12 -1.</_>
+        <_>
+          6 6 10 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 16 6 -1.</_>
+        <_>
+          13 10 8 3 2.</_>
+        <_>
+          5 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 16 6 -1.</_>
+        <_>
+          1 10 8 3 2.</_>
+        <_>
+          9 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 14 6 -1.</_>
+        <_>
+          8 8 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 14 6 -1.</_>
+        <_>
+          7 8 7 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 11 -1.</_>
+        <_>
+          8 6 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 8 6 -1.</_>
+        <_>
+          1 3 4 3 2.</_>
+        <_>
+          5 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 7 6 -1.</_>
+        <_>
+          13 1 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 4 5 10 -1.</_>
+        <_>
+          1 9 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 3 8 -1.</_>
+        <_>
+          18 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 3 8 -1.</_>
+        <_>
+          1 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 13 3 -1.</_>
+        <_>
+          8 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 13 3 -1.</_>
+        <_>
+          1 6 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 3 12 -1.</_>
+        <_>
+          19 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 12 -1.</_>
+        <_>
+          2 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 18 2 -1.</_>
+        <_>
+          4 2 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 6 -1.</_>
+        <_>
+          9 3 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 12 11 -1.</_>
+        <_>
+          12 5 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 11 -1.</_>
+        <_>
+          4 5 6 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 8 8 -1.</_>
+        <_>
+          8 4 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 22 4 -1.</_>
+        <_>
+          0 8 11 2 2.</_>
+        <_>
+          11 10 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 4 -1.</_>
+        <_>
+          8 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 8 8 -1.</_>
+        <_>
+          10 3 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 4 -1.</_>
+        <_>
+          11 6 8 2 2.</_>
+        <_>
+          3 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 16 4 -1.</_>
+        <_>
+          10 14 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 13 6 5 -1.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 6 5 -1.</_>
+        <_>
+          8 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 7 -1.</_>
+        <_>
+          12 2 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 21 9 -1.</_>
+        <_>
+          7 12 7 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 16 8 -1.</_>
+        <_>
+          3 9 8 4 2.</_>
+        <_>
+          11 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 14 18 -1.</_>
+        <_>
+          7 0 7 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 4 -1.</_>
+        <_>
+          5 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 11 16 4 -1.</_>
+        <_>
+          11 11 8 2 2.</_>
+        <_>
+          3 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 8 -1.</_>
+        <_>
+          6 9 3 4 2.</_>
+        <_>
+          9 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 14 18 -1.</_>
+        <_>
+          7 0 7 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 18 -1.</_>
+        <_>
+          8 0 7 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 14 8 3 -1.</_>
+        <_>
+          13 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 14 4 -1.</_>
+        <_>
+          13 6 7 2 2.</_>
+        <_>
+          6 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 11 4 -1.</_>
+        <_>
+          6 4 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 4 -1.</_>
+        <_>
+          13 0 6 2 2.</_>
+        <_>
+          7 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 14 4 -1.</_>
+        <_>
+          4 0 7 2 2.</_>
+        <_>
+          11 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 9 -1.</_>
+        <_>
+          17 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 9 -1.</_>
+        <_>
+          3 8 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 9 -1.</_>
+        <_>
+          12 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 5 9 -1.</_>
+        <_>
+          5 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 4 6 -1.</_>
+        <_>
+          17 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 6 -1.</_>
+        <_>
+          3 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 14 3 -1.</_>
+        <_>
+          4 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 10 3 -1.</_>
+        <_>
+          5 1 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 11 14 -1.</_>
+        <_>
+          10 11 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 6 -1.</_>
+        <_>
+          2 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 5 12 -1.</_>
+        <_>
+          12 6 5 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 2 -1.</_>
+        <_>
+          5 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 18 3 -1.</_>
+        <_>
+          3 5 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 11 14 -1.</_>
+        <_>
+          1 11 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 11 4 -1.</_>
+        <_>
+          8 14 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 7 -1.</_>
+        <_>
+          11 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 11 -1.</_>
+        <_>
+          12 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 11 2 -1.</_>
+        <_>
+          10 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 14 -1.</_>
+        <_>
+          16 0 1 14 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 2 -1.</_>
+        <_>
+          6 0 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 2 12 -1.</_>
+        <_>
+          19 4 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 10 -1.</_>
+        <_>
+          8 7 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 2 12 -1.</_>
+        <_>
+          19 4 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 3 6 8 -1.</_>
+        <_>
+          11 3 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 10 6 -1.</_>
+        <_>
+          11 2 5 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 13 2 -1.</_>
+        <_>
+          3 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 6 -1.</_>
+        <_>
+          5 6 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 9 9 -1.</_>
+        <_>
+          9 9 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 1 3 12 -1.</_>
+        <_>
+          20 2 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 13 9 5 -1.</_>
+        <_>
+          5 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 10 6 -1.</_>
+        <_>
+          11 2 5 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 10 -1.</_>
+        <_>
+          11 2 6 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 21 3 -1.</_>
+        <_>
+          8 6 7 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 3 8 -1.</_>
+        <_>
+          5 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 7 6 -1.</_>
+        <_>
+          10 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 6 -1.</_>
+        <_>
+          8 2 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 6 -1.</_>
+        <_>
+          13 7 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 7 6 -1.</_>
+        <_>
+          5 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 1 6 8 -1.</_>
+        <_>
+          12 1 3 4 2.</_>
+        <_>
+          9 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 8 -1.</_>
+        <_>
+          7 1 3 4 2.</_>
+        <_>
+          10 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 9 4 -1.</_>
+        <_>
+          10 0 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 14 3 -1.</_>
+        <_>
+          1 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 15 3 -1.</_>
+        <_>
+          5 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 3 -1.</_>
+        <_>
+          2 2 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 6 -1.</_>
+        <_>
+          11 12 6 3 2.</_>
+        <_>
+          5 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 4 -1.</_>
+        <_>
+          5 12 6 2 2.</_>
+        <_>
+          11 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 3 9 -1.</_>
+        <_>
+          16 5 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 9 3 -1.</_>
+        <_>
+          6 5 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 3 7 4 -1.</_>
+        <_>
+          13 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 5 -1.</_>
+        <_>
+          7 0 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          12 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 4 -1.</_>
+        <_>
+          0 6 6 2 2.</_>
+        <_>
+          6 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 9 6 -1.</_>
+        <_>
+          13 11 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 16 8 -1.</_>
+        <_>
+          2 10 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 10 -1.</_>
+        <_>
+          17 0 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 2 -1.</_>
+        <_>
+          5 0 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 11 13 3 -1.</_>
+        <_>
+          9 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 4 12 -1.</_>
+        <_>
+          18 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 9 7 -1.</_>
+        <_>
+          9 4 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 9 6 7 -1.</_>
+        <_>
+          13 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 6 7 -1.</_>
+        <_>
+          7 9 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 13 20 5 -1.</_>
+        <_>
+          6 13 10 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 6 -1.</_>
+        <_>
+          9 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 4 -1.</_>
+        <_>
+          8 5 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 6 -1.</_>
+        <_>
+          6 11 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 20 7 -1.</_>
+        <_>
+          6 8 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 6 -1.</_>
+        <_>
+          8 11 6 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 4 -1.</_>
+        <_>
+          8 15 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 9 6 -1.</_>
+        <_>
+          1 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 8 6 -1.</_>
+        <_>
+          13 2 4 3 2.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 22 5 -1.</_>
+        <_>
+          11 5 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 18 -1.</_>
+        <_>
+          2 9 18 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 3 8 -1.</_>
+        <_>
+          6 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 8 6 -1.</_>
+        <_>
+          13 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 6 8 -1.</_>
+        <_>
+          3 8 3 4 2.</_>
+        <_>
+          6 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 7 4 -1.</_>
+        <_>
+          11 8 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 6 -1.</_>
+        <_>
+          11 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 16 4 -1.</_>
+        <_>
+          11 14 8 2 2.</_>
+        <_>
+          3 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 4 -1.</_>
+        <_>
+          5 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 4 6 -1.</_>
+        <_>
+          9 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 6 -1.</_>
+        <_>
+          8 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 8 4 -1.</_>
+        <_>
+          7 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 18 3 -1.</_>
+        <_>
+          1 4 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 3 -1.</_>
+        <_>
+          8 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 14 4 -1.</_>
+        <_>
+          1 0 7 2 2.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 12 3 -1.</_>
+        <_>
+          10 11 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 12 3 -1.</_>
+        <_>
+          1 11 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 8 3 -1.</_>
+        <_>
+          10 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 6 -1.</_>
+        <_>
+          9 2 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 10 -1.</_>
+        <_>
+          17 0 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 3 -1.</_>
+        <_>
+          8 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 8 6 -1.</_>
+        <_>
+          13 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 6 -1.</_>
+        <_>
+          1 2 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 10 -1.</_>
+        <_>
+          17 0 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 10 2 -1.</_>
+        <_>
+          5 0 10 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 4 -1.</_>
+        <_>
+          10 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 14 3 -1.</_>
+        <_>
+          0 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 10 -1.</_>
+        <_>
+          11 3 8 5 2.</_>
+        <_>
+          3 8 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 12 3 -1.</_>
+        <_>
+          1 6 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 13 4 -1.</_>
+        <_>
+          9 8 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 6 -1.</_>
+        <_>
+          7 5 4 3 2.</_>
+        <_>
+          11 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 3 4 11 -1.</_>
+        <_>
+          14 4 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 11 2 -1.</_>
+        <_>
+          9 2 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          5 14 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 16 4 -1.</_>
+        <_>
+          0 9 8 2 2.</_>
+        <_>
+          8 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 9 7 -1.</_>
+        <_>
+          10 10 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 5 6 -1.</_>
+        <_>
+          10 7 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 10 3 -1.</_>
+        <_>
+          11 5 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 13 12 5 -1.</_>
+        <_>
+          5 13 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 4 7 -1.</_>
+        <_>
+          17 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 3 -1.</_>
+        <_>
+          0 7 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 10 -1.</_>
+        <_>
+          18 6 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 14 8 3 -1.</_>
+        <_>
+          5 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 12 3 -1.</_>
+        <_>
+          10 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 8 3 -1.</_>
+        <_>
+          4 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 16 3 -1.</_>
+        <_>
+          9 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 7 -1.</_>
+        <_>
+          3 9 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 10 6 -1.</_>
+        <_>
+          6 14 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 2 -1.</_>
+        <_>
+          0 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 4 12 -1.</_>
+        <_>
+          14 5 2 6 2.</_>
+        <_>
+          12 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 6 -1.</_>
+        <_>
+          8 11 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 16 15 2 -1.</_>
+        <_>
+          4 17 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 9 -1.</_>
+        <_>
+          9 3 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 9 -1.</_>
+        <_>
+          8 3 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 3 13 -1.</_>
+        <_>
+          2 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 4 -1.</_>
+        <_>
+          10 1 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 9 -1.</_>
+        <_>
+          10 1 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 6 -1.</_>
+        <_>
+          10 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 11 2 -1.</_>
+        <_>
+          3 5 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 6 -1.</_>
+        <_>
+          11 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 10 -1.</_>
+        <_>
+          6 9 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 3 12 -1.</_>
+        <_>
+          12 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 12 -1.</_>
+        <_>
+          9 2 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 4 9 -1.</_>
+        <_>
+          18 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 6 -1.</_>
+        <_>
+          1 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 6 -1.</_>
+        <_>
+          12 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 2 12 -1.</_>
+        <_>
+          11 2 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 5 6 -1.</_>
+        <_>
+          11 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 5 6 -1.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 5 8 -1.</_>
+        <_>
+          13 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 20 2 -1.</_>
+        <_>
+          10 9 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 11 2 -1.</_>
+        <_>
+          11 5 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 2 -1.</_>
+        <_>
+          5 14 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 9 -1.</_>
+        <_>
+          11 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 12 6 -1.</_>
+        <_>
+          1 10 12 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 3 8 -1.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 3 8 -1.</_>
+        <_>
+          3 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 9 -1.</_>
+        <_>
+          11 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 4 9 -1.</_>
+        <_>
+          7 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 15 12 -1.</_>
+        <_>
+          12 7 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 4 -1.</_>
+        <_>
+          4 10 7 2 2.</_>
+        <_>
+          11 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 10 6 -1.</_>
+        <_>
+          14 10 5 3 2.</_>
+        <_>
+          9 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 10 6 -1.</_>
+        <_>
+          3 10 5 3 2.</_>
+        <_>
+          8 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 6 -1.</_>
+        <_>
+          18 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 14 2 -1.</_>
+        <_>
+          10 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 4 12 -1.</_>
+        <_>
+          20 2 2 6 2.</_>
+        <_>
+          18 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 12 4 -1.</_>
+        <_>
+          3 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 9 6 -1.</_>
+        <_>
+          7 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 6 4 -1.</_>
+        <_>
+          4 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 5 12 -1.</_>
+        <_>
+          12 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 3 17 -1.</_>
+        <_>
+          6 0 1 17 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 7 6 6 -1.</_>
+        <_>
+          18 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 6 6 -1.</_>
+        <_>
+          2 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 18 -1.</_>
+        <_>
+          15 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 5 10 -1.</_>
+        <_>
+          0 10 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 4 -1.</_>
+        <_>
+          5 13 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 8 6 -1.</_>
+        <_>
+          7 11 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 4 -1.</_>
+        <_>
+          2 12 15 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 3 -1.</_>
+        <_>
+          5 15 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 3 14 -1.</_>
+        <_>
+          8 4 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 8 3 -1.</_>
+        <_>
+          7 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 6 -1.</_>
+        <_>
+          1 2 4 3 2.</_>
+        <_>
+          5 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 8 -1.</_>
+        <_>
+          17 9 3 4 2.</_>
+        <_>
+          14 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 6 8 -1.</_>
+        <_>
+          0 0 3 4 2.</_>
+        <_>
+          3 4 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 8 -1.</_>
+        <_>
+          17 9 3 4 2.</_>
+        <_>
+          14 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 8 -1.</_>
+        <_>
+          2 9 3 4 2.</_>
+        <_>
+          5 13 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 8 -1.</_>
+        <_>
+          17 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 8 -1.</_>
+        <_>
+          2 10 3 4 2.</_>
+        <_>
+          5 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 8 -1.</_>
+        <_>
+          16 1 3 4 2.</_>
+        <_>
+          13 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 3 -1.</_>
+        <_>
+          3 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 6 8 -1.</_>
+        <_>
+          16 1 3 4 2.</_>
+        <_>
+          13 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 6 8 -1.</_>
+        <_>
+          3 1 3 4 2.</_>
+        <_>
+          6 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 16 3 -1.</_>
+        <_>
+          3 4 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 4 -1.</_>
+        <_>
+          7 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 15 3 -1.</_>
+        <_>
+          2 11 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 6 -1.</_>
+        <_>
+          10 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 13 4 -1.</_>
+        <_>
+          2 5 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 12 3 -1.</_>
+        <_>
+          9 10 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 16 4 -1.</_>
+        <_>
+          3 13 8 2 2.</_>
+        <_>
+          11 15 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 6 -1.</_>
+        <_>
+          10 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 8 6 -1.</_>
+        <_>
+          8 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 13 2 -1.</_>
+        <_>
+          9 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 3 8 12 -1.</_>
+        <_>
+          7 9 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 17 3 -1.</_>
+        <_>
+          3 7 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 14 4 -1.</_>
+        <_>
+          3 0 7 2 2.</_>
+        <_>
+          10 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 5 -1.</_>
+        <_>
+          11 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 6 -1.</_>
+        <_>
+          11 4 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 5 4 6 -1.</_>
+        <_>
+          10 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 3 -1.</_>
+        <_>
+          8 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 7 -1.</_>
+        <_>
+          8 6 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 8 12 -1.</_>
+        <_>
+          5 0 4 6 2.</_>
+        <_>
+          9 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 4 -1.</_>
+        <_>
+          13 0 6 2 2.</_>
+        <_>
+          7 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 6 5 -1.</_>
+        <_>
+          4 4 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 7 4 -1.</_>
+        <_>
+          15 0 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 6 -1.</_>
+        <_>
+          5 2 4 3 2.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 3 -1.</_>
+        <_>
+          4 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 3 -1.</_>
+        <_>
+          4 2 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 6 -1.</_>
+        <_>
+          15 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 17 2 -1.</_>
+        <_>
+          0 2 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 6 -1.</_>
+        <_>
+          15 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 6 -1.</_>
+        <_>
+          3 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 3 -1.</_>
+        <_>
+          3 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 4 -1.</_>
+        <_>
+          10 1 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 22 7 -1.</_>
+        <_>
+          0 11 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 12 -1.</_>
+        <_>
+          3 5 2 6 2.</_>
+        <_>
+          5 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 14 4 -1.</_>
+        <_>
+          4 11 7 2 2.</_>
+        <_>
+          11 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 6 -1.</_>
+        <_>
+          11 11 4 3 2.</_>
+        <_>
+          7 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 3 13 -1.</_>
+        <_>
+          4 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 4 12 -1.</_>
+        <_>
+          19 1 2 6 2.</_>
+        <_>
+          17 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 12 -1.</_>
+        <_>
+          1 1 2 6 2.</_>
+        <_>
+          3 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 16 -1.</_>
+        <_>
+          7 4 13 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 13 2 -1.</_>
+        <_>
+          1 5 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 4 -1.</_>
+        <_>
+          9 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 17 3 -1.</_>
+        <_>
+          2 5 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 10 -1.</_>
+        <_>
+          15 1 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 3 -1.</_>
+        <_>
+          6 1 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 0 3 10 -1.</_>
+        <_>
+          15 1 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 3 -1.</_>
+        <_>
+          7 1 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 7 -1.</_>
+        <_>
+          11 1 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 14 -1.</_>
+        <_>
+          9 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 7 -1.</_>
+        <_>
+          11 1 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 7 2 -1.</_>
+        <_>
+          11 1 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 9 8 -1.</_>
+        <_>
+          10 9 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 4 8 -1.</_>
+        <_>
+          3 7 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 11 4 6 -1.</_>
+        <_>
+          17 11 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          10 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 6 -1.</_>
+        <_>
+          12 1 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          10 1 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 14 9 4 -1.</_>
+        <_>
+          12 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 4 -1.</_>
+        <_>
+          8 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 4 6 -1.</_>
+        <_>
+          10 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 18 2 -1.</_>
+        <_>
+          1 9 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 14 3 -1.</_>
+        <_>
+          8 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 14 3 -1.</_>
+        <_>
+          10 15 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 14 3 -1.</_>
+        <_>
+          8 9 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 9 4 -1.</_>
+        <_>
+          7 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 8 -1.</_>
+        <_>
+          10 6 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 11 18 3 -1.</_>
+        <_>
+          8 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 4 -1.</_>
+        <_>
+          10 0 12 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 6 16 4 -1.</_>
+        <_>
+          14 6 8 2 2.</_>
+        <_>
+          6 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 4 14 -1.</_>
+        <_>
+          7 3 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          14 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 6 6 -1.</_>
+        <_>
+          6 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 8 -1.</_>
+        <_>
+          14 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 16 4 -1.</_>
+        <_>
+          0 6 8 2 2.</_>
+        <_>
+          8 8 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 10 5 6 -1.</_>
+        <_>
+          9 13 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 12 -1.</_>
+        <_>
+          7 5 3 6 2.</_>
+        <_>
+          10 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 21 9 -1.</_>
+        <_>
+          8 8 7 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          9 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 3 11 -1.</_>
+        <_>
+          12 4 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 3 -1.</_>
+        <_>
+          10 6 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 6 6 -1.</_>
+        <_>
+          12 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 9 9 -1.</_>
+        <_>
+          3 1 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 12 -1.</_>
+        <_>
+          9 0 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 6 4 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 13 3 -1.</_>
+        <_>
+          8 8 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 12 4 -1.</_>
+        <_>
+          5 13 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 13 -1.</_>
+        <_>
+          15 3 1 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 11 2 -1.</_>
+        <_>
+          9 5 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 16 -1.</_>
+        <_>
+          13 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 2 16 -1.</_>
+        <_>
+          7 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 7 6 -1.</_>
+        <_>
+          12 2 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 6 12 -1.</_>
+        <_>
+          7 3 3 6 2.</_>
+        <_>
+          10 9 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 8 4 -1.</_>
+        <_>
+          9 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 3 11 3 -1.</_>
+        <_>
+          10 4 11 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 6 -1.</_>
+        <_>
+          12 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 4 -1.</_>
+        <_>
+          10 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 8 -1.</_>
+        <_>
+          12 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 4 -1.</_>
+        <_>
+          2 4 6 2 2.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 10 -1.</_>
+        <_>
+          15 2 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 22 7 -1.</_>
+        <_>
+          11 7 11 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 14 3 -1.</_>
+        <_>
+          8 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 14 3 -1.</_>
+        <_>
+          0 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 3 10 -1.</_>
+        <_>
+          15 2 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 1 10 3 -1.</_>
+        <_>
+          7 2 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 10 -1.</_>
+        <_>
+          13 4 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 3 -1.</_>
+        <_>
+          10 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 7 6 -1.</_>
+        <_>
+          12 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 3 -1.</_>
+        <_>
+          0 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 4 -1.</_>
+        <_>
+          14 0 6 2 2.</_>
+        <_>
+          8 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 4 -1.</_>
+        <_>
+          2 0 6 2 2.</_>
+        <_>
+          8 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 3 -1.</_>
+        <_>
+          8 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 14 2 -1.</_>
+        <_>
+          7 1 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 11 -1.</_>
+        <_>
+          10 0 5 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 11 -1.</_>
+        <_>
+          7 0 5 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 12 -1.</_>
+        <_>
+          14 6 3 6 2.</_>
+        <_>
+          11 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 6 -1.</_>
+        <_>
+          9 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 5 -1.</_>
+        <_>
+          14 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 8 -1.</_>
+        <_>
+          8 10 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 6 6 -1.</_>
+        <_>
+          12 10 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 6 6 -1.</_>
+        <_>
+          8 10 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 14 3 -1.</_>
+        <_>
+          6 11 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 7 6 -1.</_>
+        <_>
+          3 3 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 10 -1.</_>
+        <_>
+          14 8 3 5 2.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 3 13 -1.</_>
+        <_>
+          9 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 4 -1.</_>
+        <_>
+          11 0 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 6 -1.</_>
+        <_>
+          11 0 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 12 -1.</_>
+        <_>
+          14 3 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 10 7 -1.</_>
+        <_>
+          10 4 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 6 -1.</_>
+        <_>
+          10 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 12 9 -1.</_>
+        <_>
+          4 11 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 4 6 -1.</_>
+        <_>
+          13 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 5 6 -1.</_>
+        <_>
+          5 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 11 -1.</_>
+        <_>
+          12 4 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 4 11 2 -1.</_>
+        <_>
+          9 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 10 -1.</_>
+        <_>
+          14 8 3 5 2.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 10 -1.</_>
+        <_>
+          5 8 3 5 2.</_>
+        <_>
+          8 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 10 -1.</_>
+        <_>
+          14 7 3 5 2.</_>
+        <_>
+          11 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 18 3 -1.</_>
+        <_>
+          2 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 4 6 7 -1.</_>
+        <_>
+          16 4 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 10 -1.</_>
+        <_>
+          5 7 3 5 2.</_>
+        <_>
+          8 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 0 3 14 -1.</_>
+        <_>
+          12 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 8 7 -1.</_>
+        <_>
+          11 10 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 12 3 -1.</_>
+        <_>
+          8 1 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 13 4 -1.</_>
+        <_>
+          3 1 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 12 4 -1.</_>
+        <_>
+          7 12 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 8 18 -1.</_>
+        <_>
+          4 0 4 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 5 -1.</_>
+        <_>
+          14 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 22 4 -1.</_>
+        <_>
+          11 5 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 10 9 -1.</_>
+        <_>
+          11 5 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 10 9 -1.</_>
+        <_>
+          1 5 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 6 2 12 -1.</_>
+        <_>
+          18 6 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 2 12 -1.</_>
+        <_>
+          3 6 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 12 -1.</_>
+        <_>
+          15 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 4 12 -1.</_>
+        <_>
+          3 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 13 6 5 -1.</_>
+        <_>
+          14 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 6 5 -1.</_>
+        <_>
+          5 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 12 5 -1.</_>
+        <_>
+          11 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 12 5 -1.</_>
+        <_>
+          5 12 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 6 6 -1.</_>
+        <_>
+          12 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 8 -1.</_>
+        <_>
+          4 10 8 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 8 8 -1.</_>
+        <_>
+          15 1 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 8 8 -1.</_>
+        <_>
+          3 1 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 3 8 -1.</_>
+        <_>
+          14 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 7 6 -1.</_>
+        <_>
+          10 4 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 10 4 8 -1.</_>
+        <_>
+          9 14 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 8 -1.</_>
+        <_>
+          5 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 4 9 -1.</_>
+        <_>
+          6 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 16 4 -1.</_>
+        <_>
+          14 3 8 2 2.</_>
+        <_>
+          6 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 20 4 -1.</_>
+        <_>
+          1 3 10 2 2.</_>
+        <_>
+          11 5 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 12 -1.</_>
+        <_>
+          12 5 3 6 2.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 2 12 -1.</_>
+        <_>
+          2 6 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 0 2 16 -1.</_>
+        <_>
+          19 0 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 2 16 -1.</_>
+        <_>
+          2 0 1 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 5 9 -1.</_>
+        <_>
+          13 8 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 2 -1.</_>
+        <_>
+          5 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 13 2 -1.</_>
+        <_>
+          7 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 12 2 -1.</_>
+        <_>
+          8 1 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 4 22 8 -1.</_>
+        <_>
+          11 4 11 4 2.</_>
+        <_>
+          0 8 11 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 6 4 -1.</_>
+        <_>
+          5 3 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 15 3 -1.</_>
+        <_>
+          7 12 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 6 7 -1.</_>
+        <_>
+          8 7 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 12 4 -1.</_>
+        <_>
+          13 12 6 2 2.</_>
+        <_>
+          7 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 16 2 -1.</_>
+        <_>
+          8 11 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 3 4 10 -1.</_>
+        <_>
+          18 3 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 17 3 -1.</_>
+        <_>
+          2 3 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 12 4 -1.</_>
+        <_>
+          16 14 6 2 2.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 11 6 -1.</_>
+        <_>
+          1 11 11 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 18 3 -1.</_>
+        <_>
+          4 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 3 -1.</_>
+        <_>
+          0 10 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 11 12 -1.</_>
+        <_>
+          11 11 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 6 -1.</_>
+        <_>
+          5 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 8 -1.</_>
+        <_>
+          17 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 11 12 -1.</_>
+        <_>
+          0 11 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 3 2 12 -1.</_>
+        <_>
+          15 3 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 12 4 -1.</_>
+        <_>
+          3 0 6 2 2.</_>
+        <_>
+          9 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 8 -1.</_>
+        <_>
+          17 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 6 -1.</_>
+        <_>
+          5 12 4 3 2.</_>
+        <_>
+          9 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 10 5 -1.</_>
+        <_>
+          8 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 10 5 -1.</_>
+        <_>
+          9 11 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 12 12 -1.</_>
+        <_>
+          12 6 6 6 2.</_>
+        <_>
+          6 12 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 6 8 -1.</_>
+        <_>
+          7 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 15 10 -1.</_>
+        <_>
+          7 13 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 4 -1.</_>
+        <_>
+          0 0 11 2 2.</_>
+        <_>
+          11 2 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 12 3 -1.</_>
+        <_>
+          10 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 3 -1.</_>
+        <_>
+          0 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 12 -1.</_>
+        <_>
+          9 6 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 9 6 -1.</_>
+        <_>
+          4 8 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 2 9 -1.</_>
+        <_>
+          11 6 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 8 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 10 -1.</_>
+        <_>
+          7 5 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 2 -1.</_>
+        <_>
+          11 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 3 11 -1.</_>
+        <_>
+          18 1 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 3 -1.</_>
+        <_>
+          4 1 11 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 7 -1.</_>
+        <_>
+          9 6 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 6 6 -1.</_>
+        <_>
+          3 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 16 8 -1.</_>
+        <_>
+          6 12 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 3 -1.</_>
+        <_>
+          10 7 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 11 8 6 -1.</_>
+        <_>
+          12 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 8 -1.</_>
+        <_>
+          0 12 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 12 4 -1.</_>
+        <_>
+          16 14 6 2 2.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 8 6 -1.</_>
+        <_>
+          2 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 16 4 -1.</_>
+        <_>
+          14 11 8 2 2.</_>
+        <_>
+          6 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 22 6 -1.</_>
+        <_>
+          11 11 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 6 8 -1.</_>
+        <_>
+          17 10 3 4 2.</_>
+        <_>
+          14 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 6 8 -1.</_>
+        <_>
+          2 10 3 4 2.</_>
+        <_>
+          5 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 15 12 -1.</_>
+        <_>
+          11 8 5 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 12 -1.</_>
+        <_>
+          6 8 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 2 8 -1.</_>
+        <_>
+          15 7 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 10 3 -1.</_>
+        <_>
+          2 4 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 2 14 3 -1.</_>
+        <_>
+          4 3 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 8 2 -1.</_>
+        <_>
+          10 8 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 5 4 7 -1.</_>
+        <_>
+          15 5 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 6 5 6 -1.</_>
+        <_>
+          3 9 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 8 6 -1.</_>
+        <_>
+          18 1 4 3 2.</_>
+        <_>
+          14 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 8 6 -1.</_>
+        <_>
+          0 1 4 3 2.</_>
+        <_>
+          4 4 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 4 12 -1.</_>
+        <_>
+          18 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 12 -1.</_>
+        <_>
+          2 0 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 16 12 2 -1.</_>
+        <_>
+          9 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 16 12 2 -1.</_>
+        <_>
+          1 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 15 12 3 -1.</_>
+        <_>
+          10 16 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 12 3 -1.</_>
+        <_>
+          0 16 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 12 4 -1.</_>
+        <_>
+          16 14 6 2 2.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 12 4 -1.</_>
+        <_>
+          0 14 6 2 2.</_>
+        <_>
+          6 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 12 4 -1.</_>
+        <_>
+          15 11 6 2 2.</_>
+        <_>
+          9 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 16 4 -1.</_>
+        <_>
+          0 11 8 2 2.</_>
+        <_>
+          8 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 9 6 -1.</_>
+        <_>
+          8 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 9 6 -1.</_>
+        <_>
+          5 14 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 2 -1.</_>
+        <_>
+          4 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 10 8 -1.</_>
+        <_>
+          1 10 5 4 2.</_>
+        <_>
+          6 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 5 9 -1.</_>
+        <_>
+          13 5 5 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 4 4 6 -1.</_>
+        <_>
+          6 4 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 9 7 -1.</_>
+        <_>
+          12 2 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 9 7 -1.</_>
+        <_>
+          7 2 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 5 9 -1.</_>
+        <_>
+          13 5 5 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 5 -1.</_>
+        <_>
+          9 5 3 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 12 14 6 -1.</_>
+        <_>
+          5 14 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 12 -1.</_>
+        <_>
+          6 4 2 6 2.</_>
+        <_>
+          8 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 10 8 -1.</_>
+        <_>
+          9 4 5 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 8 -1.</_>
+        <_>
+          7 5 3 4 2.</_>
+        <_>
+          10 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 6 8 -1.</_>
+        <_>
+          11 7 3 4 2.</_>
+        <_>
+          8 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 11 2 -1.</_>
+        <_>
+          2 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 3 13 -1.</_>
+        <_>
+          17 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 3 -1.</_>
+        <_>
+          2 1 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 4 -1.</_>
+        <_>
+          15 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 13 3 -1.</_>
+        <_>
+          2 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 18 4 -1.</_>
+        <_>
+          4 6 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 10 9 -1.</_>
+        <_>
+          8 3 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 18 6 -1.</_>
+        <_>
+          8 9 6 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 11 2 -1.</_>
+        <_>
+          10 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 12 -1.</_>
+        <_>
+          17 6 3 6 2.</_>
+        <_>
+          14 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 12 -1.</_>
+        <_>
+          2 6 3 6 2.</_>
+        <_>
+          5 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 16 6 -1.</_>
+        <_>
+          3 6 16 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 3 -1.</_>
+        <_>
+          5 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 8 3 -1.</_>
+        <_>
+          12 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 17 9 -1.</_>
+        <_>
+          0 12 17 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          11 4 3 5 2.</_>
+        <_>
+          8 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 16 8 -1.</_>
+        <_>
+          2 4 8 4 2.</_>
+        <_>
+          10 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 12 4 -1.</_>
+        <_>
+          15 6 6 2 2.</_>
+        <_>
+          9 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 7 4 -1.</_>
+        <_>
+          15 5 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 6 -1.</_>
+        <_>
+          0 6 9 3 2.</_>
+        <_>
+          9 9 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 15 3 -1.</_>
+        <_>
+          4 3 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 6 -1.</_>
+        <_>
+          5 0 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 8 6 -1.</_>
+        <_>
+          17 4 4 3 2.</_>
+        <_>
+          13 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 13 6 -1.</_>
+        <_>
+          4 4 13 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 12 3 -1.</_>
+        <_>
+          9 9 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 16 3 -1.</_>
+        <_>
+          1 9 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 5 8 -1.</_>
+        <_>
+          11 8 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 11 2 -1.</_>
+        <_>
+          3 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 3 -1.</_>
+        <_>
+          10 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 7 8 -1.</_>
+        <_>
+          9 3 7 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 12 -1.</_>
+        <_>
+          13 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 4 -1.</_>
+        <_>
+          0 9 6 2 2.</_>
+        <_>
+          6 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          13 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 6 -1.</_>
+        <_>
+          2 8 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 6 -1.</_>
+        <_>
+          13 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 8 6 -1.</_>
+        <_>
+          5 7 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 6 4 -1.</_>
+        <_>
+          10 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 12 10 -1.</_>
+        <_>
+          4 8 6 5 2.</_>
+        <_>
+          10 13 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 10 -1.</_>
+        <_>
+          17 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 4 -1.</_>
+        <_>
+          9 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 10 4 -1.</_>
+        <_>
+          8 13 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 4 18 -1.</_>
+        <_>
+          4 0 2 18 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 10 -1.</_>
+        <_>
+          11 0 8 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 3 -1.</_>
+        <_>
+          0 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 10 -1.</_>
+        <_>
+          17 0 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 4 -1.</_>
+        <_>
+          5 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 7 6 -1.</_>
+        <_>
+          15 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 7 6 -1.</_>
+        <_>
+          0 12 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          15 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 7 -1.</_>
+        <_>
+          11 11 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 4 9 -1.</_>
+        <_>
+          13 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 8 6 -1.</_>
+        <_>
+          2 12 4 3 2.</_>
+        <_>
+          6 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 4 -1.</_>
+        <_>
+          9 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 6 -1.</_>
+        <_>
+          7 12 4 3 2.</_>
+        <_>
+          11 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 12 14 -1.</_>
+        <_>
+          12 1 6 7 2.</_>
+        <_>
+          6 8 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 4 9 -1.</_>
+        <_>
+          5 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_>
+        <_>
+          5 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 7 8 3 -1.</_>
+        <_>
+          8 8 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 10 -1.</_>
+        <_>
+          7 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 3 -1.</_>
+        <_>
+          6 2 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 14 12 3 -1.</_>
+        <_>
+          10 15 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 18 12 -1.</_>
+        <_>
+          0 12 18 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 8 6 6 -1.</_>
+        <_>
+          9 11 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 4 12 -1.</_>
+        <_>
+          3 2 2 6 2.</_>
+        <_>
+          5 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 12 -1.</_>
+        <_>
+          13 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 6 8 -1.</_>
+        <_>
+          2 4 3 4 2.</_>
+        <_>
+          5 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 10 4 6 -1.</_>
+        <_>
+          14 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 12 -1.</_>
+        <_>
+          0 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 12 -1.</_>
+        <_>
+          13 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 12 2 -1.</_>
+        <_>
+          9 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 9 12 4 -1.</_>
+        <_>
+          16 9 6 2 2.</_>
+        <_>
+          10 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 12 4 -1.</_>
+        <_>
+          0 9 6 2 2.</_>
+        <_>
+          6 11 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 9 4 9 -1.</_>
+        <_>
+          17 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 10 6 -1.</_>
+        <_>
+          1 9 5 3 2.</_>
+        <_>
+          6 12 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 9 4 -1.</_>
+        <_>
+          8 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 6 10 -1.</_>
+        <_>
+          2 8 3 5 2.</_>
+        <_>
+          5 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 12 6 -1.</_>
+        <_>
+          10 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 12 6 -1.</_>
+        <_>
+          6 10 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 2 12 -1.</_>
+        <_>
+          20 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 12 -1.</_>
+        <_>
+          0 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 4 15 -1.</_>
+        <_>
+          14 3 2 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 14 -1.</_>
+        <_>
+          0 1 8 7 2.</_>
+        <_>
+          8 8 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 10 -1.</_>
+        <_>
+          11 0 8 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 16 4 -1.</_>
+        <_>
+          0 3 8 2 2.</_>
+        <_>
+          8 5 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 12 -1.</_>
+        <_>
+          13 4 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 11 15 -1.</_>
+        <_>
+          5 8 11 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 7 12 -1.</_>
+        <_>
+          13 4 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 7 12 -1.</_>
+        <_>
+          2 4 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 18 12 -1.</_>
+        <_>
+          10 9 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 14 6 -1.</_>
+        <_>
+          4 7 7 3 2.</_>
+        <_>
+          11 10 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 13 3 -1.</_>
+        <_>
+          7 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 13 3 -1.</_>
+        <_>
+          2 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 9 17 3 -1.</_>
+        <_>
+          5 10 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 10 9 -1.</_>
+        <_>
+          1 4 10 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 16 8 -1.</_>
+        <_>
+          4 3 16 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 12 -1.</_>
+        <_>
+          8 5 2 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 6 5 -1.</_>
+        <_>
+          11 7 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 5 -1.</_>
+        <_>
+          8 4 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 4 -1.</_>
+        <_>
+          11 12 9 2 2.</_>
+        <_>
+          2 14 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 9 3 -1.</_>
+        <_>
+          10 5 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 10 -1.</_>
+        <_>
+          15 0 1 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 18 12 -1.</_>
+        <_>
+          6 9 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 4 6 -1.</_>
+        <_>
+          14 9 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 3 12 -1.</_>
+        <_>
+          5 10 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 9 -1.</_>
+        <_>
+          12 1 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 9 4 9 -1.</_>
+        <_>
+          1 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 9 4 9 -1.</_>
+        <_>
+          18 12 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 6 4 -1.</_>
+        <_>
+          9 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 9 -1.</_>
+        <_>
+          12 1 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 9 3 -1.</_>
+        <_>
+          10 1 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 2 -1.</_>
+        <_>
+          5 16 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 22 2 -1.</_>
+        <_>
+          11 0 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 2 13 -1.</_>
+        <_>
+          20 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 13 -1.</_>
+        <_>
+          1 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 6 -1.</_>
+        <_>
+          12 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 6 6 -1.</_>
+        <_>
+          8 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 3 -1.</_>
+        <_>
+          10 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 3 -1.</_>
+        <_>
+          0 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 9 8 6 -1.</_>
+        <_>
+          1 9 4 3 2.</_>
+        <_>
+          5 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 10 7 4 -1.</_>
+        <_>
+          10 12 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 6 -1.</_>
+        <_>
+          10 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 6 8 4 -1.</_>
+        <_>
+          13 6 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 7 -1.</_>
+        <_>
+          12 3 4 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 7 -1.</_>
+        <_>
+          8 5 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 8 7 -1.</_>
+        <_>
+          10 5 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 16 12 -1.</_>
+        <_>
+          14 3 8 6 2.</_>
+        <_>
+          6 9 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 6 6 -1.</_>
+        <_>
+          4 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 18 14 -1.</_>
+        <_>
+          13 2 9 7 2.</_>
+        <_>
+          4 9 9 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 11 12 -1.</_>
+        <_>
+          5 3 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 16 9 -1.</_>
+        <_>
+          4 10 16 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 18 3 -1.</_>
+        <_>
+          0 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 4 -1.</_>
+        <_>
+          12 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 8 -1.</_>
+        <_>
+          1 10 3 4 2.</_>
+        <_>
+          4 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 8 6 -1.</_>
+        <_>
+          18 12 4 3 2.</_>
+        <_>
+          14 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 12 3 -1.</_>
+        <_>
+          13 7 4 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          8 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 10 -1.</_>
+        <_>
+          4 13 14 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 8 -1.</_>
+        <_>
+          11 2 4 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 8 -1.</_>
+        <_>
+          9 6 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 3 4 10 -1.</_>
+        <_>
+          18 3 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 3 -1.</_>
+        <_>
+          9 15 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 8 4 6 -1.</_>
+        <_>
+          11 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 8 6 4 -1.</_>
+        <_>
+          11 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 13 16 5 -1.</_>
+        <_>
+          7 13 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 4 12 -1.</_>
+        <_>
+          6 2 2 6 2.</_>
+        <_>
+          8 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 18 4 -1.</_>
+        <_>
+          11 14 9 2 2.</_>
+        <_>
+          2 16 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 3 -1.</_>
+        <_>
+          3 2 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 16 3 -1.</_>
+        <_>
+          6 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 8 3 -1.</_>
+        <_>
+          9 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 4 6 -1.</_>
+        <_>
+          16 3 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 3 10 4 -1.</_>
+        <_>
+          4 3 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 8 -1.</_>
+        <_>
+          17 5 3 4 2.</_>
+        <_>
+          14 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 14 12 -1.</_>
+        <_>
+          1 5 14 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 12 -1.</_>
+        <_>
+          11 5 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 12 -1.</_>
+        <_>
+          5 5 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 8 5 -1.</_>
+        <_>
+          11 5 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 18 -1.</_>
+        <_>
+          7 0 3 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          11 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 6 4 -1.</_>
+        <_>
+          5 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 4 -1.</_>
+        <_>
+          12 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 13 3 -1.</_>
+        <_>
+          1 7 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 12 3 -1.</_>
+        <_>
+          10 7 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 4 -1.</_>
+        <_>
+          4 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 6 -1.</_>
+        <_>
+          16 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 6 -1.</_>
+        <_>
+          4 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 15 12 3 -1.</_>
+        <_>
+          11 15 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 8 5 -1.</_>
+        <_>
+          5 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 5 6 8 -1.</_>
+        <_>
+          17 5 3 4 2.</_>
+        <_>
+          14 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 6 8 -1.</_>
+        <_>
+          2 5 3 4 2.</_>
+        <_>
+          5 9 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 11 8 6 -1.</_>
+        <_>
+          18 11 4 3 2.</_>
+        <_>
+          14 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 8 6 -1.</_>
+        <_>
+          4 0 4 3 2.</_>
+        <_>
+          8 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 7 4 -1.</_>
+        <_>
+          14 3 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 6 -1.</_>
+        <_>
+          0 11 4 3 2.</_>
+        <_>
+          4 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 14 4 -1.</_>
+        <_>
+          4 15 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 9 8 -1.</_>
+        <_>
+          8 3 3 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 15 8 -1.</_>
+        <_>
+          10 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 15 8 -1.</_>
+        <_>
+          7 0 5 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 6 11 -1.</_>
+        <_>
+          16 0 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 18 2 -1.</_>
+        <_>
+          6 16 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 7 -1.</_>
+        <_>
+          8 3 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 6 8 -1.</_>
+        <_>
+          12 3 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 6 8 -1.</_>
+        <_>
+          8 3 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 12 4 -1.</_>
+        <_>
+          7 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 9 16 8 -1.</_>
+        <_>
+          3 9 8 4 2.</_>
+        <_>
+          11 13 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 13 3 -1.</_>
+        <_>
+          9 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 4 12 -1.</_>
+        <_>
+          4 0 2 6 2.</_>
+        <_>
+          6 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 4 -1.</_>
+        <_>
+          6 11 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 6 4 -1.</_>
+        <_>
+          6 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 12 3 -1.</_>
+        <_>
+          10 7 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 3 -1.</_>
+        <_>
+          0 7 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 6 -1.</_>
+        <_>
+          6 4 14 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 4 -1.</_>
+        <_>
+          4 1 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 0 21 18 -1.</_>
+        <_>
+          8 0 7 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 2 -1.</_>
+        <_>
+          5 0 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 9 -1.</_>
+        <_>
+          14 11 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 6 10 -1.</_>
+        <_>
+          4 0 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 4 -1.</_>
+        <_>
+          11 11 6 2 2.</_>
+        <_>
+          5 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 6 -1.</_>
+        <_>
+          10 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 15 9 -1.</_>
+        <_>
+          12 4 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 9 -1.</_>
+        <_>
+          5 4 5 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 16 -1.</_>
+        <_>
+          11 0 6 8 2.</_>
+        <_>
+          5 8 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 6 5 -1.</_>
+        <_>
+          11 10 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 8 9 -1.</_>
+        <_>
+          10 7 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 8 9 -1.</_>
+        <_>
+          4 7 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 3 -1.</_>
+        <_>
+          8 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 13 3 -1.</_>
+        <_>
+          0 4 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          14 1 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 3 -1.</_>
+        <_>
+          4 1 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 3 -1.</_>
+        <_>
+          8 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 4 -1.</_>
+        <_>
+          8 4 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 2 11 -1.</_>
+        <_>
+          13 2 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 11 2 -1.</_>
+        <_>
+          9 2 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 16 -1.</_>
+        <_>
+          11 9 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 4 9 -1.</_>
+        <_>
+          7 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 8 -1.</_>
+        <_>
+          12 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 4 -1.</_>
+        <_>
+          1 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 4 8 -1.</_>
+        <_>
+          12 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 4 8 -1.</_>
+        <_>
+          6 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 3 12 -1.</_>
+        <_>
+          20 4 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 3 12 3 -1.</_>
+        <_>
+          2 4 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 6 3 7 -1.</_>
+        <_>
+          14 7 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 4 -1.</_>
+        <_>
+          11 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 10 -1.</_>
+        <_>
+          15 8 5 5 2.</_>
+        <_>
+          10 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 10 10 -1.</_>
+        <_>
+          2 8 5 5 2.</_>
+        <_>
+          7 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 20 3 -1.</_>
+        <_>
+          6 11 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 4 -1.</_>
+        <_>
+          13 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 11 8 4 -1.</_>
+        <_>
+          8 11 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 6 -1.</_>
+        <_>
+          9 5 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 6 9 -1.</_>
+        <_>
+          7 8 3 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 4 -1.</_>
+        <_>
+          4 5 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 6 -1.</_>
+        <_>
+          8 6 6 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 11 -1.</_>
+        <_>
+          11 1 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 8 -1.</_>
+        <_>
+          7 1 3 4 2.</_>
+        <_>
+          10 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 8 6 -1.</_>
+        <_>
+          9 10 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 9 4 -1.</_>
+        <_>
+          9 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 9 4 -1.</_>
+        <_>
+          13 12 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 8 -1.</_>
+        <_>
+          8 0 5 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 6 12 4 -1.</_>
+        <_>
+          15 6 6 2 2.</_>
+        <_>
+          9 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 9 14 5 -1.</_>
+        <_>
+          11 9 7 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 6 -1.</_>
+        <_>
+          12 8 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 7 -1.</_>
+        <_>
+          8 4 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 9 6 6 -1.</_>
+        <_>
+          14 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 6 6 -1.</_>
+        <_>
+          2 12 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 4 8 -1.</_>
+        <_>
+          13 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 4 9 -1.</_>
+        <_>
+          7 8 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 12 -1.</_>
+        <_>
+          8 8 6 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 6 -1.</_>
+        <_>
+          8 5 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 8 -1.</_>
+        <_>
+          6 0 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 8 7 -1.</_>
+        <_>
+          2 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 11 6 7 -1.</_>
+        <_>
+          17 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 14 2 -1.</_>
+        <_>
+          3 17 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 15 13 3 -1.</_>
+        <_>
+          9 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 13 3 -1.</_>
+        <_>
+          0 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 3 -1.</_>
+        <_>
+          5 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 14 14 3 -1.</_>
+        <_>
+          0 15 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 6 6 -1.</_>
+        <_>
+          15 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 6 6 -1.</_>
+        <_>
+          5 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 4 -1.</_>
+        <_>
+          7 3 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 12 2 -1.</_>
+        <_>
+          4 14 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 9 6 -1.</_>
+        <_>
+          12 6 3 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 7 -1.</_>
+        <_>
+          10 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 10 -1.</_>
+        <_>
+          16 1 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 3 -1.</_>
+        <_>
+          6 1 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 6 -1.</_>
+        <_>
+          15 4 4 3 2.</_>
+        <_>
+          11 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 12 3 -1.</_>
+        <_>
+          6 1 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          19 4 3 11 -1.</_>
+        <_>
+          20 5 1 11 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 6 7 -1.</_>
+        <_>
+          3 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 14 -1.</_>
+        <_>
+          7 11 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 11 3 -1.</_>
+        <_>
+          2 5 11 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 8 -1.</_>
+        <_>
+          15 7 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 3 18 -1.</_>
+        <_>
+          4 0 1 18 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 8 4 -1.</_>
+        <_>
+          14 3 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 4 8 -1.</_>
+        <_>
+          8 3 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 4 12 -1.</_>
+        <_>
+          15 5 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 9 17 3 -1.</_>
+        <_>
+          2 10 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 14 3 -1.</_>
+        <_>
+          7 10 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 8 -1.</_>
+        <_>
+          8 2 3 4 2.</_>
+        <_>
+          11 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 6 -1.</_>
+        <_>
+          15 4 4 3 2.</_>
+        <_>
+          11 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 6 -1.</_>
+        <_>
+          3 4 4 3 2.</_>
+        <_>
+          7 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 18 3 -1.</_>
+        <_>
+          3 2 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 8 3 -1.</_>
+        <_>
+          4 9 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 9 10 -1.</_>
+        <_>
+          13 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 8 12 -1.</_>
+        <_>
+          1 2 4 6 2.</_>
+        <_>
+          5 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 6 -1.</_>
+        <_>
+          16 5 4 3 2.</_>
+        <_>
+          12 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 17 3 -1.</_>
+        <_>
+          1 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 15 2 -1.</_>
+        <_>
+          4 1 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 4 -1.</_>
+        <_>
+          5 2 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 14 -1.</_>
+        <_>
+          7 11 15 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 9 2 -1.</_>
+        <_>
+          8 2 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 13 -1.</_>
+        <_>
+          16 0 1 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 13 2 -1.</_>
+        <_>
+          6 0 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 2 9 -1.</_>
+        <_>
+          12 7 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 2 -1.</_>
+        <_>
+          10 7 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 11 10 -1.</_>
+        <_>
+          9 5 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 2 -1.</_>
+        <_>
+          8 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 2 9 10 -1.</_>
+        <_>
+          13 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 9 10 -1.</_>
+        <_>
+          0 7 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 2 3 8 -1.</_>
+        <_>
+          17 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 2 3 8 -1.</_>
+        <_>
+          2 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 4 18 4 -1.</_>
+        <_>
+          13 4 9 2 2.</_>
+        <_>
+          4 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 18 4 -1.</_>
+        <_>
+          0 4 9 2 2.</_>
+        <_>
+          9 6 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 14 4 -1.</_>
+        <_>
+          11 1 7 2 2.</_>
+        <_>
+          4 3 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 21 8 -1.</_>
+        <_>
+          7 0 7 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 14 18 -1.</_>
+        <_>
+          12 0 7 9 2.</_>
+        <_>
+          5 9 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 16 4 -1.</_>
+        <_>
+          5 11 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 10 6 -1.</_>
+        <_>
+          6 11 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 4 -1.</_>
+        <_>
+          5 11 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 4 6 6 -1.</_>
+        <_>
+          15 4 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 6 -1.</_>
+        <_>
+          7 4 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 5 8 6 -1.</_>
+        <_>
+          16 5 4 3 2.</_>
+        <_>
+          12 8 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 4 -1.</_>
+        <_>
+          5 5 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 6 3 12 -1.</_>
+        <_>
+          17 10 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 7 9 2 -1.</_>
+        <_>
+          5 7 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 8 -1.</_>
+        <_>
+          15 7 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 12 2 -1.</_>
+        <_>
+          5 8 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 18 3 -1.</_>
+        <_>
+          4 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 9 -1.</_>
+        <_>
+          6 6 5 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 4 3 10 -1.</_>
+        <_>
+          19 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 12 18 6 -1.</_>
+        <_>
+          0 15 18 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 13 4 -1.</_>
+        <_>
+          6 15 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 8 9 -1.</_>
+        <_>
+          3 8 8 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 10 8 -1.</_>
+        <_>
+          6 10 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 13 6 -1.</_>
+        <_>
+          4 9 13 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 12 -1.</_>
+        <_>
+          14 3 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 2 -1.</_>
+        <_>
+          8 3 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 5 12 -1.</_>
+        <_>
+          13 1 5 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 12 5 -1.</_>
+        <_>
+          9 1 6 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 8 3 -1.</_>
+        <_>
+          8 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 12 4 -1.</_>
+        <_>
+          8 12 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 8 6 4 -1.</_>
+        <_>
+          13 8 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 8 4 6 -1.</_>
+        <_>
+          9 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 20 11 -1.</_>
+        <_>
+          6 7 10 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 12 3 -1.</_>
+        <_>
+          10 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 6 4 -1.</_>
+        <_>
+          4 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 10 6 4 -1.</_>
+        <_>
+          15 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 12 3 -1.</_>
+        <_>
+          0 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 14 8 -1.</_>
+        <_>
+          4 14 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 14 12 4 -1.</_>
+        <_>
+          5 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 16 12 2 -1.</_>
+        <_>
+          5 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 20 12 -1.</_>
+        <_>
+          6 0 10 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 15 5 -1.</_>
+        <_>
+          12 12 5 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 15 2 -1.</_>
+        <_>
+          6 0 15 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 12 8 -1.</_>
+        <_>
+          12 5 6 4 2.</_>
+        <_>
+          6 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 12 8 -1.</_>
+        <_>
+          4 5 6 4 2.</_>
+        <_>
+          10 9 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 16 6 -1.</_>
+        <_>
+          14 2 8 3 2.</_>
+        <_>
+          6 5 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 16 14 -1.</_>
+        <_>
+          1 2 8 7 2.</_>
+        <_>
+          9 9 8 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          11 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 8 12 9 -1.</_>
+        <_>
+          7 11 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 4 -1.</_>
+        <_>
+          15 3 7 2 2.</_>
+        <_>
+          8 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 6 8 -1.</_>
+        <_>
+          11 2 2 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 13 6 4 -1.</_>
+        <_>
+          12 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 6 4 -1.</_>
+        <_>
+          4 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 16 2 -1.</_>
+        <_>
+          6 17 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 12 3 -1.</_>
+        <_>
+          0 4 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 3 -1.</_>
+        <_>
+          8 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 3 16 -1.</_>
+        <_>
+          6 6 3 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 14 14 -1.</_>
+        <_>
+          12 2 7 7 2.</_>
+        <_>
+          5 9 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 3 8 -1.</_>
+        <_>
+          5 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 7 4 -1.</_>
+        <_>
+          14 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 9 -1.</_>
+        <_>
+          8 9 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 15 6 -1.</_>
+        <_>
+          12 11 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 15 6 -1.</_>
+        <_>
+          5 11 5 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 8 -1.</_>
+        <_>
+          18 7 3 4 2.</_>
+        <_>
+          15 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 22 10 -1.</_>
+        <_>
+          0 7 11 5 2.</_>
+        <_>
+          11 12 11 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 20 8 -1.</_>
+        <_>
+          6 8 10 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 5 7 6 -1.</_>
+        <_>
+          2 7 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 15 8 -1.</_>
+        <_>
+          7 4 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 14 8 -1.</_>
+        <_>
+          3 3 14 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 13 2 -1.</_>
+        <_>
+          9 3 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 8 -1.</_>
+        <_>
+          10 3 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 15 2 -1.</_>
+        <_>
+          7 2 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 15 2 -1.</_>
+        <_>
+          0 2 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 3 -1.</_>
+        <_>
+          6 1 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 9 4 -1.</_>
+        <_>
+          7 0 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 3 -1.</_>
+        <_>
+          12 3 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 4 -1.</_>
+        <_>
+          11 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 10 4 -1.</_>
+        <_>
+          12 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 10 4 -1.</_>
+        <_>
+          5 1 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 13 6 5 -1.</_>
+        <_>
+          16 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 6 5 -1.</_>
+        <_>
+          3 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 11 4 7 -1.</_>
+        <_>
+          18 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 4 7 -1.</_>
+        <_>
+          2 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 14 -1.</_>
+        <_>
+          17 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 6 14 -1.</_>
+        <_>
+          3 0 2 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 4 14 -1.</_>
+        <_>
+          15 0 2 7 2.</_>
+        <_>
+          13 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 4 14 -1.</_>
+        <_>
+          5 0 2 7 2.</_>
+        <_>
+          7 7 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 4 -1.</_>
+        <_>
+          13 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 12 4 -1.</_>
+        <_>
+          1 7 6 2 2.</_>
+        <_>
+          7 9 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 18 3 -1.</_>
+        <_>
+          4 14 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 2 12 -1.</_>
+        <_>
+          2 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 16 4 -1.</_>
+        <_>
+          12 11 8 2 2.</_>
+        <_>
+          4 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 16 4 -1.</_>
+        <_>
+          2 11 8 2 2.</_>
+        <_>
+          10 13 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 12 12 4 -1.</_>
+        <_>
+          16 12 6 2 2.</_>
+        <_>
+          10 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 12 4 -1.</_>
+        <_>
+          0 12 6 2 2.</_>
+        <_>
+          6 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 10 6 -1.</_>
+        <_>
+          17 12 5 3 2.</_>
+        <_>
+          12 15 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 10 8 -1.</_>
+        <_>
+          0 10 5 4 2.</_>
+        <_>
+          5 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 7 4 -1.</_>
+        <_>
+          8 2 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 3 -1.</_>
+        <_>
+          0 4 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 6 8 -1.</_>
+        <_>
+          18 1 3 4 2.</_>
+        <_>
+          15 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 7 4 -1.</_>
+        <_>
+          2 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 6 4 -1.</_>
+        <_>
+          13 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 6 4 -1.</_>
+        <_>
+          6 2 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 16 4 -1.</_>
+        <_>
+          5 2 16 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 15 13 3 -1.</_>
+        <_>
+          4 16 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 12 -1.</_>
+        <_>
+          13 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 16 2 -1.</_>
+        <_>
+          8 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 2 16 10 -1.</_>
+        <_>
+          3 7 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 4 -1.</_>
+        <_>
+          10 4 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 9 -1.</_>
+        <_>
+          14 1 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 10 3 8 -1.</_>
+        <_>
+          4 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 12 6 6 -1.</_>
+        <_>
+          11 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 6 -1.</_>
+        <_>
+          5 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 12 -1.</_>
+        <_>
+          13 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 8 3 -1.</_>
+        <_>
+          9 7 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 12 -1.</_>
+        <_>
+          13 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 3 12 -1.</_>
+        <_>
+          8 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 9 -1.</_>
+        <_>
+          14 1 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 10 3 -1.</_>
+        <_>
+          10 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 11 9 4 -1.</_>
+        <_>
+          11 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 12 -1.</_>
+        <_>
+          8 5 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 16 -1.</_>
+        <_>
+          14 1 1 16 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 6 -1.</_>
+        <_>
+          9 4 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 2 12 -1.</_>
+        <_>
+          10 4 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 5 -1.</_>
+        <_>
+          9 0 9 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 2 12 -1.</_>
+        <_>
+          16 3 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 3 12 2 -1.</_>
+        <_>
+          6 3 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 6 4 7 -1.</_>
+        <_>
+          14 7 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 3 13 2 -1.</_>
+        <_>
+          7 3 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 14 17 4 -1.</_>
+        <_>
+          5 15 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 18 3 -1.</_>
+        <_>
+          0 14 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 14 3 -1.</_>
+        <_>
+          6 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 14 3 -1.</_>
+        <_>
+          2 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 2 -1.</_>
+        <_>
+          5 14 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 4 8 -1.</_>
+        <_>
+          0 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 7 6 8 -1.</_>
+        <_>
+          18 7 3 4 2.</_>
+        <_>
+          15 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 7 -1.</_>
+        <_>
+          11 2 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 14 3 -1.</_>
+        <_>
+          8 5 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 12 3 -1.</_>
+        <_>
+          0 5 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 2 4 9 -1.</_>
+        <_>
+          13 5 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 9 -1.</_>
+        <_>
+          5 5 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 4 -1.</_>
+        <_>
+          12 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 12 3 -1.</_>
+        <_>
+          11 5 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 8 12 -1.</_>
+        <_>
+          7 4 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 6 7 -1.</_>
+        <_>
+          11 5 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 9 6 -1.</_>
+        <_>
+          10 3 9 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 7 8 3 -1.</_>
+        <_>
+          11 7 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 1 2 9 -1.</_>
+        <_>
+          14 1 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 8 -1.</_>
+        <_>
+          1 7 3 4 2.</_>
+        <_>
+          4 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 6 -1.</_>
+        <_>
+          11 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 4 6 -1.</_>
+        <_>
+          9 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 22 4 -1.</_>
+        <_>
+          11 7 11 2 2.</_>
+        <_>
+          0 9 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 4 8 -1.</_>
+        <_>
+          3 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 12 3 -1.</_>
+        <_>
+          9 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 12 3 -1.</_>
+        <_>
+          10 2 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 6 16 -1.</_>
+        <_>
+          5 10 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 6 8 4 -1.</_>
+        <_>
+          12 6 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          5 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 12 -1.</_>
+        <_>
+          12 1 3 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 3 -1.</_>
+        <_>
+          10 1 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 8 16 4 -1.</_>
+        <_>
+          8 8 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 10 4 6 -1.</_>
+        <_>
+          8 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 14 9 4 -1.</_>
+        <_>
+          10 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 10 4 7 -1.</_>
+        <_>
+          10 10 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 12 4 6 -1.</_>
+        <_>
+          12 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 12 4 6 -1.</_>
+        <_>
+          8 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 4 6 -1.</_>
+        <_>
+          9 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 6 -1.</_>
+        <_>
+          7 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 11 16 -1.</_>
+        <_>
+          6 6 11 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 2 -1.</_>
+        <_>
+          11 2 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 6 8 -1.</_>
+        <_>
+          13 1 3 4 2.</_>
+        <_>
+          10 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 2 -1.</_>
+        <_>
+          11 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 8 3 -1.</_>
+        <_>
+          10 13 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 6 -1.</_>
+        <_>
+          11 0 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 12 3 -1.</_>
+        <_>
+          10 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 12 3 -1.</_>
+        <_>
+          0 8 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          20 0 2 18 -1.</_>
+        <_>
+          20 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 2 18 -1.</_>
+        <_>
+          0 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 6 12 -1.</_>
+        <_>
+          17 6 3 6 2.</_>
+        <_>
+          14 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 6 10 -1.</_>
+        <_>
+          1 10 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 4 12 -1.</_>
+        <_>
+          16 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 4 12 -1.</_>
+        <_>
+          2 5 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 16 4 -1.</_>
+        <_>
+          11 12 8 2 2.</_>
+        <_>
+          3 14 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 12 2 -1.</_>
+        <_>
+          0 3 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 13 3 -1.</_>
+        <_>
+          6 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 6 -1.</_>
+        <_>
+          1 0 5 3 2.</_>
+        <_>
+          6 3 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 12 5 -1.</_>
+        <_>
+          13 11 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 12 -1.</_>
+        <_>
+          2 6 3 6 2.</_>
+        <_>
+          5 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 12 8 6 -1.</_>
+        <_>
+          13 12 4 3 2.</_>
+        <_>
+          9 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 6 8 -1.</_>
+        <_>
+          1 7 3 4 2.</_>
+        <_>
+          4 11 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 3 8 -1.</_>
+        <_>
+          15 7 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 14 12 4 -1.</_>
+        <_>
+          6 14 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 4 2 11 -1.</_>
+        <_>
+          14 4 1 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 3 -1.</_>
+        <_>
+          7 7 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 12 12 3 -1.</_>
+        <_>
+          6 13 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 3 -1.</_>
+        <_>
+          2 4 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 9 9 -1.</_>
+        <_>
+          14 6 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 11 4 -1.</_>
+        <_>
+          3 15 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 5 4 6 -1.</_>
+        <_>
+          17 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 4 6 -1.</_>
+        <_>
+          3 5 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 16 3 -1.</_>
+        <_>
+          10 0 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          9 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 8 -1.</_>
+        <_>
+          14 2 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 0 12 3 -1.</_>
+        <_>
+          9 0 6 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 16 3 -1.</_>
+        <_>
+          10 0 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 3 -1.</_>
+        <_>
+          4 0 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 14 3 -1.</_>
+        <_>
+          8 13 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 11 2 -1.</_>
+        <_>
+          8 4 11 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 5 20 13 -1.</_>
+        <_>
+          2 5 10 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 9 -1.</_>
+        <_>
+          6 5 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 12 3 -1.</_>
+        <_>
+          10 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 6 7 -1.</_>
+        <_>
+          10 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 11 -1.</_>
+        <_>
+          9 6 4 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 6 6 -1.</_>
+        <_>
+          5 6 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 13 -1.</_>
+        <_>
+          15 4 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 13 -1.</_>
+        <_>
+          5 4 2 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 3 -1.</_>
+        <_>
+          9 10 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 8 12 6 -1.</_>
+        <_>
+          8 8 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 8 -1.</_>
+        <_>
+          14 2 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 2 8 2 -1.</_>
+        <_>
+          8 2 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 6 9 5 -1.</_>
+        <_>
+          11 6 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 4 -1.</_>
+        <_>
+          0 3 7 2 2.</_>
+        <_>
+          7 5 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 3 8 -1.</_>
+        <_>
+          13 2 1 8 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 8 3 -1.</_>
+        <_>
+          9 2 8 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 3 6 6 -1.</_>
+        <_>
+          14 5 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 6 10 -1.</_>
+        <_>
+          4 1 3 5 2.</_>
+        <_>
+          7 6 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 3 13 -1.</_>
+        <_>
+          19 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 3 13 -1.</_>
+        <_>
+          2 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 2 8 -1.</_>
+        <_>
+          11 1 1 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 2 -1.</_>
+        <_>
+          11 1 8 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 6 -1.</_>
+        <_>
+          8 6 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 7 6 -1.</_>
+        <_>
+          5 6 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 11 13 3 -1.</_>
+        <_>
+          9 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 13 3 -1.</_>
+        <_>
+          0 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 10 9 8 -1.</_>
+        <_>
+          12 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 10 9 8 -1.</_>
+        <_>
+          1 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 18 8 -1.</_>
+        <_>
+          13 10 9 4 2.</_>
+        <_>
+          4 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 18 8 -1.</_>
+        <_>
+          0 10 9 4 2.</_>
+        <_>
+          9 14 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 12 -1.</_>
+        <_>
+          12 2 2 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 5 20 13 -1.</_>
+        <_>
+          10 5 10 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 9 6 -1.</_>
+        <_>
+          10 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 9 6 -1.</_>
+        <_>
+          3 8 9 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 8 -1.</_>
+        <_>
+          7 6 15 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 2 12 2 -1.</_>
+        <_>
+          9 2 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 6 4 -1.</_>
+        <_>
+          12 6 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 0 13 3 -1.</_>
+        <_>
+          6 1 13 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 0 18 2 -1.</_>
+        <_>
+          3 0 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 13 12 -1.</_>
+        <_>
+          4 9 13 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 18 9 -1.</_>
+        <_>
+          10 9 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 11 -1.</_>
+        <_>
+          10 5 2 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 2 16 16 -1.</_>
+        <_>
+          6 6 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 16 16 -1.</_>
+        <_>
+          0 6 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 1 2 12 -1.</_>
+        <_>
+          18 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 2 12 -1.</_>
+        <_>
+          2 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 14 9 -1.</_>
+        <_>
+          8 6 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 14 9 -1.</_>
+        <_>
+          0 6 14 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 9 -1.</_>
+        <_>
+          10 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 3 12 -1.</_>
+        <_>
+          0 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 9 -1.</_>
+        <_>
+          13 5 6 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 4 -1.</_>
+        <_>
+          9 1 12 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 10 18 -1.</_>
+        <_>
+          16 0 5 9 2.</_>
+        <_>
+          11 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 10 18 -1.</_>
+        <_>
+          1 0 5 9 2.</_>
+        <_>
+          6 9 5 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 14 3 -1.</_>
+        <_>
+          7 12 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 3 -1.</_>
+        <_>
+          11 11 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 13 18 4 -1.</_>
+        <_>
+          2 13 9 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 6 -1.</_>
+        <_>
+          10 6 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 9 6 9 -1.</_>
+        <_>
+          10 9 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 13 3 -1.</_>
+        <_>
+          3 12 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 10 4 6 -1.</_>
+        <_>
+          18 10 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 9 5 -1.</_>
+        <_>
+          8 5 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 14 -1.</_>
+        <_>
+          13 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 18 7 -1.</_>
+        <_>
+          8 0 6 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 6 8 -1.</_>
+        <_>
+          16 4 3 4 2.</_>
+        <_>
+          13 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 4 6 8 -1.</_>
+        <_>
+          3 4 3 4 2.</_>
+        <_>
+          6 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 12 2 -1.</_>
+        <_>
+          8 6 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 3 12 -1.</_>
+        <_>
+          8 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 3 10 -1.</_>
+        <_>
+          16 1 1 10 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 12 -1.</_>
+        <_>
+          6 8 4 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 13 3 -1.</_>
+        <_>
+          5 11 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 15 12 2 -1.</_>
+        <_>
+          5 16 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 8 5 6 -1.</_>
+        <_>
+          17 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 6 6 -1.</_>
+        <_>
+          5 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 4 7 -1.</_>
+        <_>
+          10 6 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 4 10 -1.</_>
+        <_>
+          13 4 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 10 4 -1.</_>
+        <_>
+          9 4 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 2 12 -1.</_>
+        <_>
+          12 4 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 11 15 3 -1.</_>
+        <_>
+          6 11 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 6 9 -1.</_>
+        <_>
+          13 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 6 9 -1.</_>
+        <_>
+          7 6 2 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 6 6 -1.</_>
+        <_>
+          10 5 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          1 2 3 4 2.</_>
+        <_>
+          4 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 9 -1.</_>
+        <_>
+          14 3 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 18 9 -1.</_>
+        <_>
+          0 3 18 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 12 -1.</_>
+        <_>
+          9 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 16 3 -1.</_>
+        <_>
+          3 6 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 6 8 -1.</_>
+        <_>
+          19 2 3 4 2.</_>
+        <_>
+          16 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 6 8 -1.</_>
+        <_>
+          0 2 3 4 2.</_>
+        <_>
+          3 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 16 -1.</_>
+        <_>
+          5 10 12 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 6 -1.</_>
+        <_>
+          5 11 4 3 2.</_>
+        <_>
+          9 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 8 -1.</_>
+        <_>
+          11 2 3 4 2.</_>
+        <_>
+          8 6 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 7 12 -1.</_>
+        <_>
+          0 10 7 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 6 8 -1.</_>
+        <_>
+          16 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 8 -1.</_>
+        <_>
+          0 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 17 3 -1.</_>
+        <_>
+          4 1 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 4 14 -1.</_>
+        <_>
+          8 4 2 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 5 12 -1.</_>
+        <_>
+          9 8 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 4 -1.</_>
+        <_>
+          9 5 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 13 -1.</_>
+        <_>
+          14 2 1 13 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 13 3 -1.</_>
+        <_>
+          8 2 13 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 16 14 2 -1.</_>
+        <_>
+          4 17 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 15 2 -1.</_>
+        <_>
+          0 17 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 4 2 6 -1.</_>
+        <_>
+          11 4 1 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 9 -1.</_>
+        <_>
+          0 9 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 7 6 -1.</_>
+        <_>
+          12 2 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 4 6 10 -1.</_>
+        <_>
+          8 4 3 5 2.</_>
+        <_>
+          11 9 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 8 10 -1.</_>
+        <_>
+          11 7 4 5 2.</_>
+        <_>
+          7 12 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 8 -1.</_>
+        <_>
+          5 6 6 4 2.</_>
+        <_>
+          11 10 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 8 8 -1.</_>
+        <_>
+          12 6 4 4 2.</_>
+        <_>
+          8 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 8 8 -1.</_>
+        <_>
+          6 6 4 4 2.</_>
+        <_>
+          10 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 6 -1.</_>
+        <_>
+          10 6 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 7 10 8 -1.</_>
+        <_>
+          5 7 5 4 2.</_>
+        <_>
+          10 11 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 18 3 -1.</_>
+        <_>
+          4 6 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 16 15 2 -1.</_>
+        <_>
+          3 17 15 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 16 2 -1.</_>
+        <_>
+          3 11 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          5 12 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 3 13 -1.</_>
+        <_>
+          19 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 4 -1.</_>
+        <_>
+          8 10 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 14 7 -1.</_>
+        <_>
+          7 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 14 7 -1.</_>
+        <_>
+          8 7 7 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 13 -1.</_>
+        <_>
+          11 0 4 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 4 12 -1.</_>
+        <_>
+          0 6 2 6 2.</_>
+        <_>
+          2 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 12 -1.</_>
+        <_>
+          14 2 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 8 12 -1.</_>
+        <_>
+          2 2 4 6 2.</_>
+        <_>
+          6 8 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 4 16 -1.</_>
+        <_>
+          17 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 16 -1.</_>
+        <_>
+          1 8 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 16 16 -1.</_>
+        <_>
+          6 9 16 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 7 -1.</_>
+        <_>
+          10 2 2 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 1 6 6 -1.</_>
+        <_>
+          13 3 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 1 6 6 -1.</_>
+        <_>
+          9 3 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 2 12 -1.</_>
+        <_>
+          14 2 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 11 12 6 -1.</_>
+        <_>
+          5 14 12 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 4 -1.</_>
+        <_>
+          5 14 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 18 2 -1.</_>
+        <_>
+          2 16 18 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 14 -1.</_>
+        <_>
+          20 4 2 7 2.</_>
+        <_>
+          18 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 14 -1.</_>
+        <_>
+          0 4 2 7 2.</_>
+        <_>
+          2 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 12 -1.</_>
+        <_>
+          12 0 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 3 4 6 -1.</_>
+        <_>
+          9 6 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 10 -1.</_>
+        <_>
+          7 9 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 9 12 -1.</_>
+        <_>
+          4 6 9 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 17 3 -1.</_>
+        <_>
+          3 2 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 16 3 -1.</_>
+        <_>
+          0 2 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 15 10 -1.</_>
+        <_>
+          7 9 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 15 10 -1.</_>
+        <_>
+          0 9 15 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 6 18 -1.</_>
+        <_>
+          15 9 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 14 12 4 -1.</_>
+        <_>
+          3 14 6 2 2.</_>
+        <_>
+          9 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 9 5 -1.</_>
+        <_>
+          16 3 3 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 9 2 -1.</_>
+        <_>
+          9 7 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 6 3 7 -1.</_>
+        <_>
+          13 7 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 4 8 8 -1.</_>
+        <_>
+          7 4 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 12 3 -1.</_>
+        <_>
+          11 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 5 6 -1.</_>
+        <_>
+          8 6 5 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 7 10 6 -1.</_>
+        <_>
+          10 10 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 16 3 -1.</_>
+        <_>
+          0 10 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 12 3 -1.</_>
+        <_>
+          7 10 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 10 8 6 -1.</_>
+        <_>
+          2 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 6 4 12 -1.</_>
+        <_>
+          16 9 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 8 6 -1.</_>
+        <_>
+          3 11 4 3 2.</_>
+        <_>
+          7 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 5 16 10 -1.</_>
+        <_>
+          12 5 8 5 2.</_>
+        <_>
+          4 10 8 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 10 3 8 -1.</_>
+        <_>
+          7 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 6 4 -1.</_>
+        <_>
+          9 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 15 9 -1.</_>
+        <_>
+          2 12 15 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 8 6 -1.</_>
+        <_>
+          15 2 4 3 2.</_>
+        <_>
+          11 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 11 8 6 -1.</_>
+        <_>
+          4 13 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 0 2 14 -1.</_>
+        <_>
+          16 0 1 14 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 2 -1.</_>
+        <_>
+          6 0 14 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 9 7 6 -1.</_>
+        <_>
+          13 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 7 3 -1.</_>
+        <_>
+          9 7 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 2 3 13 -1.</_>
+        <_>
+          19 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 3 13 -1.</_>
+        <_>
+          2 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 12 4 -1.</_>
+        <_>
+          11 1 6 2 2.</_>
+        <_>
+          5 3 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 6 6 -1.</_>
+        <_>
+          7 10 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 14 3 -1.</_>
+        <_>
+          8 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 5 6 6 -1.</_>
+        <_>
+          12 7 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          15 6 4 8 -1.</_>
+        <_>
+          16 7 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 4 -1.</_>
+        <_>
+          0 13 7 2 2.</_>
+        <_>
+          7 15 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 7 21 6 -1.</_>
+        <_>
+          8 9 7 2 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 6 8 -1.</_>
+        <_>
+          7 4 3 4 2.</_>
+        <_>
+          10 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 8 -1.</_>
+        <_>
+          11 4 4 4 2.</_>
+        <_>
+          7 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 6 7 4 -1.</_>
+        <_>
+          9 7 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 6 7 -1.</_>
+        <_>
+          11 2 3 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 2 7 6 -1.</_>
+        <_>
+          11 2 7 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 8 6 -1.</_>
+        <_>
+          11 4 4 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 4 6 8 -1.</_>
+        <_>
+          11 4 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 8 5 -1.</_>
+        <_>
+          12 3 4 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 5 8 -1.</_>
+        <_>
+          10 3 5 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 0 9 5 -1.</_>
+        <_>
+          16 3 3 5 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 6 10 12 -1.</_>
+        <_>
+          2 9 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 5 12 -1.</_>
+        <_>
+          15 9 5 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 7 13 3 -1.</_>
+        <_>
+          3 8 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 17 3 -1.</_>
+        <_>
+          4 8 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 7 6 -1.</_>
+        <_>
+          2 11 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 9 9 4 -1.</_>
+        <_>
+          13 11 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 5 9 -1.</_>
+        <_>
+          6 3 5 3 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 3 -1.</_>
+        <_>
+          9 3 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 13 -1.</_>
+        <_>
+          4 0 2 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 8 6 -1.</_>
+        <_>
+          15 0 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 5 -1.</_>
+        <_>
+          6 0 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 12 5 -1.</_>
+        <_>
+          9 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          3 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 2 4 6 -1.</_>
+        <_>
+          18 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 4 6 -1.</_>
+        <_>
+          2 2 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 9 6 6 -1.</_>
+        <_>
+          16 11 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 6 -1.</_>
+        <_>
+          13 3 6 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 2 3 12 -1.</_>
+        <_>
+          10 6 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 6 7 -1.</_>
+        <_>
+          11 3 3 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 3 15 -1.</_>
+        <_>
+          17 1 1 15 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 6 8 -1.</_>
+        <_>
+          2 1 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 3 14 -1.</_>
+        <_>
+          14 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 3 14 -1.</_>
+        <_>
+          7 0 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 13 18 2 -1.</_>
+        <_>
+          4 13 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 15 3 -1.</_>
+        <_>
+          7 9 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 10 6 -1.</_>
+        <_>
+          14 5 5 3 2.</_>
+        <_>
+          9 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 10 6 -1.</_>
+        <_>
+          3 5 5 3 2.</_>
+        <_>
+          8 8 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 3 2 12 -1.</_>
+        <_>
+          14 3 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 2 -1.</_>
+        <_>
+          8 3 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 7 6 6 -1.</_>
+        <_>
+          14 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 6 6 -1.</_>
+        <_>
+          6 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 8 3 -1.</_>
+        <_>
+          7 0 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 4 6 -1.</_>
+        <_>
+          11 0 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 12 -1.</_>
+        <_>
+          13 0 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 12 -1.</_>
+        <_>
+          3 0 6 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 6 4 -1.</_>
+        <_>
+          16 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 4 -1.</_>
+        <_>
+          3 5 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 12 5 -1.</_>
+        <_>
+          9 0 6 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 8 10 -1.</_>
+        <_>
+          1 8 4 5 2.</_>
+        <_>
+          5 13 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 16 14 2 -1.</_>
+        <_>
+          8 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 11 16 3 -1.</_>
+        <_>
+          8 11 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 16 12 2 -1.</_>
+        <_>
+          10 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 16 12 2 -1.</_>
+        <_>
+          6 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 11 18 6 -1.</_>
+        <_>
+          12 11 9 3 2.</_>
+        <_>
+          3 14 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 6 4 -1.</_>
+        <_>
+          7 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 6 -1.</_>
+        <_>
+          10 13 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 9 4 -1.</_>
+        <_>
+          9 14 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 16 10 -1.</_>
+        <_>
+          5 9 16 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 7 3 8 -1.</_>
+        <_>
+          11 7 3 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 6 -1.</_>
+        <_>
+          13 12 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 6 22 12 -1.</_>
+        <_>
+          0 6 11 6 2.</_>
+        <_>
+          11 12 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 6 12 -1.</_>
+        <_>
+          12 5 3 6 2.</_>
+        <_>
+          9 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 6 12 -1.</_>
+        <_>
+          7 5 3 6 2.</_>
+        <_>
+          10 11 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 9 -1.</_>
+        <_>
+          14 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 6 9 -1.</_>
+        <_>
+          2 4 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 4 4 6 -1.</_>
+        <_>
+          13 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 4 6 -1.</_>
+        <_>
+          5 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 12 3 -1.</_>
+        <_>
+          10 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 15 3 -1.</_>
+        <_>
+          3 4 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 9 -1.</_>
+        <_>
+          13 5 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 5 9 2 -1.</_>
+        <_>
+          9 5 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 14 10 -1.</_>
+        <_>
+          6 2 7 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 12 2 -1.</_>
+        <_>
+          8 2 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 0 2 13 -1.</_>
+        <_>
+          17 0 1 13 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 0 13 2 -1.</_>
+        <_>
+          5 0 13 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 10 -1.</_>
+        <_>
+          12 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 6 12 3 -1.</_>
+        <_>
+          0 7 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 15 3 -1.</_>
+        <_>
+          6 7 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 5 9 -1.</_>
+        <_>
+          8 11 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 7 6 -1.</_>
+        <_>
+          10 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 7 6 -1.</_>
+        <_>
+          5 13 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 13 4 -1.</_>
+        <_>
+          5 13 13 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 4 4 6 -1.</_>
+        <_>
+          9 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 2 9 -1.</_>
+        <_>
+          13 1 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 2 8 6 -1.</_>
+        <_>
+          5 2 4 3 2.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 8 -1.</_>
+        <_>
+          12 1 2 8 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 8 4 -1.</_>
+        <_>
+          10 1 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 9 15 3 -1.</_>
+        <_>
+          7 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 10 12 3 -1.</_>
+        <_>
+          5 11 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 2 7 6 -1.</_>
+        <_>
+          15 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 7 6 -1.</_>
+        <_>
+          0 4 7 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 2 7 -1.</_>
+        <_>
+          12 3 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 3 7 2 -1.</_>
+        <_>
+          10 3 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 20 14 -1.</_>
+        <_>
+          12 3 10 7 2.</_>
+        <_>
+          2 10 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 8 -1.</_>
+        <_>
+          11 2 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 8 -1.</_>
+        <_>
+          18 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 4 6 8 -1.</_>
+        <_>
+          6 4 3 4 2.</_>
+        <_>
+          9 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 4 6 -1.</_>
+        <_>
+          12 2 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 6 4 -1.</_>
+        <_>
+          10 2 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 3 8 15 -1.</_>
+        <_>
+          11 3 4 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 11 8 7 -1.</_>
+        <_>
+          3 11 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 10 -1.</_>
+        <_>
+          15 7 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 10 14 -1.</_>
+        <_>
+          7 3 5 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 15 12 -1.</_>
+        <_>
+          11 5 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 15 12 -1.</_>
+        <_>
+          6 5 5 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 8 4 -1.</_>
+        <_>
+          9 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 4 10 -1.</_>
+        <_>
+          11 6 2 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 10 4 -1.</_>
+        <_>
+          8 8 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 14 7 4 -1.</_>
+        <_>
+          2 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 15 3 -1.</_>
+        <_>
+          7 10 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 16 4 -1.</_>
+        <_>
+          0 10 8 2 2.</_>
+        <_>
+          8 12 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 7 -1.</_>
+        <_>
+          12 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 6 5 -1.</_>
+        <_>
+          11 13 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 11 6 7 -1.</_>
+        <_>
+          12 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 11 6 7 -1.</_>
+        <_>
+          8 11 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 8 -1.</_>
+        <_>
+          18 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 8 11 -1.</_>
+        <_>
+          8 6 4 11 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 8 12 -1.</_>
+        <_>
+          9 5 4 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 6 6 -1.</_>
+        <_>
+          7 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 10 6 -1.</_>
+        <_>
+          11 2 10 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 8 9 -1.</_>
+        <_>
+          11 1 4 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 3 10 -1.</_>
+        <_>
+          12 4 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 11 4 -1.</_>
+        <_>
+          11 1 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 8 -1.</_>
+        <_>
+          18 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 8 -1.</_>
+        <_>
+          0 8 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 12 -1.</_>
+        <_>
+          12 2 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 12 12 3 -1.</_>
+        <_>
+          4 13 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 18 3 -1.</_>
+        <_>
+          2 13 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 16 3 -1.</_>
+        <_>
+          0 1 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 2 12 -1.</_>
+        <_>
+          12 2 1 12 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 12 2 -1.</_>
+        <_>
+          10 2 12 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 7 -1.</_>
+        <_>
+          15 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 13 12 2 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 6 8 -1.</_>
+        <_>
+          19 8 3 4 2.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 8 6 -1.</_>
+        <_>
+          4 3 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 4 9 -1.</_>
+        <_>
+          18 3 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 6 8 -1.</_>
+        <_>
+          8 6 6 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 4 -1.</_>
+        <_>
+          8 3 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 12 3 -1.</_>
+        <_>
+          1 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 12 3 -1.</_>
+        <_>
+          7 3 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 16 18 -1.</_>
+        <_>
+          1 9 16 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 6 8 -1.</_>
+        <_>
+          19 8 3 4 2.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 6 8 -1.</_>
+        <_>
+          0 8 3 4 2.</_>
+        <_>
+          3 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 4 4 6 -1.</_>
+        <_>
+          18 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 14 3 -1.</_>
+        <_>
+          0 13 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 16 3 -1.</_>
+        <_>
+          3 13 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 4 6 -1.</_>
+        <_>
+          0 7 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 14 8 4 -1.</_>
+        <_>
+          9 16 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 3 -1.</_>
+        <_>
+          0 14 14 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 2 -1.</_>
+        <_>
+          4 15 14 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 15 6 -1.</_>
+        <_>
+          3 15 15 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 14 6 -1.</_>
+        <_>
+          7 15 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 0 14 4 -1.</_>
+        <_>
+          0 2 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 10 6 7 -1.</_>
+        <_>
+          15 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 10 6 7 -1.</_>
+        <_>
+          5 10 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 18 4 -1.</_>
+        <_>
+          8 4 6 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 3 12 9 -1.</_>
+        <_>
+          9 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 8 10 7 -1.</_>
+        <_>
+          10 8 5 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 4 16 -1.</_>
+        <_>
+          5 6 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 8 6 8 -1.</_>
+        <_>
+          19 8 3 4 2.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 17 4 -1.</_>
+        <_>
+          0 14 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 14 6 -1.</_>
+        <_>
+          7 15 14 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 12 4 -1.</_>
+        <_>
+          0 13 6 2 2.</_>
+        <_>
+          6 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 13 12 3 -1.</_>
+        <_>
+          10 14 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 11 8 6 -1.</_>
+        <_>
+          7 11 4 3 2.</_>
+        <_>
+          11 14 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 12 9 -1.</_>
+        <_>
+          12 6 6 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 8 -1.</_>
+        <_>
+          4 6 6 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 12 6 6 -1.</_>
+        <_>
+          8 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 20 14 -1.</_>
+        <_>
+          1 4 10 7 2.</_>
+        <_>
+          11 11 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          18 0 4 10 -1.</_>
+        <_>
+          19 1 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 2 6 12 -1.</_>
+        <_>
+          2 5 6 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 4 9 -1.</_>
+        <_>
+          16 8 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 9 8 4 -1.</_>
+        <_>
+          10 9 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 8 14 3 -1.</_>
+        <_>
+          7 8 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 18 3 -1.</_>
+        <_>
+          9 8 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 8 4 -1.</_>
+        <_>
+          14 6 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 3 18 2 -1.</_>
+        <_>
+          9 3 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 10 8 -1.</_>
+        <_>
+          6 8 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 5 10 12 -1.</_>
+        <_>
+          1 8 10 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 3 12 -1.</_>
+        <_>
+          12 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 6 3 12 -1.</_>
+        <_>
+          9 6 1 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 3 13 -1.</_>
+        <_>
+          12 1 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 3 13 -1.</_>
+        <_>
+          9 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 2 12 -1.</_>
+        <_>
+          6 12 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 9 -1.</_>
+        <_>
+          17 4 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          0 0 12 4 -1.</_>
+        <_>
+          0 1 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 4 -1.</_>
+        <_>
+          14 4 6 2 2.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 6 4 -1.</_>
+        <_>
+          6 15 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 12 4 -1.</_>
+        <_>
+          7 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 4 -1.</_>
+        <_>
+          4 8 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 10 -1.</_>
+        <_>
+          15 8 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 10 -1.</_>
+        <_>
+          4 8 3 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 12 6 4 -1.</_>
+        <_>
+          16 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 6 8 -1.</_>
+        <_>
+          1 6 3 4 2.</_>
+        <_>
+          4 10 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 4 11 -1.</_>
+        <_>
+          12 2 2 11 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 1 11 4 -1.</_>
+        <_>
+          10 2 11 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 0 4 7 -1.</_>
+        <_>
+          13 1 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 0 7 4 -1.</_>
+        <_>
+          9 1 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 5 2 12 -1.</_>
+        <_>
+          13 5 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 2 12 -1.</_>
+        <_>
+          8 5 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 9 4 -1.</_>
+        <_>
+          11 5 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 10 3 -1.</_>
+        <_>
+          6 1 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 4 2 9 -1.</_>
+        <_>
+          17 4 1 9 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 2 -1.</_>
+        <_>
+          5 4 9 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 10 4 8 -1.</_>
+        <_>
+          12 10 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 4 -1.</_>
+        <_>
+          2 0 6 2 2.</_>
+        <_>
+          8 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 15 3 -1.</_>
+        <_>
+          7 8 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 12 4 -1.</_>
+        <_>
+          2 0 6 2 2.</_>
+        <_>
+          8 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 17 3 -1.</_>
+        <_>
+          0 9 17 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 13 10 5 -1.</_>
+        <_>
+          6 13 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 8 5 -1.</_>
+        <_>
+          9 11 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 4 6 -1.</_>
+        <_>
+          14 8 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 10 5 8 -1.</_>
+        <_>
+          0 14 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 7 15 3 -1.</_>
+        <_>
+          7 8 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 11 7 4 -1.</_>
+        <_>
+          2 13 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 3 11 12 -1.</_>
+        <_>
+          8 6 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 4 -1.</_>
+        <_>
+          2 4 6 2 2.</_>
+        <_>
+          8 6 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 3 12 -1.</_>
+        <_>
+          20 3 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 6 12 4 -1.</_>
+        <_>
+          1 6 6 2 2.</_>
+        <_>
+          7 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 13 3 -1.</_>
+        <_>
+          9 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 12 6 -1.</_>
+        <_>
+          0 5 6 3 2.</_>
+        <_>
+          6 8 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 13 -1.</_>
+        <_>
+          12 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 3 13 -1.</_>
+        <_>
+          9 0 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 6 8 8 -1.</_>
+        <_>
+          14 10 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 8 8 6 -1.</_>
+        <_>
+          0 10 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 13 3 -1.</_>
+        <_>
+          9 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 13 3 -1.</_>
+        <_>
+          0 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 4 -1.</_>
+        <_>
+          11 14 7 2 2.</_>
+        <_>
+          4 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 3 6 6 -1.</_>
+        <_>
+          2 3 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 20 4 -1.</_>
+        <_>
+          7 6 10 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 6 6 -1.</_>
+        <_>
+          4 7 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 8 6 10 -1.</_>
+        <_>
+          17 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 8 6 10 -1.</_>
+        <_>
+          3 8 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 13 3 -1.</_>
+        <_>
+          9 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 8 4 6 -1.</_>
+        <_>
+          6 8 4 3 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          16 5 6 13 -1.</_>
+        <_>
+          16 5 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 5 6 13 -1.</_>
+        <_>
+          3 5 3 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 18 2 -1.</_>
+        <_>
+          4 10 9 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 21 7 -1.</_>
+        <_>
+          7 7 7 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 12 -1.</_>
+        <_>
+          9 6 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 4 10 3 -1.</_>
+        <_>
+          9 5 10 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 9 9 7 -1.</_>
+        <_>
+          12 9 3 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 5 9 4 -1.</_>
+        <_>
+          14 8 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 10 -1.</_>
+        <_>
+          12 3 3 5 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 3 12 2 -1.</_>
+        <_>
+          8 3 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          14 6 4 8 -1.</_>
+        <_>
+          14 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 8 -1.</_>
+        <_>
+          4 10 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 11 12 -1.</_>
+        <_>
+          6 3 11 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 6 6 -1.</_>
+        <_>
+          8 3 6 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 10 4 -1.</_>
+        <_>
+          10 0 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 10 4 -1.</_>
+        <_>
+          7 0 5 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 3 8 8 -1.</_>
+        <_>
+          14 3 4 4 2.</_>
+        <_>
+          10 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 3 8 8 -1.</_>
+        <_>
+          4 3 4 4 2.</_>
+        <_>
+          8 7 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 18 5 -1.</_>
+        <_>
+          8 9 6 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 16 3 -1.</_>
+        <_>
+          0 16 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 16 12 2 -1.</_>
+        <_>
+          6 17 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 4 8 -1.</_>
+        <_>
+          3 4 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 6 6 6 -1.</_>
+        <_>
+          13 8 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 6 -1.</_>
+        <_>
+          9 8 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 12 6 6 -1.</_>
+        <_>
+          13 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 6 6 -1.</_>
+        <_>
+          3 14 6 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 14 4 -1.</_>
+        <_>
+          8 14 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 13 14 4 -1.</_>
+        <_>
+          0 14 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 17 2 -1.</_>
+        <_>
+          3 14 17 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 12 4 -1.</_>
+        <_>
+          8 6 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 7 9 4 -1.</_>
+        <_>
+          11 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 6 8 -1.</_>
+        <_>
+          8 2 6 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 12 12 -1.</_>
+        <_>
+          9 6 12 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          10 1 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 7 -1.</_>
+        <_>
+          14 2 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          2 3 12 9 -1.</_>
+        <_>
+          6 6 4 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 2 3 12 -1.</_>
+        <_>
+          20 3 1 12 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 5 -1.</_>
+        <_>
+          7 5 4 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 3 7 -1.</_>
+        <_>
+          14 2 1 7 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 7 3 -1.</_>
+        <_>
+          8 2 7 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 7 8 6 -1.</_>
+        <_>
+          13 7 4 3 2.</_>
+        <_>
+          9 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 4 -1.</_>
+        <_>
+          4 15 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 14 6 4 -1.</_>
+        <_>
+          10 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 6 4 -1.</_>
+        <_>
+          9 14 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 0 4 16 -1.</_>
+        <_>
+          16 0 2 8 2.</_>
+        <_>
+          14 8 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 15 20 3 -1.</_>
+        <_>
+          5 15 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 13 -1.</_>
+        <_>
+          17 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 13 8 -1.</_>
+        <_>
+          2 10 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 5 3 13 -1.</_>
+        <_>
+          17 5 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 7 4 -1.</_>
+        <_>
+          7 14 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 4 9 -1.</_>
+        <_>
+          15 4 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 16 2 -1.</_>
+        <_>
+          0 5 16 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 12 2 -1.</_>
+        <_>
+          8 5 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 3 9 15 -1.</_>
+        <_>
+          9 8 3 5 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 3 3 8 -1.</_>
+        <_>
+          12 7 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 6 12 4 -1.</_>
+        <_>
+          5 6 6 2 2.</_>
+        <_>
+          11 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 3 3 14 -1.</_>
+        <_>
+          17 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 3 3 14 -1.</_>
+        <_>
+          4 3 1 14 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 4 22 4 -1.</_>
+        <_>
+          11 4 11 2 2.</_>
+        <_>
+          0 6 11 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 4 4 9 -1.</_>
+        <_>
+          1 7 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 13 12 4 -1.</_>
+        <_>
+          7 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 12 4 -1.</_>
+        <_>
+          3 15 12 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 14 6 4 -1.</_>
+        <_>
+          11 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 13 3 -1.</_>
+        <_>
+          1 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 4 -1.</_>
+        <_>
+          11 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 14 14 4 -1.</_>
+        <_>
+          4 14 7 2 2.</_>
+        <_>
+          11 16 7 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 12 2 -1.</_>
+        <_>
+          6 1 12 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 6 4 -1.</_>
+        <_>
+          5 2 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 3 6 -1.</_>
+        <_>
+          12 1 1 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 6 3 -1.</_>
+        <_>
+          10 1 6 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 12 8 6 -1.</_>
+        <_>
+          9 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 5 10 -1.</_>
+        <_>
+          1 6 5 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 0 2 12 -1.</_>
+        <_>
+          13 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 2 12 -1.</_>
+        <_>
+          7 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 8 14 -1.</_>
+        <_>
+          16 1 4 7 2.</_>
+        <_>
+          12 8 4 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 8 10 -1.</_>
+        <_>
+          1 0 4 5 2.</_>
+        <_>
+          5 5 4 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 6 16 4 -1.</_>
+        <_>
+          10 6 8 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 14 13 2 -1.</_>
+        <_>
+          1 15 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 7 20 3 -1.</_>
+        <_>
+          7 7 10 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 2 9 4 -1.</_>
+        <_>
+          14 5 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 5 13 2 -1.</_>
+        <_>
+          6 6 13 1 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 0 6 15 -1.</_>
+        <_>
+          6 0 3 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 12 8 6 -1.</_>
+        <_>
+          5 12 4 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 1 4 7 -1.</_>
+        <_>
+          14 2 2 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 1 7 4 -1.</_>
+        <_>
+          8 2 7 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 12 8 6 -1.</_>
+        <_>
+          0 12 4 3 2.</_>
+        <_>
+          4 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 6 6 12 -1.</_>
+        <_>
+          2 6 3 6 2.</_>
+        <_>
+          5 12 3 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 9 4 -1.</_>
+        <_>
+          8 11 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 13 9 5 -1.</_>
+        <_>
+          11 13 3 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 15 8 3 -1.</_>
+        <_>
+          7 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 12 14 6 -1.</_>
+        <_>
+          11 12 7 3 2.</_>
+        <_>
+          4 15 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 15 8 3 -1.</_>
+        <_>
+          6 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 5 6 7 -1.</_>
+        <_>
+          8 5 2 7 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 4 9 12 -1.</_>
+        <_>
+          11 8 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 4 9 12 -1.</_>
+        <_>
+          8 8 3 4 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 12 6 4 -1.</_>
+        <_>
+          14 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 12 6 4 -1.</_>
+        <_>
+          2 14 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 8 -1.</_>
+        <_>
+          11 6 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 8 6 -1.</_>
+        <_>
+          7 6 8 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          13 7 6 4 -1.</_>
+        <_>
+          13 7 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 2 12 3 -1.</_>
+        <_>
+          9 3 12 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 4 6 6 -1.</_>
+        <_>
+          14 6 2 6 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 4 6 6 -1.</_>
+        <_>
+          8 6 6 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 5 3 9 -1.</_>
+        <_>
+          12 6 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          4 0 16 2 -1.</_>
+        <_>
+          4 0 16 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 12 8 3 -1.</_>
+        <_>
+          12 12 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 0 12 6 -1.</_>
+        <_>
+          13 3 6 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          9 2 4 6 -1.</_>
+        <_>
+          9 5 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 2 18 9 -1.</_>
+        <_>
+          6 5 6 3 9.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 2 3 9 -1.</_>
+        <_>
+          17 3 1 9 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          6 2 9 3 -1.</_>
+        <_>
+          5 3 9 1 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 1 12 4 -1.</_>
+        <_>
+          14 1 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 1 12 4 -1.</_>
+        <_>
+          4 1 4 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 14 12 4 -1.</_>
+        <_>
+          12 14 6 2 2.</_>
+        <_>
+          6 16 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 13 3 -1.</_>
+        <_>
+          4 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 13 3 -1.</_>
+        <_>
+          7 3 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 12 20 2 -1.</_>
+        <_>
+          11 12 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 2 12 3 -1.</_>
+        <_>
+          9 2 4 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 14 9 -1.</_>
+        <_>
+          11 8 7 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 2 4 8 -1.</_>
+        <_>
+          10 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 2 4 8 -1.</_>
+        <_>
+          10 2 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 2 16 -1.</_>
+        <_>
+          16 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 9 4 -1.</_>
+        <_>
+          5 8 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          16 1 2 16 -1.</_>
+        <_>
+          16 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 2 16 -1.</_>
+        <_>
+          4 9 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 8 6 -1.</_>
+        <_>
+          14 7 4 3 2.</_>
+        <_>
+          10 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 7 8 6 -1.</_>
+        <_>
+          4 7 4 3 2.</_>
+        <_>
+          8 10 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 7 -1.</_>
+        <_>
+          12 8 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 6 8 -1.</_>
+        <_>
+          5 8 3 4 2.</_>
+        <_>
+          8 12 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 8 2 7 -1.</_>
+        <_>
+          12 8 1 7 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          10 8 7 2 -1.</_>
+        <_>
+          10 8 7 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 9 13 8 -1.</_>
+        <_>
+          5 11 13 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 9 4 9 -1.</_>
+        <_>
+          9 9 2 9 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 6 6 10 -1.</_>
+        <_>
+          11 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 6 6 10 -1.</_>
+        <_>
+          9 6 2 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 0 14 6 -1.</_>
+        <_>
+          13 0 7 3 2.</_>
+        <_>
+          6 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 0 14 6 -1.</_>
+        <_>
+          2 0 7 3 2.</_>
+        <_>
+          9 3 7 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 6 16 3 -1.</_>
+        <_>
+          3 7 16 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 15 3 -1.</_>
+        <_>
+          1 7 15 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 8 4 -1.</_>
+        <_>
+          8 7 8 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 4 12 10 -1.</_>
+        <_>
+          8 4 6 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 0 14 16 -1.</_>
+        <_>
+          7 0 7 16 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 18 3 -1.</_>
+        <_>
+          10 1 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 12 2 -1.</_>
+        <_>
+          8 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 6 4 -1.</_>
+        <_>
+          11 1 3 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 0 4 10 -1.</_>
+        <_>
+          12 1 2 10 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          11 0 10 4 -1.</_>
+        <_>
+          10 1 10 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 7 9 4 -1.</_>
+        <_>
+          16 7 3 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 6 2 -1.</_>
+        <_>
+          11 1 6 1 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          8 8 12 2 -1.</_>
+        <_>
+          8 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 12 6 5 -1.</_>
+        <_>
+          10 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          10 7 9 11 -1.</_>
+        <_>
+          13 7 3 11 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 15 8 3 -1.</_>
+        <_>
+          10 15 4 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          19 3 2 12 -1.</_>
+        <_>
+          19 3 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 2 12 -1.</_>
+        <_>
+          2 3 1 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 1 9 10 -1.</_>
+        <_>
+          14 1 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 3 16 6 -1.</_>
+        <_>
+          5 3 8 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 1 12 12 -1.</_>
+        <_>
+          11 1 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 8 12 2 -1.</_>
+        <_>
+          8 8 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 7 3 10 -1.</_>
+        <_>
+          14 12 3 5 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 15 18 3 -1.</_>
+        <_>
+          10 15 9 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 0 13 3 -1.</_>
+        <_>
+          9 1 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 12 3 -1.</_>
+        <_>
+          5 1 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 1 2 15 -1.</_>
+        <_>
+          12 1 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 1 2 15 -1.</_>
+        <_>
+          9 1 1 15 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 13 -1.</_>
+        <_>
+          13 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 6 4 8 -1.</_>
+        <_>
+          3 6 2 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 1 4 12 -1.</_>
+        <_>
+          19 1 2 6 2.</_>
+        <_>
+          17 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 4 12 -1.</_>
+        <_>
+          1 1 2 6 2.</_>
+        <_>
+          3 7 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          17 0 4 7 -1.</_>
+        <_>
+          17 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 0 4 7 -1.</_>
+        <_>
+          3 0 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 13 -1.</_>
+        <_>
+          13 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 4 5 9 -1.</_>
+        <_>
+          7 7 5 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          12 2 3 13 -1.</_>
+        <_>
+          13 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 2 3 13 -1.</_>
+        <_>
+          8 2 1 13 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 17 4 -1.</_>
+        <_>
+          3 6 17 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 3 18 3 -1.</_>
+        <_>
+          2 4 18 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 11 6 4 -1.</_>
+        <_>
+          11 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 11 6 4 -1.</_>
+        <_>
+          5 13 6 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 5 6 4 -1.</_>
+        <_>
+          15 5 6 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          7 5 4 6 -1.</_>
+        <_>
+          7 5 2 6 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          13 1 8 8 -1.</_>
+        <_>
+          15 1 4 8 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 1 12 12 -1.</_>
+        <_>
+          7 1 4 12 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 2 4 12 -1.</_>
+        <_>
+          14 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 2 4 12 -1.</_>
+        <_>
+          6 2 2 12 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 14 -1.</_>
+        <_>
+          15 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 0 2 14 -1.</_>
+        <_>
+          6 0 1 14 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 1 7 15 -1.</_>
+        <_>
+          15 6 7 5 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 1 7 6 -1.</_>
+        <_>
+          4 3 7 2 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          1 4 20 14 -1.</_>
+        <_>
+          11 4 10 7 2.</_>
+        <_>
+          1 11 10 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 2 6 8 -1.</_>
+        <_>
+          3 2 2 8 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          15 0 2 13 -1.</_>
+        <_>
+          15 0 1 13 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 1 9 10 -1.</_>
+        <_>
+          5 1 3 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 9 6 6 -1.</_>
+        <_>
+          11 9 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 5 8 4 -1.</_>
+        <_>
+          5 5 8 2 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          5 8 14 4 -1.</_>
+        <_>
+          5 9 14 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 7 20 2 -1.</_>
+        <_>
+          10 7 10 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 0 10 10 -1.</_>
+        <_>
+          8 0 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 0 10 10 -1.</_>
+        <_>
+          9 0 5 10 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 1 15 10 -1.</_>
+        <_>
+          10 1 5 10 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          0 9 18 4 -1.</_>
+        <_>
+          0 10 18 2 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 8 10 6 -1.</_>
+        <_>
+          8 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 8 10 6 -1.</_>
+        <_>
+          4 10 10 2 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          11 6 10 12 -1.</_>
+        <_>
+          11 10 10 4 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 5 4 8 -1.</_>
+        <_>
+          8 5 4 4 2.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          17 8 5 6 -1.</_>
+        <_>
+          17 11 5 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          8 11 4 7 -1.</_>
+        <_>
+          10 11 2 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          9 5 12 3 -1.</_>
+        <_>
+          9 6 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          2 9 13 3 -1.</_>
+        <_>
+          2 10 13 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 13 16 3 -1.</_>
+        <_>
+          3 13 8 3 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          5 12 8 4 -1.</_>
+        <_>
+          9 12 4 4 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 8 6 9 -1.</_>
+        <_>
+          14 11 6 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 10 12 3 -1.</_>
+        <_>
+          4 11 12 1 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          6 7 11 9 -1.</_>
+        <_>
+          6 10 11 3 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 1 9 4 -1.</_>
+        <_>
+          7 4 3 4 3.</_></rects>
+      <tilted>1</tilted></_>
+    <_>
+      <rects>
+        <_>
+          12 1 9 9 -1.</_>
+        <_>
+          15 1 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          1 1 9 9 -1.</_>
+        <_>
+          4 1 3 9 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          14 1 6 6 -1.</_>
+        <_>
+          16 1 2 6 3.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          4 6 4 6 -1.</_>
+        <_>
+          6 6 2 6 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          7 5 12 7 -1.</_>
+        <_>
+          10 5 6 7 2.</_></rects></_>
+    <_>
+      <rects>
+        <_>
+          3 5 12 7 -1.</_>
+        <_>
+          6 5 6 7 2.</_></rects></_></features></cascade>
+</opencv_storage>
diff --git a/venv/Lib/site-packages/cv2/opencv_videoio_ffmpeg440.dll b/venv/Lib/site-packages/cv2/opencv_videoio_ffmpeg440.dll
new file mode 100644
index 000000000..2b2c31fac
Binary files /dev/null and b/venv/Lib/site-packages/cv2/opencv_videoio_ffmpeg440.dll differ
diff --git a/venv/Lib/site-packages/cv2/version.py b/venv/Lib/site-packages/cv2/version.py
new file mode 100644
index 000000000..fefaa5b6f
--- /dev/null
+++ b/venv/Lib/site-packages/cv2/version.py
@@ -0,0 +1,4 @@
+opencv_version = "4.4.0.44"
+contrib = False
+headless = False
+ci_build = True
\ No newline at end of file
diff --git a/venv/Lib/site-packages/distutils-precedence.pth b/venv/Lib/site-packages/distutils-precedence.pth
new file mode 100644
index 000000000..6de4198fc
--- /dev/null
+++ b/venv/Lib/site-packages/distutils-precedence.pth
@@ -0,0 +1 @@
+import os; var = 'SETUPTOOLS_USE_DISTUTILS'; enabled = os.environ.get(var, 'stdlib') == 'local'; enabled and __import__('_distutils_hack').add_shim(); 
diff --git a/venv/Lib/site-packages/easy_install.py b/venv/Lib/site-packages/easy_install.py
new file mode 100644
index 000000000..d87e98403
--- /dev/null
+++ b/venv/Lib/site-packages/easy_install.py
@@ -0,0 +1,5 @@
+"""Run the EasyInstall command"""
+
+if __name__ == '__main__':
+    from setuptools.command.easy_install import main
+    main()
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/INSTALLER b/venv/Lib/site-packages/numpy-1.19.2.dist-info/INSTALLER
new file mode 100644
index 000000000..a1b589e38
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/INSTALLER
@@ -0,0 +1 @@
+pip
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSE.txt b/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSE.txt
new file mode 100644
index 000000000..04619f58b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSE.txt
@@ -0,0 +1,938 @@
+
+----
+
+This binary distribution of NumPy also bundles the following software:
+
+
+Name: OpenBLAS
+Files: extra-dll\libopenb*.dll
+Description: bundled as a dynamically linked library
+Availability: https://github.com/xianyi/OpenBLAS/
+License: 3-clause BSD
+  Copyright (c) 2011-2014, The OpenBLAS Project
+  All rights reserved.
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are
+  met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in
+        the documentation and/or other materials provided with the
+        distribution.
+     3. Neither the name of the OpenBLAS project nor the names of
+        its contributors may be used to endorse or promote products
+        derived from this software without specific prior written
+        permission.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+  OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
+  USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+Name: LAPACK
+Files: extra-dll\libopenb*.dll
+Description: bundled in OpenBLAS
+Availability: https://github.com/xianyi/OpenBLAS/
+License 3-clause BSD
+  Copyright (c) 1992-2013 The University of Tennessee and The University
+                          of Tennessee Research Foundation.  All rights
+                          reserved.
+  Copyright (c) 2000-2013 The University of California Berkeley. All
+                          rights reserved.
+  Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
+                          reserved.
+
+  $COPYRIGHT$
+
+  Additional copyrights may follow
+
+  $HEADER$
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are
+  met:
+
+  - Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  - Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer listed
+    in this license in the documentation and/or other materials
+    provided with the distribution.
+
+  - Neither the name of the copyright holders nor the names of its
+    contributors may be used to endorse or promote products derived from
+    this software without specific prior written permission.
+
+  The copyright holders provide no reassurances that the source code
+  provided does not infringe any patent, copyright, or any other
+  intellectual property rights of third parties.  The copyright holders
+  disclaim any liability to any recipient for claims brought against
+  recipient by any third party for infringement of that parties
+  intellectual property rights.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+  OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+Name: GCC runtime library
+Files: extra-dll\*.dll
+Description: statically linked, in DLL files compiled with gfortran only
+Availability: https://gcc.gnu.org/viewcvs/gcc/
+License: GPLv3 + runtime exception
+  Copyright (C) 2002-2017 Free Software Foundation, Inc.
+
+  Libgfortran is free software; you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation; either version 3, or (at your option)
+  any later version.
+
+  Libgfortran is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  Under Section 7 of GPL version 3, you are granted additional
+  permissions described in the GCC Runtime Library Exception, version
+  3.1, as published by the Free Software Foundation.
+
+  You should have received a copy of the GNU General Public License and
+  a copy of the GCC Runtime Library Exception along with this program;
+  see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+  <http://www.gnu.org/licenses/>.
+
+
+Name: Microsoft Visual C++ Runtime Files
+Files: extra-dll\msvcp140.dll
+License: MSVC
+  https://www.visualstudio.com/license-terms/distributable-code-microsoft-visual-studio-2015-rc-microsoft-visual-studio-2015-sdk-rc-includes-utilities-buildserver-files/#visual-c-runtime
+
+  Subject to the License Terms for the software, you may copy and
+  distribute with your program any of the files within the followng
+  folder and its subfolders except as noted below. You may not modify
+  these files.
+
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist
+
+  You may not distribute the contents of the following folders:
+
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist\debug_nonredist
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist\onecore\debug_nonredist
+
+  Subject to the License Terms for the software, you may copy and
+  distribute the following files with your program in your program’s
+  application local folder or by deploying them into the Global
+  Assembly Cache (GAC):
+
+  VC\atlmfc\lib\mfcmifc80.dll
+  VC\atlmfc\lib\amd64\mfcmifc80.dll
+
+
+Name: Microsoft Visual C++ Runtime Files
+Files: extra-dll\msvc*90.dll, extra-dll\Microsoft.VC90.CRT.manifest
+License: MSVC
+  For your convenience, we have provided the following folders for
+  use when redistributing VC++ runtime files. Subject to the license
+  terms for the software, you may redistribute the folder
+  (unmodified) in the application local folder as a sub-folder with
+  no change to the folder name. You may also redistribute all the
+  files (*.dll and *.manifest) within a folder, listed below the
+  folder for your convenience, as an entire set.
+
+  \VC\redist\x86\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\ia64\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\amd64\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\x86\Microsoft.VC90.CRT\
+   msvcm90.dll
+   msvcp90.dll
+   msvcr90.dll
+   Microsoft.VC90.CRT.manifest
+  \VC\redist\ia64\Microsoft.VC90.CRT\
+   msvcm90.dll
+   msvcp90.dll
+   msvcr90.dll
+   Microsoft.VC90.CRT.manifest
+
+----
+
+Full text of license texts referred to above follows (that they are
+listed below does not necessarily imply the conditions apply to the
+present binary release):
+
+----
+
+GCC RUNTIME LIBRARY EXCEPTION
+
+Version 3.1, 31 March 2009
+
+Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
+
+Everyone is permitted to copy and distribute verbatim copies of this
+license document, but changing it is not allowed.
+
+This GCC Runtime Library Exception ("Exception") is an additional
+permission under section 7 of the GNU General Public License, version
+3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
+bears a notice placed by the copyright holder of the file stating that
+the file is governed by GPLv3 along with this Exception.
+
+When you use GCC to compile a program, GCC may combine portions of
+certain GCC header files and runtime libraries with the compiled
+program. The purpose of this Exception is to allow compilation of
+non-GPL (including proprietary) programs to use, in this way, the
+header files and runtime libraries covered by this Exception.
+
+0. Definitions.
+
+A file is an "Independent Module" if it either requires the Runtime
+Library for execution after a Compilation Process, or makes use of an
+interface provided by the Runtime Library, but is not otherwise based
+on the Runtime Library.
+
+"GCC" means a version of the GNU Compiler Collection, with or without
+modifications, governed by version 3 (or a specified later version) of
+the GNU General Public License (GPL) with the option of using any
+subsequent versions published by the FSF.
+
+"GPL-compatible Software" is software whose conditions of propagation,
+modification and use would permit combination with GCC in accord with
+the license of GCC.
+
+"Target Code" refers to output from any compiler for a real or virtual
+target processor architecture, in executable form or suitable for
+input to an assembler, loader, linker and/or execution
+phase. Notwithstanding that, Target Code does not include data in any
+format that is used as a compiler intermediate representation, or used
+for producing a compiler intermediate representation.
+
+The "Compilation Process" transforms code entirely represented in
+non-intermediate languages designed for human-written code, and/or in
+Java Virtual Machine byte code, into Target Code. Thus, for example,
+use of source code generators and preprocessors need not be considered
+part of the Compilation Process, since the Compilation Process can be
+understood as starting with the output of the generators or
+preprocessors.
+
+A Compilation Process is "Eligible" if it is done using GCC, alone or
+with other GPL-compatible software, or if it is done without using any
+work based on GCC. For example, using non-GPL-compatible Software to
+optimize any GCC intermediate representations would not qualify as an
+Eligible Compilation Process.
+
+1. Grant of Additional Permission.
+
+You have permission to propagate a work of Target Code formed by
+combining the Runtime Library with Independent Modules, even if such
+propagation would otherwise violate the terms of GPLv3, provided that
+all Target Code was generated by Eligible Compilation Processes. You
+may then convey such a combination under terms of your choice,
+consistent with the licensing of the Independent Modules.
+
+2. No Weakening of GCC Copyleft.
+
+The availability of this Exception does not imply any general
+presumption that third-party software is unaffected by the copyleft
+requirements of the license of GCC.
+
+----
+
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSES_bundled.txt b/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSES_bundled.txt
new file mode 100644
index 000000000..e9c66d1dc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/LICENSES_bundled.txt
@@ -0,0 +1,27 @@
+The NumPy repository and source distributions bundle several libraries that are
+compatibly licensed.  We list these here.
+
+Name: Numpydoc
+Files: doc/sphinxext/numpydoc/*
+License: BSD-2-Clause
+  For details, see doc/sphinxext/LICENSE.txt
+
+Name: scipy-sphinx-theme
+Files: doc/scipy-sphinx-theme/*
+License: BSD-3-Clause AND PSF-2.0 AND Apache-2.0
+  For details, see doc/scipy-sphinx-theme/LICENSE.txt
+
+Name: lapack-lite
+Files: numpy/linalg/lapack_lite/*
+License: BSD-3-Clause
+  For details, see numpy/linalg/lapack_lite/LICENSE.txt
+
+Name: tempita
+Files: tools/npy_tempita/*
+License: MIT
+  For details, see tools/npy_tempita/license.txt
+
+Name: dragon4
+Files: numpy/core/src/multiarray/dragon4.c
+License: MIT
+  For license text, see numpy/core/src/multiarray/dragon4.c
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/METADATA b/venv/Lib/site-packages/numpy-1.19.2.dist-info/METADATA
new file mode 100644
index 000000000..8530c4bf5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/METADATA
@@ -0,0 +1,55 @@
+Metadata-Version: 2.1
+Name: numpy
+Version: 1.19.2
+Summary: NumPy is the fundamental package for array computing with Python.
+Home-page: https://www.numpy.org
+Author: Travis E. Oliphant et al.
+Maintainer: NumPy Developers
+Maintainer-email: numpy-discussion@python.org
+License: BSD
+Download-URL: https://pypi.python.org/pypi/numpy
+Project-URL: Bug Tracker, https://github.com/numpy/numpy/issues
+Project-URL: Documentation, https://numpy.org/doc/1.19
+Project-URL: Source Code, https://github.com/numpy/numpy
+Platform: Windows
+Platform: Linux
+Platform: Solaris
+Platform: Mac OS-X
+Platform: Unix
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Science/Research
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved
+Classifier: Programming Language :: C
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Topic :: Software Development
+Classifier: Topic :: Scientific/Engineering
+Classifier: Operating System :: Microsoft :: Windows
+Classifier: Operating System :: POSIX
+Classifier: Operating System :: Unix
+Classifier: Operating System :: MacOS
+Requires-Python: >=3.6
+
+It provides:
+
+- a powerful N-dimensional array object
+- sophisticated (broadcasting) functions
+- tools for integrating C/C++ and Fortran code
+- useful linear algebra, Fourier transform, and random number capabilities
+- and much more
+
+Besides its obvious scientific uses, NumPy can also be used as an efficient
+multi-dimensional container of generic data. Arbitrary data-types can be
+defined. This allows NumPy to seamlessly and speedily integrate with a wide
+variety of databases.
+
+All NumPy wheels distributed on PyPI are BSD licensed.
+
+
+
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/RECORD b/venv/Lib/site-packages/numpy-1.19.2.dist-info/RECORD
new file mode 100644
index 000000000..16e1e9cf0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/RECORD
@@ -0,0 +1,859 @@
+../../Scripts/f2py.exe,sha256=rYqgnO_QtOPx8lTzvWOuVd1e-h6AfK7ujL5g2xFBDUU,97232
+numpy-1.19.2.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
+numpy-1.19.2.dist-info/LICENSE.txt,sha256=VDW_78UWZhzN_Z729vbkkr7MzLGzi7lj3OKbwZkxrP0,47238
+numpy-1.19.2.dist-info/LICENSES_bundled.txt,sha256=3I3WKh8SY17BDjg5LGim_VA0zdgPDYAMsn4J-04iQrc,791
+numpy-1.19.2.dist-info/METADATA,sha256=xGGkEPvABplRUisaQ-KBaFnlRl8I_pWR3tf8HtA52Cw,2000
+numpy-1.19.2.dist-info/RECORD,,
+numpy-1.19.2.dist-info/WHEEL,sha256=AV2Nvbg-pC-zIZdxGMBky9Ya05hYOPClxAaFNPEQVgE,102
+numpy-1.19.2.dist-info/entry_points.txt,sha256=cOAXaHCx7qU-bvE9TStTTZW46RN-s-i6Mz9smnWkL3g,49
+numpy-1.19.2.dist-info/top_level.txt,sha256=4J9lbBMLnAiyxatxh8iRKV5Entd_6-oqbO7pzJjMsPw,6
+numpy/.libs/libopenblas.U35RT5X5BPDSH5ZTF276YADQR2KDU6PR.gfortran-win32.dll,sha256=-bKF0jubzymBPYPyG1lwUmHupkZqpfen6WMaA-f7Wqk,27766238
+numpy/LICENSE.txt,sha256=VDW_78UWZhzN_Z729vbkkr7MzLGzi7lj3OKbwZkxrP0,47238
+numpy/__config__.py,sha256=m_FyVZ1o5OtbniChpVrUUGACZXBw03jS6Er12L02mnA,2988
+numpy/__init__.cython-30.pxd,sha256=VH-_4qywNddiVTdnwX6Upji1i6rc-mcXCbWNWAoA2pY,36666
+numpy/__init__.pxd,sha256=qYDQe0byfzkEl2n4mqjXDznpooiR1GX9UJDhKQaaTX4,32601
+numpy/__init__.py,sha256=ul6myrEAlXBrxO6viMB5nvTd0kzp4ztqwik9W7yx7fQ,11555
+numpy/__pycache__/__config__.cpython-36.pyc,,
+numpy/__pycache__/__init__.cpython-36.pyc,,
+numpy/__pycache__/_distributor_init.cpython-36.pyc,,
+numpy/__pycache__/_globals.cpython-36.pyc,,
+numpy/__pycache__/_pytesttester.cpython-36.pyc,,
+numpy/__pycache__/conftest.cpython-36.pyc,,
+numpy/__pycache__/ctypeslib.cpython-36.pyc,,
+numpy/__pycache__/dual.cpython-36.pyc,,
+numpy/__pycache__/matlib.cpython-36.pyc,,
+numpy/__pycache__/setup.cpython-36.pyc,,
+numpy/__pycache__/version.cpython-36.pyc,,
+numpy/_distributor_init.py,sha256=JNDpdNiHRi5PTZgzo5OqixP2OmYGcBF3YwXDnA1ko8A,1244
+numpy/_globals.py,sha256=Hn6HQltNo4q5i1uia9p4o0l4H8RCAa9y9DG9rEF5J_M,2384
+numpy/_pytesttester.py,sha256=RUCosg1k6UlkT_jqkq3UMsSht41kw7Z3wB6PlfbxRRo,6959
+numpy/compat/__init__.py,sha256=kryOGy6TD3f9oEXy1sZZOxEMc50A7GtON1yf0nMPzr8,450
+numpy/compat/__pycache__/__init__.cpython-36.pyc,,
+numpy/compat/__pycache__/_inspect.cpython-36.pyc,,
+numpy/compat/__pycache__/py3k.cpython-36.pyc,,
+numpy/compat/__pycache__/setup.cpython-36.pyc,,
+numpy/compat/_inspect.py,sha256=4PWDVD-iE3lZGrBCWdiLMn2oSytssuFszubUkC0oruA,7638
+numpy/compat/py3k.py,sha256=P2MkAjs5YJM9OCN1fBllxPuzxcGm3DURKEIDkrpI9Mg,5644
+numpy/compat/setup.py,sha256=PmRas58NGR72H-7OsQj6kElSUeQHjN75qVh5jlQIJmc,345
+numpy/compat/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/compat/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/compat/tests/__pycache__/test_compat.cpython-36.pyc,,
+numpy/compat/tests/test_compat.py,sha256=6i0bPM1Nqw0n3wtMphMU7ul7fkQNwcuH2Xxc9vpnQy8,495
+numpy/conftest.py,sha256=aichnxaKFA-EVeiRNQNVnRVlvPc4g2lrEKWu4Yhgs6E,3763
+numpy/core/__init__.py,sha256=gE-5KMe6aazGgpzDbBRjm8GIkpgQIAqGB5Cdueoml5M,4478
+numpy/core/__pycache__/__init__.cpython-36.pyc,,
+numpy/core/__pycache__/_add_newdocs.cpython-36.pyc,,
+numpy/core/__pycache__/_asarray.cpython-36.pyc,,
+numpy/core/__pycache__/_dtype.cpython-36.pyc,,
+numpy/core/__pycache__/_dtype_ctypes.cpython-36.pyc,,
+numpy/core/__pycache__/_exceptions.cpython-36.pyc,,
+numpy/core/__pycache__/_internal.cpython-36.pyc,,
+numpy/core/__pycache__/_methods.cpython-36.pyc,,
+numpy/core/__pycache__/_string_helpers.cpython-36.pyc,,
+numpy/core/__pycache__/_type_aliases.cpython-36.pyc,,
+numpy/core/__pycache__/_ufunc_config.cpython-36.pyc,,
+numpy/core/__pycache__/arrayprint.cpython-36.pyc,,
+numpy/core/__pycache__/cversions.cpython-36.pyc,,
+numpy/core/__pycache__/defchararray.cpython-36.pyc,,
+numpy/core/__pycache__/einsumfunc.cpython-36.pyc,,
+numpy/core/__pycache__/fromnumeric.cpython-36.pyc,,
+numpy/core/__pycache__/function_base.cpython-36.pyc,,
+numpy/core/__pycache__/generate_numpy_api.cpython-36.pyc,,
+numpy/core/__pycache__/getlimits.cpython-36.pyc,,
+numpy/core/__pycache__/machar.cpython-36.pyc,,
+numpy/core/__pycache__/memmap.cpython-36.pyc,,
+numpy/core/__pycache__/multiarray.cpython-36.pyc,,
+numpy/core/__pycache__/numeric.cpython-36.pyc,,
+numpy/core/__pycache__/numerictypes.cpython-36.pyc,,
+numpy/core/__pycache__/overrides.cpython-36.pyc,,
+numpy/core/__pycache__/records.cpython-36.pyc,,
+numpy/core/__pycache__/setup.cpython-36.pyc,,
+numpy/core/__pycache__/setup_common.cpython-36.pyc,,
+numpy/core/__pycache__/shape_base.cpython-36.pyc,,
+numpy/core/__pycache__/umath.cpython-36.pyc,,
+numpy/core/__pycache__/umath_tests.cpython-36.pyc,,
+numpy/core/_add_newdocs.py,sha256=Y6kY6JbPh76podN7aaNFDvMOtGeG7XyRaeKtcA1aeoA,209585
+numpy/core/_asarray.py,sha256=FfuRpE2yY8o_APGVuPPrJHdYhX0pg1H7OMjdywn3hsg,10196
+numpy/core/_dtype.py,sha256=sddrJRUYJRr5lBFkYQOi5B-JwLNBDX3HH2t0-VmQA38,10162
+numpy/core/_dtype_ctypes.py,sha256=O8tYBqU1QzCG1CXviBe6jrgHYnyIPqpci9GEy9lXO08,3790
+numpy/core/_exceptions.py,sha256=ZUJhyRYgfhkUKOlOGpSWzyN6flkOETrEHyd-J94ah9I,6438
+numpy/core/_internal.py,sha256=Rc3o6axTsBI35aWXy4F0T4AHDvzDU690ioPe6aybGco,27167
+numpy/core/_methods.py,sha256=QrUoh1dojqVNY3LjFT-dgHK1x3uyvauWSniwq6xY_KI,9409
+numpy/core/_multiarray_tests.cp36-win32.pyd,sha256=ebXB5jB44iYXEsZZ5JoqjO67fAcnZEJjB8n8L7aTE5w,102400
+numpy/core/_multiarray_umath.cp36-win32.pyd,sha256=V6PaaFrJxF7W1tIctdgk4a0czfHqg3fKpTxfuK5rZio,2161152
+numpy/core/_operand_flag_tests.cp36-win32.pyd,sha256=6G_pLlgalgq8nNjGJ-HMs8NR6ZP8_-Vf73kxTcpKgUM,11264
+numpy/core/_rational_tests.cp36-win32.pyd,sha256=bvOFclPFWe5hcJTdw76o-aIksnviJCZk2NentbqS8v0,39424
+numpy/core/_string_helpers.py,sha256=xFVFp6go9I8O7PKRR2zwkOk2VJxlnXTFSYt4s7MwXGM,2955
+numpy/core/_struct_ufunc_tests.cp36-win32.pyd,sha256=5mAs-NJz6rOz4-Wwgmegtf1YGNuj4z_KrVTrScqcarM,11776
+numpy/core/_type_aliases.py,sha256=hEcynWM8bX_b6Ktamqp9EWanQwI36nps_0qP8rNUn6Y,9118
+numpy/core/_ufunc_config.py,sha256=K_L35alWVK-CBKiQDp2Bp2-7LgXPBNmGHVAg5gNJbCg,14271
+numpy/core/_umath_tests.cp36-win32.pyd,sha256=qid3jhO7mYZYEP6AFZpqDJTjf19w0gCNYEX8aOx50MQ,19456
+numpy/core/arrayprint.py,sha256=p1IGWeE_XsqB3R03Bx2kTH3h0LKJE2CquKvAqgeyUEk,60720
+numpy/core/cversions.py,sha256=FISv1d4R917Bi5xJjKKy8Lo6AlFkV00WvSoB7l3acA4,360
+numpy/core/defchararray.py,sha256=22KKqZkIUTSruv9fpFyAo8SNKquWLiSUywVpyODltTI,72836
+numpy/core/einsumfunc.py,sha256=ZVSR-OFiwna8PuG8kQvRai0YPBdGXT7rhduDqkJK8-Y,52104
+numpy/core/fromnumeric.py,sha256=1f_9JUttTgw40hccXhx2KwQG41R4H0sFbn3q8s2eJbM,122903
+numpy/core/function_base.py,sha256=pti65ytjDaNA7WLG-66BCENWTk5ILt1PE4NP0Uj6Au0,18539
+numpy/core/generate_numpy_api.py,sha256=888NFRWyHei7OhOxambeR0kjzWMAuPraLXfOgNpEOPo,7259
+numpy/core/getlimits.py,sha256=rG9sl-1Atr130qfkAExh8ZRS69Q9ijP66uXPu8ah2e8,19625
+numpy/core/include/numpy/__multiarray_api.h,sha256=WxWdkutB8npLHtvOsGr7q-EhYcgvZa1yASZ6n_N0zFQ,63144
+numpy/core/include/numpy/__ufunc_api.h,sha256=Jmeal3EUlXxBZFX1zAUFvO7jWFVhvIOyf2DG_TW0X2k,12739
+numpy/core/include/numpy/_neighborhood_iterator_imp.h,sha256=9QiCyQf-O1MEjBJQ7T4JUu_JyUyQhCBZHbwOr7sAlyk,1951
+numpy/core/include/numpy/_numpyconfig.h,sha256=ojrAtgf1OQbkjHZOXfCiltmiVRhGL2J6_KzyK_SMtXk,891
+numpy/core/include/numpy/arrayobject.h,sha256=Xt8fnhPhTkbhB313Xj315N3fLi3uYBEPbqNrsF-MUXE,175
+numpy/core/include/numpy/arrayscalars.h,sha256=2IOwYufP2meo-i-CSp1EuZp7xvaOcAbLX9p9fbztNY0,3850
+numpy/core/include/numpy/halffloat.h,sha256=AaeF7vnfAjeoIg5krxbhDn7j_T6CAQIx-HfMBYYmGiQ,1948
+numpy/core/include/numpy/multiarray_api.txt,sha256=U9kT--p3paE9tIEcO8_EEukykiZR2gf-3X1AIE3JHsc,57907
+numpy/core/include/numpy/ndarrayobject.h,sha256=3GqcdPD2qgESrcH1O5oFlY04HC3aZ_VdN2tuLl65BrQ,10956
+numpy/core/include/numpy/ndarraytypes.h,sha256=CXaIHXNs_aHierB5g9TKuXtga2DZiRmFsgTrwUbbb1c,66416
+numpy/core/include/numpy/noprefix.h,sha256=fg28OipEj4EaPsrNGWu4YNZoGK7Bxdm5o45pAO5HaSk,6998
+numpy/core/include/numpy/npy_1_7_deprecated_api.h,sha256=J90pyNSaA6CJkrt4F8-U0V1_tVWq4ZWd5MBbmaCwNhI,4477
+numpy/core/include/numpy/npy_3kcompat.h,sha256=K-g1EV-lqWzTCcPO1RlU8sR0x9qNguHx7vu31PT8Dus,15106
+numpy/core/include/numpy/npy_common.h,sha256=1OETQY6oleu77oh0KnncqLZ-G2CtVcnE6PQ1UaQiGEc,38801
+numpy/core/include/numpy/npy_cpu.h,sha256=53geT_dAYyBsf_lkAeuwF8XyDvoKVOuNkDQWvJNgE9k,4160
+numpy/core/include/numpy/npy_endian.h,sha256=_vfSgtUccP2UrI6ag77Gj2mWbBnMKQfsPS2ggNwmJ2A,2714
+numpy/core/include/numpy/npy_interrupt.h,sha256=CjwMAXyJjxLbpbPFpyHrTgT1QDa2mrzQ-5EhGA-feqk,1923
+numpy/core/include/numpy/npy_math.h,sha256=qJ4lNGUY-o-fZRNrNWf-Dsd0u6P0A2LCgs_2sJcMWQ0,21626
+numpy/core/include/numpy/npy_no_deprecated_api.h,sha256=4-ALjOYp43ACG7z4zdabmQtFsxxKDaqYuQFTbElty1o,586
+numpy/core/include/numpy/npy_os.h,sha256=g6I_-QEotWP0p9g1v-GA_Qibg5HRAhQj46WsZ19fIuw,847
+numpy/core/include/numpy/numpyconfig.h,sha256=_-_S3Q6rmola77NK1KzU7de-3Ta9O0cPIX_xUAw3bPo,1412
+numpy/core/include/numpy/old_defines.h,sha256=gxn96tn2uCpdL0yBFEO6H_JDkhikf8Bj-w3x8sOz5Go,6493
+numpy/core/include/numpy/oldnumeric.h,sha256=b2lR7L8Lajka8FQ3HrrkSnekPKYK0v4vsUduS8gWZqc,733
+numpy/core/include/numpy/random/bitgen.h,sha256=V0PTeCTsLhKTq_z0hM8VgDa7jTQUTPASD0MkMaGXrgk,409
+numpy/core/include/numpy/random/distributions.h,sha256=QO6dZQ44z6oFyNtS6vYEvE3wkDJ0xuv9j-ycHZeVImk,9833
+numpy/core/include/numpy/ufunc_api.txt,sha256=8gADu8fBcUgFZV0yMbJwa1CtJKJsPVrx8MjuXsu18aw,7397
+numpy/core/include/numpy/ufuncobject.h,sha256=P5b7oDLvsE4sYGLxQ8gNDSN-f__LR064FV4duDq97Uw,13127
+numpy/core/include/numpy/utils.h,sha256=2moeSYMf5sRP51gPne9F-Nixa14F6ZjObLYCseXpJmE,750
+numpy/core/lib/npy-pkg-config/mlib.ini,sha256=mQBSOI6opCVmMZK4vwIhLe5J7YevO3PbaHsI0MlJGHs,151
+numpy/core/lib/npy-pkg-config/npymath.ini,sha256=5dwvhvbX3a_9toniEDvGPDGChbXIfFiLa36H4YOR-vw,380
+numpy/core/lib/npymath.lib,sha256=Z1q1HvHbs7-CA5TlGrav8Sa3xhyZ9wn399QDQdmZ3pg,99890
+numpy/core/machar.py,sha256=Lia31J_lHCuREuCbQv8jK2ROHCCfhDa9XhQOW-EGEW4,11128
+numpy/core/memmap.py,sha256=h9J1auLOKHxEgColBNSxwkzBx43_JjnV0TBKQxLw7f0,11896
+numpy/core/multiarray.py,sha256=N9aC-BLmzaA_TJMt6XET1tW4rdeKjneRsUKPuQMFM7Y,56072
+numpy/core/numeric.py,sha256=rtuJMigd68Ee5tLhALuiJFaOLONj7cdsE8wBMFjtEzY,77084
+numpy/core/numerictypes.py,sha256=OwSX8i9qjibOqnB3Stk3t83AYu1qcIWAumlGm7axOs4,17205
+numpy/core/overrides.py,sha256=z1RR4qiSeRYVd7rHygHPzPsnRfD8oWX-Fq6aVmHNI5I,7691
+numpy/core/records.py,sha256=lRf1TOQADJGp7eulX7bo1KoPT_yyZnyw88DdknZLmCE,36102
+numpy/core/setup.py,sha256=1f9SWx0yfvk3UXT36rCn6isXY9Wx1nvQ7oX67bMCEU8,42880
+numpy/core/setup_common.py,sha256=Ve-h7rFO27hhTnCxifVktJW_sqvWBIxSnWhy_s8xNvk,18842
+numpy/core/shape_base.py,sha256=rhq0DQ3HyqKU-0AUpzMj4e1vjZECbgDKhBTl-HnO6uc,29914
+numpy/core/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/core/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/core/tests/__pycache__/_locales.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test__exceptions.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_abc.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_api.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_arrayprint.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_conversion_utils.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_cpu_features.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_datetime.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_defchararray.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_deprecations.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_dtype.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_einsum.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_errstate.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_extint128.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_function_base.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_getlimits.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_half.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_indexerrors.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_indexing.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_item_selection.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_longdouble.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_machar.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_mem_overlap.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_memmap.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_multiarray.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_nditer.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_numeric.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_numerictypes.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_overrides.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_print.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_protocols.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_records.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalar_ctors.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalar_methods.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalarbuffer.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalarinherit.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalarmath.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_scalarprint.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_shape_base.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_ufunc.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_umath.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_umath_accuracy.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_umath_complex.cpython-36.pyc,,
+numpy/core/tests/__pycache__/test_unicode.cpython-36.pyc,,
+numpy/core/tests/_locales.py,sha256=PAV24baH5MIl_gH_VBi5glF-7kgifkK00WnAP0Hhc60,2266
+numpy/core/tests/data/astype_copy.pkl,sha256=lWSzCcvzRB_wpuRGj92spGIw-rNPFcd9hwJaRVvfWdk,716
+numpy/core/tests/data/recarray_from_file.fits,sha256=NA0kliz31FlLnYxv3ppzeruONqNYkuEvts5wzXEeIc4,8640
+numpy/core/tests/data/umath-validation-set-README,sha256=hhKRS9byn4eKEJ_LHoHDYQnVArbEXPIKQtPdPBUtGbk,974
+numpy/core/tests/data/umath-validation-set-cos,sha256=WO94BFik3VcliW2QBStw3Srpfd5Ykcxd-7phRf0be4Y,23898
+numpy/core/tests/data/umath-validation-set-exp,sha256=mPhjF4KLe0bdwx38SJiNipD24ntLI_5aWc8h-V0UMgM,17903
+numpy/core/tests/data/umath-validation-set-log,sha256=IZ4kRDJwxzbYkn4_LZOQjfwd9e0JhBpId9bO_GPVI84,4206
+numpy/core/tests/data/umath-validation-set-sin,sha256=0nDRTZc1YG_zbDgpGYtMrf63nUTc8bzcCwEVWqkBqio,23705
+numpy/core/tests/test__exceptions.py,sha256=uECjgxxlXjRnx-SM5D0B0l3fJswlNElw02so-kiYaJY,1537
+numpy/core/tests/test_abc.py,sha256=KbyIH9nsGOnXQ8VtnwU6QyUgaFDC0XfEs476CnJ_-Wg,2382
+numpy/core/tests/test_api.py,sha256=QQCMQeufRkkGeALg6fYjHB3N9UAK2GQk6uNUO2Pc4S4,21373
+numpy/core/tests/test_arrayprint.py,sha256=PJxiPzarHJSoHnytdF_ghVKsIFtz4ymSxkey7euNYfk,35379
+numpy/core/tests/test_conversion_utils.py,sha256=HbFAiYE4iAPhxGqeOG27EkvpyOyWWrRHrXn2sdaGcKQ,5137
+numpy/core/tests/test_cpu_features.py,sha256=wcKrzblzXmZxGg8gdtw1Vn3XAG3d0Kl7TW6Lz0oyprQ,6956
+numpy/core/tests/test_datetime.py,sha256=WnOTB0VpL790veIyxmqbGr-KF7Ko3kIweyP2MNL55Lg,110439
+numpy/core/tests/test_defchararray.py,sha256=GLf5I5-F3QAJIYPtx5etkRHKJF_64oF3DKAROOGRMUk,25048
+numpy/core/tests/test_deprecations.py,sha256=ucGAy5ZR7DLeO1GGf0hvWnCRXo8gLkLhMjI8SIltBWs,24807
+numpy/core/tests/test_dtype.py,sha256=Q9lPRfznS6q_gDSuXyVbx1rHduFWw8fcVKjDqgKoEEs,50584
+numpy/core/tests/test_einsum.py,sha256=dBV4BdaEL8xKmDVuQwx0Oxl0CtarbvmtFEJdZ7l8tfA,46220
+numpy/core/tests/test_errstate.py,sha256=kNCMfKs1xgXUrIRQM4qB8fEkVbREVE-p-yG2hsuHjd4,2125
+numpy/core/tests/test_extint128.py,sha256=b8vP_hDPltdHoxWBn2vAmOgjJe2NVW_vjnatdCOtxu8,5862
+numpy/core/tests/test_function_base.py,sha256=Fv0IC9YDjFKcs5JLlkUyvoPnbNQ-eg4Y1fFFisPNT9Q,13518
+numpy/core/tests/test_getlimits.py,sha256=m2xfs_MhozzD88pqRoD00GlMbA-biaK0tEMmBW0vt9g,4418
+numpy/core/tests/test_half.py,sha256=98ZvcBFSrx-2FNysp4Ucp04HTI5Z2c_IKf4cxs8KfMY,23641
+numpy/core/tests/test_indexerrors.py,sha256=iJu4EorQks1MmiwTV-fda-vd4HfCEwv9_Ba_rVea7xw,5263
+numpy/core/tests/test_indexing.py,sha256=iiGjKXvVPTNB23yAMBKdEru5BKPAIO8lhsI_hSHRz6A,50556
+numpy/core/tests/test_item_selection.py,sha256=8AukBkttHRVkRBujEDDSW0AN1i6FvRDeJO5Cot9teFc,3665
+numpy/core/tests/test_longdouble.py,sha256=0xWqtJdc-MUfxxZutfuI9W9d-hv_LouFb3355QU0UHE,13410
+numpy/core/tests/test_machar.py,sha256=o4LNEPRU2p0fzok8AiO2Y9vIoZUfWQvqMN2_rJqLoKE,1096
+numpy/core/tests/test_mem_overlap.py,sha256=Sc29ERD4HWExeUA43J96-4QBTkZS4dS_RUrb_DJLbwM,29781
+numpy/core/tests/test_memmap.py,sha256=OOjDnRVuzoDXZisxN9GEcaHbEnig2Tz1BDI8sHkmcCI,7677
+numpy/core/tests/test_multiarray.py,sha256=yjrWAufwd5YcVLbnygszn80R-IBZcaUejZRRz-voqOg,324552
+numpy/core/tests/test_nditer.py,sha256=ESJ1wYhzM4db6D61NMRgPbgO7a37TCMXy7li-xAfiZg,115165
+numpy/core/tests/test_numeric.py,sha256=cxilwORN8ix6BIpwfZyusKy0LQhqaYAOyjO38oPJCaA,127385
+numpy/core/tests/test_numerictypes.py,sha256=c-xwoz-oawJff09G0tri2Q9FJQ0NLkH3vf_zmwGnheg,21400
+numpy/core/tests/test_overrides.py,sha256=Ckqn-BSQ8XJFpW7JQiVOY88Cr7RRE13wMI_h2U51J4o,14860
+numpy/core/tests/test_print.py,sha256=I3-R4iNbFjmVdl5xHPb9ezYb4zDfdXNfzVZt3Lz3bqU,6937
+numpy/core/tests/test_protocols.py,sha256=Etu0M6T-xFJjAyXy2EcCH48Tbe5VRnZCySjMy0RhbPY,1212
+numpy/core/tests/test_records.py,sha256=bTHoTLdHm4uhKFHXpyJNwvD0Y1kAK-rFTEGM9p62aT0,20198
+numpy/core/tests/test_regression.py,sha256=GD2muSZ_J90Ol2U0ooBkQvxweDH9_c0TmBcIDPjx70A,91345
+numpy/core/tests/test_scalar_ctors.py,sha256=xcbdNEXczuwFkhOQDHyltIjzpCMU22BHOPZ8t7ulAPc,2661
+numpy/core/tests/test_scalar_methods.py,sha256=3uNPtYl73DJBLGQxJJ1df4cyr90A5Sp0pcRtXMVTjac,4166
+numpy/core/tests/test_scalarbuffer.py,sha256=oBS76DABJlqx38KU2CQ0u9-B5QWwf2y5Rb9p2TpNdAA,4184
+numpy/core/tests/test_scalarinherit.py,sha256=i_HSM5UmcTUMHovSSYskr8J_mBiQ5dHAMV7ENkVDSFw,2218
+numpy/core/tests/test_scalarmath.py,sha256=2JqJMdh0_naVEe2dbwhduGJRvh4XCTAlNDz6cJlp1Ag,29267
+numpy/core/tests/test_scalarprint.py,sha256=VmPnnhMyFScjwUjEknjt5oF1YXR43oESZSYDuqbo614,15480
+numpy/core/tests/test_shape_base.py,sha256=NCUG5rfgTrefEW1Pga627jXG7EhTkh65r65o7WPIuW8,25392
+numpy/core/tests/test_ufunc.py,sha256=OqHBvJNEUsJlCAED0-vt-Jnge1HdcTmdMgUjE6MltsE,86001
+numpy/core/tests/test_umath.py,sha256=Db8fWZjZUJJ1R1MsYKDSoPjLWNjQJEztwf1_Eg2oWmc,124504
+numpy/core/tests/test_umath_accuracy.py,sha256=_3N9e6662AmFLqIkyvTYFxeGL0HzM4lF4z2R00LnSoM,3103
+numpy/core/tests/test_umath_complex.py,sha256=3LEALcXvDSyzZY5HHmeQicoX84adtxbLerRib3grhLs,23755
+numpy/core/tests/test_unicode.py,sha256=c6SB-PZaiNH7HvEZ2xIrfAMPmvuJmcTo79aBBkdCFvY,12915
+numpy/core/umath.py,sha256=IE9whDRUf3FOx3hdo6bGB0X_4OOJn_Wk6ajnbrc542A,2076
+numpy/core/umath_tests.py,sha256=IuFDModusxI6j5Qk-VWYHRZDIE806dzvju0qYlvwmfY,402
+numpy/ctypeslib.py,sha256=LQDEFV54CRTKmyLV93iq1Fj4obQ_O-EXGUHtkwETNEA,17919
+numpy/distutils/__config__.py,sha256=m_FyVZ1o5OtbniChpVrUUGACZXBw03jS6Er12L02mnA,2988
+numpy/distutils/__init__.py,sha256=kuNMyZmAP8MtuKKOGG5pMz5wWcLVzHkU7wW7CTwzNxY,1610
+numpy/distutils/__pycache__/__config__.cpython-36.pyc,,
+numpy/distutils/__pycache__/__init__.cpython-36.pyc,,
+numpy/distutils/__pycache__/_shell_utils.cpython-36.pyc,,
+numpy/distutils/__pycache__/ccompiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/conv_template.cpython-36.pyc,,
+numpy/distutils/__pycache__/core.cpython-36.pyc,,
+numpy/distutils/__pycache__/cpuinfo.cpython-36.pyc,,
+numpy/distutils/__pycache__/exec_command.cpython-36.pyc,,
+numpy/distutils/__pycache__/extension.cpython-36.pyc,,
+numpy/distutils/__pycache__/from_template.cpython-36.pyc,,
+numpy/distutils/__pycache__/intelccompiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/lib2def.cpython-36.pyc,,
+numpy/distutils/__pycache__/line_endings.cpython-36.pyc,,
+numpy/distutils/__pycache__/log.cpython-36.pyc,,
+numpy/distutils/__pycache__/mingw32ccompiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/misc_util.cpython-36.pyc,,
+numpy/distutils/__pycache__/msvc9compiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/msvccompiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/npy_pkg_config.cpython-36.pyc,,
+numpy/distutils/__pycache__/numpy_distribution.cpython-36.pyc,,
+numpy/distutils/__pycache__/pathccompiler.cpython-36.pyc,,
+numpy/distutils/__pycache__/setup.cpython-36.pyc,,
+numpy/distutils/__pycache__/system_info.cpython-36.pyc,,
+numpy/distutils/__pycache__/unixccompiler.cpython-36.pyc,,
+numpy/distutils/_shell_utils.py,sha256=9pI0lXlRJxB22TPVBNUhWe7EnE-V6xIhMNQSR8LOw40,2704
+numpy/distutils/ccompiler.py,sha256=v1eLW6iXNZkyIyC_E-7zf0WbfWOalJHr59igzaP7otY,28157
+numpy/distutils/command/__init__.py,sha256=DCxnKqTLrauOD3Fc8b7qg9U3gV2k9SADevE_Q3H78ng,1073
+numpy/distutils/command/__pycache__/__init__.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/autodist.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/bdist_rpm.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build_clib.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build_ext.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build_py.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build_scripts.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/build_src.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/config.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/config_compiler.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/develop.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/egg_info.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/install.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/install_clib.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/install_data.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/install_headers.cpython-36.pyc,,
+numpy/distutils/command/__pycache__/sdist.cpython-36.pyc,,
+numpy/distutils/command/autodist.py,sha256=GbQMDUiPELkIlzKN5axNBsgaM_imGhEicqrzNlB-1hc,3146
+numpy/distutils/command/bdist_rpm.py,sha256=9uZfOzdHV0_PRUD8exNNwafc0qUqUjHuTDxQcZXLIbg,731
+numpy/distutils/command/build.py,sha256=ThE0Pxz8uFq13CGR_1rt4VKdzOE_zqF0XkEQM-S84dA,1422
+numpy/distutils/command/build_clib.py,sha256=WZpSbBopo31UzXckD27ZgZPlyGpEwHu-maaiBbgSU2g,14064
+numpy/distutils/command/build_ext.py,sha256=IdIIQ1Z_2VeZBTpB8k1cvTaqMKAInPAZHdn1gxVlonA,26932
+numpy/distutils/command/build_py.py,sha256=xBHZCtx91GqucanjIBETPeXmR-gyUKPDyr1iMx1ARWE,1175
+numpy/distutils/command/build_scripts.py,sha256=AEQLNmO2v5N-GXl4lwd8v_nHlrauBx9Y-UudDcdCs_A,1714
+numpy/distutils/command/build_src.py,sha256=TbN3yNLm_FafCLv2Dx0RHkvYzaPsF1UwPINe1TUepgI,31953
+numpy/distutils/command/config.py,sha256=YrhPHR6-au3ExsRRoJzpRA6Xb7TV76RKXjIzTikOj68,20822
+numpy/distutils/command/config_compiler.py,sha256=I-xAL3JxaGFfpR4lg7g0tDdA_t7zCt-D4JtOACCP_Ak,4495
+numpy/distutils/command/develop.py,sha256=5ro-Sudt8l58JpKvH9FauH6vIfYRv2ohHLz-9eHytbc,590
+numpy/distutils/command/egg_info.py,sha256=n6trbjRfD1qWc_hRtMFkOJsg82BCiLvdl-NeXyuceGc,946
+numpy/distutils/command/install.py,sha256=s_0Uf39tFoRLUBlkrRK4YlROZsLdkI-IsuiFFaiS3ls,3157
+numpy/distutils/command/install_clib.py,sha256=q3yrfJY9EBaxOIYUQoiu2-juNKLKAKKfXC0nrd4t6z0,1439
+numpy/distutils/command/install_data.py,sha256=r8EVbIaXyN3aOmRugT3kp_F4Z03PsVX2l_x4RjTOWU4,872
+numpy/distutils/command/install_headers.py,sha256=g5Ag2H3j3dz-qSwWegxiZSAnvAf0thYYFwfPVHf9rxc,944
+numpy/distutils/command/sdist.py,sha256=XQM39b-MMO08bfE3SJrrtDWwX0XVnzCZqfAoVuuaFuE,760
+numpy/distutils/conv_template.py,sha256=q60i2Jf0PlQGHmjr7pu5zwBUnoYiLhtfcdgV94uLSaw,9888
+numpy/distutils/core.py,sha256=baf9SXdCVV8fA0lhLpOV4yEEWQP4ZwMTeeWoXHMg9LE,8374
+numpy/distutils/cpuinfo.py,sha256=frzEtCIEsSbQzGmNUXdWctiFqRcNFeLurzbvyCh8thY,23340
+numpy/distutils/exec_command.py,sha256=xMR7Dou5VZp2cP23xNd2TlXqexppXzBUd1wLMEAD2is,10668
+numpy/distutils/extension.py,sha256=E6m-GBUisj8kWbZlKlQhe6UUQvZOQ6JBGS5eqaSU7lY,3463
+numpy/distutils/fcompiler/__init__.py,sha256=1yQCddgW9i1Muc4D6nnGuhCG5Z7tyA1nBJtd23K2jmA,41011
+numpy/distutils/fcompiler/__pycache__/__init__.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/absoft.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/compaq.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/environment.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/g95.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/gnu.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/hpux.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/ibm.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/intel.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/lahey.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/mips.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/nag.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/none.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/pathf95.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/pg.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/sun.cpython-36.pyc,,
+numpy/distutils/fcompiler/__pycache__/vast.cpython-36.pyc,,
+numpy/distutils/fcompiler/absoft.py,sha256=4UKxvpWQIphSdi6vJb3qILML_zyM3K_m7ddhAMS5dBI,5655
+numpy/distutils/fcompiler/compaq.py,sha256=nBN5tnyvvVDtiybSbSlvaPwo5LNZ9uXxs72plYU09No,4031
+numpy/distutils/fcompiler/environment.py,sha256=SxPO5epeUMvEpOhCO0EUY-wVk0I3111xjHjzQl7SOY0,3073
+numpy/distutils/fcompiler/g95.py,sha256=1TJe4IynWYqqYBy8gJ-nz8WQ_TaSbv8k2UzUIY5Erqc,1372
+numpy/distutils/fcompiler/gnu.py,sha256=HzDnrFe1ip0-aT-SMpA2xZSm6XhXTKr4fe25IFxA9Os,20946
+numpy/distutils/fcompiler/hpux.py,sha256=SLbDOPYgiixqE32GgUrAJjpDLFy9g7E01vGNZCGv6Pc,1394
+numpy/distutils/fcompiler/ibm.py,sha256=jL9fOpUU9g1Qx3wFqv34ow6LMq8TOSZ3EAwUb1bXs_c,3638
+numpy/distutils/fcompiler/intel.py,sha256=3nBmdhH8pRMyNZfkMU0MaJGkRxVQg3wh8AOduXCjRRs,7029
+numpy/distutils/fcompiler/lahey.py,sha256=EV3Zhwq-iowWAu4BFBPv_UGJ-IB-qxlxmi6WU1qHDOs,1372
+numpy/distutils/fcompiler/mips.py,sha256=mlUNgGrRSLnNhtxQXWVfC9l4_OP2GMvOkgbZQwBon0A,1768
+numpy/distutils/fcompiler/nag.py,sha256=3ViQnBrZBhgm-t-jvjZ_Hl_fq9s2O5FBMNwW6wOmU2Q,2624
+numpy/distutils/fcompiler/none.py,sha256=auMK2ou1WtJ20LeMbwCZJ3XofpT9A0YYbMVd-62Mi_E,786
+numpy/distutils/fcompiler/pathf95.py,sha256=ipbaZIO8sqPJ1lUppOurnboiTwRzIasWNAJvKmktvv4,1094
+numpy/distutils/fcompiler/pg.py,sha256=NWxCKSTxOaF4XjoXqgB27nETBakdcVouHsGrvJl1C7Y,3700
+numpy/distutils/fcompiler/sun.py,sha256=JMdFfKldTYlfW1DxV7nR09k5PZypKLWpP7wmQzmlnH0,1628
+numpy/distutils/fcompiler/vast.py,sha256=JUGP68JGOUOBS9WbXftE-qCVUD13fpLyPnhpHfTL5y0,1719
+numpy/distutils/from_template.py,sha256=lL0BhwJHz7OrMwocJnnUElgzv8vVkZdr6NupI1ZnsLw,8224
+numpy/distutils/intelccompiler.py,sha256=kVXrdCVY7YA6HdYI89De3Fy5lCjAwDpy2mrbpK7Lc10,4336
+numpy/distutils/lib2def.py,sha256=HQ7i5FUtBcFGNlSlN20lgVtiBAHQbGXxmYdvkaJTjLI,3760
+numpy/distutils/line_endings.py,sha256=hlI71r840mhfu8lmzdHPVZ4NFm-kJDDUMV3lETblVTY,2109
+numpy/distutils/log.py,sha256=9tqE2Tq55mugFj_pn-RwV1xFoejmk0yWvVQHBL1e-Gc,2652
+numpy/distutils/mingw/gfortran_vs2003_hack.c,sha256=FDTA53KYTIhil9ytvZlocOqghQVp9LacLHn1IurV0wI,83
+numpy/distutils/mingw32ccompiler.py,sha256=pFGoS_FeRjWac8iN8hCbQ9kH60JsYz6ZWXhp4n5tZbc,25885
+numpy/distutils/misc_util.py,sha256=-QbdJs-Xfp-56POmlg9SqdGXqJi22bGjeeJ8n2zm5vc,87812
+numpy/distutils/msvc9compiler.py,sha256=bCtCVJmGrBHPm9sOoxa3oSrdrEVCNQFEM5O5hdqX8Hc,2255
+numpy/distutils/msvccompiler.py,sha256=sGGkjB-iSQFEfsMfQY8ZJfPKs6vm2DY9Y_OKi0Fk__0,1986
+numpy/distutils/npy_pkg_config.py,sha256=4CMG6sN7HAFSmw2ljPAAN5f04wdnZECkFXZcKoX06f0,13409
+numpy/distutils/numpy_distribution.py,sha256=nrdp8rlyjEBBV1tzzi5cE-aYeXB5U3X8T5-G0akXSoY,651
+numpy/distutils/pathccompiler.py,sha256=a5CYDXilCaIC85v0fVh-wrb0fClv0A7mPS87aF1inUc,734
+numpy/distutils/setup.py,sha256=2chBhymbAMcc0ETIoYp_qzP6vBSJFrpbrBDm0TlU-zo,580
+numpy/distutils/system_info.py,sha256=cKqMhKe5CVj88zY4KAQF0k4ao04PEmfea_VdYBTtCyo,108331
+numpy/distutils/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/distutils/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_exec_command.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_fcompiler.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_fcompiler_gnu.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_fcompiler_intel.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_fcompiler_nagfor.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_from_template.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_mingw32ccompiler.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_misc_util.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_npy_pkg_config.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_shell_utils.cpython-36.pyc,,
+numpy/distutils/tests/__pycache__/test_system_info.cpython-36.pyc,,
+numpy/distutils/tests/test_exec_command.py,sha256=Ltd4T3A_t3Oo_QSYjOkWKqPj-LttXEumEVKhLxVfZEU,7515
+numpy/distutils/tests/test_fcompiler.py,sha256=SS5HOLIg0eqkmZTRKeWq9_ahW2tmV9c9piwYfzcBPmc,1320
+numpy/distutils/tests/test_fcompiler_gnu.py,sha256=RlRHZbyazgKGY17NmdYSF3ehO0M0xXN4UkbsJzJz4i8,2191
+numpy/distutils/tests/test_fcompiler_intel.py,sha256=4cppjLugoa8P4bjzYdiPxmyCywmP9plXOkfsklhnYsQ,1088
+numpy/distutils/tests/test_fcompiler_nagfor.py,sha256=ntyr8f-67dNI0OF_l6-aeTwu9wW-vnxpheqrc4cXAUI,1124
+numpy/distutils/tests/test_from_template.py,sha256=ZzUSEPyZIG4Zak3-TFqmRGXHMp58aKTuLKb0t-5XpDg,1147
+numpy/distutils/tests/test_mingw32ccompiler.py,sha256=7X8V4hLMtsNj1pYoLkSSla04gJu66e87E_k-6ce3PrA,1651
+numpy/distutils/tests/test_misc_util.py,sha256=YKK2WrJqVJ5o71mWL5oP0l-EVQmqKlf3XU8y7co0KYc,3300
+numpy/distutils/tests/test_npy_pkg_config.py,sha256=1pQh-mApHjj0y9Ba2tqns79U8dsfDpJ9zcPdsa2qbps,2641
+numpy/distutils/tests/test_shell_utils.py,sha256=okNSfjFSAvY3XyBsyZrKXAtV9RBmb7vX9o4ZLJc28Ds,2030
+numpy/distutils/tests/test_system_info.py,sha256=KcsvlajSjkqvtEDgEq_MsGVGF2cclzcXfkRQenbVFyg,9991
+numpy/distutils/unixccompiler.py,sha256=6p2pR21e47KTAMvQRaDQEeb4wStDNSyO5rJOQARXZJE,5137
+numpy/doc/__init__.py,sha256=llSbqjSXybPuXqt6WJFZhgYnscgYl4m1tUBy_LhfCE0,534
+numpy/doc/__pycache__/__init__.cpython-36.pyc,,
+numpy/doc/__pycache__/basics.cpython-36.pyc,,
+numpy/doc/__pycache__/broadcasting.cpython-36.pyc,,
+numpy/doc/__pycache__/byteswapping.cpython-36.pyc,,
+numpy/doc/__pycache__/constants.cpython-36.pyc,,
+numpy/doc/__pycache__/creation.cpython-36.pyc,,
+numpy/doc/__pycache__/dispatch.cpython-36.pyc,,
+numpy/doc/__pycache__/glossary.cpython-36.pyc,,
+numpy/doc/__pycache__/indexing.cpython-36.pyc,,
+numpy/doc/__pycache__/internals.cpython-36.pyc,,
+numpy/doc/__pycache__/misc.cpython-36.pyc,,
+numpy/doc/__pycache__/structured_arrays.cpython-36.pyc,,
+numpy/doc/__pycache__/subclassing.cpython-36.pyc,,
+numpy/doc/__pycache__/ufuncs.cpython-36.pyc,,
+numpy/doc/basics.py,sha256=RK_lYLxlQL-yXouYnt6osJqhhul7srGR9Sfjz0e8XqU,11528
+numpy/doc/broadcasting.py,sha256=ZFIrPh2daTyc-P5ifM6VCgwDrlZ5VoPjJqilPGaq5kw,5710
+numpy/doc/byteswapping.py,sha256=b64P25IpKME9NIQ03iFdBLxepP3GkaOCDqka_0SOqtM,5465
+numpy/doc/constants.py,sha256=3vbu3Nxy8_5JWc6k8-BIY16Q2Lb3CtG0_MuYluXs9W8,9648
+numpy/doc/creation.py,sha256=L2DulN_X_xBZd9vRZR2bPpFUZPLLDnlEcwYs09ba5dE,5574
+numpy/doc/dispatch.py,sha256=weKPXdjp9VJverQ2tFGIRTDXCxyoud8LO6kje3lHqKI,10284
+numpy/doc/glossary.py,sha256=7LHhzSyIvz-H78BrlbOot0lHYcBR20F4px6PSBkJpJU,15172
+numpy/doc/indexing.py,sha256=b1GwJEVkWK5vbiaRZY-PiECKsMZrYE61QYgRtVBnmrk,16698
+numpy/doc/internals.py,sha256=8dbWVbCl5xnOjeXeuIzupmoWvqeDhnlA9HPDj6EG4F4,9766
+numpy/doc/misc.py,sha256=rVDxNfefLqFbddFF_PJgo10-_Nu9tUFSzgGkjgnft_A,6352
+numpy/doc/structured_arrays.py,sha256=ybJN81Apnxu7xvwg80L0AneJclKWFuMYDj2e9dKUBEU,27094
+numpy/doc/subclassing.py,sha256=lHgTW_BXUUeZKzJWgu_UyYngiZuSf0_YfUCZDz_euXo,29294
+numpy/doc/ufuncs.py,sha256=jL-idm49Qd8xNns12ZPp533jorDuDnUN2I96hbmFZoo,5497
+numpy/dual.py,sha256=710T-mMGyFb22oATrtkiJozhhrbdAyBoBux4ADMbkZ4,1880
+numpy/f2py/__init__.py,sha256=2XyTg-Di000huAXaibNB6AnXhQart1umjscgy0aW8WI,3154
+numpy/f2py/__main__.py,sha256=XSvcMI54qWQiicJ51nRxK8L8PGzuUy3c2NGTVg1tzyk,89
+numpy/f2py/__pycache__/__init__.cpython-36.pyc,,
+numpy/f2py/__pycache__/__main__.cpython-36.pyc,,
+numpy/f2py/__pycache__/__version__.cpython-36.pyc,,
+numpy/f2py/__pycache__/auxfuncs.cpython-36.pyc,,
+numpy/f2py/__pycache__/capi_maps.cpython-36.pyc,,
+numpy/f2py/__pycache__/cb_rules.cpython-36.pyc,,
+numpy/f2py/__pycache__/cfuncs.cpython-36.pyc,,
+numpy/f2py/__pycache__/common_rules.cpython-36.pyc,,
+numpy/f2py/__pycache__/crackfortran.cpython-36.pyc,,
+numpy/f2py/__pycache__/diagnose.cpython-36.pyc,,
+numpy/f2py/__pycache__/f2py2e.cpython-36.pyc,,
+numpy/f2py/__pycache__/f2py_testing.cpython-36.pyc,,
+numpy/f2py/__pycache__/f90mod_rules.cpython-36.pyc,,
+numpy/f2py/__pycache__/func2subr.cpython-36.pyc,,
+numpy/f2py/__pycache__/rules.cpython-36.pyc,,
+numpy/f2py/__pycache__/setup.cpython-36.pyc,,
+numpy/f2py/__pycache__/use_rules.cpython-36.pyc,,
+numpy/f2py/__version__.py,sha256=N_m8jjlfteJqqS8jfRZQaJMGbiuulC4RyDX1BCqmDy8,196
+numpy/f2py/auxfuncs.py,sha256=UJE-OcD3gSFXVWaN-_IQ2zdlMFSmWWpbXwdY9vsjbIs,22605
+numpy/f2py/capi_maps.py,sha256=QmqD140JWMl62KQb3XxDht51F14nwWx3NaWNp4jXPQk,32297
+numpy/f2py/cb_rules.py,sha256=XNkMLl_EcSaPDy-NfPHMdjuDdFRKCr-91MOx1aNjhXY,23419
+numpy/f2py/cfuncs.py,sha256=R8KBoIHrQkBsDf0-haA5rjB21dhPzSbkpsjiK-NpSXQ,46497
+numpy/f2py/common_rules.py,sha256=W7rKmlCBJgcgs9U14Yyz79k4U5VgNxgOQV-WN4VrAQ0,5114
+numpy/f2py/crackfortran.py,sha256=PalQFk702YDQZ8rjryIPjMBlqkXrrLxSgRx8NcIFcwQ,132330
+numpy/f2py/diagnose.py,sha256=LmGu6iZKr9WHfMZFIIEobZvRJd9Ktdqx0nYekWk4N7g,5384
+numpy/f2py/f2py2e.py,sha256=9-fjOOzNI9n_-RxVWhNdjfwgGAwK0O0prApThbYqKKE,25044
+numpy/f2py/f2py_testing.py,sha256=vybOK-G_b0KYFNNZdhOCUf5pZExEdWfcIueIKODu024,1503
+numpy/f2py/f90mod_rules.py,sha256=umkXYf5Y6TrJ77DIZX0L0xemyFQ2sfe7M63f71A94hs,10017
+numpy/f2py/func2subr.py,sha256=LDVKbtAeejaCEuR4uQLp83XG0FZymf7xvis21afW74s,9456
+numpy/f2py/rules.py,sha256=kkM1clDIWBti1zz4FurwFHdzEKSuZBI2p33AftV1Z-g,59757
+numpy/f2py/setup.py,sha256=-vMbuIcSpp7g7K8KHDURjyBho8EALeKIGwWEbDA_poQ,2497
+numpy/f2py/src/fortranobject.c,sha256=xaUYHdjvYIhQhnfSU3jf0HBGmwB-lavgbQA4OvMFUoE,35754
+numpy/f2py/src/fortranobject.h,sha256=KFnSJVT4aGQb4akNw0PXVaq5CjMDT7baGV_DASli62E,4530
+numpy/f2py/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/f2py/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_array_from_pyobj.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_assumed_shape.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_block_docstring.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_callback.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_common.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_compile_function.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_crackfortran.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_kind.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_mixed.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_parameter.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_quoted_character.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_return_character.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_return_complex.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_return_integer.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_return_logical.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_return_real.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_semicolon_split.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_size.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/test_string.cpython-36.pyc,,
+numpy/f2py/tests/__pycache__/util.cpython-36.pyc,,
+numpy/f2py/tests/src/array_from_pyobj/wrapmodule.c,sha256=MieDOlG9d5iTanWmgKRI9kSydMckFKoY1g9FVWI3ODo,7697
+numpy/f2py/tests/src/assumed_shape/.f2py_f2cmap,sha256=zfuOShmuotzcLIQDnVFaARwvM66iLrOYzpquIGDbiKU,30
+numpy/f2py/tests/src/assumed_shape/foo_free.f90,sha256=fqbSr7VlKfVrBulFgQtQA9fQf0mQvVbLi94e4FTST3k,494
+numpy/f2py/tests/src/assumed_shape/foo_mod.f90,sha256=9pbi88-uSNP5IwS49Kim982jDAuopo3tpEhg2SOU7no,540
+numpy/f2py/tests/src/assumed_shape/foo_use.f90,sha256=9Cl1sdrihB8cCSsjoQGmOO8VRv9ni8Fjr0Aku1UdEWM,288
+numpy/f2py/tests/src/assumed_shape/precision.f90,sha256=3L_F7n5ju9F0nxw95uBUaPeuiDOw6uHvB580eIj7bqI,134
+numpy/f2py/tests/src/common/block.f,sha256=tcGKa42S-6bfA6fybpM0Su_xjysEVustkEJoF51o_pE,235
+numpy/f2py/tests/src/kind/foo.f90,sha256=6_zq3OAWsuNJ5ftGTQAEynkHy-MnuLgBXmMIgbvL7yU,367
+numpy/f2py/tests/src/mixed/foo.f,sha256=Zgn0xDhhzfas3HrzgVSxIL1lGEF2mFRVohrvXN1thU0,90
+numpy/f2py/tests/src/mixed/foo_fixed.f90,sha256=6eEEYCH71gPp6lZ6e2afLrfS6F_fdP7GZDbgGJJ_6ns,187
+numpy/f2py/tests/src/mixed/foo_free.f90,sha256=UC6iVRcm0-aVXAILE5jZhivoGQbKU-prqv59HTbxUJA,147
+numpy/f2py/tests/src/parameter/constant_both.f90,sha256=L0rG6-ClvHx7Qsch46BUXRi_oIEL0uw5dpRHdOUQuv0,1996
+numpy/f2py/tests/src/parameter/constant_compound.f90,sha256=lAT76HcXGMgr1NfKof-RIX3W2P_ik1PPqkRdJ6EyBmM,484
+numpy/f2py/tests/src/parameter/constant_integer.f90,sha256=42jROArrG7vIag9wFa_Rr5DBnnNvGsrEUgpPU14vfIo,634
+numpy/f2py/tests/src/parameter/constant_non_compound.f90,sha256=u9MRf894Cw0MVlSOUbMSnFSHP4Icz7RBO21QfMkIl-Q,632
+numpy/f2py/tests/src/parameter/constant_real.f90,sha256=QoPgKiHWrwI7w5ctYZugXWzaQsqSfGMO7Jskbg4CLTc,633
+numpy/f2py/tests/src/regression/inout.f90,sha256=TlMxJjhjjiuLI--Tg2LshLnbfZpiKz37EpR_tPKKSx8,286
+numpy/f2py/tests/src/size/foo.f90,sha256=nK_767f1TtqVr-dMalNkXmcKbSbLCiabhRkxSDCzLz0,859
+numpy/f2py/tests/src/string/char.f90,sha256=X_soOEV8cKsVZefi3iLT7ilHljjvJJ_i9VEHWOt0T9Y,647
+numpy/f2py/tests/test_array_from_pyobj.py,sha256=3rASd81apCvTWbWR0yA6OVW7ZXjK1Qi7l2vDFb5OUC4,22556
+numpy/f2py/tests/test_assumed_shape.py,sha256=TDLfEzJc7tlfiqFzmonD8LO85PXySgJ4JE_5IZTzinA,1637
+numpy/f2py/tests/test_block_docstring.py,sha256=pC00xi0ycn1Kpbo_F92yM2QzFMnrPAsZ7-qpZeQNyCs,644
+numpy/f2py/tests/test_callback.py,sha256=LEHeQaKPf1E5_qdF0zAWE5L2hMbEv6FvYve46hc7WRw,4150
+numpy/f2py/tests/test_common.py,sha256=tRwTdz6aQ0RYREFC-T-SfEyq25wWYo5pknVAqvvvBjM,827
+numpy/f2py/tests/test_compile_function.py,sha256=d2zOi1oPKwqSMBILFSUuJeIX3BY6uAOBZnvYw5h3K54,4434
+numpy/f2py/tests/test_crackfortran.py,sha256=EzSfkWzFM7Kf6fNXZYuplp83KtRegEbP0umoHaPOmQY,2885
+numpy/f2py/tests/test_kind.py,sha256=eH_sM5X5wIwe3T9yVMH6DH8I4spsgRaeIork_FJG-8Q,1044
+numpy/f2py/tests/test_mixed.py,sha256=faYM1laPKwStbz-RY-6b9LCuj2kFojTPIR0wxsosXoI,946
+numpy/f2py/tests/test_parameter.py,sha256=S1K9K9Uj5dWjmWF8euBUMJdGilIqn1nNH2FftcS1INU,4026
+numpy/f2py/tests/test_quoted_character.py,sha256=81CR1ZIyKygz7noFJMcgaLdg18nY8zcFfrSN2L_U9xg,959
+numpy/f2py/tests/test_regression.py,sha256=DLPJGoDz78obYsXxx3ZXnS5YkkAG9ybCiyzGtt-92dI,725
+numpy/f2py/tests/test_return_character.py,sha256=bpuHEjBj53YpvsI_aLQOcSVdoGAEtgtmAK8kbHKdcgc,4064
+numpy/f2py/tests/test_return_complex.py,sha256=jYcoM3pZj0opGXXF69EsGQ6HD5SPaRhBeGx3RhnJx8c,4778
+numpy/f2py/tests/test_return_integer.py,sha256=MpdNZLxeQwER4M4w5utHYe08gDzrjAWOq_z5wRO8hP8,4751
+numpy/f2py/tests/test_return_logical.py,sha256=uP9rWNyA3UARKwaQ6Fsc8grh72G5xnp9XXFSWLdPZQ8,5028
+numpy/f2py/tests/test_return_real.py,sha256=05OwUsgmI_G_pr197xUXgIgTNVOHygtY2kPqRiexeSY,5605
+numpy/f2py/tests/test_semicolon_split.py,sha256=Ap6S5tGL6R8I2i9iUlVxElW4IMNoz0LxIHK1hLIYZhQ,1577
+numpy/f2py/tests/test_size.py,sha256=ukbP0NlzqpfD6M_K58WK6IERSXc_6nHpyUqbYfEbk8M,1335
+numpy/f2py/tests/test_string.py,sha256=w2GiZmdwNAaWOBhak9IuUnnVktMhUq_Y0ajI0SX9YNY,632
+numpy/f2py/tests/util.py,sha256=rXqfB6384TeBl0KLNnUc80tnn1Hp1E2LXUVb-_qH4_Y,9974
+numpy/f2py/use_rules.py,sha256=ROzvjl0-GUOkT3kJS5KkYq8PsFxGjebA6uPq9-CyZEQ,3700
+numpy/fft/__init__.py,sha256=iRvj7AexTBPHlGP1wXYdTQJU9n0aD4OvJaefStBSVNg,7720
+numpy/fft/__pycache__/__init__.cpython-36.pyc,,
+numpy/fft/__pycache__/_pocketfft.cpython-36.pyc,,
+numpy/fft/__pycache__/helper.cpython-36.pyc,,
+numpy/fft/__pycache__/setup.cpython-36.pyc,,
+numpy/fft/_pocketfft.py,sha256=J4BSwSlZXAJKdCl8FraMeemhoBJFOjLuDro60beA5tI,49029
+numpy/fft/_pocketfft_internal.cp36-win32.pyd,sha256=SJtNqk7UpIdbH6eq5jg_yQ9xvqS8GqKHJ56OB2mrZw8,75776
+numpy/fft/helper.py,sha256=yhM2U72L2BT4oIGAtHaEcSeasYTUsLh_vv0GA-NUFcg,6427
+numpy/fft/setup.py,sha256=GDFeFVDjNw4u-WoVGirHU2t3eswgYsSpJNguhbRzv3Q,714
+numpy/fft/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/fft/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/fft/tests/__pycache__/test_helper.cpython-36.pyc,,
+numpy/fft/tests/__pycache__/test_pocketfft.cpython-36.pyc,,
+numpy/fft/tests/test_helper.py,sha256=OMUhUqJacTOD1CWIFZ3w4HOWHOQZxdLGnWqOt3mnACM,6383
+numpy/fft/tests/test_pocketfft.py,sha256=LZCkx-aIrDqGjxK8CJIl7VGT5-EDQs0kAS7895a1374,9878
+numpy/lib/__init__.py,sha256=2Arwvv9UMENY_nqvqVxuGrrEM2nwP3tP9HLMOuBb8dE,1896
+numpy/lib/__pycache__/__init__.cpython-36.pyc,,
+numpy/lib/__pycache__/_datasource.cpython-36.pyc,,
+numpy/lib/__pycache__/_iotools.cpython-36.pyc,,
+numpy/lib/__pycache__/_version.cpython-36.pyc,,
+numpy/lib/__pycache__/arraypad.cpython-36.pyc,,
+numpy/lib/__pycache__/arraysetops.cpython-36.pyc,,
+numpy/lib/__pycache__/arrayterator.cpython-36.pyc,,
+numpy/lib/__pycache__/financial.cpython-36.pyc,,
+numpy/lib/__pycache__/format.cpython-36.pyc,,
+numpy/lib/__pycache__/function_base.cpython-36.pyc,,
+numpy/lib/__pycache__/histograms.cpython-36.pyc,,
+numpy/lib/__pycache__/index_tricks.cpython-36.pyc,,
+numpy/lib/__pycache__/mixins.cpython-36.pyc,,
+numpy/lib/__pycache__/nanfunctions.cpython-36.pyc,,
+numpy/lib/__pycache__/npyio.cpython-36.pyc,,
+numpy/lib/__pycache__/polynomial.cpython-36.pyc,,
+numpy/lib/__pycache__/recfunctions.cpython-36.pyc,,
+numpy/lib/__pycache__/scimath.cpython-36.pyc,,
+numpy/lib/__pycache__/setup.cpython-36.pyc,,
+numpy/lib/__pycache__/shape_base.cpython-36.pyc,,
+numpy/lib/__pycache__/stride_tricks.cpython-36.pyc,,
+numpy/lib/__pycache__/twodim_base.cpython-36.pyc,,
+numpy/lib/__pycache__/type_check.cpython-36.pyc,,
+numpy/lib/__pycache__/ufunclike.cpython-36.pyc,,
+numpy/lib/__pycache__/user_array.cpython-36.pyc,,
+numpy/lib/__pycache__/utils.cpython-36.pyc,,
+numpy/lib/_datasource.py,sha256=rnLi18WlhoE-9NppspLiIMHH9-RjqXdWTvWnon9xfhk,23498
+numpy/lib/_iotools.py,sha256=EaK3oBNDchHXyVndxxfkk5XTSpCIXs1KqlRc2_-daaQ,31807
+numpy/lib/_version.py,sha256=syCq5PJX3QCmhjIR4nO1HG2YWPTarArAR-7m8dv93gk,5010
+numpy/lib/arraypad.py,sha256=Iw9RVTXfPxAj9_Qr7kalJzBAdl8OshwvA8Oc4aHLjuw,32200
+numpy/lib/arraysetops.py,sha256=w6b5zdv7cnd5GaEocAVKTwuz7jgpKD8nQ2PMBtti9zE,25702
+numpy/lib/arrayterator.py,sha256=29pO5S0ciEZwt1402Q0-5cRbyKspV4tlPX1-m_D_Hgc,7282
+numpy/lib/financial.py,sha256=4jSobkUZyuZpXbLKYu0qpSWMCxhFovO_RmGEHV0HNjA,32490
+numpy/lib/format.py,sha256=RBTmNV-XYeSWKMhl_UZhgvdzZkWghhsAImyRcOOWR5Y,31958
+numpy/lib/function_base.py,sha256=Q_IOu9VaR3w_aZ8GOmFTmTGXCwoCWT0cuL4nzOf5vjo,160085
+numpy/lib/histograms.py,sha256=sJNjLvJLQCmPTIlwMsrtOmFK2SxxyQn6-9gmBBsQa14,41261
+numpy/lib/index_tricks.py,sha256=RrqkEi_5UxD8B_bcGJD0d7CVguCncEfgHhKioptpVT8,30622
+numpy/lib/mixins.py,sha256=BFWJiMFWohFHtTQH27hg5dpUqWj31VM2rMOPfUik1VY,7216
+numpy/lib/nanfunctions.py,sha256=tnDGArTWr5jojoFCOEAvfY9qfi7SIdMUsaobb4IZKEo,60559
+numpy/lib/npyio.py,sha256=k_zYKifTQsEPujEi6aJaGlXGTziHQGhYF_WaNrPbh2k,89911
+numpy/lib/polynomial.py,sha256=_srQxiw9BiaWJy-5Cj__o7vnd75lltPiSW5BZeY9M-0,42058
+numpy/lib/recfunctions.py,sha256=zFN5AwXUbMsR9Srva-2eFOTjyrVJkMHy3f_mJTGe2R8,58119
+numpy/lib/scimath.py,sha256=XQNQVHKZTK__ED9_meUQmRx7m_vzNbPvgugNo0Jii68,15324
+numpy/lib/setup.py,sha256=svb3fz5-yXB2M9YEnKZD2LgVgAxrQeHLXGMXVvRmE8E,381
+numpy/lib/shape_base.py,sha256=Mf0115HklQKM0IqRR57hC7PjPoQIKPLN-Uc5NheJJLw,39624
+numpy/lib/stride_tricks.py,sha256=3oMkGhDksyM4n-AC6e39JxB-oHET_IJAshIo70yv9zA,9289
+numpy/lib/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/lib/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test__datasource.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test__iotools.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test__version.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_arraypad.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_arraysetops.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_arrayterator.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_financial.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_format.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_function_base.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_histograms.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_index_tricks.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_io.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_mixins.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_nanfunctions.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_packbits.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_polynomial.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_recfunctions.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_shape_base.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_stride_tricks.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_twodim_base.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_type_check.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_ufunclike.cpython-36.pyc,,
+numpy/lib/tests/__pycache__/test_utils.cpython-36.pyc,,
+numpy/lib/tests/data/py2-objarr.npy,sha256=F4cyUC-_TB9QSFLAo2c7c44rC6NUYIgrfGx9PqWPSKk,258
+numpy/lib/tests/data/py2-objarr.npz,sha256=xo13HBT0FbFZ2qvZz0LWGDb3SuQASSaXh7rKfVcJjx4,366
+numpy/lib/tests/data/py3-objarr.npy,sha256=pTTVh8ezp-lwAK3fkgvdKU8Arp5NMKznVD-M6Ex_uA0,341
+numpy/lib/tests/data/py3-objarr.npz,sha256=qQR0gS57e9ta16d_vCQjaaKM74gPdlwCPkp55P-qrdw,449
+numpy/lib/tests/data/python3.npy,sha256=X0ad3hAaLGXig9LtSHAo-BgOvLlFfPYMnZuVIxRmj-0,96
+numpy/lib/tests/data/win64python2.npy,sha256=agOcgHVYFJrV-nrRJDbGnUnF4ZTPYXuSeF-Mtg7GMpc,96
+numpy/lib/tests/test__datasource.py,sha256=OYm6qsPy7Q8yXV_5GfSMMNQKon4izf_T9ULaqjHLJA4,10837
+numpy/lib/tests/test__iotools.py,sha256=q44VFSi9VzWaf_dJ-MGBtYA7z7TFR0j0AF-rbzhLXoo,14096
+numpy/lib/tests/test__version.py,sha256=WwCOmobk2UN6Hlp93bXsd7RR1UmjJlE4r9ol8d87ctg,2053
+numpy/lib/tests/test_arraypad.py,sha256=ZoqM25xb5iI_K6ampX5cov2zFUwQZ8i0Xu3gY_ncdk0,55647
+numpy/lib/tests/test_arraysetops.py,sha256=QHZSJOGcpV42HakwDUSYjVQu6JpZgOpkTuT50ywBGKs,24981
+numpy/lib/tests/test_arrayterator.py,sha256=IRVmzxbr9idboJjOHKuX_8NQhMAKs7pD1xWqmU3ZERw,1337
+numpy/lib/tests/test_financial.py,sha256=E-3H8s40B5LCYcgdp4GZp-bBzm-_mY1lMcaSLIz-mc0,18696
+numpy/lib/tests/test_format.py,sha256=f7lykKehFvu_kIcAJ52C4EdUjWctQb6iiaRNhpVDFq4,39526
+numpy/lib/tests/test_function_base.py,sha256=97YJdiYpF8Cs2SkaL1BYWghctCeHDRvJ-ntK8lapJt4,129544
+numpy/lib/tests/test_histograms.py,sha256=_uKM8dtMWCwGtIgIwog3s3jyPb8w804TWqy9iOkYeSI,34510
+numpy/lib/tests/test_index_tricks.py,sha256=vrTcZnpAus3-9l3TtWcNTTKRPBI9Fx74xDcBO3w4QMg,18822
+numpy/lib/tests/test_io.py,sha256=WqGKE1WAcEpb2OL4Z6Q9HgAsR-b-ruYjer0nBDR_zbg,103502
+numpy/lib/tests/test_mixins.py,sha256=nIec_DZIDx7ONnlpq_Y2TLkIULAPvQ7LPqtMwEHuV4U,7246
+numpy/lib/tests/test_nanfunctions.py,sha256=KJbcTS5ylvlSoRBBE4Qqk60pYlRGYEoJ1hSB_ydZTbk,39065
+numpy/lib/tests/test_packbits.py,sha256=XpFIaL8mOWfzD3WQaxd6WrDFWh4Mc51EPXIOqxt3wS0,17922
+numpy/lib/tests/test_polynomial.py,sha256=cCNRkN_BR03F0RWZ0XFcXhjCDdaJxaWLZc6qgD-2z_Y,10272
+numpy/lib/tests/test_recfunctions.py,sha256=f9J49n_8ot0zG0Bw4XXFx3l1XN2VeAu9ROgn0dV4GLY,42134
+numpy/lib/tests/test_regression.py,sha256=NXKpFka0DPE7z0-DID-FGh0ITFXi8nEj6Pg_-uBcDIg,8504
+numpy/lib/tests/test_shape_base.py,sha256=kC4k86CdiwUoqBs_KjAc_JekFJLVtlbanlPrXXXpWRU,25020
+numpy/lib/tests/test_stride_tricks.py,sha256=Iy5tIhmM7-zIQHMfLacDnG9tvZ0l5IXy5uSCVpsGgV4,17433
+numpy/lib/tests/test_twodim_base.py,sha256=USISKs6mDYgEl20k4_k899_pWSkFjZkPkafA_BUQxng,18890
+numpy/lib/tests/test_type_check.py,sha256=ffuA-ndaMsUb0IvPalBMwGkoukIP9OZVJXCuq299qB8,15597
+numpy/lib/tests/test_ufunclike.py,sha256=rpZTDbKPBVg5-byY1SKhkukyxB2Lvonw15ZARPE3mc0,3382
+numpy/lib/tests/test_utils.py,sha256=dG7eDTkCWTUQtTGGKK1R3acRtGuPeAAqHvw9SEQfj-g,3911
+numpy/lib/twodim_base.py,sha256=exuILTWzUB-o3xX_3TefU7A8qUqcCtkwXZS2RRE9YHs,28572
+numpy/lib/type_check.py,sha256=WK5a3RgaIVoKqskfvG-U6VHiZyMNrfswV-9SBb5RxbU,20500
+numpy/lib/ufunclike.py,sha256=D6NgciDjA0ETqfzX9lDzuArgPOWccl3-nws48_IMwYo,8211
+numpy/lib/user_array.py,sha256=5yqkyjCmUIASGNx2bt7_ZMWJQJszkbD1Kn06qqv7POA,8007
+numpy/lib/utils.py,sha256=6MwIC6RCKLnM7SQMVNC03-TxgmQcXjTqFrh1DiNCxS4,33643
+numpy/linalg/__init__.py,sha256=nziJvIBC-t0x_9SjOrlgcorUR03gdviaCWhbvvPIT7s,1836
+numpy/linalg/__pycache__/__init__.cpython-36.pyc,,
+numpy/linalg/__pycache__/linalg.cpython-36.pyc,,
+numpy/linalg/__pycache__/setup.cpython-36.pyc,,
+numpy/linalg/_umath_linalg.cp36-win32.pyd,sha256=40XJCHrYAczYTB0b2731rcMeFXNOZrGvgkLM_Q-gaIc,129536
+numpy/linalg/lapack_lite.cp36-win32.pyd,sha256=iQ4MgV86pBp_gf2QeZNqI-AKiFRqIIoWNjWt_A8DwMg,15360
+numpy/linalg/linalg.py,sha256=yYpGO5bVH-YAIiv8DAqsURla4dqieDvaAZpDcpxWhNM,92341
+numpy/linalg/setup.py,sha256=-a8_WfO7pY1QGFkUj5kW5svaTWC8VdnOgi-8EFB0Vhw,2867
+numpy/linalg/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/linalg/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/linalg/tests/__pycache__/test_build.cpython-36.pyc,,
+numpy/linalg/tests/__pycache__/test_deprecations.cpython-36.pyc,,
+numpy/linalg/tests/__pycache__/test_linalg.cpython-36.pyc,,
+numpy/linalg/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/linalg/tests/test_build.py,sha256=o1l1ojThBlvC-qbshrYF7dx7WEnhb2G2z_ij8wGCGUc,1675
+numpy/linalg/tests/test_deprecations.py,sha256=GaeE3JnQlJLoAfbY93LmgCFUlV5M8IFmQ7EhF4WbqwU,660
+numpy/linalg/tests/test_linalg.py,sha256=Etz-gCqEwABmLdA3ffVEUIz2JFaGCBLL_AylmA-uFAQ,76456
+numpy/linalg/tests/test_regression.py,sha256=T0iQkRUhOoxIHHro5kyxU7GFRhN3pZov6UaJGXxtvu0,5745
+numpy/ma/__init__.py,sha256=9i-au2uOZ_K9q2t9Ezc9nEAS74Y4TXQZMoP9601UitU,1458
+numpy/ma/__pycache__/__init__.cpython-36.pyc,,
+numpy/ma/__pycache__/bench.cpython-36.pyc,,
+numpy/ma/__pycache__/core.cpython-36.pyc,,
+numpy/ma/__pycache__/extras.cpython-36.pyc,,
+numpy/ma/__pycache__/mrecords.cpython-36.pyc,,
+numpy/ma/__pycache__/setup.cpython-36.pyc,,
+numpy/ma/__pycache__/testutils.cpython-36.pyc,,
+numpy/ma/__pycache__/timer_comparison.cpython-36.pyc,,
+numpy/ma/bench.py,sha256=rh3pV-_6827crLjXHvdaazROh0w0K7Ix9De0eYm67O4,5024
+numpy/ma/core.py,sha256=hkViazvE3HMaqFf5X_wT1dz0sedx7vggl-la5aUDZbU,272211
+numpy/ma/extras.py,sha256=qeH3Cny4g_OD2I_ujBZkzO7FO7Nsbe6wIuvAhZAE64U,60506
+numpy/ma/mrecords.py,sha256=yjug9UKe08ahEA24ahyghGs59JExnNlNu5FGgdfYNuI,27457
+numpy/ma/setup.py,sha256=tgbpGMWeWAYKxpVx7XLeB5SuZtR6wqVPppBzSadXNw8,394
+numpy/ma/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/ma/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_core.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_deprecations.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_extras.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_mrecords.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_old_ma.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/ma/tests/__pycache__/test_subclassing.cpython-36.pyc,,
+numpy/ma/tests/test_core.py,sha256=y3ULcaJjf_yhsTg_NyKGWj1GBXmBIzjTEw8XOPH6Txw,204449
+numpy/ma/tests/test_deprecations.py,sha256=Dv-fqcxKJ_tfxyk-DyK2rA5onOl-7YC06Pu9nkvECt0,2326
+numpy/ma/tests/test_extras.py,sha256=_uTlvEtwEcLyYw3dS657rlP3nUz2p697aspFW9kze48,68630
+numpy/ma/tests/test_mrecords.py,sha256=KeUfhLLwjwhX-Wh1UvViiFdOO3JFj44BQDtiC4ZZUrE,20363
+numpy/ma/tests/test_old_ma.py,sha256=_B_ysTXBqbxueyUBJPjwZeGsA-XaX6pU8mwCEjXrmro,33141
+numpy/ma/tests/test_regression.py,sha256=Hi-p5QdcivsxUDSpTl3MGtAnmJCJPhhIj3c5nYI9rw8,3170
+numpy/ma/tests/test_subclassing.py,sha256=z8LhDLqKN5ybMJ4FkFBgpFwy0OatsJ_yyCU1t5oU4Lg,13210
+numpy/ma/testutils.py,sha256=Y7Ie5QSy8OL9AJFC0w1fwdzkcJ5ATPwDX1r7vxW8r2Q,10587
+numpy/ma/timer_comparison.py,sha256=y5GWEwwbcWzO0I-TJGuOnW4brcEng8Y-gOwU5cut8-w,15911
+numpy/matlib.py,sha256=l-292Lvk_yUCK5Y_U9u1Xa8grW8Ss0uh23o8kj-Hhd8,10741
+numpy/matrixlib/__init__.py,sha256=OYwN1yrpX0doHcXpzdRm2moAUO8BCmgufnmd6DS43pI,228
+numpy/matrixlib/__pycache__/__init__.cpython-36.pyc,,
+numpy/matrixlib/__pycache__/defmatrix.cpython-36.pyc,,
+numpy/matrixlib/__pycache__/setup.cpython-36.pyc,,
+numpy/matrixlib/defmatrix.py,sha256=BE_0FL7Ie8rJETxL1Y0l1hx6ksYDwCwznR460GqPMG8,31784
+numpy/matrixlib/setup.py,sha256=HJpLLVYLjzOIZI1FYyA3sFpwhLN-ErouMRObooQKhxw,402
+numpy/matrixlib/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/matrixlib/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_defmatrix.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_interaction.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_masked_matrix.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_matrix_linalg.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_multiarray.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_numeric.cpython-36.pyc,,
+numpy/matrixlib/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/matrixlib/tests/test_defmatrix.py,sha256=nbY_HkwzoJbhYhACiEN-cZmR644sVJvMKWUcsANPayQ,15435
+numpy/matrixlib/tests/test_interaction.py,sha256=C1YtIubO6Qh8RR-XONzo8Mle4bu4SvwsvBnB0x0Gy4g,12229
+numpy/matrixlib/tests/test_masked_matrix.py,sha256=OyFkczRm-f51EQpP7TLlohU0bVKky0TwWtRXVJNfp_w,9064
+numpy/matrixlib/tests/test_matrix_linalg.py,sha256=9S9Zrk8PMLfEEo9wBx5LyrV_TbXhI6r-Hc5t594lQFY,2152
+numpy/matrixlib/tests/test_multiarray.py,sha256=E5jvWX9ypWYNHH7iqAW3xz3tMrEV-oNgjN3_oPzZzws,570
+numpy/matrixlib/tests/test_numeric.py,sha256=l-LFBKPoP3_O1iea23MmaACBLx_tSSdPcUBBRTiTbzk,458
+numpy/matrixlib/tests/test_regression.py,sha256=FgYV3hwkpO0qyshDzG7n1JfQ-kKwnSZnA68jJHS7TeM,958
+numpy/polynomial/__init__.py,sha256=cUci1M9bDomn34_LiOALHXH8lqEByVxAWguPSnk2QAI,1093
+numpy/polynomial/__pycache__/__init__.cpython-36.pyc,,
+numpy/polynomial/__pycache__/_polybase.cpython-36.pyc,,
+numpy/polynomial/__pycache__/chebyshev.cpython-36.pyc,,
+numpy/polynomial/__pycache__/hermite.cpython-36.pyc,,
+numpy/polynomial/__pycache__/hermite_e.cpython-36.pyc,,
+numpy/polynomial/__pycache__/laguerre.cpython-36.pyc,,
+numpy/polynomial/__pycache__/legendre.cpython-36.pyc,,
+numpy/polynomial/__pycache__/polynomial.cpython-36.pyc,,
+numpy/polynomial/__pycache__/polyutils.cpython-36.pyc,,
+numpy/polynomial/__pycache__/setup.cpython-36.pyc,,
+numpy/polynomial/_polybase.py,sha256=jI7psP2tZbCM6L3T0MPlAmRGqRyXm9DV-HqBy8JZfig,33696
+numpy/polynomial/chebyshev.py,sha256=75P-NmV2bxIfilKRfwWkODJVs1_b728W8I-Z7kR7O-0,63842
+numpy/polynomial/hermite.py,sha256=DdTYeQf8tWBNPzTNrQ9xOcbEvfMz1SUDwXDx-lFaEew,53202
+numpy/polynomial/hermite_e.py,sha256=nb-YuodJCOkQeQ-4AZY6LVMWhcVwb30xXmKvu7W3Qm0,53333
+numpy/polynomial/laguerre.py,sha256=Tq1lylYS4cnHDRlUqldhBmoieEZttmXpLrSzUe7HLcQ,51522
+numpy/polynomial/legendre.py,sha256=zbd2yX-WctRalgsV5_5ayMbuiPZw9rMVbmx7LerE37E,52264
+numpy/polynomial/polynomial.py,sha256=JnYJzwsFhImXElFde5YbU6pnkXLBs1o5JFd3m7SvEaQ,49216
+numpy/polynomial/polyutils.py,sha256=O8_quxmbGWKnp8q3TjeJ84AdKCo5nxObrH_Ssqzw_1U,23936
+numpy/polynomial/setup.py,sha256=VNnC5cPwh8LAejwtCEWrcFFDA8mrTu9jzZfobmDUhx4,347
+numpy/polynomial/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/polynomial/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_chebyshev.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_classes.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_hermite.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_hermite_e.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_laguerre.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_legendre.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_polynomial.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_polyutils.cpython-36.pyc,,
+numpy/polynomial/tests/__pycache__/test_printing.cpython-36.pyc,,
+numpy/polynomial/tests/test_chebyshev.py,sha256=PI2XwvGGqQKEB1RxbsYRgeTG0cunB_8Otd9SBJozq-8,21141
+numpy/polynomial/tests/test_classes.py,sha256=J6abNzhFKwaagzv_x53xN0whCfr5nMwqZ---Jrd9oxY,18931
+numpy/polynomial/tests/test_hermite.py,sha256=zGYN24ia2xx4IH16D6sfAxIipnZrGrIe7D8QMJZPw4Y,19132
+numpy/polynomial/tests/test_hermite_e.py,sha256=5ZBtGi2gkeldYVSh8xlQOLUDW6fcT4YdZiTrB6AaGJU,19467
+numpy/polynomial/tests/test_laguerre.py,sha256=hBgo8w_3iEQosX2CqjTkUstTiuTPLZmfQNQtyKudZLo,18048
+numpy/polynomial/tests/test_legendre.py,sha256=mJcXkot3E2uhcIZY-Bvb3EfWbOo601NG_gq0OwObuNk,18831
+numpy/polynomial/tests/test_polynomial.py,sha256=BHR8Cy7nhcxdsgrhEwyPRdswgQhDRZmnaoT9gb5O1VU,20628
+numpy/polynomial/tests/test_polyutils.py,sha256=F9Tghiw2LM1wqEHFHxCuFAR9rueLe-i-dakoEvsLgJE,3105
+numpy/polynomial/tests/test_printing.py,sha256=5BSqFlP3B00Q7hSxQOSTtk_VvKpueFoW2Q4MRho5ACM,4049
+numpy/random/__init__.pxd,sha256=g3EaMi3yfmnqT-KEWj0cp6SWIxVN9ChFjEYXGOfOifE,445
+numpy/random/__init__.py,sha256=rYnpCdx2jY6FC1tn4ev_5SekdgjT_xgl5X0dinpzLj4,7673
+numpy/random/__pycache__/__init__.cpython-36.pyc,,
+numpy/random/__pycache__/_pickle.cpython-36.pyc,,
+numpy/random/__pycache__/setup.cpython-36.pyc,,
+numpy/random/_bounded_integers.cp36-win32.pyd,sha256=l9OqvAjW3Nq7VSwtjcWgCAiwr--rlTshPMiQ4LOjnp4,230912
+numpy/random/_bounded_integers.pxd,sha256=ugYlh8FvGggHCjEaqgO4S_MeRcZg3mw40sDYEqx07QQ,1698
+numpy/random/_common.cp36-win32.pyd,sha256=BfxWwNZz47F-2zSlsp_nQAWfC9eHDDoX_IBbNYh1wXA,162816
+numpy/random/_common.pxd,sha256=N2NZYlMYNh7FzFbJ6Mr2DH3MkrG67HUwqOu-XX_ouAA,4855
+numpy/random/_examples/cffi/__pycache__/extending.cpython-36.pyc,,
+numpy/random/_examples/cffi/__pycache__/parse.cpython-36.pyc,,
+numpy/random/_examples/cffi/extending.py,sha256=BgydYEYBb6hDghMF-KQFVc8ssUU1F5Dg-3GyeilT3Vg,920
+numpy/random/_examples/cffi/parse.py,sha256=BX3tRknP-4v8PVNf-wFBx289DisbOvVZdbAXvAZWfAk,1561
+numpy/random/_examples/cython/__pycache__/setup.cpython-36.pyc,,
+numpy/random/_examples/cython/extending.pyx,sha256=_pKBslBsb8rGeFZkuQeAIhBdeIjDcX3roGqV_Jev7NE,2371
+numpy/random/_examples/cython/extending_distributions.pyx,sha256=1zrMvPbKi0RinyZ93Syyy4OXGEOzAAKHSzTmDtN09ZY,3987
+numpy/random/_examples/cython/setup.py,sha256=b8L5U9ACAnRsC6ANXXGlDj29Ie6K6sUae-UeSiQUVTc,1368
+numpy/random/_examples/numba/__pycache__/extending.cpython-36.pyc,,
+numpy/random/_examples/numba/__pycache__/extending_distributions.cpython-36.pyc,,
+numpy/random/_examples/numba/extending.py,sha256=xfAEeiSfWP_WIT7Va0duyX9zSqHeAtNRLy2Ksxol7xM,2061
+numpy/random/_examples/numba/extending_distributions.py,sha256=tU62JEW13VyNuBPhSpDWqd9W9ammHJCLv61apg90lMc,2101
+numpy/random/_generator.cp36-win32.pyd,sha256=KRrUMyuT8BRAx0HEAZwONTpuW08EwnBIy-Qg_osu3f0,593920
+numpy/random/_mt19937.cp36-win32.pyd,sha256=H8WN_hc3IW9HtNnGqKipGTYWjMNWvE2hXS4iOAdp92c,65536
+numpy/random/_pcg64.cp36-win32.pyd,sha256=FawY-jHtNGE2tGHTuN07NhFx28CEDb15hYIxuYurVCE,59904
+numpy/random/_philox.cp36-win32.pyd,sha256=MrGpEcTZnROGSpqymlKRp7jKrq82htmO85yp86jEir0,61440
+numpy/random/_pickle.py,sha256=X1IKY4xyLBsWLG1vubCWyRRn-QsV-jm5McUH-Zc-uiU,2329
+numpy/random/_sfc64.cp36-win32.pyd,sha256=jVR6igBiwDhdAQM4H5oty4qnYeW2srSGlb3EbKYRogg,44032
+numpy/random/bit_generator.cp36-win32.pyd,sha256=__WKQGckgz_PjfnhHRHlNhSTPcxKwApYSv4JtXxq6lc,125952
+numpy/random/bit_generator.pxd,sha256=wvVMUsJ4CEi-X097EKdMiDaGdEbIF4OhpQvEVS_MQ1s,1040
+numpy/random/c_distributions.pxd,sha256=N8O_29MDGDOyMqmSKoaoooo4OJRRerBwsBXLw7_4j54,6147
+numpy/random/lib/npyrandom.lib,sha256=obRFtCLHbeHlnTqlf0WmO3FJJw2sxt2ksfCZfwq__Z4,82036
+numpy/random/mtrand.cp36-win32.pyd,sha256=6i2DGu3bfGsB21x9uFHMopK4zzPCrQZKE3f4OMGEF5A,525824
+numpy/random/setup.py,sha256=x1CA0fgu4ooolY9bPUEJKEWLyx-YgFEXp-Wum5Ke8EU,6222
+numpy/random/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/random/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_direct.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_extending.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_generator_mt19937.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_generator_mt19937_regressions.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_random.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_randomstate.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_randomstate_regression.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_regression.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_seed_sequence.cpython-36.pyc,,
+numpy/random/tests/__pycache__/test_smoke.cpython-36.pyc,,
+numpy/random/tests/data/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/random/tests/data/__pycache__/__init__.cpython-36.pyc,,
+numpy/random/tests/data/mt19937-testset-1.csv,sha256=bA5uuOXgLpkAwJjfV8oUePg3-eyaH4-gKe8AMcl2Xn0,16845
+numpy/random/tests/data/mt19937-testset-2.csv,sha256=SnOL1nyRbblYlC254PBUSc37NguV5xN-0W_B32IxDGE,16826
+numpy/random/tests/data/pcg64-testset-1.csv,sha256=wHoS7fIR3hMEdta7MtJ8EpIWX-Bw1yfSaVxiC15vxVs,24840
+numpy/random/tests/data/pcg64-testset-2.csv,sha256=6vlnVuW_4i6LEsVn6b40HjcBWWjoX5lboSCBDpDrzFs,24846
+numpy/random/tests/data/philox-testset-1.csv,sha256=QvpTynWHQjqTz3P2MPvtMLdg2VnM6TGTpXgp-_LeJ5g,24853
+numpy/random/tests/data/philox-testset-2.csv,sha256=-BNO1OCYtDIjnN5Q-AsQezBCGmVJUIs3qAMyj8SNtsA,24839
+numpy/random/tests/data/sfc64-testset-1.csv,sha256=sgkemW0lbKJ2wh1sBj6CfmXwFYTqfAk152P0r8emO38,24841
+numpy/random/tests/data/sfc64-testset-2.csv,sha256=mkp21SG8eCqsfNyQZdmiV41-xKcsV8eutT7rVnVEG50,24834
+numpy/random/tests/test_direct.py,sha256=lorvgd9iyAHZtp_W2uVOQec46LL4JlwzBwPjZ7KBPPo,14843
+numpy/random/tests/test_extending.py,sha256=FSv8xJt8fd1-clX6rOwrMhn66PfMn4JJRbJH46ptwVo,3598
+numpy/random/tests/test_generator_mt19937.py,sha256=PftMeh_JZgWsE0Gj2Y0mciJwAn015sSg-Ee8lxiIT2I,105221
+numpy/random/tests/test_generator_mt19937_regressions.py,sha256=qzfS5z9cY86X92qcoU3EX8-mVCmCz9gVwZ9cBtI0cLw,5803
+numpy/random/tests/test_random.py,sha256=Lln-BoQ_l5j0MRz2-fkQeGRLNXP2G-gspSJrYqPr7gk,69058
+numpy/random/tests/test_randomstate.py,sha256=3RsaYTBvwDDDvFcHQz3gvcKvLfV-J4sJQc_4rdz8wM4,81766
+numpy/random/tests/test_randomstate_regression.py,sha256=1QBMG9KrWDBp5l2upMpaAOqEi8WHw3rSFI78eXITo8o,7758
+numpy/random/tests/test_regression.py,sha256=7Aktlse9beP4mO41__ZlfgqTviwAGVCTQYfUPxMH1pI,5602
+numpy/random/tests/test_seed_sequence.py,sha256=zWUvhWDxBmTN2WteSFQeJ29W0-2k3ZUze_3YtL4Kgms,3391
+numpy/random/tests/test_smoke.py,sha256=SMmdUvuBUXcrhkKlM-BXXHBCLMu2xTS8NqRxPryE_Qw,28678
+numpy/setup.py,sha256=b8ZRQ41mwuzHT-e-z2VkOgGaJArDfixl5WPbVag0puI,900
+numpy/testing/__init__.py,sha256=s9TGtO8tH0kG8emfVLC1pBRUrgsb4ueWAwtIb6XQXLg,586
+numpy/testing/__pycache__/__init__.cpython-36.pyc,,
+numpy/testing/__pycache__/print_coercion_tables.cpython-36.pyc,,
+numpy/testing/__pycache__/setup.cpython-36.pyc,,
+numpy/testing/__pycache__/utils.cpython-36.pyc,,
+numpy/testing/_private/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/testing/_private/__pycache__/__init__.cpython-36.pyc,,
+numpy/testing/_private/__pycache__/decorators.cpython-36.pyc,,
+numpy/testing/_private/__pycache__/noseclasses.cpython-36.pyc,,
+numpy/testing/_private/__pycache__/nosetester.cpython-36.pyc,,
+numpy/testing/_private/__pycache__/parameterized.cpython-36.pyc,,
+numpy/testing/_private/__pycache__/utils.cpython-36.pyc,,
+numpy/testing/_private/decorators.py,sha256=SlPl0mwKPXVpywpDJg__c6koz5BO3ihm6230ov-y7HU,9011
+numpy/testing/_private/noseclasses.py,sha256=23nLzkcEy0a9GMSyy8HVl78k1GkfMMO3o1lKUOCAAzs,14892
+numpy/testing/_private/nosetester.py,sha256=-cgYtMtxlN60eRQ83mHiYcA5E-bgubda74vBisSytMw,20015
+numpy/testing/_private/parameterized.py,sha256=VP7nfeYtdrgJxIPWu9BQK5K3kH3gICZgEFokB2TVd0Y,16963
+numpy/testing/_private/utils.py,sha256=9WRewkeRBOkPDb5FyNavzmJluGqy-vxxPYftVEv2XaY,87553
+numpy/testing/print_coercion_tables.py,sha256=wmvxAPbqLjgrMuCce6G_eX8tMI1LhsoCghnUTJIRiR0,2827
+numpy/testing/setup.py,sha256=ltZquj0L8WaIXBisJvjHZ4oRJMCUitEBMkTf06e5OWQ,649
+numpy/testing/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/testing/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/testing/tests/__pycache__/test_decorators.cpython-36.pyc,,
+numpy/testing/tests/__pycache__/test_doctesting.cpython-36.pyc,,
+numpy/testing/tests/__pycache__/test_utils.cpython-36.pyc,,
+numpy/testing/tests/test_decorators.py,sha256=zR2-CPT4vK_KE1st9LuaAAkP1PFthUkBCefjng088uI,6045
+numpy/testing/tests/test_doctesting.py,sha256=wUauOPx75yuJgIHNWlPCpF0EUIGKDI-nzlImCwGeYo0,1404
+numpy/testing/tests/test_utils.py,sha256=VzN7apbJyKFULS3T1R6k2jx35TA9lR-Pxd6EqNVfm0Y,57196
+numpy/testing/utils.py,sha256=LhIaw_3hG1jUW98rUrBhOxRi1SjOUgVIr5--kwp0XZc,1260
+numpy/tests/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+numpy/tests/__pycache__/__init__.cpython-36.pyc,,
+numpy/tests/__pycache__/test_ctypeslib.cpython-36.pyc,,
+numpy/tests/__pycache__/test_matlib.cpython-36.pyc,,
+numpy/tests/__pycache__/test_numpy_version.cpython-36.pyc,,
+numpy/tests/__pycache__/test_public_api.cpython-36.pyc,,
+numpy/tests/__pycache__/test_reloading.cpython-36.pyc,,
+numpy/tests/__pycache__/test_scripts.cpython-36.pyc,,
+numpy/tests/__pycache__/test_warnings.cpython-36.pyc,,
+numpy/tests/test_ctypeslib.py,sha256=4hdwdxDArcTLHpinigBSLLGb_ppGtksPWRsvkRD0Z84,12535
+numpy/tests/test_matlib.py,sha256=TUaQmGoz9fvQQ8FrooTq-g9BFiViGWjoTIGQSUUF6-Y,1910
+numpy/tests/test_numpy_version.py,sha256=EzH8x1xpoowIlHlXQ-TEQaIJlmnx_rgrJtOCwdBXYyY,598
+numpy/tests/test_public_api.py,sha256=9UZzBZF8Tk1o4TocrXhr3x8CuE7aDH4jFEwQGcUO7x0,15945
+numpy/tests/test_reloading.py,sha256=WuaGiMPNSmoS2_cKKcsLFNI2iSIvxxR0O0f1Id7qW40,2007
+numpy/tests/test_scripts.py,sha256=jZHCW1jQrXwXycEUp4ntzQzm_DDscJXDsQL_moonq98,1567
+numpy/tests/test_warnings.py,sha256=IMFVROBQqYZPibnHmwepGqEUQoBlDtdC8DlRulbMAd8,2354
+numpy/version.py,sha256=nxc2U-zsoU3q2gUMSVsROsUSghfRHZqe7u4s-uJpQVM,306
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/WHEEL b/venv/Lib/site-packages/numpy-1.19.2.dist-info/WHEEL
new file mode 100644
index 000000000..9ed4ab625
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/WHEEL
@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: bdist_wheel (0.35.1)
+Root-Is-Purelib: false
+Tag: cp36-cp36m-win32
+
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/entry_points.txt b/venv/Lib/site-packages/numpy-1.19.2.dist-info/entry_points.txt
new file mode 100644
index 000000000..1010c24b6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/entry_points.txt
@@ -0,0 +1,3 @@
+[console_scripts]
+f2py = numpy.f2py.f2py2e:main
+
diff --git a/venv/Lib/site-packages/numpy-1.19.2.dist-info/top_level.txt b/venv/Lib/site-packages/numpy-1.19.2.dist-info/top_level.txt
new file mode 100644
index 000000000..24ce15ab7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy-1.19.2.dist-info/top_level.txt
@@ -0,0 +1 @@
+numpy
diff --git a/venv/Lib/site-packages/numpy/.libs/libopenblas.U35RT5X5BPDSH5ZTF276YADQR2KDU6PR.gfortran-win32.dll b/venv/Lib/site-packages/numpy/.libs/libopenblas.U35RT5X5BPDSH5ZTF276YADQR2KDU6PR.gfortran-win32.dll
new file mode 100644
index 000000000..454bf078c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/.libs/libopenblas.U35RT5X5BPDSH5ZTF276YADQR2KDU6PR.gfortran-win32.dll differ
diff --git a/venv/Lib/site-packages/numpy/LICENSE.txt b/venv/Lib/site-packages/numpy/LICENSE.txt
new file mode 100644
index 000000000..04619f58b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/LICENSE.txt
@@ -0,0 +1,938 @@
+
+----
+
+This binary distribution of NumPy also bundles the following software:
+
+
+Name: OpenBLAS
+Files: extra-dll\libopenb*.dll
+Description: bundled as a dynamically linked library
+Availability: https://github.com/xianyi/OpenBLAS/
+License: 3-clause BSD
+  Copyright (c) 2011-2014, The OpenBLAS Project
+  All rights reserved.
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are
+  met:
+
+     1. Redistributions of source code must retain the above copyright
+        notice, this list of conditions and the following disclaimer.
+
+     2. Redistributions in binary form must reproduce the above copyright
+        notice, this list of conditions and the following disclaimer in
+        the documentation and/or other materials provided with the
+        distribution.
+     3. Neither the name of the OpenBLAS project nor the names of
+        its contributors may be used to endorse or promote products
+        derived from this software without specific prior written
+        permission.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+  AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+  IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+  ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+  LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+  DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+  SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+  CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+  OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE
+  USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+Name: LAPACK
+Files: extra-dll\libopenb*.dll
+Description: bundled in OpenBLAS
+Availability: https://github.com/xianyi/OpenBLAS/
+License 3-clause BSD
+  Copyright (c) 1992-2013 The University of Tennessee and The University
+                          of Tennessee Research Foundation.  All rights
+                          reserved.
+  Copyright (c) 2000-2013 The University of California Berkeley. All
+                          rights reserved.
+  Copyright (c) 2006-2013 The University of Colorado Denver.  All rights
+                          reserved.
+
+  $COPYRIGHT$
+
+  Additional copyrights may follow
+
+  $HEADER$
+
+  Redistribution and use in source and binary forms, with or without
+  modification, are permitted provided that the following conditions are
+  met:
+
+  - Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  - Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer listed
+    in this license in the documentation and/or other materials
+    provided with the distribution.
+
+  - Neither the name of the copyright holders nor the names of its
+    contributors may be used to endorse or promote products derived from
+    this software without specific prior written permission.
+
+  The copyright holders provide no reassurances that the source code
+  provided does not infringe any patent, copyright, or any other
+  intellectual property rights of third parties.  The copyright holders
+  disclaim any liability to any recipient for claims brought against
+  recipient by any third party for infringement of that parties
+  intellectual property rights.
+
+  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+  A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+  OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+  SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+  LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+  DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+  THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+  (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+  OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+
+Name: GCC runtime library
+Files: extra-dll\*.dll
+Description: statically linked, in DLL files compiled with gfortran only
+Availability: https://gcc.gnu.org/viewcvs/gcc/
+License: GPLv3 + runtime exception
+  Copyright (C) 2002-2017 Free Software Foundation, Inc.
+
+  Libgfortran is free software; you can redistribute it and/or modify
+  it under the terms of the GNU General Public License as published by
+  the Free Software Foundation; either version 3, or (at your option)
+  any later version.
+
+  Libgfortran is distributed in the hope that it will be useful,
+  but WITHOUT ANY WARRANTY; without even the implied warranty of
+  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+  GNU General Public License for more details.
+
+  Under Section 7 of GPL version 3, you are granted additional
+  permissions described in the GCC Runtime Library Exception, version
+  3.1, as published by the Free Software Foundation.
+
+  You should have received a copy of the GNU General Public License and
+  a copy of the GCC Runtime Library Exception along with this program;
+  see the files COPYING3 and COPYING.RUNTIME respectively.  If not, see
+  <http://www.gnu.org/licenses/>.
+
+
+Name: Microsoft Visual C++ Runtime Files
+Files: extra-dll\msvcp140.dll
+License: MSVC
+  https://www.visualstudio.com/license-terms/distributable-code-microsoft-visual-studio-2015-rc-microsoft-visual-studio-2015-sdk-rc-includes-utilities-buildserver-files/#visual-c-runtime
+
+  Subject to the License Terms for the software, you may copy and
+  distribute with your program any of the files within the followng
+  folder and its subfolders except as noted below. You may not modify
+  these files.
+
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist
+
+  You may not distribute the contents of the following folders:
+
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist\debug_nonredist
+    C:\Program Files (x86)\Microsoft Visual Studio 14.0\VC\redist\onecore\debug_nonredist
+
+  Subject to the License Terms for the software, you may copy and
+  distribute the following files with your program in your program’s
+  application local folder or by deploying them into the Global
+  Assembly Cache (GAC):
+
+  VC\atlmfc\lib\mfcmifc80.dll
+  VC\atlmfc\lib\amd64\mfcmifc80.dll
+
+
+Name: Microsoft Visual C++ Runtime Files
+Files: extra-dll\msvc*90.dll, extra-dll\Microsoft.VC90.CRT.manifest
+License: MSVC
+  For your convenience, we have provided the following folders for
+  use when redistributing VC++ runtime files. Subject to the license
+  terms for the software, you may redistribute the folder
+  (unmodified) in the application local folder as a sub-folder with
+  no change to the folder name. You may also redistribute all the
+  files (*.dll and *.manifest) within a folder, listed below the
+  folder for your convenience, as an entire set.
+
+  \VC\redist\x86\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\ia64\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\amd64\Microsoft.VC90.ATL\
+   atl90.dll
+   Microsoft.VC90.ATL.manifest
+  \VC\redist\x86\Microsoft.VC90.CRT\
+   msvcm90.dll
+   msvcp90.dll
+   msvcr90.dll
+   Microsoft.VC90.CRT.manifest
+  \VC\redist\ia64\Microsoft.VC90.CRT\
+   msvcm90.dll
+   msvcp90.dll
+   msvcr90.dll
+   Microsoft.VC90.CRT.manifest
+
+----
+
+Full text of license texts referred to above follows (that they are
+listed below does not necessarily imply the conditions apply to the
+present binary release):
+
+----
+
+GCC RUNTIME LIBRARY EXCEPTION
+
+Version 3.1, 31 March 2009
+
+Copyright (C) 2009 Free Software Foundation, Inc. <http://fsf.org/>
+
+Everyone is permitted to copy and distribute verbatim copies of this
+license document, but changing it is not allowed.
+
+This GCC Runtime Library Exception ("Exception") is an additional
+permission under section 7 of the GNU General Public License, version
+3 ("GPLv3"). It applies to a given file (the "Runtime Library") that
+bears a notice placed by the copyright holder of the file stating that
+the file is governed by GPLv3 along with this Exception.
+
+When you use GCC to compile a program, GCC may combine portions of
+certain GCC header files and runtime libraries with the compiled
+program. The purpose of this Exception is to allow compilation of
+non-GPL (including proprietary) programs to use, in this way, the
+header files and runtime libraries covered by this Exception.
+
+0. Definitions.
+
+A file is an "Independent Module" if it either requires the Runtime
+Library for execution after a Compilation Process, or makes use of an
+interface provided by the Runtime Library, but is not otherwise based
+on the Runtime Library.
+
+"GCC" means a version of the GNU Compiler Collection, with or without
+modifications, governed by version 3 (or a specified later version) of
+the GNU General Public License (GPL) with the option of using any
+subsequent versions published by the FSF.
+
+"GPL-compatible Software" is software whose conditions of propagation,
+modification and use would permit combination with GCC in accord with
+the license of GCC.
+
+"Target Code" refers to output from any compiler for a real or virtual
+target processor architecture, in executable form or suitable for
+input to an assembler, loader, linker and/or execution
+phase. Notwithstanding that, Target Code does not include data in any
+format that is used as a compiler intermediate representation, or used
+for producing a compiler intermediate representation.
+
+The "Compilation Process" transforms code entirely represented in
+non-intermediate languages designed for human-written code, and/or in
+Java Virtual Machine byte code, into Target Code. Thus, for example,
+use of source code generators and preprocessors need not be considered
+part of the Compilation Process, since the Compilation Process can be
+understood as starting with the output of the generators or
+preprocessors.
+
+A Compilation Process is "Eligible" if it is done using GCC, alone or
+with other GPL-compatible software, or if it is done without using any
+work based on GCC. For example, using non-GPL-compatible Software to
+optimize any GCC intermediate representations would not qualify as an
+Eligible Compilation Process.
+
+1. Grant of Additional Permission.
+
+You have permission to propagate a work of Target Code formed by
+combining the Runtime Library with Independent Modules, even if such
+propagation would otherwise violate the terms of GPLv3, provided that
+all Target Code was generated by Eligible Compilation Processes. You
+may then convey such a combination under terms of your choice,
+consistent with the licensing of the Independent Modules.
+
+2. No Weakening of GCC Copyleft.
+
+The availability of this Exception does not imply any general
+presumption that third-party software is unaffected by the copyleft
+requirements of the license of GCC.
+
+----
+
+                    GNU GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+                            Preamble
+
+  The GNU General Public License is a free, copyleft license for
+software and other kinds of works.
+
+  The licenses for most software and other practical works are designed
+to take away your freedom to share and change the works.  By contrast,
+the GNU General Public License is intended to guarantee your freedom to
+share and change all versions of a program--to make sure it remains free
+software for all its users.  We, the Free Software Foundation, use the
+GNU General Public License for most of our software; it applies also to
+any other work released this way by its authors.  You can apply it to
+your programs, too.
+
+  When we speak of free software, we are referring to freedom, not
+price.  Our General Public Licenses are designed to make sure that you
+have the freedom to distribute copies of free software (and charge for
+them if you wish), that you receive source code or can get it if you
+want it, that you can change the software or use pieces of it in new
+free programs, and that you know you can do these things.
+
+  To protect your rights, we need to prevent others from denying you
+these rights or asking you to surrender the rights.  Therefore, you have
+certain responsibilities if you distribute copies of the software, or if
+you modify it: responsibilities to respect the freedom of others.
+
+  For example, if you distribute copies of such a program, whether
+gratis or for a fee, you must pass on to the recipients the same
+freedoms that you received.  You must make sure that they, too, receive
+or can get the source code.  And you must show them these terms so they
+know their rights.
+
+  Developers that use the GNU GPL protect your rights with two steps:
+(1) assert copyright on the software, and (2) offer you this License
+giving you legal permission to copy, distribute and/or modify it.
+
+  For the developers' and authors' protection, the GPL clearly explains
+that there is no warranty for this free software.  For both users' and
+authors' sake, the GPL requires that modified versions be marked as
+changed, so that their problems will not be attributed erroneously to
+authors of previous versions.
+
+  Some devices are designed to deny users access to install or run
+modified versions of the software inside them, although the manufacturer
+can do so.  This is fundamentally incompatible with the aim of
+protecting users' freedom to change the software.  The systematic
+pattern of such abuse occurs in the area of products for individuals to
+use, which is precisely where it is most unacceptable.  Therefore, we
+have designed this version of the GPL to prohibit the practice for those
+products.  If such problems arise substantially in other domains, we
+stand ready to extend this provision to those domains in future versions
+of the GPL, as needed to protect the freedom of users.
+
+  Finally, every program is threatened constantly by software patents.
+States should not allow patents to restrict development and use of
+software on general-purpose computers, but in those that do, we wish to
+avoid the special danger that patents applied to a free program could
+make it effectively proprietary.  To prevent this, the GPL assures that
+patents cannot be used to render the program non-free.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.
+
+                       TERMS AND CONDITIONS
+
+  0. Definitions.
+
+  "This License" refers to version 3 of the GNU General Public License.
+
+  "Copyright" also means copyright-like laws that apply to other kinds of
+works, such as semiconductor masks.
+
+  "The Program" refers to any copyrightable work licensed under this
+License.  Each licensee is addressed as "you".  "Licensees" and
+"recipients" may be individuals or organizations.
+
+  To "modify" a work means to copy from or adapt all or part of the work
+in a fashion requiring copyright permission, other than the making of an
+exact copy.  The resulting work is called a "modified version" of the
+earlier work or a work "based on" the earlier work.
+
+  A "covered work" means either the unmodified Program or a work based
+on the Program.
+
+  To "propagate" a work means to do anything with it that, without
+permission, would make you directly or secondarily liable for
+infringement under applicable copyright law, except executing it on a
+computer or modifying a private copy.  Propagation includes copying,
+distribution (with or without modification), making available to the
+public, and in some countries other activities as well.
+
+  To "convey" a work means any kind of propagation that enables other
+parties to make or receive copies.  Mere interaction with a user through
+a computer network, with no transfer of a copy, is not conveying.
+
+  An interactive user interface displays "Appropriate Legal Notices"
+to the extent that it includes a convenient and prominently visible
+feature that (1) displays an appropriate copyright notice, and (2)
+tells the user that there is no warranty for the work (except to the
+extent that warranties are provided), that licensees may convey the
+work under this License, and how to view a copy of this License.  If
+the interface presents a list of user commands or options, such as a
+menu, a prominent item in the list meets this criterion.
+
+  1. Source Code.
+
+  The "source code" for a work means the preferred form of the work
+for making modifications to it.  "Object code" means any non-source
+form of a work.
+
+  A "Standard Interface" means an interface that either is an official
+standard defined by a recognized standards body, or, in the case of
+interfaces specified for a particular programming language, one that
+is widely used among developers working in that language.
+
+  The "System Libraries" of an executable work include anything, other
+than the work as a whole, that (a) is included in the normal form of
+packaging a Major Component, but which is not part of that Major
+Component, and (b) serves only to enable use of the work with that
+Major Component, or to implement a Standard Interface for which an
+implementation is available to the public in source code form.  A
+"Major Component", in this context, means a major essential component
+(kernel, window system, and so on) of the specific operating system
+(if any) on which the executable work runs, or a compiler used to
+produce the work, or an object code interpreter used to run it.
+
+  The "Corresponding Source" for a work in object code form means all
+the source code needed to generate, install, and (for an executable
+work) run the object code and to modify the work, including scripts to
+control those activities.  However, it does not include the work's
+System Libraries, or general-purpose tools or generally available free
+programs which are used unmodified in performing those activities but
+which are not part of the work.  For example, Corresponding Source
+includes interface definition files associated with source files for
+the work, and the source code for shared libraries and dynamically
+linked subprograms that the work is specifically designed to require,
+such as by intimate data communication or control flow between those
+subprograms and other parts of the work.
+
+  The Corresponding Source need not include anything that users
+can regenerate automatically from other parts of the Corresponding
+Source.
+
+  The Corresponding Source for a work in source code form is that
+same work.
+
+  2. Basic Permissions.
+
+  All rights granted under this License are granted for the term of
+copyright on the Program, and are irrevocable provided the stated
+conditions are met.  This License explicitly affirms your unlimited
+permission to run the unmodified Program.  The output from running a
+covered work is covered by this License only if the output, given its
+content, constitutes a covered work.  This License acknowledges your
+rights of fair use or other equivalent, as provided by copyright law.
+
+  You may make, run and propagate covered works that you do not
+convey, without conditions so long as your license otherwise remains
+in force.  You may convey covered works to others for the sole purpose
+of having them make modifications exclusively for you, or provide you
+with facilities for running those works, provided that you comply with
+the terms of this License in conveying all material for which you do
+not control copyright.  Those thus making or running the covered works
+for you must do so exclusively on your behalf, under your direction
+and control, on terms that prohibit them from making any copies of
+your copyrighted material outside their relationship with you.
+
+  Conveying under any other circumstances is permitted solely under
+the conditions stated below.  Sublicensing is not allowed; section 10
+makes it unnecessary.
+
+  3. Protecting Users' Legal Rights From Anti-Circumvention Law.
+
+  No covered work shall be deemed part of an effective technological
+measure under any applicable law fulfilling obligations under article
+11 of the WIPO copyright treaty adopted on 20 December 1996, or
+similar laws prohibiting or restricting circumvention of such
+measures.
+
+  When you convey a covered work, you waive any legal power to forbid
+circumvention of technological measures to the extent such circumvention
+is effected by exercising rights under this License with respect to
+the covered work, and you disclaim any intention to limit operation or
+modification of the work as a means of enforcing, against the work's
+users, your or third parties' legal rights to forbid circumvention of
+technological measures.
+
+  4. Conveying Verbatim Copies.
+
+  You may convey verbatim copies of the Program's source code as you
+receive it, in any medium, provided that you conspicuously and
+appropriately publish on each copy an appropriate copyright notice;
+keep intact all notices stating that this License and any
+non-permissive terms added in accord with section 7 apply to the code;
+keep intact all notices of the absence of any warranty; and give all
+recipients a copy of this License along with the Program.
+
+  You may charge any price or no price for each copy that you convey,
+and you may offer support or warranty protection for a fee.
+
+  5. Conveying Modified Source Versions.
+
+  You may convey a work based on the Program, or the modifications to
+produce it from the Program, in the form of source code under the
+terms of section 4, provided that you also meet all of these conditions:
+
+    a) The work must carry prominent notices stating that you modified
+    it, and giving a relevant date.
+
+    b) The work must carry prominent notices stating that it is
+    released under this License and any conditions added under section
+    7.  This requirement modifies the requirement in section 4 to
+    "keep intact all notices".
+
+    c) You must license the entire work, as a whole, under this
+    License to anyone who comes into possession of a copy.  This
+    License will therefore apply, along with any applicable section 7
+    additional terms, to the whole of the work, and all its parts,
+    regardless of how they are packaged.  This License gives no
+    permission to license the work in any other way, but it does not
+    invalidate such permission if you have separately received it.
+
+    d) If the work has interactive user interfaces, each must display
+    Appropriate Legal Notices; however, if the Program has interactive
+    interfaces that do not display Appropriate Legal Notices, your
+    work need not make them do so.
+
+  A compilation of a covered work with other separate and independent
+works, which are not by their nature extensions of the covered work,
+and which are not combined with it such as to form a larger program,
+in or on a volume of a storage or distribution medium, is called an
+"aggregate" if the compilation and its resulting copyright are not
+used to limit the access or legal rights of the compilation's users
+beyond what the individual works permit.  Inclusion of a covered work
+in an aggregate does not cause this License to apply to the other
+parts of the aggregate.
+
+  6. Conveying Non-Source Forms.
+
+  You may convey a covered work in object code form under the terms
+of sections 4 and 5, provided that you also convey the
+machine-readable Corresponding Source under the terms of this License,
+in one of these ways:
+
+    a) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by the
+    Corresponding Source fixed on a durable physical medium
+    customarily used for software interchange.
+
+    b) Convey the object code in, or embodied in, a physical product
+    (including a physical distribution medium), accompanied by a
+    written offer, valid for at least three years and valid for as
+    long as you offer spare parts or customer support for that product
+    model, to give anyone who possesses the object code either (1) a
+    copy of the Corresponding Source for all the software in the
+    product that is covered by this License, on a durable physical
+    medium customarily used for software interchange, for a price no
+    more than your reasonable cost of physically performing this
+    conveying of source, or (2) access to copy the
+    Corresponding Source from a network server at no charge.
+
+    c) Convey individual copies of the object code with a copy of the
+    written offer to provide the Corresponding Source.  This
+    alternative is allowed only occasionally and noncommercially, and
+    only if you received the object code with such an offer, in accord
+    with subsection 6b.
+
+    d) Convey the object code by offering access from a designated
+    place (gratis or for a charge), and offer equivalent access to the
+    Corresponding Source in the same way through the same place at no
+    further charge.  You need not require recipients to copy the
+    Corresponding Source along with the object code.  If the place to
+    copy the object code is a network server, the Corresponding Source
+    may be on a different server (operated by you or a third party)
+    that supports equivalent copying facilities, provided you maintain
+    clear directions next to the object code saying where to find the
+    Corresponding Source.  Regardless of what server hosts the
+    Corresponding Source, you remain obligated to ensure that it is
+    available for as long as needed to satisfy these requirements.
+
+    e) Convey the object code using peer-to-peer transmission, provided
+    you inform other peers where the object code and Corresponding
+    Source of the work are being offered to the general public at no
+    charge under subsection 6d.
+
+  A separable portion of the object code, whose source code is excluded
+from the Corresponding Source as a System Library, need not be
+included in conveying the object code work.
+
+  A "User Product" is either (1) a "consumer product", which means any
+tangible personal property which is normally used for personal, family,
+or household purposes, or (2) anything designed or sold for incorporation
+into a dwelling.  In determining whether a product is a consumer product,
+doubtful cases shall be resolved in favor of coverage.  For a particular
+product received by a particular user, "normally used" refers to a
+typical or common use of that class of product, regardless of the status
+of the particular user or of the way in which the particular user
+actually uses, or expects or is expected to use, the product.  A product
+is a consumer product regardless of whether the product has substantial
+commercial, industrial or non-consumer uses, unless such uses represent
+the only significant mode of use of the product.
+
+  "Installation Information" for a User Product means any methods,
+procedures, authorization keys, or other information required to install
+and execute modified versions of a covered work in that User Product from
+a modified version of its Corresponding Source.  The information must
+suffice to ensure that the continued functioning of the modified object
+code is in no case prevented or interfered with solely because
+modification has been made.
+
+  If you convey an object code work under this section in, or with, or
+specifically for use in, a User Product, and the conveying occurs as
+part of a transaction in which the right of possession and use of the
+User Product is transferred to the recipient in perpetuity or for a
+fixed term (regardless of how the transaction is characterized), the
+Corresponding Source conveyed under this section must be accompanied
+by the Installation Information.  But this requirement does not apply
+if neither you nor any third party retains the ability to install
+modified object code on the User Product (for example, the work has
+been installed in ROM).
+
+  The requirement to provide Installation Information does not include a
+requirement to continue to provide support service, warranty, or updates
+for a work that has been modified or installed by the recipient, or for
+the User Product in which it has been modified or installed.  Access to a
+network may be denied when the modification itself materially and
+adversely affects the operation of the network or violates the rules and
+protocols for communication across the network.
+
+  Corresponding Source conveyed, and Installation Information provided,
+in accord with this section must be in a format that is publicly
+documented (and with an implementation available to the public in
+source code form), and must require no special password or key for
+unpacking, reading or copying.
+
+  7. Additional Terms.
+
+  "Additional permissions" are terms that supplement the terms of this
+License by making exceptions from one or more of its conditions.
+Additional permissions that are applicable to the entire Program shall
+be treated as though they were included in this License, to the extent
+that they are valid under applicable law.  If additional permissions
+apply only to part of the Program, that part may be used separately
+under those permissions, but the entire Program remains governed by
+this License without regard to the additional permissions.
+
+  When you convey a copy of a covered work, you may at your option
+remove any additional permissions from that copy, or from any part of
+it.  (Additional permissions may be written to require their own
+removal in certain cases when you modify the work.)  You may place
+additional permissions on material, added by you to a covered work,
+for which you have or can give appropriate copyright permission.
+
+  Notwithstanding any other provision of this License, for material you
+add to a covered work, you may (if authorized by the copyright holders of
+that material) supplement the terms of this License with terms:
+
+    a) Disclaiming warranty or limiting liability differently from the
+    terms of sections 15 and 16 of this License; or
+
+    b) Requiring preservation of specified reasonable legal notices or
+    author attributions in that material or in the Appropriate Legal
+    Notices displayed by works containing it; or
+
+    c) Prohibiting misrepresentation of the origin of that material, or
+    requiring that modified versions of such material be marked in
+    reasonable ways as different from the original version; or
+
+    d) Limiting the use for publicity purposes of names of licensors or
+    authors of the material; or
+
+    e) Declining to grant rights under trademark law for use of some
+    trade names, trademarks, or service marks; or
+
+    f) Requiring indemnification of licensors and authors of that
+    material by anyone who conveys the material (or modified versions of
+    it) with contractual assumptions of liability to the recipient, for
+    any liability that these contractual assumptions directly impose on
+    those licensors and authors.
+
+  All other non-permissive additional terms are considered "further
+restrictions" within the meaning of section 10.  If the Program as you
+received it, or any part of it, contains a notice stating that it is
+governed by this License along with a term that is a further
+restriction, you may remove that term.  If a license document contains
+a further restriction but permits relicensing or conveying under this
+License, you may add to a covered work material governed by the terms
+of that license document, provided that the further restriction does
+not survive such relicensing or conveying.
+
+  If you add terms to a covered work in accord with this section, you
+must place, in the relevant source files, a statement of the
+additional terms that apply to those files, or a notice indicating
+where to find the applicable terms.
+
+  Additional terms, permissive or non-permissive, may be stated in the
+form of a separately written license, or stated as exceptions;
+the above requirements apply either way.
+
+  8. Termination.
+
+  You may not propagate or modify a covered work except as expressly
+provided under this License.  Any attempt otherwise to propagate or
+modify it is void, and will automatically terminate your rights under
+this License (including any patent licenses granted under the third
+paragraph of section 11).
+
+  However, if you cease all violation of this License, then your
+license from a particular copyright holder is reinstated (a)
+provisionally, unless and until the copyright holder explicitly and
+finally terminates your license, and (b) permanently, if the copyright
+holder fails to notify you of the violation by some reasonable means
+prior to 60 days after the cessation.
+
+  Moreover, your license from a particular copyright holder is
+reinstated permanently if the copyright holder notifies you of the
+violation by some reasonable means, this is the first time you have
+received notice of violation of this License (for any work) from that
+copyright holder, and you cure the violation prior to 30 days after
+your receipt of the notice.
+
+  Termination of your rights under this section does not terminate the
+licenses of parties who have received copies or rights from you under
+this License.  If your rights have been terminated and not permanently
+reinstated, you do not qualify to receive new licenses for the same
+material under section 10.
+
+  9. Acceptance Not Required for Having Copies.
+
+  You are not required to accept this License in order to receive or
+run a copy of the Program.  Ancillary propagation of a covered work
+occurring solely as a consequence of using peer-to-peer transmission
+to receive a copy likewise does not require acceptance.  However,
+nothing other than this License grants you permission to propagate or
+modify any covered work.  These actions infringe copyright if you do
+not accept this License.  Therefore, by modifying or propagating a
+covered work, you indicate your acceptance of this License to do so.
+
+  10. Automatic Licensing of Downstream Recipients.
+
+  Each time you convey a covered work, the recipient automatically
+receives a license from the original licensors, to run, modify and
+propagate that work, subject to this License.  You are not responsible
+for enforcing compliance by third parties with this License.
+
+  An "entity transaction" is a transaction transferring control of an
+organization, or substantially all assets of one, or subdividing an
+organization, or merging organizations.  If propagation of a covered
+work results from an entity transaction, each party to that
+transaction who receives a copy of the work also receives whatever
+licenses to the work the party's predecessor in interest had or could
+give under the previous paragraph, plus a right to possession of the
+Corresponding Source of the work from the predecessor in interest, if
+the predecessor has it or can get it with reasonable efforts.
+
+  You may not impose any further restrictions on the exercise of the
+rights granted or affirmed under this License.  For example, you may
+not impose a license fee, royalty, or other charge for exercise of
+rights granted under this License, and you may not initiate litigation
+(including a cross-claim or counterclaim in a lawsuit) alleging that
+any patent claim is infringed by making, using, selling, offering for
+sale, or importing the Program or any portion of it.
+
+  11. Patents.
+
+  A "contributor" is a copyright holder who authorizes use under this
+License of the Program or a work on which the Program is based.  The
+work thus licensed is called the contributor's "contributor version".
+
+  A contributor's "essential patent claims" are all patent claims
+owned or controlled by the contributor, whether already acquired or
+hereafter acquired, that would be infringed by some manner, permitted
+by this License, of making, using, or selling its contributor version,
+but do not include claims that would be infringed only as a
+consequence of further modification of the contributor version.  For
+purposes of this definition, "control" includes the right to grant
+patent sublicenses in a manner consistent with the requirements of
+this License.
+
+  Each contributor grants you a non-exclusive, worldwide, royalty-free
+patent license under the contributor's essential patent claims, to
+make, use, sell, offer for sale, import and otherwise run, modify and
+propagate the contents of its contributor version.
+
+  In the following three paragraphs, a "patent license" is any express
+agreement or commitment, however denominated, not to enforce a patent
+(such as an express permission to practice a patent or covenant not to
+sue for patent infringement).  To "grant" such a patent license to a
+party means to make such an agreement or commitment not to enforce a
+patent against the party.
+
+  If you convey a covered work, knowingly relying on a patent license,
+and the Corresponding Source of the work is not available for anyone
+to copy, free of charge and under the terms of this License, through a
+publicly available network server or other readily accessible means,
+then you must either (1) cause the Corresponding Source to be so
+available, or (2) arrange to deprive yourself of the benefit of the
+patent license for this particular work, or (3) arrange, in a manner
+consistent with the requirements of this License, to extend the patent
+license to downstream recipients.  "Knowingly relying" means you have
+actual knowledge that, but for the patent license, your conveying the
+covered work in a country, or your recipient's use of the covered work
+in a country, would infringe one or more identifiable patents in that
+country that you have reason to believe are valid.
+
+  If, pursuant to or in connection with a single transaction or
+arrangement, you convey, or propagate by procuring conveyance of, a
+covered work, and grant a patent license to some of the parties
+receiving the covered work authorizing them to use, propagate, modify
+or convey a specific copy of the covered work, then the patent license
+you grant is automatically extended to all recipients of the covered
+work and works based on it.
+
+  A patent license is "discriminatory" if it does not include within
+the scope of its coverage, prohibits the exercise of, or is
+conditioned on the non-exercise of one or more of the rights that are
+specifically granted under this License.  You may not convey a covered
+work if you are a party to an arrangement with a third party that is
+in the business of distributing software, under which you make payment
+to the third party based on the extent of your activity of conveying
+the work, and under which the third party grants, to any of the
+parties who would receive the covered work from you, a discriminatory
+patent license (a) in connection with copies of the covered work
+conveyed by you (or copies made from those copies), or (b) primarily
+for and in connection with specific products or compilations that
+contain the covered work, unless you entered into that arrangement,
+or that patent license was granted, prior to 28 March 2007.
+
+  Nothing in this License shall be construed as excluding or limiting
+any implied license or other defenses to infringement that may
+otherwise be available to you under applicable patent law.
+
+  12. No Surrender of Others' Freedom.
+
+  If conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot convey a
+covered work so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you may
+not convey it at all.  For example, if you agree to terms that obligate you
+to collect a royalty for further conveying from those to whom you convey
+the Program, the only way you could satisfy both those terms and this
+License would be to refrain entirely from conveying the Program.
+
+  13. Use with the GNU Affero General Public License.
+
+  Notwithstanding any other provision of this License, you have
+permission to link or combine any covered work with a work licensed
+under version 3 of the GNU Affero General Public License into a single
+combined work, and to convey the resulting work.  The terms of this
+License will continue to apply to the part which is the covered work,
+but the special requirements of the GNU Affero General Public License,
+section 13, concerning interaction through a network will apply to the
+combination as such.
+
+  14. Revised Versions of this License.
+
+  The Free Software Foundation may publish revised and/or new versions of
+the GNU General Public License from time to time.  Such new versions will
+be similar in spirit to the present version, but may differ in detail to
+address new problems or concerns.
+
+  Each version is given a distinguishing version number.  If the
+Program specifies that a certain numbered version of the GNU General
+Public License "or any later version" applies to it, you have the
+option of following the terms and conditions either of that numbered
+version or of any later version published by the Free Software
+Foundation.  If the Program does not specify a version number of the
+GNU General Public License, you may choose any version ever published
+by the Free Software Foundation.
+
+  If the Program specifies that a proxy can decide which future
+versions of the GNU General Public License can be used, that proxy's
+public statement of acceptance of a version permanently authorizes you
+to choose that version for the Program.
+
+  Later license versions may give you additional or different
+permissions.  However, no additional obligations are imposed on any
+author or copyright holder as a result of your choosing to follow a
+later version.
+
+  15. Disclaimer of Warranty.
+
+  THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY
+APPLICABLE LAW.  EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT
+HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY
+OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO,
+THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM
+IS WITH YOU.  SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF
+ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. Limitation of Liability.
+
+  IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING
+WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS
+THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY
+GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE
+USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF
+DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD
+PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS),
+EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF
+SUCH DAMAGES.
+
+  17. Interpretation of Sections 15 and 16.
+
+  If the disclaimer of warranty and limitation of liability provided
+above cannot be given local legal effect according to their terms,
+reviewing courts shall apply local law that most closely approximates
+an absolute waiver of all civil liability in connection with the
+Program, unless a warranty or assumption of liability accompanies a
+copy of the Program in return for a fee.
+
+                     END OF TERMS AND CONDITIONS
+
+            How to Apply These Terms to Your New Programs
+
+  If you develop a new program, and you want it to be of the greatest
+possible use to the public, the best way to achieve this is to make it
+free software which everyone can redistribute and change under these terms.
+
+  To do so, attach the following notices to the program.  It is safest
+to attach them to the start of each source file to most effectively
+state the exclusion of warranty; and each file should have at least
+the "copyright" line and a pointer to where the full notice is found.
+
+    <one line to give the program's name and a brief idea of what it does.>
+    Copyright (C) <year>  <name of author>
+
+    This program is free software: you can redistribute it and/or modify
+    it under the terms of the GNU General Public License as published by
+    the Free Software Foundation, either version 3 of the License, or
+    (at your option) any later version.
+
+    This program is distributed in the hope that it will be useful,
+    but WITHOUT ANY WARRANTY; without even the implied warranty of
+    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
+    GNU General Public License for more details.
+
+    You should have received a copy of the GNU General Public License
+    along with this program.  If not, see <http://www.gnu.org/licenses/>.
+
+Also add information on how to contact you by electronic and paper mail.
+
+  If the program does terminal interaction, make it output a short
+notice like this when it starts in an interactive mode:
+
+    <program>  Copyright (C) <year>  <name of author>
+    This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'.
+    This is free software, and you are welcome to redistribute it
+    under certain conditions; type `show c' for details.
+
+The hypothetical commands `show w' and `show c' should show the appropriate
+parts of the General Public License.  Of course, your program's commands
+might be different; for a GUI interface, you would use an "about box".
+
+  You should also get your employer (if you work as a programmer) or school,
+if any, to sign a "copyright disclaimer" for the program, if necessary.
+For more information on this, and how to apply and follow the GNU GPL, see
+<http://www.gnu.org/licenses/>.
+
+  The GNU General Public License does not permit incorporating your program
+into proprietary programs.  If your program is a subroutine library, you
+may consider it more useful to permit linking proprietary applications with
+the library.  If this is what you want to do, use the GNU Lesser General
+Public License instead of this License.  But first, please read
+<http://www.gnu.org/philosophy/why-not-lgpl.html>.
diff --git a/venv/Lib/site-packages/numpy/__config__.py b/venv/Lib/site-packages/numpy/__config__.py
new file mode 100644
index 000000000..142f63a8e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/__config__.py
@@ -0,0 +1,77 @@
+# This file is generated by numpy's setup.py
+# It contains system_info results at the time of building this package.
+__all__ = ["get_info","show"]
+
+
+import os
+import sys
+
+extra_dll_dir = os.path.join(os.path.dirname(__file__), '.libs')
+
+if sys.platform == 'win32' and os.path.isdir(extra_dll_dir):
+    if sys.version_info >= (3, 8):
+        os.add_dll_directory(extra_dll_dir)
+    else:
+        os.environ.setdefault('PATH', '')
+        os.environ['PATH'] += os.pathsep + extra_dll_dir
+
+blas_mkl_info={}
+blis_info={}
+openblas_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_info'], 'libraries': ['openblas_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+blas_opt_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_info'], 'libraries': ['openblas_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+lapack_mkl_info={}
+openblas_lapack_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_lapack_info'], 'libraries': ['openblas_lapack_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+lapack_opt_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_lapack_info'], 'libraries': ['openblas_lapack_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+
+def get_info(name):
+    g = globals()
+    return g.get(name, g.get(name + "_info", {}))
+
+def show():
+    """
+    Show libraries in the system on which NumPy was built.
+
+    Print information about various resources (libraries, library
+    directories, include directories, etc.) in the system on which
+    NumPy was built.
+
+    See Also
+    --------
+    get_include : Returns the directory containing NumPy C
+                  header files.
+
+    Notes
+    -----
+    Classes specifying the information to be printed are defined
+    in the `numpy.distutils.system_info` module.
+
+    Information may include:
+
+    * ``language``: language used to write the libraries (mostly
+      C or f77)
+    * ``libraries``: names of libraries found in the system
+    * ``library_dirs``: directories containing the libraries
+    * ``include_dirs``: directories containing library header files
+    * ``src_dirs``: directories containing library source files
+    * ``define_macros``: preprocessor macros used by
+      ``distutils.setup``
+
+    Examples
+    --------
+    >>> np.show_config()
+    blas_opt_info:
+        language = c
+        define_macros = [('HAVE_CBLAS', None)]
+        libraries = ['openblas', 'openblas']
+        library_dirs = ['/usr/local/lib']
+    """
+    for name,info_dict in globals().items():
+        if name[0] == "_" or type(info_dict) is not type({}): continue
+        print(name + ":")
+        if not info_dict:
+            print("  NOT AVAILABLE")
+        for k,v in info_dict.items():
+            v = str(v)
+            if k == "sources" and len(v) > 200:
+                v = v[:60] + " ...\n... " + v[-60:]
+            print("    %s = %s" % (k,v))
diff --git a/venv/Lib/site-packages/numpy/__init__.cython-30.pxd b/venv/Lib/site-packages/numpy/__init__.cython-30.pxd
new file mode 100644
index 000000000..55097888c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/__init__.cython-30.pxd
@@ -0,0 +1,1032 @@
+# NumPy static imports for Cython >= 3.0
+#
+# If any of the PyArray_* functions are called, import_array must be
+# called first.  This is done automatically by Cython 3.0+ if a call
+# is not detected inside of the module.
+#
+# Author: Dag Sverre Seljebotn
+#
+
+from cpython.ref cimport Py_INCREF
+from cpython.object cimport PyObject, PyTypeObject, PyObject_TypeCheck
+cimport libc.stdio as stdio
+
+
+cdef extern from *:
+    # Leave a marker that the NumPy declarations came from NumPy itself and not from Cython.
+    # See https://github.com/cython/cython/issues/3573
+    """
+    /* Using NumPy API declarations from "numpy/__init__.cython-30.pxd" */
+    """
+
+
+cdef extern from "Python.h":
+    ctypedef Py_ssize_t Py_intptr_t
+
+cdef extern from "numpy/arrayobject.h":
+    ctypedef Py_intptr_t npy_intp
+    ctypedef size_t npy_uintp
+
+    cdef enum NPY_TYPES:
+        NPY_BOOL
+        NPY_BYTE
+        NPY_UBYTE
+        NPY_SHORT
+        NPY_USHORT
+        NPY_INT
+        NPY_UINT
+        NPY_LONG
+        NPY_ULONG
+        NPY_LONGLONG
+        NPY_ULONGLONG
+        NPY_FLOAT
+        NPY_DOUBLE
+        NPY_LONGDOUBLE
+        NPY_CFLOAT
+        NPY_CDOUBLE
+        NPY_CLONGDOUBLE
+        NPY_OBJECT
+        NPY_STRING
+        NPY_UNICODE
+        NPY_VOID
+        NPY_DATETIME
+        NPY_TIMEDELTA
+        NPY_NTYPES
+        NPY_NOTYPE
+
+        NPY_INT8
+        NPY_INT16
+        NPY_INT32
+        NPY_INT64
+        NPY_INT128
+        NPY_INT256
+        NPY_UINT8
+        NPY_UINT16
+        NPY_UINT32
+        NPY_UINT64
+        NPY_UINT128
+        NPY_UINT256
+        NPY_FLOAT16
+        NPY_FLOAT32
+        NPY_FLOAT64
+        NPY_FLOAT80
+        NPY_FLOAT96
+        NPY_FLOAT128
+        NPY_FLOAT256
+        NPY_COMPLEX32
+        NPY_COMPLEX64
+        NPY_COMPLEX128
+        NPY_COMPLEX160
+        NPY_COMPLEX192
+        NPY_COMPLEX256
+        NPY_COMPLEX512
+
+        NPY_INTP
+
+    ctypedef enum NPY_ORDER:
+        NPY_ANYORDER
+        NPY_CORDER
+        NPY_FORTRANORDER
+        NPY_KEEPORDER
+
+    ctypedef enum NPY_CASTING:
+        NPY_NO_CASTING
+        NPY_EQUIV_CASTING
+        NPY_SAFE_CASTING
+        NPY_SAME_KIND_CASTING
+        NPY_UNSAFE_CASTING
+
+    ctypedef enum NPY_CLIPMODE:
+        NPY_CLIP
+        NPY_WRAP
+        NPY_RAISE
+
+    ctypedef enum NPY_SCALARKIND:
+        NPY_NOSCALAR,
+        NPY_BOOL_SCALAR,
+        NPY_INTPOS_SCALAR,
+        NPY_INTNEG_SCALAR,
+        NPY_FLOAT_SCALAR,
+        NPY_COMPLEX_SCALAR,
+        NPY_OBJECT_SCALAR
+
+    ctypedef enum NPY_SORTKIND:
+        NPY_QUICKSORT
+        NPY_HEAPSORT
+        NPY_MERGESORT
+
+    ctypedef enum NPY_SEARCHSIDE:
+        NPY_SEARCHLEFT
+        NPY_SEARCHRIGHT
+
+    enum:
+        # DEPRECATED since NumPy 1.7 ! Do not use in new code!
+        NPY_C_CONTIGUOUS
+        NPY_F_CONTIGUOUS
+        NPY_CONTIGUOUS
+        NPY_FORTRAN
+        NPY_OWNDATA
+        NPY_FORCECAST
+        NPY_ENSURECOPY
+        NPY_ENSUREARRAY
+        NPY_ELEMENTSTRIDES
+        NPY_ALIGNED
+        NPY_NOTSWAPPED
+        NPY_WRITEABLE
+        NPY_UPDATEIFCOPY
+        NPY_ARR_HAS_DESCR
+
+        NPY_BEHAVED
+        NPY_BEHAVED_NS
+        NPY_CARRAY
+        NPY_CARRAY_RO
+        NPY_FARRAY
+        NPY_FARRAY_RO
+        NPY_DEFAULT
+
+        NPY_IN_ARRAY
+        NPY_OUT_ARRAY
+        NPY_INOUT_ARRAY
+        NPY_IN_FARRAY
+        NPY_OUT_FARRAY
+        NPY_INOUT_FARRAY
+
+        NPY_UPDATE_ALL
+
+    enum:
+        # Added in NumPy 1.7 to replace the deprecated enums above.
+        NPY_ARRAY_C_CONTIGUOUS
+        NPY_ARRAY_F_CONTIGUOUS
+        NPY_ARRAY_OWNDATA
+        NPY_ARRAY_FORCECAST
+        NPY_ARRAY_ENSURECOPY
+        NPY_ARRAY_ENSUREARRAY
+        NPY_ARRAY_ELEMENTSTRIDES
+        NPY_ARRAY_ALIGNED
+        NPY_ARRAY_NOTSWAPPED
+        NPY_ARRAY_WRITEABLE
+        NPY_ARRAY_UPDATEIFCOPY
+
+        NPY_ARRAY_BEHAVED
+        NPY_ARRAY_BEHAVED_NS
+        NPY_ARRAY_CARRAY
+        NPY_ARRAY_CARRAY_RO
+        NPY_ARRAY_FARRAY
+        NPY_ARRAY_FARRAY_RO
+        NPY_ARRAY_DEFAULT
+
+        NPY_ARRAY_IN_ARRAY
+        NPY_ARRAY_OUT_ARRAY
+        NPY_ARRAY_INOUT_ARRAY
+        NPY_ARRAY_IN_FARRAY
+        NPY_ARRAY_OUT_FARRAY
+        NPY_ARRAY_INOUT_FARRAY
+
+        NPY_ARRAY_UPDATE_ALL
+
+    cdef enum:
+        NPY_MAXDIMS
+
+    npy_intp NPY_MAX_ELSIZE
+
+    ctypedef void (*PyArray_VectorUnaryFunc)(void *, void *, npy_intp, void *,  void *)
+
+    ctypedef struct PyArray_ArrayDescr:
+        # shape is a tuple, but Cython doesn't support "tuple shape"
+        # inside a non-PyObject declaration, so we have to declare it
+        # as just a PyObject*.
+        PyObject* shape
+
+    ctypedef struct PyArray_Descr:
+        pass
+
+    ctypedef class numpy.dtype [object PyArray_Descr, check_size ignore]:
+        # Use PyDataType_* macros when possible, however there are no macros
+        # for accessing some of the fields, so some are defined.
+        cdef PyTypeObject* typeobj
+        cdef char kind
+        cdef char type
+        # Numpy sometimes mutates this without warning (e.g. it'll
+        # sometimes change "|" to "<" in shared dtype objects on
+        # little-endian machines). If this matters to you, use
+        # PyArray_IsNativeByteOrder(dtype.byteorder) instead of
+        # directly accessing this field.
+        cdef char byteorder
+        cdef char flags
+        cdef int type_num
+        cdef int itemsize "elsize"
+        cdef int alignment
+        cdef object fields
+        cdef tuple names
+        # Use PyDataType_HASSUBARRAY to test whether this field is
+        # valid (the pointer can be NULL). Most users should access
+        # this field via the inline helper method PyDataType_SHAPE.
+        cdef PyArray_ArrayDescr* subarray
+
+    ctypedef class numpy.flatiter [object PyArrayIterObject, check_size ignore]:
+        # Use through macros
+        pass
+
+    ctypedef class numpy.broadcast [object PyArrayMultiIterObject, check_size ignore]:
+        # Use through macros
+        pass
+
+    ctypedef struct PyArrayObject:
+        # For use in situations where ndarray can't replace PyArrayObject*,
+        # like PyArrayObject**.
+        pass
+
+    ctypedef class numpy.ndarray [object PyArrayObject, check_size ignore]:
+        cdef __cythonbufferdefaults__ = {"mode": "strided"}
+
+        # NOTE: no field declarations since direct access is deprecated since NumPy 1.7
+        # Instead, we use properties that map to the corresponding C-API functions.
+
+        @property
+        cdef inline PyObject* base(self) nogil:
+            """Returns a borrowed reference to the object owning the data/memory.
+            """
+            return PyArray_BASE(self)
+
+        @property
+        cdef inline dtype descr(self):
+            """Returns an owned reference to the dtype of the array.
+            """
+            return <dtype>PyArray_DESCR(self)
+
+        @property
+        cdef inline int ndim(self) nogil:
+            """Returns the number of dimensions in the array.
+            """
+            return PyArray_NDIM(self)
+
+        @property
+        cdef inline npy_intp *shape(self) nogil:
+            """Returns a pointer to the dimensions/shape of the array.
+            The number of elements matches the number of dimensions of the array (ndim).
+            Can return NULL for 0-dimensional arrays.
+            """
+            return PyArray_DIMS(self)
+
+        @property
+        cdef inline npy_intp *strides(self) nogil:
+            """Returns a pointer to the strides of the array.
+            The number of elements matches the number of dimensions of the array (ndim).
+            """
+            return PyArray_STRIDES(self)
+
+        @property
+        cdef inline npy_intp size(self) nogil:
+            """Returns the total size (in number of elements) of the array.
+            """
+            return PyArray_SIZE(self)
+
+        @property
+        cdef inline char* data(self) nogil:
+            """The pointer to the data buffer as a char*.
+            This is provided for legacy reasons to avoid direct struct field access.
+            For new code that needs this access, you probably want to cast the result
+            of `PyArray_DATA()` instead, which returns a 'void*'.
+            """
+            return PyArray_BYTES(self)
+
+    ctypedef unsigned char      npy_bool
+
+    ctypedef signed char      npy_byte
+    ctypedef signed short     npy_short
+    ctypedef signed int       npy_int
+    ctypedef signed long      npy_long
+    ctypedef signed long long npy_longlong
+
+    ctypedef unsigned char      npy_ubyte
+    ctypedef unsigned short     npy_ushort
+    ctypedef unsigned int       npy_uint
+    ctypedef unsigned long      npy_ulong
+    ctypedef unsigned long long npy_ulonglong
+
+    ctypedef float        npy_float
+    ctypedef double       npy_double
+    ctypedef long double  npy_longdouble
+
+    ctypedef signed char        npy_int8
+    ctypedef signed short       npy_int16
+    ctypedef signed int         npy_int32
+    ctypedef signed long long   npy_int64
+    ctypedef signed long long   npy_int96
+    ctypedef signed long long   npy_int128
+
+    ctypedef unsigned char      npy_uint8
+    ctypedef unsigned short     npy_uint16
+    ctypedef unsigned int       npy_uint32
+    ctypedef unsigned long long npy_uint64
+    ctypedef unsigned long long npy_uint96
+    ctypedef unsigned long long npy_uint128
+
+    ctypedef float        npy_float32
+    ctypedef double       npy_float64
+    ctypedef long double  npy_float80
+    ctypedef long double  npy_float96
+    ctypedef long double  npy_float128
+
+    ctypedef struct npy_cfloat:
+        double real
+        double imag
+
+    ctypedef struct npy_cdouble:
+        double real
+        double imag
+
+    ctypedef struct npy_clongdouble:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex64:
+        float real
+        float imag
+
+    ctypedef struct npy_complex128:
+        double real
+        double imag
+
+    ctypedef struct npy_complex160:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex192:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex256:
+        long double real
+        long double imag
+
+    ctypedef struct PyArray_Dims:
+        npy_intp *ptr
+        int len
+
+    int _import_array() except -1
+    # A second definition so _import_array isn't marked as used when we use it here.
+    # Do not use - subject to change any time.
+    int __pyx_import_array "_import_array"() except -1
+
+    #
+    # Macros from ndarrayobject.h
+    #
+    bint PyArray_CHKFLAGS(ndarray m, int flags) nogil
+    bint PyArray_IS_C_CONTIGUOUS(ndarray arr) nogil
+    bint PyArray_IS_F_CONTIGUOUS(ndarray arr) nogil
+    bint PyArray_ISCONTIGUOUS(ndarray m) nogil
+    bint PyArray_ISWRITEABLE(ndarray m) nogil
+    bint PyArray_ISALIGNED(ndarray m) nogil
+
+    int PyArray_NDIM(ndarray) nogil
+    bint PyArray_ISONESEGMENT(ndarray) nogil
+    bint PyArray_ISFORTRAN(ndarray) nogil
+    int PyArray_FORTRANIF(ndarray) nogil
+
+    void* PyArray_DATA(ndarray) nogil
+    char* PyArray_BYTES(ndarray) nogil
+
+    npy_intp* PyArray_DIMS(ndarray) nogil
+    npy_intp* PyArray_STRIDES(ndarray) nogil
+    npy_intp PyArray_DIM(ndarray, size_t) nogil
+    npy_intp PyArray_STRIDE(ndarray, size_t) nogil
+
+    PyObject *PyArray_BASE(ndarray) nogil  # returns borrowed reference!
+    PyArray_Descr *PyArray_DESCR(ndarray) nogil  # returns borrowed reference to dtype!
+    PyArray_Descr *PyArray_DTYPE(ndarray) nogil  # returns borrowed reference to dtype! NP 1.7+ alias for descr.
+    int PyArray_FLAGS(ndarray) nogil
+    void PyArray_CLEARFLAGS(ndarray, int flags) nogil  # Added in NumPy 1.7
+    void PyArray_ENABLEFLAGS(ndarray, int flags) nogil  # Added in NumPy 1.7
+    npy_intp PyArray_ITEMSIZE(ndarray) nogil
+    int PyArray_TYPE(ndarray arr) nogil
+
+    object PyArray_GETITEM(ndarray arr, void *itemptr)
+    int PyArray_SETITEM(ndarray arr, void *itemptr, object obj)
+
+    bint PyTypeNum_ISBOOL(int) nogil
+    bint PyTypeNum_ISUNSIGNED(int) nogil
+    bint PyTypeNum_ISSIGNED(int) nogil
+    bint PyTypeNum_ISINTEGER(int) nogil
+    bint PyTypeNum_ISFLOAT(int) nogil
+    bint PyTypeNum_ISNUMBER(int) nogil
+    bint PyTypeNum_ISSTRING(int) nogil
+    bint PyTypeNum_ISCOMPLEX(int) nogil
+    bint PyTypeNum_ISPYTHON(int) nogil
+    bint PyTypeNum_ISFLEXIBLE(int) nogil
+    bint PyTypeNum_ISUSERDEF(int) nogil
+    bint PyTypeNum_ISEXTENDED(int) nogil
+    bint PyTypeNum_ISOBJECT(int) nogil
+
+    bint PyDataType_ISBOOL(dtype) nogil
+    bint PyDataType_ISUNSIGNED(dtype) nogil
+    bint PyDataType_ISSIGNED(dtype) nogil
+    bint PyDataType_ISINTEGER(dtype) nogil
+    bint PyDataType_ISFLOAT(dtype) nogil
+    bint PyDataType_ISNUMBER(dtype) nogil
+    bint PyDataType_ISSTRING(dtype) nogil
+    bint PyDataType_ISCOMPLEX(dtype) nogil
+    bint PyDataType_ISPYTHON(dtype) nogil
+    bint PyDataType_ISFLEXIBLE(dtype) nogil
+    bint PyDataType_ISUSERDEF(dtype) nogil
+    bint PyDataType_ISEXTENDED(dtype) nogil
+    bint PyDataType_ISOBJECT(dtype) nogil
+    bint PyDataType_HASFIELDS(dtype) nogil
+    bint PyDataType_HASSUBARRAY(dtype) nogil
+
+    bint PyArray_ISBOOL(ndarray) nogil
+    bint PyArray_ISUNSIGNED(ndarray) nogil
+    bint PyArray_ISSIGNED(ndarray) nogil
+    bint PyArray_ISINTEGER(ndarray) nogil
+    bint PyArray_ISFLOAT(ndarray) nogil
+    bint PyArray_ISNUMBER(ndarray) nogil
+    bint PyArray_ISSTRING(ndarray) nogil
+    bint PyArray_ISCOMPLEX(ndarray) nogil
+    bint PyArray_ISPYTHON(ndarray) nogil
+    bint PyArray_ISFLEXIBLE(ndarray) nogil
+    bint PyArray_ISUSERDEF(ndarray) nogil
+    bint PyArray_ISEXTENDED(ndarray) nogil
+    bint PyArray_ISOBJECT(ndarray) nogil
+    bint PyArray_HASFIELDS(ndarray) nogil
+
+    bint PyArray_ISVARIABLE(ndarray) nogil
+
+    bint PyArray_SAFEALIGNEDCOPY(ndarray) nogil
+    bint PyArray_ISNBO(char) nogil              # works on ndarray.byteorder
+    bint PyArray_IsNativeByteOrder(char) nogil  # works on ndarray.byteorder
+    bint PyArray_ISNOTSWAPPED(ndarray) nogil
+    bint PyArray_ISBYTESWAPPED(ndarray) nogil
+
+    bint PyArray_FLAGSWAP(ndarray, int) nogil
+
+    bint PyArray_ISCARRAY(ndarray) nogil
+    bint PyArray_ISCARRAY_RO(ndarray) nogil
+    bint PyArray_ISFARRAY(ndarray) nogil
+    bint PyArray_ISFARRAY_RO(ndarray) nogil
+    bint PyArray_ISBEHAVED(ndarray) nogil
+    bint PyArray_ISBEHAVED_RO(ndarray) nogil
+
+
+    bint PyDataType_ISNOTSWAPPED(dtype) nogil
+    bint PyDataType_ISBYTESWAPPED(dtype) nogil
+
+    bint PyArray_DescrCheck(object)
+
+    bint PyArray_Check(object)
+    bint PyArray_CheckExact(object)
+
+    # Cannot be supported due to out arg:
+    # bint PyArray_HasArrayInterfaceType(object, dtype, object, object&)
+    # bint PyArray_HasArrayInterface(op, out)
+
+
+    bint PyArray_IsZeroDim(object)
+    # Cannot be supported due to ## ## in macro:
+    # bint PyArray_IsScalar(object, verbatim work)
+    bint PyArray_CheckScalar(object)
+    bint PyArray_IsPythonNumber(object)
+    bint PyArray_IsPythonScalar(object)
+    bint PyArray_IsAnyScalar(object)
+    bint PyArray_CheckAnyScalar(object)
+
+    ndarray PyArray_GETCONTIGUOUS(ndarray)
+    bint PyArray_SAMESHAPE(ndarray, ndarray) nogil
+    npy_intp PyArray_SIZE(ndarray) nogil
+    npy_intp PyArray_NBYTES(ndarray) nogil
+
+    object PyArray_FROM_O(object)
+    object PyArray_FROM_OF(object m, int flags)
+    object PyArray_FROM_OT(object m, int type)
+    object PyArray_FROM_OTF(object m, int type, int flags)
+    object PyArray_FROMANY(object m, int type, int min, int max, int flags)
+    object PyArray_ZEROS(int nd, npy_intp* dims, int type, int fortran)
+    object PyArray_EMPTY(int nd, npy_intp* dims, int type, int fortran)
+    void PyArray_FILLWBYTE(object, int val)
+    npy_intp PyArray_REFCOUNT(object)
+    object PyArray_ContiguousFromAny(op, int, int min_depth, int max_depth)
+    unsigned char PyArray_EquivArrTypes(ndarray a1, ndarray a2)
+    bint PyArray_EquivByteorders(int b1, int b2) nogil
+    object PyArray_SimpleNew(int nd, npy_intp* dims, int typenum)
+    object PyArray_SimpleNewFromData(int nd, npy_intp* dims, int typenum, void* data)
+    #object PyArray_SimpleNewFromDescr(int nd, npy_intp* dims, dtype descr)
+    object PyArray_ToScalar(void* data, ndarray arr)
+
+    void* PyArray_GETPTR1(ndarray m, npy_intp i) nogil
+    void* PyArray_GETPTR2(ndarray m, npy_intp i, npy_intp j) nogil
+    void* PyArray_GETPTR3(ndarray m, npy_intp i, npy_intp j, npy_intp k) nogil
+    void* PyArray_GETPTR4(ndarray m, npy_intp i, npy_intp j, npy_intp k, npy_intp l) nogil
+
+    void PyArray_XDECREF_ERR(ndarray)
+    # Cannot be supported due to out arg
+    # void PyArray_DESCR_REPLACE(descr)
+
+
+    object PyArray_Copy(ndarray)
+    object PyArray_FromObject(object op, int type, int min_depth, int max_depth)
+    object PyArray_ContiguousFromObject(object op, int type, int min_depth, int max_depth)
+    object PyArray_CopyFromObject(object op, int type, int min_depth, int max_depth)
+
+    object PyArray_Cast(ndarray mp, int type_num)
+    object PyArray_Take(ndarray ap, object items, int axis)
+    object PyArray_Put(ndarray ap, object items, object values)
+
+    void PyArray_ITER_RESET(flatiter it) nogil
+    void PyArray_ITER_NEXT(flatiter it) nogil
+    void PyArray_ITER_GOTO(flatiter it, npy_intp* destination) nogil
+    void PyArray_ITER_GOTO1D(flatiter it, npy_intp ind) nogil
+    void* PyArray_ITER_DATA(flatiter it) nogil
+    bint PyArray_ITER_NOTDONE(flatiter it) nogil
+
+    void PyArray_MultiIter_RESET(broadcast multi) nogil
+    void PyArray_MultiIter_NEXT(broadcast multi) nogil
+    void PyArray_MultiIter_GOTO(broadcast multi, npy_intp dest) nogil
+    void PyArray_MultiIter_GOTO1D(broadcast multi, npy_intp ind) nogil
+    void* PyArray_MultiIter_DATA(broadcast multi, npy_intp i) nogil
+    void PyArray_MultiIter_NEXTi(broadcast multi, npy_intp i) nogil
+    bint PyArray_MultiIter_NOTDONE(broadcast multi) nogil
+
+    # Functions from __multiarray_api.h
+
+    # Functions taking dtype and returning object/ndarray are disabled
+    # for now as they steal dtype references. I'm conservative and disable
+    # more than is probably needed until it can be checked further.
+    int PyArray_SetNumericOps        (object)
+    object PyArray_GetNumericOps ()
+    int PyArray_INCREF (ndarray)
+    int PyArray_XDECREF (ndarray)
+    void PyArray_SetStringFunction (object, int)
+    dtype PyArray_DescrFromType (int)
+    object PyArray_TypeObjectFromType (int)
+    char * PyArray_Zero (ndarray)
+    char * PyArray_One (ndarray)
+    #object PyArray_CastToType (ndarray, dtype, int)
+    int PyArray_CastTo (ndarray, ndarray)
+    int PyArray_CastAnyTo (ndarray, ndarray)
+    int PyArray_CanCastSafely (int, int)
+    npy_bool PyArray_CanCastTo (dtype, dtype)
+    int PyArray_ObjectType (object, int)
+    dtype PyArray_DescrFromObject (object, dtype)
+    #ndarray* PyArray_ConvertToCommonType (object, int *)
+    dtype PyArray_DescrFromScalar (object)
+    dtype PyArray_DescrFromTypeObject (object)
+    npy_intp PyArray_Size (object)
+    #object PyArray_Scalar (void *, dtype, object)
+    #object PyArray_FromScalar (object, dtype)
+    void PyArray_ScalarAsCtype (object, void *)
+    #int PyArray_CastScalarToCtype (object, void *, dtype)
+    #int PyArray_CastScalarDirect (object, dtype, void *, int)
+    object PyArray_ScalarFromObject (object)
+    #PyArray_VectorUnaryFunc * PyArray_GetCastFunc (dtype, int)
+    object PyArray_FromDims (int, int *, int)
+    #object PyArray_FromDimsAndDataAndDescr (int, int *, dtype, char *)
+    #object PyArray_FromAny (object, dtype, int, int, int, object)
+    object PyArray_EnsureArray (object)
+    object PyArray_EnsureAnyArray (object)
+    #object PyArray_FromFile (stdio.FILE *, dtype, npy_intp, char *)
+    #object PyArray_FromString (char *, npy_intp, dtype, npy_intp, char *)
+    #object PyArray_FromBuffer (object, dtype, npy_intp, npy_intp)
+    #object PyArray_FromIter (object, dtype, npy_intp)
+    object PyArray_Return (ndarray)
+    #object PyArray_GetField (ndarray, dtype, int)
+    #int PyArray_SetField (ndarray, dtype, int, object)
+    object PyArray_Byteswap (ndarray, npy_bool)
+    object PyArray_Resize (ndarray, PyArray_Dims *, int, NPY_ORDER)
+    int PyArray_MoveInto (ndarray, ndarray)
+    int PyArray_CopyInto (ndarray, ndarray)
+    int PyArray_CopyAnyInto (ndarray, ndarray)
+    int PyArray_CopyObject (ndarray, object)
+    object PyArray_NewCopy (ndarray, NPY_ORDER)
+    object PyArray_ToList (ndarray)
+    object PyArray_ToString (ndarray, NPY_ORDER)
+    int PyArray_ToFile (ndarray, stdio.FILE *, char *, char *)
+    int PyArray_Dump (object, object, int)
+    object PyArray_Dumps (object, int)
+    int PyArray_ValidType (int)
+    void PyArray_UpdateFlags (ndarray, int)
+    object PyArray_New (type, int, npy_intp *, int, npy_intp *, void *, int, int, object)
+    #object PyArray_NewFromDescr (type, dtype, int, npy_intp *, npy_intp *, void *, int, object)
+    #dtype PyArray_DescrNew (dtype)
+    dtype PyArray_DescrNewFromType (int)
+    double PyArray_GetPriority (object, double)
+    object PyArray_IterNew (object)
+    object PyArray_MultiIterNew (int, ...)
+
+    int PyArray_PyIntAsInt (object)
+    npy_intp PyArray_PyIntAsIntp (object)
+    int PyArray_Broadcast (broadcast)
+    void PyArray_FillObjectArray (ndarray, object)
+    int PyArray_FillWithScalar (ndarray, object)
+    npy_bool PyArray_CheckStrides (int, int, npy_intp, npy_intp, npy_intp *, npy_intp *)
+    dtype PyArray_DescrNewByteorder (dtype, char)
+    object PyArray_IterAllButAxis (object, int *)
+    #object PyArray_CheckFromAny (object, dtype, int, int, int, object)
+    #object PyArray_FromArray (ndarray, dtype, int)
+    object PyArray_FromInterface (object)
+    object PyArray_FromStructInterface (object)
+    #object PyArray_FromArrayAttr (object, dtype, object)
+    #NPY_SCALARKIND PyArray_ScalarKind (int, ndarray*)
+    int PyArray_CanCoerceScalar (int, int, NPY_SCALARKIND)
+    object PyArray_NewFlagsObject (object)
+    npy_bool PyArray_CanCastScalar (type, type)
+    #int PyArray_CompareUCS4 (npy_ucs4 *, npy_ucs4 *, register size_t)
+    int PyArray_RemoveSmallest (broadcast)
+    int PyArray_ElementStrides (object)
+    void PyArray_Item_INCREF (char *, dtype)
+    void PyArray_Item_XDECREF (char *, dtype)
+    object PyArray_FieldNames (object)
+    object PyArray_Transpose (ndarray, PyArray_Dims *)
+    object PyArray_TakeFrom (ndarray, object, int, ndarray, NPY_CLIPMODE)
+    object PyArray_PutTo (ndarray, object, object, NPY_CLIPMODE)
+    object PyArray_PutMask (ndarray, object, object)
+    object PyArray_Repeat (ndarray, object, int)
+    object PyArray_Choose (ndarray, object, ndarray, NPY_CLIPMODE)
+    int PyArray_Sort (ndarray, int, NPY_SORTKIND)
+    object PyArray_ArgSort (ndarray, int, NPY_SORTKIND)
+    object PyArray_SearchSorted (ndarray, object, NPY_SEARCHSIDE, PyObject *)
+    object PyArray_ArgMax (ndarray, int, ndarray)
+    object PyArray_ArgMin (ndarray, int, ndarray)
+    object PyArray_Reshape (ndarray, object)
+    object PyArray_Newshape (ndarray, PyArray_Dims *, NPY_ORDER)
+    object PyArray_Squeeze (ndarray)
+    #object PyArray_View (ndarray, dtype, type)
+    object PyArray_SwapAxes (ndarray, int, int)
+    object PyArray_Max (ndarray, int, ndarray)
+    object PyArray_Min (ndarray, int, ndarray)
+    object PyArray_Ptp (ndarray, int, ndarray)
+    object PyArray_Mean (ndarray, int, int, ndarray)
+    object PyArray_Trace (ndarray, int, int, int, int, ndarray)
+    object PyArray_Diagonal (ndarray, int, int, int)
+    object PyArray_Clip (ndarray, object, object, ndarray)
+    object PyArray_Conjugate (ndarray, ndarray)
+    object PyArray_Nonzero (ndarray)
+    object PyArray_Std (ndarray, int, int, ndarray, int)
+    object PyArray_Sum (ndarray, int, int, ndarray)
+    object PyArray_CumSum (ndarray, int, int, ndarray)
+    object PyArray_Prod (ndarray, int, int, ndarray)
+    object PyArray_CumProd (ndarray, int, int, ndarray)
+    object PyArray_All (ndarray, int, ndarray)
+    object PyArray_Any (ndarray, int, ndarray)
+    object PyArray_Compress (ndarray, object, int, ndarray)
+    object PyArray_Flatten (ndarray, NPY_ORDER)
+    object PyArray_Ravel (ndarray, NPY_ORDER)
+    npy_intp PyArray_MultiplyList (npy_intp *, int)
+    int PyArray_MultiplyIntList (int *, int)
+    void * PyArray_GetPtr (ndarray, npy_intp*)
+    int PyArray_CompareLists (npy_intp *, npy_intp *, int)
+    #int PyArray_AsCArray (object*, void *, npy_intp *, int, dtype)
+    #int PyArray_As1D (object*, char **, int *, int)
+    #int PyArray_As2D (object*, char ***, int *, int *, int)
+    int PyArray_Free (object, void *)
+    #int PyArray_Converter (object, object*)
+    int PyArray_IntpFromSequence (object, npy_intp *, int)
+    object PyArray_Concatenate (object, int)
+    object PyArray_InnerProduct (object, object)
+    object PyArray_MatrixProduct (object, object)
+    object PyArray_CopyAndTranspose (object)
+    object PyArray_Correlate (object, object, int)
+    int PyArray_TypestrConvert (int, int)
+    #int PyArray_DescrConverter (object, dtype*)
+    #int PyArray_DescrConverter2 (object, dtype*)
+    int PyArray_IntpConverter (object, PyArray_Dims *)
+    #int PyArray_BufferConverter (object, chunk)
+    int PyArray_AxisConverter (object, int *)
+    int PyArray_BoolConverter (object, npy_bool *)
+    int PyArray_ByteorderConverter (object, char *)
+    int PyArray_OrderConverter (object, NPY_ORDER *)
+    unsigned char PyArray_EquivTypes (dtype, dtype)
+    #object PyArray_Zeros (int, npy_intp *, dtype, int)
+    #object PyArray_Empty (int, npy_intp *, dtype, int)
+    object PyArray_Where (object, object, object)
+    object PyArray_Arange (double, double, double, int)
+    #object PyArray_ArangeObj (object, object, object, dtype)
+    int PyArray_SortkindConverter (object, NPY_SORTKIND *)
+    object PyArray_LexSort (object, int)
+    object PyArray_Round (ndarray, int, ndarray)
+    unsigned char PyArray_EquivTypenums (int, int)
+    int PyArray_RegisterDataType (dtype)
+    int PyArray_RegisterCastFunc (dtype, int, PyArray_VectorUnaryFunc *)
+    int PyArray_RegisterCanCast (dtype, int, NPY_SCALARKIND)
+    #void PyArray_InitArrFuncs (PyArray_ArrFuncs *)
+    object PyArray_IntTupleFromIntp (int, npy_intp *)
+    int PyArray_TypeNumFromName (char *)
+    int PyArray_ClipmodeConverter (object, NPY_CLIPMODE *)
+    #int PyArray_OutputConverter (object, ndarray*)
+    object PyArray_BroadcastToShape (object, npy_intp *, int)
+    void _PyArray_SigintHandler (int)
+    void* _PyArray_GetSigintBuf ()
+    #int PyArray_DescrAlignConverter (object, dtype*)
+    #int PyArray_DescrAlignConverter2 (object, dtype*)
+    int PyArray_SearchsideConverter (object, void *)
+    object PyArray_CheckAxis (ndarray, int *, int)
+    npy_intp PyArray_OverflowMultiplyList (npy_intp *, int)
+    int PyArray_CompareString (char *, char *, size_t)
+    int PyArray_SetBaseObject(ndarray, base)  # NOTE: steals a reference to base! Use "set_array_base()" instead.
+
+
+# Typedefs that matches the runtime dtype objects in
+# the numpy module.
+
+# The ones that are commented out needs an IFDEF function
+# in Cython to enable them only on the right systems.
+
+ctypedef npy_int8       int8_t
+ctypedef npy_int16      int16_t
+ctypedef npy_int32      int32_t
+ctypedef npy_int64      int64_t
+#ctypedef npy_int96      int96_t
+#ctypedef npy_int128     int128_t
+
+ctypedef npy_uint8      uint8_t
+ctypedef npy_uint16     uint16_t
+ctypedef npy_uint32     uint32_t
+ctypedef npy_uint64     uint64_t
+#ctypedef npy_uint96     uint96_t
+#ctypedef npy_uint128    uint128_t
+
+ctypedef npy_float32    float32_t
+ctypedef npy_float64    float64_t
+#ctypedef npy_float80    float80_t
+#ctypedef npy_float128   float128_t
+
+ctypedef float complex  complex64_t
+ctypedef double complex complex128_t
+
+# The int types are mapped a bit surprising --
+# numpy.int corresponds to 'l' and numpy.long to 'q'
+ctypedef npy_long       int_t
+ctypedef npy_longlong   long_t
+ctypedef npy_longlong   longlong_t
+
+ctypedef npy_ulong      uint_t
+ctypedef npy_ulonglong  ulong_t
+ctypedef npy_ulonglong  ulonglong_t
+
+ctypedef npy_intp       intp_t
+ctypedef npy_uintp      uintp_t
+
+ctypedef npy_double     float_t
+ctypedef npy_double     double_t
+ctypedef npy_longdouble longdouble_t
+
+ctypedef npy_cfloat      cfloat_t
+ctypedef npy_cdouble     cdouble_t
+ctypedef npy_clongdouble clongdouble_t
+
+ctypedef npy_cdouble     complex_t
+
+cdef inline object PyArray_MultiIterNew1(a):
+    return PyArray_MultiIterNew(1, <void*>a)
+
+cdef inline object PyArray_MultiIterNew2(a, b):
+    return PyArray_MultiIterNew(2, <void*>a, <void*>b)
+
+cdef inline object PyArray_MultiIterNew3(a, b, c):
+    return PyArray_MultiIterNew(3, <void*>a, <void*>b, <void*> c)
+
+cdef inline object PyArray_MultiIterNew4(a, b, c, d):
+    return PyArray_MultiIterNew(4, <void*>a, <void*>b, <void*>c, <void*> d)
+
+cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):
+    return PyArray_MultiIterNew(5, <void*>a, <void*>b, <void*>c, <void*> d, <void*> e)
+
+cdef inline tuple PyDataType_SHAPE(dtype d):
+    if PyDataType_HASSUBARRAY(d):
+        return <tuple>d.subarray.shape
+    else:
+        return ()
+
+
+cdef extern from "numpy/ndarrayobject.h":
+    PyTypeObject PyTimedeltaArrType_Type
+    PyTypeObject PyDatetimeArrType_Type
+    ctypedef int64_t npy_timedelta
+    ctypedef int64_t npy_datetime
+
+cdef extern from "numpy/ndarraytypes.h":
+    ctypedef struct PyArray_DatetimeMetaData:
+        NPY_DATETIMEUNIT base
+        int64_t num
+
+cdef extern from "numpy/arrayscalars.h":
+    ctypedef struct PyDatetimeScalarObject:
+        # PyObject_HEAD
+        npy_datetime obval
+        PyArray_DatetimeMetaData obmeta
+
+    ctypedef struct PyTimedeltaScalarObject:
+        # PyObject_HEAD
+        npy_timedelta obval
+        PyArray_DatetimeMetaData obmeta
+
+    ctypedef enum NPY_DATETIMEUNIT:
+        NPY_FR_Y
+        NPY_FR_M
+        NPY_FR_W
+        NPY_FR_D
+        NPY_FR_B
+        NPY_FR_h
+        NPY_FR_m
+        NPY_FR_s
+        NPY_FR_ms
+        NPY_FR_us
+        NPY_FR_ns
+        NPY_FR_ps
+        NPY_FR_fs
+        NPY_FR_as
+
+
+#
+# ufunc API
+#
+
+cdef extern from "numpy/ufuncobject.h":
+
+    ctypedef void (*PyUFuncGenericFunction) (char **, npy_intp *, npy_intp *, void *)
+
+    ctypedef class numpy.ufunc [object PyUFuncObject, check_size ignore]:
+        cdef:
+            int nin, nout, nargs
+            int identity
+            PyUFuncGenericFunction *functions
+            void **data
+            int ntypes
+            int check_return
+            char *name
+            char *types
+            char *doc
+            void *ptr
+            PyObject *obj
+            PyObject *userloops
+
+    cdef enum:
+        PyUFunc_Zero
+        PyUFunc_One
+        PyUFunc_None
+        UFUNC_ERR_IGNORE
+        UFUNC_ERR_WARN
+        UFUNC_ERR_RAISE
+        UFUNC_ERR_CALL
+        UFUNC_ERR_PRINT
+        UFUNC_ERR_LOG
+        UFUNC_MASK_DIVIDEBYZERO
+        UFUNC_MASK_OVERFLOW
+        UFUNC_MASK_UNDERFLOW
+        UFUNC_MASK_INVALID
+        UFUNC_SHIFT_DIVIDEBYZERO
+        UFUNC_SHIFT_OVERFLOW
+        UFUNC_SHIFT_UNDERFLOW
+        UFUNC_SHIFT_INVALID
+        UFUNC_FPE_DIVIDEBYZERO
+        UFUNC_FPE_OVERFLOW
+        UFUNC_FPE_UNDERFLOW
+        UFUNC_FPE_INVALID
+        UFUNC_ERR_DEFAULT
+        UFUNC_ERR_DEFAULT2
+
+    object PyUFunc_FromFuncAndData(PyUFuncGenericFunction *,
+          void **, char *, int, int, int, int, char *, char *, int)
+    int PyUFunc_RegisterLoopForType(ufunc, int,
+                                    PyUFuncGenericFunction, int *, void *)
+    int PyUFunc_GenericFunction \
+        (ufunc, PyObject *, PyObject *, PyArrayObject **)
+    void PyUFunc_f_f_As_d_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_d_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_f_f \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_g_g \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_F_F_As_D_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_F_F \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_D_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_G_G \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_O_O \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_ff_f_As_dd_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_ff_f \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_dd_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_gg_g \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_FF_F_As_DD_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_DD_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_FF_F \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_GG_G \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_OO_O \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_O_O_method \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_OO_O_method \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_On_Om \
+         (char **, npy_intp *, npy_intp *, void *)
+    int PyUFunc_GetPyValues \
+        (char *, int *, int *, PyObject **)
+    int PyUFunc_checkfperr \
+           (int, PyObject *, int *)
+    void PyUFunc_clearfperr()
+    int PyUFunc_getfperr()
+    int PyUFunc_handlefperr \
+        (int, PyObject *, int, int *)
+    int PyUFunc_ReplaceLoopBySignature \
+        (ufunc, PyUFuncGenericFunction, int *, PyUFuncGenericFunction *)
+    object PyUFunc_FromFuncAndDataAndSignature \
+             (PyUFuncGenericFunction *, void **, char *, int, int, int,
+              int, char *, char *, int, char *)
+
+    int _import_umath() except -1
+
+cdef inline void set_array_base(ndarray arr, object base):
+    Py_INCREF(base) # important to do this before stealing the reference below!
+    PyArray_SetBaseObject(arr, base)
+
+cdef inline object get_array_base(ndarray arr):
+    base = PyArray_BASE(arr)
+    if base is NULL:
+        return None
+    return <object>base
+
+# Versions of the import_* functions which are more suitable for
+# Cython code.
+cdef inline int import_array() except -1:
+    try:
+        __pyx_import_array()
+    except Exception:
+        raise ImportError("numpy.core.multiarray failed to import")
+
+cdef inline int import_umath() except -1:
+    try:
+        _import_umath()
+    except Exception:
+        raise ImportError("numpy.core.umath failed to import")
+
+cdef inline int import_ufunc() except -1:
+    try:
+        _import_umath()
+    except Exception:
+        raise ImportError("numpy.core.umath failed to import")
+
+
+cdef inline bint is_timedelta64_object(object obj):
+    """
+    Cython equivalent of `isinstance(obj, np.timedelta64)`
+
+    Parameters
+    ----------
+    obj : object
+
+    Returns
+    -------
+    bool
+    """
+    return PyObject_TypeCheck(obj, &PyTimedeltaArrType_Type)
+
+
+cdef inline bint is_datetime64_object(object obj):
+    """
+    Cython equivalent of `isinstance(obj, np.datetime64)`
+
+    Parameters
+    ----------
+    obj : object
+
+    Returns
+    -------
+    bool
+    """
+    return PyObject_TypeCheck(obj, &PyDatetimeArrType_Type)
+
+
+cdef inline npy_datetime get_datetime64_value(object obj) nogil:
+    """
+    returns the int64 value underlying scalar numpy datetime64 object
+
+    Note that to interpret this as a datetime, the corresponding unit is
+    also needed.  That can be found using `get_datetime64_unit`.
+    """
+    return (<PyDatetimeScalarObject*>obj).obval
+
+
+cdef inline npy_timedelta get_timedelta64_value(object obj) nogil:
+    """
+    returns the int64 value underlying scalar numpy timedelta64 object
+    """
+    return (<PyTimedeltaScalarObject*>obj).obval
+
+
+cdef inline NPY_DATETIMEUNIT get_datetime64_unit(object obj) nogil:
+    """
+    returns the unit part of the dtype for a numpy datetime64 object.
+    """
+    return <NPY_DATETIMEUNIT>(<PyDatetimeScalarObject*>obj).obmeta.base
diff --git a/venv/Lib/site-packages/numpy/__init__.pxd b/venv/Lib/site-packages/numpy/__init__.pxd
new file mode 100644
index 000000000..1656fa8b2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/__init__.pxd
@@ -0,0 +1,903 @@
+# NumPy static imports for Cython < 3.0
+#
+# If any of the PyArray_* functions are called, import_array must be
+# called first.
+#
+# Author: Dag Sverre Seljebotn
+#
+
+DEF _buffer_format_string_len = 255
+
+cimport cpython.buffer as pybuf
+from cpython.ref cimport Py_INCREF
+from cpython.mem cimport PyObject_Malloc, PyObject_Free
+from cpython.object cimport PyObject, PyTypeObject
+from cpython.buffer cimport PyObject_GetBuffer
+from cpython.type cimport type
+cimport libc.stdio as stdio
+
+cdef extern from "Python.h":
+    ctypedef int Py_intptr_t
+
+cdef extern from "numpy/arrayobject.h":
+    ctypedef Py_intptr_t npy_intp
+    ctypedef size_t npy_uintp
+
+    cdef enum NPY_TYPES:
+        NPY_BOOL
+        NPY_BYTE
+        NPY_UBYTE
+        NPY_SHORT
+        NPY_USHORT
+        NPY_INT
+        NPY_UINT
+        NPY_LONG
+        NPY_ULONG
+        NPY_LONGLONG
+        NPY_ULONGLONG
+        NPY_FLOAT
+        NPY_DOUBLE
+        NPY_LONGDOUBLE
+        NPY_CFLOAT
+        NPY_CDOUBLE
+        NPY_CLONGDOUBLE
+        NPY_OBJECT
+        NPY_STRING
+        NPY_UNICODE
+        NPY_VOID
+        NPY_DATETIME
+        NPY_TIMEDELTA
+        NPY_NTYPES
+        NPY_NOTYPE
+
+        NPY_INT8
+        NPY_INT16
+        NPY_INT32
+        NPY_INT64
+        NPY_INT128
+        NPY_INT256
+        NPY_UINT8
+        NPY_UINT16
+        NPY_UINT32
+        NPY_UINT64
+        NPY_UINT128
+        NPY_UINT256
+        NPY_FLOAT16
+        NPY_FLOAT32
+        NPY_FLOAT64
+        NPY_FLOAT80
+        NPY_FLOAT96
+        NPY_FLOAT128
+        NPY_FLOAT256
+        NPY_COMPLEX32
+        NPY_COMPLEX64
+        NPY_COMPLEX128
+        NPY_COMPLEX160
+        NPY_COMPLEX192
+        NPY_COMPLEX256
+        NPY_COMPLEX512
+
+        NPY_INTP
+
+    ctypedef enum NPY_ORDER:
+        NPY_ANYORDER
+        NPY_CORDER
+        NPY_FORTRANORDER
+        NPY_KEEPORDER
+
+    ctypedef enum NPY_CASTING:
+        NPY_NO_CASTING
+        NPY_EQUIV_CASTING
+        NPY_SAFE_CASTING
+        NPY_SAME_KIND_CASTING
+        NPY_UNSAFE_CASTING
+
+    ctypedef enum NPY_CLIPMODE:
+        NPY_CLIP
+        NPY_WRAP
+        NPY_RAISE
+
+    ctypedef enum NPY_SCALARKIND:
+        NPY_NOSCALAR,
+        NPY_BOOL_SCALAR,
+        NPY_INTPOS_SCALAR,
+        NPY_INTNEG_SCALAR,
+        NPY_FLOAT_SCALAR,
+        NPY_COMPLEX_SCALAR,
+        NPY_OBJECT_SCALAR
+
+    ctypedef enum NPY_SORTKIND:
+        NPY_QUICKSORT
+        NPY_HEAPSORT
+        NPY_MERGESORT
+
+    ctypedef enum NPY_SEARCHSIDE:
+        NPY_SEARCHLEFT
+        NPY_SEARCHRIGHT
+
+    enum:
+        # DEPRECATED since NumPy 1.7 ! Do not use in new code!
+        NPY_C_CONTIGUOUS
+        NPY_F_CONTIGUOUS
+        NPY_CONTIGUOUS
+        NPY_FORTRAN
+        NPY_OWNDATA
+        NPY_FORCECAST
+        NPY_ENSURECOPY
+        NPY_ENSUREARRAY
+        NPY_ELEMENTSTRIDES
+        NPY_ALIGNED
+        NPY_NOTSWAPPED
+        NPY_WRITEABLE
+        NPY_UPDATEIFCOPY
+        NPY_ARR_HAS_DESCR
+
+        NPY_BEHAVED
+        NPY_BEHAVED_NS
+        NPY_CARRAY
+        NPY_CARRAY_RO
+        NPY_FARRAY
+        NPY_FARRAY_RO
+        NPY_DEFAULT
+
+        NPY_IN_ARRAY
+        NPY_OUT_ARRAY
+        NPY_INOUT_ARRAY
+        NPY_IN_FARRAY
+        NPY_OUT_FARRAY
+        NPY_INOUT_FARRAY
+
+        NPY_UPDATE_ALL
+
+    enum:
+        # Added in NumPy 1.7 to replace the deprecated enums above.
+        NPY_ARRAY_C_CONTIGUOUS
+        NPY_ARRAY_F_CONTIGUOUS
+        NPY_ARRAY_OWNDATA
+        NPY_ARRAY_FORCECAST
+        NPY_ARRAY_ENSURECOPY
+        NPY_ARRAY_ENSUREARRAY
+        NPY_ARRAY_ELEMENTSTRIDES
+        NPY_ARRAY_ALIGNED
+        NPY_ARRAY_NOTSWAPPED
+        NPY_ARRAY_WRITEABLE
+        NPY_ARRAY_UPDATEIFCOPY
+
+        NPY_ARRAY_BEHAVED
+        NPY_ARRAY_BEHAVED_NS
+        NPY_ARRAY_CARRAY
+        NPY_ARRAY_CARRAY_RO
+        NPY_ARRAY_FARRAY
+        NPY_ARRAY_FARRAY_RO
+        NPY_ARRAY_DEFAULT
+
+        NPY_ARRAY_IN_ARRAY
+        NPY_ARRAY_OUT_ARRAY
+        NPY_ARRAY_INOUT_ARRAY
+        NPY_ARRAY_IN_FARRAY
+        NPY_ARRAY_OUT_FARRAY
+        NPY_ARRAY_INOUT_FARRAY
+
+        NPY_ARRAY_UPDATE_ALL
+
+    cdef enum:
+        NPY_MAXDIMS
+
+    npy_intp NPY_MAX_ELSIZE
+
+    ctypedef void (*PyArray_VectorUnaryFunc)(void *, void *, npy_intp, void *,  void *)
+
+    ctypedef struct PyArray_ArrayDescr:
+        # shape is a tuple, but Cython doesn't support "tuple shape"
+        # inside a non-PyObject declaration, so we have to declare it
+        # as just a PyObject*.
+        PyObject* shape
+
+    ctypedef struct PyArray_Descr:
+        pass
+
+    ctypedef class numpy.dtype [object PyArray_Descr, check_size ignore]:
+        # Use PyDataType_* macros when possible, however there are no macros
+        # for accessing some of the fields, so some are defined.
+        cdef PyTypeObject* typeobj
+        cdef char kind
+        cdef char type
+        # Numpy sometimes mutates this without warning (e.g. it'll
+        # sometimes change "|" to "<" in shared dtype objects on
+        # little-endian machines). If this matters to you, use
+        # PyArray_IsNativeByteOrder(dtype.byteorder) instead of
+        # directly accessing this field.
+        cdef char byteorder
+        cdef char flags
+        cdef int type_num
+        cdef int itemsize "elsize"
+        cdef int alignment
+        cdef dict fields
+        cdef tuple names
+        # Use PyDataType_HASSUBARRAY to test whether this field is
+        # valid (the pointer can be NULL). Most users should access
+        # this field via the inline helper method PyDataType_SHAPE.
+        cdef PyArray_ArrayDescr* subarray
+
+    ctypedef class numpy.flatiter [object PyArrayIterObject, check_size ignore]:
+        # Use through macros
+        pass
+
+    ctypedef class numpy.broadcast [object PyArrayMultiIterObject, check_size ignore]:
+        cdef int numiter
+        cdef npy_intp size, index
+        cdef int nd
+        cdef npy_intp *dimensions
+        cdef void **iters
+
+    ctypedef struct PyArrayObject:
+        # For use in situations where ndarray can't replace PyArrayObject*,
+        # like PyArrayObject**.
+        pass
+
+    ctypedef class numpy.ndarray [object PyArrayObject, check_size ignore]:
+        cdef __cythonbufferdefaults__ = {"mode": "strided"}
+
+        cdef:
+            # Only taking a few of the most commonly used and stable fields.
+            # One should use PyArray_* macros instead to access the C fields.
+            char *data
+            int ndim "nd"
+            npy_intp *shape "dimensions"
+            npy_intp *strides
+            dtype descr  # deprecated since NumPy 1.7 !
+            PyObject* base #  NOT PUBLIC, DO NOT USE !
+
+
+
+    ctypedef unsigned char      npy_bool
+
+    ctypedef signed char      npy_byte
+    ctypedef signed short     npy_short
+    ctypedef signed int       npy_int
+    ctypedef signed long      npy_long
+    ctypedef signed long long npy_longlong
+
+    ctypedef unsigned char      npy_ubyte
+    ctypedef unsigned short     npy_ushort
+    ctypedef unsigned int       npy_uint
+    ctypedef unsigned long      npy_ulong
+    ctypedef unsigned long long npy_ulonglong
+
+    ctypedef float        npy_float
+    ctypedef double       npy_double
+    ctypedef long double  npy_longdouble
+
+    ctypedef signed char        npy_int8
+    ctypedef signed short       npy_int16
+    ctypedef signed int         npy_int32
+    ctypedef signed long long   npy_int64
+    ctypedef signed long long   npy_int96
+    ctypedef signed long long   npy_int128
+
+    ctypedef unsigned char      npy_uint8
+    ctypedef unsigned short     npy_uint16
+    ctypedef unsigned int       npy_uint32
+    ctypedef unsigned long long npy_uint64
+    ctypedef unsigned long long npy_uint96
+    ctypedef unsigned long long npy_uint128
+
+    ctypedef float        npy_float32
+    ctypedef double       npy_float64
+    ctypedef long double  npy_float80
+    ctypedef long double  npy_float96
+    ctypedef long double  npy_float128
+
+    ctypedef struct npy_cfloat:
+        double real
+        double imag
+
+    ctypedef struct npy_cdouble:
+        double real
+        double imag
+
+    ctypedef struct npy_clongdouble:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex64:
+        float real
+        float imag
+
+    ctypedef struct npy_complex128:
+        double real
+        double imag
+
+    ctypedef struct npy_complex160:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex192:
+        long double real
+        long double imag
+
+    ctypedef struct npy_complex256:
+        long double real
+        long double imag
+
+    ctypedef struct PyArray_Dims:
+        npy_intp *ptr
+        int len
+
+    int _import_array() except -1
+    # A second definition so _import_array isn't marked as used when we use it here.
+    # Do not use - subject to change any time.
+    int __pyx_import_array "_import_array"() except -1
+
+    #
+    # Macros from ndarrayobject.h
+    #
+    bint PyArray_CHKFLAGS(ndarray m, int flags) nogil
+    bint PyArray_IS_C_CONTIGUOUS(ndarray arr) nogil
+    bint PyArray_IS_F_CONTIGUOUS(ndarray arr) nogil
+    bint PyArray_ISCONTIGUOUS(ndarray m) nogil
+    bint PyArray_ISWRITEABLE(ndarray m) nogil
+    bint PyArray_ISALIGNED(ndarray m) nogil
+
+    int PyArray_NDIM(ndarray) nogil
+    bint PyArray_ISONESEGMENT(ndarray) nogil
+    bint PyArray_ISFORTRAN(ndarray) nogil
+    int PyArray_FORTRANIF(ndarray) nogil
+
+    void* PyArray_DATA(ndarray) nogil
+    char* PyArray_BYTES(ndarray) nogil
+
+    npy_intp* PyArray_DIMS(ndarray) nogil
+    npy_intp* PyArray_STRIDES(ndarray) nogil
+    npy_intp PyArray_DIM(ndarray, size_t) nogil
+    npy_intp PyArray_STRIDE(ndarray, size_t) nogil
+
+    PyObject *PyArray_BASE(ndarray) nogil  # returns borrowed reference!
+    PyArray_Descr *PyArray_DESCR(ndarray) nogil  # returns borrowed reference to dtype!
+    int PyArray_FLAGS(ndarray) nogil
+    npy_intp PyArray_ITEMSIZE(ndarray) nogil
+    int PyArray_TYPE(ndarray arr) nogil
+
+    object PyArray_GETITEM(ndarray arr, void *itemptr)
+    int PyArray_SETITEM(ndarray arr, void *itemptr, object obj)
+
+    bint PyTypeNum_ISBOOL(int) nogil
+    bint PyTypeNum_ISUNSIGNED(int) nogil
+    bint PyTypeNum_ISSIGNED(int) nogil
+    bint PyTypeNum_ISINTEGER(int) nogil
+    bint PyTypeNum_ISFLOAT(int) nogil
+    bint PyTypeNum_ISNUMBER(int) nogil
+    bint PyTypeNum_ISSTRING(int) nogil
+    bint PyTypeNum_ISCOMPLEX(int) nogil
+    bint PyTypeNum_ISPYTHON(int) nogil
+    bint PyTypeNum_ISFLEXIBLE(int) nogil
+    bint PyTypeNum_ISUSERDEF(int) nogil
+    bint PyTypeNum_ISEXTENDED(int) nogil
+    bint PyTypeNum_ISOBJECT(int) nogil
+
+    bint PyDataType_ISBOOL(dtype) nogil
+    bint PyDataType_ISUNSIGNED(dtype) nogil
+    bint PyDataType_ISSIGNED(dtype) nogil
+    bint PyDataType_ISINTEGER(dtype) nogil
+    bint PyDataType_ISFLOAT(dtype) nogil
+    bint PyDataType_ISNUMBER(dtype) nogil
+    bint PyDataType_ISSTRING(dtype) nogil
+    bint PyDataType_ISCOMPLEX(dtype) nogil
+    bint PyDataType_ISPYTHON(dtype) nogil
+    bint PyDataType_ISFLEXIBLE(dtype) nogil
+    bint PyDataType_ISUSERDEF(dtype) nogil
+    bint PyDataType_ISEXTENDED(dtype) nogil
+    bint PyDataType_ISOBJECT(dtype) nogil
+    bint PyDataType_HASFIELDS(dtype) nogil
+    bint PyDataType_HASSUBARRAY(dtype) nogil
+
+    bint PyArray_ISBOOL(ndarray) nogil
+    bint PyArray_ISUNSIGNED(ndarray) nogil
+    bint PyArray_ISSIGNED(ndarray) nogil
+    bint PyArray_ISINTEGER(ndarray) nogil
+    bint PyArray_ISFLOAT(ndarray) nogil
+    bint PyArray_ISNUMBER(ndarray) nogil
+    bint PyArray_ISSTRING(ndarray) nogil
+    bint PyArray_ISCOMPLEX(ndarray) nogil
+    bint PyArray_ISPYTHON(ndarray) nogil
+    bint PyArray_ISFLEXIBLE(ndarray) nogil
+    bint PyArray_ISUSERDEF(ndarray) nogil
+    bint PyArray_ISEXTENDED(ndarray) nogil
+    bint PyArray_ISOBJECT(ndarray) nogil
+    bint PyArray_HASFIELDS(ndarray) nogil
+
+    bint PyArray_ISVARIABLE(ndarray) nogil
+
+    bint PyArray_SAFEALIGNEDCOPY(ndarray) nogil
+    bint PyArray_ISNBO(char) nogil              # works on ndarray.byteorder
+    bint PyArray_IsNativeByteOrder(char) nogil # works on ndarray.byteorder
+    bint PyArray_ISNOTSWAPPED(ndarray) nogil
+    bint PyArray_ISBYTESWAPPED(ndarray) nogil
+
+    bint PyArray_FLAGSWAP(ndarray, int) nogil
+
+    bint PyArray_ISCARRAY(ndarray) nogil
+    bint PyArray_ISCARRAY_RO(ndarray) nogil
+    bint PyArray_ISFARRAY(ndarray) nogil
+    bint PyArray_ISFARRAY_RO(ndarray) nogil
+    bint PyArray_ISBEHAVED(ndarray) nogil
+    bint PyArray_ISBEHAVED_RO(ndarray) nogil
+
+
+    bint PyDataType_ISNOTSWAPPED(dtype) nogil
+    bint PyDataType_ISBYTESWAPPED(dtype) nogil
+
+    bint PyArray_DescrCheck(object)
+
+    bint PyArray_Check(object)
+    bint PyArray_CheckExact(object)
+
+    # Cannot be supported due to out arg:
+    # bint PyArray_HasArrayInterfaceType(object, dtype, object, object&)
+    # bint PyArray_HasArrayInterface(op, out)
+
+
+    bint PyArray_IsZeroDim(object)
+    # Cannot be supported due to ## ## in macro:
+    # bint PyArray_IsScalar(object, verbatim work)
+    bint PyArray_CheckScalar(object)
+    bint PyArray_IsPythonNumber(object)
+    bint PyArray_IsPythonScalar(object)
+    bint PyArray_IsAnyScalar(object)
+    bint PyArray_CheckAnyScalar(object)
+
+    ndarray PyArray_GETCONTIGUOUS(ndarray)
+    bint PyArray_SAMESHAPE(ndarray, ndarray) nogil
+    npy_intp PyArray_SIZE(ndarray) nogil
+    npy_intp PyArray_NBYTES(ndarray) nogil
+
+    object PyArray_FROM_O(object)
+    object PyArray_FROM_OF(object m, int flags)
+    object PyArray_FROM_OT(object m, int type)
+    object PyArray_FROM_OTF(object m, int type, int flags)
+    object PyArray_FROMANY(object m, int type, int min, int max, int flags)
+    object PyArray_ZEROS(int nd, npy_intp* dims, int type, int fortran)
+    object PyArray_EMPTY(int nd, npy_intp* dims, int type, int fortran)
+    void PyArray_FILLWBYTE(object, int val)
+    npy_intp PyArray_REFCOUNT(object)
+    object PyArray_ContiguousFromAny(op, int, int min_depth, int max_depth)
+    unsigned char PyArray_EquivArrTypes(ndarray a1, ndarray a2)
+    bint PyArray_EquivByteorders(int b1, int b2) nogil
+    object PyArray_SimpleNew(int nd, npy_intp* dims, int typenum)
+    object PyArray_SimpleNewFromData(int nd, npy_intp* dims, int typenum, void* data)
+    #object PyArray_SimpleNewFromDescr(int nd, npy_intp* dims, dtype descr)
+    object PyArray_ToScalar(void* data, ndarray arr)
+
+    void* PyArray_GETPTR1(ndarray m, npy_intp i) nogil
+    void* PyArray_GETPTR2(ndarray m, npy_intp i, npy_intp j) nogil
+    void* PyArray_GETPTR3(ndarray m, npy_intp i, npy_intp j, npy_intp k) nogil
+    void* PyArray_GETPTR4(ndarray m, npy_intp i, npy_intp j, npy_intp k, npy_intp l) nogil
+
+    void PyArray_XDECREF_ERR(ndarray)
+    # Cannot be supported due to out arg
+    # void PyArray_DESCR_REPLACE(descr)
+
+
+    object PyArray_Copy(ndarray)
+    object PyArray_FromObject(object op, int type, int min_depth, int max_depth)
+    object PyArray_ContiguousFromObject(object op, int type, int min_depth, int max_depth)
+    object PyArray_CopyFromObject(object op, int type, int min_depth, int max_depth)
+
+    object PyArray_Cast(ndarray mp, int type_num)
+    object PyArray_Take(ndarray ap, object items, int axis)
+    object PyArray_Put(ndarray ap, object items, object values)
+
+    void PyArray_ITER_RESET(flatiter it) nogil
+    void PyArray_ITER_NEXT(flatiter it) nogil
+    void PyArray_ITER_GOTO(flatiter it, npy_intp* destination) nogil
+    void PyArray_ITER_GOTO1D(flatiter it, npy_intp ind) nogil
+    void* PyArray_ITER_DATA(flatiter it) nogil
+    bint PyArray_ITER_NOTDONE(flatiter it) nogil
+
+    void PyArray_MultiIter_RESET(broadcast multi) nogil
+    void PyArray_MultiIter_NEXT(broadcast multi) nogil
+    void PyArray_MultiIter_GOTO(broadcast multi, npy_intp dest) nogil
+    void PyArray_MultiIter_GOTO1D(broadcast multi, npy_intp ind) nogil
+    void* PyArray_MultiIter_DATA(broadcast multi, npy_intp i) nogil
+    void PyArray_MultiIter_NEXTi(broadcast multi, npy_intp i) nogil
+    bint PyArray_MultiIter_NOTDONE(broadcast multi) nogil
+
+    # Functions from __multiarray_api.h
+
+    # Functions taking dtype and returning object/ndarray are disabled
+    # for now as they steal dtype references. I'm conservative and disable
+    # more than is probably needed until it can be checked further.
+    int PyArray_SetNumericOps        (object)
+    object PyArray_GetNumericOps ()
+    int PyArray_INCREF (ndarray)
+    int PyArray_XDECREF (ndarray)
+    void PyArray_SetStringFunction (object, int)
+    dtype PyArray_DescrFromType (int)
+    object PyArray_TypeObjectFromType (int)
+    char * PyArray_Zero (ndarray)
+    char * PyArray_One (ndarray)
+    #object PyArray_CastToType (ndarray, dtype, int)
+    int PyArray_CastTo (ndarray, ndarray)
+    int PyArray_CastAnyTo (ndarray, ndarray)
+    int PyArray_CanCastSafely (int, int)
+    npy_bool PyArray_CanCastTo (dtype, dtype)
+    int PyArray_ObjectType (object, int)
+    dtype PyArray_DescrFromObject (object, dtype)
+    #ndarray* PyArray_ConvertToCommonType (object, int *)
+    dtype PyArray_DescrFromScalar (object)
+    dtype PyArray_DescrFromTypeObject (object)
+    npy_intp PyArray_Size (object)
+    #object PyArray_Scalar (void *, dtype, object)
+    #object PyArray_FromScalar (object, dtype)
+    void PyArray_ScalarAsCtype (object, void *)
+    #int PyArray_CastScalarToCtype (object, void *, dtype)
+    #int PyArray_CastScalarDirect (object, dtype, void *, int)
+    object PyArray_ScalarFromObject (object)
+    #PyArray_VectorUnaryFunc * PyArray_GetCastFunc (dtype, int)
+    object PyArray_FromDims (int, int *, int)
+    #object PyArray_FromDimsAndDataAndDescr (int, int *, dtype, char *)
+    #object PyArray_FromAny (object, dtype, int, int, int, object)
+    object PyArray_EnsureArray (object)
+    object PyArray_EnsureAnyArray (object)
+    #object PyArray_FromFile (stdio.FILE *, dtype, npy_intp, char *)
+    #object PyArray_FromString (char *, npy_intp, dtype, npy_intp, char *)
+    #object PyArray_FromBuffer (object, dtype, npy_intp, npy_intp)
+    #object PyArray_FromIter (object, dtype, npy_intp)
+    object PyArray_Return (ndarray)
+    #object PyArray_GetField (ndarray, dtype, int)
+    #int PyArray_SetField (ndarray, dtype, int, object)
+    object PyArray_Byteswap (ndarray, npy_bool)
+    object PyArray_Resize (ndarray, PyArray_Dims *, int, NPY_ORDER)
+    int PyArray_MoveInto (ndarray, ndarray)
+    int PyArray_CopyInto (ndarray, ndarray)
+    int PyArray_CopyAnyInto (ndarray, ndarray)
+    int PyArray_CopyObject (ndarray, object)
+    object PyArray_NewCopy (ndarray, NPY_ORDER)
+    object PyArray_ToList (ndarray)
+    object PyArray_ToString (ndarray, NPY_ORDER)
+    int PyArray_ToFile (ndarray, stdio.FILE *, char *, char *)
+    int PyArray_Dump (object, object, int)
+    object PyArray_Dumps (object, int)
+    int PyArray_ValidType (int)
+    void PyArray_UpdateFlags (ndarray, int)
+    object PyArray_New (type, int, npy_intp *, int, npy_intp *, void *, int, int, object)
+    #object PyArray_NewFromDescr (type, dtype, int, npy_intp *, npy_intp *, void *, int, object)
+    #dtype PyArray_DescrNew (dtype)
+    dtype PyArray_DescrNewFromType (int)
+    double PyArray_GetPriority (object, double)
+    object PyArray_IterNew (object)
+    object PyArray_MultiIterNew (int, ...)
+
+    int PyArray_PyIntAsInt (object)
+    npy_intp PyArray_PyIntAsIntp (object)
+    int PyArray_Broadcast (broadcast)
+    void PyArray_FillObjectArray (ndarray, object)
+    int PyArray_FillWithScalar (ndarray, object)
+    npy_bool PyArray_CheckStrides (int, int, npy_intp, npy_intp, npy_intp *, npy_intp *)
+    dtype PyArray_DescrNewByteorder (dtype, char)
+    object PyArray_IterAllButAxis (object, int *)
+    #object PyArray_CheckFromAny (object, dtype, int, int, int, object)
+    #object PyArray_FromArray (ndarray, dtype, int)
+    object PyArray_FromInterface (object)
+    object PyArray_FromStructInterface (object)
+    #object PyArray_FromArrayAttr (object, dtype, object)
+    #NPY_SCALARKIND PyArray_ScalarKind (int, ndarray*)
+    int PyArray_CanCoerceScalar (int, int, NPY_SCALARKIND)
+    object PyArray_NewFlagsObject (object)
+    npy_bool PyArray_CanCastScalar (type, type)
+    #int PyArray_CompareUCS4 (npy_ucs4 *, npy_ucs4 *, register size_t)
+    int PyArray_RemoveSmallest (broadcast)
+    int PyArray_ElementStrides (object)
+    void PyArray_Item_INCREF (char *, dtype)
+    void PyArray_Item_XDECREF (char *, dtype)
+    object PyArray_FieldNames (object)
+    object PyArray_Transpose (ndarray, PyArray_Dims *)
+    object PyArray_TakeFrom (ndarray, object, int, ndarray, NPY_CLIPMODE)
+    object PyArray_PutTo (ndarray, object, object, NPY_CLIPMODE)
+    object PyArray_PutMask (ndarray, object, object)
+    object PyArray_Repeat (ndarray, object, int)
+    object PyArray_Choose (ndarray, object, ndarray, NPY_CLIPMODE)
+    int PyArray_Sort (ndarray, int, NPY_SORTKIND)
+    object PyArray_ArgSort (ndarray, int, NPY_SORTKIND)
+    object PyArray_SearchSorted (ndarray, object, NPY_SEARCHSIDE, PyObject *)
+    object PyArray_ArgMax (ndarray, int, ndarray)
+    object PyArray_ArgMin (ndarray, int, ndarray)
+    object PyArray_Reshape (ndarray, object)
+    object PyArray_Newshape (ndarray, PyArray_Dims *, NPY_ORDER)
+    object PyArray_Squeeze (ndarray)
+    #object PyArray_View (ndarray, dtype, type)
+    object PyArray_SwapAxes (ndarray, int, int)
+    object PyArray_Max (ndarray, int, ndarray)
+    object PyArray_Min (ndarray, int, ndarray)
+    object PyArray_Ptp (ndarray, int, ndarray)
+    object PyArray_Mean (ndarray, int, int, ndarray)
+    object PyArray_Trace (ndarray, int, int, int, int, ndarray)
+    object PyArray_Diagonal (ndarray, int, int, int)
+    object PyArray_Clip (ndarray, object, object, ndarray)
+    object PyArray_Conjugate (ndarray, ndarray)
+    object PyArray_Nonzero (ndarray)
+    object PyArray_Std (ndarray, int, int, ndarray, int)
+    object PyArray_Sum (ndarray, int, int, ndarray)
+    object PyArray_CumSum (ndarray, int, int, ndarray)
+    object PyArray_Prod (ndarray, int, int, ndarray)
+    object PyArray_CumProd (ndarray, int, int, ndarray)
+    object PyArray_All (ndarray, int, ndarray)
+    object PyArray_Any (ndarray, int, ndarray)
+    object PyArray_Compress (ndarray, object, int, ndarray)
+    object PyArray_Flatten (ndarray, NPY_ORDER)
+    object PyArray_Ravel (ndarray, NPY_ORDER)
+    npy_intp PyArray_MultiplyList (npy_intp *, int)
+    int PyArray_MultiplyIntList (int *, int)
+    void * PyArray_GetPtr (ndarray, npy_intp*)
+    int PyArray_CompareLists (npy_intp *, npy_intp *, int)
+    #int PyArray_AsCArray (object*, void *, npy_intp *, int, dtype)
+    #int PyArray_As1D (object*, char **, int *, int)
+    #int PyArray_As2D (object*, char ***, int *, int *, int)
+    int PyArray_Free (object, void *)
+    #int PyArray_Converter (object, object*)
+    int PyArray_IntpFromSequence (object, npy_intp *, int)
+    object PyArray_Concatenate (object, int)
+    object PyArray_InnerProduct (object, object)
+    object PyArray_MatrixProduct (object, object)
+    object PyArray_CopyAndTranspose (object)
+    object PyArray_Correlate (object, object, int)
+    int PyArray_TypestrConvert (int, int)
+    #int PyArray_DescrConverter (object, dtype*)
+    #int PyArray_DescrConverter2 (object, dtype*)
+    int PyArray_IntpConverter (object, PyArray_Dims *)
+    #int PyArray_BufferConverter (object, chunk)
+    int PyArray_AxisConverter (object, int *)
+    int PyArray_BoolConverter (object, npy_bool *)
+    int PyArray_ByteorderConverter (object, char *)
+    int PyArray_OrderConverter (object, NPY_ORDER *)
+    unsigned char PyArray_EquivTypes (dtype, dtype)
+    #object PyArray_Zeros (int, npy_intp *, dtype, int)
+    #object PyArray_Empty (int, npy_intp *, dtype, int)
+    object PyArray_Where (object, object, object)
+    object PyArray_Arange (double, double, double, int)
+    #object PyArray_ArangeObj (object, object, object, dtype)
+    int PyArray_SortkindConverter (object, NPY_SORTKIND *)
+    object PyArray_LexSort (object, int)
+    object PyArray_Round (ndarray, int, ndarray)
+    unsigned char PyArray_EquivTypenums (int, int)
+    int PyArray_RegisterDataType (dtype)
+    int PyArray_RegisterCastFunc (dtype, int, PyArray_VectorUnaryFunc *)
+    int PyArray_RegisterCanCast (dtype, int, NPY_SCALARKIND)
+    #void PyArray_InitArrFuncs (PyArray_ArrFuncs *)
+    object PyArray_IntTupleFromIntp (int, npy_intp *)
+    int PyArray_TypeNumFromName (char *)
+    int PyArray_ClipmodeConverter (object, NPY_CLIPMODE *)
+    #int PyArray_OutputConverter (object, ndarray*)
+    object PyArray_BroadcastToShape (object, npy_intp *, int)
+    void _PyArray_SigintHandler (int)
+    void* _PyArray_GetSigintBuf ()
+    #int PyArray_DescrAlignConverter (object, dtype*)
+    #int PyArray_DescrAlignConverter2 (object, dtype*)
+    int PyArray_SearchsideConverter (object, void *)
+    object PyArray_CheckAxis (ndarray, int *, int)
+    npy_intp PyArray_OverflowMultiplyList (npy_intp *, int)
+    int PyArray_CompareString (char *, char *, size_t)
+    int PyArray_SetBaseObject(ndarray, base)  # NOTE: steals a reference to base! Use "set_array_base()" instead.
+
+
+# Typedefs that matches the runtime dtype objects in
+# the numpy module.
+
+# The ones that are commented out needs an IFDEF function
+# in Cython to enable them only on the right systems.
+
+ctypedef npy_int8       int8_t
+ctypedef npy_int16      int16_t
+ctypedef npy_int32      int32_t
+ctypedef npy_int64      int64_t
+#ctypedef npy_int96      int96_t
+#ctypedef npy_int128     int128_t
+
+ctypedef npy_uint8      uint8_t
+ctypedef npy_uint16     uint16_t
+ctypedef npy_uint32     uint32_t
+ctypedef npy_uint64     uint64_t
+#ctypedef npy_uint96     uint96_t
+#ctypedef npy_uint128    uint128_t
+
+ctypedef npy_float32    float32_t
+ctypedef npy_float64    float64_t
+#ctypedef npy_float80    float80_t
+#ctypedef npy_float128   float128_t
+
+ctypedef float complex  complex64_t
+ctypedef double complex complex128_t
+
+# The int types are mapped a bit surprising --
+# numpy.int corresponds to 'l' and numpy.long to 'q'
+ctypedef npy_long       int_t
+ctypedef npy_longlong   long_t
+ctypedef npy_longlong   longlong_t
+
+ctypedef npy_ulong      uint_t
+ctypedef npy_ulonglong  ulong_t
+ctypedef npy_ulonglong  ulonglong_t
+
+ctypedef npy_intp       intp_t
+ctypedef npy_uintp      uintp_t
+
+ctypedef npy_double     float_t
+ctypedef npy_double     double_t
+ctypedef npy_longdouble longdouble_t
+
+ctypedef npy_cfloat      cfloat_t
+ctypedef npy_cdouble     cdouble_t
+ctypedef npy_clongdouble clongdouble_t
+
+ctypedef npy_cdouble     complex_t
+
+cdef inline object PyArray_MultiIterNew1(a):
+    return PyArray_MultiIterNew(1, <void*>a)
+
+cdef inline object PyArray_MultiIterNew2(a, b):
+    return PyArray_MultiIterNew(2, <void*>a, <void*>b)
+
+cdef inline object PyArray_MultiIterNew3(a, b, c):
+    return PyArray_MultiIterNew(3, <void*>a, <void*>b, <void*> c)
+
+cdef inline object PyArray_MultiIterNew4(a, b, c, d):
+    return PyArray_MultiIterNew(4, <void*>a, <void*>b, <void*>c, <void*> d)
+
+cdef inline object PyArray_MultiIterNew5(a, b, c, d, e):
+    return PyArray_MultiIterNew(5, <void*>a, <void*>b, <void*>c, <void*> d, <void*> e)
+
+cdef inline tuple PyDataType_SHAPE(dtype d):
+    if PyDataType_HASSUBARRAY(d):
+        return <tuple>d.subarray.shape
+    else:
+        return ()
+
+
+#
+# ufunc API
+#
+
+cdef extern from "numpy/ufuncobject.h":
+
+    ctypedef void (*PyUFuncGenericFunction) (char **, npy_intp *, npy_intp *, void *)
+
+    ctypedef class numpy.ufunc [object PyUFuncObject, check_size ignore]:
+        cdef:
+            int nin, nout, nargs
+            int identity
+            PyUFuncGenericFunction *functions
+            void **data
+            int ntypes
+            int check_return
+            char *name
+            char *types
+            char *doc
+            void *ptr
+            PyObject *obj
+            PyObject *userloops
+
+    cdef enum:
+        PyUFunc_Zero
+        PyUFunc_One
+        PyUFunc_None
+        UFUNC_ERR_IGNORE
+        UFUNC_ERR_WARN
+        UFUNC_ERR_RAISE
+        UFUNC_ERR_CALL
+        UFUNC_ERR_PRINT
+        UFUNC_ERR_LOG
+        UFUNC_MASK_DIVIDEBYZERO
+        UFUNC_MASK_OVERFLOW
+        UFUNC_MASK_UNDERFLOW
+        UFUNC_MASK_INVALID
+        UFUNC_SHIFT_DIVIDEBYZERO
+        UFUNC_SHIFT_OVERFLOW
+        UFUNC_SHIFT_UNDERFLOW
+        UFUNC_SHIFT_INVALID
+        UFUNC_FPE_DIVIDEBYZERO
+        UFUNC_FPE_OVERFLOW
+        UFUNC_FPE_UNDERFLOW
+        UFUNC_FPE_INVALID
+        UFUNC_ERR_DEFAULT
+        UFUNC_ERR_DEFAULT2
+
+    object PyUFunc_FromFuncAndData(PyUFuncGenericFunction *,
+          void **, char *, int, int, int, int, char *, char *, int)
+    int PyUFunc_RegisterLoopForType(ufunc, int,
+                                    PyUFuncGenericFunction, int *, void *)
+    int PyUFunc_GenericFunction \
+        (ufunc, PyObject *, PyObject *, PyArrayObject **)
+    void PyUFunc_f_f_As_d_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_d_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_f_f \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_g_g \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_F_F_As_D_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_F_F \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_D_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_G_G \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_O_O \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_ff_f_As_dd_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_ff_f \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_dd_d \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_gg_g \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_FF_F_As_DD_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_DD_D \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_FF_F \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_GG_G \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_OO_O \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_O_O_method \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_OO_O_method \
+         (char **, npy_intp *, npy_intp *, void *)
+    void PyUFunc_On_Om \
+         (char **, npy_intp *, npy_intp *, void *)
+    int PyUFunc_GetPyValues \
+        (char *, int *, int *, PyObject **)
+    int PyUFunc_checkfperr \
+           (int, PyObject *, int *)
+    void PyUFunc_clearfperr()
+    int PyUFunc_getfperr()
+    int PyUFunc_handlefperr \
+        (int, PyObject *, int, int *)
+    int PyUFunc_ReplaceLoopBySignature \
+        (ufunc, PyUFuncGenericFunction, int *, PyUFuncGenericFunction *)
+    object PyUFunc_FromFuncAndDataAndSignature \
+             (PyUFuncGenericFunction *, void **, char *, int, int, int,
+              int, char *, char *, int, char *)
+
+    int _import_umath() except -1
+
+cdef inline void set_array_base(ndarray arr, object base):
+    Py_INCREF(base) # important to do this before stealing the reference below!
+    PyArray_SetBaseObject(arr, base)
+
+cdef inline object get_array_base(ndarray arr):
+    base = PyArray_BASE(arr)
+    if base is NULL:
+        return None
+    return <object>base
+
+# Versions of the import_* functions which are more suitable for
+# Cython code.
+cdef inline int import_array() except -1:
+    try:
+        __pyx_import_array()
+    except Exception:
+        raise ImportError("numpy.core.multiarray failed to import")
+
+cdef inline int import_umath() except -1:
+    try:
+        _import_umath()
+    except Exception:
+        raise ImportError("numpy.core.umath failed to import")
+
+cdef inline int import_ufunc() except -1:
+    try:
+        _import_umath()
+    except Exception:
+        raise ImportError("numpy.core.umath failed to import")
+
+cdef extern from *:
+    # Leave a marker that the NumPy declarations came from this file
+    # See https://github.com/cython/cython/issues/3573
+    """
+    /* NumPy API declarations from "numpy/__init__.pxd" */
+    """
diff --git a/venv/Lib/site-packages/numpy/__init__.py b/venv/Lib/site-packages/numpy/__init__.py
new file mode 100644
index 000000000..70c336106
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/__init__.py
@@ -0,0 +1,315 @@
+"""
+NumPy
+=====
+
+Provides
+  1. An array object of arbitrary homogeneous items
+  2. Fast mathematical operations over arrays
+  3. Linear Algebra, Fourier Transforms, Random Number Generation
+
+How to use the documentation
+----------------------------
+Documentation is available in two forms: docstrings provided
+with the code, and a loose standing reference guide, available from
+`the NumPy homepage <https://www.scipy.org>`_.
+
+We recommend exploring the docstrings using
+`IPython <https://ipython.org>`_, an advanced Python shell with
+TAB-completion and introspection capabilities.  See below for further
+instructions.
+
+The docstring examples assume that `numpy` has been imported as `np`::
+
+  >>> import numpy as np
+
+Code snippets are indicated by three greater-than signs::
+
+  >>> x = 42
+  >>> x = x + 1
+
+Use the built-in ``help`` function to view a function's docstring::
+
+  >>> help(np.sort)
+  ... # doctest: +SKIP
+
+For some objects, ``np.info(obj)`` may provide additional help.  This is
+particularly true if you see the line "Help on ufunc object:" at the top
+of the help() page.  Ufuncs are implemented in C, not Python, for speed.
+The native Python help() does not know how to view their help, but our
+np.info() function does.
+
+To search for documents containing a keyword, do::
+
+  >>> np.lookfor('keyword')
+  ... # doctest: +SKIP
+
+General-purpose documents like a glossary and help on the basic concepts
+of numpy are available under the ``doc`` sub-module::
+
+  >>> from numpy import doc
+  >>> help(doc)
+  ... # doctest: +SKIP
+
+Available subpackages
+---------------------
+doc
+    Topical documentation on broadcasting, indexing, etc.
+lib
+    Basic functions used by several sub-packages.
+random
+    Core Random Tools
+linalg
+    Core Linear Algebra Tools
+fft
+    Core FFT routines
+polynomial
+    Polynomial tools
+testing
+    NumPy testing tools
+f2py
+    Fortran to Python Interface Generator.
+distutils
+    Enhancements to distutils with support for
+    Fortran compilers support and more.
+
+Utilities
+---------
+test
+    Run numpy unittests
+show_config
+    Show numpy build configuration
+dual
+    Overwrite certain functions with high-performance Scipy tools
+matlib
+    Make everything matrices.
+__version__
+    NumPy version string
+
+Viewing documentation using IPython
+-----------------------------------
+Start IPython with the NumPy profile (``ipython -p numpy``), which will
+import `numpy` under the alias `np`.  Then, use the ``cpaste`` command to
+paste examples into the shell.  To see which functions are available in
+`numpy`, type ``np.<TAB>`` (where ``<TAB>`` refers to the TAB key), or use
+``np.*cos*?<ENTER>`` (where ``<ENTER>`` refers to the ENTER key) to narrow
+down the list.  To view the docstring for a function, use
+``np.cos?<ENTER>`` (to view the docstring) and ``np.cos??<ENTER>`` (to view
+the source code).
+
+Copies vs. in-place operation
+-----------------------------
+Most of the functions in `numpy` return a copy of the array argument
+(e.g., `np.sort`).  In-place versions of these functions are often
+available as array methods, i.e. ``x = np.array([1,2,3]); x.sort()``.
+Exceptions to this rule are documented.
+
+"""
+import sys
+import warnings
+
+from ._globals import ModuleDeprecationWarning, VisibleDeprecationWarning
+from ._globals import _NoValue
+
+# We first need to detect if we're being called as part of the numpy setup
+# procedure itself in a reliable manner.
+try:
+    __NUMPY_SETUP__
+except NameError:
+    __NUMPY_SETUP__ = False
+
+if __NUMPY_SETUP__:
+    sys.stderr.write('Running from numpy source directory.\n')
+else:
+    try:
+        from numpy.__config__ import show as show_config
+    except ImportError:
+        msg = """Error importing numpy: you should not try to import numpy from
+        its source directory; please exit the numpy source tree, and relaunch
+        your python interpreter from there."""
+        raise ImportError(msg)
+
+    from .version import git_revision as __git_revision__
+    from .version import version as __version__
+
+    __all__ = ['ModuleDeprecationWarning',
+               'VisibleDeprecationWarning']
+
+    # Allow distributors to run custom init code
+    from . import _distributor_init
+
+    from . import core
+    from .core import *
+    from . import compat
+    from . import lib
+    # NOTE: to be revisited following future namespace cleanup.
+    # See gh-14454 and gh-15672 for discussion.
+    from .lib import *
+
+    from . import linalg
+    from . import fft
+    from . import polynomial
+    from . import random
+    from . import ctypeslib
+    from . import ma
+    from . import matrixlib as _mat
+    from .matrixlib import *
+
+    # Make these accessible from numpy name-space
+    # but not imported in from numpy import *
+    # TODO[gh-6103]: Deprecate these
+    from builtins import bool, int, float, complex, object, str
+    from .compat import long, unicode
+
+    from .core import round, abs, max, min
+    # now that numpy modules are imported, can initialize limits
+    core.getlimits._register_known_types()
+
+    __all__.extend(['__version__', 'show_config'])
+    __all__.extend(core.__all__)
+    __all__.extend(_mat.__all__)
+    __all__.extend(lib.__all__)
+    __all__.extend(['linalg', 'fft', 'random', 'ctypeslib', 'ma'])
+
+    # These are added by `from .core import *` and `core.__all__`, but we
+    # overwrite them above with builtins we do _not_ want to export.
+    __all__.remove('long')
+    __all__.remove('unicode')
+
+    # Remove things that are in the numpy.lib but not in the numpy namespace
+    # Note that there is a test (numpy/tests/test_public_api.py:test_numpy_namespace)
+    # that prevents adding more things to the main namespace by accident.
+    # The list below will grow until the `from .lib import *` fixme above is
+    # taken care of
+    __all__.remove('Arrayterator')
+    del Arrayterator
+
+    # Filter out Cython harmless warnings
+    warnings.filterwarnings("ignore", message="numpy.dtype size changed")
+    warnings.filterwarnings("ignore", message="numpy.ufunc size changed")
+    warnings.filterwarnings("ignore", message="numpy.ndarray size changed")
+
+    # oldnumeric and numarray were removed in 1.9. In case some packages import
+    # but do not use them, we define them here for backward compatibility.
+    oldnumeric = 'removed'
+    numarray = 'removed'
+
+    if sys.version_info[:2] >= (3, 7):
+        # Importing Tester requires importing all of UnitTest which is not a
+        # cheap import Since it is mainly used in test suits, we lazy import it
+        # here to save on the order of 10 ms of import time for most users
+        #
+        # The previous way Tester was imported also had a side effect of adding
+        # the full `numpy.testing` namespace
+        #
+        # module level getattr is only supported in 3.7 onwards
+        # https://www.python.org/dev/peps/pep-0562/
+        def __getattr__(attr):
+            if attr == 'testing':
+                import numpy.testing as testing
+                return testing
+            elif attr == 'Tester':
+                from .testing import Tester
+                return Tester
+            else:
+                raise AttributeError("module {!r} has no attribute "
+                                     "{!r}".format(__name__, attr))
+
+        def __dir__():
+            return list(globals().keys() | {'Tester', 'testing'})
+
+    else:
+        # We don't actually use this ourselves anymore, but I'm not 100% sure that
+        # no-one else in the world is using it (though I hope not)
+        from .testing import Tester
+
+    # Pytest testing
+    from numpy._pytesttester import PytestTester
+    test = PytestTester(__name__)
+    del PytestTester
+
+
+    def _sanity_check():
+        """
+        Quick sanity checks for common bugs caused by environment.
+        There are some cases e.g. with wrong BLAS ABI that cause wrong
+        results under specific runtime conditions that are not necessarily
+        achieved during test suite runs, and it is useful to catch those early.
+
+        See https://github.com/numpy/numpy/issues/8577 and other
+        similar bug reports.
+
+        """
+        try:
+            x = ones(2, dtype=float32)
+            if not abs(x.dot(x) - 2.0) < 1e-5:
+                raise AssertionError()
+        except AssertionError:
+            msg = ("The current Numpy installation ({!r}) fails to "
+                   "pass simple sanity checks. This can be caused for example "
+                   "by incorrect BLAS library being linked in, or by mixing "
+                   "package managers (pip, conda, apt, ...). Search closed "
+                   "numpy issues for similar problems.")
+            raise RuntimeError(msg.format(__file__))
+
+    _sanity_check()
+    del _sanity_check
+
+    def _mac_os_check():
+        """
+        Quick Sanity check for Mac OS look for accelerate build bugs.
+        Testing numpy polyfit calls init_dgelsd(LAPACK)
+        """
+        try:
+            c = array([3., 2., 1.])
+            x = linspace(0, 2, 5)
+            y = polyval(c, x)
+            _ = polyfit(x, y, 2, cov=True)
+        except ValueError:
+            pass
+
+    import sys
+    if sys.platform == "darwin":
+        with warnings.catch_warnings(record=True) as w:
+            _mac_os_check()
+            # Throw runtime error, if the test failed Check for warning and error_message
+            error_message = ""
+            if len(w) > 0:
+                error_message = "{}: {}".format(w[-1].category.__name__, str(w[-1].message))
+                msg = (
+                    "Polyfit sanity test emitted a warning, most likely due "
+                    "to using a buggy Accelerate backend. "
+                    "If you compiled yourself, "
+                    "see site.cfg.example for information. "
+                    "Otherwise report this to the vendor "
+                    "that provided NumPy.\n{}\n".format(
+                        error_message))
+                raise RuntimeError(msg)
+    del _mac_os_check
+
+    # We usually use madvise hugepages support, but on some old kernels it
+    # is slow and thus better avoided.
+    # Specifically kernel version 4.6 had a bug fix which probably fixed this:
+    # https://github.com/torvalds/linux/commit/7cf91a98e607c2f935dbcc177d70011e95b8faff
+    import os
+    use_hugepage = os.environ.get("NUMPY_MADVISE_HUGEPAGE", None)
+    if sys.platform == "linux" and use_hugepage is None:
+        # If there is an issue with parsing the kernel version,
+        # set use_hugepages to 0. Usage of LooseVersion will handle
+        # the kernel version parsing better, but avoided since it
+        # will increase the import time. See: #16679 for related discussion.
+        try:
+            use_hugepage = 1
+            kernel_version = os.uname().release.split(".")[:2]
+            kernel_version = tuple(int(v) for v in kernel_version)
+            if kernel_version < (4, 6):
+                use_hugepage = 0
+        except ValueError:
+            use_hugepages = 0
+    elif use_hugepage is None:
+        # This is not Linux, so it should not matter, just enable anyway
+        use_hugepage = 1
+    else:
+        use_hugepage = int(use_hugepage)
+
+    # Note that this will currently only make a difference on Linux
+    core.multiarray._set_madvise_hugepage(use_hugepage)
diff --git a/venv/Lib/site-packages/numpy/__pycache__/__config__.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/__config__.cpython-36.pyc
new file mode 100644
index 000000000..8c2da907c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/__config__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..36a727cd8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/_distributor_init.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/_distributor_init.cpython-36.pyc
new file mode 100644
index 000000000..b6b868f19
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/_distributor_init.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/_globals.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/_globals.cpython-36.pyc
new file mode 100644
index 000000000..8c992967a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/_globals.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/_pytesttester.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/_pytesttester.cpython-36.pyc
new file mode 100644
index 000000000..0dd163db2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/_pytesttester.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/conftest.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/conftest.cpython-36.pyc
new file mode 100644
index 000000000..c26dd4def
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/conftest.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/ctypeslib.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/ctypeslib.cpython-36.pyc
new file mode 100644
index 000000000..5755bd4cf
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/ctypeslib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/dual.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/dual.cpython-36.pyc
new file mode 100644
index 000000000..829643167
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/dual.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/matlib.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/matlib.cpython-36.pyc
new file mode 100644
index 000000000..7e28b3f16
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/matlib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..5551102e4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/numpy/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..d3d50fdc2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/_distributor_init.py b/venv/Lib/site-packages/numpy/_distributor_init.py
new file mode 100644
index 000000000..9e7e46e0c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/_distributor_init.py
@@ -0,0 +1,32 @@
+
+'''
+Helper to preload windows dlls to prevent dll not found errors.
+Once a DLL is preloaded, its namespace is made available to any
+subsequent DLL. This file originated in the numpy-wheels repo,
+and is created as part of the scripts that build the wheel.
+'''
+import os
+import glob
+if os.name == 'nt':
+    # convention for storing / loading the DLL from
+    # numpy/.libs/, if present
+    try:
+        from ctypes import WinDLL
+        basedir = os.path.dirname(__file__)
+    except:
+        pass
+    else:
+        libs_dir = os.path.abspath(os.path.join(basedir, '.libs'))
+        DLL_filenames = []
+        if os.path.isdir(libs_dir):
+            for filename in glob.glob(os.path.join(libs_dir,
+                                                   '*openblas*dll')):
+                # NOTE: would it change behavior to load ALL
+                # DLLs at this path vs. the name restriction?
+                WinDLL(os.path.abspath(filename))
+                DLL_filenames.append(filename)
+        if len(DLL_filenames) > 1:
+            import warnings
+            warnings.warn("loaded more than 1 DLL from .libs:\n%s" %
+                          "\n".join(DLL_filenames),
+                          stacklevel=1)
diff --git a/venv/Lib/site-packages/numpy/_globals.py b/venv/Lib/site-packages/numpy/_globals.py
new file mode 100644
index 000000000..9f44c7729
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/_globals.py
@@ -0,0 +1,79 @@
+"""
+Module defining global singleton classes.
+
+This module raises a RuntimeError if an attempt to reload it is made. In that
+way the identities of the classes defined here are fixed and will remain so
+even if numpy itself is reloaded. In particular, a function like the following
+will still work correctly after numpy is reloaded::
+
+    def foo(arg=np._NoValue):
+        if arg is np._NoValue:
+            ...
+
+That was not the case when the singleton classes were defined in the numpy
+``__init__.py`` file. See gh-7844 for a discussion of the reload problem that
+motivated this module.
+
+"""
+__ALL__ = [
+    'ModuleDeprecationWarning', 'VisibleDeprecationWarning', '_NoValue'
+    ]
+
+
+# Disallow reloading this module so as to preserve the identities of the
+# classes defined here.
+if '_is_loaded' in globals():
+    raise RuntimeError('Reloading numpy._globals is not allowed')
+_is_loaded = True
+
+
+class ModuleDeprecationWarning(DeprecationWarning):
+    """Module deprecation warning.
+
+    The nose tester turns ordinary Deprecation warnings into test failures.
+    That makes it hard to deprecate whole modules, because they get
+    imported by default. So this is a special Deprecation warning that the
+    nose tester will let pass without making tests fail.
+
+    """
+
+
+ModuleDeprecationWarning.__module__ = 'numpy'
+
+
+class VisibleDeprecationWarning(UserWarning):
+    """Visible deprecation warning.
+
+    By default, python will not show deprecation warnings, so this class
+    can be used when a very visible warning is helpful, for example because
+    the usage is most likely a user bug.
+
+    """
+
+
+VisibleDeprecationWarning.__module__ = 'numpy'
+
+
+class _NoValueType:
+    """Special keyword value.
+
+    The instance of this class may be used as the default value assigned to a
+    deprecated keyword in order to check if it has been given a user defined
+    value.
+    """
+    __instance = None
+    def __new__(cls):
+        # ensure that only one instance exists
+        if not cls.__instance:
+            cls.__instance = super(_NoValueType, cls).__new__(cls)
+        return cls.__instance
+
+    # needed for python 2 to preserve identity through a pickle
+    def __reduce__(self):
+        return (self.__class__, ())
+
+    def __repr__(self):
+        return "<no value>"
+
+
+_NoValue = _NoValueType()
diff --git a/venv/Lib/site-packages/numpy/_pytesttester.py b/venv/Lib/site-packages/numpy/_pytesttester.py
new file mode 100644
index 000000000..8a33be525
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/_pytesttester.py
@@ -0,0 +1,210 @@
+"""
+Pytest test running.
+
+This module implements the ``test()`` function for NumPy modules. The usual
+boiler plate for doing that is to put the following in the module
+``__init__.py`` file::
+
+    from numpy._pytesttester import PytestTester
+    test = PytestTester(__name__).test
+    del PytestTester
+
+
+Warnings filtering and other runtime settings should be dealt with in the
+``pytest.ini`` file in the numpy repo root. The behavior of the test depends on
+whether or not that file is found as follows:
+
+* ``pytest.ini`` is present (develop mode)
+    All warnings except those explicitly filtered out are raised as error.
+* ``pytest.ini`` is absent (release mode)
+    DeprecationWarnings and PendingDeprecationWarnings are ignored, other
+    warnings are passed through.
+
+In practice, tests run from the numpy repo are run in develop mode. That
+includes the standard ``python runtests.py`` invocation.
+
+This module is imported by every numpy subpackage, so lies at the top level to
+simplify circular import issues. For the same reason, it contains no numpy
+imports at module scope, instead importing numpy within function calls.
+"""
+import sys
+import os
+
+__all__ = ['PytestTester']
+
+
+
+def _show_numpy_info():
+    import numpy as np
+
+    print("NumPy version %s" % np.__version__)
+    relaxed_strides = np.ones((10, 1), order="C").flags.f_contiguous
+    print("NumPy relaxed strides checking option:", relaxed_strides)
+
+
+class PytestTester:
+    """
+    Pytest test runner.
+
+    A test function is typically added to a package's __init__.py like so::
+
+      from numpy._pytesttester import PytestTester
+      test = PytestTester(__name__).test
+      del PytestTester
+
+    Calling this test function finds and runs all tests associated with the
+    module and all its sub-modules.
+
+    Attributes
+    ----------
+    module_name : str
+        Full path to the package to test.
+
+    Parameters
+    ----------
+    module_name : module name
+        The name of the module to test.
+
+    Notes
+    -----
+    Unlike the previous ``nose``-based implementation, this class is not
+    publicly exposed as it performs some ``numpy``-specific warning
+    suppression.
+
+    """
+    def __init__(self, module_name):
+        self.module_name = module_name
+
+    def __call__(self, label='fast', verbose=1, extra_argv=None,
+                 doctests=False, coverage=False, durations=-1, tests=None):
+        """
+        Run tests for module using pytest.
+
+        Parameters
+        ----------
+        label : {'fast', 'full'}, optional
+            Identifies the tests to run. When set to 'fast', tests decorated
+            with `pytest.mark.slow` are skipped, when 'full', the slow marker
+            is ignored.
+        verbose : int, optional
+            Verbosity value for test outputs, in the range 1-3. Default is 1.
+        extra_argv : list, optional
+            List with any extra arguments to pass to pytests.
+        doctests : bool, optional
+            .. note:: Not supported
+        coverage : bool, optional
+            If True, report coverage of NumPy code. Default is False.
+            Requires installation of (pip) pytest-cov.
+        durations : int, optional
+            If < 0, do nothing, If 0, report time of all tests, if > 0,
+            report the time of the slowest `timer` tests. Default is -1.
+        tests : test or list of tests
+            Tests to be executed with pytest '--pyargs'
+
+        Returns
+        -------
+        result : bool
+            Return True on success, false otherwise.
+
+        Notes
+        -----
+        Each NumPy module exposes `test` in its namespace to run all tests for
+        it. For example, to run all tests for numpy.lib:
+
+        >>> np.lib.test() #doctest: +SKIP
+
+        Examples
+        --------
+        >>> result = np.lib.test() #doctest: +SKIP
+        ...
+        1023 passed, 2 skipped, 6 deselected, 1 xfailed in 10.39 seconds
+        >>> result
+        True
+
+        """
+        import pytest
+        import warnings
+
+        # Imported after pytest to enable assertion rewriting
+        import hypothesis
+
+        module = sys.modules[self.module_name]
+        module_path = os.path.abspath(module.__path__[0])
+
+        # setup the pytest arguments
+        pytest_args = ["-l"]
+
+        # offset verbosity. The "-q" cancels a "-v".
+        pytest_args += ["-q"]
+
+        # Filter out distutils cpu warnings (could be localized to
+        # distutils tests). ASV has problems with top level import,
+        # so fetch module for suppression here.
+        with warnings.catch_warnings():
+            warnings.simplefilter("always")
+            from numpy.distutils import cpuinfo
+
+        # Filter out annoying import messages. Want these in both develop and
+        # release mode.
+        pytest_args += [
+            "-W ignore:Not importing directory",
+            "-W ignore:numpy.dtype size changed",
+            "-W ignore:numpy.ufunc size changed",
+            "-W ignore::UserWarning:cpuinfo",
+            ]
+
+        # When testing matrices, ignore their PendingDeprecationWarnings
+        pytest_args += [
+            "-W ignore:the matrix subclass is not",
+            "-W ignore:Importing from numpy.matlib is",
+            ]
+
+        if doctests:
+            raise ValueError("Doctests not supported")
+
+        if extra_argv:
+            pytest_args += list(extra_argv)
+
+        if verbose > 1:
+            pytest_args += ["-" + "v"*(verbose - 1)]
+
+        if coverage:
+            pytest_args += ["--cov=" + module_path]
+
+        if label == "fast":
+            # not importing at the top level to avoid circular import of module
+            from numpy.testing import IS_PYPY
+            if IS_PYPY:
+                pytest_args += ["-m", "not slow and not slow_pypy"]
+            else:
+                pytest_args += ["-m", "not slow"]
+
+        elif label != "full":
+            pytest_args += ["-m", label]
+
+        if durations >= 0:
+            pytest_args += ["--durations=%s" % durations]
+
+        if tests is None:
+            tests = [self.module_name]
+
+        pytest_args += ["--pyargs"] + list(tests)
+
+        # This configuration is picked up by numpy.conftest, and ensures that
+        # running `np.test()` is deterministic and does not write any files.
+        # See https://hypothesis.readthedocs.io/en/latest/settings.html
+        hypothesis.settings.register_profile(
+            name="np.test() profile",
+            deadline=None, print_blob=True, database=None, derandomize=True,
+            suppress_health_check=hypothesis.HealthCheck.all(),
+        )
+
+        # run tests.
+        _show_numpy_info()
+
+        try:
+            code = pytest.main(pytest_args)
+        except SystemExit as exc:
+            code = exc.code
+
+        return code == 0
diff --git a/venv/Lib/site-packages/numpy/compat/__init__.py b/venv/Lib/site-packages/numpy/compat/__init__.py
new file mode 100644
index 000000000..afee621b8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/compat/__init__.py
@@ -0,0 +1,18 @@
+"""
+Compatibility module.
+
+This module contains duplicated code from Python itself or 3rd party
+extensions, which may be included for the following reasons:
+
+  * compatibility
+  * we may only need a small subset of the copied library/module
+
+"""
+from . import _inspect
+from . import py3k
+from ._inspect import getargspec, formatargspec
+from .py3k import *
+
+__all__ = []
+__all__.extend(_inspect.__all__)
+__all__.extend(py3k.__all__)
diff --git a/venv/Lib/site-packages/numpy/compat/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..ee91eef97
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/__pycache__/_inspect.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/__pycache__/_inspect.cpython-36.pyc
new file mode 100644
index 000000000..a02bdfad0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/__pycache__/_inspect.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/__pycache__/py3k.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/__pycache__/py3k.cpython-36.pyc
new file mode 100644
index 000000000..f12ff67b9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/__pycache__/py3k.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..9870d12d2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/_inspect.py b/venv/Lib/site-packages/numpy/compat/_inspect.py
new file mode 100644
index 000000000..9a874a71d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/compat/_inspect.py
@@ -0,0 +1,191 @@
+"""Subset of inspect module from upstream python
+
+We use this instead of upstream because upstream inspect is slow to import, and
+significantly contributes to numpy import times. Importing this copy has almost
+no overhead.
+
+"""
+import types
+
+__all__ = ['getargspec', 'formatargspec']
+
+# ----------------------------------------------------------- type-checking
+def ismethod(object):
+    """Return true if the object is an instance method.
+
+    Instance method objects provide these attributes:
+        __doc__         documentation string
+        __name__        name with which this method was defined
+        im_class        class object in which this method belongs
+        im_func         function object containing implementation of method
+        im_self         instance to which this method is bound, or None
+
+    """
+    return isinstance(object, types.MethodType)
+
+def isfunction(object):
+    """Return true if the object is a user-defined function.
+
+    Function objects provide these attributes:
+        __doc__         documentation string
+        __name__        name with which this function was defined
+        func_code       code object containing compiled function bytecode
+        func_defaults   tuple of any default values for arguments
+        func_doc        (same as __doc__)
+        func_globals    global namespace in which this function was defined
+        func_name       (same as __name__)
+
+    """
+    return isinstance(object, types.FunctionType)
+
+def iscode(object):
+    """Return true if the object is a code object.
+
+    Code objects provide these attributes:
+        co_argcount     number of arguments (not including * or ** args)
+        co_code         string of raw compiled bytecode
+        co_consts       tuple of constants used in the bytecode
+        co_filename     name of file in which this code object was created
+        co_firstlineno  number of first line in Python source code
+        co_flags        bitmap: 1=optimized | 2=newlocals | 4=*arg | 8=**arg
+        co_lnotab       encoded mapping of line numbers to bytecode indices
+        co_name         name with which this code object was defined
+        co_names        tuple of names of local variables
+        co_nlocals      number of local variables
+        co_stacksize    virtual machine stack space required
+        co_varnames     tuple of names of arguments and local variables
+        
+    """
+    return isinstance(object, types.CodeType)
+
+# ------------------------------------------------ argument list extraction
+# These constants are from Python's compile.h.
+CO_OPTIMIZED, CO_NEWLOCALS, CO_VARARGS, CO_VARKEYWORDS = 1, 2, 4, 8
+
+def getargs(co):
+    """Get information about the arguments accepted by a code object.
+
+    Three things are returned: (args, varargs, varkw), where 'args' is
+    a list of argument names (possibly containing nested lists), and
+    'varargs' and 'varkw' are the names of the * and ** arguments or None.
+
+    """
+
+    if not iscode(co):
+        raise TypeError('arg is not a code object')
+
+    nargs = co.co_argcount
+    names = co.co_varnames
+    args = list(names[:nargs])
+
+    # The following acrobatics are for anonymous (tuple) arguments.
+    # Which we do not need to support, so remove to avoid importing
+    # the dis module.
+    for i in range(nargs):
+        if args[i][:1] in ['', '.']:
+            raise TypeError("tuple function arguments are not supported")
+    varargs = None
+    if co.co_flags & CO_VARARGS:
+        varargs = co.co_varnames[nargs]
+        nargs = nargs + 1
+    varkw = None
+    if co.co_flags & CO_VARKEYWORDS:
+        varkw = co.co_varnames[nargs]
+    return args, varargs, varkw
+
+def getargspec(func):
+    """Get the names and default values of a function's arguments.
+
+    A tuple of four things is returned: (args, varargs, varkw, defaults).
+    'args' is a list of the argument names (it may contain nested lists).
+    'varargs' and 'varkw' are the names of the * and ** arguments or None.
+    'defaults' is an n-tuple of the default values of the last n arguments.
+
+    """
+
+    if ismethod(func):
+        func = func.__func__
+    if not isfunction(func):
+        raise TypeError('arg is not a Python function')
+    args, varargs, varkw = getargs(func.__code__)
+    return args, varargs, varkw, func.__defaults__
+
+def getargvalues(frame):
+    """Get information about arguments passed into a particular frame.
+
+    A tuple of four things is returned: (args, varargs, varkw, locals).
+    'args' is a list of the argument names (it may contain nested lists).
+    'varargs' and 'varkw' are the names of the * and ** arguments or None.
+    'locals' is the locals dictionary of the given frame.
+    
+    """
+    args, varargs, varkw = getargs(frame.f_code)
+    return args, varargs, varkw, frame.f_locals
+
+def joinseq(seq):
+    if len(seq) == 1:
+        return '(' + seq[0] + ',)'
+    else:
+        return '(' + ', '.join(seq) + ')'
+
+def strseq(object, convert, join=joinseq):
+    """Recursively walk a sequence, stringifying each element.
+
+    """
+    if type(object) in [list, tuple]:
+        return join([strseq(_o, convert, join) for _o in object])
+    else:
+        return convert(object)
+
+def formatargspec(args, varargs=None, varkw=None, defaults=None,
+                  formatarg=str,
+                  formatvarargs=lambda name: '*' + name,
+                  formatvarkw=lambda name: '**' + name,
+                  formatvalue=lambda value: '=' + repr(value),
+                  join=joinseq):
+    """Format an argument spec from the 4 values returned by getargspec.
+
+    The first four arguments are (args, varargs, varkw, defaults).  The
+    other four arguments are the corresponding optional formatting functions
+    that are called to turn names and values into strings.  The ninth
+    argument is an optional function to format the sequence of arguments.
+
+    """
+    specs = []
+    if defaults:
+        firstdefault = len(args) - len(defaults)
+    for i in range(len(args)):
+        spec = strseq(args[i], formatarg, join)
+        if defaults and i >= firstdefault:
+            spec = spec + formatvalue(defaults[i - firstdefault])
+        specs.append(spec)
+    if varargs is not None:
+        specs.append(formatvarargs(varargs))
+    if varkw is not None:
+        specs.append(formatvarkw(varkw))
+    return '(' + ', '.join(specs) + ')'
+
+def formatargvalues(args, varargs, varkw, locals,
+                    formatarg=str,
+                    formatvarargs=lambda name: '*' + name,
+                    formatvarkw=lambda name: '**' + name,
+                    formatvalue=lambda value: '=' + repr(value),
+                    join=joinseq):
+    """Format an argument spec from the 4 values returned by getargvalues.
+
+    The first four arguments are (args, varargs, varkw, locals).  The
+    next four arguments are the corresponding optional formatting functions
+    that are called to turn names and values into strings.  The ninth
+    argument is an optional function to format the sequence of arguments.
+
+    """
+    def convert(name, locals=locals,
+                formatarg=formatarg, formatvalue=formatvalue):
+        return formatarg(name) + formatvalue(locals[name])
+    specs = [strseq(arg, convert, join) for arg in args]
+
+    if varargs:
+        specs.append(formatvarargs(varargs) + formatvalue(locals[varargs]))
+    if varkw:
+        specs.append(formatvarkw(varkw) + formatvalue(locals[varkw]))
+    return '(' + ', '.join(specs) + ')'
diff --git a/venv/Lib/site-packages/numpy/compat/py3k.py b/venv/Lib/site-packages/numpy/compat/py3k.py
new file mode 100644
index 000000000..fd9f8bd42
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/compat/py3k.py
@@ -0,0 +1,186 @@
+"""
+Python 3.X compatibility tools.
+
+While this file was originally intended for Python 2 -> 3 transition,
+it is now used to create a compatibility layer between different
+minor versions of Python 3.
+
+While the active version of numpy may not support a given version of python, we
+allow downstream libraries to continue to use these shims for forward
+compatibility with numpy while they transition their code to newer versions of
+Python.
+"""
+__all__ = ['bytes', 'asbytes', 'isfileobj', 'getexception', 'strchar',
+           'unicode', 'asunicode', 'asbytes_nested', 'asunicode_nested',
+           'asstr', 'open_latin1', 'long', 'basestring', 'sixu',
+           'integer_types', 'is_pathlib_path', 'npy_load_module', 'Path',
+           'pickle', 'contextlib_nullcontext', 'os_fspath', 'os_PathLike']
+
+import sys
+import os
+from pathlib import Path, PurePath
+import io
+
+import abc
+from abc import ABC as abc_ABC
+
+try:
+    import pickle5 as pickle
+except ImportError:
+    import pickle
+
+long = int
+integer_types = (int,)
+basestring = str
+unicode = str
+bytes = bytes
+
+def asunicode(s):
+    if isinstance(s, bytes):
+        return s.decode('latin1')
+    return str(s)
+
+def asbytes(s):
+    if isinstance(s, bytes):
+        return s
+    return str(s).encode('latin1')
+
+def asstr(s):
+    if isinstance(s, bytes):
+        return s.decode('latin1')
+    return str(s)
+
+def isfileobj(f):
+    return isinstance(f, (io.FileIO, io.BufferedReader, io.BufferedWriter))
+
+def open_latin1(filename, mode='r'):
+    return open(filename, mode=mode, encoding='iso-8859-1')
+
+def sixu(s):
+    return s
+
+strchar = 'U'
+
+def getexception():
+    return sys.exc_info()[1]
+
+def asbytes_nested(x):
+    if hasattr(x, '__iter__') and not isinstance(x, (bytes, unicode)):
+        return [asbytes_nested(y) for y in x]
+    else:
+        return asbytes(x)
+
+def asunicode_nested(x):
+    if hasattr(x, '__iter__') and not isinstance(x, (bytes, unicode)):
+        return [asunicode_nested(y) for y in x]
+    else:
+        return asunicode(x)
+
+def is_pathlib_path(obj):
+    """
+    Check whether obj is a pathlib.Path object.
+
+    Prefer using `isinstance(obj, os_PathLike)` instead of this function.
+    """
+    return Path is not None and isinstance(obj, Path)
+
+# from Python 3.7
+class contextlib_nullcontext:
+    """Context manager that does no additional processing.
+
+    Used as a stand-in for a normal context manager, when a particular
+    block of code is only sometimes used with a normal context manager:
+
+    cm = optional_cm if condition else nullcontext()
+    with cm:
+        # Perform operation, using optional_cm if condition is True
+    """
+
+    def __init__(self, enter_result=None):
+        self.enter_result = enter_result
+
+    def __enter__(self):
+        return self.enter_result
+
+    def __exit__(self, *excinfo):
+        pass
+
+
+def npy_load_module(name, fn, info=None):
+    """
+    Load a module.
+
+    .. versionadded:: 1.11.2
+
+    Parameters
+    ----------
+    name : str
+        Full module name.
+    fn : str
+        Path to module file.
+    info : tuple, optional
+        Only here for backward compatibility with Python 2.*.
+
+    Returns
+    -------
+    mod : module
+
+    """
+    # Explicitly lazy import this to avoid paying the cost
+    # of importing importlib at startup
+    from importlib.machinery import SourceFileLoader
+    return SourceFileLoader(name, fn).load_module()
+
+
+# Backport os.fs_path, os.PathLike, and PurePath.__fspath__
+if sys.version_info[:2] >= (3, 6):
+    os_fspath = os.fspath
+    os_PathLike = os.PathLike
+else:
+    def _PurePath__fspath__(self):
+        return str(self)
+
+    class os_PathLike(abc_ABC):
+        """Abstract base class for implementing the file system path protocol."""
+
+        @abc.abstractmethod
+        def __fspath__(self):
+            """Return the file system path representation of the object."""
+            raise NotImplementedError
+
+        @classmethod
+        def __subclasshook__(cls, subclass):
+            if PurePath is not None and issubclass(subclass, PurePath):
+                return True
+            return hasattr(subclass, '__fspath__')
+
+
+    def os_fspath(path):
+        """Return the path representation of a path-like object.
+        If str or bytes is passed in, it is returned unchanged. Otherwise the
+        os.PathLike interface is used to get the path representation. If the
+        path representation is not str or bytes, TypeError is raised. If the
+        provided path is not str, bytes, or os.PathLike, TypeError is raised.
+        """
+        if isinstance(path, (str, bytes)):
+            return path
+
+        # Work from the object's type to match method resolution of other magic
+        # methods.
+        path_type = type(path)
+        try:
+            path_repr = path_type.__fspath__(path)
+        except AttributeError:
+            if hasattr(path_type, '__fspath__'):
+                raise
+            elif PurePath is not None and issubclass(path_type, PurePath):
+                return _PurePath__fspath__(path)
+            else:
+                raise TypeError("expected str, bytes or os.PathLike object, "
+                                "not " + path_type.__name__)
+        if isinstance(path_repr, (str, bytes)):
+            return path_repr
+        else:
+            raise TypeError("expected {}.__fspath__() to return str or bytes, "
+                            "not {}".format(path_type.__name__,
+                                            type(path_repr).__name__))
diff --git a/venv/Lib/site-packages/numpy/compat/setup.py b/venv/Lib/site-packages/numpy/compat/setup.py
new file mode 100644
index 000000000..c1b34a2cc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/compat/setup.py
@@ -0,0 +1,10 @@
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+
+    config = Configuration('compat', parent_package, top_path)
+    config.add_subpackage('tests')
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/compat/tests/__init__.py b/venv/Lib/site-packages/numpy/compat/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/compat/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4c83184fa
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/tests/__pycache__/test_compat.cpython-36.pyc b/venv/Lib/site-packages/numpy/compat/tests/__pycache__/test_compat.cpython-36.pyc
new file mode 100644
index 000000000..5c76eb5ab
Binary files /dev/null and b/venv/Lib/site-packages/numpy/compat/tests/__pycache__/test_compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/compat/tests/test_compat.py b/venv/Lib/site-packages/numpy/compat/tests/test_compat.py
new file mode 100644
index 000000000..2b8acbaa0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/compat/tests/test_compat.py
@@ -0,0 +1,19 @@
+from os.path import join
+
+from numpy.compat import isfileobj
+from numpy.testing import assert_
+from numpy.testing import tempdir
+
+
+def test_isfileobj():
+    with tempdir(prefix="numpy_test_compat_") as folder:
+        filename = join(folder, 'a.bin')
+
+        with open(filename, 'wb') as f:
+            assert_(isfileobj(f))
+
+        with open(filename, 'ab') as f:
+            assert_(isfileobj(f))
+
+        with open(filename, 'rb') as f:
+            assert_(isfileobj(f))
diff --git a/venv/Lib/site-packages/numpy/conftest.py b/venv/Lib/site-packages/numpy/conftest.py
new file mode 100644
index 000000000..078b09566
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/conftest.py
@@ -0,0 +1,107 @@
+"""
+Pytest configuration and fixtures for the Numpy test suite.
+"""
+import os
+import tempfile
+
+import hypothesis
+import pytest
+import numpy
+
+from numpy.core._multiarray_tests import get_fpu_mode
+
+
+_old_fpu_mode = None
+_collect_results = {}
+
+# Use a known and persistent tmpdir for hypothesis' caches, which
+# can be automatically cleared by the OS or user.
+hypothesis.configuration.set_hypothesis_home_dir(
+    os.path.join(tempfile.gettempdir(), ".hypothesis")
+)
+# See https://hypothesis.readthedocs.io/en/latest/settings.html
+hypothesis.settings.register_profile(
+    name="numpy-profile", deadline=None, print_blob=True,
+)
+# We try loading the profile defined by np.test(), which disables the
+# database and forces determinism, and fall back to the profile defined
+# above if we're running pytest directly.  The odd dance is required
+# because np.test() executes this file *after* its own setup code.
+try:
+    hypothesis.settings.load_profile("np.test() profile")
+except hypothesis.errors.InvalidArgument:  # profile not found
+    hypothesis.settings.load_profile("numpy-profile")
+
+
+def pytest_configure(config):
+    config.addinivalue_line("markers",
+        "valgrind_error: Tests that are known to error under valgrind.")
+    config.addinivalue_line("markers",
+        "leaks_references: Tests that are known to leak references.")
+    config.addinivalue_line("markers",
+        "slow: Tests that are very slow.")
+    config.addinivalue_line("markers",
+        "slow_pypy: Tests that are very slow on pypy.")
+
+
+def pytest_addoption(parser):
+    parser.addoption("--available-memory", action="store", default=None,
+                     help=("Set amount of memory available for running the "
+                           "test suite. This can result to tests requiring "
+                           "especially large amounts of memory to be skipped. "
+                           "Equivalent to setting environment variable "
+                           "NPY_AVAILABLE_MEM. Default: determined"
+                           "automatically."))
+
+
+def pytest_sessionstart(session):
+    available_mem = session.config.getoption('available_memory')
+    if available_mem is not None:
+        os.environ['NPY_AVAILABLE_MEM'] = available_mem
+
+
+#FIXME when yield tests are gone.
+@pytest.hookimpl()
+def pytest_itemcollected(item):
+    """
+    Check FPU precision mode was not changed during test collection.
+
+    The clumsy way we do it here is mainly necessary because numpy
+    still uses yield tests, which can execute code at test collection
+    time.
+    """
+    global _old_fpu_mode
+
+    mode = get_fpu_mode()
+
+    if _old_fpu_mode is None:
+        _old_fpu_mode = mode
+    elif mode != _old_fpu_mode:
+        _collect_results[item] = (_old_fpu_mode, mode)
+        _old_fpu_mode = mode
+
+
+@pytest.fixture(scope="function", autouse=True)
+def check_fpu_mode(request):
+    """
+    Check FPU precision mode was not changed during the test.
+    """
+    old_mode = get_fpu_mode()
+    yield
+    new_mode = get_fpu_mode()
+
+    if old_mode != new_mode:
+        raise AssertionError("FPU precision mode changed from {0:#x} to {1:#x}"
+                             " during the test".format(old_mode, new_mode))
+
+    collect_result = _collect_results.get(request.node)
+    if collect_result is not None:
+        old_mode, new_mode = collect_result
+        raise AssertionError("FPU precision mode changed from {0:#x} to {1:#x}"
+                             " when collecting the test".format(old_mode,
+                                                                new_mode))
+
+
+@pytest.fixture(autouse=True)
+def add_np(doctest_namespace):
+    doctest_namespace['np'] = numpy
diff --git a/venv/Lib/site-packages/numpy/core/__init__.py b/venv/Lib/site-packages/numpy/core/__init__.py
new file mode 100644
index 000000000..c77885954
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/__init__.py
@@ -0,0 +1,143 @@
+"""
+Contains the core of NumPy: ndarray, ufuncs, dtypes, etc.
+
+Please note that this module is private.  All functions and objects
+are available in the main ``numpy`` namespace - use that instead.
+
+"""
+
+from numpy.version import version as __version__
+
+import os
+
+# disables OpenBLAS affinity setting of the main thread that limits
+# python threads or processes to one core
+env_added = []
+for envkey in ['OPENBLAS_MAIN_FREE', 'GOTOBLAS_MAIN_FREE']:
+    if envkey not in os.environ:
+        os.environ[envkey] = '1'
+        env_added.append(envkey)
+
+try:
+    from . import multiarray
+except ImportError as exc:
+    import sys
+    msg = """
+
+IMPORTANT: PLEASE READ THIS FOR ADVICE ON HOW TO SOLVE THIS ISSUE!
+
+Importing the numpy C-extensions failed. This error can happen for
+many reasons, often due to issues with your setup or how NumPy was
+installed.
+
+We have compiled some common reasons and troubleshooting tips at:
+
+    https://numpy.org/devdocs/user/troubleshooting-importerror.html
+
+Please note and check the following:
+
+  * The Python version is: Python%d.%d from "%s"
+  * The NumPy version is: "%s"
+
+and make sure that they are the versions you expect.
+Please carefully study the documentation linked above for further help.
+
+Original error was: %s
+""" % (sys.version_info[0], sys.version_info[1], sys.executable,
+        __version__, exc)
+    raise ImportError(msg)
+finally:
+    for envkey in env_added:
+        del os.environ[envkey]
+del envkey
+del env_added
+del os
+
+from . import umath
+
+# Check that multiarray,umath are pure python modules wrapping
+# _multiarray_umath and not either of the old c-extension modules
+if not (hasattr(multiarray, '_multiarray_umath') and
+        hasattr(umath, '_multiarray_umath')):
+    import sys
+    path = sys.modules['numpy'].__path__
+    msg = ("Something is wrong with the numpy installation. "
+        "While importing we detected an older version of "
+        "numpy in {}. One method of fixing this is to repeatedly uninstall "
+        "numpy until none is found, then reinstall this version.")
+    raise ImportError(msg.format(path))
+
+from . import numerictypes as nt
+multiarray.set_typeDict(nt.sctypeDict)
+from . import numeric
+from .numeric import *
+from . import fromnumeric
+from .fromnumeric import *
+from . import defchararray as char
+from . import records as rec
+from .records import *
+from .memmap import *
+from .defchararray import chararray
+from . import function_base
+from .function_base import *
+from . import machar
+from .machar import *
+from . import getlimits
+from .getlimits import *
+from . import shape_base
+from .shape_base import *
+from . import einsumfunc
+from .einsumfunc import *
+del nt
+
+from .fromnumeric import amax as max, amin as min, round_ as round
+from .numeric import absolute as abs
+
+# do this after everything else, to minimize the chance of this misleadingly
+# appearing in an import-time traceback
+from . import _add_newdocs
+# add these for module-freeze analysis (like PyInstaller)
+from . import _dtype_ctypes
+from . import _internal
+from . import _dtype
+from . import _methods
+
+__all__ = ['char', 'rec', 'memmap']
+__all__ += numeric.__all__
+__all__ += fromnumeric.__all__
+__all__ += rec.__all__
+__all__ += ['chararray']
+__all__ += function_base.__all__
+__all__ += machar.__all__
+__all__ += getlimits.__all__
+__all__ += shape_base.__all__
+__all__ += einsumfunc.__all__
+
+# Make it possible so that ufuncs can be pickled
+#  Here are the loading and unloading functions
+# The name numpy.core._ufunc_reconstruct must be
+#   available for unpickling to work.
+def _ufunc_reconstruct(module, name):
+    # The `fromlist` kwarg is required to ensure that `mod` points to the
+    # inner-most module rather than the parent package when module name is
+    # nested. This makes it possible to pickle non-toplevel ufuncs such as
+    # scipy.special.expit for instance.
+    mod = __import__(module, fromlist=[name])
+    return getattr(mod, name)
+
+def _ufunc_reduce(func):
+    from pickle import whichmodule
+    name = func.__name__
+    return _ufunc_reconstruct, (whichmodule(func, name), name)
+
+
+import copyreg
+
+copyreg.pickle(ufunc, _ufunc_reduce, _ufunc_reconstruct)
+# Unclutter namespace (must keep _ufunc_reconstruct for unpickling)
+del copyreg
+del _ufunc_reduce
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..d26a15d9f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_add_newdocs.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_add_newdocs.cpython-36.pyc
new file mode 100644
index 000000000..afe2a19a4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_add_newdocs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_asarray.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_asarray.cpython-36.pyc
new file mode 100644
index 000000000..e19ffd113
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_asarray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_dtype.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_dtype.cpython-36.pyc
new file mode 100644
index 000000000..3c034836f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_dtype.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_dtype_ctypes.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_dtype_ctypes.cpython-36.pyc
new file mode 100644
index 000000000..90f08b749
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_dtype_ctypes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_exceptions.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_exceptions.cpython-36.pyc
new file mode 100644
index 000000000..cb6b49a5d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_internal.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_internal.cpython-36.pyc
new file mode 100644
index 000000000..1cb995c9c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_internal.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_methods.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_methods.cpython-36.pyc
new file mode 100644
index 000000000..90584af3b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_methods.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_string_helpers.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_string_helpers.cpython-36.pyc
new file mode 100644
index 000000000..2d82f5ee2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_string_helpers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_type_aliases.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_type_aliases.cpython-36.pyc
new file mode 100644
index 000000000..49e68e363
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_type_aliases.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/_ufunc_config.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/_ufunc_config.cpython-36.pyc
new file mode 100644
index 000000000..35c972a02
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/_ufunc_config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/arrayprint.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/arrayprint.cpython-36.pyc
new file mode 100644
index 000000000..9bb79f31c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/arrayprint.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/cversions.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/cversions.cpython-36.pyc
new file mode 100644
index 000000000..007968449
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/cversions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/defchararray.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/defchararray.cpython-36.pyc
new file mode 100644
index 000000000..1b8309d19
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/defchararray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/einsumfunc.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/einsumfunc.cpython-36.pyc
new file mode 100644
index 000000000..552e04ade
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/einsumfunc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/fromnumeric.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/fromnumeric.cpython-36.pyc
new file mode 100644
index 000000000..6a8cd1337
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/fromnumeric.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/function_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/function_base.cpython-36.pyc
new file mode 100644
index 000000000..9cbe81cd2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/function_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/generate_numpy_api.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/generate_numpy_api.cpython-36.pyc
new file mode 100644
index 000000000..39e7adb35
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/generate_numpy_api.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/getlimits.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/getlimits.cpython-36.pyc
new file mode 100644
index 000000000..4221e0162
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/getlimits.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/machar.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/machar.cpython-36.pyc
new file mode 100644
index 000000000..79b9c75fc
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/machar.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/memmap.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/memmap.cpython-36.pyc
new file mode 100644
index 000000000..258c63c42
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/memmap.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/multiarray.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/multiarray.cpython-36.pyc
new file mode 100644
index 000000000..0ab22e5d9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/multiarray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/numeric.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/numeric.cpython-36.pyc
new file mode 100644
index 000000000..877c91966
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/numeric.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/numerictypes.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/numerictypes.cpython-36.pyc
new file mode 100644
index 000000000..f1b88dae5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/numerictypes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/overrides.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/overrides.cpython-36.pyc
new file mode 100644
index 000000000..4cb7bd5ae
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/overrides.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/records.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/records.cpython-36.pyc
new file mode 100644
index 000000000..768e018a0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/records.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..766325159
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/setup_common.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/setup_common.cpython-36.pyc
new file mode 100644
index 000000000..670c6a5b9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/setup_common.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/shape_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/shape_base.cpython-36.pyc
new file mode 100644
index 000000000..67d5ab6fe
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/shape_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/umath.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/umath.cpython-36.pyc
new file mode 100644
index 000000000..118c44b5d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/umath.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/__pycache__/umath_tests.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/__pycache__/umath_tests.cpython-36.pyc
new file mode 100644
index 000000000..9b23d63d6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/__pycache__/umath_tests.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/_add_newdocs.py b/venv/Lib/site-packages/numpy/core/_add_newdocs.py
new file mode 100644
index 000000000..f43b77c44
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_add_newdocs.py
@@ -0,0 +1,6844 @@
+"""
+This is only meant to add docs to objects defined in C-extension modules.
+The purpose is to allow easier editing of the docstrings without
+requiring a re-compile.
+
+NOTE: Many of the methods of ndarray have corresponding functions.
+      If you update these docstrings, please keep also the ones in
+      core/fromnumeric.py, core/defmatrix.py up-to-date.
+
+"""
+
+from numpy.core import numerictypes as _numerictypes
+from numpy.core import dtype
+from numpy.core.function_base import add_newdoc
+
+###############################################################################
+#
+# flatiter
+#
+# flatiter needs a toplevel description
+#
+###############################################################################
+
+add_newdoc('numpy.core', 'flatiter',
+    """
+    Flat iterator object to iterate over arrays.
+
+    A `flatiter` iterator is returned by ``x.flat`` for any array `x`.
+    It allows iterating over the array as if it were a 1-D array,
+    either in a for-loop or by calling its `next` method.
+
+    Iteration is done in row-major, C-style order (the last
+    index varying the fastest). The iterator can also be indexed using
+    basic slicing or advanced indexing.
+
+    See Also
+    --------
+    ndarray.flat : Return a flat iterator over an array.
+    ndarray.flatten : Returns a flattened copy of an array.
+
+    Notes
+    -----
+    A `flatiter` iterator can not be constructed directly from Python code
+    by calling the `flatiter` constructor.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2, 3)
+    >>> fl = x.flat
+    >>> type(fl)
+    <class 'numpy.flatiter'>
+    >>> for item in fl:
+    ...     print(item)
+    ...
+    0
+    1
+    2
+    3
+    4
+    5
+
+    >>> fl[2:4]
+    array([2, 3])
+
+    """)
+
+# flatiter attributes
+
+add_newdoc('numpy.core', 'flatiter', ('base',
+    """
+    A reference to the array that is iterated over.
+
+    Examples
+    --------
+    >>> x = np.arange(5)
+    >>> fl = x.flat
+    >>> fl.base is x
+    True
+
+    """))
+
+
+
+add_newdoc('numpy.core', 'flatiter', ('coords',
+    """
+    An N-dimensional tuple of current coordinates.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2, 3)
+    >>> fl = x.flat
+    >>> fl.coords
+    (0, 0)
+    >>> next(fl)
+    0
+    >>> fl.coords
+    (0, 1)
+
+    """))
+
+
+
+add_newdoc('numpy.core', 'flatiter', ('index',
+    """
+    Current flat index into the array.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2, 3)
+    >>> fl = x.flat
+    >>> fl.index
+    0
+    >>> next(fl)
+    0
+    >>> fl.index
+    1
+
+    """))
+
+# flatiter functions
+
+add_newdoc('numpy.core', 'flatiter', ('__array__',
+    """__array__(type=None) Get array from iterator
+
+    """))
+
+
+add_newdoc('numpy.core', 'flatiter', ('copy',
+    """
+    copy()
+
+    Get a copy of the iterator as a 1-D array.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2, 3)
+    >>> x
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> fl = x.flat
+    >>> fl.copy()
+    array([0, 1, 2, 3, 4, 5])
+
+    """))
+
+
+###############################################################################
+#
+# nditer
+#
+###############################################################################
+
+add_newdoc('numpy.core', 'nditer',
+    """
+    nditer(op, flags=None, op_flags=None, op_dtypes=None, order='K', casting='safe', op_axes=None, itershape=None, buffersize=0)
+
+    Efficient multi-dimensional iterator object to iterate over arrays.
+    To get started using this object, see the
+    :ref:`introductory guide to array iteration <arrays.nditer>`.
+
+    Parameters
+    ----------
+    op : ndarray or sequence of array_like
+        The array(s) to iterate over.
+
+    flags : sequence of str, optional
+          Flags to control the behavior of the iterator.
+
+          * ``buffered`` enables buffering when required.
+          * ``c_index`` causes a C-order index to be tracked.
+          * ``f_index`` causes a Fortran-order index to be tracked.
+          * ``multi_index`` causes a multi-index, or a tuple of indices
+            with one per iteration dimension, to be tracked.
+          * ``common_dtype`` causes all the operands to be converted to
+            a common data type, with copying or buffering as necessary.
+          * ``copy_if_overlap`` causes the iterator to determine if read
+            operands have overlap with write operands, and make temporary
+            copies as necessary to avoid overlap. False positives (needless
+            copying) are possible in some cases.
+          * ``delay_bufalloc`` delays allocation of the buffers until
+            a reset() call is made. Allows ``allocate`` operands to
+            be initialized before their values are copied into the buffers.
+          * ``external_loop`` causes the ``values`` given to be
+            one-dimensional arrays with multiple values instead of
+            zero-dimensional arrays.
+          * ``grow_inner`` allows the ``value`` array sizes to be made
+            larger than the buffer size when both ``buffered`` and
+            ``external_loop`` is used.
+          * ``ranged`` allows the iterator to be restricted to a sub-range
+            of the iterindex values.
+          * ``refs_ok`` enables iteration of reference types, such as
+            object arrays.
+          * ``reduce_ok`` enables iteration of ``readwrite`` operands
+            which are broadcasted, also known as reduction operands.
+          * ``zerosize_ok`` allows `itersize` to be zero.
+    op_flags : list of list of str, optional
+          This is a list of flags for each operand. At minimum, one of
+          ``readonly``, ``readwrite``, or ``writeonly`` must be specified.
+
+          * ``readonly`` indicates the operand will only be read from.
+          * ``readwrite`` indicates the operand will be read from and written to.
+          * ``writeonly`` indicates the operand will only be written to.
+          * ``no_broadcast`` prevents the operand from being broadcasted.
+          * ``contig`` forces the operand data to be contiguous.
+          * ``aligned`` forces the operand data to be aligned.
+          * ``nbo`` forces the operand data to be in native byte order.
+          * ``copy`` allows a temporary read-only copy if required.
+          * ``updateifcopy`` allows a temporary read-write copy if required.
+          * ``allocate`` causes the array to be allocated if it is None
+            in the ``op`` parameter.
+          * ``no_subtype`` prevents an ``allocate`` operand from using a subtype.
+          * ``arraymask`` indicates that this operand is the mask to use
+            for selecting elements when writing to operands with the
+            'writemasked' flag set. The iterator does not enforce this,
+            but when writing from a buffer back to the array, it only
+            copies those elements indicated by this mask.
+          * ``writemasked`` indicates that only elements where the chosen
+            ``arraymask`` operand is True will be written to.
+          * ``overlap_assume_elementwise`` can be used to mark operands that are
+            accessed only in the iterator order, to allow less conservative
+            copying when ``copy_if_overlap`` is present.
+    op_dtypes : dtype or tuple of dtype(s), optional
+        The required data type(s) of the operands. If copying or buffering
+        is enabled, the data will be converted to/from their original types.
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the iteration order. 'C' means C order, 'F' means
+        Fortran order, 'A' means 'F' order if all the arrays are Fortran
+        contiguous, 'C' order otherwise, and 'K' means as close to the
+        order the array elements appear in memory as possible. This also
+        affects the element memory order of ``allocate`` operands, as they
+        are allocated to be compatible with iteration order.
+        Default is 'K'.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur when making a copy
+        or buffering.  Setting this to 'unsafe' is not recommended,
+        as it can adversely affect accumulations.
+
+        * 'no' means the data types should not be cast at all.
+        * 'equiv' means only byte-order changes are allowed.
+        * 'safe' means only casts which can preserve values are allowed.
+        * 'same_kind' means only safe casts or casts within a kind,
+          like float64 to float32, are allowed.
+        * 'unsafe' means any data conversions may be done.
+    op_axes : list of list of ints, optional
+        If provided, is a list of ints or None for each operands.
+        The list of axes for an operand is a mapping from the dimensions
+        of the iterator to the dimensions of the operand. A value of
+        -1 can be placed for entries, causing that dimension to be
+        treated as `newaxis`.
+    itershape : tuple of ints, optional
+        The desired shape of the iterator. This allows ``allocate`` operands
+        with a dimension mapped by op_axes not corresponding to a dimension
+        of a different operand to get a value not equal to 1 for that
+        dimension.
+    buffersize : int, optional
+        When buffering is enabled, controls the size of the temporary
+        buffers. Set to 0 for the default value.
+
+    Attributes
+    ----------
+    dtypes : tuple of dtype(s)
+        The data types of the values provided in `value`. This may be
+        different from the operand data types if buffering is enabled.
+        Valid only before the iterator is closed.
+    finished : bool
+        Whether the iteration over the operands is finished or not.
+    has_delayed_bufalloc : bool
+        If True, the iterator was created with the ``delay_bufalloc`` flag,
+        and no reset() function was called on it yet.
+    has_index : bool
+        If True, the iterator was created with either the ``c_index`` or
+        the ``f_index`` flag, and the property `index` can be used to
+        retrieve it.
+    has_multi_index : bool
+        If True, the iterator was created with the ``multi_index`` flag,
+        and the property `multi_index` can be used to retrieve it.
+    index
+        When the ``c_index`` or ``f_index`` flag was used, this property
+        provides access to the index. Raises a ValueError if accessed
+        and ``has_index`` is False.
+    iterationneedsapi : bool
+        Whether iteration requires access to the Python API, for example
+        if one of the operands is an object array.
+    iterindex : int
+        An index which matches the order of iteration.
+    itersize : int
+        Size of the iterator.
+    itviews
+        Structured view(s) of `operands` in memory, matching the reordered
+        and optimized iterator access pattern. Valid only before the iterator
+        is closed.
+    multi_index
+        When the ``multi_index`` flag was used, this property
+        provides access to the index. Raises a ValueError if accessed
+        accessed and ``has_multi_index`` is False.
+    ndim : int
+        The dimensions of the iterator.
+    nop : int
+        The number of iterator operands.
+    operands : tuple of operand(s)
+        The array(s) to be iterated over. Valid only before the iterator is
+        closed.
+    shape : tuple of ints
+        Shape tuple, the shape of the iterator.
+    value
+        Value of ``operands`` at current iteration. Normally, this is a
+        tuple of array scalars, but if the flag ``external_loop`` is used,
+        it is a tuple of one dimensional arrays.
+
+    Notes
+    -----
+    `nditer` supersedes `flatiter`.  The iterator implementation behind
+    `nditer` is also exposed by the NumPy C API.
+
+    The Python exposure supplies two iteration interfaces, one which follows
+    the Python iterator protocol, and another which mirrors the C-style
+    do-while pattern.  The native Python approach is better in most cases, but
+    if you need the coordinates or index of an iterator, use the C-style pattern.
+
+    Examples
+    --------
+    Here is how we might write an ``iter_add`` function, using the
+    Python iterator protocol:
+
+    >>> def iter_add_py(x, y, out=None):
+    ...     addop = np.add
+    ...     it = np.nditer([x, y, out], [],
+    ...                 [['readonly'], ['readonly'], ['writeonly','allocate']])
+    ...     with it:
+    ...         for (a, b, c) in it:
+    ...             addop(a, b, out=c)
+    ...     return it.operands[2]
+
+    Here is the same function, but following the C-style pattern:
+
+    >>> def iter_add(x, y, out=None):
+    ...    addop = np.add
+    ...    it = np.nditer([x, y, out], [],
+    ...                [['readonly'], ['readonly'], ['writeonly','allocate']])
+    ...    with it:
+    ...        while not it.finished:
+    ...            addop(it[0], it[1], out=it[2])
+    ...            it.iternext()
+    ...        return it.operands[2]
+
+    Here is an example outer product function:
+
+    >>> def outer_it(x, y, out=None):
+    ...     mulop = np.multiply
+    ...     it = np.nditer([x, y, out], ['external_loop'],
+    ...             [['readonly'], ['readonly'], ['writeonly', 'allocate']],
+    ...             op_axes=[list(range(x.ndim)) + [-1] * y.ndim,
+    ...                      [-1] * x.ndim + list(range(y.ndim)),
+    ...                      None])
+    ...     with it:
+    ...         for (a, b, c) in it:
+    ...             mulop(a, b, out=c)
+    ...         return it.operands[2]
+
+    >>> a = np.arange(2)+1
+    >>> b = np.arange(3)+1
+    >>> outer_it(a,b)
+    array([[1, 2, 3],
+           [2, 4, 6]])
+
+    Here is an example function which operates like a "lambda" ufunc:
+
+    >>> def luf(lamdaexpr, *args, **kwargs):
+    ...    '''luf(lambdaexpr, op1, ..., opn, out=None, order='K', casting='safe', buffersize=0)'''
+    ...    nargs = len(args)
+    ...    op = (kwargs.get('out',None),) + args
+    ...    it = np.nditer(op, ['buffered','external_loop'],
+    ...            [['writeonly','allocate','no_broadcast']] +
+    ...                            [['readonly','nbo','aligned']]*nargs,
+    ...            order=kwargs.get('order','K'),
+    ...            casting=kwargs.get('casting','safe'),
+    ...            buffersize=kwargs.get('buffersize',0))
+    ...    while not it.finished:
+    ...        it[0] = lamdaexpr(*it[1:])
+    ...        it.iternext()
+    ...        return it.operands[0]
+
+    >>> a = np.arange(5)
+    >>> b = np.ones(5)
+    >>> luf(lambda i,j:i*i + j/2, a, b)
+    array([  0.5,   1.5,   4.5,   9.5,  16.5])
+
+    If operand flags `"writeonly"` or `"readwrite"` are used the
+    operands may be views into the original data with the
+    `WRITEBACKIFCOPY` flag. In this case `nditer` must be used as a
+    context manager or the `nditer.close` method must be called before
+    using the result. The temporary data will be written back to the
+    original data when the `__exit__` function is called but not before:
+
+    >>> a = np.arange(6, dtype='i4')[::-2]
+    >>> with np.nditer(a, [],
+    ...        [['writeonly', 'updateifcopy']],
+    ...        casting='unsafe',
+    ...        op_dtypes=[np.dtype('f4')]) as i:
+    ...    x = i.operands[0]
+    ...    x[:] = [-1, -2, -3]
+    ...    # a still unchanged here
+    >>> a, x
+    (array([-1, -2, -3], dtype=int32), array([-1., -2., -3.], dtype=float32))
+
+    It is important to note that once the iterator is exited, dangling
+    references (like `x` in the example) may or may not share data with
+    the original data `a`. If writeback semantics were active, i.e. if
+    `x.base.flags.writebackifcopy` is `True`, then exiting the iterator
+    will sever the connection between `x` and `a`, writing to `x` will
+    no longer write to `a`. If writeback semantics are not active, then
+    `x.data` will still point at some part of `a.data`, and writing to
+    one will affect the other.
+
+    Context management and the `close` method appeared in version 1.15.0.
+
+    """)
+
+# nditer methods
+
+add_newdoc('numpy.core', 'nditer', ('copy',
+    """
+    copy()
+
+    Get a copy of the iterator in its current state.
+
+    Examples
+    --------
+    >>> x = np.arange(10)
+    >>> y = x + 1
+    >>> it = np.nditer([x, y])
+    >>> next(it)
+    (array(0), array(1))
+    >>> it2 = it.copy()
+    >>> next(it2)
+    (array(1), array(2))
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('operands',
+    """
+    operands[`Slice`]
+
+    The array(s) to be iterated over. Valid only before the iterator is closed.
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('debug_print',
+    """
+    debug_print()
+
+    Print the current state of the `nditer` instance and debug info to stdout.
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('enable_external_loop',
+    """
+    enable_external_loop()
+
+    When the "external_loop" was not used during construction, but
+    is desired, this modifies the iterator to behave as if the flag
+    was specified.
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('iternext',
+    """
+    iternext()
+
+    Check whether iterations are left, and perform a single internal iteration
+    without returning the result.  Used in the C-style pattern do-while
+    pattern.  For an example, see `nditer`.
+
+    Returns
+    -------
+    iternext : bool
+        Whether or not there are iterations left.
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('remove_axis',
+    """
+    remove_axis(i)
+
+    Removes axis `i` from the iterator. Requires that the flag "multi_index"
+    be enabled.
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('remove_multi_index',
+    """
+    remove_multi_index()
+
+    When the "multi_index" flag was specified, this removes it, allowing
+    the internal iteration structure to be optimized further.
+
+    """))
+
+add_newdoc('numpy.core', 'nditer', ('reset',
+    """
+    reset()
+
+    Reset the iterator to its initial state.
+
+    """))
+
+add_newdoc('numpy.core', 'nested_iters',
+    """
+    Create nditers for use in nested loops
+
+    Create a tuple of `nditer` objects which iterate in nested loops over
+    different axes of the op argument. The first iterator is used in the
+    outermost loop, the last in the innermost loop. Advancing one will change
+    the subsequent iterators to point at its new element.
+
+    Parameters
+    ----------
+    op : ndarray or sequence of array_like
+        The array(s) to iterate over.
+
+    axes : list of list of int
+        Each item is used as an "op_axes" argument to an nditer
+
+    flags, op_flags, op_dtypes, order, casting, buffersize (optional)
+        See `nditer` parameters of the same name
+
+    Returns
+    -------
+    iters : tuple of nditer
+        An nditer for each item in `axes`, outermost first
+
+    See Also
+    --------
+    nditer
+
+    Examples
+    --------
+
+    Basic usage. Note how y is the "flattened" version of
+    [a[:, 0, :], a[:, 1, 0], a[:, 2, :]] since we specified
+    the first iter's axes as [1]
+
+    >>> a = np.arange(12).reshape(2, 3, 2)
+    >>> i, j = np.nested_iters(a, [[1], [0, 2]], flags=["multi_index"])
+    >>> for x in i:
+    ...      print(i.multi_index)
+    ...      for y in j:
+    ...          print('', j.multi_index, y)
+    (0,)
+     (0, 0) 0
+     (0, 1) 1
+     (1, 0) 6
+     (1, 1) 7
+    (1,)
+     (0, 0) 2
+     (0, 1) 3
+     (1, 0) 8
+     (1, 1) 9
+    (2,)
+     (0, 0) 4
+     (0, 1) 5
+     (1, 0) 10
+     (1, 1) 11
+
+    """)
+
+add_newdoc('numpy.core', 'nditer', ('close',
+    """
+    close()
+
+    Resolve all writeback semantics in writeable operands.
+
+    .. versionadded:: 1.15.0
+
+    See Also
+    --------
+
+    :ref:`nditer-context-manager`
+
+    """))
+
+
+###############################################################################
+#
+# broadcast
+#
+###############################################################################
+
+add_newdoc('numpy.core', 'broadcast',
+    """
+    Produce an object that mimics broadcasting.
+
+    Parameters
+    ----------
+    in1, in2, ... : array_like
+        Input parameters.
+
+    Returns
+    -------
+    b : broadcast object
+        Broadcast the input parameters against one another, and
+        return an object that encapsulates the result.
+        Amongst others, it has ``shape`` and ``nd`` properties, and
+        may be used as an iterator.
+
+    See Also
+    --------
+    broadcast_arrays
+    broadcast_to
+
+    Examples
+    --------
+
+    Manually adding two vectors, using broadcasting:
+
+    >>> x = np.array([[1], [2], [3]])
+    >>> y = np.array([4, 5, 6])
+    >>> b = np.broadcast(x, y)
+
+    >>> out = np.empty(b.shape)
+    >>> out.flat = [u+v for (u,v) in b]
+    >>> out
+    array([[5.,  6.,  7.],
+           [6.,  7.,  8.],
+           [7.,  8.,  9.]])
+
+    Compare against built-in broadcasting:
+
+    >>> x + y
+    array([[5, 6, 7],
+           [6, 7, 8],
+           [7, 8, 9]])
+
+    """)
+
+# attributes
+
+add_newdoc('numpy.core', 'broadcast', ('index',
+    """
+    current index in broadcasted result
+
+    Examples
+    --------
+    >>> x = np.array([[1], [2], [3]])
+    >>> y = np.array([4, 5, 6])
+    >>> b = np.broadcast(x, y)
+    >>> b.index
+    0
+    >>> next(b), next(b), next(b)
+    ((1, 4), (1, 5), (1, 6))
+    >>> b.index
+    3
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('iters',
+    """
+    tuple of iterators along ``self``'s "components."
+
+    Returns a tuple of `numpy.flatiter` objects, one for each "component"
+    of ``self``.
+
+    See Also
+    --------
+    numpy.flatiter
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> row, col = b.iters
+    >>> next(row), next(col)
+    (1, 4)
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('ndim',
+    """
+    Number of dimensions of broadcasted result. Alias for `nd`.
+
+    .. versionadded:: 1.12.0
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.ndim
+    2
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('nd',
+    """
+    Number of dimensions of broadcasted result. For code intended for NumPy
+    1.12.0 and later the more consistent `ndim` is preferred.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.nd
+    2
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('numiter',
+    """
+    Number of iterators possessed by the broadcasted result.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.numiter
+    2
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('shape',
+    """
+    Shape of broadcasted result.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.shape
+    (3, 3)
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('size',
+    """
+    Total size of broadcasted result.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.size
+    9
+
+    """))
+
+add_newdoc('numpy.core', 'broadcast', ('reset',
+    """
+    reset()
+
+    Reset the broadcasted result's iterator(s).
+
+    Parameters
+    ----------
+    None
+
+    Returns
+    -------
+    None
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> y = np.array([[4], [5], [6]])
+    >>> b = np.broadcast(x, y)
+    >>> b.index
+    0
+    >>> next(b), next(b), next(b)
+    ((1, 4), (2, 4), (3, 4))
+    >>> b.index
+    3
+    >>> b.reset()
+    >>> b.index
+    0
+
+    """))
+
+###############################################################################
+#
+# numpy functions
+#
+###############################################################################
+
+add_newdoc('numpy.core.multiarray', 'array',
+    """
+    array(object, dtype=None, *, copy=True, order='K', subok=False, ndmin=0)
+
+    Create an array.
+
+    Parameters
+    ----------
+    object : array_like
+        An array, any object exposing the array interface, an object whose
+        __array__ method returns an array, or any (nested) sequence.
+    dtype : data-type, optional
+        The desired data-type for the array.  If not given, then the type will
+        be determined as the minimum type required to hold the objects in the
+        sequence.
+    copy : bool, optional
+        If true (default), then the object is copied.  Otherwise, a copy will
+        only be made if __array__ returns a copy, if obj is a nested sequence,
+        or if a copy is needed to satisfy any of the other requirements
+        (`dtype`, `order`, etc.).
+    order : {'K', 'A', 'C', 'F'}, optional
+        Specify the memory layout of the array. If object is not an array, the
+        newly created array will be in C order (row major) unless 'F' is
+        specified, in which case it will be in Fortran order (column major).
+        If object is an array the following holds.
+
+        ===== ========= ===================================================
+        order  no copy                     copy=True
+        ===== ========= ===================================================
+        'K'   unchanged F & C order preserved, otherwise most similar order
+        'A'   unchanged F order if input is F and not C, otherwise C order
+        'C'   C order   C order
+        'F'   F order   F order
+        ===== ========= ===================================================
+
+        When ``copy=False`` and a copy is made for other reasons, the result is
+        the same as if ``copy=True``, with some exceptions for `A`, see the
+        Notes section. The default order is 'K'.
+    subok : bool, optional
+        If True, then sub-classes will be passed-through, otherwise
+        the returned array will be forced to be a base-class array (default).
+    ndmin : int, optional
+        Specifies the minimum number of dimensions that the resulting
+        array should have.  Ones will be pre-pended to the shape as
+        needed to meet this requirement.
+
+    Returns
+    -------
+    out : ndarray
+        An array object satisfying the specified requirements.
+
+    See Also
+    --------
+    empty_like : Return an empty array with shape and type of input.
+    ones_like : Return an array of ones with shape and type of input.
+    zeros_like : Return an array of zeros with shape and type of input.
+    full_like : Return a new array with shape of input filled with value.
+    empty : Return a new uninitialized array.
+    ones : Return a new array setting values to one.
+    zeros : Return a new array setting values to zero.
+    full : Return a new array of given shape filled with value.
+
+
+    Notes
+    -----
+    When order is 'A' and `object` is an array in neither 'C' nor 'F' order,
+    and a copy is forced by a change in dtype, then the order of the result is
+    not necessarily 'C' as expected. This is likely a bug.
+
+    Examples
+    --------
+    >>> np.array([1, 2, 3])
+    array([1, 2, 3])
+
+    Upcasting:
+
+    >>> np.array([1, 2, 3.0])
+    array([ 1.,  2.,  3.])
+
+    More than one dimension:
+
+    >>> np.array([[1, 2], [3, 4]])
+    array([[1, 2],
+           [3, 4]])
+
+    Minimum dimensions 2:
+
+    >>> np.array([1, 2, 3], ndmin=2)
+    array([[1, 2, 3]])
+
+    Type provided:
+
+    >>> np.array([1, 2, 3], dtype=complex)
+    array([ 1.+0.j,  2.+0.j,  3.+0.j])
+
+    Data-type consisting of more than one element:
+
+    >>> x = np.array([(1,2),(3,4)],dtype=[('a','<i4'),('b','<i4')])
+    >>> x['a']
+    array([1, 3])
+
+    Creating an array from sub-classes:
+
+    >>> np.array(np.mat('1 2; 3 4'))
+    array([[1, 2],
+           [3, 4]])
+
+    >>> np.array(np.mat('1 2; 3 4'), subok=True)
+    matrix([[1, 2],
+            [3, 4]])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'empty',
+    """
+    empty(shape, dtype=float, order='C')
+
+    Return a new array of given shape and type, without initializing entries.
+
+    Parameters
+    ----------
+    shape : int or tuple of int
+        Shape of the empty array, e.g., ``(2, 3)`` or ``2``.
+    dtype : data-type, optional
+        Desired output data-type for the array, e.g, `numpy.int8`. Default is
+        `numpy.float64`.
+    order : {'C', 'F'}, optional, default: 'C'
+        Whether to store multi-dimensional data in row-major
+        (C-style) or column-major (Fortran-style) order in
+        memory.
+
+    Returns
+    -------
+    out : ndarray
+        Array of uninitialized (arbitrary) data of the given shape, dtype, and
+        order.  Object arrays will be initialized to None.
+
+    See Also
+    --------
+    empty_like : Return an empty array with shape and type of input.
+    ones : Return a new array setting values to one.
+    zeros : Return a new array setting values to zero.
+    full : Return a new array of given shape filled with value.
+
+
+    Notes
+    -----
+    `empty`, unlike `zeros`, does not set the array values to zero,
+    and may therefore be marginally faster.  On the other hand, it requires
+    the user to manually set all the values in the array, and should be
+    used with caution.
+
+    Examples
+    --------
+    >>> np.empty([2, 2])
+    array([[ -9.74499359e+001,   6.69583040e-309],
+           [  2.13182611e-314,   3.06959433e-309]])         #uninitialized
+
+    >>> np.empty([2, 2], dtype=int)
+    array([[-1073741821, -1067949133],
+           [  496041986,    19249760]])                     #uninitialized
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'scalar',
+    """
+    scalar(dtype, obj)
+
+    Return a new scalar array of the given type initialized with obj.
+
+    This function is meant mainly for pickle support. `dtype` must be a
+    valid data-type descriptor. If `dtype` corresponds to an object
+    descriptor, then `obj` can be any object, otherwise `obj` must be a
+    string. If `obj` is not given, it will be interpreted as None for object
+    type and as zeros for all other types.
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'zeros',
+    """
+    zeros(shape, dtype=float, order='C')
+
+    Return a new array of given shape and type, filled with zeros.
+
+    Parameters
+    ----------
+    shape : int or tuple of ints
+        Shape of the new array, e.g., ``(2, 3)`` or ``2``.
+    dtype : data-type, optional
+        The desired data-type for the array, e.g., `numpy.int8`.  Default is
+        `numpy.float64`.
+    order : {'C', 'F'}, optional, default: 'C'
+        Whether to store multi-dimensional data in row-major
+        (C-style) or column-major (Fortran-style) order in
+        memory.
+
+    Returns
+    -------
+    out : ndarray
+        Array of zeros with the given shape, dtype, and order.
+
+    See Also
+    --------
+    zeros_like : Return an array of zeros with shape and type of input.
+    empty : Return a new uninitialized array.
+    ones : Return a new array setting values to one.
+    full : Return a new array of given shape filled with value.
+
+    Examples
+    --------
+    >>> np.zeros(5)
+    array([ 0.,  0.,  0.,  0.,  0.])
+
+    >>> np.zeros((5,), dtype=int)
+    array([0, 0, 0, 0, 0])
+
+    >>> np.zeros((2, 1))
+    array([[ 0.],
+           [ 0.]])
+
+    >>> s = (2,2)
+    >>> np.zeros(s)
+    array([[ 0.,  0.],
+           [ 0.,  0.]])
+
+    >>> np.zeros((2,), dtype=[('x', 'i4'), ('y', 'i4')]) # custom dtype
+    array([(0, 0), (0, 0)],
+          dtype=[('x', '<i4'), ('y', '<i4')])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'set_typeDict',
+    """set_typeDict(dict)
+
+    Set the internal dictionary that can look up an array type using a
+    registered code.
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'fromstring',
+    """
+    fromstring(string, dtype=float, count=-1, sep='')
+
+    A new 1-D array initialized from text data in a string.
+
+    Parameters
+    ----------
+    string : str
+        A string containing the data.
+    dtype : data-type, optional
+        The data type of the array; default: float.  For binary input data,
+        the data must be in exactly this format. Most builtin numeric types are
+        supported and extension types may be supported.
+
+        .. versionadded:: 1.18.0
+            Complex dtypes.
+
+    count : int, optional
+        Read this number of `dtype` elements from the data.  If this is
+        negative (the default), the count will be determined from the
+        length of the data.
+    sep : str, optional
+        The string separating numbers in the data; extra whitespace between
+        elements is also ignored.
+
+        .. deprecated:: 1.14
+            Passing ``sep=''``, the default, is deprecated since it will
+            trigger the deprecated binary mode of this function. This mode
+            interprets `string` as binary bytes, rather than ASCII text with
+            decimal numbers, an operation which is better spelt
+            ``frombuffer(string, dtype, count)``. If `string` contains unicode
+            text, the binary mode of `fromstring` will first encode it into
+            bytes using either utf-8 (python 3) or the default encoding
+            (python 2), neither of which produce sane results.
+
+    Returns
+    -------
+    arr : ndarray
+        The constructed array.
+
+    Raises
+    ------
+    ValueError
+        If the string is not the correct size to satisfy the requested
+        `dtype` and `count`.
+
+    See Also
+    --------
+    frombuffer, fromfile, fromiter
+
+    Examples
+    --------
+    >>> np.fromstring('1 2', dtype=int, sep=' ')
+    array([1, 2])
+    >>> np.fromstring('1, 2', dtype=int, sep=',')
+    array([1, 2])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'compare_chararrays',
+    """
+    compare_chararrays(a, b, cmp_op, rstrip)
+
+    Performs element-wise comparison of two string arrays using the
+    comparison operator specified by `cmp_op`.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Arrays to be compared.
+    cmp_op : {"<", "<=", "==", ">=", ">", "!="}
+        Type of comparison.
+    rstrip : Boolean
+        If True, the spaces at the end of Strings are removed before the comparison.
+
+    Returns
+    -------
+    out : ndarray
+        The output array of type Boolean with the same shape as a and b.
+
+    Raises
+    ------
+    ValueError
+        If `cmp_op` is not valid.
+    TypeError
+        If at least one of `a` or `b` is a non-string array
+
+    Examples
+    --------
+    >>> a = np.array(["a", "b", "cde"])
+    >>> b = np.array(["a", "a", "dec"])
+    >>> np.compare_chararrays(a, b, ">", True)
+    array([False,  True, False])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'fromiter',
+    """
+    fromiter(iterable, dtype, count=-1)
+
+    Create a new 1-dimensional array from an iterable object.
+
+    Parameters
+    ----------
+    iterable : iterable object
+        An iterable object providing data for the array.
+    dtype : data-type
+        The data-type of the returned array.
+    count : int, optional
+        The number of items to read from *iterable*.  The default is -1,
+        which means all data is read.
+
+    Returns
+    -------
+    out : ndarray
+        The output array.
+
+    Notes
+    -----
+    Specify `count` to improve performance.  It allows ``fromiter`` to
+    pre-allocate the output array, instead of resizing it on demand.
+
+    Examples
+    --------
+    >>> iterable = (x*x for x in range(5))
+    >>> np.fromiter(iterable, float)
+    array([  0.,   1.,   4.,   9.,  16.])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'fromfile',
+    """
+    fromfile(file, dtype=float, count=-1, sep='', offset=0)
+
+    Construct an array from data in a text or binary file.
+
+    A highly efficient way of reading binary data with a known data-type,
+    as well as parsing simply formatted text files.  Data written using the
+    `tofile` method can be read using this function.
+
+    Parameters
+    ----------
+    file : file or str or Path
+        Open file object or filename.
+
+        .. versionchanged:: 1.17.0
+            `pathlib.Path` objects are now accepted.
+
+    dtype : data-type
+        Data type of the returned array.
+        For binary files, it is used to determine the size and byte-order
+        of the items in the file.
+        Most builtin numeric types are supported and extension types may be supported.
+
+        .. versionadded:: 1.18.0
+            Complex dtypes.
+
+    count : int
+        Number of items to read. ``-1`` means all items (i.e., the complete
+        file).
+    sep : str
+        Separator between items if file is a text file.
+        Empty ("") separator means the file should be treated as binary.
+        Spaces (" ") in the separator match zero or more whitespace characters.
+        A separator consisting only of spaces must match at least one
+        whitespace.
+    offset : int
+        The offset (in bytes) from the file's current position. Defaults to 0.
+        Only permitted for binary files.
+
+        .. versionadded:: 1.17.0
+
+    See also
+    --------
+    load, save
+    ndarray.tofile
+    loadtxt : More flexible way of loading data from a text file.
+
+    Notes
+    -----
+    Do not rely on the combination of `tofile` and `fromfile` for
+    data storage, as the binary files generated are not platform
+    independent.  In particular, no byte-order or data-type information is
+    saved.  Data can be stored in the platform independent ``.npy`` format
+    using `save` and `load` instead.
+
+    Examples
+    --------
+    Construct an ndarray:
+
+    >>> dt = np.dtype([('time', [('min', np.int64), ('sec', np.int64)]),
+    ...                ('temp', float)])
+    >>> x = np.zeros((1,), dtype=dt)
+    >>> x['time']['min'] = 10; x['temp'] = 98.25
+    >>> x
+    array([((10, 0), 98.25)],
+          dtype=[('time', [('min', '<i8'), ('sec', '<i8')]), ('temp', '<f8')])
+
+    Save the raw data to disk:
+
+    >>> import tempfile
+    >>> fname = tempfile.mkstemp()[1]
+    >>> x.tofile(fname)
+
+    Read the raw data from disk:
+
+    >>> np.fromfile(fname, dtype=dt)
+    array([((10, 0), 98.25)],
+          dtype=[('time', [('min', '<i8'), ('sec', '<i8')]), ('temp', '<f8')])
+
+    The recommended way to store and load data:
+
+    >>> np.save(fname, x)
+    >>> np.load(fname + '.npy')
+    array([((10, 0), 98.25)],
+          dtype=[('time', [('min', '<i8'), ('sec', '<i8')]), ('temp', '<f8')])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'frombuffer',
+    """
+    frombuffer(buffer, dtype=float, count=-1, offset=0)
+
+    Interpret a buffer as a 1-dimensional array.
+
+    Parameters
+    ----------
+    buffer : buffer_like
+        An object that exposes the buffer interface.
+    dtype : data-type, optional
+        Data-type of the returned array; default: float.
+    count : int, optional
+        Number of items to read. ``-1`` means all data in the buffer.
+    offset : int, optional
+        Start reading the buffer from this offset (in bytes); default: 0.
+
+    Notes
+    -----
+    If the buffer has data that is not in machine byte-order, this should
+    be specified as part of the data-type, e.g.::
+
+      >>> dt = np.dtype(int)
+      >>> dt = dt.newbyteorder('>')
+      >>> np.frombuffer(buf, dtype=dt) # doctest: +SKIP
+
+    The data of the resulting array will not be byteswapped, but will be
+    interpreted correctly.
+
+    Examples
+    --------
+    >>> s = b'hello world'
+    >>> np.frombuffer(s, dtype='S1', count=5, offset=6)
+    array([b'w', b'o', b'r', b'l', b'd'], dtype='|S1')
+
+    >>> np.frombuffer(b'\\x01\\x02', dtype=np.uint8)
+    array([1, 2], dtype=uint8)
+    >>> np.frombuffer(b'\\x01\\x02\\x03\\x04\\x05', dtype=np.uint8, count=3)
+    array([1, 2, 3], dtype=uint8)
+
+    """)
+
+add_newdoc('numpy.core', 'fastCopyAndTranspose',
+    """_fastCopyAndTranspose(a)""")
+
+add_newdoc('numpy.core.multiarray', 'correlate',
+    """cross_correlate(a,v, mode=0)""")
+
+add_newdoc('numpy.core.multiarray', 'arange',
+    """
+    arange([start,] stop[, step,], dtype=None)
+
+    Return evenly spaced values within a given interval.
+
+    Values are generated within the half-open interval ``[start, stop)``
+    (in other words, the interval including `start` but excluding `stop`).
+    For integer arguments the function is equivalent to the Python built-in
+    `range` function, but returns an ndarray rather than a list.
+
+    When using a non-integer step, such as 0.1, the results will often not
+    be consistent.  It is better to use `numpy.linspace` for these cases.
+
+    Parameters
+    ----------
+    start : number, optional
+        Start of interval.  The interval includes this value.  The default
+        start value is 0.
+    stop : number
+        End of interval.  The interval does not include this value, except
+        in some cases where `step` is not an integer and floating point
+        round-off affects the length of `out`.
+    step : number, optional
+        Spacing between values.  For any output `out`, this is the distance
+        between two adjacent values, ``out[i+1] - out[i]``.  The default
+        step size is 1.  If `step` is specified as a position argument,
+        `start` must also be given.
+    dtype : dtype
+        The type of the output array.  If `dtype` is not given, infer the data
+        type from the other input arguments.
+
+    Returns
+    -------
+    arange : ndarray
+        Array of evenly spaced values.
+
+        For floating point arguments, the length of the result is
+        ``ceil((stop - start)/step)``.  Because of floating point overflow,
+        this rule may result in the last element of `out` being greater
+        than `stop`.
+
+    See Also
+    --------
+    numpy.linspace : Evenly spaced numbers with careful handling of endpoints.
+    numpy.ogrid: Arrays of evenly spaced numbers in N-dimensions.
+    numpy.mgrid: Grid-shaped arrays of evenly spaced numbers in N-dimensions.
+
+    Examples
+    --------
+    >>> np.arange(3)
+    array([0, 1, 2])
+    >>> np.arange(3.0)
+    array([ 0.,  1.,  2.])
+    >>> np.arange(3,7)
+    array([3, 4, 5, 6])
+    >>> np.arange(3,7,2)
+    array([3, 5])
+
+    """)
+
+add_newdoc('numpy.core.multiarray', '_get_ndarray_c_version',
+    """_get_ndarray_c_version()
+
+    Return the compile time NPY_VERSION (formerly called NDARRAY_VERSION) number.
+
+    """)
+
+add_newdoc('numpy.core.multiarray', '_reconstruct',
+    """_reconstruct(subtype, shape, dtype)
+
+    Construct an empty array. Used by Pickles.
+
+    """)
+
+
+add_newdoc('numpy.core.multiarray', 'set_string_function',
+    """
+    set_string_function(f, repr=1)
+
+    Internal method to set a function to be used when pretty printing arrays.
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'set_numeric_ops',
+    """
+    set_numeric_ops(op1=func1, op2=func2, ...)
+
+    Set numerical operators for array objects.
+
+    .. deprecated:: 1.16
+
+        For the general case, use :c:func:`PyUFunc_ReplaceLoopBySignature`.
+        For ndarray subclasses, define the ``__array_ufunc__`` method and
+        override the relevant ufunc.
+
+    Parameters
+    ----------
+    op1, op2, ... : callable
+        Each ``op = func`` pair describes an operator to be replaced.
+        For example, ``add = lambda x, y: np.add(x, y) % 5`` would replace
+        addition by modulus 5 addition.
+
+    Returns
+    -------
+    saved_ops : list of callables
+        A list of all operators, stored before making replacements.
+
+    Notes
+    -----
+    .. WARNING::
+       Use with care!  Incorrect usage may lead to memory errors.
+
+    A function replacing an operator cannot make use of that operator.
+    For example, when replacing add, you may not use ``+``.  Instead,
+    directly call ufuncs.
+
+    Examples
+    --------
+    >>> def add_mod5(x, y):
+    ...     return np.add(x, y) % 5
+    ...
+    >>> old_funcs = np.set_numeric_ops(add=add_mod5)
+
+    >>> x = np.arange(12).reshape((3, 4))
+    >>> x + x
+    array([[0, 2, 4, 1],
+           [3, 0, 2, 4],
+           [1, 3, 0, 2]])
+
+    >>> ignore = np.set_numeric_ops(**old_funcs) # restore operators
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'promote_types',
+    """
+    promote_types(type1, type2)
+
+    Returns the data type with the smallest size and smallest scalar
+    kind to which both ``type1`` and ``type2`` may be safely cast.
+    The returned data type is always in native byte order.
+
+    This function is symmetric, but rarely associative.
+
+    Parameters
+    ----------
+    type1 : dtype or dtype specifier
+        First data type.
+    type2 : dtype or dtype specifier
+        Second data type.
+
+    Returns
+    -------
+    out : dtype
+        The promoted data type.
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    Starting in NumPy 1.9, promote_types function now returns a valid string
+    length when given an integer or float dtype as one argument and a string
+    dtype as another argument. Previously it always returned the input string
+    dtype, even if it wasn't long enough to store the max integer/float value
+    converted to a string.
+
+    See Also
+    --------
+    result_type, dtype, can_cast
+
+    Examples
+    --------
+    >>> np.promote_types('f4', 'f8')
+    dtype('float64')
+
+    >>> np.promote_types('i8', 'f4')
+    dtype('float64')
+
+    >>> np.promote_types('>i8', '<c8')
+    dtype('complex128')
+
+    >>> np.promote_types('i4', 'S8')
+    dtype('S11')
+
+    An example of a non-associative case:
+
+    >>> p = np.promote_types
+    >>> p('S', p('i1', 'u1'))
+    dtype('S6')
+    >>> p(p('S', 'i1'), 'u1')
+    dtype('S4')
+
+    """)
+
+add_newdoc('numpy.core.multiarray', 'c_einsum',
+    """
+    c_einsum(subscripts, *operands, out=None, dtype=None, order='K',
+           casting='safe')
+
+    *This documentation shadows that of the native python implementation of the `einsum` function,
+    except all references and examples related to the `optimize` argument (v 0.12.0) have been removed.*
+
+    Evaluates the Einstein summation convention on the operands.
+
+    Using the Einstein summation convention, many common multi-dimensional,
+    linear algebraic array operations can be represented in a simple fashion.
+    In *implicit* mode `einsum` computes these values.
+
+    In *explicit* mode, `einsum` provides further flexibility to compute
+    other array operations that might not be considered classical Einstein
+    summation operations, by disabling, or forcing summation over specified
+    subscript labels.
+
+    See the notes and examples for clarification.
+
+    Parameters
+    ----------
+    subscripts : str
+        Specifies the subscripts for summation as comma separated list of
+        subscript labels. An implicit (classical Einstein summation)
+        calculation is performed unless the explicit indicator '->' is
+        included as well as subscript labels of the precise output form.
+    operands : list of array_like
+        These are the arrays for the operation.
+    out : ndarray, optional
+        If provided, the calculation is done into this array.
+    dtype : {data-type, None}, optional
+        If provided, forces the calculation to use the data type specified.
+        Note that you may have to also give a more liberal `casting`
+        parameter to allow the conversions. Default is None.
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the memory layout of the output. 'C' means it should
+        be C contiguous. 'F' means it should be Fortran contiguous,
+        'A' means it should be 'F' if the inputs are all 'F', 'C' otherwise.
+        'K' means it should be as close to the layout as the inputs as
+        is possible, including arbitrarily permuted axes.
+        Default is 'K'.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur.  Setting this to
+        'unsafe' is not recommended, as it can adversely affect accumulations.
+
+          * 'no' means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
+          * 'safe' means only casts which can preserve values are allowed.
+          * 'same_kind' means only safe casts or casts within a kind,
+            like float64 to float32, are allowed.
+          * 'unsafe' means any data conversions may be done.
+
+        Default is 'safe'.
+    optimize : {False, True, 'greedy', 'optimal'}, optional
+        Controls if intermediate optimization should occur. No optimization
+        will occur if False and True will default to the 'greedy' algorithm.
+        Also accepts an explicit contraction list from the ``np.einsum_path``
+        function. See ``np.einsum_path`` for more details. Defaults to False.
+
+    Returns
+    -------
+    output : ndarray
+        The calculation based on the Einstein summation convention.
+
+    See Also
+    --------
+    einsum_path, dot, inner, outer, tensordot, linalg.multi_dot
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    The Einstein summation convention can be used to compute
+    many multi-dimensional, linear algebraic array operations. `einsum`
+    provides a succinct way of representing these.
+
+    A non-exhaustive list of these operations,
+    which can be computed by `einsum`, is shown below along with examples:
+
+    * Trace of an array, :py:func:`numpy.trace`.
+    * Return a diagonal, :py:func:`numpy.diag`.
+    * Array axis summations, :py:func:`numpy.sum`.
+    * Transpositions and permutations, :py:func:`numpy.transpose`.
+    * Matrix multiplication and dot product, :py:func:`numpy.matmul` :py:func:`numpy.dot`.
+    * Vector inner and outer products, :py:func:`numpy.inner` :py:func:`numpy.outer`.
+    * Broadcasting, element-wise and scalar multiplication, :py:func:`numpy.multiply`.
+    * Tensor contractions, :py:func:`numpy.tensordot`.
+    * Chained array operations, in efficient calculation order, :py:func:`numpy.einsum_path`.
+
+    The subscripts string is a comma-separated list of subscript labels,
+    where each label refers to a dimension of the corresponding operand.
+    Whenever a label is repeated it is summed, so ``np.einsum('i,i', a, b)``
+    is equivalent to :py:func:`np.inner(a,b) <numpy.inner>`. If a label
+    appears only once, it is not summed, so ``np.einsum('i', a)`` produces a
+    view of ``a`` with no changes. A further example ``np.einsum('ij,jk', a, b)``
+    describes traditional matrix multiplication and is equivalent to
+    :py:func:`np.matmul(a,b) <numpy.matmul>`. Repeated subscript labels in one
+    operand take the diagonal. For example, ``np.einsum('ii', a)`` is equivalent
+    to :py:func:`np.trace(a) <numpy.trace>`.
+
+    In *implicit mode*, the chosen subscripts are important
+    since the axes of the output are reordered alphabetically.  This
+    means that ``np.einsum('ij', a)`` doesn't affect a 2D array, while
+    ``np.einsum('ji', a)`` takes its transpose. Additionally,
+    ``np.einsum('ij,jk', a, b)`` returns a matrix multiplication, while,
+    ``np.einsum('ij,jh', a, b)`` returns the transpose of the
+    multiplication since subscript 'h' precedes subscript 'i'.
+
+    In *explicit mode* the output can be directly controlled by
+    specifying output subscript labels.  This requires the
+    identifier '->' as well as the list of output subscript labels.
+    This feature increases the flexibility of the function since
+    summing can be disabled or forced when required. The call
+    ``np.einsum('i->', a)`` is like :py:func:`np.sum(a, axis=-1) <numpy.sum>`,
+    and ``np.einsum('ii->i', a)`` is like :py:func:`np.diag(a) <numpy.diag>`.
+    The difference is that `einsum` does not allow broadcasting by default.
+    Additionally ``np.einsum('ij,jh->ih', a, b)`` directly specifies the
+    order of the output subscript labels and therefore returns matrix
+    multiplication, unlike the example above in implicit mode.
+
+    To enable and control broadcasting, use an ellipsis.  Default
+    NumPy-style broadcasting is done by adding an ellipsis
+    to the left of each term, like ``np.einsum('...ii->...i', a)``.
+    To take the trace along the first and last axes,
+    you can do ``np.einsum('i...i', a)``, or to do a matrix-matrix
+    product with the left-most indices instead of rightmost, one can do
+    ``np.einsum('ij...,jk...->ik...', a, b)``.
+
+    When there is only one operand, no axes are summed, and no output
+    parameter is provided, a view into the operand is returned instead
+    of a new array.  Thus, taking the diagonal as ``np.einsum('ii->i', a)``
+    produces a view (changed in version 1.10.0).
+
+    `einsum` also provides an alternative way to provide the subscripts
+    and operands as ``einsum(op0, sublist0, op1, sublist1, ..., [sublistout])``.
+    If the output shape is not provided in this format `einsum` will be
+    calculated in implicit mode, otherwise it will be performed explicitly.
+    The examples below have corresponding `einsum` calls with the two
+    parameter methods.
+
+    .. versionadded:: 1.10.0
+
+    Views returned from einsum are now writeable whenever the input array
+    is writeable. For example, ``np.einsum('ijk...->kji...', a)`` will now
+    have the same effect as :py:func:`np.swapaxes(a, 0, 2) <numpy.swapaxes>`
+    and ``np.einsum('ii->i', a)`` will return a writeable view of the diagonal
+    of a 2D array.
+
+    Examples
+    --------
+    >>> a = np.arange(25).reshape(5,5)
+    >>> b = np.arange(5)
+    >>> c = np.arange(6).reshape(2,3)
+
+    Trace of a matrix:
+
+    >>> np.einsum('ii', a)
+    60
+    >>> np.einsum(a, [0,0])
+    60
+    >>> np.trace(a)
+    60
+
+    Extract the diagonal (requires explicit form):
+
+    >>> np.einsum('ii->i', a)
+    array([ 0,  6, 12, 18, 24])
+    >>> np.einsum(a, [0,0], [0])
+    array([ 0,  6, 12, 18, 24])
+    >>> np.diag(a)
+    array([ 0,  6, 12, 18, 24])
+
+    Sum over an axis (requires explicit form):
+
+    >>> np.einsum('ij->i', a)
+    array([ 10,  35,  60,  85, 110])
+    >>> np.einsum(a, [0,1], [0])
+    array([ 10,  35,  60,  85, 110])
+    >>> np.sum(a, axis=1)
+    array([ 10,  35,  60,  85, 110])
+
+    For higher dimensional arrays summing a single axis can be done with ellipsis:
+
+    >>> np.einsum('...j->...', a)
+    array([ 10,  35,  60,  85, 110])
+    >>> np.einsum(a, [Ellipsis,1], [Ellipsis])
+    array([ 10,  35,  60,  85, 110])
+
+    Compute a matrix transpose, or reorder any number of axes:
+
+    >>> np.einsum('ji', c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.einsum('ij->ji', c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.einsum(c, [1,0])
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.transpose(c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+
+    Vector inner products:
+
+    >>> np.einsum('i,i', b, b)
+    30
+    >>> np.einsum(b, [0], b, [0])
+    30
+    >>> np.inner(b,b)
+    30
+
+    Matrix vector multiplication:
+
+    >>> np.einsum('ij,j', a, b)
+    array([ 30,  80, 130, 180, 230])
+    >>> np.einsum(a, [0,1], b, [1])
+    array([ 30,  80, 130, 180, 230])
+    >>> np.dot(a, b)
+    array([ 30,  80, 130, 180, 230])
+    >>> np.einsum('...j,j', a, b)
+    array([ 30,  80, 130, 180, 230])
+
+    Broadcasting and scalar multiplication:
+
+    >>> np.einsum('..., ...', 3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.einsum(',ij', 3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.einsum(3, [Ellipsis], c, [Ellipsis])
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.multiply(3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+
+    Vector outer product:
+
+    >>> np.einsum('i,j', np.arange(2)+1, b)
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+    >>> np.einsum(np.arange(2)+1, [0], b, [1])
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+    >>> np.outer(np.arange(2)+1, b)
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+
+    Tensor contraction:
+
+    >>> a = np.arange(60.).reshape(3,4,5)
+    >>> b = np.arange(24.).reshape(4,3,2)
+    >>> np.einsum('ijk,jil->kl', a, b)
+    array([[ 4400.,  4730.],
+           [ 4532.,  4874.],
+           [ 4664.,  5018.],
+           [ 4796.,  5162.],
+           [ 4928.,  5306.]])
+    >>> np.einsum(a, [0,1,2], b, [1,0,3], [2,3])
+    array([[ 4400.,  4730.],
+           [ 4532.,  4874.],
+           [ 4664.,  5018.],
+           [ 4796.,  5162.],
+           [ 4928.,  5306.]])
+    >>> np.tensordot(a,b, axes=([1,0],[0,1]))
+    array([[ 4400.,  4730.],
+           [ 4532.,  4874.],
+           [ 4664.,  5018.],
+           [ 4796.,  5162.],
+           [ 4928.,  5306.]])
+
+    Writeable returned arrays (since version 1.10.0):
+
+    >>> a = np.zeros((3, 3))
+    >>> np.einsum('ii->i', a)[:] = 1
+    >>> a
+    array([[ 1.,  0.,  0.],
+           [ 0.,  1.,  0.],
+           [ 0.,  0.,  1.]])
+
+    Example of ellipsis use:
+
+    >>> a = np.arange(6).reshape((3,2))
+    >>> b = np.arange(12).reshape((4,3))
+    >>> np.einsum('ki,jk->ij', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+    >>> np.einsum('ki,...k->i...', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+    >>> np.einsum('k...,jk', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+
+    """)
+
+
+##############################################################################
+#
+# Documentation for ndarray attributes and methods
+#
+##############################################################################
+
+
+##############################################################################
+#
+# ndarray object
+#
+##############################################################################
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray',
+    """
+    ndarray(shape, dtype=float, buffer=None, offset=0,
+            strides=None, order=None)
+
+    An array object represents a multidimensional, homogeneous array
+    of fixed-size items.  An associated data-type object describes the
+    format of each element in the array (its byte-order, how many bytes it
+    occupies in memory, whether it is an integer, a floating point number,
+    or something else, etc.)
+
+    Arrays should be constructed using `array`, `zeros` or `empty` (refer
+    to the See Also section below).  The parameters given here refer to
+    a low-level method (`ndarray(...)`) for instantiating an array.
+
+    For more information, refer to the `numpy` module and examine the
+    methods and attributes of an array.
+
+    Parameters
+    ----------
+    (for the __new__ method; see Notes below)
+
+    shape : tuple of ints
+        Shape of created array.
+    dtype : data-type, optional
+        Any object that can be interpreted as a numpy data type.
+    buffer : object exposing buffer interface, optional
+        Used to fill the array with data.
+    offset : int, optional
+        Offset of array data in buffer.
+    strides : tuple of ints, optional
+        Strides of data in memory.
+    order : {'C', 'F'}, optional
+        Row-major (C-style) or column-major (Fortran-style) order.
+
+    Attributes
+    ----------
+    T : ndarray
+        Transpose of the array.
+    data : buffer
+        The array's elements, in memory.
+    dtype : dtype object
+        Describes the format of the elements in the array.
+    flags : dict
+        Dictionary containing information related to memory use, e.g.,
+        'C_CONTIGUOUS', 'OWNDATA', 'WRITEABLE', etc.
+    flat : numpy.flatiter object
+        Flattened version of the array as an iterator.  The iterator
+        allows assignments, e.g., ``x.flat = 3`` (See `ndarray.flat` for
+        assignment examples; TODO).
+    imag : ndarray
+        Imaginary part of the array.
+    real : ndarray
+        Real part of the array.
+    size : int
+        Number of elements in the array.
+    itemsize : int
+        The memory use of each array element in bytes.
+    nbytes : int
+        The total number of bytes required to store the array data,
+        i.e., ``itemsize * size``.
+    ndim : int
+        The array's number of dimensions.
+    shape : tuple of ints
+        Shape of the array.
+    strides : tuple of ints
+        The step-size required to move from one element to the next in
+        memory. For example, a contiguous ``(3, 4)`` array of type
+        ``int16`` in C-order has strides ``(8, 2)``.  This implies that
+        to move from element to element in memory requires jumps of 2 bytes.
+        To move from row-to-row, one needs to jump 8 bytes at a time
+        (``2 * 4``).
+    ctypes : ctypes object
+        Class containing properties of the array needed for interaction
+        with ctypes.
+    base : ndarray
+        If the array is a view into another array, that array is its `base`
+        (unless that array is also a view).  The `base` array is where the
+        array data is actually stored.
+
+    See Also
+    --------
+    array : Construct an array.
+    zeros : Create an array, each element of which is zero.
+    empty : Create an array, but leave its allocated memory unchanged (i.e.,
+            it contains "garbage").
+    dtype : Create a data-type.
+
+    Notes
+    -----
+    There are two modes of creating an array using ``__new__``:
+
+    1. If `buffer` is None, then only `shape`, `dtype`, and `order`
+       are used.
+    2. If `buffer` is an object exposing the buffer interface, then
+       all keywords are interpreted.
+
+    No ``__init__`` method is needed because the array is fully initialized
+    after the ``__new__`` method.
+
+    Examples
+    --------
+    These examples illustrate the low-level `ndarray` constructor.  Refer
+    to the `See Also` section above for easier ways of constructing an
+    ndarray.
+
+    First mode, `buffer` is None:
+
+    >>> np.ndarray(shape=(2,2), dtype=float, order='F')
+    array([[0.0e+000, 0.0e+000], # random
+           [     nan, 2.5e-323]])
+
+    Second mode:
+
+    >>> np.ndarray((2,), buffer=np.array([1,2,3]),
+    ...            offset=np.int_().itemsize,
+    ...            dtype=int) # offset = 1*itemsize, i.e. skip first element
+    array([2, 3])
+
+    """)
+
+
+##############################################################################
+#
+# ndarray attributes
+#
+##############################################################################
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_interface__',
+    """Array protocol: Python side."""))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_finalize__',
+    """None."""))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_priority__',
+    """Array priority."""))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_struct__',
+    """Array protocol: C-struct side."""))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('base',
+    """
+    Base object if memory is from some other object.
+
+    Examples
+    --------
+    The base of an array that owns its memory is None:
+
+    >>> x = np.array([1,2,3,4])
+    >>> x.base is None
+    True
+
+    Slicing creates a view, whose memory is shared with x:
+
+    >>> y = x[2:]
+    >>> y.base is x
+    True
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('ctypes',
+    """
+    An object to simplify the interaction of the array with the ctypes
+    module.
+
+    This attribute creates an object that makes it easier to use arrays
+    when calling shared libraries with the ctypes module. The returned
+    object has, among others, data, shape, and strides attributes (see
+    Notes below) which themselves return ctypes objects that can be used
+    as arguments to a shared library.
+
+    Parameters
+    ----------
+    None
+
+    Returns
+    -------
+    c : Python object
+        Possessing attributes data, shape, strides, etc.
+
+    See Also
+    --------
+    numpy.ctypeslib
+
+    Notes
+    -----
+    Below are the public attributes of this object which were documented
+    in "Guide to NumPy" (we have omitted undocumented public attributes,
+    as well as documented private attributes):
+
+    .. autoattribute:: numpy.core._internal._ctypes.data
+        :noindex:
+
+    .. autoattribute:: numpy.core._internal._ctypes.shape
+        :noindex:
+
+    .. autoattribute:: numpy.core._internal._ctypes.strides
+        :noindex:
+
+    .. automethod:: numpy.core._internal._ctypes.data_as
+        :noindex:
+
+    .. automethod:: numpy.core._internal._ctypes.shape_as
+        :noindex:
+
+    .. automethod:: numpy.core._internal._ctypes.strides_as
+        :noindex:
+
+    If the ctypes module is not available, then the ctypes attribute
+    of array objects still returns something useful, but ctypes objects
+    are not returned and errors may be raised instead. In particular,
+    the object will still have the ``as_parameter`` attribute which will
+    return an integer equal to the data attribute.
+
+    Examples
+    --------
+    >>> import ctypes
+    >>> x = np.array([[0, 1], [2, 3]], dtype=np.int32)
+    >>> x
+    array([[0, 1],
+           [2, 3]], dtype=int32)
+    >>> x.ctypes.data
+    31962608 # may vary
+    >>> x.ctypes.data_as(ctypes.POINTER(ctypes.c_uint32))
+    <__main__.LP_c_uint object at 0x7ff2fc1fc200> # may vary
+    >>> x.ctypes.data_as(ctypes.POINTER(ctypes.c_uint32)).contents
+    c_uint(0)
+    >>> x.ctypes.data_as(ctypes.POINTER(ctypes.c_uint64)).contents
+    c_ulong(4294967296)
+    >>> x.ctypes.shape
+    <numpy.core._internal.c_long_Array_2 object at 0x7ff2fc1fce60> # may vary
+    >>> x.ctypes.strides
+    <numpy.core._internal.c_long_Array_2 object at 0x7ff2fc1ff320> # may vary
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('data',
+    """Python buffer object pointing to the start of the array's data."""))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('dtype',
+    """
+    Data-type of the array's elements.
+
+    Parameters
+    ----------
+    None
+
+    Returns
+    -------
+    d : numpy dtype object
+
+    See Also
+    --------
+    numpy.dtype
+
+    Examples
+    --------
+    >>> x
+    array([[0, 1],
+           [2, 3]])
+    >>> x.dtype
+    dtype('int32')
+    >>> type(x.dtype)
+    <type 'numpy.dtype'>
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('imag',
+    """
+    The imaginary part of the array.
+
+    Examples
+    --------
+    >>> x = np.sqrt([1+0j, 0+1j])
+    >>> x.imag
+    array([ 0.        ,  0.70710678])
+    >>> x.imag.dtype
+    dtype('float64')
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('itemsize',
+    """
+    Length of one array element in bytes.
+
+    Examples
+    --------
+    >>> x = np.array([1,2,3], dtype=np.float64)
+    >>> x.itemsize
+    8
+    >>> x = np.array([1,2,3], dtype=np.complex128)
+    >>> x.itemsize
+    16
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('flags',
+    """
+    Information about the memory layout of the array.
+
+    Attributes
+    ----------
+    C_CONTIGUOUS (C)
+        The data is in a single, C-style contiguous segment.
+    F_CONTIGUOUS (F)
+        The data is in a single, Fortran-style contiguous segment.
+    OWNDATA (O)
+        The array owns the memory it uses or borrows it from another object.
+    WRITEABLE (W)
+        The data area can be written to.  Setting this to False locks
+        the data, making it read-only.  A view (slice, etc.) inherits WRITEABLE
+        from its base array at creation time, but a view of a writeable
+        array may be subsequently locked while the base array remains writeable.
+        (The opposite is not true, in that a view of a locked array may not
+        be made writeable.  However, currently, locking a base object does not
+        lock any views that already reference it, so under that circumstance it
+        is possible to alter the contents of a locked array via a previously
+        created writeable view onto it.)  Attempting to change a non-writeable
+        array raises a RuntimeError exception.
+    ALIGNED (A)
+        The data and all elements are aligned appropriately for the hardware.
+    WRITEBACKIFCOPY (X)
+        This array is a copy of some other array. The C-API function
+        PyArray_ResolveWritebackIfCopy must be called before deallocating
+        to the base array will be updated with the contents of this array.
+    UPDATEIFCOPY (U)
+        (Deprecated, use WRITEBACKIFCOPY) This array is a copy of some other array.
+        When this array is
+        deallocated, the base array will be updated with the contents of
+        this array.
+    FNC
+        F_CONTIGUOUS and not C_CONTIGUOUS.
+    FORC
+        F_CONTIGUOUS or C_CONTIGUOUS (one-segment test).
+    BEHAVED (B)
+        ALIGNED and WRITEABLE.
+    CARRAY (CA)
+        BEHAVED and C_CONTIGUOUS.
+    FARRAY (FA)
+        BEHAVED and F_CONTIGUOUS and not C_CONTIGUOUS.
+
+    Notes
+    -----
+    The `flags` object can be accessed dictionary-like (as in ``a.flags['WRITEABLE']``),
+    or by using lowercased attribute names (as in ``a.flags.writeable``). Short flag
+    names are only supported in dictionary access.
+
+    Only the WRITEBACKIFCOPY, UPDATEIFCOPY, WRITEABLE, and ALIGNED flags can be
+    changed by the user, via direct assignment to the attribute or dictionary
+    entry, or by calling `ndarray.setflags`.
+
+    The array flags cannot be set arbitrarily:
+
+    - UPDATEIFCOPY can only be set ``False``.
+    - WRITEBACKIFCOPY can only be set ``False``.
+    - ALIGNED can only be set ``True`` if the data is truly aligned.
+    - WRITEABLE can only be set ``True`` if the array owns its own memory
+      or the ultimate owner of the memory exposes a writeable buffer
+      interface or is a string.
+
+    Arrays can be both C-style and Fortran-style contiguous simultaneously.
+    This is clear for 1-dimensional arrays, but can also be true for higher
+    dimensional arrays.
+
+    Even for contiguous arrays a stride for a given dimension
+    ``arr.strides[dim]`` may be *arbitrary* if ``arr.shape[dim] == 1``
+    or the array has no elements.
+    It does *not* generally hold that ``self.strides[-1] == self.itemsize``
+    for C-style contiguous arrays or ``self.strides[0] == self.itemsize`` for
+    Fortran-style contiguous arrays is true.
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('flat',
+    """
+    A 1-D iterator over the array.
+
+    This is a `numpy.flatiter` instance, which acts similarly to, but is not
+    a subclass of, Python's built-in iterator object.
+
+    See Also
+    --------
+    flatten : Return a copy of the array collapsed into one dimension.
+
+    flatiter
+
+    Examples
+    --------
+    >>> x = np.arange(1, 7).reshape(2, 3)
+    >>> x
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> x.flat[3]
+    4
+    >>> x.T
+    array([[1, 4],
+           [2, 5],
+           [3, 6]])
+    >>> x.T.flat[3]
+    5
+    >>> type(x.flat)
+    <class 'numpy.flatiter'>
+
+    An assignment example:
+
+    >>> x.flat = 3; x
+    array([[3, 3, 3],
+           [3, 3, 3]])
+    >>> x.flat[[1,4]] = 1; x
+    array([[3, 1, 3],
+           [3, 1, 3]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('nbytes',
+    """
+    Total bytes consumed by the elements of the array.
+
+    Notes
+    -----
+    Does not include memory consumed by non-element attributes of the
+    array object.
+
+    Examples
+    --------
+    >>> x = np.zeros((3,5,2), dtype=np.complex128)
+    >>> x.nbytes
+    480
+    >>> np.prod(x.shape) * x.itemsize
+    480
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('ndim',
+    """
+    Number of array dimensions.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> x.ndim
+    1
+    >>> y = np.zeros((2, 3, 4))
+    >>> y.ndim
+    3
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('real',
+    """
+    The real part of the array.
+
+    Examples
+    --------
+    >>> x = np.sqrt([1+0j, 0+1j])
+    >>> x.real
+    array([ 1.        ,  0.70710678])
+    >>> x.real.dtype
+    dtype('float64')
+
+    See Also
+    --------
+    numpy.real : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('shape',
+    """
+    Tuple of array dimensions.
+
+    The shape property is usually used to get the current shape of an array,
+    but may also be used to reshape the array in-place by assigning a tuple of
+    array dimensions to it.  As with `numpy.reshape`, one of the new shape
+    dimensions can be -1, in which case its value is inferred from the size of
+    the array and the remaining dimensions. Reshaping an array in-place will
+    fail if a copy is required.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3, 4])
+    >>> x.shape
+    (4,)
+    >>> y = np.zeros((2, 3, 4))
+    >>> y.shape
+    (2, 3, 4)
+    >>> y.shape = (3, 8)
+    >>> y
+    array([[ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+           [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.],
+           [ 0.,  0.,  0.,  0.,  0.,  0.,  0.,  0.]])
+    >>> y.shape = (3, 6)
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+    ValueError: total size of new array must be unchanged
+    >>> np.zeros((4,2))[::2].shape = (-1,)
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+    AttributeError: Incompatible shape for in-place modification. Use
+    `.reshape()` to make a copy with the desired shape.
+
+    See Also
+    --------
+    numpy.reshape : similar function
+    ndarray.reshape : similar method
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('size',
+    """
+    Number of elements in the array.
+
+    Equal to ``np.prod(a.shape)``, i.e., the product of the array's
+    dimensions.
+
+    Notes
+    -----
+    `a.size` returns a standard arbitrary precision Python integer. This
+    may not be the case with other methods of obtaining the same value
+    (like the suggested ``np.prod(a.shape)``, which returns an instance
+    of ``np.int_``), and may be relevant if the value is used further in
+    calculations that may overflow a fixed size integer type.
+
+    Examples
+    --------
+    >>> x = np.zeros((3, 5, 2), dtype=np.complex128)
+    >>> x.size
+    30
+    >>> np.prod(x.shape)
+    30
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('strides',
+    """
+    Tuple of bytes to step in each dimension when traversing an array.
+
+    The byte offset of element ``(i[0], i[1], ..., i[n])`` in an array `a`
+    is::
+
+        offset = sum(np.array(i) * a.strides)
+
+    A more detailed explanation of strides can be found in the
+    "ndarray.rst" file in the NumPy reference guide.
+
+    Notes
+    -----
+    Imagine an array of 32-bit integers (each 4 bytes)::
+
+      x = np.array([[0, 1, 2, 3, 4],
+                    [5, 6, 7, 8, 9]], dtype=np.int32)
+
+    This array is stored in memory as 40 bytes, one after the other
+    (known as a contiguous block of memory).  The strides of an array tell
+    us how many bytes we have to skip in memory to move to the next position
+    along a certain axis.  For example, we have to skip 4 bytes (1 value) to
+    move to the next column, but 20 bytes (5 values) to get to the same
+    position in the next row.  As such, the strides for the array `x` will be
+    ``(20, 4)``.
+
+    See Also
+    --------
+    numpy.lib.stride_tricks.as_strided
+
+    Examples
+    --------
+    >>> y = np.reshape(np.arange(2*3*4), (2,3,4))
+    >>> y
+    array([[[ 0,  1,  2,  3],
+            [ 4,  5,  6,  7],
+            [ 8,  9, 10, 11]],
+           [[12, 13, 14, 15],
+            [16, 17, 18, 19],
+            [20, 21, 22, 23]]])
+    >>> y.strides
+    (48, 16, 4)
+    >>> y[1,1,1]
+    17
+    >>> offset=sum(y.strides * np.array((1,1,1)))
+    >>> offset/y.itemsize
+    17
+
+    >>> x = np.reshape(np.arange(5*6*7*8), (5,6,7,8)).transpose(2,3,1,0)
+    >>> x.strides
+    (32, 4, 224, 1344)
+    >>> i = np.array([3,5,2,2])
+    >>> offset = sum(i * x.strides)
+    >>> x[3,5,2,2]
+    813
+    >>> offset / x.itemsize
+    813
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('T',
+    """
+    The transposed array.
+
+    Same as ``self.transpose()``.
+
+    Examples
+    --------
+    >>> x = np.array([[1.,2.],[3.,4.]])
+    >>> x
+    array([[ 1.,  2.],
+           [ 3.,  4.]])
+    >>> x.T
+    array([[ 1.,  3.],
+           [ 2.,  4.]])
+    >>> x = np.array([1.,2.,3.,4.])
+    >>> x
+    array([ 1.,  2.,  3.,  4.])
+    >>> x.T
+    array([ 1.,  2.,  3.,  4.])
+
+    See Also
+    --------
+    transpose
+
+    """))
+
+
+##############################################################################
+#
+# ndarray methods
+#
+##############################################################################
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array__',
+    """ a.__array__([dtype], /) -> reference if type unchanged, copy otherwise.
+
+    Returns either a new reference to self if dtype is not given or a new array
+    of provided data type if dtype is different from the current dtype of the
+    array.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_prepare__',
+    """a.__array_prepare__(obj) -> Object of same type as ndarray object obj.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__array_wrap__',
+    """a.__array_wrap__(obj) -> Object of same type as ndarray object a.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__copy__',
+    """a.__copy__()
+
+    Used if :func:`copy.copy` is called on an array. Returns a copy of the array.
+
+    Equivalent to ``a.copy(order='K')``.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__deepcopy__',
+    """a.__deepcopy__(memo, /) -> Deep copy of array.
+
+    Used if :func:`copy.deepcopy` is called on an array.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__reduce__',
+    """a.__reduce__()
+
+    For pickling.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('__setstate__',
+    """a.__setstate__(state, /)
+
+    For unpickling.
+
+    The `state` argument must be a sequence that contains the following
+    elements:
+
+    Parameters
+    ----------
+    version : int
+        optional pickle version. If omitted defaults to 0.
+    shape : tuple
+    dtype : data-type
+    isFortran : bool
+    rawdata : string or list
+        a binary string with the data (or a list if 'a' is an object array)
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('all',
+    """
+    a.all(axis=None, out=None, keepdims=False)
+
+    Returns True if all elements evaluate to True.
+
+    Refer to `numpy.all` for full documentation.
+
+    See Also
+    --------
+    numpy.all : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('any',
+    """
+    a.any(axis=None, out=None, keepdims=False)
+
+    Returns True if any of the elements of `a` evaluate to True.
+
+    Refer to `numpy.any` for full documentation.
+
+    See Also
+    --------
+    numpy.any : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('argmax',
+    """
+    a.argmax(axis=None, out=None)
+
+    Return indices of the maximum values along the given axis.
+
+    Refer to `numpy.argmax` for full documentation.
+
+    See Also
+    --------
+    numpy.argmax : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('argmin',
+    """
+    a.argmin(axis=None, out=None)
+
+    Return indices of the minimum values along the given axis of `a`.
+
+    Refer to `numpy.argmin` for detailed documentation.
+
+    See Also
+    --------
+    numpy.argmin : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('argsort',
+    """
+    a.argsort(axis=-1, kind=None, order=None)
+
+    Returns the indices that would sort this array.
+
+    Refer to `numpy.argsort` for full documentation.
+
+    See Also
+    --------
+    numpy.argsort : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('argpartition',
+    """
+    a.argpartition(kth, axis=-1, kind='introselect', order=None)
+
+    Returns the indices that would partition this array.
+
+    Refer to `numpy.argpartition` for full documentation.
+
+    .. versionadded:: 1.8.0
+
+    See Also
+    --------
+    numpy.argpartition : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('astype',
+    """
+    a.astype(dtype, order='K', casting='unsafe', subok=True, copy=True)
+
+    Copy of the array, cast to a specified type.
+
+    Parameters
+    ----------
+    dtype : str or dtype
+        Typecode or data-type to which the array is cast.
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the memory layout order of the result.
+        'C' means C order, 'F' means Fortran order, 'A'
+        means 'F' order if all the arrays are Fortran contiguous,
+        'C' order otherwise, and 'K' means as close to the
+        order the array elements appear in memory as possible.
+        Default is 'K'.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur. Defaults to 'unsafe'
+        for backwards compatibility.
+
+          * 'no' means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
+          * 'safe' means only casts which can preserve values are allowed.
+          * 'same_kind' means only safe casts or casts within a kind,
+            like float64 to float32, are allowed.
+          * 'unsafe' means any data conversions may be done.
+    subok : bool, optional
+        If True, then sub-classes will be passed-through (default), otherwise
+        the returned array will be forced to be a base-class array.
+    copy : bool, optional
+        By default, astype always returns a newly allocated array. If this
+        is set to false, and the `dtype`, `order`, and `subok`
+        requirements are satisfied, the input array is returned instead
+        of a copy.
+
+    Returns
+    -------
+    arr_t : ndarray
+        Unless `copy` is False and the other conditions for returning the input
+        array are satisfied (see description for `copy` input parameter), `arr_t`
+        is a new array of the same shape as the input array, with dtype, order
+        given by `dtype`, `order`.
+
+    Notes
+    -----
+    .. versionchanged:: 1.17.0
+       Casting between a simple data type and a structured one is possible only
+       for "unsafe" casting.  Casting to multiple fields is allowed, but
+       casting from multiple fields is not.
+
+    .. versionchanged:: 1.9.0
+       Casting from numeric to string types in 'safe' casting mode requires
+       that the string dtype length is long enough to store the max
+       integer/float value converted.
+
+    Raises
+    ------
+    ComplexWarning
+        When casting from complex to float or int. To avoid this,
+        one should use ``a.real.astype(t)``.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 2.5])
+    >>> x
+    array([1. ,  2. ,  2.5])
+
+    >>> x.astype(int)
+    array([1, 2, 2])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('byteswap',
+    """
+    a.byteswap(inplace=False)
+
+    Swap the bytes of the array elements
+
+    Toggle between low-endian and big-endian data representation by
+    returning a byteswapped array, optionally swapped in-place.
+    Arrays of byte-strings are not swapped. The real and imaginary
+    parts of a complex number are swapped individually.
+
+    Parameters
+    ----------
+    inplace : bool, optional
+        If ``True``, swap bytes in-place, default is ``False``.
+
+    Returns
+    -------
+    out : ndarray
+        The byteswapped array. If `inplace` is ``True``, this is
+        a view to self.
+
+    Examples
+    --------
+    >>> A = np.array([1, 256, 8755], dtype=np.int16)
+    >>> list(map(hex, A))
+    ['0x1', '0x100', '0x2233']
+    >>> A.byteswap(inplace=True)
+    array([  256,     1, 13090], dtype=int16)
+    >>> list(map(hex, A))
+    ['0x100', '0x1', '0x3322']
+
+    Arrays of byte-strings are not swapped
+
+    >>> A = np.array([b'ceg', b'fac'])
+    >>> A.byteswap()
+    array([b'ceg', b'fac'], dtype='|S3')
+
+    ``A.newbyteorder().byteswap()`` produces an array with the same values
+      but different representation in memory
+
+    >>> A = np.array([1, 2, 3])
+    >>> A.view(np.uint8)
+    array([1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0, 0, 3, 0, 0, 0, 0, 0,
+           0, 0], dtype=uint8)
+    >>> A.newbyteorder().byteswap(inplace=True)
+    array([1, 2, 3])
+    >>> A.view(np.uint8)
+    array([0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 0, 0, 0, 0,
+           0, 3], dtype=uint8)
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('choose',
+    """
+    a.choose(choices, out=None, mode='raise')
+
+    Use an index array to construct a new array from a set of choices.
+
+    Refer to `numpy.choose` for full documentation.
+
+    See Also
+    --------
+    numpy.choose : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('clip',
+    """
+    a.clip(min=None, max=None, out=None, **kwargs)
+
+    Return an array whose values are limited to ``[min, max]``.
+    One of max or min must be given.
+
+    Refer to `numpy.clip` for full documentation.
+
+    See Also
+    --------
+    numpy.clip : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('compress',
+    """
+    a.compress(condition, axis=None, out=None)
+
+    Return selected slices of this array along given axis.
+
+    Refer to `numpy.compress` for full documentation.
+
+    See Also
+    --------
+    numpy.compress : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('conj',
+    """
+    a.conj()
+
+    Complex-conjugate all elements.
+
+    Refer to `numpy.conjugate` for full documentation.
+
+    See Also
+    --------
+    numpy.conjugate : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('conjugate',
+    """
+    a.conjugate()
+
+    Return the complex conjugate, element-wise.
+
+    Refer to `numpy.conjugate` for full documentation.
+
+    See Also
+    --------
+    numpy.conjugate : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('copy',
+    """
+    a.copy(order='C')
+
+    Return a copy of the array.
+
+    Parameters
+    ----------
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the memory layout of the copy. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
+        'C' otherwise. 'K' means match the layout of `a` as closely
+        as possible. (Note that this function and :func:`numpy.copy` are very
+        similar, but have different default values for their order=
+        arguments.)
+
+    See also
+    --------
+    numpy.copy
+    numpy.copyto
+
+    Examples
+    --------
+    >>> x = np.array([[1,2,3],[4,5,6]], order='F')
+
+    >>> y = x.copy()
+
+    >>> x.fill(0)
+
+    >>> x
+    array([[0, 0, 0],
+           [0, 0, 0]])
+
+    >>> y
+    array([[1, 2, 3],
+           [4, 5, 6]])
+
+    >>> y.flags['C_CONTIGUOUS']
+    True
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('cumprod',
+    """
+    a.cumprod(axis=None, dtype=None, out=None)
+
+    Return the cumulative product of the elements along the given axis.
+
+    Refer to `numpy.cumprod` for full documentation.
+
+    See Also
+    --------
+    numpy.cumprod : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('cumsum',
+    """
+    a.cumsum(axis=None, dtype=None, out=None)
+
+    Return the cumulative sum of the elements along the given axis.
+
+    Refer to `numpy.cumsum` for full documentation.
+
+    See Also
+    --------
+    numpy.cumsum : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('diagonal',
+    """
+    a.diagonal(offset=0, axis1=0, axis2=1)
+
+    Return specified diagonals. In NumPy 1.9 the returned array is a
+    read-only view instead of a copy as in previous NumPy versions.  In
+    a future version the read-only restriction will be removed.
+
+    Refer to :func:`numpy.diagonal` for full documentation.
+
+    See Also
+    --------
+    numpy.diagonal : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('dot',
+    """
+    a.dot(b, out=None)
+
+    Dot product of two arrays.
+
+    Refer to `numpy.dot` for full documentation.
+
+    See Also
+    --------
+    numpy.dot : equivalent function
+
+    Examples
+    --------
+    >>> a = np.eye(2)
+    >>> b = np.ones((2, 2)) * 2
+    >>> a.dot(b)
+    array([[2.,  2.],
+           [2.,  2.]])
+
+    This array method can be conveniently chained:
+
+    >>> a.dot(b).dot(b)
+    array([[8.,  8.],
+           [8.,  8.]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('dump',
+    """a.dump(file)
+
+    Dump a pickle of the array to the specified file.
+    The array can be read back with pickle.load or numpy.load.
+
+    Parameters
+    ----------
+    file : str or Path
+        A string naming the dump file.
+
+        .. versionchanged:: 1.17.0
+            `pathlib.Path` objects are now accepted.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('dumps',
+    """
+    a.dumps()
+
+    Returns the pickle of the array as a string.
+    pickle.loads or numpy.loads will convert the string back to an array.
+
+    Parameters
+    ----------
+    None
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('fill',
+    """
+    a.fill(value)
+
+    Fill the array with a scalar value.
+
+    Parameters
+    ----------
+    value : scalar
+        All elements of `a` will be assigned this value.
+
+    Examples
+    --------
+    >>> a = np.array([1, 2])
+    >>> a.fill(0)
+    >>> a
+    array([0, 0])
+    >>> a = np.empty(2)
+    >>> a.fill(1)
+    >>> a
+    array([1.,  1.])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('flatten',
+    """
+    a.flatten(order='C')
+
+    Return a copy of the array collapsed into one dimension.
+
+    Parameters
+    ----------
+    order : {'C', 'F', 'A', 'K'}, optional
+        'C' means to flatten in row-major (C-style) order.
+        'F' means to flatten in column-major (Fortran-
+        style) order. 'A' means to flatten in column-major
+        order if `a` is Fortran *contiguous* in memory,
+        row-major order otherwise. 'K' means to flatten
+        `a` in the order the elements occur in memory.
+        The default is 'C'.
+
+    Returns
+    -------
+    y : ndarray
+        A copy of the input array, flattened to one dimension.
+
+    See Also
+    --------
+    ravel : Return a flattened array.
+    flat : A 1-D flat iterator over the array.
+
+    Examples
+    --------
+    >>> a = np.array([[1,2], [3,4]])
+    >>> a.flatten()
+    array([1, 2, 3, 4])
+    >>> a.flatten('F')
+    array([1, 3, 2, 4])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('getfield',
+    """
+    a.getfield(dtype, offset=0)
+
+    Returns a field of the given array as a certain type.
+
+    A field is a view of the array data with a given data-type. The values in
+    the view are determined by the given type and the offset into the current
+    array in bytes. The offset needs to be such that the view dtype fits in the
+    array dtype; for example an array of dtype complex128 has 16-byte elements.
+    If taking a view with a 32-bit integer (4 bytes), the offset needs to be
+    between 0 and 12 bytes.
+
+    Parameters
+    ----------
+    dtype : str or dtype
+        The data type of the view. The dtype size of the view can not be larger
+        than that of the array itself.
+    offset : int
+        Number of bytes to skip before beginning the element view.
+
+    Examples
+    --------
+    >>> x = np.diag([1.+1.j]*2)
+    >>> x[1, 1] = 2 + 4.j
+    >>> x
+    array([[1.+1.j,  0.+0.j],
+           [0.+0.j,  2.+4.j]])
+    >>> x.getfield(np.float64)
+    array([[1.,  0.],
+           [0.,  2.]])
+
+    By choosing an offset of 8 bytes we can select the complex part of the
+    array for our view:
+
+    >>> x.getfield(np.float64, offset=8)
+    array([[1.,  0.],
+           [0.,  4.]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('item',
+    """
+    a.item(*args)
+
+    Copy an element of an array to a standard Python scalar and return it.
+
+    Parameters
+    ----------
+    \\*args : Arguments (variable number and type)
+
+        * none: in this case, the method only works for arrays
+          with one element (`a.size == 1`), which element is
+          copied into a standard Python scalar object and returned.
+
+        * int_type: this argument is interpreted as a flat index into
+          the array, specifying which element to copy and return.
+
+        * tuple of int_types: functions as does a single int_type argument,
+          except that the argument is interpreted as an nd-index into the
+          array.
+
+    Returns
+    -------
+    z : Standard Python scalar object
+        A copy of the specified element of the array as a suitable
+        Python scalar
+
+    Notes
+    -----
+    When the data type of `a` is longdouble or clongdouble, item() returns
+    a scalar array object because there is no available Python scalar that
+    would not lose information. Void arrays return a buffer object for item(),
+    unless fields are defined, in which case a tuple is returned.
+
+    `item` is very similar to a[args], except, instead of an array scalar,
+    a standard Python scalar is returned. This can be useful for speeding up
+    access to elements of the array and doing arithmetic on elements of the
+    array using Python's optimized math.
+
+    Examples
+    --------
+    >>> np.random.seed(123)
+    >>> x = np.random.randint(9, size=(3, 3))
+    >>> x
+    array([[2, 2, 6],
+           [1, 3, 6],
+           [1, 0, 1]])
+    >>> x.item(3)
+    1
+    >>> x.item(7)
+    0
+    >>> x.item((0, 1))
+    2
+    >>> x.item((2, 2))
+    1
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('itemset',
+    """
+    a.itemset(*args)
+
+    Insert scalar into an array (scalar is cast to array's dtype, if possible)
+
+    There must be at least 1 argument, and define the last argument
+    as *item*.  Then, ``a.itemset(*args)`` is equivalent to but faster
+    than ``a[args] = item``.  The item should be a scalar value and `args`
+    must select a single item in the array `a`.
+
+    Parameters
+    ----------
+    \\*args : Arguments
+        If one argument: a scalar, only used in case `a` is of size 1.
+        If two arguments: the last argument is the value to be set
+        and must be a scalar, the first argument specifies a single array
+        element location. It is either an int or a tuple.
+
+    Notes
+    -----
+    Compared to indexing syntax, `itemset` provides some speed increase
+    for placing a scalar into a particular location in an `ndarray`,
+    if you must do this.  However, generally this is discouraged:
+    among other problems, it complicates the appearance of the code.
+    Also, when using `itemset` (and `item`) inside a loop, be sure
+    to assign the methods to a local variable to avoid the attribute
+    look-up at each loop iteration.
+
+    Examples
+    --------
+    >>> np.random.seed(123)
+    >>> x = np.random.randint(9, size=(3, 3))
+    >>> x
+    array([[2, 2, 6],
+           [1, 3, 6],
+           [1, 0, 1]])
+    >>> x.itemset(4, 0)
+    >>> x.itemset((2, 2), 9)
+    >>> x
+    array([[2, 2, 6],
+           [1, 0, 6],
+           [1, 0, 9]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('max',
+    """
+    a.max(axis=None, out=None, keepdims=False, initial=<no value>, where=True)
+
+    Return the maximum along a given axis.
+
+    Refer to `numpy.amax` for full documentation.
+
+    See Also
+    --------
+    numpy.amax : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('mean',
+    """
+    a.mean(axis=None, dtype=None, out=None, keepdims=False)
+
+    Returns the average of the array elements along given axis.
+
+    Refer to `numpy.mean` for full documentation.
+
+    See Also
+    --------
+    numpy.mean : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('min',
+    """
+    a.min(axis=None, out=None, keepdims=False, initial=<no value>, where=True)
+
+    Return the minimum along a given axis.
+
+    Refer to `numpy.amin` for full documentation.
+
+    See Also
+    --------
+    numpy.amin : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('newbyteorder',
+    """
+    arr.newbyteorder(new_order='S')
+
+    Return the array with the same data viewed with a different byte order.
+
+    Equivalent to::
+
+        arr.view(arr.dtype.newbytorder(new_order))
+
+    Changes are also made in all fields and sub-arrays of the array data
+    type.
+
+
+
+    Parameters
+    ----------
+    new_order : string, optional
+        Byte order to force; a value from the byte order specifications
+        below. `new_order` codes can be any of:
+
+        * 'S' - swap dtype from current to opposite endian
+        * {'<', 'L'} - little endian
+        * {'>', 'B'} - big endian
+        * {'=', 'N'} - native order
+        * {'|', 'I'} - ignore (no change to byte order)
+
+        The default value ('S') results in swapping the current
+        byte order. The code does a case-insensitive check on the first
+        letter of `new_order` for the alternatives above.  For example,
+        any of 'B' or 'b' or 'biggish' are valid to specify big-endian.
+
+
+    Returns
+    -------
+    new_arr : array
+        New array object with the dtype reflecting given change to the
+        byte order.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('nonzero',
+    """
+    a.nonzero()
+
+    Return the indices of the elements that are non-zero.
+
+    Refer to `numpy.nonzero` for full documentation.
+
+    See Also
+    --------
+    numpy.nonzero : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('prod',
+    """
+    a.prod(axis=None, dtype=None, out=None, keepdims=False, initial=1, where=True)
+
+    Return the product of the array elements over the given axis
+
+    Refer to `numpy.prod` for full documentation.
+
+    See Also
+    --------
+    numpy.prod : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('ptp',
+    """
+    a.ptp(axis=None, out=None, keepdims=False)
+
+    Peak to peak (maximum - minimum) value along a given axis.
+
+    Refer to `numpy.ptp` for full documentation.
+
+    See Also
+    --------
+    numpy.ptp : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('put',
+    """
+    a.put(indices, values, mode='raise')
+
+    Set ``a.flat[n] = values[n]`` for all `n` in indices.
+
+    Refer to `numpy.put` for full documentation.
+
+    See Also
+    --------
+    numpy.put : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('ravel',
+    """
+    a.ravel([order])
+
+    Return a flattened array.
+
+    Refer to `numpy.ravel` for full documentation.
+
+    See Also
+    --------
+    numpy.ravel : equivalent function
+
+    ndarray.flat : a flat iterator on the array.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('repeat',
+    """
+    a.repeat(repeats, axis=None)
+
+    Repeat elements of an array.
+
+    Refer to `numpy.repeat` for full documentation.
+
+    See Also
+    --------
+    numpy.repeat : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('reshape',
+    """
+    a.reshape(shape, order='C')
+
+    Returns an array containing the same data with a new shape.
+
+    Refer to `numpy.reshape` for full documentation.
+
+    See Also
+    --------
+    numpy.reshape : equivalent function
+
+    Notes
+    -----
+    Unlike the free function `numpy.reshape`, this method on `ndarray` allows
+    the elements of the shape parameter to be passed in as separate arguments.
+    For example, ``a.reshape(10, 11)`` is equivalent to
+    ``a.reshape((10, 11))``.
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('resize',
+    """
+    a.resize(new_shape, refcheck=True)
+
+    Change shape and size of array in-place.
+
+    Parameters
+    ----------
+    new_shape : tuple of ints, or `n` ints
+        Shape of resized array.
+    refcheck : bool, optional
+        If False, reference count will not be checked. Default is True.
+
+    Returns
+    -------
+    None
+
+    Raises
+    ------
+    ValueError
+        If `a` does not own its own data or references or views to it exist,
+        and the data memory must be changed.
+        PyPy only: will always raise if the data memory must be changed, since
+        there is no reliable way to determine if references or views to it
+        exist.
+
+    SystemError
+        If the `order` keyword argument is specified. This behaviour is a
+        bug in NumPy.
+
+    See Also
+    --------
+    resize : Return a new array with the specified shape.
+
+    Notes
+    -----
+    This reallocates space for the data area if necessary.
+
+    Only contiguous arrays (data elements consecutive in memory) can be
+    resized.
+
+    The purpose of the reference count check is to make sure you
+    do not use this array as a buffer for another Python object and then
+    reallocate the memory. However, reference counts can increase in
+    other ways so if you are sure that you have not shared the memory
+    for this array with another Python object, then you may safely set
+    `refcheck` to False.
+
+    Examples
+    --------
+    Shrinking an array: array is flattened (in the order that the data are
+    stored in memory), resized, and reshaped:
+
+    >>> a = np.array([[0, 1], [2, 3]], order='C')
+    >>> a.resize((2, 1))
+    >>> a
+    array([[0],
+           [1]])
+
+    >>> a = np.array([[0, 1], [2, 3]], order='F')
+    >>> a.resize((2, 1))
+    >>> a
+    array([[0],
+           [2]])
+
+    Enlarging an array: as above, but missing entries are filled with zeros:
+
+    >>> b = np.array([[0, 1], [2, 3]])
+    >>> b.resize(2, 3) # new_shape parameter doesn't have to be a tuple
+    >>> b
+    array([[0, 1, 2],
+           [3, 0, 0]])
+
+    Referencing an array prevents resizing...
+
+    >>> c = a
+    >>> a.resize((1, 1))
+    Traceback (most recent call last):
+    ...
+    ValueError: cannot resize an array that references or is referenced ...
+
+    Unless `refcheck` is False:
+
+    >>> a.resize((1, 1), refcheck=False)
+    >>> a
+    array([[0]])
+    >>> c
+    array([[0]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('round',
+    """
+    a.round(decimals=0, out=None)
+
+    Return `a` with each element rounded to the given number of decimals.
+
+    Refer to `numpy.around` for full documentation.
+
+    See Also
+    --------
+    numpy.around : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('searchsorted',
+    """
+    a.searchsorted(v, side='left', sorter=None)
+
+    Find indices where elements of v should be inserted in a to maintain order.
+
+    For full documentation, see `numpy.searchsorted`
+
+    See Also
+    --------
+    numpy.searchsorted : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('setfield',
+    """
+    a.setfield(val, dtype, offset=0)
+
+    Put a value into a specified place in a field defined by a data-type.
+
+    Place `val` into `a`'s field defined by `dtype` and beginning `offset`
+    bytes into the field.
+
+    Parameters
+    ----------
+    val : object
+        Value to be placed in field.
+    dtype : dtype object
+        Data-type of the field in which to place `val`.
+    offset : int, optional
+        The number of bytes into the field at which to place `val`.
+
+    Returns
+    -------
+    None
+
+    See Also
+    --------
+    getfield
+
+    Examples
+    --------
+    >>> x = np.eye(3)
+    >>> x.getfield(np.float64)
+    array([[1.,  0.,  0.],
+           [0.,  1.,  0.],
+           [0.,  0.,  1.]])
+    >>> x.setfield(3, np.int32)
+    >>> x.getfield(np.int32)
+    array([[3, 3, 3],
+           [3, 3, 3],
+           [3, 3, 3]], dtype=int32)
+    >>> x
+    array([[1.0e+000, 1.5e-323, 1.5e-323],
+           [1.5e-323, 1.0e+000, 1.5e-323],
+           [1.5e-323, 1.5e-323, 1.0e+000]])
+    >>> x.setfield(np.eye(3), np.int32)
+    >>> x
+    array([[1.,  0.,  0.],
+           [0.,  1.,  0.],
+           [0.,  0.,  1.]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('setflags',
+    """
+    a.setflags(write=None, align=None, uic=None)
+
+    Set array flags WRITEABLE, ALIGNED, (WRITEBACKIFCOPY and UPDATEIFCOPY),
+    respectively.
+
+    These Boolean-valued flags affect how numpy interprets the memory
+    area used by `a` (see Notes below). The ALIGNED flag can only
+    be set to True if the data is actually aligned according to the type.
+    The WRITEBACKIFCOPY and (deprecated) UPDATEIFCOPY flags can never be set
+    to True. The flag WRITEABLE can only be set to True if the array owns its
+    own memory, or the ultimate owner of the memory exposes a writeable buffer
+    interface, or is a string. (The exception for string is made so that
+    unpickling can be done without copying memory.)
+
+    Parameters
+    ----------
+    write : bool, optional
+        Describes whether or not `a` can be written to.
+    align : bool, optional
+        Describes whether or not `a` is aligned properly for its type.
+    uic : bool, optional
+        Describes whether or not `a` is a copy of another "base" array.
+
+    Notes
+    -----
+    Array flags provide information about how the memory area used
+    for the array is to be interpreted. There are 7 Boolean flags
+    in use, only four of which can be changed by the user:
+    WRITEBACKIFCOPY, UPDATEIFCOPY, WRITEABLE, and ALIGNED.
+
+    WRITEABLE (W) the data area can be written to;
+
+    ALIGNED (A) the data and strides are aligned appropriately for the hardware
+    (as determined by the compiler);
+
+    UPDATEIFCOPY (U) (deprecated), replaced by WRITEBACKIFCOPY;
+
+    WRITEBACKIFCOPY (X) this array is a copy of some other array (referenced
+    by .base). When the C-API function PyArray_ResolveWritebackIfCopy is
+    called, the base array will be updated with the contents of this array.
+
+    All flags can be accessed using the single (upper case) letter as well
+    as the full name.
+
+    Examples
+    --------
+    >>> y = np.array([[3, 1, 7],
+    ...               [2, 0, 0],
+    ...               [8, 5, 9]])
+    >>> y
+    array([[3, 1, 7],
+           [2, 0, 0],
+           [8, 5, 9]])
+    >>> y.flags
+      C_CONTIGUOUS : True
+      F_CONTIGUOUS : False
+      OWNDATA : True
+      WRITEABLE : True
+      ALIGNED : True
+      WRITEBACKIFCOPY : False
+      UPDATEIFCOPY : False
+    >>> y.setflags(write=0, align=0)
+    >>> y.flags
+      C_CONTIGUOUS : True
+      F_CONTIGUOUS : False
+      OWNDATA : True
+      WRITEABLE : False
+      ALIGNED : False
+      WRITEBACKIFCOPY : False
+      UPDATEIFCOPY : False
+    >>> y.setflags(uic=1)
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+    ValueError: cannot set WRITEBACKIFCOPY flag to True
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('sort',
+    """
+    a.sort(axis=-1, kind=None, order=None)
+
+    Sort an array in-place. Refer to `numpy.sort` for full documentation.
+
+    Parameters
+    ----------
+    axis : int, optional
+        Axis along which to sort. Default is -1, which means sort along the
+        last axis.
+    kind : {'quicksort', 'mergesort', 'heapsort', 'stable'}, optional
+        Sorting algorithm. The default is 'quicksort'. Note that both 'stable'
+        and 'mergesort' use timsort under the covers and, in general, the
+        actual implementation will vary with datatype. The 'mergesort' option
+        is retained for backwards compatibility.
+
+        .. versionchanged:: 1.15.0.
+           The 'stable' option was added.
+
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument specifies
+        which fields to compare first, second, etc.  A single field can
+        be specified as a string, and not all fields need be specified,
+        but unspecified fields will still be used, in the order in which
+        they come up in the dtype, to break ties.
+
+    See Also
+    --------
+    numpy.sort : Return a sorted copy of an array.
+    numpy.argsort : Indirect sort.
+    numpy.lexsort : Indirect stable sort on multiple keys.
+    numpy.searchsorted : Find elements in sorted array.
+    numpy.partition: Partial sort.
+
+    Notes
+    -----
+    See `numpy.sort` for notes on the different sorting algorithms.
+
+    Examples
+    --------
+    >>> a = np.array([[1,4], [3,1]])
+    >>> a.sort(axis=1)
+    >>> a
+    array([[1, 4],
+           [1, 3]])
+    >>> a.sort(axis=0)
+    >>> a
+    array([[1, 3],
+           [1, 4]])
+
+    Use the `order` keyword to specify a field to use when sorting a
+    structured array:
+
+    >>> a = np.array([('a', 2), ('c', 1)], dtype=[('x', 'S1'), ('y', int)])
+    >>> a.sort(order='y')
+    >>> a
+    array([(b'c', 1), (b'a', 2)],
+          dtype=[('x', 'S1'), ('y', '<i8')])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('partition',
+    """
+    a.partition(kth, axis=-1, kind='introselect', order=None)
+
+    Rearranges the elements in the array in such a way that the value of the
+    element in kth position is in the position it would be in a sorted array.
+    All elements smaller than the kth element are moved before this element and
+    all equal or greater are moved behind it. The ordering of the elements in
+    the two partitions is undefined.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    kth : int or sequence of ints
+        Element index to partition by. The kth element value will be in its
+        final sorted position and all smaller elements will be moved before it
+        and all equal or greater elements behind it.
+        The order of all elements in the partitions is undefined.
+        If provided with a sequence of kth it will partition all elements
+        indexed by kth of them into their sorted position at once.
+    axis : int, optional
+        Axis along which to sort. Default is -1, which means sort along the
+        last axis.
+    kind : {'introselect'}, optional
+        Selection algorithm. Default is 'introselect'.
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument specifies
+        which fields to compare first, second, etc. A single field can
+        be specified as a string, and not all fields need to be specified,
+        but unspecified fields will still be used, in the order in which
+        they come up in the dtype, to break ties.
+
+    See Also
+    --------
+    numpy.partition : Return a parititioned copy of an array.
+    argpartition : Indirect partition.
+    sort : Full sort.
+
+    Notes
+    -----
+    See ``np.partition`` for notes on the different algorithms.
+
+    Examples
+    --------
+    >>> a = np.array([3, 4, 2, 1])
+    >>> a.partition(3)
+    >>> a
+    array([2, 1, 3, 4])
+
+    >>> a.partition((1, 3))
+    >>> a
+    array([1, 2, 3, 4])
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('squeeze',
+    """
+    a.squeeze(axis=None)
+
+    Remove single-dimensional entries from the shape of `a`.
+
+    Refer to `numpy.squeeze` for full documentation.
+
+    See Also
+    --------
+    numpy.squeeze : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('std',
+    """
+    a.std(axis=None, dtype=None, out=None, ddof=0, keepdims=False)
+
+    Returns the standard deviation of the array elements along given axis.
+
+    Refer to `numpy.std` for full documentation.
+
+    See Also
+    --------
+    numpy.std : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('sum',
+    """
+    a.sum(axis=None, dtype=None, out=None, keepdims=False, initial=0, where=True)
+
+    Return the sum of the array elements over the given axis.
+
+    Refer to `numpy.sum` for full documentation.
+
+    See Also
+    --------
+    numpy.sum : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('swapaxes',
+    """
+    a.swapaxes(axis1, axis2)
+
+    Return a view of the array with `axis1` and `axis2` interchanged.
+
+    Refer to `numpy.swapaxes` for full documentation.
+
+    See Also
+    --------
+    numpy.swapaxes : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('take',
+    """
+    a.take(indices, axis=None, out=None, mode='raise')
+
+    Return an array formed from the elements of `a` at the given indices.
+
+    Refer to `numpy.take` for full documentation.
+
+    See Also
+    --------
+    numpy.take : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('tofile',
+    """
+    a.tofile(fid, sep="", format="%s")
+
+    Write array to a file as text or binary (default).
+
+    Data is always written in 'C' order, independent of the order of `a`.
+    The data produced by this method can be recovered using the function
+    fromfile().
+
+    Parameters
+    ----------
+    fid : file or str or Path
+        An open file object, or a string containing a filename.
+
+        .. versionchanged:: 1.17.0
+            `pathlib.Path` objects are now accepted.
+
+    sep : str
+        Separator between array items for text output.
+        If "" (empty), a binary file is written, equivalent to
+        ``file.write(a.tobytes())``.
+    format : str
+        Format string for text file output.
+        Each entry in the array is formatted to text by first converting
+        it to the closest Python type, and then using "format" % item.
+
+    Notes
+    -----
+    This is a convenience function for quick storage of array data.
+    Information on endianness and precision is lost, so this method is not a
+    good choice for files intended to archive data or transport data between
+    machines with different endianness. Some of these problems can be overcome
+    by outputting the data as text files, at the expense of speed and file
+    size.
+
+    When fid is a file object, array contents are directly written to the
+    file, bypassing the file object's ``write`` method. As a result, tofile
+    cannot be used with files objects supporting compression (e.g., GzipFile)
+    or file-like objects that do not support ``fileno()`` (e.g., BytesIO).
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('tolist',
+    """
+    a.tolist()
+
+    Return the array as an ``a.ndim``-levels deep nested list of Python scalars.
+
+    Return a copy of the array data as a (nested) Python list.
+    Data items are converted to the nearest compatible builtin Python type, via
+    the `~numpy.ndarray.item` function.
+
+    If ``a.ndim`` is 0, then since the depth of the nested list is 0, it will
+    not be a list at all, but a simple Python scalar.
+
+    Parameters
+    ----------
+    none
+
+    Returns
+    -------
+    y : object, or list of object, or list of list of object, or ...
+        The possibly nested list of array elements.
+
+    Notes
+    -----
+    The array may be recreated via ``a = np.array(a.tolist())``, although this
+    may sometimes lose precision.
+
+    Examples
+    --------
+    For a 1D array, ``a.tolist()`` is almost the same as ``list(a)``,
+    except that ``tolist`` changes numpy scalars to Python scalars:
+
+    >>> a = np.uint32([1, 2])
+    >>> a_list = list(a)
+    >>> a_list
+    [1, 2]
+    >>> type(a_list[0])
+    <class 'numpy.uint32'>
+    >>> a_tolist = a.tolist()
+    >>> a_tolist
+    [1, 2]
+    >>> type(a_tolist[0])
+    <class 'int'>
+
+    Additionally, for a 2D array, ``tolist`` applies recursively:
+
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> list(a)
+    [array([1, 2]), array([3, 4])]
+    >>> a.tolist()
+    [[1, 2], [3, 4]]
+
+    The base case for this recursion is a 0D array:
+
+    >>> a = np.array(1)
+    >>> list(a)
+    Traceback (most recent call last):
+      ...
+    TypeError: iteration over a 0-d array
+    >>> a.tolist()
+    1
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('tobytes', """
+    a.tobytes(order='C')
+
+    Construct Python bytes containing the raw data bytes in the array.
+
+    Constructs Python bytes showing a copy of the raw contents of
+    data memory. The bytes object can be produced in either 'C' or 'Fortran',
+    or 'Any' order (the default is 'C'-order). 'Any' order means C-order
+    unless the F_CONTIGUOUS flag in the array is set, in which case it
+    means 'Fortran' order.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    order : {'C', 'F', None}, optional
+        Order of the data for multidimensional arrays:
+        C, Fortran, or the same as for the original array.
+
+    Returns
+    -------
+    s : bytes
+        Python bytes exhibiting a copy of `a`'s raw data.
+
+    Examples
+    --------
+    >>> x = np.array([[0, 1], [2, 3]], dtype='<u2')
+    >>> x.tobytes()
+    b'\\x00\\x00\\x01\\x00\\x02\\x00\\x03\\x00'
+    >>> x.tobytes('C') == x.tobytes()
+    True
+    >>> x.tobytes('F')
+    b'\\x00\\x00\\x02\\x00\\x01\\x00\\x03\\x00'
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('tostring', r"""
+    a.tostring(order='C')
+
+    A compatibility alias for `tobytes`, with exactly the same behavior.
+
+    Despite its name, it returns `bytes` not `str`\ s.
+
+    .. deprecated:: 1.19.0
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('trace',
+    """
+    a.trace(offset=0, axis1=0, axis2=1, dtype=None, out=None)
+
+    Return the sum along diagonals of the array.
+
+    Refer to `numpy.trace` for full documentation.
+
+    See Also
+    --------
+    numpy.trace : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('transpose',
+    """
+    a.transpose(*axes)
+
+    Returns a view of the array with axes transposed.
+
+    For a 1-D array this has no effect, as a transposed vector is simply the
+    same vector. To convert a 1-D array into a 2D column vector, an additional
+    dimension must be added. `np.atleast2d(a).T` achieves this, as does
+    `a[:, np.newaxis]`.
+    For a 2-D array, this is a standard matrix transpose.
+    For an n-D array, if axes are given, their order indicates how the
+    axes are permuted (see Examples). If axes are not provided and
+    ``a.shape = (i[0], i[1], ... i[n-2], i[n-1])``, then
+    ``a.transpose().shape = (i[n-1], i[n-2], ... i[1], i[0])``.
+
+    Parameters
+    ----------
+    axes : None, tuple of ints, or `n` ints
+
+     * None or no argument: reverses the order of the axes.
+
+     * tuple of ints: `i` in the `j`-th place in the tuple means `a`'s
+       `i`-th axis becomes `a.transpose()`'s `j`-th axis.
+
+     * `n` ints: same as an n-tuple of the same ints (this form is
+       intended simply as a "convenience" alternative to the tuple form)
+
+    Returns
+    -------
+    out : ndarray
+        View of `a`, with axes suitably permuted.
+
+    See Also
+    --------
+    ndarray.T : Array property returning the array transposed.
+    ndarray.reshape : Give a new shape to an array without changing its data.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> a
+    array([[1, 2],
+           [3, 4]])
+    >>> a.transpose()
+    array([[1, 3],
+           [2, 4]])
+    >>> a.transpose((1, 0))
+    array([[1, 3],
+           [2, 4]])
+    >>> a.transpose(1, 0)
+    array([[1, 3],
+           [2, 4]])
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('var',
+    """
+    a.var(axis=None, dtype=None, out=None, ddof=0, keepdims=False)
+
+    Returns the variance of the array elements, along given axis.
+
+    Refer to `numpy.var` for full documentation.
+
+    See Also
+    --------
+    numpy.var : equivalent function
+
+    """))
+
+
+add_newdoc('numpy.core.multiarray', 'ndarray', ('view',
+    """
+    a.view([dtype][, type])
+
+    New view of array with the same data.
+
+    .. note::
+        Passing None for ``dtype`` is different from omitting the parameter,
+        since the former invokes ``dtype(None)`` which is an alias for
+        ``dtype('float_')``.
+
+    Parameters
+    ----------
+    dtype : data-type or ndarray sub-class, optional
+        Data-type descriptor of the returned view, e.g., float32 or int16.
+        Omitting it results in the view having the same data-type as `a`.
+        This argument can also be specified as an ndarray sub-class, which
+        then specifies the type of the returned object (this is equivalent to
+        setting the ``type`` parameter).
+    type : Python type, optional
+        Type of the returned view, e.g., ndarray or matrix.  Again, omission
+        of the parameter results in type preservation.
+
+    Notes
+    -----
+    ``a.view()`` is used two different ways:
+
+    ``a.view(some_dtype)`` or ``a.view(dtype=some_dtype)`` constructs a view
+    of the array's memory with a different data-type.  This can cause a
+    reinterpretation of the bytes of memory.
+
+    ``a.view(ndarray_subclass)`` or ``a.view(type=ndarray_subclass)`` just
+    returns an instance of `ndarray_subclass` that looks at the same array
+    (same shape, dtype, etc.)  This does not cause a reinterpretation of the
+    memory.
+
+    For ``a.view(some_dtype)``, if ``some_dtype`` has a different number of
+    bytes per entry than the previous dtype (for example, converting a
+    regular array to a structured array), then the behavior of the view
+    cannot be predicted just from the superficial appearance of ``a`` (shown
+    by ``print(a)``). It also depends on exactly how ``a`` is stored in
+    memory. Therefore if ``a`` is C-ordered versus fortran-ordered, versus
+    defined as a slice or transpose, etc., the view may give different
+    results.
+
+
+    Examples
+    --------
+    >>> x = np.array([(1, 2)], dtype=[('a', np.int8), ('b', np.int8)])
+
+    Viewing array data using a different type and dtype:
+
+    >>> y = x.view(dtype=np.int16, type=np.matrix)
+    >>> y
+    matrix([[513]], dtype=int16)
+    >>> print(type(y))
+    <class 'numpy.matrix'>
+
+    Creating a view on a structured array so it can be used in calculations
+
+    >>> x = np.array([(1, 2),(3,4)], dtype=[('a', np.int8), ('b', np.int8)])
+    >>> xv = x.view(dtype=np.int8).reshape(-1,2)
+    >>> xv
+    array([[1, 2],
+           [3, 4]], dtype=int8)
+    >>> xv.mean(0)
+    array([2.,  3.])
+
+    Making changes to the view changes the underlying array
+
+    >>> xv[0,1] = 20
+    >>> x
+    array([(1, 20), (3,  4)], dtype=[('a', 'i1'), ('b', 'i1')])
+
+    Using a view to convert an array to a recarray:
+
+    >>> z = x.view(np.recarray)
+    >>> z.a
+    array([1, 3], dtype=int8)
+
+    Views share data:
+
+    >>> x[0] = (9, 10)
+    >>> z[0]
+    (9, 10)
+
+    Views that change the dtype size (bytes per entry) should normally be
+    avoided on arrays defined by slices, transposes, fortran-ordering, etc.:
+
+    >>> x = np.array([[1,2,3],[4,5,6]], dtype=np.int16)
+    >>> y = x[:, 0:2]
+    >>> y
+    array([[1, 2],
+           [4, 5]], dtype=int16)
+    >>> y.view(dtype=[('width', np.int16), ('length', np.int16)])
+    Traceback (most recent call last):
+        ...
+    ValueError: To change to a dtype of a different size, the array must be C-contiguous
+    >>> z = y.copy()
+    >>> z.view(dtype=[('width', np.int16), ('length', np.int16)])
+    array([[(1, 2)],
+           [(4, 5)]], dtype=[('width', '<i2'), ('length', '<i2')])
+    """))
+
+
+##############################################################################
+#
+# umath functions
+#
+##############################################################################
+
+add_newdoc('numpy.core.umath', 'frompyfunc',
+    """
+    frompyfunc(func, nin, nout, *[, identity])
+
+    Takes an arbitrary Python function and returns a NumPy ufunc.
+
+    Can be used, for example, to add broadcasting to a built-in Python
+    function (see Examples section).
+
+    Parameters
+    ----------
+    func : Python function object
+        An arbitrary Python function.
+    nin : int
+        The number of input arguments.
+    nout : int
+        The number of objects returned by `func`.
+    identity : object, optional
+        The value to use for the `~numpy.ufunc.identity` attribute of the resulting
+        object. If specified, this is equivalent to setting the underlying
+        C ``identity`` field to ``PyUFunc_IdentityValue``.
+        If omitted, the identity is set to ``PyUFunc_None``. Note that this is
+        _not_ equivalent to setting the identity to ``None``, which implies the
+        operation is reorderable.
+
+    Returns
+    -------
+    out : ufunc
+        Returns a NumPy universal function (``ufunc``) object.
+
+    See Also
+    --------
+    vectorize : Evaluates pyfunc over input arrays using broadcasting rules of numpy.
+
+    Notes
+    -----
+    The returned ufunc always returns PyObject arrays.
+
+    Examples
+    --------
+    Use frompyfunc to add broadcasting to the Python function ``oct``:
+
+    >>> oct_array = np.frompyfunc(oct, 1, 1)
+    >>> oct_array(np.array((10, 30, 100)))
+    array(['0o12', '0o36', '0o144'], dtype=object)
+    >>> np.array((oct(10), oct(30), oct(100))) # for comparison
+    array(['0o12', '0o36', '0o144'], dtype='<U5')
+
+    """)
+
+add_newdoc('numpy.core.umath', 'geterrobj',
+    """
+    geterrobj()
+
+    Return the current object that defines floating-point error handling.
+
+    The error object contains all information that defines the error handling
+    behavior in NumPy. `geterrobj` is used internally by the other
+    functions that get and set error handling behavior (`geterr`, `seterr`,
+    `geterrcall`, `seterrcall`).
+
+    Returns
+    -------
+    errobj : list
+        The error object, a list containing three elements:
+        [internal numpy buffer size, error mask, error callback function].
+
+        The error mask is a single integer that holds the treatment information
+        on all four floating point errors. The information for each error type
+        is contained in three bits of the integer. If we print it in base 8, we
+        can see what treatment is set for "invalid", "under", "over", and
+        "divide" (in that order). The printed string can be interpreted with
+
+        * 0 : 'ignore'
+        * 1 : 'warn'
+        * 2 : 'raise'
+        * 3 : 'call'
+        * 4 : 'print'
+        * 5 : 'log'
+
+    See Also
+    --------
+    seterrobj, seterr, geterr, seterrcall, geterrcall
+    getbufsize, setbufsize
+
+    Notes
+    -----
+    For complete documentation of the types of floating-point exceptions and
+    treatment options, see `seterr`.
+
+    Examples
+    --------
+    >>> np.geterrobj()  # first get the defaults
+    [8192, 521, None]
+
+    >>> def err_handler(type, flag):
+    ...     print("Floating point error (%s), with flag %s" % (type, flag))
+    ...
+    >>> old_bufsize = np.setbufsize(20000)
+    >>> old_err = np.seterr(divide='raise')
+    >>> old_handler = np.seterrcall(err_handler)
+    >>> np.geterrobj()
+    [8192, 521, <function err_handler at 0x91dcaac>]
+
+    >>> old_err = np.seterr(all='ignore')
+    >>> np.base_repr(np.geterrobj()[1], 8)
+    '0'
+    >>> old_err = np.seterr(divide='warn', over='log', under='call',
+    ...                     invalid='print')
+    >>> np.base_repr(np.geterrobj()[1], 8)
+    '4351'
+
+    """)
+
+add_newdoc('numpy.core.umath', 'seterrobj',
+    """
+    seterrobj(errobj)
+
+    Set the object that defines floating-point error handling.
+
+    The error object contains all information that defines the error handling
+    behavior in NumPy. `seterrobj` is used internally by the other
+    functions that set error handling behavior (`seterr`, `seterrcall`).
+
+    Parameters
+    ----------
+    errobj : list
+        The error object, a list containing three elements:
+        [internal numpy buffer size, error mask, error callback function].
+
+        The error mask is a single integer that holds the treatment information
+        on all four floating point errors. The information for each error type
+        is contained in three bits of the integer. If we print it in base 8, we
+        can see what treatment is set for "invalid", "under", "over", and
+        "divide" (in that order). The printed string can be interpreted with
+
+        * 0 : 'ignore'
+        * 1 : 'warn'
+        * 2 : 'raise'
+        * 3 : 'call'
+        * 4 : 'print'
+        * 5 : 'log'
+
+    See Also
+    --------
+    geterrobj, seterr, geterr, seterrcall, geterrcall
+    getbufsize, setbufsize
+
+    Notes
+    -----
+    For complete documentation of the types of floating-point exceptions and
+    treatment options, see `seterr`.
+
+    Examples
+    --------
+    >>> old_errobj = np.geterrobj()  # first get the defaults
+    >>> old_errobj
+    [8192, 521, None]
+
+    >>> def err_handler(type, flag):
+    ...     print("Floating point error (%s), with flag %s" % (type, flag))
+    ...
+    >>> new_errobj = [20000, 12, err_handler]
+    >>> np.seterrobj(new_errobj)
+    >>> np.base_repr(12, 8)  # int for divide=4 ('print') and over=1 ('warn')
+    '14'
+    >>> np.geterr()
+    {'over': 'warn', 'divide': 'print', 'invalid': 'ignore', 'under': 'ignore'}
+    >>> np.geterrcall() is err_handler
+    True
+
+    """)
+
+
+##############################################################################
+#
+# compiled_base functions
+#
+##############################################################################
+
+add_newdoc('numpy.core.multiarray', 'add_docstring',
+    """
+    add_docstring(obj, docstring)
+
+    Add a docstring to a built-in obj if possible.
+    If the obj already has a docstring raise a RuntimeError
+    If this routine does not know how to add a docstring to the object
+    raise a TypeError
+    """)
+
+add_newdoc('numpy.core.umath', '_add_newdoc_ufunc',
+    """
+    add_ufunc_docstring(ufunc, new_docstring)
+
+    Replace the docstring for a ufunc with new_docstring.
+    This method will only work if the current docstring for
+    the ufunc is NULL. (At the C level, i.e. when ufunc->doc is NULL.)
+
+    Parameters
+    ----------
+    ufunc : numpy.ufunc
+        A ufunc whose current doc is NULL.
+    new_docstring : string
+        The new docstring for the ufunc.
+
+    Notes
+    -----
+    This method allocates memory for new_docstring on
+    the heap. Technically this creates a mempory leak, since this
+    memory will not be reclaimed until the end of the program
+    even if the ufunc itself is removed. However this will only
+    be a problem if the user is repeatedly creating ufuncs with
+    no documentation, adding documentation via add_newdoc_ufunc,
+    and then throwing away the ufunc.
+    """)
+
+add_newdoc('numpy.core.multiarray', '_set_madvise_hugepage',
+    """
+    _set_madvise_hugepage(enabled: bool) -> bool
+
+    Set  or unset use of ``madvise (2)`` MADV_HUGEPAGE support when
+    allocating the array data. Returns the previously set value.
+    See `global_state` for more information.
+    """)
+
+add_newdoc('numpy.core._multiarray_tests', 'format_float_OSprintf_g',
+    """
+    format_float_OSprintf_g(val, precision)
+
+    Print a floating point scalar using the system's printf function,
+    equivalent to:
+
+        printf("%.*g", precision, val);
+
+    for half/float/double, or replacing 'g' by 'Lg' for longdouble. This
+    method is designed to help cross-validate the format_float_* methods.
+
+    Parameters
+    ----------
+    val : python float or numpy floating scalar
+        Value to format.
+
+    precision : non-negative integer, optional
+        Precision given to printf.
+
+    Returns
+    -------
+    rep : string
+        The string representation of the floating point value
+
+    See Also
+    --------
+    format_float_scientific
+    format_float_positional
+    """)
+
+
+##############################################################################
+#
+# Documentation for ufunc attributes and methods
+#
+##############################################################################
+
+
+##############################################################################
+#
+# ufunc object
+#
+##############################################################################
+
+add_newdoc('numpy.core', 'ufunc',
+    """
+    Functions that operate element by element on whole arrays.
+
+    To see the documentation for a specific ufunc, use `info`.  For
+    example, ``np.info(np.sin)``.  Because ufuncs are written in C
+    (for speed) and linked into Python with NumPy's ufunc facility,
+    Python's help() function finds this page whenever help() is called
+    on a ufunc.
+
+    A detailed explanation of ufuncs can be found in the docs for :ref:`ufuncs`.
+
+    Calling ufuncs:
+    ===============
+
+    op(*x[, out], where=True, **kwargs)
+    Apply `op` to the arguments `*x` elementwise, broadcasting the arguments.
+
+    The broadcasting rules are:
+
+    * Dimensions of length 1 may be prepended to either array.
+    * Arrays may be repeated along dimensions of length 1.
+
+    Parameters
+    ----------
+    *x : array_like
+        Input arrays.
+    out : ndarray, None, or tuple of ndarray and None, optional
+        Alternate array object(s) in which to put the result; if provided, it
+        must have a shape that the inputs broadcast to. A tuple of arrays
+        (possible only as a keyword argument) must have length equal to the
+        number of outputs; use None for uninitialized outputs to be
+        allocated by the ufunc.
+    where : array_like, optional
+        This condition is broadcast over the input. At locations where the
+        condition is True, the `out` array will be set to the ufunc result.
+        Elsewhere, the `out` array will retain its original value.
+        Note that if an uninitialized `out` array is created via the default
+        ``out=None``, locations within it where the condition is False will
+        remain uninitialized.
+    **kwargs
+        For other keyword-only arguments, see the :ref:`ufunc docs <ufuncs.kwargs>`.
+
+    Returns
+    -------
+    r : ndarray or tuple of ndarray
+        `r` will have the shape that the arrays in `x` broadcast to; if `out` is
+        provided, it will be returned. If not, `r` will be allocated and
+        may contain uninitialized values. If the function has more than one
+        output, then the result will be a tuple of arrays.
+
+    """)
+
+
+##############################################################################
+#
+# ufunc attributes
+#
+##############################################################################
+
+add_newdoc('numpy.core', 'ufunc', ('identity',
+    """
+    The identity value.
+
+    Data attribute containing the identity element for the ufunc, if it has one.
+    If it does not, the attribute value is None.
+
+    Examples
+    --------
+    >>> np.add.identity
+    0
+    >>> np.multiply.identity
+    1
+    >>> np.power.identity
+    1
+    >>> print(np.exp.identity)
+    None
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('nargs',
+    """
+    The number of arguments.
+
+    Data attribute containing the number of arguments the ufunc takes, including
+    optional ones.
+
+    Notes
+    -----
+    Typically this value will be one more than what you might expect because all
+    ufuncs take  the optional "out" argument.
+
+    Examples
+    --------
+    >>> np.add.nargs
+    3
+    >>> np.multiply.nargs
+    3
+    >>> np.power.nargs
+    3
+    >>> np.exp.nargs
+    2
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('nin',
+    """
+    The number of inputs.
+
+    Data attribute containing the number of arguments the ufunc treats as input.
+
+    Examples
+    --------
+    >>> np.add.nin
+    2
+    >>> np.multiply.nin
+    2
+    >>> np.power.nin
+    2
+    >>> np.exp.nin
+    1
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('nout',
+    """
+    The number of outputs.
+
+    Data attribute containing the number of arguments the ufunc treats as output.
+
+    Notes
+    -----
+    Since all ufuncs can take output arguments, this will always be (at least) 1.
+
+    Examples
+    --------
+    >>> np.add.nout
+    1
+    >>> np.multiply.nout
+    1
+    >>> np.power.nout
+    1
+    >>> np.exp.nout
+    1
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('ntypes',
+    """
+    The number of types.
+
+    The number of numerical NumPy types - of which there are 18 total - on which
+    the ufunc can operate.
+
+    See Also
+    --------
+    numpy.ufunc.types
+
+    Examples
+    --------
+    >>> np.add.ntypes
+    18
+    >>> np.multiply.ntypes
+    18
+    >>> np.power.ntypes
+    17
+    >>> np.exp.ntypes
+    7
+    >>> np.remainder.ntypes
+    14
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('types',
+    """
+    Returns a list with types grouped input->output.
+
+    Data attribute listing the data-type "Domain-Range" groupings the ufunc can
+    deliver. The data-types are given using the character codes.
+
+    See Also
+    --------
+    numpy.ufunc.ntypes
+
+    Examples
+    --------
+    >>> np.add.types
+    ['??->?', 'bb->b', 'BB->B', 'hh->h', 'HH->H', 'ii->i', 'II->I', 'll->l',
+    'LL->L', 'qq->q', 'QQ->Q', 'ff->f', 'dd->d', 'gg->g', 'FF->F', 'DD->D',
+    'GG->G', 'OO->O']
+
+    >>> np.multiply.types
+    ['??->?', 'bb->b', 'BB->B', 'hh->h', 'HH->H', 'ii->i', 'II->I', 'll->l',
+    'LL->L', 'qq->q', 'QQ->Q', 'ff->f', 'dd->d', 'gg->g', 'FF->F', 'DD->D',
+    'GG->G', 'OO->O']
+
+    >>> np.power.types
+    ['bb->b', 'BB->B', 'hh->h', 'HH->H', 'ii->i', 'II->I', 'll->l', 'LL->L',
+    'qq->q', 'QQ->Q', 'ff->f', 'dd->d', 'gg->g', 'FF->F', 'DD->D', 'GG->G',
+    'OO->O']
+
+    >>> np.exp.types
+    ['f->f', 'd->d', 'g->g', 'F->F', 'D->D', 'G->G', 'O->O']
+
+    >>> np.remainder.types
+    ['bb->b', 'BB->B', 'hh->h', 'HH->H', 'ii->i', 'II->I', 'll->l', 'LL->L',
+    'qq->q', 'QQ->Q', 'ff->f', 'dd->d', 'gg->g', 'OO->O']
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('signature',
+    """
+    Definition of the core elements a generalized ufunc operates on.
+
+    The signature determines how the dimensions of each input/output array
+    are split into core and loop dimensions:
+
+    1. Each dimension in the signature is matched to a dimension of the
+       corresponding passed-in array, starting from the end of the shape tuple.
+    2. Core dimensions assigned to the same label in the signature must have
+       exactly matching sizes, no broadcasting is performed.
+    3. The core dimensions are removed from all inputs and the remaining
+       dimensions are broadcast together, defining the loop dimensions.
+
+    Notes
+    -----
+    Generalized ufuncs are used internally in many linalg functions, and in
+    the testing suite; the examples below are taken from these.
+    For ufuncs that operate on scalars, the signature is None, which is
+    equivalent to '()' for every argument.
+
+    Examples
+    --------
+    >>> np.core.umath_tests.matrix_multiply.signature
+    '(m,n),(n,p)->(m,p)'
+    >>> np.linalg._umath_linalg.det.signature
+    '(m,m)->()'
+    >>> np.add.signature is None
+    True  # equivalent to '(),()->()'
+    """))
+
+##############################################################################
+#
+# ufunc methods
+#
+##############################################################################
+
+add_newdoc('numpy.core', 'ufunc', ('reduce',
+    """
+    reduce(a, axis=0, dtype=None, out=None, keepdims=False, initial=<no value>, where=True)
+
+    Reduces `a`'s dimension by one, by applying ufunc along one axis.
+
+    Let :math:`a.shape = (N_0, ..., N_i, ..., N_{M-1})`.  Then
+    :math:`ufunc.reduce(a, axis=i)[k_0, ..,k_{i-1}, k_{i+1}, .., k_{M-1}]` =
+    the result of iterating `j` over :math:`range(N_i)`, cumulatively applying
+    ufunc to each :math:`a[k_0, ..,k_{i-1}, j, k_{i+1}, .., k_{M-1}]`.
+    For a one-dimensional array, reduce produces results equivalent to:
+    ::
+
+     r = op.identity # op = ufunc
+     for i in range(len(A)):
+       r = op(r, A[i])
+     return r
+
+    For example, add.reduce() is equivalent to sum().
+
+    Parameters
+    ----------
+    a : array_like
+        The array to act on.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which a reduction is performed.
+        The default (`axis` = 0) is perform a reduction over the first
+        dimension of the input array. `axis` may be negative, in
+        which case it counts from the last to the first axis.
+
+        .. versionadded:: 1.7.0
+
+        If this is None, a reduction is performed over all the axes.
+        If this is a tuple of ints, a reduction is performed on multiple
+        axes, instead of a single axis or all the axes as before.
+
+        For operations which are either not commutative or not associative,
+        doing a reduction over multiple axes is not well-defined. The
+        ufuncs do not currently raise an exception in this case, but will
+        likely do so in the future.
+    dtype : data-type code, optional
+        The type used to represent the intermediate results. Defaults
+        to the data-type of the output array if this is provided, or
+        the data-type of the input array if no output array is provided.
+    out : ndarray, None, or tuple of ndarray and None, optional
+        A location into which the result is stored. If not provided or None,
+        a freshly-allocated array is returned. For consistency with
+        ``ufunc.__call__``, if given as a keyword, this may be wrapped in a
+        1-element tuple.
+
+        .. versionchanged:: 1.13.0
+           Tuples are allowed for keyword argument.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `arr`.
+
+        .. versionadded:: 1.7.0
+    initial : scalar, optional
+        The value with which to start the reduction.
+        If the ufunc has no identity or the dtype is object, this defaults
+        to None - otherwise it defaults to ufunc.identity.
+        If ``None`` is given, the first element of the reduction is used,
+        and an error is thrown if the reduction is empty.
+
+        .. versionadded:: 1.15.0
+
+    where : array_like of bool, optional
+        A boolean array which is broadcasted to match the dimensions
+        of `a`, and selects elements to include in the reduction. Note
+        that for ufuncs like ``minimum`` that do not have an identity
+        defined, one has to pass in also ``initial``.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    r : ndarray
+        The reduced array. If `out` was supplied, `r` is a reference to it.
+
+    Examples
+    --------
+    >>> np.multiply.reduce([2,3,5])
+    30
+
+    A multi-dimensional array example:
+
+    >>> X = np.arange(8).reshape((2,2,2))
+    >>> X
+    array([[[0, 1],
+            [2, 3]],
+           [[4, 5],
+            [6, 7]]])
+    >>> np.add.reduce(X, 0)
+    array([[ 4,  6],
+           [ 8, 10]])
+    >>> np.add.reduce(X) # confirm: default axis value is 0
+    array([[ 4,  6],
+           [ 8, 10]])
+    >>> np.add.reduce(X, 1)
+    array([[ 2,  4],
+           [10, 12]])
+    >>> np.add.reduce(X, 2)
+    array([[ 1,  5],
+           [ 9, 13]])
+
+    You can use the ``initial`` keyword argument to initialize the reduction
+    with a different value, and ``where`` to select specific elements to include:
+
+    >>> np.add.reduce([10], initial=5)
+    15
+    >>> np.add.reduce(np.ones((2, 2, 2)), axis=(0, 2), initial=10)
+    array([14., 14.])
+    >>> a = np.array([10., np.nan, 10])
+    >>> np.add.reduce(a, where=~np.isnan(a))
+    20.0
+
+    Allows reductions of empty arrays where they would normally fail, i.e.
+    for ufuncs without an identity.
+
+    >>> np.minimum.reduce([], initial=np.inf)
+    inf
+    >>> np.minimum.reduce([[1., 2.], [3., 4.]], initial=10., where=[True, False])
+    array([ 1., 10.])
+    >>> np.minimum.reduce([])
+    Traceback (most recent call last):
+        ...
+    ValueError: zero-size array to reduction operation minimum which has no identity
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('accumulate',
+    """
+    accumulate(array, axis=0, dtype=None, out=None)
+
+    Accumulate the result of applying the operator to all elements.
+
+    For a one-dimensional array, accumulate produces results equivalent to::
+
+      r = np.empty(len(A))
+      t = op.identity        # op = the ufunc being applied to A's  elements
+      for i in range(len(A)):
+          t = op(t, A[i])
+          r[i] = t
+      return r
+
+    For example, add.accumulate() is equivalent to np.cumsum().
+
+    For a multi-dimensional array, accumulate is applied along only one
+    axis (axis zero by default; see Examples below) so repeated use is
+    necessary if one wants to accumulate over multiple axes.
+
+    Parameters
+    ----------
+    array : array_like
+        The array to act on.
+    axis : int, optional
+        The axis along which to apply the accumulation; default is zero.
+    dtype : data-type code, optional
+        The data-type used to represent the intermediate results. Defaults
+        to the data-type of the output array if such is provided, or the
+        the data-type of the input array if no output array is provided.
+    out : ndarray, None, or tuple of ndarray and None, optional
+        A location into which the result is stored. If not provided or None,
+        a freshly-allocated array is returned. For consistency with
+        ``ufunc.__call__``, if given as a keyword, this may be wrapped in a
+        1-element tuple.
+
+        .. versionchanged:: 1.13.0
+           Tuples are allowed for keyword argument.
+
+    Returns
+    -------
+    r : ndarray
+        The accumulated values. If `out` was supplied, `r` is a reference to
+        `out`.
+
+    Examples
+    --------
+    1-D array examples:
+
+    >>> np.add.accumulate([2, 3, 5])
+    array([ 2,  5, 10])
+    >>> np.multiply.accumulate([2, 3, 5])
+    array([ 2,  6, 30])
+
+    2-D array examples:
+
+    >>> I = np.eye(2)
+    >>> I
+    array([[1.,  0.],
+           [0.,  1.]])
+
+    Accumulate along axis 0 (rows), down columns:
+
+    >>> np.add.accumulate(I, 0)
+    array([[1.,  0.],
+           [1.,  1.]])
+    >>> np.add.accumulate(I) # no axis specified = axis zero
+    array([[1.,  0.],
+           [1.,  1.]])
+
+    Accumulate along axis 1 (columns), through rows:
+
+    >>> np.add.accumulate(I, 1)
+    array([[1.,  1.],
+           [0.,  1.]])
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('reduceat',
+    """
+    reduceat(a, indices, axis=0, dtype=None, out=None)
+
+    Performs a (local) reduce with specified slices over a single axis.
+
+    For i in ``range(len(indices))``, `reduceat` computes
+    ``ufunc.reduce(a[indices[i]:indices[i+1]])``, which becomes the i-th
+    generalized "row" parallel to `axis` in the final result (i.e., in a
+    2-D array, for example, if `axis = 0`, it becomes the i-th row, but if
+    `axis = 1`, it becomes the i-th column).  There are three exceptions to this:
+
+    * when ``i = len(indices) - 1`` (so for the last index),
+      ``indices[i+1] = a.shape[axis]``.
+    * if ``indices[i] >= indices[i + 1]``, the i-th generalized "row" is
+      simply ``a[indices[i]]``.
+    * if ``indices[i] >= len(a)`` or ``indices[i] < 0``, an error is raised.
+
+    The shape of the output depends on the size of `indices`, and may be
+    larger than `a` (this happens if ``len(indices) > a.shape[axis]``).
+
+    Parameters
+    ----------
+    a : array_like
+        The array to act on.
+    indices : array_like
+        Paired indices, comma separated (not colon), specifying slices to
+        reduce.
+    axis : int, optional
+        The axis along which to apply the reduceat.
+    dtype : data-type code, optional
+        The type used to represent the intermediate results. Defaults
+        to the data type of the output array if this is provided, or
+        the data type of the input array if no output array is provided.
+    out : ndarray, None, or tuple of ndarray and None, optional
+        A location into which the result is stored. If not provided or None,
+        a freshly-allocated array is returned. For consistency with
+        ``ufunc.__call__``, if given as a keyword, this may be wrapped in a
+        1-element tuple.
+
+        .. versionchanged:: 1.13.0
+           Tuples are allowed for keyword argument.
+
+    Returns
+    -------
+    r : ndarray
+        The reduced values. If `out` was supplied, `r` is a reference to
+        `out`.
+
+    Notes
+    -----
+    A descriptive example:
+
+    If `a` is 1-D, the function `ufunc.accumulate(a)` is the same as
+    ``ufunc.reduceat(a, indices)[::2]`` where `indices` is
+    ``range(len(array) - 1)`` with a zero placed
+    in every other element:
+    ``indices = zeros(2 * len(a) - 1)``, ``indices[1::2] = range(1, len(a))``.
+
+    Don't be fooled by this attribute's name: `reduceat(a)` is not
+    necessarily smaller than `a`.
+
+    Examples
+    --------
+    To take the running sum of four successive values:
+
+    >>> np.add.reduceat(np.arange(8),[0,4, 1,5, 2,6, 3,7])[::2]
+    array([ 6, 10, 14, 18])
+
+    A 2-D example:
+
+    >>> x = np.linspace(0, 15, 16).reshape(4,4)
+    >>> x
+    array([[ 0.,   1.,   2.,   3.],
+           [ 4.,   5.,   6.,   7.],
+           [ 8.,   9.,  10.,  11.],
+           [12.,  13.,  14.,  15.]])
+
+    ::
+
+     # reduce such that the result has the following five rows:
+     # [row1 + row2 + row3]
+     # [row4]
+     # [row2]
+     # [row3]
+     # [row1 + row2 + row3 + row4]
+
+    >>> np.add.reduceat(x, [0, 3, 1, 2, 0])
+    array([[12.,  15.,  18.,  21.],
+           [12.,  13.,  14.,  15.],
+           [ 4.,   5.,   6.,   7.],
+           [ 8.,   9.,  10.,  11.],
+           [24.,  28.,  32.,  36.]])
+
+    ::
+
+     # reduce such that result has the following two columns:
+     # [col1 * col2 * col3, col4]
+
+    >>> np.multiply.reduceat(x, [0, 3], 1)
+    array([[   0.,     3.],
+           [ 120.,     7.],
+           [ 720.,    11.],
+           [2184.,    15.]])
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('outer',
+    r"""
+    outer(A, B, **kwargs)
+
+    Apply the ufunc `op` to all pairs (a, b) with a in `A` and b in `B`.
+
+    Let ``M = A.ndim``, ``N = B.ndim``. Then the result, `C`, of
+    ``op.outer(A, B)`` is an array of dimension M + N such that:
+
+    .. math:: C[i_0, ..., i_{M-1}, j_0, ..., j_{N-1}] =
+       op(A[i_0, ..., i_{M-1}], B[j_0, ..., j_{N-1}])
+
+    For `A` and `B` one-dimensional, this is equivalent to::
+
+      r = empty(len(A),len(B))
+      for i in range(len(A)):
+          for j in range(len(B)):
+              r[i,j] = op(A[i], B[j]) # op = ufunc in question
+
+    Parameters
+    ----------
+    A : array_like
+        First array
+    B : array_like
+        Second array
+    kwargs : any
+        Arguments to pass on to the ufunc. Typically `dtype` or `out`.
+
+    Returns
+    -------
+    r : ndarray
+        Output array
+
+    See Also
+    --------
+    numpy.outer : A less powerful version of ``np.multiply.outer``
+                  that `ravel`\ s all inputs to 1D. This exists
+                  primarily for compatibility with old code.
+
+    tensordot : ``np.tensordot(a, b, axes=((), ()))`` and
+                ``np.multiply.outer(a, b)`` behave same for all
+                dimensions of a and b.
+
+    Examples
+    --------
+    >>> np.multiply.outer([1, 2, 3], [4, 5, 6])
+    array([[ 4,  5,  6],
+           [ 8, 10, 12],
+           [12, 15, 18]])
+
+    A multi-dimensional example:
+
+    >>> A = np.array([[1, 2, 3], [4, 5, 6]])
+    >>> A.shape
+    (2, 3)
+    >>> B = np.array([[1, 2, 3, 4]])
+    >>> B.shape
+    (1, 4)
+    >>> C = np.multiply.outer(A, B)
+    >>> C.shape; C
+    (2, 3, 1, 4)
+    array([[[[ 1,  2,  3,  4]],
+            [[ 2,  4,  6,  8]],
+            [[ 3,  6,  9, 12]]],
+           [[[ 4,  8, 12, 16]],
+            [[ 5, 10, 15, 20]],
+            [[ 6, 12, 18, 24]]]])
+
+    """))
+
+add_newdoc('numpy.core', 'ufunc', ('at',
+    """
+    at(a, indices, b=None)
+
+    Performs unbuffered in place operation on operand 'a' for elements
+    specified by 'indices'. For addition ufunc, this method is equivalent to
+    ``a[indices] += b``, except that results are accumulated for elements that
+    are indexed more than once. For example, ``a[[0,0]] += 1`` will only
+    increment the first element once because of buffering, whereas
+    ``add.at(a, [0,0], 1)`` will increment the first element twice.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        The array to perform in place operation on.
+    indices : array_like or tuple
+        Array like index object or slice object for indexing into first
+        operand. If first operand has multiple dimensions, indices can be a
+        tuple of array like index objects or slice objects.
+    b : array_like
+        Second operand for ufuncs requiring two operands. Operand must be
+        broadcastable over first operand after indexing or slicing.
+
+    Examples
+    --------
+    Set items 0 and 1 to their negative values:
+
+    >>> a = np.array([1, 2, 3, 4])
+    >>> np.negative.at(a, [0, 1])
+    >>> a
+    array([-1, -2,  3,  4])
+
+    Increment items 0 and 1, and increment item 2 twice:
+
+    >>> a = np.array([1, 2, 3, 4])
+    >>> np.add.at(a, [0, 1, 2, 2], 1)
+    >>> a
+    array([2, 3, 5, 4])
+
+    Add items 0 and 1 in first array to second array,
+    and store results in first array:
+
+    >>> a = np.array([1, 2, 3, 4])
+    >>> b = np.array([1, 2])
+    >>> np.add.at(a, [0, 1], b)
+    >>> a
+    array([2, 4, 3, 4])
+
+    """))
+
+##############################################################################
+#
+# Documentation for dtype attributes and methods
+#
+##############################################################################
+
+##############################################################################
+#
+# dtype object
+#
+##############################################################################
+
+add_newdoc('numpy.core.multiarray', 'dtype',
+    """
+    dtype(obj, align=False, copy=False)
+
+    Create a data type object.
+
+    A numpy array is homogeneous, and contains elements described by a
+    dtype object. A dtype object can be constructed from different
+    combinations of fundamental numeric types.
+
+    Parameters
+    ----------
+    obj
+        Object to be converted to a data type object.
+    align : bool, optional
+        Add padding to the fields to match what a C compiler would output
+        for a similar C-struct. Can be ``True`` only if `obj` is a dictionary
+        or a comma-separated string. If a struct dtype is being created,
+        this also sets a sticky alignment flag ``isalignedstruct``.
+    copy : bool, optional
+        Make a new copy of the data-type object. If ``False``, the result
+        may just be a reference to a built-in data-type object.
+
+    See also
+    --------
+    result_type
+
+    Examples
+    --------
+    Using array-scalar type:
+
+    >>> np.dtype(np.int16)
+    dtype('int16')
+
+    Structured type, one field name 'f1', containing int16:
+
+    >>> np.dtype([('f1', np.int16)])
+    dtype([('f1', '<i2')])
+
+    Structured type, one field named 'f1', in itself containing a structured
+    type with one field:
+
+    >>> np.dtype([('f1', [('f1', np.int16)])])
+    dtype([('f1', [('f1', '<i2')])])
+
+    Structured type, two fields: the first field contains an unsigned int, the
+    second an int32:
+
+    >>> np.dtype([('f1', np.uint64), ('f2', np.int32)])
+    dtype([('f1', '<u8'), ('f2', '<i4')])
+
+    Using array-protocol type strings:
+
+    >>> np.dtype([('a','f8'),('b','S10')])
+    dtype([('a', '<f8'), ('b', 'S10')])
+
+    Using comma-separated field formats.  The shape is (2,3):
+
+    >>> np.dtype("i4, (2,3)f8")
+    dtype([('f0', '<i4'), ('f1', '<f8', (2, 3))])
+
+    Using tuples.  ``int`` is a fixed type, 3 the field's shape.  ``void``
+    is a flexible type, here of size 10:
+
+    >>> np.dtype([('hello',(np.int64,3)),('world',np.void,10)])
+    dtype([('hello', '<i8', (3,)), ('world', 'V10')])
+
+    Subdivide ``int16`` into 2 ``int8``'s, called x and y.  0 and 1 are
+    the offsets in bytes:
+
+    >>> np.dtype((np.int16, {'x':(np.int8,0), 'y':(np.int8,1)}))
+    dtype((numpy.int16, [('x', 'i1'), ('y', 'i1')]))
+
+    Using dictionaries.  Two fields named 'gender' and 'age':
+
+    >>> np.dtype({'names':['gender','age'], 'formats':['S1',np.uint8]})
+    dtype([('gender', 'S1'), ('age', 'u1')])
+
+    Offsets in bytes, here 0 and 25:
+
+    >>> np.dtype({'surname':('S25',0),'age':(np.uint8,25)})
+    dtype([('surname', 'S25'), ('age', 'u1')])
+
+    """)
+
+##############################################################################
+#
+# dtype attributes
+#
+##############################################################################
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('alignment',
+    """
+    The required alignment (bytes) of this data-type according to the compiler.
+
+    More information is available in the C-API section of the manual.
+
+    Examples
+    --------
+
+    >>> x = np.dtype('i4')
+    >>> x.alignment
+    4
+
+    >>> x = np.dtype(float)
+    >>> x.alignment
+    8
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('byteorder',
+    """
+    A character indicating the byte-order of this data-type object.
+
+    One of:
+
+    ===  ==============
+    '='  native
+    '<'  little-endian
+    '>'  big-endian
+    '|'  not applicable
+    ===  ==============
+
+    All built-in data-type objects have byteorder either '=' or '|'.
+
+    Examples
+    --------
+
+    >>> dt = np.dtype('i2')
+    >>> dt.byteorder
+    '='
+    >>> # endian is not relevant for 8 bit numbers
+    >>> np.dtype('i1').byteorder
+    '|'
+    >>> # or ASCII strings
+    >>> np.dtype('S2').byteorder
+    '|'
+    >>> # Even if specific code is given, and it is native
+    >>> # '=' is the byteorder
+    >>> import sys
+    >>> sys_is_le = sys.byteorder == 'little'
+    >>> native_code = sys_is_le and '<' or '>'
+    >>> swapped_code = sys_is_le and '>' or '<'
+    >>> dt = np.dtype(native_code + 'i2')
+    >>> dt.byteorder
+    '='
+    >>> # Swapped code shows up as itself
+    >>> dt = np.dtype(swapped_code + 'i2')
+    >>> dt.byteorder == swapped_code
+    True
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('char',
+    """A unique character code for each of the 21 different built-in types.
+
+    Examples
+    --------
+
+    >>> x = np.dtype(float)
+    >>> x.char
+    'd'
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('descr',
+    """
+    `__array_interface__` description of the data-type.
+
+    The format is that required by the 'descr' key in the
+    `__array_interface__` attribute.
+
+    Warning: This attribute exists specifically for `__array_interface__`,
+    and passing it directly to `np.dtype` will not accurately reconstruct
+    some dtypes (e.g., scalar and subarray dtypes).
+
+    Examples
+    --------
+
+    >>> x = np.dtype(float)
+    >>> x.descr
+    [('', '<f8')]
+
+    >>> dt = np.dtype([('name', np.str_, 16), ('grades', np.float64, (2,))])
+    >>> dt.descr
+    [('name', '<U16'), ('grades', '<f8', (2,))]
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('fields',
+    """
+    Dictionary of named fields defined for this data type, or ``None``.
+
+    The dictionary is indexed by keys that are the names of the fields.
+    Each entry in the dictionary is a tuple fully describing the field::
+
+      (dtype, offset[, title])
+
+    Offset is limited to C int, which is signed and usually 32 bits.
+    If present, the optional title can be any object (if it is a string
+    or unicode then it will also be a key in the fields dictionary,
+    otherwise it's meta-data). Notice also that the first two elements
+    of the tuple can be passed directly as arguments to the ``ndarray.getfield``
+    and ``ndarray.setfield`` methods.
+
+    See Also
+    --------
+    ndarray.getfield, ndarray.setfield
+
+    Examples
+    --------
+    >>> dt = np.dtype([('name', np.str_, 16), ('grades', np.float64, (2,))])
+    >>> print(dt.fields)
+    {'grades': (dtype(('float64',(2,))), 16), 'name': (dtype('|S16'), 0)}
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('flags',
+    """
+    Bit-flags describing how this data type is to be interpreted.
+
+    Bit-masks are in `numpy.core.multiarray` as the constants
+    `ITEM_HASOBJECT`, `LIST_PICKLE`, `ITEM_IS_POINTER`, `NEEDS_INIT`,
+    `NEEDS_PYAPI`, `USE_GETITEM`, `USE_SETITEM`. A full explanation
+    of these flags is in C-API documentation; they are largely useful
+    for user-defined data-types.
+
+    The following example demonstrates that operations on this particular
+    dtype requires Python C-API.
+
+    Examples
+    --------
+
+    >>> x = np.dtype([('a', np.int32, 8), ('b', np.float64, 6)])
+    >>> x.flags
+    16
+    >>> np.core.multiarray.NEEDS_PYAPI
+    16
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('hasobject',
+    """
+    Boolean indicating whether this dtype contains any reference-counted
+    objects in any fields or sub-dtypes.
+
+    Recall that what is actually in the ndarray memory representing
+    the Python object is the memory address of that object (a pointer).
+    Special handling may be required, and this attribute is useful for
+    distinguishing data types that may contain arbitrary Python objects
+    and data-types that won't.
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('isbuiltin',
+    """
+    Integer indicating how this dtype relates to the built-in dtypes.
+
+    Read-only.
+
+    =  ========================================================================
+    0  if this is a structured array type, with fields
+    1  if this is a dtype compiled into numpy (such as ints, floats etc)
+    2  if the dtype is for a user-defined numpy type
+       A user-defined type uses the numpy C-API machinery to extend
+       numpy to handle a new array type. See
+       :ref:`user.user-defined-data-types` in the NumPy manual.
+    =  ========================================================================
+
+    Examples
+    --------
+    >>> dt = np.dtype('i2')
+    >>> dt.isbuiltin
+    1
+    >>> dt = np.dtype('f8')
+    >>> dt.isbuiltin
+    1
+    >>> dt = np.dtype([('field1', 'f8')])
+    >>> dt.isbuiltin
+    0
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('isnative',
+    """
+    Boolean indicating whether the byte order of this dtype is native
+    to the platform.
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('isalignedstruct',
+    """
+    Boolean indicating whether the dtype is a struct which maintains
+    field alignment. This flag is sticky, so when combining multiple
+    structs together, it is preserved and produces new dtypes which
+    are also aligned.
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('itemsize',
+    """
+    The element size of this data-type object.
+
+    For 18 of the 21 types this number is fixed by the data-type.
+    For the flexible data-types, this number can be anything.
+
+    Examples
+    --------
+
+    >>> arr = np.array([[1, 2], [3, 4]])
+    >>> arr.dtype
+    dtype('int64')
+    >>> arr.itemsize
+    8
+
+    >>> dt = np.dtype([('name', np.str_, 16), ('grades', np.float64, (2,))])
+    >>> dt.itemsize
+    80
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('kind',
+    """
+    A character code (one of 'biufcmMOSUV') identifying the general kind of data.
+
+    =  ======================
+    b  boolean
+    i  signed integer
+    u  unsigned integer
+    f  floating-point
+    c  complex floating-point
+    m  timedelta
+    M  datetime
+    O  object
+    S  (byte-)string
+    U  Unicode
+    V  void
+    =  ======================
+
+    Examples
+    --------
+
+    >>> dt = np.dtype('i4')
+    >>> dt.kind
+    'i'
+    >>> dt = np.dtype('f8')
+    >>> dt.kind
+    'f'
+    >>> dt = np.dtype([('field1', 'f8')])
+    >>> dt.kind
+    'V'
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('name',
+    """
+    A bit-width name for this data-type.
+
+    Un-sized flexible data-type objects do not have this attribute.
+
+    Examples
+    --------
+
+    >>> x = np.dtype(float)
+    >>> x.name
+    'float64'
+    >>> x = np.dtype([('a', np.int32, 8), ('b', np.float64, 6)])
+    >>> x.name
+    'void640'
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('names',
+    """
+    Ordered list of field names, or ``None`` if there are no fields.
+
+    The names are ordered according to increasing byte offset. This can be
+    used, for example, to walk through all of the named fields in offset order.
+
+    Examples
+    --------
+    >>> dt = np.dtype([('name', np.str_, 16), ('grades', np.float64, (2,))])
+    >>> dt.names
+    ('name', 'grades')
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('num',
+    """
+    A unique number for each of the 21 different built-in types.
+
+    These are roughly ordered from least-to-most precision.
+
+    Examples
+    --------
+
+    >>> dt = np.dtype(str)
+    >>> dt.num
+    19
+
+    >>> dt = np.dtype(float)
+    >>> dt.num
+    12
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('shape',
+    """
+    Shape tuple of the sub-array if this data type describes a sub-array,
+    and ``()`` otherwise.
+
+    Examples
+    --------
+
+    >>> dt = np.dtype(('i4', 4))
+    >>> dt.shape
+    (4,)
+
+    >>> dt = np.dtype(('i4', (2, 3)))
+    >>> dt.shape
+    (2, 3)
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('ndim',
+    """
+    Number of dimensions of the sub-array if this data type describes a
+    sub-array, and ``0`` otherwise.
+
+    .. versionadded:: 1.13.0
+
+    Examples
+    --------
+    >>> x = np.dtype(float)
+    >>> x.ndim
+    0
+
+    >>> x = np.dtype((float, 8))
+    >>> x.ndim
+    1
+
+    >>> x = np.dtype(('i4', (3, 4)))
+    >>> x.ndim
+    2
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('str',
+    """The array-protocol typestring of this data-type object."""))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('subdtype',
+    """
+    Tuple ``(item_dtype, shape)`` if this `dtype` describes a sub-array, and
+    None otherwise.
+
+    The *shape* is the fixed shape of the sub-array described by this
+    data type, and *item_dtype* the data type of the array.
+
+    If a field whose dtype object has this attribute is retrieved,
+    then the extra dimensions implied by *shape* are tacked on to
+    the end of the retrieved array.
+
+    See Also
+    --------
+    dtype.base
+
+    Examples
+    --------
+    >>> x = numpy.dtype('8f')
+    >>> x.subdtype
+    (dtype('float32'), (8,))
+
+    >>> x =  numpy.dtype('i2')
+    >>> x.subdtype
+    >>>
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('base',
+    """
+    Returns dtype for the base element of the subarrays,
+    regardless of their dimension or shape.
+
+    See Also
+    --------
+    dtype.subdtype
+
+    Examples
+    --------
+    >>> x = numpy.dtype('8f')
+    >>> x.base
+    dtype('float32')
+
+    >>> x =  numpy.dtype('i2')
+    >>> x.base
+    dtype('int16')
+
+    """))
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('type',
+    """The type object used to instantiate a scalar of this data-type."""))
+
+##############################################################################
+#
+# dtype methods
+#
+##############################################################################
+
+add_newdoc('numpy.core.multiarray', 'dtype', ('newbyteorder',
+    """
+    newbyteorder(new_order='S')
+
+    Return a new dtype with a different byte order.
+
+    Changes are also made in all fields and sub-arrays of the data type.
+
+    Parameters
+    ----------
+    new_order : string, optional
+        Byte order to force; a value from the byte order specifications
+        below.  The default value ('S') results in swapping the current
+        byte order.  `new_order` codes can be any of:
+
+        * 'S' - swap dtype from current to opposite endian
+        * {'<', 'L'} - little endian
+        * {'>', 'B'} - big endian
+        * {'=', 'N'} - native order
+        * {'|', 'I'} - ignore (no change to byte order)
+
+        The code does a case-insensitive check on the first letter of
+        `new_order` for these alternatives.  For example, any of '>'
+        or 'B' or 'b' or 'brian' are valid to specify big-endian.
+
+    Returns
+    -------
+    new_dtype : dtype
+        New dtype object with the given change to the byte order.
+
+    Notes
+    -----
+    Changes are also made in all fields and sub-arrays of the data type.
+
+    Examples
+    --------
+    >>> import sys
+    >>> sys_is_le = sys.byteorder == 'little'
+    >>> native_code = sys_is_le and '<' or '>'
+    >>> swapped_code = sys_is_le and '>' or '<'
+    >>> native_dt = np.dtype(native_code+'i2')
+    >>> swapped_dt = np.dtype(swapped_code+'i2')
+    >>> native_dt.newbyteorder('S') == swapped_dt
+    True
+    >>> native_dt.newbyteorder() == swapped_dt
+    True
+    >>> native_dt == swapped_dt.newbyteorder('S')
+    True
+    >>> native_dt == swapped_dt.newbyteorder('=')
+    True
+    >>> native_dt == swapped_dt.newbyteorder('N')
+    True
+    >>> native_dt == native_dt.newbyteorder('|')
+    True
+    >>> np.dtype('<i2') == native_dt.newbyteorder('<')
+    True
+    >>> np.dtype('<i2') == native_dt.newbyteorder('L')
+    True
+    >>> np.dtype('>i2') == native_dt.newbyteorder('>')
+    True
+    >>> np.dtype('>i2') == native_dt.newbyteorder('B')
+    True
+
+    """))
+
+
+##############################################################################
+#
+# Datetime-related Methods
+#
+##############################################################################
+
+add_newdoc('numpy.core.multiarray', 'busdaycalendar',
+    """
+    busdaycalendar(weekmask='1111100', holidays=None)
+
+    A business day calendar object that efficiently stores information
+    defining valid days for the busday family of functions.
+
+    The default valid days are Monday through Friday ("business days").
+    A busdaycalendar object can be specified with any set of weekly
+    valid days, plus an optional "holiday" dates that always will be invalid.
+
+    Once a busdaycalendar object is created, the weekmask and holidays
+    cannot be modified.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    weekmask : str or array_like of bool, optional
+        A seven-element array indicating which of Monday through Sunday are
+        valid days. May be specified as a length-seven list or array, like
+        [1,1,1,1,1,0,0]; a length-seven string, like '1111100'; or a string
+        like "Mon Tue Wed Thu Fri", made up of 3-character abbreviations for
+        weekdays, optionally separated by white space. Valid abbreviations
+        are: Mon Tue Wed Thu Fri Sat Sun
+    holidays : array_like of datetime64[D], optional
+        An array of dates to consider as invalid dates, no matter which
+        weekday they fall upon.  Holiday dates may be specified in any
+        order, and NaT (not-a-time) dates are ignored.  This list is
+        saved in a normalized form that is suited for fast calculations
+        of valid days.
+
+    Returns
+    -------
+    out : busdaycalendar
+        A business day calendar object containing the specified
+        weekmask and holidays values.
+
+    See Also
+    --------
+    is_busday : Returns a boolean array indicating valid days.
+    busday_offset : Applies an offset counted in valid days.
+    busday_count : Counts how many valid days are in a half-open date range.
+
+    Attributes
+    ----------
+    Note: once a busdaycalendar object is created, you cannot modify the
+    weekmask or holidays.  The attributes return copies of internal data.
+    weekmask : (copy) seven-element array of bool
+    holidays : (copy) sorted array of datetime64[D]
+
+    Examples
+    --------
+    >>> # Some important days in July
+    ... bdd = np.busdaycalendar(
+    ...             holidays=['2011-07-01', '2011-07-04', '2011-07-17'])
+    >>> # Default is Monday to Friday weekdays
+    ... bdd.weekmask
+    array([ True,  True,  True,  True,  True, False, False])
+    >>> # Any holidays already on the weekend are removed
+    ... bdd.holidays
+    array(['2011-07-01', '2011-07-04'], dtype='datetime64[D]')
+    """)
+
+add_newdoc('numpy.core.multiarray', 'busdaycalendar', ('weekmask',
+    """A copy of the seven-element boolean mask indicating valid days."""))
+
+add_newdoc('numpy.core.multiarray', 'busdaycalendar', ('holidays',
+    """A copy of the holiday array indicating additional invalid days."""))
+
+add_newdoc('numpy.core.multiarray', 'normalize_axis_index',
+    """
+    normalize_axis_index(axis, ndim, msg_prefix=None)
+
+    Normalizes an axis index, `axis`, such that is a valid positive index into
+    the shape of array with `ndim` dimensions. Raises an AxisError with an
+    appropriate message if this is not possible.
+
+    Used internally by all axis-checking logic.
+
+    .. versionadded:: 1.13.0
+
+    Parameters
+    ----------
+    axis : int
+        The un-normalized index of the axis. Can be negative
+    ndim : int
+        The number of dimensions of the array that `axis` should be normalized
+        against
+    msg_prefix : str
+        A prefix to put before the message, typically the name of the argument
+
+    Returns
+    -------
+    normalized_axis : int
+        The normalized axis index, such that `0 <= normalized_axis < ndim`
+
+    Raises
+    ------
+    AxisError
+        If the axis index is invalid, when `-ndim <= axis < ndim` is false.
+
+    Examples
+    --------
+    >>> normalize_axis_index(0, ndim=3)
+    0
+    >>> normalize_axis_index(1, ndim=3)
+    1
+    >>> normalize_axis_index(-1, ndim=3)
+    2
+
+    >>> normalize_axis_index(3, ndim=3)
+    Traceback (most recent call last):
+    ...
+    AxisError: axis 3 is out of bounds for array of dimension 3
+    >>> normalize_axis_index(-4, ndim=3, msg_prefix='axes_arg')
+    Traceback (most recent call last):
+    ...
+    AxisError: axes_arg: axis -4 is out of bounds for array of dimension 3
+    """)
+
+add_newdoc('numpy.core.multiarray', 'datetime_data',
+    """
+    datetime_data(dtype, /)
+
+    Get information about the step size of a date or time type.
+
+    The returned tuple can be passed as the second argument of `numpy.datetime64` and
+    `numpy.timedelta64`.
+
+    Parameters
+    ----------
+    dtype : dtype
+        The dtype object, which must be a `datetime64` or `timedelta64` type.
+
+    Returns
+    -------
+    unit : str
+        The :ref:`datetime unit <arrays.dtypes.dateunits>` on which this dtype
+        is based.
+    count : int
+        The number of base units in a step.
+
+    Examples
+    --------
+    >>> dt_25s = np.dtype('timedelta64[25s]')
+    >>> np.datetime_data(dt_25s)
+    ('s', 25)
+    >>> np.array(10, dt_25s).astype('timedelta64[s]')
+    array(250, dtype='timedelta64[s]')
+
+    The result can be used to construct a datetime that uses the same units
+    as a timedelta
+
+    >>> np.datetime64('2010', np.datetime_data(dt_25s))
+    numpy.datetime64('2010-01-01T00:00:00','25s')
+    """)
+
+
+##############################################################################
+#
+# Documentation for `generic` attributes and methods
+#
+##############################################################################
+
+add_newdoc('numpy.core.numerictypes', 'generic',
+    """
+    Base class for numpy scalar types.
+
+    Class from which most (all?) numpy scalar types are derived.  For
+    consistency, exposes the same API as `ndarray`, despite many
+    consequent attributes being either "get-only," or completely irrelevant.
+    This is the class from which it is strongly suggested users should derive
+    custom scalar types.
+
+    """)
+
+# Attributes
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('T',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class so as to
+    provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('base',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class so as to
+    a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('data',
+    """Pointer to start of data."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('dtype',
+    """Get array data-descriptor."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('flags',
+    """The integer value of flags."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('flat',
+    """A 1-D view of the scalar."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('imag',
+    """The imaginary part of the scalar."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('itemsize',
+    """The length of one element in bytes."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('nbytes',
+    """The length of the scalar in bytes."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('ndim',
+    """The number of array dimensions."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('real',
+    """The real part of the scalar."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('shape',
+    """Tuple of array dimensions."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('size',
+    """The number of elements in the gentype."""))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('strides',
+    """Tuple of bytes steps in each dimension."""))
+
+# Methods
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('all',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('any',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('argmax',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('argmin',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('argsort',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('astype',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('byteswap',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class so as to
+    provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('choose',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('clip',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('compress',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('conjugate',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('copy',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('cumprod',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('cumsum',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('diagonal',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('dump',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('dumps',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('fill',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('flatten',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('getfield',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('item',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('itemset',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('max',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('mean',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('min',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('newbyteorder',
+    """
+    newbyteorder(new_order='S')
+
+    Return a new `dtype` with a different byte order.
+
+    Changes are also made in all fields and sub-arrays of the data type.
+
+    The `new_order` code can be any from the following:
+
+    * 'S' - swap dtype from current to opposite endian
+    * {'<', 'L'} - little endian
+    * {'>', 'B'} - big endian
+    * {'=', 'N'} - native order
+    * {'|', 'I'} - ignore (no change to byte order)
+
+    Parameters
+    ----------
+    new_order : str, optional
+        Byte order to force; a value from the byte order specifications
+        above.  The default value ('S') results in swapping the current
+        byte order. The code does a case-insensitive check on the first
+        letter of `new_order` for the alternatives above.  For example,
+        any of 'B' or 'b' or 'biggish' are valid to specify big-endian.
+
+
+    Returns
+    -------
+    new_dtype : dtype
+        New `dtype` object with the given change to the byte order.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('nonzero',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('prod',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('ptp',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('put',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('ravel',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('repeat',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('reshape',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('resize',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('round',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('searchsorted',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('setfield',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('setflags',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class so as to
+    provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('sort',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('squeeze',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('std',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('sum',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('swapaxes',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('take',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('tofile',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('tolist',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('tostring',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('trace',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('transpose',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('var',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+add_newdoc('numpy.core.numerictypes', 'generic', ('view',
+    """
+    Not implemented (virtual attribute)
+
+    Class generic exists solely to derive numpy scalars from, and possesses,
+    albeit unimplemented, all the attributes of the ndarray class
+    so as to provide a uniform API.
+
+    See also the corresponding attribute of the derived class of interest.
+
+    """))
+
+
+##############################################################################
+#
+# Documentation for scalar type abstract base classes in type hierarchy
+#
+##############################################################################
+
+
+add_newdoc('numpy.core.numerictypes', 'number',
+    """
+    Abstract base class of all numeric scalar types.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'integer',
+    """
+    Abstract base class of all integer scalar types.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'signedinteger',
+    """
+    Abstract base class of all signed integer scalar types.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'unsignedinteger',
+    """
+    Abstract base class of all unsigned integer scalar types.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'inexact',
+    """
+    Abstract base class of all numeric scalar types with a (potentially)
+    inexact representation of the values in its range, such as
+    floating-point numbers.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'floating',
+    """
+    Abstract base class of all floating-point scalar types.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'complexfloating',
+    """
+    Abstract base class of all complex number scalar types that are made up of
+    floating-point numbers.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'flexible',
+    """
+    Abstract base class of all scalar types without predefined length.
+    The actual size of these types depends on the specific `np.dtype`
+    instantiation.
+
+    """)
+
+add_newdoc('numpy.core.numerictypes', 'character',
+    """
+    Abstract base class of all character string scalar types.
+
+    """)
+
+
+##############################################################################
+#
+# Documentation for concrete scalar classes
+#
+##############################################################################
+
+def numeric_type_aliases(aliases):
+    def type_aliases_gen():
+        for alias, doc in aliases:
+            try:
+                alias_type = getattr(_numerictypes, alias)
+            except AttributeError:
+                # The set of aliases that actually exist varies between platforms
+                pass
+            else:
+                yield (alias_type, alias, doc)
+    return list(type_aliases_gen())
+
+
+possible_aliases = numeric_type_aliases([
+    ('int8', '8-bit signed integer (-128 to 127)'),
+    ('int16', '16-bit signed integer (-32768 to 32767)'),
+    ('int32', '32-bit signed integer (-2147483648 to 2147483647)'),
+    ('int64', '64-bit signed integer (-9223372036854775808 to 9223372036854775807)'),
+    ('intp', 'Signed integer large enough to fit pointer, compatible with C ``intptr_t``'),
+    ('uint8', '8-bit unsigned integer (0 to 255)'),
+    ('uint16', '16-bit unsigned integer (0 to 65535)'),
+    ('uint32', '32-bit unsigned integer (0 to 4294967295)'),
+    ('uint64', '64-bit unsigned integer (0 to 18446744073709551615)'),
+    ('uintp', 'Unsigned integer large enough to fit pointer, compatible with C ``uintptr_t``'),
+    ('float16', '16-bit-precision floating-point number type: sign bit, 5 bits exponent, 10 bits mantissa'),
+    ('float32', '32-bit-precision floating-point number type: sign bit, 8 bits exponent, 23 bits mantissa'),
+    ('float64', '64-bit precision floating-point number type: sign bit, 11 bits exponent, 52 bits mantissa'),
+    ('float96', '96-bit extended-precision floating-point number type'),
+    ('float128', '128-bit extended-precision floating-point number type'),
+    ('complex64', 'Complex number type composed of 2 32-bit-precision floating-point numbers'),
+    ('complex128', 'Complex number type composed of 2 64-bit-precision floating-point numbers'),
+    ('complex192', 'Complex number type composed of 2 96-bit extended-precision floating-point numbers'),
+    ('complex256', 'Complex number type composed of 2 128-bit extended-precision floating-point numbers'),
+    ])
+
+
+def add_newdoc_for_scalar_type(obj, fixed_aliases, doc):
+    o = getattr(_numerictypes, obj)
+
+    character_code = dtype(o).char
+    canonical_name_doc = "" if obj == o.__name__ else "Canonical name: ``np.{}``.\n    ".format(obj)
+    alias_doc = ''.join("Alias: ``np.{}``.\n    ".format(alias) for alias in fixed_aliases)
+    alias_doc += ''.join("Alias *on this platform*: ``np.{}``: {}.\n    ".format(alias, doc)
+                         for (alias_type, alias, doc) in possible_aliases if alias_type is o)
+
+    docstring = """
+    {doc}
+    Character code: ``'{character_code}'``.
+    {canonical_name_doc}{alias_doc}
+    """.format(doc=doc.strip(), character_code=character_code,
+               canonical_name_doc=canonical_name_doc, alias_doc=alias_doc)
+
+    add_newdoc('numpy.core.numerictypes', obj, docstring)
+
+
+add_newdoc_for_scalar_type('bool_', ['bool8'],
+    """
+    Boolean type (True or False), stored as a byte.
+    """)
+
+add_newdoc_for_scalar_type('byte', [],
+    """
+    Signed integer type, compatible with C ``char``.
+    """)
+
+add_newdoc_for_scalar_type('short', [],
+    """
+    Signed integer type, compatible with C ``short``.
+    """)
+
+add_newdoc_for_scalar_type('intc', [],
+    """
+    Signed integer type, compatible with C ``int``.
+    """)
+
+add_newdoc_for_scalar_type('int_', [],
+    """
+    Signed integer type, compatible with Python `int` anc C ``long``.
+    """)
+
+add_newdoc_for_scalar_type('longlong', [],
+    """
+    Signed integer type, compatible with C ``long long``.
+    """)
+
+add_newdoc_for_scalar_type('ubyte', [],
+    """
+    Unsigned integer type, compatible with C ``unsigned char``.
+    """)
+
+add_newdoc_for_scalar_type('ushort', [],
+    """
+    Unsigned integer type, compatible with C ``unsigned short``.
+    """)
+
+add_newdoc_for_scalar_type('uintc', [],
+    """
+    Unsigned integer type, compatible with C ``unsigned int``.
+    """)
+
+add_newdoc_for_scalar_type('uint', [],
+    """
+    Unsigned integer type, compatible with C ``unsigned long``.
+    """)
+
+add_newdoc_for_scalar_type('ulonglong', [],
+    """
+    Signed integer type, compatible with C ``unsigned long long``.
+    """)
+
+add_newdoc_for_scalar_type('half', [],
+    """
+    Half-precision floating-point number type.
+    """)
+
+add_newdoc_for_scalar_type('single', [],
+    """
+    Single-precision floating-point number type, compatible with C ``float``.
+    """)
+
+add_newdoc_for_scalar_type('double', ['float_'],
+    """
+    Double-precision floating-point number type, compatible with Python `float`
+    and C ``double``.
+    """)
+
+add_newdoc_for_scalar_type('longdouble', ['longfloat'],
+    """
+    Extended-precision floating-point number type, compatible with C
+    ``long double`` but not necessarily with IEEE 754 quadruple-precision.
+    """)
+
+add_newdoc_for_scalar_type('csingle', ['singlecomplex'],
+    """
+    Complex number type composed of two single-precision floating-point
+    numbers.
+    """)
+
+add_newdoc_for_scalar_type('cdouble', ['cfloat', 'complex_'],
+    """
+    Complex number type composed of two double-precision floating-point
+    numbers, compatible with Python `complex`.
+    """)
+
+add_newdoc_for_scalar_type('clongdouble', ['clongfloat', 'longcomplex'],
+    """
+    Complex number type composed of two extended-precision floating-point
+    numbers.
+    """)
+
+add_newdoc_for_scalar_type('object_', [],
+    """
+    Any Python object.
+    """)
+
+# TODO: work out how to put this on the base class, np.floating
+for float_name in ('half', 'single', 'double', 'longdouble'):
+    add_newdoc('numpy.core.numerictypes', float_name, ('as_integer_ratio',
+        """
+        {ftype}.as_integer_ratio() -> (int, int)
+
+        Return a pair of integers, whose ratio is exactly equal to the original
+        floating point number, and with a positive denominator.
+        Raise OverflowError on infinities and a ValueError on NaNs.
+
+        >>> np.{ftype}(10.0).as_integer_ratio()
+        (10, 1)
+        >>> np.{ftype}(0.0).as_integer_ratio()
+        (0, 1)
+        >>> np.{ftype}(-.25).as_integer_ratio()
+        (-1, 4)
+        """.format(ftype=float_name)))
diff --git a/venv/Lib/site-packages/numpy/core/_asarray.py b/venv/Lib/site-packages/numpy/core/_asarray.py
new file mode 100644
index 000000000..df569f22d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_asarray.py
@@ -0,0 +1,322 @@
+"""
+Functions in the ``as*array`` family that promote array-likes into arrays.
+
+`require` fits this category despite its name not matching this pattern.
+"""
+from .overrides import set_module
+from .multiarray import array
+
+
+__all__ = [
+    "asarray", "asanyarray", "ascontiguousarray", "asfortranarray", "require",
+]
+
+@set_module('numpy')
+def asarray(a, dtype=None, order=None):
+    """Convert the input to an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data, in any form that can be converted to an array.  This
+        includes lists, lists of tuples, tuples, tuples of tuples, tuples
+        of lists and ndarrays.
+    dtype : data-type, optional
+        By default, the data-type is inferred from the input data.
+    order : {'C', 'F'}, optional
+        Whether to use row-major (C-style) or
+        column-major (Fortran-style) memory representation.
+        Defaults to 'C'.
+
+    Returns
+    -------
+    out : ndarray
+        Array interpretation of `a`.  No copy is performed if the input
+        is already an ndarray with matching dtype and order.  If `a` is a
+        subclass of ndarray, a base class ndarray is returned.
+
+    See Also
+    --------
+    asanyarray : Similar function which passes through subclasses.
+    ascontiguousarray : Convert input to a contiguous array.
+    asfarray : Convert input to a floating point ndarray.
+    asfortranarray : Convert input to an ndarray with column-major
+                     memory order.
+    asarray_chkfinite : Similar function which checks input for NaNs and Infs.
+    fromiter : Create an array from an iterator.
+    fromfunction : Construct an array by executing a function on grid
+                   positions.
+
+    Examples
+    --------
+    Convert a list into an array:
+
+    >>> a = [1, 2]
+    >>> np.asarray(a)
+    array([1, 2])
+
+    Existing arrays are not copied:
+
+    >>> a = np.array([1, 2])
+    >>> np.asarray(a) is a
+    True
+
+    If `dtype` is set, array is copied only if dtype does not match:
+
+    >>> a = np.array([1, 2], dtype=np.float32)
+    >>> np.asarray(a, dtype=np.float32) is a
+    True
+    >>> np.asarray(a, dtype=np.float64) is a
+    False
+
+    Contrary to `asanyarray`, ndarray subclasses are not passed through:
+
+    >>> issubclass(np.recarray, np.ndarray)
+    True
+    >>> a = np.array([(1.0, 2), (3.0, 4)], dtype='f4,i4').view(np.recarray)
+    >>> np.asarray(a) is a
+    False
+    >>> np.asanyarray(a) is a
+    True
+
+    """
+    return array(a, dtype, copy=False, order=order)
+
+
+@set_module('numpy')
+def asanyarray(a, dtype=None, order=None):
+    """Convert the input to an ndarray, but pass ndarray subclasses through.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data, in any form that can be converted to an array.  This
+        includes scalars, lists, lists of tuples, tuples, tuples of tuples,
+        tuples of lists, and ndarrays.
+    dtype : data-type, optional
+        By default, the data-type is inferred from the input data.
+    order : {'C', 'F'}, optional
+        Whether to use row-major (C-style) or column-major
+        (Fortran-style) memory representation.  Defaults to 'C'.
+
+    Returns
+    -------
+    out : ndarray or an ndarray subclass
+        Array interpretation of `a`.  If `a` is an ndarray or a subclass
+        of ndarray, it is returned as-is and no copy is performed.
+
+    See Also
+    --------
+    asarray : Similar function which always returns ndarrays.
+    ascontiguousarray : Convert input to a contiguous array.
+    asfarray : Convert input to a floating point ndarray.
+    asfortranarray : Convert input to an ndarray with column-major
+                     memory order.
+    asarray_chkfinite : Similar function which checks input for NaNs and
+                        Infs.
+    fromiter : Create an array from an iterator.
+    fromfunction : Construct an array by executing a function on grid
+                   positions.
+
+    Examples
+    --------
+    Convert a list into an array:
+
+    >>> a = [1, 2]
+    >>> np.asanyarray(a)
+    array([1, 2])
+
+    Instances of `ndarray` subclasses are passed through as-is:
+
+    >>> a = np.array([(1.0, 2), (3.0, 4)], dtype='f4,i4').view(np.recarray)
+    >>> np.asanyarray(a) is a
+    True
+
+    """
+    return array(a, dtype, copy=False, order=order, subok=True)
+
+
+@set_module('numpy')
+def ascontiguousarray(a, dtype=None):
+    """
+    Return a contiguous array (ndim >= 1) in memory (C order).
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    dtype : str or dtype object, optional
+        Data-type of returned array.
+
+    Returns
+    -------
+    out : ndarray
+        Contiguous array of same shape and content as `a`, with type `dtype`
+        if specified.
+
+    See Also
+    --------
+    asfortranarray : Convert input to an ndarray with column-major
+                     memory order.
+    require : Return an ndarray that satisfies requirements.
+    ndarray.flags : Information about the memory layout of the array.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2,3)
+    >>> np.ascontiguousarray(x, dtype=np.float32)
+    array([[0., 1., 2.],
+           [3., 4., 5.]], dtype=float32)
+    >>> x.flags['C_CONTIGUOUS']
+    True
+
+    Note: This function returns an array with at least one-dimension (1-d) 
+    so it will not preserve 0-d arrays.  
+
+    """
+    return array(a, dtype, copy=False, order='C', ndmin=1)
+
+
+@set_module('numpy')
+def asfortranarray(a, dtype=None):
+    """
+    Return an array (ndim >= 1) laid out in Fortran order in memory.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    dtype : str or dtype object, optional
+        By default, the data-type is inferred from the input data.
+
+    Returns
+    -------
+    out : ndarray
+        The input `a` in Fortran, or column-major, order.
+
+    See Also
+    --------
+    ascontiguousarray : Convert input to a contiguous (C order) array.
+    asanyarray : Convert input to an ndarray with either row or
+        column-major memory order.
+    require : Return an ndarray that satisfies requirements.
+    ndarray.flags : Information about the memory layout of the array.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2,3)
+    >>> y = np.asfortranarray(x)
+    >>> x.flags['F_CONTIGUOUS']
+    False
+    >>> y.flags['F_CONTIGUOUS']
+    True
+
+    Note: This function returns an array with at least one-dimension (1-d) 
+    so it will not preserve 0-d arrays.  
+
+    """
+    return array(a, dtype, copy=False, order='F', ndmin=1)
+
+
+@set_module('numpy')
+def require(a, dtype=None, requirements=None):
+    """
+    Return an ndarray of the provided type that satisfies requirements.
+
+    This function is useful to be sure that an array with the correct flags
+    is returned for passing to compiled code (perhaps through ctypes).
+
+    Parameters
+    ----------
+    a : array_like
+       The object to be converted to a type-and-requirement-satisfying array.
+    dtype : data-type
+       The required data-type. If None preserve the current dtype. If your
+       application requires the data to be in native byteorder, include
+       a byteorder specification as a part of the dtype specification.
+    requirements : str or list of str
+       The requirements list can be any of the following
+
+       * 'F_CONTIGUOUS' ('F') - ensure a Fortran-contiguous array
+       * 'C_CONTIGUOUS' ('C') - ensure a C-contiguous array
+       * 'ALIGNED' ('A')      - ensure a data-type aligned array
+       * 'WRITEABLE' ('W')    - ensure a writable array
+       * 'OWNDATA' ('O')      - ensure an array that owns its own data
+       * 'ENSUREARRAY', ('E') - ensure a base array, instead of a subclass
+
+    Returns
+    -------
+    out : ndarray
+        Array with specified requirements and type if given.
+
+    See Also
+    --------
+    asarray : Convert input to an ndarray.
+    asanyarray : Convert to an ndarray, but pass through ndarray subclasses.
+    ascontiguousarray : Convert input to a contiguous array.
+    asfortranarray : Convert input to an ndarray with column-major
+                     memory order.
+    ndarray.flags : Information about the memory layout of the array.
+
+    Notes
+    -----
+    The returned array will be guaranteed to have the listed requirements
+    by making a copy if needed.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2,3)
+    >>> x.flags
+      C_CONTIGUOUS : True
+      F_CONTIGUOUS : False
+      OWNDATA : False
+      WRITEABLE : True
+      ALIGNED : True
+      WRITEBACKIFCOPY : False
+      UPDATEIFCOPY : False
+
+    >>> y = np.require(x, dtype=np.float32, requirements=['A', 'O', 'W', 'F'])
+    >>> y.flags
+      C_CONTIGUOUS : False
+      F_CONTIGUOUS : True
+      OWNDATA : True
+      WRITEABLE : True
+      ALIGNED : True
+      WRITEBACKIFCOPY : False
+      UPDATEIFCOPY : False
+
+    """
+    possible_flags = {'C': 'C', 'C_CONTIGUOUS': 'C', 'CONTIGUOUS': 'C',
+                      'F': 'F', 'F_CONTIGUOUS': 'F', 'FORTRAN': 'F',
+                      'A': 'A', 'ALIGNED': 'A',
+                      'W': 'W', 'WRITEABLE': 'W',
+                      'O': 'O', 'OWNDATA': 'O',
+                      'E': 'E', 'ENSUREARRAY': 'E'}
+    if not requirements:
+        return asanyarray(a, dtype=dtype)
+    else:
+        requirements = {possible_flags[x.upper()] for x in requirements}
+
+    if 'E' in requirements:
+        requirements.remove('E')
+        subok = False
+    else:
+        subok = True
+
+    order = 'A'
+    if requirements >= {'C', 'F'}:
+        raise ValueError('Cannot specify both "C" and "F" order')
+    elif 'F' in requirements:
+        order = 'F'
+        requirements.remove('F')
+    elif 'C' in requirements:
+        order = 'C'
+        requirements.remove('C')
+
+    arr = array(a, dtype=dtype, order=order, copy=False, subok=subok)
+
+    for prop in requirements:
+        if not arr.flags[prop]:
+            arr = arr.copy(order)
+            break
+    return arr
diff --git a/venv/Lib/site-packages/numpy/core/_dtype.py b/venv/Lib/site-packages/numpy/core/_dtype.py
new file mode 100644
index 000000000..6b0ec5903
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_dtype.py
@@ -0,0 +1,342 @@
+"""
+A place for code to be called from the implementation of np.dtype
+
+String handling is much easier to do correctly in python.
+"""
+import numpy as np
+
+
+_kind_to_stem = {
+    'u': 'uint',
+    'i': 'int',
+    'c': 'complex',
+    'f': 'float',
+    'b': 'bool',
+    'V': 'void',
+    'O': 'object',
+    'M': 'datetime',
+    'm': 'timedelta',
+    'S': 'bytes',
+    'U': 'str',
+}
+
+
+def _kind_name(dtype):
+    try:
+        return _kind_to_stem[dtype.kind]
+    except KeyError:
+        raise RuntimeError(
+            "internal dtype error, unknown kind {!r}"
+            .format(dtype.kind)
+        )
+
+
+def __str__(dtype):
+    if dtype.fields is not None:
+        return _struct_str(dtype, include_align=True)
+    elif dtype.subdtype:
+        return _subarray_str(dtype)
+    elif issubclass(dtype.type, np.flexible) or not dtype.isnative:
+        return dtype.str
+    else:
+        return dtype.name
+
+
+def __repr__(dtype):
+    arg_str = _construction_repr(dtype, include_align=False)
+    if dtype.isalignedstruct:
+        arg_str = arg_str + ", align=True"
+    return "dtype({})".format(arg_str)
+
+
+def _unpack_field(dtype, offset, title=None):
+    """
+    Helper function to normalize the items in dtype.fields.
+
+    Call as:
+
+    dtype, offset, title = _unpack_field(*dtype.fields[name])
+    """
+    return dtype, offset, title
+
+
+def _isunsized(dtype):
+    # PyDataType_ISUNSIZED
+    return dtype.itemsize == 0
+
+
+def _construction_repr(dtype, include_align=False, short=False):
+    """
+    Creates a string repr of the dtype, excluding the 'dtype()' part
+    surrounding the object. This object may be a string, a list, or
+    a dict depending on the nature of the dtype. This
+    is the object passed as the first parameter to the dtype
+    constructor, and if no additional constructor parameters are
+    given, will reproduce the exact memory layout.
+
+    Parameters
+    ----------
+    short : bool
+        If true, this creates a shorter repr using 'kind' and 'itemsize', instead
+        of the longer type name.
+
+    include_align : bool
+        If true, this includes the 'align=True' parameter
+        inside the struct dtype construction dict when needed. Use this flag
+        if you want a proper repr string without the 'dtype()' part around it.
+
+        If false, this does not preserve the
+        'align=True' parameter or sticky NPY_ALIGNED_STRUCT flag for
+        struct arrays like the regular repr does, because the 'align'
+        flag is not part of first dtype constructor parameter. This
+        mode is intended for a full 'repr', where the 'align=True' is
+        provided as the second parameter.
+    """
+    if dtype.fields is not None:
+        return _struct_str(dtype, include_align=include_align)
+    elif dtype.subdtype:
+        return _subarray_str(dtype)
+    else:
+        return _scalar_str(dtype, short=short)
+
+
+def _scalar_str(dtype, short):
+    byteorder = _byte_order_str(dtype)
+
+    if dtype.type == np.bool_:
+        if short:
+            return "'?'"
+        else:
+            return "'bool'"
+
+    elif dtype.type == np.object_:
+        # The object reference may be different sizes on different
+        # platforms, so it should never include the itemsize here.
+        return "'O'"
+
+    elif dtype.type == np.string_:
+        if _isunsized(dtype):
+            return "'S'"
+        else:
+            return "'S%d'" % dtype.itemsize
+
+    elif dtype.type == np.unicode_:
+        if _isunsized(dtype):
+            return "'%sU'" % byteorder
+        else:
+            return "'%sU%d'" % (byteorder, dtype.itemsize / 4)
+
+    # unlike the other types, subclasses of void are preserved - but
+    # historically the repr does not actually reveal the subclass
+    elif issubclass(dtype.type, np.void):
+        if _isunsized(dtype):
+            return "'V'"
+        else:
+            return "'V%d'" % dtype.itemsize
+
+    elif dtype.type == np.datetime64:
+        return "'%sM8%s'" % (byteorder, _datetime_metadata_str(dtype))
+
+    elif dtype.type == np.timedelta64:
+        return "'%sm8%s'" % (byteorder, _datetime_metadata_str(dtype))
+
+    elif np.issubdtype(dtype, np.number):
+        # Short repr with endianness, like '<f8'
+        if short or dtype.byteorder not in ('=', '|'):
+            return "'%s%c%d'" % (byteorder, dtype.kind, dtype.itemsize)
+
+        # Longer repr, like 'float64'
+        else:
+            return "'%s%d'" % (_kind_name(dtype), 8*dtype.itemsize)
+
+    elif dtype.isbuiltin == 2:
+        return dtype.type.__name__
+
+    else:
+        raise RuntimeError(
+            "Internal error: NumPy dtype unrecognized type number")
+
+
+def _byte_order_str(dtype):
+    """ Normalize byteorder to '<' or '>' """
+    # hack to obtain the native and swapped byte order characters
+    swapped = np.dtype(int).newbyteorder('s')
+    native = swapped.newbyteorder('s')
+
+    byteorder = dtype.byteorder
+    if byteorder == '=':
+        return native.byteorder
+    if byteorder == 's':
+        # TODO: this path can never be reached
+        return swapped.byteorder
+    elif byteorder == '|':
+        return ''
+    else:
+        return byteorder
+
+
+def _datetime_metadata_str(dtype):
+    # TODO: this duplicates the C append_metastr_to_string
+    unit, count = np.datetime_data(dtype)
+    if unit == 'generic':
+        return ''
+    elif count == 1:
+        return '[{}]'.format(unit)
+    else:
+        return '[{}{}]'.format(count, unit)
+
+
+def _struct_dict_str(dtype, includealignedflag):
+    # unpack the fields dictionary into ls
+    names = dtype.names
+    fld_dtypes = []
+    offsets = []
+    titles = []
+    for name in names:
+        fld_dtype, offset, title = _unpack_field(*dtype.fields[name])
+        fld_dtypes.append(fld_dtype)
+        offsets.append(offset)
+        titles.append(title)
+
+    # Build up a string to make the dictionary
+
+    # First, the names
+    ret = "{'names':["
+    ret += ",".join(repr(name) for name in names)
+
+    # Second, the formats
+    ret += "], 'formats':["
+    ret += ",".join(
+        _construction_repr(fld_dtype, short=True) for fld_dtype in fld_dtypes)
+
+    # Third, the offsets
+    ret += "], 'offsets':["
+    ret += ",".join("%d" % offset for offset in offsets)
+
+    # Fourth, the titles
+    if any(title is not None for title in titles):
+        ret += "], 'titles':["
+        ret += ",".join(repr(title) for title in titles)
+
+    # Fifth, the itemsize
+    ret += "], 'itemsize':%d" % dtype.itemsize
+
+    if (includealignedflag and dtype.isalignedstruct):
+        # Finally, the aligned flag
+        ret += ", 'aligned':True}"
+    else:
+        ret += "}"
+
+    return ret
+
+
+def _is_packed(dtype):
+    """
+    Checks whether the structured data type in 'dtype'
+    has a simple layout, where all the fields are in order,
+    and follow each other with no alignment padding.
+
+    When this returns true, the dtype can be reconstructed
+    from a list of the field names and dtypes with no additional
+    dtype parameters.
+
+    Duplicates the C `is_dtype_struct_simple_unaligned_layout` function.
+    """
+    total_offset = 0
+    for name in dtype.names:
+        fld_dtype, fld_offset, title = _unpack_field(*dtype.fields[name])
+        if fld_offset != total_offset:
+            return False
+        total_offset += fld_dtype.itemsize
+    if total_offset != dtype.itemsize:
+        return False
+    return True
+
+
+def _struct_list_str(dtype):
+    items = []
+    for name in dtype.names:
+        fld_dtype, fld_offset, title = _unpack_field(*dtype.fields[name])
+
+        item = "("
+        if title is not None:
+            item += "({!r}, {!r}), ".format(title, name)
+        else:
+            item += "{!r}, ".format(name)
+        # Special case subarray handling here
+        if fld_dtype.subdtype is not None:
+            base, shape = fld_dtype.subdtype
+            item += "{}, {}".format(
+                _construction_repr(base, short=True),
+                shape
+            )
+        else:
+            item += _construction_repr(fld_dtype, short=True)
+
+        item += ")"
+        items.append(item)
+
+    return "[" + ", ".join(items) + "]"
+
+
+def _struct_str(dtype, include_align):
+    # The list str representation can't include the 'align=' flag,
+    # so if it is requested and the struct has the aligned flag set,
+    # we must use the dict str instead.
+    if not (include_align and dtype.isalignedstruct) and _is_packed(dtype):
+        sub = _struct_list_str(dtype)
+
+    else:
+        sub = _struct_dict_str(dtype, include_align)
+
+    # If the data type isn't the default, void, show it
+    if dtype.type != np.void:
+        return "({t.__module__}.{t.__name__}, {f})".format(t=dtype.type, f=sub)
+    else:
+        return sub
+
+
+def _subarray_str(dtype):
+    base, shape = dtype.subdtype
+    return "({}, {})".format(
+        _construction_repr(base, short=True),
+        shape
+    )
+
+
+def _name_includes_bit_suffix(dtype):
+    if dtype.type == np.object_:
+        # pointer size varies by system, best to omit it
+        return False
+    elif dtype.type == np.bool_:
+        # implied
+        return False
+    elif np.issubdtype(dtype, np.flexible) and _isunsized(dtype):
+        # unspecified
+        return False
+    else:
+        return True
+
+
+def _name_get(dtype):
+    # provides dtype.name.__get__, documented as returning a "bit name"
+
+    if dtype.isbuiltin == 2:
+        # user dtypes don't promise to do anything special
+        return dtype.type.__name__
+
+    if issubclass(dtype.type, np.void):
+        # historically, void subclasses preserve their name, eg `record64`
+        name = dtype.type.__name__
+    else:
+        name = _kind_name(dtype)
+
+    # append bit counts
+    if _name_includes_bit_suffix(dtype):
+        name += "{}".format(dtype.itemsize * 8)
+
+    # append metadata to datetimes
+    if dtype.type in (np.datetime64, np.timedelta64):
+        name += _datetime_metadata_str(dtype)
+
+    return name
diff --git a/venv/Lib/site-packages/numpy/core/_dtype_ctypes.py b/venv/Lib/site-packages/numpy/core/_dtype_ctypes.py
new file mode 100644
index 000000000..6d7cbb244
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_dtype_ctypes.py
@@ -0,0 +1,117 @@
+"""
+Conversion from ctypes to dtype.
+
+In an ideal world, we could achieve this through the PEP3118 buffer protocol,
+something like::
+
+    def dtype_from_ctypes_type(t):
+        # needed to ensure that the shape of `t` is within memoryview.format
+        class DummyStruct(ctypes.Structure):
+            _fields_ = [('a', t)]
+
+        # empty to avoid memory allocation
+        ctype_0 = (DummyStruct * 0)()
+        mv = memoryview(ctype_0)
+
+        # convert the struct, and slice back out the field
+        return _dtype_from_pep3118(mv.format)['a']
+
+Unfortunately, this fails because:
+
+* ctypes cannot handle length-0 arrays with PEP3118 (bpo-32782)
+* PEP3118 cannot represent unions, but both numpy and ctypes can
+* ctypes cannot handle big-endian structs with PEP3118 (bpo-32780)
+"""
+
+# We delay-import ctypes for distributions that do not include it.
+# While this module is not used unless the user passes in ctypes
+# members, it is eagerly imported from numpy/core/__init__.py.
+import numpy as np
+
+
+def _from_ctypes_array(t):
+    return np.dtype((dtype_from_ctypes_type(t._type_), (t._length_,)))
+
+
+def _from_ctypes_structure(t):
+    for item in t._fields_:
+        if len(item) > 2:
+            raise TypeError(
+                "ctypes bitfields have no dtype equivalent")
+
+    if hasattr(t, "_pack_"):
+        import ctypes
+        formats = []
+        offsets = []
+        names = []
+        current_offset = 0
+        for fname, ftyp in t._fields_:
+            names.append(fname)
+            formats.append(dtype_from_ctypes_type(ftyp))
+            # Each type has a default offset, this is platform dependent for some types.
+            effective_pack = min(t._pack_, ctypes.alignment(ftyp))
+            current_offset = ((current_offset + effective_pack - 1) // effective_pack) * effective_pack
+            offsets.append(current_offset)
+            current_offset += ctypes.sizeof(ftyp)
+
+        return np.dtype(dict(
+            formats=formats,
+            offsets=offsets,
+            names=names,
+            itemsize=ctypes.sizeof(t)))
+    else:
+        fields = []
+        for fname, ftyp in t._fields_:
+            fields.append((fname, dtype_from_ctypes_type(ftyp)))
+
+        # by default, ctypes structs are aligned
+        return np.dtype(fields, align=True)
+
+
+def _from_ctypes_scalar(t):
+    """
+    Return the dtype type with endianness included if it's the case
+    """
+    if getattr(t, '__ctype_be__', None) is t:
+        return np.dtype('>' + t._type_)
+    elif getattr(t, '__ctype_le__', None) is t:
+        return np.dtype('<' + t._type_)
+    else:
+        return np.dtype(t._type_)
+
+
+def _from_ctypes_union(t):
+    import ctypes
+    formats = []
+    offsets = []
+    names = []
+    for fname, ftyp in t._fields_:
+        names.append(fname)
+        formats.append(dtype_from_ctypes_type(ftyp))
+        offsets.append(0)  # Union fields are offset to 0
+
+    return np.dtype(dict(
+        formats=formats,
+        offsets=offsets,
+        names=names,
+        itemsize=ctypes.sizeof(t)))
+
+
+def dtype_from_ctypes_type(t):
+    """
+    Construct a dtype object from a ctypes type
+    """
+    import _ctypes
+    if issubclass(t, _ctypes.Array):
+        return _from_ctypes_array(t)
+    elif issubclass(t, _ctypes._Pointer):
+        raise TypeError("ctypes pointers have no dtype equivalent")
+    elif issubclass(t, _ctypes.Structure):
+        return _from_ctypes_structure(t)
+    elif issubclass(t, _ctypes.Union):
+        return _from_ctypes_union(t)
+    elif isinstance(getattr(t, '_type_', None), str):
+        return _from_ctypes_scalar(t)
+    else:
+        raise NotImplementedError(
+            "Unknown ctypes type {}".format(t.__name__))
diff --git a/venv/Lib/site-packages/numpy/core/_exceptions.py b/venv/Lib/site-packages/numpy/core/_exceptions.py
new file mode 100644
index 000000000..99172e23d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_exceptions.py
@@ -0,0 +1,199 @@
+"""
+Various richly-typed exceptions, that also help us deal with string formatting
+in python where it's easier.
+
+By putting the formatting in `__str__`, we also avoid paying the cost for
+users who silence the exceptions.
+"""
+from numpy.core.overrides import set_module
+
+def _unpack_tuple(tup):
+    if len(tup) == 1:
+        return tup[0]
+    else:
+        return tup
+
+
+def _display_as_base(cls):
+    """
+    A decorator that makes an exception class look like its base.
+
+    We use this to hide subclasses that are implementation details - the user
+    should catch the base type, which is what the traceback will show them.
+
+    Classes decorated with this decorator are subject to removal without a
+    deprecation warning.
+    """
+    assert issubclass(cls, Exception)
+    cls.__name__ = cls.__base__.__name__
+    cls.__qualname__ = cls.__base__.__qualname__
+    set_module(cls.__base__.__module__)(cls)
+    return cls
+
+
+class UFuncTypeError(TypeError):
+    """ Base class for all ufunc exceptions """
+    def __init__(self, ufunc):
+        self.ufunc = ufunc
+
+
+@_display_as_base
+class _UFuncBinaryResolutionError(UFuncTypeError):
+    """ Thrown when a binary resolution fails """
+    def __init__(self, ufunc, dtypes):
+        super().__init__(ufunc)
+        self.dtypes = tuple(dtypes)
+        assert len(self.dtypes) == 2
+
+    def __str__(self):
+        return (
+            "ufunc {!r} cannot use operands with types {!r} and {!r}"
+        ).format(
+            self.ufunc.__name__, *self.dtypes
+        )
+
+
+@_display_as_base
+class _UFuncNoLoopError(UFuncTypeError):
+    """ Thrown when a ufunc loop cannot be found """
+    def __init__(self, ufunc, dtypes):
+        super().__init__(ufunc)
+        self.dtypes = tuple(dtypes)
+
+    def __str__(self):
+        return (
+            "ufunc {!r} did not contain a loop with signature matching types "
+            "{!r} -> {!r}"
+        ).format(
+            self.ufunc.__name__,
+            _unpack_tuple(self.dtypes[:self.ufunc.nin]),
+            _unpack_tuple(self.dtypes[self.ufunc.nin:])
+        )
+
+
+@_display_as_base
+class _UFuncCastingError(UFuncTypeError):
+    def __init__(self, ufunc, casting, from_, to):
+        super().__init__(ufunc)
+        self.casting = casting
+        self.from_ = from_
+        self.to = to
+
+
+@_display_as_base
+class _UFuncInputCastingError(_UFuncCastingError):
+    """ Thrown when a ufunc input cannot be casted """
+    def __init__(self, ufunc, casting, from_, to, i):
+        super().__init__(ufunc, casting, from_, to)
+        self.in_i = i
+
+    def __str__(self):
+        # only show the number if more than one input exists
+        i_str = "{} ".format(self.in_i) if self.ufunc.nin != 1 else ""
+        return (
+            "Cannot cast ufunc {!r} input {}from {!r} to {!r} with casting "
+            "rule {!r}"
+        ).format(
+            self.ufunc.__name__, i_str, self.from_, self.to, self.casting
+        )
+
+
+@_display_as_base
+class _UFuncOutputCastingError(_UFuncCastingError):
+    """ Thrown when a ufunc output cannot be casted """
+    def __init__(self, ufunc, casting, from_, to, i):
+        super().__init__(ufunc, casting, from_, to)
+        self.out_i = i
+
+    def __str__(self):
+        # only show the number if more than one output exists
+        i_str = "{} ".format(self.out_i) if self.ufunc.nout != 1 else ""
+        return (
+            "Cannot cast ufunc {!r} output {}from {!r} to {!r} with casting "
+            "rule {!r}"
+        ).format(
+            self.ufunc.__name__, i_str, self.from_, self.to, self.casting
+        )
+
+
+# Exception used in shares_memory()
+@set_module('numpy')
+class TooHardError(RuntimeError):
+    pass
+
+
+@set_module('numpy')
+class AxisError(ValueError, IndexError):
+    """ Axis supplied was invalid. """
+    def __init__(self, axis, ndim=None, msg_prefix=None):
+        # single-argument form just delegates to base class
+        if ndim is None and msg_prefix is None:
+            msg = axis
+
+        # do the string formatting here, to save work in the C code
+        else:
+            msg = ("axis {} is out of bounds for array of dimension {}"
+                   .format(axis, ndim))
+            if msg_prefix is not None:
+                msg = "{}: {}".format(msg_prefix, msg)
+
+        super(AxisError, self).__init__(msg)
+
+
+@_display_as_base
+class _ArrayMemoryError(MemoryError):
+    """ Thrown when an array cannot be allocated"""
+    def __init__(self, shape, dtype):
+        self.shape = shape
+        self.dtype = dtype
+
+    @property
+    def _total_size(self):
+        num_bytes = self.dtype.itemsize
+        for dim in self.shape:
+            num_bytes *= dim
+        return num_bytes
+
+    @staticmethod
+    def _size_to_string(num_bytes):
+        """ Convert a number of bytes into a binary size string """
+
+        # https://en.wikipedia.org/wiki/Binary_prefix
+        LOG2_STEP = 10
+        STEP = 1024
+        units = ['bytes', 'KiB', 'MiB', 'GiB', 'TiB', 'PiB', 'EiB']
+
+        unit_i = max(num_bytes.bit_length() - 1, 1) // LOG2_STEP
+        unit_val = 1 << (unit_i * LOG2_STEP)
+        n_units = num_bytes / unit_val
+        del unit_val
+
+        # ensure we pick a unit that is correct after rounding
+        if round(n_units) == STEP:
+            unit_i += 1
+            n_units /= STEP
+
+        # deal with sizes so large that we don't have units for them
+        if unit_i >= len(units):
+            new_unit_i = len(units) - 1
+            n_units *= 1 << ((unit_i - new_unit_i) * LOG2_STEP)
+            unit_i = new_unit_i
+
+        unit_name = units[unit_i]
+        # format with a sensible number of digits
+        if unit_i == 0:
+            # no decimal point on bytes
+            return '{:.0f} {}'.format(n_units, unit_name)
+        elif round(n_units) < 1000:
+            # 3 significant figures, if none are dropped to the left of the .
+            return '{:#.3g} {}'.format(n_units, unit_name)
+        else:
+            # just give all the digits otherwise
+            return '{:#.0f} {}'.format(n_units, unit_name)
+
+    def __str__(self):
+        size_str = self._size_to_string(self._total_size)
+        return (
+            "Unable to allocate {} for an array with shape {} and data type {}"
+            .format(size_str, self.shape, self.dtype)
+        )
diff --git a/venv/Lib/site-packages/numpy/core/_internal.py b/venv/Lib/site-packages/numpy/core/_internal.py
new file mode 100644
index 000000000..1378497bb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_internal.py
@@ -0,0 +1,874 @@
+"""
+A place for internal code
+
+Some things are more easily handled Python.
+
+"""
+import ast
+import re
+import sys
+import platform
+
+from .multiarray import dtype, array, ndarray
+try:
+    import ctypes
+except ImportError:
+    ctypes = None
+
+IS_PYPY = platform.python_implementation() == 'PyPy'
+
+if (sys.byteorder == 'little'):
+    _nbo = '<'
+else:
+    _nbo = '>'
+
+def _makenames_list(adict, align):
+    allfields = []
+    fnames = list(adict.keys())
+    for fname in fnames:
+        obj = adict[fname]
+        n = len(obj)
+        if not isinstance(obj, tuple) or n not in [2, 3]:
+            raise ValueError("entry not a 2- or 3- tuple")
+        if (n > 2) and (obj[2] == fname):
+            continue
+        num = int(obj[1])
+        if (num < 0):
+            raise ValueError("invalid offset.")
+        format = dtype(obj[0], align=align)
+        if (n > 2):
+            title = obj[2]
+        else:
+            title = None
+        allfields.append((fname, format, num, title))
+    # sort by offsets
+    allfields.sort(key=lambda x: x[2])
+    names = [x[0] for x in allfields]
+    formats = [x[1] for x in allfields]
+    offsets = [x[2] for x in allfields]
+    titles = [x[3] for x in allfields]
+
+    return names, formats, offsets, titles
+
+# Called in PyArray_DescrConverter function when
+#  a dictionary without "names" and "formats"
+#  fields is used as a data-type descriptor.
+def _usefields(adict, align):
+    try:
+        names = adict[-1]
+    except KeyError:
+        names = None
+    if names is None:
+        names, formats, offsets, titles = _makenames_list(adict, align)
+    else:
+        formats = []
+        offsets = []
+        titles = []
+        for name in names:
+            res = adict[name]
+            formats.append(res[0])
+            offsets.append(res[1])
+            if (len(res) > 2):
+                titles.append(res[2])
+            else:
+                titles.append(None)
+
+    return dtype({"names": names,
+                  "formats": formats,
+                  "offsets": offsets,
+                  "titles": titles}, align)
+
+
+# construct an array_protocol descriptor list
+#  from the fields attribute of a descriptor
+# This calls itself recursively but should eventually hit
+#  a descriptor that has no fields and then return
+#  a simple typestring
+
+def _array_descr(descriptor):
+    fields = descriptor.fields
+    if fields is None:
+        subdtype = descriptor.subdtype
+        if subdtype is None:
+            if descriptor.metadata is None:
+                return descriptor.str
+            else:
+                new = descriptor.metadata.copy()
+                if new:
+                    return (descriptor.str, new)
+                else:
+                    return descriptor.str
+        else:
+            return (_array_descr(subdtype[0]), subdtype[1])
+
+    names = descriptor.names
+    ordered_fields = [fields[x] + (x,) for x in names]
+    result = []
+    offset = 0
+    for field in ordered_fields:
+        if field[1] > offset:
+            num = field[1] - offset
+            result.append(('', '|V%d' % num))
+            offset += num
+        elif field[1] < offset:
+            raise ValueError(
+                "dtype.descr is not defined for types with overlapping or "
+                "out-of-order fields")
+        if len(field) > 3:
+            name = (field[2], field[3])
+        else:
+            name = field[2]
+        if field[0].subdtype:
+            tup = (name, _array_descr(field[0].subdtype[0]),
+                   field[0].subdtype[1])
+        else:
+            tup = (name, _array_descr(field[0]))
+        offset += field[0].itemsize
+        result.append(tup)
+
+    if descriptor.itemsize > offset:
+        num = descriptor.itemsize - offset
+        result.append(('', '|V%d' % num))
+
+    return result
+
+# Build a new array from the information in a pickle.
+# Note that the name numpy.core._internal._reconstruct is embedded in
+# pickles of ndarrays made with NumPy before release 1.0
+# so don't remove the name here, or you'll
+# break backward compatibility.
+def _reconstruct(subtype, shape, dtype):
+    return ndarray.__new__(subtype, shape, dtype)
+
+
+# format_re was originally from numarray by J. Todd Miller
+
+format_re = re.compile(r'(?P<order1>[<>|=]?)'
+                       r'(?P<repeats> *[(]?[ ,0-9]*[)]? *)'
+                       r'(?P<order2>[<>|=]?)'
+                       r'(?P<dtype>[A-Za-z0-9.?]*(?:\[[a-zA-Z0-9,.]+\])?)')
+sep_re = re.compile(r'\s*,\s*')
+space_re = re.compile(r'\s+$')
+
+# astr is a string (perhaps comma separated)
+
+_convorder = {'=': _nbo}
+
+def _commastring(astr):
+    startindex = 0
+    result = []
+    while startindex < len(astr):
+        mo = format_re.match(astr, pos=startindex)
+        try:
+            (order1, repeats, order2, dtype) = mo.groups()
+        except (TypeError, AttributeError):
+            raise ValueError('format number %d of "%s" is not recognized' %
+                                            (len(result)+1, astr))
+        startindex = mo.end()
+        # Separator or ending padding
+        if startindex < len(astr):
+            if space_re.match(astr, pos=startindex):
+                startindex = len(astr)
+            else:
+                mo = sep_re.match(astr, pos=startindex)
+                if not mo:
+                    raise ValueError(
+                        'format number %d of "%s" is not recognized' %
+                        (len(result)+1, astr))
+                startindex = mo.end()
+
+        if order2 == '':
+            order = order1
+        elif order1 == '':
+            order = order2
+        else:
+            order1 = _convorder.get(order1, order1)
+            order2 = _convorder.get(order2, order2)
+            if (order1 != order2):
+                raise ValueError(
+                    'inconsistent byte-order specification %s and %s' %
+                    (order1, order2))
+            order = order1
+
+        if order in ['|', '=', _nbo]:
+            order = ''
+        dtype = order + dtype
+        if (repeats == ''):
+            newitem = dtype
+        else:
+            newitem = (dtype, ast.literal_eval(repeats))
+        result.append(newitem)
+
+    return result
+
+class dummy_ctype:
+    def __init__(self, cls):
+        self._cls = cls
+    def __mul__(self, other):
+        return self
+    def __call__(self, *other):
+        return self._cls(other)
+    def __eq__(self, other):
+        return self._cls == other._cls
+    def __ne__(self, other):
+        return self._cls != other._cls
+
+def _getintp_ctype():
+    val = _getintp_ctype.cache
+    if val is not None:
+        return val
+    if ctypes is None:
+        import numpy as np
+        val = dummy_ctype(np.intp)
+    else:
+        char = dtype('p').char
+        if (char == 'i'):
+            val = ctypes.c_int
+        elif char == 'l':
+            val = ctypes.c_long
+        elif char == 'q':
+            val = ctypes.c_longlong
+        else:
+            val = ctypes.c_long
+    _getintp_ctype.cache = val
+    return val
+_getintp_ctype.cache = None
+
+# Used for .ctypes attribute of ndarray
+
+class _missing_ctypes:
+    def cast(self, num, obj):
+        return num.value
+
+    class c_void_p:
+        def __init__(self, ptr):
+            self.value = ptr
+
+
+class _ctypes:
+    def __init__(self, array, ptr=None):
+        self._arr = array
+
+        if ctypes:
+            self._ctypes = ctypes
+            self._data = self._ctypes.c_void_p(ptr)
+        else:
+            # fake a pointer-like object that holds onto the reference
+            self._ctypes = _missing_ctypes()
+            self._data = self._ctypes.c_void_p(ptr)
+            self._data._objects = array
+
+        if self._arr.ndim == 0:
+            self._zerod = True
+        else:
+            self._zerod = False
+
+    def data_as(self, obj):
+        """
+        Return the data pointer cast to a particular c-types object.
+        For example, calling ``self._as_parameter_`` is equivalent to
+        ``self.data_as(ctypes.c_void_p)``. Perhaps you want to use the data as a
+        pointer to a ctypes array of floating-point data:
+        ``self.data_as(ctypes.POINTER(ctypes.c_double))``.
+
+        The returned pointer will keep a reference to the array.
+        """
+        # _ctypes.cast function causes a circular reference of self._data in
+        # self._data._objects. Attributes of self._data cannot be released
+        # until gc.collect is called. Make a copy of the pointer first then let
+        # it hold the array reference. This is a workaround to circumvent the
+        # CPython bug https://bugs.python.org/issue12836
+        ptr = self._ctypes.cast(self._data, obj)
+        ptr._arr = self._arr
+        return ptr
+
+    def shape_as(self, obj):
+        """
+        Return the shape tuple as an array of some other c-types
+        type. For example: ``self.shape_as(ctypes.c_short)``.
+        """
+        if self._zerod:
+            return None
+        return (obj*self._arr.ndim)(*self._arr.shape)
+
+    def strides_as(self, obj):
+        """
+        Return the strides tuple as an array of some other
+        c-types type. For example: ``self.strides_as(ctypes.c_longlong)``.
+        """
+        if self._zerod:
+            return None
+        return (obj*self._arr.ndim)(*self._arr.strides)
+
+    @property
+    def data(self):
+        """
+        A pointer to the memory area of the array as a Python integer.
+        This memory area may contain data that is not aligned, or not in correct
+        byte-order. The memory area may not even be writeable. The array
+        flags and data-type of this array should be respected when passing this
+        attribute to arbitrary C-code to avoid trouble that can include Python
+        crashing. User Beware! The value of this attribute is exactly the same
+        as ``self._array_interface_['data'][0]``.
+
+        Note that unlike ``data_as``, a reference will not be kept to the array:
+        code like ``ctypes.c_void_p((a + b).ctypes.data)`` will result in a
+        pointer to a deallocated array, and should be spelt
+        ``(a + b).ctypes.data_as(ctypes.c_void_p)``
+        """
+        return self._data.value
+
+    @property
+    def shape(self):
+        """
+        (c_intp*self.ndim): A ctypes array of length self.ndim where
+        the basetype is the C-integer corresponding to ``dtype('p')`` on this
+        platform. This base-type could be `ctypes.c_int`, `ctypes.c_long`, or
+        `ctypes.c_longlong` depending on the platform.
+        The c_intp type is defined accordingly in `numpy.ctypeslib`.
+        The ctypes array contains the shape of the underlying array.
+        """
+        return self.shape_as(_getintp_ctype())
+
+    @property
+    def strides(self):
+        """
+        (c_intp*self.ndim): A ctypes array of length self.ndim where
+        the basetype is the same as for the shape attribute. This ctypes array
+        contains the strides information from the underlying array. This strides
+        information is important for showing how many bytes must be jumped to
+        get to the next element in the array.
+        """
+        return self.strides_as(_getintp_ctype())
+
+    @property
+    def _as_parameter_(self):
+        """
+        Overrides the ctypes semi-magic method
+
+        Enables `c_func(some_array.ctypes)`
+        """
+        return self.data_as(ctypes.c_void_p)
+
+    # kept for compatibility
+    get_data = data.fget
+    get_shape = shape.fget
+    get_strides = strides.fget
+    get_as_parameter = _as_parameter_.fget
+
+
+def _newnames(datatype, order):
+    """
+    Given a datatype and an order object, return a new names tuple, with the
+    order indicated
+    """
+    oldnames = datatype.names
+    nameslist = list(oldnames)
+    if isinstance(order, str):
+        order = [order]
+    seen = set()
+    if isinstance(order, (list, tuple)):
+        for name in order:
+            try:
+                nameslist.remove(name)
+            except ValueError:
+                if name in seen:
+                    raise ValueError("duplicate field name: %s" % (name,))
+                else:
+                    raise ValueError("unknown field name: %s" % (name,))
+            seen.add(name)
+        return tuple(list(order) + nameslist)
+    raise ValueError("unsupported order value: %s" % (order,))
+
+def _copy_fields(ary):
+    """Return copy of structured array with padding between fields removed.
+
+    Parameters
+    ----------
+    ary : ndarray
+       Structured array from which to remove padding bytes
+
+    Returns
+    -------
+    ary_copy : ndarray
+       Copy of ary with padding bytes removed
+    """
+    dt = ary.dtype
+    copy_dtype = {'names': dt.names,
+                  'formats': [dt.fields[name][0] for name in dt.names]}
+    return array(ary, dtype=copy_dtype, copy=True)
+
+def _getfield_is_safe(oldtype, newtype, offset):
+    """ Checks safety of getfield for object arrays.
+
+    As in _view_is_safe, we need to check that memory containing objects is not
+    reinterpreted as a non-object datatype and vice versa.
+
+    Parameters
+    ----------
+    oldtype : data-type
+        Data type of the original ndarray.
+    newtype : data-type
+        Data type of the field being accessed by ndarray.getfield
+    offset : int
+        Offset of the field being accessed by ndarray.getfield
+
+    Raises
+    ------
+    TypeError
+        If the field access is invalid
+
+    """
+    if newtype.hasobject or oldtype.hasobject:
+        if offset == 0 and newtype == oldtype:
+            return
+        if oldtype.names is not None:
+            for name in oldtype.names:
+                if (oldtype.fields[name][1] == offset and
+                        oldtype.fields[name][0] == newtype):
+                    return
+        raise TypeError("Cannot get/set field of an object array")
+    return
+
+def _view_is_safe(oldtype, newtype):
+    """ Checks safety of a view involving object arrays, for example when
+    doing::
+
+        np.zeros(10, dtype=oldtype).view(newtype)
+
+    Parameters
+    ----------
+    oldtype : data-type
+        Data type of original ndarray
+    newtype : data-type
+        Data type of the view
+
+    Raises
+    ------
+    TypeError
+        If the new type is incompatible with the old type.
+
+    """
+
+    # if the types are equivalent, there is no problem.
+    # for example: dtype((np.record, 'i4,i4')) == dtype((np.void, 'i4,i4'))
+    if oldtype == newtype:
+        return
+
+    if newtype.hasobject or oldtype.hasobject:
+        raise TypeError("Cannot change data-type for object array.")
+    return
+
+# Given a string containing a PEP 3118 format specifier,
+# construct a NumPy dtype
+
+_pep3118_native_map = {
+    '?': '?',
+    'c': 'S1',
+    'b': 'b',
+    'B': 'B',
+    'h': 'h',
+    'H': 'H',
+    'i': 'i',
+    'I': 'I',
+    'l': 'l',
+    'L': 'L',
+    'q': 'q',
+    'Q': 'Q',
+    'e': 'e',
+    'f': 'f',
+    'd': 'd',
+    'g': 'g',
+    'Zf': 'F',
+    'Zd': 'D',
+    'Zg': 'G',
+    's': 'S',
+    'w': 'U',
+    'O': 'O',
+    'x': 'V',  # padding
+}
+_pep3118_native_typechars = ''.join(_pep3118_native_map.keys())
+
+_pep3118_standard_map = {
+    '?': '?',
+    'c': 'S1',
+    'b': 'b',
+    'B': 'B',
+    'h': 'i2',
+    'H': 'u2',
+    'i': 'i4',
+    'I': 'u4',
+    'l': 'i4',
+    'L': 'u4',
+    'q': 'i8',
+    'Q': 'u8',
+    'e': 'f2',
+    'f': 'f',
+    'd': 'd',
+    'Zf': 'F',
+    'Zd': 'D',
+    's': 'S',
+    'w': 'U',
+    'O': 'O',
+    'x': 'V',  # padding
+}
+_pep3118_standard_typechars = ''.join(_pep3118_standard_map.keys())
+
+_pep3118_unsupported_map = {
+    'u': 'UCS-2 strings',
+    '&': 'pointers',
+    't': 'bitfields',
+    'X': 'function pointers',
+}
+
+class _Stream:
+    def __init__(self, s):
+        self.s = s
+        self.byteorder = '@'
+
+    def advance(self, n):
+        res = self.s[:n]
+        self.s = self.s[n:]
+        return res
+
+    def consume(self, c):
+        if self.s[:len(c)] == c:
+            self.advance(len(c))
+            return True
+        return False
+
+    def consume_until(self, c):
+        if callable(c):
+            i = 0
+            while i < len(self.s) and not c(self.s[i]):
+                i = i + 1
+            return self.advance(i)
+        else:
+            i = self.s.index(c)
+            res = self.advance(i)
+            self.advance(len(c))
+            return res
+
+    @property
+    def next(self):
+        return self.s[0]
+
+    def __bool__(self):
+        return bool(self.s)
+
+
+def _dtype_from_pep3118(spec):
+    stream = _Stream(spec)
+    dtype, align = __dtype_from_pep3118(stream, is_subdtype=False)
+    return dtype
+
+def __dtype_from_pep3118(stream, is_subdtype):
+    field_spec = dict(
+        names=[],
+        formats=[],
+        offsets=[],
+        itemsize=0
+    )
+    offset = 0
+    common_alignment = 1
+    is_padding = False
+
+    # Parse spec
+    while stream:
+        value = None
+
+        # End of structure, bail out to upper level
+        if stream.consume('}'):
+            break
+
+        # Sub-arrays (1)
+        shape = None
+        if stream.consume('('):
+            shape = stream.consume_until(')')
+            shape = tuple(map(int, shape.split(',')))
+
+        # Byte order
+        if stream.next in ('@', '=', '<', '>', '^', '!'):
+            byteorder = stream.advance(1)
+            if byteorder == '!':
+                byteorder = '>'
+            stream.byteorder = byteorder
+
+        # Byte order characters also control native vs. standard type sizes
+        if stream.byteorder in ('@', '^'):
+            type_map = _pep3118_native_map
+            type_map_chars = _pep3118_native_typechars
+        else:
+            type_map = _pep3118_standard_map
+            type_map_chars = _pep3118_standard_typechars
+
+        # Item sizes
+        itemsize_str = stream.consume_until(lambda c: not c.isdigit())
+        if itemsize_str:
+            itemsize = int(itemsize_str)
+        else:
+            itemsize = 1
+
+        # Data types
+        is_padding = False
+
+        if stream.consume('T{'):
+            value, align = __dtype_from_pep3118(
+                stream, is_subdtype=True)
+        elif stream.next in type_map_chars:
+            if stream.next == 'Z':
+                typechar = stream.advance(2)
+            else:
+                typechar = stream.advance(1)
+
+            is_padding = (typechar == 'x')
+            dtypechar = type_map[typechar]
+            if dtypechar in 'USV':
+                dtypechar += '%d' % itemsize
+                itemsize = 1
+            numpy_byteorder = {'@': '=', '^': '='}.get(
+                stream.byteorder, stream.byteorder)
+            value = dtype(numpy_byteorder + dtypechar)
+            align = value.alignment
+        elif stream.next in _pep3118_unsupported_map:
+            desc = _pep3118_unsupported_map[stream.next]
+            raise NotImplementedError(
+                "Unrepresentable PEP 3118 data type {!r} ({})"
+                .format(stream.next, desc))
+        else:
+            raise ValueError("Unknown PEP 3118 data type specifier %r" % stream.s)
+
+        #
+        # Native alignment may require padding
+        #
+        # Here we assume that the presence of a '@' character implicitly implies
+        # that the start of the array is *already* aligned.
+        #
+        extra_offset = 0
+        if stream.byteorder == '@':
+            start_padding = (-offset) % align
+            intra_padding = (-value.itemsize) % align
+
+            offset += start_padding
+
+            if intra_padding != 0:
+                if itemsize > 1 or (shape is not None and _prod(shape) > 1):
+                    # Inject internal padding to the end of the sub-item
+                    value = _add_trailing_padding(value, intra_padding)
+                else:
+                    # We can postpone the injection of internal padding,
+                    # as the item appears at most once
+                    extra_offset += intra_padding
+
+            # Update common alignment
+            common_alignment = _lcm(align, common_alignment)
+
+        # Convert itemsize to sub-array
+        if itemsize != 1:
+            value = dtype((value, (itemsize,)))
+
+        # Sub-arrays (2)
+        if shape is not None:
+            value = dtype((value, shape))
+
+        # Field name
+        if stream.consume(':'):
+            name = stream.consume_until(':')
+        else:
+            name = None
+
+        if not (is_padding and name is None):
+            if name is not None and name in field_spec['names']:
+                raise RuntimeError("Duplicate field name '%s' in PEP3118 format"
+                                   % name)
+            field_spec['names'].append(name)
+            field_spec['formats'].append(value)
+            field_spec['offsets'].append(offset)
+
+        offset += value.itemsize
+        offset += extra_offset
+
+        field_spec['itemsize'] = offset
+
+    # extra final padding for aligned types
+    if stream.byteorder == '@':
+        field_spec['itemsize'] += (-offset) % common_alignment
+
+    # Check if this was a simple 1-item type, and unwrap it
+    if (field_spec['names'] == [None]
+            and field_spec['offsets'][0] == 0
+            and field_spec['itemsize'] == field_spec['formats'][0].itemsize
+            and not is_subdtype):
+        ret = field_spec['formats'][0]
+    else:
+        _fix_names(field_spec)
+        ret = dtype(field_spec)
+
+    # Finished
+    return ret, common_alignment
+
+def _fix_names(field_spec):
+    """ Replace names which are None with the next unused f%d name """
+    names = field_spec['names']
+    for i, name in enumerate(names):
+        if name is not None:
+            continue
+
+        j = 0
+        while True:
+            name = 'f{}'.format(j)
+            if name not in names:
+                break
+            j = j + 1
+        names[i] = name
+
+def _add_trailing_padding(value, padding):
+    """Inject the specified number of padding bytes at the end of a dtype"""
+    if value.fields is None:
+        field_spec = dict(
+            names=['f0'],
+            formats=[value],
+            offsets=[0],
+            itemsize=value.itemsize
+        )
+    else:
+        fields = value.fields
+        names = value.names
+        field_spec = dict(
+            names=names,
+            formats=[fields[name][0] for name in names],
+            offsets=[fields[name][1] for name in names],
+            itemsize=value.itemsize
+        )
+
+    field_spec['itemsize'] += padding
+    return dtype(field_spec)
+
+def _prod(a):
+    p = 1
+    for x in a:
+        p *= x
+    return p
+
+def _gcd(a, b):
+    """Calculate the greatest common divisor of a and b"""
+    while b:
+        a, b = b, a % b
+    return a
+
+def _lcm(a, b):
+    return a // _gcd(a, b) * b
+
+def array_ufunc_errmsg_formatter(dummy, ufunc, method, *inputs, **kwargs):
+    """ Format the error message for when __array_ufunc__ gives up. """
+    args_string = ', '.join(['{!r}'.format(arg) for arg in inputs] +
+                            ['{}={!r}'.format(k, v)
+                             for k, v in kwargs.items()])
+    args = inputs + kwargs.get('out', ())
+    types_string = ', '.join(repr(type(arg).__name__) for arg in args)
+    return ('operand type(s) all returned NotImplemented from '
+            '__array_ufunc__({!r}, {!r}, {}): {}'
+            .format(ufunc, method, args_string, types_string))
+
+
+def array_function_errmsg_formatter(public_api, types):
+    """ Format the error message for when __array_ufunc__ gives up. """
+    func_name = '{}.{}'.format(public_api.__module__, public_api.__name__)
+    return ("no implementation found for '{}' on types that implement "
+            '__array_function__: {}'.format(func_name, list(types)))
+
+
+def _ufunc_doc_signature_formatter(ufunc):
+    """
+    Builds a signature string which resembles PEP 457
+
+    This is used to construct the first line of the docstring
+    """
+
+    # input arguments are simple
+    if ufunc.nin == 1:
+        in_args = 'x'
+    else:
+        in_args = ', '.join('x{}'.format(i+1) for i in range(ufunc.nin))
+
+    # output arguments are both keyword or positional
+    if ufunc.nout == 0:
+        out_args = ', /, out=()'
+    elif ufunc.nout == 1:
+        out_args = ', /, out=None'
+    else:
+        out_args = '[, {positional}], / [, out={default}]'.format(
+            positional=', '.join(
+                'out{}'.format(i+1) for i in range(ufunc.nout)),
+            default=repr((None,)*ufunc.nout)
+        )
+
+    # keyword only args depend on whether this is a gufunc
+    kwargs = (
+        ", casting='same_kind'"
+        ", order='K'"
+        ", dtype=None"
+        ", subok=True"
+        "[, signature"
+        ", extobj]"
+    )
+    if ufunc.signature is None:
+        kwargs = ", where=True" + kwargs
+
+    # join all the parts together
+    return '{name}({in_args}{out_args}, *{kwargs})'.format(
+        name=ufunc.__name__,
+        in_args=in_args,
+        out_args=out_args,
+        kwargs=kwargs
+    )
+
+
+def npy_ctypes_check(cls):
+    # determine if a class comes from ctypes, in order to work around
+    # a bug in the buffer protocol for those objects, bpo-10746
+    try:
+        # ctypes class are new-style, so have an __mro__. This probably fails
+        # for ctypes classes with multiple inheritance.
+        if IS_PYPY:
+            # (..., _ctypes.basics._CData, Bufferable, object)
+            ctype_base = cls.__mro__[-3]
+        else:
+            # # (..., _ctypes._CData, object)
+            ctype_base = cls.__mro__[-2]
+        # right now, they're part of the _ctypes module
+        return '_ctypes' in ctype_base.__module__
+    except Exception:
+        return False
+
+
+class recursive:
+    '''
+    A decorator class for recursive nested functions.
+    Naive recursive nested functions hold a reference to themselves:
+
+    def outer(*args):
+        def stringify_leaky(arg0, *arg1):
+            if len(arg1) > 0:
+                return stringify_leaky(*arg1)  # <- HERE
+            return str(arg0)
+        stringify_leaky(*args)
+
+    This design pattern creates a reference cycle that is difficult for a
+    garbage collector to resolve. The decorator class prevents the
+    cycle by passing the nested function in as an argument `self`:
+
+    def outer(*args):
+        @recursive
+        def stringify(self, arg0, *arg1):
+            if len(arg1) > 0:
+                return self(*arg1)
+            return str(arg0)
+        stringify(*args)
+
+    '''
+    def __init__(self, func):
+        self.func = func
+    def __call__(self, *args, **kwargs):
+        return self.func(self, *args, **kwargs)
+
diff --git a/venv/Lib/site-packages/numpy/core/_methods.py b/venv/Lib/site-packages/numpy/core/_methods.py
new file mode 100644
index 000000000..86ddf4d17
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_methods.py
@@ -0,0 +1,261 @@
+"""
+Array methods which are called by both the C-code for the method
+and the Python code for the NumPy-namespace function
+
+"""
+import warnings
+
+from numpy.core import multiarray as mu
+from numpy.core import umath as um
+from numpy.core._asarray import asanyarray
+from numpy.core import numerictypes as nt
+from numpy.core import _exceptions
+from numpy._globals import _NoValue
+from numpy.compat import pickle, os_fspath, contextlib_nullcontext
+
+# save those O(100) nanoseconds!
+umr_maximum = um.maximum.reduce
+umr_minimum = um.minimum.reduce
+umr_sum = um.add.reduce
+umr_prod = um.multiply.reduce
+umr_any = um.logical_or.reduce
+umr_all = um.logical_and.reduce
+
+# Complex types to -> (2,)float view for fast-path computation in _var()
+_complex_to_float = {
+    nt.dtype(nt.csingle) : nt.dtype(nt.single),
+    nt.dtype(nt.cdouble) : nt.dtype(nt.double),
+}
+# Special case for windows: ensure double takes precedence
+if nt.dtype(nt.longdouble) != nt.dtype(nt.double):
+    _complex_to_float.update({
+        nt.dtype(nt.clongdouble) : nt.dtype(nt.longdouble),
+    })
+
+# avoid keyword arguments to speed up parsing, saves about 15%-20% for very
+# small reductions
+def _amax(a, axis=None, out=None, keepdims=False,
+          initial=_NoValue, where=True):
+    return umr_maximum(a, axis, None, out, keepdims, initial, where)
+
+def _amin(a, axis=None, out=None, keepdims=False,
+          initial=_NoValue, where=True):
+    return umr_minimum(a, axis, None, out, keepdims, initial, where)
+
+def _sum(a, axis=None, dtype=None, out=None, keepdims=False,
+         initial=_NoValue, where=True):
+    return umr_sum(a, axis, dtype, out, keepdims, initial, where)
+
+def _prod(a, axis=None, dtype=None, out=None, keepdims=False,
+          initial=_NoValue, where=True):
+    return umr_prod(a, axis, dtype, out, keepdims, initial, where)
+
+def _any(a, axis=None, dtype=None, out=None, keepdims=False):
+    return umr_any(a, axis, dtype, out, keepdims)
+
+def _all(a, axis=None, dtype=None, out=None, keepdims=False):
+    return umr_all(a, axis, dtype, out, keepdims)
+
+def _count_reduce_items(arr, axis):
+    if axis is None:
+        axis = tuple(range(arr.ndim))
+    if not isinstance(axis, tuple):
+        axis = (axis,)
+    items = 1
+    for ax in axis:
+        items *= arr.shape[mu.normalize_axis_index(ax, arr.ndim)]
+    return items
+
+# Numpy 1.17.0, 2019-02-24
+# Various clip behavior deprecations, marked with _clip_dep as a prefix.
+
+def _clip_dep_is_scalar_nan(a):
+    # guarded to protect circular imports
+    from numpy.core.fromnumeric import ndim
+    if ndim(a) != 0:
+        return False
+    try:
+        return um.isnan(a)
+    except TypeError:
+        return False
+
+def _clip_dep_is_byte_swapped(a):
+    if isinstance(a, mu.ndarray):
+        return not a.dtype.isnative
+    return False
+
+def _clip_dep_invoke_with_casting(ufunc, *args, out=None, casting=None, **kwargs):
+    # normal path
+    if casting is not None:
+        return ufunc(*args, out=out, casting=casting, **kwargs)
+
+    # try to deal with broken casting rules
+    try:
+        return ufunc(*args, out=out, **kwargs)
+    except _exceptions._UFuncOutputCastingError as e:
+        # Numpy 1.17.0, 2019-02-24
+        warnings.warn(
+            "Converting the output of clip from {!r} to {!r} is deprecated. "
+            "Pass `casting=\"unsafe\"` explicitly to silence this warning, or "
+            "correct the type of the variables.".format(e.from_, e.to),
+            DeprecationWarning,
+            stacklevel=2
+        )
+        return ufunc(*args, out=out, casting="unsafe", **kwargs)
+
+def _clip(a, min=None, max=None, out=None, *, casting=None, **kwargs):
+    if min is None and max is None:
+        raise ValueError("One of max or min must be given")
+
+    # Numpy 1.17.0, 2019-02-24
+    # This deprecation probably incurs a substantial slowdown for small arrays,
+    # it will be good to get rid of it.
+    if not _clip_dep_is_byte_swapped(a) and not _clip_dep_is_byte_swapped(out):
+        using_deprecated_nan = False
+        if _clip_dep_is_scalar_nan(min):
+            min = -float('inf')
+            using_deprecated_nan = True
+        if _clip_dep_is_scalar_nan(max):
+            max = float('inf')
+            using_deprecated_nan = True
+        if using_deprecated_nan:
+            warnings.warn(
+                "Passing `np.nan` to mean no clipping in np.clip has always "
+                "been unreliable, and is now deprecated. "
+                "In future, this will always return nan, like it already does "
+                "when min or max are arrays that contain nan. "
+                "To skip a bound, pass either None or an np.inf of an "
+                "appropriate sign.",
+                DeprecationWarning,
+                stacklevel=2
+            )
+
+    if min is None:
+        return _clip_dep_invoke_with_casting(
+            um.minimum, a, max, out=out, casting=casting, **kwargs)
+    elif max is None:
+        return _clip_dep_invoke_with_casting(
+            um.maximum, a, min, out=out, casting=casting, **kwargs)
+    else:
+        return _clip_dep_invoke_with_casting(
+            um.clip, a, min, max, out=out, casting=casting, **kwargs)
+
+def _mean(a, axis=None, dtype=None, out=None, keepdims=False):
+    arr = asanyarray(a)
+
+    is_float16_result = False
+    rcount = _count_reduce_items(arr, axis)
+    # Make this warning show up first
+    if rcount == 0:
+        warnings.warn("Mean of empty slice.", RuntimeWarning, stacklevel=2)
+
+    # Cast bool, unsigned int, and int to float64 by default
+    if dtype is None:
+        if issubclass(arr.dtype.type, (nt.integer, nt.bool_)):
+            dtype = mu.dtype('f8')
+        elif issubclass(arr.dtype.type, nt.float16):
+            dtype = mu.dtype('f4')
+            is_float16_result = True
+
+    ret = umr_sum(arr, axis, dtype, out, keepdims)
+    if isinstance(ret, mu.ndarray):
+        ret = um.true_divide(
+                ret, rcount, out=ret, casting='unsafe', subok=False)
+        if is_float16_result and out is None:
+            ret = arr.dtype.type(ret)
+    elif hasattr(ret, 'dtype'):
+        if is_float16_result:
+            ret = arr.dtype.type(ret / rcount)
+        else:
+            ret = ret.dtype.type(ret / rcount)
+    else:
+        ret = ret / rcount
+
+    return ret
+
+def _var(a, axis=None, dtype=None, out=None, ddof=0, keepdims=False):
+    arr = asanyarray(a)
+
+    rcount = _count_reduce_items(arr, axis)
+    # Make this warning show up on top.
+    if ddof >= rcount:
+        warnings.warn("Degrees of freedom <= 0 for slice", RuntimeWarning,
+                      stacklevel=2)
+
+    # Cast bool, unsigned int, and int to float64 by default
+    if dtype is None and issubclass(arr.dtype.type, (nt.integer, nt.bool_)):
+        dtype = mu.dtype('f8')
+
+    # Compute the mean.
+    # Note that if dtype is not of inexact type then arraymean will
+    # not be either.
+    arrmean = umr_sum(arr, axis, dtype, keepdims=True)
+    if isinstance(arrmean, mu.ndarray):
+        arrmean = um.true_divide(
+                arrmean, rcount, out=arrmean, casting='unsafe', subok=False)
+    else:
+        arrmean = arrmean.dtype.type(arrmean / rcount)
+
+    # Compute sum of squared deviations from mean
+    # Note that x may not be inexact and that we need it to be an array,
+    # not a scalar.
+    x = asanyarray(arr - arrmean)
+
+    if issubclass(arr.dtype.type, (nt.floating, nt.integer)):
+        x = um.multiply(x, x, out=x)
+    # Fast-paths for built-in complex types
+    elif x.dtype in _complex_to_float:
+        xv = x.view(dtype=(_complex_to_float[x.dtype], (2,)))
+        um.multiply(xv, xv, out=xv)
+        x = um.add(xv[..., 0], xv[..., 1], out=x.real).real
+    # Most general case; includes handling object arrays containing imaginary
+    # numbers and complex types with non-native byteorder
+    else:
+        x = um.multiply(x, um.conjugate(x), out=x).real
+
+    ret = umr_sum(x, axis, dtype, out, keepdims)
+
+    # Compute degrees of freedom and make sure it is not negative.
+    rcount = max([rcount - ddof, 0])
+
+    # divide by degrees of freedom
+    if isinstance(ret, mu.ndarray):
+        ret = um.true_divide(
+                ret, rcount, out=ret, casting='unsafe', subok=False)
+    elif hasattr(ret, 'dtype'):
+        ret = ret.dtype.type(ret / rcount)
+    else:
+        ret = ret / rcount
+
+    return ret
+
+def _std(a, axis=None, dtype=None, out=None, ddof=0, keepdims=False):
+    ret = _var(a, axis=axis, dtype=dtype, out=out, ddof=ddof,
+               keepdims=keepdims)
+
+    if isinstance(ret, mu.ndarray):
+        ret = um.sqrt(ret, out=ret)
+    elif hasattr(ret, 'dtype'):
+        ret = ret.dtype.type(um.sqrt(ret))
+    else:
+        ret = um.sqrt(ret)
+
+    return ret
+
+def _ptp(a, axis=None, out=None, keepdims=False):
+    return um.subtract(
+        umr_maximum(a, axis, None, out, keepdims),
+        umr_minimum(a, axis, None, None, keepdims),
+        out
+    )
+
+def _dump(self, file, protocol=2):
+    if hasattr(file, 'write'):
+        ctx = contextlib_nullcontext(file)
+    else:
+        ctx = open(os_fspath(file), "wb")
+    with ctx as f:
+        pickle.dump(self, f, protocol=protocol)
+
+def _dumps(self, protocol=2):
+    return pickle.dumps(self, protocol=protocol)
diff --git a/venv/Lib/site-packages/numpy/core/_multiarray_tests.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_multiarray_tests.cp36-win32.pyd
new file mode 100644
index 000000000..977f2fd77
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_multiarray_tests.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/_multiarray_umath.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_multiarray_umath.cp36-win32.pyd
new file mode 100644
index 000000000..ac53c3484
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_multiarray_umath.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/_operand_flag_tests.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_operand_flag_tests.cp36-win32.pyd
new file mode 100644
index 000000000..a88679c6c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_operand_flag_tests.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/_rational_tests.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_rational_tests.cp36-win32.pyd
new file mode 100644
index 000000000..dcef6a20e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_rational_tests.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/_string_helpers.py b/venv/Lib/site-packages/numpy/core/_string_helpers.py
new file mode 100644
index 000000000..45e6a739e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_string_helpers.py
@@ -0,0 +1,100 @@
+"""
+String-handling utilities to avoid locale-dependence.
+
+Used primarily to generate type name aliases.
+"""
+# "import string" is costly to import!
+# Construct the translation tables directly
+#   "A" = chr(65), "a" = chr(97)
+_all_chars = [chr(_m) for _m in range(256)]
+_ascii_upper = _all_chars[65:65+26]
+_ascii_lower = _all_chars[97:97+26]
+LOWER_TABLE = "".join(_all_chars[:65] + _ascii_lower + _all_chars[65+26:])
+UPPER_TABLE = "".join(_all_chars[:97] + _ascii_upper + _all_chars[97+26:])
+
+
+def english_lower(s):
+    """ Apply English case rules to convert ASCII strings to all lower case.
+
+    This is an internal utility function to replace calls to str.lower() such
+    that we can avoid changing behavior with changing locales. In particular,
+    Turkish has distinct dotted and dotless variants of the Latin letter "I" in
+    both lowercase and uppercase. Thus, "I".lower() != "i" in a "tr" locale.
+
+    Parameters
+    ----------
+    s : str
+
+    Returns
+    -------
+    lowered : str
+
+    Examples
+    --------
+    >>> from numpy.core.numerictypes import english_lower
+    >>> english_lower('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_')
+    'abcdefghijklmnopqrstuvwxyzabcdefghijklmnopqrstuvwxyz0123456789_'
+    >>> english_lower('')
+    ''
+    """
+    lowered = s.translate(LOWER_TABLE)
+    return lowered
+
+
+def english_upper(s):
+    """ Apply English case rules to convert ASCII strings to all upper case.
+
+    This is an internal utility function to replace calls to str.upper() such
+    that we can avoid changing behavior with changing locales. In particular,
+    Turkish has distinct dotted and dotless variants of the Latin letter "I" in
+    both lowercase and uppercase. Thus, "i".upper() != "I" in a "tr" locale.
+
+    Parameters
+    ----------
+    s : str
+
+    Returns
+    -------
+    uppered : str
+
+    Examples
+    --------
+    >>> from numpy.core.numerictypes import english_upper
+    >>> english_upper('ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789_')
+    'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789_'
+    >>> english_upper('')
+    ''
+    """
+    uppered = s.translate(UPPER_TABLE)
+    return uppered
+
+
+def english_capitalize(s):
+    """ Apply English case rules to convert the first character of an ASCII
+    string to upper case.
+
+    This is an internal utility function to replace calls to str.capitalize()
+    such that we can avoid changing behavior with changing locales.
+
+    Parameters
+    ----------
+    s : str
+
+    Returns
+    -------
+    capitalized : str
+
+    Examples
+    --------
+    >>> from numpy.core.numerictypes import english_capitalize
+    >>> english_capitalize('int8')
+    'Int8'
+    >>> english_capitalize('Int8')
+    'Int8'
+    >>> english_capitalize('')
+    ''
+    """
+    if s:
+        return english_upper(s[0]) + s[1:]
+    else:
+        return s
diff --git a/venv/Lib/site-packages/numpy/core/_struct_ufunc_tests.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_struct_ufunc_tests.cp36-win32.pyd
new file mode 100644
index 000000000..9e518422d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_struct_ufunc_tests.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/_type_aliases.py b/venv/Lib/site-packages/numpy/core/_type_aliases.py
new file mode 100644
index 000000000..c26431443
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_type_aliases.py
@@ -0,0 +1,272 @@
+"""
+Due to compatibility, numpy has a very large number of different naming
+conventions for the scalar types (those subclassing from `numpy.generic`).
+This file produces a convoluted set of dictionaries mapping names to types,
+and sometimes other mappings too.
+
+.. data:: allTypes
+    A dictionary of names to types that will be exposed as attributes through
+    ``np.core.numerictypes.*``
+
+.. data:: sctypeDict
+    Similar to `allTypes`, but maps a broader set of aliases to their types.
+
+.. data:: sctypeNA
+    NumArray-compatible names for the scalar types. Contains not only
+    ``name: type`` mappings, but ``char: name`` mappings too.
+
+    .. deprecated:: 1.16
+
+.. data:: sctypes
+    A dictionary keyed by a "type group" string, providing a list of types
+    under that group.
+
+"""
+import warnings
+
+from numpy.compat import unicode
+from numpy._globals import VisibleDeprecationWarning
+from numpy.core._string_helpers import english_lower, english_capitalize
+from numpy.core.multiarray import typeinfo, dtype
+from numpy.core._dtype import _kind_name
+
+
+sctypeDict = {}      # Contains all leaf-node scalar types with aliases
+class TypeNADict(dict):
+    def __getitem__(self, key):
+        # 2018-06-24, 1.16
+        warnings.warn('sctypeNA and typeNA will be removed in v1.18 '
+                      'of numpy', VisibleDeprecationWarning, stacklevel=2)
+        return dict.__getitem__(self, key)
+    def get(self, key, default=None):
+        # 2018-06-24, 1.16
+        warnings.warn('sctypeNA and typeNA will be removed in v1.18 '
+                      'of numpy', VisibleDeprecationWarning, stacklevel=2)
+        return dict.get(self, key, default)
+
+sctypeNA = TypeNADict()  # Contails all leaf-node types -> numarray type equivalences
+allTypes = {}            # Collect the types we will add to the module
+
+
+# separate the actual type info from the abstract base classes
+_abstract_types = {}
+_concrete_typeinfo = {}
+for k, v in typeinfo.items():
+    # make all the keys lowercase too
+    k = english_lower(k)
+    if isinstance(v, type):
+        _abstract_types[k] = v
+    else:
+        _concrete_typeinfo[k] = v
+
+_concrete_types = {v.type for k, v in _concrete_typeinfo.items()}
+
+
+def _bits_of(obj):
+    try:
+        info = next(v for v in _concrete_typeinfo.values() if v.type is obj)
+    except StopIteration:
+        if obj in _abstract_types.values():
+            raise ValueError("Cannot count the bits of an abstract type")
+
+        # some third-party type - make a best-guess
+        return dtype(obj).itemsize * 8
+    else:
+        return info.bits
+
+
+def bitname(obj):
+    """Return a bit-width name for a given type object"""
+    bits = _bits_of(obj)
+    dt = dtype(obj)
+    char = dt.kind
+    base = _kind_name(dt)
+
+    if base == 'object':
+        bits = 0
+
+    if bits != 0:
+        char = "%s%d" % (char, bits // 8)
+
+    return base, bits, char
+
+
+def _add_types():
+    for name, info in _concrete_typeinfo.items():
+        # define C-name and insert typenum and typechar references also
+        allTypes[name] = info.type
+        sctypeDict[name] = info.type
+        sctypeDict[info.char] = info.type
+        sctypeDict[info.num] = info.type
+
+    for name, cls in _abstract_types.items():
+        allTypes[name] = cls
+_add_types()
+
+# This is the priority order used to assign the bit-sized NPY_INTxx names, which
+# must match the order in npy_common.h in order for NPY_INTxx and np.intxx to be
+# consistent.
+# If two C types have the same size, then the earliest one in this list is used
+# as the sized name.
+_int_ctypes = ['long', 'longlong', 'int', 'short', 'byte']
+_uint_ctypes = list('u' + t for t in _int_ctypes)
+
+def _add_aliases():
+    for name, info in _concrete_typeinfo.items():
+        # these are handled by _add_integer_aliases
+        if name in _int_ctypes or name in _uint_ctypes:
+            continue
+
+        # insert bit-width version for this class (if relevant)
+        base, bit, char = bitname(info.type)
+
+        myname = "%s%d" % (base, bit)
+
+        # ensure that (c)longdouble does not overwrite the aliases assigned to
+        # (c)double
+        if name in ('longdouble', 'clongdouble') and myname in allTypes:
+            continue
+
+        base_capitalize = english_capitalize(base)
+        if base == 'complex':
+            na_name = '%s%d' % (base_capitalize, bit//2)
+        elif base == 'bool':
+            na_name = base_capitalize
+        else:
+            na_name = "%s%d" % (base_capitalize, bit)
+
+        allTypes[myname] = info.type
+
+        # add mapping for both the bit name and the numarray name
+        sctypeDict[myname] = info.type
+        sctypeDict[na_name] = info.type
+
+        # add forward, reverse, and string mapping to numarray
+        sctypeNA[na_name] = info.type
+        sctypeNA[info.type] = na_name
+        sctypeNA[info.char] = na_name
+
+        sctypeDict[char] = info.type
+        sctypeNA[char] = na_name
+_add_aliases()
+
+def _add_integer_aliases():
+    seen_bits = set()
+    for i_ctype, u_ctype in zip(_int_ctypes, _uint_ctypes):
+        i_info = _concrete_typeinfo[i_ctype]
+        u_info = _concrete_typeinfo[u_ctype]
+        bits = i_info.bits  # same for both
+
+        for info, charname, intname, Intname in [
+                (i_info,'i%d' % (bits//8,), 'int%d' % bits, 'Int%d' % bits),
+                (u_info,'u%d' % (bits//8,), 'uint%d' % bits, 'UInt%d' % bits)]:
+            if bits not in seen_bits:
+                # sometimes two different types have the same number of bits
+                # if so, the one iterated over first takes precedence
+                allTypes[intname] = info.type
+                sctypeDict[intname] = info.type
+                sctypeDict[Intname] = info.type
+                sctypeDict[charname] = info.type
+                sctypeNA[Intname] = info.type
+                sctypeNA[charname] = info.type
+            sctypeNA[info.type] = Intname
+            sctypeNA[info.char] = Intname
+
+        seen_bits.add(bits)
+
+_add_integer_aliases()
+
+# We use these later
+void = allTypes['void']
+
+#
+# Rework the Python names (so that float and complex and int are consistent
+#                            with Python usage)
+#
+def _set_up_aliases():
+    type_pairs = [('complex_', 'cdouble'),
+                  ('int0', 'intp'),
+                  ('uint0', 'uintp'),
+                  ('single', 'float'),
+                  ('csingle', 'cfloat'),
+                  ('singlecomplex', 'cfloat'),
+                  ('float_', 'double'),
+                  ('intc', 'int'),
+                  ('uintc', 'uint'),
+                  ('int_', 'long'),
+                  ('uint', 'ulong'),
+                  ('cfloat', 'cdouble'),
+                  ('longfloat', 'longdouble'),
+                  ('clongfloat', 'clongdouble'),
+                  ('longcomplex', 'clongdouble'),
+                  ('bool_', 'bool'),
+                  ('bytes_', 'string'),
+                  ('string_', 'string'),
+                  ('str_', 'unicode'),
+                  ('unicode_', 'unicode'),
+                  ('object_', 'object')]
+    for alias, t in type_pairs:
+        allTypes[alias] = allTypes[t]
+        sctypeDict[alias] = sctypeDict[t]
+    # Remove aliases overriding python types and modules
+    to_remove = ['ulong', 'object', 'int', 'float',
+                 'complex', 'bool', 'string', 'datetime', 'timedelta',
+                 'bytes', 'str']
+
+    for t in to_remove:
+        try:
+            del allTypes[t]
+            del sctypeDict[t]
+        except KeyError:
+            pass
+_set_up_aliases()
+
+
+sctypes = {'int': [],
+           'uint':[],
+           'float':[],
+           'complex':[],
+           'others':[bool, object, bytes, unicode, void]}
+
+def _add_array_type(typename, bits):
+    try:
+        t = allTypes['%s%d' % (typename, bits)]
+    except KeyError:
+        pass
+    else:
+        sctypes[typename].append(t)
+
+def _set_array_types():
+    ibytes = [1, 2, 4, 8, 16, 32, 64]
+    fbytes = [2, 4, 8, 10, 12, 16, 32, 64]
+    for bytes in ibytes:
+        bits = 8*bytes
+        _add_array_type('int', bits)
+        _add_array_type('uint', bits)
+    for bytes in fbytes:
+        bits = 8*bytes
+        _add_array_type('float', bits)
+        _add_array_type('complex', 2*bits)
+    _gi = dtype('p')
+    if _gi.type not in sctypes['int']:
+        indx = 0
+        sz = _gi.itemsize
+        _lst = sctypes['int']
+        while (indx < len(_lst) and sz >= _lst[indx](0).itemsize):
+            indx += 1
+        sctypes['int'].insert(indx, _gi.type)
+        sctypes['uint'].insert(indx, dtype('P').type)
+_set_array_types()
+
+
+# Add additional strings to the sctypeDict
+_toadd = ['int', 'float', 'complex', 'bool', 'object',
+          'str', 'bytes', ('a', 'bytes_')]
+
+for name in _toadd:
+    if isinstance(name, tuple):
+        sctypeDict[name[0]] = allTypes[name[1]]
+    else:
+        sctypeDict[name] = allTypes['%s_' % name]
+
+del _toadd, name
diff --git a/venv/Lib/site-packages/numpy/core/_ufunc_config.py b/venv/Lib/site-packages/numpy/core/_ufunc_config.py
new file mode 100644
index 000000000..454d911cf
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/_ufunc_config.py
@@ -0,0 +1,450 @@
+"""
+Functions for changing global ufunc configuration
+
+This provides helpers which wrap `umath.geterrobj` and `umath.seterrobj`
+"""
+import collections.abc
+import contextlib
+
+from .overrides import set_module
+from .umath import (
+    UFUNC_BUFSIZE_DEFAULT,
+    ERR_IGNORE, ERR_WARN, ERR_RAISE, ERR_CALL, ERR_PRINT, ERR_LOG, ERR_DEFAULT,
+    SHIFT_DIVIDEBYZERO, SHIFT_OVERFLOW, SHIFT_UNDERFLOW, SHIFT_INVALID,
+)
+from . import umath
+
+__all__ = [
+    "seterr", "geterr", "setbufsize", "getbufsize", "seterrcall", "geterrcall",
+    "errstate",
+]
+
+_errdict = {"ignore": ERR_IGNORE,
+            "warn": ERR_WARN,
+            "raise": ERR_RAISE,
+            "call": ERR_CALL,
+            "print": ERR_PRINT,
+            "log": ERR_LOG}
+
+_errdict_rev = {value: key for key, value in _errdict.items()}
+
+
+@set_module('numpy')
+def seterr(all=None, divide=None, over=None, under=None, invalid=None):
+    """
+    Set how floating-point errors are handled.
+
+    Note that operations on integer scalar types (such as `int16`) are
+    handled like floating point, and are affected by these settings.
+
+    Parameters
+    ----------
+    all : {'ignore', 'warn', 'raise', 'call', 'print', 'log'}, optional
+        Set treatment for all types of floating-point errors at once:
+
+        - ignore: Take no action when the exception occurs.
+        - warn: Print a `RuntimeWarning` (via the Python `warnings` module).
+        - raise: Raise a `FloatingPointError`.
+        - call: Call a function specified using the `seterrcall` function.
+        - print: Print a warning directly to ``stdout``.
+        - log: Record error in a Log object specified by `seterrcall`.
+
+        The default is not to change the current behavior.
+    divide : {'ignore', 'warn', 'raise', 'call', 'print', 'log'}, optional
+        Treatment for division by zero.
+    over : {'ignore', 'warn', 'raise', 'call', 'print', 'log'}, optional
+        Treatment for floating-point overflow.
+    under : {'ignore', 'warn', 'raise', 'call', 'print', 'log'}, optional
+        Treatment for floating-point underflow.
+    invalid : {'ignore', 'warn', 'raise', 'call', 'print', 'log'}, optional
+        Treatment for invalid floating-point operation.
+
+    Returns
+    -------
+    old_settings : dict
+        Dictionary containing the old settings.
+
+    See also
+    --------
+    seterrcall : Set a callback function for the 'call' mode.
+    geterr, geterrcall, errstate
+
+    Notes
+    -----
+    The floating-point exceptions are defined in the IEEE 754 standard [1]_:
+
+    - Division by zero: infinite result obtained from finite numbers.
+    - Overflow: result too large to be expressed.
+    - Underflow: result so close to zero that some precision
+      was lost.
+    - Invalid operation: result is not an expressible number, typically
+      indicates that a NaN was produced.
+
+    .. [1] https://en.wikipedia.org/wiki/IEEE_754
+
+    Examples
+    --------
+    >>> old_settings = np.seterr(all='ignore')  #seterr to known value
+    >>> np.seterr(over='raise')
+    {'divide': 'ignore', 'over': 'ignore', 'under': 'ignore', 'invalid': 'ignore'}
+    >>> np.seterr(**old_settings)  # reset to default
+    {'divide': 'ignore', 'over': 'raise', 'under': 'ignore', 'invalid': 'ignore'}
+
+    >>> np.int16(32000) * np.int16(3)
+    30464
+    >>> old_settings = np.seterr(all='warn', over='raise')
+    >>> np.int16(32000) * np.int16(3)
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+    FloatingPointError: overflow encountered in short_scalars
+
+    >>> from collections import OrderedDict
+    >>> old_settings = np.seterr(all='print')
+    >>> OrderedDict(np.geterr())
+    OrderedDict([('divide', 'print'), ('over', 'print'), ('under', 'print'), ('invalid', 'print')])
+    >>> np.int16(32000) * np.int16(3)
+    30464
+
+    """
+
+    pyvals = umath.geterrobj()
+    old = geterr()
+
+    if divide is None:
+        divide = all or old['divide']
+    if over is None:
+        over = all or old['over']
+    if under is None:
+        under = all or old['under']
+    if invalid is None:
+        invalid = all or old['invalid']
+
+    maskvalue = ((_errdict[divide] << SHIFT_DIVIDEBYZERO) +
+                 (_errdict[over] << SHIFT_OVERFLOW) +
+                 (_errdict[under] << SHIFT_UNDERFLOW) +
+                 (_errdict[invalid] << SHIFT_INVALID))
+
+    pyvals[1] = maskvalue
+    umath.seterrobj(pyvals)
+    return old
+
+
+@set_module('numpy')
+def geterr():
+    """
+    Get the current way of handling floating-point errors.
+
+    Returns
+    -------
+    res : dict
+        A dictionary with keys "divide", "over", "under", and "invalid",
+        whose values are from the strings "ignore", "print", "log", "warn",
+        "raise", and "call". The keys represent possible floating-point
+        exceptions, and the values define how these exceptions are handled.
+
+    See Also
+    --------
+    geterrcall, seterr, seterrcall
+
+    Notes
+    -----
+    For complete documentation of the types of floating-point exceptions and
+    treatment options, see `seterr`.
+
+    Examples
+    --------
+    >>> from collections import OrderedDict
+    >>> sorted(np.geterr().items())
+    [('divide', 'warn'), ('invalid', 'warn'), ('over', 'warn'), ('under', 'ignore')]
+    >>> np.arange(3.) / np.arange(3.)
+    array([nan,  1.,  1.])
+
+    >>> oldsettings = np.seterr(all='warn', over='raise')
+    >>> OrderedDict(sorted(np.geterr().items()))
+    OrderedDict([('divide', 'warn'), ('invalid', 'warn'), ('over', 'raise'), ('under', 'warn')])
+    >>> np.arange(3.) / np.arange(3.)
+    array([nan,  1.,  1.])
+
+    """
+    maskvalue = umath.geterrobj()[1]
+    mask = 7
+    res = {}
+    val = (maskvalue >> SHIFT_DIVIDEBYZERO) & mask
+    res['divide'] = _errdict_rev[val]
+    val = (maskvalue >> SHIFT_OVERFLOW) & mask
+    res['over'] = _errdict_rev[val]
+    val = (maskvalue >> SHIFT_UNDERFLOW) & mask
+    res['under'] = _errdict_rev[val]
+    val = (maskvalue >> SHIFT_INVALID) & mask
+    res['invalid'] = _errdict_rev[val]
+    return res
+
+
+@set_module('numpy')
+def setbufsize(size):
+    """
+    Set the size of the buffer used in ufuncs.
+
+    Parameters
+    ----------
+    size : int
+        Size of buffer.
+
+    """
+    if size > 10e6:
+        raise ValueError("Buffer size, %s, is too big." % size)
+    if size < 5:
+        raise ValueError("Buffer size, %s, is too small." % size)
+    if size % 16 != 0:
+        raise ValueError("Buffer size, %s, is not a multiple of 16." % size)
+
+    pyvals = umath.geterrobj()
+    old = getbufsize()
+    pyvals[0] = size
+    umath.seterrobj(pyvals)
+    return old
+
+
+@set_module('numpy')
+def getbufsize():
+    """
+    Return the size of the buffer used in ufuncs.
+
+    Returns
+    -------
+    getbufsize : int
+        Size of ufunc buffer in bytes.
+
+    """
+    return umath.geterrobj()[0]
+
+
+@set_module('numpy')
+def seterrcall(func):
+    """
+    Set the floating-point error callback function or log object.
+
+    There are two ways to capture floating-point error messages.  The first
+    is to set the error-handler to 'call', using `seterr`.  Then, set
+    the function to call using this function.
+
+    The second is to set the error-handler to 'log', using `seterr`.
+    Floating-point errors then trigger a call to the 'write' method of
+    the provided object.
+
+    Parameters
+    ----------
+    func : callable f(err, flag) or object with write method
+        Function to call upon floating-point errors ('call'-mode) or
+        object whose 'write' method is used to log such message ('log'-mode).
+
+        The call function takes two arguments. The first is a string describing
+        the type of error (such as "divide by zero", "overflow", "underflow",
+        or "invalid value"), and the second is the status flag.  The flag is a
+        byte, whose four least-significant bits indicate the type of error, one
+        of "divide", "over", "under", "invalid"::
+
+          [0 0 0 0 divide over under invalid]
+
+        In other words, ``flags = divide + 2*over + 4*under + 8*invalid``.
+
+        If an object is provided, its write method should take one argument,
+        a string.
+
+    Returns
+    -------
+    h : callable, log instance or None
+        The old error handler.
+
+    See Also
+    --------
+    seterr, geterr, geterrcall
+
+    Examples
+    --------
+    Callback upon error:
+
+    >>> def err_handler(type, flag):
+    ...     print("Floating point error (%s), with flag %s" % (type, flag))
+    ...
+
+    >>> saved_handler = np.seterrcall(err_handler)
+    >>> save_err = np.seterr(all='call')
+    >>> from collections import OrderedDict
+
+    >>> np.array([1, 2, 3]) / 0.0
+    Floating point error (divide by zero), with flag 1
+    array([inf, inf, inf])
+
+    >>> np.seterrcall(saved_handler)
+    <function err_handler at 0x...>
+    >>> OrderedDict(sorted(np.seterr(**save_err).items()))
+    OrderedDict([('divide', 'call'), ('invalid', 'call'), ('over', 'call'), ('under', 'call')])
+
+    Log error message:
+
+    >>> class Log:
+    ...     def write(self, msg):
+    ...         print("LOG: %s" % msg)
+    ...
+
+    >>> log = Log()
+    >>> saved_handler = np.seterrcall(log)
+    >>> save_err = np.seterr(all='log')
+
+    >>> np.array([1, 2, 3]) / 0.0
+    LOG: Warning: divide by zero encountered in true_divide
+    array([inf, inf, inf])
+
+    >>> np.seterrcall(saved_handler)
+    <numpy.core.numeric.Log object at 0x...>
+    >>> OrderedDict(sorted(np.seterr(**save_err).items()))
+    OrderedDict([('divide', 'log'), ('invalid', 'log'), ('over', 'log'), ('under', 'log')])
+
+    """
+    if func is not None and not isinstance(func, collections.abc.Callable):
+        if (not hasattr(func, 'write') or
+                not isinstance(func.write, collections.abc.Callable)):
+            raise ValueError("Only callable can be used as callback")
+    pyvals = umath.geterrobj()
+    old = geterrcall()
+    pyvals[2] = func
+    umath.seterrobj(pyvals)
+    return old
+
+
+@set_module('numpy')
+def geterrcall():
+    """
+    Return the current callback function used on floating-point errors.
+
+    When the error handling for a floating-point error (one of "divide",
+    "over", "under", or "invalid") is set to 'call' or 'log', the function
+    that is called or the log instance that is written to is returned by
+    `geterrcall`. This function or log instance has been set with
+    `seterrcall`.
+
+    Returns
+    -------
+    errobj : callable, log instance or None
+        The current error handler. If no handler was set through `seterrcall`,
+        ``None`` is returned.
+
+    See Also
+    --------
+    seterrcall, seterr, geterr
+
+    Notes
+    -----
+    For complete documentation of the types of floating-point exceptions and
+    treatment options, see `seterr`.
+
+    Examples
+    --------
+    >>> np.geterrcall()  # we did not yet set a handler, returns None
+
+    >>> oldsettings = np.seterr(all='call')
+    >>> def err_handler(type, flag):
+    ...     print("Floating point error (%s), with flag %s" % (type, flag))
+    >>> oldhandler = np.seterrcall(err_handler)
+    >>> np.array([1, 2, 3]) / 0.0
+    Floating point error (divide by zero), with flag 1
+    array([inf, inf, inf])
+
+    >>> cur_handler = np.geterrcall()
+    >>> cur_handler is err_handler
+    True
+
+    """
+    return umath.geterrobj()[2]
+
+
+class _unspecified:
+    pass
+
+
+_Unspecified = _unspecified()
+
+
+@set_module('numpy')
+class errstate(contextlib.ContextDecorator):
+    """
+    errstate(**kwargs)
+
+    Context manager for floating-point error handling.
+
+    Using an instance of `errstate` as a context manager allows statements in
+    that context to execute with a known error handling behavior. Upon entering
+    the context the error handling is set with `seterr` and `seterrcall`, and
+    upon exiting it is reset to what it was before.
+
+    ..  versionchanged:: 1.17.0
+        `errstate` is also usable as a function decorator, saving
+        a level of indentation if an entire function is wrapped.
+        See :py:class:`contextlib.ContextDecorator` for more information.
+
+    Parameters
+    ----------
+    kwargs : {divide, over, under, invalid}
+        Keyword arguments. The valid keywords are the possible floating-point
+        exceptions. Each keyword should have a string value that defines the
+        treatment for the particular error. Possible values are
+        {'ignore', 'warn', 'raise', 'call', 'print', 'log'}.
+
+    See Also
+    --------
+    seterr, geterr, seterrcall, geterrcall
+
+    Notes
+    -----
+    For complete documentation of the types of floating-point exceptions and
+    treatment options, see `seterr`.
+
+    Examples
+    --------
+    >>> from collections import OrderedDict
+    >>> olderr = np.seterr(all='ignore')  # Set error handling to known state.
+
+    >>> np.arange(3) / 0.
+    array([nan, inf, inf])
+    >>> with np.errstate(divide='warn'):
+    ...     np.arange(3) / 0.
+    array([nan, inf, inf])
+
+    >>> np.sqrt(-1)
+    nan
+    >>> with np.errstate(invalid='raise'):
+    ...     np.sqrt(-1)
+    Traceback (most recent call last):
+      File "<stdin>", line 2, in <module>
+    FloatingPointError: invalid value encountered in sqrt
+
+    Outside the context the error handling behavior has not changed:
+
+    >>> OrderedDict(sorted(np.geterr().items()))
+    OrderedDict([('divide', 'ignore'), ('invalid', 'ignore'), ('over', 'ignore'), ('under', 'ignore')])
+
+    """
+
+    def __init__(self, *, call=_Unspecified, **kwargs):
+        self.call = call
+        self.kwargs = kwargs
+
+    def __enter__(self):
+        self.oldstate = seterr(**self.kwargs)
+        if self.call is not _Unspecified:
+            self.oldcall = seterrcall(self.call)
+
+    def __exit__(self, *exc_info):
+        seterr(**self.oldstate)
+        if self.call is not _Unspecified:
+            seterrcall(self.oldcall)
+
+
+def _setdef():
+    defval = [UFUNC_BUFSIZE_DEFAULT, ERR_DEFAULT, None]
+    umath.seterrobj(defval)
+
+
+# set the default values
+_setdef()
diff --git a/venv/Lib/site-packages/numpy/core/_umath_tests.cp36-win32.pyd b/venv/Lib/site-packages/numpy/core/_umath_tests.cp36-win32.pyd
new file mode 100644
index 000000000..63520ce63
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/_umath_tests.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/core/arrayprint.py b/venv/Lib/site-packages/numpy/core/arrayprint.py
new file mode 100644
index 000000000..456ef76f0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/arrayprint.py
@@ -0,0 +1,1606 @@
+"""Array printing function
+
+$Id: arrayprint.py,v 1.9 2005/09/13 13:58:44 teoliphant Exp $
+
+"""
+__all__ = ["array2string", "array_str", "array_repr", "set_string_function",
+           "set_printoptions", "get_printoptions", "printoptions",
+           "format_float_positional", "format_float_scientific"]
+__docformat__ = 'restructuredtext'
+
+#
+# Written by Konrad Hinsen <hinsenk@ere.umontreal.ca>
+# last revision: 1996-3-13
+# modified by Jim Hugunin 1997-3-3 for repr's and str's (and other details)
+# and by Perry Greenfield 2000-4-1 for numarray
+# and by Travis Oliphant  2005-8-22 for numpy
+
+
+# Note: Both scalartypes.c.src and arrayprint.py implement strs for numpy
+# scalars but for different purposes. scalartypes.c.src has str/reprs for when
+# the scalar is printed on its own, while arrayprint.py has strs for when
+# scalars are printed inside an ndarray. Only the latter strs are currently
+# user-customizable.
+
+import functools
+import numbers
+try:
+    from _thread import get_ident
+except ImportError:
+    from _dummy_thread import get_ident
+
+import numpy as np
+from . import numerictypes as _nt
+from .umath import absolute, isinf, isfinite, isnat
+from . import multiarray
+from .multiarray import (array, dragon4_positional, dragon4_scientific,
+                         datetime_as_string, datetime_data, ndarray,
+                         set_legacy_print_mode)
+from .fromnumeric import any
+from .numeric import concatenate, asarray, errstate
+from .numerictypes import (longlong, intc, int_, float_, complex_, bool_,
+                           flexible)
+from .overrides import array_function_dispatch, set_module
+import warnings
+import contextlib
+
+_format_options = {
+    'edgeitems': 3,  # repr N leading and trailing items of each dimension
+    'threshold': 1000,  # total items > triggers array summarization
+    'floatmode': 'maxprec',
+    'precision': 8,  # precision of floating point representations
+    'suppress': False,  # suppress printing small floating values in exp format
+    'linewidth': 75,
+    'nanstr': 'nan',
+    'infstr': 'inf',
+    'sign': '-',
+    'formatter': None,
+    'legacy': False}
+
+def _make_options_dict(precision=None, threshold=None, edgeitems=None,
+                       linewidth=None, suppress=None, nanstr=None, infstr=None,
+                       sign=None, formatter=None, floatmode=None, legacy=None):
+    """ make a dictionary out of the non-None arguments, plus sanity checks """
+
+    options = {k: v for k, v in locals().items() if v is not None}
+
+    if suppress is not None:
+        options['suppress'] = bool(suppress)
+
+    modes = ['fixed', 'unique', 'maxprec', 'maxprec_equal']
+    if floatmode not in modes + [None]:
+        raise ValueError("floatmode option must be one of " +
+                         ", ".join('"{}"'.format(m) for m in modes))
+
+    if sign not in [None, '-', '+', ' ']:
+        raise ValueError("sign option must be one of ' ', '+', or '-'")
+
+    if legacy not in [None, False, '1.13']:
+        warnings.warn("legacy printing option can currently only be '1.13' or "
+                      "`False`", stacklevel=3)
+    if threshold is not None:
+        # forbid the bad threshold arg suggested by stack overflow, gh-12351
+        if not isinstance(threshold, numbers.Number):
+            raise TypeError("threshold must be numeric")
+        if np.isnan(threshold):
+            raise ValueError("threshold must be non-NAN, try "
+                             "sys.maxsize for untruncated representation")
+    return options
+
+
+@set_module('numpy')
+def set_printoptions(precision=None, threshold=None, edgeitems=None,
+                     linewidth=None, suppress=None, nanstr=None, infstr=None,
+                     formatter=None, sign=None, floatmode=None, *, legacy=None):
+    """
+    Set printing options.
+
+    These options determine the way floating point numbers, arrays and
+    other NumPy objects are displayed.
+
+    Parameters
+    ----------
+    precision : int or None, optional
+        Number of digits of precision for floating point output (default 8).
+        May be None if `floatmode` is not `fixed`, to print as many digits as
+        necessary to uniquely specify the value.
+    threshold : int, optional
+        Total number of array elements which trigger summarization
+        rather than full repr (default 1000).
+        To always use the full repr without summarization, pass `sys.maxsize`.
+    edgeitems : int, optional
+        Number of array items in summary at beginning and end of
+        each dimension (default 3).
+    linewidth : int, optional
+        The number of characters per line for the purpose of inserting
+        line breaks (default 75).
+    suppress : bool, optional
+        If True, always print floating point numbers using fixed point
+        notation, in which case numbers equal to zero in the current precision
+        will print as zero.  If False, then scientific notation is used when
+        absolute value of the smallest number is < 1e-4 or the ratio of the
+        maximum absolute value to the minimum is > 1e3. The default is False.
+    nanstr : str, optional
+        String representation of floating point not-a-number (default nan).
+    infstr : str, optional
+        String representation of floating point infinity (default inf).
+    sign : string, either '-', '+', or ' ', optional
+        Controls printing of the sign of floating-point types. If '+', always
+        print the sign of positive values. If ' ', always prints a space
+        (whitespace character) in the sign position of positive values.  If
+        '-', omit the sign character of positive values. (default '-')
+    formatter : dict of callables, optional
+        If not None, the keys should indicate the type(s) that the respective
+        formatting function applies to.  Callables should return a string.
+        Types that are not specified (by their corresponding keys) are handled
+        by the default formatters.  Individual types for which a formatter
+        can be set are:
+
+        - 'bool'
+        - 'int'
+        - 'timedelta' : a `numpy.timedelta64`
+        - 'datetime' : a `numpy.datetime64`
+        - 'float'
+        - 'longfloat' : 128-bit floats
+        - 'complexfloat'
+        - 'longcomplexfloat' : composed of two 128-bit floats
+        - 'numpystr' : types `numpy.string_` and `numpy.unicode_`
+        - 'object' : `np.object_` arrays
+        - 'str' : all other strings
+
+        Other keys that can be used to set a group of types at once are:
+
+        - 'all' : sets all types
+        - 'int_kind' : sets 'int'
+        - 'float_kind' : sets 'float' and 'longfloat'
+        - 'complex_kind' : sets 'complexfloat' and 'longcomplexfloat'
+        - 'str_kind' : sets 'str' and 'numpystr'
+    floatmode : str, optional
+        Controls the interpretation of the `precision` option for
+        floating-point types. Can take the following values
+        (default maxprec_equal):
+
+        * 'fixed': Always print exactly `precision` fractional digits,
+                even if this would print more or fewer digits than
+                necessary to specify the value uniquely.
+        * 'unique': Print the minimum number of fractional digits necessary
+                to represent each value uniquely. Different elements may
+                have a different number of digits. The value of the
+                `precision` option is ignored.
+        * 'maxprec': Print at most `precision` fractional digits, but if
+                an element can be uniquely represented with fewer digits
+                only print it with that many.
+        * 'maxprec_equal': Print at most `precision` fractional digits,
+                but if every element in the array can be uniquely
+                represented with an equal number of fewer digits, use that
+                many digits for all elements.
+    legacy : string or `False`, optional
+        If set to the string `'1.13'` enables 1.13 legacy printing mode. This
+        approximates numpy 1.13 print output by including a space in the sign
+        position of floats and different behavior for 0d arrays. If set to
+        `False`, disables legacy mode. Unrecognized strings will be ignored
+        with a warning for forward compatibility.
+
+        .. versionadded:: 1.14.0
+
+    See Also
+    --------
+    get_printoptions, printoptions, set_string_function, array2string
+
+    Notes
+    -----
+    `formatter` is always reset with a call to `set_printoptions`.
+
+    Use `printoptions` as a context manager to set the values temporarily.
+
+    Examples
+    --------
+    Floating point precision can be set:
+
+    >>> np.set_printoptions(precision=4)
+    >>> np.array([1.123456789])
+    [1.1235]
+
+    Long arrays can be summarised:
+
+    >>> np.set_printoptions(threshold=5)
+    >>> np.arange(10)
+    array([0, 1, 2, ..., 7, 8, 9])
+
+    Small results can be suppressed:
+
+    >>> eps = np.finfo(float).eps
+    >>> x = np.arange(4.)
+    >>> x**2 - (x + eps)**2
+    array([-4.9304e-32, -4.4409e-16,  0.0000e+00,  0.0000e+00])
+    >>> np.set_printoptions(suppress=True)
+    >>> x**2 - (x + eps)**2
+    array([-0., -0.,  0.,  0.])
+
+    A custom formatter can be used to display array elements as desired:
+
+    >>> np.set_printoptions(formatter={'all':lambda x: 'int: '+str(-x)})
+    >>> x = np.arange(3)
+    >>> x
+    array([int: 0, int: -1, int: -2])
+    >>> np.set_printoptions()  # formatter gets reset
+    >>> x
+    array([0, 1, 2])
+
+    To put back the default options, you can use:
+
+    >>> np.set_printoptions(edgeitems=3, infstr='inf',
+    ... linewidth=75, nanstr='nan', precision=8,
+    ... suppress=False, threshold=1000, formatter=None)
+
+    Also to temporarily override options, use `printoptions` as a context manager:
+
+    >>> with np.printoptions(precision=2, suppress=True, threshold=5):
+    ...     np.linspace(0, 10, 10)
+    array([ 0.  ,  1.11,  2.22, ...,  7.78,  8.89, 10.  ])
+
+    """
+    opt = _make_options_dict(precision, threshold, edgeitems, linewidth,
+                             suppress, nanstr, infstr, sign, formatter,
+                             floatmode, legacy)
+    # formatter is always reset
+    opt['formatter'] = formatter
+    _format_options.update(opt)
+
+    # set the C variable for legacy mode
+    if _format_options['legacy'] == '1.13':
+        set_legacy_print_mode(113)
+        # reset the sign option in legacy mode to avoid confusion
+        _format_options['sign'] = '-'
+    elif _format_options['legacy'] is False:
+        set_legacy_print_mode(0)
+
+
+@set_module('numpy')
+def get_printoptions():
+    """
+    Return the current print options.
+
+    Returns
+    -------
+    print_opts : dict
+        Dictionary of current print options with keys
+
+          - precision : int
+          - threshold : int
+          - edgeitems : int
+          - linewidth : int
+          - suppress : bool
+          - nanstr : str
+          - infstr : str
+          - formatter : dict of callables
+          - sign : str
+
+        For a full description of these options, see `set_printoptions`.
+
+    See Also
+    --------
+    set_printoptions, printoptions, set_string_function
+
+    """
+    return _format_options.copy()
+
+
+@set_module('numpy')
+@contextlib.contextmanager
+def printoptions(*args, **kwargs):
+    """Context manager for setting print options.
+
+    Set print options for the scope of the `with` block, and restore the old
+    options at the end. See `set_printoptions` for the full description of
+    available options.
+
+    Examples
+    --------
+
+    >>> from numpy.testing import assert_equal
+    >>> with np.printoptions(precision=2):
+    ...     np.array([2.0]) / 3
+    array([0.67])
+
+    The `as`-clause of the `with`-statement gives the current print options:
+
+    >>> with np.printoptions(precision=2) as opts:
+    ...      assert_equal(opts, np.get_printoptions())
+
+    See Also
+    --------
+    set_printoptions, get_printoptions
+
+    """
+    opts = np.get_printoptions()
+    try:
+        np.set_printoptions(*args, **kwargs)
+        yield np.get_printoptions()
+    finally:
+        np.set_printoptions(**opts)
+
+
+def _leading_trailing(a, edgeitems, index=()):
+    """
+    Keep only the N-D corners (leading and trailing edges) of an array.
+
+    Should be passed a base-class ndarray, since it makes no guarantees about
+    preserving subclasses.
+    """
+    axis = len(index)
+    if axis == a.ndim:
+        return a[index]
+
+    if a.shape[axis] > 2*edgeitems:
+        return concatenate((
+            _leading_trailing(a, edgeitems, index + np.index_exp[ :edgeitems]),
+            _leading_trailing(a, edgeitems, index + np.index_exp[-edgeitems:])
+        ), axis=axis)
+    else:
+        return _leading_trailing(a, edgeitems, index + np.index_exp[:])
+
+
+def _object_format(o):
+    """ Object arrays containing lists should be printed unambiguously """
+    if type(o) is list:
+        fmt = 'list({!r})'
+    else:
+        fmt = '{!r}'
+    return fmt.format(o)
+
+def repr_format(x):
+    return repr(x)
+
+def str_format(x):
+    return str(x)
+
+def _get_formatdict(data, *, precision, floatmode, suppress, sign, legacy,
+                    formatter, **kwargs):
+    # note: extra arguments in kwargs are ignored
+
+    # wrapped in lambdas to avoid taking a code path with the wrong type of data
+    formatdict = {
+        'bool': lambda: BoolFormat(data),
+        'int': lambda: IntegerFormat(data),
+        'float': lambda: FloatingFormat(
+            data, precision, floatmode, suppress, sign, legacy=legacy),
+        'longfloat': lambda: FloatingFormat(
+            data, precision, floatmode, suppress, sign, legacy=legacy),
+        'complexfloat': lambda: ComplexFloatingFormat(
+            data, precision, floatmode, suppress, sign, legacy=legacy),
+        'longcomplexfloat': lambda: ComplexFloatingFormat(
+            data, precision, floatmode, suppress, sign, legacy=legacy),
+        'datetime': lambda: DatetimeFormat(data, legacy=legacy),
+        'timedelta': lambda: TimedeltaFormat(data),
+        'object': lambda: _object_format,
+        'void': lambda: str_format,
+        'numpystr': lambda: repr_format,
+        'str': lambda: str}
+
+    # we need to wrap values in `formatter` in a lambda, so that the interface
+    # is the same as the above values.
+    def indirect(x):
+        return lambda: x
+
+    if formatter is not None:
+        fkeys = [k for k in formatter.keys() if formatter[k] is not None]
+        if 'all' in fkeys:
+            for key in formatdict.keys():
+                formatdict[key] = indirect(formatter['all'])
+        if 'int_kind' in fkeys:
+            for key in ['int']:
+                formatdict[key] = indirect(formatter['int_kind'])
+        if 'float_kind' in fkeys:
+            for key in ['float', 'longfloat']:
+                formatdict[key] = indirect(formatter['float_kind'])
+        if 'complex_kind' in fkeys:
+            for key in ['complexfloat', 'longcomplexfloat']:
+                formatdict[key] = indirect(formatter['complex_kind'])
+        if 'str_kind' in fkeys:
+            for key in ['numpystr', 'str']:
+                formatdict[key] = indirect(formatter['str_kind'])
+        for key in formatdict.keys():
+            if key in fkeys:
+                formatdict[key] = indirect(formatter[key])
+
+    return formatdict
+
+def _get_format_function(data, **options):
+    """
+    find the right formatting function for the dtype_
+    """
+    dtype_ = data.dtype
+    dtypeobj = dtype_.type
+    formatdict = _get_formatdict(data, **options)
+    if issubclass(dtypeobj, _nt.bool_):
+        return formatdict['bool']()
+    elif issubclass(dtypeobj, _nt.integer):
+        if issubclass(dtypeobj, _nt.timedelta64):
+            return formatdict['timedelta']()
+        else:
+            return formatdict['int']()
+    elif issubclass(dtypeobj, _nt.floating):
+        if issubclass(dtypeobj, _nt.longfloat):
+            return formatdict['longfloat']()
+        else:
+            return formatdict['float']()
+    elif issubclass(dtypeobj, _nt.complexfloating):
+        if issubclass(dtypeobj, _nt.clongfloat):
+            return formatdict['longcomplexfloat']()
+        else:
+            return formatdict['complexfloat']()
+    elif issubclass(dtypeobj, (_nt.unicode_, _nt.string_)):
+        return formatdict['numpystr']()
+    elif issubclass(dtypeobj, _nt.datetime64):
+        return formatdict['datetime']()
+    elif issubclass(dtypeobj, _nt.object_):
+        return formatdict['object']()
+    elif issubclass(dtypeobj, _nt.void):
+        if dtype_.names is not None:
+            return StructuredVoidFormat.from_data(data, **options)
+        else:
+            return formatdict['void']()
+    else:
+        return formatdict['numpystr']()
+
+
+def _recursive_guard(fillvalue='...'):
+    """
+    Like the python 3.2 reprlib.recursive_repr, but forwards *args and **kwargs
+
+    Decorates a function such that if it calls itself with the same first
+    argument, it returns `fillvalue` instead of recursing.
+
+    Largely copied from reprlib.recursive_repr
+    """
+
+    def decorating_function(f):
+        repr_running = set()
+
+        @functools.wraps(f)
+        def wrapper(self, *args, **kwargs):
+            key = id(self), get_ident()
+            if key in repr_running:
+                return fillvalue
+            repr_running.add(key)
+            try:
+                return f(self, *args, **kwargs)
+            finally:
+                repr_running.discard(key)
+
+        return wrapper
+
+    return decorating_function
+
+
+# gracefully handle recursive calls, when object arrays contain themselves
+@_recursive_guard()
+def _array2string(a, options, separator=' ', prefix=""):
+    # The formatter __init__s in _get_format_function cannot deal with
+    # subclasses yet, and we also need to avoid recursion issues in
+    # _formatArray with subclasses which return 0d arrays in place of scalars
+    data = asarray(a)
+    if a.shape == ():
+        a = data
+
+    if a.size > options['threshold']:
+        summary_insert = "..."
+        data = _leading_trailing(data, options['edgeitems'])
+    else:
+        summary_insert = ""
+
+    # find the right formatting function for the array
+    format_function = _get_format_function(data, **options)
+
+    # skip over "["
+    next_line_prefix = " "
+    # skip over array(
+    next_line_prefix += " "*len(prefix)
+
+    lst = _formatArray(a, format_function, options['linewidth'],
+                       next_line_prefix, separator, options['edgeitems'],
+                       summary_insert, options['legacy'])
+    return lst
+
+
+def _array2string_dispatcher(
+        a, max_line_width=None, precision=None,
+        suppress_small=None, separator=None, prefix=None,
+        style=None, formatter=None, threshold=None,
+        edgeitems=None, sign=None, floatmode=None, suffix=None,
+        *, legacy=None):
+    return (a,)
+
+
+@array_function_dispatch(_array2string_dispatcher, module='numpy')
+def array2string(a, max_line_width=None, precision=None,
+                 suppress_small=None, separator=' ', prefix="",
+                 style=np._NoValue, formatter=None, threshold=None,
+                 edgeitems=None, sign=None, floatmode=None, suffix="",
+                 *, legacy=None):
+    """
+    Return a string representation of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    max_line_width : int, optional
+        Inserts newlines if text is longer than `max_line_width`.
+        Defaults to ``numpy.get_printoptions()['linewidth']``.
+    precision : int or None, optional
+        Floating point precision.
+        Defaults to ``numpy.get_printoptions()['precision']``.
+    suppress_small : bool, optional
+        Represent numbers "very close" to zero as zero; default is False.
+        Very close is defined by precision: if the precision is 8, e.g.,
+        numbers smaller (in absolute value) than 5e-9 are represented as
+        zero.
+        Defaults to ``numpy.get_printoptions()['suppress']``.
+    separator : str, optional
+        Inserted between elements.
+    prefix : str, optional
+    suffix: str, optional
+        The length of the prefix and suffix strings are used to respectively
+        align and wrap the output. An array is typically printed as::
+
+          prefix + array2string(a) + suffix
+
+        The output is left-padded by the length of the prefix string, and
+        wrapping is forced at the column ``max_line_width - len(suffix)``.
+        It should be noted that the content of prefix and suffix strings are
+        not included in the output.
+    style : _NoValue, optional
+        Has no effect, do not use.
+
+        .. deprecated:: 1.14.0
+    formatter : dict of callables, optional
+        If not None, the keys should indicate the type(s) that the respective
+        formatting function applies to.  Callables should return a string.
+        Types that are not specified (by their corresponding keys) are handled
+        by the default formatters.  Individual types for which a formatter
+        can be set are:
+
+        - 'bool'
+        - 'int'
+        - 'timedelta' : a `numpy.timedelta64`
+        - 'datetime' : a `numpy.datetime64`
+        - 'float'
+        - 'longfloat' : 128-bit floats
+        - 'complexfloat'
+        - 'longcomplexfloat' : composed of two 128-bit floats
+        - 'void' : type `numpy.void`
+        - 'numpystr' : types `numpy.string_` and `numpy.unicode_`
+        - 'str' : all other strings
+
+        Other keys that can be used to set a group of types at once are:
+
+        - 'all' : sets all types
+        - 'int_kind' : sets 'int'
+        - 'float_kind' : sets 'float' and 'longfloat'
+        - 'complex_kind' : sets 'complexfloat' and 'longcomplexfloat'
+        - 'str_kind' : sets 'str' and 'numpystr'
+    threshold : int, optional
+        Total number of array elements which trigger summarization
+        rather than full repr.
+        Defaults to ``numpy.get_printoptions()['threshold']``.
+    edgeitems : int, optional
+        Number of array items in summary at beginning and end of
+        each dimension.
+        Defaults to ``numpy.get_printoptions()['edgeitems']``.
+    sign : string, either '-', '+', or ' ', optional
+        Controls printing of the sign of floating-point types. If '+', always
+        print the sign of positive values. If ' ', always prints a space
+        (whitespace character) in the sign position of positive values.  If
+        '-', omit the sign character of positive values.
+        Defaults to ``numpy.get_printoptions()['sign']``.
+    floatmode : str, optional
+        Controls the interpretation of the `precision` option for
+        floating-point types.
+        Defaults to ``numpy.get_printoptions()['floatmode']``.
+        Can take the following values:
+
+        - 'fixed': Always print exactly `precision` fractional digits,
+          even if this would print more or fewer digits than
+          necessary to specify the value uniquely.
+        - 'unique': Print the minimum number of fractional digits necessary
+          to represent each value uniquely. Different elements may
+          have a different number of digits.  The value of the
+          `precision` option is ignored.
+        - 'maxprec': Print at most `precision` fractional digits, but if
+          an element can be uniquely represented with fewer digits
+          only print it with that many.
+        - 'maxprec_equal': Print at most `precision` fractional digits,
+          but if every element in the array can be uniquely
+          represented with an equal number of fewer digits, use that
+          many digits for all elements.
+    legacy : string or `False`, optional
+        If set to the string `'1.13'` enables 1.13 legacy printing mode. This
+        approximates numpy 1.13 print output by including a space in the sign
+        position of floats and different behavior for 0d arrays. If set to
+        `False`, disables legacy mode. Unrecognized strings will be ignored
+        with a warning for forward compatibility.
+
+        .. versionadded:: 1.14.0
+
+    Returns
+    -------
+    array_str : str
+        String representation of the array.
+
+    Raises
+    ------
+    TypeError
+        if a callable in `formatter` does not return a string.
+
+    See Also
+    --------
+    array_str, array_repr, set_printoptions, get_printoptions
+
+    Notes
+    -----
+    If a formatter is specified for a certain type, the `precision` keyword is
+    ignored for that type.
+
+    This is a very flexible function; `array_repr` and `array_str` are using
+    `array2string` internally so keywords with the same name should work
+    identically in all three functions.
+
+    Examples
+    --------
+    >>> x = np.array([1e-16,1,2,3])
+    >>> np.array2string(x, precision=2, separator=',',
+    ...                       suppress_small=True)
+    '[0.,1.,2.,3.]'
+
+    >>> x  = np.arange(3.)
+    >>> np.array2string(x, formatter={'float_kind':lambda x: "%.2f" % x})
+    '[0.00 1.00 2.00]'
+
+    >>> x  = np.arange(3)
+    >>> np.array2string(x, formatter={'int':lambda x: hex(x)})
+    '[0x0 0x1 0x2]'
+
+    """
+
+    overrides = _make_options_dict(precision, threshold, edgeitems,
+                                   max_line_width, suppress_small, None, None,
+                                   sign, formatter, floatmode, legacy)
+    options = _format_options.copy()
+    options.update(overrides)
+
+    if options['legacy'] == '1.13':
+        if style is np._NoValue:
+            style = repr
+
+        if a.shape == () and a.dtype.names is None:
+            return style(a.item())
+    elif style is not np._NoValue:
+        # Deprecation 11-9-2017  v1.14
+        warnings.warn("'style' argument is deprecated and no longer functional"
+                      " except in 1.13 'legacy' mode",
+                      DeprecationWarning, stacklevel=3)
+
+    if options['legacy'] != '1.13':
+        options['linewidth'] -= len(suffix)
+
+    # treat as a null array if any of shape elements == 0
+    if a.size == 0:
+        return "[]"
+
+    return _array2string(a, options, separator, prefix)
+
+
+def _extendLine(s, line, word, line_width, next_line_prefix, legacy):
+    needs_wrap = len(line) + len(word) > line_width
+    if legacy != '1.13':
+        s# don't wrap lines if it won't help
+        if len(line) <= len(next_line_prefix):
+            needs_wrap = False
+
+    if needs_wrap:
+        s += line.rstrip() + "\n"
+        line = next_line_prefix
+    line += word
+    return s, line
+
+
+def _formatArray(a, format_function, line_width, next_line_prefix,
+                 separator, edge_items, summary_insert, legacy):
+    """formatArray is designed for two modes of operation:
+
+    1. Full output
+
+    2. Summarized output
+
+    """
+    def recurser(index, hanging_indent, curr_width):
+        """
+        By using this local function, we don't need to recurse with all the
+        arguments. Since this function is not created recursively, the cost is
+        not significant
+        """
+        axis = len(index)
+        axes_left = a.ndim - axis
+
+        if axes_left == 0:
+            return format_function(a[index])
+
+        # when recursing, add a space to align with the [ added, and reduce the
+        # length of the line by 1
+        next_hanging_indent = hanging_indent + ' '
+        if legacy == '1.13':
+            next_width = curr_width
+        else:
+            next_width = curr_width - len(']')
+
+        a_len = a.shape[axis]
+        show_summary = summary_insert and 2*edge_items < a_len
+        if show_summary:
+            leading_items = edge_items
+            trailing_items = edge_items
+        else:
+            leading_items = 0
+            trailing_items = a_len
+
+        # stringify the array with the hanging indent on the first line too
+        s = ''
+
+        # last axis (rows) - wrap elements if they would not fit on one line
+        if axes_left == 1:
+            # the length up until the beginning of the separator / bracket
+            if legacy == '1.13':
+                elem_width = curr_width - len(separator.rstrip())
+            else:
+                elem_width = curr_width - max(len(separator.rstrip()), len(']'))
+
+            line = hanging_indent
+            for i in range(leading_items):
+                word = recurser(index + (i,), next_hanging_indent, next_width)
+                s, line = _extendLine(
+                    s, line, word, elem_width, hanging_indent, legacy)
+                line += separator
+
+            if show_summary:
+                s, line = _extendLine(
+                    s, line, summary_insert, elem_width, hanging_indent, legacy)
+                if legacy == '1.13':
+                    line += ", "
+                else:
+                    line += separator
+
+            for i in range(trailing_items, 1, -1):
+                word = recurser(index + (-i,), next_hanging_indent, next_width)
+                s, line = _extendLine(
+                    s, line, word, elem_width, hanging_indent, legacy)
+                line += separator
+
+            if legacy == '1.13':
+                # width of the separator is not considered on 1.13
+                elem_width = curr_width
+            word = recurser(index + (-1,), next_hanging_indent, next_width)
+            s, line = _extendLine(
+                s, line, word, elem_width, hanging_indent, legacy)
+
+            s += line
+
+        # other axes - insert newlines between rows
+        else:
+            s = ''
+            line_sep = separator.rstrip() + '\n'*(axes_left - 1)
+
+            for i in range(leading_items):
+                nested = recurser(index + (i,), next_hanging_indent, next_width)
+                s += hanging_indent + nested + line_sep
+
+            if show_summary:
+                if legacy == '1.13':
+                    # trailing space, fixed nbr of newlines, and fixed separator
+                    s += hanging_indent + summary_insert + ", \n"
+                else:
+                    s += hanging_indent + summary_insert + line_sep
+
+            for i in range(trailing_items, 1, -1):
+                nested = recurser(index + (-i,), next_hanging_indent,
+                                  next_width)
+                s += hanging_indent + nested + line_sep
+
+            nested = recurser(index + (-1,), next_hanging_indent, next_width)
+            s += hanging_indent + nested
+
+        # remove the hanging indent, and wrap in []
+        s = '[' + s[len(hanging_indent):] + ']'
+        return s
+
+    try:
+        # invoke the recursive part with an initial index and prefix
+        return recurser(index=(),
+                        hanging_indent=next_line_prefix,
+                        curr_width=line_width)
+    finally:
+        # recursive closures have a cyclic reference to themselves, which
+        # requires gc to collect (gh-10620). To avoid this problem, for
+        # performance and PyPy friendliness, we break the cycle:
+        recurser = None
+
+def _none_or_positive_arg(x, name):
+    if x is None:
+        return -1
+    if x < 0:
+        raise ValueError("{} must be >= 0".format(name))
+    return x
+
+class FloatingFormat:
+    """ Formatter for subtypes of np.floating """
+    def __init__(self, data, precision, floatmode, suppress_small, sign=False,
+                 *, legacy=None):
+        # for backcompatibility, accept bools
+        if isinstance(sign, bool):
+            sign = '+' if sign else '-'
+
+        self._legacy = legacy
+        if self._legacy == '1.13':
+            # when not 0d, legacy does not support '-'
+            if data.shape != () and sign == '-':
+                sign = ' '
+
+        self.floatmode = floatmode
+        if floatmode == 'unique':
+            self.precision = None
+        else:
+            self.precision = precision
+
+        self.precision = _none_or_positive_arg(self.precision, 'precision')
+
+        self.suppress_small = suppress_small
+        self.sign = sign
+        self.exp_format = False
+        self.large_exponent = False
+
+        self.fillFormat(data)
+
+    def fillFormat(self, data):
+        # only the finite values are used to compute the number of digits
+        finite_vals = data[isfinite(data)]
+
+        # choose exponential mode based on the non-zero finite values:
+        abs_non_zero = absolute(finite_vals[finite_vals != 0])
+        if len(abs_non_zero) != 0:
+            max_val = np.max(abs_non_zero)
+            min_val = np.min(abs_non_zero)
+            with errstate(over='ignore'):  # division can overflow
+                if max_val >= 1.e8 or (not self.suppress_small and
+                        (min_val < 0.0001 or max_val/min_val > 1000.)):
+                    self.exp_format = True
+
+        # do a first pass of printing all the numbers, to determine sizes
+        if len(finite_vals) == 0:
+            self.pad_left = 0
+            self.pad_right = 0
+            self.trim = '.'
+            self.exp_size = -1
+            self.unique = True
+        elif self.exp_format:
+            trim, unique = '.', True
+            if self.floatmode == 'fixed' or self._legacy == '1.13':
+                trim, unique = 'k', False
+            strs = (dragon4_scientific(x, precision=self.precision,
+                               unique=unique, trim=trim, sign=self.sign == '+')
+                    for x in finite_vals)
+            frac_strs, _, exp_strs = zip(*(s.partition('e') for s in strs))
+            int_part, frac_part = zip(*(s.split('.') for s in frac_strs))
+            self.exp_size = max(len(s) for s in exp_strs) - 1
+
+            self.trim = 'k'
+            self.precision = max(len(s) for s in frac_part)
+
+            # for back-compat with np 1.13, use 2 spaces & sign and full prec
+            if self._legacy == '1.13':
+                self.pad_left = 3
+            else:
+                # this should be only 1 or 2. Can be calculated from sign.
+                self.pad_left = max(len(s) for s in int_part)
+            # pad_right is only needed for nan length calculation
+            self.pad_right = self.exp_size + 2 + self.precision
+
+            self.unique = False
+        else:
+            # first pass printing to determine sizes
+            trim, unique = '.', True
+            if self.floatmode == 'fixed':
+                trim, unique = 'k', False
+            strs = (dragon4_positional(x, precision=self.precision,
+                                       fractional=True,
+                                       unique=unique, trim=trim,
+                                       sign=self.sign == '+')
+                    for x in finite_vals)
+            int_part, frac_part = zip(*(s.split('.') for s in strs))
+            if self._legacy == '1.13':
+                self.pad_left = 1 + max(len(s.lstrip('-+')) for s in int_part)
+            else:
+                self.pad_left = max(len(s) for s in int_part)
+            self.pad_right = max(len(s) for s in frac_part)
+            self.exp_size = -1
+
+            if self.floatmode in ['fixed', 'maxprec_equal']:
+                self.precision = self.pad_right
+                self.unique = False
+                self.trim = 'k'
+            else:
+                self.unique = True
+                self.trim = '.'
+
+        if self._legacy != '1.13':
+            # account for sign = ' ' by adding one to pad_left
+            if self.sign == ' ' and not any(np.signbit(finite_vals)):
+                self.pad_left += 1
+
+        # if there are non-finite values, may need to increase pad_left
+        if data.size != finite_vals.size:
+            neginf = self.sign != '-' or any(data[isinf(data)] < 0)
+            nanlen = len(_format_options['nanstr'])
+            inflen = len(_format_options['infstr']) + neginf
+            offset = self.pad_right + 1  # +1 for decimal pt
+            self.pad_left = max(self.pad_left, nanlen - offset, inflen - offset)
+
+    def __call__(self, x):
+        if not np.isfinite(x):
+            with errstate(invalid='ignore'):
+                if np.isnan(x):
+                    sign = '+' if self.sign == '+' else ''
+                    ret = sign + _format_options['nanstr']
+                else:  # isinf
+                    sign = '-' if x < 0 else '+' if self.sign == '+' else ''
+                    ret = sign + _format_options['infstr']
+                return ' '*(self.pad_left + self.pad_right + 1 - len(ret)) + ret
+
+        if self.exp_format:
+            return dragon4_scientific(x,
+                                      precision=self.precision,
+                                      unique=self.unique,
+                                      trim=self.trim,
+                                      sign=self.sign == '+',
+                                      pad_left=self.pad_left,
+                                      exp_digits=self.exp_size)
+        else:
+            return dragon4_positional(x,
+                                      precision=self.precision,
+                                      unique=self.unique,
+                                      fractional=True,
+                                      trim=self.trim,
+                                      sign=self.sign == '+',
+                                      pad_left=self.pad_left,
+                                      pad_right=self.pad_right)
+
+
+@set_module('numpy')
+def format_float_scientific(x, precision=None, unique=True, trim='k',
+                            sign=False, pad_left=None, exp_digits=None):
+    """
+    Format a floating-point scalar as a decimal string in scientific notation.
+
+    Provides control over rounding, trimming and padding. Uses and assumes
+    IEEE unbiased rounding. Uses the "Dragon4" algorithm.
+
+    Parameters
+    ----------
+    x : python float or numpy floating scalar
+        Value to format.
+    precision : non-negative integer or None, optional
+        Maximum number of digits to print. May be None if `unique` is
+        `True`, but must be an integer if unique is `False`.
+    unique : boolean, optional
+        If `True`, use a digit-generation strategy which gives the shortest
+        representation which uniquely identifies the floating-point number from
+        other values of the same type, by judicious rounding. If `precision`
+        was omitted, print all necessary digits, otherwise digit generation is
+        cut off after `precision` digits and the remaining value is rounded.
+        If `False`, digits are generated as if printing an infinite-precision
+        value and stopping after `precision` digits, rounding the remaining
+        value.
+    trim : one of 'k', '.', '0', '-', optional
+        Controls post-processing trimming of trailing digits, as follows:
+
+        * 'k' : keep trailing zeros, keep decimal point (no trimming)
+        * '.' : trim all trailing zeros, leave decimal point
+        * '0' : trim all but the zero before the decimal point. Insert the
+          zero if it is missing.
+        * '-' : trim trailing zeros and any trailing decimal point
+    sign : boolean, optional
+        Whether to show the sign for positive values.
+    pad_left : non-negative integer, optional
+        Pad the left side of the string with whitespace until at least that
+        many characters are to the left of the decimal point.
+    exp_digits : non-negative integer, optional
+        Pad the exponent with zeros until it contains at least this many digits.
+        If omitted, the exponent will be at least 2 digits.
+
+    Returns
+    -------
+    rep : string
+        The string representation of the floating point value
+
+    See Also
+    --------
+    format_float_positional
+
+    Examples
+    --------
+    >>> np.format_float_scientific(np.float32(np.pi))
+    '3.1415927e+00'
+    >>> s = np.float32(1.23e24)
+    >>> np.format_float_scientific(s, unique=False, precision=15)
+    '1.230000071797338e+24'
+    >>> np.format_float_scientific(s, exp_digits=4)
+    '1.23e+0024'
+    """
+    precision = _none_or_positive_arg(precision, 'precision')
+    pad_left = _none_or_positive_arg(pad_left, 'pad_left')
+    exp_digits = _none_or_positive_arg(exp_digits, 'exp_digits')
+    return dragon4_scientific(x, precision=precision, unique=unique,
+                              trim=trim, sign=sign, pad_left=pad_left,
+                              exp_digits=exp_digits)
+
+
+@set_module('numpy')
+def format_float_positional(x, precision=None, unique=True,
+                            fractional=True, trim='k', sign=False,
+                            pad_left=None, pad_right=None):
+    """
+    Format a floating-point scalar as a decimal string in positional notation.
+
+    Provides control over rounding, trimming and padding. Uses and assumes
+    IEEE unbiased rounding. Uses the "Dragon4" algorithm.
+
+    Parameters
+    ----------
+    x : python float or numpy floating scalar
+        Value to format.
+    precision : non-negative integer or None, optional
+        Maximum number of digits to print. May be None if `unique` is
+        `True`, but must be an integer if unique is `False`.
+    unique : boolean, optional
+        If `True`, use a digit-generation strategy which gives the shortest
+        representation which uniquely identifies the floating-point number from
+        other values of the same type, by judicious rounding. If `precision`
+        was omitted, print out all necessary digits, otherwise digit generation
+        is cut off after `precision` digits and the remaining value is rounded.
+        If `False`, digits are generated as if printing an infinite-precision
+        value and stopping after `precision` digits, rounding the remaining
+        value.
+    fractional : boolean, optional
+        If `True`, the cutoff of `precision` digits refers to the total number
+        of digits after the decimal point, including leading zeros.
+        If `False`, `precision` refers to the total number of significant
+        digits, before or after the decimal point, ignoring leading zeros.
+    trim : one of 'k', '.', '0', '-', optional
+        Controls post-processing trimming of trailing digits, as follows:
+
+        * 'k' : keep trailing zeros, keep decimal point (no trimming)
+        * '.' : trim all trailing zeros, leave decimal point
+        * '0' : trim all but the zero before the decimal point. Insert the
+          zero if it is missing.
+        * '-' : trim trailing zeros and any trailing decimal point
+    sign : boolean, optional
+        Whether to show the sign for positive values.
+    pad_left : non-negative integer, optional
+        Pad the left side of the string with whitespace until at least that
+        many characters are to the left of the decimal point.
+    pad_right : non-negative integer, optional
+        Pad the right side of the string with whitespace until at least that
+        many characters are to the right of the decimal point.
+
+    Returns
+    -------
+    rep : string
+        The string representation of the floating point value
+
+    See Also
+    --------
+    format_float_scientific
+
+    Examples
+    --------
+    >>> np.format_float_positional(np.float32(np.pi))
+    '3.1415927'
+    >>> np.format_float_positional(np.float16(np.pi))
+    '3.14'
+    >>> np.format_float_positional(np.float16(0.3))
+    '0.3'
+    >>> np.format_float_positional(np.float16(0.3), unique=False, precision=10)
+    '0.3000488281'
+    """
+    precision = _none_or_positive_arg(precision, 'precision')
+    pad_left = _none_or_positive_arg(pad_left, 'pad_left')
+    pad_right = _none_or_positive_arg(pad_right, 'pad_right')
+    return dragon4_positional(x, precision=precision, unique=unique,
+                              fractional=fractional, trim=trim,
+                              sign=sign, pad_left=pad_left,
+                              pad_right=pad_right)
+
+
+class IntegerFormat:
+    def __init__(self, data):
+        if data.size > 0:
+            max_str_len = max(len(str(np.max(data))),
+                              len(str(np.min(data))))
+        else:
+            max_str_len = 0
+        self.format = '%{}d'.format(max_str_len)
+
+    def __call__(self, x):
+        return self.format % x
+
+
+class BoolFormat:
+    def __init__(self, data, **kwargs):
+        # add an extra space so " True" and "False" have the same length and
+        # array elements align nicely when printed, except in 0d arrays
+        self.truestr = ' True' if data.shape != () else 'True'
+
+    def __call__(self, x):
+        return self.truestr if x else "False"
+
+
+class ComplexFloatingFormat:
+    """ Formatter for subtypes of np.complexfloating """
+    def __init__(self, x, precision, floatmode, suppress_small,
+                 sign=False, *, legacy=None):
+        # for backcompatibility, accept bools
+        if isinstance(sign, bool):
+            sign = '+' if sign else '-'
+
+        floatmode_real = floatmode_imag = floatmode
+        if legacy == '1.13':
+            floatmode_real = 'maxprec_equal'
+            floatmode_imag = 'maxprec'
+
+        self.real_format = FloatingFormat(
+            x.real, precision, floatmode_real, suppress_small,
+            sign=sign, legacy=legacy
+        )
+        self.imag_format = FloatingFormat(
+            x.imag, precision, floatmode_imag, suppress_small,
+            sign='+', legacy=legacy
+        )
+
+    def __call__(self, x):
+        r = self.real_format(x.real)
+        i = self.imag_format(x.imag)
+
+        # add the 'j' before the terminal whitespace in i
+        sp = len(i.rstrip())
+        i = i[:sp] + 'j' + i[sp:]
+
+        return r + i
+
+
+class _TimelikeFormat:
+    def __init__(self, data):
+        non_nat = data[~isnat(data)]
+        if len(non_nat) > 0:
+            # Max str length of non-NaT elements
+            max_str_len = max(len(self._format_non_nat(np.max(non_nat))),
+                              len(self._format_non_nat(np.min(non_nat))))
+        else:
+            max_str_len = 0
+        if len(non_nat) < data.size:
+            # data contains a NaT
+            max_str_len = max(max_str_len, 5)
+        self._format = '%{}s'.format(max_str_len)
+        self._nat = "'NaT'".rjust(max_str_len)
+
+    def _format_non_nat(self, x):
+        # override in subclass
+        raise NotImplementedError
+
+    def __call__(self, x):
+        if isnat(x):
+            return self._nat
+        else:
+            return self._format % self._format_non_nat(x)
+
+
+class DatetimeFormat(_TimelikeFormat):
+    def __init__(self, x, unit=None, timezone=None, casting='same_kind',
+                 legacy=False):
+        # Get the unit from the dtype
+        if unit is None:
+            if x.dtype.kind == 'M':
+                unit = datetime_data(x.dtype)[0]
+            else:
+                unit = 's'
+
+        if timezone is None:
+            timezone = 'naive'
+        self.timezone = timezone
+        self.unit = unit
+        self.casting = casting
+        self.legacy = legacy
+
+        # must be called after the above are configured
+        super(DatetimeFormat, self).__init__(x)
+
+    def __call__(self, x):
+        if self.legacy == '1.13':
+            return self._format_non_nat(x)
+        return super(DatetimeFormat, self).__call__(x)
+
+    def _format_non_nat(self, x):
+        return "'%s'" % datetime_as_string(x,
+                                    unit=self.unit,
+                                    timezone=self.timezone,
+                                    casting=self.casting)
+
+
+class TimedeltaFormat(_TimelikeFormat):
+    def _format_non_nat(self, x):
+        return str(x.astype('i8'))
+
+
+class SubArrayFormat:
+    def __init__(self, format_function):
+        self.format_function = format_function
+
+    def __call__(self, arr):
+        if arr.ndim <= 1:
+            return "[" + ", ".join(self.format_function(a) for a in arr) + "]"
+        return "[" + ", ".join(self.__call__(a) for a in arr) + "]"
+
+
+class StructuredVoidFormat:
+    """
+    Formatter for structured np.void objects.
+
+    This does not work on structured alias types like np.dtype(('i4', 'i2,i2')),
+    as alias scalars lose their field information, and the implementation
+    relies upon np.void.__getitem__.
+    """
+    def __init__(self, format_functions):
+        self.format_functions = format_functions
+
+    @classmethod
+    def from_data(cls, data, **options):
+        """
+        This is a second way to initialize StructuredVoidFormat, using the raw data
+        as input. Added to avoid changing the signature of __init__.
+        """
+        format_functions = []
+        for field_name in data.dtype.names:
+            format_function = _get_format_function(data[field_name], **options)
+            if data.dtype[field_name].shape != ():
+                format_function = SubArrayFormat(format_function)
+            format_functions.append(format_function)
+        return cls(format_functions)
+
+    def __call__(self, x):
+        str_fields = [
+            format_function(field)
+            for field, format_function in zip(x, self.format_functions)
+        ]
+        if len(str_fields) == 1:
+            return "({},)".format(str_fields[0])
+        else:
+            return "({})".format(", ".join(str_fields))
+
+
+def _void_scalar_repr(x):
+    """
+    Implements the repr for structured-void scalars. It is called from the
+    scalartypes.c.src code, and is placed here because it uses the elementwise
+    formatters defined above.
+    """
+    return StructuredVoidFormat.from_data(array(x), **_format_options)(x)
+
+
+_typelessdata = [int_, float_, complex_, bool_]
+if issubclass(intc, int):
+    _typelessdata.append(intc)
+if issubclass(longlong, int):
+    _typelessdata.append(longlong)
+
+
+def dtype_is_implied(dtype):
+    """
+    Determine if the given dtype is implied by the representation of its values.
+
+    Parameters
+    ----------
+    dtype : dtype
+        Data type
+
+    Returns
+    -------
+    implied : bool
+        True if the dtype is implied by the representation of its values.
+
+    Examples
+    --------
+    >>> np.core.arrayprint.dtype_is_implied(int)
+    True
+    >>> np.array([1, 2, 3], int)
+    array([1, 2, 3])
+    >>> np.core.arrayprint.dtype_is_implied(np.int8)
+    False
+    >>> np.array([1, 2, 3], np.int8)
+    array([1, 2, 3], dtype=int8)
+    """
+    dtype = np.dtype(dtype)
+    if _format_options['legacy'] == '1.13' and dtype.type == bool_:
+        return False
+
+    # not just void types can be structured, and names are not part of the repr
+    if dtype.names is not None:
+        return False
+
+    return dtype.type in _typelessdata
+
+
+def dtype_short_repr(dtype):
+    """
+    Convert a dtype to a short form which evaluates to the same dtype.
+
+    The intent is roughly that the following holds
+
+    >>> from numpy import *
+    >>> dt = np.int64([1, 2]).dtype
+    >>> assert eval(dtype_short_repr(dt)) == dt
+    """
+    if dtype.names is not None:
+        # structured dtypes give a list or tuple repr
+        return str(dtype)
+    elif issubclass(dtype.type, flexible):
+        # handle these separately so they don't give garbage like str256
+        return "'%s'" % str(dtype)
+
+    typename = dtype.name
+    # quote typenames which can't be represented as python variable names
+    if typename and not (typename[0].isalpha() and typename.isalnum()):
+        typename = repr(typename)
+
+    return typename
+
+
+def _array_repr_implementation(
+        arr, max_line_width=None, precision=None, suppress_small=None,
+        array2string=array2string):
+    """Internal version of array_repr() that allows overriding array2string."""
+    if max_line_width is None:
+        max_line_width = _format_options['linewidth']
+
+    if type(arr) is not ndarray:
+        class_name = type(arr).__name__
+    else:
+        class_name = "array"
+
+    skipdtype = dtype_is_implied(arr.dtype) and arr.size > 0
+
+    prefix = class_name + "("
+    suffix = ")" if skipdtype else ","
+
+    if (_format_options['legacy'] == '1.13' and
+            arr.shape == () and not arr.dtype.names):
+        lst = repr(arr.item())
+    elif arr.size > 0 or arr.shape == (0,):
+        lst = array2string(arr, max_line_width, precision, suppress_small,
+                           ', ', prefix, suffix=suffix)
+    else:  # show zero-length shape unless it is (0,)
+        lst = "[], shape=%s" % (repr(arr.shape),)
+
+    arr_str = prefix + lst + suffix
+
+    if skipdtype:
+        return arr_str
+
+    dtype_str = "dtype={})".format(dtype_short_repr(arr.dtype))
+
+    # compute whether we should put dtype on a new line: Do so if adding the
+    # dtype would extend the last line past max_line_width.
+    # Note: This line gives the correct result even when rfind returns -1.
+    last_line_len = len(arr_str) - (arr_str.rfind('\n') + 1)
+    spacer = " "
+    if _format_options['legacy'] == '1.13':
+        if issubclass(arr.dtype.type, flexible):
+            spacer = '\n' + ' '*len(class_name + "(")
+    elif last_line_len + len(dtype_str) + 1 > max_line_width:
+        spacer = '\n' + ' '*len(class_name + "(")
+
+    return arr_str + spacer + dtype_str
+
+
+def _array_repr_dispatcher(
+        arr, max_line_width=None, precision=None, suppress_small=None):
+    return (arr,)
+
+
+@array_function_dispatch(_array_repr_dispatcher, module='numpy')
+def array_repr(arr, max_line_width=None, precision=None, suppress_small=None):
+    """
+    Return the string representation of an array.
+
+    Parameters
+    ----------
+    arr : ndarray
+        Input array.
+    max_line_width : int, optional
+        Inserts newlines if text is longer than `max_line_width`.
+        Defaults to ``numpy.get_printoptions()['linewidth']``.
+    precision : int, optional
+        Floating point precision.
+        Defaults to ``numpy.get_printoptions()['precision']``.
+    suppress_small : bool, optional
+        Represent numbers "very close" to zero as zero; default is False.
+        Very close is defined by precision: if the precision is 8, e.g.,
+        numbers smaller (in absolute value) than 5e-9 are represented as
+        zero.
+        Defaults to ``numpy.get_printoptions()['suppress']``.
+
+    Returns
+    -------
+    string : str
+      The string representation of an array.
+
+    See Also
+    --------
+    array_str, array2string, set_printoptions
+
+    Examples
+    --------
+    >>> np.array_repr(np.array([1,2]))
+    'array([1, 2])'
+    >>> np.array_repr(np.ma.array([0.]))
+    'MaskedArray([0.])'
+    >>> np.array_repr(np.array([], np.int32))
+    'array([], dtype=int32)'
+
+    >>> x = np.array([1e-6, 4e-7, 2, 3])
+    >>> np.array_repr(x, precision=6, suppress_small=True)
+    'array([0.000001,  0.      ,  2.      ,  3.      ])'
+
+    """
+    return _array_repr_implementation(
+        arr, max_line_width, precision, suppress_small)
+
+
+@_recursive_guard()
+def _guarded_repr_or_str(v):
+    if isinstance(v, bytes):
+        return repr(v)
+    return str(v)
+
+
+def _array_str_implementation(
+        a, max_line_width=None, precision=None, suppress_small=None,
+        array2string=array2string):
+    """Internal version of array_str() that allows overriding array2string."""
+    if (_format_options['legacy'] == '1.13' and
+            a.shape == () and not a.dtype.names):
+        return str(a.item())
+
+    # the str of 0d arrays is a special case: It should appear like a scalar,
+    # so floats are not truncated by `precision`, and strings are not wrapped
+    # in quotes. So we return the str of the scalar value.
+    if a.shape == ():
+        # obtain a scalar and call str on it, avoiding problems for subclasses
+        # for which indexing with () returns a 0d instead of a scalar by using
+        # ndarray's getindex. Also guard against recursive 0d object arrays.
+        return _guarded_repr_or_str(np.ndarray.__getitem__(a, ()))
+
+    return array2string(a, max_line_width, precision, suppress_small, ' ', "")
+
+
+def _array_str_dispatcher(
+        a, max_line_width=None, precision=None, suppress_small=None):
+    return (a,)
+
+
+@array_function_dispatch(_array_str_dispatcher, module='numpy')
+def array_str(a, max_line_width=None, precision=None, suppress_small=None):
+    """
+    Return a string representation of the data in an array.
+
+    The data in the array is returned as a single string.  This function is
+    similar to `array_repr`, the difference being that `array_repr` also
+    returns information on the kind of array and its data type.
+
+    Parameters
+    ----------
+    a : ndarray
+        Input array.
+    max_line_width : int, optional
+        Inserts newlines if text is longer than `max_line_width`.
+        Defaults to ``numpy.get_printoptions()['linewidth']``.
+    precision : int, optional
+        Floating point precision.
+        Defaults to ``numpy.get_printoptions()['precision']``.
+    suppress_small : bool, optional
+        Represent numbers "very close" to zero as zero; default is False.
+        Very close is defined by precision: if the precision is 8, e.g.,
+        numbers smaller (in absolute value) than 5e-9 are represented as
+        zero.
+        Defaults to ``numpy.get_printoptions()['suppress']``.
+
+    See Also
+    --------
+    array2string, array_repr, set_printoptions
+
+    Examples
+    --------
+    >>> np.array_str(np.arange(3))
+    '[0 1 2]'
+
+    """
+    return _array_str_implementation(
+        a, max_line_width, precision, suppress_small)
+
+
+# needed if __array_function__ is disabled
+_array2string_impl = getattr(array2string, '__wrapped__', array2string)
+_default_array_str = functools.partial(_array_str_implementation,
+                                       array2string=_array2string_impl)
+_default_array_repr = functools.partial(_array_repr_implementation,
+                                        array2string=_array2string_impl)
+
+
+def set_string_function(f, repr=True):
+    """
+    Set a Python function to be used when pretty printing arrays.
+
+    Parameters
+    ----------
+    f : function or None
+        Function to be used to pretty print arrays. The function should expect
+        a single array argument and return a string of the representation of
+        the array. If None, the function is reset to the default NumPy function
+        to print arrays.
+    repr : bool, optional
+        If True (default), the function for pretty printing (``__repr__``)
+        is set, if False the function that returns the default string
+        representation (``__str__``) is set.
+
+    See Also
+    --------
+    set_printoptions, get_printoptions
+
+    Examples
+    --------
+    >>> def pprint(arr):
+    ...     return 'HA! - What are you going to do now?'
+    ...
+    >>> np.set_string_function(pprint)
+    >>> a = np.arange(10)
+    >>> a
+    HA! - What are you going to do now?
+    >>> _ = a
+    >>> # [0 1 2 3 4 5 6 7 8 9]
+
+    We can reset the function to the default:
+
+    >>> np.set_string_function(None)
+    >>> a
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+
+    `repr` affects either pretty printing or normal string representation.
+    Note that ``__repr__`` is still affected by setting ``__str__``
+    because the width of each array element in the returned string becomes
+    equal to the length of the result of ``__str__()``.
+
+    >>> x = np.arange(4)
+    >>> np.set_string_function(lambda x:'random', repr=False)
+    >>> x.__str__()
+    'random'
+    >>> x.__repr__()
+    'array([0, 1, 2, 3])'
+
+    """
+    if f is None:
+        if repr:
+            return multiarray.set_string_function(_default_array_repr, 1)
+        else:
+            return multiarray.set_string_function(_default_array_str, 0)
+    else:
+        return multiarray.set_string_function(f, repr)
+
+set_string_function(_default_array_str, False)
+set_string_function(_default_array_repr, True)
diff --git a/venv/Lib/site-packages/numpy/core/cversions.py b/venv/Lib/site-packages/numpy/core/cversions.py
new file mode 100644
index 000000000..00159c3a8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/cversions.py
@@ -0,0 +1,13 @@
+"""Simple script to compute the api hash of the current API.
+
+The API has is defined by numpy_api_order and ufunc_api_order.
+
+"""
+from os.path import dirname
+
+from code_generators.genapi import fullapi_hash
+from code_generators.numpy_api import full_api
+
+if __name__ == '__main__':
+    curdir = dirname(__file__)
+    print(fullapi_hash(full_api))
diff --git a/venv/Lib/site-packages/numpy/core/defchararray.py b/venv/Lib/site-packages/numpy/core/defchararray.py
new file mode 100644
index 000000000..1d447b86a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/defchararray.py
@@ -0,0 +1,2795 @@
+"""
+This module contains a set of functions for vectorized string
+operations and methods.
+
+.. note::
+   The `chararray` class exists for backwards compatibility with
+   Numarray, it is not recommended for new development. Starting from numpy
+   1.4, if one needs arrays of strings, it is recommended to use arrays of
+   `dtype` `object_`, `string_` or `unicode_`, and use the free functions
+   in the `numpy.char` module for fast vectorized string operations.
+
+Some methods will only be available if the corresponding string method is
+available in your version of Python.
+
+The preferred alias for `defchararray` is `numpy.char`.
+
+"""
+import functools
+import sys
+from .numerictypes import (
+    string_, unicode_, integer, int_, object_, bool_, character)
+from .numeric import ndarray, compare_chararrays
+from .numeric import array as narray
+from numpy.core.multiarray import _vec_string
+from numpy.core.overrides import set_module
+from numpy.core import overrides
+from numpy.compat import asbytes
+import numpy
+
+__all__ = [
+    'equal', 'not_equal', 'greater_equal', 'less_equal',
+    'greater', 'less', 'str_len', 'add', 'multiply', 'mod', 'capitalize',
+    'center', 'count', 'decode', 'encode', 'endswith', 'expandtabs',
+    'find', 'index', 'isalnum', 'isalpha', 'isdigit', 'islower', 'isspace',
+    'istitle', 'isupper', 'join', 'ljust', 'lower', 'lstrip', 'partition',
+    'replace', 'rfind', 'rindex', 'rjust', 'rpartition', 'rsplit',
+    'rstrip', 'split', 'splitlines', 'startswith', 'strip', 'swapcase',
+    'title', 'translate', 'upper', 'zfill', 'isnumeric', 'isdecimal',
+    'array', 'asarray'
+    ]
+
+
+_globalvar = 0
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy.char')
+
+
+def _use_unicode(*args):
+    """
+    Helper function for determining the output type of some string
+    operations.
+
+    For an operation on two ndarrays, if at least one is unicode, the
+    result should be unicode.
+    """
+    for x in args:
+        if (isinstance(x, str) or
+                issubclass(numpy.asarray(x).dtype.type, unicode_)):
+            return unicode_
+    return string_
+
+def _to_string_or_unicode_array(result):
+    """
+    Helper function to cast a result back into a string or unicode array
+    if an object array must be used as an intermediary.
+    """
+    return numpy.asarray(result.tolist())
+
+def _clean_args(*args):
+    """
+    Helper function for delegating arguments to Python string
+    functions.
+
+    Many of the Python string operations that have optional arguments
+    do not use 'None' to indicate a default value.  In these cases,
+    we need to remove all None arguments, and those following them.
+    """
+    newargs = []
+    for chk in args:
+        if chk is None:
+            break
+        newargs.append(chk)
+    return newargs
+
+def _get_num_chars(a):
+    """
+    Helper function that returns the number of characters per field in
+    a string or unicode array.  This is to abstract out the fact that
+    for a unicode array this is itemsize / 4.
+    """
+    if issubclass(a.dtype.type, unicode_):
+        return a.itemsize // 4
+    return a.itemsize
+
+
+def _binary_op_dispatcher(x1, x2):
+    return (x1, x2)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def equal(x1, x2):
+    """
+    Return (x1 == x2) element-wise.
+
+    Unlike `numpy.equal`, this comparison is performed by first
+    stripping whitespace characters from the end of the string.  This
+    behavior is provided for backward-compatibility with numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    not_equal, greater_equal, less_equal, greater, less
+    """
+    return compare_chararrays(x1, x2, '==', True)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def not_equal(x1, x2):
+    """
+    Return (x1 != x2) element-wise.
+
+    Unlike `numpy.not_equal`, this comparison is performed by first
+    stripping whitespace characters from the end of the string.  This
+    behavior is provided for backward-compatibility with numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    equal, greater_equal, less_equal, greater, less
+    """
+    return compare_chararrays(x1, x2, '!=', True)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def greater_equal(x1, x2):
+    """
+    Return (x1 >= x2) element-wise.
+
+    Unlike `numpy.greater_equal`, this comparison is performed by
+    first stripping whitespace characters from the end of the string.
+    This behavior is provided for backward-compatibility with
+    numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    equal, not_equal, less_equal, greater, less
+    """
+    return compare_chararrays(x1, x2, '>=', True)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def less_equal(x1, x2):
+    """
+    Return (x1 <= x2) element-wise.
+
+    Unlike `numpy.less_equal`, this comparison is performed by first
+    stripping whitespace characters from the end of the string.  This
+    behavior is provided for backward-compatibility with numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    equal, not_equal, greater_equal, greater, less
+    """
+    return compare_chararrays(x1, x2, '<=', True)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def greater(x1, x2):
+    """
+    Return (x1 > x2) element-wise.
+
+    Unlike `numpy.greater`, this comparison is performed by first
+    stripping whitespace characters from the end of the string.  This
+    behavior is provided for backward-compatibility with numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    equal, not_equal, greater_equal, less_equal, less
+    """
+    return compare_chararrays(x1, x2, '>', True)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def less(x1, x2):
+    """
+    Return (x1 < x2) element-wise.
+
+    Unlike `numpy.greater`, this comparison is performed by first
+    stripping whitespace characters from the end of the string.  This
+    behavior is provided for backward-compatibility with numarray.
+
+    Parameters
+    ----------
+    x1, x2 : array_like of str or unicode
+        Input arrays of the same shape.
+
+    Returns
+    -------
+    out : ndarray or bool
+        Output array of bools, or a single bool if x1 and x2 are scalars.
+
+    See Also
+    --------
+    equal, not_equal, greater_equal, less_equal, greater
+    """
+    return compare_chararrays(x1, x2, '<', True)
+
+
+def _unary_op_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def str_len(a):
+    """
+    Return len(a) element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of integers
+
+    See also
+    --------
+    builtins.len
+    """
+    # Note: __len__, etc. currently return ints, which are not C-integers.
+    # Generally intp would be expected for lengths, although int is sufficient
+    # due to the dtype itemsize limitation.
+    return _vec_string(a, int_, '__len__')
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def add(x1, x2):
+    """
+    Return element-wise string concatenation for two arrays of str or unicode.
+
+    Arrays `x1` and `x2` must have the same shape.
+
+    Parameters
+    ----------
+    x1 : array_like of str or unicode
+        Input array.
+    x2 : array_like of str or unicode
+        Input array.
+
+    Returns
+    -------
+    add : ndarray
+        Output array of `string_` or `unicode_`, depending on input types
+        of the same shape as `x1` and `x2`.
+
+    """
+    arr1 = numpy.asarray(x1)
+    arr2 = numpy.asarray(x2)
+    out_size = _get_num_chars(arr1) + _get_num_chars(arr2)
+    dtype = _use_unicode(arr1, arr2)
+    return _vec_string(arr1, (dtype, out_size), '__add__', (arr2,))
+
+
+def _multiply_dispatcher(a, i):
+    return (a,)
+
+
+@array_function_dispatch(_multiply_dispatcher)
+def multiply(a, i):
+    """
+    Return (a * i), that is string multiple concatenation,
+    element-wise.
+
+    Values in `i` of less than 0 are treated as 0 (which yields an
+    empty string).
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    i : array_like of ints
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input types
+
+    """
+    a_arr = numpy.asarray(a)
+    i_arr = numpy.asarray(i)
+    if not issubclass(i_arr.dtype.type, integer):
+        raise ValueError("Can only multiply by integers")
+    out_size = _get_num_chars(a_arr) * max(int(i_arr.max()), 0)
+    return _vec_string(
+        a_arr, (a_arr.dtype.type, out_size), '__mul__', (i_arr,))
+
+
+def _mod_dispatcher(a, values):
+    return (a, values)
+
+
+@array_function_dispatch(_mod_dispatcher)
+def mod(a, values):
+    """
+    Return (a % i), that is pre-Python 2.6 string formatting
+    (interpolation), element-wise for a pair of array_likes of str
+    or unicode.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    values : array_like of values
+       These values will be element-wise interpolated into the string.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input types
+
+    See also
+    --------
+    str.__mod__
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, '__mod__', (values,)))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def capitalize(a):
+    """
+    Return a copy of `a` with only the first character of each element
+    capitalized.
+
+    Calls `str.capitalize` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+        Input array of strings to capitalize.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input
+        types
+
+    See also
+    --------
+    str.capitalize
+
+    Examples
+    --------
+    >>> c = np.array(['a1b2','1b2a','b2a1','2a1b'],'S4'); c
+    array(['a1b2', '1b2a', 'b2a1', '2a1b'],
+        dtype='|S4')
+    >>> np.char.capitalize(c)
+    array(['A1b2', '1b2a', 'B2a1', '2a1b'],
+        dtype='|S4')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'capitalize')
+
+
+def _center_dispatcher(a, width, fillchar=None):
+    return (a,)
+
+
+@array_function_dispatch(_center_dispatcher)
+def center(a, width, fillchar=' '):
+    """
+    Return a copy of `a` with its elements centered in a string of
+    length `width`.
+
+    Calls `str.center` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    width : int
+        The length of the resulting strings
+    fillchar : str or unicode, optional
+        The padding character to use (default is space).
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input
+        types
+
+    See also
+    --------
+    str.center
+
+    """
+    a_arr = numpy.asarray(a)
+    width_arr = numpy.asarray(width)
+    size = int(numpy.max(width_arr.flat))
+    if numpy.issubdtype(a_arr.dtype, numpy.string_):
+        fillchar = asbytes(fillchar)
+    return _vec_string(
+        a_arr, (a_arr.dtype.type, size), 'center', (width_arr, fillchar))
+
+
+def _count_dispatcher(a, sub, start=None, end=None):
+    return (a,)
+
+
+@array_function_dispatch(_count_dispatcher)
+def count(a, sub, start=0, end=None):
+    """
+    Returns an array with the number of non-overlapping occurrences of
+    substring `sub` in the range [`start`, `end`].
+
+    Calls `str.count` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    sub : str or unicode
+       The substring to search for.
+
+    start, end : int, optional
+       Optional arguments `start` and `end` are interpreted as slice
+       notation to specify the range in which to count.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of ints.
+
+    See also
+    --------
+    str.count
+
+    Examples
+    --------
+    >>> c = np.array(['aAaAaA', '  aA  ', 'abBABba'])
+    >>> c
+    array(['aAaAaA', '  aA  ', 'abBABba'], dtype='<U7')
+    >>> np.char.count(c, 'A')
+    array([3, 1, 1])
+    >>> np.char.count(c, 'aA')
+    array([3, 1, 0])
+    >>> np.char.count(c, 'A', start=1, end=4)
+    array([2, 1, 1])
+    >>> np.char.count(c, 'A', start=1, end=3)
+    array([1, 0, 0])
+
+    """
+    return _vec_string(a, int_, 'count', [sub, start] + _clean_args(end))
+
+
+def _code_dispatcher(a, encoding=None, errors=None):
+    return (a,)
+
+
+@array_function_dispatch(_code_dispatcher)
+def decode(a, encoding=None, errors=None):
+    """
+    Calls `str.decode` element-wise.
+
+    The set of available codecs comes from the Python standard library,
+    and may be extended at runtime.  For more information, see the
+    :mod:`codecs` module.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    encoding : str, optional
+       The name of an encoding
+
+    errors : str, optional
+       Specifies how to handle encoding errors
+
+    Returns
+    -------
+    out : ndarray
+
+    See also
+    --------
+    str.decode
+
+    Notes
+    -----
+    The type of the result will depend on the encoding specified.
+
+    Examples
+    --------
+    >>> c = np.array(['aAaAaA', '  aA  ', 'abBABba'])
+    >>> c
+    array(['aAaAaA', '  aA  ', 'abBABba'], dtype='<U7')
+    >>> np.char.encode(c, encoding='cp037')
+    array(['\\x81\\xc1\\x81\\xc1\\x81\\xc1', '@@\\x81\\xc1@@',
+        '\\x81\\x82\\xc2\\xc1\\xc2\\x82\\x81'],
+        dtype='|S7')
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, 'decode', _clean_args(encoding, errors)))
+
+
+@array_function_dispatch(_code_dispatcher)
+def encode(a, encoding=None, errors=None):
+    """
+    Calls `str.encode` element-wise.
+
+    The set of available codecs comes from the Python standard library,
+    and may be extended at runtime. For more information, see the codecs
+    module.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    encoding : str, optional
+       The name of an encoding
+
+    errors : str, optional
+       Specifies how to handle encoding errors
+
+    Returns
+    -------
+    out : ndarray
+
+    See also
+    --------
+    str.encode
+
+    Notes
+    -----
+    The type of the result will depend on the encoding specified.
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, 'encode', _clean_args(encoding, errors)))
+
+
+def _endswith_dispatcher(a, suffix, start=None, end=None):
+    return (a,)
+
+
+@array_function_dispatch(_endswith_dispatcher)
+def endswith(a, suffix, start=0, end=None):
+    """
+    Returns a boolean array which is `True` where the string element
+    in `a` ends with `suffix`, otherwise `False`.
+
+    Calls `str.endswith` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    suffix : str
+
+    start, end : int, optional
+        With optional `start`, test beginning at that position. With
+        optional `end`, stop comparing at that position.
+
+    Returns
+    -------
+    out : ndarray
+        Outputs an array of bools.
+
+    See also
+    --------
+    str.endswith
+
+    Examples
+    --------
+    >>> s = np.array(['foo', 'bar'])
+    >>> s[0] = 'foo'
+    >>> s[1] = 'bar'
+    >>> s
+    array(['foo', 'bar'], dtype='<U3')
+    >>> np.char.endswith(s, 'ar')
+    array([False,  True])
+    >>> np.char.endswith(s, 'a', start=1, end=2)
+    array([False,  True])
+
+    """
+    return _vec_string(
+        a, bool_, 'endswith', [suffix, start] + _clean_args(end))
+
+
+def _expandtabs_dispatcher(a, tabsize=None):
+    return (a,)
+
+
+@array_function_dispatch(_expandtabs_dispatcher)
+def expandtabs(a, tabsize=8):
+    """
+    Return a copy of each string element where all tab characters are
+    replaced by one or more spaces.
+
+    Calls `str.expandtabs` element-wise.
+
+    Return a copy of each string element where all tab characters are
+    replaced by one or more spaces, depending on the current column
+    and the given `tabsize`. The column number is reset to zero after
+    each newline occurring in the string. This doesn't understand other
+    non-printing characters or escape sequences.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+        Input array
+    tabsize : int, optional
+        Replace tabs with `tabsize` number of spaces.  If not given defaults
+        to 8 spaces.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.expandtabs
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, 'expandtabs', (tabsize,)))
+
+
+@array_function_dispatch(_count_dispatcher)
+def find(a, sub, start=0, end=None):
+    """
+    For each element, return the lowest index in the string where
+    substring `sub` is found.
+
+    Calls `str.find` element-wise.
+
+    For each element, return the lowest index in the string where
+    substring `sub` is found, such that `sub` is contained in the
+    range [`start`, `end`].
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    sub : str or unicode
+
+    start, end : int, optional
+        Optional arguments `start` and `end` are interpreted as in
+        slice notation.
+
+    Returns
+    -------
+    out : ndarray or int
+        Output array of ints.  Returns -1 if `sub` is not found.
+
+    See also
+    --------
+    str.find
+
+    """
+    return _vec_string(
+        a, int_, 'find', [sub, start] + _clean_args(end))
+
+
+@array_function_dispatch(_count_dispatcher)
+def index(a, sub, start=0, end=None):
+    """
+    Like `find`, but raises `ValueError` when the substring is not found.
+
+    Calls `str.index` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    sub : str or unicode
+
+    start, end : int, optional
+
+    Returns
+    -------
+    out : ndarray
+        Output array of ints.  Returns -1 if `sub` is not found.
+
+    See also
+    --------
+    find, str.find
+
+    """
+    return _vec_string(
+        a, int_, 'index', [sub, start] + _clean_args(end))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isalnum(a):
+    """
+    Returns true for each element if all characters in the string are
+    alphanumeric and there is at least one character, false otherwise.
+
+    Calls `str.isalnum` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.isalnum
+    """
+    return _vec_string(a, bool_, 'isalnum')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isalpha(a):
+    """
+    Returns true for each element if all characters in the string are
+    alphabetic and there is at least one character, false otherwise.
+
+    Calls `str.isalpha` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.isalpha
+    """
+    return _vec_string(a, bool_, 'isalpha')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isdigit(a):
+    """
+    Returns true for each element if all characters in the string are
+    digits and there is at least one character, false otherwise.
+
+    Calls `str.isdigit` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.isdigit
+    """
+    return _vec_string(a, bool_, 'isdigit')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def islower(a):
+    """
+    Returns true for each element if all cased characters in the
+    string are lowercase and there is at least one cased character,
+    false otherwise.
+
+    Calls `str.islower` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.islower
+    """
+    return _vec_string(a, bool_, 'islower')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isspace(a):
+    """
+    Returns true for each element if there are only whitespace
+    characters in the string and there is at least one character,
+    false otherwise.
+
+    Calls `str.isspace` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.isspace
+    """
+    return _vec_string(a, bool_, 'isspace')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def istitle(a):
+    """
+    Returns true for each element if the element is a titlecased
+    string and there is at least one character, false otherwise.
+
+    Call `str.istitle` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.istitle
+    """
+    return _vec_string(a, bool_, 'istitle')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isupper(a):
+    """
+    Returns true for each element if all cased characters in the
+    string are uppercase and there is at least one character, false
+    otherwise.
+
+    Call `str.isupper` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of bools
+
+    See also
+    --------
+    str.isupper
+    """
+    return _vec_string(a, bool_, 'isupper')
+
+
+def _join_dispatcher(sep, seq):
+    return (sep, seq)
+
+
+@array_function_dispatch(_join_dispatcher)
+def join(sep, seq):
+    """
+    Return a string which is the concatenation of the strings in the
+    sequence `seq`.
+
+    Calls `str.join` element-wise.
+
+    Parameters
+    ----------
+    sep : array_like of str or unicode
+    seq : array_like of str or unicode
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input types
+
+    See also
+    --------
+    str.join
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(sep, object_, 'join', (seq,)))
+
+
+
+def _just_dispatcher(a, width, fillchar=None):
+    return (a,)
+
+
+@array_function_dispatch(_just_dispatcher)
+def ljust(a, width, fillchar=' '):
+    """
+    Return an array with the elements of `a` left-justified in a
+    string of length `width`.
+
+    Calls `str.ljust` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    width : int
+        The length of the resulting strings
+    fillchar : str or unicode, optional
+        The character to use for padding
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.ljust
+
+    """
+    a_arr = numpy.asarray(a)
+    width_arr = numpy.asarray(width)
+    size = int(numpy.max(width_arr.flat))
+    if numpy.issubdtype(a_arr.dtype, numpy.string_):
+        fillchar = asbytes(fillchar)
+    return _vec_string(
+        a_arr, (a_arr.dtype.type, size), 'ljust', (width_arr, fillchar))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def lower(a):
+    """
+    Return an array with the elements converted to lowercase.
+
+    Call `str.lower` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.lower
+
+    Examples
+    --------
+    >>> c = np.array(['A1B C', '1BCA', 'BCA1']); c
+    array(['A1B C', '1BCA', 'BCA1'], dtype='<U5')
+    >>> np.char.lower(c)
+    array(['a1b c', '1bca', 'bca1'], dtype='<U5')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'lower')
+
+
+def _strip_dispatcher(a, chars=None):
+    return (a,)
+
+
+@array_function_dispatch(_strip_dispatcher)
+def lstrip(a, chars=None):
+    """
+    For each element in `a`, return a copy with the leading characters
+    removed.
+
+    Calls `str.lstrip` element-wise.
+
+    Parameters
+    ----------
+    a : array-like, {str, unicode}
+        Input array.
+
+    chars : {str, unicode}, optional
+        The `chars` argument is a string specifying the set of
+        characters to be removed. If omitted or None, the `chars`
+        argument defaults to removing whitespace. The `chars` argument
+        is not a prefix; rather, all combinations of its values are
+        stripped.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.lstrip
+
+    Examples
+    --------
+    >>> c = np.array(['aAaAaA', '  aA  ', 'abBABba'])
+    >>> c
+    array(['aAaAaA', '  aA  ', 'abBABba'], dtype='<U7')
+
+    The 'a' variable is unstripped from c[1] because whitespace leading.
+
+    >>> np.char.lstrip(c, 'a')
+    array(['AaAaA', '  aA  ', 'bBABba'], dtype='<U7')
+
+
+    >>> np.char.lstrip(c, 'A') # leaves c unchanged
+    array(['aAaAaA', '  aA  ', 'abBABba'], dtype='<U7')
+    >>> (np.char.lstrip(c, ' ') == np.char.lstrip(c, '')).all()
+    ... # XXX: is this a regression? This used to return True
+    ... # np.char.lstrip(c,'') does not modify c at all.
+    False
+    >>> (np.char.lstrip(c, ' ') == np.char.lstrip(c, None)).all()
+    True
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'lstrip', (chars,))
+
+
+def _partition_dispatcher(a, sep):
+    return (a,)
+
+
+@array_function_dispatch(_partition_dispatcher)
+def partition(a, sep):
+    """
+    Partition each element in `a` around `sep`.
+
+    Calls `str.partition` element-wise.
+
+    For each element in `a`, split the element as the first
+    occurrence of `sep`, and return 3 strings containing the part
+    before the separator, the separator itself, and the part after
+    the separator. If the separator is not found, return 3 strings
+    containing the string itself, followed by two empty strings.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array
+    sep : {str, unicode}
+        Separator to split each string element in `a`.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type.
+        The output array will have an extra dimension with 3
+        elements per input element.
+
+    See also
+    --------
+    str.partition
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, 'partition', (sep,)))
+
+
+def _replace_dispatcher(a, old, new, count=None):
+    return (a,)
+
+
+@array_function_dispatch(_replace_dispatcher)
+def replace(a, old, new, count=None):
+    """
+    For each element in `a`, return a copy of the string with all
+    occurrences of substring `old` replaced by `new`.
+
+    Calls `str.replace` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    old, new : str or unicode
+
+    count : int, optional
+        If the optional argument `count` is given, only the first
+        `count` occurrences are replaced.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.replace
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(
+            a, object_, 'replace', [old, new] + _clean_args(count)))
+
+
+@array_function_dispatch(_count_dispatcher)
+def rfind(a, sub, start=0, end=None):
+    """
+    For each element in `a`, return the highest index in the string
+    where substring `sub` is found, such that `sub` is contained
+    within [`start`, `end`].
+
+    Calls `str.rfind` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    sub : str or unicode
+
+    start, end : int, optional
+        Optional arguments `start` and `end` are interpreted as in
+        slice notation.
+
+    Returns
+    -------
+    out : ndarray
+       Output array of ints.  Return -1 on failure.
+
+    See also
+    --------
+    str.rfind
+
+    """
+    return _vec_string(
+        a, int_, 'rfind', [sub, start] + _clean_args(end))
+
+
+@array_function_dispatch(_count_dispatcher)
+def rindex(a, sub, start=0, end=None):
+    """
+    Like `rfind`, but raises `ValueError` when the substring `sub` is
+    not found.
+
+    Calls `str.rindex` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    sub : str or unicode
+
+    start, end : int, optional
+
+    Returns
+    -------
+    out : ndarray
+       Output array of ints.
+
+    See also
+    --------
+    rfind, str.rindex
+
+    """
+    return _vec_string(
+        a, int_, 'rindex', [sub, start] + _clean_args(end))
+
+
+@array_function_dispatch(_just_dispatcher)
+def rjust(a, width, fillchar=' '):
+    """
+    Return an array with the elements of `a` right-justified in a
+    string of length `width`.
+
+    Calls `str.rjust` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    width : int
+        The length of the resulting strings
+    fillchar : str or unicode, optional
+        The character to use for padding
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.rjust
+
+    """
+    a_arr = numpy.asarray(a)
+    width_arr = numpy.asarray(width)
+    size = int(numpy.max(width_arr.flat))
+    if numpy.issubdtype(a_arr.dtype, numpy.string_):
+        fillchar = asbytes(fillchar)
+    return _vec_string(
+        a_arr, (a_arr.dtype.type, size), 'rjust', (width_arr, fillchar))
+
+
+@array_function_dispatch(_partition_dispatcher)
+def rpartition(a, sep):
+    """
+    Partition (split) each element around the right-most separator.
+
+    Calls `str.rpartition` element-wise.
+
+    For each element in `a`, split the element as the last
+    occurrence of `sep`, and return 3 strings containing the part
+    before the separator, the separator itself, and the part after
+    the separator. If the separator is not found, return 3 strings
+    containing the string itself, followed by two empty strings.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+        Input array
+    sep : str or unicode
+        Right-most separator to split each element in array.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of string or unicode, depending on input
+        type.  The output array will have an extra dimension with
+        3 elements per input element.
+
+    See also
+    --------
+    str.rpartition
+
+    """
+    return _to_string_or_unicode_array(
+        _vec_string(a, object_, 'rpartition', (sep,)))
+
+
+def _split_dispatcher(a, sep=None, maxsplit=None):
+    return (a,)
+
+
+@array_function_dispatch(_split_dispatcher)
+def rsplit(a, sep=None, maxsplit=None):
+    """
+    For each element in `a`, return a list of the words in the
+    string, using `sep` as the delimiter string.
+
+    Calls `str.rsplit` element-wise.
+
+    Except for splitting from the right, `rsplit`
+    behaves like `split`.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    sep : str or unicode, optional
+        If `sep` is not specified or None, any whitespace string
+        is a separator.
+    maxsplit : int, optional
+        If `maxsplit` is given, at most `maxsplit` splits are done,
+        the rightmost ones.
+
+    Returns
+    -------
+    out : ndarray
+       Array of list objects
+
+    See also
+    --------
+    str.rsplit, split
+
+    """
+    # This will return an array of lists of different sizes, so we
+    # leave it as an object array
+    return _vec_string(
+        a, object_, 'rsplit', [sep] + _clean_args(maxsplit))
+
+
+def _strip_dispatcher(a, chars=None):
+    return (a,)
+
+
+@array_function_dispatch(_strip_dispatcher)
+def rstrip(a, chars=None):
+    """
+    For each element in `a`, return a copy with the trailing
+    characters removed.
+
+    Calls `str.rstrip` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    chars : str or unicode, optional
+       The `chars` argument is a string specifying the set of
+       characters to be removed. If omitted or None, the `chars`
+       argument defaults to removing whitespace. The `chars` argument
+       is not a suffix; rather, all combinations of its values are
+       stripped.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.rstrip
+
+    Examples
+    --------
+    >>> c = np.array(['aAaAaA', 'abBABba'], dtype='S7'); c
+    array(['aAaAaA', 'abBABba'],
+        dtype='|S7')
+    >>> np.char.rstrip(c, b'a')
+    array(['aAaAaA', 'abBABb'],
+        dtype='|S7')
+    >>> np.char.rstrip(c, b'A')
+    array(['aAaAa', 'abBABba'],
+        dtype='|S7')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'rstrip', (chars,))
+
+
+@array_function_dispatch(_split_dispatcher)
+def split(a, sep=None, maxsplit=None):
+    """
+    For each element in `a`, return a list of the words in the
+    string, using `sep` as the delimiter string.
+
+    Calls `str.split` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    sep : str or unicode, optional
+       If `sep` is not specified or None, any whitespace string is a
+       separator.
+
+    maxsplit : int, optional
+        If `maxsplit` is given, at most `maxsplit` splits are done.
+
+    Returns
+    -------
+    out : ndarray
+        Array of list objects
+
+    See also
+    --------
+    str.split, rsplit
+
+    """
+    # This will return an array of lists of different sizes, so we
+    # leave it as an object array
+    return _vec_string(
+        a, object_, 'split', [sep] + _clean_args(maxsplit))
+
+
+def _splitlines_dispatcher(a, keepends=None):
+    return (a,)
+
+
+@array_function_dispatch(_splitlines_dispatcher)
+def splitlines(a, keepends=None):
+    """
+    For each element in `a`, return a list of the lines in the
+    element, breaking at line boundaries.
+
+    Calls `str.splitlines` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    keepends : bool, optional
+        Line breaks are not included in the resulting list unless
+        keepends is given and true.
+
+    Returns
+    -------
+    out : ndarray
+        Array of list objects
+
+    See also
+    --------
+    str.splitlines
+
+    """
+    return _vec_string(
+        a, object_, 'splitlines', _clean_args(keepends))
+
+
+def _startswith_dispatcher(a, prefix, start=None, end=None):
+    return (a,)
+
+
+@array_function_dispatch(_startswith_dispatcher)
+def startswith(a, prefix, start=0, end=None):
+    """
+    Returns a boolean array which is `True` where the string element
+    in `a` starts with `prefix`, otherwise `False`.
+
+    Calls `str.startswith` element-wise.
+
+    Parameters
+    ----------
+    a : array_like of str or unicode
+
+    prefix : str
+
+    start, end : int, optional
+        With optional `start`, test beginning at that position. With
+        optional `end`, stop comparing at that position.
+
+    Returns
+    -------
+    out : ndarray
+        Array of booleans
+
+    See also
+    --------
+    str.startswith
+
+    """
+    return _vec_string(
+        a, bool_, 'startswith', [prefix, start] + _clean_args(end))
+
+
+@array_function_dispatch(_strip_dispatcher)
+def strip(a, chars=None):
+    """
+    For each element in `a`, return a copy with the leading and
+    trailing characters removed.
+
+    Calls `str.strip` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    chars : str or unicode, optional
+       The `chars` argument is a string specifying the set of
+       characters to be removed. If omitted or None, the `chars`
+       argument defaults to removing whitespace. The `chars` argument
+       is not a prefix or suffix; rather, all combinations of its
+       values are stripped.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.strip
+
+    Examples
+    --------
+    >>> c = np.array(['aAaAaA', '  aA  ', 'abBABba'])
+    >>> c
+    array(['aAaAaA', '  aA  ', 'abBABba'], dtype='<U7')
+    >>> np.char.strip(c)
+    array(['aAaAaA', 'aA', 'abBABba'], dtype='<U7')
+    >>> np.char.strip(c, 'a') # 'a' unstripped from c[1] because whitespace leads
+    array(['AaAaA', '  aA  ', 'bBABb'], dtype='<U7')
+    >>> np.char.strip(c, 'A') # 'A' unstripped from c[1] because (unprinted) ws trails
+    array(['aAaAa', '  aA  ', 'abBABba'], dtype='<U7')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'strip', _clean_args(chars))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def swapcase(a):
+    """
+    Return element-wise a copy of the string with
+    uppercase characters converted to lowercase and vice versa.
+
+    Calls `str.swapcase` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.swapcase
+
+    Examples
+    --------
+    >>> c=np.array(['a1B c','1b Ca','b Ca1','cA1b'],'S5'); c
+    array(['a1B c', '1b Ca', 'b Ca1', 'cA1b'],
+        dtype='|S5')
+    >>> np.char.swapcase(c)
+    array(['A1b C', '1B cA', 'B cA1', 'Ca1B'],
+        dtype='|S5')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'swapcase')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def title(a):
+    """
+    Return element-wise title cased version of string or unicode.
+
+    Title case words start with uppercase characters, all remaining cased
+    characters are lowercase.
+
+    Calls `str.title` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array.
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.title
+
+    Examples
+    --------
+    >>> c=np.array(['a1b c','1b ca','b ca1','ca1b'],'S5'); c
+    array(['a1b c', '1b ca', 'b ca1', 'ca1b'],
+        dtype='|S5')
+    >>> np.char.title(c)
+    array(['A1B C', '1B Ca', 'B Ca1', 'Ca1B'],
+        dtype='|S5')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'title')
+
+
+def _translate_dispatcher(a, table, deletechars=None):
+    return (a,)
+
+
+@array_function_dispatch(_translate_dispatcher)
+def translate(a, table, deletechars=None):
+    """
+    For each element in `a`, return a copy of the string where all
+    characters occurring in the optional argument `deletechars` are
+    removed, and the remaining characters have been mapped through the
+    given translation table.
+
+    Calls `str.translate` element-wise.
+
+    Parameters
+    ----------
+    a : array-like of str or unicode
+
+    table : str of length 256
+
+    deletechars : str
+
+    Returns
+    -------
+    out : ndarray
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.translate
+
+    """
+    a_arr = numpy.asarray(a)
+    if issubclass(a_arr.dtype.type, unicode_):
+        return _vec_string(
+            a_arr, a_arr.dtype, 'translate', (table,))
+    else:
+        return _vec_string(
+            a_arr, a_arr.dtype, 'translate', [table] + _clean_args(deletechars))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def upper(a):
+    """
+    Return an array with the elements converted to uppercase.
+
+    Calls `str.upper` element-wise.
+
+    For 8-bit strings, this method is locale-dependent.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.upper
+
+    Examples
+    --------
+    >>> c = np.array(['a1b c', '1bca', 'bca1']); c
+    array(['a1b c', '1bca', 'bca1'], dtype='<U5')
+    >>> np.char.upper(c)
+    array(['A1B C', '1BCA', 'BCA1'], dtype='<U5')
+
+    """
+    a_arr = numpy.asarray(a)
+    return _vec_string(a_arr, a_arr.dtype, 'upper')
+
+
+def _zfill_dispatcher(a, width):
+    return (a,)
+
+
+@array_function_dispatch(_zfill_dispatcher)
+def zfill(a, width):
+    """
+    Return the numeric string left-filled with zeros
+
+    Calls `str.zfill` element-wise.
+
+    Parameters
+    ----------
+    a : array_like, {str, unicode}
+        Input array.
+    width : int
+        Width of string to left-fill elements in `a`.
+
+    Returns
+    -------
+    out : ndarray, {str, unicode}
+        Output array of str or unicode, depending on input type
+
+    See also
+    --------
+    str.zfill
+
+    """
+    a_arr = numpy.asarray(a)
+    width_arr = numpy.asarray(width)
+    size = int(numpy.max(width_arr.flat))
+    return _vec_string(
+        a_arr, (a_arr.dtype.type, size), 'zfill', (width_arr,))
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isnumeric(a):
+    """
+    For each element, return True if there are only numeric
+    characters in the element.
+
+    Calls `unicode.isnumeric` element-wise.
+
+    Numeric characters include digit characters, and all characters
+    that have the Unicode numeric value property, e.g. ``U+2155,
+    VULGAR FRACTION ONE FIFTH``.
+
+    Parameters
+    ----------
+    a : array_like, unicode
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, bool
+        Array of booleans of same shape as `a`.
+
+    See also
+    --------
+    unicode.isnumeric
+
+    """
+    if _use_unicode(a) != unicode_:
+        raise TypeError("isnumeric is only available for Unicode strings and arrays")
+    return _vec_string(a, bool_, 'isnumeric')
+
+
+@array_function_dispatch(_unary_op_dispatcher)
+def isdecimal(a):
+    """
+    For each element, return True if there are only decimal
+    characters in the element.
+
+    Calls `unicode.isdecimal` element-wise.
+
+    Decimal characters include digit characters, and all characters
+    that can be used to form decimal-radix numbers,
+    e.g. ``U+0660, ARABIC-INDIC DIGIT ZERO``.
+
+    Parameters
+    ----------
+    a : array_like, unicode
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, bool
+        Array of booleans identical in shape to `a`.
+
+    See also
+    --------
+    unicode.isdecimal
+
+    """
+    if _use_unicode(a) != unicode_:
+        raise TypeError("isnumeric is only available for Unicode strings and arrays")
+    return _vec_string(a, bool_, 'isdecimal')
+
+
+@set_module('numpy')
+class chararray(ndarray):
+    """
+    chararray(shape, itemsize=1, unicode=False, buffer=None, offset=0,
+              strides=None, order=None)
+
+    Provides a convenient view on arrays of string and unicode values.
+
+    .. note::
+       The `chararray` class exists for backwards compatibility with
+       Numarray, it is not recommended for new development. Starting from numpy
+       1.4, if one needs arrays of strings, it is recommended to use arrays of
+       `dtype` `object_`, `string_` or `unicode_`, and use the free functions
+       in the `numpy.char` module for fast vectorized string operations.
+
+    Versus a regular NumPy array of type `str` or `unicode`, this
+    class adds the following functionality:
+
+      1) values automatically have whitespace removed from the end
+         when indexed
+
+      2) comparison operators automatically remove whitespace from the
+         end when comparing values
+
+      3) vectorized string operations are provided as methods
+         (e.g. `.endswith`) and infix operators (e.g. ``"+", "*", "%"``)
+
+    chararrays should be created using `numpy.char.array` or
+    `numpy.char.asarray`, rather than this constructor directly.
+
+    This constructor creates the array, using `buffer` (with `offset`
+    and `strides`) if it is not ``None``. If `buffer` is ``None``, then
+    constructs a new array with `strides` in "C order", unless both
+    ``len(shape) >= 2`` and ``order='F'``, in which case `strides`
+    is in "Fortran order".
+
+    Methods
+    -------
+    astype
+    argsort
+    copy
+    count
+    decode
+    dump
+    dumps
+    encode
+    endswith
+    expandtabs
+    fill
+    find
+    flatten
+    getfield
+    index
+    isalnum
+    isalpha
+    isdecimal
+    isdigit
+    islower
+    isnumeric
+    isspace
+    istitle
+    isupper
+    item
+    join
+    ljust
+    lower
+    lstrip
+    nonzero
+    put
+    ravel
+    repeat
+    replace
+    reshape
+    resize
+    rfind
+    rindex
+    rjust
+    rsplit
+    rstrip
+    searchsorted
+    setfield
+    setflags
+    sort
+    split
+    splitlines
+    squeeze
+    startswith
+    strip
+    swapaxes
+    swapcase
+    take
+    title
+    tofile
+    tolist
+    tostring
+    translate
+    transpose
+    upper
+    view
+    zfill
+
+    Parameters
+    ----------
+    shape : tuple
+        Shape of the array.
+    itemsize : int, optional
+        Length of each array element, in number of characters. Default is 1.
+    unicode : bool, optional
+        Are the array elements of type unicode (True) or string (False).
+        Default is False.
+    buffer : object exposing the buffer interface or str, optional
+        Memory address of the start of the array data.  Default is None,
+        in which case a new array is created.
+    offset : int, optional
+        Fixed stride displacement from the beginning of an axis?
+        Default is 0. Needs to be >=0.
+    strides : array_like of ints, optional
+        Strides for the array (see `ndarray.strides` for full description).
+        Default is None.
+    order : {'C', 'F'}, optional
+        The order in which the array data is stored in memory: 'C' ->
+        "row major" order (the default), 'F' -> "column major"
+        (Fortran) order.
+
+    Examples
+    --------
+    >>> charar = np.chararray((3, 3))
+    >>> charar[:] = 'a'
+    >>> charar
+    chararray([[b'a', b'a', b'a'],
+               [b'a', b'a', b'a'],
+               [b'a', b'a', b'a']], dtype='|S1')
+
+    >>> charar = np.chararray(charar.shape, itemsize=5)
+    >>> charar[:] = 'abc'
+    >>> charar
+    chararray([[b'abc', b'abc', b'abc'],
+               [b'abc', b'abc', b'abc'],
+               [b'abc', b'abc', b'abc']], dtype='|S5')
+
+    """
+    def __new__(subtype, shape, itemsize=1, unicode=False, buffer=None,
+                offset=0, strides=None, order='C'):
+        global _globalvar
+
+        if unicode:
+            dtype = unicode_
+        else:
+            dtype = string_
+
+        # force itemsize to be a Python int, since using NumPy integer
+        # types results in itemsize.itemsize being used as the size of
+        # strings in the new array.
+        itemsize = int(itemsize)
+
+        if isinstance(buffer, str):
+            # unicode objects do not have the buffer interface
+            filler = buffer
+            buffer = None
+        else:
+            filler = None
+
+        _globalvar = 1
+        if buffer is None:
+            self = ndarray.__new__(subtype, shape, (dtype, itemsize),
+                                   order=order)
+        else:
+            self = ndarray.__new__(subtype, shape, (dtype, itemsize),
+                                   buffer=buffer,
+                                   offset=offset, strides=strides,
+                                   order=order)
+        if filler is not None:
+            self[...] = filler
+        _globalvar = 0
+        return self
+
+    def __array_finalize__(self, obj):
+        # The b is a special case because it is used for reconstructing.
+        if not _globalvar and self.dtype.char not in 'SUbc':
+            raise ValueError("Can only create a chararray from string data.")
+
+    def __getitem__(self, obj):
+        val = ndarray.__getitem__(self, obj)
+
+        if isinstance(val, character):
+            temp = val.rstrip()
+            if len(temp) == 0:
+                val = ''
+            else:
+                val = temp
+
+        return val
+
+    # IMPLEMENTATION NOTE: Most of the methods of this class are
+    # direct delegations to the free functions in this module.
+    # However, those that return an array of strings should instead
+    # return a chararray, so some extra wrapping is required.
+
+    def __eq__(self, other):
+        """
+        Return (self == other) element-wise.
+
+        See also
+        --------
+        equal
+        """
+        return equal(self, other)
+
+    def __ne__(self, other):
+        """
+        Return (self != other) element-wise.
+
+        See also
+        --------
+        not_equal
+        """
+        return not_equal(self, other)
+
+    def __ge__(self, other):
+        """
+        Return (self >= other) element-wise.
+
+        See also
+        --------
+        greater_equal
+        """
+        return greater_equal(self, other)
+
+    def __le__(self, other):
+        """
+        Return (self <= other) element-wise.
+
+        See also
+        --------
+        less_equal
+        """
+        return less_equal(self, other)
+
+    def __gt__(self, other):
+        """
+        Return (self > other) element-wise.
+
+        See also
+        --------
+        greater
+        """
+        return greater(self, other)
+
+    def __lt__(self, other):
+        """
+        Return (self < other) element-wise.
+
+        See also
+        --------
+        less
+        """
+        return less(self, other)
+
+    def __add__(self, other):
+        """
+        Return (self + other), that is string concatenation,
+        element-wise for a pair of array_likes of str or unicode.
+
+        See also
+        --------
+        add
+        """
+        return asarray(add(self, other))
+
+    def __radd__(self, other):
+        """
+        Return (other + self), that is string concatenation,
+        element-wise for a pair of array_likes of `string_` or `unicode_`.
+
+        See also
+        --------
+        add
+        """
+        return asarray(add(numpy.asarray(other), self))
+
+    def __mul__(self, i):
+        """
+        Return (self * i), that is string multiple concatenation,
+        element-wise.
+
+        See also
+        --------
+        multiply
+        """
+        return asarray(multiply(self, i))
+
+    def __rmul__(self, i):
+        """
+        Return (self * i), that is string multiple concatenation,
+        element-wise.
+
+        See also
+        --------
+        multiply
+        """
+        return asarray(multiply(self, i))
+
+    def __mod__(self, i):
+        """
+        Return (self % i), that is pre-Python 2.6 string formatting
+        (interpolation), element-wise for a pair of array_likes of `string_`
+        or `unicode_`.
+
+        See also
+        --------
+        mod
+        """
+        return asarray(mod(self, i))
+
+    def __rmod__(self, other):
+        return NotImplemented
+
+    def argsort(self, axis=-1, kind=None, order=None):
+        """
+        Return the indices that sort the array lexicographically.
+
+        For full documentation see `numpy.argsort`, for which this method is
+        in fact merely a "thin wrapper."
+
+        Examples
+        --------
+        >>> c = np.array(['a1b c', '1b ca', 'b ca1', 'Ca1b'], 'S5')
+        >>> c = c.view(np.chararray); c
+        chararray(['a1b c', '1b ca', 'b ca1', 'Ca1b'],
+              dtype='|S5')
+        >>> c[c.argsort()]
+        chararray(['1b ca', 'Ca1b', 'a1b c', 'b ca1'],
+              dtype='|S5')
+
+        """
+        return self.__array__().argsort(axis, kind, order)
+    argsort.__doc__ = ndarray.argsort.__doc__
+
+    def capitalize(self):
+        """
+        Return a copy of `self` with only the first character of each element
+        capitalized.
+
+        See also
+        --------
+        char.capitalize
+
+        """
+        return asarray(capitalize(self))
+
+    def center(self, width, fillchar=' '):
+        """
+        Return a copy of `self` with its elements centered in a
+        string of length `width`.
+
+        See also
+        --------
+        center
+        """
+        return asarray(center(self, width, fillchar))
+
+    def count(self, sub, start=0, end=None):
+        """
+        Returns an array with the number of non-overlapping occurrences of
+        substring `sub` in the range [`start`, `end`].
+
+        See also
+        --------
+        char.count
+
+        """
+        return count(self, sub, start, end)
+
+    def decode(self, encoding=None, errors=None):
+        """
+        Calls `str.decode` element-wise.
+
+        See also
+        --------
+        char.decode
+
+        """
+        return decode(self, encoding, errors)
+
+    def encode(self, encoding=None, errors=None):
+        """
+        Calls `str.encode` element-wise.
+
+        See also
+        --------
+        char.encode
+
+        """
+        return encode(self, encoding, errors)
+
+    def endswith(self, suffix, start=0, end=None):
+        """
+        Returns a boolean array which is `True` where the string element
+        in `self` ends with `suffix`, otherwise `False`.
+
+        See also
+        --------
+        char.endswith
+
+        """
+        return endswith(self, suffix, start, end)
+
+    def expandtabs(self, tabsize=8):
+        """
+        Return a copy of each string element where all tab characters are
+        replaced by one or more spaces.
+
+        See also
+        --------
+        char.expandtabs
+
+        """
+        return asarray(expandtabs(self, tabsize))
+
+    def find(self, sub, start=0, end=None):
+        """
+        For each element, return the lowest index in the string where
+        substring `sub` is found.
+
+        See also
+        --------
+        char.find
+
+        """
+        return find(self, sub, start, end)
+
+    def index(self, sub, start=0, end=None):
+        """
+        Like `find`, but raises `ValueError` when the substring is not found.
+
+        See also
+        --------
+        char.index
+
+        """
+        return index(self, sub, start, end)
+
+    def isalnum(self):
+        """
+        Returns true for each element if all characters in the string
+        are alphanumeric and there is at least one character, false
+        otherwise.
+
+        See also
+        --------
+        char.isalnum
+
+        """
+        return isalnum(self)
+
+    def isalpha(self):
+        """
+        Returns true for each element if all characters in the string
+        are alphabetic and there is at least one character, false
+        otherwise.
+
+        See also
+        --------
+        char.isalpha
+
+        """
+        return isalpha(self)
+
+    def isdigit(self):
+        """
+        Returns true for each element if all characters in the string are
+        digits and there is at least one character, false otherwise.
+
+        See also
+        --------
+        char.isdigit
+
+        """
+        return isdigit(self)
+
+    def islower(self):
+        """
+        Returns true for each element if all cased characters in the
+        string are lowercase and there is at least one cased character,
+        false otherwise.
+
+        See also
+        --------
+        char.islower
+
+        """
+        return islower(self)
+
+    def isspace(self):
+        """
+        Returns true for each element if there are only whitespace
+        characters in the string and there is at least one character,
+        false otherwise.
+
+        See also
+        --------
+        char.isspace
+
+        """
+        return isspace(self)
+
+    def istitle(self):
+        """
+        Returns true for each element if the element is a titlecased
+        string and there is at least one character, false otherwise.
+
+        See also
+        --------
+        char.istitle
+
+        """
+        return istitle(self)
+
+    def isupper(self):
+        """
+        Returns true for each element if all cased characters in the
+        string are uppercase and there is at least one character, false
+        otherwise.
+
+        See also
+        --------
+        char.isupper
+
+        """
+        return isupper(self)
+
+    def join(self, seq):
+        """
+        Return a string which is the concatenation of the strings in the
+        sequence `seq`.
+
+        See also
+        --------
+        char.join
+
+        """
+        return join(self, seq)
+
+    def ljust(self, width, fillchar=' '):
+        """
+        Return an array with the elements of `self` left-justified in a
+        string of length `width`.
+
+        See also
+        --------
+        char.ljust
+
+        """
+        return asarray(ljust(self, width, fillchar))
+
+    def lower(self):
+        """
+        Return an array with the elements of `self` converted to
+        lowercase.
+
+        See also
+        --------
+        char.lower
+
+        """
+        return asarray(lower(self))
+
+    def lstrip(self, chars=None):
+        """
+        For each element in `self`, return a copy with the leading characters
+        removed.
+
+        See also
+        --------
+        char.lstrip
+
+        """
+        return asarray(lstrip(self, chars))
+
+    def partition(self, sep):
+        """
+        Partition each element in `self` around `sep`.
+
+        See also
+        --------
+        partition
+        """
+        return asarray(partition(self, sep))
+
+    def replace(self, old, new, count=None):
+        """
+        For each element in `self`, return a copy of the string with all
+        occurrences of substring `old` replaced by `new`.
+
+        See also
+        --------
+        char.replace
+
+        """
+        return asarray(replace(self, old, new, count))
+
+    def rfind(self, sub, start=0, end=None):
+        """
+        For each element in `self`, return the highest index in the string
+        where substring `sub` is found, such that `sub` is contained
+        within [`start`, `end`].
+
+        See also
+        --------
+        char.rfind
+
+        """
+        return rfind(self, sub, start, end)
+
+    def rindex(self, sub, start=0, end=None):
+        """
+        Like `rfind`, but raises `ValueError` when the substring `sub` is
+        not found.
+
+        See also
+        --------
+        char.rindex
+
+        """
+        return rindex(self, sub, start, end)
+
+    def rjust(self, width, fillchar=' '):
+        """
+        Return an array with the elements of `self`
+        right-justified in a string of length `width`.
+
+        See also
+        --------
+        char.rjust
+
+        """
+        return asarray(rjust(self, width, fillchar))
+
+    def rpartition(self, sep):
+        """
+        Partition each element in `self` around `sep`.
+
+        See also
+        --------
+        rpartition
+        """
+        return asarray(rpartition(self, sep))
+
+    def rsplit(self, sep=None, maxsplit=None):
+        """
+        For each element in `self`, return a list of the words in
+        the string, using `sep` as the delimiter string.
+
+        See also
+        --------
+        char.rsplit
+
+        """
+        return rsplit(self, sep, maxsplit)
+
+    def rstrip(self, chars=None):
+        """
+        For each element in `self`, return a copy with the trailing
+        characters removed.
+
+        See also
+        --------
+        char.rstrip
+
+        """
+        return asarray(rstrip(self, chars))
+
+    def split(self, sep=None, maxsplit=None):
+        """
+        For each element in `self`, return a list of the words in the
+        string, using `sep` as the delimiter string.
+
+        See also
+        --------
+        char.split
+
+        """
+        return split(self, sep, maxsplit)
+
+    def splitlines(self, keepends=None):
+        """
+        For each element in `self`, return a list of the lines in the
+        element, breaking at line boundaries.
+
+        See also
+        --------
+        char.splitlines
+
+        """
+        return splitlines(self, keepends)
+
+    def startswith(self, prefix, start=0, end=None):
+        """
+        Returns a boolean array which is `True` where the string element
+        in `self` starts with `prefix`, otherwise `False`.
+
+        See also
+        --------
+        char.startswith
+
+        """
+        return startswith(self, prefix, start, end)
+
+    def strip(self, chars=None):
+        """
+        For each element in `self`, return a copy with the leading and
+        trailing characters removed.
+
+        See also
+        --------
+        char.strip
+
+        """
+        return asarray(strip(self, chars))
+
+    def swapcase(self):
+        """
+        For each element in `self`, return a copy of the string with
+        uppercase characters converted to lowercase and vice versa.
+
+        See also
+        --------
+        char.swapcase
+
+        """
+        return asarray(swapcase(self))
+
+    def title(self):
+        """
+        For each element in `self`, return a titlecased version of the
+        string: words start with uppercase characters, all remaining cased
+        characters are lowercase.
+
+        See also
+        --------
+        char.title
+
+        """
+        return asarray(title(self))
+
+    def translate(self, table, deletechars=None):
+        """
+        For each element in `self`, return a copy of the string where
+        all characters occurring in the optional argument
+        `deletechars` are removed, and the remaining characters have
+        been mapped through the given translation table.
+
+        See also
+        --------
+        char.translate
+
+        """
+        return asarray(translate(self, table, deletechars))
+
+    def upper(self):
+        """
+        Return an array with the elements of `self` converted to
+        uppercase.
+
+        See also
+        --------
+        char.upper
+
+        """
+        return asarray(upper(self))
+
+    def zfill(self, width):
+        """
+        Return the numeric string left-filled with zeros in a string of
+        length `width`.
+
+        See also
+        --------
+        char.zfill
+
+        """
+        return asarray(zfill(self, width))
+
+    def isnumeric(self):
+        """
+        For each element in `self`, return True if there are only
+        numeric characters in the element.
+
+        See also
+        --------
+        char.isnumeric
+
+        """
+        return isnumeric(self)
+
+    def isdecimal(self):
+        """
+        For each element in `self`, return True if there are only
+        decimal characters in the element.
+
+        See also
+        --------
+        char.isdecimal
+
+        """
+        return isdecimal(self)
+
+
+def array(obj, itemsize=None, copy=True, unicode=None, order=None):
+    """
+    Create a `chararray`.
+
+    .. note::
+       This class is provided for numarray backward-compatibility.
+       New code (not concerned with numarray compatibility) should use
+       arrays of type `string_` or `unicode_` and use the free functions
+       in :mod:`numpy.char <numpy.core.defchararray>` for fast
+       vectorized string operations instead.
+
+    Versus a regular NumPy array of type `str` or `unicode`, this
+    class adds the following functionality:
+
+      1) values automatically have whitespace removed from the end
+         when indexed
+
+      2) comparison operators automatically remove whitespace from the
+         end when comparing values
+
+      3) vectorized string operations are provided as methods
+         (e.g. `str.endswith`) and infix operators (e.g. ``+, *, %``)
+
+    Parameters
+    ----------
+    obj : array of str or unicode-like
+
+    itemsize : int, optional
+        `itemsize` is the number of characters per scalar in the
+        resulting array.  If `itemsize` is None, and `obj` is an
+        object array or a Python list, the `itemsize` will be
+        automatically determined.  If `itemsize` is provided and `obj`
+        is of type str or unicode, then the `obj` string will be
+        chunked into `itemsize` pieces.
+
+    copy : bool, optional
+        If true (default), then the object is copied.  Otherwise, a copy
+        will only be made if __array__ returns a copy, if obj is a
+        nested sequence, or if a copy is needed to satisfy any of the other
+        requirements (`itemsize`, unicode, `order`, etc.).
+
+    unicode : bool, optional
+        When true, the resulting `chararray` can contain Unicode
+        characters, when false only 8-bit characters.  If unicode is
+        None and `obj` is one of the following:
+
+          - a `chararray`,
+          - an ndarray of type `str` or `unicode`
+          - a Python str or unicode object,
+
+        then the unicode setting of the output array will be
+        automatically determined.
+
+    order : {'C', 'F', 'A'}, optional
+        Specify the order of the array.  If order is 'C' (default), then the
+        array will be in C-contiguous order (last-index varies the
+        fastest).  If order is 'F', then the returned array
+        will be in Fortran-contiguous order (first-index varies the
+        fastest).  If order is 'A', then the returned array may
+        be in any order (either C-, Fortran-contiguous, or even
+        discontiguous).
+    """
+    if isinstance(obj, (bytes, str)):
+        if unicode is None:
+            if isinstance(obj, str):
+                unicode = True
+            else:
+                unicode = False
+
+        if itemsize is None:
+            itemsize = len(obj)
+        shape = len(obj) // itemsize
+
+        return chararray(shape, itemsize=itemsize, unicode=unicode,
+                         buffer=obj, order=order)
+
+    if isinstance(obj, (list, tuple)):
+        obj = numpy.asarray(obj)
+
+    if isinstance(obj, ndarray) and issubclass(obj.dtype.type, character):
+        # If we just have a vanilla chararray, create a chararray
+        # view around it.
+        if not isinstance(obj, chararray):
+            obj = obj.view(chararray)
+
+        if itemsize is None:
+            itemsize = obj.itemsize
+            # itemsize is in 8-bit chars, so for Unicode, we need
+            # to divide by the size of a single Unicode character,
+            # which for NumPy is always 4
+            if issubclass(obj.dtype.type, unicode_):
+                itemsize //= 4
+
+        if unicode is None:
+            if issubclass(obj.dtype.type, unicode_):
+                unicode = True
+            else:
+                unicode = False
+
+        if unicode:
+            dtype = unicode_
+        else:
+            dtype = string_
+
+        if order is not None:
+            obj = numpy.asarray(obj, order=order)
+        if (copy or
+                (itemsize != obj.itemsize) or
+                (not unicode and isinstance(obj, unicode_)) or
+                (unicode and isinstance(obj, string_))):
+            obj = obj.astype((dtype, int(itemsize)))
+        return obj
+
+    if isinstance(obj, ndarray) and issubclass(obj.dtype.type, object):
+        if itemsize is None:
+            # Since no itemsize was specified, convert the input array to
+            # a list so the ndarray constructor will automatically
+            # determine the itemsize for us.
+            obj = obj.tolist()
+            # Fall through to the default case
+
+    if unicode:
+        dtype = unicode_
+    else:
+        dtype = string_
+
+    if itemsize is None:
+        val = narray(obj, dtype=dtype, order=order, subok=True)
+    else:
+        val = narray(obj, dtype=(dtype, itemsize), order=order, subok=True)
+    return val.view(chararray)
+
+
+def asarray(obj, itemsize=None, unicode=None, order=None):
+    """
+    Convert the input to a `chararray`, copying the data only if
+    necessary.
+
+    Versus a regular NumPy array of type `str` or `unicode`, this
+    class adds the following functionality:
+
+      1) values automatically have whitespace removed from the end
+         when indexed
+
+      2) comparison operators automatically remove whitespace from the
+         end when comparing values
+
+      3) vectorized string operations are provided as methods
+         (e.g. `str.endswith`) and infix operators (e.g. ``+``, ``*``,``%``)
+
+    Parameters
+    ----------
+    obj : array of str or unicode-like
+
+    itemsize : int, optional
+        `itemsize` is the number of characters per scalar in the
+        resulting array.  If `itemsize` is None, and `obj` is an
+        object array or a Python list, the `itemsize` will be
+        automatically determined.  If `itemsize` is provided and `obj`
+        is of type str or unicode, then the `obj` string will be
+        chunked into `itemsize` pieces.
+
+    unicode : bool, optional
+        When true, the resulting `chararray` can contain Unicode
+        characters, when false only 8-bit characters.  If unicode is
+        None and `obj` is one of the following:
+
+          - a `chararray`,
+          - an ndarray of type `str` or 'unicode`
+          - a Python str or unicode object,
+
+        then the unicode setting of the output array will be
+        automatically determined.
+
+    order : {'C', 'F'}, optional
+        Specify the order of the array.  If order is 'C' (default), then the
+        array will be in C-contiguous order (last-index varies the
+        fastest).  If order is 'F', then the returned array
+        will be in Fortran-contiguous order (first-index varies the
+        fastest).
+    """
+    return array(obj, itemsize, copy=False,
+                 unicode=unicode, order=order)
diff --git a/venv/Lib/site-packages/numpy/core/einsumfunc.py b/venv/Lib/site-packages/numpy/core/einsumfunc.py
new file mode 100644
index 000000000..c46ae173d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/einsumfunc.py
@@ -0,0 +1,1415 @@
+"""
+Implementation of optimized einsum.
+
+"""
+import itertools
+import operator
+
+from numpy.core.multiarray import c_einsum
+from numpy.core.numeric import asanyarray, tensordot
+from numpy.core.overrides import array_function_dispatch
+
+__all__ = ['einsum', 'einsum_path']
+
+einsum_symbols = 'abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ'
+einsum_symbols_set = set(einsum_symbols)
+
+
+def _flop_count(idx_contraction, inner, num_terms, size_dictionary):
+    """
+    Computes the number of FLOPS in the contraction.
+
+    Parameters
+    ----------
+    idx_contraction : iterable
+        The indices involved in the contraction
+    inner : bool
+        Does this contraction require an inner product?
+    num_terms : int
+        The number of terms in a contraction
+    size_dictionary : dict
+        The size of each of the indices in idx_contraction
+
+    Returns
+    -------
+    flop_count : int
+        The total number of FLOPS required for the contraction.
+
+    Examples
+    --------
+
+    >>> _flop_count('abc', False, 1, {'a': 2, 'b':3, 'c':5})
+    30
+
+    >>> _flop_count('abc', True, 2, {'a': 2, 'b':3, 'c':5})
+    60
+
+    """
+
+    overall_size = _compute_size_by_dict(idx_contraction, size_dictionary)
+    op_factor = max(1, num_terms - 1)
+    if inner:
+        op_factor += 1
+
+    return overall_size * op_factor
+
+def _compute_size_by_dict(indices, idx_dict):
+    """
+    Computes the product of the elements in indices based on the dictionary
+    idx_dict.
+
+    Parameters
+    ----------
+    indices : iterable
+        Indices to base the product on.
+    idx_dict : dictionary
+        Dictionary of index sizes
+
+    Returns
+    -------
+    ret : int
+        The resulting product.
+
+    Examples
+    --------
+    >>> _compute_size_by_dict('abbc', {'a': 2, 'b':3, 'c':5})
+    90
+
+    """
+    ret = 1
+    for i in indices:
+        ret *= idx_dict[i]
+    return ret
+
+
+def _find_contraction(positions, input_sets, output_set):
+    """
+    Finds the contraction for a given set of input and output sets.
+
+    Parameters
+    ----------
+    positions : iterable
+        Integer positions of terms used in the contraction.
+    input_sets : list
+        List of sets that represent the lhs side of the einsum subscript
+    output_set : set
+        Set that represents the rhs side of the overall einsum subscript
+
+    Returns
+    -------
+    new_result : set
+        The indices of the resulting contraction
+    remaining : list
+        List of sets that have not been contracted, the new set is appended to
+        the end of this list
+    idx_removed : set
+        Indices removed from the entire contraction
+    idx_contraction : set
+        The indices used in the current contraction
+
+    Examples
+    --------
+
+    # A simple dot product test case
+    >>> pos = (0, 1)
+    >>> isets = [set('ab'), set('bc')]
+    >>> oset = set('ac')
+    >>> _find_contraction(pos, isets, oset)
+    ({'a', 'c'}, [{'a', 'c'}], {'b'}, {'a', 'b', 'c'})
+
+    # A more complex case with additional terms in the contraction
+    >>> pos = (0, 2)
+    >>> isets = [set('abd'), set('ac'), set('bdc')]
+    >>> oset = set('ac')
+    >>> _find_contraction(pos, isets, oset)
+    ({'a', 'c'}, [{'a', 'c'}, {'a', 'c'}], {'b', 'd'}, {'a', 'b', 'c', 'd'})
+    """
+
+    idx_contract = set()
+    idx_remain = output_set.copy()
+    remaining = []
+    for ind, value in enumerate(input_sets):
+        if ind in positions:
+            idx_contract |= value
+        else:
+            remaining.append(value)
+            idx_remain |= value
+
+    new_result = idx_remain & idx_contract
+    idx_removed = (idx_contract - new_result)
+    remaining.append(new_result)
+
+    return (new_result, remaining, idx_removed, idx_contract)
+
+
+def _optimal_path(input_sets, output_set, idx_dict, memory_limit):
+    """
+    Computes all possible pair contractions, sieves the results based
+    on ``memory_limit`` and returns the lowest cost path. This algorithm
+    scales factorial with respect to the elements in the list ``input_sets``.
+
+    Parameters
+    ----------
+    input_sets : list
+        List of sets that represent the lhs side of the einsum subscript
+    output_set : set
+        Set that represents the rhs side of the overall einsum subscript
+    idx_dict : dictionary
+        Dictionary of index sizes
+    memory_limit : int
+        The maximum number of elements in a temporary array
+
+    Returns
+    -------
+    path : list
+        The optimal contraction order within the memory limit constraint.
+
+    Examples
+    --------
+    >>> isets = [set('abd'), set('ac'), set('bdc')]
+    >>> oset = set()
+    >>> idx_sizes = {'a': 1, 'b':2, 'c':3, 'd':4}
+    >>> _optimal_path(isets, oset, idx_sizes, 5000)
+    [(0, 2), (0, 1)]
+    """
+
+    full_results = [(0, [], input_sets)]
+    for iteration in range(len(input_sets) - 1):
+        iter_results = []
+
+        # Compute all unique pairs
+        for curr in full_results:
+            cost, positions, remaining = curr
+            for con in itertools.combinations(range(len(input_sets) - iteration), 2):
+
+                # Find the contraction
+                cont = _find_contraction(con, remaining, output_set)
+                new_result, new_input_sets, idx_removed, idx_contract = cont
+
+                # Sieve the results based on memory_limit
+                new_size = _compute_size_by_dict(new_result, idx_dict)
+                if new_size > memory_limit:
+                    continue
+
+                # Build (total_cost, positions, indices_remaining)
+                total_cost =  cost + _flop_count(idx_contract, idx_removed, len(con), idx_dict)
+                new_pos = positions + [con]
+                iter_results.append((total_cost, new_pos, new_input_sets))
+
+        # Update combinatorial list, if we did not find anything return best
+        # path + remaining contractions
+        if iter_results:
+            full_results = iter_results
+        else:
+            path = min(full_results, key=lambda x: x[0])[1]
+            path += [tuple(range(len(input_sets) - iteration))]
+            return path
+
+    # If we have not found anything return single einsum contraction
+    if len(full_results) == 0:
+        return [tuple(range(len(input_sets)))]
+
+    path = min(full_results, key=lambda x: x[0])[1]
+    return path
+
+def _parse_possible_contraction(positions, input_sets, output_set, idx_dict, memory_limit, path_cost, naive_cost):
+    """Compute the cost (removed size + flops) and resultant indices for
+    performing the contraction specified by ``positions``.
+
+    Parameters
+    ----------
+    positions : tuple of int
+        The locations of the proposed tensors to contract.
+    input_sets : list of sets
+        The indices found on each tensors.
+    output_set : set
+        The output indices of the expression.
+    idx_dict : dict
+        Mapping of each index to its size.
+    memory_limit : int
+        The total allowed size for an intermediary tensor.
+    path_cost : int
+        The contraction cost so far.
+    naive_cost : int
+        The cost of the unoptimized expression.
+
+    Returns
+    -------
+    cost : (int, int)
+        A tuple containing the size of any indices removed, and the flop cost.
+    positions : tuple of int
+        The locations of the proposed tensors to contract.
+    new_input_sets : list of sets
+        The resulting new list of indices if this proposed contraction is performed.
+
+    """
+
+    # Find the contraction
+    contract = _find_contraction(positions, input_sets, output_set)
+    idx_result, new_input_sets, idx_removed, idx_contract = contract
+
+    # Sieve the results based on memory_limit
+    new_size = _compute_size_by_dict(idx_result, idx_dict)
+    if new_size > memory_limit:
+        return None
+
+    # Build sort tuple
+    old_sizes = (_compute_size_by_dict(input_sets[p], idx_dict) for p in positions)
+    removed_size = sum(old_sizes) - new_size
+
+    # NB: removed_size used to be just the size of any removed indices i.e.:
+    #     helpers.compute_size_by_dict(idx_removed, idx_dict)
+    cost = _flop_count(idx_contract, idx_removed, len(positions), idx_dict)
+    sort = (-removed_size, cost)
+
+    # Sieve based on total cost as well
+    if (path_cost + cost) > naive_cost:
+        return None
+
+    # Add contraction to possible choices
+    return [sort, positions, new_input_sets]
+
+
+def _update_other_results(results, best):
+    """Update the positions and provisional input_sets of ``results`` based on
+    performing the contraction result ``best``. Remove any involving the tensors
+    contracted.
+
+    Parameters
+    ----------
+    results : list
+        List of contraction results produced by ``_parse_possible_contraction``.
+    best : list
+        The best contraction of ``results`` i.e. the one that will be performed.
+
+    Returns
+    -------
+    mod_results : list
+        The list of modified results, updated with outcome of ``best`` contraction.
+    """
+
+    best_con = best[1]
+    bx, by = best_con
+    mod_results = []
+
+    for cost, (x, y), con_sets in results:
+
+        # Ignore results involving tensors just contracted
+        if x in best_con or y in best_con:
+            continue
+
+        # Update the input_sets
+        del con_sets[by - int(by > x) - int(by > y)]
+        del con_sets[bx - int(bx > x) - int(bx > y)]
+        con_sets.insert(-1, best[2][-1])
+
+        # Update the position indices
+        mod_con = x - int(x > bx) - int(x > by), y - int(y > bx) - int(y > by)
+        mod_results.append((cost, mod_con, con_sets))
+
+    return mod_results
+
+def _greedy_path(input_sets, output_set, idx_dict, memory_limit):
+    """
+    Finds the path by contracting the best pair until the input list is
+    exhausted. The best pair is found by minimizing the tuple
+    ``(-prod(indices_removed), cost)``.  What this amounts to is prioritizing
+    matrix multiplication or inner product operations, then Hadamard like
+    operations, and finally outer operations. Outer products are limited by
+    ``memory_limit``. This algorithm scales cubically with respect to the
+    number of elements in the list ``input_sets``.
+
+    Parameters
+    ----------
+    input_sets : list
+        List of sets that represent the lhs side of the einsum subscript
+    output_set : set
+        Set that represents the rhs side of the overall einsum subscript
+    idx_dict : dictionary
+        Dictionary of index sizes
+    memory_limit_limit : int
+        The maximum number of elements in a temporary array
+
+    Returns
+    -------
+    path : list
+        The greedy contraction order within the memory limit constraint.
+
+    Examples
+    --------
+    >>> isets = [set('abd'), set('ac'), set('bdc')]
+    >>> oset = set()
+    >>> idx_sizes = {'a': 1, 'b':2, 'c':3, 'd':4}
+    >>> _greedy_path(isets, oset, idx_sizes, 5000)
+    [(0, 2), (0, 1)]
+    """
+
+    # Handle trivial cases that leaked through
+    if len(input_sets) == 1:
+        return [(0,)]
+    elif len(input_sets) == 2:
+        return [(0, 1)]
+
+    # Build up a naive cost
+    contract = _find_contraction(range(len(input_sets)), input_sets, output_set)
+    idx_result, new_input_sets, idx_removed, idx_contract = contract
+    naive_cost = _flop_count(idx_contract, idx_removed, len(input_sets), idx_dict)
+
+    # Initially iterate over all pairs
+    comb_iter = itertools.combinations(range(len(input_sets)), 2)
+    known_contractions = []
+
+    path_cost = 0
+    path = []
+
+    for iteration in range(len(input_sets) - 1):
+
+        # Iterate over all pairs on first step, only previously found pairs on subsequent steps
+        for positions in comb_iter:
+
+            # Always initially ignore outer products
+            if input_sets[positions[0]].isdisjoint(input_sets[positions[1]]):
+                continue
+
+            result = _parse_possible_contraction(positions, input_sets, output_set, idx_dict, memory_limit, path_cost,
+                                                 naive_cost)
+            if result is not None:
+                known_contractions.append(result)
+
+        # If we do not have a inner contraction, rescan pairs including outer products
+        if len(known_contractions) == 0:
+
+            # Then check the outer products
+            for positions in itertools.combinations(range(len(input_sets)), 2):
+                result = _parse_possible_contraction(positions, input_sets, output_set, idx_dict, memory_limit,
+                                                     path_cost, naive_cost)
+                if result is not None:
+                    known_contractions.append(result)
+
+            # If we still did not find any remaining contractions, default back to einsum like behavior
+            if len(known_contractions) == 0:
+                path.append(tuple(range(len(input_sets))))
+                break
+
+        # Sort based on first index
+        best = min(known_contractions, key=lambda x: x[0])
+
+        # Now propagate as many unused contractions as possible to next iteration
+        known_contractions = _update_other_results(known_contractions, best)
+
+        # Next iteration only compute contractions with the new tensor
+        # All other contractions have been accounted for
+        input_sets = best[2]
+        new_tensor_pos = len(input_sets) - 1
+        comb_iter = ((i, new_tensor_pos) for i in range(new_tensor_pos))
+
+        # Update path and total cost
+        path.append(best[1])
+        path_cost += best[0][1]
+
+    return path
+
+
+def _can_dot(inputs, result, idx_removed):
+    """
+    Checks if we can use BLAS (np.tensordot) call and its beneficial to do so.
+
+    Parameters
+    ----------
+    inputs : list of str
+        Specifies the subscripts for summation.
+    result : str
+        Resulting summation.
+    idx_removed : set
+        Indices that are removed in the summation
+
+
+    Returns
+    -------
+    type : bool
+        Returns true if BLAS should and can be used, else False
+
+    Notes
+    -----
+    If the operations is BLAS level 1 or 2 and is not already aligned
+    we default back to einsum as the memory movement to copy is more
+    costly than the operation itself.
+
+
+    Examples
+    --------
+
+    # Standard GEMM operation
+    >>> _can_dot(['ij', 'jk'], 'ik', set('j'))
+    True
+
+    # Can use the standard BLAS, but requires odd data movement
+    >>> _can_dot(['ijj', 'jk'], 'ik', set('j'))
+    False
+
+    # DDOT where the memory is not aligned
+    >>> _can_dot(['ijk', 'ikj'], '', set('ijk'))
+    False
+
+    """
+
+    # All `dot` calls remove indices
+    if len(idx_removed) == 0:
+        return False
+
+    # BLAS can only handle two operands
+    if len(inputs) != 2:
+        return False
+
+    input_left, input_right = inputs
+
+    for c in set(input_left + input_right):
+        # can't deal with repeated indices on same input or more than 2 total
+        nl, nr = input_left.count(c), input_right.count(c)
+        if (nl > 1) or (nr > 1) or (nl + nr > 2):
+            return False
+
+        # can't do implicit summation or dimension collapse e.g.
+        #     "ab,bc->c" (implicitly sum over 'a')
+        #     "ab,ca->ca" (take diagonal of 'a')
+        if nl + nr - 1 == int(c in result):
+            return False
+
+    # Build a few temporaries
+    set_left = set(input_left)
+    set_right = set(input_right)
+    keep_left = set_left - idx_removed
+    keep_right = set_right - idx_removed
+    rs = len(idx_removed)
+
+    # At this point we are a DOT, GEMV, or GEMM operation
+
+    # Handle inner products
+
+    # DDOT with aligned data
+    if input_left == input_right:
+        return True
+
+    # DDOT without aligned data (better to use einsum)
+    if set_left == set_right:
+        return False
+
+    # Handle the 4 possible (aligned) GEMV or GEMM cases
+
+    # GEMM or GEMV no transpose
+    if input_left[-rs:] == input_right[:rs]:
+        return True
+
+    # GEMM or GEMV transpose both
+    if input_left[:rs] == input_right[-rs:]:
+        return True
+
+    # GEMM or GEMV transpose right
+    if input_left[-rs:] == input_right[-rs:]:
+        return True
+
+    # GEMM or GEMV transpose left
+    if input_left[:rs] == input_right[:rs]:
+        return True
+
+    # Einsum is faster than GEMV if we have to copy data
+    if not keep_left or not keep_right:
+        return False
+
+    # We are a matrix-matrix product, but we need to copy data
+    return True
+
+
+def _parse_einsum_input(operands):
+    """
+    A reproduction of einsum c side einsum parsing in python.
+
+    Returns
+    -------
+    input_strings : str
+        Parsed input strings
+    output_string : str
+        Parsed output string
+    operands : list of array_like
+        The operands to use in the numpy contraction
+
+    Examples
+    --------
+    The operand list is simplified to reduce printing:
+
+    >>> np.random.seed(123)
+    >>> a = np.random.rand(4, 4)
+    >>> b = np.random.rand(4, 4, 4)
+    >>> _parse_einsum_input(('...a,...a->...', a, b))
+    ('za,xza', 'xz', [a, b]) # may vary
+
+    >>> _parse_einsum_input((a, [Ellipsis, 0], b, [Ellipsis, 0]))
+    ('za,xza', 'xz', [a, b]) # may vary
+    """
+
+    if len(operands) == 0:
+        raise ValueError("No input operands")
+
+    if isinstance(operands[0], str):
+        subscripts = operands[0].replace(" ", "")
+        operands = [asanyarray(v) for v in operands[1:]]
+
+        # Ensure all characters are valid
+        for s in subscripts:
+            if s in '.,->':
+                continue
+            if s not in einsum_symbols:
+                raise ValueError("Character %s is not a valid symbol." % s)
+
+    else:
+        tmp_operands = list(operands)
+        operand_list = []
+        subscript_list = []
+        for p in range(len(operands) // 2):
+            operand_list.append(tmp_operands.pop(0))
+            subscript_list.append(tmp_operands.pop(0))
+
+        output_list = tmp_operands[-1] if len(tmp_operands) else None
+        operands = [asanyarray(v) for v in operand_list]
+        subscripts = ""
+        last = len(subscript_list) - 1
+        for num, sub in enumerate(subscript_list):
+            for s in sub:
+                if s is Ellipsis:
+                    subscripts += "..."
+                else:
+                    try:
+                        s = operator.index(s)
+                    except TypeError as e:
+                        raise TypeError("For this input type lists must contain "
+                                        "either int or Ellipsis") from e
+                    subscripts += einsum_symbols[s]
+            if num != last:
+                subscripts += ","
+
+        if output_list is not None:
+            subscripts += "->"
+            for s in output_list:
+                if s is Ellipsis:
+                    subscripts += "..."
+                else:
+                    try:
+                        s = operator.index(s)
+                    except TypeError as e:
+                        raise TypeError("For this input type lists must contain "
+                                        "either int or Ellipsis") from e
+                    subscripts += einsum_symbols[s]
+    # Check for proper "->"
+    if ("-" in subscripts) or (">" in subscripts):
+        invalid = (subscripts.count("-") > 1) or (subscripts.count(">") > 1)
+        if invalid or (subscripts.count("->") != 1):
+            raise ValueError("Subscripts can only contain one '->'.")
+
+    # Parse ellipses
+    if "." in subscripts:
+        used = subscripts.replace(".", "").replace(",", "").replace("->", "")
+        unused = list(einsum_symbols_set - set(used))
+        ellipse_inds = "".join(unused)
+        longest = 0
+
+        if "->" in subscripts:
+            input_tmp, output_sub = subscripts.split("->")
+            split_subscripts = input_tmp.split(",")
+            out_sub = True
+        else:
+            split_subscripts = subscripts.split(',')
+            out_sub = False
+
+        for num, sub in enumerate(split_subscripts):
+            if "." in sub:
+                if (sub.count(".") != 3) or (sub.count("...") != 1):
+                    raise ValueError("Invalid Ellipses.")
+
+                # Take into account numerical values
+                if operands[num].shape == ():
+                    ellipse_count = 0
+                else:
+                    ellipse_count = max(operands[num].ndim, 1)
+                    ellipse_count -= (len(sub) - 3)
+
+                if ellipse_count > longest:
+                    longest = ellipse_count
+
+                if ellipse_count < 0:
+                    raise ValueError("Ellipses lengths do not match.")
+                elif ellipse_count == 0:
+                    split_subscripts[num] = sub.replace('...', '')
+                else:
+                    rep_inds = ellipse_inds[-ellipse_count:]
+                    split_subscripts[num] = sub.replace('...', rep_inds)
+
+        subscripts = ",".join(split_subscripts)
+        if longest == 0:
+            out_ellipse = ""
+        else:
+            out_ellipse = ellipse_inds[-longest:]
+
+        if out_sub:
+            subscripts += "->" + output_sub.replace("...", out_ellipse)
+        else:
+            # Special care for outputless ellipses
+            output_subscript = ""
+            tmp_subscripts = subscripts.replace(",", "")
+            for s in sorted(set(tmp_subscripts)):
+                if s not in (einsum_symbols):
+                    raise ValueError("Character %s is not a valid symbol." % s)
+                if tmp_subscripts.count(s) == 1:
+                    output_subscript += s
+            normal_inds = ''.join(sorted(set(output_subscript) -
+                                         set(out_ellipse)))
+
+            subscripts += "->" + out_ellipse + normal_inds
+
+    # Build output string if does not exist
+    if "->" in subscripts:
+        input_subscripts, output_subscript = subscripts.split("->")
+    else:
+        input_subscripts = subscripts
+        # Build output subscripts
+        tmp_subscripts = subscripts.replace(",", "")
+        output_subscript = ""
+        for s in sorted(set(tmp_subscripts)):
+            if s not in einsum_symbols:
+                raise ValueError("Character %s is not a valid symbol." % s)
+            if tmp_subscripts.count(s) == 1:
+                output_subscript += s
+
+    # Make sure output subscripts are in the input
+    for char in output_subscript:
+        if char not in input_subscripts:
+            raise ValueError("Output character %s did not appear in the input"
+                             % char)
+
+    # Make sure number operands is equivalent to the number of terms
+    if len(input_subscripts.split(',')) != len(operands):
+        raise ValueError("Number of einsum subscripts must be equal to the "
+                         "number of operands.")
+
+    return (input_subscripts, output_subscript, operands)
+
+
+def _einsum_path_dispatcher(*operands, optimize=None, einsum_call=None):
+    # NOTE: technically, we should only dispatch on array-like arguments, not
+    # subscripts (given as strings). But separating operands into
+    # arrays/subscripts is a little tricky/slow (given einsum's two supported
+    # signatures), so as a practical shortcut we dispatch on everything.
+    # Strings will be ignored for dispatching since they don't define
+    # __array_function__.
+    return operands
+
+
+@array_function_dispatch(_einsum_path_dispatcher, module='numpy')
+def einsum_path(*operands, optimize='greedy', einsum_call=False):
+    """
+    einsum_path(subscripts, *operands, optimize='greedy')
+
+    Evaluates the lowest cost contraction order for an einsum expression by
+    considering the creation of intermediate arrays.
+
+    Parameters
+    ----------
+    subscripts : str
+        Specifies the subscripts for summation.
+    *operands : list of array_like
+        These are the arrays for the operation.
+    optimize : {bool, list, tuple, 'greedy', 'optimal'}
+        Choose the type of path. If a tuple is provided, the second argument is
+        assumed to be the maximum intermediate size created. If only a single
+        argument is provided the largest input or output array size is used
+        as a maximum intermediate size.
+
+        * if a list is given that starts with ``einsum_path``, uses this as the
+          contraction path
+        * if False no optimization is taken
+        * if True defaults to the 'greedy' algorithm
+        * 'optimal' An algorithm that combinatorially explores all possible
+          ways of contracting the listed tensors and choosest the least costly
+          path. Scales exponentially with the number of terms in the
+          contraction.
+        * 'greedy' An algorithm that chooses the best pair contraction
+          at each step. Effectively, this algorithm searches the largest inner,
+          Hadamard, and then outer products at each step. Scales cubically with
+          the number of terms in the contraction. Equivalent to the 'optimal'
+          path for most contractions.
+
+        Default is 'greedy'.
+
+    Returns
+    -------
+    path : list of tuples
+        A list representation of the einsum path.
+    string_repr : str
+        A printable representation of the einsum path.
+
+    Notes
+    -----
+    The resulting path indicates which terms of the input contraction should be
+    contracted first, the result of this contraction is then appended to the
+    end of the contraction list. This list can then be iterated over until all
+    intermediate contractions are complete.
+
+    See Also
+    --------
+    einsum, linalg.multi_dot
+
+    Examples
+    --------
+
+    We can begin with a chain dot example. In this case, it is optimal to
+    contract the ``b`` and ``c`` tensors first as represented by the first
+    element of the path ``(1, 2)``. The resulting tensor is added to the end
+    of the contraction and the remaining contraction ``(0, 1)`` is then
+    completed.
+
+    >>> np.random.seed(123)
+    >>> a = np.random.rand(2, 2)
+    >>> b = np.random.rand(2, 5)
+    >>> c = np.random.rand(5, 2)
+    >>> path_info = np.einsum_path('ij,jk,kl->il', a, b, c, optimize='greedy')
+    >>> print(path_info[0])
+    ['einsum_path', (1, 2), (0, 1)]
+    >>> print(path_info[1])
+      Complete contraction:  ij,jk,kl->il # may vary
+             Naive scaling:  4
+         Optimized scaling:  3
+          Naive FLOP count:  1.600e+02
+      Optimized FLOP count:  5.600e+01
+       Theoretical speedup:  2.857
+      Largest intermediate:  4.000e+00 elements
+    -------------------------------------------------------------------------
+    scaling                  current                                remaining
+    -------------------------------------------------------------------------
+       3                   kl,jk->jl                                ij,jl->il
+       3                   jl,ij->il                                   il->il
+
+
+    A more complex index transformation example.
+
+    >>> I = np.random.rand(10, 10, 10, 10)
+    >>> C = np.random.rand(10, 10)
+    >>> path_info = np.einsum_path('ea,fb,abcd,gc,hd->efgh', C, C, I, C, C,
+    ...                            optimize='greedy')
+
+    >>> print(path_info[0])
+    ['einsum_path', (0, 2), (0, 3), (0, 2), (0, 1)]
+    >>> print(path_info[1]) 
+      Complete contraction:  ea,fb,abcd,gc,hd->efgh # may vary
+             Naive scaling:  8
+         Optimized scaling:  5
+          Naive FLOP count:  8.000e+08
+      Optimized FLOP count:  8.000e+05
+       Theoretical speedup:  1000.000
+      Largest intermediate:  1.000e+04 elements
+    --------------------------------------------------------------------------
+    scaling                  current                                remaining
+    --------------------------------------------------------------------------
+       5               abcd,ea->bcde                      fb,gc,hd,bcde->efgh
+       5               bcde,fb->cdef                         gc,hd,cdef->efgh
+       5               cdef,gc->defg                            hd,defg->efgh
+       5               defg,hd->efgh                               efgh->efgh
+    """
+
+    # Figure out what the path really is
+    path_type = optimize
+    if path_type is True:
+        path_type = 'greedy'
+    if path_type is None:
+        path_type = False
+
+    memory_limit = None
+
+    # No optimization or a named path algorithm
+    if (path_type is False) or isinstance(path_type, str):
+        pass
+
+    # Given an explicit path
+    elif len(path_type) and (path_type[0] == 'einsum_path'):
+        pass
+
+    # Path tuple with memory limit
+    elif ((len(path_type) == 2) and isinstance(path_type[0], str) and
+            isinstance(path_type[1], (int, float))):
+        memory_limit = int(path_type[1])
+        path_type = path_type[0]
+
+    else:
+        raise TypeError("Did not understand the path: %s" % str(path_type))
+
+    # Hidden option, only einsum should call this
+    einsum_call_arg = einsum_call
+
+    # Python side parsing
+    input_subscripts, output_subscript, operands = _parse_einsum_input(operands)
+
+    # Build a few useful list and sets
+    input_list = input_subscripts.split(',')
+    input_sets = [set(x) for x in input_list]
+    output_set = set(output_subscript)
+    indices = set(input_subscripts.replace(',', ''))
+
+    # Get length of each unique dimension and ensure all dimensions are correct
+    dimension_dict = {}
+    broadcast_indices = [[] for x in range(len(input_list))]
+    for tnum, term in enumerate(input_list):
+        sh = operands[tnum].shape
+        if len(sh) != len(term):
+            raise ValueError("Einstein sum subscript %s does not contain the "
+                             "correct number of indices for operand %d."
+                             % (input_subscripts[tnum], tnum))
+        for cnum, char in enumerate(term):
+            dim = sh[cnum]
+
+            # Build out broadcast indices
+            if dim == 1:
+                broadcast_indices[tnum].append(char)
+
+            if char in dimension_dict.keys():
+                # For broadcasting cases we always want the largest dim size
+                if dimension_dict[char] == 1:
+                    dimension_dict[char] = dim
+                elif dim not in (1, dimension_dict[char]):
+                    raise ValueError("Size of label '%s' for operand %d (%d) "
+                                     "does not match previous terms (%d)."
+                                     % (char, tnum, dimension_dict[char], dim))
+            else:
+                dimension_dict[char] = dim
+
+    # Convert broadcast inds to sets
+    broadcast_indices = [set(x) for x in broadcast_indices]
+
+    # Compute size of each input array plus the output array
+    size_list = [_compute_size_by_dict(term, dimension_dict)
+                 for term in input_list + [output_subscript]]
+    max_size = max(size_list)
+
+    if memory_limit is None:
+        memory_arg = max_size
+    else:
+        memory_arg = memory_limit
+
+    # Compute naive cost
+    # This isn't quite right, need to look into exactly how einsum does this
+    inner_product = (sum(len(x) for x in input_sets) - len(indices)) > 0
+    naive_cost = _flop_count(indices, inner_product, len(input_list), dimension_dict)
+
+    # Compute the path
+    if (path_type is False) or (len(input_list) in [1, 2]) or (indices == output_set):
+        # Nothing to be optimized, leave it to einsum
+        path = [tuple(range(len(input_list)))]
+    elif path_type == "greedy":
+        path = _greedy_path(input_sets, output_set, dimension_dict, memory_arg)
+    elif path_type == "optimal":
+        path = _optimal_path(input_sets, output_set, dimension_dict, memory_arg)
+    elif path_type[0] == 'einsum_path':
+        path = path_type[1:]
+    else:
+        raise KeyError("Path name %s not found", path_type)
+
+    cost_list, scale_list, size_list, contraction_list = [], [], [], []
+
+    # Build contraction tuple (positions, gemm, einsum_str, remaining)
+    for cnum, contract_inds in enumerate(path):
+        # Make sure we remove inds from right to left
+        contract_inds = tuple(sorted(list(contract_inds), reverse=True))
+
+        contract = _find_contraction(contract_inds, input_sets, output_set)
+        out_inds, input_sets, idx_removed, idx_contract = contract
+
+        cost = _flop_count(idx_contract, idx_removed, len(contract_inds), dimension_dict)
+        cost_list.append(cost)
+        scale_list.append(len(idx_contract))
+        size_list.append(_compute_size_by_dict(out_inds, dimension_dict))
+
+        bcast = set()
+        tmp_inputs = []
+        for x in contract_inds:
+            tmp_inputs.append(input_list.pop(x))
+            bcast |= broadcast_indices.pop(x)
+
+        new_bcast_inds = bcast - idx_removed
+
+        # If we're broadcasting, nix blas
+        if not len(idx_removed & bcast):
+            do_blas = _can_dot(tmp_inputs, out_inds, idx_removed)
+        else:
+            do_blas = False
+
+        # Last contraction
+        if (cnum - len(path)) == -1:
+            idx_result = output_subscript
+        else:
+            sort_result = [(dimension_dict[ind], ind) for ind in out_inds]
+            idx_result = "".join([x[1] for x in sorted(sort_result)])
+
+        input_list.append(idx_result)
+        broadcast_indices.append(new_bcast_inds)
+        einsum_str = ",".join(tmp_inputs) + "->" + idx_result
+
+        contraction = (contract_inds, idx_removed, einsum_str, input_list[:], do_blas)
+        contraction_list.append(contraction)
+
+    opt_cost = sum(cost_list) + 1
+
+    if einsum_call_arg:
+        return (operands, contraction_list)
+
+    # Return the path along with a nice string representation
+    overall_contraction = input_subscripts + "->" + output_subscript
+    header = ("scaling", "current", "remaining")
+
+    speedup = naive_cost / opt_cost
+    max_i = max(size_list)
+
+    path_print  = "  Complete contraction:  %s\n" % overall_contraction
+    path_print += "         Naive scaling:  %d\n" % len(indices)
+    path_print += "     Optimized scaling:  %d\n" % max(scale_list)
+    path_print += "      Naive FLOP count:  %.3e\n" % naive_cost
+    path_print += "  Optimized FLOP count:  %.3e\n" % opt_cost
+    path_print += "   Theoretical speedup:  %3.3f\n" % speedup
+    path_print += "  Largest intermediate:  %.3e elements\n" % max_i
+    path_print += "-" * 74 + "\n"
+    path_print += "%6s %24s %40s\n" % header
+    path_print += "-" * 74
+
+    for n, contraction in enumerate(contraction_list):
+        inds, idx_rm, einsum_str, remaining, blas = contraction
+        remaining_str = ",".join(remaining) + "->" + output_subscript
+        path_run = (scale_list[n], einsum_str, remaining_str)
+        path_print += "\n%4d    %24s %40s" % path_run
+
+    path = ['einsum_path'] + path
+    return (path, path_print)
+
+
+def _einsum_dispatcher(*operands, out=None, optimize=None, **kwargs):
+    # Arguably we dispatch on more arguments that we really should; see note in
+    # _einsum_path_dispatcher for why.
+    yield from operands
+    yield out
+
+
+# Rewrite einsum to handle different cases
+@array_function_dispatch(_einsum_dispatcher, module='numpy')
+def einsum(*operands, out=None, optimize=False, **kwargs):
+    """
+    einsum(subscripts, *operands, out=None, dtype=None, order='K',
+           casting='safe', optimize=False)
+
+    Evaluates the Einstein summation convention on the operands.
+
+    Using the Einstein summation convention, many common multi-dimensional,
+    linear algebraic array operations can be represented in a simple fashion.
+    In *implicit* mode `einsum` computes these values.
+
+    In *explicit* mode, `einsum` provides further flexibility to compute
+    other array operations that might not be considered classical Einstein
+    summation operations, by disabling, or forcing summation over specified
+    subscript labels.
+
+    See the notes and examples for clarification.
+
+    Parameters
+    ----------
+    subscripts : str
+        Specifies the subscripts for summation as comma separated list of
+        subscript labels. An implicit (classical Einstein summation)
+        calculation is performed unless the explicit indicator '->' is
+        included as well as subscript labels of the precise output form.
+    operands : list of array_like
+        These are the arrays for the operation.
+    out : ndarray, optional
+        If provided, the calculation is done into this array.
+    dtype : {data-type, None}, optional
+        If provided, forces the calculation to use the data type specified.
+        Note that you may have to also give a more liberal `casting`
+        parameter to allow the conversions. Default is None.
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the memory layout of the output. 'C' means it should
+        be C contiguous. 'F' means it should be Fortran contiguous,
+        'A' means it should be 'F' if the inputs are all 'F', 'C' otherwise.
+        'K' means it should be as close to the layout as the inputs as
+        is possible, including arbitrarily permuted axes.
+        Default is 'K'.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur.  Setting this to
+        'unsafe' is not recommended, as it can adversely affect accumulations.
+
+          * 'no' means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
+          * 'safe' means only casts which can preserve values are allowed.
+          * 'same_kind' means only safe casts or casts within a kind,
+            like float64 to float32, are allowed.
+          * 'unsafe' means any data conversions may be done.
+
+        Default is 'safe'.
+    optimize : {False, True, 'greedy', 'optimal'}, optional
+        Controls if intermediate optimization should occur. No optimization
+        will occur if False and True will default to the 'greedy' algorithm.
+        Also accepts an explicit contraction list from the ``np.einsum_path``
+        function. See ``np.einsum_path`` for more details. Defaults to False.
+
+    Returns
+    -------
+    output : ndarray
+        The calculation based on the Einstein summation convention.
+
+    See Also
+    --------
+    einsum_path, dot, inner, outer, tensordot, linalg.multi_dot
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    The Einstein summation convention can be used to compute
+    many multi-dimensional, linear algebraic array operations. `einsum`
+    provides a succinct way of representing these.
+
+    A non-exhaustive list of these operations,
+    which can be computed by `einsum`, is shown below along with examples:
+
+    * Trace of an array, :py:func:`numpy.trace`.
+    * Return a diagonal, :py:func:`numpy.diag`.
+    * Array axis summations, :py:func:`numpy.sum`.
+    * Transpositions and permutations, :py:func:`numpy.transpose`.
+    * Matrix multiplication and dot product, :py:func:`numpy.matmul` :py:func:`numpy.dot`.
+    * Vector inner and outer products, :py:func:`numpy.inner` :py:func:`numpy.outer`.
+    * Broadcasting, element-wise and scalar multiplication, :py:func:`numpy.multiply`.
+    * Tensor contractions, :py:func:`numpy.tensordot`.
+    * Chained array operations, in efficient calculation order, :py:func:`numpy.einsum_path`.
+
+    The subscripts string is a comma-separated list of subscript labels,
+    where each label refers to a dimension of the corresponding operand.
+    Whenever a label is repeated it is summed, so ``np.einsum('i,i', a, b)``
+    is equivalent to :py:func:`np.inner(a,b) <numpy.inner>`. If a label
+    appears only once, it is not summed, so ``np.einsum('i', a)`` produces a
+    view of ``a`` with no changes. A further example ``np.einsum('ij,jk', a, b)``
+    describes traditional matrix multiplication and is equivalent to
+    :py:func:`np.matmul(a,b) <numpy.matmul>`. Repeated subscript labels in one
+    operand take the diagonal. For example, ``np.einsum('ii', a)`` is equivalent
+    to :py:func:`np.trace(a) <numpy.trace>`.
+
+    In *implicit mode*, the chosen subscripts are important
+    since the axes of the output are reordered alphabetically.  This
+    means that ``np.einsum('ij', a)`` doesn't affect a 2D array, while
+    ``np.einsum('ji', a)`` takes its transpose. Additionally,
+    ``np.einsum('ij,jk', a, b)`` returns a matrix multiplication, while,
+    ``np.einsum('ij,jh', a, b)`` returns the transpose of the
+    multiplication since subscript 'h' precedes subscript 'i'.
+
+    In *explicit mode* the output can be directly controlled by
+    specifying output subscript labels.  This requires the
+    identifier '->' as well as the list of output subscript labels.
+    This feature increases the flexibility of the function since
+    summing can be disabled or forced when required. The call
+    ``np.einsum('i->', a)`` is like :py:func:`np.sum(a, axis=-1) <numpy.sum>`,
+    and ``np.einsum('ii->i', a)`` is like :py:func:`np.diag(a) <numpy.diag>`.
+    The difference is that `einsum` does not allow broadcasting by default.
+    Additionally ``np.einsum('ij,jh->ih', a, b)`` directly specifies the
+    order of the output subscript labels and therefore returns matrix
+    multiplication, unlike the example above in implicit mode.
+
+    To enable and control broadcasting, use an ellipsis.  Default
+    NumPy-style broadcasting is done by adding an ellipsis
+    to the left of each term, like ``np.einsum('...ii->...i', a)``.
+    To take the trace along the first and last axes,
+    you can do ``np.einsum('i...i', a)``, or to do a matrix-matrix
+    product with the left-most indices instead of rightmost, one can do
+    ``np.einsum('ij...,jk...->ik...', a, b)``.
+
+    When there is only one operand, no axes are summed, and no output
+    parameter is provided, a view into the operand is returned instead
+    of a new array.  Thus, taking the diagonal as ``np.einsum('ii->i', a)``
+    produces a view (changed in version 1.10.0).
+
+    `einsum` also provides an alternative way to provide the subscripts
+    and operands as ``einsum(op0, sublist0, op1, sublist1, ..., [sublistout])``.
+    If the output shape is not provided in this format `einsum` will be
+    calculated in implicit mode, otherwise it will be performed explicitly.
+    The examples below have corresponding `einsum` calls with the two
+    parameter methods.
+
+    .. versionadded:: 1.10.0
+
+    Views returned from einsum are now writeable whenever the input array
+    is writeable. For example, ``np.einsum('ijk...->kji...', a)`` will now
+    have the same effect as :py:func:`np.swapaxes(a, 0, 2) <numpy.swapaxes>`
+    and ``np.einsum('ii->i', a)`` will return a writeable view of the diagonal
+    of a 2D array.
+
+    .. versionadded:: 1.12.0
+
+    Added the ``optimize`` argument which will optimize the contraction order
+    of an einsum expression. For a contraction with three or more operands this
+    can greatly increase the computational efficiency at the cost of a larger
+    memory footprint during computation.
+
+    Typically a 'greedy' algorithm is applied which empirical tests have shown
+    returns the optimal path in the majority of cases. In some cases 'optimal'
+    will return the superlative path through a more expensive, exhaustive search.
+    For iterative calculations it may be advisable to calculate the optimal path
+    once and reuse that path by supplying it as an argument. An example is given
+    below.
+
+    See :py:func:`numpy.einsum_path` for more details.
+
+    Examples
+    --------
+    >>> a = np.arange(25).reshape(5,5)
+    >>> b = np.arange(5)
+    >>> c = np.arange(6).reshape(2,3)
+
+    Trace of a matrix:
+
+    >>> np.einsum('ii', a)
+    60
+    >>> np.einsum(a, [0,0])
+    60
+    >>> np.trace(a)
+    60
+
+    Extract the diagonal (requires explicit form):
+
+    >>> np.einsum('ii->i', a)
+    array([ 0,  6, 12, 18, 24])
+    >>> np.einsum(a, [0,0], [0])
+    array([ 0,  6, 12, 18, 24])
+    >>> np.diag(a)
+    array([ 0,  6, 12, 18, 24])
+
+    Sum over an axis (requires explicit form):
+
+    >>> np.einsum('ij->i', a)
+    array([ 10,  35,  60,  85, 110])
+    >>> np.einsum(a, [0,1], [0])
+    array([ 10,  35,  60,  85, 110])
+    >>> np.sum(a, axis=1)
+    array([ 10,  35,  60,  85, 110])
+
+    For higher dimensional arrays summing a single axis can be done with ellipsis:
+
+    >>> np.einsum('...j->...', a)
+    array([ 10,  35,  60,  85, 110])
+    >>> np.einsum(a, [Ellipsis,1], [Ellipsis])
+    array([ 10,  35,  60,  85, 110])
+
+    Compute a matrix transpose, or reorder any number of axes:
+
+    >>> np.einsum('ji', c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.einsum('ij->ji', c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.einsum(c, [1,0])
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+    >>> np.transpose(c)
+    array([[0, 3],
+           [1, 4],
+           [2, 5]])
+
+    Vector inner products:
+
+    >>> np.einsum('i,i', b, b)
+    30
+    >>> np.einsum(b, [0], b, [0])
+    30
+    >>> np.inner(b,b)
+    30
+
+    Matrix vector multiplication:
+
+    >>> np.einsum('ij,j', a, b)
+    array([ 30,  80, 130, 180, 230])
+    >>> np.einsum(a, [0,1], b, [1])
+    array([ 30,  80, 130, 180, 230])
+    >>> np.dot(a, b)
+    array([ 30,  80, 130, 180, 230])
+    >>> np.einsum('...j,j', a, b)
+    array([ 30,  80, 130, 180, 230])
+
+    Broadcasting and scalar multiplication:
+
+    >>> np.einsum('..., ...', 3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.einsum(',ij', 3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.einsum(3, [Ellipsis], c, [Ellipsis])
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+    >>> np.multiply(3, c)
+    array([[ 0,  3,  6],
+           [ 9, 12, 15]])
+
+    Vector outer product:
+
+    >>> np.einsum('i,j', np.arange(2)+1, b)
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+    >>> np.einsum(np.arange(2)+1, [0], b, [1])
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+    >>> np.outer(np.arange(2)+1, b)
+    array([[0, 1, 2, 3, 4],
+           [0, 2, 4, 6, 8]])
+
+    Tensor contraction:
+
+    >>> a = np.arange(60.).reshape(3,4,5)
+    >>> b = np.arange(24.).reshape(4,3,2)
+    >>> np.einsum('ijk,jil->kl', a, b)
+    array([[4400., 4730.],
+           [4532., 4874.],
+           [4664., 5018.],
+           [4796., 5162.],
+           [4928., 5306.]])
+    >>> np.einsum(a, [0,1,2], b, [1,0,3], [2,3])
+    array([[4400., 4730.],
+           [4532., 4874.],
+           [4664., 5018.],
+           [4796., 5162.],
+           [4928., 5306.]])
+    >>> np.tensordot(a,b, axes=([1,0],[0,1]))
+    array([[4400., 4730.],
+           [4532., 4874.],
+           [4664., 5018.],
+           [4796., 5162.],
+           [4928., 5306.]])
+
+    Writeable returned arrays (since version 1.10.0):
+
+    >>> a = np.zeros((3, 3))
+    >>> np.einsum('ii->i', a)[:] = 1
+    >>> a
+    array([[1., 0., 0.],
+           [0., 1., 0.],
+           [0., 0., 1.]])
+
+    Example of ellipsis use:
+
+    >>> a = np.arange(6).reshape((3,2))
+    >>> b = np.arange(12).reshape((4,3))
+    >>> np.einsum('ki,jk->ij', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+    >>> np.einsum('ki,...k->i...', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+    >>> np.einsum('k...,jk', a, b)
+    array([[10, 28, 46, 64],
+           [13, 40, 67, 94]])
+
+    Chained array operations. For more complicated contractions, speed ups
+    might be achieved by repeatedly computing a 'greedy' path or pre-computing the
+    'optimal' path and repeatedly applying it, using an
+    `einsum_path` insertion (since version 1.12.0). Performance improvements can be
+    particularly significant with larger arrays:
+
+    >>> a = np.ones(64).reshape(2,4,8)
+
+    Basic `einsum`: ~1520ms  (benchmarked on 3.1GHz Intel i5.)
+
+    >>> for iteration in range(500):
+    ...     _ = np.einsum('ijk,ilm,njm,nlk,abc->',a,a,a,a,a)
+
+    Sub-optimal `einsum` (due to repeated path calculation time): ~330ms
+
+    >>> for iteration in range(500):
+    ...     _ = np.einsum('ijk,ilm,njm,nlk,abc->',a,a,a,a,a, optimize='optimal')
+
+    Greedy `einsum` (faster optimal path approximation): ~160ms
+
+    >>> for iteration in range(500):
+    ...     _ = np.einsum('ijk,ilm,njm,nlk,abc->',a,a,a,a,a, optimize='greedy')
+
+    Optimal `einsum` (best usage pattern in some use cases): ~110ms
+
+    >>> path = np.einsum_path('ijk,ilm,njm,nlk,abc->',a,a,a,a,a, optimize='optimal')[0]
+    >>> for iteration in range(500):
+    ...     _ = np.einsum('ijk,ilm,njm,nlk,abc->',a,a,a,a,a, optimize=path)
+
+    """
+    # Special handling if out is specified
+    specified_out = out is not None
+
+    # If no optimization, run pure einsum
+    if optimize is False:
+        if specified_out:
+            kwargs['out'] = out
+        return c_einsum(*operands, **kwargs)
+
+    # Check the kwargs to avoid a more cryptic error later, without having to
+    # repeat default values here
+    valid_einsum_kwargs = ['dtype', 'order', 'casting']
+    unknown_kwargs = [k for (k, v) in kwargs.items() if
+                      k not in valid_einsum_kwargs]
+    if len(unknown_kwargs):
+        raise TypeError("Did not understand the following kwargs: %s"
+                        % unknown_kwargs)
+
+
+    # Build the contraction list and operand
+    operands, contraction_list = einsum_path(*operands, optimize=optimize,
+                                             einsum_call=True)
+
+    # Start contraction loop
+    for num, contraction in enumerate(contraction_list):
+        inds, idx_rm, einsum_str, remaining, blas = contraction
+        tmp_operands = [operands.pop(x) for x in inds]
+
+        # Do we need to deal with the output?
+        handle_out = specified_out and ((num + 1) == len(contraction_list))
+
+        # Call tensordot if still possible
+        if blas:
+            # Checks have already been handled
+            input_str, results_index = einsum_str.split('->')
+            input_left, input_right = input_str.split(',')
+
+            tensor_result = input_left + input_right
+            for s in idx_rm:
+                tensor_result = tensor_result.replace(s, "")
+
+            # Find indices to contract over
+            left_pos, right_pos = [], []
+            for s in sorted(idx_rm):
+                left_pos.append(input_left.find(s))
+                right_pos.append(input_right.find(s))
+
+            # Contract!
+            new_view = tensordot(*tmp_operands, axes=(tuple(left_pos), tuple(right_pos)))
+
+            # Build a new view if needed
+            if (tensor_result != results_index) or handle_out:
+                if handle_out:
+                    kwargs["out"] = out
+                new_view = c_einsum(tensor_result + '->' + results_index, new_view, **kwargs)
+
+        # Call einsum
+        else:
+            # If out was specified
+            if handle_out:
+                kwargs["out"] = out
+
+            # Do the contraction
+            new_view = c_einsum(einsum_str, *tmp_operands, **kwargs)
+
+        # Append new items and dereference what we can
+        operands.append(new_view)
+        del tmp_operands, new_view
+
+    if specified_out:
+        return out
+    else:
+        return operands[0]
diff --git a/venv/Lib/site-packages/numpy/core/fromnumeric.py b/venv/Lib/site-packages/numpy/core/fromnumeric.py
new file mode 100644
index 000000000..285b75314
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/fromnumeric.py
@@ -0,0 +1,3687 @@
+"""Module containing non-deprecated functions borrowed from Numeric.
+
+"""
+import functools
+import types
+import warnings
+
+import numpy as np
+from . import multiarray as mu
+from . import overrides
+from . import umath as um
+from . import numerictypes as nt
+from ._asarray import asarray, array, asanyarray
+from .multiarray import concatenate
+from . import _methods
+
+_dt_ = nt.sctype2char
+
+# functions that are methods
+__all__ = [
+    'alen', 'all', 'alltrue', 'amax', 'amin', 'any', 'argmax',
+    'argmin', 'argpartition', 'argsort', 'around', 'choose', 'clip',
+    'compress', 'cumprod', 'cumproduct', 'cumsum', 'diagonal', 'mean',
+    'ndim', 'nonzero', 'partition', 'prod', 'product', 'ptp', 'put',
+    'ravel', 'repeat', 'reshape', 'resize', 'round_',
+    'searchsorted', 'shape', 'size', 'sometrue', 'sort', 'squeeze',
+    'std', 'sum', 'swapaxes', 'take', 'trace', 'transpose', 'var',
+]
+
+_gentype = types.GeneratorType
+# save away Python sum
+_sum_ = sum
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+# functions that are now methods
+def _wrapit(obj, method, *args, **kwds):
+    try:
+        wrap = obj.__array_wrap__
+    except AttributeError:
+        wrap = None
+    result = getattr(asarray(obj), method)(*args, **kwds)
+    if wrap:
+        if not isinstance(result, mu.ndarray):
+            result = asarray(result)
+        result = wrap(result)
+    return result
+
+
+def _wrapfunc(obj, method, *args, **kwds):
+    bound = getattr(obj, method, None)
+    if bound is None:
+        return _wrapit(obj, method, *args, **kwds)
+
+    try:
+        return bound(*args, **kwds)
+    except TypeError:
+        # A TypeError occurs if the object does have such a method in its
+        # class, but its signature is not identical to that of NumPy's. This
+        # situation has occurred in the case of a downstream library like
+        # 'pandas'.
+        #
+        # Call _wrapit from within the except clause to ensure a potential
+        # exception has a traceback chain.
+        return _wrapit(obj, method, *args, **kwds)
+
+
+def _wrapreduction(obj, ufunc, method, axis, dtype, out, **kwargs):
+    passkwargs = {k: v for k, v in kwargs.items()
+                  if v is not np._NoValue}
+
+    if type(obj) is not mu.ndarray:
+        try:
+            reduction = getattr(obj, method)
+        except AttributeError:
+            pass
+        else:
+            # This branch is needed for reductions like any which don't
+            # support a dtype.
+            if dtype is not None:
+                return reduction(axis=axis, dtype=dtype, out=out, **passkwargs)
+            else:
+                return reduction(axis=axis, out=out, **passkwargs)
+
+    return ufunc.reduce(obj, axis, dtype, out, **passkwargs)
+
+
+def _take_dispatcher(a, indices, axis=None, out=None, mode=None):
+    return (a, out)
+
+
+@array_function_dispatch(_take_dispatcher)
+def take(a, indices, axis=None, out=None, mode='raise'):
+    """
+    Take elements from an array along an axis.
+
+    When axis is not None, this function does the same thing as "fancy"
+    indexing (indexing arrays using arrays); however, it can be easier to use
+    if you need elements along a given axis. A call such as
+    ``np.take(arr, indices, axis=3)`` is equivalent to
+    ``arr[:,:,:,indices,...]``.
+
+    Explained without fancy indexing, this is equivalent to the following use
+    of `ndindex`, which sets each of ``ii``, ``jj``, and ``kk`` to a tuple of
+    indices::
+
+        Ni, Nk = a.shape[:axis], a.shape[axis+1:]
+        Nj = indices.shape
+        for ii in ndindex(Ni):
+            for jj in ndindex(Nj):
+                for kk in ndindex(Nk):
+                    out[ii + jj + kk] = a[ii + (indices[jj],) + kk]
+
+    Parameters
+    ----------
+    a : array_like (Ni..., M, Nk...)
+        The source array.
+    indices : array_like (Nj...)
+        The indices of the values to extract.
+
+        .. versionadded:: 1.8.0
+
+        Also allow scalars for indices.
+    axis : int, optional
+        The axis over which to select values. By default, the flattened
+        input array is used.
+    out : ndarray, optional (Ni..., Nj..., Nk...)
+        If provided, the result will be placed in this array. It should
+        be of the appropriate shape and dtype. Note that `out` is always
+        buffered if `mode='raise'`; use other modes for better performance.
+    mode : {'raise', 'wrap', 'clip'}, optional
+        Specifies how out-of-bounds indices will behave.
+
+        * 'raise' -- raise an error (default)
+        * 'wrap' -- wrap around
+        * 'clip' -- clip to the range
+
+        'clip' mode means that all indices that are too large are replaced
+        by the index that addresses the last element along that axis. Note
+        that this disables indexing with negative numbers.
+
+    Returns
+    -------
+    out : ndarray (Ni..., Nj..., Nk...)
+        The returned array has the same type as `a`.
+
+    See Also
+    --------
+    compress : Take elements using a boolean mask
+    ndarray.take : equivalent method
+    take_along_axis : Take elements by matching the array and the index arrays
+
+    Notes
+    -----
+
+    By eliminating the inner loop in the description above, and using `s_` to
+    build simple slice objects, `take` can be expressed  in terms of applying
+    fancy indexing to each 1-d slice::
+
+        Ni, Nk = a.shape[:axis], a.shape[axis+1:]
+        for ii in ndindex(Ni):
+            for kk in ndindex(Nj):
+                out[ii + s_[...,] + kk] = a[ii + s_[:,] + kk][indices]
+
+    For this reason, it is equivalent to (but faster than) the following use
+    of `apply_along_axis`::
+
+        out = np.apply_along_axis(lambda a_1d: a_1d[indices], axis, a)
+
+    Examples
+    --------
+    >>> a = [4, 3, 5, 7, 6, 8]
+    >>> indices = [0, 1, 4]
+    >>> np.take(a, indices)
+    array([4, 3, 6])
+
+    In this example if `a` is an ndarray, "fancy" indexing can be used.
+
+    >>> a = np.array(a)
+    >>> a[indices]
+    array([4, 3, 6])
+
+    If `indices` is not one dimensional, the output also has these dimensions.
+
+    >>> np.take(a, [[0, 1], [2, 3]])
+    array([[4, 3],
+           [5, 7]])
+    """
+    return _wrapfunc(a, 'take', indices, axis=axis, out=out, mode=mode)
+
+
+def _reshape_dispatcher(a, newshape, order=None):
+    return (a,)
+
+
+# not deprecated --- copy if necessary, view otherwise
+@array_function_dispatch(_reshape_dispatcher)
+def reshape(a, newshape, order='C'):
+    """
+    Gives a new shape to an array without changing its data.
+
+    Parameters
+    ----------
+    a : array_like
+        Array to be reshaped.
+    newshape : int or tuple of ints
+        The new shape should be compatible with the original shape. If
+        an integer, then the result will be a 1-D array of that length.
+        One shape dimension can be -1. In this case, the value is
+        inferred from the length of the array and remaining dimensions.
+    order : {'C', 'F', 'A'}, optional
+        Read the elements of `a` using this index order, and place the
+        elements into the reshaped array using this index order.  'C'
+        means to read / write the elements using C-like index order,
+        with the last axis index changing fastest, back to the first
+        axis index changing slowest. 'F' means to read / write the
+        elements using Fortran-like index order, with the first index
+        changing fastest, and the last index changing slowest. Note that
+        the 'C' and 'F' options take no account of the memory layout of
+        the underlying array, and only refer to the order of indexing.
+        'A' means to read / write the elements in Fortran-like index
+        order if `a` is Fortran *contiguous* in memory, C-like order
+        otherwise.
+
+    Returns
+    -------
+    reshaped_array : ndarray
+        This will be a new view object if possible; otherwise, it will
+        be a copy.  Note there is no guarantee of the *memory layout* (C- or
+        Fortran- contiguous) of the returned array.
+
+    See Also
+    --------
+    ndarray.reshape : Equivalent method.
+
+    Notes
+    -----
+    It is not always possible to change the shape of an array without
+    copying the data. If you want an error to be raised when the data is copied,
+    you should assign the new shape to the shape attribute of the array::
+
+     >>> a = np.zeros((10, 2))
+
+     # A transpose makes the array non-contiguous
+     >>> b = a.T
+
+     # Taking a view makes it possible to modify the shape without modifying
+     # the initial object.
+     >>> c = b.view()
+     >>> c.shape = (20)
+     Traceback (most recent call last):
+        ...
+     AttributeError: Incompatible shape for in-place modification. Use
+     `.reshape()` to make a copy with the desired shape.
+
+    The `order` keyword gives the index ordering both for *fetching* the values
+    from `a`, and then *placing* the values into the output array.
+    For example, let's say you have an array:
+
+    >>> a = np.arange(6).reshape((3, 2))
+    >>> a
+    array([[0, 1],
+           [2, 3],
+           [4, 5]])
+
+    You can think of reshaping as first raveling the array (using the given
+    index order), then inserting the elements from the raveled array into the
+    new array using the same kind of index ordering as was used for the
+    raveling.
+
+    >>> np.reshape(a, (2, 3)) # C-like index ordering
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.reshape(np.ravel(a), (2, 3)) # equivalent to C ravel then C reshape
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.reshape(a, (2, 3), order='F') # Fortran-like index ordering
+    array([[0, 4, 3],
+           [2, 1, 5]])
+    >>> np.reshape(np.ravel(a, order='F'), (2, 3), order='F')
+    array([[0, 4, 3],
+           [2, 1, 5]])
+
+    Examples
+    --------
+    >>> a = np.array([[1,2,3], [4,5,6]])
+    >>> np.reshape(a, 6)
+    array([1, 2, 3, 4, 5, 6])
+    >>> np.reshape(a, 6, order='F')
+    array([1, 4, 2, 5, 3, 6])
+
+    >>> np.reshape(a, (3,-1))       # the unspecified value is inferred to be 2
+    array([[1, 2],
+           [3, 4],
+           [5, 6]])
+    """
+    return _wrapfunc(a, 'reshape', newshape, order=order)
+
+
+def _choose_dispatcher(a, choices, out=None, mode=None):
+    yield a
+    yield from choices
+    yield out
+
+
+@array_function_dispatch(_choose_dispatcher)
+def choose(a, choices, out=None, mode='raise'):
+    """
+    Construct an array from an index array and a set of arrays to choose from.
+
+    First of all, if confused or uncertain, definitely look at the Examples -
+    in its full generality, this function is less simple than it might
+    seem from the following code description (below ndi =
+    `numpy.lib.index_tricks`):
+
+    ``np.choose(a,c) == np.array([c[a[I]][I] for I in ndi.ndindex(a.shape)])``.
+
+    But this omits some subtleties.  Here is a fully general summary:
+
+    Given an "index" array (`a`) of integers and a sequence of `n` arrays
+    (`choices`), `a` and each choice array are first broadcast, as necessary,
+    to arrays of a common shape; calling these *Ba* and *Bchoices[i], i =
+    0,...,n-1* we have that, necessarily, ``Ba.shape == Bchoices[i].shape``
+    for each `i`.  Then, a new array with shape ``Ba.shape`` is created as
+    follows:
+
+    * if ``mode=raise`` (the default), then, first of all, each element of
+      `a` (and thus `Ba`) must be in the range `[0, n-1]`; now, suppose that
+      `i` (in that range) is the value at the `(j0, j1, ..., jm)` position
+      in `Ba` - then the value at the same position in the new array is the
+      value in `Bchoices[i]` at that same position;
+
+    * if ``mode=wrap``, values in `a` (and thus `Ba`) may be any (signed)
+      integer; modular arithmetic is used to map integers outside the range
+      `[0, n-1]` back into that range; and then the new array is constructed
+      as above;
+
+    * if ``mode=clip``, values in `a` (and thus `Ba`) may be any (signed)
+      integer; negative integers are mapped to 0; values greater than `n-1`
+      are mapped to `n-1`; and then the new array is constructed as above.
+
+    Parameters
+    ----------
+    a : int array
+        This array must contain integers in `[0, n-1]`, where `n` is the number
+        of choices, unless ``mode=wrap`` or ``mode=clip``, in which cases any
+        integers are permissible.
+    choices : sequence of arrays
+        Choice arrays. `a` and all of the choices must be broadcastable to the
+        same shape.  If `choices` is itself an array (not recommended), then
+        its outermost dimension (i.e., the one corresponding to
+        ``choices.shape[0]``) is taken as defining the "sequence".
+    out : array, optional
+        If provided, the result will be inserted into this array. It should
+        be of the appropriate shape and dtype. Note that `out` is always
+        buffered if `mode='raise'`; use other modes for better performance.
+    mode : {'raise' (default), 'wrap', 'clip'}, optional
+        Specifies how indices outside `[0, n-1]` will be treated:
+
+          * 'raise' : an exception is raised
+          * 'wrap' : value becomes value mod `n`
+          * 'clip' : values < 0 are mapped to 0, values > n-1 are mapped to n-1
+
+    Returns
+    -------
+    merged_array : array
+        The merged result.
+
+    Raises
+    ------
+    ValueError: shape mismatch
+        If `a` and each choice array are not all broadcastable to the same
+        shape.
+
+    See Also
+    --------
+    ndarray.choose : equivalent method
+    numpy.take_along_axis : Preferable if `choices` is an array
+
+    Notes
+    -----
+    To reduce the chance of misinterpretation, even though the following
+    "abuse" is nominally supported, `choices` should neither be, nor be
+    thought of as, a single array, i.e., the outermost sequence-like container
+    should be either a list or a tuple.
+
+    Examples
+    --------
+
+    >>> choices = [[0, 1, 2, 3], [10, 11, 12, 13],
+    ...   [20, 21, 22, 23], [30, 31, 32, 33]]
+    >>> np.choose([2, 3, 1, 0], choices
+    ... # the first element of the result will be the first element of the
+    ... # third (2+1) "array" in choices, namely, 20; the second element
+    ... # will be the second element of the fourth (3+1) choice array, i.e.,
+    ... # 31, etc.
+    ... )
+    array([20, 31, 12,  3])
+    >>> np.choose([2, 4, 1, 0], choices, mode='clip') # 4 goes to 3 (4-1)
+    array([20, 31, 12,  3])
+    >>> # because there are 4 choice arrays
+    >>> np.choose([2, 4, 1, 0], choices, mode='wrap') # 4 goes to (4 mod 4)
+    array([20,  1, 12,  3])
+    >>> # i.e., 0
+
+    A couple examples illustrating how choose broadcasts:
+
+    >>> a = [[1, 0, 1], [0, 1, 0], [1, 0, 1]]
+    >>> choices = [-10, 10]
+    >>> np.choose(a, choices)
+    array([[ 10, -10,  10],
+           [-10,  10, -10],
+           [ 10, -10,  10]])
+
+    >>> # With thanks to Anne Archibald
+    >>> a = np.array([0, 1]).reshape((2,1,1))
+    >>> c1 = np.array([1, 2, 3]).reshape((1,3,1))
+    >>> c2 = np.array([-1, -2, -3, -4, -5]).reshape((1,1,5))
+    >>> np.choose(a, (c1, c2)) # result is 2x3x5, res[0,:,:]=c1, res[1,:,:]=c2
+    array([[[ 1,  1,  1,  1,  1],
+            [ 2,  2,  2,  2,  2],
+            [ 3,  3,  3,  3,  3]],
+           [[-1, -2, -3, -4, -5],
+            [-1, -2, -3, -4, -5],
+            [-1, -2, -3, -4, -5]]])
+
+    """
+    return _wrapfunc(a, 'choose', choices, out=out, mode=mode)
+
+
+def _repeat_dispatcher(a, repeats, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_repeat_dispatcher)
+def repeat(a, repeats, axis=None):
+    """
+    Repeat elements of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    repeats : int or array of ints
+        The number of repetitions for each element.  `repeats` is broadcasted
+        to fit the shape of the given axis.
+    axis : int, optional
+        The axis along which to repeat values.  By default, use the
+        flattened input array, and return a flat output array.
+
+    Returns
+    -------
+    repeated_array : ndarray
+        Output array which has the same shape as `a`, except along
+        the given axis.
+
+    See Also
+    --------
+    tile : Tile an array.
+
+    Examples
+    --------
+    >>> np.repeat(3, 4)
+    array([3, 3, 3, 3])
+    >>> x = np.array([[1,2],[3,4]])
+    >>> np.repeat(x, 2)
+    array([1, 1, 2, 2, 3, 3, 4, 4])
+    >>> np.repeat(x, 3, axis=1)
+    array([[1, 1, 1, 2, 2, 2],
+           [3, 3, 3, 4, 4, 4]])
+    >>> np.repeat(x, [1, 2], axis=0)
+    array([[1, 2],
+           [3, 4],
+           [3, 4]])
+
+    """
+    return _wrapfunc(a, 'repeat', repeats, axis=axis)
+
+
+def _put_dispatcher(a, ind, v, mode=None):
+    return (a, ind, v)
+
+
+@array_function_dispatch(_put_dispatcher)
+def put(a, ind, v, mode='raise'):
+    """
+    Replaces specified elements of an array with given values.
+
+    The indexing works on the flattened target array. `put` is roughly
+    equivalent to:
+
+    ::
+
+        a.flat[ind] = v
+
+    Parameters
+    ----------
+    a : ndarray
+        Target array.
+    ind : array_like
+        Target indices, interpreted as integers.
+    v : array_like
+        Values to place in `a` at target indices. If `v` is shorter than
+        `ind` it will be repeated as necessary.
+    mode : {'raise', 'wrap', 'clip'}, optional
+        Specifies how out-of-bounds indices will behave.
+
+        * 'raise' -- raise an error (default)
+        * 'wrap' -- wrap around
+        * 'clip' -- clip to the range
+
+        'clip' mode means that all indices that are too large are replaced
+        by the index that addresses the last element along that axis. Note
+        that this disables indexing with negative numbers. In 'raise' mode,
+        if an exception occurs the target array may still be modified.
+
+    See Also
+    --------
+    putmask, place
+    put_along_axis : Put elements by matching the array and the index arrays
+
+    Examples
+    --------
+    >>> a = np.arange(5)
+    >>> np.put(a, [0, 2], [-44, -55])
+    >>> a
+    array([-44,   1, -55,   3,   4])
+
+    >>> a = np.arange(5)
+    >>> np.put(a, 22, -5, mode='clip')
+    >>> a
+    array([ 0,  1,  2,  3, -5])
+
+    """
+    try:
+        put = a.put
+    except AttributeError:
+        raise TypeError("argument 1 must be numpy.ndarray, "
+                        "not {name}".format(name=type(a).__name__))
+
+    return put(ind, v, mode=mode)
+
+
+def _swapaxes_dispatcher(a, axis1, axis2):
+    return (a,)
+
+
+@array_function_dispatch(_swapaxes_dispatcher)
+def swapaxes(a, axis1, axis2):
+    """
+    Interchange two axes of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis1 : int
+        First axis.
+    axis2 : int
+        Second axis.
+
+    Returns
+    -------
+    a_swapped : ndarray
+        For NumPy >= 1.10.0, if `a` is an ndarray, then a view of `a` is
+        returned; otherwise a new array is created. For earlier NumPy
+        versions a view of `a` is returned only if the order of the
+        axes is changed, otherwise the input array is returned.
+
+    Examples
+    --------
+    >>> x = np.array([[1,2,3]])
+    >>> np.swapaxes(x,0,1)
+    array([[1],
+           [2],
+           [3]])
+
+    >>> x = np.array([[[0,1],[2,3]],[[4,5],[6,7]]])
+    >>> x
+    array([[[0, 1],
+            [2, 3]],
+           [[4, 5],
+            [6, 7]]])
+
+    >>> np.swapaxes(x,0,2)
+    array([[[0, 4],
+            [2, 6]],
+           [[1, 5],
+            [3, 7]]])
+
+    """
+    return _wrapfunc(a, 'swapaxes', axis1, axis2)
+
+
+def _transpose_dispatcher(a, axes=None):
+    return (a,)
+
+
+@array_function_dispatch(_transpose_dispatcher)
+def transpose(a, axes=None):
+    """
+    Reverse or permute the axes of an array; returns the modified array.
+
+    For an array a with two axes, transpose(a) gives the matrix transpose.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axes : tuple or list of ints, optional
+        If specified, it must be a tuple or list which contains a permutation of
+        [0,1,..,N-1] where N is the number of axes of a.  The i'th axis of the
+        returned array will correspond to the axis numbered ``axes[i]`` of the
+        input.  If not specified, defaults to ``range(a.ndim)[::-1]``, which
+        reverses the order of the axes.
+
+    Returns
+    -------
+    p : ndarray
+        `a` with its axes permuted.  A view is returned whenever
+        possible.
+
+    See Also
+    --------
+    moveaxis
+    argsort
+
+    Notes
+    -----
+    Use `transpose(a, argsort(axes))` to invert the transposition of tensors
+    when using the `axes` keyword argument.
+
+    Transposing a 1-D array returns an unchanged view of the original array.
+
+    Examples
+    --------
+    >>> x = np.arange(4).reshape((2,2))
+    >>> x
+    array([[0, 1],
+           [2, 3]])
+
+    >>> np.transpose(x)
+    array([[0, 2],
+           [1, 3]])
+
+    >>> x = np.ones((1, 2, 3))
+    >>> np.transpose(x, (1, 0, 2)).shape
+    (2, 1, 3)
+
+    """
+    return _wrapfunc(a, 'transpose', axes)
+
+
+def _partition_dispatcher(a, kth, axis=None, kind=None, order=None):
+    return (a,)
+
+
+@array_function_dispatch(_partition_dispatcher)
+def partition(a, kth, axis=-1, kind='introselect', order=None):
+    """
+    Return a partitioned copy of an array.
+
+    Creates a copy of the array with its elements rearranged in such a
+    way that the value of the element in k-th position is in the
+    position it would be in a sorted array. All elements smaller than
+    the k-th element are moved before this element and all equal or
+    greater are moved behind it. The ordering of the elements in the two
+    partitions is undefined.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        Array to be sorted.
+    kth : int or sequence of ints
+        Element index to partition by. The k-th value of the element
+        will be in its final sorted position and all smaller elements
+        will be moved before it and all equal or greater elements behind
+        it. The order of all elements in the partitions is undefined. If
+        provided with a sequence of k-th it will partition all elements
+        indexed by k-th  of them into their sorted position at once.
+    axis : int or None, optional
+        Axis along which to sort. If None, the array is flattened before
+        sorting. The default is -1, which sorts along the last axis.
+    kind : {'introselect'}, optional
+        Selection algorithm. Default is 'introselect'.
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument
+        specifies which fields to compare first, second, etc.  A single
+        field can be specified as a string.  Not all fields need be
+        specified, but unspecified fields will still be used, in the
+        order in which they come up in the dtype, to break ties.
+
+    Returns
+    -------
+    partitioned_array : ndarray
+        Array of the same type and shape as `a`.
+
+    See Also
+    --------
+    ndarray.partition : Method to sort an array in-place.
+    argpartition : Indirect partition.
+    sort : Full sorting
+
+    Notes
+    -----
+    The various selection algorithms are characterized by their average
+    speed, worst case performance, work space size, and whether they are
+    stable. A stable sort keeps items with the same key in the same
+    relative order. The available algorithms have the following
+    properties:
+
+    ================= ======= ============= ============ =======
+       kind            speed   worst case    work space  stable
+    ================= ======= ============= ============ =======
+    'introselect'        1        O(n)           0         no
+    ================= ======= ============= ============ =======
+
+    All the partition algorithms make temporary copies of the data when
+    partitioning along any but the last axis.  Consequently,
+    partitioning along the last axis is faster and uses less space than
+    partitioning along any other axis.
+
+    The sort order for complex numbers is lexicographic. If both the
+    real and imaginary parts are non-nan then the order is determined by
+    the real parts except when they are equal, in which case the order
+    is determined by the imaginary parts.
+
+    Examples
+    --------
+    >>> a = np.array([3, 4, 2, 1])
+    >>> np.partition(a, 3)
+    array([2, 1, 3, 4])
+
+    >>> np.partition(a, (1, 3))
+    array([1, 2, 3, 4])
+
+    """
+    if axis is None:
+        # flatten returns (1, N) for np.matrix, so always use the last axis
+        a = asanyarray(a).flatten()
+        axis = -1
+    else:
+        a = asanyarray(a).copy(order="K")
+    a.partition(kth, axis=axis, kind=kind, order=order)
+    return a
+
+
+def _argpartition_dispatcher(a, kth, axis=None, kind=None, order=None):
+    return (a,)
+
+
+@array_function_dispatch(_argpartition_dispatcher)
+def argpartition(a, kth, axis=-1, kind='introselect', order=None):
+    """
+    Perform an indirect partition along the given axis using the
+    algorithm specified by the `kind` keyword. It returns an array of
+    indices of the same shape as `a` that index data along the given
+    axis in partitioned order.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        Array to sort.
+    kth : int or sequence of ints
+        Element index to partition by. The k-th element will be in its
+        final sorted position and all smaller elements will be moved
+        before it and all larger elements behind it. The order all
+        elements in the partitions is undefined. If provided with a
+        sequence of k-th it will partition all of them into their sorted
+        position at once.
+    axis : int or None, optional
+        Axis along which to sort. The default is -1 (the last axis). If
+        None, the flattened array is used.
+    kind : {'introselect'}, optional
+        Selection algorithm. Default is 'introselect'
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument
+        specifies which fields to compare first, second, etc. A single
+        field can be specified as a string, and not all fields need be
+        specified, but unspecified fields will still be used, in the
+        order in which they come up in the dtype, to break ties.
+
+    Returns
+    -------
+    index_array : ndarray, int
+        Array of indices that partition `a` along the specified axis.
+        If `a` is one-dimensional, ``a[index_array]`` yields a partitioned `a`.
+        More generally, ``np.take_along_axis(a, index_array, axis=a)`` always
+        yields the partitioned `a`, irrespective of dimensionality.
+
+    See Also
+    --------
+    partition : Describes partition algorithms used.
+    ndarray.partition : Inplace partition.
+    argsort : Full indirect sort.
+    take_along_axis : Apply ``index_array`` from argpartition
+                      to an array as if by calling partition.
+
+    Notes
+    -----
+    See `partition` for notes on the different selection algorithms.
+
+    Examples
+    --------
+    One dimensional array:
+
+    >>> x = np.array([3, 4, 2, 1])
+    >>> x[np.argpartition(x, 3)]
+    array([2, 1, 3, 4])
+    >>> x[np.argpartition(x, (1, 3))]
+    array([1, 2, 3, 4])
+
+    >>> x = [3, 4, 2, 1]
+    >>> np.array(x)[np.argpartition(x, 3)]
+    array([2, 1, 3, 4])
+
+    Multi-dimensional array:
+
+    >>> x = np.array([[3, 4, 2], [1, 3, 1]])
+    >>> index_array = np.argpartition(x, kth=1, axis=-1)
+    >>> np.take_along_axis(x, index_array, axis=-1)  # same as np.partition(x, kth=1)
+    array([[2, 3, 4],
+           [1, 1, 3]])
+
+    """
+    return _wrapfunc(a, 'argpartition', kth, axis=axis, kind=kind, order=order)
+
+
+def _sort_dispatcher(a, axis=None, kind=None, order=None):
+    return (a,)
+
+
+@array_function_dispatch(_sort_dispatcher)
+def sort(a, axis=-1, kind=None, order=None):
+    """
+    Return a sorted copy of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Array to be sorted.
+    axis : int or None, optional
+        Axis along which to sort. If None, the array is flattened before
+        sorting. The default is -1, which sorts along the last axis.
+    kind : {'quicksort', 'mergesort', 'heapsort', 'stable'}, optional
+        Sorting algorithm. The default is 'quicksort'. Note that both 'stable'
+        and 'mergesort' use timsort or radix sort under the covers and, in general,
+        the actual implementation will vary with data type. The 'mergesort' option
+        is retained for backwards compatibility.
+
+        .. versionchanged:: 1.15.0.
+           The 'stable' option was added.
+
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument specifies
+        which fields to compare first, second, etc.  A single field can
+        be specified as a string, and not all fields need be specified,
+        but unspecified fields will still be used, in the order in which
+        they come up in the dtype, to break ties.
+
+    Returns
+    -------
+    sorted_array : ndarray
+        Array of the same type and shape as `a`.
+
+    See Also
+    --------
+    ndarray.sort : Method to sort an array in-place.
+    argsort : Indirect sort.
+    lexsort : Indirect stable sort on multiple keys.
+    searchsorted : Find elements in a sorted array.
+    partition : Partial sort.
+
+    Notes
+    -----
+    The various sorting algorithms are characterized by their average speed,
+    worst case performance, work space size, and whether they are stable. A
+    stable sort keeps items with the same key in the same relative
+    order. The four algorithms implemented in NumPy have the following
+    properties:
+
+    =========== ======= ============= ============ ========
+       kind      speed   worst case    work space   stable
+    =========== ======= ============= ============ ========
+    'quicksort'    1     O(n^2)            0          no
+    'heapsort'     3     O(n*log(n))       0          no
+    'mergesort'    2     O(n*log(n))      ~n/2        yes
+    'timsort'      2     O(n*log(n))      ~n/2        yes
+    =========== ======= ============= ============ ========
+
+    .. note:: The datatype determines which of 'mergesort' or 'timsort'
+       is actually used, even if 'mergesort' is specified. User selection
+       at a finer scale is not currently available.
+
+    All the sort algorithms make temporary copies of the data when
+    sorting along any but the last axis.  Consequently, sorting along
+    the last axis is faster and uses less space than sorting along
+    any other axis.
+
+    The sort order for complex numbers is lexicographic. If both the real
+    and imaginary parts are non-nan then the order is determined by the
+    real parts except when they are equal, in which case the order is
+    determined by the imaginary parts.
+
+    Previous to numpy 1.4.0 sorting real and complex arrays containing nan
+    values led to undefined behaviour. In numpy versions >= 1.4.0 nan
+    values are sorted to the end. The extended sort order is:
+
+      * Real: [R, nan]
+      * Complex: [R + Rj, R + nanj, nan + Rj, nan + nanj]
+
+    where R is a non-nan real value. Complex values with the same nan
+    placements are sorted according to the non-nan part if it exists.
+    Non-nan values are sorted as before.
+
+    .. versionadded:: 1.12.0
+
+    quicksort has been changed to `introsort <https://en.wikipedia.org/wiki/Introsort>`_.
+    When sorting does not make enough progress it switches to
+    `heapsort <https://en.wikipedia.org/wiki/Heapsort>`_.
+    This implementation makes quicksort O(n*log(n)) in the worst case.
+
+    'stable' automatically chooses the best stable sorting algorithm
+    for the data type being sorted.
+    It, along with 'mergesort' is currently mapped to
+    `timsort <https://en.wikipedia.org/wiki/Timsort>`_
+    or `radix sort <https://en.wikipedia.org/wiki/Radix_sort>`_
+    depending on the data type.
+    API forward compatibility currently limits the
+    ability to select the implementation and it is hardwired for the different
+    data types.
+
+    .. versionadded:: 1.17.0
+
+    Timsort is added for better performance on already or nearly
+    sorted data. On random data timsort is almost identical to
+    mergesort. It is now used for stable sort while quicksort is still the
+    default sort if none is chosen. For timsort details, refer to
+    `CPython listsort.txt <https://github.com/python/cpython/blob/3.7/Objects/listsort.txt>`_.
+    'mergesort' and 'stable' are mapped to radix sort for integer data types. Radix sort is an
+    O(n) sort instead of O(n log n).
+
+    .. versionchanged:: 1.18.0
+
+    NaT now sorts to the end of arrays for consistency with NaN.
+
+    Examples
+    --------
+    >>> a = np.array([[1,4],[3,1]])
+    >>> np.sort(a)                # sort along the last axis
+    array([[1, 4],
+           [1, 3]])
+    >>> np.sort(a, axis=None)     # sort the flattened array
+    array([1, 1, 3, 4])
+    >>> np.sort(a, axis=0)        # sort along the first axis
+    array([[1, 1],
+           [3, 4]])
+
+    Use the `order` keyword to specify a field to use when sorting a
+    structured array:
+
+    >>> dtype = [('name', 'S10'), ('height', float), ('age', int)]
+    >>> values = [('Arthur', 1.8, 41), ('Lancelot', 1.9, 38),
+    ...           ('Galahad', 1.7, 38)]
+    >>> a = np.array(values, dtype=dtype)       # create a structured array
+    >>> np.sort(a, order='height')                        # doctest: +SKIP
+    array([('Galahad', 1.7, 38), ('Arthur', 1.8, 41),
+           ('Lancelot', 1.8999999999999999, 38)],
+          dtype=[('name', '|S10'), ('height', '<f8'), ('age', '<i4')])
+
+    Sort by age, then height if ages are equal:
+
+    >>> np.sort(a, order=['age', 'height'])               # doctest: +SKIP
+    array([('Galahad', 1.7, 38), ('Lancelot', 1.8999999999999999, 38),
+           ('Arthur', 1.8, 41)],
+          dtype=[('name', '|S10'), ('height', '<f8'), ('age', '<i4')])
+
+    """
+    if axis is None:
+        # flatten returns (1, N) for np.matrix, so always use the last axis
+        a = asanyarray(a).flatten()
+        axis = -1
+    else:
+        a = asanyarray(a).copy(order="K")
+    a.sort(axis=axis, kind=kind, order=order)
+    return a
+
+
+def _argsort_dispatcher(a, axis=None, kind=None, order=None):
+    return (a,)
+
+
+@array_function_dispatch(_argsort_dispatcher)
+def argsort(a, axis=-1, kind=None, order=None):
+    """
+    Returns the indices that would sort an array.
+
+    Perform an indirect sort along the given axis using the algorithm specified
+    by the `kind` keyword. It returns an array of indices of the same shape as
+    `a` that index data along the given axis in sorted order.
+
+    Parameters
+    ----------
+    a : array_like
+        Array to sort.
+    axis : int or None, optional
+        Axis along which to sort.  The default is -1 (the last axis). If None,
+        the flattened array is used.
+    kind : {'quicksort', 'mergesort', 'heapsort', 'stable'}, optional
+        Sorting algorithm. The default is 'quicksort'. Note that both 'stable'
+        and 'mergesort' use timsort under the covers and, in general, the
+        actual implementation will vary with data type. The 'mergesort' option
+        is retained for backwards compatibility.
+
+        .. versionchanged:: 1.15.0.
+           The 'stable' option was added.
+    order : str or list of str, optional
+        When `a` is an array with fields defined, this argument specifies
+        which fields to compare first, second, etc.  A single field can
+        be specified as a string, and not all fields need be specified,
+        but unspecified fields will still be used, in the order in which
+        they come up in the dtype, to break ties.
+
+    Returns
+    -------
+    index_array : ndarray, int
+        Array of indices that sort `a` along the specified `axis`.
+        If `a` is one-dimensional, ``a[index_array]`` yields a sorted `a`.
+        More generally, ``np.take_along_axis(a, index_array, axis=axis)``
+        always yields the sorted `a`, irrespective of dimensionality.
+
+    See Also
+    --------
+    sort : Describes sorting algorithms used.
+    lexsort : Indirect stable sort with multiple keys.
+    ndarray.sort : Inplace sort.
+    argpartition : Indirect partial sort.
+    take_along_axis : Apply ``index_array`` from argsort
+                      to an array as if by calling sort.
+
+    Notes
+    -----
+    See `sort` for notes on the different sorting algorithms.
+
+    As of NumPy 1.4.0 `argsort` works with real/complex arrays containing
+    nan values. The enhanced sort order is documented in `sort`.
+
+    Examples
+    --------
+    One dimensional array:
+
+    >>> x = np.array([3, 1, 2])
+    >>> np.argsort(x)
+    array([1, 2, 0])
+
+    Two-dimensional array:
+
+    >>> x = np.array([[0, 3], [2, 2]])
+    >>> x
+    array([[0, 3],
+           [2, 2]])
+
+    >>> ind = np.argsort(x, axis=0)  # sorts along first axis (down)
+    >>> ind
+    array([[0, 1],
+           [1, 0]])
+    >>> np.take_along_axis(x, ind, axis=0)  # same as np.sort(x, axis=0)
+    array([[0, 2],
+           [2, 3]])
+
+    >>> ind = np.argsort(x, axis=1)  # sorts along last axis (across)
+    >>> ind
+    array([[0, 1],
+           [0, 1]])
+    >>> np.take_along_axis(x, ind, axis=1)  # same as np.sort(x, axis=1)
+    array([[0, 3],
+           [2, 2]])
+
+    Indices of the sorted elements of a N-dimensional array:
+
+    >>> ind = np.unravel_index(np.argsort(x, axis=None), x.shape)
+    >>> ind
+    (array([0, 1, 1, 0]), array([0, 0, 1, 1]))
+    >>> x[ind]  # same as np.sort(x, axis=None)
+    array([0, 2, 2, 3])
+
+    Sorting with keys:
+
+    >>> x = np.array([(1, 0), (0, 1)], dtype=[('x', '<i4'), ('y', '<i4')])
+    >>> x
+    array([(1, 0), (0, 1)],
+          dtype=[('x', '<i4'), ('y', '<i4')])
+
+    >>> np.argsort(x, order=('x','y'))
+    array([1, 0])
+
+    >>> np.argsort(x, order=('y','x'))
+    array([0, 1])
+
+    """
+    return _wrapfunc(a, 'argsort', axis=axis, kind=kind, order=order)
+
+
+def _argmax_dispatcher(a, axis=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_argmax_dispatcher)
+def argmax(a, axis=None, out=None):
+    """
+    Returns the indices of the maximum values along an axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        By default, the index is into the flattened array, otherwise
+        along the specified axis.
+    out : array, optional
+        If provided, the result will be inserted into this array. It should
+        be of the appropriate shape and dtype.
+
+    Returns
+    -------
+    index_array : ndarray of ints
+        Array of indices into the array. It has the same shape as `a.shape`
+        with the dimension along `axis` removed.
+
+    See Also
+    --------
+    ndarray.argmax, argmin
+    amax : The maximum value along a given axis.
+    unravel_index : Convert a flat index into an index tuple.
+    take_along_axis : Apply ``np.expand_dims(index_array, axis)``
+                      from argmax to an array as if by calling max.
+
+    Notes
+    -----
+    In case of multiple occurrences of the maximum values, the indices
+    corresponding to the first occurrence are returned.
+
+    Examples
+    --------
+    >>> a = np.arange(6).reshape(2,3) + 10
+    >>> a
+    array([[10, 11, 12],
+           [13, 14, 15]])
+    >>> np.argmax(a)
+    5
+    >>> np.argmax(a, axis=0)
+    array([1, 1, 1])
+    >>> np.argmax(a, axis=1)
+    array([2, 2])
+
+    Indexes of the maximal elements of a N-dimensional array:
+
+    >>> ind = np.unravel_index(np.argmax(a, axis=None), a.shape)
+    >>> ind
+    (1, 2)
+    >>> a[ind]
+    15
+
+    >>> b = np.arange(6)
+    >>> b[1] = 5
+    >>> b
+    array([0, 5, 2, 3, 4, 5])
+    >>> np.argmax(b)  # Only the first occurrence is returned.
+    1
+
+    >>> x = np.array([[4,2,3], [1,0,3]])
+    >>> index_array = np.argmax(x, axis=-1)
+    >>> # Same as np.max(x, axis=-1, keepdims=True)
+    >>> np.take_along_axis(x, np.expand_dims(index_array, axis=-1), axis=-1)
+    array([[4],
+           [3]])
+    >>> # Same as np.max(x, axis=-1)
+    >>> np.take_along_axis(x, np.expand_dims(index_array, axis=-1), axis=-1).squeeze(axis=-1)
+    array([4, 3])
+
+    """
+    return _wrapfunc(a, 'argmax', axis=axis, out=out)
+
+
+def _argmin_dispatcher(a, axis=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_argmin_dispatcher)
+def argmin(a, axis=None, out=None):
+    """
+    Returns the indices of the minimum values along an axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        By default, the index is into the flattened array, otherwise
+        along the specified axis.
+    out : array, optional
+        If provided, the result will be inserted into this array. It should
+        be of the appropriate shape and dtype.
+
+    Returns
+    -------
+    index_array : ndarray of ints
+        Array of indices into the array. It has the same shape as `a.shape`
+        with the dimension along `axis` removed.
+
+    See Also
+    --------
+    ndarray.argmin, argmax
+    amin : The minimum value along a given axis.
+    unravel_index : Convert a flat index into an index tuple.
+    take_along_axis : Apply ``np.expand_dims(index_array, axis)``
+                      from argmin to an array as if by calling min.
+
+    Notes
+    -----
+    In case of multiple occurrences of the minimum values, the indices
+    corresponding to the first occurrence are returned.
+
+    Examples
+    --------
+    >>> a = np.arange(6).reshape(2,3) + 10
+    >>> a
+    array([[10, 11, 12],
+           [13, 14, 15]])
+    >>> np.argmin(a)
+    0
+    >>> np.argmin(a, axis=0)
+    array([0, 0, 0])
+    >>> np.argmin(a, axis=1)
+    array([0, 0])
+
+    Indices of the minimum elements of a N-dimensional array:
+
+    >>> ind = np.unravel_index(np.argmin(a, axis=None), a.shape)
+    >>> ind
+    (0, 0)
+    >>> a[ind]
+    10
+
+    >>> b = np.arange(6) + 10
+    >>> b[4] = 10
+    >>> b
+    array([10, 11, 12, 13, 10, 15])
+    >>> np.argmin(b)  # Only the first occurrence is returned.
+    0
+
+    >>> x = np.array([[4,2,3], [1,0,3]])
+    >>> index_array = np.argmin(x, axis=-1)
+    >>> # Same as np.min(x, axis=-1, keepdims=True)
+    >>> np.take_along_axis(x, np.expand_dims(index_array, axis=-1), axis=-1)
+    array([[2],
+           [0]])
+    >>> # Same as np.max(x, axis=-1)
+    >>> np.take_along_axis(x, np.expand_dims(index_array, axis=-1), axis=-1).squeeze(axis=-1)
+    array([2, 0])
+
+    """
+    return _wrapfunc(a, 'argmin', axis=axis, out=out)
+
+
+def _searchsorted_dispatcher(a, v, side=None, sorter=None):
+    return (a, v, sorter)
+
+
+@array_function_dispatch(_searchsorted_dispatcher)
+def searchsorted(a, v, side='left', sorter=None):
+    """
+    Find indices where elements should be inserted to maintain order.
+
+    Find the indices into a sorted array `a` such that, if the
+    corresponding elements in `v` were inserted before the indices, the
+    order of `a` would be preserved.
+
+    Assuming that `a` is sorted:
+
+    ======  ============================
+    `side`  returned index `i` satisfies
+    ======  ============================
+    left    ``a[i-1] < v <= a[i]``
+    right   ``a[i-1] <= v < a[i]``
+    ======  ============================
+
+    Parameters
+    ----------
+    a : 1-D array_like
+        Input array. If `sorter` is None, then it must be sorted in
+        ascending order, otherwise `sorter` must be an array of indices
+        that sort it.
+    v : array_like
+        Values to insert into `a`.
+    side : {'left', 'right'}, optional
+        If 'left', the index of the first suitable location found is given.
+        If 'right', return the last such index.  If there is no suitable
+        index, return either 0 or N (where N is the length of `a`).
+    sorter : 1-D array_like, optional
+        Optional array of integer indices that sort array a into ascending
+        order. They are typically the result of argsort.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    indices : array of ints
+        Array of insertion points with the same shape as `v`.
+
+    See Also
+    --------
+    sort : Return a sorted copy of an array.
+    histogram : Produce histogram from 1-D data.
+
+    Notes
+    -----
+    Binary search is used to find the required insertion points.
+
+    As of NumPy 1.4.0 `searchsorted` works with real/complex arrays containing
+    `nan` values. The enhanced sort order is documented in `sort`.
+
+    This function uses the same algorithm as the builtin python `bisect.bisect_left`
+    (``side='left'``) and `bisect.bisect_right` (``side='right'``) functions,
+    which is also vectorized in the `v` argument.
+
+    Examples
+    --------
+    >>> np.searchsorted([1,2,3,4,5], 3)
+    2
+    >>> np.searchsorted([1,2,3,4,5], 3, side='right')
+    3
+    >>> np.searchsorted([1,2,3,4,5], [-10, 10, 2, 3])
+    array([0, 5, 1, 2])
+
+    """
+    return _wrapfunc(a, 'searchsorted', v, side=side, sorter=sorter)
+
+
+def _resize_dispatcher(a, new_shape):
+    return (a,)
+
+
+@array_function_dispatch(_resize_dispatcher)
+def resize(a, new_shape):
+    """
+    Return a new array with the specified shape.
+
+    If the new array is larger than the original array, then the new
+    array is filled with repeated copies of `a`.  Note that this behavior
+    is different from a.resize(new_shape) which fills with zeros instead
+    of repeated copies of `a`.
+
+    Parameters
+    ----------
+    a : array_like
+        Array to be resized.
+
+    new_shape : int or tuple of int
+        Shape of resized array.
+
+    Returns
+    -------
+    reshaped_array : ndarray
+        The new array is formed from the data in the old array, repeated
+        if necessary to fill out the required number of elements.  The
+        data are repeated in the order that they are stored in memory.
+
+    See Also
+    --------
+    ndarray.resize : resize an array in-place.
+
+    Notes
+    -----
+    Warning: This functionality does **not** consider axes separately,
+    i.e. it does not apply interpolation/extrapolation.
+    It fills the return array with the required number of elements, taken
+    from `a` as they are laid out in memory, disregarding strides and axes.
+    (This is in case the new shape is smaller. For larger, see above.)
+    This functionality is therefore not suitable to resize images,
+    or data where each axis represents a separate and distinct entity.
+
+    Examples
+    --------
+    >>> a=np.array([[0,1],[2,3]])
+    >>> np.resize(a,(2,3))
+    array([[0, 1, 2],
+           [3, 0, 1]])
+    >>> np.resize(a,(1,4))
+    array([[0, 1, 2, 3]])
+    >>> np.resize(a,(2,4))
+    array([[0, 1, 2, 3],
+           [0, 1, 2, 3]])
+
+    """
+    if isinstance(new_shape, (int, nt.integer)):
+        new_shape = (new_shape,)
+    a = ravel(a)
+    Na = len(a)
+    total_size = um.multiply.reduce(new_shape)
+    if Na == 0 or total_size == 0:
+        return mu.zeros(new_shape, a.dtype)
+
+    n_copies = int(total_size / Na)
+    extra = total_size % Na
+
+    if extra != 0:
+        n_copies = n_copies + 1
+        extra = Na - extra
+
+    a = concatenate((a,) * n_copies)
+    if extra > 0:
+        a = a[:-extra]
+
+    return reshape(a, new_shape)
+
+
+def _squeeze_dispatcher(a, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_squeeze_dispatcher)
+def squeeze(a, axis=None):
+    """
+    Remove single-dimensional entries from the shape of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : None or int or tuple of ints, optional
+        .. versionadded:: 1.7.0
+
+        Selects a subset of the single-dimensional entries in the
+        shape. If an axis is selected with shape entry greater than
+        one, an error is raised.
+
+    Returns
+    -------
+    squeezed : ndarray
+        The input array, but with all or a subset of the
+        dimensions of length 1 removed. This is always `a` itself
+        or a view into `a`. Note that if all axes are squeezed,
+        the result is a 0d array and not a scalar.
+
+    Raises
+    ------
+    ValueError
+        If `axis` is not None, and an axis being squeezed is not of length 1
+
+    See Also
+    --------
+    expand_dims : The inverse operation, adding singleton dimensions
+    reshape : Insert, remove, and combine dimensions, and resize existing ones
+
+    Examples
+    --------
+    >>> x = np.array([[[0], [1], [2]]])
+    >>> x.shape
+    (1, 3, 1)
+    >>> np.squeeze(x).shape
+    (3,)
+    >>> np.squeeze(x, axis=0).shape
+    (3, 1)
+    >>> np.squeeze(x, axis=1).shape
+    Traceback (most recent call last):
+    ...
+    ValueError: cannot select an axis to squeeze out which has size not equal to one
+    >>> np.squeeze(x, axis=2).shape
+    (1, 3)
+    >>> x = np.array([[1234]])
+    >>> x.shape
+    (1, 1)
+    >>> np.squeeze(x)
+    array(1234)  # 0d array
+    >>> np.squeeze(x).shape
+    ()
+    >>> np.squeeze(x)[()]
+    1234
+
+    """
+    try:
+        squeeze = a.squeeze
+    except AttributeError:
+        return _wrapit(a, 'squeeze', axis=axis)
+    if axis is None:
+        return squeeze()
+    else:
+        return squeeze(axis=axis)
+
+
+def _diagonal_dispatcher(a, offset=None, axis1=None, axis2=None):
+    return (a,)
+
+
+@array_function_dispatch(_diagonal_dispatcher)
+def diagonal(a, offset=0, axis1=0, axis2=1):
+    """
+    Return specified diagonals.
+
+    If `a` is 2-D, returns the diagonal of `a` with the given offset,
+    i.e., the collection of elements of the form ``a[i, i+offset]``.  If
+    `a` has more than two dimensions, then the axes specified by `axis1`
+    and `axis2` are used to determine the 2-D sub-array whose diagonal is
+    returned.  The shape of the resulting array can be determined by
+    removing `axis1` and `axis2` and appending an index to the right equal
+    to the size of the resulting diagonals.
+
+    In versions of NumPy prior to 1.7, this function always returned a new,
+    independent array containing a copy of the values in the diagonal.
+
+    In NumPy 1.7 and 1.8, it continues to return a copy of the diagonal,
+    but depending on this fact is deprecated. Writing to the resulting
+    array continues to work as it used to, but a FutureWarning is issued.
+
+    Starting in NumPy 1.9 it returns a read-only view on the original array.
+    Attempting to write to the resulting array will produce an error.
+
+    In some future release, it will return a read/write view and writing to
+    the returned array will alter your original array.  The returned array
+    will have the same type as the input array.
+
+    If you don't write to the array returned by this function, then you can
+    just ignore all of the above.
+
+    If you depend on the current behavior, then we suggest copying the
+    returned array explicitly, i.e., use ``np.diagonal(a).copy()`` instead
+    of just ``np.diagonal(a)``. This will work with both past and future
+    versions of NumPy.
+
+    Parameters
+    ----------
+    a : array_like
+        Array from which the diagonals are taken.
+    offset : int, optional
+        Offset of the diagonal from the main diagonal.  Can be positive or
+        negative.  Defaults to main diagonal (0).
+    axis1 : int, optional
+        Axis to be used as the first axis of the 2-D sub-arrays from which
+        the diagonals should be taken.  Defaults to first axis (0).
+    axis2 : int, optional
+        Axis to be used as the second axis of the 2-D sub-arrays from
+        which the diagonals should be taken. Defaults to second axis (1).
+
+    Returns
+    -------
+    array_of_diagonals : ndarray
+        If `a` is 2-D, then a 1-D array containing the diagonal and of the
+        same type as `a` is returned unless `a` is a `matrix`, in which case
+        a 1-D array rather than a (2-D) `matrix` is returned in order to
+        maintain backward compatibility.
+
+        If ``a.ndim > 2``, then the dimensions specified by `axis1` and `axis2`
+        are removed, and a new axis inserted at the end corresponding to the
+        diagonal.
+
+    Raises
+    ------
+    ValueError
+        If the dimension of `a` is less than 2.
+
+    See Also
+    --------
+    diag : MATLAB work-a-like for 1-D and 2-D arrays.
+    diagflat : Create diagonal arrays.
+    trace : Sum along diagonals.
+
+    Examples
+    --------
+    >>> a = np.arange(4).reshape(2,2)
+    >>> a
+    array([[0, 1],
+           [2, 3]])
+    >>> a.diagonal()
+    array([0, 3])
+    >>> a.diagonal(1)
+    array([1])
+
+    A 3-D example:
+
+    >>> a = np.arange(8).reshape(2,2,2); a
+    array([[[0, 1],
+            [2, 3]],
+           [[4, 5],
+            [6, 7]]])
+    >>> a.diagonal(0,  # Main diagonals of two arrays created by skipping
+    ...            0,  # across the outer(left)-most axis last and
+    ...            1)  # the "middle" (row) axis first.
+    array([[0, 6],
+           [1, 7]])
+
+    The sub-arrays whose main diagonals we just obtained; note that each
+    corresponds to fixing the right-most (column) axis, and that the
+    diagonals are "packed" in rows.
+
+    >>> a[:,:,0]  # main diagonal is [0 6]
+    array([[0, 2],
+           [4, 6]])
+    >>> a[:,:,1]  # main diagonal is [1 7]
+    array([[1, 3],
+           [5, 7]])
+
+    The anti-diagonal can be obtained by reversing the order of elements
+    using either `numpy.flipud` or `numpy.fliplr`.
+
+    >>> a = np.arange(9).reshape(3, 3)
+    >>> a
+    array([[0, 1, 2],
+           [3, 4, 5],
+           [6, 7, 8]])
+    >>> np.fliplr(a).diagonal()  # Horizontal flip
+    array([2, 4, 6])
+    >>> np.flipud(a).diagonal()  # Vertical flip
+    array([6, 4, 2])
+
+    Note that the order in which the diagonal is retrieved varies depending
+    on the flip function.
+    """
+    if isinstance(a, np.matrix):
+        # Make diagonal of matrix 1-D to preserve backward compatibility.
+        return asarray(a).diagonal(offset=offset, axis1=axis1, axis2=axis2)
+    else:
+        return asanyarray(a).diagonal(offset=offset, axis1=axis1, axis2=axis2)
+
+
+def _trace_dispatcher(
+        a, offset=None, axis1=None, axis2=None, dtype=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_trace_dispatcher)
+def trace(a, offset=0, axis1=0, axis2=1, dtype=None, out=None):
+    """
+    Return the sum along diagonals of the array.
+
+    If `a` is 2-D, the sum along its diagonal with the given offset
+    is returned, i.e., the sum of elements ``a[i,i+offset]`` for all i.
+
+    If `a` has more than two dimensions, then the axes specified by axis1 and
+    axis2 are used to determine the 2-D sub-arrays whose traces are returned.
+    The shape of the resulting array is the same as that of `a` with `axis1`
+    and `axis2` removed.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, from which the diagonals are taken.
+    offset : int, optional
+        Offset of the diagonal from the main diagonal. Can be both positive
+        and negative. Defaults to 0.
+    axis1, axis2 : int, optional
+        Axes to be used as the first and second axis of the 2-D sub-arrays
+        from which the diagonals should be taken. Defaults are the first two
+        axes of `a`.
+    dtype : dtype, optional
+        Determines the data-type of the returned array and of the accumulator
+        where the elements are summed. If dtype has the value None and `a` is
+        of integer type of precision less than the default integer
+        precision, then the default integer precision is used. Otherwise,
+        the precision is the same as that of `a`.
+    out : ndarray, optional
+        Array into which the output is placed. Its type is preserved and
+        it must be of the right shape to hold the output.
+
+    Returns
+    -------
+    sum_along_diagonals : ndarray
+        If `a` is 2-D, the sum along the diagonal is returned.  If `a` has
+        larger dimensions, then an array of sums along diagonals is returned.
+
+    See Also
+    --------
+    diag, diagonal, diagflat
+
+    Examples
+    --------
+    >>> np.trace(np.eye(3))
+    3.0
+    >>> a = np.arange(8).reshape((2,2,2))
+    >>> np.trace(a)
+    array([6, 8])
+
+    >>> a = np.arange(24).reshape((2,2,2,3))
+    >>> np.trace(a).shape
+    (2, 3)
+
+    """
+    if isinstance(a, np.matrix):
+        # Get trace of matrix via an array to preserve backward compatibility.
+        return asarray(a).trace(offset=offset, axis1=axis1, axis2=axis2, dtype=dtype, out=out)
+    else:
+        return asanyarray(a).trace(offset=offset, axis1=axis1, axis2=axis2, dtype=dtype, out=out)
+
+
+def _ravel_dispatcher(a, order=None):
+    return (a,)
+
+
+@array_function_dispatch(_ravel_dispatcher)
+def ravel(a, order='C'):
+    """Return a contiguous flattened array.
+
+    A 1-D array, containing the elements of the input, is returned.  A copy is
+    made only if needed.
+
+    As of NumPy 1.10, the returned array will have the same type as the input
+    array. (for example, a masked array will be returned for a masked array
+    input)
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.  The elements in `a` are read in the order specified by
+        `order`, and packed as a 1-D array.
+    order : {'C','F', 'A', 'K'}, optional
+
+        The elements of `a` are read using this index order. 'C' means
+        to index the elements in row-major, C-style order,
+        with the last axis index changing fastest, back to the first
+        axis index changing slowest.  'F' means to index the elements
+        in column-major, Fortran-style order, with the
+        first index changing fastest, and the last index changing
+        slowest. Note that the 'C' and 'F' options take no account of
+        the memory layout of the underlying array, and only refer to
+        the order of axis indexing.  'A' means to read the elements in
+        Fortran-like index order if `a` is Fortran *contiguous* in
+        memory, C-like order otherwise.  'K' means to read the
+        elements in the order they occur in memory, except for
+        reversing the data when strides are negative.  By default, 'C'
+        index order is used.
+
+    Returns
+    -------
+    y : array_like
+        y is an array of the same subtype as `a`, with shape ``(a.size,)``.
+        Note that matrices are special cased for backward compatibility, if `a`
+        is a matrix, then y is a 1-D ndarray.
+
+    See Also
+    --------
+    ndarray.flat : 1-D iterator over an array.
+    ndarray.flatten : 1-D array copy of the elements of an array
+                      in row-major order.
+    ndarray.reshape : Change the shape of an array without changing its data.
+
+    Notes
+    -----
+    In row-major, C-style order, in two dimensions, the row index
+    varies the slowest, and the column index the quickest.  This can
+    be generalized to multiple dimensions, where row-major order
+    implies that the index along the first axis varies slowest, and
+    the index along the last quickest.  The opposite holds for
+    column-major, Fortran-style index ordering.
+
+    When a view is desired in as many cases as possible, ``arr.reshape(-1)``
+    may be preferable.
+
+    Examples
+    --------
+    It is equivalent to ``reshape(-1, order=order)``.
+
+    >>> x = np.array([[1, 2, 3], [4, 5, 6]])
+    >>> np.ravel(x)
+    array([1, 2, 3, 4, 5, 6])
+
+    >>> x.reshape(-1)
+    array([1, 2, 3, 4, 5, 6])
+
+    >>> np.ravel(x, order='F')
+    array([1, 4, 2, 5, 3, 6])
+
+    When ``order`` is 'A', it will preserve the array's 'C' or 'F' ordering:
+
+    >>> np.ravel(x.T)
+    array([1, 4, 2, 5, 3, 6])
+    >>> np.ravel(x.T, order='A')
+    array([1, 2, 3, 4, 5, 6])
+
+    When ``order`` is 'K', it will preserve orderings that are neither 'C'
+    nor 'F', but won't reverse axes:
+
+    >>> a = np.arange(3)[::-1]; a
+    array([2, 1, 0])
+    >>> a.ravel(order='C')
+    array([2, 1, 0])
+    >>> a.ravel(order='K')
+    array([2, 1, 0])
+
+    >>> a = np.arange(12).reshape(2,3,2).swapaxes(1,2); a
+    array([[[ 0,  2,  4],
+            [ 1,  3,  5]],
+           [[ 6,  8, 10],
+            [ 7,  9, 11]]])
+    >>> a.ravel(order='C')
+    array([ 0,  2,  4,  1,  3,  5,  6,  8, 10,  7,  9, 11])
+    >>> a.ravel(order='K')
+    array([ 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11])
+
+    """
+    if isinstance(a, np.matrix):
+        return asarray(a).ravel(order=order)
+    else:
+        return asanyarray(a).ravel(order=order)
+
+
+def _nonzero_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_nonzero_dispatcher)
+def nonzero(a):
+    """
+    Return the indices of the elements that are non-zero.
+
+    Returns a tuple of arrays, one for each dimension of `a`,
+    containing the indices of the non-zero elements in that
+    dimension. The values in `a` are always tested and returned in
+    row-major, C-style order.
+
+    To group the indices by element, rather than dimension, use `argwhere`,
+    which returns a row for each non-zero element.
+
+    .. note::
+
+       When called on a zero-d array or scalar, ``nonzero(a)`` is treated
+       as ``nonzero(atleast1d(a))``.
+
+       .. deprecated:: 1.17.0
+
+          Use `atleast1d` explicitly if this behavior is deliberate.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+
+    Returns
+    -------
+    tuple_of_arrays : tuple
+        Indices of elements that are non-zero.
+
+    See Also
+    --------
+    flatnonzero :
+        Return indices that are non-zero in the flattened version of the input
+        array.
+    ndarray.nonzero :
+        Equivalent ndarray method.
+    count_nonzero :
+        Counts the number of non-zero elements in the input array.
+
+    Notes
+    -----
+    While the nonzero values can be obtained with ``a[nonzero(a)]``, it is
+    recommended to use ``x[x.astype(bool)]`` or ``x[x != 0]`` instead, which
+    will correctly handle 0-d arrays.
+
+    Examples
+    --------
+    >>> x = np.array([[3, 0, 0], [0, 4, 0], [5, 6, 0]])
+    >>> x
+    array([[3, 0, 0],
+           [0, 4, 0],
+           [5, 6, 0]])
+    >>> np.nonzero(x)
+    (array([0, 1, 2, 2]), array([0, 1, 0, 1]))
+
+    >>> x[np.nonzero(x)]
+    array([3, 4, 5, 6])
+    >>> np.transpose(np.nonzero(x))
+    array([[0, 0],
+           [1, 1],
+           [2, 0],
+           [2, 1]])
+
+    A common use for ``nonzero`` is to find the indices of an array, where
+    a condition is True.  Given an array `a`, the condition `a` > 3 is a
+    boolean array and since False is interpreted as 0, np.nonzero(a > 3)
+    yields the indices of the `a` where the condition is true.
+
+    >>> a = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]])
+    >>> a > 3
+    array([[False, False, False],
+           [ True,  True,  True],
+           [ True,  True,  True]])
+    >>> np.nonzero(a > 3)
+    (array([1, 1, 1, 2, 2, 2]), array([0, 1, 2, 0, 1, 2]))
+
+    Using this result to index `a` is equivalent to using the mask directly:
+
+    >>> a[np.nonzero(a > 3)]
+    array([4, 5, 6, 7, 8, 9])
+    >>> a[a > 3]  # prefer this spelling
+    array([4, 5, 6, 7, 8, 9])
+
+    ``nonzero`` can also be called as a method of the array.
+
+    >>> (a > 3).nonzero()
+    (array([1, 1, 1, 2, 2, 2]), array([0, 1, 2, 0, 1, 2]))
+
+    """
+    return _wrapfunc(a, 'nonzero')
+
+
+def _shape_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_shape_dispatcher)
+def shape(a):
+    """
+    Return the shape of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+
+    Returns
+    -------
+    shape : tuple of ints
+        The elements of the shape tuple give the lengths of the
+        corresponding array dimensions.
+
+    See Also
+    --------
+    alen
+    ndarray.shape : Equivalent array method.
+
+    Examples
+    --------
+    >>> np.shape(np.eye(3))
+    (3, 3)
+    >>> np.shape([[1, 2]])
+    (1, 2)
+    >>> np.shape([0])
+    (1,)
+    >>> np.shape(0)
+    ()
+
+    >>> a = np.array([(1, 2), (3, 4)], dtype=[('x', 'i4'), ('y', 'i4')])
+    >>> np.shape(a)
+    (2,)
+    >>> a.shape
+    (2,)
+
+    """
+    try:
+        result = a.shape
+    except AttributeError:
+        result = asarray(a).shape
+    return result
+
+
+def _compress_dispatcher(condition, a, axis=None, out=None):
+    return (condition, a, out)
+
+
+@array_function_dispatch(_compress_dispatcher)
+def compress(condition, a, axis=None, out=None):
+    """
+    Return selected slices of an array along given axis.
+
+    When working along a given axis, a slice along that axis is returned in
+    `output` for each index where `condition` evaluates to True. When
+    working on a 1-D array, `compress` is equivalent to `extract`.
+
+    Parameters
+    ----------
+    condition : 1-D array of bools
+        Array that selects which entries to return. If len(condition)
+        is less than the size of `a` along the given axis, then output is
+        truncated to the length of the condition array.
+    a : array_like
+        Array from which to extract a part.
+    axis : int, optional
+        Axis along which to take slices. If None (default), work on the
+        flattened array.
+    out : ndarray, optional
+        Output array.  Its type is preserved and it must be of the right
+        shape to hold the output.
+
+    Returns
+    -------
+    compressed_array : ndarray
+        A copy of `a` without the slices along axis for which `condition`
+        is false.
+
+    See Also
+    --------
+    take, choose, diag, diagonal, select
+    ndarray.compress : Equivalent method in ndarray
+    np.extract: Equivalent method when working on 1-D arrays
+    ufuncs-output-type
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4], [5, 6]])
+    >>> a
+    array([[1, 2],
+           [3, 4],
+           [5, 6]])
+    >>> np.compress([0, 1], a, axis=0)
+    array([[3, 4]])
+    >>> np.compress([False, True, True], a, axis=0)
+    array([[3, 4],
+           [5, 6]])
+    >>> np.compress([False, True], a, axis=1)
+    array([[2],
+           [4],
+           [6]])
+
+    Working on the flattened array does not return slices along an axis but
+    selects elements.
+
+    >>> np.compress([False, True], a)
+    array([2])
+
+    """
+    return _wrapfunc(a, 'compress', condition, axis=axis, out=out)
+
+
+def _clip_dispatcher(a, a_min, a_max, out=None, **kwargs):
+    return (a, a_min, a_max)
+
+
+@array_function_dispatch(_clip_dispatcher)
+def clip(a, a_min, a_max, out=None, **kwargs):
+    """
+    Clip (limit) the values in an array.
+
+    Given an interval, values outside the interval are clipped to
+    the interval edges.  For example, if an interval of ``[0, 1]``
+    is specified, values smaller than 0 become 0, and values larger
+    than 1 become 1.
+
+    Equivalent to but faster than ``np.minimum(a_max, np.maximum(a, a_min))``.
+
+    No check is performed to ensure ``a_min < a_max``.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing elements to clip.
+    a_min : scalar or array_like or None
+        Minimum value. If None, clipping is not performed on lower
+        interval edge. Not more than one of `a_min` and `a_max` may be
+        None.
+    a_max : scalar or array_like or None
+        Maximum value. If None, clipping is not performed on upper
+        interval edge. Not more than one of `a_min` and `a_max` may be
+        None. If `a_min` or `a_max` are array_like, then the three
+        arrays will be broadcasted to match their shapes.
+    out : ndarray, optional
+        The results will be placed in this array. It may be the input
+        array for in-place clipping.  `out` must be of the right shape
+        to hold the output.  Its type is preserved.
+    **kwargs
+        For other keyword-only arguments, see the
+        :ref:`ufunc docs <ufuncs.kwargs>`.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    clipped_array : ndarray
+        An array with the elements of `a`, but where values
+        < `a_min` are replaced with `a_min`, and those > `a_max`
+        with `a_max`.
+
+    See Also
+    --------
+    ufuncs-output-type
+
+    Examples
+    --------
+    >>> a = np.arange(10)
+    >>> np.clip(a, 1, 8)
+    array([1, 1, 2, 3, 4, 5, 6, 7, 8, 8])
+    >>> a
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+    >>> np.clip(a, 3, 6, out=a)
+    array([3, 3, 3, 3, 4, 5, 6, 6, 6, 6])
+    >>> a = np.arange(10)
+    >>> a
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+    >>> np.clip(a, [3, 4, 1, 1, 1, 4, 4, 4, 4, 4], 8)
+    array([3, 4, 2, 3, 4, 5, 6, 7, 8, 8])
+
+    """
+    return _wrapfunc(a, 'clip', a_min, a_max, out=out, **kwargs)
+
+
+def _sum_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None,
+                    initial=None, where=None):
+    return (a, out)
+
+
+@array_function_dispatch(_sum_dispatcher)
+def sum(a, axis=None, dtype=None, out=None, keepdims=np._NoValue,
+        initial=np._NoValue, where=np._NoValue):
+    """
+    Sum of array elements over a given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Elements to sum.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which a sum is performed.  The default,
+        axis=None, will sum all of the elements of the input array.  If
+        axis is negative it counts from the last to the first axis.
+
+        .. versionadded:: 1.7.0
+
+        If axis is a tuple of ints, a sum is performed on all of the axes
+        specified in the tuple instead of a single axis or all the axes as
+        before.
+    dtype : dtype, optional
+        The type of the returned array and of the accumulator in which the
+        elements are summed.  The dtype of `a` is used by default unless `a`
+        has an integer dtype of less precision than the default platform
+        integer.  In that case, if `a` is signed then the platform integer
+        is used while if `a` is unsigned then an unsigned integer of the
+        same precision as the platform integer is used.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must have
+        the same shape as the expected output, but the type of the output
+        values will be cast if necessary.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `sum` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+    initial : scalar, optional
+        Starting value for the sum. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.15.0
+
+    where : array_like of bool, optional
+        Elements to include in the sum. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    sum_along_axis : ndarray
+        An array with the same shape as `a`, with the specified
+        axis removed.   If `a` is a 0-d array, or if `axis` is None, a scalar
+        is returned.  If an output array is specified, a reference to
+        `out` is returned.
+
+    See Also
+    --------
+    ndarray.sum : Equivalent method.
+
+    add.reduce : Equivalent functionality of `add`.
+
+    cumsum : Cumulative sum of array elements.
+
+    trapz : Integration of array values using the composite trapezoidal rule.
+
+    mean, average
+
+    Notes
+    -----
+    Arithmetic is modular when using integer types, and no error is
+    raised on overflow.
+
+    The sum of an empty array is the neutral element 0:
+
+    >>> np.sum([])
+    0.0
+
+    For floating point numbers the numerical precision of sum (and
+    ``np.add.reduce``) is in general limited by directly adding each number
+    individually to the result causing rounding errors in every step.
+    However, often numpy will use a  numerically better approach (partial
+    pairwise summation) leading to improved precision in many use-cases.
+    This improved precision is always provided when no ``axis`` is given.
+    When ``axis`` is given, it will depend on which axis is summed.
+    Technically, to provide the best speed possible, the improved precision
+    is only used when the summation is along the fast axis in memory.
+    Note that the exact precision may vary depending on other parameters.
+    In contrast to NumPy, Python's ``math.fsum`` function uses a slower but
+    more precise approach to summation.
+    Especially when summing a large number of lower precision floating point
+    numbers, such as ``float32``, numerical errors can become significant.
+    In such cases it can be advisable to use `dtype="float64"` to use a higher
+    precision for the output.
+
+    Examples
+    --------
+    >>> np.sum([0.5, 1.5])
+    2.0
+    >>> np.sum([0.5, 0.7, 0.2, 1.5], dtype=np.int32)
+    1
+    >>> np.sum([[0, 1], [0, 5]])
+    6
+    >>> np.sum([[0, 1], [0, 5]], axis=0)
+    array([0, 6])
+    >>> np.sum([[0, 1], [0, 5]], axis=1)
+    array([1, 5])
+    >>> np.sum([[0, 1], [np.nan, 5]], where=[False, True], axis=1)
+    array([1., 5.])
+
+    If the accumulator is too small, overflow occurs:
+
+    >>> np.ones(128, dtype=np.int8).sum(dtype=np.int8)
+    -128
+
+    You can also start the sum with a value other than zero:
+
+    >>> np.sum([10], initial=5)
+    15
+    """
+    if isinstance(a, _gentype):
+        # 2018-02-25, 1.15.0
+        warnings.warn(
+            "Calling np.sum(generator) is deprecated, and in the future will give a different result. "
+            "Use np.sum(np.fromiter(generator)) or the python sum builtin instead.",
+            DeprecationWarning, stacklevel=3)
+
+        res = _sum_(a)
+        if out is not None:
+            out[...] = res
+            return out
+        return res
+
+    return _wrapreduction(a, np.add, 'sum', axis, dtype, out, keepdims=keepdims,
+                          initial=initial, where=where)
+
+
+def _any_dispatcher(a, axis=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_any_dispatcher)
+def any(a, axis=None, out=None, keepdims=np._NoValue):
+    """
+    Test whether any array element along a given axis evaluates to True.
+
+    Returns single boolean unless `axis` is not ``None``
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which a logical OR reduction is performed.
+        The default (``axis=None``) is to perform a logical OR over all
+        the dimensions of the input array. `axis` may be negative, in
+        which case it counts from the last to the first axis.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, a reduction is performed on multiple
+        axes, instead of a single axis or all the axes as before.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  It must have
+        the same shape as the expected output and its type is preserved
+        (e.g., if it is of type float, then it will remain so, returning
+        1.0 for True and 0.0 for False, regardless of the type of `a`).
+        See `ufuncs-output-type` for more details.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `any` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    any : bool or ndarray
+        A new boolean or `ndarray` is returned unless `out` is specified,
+        in which case a reference to `out` is returned.
+
+    See Also
+    --------
+    ndarray.any : equivalent method
+
+    all : Test whether all elements along a given axis evaluate to True.
+
+    Notes
+    -----
+    Not a Number (NaN), positive infinity and negative infinity evaluate
+    to `True` because these are not equal to zero.
+
+    Examples
+    --------
+    >>> np.any([[True, False], [True, True]])
+    True
+
+    >>> np.any([[True, False], [False, False]], axis=0)
+    array([ True, False])
+
+    >>> np.any([-1, 0, 5])
+    True
+
+    >>> np.any(np.nan)
+    True
+
+    >>> o=np.array(False)
+    >>> z=np.any([-1, 4, 5], out=o)
+    >>> z, o
+    (array(True), array(True))
+    >>> # Check now that z is a reference to o
+    >>> z is o
+    True
+    >>> id(z), id(o) # identity of z and o              # doctest: +SKIP
+    (191614240, 191614240)
+
+    """
+    return _wrapreduction(a, np.logical_or, 'any', axis, None, out, keepdims=keepdims)
+
+
+def _all_dispatcher(a, axis=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_all_dispatcher)
+def all(a, axis=None, out=None, keepdims=np._NoValue):
+    """
+    Test whether all array elements along a given axis evaluate to True.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which a logical AND reduction is performed.
+        The default (``axis=None``) is to perform a logical AND over all
+        the dimensions of the input array. `axis` may be negative, in
+        which case it counts from the last to the first axis.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, a reduction is performed on multiple
+        axes, instead of a single axis or all the axes as before.
+    out : ndarray, optional
+        Alternate output array in which to place the result.
+        It must have the same shape as the expected output and its
+        type is preserved (e.g., if ``dtype(out)`` is float, the result
+        will consist of 0.0's and 1.0's). See `ufuncs-output-type` for more
+        details.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `all` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    all : ndarray, bool
+        A new boolean or array is returned unless `out` is specified,
+        in which case a reference to `out` is returned.
+
+    See Also
+    --------
+    ndarray.all : equivalent method
+
+    any : Test whether any element along a given axis evaluates to True.
+
+    Notes
+    -----
+    Not a Number (NaN), positive infinity and negative infinity
+    evaluate to `True` because these are not equal to zero.
+
+    Examples
+    --------
+    >>> np.all([[True,False],[True,True]])
+    False
+
+    >>> np.all([[True,False],[True,True]], axis=0)
+    array([ True, False])
+
+    >>> np.all([-1, 4, 5])
+    True
+
+    >>> np.all([1.0, np.nan])
+    True
+
+    >>> o=np.array(False)
+    >>> z=np.all([-1, 4, 5], out=o)
+    >>> id(z), id(o), z
+    (28293632, 28293632, array(True)) # may vary
+
+    """
+    return _wrapreduction(a, np.logical_and, 'all', axis, None, out, keepdims=keepdims)
+
+
+def _cumsum_dispatcher(a, axis=None, dtype=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_cumsum_dispatcher)
+def cumsum(a, axis=None, dtype=None, out=None):
+    """
+    Return the cumulative sum of the elements along a given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        Axis along which the cumulative sum is computed. The default
+        (None) is to compute the cumsum over the flattened array.
+    dtype : dtype, optional
+        Type of the returned array and of the accumulator in which the
+        elements are summed.  If `dtype` is not specified, it defaults
+        to the dtype of `a`, unless `a` has an integer dtype with a
+        precision less than that of the default platform integer.  In
+        that case, the default platform integer is used.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output
+        but the type will be cast if necessary. See `ufuncs-output-type` for
+        more details.
+
+    Returns
+    -------
+    cumsum_along_axis : ndarray.
+        A new array holding the result is returned unless `out` is
+        specified, in which case a reference to `out` is returned. The
+        result has the same size as `a`, and the same shape as `a` if
+        `axis` is not None or `a` is a 1-d array.
+
+
+    See Also
+    --------
+    sum : Sum array elements.
+
+    trapz : Integration of array values using the composite trapezoidal rule.
+
+    diff :  Calculate the n-th discrete difference along given axis.
+
+    Notes
+    -----
+    Arithmetic is modular when using integer types, and no error is
+    raised on overflow.
+
+    Examples
+    --------
+    >>> a = np.array([[1,2,3], [4,5,6]])
+    >>> a
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> np.cumsum(a)
+    array([ 1,  3,  6, 10, 15, 21])
+    >>> np.cumsum(a, dtype=float)     # specifies type of output value(s)
+    array([  1.,   3.,   6.,  10.,  15.,  21.])
+
+    >>> np.cumsum(a,axis=0)      # sum over rows for each of the 3 columns
+    array([[1, 2, 3],
+           [5, 7, 9]])
+    >>> np.cumsum(a,axis=1)      # sum over columns for each of the 2 rows
+    array([[ 1,  3,  6],
+           [ 4,  9, 15]])
+
+    """
+    return _wrapfunc(a, 'cumsum', axis=axis, dtype=dtype, out=out)
+
+
+def _ptp_dispatcher(a, axis=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_ptp_dispatcher)
+def ptp(a, axis=None, out=None, keepdims=np._NoValue):
+    """
+    Range of values (maximum - minimum) along an axis.
+
+    The name of the function comes from the acronym for 'peak to peak'.
+
+    .. warning::
+        `ptp` preserves the data type of the array. This means the
+        return value for an input of signed integers with n bits
+        (e.g. `np.int8`, `np.int16`, etc) is also a signed integer
+        with n bits.  In that case, peak-to-peak values greater than
+        ``2**(n-1)-1`` will be returned as negative values. An example
+        with a work-around is shown below.
+
+    Parameters
+    ----------
+    a : array_like
+        Input values.
+    axis : None or int or tuple of ints, optional
+        Axis along which to find the peaks.  By default, flatten the
+        array.  `axis` may be negative, in
+        which case it counts from the last to the first axis.
+
+        .. versionadded:: 1.15.0
+
+        If this is a tuple of ints, a reduction is performed on multiple
+        axes, instead of a single axis or all the axes as before.
+    out : array_like
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type of the output values will be cast if necessary.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `ptp` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    ptp : ndarray
+        A new array holding the result, unless `out` was
+        specified, in which case a reference to `out` is returned.
+
+    Examples
+    --------
+    >>> x = np.array([[4, 9, 2, 10],
+    ...               [6, 9, 7, 12]])
+
+    >>> np.ptp(x, axis=1)
+    array([8, 6])
+
+    >>> np.ptp(x, axis=0)
+    array([2, 0, 5, 2])
+
+    >>> np.ptp(x)
+    10
+
+    This example shows that a negative value can be returned when
+    the input is an array of signed integers.
+
+    >>> y = np.array([[1, 127],
+    ...               [0, 127],
+    ...               [-1, 127],
+    ...               [-2, 127]], dtype=np.int8)
+    >>> np.ptp(y, axis=1)
+    array([ 126,  127, -128, -127], dtype=int8)
+
+    A work-around is to use the `view()` method to view the result as
+    unsigned integers with the same bit width:
+
+    >>> np.ptp(y, axis=1).view(np.uint8)
+    array([126, 127, 128, 129], dtype=uint8)
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+    if type(a) is not mu.ndarray:
+        try:
+            ptp = a.ptp
+        except AttributeError:
+            pass
+        else:
+            return ptp(axis=axis, out=out, **kwargs)
+    return _methods._ptp(a, axis=axis, out=out, **kwargs)
+
+
+def _amax_dispatcher(a, axis=None, out=None, keepdims=None, initial=None,
+                     where=None):
+    return (a, out)
+
+
+@array_function_dispatch(_amax_dispatcher)
+def amax(a, axis=None, out=None, keepdims=np._NoValue, initial=np._NoValue,
+         where=np._NoValue):
+    """
+    Return the maximum of an array or maximum along an axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which to operate.  By default, flattened input is
+        used.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, the maximum is selected over multiple axes,
+        instead of a single axis or all the axes as before.
+    out : ndarray, optional
+        Alternative output array in which to place the result.  Must
+        be of the same shape and buffer length as the expected output.
+        See `ufuncs-output-type` for more details.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `amax` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    initial : scalar, optional
+        The minimum value of an output element. Must be present to allow
+        computation on empty slice. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.15.0
+
+    where : array_like of bool, optional
+        Elements to compare for the maximum. See `~numpy.ufunc.reduce`
+        for details.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    amax : ndarray or scalar
+        Maximum of `a`. If `axis` is None, the result is a scalar value.
+        If `axis` is given, the result is an array of dimension
+        ``a.ndim - 1``.
+
+    See Also
+    --------
+    amin :
+        The minimum value of an array along a given axis, propagating any NaNs.
+    nanmax :
+        The maximum value of an array along a given axis, ignoring any NaNs.
+    maximum :
+        Element-wise maximum of two arrays, propagating any NaNs.
+    fmax :
+        Element-wise maximum of two arrays, ignoring any NaNs.
+    argmax :
+        Return the indices of the maximum values.
+
+    nanmin, minimum, fmin
+
+    Notes
+    -----
+    NaN values are propagated, that is if at least one item is NaN, the
+    corresponding max value will be NaN as well. To ignore NaN values
+    (MATLAB behavior), please use nanmax.
+
+    Don't use `amax` for element-wise comparison of 2 arrays; when
+    ``a.shape[0]`` is 2, ``maximum(a[0], a[1])`` is faster than
+    ``amax(a, axis=0)``.
+
+    Examples
+    --------
+    >>> a = np.arange(4).reshape((2,2))
+    >>> a
+    array([[0, 1],
+           [2, 3]])
+    >>> np.amax(a)           # Maximum of the flattened array
+    3
+    >>> np.amax(a, axis=0)   # Maxima along the first axis
+    array([2, 3])
+    >>> np.amax(a, axis=1)   # Maxima along the second axis
+    array([1, 3])
+    >>> np.amax(a, where=[False, True], initial=-1, axis=0)
+    array([-1,  3])
+    >>> b = np.arange(5, dtype=float)
+    >>> b[2] = np.NaN
+    >>> np.amax(b)
+    nan
+    >>> np.amax(b, where=~np.isnan(b), initial=-1)
+    4.0
+    >>> np.nanmax(b)
+    4.0
+
+    You can use an initial value to compute the maximum of an empty slice, or
+    to initialize it to a different value:
+
+    >>> np.max([[-50], [10]], axis=-1, initial=0)
+    array([ 0, 10])
+
+    Notice that the initial value is used as one of the elements for which the
+    maximum is determined, unlike for the default argument Python's max
+    function, which is only used for empty iterables.
+
+    >>> np.max([5], initial=6)
+    6
+    >>> max([5], default=6)
+    5
+    """
+    return _wrapreduction(a, np.maximum, 'max', axis, None, out,
+                          keepdims=keepdims, initial=initial, where=where)
+
+
+def _amin_dispatcher(a, axis=None, out=None, keepdims=None, initial=None,
+                     where=None):
+    return (a, out)
+
+
+@array_function_dispatch(_amin_dispatcher)
+def amin(a, axis=None, out=None, keepdims=np._NoValue, initial=np._NoValue,
+         where=np._NoValue):
+    """
+    Return the minimum of an array or minimum along an axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which to operate.  By default, flattened input is
+        used.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, the minimum is selected over multiple axes,
+        instead of a single axis or all the axes as before.
+    out : ndarray, optional
+        Alternative output array in which to place the result.  Must
+        be of the same shape and buffer length as the expected output.
+        See `ufuncs-output-type` for more details.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `amin` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    initial : scalar, optional
+        The maximum value of an output element. Must be present to allow
+        computation on empty slice. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.15.0
+
+    where : array_like of bool, optional
+        Elements to compare for the minimum. See `~numpy.ufunc.reduce`
+        for details.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    amin : ndarray or scalar
+        Minimum of `a`. If `axis` is None, the result is a scalar value.
+        If `axis` is given, the result is an array of dimension
+        ``a.ndim - 1``.
+
+    See Also
+    --------
+    amax :
+        The maximum value of an array along a given axis, propagating any NaNs.
+    nanmin :
+        The minimum value of an array along a given axis, ignoring any NaNs.
+    minimum :
+        Element-wise minimum of two arrays, propagating any NaNs.
+    fmin :
+        Element-wise minimum of two arrays, ignoring any NaNs.
+    argmin :
+        Return the indices of the minimum values.
+
+    nanmax, maximum, fmax
+
+    Notes
+    -----
+    NaN values are propagated, that is if at least one item is NaN, the
+    corresponding min value will be NaN as well. To ignore NaN values
+    (MATLAB behavior), please use nanmin.
+
+    Don't use `amin` for element-wise comparison of 2 arrays; when
+    ``a.shape[0]`` is 2, ``minimum(a[0], a[1])`` is faster than
+    ``amin(a, axis=0)``.
+
+    Examples
+    --------
+    >>> a = np.arange(4).reshape((2,2))
+    >>> a
+    array([[0, 1],
+           [2, 3]])
+    >>> np.amin(a)           # Minimum of the flattened array
+    0
+    >>> np.amin(a, axis=0)   # Minima along the first axis
+    array([0, 1])
+    >>> np.amin(a, axis=1)   # Minima along the second axis
+    array([0, 2])
+    >>> np.amin(a, where=[False, True], initial=10, axis=0)
+    array([10,  1])
+
+    >>> b = np.arange(5, dtype=float)
+    >>> b[2] = np.NaN
+    >>> np.amin(b)
+    nan
+    >>> np.amin(b, where=~np.isnan(b), initial=10)
+    0.0
+    >>> np.nanmin(b)
+    0.0
+
+    >>> np.min([[-50], [10]], axis=-1, initial=0)
+    array([-50,   0])
+
+    Notice that the initial value is used as one of the elements for which the
+    minimum is determined, unlike for the default argument Python's max
+    function, which is only used for empty iterables.
+
+    Notice that this isn't the same as Python's ``default`` argument.
+
+    >>> np.min([6], initial=5)
+    5
+    >>> min([6], default=5)
+    6
+    """
+    return _wrapreduction(a, np.minimum, 'min', axis, None, out,
+                          keepdims=keepdims, initial=initial, where=where)
+
+
+def _alen_dispathcer(a):
+    return (a,)
+
+
+@array_function_dispatch(_alen_dispathcer)
+def alen(a):
+    """
+    Return the length of the first dimension of the input array.
+
+    Parameters
+    ----------
+    a : array_like
+       Input array.
+
+    Returns
+    -------
+    alen : int
+       Length of the first dimension of `a`.
+
+    See Also
+    --------
+    shape, size
+
+    Examples
+    --------
+    >>> a = np.zeros((7,4,5))
+    >>> a.shape[0]
+    7
+    >>> np.alen(a)
+    7
+
+    """
+    # NumPy 1.18.0, 2019-08-02
+    warnings.warn(
+        "`np.alen` is deprecated, use `len` instead",
+        DeprecationWarning, stacklevel=2)
+    try:
+        return len(a)
+    except TypeError:
+        return len(array(a, ndmin=1))
+
+
+def _prod_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None,
+                     initial=None, where=None):
+    return (a, out)
+
+
+@array_function_dispatch(_prod_dispatcher)
+def prod(a, axis=None, dtype=None, out=None, keepdims=np._NoValue,
+         initial=np._NoValue, where=np._NoValue):
+    """
+    Return the product of array elements over a given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which a product is performed.  The default,
+        axis=None, will calculate the product of all the elements in the
+        input array. If axis is negative it counts from the last to the
+        first axis.
+
+        .. versionadded:: 1.7.0
+
+        If axis is a tuple of ints, a product is performed on all of the
+        axes specified in the tuple instead of a single axis or all the
+        axes as before.
+    dtype : dtype, optional
+        The type of the returned array, as well as of the accumulator in
+        which the elements are multiplied.  The dtype of `a` is used by
+        default unless `a` has an integer dtype of less precision than the
+        default platform integer.  In that case, if `a` is signed then the
+        platform integer is used while if `a` is unsigned then an unsigned
+        integer of the same precision as the platform integer is used.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must have
+        the same shape as the expected output, but the type of the output
+        values will be cast if necessary.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left in the
+        result as dimensions with size one. With this option, the result
+        will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `prod` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+    initial : scalar, optional
+        The starting value for this product. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.15.0
+
+    where : array_like of bool, optional
+        Elements to include in the product. See `~numpy.ufunc.reduce` for details.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    product_along_axis : ndarray, see `dtype` parameter above.
+        An array shaped as `a` but with the specified axis removed.
+        Returns a reference to `out` if specified.
+
+    See Also
+    --------
+    ndarray.prod : equivalent method
+    ufuncs-output-type
+
+    Notes
+    -----
+    Arithmetic is modular when using integer types, and no error is
+    raised on overflow.  That means that, on a 32-bit platform:
+
+    >>> x = np.array([536870910, 536870910, 536870910, 536870910])
+    >>> np.prod(x)
+    16 # may vary
+
+    The product of an empty array is the neutral element 1:
+
+    >>> np.prod([])
+    1.0
+
+    Examples
+    --------
+    By default, calculate the product of all elements:
+
+    >>> np.prod([1.,2.])
+    2.0
+
+    Even when the input array is two-dimensional:
+
+    >>> np.prod([[1.,2.],[3.,4.]])
+    24.0
+
+    But we can also specify the axis over which to multiply:
+
+    >>> np.prod([[1.,2.],[3.,4.]], axis=1)
+    array([  2.,  12.])
+
+    Or select specific elements to include:
+
+    >>> np.prod([1., np.nan, 3.], where=[True, False, True])
+    3.0
+
+    If the type of `x` is unsigned, then the output type is
+    the unsigned platform integer:
+
+    >>> x = np.array([1, 2, 3], dtype=np.uint8)
+    >>> np.prod(x).dtype == np.uint
+    True
+
+    If `x` is of a signed integer type, then the output type
+    is the default platform integer:
+
+    >>> x = np.array([1, 2, 3], dtype=np.int8)
+    >>> np.prod(x).dtype == int
+    True
+
+    You can also start the product with a value other than one:
+
+    >>> np.prod([1, 2], initial=5)
+    10
+    """
+    return _wrapreduction(a, np.multiply, 'prod', axis, dtype, out,
+                          keepdims=keepdims, initial=initial, where=where)
+
+
+def _cumprod_dispatcher(a, axis=None, dtype=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_cumprod_dispatcher)
+def cumprod(a, axis=None, dtype=None, out=None):
+    """
+    Return the cumulative product of elements along a given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        Axis along which the cumulative product is computed.  By default
+        the input is flattened.
+    dtype : dtype, optional
+        Type of the returned array, as well as of the accumulator in which
+        the elements are multiplied.  If *dtype* is not specified, it
+        defaults to the dtype of `a`, unless `a` has an integer dtype with
+        a precision less than that of the default platform integer.  In
+        that case, the default platform integer is used instead.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output
+        but the type of the resulting values will be cast if necessary.
+
+    Returns
+    -------
+    cumprod : ndarray
+        A new array holding the result is returned unless `out` is
+        specified, in which case a reference to out is returned.
+
+    See Also
+    --------
+    ufuncs-output-type
+
+    Notes
+    -----
+    Arithmetic is modular when using integer types, and no error is
+    raised on overflow.
+
+    Examples
+    --------
+    >>> a = np.array([1,2,3])
+    >>> np.cumprod(a) # intermediate results 1, 1*2
+    ...               # total product 1*2*3 = 6
+    array([1, 2, 6])
+    >>> a = np.array([[1, 2, 3], [4, 5, 6]])
+    >>> np.cumprod(a, dtype=float) # specify type of output
+    array([   1.,    2.,    6.,   24.,  120.,  720.])
+
+    The cumulative product for each column (i.e., over the rows) of `a`:
+
+    >>> np.cumprod(a, axis=0)
+    array([[ 1,  2,  3],
+           [ 4, 10, 18]])
+
+    The cumulative product for each row (i.e. over the columns) of `a`:
+
+    >>> np.cumprod(a,axis=1)
+    array([[  1,   2,   6],
+           [  4,  20, 120]])
+
+    """
+    return _wrapfunc(a, 'cumprod', axis=axis, dtype=dtype, out=out)
+
+
+def _ndim_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_ndim_dispatcher)
+def ndim(a):
+    """
+    Return the number of dimensions of an array.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.  If it is not already an ndarray, a conversion is
+        attempted.
+
+    Returns
+    -------
+    number_of_dimensions : int
+        The number of dimensions in `a`.  Scalars are zero-dimensional.
+
+    See Also
+    --------
+    ndarray.ndim : equivalent method
+    shape : dimensions of array
+    ndarray.shape : dimensions of array
+
+    Examples
+    --------
+    >>> np.ndim([[1,2,3],[4,5,6]])
+    2
+    >>> np.ndim(np.array([[1,2,3],[4,5,6]]))
+    2
+    >>> np.ndim(1)
+    0
+
+    """
+    try:
+        return a.ndim
+    except AttributeError:
+        return asarray(a).ndim
+
+
+def _size_dispatcher(a, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_size_dispatcher)
+def size(a, axis=None):
+    """
+    Return the number of elements along a given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : int, optional
+        Axis along which the elements are counted.  By default, give
+        the total number of elements.
+
+    Returns
+    -------
+    element_count : int
+        Number of elements along the specified axis.
+
+    See Also
+    --------
+    shape : dimensions of array
+    ndarray.shape : dimensions of array
+    ndarray.size : number of elements in array
+
+    Examples
+    --------
+    >>> a = np.array([[1,2,3],[4,5,6]])
+    >>> np.size(a)
+    6
+    >>> np.size(a,1)
+    3
+    >>> np.size(a,0)
+    2
+
+    """
+    if axis is None:
+        try:
+            return a.size
+        except AttributeError:
+            return asarray(a).size
+    else:
+        try:
+            return a.shape[axis]
+        except AttributeError:
+            return asarray(a).shape[axis]
+
+
+def _around_dispatcher(a, decimals=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_around_dispatcher)
+def around(a, decimals=0, out=None):
+    """
+    Evenly round to the given number of decimals.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    decimals : int, optional
+        Number of decimal places to round to (default: 0).  If
+        decimals is negative, it specifies the number of positions to
+        the left of the decimal point.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must have
+        the same shape as the expected output, but the type of the output
+        values will be cast if necessary. See `ufuncs-output-type` for more
+        details.
+
+    Returns
+    -------
+    rounded_array : ndarray
+        An array of the same type as `a`, containing the rounded values.
+        Unless `out` was specified, a new array is created.  A reference to
+        the result is returned.
+
+        The real and imaginary parts of complex numbers are rounded
+        separately.  The result of rounding a float is a float.
+
+    See Also
+    --------
+    ndarray.round : equivalent method
+
+    ceil, fix, floor, rint, trunc
+
+
+    Notes
+    -----
+    For values exactly halfway between rounded decimal values, NumPy
+    rounds to the nearest even value. Thus 1.5 and 2.5 round to 2.0,
+    -0.5 and 0.5 round to 0.0, etc.
+
+    ``np.around`` uses a fast but sometimes inexact algorithm to round
+    floating-point datatypes. For positive `decimals` it is equivalent to
+    ``np.true_divide(np.rint(a * 10**decimals), 10**decimals)``, which has
+    error due to the inexact representation of decimal fractions in the IEEE
+    floating point standard [1]_ and errors introduced when scaling by powers
+    of ten. For instance, note the extra "1" in the following:
+
+        >>> np.round(56294995342131.5, 3)
+        56294995342131.51
+
+    If your goal is to print such values with a fixed number of decimals, it is
+    preferable to use numpy's float printing routines to limit the number of
+    printed decimals:
+
+        >>> np.format_float_positional(56294995342131.5, precision=3)
+        '56294995342131.5'
+
+    The float printing routines use an accurate but much more computationally
+    demanding algorithm to compute the number of digits after the decimal
+    point.
+
+    Alternatively, Python's builtin `round` function uses a more accurate
+    but slower algorithm for 64-bit floating point values:
+
+        >>> round(56294995342131.5, 3)
+        56294995342131.5
+        >>> np.round(16.055, 2), round(16.055, 2)  # equals 16.0549999999999997
+        (16.06, 16.05)
+
+
+    References
+    ----------
+    .. [1] "Lecture Notes on the Status of IEEE 754", William Kahan,
+           https://people.eecs.berkeley.edu/~wkahan/ieee754status/IEEE754.PDF
+    .. [2] "How Futile are Mindless Assessments of
+           Roundoff in Floating-Point Computation?", William Kahan,
+           https://people.eecs.berkeley.edu/~wkahan/Mindless.pdf
+
+    Examples
+    --------
+    >>> np.around([0.37, 1.64])
+    array([0.,  2.])
+    >>> np.around([0.37, 1.64], decimals=1)
+    array([0.4,  1.6])
+    >>> np.around([.5, 1.5, 2.5, 3.5, 4.5]) # rounds to nearest even value
+    array([0.,  2.,  2.,  4.,  4.])
+    >>> np.around([1,2,3,11], decimals=1) # ndarray of ints is returned
+    array([ 1,  2,  3, 11])
+    >>> np.around([1,2,3,11], decimals=-1)
+    array([ 0,  0,  0, 10])
+
+    """
+    return _wrapfunc(a, 'round', decimals=decimals, out=out)
+
+
+def _mean_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_mean_dispatcher)
+def mean(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+    """
+    Compute the arithmetic mean along the specified axis.
+
+    Returns the average of the array elements.  The average is taken over
+    the flattened array by default, otherwise over the specified axis.
+    `float64` intermediate and return values are used for integer inputs.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose mean is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which the means are computed. The default is to
+        compute the mean of the flattened array.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, a mean is performed over multiple axes,
+        instead of a single axis or all the axes as before.
+    dtype : data-type, optional
+        Type to use in computing the mean.  For integer inputs, the default
+        is `float64`; for floating point inputs, it is the same as the
+        input dtype.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary.
+        See `ufuncs-output-type` for more details.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `mean` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    m : ndarray, see dtype parameter above
+        If `out=None`, returns a new array containing the mean values,
+        otherwise a reference to the output array is returned.
+
+    See Also
+    --------
+    average : Weighted average
+    std, var, nanmean, nanstd, nanvar
+
+    Notes
+    -----
+    The arithmetic mean is the sum of the elements along the axis divided
+    by the number of elements.
+
+    Note that for floating-point input, the mean is computed using the
+    same precision the input has.  Depending on the input data, this can
+    cause the results to be inaccurate, especially for `float32` (see
+    example below).  Specifying a higher-precision accumulator using the
+    `dtype` keyword can alleviate this issue.
+
+    By default, `float16` results are computed using `float32` intermediates
+    for extra precision.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> np.mean(a)
+    2.5
+    >>> np.mean(a, axis=0)
+    array([2., 3.])
+    >>> np.mean(a, axis=1)
+    array([1.5, 3.5])
+
+    In single precision, `mean` can be inaccurate:
+
+    >>> a = np.zeros((2, 512*512), dtype=np.float32)
+    >>> a[0, :] = 1.0
+    >>> a[1, :] = 0.1
+    >>> np.mean(a)
+    0.54999924
+
+    Computing the mean in float64 is more accurate:
+
+    >>> np.mean(a, dtype=np.float64)
+    0.55000000074505806 # may vary
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+    if type(a) is not mu.ndarray:
+        try:
+            mean = a.mean
+        except AttributeError:
+            pass
+        else:
+            return mean(axis=axis, dtype=dtype, out=out, **kwargs)
+
+    return _methods._mean(a, axis=axis, dtype=dtype,
+                          out=out, **kwargs)
+
+
+def _std_dispatcher(
+        a, axis=None, dtype=None, out=None, ddof=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_std_dispatcher)
+def std(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
+    """
+    Compute the standard deviation along the specified axis.
+
+    Returns the standard deviation, a measure of the spread of a distribution,
+    of the array elements. The standard deviation is computed for the
+    flattened array by default, otherwise over the specified axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Calculate the standard deviation of these values.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which the standard deviation is computed. The
+        default is to compute the standard deviation of the flattened array.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, a standard deviation is performed over
+        multiple axes, instead of a single axis or all the axes as before.
+    dtype : dtype, optional
+        Type to use in computing the standard deviation. For arrays of
+        integer type the default is float64, for arrays of float types it is
+        the same as the array type.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must have
+        the same shape as the expected output but the type (of the calculated
+        values) will be cast if necessary.
+    ddof : int, optional
+        Means Delta Degrees of Freedom.  The divisor used in calculations
+        is ``N - ddof``, where ``N`` represents the number of elements.
+        By default `ddof` is zero.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `std` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    standard_deviation : ndarray, see dtype parameter above.
+        If `out` is None, return a new array containing the standard deviation,
+        otherwise return a reference to the output array.
+
+    See Also
+    --------
+    var, mean, nanmean, nanstd, nanvar
+    ufuncs-output-type
+
+    Notes
+    -----
+    The standard deviation is the square root of the average of the squared
+    deviations from the mean, i.e., ``std = sqrt(mean(abs(x - x.mean())**2))``.
+
+    The average squared deviation is normally calculated as
+    ``x.sum() / N``, where ``N = len(x)``.  If, however, `ddof` is specified,
+    the divisor ``N - ddof`` is used instead. In standard statistical
+    practice, ``ddof=1`` provides an unbiased estimator of the variance
+    of the infinite population. ``ddof=0`` provides a maximum likelihood
+    estimate of the variance for normally distributed variables. The
+    standard deviation computed in this function is the square root of
+    the estimated variance, so even with ``ddof=1``, it will not be an
+    unbiased estimate of the standard deviation per se.
+
+    Note that, for complex numbers, `std` takes the absolute
+    value before squaring, so that the result is always real and nonnegative.
+
+    For floating-point input, the *std* is computed using the same
+    precision the input has. Depending on the input data, this can cause
+    the results to be inaccurate, especially for float32 (see example below).
+    Specifying a higher-accuracy accumulator using the `dtype` keyword can
+    alleviate this issue.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> np.std(a)
+    1.1180339887498949 # may vary
+    >>> np.std(a, axis=0)
+    array([1.,  1.])
+    >>> np.std(a, axis=1)
+    array([0.5,  0.5])
+
+    In single precision, std() can be inaccurate:
+
+    >>> a = np.zeros((2, 512*512), dtype=np.float32)
+    >>> a[0, :] = 1.0
+    >>> a[1, :] = 0.1
+    >>> np.std(a)
+    0.45000005
+
+    Computing the standard deviation in float64 is more accurate:
+
+    >>> np.std(a, dtype=np.float64)
+    0.44999999925494177 # may vary
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+
+    if type(a) is not mu.ndarray:
+        try:
+            std = a.std
+        except AttributeError:
+            pass
+        else:
+            return std(axis=axis, dtype=dtype, out=out, ddof=ddof, **kwargs)
+
+    return _methods._std(a, axis=axis, dtype=dtype, out=out, ddof=ddof,
+                         **kwargs)
+
+
+def _var_dispatcher(
+        a, axis=None, dtype=None, out=None, ddof=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_var_dispatcher)
+def var(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
+    """
+    Compute the variance along the specified axis.
+
+    Returns the variance of the array elements, a measure of the spread of a
+    distribution.  The variance is computed for the flattened array by
+    default, otherwise over the specified axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose variance is desired.  If `a` is not an
+        array, a conversion is attempted.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which the variance is computed.  The default is to
+        compute the variance of the flattened array.
+
+        .. versionadded:: 1.7.0
+
+        If this is a tuple of ints, a variance is performed over multiple axes,
+        instead of a single axis or all the axes as before.
+    dtype : data-type, optional
+        Type to use in computing the variance.  For arrays of integer type
+        the default is `float64`; for arrays of float types it is the same as
+        the array type.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  It must have
+        the same shape as the expected output, but the type is cast if
+        necessary.
+    ddof : int, optional
+        "Delta Degrees of Freedom": the divisor used in the calculation is
+        ``N - ddof``, where ``N`` represents the number of elements. By
+        default `ddof` is zero.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        If the default value is passed, then `keepdims` will not be
+        passed through to the `var` method of sub-classes of
+        `ndarray`, however any non-default value will be.  If the
+        sub-class' method does not implement `keepdims` any
+        exceptions will be raised.
+
+    Returns
+    -------
+    variance : ndarray, see dtype parameter above
+        If ``out=None``, returns a new array containing the variance;
+        otherwise, a reference to the output array is returned.
+
+    See Also
+    --------
+    std, mean, nanmean, nanstd, nanvar
+    ufuncs-output-type
+
+    Notes
+    -----
+    The variance is the average of the squared deviations from the mean,
+    i.e.,  ``var = mean(abs(x - x.mean())**2)``.
+
+    The mean is normally calculated as ``x.sum() / N``, where ``N = len(x)``.
+    If, however, `ddof` is specified, the divisor ``N - ddof`` is used
+    instead.  In standard statistical practice, ``ddof=1`` provides an
+    unbiased estimator of the variance of a hypothetical infinite population.
+    ``ddof=0`` provides a maximum likelihood estimate of the variance for
+    normally distributed variables.
+
+    Note that for complex numbers, the absolute value is taken before
+    squaring, so that the result is always real and nonnegative.
+
+    For floating-point input, the variance is computed using the same
+    precision the input has.  Depending on the input data, this can cause
+    the results to be inaccurate, especially for `float32` (see example
+    below).  Specifying a higher-accuracy accumulator using the ``dtype``
+    keyword can alleviate this issue.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> np.var(a)
+    1.25
+    >>> np.var(a, axis=0)
+    array([1.,  1.])
+    >>> np.var(a, axis=1)
+    array([0.25,  0.25])
+
+    In single precision, var() can be inaccurate:
+
+    >>> a = np.zeros((2, 512*512), dtype=np.float32)
+    >>> a[0, :] = 1.0
+    >>> a[1, :] = 0.1
+    >>> np.var(a)
+    0.20250003
+
+    Computing the variance in float64 is more accurate:
+
+    >>> np.var(a, dtype=np.float64)
+    0.20249999932944759 # may vary
+    >>> ((1-0.55)**2 + (0.1-0.55)**2)/2
+    0.2025
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+
+    if type(a) is not mu.ndarray:
+        try:
+            var = a.var
+
+        except AttributeError:
+            pass
+        else:
+            return var(axis=axis, dtype=dtype, out=out, ddof=ddof, **kwargs)
+
+    return _methods._var(a, axis=axis, dtype=dtype, out=out, ddof=ddof,
+                         **kwargs)
+
+
+# Aliases of other functions. These have their own definitions only so that
+# they can have unique docstrings.
+
+@array_function_dispatch(_around_dispatcher)
+def round_(a, decimals=0, out=None):
+    """
+    Round an array to the given number of decimals.
+
+    See Also
+    --------
+    around : equivalent function; see for details.
+    """
+    return around(a, decimals=decimals, out=out)
+
+
+@array_function_dispatch(_prod_dispatcher, verify=False)
+def product(*args, **kwargs):
+    """
+    Return the product of array elements over a given axis.
+
+    See Also
+    --------
+    prod : equivalent function; see for details.
+    """
+    return prod(*args, **kwargs)
+
+
+@array_function_dispatch(_cumprod_dispatcher, verify=False)
+def cumproduct(*args, **kwargs):
+    """
+    Return the cumulative product over the given axis.
+
+    See Also
+    --------
+    cumprod : equivalent function; see for details.
+    """
+    return cumprod(*args, **kwargs)
+
+
+@array_function_dispatch(_any_dispatcher, verify=False)
+def sometrue(*args, **kwargs):
+    """
+    Check whether some values are true.
+
+    Refer to `any` for full documentation.
+
+    See Also
+    --------
+    any : equivalent function; see for details.
+    """
+    return any(*args, **kwargs)
+
+
+@array_function_dispatch(_all_dispatcher, verify=False)
+def alltrue(*args, **kwargs):
+    """
+    Check if all elements of input array are true.
+
+    See Also
+    --------
+    numpy.all : Equivalent function; see for details.
+    """
+    return all(*args, **kwargs)
diff --git a/venv/Lib/site-packages/numpy/core/function_base.py b/venv/Lib/site-packages/numpy/core/function_base.py
new file mode 100644
index 000000000..9e46f0ea5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/function_base.py
@@ -0,0 +1,505 @@
+import functools
+import warnings
+import operator
+import types
+
+from . import numeric as _nx
+from .numeric import result_type, NaN, asanyarray, ndim
+from numpy.core.multiarray import add_docstring
+from numpy.core import overrides
+
+__all__ = ['logspace', 'linspace', 'geomspace']
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+def _linspace_dispatcher(start, stop, num=None, endpoint=None, retstep=None,
+                         dtype=None, axis=None):
+    return (start, stop)
+
+
+@array_function_dispatch(_linspace_dispatcher)
+def linspace(start, stop, num=50, endpoint=True, retstep=False, dtype=None,
+             axis=0):
+    """
+    Return evenly spaced numbers over a specified interval.
+
+    Returns `num` evenly spaced samples, calculated over the
+    interval [`start`, `stop`].
+
+    The endpoint of the interval can optionally be excluded.
+
+    .. versionchanged:: 1.16.0
+        Non-scalar `start` and `stop` are now supported.
+
+    Parameters
+    ----------
+    start : array_like
+        The starting value of the sequence.
+    stop : array_like
+        The end value of the sequence, unless `endpoint` is set to False.
+        In that case, the sequence consists of all but the last of ``num + 1``
+        evenly spaced samples, so that `stop` is excluded.  Note that the step
+        size changes when `endpoint` is False.
+    num : int, optional
+        Number of samples to generate. Default is 50. Must be non-negative.
+    endpoint : bool, optional
+        If True, `stop` is the last sample. Otherwise, it is not included.
+        Default is True.
+    retstep : bool, optional
+        If True, return (`samples`, `step`), where `step` is the spacing
+        between samples.
+    dtype : dtype, optional
+        The type of the output array.  If `dtype` is not given, infer the data
+        type from the other input arguments.
+
+        .. versionadded:: 1.9.0
+
+    axis : int, optional
+        The axis in the result to store the samples.  Relevant only if start
+        or stop are array-like.  By default (0), the samples will be along a
+        new axis inserted at the beginning. Use -1 to get an axis at the end.
+
+        .. versionadded:: 1.16.0
+
+    Returns
+    -------
+    samples : ndarray
+        There are `num` equally spaced samples in the closed interval
+        ``[start, stop]`` or the half-open interval ``[start, stop)``
+        (depending on whether `endpoint` is True or False).
+    step : float, optional
+        Only returned if `retstep` is True
+
+        Size of spacing between samples.
+
+
+    See Also
+    --------
+    arange : Similar to `linspace`, but uses a step size (instead of the
+             number of samples).
+    geomspace : Similar to `linspace`, but with numbers spaced evenly on a log
+                scale (a geometric progression).
+    logspace : Similar to `geomspace`, but with the end points specified as
+               logarithms.
+
+    Examples
+    --------
+    >>> np.linspace(2.0, 3.0, num=5)
+    array([2.  , 2.25, 2.5 , 2.75, 3.  ])
+    >>> np.linspace(2.0, 3.0, num=5, endpoint=False)
+    array([2. ,  2.2,  2.4,  2.6,  2.8])
+    >>> np.linspace(2.0, 3.0, num=5, retstep=True)
+    (array([2.  ,  2.25,  2.5 ,  2.75,  3.  ]), 0.25)
+
+    Graphical illustration:
+
+    >>> import matplotlib.pyplot as plt
+    >>> N = 8
+    >>> y = np.zeros(N)
+    >>> x1 = np.linspace(0, 10, N, endpoint=True)
+    >>> x2 = np.linspace(0, 10, N, endpoint=False)
+    >>> plt.plot(x1, y, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.plot(x2, y + 0.5, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.ylim([-0.5, 1])
+    (-0.5, 1)
+    >>> plt.show()
+
+    """
+    num = operator.index(num)
+    if num < 0:
+        raise ValueError("Number of samples, %s, must be non-negative." % num)
+    div = (num - 1) if endpoint else num
+
+    # Convert float/complex array scalars to float, gh-3504
+    # and make sure one can use variables that have an __array_interface__, gh-6634
+    start = asanyarray(start) * 1.0
+    stop  = asanyarray(stop)  * 1.0
+
+    dt = result_type(start, stop, float(num))
+    if dtype is None:
+        dtype = dt
+
+    delta = stop - start
+    y = _nx.arange(0, num, dtype=dt).reshape((-1,) + (1,) * ndim(delta))
+    # In-place multiplication y *= delta/div is faster, but prevents the multiplicant
+    # from overriding what class is produced, and thus prevents, e.g. use of Quantities,
+    # see gh-7142. Hence, we multiply in place only for standard scalar types.
+    _mult_inplace = _nx.isscalar(delta)
+    if div > 0:
+        step = delta / div
+        if _nx.any(step == 0):
+            # Special handling for denormal numbers, gh-5437
+            y /= div
+            if _mult_inplace:
+                y *= delta
+            else:
+                y = y * delta
+        else:
+            if _mult_inplace:
+                y *= step
+            else:
+                y = y * step
+    else:
+        # sequences with 0 items or 1 item with endpoint=True (i.e. div <= 0)
+        # have an undefined step
+        step = NaN
+        # Multiply with delta to allow possible override of output class.
+        y = y * delta
+
+    y += start
+
+    if endpoint and num > 1:
+        y[-1] = stop
+
+    if axis != 0:
+        y = _nx.moveaxis(y, 0, axis)
+
+    if retstep:
+        return y.astype(dtype, copy=False), step
+    else:
+        return y.astype(dtype, copy=False)
+
+
+def _logspace_dispatcher(start, stop, num=None, endpoint=None, base=None,
+                         dtype=None, axis=None):
+    return (start, stop)
+
+
+@array_function_dispatch(_logspace_dispatcher)
+def logspace(start, stop, num=50, endpoint=True, base=10.0, dtype=None,
+             axis=0):
+    """
+    Return numbers spaced evenly on a log scale.
+
+    In linear space, the sequence starts at ``base ** start``
+    (`base` to the power of `start`) and ends with ``base ** stop``
+    (see `endpoint` below).
+
+    .. versionchanged:: 1.16.0
+        Non-scalar `start` and `stop` are now supported.
+
+    Parameters
+    ----------
+    start : array_like
+        ``base ** start`` is the starting value of the sequence.
+    stop : array_like
+        ``base ** stop`` is the final value of the sequence, unless `endpoint`
+        is False.  In that case, ``num + 1`` values are spaced over the
+        interval in log-space, of which all but the last (a sequence of
+        length `num`) are returned.
+    num : integer, optional
+        Number of samples to generate.  Default is 50.
+    endpoint : boolean, optional
+        If true, `stop` is the last sample. Otherwise, it is not included.
+        Default is True.
+    base : float, optional
+        The base of the log space. The step size between the elements in
+        ``ln(samples) / ln(base)`` (or ``log_base(samples)``) is uniform.
+        Default is 10.0.
+    dtype : dtype
+        The type of the output array.  If `dtype` is not given, infer the data
+        type from the other input arguments.
+    axis : int, optional
+        The axis in the result to store the samples.  Relevant only if start
+        or stop are array-like.  By default (0), the samples will be along a
+        new axis inserted at the beginning. Use -1 to get an axis at the end.
+
+        .. versionadded:: 1.16.0
+
+
+    Returns
+    -------
+    samples : ndarray
+        `num` samples, equally spaced on a log scale.
+
+    See Also
+    --------
+    arange : Similar to linspace, with the step size specified instead of the
+             number of samples. Note that, when used with a float endpoint, the
+             endpoint may or may not be included.
+    linspace : Similar to logspace, but with the samples uniformly distributed
+               in linear space, instead of log space.
+    geomspace : Similar to logspace, but with endpoints specified directly.
+
+    Notes
+    -----
+    Logspace is equivalent to the code
+
+    >>> y = np.linspace(start, stop, num=num, endpoint=endpoint)
+    ... # doctest: +SKIP
+    >>> power(base, y).astype(dtype)
+    ... # doctest: +SKIP
+
+    Examples
+    --------
+    >>> np.logspace(2.0, 3.0, num=4)
+    array([ 100.        ,  215.443469  ,  464.15888336, 1000.        ])
+    >>> np.logspace(2.0, 3.0, num=4, endpoint=False)
+    array([100.        ,  177.827941  ,  316.22776602,  562.34132519])
+    >>> np.logspace(2.0, 3.0, num=4, base=2.0)
+    array([4.        ,  5.0396842 ,  6.34960421,  8.        ])
+
+    Graphical illustration:
+
+    >>> import matplotlib.pyplot as plt
+    >>> N = 10
+    >>> x1 = np.logspace(0.1, 1, N, endpoint=True)
+    >>> x2 = np.logspace(0.1, 1, N, endpoint=False)
+    >>> y = np.zeros(N)
+    >>> plt.plot(x1, y, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.plot(x2, y + 0.5, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.ylim([-0.5, 1])
+    (-0.5, 1)
+    >>> plt.show()
+
+    """
+    y = linspace(start, stop, num=num, endpoint=endpoint, axis=axis)
+    if dtype is None:
+        return _nx.power(base, y)
+    return _nx.power(base, y).astype(dtype, copy=False)
+
+
+def _geomspace_dispatcher(start, stop, num=None, endpoint=None, dtype=None,
+                          axis=None):
+    return (start, stop)
+
+
+@array_function_dispatch(_geomspace_dispatcher)
+def geomspace(start, stop, num=50, endpoint=True, dtype=None, axis=0):
+    """
+    Return numbers spaced evenly on a log scale (a geometric progression).
+
+    This is similar to `logspace`, but with endpoints specified directly.
+    Each output sample is a constant multiple of the previous.
+
+    .. versionchanged:: 1.16.0
+        Non-scalar `start` and `stop` are now supported.
+
+    Parameters
+    ----------
+    start : array_like
+        The starting value of the sequence.
+    stop : array_like
+        The final value of the sequence, unless `endpoint` is False.
+        In that case, ``num + 1`` values are spaced over the
+        interval in log-space, of which all but the last (a sequence of
+        length `num`) are returned.
+    num : integer, optional
+        Number of samples to generate.  Default is 50.
+    endpoint : boolean, optional
+        If true, `stop` is the last sample. Otherwise, it is not included.
+        Default is True.
+    dtype : dtype
+        The type of the output array.  If `dtype` is not given, infer the data
+        type from the other input arguments.
+    axis : int, optional
+        The axis in the result to store the samples.  Relevant only if start
+        or stop are array-like.  By default (0), the samples will be along a
+        new axis inserted at the beginning. Use -1 to get an axis at the end.
+
+        .. versionadded:: 1.16.0
+
+    Returns
+    -------
+    samples : ndarray
+        `num` samples, equally spaced on a log scale.
+
+    See Also
+    --------
+    logspace : Similar to geomspace, but with endpoints specified using log
+               and base.
+    linspace : Similar to geomspace, but with arithmetic instead of geometric
+               progression.
+    arange : Similar to linspace, with the step size specified instead of the
+             number of samples.
+
+    Notes
+    -----
+    If the inputs or dtype are complex, the output will follow a logarithmic
+    spiral in the complex plane.  (There are an infinite number of spirals
+    passing through two points; the output will follow the shortest such path.)
+
+    Examples
+    --------
+    >>> np.geomspace(1, 1000, num=4)
+    array([    1.,    10.,   100.,  1000.])
+    >>> np.geomspace(1, 1000, num=3, endpoint=False)
+    array([   1.,   10.,  100.])
+    >>> np.geomspace(1, 1000, num=4, endpoint=False)
+    array([   1.        ,    5.62341325,   31.6227766 ,  177.827941  ])
+    >>> np.geomspace(1, 256, num=9)
+    array([   1.,    2.,    4.,    8.,   16.,   32.,   64.,  128.,  256.])
+
+    Note that the above may not produce exact integers:
+
+    >>> np.geomspace(1, 256, num=9, dtype=int)
+    array([  1,   2,   4,   7,  16,  32,  63, 127, 256])
+    >>> np.around(np.geomspace(1, 256, num=9)).astype(int)
+    array([  1,   2,   4,   8,  16,  32,  64, 128, 256])
+
+    Negative, decreasing, and complex inputs are allowed:
+
+    >>> np.geomspace(1000, 1, num=4)
+    array([1000.,  100.,   10.,    1.])
+    >>> np.geomspace(-1000, -1, num=4)
+    array([-1000.,  -100.,   -10.,    -1.])
+    >>> np.geomspace(1j, 1000j, num=4)  # Straight line
+    array([0.   +1.j, 0.  +10.j, 0. +100.j, 0.+1000.j])
+    >>> np.geomspace(-1+0j, 1+0j, num=5)  # Circle
+    array([-1.00000000e+00+1.22464680e-16j, -7.07106781e-01+7.07106781e-01j,
+            6.12323400e-17+1.00000000e+00j,  7.07106781e-01+7.07106781e-01j,
+            1.00000000e+00+0.00000000e+00j])
+
+    Graphical illustration of ``endpoint`` parameter:
+
+    >>> import matplotlib.pyplot as plt
+    >>> N = 10
+    >>> y = np.zeros(N)
+    >>> plt.semilogx(np.geomspace(1, 1000, N, endpoint=True), y + 1, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.semilogx(np.geomspace(1, 1000, N, endpoint=False), y + 2, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.axis([0.5, 2000, 0, 3])
+    [0.5, 2000, 0, 3]
+    >>> plt.grid(True, color='0.7', linestyle='-', which='both', axis='both')
+    >>> plt.show()
+
+    """
+    start = asanyarray(start)
+    stop = asanyarray(stop)
+    if _nx.any(start == 0) or _nx.any(stop == 0):
+        raise ValueError('Geometric sequence cannot include zero')
+
+    dt = result_type(start, stop, float(num), _nx.zeros((), dtype))
+    if dtype is None:
+        dtype = dt
+    else:
+        # complex to dtype('complex128'), for instance
+        dtype = _nx.dtype(dtype)
+
+    # Promote both arguments to the same dtype in case, for instance, one is
+    # complex and another is negative and log would produce NaN otherwise.
+    # Copy since we may change things in-place further down.
+    start = start.astype(dt, copy=True)
+    stop = stop.astype(dt, copy=True)
+
+    out_sign = _nx.ones(_nx.broadcast(start, stop).shape, dt)
+    # Avoid negligible real or imaginary parts in output by rotating to
+    # positive real, calculating, then undoing rotation
+    if _nx.issubdtype(dt, _nx.complexfloating):
+        all_imag = (start.real == 0.) & (stop.real == 0.)
+        if _nx.any(all_imag):
+            start[all_imag] = start[all_imag].imag
+            stop[all_imag] = stop[all_imag].imag
+            out_sign[all_imag] = 1j
+
+    both_negative = (_nx.sign(start) == -1) & (_nx.sign(stop) == -1)
+    if _nx.any(both_negative):
+        _nx.negative(start, out=start, where=both_negative)
+        _nx.negative(stop, out=stop, where=both_negative)
+        _nx.negative(out_sign, out=out_sign, where=both_negative)
+
+    log_start = _nx.log10(start)
+    log_stop = _nx.log10(stop)
+    result = out_sign * logspace(log_start, log_stop, num=num,
+                                 endpoint=endpoint, base=10.0, dtype=dtype)
+    if axis != 0:
+        result = _nx.moveaxis(result, 0, axis)
+
+    return result.astype(dtype, copy=False)
+
+
+def _needs_add_docstring(obj):
+    """
+    Returns true if the only way to set the docstring of `obj` from python is
+    via add_docstring.
+
+    This function errs on the side of being overly conservative.
+    """
+    Py_TPFLAGS_HEAPTYPE = 1 << 9
+
+    if isinstance(obj, (types.FunctionType, types.MethodType, property)):
+        return False
+
+    if isinstance(obj, type) and obj.__flags__ & Py_TPFLAGS_HEAPTYPE:
+        return False
+
+    return True
+
+
+def _add_docstring(obj, doc, warn_on_python):
+    if warn_on_python and not _needs_add_docstring(obj):
+        warnings.warn(
+            "add_newdoc was used on a pure-python object {}. "
+            "Prefer to attach it directly to the source."
+            .format(obj),
+            UserWarning,
+            stacklevel=3)
+    try:
+        add_docstring(obj, doc)
+    except Exception:
+        pass
+
+
+def add_newdoc(place, obj, doc, warn_on_python=True):
+    """
+    Add documentation to an existing object, typically one defined in C
+
+    The purpose is to allow easier editing of the docstrings without requiring
+    a re-compile. This exists primarily for internal use within numpy itself.
+
+    Parameters
+    ----------
+    place : str
+        The absolute name of the module to import from
+    obj : str
+        The name of the object to add documentation to, typically a class or
+        function name
+    doc : {str, Tuple[str, str], List[Tuple[str, str]]}
+        If a string, the documentation to apply to `obj`
+
+        If a tuple, then the first element is interpreted as an attribute of
+        `obj` and the second as the docstring to apply - ``(method, docstring)``
+
+        If a list, then each element of the list should be a tuple of length
+        two - ``[(method1, docstring1), (method2, docstring2), ...]``
+    warn_on_python : bool
+        If True, the default, emit `UserWarning` if this is used to attach
+        documentation to a pure-python object.
+
+    Notes
+    -----
+    This routine never raises an error if the docstring can't be written, but
+    will raise an error if the object being documented does not exist.
+
+    This routine cannot modify read-only docstrings, as appear
+    in new-style classes or built-in functions. Because this
+    routine never raises an error the caller must check manually
+    that the docstrings were changed.
+
+    Since this function grabs the ``char *`` from a c-level str object and puts
+    it into the ``tp_doc`` slot of the type of `obj`, it violates a number of
+    C-API best-practices, by:
+
+    - modifying a `PyTypeObject` after calling `PyType_Ready`
+    - calling `Py_INCREF` on the str and losing the reference, so the str
+      will never be released
+
+    If possible it should be avoided.
+    """
+    new = getattr(__import__(place, globals(), {}, [obj]), obj)
+    if isinstance(doc, str):
+        _add_docstring(new, doc.strip(), warn_on_python)
+    elif isinstance(doc, tuple):
+        attr, docstring = doc
+        _add_docstring(getattr(new, attr), docstring.strip(), warn_on_python)
+    elif isinstance(doc, list):
+        for attr, docstring in doc:
+            _add_docstring(getattr(new, attr), docstring.strip(), warn_on_python)
diff --git a/venv/Lib/site-packages/numpy/core/generate_numpy_api.py b/venv/Lib/site-packages/numpy/core/generate_numpy_api.py
new file mode 100644
index 000000000..fe21bc543
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/generate_numpy_api.py
@@ -0,0 +1,237 @@
+import os
+import genapi
+
+from genapi import \
+        TypeApi, GlobalVarApi, FunctionApi, BoolValuesApi
+
+import numpy_api
+
+# use annotated api when running under cpychecker
+h_template = r"""
+#if defined(_MULTIARRAYMODULE) || defined(WITH_CPYCHECKER_STEALS_REFERENCE_TO_ARG_ATTRIBUTE)
+
+typedef struct {
+        PyObject_HEAD
+        npy_bool obval;
+} PyBoolScalarObject;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayMapIter_Type;
+extern NPY_NO_EXPORT PyTypeObject PyArrayNeighborhoodIter_Type;
+extern NPY_NO_EXPORT PyBoolScalarObject _PyArrayScalar_BoolValues[2];
+
+%s
+
+#else
+
+#if defined(PY_ARRAY_UNIQUE_SYMBOL)
+#define PyArray_API PY_ARRAY_UNIQUE_SYMBOL
+#endif
+
+#if defined(NO_IMPORT) || defined(NO_IMPORT_ARRAY)
+extern void **PyArray_API;
+#else
+#if defined(PY_ARRAY_UNIQUE_SYMBOL)
+void **PyArray_API;
+#else
+static void **PyArray_API=NULL;
+#endif
+#endif
+
+%s
+
+#if !defined(NO_IMPORT_ARRAY) && !defined(NO_IMPORT)
+static int
+_import_array(void)
+{
+  int st;
+  PyObject *numpy = PyImport_ImportModule("numpy.core._multiarray_umath");
+  PyObject *c_api = NULL;
+
+  if (numpy == NULL) {
+      return -1;
+  }
+  c_api = PyObject_GetAttrString(numpy, "_ARRAY_API");
+  Py_DECREF(numpy);
+  if (c_api == NULL) {
+      PyErr_SetString(PyExc_AttributeError, "_ARRAY_API not found");
+      return -1;
+  }
+
+  if (!PyCapsule_CheckExact(c_api)) {
+      PyErr_SetString(PyExc_RuntimeError, "_ARRAY_API is not PyCapsule object");
+      Py_DECREF(c_api);
+      return -1;
+  }
+  PyArray_API = (void **)PyCapsule_GetPointer(c_api, NULL);
+  Py_DECREF(c_api);
+  if (PyArray_API == NULL) {
+      PyErr_SetString(PyExc_RuntimeError, "_ARRAY_API is NULL pointer");
+      return -1;
+  }
+
+  /* Perform runtime check of C API version */
+  if (NPY_VERSION != PyArray_GetNDArrayCVersion()) {
+      PyErr_Format(PyExc_RuntimeError, "module compiled against "\
+             "ABI version 0x%%x but this version of numpy is 0x%%x", \
+             (int) NPY_VERSION, (int) PyArray_GetNDArrayCVersion());
+      return -1;
+  }
+  if (NPY_FEATURE_VERSION > PyArray_GetNDArrayCFeatureVersion()) {
+      PyErr_Format(PyExc_RuntimeError, "module compiled against "\
+             "API version 0x%%x but this version of numpy is 0x%%x", \
+             (int) NPY_FEATURE_VERSION, (int) PyArray_GetNDArrayCFeatureVersion());
+      return -1;
+  }
+
+  /*
+   * Perform runtime check of endianness and check it matches the one set by
+   * the headers (npy_endian.h) as a safeguard
+   */
+  st = PyArray_GetEndianness();
+  if (st == NPY_CPU_UNKNOWN_ENDIAN) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as unknown endian");
+      return -1;
+  }
+#if NPY_BYTE_ORDER == NPY_BIG_ENDIAN
+  if (st != NPY_CPU_BIG) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as "\
+             "big endian, but detected different endianness at runtime");
+      return -1;
+  }
+#elif NPY_BYTE_ORDER == NPY_LITTLE_ENDIAN
+  if (st != NPY_CPU_LITTLE) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as "\
+             "little endian, but detected different endianness at runtime");
+      return -1;
+  }
+#endif
+
+  return 0;
+}
+
+#define import_array() {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, "numpy.core.multiarray failed to import"); return NULL; } }
+
+#define import_array1(ret) {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, "numpy.core.multiarray failed to import"); return ret; } }
+
+#define import_array2(msg, ret) {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, msg); return ret; } }
+
+#endif
+
+#endif
+"""
+
+
+c_template = r"""
+/* These pointers will be stored in the C-object for use in other
+    extension modules
+*/
+
+void *PyArray_API[] = {
+%s
+};
+"""
+
+c_api_header = """
+===========
+NumPy C-API
+===========
+"""
+
+def generate_api(output_dir, force=False):
+    basename = 'multiarray_api'
+
+    h_file = os.path.join(output_dir, '__%s.h' % basename)
+    c_file = os.path.join(output_dir, '__%s.c' % basename)
+    d_file = os.path.join(output_dir, '%s.txt' % basename)
+    targets = (h_file, c_file, d_file)
+
+    sources = numpy_api.multiarray_api
+
+    if (not force and not genapi.should_rebuild(targets, [numpy_api.__file__, __file__])):
+        return targets
+    else:
+        do_generate_api(targets, sources)
+
+    return targets
+
+def do_generate_api(targets, sources):
+    header_file = targets[0]
+    c_file = targets[1]
+    doc_file = targets[2]
+
+    global_vars = sources[0]
+    scalar_bool_values = sources[1]
+    types_api = sources[2]
+    multiarray_funcs = sources[3]
+
+    multiarray_api = sources[:]
+
+    module_list = []
+    extension_list = []
+    init_list = []
+
+    # Check multiarray api indexes
+    multiarray_api_index = genapi.merge_api_dicts(multiarray_api)
+    genapi.check_api_dict(multiarray_api_index)
+
+    numpyapi_list = genapi.get_api_functions('NUMPY_API',
+                                             multiarray_funcs)
+
+    # FIXME: ordered_funcs_api is unused
+    ordered_funcs_api = genapi.order_dict(multiarray_funcs)
+
+    # Create dict name -> *Api instance
+    api_name = 'PyArray_API'
+    multiarray_api_dict = {}
+    for f in numpyapi_list:
+        name = f.name
+        index = multiarray_funcs[name][0]
+        annotations = multiarray_funcs[name][1:]
+        multiarray_api_dict[f.name] = FunctionApi(f.name, index, annotations,
+                                                  f.return_type,
+                                                  f.args, api_name)
+
+    for name, val in global_vars.items():
+        index, type = val
+        multiarray_api_dict[name] = GlobalVarApi(name, index, type, api_name)
+
+    for name, val in scalar_bool_values.items():
+        index = val[0]
+        multiarray_api_dict[name] = BoolValuesApi(name, index, api_name)
+
+    for name, val in types_api.items():
+        index = val[0]
+        multiarray_api_dict[name] = TypeApi(name, index, 'PyTypeObject', api_name)
+
+    if len(multiarray_api_dict) != len(multiarray_api_index):
+        keys_dict = set(multiarray_api_dict.keys())
+        keys_index = set(multiarray_api_index.keys())
+        raise AssertionError(
+            "Multiarray API size mismatch - "
+            "index has extra keys {}, dict has extra keys {}"
+            .format(keys_index - keys_dict, keys_dict - keys_index)
+        )
+
+    extension_list = []
+    for name, index in genapi.order_dict(multiarray_api_index):
+        api_item = multiarray_api_dict[name]
+        extension_list.append(api_item.define_from_array_api_string())
+        init_list.append(api_item.array_api_define())
+        module_list.append(api_item.internal_define())
+
+    # Write to header
+    s = h_template % ('\n'.join(module_list), '\n'.join(extension_list))
+    genapi.write_file(header_file, s)
+
+    # Write to c-code
+    s = c_template % ',\n'.join(init_list)
+    genapi.write_file(c_file, s)
+
+    # write to documentation
+    s = c_api_header
+    for func in numpyapi_list:
+        s += func.to_ReST()
+        s += '\n\n'
+    genapi.write_file(doc_file, s)
+
+    return targets
diff --git a/venv/Lib/site-packages/numpy/core/getlimits.py b/venv/Lib/site-packages/numpy/core/getlimits.py
new file mode 100644
index 000000000..e2ff49393
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/getlimits.py
@@ -0,0 +1,549 @@
+"""Machine limits for Float32 and Float64 and (long double) if available...
+
+"""
+__all__ = ['finfo', 'iinfo']
+
+import warnings
+
+from .machar import MachAr
+from .overrides import set_module
+from . import numeric
+from . import numerictypes as ntypes
+from .numeric import array, inf
+from .umath import log10, exp2
+from . import umath
+
+
+def _fr0(a):
+    """fix rank-0 --> rank-1"""
+    if a.ndim == 0:
+        a = a.copy()
+        a.shape = (1,)
+    return a
+
+
+def _fr1(a):
+    """fix rank > 0 --> rank-0"""
+    if a.size == 1:
+        a = a.copy()
+        a.shape = ()
+    return a
+
+class MachArLike:
+    """ Object to simulate MachAr instance """
+
+    def __init__(self,
+                 ftype,
+                 *, eps, epsneg, huge, tiny, ibeta, **kwargs):
+        params = _MACHAR_PARAMS[ftype]
+        float_conv = lambda v: array([v], ftype)
+        float_to_float = lambda v : _fr1(float_conv(v))
+        float_to_str = lambda v: (params['fmt'] % array(_fr0(v)[0], ftype))
+
+        self.title = params['title']
+        # Parameter types same as for discovered MachAr object.
+        self.epsilon = self.eps = float_to_float(eps)
+        self.epsneg = float_to_float(epsneg)
+        self.xmax = self.huge = float_to_float(huge)
+        self.xmin = self.tiny = float_to_float(tiny)
+        self.ibeta = params['itype'](ibeta)
+        self.__dict__.update(kwargs)
+        self.precision = int(-log10(self.eps))
+        self.resolution = float_to_float(float_conv(10) ** (-self.precision))
+        self._str_eps = float_to_str(self.eps)
+        self._str_epsneg = float_to_str(self.epsneg)
+        self._str_xmin = float_to_str(self.xmin)
+        self._str_xmax = float_to_str(self.xmax)
+        self._str_resolution = float_to_str(self.resolution)
+
+_convert_to_float = {
+    ntypes.csingle: ntypes.single,
+    ntypes.complex_: ntypes.float_,
+    ntypes.clongfloat: ntypes.longfloat
+    }
+
+# Parameters for creating MachAr / MachAr-like objects
+_title_fmt = 'numpy {} precision floating point number'
+_MACHAR_PARAMS = {
+    ntypes.double: dict(
+        itype = ntypes.int64,
+        fmt = '%24.16e',
+        title = _title_fmt.format('double')),
+    ntypes.single: dict(
+        itype = ntypes.int32,
+        fmt = '%15.7e',
+        title = _title_fmt.format('single')),
+    ntypes.longdouble: dict(
+        itype = ntypes.longlong,
+        fmt = '%s',
+        title = _title_fmt.format('long double')),
+    ntypes.half: dict(
+        itype = ntypes.int16,
+        fmt = '%12.5e',
+        title = _title_fmt.format('half'))}
+
+# Key to identify the floating point type.  Key is result of
+# ftype('-0.1').newbyteorder('<').tobytes()
+# See:
+# https://perl5.git.perl.org/perl.git/blob/3118d7d684b56cbeb702af874f4326683c45f045:/Configure
+_KNOWN_TYPES = {}
+def _register_type(machar, bytepat):
+    _KNOWN_TYPES[bytepat] = machar
+_float_ma = {}
+
+def _register_known_types():
+    # Known parameters for float16
+    # See docstring of MachAr class for description of parameters.
+    f16 = ntypes.float16
+    float16_ma = MachArLike(f16,
+                            machep=-10,
+                            negep=-11,
+                            minexp=-14,
+                            maxexp=16,
+                            it=10,
+                            iexp=5,
+                            ibeta=2,
+                            irnd=5,
+                            ngrd=0,
+                            eps=exp2(f16(-10)),
+                            epsneg=exp2(f16(-11)),
+                            huge=f16(65504),
+                            tiny=f16(2 ** -14))
+    _register_type(float16_ma, b'f\xae')
+    _float_ma[16] = float16_ma
+
+    # Known parameters for float32
+    f32 = ntypes.float32
+    float32_ma = MachArLike(f32,
+                            machep=-23,
+                            negep=-24,
+                            minexp=-126,
+                            maxexp=128,
+                            it=23,
+                            iexp=8,
+                            ibeta=2,
+                            irnd=5,
+                            ngrd=0,
+                            eps=exp2(f32(-23)),
+                            epsneg=exp2(f32(-24)),
+                            huge=f32((1 - 2 ** -24) * 2**128),
+                            tiny=exp2(f32(-126)))
+    _register_type(float32_ma, b'\xcd\xcc\xcc\xbd')
+    _float_ma[32] = float32_ma
+
+    # Known parameters for float64
+    f64 = ntypes.float64
+    epsneg_f64 = 2.0 ** -53.0
+    tiny_f64 = 2.0 ** -1022.0
+    float64_ma = MachArLike(f64,
+                            machep=-52,
+                            negep=-53,
+                            minexp=-1022,
+                            maxexp=1024,
+                            it=52,
+                            iexp=11,
+                            ibeta=2,
+                            irnd=5,
+                            ngrd=0,
+                            eps=2.0 ** -52.0,
+                            epsneg=epsneg_f64,
+                            huge=(1.0 - epsneg_f64) / tiny_f64 * f64(4),
+                            tiny=tiny_f64)
+    _register_type(float64_ma, b'\x9a\x99\x99\x99\x99\x99\xb9\xbf')
+    _float_ma[64] = float64_ma
+
+    # Known parameters for IEEE 754 128-bit binary float
+    ld = ntypes.longdouble
+    epsneg_f128 = exp2(ld(-113))
+    tiny_f128 = exp2(ld(-16382))
+    # Ignore runtime error when this is not f128
+    with numeric.errstate(all='ignore'):
+        huge_f128 = (ld(1) - epsneg_f128) / tiny_f128 * ld(4)
+    float128_ma = MachArLike(ld,
+                             machep=-112,
+                             negep=-113,
+                             minexp=-16382,
+                             maxexp=16384,
+                             it=112,
+                             iexp=15,
+                             ibeta=2,
+                             irnd=5,
+                             ngrd=0,
+                             eps=exp2(ld(-112)),
+                             epsneg=epsneg_f128,
+                             huge=huge_f128,
+                             tiny=tiny_f128)
+    # IEEE 754 128-bit binary float
+    _register_type(float128_ma,
+        b'\x9a\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\xfb\xbf')
+    _register_type(float128_ma,
+        b'\x9a\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\x99\xfb\xbf')
+    _float_ma[128] = float128_ma
+
+    # Known parameters for float80 (Intel 80-bit extended precision)
+    epsneg_f80 = exp2(ld(-64))
+    tiny_f80 = exp2(ld(-16382))
+    # Ignore runtime error when this is not f80
+    with numeric.errstate(all='ignore'):
+        huge_f80 = (ld(1) - epsneg_f80) / tiny_f80 * ld(4)
+    float80_ma = MachArLike(ld,
+                            machep=-63,
+                            negep=-64,
+                            minexp=-16382,
+                            maxexp=16384,
+                            it=63,
+                            iexp=15,
+                            ibeta=2,
+                            irnd=5,
+                            ngrd=0,
+                            eps=exp2(ld(-63)),
+                            epsneg=epsneg_f80,
+                            huge=huge_f80,
+                            tiny=tiny_f80)
+    # float80, first 10 bytes containing actual storage
+    _register_type(float80_ma, b'\xcd\xcc\xcc\xcc\xcc\xcc\xcc\xcc\xfb\xbf')
+    _float_ma[80] = float80_ma
+
+    # Guessed / known parameters for double double; see:
+    # https://en.wikipedia.org/wiki/Quadruple-precision_floating-point_format#Double-double_arithmetic
+    # These numbers have the same exponent range as float64, but extended number of
+    # digits in the significand.
+    huge_dd = (umath.nextafter(ld(inf), ld(0))
+                if hasattr(umath, 'nextafter')  # Missing on some platforms?
+                else float64_ma.huge)
+    float_dd_ma = MachArLike(ld,
+                              machep=-105,
+                              negep=-106,
+                              minexp=-1022,
+                              maxexp=1024,
+                              it=105,
+                              iexp=11,
+                              ibeta=2,
+                              irnd=5,
+                              ngrd=0,
+                              eps=exp2(ld(-105)),
+                              epsneg= exp2(ld(-106)),
+                              huge=huge_dd,
+                              tiny=exp2(ld(-1022)))
+    # double double; low, high order (e.g. PPC 64)
+    _register_type(float_dd_ma,
+        b'\x9a\x99\x99\x99\x99\x99Y<\x9a\x99\x99\x99\x99\x99\xb9\xbf')
+    # double double; high, low order (e.g. PPC 64 le)
+    _register_type(float_dd_ma,
+        b'\x9a\x99\x99\x99\x99\x99\xb9\xbf\x9a\x99\x99\x99\x99\x99Y<')
+    _float_ma['dd'] = float_dd_ma
+
+
+def _get_machar(ftype):
+    """ Get MachAr instance or MachAr-like instance
+
+    Get parameters for floating point type, by first trying signatures of
+    various known floating point types, then, if none match, attempting to
+    identify parameters by analysis.
+
+    Parameters
+    ----------
+    ftype : class
+        Numpy floating point type class (e.g. ``np.float64``)
+
+    Returns
+    -------
+    ma_like : instance of :class:`MachAr` or :class:`MachArLike`
+        Object giving floating point parameters for `ftype`.
+
+    Warns
+    -----
+    UserWarning
+        If the binary signature of the float type is not in the dictionary of
+        known float types.
+    """
+    params = _MACHAR_PARAMS.get(ftype)
+    if params is None:
+        raise ValueError(repr(ftype))
+    # Detect known / suspected types
+    key = ftype('-0.1').newbyteorder('<').tobytes()
+    ma_like = _KNOWN_TYPES.get(key)
+    # Could be 80 bit == 10 byte extended precision, where last bytes can be
+    # random garbage.  Try comparing first 10 bytes to pattern.
+    if ma_like is None and ftype == ntypes.longdouble:
+        ma_like = _KNOWN_TYPES.get(key[:10])
+    if ma_like is not None:
+        return ma_like
+    # Fall back to parameter discovery
+    warnings.warn(
+        'Signature {} for {} does not match any known type: '
+        'falling back to type probe function'.format(key, ftype),
+        UserWarning, stacklevel=2)
+    return _discovered_machar(ftype)
+
+
+def _discovered_machar(ftype):
+    """ Create MachAr instance with found information on float types
+    """
+    params = _MACHAR_PARAMS[ftype]
+    return MachAr(lambda v: array([v], ftype),
+                  lambda v:_fr0(v.astype(params['itype']))[0],
+                  lambda v:array(_fr0(v)[0], ftype),
+                  lambda v: params['fmt'] % array(_fr0(v)[0], ftype),
+                  params['title'])
+
+
+@set_module('numpy')
+class finfo:
+    """
+    finfo(dtype)
+
+    Machine limits for floating point types.
+
+    Attributes
+    ----------
+    bits : int
+        The number of bits occupied by the type.
+    eps : float
+        The difference between 1.0 and the next smallest representable float
+        larger than 1.0. For example, for 64-bit binary floats in the IEEE-754
+        standard, ``eps = 2**-52``, approximately 2.22e-16.
+    epsneg : float
+        The difference between 1.0 and the next smallest representable float
+        less than 1.0. For example, for 64-bit binary floats in the IEEE-754
+        standard, ``epsneg = 2**-53``, approximately 1.11e-16.
+    iexp : int
+        The number of bits in the exponent portion of the floating point
+        representation.
+    machar : MachAr
+        The object which calculated these parameters and holds more
+        detailed information.
+    machep : int
+        The exponent that yields `eps`.
+    max : floating point number of the appropriate type
+        The largest representable number.
+    maxexp : int
+        The smallest positive power of the base (2) that causes overflow.
+    min : floating point number of the appropriate type
+        The smallest representable number, typically ``-max``.
+    minexp : int
+        The most negative power of the base (2) consistent with there
+        being no leading 0's in the mantissa.
+    negep : int
+        The exponent that yields `epsneg`.
+    nexp : int
+        The number of bits in the exponent including its sign and bias.
+    nmant : int
+        The number of bits in the mantissa.
+    precision : int
+        The approximate number of decimal digits to which this kind of
+        float is precise.
+    resolution : floating point number of the appropriate type
+        The approximate decimal resolution of this type, i.e.,
+        ``10**-precision``.
+    tiny : float
+        The smallest positive usable number.  Type of `tiny` is an
+        appropriate floating point type.
+
+    Parameters
+    ----------
+    dtype : float, dtype, or instance
+        Kind of floating point data-type about which to get information.
+
+    See Also
+    --------
+    MachAr : The implementation of the tests that produce this information.
+    iinfo : The equivalent for integer data types.
+    spacing : The distance between a value and the nearest adjacent number
+    nextafter : The next floating point value after x1 towards x2
+
+    Notes
+    -----
+    For developers of NumPy: do not instantiate this at the module level.
+    The initial calculation of these parameters is expensive and negatively
+    impacts import times.  These objects are cached, so calling ``finfo()``
+    repeatedly inside your functions is not a problem.
+
+    """
+
+    _finfo_cache = {}
+
+    def __new__(cls, dtype):
+        try:
+            dtype = numeric.dtype(dtype)
+        except TypeError:
+            # In case a float instance was given
+            dtype = numeric.dtype(type(dtype))
+
+        obj = cls._finfo_cache.get(dtype, None)
+        if obj is not None:
+            return obj
+        dtypes = [dtype]
+        newdtype = numeric.obj2sctype(dtype)
+        if newdtype is not dtype:
+            dtypes.append(newdtype)
+            dtype = newdtype
+        if not issubclass(dtype, numeric.inexact):
+            raise ValueError("data type %r not inexact" % (dtype))
+        obj = cls._finfo_cache.get(dtype, None)
+        if obj is not None:
+            return obj
+        if not issubclass(dtype, numeric.floating):
+            newdtype = _convert_to_float[dtype]
+            if newdtype is not dtype:
+                dtypes.append(newdtype)
+                dtype = newdtype
+        obj = cls._finfo_cache.get(dtype, None)
+        if obj is not None:
+            return obj
+        obj = object.__new__(cls)._init(dtype)
+        for dt in dtypes:
+            cls._finfo_cache[dt] = obj
+        return obj
+
+    def _init(self, dtype):
+        self.dtype = numeric.dtype(dtype)
+        machar = _get_machar(dtype)
+
+        for word in ['precision', 'iexp',
+                     'maxexp', 'minexp', 'negep',
+                     'machep']:
+            setattr(self, word, getattr(machar, word))
+        for word in ['tiny', 'resolution', 'epsneg']:
+            setattr(self, word, getattr(machar, word).flat[0])
+        self.bits = self.dtype.itemsize * 8
+        self.max = machar.huge.flat[0]
+        self.min = -self.max
+        self.eps = machar.eps.flat[0]
+        self.nexp = machar.iexp
+        self.nmant = machar.it
+        self.machar = machar
+        self._str_tiny = machar._str_xmin.strip()
+        self._str_max = machar._str_xmax.strip()
+        self._str_epsneg = machar._str_epsneg.strip()
+        self._str_eps = machar._str_eps.strip()
+        self._str_resolution = machar._str_resolution.strip()
+        return self
+
+    def __str__(self):
+        fmt = (
+            'Machine parameters for %(dtype)s\n'
+            '---------------------------------------------------------------\n'
+            'precision = %(precision)3s   resolution = %(_str_resolution)s\n'
+            'machep = %(machep)6s   eps =        %(_str_eps)s\n'
+            'negep =  %(negep)6s   epsneg =     %(_str_epsneg)s\n'
+            'minexp = %(minexp)6s   tiny =       %(_str_tiny)s\n'
+            'maxexp = %(maxexp)6s   max =        %(_str_max)s\n'
+            'nexp =   %(nexp)6s   min =        -max\n'
+            '---------------------------------------------------------------\n'
+            )
+        return fmt % self.__dict__
+
+    def __repr__(self):
+        c = self.__class__.__name__
+        d = self.__dict__.copy()
+        d['klass'] = c
+        return (("%(klass)s(resolution=%(resolution)s, min=-%(_str_max)s,"
+                 " max=%(_str_max)s, dtype=%(dtype)s)") % d)
+
+
+@set_module('numpy')
+class iinfo:
+    """
+    iinfo(type)
+
+    Machine limits for integer types.
+
+    Attributes
+    ----------
+    bits : int
+        The number of bits occupied by the type.
+    min : int
+        The smallest integer expressible by the type.
+    max : int
+        The largest integer expressible by the type.
+
+    Parameters
+    ----------
+    int_type : integer type, dtype, or instance
+        The kind of integer data type to get information about.
+
+    See Also
+    --------
+    finfo : The equivalent for floating point data types.
+
+    Examples
+    --------
+    With types:
+
+    >>> ii16 = np.iinfo(np.int16)
+    >>> ii16.min
+    -32768
+    >>> ii16.max
+    32767
+    >>> ii32 = np.iinfo(np.int32)
+    >>> ii32.min
+    -2147483648
+    >>> ii32.max
+    2147483647
+
+    With instances:
+
+    >>> ii32 = np.iinfo(np.int32(10))
+    >>> ii32.min
+    -2147483648
+    >>> ii32.max
+    2147483647
+
+    """
+
+    _min_vals = {}
+    _max_vals = {}
+
+    def __init__(self, int_type):
+        try:
+            self.dtype = numeric.dtype(int_type)
+        except TypeError:
+            self.dtype = numeric.dtype(type(int_type))
+        self.kind = self.dtype.kind
+        self.bits = self.dtype.itemsize * 8
+        self.key = "%s%d" % (self.kind, self.bits)
+        if self.kind not in 'iu':
+            raise ValueError("Invalid integer data type %r." % (self.kind,))
+
+    @property
+    def min(self):
+        """Minimum value of given dtype."""
+        if self.kind == 'u':
+            return 0
+        else:
+            try:
+                val = iinfo._min_vals[self.key]
+            except KeyError:
+                val = int(-(1 << (self.bits-1)))
+                iinfo._min_vals[self.key] = val
+            return val
+
+    @property
+    def max(self):
+        """Maximum value of given dtype."""
+        try:
+            val = iinfo._max_vals[self.key]
+        except KeyError:
+            if self.kind == 'u':
+                val = int((1 << self.bits) - 1)
+            else:
+                val = int((1 << (self.bits-1)) - 1)
+            iinfo._max_vals[self.key] = val
+        return val
+
+    def __str__(self):
+        """String representation."""
+        fmt = (
+            'Machine parameters for %(dtype)s\n'
+            '---------------------------------------------------------------\n'
+            'min = %(min)s\n'
+            'max = %(max)s\n'
+            '---------------------------------------------------------------\n'
+            )
+        return fmt % {'dtype': self.dtype, 'min': self.min, 'max': self.max}
+
+    def __repr__(self):
+        return "%s(min=%s, max=%s, dtype=%s)" % (self.__class__.__name__,
+                                    self.min, self.max, self.dtype)
+
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/__multiarray_api.h b/venv/Lib/site-packages/numpy/core/include/numpy/__multiarray_api.h
new file mode 100644
index 000000000..b9e197b9c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/__multiarray_api.h
@@ -0,0 +1,1539 @@
+
+#if defined(_MULTIARRAYMODULE) || defined(WITH_CPYCHECKER_STEALS_REFERENCE_TO_ARG_ATTRIBUTE)
+
+typedef struct {
+        PyObject_HEAD
+        npy_bool obval;
+} PyBoolScalarObject;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayMapIter_Type;
+extern NPY_NO_EXPORT PyTypeObject PyArrayNeighborhoodIter_Type;
+extern NPY_NO_EXPORT PyBoolScalarObject _PyArrayScalar_BoolValues[2];
+
+NPY_NO_EXPORT  unsigned int PyArray_GetNDArrayCVersion \
+       (void);
+extern NPY_NO_EXPORT PyTypeObject PyBigArray_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyArray_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayDescr_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayFlags_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayIter_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyArrayMultiIter_Type;
+
+extern NPY_NO_EXPORT int NPY_NUMUSERTYPES;
+
+extern NPY_NO_EXPORT PyTypeObject PyBoolArrType_Type;
+
+extern NPY_NO_EXPORT PyBoolScalarObject _PyArrayScalar_BoolValues[2];
+
+extern NPY_NO_EXPORT PyTypeObject PyGenericArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyNumberArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyIntegerArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PySignedIntegerArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUnsignedIntegerArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyInexactArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyFloatingArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyComplexFloatingArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyFlexibleArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyCharacterArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyByteArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyShortArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyIntArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyLongArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyLongLongArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUByteArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUShortArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUIntArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyULongArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyULongLongArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyFloatArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyDoubleArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyLongDoubleArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyCFloatArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyCDoubleArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyCLongDoubleArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyObjectArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyStringArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUnicodeArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyVoidArrType_Type;
+
+NPY_NO_EXPORT  int PyArray_SetNumericOps \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_GetNumericOps \
+       (void);
+NPY_NO_EXPORT  int PyArray_INCREF \
+       (PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_XDECREF \
+       (PyArrayObject *);
+NPY_NO_EXPORT  void PyArray_SetStringFunction \
+       (PyObject *, int);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrFromType \
+       (int);
+NPY_NO_EXPORT  PyObject * PyArray_TypeObjectFromType \
+       (int);
+NPY_NO_EXPORT  char * PyArray_Zero \
+       (PyArrayObject *);
+NPY_NO_EXPORT  char * PyArray_One \
+       (PyArrayObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) NPY_GCC_NONNULL(2) PyObject * PyArray_CastToType \
+       (PyArrayObject *, PyArray_Descr *, int);
+NPY_NO_EXPORT  int PyArray_CastTo \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_CastAnyTo \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_CanCastSafely \
+       (int, int);
+NPY_NO_EXPORT  npy_bool PyArray_CanCastTo \
+       (PyArray_Descr *, PyArray_Descr *);
+NPY_NO_EXPORT  int PyArray_ObjectType \
+       (PyObject *, int);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrFromObject \
+       (PyObject *, PyArray_Descr *);
+NPY_NO_EXPORT  PyArrayObject ** PyArray_ConvertToCommonType \
+       (PyObject *, int *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrFromScalar \
+       (PyObject *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrFromTypeObject \
+       (PyObject *);
+NPY_NO_EXPORT  npy_intp PyArray_Size \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Scalar \
+       (void *, PyArray_Descr *, PyObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_FromScalar \
+       (PyObject *, PyArray_Descr *);
+NPY_NO_EXPORT  void PyArray_ScalarAsCtype \
+       (PyObject *, void *);
+NPY_NO_EXPORT  int PyArray_CastScalarToCtype \
+       (PyObject *, void *, PyArray_Descr *);
+NPY_NO_EXPORT  int PyArray_CastScalarDirect \
+       (PyObject *, PyArray_Descr *, void *, int);
+NPY_NO_EXPORT  PyObject * PyArray_ScalarFromObject \
+       (PyObject *);
+NPY_NO_EXPORT  PyArray_VectorUnaryFunc * PyArray_GetCastFunc \
+       (PyArray_Descr *, int);
+NPY_NO_EXPORT  PyObject * PyArray_FromDims \
+       (int NPY_UNUSED(nd), int *NPY_UNUSED(d), int NPY_UNUSED(type));
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(3) PyObject * PyArray_FromDimsAndDataAndDescr \
+       (int NPY_UNUSED(nd), int *NPY_UNUSED(d), PyArray_Descr *, char *NPY_UNUSED(data));
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_FromAny \
+       (PyObject *, PyArray_Descr *, int, int, int, PyObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(1) PyObject * PyArray_EnsureArray \
+       (PyObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(1) PyObject * PyArray_EnsureAnyArray \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_FromFile \
+       (FILE *, PyArray_Descr *, npy_intp, char *);
+NPY_NO_EXPORT  PyObject * PyArray_FromString \
+       (char *, npy_intp, PyArray_Descr *, npy_intp, char *);
+NPY_NO_EXPORT  PyObject * PyArray_FromBuffer \
+       (PyObject *, PyArray_Descr *, npy_intp, npy_intp);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_FromIter \
+       (PyObject *, PyArray_Descr *, npy_intp);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(1) PyObject * PyArray_Return \
+       (PyArrayObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) NPY_GCC_NONNULL(2) PyObject * PyArray_GetField \
+       (PyArrayObject *, PyArray_Descr *, int);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) NPY_GCC_NONNULL(2) int PyArray_SetField \
+       (PyArrayObject *, PyArray_Descr *, int, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Byteswap \
+       (PyArrayObject *, npy_bool);
+NPY_NO_EXPORT  PyObject * PyArray_Resize \
+       (PyArrayObject *, PyArray_Dims *, int, NPY_ORDER NPY_UNUSED(order));
+NPY_NO_EXPORT  int PyArray_MoveInto \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_CopyInto \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_CopyAnyInto \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_CopyObject \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT NPY_GCC_NONNULL(1) PyObject * PyArray_NewCopy \
+       (PyArrayObject *, NPY_ORDER);
+NPY_NO_EXPORT  PyObject * PyArray_ToList \
+       (PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_ToString \
+       (PyArrayObject *, NPY_ORDER);
+NPY_NO_EXPORT  int PyArray_ToFile \
+       (PyArrayObject *, FILE *, char *, char *);
+NPY_NO_EXPORT  int PyArray_Dump \
+       (PyObject *, PyObject *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Dumps \
+       (PyObject *, int);
+NPY_NO_EXPORT  int PyArray_ValidType \
+       (int);
+NPY_NO_EXPORT  void PyArray_UpdateFlags \
+       (PyArrayObject *, int);
+NPY_NO_EXPORT NPY_GCC_NONNULL(1) PyObject * PyArray_New \
+       (PyTypeObject *, int, npy_intp const *, int, npy_intp const *, void *, int, int, PyObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) NPY_GCC_NONNULL(1) NPY_GCC_NONNULL(2) PyObject * PyArray_NewFromDescr \
+       (PyTypeObject *, PyArray_Descr *, int, npy_intp const *, npy_intp const *, void *, int, PyObject *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrNew \
+       (PyArray_Descr *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrNewFromType \
+       (int);
+NPY_NO_EXPORT  double PyArray_GetPriority \
+       (PyObject *, double);
+NPY_NO_EXPORT  PyObject * PyArray_IterNew \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject* PyArray_MultiIterNew \
+       (int, ...);
+NPY_NO_EXPORT  int PyArray_PyIntAsInt \
+       (PyObject *);
+NPY_NO_EXPORT  npy_intp PyArray_PyIntAsIntp \
+       (PyObject *);
+NPY_NO_EXPORT  int PyArray_Broadcast \
+       (PyArrayMultiIterObject *);
+NPY_NO_EXPORT  void PyArray_FillObjectArray \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT  int PyArray_FillWithScalar \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT  npy_bool PyArray_CheckStrides \
+       (int, int, npy_intp, npy_intp, npy_intp const *, npy_intp const *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_DescrNewByteorder \
+       (PyArray_Descr *, char);
+NPY_NO_EXPORT  PyObject * PyArray_IterAllButAxis \
+       (PyObject *, int *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_CheckFromAny \
+       (PyObject *, PyArray_Descr *, int, int, int, PyObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_FromArray \
+       (PyArrayObject *, PyArray_Descr *, int);
+NPY_NO_EXPORT  PyObject * PyArray_FromInterface \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_FromStructInterface \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_FromArrayAttr \
+       (PyObject *, PyArray_Descr *, PyObject *);
+NPY_NO_EXPORT  NPY_SCALARKIND PyArray_ScalarKind \
+       (int, PyArrayObject **);
+NPY_NO_EXPORT  int PyArray_CanCoerceScalar \
+       (int, int, NPY_SCALARKIND);
+NPY_NO_EXPORT  PyObject * PyArray_NewFlagsObject \
+       (PyObject *);
+NPY_NO_EXPORT  npy_bool PyArray_CanCastScalar \
+       (PyTypeObject *, PyTypeObject *);
+NPY_NO_EXPORT  int PyArray_CompareUCS4 \
+       (npy_ucs4 const *, npy_ucs4 const *, size_t);
+NPY_NO_EXPORT  int PyArray_RemoveSmallest \
+       (PyArrayMultiIterObject *);
+NPY_NO_EXPORT  int PyArray_ElementStrides \
+       (PyObject *);
+NPY_NO_EXPORT  void PyArray_Item_INCREF \
+       (char *, PyArray_Descr *);
+NPY_NO_EXPORT  void PyArray_Item_XDECREF \
+       (char *, PyArray_Descr *);
+NPY_NO_EXPORT  PyObject * PyArray_FieldNames \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Transpose \
+       (PyArrayObject *, PyArray_Dims *);
+NPY_NO_EXPORT  PyObject * PyArray_TakeFrom \
+       (PyArrayObject *, PyObject *, int, PyArrayObject *, NPY_CLIPMODE);
+NPY_NO_EXPORT  PyObject * PyArray_PutTo \
+       (PyArrayObject *, PyObject*, PyObject *, NPY_CLIPMODE);
+NPY_NO_EXPORT  PyObject * PyArray_PutMask \
+       (PyArrayObject *, PyObject*, PyObject*);
+NPY_NO_EXPORT  PyObject * PyArray_Repeat \
+       (PyArrayObject *, PyObject *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Choose \
+       (PyArrayObject *, PyObject *, PyArrayObject *, NPY_CLIPMODE);
+NPY_NO_EXPORT  int PyArray_Sort \
+       (PyArrayObject *, int, NPY_SORTKIND);
+NPY_NO_EXPORT  PyObject * PyArray_ArgSort \
+       (PyArrayObject *, int, NPY_SORTKIND);
+NPY_NO_EXPORT  PyObject * PyArray_SearchSorted \
+       (PyArrayObject *, PyObject *, NPY_SEARCHSIDE, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_ArgMax \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_ArgMin \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Reshape \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Newshape \
+       (PyArrayObject *, PyArray_Dims *, NPY_ORDER);
+NPY_NO_EXPORT  PyObject * PyArray_Squeeze \
+       (PyArrayObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) PyObject * PyArray_View \
+       (PyArrayObject *, PyArray_Descr *, PyTypeObject *);
+NPY_NO_EXPORT  PyObject * PyArray_SwapAxes \
+       (PyArrayObject *, int, int);
+NPY_NO_EXPORT  PyObject * PyArray_Max \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Min \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Ptp \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Mean \
+       (PyArrayObject *, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Trace \
+       (PyArrayObject *, int, int, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Diagonal \
+       (PyArrayObject *, int, int, int);
+NPY_NO_EXPORT  PyObject * PyArray_Clip \
+       (PyArrayObject *, PyObject *, PyObject *, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Conjugate \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Nonzero \
+       (PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Std \
+       (PyArrayObject *, int, int, PyArrayObject *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Sum \
+       (PyArrayObject *, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_CumSum \
+       (PyArrayObject *, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Prod \
+       (PyArrayObject *, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_CumProd \
+       (PyArrayObject *, int, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_All \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Any \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Compress \
+       (PyArrayObject *, PyObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Flatten \
+       (PyArrayObject *, NPY_ORDER);
+NPY_NO_EXPORT  PyObject * PyArray_Ravel \
+       (PyArrayObject *, NPY_ORDER);
+NPY_NO_EXPORT  npy_intp PyArray_MultiplyList \
+       (npy_intp const *, int);
+NPY_NO_EXPORT  int PyArray_MultiplyIntList \
+       (int const *, int);
+NPY_NO_EXPORT  void * PyArray_GetPtr \
+       (PyArrayObject *, npy_intp const*);
+NPY_NO_EXPORT  int PyArray_CompareLists \
+       (npy_intp const *, npy_intp const *, int);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(5) int PyArray_AsCArray \
+       (PyObject **, void *, npy_intp *, int, PyArray_Descr*);
+NPY_NO_EXPORT  int PyArray_As1D \
+       (PyObject **NPY_UNUSED(op), char **NPY_UNUSED(ptr), int *NPY_UNUSED(d1), int NPY_UNUSED(typecode));
+NPY_NO_EXPORT  int PyArray_As2D \
+       (PyObject **NPY_UNUSED(op), char ***NPY_UNUSED(ptr), int *NPY_UNUSED(d1), int *NPY_UNUSED(d2), int NPY_UNUSED(typecode));
+NPY_NO_EXPORT  int PyArray_Free \
+       (PyObject *, void *);
+NPY_NO_EXPORT  int PyArray_Converter \
+       (PyObject *, PyObject **);
+NPY_NO_EXPORT  int PyArray_IntpFromSequence \
+       (PyObject *, npy_intp *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Concatenate \
+       (PyObject *, int);
+NPY_NO_EXPORT  PyObject * PyArray_InnerProduct \
+       (PyObject *, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_MatrixProduct \
+       (PyObject *, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_CopyAndTranspose \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Correlate \
+       (PyObject *, PyObject *, int);
+NPY_NO_EXPORT  int PyArray_TypestrConvert \
+       (int, int);
+NPY_NO_EXPORT  int PyArray_DescrConverter \
+       (PyObject *, PyArray_Descr **);
+NPY_NO_EXPORT  int PyArray_DescrConverter2 \
+       (PyObject *, PyArray_Descr **);
+NPY_NO_EXPORT  int PyArray_IntpConverter \
+       (PyObject *, PyArray_Dims *);
+NPY_NO_EXPORT  int PyArray_BufferConverter \
+       (PyObject *, PyArray_Chunk *);
+NPY_NO_EXPORT  int PyArray_AxisConverter \
+       (PyObject *, int *);
+NPY_NO_EXPORT  int PyArray_BoolConverter \
+       (PyObject *, npy_bool *);
+NPY_NO_EXPORT  int PyArray_ByteorderConverter \
+       (PyObject *, char *);
+NPY_NO_EXPORT  int PyArray_OrderConverter \
+       (PyObject *, NPY_ORDER *);
+NPY_NO_EXPORT  unsigned char PyArray_EquivTypes \
+       (PyArray_Descr *, PyArray_Descr *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(3) PyObject * PyArray_Zeros \
+       (int, npy_intp const *, PyArray_Descr *, int);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(3) PyObject * PyArray_Empty \
+       (int, npy_intp const *, PyArray_Descr *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Where \
+       (PyObject *, PyObject *, PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_Arange \
+       (double, double, double, int);
+NPY_NO_EXPORT  PyObject * PyArray_ArangeObj \
+       (PyObject *, PyObject *, PyObject *, PyArray_Descr *);
+NPY_NO_EXPORT  int PyArray_SortkindConverter \
+       (PyObject *, NPY_SORTKIND *);
+NPY_NO_EXPORT  PyObject * PyArray_LexSort \
+       (PyObject *, int);
+NPY_NO_EXPORT  PyObject * PyArray_Round \
+       (PyArrayObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  unsigned char PyArray_EquivTypenums \
+       (int, int);
+NPY_NO_EXPORT  int PyArray_RegisterDataType \
+       (PyArray_Descr *);
+NPY_NO_EXPORT  int PyArray_RegisterCastFunc \
+       (PyArray_Descr *, int, PyArray_VectorUnaryFunc *);
+NPY_NO_EXPORT  int PyArray_RegisterCanCast \
+       (PyArray_Descr *, int, NPY_SCALARKIND);
+NPY_NO_EXPORT  void PyArray_InitArrFuncs \
+       (PyArray_ArrFuncs *);
+NPY_NO_EXPORT  PyObject * PyArray_IntTupleFromIntp \
+       (int, npy_intp const *);
+NPY_NO_EXPORT  int PyArray_TypeNumFromName \
+       (char const *);
+NPY_NO_EXPORT  int PyArray_ClipmodeConverter \
+       (PyObject *, NPY_CLIPMODE *);
+NPY_NO_EXPORT  int PyArray_OutputConverter \
+       (PyObject *, PyArrayObject **);
+NPY_NO_EXPORT  PyObject * PyArray_BroadcastToShape \
+       (PyObject *, npy_intp *, int);
+NPY_NO_EXPORT  void _PyArray_SigintHandler \
+       (int);
+NPY_NO_EXPORT  void* _PyArray_GetSigintBuf \
+       (void);
+NPY_NO_EXPORT  int PyArray_DescrAlignConverter \
+       (PyObject *, PyArray_Descr **);
+NPY_NO_EXPORT  int PyArray_DescrAlignConverter2 \
+       (PyObject *, PyArray_Descr **);
+NPY_NO_EXPORT  int PyArray_SearchsideConverter \
+       (PyObject *, void *);
+NPY_NO_EXPORT  PyObject * PyArray_CheckAxis \
+       (PyArrayObject *, int *, int);
+NPY_NO_EXPORT  npy_intp PyArray_OverflowMultiplyList \
+       (npy_intp const *, int);
+NPY_NO_EXPORT  int PyArray_CompareString \
+       (const char *, const char *, size_t);
+NPY_NO_EXPORT  PyObject* PyArray_MultiIterFromObjects \
+       (PyObject **, int, int, ...);
+NPY_NO_EXPORT  int PyArray_GetEndianness \
+       (void);
+NPY_NO_EXPORT  unsigned int PyArray_GetNDArrayCFeatureVersion \
+       (void);
+NPY_NO_EXPORT  PyObject * PyArray_Correlate2 \
+       (PyObject *, PyObject *, int);
+NPY_NO_EXPORT  PyObject* PyArray_NeighborhoodIterNew \
+       (PyArrayIterObject *, const npy_intp *, int, PyArrayObject*);
+extern NPY_NO_EXPORT PyTypeObject PyTimeIntegerArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyDatetimeArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyTimedeltaArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyHalfArrType_Type;
+
+extern NPY_NO_EXPORT PyTypeObject NpyIter_Type;
+
+NPY_NO_EXPORT  void PyArray_SetDatetimeParseFunction \
+       (PyObject *NPY_UNUSED(op));
+NPY_NO_EXPORT  void PyArray_DatetimeToDatetimeStruct \
+       (npy_datetime NPY_UNUSED(val), NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_datetimestruct *);
+NPY_NO_EXPORT  void PyArray_TimedeltaToTimedeltaStruct \
+       (npy_timedelta NPY_UNUSED(val), NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_timedeltastruct *);
+NPY_NO_EXPORT  npy_datetime PyArray_DatetimeStructToDatetime \
+       (NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_datetimestruct *NPY_UNUSED(d));
+NPY_NO_EXPORT  npy_datetime PyArray_TimedeltaStructToTimedelta \
+       (NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_timedeltastruct *NPY_UNUSED(d));
+NPY_NO_EXPORT  NpyIter * NpyIter_New \
+       (PyArrayObject *, npy_uint32, NPY_ORDER, NPY_CASTING, PyArray_Descr*);
+NPY_NO_EXPORT  NpyIter * NpyIter_MultiNew \
+       (int, PyArrayObject **, npy_uint32, NPY_ORDER, NPY_CASTING, npy_uint32 *, PyArray_Descr **);
+NPY_NO_EXPORT  NpyIter * NpyIter_AdvancedNew \
+       (int, PyArrayObject **, npy_uint32, NPY_ORDER, NPY_CASTING, npy_uint32 *, PyArray_Descr **, int, int **, npy_intp *, npy_intp);
+NPY_NO_EXPORT  NpyIter * NpyIter_Copy \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_Deallocate \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_HasDelayedBufAlloc \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_HasExternalLoop \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_EnableExternalLoop \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_intp * NpyIter_GetInnerStrideArray \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_intp * NpyIter_GetInnerLoopSizePtr \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_Reset \
+       (NpyIter *, char **);
+NPY_NO_EXPORT  int NpyIter_ResetBasePointers \
+       (NpyIter *, char **, char **);
+NPY_NO_EXPORT  int NpyIter_ResetToIterIndexRange \
+       (NpyIter *, npy_intp, npy_intp, char **);
+NPY_NO_EXPORT  int NpyIter_GetNDim \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_GetNOp \
+       (NpyIter *);
+NPY_NO_EXPORT  NpyIter_IterNextFunc * NpyIter_GetIterNext \
+       (NpyIter *, char **);
+NPY_NO_EXPORT  npy_intp NpyIter_GetIterSize \
+       (NpyIter *);
+NPY_NO_EXPORT  void NpyIter_GetIterIndexRange \
+       (NpyIter *, npy_intp *, npy_intp *);
+NPY_NO_EXPORT  npy_intp NpyIter_GetIterIndex \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_GotoIterIndex \
+       (NpyIter *, npy_intp);
+NPY_NO_EXPORT  npy_bool NpyIter_HasMultiIndex \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_GetShape \
+       (NpyIter *, npy_intp *);
+NPY_NO_EXPORT  NpyIter_GetMultiIndexFunc * NpyIter_GetGetMultiIndex \
+       (NpyIter *, char **);
+NPY_NO_EXPORT  int NpyIter_GotoMultiIndex \
+       (NpyIter *, npy_intp const *);
+NPY_NO_EXPORT  int NpyIter_RemoveMultiIndex \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_HasIndex \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_IsBuffered \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_IsGrowInner \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_intp NpyIter_GetBufferSize \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_intp * NpyIter_GetIndexPtr \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_GotoIndex \
+       (NpyIter *, npy_intp);
+NPY_NO_EXPORT  char ** NpyIter_GetDataPtrArray \
+       (NpyIter *);
+NPY_NO_EXPORT  PyArray_Descr ** NpyIter_GetDescrArray \
+       (NpyIter *);
+NPY_NO_EXPORT  PyArrayObject ** NpyIter_GetOperandArray \
+       (NpyIter *);
+NPY_NO_EXPORT  PyArrayObject * NpyIter_GetIterView \
+       (NpyIter *, npy_intp);
+NPY_NO_EXPORT  void NpyIter_GetReadFlags \
+       (NpyIter *, char *);
+NPY_NO_EXPORT  void NpyIter_GetWriteFlags \
+       (NpyIter *, char *);
+NPY_NO_EXPORT  void NpyIter_DebugPrint \
+       (NpyIter *);
+NPY_NO_EXPORT  npy_bool NpyIter_IterationNeedsAPI \
+       (NpyIter *);
+NPY_NO_EXPORT  void NpyIter_GetInnerFixedStrideArray \
+       (NpyIter *, npy_intp *);
+NPY_NO_EXPORT  int NpyIter_RemoveAxis \
+       (NpyIter *, int);
+NPY_NO_EXPORT  npy_intp * NpyIter_GetAxisStrideArray \
+       (NpyIter *, int);
+NPY_NO_EXPORT  npy_bool NpyIter_RequiresBuffering \
+       (NpyIter *);
+NPY_NO_EXPORT  char ** NpyIter_GetInitialDataPtrArray \
+       (NpyIter *);
+NPY_NO_EXPORT  int NpyIter_CreateCompatibleStrides \
+       (NpyIter *, npy_intp, npy_intp *);
+NPY_NO_EXPORT  int PyArray_CastingConverter \
+       (PyObject *, NPY_CASTING *);
+NPY_NO_EXPORT  npy_intp PyArray_CountNonzero \
+       (PyArrayObject *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_PromoteTypes \
+       (PyArray_Descr *, PyArray_Descr *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_MinScalarType \
+       (PyArrayObject *);
+NPY_NO_EXPORT  PyArray_Descr * PyArray_ResultType \
+       (npy_intp, PyArrayObject **, npy_intp, PyArray_Descr **);
+NPY_NO_EXPORT  npy_bool PyArray_CanCastArrayTo \
+       (PyArrayObject *, PyArray_Descr *, NPY_CASTING);
+NPY_NO_EXPORT  npy_bool PyArray_CanCastTypeTo \
+       (PyArray_Descr *, PyArray_Descr *, NPY_CASTING);
+NPY_NO_EXPORT  PyArrayObject * PyArray_EinsteinSum \
+       (char *, npy_intp, PyArrayObject **, PyArray_Descr *, NPY_ORDER, NPY_CASTING, PyArrayObject *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(3) NPY_GCC_NONNULL(1) PyObject * PyArray_NewLikeArray \
+       (PyArrayObject *, NPY_ORDER, PyArray_Descr *, int);
+NPY_NO_EXPORT  int PyArray_GetArrayParamsFromObject \
+       (PyObject *, PyArray_Descr *, npy_bool, PyArray_Descr **, int *, npy_intp *, PyArrayObject **, PyObject *);
+NPY_NO_EXPORT  int PyArray_ConvertClipmodeSequence \
+       (PyObject *, NPY_CLIPMODE *, int);
+NPY_NO_EXPORT  PyObject * PyArray_MatrixProduct2 \
+       (PyObject *, PyObject *, PyArrayObject*);
+NPY_NO_EXPORT  npy_bool NpyIter_IsFirstVisit \
+       (NpyIter *, int);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) int PyArray_SetBaseObject \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT  void PyArray_CreateSortedStridePerm \
+       (int, npy_intp const *, npy_stride_sort_item *);
+NPY_NO_EXPORT  void PyArray_RemoveAxesInPlace \
+       (PyArrayObject *, const npy_bool *);
+NPY_NO_EXPORT  void PyArray_DebugPrint \
+       (PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_FailUnlessWriteable \
+       (PyArrayObject *, const char *);
+NPY_NO_EXPORT NPY_STEALS_REF_TO_ARG(2) int PyArray_SetUpdateIfCopyBase \
+       (PyArrayObject *, PyArrayObject *);
+NPY_NO_EXPORT  void * PyDataMem_NEW \
+       (size_t);
+NPY_NO_EXPORT  void PyDataMem_FREE \
+       (void *);
+NPY_NO_EXPORT  void * PyDataMem_RENEW \
+       (void *, size_t);
+NPY_NO_EXPORT  PyDataMem_EventHookFunc * PyDataMem_SetEventHook \
+       (PyDataMem_EventHookFunc *, void *, void **);
+extern NPY_NO_EXPORT NPY_CASTING NPY_DEFAULT_ASSIGN_CASTING;
+
+NPY_NO_EXPORT  void PyArray_MapIterSwapAxes \
+       (PyArrayMapIterObject *, PyArrayObject **, int);
+NPY_NO_EXPORT  PyObject * PyArray_MapIterArray \
+       (PyArrayObject *, PyObject *);
+NPY_NO_EXPORT  void PyArray_MapIterNext \
+       (PyArrayMapIterObject *);
+NPY_NO_EXPORT  int PyArray_Partition \
+       (PyArrayObject *, PyArrayObject *, int, NPY_SELECTKIND);
+NPY_NO_EXPORT  PyObject * PyArray_ArgPartition \
+       (PyArrayObject *, PyArrayObject *, int, NPY_SELECTKIND);
+NPY_NO_EXPORT  int PyArray_SelectkindConverter \
+       (PyObject *, NPY_SELECTKIND *);
+NPY_NO_EXPORT  void * PyDataMem_NEW_ZEROED \
+       (size_t, size_t);
+NPY_NO_EXPORT NPY_GCC_NONNULL(1) int PyArray_CheckAnyScalarExact \
+       (PyObject *);
+NPY_NO_EXPORT  PyObject * PyArray_MapIterArrayCopyIfOverlap \
+       (PyArrayObject *, PyObject *, int, PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_ResolveWritebackIfCopy \
+       (PyArrayObject *);
+NPY_NO_EXPORT  int PyArray_SetWritebackIfCopyBase \
+       (PyArrayObject *, PyArrayObject *);
+
+#else
+
+#if defined(PY_ARRAY_UNIQUE_SYMBOL)
+#define PyArray_API PY_ARRAY_UNIQUE_SYMBOL
+#endif
+
+#if defined(NO_IMPORT) || defined(NO_IMPORT_ARRAY)
+extern void **PyArray_API;
+#else
+#if defined(PY_ARRAY_UNIQUE_SYMBOL)
+void **PyArray_API;
+#else
+static void **PyArray_API=NULL;
+#endif
+#endif
+
+#define PyArray_GetNDArrayCVersion \
+        (*(unsigned int (*)(void)) \
+         PyArray_API[0])
+#define PyBigArray_Type (*(PyTypeObject *)PyArray_API[1])
+#define PyArray_Type (*(PyTypeObject *)PyArray_API[2])
+#define PyArrayDescr_Type (*(PyTypeObject *)PyArray_API[3])
+#define PyArrayFlags_Type (*(PyTypeObject *)PyArray_API[4])
+#define PyArrayIter_Type (*(PyTypeObject *)PyArray_API[5])
+#define PyArrayMultiIter_Type (*(PyTypeObject *)PyArray_API[6])
+#define NPY_NUMUSERTYPES (*(int *)PyArray_API[7])
+#define PyBoolArrType_Type (*(PyTypeObject *)PyArray_API[8])
+#define _PyArrayScalar_BoolValues ((PyBoolScalarObject *)PyArray_API[9])
+#define PyGenericArrType_Type (*(PyTypeObject *)PyArray_API[10])
+#define PyNumberArrType_Type (*(PyTypeObject *)PyArray_API[11])
+#define PyIntegerArrType_Type (*(PyTypeObject *)PyArray_API[12])
+#define PySignedIntegerArrType_Type (*(PyTypeObject *)PyArray_API[13])
+#define PyUnsignedIntegerArrType_Type (*(PyTypeObject *)PyArray_API[14])
+#define PyInexactArrType_Type (*(PyTypeObject *)PyArray_API[15])
+#define PyFloatingArrType_Type (*(PyTypeObject *)PyArray_API[16])
+#define PyComplexFloatingArrType_Type (*(PyTypeObject *)PyArray_API[17])
+#define PyFlexibleArrType_Type (*(PyTypeObject *)PyArray_API[18])
+#define PyCharacterArrType_Type (*(PyTypeObject *)PyArray_API[19])
+#define PyByteArrType_Type (*(PyTypeObject *)PyArray_API[20])
+#define PyShortArrType_Type (*(PyTypeObject *)PyArray_API[21])
+#define PyIntArrType_Type (*(PyTypeObject *)PyArray_API[22])
+#define PyLongArrType_Type (*(PyTypeObject *)PyArray_API[23])
+#define PyLongLongArrType_Type (*(PyTypeObject *)PyArray_API[24])
+#define PyUByteArrType_Type (*(PyTypeObject *)PyArray_API[25])
+#define PyUShortArrType_Type (*(PyTypeObject *)PyArray_API[26])
+#define PyUIntArrType_Type (*(PyTypeObject *)PyArray_API[27])
+#define PyULongArrType_Type (*(PyTypeObject *)PyArray_API[28])
+#define PyULongLongArrType_Type (*(PyTypeObject *)PyArray_API[29])
+#define PyFloatArrType_Type (*(PyTypeObject *)PyArray_API[30])
+#define PyDoubleArrType_Type (*(PyTypeObject *)PyArray_API[31])
+#define PyLongDoubleArrType_Type (*(PyTypeObject *)PyArray_API[32])
+#define PyCFloatArrType_Type (*(PyTypeObject *)PyArray_API[33])
+#define PyCDoubleArrType_Type (*(PyTypeObject *)PyArray_API[34])
+#define PyCLongDoubleArrType_Type (*(PyTypeObject *)PyArray_API[35])
+#define PyObjectArrType_Type (*(PyTypeObject *)PyArray_API[36])
+#define PyStringArrType_Type (*(PyTypeObject *)PyArray_API[37])
+#define PyUnicodeArrType_Type (*(PyTypeObject *)PyArray_API[38])
+#define PyVoidArrType_Type (*(PyTypeObject *)PyArray_API[39])
+#define PyArray_SetNumericOps \
+        (*(int (*)(PyObject *)) \
+         PyArray_API[40])
+#define PyArray_GetNumericOps \
+        (*(PyObject * (*)(void)) \
+         PyArray_API[41])
+#define PyArray_INCREF \
+        (*(int (*)(PyArrayObject *)) \
+         PyArray_API[42])
+#define PyArray_XDECREF \
+        (*(int (*)(PyArrayObject *)) \
+         PyArray_API[43])
+#define PyArray_SetStringFunction \
+        (*(void (*)(PyObject *, int)) \
+         PyArray_API[44])
+#define PyArray_DescrFromType \
+        (*(PyArray_Descr * (*)(int)) \
+         PyArray_API[45])
+#define PyArray_TypeObjectFromType \
+        (*(PyObject * (*)(int)) \
+         PyArray_API[46])
+#define PyArray_Zero \
+        (*(char * (*)(PyArrayObject *)) \
+         PyArray_API[47])
+#define PyArray_One \
+        (*(char * (*)(PyArrayObject *)) \
+         PyArray_API[48])
+#define PyArray_CastToType \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Descr *, int)) \
+         PyArray_API[49])
+#define PyArray_CastTo \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[50])
+#define PyArray_CastAnyTo \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[51])
+#define PyArray_CanCastSafely \
+        (*(int (*)(int, int)) \
+         PyArray_API[52])
+#define PyArray_CanCastTo \
+        (*(npy_bool (*)(PyArray_Descr *, PyArray_Descr *)) \
+         PyArray_API[53])
+#define PyArray_ObjectType \
+        (*(int (*)(PyObject *, int)) \
+         PyArray_API[54])
+#define PyArray_DescrFromObject \
+        (*(PyArray_Descr * (*)(PyObject *, PyArray_Descr *)) \
+         PyArray_API[55])
+#define PyArray_ConvertToCommonType \
+        (*(PyArrayObject ** (*)(PyObject *, int *)) \
+         PyArray_API[56])
+#define PyArray_DescrFromScalar \
+        (*(PyArray_Descr * (*)(PyObject *)) \
+         PyArray_API[57])
+#define PyArray_DescrFromTypeObject \
+        (*(PyArray_Descr * (*)(PyObject *)) \
+         PyArray_API[58])
+#define PyArray_Size \
+        (*(npy_intp (*)(PyObject *)) \
+         PyArray_API[59])
+#define PyArray_Scalar \
+        (*(PyObject * (*)(void *, PyArray_Descr *, PyObject *)) \
+         PyArray_API[60])
+#define PyArray_FromScalar \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *)) \
+         PyArray_API[61])
+#define PyArray_ScalarAsCtype \
+        (*(void (*)(PyObject *, void *)) \
+         PyArray_API[62])
+#define PyArray_CastScalarToCtype \
+        (*(int (*)(PyObject *, void *, PyArray_Descr *)) \
+         PyArray_API[63])
+#define PyArray_CastScalarDirect \
+        (*(int (*)(PyObject *, PyArray_Descr *, void *, int)) \
+         PyArray_API[64])
+#define PyArray_ScalarFromObject \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[65])
+#define PyArray_GetCastFunc \
+        (*(PyArray_VectorUnaryFunc * (*)(PyArray_Descr *, int)) \
+         PyArray_API[66])
+#define PyArray_FromDims \
+        (*(PyObject * (*)(int NPY_UNUSED(nd), int *NPY_UNUSED(d), int NPY_UNUSED(type))) \
+         PyArray_API[67])
+#define PyArray_FromDimsAndDataAndDescr \
+        (*(PyObject * (*)(int NPY_UNUSED(nd), int *NPY_UNUSED(d), PyArray_Descr *, char *NPY_UNUSED(data))) \
+         PyArray_API[68])
+#define PyArray_FromAny \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *, int, int, int, PyObject *)) \
+         PyArray_API[69])
+#define PyArray_EnsureArray \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[70])
+#define PyArray_EnsureAnyArray \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[71])
+#define PyArray_FromFile \
+        (*(PyObject * (*)(FILE *, PyArray_Descr *, npy_intp, char *)) \
+         PyArray_API[72])
+#define PyArray_FromString \
+        (*(PyObject * (*)(char *, npy_intp, PyArray_Descr *, npy_intp, char *)) \
+         PyArray_API[73])
+#define PyArray_FromBuffer \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *, npy_intp, npy_intp)) \
+         PyArray_API[74])
+#define PyArray_FromIter \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *, npy_intp)) \
+         PyArray_API[75])
+#define PyArray_Return \
+        (*(PyObject * (*)(PyArrayObject *)) \
+         PyArray_API[76])
+#define PyArray_GetField \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Descr *, int)) \
+         PyArray_API[77])
+#define PyArray_SetField \
+        (*(int (*)(PyArrayObject *, PyArray_Descr *, int, PyObject *)) \
+         PyArray_API[78])
+#define PyArray_Byteswap \
+        (*(PyObject * (*)(PyArrayObject *, npy_bool)) \
+         PyArray_API[79])
+#define PyArray_Resize \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Dims *, int, NPY_ORDER NPY_UNUSED(order))) \
+         PyArray_API[80])
+#define PyArray_MoveInto \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[81])
+#define PyArray_CopyInto \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[82])
+#define PyArray_CopyAnyInto \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[83])
+#define PyArray_CopyObject \
+        (*(int (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[84])
+#define PyArray_NewCopy \
+        (*(PyObject * (*)(PyArrayObject *, NPY_ORDER)) \
+         PyArray_API[85])
+#define PyArray_ToList \
+        (*(PyObject * (*)(PyArrayObject *)) \
+         PyArray_API[86])
+#define PyArray_ToString \
+        (*(PyObject * (*)(PyArrayObject *, NPY_ORDER)) \
+         PyArray_API[87])
+#define PyArray_ToFile \
+        (*(int (*)(PyArrayObject *, FILE *, char *, char *)) \
+         PyArray_API[88])
+#define PyArray_Dump \
+        (*(int (*)(PyObject *, PyObject *, int)) \
+         PyArray_API[89])
+#define PyArray_Dumps \
+        (*(PyObject * (*)(PyObject *, int)) \
+         PyArray_API[90])
+#define PyArray_ValidType \
+        (*(int (*)(int)) \
+         PyArray_API[91])
+#define PyArray_UpdateFlags \
+        (*(void (*)(PyArrayObject *, int)) \
+         PyArray_API[92])
+#define PyArray_New \
+        (*(PyObject * (*)(PyTypeObject *, int, npy_intp const *, int, npy_intp const *, void *, int, int, PyObject *)) \
+         PyArray_API[93])
+#define PyArray_NewFromDescr \
+        (*(PyObject * (*)(PyTypeObject *, PyArray_Descr *, int, npy_intp const *, npy_intp const *, void *, int, PyObject *)) \
+         PyArray_API[94])
+#define PyArray_DescrNew \
+        (*(PyArray_Descr * (*)(PyArray_Descr *)) \
+         PyArray_API[95])
+#define PyArray_DescrNewFromType \
+        (*(PyArray_Descr * (*)(int)) \
+         PyArray_API[96])
+#define PyArray_GetPriority \
+        (*(double (*)(PyObject *, double)) \
+         PyArray_API[97])
+#define PyArray_IterNew \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[98])
+#define PyArray_MultiIterNew \
+        (*(PyObject* (*)(int, ...)) \
+         PyArray_API[99])
+#define PyArray_PyIntAsInt \
+        (*(int (*)(PyObject *)) \
+         PyArray_API[100])
+#define PyArray_PyIntAsIntp \
+        (*(npy_intp (*)(PyObject *)) \
+         PyArray_API[101])
+#define PyArray_Broadcast \
+        (*(int (*)(PyArrayMultiIterObject *)) \
+         PyArray_API[102])
+#define PyArray_FillObjectArray \
+        (*(void (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[103])
+#define PyArray_FillWithScalar \
+        (*(int (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[104])
+#define PyArray_CheckStrides \
+        (*(npy_bool (*)(int, int, npy_intp, npy_intp, npy_intp const *, npy_intp const *)) \
+         PyArray_API[105])
+#define PyArray_DescrNewByteorder \
+        (*(PyArray_Descr * (*)(PyArray_Descr *, char)) \
+         PyArray_API[106])
+#define PyArray_IterAllButAxis \
+        (*(PyObject * (*)(PyObject *, int *)) \
+         PyArray_API[107])
+#define PyArray_CheckFromAny \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *, int, int, int, PyObject *)) \
+         PyArray_API[108])
+#define PyArray_FromArray \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Descr *, int)) \
+         PyArray_API[109])
+#define PyArray_FromInterface \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[110])
+#define PyArray_FromStructInterface \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[111])
+#define PyArray_FromArrayAttr \
+        (*(PyObject * (*)(PyObject *, PyArray_Descr *, PyObject *)) \
+         PyArray_API[112])
+#define PyArray_ScalarKind \
+        (*(NPY_SCALARKIND (*)(int, PyArrayObject **)) \
+         PyArray_API[113])
+#define PyArray_CanCoerceScalar \
+        (*(int (*)(int, int, NPY_SCALARKIND)) \
+         PyArray_API[114])
+#define PyArray_NewFlagsObject \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[115])
+#define PyArray_CanCastScalar \
+        (*(npy_bool (*)(PyTypeObject *, PyTypeObject *)) \
+         PyArray_API[116])
+#define PyArray_CompareUCS4 \
+        (*(int (*)(npy_ucs4 const *, npy_ucs4 const *, size_t)) \
+         PyArray_API[117])
+#define PyArray_RemoveSmallest \
+        (*(int (*)(PyArrayMultiIterObject *)) \
+         PyArray_API[118])
+#define PyArray_ElementStrides \
+        (*(int (*)(PyObject *)) \
+         PyArray_API[119])
+#define PyArray_Item_INCREF \
+        (*(void (*)(char *, PyArray_Descr *)) \
+         PyArray_API[120])
+#define PyArray_Item_XDECREF \
+        (*(void (*)(char *, PyArray_Descr *)) \
+         PyArray_API[121])
+#define PyArray_FieldNames \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[122])
+#define PyArray_Transpose \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Dims *)) \
+         PyArray_API[123])
+#define PyArray_TakeFrom \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, int, PyArrayObject *, NPY_CLIPMODE)) \
+         PyArray_API[124])
+#define PyArray_PutTo \
+        (*(PyObject * (*)(PyArrayObject *, PyObject*, PyObject *, NPY_CLIPMODE)) \
+         PyArray_API[125])
+#define PyArray_PutMask \
+        (*(PyObject * (*)(PyArrayObject *, PyObject*, PyObject*)) \
+         PyArray_API[126])
+#define PyArray_Repeat \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, int)) \
+         PyArray_API[127])
+#define PyArray_Choose \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, PyArrayObject *, NPY_CLIPMODE)) \
+         PyArray_API[128])
+#define PyArray_Sort \
+        (*(int (*)(PyArrayObject *, int, NPY_SORTKIND)) \
+         PyArray_API[129])
+#define PyArray_ArgSort \
+        (*(PyObject * (*)(PyArrayObject *, int, NPY_SORTKIND)) \
+         PyArray_API[130])
+#define PyArray_SearchSorted \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, NPY_SEARCHSIDE, PyObject *)) \
+         PyArray_API[131])
+#define PyArray_ArgMax \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[132])
+#define PyArray_ArgMin \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[133])
+#define PyArray_Reshape \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[134])
+#define PyArray_Newshape \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Dims *, NPY_ORDER)) \
+         PyArray_API[135])
+#define PyArray_Squeeze \
+        (*(PyObject * (*)(PyArrayObject *)) \
+         PyArray_API[136])
+#define PyArray_View \
+        (*(PyObject * (*)(PyArrayObject *, PyArray_Descr *, PyTypeObject *)) \
+         PyArray_API[137])
+#define PyArray_SwapAxes \
+        (*(PyObject * (*)(PyArrayObject *, int, int)) \
+         PyArray_API[138])
+#define PyArray_Max \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[139])
+#define PyArray_Min \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[140])
+#define PyArray_Ptp \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[141])
+#define PyArray_Mean \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *)) \
+         PyArray_API[142])
+#define PyArray_Trace \
+        (*(PyObject * (*)(PyArrayObject *, int, int, int, int, PyArrayObject *)) \
+         PyArray_API[143])
+#define PyArray_Diagonal \
+        (*(PyObject * (*)(PyArrayObject *, int, int, int)) \
+         PyArray_API[144])
+#define PyArray_Clip \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, PyObject *, PyArrayObject *)) \
+         PyArray_API[145])
+#define PyArray_Conjugate \
+        (*(PyObject * (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[146])
+#define PyArray_Nonzero \
+        (*(PyObject * (*)(PyArrayObject *)) \
+         PyArray_API[147])
+#define PyArray_Std \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *, int)) \
+         PyArray_API[148])
+#define PyArray_Sum \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *)) \
+         PyArray_API[149])
+#define PyArray_CumSum \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *)) \
+         PyArray_API[150])
+#define PyArray_Prod \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *)) \
+         PyArray_API[151])
+#define PyArray_CumProd \
+        (*(PyObject * (*)(PyArrayObject *, int, int, PyArrayObject *)) \
+         PyArray_API[152])
+#define PyArray_All \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[153])
+#define PyArray_Any \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[154])
+#define PyArray_Compress \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, int, PyArrayObject *)) \
+         PyArray_API[155])
+#define PyArray_Flatten \
+        (*(PyObject * (*)(PyArrayObject *, NPY_ORDER)) \
+         PyArray_API[156])
+#define PyArray_Ravel \
+        (*(PyObject * (*)(PyArrayObject *, NPY_ORDER)) \
+         PyArray_API[157])
+#define PyArray_MultiplyList \
+        (*(npy_intp (*)(npy_intp const *, int)) \
+         PyArray_API[158])
+#define PyArray_MultiplyIntList \
+        (*(int (*)(int const *, int)) \
+         PyArray_API[159])
+#define PyArray_GetPtr \
+        (*(void * (*)(PyArrayObject *, npy_intp const*)) \
+         PyArray_API[160])
+#define PyArray_CompareLists \
+        (*(int (*)(npy_intp const *, npy_intp const *, int)) \
+         PyArray_API[161])
+#define PyArray_AsCArray \
+        (*(int (*)(PyObject **, void *, npy_intp *, int, PyArray_Descr*)) \
+         PyArray_API[162])
+#define PyArray_As1D \
+        (*(int (*)(PyObject **NPY_UNUSED(op), char **NPY_UNUSED(ptr), int *NPY_UNUSED(d1), int NPY_UNUSED(typecode))) \
+         PyArray_API[163])
+#define PyArray_As2D \
+        (*(int (*)(PyObject **NPY_UNUSED(op), char ***NPY_UNUSED(ptr), int *NPY_UNUSED(d1), int *NPY_UNUSED(d2), int NPY_UNUSED(typecode))) \
+         PyArray_API[164])
+#define PyArray_Free \
+        (*(int (*)(PyObject *, void *)) \
+         PyArray_API[165])
+#define PyArray_Converter \
+        (*(int (*)(PyObject *, PyObject **)) \
+         PyArray_API[166])
+#define PyArray_IntpFromSequence \
+        (*(int (*)(PyObject *, npy_intp *, int)) \
+         PyArray_API[167])
+#define PyArray_Concatenate \
+        (*(PyObject * (*)(PyObject *, int)) \
+         PyArray_API[168])
+#define PyArray_InnerProduct \
+        (*(PyObject * (*)(PyObject *, PyObject *)) \
+         PyArray_API[169])
+#define PyArray_MatrixProduct \
+        (*(PyObject * (*)(PyObject *, PyObject *)) \
+         PyArray_API[170])
+#define PyArray_CopyAndTranspose \
+        (*(PyObject * (*)(PyObject *)) \
+         PyArray_API[171])
+#define PyArray_Correlate \
+        (*(PyObject * (*)(PyObject *, PyObject *, int)) \
+         PyArray_API[172])
+#define PyArray_TypestrConvert \
+        (*(int (*)(int, int)) \
+         PyArray_API[173])
+#define PyArray_DescrConverter \
+        (*(int (*)(PyObject *, PyArray_Descr **)) \
+         PyArray_API[174])
+#define PyArray_DescrConverter2 \
+        (*(int (*)(PyObject *, PyArray_Descr **)) \
+         PyArray_API[175])
+#define PyArray_IntpConverter \
+        (*(int (*)(PyObject *, PyArray_Dims *)) \
+         PyArray_API[176])
+#define PyArray_BufferConverter \
+        (*(int (*)(PyObject *, PyArray_Chunk *)) \
+         PyArray_API[177])
+#define PyArray_AxisConverter \
+        (*(int (*)(PyObject *, int *)) \
+         PyArray_API[178])
+#define PyArray_BoolConverter \
+        (*(int (*)(PyObject *, npy_bool *)) \
+         PyArray_API[179])
+#define PyArray_ByteorderConverter \
+        (*(int (*)(PyObject *, char *)) \
+         PyArray_API[180])
+#define PyArray_OrderConverter \
+        (*(int (*)(PyObject *, NPY_ORDER *)) \
+         PyArray_API[181])
+#define PyArray_EquivTypes \
+        (*(unsigned char (*)(PyArray_Descr *, PyArray_Descr *)) \
+         PyArray_API[182])
+#define PyArray_Zeros \
+        (*(PyObject * (*)(int, npy_intp const *, PyArray_Descr *, int)) \
+         PyArray_API[183])
+#define PyArray_Empty \
+        (*(PyObject * (*)(int, npy_intp const *, PyArray_Descr *, int)) \
+         PyArray_API[184])
+#define PyArray_Where \
+        (*(PyObject * (*)(PyObject *, PyObject *, PyObject *)) \
+         PyArray_API[185])
+#define PyArray_Arange \
+        (*(PyObject * (*)(double, double, double, int)) \
+         PyArray_API[186])
+#define PyArray_ArangeObj \
+        (*(PyObject * (*)(PyObject *, PyObject *, PyObject *, PyArray_Descr *)) \
+         PyArray_API[187])
+#define PyArray_SortkindConverter \
+        (*(int (*)(PyObject *, NPY_SORTKIND *)) \
+         PyArray_API[188])
+#define PyArray_LexSort \
+        (*(PyObject * (*)(PyObject *, int)) \
+         PyArray_API[189])
+#define PyArray_Round \
+        (*(PyObject * (*)(PyArrayObject *, int, PyArrayObject *)) \
+         PyArray_API[190])
+#define PyArray_EquivTypenums \
+        (*(unsigned char (*)(int, int)) \
+         PyArray_API[191])
+#define PyArray_RegisterDataType \
+        (*(int (*)(PyArray_Descr *)) \
+         PyArray_API[192])
+#define PyArray_RegisterCastFunc \
+        (*(int (*)(PyArray_Descr *, int, PyArray_VectorUnaryFunc *)) \
+         PyArray_API[193])
+#define PyArray_RegisterCanCast \
+        (*(int (*)(PyArray_Descr *, int, NPY_SCALARKIND)) \
+         PyArray_API[194])
+#define PyArray_InitArrFuncs \
+        (*(void (*)(PyArray_ArrFuncs *)) \
+         PyArray_API[195])
+#define PyArray_IntTupleFromIntp \
+        (*(PyObject * (*)(int, npy_intp const *)) \
+         PyArray_API[196])
+#define PyArray_TypeNumFromName \
+        (*(int (*)(char const *)) \
+         PyArray_API[197])
+#define PyArray_ClipmodeConverter \
+        (*(int (*)(PyObject *, NPY_CLIPMODE *)) \
+         PyArray_API[198])
+#define PyArray_OutputConverter \
+        (*(int (*)(PyObject *, PyArrayObject **)) \
+         PyArray_API[199])
+#define PyArray_BroadcastToShape \
+        (*(PyObject * (*)(PyObject *, npy_intp *, int)) \
+         PyArray_API[200])
+#define _PyArray_SigintHandler \
+        (*(void (*)(int)) \
+         PyArray_API[201])
+#define _PyArray_GetSigintBuf \
+        (*(void* (*)(void)) \
+         PyArray_API[202])
+#define PyArray_DescrAlignConverter \
+        (*(int (*)(PyObject *, PyArray_Descr **)) \
+         PyArray_API[203])
+#define PyArray_DescrAlignConverter2 \
+        (*(int (*)(PyObject *, PyArray_Descr **)) \
+         PyArray_API[204])
+#define PyArray_SearchsideConverter \
+        (*(int (*)(PyObject *, void *)) \
+         PyArray_API[205])
+#define PyArray_CheckAxis \
+        (*(PyObject * (*)(PyArrayObject *, int *, int)) \
+         PyArray_API[206])
+#define PyArray_OverflowMultiplyList \
+        (*(npy_intp (*)(npy_intp const *, int)) \
+         PyArray_API[207])
+#define PyArray_CompareString \
+        (*(int (*)(const char *, const char *, size_t)) \
+         PyArray_API[208])
+#define PyArray_MultiIterFromObjects \
+        (*(PyObject* (*)(PyObject **, int, int, ...)) \
+         PyArray_API[209])
+#define PyArray_GetEndianness \
+        (*(int (*)(void)) \
+         PyArray_API[210])
+#define PyArray_GetNDArrayCFeatureVersion \
+        (*(unsigned int (*)(void)) \
+         PyArray_API[211])
+#define PyArray_Correlate2 \
+        (*(PyObject * (*)(PyObject *, PyObject *, int)) \
+         PyArray_API[212])
+#define PyArray_NeighborhoodIterNew \
+        (*(PyObject* (*)(PyArrayIterObject *, const npy_intp *, int, PyArrayObject*)) \
+         PyArray_API[213])
+#define PyTimeIntegerArrType_Type (*(PyTypeObject *)PyArray_API[214])
+#define PyDatetimeArrType_Type (*(PyTypeObject *)PyArray_API[215])
+#define PyTimedeltaArrType_Type (*(PyTypeObject *)PyArray_API[216])
+#define PyHalfArrType_Type (*(PyTypeObject *)PyArray_API[217])
+#define NpyIter_Type (*(PyTypeObject *)PyArray_API[218])
+#define PyArray_SetDatetimeParseFunction \
+        (*(void (*)(PyObject *NPY_UNUSED(op))) \
+         PyArray_API[219])
+#define PyArray_DatetimeToDatetimeStruct \
+        (*(void (*)(npy_datetime NPY_UNUSED(val), NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_datetimestruct *)) \
+         PyArray_API[220])
+#define PyArray_TimedeltaToTimedeltaStruct \
+        (*(void (*)(npy_timedelta NPY_UNUSED(val), NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_timedeltastruct *)) \
+         PyArray_API[221])
+#define PyArray_DatetimeStructToDatetime \
+        (*(npy_datetime (*)(NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_datetimestruct *NPY_UNUSED(d))) \
+         PyArray_API[222])
+#define PyArray_TimedeltaStructToTimedelta \
+        (*(npy_datetime (*)(NPY_DATETIMEUNIT NPY_UNUSED(fr), npy_timedeltastruct *NPY_UNUSED(d))) \
+         PyArray_API[223])
+#define NpyIter_New \
+        (*(NpyIter * (*)(PyArrayObject *, npy_uint32, NPY_ORDER, NPY_CASTING, PyArray_Descr*)) \
+         PyArray_API[224])
+#define NpyIter_MultiNew \
+        (*(NpyIter * (*)(int, PyArrayObject **, npy_uint32, NPY_ORDER, NPY_CASTING, npy_uint32 *, PyArray_Descr **)) \
+         PyArray_API[225])
+#define NpyIter_AdvancedNew \
+        (*(NpyIter * (*)(int, PyArrayObject **, npy_uint32, NPY_ORDER, NPY_CASTING, npy_uint32 *, PyArray_Descr **, int, int **, npy_intp *, npy_intp)) \
+         PyArray_API[226])
+#define NpyIter_Copy \
+        (*(NpyIter * (*)(NpyIter *)) \
+         PyArray_API[227])
+#define NpyIter_Deallocate \
+        (*(int (*)(NpyIter *)) \
+         PyArray_API[228])
+#define NpyIter_HasDelayedBufAlloc \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[229])
+#define NpyIter_HasExternalLoop \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[230])
+#define NpyIter_EnableExternalLoop \
+        (*(int (*)(NpyIter *)) \
+         PyArray_API[231])
+#define NpyIter_GetInnerStrideArray \
+        (*(npy_intp * (*)(NpyIter *)) \
+         PyArray_API[232])
+#define NpyIter_GetInnerLoopSizePtr \
+        (*(npy_intp * (*)(NpyIter *)) \
+         PyArray_API[233])
+#define NpyIter_Reset \
+        (*(int (*)(NpyIter *, char **)) \
+         PyArray_API[234])
+#define NpyIter_ResetBasePointers \
+        (*(int (*)(NpyIter *, char **, char **)) \
+         PyArray_API[235])
+#define NpyIter_ResetToIterIndexRange \
+        (*(int (*)(NpyIter *, npy_intp, npy_intp, char **)) \
+         PyArray_API[236])
+#define NpyIter_GetNDim \
+        (*(int (*)(NpyIter *)) \
+         PyArray_API[237])
+#define NpyIter_GetNOp \
+        (*(int (*)(NpyIter *)) \
+         PyArray_API[238])
+#define NpyIter_GetIterNext \
+        (*(NpyIter_IterNextFunc * (*)(NpyIter *, char **)) \
+         PyArray_API[239])
+#define NpyIter_GetIterSize \
+        (*(npy_intp (*)(NpyIter *)) \
+         PyArray_API[240])
+#define NpyIter_GetIterIndexRange \
+        (*(void (*)(NpyIter *, npy_intp *, npy_intp *)) \
+         PyArray_API[241])
+#define NpyIter_GetIterIndex \
+        (*(npy_intp (*)(NpyIter *)) \
+         PyArray_API[242])
+#define NpyIter_GotoIterIndex \
+        (*(int (*)(NpyIter *, npy_intp)) \
+         PyArray_API[243])
+#define NpyIter_HasMultiIndex \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[244])
+#define NpyIter_GetShape \
+        (*(int (*)(NpyIter *, npy_intp *)) \
+         PyArray_API[245])
+#define NpyIter_GetGetMultiIndex \
+        (*(NpyIter_GetMultiIndexFunc * (*)(NpyIter *, char **)) \
+         PyArray_API[246])
+#define NpyIter_GotoMultiIndex \
+        (*(int (*)(NpyIter *, npy_intp const *)) \
+         PyArray_API[247])
+#define NpyIter_RemoveMultiIndex \
+        (*(int (*)(NpyIter *)) \
+         PyArray_API[248])
+#define NpyIter_HasIndex \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[249])
+#define NpyIter_IsBuffered \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[250])
+#define NpyIter_IsGrowInner \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[251])
+#define NpyIter_GetBufferSize \
+        (*(npy_intp (*)(NpyIter *)) \
+         PyArray_API[252])
+#define NpyIter_GetIndexPtr \
+        (*(npy_intp * (*)(NpyIter *)) \
+         PyArray_API[253])
+#define NpyIter_GotoIndex \
+        (*(int (*)(NpyIter *, npy_intp)) \
+         PyArray_API[254])
+#define NpyIter_GetDataPtrArray \
+        (*(char ** (*)(NpyIter *)) \
+         PyArray_API[255])
+#define NpyIter_GetDescrArray \
+        (*(PyArray_Descr ** (*)(NpyIter *)) \
+         PyArray_API[256])
+#define NpyIter_GetOperandArray \
+        (*(PyArrayObject ** (*)(NpyIter *)) \
+         PyArray_API[257])
+#define NpyIter_GetIterView \
+        (*(PyArrayObject * (*)(NpyIter *, npy_intp)) \
+         PyArray_API[258])
+#define NpyIter_GetReadFlags \
+        (*(void (*)(NpyIter *, char *)) \
+         PyArray_API[259])
+#define NpyIter_GetWriteFlags \
+        (*(void (*)(NpyIter *, char *)) \
+         PyArray_API[260])
+#define NpyIter_DebugPrint \
+        (*(void (*)(NpyIter *)) \
+         PyArray_API[261])
+#define NpyIter_IterationNeedsAPI \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[262])
+#define NpyIter_GetInnerFixedStrideArray \
+        (*(void (*)(NpyIter *, npy_intp *)) \
+         PyArray_API[263])
+#define NpyIter_RemoveAxis \
+        (*(int (*)(NpyIter *, int)) \
+         PyArray_API[264])
+#define NpyIter_GetAxisStrideArray \
+        (*(npy_intp * (*)(NpyIter *, int)) \
+         PyArray_API[265])
+#define NpyIter_RequiresBuffering \
+        (*(npy_bool (*)(NpyIter *)) \
+         PyArray_API[266])
+#define NpyIter_GetInitialDataPtrArray \
+        (*(char ** (*)(NpyIter *)) \
+         PyArray_API[267])
+#define NpyIter_CreateCompatibleStrides \
+        (*(int (*)(NpyIter *, npy_intp, npy_intp *)) \
+         PyArray_API[268])
+#define PyArray_CastingConverter \
+        (*(int (*)(PyObject *, NPY_CASTING *)) \
+         PyArray_API[269])
+#define PyArray_CountNonzero \
+        (*(npy_intp (*)(PyArrayObject *)) \
+         PyArray_API[270])
+#define PyArray_PromoteTypes \
+        (*(PyArray_Descr * (*)(PyArray_Descr *, PyArray_Descr *)) \
+         PyArray_API[271])
+#define PyArray_MinScalarType \
+        (*(PyArray_Descr * (*)(PyArrayObject *)) \
+         PyArray_API[272])
+#define PyArray_ResultType \
+        (*(PyArray_Descr * (*)(npy_intp, PyArrayObject **, npy_intp, PyArray_Descr **)) \
+         PyArray_API[273])
+#define PyArray_CanCastArrayTo \
+        (*(npy_bool (*)(PyArrayObject *, PyArray_Descr *, NPY_CASTING)) \
+         PyArray_API[274])
+#define PyArray_CanCastTypeTo \
+        (*(npy_bool (*)(PyArray_Descr *, PyArray_Descr *, NPY_CASTING)) \
+         PyArray_API[275])
+#define PyArray_EinsteinSum \
+        (*(PyArrayObject * (*)(char *, npy_intp, PyArrayObject **, PyArray_Descr *, NPY_ORDER, NPY_CASTING, PyArrayObject *)) \
+         PyArray_API[276])
+#define PyArray_NewLikeArray \
+        (*(PyObject * (*)(PyArrayObject *, NPY_ORDER, PyArray_Descr *, int)) \
+         PyArray_API[277])
+#define PyArray_GetArrayParamsFromObject \
+        (*(int (*)(PyObject *, PyArray_Descr *, npy_bool, PyArray_Descr **, int *, npy_intp *, PyArrayObject **, PyObject *)) \
+         PyArray_API[278])
+#define PyArray_ConvertClipmodeSequence \
+        (*(int (*)(PyObject *, NPY_CLIPMODE *, int)) \
+         PyArray_API[279])
+#define PyArray_MatrixProduct2 \
+        (*(PyObject * (*)(PyObject *, PyObject *, PyArrayObject*)) \
+         PyArray_API[280])
+#define NpyIter_IsFirstVisit \
+        (*(npy_bool (*)(NpyIter *, int)) \
+         PyArray_API[281])
+#define PyArray_SetBaseObject \
+        (*(int (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[282])
+#define PyArray_CreateSortedStridePerm \
+        (*(void (*)(int, npy_intp const *, npy_stride_sort_item *)) \
+         PyArray_API[283])
+#define PyArray_RemoveAxesInPlace \
+        (*(void (*)(PyArrayObject *, const npy_bool *)) \
+         PyArray_API[284])
+#define PyArray_DebugPrint \
+        (*(void (*)(PyArrayObject *)) \
+         PyArray_API[285])
+#define PyArray_FailUnlessWriteable \
+        (*(int (*)(PyArrayObject *, const char *)) \
+         PyArray_API[286])
+#define PyArray_SetUpdateIfCopyBase \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[287])
+#define PyDataMem_NEW \
+        (*(void * (*)(size_t)) \
+         PyArray_API[288])
+#define PyDataMem_FREE \
+        (*(void (*)(void *)) \
+         PyArray_API[289])
+#define PyDataMem_RENEW \
+        (*(void * (*)(void *, size_t)) \
+         PyArray_API[290])
+#define PyDataMem_SetEventHook \
+        (*(PyDataMem_EventHookFunc * (*)(PyDataMem_EventHookFunc *, void *, void **)) \
+         PyArray_API[291])
+#define NPY_DEFAULT_ASSIGN_CASTING (*(NPY_CASTING *)PyArray_API[292])
+#define PyArray_MapIterSwapAxes \
+        (*(void (*)(PyArrayMapIterObject *, PyArrayObject **, int)) \
+         PyArray_API[293])
+#define PyArray_MapIterArray \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *)) \
+         PyArray_API[294])
+#define PyArray_MapIterNext \
+        (*(void (*)(PyArrayMapIterObject *)) \
+         PyArray_API[295])
+#define PyArray_Partition \
+        (*(int (*)(PyArrayObject *, PyArrayObject *, int, NPY_SELECTKIND)) \
+         PyArray_API[296])
+#define PyArray_ArgPartition \
+        (*(PyObject * (*)(PyArrayObject *, PyArrayObject *, int, NPY_SELECTKIND)) \
+         PyArray_API[297])
+#define PyArray_SelectkindConverter \
+        (*(int (*)(PyObject *, NPY_SELECTKIND *)) \
+         PyArray_API[298])
+#define PyDataMem_NEW_ZEROED \
+        (*(void * (*)(size_t, size_t)) \
+         PyArray_API[299])
+#define PyArray_CheckAnyScalarExact \
+        (*(int (*)(PyObject *)) \
+         PyArray_API[300])
+#define PyArray_MapIterArrayCopyIfOverlap \
+        (*(PyObject * (*)(PyArrayObject *, PyObject *, int, PyArrayObject *)) \
+         PyArray_API[301])
+#define PyArray_ResolveWritebackIfCopy \
+        (*(int (*)(PyArrayObject *)) \
+         PyArray_API[302])
+#define PyArray_SetWritebackIfCopyBase \
+        (*(int (*)(PyArrayObject *, PyArrayObject *)) \
+         PyArray_API[303])
+
+#if !defined(NO_IMPORT_ARRAY) && !defined(NO_IMPORT)
+static int
+_import_array(void)
+{
+  int st;
+  PyObject *numpy = PyImport_ImportModule("numpy.core._multiarray_umath");
+  PyObject *c_api = NULL;
+
+  if (numpy == NULL) {
+      return -1;
+  }
+  c_api = PyObject_GetAttrString(numpy, "_ARRAY_API");
+  Py_DECREF(numpy);
+  if (c_api == NULL) {
+      PyErr_SetString(PyExc_AttributeError, "_ARRAY_API not found");
+      return -1;
+  }
+
+  if (!PyCapsule_CheckExact(c_api)) {
+      PyErr_SetString(PyExc_RuntimeError, "_ARRAY_API is not PyCapsule object");
+      Py_DECREF(c_api);
+      return -1;
+  }
+  PyArray_API = (void **)PyCapsule_GetPointer(c_api, NULL);
+  Py_DECREF(c_api);
+  if (PyArray_API == NULL) {
+      PyErr_SetString(PyExc_RuntimeError, "_ARRAY_API is NULL pointer");
+      return -1;
+  }
+
+  /* Perform runtime check of C API version */
+  if (NPY_VERSION != PyArray_GetNDArrayCVersion()) {
+      PyErr_Format(PyExc_RuntimeError, "module compiled against "\
+             "ABI version 0x%x but this version of numpy is 0x%x", \
+             (int) NPY_VERSION, (int) PyArray_GetNDArrayCVersion());
+      return -1;
+  }
+  if (NPY_FEATURE_VERSION > PyArray_GetNDArrayCFeatureVersion()) {
+      PyErr_Format(PyExc_RuntimeError, "module compiled against "\
+             "API version 0x%x but this version of numpy is 0x%x", \
+             (int) NPY_FEATURE_VERSION, (int) PyArray_GetNDArrayCFeatureVersion());
+      return -1;
+  }
+
+  /*
+   * Perform runtime check of endianness and check it matches the one set by
+   * the headers (npy_endian.h) as a safeguard
+   */
+  st = PyArray_GetEndianness();
+  if (st == NPY_CPU_UNKNOWN_ENDIAN) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as unknown endian");
+      return -1;
+  }
+#if NPY_BYTE_ORDER == NPY_BIG_ENDIAN
+  if (st != NPY_CPU_BIG) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as "\
+             "big endian, but detected different endianness at runtime");
+      return -1;
+  }
+#elif NPY_BYTE_ORDER == NPY_LITTLE_ENDIAN
+  if (st != NPY_CPU_LITTLE) {
+      PyErr_Format(PyExc_RuntimeError, "FATAL: module compiled as "\
+             "little endian, but detected different endianness at runtime");
+      return -1;
+  }
+#endif
+
+  return 0;
+}
+
+#define import_array() {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, "numpy.core.multiarray failed to import"); return NULL; } }
+
+#define import_array1(ret) {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, "numpy.core.multiarray failed to import"); return ret; } }
+
+#define import_array2(msg, ret) {if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, msg); return ret; } }
+
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/__ufunc_api.h b/venv/Lib/site-packages/numpy/core/include/numpy/__ufunc_api.h
new file mode 100644
index 000000000..c14bbc837
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/__ufunc_api.h
@@ -0,0 +1,311 @@
+
+#ifdef _UMATHMODULE
+
+extern NPY_NO_EXPORT PyTypeObject PyUFunc_Type;
+
+extern NPY_NO_EXPORT PyTypeObject PyUFunc_Type;
+
+NPY_NO_EXPORT  PyObject * PyUFunc_FromFuncAndData \
+       (PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, int);
+NPY_NO_EXPORT  int PyUFunc_RegisterLoopForType \
+       (PyUFuncObject *, int, PyUFuncGenericFunction, const int *, void *);
+NPY_NO_EXPORT  int PyUFunc_GenericFunction \
+       (PyUFuncObject *, PyObject *, PyObject *, PyArrayObject **);
+NPY_NO_EXPORT  void PyUFunc_f_f_As_d_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_d_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_f_f \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_g_g \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_F_F_As_D_D \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_F_F \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_D_D \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_G_G \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_O_O \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_ff_f_As_dd_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_ff_f \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_dd_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_gg_g \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_FF_F_As_DD_D \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_DD_D \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_FF_F \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_GG_G \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_OO_O \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_O_O_method \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_OO_O_method \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_On_Om \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  int PyUFunc_GetPyValues \
+       (char *, int *, int *, PyObject **);
+NPY_NO_EXPORT  int PyUFunc_checkfperr \
+       (int, PyObject *, int *);
+NPY_NO_EXPORT  void PyUFunc_clearfperr \
+       (void);
+NPY_NO_EXPORT  int PyUFunc_getfperr \
+       (void);
+NPY_NO_EXPORT  int PyUFunc_handlefperr \
+       (int, PyObject *, int, int *);
+NPY_NO_EXPORT  int PyUFunc_ReplaceLoopBySignature \
+       (PyUFuncObject *, PyUFuncGenericFunction, const int *, PyUFuncGenericFunction *);
+NPY_NO_EXPORT  PyObject * PyUFunc_FromFuncAndDataAndSignature \
+       (PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, int, const char *);
+NPY_NO_EXPORT  int PyUFunc_SetUsesArraysAsData \
+       (void **, size_t);
+NPY_NO_EXPORT  void PyUFunc_e_e \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_e_e_As_f_f \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_e_e_As_d_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_ee_e \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_ee_e_As_ff_f \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  void PyUFunc_ee_e_As_dd_d \
+       (char **, npy_intp const *, npy_intp const *, void *);
+NPY_NO_EXPORT  int PyUFunc_DefaultTypeResolver \
+       (PyUFuncObject *, NPY_CASTING, PyArrayObject **, PyObject *, PyArray_Descr **);
+NPY_NO_EXPORT  int PyUFunc_ValidateCasting \
+       (PyUFuncObject *, NPY_CASTING, PyArrayObject **, PyArray_Descr **);
+NPY_NO_EXPORT  int PyUFunc_RegisterLoopForDescr \
+       (PyUFuncObject *, PyArray_Descr *, PyUFuncGenericFunction, PyArray_Descr **, void *);
+NPY_NO_EXPORT  PyObject * PyUFunc_FromFuncAndDataAndSignatureAndIdentity \
+       (PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, const int, const char *, PyObject *);
+
+#else
+
+#if defined(PY_UFUNC_UNIQUE_SYMBOL)
+#define PyUFunc_API PY_UFUNC_UNIQUE_SYMBOL
+#endif
+
+#if defined(NO_IMPORT) || defined(NO_IMPORT_UFUNC)
+extern void **PyUFunc_API;
+#else
+#if defined(PY_UFUNC_UNIQUE_SYMBOL)
+void **PyUFunc_API;
+#else
+static void **PyUFunc_API=NULL;
+#endif
+#endif
+
+#define PyUFunc_Type (*(PyTypeObject *)PyUFunc_API[0])
+#define PyUFunc_FromFuncAndData \
+        (*(PyObject * (*)(PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, int)) \
+         PyUFunc_API[1])
+#define PyUFunc_RegisterLoopForType \
+        (*(int (*)(PyUFuncObject *, int, PyUFuncGenericFunction, const int *, void *)) \
+         PyUFunc_API[2])
+#define PyUFunc_GenericFunction \
+        (*(int (*)(PyUFuncObject *, PyObject *, PyObject *, PyArrayObject **)) \
+         PyUFunc_API[3])
+#define PyUFunc_f_f_As_d_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[4])
+#define PyUFunc_d_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[5])
+#define PyUFunc_f_f \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[6])
+#define PyUFunc_g_g \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[7])
+#define PyUFunc_F_F_As_D_D \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[8])
+#define PyUFunc_F_F \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[9])
+#define PyUFunc_D_D \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[10])
+#define PyUFunc_G_G \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[11])
+#define PyUFunc_O_O \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[12])
+#define PyUFunc_ff_f_As_dd_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[13])
+#define PyUFunc_ff_f \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[14])
+#define PyUFunc_dd_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[15])
+#define PyUFunc_gg_g \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[16])
+#define PyUFunc_FF_F_As_DD_D \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[17])
+#define PyUFunc_DD_D \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[18])
+#define PyUFunc_FF_F \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[19])
+#define PyUFunc_GG_G \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[20])
+#define PyUFunc_OO_O \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[21])
+#define PyUFunc_O_O_method \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[22])
+#define PyUFunc_OO_O_method \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[23])
+#define PyUFunc_On_Om \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[24])
+#define PyUFunc_GetPyValues \
+        (*(int (*)(char *, int *, int *, PyObject **)) \
+         PyUFunc_API[25])
+#define PyUFunc_checkfperr \
+        (*(int (*)(int, PyObject *, int *)) \
+         PyUFunc_API[26])
+#define PyUFunc_clearfperr \
+        (*(void (*)(void)) \
+         PyUFunc_API[27])
+#define PyUFunc_getfperr \
+        (*(int (*)(void)) \
+         PyUFunc_API[28])
+#define PyUFunc_handlefperr \
+        (*(int (*)(int, PyObject *, int, int *)) \
+         PyUFunc_API[29])
+#define PyUFunc_ReplaceLoopBySignature \
+        (*(int (*)(PyUFuncObject *, PyUFuncGenericFunction, const int *, PyUFuncGenericFunction *)) \
+         PyUFunc_API[30])
+#define PyUFunc_FromFuncAndDataAndSignature \
+        (*(PyObject * (*)(PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, int, const char *)) \
+         PyUFunc_API[31])
+#define PyUFunc_SetUsesArraysAsData \
+        (*(int (*)(void **, size_t)) \
+         PyUFunc_API[32])
+#define PyUFunc_e_e \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[33])
+#define PyUFunc_e_e_As_f_f \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[34])
+#define PyUFunc_e_e_As_d_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[35])
+#define PyUFunc_ee_e \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[36])
+#define PyUFunc_ee_e_As_ff_f \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[37])
+#define PyUFunc_ee_e_As_dd_d \
+        (*(void (*)(char **, npy_intp const *, npy_intp const *, void *)) \
+         PyUFunc_API[38])
+#define PyUFunc_DefaultTypeResolver \
+        (*(int (*)(PyUFuncObject *, NPY_CASTING, PyArrayObject **, PyObject *, PyArray_Descr **)) \
+         PyUFunc_API[39])
+#define PyUFunc_ValidateCasting \
+        (*(int (*)(PyUFuncObject *, NPY_CASTING, PyArrayObject **, PyArray_Descr **)) \
+         PyUFunc_API[40])
+#define PyUFunc_RegisterLoopForDescr \
+        (*(int (*)(PyUFuncObject *, PyArray_Descr *, PyUFuncGenericFunction, PyArray_Descr **, void *)) \
+         PyUFunc_API[41])
+#define PyUFunc_FromFuncAndDataAndSignatureAndIdentity \
+        (*(PyObject * (*)(PyUFuncGenericFunction *, void **, char *, int, int, int, int, const char *, const char *, const int, const char *, PyObject *)) \
+         PyUFunc_API[42])
+
+static NPY_INLINE int
+_import_umath(void)
+{
+  PyObject *numpy = PyImport_ImportModule("numpy.core._multiarray_umath");
+  PyObject *c_api = NULL;
+
+  if (numpy == NULL) {
+      PyErr_SetString(PyExc_ImportError,
+                      "numpy.core._multiarray_umath failed to import");
+      return -1;
+  }
+  c_api = PyObject_GetAttrString(numpy, "_UFUNC_API");
+  Py_DECREF(numpy);
+  if (c_api == NULL) {
+      PyErr_SetString(PyExc_AttributeError, "_UFUNC_API not found");
+      return -1;
+  }
+
+  if (!PyCapsule_CheckExact(c_api)) {
+      PyErr_SetString(PyExc_RuntimeError, "_UFUNC_API is not PyCapsule object");
+      Py_DECREF(c_api);
+      return -1;
+  }
+  PyUFunc_API = (void **)PyCapsule_GetPointer(c_api, NULL);
+  Py_DECREF(c_api);
+  if (PyUFunc_API == NULL) {
+      PyErr_SetString(PyExc_RuntimeError, "_UFUNC_API is NULL pointer");
+      return -1;
+  }
+  return 0;
+}
+
+#define import_umath() \
+    do {\
+        UFUNC_NOFPE\
+        if (_import_umath() < 0) {\
+            PyErr_Print();\
+            PyErr_SetString(PyExc_ImportError,\
+                    "numpy.core.umath failed to import");\
+            return NULL;\
+        }\
+    } while(0)
+
+#define import_umath1(ret) \
+    do {\
+        UFUNC_NOFPE\
+        if (_import_umath() < 0) {\
+            PyErr_Print();\
+            PyErr_SetString(PyExc_ImportError,\
+                    "numpy.core.umath failed to import");\
+            return ret;\
+        }\
+    } while(0)
+
+#define import_umath2(ret, msg) \
+    do {\
+        UFUNC_NOFPE\
+        if (_import_umath() < 0) {\
+            PyErr_Print();\
+            PyErr_SetString(PyExc_ImportError, msg);\
+            return ret;\
+        }\
+    } while(0)
+
+#define import_ufunc() \
+    do {\
+        UFUNC_NOFPE\
+        if (_import_umath() < 0) {\
+            PyErr_Print();\
+            PyErr_SetString(PyExc_ImportError,\
+                    "numpy.core.umath failed to import");\
+        }\
+    } while(0)
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/_neighborhood_iterator_imp.h b/venv/Lib/site-packages/numpy/core/include/numpy/_neighborhood_iterator_imp.h
new file mode 100644
index 000000000..e8860cbc7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/_neighborhood_iterator_imp.h
@@ -0,0 +1,90 @@
+#ifndef _NPY_INCLUDE_NEIGHBORHOOD_IMP
+#error You should not include this header directly
+#endif
+/*
+ * Private API (here for inline)
+ */
+static NPY_INLINE int
+_PyArrayNeighborhoodIter_IncrCoord(PyArrayNeighborhoodIterObject* iter);
+
+/*
+ * Update to next item of the iterator
+ *
+ * Note: this simply increment the coordinates vector, last dimension
+ * incremented first , i.e, for dimension 3
+ * ...
+ * -1, -1, -1
+ * -1, -1,  0
+ * -1, -1,  1
+ *  ....
+ * -1,  0, -1
+ * -1,  0,  0
+ *  ....
+ * 0,  -1, -1
+ * 0,  -1,  0
+ *  ....
+ */
+#define _UPDATE_COORD_ITER(c) \
+    wb = iter->coordinates[c] < iter->bounds[c][1]; \
+    if (wb) { \
+        iter->coordinates[c] += 1; \
+        return 0; \
+    } \
+    else { \
+        iter->coordinates[c] = iter->bounds[c][0]; \
+    }
+
+static NPY_INLINE int
+_PyArrayNeighborhoodIter_IncrCoord(PyArrayNeighborhoodIterObject* iter)
+{
+    npy_intp i, wb;
+
+    for (i = iter->nd - 1; i >= 0; --i) {
+        _UPDATE_COORD_ITER(i)
+    }
+
+    return 0;
+}
+
+/*
+ * Version optimized for 2d arrays, manual loop unrolling
+ */
+static NPY_INLINE int
+_PyArrayNeighborhoodIter_IncrCoord2D(PyArrayNeighborhoodIterObject* iter)
+{
+    npy_intp wb;
+
+    _UPDATE_COORD_ITER(1)
+    _UPDATE_COORD_ITER(0)
+
+    return 0;
+}
+#undef _UPDATE_COORD_ITER
+
+/*
+ * Advance to the next neighbour
+ */
+static NPY_INLINE int
+PyArrayNeighborhoodIter_Next(PyArrayNeighborhoodIterObject* iter)
+{
+    _PyArrayNeighborhoodIter_IncrCoord (iter);
+    iter->dataptr = iter->translate((PyArrayIterObject*)iter, iter->coordinates);
+
+    return 0;
+}
+
+/*
+ * Reset functions
+ */
+static NPY_INLINE int
+PyArrayNeighborhoodIter_Reset(PyArrayNeighborhoodIterObject* iter)
+{
+    npy_intp i;
+
+    for (i = 0; i < iter->nd; ++i) {
+        iter->coordinates[i] = iter->bounds[i][0];
+    }
+    iter->dataptr = iter->translate((PyArrayIterObject*)iter, iter->coordinates);
+
+    return 0;
+}
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/_numpyconfig.h b/venv/Lib/site-packages/numpy/core/include/numpy/_numpyconfig.h
new file mode 100644
index 000000000..f8f2554b1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/_numpyconfig.h
@@ -0,0 +1,29 @@
+#define NPY_SIZEOF_SHORT SIZEOF_SHORT
+#define NPY_SIZEOF_INT SIZEOF_INT
+#define NPY_SIZEOF_LONG SIZEOF_LONG
+#define NPY_SIZEOF_FLOAT 4
+#define NPY_SIZEOF_COMPLEX_FLOAT 8
+#define NPY_SIZEOF_DOUBLE 8
+#define NPY_SIZEOF_COMPLEX_DOUBLE 16
+#define NPY_SIZEOF_LONGDOUBLE 8
+#define NPY_SIZEOF_COMPLEX_LONGDOUBLE 16
+#define NPY_SIZEOF_PY_INTPTR_T 4
+#define NPY_SIZEOF_OFF_T 4
+#define NPY_SIZEOF_PY_LONG_LONG 8
+#define NPY_SIZEOF_LONGLONG 8
+#define NPY_NO_SIGNAL 1
+#define NPY_NO_SMP 0
+#define NPY_HAVE_DECL_ISNAN
+#define NPY_HAVE_DECL_ISINF
+#define NPY_HAVE_DECL_SIGNBIT
+#define NPY_HAVE_DECL_ISFINITE
+#define NPY_USE_C99_COMPLEX 1
+#define NPY_RELAXED_STRIDES_CHECKING 1
+#define NPY_USE_C99_FORMATS 1
+#define NPY_VISIBILITY_HIDDEN 
+#define NPY_ABI_VERSION 0x01000009
+#define NPY_API_VERSION 0x0000000D
+
+#ifndef __STDC_FORMAT_MACROS
+#define __STDC_FORMAT_MACROS 1
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/arrayobject.h b/venv/Lib/site-packages/numpy/core/include/numpy/arrayobject.h
new file mode 100644
index 000000000..4f46d6b1a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/arrayobject.h
@@ -0,0 +1,11 @@
+#ifndef Py_ARRAYOBJECT_H
+#define Py_ARRAYOBJECT_H
+
+#include "ndarrayobject.h"
+#include "npy_interrupt.h"
+
+#ifdef NPY_NO_PREFIX
+#include "noprefix.h"
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/arrayscalars.h b/venv/Lib/site-packages/numpy/core/include/numpy/arrayscalars.h
new file mode 100644
index 000000000..42a0df76a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/arrayscalars.h
@@ -0,0 +1,181 @@
+#ifndef _NPY_ARRAYSCALARS_H_
+#define _NPY_ARRAYSCALARS_H_
+
+#ifndef _MULTIARRAYMODULE
+typedef struct {
+        PyObject_HEAD
+        npy_bool obval;
+} PyBoolScalarObject;
+#endif
+
+
+typedef struct {
+        PyObject_HEAD
+        signed char obval;
+} PyByteScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        short obval;
+} PyShortScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        int obval;
+} PyIntScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        long obval;
+} PyLongScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_longlong obval;
+} PyLongLongScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        unsigned char obval;
+} PyUByteScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        unsigned short obval;
+} PyUShortScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        unsigned int obval;
+} PyUIntScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        unsigned long obval;
+} PyULongScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_ulonglong obval;
+} PyULongLongScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_half obval;
+} PyHalfScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        float obval;
+} PyFloatScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        double obval;
+} PyDoubleScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_longdouble obval;
+} PyLongDoubleScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_cfloat obval;
+} PyCFloatScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_cdouble obval;
+} PyCDoubleScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        npy_clongdouble obval;
+} PyCLongDoubleScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        PyObject * obval;
+} PyObjectScalarObject;
+
+typedef struct {
+        PyObject_HEAD
+        npy_datetime obval;
+        PyArray_DatetimeMetaData obmeta;
+} PyDatetimeScalarObject;
+
+typedef struct {
+        PyObject_HEAD
+        npy_timedelta obval;
+        PyArray_DatetimeMetaData obmeta;
+} PyTimedeltaScalarObject;
+
+
+typedef struct {
+        PyObject_HEAD
+        char obval;
+} PyScalarObject;
+
+#define PyStringScalarObject PyStringObject
+#define PyStringScalarObject PyStringObject
+typedef struct {
+        /* note that the PyObject_HEAD macro lives right here */
+        PyUnicodeObject base;
+        Py_UCS4 *obval;
+} PyUnicodeScalarObject;
+
+
+typedef struct {
+        PyObject_VAR_HEAD
+        char *obval;
+        PyArray_Descr *descr;
+        int flags;
+        PyObject *base;
+} PyVoidScalarObject;
+
+/* Macros
+     Py<Cls><bitsize>ScalarObject
+     Py<Cls><bitsize>ArrType_Type
+   are defined in ndarrayobject.h
+*/
+
+#define PyArrayScalar_False ((PyObject *)(&(_PyArrayScalar_BoolValues[0])))
+#define PyArrayScalar_True ((PyObject *)(&(_PyArrayScalar_BoolValues[1])))
+#define PyArrayScalar_FromLong(i) \
+        ((PyObject *)(&(_PyArrayScalar_BoolValues[((i)!=0)])))
+#define PyArrayScalar_RETURN_BOOL_FROM_LONG(i)                  \
+        return Py_INCREF(PyArrayScalar_FromLong(i)), \
+                PyArrayScalar_FromLong(i)
+#define PyArrayScalar_RETURN_FALSE              \
+        return Py_INCREF(PyArrayScalar_False),  \
+                PyArrayScalar_False
+#define PyArrayScalar_RETURN_TRUE               \
+        return Py_INCREF(PyArrayScalar_True),   \
+                PyArrayScalar_True
+
+#define PyArrayScalar_New(cls) \
+        Py##cls##ArrType_Type.tp_alloc(&Py##cls##ArrType_Type, 0)
+#define PyArrayScalar_VAL(obj, cls)             \
+        ((Py##cls##ScalarObject *)obj)->obval
+#define PyArrayScalar_ASSIGN(obj, cls, val) \
+        PyArrayScalar_VAL(obj, cls) = val
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/halffloat.h b/venv/Lib/site-packages/numpy/core/include/numpy/halffloat.h
new file mode 100644
index 000000000..ab0d221fb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/halffloat.h
@@ -0,0 +1,70 @@
+#ifndef __NPY_HALFFLOAT_H__
+#define __NPY_HALFFLOAT_H__
+
+#include <Python.h>
+#include <numpy/npy_math.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * Half-precision routines
+ */
+
+/* Conversions */
+float npy_half_to_float(npy_half h);
+double npy_half_to_double(npy_half h);
+npy_half npy_float_to_half(float f);
+npy_half npy_double_to_half(double d);
+/* Comparisons */
+int npy_half_eq(npy_half h1, npy_half h2);
+int npy_half_ne(npy_half h1, npy_half h2);
+int npy_half_le(npy_half h1, npy_half h2);
+int npy_half_lt(npy_half h1, npy_half h2);
+int npy_half_ge(npy_half h1, npy_half h2);
+int npy_half_gt(npy_half h1, npy_half h2);
+/* faster *_nonan variants for when you know h1 and h2 are not NaN */
+int npy_half_eq_nonan(npy_half h1, npy_half h2);
+int npy_half_lt_nonan(npy_half h1, npy_half h2);
+int npy_half_le_nonan(npy_half h1, npy_half h2);
+/* Miscellaneous functions */
+int npy_half_iszero(npy_half h);
+int npy_half_isnan(npy_half h);
+int npy_half_isinf(npy_half h);
+int npy_half_isfinite(npy_half h);
+int npy_half_signbit(npy_half h);
+npy_half npy_half_copysign(npy_half x, npy_half y);
+npy_half npy_half_spacing(npy_half h);
+npy_half npy_half_nextafter(npy_half x, npy_half y);
+npy_half npy_half_divmod(npy_half x, npy_half y, npy_half *modulus);
+
+/*
+ * Half-precision constants
+ */
+
+#define NPY_HALF_ZERO   (0x0000u)
+#define NPY_HALF_PZERO  (0x0000u)
+#define NPY_HALF_NZERO  (0x8000u)
+#define NPY_HALF_ONE    (0x3c00u)
+#define NPY_HALF_NEGONE (0xbc00u)
+#define NPY_HALF_PINF   (0x7c00u)
+#define NPY_HALF_NINF   (0xfc00u)
+#define NPY_HALF_NAN    (0x7e00u)
+
+#define NPY_MAX_HALF    (0x7bffu)
+
+/*
+ * Bit-level conversions
+ */
+
+npy_uint16 npy_floatbits_to_halfbits(npy_uint32 f);
+npy_uint16 npy_doublebits_to_halfbits(npy_uint64 d);
+npy_uint32 npy_halfbits_to_floatbits(npy_uint16 h);
+npy_uint64 npy_halfbits_to_doublebits(npy_uint16 h);
+
+#ifdef __cplusplus
+}
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/multiarray_api.txt b/venv/Lib/site-packages/numpy/core/include/numpy/multiarray_api.txt
new file mode 100644
index 000000000..3a3268f27
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/multiarray_api.txt
@@ -0,0 +1,2459 @@
+
+===========
+NumPy C-API
+===========
+::
+
+  unsigned int
+  PyArray_GetNDArrayCVersion(void )
+
+
+Included at the very first so not auto-grabbed and thus not labeled.
+
+::
+
+  int
+  PyArray_SetNumericOps(PyObject *dict)
+
+Set internal structure with number functions that all arrays will use
+
+::
+
+  PyObject *
+  PyArray_GetNumericOps(void )
+
+Get dictionary showing number functions that all arrays will use
+
+::
+
+  int
+  PyArray_INCREF(PyArrayObject *mp)
+
+For object arrays, increment all internal references.
+
+::
+
+  int
+  PyArray_XDECREF(PyArrayObject *mp)
+
+Decrement all internal references for object arrays.
+(or arrays with object fields)
+
+::
+
+  void
+  PyArray_SetStringFunction(PyObject *op, int repr)
+
+Set the array print function to be a Python function.
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrFromType(int type)
+
+Get the PyArray_Descr structure for a type.
+
+::
+
+  PyObject *
+  PyArray_TypeObjectFromType(int type)
+
+Get a typeobject from a type-number -- can return NULL.
+
+New reference
+
+::
+
+  char *
+  PyArray_Zero(PyArrayObject *arr)
+
+Get pointer to zero of correct type for array.
+
+::
+
+  char *
+  PyArray_One(PyArrayObject *arr)
+
+Get pointer to one of correct type for array
+
+::
+
+  PyObject *
+  PyArray_CastToType(PyArrayObject *arr, PyArray_Descr *dtype, int
+                     is_f_order)
+
+For backward compatibility
+
+Cast an array using typecode structure.
+steals reference to dtype --- cannot be NULL
+
+This function always makes a copy of arr, even if the dtype
+doesn't change.
+
+::
+
+  int
+  PyArray_CastTo(PyArrayObject *out, PyArrayObject *mp)
+
+Cast to an already created array.
+
+::
+
+  int
+  PyArray_CastAnyTo(PyArrayObject *out, PyArrayObject *mp)
+
+Cast to an already created array.  Arrays don't have to be "broadcastable"
+Only requirement is they have the same number of elements.
+
+::
+
+  int
+  PyArray_CanCastSafely(int fromtype, int totype)
+
+Check the type coercion rules.
+
+::
+
+  npy_bool
+  PyArray_CanCastTo(PyArray_Descr *from, PyArray_Descr *to)
+
+leaves reference count alone --- cannot be NULL
+
+PyArray_CanCastTypeTo is equivalent to this, but adds a 'casting'
+parameter.
+
+::
+
+  int
+  PyArray_ObjectType(PyObject *op, int minimum_type)
+
+Return the typecode of the array a Python object would be converted to
+
+Returns the type number the result should have, or NPY_NOTYPE on error.
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrFromObject(PyObject *op, PyArray_Descr *mintype)
+
+new reference -- accepts NULL for mintype
+
+::
+
+  PyArrayObject **
+  PyArray_ConvertToCommonType(PyObject *op, int *retn)
+
+
+This function is only used in one place within NumPy and should
+generally be avoided. It is provided mainly for backward compatibility.
+
+The user of the function has to free the returned array.
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrFromScalar(PyObject *sc)
+
+Return descr object from array scalar.
+
+New reference
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrFromTypeObject(PyObject *type)
+
+
+::
+
+  npy_intp
+  PyArray_Size(PyObject *op)
+
+Compute the size of an array (in number of items)
+
+::
+
+  PyObject *
+  PyArray_Scalar(void *data, PyArray_Descr *descr, PyObject *base)
+
+Get scalar-equivalent to a region of memory described by a descriptor.
+
+::
+
+  PyObject *
+  PyArray_FromScalar(PyObject *scalar, PyArray_Descr *outcode)
+
+Get 0-dim array from scalar
+
+0-dim array from array-scalar object
+always contains a copy of the data
+unless outcode is NULL, it is of void type and the referrer does
+not own it either.
+
+steals reference to outcode
+
+::
+
+  void
+  PyArray_ScalarAsCtype(PyObject *scalar, void *ctypeptr)
+
+Convert to c-type
+
+no error checking is performed -- ctypeptr must be same type as scalar
+in case of flexible type, the data is not copied
+into ctypeptr which is expected to be a pointer to pointer
+
+::
+
+  int
+  PyArray_CastScalarToCtype(PyObject *scalar, void
+                            *ctypeptr, PyArray_Descr *outcode)
+
+Cast Scalar to c-type
+
+The output buffer must be large-enough to receive the value
+Even for flexible types which is different from ScalarAsCtype
+where only a reference for flexible types is returned
+
+This may not work right on narrow builds for NumPy unicode scalars.
+
+::
+
+  int
+  PyArray_CastScalarDirect(PyObject *scalar, PyArray_Descr
+                           *indescr, void *ctypeptr, int outtype)
+
+Cast Scalar to c-type
+
+::
+
+  PyObject *
+  PyArray_ScalarFromObject(PyObject *object)
+
+Get an Array Scalar From a Python Object
+
+Returns NULL if unsuccessful but error is only set if another error occurred.
+Currently only Numeric-like object supported.
+
+::
+
+  PyArray_VectorUnaryFunc *
+  PyArray_GetCastFunc(PyArray_Descr *descr, int type_num)
+
+Get a cast function to cast from the input descriptor to the
+output type_number (must be a registered data-type).
+Returns NULL if un-successful.
+
+::
+
+  PyObject *
+  PyArray_FromDims(int NPY_UNUSED(nd) , int *NPY_UNUSED(d) , int
+                   NPY_UNUSED(type) )
+
+Deprecated, use PyArray_SimpleNew instead.
+
+::
+
+  PyObject *
+  PyArray_FromDimsAndDataAndDescr(int NPY_UNUSED(nd) , int
+                                  *NPY_UNUSED(d) , PyArray_Descr
+                                  *descr, char *NPY_UNUSED(data) )
+
+Deprecated, use PyArray_NewFromDescr instead.
+
+::
+
+  PyObject *
+  PyArray_FromAny(PyObject *op, PyArray_Descr *newtype, int
+                  min_depth, int max_depth, int flags, PyObject
+                  *context)
+
+Does not check for NPY_ARRAY_ENSURECOPY and NPY_ARRAY_NOTSWAPPED in flags
+Steals a reference to newtype --- which can be NULL
+
+::
+
+  PyObject *
+  PyArray_EnsureArray(PyObject *op)
+
+This is a quick wrapper around
+PyArray_FromAny(op, NULL, 0, 0, NPY_ARRAY_ENSUREARRAY, NULL)
+that special cases Arrays and PyArray_Scalars up front
+It *steals a reference* to the object
+It also guarantees that the result is PyArray_Type
+Because it decrefs op if any conversion needs to take place
+so it can be used like PyArray_EnsureArray(some_function(...))
+
+::
+
+  PyObject *
+  PyArray_EnsureAnyArray(PyObject *op)
+
+
+::
+
+  PyObject *
+  PyArray_FromFile(FILE *fp, PyArray_Descr *dtype, npy_intp num, char
+                   *sep)
+
+
+Given a ``FILE *`` pointer ``fp``, and a ``PyArray_Descr``, return an
+array corresponding to the data encoded in that file.
+
+The reference to `dtype` is stolen (it is possible that the passed in
+dtype is not held on to).
+
+The number of elements to read is given as ``num``; if it is < 0, then
+then as many as possible are read.
+
+If ``sep`` is NULL or empty, then binary data is assumed, else
+text data, with ``sep`` as the separator between elements. Whitespace in
+the separator matches any length of whitespace in the text, and a match
+for whitespace around the separator is added.
+
+For memory-mapped files, use the buffer interface. No more data than
+necessary is read by this routine.
+
+::
+
+  PyObject *
+  PyArray_FromString(char *data, npy_intp slen, PyArray_Descr
+                     *dtype, npy_intp num, char *sep)
+
+
+Given a pointer to a string ``data``, a string length ``slen``, and
+a ``PyArray_Descr``, return an array corresponding to the data
+encoded in that string.
+
+If the dtype is NULL, the default array type is used (double).
+If non-null, the reference is stolen.
+
+If ``slen`` is < 0, then the end of string is used for text data.
+It is an error for ``slen`` to be < 0 for binary data (since embedded NULLs
+would be the norm).
+
+The number of elements to read is given as ``num``; if it is < 0, then
+then as many as possible are read.
+
+If ``sep`` is NULL or empty, then binary data is assumed, else
+text data, with ``sep`` as the separator between elements. Whitespace in
+the separator matches any length of whitespace in the text, and a match
+for whitespace around the separator is added.
+
+::
+
+  PyObject *
+  PyArray_FromBuffer(PyObject *buf, PyArray_Descr *type, npy_intp
+                     count, npy_intp offset)
+
+
+::
+
+  PyObject *
+  PyArray_FromIter(PyObject *obj, PyArray_Descr *dtype, npy_intp count)
+
+
+steals a reference to dtype (which cannot be NULL)
+
+::
+
+  PyObject *
+  PyArray_Return(PyArrayObject *mp)
+
+
+Return either an array or the appropriate Python object if the array
+is 0d and matches a Python type.
+steals reference to mp
+
+::
+
+  PyObject *
+  PyArray_GetField(PyArrayObject *self, PyArray_Descr *typed, int
+                   offset)
+
+Get a subset of bytes from each element of the array
+steals reference to typed, must not be NULL
+
+::
+
+  int
+  PyArray_SetField(PyArrayObject *self, PyArray_Descr *dtype, int
+                   offset, PyObject *val)
+
+Set a subset of bytes from each element of the array
+steals reference to dtype, must not be NULL
+
+::
+
+  PyObject *
+  PyArray_Byteswap(PyArrayObject *self, npy_bool inplace)
+
+
+::
+
+  PyObject *
+  PyArray_Resize(PyArrayObject *self, PyArray_Dims *newshape, int
+                 refcheck, NPY_ORDER NPY_UNUSED(order) )
+
+Resize (reallocate data).  Only works if nothing else is referencing this
+array and it is contiguous.  If refcheck is 0, then the reference count is
+not checked and assumed to be 1.  You still must own this data and have no
+weak-references and no base object.
+
+::
+
+  int
+  PyArray_MoveInto(PyArrayObject *dst, PyArrayObject *src)
+
+Move the memory of one array into another, allowing for overlapping data.
+
+Returns 0 on success, negative on failure.
+
+::
+
+  int
+  PyArray_CopyInto(PyArrayObject *dst, PyArrayObject *src)
+
+Copy an Array into another array.
+Broadcast to the destination shape if necessary.
+
+Returns 0 on success, -1 on failure.
+
+::
+
+  int
+  PyArray_CopyAnyInto(PyArrayObject *dst, PyArrayObject *src)
+
+Copy an Array into another array -- memory must not overlap
+Does not require src and dest to have "broadcastable" shapes
+(only the same number of elements).
+
+TODO: For NumPy 2.0, this could accept an order parameter which
+only allows NPY_CORDER and NPY_FORDER.  Could also rename
+this to CopyAsFlat to make the name more intuitive.
+
+Returns 0 on success, -1 on error.
+
+::
+
+  int
+  PyArray_CopyObject(PyArrayObject *dest, PyObject *src_object)
+
+
+::
+
+  PyObject *
+  PyArray_NewCopy(PyArrayObject *obj, NPY_ORDER order)
+
+Copy an array.
+
+::
+
+  PyObject *
+  PyArray_ToList(PyArrayObject *self)
+
+To List
+
+::
+
+  PyObject *
+  PyArray_ToString(PyArrayObject *self, NPY_ORDER order)
+
+
+::
+
+  int
+  PyArray_ToFile(PyArrayObject *self, FILE *fp, char *sep, char *format)
+
+To File
+
+::
+
+  int
+  PyArray_Dump(PyObject *self, PyObject *file, int protocol)
+
+
+::
+
+  PyObject *
+  PyArray_Dumps(PyObject *self, int protocol)
+
+
+::
+
+  int
+  PyArray_ValidType(int type)
+
+Is the typenum valid?
+
+::
+
+  void
+  PyArray_UpdateFlags(PyArrayObject *ret, int flagmask)
+
+Update Several Flags at once.
+
+::
+
+  PyObject *
+  PyArray_New(PyTypeObject *subtype, int nd, npy_intp const *dims, int
+              type_num, npy_intp const *strides, void *data, int
+              itemsize, int flags, PyObject *obj)
+
+Generic new array creation routine.
+
+::
+
+  PyObject *
+  PyArray_NewFromDescr(PyTypeObject *subtype, PyArray_Descr *descr, int
+                       nd, npy_intp const *dims, npy_intp const
+                       *strides, void *data, int flags, PyObject *obj)
+
+Generic new array creation routine.
+
+steals a reference to descr. On failure or when dtype->subarray is
+true, dtype will be decrefed.
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrNew(PyArray_Descr *base)
+
+base cannot be NULL
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrNewFromType(int type_num)
+
+
+::
+
+  double
+  PyArray_GetPriority(PyObject *obj, double default_)
+
+Get Priority from object
+
+::
+
+  PyObject *
+  PyArray_IterNew(PyObject *obj)
+
+Get Iterator.
+
+::
+
+  PyObject*
+  PyArray_MultiIterNew(int n, ... )
+
+Get MultiIterator,
+
+::
+
+  int
+  PyArray_PyIntAsInt(PyObject *o)
+
+
+::
+
+  npy_intp
+  PyArray_PyIntAsIntp(PyObject *o)
+
+
+::
+
+  int
+  PyArray_Broadcast(PyArrayMultiIterObject *mit)
+
+
+::
+
+  void
+  PyArray_FillObjectArray(PyArrayObject *arr, PyObject *obj)
+
+Assumes contiguous
+
+::
+
+  int
+  PyArray_FillWithScalar(PyArrayObject *arr, PyObject *obj)
+
+
+::
+
+  npy_bool
+  PyArray_CheckStrides(int elsize, int nd, npy_intp numbytes, npy_intp
+                       offset, npy_intp const *dims, npy_intp const
+                       *newstrides)
+
+
+::
+
+  PyArray_Descr *
+  PyArray_DescrNewByteorder(PyArray_Descr *self, char newendian)
+
+
+returns a copy of the PyArray_Descr structure with the byteorder
+altered:
+no arguments:  The byteorder is swapped (in all subfields as well)
+single argument:  The byteorder is forced to the given state
+(in all subfields as well)
+
+Valid states:  ('big', '>') or ('little' or '<')
+('native', or '=')
+
+If a descr structure with | is encountered it's own
+byte-order is not changed but any fields are:
+
+
+Deep bytorder change of a data-type descriptor
+Leaves reference count of self unchanged --- does not DECREF self ***
+
+::
+
+  PyObject *
+  PyArray_IterAllButAxis(PyObject *obj, int *inaxis)
+
+Get Iterator that iterates over all but one axis (don't use this with
+PyArray_ITER_GOTO1D).  The axis will be over-written if negative
+with the axis having the smallest stride.
+
+::
+
+  PyObject *
+  PyArray_CheckFromAny(PyObject *op, PyArray_Descr *descr, int
+                       min_depth, int max_depth, int requires, PyObject
+                       *context)
+
+steals a reference to descr -- accepts NULL
+
+::
+
+  PyObject *
+  PyArray_FromArray(PyArrayObject *arr, PyArray_Descr *newtype, int
+                    flags)
+
+steals reference to newtype --- acc. NULL
+
+::
+
+  PyObject *
+  PyArray_FromInterface(PyObject *origin)
+
+
+::
+
+  PyObject *
+  PyArray_FromStructInterface(PyObject *input)
+
+
+::
+
+  PyObject *
+  PyArray_FromArrayAttr(PyObject *op, PyArray_Descr *typecode, PyObject
+                        *context)
+
+
+::
+
+  NPY_SCALARKIND
+  PyArray_ScalarKind(int typenum, PyArrayObject **arr)
+
+ScalarKind
+
+Returns the scalar kind of a type number, with an
+optional tweak based on the scalar value itself.
+If no scalar is provided, it returns INTPOS_SCALAR
+for both signed and unsigned integers, otherwise
+it checks the sign of any signed integer to choose
+INTNEG_SCALAR when appropriate.
+
+::
+
+  int
+  PyArray_CanCoerceScalar(int thistype, int neededtype, NPY_SCALARKIND
+                          scalar)
+
+
+Determines whether the data type 'thistype', with
+scalar kind 'scalar', can be coerced into 'neededtype'.
+
+::
+
+  PyObject *
+  PyArray_NewFlagsObject(PyObject *obj)
+
+
+Get New ArrayFlagsObject
+
+::
+
+  npy_bool
+  PyArray_CanCastScalar(PyTypeObject *from, PyTypeObject *to)
+
+See if array scalars can be cast.
+
+TODO: For NumPy 2.0, add a NPY_CASTING parameter.
+
+::
+
+  int
+  PyArray_CompareUCS4(npy_ucs4 const *s1, npy_ucs4 const *s2, size_t
+                      len)
+
+
+::
+
+  int
+  PyArray_RemoveSmallest(PyArrayMultiIterObject *multi)
+
+Adjusts previously broadcasted iterators so that the axis with
+the smallest sum of iterator strides is not iterated over.
+Returns dimension which is smallest in the range [0,multi->nd).
+A -1 is returned if multi->nd == 0.
+
+don't use with PyArray_ITER_GOTO1D because factors are not adjusted
+
+::
+
+  int
+  PyArray_ElementStrides(PyObject *obj)
+
+
+::
+
+  void
+  PyArray_Item_INCREF(char *data, PyArray_Descr *descr)
+
+XINCREF all objects in a single array item. This is complicated for
+structured datatypes where the position of objects needs to be extracted.
+The function is execute recursively for each nested field or subarrays dtype
+such as as `np.dtype([("field1", "O"), ("field2", "f,O", (3,2))])`
+
+::
+
+  void
+  PyArray_Item_XDECREF(char *data, PyArray_Descr *descr)
+
+
+XDECREF all objects in a single array item. This is complicated for
+structured datatypes where the position of objects needs to be extracted.
+The function is execute recursively for each nested field or subarrays dtype
+such as as `np.dtype([("field1", "O"), ("field2", "f,O", (3,2))])`
+
+::
+
+  PyObject *
+  PyArray_FieldNames(PyObject *fields)
+
+Return the tuple of ordered field names from a dictionary.
+
+::
+
+  PyObject *
+  PyArray_Transpose(PyArrayObject *ap, PyArray_Dims *permute)
+
+Return Transpose.
+
+::
+
+  PyObject *
+  PyArray_TakeFrom(PyArrayObject *self0, PyObject *indices0, int
+                   axis, PyArrayObject *out, NPY_CLIPMODE clipmode)
+
+Take
+
+::
+
+  PyObject *
+  PyArray_PutTo(PyArrayObject *self, PyObject*values0, PyObject
+                *indices0, NPY_CLIPMODE clipmode)
+
+Put values into an array
+
+::
+
+  PyObject *
+  PyArray_PutMask(PyArrayObject *self, PyObject*values0, PyObject*mask0)
+
+Put values into an array according to a mask.
+
+::
+
+  PyObject *
+  PyArray_Repeat(PyArrayObject *aop, PyObject *op, int axis)
+
+Repeat the array.
+
+::
+
+  PyObject *
+  PyArray_Choose(PyArrayObject *ip, PyObject *op, PyArrayObject
+                 *out, NPY_CLIPMODE clipmode)
+
+
+::
+
+  int
+  PyArray_Sort(PyArrayObject *op, int axis, NPY_SORTKIND which)
+
+Sort an array in-place
+
+::
+
+  PyObject *
+  PyArray_ArgSort(PyArrayObject *op, int axis, NPY_SORTKIND which)
+
+ArgSort an array
+
+::
+
+  PyObject *
+  PyArray_SearchSorted(PyArrayObject *op1, PyObject *op2, NPY_SEARCHSIDE
+                       side, PyObject *perm)
+
+
+Search the sorted array op1 for the location of the items in op2. The
+result is an array of indexes, one for each element in op2, such that if
+the item were to be inserted in op1 just before that index the array
+would still be in sorted order.
+
+Parameters
+----------
+op1 : PyArrayObject *
+Array to be searched, must be 1-D.
+op2 : PyObject *
+Array of items whose insertion indexes in op1 are wanted
+side : {NPY_SEARCHLEFT, NPY_SEARCHRIGHT}
+If NPY_SEARCHLEFT, return first valid insertion indexes
+If NPY_SEARCHRIGHT, return last valid insertion indexes
+perm : PyObject *
+Permutation array that sorts op1 (optional)
+
+Returns
+-------
+ret : PyObject *
+New reference to npy_intp array containing indexes where items in op2
+could be validly inserted into op1. NULL on error.
+
+Notes
+-----
+Binary search is used to find the indexes.
+
+::
+
+  PyObject *
+  PyArray_ArgMax(PyArrayObject *op, int axis, PyArrayObject *out)
+
+ArgMax
+
+::
+
+  PyObject *
+  PyArray_ArgMin(PyArrayObject *op, int axis, PyArrayObject *out)
+
+ArgMin
+
+::
+
+  PyObject *
+  PyArray_Reshape(PyArrayObject *self, PyObject *shape)
+
+Reshape
+
+::
+
+  PyObject *
+  PyArray_Newshape(PyArrayObject *self, PyArray_Dims *newdims, NPY_ORDER
+                   order)
+
+New shape for an array
+
+::
+
+  PyObject *
+  PyArray_Squeeze(PyArrayObject *self)
+
+
+return a new view of the array object with all of its unit-length
+dimensions squeezed out if needed, otherwise
+return the same array.
+
+::
+
+  PyObject *
+  PyArray_View(PyArrayObject *self, PyArray_Descr *type, PyTypeObject
+               *pytype)
+
+View
+steals a reference to type -- accepts NULL
+
+::
+
+  PyObject *
+  PyArray_SwapAxes(PyArrayObject *ap, int a1, int a2)
+
+SwapAxes
+
+::
+
+  PyObject *
+  PyArray_Max(PyArrayObject *ap, int axis, PyArrayObject *out)
+
+Max
+
+::
+
+  PyObject *
+  PyArray_Min(PyArrayObject *ap, int axis, PyArrayObject *out)
+
+Min
+
+::
+
+  PyObject *
+  PyArray_Ptp(PyArrayObject *ap, int axis, PyArrayObject *out)
+
+Ptp
+
+::
+
+  PyObject *
+  PyArray_Mean(PyArrayObject *self, int axis, int rtype, PyArrayObject
+               *out)
+
+Mean
+
+::
+
+  PyObject *
+  PyArray_Trace(PyArrayObject *self, int offset, int axis1, int
+                axis2, int rtype, PyArrayObject *out)
+
+Trace
+
+::
+
+  PyObject *
+  PyArray_Diagonal(PyArrayObject *self, int offset, int axis1, int
+                   axis2)
+
+Diagonal
+
+In NumPy versions prior to 1.7,  this function always returned a copy of
+the diagonal array. In 1.7, the code has been updated to compute a view
+onto 'self', but it still copies this array before returning, as well as
+setting the internal WARN_ON_WRITE flag. In a future version, it will
+simply return a view onto self.
+
+::
+
+  PyObject *
+  PyArray_Clip(PyArrayObject *self, PyObject *min, PyObject
+               *max, PyArrayObject *out)
+
+Clip
+
+::
+
+  PyObject *
+  PyArray_Conjugate(PyArrayObject *self, PyArrayObject *out)
+
+Conjugate
+
+::
+
+  PyObject *
+  PyArray_Nonzero(PyArrayObject *self)
+
+Nonzero
+
+TODO: In NumPy 2.0, should make the iteration order a parameter.
+
+::
+
+  PyObject *
+  PyArray_Std(PyArrayObject *self, int axis, int rtype, PyArrayObject
+              *out, int variance)
+
+Set variance to 1 to by-pass square-root calculation and return variance
+Std
+
+::
+
+  PyObject *
+  PyArray_Sum(PyArrayObject *self, int axis, int rtype, PyArrayObject
+              *out)
+
+Sum
+
+::
+
+  PyObject *
+  PyArray_CumSum(PyArrayObject *self, int axis, int rtype, PyArrayObject
+                 *out)
+
+CumSum
+
+::
+
+  PyObject *
+  PyArray_Prod(PyArrayObject *self, int axis, int rtype, PyArrayObject
+               *out)
+
+Prod
+
+::
+
+  PyObject *
+  PyArray_CumProd(PyArrayObject *self, int axis, int
+                  rtype, PyArrayObject *out)
+
+CumProd
+
+::
+
+  PyObject *
+  PyArray_All(PyArrayObject *self, int axis, PyArrayObject *out)
+
+All
+
+::
+
+  PyObject *
+  PyArray_Any(PyArrayObject *self, int axis, PyArrayObject *out)
+
+Any
+
+::
+
+  PyObject *
+  PyArray_Compress(PyArrayObject *self, PyObject *condition, int
+                   axis, PyArrayObject *out)
+
+Compress
+
+::
+
+  PyObject *
+  PyArray_Flatten(PyArrayObject *a, NPY_ORDER order)
+
+Flatten
+
+::
+
+  PyObject *
+  PyArray_Ravel(PyArrayObject *arr, NPY_ORDER order)
+
+Ravel
+Returns a contiguous array
+
+::
+
+  npy_intp
+  PyArray_MultiplyList(npy_intp const *l1, int n)
+
+Multiply a List
+
+::
+
+  int
+  PyArray_MultiplyIntList(int const *l1, int n)
+
+Multiply a List of ints
+
+::
+
+  void *
+  PyArray_GetPtr(PyArrayObject *obj, npy_intp const*ind)
+
+Produce a pointer into array
+
+::
+
+  int
+  PyArray_CompareLists(npy_intp const *l1, npy_intp const *l2, int n)
+
+Compare Lists
+
+::
+
+  int
+  PyArray_AsCArray(PyObject **op, void *ptr, npy_intp *dims, int
+                   nd, PyArray_Descr*typedescr)
+
+Simulate a C-array
+steals a reference to typedescr -- can be NULL
+
+::
+
+  int
+  PyArray_As1D(PyObject **NPY_UNUSED(op) , char **NPY_UNUSED(ptr) , int
+               *NPY_UNUSED(d1) , int NPY_UNUSED(typecode) )
+
+Convert to a 1D C-array
+
+::
+
+  int
+  PyArray_As2D(PyObject **NPY_UNUSED(op) , char ***NPY_UNUSED(ptr) , int
+               *NPY_UNUSED(d1) , int *NPY_UNUSED(d2) , int
+               NPY_UNUSED(typecode) )
+
+Convert to a 2D C-array
+
+::
+
+  int
+  PyArray_Free(PyObject *op, void *ptr)
+
+Free pointers created if As2D is called
+
+::
+
+  int
+  PyArray_Converter(PyObject *object, PyObject **address)
+
+
+Useful to pass as converter function for O& processing in PyArgs_ParseTuple.
+
+This conversion function can be used with the "O&" argument for
+PyArg_ParseTuple.  It will immediately return an object of array type
+or will convert to a NPY_ARRAY_CARRAY any other object.
+
+If you use PyArray_Converter, you must DECREF the array when finished
+as you get a new reference to it.
+
+::
+
+  int
+  PyArray_IntpFromSequence(PyObject *seq, npy_intp *vals, int maxvals)
+
+PyArray_IntpFromSequence
+Returns the number of integers converted or -1 if an error occurred.
+vals must be large enough to hold maxvals
+
+::
+
+  PyObject *
+  PyArray_Concatenate(PyObject *op, int axis)
+
+Concatenate
+
+Concatenate an arbitrary Python sequence into an array.
+op is a python object supporting the sequence interface.
+Its elements will be concatenated together to form a single
+multidimensional array. If axis is NPY_MAXDIMS or bigger, then
+each sequence object will be flattened before concatenation
+
+::
+
+  PyObject *
+  PyArray_InnerProduct(PyObject *op1, PyObject *op2)
+
+Numeric.innerproduct(a,v)
+
+::
+
+  PyObject *
+  PyArray_MatrixProduct(PyObject *op1, PyObject *op2)
+
+Numeric.matrixproduct(a,v)
+just like inner product but does the swapaxes stuff on the fly
+
+::
+
+  PyObject *
+  PyArray_CopyAndTranspose(PyObject *op)
+
+Copy and Transpose
+
+Could deprecate this function, as there isn't a speed benefit over
+calling Transpose and then Copy.
+
+::
+
+  PyObject *
+  PyArray_Correlate(PyObject *op1, PyObject *op2, int mode)
+
+Numeric.correlate(a1,a2,mode)
+
+::
+
+  int
+  PyArray_TypestrConvert(int itemsize, int gentype)
+
+Typestr converter
+
+::
+
+  int
+  PyArray_DescrConverter(PyObject *obj, PyArray_Descr **at)
+
+Get typenum from an object -- None goes to NPY_DEFAULT_TYPE
+This function takes a Python object representing a type and converts it
+to a the correct PyArray_Descr * structure to describe the type.
+
+Many objects can be used to represent a data-type which in NumPy is
+quite a flexible concept.
+
+This is the central code that converts Python objects to
+Type-descriptor objects that are used throughout numpy.
+
+Returns a new reference in *at, but the returned should not be
+modified as it may be one of the canonical immutable objects or
+a reference to the input obj.
+
+::
+
+  int
+  PyArray_DescrConverter2(PyObject *obj, PyArray_Descr **at)
+
+Get typenum from an object -- None goes to NULL
+
+::
+
+  int
+  PyArray_IntpConverter(PyObject *obj, PyArray_Dims *seq)
+
+Get intp chunk from sequence
+
+This function takes a Python sequence object and allocates and
+fills in an intp array with the converted values.
+
+Remember to free the pointer seq.ptr when done using
+PyDimMem_FREE(seq.ptr)**
+
+::
+
+  int
+  PyArray_BufferConverter(PyObject *obj, PyArray_Chunk *buf)
+
+Get buffer chunk from object
+
+this function takes a Python object which exposes the (single-segment)
+buffer interface and returns a pointer to the data segment
+
+You should increment the reference count by one of buf->base
+if you will hang on to a reference
+
+You only get a borrowed reference to the object. Do not free the
+memory...
+
+::
+
+  int
+  PyArray_AxisConverter(PyObject *obj, int *axis)
+
+Get axis from an object (possibly None) -- a converter function,
+
+See also PyArray_ConvertMultiAxis, which also handles a tuple of axes.
+
+::
+
+  int
+  PyArray_BoolConverter(PyObject *object, npy_bool *val)
+
+Convert an object to true / false
+
+::
+
+  int
+  PyArray_ByteorderConverter(PyObject *obj, char *endian)
+
+Convert object to endian
+
+::
+
+  int
+  PyArray_OrderConverter(PyObject *object, NPY_ORDER *val)
+
+Convert an object to FORTRAN / C / ANY / KEEP
+
+::
+
+  unsigned char
+  PyArray_EquivTypes(PyArray_Descr *type1, PyArray_Descr *type2)
+
+
+This function returns true if the two typecodes are
+equivalent (same basic kind and same itemsize).
+
+::
+
+  PyObject *
+  PyArray_Zeros(int nd, npy_intp const *dims, PyArray_Descr *type, int
+                is_f_order)
+
+Zeros
+
+steals a reference to type. On failure or when dtype->subarray is
+true, dtype will be decrefed.
+accepts NULL type
+
+::
+
+  PyObject *
+  PyArray_Empty(int nd, npy_intp const *dims, PyArray_Descr *type, int
+                is_f_order)
+
+Empty
+
+accepts NULL type
+steals a reference to type
+
+::
+
+  PyObject *
+  PyArray_Where(PyObject *condition, PyObject *x, PyObject *y)
+
+Where
+
+::
+
+  PyObject *
+  PyArray_Arange(double start, double stop, double step, int type_num)
+
+Arange,
+
+::
+
+  PyObject *
+  PyArray_ArangeObj(PyObject *start, PyObject *stop, PyObject
+                    *step, PyArray_Descr *dtype)
+
+
+ArangeObj,
+
+this doesn't change the references
+
+::
+
+  int
+  PyArray_SortkindConverter(PyObject *obj, NPY_SORTKIND *sortkind)
+
+Convert object to sort kind
+
+::
+
+  PyObject *
+  PyArray_LexSort(PyObject *sort_keys, int axis)
+
+LexSort an array providing indices that will sort a collection of arrays
+lexicographically.  The first key is sorted on first, followed by the second key
+-- requires that arg"merge"sort is available for each sort_key
+
+Returns an index array that shows the indexes for the lexicographic sort along
+the given axis.
+
+::
+
+  PyObject *
+  PyArray_Round(PyArrayObject *a, int decimals, PyArrayObject *out)
+
+Round
+
+::
+
+  unsigned char
+  PyArray_EquivTypenums(int typenum1, int typenum2)
+
+
+::
+
+  int
+  PyArray_RegisterDataType(PyArray_Descr *descr)
+
+Register Data type
+Does not change the reference count of descr
+
+::
+
+  int
+  PyArray_RegisterCastFunc(PyArray_Descr *descr, int
+                           totype, PyArray_VectorUnaryFunc *castfunc)
+
+Register Casting Function
+Replaces any function currently stored.
+
+::
+
+  int
+  PyArray_RegisterCanCast(PyArray_Descr *descr, int
+                          totype, NPY_SCALARKIND scalar)
+
+Register a type number indicating that a descriptor can be cast
+to it safely
+
+::
+
+  void
+  PyArray_InitArrFuncs(PyArray_ArrFuncs *f)
+
+Initialize arrfuncs to NULL
+
+::
+
+  PyObject *
+  PyArray_IntTupleFromIntp(int len, npy_intp const *vals)
+
+PyArray_IntTupleFromIntp
+
+::
+
+  int
+  PyArray_TypeNumFromName(char const *str)
+
+
+::
+
+  int
+  PyArray_ClipmodeConverter(PyObject *object, NPY_CLIPMODE *val)
+
+Convert an object to NPY_RAISE / NPY_CLIP / NPY_WRAP
+
+::
+
+  int
+  PyArray_OutputConverter(PyObject *object, PyArrayObject **address)
+
+Useful to pass as converter function for O& processing in
+PyArgs_ParseTuple for output arrays
+
+::
+
+  PyObject *
+  PyArray_BroadcastToShape(PyObject *obj, npy_intp *dims, int nd)
+
+Get Iterator broadcast to a particular shape
+
+::
+
+  void
+  _PyArray_SigintHandler(int signum)
+
+
+::
+
+  void*
+  _PyArray_GetSigintBuf(void )
+
+
+::
+
+  int
+  PyArray_DescrAlignConverter(PyObject *obj, PyArray_Descr **at)
+
+
+Get type-descriptor from an object forcing alignment if possible
+None goes to DEFAULT type.
+
+any object with the .fields attribute and/or .itemsize attribute (if the
+.fields attribute does not give the total size -- i.e. a partial record
+naming).  If itemsize is given it must be >= size computed from fields
+
+The .fields attribute must return a convertible dictionary if present.
+Result inherits from NPY_VOID.
+
+::
+
+  int
+  PyArray_DescrAlignConverter2(PyObject *obj, PyArray_Descr **at)
+
+
+Get type-descriptor from an object forcing alignment if possible
+None goes to NULL.
+
+::
+
+  int
+  PyArray_SearchsideConverter(PyObject *obj, void *addr)
+
+Convert object to searchsorted side
+
+::
+
+  PyObject *
+  PyArray_CheckAxis(PyArrayObject *arr, int *axis, int flags)
+
+PyArray_CheckAxis
+
+check that axis is valid
+convert 0-d arrays to 1-d arrays
+
+::
+
+  npy_intp
+  PyArray_OverflowMultiplyList(npy_intp const *l1, int n)
+
+Multiply a List of Non-negative numbers with over-flow detection.
+
+::
+
+  int
+  PyArray_CompareString(const char *s1, const char *s2, size_t len)
+
+
+::
+
+  PyObject*
+  PyArray_MultiIterFromObjects(PyObject **mps, int n, int nadd, ... )
+
+Get MultiIterator from array of Python objects and any additional
+
+PyObject **mps - array of PyObjects
+int n - number of PyObjects in the array
+int nadd - number of additional arrays to include in the iterator.
+
+Returns a multi-iterator object.
+
+::
+
+  int
+  PyArray_GetEndianness(void )
+
+
+::
+
+  unsigned int
+  PyArray_GetNDArrayCFeatureVersion(void )
+
+Returns the built-in (at compilation time) C API version
+
+::
+
+  PyObject *
+  PyArray_Correlate2(PyObject *op1, PyObject *op2, int mode)
+
+correlate(a1,a2,mode)
+
+This function computes the usual correlation (correlate(a1, a2) !=
+correlate(a2, a1), and conjugate the second argument for complex inputs
+
+::
+
+  PyObject*
+  PyArray_NeighborhoodIterNew(PyArrayIterObject *x, const npy_intp
+                              *bounds, int mode, PyArrayObject*fill)
+
+A Neighborhood Iterator object.
+
+::
+
+  void
+  PyArray_SetDatetimeParseFunction(PyObject *NPY_UNUSED(op) )
+
+This function is scheduled to be removed
+
+TO BE REMOVED - NOT USED INTERNALLY.
+
+::
+
+  void
+  PyArray_DatetimeToDatetimeStruct(npy_datetime NPY_UNUSED(val)
+                                   , NPY_DATETIMEUNIT NPY_UNUSED(fr)
+                                   , npy_datetimestruct *result)
+
+Fill the datetime struct from the value and resolution unit.
+
+TO BE REMOVED - NOT USED INTERNALLY.
+
+::
+
+  void
+  PyArray_TimedeltaToTimedeltaStruct(npy_timedelta NPY_UNUSED(val)
+                                     , NPY_DATETIMEUNIT NPY_UNUSED(fr)
+                                     , npy_timedeltastruct *result)
+
+Fill the timedelta struct from the timedelta value and resolution unit.
+
+TO BE REMOVED - NOT USED INTERNALLY.
+
+::
+
+  npy_datetime
+  PyArray_DatetimeStructToDatetime(NPY_DATETIMEUNIT NPY_UNUSED(fr)
+                                   , npy_datetimestruct *NPY_UNUSED(d) )
+
+Create a datetime value from a filled datetime struct and resolution unit.
+
+TO BE REMOVED - NOT USED INTERNALLY.
+
+::
+
+  npy_datetime
+  PyArray_TimedeltaStructToTimedelta(NPY_DATETIMEUNIT NPY_UNUSED(fr)
+                                     , npy_timedeltastruct
+                                     *NPY_UNUSED(d) )
+
+Create a timdelta value from a filled timedelta struct and resolution unit.
+
+TO BE REMOVED - NOT USED INTERNALLY.
+
+::
+
+  NpyIter *
+  NpyIter_New(PyArrayObject *op, npy_uint32 flags, NPY_ORDER
+              order, NPY_CASTING casting, PyArray_Descr*dtype)
+
+Allocate a new iterator for one array object.
+
+::
+
+  NpyIter *
+  NpyIter_MultiNew(int nop, PyArrayObject **op_in, npy_uint32
+                   flags, NPY_ORDER order, NPY_CASTING
+                   casting, npy_uint32 *op_flags, PyArray_Descr
+                   **op_request_dtypes)
+
+Allocate a new iterator for more than one array object, using
+standard NumPy broadcasting rules and the default buffer size.
+
+::
+
+  NpyIter *
+  NpyIter_AdvancedNew(int nop, PyArrayObject **op_in, npy_uint32
+                      flags, NPY_ORDER order, NPY_CASTING
+                      casting, npy_uint32 *op_flags, PyArray_Descr
+                      **op_request_dtypes, int oa_ndim, int
+                      **op_axes, npy_intp *itershape, npy_intp
+                      buffersize)
+
+Allocate a new iterator for multiple array objects, and advanced
+options for controlling the broadcasting, shape, and buffer size.
+
+::
+
+  NpyIter *
+  NpyIter_Copy(NpyIter *iter)
+
+Makes a copy of the iterator
+
+::
+
+  int
+  NpyIter_Deallocate(NpyIter *iter)
+
+Deallocate an iterator
+
+::
+
+  npy_bool
+  NpyIter_HasDelayedBufAlloc(NpyIter *iter)
+
+Whether the buffer allocation is being delayed
+
+::
+
+  npy_bool
+  NpyIter_HasExternalLoop(NpyIter *iter)
+
+Whether the iterator handles the inner loop
+
+::
+
+  int
+  NpyIter_EnableExternalLoop(NpyIter *iter)
+
+Removes the inner loop handling (so HasExternalLoop returns true)
+
+::
+
+  npy_intp *
+  NpyIter_GetInnerStrideArray(NpyIter *iter)
+
+Get the array of strides for the inner loop (when HasExternalLoop is true)
+
+This function may be safely called without holding the Python GIL.
+
+::
+
+  npy_intp *
+  NpyIter_GetInnerLoopSizePtr(NpyIter *iter)
+
+Get a pointer to the size of the inner loop  (when HasExternalLoop is true)
+
+This function may be safely called without holding the Python GIL.
+
+::
+
+  int
+  NpyIter_Reset(NpyIter *iter, char **errmsg)
+
+Resets the iterator to its initial state
+
+If errmsg is non-NULL, it should point to a variable which will
+receive the error message, and no Python exception will be set.
+This is so that the function can be called from code not holding
+the GIL.
+
+::
+
+  int
+  NpyIter_ResetBasePointers(NpyIter *iter, char **baseptrs, char
+                            **errmsg)
+
+Resets the iterator to its initial state, with new base data pointers.
+This function requires great caution.
+
+If errmsg is non-NULL, it should point to a variable which will
+receive the error message, and no Python exception will be set.
+This is so that the function can be called from code not holding
+the GIL.
+
+::
+
+  int
+  NpyIter_ResetToIterIndexRange(NpyIter *iter, npy_intp istart, npy_intp
+                                iend, char **errmsg)
+
+Resets the iterator to a new iterator index range
+
+If errmsg is non-NULL, it should point to a variable which will
+receive the error message, and no Python exception will be set.
+This is so that the function can be called from code not holding
+the GIL.
+
+::
+
+  int
+  NpyIter_GetNDim(NpyIter *iter)
+
+Gets the number of dimensions being iterated
+
+::
+
+  int
+  NpyIter_GetNOp(NpyIter *iter)
+
+Gets the number of operands being iterated
+
+::
+
+  NpyIter_IterNextFunc *
+  NpyIter_GetIterNext(NpyIter *iter, char **errmsg)
+
+Compute the specialized iteration function for an iterator
+
+If errmsg is non-NULL, it should point to a variable which will
+receive the error message, and no Python exception will be set.
+This is so that the function can be called from code not holding
+the GIL.
+
+::
+
+  npy_intp
+  NpyIter_GetIterSize(NpyIter *iter)
+
+Gets the number of elements being iterated
+
+::
+
+  void
+  NpyIter_GetIterIndexRange(NpyIter *iter, npy_intp *istart, npy_intp
+                            *iend)
+
+Gets the range of iteration indices being iterated
+
+::
+
+  npy_intp
+  NpyIter_GetIterIndex(NpyIter *iter)
+
+Gets the current iteration index
+
+::
+
+  int
+  NpyIter_GotoIterIndex(NpyIter *iter, npy_intp iterindex)
+
+Sets the iterator position to the specified iterindex,
+which matches the iteration order of the iterator.
+
+Returns NPY_SUCCEED on success, NPY_FAIL on failure.
+
+::
+
+  npy_bool
+  NpyIter_HasMultiIndex(NpyIter *iter)
+
+Whether the iterator is tracking a multi-index
+
+::
+
+  int
+  NpyIter_GetShape(NpyIter *iter, npy_intp *outshape)
+
+Gets the broadcast shape if a multi-index is being tracked by the iterator,
+otherwise gets the shape of the iteration as Fortran-order
+(fastest-changing index first).
+
+The reason Fortran-order is returned when a multi-index
+is not enabled is that this is providing a direct view into how
+the iterator traverses the n-dimensional space. The iterator organizes
+its memory from fastest index to slowest index, and when
+a multi-index is enabled, it uses a permutation to recover the original
+order.
+
+Returns NPY_SUCCEED or NPY_FAIL.
+
+::
+
+  NpyIter_GetMultiIndexFunc *
+  NpyIter_GetGetMultiIndex(NpyIter *iter, char **errmsg)
+
+Compute a specialized get_multi_index function for the iterator
+
+If errmsg is non-NULL, it should point to a variable which will
+receive the error message, and no Python exception will be set.
+This is so that the function can be called from code not holding
+the GIL.
+
+::
+
+  int
+  NpyIter_GotoMultiIndex(NpyIter *iter, npy_intp const *multi_index)
+
+Sets the iterator to the specified multi-index, which must have the
+correct number of entries for 'ndim'.  It is only valid
+when NPY_ITER_MULTI_INDEX was passed to the constructor.  This operation
+fails if the multi-index is out of bounds.
+
+Returns NPY_SUCCEED on success, NPY_FAIL on failure.
+
+::
+
+  int
+  NpyIter_RemoveMultiIndex(NpyIter *iter)
+
+Removes multi-index support from an iterator.
+
+Returns NPY_SUCCEED or NPY_FAIL.
+
+::
+
+  npy_bool
+  NpyIter_HasIndex(NpyIter *iter)
+
+Whether the iterator is tracking an index
+
+::
+
+  npy_bool
+  NpyIter_IsBuffered(NpyIter *iter)
+
+Whether the iterator is buffered
+
+::
+
+  npy_bool
+  NpyIter_IsGrowInner(NpyIter *iter)
+
+Whether the inner loop can grow if buffering is unneeded
+
+::
+
+  npy_intp
+  NpyIter_GetBufferSize(NpyIter *iter)
+
+Gets the size of the buffer, or 0 if buffering is not enabled
+
+::
+
+  npy_intp *
+  NpyIter_GetIndexPtr(NpyIter *iter)
+
+Get a pointer to the index, if it is being tracked
+
+::
+
+  int
+  NpyIter_GotoIndex(NpyIter *iter, npy_intp flat_index)
+
+If the iterator is tracking an index, sets the iterator
+to the specified index.
+
+Returns NPY_SUCCEED on success, NPY_FAIL on failure.
+
+::
+
+  char **
+  NpyIter_GetDataPtrArray(NpyIter *iter)
+
+Get the array of data pointers (1 per object being iterated)
+
+This function may be safely called without holding the Python GIL.
+
+::
+
+  PyArray_Descr **
+  NpyIter_GetDescrArray(NpyIter *iter)
+
+Get the array of data type pointers (1 per object being iterated)
+
+::
+
+  PyArrayObject **
+  NpyIter_GetOperandArray(NpyIter *iter)
+
+Get the array of objects being iterated
+
+::
+
+  PyArrayObject *
+  NpyIter_GetIterView(NpyIter *iter, npy_intp i)
+
+Returns a view to the i-th object with the iterator's internal axes
+
+::
+
+  void
+  NpyIter_GetReadFlags(NpyIter *iter, char *outreadflags)
+
+Gets an array of read flags (1 per object being iterated)
+
+::
+
+  void
+  NpyIter_GetWriteFlags(NpyIter *iter, char *outwriteflags)
+
+Gets an array of write flags (1 per object being iterated)
+
+::
+
+  void
+  NpyIter_DebugPrint(NpyIter *iter)
+
+For debugging
+
+::
+
+  npy_bool
+  NpyIter_IterationNeedsAPI(NpyIter *iter)
+
+Whether the iteration loop, and in particular the iternext()
+function, needs API access.  If this is true, the GIL must
+be retained while iterating.
+
+::
+
+  void
+  NpyIter_GetInnerFixedStrideArray(NpyIter *iter, npy_intp *out_strides)
+
+Get an array of strides which are fixed.  Any strides which may
+change during iteration receive the value NPY_MAX_INTP.  Once
+the iterator is ready to iterate, call this to get the strides
+which will always be fixed in the inner loop, then choose optimized
+inner loop functions which take advantage of those fixed strides.
+
+This function may be safely called without holding the Python GIL.
+
+::
+
+  int
+  NpyIter_RemoveAxis(NpyIter *iter, int axis)
+
+Removes an axis from iteration. This requires that NPY_ITER_MULTI_INDEX
+was set for iterator creation, and does not work if buffering is
+enabled. This function also resets the iterator to its initial state.
+
+Returns NPY_SUCCEED or NPY_FAIL.
+
+::
+
+  npy_intp *
+  NpyIter_GetAxisStrideArray(NpyIter *iter, int axis)
+
+Gets the array of strides for the specified axis.
+If the iterator is tracking a multi-index, gets the strides
+for the axis specified, otherwise gets the strides for
+the iteration axis as Fortran order (fastest-changing axis first).
+
+Returns NULL if an error occurs.
+
+::
+
+  npy_bool
+  NpyIter_RequiresBuffering(NpyIter *iter)
+
+Whether the iteration could be done with no buffering.
+
+::
+
+  char **
+  NpyIter_GetInitialDataPtrArray(NpyIter *iter)
+
+Get the array of data pointers (1 per object being iterated),
+directly into the arrays (never pointing to a buffer), for starting
+unbuffered iteration. This always returns the addresses for the
+iterator position as reset to iterator index 0.
+
+These pointers are different from the pointers accepted by
+NpyIter_ResetBasePointers, because the direction along some
+axes may have been reversed, requiring base offsets.
+
+This function may be safely called without holding the Python GIL.
+
+::
+
+  int
+  NpyIter_CreateCompatibleStrides(NpyIter *iter, npy_intp
+                                  itemsize, npy_intp *outstrides)
+
+Builds a set of strides which are the same as the strides of an
+output array created using the NPY_ITER_ALLOCATE flag, where NULL
+was passed for op_axes.  This is for data packed contiguously,
+but not necessarily in C or Fortran order. This should be used
+together with NpyIter_GetShape and NpyIter_GetNDim.
+
+A use case for this function is to match the shape and layout of
+the iterator and tack on one or more dimensions.  For example,
+in order to generate a vector per input value for a numerical gradient,
+you pass in ndim*itemsize for itemsize, then add another dimension to
+the end with size ndim and stride itemsize.  To do the Hessian matrix,
+you do the same thing but add two dimensions, or take advantage of
+the symmetry and pack it into 1 dimension with a particular encoding.
+
+This function may only be called if the iterator is tracking a multi-index
+and if NPY_ITER_DONT_NEGATE_STRIDES was used to prevent an axis from
+being iterated in reverse order.
+
+If an array is created with this method, simply adding 'itemsize'
+for each iteration will traverse the new array matching the
+iterator.
+
+Returns NPY_SUCCEED or NPY_FAIL.
+
+::
+
+  int
+  PyArray_CastingConverter(PyObject *obj, NPY_CASTING *casting)
+
+Convert any Python object, *obj*, to an NPY_CASTING enum.
+
+::
+
+  npy_intp
+  PyArray_CountNonzero(PyArrayObject *self)
+
+Counts the number of non-zero elements in the array.
+
+Returns -1 on error.
+
+::
+
+  PyArray_Descr *
+  PyArray_PromoteTypes(PyArray_Descr *type1, PyArray_Descr *type2)
+
+Produces the smallest size and lowest kind type to which both
+input types can be cast.
+
+::
+
+  PyArray_Descr *
+  PyArray_MinScalarType(PyArrayObject *arr)
+
+If arr is a scalar (has 0 dimensions) with a built-in number data type,
+finds the smallest type size/kind which can still represent its data.
+Otherwise, returns the array's data type.
+
+
+::
+
+  PyArray_Descr *
+  PyArray_ResultType(npy_intp narrs, PyArrayObject **arr, npy_intp
+                     ndtypes, PyArray_Descr **dtypes)
+
+Produces the result type of a bunch of inputs, using the UFunc
+type promotion rules. Use this function when you have a set of
+input arrays, and need to determine an output array dtype.
+
+If all the inputs are scalars (have 0 dimensions) or the maximum "kind"
+of the scalars is greater than the maximum "kind" of the arrays, does
+a regular type promotion.
+
+Otherwise, does a type promotion on the MinScalarType
+of all the inputs.  Data types passed directly are treated as array
+types.
+
+
+::
+
+  npy_bool
+  PyArray_CanCastArrayTo(PyArrayObject *arr, PyArray_Descr
+                         *to, NPY_CASTING casting)
+
+Returns 1 if the array object may be cast to the given data type using
+the casting rule, 0 otherwise.  This differs from PyArray_CanCastTo in
+that it handles scalar arrays (0 dimensions) specially, by checking
+their value.
+
+::
+
+  npy_bool
+  PyArray_CanCastTypeTo(PyArray_Descr *from, PyArray_Descr
+                        *to, NPY_CASTING casting)
+
+Returns true if data of type 'from' may be cast to data of type
+'to' according to the rule 'casting'.
+
+::
+
+  PyArrayObject *
+  PyArray_EinsteinSum(char *subscripts, npy_intp nop, PyArrayObject
+                      **op_in, PyArray_Descr *dtype, NPY_ORDER
+                      order, NPY_CASTING casting, PyArrayObject *out)
+
+This function provides summation of array elements according to
+the Einstein summation convention.  For example:
+- trace(a)        -> einsum("ii", a)
+- transpose(a)    -> einsum("ji", a)
+- multiply(a,b)   -> einsum(",", a, b)
+- inner(a,b)      -> einsum("i,i", a, b)
+- outer(a,b)      -> einsum("i,j", a, b)
+- matvec(a,b)     -> einsum("ij,j", a, b)
+- matmat(a,b)     -> einsum("ij,jk", a, b)
+
+subscripts: The string of subscripts for einstein summation.
+nop:        The number of operands
+op_in:      The array of operands
+dtype:      Either NULL, or the data type to force the calculation as.
+order:      The order for the calculation/the output axes.
+casting:    What kind of casts should be permitted.
+out:        Either NULL, or an array into which the output should be placed.
+
+By default, the labels get placed in alphabetical order
+at the end of the output. So, if c = einsum("i,j", a, b)
+then c[i,j] == a[i]*b[j], but if c = einsum("j,i", a, b)
+then c[i,j] = a[j]*b[i].
+
+Alternatively, you can control the output order or prevent
+an axis from being summed/force an axis to be summed by providing
+indices for the output. This allows us to turn 'trace' into
+'diag', for example.
+- diag(a)         -> einsum("ii->i", a)
+- sum(a, axis=0)  -> einsum("i...->", a)
+
+Subscripts at the beginning and end may be specified by
+putting an ellipsis "..." in the middle.  For example,
+the function einsum("i...i", a) takes the diagonal of
+the first and last dimensions of the operand, and
+einsum("ij...,jk...->ik...") takes the matrix product using
+the first two indices of each operand instead of the last two.
+
+When there is only one operand, no axes being summed, and
+no output parameter, this function returns a view
+into the operand instead of making a copy.
+
+::
+
+  PyObject *
+  PyArray_NewLikeArray(PyArrayObject *prototype, NPY_ORDER
+                       order, PyArray_Descr *dtype, int subok)
+
+Creates a new array with the same shape as the provided one,
+with possible memory layout order and data type changes.
+
+prototype - The array the new one should be like.
+order     - NPY_CORDER - C-contiguous result.
+NPY_FORTRANORDER - Fortran-contiguous result.
+NPY_ANYORDER - Fortran if prototype is Fortran, C otherwise.
+NPY_KEEPORDER - Keeps the axis ordering of prototype.
+dtype     - If not NULL, overrides the data type of the result.
+subok     - If 1, use the prototype's array subtype, otherwise
+always create a base-class array.
+
+NOTE: If dtype is not NULL, steals the dtype reference.  On failure or when
+dtype->subarray is true, dtype will be decrefed.
+
+::
+
+  int
+  PyArray_GetArrayParamsFromObject(PyObject *op, PyArray_Descr
+                                   *requested_dtype, npy_bool
+                                   writeable, PyArray_Descr
+                                   **out_dtype, int *out_ndim, npy_intp
+                                   *out_dims, PyArrayObject
+                                   **out_arr, PyObject *context)
+
+
+::
+
+  int
+  PyArray_ConvertClipmodeSequence(PyObject *object, NPY_CLIPMODE
+                                  *modes, int n)
+
+Convert an object to an array of n NPY_CLIPMODE values.
+This is intended to be used in functions where a different mode
+could be applied to each axis, like in ravel_multi_index.
+
+::
+
+  PyObject *
+  PyArray_MatrixProduct2(PyObject *op1, PyObject
+                         *op2, PyArrayObject*out)
+
+Numeric.matrixproduct2(a,v,out)
+just like inner product but does the swapaxes stuff on the fly
+
+::
+
+  npy_bool
+  NpyIter_IsFirstVisit(NpyIter *iter, int iop)
+
+Checks to see whether this is the first time the elements
+of the specified reduction operand which the iterator points at are
+being seen for the first time. The function returns
+a reasonable answer for reduction operands and when buffering is
+disabled. The answer may be incorrect for buffered non-reduction
+operands.
+
+This function is intended to be used in EXTERNAL_LOOP mode only,
+and will produce some wrong answers when that mode is not enabled.
+
+If this function returns true, the caller should also
+check the inner loop stride of the operand, because if
+that stride is 0, then only the first element of the innermost
+external loop is being visited for the first time.
+
+WARNING: For performance reasons, 'iop' is not bounds-checked,
+it is not confirmed that 'iop' is actually a reduction
+operand, and it is not confirmed that EXTERNAL_LOOP
+mode is enabled. These checks are the responsibility of
+the caller, and should be done outside of any inner loops.
+
+::
+
+  int
+  PyArray_SetBaseObject(PyArrayObject *arr, PyObject *obj)
+
+Sets the 'base' attribute of the array. This steals a reference
+to 'obj'.
+
+Returns 0 on success, -1 on failure.
+
+::
+
+  void
+  PyArray_CreateSortedStridePerm(int ndim, npy_intp const
+                                 *strides, npy_stride_sort_item
+                                 *out_strideperm)
+
+
+This function populates the first ndim elements
+of strideperm with sorted descending by their absolute values.
+For example, the stride array (4, -2, 12) becomes
+[(2, 12), (0, 4), (1, -2)].
+
+::
+
+  void
+  PyArray_RemoveAxesInPlace(PyArrayObject *arr, const npy_bool *flags)
+
+
+Removes the axes flagged as True from the array,
+modifying it in place. If an axis flagged for removal
+has a shape entry bigger than one, this effectively selects
+index zero for that axis.
+
+WARNING: If an axis flagged for removal has a shape equal to zero,
+the array will point to invalid memory. The caller must
+validate this!
+If an axis flagged for removal has a shape larger than one,
+the aligned flag (and in the future the contiguous flags),
+may need explicit update.
+(check also NPY_RELAXED_STRIDES_CHECKING)
+
+For example, this can be used to remove the reduction axes
+from a reduction result once its computation is complete.
+
+::
+
+  void
+  PyArray_DebugPrint(PyArrayObject *obj)
+
+Prints the raw data of the ndarray in a form useful for debugging
+low-level C issues.
+
+::
+
+  int
+  PyArray_FailUnlessWriteable(PyArrayObject *obj, const char *name)
+
+
+This function does nothing if obj is writeable, and raises an exception
+(and returns -1) if obj is not writeable. It may also do other
+house-keeping, such as issuing warnings on arrays which are transitioning
+to become views. Always call this function at some point before writing to
+an array.
+
+'name' is a name for the array, used to give better error
+messages. Something like "assignment destination", "output array", or even
+just "array".
+
+::
+
+  int
+  PyArray_SetUpdateIfCopyBase(PyArrayObject *arr, PyArrayObject *base)
+
+
+Precondition: 'arr' is a copy of 'base' (though possibly with different
+strides, ordering, etc.). This function sets the UPDATEIFCOPY flag and the
+->base pointer on 'arr', so that when 'arr' is destructed, it will copy any
+changes back to 'base'. DEPRECATED, use PyArray_SetWritebackIfCopyBase
+
+Steals a reference to 'base'.
+
+Returns 0 on success, -1 on failure.
+
+::
+
+  void *
+  PyDataMem_NEW(size_t size)
+
+Allocates memory for array data.
+
+::
+
+  void
+  PyDataMem_FREE(void *ptr)
+
+Free memory for array data.
+
+::
+
+  void *
+  PyDataMem_RENEW(void *ptr, size_t size)
+
+Reallocate/resize memory for array data.
+
+::
+
+  PyDataMem_EventHookFunc *
+  PyDataMem_SetEventHook(PyDataMem_EventHookFunc *newhook, void
+                         *user_data, void **old_data)
+
+Sets the allocation event hook for numpy array data.
+Takes a PyDataMem_EventHookFunc *, which has the signature:
+void hook(void *old, void *new, size_t size, void *user_data).
+Also takes a void *user_data, and void **old_data.
+
+Returns a pointer to the previous hook or NULL.  If old_data is
+non-NULL, the previous user_data pointer will be copied to it.
+
+If not NULL, hook will be called at the end of each PyDataMem_NEW/FREE/RENEW:
+result = PyDataMem_NEW(size)        -> (*hook)(NULL, result, size, user_data)
+PyDataMem_FREE(ptr)                 -> (*hook)(ptr, NULL, 0, user_data)
+result = PyDataMem_RENEW(ptr, size) -> (*hook)(ptr, result, size, user_data)
+
+When the hook is called, the GIL will be held by the calling
+thread.  The hook should be written to be reentrant, if it performs
+operations that might cause new allocation events (such as the
+creation/destruction numpy objects, or creating/destroying Python
+objects which might cause a gc)
+
+::
+
+  void
+  PyArray_MapIterSwapAxes(PyArrayMapIterObject *mit, PyArrayObject
+                          **ret, int getmap)
+
+
+::
+
+  PyObject *
+  PyArray_MapIterArray(PyArrayObject *a, PyObject *index)
+
+
+Use advanced indexing to iterate an array.
+
+::
+
+  void
+  PyArray_MapIterNext(PyArrayMapIterObject *mit)
+
+This function needs to update the state of the map iterator
+and point mit->dataptr to the memory-location of the next object
+
+Note that this function never handles an extra operand but provides
+compatibility for an old (exposed) API.
+
+::
+
+  int
+  PyArray_Partition(PyArrayObject *op, PyArrayObject *ktharray, int
+                    axis, NPY_SELECTKIND which)
+
+Partition an array in-place
+
+::
+
+  PyObject *
+  PyArray_ArgPartition(PyArrayObject *op, PyArrayObject *ktharray, int
+                       axis, NPY_SELECTKIND which)
+
+ArgPartition an array
+
+::
+
+  int
+  PyArray_SelectkindConverter(PyObject *obj, NPY_SELECTKIND *selectkind)
+
+Convert object to select kind
+
+::
+
+  void *
+  PyDataMem_NEW_ZEROED(size_t size, size_t elsize)
+
+Allocates zeroed memory for array data.
+
+::
+
+  int
+  PyArray_CheckAnyScalarExact(PyObject *obj)
+
+return true an object is exactly a numpy scalar
+
+::
+
+  PyObject *
+  PyArray_MapIterArrayCopyIfOverlap(PyArrayObject *a, PyObject
+                                    *index, int
+                                    copy_if_overlap, PyArrayObject
+                                    *extra_op)
+
+
+Same as PyArray_MapIterArray, but:
+
+If copy_if_overlap != 0, check if `a` has memory overlap with any of the
+arrays in `index` and with `extra_op`. If yes, make copies as appropriate
+to avoid problems if `a` is modified during the iteration.
+`iter->array` may contain a copied array (UPDATEIFCOPY/WRITEBACKIFCOPY set).
+
+::
+
+  int
+  PyArray_ResolveWritebackIfCopy(PyArrayObject *self)
+
+
+If WRITEBACKIFCOPY and self has data, reset the base WRITEABLE flag,
+copy the local data to base, release the local data, and set flags
+appropriately. Return 0 if not relevant, 1 if success, < 0 on failure
+
+::
+
+  int
+  PyArray_SetWritebackIfCopyBase(PyArrayObject *arr, PyArrayObject
+                                 *base)
+
+
+Precondition: 'arr' is a copy of 'base' (though possibly with different
+strides, ordering, etc.). This function sets the WRITEBACKIFCOPY flag and the
+->base pointer on 'arr', call PyArray_ResolveWritebackIfCopy to copy any
+changes back to 'base' before deallocating the array.
+
+Steals a reference to 'base'.
+
+Returns 0 on success, -1 on failure.
+
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/ndarrayobject.h b/venv/Lib/site-packages/numpy/core/include/numpy/ndarrayobject.h
new file mode 100644
index 000000000..5ef1f10aa
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/ndarrayobject.h
@@ -0,0 +1,268 @@
+/*
+ * DON'T INCLUDE THIS DIRECTLY.
+ */
+
+#ifndef NPY_NDARRAYOBJECT_H
+#define NPY_NDARRAYOBJECT_H
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <Python.h>
+#include "ndarraytypes.h"
+
+/* Includes the "function" C-API -- these are all stored in a
+   list of pointers --- one for each file
+   The two lists are concatenated into one in multiarray.
+
+   They are available as import_array()
+*/
+
+#include "__multiarray_api.h"
+
+
+/* C-API that requires previous API to be defined */
+
+#define PyArray_DescrCheck(op) PyObject_TypeCheck(op, &PyArrayDescr_Type)
+
+#define PyArray_Check(op) PyObject_TypeCheck(op, &PyArray_Type)
+#define PyArray_CheckExact(op) (((PyObject*)(op))->ob_type == &PyArray_Type)
+
+#define PyArray_HasArrayInterfaceType(op, type, context, out)                 \
+        ((((out)=PyArray_FromStructInterface(op)) != Py_NotImplemented) ||    \
+         (((out)=PyArray_FromInterface(op)) != Py_NotImplemented) ||          \
+         (((out)=PyArray_FromArrayAttr(op, type, context)) !=                 \
+          Py_NotImplemented))
+
+#define PyArray_HasArrayInterface(op, out)                                    \
+        PyArray_HasArrayInterfaceType(op, NULL, NULL, out)
+
+#define PyArray_IsZeroDim(op) (PyArray_Check(op) && \
+                               (PyArray_NDIM((PyArrayObject *)op) == 0))
+
+#define PyArray_IsScalar(obj, cls)                                            \
+        (PyObject_TypeCheck(obj, &Py##cls##ArrType_Type))
+
+#define PyArray_CheckScalar(m) (PyArray_IsScalar(m, Generic) ||               \
+                                PyArray_IsZeroDim(m))
+#define PyArray_IsPythonNumber(obj)                                           \
+        (PyFloat_Check(obj) || PyComplex_Check(obj) ||                        \
+         PyLong_Check(obj) || PyBool_Check(obj))
+#define PyArray_IsIntegerScalar(obj) (PyLong_Check(obj)                       \
+              || PyArray_IsScalar((obj), Integer))
+#define PyArray_IsPythonScalar(obj)                                           \
+        (PyArray_IsPythonNumber(obj) || PyBytes_Check(obj) ||                 \
+         PyUnicode_Check(obj))
+
+#define PyArray_IsAnyScalar(obj)                                              \
+        (PyArray_IsScalar(obj, Generic) || PyArray_IsPythonScalar(obj))
+
+#define PyArray_CheckAnyScalar(obj) (PyArray_IsPythonScalar(obj) ||           \
+                                     PyArray_CheckScalar(obj))
+
+
+#define PyArray_GETCONTIGUOUS(m) (PyArray_ISCONTIGUOUS(m) ?                   \
+                                  Py_INCREF(m), (m) :                         \
+                                  (PyArrayObject *)(PyArray_Copy(m)))
+
+#define PyArray_SAMESHAPE(a1,a2) ((PyArray_NDIM(a1) == PyArray_NDIM(a2)) &&   \
+                                  PyArray_CompareLists(PyArray_DIMS(a1),      \
+                                                       PyArray_DIMS(a2),      \
+                                                       PyArray_NDIM(a1)))
+
+#define PyArray_SIZE(m) PyArray_MultiplyList(PyArray_DIMS(m), PyArray_NDIM(m))
+#define PyArray_NBYTES(m) (PyArray_ITEMSIZE(m) * PyArray_SIZE(m))
+#define PyArray_FROM_O(m) PyArray_FromAny(m, NULL, 0, 0, 0, NULL)
+
+#define PyArray_FROM_OF(m,flags) PyArray_CheckFromAny(m, NULL, 0, 0, flags,   \
+                                                      NULL)
+
+#define PyArray_FROM_OT(m,type) PyArray_FromAny(m,                            \
+                                PyArray_DescrFromType(type), 0, 0, 0, NULL)
+
+#define PyArray_FROM_OTF(m, type, flags) \
+        PyArray_FromAny(m, PyArray_DescrFromType(type), 0, 0, \
+                        (((flags) & NPY_ARRAY_ENSURECOPY) ? \
+                         ((flags) | NPY_ARRAY_DEFAULT) : (flags)), NULL)
+
+#define PyArray_FROMANY(m, type, min, max, flags) \
+        PyArray_FromAny(m, PyArray_DescrFromType(type), min, max, \
+                        (((flags) & NPY_ARRAY_ENSURECOPY) ? \
+                         (flags) | NPY_ARRAY_DEFAULT : (flags)), NULL)
+
+#define PyArray_ZEROS(m, dims, type, is_f_order) \
+        PyArray_Zeros(m, dims, PyArray_DescrFromType(type), is_f_order)
+
+#define PyArray_EMPTY(m, dims, type, is_f_order) \
+        PyArray_Empty(m, dims, PyArray_DescrFromType(type), is_f_order)
+
+#define PyArray_FILLWBYTE(obj, val) memset(PyArray_DATA(obj), val, \
+                                           PyArray_NBYTES(obj))
+#ifndef PYPY_VERSION
+#define PyArray_REFCOUNT(obj) (((PyObject *)(obj))->ob_refcnt)
+#define NPY_REFCOUNT PyArray_REFCOUNT
+#endif
+#define NPY_MAX_ELSIZE (2 * NPY_SIZEOF_LONGDOUBLE)
+
+#define PyArray_ContiguousFromAny(op, type, min_depth, max_depth) \
+        PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
+                              max_depth, NPY_ARRAY_DEFAULT, NULL)
+
+#define PyArray_EquivArrTypes(a1, a2) \
+        PyArray_EquivTypes(PyArray_DESCR(a1), PyArray_DESCR(a2))
+
+#define PyArray_EquivByteorders(b1, b2) \
+        (((b1) == (b2)) || (PyArray_ISNBO(b1) == PyArray_ISNBO(b2)))
+
+#define PyArray_SimpleNew(nd, dims, typenum) \
+        PyArray_New(&PyArray_Type, nd, dims, typenum, NULL, NULL, 0, 0, NULL)
+
+#define PyArray_SimpleNewFromData(nd, dims, typenum, data) \
+        PyArray_New(&PyArray_Type, nd, dims, typenum, NULL, \
+                    data, 0, NPY_ARRAY_CARRAY, NULL)
+
+#define PyArray_SimpleNewFromDescr(nd, dims, descr) \
+        PyArray_NewFromDescr(&PyArray_Type, descr, nd, dims, \
+                             NULL, NULL, 0, NULL)
+
+#define PyArray_ToScalar(data, arr) \
+        PyArray_Scalar(data, PyArray_DESCR(arr), (PyObject *)arr)
+
+
+/* These might be faster without the dereferencing of obj
+   going on inside -- of course an optimizing compiler should
+   inline the constants inside a for loop making it a moot point
+*/
+
+#define PyArray_GETPTR1(obj, i) ((void *)(PyArray_BYTES(obj) + \
+                                         (i)*PyArray_STRIDES(obj)[0]))
+
+#define PyArray_GETPTR2(obj, i, j) ((void *)(PyArray_BYTES(obj) + \
+                                            (i)*PyArray_STRIDES(obj)[0] + \
+                                            (j)*PyArray_STRIDES(obj)[1]))
+
+#define PyArray_GETPTR3(obj, i, j, k) ((void *)(PyArray_BYTES(obj) + \
+                                            (i)*PyArray_STRIDES(obj)[0] + \
+                                            (j)*PyArray_STRIDES(obj)[1] + \
+                                            (k)*PyArray_STRIDES(obj)[2]))
+
+#define PyArray_GETPTR4(obj, i, j, k, l) ((void *)(PyArray_BYTES(obj) + \
+                                            (i)*PyArray_STRIDES(obj)[0] + \
+                                            (j)*PyArray_STRIDES(obj)[1] + \
+                                            (k)*PyArray_STRIDES(obj)[2] + \
+                                            (l)*PyArray_STRIDES(obj)[3]))
+
+/* Move to arrayobject.c once PyArray_XDECREF_ERR is removed */
+static NPY_INLINE void
+PyArray_DiscardWritebackIfCopy(PyArrayObject *arr)
+{
+    PyArrayObject_fields *fa = (PyArrayObject_fields *)arr;
+    if (fa && fa->base) {
+        if ((fa->flags & NPY_ARRAY_UPDATEIFCOPY) ||
+                (fa->flags & NPY_ARRAY_WRITEBACKIFCOPY)) {
+            PyArray_ENABLEFLAGS((PyArrayObject*)fa->base, NPY_ARRAY_WRITEABLE);
+            Py_DECREF(fa->base);
+            fa->base = NULL;
+            PyArray_CLEARFLAGS(arr, NPY_ARRAY_WRITEBACKIFCOPY);
+            PyArray_CLEARFLAGS(arr, NPY_ARRAY_UPDATEIFCOPY);
+        }
+    }
+}
+
+#define PyArray_DESCR_REPLACE(descr) do { \
+                PyArray_Descr *_new_; \
+                _new_ = PyArray_DescrNew(descr); \
+                Py_XDECREF(descr); \
+                descr = _new_; \
+        } while(0)
+
+/* Copy should always return contiguous array */
+#define PyArray_Copy(obj) PyArray_NewCopy(obj, NPY_CORDER)
+
+#define PyArray_FromObject(op, type, min_depth, max_depth) \
+        PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
+                              max_depth, NPY_ARRAY_BEHAVED | \
+                                         NPY_ARRAY_ENSUREARRAY, NULL)
+
+#define PyArray_ContiguousFromObject(op, type, min_depth, max_depth) \
+        PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
+                              max_depth, NPY_ARRAY_DEFAULT | \
+                                         NPY_ARRAY_ENSUREARRAY, NULL)
+
+#define PyArray_CopyFromObject(op, type, min_depth, max_depth) \
+        PyArray_FromAny(op, PyArray_DescrFromType(type), min_depth, \
+                        max_depth, NPY_ARRAY_ENSURECOPY | \
+                                   NPY_ARRAY_DEFAULT | \
+                                   NPY_ARRAY_ENSUREARRAY, NULL)
+
+#define PyArray_Cast(mp, type_num)                                            \
+        PyArray_CastToType(mp, PyArray_DescrFromType(type_num), 0)
+
+#define PyArray_Take(ap, items, axis)                                         \
+        PyArray_TakeFrom(ap, items, axis, NULL, NPY_RAISE)
+
+#define PyArray_Put(ap, items, values)                                        \
+        PyArray_PutTo(ap, items, values, NPY_RAISE)
+
+/* Compatibility with old Numeric stuff -- don't use in new code */
+
+#define PyArray_FromDimsAndData(nd, d, type, data)                            \
+        PyArray_FromDimsAndDataAndDescr(nd, d, PyArray_DescrFromType(type),   \
+                                        data)
+
+
+/*
+   Check to see if this key in the dictionary is the "title"
+   entry of the tuple (i.e. a duplicate dictionary entry in the fields
+   dict).
+*/
+
+static NPY_INLINE int
+NPY_TITLE_KEY_check(PyObject *key, PyObject *value)
+{
+    PyObject *title;
+    if (PyTuple_Size(value) != 3) {
+        return 0;
+    }
+    title = PyTuple_GetItem(value, 2);
+    if (key == title) {
+        return 1;
+    }
+#ifdef PYPY_VERSION
+    /*
+     * On PyPy, dictionary keys do not always preserve object identity.
+     * Fall back to comparison by value.
+     */
+    if (PyUnicode_Check(title) && PyUnicode_Check(key)) {
+        return PyUnicode_Compare(title, key) == 0 ? 1 : 0;
+    }
+#endif
+    return 0;
+}
+
+/* Macro, for backward compat with "if NPY_TITLE_KEY(key, value) { ..." */
+#define NPY_TITLE_KEY(key, value) (NPY_TITLE_KEY_check((key), (value)))
+
+#define DEPRECATE(msg) PyErr_WarnEx(PyExc_DeprecationWarning,msg,1)
+#define DEPRECATE_FUTUREWARNING(msg) PyErr_WarnEx(PyExc_FutureWarning,msg,1)
+
+#if !defined(NPY_NO_DEPRECATED_API) || \
+    (NPY_NO_DEPRECATED_API < NPY_1_14_API_VERSION)
+static NPY_INLINE void
+PyArray_XDECREF_ERR(PyArrayObject *arr)
+{
+    /* 2017-Nov-10 1.14 */
+    DEPRECATE("PyArray_XDECREF_ERR is deprecated, call "
+        "PyArray_DiscardWritebackIfCopy then Py_XDECREF instead");
+    PyArray_DiscardWritebackIfCopy(arr);
+    Py_XDECREF(arr);
+}
+#endif
+
+
+#ifdef __cplusplus
+}
+#endif
+
+
+#endif /* NPY_NDARRAYOBJECT_H */
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/ndarraytypes.h b/venv/Lib/site-packages/numpy/core/include/numpy/ndarraytypes.h
new file mode 100644
index 000000000..5b7e8952e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/ndarraytypes.h
@@ -0,0 +1,1838 @@
+#ifndef NDARRAYTYPES_H
+#define NDARRAYTYPES_H
+
+#include "npy_common.h"
+#include "npy_endian.h"
+#include "npy_cpu.h"
+#include "utils.h"
+
+#define NPY_NO_EXPORT NPY_VISIBILITY_HIDDEN
+
+/* Only use thread if configured in config and python supports it */
+#if defined WITH_THREAD && !NPY_NO_SMP
+        #define NPY_ALLOW_THREADS 1
+#else
+        #define NPY_ALLOW_THREADS 0
+#endif
+
+#ifndef __has_extension
+#define __has_extension(x) 0
+#endif
+
+#if !defined(_NPY_NO_DEPRECATIONS) && \
+    ((defined(__GNUC__)&& __GNUC__ >= 6) || \
+     __has_extension(attribute_deprecated_with_message))
+#define NPY_ATTR_DEPRECATE(text) __attribute__ ((deprecated (text)))
+#else
+#define NPY_ATTR_DEPRECATE(text)
+#endif
+
+/*
+ * There are several places in the code where an array of dimensions
+ * is allocated statically.  This is the size of that static
+ * allocation.
+ *
+ * The array creation itself could have arbitrary dimensions but all
+ * the places where static allocation is used would need to be changed
+ * to dynamic (including inside of several structures)
+ */
+
+#define NPY_MAXDIMS 32
+#define NPY_MAXARGS 32
+
+/* Used for Converter Functions "O&" code in ParseTuple */
+#define NPY_FAIL 0
+#define NPY_SUCCEED 1
+
+/*
+ * Binary compatibility version number.  This number is increased
+ * whenever the C-API is changed such that binary compatibility is
+ * broken, i.e. whenever a recompile of extension modules is needed.
+ */
+#define NPY_VERSION NPY_ABI_VERSION
+
+/*
+ * Minor API version.  This number is increased whenever a change is
+ * made to the C-API -- whether it breaks binary compatibility or not.
+ * Some changes, such as adding a function pointer to the end of the
+ * function table, can be made without breaking binary compatibility.
+ * In this case, only the NPY_FEATURE_VERSION (*not* NPY_VERSION)
+ * would be increased.  Whenever binary compatibility is broken, both
+ * NPY_VERSION and NPY_FEATURE_VERSION should be increased.
+ */
+#define NPY_FEATURE_VERSION NPY_API_VERSION
+
+enum NPY_TYPES {    NPY_BOOL=0,
+                    NPY_BYTE, NPY_UBYTE,
+                    NPY_SHORT, NPY_USHORT,
+                    NPY_INT, NPY_UINT,
+                    NPY_LONG, NPY_ULONG,
+                    NPY_LONGLONG, NPY_ULONGLONG,
+                    NPY_FLOAT, NPY_DOUBLE, NPY_LONGDOUBLE,
+                    NPY_CFLOAT, NPY_CDOUBLE, NPY_CLONGDOUBLE,
+                    NPY_OBJECT=17,
+                    NPY_STRING, NPY_UNICODE,
+                    NPY_VOID,
+                    /*
+                     * New 1.6 types appended, may be integrated
+                     * into the above in 2.0.
+                     */
+                    NPY_DATETIME, NPY_TIMEDELTA, NPY_HALF,
+
+                    NPY_NTYPES,
+                    NPY_NOTYPE,
+                    NPY_CHAR NPY_ATTR_DEPRECATE("Use NPY_STRING"),
+                    NPY_USERDEF=256,  /* leave room for characters */
+
+                    /* The number of types not including the new 1.6 types */
+                    NPY_NTYPES_ABI_COMPATIBLE=21
+};
+#ifdef _MSC_VER
+#pragma deprecated(NPY_CHAR)
+#endif
+
+/* basetype array priority */
+#define NPY_PRIORITY 0.0
+
+/* default subtype priority */
+#define NPY_SUBTYPE_PRIORITY 1.0
+
+/* default scalar priority */
+#define NPY_SCALAR_PRIORITY -1000000.0
+
+/* How many floating point types are there (excluding half) */
+#define NPY_NUM_FLOATTYPE 3
+
+/*
+ * These characters correspond to the array type and the struct
+ * module
+ */
+
+enum NPY_TYPECHAR {
+        NPY_BOOLLTR = '?',
+        NPY_BYTELTR = 'b',
+        NPY_UBYTELTR = 'B',
+        NPY_SHORTLTR = 'h',
+        NPY_USHORTLTR = 'H',
+        NPY_INTLTR = 'i',
+        NPY_UINTLTR = 'I',
+        NPY_LONGLTR = 'l',
+        NPY_ULONGLTR = 'L',
+        NPY_LONGLONGLTR = 'q',
+        NPY_ULONGLONGLTR = 'Q',
+        NPY_HALFLTR = 'e',
+        NPY_FLOATLTR = 'f',
+        NPY_DOUBLELTR = 'd',
+        NPY_LONGDOUBLELTR = 'g',
+        NPY_CFLOATLTR = 'F',
+        NPY_CDOUBLELTR = 'D',
+        NPY_CLONGDOUBLELTR = 'G',
+        NPY_OBJECTLTR = 'O',
+        NPY_STRINGLTR = 'S',
+        NPY_STRINGLTR2 = 'a',
+        NPY_UNICODELTR = 'U',
+        NPY_VOIDLTR = 'V',
+        NPY_DATETIMELTR = 'M',
+        NPY_TIMEDELTALTR = 'm',
+        NPY_CHARLTR = 'c',
+
+        /*
+         * No Descriptor, just a define -- this let's
+         * Python users specify an array of integers
+         * large enough to hold a pointer on the
+         * platform
+         */
+        NPY_INTPLTR = 'p',
+        NPY_UINTPLTR = 'P',
+
+        /*
+         * These are for dtype 'kinds', not dtype 'typecodes'
+         * as the above are for.
+         */
+        NPY_GENBOOLLTR ='b',
+        NPY_SIGNEDLTR = 'i',
+        NPY_UNSIGNEDLTR = 'u',
+        NPY_FLOATINGLTR = 'f',
+        NPY_COMPLEXLTR = 'c'
+};
+
+/*
+ * Changing this may break Numpy API compatibility
+ * due to changing offsets in PyArray_ArrFuncs, so be
+ * careful. Here we have reused the mergesort slot for
+ * any kind of stable sort, the actual implementation will
+ * depend on the data type.
+ */
+typedef enum {
+        NPY_QUICKSORT=0,
+        NPY_HEAPSORT=1,
+        NPY_MERGESORT=2,
+        NPY_STABLESORT=2,
+} NPY_SORTKIND;
+#define NPY_NSORTS (NPY_STABLESORT + 1)
+
+
+typedef enum {
+        NPY_INTROSELECT=0
+} NPY_SELECTKIND;
+#define NPY_NSELECTS (NPY_INTROSELECT + 1)
+
+
+typedef enum {
+        NPY_SEARCHLEFT=0,
+        NPY_SEARCHRIGHT=1
+} NPY_SEARCHSIDE;
+#define NPY_NSEARCHSIDES (NPY_SEARCHRIGHT + 1)
+
+
+typedef enum {
+        NPY_NOSCALAR=-1,
+        NPY_BOOL_SCALAR,
+        NPY_INTPOS_SCALAR,
+        NPY_INTNEG_SCALAR,
+        NPY_FLOAT_SCALAR,
+        NPY_COMPLEX_SCALAR,
+        NPY_OBJECT_SCALAR
+} NPY_SCALARKIND;
+#define NPY_NSCALARKINDS (NPY_OBJECT_SCALAR + 1)
+
+/* For specifying array memory layout or iteration order */
+typedef enum {
+        /* Fortran order if inputs are all Fortran, C otherwise */
+        NPY_ANYORDER=-1,
+        /* C order */
+        NPY_CORDER=0,
+        /* Fortran order */
+        NPY_FORTRANORDER=1,
+        /* An order as close to the inputs as possible */
+        NPY_KEEPORDER=2
+} NPY_ORDER;
+
+/* For specifying allowed casting in operations which support it */
+typedef enum {
+        /* Only allow identical types */
+        NPY_NO_CASTING=0,
+        /* Allow identical and byte swapped types */
+        NPY_EQUIV_CASTING=1,
+        /* Only allow safe casts */
+        NPY_SAFE_CASTING=2,
+        /* Allow safe casts or casts within the same kind */
+        NPY_SAME_KIND_CASTING=3,
+        /* Allow any casts */
+        NPY_UNSAFE_CASTING=4
+} NPY_CASTING;
+
+typedef enum {
+        NPY_CLIP=0,
+        NPY_WRAP=1,
+        NPY_RAISE=2
+} NPY_CLIPMODE;
+
+/* The special not-a-time (NaT) value */
+#define NPY_DATETIME_NAT NPY_MIN_INT64
+
+/*
+ * Upper bound on the length of a DATETIME ISO 8601 string
+ *   YEAR: 21 (64-bit year)
+ *   MONTH: 3
+ *   DAY: 3
+ *   HOURS: 3
+ *   MINUTES: 3
+ *   SECONDS: 3
+ *   ATTOSECONDS: 1 + 3*6
+ *   TIMEZONE: 5
+ *   NULL TERMINATOR: 1
+ */
+#define NPY_DATETIME_MAX_ISO8601_STRLEN (21 + 3*5 + 1 + 3*6 + 6 + 1)
+
+/* The FR in the unit names stands for frequency */
+typedef enum {
+        /* Force signed enum type, must be -1 for code compatibility */
+        NPY_FR_ERROR = -1,      /* error or undetermined */
+
+        /* Start of valid units */
+        NPY_FR_Y = 0,           /* Years */
+        NPY_FR_M = 1,           /* Months */
+        NPY_FR_W = 2,           /* Weeks */
+        /* Gap where 1.6 NPY_FR_B (value 3) was */
+        NPY_FR_D = 4,           /* Days */
+        NPY_FR_h = 5,           /* hours */
+        NPY_FR_m = 6,           /* minutes */
+        NPY_FR_s = 7,           /* seconds */
+        NPY_FR_ms = 8,          /* milliseconds */
+        NPY_FR_us = 9,          /* microseconds */
+        NPY_FR_ns = 10,         /* nanoseconds */
+        NPY_FR_ps = 11,         /* picoseconds */
+        NPY_FR_fs = 12,         /* femtoseconds */
+        NPY_FR_as = 13,         /* attoseconds */
+        NPY_FR_GENERIC = 14     /* unbound units, can convert to anything */
+} NPY_DATETIMEUNIT;
+
+/*
+ * NOTE: With the NPY_FR_B gap for 1.6 ABI compatibility, NPY_DATETIME_NUMUNITS
+ * is technically one more than the actual number of units.
+ */
+#define NPY_DATETIME_NUMUNITS (NPY_FR_GENERIC + 1)
+#define NPY_DATETIME_DEFAULTUNIT NPY_FR_GENERIC
+
+/*
+ * Business day conventions for mapping invalid business
+ * days to valid business days.
+ */
+typedef enum {
+    /* Go forward in time to the following business day. */
+    NPY_BUSDAY_FORWARD,
+    NPY_BUSDAY_FOLLOWING = NPY_BUSDAY_FORWARD,
+    /* Go backward in time to the preceding business day. */
+    NPY_BUSDAY_BACKWARD,
+    NPY_BUSDAY_PRECEDING = NPY_BUSDAY_BACKWARD,
+    /*
+     * Go forward in time to the following business day, unless it
+     * crosses a month boundary, in which case go backward
+     */
+    NPY_BUSDAY_MODIFIEDFOLLOWING,
+    /*
+     * Go backward in time to the preceding business day, unless it
+     * crosses a month boundary, in which case go forward.
+     */
+    NPY_BUSDAY_MODIFIEDPRECEDING,
+    /* Produce a NaT for non-business days. */
+    NPY_BUSDAY_NAT,
+    /* Raise an exception for non-business days. */
+    NPY_BUSDAY_RAISE
+} NPY_BUSDAY_ROLL;
+
+/************************************************************
+ * NumPy Auxiliary Data for inner loops, sort functions, etc.
+ ************************************************************/
+
+/*
+ * When creating an auxiliary data struct, this should always appear
+ * as the first member, like this:
+ *
+ * typedef struct {
+ *     NpyAuxData base;
+ *     double constant;
+ * } constant_multiplier_aux_data;
+ */
+typedef struct NpyAuxData_tag NpyAuxData;
+
+/* Function pointers for freeing or cloning auxiliary data */
+typedef void (NpyAuxData_FreeFunc) (NpyAuxData *);
+typedef NpyAuxData *(NpyAuxData_CloneFunc) (NpyAuxData *);
+
+struct NpyAuxData_tag {
+    NpyAuxData_FreeFunc *free;
+    NpyAuxData_CloneFunc *clone;
+    /* To allow for a bit of expansion without breaking the ABI */
+    void *reserved[2];
+};
+
+/* Macros to use for freeing and cloning auxiliary data */
+#define NPY_AUXDATA_FREE(auxdata) \
+    do { \
+        if ((auxdata) != NULL) { \
+            (auxdata)->free(auxdata); \
+        } \
+    } while(0)
+#define NPY_AUXDATA_CLONE(auxdata) \
+    ((auxdata)->clone(auxdata))
+
+#define NPY_ERR(str) fprintf(stderr, #str); fflush(stderr);
+#define NPY_ERR2(str) fprintf(stderr, str); fflush(stderr);
+
+#define NPY_STRINGIFY(x) #x
+#define NPY_TOSTRING(x) NPY_STRINGIFY(x)
+
+  /*
+   * Macros to define how array, and dimension/strides data is
+   * allocated.
+   */
+
+  /* Data buffer - PyDataMem_NEW/FREE/RENEW are in multiarraymodule.c */
+
+#define NPY_USE_PYMEM 1
+
+
+#if NPY_USE_PYMEM == 1
+/* use the Raw versions which are safe to call with the GIL released */
+#define PyArray_malloc PyMem_RawMalloc
+#define PyArray_free PyMem_RawFree
+#define PyArray_realloc PyMem_RawRealloc
+#else
+#define PyArray_malloc malloc
+#define PyArray_free free
+#define PyArray_realloc realloc
+#endif
+
+/* Dimensions and strides */
+#define PyDimMem_NEW(size)                                         \
+    ((npy_intp *)PyArray_malloc(size*sizeof(npy_intp)))
+
+#define PyDimMem_FREE(ptr) PyArray_free(ptr)
+
+#define PyDimMem_RENEW(ptr,size)                                   \
+        ((npy_intp *)PyArray_realloc(ptr,size*sizeof(npy_intp)))
+
+/* forward declaration */
+struct _PyArray_Descr;
+
+/* These must deal with unaligned and swapped data if necessary */
+typedef PyObject * (PyArray_GetItemFunc) (void *, void *);
+typedef int (PyArray_SetItemFunc)(PyObject *, void *, void *);
+
+typedef void (PyArray_CopySwapNFunc)(void *, npy_intp, void *, npy_intp,
+                                     npy_intp, int, void *);
+
+typedef void (PyArray_CopySwapFunc)(void *, void *, int, void *);
+typedef npy_bool (PyArray_NonzeroFunc)(void *, void *);
+
+
+/*
+ * These assume aligned and notswapped data -- a buffer will be used
+ * before or contiguous data will be obtained
+ */
+
+typedef int (PyArray_CompareFunc)(const void *, const void *, void *);
+typedef int (PyArray_ArgFunc)(void*, npy_intp, npy_intp*, void *);
+
+typedef void (PyArray_DotFunc)(void *, npy_intp, void *, npy_intp, void *,
+                               npy_intp, void *);
+
+typedef void (PyArray_VectorUnaryFunc)(void *, void *, npy_intp, void *,
+                                       void *);
+
+/*
+ * XXX the ignore argument should be removed next time the API version
+ * is bumped. It used to be the separator.
+ */
+typedef int (PyArray_ScanFunc)(FILE *fp, void *dptr,
+                               char *ignore, struct _PyArray_Descr *);
+typedef int (PyArray_FromStrFunc)(char *s, void *dptr, char **endptr,
+                                  struct _PyArray_Descr *);
+
+typedef int (PyArray_FillFunc)(void *, npy_intp, void *);
+
+typedef int (PyArray_SortFunc)(void *, npy_intp, void *);
+typedef int (PyArray_ArgSortFunc)(void *, npy_intp *, npy_intp, void *);
+typedef int (PyArray_PartitionFunc)(void *, npy_intp, npy_intp,
+                                    npy_intp *, npy_intp *,
+                                    void *);
+typedef int (PyArray_ArgPartitionFunc)(void *, npy_intp *, npy_intp, npy_intp,
+                                       npy_intp *, npy_intp *,
+                                       void *);
+
+typedef int (PyArray_FillWithScalarFunc)(void *, npy_intp, void *, void *);
+
+typedef int (PyArray_ScalarKindFunc)(void *);
+
+typedef void (PyArray_FastClipFunc)(void *in, npy_intp n_in, void *min,
+                                    void *max, void *out);
+typedef void (PyArray_FastPutmaskFunc)(void *in, void *mask, npy_intp n_in,
+                                       void *values, npy_intp nv);
+typedef int  (PyArray_FastTakeFunc)(void *dest, void *src, npy_intp *indarray,
+                                       npy_intp nindarray, npy_intp n_outer,
+                                       npy_intp m_middle, npy_intp nelem,
+                                       NPY_CLIPMODE clipmode);
+
+typedef struct {
+        npy_intp *ptr;
+        int len;
+} PyArray_Dims;
+
+typedef struct {
+        /*
+         * Functions to cast to most other standard types
+         * Can have some NULL entries. The types
+         * DATETIME, TIMEDELTA, and HALF go into the castdict
+         * even though they are built-in.
+         */
+        PyArray_VectorUnaryFunc *cast[NPY_NTYPES_ABI_COMPATIBLE];
+
+        /* The next four functions *cannot* be NULL */
+
+        /*
+         * Functions to get and set items with standard Python types
+         * -- not array scalars
+         */
+        PyArray_GetItemFunc *getitem;
+        PyArray_SetItemFunc *setitem;
+
+        /*
+         * Copy and/or swap data.  Memory areas may not overlap
+         * Use memmove first if they might
+         */
+        PyArray_CopySwapNFunc *copyswapn;
+        PyArray_CopySwapFunc *copyswap;
+
+        /*
+         * Function to compare items
+         * Can be NULL
+         */
+        PyArray_CompareFunc *compare;
+
+        /*
+         * Function to select largest
+         * Can be NULL
+         */
+        PyArray_ArgFunc *argmax;
+
+        /*
+         * Function to compute dot product
+         * Can be NULL
+         */
+        PyArray_DotFunc *dotfunc;
+
+        /*
+         * Function to scan an ASCII file and
+         * place a single value plus possible separator
+         * Can be NULL
+         */
+        PyArray_ScanFunc *scanfunc;
+
+        /*
+         * Function to read a single value from a string
+         * and adjust the pointer; Can be NULL
+         */
+        PyArray_FromStrFunc *fromstr;
+
+        /*
+         * Function to determine if data is zero or not
+         * If NULL a default version is
+         * used at Registration time.
+         */
+        PyArray_NonzeroFunc *nonzero;
+
+        /*
+         * Used for arange. Should return 0 on success
+         * and -1 on failure.
+         * Can be NULL.
+         */
+        PyArray_FillFunc *fill;
+
+        /*
+         * Function to fill arrays with scalar values
+         * Can be NULL
+         */
+        PyArray_FillWithScalarFunc *fillwithscalar;
+
+        /*
+         * Sorting functions
+         * Can be NULL
+         */
+        PyArray_SortFunc *sort[NPY_NSORTS];
+        PyArray_ArgSortFunc *argsort[NPY_NSORTS];
+
+        /*
+         * Dictionary of additional casting functions
+         * PyArray_VectorUnaryFuncs
+         * which can be populated to support casting
+         * to other registered types. Can be NULL
+         */
+        PyObject *castdict;
+
+        /*
+         * Functions useful for generalizing
+         * the casting rules.
+         * Can be NULL;
+         */
+        PyArray_ScalarKindFunc *scalarkind;
+        int **cancastscalarkindto;
+        int *cancastto;
+
+        PyArray_FastClipFunc *fastclip;
+        PyArray_FastPutmaskFunc *fastputmask;
+        PyArray_FastTakeFunc *fasttake;
+
+        /*
+         * Function to select smallest
+         * Can be NULL
+         */
+        PyArray_ArgFunc *argmin;
+
+} PyArray_ArrFuncs;
+
+/* The item must be reference counted when it is inserted or extracted. */
+#define NPY_ITEM_REFCOUNT   0x01
+/* Same as needing REFCOUNT */
+#define NPY_ITEM_HASOBJECT  0x01
+/* Convert to list for pickling */
+#define NPY_LIST_PICKLE     0x02
+/* The item is a POINTER  */
+#define NPY_ITEM_IS_POINTER 0x04
+/* memory needs to be initialized for this data-type */
+#define NPY_NEEDS_INIT      0x08
+/* operations need Python C-API so don't give-up thread. */
+#define NPY_NEEDS_PYAPI     0x10
+/* Use f.getitem when extracting elements of this data-type */
+#define NPY_USE_GETITEM     0x20
+/* Use f.setitem when setting creating 0-d array from this data-type.*/
+#define NPY_USE_SETITEM     0x40
+/* A sticky flag specifically for structured arrays */
+#define NPY_ALIGNED_STRUCT  0x80
+
+/*
+ *These are inherited for global data-type if any data-types in the
+ * field have them
+ */
+#define NPY_FROM_FIELDS    (NPY_NEEDS_INIT | NPY_LIST_PICKLE | \
+                            NPY_ITEM_REFCOUNT | NPY_NEEDS_PYAPI)
+
+#define NPY_OBJECT_DTYPE_FLAGS (NPY_LIST_PICKLE | NPY_USE_GETITEM | \
+                                NPY_ITEM_IS_POINTER | NPY_ITEM_REFCOUNT | \
+                                NPY_NEEDS_INIT | NPY_NEEDS_PYAPI)
+
+#define PyDataType_FLAGCHK(dtype, flag) \
+        (((dtype)->flags & (flag)) == (flag))
+
+#define PyDataType_REFCHK(dtype) \
+        PyDataType_FLAGCHK(dtype, NPY_ITEM_REFCOUNT)
+
+typedef struct _PyArray_Descr {
+        PyObject_HEAD
+        /*
+         * the type object representing an
+         * instance of this type -- should not
+         * be two type_numbers with the same type
+         * object.
+         */
+        PyTypeObject *typeobj;
+        /* kind for this type */
+        char kind;
+        /* unique-character representing this type */
+        char type;
+        /*
+         * '>' (big), '<' (little), '|'
+         * (not-applicable), or '=' (native).
+         */
+        char byteorder;
+        /* flags describing data type */
+        char flags;
+        /* number representing this type */
+        int type_num;
+        /* element size (itemsize) for this type */
+        int elsize;
+        /* alignment needed for this type */
+        int alignment;
+        /*
+         * Non-NULL if this type is
+         * is an array (C-contiguous)
+         * of some other type
+         */
+        struct _arr_descr *subarray;
+        /*
+         * The fields dictionary for this type
+         * For statically defined descr this
+         * is always Py_None
+         */
+        PyObject *fields;
+        /*
+         * An ordered tuple of field names or NULL
+         * if no fields are defined
+         */
+        PyObject *names;
+        /*
+         * a table of functions specific for each
+         * basic data descriptor
+         */
+        PyArray_ArrFuncs *f;
+        /* Metadata about this dtype */
+        PyObject *metadata;
+        /*
+         * Metadata specific to the C implementation
+         * of the particular dtype. This was added
+         * for NumPy 1.7.0.
+         */
+        NpyAuxData *c_metadata;
+        /* Cached hash value (-1 if not yet computed).
+         * This was added for NumPy 2.0.0.
+         */
+        npy_hash_t hash;
+} PyArray_Descr;
+
+typedef struct _arr_descr {
+        PyArray_Descr *base;
+        PyObject *shape;       /* a tuple */
+} PyArray_ArrayDescr;
+
+/*
+ * The main array object structure.
+ *
+ * It has been recommended to use the inline functions defined below
+ * (PyArray_DATA and friends) to access fields here for a number of
+ * releases. Direct access to the members themselves is deprecated.
+ * To ensure that your code does not use deprecated access,
+ * #define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION
+ * (or NPY_1_8_API_VERSION or higher as required).
+ */
+/* This struct will be moved to a private header in a future release */
+typedef struct tagPyArrayObject_fields {
+    PyObject_HEAD
+    /* Pointer to the raw data buffer */
+    char *data;
+    /* The number of dimensions, also called 'ndim' */
+    int nd;
+    /* The size in each dimension, also called 'shape' */
+    npy_intp *dimensions;
+    /*
+     * Number of bytes to jump to get to the
+     * next element in each dimension
+     */
+    npy_intp *strides;
+    /*
+     * This object is decref'd upon
+     * deletion of array. Except in the
+     * case of WRITEBACKIFCOPY which has
+     * special handling.
+     *
+     * For views it points to the original
+     * array, collapsed so no chains of
+     * views occur.
+     *
+     * For creation from buffer object it
+     * points to an object that should be
+     * decref'd on deletion
+     *
+     * For WRITEBACKIFCOPY flag this is an
+     * array to-be-updated upon calling
+     * PyArray_ResolveWritebackIfCopy
+     */
+    PyObject *base;
+    /* Pointer to type structure */
+    PyArray_Descr *descr;
+    /* Flags describing array -- see below */
+    int flags;
+    /* For weak references */
+    PyObject *weakreflist;
+} PyArrayObject_fields;
+
+/*
+ * To hide the implementation details, we only expose
+ * the Python struct HEAD.
+ */
+#if !defined(NPY_NO_DEPRECATED_API) || \
+    (NPY_NO_DEPRECATED_API < NPY_1_7_API_VERSION)
+/*
+ * Can't put this in npy_deprecated_api.h like the others.
+ * PyArrayObject field access is deprecated as of NumPy 1.7.
+ */
+typedef PyArrayObject_fields PyArrayObject;
+#else
+typedef struct tagPyArrayObject {
+        PyObject_HEAD
+} PyArrayObject;
+#endif
+
+#define NPY_SIZEOF_PYARRAYOBJECT (sizeof(PyArrayObject_fields))
+
+/* Array Flags Object */
+typedef struct PyArrayFlagsObject {
+        PyObject_HEAD
+        PyObject *arr;
+        int flags;
+} PyArrayFlagsObject;
+
+/* Mirrors buffer object to ptr */
+
+typedef struct {
+        PyObject_HEAD
+        PyObject *base;
+        void *ptr;
+        npy_intp len;
+        int flags;
+} PyArray_Chunk;
+
+typedef struct {
+    NPY_DATETIMEUNIT base;
+    int num;
+} PyArray_DatetimeMetaData;
+
+typedef struct {
+    NpyAuxData base;
+    PyArray_DatetimeMetaData meta;
+} PyArray_DatetimeDTypeMetaData;
+
+/*
+ * This structure contains an exploded view of a date-time value.
+ * NaT is represented by year == NPY_DATETIME_NAT.
+ */
+typedef struct {
+        npy_int64 year;
+        npy_int32 month, day, hour, min, sec, us, ps, as;
+} npy_datetimestruct;
+
+/* This is not used internally. */
+typedef struct {
+        npy_int64 day;
+        npy_int32 sec, us, ps, as;
+} npy_timedeltastruct;
+
+typedef int (PyArray_FinalizeFunc)(PyArrayObject *, PyObject *);
+
+/*
+ * Means c-style contiguous (last index varies the fastest). The data
+ * elements right after each other.
+ *
+ * This flag may be requested in constructor functions.
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_C_CONTIGUOUS    0x0001
+
+/*
+ * Set if array is a contiguous Fortran array: the first index varies
+ * the fastest in memory (strides array is reverse of C-contiguous
+ * array)
+ *
+ * This flag may be requested in constructor functions.
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_F_CONTIGUOUS    0x0002
+
+/*
+ * Note: all 0-d arrays are C_CONTIGUOUS and F_CONTIGUOUS. If a
+ * 1-d array is C_CONTIGUOUS it is also F_CONTIGUOUS. Arrays with
+ * more then one dimension can be C_CONTIGUOUS and F_CONTIGUOUS
+ * at the same time if they have either zero or one element.
+ * If NPY_RELAXED_STRIDES_CHECKING is set, a higher dimensional
+ * array is always C_CONTIGUOUS and F_CONTIGUOUS if it has zero elements
+ * and the array is contiguous if ndarray.squeeze() is contiguous.
+ * I.e. dimensions for which `ndarray.shape[dimension] == 1` are
+ * ignored.
+ */
+
+/*
+ * If set, the array owns the data: it will be free'd when the array
+ * is deleted.
+ *
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_OWNDATA         0x0004
+
+/*
+ * An array never has the next four set; they're only used as parameter
+ * flags to the various FromAny functions
+ *
+ * This flag may be requested in constructor functions.
+ */
+
+/* Cause a cast to occur regardless of whether or not it is safe. */
+#define NPY_ARRAY_FORCECAST       0x0010
+
+/*
+ * Always copy the array. Returned arrays are always CONTIGUOUS,
+ * ALIGNED, and WRITEABLE.
+ *
+ * This flag may be requested in constructor functions.
+ */
+#define NPY_ARRAY_ENSURECOPY      0x0020
+
+/*
+ * Make sure the returned array is a base-class ndarray
+ *
+ * This flag may be requested in constructor functions.
+ */
+#define NPY_ARRAY_ENSUREARRAY     0x0040
+
+/*
+ * Make sure that the strides are in units of the element size Needed
+ * for some operations with record-arrays.
+ *
+ * This flag may be requested in constructor functions.
+ */
+#define NPY_ARRAY_ELEMENTSTRIDES  0x0080
+
+/*
+ * Array data is aligned on the appropriate memory address for the type
+ * stored according to how the compiler would align things (e.g., an
+ * array of integers (4 bytes each) starts on a memory address that's
+ * a multiple of 4)
+ *
+ * This flag may be requested in constructor functions.
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_ALIGNED         0x0100
+
+/*
+ * Array data has the native endianness
+ *
+ * This flag may be requested in constructor functions.
+ */
+#define NPY_ARRAY_NOTSWAPPED      0x0200
+
+/*
+ * Array data is writeable
+ *
+ * This flag may be requested in constructor functions.
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_WRITEABLE       0x0400
+
+/*
+ * If this flag is set, then base contains a pointer to an array of
+ * the same size that should be updated with the current contents of
+ * this array when PyArray_ResolveWritebackIfCopy is called.
+ *
+ * This flag may be requested in constructor functions.
+ * This flag may be tested for in PyArray_FLAGS(arr).
+ */
+#define NPY_ARRAY_UPDATEIFCOPY    0x1000 /* Deprecated in 1.14 */
+#define NPY_ARRAY_WRITEBACKIFCOPY 0x2000
+
+/*
+ * NOTE: there are also internal flags defined in multiarray/arrayobject.h,
+ * which start at bit 31 and work down.
+ */
+
+#define NPY_ARRAY_BEHAVED      (NPY_ARRAY_ALIGNED | \
+                                NPY_ARRAY_WRITEABLE)
+#define NPY_ARRAY_BEHAVED_NS   (NPY_ARRAY_ALIGNED | \
+                                NPY_ARRAY_WRITEABLE | \
+                                NPY_ARRAY_NOTSWAPPED)
+#define NPY_ARRAY_CARRAY       (NPY_ARRAY_C_CONTIGUOUS | \
+                                NPY_ARRAY_BEHAVED)
+#define NPY_ARRAY_CARRAY_RO    (NPY_ARRAY_C_CONTIGUOUS | \
+                                NPY_ARRAY_ALIGNED)
+#define NPY_ARRAY_FARRAY       (NPY_ARRAY_F_CONTIGUOUS | \
+                                NPY_ARRAY_BEHAVED)
+#define NPY_ARRAY_FARRAY_RO    (NPY_ARRAY_F_CONTIGUOUS | \
+                                NPY_ARRAY_ALIGNED)
+#define NPY_ARRAY_DEFAULT      (NPY_ARRAY_CARRAY)
+#define NPY_ARRAY_IN_ARRAY     (NPY_ARRAY_CARRAY_RO)
+#define NPY_ARRAY_OUT_ARRAY    (NPY_ARRAY_CARRAY)
+#define NPY_ARRAY_INOUT_ARRAY  (NPY_ARRAY_CARRAY | \
+                                NPY_ARRAY_UPDATEIFCOPY)
+#define NPY_ARRAY_INOUT_ARRAY2 (NPY_ARRAY_CARRAY | \
+                                NPY_ARRAY_WRITEBACKIFCOPY)
+#define NPY_ARRAY_IN_FARRAY    (NPY_ARRAY_FARRAY_RO)
+#define NPY_ARRAY_OUT_FARRAY   (NPY_ARRAY_FARRAY)
+#define NPY_ARRAY_INOUT_FARRAY (NPY_ARRAY_FARRAY | \
+                                NPY_ARRAY_UPDATEIFCOPY)
+#define NPY_ARRAY_INOUT_FARRAY2 (NPY_ARRAY_FARRAY | \
+                                NPY_ARRAY_WRITEBACKIFCOPY)
+
+#define NPY_ARRAY_UPDATE_ALL   (NPY_ARRAY_C_CONTIGUOUS | \
+                                NPY_ARRAY_F_CONTIGUOUS | \
+                                NPY_ARRAY_ALIGNED)
+
+/* This flag is for the array interface, not PyArrayObject */
+#define NPY_ARR_HAS_DESCR  0x0800
+
+
+
+
+/*
+ * Size of internal buffers used for alignment Make BUFSIZE a multiple
+ * of sizeof(npy_cdouble) -- usually 16 so that ufunc buffers are aligned
+ */
+#define NPY_MIN_BUFSIZE ((int)sizeof(npy_cdouble))
+#define NPY_MAX_BUFSIZE (((int)sizeof(npy_cdouble))*1000000)
+#define NPY_BUFSIZE 8192
+/* buffer stress test size: */
+/*#define NPY_BUFSIZE 17*/
+
+#define PyArray_MAX(a,b) (((a)>(b))?(a):(b))
+#define PyArray_MIN(a,b) (((a)<(b))?(a):(b))
+#define PyArray_CLT(p,q) ((((p).real==(q).real) ? ((p).imag < (q).imag) : \
+                               ((p).real < (q).real)))
+#define PyArray_CGT(p,q) ((((p).real==(q).real) ? ((p).imag > (q).imag) : \
+                               ((p).real > (q).real)))
+#define PyArray_CLE(p,q) ((((p).real==(q).real) ? ((p).imag <= (q).imag) : \
+                               ((p).real <= (q).real)))
+#define PyArray_CGE(p,q) ((((p).real==(q).real) ? ((p).imag >= (q).imag) : \
+                               ((p).real >= (q).real)))
+#define PyArray_CEQ(p,q) (((p).real==(q).real) && ((p).imag == (q).imag))
+#define PyArray_CNE(p,q) (((p).real!=(q).real) || ((p).imag != (q).imag))
+
+/*
+ * C API: consists of Macros and functions.  The MACROS are defined
+ * here.
+ */
+
+
+#define PyArray_ISCONTIGUOUS(m) PyArray_CHKFLAGS((m), NPY_ARRAY_C_CONTIGUOUS)
+#define PyArray_ISWRITEABLE(m) PyArray_CHKFLAGS((m), NPY_ARRAY_WRITEABLE)
+#define PyArray_ISALIGNED(m) PyArray_CHKFLAGS((m), NPY_ARRAY_ALIGNED)
+
+#define PyArray_IS_C_CONTIGUOUS(m) PyArray_CHKFLAGS((m), NPY_ARRAY_C_CONTIGUOUS)
+#define PyArray_IS_F_CONTIGUOUS(m) PyArray_CHKFLAGS((m), NPY_ARRAY_F_CONTIGUOUS)
+
+/* the variable is used in some places, so always define it */
+#define NPY_BEGIN_THREADS_DEF PyThreadState *_save=NULL;
+#if NPY_ALLOW_THREADS
+#define NPY_BEGIN_ALLOW_THREADS Py_BEGIN_ALLOW_THREADS
+#define NPY_END_ALLOW_THREADS Py_END_ALLOW_THREADS
+#define NPY_BEGIN_THREADS do {_save = PyEval_SaveThread();} while (0);
+#define NPY_END_THREADS   do { if (_save) \
+                { PyEval_RestoreThread(_save); _save = NULL;} } while (0);
+#define NPY_BEGIN_THREADS_THRESHOLDED(loop_size) do { if ((loop_size) > 500) \
+                { _save = PyEval_SaveThread();} } while (0);
+
+#define NPY_BEGIN_THREADS_DESCR(dtype) \
+        do {if (!(PyDataType_FLAGCHK((dtype), NPY_NEEDS_PYAPI))) \
+                NPY_BEGIN_THREADS;} while (0);
+
+#define NPY_END_THREADS_DESCR(dtype) \
+        do {if (!(PyDataType_FLAGCHK((dtype), NPY_NEEDS_PYAPI))) \
+                NPY_END_THREADS; } while (0);
+
+#define NPY_ALLOW_C_API_DEF  PyGILState_STATE __save__;
+#define NPY_ALLOW_C_API      do {__save__ = PyGILState_Ensure();} while (0);
+#define NPY_DISABLE_C_API    do {PyGILState_Release(__save__);} while (0);
+#else
+#define NPY_BEGIN_ALLOW_THREADS
+#define NPY_END_ALLOW_THREADS
+#define NPY_BEGIN_THREADS
+#define NPY_END_THREADS
+#define NPY_BEGIN_THREADS_THRESHOLDED(loop_size)
+#define NPY_BEGIN_THREADS_DESCR(dtype)
+#define NPY_END_THREADS_DESCR(dtype)
+#define NPY_ALLOW_C_API_DEF
+#define NPY_ALLOW_C_API
+#define NPY_DISABLE_C_API
+#endif
+
+/**********************************
+ * The nditer object, added in 1.6
+ **********************************/
+
+/* The actual structure of the iterator is an internal detail */
+typedef struct NpyIter_InternalOnly NpyIter;
+
+/* Iterator function pointers that may be specialized */
+typedef int (NpyIter_IterNextFunc)(NpyIter *iter);
+typedef void (NpyIter_GetMultiIndexFunc)(NpyIter *iter,
+                                      npy_intp *outcoords);
+
+/*** Global flags that may be passed to the iterator constructors ***/
+
+/* Track an index representing C order */
+#define NPY_ITER_C_INDEX                    0x00000001
+/* Track an index representing Fortran order */
+#define NPY_ITER_F_INDEX                    0x00000002
+/* Track a multi-index */
+#define NPY_ITER_MULTI_INDEX                0x00000004
+/* User code external to the iterator does the 1-dimensional innermost loop */
+#define NPY_ITER_EXTERNAL_LOOP              0x00000008
+/* Convert all the operands to a common data type */
+#define NPY_ITER_COMMON_DTYPE               0x00000010
+/* Operands may hold references, requiring API access during iteration */
+#define NPY_ITER_REFS_OK                    0x00000020
+/* Zero-sized operands should be permitted, iteration checks IterSize for 0 */
+#define NPY_ITER_ZEROSIZE_OK                0x00000040
+/* Permits reductions (size-0 stride with dimension size > 1) */
+#define NPY_ITER_REDUCE_OK                  0x00000080
+/* Enables sub-range iteration */
+#define NPY_ITER_RANGED                     0x00000100
+/* Enables buffering */
+#define NPY_ITER_BUFFERED                   0x00000200
+/* When buffering is enabled, grows the inner loop if possible */
+#define NPY_ITER_GROWINNER                  0x00000400
+/* Delay allocation of buffers until first Reset* call */
+#define NPY_ITER_DELAY_BUFALLOC             0x00000800
+/* When NPY_KEEPORDER is specified, disable reversing negative-stride axes */
+#define NPY_ITER_DONT_NEGATE_STRIDES        0x00001000
+/*
+ * If output operands overlap with other operands (based on heuristics that
+ * has false positives but no false negatives), make temporary copies to
+ * eliminate overlap.
+ */
+#define NPY_ITER_COPY_IF_OVERLAP            0x00002000
+
+/*** Per-operand flags that may be passed to the iterator constructors ***/
+
+/* The operand will be read from and written to */
+#define NPY_ITER_READWRITE                  0x00010000
+/* The operand will only be read from */
+#define NPY_ITER_READONLY                   0x00020000
+/* The operand will only be written to */
+#define NPY_ITER_WRITEONLY                  0x00040000
+/* The operand's data must be in native byte order */
+#define NPY_ITER_NBO                        0x00080000
+/* The operand's data must be aligned */
+#define NPY_ITER_ALIGNED                    0x00100000
+/* The operand's data must be contiguous (within the inner loop) */
+#define NPY_ITER_CONTIG                     0x00200000
+/* The operand may be copied to satisfy requirements */
+#define NPY_ITER_COPY                       0x00400000
+/* The operand may be copied with WRITEBACKIFCOPY to satisfy requirements */
+#define NPY_ITER_UPDATEIFCOPY               0x00800000
+/* Allocate the operand if it is NULL */
+#define NPY_ITER_ALLOCATE                   0x01000000
+/* If an operand is allocated, don't use any subtype */
+#define NPY_ITER_NO_SUBTYPE                 0x02000000
+/* This is a virtual array slot, operand is NULL but temporary data is there */
+#define NPY_ITER_VIRTUAL                    0x04000000
+/* Require that the dimension match the iterator dimensions exactly */
+#define NPY_ITER_NO_BROADCAST               0x08000000
+/* A mask is being used on this array, affects buffer -> array copy */
+#define NPY_ITER_WRITEMASKED                0x10000000
+/* This array is the mask for all WRITEMASKED operands */
+#define NPY_ITER_ARRAYMASK                  0x20000000
+/* Assume iterator order data access for COPY_IF_OVERLAP */
+#define NPY_ITER_OVERLAP_ASSUME_ELEMENTWISE 0x40000000
+
+#define NPY_ITER_GLOBAL_FLAGS               0x0000ffff
+#define NPY_ITER_PER_OP_FLAGS               0xffff0000
+
+
+/*****************************
+ * Basic iterator object
+ *****************************/
+
+/* FWD declaration */
+typedef struct PyArrayIterObject_tag PyArrayIterObject;
+
+/*
+ * type of the function which translates a set of coordinates to a
+ * pointer to the data
+ */
+typedef char* (*npy_iter_get_dataptr_t)(
+        PyArrayIterObject* iter, const npy_intp*);
+
+struct PyArrayIterObject_tag {
+        PyObject_HEAD
+        int               nd_m1;            /* number of dimensions - 1 */
+        npy_intp          index, size;
+        npy_intp          coordinates[NPY_MAXDIMS];/* N-dimensional loop */
+        npy_intp          dims_m1[NPY_MAXDIMS];    /* ao->dimensions - 1 */
+        npy_intp          strides[NPY_MAXDIMS];    /* ao->strides or fake */
+        npy_intp          backstrides[NPY_MAXDIMS];/* how far to jump back */
+        npy_intp          factors[NPY_MAXDIMS];     /* shape factors */
+        PyArrayObject     *ao;
+        char              *dataptr;        /* pointer to current item*/
+        npy_bool          contiguous;
+
+        npy_intp          bounds[NPY_MAXDIMS][2];
+        npy_intp          limits[NPY_MAXDIMS][2];
+        npy_intp          limits_sizes[NPY_MAXDIMS];
+        npy_iter_get_dataptr_t translate;
+} ;
+
+
+/* Iterator API */
+#define PyArrayIter_Check(op) PyObject_TypeCheck((op), &PyArrayIter_Type)
+
+#define _PyAIT(it) ((PyArrayIterObject *)(it))
+#define PyArray_ITER_RESET(it) do { \
+        _PyAIT(it)->index = 0; \
+        _PyAIT(it)->dataptr = PyArray_BYTES(_PyAIT(it)->ao); \
+        memset(_PyAIT(it)->coordinates, 0, \
+               (_PyAIT(it)->nd_m1+1)*sizeof(npy_intp)); \
+} while (0)
+
+#define _PyArray_ITER_NEXT1(it) do { \
+        (it)->dataptr += _PyAIT(it)->strides[0]; \
+        (it)->coordinates[0]++; \
+} while (0)
+
+#define _PyArray_ITER_NEXT2(it) do { \
+        if ((it)->coordinates[1] < (it)->dims_m1[1]) { \
+                (it)->coordinates[1]++; \
+                (it)->dataptr += (it)->strides[1]; \
+        } \
+        else { \
+                (it)->coordinates[1] = 0; \
+                (it)->coordinates[0]++; \
+                (it)->dataptr += (it)->strides[0] - \
+                        (it)->backstrides[1]; \
+        } \
+} while (0)
+
+#define PyArray_ITER_NEXT(it) do { \
+        _PyAIT(it)->index++; \
+        if (_PyAIT(it)->nd_m1 == 0) { \
+                _PyArray_ITER_NEXT1(_PyAIT(it)); \
+        } \
+        else if (_PyAIT(it)->contiguous) \
+                _PyAIT(it)->dataptr += PyArray_DESCR(_PyAIT(it)->ao)->elsize; \
+        else if (_PyAIT(it)->nd_m1 == 1) { \
+                _PyArray_ITER_NEXT2(_PyAIT(it)); \
+        } \
+        else { \
+                int __npy_i; \
+                for (__npy_i=_PyAIT(it)->nd_m1; __npy_i >= 0; __npy_i--) { \
+                        if (_PyAIT(it)->coordinates[__npy_i] < \
+                            _PyAIT(it)->dims_m1[__npy_i]) { \
+                                _PyAIT(it)->coordinates[__npy_i]++; \
+                                _PyAIT(it)->dataptr += \
+                                        _PyAIT(it)->strides[__npy_i]; \
+                                break; \
+                        } \
+                        else { \
+                                _PyAIT(it)->coordinates[__npy_i] = 0; \
+                                _PyAIT(it)->dataptr -= \
+                                        _PyAIT(it)->backstrides[__npy_i]; \
+                        } \
+                } \
+        } \
+} while (0)
+
+#define PyArray_ITER_GOTO(it, destination) do { \
+        int __npy_i; \
+        _PyAIT(it)->index = 0; \
+        _PyAIT(it)->dataptr = PyArray_BYTES(_PyAIT(it)->ao); \
+        for (__npy_i = _PyAIT(it)->nd_m1; __npy_i>=0; __npy_i--) { \
+                if (destination[__npy_i] < 0) { \
+                        destination[__npy_i] += \
+                                _PyAIT(it)->dims_m1[__npy_i]+1; \
+                } \
+                _PyAIT(it)->dataptr += destination[__npy_i] * \
+                        _PyAIT(it)->strides[__npy_i]; \
+                _PyAIT(it)->coordinates[__npy_i] = \
+                        destination[__npy_i]; \
+                _PyAIT(it)->index += destination[__npy_i] * \
+                        ( __npy_i==_PyAIT(it)->nd_m1 ? 1 : \
+                          _PyAIT(it)->dims_m1[__npy_i+1]+1) ; \
+        } \
+} while (0)
+
+#define PyArray_ITER_GOTO1D(it, ind) do { \
+        int __npy_i; \
+        npy_intp __npy_ind = (npy_intp)(ind); \
+        if (__npy_ind < 0) __npy_ind += _PyAIT(it)->size; \
+        _PyAIT(it)->index = __npy_ind; \
+        if (_PyAIT(it)->nd_m1 == 0) { \
+                _PyAIT(it)->dataptr = PyArray_BYTES(_PyAIT(it)->ao) + \
+                        __npy_ind * _PyAIT(it)->strides[0]; \
+        } \
+        else if (_PyAIT(it)->contiguous) \
+                _PyAIT(it)->dataptr = PyArray_BYTES(_PyAIT(it)->ao) + \
+                        __npy_ind * PyArray_DESCR(_PyAIT(it)->ao)->elsize; \
+        else { \
+                _PyAIT(it)->dataptr = PyArray_BYTES(_PyAIT(it)->ao); \
+                for (__npy_i = 0; __npy_i<=_PyAIT(it)->nd_m1; \
+                     __npy_i++) { \
+                        _PyAIT(it)->dataptr += \
+                                (__npy_ind / _PyAIT(it)->factors[__npy_i]) \
+                                * _PyAIT(it)->strides[__npy_i]; \
+                        __npy_ind %= _PyAIT(it)->factors[__npy_i]; \
+                } \
+        } \
+} while (0)
+
+#define PyArray_ITER_DATA(it) ((void *)(_PyAIT(it)->dataptr))
+
+#define PyArray_ITER_NOTDONE(it) (_PyAIT(it)->index < _PyAIT(it)->size)
+
+
+/*
+ * Any object passed to PyArray_Broadcast must be binary compatible
+ * with this structure.
+ */
+
+typedef struct {
+        PyObject_HEAD
+        int                  numiter;                 /* number of iters */
+        npy_intp             size;                    /* broadcasted size */
+        npy_intp             index;                   /* current index */
+        int                  nd;                      /* number of dims */
+        npy_intp             dimensions[NPY_MAXDIMS]; /* dimensions */
+        PyArrayIterObject    *iters[NPY_MAXARGS];     /* iterators */
+} PyArrayMultiIterObject;
+
+#define _PyMIT(m) ((PyArrayMultiIterObject *)(m))
+#define PyArray_MultiIter_RESET(multi) do {                                   \
+        int __npy_mi;                                                         \
+        _PyMIT(multi)->index = 0;                                             \
+        for (__npy_mi=0; __npy_mi < _PyMIT(multi)->numiter;  __npy_mi++) {    \
+                PyArray_ITER_RESET(_PyMIT(multi)->iters[__npy_mi]);           \
+        }                                                                     \
+} while (0)
+
+#define PyArray_MultiIter_NEXT(multi) do {                                    \
+        int __npy_mi;                                                         \
+        _PyMIT(multi)->index++;                                               \
+        for (__npy_mi=0; __npy_mi < _PyMIT(multi)->numiter;   __npy_mi++) {   \
+                PyArray_ITER_NEXT(_PyMIT(multi)->iters[__npy_mi]);            \
+        }                                                                     \
+} while (0)
+
+#define PyArray_MultiIter_GOTO(multi, dest) do {                            \
+        int __npy_mi;                                                       \
+        for (__npy_mi=0; __npy_mi < _PyMIT(multi)->numiter; __npy_mi++) {   \
+                PyArray_ITER_GOTO(_PyMIT(multi)->iters[__npy_mi], dest);    \
+        }                                                                   \
+        _PyMIT(multi)->index = _PyMIT(multi)->iters[0]->index;              \
+} while (0)
+
+#define PyArray_MultiIter_GOTO1D(multi, ind) do {                          \
+        int __npy_mi;                                                      \
+        for (__npy_mi=0; __npy_mi < _PyMIT(multi)->numiter; __npy_mi++) {  \
+                PyArray_ITER_GOTO1D(_PyMIT(multi)->iters[__npy_mi], ind);  \
+        }                                                                  \
+        _PyMIT(multi)->index = _PyMIT(multi)->iters[0]->index;             \
+} while (0)
+
+#define PyArray_MultiIter_DATA(multi, i)                \
+        ((void *)(_PyMIT(multi)->iters[i]->dataptr))
+
+#define PyArray_MultiIter_NEXTi(multi, i)               \
+        PyArray_ITER_NEXT(_PyMIT(multi)->iters[i])
+
+#define PyArray_MultiIter_NOTDONE(multi)                \
+        (_PyMIT(multi)->index < _PyMIT(multi)->size)
+
+
+/*
+ * Store the information needed for fancy-indexing over an array. The
+ * fields are slightly unordered to keep consec, dataptr and subspace
+ * where they were originally.
+ */
+typedef struct {
+        PyObject_HEAD
+        /*
+         * Multi-iterator portion --- needs to be present in this
+         * order to work with PyArray_Broadcast
+         */
+
+        int                   numiter;                 /* number of index-array
+                                                          iterators */
+        npy_intp              size;                    /* size of broadcasted
+                                                          result */
+        npy_intp              index;                   /* current index */
+        int                   nd;                      /* number of dims */
+        npy_intp              dimensions[NPY_MAXDIMS]; /* dimensions */
+        NpyIter               *outer;                  /* index objects
+                                                          iterator */
+        void                  *unused[NPY_MAXDIMS - 2];
+        PyArrayObject         *array;
+        /* Flat iterator for the indexed array. For compatibility solely. */
+        PyArrayIterObject     *ait;
+
+        /*
+         * Subspace array. For binary compatibility (was an iterator,
+         * but only the check for NULL should be used).
+         */
+        PyArrayObject         *subspace;
+
+        /*
+         * if subspace iteration, then this is the array of axes in
+         * the underlying array represented by the index objects
+         */
+        int                   iteraxes[NPY_MAXDIMS];
+        npy_intp              fancy_strides[NPY_MAXDIMS];
+
+        /* pointer when all fancy indices are 0 */
+        char                  *baseoffset;
+
+        /*
+         * after binding consec denotes at which axis the fancy axes
+         * are inserted.
+         */
+        int                   consec;
+        char                  *dataptr;
+
+        int                   nd_fancy;
+        npy_intp              fancy_dims[NPY_MAXDIMS];
+
+        /* Whether the iterator (any of the iterators) requires API */
+        int                   needs_api;
+
+        /*
+         * Extra op information.
+         */
+        PyArrayObject         *extra_op;
+        PyArray_Descr         *extra_op_dtype;         /* desired dtype */
+        npy_uint32            *extra_op_flags;         /* Iterator flags */
+
+        NpyIter               *extra_op_iter;
+        NpyIter_IterNextFunc  *extra_op_next;
+        char                  **extra_op_ptrs;
+
+        /*
+         * Information about the iteration state.
+         */
+        NpyIter_IterNextFunc  *outer_next;
+        char                  **outer_ptrs;
+        npy_intp              *outer_strides;
+
+        /*
+         * Information about the subspace iterator.
+         */
+        NpyIter               *subspace_iter;
+        NpyIter_IterNextFunc  *subspace_next;
+        char                  **subspace_ptrs;
+        npy_intp              *subspace_strides;
+
+        /* Count for the external loop (which ever it is) for API iteration */
+        npy_intp              iter_count;
+
+} PyArrayMapIterObject;
+
+enum {
+    NPY_NEIGHBORHOOD_ITER_ZERO_PADDING,
+    NPY_NEIGHBORHOOD_ITER_ONE_PADDING,
+    NPY_NEIGHBORHOOD_ITER_CONSTANT_PADDING,
+    NPY_NEIGHBORHOOD_ITER_CIRCULAR_PADDING,
+    NPY_NEIGHBORHOOD_ITER_MIRROR_PADDING
+};
+
+typedef struct {
+    PyObject_HEAD
+
+    /*
+     * PyArrayIterObject part: keep this in this exact order
+     */
+    int               nd_m1;            /* number of dimensions - 1 */
+    npy_intp          index, size;
+    npy_intp          coordinates[NPY_MAXDIMS];/* N-dimensional loop */
+    npy_intp          dims_m1[NPY_MAXDIMS];    /* ao->dimensions - 1 */
+    npy_intp          strides[NPY_MAXDIMS];    /* ao->strides or fake */
+    npy_intp          backstrides[NPY_MAXDIMS];/* how far to jump back */
+    npy_intp          factors[NPY_MAXDIMS];     /* shape factors */
+    PyArrayObject     *ao;
+    char              *dataptr;        /* pointer to current item*/
+    npy_bool          contiguous;
+
+    npy_intp          bounds[NPY_MAXDIMS][2];
+    npy_intp          limits[NPY_MAXDIMS][2];
+    npy_intp          limits_sizes[NPY_MAXDIMS];
+    npy_iter_get_dataptr_t translate;
+
+    /*
+     * New members
+     */
+    npy_intp nd;
+
+    /* Dimensions is the dimension of the array */
+    npy_intp dimensions[NPY_MAXDIMS];
+
+    /*
+     * Neighborhood points coordinates are computed relatively to the
+     * point pointed by _internal_iter
+     */
+    PyArrayIterObject* _internal_iter;
+    /*
+     * To keep a reference to the representation of the constant value
+     * for constant padding
+     */
+    char* constant;
+
+    int mode;
+} PyArrayNeighborhoodIterObject;
+
+/*
+ * Neighborhood iterator API
+ */
+
+/* General: those work for any mode */
+static NPY_INLINE int
+PyArrayNeighborhoodIter_Reset(PyArrayNeighborhoodIterObject* iter);
+static NPY_INLINE int
+PyArrayNeighborhoodIter_Next(PyArrayNeighborhoodIterObject* iter);
+#if 0
+static NPY_INLINE int
+PyArrayNeighborhoodIter_Next2D(PyArrayNeighborhoodIterObject* iter);
+#endif
+
+/*
+ * Include inline implementations - functions defined there are not
+ * considered public API
+ */
+#define _NPY_INCLUDE_NEIGHBORHOOD_IMP
+#include "_neighborhood_iterator_imp.h"
+#undef _NPY_INCLUDE_NEIGHBORHOOD_IMP
+
+/* The default array type */
+#define NPY_DEFAULT_TYPE NPY_DOUBLE
+
+/*
+ * All sorts of useful ways to look into a PyArrayObject. It is recommended
+ * to use PyArrayObject * objects instead of always casting from PyObject *,
+ * for improved type checking.
+ *
+ * In many cases here the macro versions of the accessors are deprecated,
+ * but can't be immediately changed to inline functions because the
+ * preexisting macros accept PyObject * and do automatic casts. Inline
+ * functions accepting PyArrayObject * provides for some compile-time
+ * checking of correctness when working with these objects in C.
+ */
+
+#define PyArray_ISONESEGMENT(m) (PyArray_CHKFLAGS(m, NPY_ARRAY_C_CONTIGUOUS) || \
+                                 PyArray_CHKFLAGS(m, NPY_ARRAY_F_CONTIGUOUS))
+
+#define PyArray_ISFORTRAN(m) (PyArray_CHKFLAGS(m, NPY_ARRAY_F_CONTIGUOUS) && \
+                             (!PyArray_CHKFLAGS(m, NPY_ARRAY_C_CONTIGUOUS)))
+
+#define PyArray_FORTRAN_IF(m) ((PyArray_CHKFLAGS(m, NPY_ARRAY_F_CONTIGUOUS) ? \
+                               NPY_ARRAY_F_CONTIGUOUS : 0))
+
+#if (defined(NPY_NO_DEPRECATED_API) && (NPY_1_7_API_VERSION <= NPY_NO_DEPRECATED_API))
+/*
+ * Changing access macros into functions, to allow for future hiding
+ * of the internal memory layout. This later hiding will allow the 2.x series
+ * to change the internal representation of arrays without affecting
+ * ABI compatibility.
+ */
+
+static NPY_INLINE int
+PyArray_NDIM(const PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->nd;
+}
+
+static NPY_INLINE void *
+PyArray_DATA(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->data;
+}
+
+static NPY_INLINE char *
+PyArray_BYTES(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->data;
+}
+
+static NPY_INLINE npy_intp *
+PyArray_DIMS(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->dimensions;
+}
+
+static NPY_INLINE npy_intp *
+PyArray_STRIDES(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->strides;
+}
+
+static NPY_INLINE npy_intp
+PyArray_DIM(const PyArrayObject *arr, int idim)
+{
+    return ((PyArrayObject_fields *)arr)->dimensions[idim];
+}
+
+static NPY_INLINE npy_intp
+PyArray_STRIDE(const PyArrayObject *arr, int istride)
+{
+    return ((PyArrayObject_fields *)arr)->strides[istride];
+}
+
+static NPY_INLINE NPY_RETURNS_BORROWED_REF PyObject *
+PyArray_BASE(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->base;
+}
+
+static NPY_INLINE NPY_RETURNS_BORROWED_REF PyArray_Descr *
+PyArray_DESCR(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->descr;
+}
+
+static NPY_INLINE int
+PyArray_FLAGS(const PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->flags;
+}
+
+static NPY_INLINE npy_intp
+PyArray_ITEMSIZE(const PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->descr->elsize;
+}
+
+static NPY_INLINE int
+PyArray_TYPE(const PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->descr->type_num;
+}
+
+static NPY_INLINE int
+PyArray_CHKFLAGS(const PyArrayObject *arr, int flags)
+{
+    return (PyArray_FLAGS(arr) & flags) == flags;
+}
+
+static NPY_INLINE PyObject *
+PyArray_GETITEM(const PyArrayObject *arr, const char *itemptr)
+{
+    return ((PyArrayObject_fields *)arr)->descr->f->getitem(
+                                        (void *)itemptr, (PyArrayObject *)arr);
+}
+
+static NPY_INLINE int
+PyArray_SETITEM(PyArrayObject *arr, char *itemptr, PyObject *v)
+{
+    return ((PyArrayObject_fields *)arr)->descr->f->setitem(
+                                                        v, itemptr, arr);
+}
+
+#else
+
+/* These macros are deprecated as of NumPy 1.7. */
+#define PyArray_NDIM(obj) (((PyArrayObject_fields *)(obj))->nd)
+#define PyArray_BYTES(obj) (((PyArrayObject_fields *)(obj))->data)
+#define PyArray_DATA(obj) ((void *)((PyArrayObject_fields *)(obj))->data)
+#define PyArray_DIMS(obj) (((PyArrayObject_fields *)(obj))->dimensions)
+#define PyArray_STRIDES(obj) (((PyArrayObject_fields *)(obj))->strides)
+#define PyArray_DIM(obj,n) (PyArray_DIMS(obj)[n])
+#define PyArray_STRIDE(obj,n) (PyArray_STRIDES(obj)[n])
+#define PyArray_BASE(obj) (((PyArrayObject_fields *)(obj))->base)
+#define PyArray_DESCR(obj) (((PyArrayObject_fields *)(obj))->descr)
+#define PyArray_FLAGS(obj) (((PyArrayObject_fields *)(obj))->flags)
+#define PyArray_CHKFLAGS(m, FLAGS) \
+        ((((PyArrayObject_fields *)(m))->flags & (FLAGS)) == (FLAGS))
+#define PyArray_ITEMSIZE(obj) \
+                    (((PyArrayObject_fields *)(obj))->descr->elsize)
+#define PyArray_TYPE(obj) \
+                    (((PyArrayObject_fields *)(obj))->descr->type_num)
+#define PyArray_GETITEM(obj,itemptr) \
+        PyArray_DESCR(obj)->f->getitem((char *)(itemptr), \
+                                     (PyArrayObject *)(obj))
+
+#define PyArray_SETITEM(obj,itemptr,v) \
+        PyArray_DESCR(obj)->f->setitem((PyObject *)(v), \
+                                     (char *)(itemptr), \
+                                     (PyArrayObject *)(obj))
+#endif
+
+static NPY_INLINE PyArray_Descr *
+PyArray_DTYPE(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->descr;
+}
+
+static NPY_INLINE npy_intp *
+PyArray_SHAPE(PyArrayObject *arr)
+{
+    return ((PyArrayObject_fields *)arr)->dimensions;
+}
+
+/*
+ * Enables the specified array flags. Does no checking,
+ * assumes you know what you're doing.
+ */
+static NPY_INLINE void
+PyArray_ENABLEFLAGS(PyArrayObject *arr, int flags)
+{
+    ((PyArrayObject_fields *)arr)->flags |= flags;
+}
+
+/*
+ * Clears the specified array flags. Does no checking,
+ * assumes you know what you're doing.
+ */
+static NPY_INLINE void
+PyArray_CLEARFLAGS(PyArrayObject *arr, int flags)
+{
+    ((PyArrayObject_fields *)arr)->flags &= ~flags;
+}
+
+#define PyTypeNum_ISBOOL(type) ((type) == NPY_BOOL)
+
+#define PyTypeNum_ISUNSIGNED(type) (((type) == NPY_UBYTE) ||   \
+                                 ((type) == NPY_USHORT) ||     \
+                                 ((type) == NPY_UINT) ||       \
+                                 ((type) == NPY_ULONG) ||      \
+                                 ((type) == NPY_ULONGLONG))
+
+#define PyTypeNum_ISSIGNED(type) (((type) == NPY_BYTE) ||      \
+                               ((type) == NPY_SHORT) ||        \
+                               ((type) == NPY_INT) ||          \
+                               ((type) == NPY_LONG) ||         \
+                               ((type) == NPY_LONGLONG))
+
+#define PyTypeNum_ISINTEGER(type) (((type) >= NPY_BYTE) &&     \
+                                ((type) <= NPY_ULONGLONG))
+
+#define PyTypeNum_ISFLOAT(type) ((((type) >= NPY_FLOAT) && \
+                              ((type) <= NPY_LONGDOUBLE)) || \
+                              ((type) == NPY_HALF))
+
+#define PyTypeNum_ISNUMBER(type) (((type) <= NPY_CLONGDOUBLE) || \
+                                  ((type) == NPY_HALF))
+
+#define PyTypeNum_ISSTRING(type) (((type) == NPY_STRING) ||    \
+                                  ((type) == NPY_UNICODE))
+
+#define PyTypeNum_ISCOMPLEX(type) (((type) >= NPY_CFLOAT) &&   \
+                                ((type) <= NPY_CLONGDOUBLE))
+
+#define PyTypeNum_ISPYTHON(type) (((type) == NPY_LONG) ||      \
+                                  ((type) == NPY_DOUBLE) ||    \
+                                  ((type) == NPY_CDOUBLE) ||   \
+                                  ((type) == NPY_BOOL) ||      \
+                                  ((type) == NPY_OBJECT ))
+
+#define PyTypeNum_ISFLEXIBLE(type) (((type) >=NPY_STRING) &&  \
+                                    ((type) <=NPY_VOID))
+
+#define PyTypeNum_ISDATETIME(type) (((type) >=NPY_DATETIME) &&  \
+                                    ((type) <=NPY_TIMEDELTA))
+
+#define PyTypeNum_ISUSERDEF(type) (((type) >= NPY_USERDEF) && \
+                                   ((type) < NPY_USERDEF+     \
+                                    NPY_NUMUSERTYPES))
+
+#define PyTypeNum_ISEXTENDED(type) (PyTypeNum_ISFLEXIBLE(type) ||  \
+                                    PyTypeNum_ISUSERDEF(type))
+
+#define PyTypeNum_ISOBJECT(type) ((type) == NPY_OBJECT)
+
+
+#define PyDataType_ISBOOL(obj) PyTypeNum_ISBOOL(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISUNSIGNED(obj) PyTypeNum_ISUNSIGNED(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISSIGNED(obj) PyTypeNum_ISSIGNED(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISINTEGER(obj) PyTypeNum_ISINTEGER(((PyArray_Descr*)(obj))->type_num )
+#define PyDataType_ISFLOAT(obj) PyTypeNum_ISFLOAT(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISNUMBER(obj) PyTypeNum_ISNUMBER(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISSTRING(obj) PyTypeNum_ISSTRING(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISCOMPLEX(obj) PyTypeNum_ISCOMPLEX(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISPYTHON(obj) PyTypeNum_ISPYTHON(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISFLEXIBLE(obj) PyTypeNum_ISFLEXIBLE(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISDATETIME(obj) PyTypeNum_ISDATETIME(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISUSERDEF(obj) PyTypeNum_ISUSERDEF(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISEXTENDED(obj) PyTypeNum_ISEXTENDED(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_ISOBJECT(obj) PyTypeNum_ISOBJECT(((PyArray_Descr*)(obj))->type_num)
+#define PyDataType_HASFIELDS(obj) (((PyArray_Descr *)(obj))->names != NULL)
+#define PyDataType_HASSUBARRAY(dtype) ((dtype)->subarray != NULL)
+#define PyDataType_ISUNSIZED(dtype) ((dtype)->elsize == 0 && \
+                                      !PyDataType_HASFIELDS(dtype))
+#define PyDataType_MAKEUNSIZED(dtype) ((dtype)->elsize = 0)
+
+#define PyArray_ISBOOL(obj) PyTypeNum_ISBOOL(PyArray_TYPE(obj))
+#define PyArray_ISUNSIGNED(obj) PyTypeNum_ISUNSIGNED(PyArray_TYPE(obj))
+#define PyArray_ISSIGNED(obj) PyTypeNum_ISSIGNED(PyArray_TYPE(obj))
+#define PyArray_ISINTEGER(obj) PyTypeNum_ISINTEGER(PyArray_TYPE(obj))
+#define PyArray_ISFLOAT(obj) PyTypeNum_ISFLOAT(PyArray_TYPE(obj))
+#define PyArray_ISNUMBER(obj) PyTypeNum_ISNUMBER(PyArray_TYPE(obj))
+#define PyArray_ISSTRING(obj) PyTypeNum_ISSTRING(PyArray_TYPE(obj))
+#define PyArray_ISCOMPLEX(obj) PyTypeNum_ISCOMPLEX(PyArray_TYPE(obj))
+#define PyArray_ISPYTHON(obj) PyTypeNum_ISPYTHON(PyArray_TYPE(obj))
+#define PyArray_ISFLEXIBLE(obj) PyTypeNum_ISFLEXIBLE(PyArray_TYPE(obj))
+#define PyArray_ISDATETIME(obj) PyTypeNum_ISDATETIME(PyArray_TYPE(obj))
+#define PyArray_ISUSERDEF(obj) PyTypeNum_ISUSERDEF(PyArray_TYPE(obj))
+#define PyArray_ISEXTENDED(obj) PyTypeNum_ISEXTENDED(PyArray_TYPE(obj))
+#define PyArray_ISOBJECT(obj) PyTypeNum_ISOBJECT(PyArray_TYPE(obj))
+#define PyArray_HASFIELDS(obj) PyDataType_HASFIELDS(PyArray_DESCR(obj))
+
+    /*
+     * FIXME: This should check for a flag on the data-type that
+     * states whether or not it is variable length.  Because the
+     * ISFLEXIBLE check is hard-coded to the built-in data-types.
+     */
+#define PyArray_ISVARIABLE(obj) PyTypeNum_ISFLEXIBLE(PyArray_TYPE(obj))
+
+#define PyArray_SAFEALIGNEDCOPY(obj) (PyArray_ISALIGNED(obj) && !PyArray_ISVARIABLE(obj))
+
+
+#define NPY_LITTLE '<'
+#define NPY_BIG '>'
+#define NPY_NATIVE '='
+#define NPY_SWAP 's'
+#define NPY_IGNORE '|'
+
+#if NPY_BYTE_ORDER == NPY_BIG_ENDIAN
+#define NPY_NATBYTE NPY_BIG
+#define NPY_OPPBYTE NPY_LITTLE
+#else
+#define NPY_NATBYTE NPY_LITTLE
+#define NPY_OPPBYTE NPY_BIG
+#endif
+
+#define PyArray_ISNBO(arg) ((arg) != NPY_OPPBYTE)
+#define PyArray_IsNativeByteOrder PyArray_ISNBO
+#define PyArray_ISNOTSWAPPED(m) PyArray_ISNBO(PyArray_DESCR(m)->byteorder)
+#define PyArray_ISBYTESWAPPED(m) (!PyArray_ISNOTSWAPPED(m))
+
+#define PyArray_FLAGSWAP(m, flags) (PyArray_CHKFLAGS(m, flags) &&       \
+                                    PyArray_ISNOTSWAPPED(m))
+
+#define PyArray_ISCARRAY(m) PyArray_FLAGSWAP(m, NPY_ARRAY_CARRAY)
+#define PyArray_ISCARRAY_RO(m) PyArray_FLAGSWAP(m, NPY_ARRAY_CARRAY_RO)
+#define PyArray_ISFARRAY(m) PyArray_FLAGSWAP(m, NPY_ARRAY_FARRAY)
+#define PyArray_ISFARRAY_RO(m) PyArray_FLAGSWAP(m, NPY_ARRAY_FARRAY_RO)
+#define PyArray_ISBEHAVED(m) PyArray_FLAGSWAP(m, NPY_ARRAY_BEHAVED)
+#define PyArray_ISBEHAVED_RO(m) PyArray_FLAGSWAP(m, NPY_ARRAY_ALIGNED)
+
+
+#define PyDataType_ISNOTSWAPPED(d) PyArray_ISNBO(((PyArray_Descr *)(d))->byteorder)
+#define PyDataType_ISBYTESWAPPED(d) (!PyDataType_ISNOTSWAPPED(d))
+
+/************************************************************
+ * A struct used by PyArray_CreateSortedStridePerm, new in 1.7.
+ ************************************************************/
+
+typedef struct {
+    npy_intp perm, stride;
+} npy_stride_sort_item;
+
+/************************************************************
+ * This is the form of the struct that's returned pointed by the
+ * PyCObject attribute of an array __array_struct__. See
+ * https://docs.scipy.org/doc/numpy/reference/arrays.interface.html for the full
+ * documentation.
+ ************************************************************/
+typedef struct {
+    int two;              /*
+                           * contains the integer 2 as a sanity
+                           * check
+                           */
+
+    int nd;               /* number of dimensions */
+
+    char typekind;        /*
+                           * kind in array --- character code of
+                           * typestr
+                           */
+
+    int itemsize;         /* size of each element */
+
+    int flags;            /*
+                           * how should be data interpreted. Valid
+                           * flags are CONTIGUOUS (1), F_CONTIGUOUS (2),
+                           * ALIGNED (0x100), NOTSWAPPED (0x200), and
+                           * WRITEABLE (0x400).  ARR_HAS_DESCR (0x800)
+                           * states that arrdescr field is present in
+                           * structure
+                           */
+
+    npy_intp *shape;       /*
+                            * A length-nd array of shape
+                            * information
+                            */
+
+    npy_intp *strides;    /* A length-nd array of stride information */
+
+    void *data;           /* A pointer to the first element of the array */
+
+    PyObject *descr;      /*
+                           * A list of fields or NULL (ignored if flags
+                           * does not have ARR_HAS_DESCR flag set)
+                           */
+} PyArrayInterface;
+
+/*
+ * This is a function for hooking into the PyDataMem_NEW/FREE/RENEW functions.
+ * See the documentation for PyDataMem_SetEventHook.
+ */
+typedef void (PyDataMem_EventHookFunc)(void *inp, void *outp, size_t size,
+                                       void *user_data);
+
+/*
+ * Use the keyword NPY_DEPRECATED_INCLUDES to ensure that the header files
+ * npy_*_*_deprecated_api.h are only included from here and nowhere else.
+ */
+#ifdef NPY_DEPRECATED_INCLUDES
+#error "Do not use the reserved keyword NPY_DEPRECATED_INCLUDES."
+#endif
+#define NPY_DEPRECATED_INCLUDES
+#if !defined(NPY_NO_DEPRECATED_API) || \
+    (NPY_NO_DEPRECATED_API < NPY_1_7_API_VERSION)
+#include "npy_1_7_deprecated_api.h"
+#endif
+/*
+ * There is no file npy_1_8_deprecated_api.h since there are no additional
+ * deprecated API features in NumPy 1.8.
+ *
+ * Note to maintainers: insert code like the following in future NumPy
+ * versions.
+ *
+ * #if !defined(NPY_NO_DEPRECATED_API) || \
+ *     (NPY_NO_DEPRECATED_API < NPY_1_9_API_VERSION)
+ * #include "npy_1_9_deprecated_api.h"
+ * #endif
+ */
+#undef NPY_DEPRECATED_INCLUDES
+
+#endif /* NPY_ARRAYTYPES_H */
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/noprefix.h b/venv/Lib/site-packages/numpy/core/include/numpy/noprefix.h
new file mode 100644
index 000000000..041f30192
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/noprefix.h
@@ -0,0 +1,212 @@
+#ifndef NPY_NOPREFIX_H
+#define NPY_NOPREFIX_H
+
+/*
+ * You can directly include noprefix.h as a backward
+ * compatibility measure
+ */
+#ifndef NPY_NO_PREFIX
+#include "ndarrayobject.h"
+#include "npy_interrupt.h"
+#endif
+
+#define SIGSETJMP   NPY_SIGSETJMP
+#define SIGLONGJMP  NPY_SIGLONGJMP
+#define SIGJMP_BUF  NPY_SIGJMP_BUF
+
+#define MAX_DIMS NPY_MAXDIMS
+
+#define longlong    npy_longlong
+#define ulonglong   npy_ulonglong
+#define Bool        npy_bool
+#define longdouble  npy_longdouble
+#define byte        npy_byte
+
+#ifndef _BSD_SOURCE
+#define ushort      npy_ushort
+#define uint        npy_uint
+#define ulong       npy_ulong
+#endif
+
+#define ubyte       npy_ubyte
+#define ushort      npy_ushort
+#define uint        npy_uint
+#define ulong       npy_ulong
+#define cfloat      npy_cfloat
+#define cdouble     npy_cdouble
+#define clongdouble npy_clongdouble
+#define Int8        npy_int8
+#define UInt8       npy_uint8
+#define Int16       npy_int16
+#define UInt16      npy_uint16
+#define Int32       npy_int32
+#define UInt32      npy_uint32
+#define Int64       npy_int64
+#define UInt64      npy_uint64
+#define Int128      npy_int128
+#define UInt128     npy_uint128
+#define Int256      npy_int256
+#define UInt256     npy_uint256
+#define Float16     npy_float16
+#define Complex32   npy_complex32
+#define Float32     npy_float32
+#define Complex64   npy_complex64
+#define Float64     npy_float64
+#define Complex128  npy_complex128
+#define Float80     npy_float80
+#define Complex160  npy_complex160
+#define Float96     npy_float96
+#define Complex192  npy_complex192
+#define Float128    npy_float128
+#define Complex256  npy_complex256
+#define intp        npy_intp
+#define uintp       npy_uintp
+#define datetime    npy_datetime
+#define timedelta   npy_timedelta
+
+#define SIZEOF_LONGLONG         NPY_SIZEOF_LONGLONG
+#define SIZEOF_INTP             NPY_SIZEOF_INTP
+#define SIZEOF_UINTP            NPY_SIZEOF_UINTP
+#define SIZEOF_HALF             NPY_SIZEOF_HALF
+#define SIZEOF_LONGDOUBLE       NPY_SIZEOF_LONGDOUBLE
+#define SIZEOF_DATETIME         NPY_SIZEOF_DATETIME
+#define SIZEOF_TIMEDELTA        NPY_SIZEOF_TIMEDELTA
+
+#define LONGLONG_FMT NPY_LONGLONG_FMT
+#define ULONGLONG_FMT NPY_ULONGLONG_FMT
+#define LONGLONG_SUFFIX NPY_LONGLONG_SUFFIX
+#define ULONGLONG_SUFFIX NPY_ULONGLONG_SUFFIX
+
+#define MAX_INT8 127
+#define MIN_INT8 -128
+#define MAX_UINT8 255
+#define MAX_INT16 32767
+#define MIN_INT16 -32768
+#define MAX_UINT16 65535
+#define MAX_INT32 2147483647
+#define MIN_INT32 (-MAX_INT32 - 1)
+#define MAX_UINT32 4294967295U
+#define MAX_INT64 LONGLONG_SUFFIX(9223372036854775807)
+#define MIN_INT64 (-MAX_INT64 - LONGLONG_SUFFIX(1))
+#define MAX_UINT64 ULONGLONG_SUFFIX(18446744073709551615)
+#define MAX_INT128 LONGLONG_SUFFIX(85070591730234615865843651857942052864)
+#define MIN_INT128 (-MAX_INT128 - LONGLONG_SUFFIX(1))
+#define MAX_UINT128 ULONGLONG_SUFFIX(170141183460469231731687303715884105728)
+#define MAX_INT256 LONGLONG_SUFFIX(57896044618658097711785492504343953926634992332820282019728792003956564819967)
+#define MIN_INT256 (-MAX_INT256 - LONGLONG_SUFFIX(1))
+#define MAX_UINT256 ULONGLONG_SUFFIX(115792089237316195423570985008687907853269984665640564039457584007913129639935)
+
+#define MAX_BYTE NPY_MAX_BYTE
+#define MIN_BYTE NPY_MIN_BYTE
+#define MAX_UBYTE NPY_MAX_UBYTE
+#define MAX_SHORT NPY_MAX_SHORT
+#define MIN_SHORT NPY_MIN_SHORT
+#define MAX_USHORT NPY_MAX_USHORT
+#define MAX_INT   NPY_MAX_INT
+#define MIN_INT   NPY_MIN_INT
+#define MAX_UINT  NPY_MAX_UINT
+#define MAX_LONG  NPY_MAX_LONG
+#define MIN_LONG  NPY_MIN_LONG
+#define MAX_ULONG  NPY_MAX_ULONG
+#define MAX_LONGLONG NPY_MAX_LONGLONG
+#define MIN_LONGLONG NPY_MIN_LONGLONG
+#define MAX_ULONGLONG NPY_MAX_ULONGLONG
+#define MIN_DATETIME NPY_MIN_DATETIME
+#define MAX_DATETIME NPY_MAX_DATETIME
+#define MIN_TIMEDELTA NPY_MIN_TIMEDELTA
+#define MAX_TIMEDELTA NPY_MAX_TIMEDELTA
+
+#define BITSOF_BOOL       NPY_BITSOF_BOOL
+#define BITSOF_CHAR       NPY_BITSOF_CHAR
+#define BITSOF_SHORT      NPY_BITSOF_SHORT
+#define BITSOF_INT        NPY_BITSOF_INT
+#define BITSOF_LONG       NPY_BITSOF_LONG
+#define BITSOF_LONGLONG   NPY_BITSOF_LONGLONG
+#define BITSOF_HALF       NPY_BITSOF_HALF
+#define BITSOF_FLOAT      NPY_BITSOF_FLOAT
+#define BITSOF_DOUBLE     NPY_BITSOF_DOUBLE
+#define BITSOF_LONGDOUBLE NPY_BITSOF_LONGDOUBLE
+#define BITSOF_DATETIME   NPY_BITSOF_DATETIME
+#define BITSOF_TIMEDELTA   NPY_BITSOF_TIMEDELTA
+
+#define _pya_malloc PyArray_malloc
+#define _pya_free PyArray_free
+#define _pya_realloc PyArray_realloc
+
+#define BEGIN_THREADS_DEF NPY_BEGIN_THREADS_DEF
+#define BEGIN_THREADS     NPY_BEGIN_THREADS
+#define END_THREADS       NPY_END_THREADS
+#define ALLOW_C_API_DEF   NPY_ALLOW_C_API_DEF
+#define ALLOW_C_API       NPY_ALLOW_C_API
+#define DISABLE_C_API     NPY_DISABLE_C_API
+
+#define PY_FAIL NPY_FAIL
+#define PY_SUCCEED NPY_SUCCEED
+
+#ifndef TRUE
+#define TRUE NPY_TRUE
+#endif
+
+#ifndef FALSE
+#define FALSE NPY_FALSE
+#endif
+
+#define LONGDOUBLE_FMT NPY_LONGDOUBLE_FMT
+
+#define CONTIGUOUS         NPY_CONTIGUOUS
+#define C_CONTIGUOUS       NPY_C_CONTIGUOUS
+#define FORTRAN            NPY_FORTRAN
+#define F_CONTIGUOUS       NPY_F_CONTIGUOUS
+#define OWNDATA            NPY_OWNDATA
+#define FORCECAST          NPY_FORCECAST
+#define ENSURECOPY         NPY_ENSURECOPY
+#define ENSUREARRAY        NPY_ENSUREARRAY
+#define ELEMENTSTRIDES     NPY_ELEMENTSTRIDES
+#define ALIGNED            NPY_ALIGNED
+#define NOTSWAPPED         NPY_NOTSWAPPED
+#define WRITEABLE          NPY_WRITEABLE
+#define UPDATEIFCOPY       NPY_UPDATEIFCOPY
+#define WRITEBACKIFCOPY    NPY_ARRAY_WRITEBACKIFCOPY
+#define ARR_HAS_DESCR      NPY_ARR_HAS_DESCR
+#define BEHAVED            NPY_BEHAVED
+#define BEHAVED_NS         NPY_BEHAVED_NS
+#define CARRAY             NPY_CARRAY
+#define CARRAY_RO          NPY_CARRAY_RO
+#define FARRAY             NPY_FARRAY
+#define FARRAY_RO          NPY_FARRAY_RO
+#define DEFAULT            NPY_DEFAULT
+#define IN_ARRAY           NPY_IN_ARRAY
+#define OUT_ARRAY          NPY_OUT_ARRAY
+#define INOUT_ARRAY        NPY_INOUT_ARRAY
+#define IN_FARRAY          NPY_IN_FARRAY
+#define OUT_FARRAY         NPY_OUT_FARRAY
+#define INOUT_FARRAY       NPY_INOUT_FARRAY
+#define UPDATE_ALL         NPY_UPDATE_ALL
+
+#define OWN_DATA          NPY_OWNDATA
+#define BEHAVED_FLAGS     NPY_BEHAVED
+#define BEHAVED_FLAGS_NS  NPY_BEHAVED_NS
+#define CARRAY_FLAGS_RO   NPY_CARRAY_RO
+#define CARRAY_FLAGS      NPY_CARRAY
+#define FARRAY_FLAGS      NPY_FARRAY
+#define FARRAY_FLAGS_RO   NPY_FARRAY_RO
+#define DEFAULT_FLAGS     NPY_DEFAULT
+#define UPDATE_ALL_FLAGS  NPY_UPDATE_ALL_FLAGS
+
+#ifndef MIN
+#define MIN PyArray_MIN
+#endif
+#ifndef MAX
+#define MAX PyArray_MAX
+#endif
+#define MAX_INTP NPY_MAX_INTP
+#define MIN_INTP NPY_MIN_INTP
+#define MAX_UINTP NPY_MAX_UINTP
+#define INTP_FMT NPY_INTP_FMT
+
+#ifndef PYPY_VERSION
+#define REFCOUNT PyArray_REFCOUNT
+#define MAX_ELSIZE NPY_MAX_ELSIZE
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_1_7_deprecated_api.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_1_7_deprecated_api.h
new file mode 100644
index 000000000..440458010
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_1_7_deprecated_api.h
@@ -0,0 +1,126 @@
+#ifndef _NPY_1_7_DEPRECATED_API_H
+#define _NPY_1_7_DEPRECATED_API_H
+
+#ifndef NPY_DEPRECATED_INCLUDES
+#error "Should never include npy_*_*_deprecated_api directly."
+#endif
+
+/* Emit a warning if the user did not specifically request the old API */
+#ifndef NPY_NO_DEPRECATED_API
+#if defined(_WIN32)
+#define _WARN___STR2__(x) #x
+#define _WARN___STR1__(x) _WARN___STR2__(x)
+#define _WARN___LOC__ __FILE__ "(" _WARN___STR1__(__LINE__) ") : Warning Msg: "
+#pragma message(_WARN___LOC__"Using deprecated NumPy API, disable it with " \
+                         "#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION")
+#elif defined(__GNUC__)
+#warning "Using deprecated NumPy API, disable it with " \
+         "#define NPY_NO_DEPRECATED_API NPY_1_7_API_VERSION"
+#endif
+/* TODO: How to do this warning message for other compilers? */
+#endif
+
+/*
+ * This header exists to collect all dangerous/deprecated NumPy API
+ * as of NumPy 1.7.
+ *
+ * This is an attempt to remove bad API, the proliferation of macros,
+ * and namespace pollution currently produced by the NumPy headers.
+ */
+
+/* These array flags are deprecated as of NumPy 1.7 */
+#define NPY_CONTIGUOUS NPY_ARRAY_C_CONTIGUOUS
+#define NPY_FORTRAN NPY_ARRAY_F_CONTIGUOUS
+
+/*
+ * The consistent NPY_ARRAY_* names which don't pollute the NPY_*
+ * namespace were added in NumPy 1.7.
+ *
+ * These versions of the carray flags are deprecated, but
+ * probably should only be removed after two releases instead of one.
+ */
+#define NPY_C_CONTIGUOUS   NPY_ARRAY_C_CONTIGUOUS
+#define NPY_F_CONTIGUOUS   NPY_ARRAY_F_CONTIGUOUS
+#define NPY_OWNDATA        NPY_ARRAY_OWNDATA
+#define NPY_FORCECAST      NPY_ARRAY_FORCECAST
+#define NPY_ENSURECOPY     NPY_ARRAY_ENSURECOPY
+#define NPY_ENSUREARRAY    NPY_ARRAY_ENSUREARRAY
+#define NPY_ELEMENTSTRIDES NPY_ARRAY_ELEMENTSTRIDES
+#define NPY_ALIGNED        NPY_ARRAY_ALIGNED
+#define NPY_NOTSWAPPED     NPY_ARRAY_NOTSWAPPED
+#define NPY_WRITEABLE      NPY_ARRAY_WRITEABLE
+#define NPY_UPDATEIFCOPY   NPY_ARRAY_UPDATEIFCOPY
+#define NPY_BEHAVED        NPY_ARRAY_BEHAVED
+#define NPY_BEHAVED_NS     NPY_ARRAY_BEHAVED_NS
+#define NPY_CARRAY         NPY_ARRAY_CARRAY
+#define NPY_CARRAY_RO      NPY_ARRAY_CARRAY_RO
+#define NPY_FARRAY         NPY_ARRAY_FARRAY
+#define NPY_FARRAY_RO      NPY_ARRAY_FARRAY_RO
+#define NPY_DEFAULT        NPY_ARRAY_DEFAULT
+#define NPY_IN_ARRAY       NPY_ARRAY_IN_ARRAY
+#define NPY_OUT_ARRAY      NPY_ARRAY_OUT_ARRAY
+#define NPY_INOUT_ARRAY    NPY_ARRAY_INOUT_ARRAY
+#define NPY_IN_FARRAY      NPY_ARRAY_IN_FARRAY
+#define NPY_OUT_FARRAY     NPY_ARRAY_OUT_FARRAY
+#define NPY_INOUT_FARRAY   NPY_ARRAY_INOUT_FARRAY
+#define NPY_UPDATE_ALL     NPY_ARRAY_UPDATE_ALL
+
+/* This way of accessing the default type is deprecated as of NumPy 1.7 */
+#define PyArray_DEFAULT NPY_DEFAULT_TYPE
+
+/* These DATETIME bits aren't used internally */
+#define PyDataType_GetDatetimeMetaData(descr)                                 \
+    ((descr->metadata == NULL) ? NULL :                                       \
+        ((PyArray_DatetimeMetaData *)(PyCapsule_GetPointer(                   \
+                PyDict_GetItemString(                                         \
+                    descr->metadata, NPY_METADATA_DTSTR), NULL))))
+
+/*
+ * Deprecated as of NumPy 1.7, this kind of shortcut doesn't
+ * belong in the public API.
+ */
+#define NPY_AO PyArrayObject
+
+/*
+ * Deprecated as of NumPy 1.7, an all-lowercase macro doesn't
+ * belong in the public API.
+ */
+#define fortran fortran_
+
+/*
+ * Deprecated as of NumPy 1.7, as it is a namespace-polluting
+ * macro.
+ */
+#define FORTRAN_IF PyArray_FORTRAN_IF
+
+/* Deprecated as of NumPy 1.7, datetime64 uses c_metadata instead */
+#define NPY_METADATA_DTSTR "__timeunit__"
+
+/*
+ * Deprecated as of NumPy 1.7.
+ * The reasoning:
+ *  - These are for datetime, but there's no datetime "namespace".
+ *  - They just turn NPY_STR_<x> into "<x>", which is just
+ *    making something simple be indirected.
+ */
+#define NPY_STR_Y "Y"
+#define NPY_STR_M "M"
+#define NPY_STR_W "W"
+#define NPY_STR_D "D"
+#define NPY_STR_h "h"
+#define NPY_STR_m "m"
+#define NPY_STR_s "s"
+#define NPY_STR_ms "ms"
+#define NPY_STR_us "us"
+#define NPY_STR_ns "ns"
+#define NPY_STR_ps "ps"
+#define NPY_STR_fs "fs"
+#define NPY_STR_as "as"
+
+/*
+ * The macros in old_defines.h are Deprecated as of NumPy 1.7 and will be
+ * removed in the next major release.
+ */
+#include "old_defines.h"
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_3kcompat.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_3kcompat.h
new file mode 100644
index 000000000..798da6957
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_3kcompat.h
@@ -0,0 +1,558 @@
+/*
+ * This is a convenience header file providing compatibility utilities
+ * for supporting Python 2 and Python 3 in the same code base.
+ *
+ * If you want to use this for your own projects, it's recommended to make a
+ * copy of it. Although the stuff below is unlikely to change, we don't provide
+ * strong backwards compatibility guarantees at the moment.
+ */
+
+#ifndef _NPY_3KCOMPAT_H_
+#define _NPY_3KCOMPAT_H_
+
+#include <Python.h>
+#include <stdio.h>
+
+#ifndef NPY_PY3K
+#define NPY_PY3K 1
+#endif
+
+#include "numpy/npy_common.h"
+#include "numpy/ndarrayobject.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * PyInt -> PyLong
+ */
+
+#if defined(NPY_PY3K)
+/* Return True only if the long fits in a C long */
+static NPY_INLINE int PyInt_Check(PyObject *op) {
+    int overflow = 0;
+    if (!PyLong_Check(op)) {
+        return 0;
+    }
+    PyLong_AsLongAndOverflow(op, &overflow);
+    return (overflow == 0);
+}
+
+#define PyInt_FromLong PyLong_FromLong
+#define PyInt_AsLong PyLong_AsLong
+#define PyInt_AS_LONG PyLong_AsLong
+#define PyInt_AsSsize_t PyLong_AsSsize_t
+#define PyNumber_Int PyNumber_Long
+
+/* NOTE:
+ *
+ * Since the PyLong type is very different from the fixed-range PyInt,
+ * we don't define PyInt_Type -> PyLong_Type.
+ */
+#endif /* NPY_PY3K */
+
+/* Py3 changes PySlice_GetIndicesEx' first argument's type to PyObject* */
+#ifdef NPY_PY3K
+#  define NpySlice_GetIndicesEx PySlice_GetIndicesEx
+#else
+#  define NpySlice_GetIndicesEx(op, nop, start, end, step, slicelength) \
+    PySlice_GetIndicesEx((PySliceObject *)op, nop, start, end, step, slicelength)
+#endif
+
+#if PY_VERSION_HEX < 0x030900a4
+    /* Introduced in https://github.com/python/cpython/commit/d2ec81a8c99796b51fb8c49b77a7fe369863226f */
+    #define Py_SET_TYPE(obj, typ) (Py_TYPE(obj) = typ)
+    /* Introduced in https://github.com/python/cpython/commit/b10dc3e7a11fcdb97e285882eba6da92594f90f9 */
+    #define Py_SET_SIZE(obj, size) (Py_SIZE(obj) = size)
+#endif
+
+
+#define Npy_EnterRecursiveCall(x) Py_EnterRecursiveCall(x)
+
+/* Py_SETREF was added in 3.5.2, and only if Py_LIMITED_API is absent */
+#if PY_VERSION_HEX < 0x03050200
+    #define Py_SETREF(op, op2)                      \
+        do {                                        \
+            PyObject *_py_tmp = (PyObject *)(op);   \
+            (op) = (op2);                           \
+            Py_DECREF(_py_tmp);                     \
+        } while (0)
+#endif
+
+/* introduced in https://github.com/python/cpython/commit/a24107b04c1277e3c1105f98aff5bfa3a98b33a0 */
+#if PY_VERSION_HEX < 0x030800A3
+    static NPY_INLINE PyObject *
+    _PyDict_GetItemStringWithError(PyObject *v, const char *key)
+    {
+        PyObject *kv, *rv;
+        kv = PyUnicode_FromString(key);
+        if (kv == NULL) {
+            return NULL;
+        }
+        rv = PyDict_GetItemWithError(v, kv);
+        Py_DECREF(kv);
+        return rv;
+    }
+#endif
+
+/*
+ * PyString -> PyBytes
+ */
+
+#if defined(NPY_PY3K)
+
+#define PyString_Type PyBytes_Type
+#define PyString_Check PyBytes_Check
+#define PyStringObject PyBytesObject
+#define PyString_FromString PyBytes_FromString
+#define PyString_FromStringAndSize PyBytes_FromStringAndSize
+#define PyString_AS_STRING PyBytes_AS_STRING
+#define PyString_AsStringAndSize PyBytes_AsStringAndSize
+#define PyString_FromFormat PyBytes_FromFormat
+#define PyString_Concat PyBytes_Concat
+#define PyString_ConcatAndDel PyBytes_ConcatAndDel
+#define PyString_AsString PyBytes_AsString
+#define PyString_GET_SIZE PyBytes_GET_SIZE
+#define PyString_Size PyBytes_Size
+
+#define PyUString_Type PyUnicode_Type
+#define PyUString_Check PyUnicode_Check
+#define PyUStringObject PyUnicodeObject
+#define PyUString_FromString PyUnicode_FromString
+#define PyUString_FromStringAndSize PyUnicode_FromStringAndSize
+#define PyUString_FromFormat PyUnicode_FromFormat
+#define PyUString_Concat PyUnicode_Concat2
+#define PyUString_ConcatAndDel PyUnicode_ConcatAndDel
+#define PyUString_GET_SIZE PyUnicode_GET_SIZE
+#define PyUString_Size PyUnicode_Size
+#define PyUString_InternFromString PyUnicode_InternFromString
+#define PyUString_Format PyUnicode_Format
+
+#define PyBaseString_Check(obj) (PyUnicode_Check(obj))
+
+#else
+
+#define PyBytes_Type PyString_Type
+#define PyBytes_Check PyString_Check
+#define PyBytesObject PyStringObject
+#define PyBytes_FromString PyString_FromString
+#define PyBytes_FromStringAndSize PyString_FromStringAndSize
+#define PyBytes_AS_STRING PyString_AS_STRING
+#define PyBytes_AsStringAndSize PyString_AsStringAndSize
+#define PyBytes_FromFormat PyString_FromFormat
+#define PyBytes_Concat PyString_Concat
+#define PyBytes_ConcatAndDel PyString_ConcatAndDel
+#define PyBytes_AsString PyString_AsString
+#define PyBytes_GET_SIZE PyString_GET_SIZE
+#define PyBytes_Size PyString_Size
+
+#define PyUString_Type PyString_Type
+#define PyUString_Check PyString_Check
+#define PyUStringObject PyStringObject
+#define PyUString_FromString PyString_FromString
+#define PyUString_FromStringAndSize PyString_FromStringAndSize
+#define PyUString_FromFormat PyString_FromFormat
+#define PyUString_Concat PyString_Concat
+#define PyUString_ConcatAndDel PyString_ConcatAndDel
+#define PyUString_GET_SIZE PyString_GET_SIZE
+#define PyUString_Size PyString_Size
+#define PyUString_InternFromString PyString_InternFromString
+#define PyUString_Format PyString_Format
+
+#define PyBaseString_Check(obj) (PyBytes_Check(obj) || PyUnicode_Check(obj))
+
+#endif /* NPY_PY3K */
+
+
+static NPY_INLINE void
+PyUnicode_ConcatAndDel(PyObject **left, PyObject *right)
+{
+    Py_SETREF(*left, PyUnicode_Concat(*left, right));
+    Py_DECREF(right);
+}
+
+static NPY_INLINE void
+PyUnicode_Concat2(PyObject **left, PyObject *right)
+{
+    Py_SETREF(*left, PyUnicode_Concat(*left, right));
+}
+
+/*
+ * PyFile_* compatibility
+ */
+
+/*
+ * Get a FILE* handle to the file represented by the Python object
+ */
+static NPY_INLINE FILE*
+npy_PyFile_Dup2(PyObject *file, char *mode, npy_off_t *orig_pos)
+{
+    int fd, fd2, unbuf;
+    PyObject *ret, *os, *io, *io_raw;
+    npy_off_t pos;
+    FILE *handle;
+
+    /* For Python 2 PyFileObject, use PyFile_AsFile */
+#if !defined(NPY_PY3K)
+    if (PyFile_Check(file)) {
+        return PyFile_AsFile(file);
+    }
+#endif
+
+    /* Flush first to ensure things end up in the file in the correct order */
+    ret = PyObject_CallMethod(file, "flush", "");
+    if (ret == NULL) {
+        return NULL;
+    }
+    Py_DECREF(ret);
+    fd = PyObject_AsFileDescriptor(file);
+    if (fd == -1) {
+        return NULL;
+    }
+
+    /*
+     * The handle needs to be dup'd because we have to call fclose
+     * at the end
+     */
+    os = PyImport_ImportModule("os");
+    if (os == NULL) {
+        return NULL;
+    }
+    ret = PyObject_CallMethod(os, "dup", "i", fd);
+    Py_DECREF(os);
+    if (ret == NULL) {
+        return NULL;
+    }
+    fd2 = PyNumber_AsSsize_t(ret, NULL);
+    Py_DECREF(ret);
+
+    /* Convert to FILE* handle */
+#ifdef _WIN32
+    handle = _fdopen(fd2, mode);
+#else
+    handle = fdopen(fd2, mode);
+#endif
+    if (handle == NULL) {
+        PyErr_SetString(PyExc_IOError,
+                        "Getting a FILE* from a Python file object failed");
+        return NULL;
+    }
+
+    /* Record the original raw file handle position */
+    *orig_pos = npy_ftell(handle);
+    if (*orig_pos == -1) {
+        /* The io module is needed to determine if buffering is used */
+        io = PyImport_ImportModule("io");
+        if (io == NULL) {
+            fclose(handle);
+            return NULL;
+        }
+        /* File object instances of RawIOBase are unbuffered */
+        io_raw = PyObject_GetAttrString(io, "RawIOBase");
+        Py_DECREF(io);
+        if (io_raw == NULL) {
+            fclose(handle);
+            return NULL;
+        }
+        unbuf = PyObject_IsInstance(file, io_raw);
+        Py_DECREF(io_raw);
+        if (unbuf == 1) {
+            /* Succeed if the IO is unbuffered */
+            return handle;
+        }
+        else {
+            PyErr_SetString(PyExc_IOError, "obtaining file position failed");
+            fclose(handle);
+            return NULL;
+        }
+    }
+
+    /* Seek raw handle to the Python-side position */
+    ret = PyObject_CallMethod(file, "tell", "");
+    if (ret == NULL) {
+        fclose(handle);
+        return NULL;
+    }
+    pos = PyLong_AsLongLong(ret);
+    Py_DECREF(ret);
+    if (PyErr_Occurred()) {
+        fclose(handle);
+        return NULL;
+    }
+    if (npy_fseek(handle, pos, SEEK_SET) == -1) {
+        PyErr_SetString(PyExc_IOError, "seeking file failed");
+        fclose(handle);
+        return NULL;
+    }
+    return handle;
+}
+
+/*
+ * Close the dup-ed file handle, and seek the Python one to the current position
+ */
+static NPY_INLINE int
+npy_PyFile_DupClose2(PyObject *file, FILE* handle, npy_off_t orig_pos)
+{
+    int fd, unbuf;
+    PyObject *ret, *io, *io_raw;
+    npy_off_t position;
+
+    /* For Python 2 PyFileObject, do nothing */
+#if !defined(NPY_PY3K)
+    if (PyFile_Check(file)) {
+        return 0;
+    }
+#endif
+
+    position = npy_ftell(handle);
+
+    /* Close the FILE* handle */
+    fclose(handle);
+
+    /*
+     * Restore original file handle position, in order to not confuse
+     * Python-side data structures
+     */
+    fd = PyObject_AsFileDescriptor(file);
+    if (fd == -1) {
+        return -1;
+    }
+
+    if (npy_lseek(fd, orig_pos, SEEK_SET) == -1) {
+
+        /* The io module is needed to determine if buffering is used */
+        io = PyImport_ImportModule("io");
+        if (io == NULL) {
+            return -1;
+        }
+        /* File object instances of RawIOBase are unbuffered */
+        io_raw = PyObject_GetAttrString(io, "RawIOBase");
+        Py_DECREF(io);
+        if (io_raw == NULL) {
+            return -1;
+        }
+        unbuf = PyObject_IsInstance(file, io_raw);
+        Py_DECREF(io_raw);
+        if (unbuf == 1) {
+            /* Succeed if the IO is unbuffered */
+            return 0;
+        }
+        else {
+            PyErr_SetString(PyExc_IOError, "seeking file failed");
+            return -1;
+        }
+    }
+
+    if (position == -1) {
+        PyErr_SetString(PyExc_IOError, "obtaining file position failed");
+        return -1;
+    }
+
+    /* Seek Python-side handle to the FILE* handle position */
+    ret = PyObject_CallMethod(file, "seek", NPY_OFF_T_PYFMT "i", position, 0);
+    if (ret == NULL) {
+        return -1;
+    }
+    Py_DECREF(ret);
+    return 0;
+}
+
+static NPY_INLINE int
+npy_PyFile_Check(PyObject *file)
+{
+    int fd;
+    /* For Python 2, check if it is a PyFileObject */
+#if !defined(NPY_PY3K)
+    if (PyFile_Check(file)) {
+        return 1;
+    }
+#endif
+    fd = PyObject_AsFileDescriptor(file);
+    if (fd == -1) {
+        PyErr_Clear();
+        return 0;
+    }
+    return 1;
+}
+
+static NPY_INLINE PyObject*
+npy_PyFile_OpenFile(PyObject *filename, const char *mode)
+{
+    PyObject *open;
+    open = PyDict_GetItemString(PyEval_GetBuiltins(), "open");
+    if (open == NULL) {
+        return NULL;
+    }
+    return PyObject_CallFunction(open, "Os", filename, mode);
+}
+
+static NPY_INLINE int
+npy_PyFile_CloseFile(PyObject *file)
+{
+    PyObject *ret;
+
+    ret = PyObject_CallMethod(file, "close", NULL);
+    if (ret == NULL) {
+        return -1;
+    }
+    Py_DECREF(ret);
+    return 0;
+}
+
+
+/* This is a copy of _PyErr_ChainExceptions
+ */
+static NPY_INLINE void
+npy_PyErr_ChainExceptions(PyObject *exc, PyObject *val, PyObject *tb)
+{
+    if (exc == NULL)
+        return;
+
+    if (PyErr_Occurred()) {
+        /* only py3 supports this anyway */
+        #ifdef NPY_PY3K
+            PyObject *exc2, *val2, *tb2;
+            PyErr_Fetch(&exc2, &val2, &tb2);
+            PyErr_NormalizeException(&exc, &val, &tb);
+            if (tb != NULL) {
+                PyException_SetTraceback(val, tb);
+                Py_DECREF(tb);
+            }
+            Py_DECREF(exc);
+            PyErr_NormalizeException(&exc2, &val2, &tb2);
+            PyException_SetContext(val2, val);
+            PyErr_Restore(exc2, val2, tb2);
+        #endif
+    }
+    else {
+        PyErr_Restore(exc, val, tb);
+    }
+}
+
+
+/* This is a copy of _PyErr_ChainExceptions, with:
+ *  - a minimal implementation for python 2
+ *  - __cause__ used instead of __context__
+ */
+static NPY_INLINE void
+npy_PyErr_ChainExceptionsCause(PyObject *exc, PyObject *val, PyObject *tb)
+{
+    if (exc == NULL)
+        return;
+
+    if (PyErr_Occurred()) {
+        /* only py3 supports this anyway */
+        #ifdef NPY_PY3K
+            PyObject *exc2, *val2, *tb2;
+            PyErr_Fetch(&exc2, &val2, &tb2);
+            PyErr_NormalizeException(&exc, &val, &tb);
+            if (tb != NULL) {
+                PyException_SetTraceback(val, tb);
+                Py_DECREF(tb);
+            }
+            Py_DECREF(exc);
+            PyErr_NormalizeException(&exc2, &val2, &tb2);
+            PyException_SetCause(val2, val);
+            PyErr_Restore(exc2, val2, tb2);
+        #endif
+    }
+    else {
+        PyErr_Restore(exc, val, tb);
+    }
+}
+
+/*
+ * PyObject_Cmp
+ */
+#if defined(NPY_PY3K)
+static NPY_INLINE int
+PyObject_Cmp(PyObject *i1, PyObject *i2, int *cmp)
+{
+    int v;
+    v = PyObject_RichCompareBool(i1, i2, Py_LT);
+    if (v == 1) {
+        *cmp = -1;
+        return 1;
+    }
+    else if (v == -1) {
+        return -1;
+    }
+
+    v = PyObject_RichCompareBool(i1, i2, Py_GT);
+    if (v == 1) {
+        *cmp = 1;
+        return 1;
+    }
+    else if (v == -1) {
+        return -1;
+    }
+
+    v = PyObject_RichCompareBool(i1, i2, Py_EQ);
+    if (v == 1) {
+        *cmp = 0;
+        return 1;
+    }
+    else {
+        *cmp = 0;
+        return -1;
+    }
+}
+#endif
+
+/*
+ * PyCObject functions adapted to PyCapsules.
+ *
+ * The main job here is to get rid of the improved error handling
+ * of PyCapsules. It's a shame...
+ */
+static NPY_INLINE PyObject *
+NpyCapsule_FromVoidPtr(void *ptr, void (*dtor)(PyObject *))
+{
+    PyObject *ret = PyCapsule_New(ptr, NULL, dtor);
+    if (ret == NULL) {
+        PyErr_Clear();
+    }
+    return ret;
+}
+
+static NPY_INLINE PyObject *
+NpyCapsule_FromVoidPtrAndDesc(void *ptr, void* context, void (*dtor)(PyObject *))
+{
+    PyObject *ret = NpyCapsule_FromVoidPtr(ptr, dtor);
+    if (ret != NULL && PyCapsule_SetContext(ret, context) != 0) {
+        PyErr_Clear();
+        Py_DECREF(ret);
+        ret = NULL;
+    }
+    return ret;
+}
+
+static NPY_INLINE void *
+NpyCapsule_AsVoidPtr(PyObject *obj)
+{
+    void *ret = PyCapsule_GetPointer(obj, NULL);
+    if (ret == NULL) {
+        PyErr_Clear();
+    }
+    return ret;
+}
+
+static NPY_INLINE void *
+NpyCapsule_GetDesc(PyObject *obj)
+{
+    return PyCapsule_GetContext(obj);
+}
+
+static NPY_INLINE int
+NpyCapsule_Check(PyObject *ptr)
+{
+    return PyCapsule_CheckExact(ptr);
+}
+
+#ifdef __cplusplus
+}
+#endif
+
+
+#endif /* _NPY_3KCOMPAT_H_ */
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_common.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_common.h
new file mode 100644
index 000000000..c2e755958
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_common.h
@@ -0,0 +1,1094 @@
+#ifndef _NPY_COMMON_H_
+#define _NPY_COMMON_H_
+
+/* numpconfig.h is auto-generated */
+#include "numpyconfig.h"
+#ifdef HAVE_NPY_CONFIG_H
+#include <npy_config.h>
+#endif
+
+/* need Python.h for npy_intp, npy_uintp */
+#include <Python.h>
+
+/*
+ * using static inline modifiers when defining npy_math functions
+ * allows the compiler to make optimizations when possible
+ */
+#if defined(NPY_INTERNAL_BUILD) && NPY_INTERNAL_BUILD
+#ifndef NPY_INLINE_MATH
+#define NPY_INLINE_MATH 1
+#endif
+#endif
+
+/*
+ * gcc does not unroll even with -O3
+ * use with care, unrolling on modern cpus rarely speeds things up
+ */
+#ifdef HAVE_ATTRIBUTE_OPTIMIZE_UNROLL_LOOPS
+#define NPY_GCC_UNROLL_LOOPS \
+    __attribute__((optimize("unroll-loops")))
+#else
+#define NPY_GCC_UNROLL_LOOPS
+#endif
+
+/* highest gcc optimization level, enabled autovectorizer */
+#ifdef HAVE_ATTRIBUTE_OPTIMIZE_OPT_3
+#define NPY_GCC_OPT_3 __attribute__((optimize("O3")))
+#else
+#define NPY_GCC_OPT_3
+#endif
+
+/* compile target attributes */
+#if defined HAVE_ATTRIBUTE_TARGET_AVX && defined HAVE_LINK_AVX
+#define NPY_GCC_TARGET_AVX __attribute__((target("avx")))
+#else
+#define NPY_GCC_TARGET_AVX
+#endif
+
+#if defined HAVE_ATTRIBUTE_TARGET_AVX2_WITH_INTRINSICS
+#define HAVE_ATTRIBUTE_TARGET_FMA
+#define NPY_GCC_TARGET_FMA __attribute__((target("avx2,fma")))
+#endif
+
+#if defined HAVE_ATTRIBUTE_TARGET_AVX2 && defined HAVE_LINK_AVX2
+#define NPY_GCC_TARGET_AVX2 __attribute__((target("avx2")))
+#else
+#define NPY_GCC_TARGET_AVX2
+#endif
+
+#if defined HAVE_ATTRIBUTE_TARGET_AVX512F && defined HAVE_LINK_AVX512F
+#define NPY_GCC_TARGET_AVX512F __attribute__((target("avx512f")))
+#elif defined HAVE_ATTRIBUTE_TARGET_AVX512F_WITH_INTRINSICS
+#define NPY_GCC_TARGET_AVX512F __attribute__((target("avx512f")))
+#else
+#define NPY_GCC_TARGET_AVX512F
+#endif
+
+/*
+ * mark an argument (starting from 1) that must not be NULL and is not checked
+ * DO NOT USE IF FUNCTION CHECKS FOR NULL!! the compiler will remove the check
+ */
+#ifdef HAVE_ATTRIBUTE_NONNULL
+#define NPY_GCC_NONNULL(n) __attribute__((nonnull(n)))
+#else
+#define NPY_GCC_NONNULL(n)
+#endif
+
+#if defined HAVE_XMMINTRIN_H && defined HAVE__MM_LOAD_PS
+#define NPY_HAVE_SSE_INTRINSICS
+#endif
+
+#if defined HAVE_EMMINTRIN_H && defined HAVE__MM_LOAD_PD
+#define NPY_HAVE_SSE2_INTRINSICS
+#endif
+
+#if defined HAVE_IMMINTRIN_H && defined HAVE_LINK_AVX2
+#define NPY_HAVE_AVX2_INTRINSICS
+#endif
+
+#if defined HAVE_IMMINTRIN_H && defined HAVE_LINK_AVX512F
+#define NPY_HAVE_AVX512F_INTRINSICS
+#endif
+/*
+ * give a hint to the compiler which branch is more likely or unlikely
+ * to occur, e.g. rare error cases:
+ *
+ * if (NPY_UNLIKELY(failure == 0))
+ *    return NULL;
+ *
+ * the double !! is to cast the expression (e.g. NULL) to a boolean required by
+ * the intrinsic
+ */
+#ifdef HAVE___BUILTIN_EXPECT
+#define NPY_LIKELY(x) __builtin_expect(!!(x), 1)
+#define NPY_UNLIKELY(x) __builtin_expect(!!(x), 0)
+#else
+#define NPY_LIKELY(x) (x)
+#define NPY_UNLIKELY(x) (x)
+#endif
+
+#ifdef HAVE___BUILTIN_PREFETCH
+/* unlike _mm_prefetch also works on non-x86 */
+#define NPY_PREFETCH(x, rw, loc) __builtin_prefetch((x), (rw), (loc))
+#else
+#ifdef HAVE__MM_PREFETCH
+/* _MM_HINT_ET[01] (rw = 1) unsupported, only available in gcc >= 4.9 */
+#define NPY_PREFETCH(x, rw, loc) _mm_prefetch((x), loc == 0 ? _MM_HINT_NTA : \
+                                             (loc == 1 ? _MM_HINT_T2 : \
+                                              (loc == 2 ? _MM_HINT_T1 : \
+                                               (loc == 3 ? _MM_HINT_T0 : -1))))
+#else
+#define NPY_PREFETCH(x, rw,loc)
+#endif
+#endif
+
+#if defined(_MSC_VER)
+        #define NPY_INLINE __inline
+#elif defined(__GNUC__)
+    #if defined(__STRICT_ANSI__)
+         #define NPY_INLINE __inline__
+    #else
+         #define NPY_INLINE inline
+    #endif
+#else
+    #define NPY_INLINE
+#endif
+
+#ifdef HAVE___THREAD
+    #define NPY_TLS __thread
+#else
+    #ifdef HAVE___DECLSPEC_THREAD_
+        #define NPY_TLS __declspec(thread)
+    #else
+        #define NPY_TLS
+    #endif
+#endif
+
+#ifdef WITH_CPYCHECKER_RETURNS_BORROWED_REF_ATTRIBUTE
+  #define NPY_RETURNS_BORROWED_REF \
+    __attribute__((cpychecker_returns_borrowed_ref))
+#else
+  #define NPY_RETURNS_BORROWED_REF
+#endif
+
+#ifdef WITH_CPYCHECKER_STEALS_REFERENCE_TO_ARG_ATTRIBUTE
+  #define NPY_STEALS_REF_TO_ARG(n) \
+   __attribute__((cpychecker_steals_reference_to_arg(n)))
+#else
+ #define NPY_STEALS_REF_TO_ARG(n)
+#endif
+
+/* 64 bit file position support, also on win-amd64. Ticket #1660 */
+#if defined(_MSC_VER) && defined(_WIN64) && (_MSC_VER > 1400) || \
+    defined(__MINGW32__) || defined(__MINGW64__)
+    #include <io.h>
+
+/* mingw based on 3.4.5 has lseek but not ftell/fseek */
+#if defined(__MINGW32__) || defined(__MINGW64__)
+extern int __cdecl _fseeki64(FILE *, long long, int);
+extern long long __cdecl _ftelli64(FILE *);
+#endif
+
+    #define npy_fseek _fseeki64
+    #define npy_ftell _ftelli64
+    #define npy_lseek _lseeki64
+    #define npy_off_t npy_int64
+
+    #if NPY_SIZEOF_INT == 8
+        #define NPY_OFF_T_PYFMT "i"
+    #elif NPY_SIZEOF_LONG == 8
+        #define NPY_OFF_T_PYFMT "l"
+    #elif NPY_SIZEOF_LONGLONG == 8
+        #define NPY_OFF_T_PYFMT "L"
+    #else
+        #error Unsupported size for type off_t
+    #endif
+#else
+#ifdef HAVE_FSEEKO
+    #define npy_fseek fseeko
+#else
+    #define npy_fseek fseek
+#endif
+#ifdef HAVE_FTELLO
+    #define npy_ftell ftello
+#else
+    #define npy_ftell ftell
+#endif
+    #include <sys/types.h>
+    #define npy_lseek lseek
+    #define npy_off_t off_t
+
+    #if NPY_SIZEOF_OFF_T == NPY_SIZEOF_SHORT
+        #define NPY_OFF_T_PYFMT "h"
+    #elif NPY_SIZEOF_OFF_T == NPY_SIZEOF_INT
+        #define NPY_OFF_T_PYFMT "i"
+    #elif NPY_SIZEOF_OFF_T == NPY_SIZEOF_LONG
+        #define NPY_OFF_T_PYFMT "l"
+    #elif NPY_SIZEOF_OFF_T == NPY_SIZEOF_LONGLONG
+        #define NPY_OFF_T_PYFMT "L"
+    #else
+        #error Unsupported size for type off_t
+    #endif
+#endif
+
+/* enums for detected endianness */
+enum {
+        NPY_CPU_UNKNOWN_ENDIAN,
+        NPY_CPU_LITTLE,
+        NPY_CPU_BIG
+};
+
+/*
+ * This is to typedef npy_intp to the appropriate pointer size for this
+ * platform.  Py_intptr_t, Py_uintptr_t are defined in pyport.h.
+ */
+typedef Py_intptr_t npy_intp;
+typedef Py_uintptr_t npy_uintp;
+
+/*
+ * Define sizes that were not defined in numpyconfig.h.
+ */
+#define NPY_SIZEOF_CHAR 1
+#define NPY_SIZEOF_BYTE 1
+#define NPY_SIZEOF_DATETIME 8
+#define NPY_SIZEOF_TIMEDELTA 8
+#define NPY_SIZEOF_INTP NPY_SIZEOF_PY_INTPTR_T
+#define NPY_SIZEOF_UINTP NPY_SIZEOF_PY_INTPTR_T
+#define NPY_SIZEOF_HALF 2
+#define NPY_SIZEOF_CFLOAT NPY_SIZEOF_COMPLEX_FLOAT
+#define NPY_SIZEOF_CDOUBLE NPY_SIZEOF_COMPLEX_DOUBLE
+#define NPY_SIZEOF_CLONGDOUBLE NPY_SIZEOF_COMPLEX_LONGDOUBLE
+
+#ifdef constchar
+#undef constchar
+#endif
+
+#define NPY_SSIZE_T_PYFMT "n"
+#define constchar char
+
+/* NPY_INTP_FMT Note:
+ *      Unlike the other NPY_*_FMT macros which are used with
+ *      PyOS_snprintf, NPY_INTP_FMT is used with PyErr_Format and
+ *      PyString_Format. These functions use different formatting
+ *      codes which are portably specified according to the Python
+ *      documentation. See ticket #1795.
+ */
+#if NPY_SIZEOF_PY_INTPTR_T == NPY_SIZEOF_INT
+        #define NPY_INTP NPY_INT
+        #define NPY_UINTP NPY_UINT
+        #define PyIntpArrType_Type PyIntArrType_Type
+        #define PyUIntpArrType_Type PyUIntArrType_Type
+        #define NPY_MAX_INTP NPY_MAX_INT
+        #define NPY_MIN_INTP NPY_MIN_INT
+        #define NPY_MAX_UINTP NPY_MAX_UINT
+        #define NPY_INTP_FMT "d"
+#elif NPY_SIZEOF_PY_INTPTR_T == NPY_SIZEOF_LONG
+        #define NPY_INTP NPY_LONG
+        #define NPY_UINTP NPY_ULONG
+        #define PyIntpArrType_Type PyLongArrType_Type
+        #define PyUIntpArrType_Type PyULongArrType_Type
+        #define NPY_MAX_INTP NPY_MAX_LONG
+        #define NPY_MIN_INTP NPY_MIN_LONG
+        #define NPY_MAX_UINTP NPY_MAX_ULONG
+        #define NPY_INTP_FMT "ld"
+#elif defined(PY_LONG_LONG) && (NPY_SIZEOF_PY_INTPTR_T == NPY_SIZEOF_LONGLONG)
+        #define NPY_INTP NPY_LONGLONG
+        #define NPY_UINTP NPY_ULONGLONG
+        #define PyIntpArrType_Type PyLongLongArrType_Type
+        #define PyUIntpArrType_Type PyULongLongArrType_Type
+        #define NPY_MAX_INTP NPY_MAX_LONGLONG
+        #define NPY_MIN_INTP NPY_MIN_LONGLONG
+        #define NPY_MAX_UINTP NPY_MAX_ULONGLONG
+        #define NPY_INTP_FMT "lld"
+#endif
+
+/*
+ * We can only use C99 formats for npy_int_p if it is the same as
+ * intp_t, hence the condition on HAVE_UNITPTR_T
+ */
+#if (NPY_USE_C99_FORMATS) == 1 \
+        && (defined HAVE_UINTPTR_T) \
+        && (defined HAVE_INTTYPES_H)
+        #include <inttypes.h>
+        #undef NPY_INTP_FMT
+        #define NPY_INTP_FMT PRIdPTR
+#endif
+
+
+/*
+ * Some platforms don't define bool, long long, or long double.
+ * Handle that here.
+ */
+#define NPY_BYTE_FMT "hhd"
+#define NPY_UBYTE_FMT "hhu"
+#define NPY_SHORT_FMT "hd"
+#define NPY_USHORT_FMT "hu"
+#define NPY_INT_FMT "d"
+#define NPY_UINT_FMT "u"
+#define NPY_LONG_FMT "ld"
+#define NPY_ULONG_FMT "lu"
+#define NPY_HALF_FMT "g"
+#define NPY_FLOAT_FMT "g"
+#define NPY_DOUBLE_FMT "g"
+
+
+#ifdef PY_LONG_LONG
+typedef PY_LONG_LONG npy_longlong;
+typedef unsigned PY_LONG_LONG npy_ulonglong;
+#  ifdef _MSC_VER
+#    define NPY_LONGLONG_FMT         "I64d"
+#    define NPY_ULONGLONG_FMT        "I64u"
+#  else
+#    define NPY_LONGLONG_FMT         "lld"
+#    define NPY_ULONGLONG_FMT        "llu"
+#  endif
+#  ifdef _MSC_VER
+#    define NPY_LONGLONG_SUFFIX(x)   (x##i64)
+#    define NPY_ULONGLONG_SUFFIX(x)  (x##Ui64)
+#  else
+#    define NPY_LONGLONG_SUFFIX(x)   (x##LL)
+#    define NPY_ULONGLONG_SUFFIX(x)  (x##ULL)
+#  endif
+#else
+typedef long npy_longlong;
+typedef unsigned long npy_ulonglong;
+#  define NPY_LONGLONG_SUFFIX(x)  (x##L)
+#  define NPY_ULONGLONG_SUFFIX(x) (x##UL)
+#endif
+
+
+typedef unsigned char npy_bool;
+#define NPY_FALSE 0
+#define NPY_TRUE 1
+
+
+#if NPY_SIZEOF_LONGDOUBLE == NPY_SIZEOF_DOUBLE
+        typedef double npy_longdouble;
+        #define NPY_LONGDOUBLE_FMT "g"
+#else
+        typedef long double npy_longdouble;
+        #define NPY_LONGDOUBLE_FMT "Lg"
+#endif
+
+#ifndef Py_USING_UNICODE
+#error Must use Python with unicode enabled.
+#endif
+
+
+typedef signed char npy_byte;
+typedef unsigned char npy_ubyte;
+typedef unsigned short npy_ushort;
+typedef unsigned int npy_uint;
+typedef unsigned long npy_ulong;
+
+/* These are for completeness */
+typedef char npy_char;
+typedef short npy_short;
+typedef int npy_int;
+typedef long npy_long;
+typedef float npy_float;
+typedef double npy_double;
+
+typedef Py_hash_t npy_hash_t;
+#define NPY_SIZEOF_HASH_T NPY_SIZEOF_INTP
+
+/*
+ * Disabling C99 complex usage: a lot of C code in numpy/scipy rely on being
+ * able to do .real/.imag. Will have to convert code first.
+ */
+#if 0
+#if defined(NPY_USE_C99_COMPLEX) && defined(NPY_HAVE_COMPLEX_DOUBLE)
+typedef complex npy_cdouble;
+#else
+typedef struct { double real, imag; } npy_cdouble;
+#endif
+
+#if defined(NPY_USE_C99_COMPLEX) && defined(NPY_HAVE_COMPLEX_FLOAT)
+typedef complex float npy_cfloat;
+#else
+typedef struct { float real, imag; } npy_cfloat;
+#endif
+
+#if defined(NPY_USE_C99_COMPLEX) && defined(NPY_HAVE_COMPLEX_LONG_DOUBLE)
+typedef complex long double npy_clongdouble;
+#else
+typedef struct {npy_longdouble real, imag;} npy_clongdouble;
+#endif
+#endif
+#if NPY_SIZEOF_COMPLEX_DOUBLE != 2 * NPY_SIZEOF_DOUBLE
+#error npy_cdouble definition is not compatible with C99 complex definition ! \
+        Please contact NumPy maintainers and give detailed information about your \
+        compiler and platform
+#endif
+typedef struct { double real, imag; } npy_cdouble;
+
+#if NPY_SIZEOF_COMPLEX_FLOAT != 2 * NPY_SIZEOF_FLOAT
+#error npy_cfloat definition is not compatible with C99 complex definition ! \
+        Please contact NumPy maintainers and give detailed information about your \
+        compiler and platform
+#endif
+typedef struct { float real, imag; } npy_cfloat;
+
+#if NPY_SIZEOF_COMPLEX_LONGDOUBLE != 2 * NPY_SIZEOF_LONGDOUBLE
+#error npy_clongdouble definition is not compatible with C99 complex definition ! \
+        Please contact NumPy maintainers and give detailed information about your \
+        compiler and platform
+#endif
+typedef struct { npy_longdouble real, imag; } npy_clongdouble;
+
+/*
+ * numarray-style bit-width typedefs
+ */
+#define NPY_MAX_INT8 127
+#define NPY_MIN_INT8 -128
+#define NPY_MAX_UINT8 255
+#define NPY_MAX_INT16 32767
+#define NPY_MIN_INT16 -32768
+#define NPY_MAX_UINT16 65535
+#define NPY_MAX_INT32 2147483647
+#define NPY_MIN_INT32 (-NPY_MAX_INT32 - 1)
+#define NPY_MAX_UINT32 4294967295U
+#define NPY_MAX_INT64 NPY_LONGLONG_SUFFIX(9223372036854775807)
+#define NPY_MIN_INT64 (-NPY_MAX_INT64 - NPY_LONGLONG_SUFFIX(1))
+#define NPY_MAX_UINT64 NPY_ULONGLONG_SUFFIX(18446744073709551615)
+#define NPY_MAX_INT128 NPY_LONGLONG_SUFFIX(85070591730234615865843651857942052864)
+#define NPY_MIN_INT128 (-NPY_MAX_INT128 - NPY_LONGLONG_SUFFIX(1))
+#define NPY_MAX_UINT128 NPY_ULONGLONG_SUFFIX(170141183460469231731687303715884105728)
+#define NPY_MAX_INT256 NPY_LONGLONG_SUFFIX(57896044618658097711785492504343953926634992332820282019728792003956564819967)
+#define NPY_MIN_INT256 (-NPY_MAX_INT256 - NPY_LONGLONG_SUFFIX(1))
+#define NPY_MAX_UINT256 NPY_ULONGLONG_SUFFIX(115792089237316195423570985008687907853269984665640564039457584007913129639935)
+#define NPY_MIN_DATETIME NPY_MIN_INT64
+#define NPY_MAX_DATETIME NPY_MAX_INT64
+#define NPY_MIN_TIMEDELTA NPY_MIN_INT64
+#define NPY_MAX_TIMEDELTA NPY_MAX_INT64
+
+        /* Need to find the number of bits for each type and
+           make definitions accordingly.
+
+           C states that sizeof(char) == 1 by definition
+
+           So, just using the sizeof keyword won't help.
+
+           It also looks like Python itself uses sizeof(char) quite a
+           bit, which by definition should be 1 all the time.
+
+           Idea: Make Use of CHAR_BIT which should tell us how many
+           BITS per CHARACTER
+        */
+
+        /* Include platform definitions -- These are in the C89/90 standard */
+#include <limits.h>
+#define NPY_MAX_BYTE SCHAR_MAX
+#define NPY_MIN_BYTE SCHAR_MIN
+#define NPY_MAX_UBYTE UCHAR_MAX
+#define NPY_MAX_SHORT SHRT_MAX
+#define NPY_MIN_SHORT SHRT_MIN
+#define NPY_MAX_USHORT USHRT_MAX
+#define NPY_MAX_INT   INT_MAX
+#ifndef INT_MIN
+#define INT_MIN (-INT_MAX - 1)
+#endif
+#define NPY_MIN_INT   INT_MIN
+#define NPY_MAX_UINT  UINT_MAX
+#define NPY_MAX_LONG  LONG_MAX
+#define NPY_MIN_LONG  LONG_MIN
+#define NPY_MAX_ULONG  ULONG_MAX
+
+#define NPY_BITSOF_BOOL (sizeof(npy_bool) * CHAR_BIT)
+#define NPY_BITSOF_CHAR CHAR_BIT
+#define NPY_BITSOF_BYTE (NPY_SIZEOF_BYTE * CHAR_BIT)
+#define NPY_BITSOF_SHORT (NPY_SIZEOF_SHORT * CHAR_BIT)
+#define NPY_BITSOF_INT (NPY_SIZEOF_INT * CHAR_BIT)
+#define NPY_BITSOF_LONG (NPY_SIZEOF_LONG * CHAR_BIT)
+#define NPY_BITSOF_LONGLONG (NPY_SIZEOF_LONGLONG * CHAR_BIT)
+#define NPY_BITSOF_INTP (NPY_SIZEOF_INTP * CHAR_BIT)
+#define NPY_BITSOF_HALF (NPY_SIZEOF_HALF * CHAR_BIT)
+#define NPY_BITSOF_FLOAT (NPY_SIZEOF_FLOAT * CHAR_BIT)
+#define NPY_BITSOF_DOUBLE (NPY_SIZEOF_DOUBLE * CHAR_BIT)
+#define NPY_BITSOF_LONGDOUBLE (NPY_SIZEOF_LONGDOUBLE * CHAR_BIT)
+#define NPY_BITSOF_CFLOAT (NPY_SIZEOF_CFLOAT * CHAR_BIT)
+#define NPY_BITSOF_CDOUBLE (NPY_SIZEOF_CDOUBLE * CHAR_BIT)
+#define NPY_BITSOF_CLONGDOUBLE (NPY_SIZEOF_CLONGDOUBLE * CHAR_BIT)
+#define NPY_BITSOF_DATETIME (NPY_SIZEOF_DATETIME * CHAR_BIT)
+#define NPY_BITSOF_TIMEDELTA (NPY_SIZEOF_TIMEDELTA * CHAR_BIT)
+
+#if NPY_BITSOF_LONG == 8
+#define NPY_INT8 NPY_LONG
+#define NPY_UINT8 NPY_ULONG
+        typedef long npy_int8;
+        typedef unsigned long npy_uint8;
+#define PyInt8ScalarObject PyLongScalarObject
+#define PyInt8ArrType_Type PyLongArrType_Type
+#define PyUInt8ScalarObject PyULongScalarObject
+#define PyUInt8ArrType_Type PyULongArrType_Type
+#define NPY_INT8_FMT NPY_LONG_FMT
+#define NPY_UINT8_FMT NPY_ULONG_FMT
+#elif NPY_BITSOF_LONG == 16
+#define NPY_INT16 NPY_LONG
+#define NPY_UINT16 NPY_ULONG
+        typedef long npy_int16;
+        typedef unsigned long npy_uint16;
+#define PyInt16ScalarObject PyLongScalarObject
+#define PyInt16ArrType_Type PyLongArrType_Type
+#define PyUInt16ScalarObject PyULongScalarObject
+#define PyUInt16ArrType_Type PyULongArrType_Type
+#define NPY_INT16_FMT NPY_LONG_FMT
+#define NPY_UINT16_FMT NPY_ULONG_FMT
+#elif NPY_BITSOF_LONG == 32
+#define NPY_INT32 NPY_LONG
+#define NPY_UINT32 NPY_ULONG
+        typedef long npy_int32;
+        typedef unsigned long npy_uint32;
+        typedef unsigned long npy_ucs4;
+#define PyInt32ScalarObject PyLongScalarObject
+#define PyInt32ArrType_Type PyLongArrType_Type
+#define PyUInt32ScalarObject PyULongScalarObject
+#define PyUInt32ArrType_Type PyULongArrType_Type
+#define NPY_INT32_FMT NPY_LONG_FMT
+#define NPY_UINT32_FMT NPY_ULONG_FMT
+#elif NPY_BITSOF_LONG == 64
+#define NPY_INT64 NPY_LONG
+#define NPY_UINT64 NPY_ULONG
+        typedef long npy_int64;
+        typedef unsigned long npy_uint64;
+#define PyInt64ScalarObject PyLongScalarObject
+#define PyInt64ArrType_Type PyLongArrType_Type
+#define PyUInt64ScalarObject PyULongScalarObject
+#define PyUInt64ArrType_Type PyULongArrType_Type
+#define NPY_INT64_FMT NPY_LONG_FMT
+#define NPY_UINT64_FMT NPY_ULONG_FMT
+#define MyPyLong_FromInt64 PyLong_FromLong
+#define MyPyLong_AsInt64 PyLong_AsLong
+#elif NPY_BITSOF_LONG == 128
+#define NPY_INT128 NPY_LONG
+#define NPY_UINT128 NPY_ULONG
+        typedef long npy_int128;
+        typedef unsigned long npy_uint128;
+#define PyInt128ScalarObject PyLongScalarObject
+#define PyInt128ArrType_Type PyLongArrType_Type
+#define PyUInt128ScalarObject PyULongScalarObject
+#define PyUInt128ArrType_Type PyULongArrType_Type
+#define NPY_INT128_FMT NPY_LONG_FMT
+#define NPY_UINT128_FMT NPY_ULONG_FMT
+#endif
+
+#if NPY_BITSOF_LONGLONG == 8
+#  ifndef NPY_INT8
+#    define NPY_INT8 NPY_LONGLONG
+#    define NPY_UINT8 NPY_ULONGLONG
+        typedef npy_longlong npy_int8;
+        typedef npy_ulonglong npy_uint8;
+#    define PyInt8ScalarObject PyLongLongScalarObject
+#    define PyInt8ArrType_Type PyLongLongArrType_Type
+#    define PyUInt8ScalarObject PyULongLongScalarObject
+#    define PyUInt8ArrType_Type PyULongLongArrType_Type
+#define NPY_INT8_FMT NPY_LONGLONG_FMT
+#define NPY_UINT8_FMT NPY_ULONGLONG_FMT
+#  endif
+#  define NPY_MAX_LONGLONG NPY_MAX_INT8
+#  define NPY_MIN_LONGLONG NPY_MIN_INT8
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT8
+#elif NPY_BITSOF_LONGLONG == 16
+#  ifndef NPY_INT16
+#    define NPY_INT16 NPY_LONGLONG
+#    define NPY_UINT16 NPY_ULONGLONG
+        typedef npy_longlong npy_int16;
+        typedef npy_ulonglong npy_uint16;
+#    define PyInt16ScalarObject PyLongLongScalarObject
+#    define PyInt16ArrType_Type PyLongLongArrType_Type
+#    define PyUInt16ScalarObject PyULongLongScalarObject
+#    define PyUInt16ArrType_Type PyULongLongArrType_Type
+#define NPY_INT16_FMT NPY_LONGLONG_FMT
+#define NPY_UINT16_FMT NPY_ULONGLONG_FMT
+#  endif
+#  define NPY_MAX_LONGLONG NPY_MAX_INT16
+#  define NPY_MIN_LONGLONG NPY_MIN_INT16
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT16
+#elif NPY_BITSOF_LONGLONG == 32
+#  ifndef NPY_INT32
+#    define NPY_INT32 NPY_LONGLONG
+#    define NPY_UINT32 NPY_ULONGLONG
+        typedef npy_longlong npy_int32;
+        typedef npy_ulonglong npy_uint32;
+        typedef npy_ulonglong npy_ucs4;
+#    define PyInt32ScalarObject PyLongLongScalarObject
+#    define PyInt32ArrType_Type PyLongLongArrType_Type
+#    define PyUInt32ScalarObject PyULongLongScalarObject
+#    define PyUInt32ArrType_Type PyULongLongArrType_Type
+#define NPY_INT32_FMT NPY_LONGLONG_FMT
+#define NPY_UINT32_FMT NPY_ULONGLONG_FMT
+#  endif
+#  define NPY_MAX_LONGLONG NPY_MAX_INT32
+#  define NPY_MIN_LONGLONG NPY_MIN_INT32
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT32
+#elif NPY_BITSOF_LONGLONG == 64
+#  ifndef NPY_INT64
+#    define NPY_INT64 NPY_LONGLONG
+#    define NPY_UINT64 NPY_ULONGLONG
+        typedef npy_longlong npy_int64;
+        typedef npy_ulonglong npy_uint64;
+#    define PyInt64ScalarObject PyLongLongScalarObject
+#    define PyInt64ArrType_Type PyLongLongArrType_Type
+#    define PyUInt64ScalarObject PyULongLongScalarObject
+#    define PyUInt64ArrType_Type PyULongLongArrType_Type
+#define NPY_INT64_FMT NPY_LONGLONG_FMT
+#define NPY_UINT64_FMT NPY_ULONGLONG_FMT
+#    define MyPyLong_FromInt64 PyLong_FromLongLong
+#    define MyPyLong_AsInt64 PyLong_AsLongLong
+#  endif
+#  define NPY_MAX_LONGLONG NPY_MAX_INT64
+#  define NPY_MIN_LONGLONG NPY_MIN_INT64
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT64
+#elif NPY_BITSOF_LONGLONG == 128
+#  ifndef NPY_INT128
+#    define NPY_INT128 NPY_LONGLONG
+#    define NPY_UINT128 NPY_ULONGLONG
+        typedef npy_longlong npy_int128;
+        typedef npy_ulonglong npy_uint128;
+#    define PyInt128ScalarObject PyLongLongScalarObject
+#    define PyInt128ArrType_Type PyLongLongArrType_Type
+#    define PyUInt128ScalarObject PyULongLongScalarObject
+#    define PyUInt128ArrType_Type PyULongLongArrType_Type
+#define NPY_INT128_FMT NPY_LONGLONG_FMT
+#define NPY_UINT128_FMT NPY_ULONGLONG_FMT
+#  endif
+#  define NPY_MAX_LONGLONG NPY_MAX_INT128
+#  define NPY_MIN_LONGLONG NPY_MIN_INT128
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT128
+#elif NPY_BITSOF_LONGLONG == 256
+#  define NPY_INT256 NPY_LONGLONG
+#  define NPY_UINT256 NPY_ULONGLONG
+        typedef npy_longlong npy_int256;
+        typedef npy_ulonglong npy_uint256;
+#  define PyInt256ScalarObject PyLongLongScalarObject
+#  define PyInt256ArrType_Type PyLongLongArrType_Type
+#  define PyUInt256ScalarObject PyULongLongScalarObject
+#  define PyUInt256ArrType_Type PyULongLongArrType_Type
+#define NPY_INT256_FMT NPY_LONGLONG_FMT
+#define NPY_UINT256_FMT NPY_ULONGLONG_FMT
+#  define NPY_MAX_LONGLONG NPY_MAX_INT256
+#  define NPY_MIN_LONGLONG NPY_MIN_INT256
+#  define NPY_MAX_ULONGLONG NPY_MAX_UINT256
+#endif
+
+#if NPY_BITSOF_INT == 8
+#ifndef NPY_INT8
+#define NPY_INT8 NPY_INT
+#define NPY_UINT8 NPY_UINT
+        typedef int npy_int8;
+        typedef unsigned int npy_uint8;
+#    define PyInt8ScalarObject PyIntScalarObject
+#    define PyInt8ArrType_Type PyIntArrType_Type
+#    define PyUInt8ScalarObject PyUIntScalarObject
+#    define PyUInt8ArrType_Type PyUIntArrType_Type
+#define NPY_INT8_FMT NPY_INT_FMT
+#define NPY_UINT8_FMT NPY_UINT_FMT
+#endif
+#elif NPY_BITSOF_INT == 16
+#ifndef NPY_INT16
+#define NPY_INT16 NPY_INT
+#define NPY_UINT16 NPY_UINT
+        typedef int npy_int16;
+        typedef unsigned int npy_uint16;
+#    define PyInt16ScalarObject PyIntScalarObject
+#    define PyInt16ArrType_Type PyIntArrType_Type
+#    define PyUInt16ScalarObject PyIntUScalarObject
+#    define PyUInt16ArrType_Type PyIntUArrType_Type
+#define NPY_INT16_FMT NPY_INT_FMT
+#define NPY_UINT16_FMT NPY_UINT_FMT
+#endif
+#elif NPY_BITSOF_INT == 32
+#ifndef NPY_INT32
+#define NPY_INT32 NPY_INT
+#define NPY_UINT32 NPY_UINT
+        typedef int npy_int32;
+        typedef unsigned int npy_uint32;
+        typedef unsigned int npy_ucs4;
+#    define PyInt32ScalarObject PyIntScalarObject
+#    define PyInt32ArrType_Type PyIntArrType_Type
+#    define PyUInt32ScalarObject PyUIntScalarObject
+#    define PyUInt32ArrType_Type PyUIntArrType_Type
+#define NPY_INT32_FMT NPY_INT_FMT
+#define NPY_UINT32_FMT NPY_UINT_FMT
+#endif
+#elif NPY_BITSOF_INT == 64
+#ifndef NPY_INT64
+#define NPY_INT64 NPY_INT
+#define NPY_UINT64 NPY_UINT
+        typedef int npy_int64;
+        typedef unsigned int npy_uint64;
+#    define PyInt64ScalarObject PyIntScalarObject
+#    define PyInt64ArrType_Type PyIntArrType_Type
+#    define PyUInt64ScalarObject PyUIntScalarObject
+#    define PyUInt64ArrType_Type PyUIntArrType_Type
+#define NPY_INT64_FMT NPY_INT_FMT
+#define NPY_UINT64_FMT NPY_UINT_FMT
+#    define MyPyLong_FromInt64 PyLong_FromLong
+#    define MyPyLong_AsInt64 PyLong_AsLong
+#endif
+#elif NPY_BITSOF_INT == 128
+#ifndef NPY_INT128
+#define NPY_INT128 NPY_INT
+#define NPY_UINT128 NPY_UINT
+        typedef int npy_int128;
+        typedef unsigned int npy_uint128;
+#    define PyInt128ScalarObject PyIntScalarObject
+#    define PyInt128ArrType_Type PyIntArrType_Type
+#    define PyUInt128ScalarObject PyUIntScalarObject
+#    define PyUInt128ArrType_Type PyUIntArrType_Type
+#define NPY_INT128_FMT NPY_INT_FMT
+#define NPY_UINT128_FMT NPY_UINT_FMT
+#endif
+#endif
+
+#if NPY_BITSOF_SHORT == 8
+#ifndef NPY_INT8
+#define NPY_INT8 NPY_SHORT
+#define NPY_UINT8 NPY_USHORT
+        typedef short npy_int8;
+        typedef unsigned short npy_uint8;
+#    define PyInt8ScalarObject PyShortScalarObject
+#    define PyInt8ArrType_Type PyShortArrType_Type
+#    define PyUInt8ScalarObject PyUShortScalarObject
+#    define PyUInt8ArrType_Type PyUShortArrType_Type
+#define NPY_INT8_FMT NPY_SHORT_FMT
+#define NPY_UINT8_FMT NPY_USHORT_FMT
+#endif
+#elif NPY_BITSOF_SHORT == 16
+#ifndef NPY_INT16
+#define NPY_INT16 NPY_SHORT
+#define NPY_UINT16 NPY_USHORT
+        typedef short npy_int16;
+        typedef unsigned short npy_uint16;
+#    define PyInt16ScalarObject PyShortScalarObject
+#    define PyInt16ArrType_Type PyShortArrType_Type
+#    define PyUInt16ScalarObject PyUShortScalarObject
+#    define PyUInt16ArrType_Type PyUShortArrType_Type
+#define NPY_INT16_FMT NPY_SHORT_FMT
+#define NPY_UINT16_FMT NPY_USHORT_FMT
+#endif
+#elif NPY_BITSOF_SHORT == 32
+#ifndef NPY_INT32
+#define NPY_INT32 NPY_SHORT
+#define NPY_UINT32 NPY_USHORT
+        typedef short npy_int32;
+        typedef unsigned short npy_uint32;
+        typedef unsigned short npy_ucs4;
+#    define PyInt32ScalarObject PyShortScalarObject
+#    define PyInt32ArrType_Type PyShortArrType_Type
+#    define PyUInt32ScalarObject PyUShortScalarObject
+#    define PyUInt32ArrType_Type PyUShortArrType_Type
+#define NPY_INT32_FMT NPY_SHORT_FMT
+#define NPY_UINT32_FMT NPY_USHORT_FMT
+#endif
+#elif NPY_BITSOF_SHORT == 64
+#ifndef NPY_INT64
+#define NPY_INT64 NPY_SHORT
+#define NPY_UINT64 NPY_USHORT
+        typedef short npy_int64;
+        typedef unsigned short npy_uint64;
+#    define PyInt64ScalarObject PyShortScalarObject
+#    define PyInt64ArrType_Type PyShortArrType_Type
+#    define PyUInt64ScalarObject PyUShortScalarObject
+#    define PyUInt64ArrType_Type PyUShortArrType_Type
+#define NPY_INT64_FMT NPY_SHORT_FMT
+#define NPY_UINT64_FMT NPY_USHORT_FMT
+#    define MyPyLong_FromInt64 PyLong_FromLong
+#    define MyPyLong_AsInt64 PyLong_AsLong
+#endif
+#elif NPY_BITSOF_SHORT == 128
+#ifndef NPY_INT128
+#define NPY_INT128 NPY_SHORT
+#define NPY_UINT128 NPY_USHORT
+        typedef short npy_int128;
+        typedef unsigned short npy_uint128;
+#    define PyInt128ScalarObject PyShortScalarObject
+#    define PyInt128ArrType_Type PyShortArrType_Type
+#    define PyUInt128ScalarObject PyUShortScalarObject
+#    define PyUInt128ArrType_Type PyUShortArrType_Type
+#define NPY_INT128_FMT NPY_SHORT_FMT
+#define NPY_UINT128_FMT NPY_USHORT_FMT
+#endif
+#endif
+
+
+#if NPY_BITSOF_CHAR == 8
+#ifndef NPY_INT8
+#define NPY_INT8 NPY_BYTE
+#define NPY_UINT8 NPY_UBYTE
+        typedef signed char npy_int8;
+        typedef unsigned char npy_uint8;
+#    define PyInt8ScalarObject PyByteScalarObject
+#    define PyInt8ArrType_Type PyByteArrType_Type
+#    define PyUInt8ScalarObject PyUByteScalarObject
+#    define PyUInt8ArrType_Type PyUByteArrType_Type
+#define NPY_INT8_FMT NPY_BYTE_FMT
+#define NPY_UINT8_FMT NPY_UBYTE_FMT
+#endif
+#elif NPY_BITSOF_CHAR == 16
+#ifndef NPY_INT16
+#define NPY_INT16 NPY_BYTE
+#define NPY_UINT16 NPY_UBYTE
+        typedef signed char npy_int16;
+        typedef unsigned char npy_uint16;
+#    define PyInt16ScalarObject PyByteScalarObject
+#    define PyInt16ArrType_Type PyByteArrType_Type
+#    define PyUInt16ScalarObject PyUByteScalarObject
+#    define PyUInt16ArrType_Type PyUByteArrType_Type
+#define NPY_INT16_FMT NPY_BYTE_FMT
+#define NPY_UINT16_FMT NPY_UBYTE_FMT
+#endif
+#elif NPY_BITSOF_CHAR == 32
+#ifndef NPY_INT32
+#define NPY_INT32 NPY_BYTE
+#define NPY_UINT32 NPY_UBYTE
+        typedef signed char npy_int32;
+        typedef unsigned char npy_uint32;
+        typedef unsigned char npy_ucs4;
+#    define PyInt32ScalarObject PyByteScalarObject
+#    define PyInt32ArrType_Type PyByteArrType_Type
+#    define PyUInt32ScalarObject PyUByteScalarObject
+#    define PyUInt32ArrType_Type PyUByteArrType_Type
+#define NPY_INT32_FMT NPY_BYTE_FMT
+#define NPY_UINT32_FMT NPY_UBYTE_FMT
+#endif
+#elif NPY_BITSOF_CHAR == 64
+#ifndef NPY_INT64
+#define NPY_INT64 NPY_BYTE
+#define NPY_UINT64 NPY_UBYTE
+        typedef signed char npy_int64;
+        typedef unsigned char npy_uint64;
+#    define PyInt64ScalarObject PyByteScalarObject
+#    define PyInt64ArrType_Type PyByteArrType_Type
+#    define PyUInt64ScalarObject PyUByteScalarObject
+#    define PyUInt64ArrType_Type PyUByteArrType_Type
+#define NPY_INT64_FMT NPY_BYTE_FMT
+#define NPY_UINT64_FMT NPY_UBYTE_FMT
+#    define MyPyLong_FromInt64 PyLong_FromLong
+#    define MyPyLong_AsInt64 PyLong_AsLong
+#endif
+#elif NPY_BITSOF_CHAR == 128
+#ifndef NPY_INT128
+#define NPY_INT128 NPY_BYTE
+#define NPY_UINT128 NPY_UBYTE
+        typedef signed char npy_int128;
+        typedef unsigned char npy_uint128;
+#    define PyInt128ScalarObject PyByteScalarObject
+#    define PyInt128ArrType_Type PyByteArrType_Type
+#    define PyUInt128ScalarObject PyUByteScalarObject
+#    define PyUInt128ArrType_Type PyUByteArrType_Type
+#define NPY_INT128_FMT NPY_BYTE_FMT
+#define NPY_UINT128_FMT NPY_UBYTE_FMT
+#endif
+#endif
+
+
+
+#if NPY_BITSOF_DOUBLE == 32
+#ifndef NPY_FLOAT32
+#define NPY_FLOAT32 NPY_DOUBLE
+#define NPY_COMPLEX64 NPY_CDOUBLE
+        typedef double npy_float32;
+        typedef npy_cdouble npy_complex64;
+#    define PyFloat32ScalarObject PyDoubleScalarObject
+#    define PyComplex64ScalarObject PyCDoubleScalarObject
+#    define PyFloat32ArrType_Type PyDoubleArrType_Type
+#    define PyComplex64ArrType_Type PyCDoubleArrType_Type
+#define NPY_FLOAT32_FMT NPY_DOUBLE_FMT
+#define NPY_COMPLEX64_FMT NPY_CDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_DOUBLE == 64
+#ifndef NPY_FLOAT64
+#define NPY_FLOAT64 NPY_DOUBLE
+#define NPY_COMPLEX128 NPY_CDOUBLE
+        typedef double npy_float64;
+        typedef npy_cdouble npy_complex128;
+#    define PyFloat64ScalarObject PyDoubleScalarObject
+#    define PyComplex128ScalarObject PyCDoubleScalarObject
+#    define PyFloat64ArrType_Type PyDoubleArrType_Type
+#    define PyComplex128ArrType_Type PyCDoubleArrType_Type
+#define NPY_FLOAT64_FMT NPY_DOUBLE_FMT
+#define NPY_COMPLEX128_FMT NPY_CDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_DOUBLE == 80
+#ifndef NPY_FLOAT80
+#define NPY_FLOAT80 NPY_DOUBLE
+#define NPY_COMPLEX160 NPY_CDOUBLE
+        typedef double npy_float80;
+        typedef npy_cdouble npy_complex160;
+#    define PyFloat80ScalarObject PyDoubleScalarObject
+#    define PyComplex160ScalarObject PyCDoubleScalarObject
+#    define PyFloat80ArrType_Type PyDoubleArrType_Type
+#    define PyComplex160ArrType_Type PyCDoubleArrType_Type
+#define NPY_FLOAT80_FMT NPY_DOUBLE_FMT
+#define NPY_COMPLEX160_FMT NPY_CDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_DOUBLE == 96
+#ifndef NPY_FLOAT96
+#define NPY_FLOAT96 NPY_DOUBLE
+#define NPY_COMPLEX192 NPY_CDOUBLE
+        typedef double npy_float96;
+        typedef npy_cdouble npy_complex192;
+#    define PyFloat96ScalarObject PyDoubleScalarObject
+#    define PyComplex192ScalarObject PyCDoubleScalarObject
+#    define PyFloat96ArrType_Type PyDoubleArrType_Type
+#    define PyComplex192ArrType_Type PyCDoubleArrType_Type
+#define NPY_FLOAT96_FMT NPY_DOUBLE_FMT
+#define NPY_COMPLEX192_FMT NPY_CDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_DOUBLE == 128
+#ifndef NPY_FLOAT128
+#define NPY_FLOAT128 NPY_DOUBLE
+#define NPY_COMPLEX256 NPY_CDOUBLE
+        typedef double npy_float128;
+        typedef npy_cdouble npy_complex256;
+#    define PyFloat128ScalarObject PyDoubleScalarObject
+#    define PyComplex256ScalarObject PyCDoubleScalarObject
+#    define PyFloat128ArrType_Type PyDoubleArrType_Type
+#    define PyComplex256ArrType_Type PyCDoubleArrType_Type
+#define NPY_FLOAT128_FMT NPY_DOUBLE_FMT
+#define NPY_COMPLEX256_FMT NPY_CDOUBLE_FMT
+#endif
+#endif
+
+
+
+#if NPY_BITSOF_FLOAT == 32
+#ifndef NPY_FLOAT32
+#define NPY_FLOAT32 NPY_FLOAT
+#define NPY_COMPLEX64 NPY_CFLOAT
+        typedef float npy_float32;
+        typedef npy_cfloat npy_complex64;
+#    define PyFloat32ScalarObject PyFloatScalarObject
+#    define PyComplex64ScalarObject PyCFloatScalarObject
+#    define PyFloat32ArrType_Type PyFloatArrType_Type
+#    define PyComplex64ArrType_Type PyCFloatArrType_Type
+#define NPY_FLOAT32_FMT NPY_FLOAT_FMT
+#define NPY_COMPLEX64_FMT NPY_CFLOAT_FMT
+#endif
+#elif NPY_BITSOF_FLOAT == 64
+#ifndef NPY_FLOAT64
+#define NPY_FLOAT64 NPY_FLOAT
+#define NPY_COMPLEX128 NPY_CFLOAT
+        typedef float npy_float64;
+        typedef npy_cfloat npy_complex128;
+#    define PyFloat64ScalarObject PyFloatScalarObject
+#    define PyComplex128ScalarObject PyCFloatScalarObject
+#    define PyFloat64ArrType_Type PyFloatArrType_Type
+#    define PyComplex128ArrType_Type PyCFloatArrType_Type
+#define NPY_FLOAT64_FMT NPY_FLOAT_FMT
+#define NPY_COMPLEX128_FMT NPY_CFLOAT_FMT
+#endif
+#elif NPY_BITSOF_FLOAT == 80
+#ifndef NPY_FLOAT80
+#define NPY_FLOAT80 NPY_FLOAT
+#define NPY_COMPLEX160 NPY_CFLOAT
+        typedef float npy_float80;
+        typedef npy_cfloat npy_complex160;
+#    define PyFloat80ScalarObject PyFloatScalarObject
+#    define PyComplex160ScalarObject PyCFloatScalarObject
+#    define PyFloat80ArrType_Type PyFloatArrType_Type
+#    define PyComplex160ArrType_Type PyCFloatArrType_Type
+#define NPY_FLOAT80_FMT NPY_FLOAT_FMT
+#define NPY_COMPLEX160_FMT NPY_CFLOAT_FMT
+#endif
+#elif NPY_BITSOF_FLOAT == 96
+#ifndef NPY_FLOAT96
+#define NPY_FLOAT96 NPY_FLOAT
+#define NPY_COMPLEX192 NPY_CFLOAT
+        typedef float npy_float96;
+        typedef npy_cfloat npy_complex192;
+#    define PyFloat96ScalarObject PyFloatScalarObject
+#    define PyComplex192ScalarObject PyCFloatScalarObject
+#    define PyFloat96ArrType_Type PyFloatArrType_Type
+#    define PyComplex192ArrType_Type PyCFloatArrType_Type
+#define NPY_FLOAT96_FMT NPY_FLOAT_FMT
+#define NPY_COMPLEX192_FMT NPY_CFLOAT_FMT
+#endif
+#elif NPY_BITSOF_FLOAT == 128
+#ifndef NPY_FLOAT128
+#define NPY_FLOAT128 NPY_FLOAT
+#define NPY_COMPLEX256 NPY_CFLOAT
+        typedef float npy_float128;
+        typedef npy_cfloat npy_complex256;
+#    define PyFloat128ScalarObject PyFloatScalarObject
+#    define PyComplex256ScalarObject PyCFloatScalarObject
+#    define PyFloat128ArrType_Type PyFloatArrType_Type
+#    define PyComplex256ArrType_Type PyCFloatArrType_Type
+#define NPY_FLOAT128_FMT NPY_FLOAT_FMT
+#define NPY_COMPLEX256_FMT NPY_CFLOAT_FMT
+#endif
+#endif
+
+/* half/float16 isn't a floating-point type in C */
+#define NPY_FLOAT16 NPY_HALF
+typedef npy_uint16 npy_half;
+typedef npy_half npy_float16;
+
+#if NPY_BITSOF_LONGDOUBLE == 32
+#ifndef NPY_FLOAT32
+#define NPY_FLOAT32 NPY_LONGDOUBLE
+#define NPY_COMPLEX64 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float32;
+        typedef npy_clongdouble npy_complex64;
+#    define PyFloat32ScalarObject PyLongDoubleScalarObject
+#    define PyComplex64ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat32ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex64ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT32_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX64_FMT NPY_CLONGDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_LONGDOUBLE == 64
+#ifndef NPY_FLOAT64
+#define NPY_FLOAT64 NPY_LONGDOUBLE
+#define NPY_COMPLEX128 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float64;
+        typedef npy_clongdouble npy_complex128;
+#    define PyFloat64ScalarObject PyLongDoubleScalarObject
+#    define PyComplex128ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat64ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex128ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT64_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX128_FMT NPY_CLONGDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_LONGDOUBLE == 80
+#ifndef NPY_FLOAT80
+#define NPY_FLOAT80 NPY_LONGDOUBLE
+#define NPY_COMPLEX160 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float80;
+        typedef npy_clongdouble npy_complex160;
+#    define PyFloat80ScalarObject PyLongDoubleScalarObject
+#    define PyComplex160ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat80ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex160ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT80_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX160_FMT NPY_CLONGDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_LONGDOUBLE == 96
+#ifndef NPY_FLOAT96
+#define NPY_FLOAT96 NPY_LONGDOUBLE
+#define NPY_COMPLEX192 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float96;
+        typedef npy_clongdouble npy_complex192;
+#    define PyFloat96ScalarObject PyLongDoubleScalarObject
+#    define PyComplex192ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat96ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex192ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT96_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX192_FMT NPY_CLONGDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_LONGDOUBLE == 128
+#ifndef NPY_FLOAT128
+#define NPY_FLOAT128 NPY_LONGDOUBLE
+#define NPY_COMPLEX256 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float128;
+        typedef npy_clongdouble npy_complex256;
+#    define PyFloat128ScalarObject PyLongDoubleScalarObject
+#    define PyComplex256ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat128ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex256ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT128_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX256_FMT NPY_CLONGDOUBLE_FMT
+#endif
+#elif NPY_BITSOF_LONGDOUBLE == 256
+#define NPY_FLOAT256 NPY_LONGDOUBLE
+#define NPY_COMPLEX512 NPY_CLONGDOUBLE
+        typedef npy_longdouble npy_float256;
+        typedef npy_clongdouble npy_complex512;
+#    define PyFloat256ScalarObject PyLongDoubleScalarObject
+#    define PyComplex512ScalarObject PyCLongDoubleScalarObject
+#    define PyFloat256ArrType_Type PyLongDoubleArrType_Type
+#    define PyComplex512ArrType_Type PyCLongDoubleArrType_Type
+#define NPY_FLOAT256_FMT NPY_LONGDOUBLE_FMT
+#define NPY_COMPLEX512_FMT NPY_CLONGDOUBLE_FMT
+#endif
+
+/* datetime typedefs */
+typedef npy_int64 npy_timedelta;
+typedef npy_int64 npy_datetime;
+#define NPY_DATETIME_FMT NPY_INT64_FMT
+#define NPY_TIMEDELTA_FMT NPY_INT64_FMT
+
+/* End of typedefs for numarray style bit-width names */
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_cpu.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_cpu.h
new file mode 100644
index 000000000..509e23a51
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_cpu.h
@@ -0,0 +1,122 @@
+/*
+ * This set (target) cpu specific macros:
+ *      - Possible values:
+ *              NPY_CPU_X86
+ *              NPY_CPU_AMD64
+ *              NPY_CPU_PPC
+ *              NPY_CPU_PPC64
+ *              NPY_CPU_PPC64LE
+ *              NPY_CPU_SPARC
+ *              NPY_CPU_S390
+ *              NPY_CPU_IA64
+ *              NPY_CPU_HPPA
+ *              NPY_CPU_ALPHA
+ *              NPY_CPU_ARMEL
+ *              NPY_CPU_ARMEB
+ *              NPY_CPU_SH_LE
+ *              NPY_CPU_SH_BE
+ *              NPY_CPU_ARCEL
+ *              NPY_CPU_ARCEB
+ *              NPY_CPU_RISCV64
+ *              NPY_CPU_WASM
+ */
+#ifndef _NPY_CPUARCH_H_
+#define _NPY_CPUARCH_H_
+
+#include "numpyconfig.h"
+#include <string.h> /* for memcpy */
+
+#if defined( __i386__ ) || defined(i386) || defined(_M_IX86)
+    /*
+     * __i386__ is defined by gcc and Intel compiler on Linux,
+     * _M_IX86 by VS compiler,
+     * i386 by Sun compilers on opensolaris at least
+     */
+    #define NPY_CPU_X86
+#elif defined(__x86_64__) || defined(__amd64__) || defined(__x86_64) || defined(_M_AMD64)
+    /*
+     * both __x86_64__ and __amd64__ are defined by gcc
+     * __x86_64 defined by sun compiler on opensolaris at least
+     * _M_AMD64 defined by MS compiler
+     */
+    #define NPY_CPU_AMD64
+#elif defined(__powerpc64__) && defined(__LITTLE_ENDIAN__)
+    #define NPY_CPU_PPC64LE
+#elif defined(__powerpc64__) && defined(__BIG_ENDIAN__)
+    #define NPY_CPU_PPC64
+#elif defined(__ppc__) || defined(__powerpc__) || defined(_ARCH_PPC)
+    /*
+     * __ppc__ is defined by gcc, I remember having seen __powerpc__ once,
+     * but can't find it ATM
+     * _ARCH_PPC is used by at least gcc on AIX
+     * As __powerpc__ and _ARCH_PPC are also defined by PPC64 check
+     * for those specifically first before defaulting to ppc
+     */
+    #define NPY_CPU_PPC
+#elif defined(__sparc__) || defined(__sparc)
+    /* __sparc__ is defined by gcc and Forte (e.g. Sun) compilers */
+    #define NPY_CPU_SPARC
+#elif defined(__s390__)
+    #define NPY_CPU_S390
+#elif defined(__ia64)
+    #define NPY_CPU_IA64
+#elif defined(__hppa)
+    #define NPY_CPU_HPPA
+#elif defined(__alpha__)
+    #define NPY_CPU_ALPHA
+#elif defined(__arm__) || defined(__aarch64__)
+    #if defined(__ARMEB__) || defined(__AARCH64EB__)
+        #if defined(__ARM_32BIT_STATE)
+            #define NPY_CPU_ARMEB_AARCH32
+        #elif defined(__ARM_64BIT_STATE)
+            #define NPY_CPU_ARMEB_AARCH64
+        #else
+            #define NPY_CPU_ARMEB
+        #endif
+    #elif defined(__ARMEL__) || defined(__AARCH64EL__)
+        #if defined(__ARM_32BIT_STATE)
+            #define NPY_CPU_ARMEL_AARCH32
+        #elif defined(__ARM_64BIT_STATE)
+            #define NPY_CPU_ARMEL_AARCH64
+        #else
+            #define NPY_CPU_ARMEL
+        #endif
+    #else
+        # error Unknown ARM CPU, please report this to numpy maintainers with \
+	information about your platform (OS, CPU and compiler)
+    #endif
+#elif defined(__sh__) && defined(__LITTLE_ENDIAN__)
+    #define NPY_CPU_SH_LE
+#elif defined(__sh__) && defined(__BIG_ENDIAN__)
+    #define NPY_CPU_SH_BE
+#elif defined(__MIPSEL__)
+    #define NPY_CPU_MIPSEL
+#elif defined(__MIPSEB__)
+    #define NPY_CPU_MIPSEB
+#elif defined(__or1k__)
+    #define NPY_CPU_OR1K
+#elif defined(__mc68000__)
+    #define NPY_CPU_M68K
+#elif defined(__arc__) && defined(__LITTLE_ENDIAN__)
+    #define NPY_CPU_ARCEL
+#elif defined(__arc__) && defined(__BIG_ENDIAN__)
+    #define NPY_CPU_ARCEB
+#elif defined(__riscv) && defined(__riscv_xlen) && __riscv_xlen == 64
+    #define NPY_CPU_RISCV64
+#elif defined(__EMSCRIPTEN__)
+    /* __EMSCRIPTEN__ is defined by emscripten: an LLVM-to-Web compiler */
+    #define NPY_CPU_WASM
+#else
+    #error Unknown CPU, please report this to numpy maintainers with \
+    information about your platform (OS, CPU and compiler)
+#endif
+
+#define NPY_COPY_PYOBJECT_PTR(dst, src) memcpy(dst, src, sizeof(PyObject *))
+
+#if (defined(NPY_CPU_X86) || defined(NPY_CPU_AMD64))
+#define NPY_CPU_HAVE_UNALIGNED_ACCESS 1
+#else
+#define NPY_CPU_HAVE_UNALIGNED_ACCESS 0
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_endian.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_endian.h
new file mode 100644
index 000000000..aa367a002
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_endian.h
@@ -0,0 +1,73 @@
+#ifndef _NPY_ENDIAN_H_
+#define _NPY_ENDIAN_H_
+
+/*
+ * NPY_BYTE_ORDER is set to the same value as BYTE_ORDER set by glibc in
+ * endian.h
+ */
+
+#if defined(NPY_HAVE_ENDIAN_H) || defined(NPY_HAVE_SYS_ENDIAN_H)
+    /* Use endian.h if available */
+
+    #if defined(NPY_HAVE_ENDIAN_H)
+    #include <endian.h>
+    #elif defined(NPY_HAVE_SYS_ENDIAN_H)
+    #include <sys/endian.h>
+    #endif
+
+    #if defined(BYTE_ORDER) && defined(BIG_ENDIAN) && defined(LITTLE_ENDIAN)
+        #define NPY_BYTE_ORDER    BYTE_ORDER
+        #define NPY_LITTLE_ENDIAN LITTLE_ENDIAN
+        #define NPY_BIG_ENDIAN    BIG_ENDIAN
+    #elif defined(_BYTE_ORDER) && defined(_BIG_ENDIAN) && defined(_LITTLE_ENDIAN)
+        #define NPY_BYTE_ORDER    _BYTE_ORDER
+        #define NPY_LITTLE_ENDIAN _LITTLE_ENDIAN
+        #define NPY_BIG_ENDIAN    _BIG_ENDIAN
+    #elif defined(__BYTE_ORDER) && defined(__BIG_ENDIAN) && defined(__LITTLE_ENDIAN)
+        #define NPY_BYTE_ORDER    __BYTE_ORDER
+        #define NPY_LITTLE_ENDIAN __LITTLE_ENDIAN
+        #define NPY_BIG_ENDIAN    __BIG_ENDIAN
+    #endif
+#endif
+
+#ifndef NPY_BYTE_ORDER
+    /* Set endianness info using target CPU */
+    #include "npy_cpu.h"
+
+    #define NPY_LITTLE_ENDIAN 1234
+    #define NPY_BIG_ENDIAN 4321
+
+    #if defined(NPY_CPU_X86)                  \
+            || defined(NPY_CPU_AMD64)         \
+            || defined(NPY_CPU_IA64)          \
+            || defined(NPY_CPU_ALPHA)         \
+            || defined(NPY_CPU_ARMEL)         \
+            || defined(NPY_CPU_ARMEL_AARCH32) \
+            || defined(NPY_CPU_ARMEL_AARCH64) \
+            || defined(NPY_CPU_SH_LE)         \
+            || defined(NPY_CPU_MIPSEL)        \
+            || defined(NPY_CPU_PPC64LE)       \
+            || defined(NPY_CPU_ARCEL)         \
+            || defined(NPY_CPU_RISCV64)       \
+            || defined(NPY_CPU_WASM)
+        #define NPY_BYTE_ORDER NPY_LITTLE_ENDIAN
+    #elif defined(NPY_CPU_PPC)                \
+            || defined(NPY_CPU_SPARC)         \
+            || defined(NPY_CPU_S390)          \
+            || defined(NPY_CPU_HPPA)          \
+            || defined(NPY_CPU_PPC64)         \
+            || defined(NPY_CPU_ARMEB)         \
+            || defined(NPY_CPU_ARMEB_AARCH32) \
+            || defined(NPY_CPU_ARMEB_AARCH64) \
+            || defined(NPY_CPU_SH_BE)         \
+            || defined(NPY_CPU_MIPSEB)        \
+            || defined(NPY_CPU_OR1K)          \
+            || defined(NPY_CPU_M68K)          \
+            || defined(NPY_CPU_ARCEB)
+        #define NPY_BYTE_ORDER NPY_BIG_ENDIAN
+    #else
+        #error Unknown CPU: can not set endianness
+    #endif
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_interrupt.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_interrupt.h
new file mode 100644
index 000000000..bcb539326
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_interrupt.h
@@ -0,0 +1,56 @@
+/*
+ * This API is only provided because it is part of publicly exported
+ * headers. Its use is considered DEPRECATED, and it will be removed
+ * eventually.
+ * (This includes the _PyArray_SigintHandler and _PyArray_GetSigintBuf
+ * functions which are however, public API, and not headers.)
+ *
+ * Instead of using these non-threadsafe macros consider periodically
+ * querying `PyErr_CheckSignals()` or `PyOS_InterruptOccurred()` will work.
+ * Both of these require holding the GIL, although cpython could add a
+ * version of `PyOS_InterruptOccurred()` which does not. Such a version
+ * actually exists as private API in Python 3.10, and backported to 3.9 and 3.8,
+ * see also https://bugs.python.org/issue41037 and
+ * https://github.com/python/cpython/pull/20599).
+ */
+
+#ifndef NPY_INTERRUPT_H
+#define NPY_INTERRUPT_H
+
+#ifndef NPY_NO_SIGNAL
+
+#include <setjmp.h>
+#include <signal.h>
+
+#ifndef sigsetjmp
+
+#define NPY_SIGSETJMP(arg1, arg2) setjmp(arg1)
+#define NPY_SIGLONGJMP(arg1, arg2) longjmp(arg1, arg2)
+#define NPY_SIGJMP_BUF jmp_buf
+
+#else
+
+#define NPY_SIGSETJMP(arg1, arg2) sigsetjmp(arg1, arg2)
+#define NPY_SIGLONGJMP(arg1, arg2) siglongjmp(arg1, arg2)
+#define NPY_SIGJMP_BUF sigjmp_buf
+
+#endif
+
+#    define NPY_SIGINT_ON {                                             \
+                   PyOS_sighandler_t _npy_sig_save;                     \
+                   _npy_sig_save = PyOS_setsig(SIGINT, _PyArray_SigintHandler); \
+                   if (NPY_SIGSETJMP(*((NPY_SIGJMP_BUF *)_PyArray_GetSigintBuf()), \
+                                 1) == 0) {                             \
+
+#    define NPY_SIGINT_OFF }                                      \
+        PyOS_setsig(SIGINT, _npy_sig_save);                       \
+        }
+
+#else /* NPY_NO_SIGNAL  */
+
+#define NPY_SIGINT_ON
+#define NPY_SIGINT_OFF
+
+#endif /* HAVE_SIGSETJMP */
+
+#endif /* NPY_INTERRUPT_H */
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_math.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_math.h
new file mode 100644
index 000000000..a07f49501
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_math.h
@@ -0,0 +1,599 @@
+#ifndef __NPY_MATH_C99_H_
+#define __NPY_MATH_C99_H_
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <math.h>
+#ifdef __SUNPRO_CC
+#include <sunmath.h>
+#endif
+#ifdef HAVE_NPY_CONFIG_H
+#include <npy_config.h>
+#endif
+#include <numpy/npy_common.h>
+
+/* By adding static inline specifiers to npy_math function definitions when
+   appropriate, compiler is given the opportunity to optimize */
+#if NPY_INLINE_MATH
+#define NPY_INPLACE NPY_INLINE static
+#else
+#define NPY_INPLACE
+#endif
+
+
+/*
+ * NAN and INFINITY like macros (same behavior as glibc for NAN, same as C99
+ * for INFINITY)
+ *
+ * XXX: I should test whether INFINITY and NAN are available on the platform
+ */
+NPY_INLINE static float __npy_inff(void)
+{
+    const union { npy_uint32 __i; float __f;} __bint = {0x7f800000UL};
+    return __bint.__f;
+}
+
+NPY_INLINE static float __npy_nanf(void)
+{
+    const union { npy_uint32 __i; float __f;} __bint = {0x7fc00000UL};
+    return __bint.__f;
+}
+
+NPY_INLINE static float __npy_pzerof(void)
+{
+    const union { npy_uint32 __i; float __f;} __bint = {0x00000000UL};
+    return __bint.__f;
+}
+
+NPY_INLINE static float __npy_nzerof(void)
+{
+    const union { npy_uint32 __i; float __f;} __bint = {0x80000000UL};
+    return __bint.__f;
+}
+
+#define NPY_INFINITYF __npy_inff()
+#define NPY_NANF __npy_nanf()
+#define NPY_PZEROF __npy_pzerof()
+#define NPY_NZEROF __npy_nzerof()
+
+#define NPY_INFINITY ((npy_double)NPY_INFINITYF)
+#define NPY_NAN ((npy_double)NPY_NANF)
+#define NPY_PZERO ((npy_double)NPY_PZEROF)
+#define NPY_NZERO ((npy_double)NPY_NZEROF)
+
+#define NPY_INFINITYL ((npy_longdouble)NPY_INFINITYF)
+#define NPY_NANL ((npy_longdouble)NPY_NANF)
+#define NPY_PZEROL ((npy_longdouble)NPY_PZEROF)
+#define NPY_NZEROL ((npy_longdouble)NPY_NZEROF)
+
+/*
+ * Useful constants
+ */
+#define NPY_E         2.718281828459045235360287471352662498  /* e */
+#define NPY_LOG2E     1.442695040888963407359924681001892137  /* log_2 e */
+#define NPY_LOG10E    0.434294481903251827651128918916605082  /* log_10 e */
+#define NPY_LOGE2     0.693147180559945309417232121458176568  /* log_e 2 */
+#define NPY_LOGE10    2.302585092994045684017991454684364208  /* log_e 10 */
+#define NPY_PI        3.141592653589793238462643383279502884  /* pi */
+#define NPY_PI_2      1.570796326794896619231321691639751442  /* pi/2 */
+#define NPY_PI_4      0.785398163397448309615660845819875721  /* pi/4 */
+#define NPY_1_PI      0.318309886183790671537767526745028724  /* 1/pi */
+#define NPY_2_PI      0.636619772367581343075535053490057448  /* 2/pi */
+#define NPY_EULER     0.577215664901532860606512090082402431  /* Euler constant */
+#define NPY_SQRT2     1.414213562373095048801688724209698079  /* sqrt(2) */
+#define NPY_SQRT1_2   0.707106781186547524400844362104849039  /* 1/sqrt(2) */
+
+#define NPY_Ef        2.718281828459045235360287471352662498F /* e */
+#define NPY_LOG2Ef    1.442695040888963407359924681001892137F /* log_2 e */
+#define NPY_LOG10Ef   0.434294481903251827651128918916605082F /* log_10 e */
+#define NPY_LOGE2f    0.693147180559945309417232121458176568F /* log_e 2 */
+#define NPY_LOGE10f   2.302585092994045684017991454684364208F /* log_e 10 */
+#define NPY_PIf       3.141592653589793238462643383279502884F /* pi */
+#define NPY_PI_2f     1.570796326794896619231321691639751442F /* pi/2 */
+#define NPY_PI_4f     0.785398163397448309615660845819875721F /* pi/4 */
+#define NPY_1_PIf     0.318309886183790671537767526745028724F /* 1/pi */
+#define NPY_2_PIf     0.636619772367581343075535053490057448F /* 2/pi */
+#define NPY_EULERf    0.577215664901532860606512090082402431F /* Euler constant */
+#define NPY_SQRT2f    1.414213562373095048801688724209698079F /* sqrt(2) */
+#define NPY_SQRT1_2f  0.707106781186547524400844362104849039F /* 1/sqrt(2) */
+
+#define NPY_El        2.718281828459045235360287471352662498L /* e */
+#define NPY_LOG2El    1.442695040888963407359924681001892137L /* log_2 e */
+#define NPY_LOG10El   0.434294481903251827651128918916605082L /* log_10 e */
+#define NPY_LOGE2l    0.693147180559945309417232121458176568L /* log_e 2 */
+#define NPY_LOGE10l   2.302585092994045684017991454684364208L /* log_e 10 */
+#define NPY_PIl       3.141592653589793238462643383279502884L /* pi */
+#define NPY_PI_2l     1.570796326794896619231321691639751442L /* pi/2 */
+#define NPY_PI_4l     0.785398163397448309615660845819875721L /* pi/4 */
+#define NPY_1_PIl     0.318309886183790671537767526745028724L /* 1/pi */
+#define NPY_2_PIl     0.636619772367581343075535053490057448L /* 2/pi */
+#define NPY_EULERl    0.577215664901532860606512090082402431L /* Euler constant */
+#define NPY_SQRT2l    1.414213562373095048801688724209698079L /* sqrt(2) */
+#define NPY_SQRT1_2l  0.707106781186547524400844362104849039L /* 1/sqrt(2) */
+
+/*
+ * Integer functions.
+ */
+NPY_INPLACE npy_uint npy_gcdu(npy_uint a, npy_uint b);
+NPY_INPLACE npy_uint npy_lcmu(npy_uint a, npy_uint b);
+NPY_INPLACE npy_ulong npy_gcdul(npy_ulong a, npy_ulong b);
+NPY_INPLACE npy_ulong npy_lcmul(npy_ulong a, npy_ulong b);
+NPY_INPLACE npy_ulonglong npy_gcdull(npy_ulonglong a, npy_ulonglong b);
+NPY_INPLACE npy_ulonglong npy_lcmull(npy_ulonglong a, npy_ulonglong b);
+
+NPY_INPLACE npy_int npy_gcd(npy_int a, npy_int b);
+NPY_INPLACE npy_int npy_lcm(npy_int a, npy_int b);
+NPY_INPLACE npy_long npy_gcdl(npy_long a, npy_long b);
+NPY_INPLACE npy_long npy_lcml(npy_long a, npy_long b);
+NPY_INPLACE npy_longlong npy_gcdll(npy_longlong a, npy_longlong b);
+NPY_INPLACE npy_longlong npy_lcmll(npy_longlong a, npy_longlong b);
+
+NPY_INPLACE npy_ubyte npy_rshiftuhh(npy_ubyte a, npy_ubyte b);
+NPY_INPLACE npy_ubyte npy_lshiftuhh(npy_ubyte a, npy_ubyte b);
+NPY_INPLACE npy_ushort npy_rshiftuh(npy_ushort a, npy_ushort b);
+NPY_INPLACE npy_ushort npy_lshiftuh(npy_ushort a, npy_ushort b);
+NPY_INPLACE npy_uint npy_rshiftu(npy_uint a, npy_uint b);
+NPY_INPLACE npy_uint npy_lshiftu(npy_uint a, npy_uint b);
+NPY_INPLACE npy_ulong npy_rshiftul(npy_ulong a, npy_ulong b);
+NPY_INPLACE npy_ulong npy_lshiftul(npy_ulong a, npy_ulong b);
+NPY_INPLACE npy_ulonglong npy_rshiftull(npy_ulonglong a, npy_ulonglong b);
+NPY_INPLACE npy_ulonglong npy_lshiftull(npy_ulonglong a, npy_ulonglong b);
+
+NPY_INPLACE npy_byte npy_rshifthh(npy_byte a, npy_byte b);
+NPY_INPLACE npy_byte npy_lshifthh(npy_byte a, npy_byte b);
+NPY_INPLACE npy_short npy_rshifth(npy_short a, npy_short b);
+NPY_INPLACE npy_short npy_lshifth(npy_short a, npy_short b);
+NPY_INPLACE npy_int npy_rshift(npy_int a, npy_int b);
+NPY_INPLACE npy_int npy_lshift(npy_int a, npy_int b);
+NPY_INPLACE npy_long npy_rshiftl(npy_long a, npy_long b);
+NPY_INPLACE npy_long npy_lshiftl(npy_long a, npy_long b);
+NPY_INPLACE npy_longlong npy_rshiftll(npy_longlong a, npy_longlong b);
+NPY_INPLACE npy_longlong npy_lshiftll(npy_longlong a, npy_longlong b);
+
+/*
+ * avx function has a common API for both sin & cos. This enum is used to
+ * distinguish between the two
+ */
+typedef enum {
+    npy_compute_sin,
+    npy_compute_cos
+} NPY_TRIG_OP;
+
+/*
+ * C99 double math funcs
+ */
+NPY_INPLACE double npy_sin(double x);
+NPY_INPLACE double npy_cos(double x);
+NPY_INPLACE double npy_tan(double x);
+NPY_INPLACE double npy_sinh(double x);
+NPY_INPLACE double npy_cosh(double x);
+NPY_INPLACE double npy_tanh(double x);
+
+NPY_INPLACE double npy_asin(double x);
+NPY_INPLACE double npy_acos(double x);
+NPY_INPLACE double npy_atan(double x);
+
+NPY_INPLACE double npy_log(double x);
+NPY_INPLACE double npy_log10(double x);
+NPY_INPLACE double npy_exp(double x);
+NPY_INPLACE double npy_sqrt(double x);
+NPY_INPLACE double npy_cbrt(double x);
+
+NPY_INPLACE double npy_fabs(double x);
+NPY_INPLACE double npy_ceil(double x);
+NPY_INPLACE double npy_fmod(double x, double y);
+NPY_INPLACE double npy_floor(double x);
+
+NPY_INPLACE double npy_expm1(double x);
+NPY_INPLACE double npy_log1p(double x);
+NPY_INPLACE double npy_hypot(double x, double y);
+NPY_INPLACE double npy_acosh(double x);
+NPY_INPLACE double npy_asinh(double xx);
+NPY_INPLACE double npy_atanh(double x);
+NPY_INPLACE double npy_rint(double x);
+NPY_INPLACE double npy_trunc(double x);
+NPY_INPLACE double npy_exp2(double x);
+NPY_INPLACE double npy_log2(double x);
+
+NPY_INPLACE double npy_atan2(double x, double y);
+NPY_INPLACE double npy_pow(double x, double y);
+NPY_INPLACE double npy_modf(double x, double* y);
+NPY_INPLACE double npy_frexp(double x, int* y);
+NPY_INPLACE double npy_ldexp(double n, int y);
+
+NPY_INPLACE double npy_copysign(double x, double y);
+double npy_nextafter(double x, double y);
+double npy_spacing(double x);
+
+/*
+ * IEEE 754 fpu handling. Those are guaranteed to be macros
+ */
+
+/* use builtins to avoid function calls in tight loops
+ * only available if npy_config.h is available (= numpys own build) */
+#if HAVE___BUILTIN_ISNAN
+    #define npy_isnan(x) __builtin_isnan(x)
+#else
+    #ifndef NPY_HAVE_DECL_ISNAN
+        #define npy_isnan(x) ((x) != (x))
+    #else
+        #if defined(_MSC_VER) && (_MSC_VER < 1900)
+            #define npy_isnan(x) _isnan((x))
+        #else
+            #define npy_isnan(x) isnan(x)
+        #endif
+    #endif
+#endif
+
+
+/* only available if npy_config.h is available (= numpys own build) */
+#if HAVE___BUILTIN_ISFINITE
+    #define npy_isfinite(x) __builtin_isfinite(x)
+#else
+    #ifndef NPY_HAVE_DECL_ISFINITE
+        #ifdef _MSC_VER
+            #define npy_isfinite(x) _finite((x))
+        #else
+            #define npy_isfinite(x) !npy_isnan((x) + (-x))
+        #endif
+    #else
+        #define npy_isfinite(x) isfinite((x))
+    #endif
+#endif
+
+/* only available if npy_config.h is available (= numpys own build) */
+#if HAVE___BUILTIN_ISINF
+    #define npy_isinf(x) __builtin_isinf(x)
+#else
+    #ifndef NPY_HAVE_DECL_ISINF
+        #define npy_isinf(x) (!npy_isfinite(x) && !npy_isnan(x))
+    #else
+        #if defined(_MSC_VER) && (_MSC_VER < 1900)
+            #define npy_isinf(x) (!_finite((x)) && !_isnan((x)))
+        #else
+            #define npy_isinf(x) isinf((x))
+        #endif
+    #endif
+#endif
+
+#ifndef NPY_HAVE_DECL_SIGNBIT
+    int _npy_signbit_f(float x);
+    int _npy_signbit_d(double x);
+    int _npy_signbit_ld(long double x);
+    #define npy_signbit(x) \
+        (sizeof (x) == sizeof (long double) ? _npy_signbit_ld (x) \
+         : sizeof (x) == sizeof (double) ? _npy_signbit_d (x) \
+         : _npy_signbit_f (x))
+#else
+    #define npy_signbit(x) signbit((x))
+#endif
+
+/*
+ * float C99 math functions
+ */
+NPY_INPLACE float npy_sinf(float x);
+NPY_INPLACE float npy_cosf(float x);
+NPY_INPLACE float npy_tanf(float x);
+NPY_INPLACE float npy_sinhf(float x);
+NPY_INPLACE float npy_coshf(float x);
+NPY_INPLACE float npy_tanhf(float x);
+NPY_INPLACE float npy_fabsf(float x);
+NPY_INPLACE float npy_floorf(float x);
+NPY_INPLACE float npy_ceilf(float x);
+NPY_INPLACE float npy_rintf(float x);
+NPY_INPLACE float npy_truncf(float x);
+NPY_INPLACE float npy_sqrtf(float x);
+NPY_INPLACE float npy_cbrtf(float x);
+NPY_INPLACE float npy_log10f(float x);
+NPY_INPLACE float npy_logf(float x);
+NPY_INPLACE float npy_expf(float x);
+NPY_INPLACE float npy_expm1f(float x);
+NPY_INPLACE float npy_asinf(float x);
+NPY_INPLACE float npy_acosf(float x);
+NPY_INPLACE float npy_atanf(float x);
+NPY_INPLACE float npy_asinhf(float x);
+NPY_INPLACE float npy_acoshf(float x);
+NPY_INPLACE float npy_atanhf(float x);
+NPY_INPLACE float npy_log1pf(float x);
+NPY_INPLACE float npy_exp2f(float x);
+NPY_INPLACE float npy_log2f(float x);
+
+NPY_INPLACE float npy_atan2f(float x, float y);
+NPY_INPLACE float npy_hypotf(float x, float y);
+NPY_INPLACE float npy_powf(float x, float y);
+NPY_INPLACE float npy_fmodf(float x, float y);
+
+NPY_INPLACE float npy_modff(float x, float* y);
+NPY_INPLACE float npy_frexpf(float x, int* y);
+NPY_INPLACE float npy_ldexpf(float x, int y);
+
+NPY_INPLACE float npy_copysignf(float x, float y);
+float npy_nextafterf(float x, float y);
+float npy_spacingf(float x);
+
+/*
+ * long double C99 math functions
+ */
+NPY_INPLACE npy_longdouble npy_sinl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_cosl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_tanl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_sinhl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_coshl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_tanhl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_fabsl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_floorl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_ceill(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_rintl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_truncl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_sqrtl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_cbrtl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_log10l(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_logl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_expl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_expm1l(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_asinl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_acosl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_atanl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_asinhl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_acoshl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_atanhl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_log1pl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_exp2l(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_log2l(npy_longdouble x);
+
+NPY_INPLACE npy_longdouble npy_atan2l(npy_longdouble x, npy_longdouble y);
+NPY_INPLACE npy_longdouble npy_hypotl(npy_longdouble x, npy_longdouble y);
+NPY_INPLACE npy_longdouble npy_powl(npy_longdouble x, npy_longdouble y);
+NPY_INPLACE npy_longdouble npy_fmodl(npy_longdouble x, npy_longdouble y);
+
+NPY_INPLACE npy_longdouble npy_modfl(npy_longdouble x, npy_longdouble* y);
+NPY_INPLACE npy_longdouble npy_frexpl(npy_longdouble x, int* y);
+NPY_INPLACE npy_longdouble npy_ldexpl(npy_longdouble x, int y);
+
+NPY_INPLACE npy_longdouble npy_copysignl(npy_longdouble x, npy_longdouble y);
+npy_longdouble npy_nextafterl(npy_longdouble x, npy_longdouble y);
+npy_longdouble npy_spacingl(npy_longdouble x);
+
+/*
+ * Non standard functions
+ */
+NPY_INPLACE double npy_deg2rad(double x);
+NPY_INPLACE double npy_rad2deg(double x);
+NPY_INPLACE double npy_logaddexp(double x, double y);
+NPY_INPLACE double npy_logaddexp2(double x, double y);
+NPY_INPLACE double npy_divmod(double x, double y, double *modulus);
+NPY_INPLACE double npy_heaviside(double x, double h0);
+
+NPY_INPLACE float npy_deg2radf(float x);
+NPY_INPLACE float npy_rad2degf(float x);
+NPY_INPLACE float npy_logaddexpf(float x, float y);
+NPY_INPLACE float npy_logaddexp2f(float x, float y);
+NPY_INPLACE float npy_divmodf(float x, float y, float *modulus);
+NPY_INPLACE float npy_heavisidef(float x, float h0);
+
+NPY_INPLACE npy_longdouble npy_deg2radl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_rad2degl(npy_longdouble x);
+NPY_INPLACE npy_longdouble npy_logaddexpl(npy_longdouble x, npy_longdouble y);
+NPY_INPLACE npy_longdouble npy_logaddexp2l(npy_longdouble x, npy_longdouble y);
+NPY_INPLACE npy_longdouble npy_divmodl(npy_longdouble x, npy_longdouble y,
+                           npy_longdouble *modulus);
+NPY_INPLACE npy_longdouble npy_heavisidel(npy_longdouble x, npy_longdouble h0);
+
+#define npy_degrees npy_rad2deg
+#define npy_degreesf npy_rad2degf
+#define npy_degreesl npy_rad2degl
+
+#define npy_radians npy_deg2rad
+#define npy_radiansf npy_deg2radf
+#define npy_radiansl npy_deg2radl
+
+/*
+ * Complex declarations
+ */
+
+/*
+ * C99 specifies that complex numbers have the same representation as
+ * an array of two elements, where the first element is the real part
+ * and the second element is the imaginary part.
+ */
+#define __NPY_CPACK_IMP(x, y, type, ctype)   \
+    union {                                  \
+        ctype z;                             \
+        type a[2];                           \
+    } z1;;                                   \
+                                             \
+    z1.a[0] = (x);                           \
+    z1.a[1] = (y);                           \
+                                             \
+    return z1.z;
+
+static NPY_INLINE npy_cdouble npy_cpack(double x, double y)
+{
+    __NPY_CPACK_IMP(x, y, double, npy_cdouble);
+}
+
+static NPY_INLINE npy_cfloat npy_cpackf(float x, float y)
+{
+    __NPY_CPACK_IMP(x, y, float, npy_cfloat);
+}
+
+static NPY_INLINE npy_clongdouble npy_cpackl(npy_longdouble x, npy_longdouble y)
+{
+    __NPY_CPACK_IMP(x, y, npy_longdouble, npy_clongdouble);
+}
+#undef __NPY_CPACK_IMP
+
+/*
+ * Same remark as above, but in the other direction: extract first/second
+ * member of complex number, assuming a C99-compatible representation
+ *
+ * Those are defineds as static inline, and such as a reasonable compiler would
+ * most likely compile this to one or two instructions (on CISC at least)
+ */
+#define __NPY_CEXTRACT_IMP(z, index, type, ctype)   \
+    union {                                         \
+        ctype z;                                    \
+        type a[2];                                  \
+    } __z_repr;                                     \
+    __z_repr.z = z;                                 \
+                                                    \
+    return __z_repr.a[index];
+
+static NPY_INLINE double npy_creal(npy_cdouble z)
+{
+    __NPY_CEXTRACT_IMP(z, 0, double, npy_cdouble);
+}
+
+static NPY_INLINE double npy_cimag(npy_cdouble z)
+{
+    __NPY_CEXTRACT_IMP(z, 1, double, npy_cdouble);
+}
+
+static NPY_INLINE float npy_crealf(npy_cfloat z)
+{
+    __NPY_CEXTRACT_IMP(z, 0, float, npy_cfloat);
+}
+
+static NPY_INLINE float npy_cimagf(npy_cfloat z)
+{
+    __NPY_CEXTRACT_IMP(z, 1, float, npy_cfloat);
+}
+
+static NPY_INLINE npy_longdouble npy_creall(npy_clongdouble z)
+{
+    __NPY_CEXTRACT_IMP(z, 0, npy_longdouble, npy_clongdouble);
+}
+
+static NPY_INLINE npy_longdouble npy_cimagl(npy_clongdouble z)
+{
+    __NPY_CEXTRACT_IMP(z, 1, npy_longdouble, npy_clongdouble);
+}
+#undef __NPY_CEXTRACT_IMP
+
+/*
+ * Double precision complex functions
+ */
+double npy_cabs(npy_cdouble z);
+double npy_carg(npy_cdouble z);
+
+npy_cdouble npy_cexp(npy_cdouble z);
+npy_cdouble npy_clog(npy_cdouble z);
+npy_cdouble npy_cpow(npy_cdouble x, npy_cdouble y);
+
+npy_cdouble npy_csqrt(npy_cdouble z);
+
+npy_cdouble npy_ccos(npy_cdouble z);
+npy_cdouble npy_csin(npy_cdouble z);
+npy_cdouble npy_ctan(npy_cdouble z);
+
+npy_cdouble npy_ccosh(npy_cdouble z);
+npy_cdouble npy_csinh(npy_cdouble z);
+npy_cdouble npy_ctanh(npy_cdouble z);
+
+npy_cdouble npy_cacos(npy_cdouble z);
+npy_cdouble npy_casin(npy_cdouble z);
+npy_cdouble npy_catan(npy_cdouble z);
+
+npy_cdouble npy_cacosh(npy_cdouble z);
+npy_cdouble npy_casinh(npy_cdouble z);
+npy_cdouble npy_catanh(npy_cdouble z);
+
+/*
+ * Single precision complex functions
+ */
+float npy_cabsf(npy_cfloat z);
+float npy_cargf(npy_cfloat z);
+
+npy_cfloat npy_cexpf(npy_cfloat z);
+npy_cfloat npy_clogf(npy_cfloat z);
+npy_cfloat npy_cpowf(npy_cfloat x, npy_cfloat y);
+
+npy_cfloat npy_csqrtf(npy_cfloat z);
+
+npy_cfloat npy_ccosf(npy_cfloat z);
+npy_cfloat npy_csinf(npy_cfloat z);
+npy_cfloat npy_ctanf(npy_cfloat z);
+
+npy_cfloat npy_ccoshf(npy_cfloat z);
+npy_cfloat npy_csinhf(npy_cfloat z);
+npy_cfloat npy_ctanhf(npy_cfloat z);
+
+npy_cfloat npy_cacosf(npy_cfloat z);
+npy_cfloat npy_casinf(npy_cfloat z);
+npy_cfloat npy_catanf(npy_cfloat z);
+
+npy_cfloat npy_cacoshf(npy_cfloat z);
+npy_cfloat npy_casinhf(npy_cfloat z);
+npy_cfloat npy_catanhf(npy_cfloat z);
+
+
+/*
+ * Extended precision complex functions
+ */
+npy_longdouble npy_cabsl(npy_clongdouble z);
+npy_longdouble npy_cargl(npy_clongdouble z);
+
+npy_clongdouble npy_cexpl(npy_clongdouble z);
+npy_clongdouble npy_clogl(npy_clongdouble z);
+npy_clongdouble npy_cpowl(npy_clongdouble x, npy_clongdouble y);
+
+npy_clongdouble npy_csqrtl(npy_clongdouble z);
+
+npy_clongdouble npy_ccosl(npy_clongdouble z);
+npy_clongdouble npy_csinl(npy_clongdouble z);
+npy_clongdouble npy_ctanl(npy_clongdouble z);
+
+npy_clongdouble npy_ccoshl(npy_clongdouble z);
+npy_clongdouble npy_csinhl(npy_clongdouble z);
+npy_clongdouble npy_ctanhl(npy_clongdouble z);
+
+npy_clongdouble npy_cacosl(npy_clongdouble z);
+npy_clongdouble npy_casinl(npy_clongdouble z);
+npy_clongdouble npy_catanl(npy_clongdouble z);
+
+npy_clongdouble npy_cacoshl(npy_clongdouble z);
+npy_clongdouble npy_casinhl(npy_clongdouble z);
+npy_clongdouble npy_catanhl(npy_clongdouble z);
+
+
+/*
+ * Functions that set the floating point error
+ * status word.
+ */
+
+/*
+ * platform-dependent code translates floating point
+ * status to an integer sum of these values
+ */
+#define NPY_FPE_DIVIDEBYZERO  1
+#define NPY_FPE_OVERFLOW      2
+#define NPY_FPE_UNDERFLOW     4
+#define NPY_FPE_INVALID       8
+
+int npy_clear_floatstatus_barrier(char*);
+int npy_get_floatstatus_barrier(char*);
+/*
+ * use caution with these - clang and gcc8.1 are known to reorder calls
+ * to this form of the function which can defeat the check. The _barrier
+ * form of the call is preferable, where the argument is
+ * (char*)&local_variable
+ */
+int npy_clear_floatstatus(void);
+int npy_get_floatstatus(void);
+
+void npy_set_floatstatus_divbyzero(void);
+void npy_set_floatstatus_overflow(void);
+void npy_set_floatstatus_underflow(void);
+void npy_set_floatstatus_invalid(void);
+
+#ifdef __cplusplus
+}
+#endif
+
+#if NPY_INLINE_MATH
+#include "npy_math_internal.h"
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_no_deprecated_api.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_no_deprecated_api.h
new file mode 100644
index 000000000..6183dc278
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_no_deprecated_api.h
@@ -0,0 +1,19 @@
+/*
+ * This include file is provided for inclusion in Cython *.pyd files where
+ * one would like to define the NPY_NO_DEPRECATED_API macro. It can be
+ * included by
+ *
+ * cdef extern from "npy_no_deprecated_api.h": pass
+ *
+ */
+#ifndef NPY_NO_DEPRECATED_API
+
+/* put this check here since there may be multiple includes in C extensions. */
+#if defined(NDARRAYTYPES_H) || defined(_NPY_DEPRECATED_API_H) || \
+    defined(OLD_DEFINES_H)
+#error "npy_no_deprecated_api.h" must be first among numpy includes.
+#else
+#define NPY_NO_DEPRECATED_API NPY_API_VERSION
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/npy_os.h b/venv/Lib/site-packages/numpy/core/include/numpy/npy_os.h
new file mode 100644
index 000000000..9228c3916
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/npy_os.h
@@ -0,0 +1,30 @@
+#ifndef _NPY_OS_H_
+#define _NPY_OS_H_
+
+#if defined(linux) || defined(__linux) || defined(__linux__)
+    #define NPY_OS_LINUX
+#elif defined(__FreeBSD__) || defined(__NetBSD__) || \
+            defined(__OpenBSD__) || defined(__DragonFly__)
+    #define NPY_OS_BSD
+    #ifdef __FreeBSD__
+        #define NPY_OS_FREEBSD
+    #elif defined(__NetBSD__)
+        #define NPY_OS_NETBSD
+    #elif defined(__OpenBSD__)
+        #define NPY_OS_OPENBSD
+    #elif defined(__DragonFly__)
+        #define NPY_OS_DRAGONFLY
+    #endif
+#elif defined(sun) || defined(__sun)
+    #define NPY_OS_SOLARIS
+#elif defined(__CYGWIN__)
+    #define NPY_OS_CYGWIN
+#elif defined(_WIN32) || defined(__WIN32__) || defined(WIN32)
+    #define NPY_OS_WIN32
+#elif defined(__APPLE__)
+    #define NPY_OS_DARWIN
+#else
+    #define NPY_OS_UNKNOWN
+#endif
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/numpyconfig.h b/venv/Lib/site-packages/numpy/core/include/numpy/numpyconfig.h
new file mode 100644
index 000000000..4df4ea438
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/numpyconfig.h
@@ -0,0 +1,45 @@
+#ifndef _NPY_NUMPYCONFIG_H_
+#define _NPY_NUMPYCONFIG_H_
+
+#include "_numpyconfig.h"
+
+/*
+ * On Mac OS X, because there is only one configuration stage for all the archs
+ * in universal builds, any macro which depends on the arch needs to be
+ * hardcoded
+ */
+#ifdef __APPLE__
+    #undef NPY_SIZEOF_LONG
+    #undef NPY_SIZEOF_PY_INTPTR_T
+
+    #ifdef __LP64__
+        #define NPY_SIZEOF_LONG         8
+        #define NPY_SIZEOF_PY_INTPTR_T  8
+    #else
+        #define NPY_SIZEOF_LONG         4
+        #define NPY_SIZEOF_PY_INTPTR_T  4
+    #endif
+#endif
+
+/**
+ * To help with the NPY_NO_DEPRECATED_API macro, we include API version
+ * numbers for specific versions of NumPy. To exclude all API that was
+ * deprecated as of 1.7, add the following before #including any NumPy
+ * headers:
+ *   #define NPY_NO_DEPRECATED_API  NPY_1_7_API_VERSION
+ */
+#define NPY_1_7_API_VERSION 0x00000007
+#define NPY_1_8_API_VERSION 0x00000008
+#define NPY_1_9_API_VERSION 0x00000008
+#define NPY_1_10_API_VERSION 0x00000008
+#define NPY_1_11_API_VERSION 0x00000008
+#define NPY_1_12_API_VERSION 0x00000008
+#define NPY_1_13_API_VERSION 0x00000008
+#define NPY_1_14_API_VERSION 0x00000008
+#define NPY_1_15_API_VERSION 0x00000008
+#define NPY_1_16_API_VERSION 0x00000008
+#define NPY_1_17_API_VERSION 0x00000008
+#define NPY_1_18_API_VERSION 0x00000008
+#define NPY_1_19_API_VERSION 0x00000008
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/old_defines.h b/venv/Lib/site-packages/numpy/core/include/numpy/old_defines.h
new file mode 100644
index 000000000..abf81595a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/old_defines.h
@@ -0,0 +1,187 @@
+/* This header is deprecated as of NumPy 1.7 */
+#ifndef OLD_DEFINES_H
+#define OLD_DEFINES_H
+
+#if defined(NPY_NO_DEPRECATED_API) && NPY_NO_DEPRECATED_API >= NPY_1_7_API_VERSION
+#error The header "old_defines.h" is deprecated as of NumPy 1.7.
+#endif
+
+#define NDARRAY_VERSION NPY_VERSION
+
+#define PyArray_MIN_BUFSIZE NPY_MIN_BUFSIZE
+#define PyArray_MAX_BUFSIZE NPY_MAX_BUFSIZE
+#define PyArray_BUFSIZE NPY_BUFSIZE
+
+#define PyArray_PRIORITY NPY_PRIORITY
+#define PyArray_SUBTYPE_PRIORITY NPY_PRIORITY
+#define PyArray_NUM_FLOATTYPE NPY_NUM_FLOATTYPE
+
+#define NPY_MAX PyArray_MAX
+#define NPY_MIN PyArray_MIN
+
+#define PyArray_TYPES       NPY_TYPES
+#define PyArray_BOOL        NPY_BOOL
+#define PyArray_BYTE        NPY_BYTE
+#define PyArray_UBYTE       NPY_UBYTE
+#define PyArray_SHORT       NPY_SHORT
+#define PyArray_USHORT      NPY_USHORT
+#define PyArray_INT         NPY_INT
+#define PyArray_UINT        NPY_UINT
+#define PyArray_LONG        NPY_LONG
+#define PyArray_ULONG       NPY_ULONG
+#define PyArray_LONGLONG    NPY_LONGLONG
+#define PyArray_ULONGLONG   NPY_ULONGLONG
+#define PyArray_HALF        NPY_HALF
+#define PyArray_FLOAT       NPY_FLOAT
+#define PyArray_DOUBLE      NPY_DOUBLE
+#define PyArray_LONGDOUBLE  NPY_LONGDOUBLE
+#define PyArray_CFLOAT      NPY_CFLOAT
+#define PyArray_CDOUBLE     NPY_CDOUBLE
+#define PyArray_CLONGDOUBLE NPY_CLONGDOUBLE
+#define PyArray_OBJECT      NPY_OBJECT
+#define PyArray_STRING      NPY_STRING
+#define PyArray_UNICODE     NPY_UNICODE
+#define PyArray_VOID        NPY_VOID
+#define PyArray_DATETIME    NPY_DATETIME
+#define PyArray_TIMEDELTA   NPY_TIMEDELTA
+#define PyArray_NTYPES      NPY_NTYPES
+#define PyArray_NOTYPE      NPY_NOTYPE
+#define PyArray_CHAR        NPY_CHAR
+#define PyArray_USERDEF     NPY_USERDEF
+#define PyArray_NUMUSERTYPES NPY_NUMUSERTYPES
+
+#define PyArray_INTP        NPY_INTP
+#define PyArray_UINTP       NPY_UINTP
+
+#define PyArray_INT8    NPY_INT8
+#define PyArray_UINT8   NPY_UINT8
+#define PyArray_INT16   NPY_INT16
+#define PyArray_UINT16  NPY_UINT16
+#define PyArray_INT32   NPY_INT32
+#define PyArray_UINT32  NPY_UINT32
+
+#ifdef NPY_INT64
+#define PyArray_INT64   NPY_INT64
+#define PyArray_UINT64  NPY_UINT64
+#endif
+
+#ifdef NPY_INT128
+#define PyArray_INT128 NPY_INT128
+#define PyArray_UINT128 NPY_UINT128
+#endif
+
+#ifdef NPY_FLOAT16
+#define PyArray_FLOAT16  NPY_FLOAT16
+#define PyArray_COMPLEX32  NPY_COMPLEX32
+#endif
+
+#ifdef NPY_FLOAT80
+#define PyArray_FLOAT80  NPY_FLOAT80
+#define PyArray_COMPLEX160  NPY_COMPLEX160
+#endif
+
+#ifdef NPY_FLOAT96
+#define PyArray_FLOAT96  NPY_FLOAT96
+#define PyArray_COMPLEX192  NPY_COMPLEX192
+#endif
+
+#ifdef NPY_FLOAT128
+#define PyArray_FLOAT128  NPY_FLOAT128
+#define PyArray_COMPLEX256  NPY_COMPLEX256
+#endif
+
+#define PyArray_FLOAT32    NPY_FLOAT32
+#define PyArray_COMPLEX64  NPY_COMPLEX64
+#define PyArray_FLOAT64    NPY_FLOAT64
+#define PyArray_COMPLEX128 NPY_COMPLEX128
+
+
+#define PyArray_TYPECHAR        NPY_TYPECHAR
+#define PyArray_BOOLLTR         NPY_BOOLLTR
+#define PyArray_BYTELTR         NPY_BYTELTR
+#define PyArray_UBYTELTR        NPY_UBYTELTR
+#define PyArray_SHORTLTR        NPY_SHORTLTR
+#define PyArray_USHORTLTR       NPY_USHORTLTR
+#define PyArray_INTLTR          NPY_INTLTR
+#define PyArray_UINTLTR         NPY_UINTLTR
+#define PyArray_LONGLTR         NPY_LONGLTR
+#define PyArray_ULONGLTR        NPY_ULONGLTR
+#define PyArray_LONGLONGLTR     NPY_LONGLONGLTR
+#define PyArray_ULONGLONGLTR    NPY_ULONGLONGLTR
+#define PyArray_HALFLTR         NPY_HALFLTR
+#define PyArray_FLOATLTR        NPY_FLOATLTR
+#define PyArray_DOUBLELTR       NPY_DOUBLELTR
+#define PyArray_LONGDOUBLELTR   NPY_LONGDOUBLELTR
+#define PyArray_CFLOATLTR       NPY_CFLOATLTR
+#define PyArray_CDOUBLELTR      NPY_CDOUBLELTR
+#define PyArray_CLONGDOUBLELTR  NPY_CLONGDOUBLELTR
+#define PyArray_OBJECTLTR       NPY_OBJECTLTR
+#define PyArray_STRINGLTR       NPY_STRINGLTR
+#define PyArray_STRINGLTR2      NPY_STRINGLTR2
+#define PyArray_UNICODELTR      NPY_UNICODELTR
+#define PyArray_VOIDLTR         NPY_VOIDLTR
+#define PyArray_DATETIMELTR     NPY_DATETIMELTR
+#define PyArray_TIMEDELTALTR    NPY_TIMEDELTALTR
+#define PyArray_CHARLTR         NPY_CHARLTR
+#define PyArray_INTPLTR         NPY_INTPLTR
+#define PyArray_UINTPLTR        NPY_UINTPLTR
+#define PyArray_GENBOOLLTR      NPY_GENBOOLLTR
+#define PyArray_SIGNEDLTR       NPY_SIGNEDLTR
+#define PyArray_UNSIGNEDLTR     NPY_UNSIGNEDLTR
+#define PyArray_FLOATINGLTR     NPY_FLOATINGLTR
+#define PyArray_COMPLEXLTR      NPY_COMPLEXLTR
+
+#define PyArray_QUICKSORT   NPY_QUICKSORT
+#define PyArray_HEAPSORT    NPY_HEAPSORT
+#define PyArray_MERGESORT   NPY_MERGESORT
+#define PyArray_SORTKIND    NPY_SORTKIND
+#define PyArray_NSORTS      NPY_NSORTS
+
+#define PyArray_NOSCALAR       NPY_NOSCALAR
+#define PyArray_BOOL_SCALAR    NPY_BOOL_SCALAR
+#define PyArray_INTPOS_SCALAR  NPY_INTPOS_SCALAR
+#define PyArray_INTNEG_SCALAR  NPY_INTNEG_SCALAR
+#define PyArray_FLOAT_SCALAR   NPY_FLOAT_SCALAR
+#define PyArray_COMPLEX_SCALAR NPY_COMPLEX_SCALAR
+#define PyArray_OBJECT_SCALAR  NPY_OBJECT_SCALAR
+#define PyArray_SCALARKIND     NPY_SCALARKIND
+#define PyArray_NSCALARKINDS   NPY_NSCALARKINDS
+
+#define PyArray_ANYORDER     NPY_ANYORDER
+#define PyArray_CORDER       NPY_CORDER
+#define PyArray_FORTRANORDER NPY_FORTRANORDER
+#define PyArray_ORDER        NPY_ORDER
+
+#define PyDescr_ISBOOL      PyDataType_ISBOOL
+#define PyDescr_ISUNSIGNED  PyDataType_ISUNSIGNED
+#define PyDescr_ISSIGNED    PyDataType_ISSIGNED
+#define PyDescr_ISINTEGER   PyDataType_ISINTEGER
+#define PyDescr_ISFLOAT     PyDataType_ISFLOAT
+#define PyDescr_ISNUMBER    PyDataType_ISNUMBER
+#define PyDescr_ISSTRING    PyDataType_ISSTRING
+#define PyDescr_ISCOMPLEX   PyDataType_ISCOMPLEX
+#define PyDescr_ISPYTHON    PyDataType_ISPYTHON
+#define PyDescr_ISFLEXIBLE  PyDataType_ISFLEXIBLE
+#define PyDescr_ISUSERDEF   PyDataType_ISUSERDEF
+#define PyDescr_ISEXTENDED  PyDataType_ISEXTENDED
+#define PyDescr_ISOBJECT    PyDataType_ISOBJECT
+#define PyDescr_HASFIELDS   PyDataType_HASFIELDS
+
+#define PyArray_LITTLE NPY_LITTLE
+#define PyArray_BIG NPY_BIG
+#define PyArray_NATIVE NPY_NATIVE
+#define PyArray_SWAP NPY_SWAP
+#define PyArray_IGNORE NPY_IGNORE
+
+#define PyArray_NATBYTE NPY_NATBYTE
+#define PyArray_OPPBYTE NPY_OPPBYTE
+
+#define PyArray_MAX_ELSIZE NPY_MAX_ELSIZE
+
+#define PyArray_USE_PYMEM NPY_USE_PYMEM
+
+#define PyArray_RemoveLargest PyArray_RemoveSmallest
+
+#define PyArray_UCS4 npy_ucs4
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/oldnumeric.h b/venv/Lib/site-packages/numpy/core/include/numpy/oldnumeric.h
new file mode 100644
index 000000000..38530faf0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/oldnumeric.h
@@ -0,0 +1,25 @@
+#include "arrayobject.h"
+
+#ifndef PYPY_VERSION
+#ifndef REFCOUNT
+#  define REFCOUNT NPY_REFCOUNT
+#  define MAX_ELSIZE 16
+#endif
+#endif
+
+#define PyArray_UNSIGNED_TYPES
+#define PyArray_SBYTE NPY_BYTE
+#define PyArray_CopyArray PyArray_CopyInto
+#define _PyArray_multiply_list PyArray_MultiplyIntList
+#define PyArray_ISSPACESAVER(m) NPY_FALSE
+#define PyScalarArray_Check PyArray_CheckScalar
+
+#define CONTIGUOUS NPY_CONTIGUOUS
+#define OWN_DIMENSIONS 0
+#define OWN_STRIDES 0
+#define OWN_DATA NPY_OWNDATA
+#define SAVESPACE 0
+#define SAVESPACEBIT 0
+
+#undef import_array
+#define import_array() { if (_import_array() < 0) {PyErr_Print(); PyErr_SetString(PyExc_ImportError, "numpy.core.multiarray failed to import"); } }
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/random/bitgen.h b/venv/Lib/site-packages/numpy/core/include/numpy/random/bitgen.h
new file mode 100644
index 000000000..83c2858dd
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/random/bitgen.h
@@ -0,0 +1,20 @@
+#ifndef _RANDOM_BITGEN_H
+#define _RANDOM_BITGEN_H
+
+#pragma once
+#include <stddef.h>
+#include <stdbool.h>
+#include <stdint.h>
+
+/* Must match the declaration in numpy/random/<any>.pxd */
+
+typedef struct bitgen {
+  void *state;
+  uint64_t (*next_uint64)(void *st);
+  uint32_t (*next_uint32)(void *st);
+  double (*next_double)(void *st);
+  uint64_t (*next_raw)(void *st);
+} bitgen_t;
+
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/random/distributions.h b/venv/Lib/site-packages/numpy/core/include/numpy/random/distributions.h
new file mode 100644
index 000000000..c474c4d14
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/random/distributions.h
@@ -0,0 +1,200 @@
+#ifndef _RANDOMDGEN__DISTRIBUTIONS_H_
+#define _RANDOMDGEN__DISTRIBUTIONS_H_
+
+#include "Python.h"
+#include "numpy/npy_common.h"
+#include <stddef.h>
+#include <stdbool.h>
+#include <stdint.h>
+
+#include "numpy/npy_math.h"
+#include "numpy/random/bitgen.h"
+
+/*
+ * RAND_INT_TYPE is used to share integer generators with RandomState which
+ * used long in place of int64_t. If changing a distribution that uses
+ * RAND_INT_TYPE, then the original unmodified copy must be retained for
+ * use in RandomState by copying to the legacy distributions source file.
+ */
+#ifdef NP_RANDOM_LEGACY
+#define RAND_INT_TYPE long
+#define RAND_INT_MAX LONG_MAX
+#else
+#define RAND_INT_TYPE int64_t
+#define RAND_INT_MAX INT64_MAX
+#endif
+
+#ifdef _MSC_VER
+#define DECLDIR __declspec(dllexport)
+#else
+#define DECLDIR extern
+#endif
+
+#ifndef MIN
+#define MIN(x, y) (((x) < (y)) ? x : y)
+#define MAX(x, y) (((x) > (y)) ? x : y)
+#endif
+
+#ifndef M_PI
+#define M_PI 3.14159265358979323846264338328
+#endif
+
+typedef struct s_binomial_t {
+  int has_binomial; /* !=0: following parameters initialized for binomial */
+  double psave;
+  RAND_INT_TYPE nsave;
+  double r;
+  double q;
+  double fm;
+  RAND_INT_TYPE m;
+  double p1;
+  double xm;
+  double xl;
+  double xr;
+  double c;
+  double laml;
+  double lamr;
+  double p2;
+  double p3;
+  double p4;
+} binomial_t;
+
+DECLDIR float random_standard_uniform_f(bitgen_t *bitgen_state);
+DECLDIR double random_standard_uniform(bitgen_t *bitgen_state);
+DECLDIR void random_standard_uniform_fill(bitgen_t *, npy_intp, double *);
+DECLDIR void random_standard_uniform_fill_f(bitgen_t *, npy_intp, float *);
+
+DECLDIR int64_t random_positive_int64(bitgen_t *bitgen_state);
+DECLDIR int32_t random_positive_int32(bitgen_t *bitgen_state);
+DECLDIR int64_t random_positive_int(bitgen_t *bitgen_state);
+DECLDIR uint64_t random_uint(bitgen_t *bitgen_state);
+
+DECLDIR double random_standard_exponential(bitgen_t *bitgen_state);
+DECLDIR float random_standard_exponential_f(bitgen_t *bitgen_state);
+DECLDIR void random_standard_exponential_fill(bitgen_t *, npy_intp, double *);
+DECLDIR void random_standard_exponential_fill_f(bitgen_t *, npy_intp, float *);
+DECLDIR void random_standard_exponential_inv_fill(bitgen_t *, npy_intp, double *);
+DECLDIR void random_standard_exponential_inv_fill_f(bitgen_t *, npy_intp, float *);
+
+DECLDIR double random_standard_normal(bitgen_t *bitgen_state);
+DECLDIR float random_standard_normal_f(bitgen_t *bitgen_state);
+DECLDIR void random_standard_normal_fill(bitgen_t *, npy_intp, double *);
+DECLDIR void random_standard_normal_fill_f(bitgen_t *, npy_intp, float *);
+DECLDIR double random_standard_gamma(bitgen_t *bitgen_state, double shape);
+DECLDIR float random_standard_gamma_f(bitgen_t *bitgen_state, float shape);
+
+DECLDIR double random_normal(bitgen_t *bitgen_state, double loc, double scale);
+
+DECLDIR double random_gamma(bitgen_t *bitgen_state, double shape, double scale);
+DECLDIR float random_gamma_f(bitgen_t *bitgen_state, float shape, float scale);
+
+DECLDIR double random_exponential(bitgen_t *bitgen_state, double scale);
+DECLDIR double random_uniform(bitgen_t *bitgen_state, double lower, double range);
+DECLDIR double random_beta(bitgen_t *bitgen_state, double a, double b);
+DECLDIR double random_chisquare(bitgen_t *bitgen_state, double df);
+DECLDIR double random_f(bitgen_t *bitgen_state, double dfnum, double dfden);
+DECLDIR double random_standard_cauchy(bitgen_t *bitgen_state);
+DECLDIR double random_pareto(bitgen_t *bitgen_state, double a);
+DECLDIR double random_weibull(bitgen_t *bitgen_state, double a);
+DECLDIR double random_power(bitgen_t *bitgen_state, double a);
+DECLDIR double random_laplace(bitgen_t *bitgen_state, double loc, double scale);
+DECLDIR double random_gumbel(bitgen_t *bitgen_state, double loc, double scale);
+DECLDIR double random_logistic(bitgen_t *bitgen_state, double loc, double scale);
+DECLDIR double random_lognormal(bitgen_t *bitgen_state, double mean, double sigma);
+DECLDIR double random_rayleigh(bitgen_t *bitgen_state, double mode);
+DECLDIR double random_standard_t(bitgen_t *bitgen_state, double df);
+DECLDIR double random_noncentral_chisquare(bitgen_t *bitgen_state, double df,
+                                           double nonc);
+DECLDIR double random_noncentral_f(bitgen_t *bitgen_state, double dfnum,
+                                   double dfden, double nonc);
+DECLDIR double random_wald(bitgen_t *bitgen_state, double mean, double scale);
+DECLDIR double random_vonmises(bitgen_t *bitgen_state, double mu, double kappa);
+DECLDIR double random_triangular(bitgen_t *bitgen_state, double left, double mode,
+                                 double right);
+
+DECLDIR RAND_INT_TYPE random_poisson(bitgen_t *bitgen_state, double lam);
+DECLDIR RAND_INT_TYPE random_negative_binomial(bitgen_t *bitgen_state, double n,
+                                 double p);
+
+DECLDIR int64_t random_binomial(bitgen_t *bitgen_state, double p,
+                                int64_t n, binomial_t *binomial);
+
+DECLDIR RAND_INT_TYPE random_logseries(bitgen_t *bitgen_state, double p);
+DECLDIR RAND_INT_TYPE random_geometric(bitgen_t *bitgen_state, double p);
+DECLDIR RAND_INT_TYPE random_zipf(bitgen_t *bitgen_state, double a);
+DECLDIR int64_t random_hypergeometric(bitgen_t *bitgen_state,
+                                      int64_t good, int64_t bad, int64_t sample);
+DECLDIR uint64_t random_interval(bitgen_t *bitgen_state, uint64_t max);
+
+/* Generate random uint64 numbers in closed interval [off, off + rng]. */
+DECLDIR uint64_t random_bounded_uint64(bitgen_t *bitgen_state, uint64_t off,
+                                       uint64_t rng, uint64_t mask,
+                                       bool use_masked);
+
+/* Generate random uint32 numbers in closed interval [off, off + rng]. */
+DECLDIR uint32_t random_buffered_bounded_uint32(bitgen_t *bitgen_state,
+                                                uint32_t off, uint32_t rng,
+                                                uint32_t mask, bool use_masked,
+                                                int *bcnt, uint32_t *buf);
+DECLDIR uint16_t random_buffered_bounded_uint16(bitgen_t *bitgen_state,
+                                                uint16_t off, uint16_t rng,
+                                                uint16_t mask, bool use_masked,
+                                                int *bcnt, uint32_t *buf);
+DECLDIR uint8_t random_buffered_bounded_uint8(bitgen_t *bitgen_state, uint8_t off,
+                                              uint8_t rng, uint8_t mask,
+                                              bool use_masked, int *bcnt,
+                                              uint32_t *buf);
+DECLDIR npy_bool random_buffered_bounded_bool(bitgen_t *bitgen_state, npy_bool off,
+                                              npy_bool rng, npy_bool mask,
+                                              bool use_masked, int *bcnt,
+                                              uint32_t *buf);
+
+DECLDIR void random_bounded_uint64_fill(bitgen_t *bitgen_state, uint64_t off,
+                                        uint64_t rng, npy_intp cnt,
+                                        bool use_masked, uint64_t *out);
+DECLDIR void random_bounded_uint32_fill(bitgen_t *bitgen_state, uint32_t off,
+                                        uint32_t rng, npy_intp cnt,
+                                        bool use_masked, uint32_t *out);
+DECLDIR void random_bounded_uint16_fill(bitgen_t *bitgen_state, uint16_t off,
+                                        uint16_t rng, npy_intp cnt,
+                                        bool use_masked, uint16_t *out);
+DECLDIR void random_bounded_uint8_fill(bitgen_t *bitgen_state, uint8_t off,
+                                       uint8_t rng, npy_intp cnt,
+                                       bool use_masked, uint8_t *out);
+DECLDIR void random_bounded_bool_fill(bitgen_t *bitgen_state, npy_bool off,
+                                      npy_bool rng, npy_intp cnt,
+                                      bool use_masked, npy_bool *out);
+
+DECLDIR void random_multinomial(bitgen_t *bitgen_state, RAND_INT_TYPE n, RAND_INT_TYPE *mnix,
+                                double *pix, npy_intp d, binomial_t *binomial);
+
+/* multivariate hypergeometric, "count" method */
+DECLDIR int random_multivariate_hypergeometric_count(bitgen_t *bitgen_state,
+                              int64_t total,
+                              size_t num_colors, int64_t *colors,
+                              int64_t nsample,
+                              size_t num_variates, int64_t *variates);
+
+/* multivariate hypergeometric, "marginals" method */
+DECLDIR void random_multivariate_hypergeometric_marginals(bitgen_t *bitgen_state,
+                                   int64_t total,
+                                   size_t num_colors, int64_t *colors,
+                                   int64_t nsample,
+                                   size_t num_variates, int64_t *variates);
+
+/* Common to legacy-distributions.c and distributions.c but not exported */
+
+RAND_INT_TYPE random_binomial_btpe(bitgen_t *bitgen_state,
+                                   RAND_INT_TYPE n,
+                                   double p,
+                                   binomial_t *binomial);
+RAND_INT_TYPE random_binomial_inversion(bitgen_t *bitgen_state,
+                                        RAND_INT_TYPE n,
+                                        double p,
+                                        binomial_t *binomial);
+double random_loggam(double x);
+static NPY_INLINE double next_double(bitgen_t *bitgen_state) {
+    return bitgen_state->next_double(bitgen_state->state);
+}
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/ufunc_api.txt b/venv/Lib/site-packages/numpy/core/include/numpy/ufunc_api.txt
new file mode 100644
index 000000000..386848c30
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/ufunc_api.txt
@@ -0,0 +1,333 @@
+
+=================
+NumPy Ufunc C-API
+=================
+::
+
+  PyObject *
+  PyUFunc_FromFuncAndData(PyUFuncGenericFunction *func, void
+                          **data, char *types, int ntypes, int nin, int
+                          nout, int identity, const char *name, const
+                          char *doc, int unused)
+
+
+::
+
+  int
+  PyUFunc_RegisterLoopForType(PyUFuncObject *ufunc, int
+                              usertype, PyUFuncGenericFunction
+                              function, const int *arg_types, void
+                              *data)
+
+
+::
+
+  int
+  PyUFunc_GenericFunction(PyUFuncObject *ufunc, PyObject *args, PyObject
+                          *kwds, PyArrayObject **op)
+
+
+::
+
+  void
+  PyUFunc_f_f_As_d_d(char **args, npy_intp const *dimensions, npy_intp
+                     const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_d_d(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_f_f(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_g_g(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_F_F_As_D_D(char **args, npy_intp const *dimensions, npy_intp
+                     const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_F_F(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_D_D(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_G_G(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_O_O(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_ff_f_As_dd_d(char **args, npy_intp const *dimensions, npy_intp
+                       const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_ff_f(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_dd_d(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_gg_g(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_FF_F_As_DD_D(char **args, npy_intp const *dimensions, npy_intp
+                       const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_DD_D(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_FF_F(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_GG_G(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_OO_O(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_O_O_method(char **args, npy_intp const *dimensions, npy_intp
+                     const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_OO_O_method(char **args, npy_intp const *dimensions, npy_intp
+                      const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_On_Om(char **args, npy_intp const *dimensions, npy_intp const
+                *steps, void *func)
+
+
+::
+
+  int
+  PyUFunc_GetPyValues(char *name, int *bufsize, int *errmask, PyObject
+                      **errobj)
+
+
+On return, if errobj is populated with a non-NULL value, the caller
+owns a new reference to errobj.
+
+::
+
+  int
+  PyUFunc_checkfperr(int errmask, PyObject *errobj, int *first)
+
+
+::
+
+  void
+  PyUFunc_clearfperr()
+
+
+::
+
+  int
+  PyUFunc_getfperr(void )
+
+
+::
+
+  int
+  PyUFunc_handlefperr(int errmask, PyObject *errobj, int retstatus, int
+                      *first)
+
+
+::
+
+  int
+  PyUFunc_ReplaceLoopBySignature(PyUFuncObject
+                                 *func, PyUFuncGenericFunction
+                                 newfunc, const int
+                                 *signature, PyUFuncGenericFunction
+                                 *oldfunc)
+
+
+::
+
+  PyObject *
+  PyUFunc_FromFuncAndDataAndSignature(PyUFuncGenericFunction *func, void
+                                      **data, char *types, int
+                                      ntypes, int nin, int nout, int
+                                      identity, const char *name, const
+                                      char *doc, int unused, const char
+                                      *signature)
+
+
+::
+
+  int
+  PyUFunc_SetUsesArraysAsData(void **data, size_t i)
+
+
+::
+
+  void
+  PyUFunc_e_e(char **args, npy_intp const *dimensions, npy_intp const
+              *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_e_e_As_f_f(char **args, npy_intp const *dimensions, npy_intp
+                     const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_e_e_As_d_d(char **args, npy_intp const *dimensions, npy_intp
+                     const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_ee_e(char **args, npy_intp const *dimensions, npy_intp const
+               *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_ee_e_As_ff_f(char **args, npy_intp const *dimensions, npy_intp
+                       const *steps, void *func)
+
+
+::
+
+  void
+  PyUFunc_ee_e_As_dd_d(char **args, npy_intp const *dimensions, npy_intp
+                       const *steps, void *func)
+
+
+::
+
+  int
+  PyUFunc_DefaultTypeResolver(PyUFuncObject *ufunc, NPY_CASTING
+                              casting, PyArrayObject
+                              **operands, PyObject
+                              *type_tup, PyArray_Descr **out_dtypes)
+
+
+This function applies the default type resolution rules
+for the provided ufunc.
+
+Returns 0 on success, -1 on error.
+
+::
+
+  int
+  PyUFunc_ValidateCasting(PyUFuncObject *ufunc, NPY_CASTING
+                          casting, PyArrayObject
+                          **operands, PyArray_Descr **dtypes)
+
+
+Validates that the input operands can be cast to
+the input types, and the output types can be cast to
+the output operands where provided.
+
+Returns 0 on success, -1 (with exception raised) on validation failure.
+
+::
+
+  int
+  PyUFunc_RegisterLoopForDescr(PyUFuncObject *ufunc, PyArray_Descr
+                               *user_dtype, PyUFuncGenericFunction
+                               function, PyArray_Descr
+                               **arg_dtypes, void *data)
+
+
+::
+
+  PyObject *
+  PyUFunc_FromFuncAndDataAndSignatureAndIdentity(PyUFuncGenericFunction
+                                                 *func, void
+                                                 **data, char
+                                                 *types, int ntypes, int
+                                                 nin, int nout, int
+                                                 identity, const char
+                                                 *name, const char
+                                                 *doc, const int
+                                                 unused, const char
+                                                 *signature, PyObject
+                                                 *identity_value)
+
+
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/ufuncobject.h b/venv/Lib/site-packages/numpy/core/include/numpy/ufuncobject.h
new file mode 100644
index 000000000..e5d845842
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/ufuncobject.h
@@ -0,0 +1,369 @@
+#ifndef Py_UFUNCOBJECT_H
+#define Py_UFUNCOBJECT_H
+
+#include <numpy/npy_math.h>
+#include <numpy/npy_common.h>
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*
+ * The legacy generic inner loop for a standard element-wise or
+ * generalized ufunc.
+ */
+typedef void (*PyUFuncGenericFunction)
+            (char **args,
+             npy_intp const *dimensions,
+             npy_intp const *strides,
+             void *innerloopdata);
+
+/*
+ * The most generic one-dimensional inner loop for
+ * a masked standard element-wise ufunc. "Masked" here means that it skips
+ * doing calculations on any items for which the maskptr array has a true
+ * value.
+ */
+typedef void (PyUFunc_MaskedStridedInnerLoopFunc)(
+                char **dataptrs, npy_intp *strides,
+                char *maskptr, npy_intp mask_stride,
+                npy_intp count,
+                NpyAuxData *innerloopdata);
+
+/* Forward declaration for the type resolver and loop selector typedefs */
+struct _tagPyUFuncObject;
+
+/*
+ * Given the operands for calling a ufunc, should determine the
+ * calculation input and output data types and return an inner loop function.
+ * This function should validate that the casting rule is being followed,
+ * and fail if it is not.
+ *
+ * For backwards compatibility, the regular type resolution function does not
+ * support auxiliary data with object semantics. The type resolution call
+ * which returns a masked generic function returns a standard NpyAuxData
+ * object, for which the NPY_AUXDATA_FREE and NPY_AUXDATA_CLONE macros
+ * work.
+ *
+ * ufunc:             The ufunc object.
+ * casting:           The 'casting' parameter provided to the ufunc.
+ * operands:          An array of length (ufunc->nin + ufunc->nout),
+ *                    with the output parameters possibly NULL.
+ * type_tup:          Either NULL, or the type_tup passed to the ufunc.
+ * out_dtypes:        An array which should be populated with new
+ *                    references to (ufunc->nin + ufunc->nout) new
+ *                    dtypes, one for each input and output. These
+ *                    dtypes should all be in native-endian format.
+ *
+ * Should return 0 on success, -1 on failure (with exception set),
+ * or -2 if Py_NotImplemented should be returned.
+ */
+typedef int (PyUFunc_TypeResolutionFunc)(
+                                struct _tagPyUFuncObject *ufunc,
+                                NPY_CASTING casting,
+                                PyArrayObject **operands,
+                                PyObject *type_tup,
+                                PyArray_Descr **out_dtypes);
+
+/*
+ * Given an array of DTypes as returned by the PyUFunc_TypeResolutionFunc,
+ * and an array of fixed strides (the array will contain NPY_MAX_INTP for
+ * strides which are not necessarily fixed), returns an inner loop
+ * with associated auxiliary data.
+ *
+ * For backwards compatibility, there is a variant of the inner loop
+ * selection which returns an inner loop irrespective of the strides,
+ * and with a void* static auxiliary data instead of an NpyAuxData *
+ * dynamically allocatable auxiliary data.
+ *
+ * ufunc:             The ufunc object.
+ * dtypes:            An array which has been populated with dtypes,
+ *                    in most cases by the type resolution function
+ *                    for the same ufunc.
+ * fixed_strides:     For each input/output, either the stride that
+ *                    will be used every time the function is called
+ *                    or NPY_MAX_INTP if the stride might change or
+ *                    is not known ahead of time. The loop selection
+ *                    function may use this stride to pick inner loops
+ *                    which are optimized for contiguous or 0-stride
+ *                    cases.
+ * out_innerloop:     Should be populated with the correct ufunc inner
+ *                    loop for the given type.
+ * out_innerloopdata: Should be populated with the void* data to
+ *                    be passed into the out_innerloop function.
+ * out_needs_api:     If the inner loop needs to use the Python API,
+ *                    should set the to 1, otherwise should leave
+ *                    this untouched.
+ */
+typedef int (PyUFunc_LegacyInnerLoopSelectionFunc)(
+                            struct _tagPyUFuncObject *ufunc,
+                            PyArray_Descr **dtypes,
+                            PyUFuncGenericFunction *out_innerloop,
+                            void **out_innerloopdata,
+                            int *out_needs_api);
+typedef int (PyUFunc_MaskedInnerLoopSelectionFunc)(
+                            struct _tagPyUFuncObject *ufunc,
+                            PyArray_Descr **dtypes,
+                            PyArray_Descr *mask_dtype,
+                            npy_intp *fixed_strides,
+                            npy_intp fixed_mask_stride,
+                            PyUFunc_MaskedStridedInnerLoopFunc **out_innerloop,
+                            NpyAuxData **out_innerloopdata,
+                            int *out_needs_api);
+
+typedef struct _tagPyUFuncObject {
+        PyObject_HEAD
+        /*
+         * nin: Number of inputs
+         * nout: Number of outputs
+         * nargs: Always nin + nout (Why is it stored?)
+         */
+        int nin, nout, nargs;
+
+        /*
+         * Identity for reduction, any of PyUFunc_One, PyUFunc_Zero
+         * PyUFunc_MinusOne, PyUFunc_None, PyUFunc_ReorderableNone,
+         * PyUFunc_IdentityValue.
+         */
+        int identity;
+
+        /* Array of one-dimensional core loops */
+        PyUFuncGenericFunction *functions;
+        /* Array of funcdata that gets passed into the functions */
+        void **data;
+        /* The number of elements in 'functions' and 'data' */
+        int ntypes;
+
+        /* Used to be unused field 'check_return' */
+        int reserved1;
+
+        /* The name of the ufunc */
+        const char *name;
+
+        /* Array of type numbers, of size ('nargs' * 'ntypes') */
+        char *types;
+
+        /* Documentation string */
+        const char *doc;
+
+        void *ptr;
+        PyObject *obj;
+        PyObject *userloops;
+
+        /* generalized ufunc parameters */
+
+        /* 0 for scalar ufunc; 1 for generalized ufunc */
+        int core_enabled;
+        /* number of distinct dimension names in signature */
+        int core_num_dim_ix;
+
+        /*
+         * dimension indices of input/output argument k are stored in
+         * core_dim_ixs[core_offsets[k]..core_offsets[k]+core_num_dims[k]-1]
+         */
+
+        /* numbers of core dimensions of each argument */
+        int *core_num_dims;
+        /*
+         * dimension indices in a flatted form; indices
+         * are in the range of [0,core_num_dim_ix)
+         */
+        int *core_dim_ixs;
+        /*
+         * positions of 1st core dimensions of each
+         * argument in core_dim_ixs, equivalent to cumsum(core_num_dims)
+         */
+        int *core_offsets;
+        /* signature string for printing purpose */
+        char *core_signature;
+
+        /*
+         * A function which resolves the types and fills an array
+         * with the dtypes for the inputs and outputs.
+         */
+        PyUFunc_TypeResolutionFunc *type_resolver;
+        /*
+         * A function which returns an inner loop written for
+         * NumPy 1.6 and earlier ufuncs. This is for backwards
+         * compatibility, and may be NULL if inner_loop_selector
+         * is specified.
+         */
+        PyUFunc_LegacyInnerLoopSelectionFunc *legacy_inner_loop_selector;
+        /*
+         * This was blocked off to be the "new" inner loop selector in 1.7,
+         * but this was never implemented. (This is also why the above
+         * selector is called the "legacy" selector.)
+         */
+        void *reserved2;
+        /*
+         * A function which returns a masked inner loop for the ufunc.
+         */
+        PyUFunc_MaskedInnerLoopSelectionFunc *masked_inner_loop_selector;
+
+        /*
+         * List of flags for each operand when ufunc is called by nditer object.
+         * These flags will be used in addition to the default flags for each
+         * operand set by nditer object.
+         */
+        npy_uint32 *op_flags;
+
+        /*
+         * List of global flags used when ufunc is called by nditer object.
+         * These flags will be used in addition to the default global flags
+         * set by nditer object.
+         */
+        npy_uint32 iter_flags;
+
+        /* New in NPY_API_VERSION 0x0000000D and above */
+
+        /*
+         * for each core_num_dim_ix distinct dimension names,
+         * the possible "frozen" size (-1 if not frozen).
+         */
+        npy_intp *core_dim_sizes;
+
+        /*
+         * for each distinct core dimension, a set of UFUNC_CORE_DIM* flags
+         */
+        npy_uint32 *core_dim_flags;
+
+        /* Identity for reduction, when identity == PyUFunc_IdentityValue */
+        PyObject *identity_value;
+
+} PyUFuncObject;
+
+#include "arrayobject.h"
+/* Generalized ufunc; 0x0001 reserved for possible use as CORE_ENABLED */
+/* the core dimension's size will be determined by the operands. */
+#define UFUNC_CORE_DIM_SIZE_INFERRED 0x0002
+/* the core dimension may be absent */
+#define UFUNC_CORE_DIM_CAN_IGNORE 0x0004
+/* flags inferred during execution */
+#define UFUNC_CORE_DIM_MISSING 0x00040000
+
+#define UFUNC_ERR_IGNORE 0
+#define UFUNC_ERR_WARN   1
+#define UFUNC_ERR_RAISE  2
+#define UFUNC_ERR_CALL   3
+#define UFUNC_ERR_PRINT  4
+#define UFUNC_ERR_LOG    5
+
+        /* Python side integer mask */
+
+#define UFUNC_MASK_DIVIDEBYZERO 0x07
+#define UFUNC_MASK_OVERFLOW 0x3f
+#define UFUNC_MASK_UNDERFLOW 0x1ff
+#define UFUNC_MASK_INVALID 0xfff
+
+#define UFUNC_SHIFT_DIVIDEBYZERO 0
+#define UFUNC_SHIFT_OVERFLOW     3
+#define UFUNC_SHIFT_UNDERFLOW    6
+#define UFUNC_SHIFT_INVALID      9
+
+
+#define UFUNC_OBJ_ISOBJECT      1
+#define UFUNC_OBJ_NEEDS_API     2
+
+   /* Default user error mode */
+#define UFUNC_ERR_DEFAULT                               \
+        (UFUNC_ERR_WARN << UFUNC_SHIFT_DIVIDEBYZERO) +  \
+        (UFUNC_ERR_WARN << UFUNC_SHIFT_OVERFLOW) +      \
+        (UFUNC_ERR_WARN << UFUNC_SHIFT_INVALID)
+
+#if NPY_ALLOW_THREADS
+#define NPY_LOOP_BEGIN_THREADS do {if (!(loop->obj & UFUNC_OBJ_NEEDS_API)) _save = PyEval_SaveThread();} while (0);
+#define NPY_LOOP_END_THREADS   do {if (!(loop->obj & UFUNC_OBJ_NEEDS_API)) PyEval_RestoreThread(_save);} while (0);
+#else
+#define NPY_LOOP_BEGIN_THREADS
+#define NPY_LOOP_END_THREADS
+#endif
+
+/*
+ * UFunc has unit of 0, and the order of operations can be reordered
+ * This case allows reduction with multiple axes at once.
+ */
+#define PyUFunc_Zero 0
+/*
+ * UFunc has unit of 1, and the order of operations can be reordered
+ * This case allows reduction with multiple axes at once.
+ */
+#define PyUFunc_One 1
+/*
+ * UFunc has unit of -1, and the order of operations can be reordered
+ * This case allows reduction with multiple axes at once. Intended for
+ * bitwise_and reduction.
+ */
+#define PyUFunc_MinusOne 2
+/*
+ * UFunc has no unit, and the order of operations cannot be reordered.
+ * This case does not allow reduction with multiple axes at once.
+ */
+#define PyUFunc_None -1
+/*
+ * UFunc has no unit, and the order of operations can be reordered
+ * This case allows reduction with multiple axes at once.
+ */
+#define PyUFunc_ReorderableNone -2
+/*
+ * UFunc unit is an identity_value, and the order of operations can be reordered
+ * This case allows reduction with multiple axes at once.
+ */
+#define PyUFunc_IdentityValue -3
+
+
+#define UFUNC_REDUCE 0
+#define UFUNC_ACCUMULATE 1
+#define UFUNC_REDUCEAT 2
+#define UFUNC_OUTER 3
+
+
+typedef struct {
+        int nin;
+        int nout;
+        PyObject *callable;
+} PyUFunc_PyFuncData;
+
+/* A linked-list of function information for
+   user-defined 1-d loops.
+ */
+typedef struct _loop1d_info {
+        PyUFuncGenericFunction func;
+        void *data;
+        int *arg_types;
+        struct _loop1d_info *next;
+        int nargs;
+        PyArray_Descr **arg_dtypes;
+} PyUFunc_Loop1d;
+
+
+#include "__ufunc_api.h"
+
+#define UFUNC_PYVALS_NAME "UFUNC_PYVALS"
+
+/*
+ * THESE MACROS ARE DEPRECATED.
+ * Use npy_set_floatstatus_* in the npymath library.
+ */
+#define UFUNC_FPE_DIVIDEBYZERO  NPY_FPE_DIVIDEBYZERO
+#define UFUNC_FPE_OVERFLOW      NPY_FPE_OVERFLOW
+#define UFUNC_FPE_UNDERFLOW     NPY_FPE_UNDERFLOW
+#define UFUNC_FPE_INVALID       NPY_FPE_INVALID
+
+#define generate_divbyzero_error() npy_set_floatstatus_divbyzero()
+#define generate_overflow_error() npy_set_floatstatus_overflow()
+
+  /* Make sure it gets defined if it isn't already */
+#ifndef UFUNC_NOFPE
+/* Clear the floating point exception default of Borland C++ */
+#if defined(__BORLANDC__)
+#define UFUNC_NOFPE _control87(MCW_EM, MCW_EM);
+#else
+#define UFUNC_NOFPE
+#endif
+#endif
+
+
+#ifdef __cplusplus
+}
+#endif
+#endif /* !Py_UFUNCOBJECT_H */
diff --git a/venv/Lib/site-packages/numpy/core/include/numpy/utils.h b/venv/Lib/site-packages/numpy/core/include/numpy/utils.h
new file mode 100644
index 000000000..32218b8c7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/include/numpy/utils.h
@@ -0,0 +1,21 @@
+#ifndef __NUMPY_UTILS_HEADER__
+#define __NUMPY_UTILS_HEADER__
+
+#ifndef __COMP_NPY_UNUSED
+        #if defined(__GNUC__)
+                #define __COMP_NPY_UNUSED __attribute__ ((__unused__))
+        # elif defined(__ICC)
+                #define __COMP_NPY_UNUSED __attribute__ ((__unused__))
+        # elif defined(__clang__)
+                #define __COMP_NPY_UNUSED __attribute__ ((unused))
+        #else
+                #define __COMP_NPY_UNUSED
+        #endif
+#endif
+
+/* Use this to tag a variable as not used. It will remove unused variable
+ * warning on support platforms (see __COM_NPY_UNUSED) and mangle the variable
+ * to avoid accidental use */
+#define NPY_UNUSED(x) (__NPY_UNUSED_TAGGED ## x) __COMP_NPY_UNUSED
+
+#endif
diff --git a/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/mlib.ini b/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/mlib.ini
new file mode 100644
index 000000000..1e70ccb6c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/mlib.ini
@@ -0,0 +1,12 @@
+[meta]
+Name = mlib
+Description = Math library used with this version of numpy
+Version = 1.0
+
+[default]
+Libs=
+Cflags=
+
+[msvc]
+Libs=
+Cflags=
diff --git a/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/npymath.ini b/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/npymath.ini
new file mode 100644
index 000000000..ec63fa898
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/lib/npy-pkg-config/npymath.ini
@@ -0,0 +1,20 @@
+[meta]
+Name=npymath
+Description=Portable, core math library implementing C99 standard
+Version=0.1
+
+[variables]
+pkgname=numpy.core
+prefix=${pkgdir}
+libdir=${prefix}\lib
+includedir=${prefix}\include
+
+[default]
+Libs=-L${libdir} -lnpymath
+Cflags=-I${includedir}
+Requires=mlib
+
+[msvc]
+Libs=/LIBPATH:${libdir} npymath.lib
+Cflags=/INCLUDE:${includedir}
+Requires=mlib
diff --git a/venv/Lib/site-packages/numpy/core/lib/npymath.lib b/venv/Lib/site-packages/numpy/core/lib/npymath.lib
new file mode 100644
index 000000000..36e447e89
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/lib/npymath.lib differ
diff --git a/venv/Lib/site-packages/numpy/core/machar.py b/venv/Lib/site-packages/numpy/core/machar.py
new file mode 100644
index 000000000..a48dc3d50
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/machar.py
@@ -0,0 +1,342 @@
+"""
+Machine arithmetics - determine the parameters of the
+floating-point arithmetic system
+
+Author: Pearu Peterson, September 2003
+
+"""
+__all__ = ['MachAr']
+
+from numpy.core.fromnumeric import any
+from numpy.core._ufunc_config import errstate
+from numpy.core.overrides import set_module
+
+# Need to speed this up...especially for longfloat
+
+@set_module('numpy')
+class MachAr:
+    """
+    Diagnosing machine parameters.
+
+    Attributes
+    ----------
+    ibeta : int
+        Radix in which numbers are represented.
+    it : int
+        Number of base-`ibeta` digits in the floating point mantissa M.
+    machep : int
+        Exponent of the smallest (most negative) power of `ibeta` that,
+        added to 1.0, gives something different from 1.0
+    eps : float
+        Floating-point number ``beta**machep`` (floating point precision)
+    negep : int
+        Exponent of the smallest power of `ibeta` that, subtracted
+        from 1.0, gives something different from 1.0.
+    epsneg : float
+        Floating-point number ``beta**negep``.
+    iexp : int
+        Number of bits in the exponent (including its sign and bias).
+    minexp : int
+        Smallest (most negative) power of `ibeta` consistent with there
+        being no leading zeros in the mantissa.
+    xmin : float
+        Floating point number ``beta**minexp`` (the smallest [in
+        magnitude] usable floating value).
+    maxexp : int
+        Smallest (positive) power of `ibeta` that causes overflow.
+    xmax : float
+        ``(1-epsneg) * beta**maxexp`` (the largest [in magnitude]
+        usable floating value).
+    irnd : int
+        In ``range(6)``, information on what kind of rounding is done
+        in addition, and on how underflow is handled.
+    ngrd : int
+        Number of 'guard digits' used when truncating the product
+        of two mantissas to fit the representation.
+    epsilon : float
+        Same as `eps`.
+    tiny : float
+        Same as `xmin`.
+    huge : float
+        Same as `xmax`.
+    precision : float
+        ``- int(-log10(eps))``
+    resolution : float
+        ``- 10**(-precision)``
+
+    Parameters
+    ----------
+    float_conv : function, optional
+        Function that converts an integer or integer array to a float
+        or float array. Default is `float`.
+    int_conv : function, optional
+        Function that converts a float or float array to an integer or
+        integer array. Default is `int`.
+    float_to_float : function, optional
+        Function that converts a float array to float. Default is `float`.
+        Note that this does not seem to do anything useful in the current
+        implementation.
+    float_to_str : function, optional
+        Function that converts a single float to a string. Default is
+        ``lambda v:'%24.16e' %v``.
+    title : str, optional
+        Title that is printed in the string representation of `MachAr`.
+
+    See Also
+    --------
+    finfo : Machine limits for floating point types.
+    iinfo : Machine limits for integer types.
+
+    References
+    ----------
+    .. [1] Press, Teukolsky, Vetterling and Flannery,
+           "Numerical Recipes in C++," 2nd ed,
+           Cambridge University Press, 2002, p. 31.
+
+    """
+
+    def __init__(self, float_conv=float,int_conv=int,
+                 float_to_float=float,
+                 float_to_str=lambda v:'%24.16e' % v,
+                 title='Python floating point number'):
+        """
+
+        float_conv - convert integer to float (array)
+        int_conv   - convert float (array) to integer
+        float_to_float - convert float array to float
+        float_to_str - convert array float to str
+        title        - description of used floating point numbers
+
+        """
+        # We ignore all errors here because we are purposely triggering
+        # underflow to detect the properties of the runninng arch.
+        with errstate(under='ignore'):
+            self._do_init(float_conv, int_conv, float_to_float, float_to_str, title)
+
+    def _do_init(self, float_conv, int_conv, float_to_float, float_to_str, title):
+        max_iterN = 10000
+        msg = "Did not converge after %d tries with %s"
+        one = float_conv(1)
+        two = one + one
+        zero = one - one
+
+        # Do we really need to do this?  Aren't they 2 and 2.0?
+        # Determine ibeta and beta
+        a = one
+        for _ in range(max_iterN):
+            a = a + a
+            temp = a + one
+            temp1 = temp - a
+            if any(temp1 - one != zero):
+                break
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        b = one
+        for _ in range(max_iterN):
+            b = b + b
+            temp = a + b
+            itemp = int_conv(temp-a)
+            if any(itemp != 0):
+                break
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        ibeta = itemp
+        beta = float_conv(ibeta)
+
+        # Determine it and irnd
+        it = -1
+        b = one
+        for _ in range(max_iterN):
+            it = it + 1
+            b = b * beta
+            temp = b + one
+            temp1 = temp - b
+            if any(temp1 - one != zero):
+                break
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+
+        betah = beta / two
+        a = one
+        for _ in range(max_iterN):
+            a = a + a
+            temp = a + one
+            temp1 = temp - a
+            if any(temp1 - one != zero):
+                break
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        temp = a + betah
+        irnd = 0
+        if any(temp-a != zero):
+            irnd = 1
+        tempa = a + beta
+        temp = tempa + betah
+        if irnd == 0 and any(temp-tempa != zero):
+            irnd = 2
+
+        # Determine negep and epsneg
+        negep = it + 3
+        betain = one / beta
+        a = one
+        for i in range(negep):
+            a = a * betain
+        b = a
+        for _ in range(max_iterN):
+            temp = one - a
+            if any(temp-one != zero):
+                break
+            a = a * beta
+            negep = negep - 1
+            # Prevent infinite loop on PPC with gcc 4.0:
+            if negep < 0:
+                raise RuntimeError("could not determine machine tolerance "
+                                   "for 'negep', locals() -> %s" % (locals()))
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        negep = -negep
+        epsneg = a
+
+        # Determine machep and eps
+        machep = - it - 3
+        a = b
+
+        for _ in range(max_iterN):
+            temp = one + a
+            if any(temp-one != zero):
+                break
+            a = a * beta
+            machep = machep + 1
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        eps = a
+
+        # Determine ngrd
+        ngrd = 0
+        temp = one + eps
+        if irnd == 0 and any(temp*one - one != zero):
+            ngrd = 1
+
+        # Determine iexp
+        i = 0
+        k = 1
+        z = betain
+        t = one + eps
+        nxres = 0
+        for _ in range(max_iterN):
+            y = z
+            z = y*y
+            a = z*one  # Check here for underflow
+            temp = z*t
+            if any(a+a == zero) or any(abs(z) >= y):
+                break
+            temp1 = temp * betain
+            if any(temp1*beta == z):
+                break
+            i = i + 1
+            k = k + k
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        if ibeta != 10:
+            iexp = i + 1
+            mx = k + k
+        else:
+            iexp = 2
+            iz = ibeta
+            while k >= iz:
+                iz = iz * ibeta
+                iexp = iexp + 1
+            mx = iz + iz - 1
+
+        # Determine minexp and xmin
+        for _ in range(max_iterN):
+            xmin = y
+            y = y * betain
+            a = y * one
+            temp = y * t
+            if any((a + a) != zero) and any(abs(y) < xmin):
+                k = k + 1
+                temp1 = temp * betain
+                if any(temp1*beta == y) and any(temp != y):
+                    nxres = 3
+                    xmin = y
+                    break
+            else:
+                break
+        else:
+            raise RuntimeError(msg % (_, one.dtype))
+        minexp = -k
+
+        # Determine maxexp, xmax
+        if mx <= k + k - 3 and ibeta != 10:
+            mx = mx + mx
+            iexp = iexp + 1
+        maxexp = mx + minexp
+        irnd = irnd + nxres
+        if irnd >= 2:
+            maxexp = maxexp - 2
+        i = maxexp + minexp
+        if ibeta == 2 and not i:
+            maxexp = maxexp - 1
+        if i > 20:
+            maxexp = maxexp - 1
+        if any(a != y):
+            maxexp = maxexp - 2
+        xmax = one - epsneg
+        if any(xmax*one != xmax):
+            xmax = one - beta*epsneg
+        xmax = xmax / (xmin*beta*beta*beta)
+        i = maxexp + minexp + 3
+        for j in range(i):
+            if ibeta == 2:
+                xmax = xmax + xmax
+            else:
+                xmax = xmax * beta
+
+        self.ibeta = ibeta
+        self.it = it
+        self.negep = negep
+        self.epsneg = float_to_float(epsneg)
+        self._str_epsneg = float_to_str(epsneg)
+        self.machep = machep
+        self.eps = float_to_float(eps)
+        self._str_eps = float_to_str(eps)
+        self.ngrd = ngrd
+        self.iexp = iexp
+        self.minexp = minexp
+        self.xmin = float_to_float(xmin)
+        self._str_xmin = float_to_str(xmin)
+        self.maxexp = maxexp
+        self.xmax = float_to_float(xmax)
+        self._str_xmax = float_to_str(xmax)
+        self.irnd = irnd
+
+        self.title = title
+        # Commonly used parameters
+        self.epsilon = self.eps
+        self.tiny = self.xmin
+        self.huge = self.xmax
+
+        import math
+        self.precision = int(-math.log10(float_to_float(self.eps)))
+        ten = two + two + two + two + two
+        resolution = ten ** (-self.precision)
+        self.resolution = float_to_float(resolution)
+        self._str_resolution = float_to_str(resolution)
+
+    def __str__(self):
+        fmt = (
+           'Machine parameters for %(title)s\n'
+           '---------------------------------------------------------------------\n'
+           'ibeta=%(ibeta)s it=%(it)s iexp=%(iexp)s ngrd=%(ngrd)s irnd=%(irnd)s\n'
+           'machep=%(machep)s     eps=%(_str_eps)s (beta**machep == epsilon)\n'
+           'negep =%(negep)s  epsneg=%(_str_epsneg)s (beta**epsneg)\n'
+           'minexp=%(minexp)s   xmin=%(_str_xmin)s (beta**minexp == tiny)\n'
+           'maxexp=%(maxexp)s    xmax=%(_str_xmax)s ((1-epsneg)*beta**maxexp == huge)\n'
+           '---------------------------------------------------------------------\n'
+           )
+        return fmt % self.__dict__
+
+
+if __name__ == '__main__':
+    print(MachAr())
diff --git a/venv/Lib/site-packages/numpy/core/memmap.py b/venv/Lib/site-packages/numpy/core/memmap.py
new file mode 100644
index 000000000..cb025736e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/memmap.py
@@ -0,0 +1,334 @@
+import numpy as np
+from .numeric import uint8, ndarray, dtype
+from numpy.compat import (
+    os_fspath, contextlib_nullcontext, is_pathlib_path
+)
+from numpy.core.overrides import set_module
+
+__all__ = ['memmap']
+
+dtypedescr = dtype
+valid_filemodes = ["r", "c", "r+", "w+"]
+writeable_filemodes = ["r+", "w+"]
+
+mode_equivalents = {
+    "readonly":"r",
+    "copyonwrite":"c",
+    "readwrite":"r+",
+    "write":"w+"
+    }
+
+
+@set_module('numpy')
+class memmap(ndarray):
+    """Create a memory-map to an array stored in a *binary* file on disk.
+
+    Memory-mapped files are used for accessing small segments of large files
+    on disk, without reading the entire file into memory.  NumPy's
+    memmap's are array-like objects.  This differs from Python's ``mmap``
+    module, which uses file-like objects.
+
+    This subclass of ndarray has some unpleasant interactions with
+    some operations, because it doesn't quite fit properly as a subclass.
+    An alternative to using this subclass is to create the ``mmap``
+    object yourself, then create an ndarray with ndarray.__new__ directly,
+    passing the object created in its 'buffer=' parameter.
+
+    This class may at some point be turned into a factory function
+    which returns a view into an mmap buffer.
+
+    Delete the memmap instance to close the memmap file.
+
+
+    Parameters
+    ----------
+    filename : str, file-like object, or pathlib.Path instance
+        The file name or file object to be used as the array data buffer.
+    dtype : data-type, optional
+        The data-type used to interpret the file contents.
+        Default is `uint8`.
+    mode : {'r+', 'r', 'w+', 'c'}, optional
+        The file is opened in this mode:
+
+        +------+-------------------------------------------------------------+
+        | 'r'  | Open existing file for reading only.                        |
+        +------+-------------------------------------------------------------+
+        | 'r+' | Open existing file for reading and writing.                 |
+        +------+-------------------------------------------------------------+
+        | 'w+' | Create or overwrite existing file for reading and writing.  |
+        +------+-------------------------------------------------------------+
+        | 'c'  | Copy-on-write: assignments affect data in memory, but       |
+        |      | changes are not saved to disk.  The file on disk is         |
+        |      | read-only.                                                  |
+        +------+-------------------------------------------------------------+
+
+        Default is 'r+'.
+    offset : int, optional
+        In the file, array data starts at this offset. Since `offset` is
+        measured in bytes, it should normally be a multiple of the byte-size
+        of `dtype`. When ``mode != 'r'``, even positive offsets beyond end of
+        file are valid; The file will be extended to accommodate the
+        additional data. By default, ``memmap`` will start at the beginning of
+        the file, even if ``filename`` is a file pointer ``fp`` and
+        ``fp.tell() != 0``.
+    shape : tuple, optional
+        The desired shape of the array. If ``mode == 'r'`` and the number
+        of remaining bytes after `offset` is not a multiple of the byte-size
+        of `dtype`, you must specify `shape`. By default, the returned array
+        will be 1-D with the number of elements determined by file size
+        and data-type.
+    order : {'C', 'F'}, optional
+        Specify the order of the ndarray memory layout:
+        :term:`row-major`, C-style or :term:`column-major`,
+        Fortran-style.  This only has an effect if the shape is
+        greater than 1-D.  The default order is 'C'.
+
+    Attributes
+    ----------
+    filename : str or pathlib.Path instance
+        Path to the mapped file.
+    offset : int
+        Offset position in the file.
+    mode : str
+        File mode.
+
+    Methods
+    -------
+    flush
+        Flush any changes in memory to file on disk.
+        When you delete a memmap object, flush is called first to write
+        changes to disk before removing the object.
+
+
+    See also
+    --------
+    lib.format.open_memmap : Create or load a memory-mapped ``.npy`` file.
+
+    Notes
+    -----
+    The memmap object can be used anywhere an ndarray is accepted.
+    Given a memmap ``fp``, ``isinstance(fp, numpy.ndarray)`` returns
+    ``True``.
+    
+    Memory-mapped files cannot be larger than 2GB on 32-bit systems.
+
+    When a memmap causes a file to be created or extended beyond its
+    current size in the filesystem, the contents of the new part are
+    unspecified. On systems with POSIX filesystem semantics, the extended
+    part will be filled with zero bytes.
+
+    Examples
+    --------
+    >>> data = np.arange(12, dtype='float32')
+    >>> data.resize((3,4))
+
+    This example uses a temporary file so that doctest doesn't write
+    files to your directory. You would use a 'normal' filename.
+
+    >>> from tempfile import mkdtemp
+    >>> import os.path as path
+    >>> filename = path.join(mkdtemp(), 'newfile.dat')
+
+    Create a memmap with dtype and shape that matches our data:
+
+    >>> fp = np.memmap(filename, dtype='float32', mode='w+', shape=(3,4))
+    >>> fp
+    memmap([[0., 0., 0., 0.],
+            [0., 0., 0., 0.],
+            [0., 0., 0., 0.]], dtype=float32)
+
+    Write data to memmap array:
+
+    >>> fp[:] = data[:]
+    >>> fp
+    memmap([[  0.,   1.,   2.,   3.],
+            [  4.,   5.,   6.,   7.],
+            [  8.,   9.,  10.,  11.]], dtype=float32)
+
+    >>> fp.filename == path.abspath(filename)
+    True
+
+    Deletion flushes memory changes to disk before removing the object:
+
+    >>> del fp
+
+    Load the memmap and verify data was stored:
+
+    >>> newfp = np.memmap(filename, dtype='float32', mode='r', shape=(3,4))
+    >>> newfp
+    memmap([[  0.,   1.,   2.,   3.],
+            [  4.,   5.,   6.,   7.],
+            [  8.,   9.,  10.,  11.]], dtype=float32)
+
+    Read-only memmap:
+
+    >>> fpr = np.memmap(filename, dtype='float32', mode='r', shape=(3,4))
+    >>> fpr.flags.writeable
+    False
+
+    Copy-on-write memmap:
+
+    >>> fpc = np.memmap(filename, dtype='float32', mode='c', shape=(3,4))
+    >>> fpc.flags.writeable
+    True
+
+    It's possible to assign to copy-on-write array, but values are only
+    written into the memory copy of the array, and not written to disk:
+
+    >>> fpc
+    memmap([[  0.,   1.,   2.,   3.],
+            [  4.,   5.,   6.,   7.],
+            [  8.,   9.,  10.,  11.]], dtype=float32)
+    >>> fpc[0,:] = 0
+    >>> fpc
+    memmap([[  0.,   0.,   0.,   0.],
+            [  4.,   5.,   6.,   7.],
+            [  8.,   9.,  10.,  11.]], dtype=float32)
+
+    File on disk is unchanged:
+
+    >>> fpr
+    memmap([[  0.,   1.,   2.,   3.],
+            [  4.,   5.,   6.,   7.],
+            [  8.,   9.,  10.,  11.]], dtype=float32)
+
+    Offset into a memmap:
+
+    >>> fpo = np.memmap(filename, dtype='float32', mode='r', offset=16)
+    >>> fpo
+    memmap([  4.,   5.,   6.,   7.,   8.,   9.,  10.,  11.], dtype=float32)
+
+    """
+
+    __array_priority__ = -100.0
+
+    def __new__(subtype, filename, dtype=uint8, mode='r+', offset=0,
+                shape=None, order='C'):
+        # Import here to minimize 'import numpy' overhead
+        import mmap
+        import os.path
+        try:
+            mode = mode_equivalents[mode]
+        except KeyError as e:
+            if mode not in valid_filemodes:
+                raise ValueError(
+                    "mode must be one of {!r} (got {!r})"
+                    .format(valid_filemodes + list(mode_equivalents.keys()), mode)
+                ) from None
+
+        if mode == 'w+' and shape is None:
+            raise ValueError("shape must be given")
+
+        if hasattr(filename, 'read'):
+            f_ctx = contextlib_nullcontext(filename)
+        else:
+            f_ctx = open(os_fspath(filename), ('r' if mode == 'c' else mode)+'b')
+
+        with f_ctx as fid:
+            fid.seek(0, 2)
+            flen = fid.tell()
+            descr = dtypedescr(dtype)
+            _dbytes = descr.itemsize
+
+            if shape is None:
+                bytes = flen - offset
+                if bytes % _dbytes:
+                    raise ValueError("Size of available data is not a "
+                            "multiple of the data-type size.")
+                size = bytes // _dbytes
+                shape = (size,)
+            else:
+                if not isinstance(shape, tuple):
+                    shape = (shape,)
+                size = np.intp(1)  # avoid default choice of np.int_, which might overflow
+                for k in shape:
+                    size *= k
+
+            bytes = int(offset + size*_dbytes)
+
+            if mode in ('w+', 'r+') and flen < bytes:
+                fid.seek(bytes - 1, 0)
+                fid.write(b'\0')
+                fid.flush()
+
+            if mode == 'c':
+                acc = mmap.ACCESS_COPY
+            elif mode == 'r':
+                acc = mmap.ACCESS_READ
+            else:
+                acc = mmap.ACCESS_WRITE
+
+            start = offset - offset % mmap.ALLOCATIONGRANULARITY
+            bytes -= start
+            array_offset = offset - start
+            mm = mmap.mmap(fid.fileno(), bytes, access=acc, offset=start)
+
+            self = ndarray.__new__(subtype, shape, dtype=descr, buffer=mm,
+                                   offset=array_offset, order=order)
+            self._mmap = mm
+            self.offset = offset
+            self.mode = mode
+
+            if is_pathlib_path(filename):
+                # special case - if we were constructed with a pathlib.path,
+                # then filename is a path object, not a string
+                self.filename = filename.resolve()
+            elif hasattr(fid, "name") and isinstance(fid.name, str):
+                # py3 returns int for TemporaryFile().name
+                self.filename = os.path.abspath(fid.name)
+            # same as memmap copies (e.g. memmap + 1)
+            else:
+                self.filename = None
+
+        return self
+
+    def __array_finalize__(self, obj):
+        if hasattr(obj, '_mmap') and np.may_share_memory(self, obj):
+            self._mmap = obj._mmap
+            self.filename = obj.filename
+            self.offset = obj.offset
+            self.mode = obj.mode
+        else:
+            self._mmap = None
+            self.filename = None
+            self.offset = None
+            self.mode = None
+
+    def flush(self):
+        """
+        Write any changes in the array to the file on disk.
+
+        For further information, see `memmap`.
+
+        Parameters
+        ----------
+        None
+
+        See Also
+        --------
+        memmap
+
+        """
+        if self.base is not None and hasattr(self.base, 'flush'):
+            self.base.flush()
+
+    def __array_wrap__(self, arr, context=None):
+        arr = super(memmap, self).__array_wrap__(arr, context)
+
+        # Return a memmap if a memmap was given as the output of the
+        # ufunc. Leave the arr class unchanged if self is not a memmap
+        # to keep original memmap subclasses behavior
+        if self is arr or type(self) is not memmap:
+            return arr
+        # Return scalar instead of 0d memmap, e.g. for np.sum with
+        # axis=None
+        if arr.shape == ():
+            return arr[()]
+        # Return ndarray otherwise
+        return arr.view(np.ndarray)
+
+    def __getitem__(self, index):
+        res = super(memmap, self).__getitem__(index)
+        if type(res) is memmap and res._mmap is None:
+            return res.view(type=ndarray)
+        return res
diff --git a/venv/Lib/site-packages/numpy/core/multiarray.py b/venv/Lib/site-packages/numpy/core/multiarray.py
new file mode 100644
index 000000000..b196687af
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/multiarray.py
@@ -0,0 +1,1662 @@
+"""
+Create the numpy.core.multiarray namespace for backward compatibility. In v1.16
+the multiarray and umath c-extension modules were merged into a single
+_multiarray_umath extension module. So we replicate the old namespace
+by importing from the extension module.
+
+"""
+
+import functools
+import warnings
+
+from . import overrides
+from . import _multiarray_umath
+from ._multiarray_umath import *  # noqa: F403
+# These imports are needed for backward compatibility,
+# do not change them. issue gh-15518
+# _get_ndarray_c_version is semi-public, on purpose not added to __all__
+from ._multiarray_umath import (
+    _fastCopyAndTranspose, _flagdict, _insert, _reconstruct, _vec_string,
+    _ARRAY_API, _monotonicity, _get_ndarray_c_version, _set_madvise_hugepage,
+    )
+
+__all__ = [
+    '_ARRAY_API', 'ALLOW_THREADS', 'BUFSIZE', 'CLIP', 'DATETIMEUNITS',
+    'ITEM_HASOBJECT', 'ITEM_IS_POINTER', 'LIST_PICKLE', 'MAXDIMS',
+    'MAY_SHARE_BOUNDS', 'MAY_SHARE_EXACT', 'NEEDS_INIT', 'NEEDS_PYAPI',
+    'RAISE', 'USE_GETITEM', 'USE_SETITEM', 'WRAP', '_fastCopyAndTranspose',
+    '_flagdict', '_insert', '_reconstruct', '_vec_string', '_monotonicity',
+    'add_docstring', 'arange', 'array', 'bincount', 'broadcast',
+    'busday_count', 'busday_offset', 'busdaycalendar', 'can_cast',
+    'compare_chararrays', 'concatenate', 'copyto', 'correlate', 'correlate2',
+    'count_nonzero', 'c_einsum', 'datetime_as_string', 'datetime_data',
+    'digitize', 'dot', 'dragon4_positional', 'dragon4_scientific', 'dtype',
+    'empty', 'empty_like', 'error', 'flagsobj', 'flatiter', 'format_longfloat',
+    'frombuffer', 'fromfile', 'fromiter', 'fromstring', 'inner',
+    'interp', 'interp_complex', 'is_busday', 'lexsort',
+    'matmul', 'may_share_memory', 'min_scalar_type', 'ndarray', 'nditer',
+    'nested_iters', 'normalize_axis_index', 'packbits',
+    'promote_types', 'putmask', 'ravel_multi_index', 'result_type', 'scalar',
+    'set_datetimeparse_function', 'set_legacy_print_mode', 'set_numeric_ops',
+    'set_string_function', 'set_typeDict', 'shares_memory',
+    'tracemalloc_domain', 'typeinfo', 'unpackbits', 'unravel_index', 'vdot',
+    'where', 'zeros']
+
+# For backward compatibility, make sure pickle imports these functions from here
+_reconstruct.__module__ = 'numpy.core.multiarray'
+scalar.__module__ = 'numpy.core.multiarray'
+
+
+arange.__module__ = 'numpy'
+array.__module__ = 'numpy'
+datetime_data.__module__ = 'numpy'
+empty.__module__ = 'numpy'
+frombuffer.__module__ = 'numpy'
+fromfile.__module__ = 'numpy'
+fromiter.__module__ = 'numpy'
+frompyfunc.__module__ = 'numpy'
+fromstring.__module__ = 'numpy'
+geterrobj.__module__ = 'numpy'
+may_share_memory.__module__ = 'numpy'
+nested_iters.__module__ = 'numpy'
+promote_types.__module__ = 'numpy'
+set_numeric_ops.__module__ = 'numpy'
+seterrobj.__module__ = 'numpy'
+zeros.__module__ = 'numpy'
+
+
+# We can't verify dispatcher signatures because NumPy's C functions don't
+# support introspection.
+array_function_from_c_func_and_dispatcher = functools.partial(
+    overrides.array_function_from_dispatcher,
+    module='numpy', docs_from_dispatcher=True, verify=False)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.empty_like)
+def empty_like(prototype, dtype=None, order=None, subok=None, shape=None):
+    """
+    empty_like(prototype, dtype=None, order='K', subok=True, shape=None)
+
+    Return a new array with the same shape and type as a given array.
+
+    Parameters
+    ----------
+    prototype : array_like
+        The shape and data-type of `prototype` define these same attributes
+        of the returned array.
+    dtype : data-type, optional
+        Overrides the data type of the result.
+
+        .. versionadded:: 1.6.0
+    order : {'C', 'F', 'A', or 'K'}, optional
+        Overrides the memory layout of the result. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if ``prototype`` is Fortran
+        contiguous, 'C' otherwise. 'K' means match the layout of ``prototype``
+        as closely as possible.
+
+        .. versionadded:: 1.6.0
+    subok : bool, optional.
+        If True, then the newly created array will use the sub-class
+        type of 'a', otherwise it will be a base-class array. Defaults
+        to True.
+    shape : int or sequence of ints, optional.
+        Overrides the shape of the result. If order='K' and the number of
+        dimensions is unchanged, will try to keep order, otherwise,
+        order='C' is implied.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    out : ndarray
+        Array of uninitialized (arbitrary) data with the same
+        shape and type as `prototype`.
+
+    See Also
+    --------
+    ones_like : Return an array of ones with shape and type of input.
+    zeros_like : Return an array of zeros with shape and type of input.
+    full_like : Return a new array with shape of input filled with value.
+    empty : Return a new uninitialized array.
+
+    Notes
+    -----
+    This function does *not* initialize the returned array; to do that use
+    `zeros_like` or `ones_like` instead.  It may be marginally faster than
+    the functions that do set the array values.
+
+    Examples
+    --------
+    >>> a = ([1,2,3], [4,5,6])                         # a is array-like
+    >>> np.empty_like(a)
+    array([[-1073741821, -1073741821,           3],    # uninitialized
+           [          0,           0, -1073741821]])
+    >>> a = np.array([[1., 2., 3.],[4.,5.,6.]])
+    >>> np.empty_like(a)
+    array([[ -2.00000715e+000,   1.48219694e-323,  -2.00000572e+000], # uninitialized
+           [  4.38791518e-305,  -2.00000715e+000,   4.17269252e-309]])
+
+    """
+    return (prototype,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.concatenate)
+def concatenate(arrays, axis=None, out=None):
+    """
+    concatenate((a1, a2, ...), axis=0, out=None)
+
+    Join a sequence of arrays along an existing axis.
+
+    Parameters
+    ----------
+    a1, a2, ... : sequence of array_like
+        The arrays must have the same shape, except in the dimension
+        corresponding to `axis` (the first, by default).
+    axis : int, optional
+        The axis along which the arrays will be joined.  If axis is None,
+        arrays are flattened before use.  Default is 0.
+    out : ndarray, optional
+        If provided, the destination to place the result. The shape must be
+        correct, matching that of what concatenate would have returned if no
+        out argument were specified.
+
+    Returns
+    -------
+    res : ndarray
+        The concatenated array.
+
+    See Also
+    --------
+    ma.concatenate : Concatenate function that preserves input masks.
+    array_split : Split an array into multiple sub-arrays of equal or
+                  near-equal size.
+    split : Split array into a list of multiple sub-arrays of equal size.
+    hsplit : Split array into multiple sub-arrays horizontally (column wise).
+    vsplit : Split array into multiple sub-arrays vertically (row wise).
+    dsplit : Split array into multiple sub-arrays along the 3rd axis (depth).
+    stack : Stack a sequence of arrays along a new axis.
+    block : Assemble arrays from blocks.
+    hstack : Stack arrays in sequence horizontally (column wise).
+    vstack : Stack arrays in sequence vertically (row wise).
+    dstack : Stack arrays in sequence depth wise (along third dimension).
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+
+    Notes
+    -----
+    When one or more of the arrays to be concatenated is a MaskedArray,
+    this function will return a MaskedArray object instead of an ndarray,
+    but the input masks are *not* preserved. In cases where a MaskedArray
+    is expected as input, use the ma.concatenate function from the masked
+    array module instead.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> b = np.array([[5, 6]])
+    >>> np.concatenate((a, b), axis=0)
+    array([[1, 2],
+           [3, 4],
+           [5, 6]])
+    >>> np.concatenate((a, b.T), axis=1)
+    array([[1, 2, 5],
+           [3, 4, 6]])
+    >>> np.concatenate((a, b), axis=None)
+    array([1, 2, 3, 4, 5, 6])
+
+    This function will not preserve masking of MaskedArray inputs.
+
+    >>> a = np.ma.arange(3)
+    >>> a[1] = np.ma.masked
+    >>> b = np.arange(2, 5)
+    >>> a
+    masked_array(data=[0, --, 2],
+                 mask=[False,  True, False],
+           fill_value=999999)
+    >>> b
+    array([2, 3, 4])
+    >>> np.concatenate([a, b])
+    masked_array(data=[0, 1, 2, 2, 3, 4],
+                 mask=False,
+           fill_value=999999)
+    >>> np.ma.concatenate([a, b])
+    masked_array(data=[0, --, 2, 2, 3, 4],
+                 mask=[False,  True, False, False, False, False],
+           fill_value=999999)
+
+    """
+    if out is not None:
+        # optimize for the typical case where only arrays is provided
+        arrays = list(arrays)
+        arrays.append(out)
+    return arrays
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.inner)
+def inner(a, b):
+    """
+    inner(a, b)
+
+    Inner product of two arrays.
+
+    Ordinary inner product of vectors for 1-D arrays (without complex
+    conjugation), in higher dimensions a sum product over the last axes.
+
+    Parameters
+    ----------
+    a, b : array_like
+        If `a` and `b` are nonscalar, their last dimensions must match.
+
+    Returns
+    -------
+    out : ndarray
+        `out.shape = a.shape[:-1] + b.shape[:-1]`
+
+    Raises
+    ------
+    ValueError
+        If the last dimension of `a` and `b` has different size.
+
+    See Also
+    --------
+    tensordot : Sum products over arbitrary axes.
+    dot : Generalised matrix product, using second last dimension of `b`.
+    einsum : Einstein summation convention.
+
+    Notes
+    -----
+    For vectors (1-D arrays) it computes the ordinary inner-product::
+
+        np.inner(a, b) = sum(a[:]*b[:])
+
+    More generally, if `ndim(a) = r > 0` and `ndim(b) = s > 0`::
+
+        np.inner(a, b) = np.tensordot(a, b, axes=(-1,-1))
+
+    or explicitly::
+
+        np.inner(a, b)[i0,...,ir-1,j0,...,js-1]
+             = sum(a[i0,...,ir-1,:]*b[j0,...,js-1,:])
+
+    In addition `a` or `b` may be scalars, in which case::
+
+       np.inner(a,b) = a*b
+
+    Examples
+    --------
+    Ordinary inner product for vectors:
+
+    >>> a = np.array([1,2,3])
+    >>> b = np.array([0,1,0])
+    >>> np.inner(a, b)
+    2
+
+    A multidimensional example:
+
+    >>> a = np.arange(24).reshape((2,3,4))
+    >>> b = np.arange(4)
+    >>> np.inner(a, b)
+    array([[ 14,  38,  62],
+           [ 86, 110, 134]])
+
+    An example where `b` is a scalar:
+
+    >>> np.inner(np.eye(2), 7)
+    array([[7., 0.],
+           [0., 7.]])
+
+    """
+    return (a, b)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.where)
+def where(condition, x=None, y=None):
+    """
+    where(condition, [x, y])
+
+    Return elements chosen from `x` or `y` depending on `condition`.
+
+    .. note::
+        When only `condition` is provided, this function is a shorthand for
+        ``np.asarray(condition).nonzero()``. Using `nonzero` directly should be
+        preferred, as it behaves correctly for subclasses. The rest of this
+        documentation covers only the case where all three arguments are
+        provided.
+
+    Parameters
+    ----------
+    condition : array_like, bool
+        Where True, yield `x`, otherwise yield `y`.
+    x, y : array_like
+        Values from which to choose. `x`, `y` and `condition` need to be
+        broadcastable to some shape.
+
+    Returns
+    -------
+    out : ndarray
+        An array with elements from `x` where `condition` is True, and elements
+        from `y` elsewhere.
+
+    See Also
+    --------
+    choose
+    nonzero : The function that is called when x and y are omitted
+
+    Notes
+    -----
+    If all the arrays are 1-D, `where` is equivalent to::
+
+        [xv if c else yv
+         for c, xv, yv in zip(condition, x, y)]
+
+    Examples
+    --------
+    >>> a = np.arange(10)
+    >>> a
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+    >>> np.where(a < 5, a, 10*a)
+    array([ 0,  1,  2,  3,  4, 50, 60, 70, 80, 90])
+
+    This can be used on multidimensional arrays too:
+
+    >>> np.where([[True, False], [True, True]],
+    ...          [[1, 2], [3, 4]],
+    ...          [[9, 8], [7, 6]])
+    array([[1, 8],
+           [3, 4]])
+
+    The shapes of x, y, and the condition are broadcast together:
+
+    >>> x, y = np.ogrid[:3, :4]
+    >>> np.where(x < y, x, 10 + y)  # both x and 10+y are broadcast
+    array([[10,  0,  0,  0],
+           [10, 11,  1,  1],
+           [10, 11, 12,  2]])
+
+    >>> a = np.array([[0, 1, 2],
+    ...               [0, 2, 4],
+    ...               [0, 3, 6]])
+    >>> np.where(a < 4, a, -1)  # -1 is broadcast
+    array([[ 0,  1,  2],
+           [ 0,  2, -1],
+           [ 0,  3, -1]])
+    """
+    return (condition, x, y)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.lexsort)
+def lexsort(keys, axis=None):
+    """
+    lexsort(keys, axis=-1)
+
+    Perform an indirect stable sort using a sequence of keys.
+
+    Given multiple sorting keys, which can be interpreted as columns in a
+    spreadsheet, lexsort returns an array of integer indices that describes
+    the sort order by multiple columns. The last key in the sequence is used
+    for the primary sort order, the second-to-last key for the secondary sort
+    order, and so on. The keys argument must be a sequence of objects that
+    can be converted to arrays of the same shape. If a 2D array is provided
+    for the keys argument, it's rows are interpreted as the sorting keys and
+    sorting is according to the last row, second last row etc.
+
+    Parameters
+    ----------
+    keys : (k, N) array or tuple containing k (N,)-shaped sequences
+        The `k` different "columns" to be sorted.  The last column (or row if
+        `keys` is a 2D array) is the primary sort key.
+    axis : int, optional
+        Axis to be indirectly sorted.  By default, sort over the last axis.
+
+    Returns
+    -------
+    indices : (N,) ndarray of ints
+        Array of indices that sort the keys along the specified axis.
+
+    See Also
+    --------
+    argsort : Indirect sort.
+    ndarray.sort : In-place sort.
+    sort : Return a sorted copy of an array.
+
+    Examples
+    --------
+    Sort names: first by surname, then by name.
+
+    >>> surnames =    ('Hertz',    'Galilei', 'Hertz')
+    >>> first_names = ('Heinrich', 'Galileo', 'Gustav')
+    >>> ind = np.lexsort((first_names, surnames))
+    >>> ind
+    array([1, 2, 0])
+
+    >>> [surnames[i] + ", " + first_names[i] for i in ind]
+    ['Galilei, Galileo', 'Hertz, Gustav', 'Hertz, Heinrich']
+
+    Sort two columns of numbers:
+
+    >>> a = [1,5,1,4,3,4,4] # First column
+    >>> b = [9,4,0,4,0,2,1] # Second column
+    >>> ind = np.lexsort((b,a)) # Sort by a, then by b
+    >>> ind
+    array([2, 0, 4, 6, 5, 3, 1])
+
+    >>> [(a[i],b[i]) for i in ind]
+    [(1, 0), (1, 9), (3, 0), (4, 1), (4, 2), (4, 4), (5, 4)]
+
+    Note that sorting is first according to the elements of ``a``.
+    Secondary sorting is according to the elements of ``b``.
+
+    A normal ``argsort`` would have yielded:
+
+    >>> [(a[i],b[i]) for i in np.argsort(a)]
+    [(1, 9), (1, 0), (3, 0), (4, 4), (4, 2), (4, 1), (5, 4)]
+
+    Structured arrays are sorted lexically by ``argsort``:
+
+    >>> x = np.array([(1,9), (5,4), (1,0), (4,4), (3,0), (4,2), (4,1)],
+    ...              dtype=np.dtype([('x', int), ('y', int)]))
+
+    >>> np.argsort(x) # or np.argsort(x, order=('x', 'y'))
+    array([2, 0, 4, 6, 5, 3, 1])
+
+    """
+    if isinstance(keys, tuple):
+        return keys
+    else:
+        return (keys,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.can_cast)
+def can_cast(from_, to, casting=None):
+    """
+    can_cast(from_, to, casting='safe')
+
+    Returns True if cast between data types can occur according to the
+    casting rule.  If from is a scalar or array scalar, also returns
+    True if the scalar value can be cast without overflow or truncation
+    to an integer.
+
+    Parameters
+    ----------
+    from_ : dtype, dtype specifier, scalar, or array
+        Data type, scalar, or array to cast from.
+    to : dtype or dtype specifier
+        Data type to cast to.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur.
+
+          * 'no' means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
+          * 'safe' means only casts which can preserve values are allowed.
+          * 'same_kind' means only safe casts or casts within a kind,
+            like float64 to float32, are allowed.
+          * 'unsafe' means any data conversions may be done.
+
+    Returns
+    -------
+    out : bool
+        True if cast can occur according to the casting rule.
+
+    Notes
+    -----
+    .. versionchanged:: 1.17.0
+       Casting between a simple data type and a structured one is possible only
+       for "unsafe" casting.  Casting to multiple fields is allowed, but
+       casting from multiple fields is not.
+
+    .. versionchanged:: 1.9.0
+       Casting from numeric to string types in 'safe' casting mode requires
+       that the string dtype length is long enough to store the maximum
+       integer/float value converted.
+
+    See also
+    --------
+    dtype, result_type
+
+    Examples
+    --------
+    Basic examples
+
+    >>> np.can_cast(np.int32, np.int64)
+    True
+    >>> np.can_cast(np.float64, complex)
+    True
+    >>> np.can_cast(complex, float)
+    False
+
+    >>> np.can_cast('i8', 'f8')
+    True
+    >>> np.can_cast('i8', 'f4')
+    False
+    >>> np.can_cast('i4', 'S4')
+    False
+
+    Casting scalars
+
+    >>> np.can_cast(100, 'i1')
+    True
+    >>> np.can_cast(150, 'i1')
+    False
+    >>> np.can_cast(150, 'u1')
+    True
+
+    >>> np.can_cast(3.5e100, np.float32)
+    False
+    >>> np.can_cast(1000.0, np.float32)
+    True
+
+    Array scalar checks the value, array does not
+
+    >>> np.can_cast(np.array(1000.0), np.float32)
+    True
+    >>> np.can_cast(np.array([1000.0]), np.float32)
+    False
+
+    Using the casting rules
+
+    >>> np.can_cast('i8', 'i8', 'no')
+    True
+    >>> np.can_cast('<i8', '>i8', 'no')
+    False
+
+    >>> np.can_cast('<i8', '>i8', 'equiv')
+    True
+    >>> np.can_cast('<i4', '>i8', 'equiv')
+    False
+
+    >>> np.can_cast('<i4', '>i8', 'safe')
+    True
+    >>> np.can_cast('<i8', '>i4', 'safe')
+    False
+
+    >>> np.can_cast('<i8', '>i4', 'same_kind')
+    True
+    >>> np.can_cast('<i8', '>u4', 'same_kind')
+    False
+
+    >>> np.can_cast('<i8', '>u4', 'unsafe')
+    True
+
+    """
+    return (from_,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.min_scalar_type)
+def min_scalar_type(a):
+    """
+    min_scalar_type(a)
+
+    For scalar ``a``, returns the data type with the smallest size
+    and smallest scalar kind which can hold its value.  For non-scalar
+    array ``a``, returns the vector's dtype unmodified.
+
+    Floating point values are not demoted to integers,
+    and complex values are not demoted to floats.
+
+    Parameters
+    ----------
+    a : scalar or array_like
+        The value whose minimal data type is to be found.
+
+    Returns
+    -------
+    out : dtype
+        The minimal data type.
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    See Also
+    --------
+    result_type, promote_types, dtype, can_cast
+
+    Examples
+    --------
+    >>> np.min_scalar_type(10)
+    dtype('uint8')
+
+    >>> np.min_scalar_type(-260)
+    dtype('int16')
+
+    >>> np.min_scalar_type(3.1)
+    dtype('float16')
+
+    >>> np.min_scalar_type(1e50)
+    dtype('float64')
+
+    >>> np.min_scalar_type(np.arange(4,dtype='f8'))
+    dtype('float64')
+
+    """
+    return (a,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.result_type)
+def result_type(*arrays_and_dtypes):
+    """
+    result_type(*arrays_and_dtypes)
+
+    Returns the type that results from applying the NumPy
+    type promotion rules to the arguments.
+
+    Type promotion in NumPy works similarly to the rules in languages
+    like C++, with some slight differences.  When both scalars and
+    arrays are used, the array's type takes precedence and the actual value
+    of the scalar is taken into account.
+
+    For example, calculating 3*a, where a is an array of 32-bit floats,
+    intuitively should result in a 32-bit float output.  If the 3 is a
+    32-bit integer, the NumPy rules indicate it can't convert losslessly
+    into a 32-bit float, so a 64-bit float should be the result type.
+    By examining the value of the constant, '3', we see that it fits in
+    an 8-bit integer, which can be cast losslessly into the 32-bit float.
+
+    Parameters
+    ----------
+    arrays_and_dtypes : list of arrays and dtypes
+        The operands of some operation whose result type is needed.
+
+    Returns
+    -------
+    out : dtype
+        The result type.
+
+    See also
+    --------
+    dtype, promote_types, min_scalar_type, can_cast
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    The specific algorithm used is as follows.
+
+    Categories are determined by first checking which of boolean,
+    integer (int/uint), or floating point (float/complex) the maximum
+    kind of all the arrays and the scalars are.
+
+    If there are only scalars or the maximum category of the scalars
+    is higher than the maximum category of the arrays,
+    the data types are combined with :func:`promote_types`
+    to produce the return value.
+
+    Otherwise, `min_scalar_type` is called on each array, and
+    the resulting data types are all combined with :func:`promote_types`
+    to produce the return value.
+
+    The set of int values is not a subset of the uint values for types
+    with the same number of bits, something not reflected in
+    :func:`min_scalar_type`, but handled as a special case in `result_type`.
+
+    Examples
+    --------
+    >>> np.result_type(3, np.arange(7, dtype='i1'))
+    dtype('int8')
+
+    >>> np.result_type('i4', 'c8')
+    dtype('complex128')
+
+    >>> np.result_type(3.0, -2)
+    dtype('float64')
+
+    """
+    return arrays_and_dtypes
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.dot)
+def dot(a, b, out=None):
+    """
+    dot(a, b, out=None)
+
+    Dot product of two arrays. Specifically,
+
+    - If both `a` and `b` are 1-D arrays, it is inner product of vectors
+      (without complex conjugation).
+
+    - If both `a` and `b` are 2-D arrays, it is matrix multiplication,
+      but using :func:`matmul` or ``a @ b`` is preferred.
+
+    - If either `a` or `b` is 0-D (scalar), it is equivalent to :func:`multiply`
+      and using ``numpy.multiply(a, b)`` or ``a * b`` is preferred.
+
+    - If `a` is an N-D array and `b` is a 1-D array, it is a sum product over
+      the last axis of `a` and `b`.
+
+    - If `a` is an N-D array and `b` is an M-D array (where ``M>=2``), it is a
+      sum product over the last axis of `a` and the second-to-last axis of `b`::
+
+        dot(a, b)[i,j,k,m] = sum(a[i,j,:] * b[k,:,m])
+
+    Parameters
+    ----------
+    a : array_like
+        First argument.
+    b : array_like
+        Second argument.
+    out : ndarray, optional
+        Output argument. This must have the exact kind that would be returned
+        if it was not used. In particular, it must have the right type, must be
+        C-contiguous, and its dtype must be the dtype that would be returned
+        for `dot(a,b)`. This is a performance feature. Therefore, if these
+        conditions are not met, an exception is raised, instead of attempting
+        to be flexible.
+
+    Returns
+    -------
+    output : ndarray
+        Returns the dot product of `a` and `b`.  If `a` and `b` are both
+        scalars or both 1-D arrays then a scalar is returned; otherwise
+        an array is returned.
+        If `out` is given, then it is returned.
+
+    Raises
+    ------
+    ValueError
+        If the last dimension of `a` is not the same size as
+        the second-to-last dimension of `b`.
+
+    See Also
+    --------
+    vdot : Complex-conjugating dot product.
+    tensordot : Sum products over arbitrary axes.
+    einsum : Einstein summation convention.
+    matmul : '@' operator as method with out parameter.
+
+    Examples
+    --------
+    >>> np.dot(3, 4)
+    12
+
+    Neither argument is complex-conjugated:
+
+    >>> np.dot([2j, 3j], [2j, 3j])
+    (-13+0j)
+
+    For 2-D arrays it is the matrix product:
+
+    >>> a = [[1, 0], [0, 1]]
+    >>> b = [[4, 1], [2, 2]]
+    >>> np.dot(a, b)
+    array([[4, 1],
+           [2, 2]])
+
+    >>> a = np.arange(3*4*5*6).reshape((3,4,5,6))
+    >>> b = np.arange(3*4*5*6)[::-1].reshape((5,4,6,3))
+    >>> np.dot(a, b)[2,3,2,1,2,2]
+    499128
+    >>> sum(a[2,3,2,:] * b[1,2,:,2])
+    499128
+
+    """
+    return (a, b, out)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.vdot)
+def vdot(a, b):
+    """
+    vdot(a, b)
+
+    Return the dot product of two vectors.
+
+    The vdot(`a`, `b`) function handles complex numbers differently than
+    dot(`a`, `b`).  If the first argument is complex the complex conjugate
+    of the first argument is used for the calculation of the dot product.
+
+    Note that `vdot` handles multidimensional arrays differently than `dot`:
+    it does *not* perform a matrix product, but flattens input arguments
+    to 1-D vectors first. Consequently, it should only be used for vectors.
+
+    Parameters
+    ----------
+    a : array_like
+        If `a` is complex the complex conjugate is taken before calculation
+        of the dot product.
+    b : array_like
+        Second argument to the dot product.
+
+    Returns
+    -------
+    output : ndarray
+        Dot product of `a` and `b`.  Can be an int, float, or
+        complex depending on the types of `a` and `b`.
+
+    See Also
+    --------
+    dot : Return the dot product without using the complex conjugate of the
+          first argument.
+
+    Examples
+    --------
+    >>> a = np.array([1+2j,3+4j])
+    >>> b = np.array([5+6j,7+8j])
+    >>> np.vdot(a, b)
+    (70-8j)
+    >>> np.vdot(b, a)
+    (70+8j)
+
+    Note that higher-dimensional arrays are flattened!
+
+    >>> a = np.array([[1, 4], [5, 6]])
+    >>> b = np.array([[4, 1], [2, 2]])
+    >>> np.vdot(a, b)
+    30
+    >>> np.vdot(b, a)
+    30
+    >>> 1*4 + 4*1 + 5*2 + 6*2
+    30
+
+    """
+    return (a, b)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.bincount)
+def bincount(x, weights=None, minlength=None):
+    """
+    bincount(x, weights=None, minlength=0)
+
+    Count number of occurrences of each value in array of non-negative ints.
+
+    The number of bins (of size 1) is one larger than the largest value in
+    `x`. If `minlength` is specified, there will be at least this number
+    of bins in the output array (though it will be longer if necessary,
+    depending on the contents of `x`).
+    Each bin gives the number of occurrences of its index value in `x`.
+    If `weights` is specified the input array is weighted by it, i.e. if a
+    value ``n`` is found at position ``i``, ``out[n] += weight[i]`` instead
+    of ``out[n] += 1``.
+
+    Parameters
+    ----------
+    x : array_like, 1 dimension, nonnegative ints
+        Input array.
+    weights : array_like, optional
+        Weights, array of the same shape as `x`.
+    minlength : int, optional
+        A minimum number of bins for the output array.
+
+        .. versionadded:: 1.6.0
+
+    Returns
+    -------
+    out : ndarray of ints
+        The result of binning the input array.
+        The length of `out` is equal to ``np.amax(x)+1``.
+
+    Raises
+    ------
+    ValueError
+        If the input is not 1-dimensional, or contains elements with negative
+        values, or if `minlength` is negative.
+    TypeError
+        If the type of the input is float or complex.
+
+    See Also
+    --------
+    histogram, digitize, unique
+
+    Examples
+    --------
+    >>> np.bincount(np.arange(5))
+    array([1, 1, 1, 1, 1])
+    >>> np.bincount(np.array([0, 1, 1, 3, 2, 1, 7]))
+    array([1, 3, 1, 1, 0, 0, 0, 1])
+
+    >>> x = np.array([0, 1, 1, 3, 2, 1, 7, 23])
+    >>> np.bincount(x).size == np.amax(x)+1
+    True
+
+    The input array needs to be of integer dtype, otherwise a
+    TypeError is raised:
+
+    >>> np.bincount(np.arange(5, dtype=float))
+    Traceback (most recent call last):
+      ...
+    TypeError: Cannot cast array data from dtype('float64') to dtype('int64')
+    according to the rule 'safe'
+
+    A possible use of ``bincount`` is to perform sums over
+    variable-size chunks of an array, using the ``weights`` keyword.
+
+    >>> w = np.array([0.3, 0.5, 0.2, 0.7, 1., -0.6]) # weights
+    >>> x = np.array([0, 1, 1, 2, 2, 2])
+    >>> np.bincount(x,  weights=w)
+    array([ 0.3,  0.7,  1.1])
+
+    """
+    return (x, weights)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.ravel_multi_index)
+def ravel_multi_index(multi_index, dims, mode=None, order=None):
+    """
+    ravel_multi_index(multi_index, dims, mode='raise', order='C')
+
+    Converts a tuple of index arrays into an array of flat
+    indices, applying boundary modes to the multi-index.
+
+    Parameters
+    ----------
+    multi_index : tuple of array_like
+        A tuple of integer arrays, one array for each dimension.
+    dims : tuple of ints
+        The shape of array into which the indices from ``multi_index`` apply.
+    mode : {'raise', 'wrap', 'clip'}, optional
+        Specifies how out-of-bounds indices are handled.  Can specify
+        either one mode or a tuple of modes, one mode per index.
+
+        * 'raise' -- raise an error (default)
+        * 'wrap' -- wrap around
+        * 'clip' -- clip to the range
+
+        In 'clip' mode, a negative index which would normally
+        wrap will clip to 0 instead.
+    order : {'C', 'F'}, optional
+        Determines whether the multi-index should be viewed as
+        indexing in row-major (C-style) or column-major
+        (Fortran-style) order.
+
+    Returns
+    -------
+    raveled_indices : ndarray
+        An array of indices into the flattened version of an array
+        of dimensions ``dims``.
+
+    See Also
+    --------
+    unravel_index
+
+    Notes
+    -----
+    .. versionadded:: 1.6.0
+
+    Examples
+    --------
+    >>> arr = np.array([[3,6,6],[4,5,1]])
+    >>> np.ravel_multi_index(arr, (7,6))
+    array([22, 41, 37])
+    >>> np.ravel_multi_index(arr, (7,6), order='F')
+    array([31, 41, 13])
+    >>> np.ravel_multi_index(arr, (4,6), mode='clip')
+    array([22, 23, 19])
+    >>> np.ravel_multi_index(arr, (4,4), mode=('clip','wrap'))
+    array([12, 13, 13])
+
+    >>> np.ravel_multi_index((3,1,4,1), (6,7,8,9))
+    1621
+    """
+    return multi_index
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.unravel_index)
+def unravel_index(indices, shape=None, order=None, dims=None):
+    """
+    unravel_index(indices, shape, order='C')
+
+    Converts a flat index or array of flat indices into a tuple
+    of coordinate arrays.
+
+    Parameters
+    ----------
+    indices : array_like
+        An integer array whose elements are indices into the flattened
+        version of an array of dimensions ``shape``. Before version 1.6.0,
+        this function accepted just one index value.
+    shape : tuple of ints
+        The shape of the array to use for unraveling ``indices``.
+
+        .. versionchanged:: 1.16.0
+            Renamed from ``dims`` to ``shape``.
+
+    order : {'C', 'F'}, optional
+        Determines whether the indices should be viewed as indexing in
+        row-major (C-style) or column-major (Fortran-style) order.
+
+        .. versionadded:: 1.6.0
+
+    Returns
+    -------
+    unraveled_coords : tuple of ndarray
+        Each array in the tuple has the same shape as the ``indices``
+        array.
+
+    See Also
+    --------
+    ravel_multi_index
+
+    Examples
+    --------
+    >>> np.unravel_index([22, 41, 37], (7,6))
+    (array([3, 6, 6]), array([4, 5, 1]))
+    >>> np.unravel_index([31, 41, 13], (7,6), order='F')
+    (array([3, 6, 6]), array([4, 5, 1]))
+
+    >>> np.unravel_index(1621, (6,7,8,9))
+    (3, 1, 4, 1)
+
+    """
+    if dims is not None:
+        warnings.warn("'shape' argument should be used instead of 'dims'",
+                      DeprecationWarning, stacklevel=3)
+    return (indices,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.copyto)
+def copyto(dst, src, casting=None, where=None):
+    """
+    copyto(dst, src, casting='same_kind', where=True)
+
+    Copies values from one array to another, broadcasting as necessary.
+
+    Raises a TypeError if the `casting` rule is violated, and if
+    `where` is provided, it selects which elements to copy.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    dst : ndarray
+        The array into which values are copied.
+    src : array_like
+        The array from which values are copied.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        Controls what kind of data casting may occur when copying.
+
+          * 'no' means the data types should not be cast at all.
+          * 'equiv' means only byte-order changes are allowed.
+          * 'safe' means only casts which can preserve values are allowed.
+          * 'same_kind' means only safe casts or casts within a kind,
+            like float64 to float32, are allowed.
+          * 'unsafe' means any data conversions may be done.
+    where : array_like of bool, optional
+        A boolean array which is broadcasted to match the dimensions
+        of `dst`, and selects elements to copy from `src` to `dst`
+        wherever it contains the value True.
+    """
+    return (dst, src, where)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.putmask)
+def putmask(a, mask, values):
+    """
+    putmask(a, mask, values)
+
+    Changes elements of an array based on conditional and input values.
+
+    Sets ``a.flat[n] = values[n]`` for each n where ``mask.flat[n]==True``.
+
+    If `values` is not the same size as `a` and `mask` then it will repeat.
+    This gives behavior different from ``a[mask] = values``.
+
+    Parameters
+    ----------
+    a : array_like
+        Target array.
+    mask : array_like
+        Boolean mask array. It has to be the same shape as `a`.
+    values : array_like
+        Values to put into `a` where `mask` is True. If `values` is smaller
+        than `a` it will be repeated.
+
+    See Also
+    --------
+    place, put, take, copyto
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2, 3)
+    >>> np.putmask(x, x>2, x**2)
+    >>> x
+    array([[ 0,  1,  2],
+           [ 9, 16, 25]])
+
+    If `values` is smaller than `a` it is repeated:
+
+    >>> x = np.arange(5)
+    >>> np.putmask(x, x>1, [-33, -44])
+    >>> x
+    array([  0,   1, -33, -44, -33])
+
+    """
+    return (a, mask, values)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.packbits)
+def packbits(a, axis=None, bitorder='big'):
+    """
+    packbits(a, axis=None, bitorder='big')
+
+    Packs the elements of a binary-valued array into bits in a uint8 array.
+
+    The result is padded to full bytes by inserting zero bits at the end.
+
+    Parameters
+    ----------
+    a : array_like
+        An array of integers or booleans whose elements should be packed to
+        bits.
+    axis : int, optional
+        The dimension over which bit-packing is done.
+        ``None`` implies packing the flattened array.
+    bitorder : {'big', 'little'}, optional
+        The order of the input bits. 'big' will mimic bin(val),
+        ``[0, 0, 0, 0, 0, 0, 1, 1] => 3 = 0b00000011``, 'little' will
+        reverse the order so ``[1, 1, 0, 0, 0, 0, 0, 0] => 3``.
+        Defaults to 'big'.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    packed : ndarray
+        Array of type uint8 whose elements represent bits corresponding to the
+        logical (0 or nonzero) value of the input elements. The shape of
+        `packed` has the same number of dimensions as the input (unless `axis`
+        is None, in which case the output is 1-D).
+
+    See Also
+    --------
+    unpackbits: Unpacks elements of a uint8 array into a binary-valued output
+                array.
+
+    Examples
+    --------
+    >>> a = np.array([[[1,0,1],
+    ...                [0,1,0]],
+    ...               [[1,1,0],
+    ...                [0,0,1]]])
+    >>> b = np.packbits(a, axis=-1)
+    >>> b
+    array([[[160],
+            [ 64]],
+           [[192],
+            [ 32]]], dtype=uint8)
+
+    Note that in binary 160 = 1010 0000, 64 = 0100 0000, 192 = 1100 0000,
+    and 32 = 0010 0000.
+
+    """
+    return (a,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.unpackbits)
+def unpackbits(a, axis=None, count=None, bitorder='big'):
+    """
+    unpackbits(a, axis=None, count=None, bitorder='big')
+
+    Unpacks elements of a uint8 array into a binary-valued output array.
+
+    Each element of `a` represents a bit-field that should be unpacked
+    into a binary-valued output array. The shape of the output array is
+    either 1-D (if `axis` is ``None``) or the same shape as the input
+    array with unpacking done along the axis specified.
+
+    Parameters
+    ----------
+    a : ndarray, uint8 type
+       Input array.
+    axis : int, optional
+        The dimension over which bit-unpacking is done.
+        ``None`` implies unpacking the flattened array.
+    count : int or None, optional
+        The number of elements to unpack along `axis`, provided as a way
+        of undoing the effect of packing a size that is not a multiple
+        of eight. A non-negative number means to only unpack `count`
+        bits. A negative number means to trim off that many bits from
+        the end. ``None`` means to unpack the entire array (the
+        default). Counts larger than the available number of bits will
+        add zero padding to the output. Negative counts must not
+        exceed the available number of bits.
+
+        .. versionadded:: 1.17.0
+
+    bitorder : {'big', 'little'}, optional
+        The order of the returned bits. 'big' will mimic bin(val),
+        ``3 = 0b00000011 => [0, 0, 0, 0, 0, 0, 1, 1]``, 'little' will reverse
+        the order to ``[1, 1, 0, 0, 0, 0, 0, 0]``.
+        Defaults to 'big'.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    unpacked : ndarray, uint8 type
+       The elements are binary-valued (0 or 1).
+
+    See Also
+    --------
+    packbits : Packs the elements of a binary-valued array into bits in
+               a uint8 array.
+
+    Examples
+    --------
+    >>> a = np.array([[2], [7], [23]], dtype=np.uint8)
+    >>> a
+    array([[ 2],
+           [ 7],
+           [23]], dtype=uint8)
+    >>> b = np.unpackbits(a, axis=1)
+    >>> b
+    array([[0, 0, 0, 0, 0, 0, 1, 0],
+           [0, 0, 0, 0, 0, 1, 1, 1],
+           [0, 0, 0, 1, 0, 1, 1, 1]], dtype=uint8)
+    >>> c = np.unpackbits(a, axis=1, count=-3)
+    >>> c
+    array([[0, 0, 0, 0, 0],
+           [0, 0, 0, 0, 0],
+           [0, 0, 0, 1, 0]], dtype=uint8)
+
+    >>> p = np.packbits(b, axis=0)
+    >>> np.unpackbits(p, axis=0)
+    array([[0, 0, 0, 0, 0, 0, 1, 0],
+           [0, 0, 0, 0, 0, 1, 1, 1],
+           [0, 0, 0, 1, 0, 1, 1, 1],
+           [0, 0, 0, 0, 0, 0, 0, 0],
+           [0, 0, 0, 0, 0, 0, 0, 0],
+           [0, 0, 0, 0, 0, 0, 0, 0],
+           [0, 0, 0, 0, 0, 0, 0, 0],
+           [0, 0, 0, 0, 0, 0, 0, 0]], dtype=uint8)
+    >>> np.array_equal(b, np.unpackbits(p, axis=0, count=b.shape[0]))
+    True
+
+    """
+    return (a,)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.shares_memory)
+def shares_memory(a, b, max_work=None):
+    """
+    shares_memory(a, b, max_work=None)
+
+    Determine if two arrays share memory.
+
+    .. warning::
+
+       This function can be exponentially slow for some inputs, unless
+       `max_work` is set to a finite number or ``MAY_SHARE_BOUNDS``.
+       If in doubt, use `numpy.may_share_memory` instead.
+
+    Parameters
+    ----------
+    a, b : ndarray
+        Input arrays
+    max_work : int, optional
+        Effort to spend on solving the overlap problem (maximum number
+        of candidate solutions to consider). The following special
+        values are recognized:
+
+        max_work=MAY_SHARE_EXACT  (default)
+            The problem is solved exactly. In this case, the function returns
+            True only if there is an element shared between the arrays. Finding
+            the exact solution may take extremely long in some cases.
+        max_work=MAY_SHARE_BOUNDS
+            Only the memory bounds of a and b are checked.
+
+    Raises
+    ------
+    numpy.TooHardError
+        Exceeded max_work.
+
+    Returns
+    -------
+    out : bool
+
+    See Also
+    --------
+    may_share_memory
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3, 4])
+    >>> np.shares_memory(x, np.array([5, 6, 7]))
+    False
+    >>> np.shares_memory(x[::2], x)
+    True
+    >>> np.shares_memory(x[::2], x[1::2])
+    False
+
+    Checking whether two arrays share memory is NP-complete, and
+    runtime may increase exponentially in the number of
+    dimensions. Hence, `max_work` should generally be set to a finite
+    number, as it is possible to construct examples that take
+    extremely long to run:
+
+    >>> from numpy.lib.stride_tricks import as_strided
+    >>> x = np.zeros([192163377], dtype=np.int8)
+    >>> x1 = as_strided(x, strides=(36674, 61119, 85569), shape=(1049, 1049, 1049))
+    >>> x2 = as_strided(x[64023025:], strides=(12223, 12224, 1), shape=(1049, 1049, 1))
+    >>> np.shares_memory(x1, x2, max_work=1000)
+    Traceback (most recent call last):
+    ...
+    numpy.TooHardError: Exceeded max_work
+
+    Running ``np.shares_memory(x1, x2)`` without `max_work` set takes
+    around 1 minute for this case. It is possible to find problems
+    that take still significantly longer.
+
+    """
+    return (a, b)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.may_share_memory)
+def may_share_memory(a, b, max_work=None):
+    """
+    may_share_memory(a, b, max_work=None)
+
+    Determine if two arrays might share memory
+
+    A return of True does not necessarily mean that the two arrays
+    share any element.  It just means that they *might*.
+
+    Only the memory bounds of a and b are checked by default.
+
+    Parameters
+    ----------
+    a, b : ndarray
+        Input arrays
+    max_work : int, optional
+        Effort to spend on solving the overlap problem.  See
+        `shares_memory` for details.  Default for ``may_share_memory``
+        is to do a bounds check.
+
+    Returns
+    -------
+    out : bool
+
+    See Also
+    --------
+    shares_memory
+
+    Examples
+    --------
+    >>> np.may_share_memory(np.array([1,2]), np.array([5,8,9]))
+    False
+    >>> x = np.zeros([3, 4])
+    >>> np.may_share_memory(x[:,0], x[:,1])
+    True
+
+    """
+    return (a, b)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.is_busday)
+def is_busday(dates, weekmask=None, holidays=None, busdaycal=None, out=None):
+    """
+    is_busday(dates, weekmask='1111100', holidays=None, busdaycal=None, out=None)
+
+    Calculates which of the given dates are valid days, and which are not.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    dates : array_like of datetime64[D]
+        The array of dates to process.
+    weekmask : str or array_like of bool, optional
+        A seven-element array indicating which of Monday through Sunday are
+        valid days. May be specified as a length-seven list or array, like
+        [1,1,1,1,1,0,0]; a length-seven string, like '1111100'; or a string
+        like "Mon Tue Wed Thu Fri", made up of 3-character abbreviations for
+        weekdays, optionally separated by white space. Valid abbreviations
+        are: Mon Tue Wed Thu Fri Sat Sun
+    holidays : array_like of datetime64[D], optional
+        An array of dates to consider as invalid dates.  They may be
+        specified in any order, and NaT (not-a-time) dates are ignored.
+        This list is saved in a normalized form that is suited for
+        fast calculations of valid days.
+    busdaycal : busdaycalendar, optional
+        A `busdaycalendar` object which specifies the valid days. If this
+        parameter is provided, neither weekmask nor holidays may be
+        provided.
+    out : array of bool, optional
+        If provided, this array is filled with the result.
+
+    Returns
+    -------
+    out : array of bool
+        An array with the same shape as ``dates``, containing True for
+        each valid day, and False for each invalid day.
+
+    See Also
+    --------
+    busdaycalendar: An object that specifies a custom set of valid days.
+    busday_offset : Applies an offset counted in valid days.
+    busday_count : Counts how many valid days are in a half-open date range.
+
+    Examples
+    --------
+    >>> # The weekdays are Friday, Saturday, and Monday
+    ... np.is_busday(['2011-07-01', '2011-07-02', '2011-07-18'],
+    ...                 holidays=['2011-07-01', '2011-07-04', '2011-07-17'])
+    array([False, False,  True])
+    """
+    return (dates, weekmask, holidays, out)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.busday_offset)
+def busday_offset(dates, offsets, roll=None, weekmask=None, holidays=None,
+                  busdaycal=None, out=None):
+    """
+    busday_offset(dates, offsets, roll='raise', weekmask='1111100', holidays=None, busdaycal=None, out=None)
+
+    First adjusts the date to fall on a valid day according to
+    the ``roll`` rule, then applies offsets to the given dates
+    counted in valid days.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    dates : array_like of datetime64[D]
+        The array of dates to process.
+    offsets : array_like of int
+        The array of offsets, which is broadcast with ``dates``.
+    roll : {'raise', 'nat', 'forward', 'following', 'backward', 'preceding', 'modifiedfollowing', 'modifiedpreceding'}, optional
+        How to treat dates that do not fall on a valid day. The default
+        is 'raise'.
+
+          * 'raise' means to raise an exception for an invalid day.
+          * 'nat' means to return a NaT (not-a-time) for an invalid day.
+          * 'forward' and 'following' mean to take the first valid day
+            later in time.
+          * 'backward' and 'preceding' mean to take the first valid day
+            earlier in time.
+          * 'modifiedfollowing' means to take the first valid day
+            later in time unless it is across a Month boundary, in which
+            case to take the first valid day earlier in time.
+          * 'modifiedpreceding' means to take the first valid day
+            earlier in time unless it is across a Month boundary, in which
+            case to take the first valid day later in time.
+    weekmask : str or array_like of bool, optional
+        A seven-element array indicating which of Monday through Sunday are
+        valid days. May be specified as a length-seven list or array, like
+        [1,1,1,1,1,0,0]; a length-seven string, like '1111100'; or a string
+        like "Mon Tue Wed Thu Fri", made up of 3-character abbreviations for
+        weekdays, optionally separated by white space. Valid abbreviations
+        are: Mon Tue Wed Thu Fri Sat Sun
+    holidays : array_like of datetime64[D], optional
+        An array of dates to consider as invalid dates.  They may be
+        specified in any order, and NaT (not-a-time) dates are ignored.
+        This list is saved in a normalized form that is suited for
+        fast calculations of valid days.
+    busdaycal : busdaycalendar, optional
+        A `busdaycalendar` object which specifies the valid days. If this
+        parameter is provided, neither weekmask nor holidays may be
+        provided.
+    out : array of datetime64[D], optional
+        If provided, this array is filled with the result.
+
+    Returns
+    -------
+    out : array of datetime64[D]
+        An array with a shape from broadcasting ``dates`` and ``offsets``
+        together, containing the dates with offsets applied.
+
+    See Also
+    --------
+    busdaycalendar: An object that specifies a custom set of valid days.
+    is_busday : Returns a boolean array indicating valid days.
+    busday_count : Counts how many valid days are in a half-open date range.
+
+    Examples
+    --------
+    >>> # First business day in October 2011 (not accounting for holidays)
+    ... np.busday_offset('2011-10', 0, roll='forward')
+    numpy.datetime64('2011-10-03')
+    >>> # Last business day in February 2012 (not accounting for holidays)
+    ... np.busday_offset('2012-03', -1, roll='forward')
+    numpy.datetime64('2012-02-29')
+    >>> # Third Wednesday in January 2011
+    ... np.busday_offset('2011-01', 2, roll='forward', weekmask='Wed')
+    numpy.datetime64('2011-01-19')
+    >>> # 2012 Mother's Day in Canada and the U.S.
+    ... np.busday_offset('2012-05', 1, roll='forward', weekmask='Sun')
+    numpy.datetime64('2012-05-13')
+
+    >>> # First business day on or after a date
+    ... np.busday_offset('2011-03-20', 0, roll='forward')
+    numpy.datetime64('2011-03-21')
+    >>> np.busday_offset('2011-03-22', 0, roll='forward')
+    numpy.datetime64('2011-03-22')
+    >>> # First business day after a date
+    ... np.busday_offset('2011-03-20', 1, roll='backward')
+    numpy.datetime64('2011-03-21')
+    >>> np.busday_offset('2011-03-22', 1, roll='backward')
+    numpy.datetime64('2011-03-23')
+    """
+    return (dates, offsets, weekmask, holidays, out)
+
+
+@array_function_from_c_func_and_dispatcher(_multiarray_umath.busday_count)
+def busday_count(begindates, enddates, weekmask=None, holidays=None,
+                 busdaycal=None, out=None):
+    """
+    busday_count(begindates, enddates, weekmask='1111100', holidays=[], busdaycal=None, out=None)
+
+    Counts the number of valid days between `begindates` and
+    `enddates`, not including the day of `enddates`.
+
+    If ``enddates`` specifies a date value that is earlier than the
+    corresponding ``begindates`` date value, the count will be negative.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    begindates : array_like of datetime64[D]
+        The array of the first dates for counting.
+    enddates : array_like of datetime64[D]
+        The array of the end dates for counting, which are excluded
+        from the count themselves.
+    weekmask : str or array_like of bool, optional
+        A seven-element array indicating which of Monday through Sunday are
+        valid days. May be specified as a length-seven list or array, like
+        [1,1,1,1,1,0,0]; a length-seven string, like '1111100'; or a string
+        like "Mon Tue Wed Thu Fri", made up of 3-character abbreviations for
+        weekdays, optionally separated by white space. Valid abbreviations
+        are: Mon Tue Wed Thu Fri Sat Sun
+    holidays : array_like of datetime64[D], optional
+        An array of dates to consider as invalid dates.  They may be
+        specified in any order, and NaT (not-a-time) dates are ignored.
+        This list is saved in a normalized form that is suited for
+        fast calculations of valid days.
+    busdaycal : busdaycalendar, optional
+        A `busdaycalendar` object which specifies the valid days. If this
+        parameter is provided, neither weekmask nor holidays may be
+        provided.
+    out : array of int, optional
+        If provided, this array is filled with the result.
+
+    Returns
+    -------
+    out : array of int
+        An array with a shape from broadcasting ``begindates`` and ``enddates``
+        together, containing the number of valid days between
+        the begin and end dates.
+
+    See Also
+    --------
+    busdaycalendar: An object that specifies a custom set of valid days.
+    is_busday : Returns a boolean array indicating valid days.
+    busday_offset : Applies an offset counted in valid days.
+
+    Examples
+    --------
+    >>> # Number of weekdays in January 2011
+    ... np.busday_count('2011-01', '2011-02')
+    21
+    >>> # Number of weekdays in 2011
+    >>> np.busday_count('2011', '2012')
+    260
+    >>> # Number of Saturdays in 2011
+    ... np.busday_count('2011', '2012', weekmask='Sat')
+    53
+    """
+    return (begindates, enddates, weekmask, holidays, out)
+
+
+@array_function_from_c_func_and_dispatcher(
+    _multiarray_umath.datetime_as_string)
+def datetime_as_string(arr, unit=None, timezone=None, casting=None):
+    """
+    datetime_as_string(arr, unit=None, timezone='naive', casting='same_kind')
+
+    Convert an array of datetimes into an array of strings.
+
+    Parameters
+    ----------
+    arr : array_like of datetime64
+        The array of UTC timestamps to format.
+    unit : str
+        One of None, 'auto', or a :ref:`datetime unit <arrays.dtypes.dateunits>`.
+    timezone : {'naive', 'UTC', 'local'} or tzinfo
+        Timezone information to use when displaying the datetime. If 'UTC', end
+        with a Z to indicate UTC time. If 'local', convert to the local timezone
+        first, and suffix with a +-#### timezone offset. If a tzinfo object,
+        then do as with 'local', but use the specified timezone.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}
+        Casting to allow when changing between datetime units.
+
+    Returns
+    -------
+    str_arr : ndarray
+        An array of strings the same shape as `arr`.
+
+    Examples
+    --------
+    >>> import pytz
+    >>> d = np.arange('2002-10-27T04:30', 4*60, 60, dtype='M8[m]')
+    >>> d
+    array(['2002-10-27T04:30', '2002-10-27T05:30', '2002-10-27T06:30',
+           '2002-10-27T07:30'], dtype='datetime64[m]')
+
+    Setting the timezone to UTC shows the same information, but with a Z suffix
+
+    >>> np.datetime_as_string(d, timezone='UTC')
+    array(['2002-10-27T04:30Z', '2002-10-27T05:30Z', '2002-10-27T06:30Z',
+           '2002-10-27T07:30Z'], dtype='<U35')
+
+    Note that we picked datetimes that cross a DST boundary. Passing in a
+    ``pytz`` timezone object will print the appropriate offset
+
+    >>> np.datetime_as_string(d, timezone=pytz.timezone('US/Eastern'))
+    array(['2002-10-27T00:30-0400', '2002-10-27T01:30-0400',
+           '2002-10-27T01:30-0500', '2002-10-27T02:30-0500'], dtype='<U39')
+
+    Passing in a unit will change the precision
+
+    >>> np.datetime_as_string(d, unit='h')
+    array(['2002-10-27T04', '2002-10-27T05', '2002-10-27T06', '2002-10-27T07'],
+          dtype='<U32')
+    >>> np.datetime_as_string(d, unit='s')
+    array(['2002-10-27T04:30:00', '2002-10-27T05:30:00', '2002-10-27T06:30:00',
+           '2002-10-27T07:30:00'], dtype='<U38')
+
+    'casting' can be used to specify whether precision can be changed
+
+    >>> np.datetime_as_string(d, unit='h', casting='safe')
+    Traceback (most recent call last):
+        ...
+    TypeError: Cannot create a datetime string as units 'h' from a NumPy
+    datetime with units 'm' according to the rule 'safe'
+    """
+    return (arr,)
diff --git a/venv/Lib/site-packages/numpy/core/numeric.py b/venv/Lib/site-packages/numpy/core/numeric.py
new file mode 100644
index 000000000..8bd4e241b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/numeric.py
@@ -0,0 +1,2469 @@
+import functools
+import itertools
+import operator
+import sys
+import warnings
+import numbers
+
+import numpy as np
+from . import multiarray
+from .multiarray import (
+    _fastCopyAndTranspose as fastCopyAndTranspose, ALLOW_THREADS,
+    BUFSIZE, CLIP, MAXDIMS, MAY_SHARE_BOUNDS, MAY_SHARE_EXACT, RAISE,
+    WRAP, arange, array, broadcast, can_cast, compare_chararrays,
+    concatenate, copyto, dot, dtype, empty,
+    empty_like, flatiter, frombuffer, fromfile, fromiter, fromstring,
+    inner, lexsort, matmul, may_share_memory,
+    min_scalar_type, ndarray, nditer, nested_iters, promote_types,
+    putmask, result_type, set_numeric_ops, shares_memory, vdot, where,
+    zeros, normalize_axis_index)
+
+from . import overrides
+from . import umath
+from . import shape_base
+from .overrides import set_module
+from .umath import (multiply, invert, sin, PINF, NAN)
+from . import numerictypes
+from .numerictypes import longlong, intc, int_, float_, complex_, bool_
+from ._exceptions import TooHardError, AxisError
+from ._asarray import asarray, asanyarray
+from ._ufunc_config import errstate
+
+bitwise_not = invert
+ufunc = type(sin)
+newaxis = None
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = [
+    'newaxis', 'ndarray', 'flatiter', 'nditer', 'nested_iters', 'ufunc',
+    'arange', 'array', 'zeros', 'count_nonzero', 'empty', 'broadcast', 'dtype',
+    'fromstring', 'fromfile', 'frombuffer', 'where',
+    'argwhere', 'copyto', 'concatenate', 'fastCopyAndTranspose', 'lexsort',
+    'set_numeric_ops', 'can_cast', 'promote_types', 'min_scalar_type',
+    'result_type', 'isfortran', 'empty_like', 'zeros_like', 'ones_like',
+    'correlate', 'convolve', 'inner', 'dot', 'outer', 'vdot', 'roll',
+    'rollaxis', 'moveaxis', 'cross', 'tensordot', 'little_endian',
+    'fromiter', 'array_equal', 'array_equiv', 'indices', 'fromfunction',
+    'isclose', 'isscalar', 'binary_repr', 'base_repr', 'ones',
+    'identity', 'allclose', 'compare_chararrays', 'putmask',
+    'flatnonzero', 'Inf', 'inf', 'infty', 'Infinity', 'nan', 'NaN',
+    'False_', 'True_', 'bitwise_not', 'CLIP', 'RAISE', 'WRAP', 'MAXDIMS',
+    'BUFSIZE', 'ALLOW_THREADS', 'ComplexWarning', 'full', 'full_like',
+    'matmul', 'shares_memory', 'may_share_memory', 'MAY_SHARE_BOUNDS',
+    'MAY_SHARE_EXACT', 'TooHardError', 'AxisError']
+
+
+@set_module('numpy')
+class ComplexWarning(RuntimeWarning):
+    """
+    The warning raised when casting a complex dtype to a real dtype.
+
+    As implemented, casting a complex number to a real discards its imaginary
+    part, but this behavior may not be what the user actually wants.
+
+    """
+    pass
+
+
+def _zeros_like_dispatcher(a, dtype=None, order=None, subok=None, shape=None):
+    return (a,)
+
+
+@array_function_dispatch(_zeros_like_dispatcher)
+def zeros_like(a, dtype=None, order='K', subok=True, shape=None):
+    """
+    Return an array of zeros with the same shape and type as a given array.
+
+    Parameters
+    ----------
+    a : array_like
+        The shape and data-type of `a` define these same attributes of
+        the returned array.
+    dtype : data-type, optional
+        Overrides the data type of the result.
+
+        .. versionadded:: 1.6.0
+    order : {'C', 'F', 'A', or 'K'}, optional
+        Overrides the memory layout of the result. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
+        'C' otherwise. 'K' means match the layout of `a` as closely
+        as possible.
+
+        .. versionadded:: 1.6.0
+    subok : bool, optional.
+        If True, then the newly created array will use the sub-class
+        type of 'a', otherwise it will be a base-class array. Defaults
+        to True.
+    shape : int or sequence of ints, optional.
+        Overrides the shape of the result. If order='K' and the number of
+        dimensions is unchanged, will try to keep order, otherwise,
+        order='C' is implied.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    out : ndarray
+        Array of zeros with the same shape and type as `a`.
+
+    See Also
+    --------
+    empty_like : Return an empty array with shape and type of input.
+    ones_like : Return an array of ones with shape and type of input.
+    full_like : Return a new array with shape of input filled with value.
+    zeros : Return a new array setting values to zero.
+
+    Examples
+    --------
+    >>> x = np.arange(6)
+    >>> x = x.reshape((2, 3))
+    >>> x
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.zeros_like(x)
+    array([[0, 0, 0],
+           [0, 0, 0]])
+
+    >>> y = np.arange(3, dtype=float)
+    >>> y
+    array([0., 1., 2.])
+    >>> np.zeros_like(y)
+    array([0.,  0.,  0.])
+
+    """
+    res = empty_like(a, dtype=dtype, order=order, subok=subok, shape=shape)
+    # needed instead of a 0 to get same result as zeros for for string dtypes
+    z = zeros(1, dtype=res.dtype)
+    multiarray.copyto(res, z, casting='unsafe')
+    return res
+
+
+@set_module('numpy')
+def ones(shape, dtype=None, order='C'):
+    """
+    Return a new array of given shape and type, filled with ones.
+
+    Parameters
+    ----------
+    shape : int or sequence of ints
+        Shape of the new array, e.g., ``(2, 3)`` or ``2``.
+    dtype : data-type, optional
+        The desired data-type for the array, e.g., `numpy.int8`.  Default is
+        `numpy.float64`.
+    order : {'C', 'F'}, optional, default: C
+        Whether to store multi-dimensional data in row-major
+        (C-style) or column-major (Fortran-style) order in
+        memory.
+
+    Returns
+    -------
+    out : ndarray
+        Array of ones with the given shape, dtype, and order.
+
+    See Also
+    --------
+    ones_like : Return an array of ones with shape and type of input.
+    empty : Return a new uninitialized array.
+    zeros : Return a new array setting values to zero.
+    full : Return a new array of given shape filled with value.
+
+
+    Examples
+    --------
+    >>> np.ones(5)
+    array([1., 1., 1., 1., 1.])
+
+    >>> np.ones((5,), dtype=int)
+    array([1, 1, 1, 1, 1])
+
+    >>> np.ones((2, 1))
+    array([[1.],
+           [1.]])
+
+    >>> s = (2,2)
+    >>> np.ones(s)
+    array([[1.,  1.],
+           [1.,  1.]])
+
+    """
+    a = empty(shape, dtype, order)
+    multiarray.copyto(a, 1, casting='unsafe')
+    return a
+
+
+def _ones_like_dispatcher(a, dtype=None, order=None, subok=None, shape=None):
+    return (a,)
+
+
+@array_function_dispatch(_ones_like_dispatcher)
+def ones_like(a, dtype=None, order='K', subok=True, shape=None):
+    """
+    Return an array of ones with the same shape and type as a given array.
+
+    Parameters
+    ----------
+    a : array_like
+        The shape and data-type of `a` define these same attributes of
+        the returned array.
+    dtype : data-type, optional
+        Overrides the data type of the result.
+
+        .. versionadded:: 1.6.0
+    order : {'C', 'F', 'A', or 'K'}, optional
+        Overrides the memory layout of the result. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
+        'C' otherwise. 'K' means match the layout of `a` as closely
+        as possible.
+
+        .. versionadded:: 1.6.0
+    subok : bool, optional.
+        If True, then the newly created array will use the sub-class
+        type of 'a', otherwise it will be a base-class array. Defaults
+        to True.
+    shape : int or sequence of ints, optional.
+        Overrides the shape of the result. If order='K' and the number of
+        dimensions is unchanged, will try to keep order, otherwise,
+        order='C' is implied.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    out : ndarray
+        Array of ones with the same shape and type as `a`.
+
+    See Also
+    --------
+    empty_like : Return an empty array with shape and type of input.
+    zeros_like : Return an array of zeros with shape and type of input.
+    full_like : Return a new array with shape of input filled with value.
+    ones : Return a new array setting values to one.
+
+    Examples
+    --------
+    >>> x = np.arange(6)
+    >>> x = x.reshape((2, 3))
+    >>> x
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.ones_like(x)
+    array([[1, 1, 1],
+           [1, 1, 1]])
+
+    >>> y = np.arange(3, dtype=float)
+    >>> y
+    array([0., 1., 2.])
+    >>> np.ones_like(y)
+    array([1.,  1.,  1.])
+
+    """
+    res = empty_like(a, dtype=dtype, order=order, subok=subok, shape=shape)
+    multiarray.copyto(res, 1, casting='unsafe')
+    return res
+
+
+@set_module('numpy')
+def full(shape, fill_value, dtype=None, order='C'):
+    """
+    Return a new array of given shape and type, filled with `fill_value`.
+
+    Parameters
+    ----------
+    shape : int or sequence of ints
+        Shape of the new array, e.g., ``(2, 3)`` or ``2``.
+    fill_value : scalar or array_like
+        Fill value.
+    dtype : data-type, optional
+        The desired data-type for the array  The default, None, means
+         `np.array(fill_value).dtype`.
+    order : {'C', 'F'}, optional
+        Whether to store multidimensional data in C- or Fortran-contiguous
+        (row- or column-wise) order in memory.
+
+    Returns
+    -------
+    out : ndarray
+        Array of `fill_value` with the given shape, dtype, and order.
+
+    See Also
+    --------
+    full_like : Return a new array with shape of input filled with value.
+    empty : Return a new uninitialized array.
+    ones : Return a new array setting values to one.
+    zeros : Return a new array setting values to zero.
+
+    Examples
+    --------
+    >>> np.full((2, 2), np.inf)
+    array([[inf, inf],
+           [inf, inf]])
+    >>> np.full((2, 2), 10)
+    array([[10, 10],
+           [10, 10]])
+
+    >>> np.full((2, 2), [1, 2])
+    array([[1, 2],
+           [1, 2]])
+
+    """
+    if dtype is None:
+        dtype = array(fill_value).dtype
+    a = empty(shape, dtype, order)
+    multiarray.copyto(a, fill_value, casting='unsafe')
+    return a
+
+
+def _full_like_dispatcher(a, fill_value, dtype=None, order=None, subok=None, shape=None):
+    return (a,)
+
+
+@array_function_dispatch(_full_like_dispatcher)
+def full_like(a, fill_value, dtype=None, order='K', subok=True, shape=None):
+    """
+    Return a full array with the same shape and type as a given array.
+
+    Parameters
+    ----------
+    a : array_like
+        The shape and data-type of `a` define these same attributes of
+        the returned array.
+    fill_value : scalar
+        Fill value.
+    dtype : data-type, optional
+        Overrides the data type of the result.
+    order : {'C', 'F', 'A', or 'K'}, optional
+        Overrides the memory layout of the result. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
+        'C' otherwise. 'K' means match the layout of `a` as closely
+        as possible.
+    subok : bool, optional.
+        If True, then the newly created array will use the sub-class
+        type of 'a', otherwise it will be a base-class array. Defaults
+        to True.
+    shape : int or sequence of ints, optional.
+        Overrides the shape of the result. If order='K' and the number of
+        dimensions is unchanged, will try to keep order, otherwise,
+        order='C' is implied.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    out : ndarray
+        Array of `fill_value` with the same shape and type as `a`.
+
+    See Also
+    --------
+    empty_like : Return an empty array with shape and type of input.
+    ones_like : Return an array of ones with shape and type of input.
+    zeros_like : Return an array of zeros with shape and type of input.
+    full : Return a new array of given shape filled with value.
+
+    Examples
+    --------
+    >>> x = np.arange(6, dtype=int)
+    >>> np.full_like(x, 1)
+    array([1, 1, 1, 1, 1, 1])
+    >>> np.full_like(x, 0.1)
+    array([0, 0, 0, 0, 0, 0])
+    >>> np.full_like(x, 0.1, dtype=np.double)
+    array([0.1, 0.1, 0.1, 0.1, 0.1, 0.1])
+    >>> np.full_like(x, np.nan, dtype=np.double)
+    array([nan, nan, nan, nan, nan, nan])
+
+    >>> y = np.arange(6, dtype=np.double)
+    >>> np.full_like(y, 0.1)
+    array([0.1,  0.1,  0.1,  0.1,  0.1,  0.1])
+
+    """
+    res = empty_like(a, dtype=dtype, order=order, subok=subok, shape=shape)
+    multiarray.copyto(res, fill_value, casting='unsafe')
+    return res
+
+
+def _count_nonzero_dispatcher(a, axis=None, *, keepdims=None):
+    return (a,)
+
+
+@array_function_dispatch(_count_nonzero_dispatcher)
+def count_nonzero(a, axis=None, *, keepdims=False):
+    """
+    Counts the number of non-zero values in the array ``a``.
+
+    The word "non-zero" is in reference to the Python 2.x
+    built-in method ``__nonzero__()`` (renamed ``__bool__()``
+    in Python 3.x) of Python objects that tests an object's
+    "truthfulness". For example, any number is considered
+    truthful if it is nonzero, whereas any string is considered
+    truthful if it is not the empty string. Thus, this function
+    (recursively) counts how many elements in ``a`` (and in
+    sub-arrays thereof) have their ``__nonzero__()`` or ``__bool__()``
+    method evaluated to ``True``.
+
+    Parameters
+    ----------
+    a : array_like
+        The array for which to count non-zeros.
+    axis : int or tuple, optional
+        Axis or tuple of axes along which to count non-zeros.
+        Default is None, meaning that non-zeros will be counted
+        along a flattened version of ``a``.
+
+        .. versionadded:: 1.12.0
+
+    keepdims : bool, optional
+        If this is set to True, the axes that are counted are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        .. versionadded:: 1.19.0
+
+    Returns
+    -------
+    count : int or array of int
+        Number of non-zero values in the array along a given axis.
+        Otherwise, the total number of non-zero values in the array
+        is returned.
+
+    See Also
+    --------
+    nonzero : Return the coordinates of all the non-zero values.
+
+    Examples
+    --------
+    >>> np.count_nonzero(np.eye(4))
+    4
+    >>> a = np.array([[0, 1, 7, 0],
+    ...               [3, 0, 2, 19]])
+    >>> np.count_nonzero(a)
+    5
+    >>> np.count_nonzero(a, axis=0)
+    array([1, 1, 2, 1])
+    >>> np.count_nonzero(a, axis=1)
+    array([2, 3])
+    >>> np.count_nonzero(a, axis=1, keepdims=True)
+    array([[2],
+           [3]])
+    """
+    if axis is None and not keepdims:
+        return multiarray.count_nonzero(a)
+
+    a = asanyarray(a)
+
+    # TODO: this works around .astype(bool) not working properly (gh-9847)
+    if np.issubdtype(a.dtype, np.character):
+        a_bool = a != a.dtype.type()
+    else:
+        a_bool = a.astype(np.bool_, copy=False)
+
+    return a_bool.sum(axis=axis, dtype=np.intp, keepdims=keepdims)
+
+
+@set_module('numpy')
+def isfortran(a):
+    """
+    Check if the array is Fortran contiguous but *not* C contiguous.
+
+    This function is obsolete and, because of changes due to relaxed stride
+    checking, its return value for the same array may differ for versions
+    of NumPy >= 1.10.0 and previous versions. If you only want to check if an
+    array is Fortran contiguous use ``a.flags.f_contiguous`` instead.
+
+    Parameters
+    ----------
+    a : ndarray
+        Input array.
+
+    Returns
+    -------
+    isfortran : bool
+        Returns True if the array is Fortran contiguous but *not* C contiguous.
+
+
+    Examples
+    --------
+
+    np.array allows to specify whether the array is written in C-contiguous
+    order (last index varies the fastest), or FORTRAN-contiguous order in
+    memory (first index varies the fastest).
+
+    >>> a = np.array([[1, 2, 3], [4, 5, 6]], order='C')
+    >>> a
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> np.isfortran(a)
+    False
+
+    >>> b = np.array([[1, 2, 3], [4, 5, 6]], order='F')
+    >>> b
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> np.isfortran(b)
+    True
+
+
+    The transpose of a C-ordered array is a FORTRAN-ordered array.
+
+    >>> a = np.array([[1, 2, 3], [4, 5, 6]], order='C')
+    >>> a
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> np.isfortran(a)
+    False
+    >>> b = a.T
+    >>> b
+    array([[1, 4],
+           [2, 5],
+           [3, 6]])
+    >>> np.isfortran(b)
+    True
+
+    C-ordered arrays evaluate as False even if they are also FORTRAN-ordered.
+
+    >>> np.isfortran(np.array([1, 2], order='F'))
+    False
+
+    """
+    return a.flags.fnc
+
+
+def _argwhere_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_argwhere_dispatcher)
+def argwhere(a):
+    """
+    Find the indices of array elements that are non-zero, grouped by element.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+
+    Returns
+    -------
+    index_array : (N, a.ndim) ndarray
+        Indices of elements that are non-zero. Indices are grouped by element.
+        This array will have shape ``(N, a.ndim)`` where ``N`` is the number of
+        non-zero items.
+
+    See Also
+    --------
+    where, nonzero
+
+    Notes
+    -----
+    ``np.argwhere(a)`` is almost the same as ``np.transpose(np.nonzero(a))``,
+    but produces a result of the correct shape for a 0D array.
+
+    The output of ``argwhere`` is not suitable for indexing arrays.
+    For this purpose use ``nonzero(a)`` instead.
+
+    Examples
+    --------
+    >>> x = np.arange(6).reshape(2,3)
+    >>> x
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.argwhere(x>1)
+    array([[0, 2],
+           [1, 0],
+           [1, 1],
+           [1, 2]])
+
+    """
+    # nonzero does not behave well on 0d, so promote to 1d
+    if np.ndim(a) == 0:
+        a = shape_base.atleast_1d(a)
+        # then remove the added dimension
+        return argwhere(a)[:,:0]
+    return transpose(nonzero(a))
+
+
+def _flatnonzero_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_flatnonzero_dispatcher)
+def flatnonzero(a):
+    """
+    Return indices that are non-zero in the flattened version of a.
+
+    This is equivalent to np.nonzero(np.ravel(a))[0].
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+
+    Returns
+    -------
+    res : ndarray
+        Output array, containing the indices of the elements of `a.ravel()`
+        that are non-zero.
+
+    See Also
+    --------
+    nonzero : Return the indices of the non-zero elements of the input array.
+    ravel : Return a 1-D array containing the elements of the input array.
+
+    Examples
+    --------
+    >>> x = np.arange(-2, 3)
+    >>> x
+    array([-2, -1,  0,  1,  2])
+    >>> np.flatnonzero(x)
+    array([0, 1, 3, 4])
+
+    Use the indices of the non-zero elements as an index array to extract
+    these elements:
+
+    >>> x.ravel()[np.flatnonzero(x)]
+    array([-2, -1,  1,  2])
+
+    """
+    return np.nonzero(np.ravel(a))[0]
+
+
+_mode_from_name_dict = {'v': 0,
+                        's': 1,
+                        'f': 2}
+
+
+def _mode_from_name(mode):
+    if isinstance(mode, str):
+        return _mode_from_name_dict[mode.lower()[0]]
+    return mode
+
+
+def _correlate_dispatcher(a, v, mode=None):
+    return (a, v)
+
+
+@array_function_dispatch(_correlate_dispatcher)
+def correlate(a, v, mode='valid'):
+    """
+    Cross-correlation of two 1-dimensional sequences.
+
+    This function computes the correlation as generally defined in signal
+    processing texts::
+
+        c_{av}[k] = sum_n a[n+k] * conj(v[n])
+
+    with a and v sequences being zero-padded where necessary and conj being
+    the conjugate.
+
+    Parameters
+    ----------
+    a, v : array_like
+        Input sequences.
+    mode : {'valid', 'same', 'full'}, optional
+        Refer to the `convolve` docstring.  Note that the default
+        is 'valid', unlike `convolve`, which uses 'full'.
+    old_behavior : bool
+        `old_behavior` was removed in NumPy 1.10. If you need the old
+        behavior, use `multiarray.correlate`.
+
+    Returns
+    -------
+    out : ndarray
+        Discrete cross-correlation of `a` and `v`.
+
+    See Also
+    --------
+    convolve : Discrete, linear convolution of two one-dimensional sequences.
+    multiarray.correlate : Old, no conjugate, version of correlate.
+
+    Notes
+    -----
+    The definition of correlation above is not unique and sometimes correlation
+    may be defined differently. Another common definition is::
+
+        c'_{av}[k] = sum_n a[n] conj(v[n+k])
+
+    which is related to ``c_{av}[k]`` by ``c'_{av}[k] = c_{av}[-k]``.
+
+    Examples
+    --------
+    >>> np.correlate([1, 2, 3], [0, 1, 0.5])
+    array([3.5])
+    >>> np.correlate([1, 2, 3], [0, 1, 0.5], "same")
+    array([2. ,  3.5,  3. ])
+    >>> np.correlate([1, 2, 3], [0, 1, 0.5], "full")
+    array([0.5,  2. ,  3.5,  3. ,  0. ])
+
+    Using complex sequences:
+
+    >>> np.correlate([1+1j, 2, 3-1j], [0, 1, 0.5j], 'full')
+    array([ 0.5-0.5j,  1.0+0.j ,  1.5-1.5j,  3.0-1.j ,  0.0+0.j ])
+
+    Note that you get the time reversed, complex conjugated result
+    when the two input sequences change places, i.e.,
+    ``c_{va}[k] = c^{*}_{av}[-k]``:
+
+    >>> np.correlate([0, 1, 0.5j], [1+1j, 2, 3-1j], 'full')
+    array([ 0.0+0.j ,  3.0+1.j ,  1.5+1.5j,  1.0+0.j ,  0.5+0.5j])
+
+    """
+    mode = _mode_from_name(mode)
+    return multiarray.correlate2(a, v, mode)
+
+
+def _convolve_dispatcher(a, v, mode=None):
+    return (a, v)
+
+
+@array_function_dispatch(_convolve_dispatcher)
+def convolve(a, v, mode='full'):
+    """
+    Returns the discrete, linear convolution of two one-dimensional sequences.
+
+    The convolution operator is often seen in signal processing, where it
+    models the effect of a linear time-invariant system on a signal [1]_.  In
+    probability theory, the sum of two independent random variables is
+    distributed according to the convolution of their individual
+    distributions.
+
+    If `v` is longer than `a`, the arrays are swapped before computation.
+
+    Parameters
+    ----------
+    a : (N,) array_like
+        First one-dimensional input array.
+    v : (M,) array_like
+        Second one-dimensional input array.
+    mode : {'full', 'valid', 'same'}, optional
+        'full':
+          By default, mode is 'full'.  This returns the convolution
+          at each point of overlap, with an output shape of (N+M-1,). At
+          the end-points of the convolution, the signals do not overlap
+          completely, and boundary effects may be seen.
+
+        'same':
+          Mode 'same' returns output of length ``max(M, N)``.  Boundary
+          effects are still visible.
+
+        'valid':
+          Mode 'valid' returns output of length
+          ``max(M, N) - min(M, N) + 1``.  The convolution product is only given
+          for points where the signals overlap completely.  Values outside
+          the signal boundary have no effect.
+
+    Returns
+    -------
+    out : ndarray
+        Discrete, linear convolution of `a` and `v`.
+
+    See Also
+    --------
+    scipy.signal.fftconvolve : Convolve two arrays using the Fast Fourier
+                               Transform.
+    scipy.linalg.toeplitz : Used to construct the convolution operator.
+    polymul : Polynomial multiplication. Same output as convolve, but also
+              accepts poly1d objects as input.
+
+    Notes
+    -----
+    The discrete convolution operation is defined as
+
+    .. math:: (a * v)[n] = \\sum_{m = -\\infty}^{\\infty} a[m] v[n - m]
+
+    It can be shown that a convolution :math:`x(t) * y(t)` in time/space
+    is equivalent to the multiplication :math:`X(f) Y(f)` in the Fourier
+    domain, after appropriate padding (padding is necessary to prevent
+    circular convolution).  Since multiplication is more efficient (faster)
+    than convolution, the function `scipy.signal.fftconvolve` exploits the
+    FFT to calculate the convolution of large data-sets.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Convolution",
+        https://en.wikipedia.org/wiki/Convolution
+
+    Examples
+    --------
+    Note how the convolution operator flips the second array
+    before "sliding" the two across one another:
+
+    >>> np.convolve([1, 2, 3], [0, 1, 0.5])
+    array([0. , 1. , 2.5, 4. , 1.5])
+
+    Only return the middle values of the convolution.
+    Contains boundary effects, where zeros are taken
+    into account:
+
+    >>> np.convolve([1,2,3],[0,1,0.5], 'same')
+    array([1. ,  2.5,  4. ])
+
+    The two arrays are of the same length, so there
+    is only one position where they completely overlap:
+
+    >>> np.convolve([1,2,3],[0,1,0.5], 'valid')
+    array([2.5])
+
+    """
+    a, v = array(a, copy=False, ndmin=1), array(v, copy=False, ndmin=1)
+    if (len(v) > len(a)):
+        a, v = v, a
+    if len(a) == 0:
+        raise ValueError('a cannot be empty')
+    if len(v) == 0:
+        raise ValueError('v cannot be empty')
+    mode = _mode_from_name(mode)
+    return multiarray.correlate(a, v[::-1], mode)
+
+
+def _outer_dispatcher(a, b, out=None):
+    return (a, b, out)
+
+
+@array_function_dispatch(_outer_dispatcher)
+def outer(a, b, out=None):
+    """
+    Compute the outer product of two vectors.
+
+    Given two vectors, ``a = [a0, a1, ..., aM]`` and
+    ``b = [b0, b1, ..., bN]``,
+    the outer product [1]_ is::
+
+      [[a0*b0  a0*b1 ... a0*bN ]
+       [a1*b0    .
+       [ ...          .
+       [aM*b0            aM*bN ]]
+
+    Parameters
+    ----------
+    a : (M,) array_like
+        First input vector.  Input is flattened if
+        not already 1-dimensional.
+    b : (N,) array_like
+        Second input vector.  Input is flattened if
+        not already 1-dimensional.
+    out : (M, N) ndarray, optional
+        A location where the result is stored
+
+        .. versionadded:: 1.9.0
+
+    Returns
+    -------
+    out : (M, N) ndarray
+        ``out[i, j] = a[i] * b[j]``
+
+    See also
+    --------
+    inner
+    einsum : ``einsum('i,j->ij', a.ravel(), b.ravel())`` is the equivalent.
+    ufunc.outer : A generalization to dimensions other than 1D and other
+                  operations. ``np.multiply.outer(a.ravel(), b.ravel())``
+                  is the equivalent.
+    tensordot : ``np.tensordot(a.ravel(), b.ravel(), axes=((), ()))``
+                is the equivalent.
+
+    References
+    ----------
+    .. [1] : G. H. Golub and C. F. Van Loan, *Matrix Computations*, 3rd
+             ed., Baltimore, MD, Johns Hopkins University Press, 1996,
+             pg. 8.
+
+    Examples
+    --------
+    Make a (*very* coarse) grid for computing a Mandelbrot set:
+
+    >>> rl = np.outer(np.ones((5,)), np.linspace(-2, 2, 5))
+    >>> rl
+    array([[-2., -1.,  0.,  1.,  2.],
+           [-2., -1.,  0.,  1.,  2.],
+           [-2., -1.,  0.,  1.,  2.],
+           [-2., -1.,  0.,  1.,  2.],
+           [-2., -1.,  0.,  1.,  2.]])
+    >>> im = np.outer(1j*np.linspace(2, -2, 5), np.ones((5,)))
+    >>> im
+    array([[0.+2.j, 0.+2.j, 0.+2.j, 0.+2.j, 0.+2.j],
+           [0.+1.j, 0.+1.j, 0.+1.j, 0.+1.j, 0.+1.j],
+           [0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j, 0.+0.j],
+           [0.-1.j, 0.-1.j, 0.-1.j, 0.-1.j, 0.-1.j],
+           [0.-2.j, 0.-2.j, 0.-2.j, 0.-2.j, 0.-2.j]])
+    >>> grid = rl + im
+    >>> grid
+    array([[-2.+2.j, -1.+2.j,  0.+2.j,  1.+2.j,  2.+2.j],
+           [-2.+1.j, -1.+1.j,  0.+1.j,  1.+1.j,  2.+1.j],
+           [-2.+0.j, -1.+0.j,  0.+0.j,  1.+0.j,  2.+0.j],
+           [-2.-1.j, -1.-1.j,  0.-1.j,  1.-1.j,  2.-1.j],
+           [-2.-2.j, -1.-2.j,  0.-2.j,  1.-2.j,  2.-2.j]])
+
+    An example using a "vector" of letters:
+
+    >>> x = np.array(['a', 'b', 'c'], dtype=object)
+    >>> np.outer(x, [1, 2, 3])
+    array([['a', 'aa', 'aaa'],
+           ['b', 'bb', 'bbb'],
+           ['c', 'cc', 'ccc']], dtype=object)
+
+    """
+    a = asarray(a)
+    b = asarray(b)
+    return multiply(a.ravel()[:, newaxis], b.ravel()[newaxis, :], out)
+
+
+def _tensordot_dispatcher(a, b, axes=None):
+    return (a, b)
+
+
+@array_function_dispatch(_tensordot_dispatcher)
+def tensordot(a, b, axes=2):
+    """
+    Compute tensor dot product along specified axes.
+
+    Given two tensors, `a` and `b`, and an array_like object containing
+    two array_like objects, ``(a_axes, b_axes)``, sum the products of
+    `a`'s and `b`'s elements (components) over the axes specified by
+    ``a_axes`` and ``b_axes``. The third argument can be a single non-negative
+    integer_like scalar, ``N``; if it is such, then the last ``N`` dimensions
+    of `a` and the first ``N`` dimensions of `b` are summed over.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Tensors to "dot".
+
+    axes : int or (2,) array_like
+        * integer_like
+          If an int N, sum over the last N axes of `a` and the first N axes
+          of `b` in order. The sizes of the corresponding axes must match.
+        * (2,) array_like
+          Or, a list of axes to be summed over, first sequence applying to `a`,
+          second to `b`. Both elements array_like must be of the same length.
+
+    Returns
+    -------
+    output : ndarray
+        The tensor dot product of the input.
+
+    See Also
+    --------
+    dot, einsum
+
+    Notes
+    -----
+    Three common use cases are:
+        * ``axes = 0`` : tensor product :math:`a\\otimes b`
+        * ``axes = 1`` : tensor dot product :math:`a\\cdot b`
+        * ``axes = 2`` : (default) tensor double contraction :math:`a:b`
+
+    When `axes` is integer_like, the sequence for evaluation will be: first
+    the -Nth axis in `a` and 0th axis in `b`, and the -1th axis in `a` and
+    Nth axis in `b` last.
+
+    When there is more than one axis to sum over - and they are not the last
+    (first) axes of `a` (`b`) - the argument `axes` should consist of
+    two sequences of the same length, with the first axis to sum over given
+    first in both sequences, the second axis second, and so forth.
+
+    The shape of the result consists of the non-contracted axes of the
+    first tensor, followed by the non-contracted axes of the second.
+
+    Examples
+    --------
+    A "traditional" example:
+
+    >>> a = np.arange(60.).reshape(3,4,5)
+    >>> b = np.arange(24.).reshape(4,3,2)
+    >>> c = np.tensordot(a,b, axes=([1,0],[0,1]))
+    >>> c.shape
+    (5, 2)
+    >>> c
+    array([[4400., 4730.],
+           [4532., 4874.],
+           [4664., 5018.],
+           [4796., 5162.],
+           [4928., 5306.]])
+    >>> # A slower but equivalent way of computing the same...
+    >>> d = np.zeros((5,2))
+    >>> for i in range(5):
+    ...   for j in range(2):
+    ...     for k in range(3):
+    ...       for n in range(4):
+    ...         d[i,j] += a[k,n,i] * b[n,k,j]
+    >>> c == d
+    array([[ True,  True],
+           [ True,  True],
+           [ True,  True],
+           [ True,  True],
+           [ True,  True]])
+
+    An extended example taking advantage of the overloading of + and \\*:
+
+    >>> a = np.array(range(1, 9))
+    >>> a.shape = (2, 2, 2)
+    >>> A = np.array(('a', 'b', 'c', 'd'), dtype=object)
+    >>> A.shape = (2, 2)
+    >>> a; A
+    array([[[1, 2],
+            [3, 4]],
+           [[5, 6],
+            [7, 8]]])
+    array([['a', 'b'],
+           ['c', 'd']], dtype=object)
+
+    >>> np.tensordot(a, A) # third argument default is 2 for double-contraction
+    array(['abbcccdddd', 'aaaaabbbbbbcccccccdddddddd'], dtype=object)
+
+    >>> np.tensordot(a, A, 1)
+    array([[['acc', 'bdd'],
+            ['aaacccc', 'bbbdddd']],
+           [['aaaaacccccc', 'bbbbbdddddd'],
+            ['aaaaaaacccccccc', 'bbbbbbbdddddddd']]], dtype=object)
+
+    >>> np.tensordot(a, A, 0) # tensor product (result too long to incl.)
+    array([[[[['a', 'b'],
+              ['c', 'd']],
+              ...
+
+    >>> np.tensordot(a, A, (0, 1))
+    array([[['abbbbb', 'cddddd'],
+            ['aabbbbbb', 'ccdddddd']],
+           [['aaabbbbbbb', 'cccddddddd'],
+            ['aaaabbbbbbbb', 'ccccdddddddd']]], dtype=object)
+
+    >>> np.tensordot(a, A, (2, 1))
+    array([[['abb', 'cdd'],
+            ['aaabbbb', 'cccdddd']],
+           [['aaaaabbbbbb', 'cccccdddddd'],
+            ['aaaaaaabbbbbbbb', 'cccccccdddddddd']]], dtype=object)
+
+    >>> np.tensordot(a, A, ((0, 1), (0, 1)))
+    array(['abbbcccccddddddd', 'aabbbbccccccdddddddd'], dtype=object)
+
+    >>> np.tensordot(a, A, ((2, 1), (1, 0)))
+    array(['acccbbdddd', 'aaaaacccccccbbbbbbdddddddd'], dtype=object)
+
+    """
+    try:
+        iter(axes)
+    except Exception:
+        axes_a = list(range(-axes, 0))
+        axes_b = list(range(0, axes))
+    else:
+        axes_a, axes_b = axes
+    try:
+        na = len(axes_a)
+        axes_a = list(axes_a)
+    except TypeError:
+        axes_a = [axes_a]
+        na = 1
+    try:
+        nb = len(axes_b)
+        axes_b = list(axes_b)
+    except TypeError:
+        axes_b = [axes_b]
+        nb = 1
+
+    a, b = asarray(a), asarray(b)
+    as_ = a.shape
+    nda = a.ndim
+    bs = b.shape
+    ndb = b.ndim
+    equal = True
+    if na != nb:
+        equal = False
+    else:
+        for k in range(na):
+            if as_[axes_a[k]] != bs[axes_b[k]]:
+                equal = False
+                break
+            if axes_a[k] < 0:
+                axes_a[k] += nda
+            if axes_b[k] < 0:
+                axes_b[k] += ndb
+    if not equal:
+        raise ValueError("shape-mismatch for sum")
+
+    # Move the axes to sum over to the end of "a"
+    # and to the front of "b"
+    notin = [k for k in range(nda) if k not in axes_a]
+    newaxes_a = notin + axes_a
+    N2 = 1
+    for axis in axes_a:
+        N2 *= as_[axis]
+    newshape_a = (int(multiply.reduce([as_[ax] for ax in notin])), N2)
+    olda = [as_[axis] for axis in notin]
+
+    notin = [k for k in range(ndb) if k not in axes_b]
+    newaxes_b = axes_b + notin
+    N2 = 1
+    for axis in axes_b:
+        N2 *= bs[axis]
+    newshape_b = (N2, int(multiply.reduce([bs[ax] for ax in notin])))
+    oldb = [bs[axis] for axis in notin]
+
+    at = a.transpose(newaxes_a).reshape(newshape_a)
+    bt = b.transpose(newaxes_b).reshape(newshape_b)
+    res = dot(at, bt)
+    return res.reshape(olda + oldb)
+
+
+def _roll_dispatcher(a, shift, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_roll_dispatcher)
+def roll(a, shift, axis=None):
+    """
+    Roll array elements along a given axis.
+
+    Elements that roll beyond the last position are re-introduced at
+    the first.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    shift : int or tuple of ints
+        The number of places by which elements are shifted.  If a tuple,
+        then `axis` must be a tuple of the same size, and each of the
+        given axes is shifted by the corresponding number.  If an int
+        while `axis` is a tuple of ints, then the same value is used for
+        all given axes.
+    axis : int or tuple of ints, optional
+        Axis or axes along which elements are shifted.  By default, the
+        array is flattened before shifting, after which the original
+        shape is restored.
+
+    Returns
+    -------
+    res : ndarray
+        Output array, with the same shape as `a`.
+
+    See Also
+    --------
+    rollaxis : Roll the specified axis backwards, until it lies in a
+               given position.
+
+    Notes
+    -----
+    .. versionadded:: 1.12.0
+
+    Supports rolling over multiple dimensions simultaneously.
+
+    Examples
+    --------
+    >>> x = np.arange(10)
+    >>> np.roll(x, 2)
+    array([8, 9, 0, 1, 2, 3, 4, 5, 6, 7])
+    >>> np.roll(x, -2)
+    array([2, 3, 4, 5, 6, 7, 8, 9, 0, 1])
+
+    >>> x2 = np.reshape(x, (2,5))
+    >>> x2
+    array([[0, 1, 2, 3, 4],
+           [5, 6, 7, 8, 9]])
+    >>> np.roll(x2, 1)
+    array([[9, 0, 1, 2, 3],
+           [4, 5, 6, 7, 8]])
+    >>> np.roll(x2, -1)
+    array([[1, 2, 3, 4, 5],
+           [6, 7, 8, 9, 0]])
+    >>> np.roll(x2, 1, axis=0)
+    array([[5, 6, 7, 8, 9],
+           [0, 1, 2, 3, 4]])
+    >>> np.roll(x2, -1, axis=0)
+    array([[5, 6, 7, 8, 9],
+           [0, 1, 2, 3, 4]])
+    >>> np.roll(x2, 1, axis=1)
+    array([[4, 0, 1, 2, 3],
+           [9, 5, 6, 7, 8]])
+    >>> np.roll(x2, -1, axis=1)
+    array([[1, 2, 3, 4, 0],
+           [6, 7, 8, 9, 5]])
+
+    """
+    a = asanyarray(a)
+    if axis is None:
+        return roll(a.ravel(), shift, 0).reshape(a.shape)
+
+    else:
+        axis = normalize_axis_tuple(axis, a.ndim, allow_duplicate=True)
+        broadcasted = broadcast(shift, axis)
+        if broadcasted.ndim > 1:
+            raise ValueError(
+                "'shift' and 'axis' should be scalars or 1D sequences")
+        shifts = {ax: 0 for ax in range(a.ndim)}
+        for sh, ax in broadcasted:
+            shifts[ax] += sh
+
+        rolls = [((slice(None), slice(None)),)] * a.ndim
+        for ax, offset in shifts.items():
+            offset %= a.shape[ax] or 1  # If `a` is empty, nothing matters.
+            if offset:
+                # (original, result), (original, result)
+                rolls[ax] = ((slice(None, -offset), slice(offset, None)),
+                             (slice(-offset, None), slice(None, offset)))
+
+        result = empty_like(a)
+        for indices in itertools.product(*rolls):
+            arr_index, res_index = zip(*indices)
+            result[res_index] = a[arr_index]
+
+        return result
+
+
+def _rollaxis_dispatcher(a, axis, start=None):
+    return (a,)
+
+
+@array_function_dispatch(_rollaxis_dispatcher)
+def rollaxis(a, axis, start=0):
+    """
+    Roll the specified axis backwards, until it lies in a given position.
+
+    This function continues to be supported for backward compatibility, but you
+    should prefer `moveaxis`. The `moveaxis` function was added in NumPy
+    1.11.
+
+    Parameters
+    ----------
+    a : ndarray
+        Input array.
+    axis : int
+        The axis to be rolled. The positions of the other axes do not
+        change relative to one another.
+    start : int, optional
+        When ``start <= axis``, the axis is rolled back until it lies in
+        this position. When ``start > axis``, the axis is rolled until it
+        lies before this position. The default, 0, results in a "complete"
+        roll. The following table describes how negative values of ``start``
+        are interpreted:
+
+        .. table::
+           :align: left
+
+           +-------------------+----------------------+
+           |     ``start``     | Normalized ``start`` |
+           +===================+======================+
+           | ``-(arr.ndim+1)`` | raise ``AxisError``  |
+           +-------------------+----------------------+
+           | ``-arr.ndim``     | 0                    |
+           +-------------------+----------------------+
+           | |vdots|           | |vdots|              |
+           +-------------------+----------------------+
+           | ``-1``            | ``arr.ndim-1``       |
+           +-------------------+----------------------+
+           | ``0``             | ``0``                |
+           +-------------------+----------------------+
+           | |vdots|           | |vdots|              |
+           +-------------------+----------------------+
+           | ``arr.ndim``      | ``arr.ndim``         |
+           +-------------------+----------------------+
+           | ``arr.ndim + 1``  | raise ``AxisError``  |
+           +-------------------+----------------------+
+           
+        .. |vdots|   unicode:: U+22EE .. Vertical Ellipsis
+
+    Returns
+    -------
+    res : ndarray
+        For NumPy >= 1.10.0 a view of `a` is always returned. For earlier
+        NumPy versions a view of `a` is returned only if the order of the
+        axes is changed, otherwise the input array is returned.
+
+    See Also
+    --------
+    moveaxis : Move array axes to new positions.
+    roll : Roll the elements of an array by a number of positions along a
+        given axis.
+
+    Examples
+    --------
+    >>> a = np.ones((3,4,5,6))
+    >>> np.rollaxis(a, 3, 1).shape
+    (3, 6, 4, 5)
+    >>> np.rollaxis(a, 2).shape
+    (5, 3, 4, 6)
+    >>> np.rollaxis(a, 1, 4).shape
+    (3, 5, 6, 4)
+
+    """
+    n = a.ndim
+    axis = normalize_axis_index(axis, n)
+    if start < 0:
+        start += n
+    msg = "'%s' arg requires %d <= %s < %d, but %d was passed in"
+    if not (0 <= start < n + 1):
+        raise AxisError(msg % ('start', -n, 'start', n + 1, start))
+    if axis < start:
+        # it's been removed
+        start -= 1
+    if axis == start:
+        return a[...]
+    axes = list(range(0, n))
+    axes.remove(axis)
+    axes.insert(start, axis)
+    return a.transpose(axes)
+
+
+def normalize_axis_tuple(axis, ndim, argname=None, allow_duplicate=False):
+    """
+    Normalizes an axis argument into a tuple of non-negative integer axes.
+
+    This handles shorthands such as ``1`` and converts them to ``(1,)``,
+    as well as performing the handling of negative indices covered by
+    `normalize_axis_index`.
+
+    By default, this forbids axes from being specified multiple times.
+
+    Used internally by multi-axis-checking logic.
+
+    .. versionadded:: 1.13.0
+
+    Parameters
+    ----------
+    axis : int, iterable of int
+        The un-normalized index or indices of the axis.
+    ndim : int
+        The number of dimensions of the array that `axis` should be normalized
+        against.
+    argname : str, optional
+        A prefix to put before the error message, typically the name of the
+        argument.
+    allow_duplicate : bool, optional
+        If False, the default, disallow an axis from being specified twice.
+
+    Returns
+    -------
+    normalized_axes : tuple of int
+        The normalized axis index, such that `0 <= normalized_axis < ndim`
+
+    Raises
+    ------
+    AxisError
+        If any axis provided is out of range
+    ValueError
+        If an axis is repeated
+
+    See also
+    --------
+    normalize_axis_index : normalizing a single scalar axis
+    """
+    # Optimization to speed-up the most common cases.
+    if type(axis) not in (tuple, list):
+        try:
+            axis = [operator.index(axis)]
+        except TypeError:
+            pass
+    # Going via an iterator directly is slower than via list comprehension.
+    axis = tuple([normalize_axis_index(ax, ndim, argname) for ax in axis])
+    if not allow_duplicate and len(set(axis)) != len(axis):
+        if argname:
+            raise ValueError('repeated axis in `{}` argument'.format(argname))
+        else:
+            raise ValueError('repeated axis')
+    return axis
+
+
+def _moveaxis_dispatcher(a, source, destination):
+    return (a,)
+
+
+@array_function_dispatch(_moveaxis_dispatcher)
+def moveaxis(a, source, destination):
+    """
+    Move axes of an array to new positions.
+
+    Other axes remain in their original order.
+
+    .. versionadded:: 1.11.0
+
+    Parameters
+    ----------
+    a : np.ndarray
+        The array whose axes should be reordered.
+    source : int or sequence of int
+        Original positions of the axes to move. These must be unique.
+    destination : int or sequence of int
+        Destination positions for each of the original axes. These must also be
+        unique.
+
+    Returns
+    -------
+    result : np.ndarray
+        Array with moved axes. This array is a view of the input array.
+
+    See Also
+    --------
+    transpose: Permute the dimensions of an array.
+    swapaxes: Interchange two axes of an array.
+
+    Examples
+    --------
+
+    >>> x = np.zeros((3, 4, 5))
+    >>> np.moveaxis(x, 0, -1).shape
+    (4, 5, 3)
+    >>> np.moveaxis(x, -1, 0).shape
+    (5, 3, 4)
+
+    These all achieve the same result:
+
+    >>> np.transpose(x).shape
+    (5, 4, 3)
+    >>> np.swapaxes(x, 0, -1).shape
+    (5, 4, 3)
+    >>> np.moveaxis(x, [0, 1], [-1, -2]).shape
+    (5, 4, 3)
+    >>> np.moveaxis(x, [0, 1, 2], [-1, -2, -3]).shape
+    (5, 4, 3)
+
+    """
+    try:
+        # allow duck-array types if they define transpose
+        transpose = a.transpose
+    except AttributeError:
+        a = asarray(a)
+        transpose = a.transpose
+
+    source = normalize_axis_tuple(source, a.ndim, 'source')
+    destination = normalize_axis_tuple(destination, a.ndim, 'destination')
+    if len(source) != len(destination):
+        raise ValueError('`source` and `destination` arguments must have '
+                         'the same number of elements')
+
+    order = [n for n in range(a.ndim) if n not in source]
+
+    for dest, src in sorted(zip(destination, source)):
+        order.insert(dest, src)
+
+    result = transpose(order)
+    return result
+
+
+# fix hack in scipy which imports this function
+def _move_axis_to_0(a, axis):
+    return moveaxis(a, axis, 0)
+
+
+def _cross_dispatcher(a, b, axisa=None, axisb=None, axisc=None, axis=None):
+    return (a, b)
+
+
+@array_function_dispatch(_cross_dispatcher)
+def cross(a, b, axisa=-1, axisb=-1, axisc=-1, axis=None):
+    """
+    Return the cross product of two (arrays of) vectors.
+
+    The cross product of `a` and `b` in :math:`R^3` is a vector perpendicular
+    to both `a` and `b`.  If `a` and `b` are arrays of vectors, the vectors
+    are defined by the last axis of `a` and `b` by default, and these axes
+    can have dimensions 2 or 3.  Where the dimension of either `a` or `b` is
+    2, the third component of the input vector is assumed to be zero and the
+    cross product calculated accordingly.  In cases where both input vectors
+    have dimension 2, the z-component of the cross product is returned.
+
+    Parameters
+    ----------
+    a : array_like
+        Components of the first vector(s).
+    b : array_like
+        Components of the second vector(s).
+    axisa : int, optional
+        Axis of `a` that defines the vector(s).  By default, the last axis.
+    axisb : int, optional
+        Axis of `b` that defines the vector(s).  By default, the last axis.
+    axisc : int, optional
+        Axis of `c` containing the cross product vector(s).  Ignored if
+        both input vectors have dimension 2, as the return is scalar.
+        By default, the last axis.
+    axis : int, optional
+        If defined, the axis of `a`, `b` and `c` that defines the vector(s)
+        and cross product(s).  Overrides `axisa`, `axisb` and `axisc`.
+
+    Returns
+    -------
+    c : ndarray
+        Vector cross product(s).
+
+    Raises
+    ------
+    ValueError
+        When the dimension of the vector(s) in `a` and/or `b` does not
+        equal 2 or 3.
+
+    See Also
+    --------
+    inner : Inner product
+    outer : Outer product.
+    ix_ : Construct index arrays.
+
+    Notes
+    -----
+    .. versionadded:: 1.9.0
+
+    Supports full broadcasting of the inputs.
+
+    Examples
+    --------
+    Vector cross-product.
+
+    >>> x = [1, 2, 3]
+    >>> y = [4, 5, 6]
+    >>> np.cross(x, y)
+    array([-3,  6, -3])
+
+    One vector with dimension 2.
+
+    >>> x = [1, 2]
+    >>> y = [4, 5, 6]
+    >>> np.cross(x, y)
+    array([12, -6, -3])
+
+    Equivalently:
+
+    >>> x = [1, 2, 0]
+    >>> y = [4, 5, 6]
+    >>> np.cross(x, y)
+    array([12, -6, -3])
+
+    Both vectors with dimension 2.
+
+    >>> x = [1,2]
+    >>> y = [4,5]
+    >>> np.cross(x, y)
+    array(-3)
+
+    Multiple vector cross-products. Note that the direction of the cross
+    product vector is defined by the `right-hand rule`.
+
+    >>> x = np.array([[1,2,3], [4,5,6]])
+    >>> y = np.array([[4,5,6], [1,2,3]])
+    >>> np.cross(x, y)
+    array([[-3,  6, -3],
+           [ 3, -6,  3]])
+
+    The orientation of `c` can be changed using the `axisc` keyword.
+
+    >>> np.cross(x, y, axisc=0)
+    array([[-3,  3],
+           [ 6, -6],
+           [-3,  3]])
+
+    Change the vector definition of `x` and `y` using `axisa` and `axisb`.
+
+    >>> x = np.array([[1,2,3], [4,5,6], [7, 8, 9]])
+    >>> y = np.array([[7, 8, 9], [4,5,6], [1,2,3]])
+    >>> np.cross(x, y)
+    array([[ -6,  12,  -6],
+           [  0,   0,   0],
+           [  6, -12,   6]])
+    >>> np.cross(x, y, axisa=0, axisb=0)
+    array([[-24,  48, -24],
+           [-30,  60, -30],
+           [-36,  72, -36]])
+
+    """
+    if axis is not None:
+        axisa, axisb, axisc = (axis,) * 3
+    a = asarray(a)
+    b = asarray(b)
+    # Check axisa and axisb are within bounds
+    axisa = normalize_axis_index(axisa, a.ndim, msg_prefix='axisa')
+    axisb = normalize_axis_index(axisb, b.ndim, msg_prefix='axisb')
+
+    # Move working axis to the end of the shape
+    a = moveaxis(a, axisa, -1)
+    b = moveaxis(b, axisb, -1)
+    msg = ("incompatible dimensions for cross product\n"
+           "(dimension must be 2 or 3)")
+    if a.shape[-1] not in (2, 3) or b.shape[-1] not in (2, 3):
+        raise ValueError(msg)
+
+    # Create the output array
+    shape = broadcast(a[..., 0], b[..., 0]).shape
+    if a.shape[-1] == 3 or b.shape[-1] == 3:
+        shape += (3,)
+        # Check axisc is within bounds
+        axisc = normalize_axis_index(axisc, len(shape), msg_prefix='axisc')
+    dtype = promote_types(a.dtype, b.dtype)
+    cp = empty(shape, dtype)
+
+    # create local aliases for readability
+    a0 = a[..., 0]
+    a1 = a[..., 1]
+    if a.shape[-1] == 3:
+        a2 = a[..., 2]
+    b0 = b[..., 0]
+    b1 = b[..., 1]
+    if b.shape[-1] == 3:
+        b2 = b[..., 2]
+    if cp.ndim != 0 and cp.shape[-1] == 3:
+        cp0 = cp[..., 0]
+        cp1 = cp[..., 1]
+        cp2 = cp[..., 2]
+
+    if a.shape[-1] == 2:
+        if b.shape[-1] == 2:
+            # a0 * b1 - a1 * b0
+            multiply(a0, b1, out=cp)
+            cp -= a1 * b0
+            return cp
+        else:
+            assert b.shape[-1] == 3
+            # cp0 = a1 * b2 - 0  (a2 = 0)
+            # cp1 = 0 - a0 * b2  (a2 = 0)
+            # cp2 = a0 * b1 - a1 * b0
+            multiply(a1, b2, out=cp0)
+            multiply(a0, b2, out=cp1)
+            negative(cp1, out=cp1)
+            multiply(a0, b1, out=cp2)
+            cp2 -= a1 * b0
+    else:
+        assert a.shape[-1] == 3
+        if b.shape[-1] == 3:
+            # cp0 = a1 * b2 - a2 * b1
+            # cp1 = a2 * b0 - a0 * b2
+            # cp2 = a0 * b1 - a1 * b0
+            multiply(a1, b2, out=cp0)
+            tmp = array(a2 * b1)
+            cp0 -= tmp
+            multiply(a2, b0, out=cp1)
+            multiply(a0, b2, out=tmp)
+            cp1 -= tmp
+            multiply(a0, b1, out=cp2)
+            multiply(a1, b0, out=tmp)
+            cp2 -= tmp
+        else:
+            assert b.shape[-1] == 2
+            # cp0 = 0 - a2 * b1  (b2 = 0)
+            # cp1 = a2 * b0 - 0  (b2 = 0)
+            # cp2 = a0 * b1 - a1 * b0
+            multiply(a2, b1, out=cp0)
+            negative(cp0, out=cp0)
+            multiply(a2, b0, out=cp1)
+            multiply(a0, b1, out=cp2)
+            cp2 -= a1 * b0
+
+    return moveaxis(cp, -1, axisc)
+
+
+little_endian = (sys.byteorder == 'little')
+
+
+@set_module('numpy')
+def indices(dimensions, dtype=int, sparse=False):
+    """
+    Return an array representing the indices of a grid.
+
+    Compute an array where the subarrays contain index values 0, 1, ...
+    varying only along the corresponding axis.
+
+    Parameters
+    ----------
+    dimensions : sequence of ints
+        The shape of the grid.
+    dtype : dtype, optional
+        Data type of the result.
+    sparse : boolean, optional
+        Return a sparse representation of the grid instead of a dense
+        representation. Default is False.
+
+        .. versionadded:: 1.17
+
+    Returns
+    -------
+    grid : one ndarray or tuple of ndarrays
+        If sparse is False:
+            Returns one array of grid indices,
+            ``grid.shape = (len(dimensions),) + tuple(dimensions)``.
+        If sparse is True:
+            Returns a tuple of arrays, with
+            ``grid[i].shape = (1, ..., 1, dimensions[i], 1, ..., 1)`` with
+            dimensions[i] in the ith place
+
+    See Also
+    --------
+    mgrid, ogrid, meshgrid
+
+    Notes
+    -----
+    The output shape in the dense case is obtained by prepending the number
+    of dimensions in front of the tuple of dimensions, i.e. if `dimensions`
+    is a tuple ``(r0, ..., rN-1)`` of length ``N``, the output shape is
+    ``(N, r0, ..., rN-1)``.
+
+    The subarrays ``grid[k]`` contains the N-D array of indices along the
+    ``k-th`` axis. Explicitly::
+
+        grid[k, i0, i1, ..., iN-1] = ik
+
+    Examples
+    --------
+    >>> grid = np.indices((2, 3))
+    >>> grid.shape
+    (2, 2, 3)
+    >>> grid[0]        # row indices
+    array([[0, 0, 0],
+           [1, 1, 1]])
+    >>> grid[1]        # column indices
+    array([[0, 1, 2],
+           [0, 1, 2]])
+
+    The indices can be used as an index into an array.
+
+    >>> x = np.arange(20).reshape(5, 4)
+    >>> row, col = np.indices((2, 3))
+    >>> x[row, col]
+    array([[0, 1, 2],
+           [4, 5, 6]])
+
+    Note that it would be more straightforward in the above example to
+    extract the required elements directly with ``x[:2, :3]``.
+
+    If sparse is set to true, the grid will be returned in a sparse
+    representation.
+
+    >>> i, j = np.indices((2, 3), sparse=True)
+    >>> i.shape
+    (2, 1)
+    >>> j.shape
+    (1, 3)
+    >>> i        # row indices
+    array([[0],
+           [1]])
+    >>> j        # column indices
+    array([[0, 1, 2]])
+
+    """
+    dimensions = tuple(dimensions)
+    N = len(dimensions)
+    shape = (1,)*N
+    if sparse:
+        res = tuple()
+    else:
+        res = empty((N,)+dimensions, dtype=dtype)
+    for i, dim in enumerate(dimensions):
+        idx = arange(dim, dtype=dtype).reshape(
+            shape[:i] + (dim,) + shape[i+1:]
+        )
+        if sparse:
+            res = res + (idx,)
+        else:
+            res[i] = idx
+    return res
+
+
+@set_module('numpy')
+def fromfunction(function, shape, *, dtype=float, **kwargs):
+    """
+    Construct an array by executing a function over each coordinate.
+
+    The resulting array therefore has a value ``fn(x, y, z)`` at
+    coordinate ``(x, y, z)``.
+
+    Parameters
+    ----------
+    function : callable
+        The function is called with N parameters, where N is the rank of
+        `shape`.  Each parameter represents the coordinates of the array
+        varying along a specific axis.  For example, if `shape`
+        were ``(2, 2)``, then the parameters would be
+        ``array([[0, 0], [1, 1]])`` and ``array([[0, 1], [0, 1]])``
+    shape : (N,) tuple of ints
+        Shape of the output array, which also determines the shape of
+        the coordinate arrays passed to `function`.
+    dtype : data-type, optional
+        Data-type of the coordinate arrays passed to `function`.
+        By default, `dtype` is float.
+
+    Returns
+    -------
+    fromfunction : any
+        The result of the call to `function` is passed back directly.
+        Therefore the shape of `fromfunction` is completely determined by
+        `function`.  If `function` returns a scalar value, the shape of
+        `fromfunction` would not match the `shape` parameter.
+
+    See Also
+    --------
+    indices, meshgrid
+
+    Notes
+    -----
+    Keywords other than `dtype` are passed to `function`.
+
+    Examples
+    --------
+    >>> np.fromfunction(lambda i, j: i == j, (3, 3), dtype=int)
+    array([[ True, False, False],
+           [False,  True, False],
+           [False, False,  True]])
+
+    >>> np.fromfunction(lambda i, j: i + j, (3, 3), dtype=int)
+    array([[0, 1, 2],
+           [1, 2, 3],
+           [2, 3, 4]])
+
+    """
+    args = indices(shape, dtype=dtype)
+    return function(*args, **kwargs)
+
+
+def _frombuffer(buf, dtype, shape, order):
+    return frombuffer(buf, dtype=dtype).reshape(shape, order=order)
+
+
+@set_module('numpy')
+def isscalar(element):
+    """
+    Returns True if the type of `element` is a scalar type.
+
+    Parameters
+    ----------
+    element : any
+        Input argument, can be of any type and shape.
+
+    Returns
+    -------
+    val : bool
+        True if `element` is a scalar type, False if it is not.
+
+    See Also
+    --------
+    ndim : Get the number of dimensions of an array
+
+    Notes
+    -----
+    If you need a stricter way to identify a *numerical* scalar, use
+    ``isinstance(x, numbers.Number)``, as that returns ``False`` for most
+    non-numerical elements such as strings.
+
+    In most cases ``np.ndim(x) == 0`` should be used instead of this function,
+    as that will also return true for 0d arrays. This is how numpy overloads
+    functions in the style of the ``dx`` arguments to `gradient` and the ``bins``
+    argument to `histogram`. Some key differences:
+
+    +--------------------------------------+---------------+-------------------+
+    | x                                    |``isscalar(x)``|``np.ndim(x) == 0``|
+    +======================================+===============+===================+
+    | PEP 3141 numeric objects (including  | ``True``      | ``True``          |
+    | builtins)                            |               |                   |
+    +--------------------------------------+---------------+-------------------+
+    | builtin string and buffer objects    | ``True``      | ``True``          |
+    +--------------------------------------+---------------+-------------------+
+    | other builtin objects, like          | ``False``     | ``True``          |
+    | `pathlib.Path`, `Exception`,         |               |                   |
+    | the result of `re.compile`           |               |                   |
+    +--------------------------------------+---------------+-------------------+
+    | third-party objects like             | ``False``     | ``True``          |
+    | `matplotlib.figure.Figure`           |               |                   |
+    +--------------------------------------+---------------+-------------------+
+    | zero-dimensional numpy arrays        | ``False``     | ``True``          |
+    +--------------------------------------+---------------+-------------------+
+    | other numpy arrays                   | ``False``     | ``False``         |
+    +--------------------------------------+---------------+-------------------+
+    | `list`, `tuple`, and other sequence  | ``False``     | ``False``         |
+    | objects                              |               |                   |
+    +--------------------------------------+---------------+-------------------+
+
+    Examples
+    --------
+    >>> np.isscalar(3.1)
+    True
+    >>> np.isscalar(np.array(3.1))
+    False
+    >>> np.isscalar([3.1])
+    False
+    >>> np.isscalar(False)
+    True
+    >>> np.isscalar('numpy')
+    True
+
+    NumPy supports PEP 3141 numbers:
+
+    >>> from fractions import Fraction
+    >>> np.isscalar(Fraction(5, 17))
+    True
+    >>> from numbers import Number
+    >>> np.isscalar(Number())
+    True
+
+    """
+    return (isinstance(element, generic)
+            or type(element) in ScalarType
+            or isinstance(element, numbers.Number))
+
+
+@set_module('numpy')
+def binary_repr(num, width=None):
+    """
+    Return the binary representation of the input number as a string.
+
+    For negative numbers, if width is not given, a minus sign is added to the
+    front. If width is given, the two's complement of the number is
+    returned, with respect to that width.
+
+    In a two's-complement system negative numbers are represented by the two's
+    complement of the absolute value. This is the most common method of
+    representing signed integers on computers [1]_. A N-bit two's-complement
+    system can represent every integer in the range
+    :math:`-2^{N-1}` to :math:`+2^{N-1}-1`.
+
+    Parameters
+    ----------
+    num : int
+        Only an integer decimal number can be used.
+    width : int, optional
+        The length of the returned string if `num` is positive, or the length
+        of the two's complement if `num` is negative, provided that `width` is
+        at least a sufficient number of bits for `num` to be represented in the
+        designated form.
+
+        If the `width` value is insufficient, it will be ignored, and `num` will
+        be returned in binary (`num` > 0) or two's complement (`num` < 0) form
+        with its width equal to the minimum number of bits needed to represent
+        the number in the designated form. This behavior is deprecated and will
+        later raise an error.
+
+        .. deprecated:: 1.12.0
+
+    Returns
+    -------
+    bin : str
+        Binary representation of `num` or two's complement of `num`.
+
+    See Also
+    --------
+    base_repr: Return a string representation of a number in the given base
+               system.
+    bin: Python's built-in binary representation generator of an integer.
+
+    Notes
+    -----
+    `binary_repr` is equivalent to using `base_repr` with base 2, but about 25x
+    faster.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Two's complement",
+        https://en.wikipedia.org/wiki/Two's_complement
+
+    Examples
+    --------
+    >>> np.binary_repr(3)
+    '11'
+    >>> np.binary_repr(-3)
+    '-11'
+    >>> np.binary_repr(3, width=4)
+    '0011'
+
+    The two's complement is returned when the input number is negative and
+    width is specified:
+
+    >>> np.binary_repr(-3, width=3)
+    '101'
+    >>> np.binary_repr(-3, width=5)
+    '11101'
+
+    """
+    def warn_if_insufficient(width, binwidth):
+        if width is not None and width < binwidth:
+            warnings.warn(
+                "Insufficient bit width provided. This behavior "
+                "will raise an error in the future.", DeprecationWarning,
+                stacklevel=3)
+
+    # Ensure that num is a Python integer to avoid overflow or unwanted
+    # casts to floating point.
+    num = operator.index(num)
+
+    if num == 0:
+        return '0' * (width or 1)
+
+    elif num > 0:
+        binary = bin(num)[2:]
+        binwidth = len(binary)
+        outwidth = (binwidth if width is None
+                    else max(binwidth, width))
+        warn_if_insufficient(width, binwidth)
+        return binary.zfill(outwidth)
+
+    else:
+        if width is None:
+            return '-' + bin(-num)[2:]
+
+        else:
+            poswidth = len(bin(-num)[2:])
+
+            # See gh-8679: remove extra digit
+            # for numbers at boundaries.
+            if 2**(poswidth - 1) == -num:
+                poswidth -= 1
+
+            twocomp = 2**(poswidth + 1) + num
+            binary = bin(twocomp)[2:]
+            binwidth = len(binary)
+
+            outwidth = max(binwidth, width)
+            warn_if_insufficient(width, binwidth)
+            return '1' * (outwidth - binwidth) + binary
+
+
+@set_module('numpy')
+def base_repr(number, base=2, padding=0):
+    """
+    Return a string representation of a number in the given base system.
+
+    Parameters
+    ----------
+    number : int
+        The value to convert. Positive and negative values are handled.
+    base : int, optional
+        Convert `number` to the `base` number system. The valid range is 2-36,
+        the default value is 2.
+    padding : int, optional
+        Number of zeros padded on the left. Default is 0 (no padding).
+
+    Returns
+    -------
+    out : str
+        String representation of `number` in `base` system.
+
+    See Also
+    --------
+    binary_repr : Faster version of `base_repr` for base 2.
+
+    Examples
+    --------
+    >>> np.base_repr(5)
+    '101'
+    >>> np.base_repr(6, 5)
+    '11'
+    >>> np.base_repr(7, base=5, padding=3)
+    '00012'
+
+    >>> np.base_repr(10, base=16)
+    'A'
+    >>> np.base_repr(32, base=16)
+    '20'
+
+    """
+    digits = '0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZ'
+    if base > len(digits):
+        raise ValueError("Bases greater than 36 not handled in base_repr.")
+    elif base < 2:
+        raise ValueError("Bases less than 2 not handled in base_repr.")
+
+    num = abs(number)
+    res = []
+    while num:
+        res.append(digits[num % base])
+        num //= base
+    if padding:
+        res.append('0' * padding)
+    if number < 0:
+        res.append('-')
+    return ''.join(reversed(res or '0'))
+
+
+# These are all essentially abbreviations
+# These might wind up in a special abbreviations module
+
+
+def _maketup(descr, val):
+    dt = dtype(descr)
+    # Place val in all scalar tuples:
+    fields = dt.fields
+    if fields is None:
+        return val
+    else:
+        res = [_maketup(fields[name][0], val) for name in dt.names]
+        return tuple(res)
+
+
+@set_module('numpy')
+def identity(n, dtype=None):
+    """
+    Return the identity array.
+
+    The identity array is a square array with ones on
+    the main diagonal.
+
+    Parameters
+    ----------
+    n : int
+        Number of rows (and columns) in `n` x `n` output.
+    dtype : data-type, optional
+        Data-type of the output.  Defaults to ``float``.
+
+    Returns
+    -------
+    out : ndarray
+        `n` x `n` array with its main diagonal set to one,
+        and all other elements 0.
+
+    Examples
+    --------
+    >>> np.identity(3)
+    array([[1.,  0.,  0.],
+           [0.,  1.,  0.],
+           [0.,  0.,  1.]])
+
+    """
+    from numpy import eye
+    return eye(n, dtype=dtype)
+
+
+def _allclose_dispatcher(a, b, rtol=None, atol=None, equal_nan=None):
+    return (a, b)
+
+
+@array_function_dispatch(_allclose_dispatcher)
+def allclose(a, b, rtol=1.e-5, atol=1.e-8, equal_nan=False):
+    """
+    Returns True if two arrays are element-wise equal within a tolerance.
+
+    The tolerance values are positive, typically very small numbers.  The
+    relative difference (`rtol` * abs(`b`)) and the absolute difference
+    `atol` are added together to compare against the absolute difference
+    between `a` and `b`.
+
+    NaNs are treated as equal if they are in the same place and if
+    ``equal_nan=True``.  Infs are treated as equal if they are in the same
+    place and of the same sign in both arrays.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Input arrays to compare.
+    rtol : float
+        The relative tolerance parameter (see Notes).
+    atol : float
+        The absolute tolerance parameter (see Notes).
+    equal_nan : bool
+        Whether to compare NaN's as equal.  If True, NaN's in `a` will be
+        considered equal to NaN's in `b` in the output array.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    allclose : bool
+        Returns True if the two arrays are equal within the given
+        tolerance; False otherwise.
+
+    See Also
+    --------
+    isclose, all, any, equal
+
+    Notes
+    -----
+    If the following equation is element-wise True, then allclose returns
+    True.
+
+     absolute(`a` - `b`) <= (`atol` + `rtol` * absolute(`b`))
+
+    The above equation is not symmetric in `a` and `b`, so that
+    ``allclose(a, b)`` might be different from ``allclose(b, a)`` in
+    some rare cases.
+
+    The comparison of `a` and `b` uses standard broadcasting, which
+    means that `a` and `b` need not have the same shape in order for
+    ``allclose(a, b)`` to evaluate to True.  The same is true for
+    `equal` but not `array_equal`.
+
+    Examples
+    --------
+    >>> np.allclose([1e10,1e-7], [1.00001e10,1e-8])
+    False
+    >>> np.allclose([1e10,1e-8], [1.00001e10,1e-9])
+    True
+    >>> np.allclose([1e10,1e-8], [1.0001e10,1e-9])
+    False
+    >>> np.allclose([1.0, np.nan], [1.0, np.nan])
+    False
+    >>> np.allclose([1.0, np.nan], [1.0, np.nan], equal_nan=True)
+    True
+
+    """
+    res = all(isclose(a, b, rtol=rtol, atol=atol, equal_nan=equal_nan))
+    return bool(res)
+
+
+def _isclose_dispatcher(a, b, rtol=None, atol=None, equal_nan=None):
+    return (a, b)
+
+
+@array_function_dispatch(_isclose_dispatcher)
+def isclose(a, b, rtol=1.e-5, atol=1.e-8, equal_nan=False):
+    """
+    Returns a boolean array where two arrays are element-wise equal within a
+    tolerance.
+
+    The tolerance values are positive, typically very small numbers.  The
+    relative difference (`rtol` * abs(`b`)) and the absolute difference
+    `atol` are added together to compare against the absolute difference
+    between `a` and `b`.
+
+    .. warning:: The default `atol` is not appropriate for comparing numbers
+                 that are much smaller than one (see Notes).
+
+    Parameters
+    ----------
+    a, b : array_like
+        Input arrays to compare.
+    rtol : float
+        The relative tolerance parameter (see Notes).
+    atol : float
+        The absolute tolerance parameter (see Notes).
+    equal_nan : bool
+        Whether to compare NaN's as equal.  If True, NaN's in `a` will be
+        considered equal to NaN's in `b` in the output array.
+
+    Returns
+    -------
+    y : array_like
+        Returns a boolean array of where `a` and `b` are equal within the
+        given tolerance. If both `a` and `b` are scalars, returns a single
+        boolean value.
+
+    See Also
+    --------
+    allclose
+
+    Notes
+    -----
+    .. versionadded:: 1.7.0
+
+    For finite values, isclose uses the following equation to test whether
+    two floating point values are equivalent.
+
+     absolute(`a` - `b`) <= (`atol` + `rtol` * absolute(`b`))
+
+    Unlike the built-in `math.isclose`, the above equation is not symmetric
+    in `a` and `b` -- it assumes `b` is the reference value -- so that
+    `isclose(a, b)` might be different from `isclose(b, a)`. Furthermore,
+    the default value of atol is not zero, and is used to determine what
+    small values should be considered close to zero. The default value is
+    appropriate for expected values of order unity: if the expected values
+    are significantly smaller than one, it can result in false positives.
+    `atol` should be carefully selected for the use case at hand. A zero value
+    for `atol` will result in `False` if either `a` or `b` is zero.
+
+    Examples
+    --------
+    >>> np.isclose([1e10,1e-7], [1.00001e10,1e-8])
+    array([ True, False])
+    >>> np.isclose([1e10,1e-8], [1.00001e10,1e-9])
+    array([ True, True])
+    >>> np.isclose([1e10,1e-8], [1.0001e10,1e-9])
+    array([False,  True])
+    >>> np.isclose([1.0, np.nan], [1.0, np.nan])
+    array([ True, False])
+    >>> np.isclose([1.0, np.nan], [1.0, np.nan], equal_nan=True)
+    array([ True, True])
+    >>> np.isclose([1e-8, 1e-7], [0.0, 0.0])
+    array([ True, False])
+    >>> np.isclose([1e-100, 1e-7], [0.0, 0.0], atol=0.0)
+    array([False, False])
+    >>> np.isclose([1e-10, 1e-10], [1e-20, 0.0])
+    array([ True,  True])
+    >>> np.isclose([1e-10, 1e-10], [1e-20, 0.999999e-10], atol=0.0)
+    array([False,  True])
+    """
+    def within_tol(x, y, atol, rtol):
+        with errstate(invalid='ignore'):
+            return less_equal(abs(x-y), atol + rtol * abs(y))
+
+    x = asanyarray(a)
+    y = asanyarray(b)
+
+    # Make sure y is an inexact type to avoid bad behavior on abs(MIN_INT).
+    # This will cause casting of x later. Also, make sure to allow subclasses
+    # (e.g., for numpy.ma).
+    dt = multiarray.result_type(y, 1.)
+    y = array(y, dtype=dt, copy=False, subok=True)
+
+    xfin = isfinite(x)
+    yfin = isfinite(y)
+    if all(xfin) and all(yfin):
+        return within_tol(x, y, atol, rtol)
+    else:
+        finite = xfin & yfin
+        cond = zeros_like(finite, subok=True)
+        # Because we're using boolean indexing, x & y must be the same shape.
+        # Ideally, we'd just do x, y = broadcast_arrays(x, y). It's in
+        # lib.stride_tricks, though, so we can't import it here.
+        x = x * ones_like(cond)
+        y = y * ones_like(cond)
+        # Avoid subtraction with infinite/nan values...
+        cond[finite] = within_tol(x[finite], y[finite], atol, rtol)
+        # Check for equality of infinite values...
+        cond[~finite] = (x[~finite] == y[~finite])
+        if equal_nan:
+            # Make NaN == NaN
+            both_nan = isnan(x) & isnan(y)
+
+            # Needed to treat masked arrays correctly. = True would not work.
+            cond[both_nan] = both_nan[both_nan]
+
+        return cond[()]  # Flatten 0d arrays to scalars
+
+
+def _array_equal_dispatcher(a1, a2, equal_nan=None):
+    return (a1, a2)
+
+
+@array_function_dispatch(_array_equal_dispatcher)
+def array_equal(a1, a2, equal_nan=False):
+    """
+    True if two arrays have the same shape and elements, False otherwise.
+
+    Parameters
+    ----------
+    a1, a2 : array_like
+        Input arrays.
+    equal_nan : bool
+        Whether to compare NaN's as equal. If the dtype of a1 and a2 is
+        complex, values will be considered equal if either the real or the
+        imaginary component of a given value is ``nan``.
+
+        .. versionadded:: 1.19.0
+
+    Returns
+    -------
+    b : bool
+        Returns True if the arrays are equal.
+
+    See Also
+    --------
+    allclose: Returns True if two arrays are element-wise equal within a
+              tolerance.
+    array_equiv: Returns True if input arrays are shape consistent and all
+                 elements equal.
+
+    Examples
+    --------
+    >>> np.array_equal([1, 2], [1, 2])
+    True
+    >>> np.array_equal(np.array([1, 2]), np.array([1, 2]))
+    True
+    >>> np.array_equal([1, 2], [1, 2, 3])
+    False
+    >>> np.array_equal([1, 2], [1, 4])
+    False
+    >>> a = np.array([1, np.nan])
+    >>> np.array_equal(a, a)
+    False
+    >>> np.array_equal(a, a, equal_nan=True)
+    True
+
+    When ``equal_nan`` is True, complex values with nan components are
+    considered equal if either the real *or* the imaginary components are nan.
+
+    >>> a = np.array([1 + 1j])
+    >>> b = a.copy()
+    >>> a.real = np.nan
+    >>> b.imag = np.nan
+    >>> np.array_equal(a, b, equal_nan=True)
+    True
+    """
+    try:
+        a1, a2 = asarray(a1), asarray(a2)
+    except Exception:
+        return False
+    if a1.shape != a2.shape:
+        return False
+    if not equal_nan:
+        return bool(asarray(a1 == a2).all())
+    # Handling NaN values if equal_nan is True
+    a1nan, a2nan = isnan(a1), isnan(a2)
+    # NaN's occur at different locations
+    if not (a1nan == a2nan).all():
+        return False
+    # Shapes of a1, a2 and masks are guaranteed to be consistent by this point
+    return bool(asarray(a1[~a1nan] == a2[~a1nan]).all())
+
+
+def _array_equiv_dispatcher(a1, a2):
+    return (a1, a2)
+
+
+@array_function_dispatch(_array_equiv_dispatcher)
+def array_equiv(a1, a2):
+    """
+    Returns True if input arrays are shape consistent and all elements equal.
+
+    Shape consistent means they are either the same shape, or one input array
+    can be broadcasted to create the same shape as the other one.
+
+    Parameters
+    ----------
+    a1, a2 : array_like
+        Input arrays.
+
+    Returns
+    -------
+    out : bool
+        True if equivalent, False otherwise.
+
+    Examples
+    --------
+    >>> np.array_equiv([1, 2], [1, 2])
+    True
+    >>> np.array_equiv([1, 2], [1, 3])
+    False
+
+    Showing the shape equivalence:
+
+    >>> np.array_equiv([1, 2], [[1, 2], [1, 2]])
+    True
+    >>> np.array_equiv([1, 2], [[1, 2, 1, 2], [1, 2, 1, 2]])
+    False
+
+    >>> np.array_equiv([1, 2], [[1, 2], [1, 3]])
+    False
+
+    """
+    try:
+        a1, a2 = asarray(a1), asarray(a2)
+    except Exception:
+        return False
+    try:
+        multiarray.broadcast(a1, a2)
+    except Exception:
+        return False
+
+    return bool(asarray(a1 == a2).all())
+
+
+Inf = inf = infty = Infinity = PINF
+nan = NaN = NAN
+False_ = bool_(False)
+True_ = bool_(True)
+
+
+def extend_all(module):
+    existing = set(__all__)
+    mall = getattr(module, '__all__')
+    for a in mall:
+        if a not in existing:
+            __all__.append(a)
+
+
+from .umath import *
+from .numerictypes import *
+from . import fromnumeric
+from .fromnumeric import *
+from . import arrayprint
+from .arrayprint import *
+from . import _asarray
+from ._asarray import *
+from . import _ufunc_config
+from ._ufunc_config import *
+extend_all(fromnumeric)
+extend_all(umath)
+extend_all(numerictypes)
+extend_all(arrayprint)
+extend_all(_asarray)
+extend_all(_ufunc_config)
diff --git a/venv/Lib/site-packages/numpy/core/numerictypes.py b/venv/Lib/site-packages/numpy/core/numerictypes.py
new file mode 100644
index 000000000..aac741612
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/numerictypes.py
@@ -0,0 +1,642 @@
+"""
+numerictypes: Define the numeric type objects
+
+This module is designed so "from numerictypes import \\*" is safe.
+Exported symbols include:
+
+  Dictionary with all registered number types (including aliases):
+    typeDict
+
+  Type objects (not all will be available, depends on platform):
+      see variable sctypes for which ones you have
+
+    Bit-width names
+
+    int8 int16 int32 int64 int128
+    uint8 uint16 uint32 uint64 uint128
+    float16 float32 float64 float96 float128 float256
+    complex32 complex64 complex128 complex192 complex256 complex512
+    datetime64 timedelta64
+
+    c-based names
+
+    bool_
+
+    object_
+
+    void, str_, unicode_
+
+    byte, ubyte,
+    short, ushort
+    intc, uintc,
+    intp, uintp,
+    int_, uint,
+    longlong, ulonglong,
+
+    single, csingle,
+    float_, complex_,
+    longfloat, clongfloat,
+
+   As part of the type-hierarchy:    xx -- is bit-width
+
+   generic
+     +-> bool_                                  (kind=b)
+     +-> number
+     |   +-> integer
+     |   |   +-> signedinteger     (intxx)      (kind=i)
+     |   |   |     byte
+     |   |   |     short
+     |   |   |     intc
+     |   |   |     intp            int0
+     |   |   |     int_
+     |   |   |     longlong
+     |   |   \\-> unsignedinteger  (uintxx)     (kind=u)
+     |   |         ubyte
+     |   |         ushort
+     |   |         uintc
+     |   |         uintp           uint0
+     |   |         uint_
+     |   |         ulonglong
+     |   +-> inexact
+     |       +-> floating          (floatxx)    (kind=f)
+     |       |     half
+     |       |     single
+     |       |     float_          (double)
+     |       |     longfloat
+     |       \\-> complexfloating  (complexxx)  (kind=c)
+     |             csingle         (singlecomplex)
+     |             complex_        (cfloat, cdouble)
+     |             clongfloat      (longcomplex)
+     +-> flexible
+     |   +-> character
+     |   |     str_     (string_, bytes_)       (kind=S)    [Python 2]
+     |   |     unicode_                         (kind=U)    [Python 2]
+     |   |
+     |   |     bytes_   (string_)               (kind=S)    [Python 3]
+     |   |     str_     (unicode_)              (kind=U)    [Python 3]
+     |   |
+     |   \\-> void                              (kind=V)
+     \\-> object_ (not used much)               (kind=O)
+
+"""
+import types as _types
+import numbers
+import warnings
+
+from numpy.core.multiarray import (
+        typeinfo, ndarray, array, empty, dtype, datetime_data,
+        datetime_as_string, busday_offset, busday_count, is_busday,
+        busdaycalendar
+        )
+from numpy.core.overrides import set_module
+
+# we add more at the bottom
+__all__ = ['sctypeDict', 'sctypeNA', 'typeDict', 'typeNA', 'sctypes',
+           'ScalarType', 'obj2sctype', 'cast', 'nbytes', 'sctype2char',
+           'maximum_sctype', 'issctype', 'typecodes', 'find_common_type',
+           'issubdtype', 'datetime_data', 'datetime_as_string',
+           'busday_offset', 'busday_count', 'is_busday', 'busdaycalendar',
+           ]
+
+# we don't need all these imports, but we need to keep them for compatibility
+# for users using np.core.numerictypes.UPPER_TABLE
+from ._string_helpers import (
+    english_lower, english_upper, english_capitalize, LOWER_TABLE, UPPER_TABLE
+)
+
+from ._type_aliases import (
+    sctypeDict,
+    sctypeNA,
+    allTypes,
+    bitname,
+    sctypes,
+    _concrete_types,
+    _concrete_typeinfo,
+    _bits_of,
+)
+from ._dtype import _kind_name
+
+# we don't export these for import *, but we do want them accessible
+# as numerictypes.bool, etc.
+from builtins import bool, int, float, complex, object, str, bytes
+from numpy.compat import long, unicode
+
+
+# We use this later
+generic = allTypes['generic']
+
+genericTypeRank = ['bool', 'int8', 'uint8', 'int16', 'uint16',
+                   'int32', 'uint32', 'int64', 'uint64', 'int128',
+                   'uint128', 'float16',
+                   'float32', 'float64', 'float80', 'float96', 'float128',
+                   'float256',
+                   'complex32', 'complex64', 'complex128', 'complex160',
+                   'complex192', 'complex256', 'complex512', 'object']
+
+@set_module('numpy')
+def maximum_sctype(t):
+    """
+    Return the scalar type of highest precision of the same kind as the input.
+
+    Parameters
+    ----------
+    t : dtype or dtype specifier
+        The input data type. This can be a `dtype` object or an object that
+        is convertible to a `dtype`.
+
+    Returns
+    -------
+    out : dtype
+        The highest precision data type of the same kind (`dtype.kind`) as `t`.
+
+    See Also
+    --------
+    obj2sctype, mintypecode, sctype2char
+    dtype
+
+    Examples
+    --------
+    >>> np.maximum_sctype(int)
+    <class 'numpy.int64'>
+    >>> np.maximum_sctype(np.uint8)
+    <class 'numpy.uint64'>
+    >>> np.maximum_sctype(complex)
+    <class 'numpy.complex256'> # may vary
+
+    >>> np.maximum_sctype(str)
+    <class 'numpy.str_'>
+
+    >>> np.maximum_sctype('i2')
+    <class 'numpy.int64'>
+    >>> np.maximum_sctype('f4')
+    <class 'numpy.float128'> # may vary
+
+    """
+    g = obj2sctype(t)
+    if g is None:
+        return t
+    t = g
+    base = _kind_name(dtype(t))
+    if base in sctypes:
+        return sctypes[base][-1]
+    else:
+        return t
+
+
+@set_module('numpy')
+def issctype(rep):
+    """
+    Determines whether the given object represents a scalar data-type.
+
+    Parameters
+    ----------
+    rep : any
+        If `rep` is an instance of a scalar dtype, True is returned. If not,
+        False is returned.
+
+    Returns
+    -------
+    out : bool
+        Boolean result of check whether `rep` is a scalar dtype.
+
+    See Also
+    --------
+    issubsctype, issubdtype, obj2sctype, sctype2char
+
+    Examples
+    --------
+    >>> np.issctype(np.int32)
+    True
+    >>> np.issctype(list)
+    False
+    >>> np.issctype(1.1)
+    False
+
+    Strings are also a scalar type:
+
+    >>> np.issctype(np.dtype('str'))
+    True
+
+    """
+    if not isinstance(rep, (type, dtype)):
+        return False
+    try:
+        res = obj2sctype(rep)
+        if res and res != object_:
+            return True
+        return False
+    except Exception:
+        return False
+
+
+@set_module('numpy')
+def obj2sctype(rep, default=None):
+    """
+    Return the scalar dtype or NumPy equivalent of Python type of an object.
+
+    Parameters
+    ----------
+    rep : any
+        The object of which the type is returned.
+    default : any, optional
+        If given, this is returned for objects whose types can not be
+        determined. If not given, None is returned for those objects.
+
+    Returns
+    -------
+    dtype : dtype or Python type
+        The data type of `rep`.
+
+    See Also
+    --------
+    sctype2char, issctype, issubsctype, issubdtype, maximum_sctype
+
+    Examples
+    --------
+    >>> np.obj2sctype(np.int32)
+    <class 'numpy.int32'>
+    >>> np.obj2sctype(np.array([1., 2.]))
+    <class 'numpy.float64'>
+    >>> np.obj2sctype(np.array([1.j]))
+    <class 'numpy.complex128'>
+
+    >>> np.obj2sctype(dict)
+    <class 'numpy.object_'>
+    >>> np.obj2sctype('string')
+
+    >>> np.obj2sctype(1, default=list)
+    <class 'list'>
+
+    """
+    # prevent abstract classes being upcast
+    if isinstance(rep, type) and issubclass(rep, generic):
+        return rep
+    # extract dtype from arrays
+    if isinstance(rep, ndarray):
+        return rep.dtype.type
+    # fall back on dtype to convert
+    try:
+        res = dtype(rep)
+    except Exception:
+        return default
+    else:
+        return res.type
+
+
+@set_module('numpy')
+def issubclass_(arg1, arg2):
+    """
+    Determine if a class is a subclass of a second class.
+
+    `issubclass_` is equivalent to the Python built-in ``issubclass``,
+    except that it returns False instead of raising a TypeError if one
+    of the arguments is not a class.
+
+    Parameters
+    ----------
+    arg1 : class
+        Input class. True is returned if `arg1` is a subclass of `arg2`.
+    arg2 : class or tuple of classes.
+        Input class. If a tuple of classes, True is returned if `arg1` is a
+        subclass of any of the tuple elements.
+
+    Returns
+    -------
+    out : bool
+        Whether `arg1` is a subclass of `arg2` or not.
+
+    See Also
+    --------
+    issubsctype, issubdtype, issctype
+
+    Examples
+    --------
+    >>> np.issubclass_(np.int32, int)
+    False
+    >>> np.issubclass_(np.int32, float)
+    False
+    >>> np.issubclass_(np.float64, float)
+    True
+
+    """
+    try:
+        return issubclass(arg1, arg2)
+    except TypeError:
+        return False
+
+
+@set_module('numpy')
+def issubsctype(arg1, arg2):
+    """
+    Determine if the first argument is a subclass of the second argument.
+
+    Parameters
+    ----------
+    arg1, arg2 : dtype or dtype specifier
+        Data-types.
+
+    Returns
+    -------
+    out : bool
+        The result.
+
+    See Also
+    --------
+    issctype, issubdtype, obj2sctype
+
+    Examples
+    --------
+    >>> np.issubsctype('S8', str)
+    False
+    >>> np.issubsctype(np.array([1]), int)
+    True
+    >>> np.issubsctype(np.array([1]), float)
+    False
+
+    """
+    return issubclass(obj2sctype(arg1), obj2sctype(arg2))
+
+
+@set_module('numpy')
+def issubdtype(arg1, arg2):
+    """
+    Returns True if first argument is a typecode lower/equal in type hierarchy.
+
+    Parameters
+    ----------
+    arg1, arg2 : dtype_like
+        dtype or string representing a typecode.
+
+    Returns
+    -------
+    out : bool
+
+    See Also
+    --------
+    issubsctype, issubclass_
+    numpy.core.numerictypes : Overview of numpy type hierarchy.
+
+    Examples
+    --------
+    >>> np.issubdtype('S1', np.string_)
+    True
+    >>> np.issubdtype(np.float64, np.float32)
+    False
+
+    """
+    if not issubclass_(arg1, generic):
+        arg1 = dtype(arg1).type
+    if not issubclass_(arg2, generic):
+        arg2 = dtype(arg2).type
+
+    return issubclass(arg1, arg2)
+
+
+# This dictionary allows look up based on any alias for an array data-type
+class _typedict(dict):
+    """
+    Base object for a dictionary for look-up with any alias for an array dtype.
+
+    Instances of `_typedict` can not be used as dictionaries directly,
+    first they have to be populated.
+
+    """
+
+    def __getitem__(self, obj):
+        return dict.__getitem__(self, obj2sctype(obj))
+
+nbytes = _typedict()
+_alignment = _typedict()
+_maxvals = _typedict()
+_minvals = _typedict()
+def _construct_lookups():
+    for name, info in _concrete_typeinfo.items():
+        obj = info.type
+        nbytes[obj] = info.bits // 8
+        _alignment[obj] = info.alignment
+        if len(info) > 5:
+            _maxvals[obj] = info.max
+            _minvals[obj] = info.min
+        else:
+            _maxvals[obj] = None
+            _minvals[obj] = None
+
+_construct_lookups()
+
+
+@set_module('numpy')
+def sctype2char(sctype):
+    """
+    Return the string representation of a scalar dtype.
+
+    Parameters
+    ----------
+    sctype : scalar dtype or object
+        If a scalar dtype, the corresponding string character is
+        returned. If an object, `sctype2char` tries to infer its scalar type
+        and then return the corresponding string character.
+
+    Returns
+    -------
+    typechar : str
+        The string character corresponding to the scalar type.
+
+    Raises
+    ------
+    ValueError
+        If `sctype` is an object for which the type can not be inferred.
+
+    See Also
+    --------
+    obj2sctype, issctype, issubsctype, mintypecode
+
+    Examples
+    --------
+    >>> for sctype in [np.int32, np.double, np.complex_, np.string_, np.ndarray]:
+    ...     print(np.sctype2char(sctype))
+    l # may vary
+    d
+    D
+    S
+    O
+
+    >>> x = np.array([1., 2-1.j])
+    >>> np.sctype2char(x)
+    'D'
+    >>> np.sctype2char(list)
+    'O'
+
+    """
+    sctype = obj2sctype(sctype)
+    if sctype is None:
+        raise ValueError("unrecognized type")
+    if sctype not in _concrete_types:
+        # for compatibility
+        raise KeyError(sctype)
+    return dtype(sctype).char
+
+# Create dictionary of casting functions that wrap sequences
+# indexed by type or type character
+cast = _typedict()
+for key in _concrete_types:
+    cast[key] = lambda x, k=key: array(x, copy=False).astype(k)
+
+try:
+    ScalarType = [_types.IntType, _types.FloatType, _types.ComplexType,
+                  _types.LongType, _types.BooleanType,
+                   _types.StringType, _types.UnicodeType, _types.BufferType]
+except AttributeError:
+    # Py3K
+    ScalarType = [int, float, complex, int, bool, bytes, str, memoryview]
+
+ScalarType.extend(_concrete_types)
+ScalarType = tuple(ScalarType)
+
+
+# Now add the types we've determined to this module
+for key in allTypes:
+    globals()[key] = allTypes[key]
+    __all__.append(key)
+
+del key
+
+typecodes = {'Character':'c',
+             'Integer':'bhilqp',
+             'UnsignedInteger':'BHILQP',
+             'Float':'efdg',
+             'Complex':'FDG',
+             'AllInteger':'bBhHiIlLqQpP',
+             'AllFloat':'efdgFDG',
+             'Datetime': 'Mm',
+             'All':'?bhilqpBHILQPefdgFDGSUVOMm'}
+
+# backwards compatibility --- deprecated name
+typeDict = sctypeDict
+typeNA = sctypeNA
+
+# b -> boolean
+# u -> unsigned integer
+# i -> signed integer
+# f -> floating point
+# c -> complex
+# M -> datetime
+# m -> timedelta
+# S -> string
+# U -> Unicode string
+# V -> record
+# O -> Python object
+_kind_list = ['b', 'u', 'i', 'f', 'c', 'S', 'U', 'V', 'O', 'M', 'm']
+
+__test_types = '?'+typecodes['AllInteger'][:-2]+typecodes['AllFloat']+'O'
+__len_test_types = len(__test_types)
+
+# Keep incrementing until a common type both can be coerced to
+#  is found.  Otherwise, return None
+def _find_common_coerce(a, b):
+    if a > b:
+        return a
+    try:
+        thisind = __test_types.index(a.char)
+    except ValueError:
+        return None
+    return _can_coerce_all([a, b], start=thisind)
+
+# Find a data-type that all data-types in a list can be coerced to
+def _can_coerce_all(dtypelist, start=0):
+    N = len(dtypelist)
+    if N == 0:
+        return None
+    if N == 1:
+        return dtypelist[0]
+    thisind = start
+    while thisind < __len_test_types:
+        newdtype = dtype(__test_types[thisind])
+        numcoerce = len([x for x in dtypelist if newdtype >= x])
+        if numcoerce == N:
+            return newdtype
+        thisind += 1
+    return None
+
+def _register_types():
+    numbers.Integral.register(integer)
+    numbers.Complex.register(inexact)
+    numbers.Real.register(floating)
+    numbers.Number.register(number)
+
+_register_types()
+
+
+@set_module('numpy')
+def find_common_type(array_types, scalar_types):
+    """
+    Determine common type following standard coercion rules.
+
+    Parameters
+    ----------
+    array_types : sequence
+        A list of dtypes or dtype convertible objects representing arrays.
+    scalar_types : sequence
+        A list of dtypes or dtype convertible objects representing scalars.
+
+    Returns
+    -------
+    datatype : dtype
+        The common data type, which is the maximum of `array_types` ignoring
+        `scalar_types`, unless the maximum of `scalar_types` is of a
+        different kind (`dtype.kind`). If the kind is not understood, then
+        None is returned.
+
+    See Also
+    --------
+    dtype, common_type, can_cast, mintypecode
+
+    Examples
+    --------
+    >>> np.find_common_type([], [np.int64, np.float32, complex])
+    dtype('complex128')
+    >>> np.find_common_type([np.int64, np.float32], [])
+    dtype('float64')
+
+    The standard casting rules ensure that a scalar cannot up-cast an
+    array unless the scalar is of a fundamentally different kind of data
+    (i.e. under a different hierarchy in the data type hierarchy) then
+    the array:
+
+    >>> np.find_common_type([np.float32], [np.int64, np.float64])
+    dtype('float32')
+
+    Complex is of a different type, so it up-casts the float in the
+    `array_types` argument:
+
+    >>> np.find_common_type([np.float32], [complex])
+    dtype('complex128')
+
+    Type specifier strings are convertible to dtypes and can therefore
+    be used instead of dtypes:
+
+    >>> np.find_common_type(['f4', 'f4', 'i4'], ['c8'])
+    dtype('complex128')
+
+    """
+    array_types = [dtype(x) for x in array_types]
+    scalar_types = [dtype(x) for x in scalar_types]
+
+    maxa = _can_coerce_all(array_types)
+    maxsc = _can_coerce_all(scalar_types)
+
+    if maxa is None:
+        return maxsc
+
+    if maxsc is None:
+        return maxa
+
+    try:
+        index_a = _kind_list.index(maxa.kind)
+        index_sc = _kind_list.index(maxsc.kind)
+    except ValueError:
+        return None
+
+    if index_sc > index_a:
+        return _find_common_coerce(maxsc, maxa)
+    else:
+        return maxa
diff --git a/venv/Lib/site-packages/numpy/core/overrides.py b/venv/Lib/site-packages/numpy/core/overrides.py
new file mode 100644
index 000000000..55c7bd1ea
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/overrides.py
@@ -0,0 +1,210 @@
+"""Implementation of __array_function__ overrides from NEP-18."""
+import collections
+import functools
+import os
+import textwrap
+
+from numpy.core._multiarray_umath import (
+    add_docstring, implement_array_function, _get_implementing_args)
+from numpy.compat._inspect import getargspec
+
+
+ARRAY_FUNCTION_ENABLED = bool(
+    int(os.environ.get('NUMPY_EXPERIMENTAL_ARRAY_FUNCTION', 1)))
+
+
+add_docstring(
+    implement_array_function,
+    """
+    Implement a function with checks for __array_function__ overrides.
+
+    All arguments are required, and can only be passed by position.
+
+    Arguments
+    ---------
+    implementation : function
+        Function that implements the operation on NumPy array without
+        overrides when called like ``implementation(*args, **kwargs)``.
+    public_api : function
+        Function exposed by NumPy's public API originally called like
+        ``public_api(*args, **kwargs)`` on which arguments are now being
+        checked.
+    relevant_args : iterable
+        Iterable of arguments to check for __array_function__ methods.
+    args : tuple
+        Arbitrary positional arguments originally passed into ``public_api``.
+    kwargs : dict
+        Arbitrary keyword arguments originally passed into ``public_api``.
+
+    Returns
+    -------
+    Result from calling ``implementation()`` or an ``__array_function__``
+    method, as appropriate.
+
+    Raises
+    ------
+    TypeError : if no implementation is found.
+    """)
+
+
+# exposed for testing purposes; used internally by implement_array_function
+add_docstring(
+    _get_implementing_args,
+    """
+    Collect arguments on which to call __array_function__.
+
+    Parameters
+    ----------
+    relevant_args : iterable of array-like
+        Iterable of possibly array-like arguments to check for
+        __array_function__ methods.
+
+    Returns
+    -------
+    Sequence of arguments with __array_function__ methods, in the order in
+    which they should be called.
+    """)
+
+
+ArgSpec = collections.namedtuple('ArgSpec', 'args varargs keywords defaults')
+
+
+def verify_matching_signatures(implementation, dispatcher):
+    """Verify that a dispatcher function has the right signature."""
+    implementation_spec = ArgSpec(*getargspec(implementation))
+    dispatcher_spec = ArgSpec(*getargspec(dispatcher))
+
+    if (implementation_spec.args != dispatcher_spec.args or
+            implementation_spec.varargs != dispatcher_spec.varargs or
+            implementation_spec.keywords != dispatcher_spec.keywords or
+            (bool(implementation_spec.defaults) !=
+             bool(dispatcher_spec.defaults)) or
+            (implementation_spec.defaults is not None and
+             len(implementation_spec.defaults) !=
+             len(dispatcher_spec.defaults))):
+        raise RuntimeError('implementation and dispatcher for %s have '
+                           'different function signatures' % implementation)
+
+    if implementation_spec.defaults is not None:
+        if dispatcher_spec.defaults != (None,) * len(dispatcher_spec.defaults):
+            raise RuntimeError('dispatcher functions can only use None for '
+                               'default argument values')
+
+
+def set_module(module):
+    """Decorator for overriding __module__ on a function or class.
+
+    Example usage::
+
+        @set_module('numpy')
+        def example():
+            pass
+
+        assert example.__module__ == 'numpy'
+    """
+    def decorator(func):
+        if module is not None:
+            func.__module__ = module
+        return func
+    return decorator
+
+
+
+# Call textwrap.dedent here instead of in the function so as to avoid
+# calling dedent multiple times on the same text
+_wrapped_func_source = textwrap.dedent("""
+    @functools.wraps(implementation)
+    def {name}(*args, **kwargs):
+        relevant_args = dispatcher(*args, **kwargs)
+        return implement_array_function(
+            implementation, {name}, relevant_args, args, kwargs)
+    """)
+
+
+def array_function_dispatch(dispatcher, module=None, verify=True,
+                            docs_from_dispatcher=False):
+    """Decorator for adding dispatch with the __array_function__ protocol.
+
+    See NEP-18 for example usage.
+
+    Parameters
+    ----------
+    dispatcher : callable
+        Function that when called like ``dispatcher(*args, **kwargs)`` with
+        arguments from the NumPy function call returns an iterable of
+        array-like arguments to check for ``__array_function__``.
+    module : str, optional
+        __module__ attribute to set on new function, e.g., ``module='numpy'``.
+        By default, module is copied from the decorated function.
+    verify : bool, optional
+        If True, verify the that the signature of the dispatcher and decorated
+        function signatures match exactly: all required and optional arguments
+        should appear in order with the same names, but the default values for
+        all optional arguments should be ``None``. Only disable verification
+        if the dispatcher's signature needs to deviate for some particular
+        reason, e.g., because the function has a signature like
+        ``func(*args, **kwargs)``.
+    docs_from_dispatcher : bool, optional
+        If True, copy docs from the dispatcher function onto the dispatched
+        function, rather than from the implementation. This is useful for
+        functions defined in C, which otherwise don't have docstrings.
+
+    Returns
+    -------
+    Function suitable for decorating the implementation of a NumPy function.
+    """
+
+    if not ARRAY_FUNCTION_ENABLED:
+        def decorator(implementation):
+            if docs_from_dispatcher:
+                add_docstring(implementation, dispatcher.__doc__)
+            if module is not None:
+                implementation.__module__ = module
+            return implementation
+        return decorator
+
+    def decorator(implementation):
+        if verify:
+            verify_matching_signatures(implementation, dispatcher)
+
+        if docs_from_dispatcher:
+            add_docstring(implementation, dispatcher.__doc__)
+
+        # Equivalently, we could define this function directly instead of using
+        # exec. This version has the advantage of giving the helper function a
+        # more interpettable name. Otherwise, the original function does not
+        # show up at all in many cases, e.g., if it's written in C or if the
+        # dispatcher gets an invalid keyword argument.
+        source = _wrapped_func_source.format(name=implementation.__name__)
+
+        source_object = compile(
+            source, filename='<__array_function__ internals>', mode='exec')
+        scope = {
+            'implementation': implementation,
+            'dispatcher': dispatcher,
+            'functools': functools,
+            'implement_array_function': implement_array_function,
+        }
+        exec(source_object, scope)
+
+        public_api = scope[implementation.__name__]
+
+        if module is not None:
+            public_api.__module__ = module
+
+        public_api._implementation = implementation
+
+        return public_api
+
+    return decorator
+
+
+def array_function_from_dispatcher(
+        implementation, module=None, verify=True, docs_from_dispatcher=True):
+    """Like array_function_dispatcher, but with function arguments flipped."""
+
+    def decorator(dispatcher):
+        return array_function_dispatch(
+            dispatcher, module, verify=verify,
+            docs_from_dispatcher=docs_from_dispatcher)(implementation)
+    return decorator
diff --git a/venv/Lib/site-packages/numpy/core/records.py b/venv/Lib/site-packages/numpy/core/records.py
new file mode 100644
index 000000000..7e1c0d591
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/records.py
@@ -0,0 +1,1019 @@
+"""
+Record Arrays
+=============
+Record arrays expose the fields of structured arrays as properties.
+
+Most commonly, ndarrays contain elements of a single type, e.g. floats,
+integers, bools etc.  However, it is possible for elements to be combinations
+of these using structured types, such as::
+
+  >>> a = np.array([(1, 2.0), (1, 2.0)], dtype=[('x', np.int64), ('y', np.float64)])
+  >>> a
+  array([(1, 2.), (1, 2.)], dtype=[('x', '<i8'), ('y', '<f8')])
+
+Here, each element consists of two fields: x (and int), and y (a float).
+This is known as a structured array.  The different fields are analogous
+to columns in a spread-sheet.  The different fields can be accessed as
+one would a dictionary::
+
+  >>> a['x']
+  array([1, 1])
+
+  >>> a['y']
+  array([2., 2.])
+
+Record arrays allow us to access fields as properties::
+
+  >>> ar = np.rec.array(a)
+
+  >>> ar.x
+  array([1, 1])
+
+  >>> ar.y
+  array([2., 2.])
+
+"""
+import os
+import warnings
+from collections import Counter, OrderedDict
+
+from . import numeric as sb
+from . import numerictypes as nt
+from numpy.compat import (
+    isfileobj, os_fspath, contextlib_nullcontext
+)
+from numpy.core.overrides import set_module
+from .arrayprint import get_printoptions
+
+# All of the functions allow formats to be a dtype
+__all__ = ['record', 'recarray', 'format_parser']
+
+
+ndarray = sb.ndarray
+
+_byteorderconv = {'b':'>',
+                  'l':'<',
+                  'n':'=',
+                  'B':'>',
+                  'L':'<',
+                  'N':'=',
+                  'S':'s',
+                  's':'s',
+                  '>':'>',
+                  '<':'<',
+                  '=':'=',
+                  '|':'|',
+                  'I':'|',
+                  'i':'|'}
+
+# formats regular expression
+# allows multidimension spec with a tuple syntax in front
+# of the letter code '(2,3)f4' and ' (  2 ,  3  )  f4  '
+# are equally allowed
+
+numfmt = nt.typeDict
+
+# taken from OrderedDict recipes in the Python documentation
+# https://docs.python.org/3.3/library/collections.html#ordereddict-examples-and-recipes
+class _OrderedCounter(Counter, OrderedDict):
+    """Counter that remembers the order elements are first encountered"""
+
+    def __repr__(self):
+        return '%s(%r)' % (self.__class__.__name__, OrderedDict(self))
+
+    def __reduce__(self):
+        return self.__class__, (OrderedDict(self),)
+
+
+def find_duplicate(list):
+    """Find duplication in a list, return a list of duplicated elements"""
+    return [
+        item
+        for item, counts in _OrderedCounter(list).items()
+        if counts > 1
+    ]
+
+
+@set_module('numpy')
+class format_parser:
+    """
+    Class to convert formats, names, titles description to a dtype.
+
+    After constructing the format_parser object, the dtype attribute is
+    the converted data-type:
+    ``dtype = format_parser(formats, names, titles).dtype``
+
+    Attributes
+    ----------
+    dtype : dtype
+        The converted data-type.
+
+    Parameters
+    ----------
+    formats : str or list of str
+        The format description, either specified as a string with
+        comma-separated format descriptions in the form ``'f8, i4, a5'``, or
+        a list of format description strings  in the form
+        ``['f8', 'i4', 'a5']``.
+    names : str or list/tuple of str
+        The field names, either specified as a comma-separated string in the
+        form ``'col1, col2, col3'``, or as a list or tuple of strings in the
+        form ``['col1', 'col2', 'col3']``.
+        An empty list can be used, in that case default field names
+        ('f0', 'f1', ...) are used.
+    titles : sequence
+        Sequence of title strings. An empty list can be used to leave titles
+        out.
+    aligned : bool, optional
+        If True, align the fields by padding as the C-compiler would.
+        Default is False.
+    byteorder : str, optional
+        If specified, all the fields will be changed to the
+        provided byte-order.  Otherwise, the default byte-order is
+        used. For all available string specifiers, see `dtype.newbyteorder`.
+
+    See Also
+    --------
+    dtype, typename, sctype2char
+
+    Examples
+    --------
+    >>> np.format_parser(['<f8', '<i4', '<a5'], ['col1', 'col2', 'col3'],
+    ...                  ['T1', 'T2', 'T3']).dtype
+    dtype([(('T1', 'col1'), '<f8'), (('T2', 'col2'), '<i4'), (('T3', 'col3'), 'S5')])
+
+    `names` and/or `titles` can be empty lists. If `titles` is an empty list,
+    titles will simply not appear. If `names` is empty, default field names
+    will be used.
+
+    >>> np.format_parser(['f8', 'i4', 'a5'], ['col1', 'col2', 'col3'],
+    ...                  []).dtype
+    dtype([('col1', '<f8'), ('col2', '<i4'), ('col3', '<S5')])
+    >>> np.format_parser(['<f8', '<i4', '<a5'], [], []).dtype
+    dtype([('f0', '<f8'), ('f1', '<i4'), ('f2', 'S5')])
+
+    """
+
+    def __init__(self, formats, names, titles, aligned=False, byteorder=None):
+        self._parseFormats(formats, aligned)
+        self._setfieldnames(names, titles)
+        self._createdtype(byteorder)
+
+    def _parseFormats(self, formats, aligned=False):
+        """ Parse the field formats """
+
+        if formats is None:
+            raise ValueError("Need formats argument")
+        if isinstance(formats, list):
+            dtype = sb.dtype(
+                [('f{}'.format(i), format_) for i, format_ in enumerate(formats)],
+                aligned,
+            )
+        else:
+            dtype = sb.dtype(formats, aligned)
+        fields = dtype.fields
+        if fields is None:
+            dtype = sb.dtype([('f1', dtype)], aligned)
+            fields = dtype.fields
+        keys = dtype.names
+        self._f_formats = [fields[key][0] for key in keys]
+        self._offsets = [fields[key][1] for key in keys]
+        self._nfields = len(keys)
+
+    def _setfieldnames(self, names, titles):
+        """convert input field names into a list and assign to the _names
+        attribute """
+
+        if names:
+            if type(names) in [list, tuple]:
+                pass
+            elif isinstance(names, str):
+                names = names.split(',')
+            else:
+                raise NameError("illegal input names %s" % repr(names))
+
+            self._names = [n.strip() for n in names[:self._nfields]]
+        else:
+            self._names = []
+
+        # if the names are not specified, they will be assigned as
+        #  "f0, f1, f2,..."
+        # if not enough names are specified, they will be assigned as "f[n],
+        # f[n+1],..." etc. where n is the number of specified names..."
+        self._names += ['f%d' % i for i in range(len(self._names),
+                                                 self._nfields)]
+        # check for redundant names
+        _dup = find_duplicate(self._names)
+        if _dup:
+            raise ValueError("Duplicate field names: %s" % _dup)
+
+        if titles:
+            self._titles = [n.strip() for n in titles[:self._nfields]]
+        else:
+            self._titles = []
+            titles = []
+
+        if self._nfields > len(titles):
+            self._titles += [None] * (self._nfields - len(titles))
+
+    def _createdtype(self, byteorder):
+        dtype = sb.dtype({
+            'names': self._names,
+            'formats': self._f_formats,
+            'offsets': self._offsets,
+            'titles': self._titles,
+        })
+        if byteorder is not None:
+            byteorder = _byteorderconv[byteorder[0]]
+            dtype = dtype.newbyteorder(byteorder)
+
+        self.dtype = dtype
+
+
+class record(nt.void):
+    """A data-type scalar that allows field access as attribute lookup.
+    """
+
+    # manually set name and module so that this class's type shows up
+    # as numpy.record when printed
+    __name__ = 'record'
+    __module__ = 'numpy'
+
+    def __repr__(self):
+        if get_printoptions()['legacy'] == '1.13':
+            return self.__str__()
+        return super(record, self).__repr__()
+
+    def __str__(self):
+        if get_printoptions()['legacy'] == '1.13':
+            return str(self.item())
+        return super(record, self).__str__()
+
+    def __getattribute__(self, attr):
+        if attr in ('setfield', 'getfield', 'dtype'):
+            return nt.void.__getattribute__(self, attr)
+        try:
+            return nt.void.__getattribute__(self, attr)
+        except AttributeError:
+            pass
+        fielddict = nt.void.__getattribute__(self, 'dtype').fields
+        res = fielddict.get(attr, None)
+        if res:
+            obj = self.getfield(*res[:2])
+            # if it has fields return a record,
+            # otherwise return the object
+            try:
+                dt = obj.dtype
+            except AttributeError:
+                #happens if field is Object type
+                return obj
+            if dt.names is not None:
+                return obj.view((self.__class__, obj.dtype))
+            return obj
+        else:
+            raise AttributeError("'record' object has no "
+                    "attribute '%s'" % attr)
+
+    def __setattr__(self, attr, val):
+        if attr in ('setfield', 'getfield', 'dtype'):
+            raise AttributeError("Cannot set '%s' attribute" % attr)
+        fielddict = nt.void.__getattribute__(self, 'dtype').fields
+        res = fielddict.get(attr, None)
+        if res:
+            return self.setfield(val, *res[:2])
+        else:
+            if getattr(self, attr, None):
+                return nt.void.__setattr__(self, attr, val)
+            else:
+                raise AttributeError("'record' object has no "
+                        "attribute '%s'" % attr)
+
+    def __getitem__(self, indx):
+        obj = nt.void.__getitem__(self, indx)
+
+        # copy behavior of record.__getattribute__,
+        if isinstance(obj, nt.void) and obj.dtype.names is not None:
+            return obj.view((self.__class__, obj.dtype))
+        else:
+            # return a single element
+            return obj
+
+    def pprint(self):
+        """Pretty-print all fields."""
+        # pretty-print all fields
+        names = self.dtype.names
+        maxlen = max(len(name) for name in names)
+        fmt = '%% %ds: %%s' % maxlen
+        rows = [fmt % (name, getattr(self, name)) for name in names]
+        return "\n".join(rows)
+
+# The recarray is almost identical to a standard array (which supports
+#   named fields already)  The biggest difference is that it can use
+#   attribute-lookup to find the fields and it is constructed using
+#   a record.
+
+# If byteorder is given it forces a particular byteorder on all
+#  the fields (and any subfields)
+
+class recarray(ndarray):
+    """Construct an ndarray that allows field access using attributes.
+
+    Arrays may have a data-types containing fields, analogous
+    to columns in a spread sheet.  An example is ``[(x, int), (y, float)]``,
+    where each entry in the array is a pair of ``(int, float)``.  Normally,
+    these attributes are accessed using dictionary lookups such as ``arr['x']``
+    and ``arr['y']``.  Record arrays allow the fields to be accessed as members
+    of the array, using ``arr.x`` and ``arr.y``.
+
+    Parameters
+    ----------
+    shape : tuple
+        Shape of output array.
+    dtype : data-type, optional
+        The desired data-type.  By default, the data-type is determined
+        from `formats`, `names`, `titles`, `aligned` and `byteorder`.
+    formats : list of data-types, optional
+        A list containing the data-types for the different columns, e.g.
+        ``['i4', 'f8', 'i4']``.  `formats` does *not* support the new
+        convention of using types directly, i.e. ``(int, float, int)``.
+        Note that `formats` must be a list, not a tuple.
+        Given that `formats` is somewhat limited, we recommend specifying
+        `dtype` instead.
+    names : tuple of str, optional
+        The name of each column, e.g. ``('x', 'y', 'z')``.
+    buf : buffer, optional
+        By default, a new array is created of the given shape and data-type.
+        If `buf` is specified and is an object exposing the buffer interface,
+        the array will use the memory from the existing buffer.  In this case,
+        the `offset` and `strides` keywords are available.
+
+    Other Parameters
+    ----------------
+    titles : tuple of str, optional
+        Aliases for column names.  For example, if `names` were
+        ``('x', 'y', 'z')`` and `titles` is
+        ``('x_coordinate', 'y_coordinate', 'z_coordinate')``, then
+        ``arr['x']`` is equivalent to both ``arr.x`` and ``arr.x_coordinate``.
+    byteorder : {'<', '>', '='}, optional
+        Byte-order for all fields.
+    aligned : bool, optional
+        Align the fields in memory as the C-compiler would.
+    strides : tuple of ints, optional
+        Buffer (`buf`) is interpreted according to these strides (strides
+        define how many bytes each array element, row, column, etc.
+        occupy in memory).
+    offset : int, optional
+        Start reading buffer (`buf`) from this offset onwards.
+    order : {'C', 'F'}, optional
+        Row-major (C-style) or column-major (Fortran-style) order.
+
+    Returns
+    -------
+    rec : recarray
+        Empty array of the given shape and type.
+
+    See Also
+    --------
+    rec.fromrecords : Construct a record array from data.
+    record : fundamental data-type for `recarray`.
+    format_parser : determine a data-type from formats, names, titles.
+
+    Notes
+    -----
+    This constructor can be compared to ``empty``: it creates a new record
+    array but does not fill it with data.  To create a record array from data,
+    use one of the following methods:
+
+    1. Create a standard ndarray and convert it to a record array,
+       using ``arr.view(np.recarray)``
+    2. Use the `buf` keyword.
+    3. Use `np.rec.fromrecords`.
+
+    Examples
+    --------
+    Create an array with two fields, ``x`` and ``y``:
+
+    >>> x = np.array([(1.0, 2), (3.0, 4)], dtype=[('x', '<f8'), ('y', '<i8')])
+    >>> x
+    array([(1., 2), (3., 4)], dtype=[('x', '<f8'), ('y', '<i8')])
+
+    >>> x['x']
+    array([1., 3.])
+
+    View the array as a record array:
+
+    >>> x = x.view(np.recarray)
+
+    >>> x.x
+    array([1., 3.])
+
+    >>> x.y
+    array([2, 4])
+
+    Create a new, empty record array:
+
+    >>> np.recarray((2,),
+    ... dtype=[('x', int), ('y', float), ('z', int)]) #doctest: +SKIP
+    rec.array([(-1073741821, 1.2249118382103472e-301, 24547520),
+           (3471280, 1.2134086255804012e-316, 0)],
+          dtype=[('x', '<i4'), ('y', '<f8'), ('z', '<i4')])
+
+    """
+
+    # manually set name and module so that this class's type shows
+    # up as "numpy.recarray" when printed
+    __name__ = 'recarray'
+    __module__ = 'numpy'
+
+    def __new__(subtype, shape, dtype=None, buf=None, offset=0, strides=None,
+                formats=None, names=None, titles=None,
+                byteorder=None, aligned=False, order='C'):
+
+        if dtype is not None:
+            descr = sb.dtype(dtype)
+        else:
+            descr = format_parser(formats, names, titles, aligned, byteorder).dtype
+
+        if buf is None:
+            self = ndarray.__new__(subtype, shape, (record, descr), order=order)
+        else:
+            self = ndarray.__new__(subtype, shape, (record, descr),
+                                      buffer=buf, offset=offset,
+                                      strides=strides, order=order)
+        return self
+
+    def __array_finalize__(self, obj):
+        if self.dtype.type is not record and self.dtype.names is not None:
+            # if self.dtype is not np.record, invoke __setattr__ which will
+            # convert it to a record if it is a void dtype.
+            self.dtype = self.dtype
+
+    def __getattribute__(self, attr):
+        # See if ndarray has this attr, and return it if so. (note that this
+        # means a field with the same name as an ndarray attr cannot be
+        # accessed by attribute).
+        try:
+            return object.__getattribute__(self, attr)
+        except AttributeError:  # attr must be a fieldname
+            pass
+
+        # look for a field with this name
+        fielddict = ndarray.__getattribute__(self, 'dtype').fields
+        try:
+            res = fielddict[attr][:2]
+        except (TypeError, KeyError):
+            raise AttributeError("recarray has no attribute %s" % attr)
+        obj = self.getfield(*res)
+
+        # At this point obj will always be a recarray, since (see
+        # PyArray_GetField) the type of obj is inherited. Next, if obj.dtype is
+        # non-structured, convert it to an ndarray. Then if obj is structured
+        # with void type convert it to the same dtype.type (eg to preserve
+        # numpy.record type if present), since nested structured fields do not
+        # inherit type. Don't do this for non-void structures though.
+        if obj.dtype.names is not None:
+            if issubclass(obj.dtype.type, nt.void):
+                return obj.view(dtype=(self.dtype.type, obj.dtype))
+            return obj
+        else:
+            return obj.view(ndarray)
+
+    # Save the dictionary.
+    # If the attr is a field name and not in the saved dictionary
+    # Undo any "setting" of the attribute and do a setfield
+    # Thus, you can't create attributes on-the-fly that are field names.
+    def __setattr__(self, attr, val):
+
+        # Automatically convert (void) structured types to records
+        # (but not non-void structures, subarrays, or non-structured voids)
+        if attr == 'dtype' and issubclass(val.type, nt.void) and val.names is not None:
+            val = sb.dtype((record, val))
+
+        newattr = attr not in self.__dict__
+        try:
+            ret = object.__setattr__(self, attr, val)
+        except Exception:
+            fielddict = ndarray.__getattribute__(self, 'dtype').fields or {}
+            if attr not in fielddict:
+                raise
+        else:
+            fielddict = ndarray.__getattribute__(self, 'dtype').fields or {}
+            if attr not in fielddict:
+                return ret
+            if newattr:
+                # We just added this one or this setattr worked on an
+                # internal attribute.
+                try:
+                    object.__delattr__(self, attr)
+                except Exception:
+                    return ret
+        try:
+            res = fielddict[attr][:2]
+        except (TypeError, KeyError):
+            raise AttributeError("record array has no attribute %s" % attr)
+        return self.setfield(val, *res)
+
+    def __getitem__(self, indx):
+        obj = super(recarray, self).__getitem__(indx)
+
+        # copy behavior of getattr, except that here
+        # we might also be returning a single element
+        if isinstance(obj, ndarray):
+            if obj.dtype.names is not None:
+                obj = obj.view(type(self))
+                if issubclass(obj.dtype.type, nt.void):
+                    return obj.view(dtype=(self.dtype.type, obj.dtype))
+                return obj
+            else:
+                return obj.view(type=ndarray)
+        else:
+            # return a single element
+            return obj
+
+    def __repr__(self):
+
+        repr_dtype = self.dtype
+        if self.dtype.type is record or not issubclass(self.dtype.type, nt.void):
+            # If this is a full record array (has numpy.record dtype),
+            # or if it has a scalar (non-void) dtype with no records,
+            # represent it using the rec.array function. Since rec.array
+            # converts dtype to a numpy.record for us, convert back
+            # to non-record before printing
+            if repr_dtype.type is record:
+                repr_dtype = sb.dtype((nt.void, repr_dtype))
+            prefix = "rec.array("
+            fmt = 'rec.array(%s,%sdtype=%s)'
+        else:
+            # otherwise represent it using np.array plus a view
+            # This should only happen if the user is playing
+            # strange games with dtypes.
+            prefix = "array("
+            fmt = 'array(%s,%sdtype=%s).view(numpy.recarray)'
+
+        # get data/shape string. logic taken from numeric.array_repr
+        if self.size > 0 or self.shape == (0,):
+            lst = sb.array2string(
+                self, separator=', ', prefix=prefix, suffix=',')
+        else:
+            # show zero-length shape unless it is (0,)
+            lst = "[], shape=%s" % (repr(self.shape),)
+
+        lf = '\n'+' '*len(prefix)
+        if get_printoptions()['legacy'] == '1.13':
+            lf = ' ' + lf  # trailing space
+        return fmt % (lst, lf, repr_dtype)
+
+    def field(self, attr, val=None):
+        if isinstance(attr, int):
+            names = ndarray.__getattribute__(self, 'dtype').names
+            attr = names[attr]
+
+        fielddict = ndarray.__getattribute__(self, 'dtype').fields
+
+        res = fielddict[attr][:2]
+
+        if val is None:
+            obj = self.getfield(*res)
+            if obj.dtype.names is not None:
+                return obj
+            return obj.view(ndarray)
+        else:
+            return self.setfield(val, *res)
+
+
+def _deprecate_shape_0_as_None(shape):
+    if shape == 0:
+        warnings.warn(
+            "Passing `shape=0` to have the shape be inferred is deprecated, "
+            "and in future will be equivalent to `shape=(0,)`. To infer "
+            "the shape and suppress this warning, pass `shape=None` instead.",
+            FutureWarning, stacklevel=3)
+        return None
+    else:
+        return shape
+
+
+def fromarrays(arrayList, dtype=None, shape=None, formats=None,
+               names=None, titles=None, aligned=False, byteorder=None):
+    """Create a record array from a (flat) list of arrays
+
+    Parameters
+    ----------
+    arrayList : list or tuple
+        List of array-like objects (such as lists, tuples,
+        and ndarrays).
+    dtype : data-type, optional
+        valid dtype for all arrays
+    shape : int or tuple of ints, optional
+        Shape of the resulting array. If not provided, inferred from
+        ``arrayList[0]``.
+    formats, names, titles, aligned, byteorder :
+        If `dtype` is ``None``, these arguments are passed to
+        `numpy.format_parser` to construct a dtype. See that function for
+        detailed documentation.
+
+    Returns
+    -------
+    np.recarray
+        Record array consisting of given arrayList columns.
+
+    Examples
+    --------
+    >>> x1=np.array([1,2,3,4])
+    >>> x2=np.array(['a','dd','xyz','12'])
+    >>> x3=np.array([1.1,2,3,4])
+    >>> r = np.core.records.fromarrays([x1,x2,x3],names='a,b,c')
+    >>> print(r[1])
+    (2, 'dd', 2.0) # may vary
+    >>> x1[1]=34
+    >>> r.a
+    array([1, 2, 3, 4])
+    
+    >>> x1 = np.array([1, 2, 3, 4])
+    >>> x2 = np.array(['a', 'dd', 'xyz', '12'])
+    >>> x3 = np.array([1.1, 2, 3,4])
+    >>> r = np.core.records.fromarrays(
+    ...     [x1, x2, x3],
+    ...     dtype=np.dtype([('a', np.int32), ('b', 'S3'), ('c', np.float32)]))
+    >>> r
+    rec.array([(1, b'a', 1.1), (2, b'dd', 2. ), (3, b'xyz', 3. ),
+               (4, b'12', 4. )],
+              dtype=[('a', '<i4'), ('b', 'S3'), ('c', '<f4')])
+    """
+
+    arrayList = [sb.asarray(x) for x in arrayList]
+
+    # NumPy 1.19.0, 2020-01-01
+    shape = _deprecate_shape_0_as_None(shape)
+
+    if shape is None:
+        shape = arrayList[0].shape
+    elif isinstance(shape, int):
+        shape = (shape,)
+
+    if formats is None and dtype is None:
+        # go through each object in the list to see if it is an ndarray
+        # and determine the formats.
+        formats = [obj.dtype for obj in arrayList]
+
+    if dtype is not None:
+        descr = sb.dtype(dtype)
+    else:
+        descr = format_parser(formats, names, titles, aligned, byteorder).dtype
+    _names = descr.names
+
+    # Determine shape from data-type.
+    if len(descr) != len(arrayList):
+        raise ValueError("mismatch between the number of fields "
+                "and the number of arrays")
+
+    d0 = descr[0].shape
+    nn = len(d0)
+    if nn > 0:
+        shape = shape[:-nn]
+
+    for k, obj in enumerate(arrayList):
+        nn = descr[k].ndim
+        testshape = obj.shape[:obj.ndim - nn]
+        if testshape != shape:
+            raise ValueError("array-shape mismatch in array %d" % k)
+
+    _array = recarray(shape, descr)
+
+    # populate the record array (makes a copy)
+    for i in range(len(arrayList)):
+        _array[_names[i]] = arrayList[i]
+
+    return _array
+
+def fromrecords(recList, dtype=None, shape=None, formats=None, names=None,
+                titles=None, aligned=False, byteorder=None):
+    """Create a recarray from a list of records in text form.
+
+    Parameters
+    ----------
+    recList : sequence
+        data in the same field may be heterogeneous - they will be promoted
+        to the highest data type.
+    dtype : data-type, optional
+        valid dtype for all arrays
+    shape : int or tuple of ints, optional
+        shape of each array.
+    formats, names, titles, aligned, byteorder :
+        If `dtype` is ``None``, these arguments are passed to
+        `numpy.format_parser` to construct a dtype. See that function for
+        detailed documentation.
+
+        If both `formats` and `dtype` are None, then this will auto-detect
+        formats. Use list of tuples rather than list of lists for faster
+        processing.
+
+    Returns
+    -------
+    np.recarray
+        record array consisting of given recList rows.
+
+    Examples
+    --------
+    >>> r=np.core.records.fromrecords([(456,'dbe',1.2),(2,'de',1.3)],
+    ... names='col1,col2,col3')
+    >>> print(r[0])
+    (456, 'dbe', 1.2)
+    >>> r.col1
+    array([456,   2])
+    >>> r.col2
+    array(['dbe', 'de'], dtype='<U3')
+    >>> import pickle
+    >>> pickle.loads(pickle.dumps(r))
+    rec.array([(456, 'dbe', 1.2), (  2, 'de', 1.3)],
+              dtype=[('col1', '<i8'), ('col2', '<U3'), ('col3', '<f8')])
+    """
+
+    if formats is None and dtype is None:  # slower
+        obj = sb.array(recList, dtype=object)
+        arrlist = [sb.array(obj[..., i].tolist()) for i in range(obj.shape[-1])]
+        return fromarrays(arrlist, formats=formats, shape=shape, names=names,
+                          titles=titles, aligned=aligned, byteorder=byteorder)
+
+    if dtype is not None:
+        descr = sb.dtype((record, dtype))
+    else:
+        descr = format_parser(formats, names, titles, aligned, byteorder).dtype
+
+    try:
+        retval = sb.array(recList, dtype=descr)
+    except (TypeError, ValueError):
+        # NumPy 1.19.0, 2020-01-01
+        shape = _deprecate_shape_0_as_None(shape)
+        if shape is None:
+            shape = len(recList)
+        if isinstance(shape, int):
+            shape = (shape,)
+        if len(shape) > 1:
+            raise ValueError("Can only deal with 1-d array.")
+        _array = recarray(shape, descr)
+        for k in range(_array.size):
+            _array[k] = tuple(recList[k])
+        # list of lists instead of list of tuples ?
+        # 2018-02-07, 1.14.1
+        warnings.warn(
+            "fromrecords expected a list of tuples, may have received a list "
+            "of lists instead. In the future that will raise an error",
+            FutureWarning, stacklevel=2)
+        return _array
+    else:
+        if shape is not None and retval.shape != shape:
+            retval.shape = shape
+
+    res = retval.view(recarray)
+
+    return res
+
+
+def fromstring(datastring, dtype=None, shape=None, offset=0, formats=None,
+               names=None, titles=None, aligned=False, byteorder=None):
+    r"""Create a record array from binary data
+
+    Note that despite the name of this function it does not accept `str`
+    instances.
+
+    Parameters
+    ----------
+    datastring : bytes-like
+        Buffer of binary data
+    dtype : data-type, optional
+        Valid dtype for all arrays
+    shape : int or tuple of ints, optional
+        Shape of each array.
+    offset : int, optional
+        Position in the buffer to start reading from.
+    formats, names, titles, aligned, byteorder :
+        If `dtype` is ``None``, these arguments are passed to
+        `numpy.format_parser` to construct a dtype. See that function for
+        detailed documentation.
+
+
+    Returns
+    -------
+    np.recarray
+        Record array view into the data in datastring. This will be readonly
+        if `datastring` is readonly.
+
+    See Also
+    --------
+    numpy.frombuffer
+
+    Examples
+    --------
+    >>> a = b'\x01\x02\x03abc'
+    >>> np.core.records.fromstring(a, dtype='u1,u1,u1,S3')
+    rec.array([(1, 2, 3, b'abc')],
+            dtype=[('f0', 'u1'), ('f1', 'u1'), ('f2', 'u1'), ('f3', 'S3')])
+
+    >>> grades_dtype = [('Name', (np.str_, 10)), ('Marks', np.float64),
+    ...                 ('GradeLevel', np.int32)]
+    >>> grades_array = np.array([('Sam', 33.3, 3), ('Mike', 44.4, 5),
+    ...                         ('Aadi', 66.6, 6)], dtype=grades_dtype)
+    >>> np.core.records.fromstring(grades_array.tobytes(), dtype=grades_dtype)
+    rec.array([('Sam', 33.3, 3), ('Mike', 44.4, 5), ('Aadi', 66.6, 6)],
+            dtype=[('Name', '<U10'), ('Marks', '<f8'), ('GradeLevel', '<i4')])
+
+    >>> s = '\x01\x02\x03abc'
+    >>> np.core.records.fromstring(s, dtype='u1,u1,u1,S3')
+    Traceback (most recent call last)
+       ...
+    TypeError: a bytes-like object is required, not 'str'
+    """
+
+    if dtype is None and formats is None:
+        raise TypeError("fromstring() needs a 'dtype' or 'formats' argument")
+
+    if dtype is not None:
+        descr = sb.dtype(dtype)
+    else:
+        descr = format_parser(formats, names, titles, aligned, byteorder).dtype
+
+    itemsize = descr.itemsize
+
+    # NumPy 1.19.0, 2020-01-01
+    shape = _deprecate_shape_0_as_None(shape)
+
+    if shape in (None, -1):
+        shape = (len(datastring) - offset) // itemsize
+
+    _array = recarray(shape, descr, buf=datastring, offset=offset)
+    return _array
+
+def get_remaining_size(fd):
+    try:
+        fn = fd.fileno()
+    except AttributeError:
+        return os.path.getsize(fd.name) - fd.tell()
+    st = os.fstat(fn)
+    size = st.st_size - fd.tell()
+    return size
+
+def fromfile(fd, dtype=None, shape=None, offset=0, formats=None,
+             names=None, titles=None, aligned=False, byteorder=None):
+    """Create an array from binary file data
+
+    Parameters
+    ----------
+    fd : str or file type
+        If file is a string or a path-like object then that file is opened,
+        else it is assumed to be a file object. The file object must
+        support random access (i.e. it must have tell and seek methods).
+    dtype : data-type, optional
+        valid dtype for all arrays
+    shape : int or tuple of ints, optional
+        shape of each array.
+    offset : int, optional
+        Position in the file to start reading from.
+    formats, names, titles, aligned, byteorder :
+        If `dtype` is ``None``, these arguments are passed to
+        `numpy.format_parser` to construct a dtype. See that function for
+        detailed documentation
+
+    Returns
+    -------
+    np.recarray
+        record array consisting of data enclosed in file.
+
+    Examples
+    --------
+    >>> from tempfile import TemporaryFile
+    >>> a = np.empty(10,dtype='f8,i4,a5')
+    >>> a[5] = (0.5,10,'abcde')
+    >>>
+    >>> fd=TemporaryFile()
+    >>> a = a.newbyteorder('<')
+    >>> a.tofile(fd)
+    >>>
+    >>> _ = fd.seek(0)
+    >>> r=np.core.records.fromfile(fd, formats='f8,i4,a5', shape=10,
+    ... byteorder='<')
+    >>> print(r[5])
+    (0.5, 10, 'abcde')
+    >>> r.shape
+    (10,)
+    """
+
+    if dtype is None and formats is None:
+        raise TypeError("fromfile() needs a 'dtype' or 'formats' argument")
+
+    # NumPy 1.19.0, 2020-01-01
+    shape = _deprecate_shape_0_as_None(shape)
+
+    if shape is None:
+        shape = (-1,)
+    elif isinstance(shape, int):
+        shape = (shape,)
+
+    if isfileobj(fd):
+        # file already opened
+        ctx = contextlib_nullcontext(fd)
+    else:
+        # open file
+        ctx = open(os_fspath(fd), 'rb')
+
+    with ctx as fd:
+        if offset > 0:
+            fd.seek(offset, 1)
+        size = get_remaining_size(fd)
+
+        if dtype is not None:
+            descr = sb.dtype(dtype)
+        else:
+            descr = format_parser(formats, names, titles, aligned, byteorder).dtype
+
+        itemsize = descr.itemsize
+
+        shapeprod = sb.array(shape).prod(dtype=nt.intp)
+        shapesize = shapeprod * itemsize
+        if shapesize < 0:
+            shape = list(shape)
+            shape[shape.index(-1)] = size // -shapesize
+            shape = tuple(shape)
+            shapeprod = sb.array(shape).prod(dtype=nt.intp)
+
+        nbytes = shapeprod * itemsize
+
+        if nbytes > size:
+            raise ValueError(
+                    "Not enough bytes left in file for specified shape and type")
+
+        # create the array
+        _array = recarray(shape, descr)
+        nbytesread = fd.readinto(_array.data)
+        if nbytesread != nbytes:
+            raise IOError("Didn't read as many bytes as expected")
+
+    return _array
+
+def array(obj, dtype=None, shape=None, offset=0, strides=None, formats=None,
+          names=None, titles=None, aligned=False, byteorder=None, copy=True):
+    """Construct a record array from a wide-variety of objects.
+    """
+
+    if ((isinstance(obj, (type(None), str)) or isfileobj(obj)) and
+           formats is None and dtype is None):
+        raise ValueError("Must define formats (or dtype) if object is "
+                         "None, string, or an open file")
+
+    kwds = {}
+    if dtype is not None:
+        dtype = sb.dtype(dtype)
+    elif formats is not None:
+        dtype = format_parser(formats, names, titles,
+                              aligned, byteorder).dtype
+    else:
+        kwds = {'formats': formats,
+                'names': names,
+                'titles': titles,
+                'aligned': aligned,
+                'byteorder': byteorder
+                }
+
+    if obj is None:
+        if shape is None:
+            raise ValueError("Must define a shape if obj is None")
+        return recarray(shape, dtype, buf=obj, offset=offset, strides=strides)
+
+    elif isinstance(obj, bytes):
+        return fromstring(obj, dtype, shape=shape, offset=offset, **kwds)
+
+    elif isinstance(obj, (list, tuple)):
+        if isinstance(obj[0], (tuple, list)):
+            return fromrecords(obj, dtype=dtype, shape=shape, **kwds)
+        else:
+            return fromarrays(obj, dtype=dtype, shape=shape, **kwds)
+
+    elif isinstance(obj, recarray):
+        if dtype is not None and (obj.dtype != dtype):
+            new = obj.view(dtype)
+        else:
+            new = obj
+        if copy:
+            new = new.copy()
+        return new
+
+    elif isfileobj(obj):
+        return fromfile(obj, dtype=dtype, shape=shape, offset=offset)
+
+    elif isinstance(obj, ndarray):
+        if dtype is not None and (obj.dtype != dtype):
+            new = obj.view(dtype)
+        else:
+            new = obj
+        if copy:
+            new = new.copy()
+        return new.view(recarray)
+
+    else:
+        interface = getattr(obj, "__array_interface__", None)
+        if interface is None or not isinstance(interface, dict):
+            raise ValueError("Unknown input type")
+        obj = sb.array(obj)
+        if dtype is not None and (obj.dtype != dtype):
+            obj = obj.view(dtype)
+        return obj.view(recarray)
diff --git a/venv/Lib/site-packages/numpy/core/setup.py b/venv/Lib/site-packages/numpy/core/setup.py
new file mode 100644
index 000000000..fcc422545
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/setup.py
@@ -0,0 +1,973 @@
+import os
+import sys
+import pickle
+import copy
+import warnings
+import platform
+import textwrap
+from os.path import join
+
+from numpy.distutils import log
+from distutils.dep_util import newer
+from distutils.sysconfig import get_config_var
+from numpy._build_utils.apple_accelerate import (
+    uses_accelerate_framework, get_sgemv_fix
+    )
+from numpy.compat import npy_load_module
+from setup_common import *  # noqa: F403
+
+# Set to True to enable relaxed strides checking. This (mostly) means
+# that `strides[dim]` is ignored if `shape[dim] == 1` when setting flags.
+NPY_RELAXED_STRIDES_CHECKING = (os.environ.get('NPY_RELAXED_STRIDES_CHECKING', "1") != "0")
+
+# Put NPY_RELAXED_STRIDES_DEBUG=1 in the environment if you want numpy to use a
+# bogus value for affected strides in order to help smoke out bad stride usage
+# when relaxed stride checking is enabled.
+NPY_RELAXED_STRIDES_DEBUG = (os.environ.get('NPY_RELAXED_STRIDES_DEBUG', "0") != "0")
+NPY_RELAXED_STRIDES_DEBUG = NPY_RELAXED_STRIDES_DEBUG and NPY_RELAXED_STRIDES_CHECKING
+
+# XXX: ugly, we use a class to avoid calling twice some expensive functions in
+# config.h/numpyconfig.h. I don't see a better way because distutils force
+# config.h generation inside an Extension class, and as such sharing
+# configuration information between extensions is not easy.
+# Using a pickled-based memoize does not work because config_cmd is an instance
+# method, which cPickle does not like.
+#
+# Use pickle in all cases, as cPickle is gone in python3 and the difference
+# in time is only in build. -- Charles Harris, 2013-03-30
+
+class CallOnceOnly:
+    def __init__(self):
+        self._check_types = None
+        self._check_ieee_macros = None
+        self._check_complex = None
+
+    def check_types(self, *a, **kw):
+        if self._check_types is None:
+            out = check_types(*a, **kw)
+            self._check_types = pickle.dumps(out)
+        else:
+            out = copy.deepcopy(pickle.loads(self._check_types))
+        return out
+
+    def check_ieee_macros(self, *a, **kw):
+        if self._check_ieee_macros is None:
+            out = check_ieee_macros(*a, **kw)
+            self._check_ieee_macros = pickle.dumps(out)
+        else:
+            out = copy.deepcopy(pickle.loads(self._check_ieee_macros))
+        return out
+
+    def check_complex(self, *a, **kw):
+        if self._check_complex is None:
+            out = check_complex(*a, **kw)
+            self._check_complex = pickle.dumps(out)
+        else:
+            out = copy.deepcopy(pickle.loads(self._check_complex))
+        return out
+
+def pythonlib_dir():
+    """return path where libpython* is."""
+    if sys.platform == 'win32':
+        return os.path.join(sys.prefix, "libs")
+    else:
+        return get_config_var('LIBDIR')
+
+def is_npy_no_signal():
+    """Return True if the NPY_NO_SIGNAL symbol must be defined in configuration
+    header."""
+    return sys.platform == 'win32'
+
+def is_npy_no_smp():
+    """Return True if the NPY_NO_SMP symbol must be defined in public
+    header (when SMP support cannot be reliably enabled)."""
+    # Perhaps a fancier check is in order here.
+    #  so that threads are only enabled if there
+    #  are actually multiple CPUS? -- but
+    #  threaded code can be nice even on a single
+    #  CPU so that long-calculating code doesn't
+    #  block.
+    return 'NPY_NOSMP' in os.environ
+
+def win32_checks(deflist):
+    from numpy.distutils.misc_util import get_build_architecture
+    a = get_build_architecture()
+
+    # Distutils hack on AMD64 on windows
+    print('BUILD_ARCHITECTURE: %r, os.name=%r, sys.platform=%r' %
+          (a, os.name, sys.platform))
+    if a == 'AMD64':
+        deflist.append('DISTUTILS_USE_SDK')
+
+    # On win32, force long double format string to be 'g', not
+    # 'Lg', since the MS runtime does not support long double whose
+    # size is > sizeof(double)
+    if a == "Intel" or a == "AMD64":
+        deflist.append('FORCE_NO_LONG_DOUBLE_FORMATTING')
+
+def check_math_capabilities(config, moredefs, mathlibs):
+    def check_func(func_name):
+        return config.check_func(func_name, libraries=mathlibs,
+                                 decl=True, call=True)
+
+    def check_funcs_once(funcs_name):
+        decl = dict([(f, True) for f in funcs_name])
+        st = config.check_funcs_once(funcs_name, libraries=mathlibs,
+                                     decl=decl, call=decl)
+        if st:
+            moredefs.extend([(fname2def(f), 1) for f in funcs_name])
+        return st
+
+    def check_funcs(funcs_name):
+        # Use check_funcs_once first, and if it does not work, test func per
+        # func. Return success only if all the functions are available
+        if not check_funcs_once(funcs_name):
+            # Global check failed, check func per func
+            for f in funcs_name:
+                if check_func(f):
+                    moredefs.append((fname2def(f), 1))
+            return 0
+        else:
+            return 1
+
+    #use_msvc = config.check_decl("_MSC_VER")
+
+    if not check_funcs_once(MANDATORY_FUNCS):
+        raise SystemError("One of the required function to build numpy is not"
+                " available (the list is %s)." % str(MANDATORY_FUNCS))
+
+    # Standard functions which may not be available and for which we have a
+    # replacement implementation. Note that some of these are C99 functions.
+
+    # XXX: hack to circumvent cpp pollution from python: python put its
+    # config.h in the public namespace, so we have a clash for the common
+    # functions we test. We remove every function tested by python's
+    # autoconf, hoping their own test are correct
+    for f in OPTIONAL_STDFUNCS_MAYBE:
+        if config.check_decl(fname2def(f),
+                    headers=["Python.h", "math.h"]):
+            OPTIONAL_STDFUNCS.remove(f)
+
+    check_funcs(OPTIONAL_STDFUNCS)
+
+    for h in OPTIONAL_HEADERS:
+        if config.check_func("", decl=False, call=False, headers=[h]):
+            h = h.replace(".", "_").replace(os.path.sep, "_")
+            moredefs.append((fname2def(h), 1))
+
+    for tup in OPTIONAL_INTRINSICS:
+        headers = None
+        if len(tup) == 2:
+            f, args, m = tup[0], tup[1], fname2def(tup[0])
+        elif len(tup) == 3:
+            f, args, headers, m = tup[0], tup[1], [tup[2]], fname2def(tup[0])
+        else:
+            f, args, headers, m = tup[0], tup[1], [tup[2]], fname2def(tup[3])
+        if config.check_func(f, decl=False, call=True, call_args=args,
+                             headers=headers):
+            moredefs.append((m, 1))
+
+    for dec, fn in OPTIONAL_FUNCTION_ATTRIBUTES:
+        if config.check_gcc_function_attribute(dec, fn):
+            moredefs.append((fname2def(fn), 1))
+
+    for dec, fn, code, header in OPTIONAL_FUNCTION_ATTRIBUTES_WITH_INTRINSICS:
+        if config.check_gcc_function_attribute_with_intrinsics(dec, fn, code,
+                                                               header):
+            moredefs.append((fname2def(fn), 1))
+
+    for fn in OPTIONAL_VARIABLE_ATTRIBUTES:
+        if config.check_gcc_variable_attribute(fn):
+            m = fn.replace("(", "_").replace(")", "_")
+            moredefs.append((fname2def(m), 1))
+
+    # C99 functions: float and long double versions
+    check_funcs(C99_FUNCS_SINGLE)
+    check_funcs(C99_FUNCS_EXTENDED)
+
+def check_complex(config, mathlibs):
+    priv = []
+    pub = []
+
+    try:
+        if os.uname()[0] == "Interix":
+            warnings.warn("Disabling broken complex support. See #1365", stacklevel=2)
+            return priv, pub
+    except Exception:
+        # os.uname not available on all platforms. blanket except ugly but safe
+        pass
+
+    # Check for complex support
+    st = config.check_header('complex.h')
+    if st:
+        priv.append(('HAVE_COMPLEX_H', 1))
+        pub.append(('NPY_USE_C99_COMPLEX', 1))
+
+        for t in C99_COMPLEX_TYPES:
+            st = config.check_type(t, headers=["complex.h"])
+            if st:
+                pub.append(('NPY_HAVE_%s' % type2def(t), 1))
+
+        def check_prec(prec):
+            flist = [f + prec for f in C99_COMPLEX_FUNCS]
+            decl = dict([(f, True) for f in flist])
+            if not config.check_funcs_once(flist, call=decl, decl=decl,
+                                           libraries=mathlibs):
+                for f in flist:
+                    if config.check_func(f, call=True, decl=True,
+                                         libraries=mathlibs):
+                        priv.append((fname2def(f), 1))
+            else:
+                priv.extend([(fname2def(f), 1) for f in flist])
+
+        check_prec('')
+        check_prec('f')
+        check_prec('l')
+
+    return priv, pub
+
+def check_ieee_macros(config):
+    priv = []
+    pub = []
+
+    macros = []
+
+    def _add_decl(f):
+        priv.append(fname2def("decl_%s" % f))
+        pub.append('NPY_%s' % fname2def("decl_%s" % f))
+
+    # XXX: hack to circumvent cpp pollution from python: python put its
+    # config.h in the public namespace, so we have a clash for the common
+    # functions we test. We remove every function tested by python's
+    # autoconf, hoping their own test are correct
+    _macros = ["isnan", "isinf", "signbit", "isfinite"]
+    for f in _macros:
+        py_symbol = fname2def("decl_%s" % f)
+        already_declared = config.check_decl(py_symbol,
+                headers=["Python.h", "math.h"])
+        if already_declared:
+            if config.check_macro_true(py_symbol,
+                    headers=["Python.h", "math.h"]):
+                pub.append('NPY_%s' % fname2def("decl_%s" % f))
+        else:
+            macros.append(f)
+    # Normally, isnan and isinf are macro (C99), but some platforms only have
+    # func, or both func and macro version. Check for macro only, and define
+    # replacement ones if not found.
+    # Note: including Python.h is necessary because it modifies some math.h
+    # definitions
+    for f in macros:
+        st = config.check_decl(f, headers=["Python.h", "math.h"])
+        if st:
+            _add_decl(f)
+
+    return priv, pub
+
+def check_types(config_cmd, ext, build_dir):
+    private_defines = []
+    public_defines = []
+
+    # Expected size (in number of bytes) for each type. This is an
+    # optimization: those are only hints, and an exhaustive search for the size
+    # is done if the hints are wrong.
+    expected = {'short': [2], 'int': [4], 'long': [8, 4],
+                'float': [4], 'double': [8], 'long double': [16, 12, 8],
+                'Py_intptr_t': [8, 4], 'PY_LONG_LONG': [8], 'long long': [8],
+                'off_t': [8, 4]}
+
+    # Check we have the python header (-dev* packages on Linux)
+    result = config_cmd.check_header('Python.h')
+    if not result:
+        python = 'python'
+        if '__pypy__' in sys.builtin_module_names:
+            python = 'pypy'
+        raise SystemError(
+                "Cannot compile 'Python.h'. Perhaps you need to "
+                "install {0}-dev|{0}-devel.".format(python))
+    res = config_cmd.check_header("endian.h")
+    if res:
+        private_defines.append(('HAVE_ENDIAN_H', 1))
+        public_defines.append(('NPY_HAVE_ENDIAN_H', 1))
+    res = config_cmd.check_header("sys/endian.h")
+    if res:
+        private_defines.append(('HAVE_SYS_ENDIAN_H', 1))
+        public_defines.append(('NPY_HAVE_SYS_ENDIAN_H', 1))
+
+    # Check basic types sizes
+    for type in ('short', 'int', 'long'):
+        res = config_cmd.check_decl("SIZEOF_%s" % sym2def(type), headers=["Python.h"])
+        if res:
+            public_defines.append(('NPY_SIZEOF_%s' % sym2def(type), "SIZEOF_%s" % sym2def(type)))
+        else:
+            res = config_cmd.check_type_size(type, expected=expected[type])
+            if res >= 0:
+                public_defines.append(('NPY_SIZEOF_%s' % sym2def(type), '%d' % res))
+            else:
+                raise SystemError("Checking sizeof (%s) failed !" % type)
+
+    for type in ('float', 'double', 'long double'):
+        already_declared = config_cmd.check_decl("SIZEOF_%s" % sym2def(type),
+                                                 headers=["Python.h"])
+        res = config_cmd.check_type_size(type, expected=expected[type])
+        if res >= 0:
+            public_defines.append(('NPY_SIZEOF_%s' % sym2def(type), '%d' % res))
+            if not already_declared and not type == 'long double':
+                private_defines.append(('SIZEOF_%s' % sym2def(type), '%d' % res))
+        else:
+            raise SystemError("Checking sizeof (%s) failed !" % type)
+
+        # Compute size of corresponding complex type: used to check that our
+        # definition is binary compatible with C99 complex type (check done at
+        # build time in npy_common.h)
+        complex_def = "struct {%s __x; %s __y;}" % (type, type)
+        res = config_cmd.check_type_size(complex_def,
+                                         expected=[2 * x for x in expected[type]])
+        if res >= 0:
+            public_defines.append(('NPY_SIZEOF_COMPLEX_%s' % sym2def(type), '%d' % res))
+        else:
+            raise SystemError("Checking sizeof (%s) failed !" % complex_def)
+
+    for type in ('Py_intptr_t', 'off_t'):
+        res = config_cmd.check_type_size(type, headers=["Python.h"],
+                library_dirs=[pythonlib_dir()],
+                expected=expected[type])
+
+        if res >= 0:
+            private_defines.append(('SIZEOF_%s' % sym2def(type), '%d' % res))
+            public_defines.append(('NPY_SIZEOF_%s' % sym2def(type), '%d' % res))
+        else:
+            raise SystemError("Checking sizeof (%s) failed !" % type)
+
+    # We check declaration AND type because that's how distutils does it.
+    if config_cmd.check_decl('PY_LONG_LONG', headers=['Python.h']):
+        res = config_cmd.check_type_size('PY_LONG_LONG',  headers=['Python.h'],
+                library_dirs=[pythonlib_dir()],
+                expected=expected['PY_LONG_LONG'])
+        if res >= 0:
+            private_defines.append(('SIZEOF_%s' % sym2def('PY_LONG_LONG'), '%d' % res))
+            public_defines.append(('NPY_SIZEOF_%s' % sym2def('PY_LONG_LONG'), '%d' % res))
+        else:
+            raise SystemError("Checking sizeof (%s) failed !" % 'PY_LONG_LONG')
+
+        res = config_cmd.check_type_size('long long',
+                expected=expected['long long'])
+        if res >= 0:
+            #private_defines.append(('SIZEOF_%s' % sym2def('long long'), '%d' % res))
+            public_defines.append(('NPY_SIZEOF_%s' % sym2def('long long'), '%d' % res))
+        else:
+            raise SystemError("Checking sizeof (%s) failed !" % 'long long')
+
+    if not config_cmd.check_decl('CHAR_BIT', headers=['Python.h']):
+        raise RuntimeError(
+            "Config wo CHAR_BIT is not supported"
+            ", please contact the maintainers")
+
+    return private_defines, public_defines
+
+def check_mathlib(config_cmd):
+    # Testing the C math library
+    mathlibs = []
+    mathlibs_choices = [[], ['m'], ['cpml']]
+    mathlib = os.environ.get('MATHLIB')
+    if mathlib:
+        mathlibs_choices.insert(0, mathlib.split(','))
+    for libs in mathlibs_choices:
+        if config_cmd.check_func("exp", libraries=libs, decl=True, call=True):
+            mathlibs = libs
+            break
+    else:
+        raise EnvironmentError("math library missing; rerun "
+                               "setup.py after setting the "
+                               "MATHLIB env variable")
+    return mathlibs
+
+def visibility_define(config):
+    """Return the define value to use for NPY_VISIBILITY_HIDDEN (may be empty
+    string)."""
+    hide = '__attribute__((visibility("hidden")))'
+    if config.check_gcc_function_attribute(hide, 'hideme'):
+        return hide
+    else:
+        return ''
+
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration, dot_join
+    from numpy.distutils.system_info import get_info
+
+    config = Configuration('core', parent_package, top_path)
+    local_dir = config.local_path
+    codegen_dir = join(local_dir, 'code_generators')
+
+    if is_released(config):
+        warnings.simplefilter('error', MismatchCAPIWarning)
+
+    # Check whether we have a mismatch between the set C API VERSION and the
+    # actual C API VERSION
+    check_api_version(C_API_VERSION, codegen_dir)
+
+    generate_umath_py = join(codegen_dir, 'generate_umath.py')
+    n = dot_join(config.name, 'generate_umath')
+    generate_umath = npy_load_module('_'.join(n.split('.')),
+                                     generate_umath_py, ('.py', 'U', 1))
+
+    header_dir = 'include/numpy'  # this is relative to config.path_in_package
+
+    cocache = CallOnceOnly()
+
+    def generate_config_h(ext, build_dir):
+        target = join(build_dir, header_dir, 'config.h')
+        d = os.path.dirname(target)
+        if not os.path.exists(d):
+            os.makedirs(d)
+
+        if newer(__file__, target):
+            config_cmd = config.get_config_cmd()
+            log.info('Generating %s', target)
+
+            # Check sizeof
+            moredefs, ignored = cocache.check_types(config_cmd, ext, build_dir)
+
+            # Check math library and C99 math funcs availability
+            mathlibs = check_mathlib(config_cmd)
+            moredefs.append(('MATHLIB', ','.join(mathlibs)))
+
+            check_math_capabilities(config_cmd, moredefs, mathlibs)
+            moredefs.extend(cocache.check_ieee_macros(config_cmd)[0])
+            moredefs.extend(cocache.check_complex(config_cmd, mathlibs)[0])
+
+            # Signal check
+            if is_npy_no_signal():
+                moredefs.append('__NPY_PRIVATE_NO_SIGNAL')
+
+            # Windows checks
+            if sys.platform == 'win32' or os.name == 'nt':
+                win32_checks(moredefs)
+
+            # C99 restrict keyword
+            moredefs.append(('NPY_RESTRICT', config_cmd.check_restrict()))
+
+            # Inline check
+            inline = config_cmd.check_inline()
+
+            # Use relaxed stride checking
+            if NPY_RELAXED_STRIDES_CHECKING:
+                moredefs.append(('NPY_RELAXED_STRIDES_CHECKING', 1))
+
+            # Use bogus stride debug aid when relaxed strides are enabled
+            if NPY_RELAXED_STRIDES_DEBUG:
+                moredefs.append(('NPY_RELAXED_STRIDES_DEBUG', 1))
+
+            # Get long double representation
+            rep = check_long_double_representation(config_cmd)
+            moredefs.append(('HAVE_LDOUBLE_%s' % rep, 1))
+
+            if check_for_right_shift_internal_compiler_error(config_cmd):
+                moredefs.append('NPY_DO_NOT_OPTIMIZE_LONG_right_shift')
+                moredefs.append('NPY_DO_NOT_OPTIMIZE_ULONG_right_shift')
+                moredefs.append('NPY_DO_NOT_OPTIMIZE_LONGLONG_right_shift')
+                moredefs.append('NPY_DO_NOT_OPTIMIZE_ULONGLONG_right_shift')
+
+            # Generate the config.h file from moredefs
+            with open(target, 'w') as target_f:
+                for d in moredefs:
+                    if isinstance(d, str):
+                        target_f.write('#define %s\n' % (d))
+                    else:
+                        target_f.write('#define %s %s\n' % (d[0], d[1]))
+
+                # define inline to our keyword, or nothing
+                target_f.write('#ifndef __cplusplus\n')
+                if inline == 'inline':
+                    target_f.write('/* #undef inline */\n')
+                else:
+                    target_f.write('#define inline %s\n' % inline)
+                target_f.write('#endif\n')
+
+                # add the guard to make sure config.h is never included directly,
+                # but always through npy_config.h
+                target_f.write(textwrap.dedent("""
+                    #ifndef _NPY_NPY_CONFIG_H_
+                    #error config.h should never be included directly, include npy_config.h instead
+                    #endif
+                    """))
+
+            log.info('File: %s' % target)
+            with open(target) as target_f:
+                log.info(target_f.read())
+            log.info('EOF')
+        else:
+            mathlibs = []
+            with open(target) as target_f:
+                for line in target_f:
+                    s = '#define MATHLIB'
+                    if line.startswith(s):
+                        value = line[len(s):].strip()
+                        if value:
+                            mathlibs.extend(value.split(','))
+
+        # Ugly: this can be called within a library and not an extension,
+        # in which case there is no libraries attributes (and none is
+        # needed).
+        if hasattr(ext, 'libraries'):
+            ext.libraries.extend(mathlibs)
+
+        incl_dir = os.path.dirname(target)
+        if incl_dir not in config.numpy_include_dirs:
+            config.numpy_include_dirs.append(incl_dir)
+
+        return target
+
+    def generate_numpyconfig_h(ext, build_dir):
+        """Depends on config.h: generate_config_h has to be called before !"""
+        # put common include directory in build_dir on search path
+        # allows using code generation in headers
+        config.add_include_dirs(join(build_dir, "src", "common"))
+        config.add_include_dirs(join(build_dir, "src", "npymath"))
+
+        target = join(build_dir, header_dir, '_numpyconfig.h')
+        d = os.path.dirname(target)
+        if not os.path.exists(d):
+            os.makedirs(d)
+        if newer(__file__, target):
+            config_cmd = config.get_config_cmd()
+            log.info('Generating %s', target)
+
+            # Check sizeof
+            ignored, moredefs = cocache.check_types(config_cmd, ext, build_dir)
+
+            if is_npy_no_signal():
+                moredefs.append(('NPY_NO_SIGNAL', 1))
+
+            if is_npy_no_smp():
+                moredefs.append(('NPY_NO_SMP', 1))
+            else:
+                moredefs.append(('NPY_NO_SMP', 0))
+
+            mathlibs = check_mathlib(config_cmd)
+            moredefs.extend(cocache.check_ieee_macros(config_cmd)[1])
+            moredefs.extend(cocache.check_complex(config_cmd, mathlibs)[1])
+
+            if NPY_RELAXED_STRIDES_CHECKING:
+                moredefs.append(('NPY_RELAXED_STRIDES_CHECKING', 1))
+
+            if NPY_RELAXED_STRIDES_DEBUG:
+                moredefs.append(('NPY_RELAXED_STRIDES_DEBUG', 1))
+
+            # Check whether we can use inttypes (C99) formats
+            if config_cmd.check_decl('PRIdPTR', headers=['inttypes.h']):
+                moredefs.append(('NPY_USE_C99_FORMATS', 1))
+
+            # visibility check
+            hidden_visibility = visibility_define(config_cmd)
+            moredefs.append(('NPY_VISIBILITY_HIDDEN', hidden_visibility))
+
+            # Add the C API/ABI versions
+            moredefs.append(('NPY_ABI_VERSION', '0x%.8X' % C_ABI_VERSION))
+            moredefs.append(('NPY_API_VERSION', '0x%.8X' % C_API_VERSION))
+
+            # Add moredefs to header
+            with open(target, 'w') as target_f:
+                for d in moredefs:
+                    if isinstance(d, str):
+                        target_f.write('#define %s\n' % (d))
+                    else:
+                        target_f.write('#define %s %s\n' % (d[0], d[1]))
+
+                # Define __STDC_FORMAT_MACROS
+                target_f.write(textwrap.dedent("""
+                    #ifndef __STDC_FORMAT_MACROS
+                    #define __STDC_FORMAT_MACROS 1
+                    #endif
+                    """))
+
+            # Dump the numpyconfig.h header to stdout
+            log.info('File: %s' % target)
+            with open(target) as target_f:
+                log.info(target_f.read())
+            log.info('EOF')
+        config.add_data_files((header_dir, target))
+        return target
+
+    def generate_api_func(module_name):
+        def generate_api(ext, build_dir):
+            script = join(codegen_dir, module_name + '.py')
+            sys.path.insert(0, codegen_dir)
+            try:
+                m = __import__(module_name)
+                log.info('executing %s', script)
+                h_file, c_file, doc_file = m.generate_api(os.path.join(build_dir, header_dir))
+            finally:
+                del sys.path[0]
+            config.add_data_files((header_dir, h_file),
+                                  (header_dir, doc_file))
+            return (h_file,)
+        return generate_api
+
+    generate_numpy_api = generate_api_func('generate_numpy_api')
+    generate_ufunc_api = generate_api_func('generate_ufunc_api')
+
+    config.add_include_dirs(join(local_dir, "src", "common"))
+    config.add_include_dirs(join(local_dir, "src"))
+    config.add_include_dirs(join(local_dir))
+
+    config.add_data_dir('include/numpy')
+    config.add_include_dirs(join('src', 'npymath'))
+    config.add_include_dirs(join('src', 'multiarray'))
+    config.add_include_dirs(join('src', 'umath'))
+    config.add_include_dirs(join('src', 'npysort'))
+
+    config.add_define_macros([("NPY_INTERNAL_BUILD", "1")]) # this macro indicates that Numpy build is in process
+    config.add_define_macros([("HAVE_NPY_CONFIG_H", "1")])
+    if sys.platform[:3] == "aix":
+        config.add_define_macros([("_LARGE_FILES", None)])
+    else:
+        config.add_define_macros([("_FILE_OFFSET_BITS", "64")])
+        config.add_define_macros([('_LARGEFILE_SOURCE', '1')])
+        config.add_define_macros([('_LARGEFILE64_SOURCE', '1')])
+
+    config.numpy_include_dirs.extend(config.paths('include'))
+
+    deps = [join('src', 'npymath', '_signbit.c'),
+            join('include', 'numpy', '*object.h'),
+            join(codegen_dir, 'genapi.py'),
+            ]
+
+    #######################################################################
+    #                          npymath library                            #
+    #######################################################################
+
+    subst_dict = dict([("sep", os.path.sep), ("pkgname", "numpy.core")])
+
+    def get_mathlib_info(*args):
+        # Another ugly hack: the mathlib info is known once build_src is run,
+        # but we cannot use add_installed_pkg_config here either, so we only
+        # update the substitution dictionary during npymath build
+        config_cmd = config.get_config_cmd()
+
+        # Check that the toolchain works, to fail early if it doesn't
+        # (avoid late errors with MATHLIB which are confusing if the
+        # compiler does not work).
+        st = config_cmd.try_link('int main(void) { return 0;}')
+        if not st:
+            # rerun the failing command in verbose mode
+            config_cmd.compiler.verbose = True
+            config_cmd.try_link('int main(void) { return 0;}')
+            raise RuntimeError("Broken toolchain: cannot link a simple C program")
+        mlibs = check_mathlib(config_cmd)
+
+        posix_mlib = ' '.join(['-l%s' % l for l in mlibs])
+        msvc_mlib = ' '.join(['%s.lib' % l for l in mlibs])
+        subst_dict["posix_mathlib"] = posix_mlib
+        subst_dict["msvc_mathlib"] = msvc_mlib
+
+    npymath_sources = [join('src', 'npymath', 'npy_math_internal.h.src'),
+                       join('src', 'npymath', 'npy_math.c'),
+                       join('src', 'npymath', 'ieee754.c.src'),
+                       join('src', 'npymath', 'npy_math_complex.c.src'),
+                       join('src', 'npymath', 'halffloat.c')
+                       ]
+
+    # Must be true for CRT compilers but not MinGW/cygwin. See gh-9977.
+    # Intel and Clang also don't seem happy with /GL
+    is_msvc = (platform.platform().startswith('Windows') and
+               platform.python_compiler().startswith('MS'))
+    config.add_installed_library('npymath',
+            sources=npymath_sources + [get_mathlib_info],
+            install_dir='lib',
+            build_info={
+                'include_dirs' : [],  # empty list required for creating npy_math_internal.h
+                'extra_compiler_args' : (['/GL-'] if is_msvc else []),
+            })
+    config.add_npy_pkg_config("npymath.ini.in", "lib/npy-pkg-config",
+            subst_dict)
+    config.add_npy_pkg_config("mlib.ini.in", "lib/npy-pkg-config",
+            subst_dict)
+
+    #######################################################################
+    #                         npysort library                             #
+    #######################################################################
+
+    # This library is created for the build but it is not installed
+    npysort_sources = [join('src', 'common', 'npy_sort.h.src'),
+                       join('src', 'npysort', 'quicksort.c.src'),
+                       join('src', 'npysort', 'mergesort.c.src'),
+                       join('src', 'npysort', 'timsort.c.src'),
+                       join('src', 'npysort', 'heapsort.c.src'),
+                       join('src', 'npysort', 'radixsort.c.src'),
+                       join('src', 'common', 'npy_partition.h.src'),
+                       join('src', 'npysort', 'selection.c.src'),
+                       join('src', 'common', 'npy_binsearch.h.src'),
+                       join('src', 'npysort', 'binsearch.c.src'),
+                       ]
+    config.add_library('npysort',
+                       sources=npysort_sources,
+                       include_dirs=[])
+
+    #######################################################################
+    #                     multiarray_tests module                         #
+    #######################################################################
+
+    config.add_extension('_multiarray_tests',
+                    sources=[join('src', 'multiarray', '_multiarray_tests.c.src'),
+                             join('src', 'common', 'mem_overlap.c')],
+                    depends=[join('src', 'common', 'mem_overlap.h'),
+                             join('src', 'common', 'npy_extint128.h')],
+                    libraries=['npymath'])
+
+    #######################################################################
+    #             _multiarray_umath module - common part                  #
+    #######################################################################
+
+    common_deps = [
+            join('src', 'common', 'array_assign.h'),
+            join('src', 'common', 'binop_override.h'),
+            join('src', 'common', 'cblasfuncs.h'),
+            join('src', 'common', 'lowlevel_strided_loops.h'),
+            join('src', 'common', 'mem_overlap.h'),
+            join('src', 'common', 'npy_cblas.h'),
+            join('src', 'common', 'npy_config.h'),
+            join('src', 'common', 'npy_ctypes.h'),
+            join('src', 'common', 'npy_extint128.h'),
+            join('src', 'common', 'npy_import.h'),
+            join('src', 'common', 'npy_longdouble.h'),
+            join('src', 'common', 'templ_common.h.src'),
+            join('src', 'common', 'ucsnarrow.h'),
+            join('src', 'common', 'ufunc_override.h'),
+            join('src', 'common', 'umathmodule.h'),
+            join('src', 'common', 'numpyos.h'),
+            ]
+
+    common_src = [
+            join('src', 'common', 'array_assign.c'),
+            join('src', 'common', 'mem_overlap.c'),
+            join('src', 'common', 'npy_longdouble.c'),
+            join('src', 'common', 'templ_common.h.src'),
+            join('src', 'common', 'ucsnarrow.c'),
+            join('src', 'common', 'ufunc_override.c'),
+            join('src', 'common', 'numpyos.c'),
+            join('src', 'common', 'npy_cpu_features.c.src'),
+            ]
+
+    if os.environ.get('NPY_USE_BLAS_ILP64', "0") != "0":
+        blas_info = get_info('blas_ilp64_opt', 2)
+    else:
+        blas_info = get_info('blas_opt', 0)
+
+    have_blas = blas_info and ('HAVE_CBLAS', None) in blas_info.get('define_macros', [])
+
+    if have_blas:
+        extra_info = blas_info
+        # These files are also in MANIFEST.in so that they are always in
+        # the source distribution independently of HAVE_CBLAS.
+        common_src.extend([join('src', 'common', 'cblasfuncs.c'),
+                           join('src', 'common', 'python_xerbla.c'),
+                          ])
+        if uses_accelerate_framework(blas_info):
+            common_src.extend(get_sgemv_fix())
+    else:
+        extra_info = {}
+
+    #######################################################################
+    #             _multiarray_umath module - multiarray part              #
+    #######################################################################
+
+    multiarray_deps = [
+            join('src', 'multiarray', 'arrayobject.h'),
+            join('src', 'multiarray', 'arraytypes.h'),
+            join('src', 'multiarray', 'arrayfunction_override.h'),
+            join('src', 'multiarray', 'npy_buffer.h'),
+            join('src', 'multiarray', 'calculation.h'),
+            join('src', 'multiarray', 'common.h'),
+            join('src', 'multiarray', 'convert_datatype.h'),
+            join('src', 'multiarray', 'convert.h'),
+            join('src', 'multiarray', 'conversion_utils.h'),
+            join('src', 'multiarray', 'ctors.h'),
+            join('src', 'multiarray', 'descriptor.h'),
+            join('src', 'multiarray', 'dragon4.h'),
+            join('src', 'multiarray', 'getset.h'),
+            join('src', 'multiarray', 'hashdescr.h'),
+            join('src', 'multiarray', 'iterators.h'),
+            join('src', 'multiarray', 'mapping.h'),
+            join('src', 'multiarray', 'methods.h'),
+            join('src', 'multiarray', 'multiarraymodule.h'),
+            join('src', 'multiarray', 'nditer_impl.h'),
+            join('src', 'multiarray', 'number.h'),
+            join('src', 'multiarray', 'refcount.h'),
+            join('src', 'multiarray', 'scalartypes.h'),
+            join('src', 'multiarray', 'sequence.h'),
+            join('src', 'multiarray', 'shape.h'),
+            join('src', 'multiarray', 'strfuncs.h'),
+            join('src', 'multiarray', 'typeinfo.h'),
+            join('src', 'multiarray', 'usertypes.h'),
+            join('src', 'multiarray', 'vdot.h'),
+            join('include', 'numpy', 'arrayobject.h'),
+            join('include', 'numpy', '_neighborhood_iterator_imp.h'),
+            join('include', 'numpy', 'npy_endian.h'),
+            join('include', 'numpy', 'arrayscalars.h'),
+            join('include', 'numpy', 'noprefix.h'),
+            join('include', 'numpy', 'npy_interrupt.h'),
+            join('include', 'numpy', 'npy_3kcompat.h'),
+            join('include', 'numpy', 'npy_math.h'),
+            join('include', 'numpy', 'halffloat.h'),
+            join('include', 'numpy', 'npy_common.h'),
+            join('include', 'numpy', 'npy_os.h'),
+            join('include', 'numpy', 'utils.h'),
+            join('include', 'numpy', 'ndarrayobject.h'),
+            join('include', 'numpy', 'npy_cpu.h'),
+            join('include', 'numpy', 'numpyconfig.h'),
+            join('include', 'numpy', 'ndarraytypes.h'),
+            join('include', 'numpy', 'npy_1_7_deprecated_api.h'),
+            # add library sources as distuils does not consider libraries
+            # dependencies
+            ] + npysort_sources + npymath_sources
+
+    multiarray_src = [
+            join('src', 'multiarray', 'alloc.c'),
+            join('src', 'multiarray', 'arrayobject.c'),
+            join('src', 'multiarray', 'arraytypes.c.src'),
+            join('src', 'multiarray', 'array_assign_scalar.c'),
+            join('src', 'multiarray', 'array_assign_array.c'),
+            join('src', 'multiarray', 'arrayfunction_override.c'),
+            join('src', 'multiarray', 'buffer.c'),
+            join('src', 'multiarray', 'calculation.c'),
+            join('src', 'multiarray', 'compiled_base.c'),
+            join('src', 'multiarray', 'common.c'),
+            join('src', 'multiarray', 'convert.c'),
+            join('src', 'multiarray', 'convert_datatype.c'),
+            join('src', 'multiarray', 'conversion_utils.c'),
+            join('src', 'multiarray', 'ctors.c'),
+            join('src', 'multiarray', 'datetime.c'),
+            join('src', 'multiarray', 'datetime_strings.c'),
+            join('src', 'multiarray', 'datetime_busday.c'),
+            join('src', 'multiarray', 'datetime_busdaycal.c'),
+            join('src', 'multiarray', 'descriptor.c'),
+            join('src', 'multiarray', 'dragon4.c'),
+            join('src', 'multiarray', 'dtype_transfer.c'),
+            join('src', 'multiarray', 'einsum.c.src'),
+            join('src', 'multiarray', 'flagsobject.c'),
+            join('src', 'multiarray', 'getset.c'),
+            join('src', 'multiarray', 'hashdescr.c'),
+            join('src', 'multiarray', 'item_selection.c'),
+            join('src', 'multiarray', 'iterators.c'),
+            join('src', 'multiarray', 'lowlevel_strided_loops.c.src'),
+            join('src', 'multiarray', 'mapping.c'),
+            join('src', 'multiarray', 'methods.c'),
+            join('src', 'multiarray', 'multiarraymodule.c'),
+            join('src', 'multiarray', 'nditer_templ.c.src'),
+            join('src', 'multiarray', 'nditer_api.c'),
+            join('src', 'multiarray', 'nditer_constr.c'),
+            join('src', 'multiarray', 'nditer_pywrap.c'),
+            join('src', 'multiarray', 'number.c'),
+            join('src', 'multiarray', 'refcount.c'),
+            join('src', 'multiarray', 'sequence.c'),
+            join('src', 'multiarray', 'shape.c'),
+            join('src', 'multiarray', 'scalarapi.c'),
+            join('src', 'multiarray', 'scalartypes.c.src'),
+            join('src', 'multiarray', 'strfuncs.c'),
+            join('src', 'multiarray', 'temp_elide.c'),
+            join('src', 'multiarray', 'typeinfo.c'),
+            join('src', 'multiarray', 'usertypes.c'),
+            join('src', 'multiarray', 'vdot.c'),
+            ]
+
+    #######################################################################
+    #             _multiarray_umath module - umath part                   #
+    #######################################################################
+
+    def generate_umath_c(ext, build_dir):
+        target = join(build_dir, header_dir, '__umath_generated.c')
+        dir = os.path.dirname(target)
+        if not os.path.exists(dir):
+            os.makedirs(dir)
+        script = generate_umath_py
+        if newer(script, target):
+            with open(target, 'w') as f:
+                f.write(generate_umath.make_code(generate_umath.defdict,
+                                                 generate_umath.__file__))
+        return []
+
+    umath_src = [
+            join('src', 'umath', 'umathmodule.c'),
+            join('src', 'umath', 'reduction.c'),
+            join('src', 'umath', 'funcs.inc.src'),
+            join('src', 'umath', 'simd.inc.src'),
+            join('src', 'umath', 'loops.h.src'),
+            join('src', 'umath', 'loops.c.src'),
+            join('src', 'umath', 'matmul.h.src'),
+            join('src', 'umath', 'matmul.c.src'),
+            join('src', 'umath', 'clip.h.src'),
+            join('src', 'umath', 'clip.c.src'),
+            join('src', 'umath', 'ufunc_object.c'),
+            join('src', 'umath', 'extobj.c'),
+            join('src', 'umath', 'scalarmath.c.src'),
+            join('src', 'umath', 'ufunc_type_resolution.c'),
+            join('src', 'umath', 'override.c'),
+            ]
+
+    umath_deps = [
+            generate_umath_py,
+            join('include', 'numpy', 'npy_math.h'),
+            join('include', 'numpy', 'halffloat.h'),
+            join('src', 'multiarray', 'common.h'),
+            join('src', 'multiarray', 'number.h'),
+            join('src', 'common', 'templ_common.h.src'),
+            join('src', 'umath', 'simd.inc.src'),
+            join('src', 'umath', 'override.h'),
+            join(codegen_dir, 'generate_ufunc_api.py'),
+            ]
+
+    config.add_extension('_multiarray_umath',
+                         sources=multiarray_src + umath_src +
+                                 npymath_sources + common_src +
+                                 [generate_config_h,
+                                  generate_numpyconfig_h,
+                                  generate_numpy_api,
+                                  join(codegen_dir, 'generate_numpy_api.py'),
+                                  join('*.py'),
+                                  generate_umath_c,
+                                  generate_ufunc_api,
+                                 ],
+                         depends=deps + multiarray_deps + umath_deps +
+                                common_deps,
+                         libraries=['npymath', 'npysort'],
+                         extra_info=extra_info)
+
+    #######################################################################
+    #                        umath_tests module                           #
+    #######################################################################
+
+    config.add_extension('_umath_tests',
+                    sources=[join('src', 'umath', '_umath_tests.c.src')])
+
+    #######################################################################
+    #                   custom rational dtype module                      #
+    #######################################################################
+
+    config.add_extension('_rational_tests',
+                    sources=[join('src', 'umath', '_rational_tests.c.src')])
+
+    #######################################################################
+    #                        struct_ufunc_test module                     #
+    #######################################################################
+
+    config.add_extension('_struct_ufunc_tests',
+                    sources=[join('src', 'umath', '_struct_ufunc_tests.c.src')])
+
+
+    #######################################################################
+    #                        operand_flag_tests module                    #
+    #######################################################################
+
+    config.add_extension('_operand_flag_tests',
+                    sources=[join('src', 'umath', '_operand_flag_tests.c.src')])
+
+    config.add_subpackage('tests')
+    config.add_data_dir('tests/data')
+
+    config.make_svn_version_py()
+
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/core/setup_common.py b/venv/Lib/site-packages/numpy/core/setup_common.py
new file mode 100644
index 000000000..63c4a76a9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/setup_common.py
@@ -0,0 +1,432 @@
+# Code common to build tools
+import sys
+import warnings
+import copy
+import textwrap
+
+from numpy.distutils.misc_util import mingw32
+
+
+#-------------------
+# Versioning support
+#-------------------
+# How to change C_API_VERSION ?
+#   - increase C_API_VERSION value
+#   - record the hash for the new C API with the cversions.py script
+#   and add the hash to cversions.txt
+# The hash values are used to remind developers when the C API number was not
+# updated - generates a MismatchCAPIWarning warning which is turned into an
+# exception for released version.
+
+# Binary compatibility version number. This number is increased whenever the
+# C-API is changed such that binary compatibility is broken, i.e. whenever a
+# recompile of extension modules is needed.
+C_ABI_VERSION = 0x01000009
+
+# Minor API version.  This number is increased whenever a change is made to the
+# C-API -- whether it breaks binary compatibility or not.  Some changes, such
+# as adding a function pointer to the end of the function table, can be made
+# without breaking binary compatibility.  In this case, only the C_API_VERSION
+# (*not* C_ABI_VERSION) would be increased.  Whenever binary compatibility is
+# broken, both C_API_VERSION and C_ABI_VERSION should be increased.
+#
+# 0x00000008 - 1.7.x
+# 0x00000009 - 1.8.x
+# 0x00000009 - 1.9.x
+# 0x0000000a - 1.10.x
+# 0x0000000a - 1.11.x
+# 0x0000000a - 1.12.x
+# 0x0000000b - 1.13.x
+# 0x0000000c - 1.14.x
+# 0x0000000c - 1.15.x
+# 0x0000000d - 1.16.x
+C_API_VERSION = 0x0000000d
+
+class MismatchCAPIWarning(Warning):
+    pass
+
+def is_released(config):
+    """Return True if a released version of numpy is detected."""
+    from distutils.version import LooseVersion
+
+    v = config.get_version('../version.py')
+    if v is None:
+        raise ValueError("Could not get version")
+    pv = LooseVersion(vstring=v).version
+    if len(pv) > 3:
+        return False
+    return True
+
+def get_api_versions(apiversion, codegen_dir):
+    """
+    Return current C API checksum and the recorded checksum.
+
+    Return current C API checksum and the recorded checksum for the given
+    version of the C API version.
+
+    """
+    # Compute the hash of the current API as defined in the .txt files in
+    # code_generators
+    sys.path.insert(0, codegen_dir)
+    try:
+        m = __import__('genapi')
+        numpy_api = __import__('numpy_api')
+        curapi_hash = m.fullapi_hash(numpy_api.full_api)
+        apis_hash = m.get_versions_hash()
+    finally:
+        del sys.path[0]
+
+    return curapi_hash, apis_hash[apiversion]
+
+def check_api_version(apiversion, codegen_dir):
+    """Emits a MismatchCAPIWarning if the C API version needs updating."""
+    curapi_hash, api_hash = get_api_versions(apiversion, codegen_dir)
+
+    # If different hash, it means that the api .txt files in
+    # codegen_dir have been updated without the API version being
+    # updated. Any modification in those .txt files should be reflected
+    # in the api and eventually abi versions.
+    # To compute the checksum of the current API, use numpy/core/cversions.py
+    if not curapi_hash == api_hash:
+        msg = ("API mismatch detected, the C API version "
+               "numbers have to be updated. Current C api version is %d, "
+               "with checksum %s, but recorded checksum for C API version %d "
+               "in core/codegen_dir/cversions.txt is %s. If functions were "
+               "added in the C API, you have to update C_API_VERSION in %s."
+               )
+        warnings.warn(msg % (apiversion, curapi_hash, apiversion, api_hash,
+                             __file__),
+                      MismatchCAPIWarning, stacklevel=2)
+# Mandatory functions: if not found, fail the build
+MANDATORY_FUNCS = ["sin", "cos", "tan", "sinh", "cosh", "tanh", "fabs",
+        "floor", "ceil", "sqrt", "log10", "log", "exp", "asin",
+        "acos", "atan", "fmod", 'modf', 'frexp', 'ldexp']
+
+# Standard functions which may not be available and for which we have a
+# replacement implementation. Note that some of these are C99 functions.
+OPTIONAL_STDFUNCS = ["expm1", "log1p", "acosh", "asinh", "atanh",
+        "rint", "trunc", "exp2", "log2", "hypot", "atan2", "pow",
+        "copysign", "nextafter", "ftello", "fseeko",
+        "strtoll", "strtoull", "cbrt", "strtold_l", "fallocate",
+        "backtrace", "madvise"]
+
+
+OPTIONAL_HEADERS = [
+# sse headers only enabled automatically on amd64/x32 builds
+                "xmmintrin.h",  # SSE
+                "emmintrin.h",  # SSE2
+                "immintrin.h",  # AVX
+                "features.h",  # for glibc version linux
+                "xlocale.h",  # see GH#8367
+                "dlfcn.h", # dladdr
+                "sys/mman.h", #madvise
+]
+
+# optional gcc compiler builtins and their call arguments and optional a
+# required header and definition name (HAVE_ prepended)
+# call arguments are required as the compiler will do strict signature checking
+OPTIONAL_INTRINSICS = [("__builtin_isnan", '5.'),
+                       ("__builtin_isinf", '5.'),
+                       ("__builtin_isfinite", '5.'),
+                       ("__builtin_bswap32", '5u'),
+                       ("__builtin_bswap64", '5u'),
+                       ("__builtin_expect", '5, 0'),
+                       ("__builtin_mul_overflow", '5, 5, (int*)5'),
+                       # MMX only needed for icc, but some clangs don't have it
+                       ("_m_from_int64", '0', "emmintrin.h"),
+                       ("_mm_load_ps", '(float*)0', "xmmintrin.h"),  # SSE
+                       ("_mm_prefetch", '(float*)0, _MM_HINT_NTA',
+                        "xmmintrin.h"),  # SSE
+                       ("_mm_load_pd", '(double*)0', "emmintrin.h"),  # SSE2
+                       ("__builtin_prefetch", "(float*)0, 0, 3"),
+                       # check that the linker can handle avx
+                       ("__asm__ volatile", '"vpand %xmm1, %xmm2, %xmm3"',
+                        "stdio.h", "LINK_AVX"),
+                       ("__asm__ volatile", '"vpand %ymm1, %ymm2, %ymm3"',
+                        "stdio.h", "LINK_AVX2"),
+                       ("__asm__ volatile", '"vpaddd %zmm1, %zmm2, %zmm3"',
+                        "stdio.h", "LINK_AVX512F"),
+                       ("__asm__ volatile", '"xgetbv"', "stdio.h", "XGETBV"),
+                       ]
+
+# function attributes
+# tested via "int %s %s(void *);" % (attribute, name)
+# function name will be converted to HAVE_<upper-case-name> preprocessor macro
+OPTIONAL_FUNCTION_ATTRIBUTES = [('__attribute__((optimize("unroll-loops")))',
+                                'attribute_optimize_unroll_loops'),
+                                ('__attribute__((optimize("O3")))',
+                                 'attribute_optimize_opt_3'),
+                                ('__attribute__((nonnull (1)))',
+                                 'attribute_nonnull'),
+                                ('__attribute__((target ("avx")))',
+                                 'attribute_target_avx'),
+                                ('__attribute__((target ("avx2")))',
+                                 'attribute_target_avx2'),
+                                ('__attribute__((target ("avx512f")))',
+                                 'attribute_target_avx512f'),
+                                ]
+
+# function attributes with intrinsics
+# To ensure your compiler can compile avx intrinsics with just the attributes
+# gcc 4.8.4 support attributes but not with intrisics
+# tested via "#include<%s> int %s %s(void *){code; return 0;};" % (header, attribute, name, code)
+# function name will be converted to HAVE_<upper-case-name> preprocessor macro
+OPTIONAL_FUNCTION_ATTRIBUTES_WITH_INTRINSICS = [('__attribute__((target("avx2,fma")))',
+                                'attribute_target_avx2_with_intrinsics',
+                                '__m256 temp = _mm256_set1_ps(1.0); temp = \
+                                _mm256_fmadd_ps(temp, temp, temp)',
+                                'immintrin.h'),
+                                ('__attribute__((target("avx512f")))',
+                                'attribute_target_avx512f_with_intrinsics',
+                                '__m512 temp = _mm512_set1_ps(1.0)',
+                                'immintrin.h'),
+                                ]
+
+# variable attributes tested via "int %s a" % attribute
+OPTIONAL_VARIABLE_ATTRIBUTES = ["__thread", "__declspec(thread)"]
+
+# Subset of OPTIONAL_STDFUNCS which may already have HAVE_* defined by Python.h
+OPTIONAL_STDFUNCS_MAYBE = [
+    "expm1", "log1p", "acosh", "atanh", "asinh", "hypot", "copysign",
+    "ftello", "fseeko"
+    ]
+
+# C99 functions: float and long double versions
+C99_FUNCS = [
+    "sin", "cos", "tan", "sinh", "cosh", "tanh", "fabs", "floor", "ceil",
+    "rint", "trunc", "sqrt", "log10", "log", "log1p", "exp", "expm1",
+    "asin", "acos", "atan", "asinh", "acosh", "atanh", "hypot", "atan2",
+    "pow", "fmod", "modf", 'frexp', 'ldexp', "exp2", "log2", "copysign",
+    "nextafter", "cbrt"
+    ]
+C99_FUNCS_SINGLE = [f + 'f' for f in C99_FUNCS]
+C99_FUNCS_EXTENDED = [f + 'l' for f in C99_FUNCS]
+C99_COMPLEX_TYPES = [
+    'complex double', 'complex float', 'complex long double'
+    ]
+C99_COMPLEX_FUNCS = [
+    "cabs", "cacos", "cacosh", "carg", "casin", "casinh", "catan",
+    "catanh", "ccos", "ccosh", "cexp", "cimag", "clog", "conj", "cpow",
+    "cproj", "creal", "csin", "csinh", "csqrt", "ctan", "ctanh"
+    ]
+
+def fname2def(name):
+    return "HAVE_%s" % name.upper()
+
+def sym2def(symbol):
+    define = symbol.replace(' ', '')
+    return define.upper()
+
+def type2def(symbol):
+    define = symbol.replace(' ', '_')
+    return define.upper()
+
+# Code to detect long double representation taken from MPFR m4 macro
+def check_long_double_representation(cmd):
+    cmd._check_compiler()
+    body = LONG_DOUBLE_REPRESENTATION_SRC % {'type': 'long double'}
+
+    # Disable whole program optimization (the default on vs2015, with python 3.5+)
+    # which generates intermediary object files and prevents checking the
+    # float representation.
+    if sys.platform == "win32" and not mingw32():
+        try:
+            cmd.compiler.compile_options.remove("/GL")
+        except (AttributeError, ValueError):
+            pass
+
+    # Disable multi-file interprocedural optimization in the Intel compiler on Linux
+    # which generates intermediary object files and prevents checking the
+    # float representation.
+    elif (sys.platform != "win32"
+            and cmd.compiler.compiler_type.startswith('intel')
+            and '-ipo' in cmd.compiler.cc_exe):
+        newcompiler = cmd.compiler.cc_exe.replace(' -ipo', '')
+        cmd.compiler.set_executables(
+            compiler=newcompiler,
+            compiler_so=newcompiler,
+            compiler_cxx=newcompiler,
+            linker_exe=newcompiler,
+            linker_so=newcompiler + ' -shared'
+        )
+
+    # We need to use _compile because we need the object filename
+    src, obj = cmd._compile(body, None, None, 'c')
+    try:
+        ltype = long_double_representation(pyod(obj))
+        return ltype
+    except ValueError:
+        # try linking to support CC="gcc -flto" or icc -ipo
+        # struct needs to be volatile so it isn't optimized away
+        # additionally "clang -flto" requires the foo struct to be used
+        body = body.replace('struct', 'volatile struct')
+        body += "int main(void) { return foo.before[0]; }\n"
+        src, obj = cmd._compile(body, None, None, 'c')
+        cmd.temp_files.append("_configtest")
+        cmd.compiler.link_executable([obj], "_configtest")
+        ltype = long_double_representation(pyod("_configtest"))
+        return ltype
+    finally:
+        cmd._clean()
+
+LONG_DOUBLE_REPRESENTATION_SRC = r"""
+/* "before" is 16 bytes to ensure there's no padding between it and "x".
+ *    We're not expecting any "long double" bigger than 16 bytes or with
+ *       alignment requirements stricter than 16 bytes.  */
+typedef %(type)s test_type;
+
+struct {
+        char         before[16];
+        test_type    x;
+        char         after[8];
+} foo = {
+        { '\0', '\0', '\0', '\0', '\0', '\0', '\0', '\0',
+          '\001', '\043', '\105', '\147', '\211', '\253', '\315', '\357' },
+        -123456789.0,
+        { '\376', '\334', '\272', '\230', '\166', '\124', '\062', '\020' }
+};
+"""
+
+def pyod(filename):
+    """Python implementation of the od UNIX utility (od -b, more exactly).
+
+    Parameters
+    ----------
+    filename : str
+        name of the file to get the dump from.
+
+    Returns
+    -------
+    out : seq
+        list of lines of od output
+
+    Note
+    ----
+    We only implement enough to get the necessary information for long double
+    representation, this is not intended as a compatible replacement for od.
+    """
+    out = []
+    with open(filename, 'rb') as fid:
+        yo2 = [oct(o)[2:] for o in fid.read()]
+    for i in range(0, len(yo2), 16):
+        line = ['%07d' % int(oct(i)[2:])]
+        line.extend(['%03d' % int(c) for c in yo2[i:i+16]])
+        out.append(" ".join(line))
+    return out
+
+
+_BEFORE_SEQ = ['000', '000', '000', '000', '000', '000', '000', '000',
+              '001', '043', '105', '147', '211', '253', '315', '357']
+_AFTER_SEQ = ['376', '334', '272', '230', '166', '124', '062', '020']
+
+_IEEE_DOUBLE_BE = ['301', '235', '157', '064', '124', '000', '000', '000']
+_IEEE_DOUBLE_LE = _IEEE_DOUBLE_BE[::-1]
+_INTEL_EXTENDED_12B = ['000', '000', '000', '000', '240', '242', '171', '353',
+                       '031', '300', '000', '000']
+_INTEL_EXTENDED_16B = ['000', '000', '000', '000', '240', '242', '171', '353',
+                       '031', '300', '000', '000', '000', '000', '000', '000']
+_MOTOROLA_EXTENDED_12B = ['300', '031', '000', '000', '353', '171',
+                          '242', '240', '000', '000', '000', '000']
+_IEEE_QUAD_PREC_BE = ['300', '031', '326', '363', '105', '100', '000', '000',
+                      '000', '000', '000', '000', '000', '000', '000', '000']
+_IEEE_QUAD_PREC_LE = _IEEE_QUAD_PREC_BE[::-1]
+_IBM_DOUBLE_DOUBLE_BE = (['301', '235', '157', '064', '124', '000', '000', '000'] +
+                     ['000'] * 8)
+_IBM_DOUBLE_DOUBLE_LE = (['000', '000', '000', '124', '064', '157', '235', '301'] +
+                     ['000'] * 8)
+
+def long_double_representation(lines):
+    """Given a binary dump as given by GNU od -b, look for long double
+    representation."""
+
+    # Read contains a list of 32 items, each item is a byte (in octal
+    # representation, as a string). We 'slide' over the output until read is of
+    # the form before_seq + content + after_sequence, where content is the long double
+    # representation:
+    #  - content is 12 bytes: 80 bits Intel representation
+    #  - content is 16 bytes: 80 bits Intel representation (64 bits) or quad precision
+    #  - content is 8 bytes: same as double (not implemented yet)
+    read = [''] * 32
+    saw = None
+    for line in lines:
+        # we skip the first word, as od -b output an index at the beginning of
+        # each line
+        for w in line.split()[1:]:
+            read.pop(0)
+            read.append(w)
+
+            # If the end of read is equal to the after_sequence, read contains
+            # the long double
+            if read[-8:] == _AFTER_SEQ:
+                saw = copy.copy(read)
+                # if the content was 12 bytes, we only have 32 - 8 - 12 = 12
+                # "before" bytes. In other words the first 4 "before" bytes went
+                # past the sliding window.
+                if read[:12] == _BEFORE_SEQ[4:]:
+                    if read[12:-8] == _INTEL_EXTENDED_12B:
+                        return 'INTEL_EXTENDED_12_BYTES_LE'
+                    if read[12:-8] == _MOTOROLA_EXTENDED_12B:
+                        return 'MOTOROLA_EXTENDED_12_BYTES_BE'
+                # if the content was 16 bytes, we are left with 32-8-16 = 16
+                # "before" bytes, so 8 went past the sliding window.
+                elif read[:8] == _BEFORE_SEQ[8:]:
+                    if read[8:-8] == _INTEL_EXTENDED_16B:
+                        return 'INTEL_EXTENDED_16_BYTES_LE'
+                    elif read[8:-8] == _IEEE_QUAD_PREC_BE:
+                        return 'IEEE_QUAD_BE'
+                    elif read[8:-8] == _IEEE_QUAD_PREC_LE:
+                        return 'IEEE_QUAD_LE'
+                    elif read[8:-8] == _IBM_DOUBLE_DOUBLE_LE:
+                        return 'IBM_DOUBLE_DOUBLE_LE'
+                    elif read[8:-8] == _IBM_DOUBLE_DOUBLE_BE:
+                        return 'IBM_DOUBLE_DOUBLE_BE'
+                # if the content was 8 bytes, left with 32-8-8 = 16 bytes
+                elif read[:16] == _BEFORE_SEQ:
+                    if read[16:-8] == _IEEE_DOUBLE_LE:
+                        return 'IEEE_DOUBLE_LE'
+                    elif read[16:-8] == _IEEE_DOUBLE_BE:
+                        return 'IEEE_DOUBLE_BE'
+
+    if saw is not None:
+        raise ValueError("Unrecognized format (%s)" % saw)
+    else:
+        # We never detected the after_sequence
+        raise ValueError("Could not lock sequences (%s)" % saw)
+
+
+def check_for_right_shift_internal_compiler_error(cmd):
+    """
+    On our arm CI, this fails with an internal compilation error
+
+    The failure looks like the following, and can be reproduced on ARM64 GCC 5.4:
+
+        <source>: In function 'right_shift':
+        <source>:4:20: internal compiler error: in expand_shift_1, at expmed.c:2349
+               ip1[i] = ip1[i] >> in2;
+                      ^
+        Please submit a full bug report,
+        with preprocessed source if appropriate.
+        See <http://gcc.gnu.org/bugs.html> for instructions.
+        Compiler returned: 1
+
+    This function returns True if this compiler bug is present, and we need to
+    turn off optimization for the function
+    """
+    cmd._check_compiler()
+    has_optimize = cmd.try_compile(textwrap.dedent("""\
+        __attribute__((optimize("O3"))) void right_shift() {}
+        """), None, None)
+    if not has_optimize:
+        return False
+
+    no_err = cmd.try_compile(textwrap.dedent("""\
+        typedef long the_type;  /* fails also for unsigned and long long */
+        __attribute__((optimize("O3"))) void right_shift(the_type in2, the_type *ip1, int n) {
+            for (int i = 0; i < n; i++) {
+                if (in2 < (the_type)sizeof(the_type) * 8) {
+                    ip1[i] = ip1[i] >> in2;
+                }
+            }
+        }
+        """), None, None)
+    return not no_err
diff --git a/venv/Lib/site-packages/numpy/core/shape_base.py b/venv/Lib/site-packages/numpy/core/shape_base.py
new file mode 100644
index 000000000..7a76bbf9d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/shape_base.py
@@ -0,0 +1,900 @@
+__all__ = ['atleast_1d', 'atleast_2d', 'atleast_3d', 'block', 'hstack',
+           'stack', 'vstack']
+
+import functools
+import itertools
+import operator
+import warnings
+
+from . import numeric as _nx
+from . import overrides
+from ._asarray import array, asanyarray
+from .multiarray import normalize_axis_index
+from . import fromnumeric as _from_nx
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+def _atleast_1d_dispatcher(*arys):
+    return arys
+
+
+@array_function_dispatch(_atleast_1d_dispatcher)
+def atleast_1d(*arys):
+    """
+    Convert inputs to arrays with at least one dimension.
+
+    Scalar inputs are converted to 1-dimensional arrays, whilst
+    higher-dimensional inputs are preserved.
+
+    Parameters
+    ----------
+    arys1, arys2, ... : array_like
+        One or more input arrays.
+
+    Returns
+    -------
+    ret : ndarray
+        An array, or list of arrays, each with ``a.ndim >= 1``.
+        Copies are made only if necessary.
+
+    See Also
+    --------
+    atleast_2d, atleast_3d
+
+    Examples
+    --------
+    >>> np.atleast_1d(1.0)
+    array([1.])
+
+    >>> x = np.arange(9.0).reshape(3,3)
+    >>> np.atleast_1d(x)
+    array([[0., 1., 2.],
+           [3., 4., 5.],
+           [6., 7., 8.]])
+    >>> np.atleast_1d(x) is x
+    True
+
+    >>> np.atleast_1d(1, [3, 4])
+    [array([1]), array([3, 4])]
+
+    """
+    res = []
+    for ary in arys:
+        ary = asanyarray(ary)
+        if ary.ndim == 0:
+            result = ary.reshape(1)
+        else:
+            result = ary
+        res.append(result)
+    if len(res) == 1:
+        return res[0]
+    else:
+        return res
+
+
+def _atleast_2d_dispatcher(*arys):
+    return arys
+
+
+@array_function_dispatch(_atleast_2d_dispatcher)
+def atleast_2d(*arys):
+    """
+    View inputs as arrays with at least two dimensions.
+
+    Parameters
+    ----------
+    arys1, arys2, ... : array_like
+        One or more array-like sequences.  Non-array inputs are converted
+        to arrays.  Arrays that already have two or more dimensions are
+        preserved.
+
+    Returns
+    -------
+    res, res2, ... : ndarray
+        An array, or list of arrays, each with ``a.ndim >= 2``.
+        Copies are avoided where possible, and views with two or more
+        dimensions are returned.
+
+    See Also
+    --------
+    atleast_1d, atleast_3d
+
+    Examples
+    --------
+    >>> np.atleast_2d(3.0)
+    array([[3.]])
+
+    >>> x = np.arange(3.0)
+    >>> np.atleast_2d(x)
+    array([[0., 1., 2.]])
+    >>> np.atleast_2d(x).base is x
+    True
+
+    >>> np.atleast_2d(1, [1, 2], [[1, 2]])
+    [array([[1]]), array([[1, 2]]), array([[1, 2]])]
+
+    """
+    res = []
+    for ary in arys:
+        ary = asanyarray(ary)
+        if ary.ndim == 0:
+            result = ary.reshape(1, 1)
+        elif ary.ndim == 1:
+            result = ary[_nx.newaxis, :]
+        else:
+            result = ary
+        res.append(result)
+    if len(res) == 1:
+        return res[0]
+    else:
+        return res
+
+
+def _atleast_3d_dispatcher(*arys):
+    return arys
+
+
+@array_function_dispatch(_atleast_3d_dispatcher)
+def atleast_3d(*arys):
+    """
+    View inputs as arrays with at least three dimensions.
+
+    Parameters
+    ----------
+    arys1, arys2, ... : array_like
+        One or more array-like sequences.  Non-array inputs are converted to
+        arrays.  Arrays that already have three or more dimensions are
+        preserved.
+
+    Returns
+    -------
+    res1, res2, ... : ndarray
+        An array, or list of arrays, each with ``a.ndim >= 3``.  Copies are
+        avoided where possible, and views with three or more dimensions are
+        returned.  For example, a 1-D array of shape ``(N,)`` becomes a view
+        of shape ``(1, N, 1)``, and a 2-D array of shape ``(M, N)`` becomes a
+        view of shape ``(M, N, 1)``.
+
+    See Also
+    --------
+    atleast_1d, atleast_2d
+
+    Examples
+    --------
+    >>> np.atleast_3d(3.0)
+    array([[[3.]]])
+
+    >>> x = np.arange(3.0)
+    >>> np.atleast_3d(x).shape
+    (1, 3, 1)
+
+    >>> x = np.arange(12.0).reshape(4,3)
+    >>> np.atleast_3d(x).shape
+    (4, 3, 1)
+    >>> np.atleast_3d(x).base is x.base  # x is a reshape, so not base itself
+    True
+
+    >>> for arr in np.atleast_3d([1, 2], [[1, 2]], [[[1, 2]]]):
+    ...     print(arr, arr.shape) # doctest: +SKIP
+    ...
+    [[[1]
+      [2]]] (1, 2, 1)
+    [[[1]
+      [2]]] (1, 2, 1)
+    [[[1 2]]] (1, 1, 2)
+
+    """
+    res = []
+    for ary in arys:
+        ary = asanyarray(ary)
+        if ary.ndim == 0:
+            result = ary.reshape(1, 1, 1)
+        elif ary.ndim == 1:
+            result = ary[_nx.newaxis, :, _nx.newaxis]
+        elif ary.ndim == 2:
+            result = ary[:, :, _nx.newaxis]
+        else:
+            result = ary
+        res.append(result)
+    if len(res) == 1:
+        return res[0]
+    else:
+        return res
+
+
+def _arrays_for_stack_dispatcher(arrays, stacklevel=4):
+    if not hasattr(arrays, '__getitem__') and hasattr(arrays, '__iter__'):
+        warnings.warn('arrays to stack must be passed as a "sequence" type '
+                      'such as list or tuple. Support for non-sequence '
+                      'iterables such as generators is deprecated as of '
+                      'NumPy 1.16 and will raise an error in the future.',
+                      FutureWarning, stacklevel=stacklevel)
+        return ()
+    return arrays
+
+
+def _vhstack_dispatcher(tup):
+    return _arrays_for_stack_dispatcher(tup)
+
+
+@array_function_dispatch(_vhstack_dispatcher)
+def vstack(tup):
+    """
+    Stack arrays in sequence vertically (row wise).
+
+    This is equivalent to concatenation along the first axis after 1-D arrays
+    of shape `(N,)` have been reshaped to `(1,N)`. Rebuilds arrays divided by
+    `vsplit`.
+
+    This function makes most sense for arrays with up to 3 dimensions. For
+    instance, for pixel-data with a height (first axis), width (second axis),
+    and r/g/b channels (third axis). The functions `concatenate`, `stack` and
+    `block` provide more general stacking and concatenation operations.
+
+    Parameters
+    ----------
+    tup : sequence of ndarrays
+        The arrays must have the same shape along all but the first axis.
+        1-D arrays must have the same length.
+
+    Returns
+    -------
+    stacked : ndarray
+        The array formed by stacking the given arrays, will be at least 2-D.
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    stack : Join a sequence of arrays along a new axis.
+    block : Assemble an nd-array from nested lists of blocks.
+    hstack : Stack arrays in sequence horizontally (column wise).
+    dstack : Stack arrays in sequence depth wise (along third axis).
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+    vsplit : Split an array into multiple sub-arrays vertically (row-wise).
+
+    Examples
+    --------
+    >>> a = np.array([1, 2, 3])
+    >>> b = np.array([2, 3, 4])
+    >>> np.vstack((a,b))
+    array([[1, 2, 3],
+           [2, 3, 4]])
+
+    >>> a = np.array([[1], [2], [3]])
+    >>> b = np.array([[2], [3], [4]])
+    >>> np.vstack((a,b))
+    array([[1],
+           [2],
+           [3],
+           [2],
+           [3],
+           [4]])
+
+    """
+    if not overrides.ARRAY_FUNCTION_ENABLED:
+        # raise warning if necessary
+        _arrays_for_stack_dispatcher(tup, stacklevel=2)
+    arrs = atleast_2d(*tup)
+    if not isinstance(arrs, list):
+        arrs = [arrs]
+    return _nx.concatenate(arrs, 0)
+
+
+@array_function_dispatch(_vhstack_dispatcher)
+def hstack(tup):
+    """
+    Stack arrays in sequence horizontally (column wise).
+
+    This is equivalent to concatenation along the second axis, except for 1-D
+    arrays where it concatenates along the first axis. Rebuilds arrays divided
+    by `hsplit`.
+
+    This function makes most sense for arrays with up to 3 dimensions. For
+    instance, for pixel-data with a height (first axis), width (second axis),
+    and r/g/b channels (third axis). The functions `concatenate`, `stack` and
+    `block` provide more general stacking and concatenation operations.
+
+    Parameters
+    ----------
+    tup : sequence of ndarrays
+        The arrays must have the same shape along all but the second axis,
+        except 1-D arrays which can be any length.
+
+    Returns
+    -------
+    stacked : ndarray
+        The array formed by stacking the given arrays.
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    stack : Join a sequence of arrays along a new axis.
+    block : Assemble an nd-array from nested lists of blocks.
+    vstack : Stack arrays in sequence vertically (row wise).
+    dstack : Stack arrays in sequence depth wise (along third axis).
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+    hsplit : Split an array into multiple sub-arrays horizontally (column-wise).
+
+    Examples
+    --------
+    >>> a = np.array((1,2,3))
+    >>> b = np.array((2,3,4))
+    >>> np.hstack((a,b))
+    array([1, 2, 3, 2, 3, 4])
+    >>> a = np.array([[1],[2],[3]])
+    >>> b = np.array([[2],[3],[4]])
+    >>> np.hstack((a,b))
+    array([[1, 2],
+           [2, 3],
+           [3, 4]])
+
+    """
+    if not overrides.ARRAY_FUNCTION_ENABLED:
+        # raise warning if necessary
+        _arrays_for_stack_dispatcher(tup, stacklevel=2)
+
+    arrs = atleast_1d(*tup)
+    if not isinstance(arrs, list):
+        arrs = [arrs]
+    # As a special case, dimension 0 of 1-dimensional arrays is "horizontal"
+    if arrs and arrs[0].ndim == 1:
+        return _nx.concatenate(arrs, 0)
+    else:
+        return _nx.concatenate(arrs, 1)
+
+
+def _stack_dispatcher(arrays, axis=None, out=None):
+    arrays = _arrays_for_stack_dispatcher(arrays, stacklevel=6)
+    if out is not None:
+        # optimize for the typical case where only arrays is provided
+        arrays = list(arrays)
+        arrays.append(out)
+    return arrays
+
+
+@array_function_dispatch(_stack_dispatcher)
+def stack(arrays, axis=0, out=None):
+    """
+    Join a sequence of arrays along a new axis.
+
+    The ``axis`` parameter specifies the index of the new axis in the
+    dimensions of the result. For example, if ``axis=0`` it will be the first
+    dimension and if ``axis=-1`` it will be the last dimension.
+
+    .. versionadded:: 1.10.0
+
+    Parameters
+    ----------
+    arrays : sequence of array_like
+        Each array must have the same shape.
+
+    axis : int, optional
+        The axis in the result array along which the input arrays are stacked.
+
+    out : ndarray, optional
+        If provided, the destination to place the result. The shape must be
+        correct, matching that of what stack would have returned if no
+        out argument were specified.
+
+    Returns
+    -------
+    stacked : ndarray
+        The stacked array has one more dimension than the input arrays.
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    block : Assemble an nd-array from nested lists of blocks.
+    split : Split array into a list of multiple sub-arrays of equal size.
+
+    Examples
+    --------
+    >>> arrays = [np.random.randn(3, 4) for _ in range(10)]
+    >>> np.stack(arrays, axis=0).shape
+    (10, 3, 4)
+
+    >>> np.stack(arrays, axis=1).shape
+    (3, 10, 4)
+
+    >>> np.stack(arrays, axis=2).shape
+    (3, 4, 10)
+
+    >>> a = np.array([1, 2, 3])
+    >>> b = np.array([2, 3, 4])
+    >>> np.stack((a, b))
+    array([[1, 2, 3],
+           [2, 3, 4]])
+
+    >>> np.stack((a, b), axis=-1)
+    array([[1, 2],
+           [2, 3],
+           [3, 4]])
+
+    """
+    if not overrides.ARRAY_FUNCTION_ENABLED:
+        # raise warning if necessary
+        _arrays_for_stack_dispatcher(arrays, stacklevel=2)
+
+    arrays = [asanyarray(arr) for arr in arrays]
+    if not arrays:
+        raise ValueError('need at least one array to stack')
+
+    shapes = {arr.shape for arr in arrays}
+    if len(shapes) != 1:
+        raise ValueError('all input arrays must have the same shape')
+
+    result_ndim = arrays[0].ndim + 1
+    axis = normalize_axis_index(axis, result_ndim)
+
+    sl = (slice(None),) * axis + (_nx.newaxis,)
+    expanded_arrays = [arr[sl] for arr in arrays]
+    return _nx.concatenate(expanded_arrays, axis=axis, out=out)
+
+
+# Internal functions to eliminate the overhead of repeated dispatch in one of
+# the two possible paths inside np.block.
+# Use getattr to protect against __array_function__ being disabled.
+_size = getattr(_from_nx.size, '__wrapped__', _from_nx.size)
+_ndim = getattr(_from_nx.ndim, '__wrapped__', _from_nx.ndim)
+_concatenate = getattr(_from_nx.concatenate, '__wrapped__', _from_nx.concatenate)
+
+
+def _block_format_index(index):
+    """
+    Convert a list of indices ``[0, 1, 2]`` into ``"arrays[0][1][2]"``.
+    """
+    idx_str = ''.join('[{}]'.format(i) for i in index if i is not None)
+    return 'arrays' + idx_str
+
+
+def _block_check_depths_match(arrays, parent_index=[]):
+    """
+    Recursive function checking that the depths of nested lists in `arrays`
+    all match. Mismatch raises a ValueError as described in the block
+    docstring below.
+
+    The entire index (rather than just the depth) needs to be calculated
+    for each innermost list, in case an error needs to be raised, so that
+    the index of the offending list can be printed as part of the error.
+
+    Parameters
+    ----------
+    arrays : nested list of arrays
+        The arrays to check
+    parent_index : list of int
+        The full index of `arrays` within the nested lists passed to
+        `_block_check_depths_match` at the top of the recursion.
+
+    Returns
+    -------
+    first_index : list of int
+        The full index of an element from the bottom of the nesting in
+        `arrays`. If any element at the bottom is an empty list, this will
+        refer to it, and the last index along the empty axis will be None.
+    max_arr_ndim : int
+        The maximum of the ndims of the arrays nested in `arrays`.
+    final_size: int
+        The number of elements in the final array. This is used the motivate
+        the choice of algorithm used using benchmarking wisdom.
+
+    """
+    if type(arrays) is tuple:
+        # not strictly necessary, but saves us from:
+        #  - more than one way to do things - no point treating tuples like
+        #    lists
+        #  - horribly confusing behaviour that results when tuples are
+        #    treated like ndarray
+        raise TypeError(
+            '{} is a tuple. '
+            'Only lists can be used to arrange blocks, and np.block does '
+            'not allow implicit conversion from tuple to ndarray.'.format(
+                _block_format_index(parent_index)
+            )
+        )
+    elif type(arrays) is list and len(arrays) > 0:
+        idxs_ndims = (_block_check_depths_match(arr, parent_index + [i])
+                      for i, arr in enumerate(arrays))
+
+        first_index, max_arr_ndim, final_size = next(idxs_ndims)
+        for index, ndim, size in idxs_ndims:
+            final_size += size
+            if ndim > max_arr_ndim:
+                max_arr_ndim = ndim
+            if len(index) != len(first_index):
+                raise ValueError(
+                    "List depths are mismatched. First element was at depth "
+                    "{}, but there is an element at depth {} ({})".format(
+                        len(first_index),
+                        len(index),
+                        _block_format_index(index)
+                    )
+                )
+            # propagate our flag that indicates an empty list at the bottom
+            if index[-1] is None:
+                first_index = index
+
+        return first_index, max_arr_ndim, final_size
+    elif type(arrays) is list and len(arrays) == 0:
+        # We've 'bottomed out' on an empty list
+        return parent_index + [None], 0, 0
+    else:
+        # We've 'bottomed out' - arrays is either a scalar or an array
+        size = _size(arrays)
+        return parent_index, _ndim(arrays), size
+
+
+def _atleast_nd(a, ndim):
+    # Ensures `a` has at least `ndim` dimensions by prepending
+    # ones to `a.shape` as necessary
+    return array(a, ndmin=ndim, copy=False, subok=True)
+
+
+def _accumulate(values):
+    return list(itertools.accumulate(values))
+
+
+def _concatenate_shapes(shapes, axis):
+    """Given array shapes, return the resulting shape and slices prefixes.
+
+    These help in nested concatation.
+    Returns
+    -------
+    shape: tuple of int
+        This tuple satisfies:
+        ```
+        shape, _ = _concatenate_shapes([arr.shape for shape in arrs], axis)
+        shape == concatenate(arrs, axis).shape
+        ```
+
+    slice_prefixes: tuple of (slice(start, end), )
+        For a list of arrays being concatenated, this returns the slice
+        in the larger array at axis that needs to be sliced into.
+
+        For example, the following holds:
+        ```
+        ret = concatenate([a, b, c], axis)
+        _, (sl_a, sl_b, sl_c) = concatenate_slices([a, b, c], axis)
+
+        ret[(slice(None),) * axis + sl_a] == a
+        ret[(slice(None),) * axis + sl_b] == b
+        ret[(slice(None),) * axis + sl_c] == c
+        ```
+
+        These are called slice prefixes since they are used in the recursive
+        blocking algorithm to compute the left-most slices during the
+        recursion. Therefore, they must be prepended to rest of the slice
+        that was computed deeper in the recursion.
+
+        These are returned as tuples to ensure that they can quickly be added
+        to existing slice tuple without creating a new tuple every time.
+
+    """
+    # Cache a result that will be reused.
+    shape_at_axis = [shape[axis] for shape in shapes]
+
+    # Take a shape, any shape
+    first_shape = shapes[0]
+    first_shape_pre = first_shape[:axis]
+    first_shape_post = first_shape[axis+1:]
+
+    if any(shape[:axis] != first_shape_pre or
+           shape[axis+1:] != first_shape_post for shape in shapes):
+        raise ValueError(
+            'Mismatched array shapes in block along axis {}.'.format(axis))
+
+    shape = (first_shape_pre + (sum(shape_at_axis),) + first_shape[axis+1:])
+
+    offsets_at_axis = _accumulate(shape_at_axis)
+    slice_prefixes = [(slice(start, end),)
+                      for start, end in zip([0] + offsets_at_axis,
+                                            offsets_at_axis)]
+    return shape, slice_prefixes
+
+
+def _block_info_recursion(arrays, max_depth, result_ndim, depth=0):
+    """
+    Returns the shape of the final array, along with a list
+    of slices and a list of arrays that can be used for assignment inside the
+    new array
+
+    Parameters
+    ----------
+    arrays : nested list of arrays
+        The arrays to check
+    max_depth : list of int
+        The number of nested lists
+    result_ndim: int
+        The number of dimensions in thefinal array.
+
+    Returns
+    -------
+    shape : tuple of int
+        The shape that the final array will take on.
+    slices: list of tuple of slices
+        The slices into the full array required for assignment. These are
+        required to be prepended with ``(Ellipsis, )`` to obtain to correct
+        final index.
+    arrays: list of ndarray
+        The data to assign to each slice of the full array
+
+    """
+    if depth < max_depth:
+        shapes, slices, arrays = zip(
+            *[_block_info_recursion(arr, max_depth, result_ndim, depth+1)
+              for arr in arrays])
+
+        axis = result_ndim - max_depth + depth
+        shape, slice_prefixes = _concatenate_shapes(shapes, axis)
+
+        # Prepend the slice prefix and flatten the slices
+        slices = [slice_prefix + the_slice
+                  for slice_prefix, inner_slices in zip(slice_prefixes, slices)
+                  for the_slice in inner_slices]
+
+        # Flatten the array list
+        arrays = functools.reduce(operator.add, arrays)
+
+        return shape, slices, arrays
+    else:
+        # We've 'bottomed out' - arrays is either a scalar or an array
+        # type(arrays) is not list
+        # Return the slice and the array inside a list to be consistent with
+        # the recursive case.
+        arr = _atleast_nd(arrays, result_ndim)
+        return arr.shape, [()], [arr]
+
+
+def _block(arrays, max_depth, result_ndim, depth=0):
+    """
+    Internal implementation of block based on repeated concatenation.
+    `arrays` is the argument passed to
+    block. `max_depth` is the depth of nested lists within `arrays` and
+    `result_ndim` is the greatest of the dimensions of the arrays in
+    `arrays` and the depth of the lists in `arrays` (see block docstring
+    for details).
+    """
+    if depth < max_depth:
+        arrs = [_block(arr, max_depth, result_ndim, depth+1)
+                for arr in arrays]
+        return _concatenate(arrs, axis=-(max_depth-depth))
+    else:
+        # We've 'bottomed out' - arrays is either a scalar or an array
+        # type(arrays) is not list
+        return _atleast_nd(arrays, result_ndim)
+
+
+def _block_dispatcher(arrays):
+    # Use type(...) is list to match the behavior of np.block(), which special
+    # cases list specifically rather than allowing for generic iterables or
+    # tuple. Also, we know that list.__array_function__ will never exist.
+    if type(arrays) is list:
+        for subarrays in arrays:
+            yield from _block_dispatcher(subarrays)
+    else:
+        yield arrays
+
+
+@array_function_dispatch(_block_dispatcher)
+def block(arrays):
+    """
+    Assemble an nd-array from nested lists of blocks.
+
+    Blocks in the innermost lists are concatenated (see `concatenate`) along
+    the last dimension (-1), then these are concatenated along the
+    second-last dimension (-2), and so on until the outermost list is reached.
+
+    Blocks can be of any dimension, but will not be broadcasted using the normal
+    rules. Instead, leading axes of size 1 are inserted, to make ``block.ndim``
+    the same for all blocks. This is primarily useful for working with scalars,
+    and means that code like ``np.block([v, 1])`` is valid, where
+    ``v.ndim == 1``.
+
+    When the nested list is two levels deep, this allows block matrices to be
+    constructed from their components.
+
+    .. versionadded:: 1.13.0
+
+    Parameters
+    ----------
+    arrays : nested list of array_like or scalars (but not tuples)
+        If passed a single ndarray or scalar (a nested list of depth 0), this
+        is returned unmodified (and not copied).
+
+        Elements shapes must match along the appropriate axes (without
+        broadcasting), but leading 1s will be prepended to the shape as
+        necessary to make the dimensions match.
+
+    Returns
+    -------
+    block_array : ndarray
+        The array assembled from the given blocks.
+
+        The dimensionality of the output is equal to the greatest of:
+        * the dimensionality of all the inputs
+        * the depth to which the input list is nested
+
+    Raises
+    ------
+    ValueError
+        * If list depths are mismatched - for instance, ``[[a, b], c]`` is
+          illegal, and should be spelt ``[[a, b], [c]]``
+        * If lists are empty - for instance, ``[[a, b], []]``
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    stack : Join a sequence of arrays along a new axis.
+    vstack : Stack arrays in sequence vertically (row wise).
+    hstack : Stack arrays in sequence horizontally (column wise).
+    dstack : Stack arrays in sequence depth wise (along third axis).
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+    vsplit : Split an array into multiple sub-arrays vertically (row-wise).
+
+    Notes
+    -----
+
+    When called with only scalars, ``np.block`` is equivalent to an ndarray
+    call. So ``np.block([[1, 2], [3, 4]])`` is equivalent to
+    ``np.array([[1, 2], [3, 4]])``.
+
+    This function does not enforce that the blocks lie on a fixed grid.
+    ``np.block([[a, b], [c, d]])`` is not restricted to arrays of the form::
+
+        AAAbb
+        AAAbb
+        cccDD
+
+    But is also allowed to produce, for some ``a, b, c, d``::
+
+        AAAbb
+        AAAbb
+        cDDDD
+
+    Since concatenation happens along the last axis first, `block` is _not_
+    capable of producing the following directly::
+
+        AAAbb
+        cccbb
+        cccDD
+
+    Matlab's "square bracket stacking", ``[A, B, ...; p, q, ...]``, is
+    equivalent to ``np.block([[A, B, ...], [p, q, ...]])``.
+
+    Examples
+    --------
+    The most common use of this function is to build a block matrix
+
+    >>> A = np.eye(2) * 2
+    >>> B = np.eye(3) * 3
+    >>> np.block([
+    ...     [A,               np.zeros((2, 3))],
+    ...     [np.ones((3, 2)), B               ]
+    ... ])
+    array([[2., 0., 0., 0., 0.],
+           [0., 2., 0., 0., 0.],
+           [1., 1., 3., 0., 0.],
+           [1., 1., 0., 3., 0.],
+           [1., 1., 0., 0., 3.]])
+
+    With a list of depth 1, `block` can be used as `hstack`
+
+    >>> np.block([1, 2, 3])              # hstack([1, 2, 3])
+    array([1, 2, 3])
+
+    >>> a = np.array([1, 2, 3])
+    >>> b = np.array([2, 3, 4])
+    >>> np.block([a, b, 10])             # hstack([a, b, 10])
+    array([ 1,  2,  3,  2,  3,  4, 10])
+
+    >>> A = np.ones((2, 2), int)
+    >>> B = 2 * A
+    >>> np.block([A, B])                 # hstack([A, B])
+    array([[1, 1, 2, 2],
+           [1, 1, 2, 2]])
+
+    With a list of depth 2, `block` can be used in place of `vstack`:
+
+    >>> a = np.array([1, 2, 3])
+    >>> b = np.array([2, 3, 4])
+    >>> np.block([[a], [b]])             # vstack([a, b])
+    array([[1, 2, 3],
+           [2, 3, 4]])
+
+    >>> A = np.ones((2, 2), int)
+    >>> B = 2 * A
+    >>> np.block([[A], [B]])             # vstack([A, B])
+    array([[1, 1],
+           [1, 1],
+           [2, 2],
+           [2, 2]])
+
+    It can also be used in places of `atleast_1d` and `atleast_2d`
+
+    >>> a = np.array(0)
+    >>> b = np.array([1])
+    >>> np.block([a])                    # atleast_1d(a)
+    array([0])
+    >>> np.block([b])                    # atleast_1d(b)
+    array([1])
+
+    >>> np.block([[a]])                  # atleast_2d(a)
+    array([[0]])
+    >>> np.block([[b]])                  # atleast_2d(b)
+    array([[1]])
+
+
+    """
+    arrays, list_ndim, result_ndim, final_size = _block_setup(arrays)
+
+    # It was found through benchmarking that making an array of final size
+    # around 256x256 was faster by straight concatenation on a
+    # i7-7700HQ processor and dual channel ram 2400MHz.
+    # It didn't seem to matter heavily on the dtype used.
+    #
+    # A 2D array using repeated concatenation requires 2 copies of the array.
+    #
+    # The fastest algorithm will depend on the ratio of CPU power to memory
+    # speed.
+    # One can monitor the results of the benchmark
+    # https://pv.github.io/numpy-bench/#bench_shape_base.Block2D.time_block2d
+    # to tune this parameter until a C version of the `_block_info_recursion`
+    # algorithm is implemented which would likely be faster than the python
+    # version.
+    if list_ndim * final_size > (2 * 512 * 512):
+        return _block_slicing(arrays, list_ndim, result_ndim)
+    else:
+        return _block_concatenate(arrays, list_ndim, result_ndim)
+
+
+# These helper functions are mostly used for testing.
+# They allow us to write tests that directly call `_block_slicing`
+# or `_block_concatenate` without blocking large arrays to force the wisdom
+# to trigger the desired path.
+def _block_setup(arrays):
+    """
+    Returns
+    (`arrays`, list_ndim, result_ndim, final_size)
+    """
+    bottom_index, arr_ndim, final_size = _block_check_depths_match(arrays)
+    list_ndim = len(bottom_index)
+    if bottom_index and bottom_index[-1] is None:
+        raise ValueError(
+            'List at {} cannot be empty'.format(
+                _block_format_index(bottom_index)
+            )
+        )
+    result_ndim = max(arr_ndim, list_ndim)
+    return arrays, list_ndim, result_ndim, final_size
+
+
+def _block_slicing(arrays, list_ndim, result_ndim):
+    shape, slices, arrays = _block_info_recursion(
+        arrays, list_ndim, result_ndim)
+    dtype = _nx.result_type(*[arr.dtype for arr in arrays])
+
+    # Test preferring F only in the case that all input arrays are F
+    F_order = all(arr.flags['F_CONTIGUOUS'] for arr in arrays)
+    C_order = all(arr.flags['C_CONTIGUOUS'] for arr in arrays)
+    order = 'F' if F_order and not C_order else 'C'
+    result = _nx.empty(shape=shape, dtype=dtype, order=order)
+    # Note: In a c implementation, the function
+    # PyArray_CreateMultiSortedStridePerm could be used for more advanced
+    # guessing of the desired order.
+
+    for the_slice, arr in zip(slices, arrays):
+        result[(Ellipsis,) + the_slice] = arr
+    return result
+
+
+def _block_concatenate(arrays, list_ndim, result_ndim):
+    result = _block(arrays, list_ndim, result_ndim)
+    if list_ndim == 0:
+        # Catch an edge case where _block returns a view because
+        # `arrays` is a single numpy array and not a list of numpy arrays.
+        # This might copy scalars or lists twice, but this isn't a likely
+        # usecase for those interested in performance
+        result = result.copy()
+    return result
diff --git a/venv/Lib/site-packages/numpy/core/tests/__init__.py b/venv/Lib/site-packages/numpy/core/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..dd257f1d5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/_locales.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/_locales.cpython-36.pyc
new file mode 100644
index 000000000..6e6d6ac15
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/_locales.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test__exceptions.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test__exceptions.cpython-36.pyc
new file mode 100644
index 000000000..330cee7ef
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test__exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_abc.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_abc.cpython-36.pyc
new file mode 100644
index 000000000..bbfda06c5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_abc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_api.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_api.cpython-36.pyc
new file mode 100644
index 000000000..7c2b24852
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_api.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_arrayprint.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_arrayprint.cpython-36.pyc
new file mode 100644
index 000000000..f2477290f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_arrayprint.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_conversion_utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_conversion_utils.cpython-36.pyc
new file mode 100644
index 000000000..4d7a9e6b5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_conversion_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_cpu_features.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_cpu_features.cpython-36.pyc
new file mode 100644
index 000000000..e74bba3c4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_cpu_features.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_datetime.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_datetime.cpython-36.pyc
new file mode 100644
index 000000000..2ef4c82eb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_datetime.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_defchararray.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_defchararray.cpython-36.pyc
new file mode 100644
index 000000000..755af29ec
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_defchararray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_deprecations.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_deprecations.cpython-36.pyc
new file mode 100644
index 000000000..0b936d6d6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_deprecations.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_dtype.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_dtype.cpython-36.pyc
new file mode 100644
index 000000000..2f98c29a0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_dtype.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_einsum.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_einsum.cpython-36.pyc
new file mode 100644
index 000000000..3c69ec533
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_einsum.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_errstate.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_errstate.cpython-36.pyc
new file mode 100644
index 000000000..0c1c9d6e6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_errstate.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_extint128.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_extint128.cpython-36.pyc
new file mode 100644
index 000000000..29a6fdf77
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_extint128.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_function_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_function_base.cpython-36.pyc
new file mode 100644
index 000000000..f225396c9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_function_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_getlimits.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_getlimits.cpython-36.pyc
new file mode 100644
index 000000000..7518a09fd
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_getlimits.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_half.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_half.cpython-36.pyc
new file mode 100644
index 000000000..112eee8c5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_half.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexerrors.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexerrors.cpython-36.pyc
new file mode 100644
index 000000000..27efb50f0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexerrors.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexing.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexing.cpython-36.pyc
new file mode 100644
index 000000000..972d07c51
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_indexing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_item_selection.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_item_selection.cpython-36.pyc
new file mode 100644
index 000000000..3340f0aef
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_item_selection.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_longdouble.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_longdouble.cpython-36.pyc
new file mode 100644
index 000000000..465f9fc64
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_longdouble.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_machar.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_machar.cpython-36.pyc
new file mode 100644
index 000000000..34fda01e9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_machar.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_mem_overlap.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_mem_overlap.cpython-36.pyc
new file mode 100644
index 000000000..f4f33b93e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_mem_overlap.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_memmap.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_memmap.cpython-36.pyc
new file mode 100644
index 000000000..bfefc0f64
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_memmap.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_multiarray.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_multiarray.cpython-36.pyc
new file mode 100644
index 000000000..31c9627d7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_multiarray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_nditer.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_nditer.cpython-36.pyc
new file mode 100644
index 000000000..7a3c451f7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_nditer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numeric.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numeric.cpython-36.pyc
new file mode 100644
index 000000000..4e4fd1a59
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numeric.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numerictypes.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numerictypes.cpython-36.pyc
new file mode 100644
index 000000000..9334236f5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_numerictypes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_overrides.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_overrides.cpython-36.pyc
new file mode 100644
index 000000000..c96caaae9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_overrides.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_print.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_print.cpython-36.pyc
new file mode 100644
index 000000000..843e54cac
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_print.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_protocols.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_protocols.cpython-36.pyc
new file mode 100644
index 000000000..8c9adc3f5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_protocols.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_records.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_records.cpython-36.pyc
new file mode 100644
index 000000000..28a5bc37b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_records.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..e687f26a1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_ctors.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_ctors.cpython-36.pyc
new file mode 100644
index 000000000..e9e68bc3e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_ctors.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_methods.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_methods.cpython-36.pyc
new file mode 100644
index 000000000..7065313a8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalar_methods.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarbuffer.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarbuffer.cpython-36.pyc
new file mode 100644
index 000000000..e179d8bbd
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarbuffer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarinherit.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarinherit.cpython-36.pyc
new file mode 100644
index 000000000..25f3ad518
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarinherit.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarmath.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarmath.cpython-36.pyc
new file mode 100644
index 000000000..be54cbd35
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarmath.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarprint.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarprint.cpython-36.pyc
new file mode 100644
index 000000000..b952d92e2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_scalarprint.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_shape_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_shape_base.cpython-36.pyc
new file mode 100644
index 000000000..f1b257445
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_shape_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_ufunc.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_ufunc.cpython-36.pyc
new file mode 100644
index 000000000..f2ef72a44
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_ufunc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath.cpython-36.pyc
new file mode 100644
index 000000000..67e2f7712
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_accuracy.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_accuracy.cpython-36.pyc
new file mode 100644
index 000000000..896658d55
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_accuracy.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_complex.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_complex.cpython-36.pyc
new file mode 100644
index 000000000..1df67e6da
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_umath_complex.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_unicode.cpython-36.pyc b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_unicode.cpython-36.pyc
new file mode 100644
index 000000000..085089c25
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/__pycache__/test_unicode.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/_locales.py b/venv/Lib/site-packages/numpy/core/tests/_locales.py
new file mode 100644
index 000000000..ce7b81f00
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/_locales.py
@@ -0,0 +1,74 @@
+"""Provide class for testing in French locale
+
+"""
+import sys
+import locale
+
+import pytest
+
+__ALL__ = ['CommaDecimalPointLocale']
+
+
+def find_comma_decimal_point_locale():
+    """See if platform has a decimal point as comma locale.
+
+    Find a locale that uses a comma instead of a period as the
+    decimal point.
+
+    Returns
+    -------
+    old_locale: str
+        Locale when the function was called.
+    new_locale: {str, None)
+        First French locale found, None if none found.
+
+    """
+    if sys.platform == 'win32':
+        locales = ['FRENCH']
+    else:
+        locales = ['fr_FR', 'fr_FR.UTF-8', 'fi_FI', 'fi_FI.UTF-8']
+
+    old_locale = locale.getlocale(locale.LC_NUMERIC)
+    new_locale = None
+    try:
+        for loc in locales:
+            try:
+                locale.setlocale(locale.LC_NUMERIC, loc)
+                new_locale = loc
+                break
+            except locale.Error:
+                pass
+    finally:
+        locale.setlocale(locale.LC_NUMERIC, locale=old_locale)
+    return old_locale, new_locale
+
+
+class CommaDecimalPointLocale:
+    """Sets LC_NUMERIC to a locale with comma as decimal point.
+
+    Classes derived from this class have setup and teardown methods that run
+    tests with locale.LC_NUMERIC set to a locale where commas (',') are used as
+    the decimal point instead of periods ('.'). On exit the locale is restored
+    to the initial locale. It also serves as context manager with the same
+    effect. If no such locale is available, the test is skipped.
+
+    .. versionadded:: 1.15.0
+
+    """
+    (cur_locale, tst_locale) = find_comma_decimal_point_locale()
+
+    def setup(self):
+        if self.tst_locale is None:
+            pytest.skip("No French locale available")
+        locale.setlocale(locale.LC_NUMERIC, locale=self.tst_locale)
+
+    def teardown(self):
+        locale.setlocale(locale.LC_NUMERIC, locale=self.cur_locale)
+
+    def __enter__(self):
+        if self.tst_locale is None:
+            pytest.skip("No French locale available")
+        locale.setlocale(locale.LC_NUMERIC, locale=self.tst_locale)
+
+    def __exit__(self, type, value, traceback):
+        locale.setlocale(locale.LC_NUMERIC, locale=self.cur_locale)
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/astype_copy.pkl b/venv/Lib/site-packages/numpy/core/tests/data/astype_copy.pkl
new file mode 100644
index 000000000..7397c9782
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/data/astype_copy.pkl differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/recarray_from_file.fits b/venv/Lib/site-packages/numpy/core/tests/data/recarray_from_file.fits
new file mode 100644
index 000000000..ca48ee851
Binary files /dev/null and b/venv/Lib/site-packages/numpy/core/tests/data/recarray_from_file.fits differ
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-README b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-README
new file mode 100644
index 000000000..6561ca3b5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-README
@@ -0,0 +1,15 @@
+Steps to validate transcendental functions:
+1) Add a file 'umath-validation-set-<ufuncname>', where ufuncname is name of
+   the function in NumPy you want to validate
+2) The file should contain 4 columns: dtype,input,expected output,ulperror
+    a. dtype: one of np.float16, np.float32, np.float64
+    b. input: floating point input to ufunc in hex. Example: 0x414570a4
+       represents 12.340000152587890625
+    c. expected output: floating point output for the corresponding input in hex.
+       This should be computed using a high(er) precision library and then rounded to
+       same format as the input.
+    d. ulperror: expected maximum ulp error of the function. This
+       should be same across all rows of the same dtype. Otherwise, the function is
+       tested for the maximum ulp error among all entries of that dtype.
+3) Add file umath-validation-set-<ufuncname> to the test file test_umath_accuracy.py
+   which will then validate your ufunc.
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-cos b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-cos
new file mode 100644
index 000000000..2e75f044c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-cos
@@ -0,0 +1,665 @@
+dtype,input,output,ulperrortol
+## +ve denormals ##
+np.float32,0x004b4716,0x3f800000,2
+np.float32,0x007b2490,0x3f800000,2
+np.float32,0x007c99fa,0x3f800000,2
+np.float32,0x00734a0c,0x3f800000,2
+np.float32,0x0070de24,0x3f800000,2
+np.float32,0x007fffff,0x3f800000,2
+np.float32,0x00000001,0x3f800000,2
+## -ve denormals ##
+np.float32,0x80495d65,0x3f800000,2
+np.float32,0x806894f6,0x3f800000,2
+np.float32,0x80555a76,0x3f800000,2
+np.float32,0x804e1fb8,0x3f800000,2
+np.float32,0x80687de9,0x3f800000,2
+np.float32,0x807fffff,0x3f800000,2
+np.float32,0x80000001,0x3f800000,2
+## +/-0.0f, +/-FLT_MIN +/-FLT_MAX ##
+np.float32,0x00000000,0x3f800000,2
+np.float32,0x80000000,0x3f800000,2
+np.float32,0x00800000,0x3f800000,2
+np.float32,0x80800000,0x3f800000,2
+## 1.00f + 0x00000001 ##
+np.float32,0x3f800000,0x3f0a5140,2
+np.float32,0x3f800001,0x3f0a513f,2
+np.float32,0x3f800002,0x3f0a513d,2
+np.float32,0xc090a8b0,0xbe4332ce,2
+np.float32,0x41ce3184,0x3f4d1de1,2
+np.float32,0xc1d85848,0xbeaa8980,2
+np.float32,0x402b8820,0xbf653aa3,2
+np.float32,0x42b4e454,0xbf4a338b,2
+np.float32,0x42a67a60,0x3c58202e,2
+np.float32,0x41d92388,0xbed987c7,2
+np.float32,0x422dd66c,0x3f5dcab3,2
+np.float32,0xc28f5be6,0xbf5688d8,2
+np.float32,0x41ab2674,0xbf53aa3b,2
+np.float32,0x3f490fdb,0x3f3504f3,2
+np.float32,0xbf490fdb,0x3f3504f3,2
+np.float32,0x3fc90fdb,0xb33bbd2e,2
+np.float32,0xbfc90fdb,0xb33bbd2e,2
+np.float32,0x40490fdb,0xbf800000,2
+np.float32,0xc0490fdb,0xbf800000,2
+np.float32,0x3fc90fdb,0xb33bbd2e,2
+np.float32,0xbfc90fdb,0xb33bbd2e,2
+np.float32,0x40490fdb,0xbf800000,2
+np.float32,0xc0490fdb,0xbf800000,2
+np.float32,0x40c90fdb,0x3f800000,2
+np.float32,0xc0c90fdb,0x3f800000,2
+np.float32,0x4016cbe4,0xbf3504f3,2
+np.float32,0xc016cbe4,0xbf3504f3,2
+np.float32,0x4096cbe4,0x324cde2e,2
+np.float32,0xc096cbe4,0x324cde2e,2
+np.float32,0x4116cbe4,0xbf800000,2
+np.float32,0xc116cbe4,0xbf800000,2
+np.float32,0x40490fdb,0xbf800000,2
+np.float32,0xc0490fdb,0xbf800000,2
+np.float32,0x40c90fdb,0x3f800000,2
+np.float32,0xc0c90fdb,0x3f800000,2
+np.float32,0x41490fdb,0x3f800000,2
+np.float32,0xc1490fdb,0x3f800000,2
+np.float32,0x407b53d2,0xbf3504f1,2
+np.float32,0xc07b53d2,0xbf3504f1,2
+np.float32,0x40fb53d2,0xb4b5563d,2
+np.float32,0xc0fb53d2,0xb4b5563d,2
+np.float32,0x417b53d2,0xbf800000,2
+np.float32,0xc17b53d2,0xbf800000,2
+np.float32,0x4096cbe4,0x324cde2e,2
+np.float32,0xc096cbe4,0x324cde2e,2
+np.float32,0x4116cbe4,0xbf800000,2
+np.float32,0xc116cbe4,0xbf800000,2
+np.float32,0x4196cbe4,0x3f800000,2
+np.float32,0xc196cbe4,0x3f800000,2
+np.float32,0x40afede0,0x3f3504f7,2
+np.float32,0xc0afede0,0x3f3504f7,2
+np.float32,0x412fede0,0x353222c4,2
+np.float32,0xc12fede0,0x353222c4,2
+np.float32,0x41afede0,0xbf800000,2
+np.float32,0xc1afede0,0xbf800000,2
+np.float32,0x40c90fdb,0x3f800000,2
+np.float32,0xc0c90fdb,0x3f800000,2
+np.float32,0x41490fdb,0x3f800000,2
+np.float32,0xc1490fdb,0x3f800000,2
+np.float32,0x41c90fdb,0x3f800000,2
+np.float32,0xc1c90fdb,0x3f800000,2
+np.float32,0x40e231d6,0x3f3504f3,2
+np.float32,0xc0e231d6,0x3f3504f3,2
+np.float32,0x416231d6,0xb319a6a2,2
+np.float32,0xc16231d6,0xb319a6a2,2
+np.float32,0x41e231d6,0xbf800000,2
+np.float32,0xc1e231d6,0xbf800000,2
+np.float32,0x40fb53d2,0xb4b5563d,2
+np.float32,0xc0fb53d2,0xb4b5563d,2
+np.float32,0x417b53d2,0xbf800000,2
+np.float32,0xc17b53d2,0xbf800000,2
+np.float32,0x41fb53d2,0x3f800000,2
+np.float32,0xc1fb53d2,0x3f800000,2
+np.float32,0x410a3ae7,0xbf3504fb,2
+np.float32,0xc10a3ae7,0xbf3504fb,2
+np.float32,0x418a3ae7,0x35b08908,2
+np.float32,0xc18a3ae7,0x35b08908,2
+np.float32,0x420a3ae7,0xbf800000,2
+np.float32,0xc20a3ae7,0xbf800000,2
+np.float32,0x4116cbe4,0xbf800000,2
+np.float32,0xc116cbe4,0xbf800000,2
+np.float32,0x4196cbe4,0x3f800000,2
+np.float32,0xc196cbe4,0x3f800000,2
+np.float32,0x4216cbe4,0x3f800000,2
+np.float32,0xc216cbe4,0x3f800000,2
+np.float32,0x41235ce2,0xbf3504ef,2
+np.float32,0xc1235ce2,0xbf3504ef,2
+np.float32,0x41a35ce2,0xb53889b6,2
+np.float32,0xc1a35ce2,0xb53889b6,2
+np.float32,0x42235ce2,0xbf800000,2
+np.float32,0xc2235ce2,0xbf800000,2
+np.float32,0x412fede0,0x353222c4,2
+np.float32,0xc12fede0,0x353222c4,2
+np.float32,0x41afede0,0xbf800000,2
+np.float32,0xc1afede0,0xbf800000,2
+np.float32,0x422fede0,0x3f800000,2
+np.float32,0xc22fede0,0x3f800000,2
+np.float32,0x413c7edd,0x3f3504f4,2
+np.float32,0xc13c7edd,0x3f3504f4,2
+np.float32,0x41bc7edd,0x33800add,2
+np.float32,0xc1bc7edd,0x33800add,2
+np.float32,0x423c7edd,0xbf800000,2
+np.float32,0xc23c7edd,0xbf800000,2
+np.float32,0x41490fdb,0x3f800000,2
+np.float32,0xc1490fdb,0x3f800000,2
+np.float32,0x41c90fdb,0x3f800000,2
+np.float32,0xc1c90fdb,0x3f800000,2
+np.float32,0x42490fdb,0x3f800000,2
+np.float32,0xc2490fdb,0x3f800000,2
+np.float32,0x4155a0d9,0x3f3504eb,2
+np.float32,0xc155a0d9,0x3f3504eb,2
+np.float32,0x41d5a0d9,0xb5b3bc81,2
+np.float32,0xc1d5a0d9,0xb5b3bc81,2
+np.float32,0x4255a0d9,0xbf800000,2
+np.float32,0xc255a0d9,0xbf800000,2
+np.float32,0x416231d6,0xb319a6a2,2
+np.float32,0xc16231d6,0xb319a6a2,2
+np.float32,0x41e231d6,0xbf800000,2
+np.float32,0xc1e231d6,0xbf800000,2
+np.float32,0x426231d6,0x3f800000,2
+np.float32,0xc26231d6,0x3f800000,2
+np.float32,0x416ec2d4,0xbf3504f7,2
+np.float32,0xc16ec2d4,0xbf3504f7,2
+np.float32,0x41eec2d4,0x353ef0a7,2
+np.float32,0xc1eec2d4,0x353ef0a7,2
+np.float32,0x426ec2d4,0xbf800000,2
+np.float32,0xc26ec2d4,0xbf800000,2
+np.float32,0x417b53d2,0xbf800000,2
+np.float32,0xc17b53d2,0xbf800000,2
+np.float32,0x41fb53d2,0x3f800000,2
+np.float32,0xc1fb53d2,0x3f800000,2
+np.float32,0x427b53d2,0x3f800000,2
+np.float32,0xc27b53d2,0x3f800000,2
+np.float32,0x4183f268,0xbf3504e7,2
+np.float32,0xc183f268,0xbf3504e7,2
+np.float32,0x4203f268,0xb6059a13,2
+np.float32,0xc203f268,0xb6059a13,2
+np.float32,0x4283f268,0xbf800000,2
+np.float32,0xc283f268,0xbf800000,2
+np.float32,0x418a3ae7,0x35b08908,2
+np.float32,0xc18a3ae7,0x35b08908,2
+np.float32,0x420a3ae7,0xbf800000,2
+np.float32,0xc20a3ae7,0xbf800000,2
+np.float32,0x428a3ae7,0x3f800000,2
+np.float32,0xc28a3ae7,0x3f800000,2
+np.float32,0x41908365,0x3f3504f0,2
+np.float32,0xc1908365,0x3f3504f0,2
+np.float32,0x42108365,0xb512200d,2
+np.float32,0xc2108365,0xb512200d,2
+np.float32,0x42908365,0xbf800000,2
+np.float32,0xc2908365,0xbf800000,2
+np.float32,0x4196cbe4,0x3f800000,2
+np.float32,0xc196cbe4,0x3f800000,2
+np.float32,0x4216cbe4,0x3f800000,2
+np.float32,0xc216cbe4,0x3f800000,2
+np.float32,0x4296cbe4,0x3f800000,2
+np.float32,0xc296cbe4,0x3f800000,2
+np.float32,0x419d1463,0x3f3504ef,2
+np.float32,0xc19d1463,0x3f3504ef,2
+np.float32,0x421d1463,0xb5455799,2
+np.float32,0xc21d1463,0xb5455799,2
+np.float32,0x429d1463,0xbf800000,2
+np.float32,0xc29d1463,0xbf800000,2
+np.float32,0x41a35ce2,0xb53889b6,2
+np.float32,0xc1a35ce2,0xb53889b6,2
+np.float32,0x42235ce2,0xbf800000,2
+np.float32,0xc2235ce2,0xbf800000,2
+np.float32,0x42a35ce2,0x3f800000,2
+np.float32,0xc2a35ce2,0x3f800000,2
+np.float32,0x41a9a561,0xbf3504ff,2
+np.float32,0xc1a9a561,0xbf3504ff,2
+np.float32,0x4229a561,0x360733d0,2
+np.float32,0xc229a561,0x360733d0,2
+np.float32,0x42a9a561,0xbf800000,2
+np.float32,0xc2a9a561,0xbf800000,2
+np.float32,0x41afede0,0xbf800000,2
+np.float32,0xc1afede0,0xbf800000,2
+np.float32,0x422fede0,0x3f800000,2
+np.float32,0xc22fede0,0x3f800000,2
+np.float32,0x42afede0,0x3f800000,2
+np.float32,0xc2afede0,0x3f800000,2
+np.float32,0x41b6365e,0xbf3504f6,2
+np.float32,0xc1b6365e,0xbf3504f6,2
+np.float32,0x4236365e,0x350bb91c,2
+np.float32,0xc236365e,0x350bb91c,2
+np.float32,0x42b6365e,0xbf800000,2
+np.float32,0xc2b6365e,0xbf800000,2
+np.float32,0x41bc7edd,0x33800add,2
+np.float32,0xc1bc7edd,0x33800add,2
+np.float32,0x423c7edd,0xbf800000,2
+np.float32,0xc23c7edd,0xbf800000,2
+np.float32,0x42bc7edd,0x3f800000,2
+np.float32,0xc2bc7edd,0x3f800000,2
+np.float32,0x41c2c75c,0x3f3504f8,2
+np.float32,0xc1c2c75c,0x3f3504f8,2
+np.float32,0x4242c75c,0x354bbe8a,2
+np.float32,0xc242c75c,0x354bbe8a,2
+np.float32,0x42c2c75c,0xbf800000,2
+np.float32,0xc2c2c75c,0xbf800000,2
+np.float32,0x41c90fdb,0x3f800000,2
+np.float32,0xc1c90fdb,0x3f800000,2
+np.float32,0x42490fdb,0x3f800000,2
+np.float32,0xc2490fdb,0x3f800000,2
+np.float32,0x42c90fdb,0x3f800000,2
+np.float32,0xc2c90fdb,0x3f800000,2
+np.float32,0x41cf585a,0x3f3504e7,2
+np.float32,0xc1cf585a,0x3f3504e7,2
+np.float32,0x424f585a,0xb608cd8c,2
+np.float32,0xc24f585a,0xb608cd8c,2
+np.float32,0x42cf585a,0xbf800000,2
+np.float32,0xc2cf585a,0xbf800000,2
+np.float32,0x41d5a0d9,0xb5b3bc81,2
+np.float32,0xc1d5a0d9,0xb5b3bc81,2
+np.float32,0x4255a0d9,0xbf800000,2
+np.float32,0xc255a0d9,0xbf800000,2
+np.float32,0x42d5a0d9,0x3f800000,2
+np.float32,0xc2d5a0d9,0x3f800000,2
+np.float32,0x41dbe958,0xbf350507,2
+np.float32,0xc1dbe958,0xbf350507,2
+np.float32,0x425be958,0x365eab75,2
+np.float32,0xc25be958,0x365eab75,2
+np.float32,0x42dbe958,0xbf800000,2
+np.float32,0xc2dbe958,0xbf800000,2
+np.float32,0x41e231d6,0xbf800000,2
+np.float32,0xc1e231d6,0xbf800000,2
+np.float32,0x426231d6,0x3f800000,2
+np.float32,0xc26231d6,0x3f800000,2
+np.float32,0x42e231d6,0x3f800000,2
+np.float32,0xc2e231d6,0x3f800000,2
+np.float32,0x41e87a55,0xbf3504ef,2
+np.float32,0xc1e87a55,0xbf3504ef,2
+np.float32,0x42687a55,0xb552257b,2
+np.float32,0xc2687a55,0xb552257b,2
+np.float32,0x42e87a55,0xbf800000,2
+np.float32,0xc2e87a55,0xbf800000,2
+np.float32,0x41eec2d4,0x353ef0a7,2
+np.float32,0xc1eec2d4,0x353ef0a7,2
+np.float32,0x426ec2d4,0xbf800000,2
+np.float32,0xc26ec2d4,0xbf800000,2
+np.float32,0x42eec2d4,0x3f800000,2
+np.float32,0xc2eec2d4,0x3f800000,2
+np.float32,0x41f50b53,0x3f3504ff,2
+np.float32,0xc1f50b53,0x3f3504ff,2
+np.float32,0x42750b53,0x360a6748,2
+np.float32,0xc2750b53,0x360a6748,2
+np.float32,0x42f50b53,0xbf800000,2
+np.float32,0xc2f50b53,0xbf800000,2
+np.float32,0x41fb53d2,0x3f800000,2
+np.float32,0xc1fb53d2,0x3f800000,2
+np.float32,0x427b53d2,0x3f800000,2
+np.float32,0xc27b53d2,0x3f800000,2
+np.float32,0x42fb53d2,0x3f800000,2
+np.float32,0xc2fb53d2,0x3f800000,2
+np.float32,0x4200ce28,0x3f3504f6,2
+np.float32,0xc200ce28,0x3f3504f6,2
+np.float32,0x4280ce28,0x34fdd672,2
+np.float32,0xc280ce28,0x34fdd672,2
+np.float32,0x4300ce28,0xbf800000,2
+np.float32,0xc300ce28,0xbf800000,2
+np.float32,0x4203f268,0xb6059a13,2
+np.float32,0xc203f268,0xb6059a13,2
+np.float32,0x4283f268,0xbf800000,2
+np.float32,0xc283f268,0xbf800000,2
+np.float32,0x4303f268,0x3f800000,2
+np.float32,0xc303f268,0x3f800000,2
+np.float32,0x420716a7,0xbf3504f8,2
+np.float32,0xc20716a7,0xbf3504f8,2
+np.float32,0x428716a7,0x35588c6d,2
+np.float32,0xc28716a7,0x35588c6d,2
+np.float32,0x430716a7,0xbf800000,2
+np.float32,0xc30716a7,0xbf800000,2
+np.float32,0x420a3ae7,0xbf800000,2
+np.float32,0xc20a3ae7,0xbf800000,2
+np.float32,0x428a3ae7,0x3f800000,2
+np.float32,0xc28a3ae7,0x3f800000,2
+np.float32,0x430a3ae7,0x3f800000,2
+np.float32,0xc30a3ae7,0x3f800000,2
+np.float32,0x420d5f26,0xbf3504e7,2
+np.float32,0xc20d5f26,0xbf3504e7,2
+np.float32,0x428d5f26,0xb60c0105,2
+np.float32,0xc28d5f26,0xb60c0105,2
+np.float32,0x430d5f26,0xbf800000,2
+np.float32,0xc30d5f26,0xbf800000,2
+np.float32,0x42108365,0xb512200d,2
+np.float32,0xc2108365,0xb512200d,2
+np.float32,0x42908365,0xbf800000,2
+np.float32,0xc2908365,0xbf800000,2
+np.float32,0x43108365,0x3f800000,2
+np.float32,0xc3108365,0x3f800000,2
+np.float32,0x4213a7a5,0x3f350507,2
+np.float32,0xc213a7a5,0x3f350507,2
+np.float32,0x4293a7a5,0x3661deee,2
+np.float32,0xc293a7a5,0x3661deee,2
+np.float32,0x4313a7a5,0xbf800000,2
+np.float32,0xc313a7a5,0xbf800000,2
+np.float32,0x4216cbe4,0x3f800000,2
+np.float32,0xc216cbe4,0x3f800000,2
+np.float32,0x4296cbe4,0x3f800000,2
+np.float32,0xc296cbe4,0x3f800000,2
+np.float32,0x4316cbe4,0x3f800000,2
+np.float32,0xc316cbe4,0x3f800000,2
+np.float32,0x4219f024,0x3f3504d8,2
+np.float32,0xc219f024,0x3f3504d8,2
+np.float32,0x4299f024,0xb69bde6c,2
+np.float32,0xc299f024,0xb69bde6c,2
+np.float32,0x4319f024,0xbf800000,2
+np.float32,0xc319f024,0xbf800000,2
+np.float32,0x421d1463,0xb5455799,2
+np.float32,0xc21d1463,0xb5455799,2
+np.float32,0x429d1463,0xbf800000,2
+np.float32,0xc29d1463,0xbf800000,2
+np.float32,0x431d1463,0x3f800000,2
+np.float32,0xc31d1463,0x3f800000,2
+np.float32,0x422038a3,0xbf350516,2
+np.float32,0xc22038a3,0xbf350516,2
+np.float32,0x42a038a3,0x36c6cd61,2
+np.float32,0xc2a038a3,0x36c6cd61,2
+np.float32,0x432038a3,0xbf800000,2
+np.float32,0xc32038a3,0xbf800000,2
+np.float32,0x42235ce2,0xbf800000,2
+np.float32,0xc2235ce2,0xbf800000,2
+np.float32,0x42a35ce2,0x3f800000,2
+np.float32,0xc2a35ce2,0x3f800000,2
+np.float32,0x43235ce2,0x3f800000,2
+np.float32,0xc3235ce2,0x3f800000,2
+np.float32,0x42268121,0xbf3504f6,2
+np.float32,0xc2268121,0xbf3504f6,2
+np.float32,0x42a68121,0x34e43aac,2
+np.float32,0xc2a68121,0x34e43aac,2
+np.float32,0x43268121,0xbf800000,2
+np.float32,0xc3268121,0xbf800000,2
+np.float32,0x4229a561,0x360733d0,2
+np.float32,0xc229a561,0x360733d0,2
+np.float32,0x42a9a561,0xbf800000,2
+np.float32,0xc2a9a561,0xbf800000,2
+np.float32,0x4329a561,0x3f800000,2
+np.float32,0xc329a561,0x3f800000,2
+np.float32,0x422cc9a0,0x3f3504f8,2
+np.float32,0xc22cc9a0,0x3f3504f8,2
+np.float32,0x42acc9a0,0x35655a50,2
+np.float32,0xc2acc9a0,0x35655a50,2
+np.float32,0x432cc9a0,0xbf800000,2
+np.float32,0xc32cc9a0,0xbf800000,2
+np.float32,0x422fede0,0x3f800000,2
+np.float32,0xc22fede0,0x3f800000,2
+np.float32,0x42afede0,0x3f800000,2
+np.float32,0xc2afede0,0x3f800000,2
+np.float32,0x432fede0,0x3f800000,2
+np.float32,0xc32fede0,0x3f800000,2
+np.float32,0x4233121f,0x3f3504e7,2
+np.float32,0xc233121f,0x3f3504e7,2
+np.float32,0x42b3121f,0xb60f347d,2
+np.float32,0xc2b3121f,0xb60f347d,2
+np.float32,0x4333121f,0xbf800000,2
+np.float32,0xc333121f,0xbf800000,2
+np.float32,0x4236365e,0x350bb91c,2
+np.float32,0xc236365e,0x350bb91c,2
+np.float32,0x42b6365e,0xbf800000,2
+np.float32,0xc2b6365e,0xbf800000,2
+np.float32,0x4336365e,0x3f800000,2
+np.float32,0xc336365e,0x3f800000,2
+np.float32,0x42395a9e,0xbf350507,2
+np.float32,0xc2395a9e,0xbf350507,2
+np.float32,0x42b95a9e,0x36651267,2
+np.float32,0xc2b95a9e,0x36651267,2
+np.float32,0x43395a9e,0xbf800000,2
+np.float32,0xc3395a9e,0xbf800000,2
+np.float32,0x423c7edd,0xbf800000,2
+np.float32,0xc23c7edd,0xbf800000,2
+np.float32,0x42bc7edd,0x3f800000,2
+np.float32,0xc2bc7edd,0x3f800000,2
+np.float32,0x433c7edd,0x3f800000,2
+np.float32,0xc33c7edd,0x3f800000,2
+np.float32,0x423fa31d,0xbf3504d7,2
+np.float32,0xc23fa31d,0xbf3504d7,2
+np.float32,0x42bfa31d,0xb69d7828,2
+np.float32,0xc2bfa31d,0xb69d7828,2
+np.float32,0x433fa31d,0xbf800000,2
+np.float32,0xc33fa31d,0xbf800000,2
+np.float32,0x4242c75c,0x354bbe8a,2
+np.float32,0xc242c75c,0x354bbe8a,2
+np.float32,0x42c2c75c,0xbf800000,2
+np.float32,0xc2c2c75c,0xbf800000,2
+np.float32,0x4342c75c,0x3f800000,2
+np.float32,0xc342c75c,0x3f800000,2
+np.float32,0x4245eb9c,0x3f350517,2
+np.float32,0xc245eb9c,0x3f350517,2
+np.float32,0x42c5eb9c,0x36c8671d,2
+np.float32,0xc2c5eb9c,0x36c8671d,2
+np.float32,0x4345eb9c,0xbf800000,2
+np.float32,0xc345eb9c,0xbf800000,2
+np.float32,0x42490fdb,0x3f800000,2
+np.float32,0xc2490fdb,0x3f800000,2
+np.float32,0x42c90fdb,0x3f800000,2
+np.float32,0xc2c90fdb,0x3f800000,2
+np.float32,0x43490fdb,0x3f800000,2
+np.float32,0xc3490fdb,0x3f800000,2
+np.float32,0x424c341a,0x3f3504f5,2
+np.float32,0xc24c341a,0x3f3504f5,2
+np.float32,0x42cc341a,0x34ca9ee6,2
+np.float32,0xc2cc341a,0x34ca9ee6,2
+np.float32,0x434c341a,0xbf800000,2
+np.float32,0xc34c341a,0xbf800000,2
+np.float32,0x424f585a,0xb608cd8c,2
+np.float32,0xc24f585a,0xb608cd8c,2
+np.float32,0x42cf585a,0xbf800000,2
+np.float32,0xc2cf585a,0xbf800000,2
+np.float32,0x434f585a,0x3f800000,2
+np.float32,0xc34f585a,0x3f800000,2
+np.float32,0x42527c99,0xbf3504f9,2
+np.float32,0xc2527c99,0xbf3504f9,2
+np.float32,0x42d27c99,0x35722833,2
+np.float32,0xc2d27c99,0x35722833,2
+np.float32,0x43527c99,0xbf800000,2
+np.float32,0xc3527c99,0xbf800000,2
+np.float32,0x4255a0d9,0xbf800000,2
+np.float32,0xc255a0d9,0xbf800000,2
+np.float32,0x42d5a0d9,0x3f800000,2
+np.float32,0xc2d5a0d9,0x3f800000,2
+np.float32,0x4355a0d9,0x3f800000,2
+np.float32,0xc355a0d9,0x3f800000,2
+np.float32,0x4258c518,0xbf3504e6,2
+np.float32,0xc258c518,0xbf3504e6,2
+np.float32,0x42d8c518,0xb61267f6,2
+np.float32,0xc2d8c518,0xb61267f6,2
+np.float32,0x4358c518,0xbf800000,2
+np.float32,0xc358c518,0xbf800000,2
+np.float32,0x425be958,0x365eab75,2
+np.float32,0xc25be958,0x365eab75,2
+np.float32,0x42dbe958,0xbf800000,2
+np.float32,0xc2dbe958,0xbf800000,2
+np.float32,0x435be958,0x3f800000,2
+np.float32,0xc35be958,0x3f800000,2
+np.float32,0x425f0d97,0x3f350508,2
+np.float32,0xc25f0d97,0x3f350508,2
+np.float32,0x42df0d97,0x366845e0,2
+np.float32,0xc2df0d97,0x366845e0,2
+np.float32,0x435f0d97,0xbf800000,2
+np.float32,0xc35f0d97,0xbf800000,2
+np.float32,0x426231d6,0x3f800000,2
+np.float32,0xc26231d6,0x3f800000,2
+np.float32,0x42e231d6,0x3f800000,2
+np.float32,0xc2e231d6,0x3f800000,2
+np.float32,0x436231d6,0x3f800000,2
+np.float32,0xc36231d6,0x3f800000,2
+np.float32,0x42655616,0x3f3504d7,2
+np.float32,0xc2655616,0x3f3504d7,2
+np.float32,0x42e55616,0xb69f11e5,2
+np.float32,0xc2e55616,0xb69f11e5,2
+np.float32,0x43655616,0xbf800000,2
+np.float32,0xc3655616,0xbf800000,2
+np.float32,0x42687a55,0xb552257b,2
+np.float32,0xc2687a55,0xb552257b,2
+np.float32,0x42e87a55,0xbf800000,2
+np.float32,0xc2e87a55,0xbf800000,2
+np.float32,0x43687a55,0x3f800000,2
+np.float32,0xc3687a55,0x3f800000,2
+np.float32,0x426b9e95,0xbf350517,2
+np.float32,0xc26b9e95,0xbf350517,2
+np.float32,0x42eb9e95,0x36ca00d9,2
+np.float32,0xc2eb9e95,0x36ca00d9,2
+np.float32,0x436b9e95,0xbf800000,2
+np.float32,0xc36b9e95,0xbf800000,2
+np.float32,0x426ec2d4,0xbf800000,2
+np.float32,0xc26ec2d4,0xbf800000,2
+np.float32,0x42eec2d4,0x3f800000,2
+np.float32,0xc2eec2d4,0x3f800000,2
+np.float32,0x436ec2d4,0x3f800000,2
+np.float32,0xc36ec2d4,0x3f800000,2
+np.float32,0x4271e713,0xbf3504f5,2
+np.float32,0xc271e713,0xbf3504f5,2
+np.float32,0x42f1e713,0x34b10321,2
+np.float32,0xc2f1e713,0x34b10321,2
+np.float32,0x4371e713,0xbf800000,2
+np.float32,0xc371e713,0xbf800000,2
+np.float32,0x42750b53,0x360a6748,2
+np.float32,0xc2750b53,0x360a6748,2
+np.float32,0x42f50b53,0xbf800000,2
+np.float32,0xc2f50b53,0xbf800000,2
+np.float32,0x43750b53,0x3f800000,2
+np.float32,0xc3750b53,0x3f800000,2
+np.float32,0x42782f92,0x3f3504f9,2
+np.float32,0xc2782f92,0x3f3504f9,2
+np.float32,0x42f82f92,0x357ef616,2
+np.float32,0xc2f82f92,0x357ef616,2
+np.float32,0x43782f92,0xbf800000,2
+np.float32,0xc3782f92,0xbf800000,2
+np.float32,0x427b53d2,0x3f800000,2
+np.float32,0xc27b53d2,0x3f800000,2
+np.float32,0x42fb53d2,0x3f800000,2
+np.float32,0xc2fb53d2,0x3f800000,2
+np.float32,0x437b53d2,0x3f800000,2
+np.float32,0xc37b53d2,0x3f800000,2
+np.float32,0x427e7811,0x3f3504e6,2
+np.float32,0xc27e7811,0x3f3504e6,2
+np.float32,0x42fe7811,0xb6159b6f,2
+np.float32,0xc2fe7811,0xb6159b6f,2
+np.float32,0x437e7811,0xbf800000,2
+np.float32,0xc37e7811,0xbf800000,2
+np.float32,0x4280ce28,0x34fdd672,2
+np.float32,0xc280ce28,0x34fdd672,2
+np.float32,0x4300ce28,0xbf800000,2
+np.float32,0xc300ce28,0xbf800000,2
+np.float32,0x4380ce28,0x3f800000,2
+np.float32,0xc380ce28,0x3f800000,2
+np.float32,0x42826048,0xbf350508,2
+np.float32,0xc2826048,0xbf350508,2
+np.float32,0x43026048,0x366b7958,2
+np.float32,0xc3026048,0x366b7958,2
+np.float32,0x43826048,0xbf800000,2
+np.float32,0xc3826048,0xbf800000,2
+np.float32,0x4283f268,0xbf800000,2
+np.float32,0xc283f268,0xbf800000,2
+np.float32,0x4303f268,0x3f800000,2
+np.float32,0xc303f268,0x3f800000,2
+np.float32,0x4383f268,0x3f800000,2
+np.float32,0xc383f268,0x3f800000,2
+np.float32,0x42858487,0xbf350504,2
+np.float32,0xc2858487,0xbf350504,2
+np.float32,0x43058487,0x363ea8be,2
+np.float32,0xc3058487,0x363ea8be,2
+np.float32,0x43858487,0xbf800000,2
+np.float32,0xc3858487,0xbf800000,2
+np.float32,0x428716a7,0x35588c6d,2
+np.float32,0xc28716a7,0x35588c6d,2
+np.float32,0x430716a7,0xbf800000,2
+np.float32,0xc30716a7,0xbf800000,2
+np.float32,0x438716a7,0x3f800000,2
+np.float32,0xc38716a7,0x3f800000,2
+np.float32,0x4288a8c7,0x3f350517,2
+np.float32,0xc288a8c7,0x3f350517,2
+np.float32,0x4308a8c7,0x36cb9a96,2
+np.float32,0xc308a8c7,0x36cb9a96,2
+np.float32,0x4388a8c7,0xbf800000,2
+np.float32,0xc388a8c7,0xbf800000,2
+np.float32,0x428a3ae7,0x3f800000,2
+np.float32,0xc28a3ae7,0x3f800000,2
+np.float32,0x430a3ae7,0x3f800000,2
+np.float32,0xc30a3ae7,0x3f800000,2
+np.float32,0x438a3ae7,0x3f800000,2
+np.float32,0xc38a3ae7,0x3f800000,2
+np.float32,0x428bcd06,0x3f3504f5,2
+np.float32,0xc28bcd06,0x3f3504f5,2
+np.float32,0x430bcd06,0x3497675b,2
+np.float32,0xc30bcd06,0x3497675b,2
+np.float32,0x438bcd06,0xbf800000,2
+np.float32,0xc38bcd06,0xbf800000,2
+np.float32,0x428d5f26,0xb60c0105,2
+np.float32,0xc28d5f26,0xb60c0105,2
+np.float32,0x430d5f26,0xbf800000,2
+np.float32,0xc30d5f26,0xbf800000,2
+np.float32,0x438d5f26,0x3f800000,2
+np.float32,0xc38d5f26,0x3f800000,2
+np.float32,0x428ef146,0xbf350526,2
+np.float32,0xc28ef146,0xbf350526,2
+np.float32,0x430ef146,0x3710bc40,2
+np.float32,0xc30ef146,0x3710bc40,2
+np.float32,0x438ef146,0xbf800000,2
+np.float32,0xc38ef146,0xbf800000,2
+np.float32,0x42908365,0xbf800000,2
+np.float32,0xc2908365,0xbf800000,2
+np.float32,0x43108365,0x3f800000,2
+np.float32,0xc3108365,0x3f800000,2
+np.float32,0x43908365,0x3f800000,2
+np.float32,0xc3908365,0x3f800000,2
+np.float32,0x42921585,0xbf3504e6,2
+np.float32,0xc2921585,0xbf3504e6,2
+np.float32,0x43121585,0xb618cee8,2
+np.float32,0xc3121585,0xb618cee8,2
+np.float32,0x43921585,0xbf800000,2
+np.float32,0xc3921585,0xbf800000,2
+np.float32,0x4293a7a5,0x3661deee,2
+np.float32,0xc293a7a5,0x3661deee,2
+np.float32,0x4313a7a5,0xbf800000,2
+np.float32,0xc313a7a5,0xbf800000,2
+np.float32,0x4393a7a5,0x3f800000,2
+np.float32,0xc393a7a5,0x3f800000,2
+np.float32,0x429539c5,0x3f350536,2
+np.float32,0xc29539c5,0x3f350536,2
+np.float32,0x431539c5,0x373bab34,2
+np.float32,0xc31539c5,0x373bab34,2
+np.float32,0x439539c5,0xbf800000,2
+np.float32,0xc39539c5,0xbf800000,2
+np.float32,0x4296cbe4,0x3f800000,2
+np.float32,0xc296cbe4,0x3f800000,2
+np.float32,0x4316cbe4,0x3f800000,2
+np.float32,0xc316cbe4,0x3f800000,2
+np.float32,0x4396cbe4,0x3f800000,2
+np.float32,0xc396cbe4,0x3f800000,2
+np.float32,0x42985e04,0x3f3504d7,2
+np.float32,0xc2985e04,0x3f3504d7,2
+np.float32,0x43185e04,0xb6a2455d,2
+np.float32,0xc3185e04,0xb6a2455d,2
+np.float32,0x43985e04,0xbf800000,2
+np.float32,0xc3985e04,0xbf800000,2
+np.float32,0x4299f024,0xb69bde6c,2
+np.float32,0xc299f024,0xb69bde6c,2
+np.float32,0x4319f024,0xbf800000,2
+np.float32,0xc319f024,0xbf800000,2
+np.float32,0x4399f024,0x3f800000,2
+np.float32,0xc399f024,0x3f800000,2
+np.float32,0x429b8243,0xbf3504ea,2
+np.float32,0xc29b8243,0xbf3504ea,2
+np.float32,0x431b8243,0xb5cb2eb8,2
+np.float32,0xc31b8243,0xb5cb2eb8,2
+np.float32,0x439b8243,0xbf800000,2
+np.float32,0xc39b8243,0xbf800000,2
+np.float32,0x435b2047,0x3f3504c1,2
+np.float32,0x42a038a2,0xb5e4ca7e,2
+np.float32,0x432038a2,0xbf800000,2
+np.float32,0x4345eb9b,0xbf800000,2
+np.float32,0x42c5eb9b,0xb5de638c,2
+np.float32,0x42eb9e94,0xb5d7fc9b,2
+np.float32,0x4350ea79,0x3631dadb,2
+np.float32,0x42dbe957,0xbf800000,2
+np.float32,0x425be957,0xb505522a,2
+np.float32,0x435be957,0x3f800000,2
+np.float32,0x46027eb2,0x3e7d94c9,2
+np.float32,0x4477baed,0xbe7f1824,2
+np.float32,0x454b8024,0x3e7f5268,2
+np.float32,0x455d2c09,0x3e7f40cb,2
+np.float32,0x4768d3de,0xba14b4af,2
+np.float32,0x46c1e7cd,0x3e7fb102,2
+np.float32,0x44a52949,0xbe7dc9d5,2
+np.float32,0x4454633a,0x3e7dbc7d,2
+np.float32,0x4689810b,0x3e7eb02b,2
+np.float32,0x473473cd,0xbe7eef6f,2
+np.float32,0x44a5193f,0x3e7e1b1f,2
+np.float32,0x46004b36,0x3e7dac59,2
+np.float32,0x467f604b,0x3d7ffd3a,2
+np.float32,0x45ea1805,0x3dffd2e0,2
+np.float32,0x457b6af3,0x3dff7831,2
+np.float32,0x44996159,0xbe7d85f4,2
+np.float32,0x47883553,0xbb80584e,2
+np.float32,0x44e19f0c,0xbdffcfe6,2
+np.float32,0x472b3bf6,0xbe7f7a82,2
+np.float32,0x4600bb4e,0x3a135e33,2
+np.float32,0x449f4556,0x3e7e42e5,2
+np.float32,0x474e9420,0x3dff77b2,2
+np.float32,0x45cbdb23,0x3dff7240,2
+np.float32,0x44222747,0x3dffb039,2
+np.float32,0x4772e419,0xbdff74b8,2
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-exp b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-exp
new file mode 100644
index 000000000..7c5ef3b33
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-exp
@@ -0,0 +1,412 @@
+dtype,input,output,ulperrortol
+## +ve denormals ##
+np.float32,0x004b4716,0x3f800000,3
+np.float32,0x007b2490,0x3f800000,3
+np.float32,0x007c99fa,0x3f800000,3
+np.float32,0x00734a0c,0x3f800000,3
+np.float32,0x0070de24,0x3f800000,3
+np.float32,0x00495d65,0x3f800000,3
+np.float32,0x006894f6,0x3f800000,3
+np.float32,0x00555a76,0x3f800000,3
+np.float32,0x004e1fb8,0x3f800000,3
+np.float32,0x00687de9,0x3f800000,3
+## -ve denormals ##
+np.float32,0x805b59af,0x3f800000,3
+np.float32,0x807ed8ed,0x3f800000,3
+np.float32,0x807142ad,0x3f800000,3
+np.float32,0x80772002,0x3f800000,3
+np.float32,0x8062abcb,0x3f800000,3
+np.float32,0x8045e31c,0x3f800000,3
+np.float32,0x805f01c2,0x3f800000,3
+np.float32,0x80506432,0x3f800000,3
+np.float32,0x8060089d,0x3f800000,3
+np.float32,0x8071292f,0x3f800000,3
+## floats that output a denormal ##
+np.float32,0xc2cf3fc1,0x00000001,3
+np.float32,0xc2c79726,0x00000021,3
+np.float32,0xc2cb295d,0x00000005,3
+np.float32,0xc2b49e6b,0x00068c4c,3
+np.float32,0xc2ca8116,0x00000008,3
+np.float32,0xc2c23f82,0x000001d7,3
+np.float32,0xc2cb69c0,0x00000005,3
+np.float32,0xc2cc1f4d,0x00000003,3
+np.float32,0xc2ae094e,0x00affc4c,3
+np.float32,0xc2c86c44,0x00000015,3
+## random floats between -87.0f and 88.0f ##
+np.float32,0x4030d7e0,0x417d9a05,3
+np.float32,0x426f60e8,0x6aa1be2c,3
+np.float32,0x41a1b220,0x4e0efc11,3
+np.float32,0xc20cc722,0x26159da7,3
+np.float32,0x41c492bc,0x512ec79d,3
+np.float32,0x40980210,0x42e73a0e,3
+np.float32,0xbf1f7b80,0x3f094de3,3
+np.float32,0x42a678a4,0x7b87a383,3
+np.float32,0xc20f3cfd,0x25a1c304,3
+np.float32,0x423ff34c,0x6216467f,3
+np.float32,0x00000000,0x3f800000,3
+## floats that cause an overflow ##
+np.float32,0x7f06d8c1,0x7f800000,3
+np.float32,0x7f451912,0x7f800000,3
+np.float32,0x7ecceac3,0x7f800000,3
+np.float32,0x7f643b45,0x7f800000,3
+np.float32,0x7e910ea0,0x7f800000,3
+np.float32,0x7eb4756b,0x7f800000,3
+np.float32,0x7f4ec708,0x7f800000,3
+np.float32,0x7f6b4551,0x7f800000,3
+np.float32,0x7d8edbda,0x7f800000,3
+np.float32,0x7f730718,0x7f800000,3
+np.float32,0x42b17217,0x7f7fff84,3
+np.float32,0x42b17218,0x7f800000,3
+np.float32,0x42b17219,0x7f800000,3
+np.float32,0xfef2b0bc,0x00000000,3
+np.float32,0xff69f83e,0x00000000,3
+np.float32,0xff4ecb12,0x00000000,3
+np.float32,0xfeac6d86,0x00000000,3
+np.float32,0xfde0cdb8,0x00000000,3
+np.float32,0xff26aef4,0x00000000,3
+np.float32,0xff6f9277,0x00000000,3
+np.float32,0xff7adfc4,0x00000000,3
+np.float32,0xff0ad40e,0x00000000,3
+np.float32,0xff6fd8f3,0x00000000,3
+np.float32,0xc2cff1b4,0x00000001,3
+np.float32,0xc2cff1b5,0x00000000,3
+np.float32,0xc2cff1b6,0x00000000,3
+np.float32,0x7f800000,0x7f800000,3
+np.float32,0xff800000,0x00000000,3
+np.float32,0x4292f27c,0x7480000a,3
+np.float32,0x42a920be,0x7c7fff94,3
+np.float32,0x41c214c9,0x50ffffd9,3
+np.float32,0x41abe686,0x4effffd9,3
+np.float32,0x4287db5a,0x707fffd3,3
+np.float32,0x41902cbb,0x4c800078,3
+np.float32,0x42609466,0x67ffffeb,3
+np.float32,0x41a65af5,0x4e7fffd1,3
+np.float32,0x417f13ff,0x4affffc9,3
+np.float32,0x426d0e6c,0x6a3504f2,3
+np.float32,0x41bc8934,0x507fff51,3
+np.float32,0x42a7bdde,0x7c0000d6,3
+np.float32,0x4120cf66,0x46b504f6,3
+np.float32,0x4244da8f,0x62ffff1a,3
+np.float32,0x41a0cf69,0x4e000034,3
+np.float32,0x41cd2bec,0x52000005,3
+np.float32,0x42893e41,0x7100009e,3
+np.float32,0x41b437e1,0x4fb50502,3
+np.float32,0x41d8430f,0x5300001d,3
+np.float32,0x4244da92,0x62ffffda,3
+np.float32,0x41a0cf63,0x4dffffa9,3
+np.float32,0x3eb17218,0x3fb504f3,3
+np.float32,0x428729e8,0x703504dc,3
+np.float32,0x41a0cf67,0x4e000014,3
+np.float32,0x4252b77d,0x65800011,3
+np.float32,0x41902cb9,0x4c800058,3
+np.float32,0x42a0cf67,0x79800052,3
+np.float32,0x4152b77b,0x48ffffe9,3
+np.float32,0x41265af3,0x46ffffc8,3
+np.float32,0x42187e0b,0x5affff9a,3
+np.float32,0xc0d2b77c,0x3ab504f6,3
+np.float32,0xc283b2ac,0x10000072,3
+np.float32,0xc1cff1b4,0x2cb504f5,3
+np.float32,0xc05dce9e,0x3d000000,3
+np.float32,0xc28ec9d2,0x0bfffea5,3
+np.float32,0xc23c893a,0x1d7fffde,3
+np.float32,0xc2a920c0,0x027fff6c,3
+np.float32,0xc1f9886f,0x2900002b,3
+np.float32,0xc2c42920,0x000000b5,3
+np.float32,0xc2893e41,0x0dfffec5,3
+np.float32,0xc2c4da93,0x00000080,3
+np.float32,0xc17f1401,0x3400000c,3
+np.float32,0xc1902cb6,0x327fffaf,3
+np.float32,0xc27c4e3b,0x11ffffc5,3
+np.float32,0xc268e5c5,0x157ffe9d,3
+np.float32,0xc2b4e953,0x0005a826,3
+np.float32,0xc287db5a,0x0e800016,3
+np.float32,0xc207db5a,0x2700000b,3
+np.float32,0xc2b2d4fe,0x000ffff1,3
+np.float32,0xc268e5c0,0x157fffdd,3
+np.float32,0xc22920bd,0x2100003b,3
+np.float32,0xc2902caf,0x0b80011e,3
+np.float32,0xc1902cba,0x327fff2f,3
+np.float32,0xc2ca6625,0x00000008,3
+np.float32,0xc280ece8,0x10fffeb5,3
+np.float32,0xc2918f94,0x0b0000ea,3
+np.float32,0xc29b43d5,0x077ffffc,3
+np.float32,0xc1e61ff7,0x2ab504f5,3
+np.float32,0xc2867878,0x0effff15,3
+np.float32,0xc2a2324a,0x04fffff4,3
+#float64
+## near zero ##
+np.float64,0x8000000000000000,0x3ff0000000000000,1
+np.float64,0x8010000000000000,0x3ff0000000000000,1
+np.float64,0x8000000000000001,0x3ff0000000000000,1
+np.float64,0x8360000000000000,0x3ff0000000000000,1
+np.float64,0x9a70000000000000,0x3ff0000000000000,1
+np.float64,0xb9b0000000000000,0x3ff0000000000000,1
+np.float64,0xb810000000000000,0x3ff0000000000000,1
+np.float64,0xbc30000000000000,0x3ff0000000000000,1
+np.float64,0xb6a0000000000000,0x3ff0000000000000,1
+np.float64,0x0000000000000000,0x3ff0000000000000,1
+np.float64,0x0010000000000000,0x3ff0000000000000,1
+np.float64,0x0000000000000001,0x3ff0000000000000,1
+np.float64,0x0360000000000000,0x3ff0000000000000,1
+np.float64,0x1a70000000000000,0x3ff0000000000000,1
+np.float64,0x3c30000000000000,0x3ff0000000000000,1
+np.float64,0x36a0000000000000,0x3ff0000000000000,1
+np.float64,0x39b0000000000000,0x3ff0000000000000,1
+np.float64,0x3810000000000000,0x3ff0000000000000,1
+## underflow ##
+np.float64,0xc0c6276800000000,0x0000000000000000,1
+np.float64,0xc0c62d918ce2421d,0x0000000000000000,1
+np.float64,0xc0c62d918ce2421e,0x0000000000000000,1
+np.float64,0xc0c62d91a0000000,0x0000000000000000,1
+np.float64,0xc0c62d9180000000,0x0000000000000000,1
+np.float64,0xc0c62dea45ee3e06,0x0000000000000000,1
+np.float64,0xc0c62dea45ee3e07,0x0000000000000000,1
+np.float64,0xc0c62dea40000000,0x0000000000000000,1
+np.float64,0xc0c62dea60000000,0x0000000000000000,1
+np.float64,0xc0875f1120000000,0x0000000000000000,1
+np.float64,0xc0875f113c30b1c8,0x0000000000000000,1
+np.float64,0xc0875f1140000000,0x0000000000000000,1
+np.float64,0xc093480000000000,0x0000000000000000,1
+np.float64,0xffefffffffffffff,0x0000000000000000,1
+np.float64,0xc7efffffe0000000,0x0000000000000000,1
+## overflow ##
+np.float64,0x40862e52fefa39ef,0x7ff0000000000000,1
+np.float64,0x40872e42fefa39ef,0x7ff0000000000000,1
+## +/- INF, +/- NAN ##
+np.float64,0x7ff0000000000000,0x7ff0000000000000,1
+np.float64,0xfff0000000000000,0x0000000000000000,1
+np.float64,0x7ff8000000000000,0x7ff8000000000000,1
+np.float64,0xfff8000000000000,0xfff8000000000000,1
+## output denormal ##
+np.float64,0xc087438520000000,0x0000000000000001,1
+np.float64,0xc08743853f2f4461,0x0000000000000001,1
+np.float64,0xc08743853f2f4460,0x0000000000000001,1
+np.float64,0xc087438540000000,0x0000000000000001,1
+## between -745.13321910 and 709.78271289 ##
+np.float64,0xbff760cd14774bd9,0x3fcdb14ced00ceb6,1
+np.float64,0xbff760cd20000000,0x3fcdb14cd7993879,1
+np.float64,0xbff760cd00000000,0x3fcdb14d12fbd264,1
+np.float64,0xc07f1cf360000000,0x130c1b369af14fda,1
+np.float64,0xbeb0000000000000,0x3feffffe00001000,1
+np.float64,0xbd70000000000000,0x3fefffffffffe000,1
+np.float64,0xc084fd46e5c84952,0x0360000000000139,1
+np.float64,0xc084fd46e5c84953,0x035ffffffffffe71,1
+np.float64,0xc084fd46e0000000,0x0360000b9096d32c,1
+np.float64,0xc084fd4700000000,0x035fff9721d12104,1
+np.float64,0xc086232bc0000000,0x0010003af5e64635,1
+np.float64,0xc086232bdd7abcd2,0x001000000000007c,1
+np.float64,0xc086232bdd7abcd3,0x000ffffffffffe7c,1
+np.float64,0xc086232be0000000,0x000ffffaf57a6fc9,1
+np.float64,0xc086233920000000,0x000fe590e3b45eb0,1
+np.float64,0xc086233938000000,0x000fe56133493c57,1
+np.float64,0xc086233940000000,0x000fe5514deffbbc,1
+np.float64,0xc086234c98000000,0x000fbf1024c32ccb,1
+np.float64,0xc086234ca0000000,0x000fbf0065bae78d,1
+np.float64,0xc086234c80000000,0x000fbf3f623a7724,1
+np.float64,0xc086234ec0000000,0x000fbad237c846f9,1
+np.float64,0xc086234ec8000000,0x000fbac27cfdec97,1
+np.float64,0xc086234ee0000000,0x000fba934cfd3dc2,1
+np.float64,0xc086234ef0000000,0x000fba73d7f618d9,1
+np.float64,0xc086234f00000000,0x000fba54632dddc0,1
+np.float64,0xc0862356e0000000,0x000faae0945b761a,1
+np.float64,0xc0862356f0000000,0x000faac13eb9a310,1
+np.float64,0xc086235700000000,0x000faaa1e9567b0a,1
+np.float64,0xc086236020000000,0x000f98cd75c11ed7,1
+np.float64,0xc086236ca0000000,0x000f8081b4d93f89,1
+np.float64,0xc086236cb0000000,0x000f8062b3f4d6c5,1
+np.float64,0xc086236cc0000000,0x000f8043b34e6f8c,1
+np.float64,0xc086238d98000000,0x000f41220d9b0d2c,1
+np.float64,0xc086238da0000000,0x000f4112cc80a01f,1
+np.float64,0xc086238d80000000,0x000f414fd145db5b,1
+np.float64,0xc08624fd00000000,0x000cbfce8ea1e6c4,1
+np.float64,0xc086256080000000,0x000c250747fcd46e,1
+np.float64,0xc08626c480000000,0x000a34f4bd975193,1
+np.float64,0xbf50000000000000,0x3feff800ffeaac00,1
+np.float64,0xbe10000000000000,0x3fefffffff800000,1
+np.float64,0xbcd0000000000000,0x3feffffffffffff8,1
+np.float64,0xc055d589e0000000,0x38100004bf94f63e,1
+np.float64,0xc055d58a00000000,0x380ffff97f292ce8,1
+np.float64,0xbfd962d900000000,0x3fe585a4b00110e1,1
+np.float64,0x3ff4bed280000000,0x400d411e7a58a303,1
+np.float64,0x3fff0b3620000000,0x401bd7737ffffcf3,1
+np.float64,0x3ff0000000000000,0x4005bf0a8b145769,1
+np.float64,0x3eb0000000000000,0x3ff0000100000800,1
+np.float64,0x3d70000000000000,0x3ff0000000001000,1
+np.float64,0x40862e42e0000000,0x7fefff841808287f,1
+np.float64,0x40862e42fefa39ef,0x7fefffffffffff2a,1
+np.float64,0x40862e0000000000,0x7feef85a11e73f2d,1
+np.float64,0x4000000000000000,0x401d8e64b8d4ddae,1
+np.float64,0x4009242920000000,0x40372a52c383a488,1
+np.float64,0x4049000000000000,0x44719103e4080b45,1
+np.float64,0x4008000000000000,0x403415e5bf6fb106,1
+np.float64,0x3f50000000000000,0x3ff00400800aab55,1
+np.float64,0x3e10000000000000,0x3ff0000000400000,1
+np.float64,0x3cd0000000000000,0x3ff0000000000004,1
+np.float64,0x40562e40a0000000,0x47effed088821c3f,1
+np.float64,0x40562e42e0000000,0x47effff082e6c7ff,1
+np.float64,0x40562e4300000000,0x47f00000417184b8,1
+np.float64,0x3fe8000000000000,0x4000ef9db467dcf8,1
+np.float64,0x402b12e8d4f33589,0x412718f68c71a6fe,1
+np.float64,0x402b12e8d4f3358a,0x412718f68c71a70a,1
+np.float64,0x402b12e8c0000000,0x412718f59a7f472e,1
+np.float64,0x402b12e8e0000000,0x412718f70c0eac62,1
+##use 1th entry
+np.float64,0x40631659AE147CB4,0x4db3a95025a4890f,1
+np.float64,0xC061B87D2E85A4E2,0x332640c8e2de2c51,1
+np.float64,0x405A4A50BE243AF4,0x496a45e4b7f0339a,1
+np.float64,0xC0839898B98EC5C6,0x0764027828830df4,1
+#use 2th entry
+np.float64,0xC072428C44B6537C,0x2596ade838b96f3e,1
+np.float64,0xC053057C5E1AE9BF,0x3912c8fad18fdadf,1
+np.float64,0x407E89C78328BAA3,0x6bfe35d5b9a1a194,1
+np.float64,0x4083501B6DD87112,0x77a855503a38924e,1
+#use 3th entry
+np.float64,0x40832C6195F24540,0x7741e73c80e5eb2f,1
+np.float64,0xC083D4CD557C2EC9,0x06b61727c2d2508e,1
+np.float64,0x400C48F5F67C99BD,0x404128820f02b92e,1
+np.float64,0x4056E36D9B2DF26A,0x4830f52ff34a8242,1
+#use 4th entry
+np.float64,0x4080FF700D8CBD06,0x70fa70df9bc30f20,1
+np.float64,0x406C276D39E53328,0x543eb8e20a8f4741,1
+np.float64,0xC070D6159BBD8716,0x27a4a0548c904a75,1
+np.float64,0xC052EBCF8ED61F83,0x391c0e92368d15e4,1
+#use 5th entry
+np.float64,0xC061F892A8AC5FBE,0x32f807a89efd3869,1
+np.float64,0x4021D885D2DBA085,0x40bd4dc86d3e3270,1
+np.float64,0x40767AEEEE7D4FCF,0x605e22851ee2afb7,1
+np.float64,0xC0757C5D75D08C80,0x20f0751599b992a2,1
+#use 6th entry
+np.float64,0x405ACF7A284C4CE3,0x499a4e0b7a27027c,1
+np.float64,0xC085A6C9E80D7AF5,0x0175914009d62ec2,1
+np.float64,0xC07E4C02F86F1DAE,0x1439269b29a9231e,1
+np.float64,0x4080D80F9691CC87,0x7088a6cdafb041de,1
+#use 7th entry
+np.float64,0x407FDFD84FBA0AC1,0x6deb1ae6f9bc4767,1
+np.float64,0x40630C06A1A2213D,0x4dac7a9d51a838b7,1
+np.float64,0x40685FDB30BB8B4F,0x5183f5cc2cac9e79,1
+np.float64,0x408045A2208F77F4,0x6ee299e08e2aa2f0,1
+#use 8th entry
+np.float64,0xC08104E391F5078B,0x0ed397b7cbfbd230,1
+np.float64,0xC031501CAEFAE395,0x3e6040fd1ea35085,1
+np.float64,0xC079229124F6247C,0x1babf4f923306b1e,1
+np.float64,0x407FB65F44600435,0x6db03beaf2512b8a,1
+#use 9th entry
+np.float64,0xC07EDEE8E8E8A5AC,0x136536cec9cbef48,1
+np.float64,0x4072BB4086099A14,0x5af4d3c3008b56cc,1
+np.float64,0x4050442A2EC42CB4,0x45cd393bd8fad357,1
+np.float64,0xC06AC28FB3D419B4,0x2ca1b9d3437df85f,1
+#use 10th entry
+np.float64,0x40567FC6F0A68076,0x480c977fd5f3122e,1
+np.float64,0x40620A2F7EDA59BB,0x4cf278e96f4ce4d7,1
+np.float64,0xC085044707CD557C,0x034aad6c968a045a,1
+np.float64,0xC07374EA5AC516AA,0x23dd6afdc03e83d5,1
+#use 11th entry
+np.float64,0x4073CC95332619C1,0x5c804b1498bbaa54,1
+np.float64,0xC0799FEBBE257F31,0x1af6a954c43b87d2,1
+np.float64,0x408159F19EA424F6,0x7200858efcbfc84d,1
+np.float64,0x404A81F6F24C0792,0x44b664a07ce5bbfa,1
+#use 12th entry
+np.float64,0x40295FF1EFB9A741,0x4113c0e74c52d7b0,1
+np.float64,0x4073975F4CC411DA,0x5c32be40b4fec2c1,1
+np.float64,0x406E9DE52E82A77E,0x56049c9a3f1ae089,1
+np.float64,0x40748C2F52560ED9,0x5d93bc14fd4cd23b,1
+#use 13th entry
+np.float64,0x4062A553CDC4D04C,0x4d6266bfde301318,1
+np.float64,0xC079EC1D63598AB7,0x1a88cb184dab224c,1
+np.float64,0xC0725C1CB3167427,0x25725b46f8a081f6,1
+np.float64,0x407888771D9B45F9,0x6353b1ec6bd7ce80,1
+#use 14th entry
+np.float64,0xC082CBA03AA89807,0x09b383723831ce56,1
+np.float64,0xC083A8961BB67DD7,0x0735b118d5275552,1
+np.float64,0xC076BC6ECA12E7E3,0x1f2222679eaef615,1
+np.float64,0xC072752503AA1A5B,0x254eb832242c77e1,1
+#use 15th entry
+np.float64,0xC058800792125DEC,0x371882372a0b48d4,1
+np.float64,0x4082909FD863E81C,0x7580d5f386920142,1
+np.float64,0xC071616F8FB534F9,0x26dbe20ef64a412b,1
+np.float64,0x406D1AB571CAA747,0x54ee0d55cb38ac20,1
+#use 16th entry
+np.float64,0x406956428B7DAD09,0x52358682c271237f,1
+np.float64,0xC07EFC2D9D17B621,0x133b3e77c27a4d45,1
+np.float64,0xC08469BAC5BA3CCA,0x050863e5f42cc52f,1
+np.float64,0x407189D9626386A5,0x593cb1c0b3b5c1d3,1
+#use 17th entry
+np.float64,0x4077E652E3DEB8C6,0x6269a10dcbd3c752,1
+np.float64,0x407674C97DB06878,0x605485dcc2426ec2,1
+np.float64,0xC07CE9969CF4268D,0x16386cf8996669f2,1
+np.float64,0x40780EE32D5847C4,0x62a436bd1abe108d,1
+#use 18th entry
+np.float64,0x4076C3AA5E1E8DA1,0x60c62f56a5e72e24,1
+np.float64,0xC0730AFC7239B9BE,0x24758ead095cec1e,1
+np.float64,0xC085CC2B9C420DDB,0x0109cdaa2e5694c1,1
+np.float64,0x406D0765CB6D7AA4,0x54e06f8dd91bd945,1
+#use 19th entry
+np.float64,0xC082D011F3B495E7,0x09a6647661d279c2,1
+np.float64,0xC072826AF8F6AFBC,0x253acd3cd224507e,1
+np.float64,0x404EB9C4810CEA09,0x457933dbf07e8133,1
+np.float64,0x408284FBC97C58CE,0x755f6eb234aa4b98,1
+#use 20th entry
+np.float64,0x40856008CF6EDC63,0x7d9c0b3c03f4f73c,1
+np.float64,0xC077CB2E9F013B17,0x1d9b3d3a166a55db,1
+np.float64,0xC0479CA3C20AD057,0x3bad40e081555b99,1
+np.float64,0x40844CD31107332A,0x7a821d70aea478e2,1
+#use 21th entry
+np.float64,0xC07C8FCC0BFCC844,0x16ba1cc8c539d19b,1
+np.float64,0xC085C4E9A3ABA488,0x011ff675ba1a2217,1
+np.float64,0x4074D538B32966E5,0x5dfd9d78043c6ad9,1
+np.float64,0xC0630CA16902AD46,0x3231a446074cede6,1
+#use 22th entry
+np.float64,0xC06C826733D7D0B7,0x2b5f1078314d41e1,1
+np.float64,0xC0520DF55B2B907F,0x396c13a6ce8e833e,1
+np.float64,0xC080712072B0F437,0x107eae02d11d98ea,1
+np.float64,0x40528A6150E19EFB,0x469fdabda02228c5,1
+#use 23th entry
+np.float64,0xC07B1D74B6586451,0x18d1253883ae3b48,1
+np.float64,0x4045AFD7867DAEC0,0x43d7d634fc4c5d98,1
+np.float64,0xC07A08B91F9ED3E2,0x1a60973e6397fc37,1
+np.float64,0x407B3ECF0AE21C8C,0x673e03e9d98d7235,1
+#use 24th entry
+np.float64,0xC078AEB6F30CEABF,0x1c530b93ab54a1b3,1
+np.float64,0x4084495006A41672,0x7a775b6dc7e63064,1
+np.float64,0x40830B1C0EBF95DD,0x76e1e6eed77cfb89,1
+np.float64,0x407D93E8F33D8470,0x6a9adbc9e1e4f1e5,1
+#use 25th entry
+np.float64,0x4066B11A09EFD9E8,0x504dd528065c28a7,1
+np.float64,0x408545823723AEEB,0x7d504a9b1844f594,1
+np.float64,0xC068C711F2CA3362,0x2e104f3496ea118e,1
+np.float64,0x407F317FCC3CA873,0x6cf0732c9948ebf4,1
+#use 26th entry
+np.float64,0x407AFB3EBA2ED50F,0x66dc28a129c868d5,1
+np.float64,0xC075377037708ADE,0x21531a329f3d793e,1
+np.float64,0xC07C30066A1F3246,0x174448baa16ded2b,1
+np.float64,0xC06689A75DE2ABD3,0x2fad70662fae230b,1
+#use 27th entry
+np.float64,0x4081514E9FCCF1E0,0x71e673b9efd15f44,1
+np.float64,0xC0762C710AF68460,0x1ff1ed7d8947fe43,1
+np.float64,0xC0468102FF70D9C4,0x3be0c3a8ff3419a3,1
+np.float64,0xC07EA4CEEF02A83E,0x13b908f085102c61,1
+#use 28th entry
+np.float64,0xC06290B04AE823C4,0x328a83da3c2e3351,1
+np.float64,0xC0770EB1D1C395FB,0x1eab281c1f1db5fe,1
+np.float64,0xC06F5D4D838A5BAE,0x29500ea32fb474ea,1
+np.float64,0x40723B3133B54C5D,0x5a3c82c7c3a2b848,1
+#use 29th entry
+np.float64,0x4085E6454CE3B4AA,0x7f20319b9638d06a,1
+np.float64,0x408389F2A0585D4B,0x7850667c58aab3d0,1
+np.float64,0xC0382798F9C8AE69,0x3dc1c79fe8739d6d,1
+np.float64,0xC08299D827608418,0x0a4335f76cdbaeb5,1
+#use 30th entry
+np.float64,0xC06F3DED43301BF1,0x2965670ae46750a8,1
+np.float64,0xC070CAF6BDD577D9,0x27b4aa4ffdd29981,1
+np.float64,0x4078529AD4B2D9F2,0x6305c12755d5e0a6,1
+np.float64,0xC055B14E75A31B96,0x381c2eda6d111e5d,1
+#use 31th entry
+np.float64,0x407B13EE414FA931,0x6700772c7544564d,1
+np.float64,0x407EAFDE9DE3EC54,0x6c346a0e49724a3c,1
+np.float64,0xC08362F398B9530D,0x07ffeddbadf980cb,1
+np.float64,0x407E865CDD9EEB86,0x6bf866cac5e0d126,1
+#use 32th entry
+np.float64,0x407FB62DBC794C86,0x6db009f708ac62cb,1
+np.float64,0xC063D0BAA68CDDDE,0x31a3b2a51ce50430,1
+np.float64,0xC05E7706A2231394,0x34f24bead6fab5c9,1
+np.float64,0x4083E3A06FDE444E,0x79527b7a386d1937,1
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-log b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-log
new file mode 100644
index 000000000..a7bd98481
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-log
@@ -0,0 +1,118 @@
+dtype,input,output,ulperrortol
+## +ve denormals ##
+np.float32,0x004b4716,0xc2afbc1b,4
+np.float32,0x007b2490,0xc2aec01e,4
+np.float32,0x007c99fa,0xc2aeba17,4
+np.float32,0x00734a0c,0xc2aee1dc,4
+np.float32,0x0070de24,0xc2aeecba,4
+np.float32,0x007fffff,0xc2aeac50,4
+np.float32,0x00000001,0xc2ce8ed0,4
+## -ve denormals ##
+np.float32,0x80495d65,0xffc00000,4
+np.float32,0x806894f6,0xffc00000,4
+np.float32,0x80555a76,0xffc00000,4
+np.float32,0x804e1fb8,0xffc00000,4
+np.float32,0x80687de9,0xffc00000,4
+np.float32,0x807fffff,0xffc00000,4
+np.float32,0x80000001,0xffc00000,4
+## +/-0.0f, +/-FLT_MIN +/-FLT_MAX ##
+np.float32,0x00000000,0xff800000,4
+np.float32,0x80000000,0xff800000,4
+np.float32,0x7f7fffff,0x42b17218,4
+np.float32,0x80800000,0xffc00000,4
+np.float32,0xff7fffff,0xffc00000,4
+## 1.00f + 0x00000001 ##
+np.float32,0x3f800000,0x00000000,4
+np.float32,0x3f800001,0x33ffffff,4
+np.float32,0x3f800002,0x347ffffe,4
+np.float32,0x3f7fffff,0xb3800000,4
+np.float32,0x3f7ffffe,0xb4000000,4
+np.float32,0x3f7ffffd,0xb4400001,4
+np.float32,0x402df853,0x3f7ffffe,4
+np.float32,0x402df854,0x3f7fffff,4
+np.float32,0x402df855,0x3f800000,4
+np.float32,0x402df856,0x3f800001,4
+np.float32,0x3ebc5ab0,0xbf800001,4
+np.float32,0x3ebc5ab1,0xbf800000,4
+np.float32,0x3ebc5ab2,0xbf800000,4
+np.float32,0x3ebc5ab3,0xbf7ffffe,4
+np.float32,0x423ef575,0x407768ab,4
+np.float32,0x427b8c61,0x408485dd,4
+np.float32,0x4211e9ee,0x406630b0,4
+np.float32,0x424d5c41,0x407c0fed,4
+np.float32,0x42be722a,0x4091cc91,4
+np.float32,0x42b73d30,0x4090908b,4
+np.float32,0x427e48e2,0x4084de7f,4
+np.float32,0x428f759b,0x4088bba3,4
+np.float32,0x41629069,0x4029a0cc,4
+np.float32,0x4272c99d,0x40836379,4
+np.float32,0x4d1b7458,0x4197463d,4
+np.float32,0x4f10c594,0x41ace2b2,4
+np.float32,0x4ea397c2,0x41a85171,4
+np.float32,0x4fefa9d1,0x41b6769c,4
+np.float32,0x4ebac6ab,0x41a960dc,4
+np.float32,0x4f6efb42,0x41b0e535,4
+np.float32,0x4e9ab8e7,0x41a7df44,4
+np.float32,0x4e81b5d1,0x41a67625,4
+np.float32,0x5014d9f2,0x41b832bd,4
+np.float32,0x4f02175c,0x41ac07b8,4
+np.float32,0x7f034f89,0x42b01c47,4
+np.float32,0x7f56d00e,0x42b11849,4
+np.float32,0x7f1cd5f6,0x42b0773a,4
+np.float32,0x7e979174,0x42af02d7,4
+np.float32,0x7f23369f,0x42b08ba2,4
+np.float32,0x7f0637ae,0x42b0277d,4
+np.float32,0x7efcb6e8,0x42b00897,4
+np.float32,0x7f7907c8,0x42b163f6,4
+np.float32,0x7e95c4c2,0x42aefcba,4
+np.float32,0x7f4577b2,0x42b0ed2d,4
+np.float32,0x3f49c92e,0xbe73ae84,4
+np.float32,0x3f4a23d1,0xbe71e2f8,4
+np.float32,0x3f4abb67,0xbe6ee430,4
+np.float32,0x3f48169a,0xbe7c5532,4
+np.float32,0x3f47f5fa,0xbe7cfc37,4
+np.float32,0x3f488309,0xbe7a2ad8,4
+np.float32,0x3f479df4,0xbe7ebf5f,4
+np.float32,0x3f47cfff,0xbe7dbec9,4
+np.float32,0x3f496704,0xbe75a125,4
+np.float32,0x3f478ee8,0xbe7f0c92,4
+np.float32,0x3f4a763b,0xbe7041ce,4
+np.float32,0x3f47a108,0xbe7eaf94,4
+np.float32,0x3f48136c,0xbe7c6578,4
+np.float32,0x3f481c17,0xbe7c391c,4
+np.float32,0x3f47cd28,0xbe7dcd56,4
+np.float32,0x3f478be8,0xbe7f1bf7,4
+np.float32,0x3f4c1f8e,0xbe67e367,4
+np.float32,0x3f489b0c,0xbe79b03f,4
+np.float32,0x3f4934cf,0xbe76a08a,4
+np.float32,0x3f4954df,0xbe75fd6a,4
+np.float32,0x3f47a3f5,0xbe7ea093,4
+np.float32,0x3f4ba4fc,0xbe6a4b02,4
+np.float32,0x3f47a0e1,0xbe7eb05c,4
+np.float32,0x3f48c30a,0xbe78e42f,4
+np.float32,0x3f48cab8,0xbe78bd05,4
+np.float32,0x3f4b0569,0xbe6d6ea4,4
+np.float32,0x3f47de32,0xbe7d7607,4
+np.float32,0x3f477328,0xbe7f9b00,4
+np.float32,0x3f496dab,0xbe757f52,4
+np.float32,0x3f47662c,0xbe7fddac,4
+np.float32,0x3f48ddd8,0xbe785b80,4
+np.float32,0x3f481866,0xbe7c4bff,4
+np.float32,0x3f48b119,0xbe793fb6,4
+np.float32,0x3f48c7e8,0xbe78cb5c,4
+np.float32,0x3f4985f6,0xbe7503da,4
+np.float32,0x3f483fdf,0xbe7b8212,4
+np.float32,0x3f4b1c76,0xbe6cfa67,4
+np.float32,0x3f480b2e,0xbe7c8fa8,4
+np.float32,0x3f48745f,0xbe7a75bf,4
+np.float32,0x3f485bda,0xbe7af308,4
+np.float32,0x3f47a660,0xbe7e942c,4
+np.float32,0x3f47d4d5,0xbe7da600,4
+np.float32,0x3f4b0a26,0xbe6d56be,4
+np.float32,0x3f4a4883,0xbe712924,4
+np.float32,0x3f4769e7,0xbe7fca84,4
+np.float32,0x3f499702,0xbe74ad3f,4
+np.float32,0x3f494ab1,0xbe763131,4
+np.float32,0x3f476b69,0xbe7fc2c6,4
+np.float32,0x3f4884e8,0xbe7a214a,4
+np.float32,0x3f486945,0xbe7aae76,4
diff --git a/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-sin b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-sin
new file mode 100644
index 000000000..64e78ae15
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/data/umath-validation-set-sin
@@ -0,0 +1,660 @@
+dtype,input,output,ulperrortol
+## +ve denormals ##
+np.float32,0x004b4716,0x004b4716,2
+np.float32,0x007b2490,0x007b2490,2
+np.float32,0x007c99fa,0x007c99fa,2
+np.float32,0x00734a0c,0x00734a0c,2
+np.float32,0x0070de24,0x0070de24,2
+np.float32,0x007fffff,0x007fffff,2
+np.float32,0x00000001,0x00000001,2
+## -ve denormals ##
+np.float32,0x80495d65,0x80495d65,2
+np.float32,0x806894f6,0x806894f6,2
+np.float32,0x80555a76,0x80555a76,2
+np.float32,0x804e1fb8,0x804e1fb8,2
+np.float32,0x80687de9,0x80687de9,2
+np.float32,0x807fffff,0x807fffff,2
+np.float32,0x80000001,0x80000001,2
+## +/-0.0f, +/-FLT_MIN +/-FLT_MAX ##
+np.float32,0x00000000,0x00000000,2
+np.float32,0x80000000,0x80000000,2
+np.float32,0x00800000,0x00800000,2
+np.float32,0x80800000,0x80800000,2
+## 1.00f ##
+np.float32,0x3f800000,0x3f576aa4,2
+np.float32,0x3f800001,0x3f576aa6,2
+np.float32,0x3f800002,0x3f576aa7,2
+np.float32,0xc090a8b0,0x3f7b4e48,2
+np.float32,0x41ce3184,0x3f192d43,2
+np.float32,0xc1d85848,0xbf7161cb,2
+np.float32,0x402b8820,0x3ee3f29f,2
+np.float32,0x42b4e454,0x3f1d0151,2
+np.float32,0x42a67a60,0x3f7ffa4c,2
+np.float32,0x41d92388,0x3f67beef,2
+np.float32,0x422dd66c,0xbeffb0c1,2
+np.float32,0xc28f5be6,0xbf0bae79,2
+np.float32,0x41ab2674,0x3f0ffe2b,2
+np.float32,0x3f490fdb,0x3f3504f3,2
+np.float32,0xbf490fdb,0xbf3504f3,2
+np.float32,0x3fc90fdb,0x3f800000,2
+np.float32,0xbfc90fdb,0xbf800000,2
+np.float32,0x40490fdb,0xb3bbbd2e,2
+np.float32,0xc0490fdb,0x33bbbd2e,2
+np.float32,0x3fc90fdb,0x3f800000,2
+np.float32,0xbfc90fdb,0xbf800000,2
+np.float32,0x40490fdb,0xb3bbbd2e,2
+np.float32,0xc0490fdb,0x33bbbd2e,2
+np.float32,0x40c90fdb,0x343bbd2e,2
+np.float32,0xc0c90fdb,0xb43bbd2e,2
+np.float32,0x4016cbe4,0x3f3504f3,2
+np.float32,0xc016cbe4,0xbf3504f3,2
+np.float32,0x4096cbe4,0xbf800000,2
+np.float32,0xc096cbe4,0x3f800000,2
+np.float32,0x4116cbe4,0xb2ccde2e,2
+np.float32,0xc116cbe4,0x32ccde2e,2
+np.float32,0x40490fdb,0xb3bbbd2e,2
+np.float32,0xc0490fdb,0x33bbbd2e,2
+np.float32,0x40c90fdb,0x343bbd2e,2
+np.float32,0xc0c90fdb,0xb43bbd2e,2
+np.float32,0x41490fdb,0x34bbbd2e,2
+np.float32,0xc1490fdb,0xb4bbbd2e,2
+np.float32,0x407b53d2,0xbf3504f5,2
+np.float32,0xc07b53d2,0x3f3504f5,2
+np.float32,0x40fb53d2,0x3f800000,2
+np.float32,0xc0fb53d2,0xbf800000,2
+np.float32,0x417b53d2,0xb535563d,2
+np.float32,0xc17b53d2,0x3535563d,2
+np.float32,0x4096cbe4,0xbf800000,2
+np.float32,0xc096cbe4,0x3f800000,2
+np.float32,0x4116cbe4,0xb2ccde2e,2
+np.float32,0xc116cbe4,0x32ccde2e,2
+np.float32,0x4196cbe4,0x334cde2e,2
+np.float32,0xc196cbe4,0xb34cde2e,2
+np.float32,0x40afede0,0xbf3504ef,2
+np.float32,0xc0afede0,0x3f3504ef,2
+np.float32,0x412fede0,0xbf800000,2
+np.float32,0xc12fede0,0x3f800000,2
+np.float32,0x41afede0,0xb5b222c4,2
+np.float32,0xc1afede0,0x35b222c4,2
+np.float32,0x40c90fdb,0x343bbd2e,2
+np.float32,0xc0c90fdb,0xb43bbd2e,2
+np.float32,0x41490fdb,0x34bbbd2e,2
+np.float32,0xc1490fdb,0xb4bbbd2e,2
+np.float32,0x41c90fdb,0x353bbd2e,2
+np.float32,0xc1c90fdb,0xb53bbd2e,2
+np.float32,0x40e231d6,0x3f3504f3,2
+np.float32,0xc0e231d6,0xbf3504f3,2
+np.float32,0x416231d6,0x3f800000,2
+np.float32,0xc16231d6,0xbf800000,2
+np.float32,0x41e231d6,0xb399a6a2,2
+np.float32,0xc1e231d6,0x3399a6a2,2
+np.float32,0x40fb53d2,0x3f800000,2
+np.float32,0xc0fb53d2,0xbf800000,2
+np.float32,0x417b53d2,0xb535563d,2
+np.float32,0xc17b53d2,0x3535563d,2
+np.float32,0x41fb53d2,0x35b5563d,2
+np.float32,0xc1fb53d2,0xb5b5563d,2
+np.float32,0x410a3ae7,0x3f3504eb,2
+np.float32,0xc10a3ae7,0xbf3504eb,2
+np.float32,0x418a3ae7,0xbf800000,2
+np.float32,0xc18a3ae7,0x3f800000,2
+np.float32,0x420a3ae7,0xb6308908,2
+np.float32,0xc20a3ae7,0x36308908,2
+np.float32,0x4116cbe4,0xb2ccde2e,2
+np.float32,0xc116cbe4,0x32ccde2e,2
+np.float32,0x4196cbe4,0x334cde2e,2
+np.float32,0xc196cbe4,0xb34cde2e,2
+np.float32,0x4216cbe4,0x33ccde2e,2
+np.float32,0xc216cbe4,0xb3ccde2e,2
+np.float32,0x41235ce2,0xbf3504f7,2
+np.float32,0xc1235ce2,0x3f3504f7,2
+np.float32,0x41a35ce2,0x3f800000,2
+np.float32,0xc1a35ce2,0xbf800000,2
+np.float32,0x42235ce2,0xb5b889b6,2
+np.float32,0xc2235ce2,0x35b889b6,2
+np.float32,0x412fede0,0xbf800000,2
+np.float32,0xc12fede0,0x3f800000,2
+np.float32,0x41afede0,0xb5b222c4,2
+np.float32,0xc1afede0,0x35b222c4,2
+np.float32,0x422fede0,0x363222c4,2
+np.float32,0xc22fede0,0xb63222c4,2
+np.float32,0x413c7edd,0xbf3504f3,2
+np.float32,0xc13c7edd,0x3f3504f3,2
+np.float32,0x41bc7edd,0xbf800000,2
+np.float32,0xc1bc7edd,0x3f800000,2
+np.float32,0x423c7edd,0xb4000add,2
+np.float32,0xc23c7edd,0x34000add,2
+np.float32,0x41490fdb,0x34bbbd2e,2
+np.float32,0xc1490fdb,0xb4bbbd2e,2
+np.float32,0x41c90fdb,0x353bbd2e,2
+np.float32,0xc1c90fdb,0xb53bbd2e,2
+np.float32,0x42490fdb,0x35bbbd2e,2
+np.float32,0xc2490fdb,0xb5bbbd2e,2
+np.float32,0x4155a0d9,0x3f3504fb,2
+np.float32,0xc155a0d9,0xbf3504fb,2
+np.float32,0x41d5a0d9,0x3f800000,2
+np.float32,0xc1d5a0d9,0xbf800000,2
+np.float32,0x4255a0d9,0xb633bc81,2
+np.float32,0xc255a0d9,0x3633bc81,2
+np.float32,0x416231d6,0x3f800000,2
+np.float32,0xc16231d6,0xbf800000,2
+np.float32,0x41e231d6,0xb399a6a2,2
+np.float32,0xc1e231d6,0x3399a6a2,2
+np.float32,0x426231d6,0x3419a6a2,2
+np.float32,0xc26231d6,0xb419a6a2,2
+np.float32,0x416ec2d4,0x3f3504ef,2
+np.float32,0xc16ec2d4,0xbf3504ef,2
+np.float32,0x41eec2d4,0xbf800000,2
+np.float32,0xc1eec2d4,0x3f800000,2
+np.float32,0x426ec2d4,0xb5bef0a7,2
+np.float32,0xc26ec2d4,0x35bef0a7,2
+np.float32,0x417b53d2,0xb535563d,2
+np.float32,0xc17b53d2,0x3535563d,2
+np.float32,0x41fb53d2,0x35b5563d,2
+np.float32,0xc1fb53d2,0xb5b5563d,2
+np.float32,0x427b53d2,0x3635563d,2
+np.float32,0xc27b53d2,0xb635563d,2
+np.float32,0x4183f268,0xbf3504ff,2
+np.float32,0xc183f268,0x3f3504ff,2
+np.float32,0x4203f268,0x3f800000,2
+np.float32,0xc203f268,0xbf800000,2
+np.float32,0x4283f268,0xb6859a13,2
+np.float32,0xc283f268,0x36859a13,2
+np.float32,0x418a3ae7,0xbf800000,2
+np.float32,0xc18a3ae7,0x3f800000,2
+np.float32,0x420a3ae7,0xb6308908,2
+np.float32,0xc20a3ae7,0x36308908,2
+np.float32,0x428a3ae7,0x36b08908,2
+np.float32,0xc28a3ae7,0xb6b08908,2
+np.float32,0x41908365,0xbf3504f6,2
+np.float32,0xc1908365,0x3f3504f6,2
+np.float32,0x42108365,0xbf800000,2
+np.float32,0xc2108365,0x3f800000,2
+np.float32,0x42908365,0x3592200d,2
+np.float32,0xc2908365,0xb592200d,2
+np.float32,0x4196cbe4,0x334cde2e,2
+np.float32,0xc196cbe4,0xb34cde2e,2
+np.float32,0x4216cbe4,0x33ccde2e,2
+np.float32,0xc216cbe4,0xb3ccde2e,2
+np.float32,0x4296cbe4,0x344cde2e,2
+np.float32,0xc296cbe4,0xb44cde2e,2
+np.float32,0x419d1463,0x3f3504f8,2
+np.float32,0xc19d1463,0xbf3504f8,2
+np.float32,0x421d1463,0x3f800000,2
+np.float32,0xc21d1463,0xbf800000,2
+np.float32,0x429d1463,0xb5c55799,2
+np.float32,0xc29d1463,0x35c55799,2
+np.float32,0x41a35ce2,0x3f800000,2
+np.float32,0xc1a35ce2,0xbf800000,2
+np.float32,0x42235ce2,0xb5b889b6,2
+np.float32,0xc2235ce2,0x35b889b6,2
+np.float32,0x42a35ce2,0x363889b6,2
+np.float32,0xc2a35ce2,0xb63889b6,2
+np.float32,0x41a9a561,0x3f3504e7,2
+np.float32,0xc1a9a561,0xbf3504e7,2
+np.float32,0x4229a561,0xbf800000,2
+np.float32,0xc229a561,0x3f800000,2
+np.float32,0x42a9a561,0xb68733d0,2
+np.float32,0xc2a9a561,0x368733d0,2
+np.float32,0x41afede0,0xb5b222c4,2
+np.float32,0xc1afede0,0x35b222c4,2
+np.float32,0x422fede0,0x363222c4,2
+np.float32,0xc22fede0,0xb63222c4,2
+np.float32,0x42afede0,0x36b222c4,2
+np.float32,0xc2afede0,0xb6b222c4,2
+np.float32,0x41b6365e,0xbf3504f0,2
+np.float32,0xc1b6365e,0x3f3504f0,2
+np.float32,0x4236365e,0x3f800000,2
+np.float32,0xc236365e,0xbf800000,2
+np.float32,0x42b6365e,0x358bb91c,2
+np.float32,0xc2b6365e,0xb58bb91c,2
+np.float32,0x41bc7edd,0xbf800000,2
+np.float32,0xc1bc7edd,0x3f800000,2
+np.float32,0x423c7edd,0xb4000add,2
+np.float32,0xc23c7edd,0x34000add,2
+np.float32,0x42bc7edd,0x34800add,2
+np.float32,0xc2bc7edd,0xb4800add,2
+np.float32,0x41c2c75c,0xbf3504ef,2
+np.float32,0xc1c2c75c,0x3f3504ef,2
+np.float32,0x4242c75c,0xbf800000,2
+np.float32,0xc242c75c,0x3f800000,2
+np.float32,0x42c2c75c,0xb5cbbe8a,2
+np.float32,0xc2c2c75c,0x35cbbe8a,2
+np.float32,0x41c90fdb,0x353bbd2e,2
+np.float32,0xc1c90fdb,0xb53bbd2e,2
+np.float32,0x42490fdb,0x35bbbd2e,2
+np.float32,0xc2490fdb,0xb5bbbd2e,2
+np.float32,0x42c90fdb,0x363bbd2e,2
+np.float32,0xc2c90fdb,0xb63bbd2e,2
+np.float32,0x41cf585a,0x3f3504ff,2
+np.float32,0xc1cf585a,0xbf3504ff,2
+np.float32,0x424f585a,0x3f800000,2
+np.float32,0xc24f585a,0xbf800000,2
+np.float32,0x42cf585a,0xb688cd8c,2
+np.float32,0xc2cf585a,0x3688cd8c,2
+np.float32,0x41d5a0d9,0x3f800000,2
+np.float32,0xc1d5a0d9,0xbf800000,2
+np.float32,0x4255a0d9,0xb633bc81,2
+np.float32,0xc255a0d9,0x3633bc81,2
+np.float32,0x42d5a0d9,0x36b3bc81,2
+np.float32,0xc2d5a0d9,0xb6b3bc81,2
+np.float32,0x41dbe958,0x3f3504e0,2
+np.float32,0xc1dbe958,0xbf3504e0,2
+np.float32,0x425be958,0xbf800000,2
+np.float32,0xc25be958,0x3f800000,2
+np.float32,0x42dbe958,0xb6deab75,2
+np.float32,0xc2dbe958,0x36deab75,2
+np.float32,0x41e231d6,0xb399a6a2,2
+np.float32,0xc1e231d6,0x3399a6a2,2
+np.float32,0x426231d6,0x3419a6a2,2
+np.float32,0xc26231d6,0xb419a6a2,2
+np.float32,0x42e231d6,0x3499a6a2,2
+np.float32,0xc2e231d6,0xb499a6a2,2
+np.float32,0x41e87a55,0xbf3504f8,2
+np.float32,0xc1e87a55,0x3f3504f8,2
+np.float32,0x42687a55,0x3f800000,2
+np.float32,0xc2687a55,0xbf800000,2
+np.float32,0x42e87a55,0xb5d2257b,2
+np.float32,0xc2e87a55,0x35d2257b,2
+np.float32,0x41eec2d4,0xbf800000,2
+np.float32,0xc1eec2d4,0x3f800000,2
+np.float32,0x426ec2d4,0xb5bef0a7,2
+np.float32,0xc26ec2d4,0x35bef0a7,2
+np.float32,0x42eec2d4,0x363ef0a7,2
+np.float32,0xc2eec2d4,0xb63ef0a7,2
+np.float32,0x41f50b53,0xbf3504e7,2
+np.float32,0xc1f50b53,0x3f3504e7,2
+np.float32,0x42750b53,0xbf800000,2
+np.float32,0xc2750b53,0x3f800000,2
+np.float32,0x42f50b53,0xb68a6748,2
+np.float32,0xc2f50b53,0x368a6748,2
+np.float32,0x41fb53d2,0x35b5563d,2
+np.float32,0xc1fb53d2,0xb5b5563d,2
+np.float32,0x427b53d2,0x3635563d,2
+np.float32,0xc27b53d2,0xb635563d,2
+np.float32,0x42fb53d2,0x36b5563d,2
+np.float32,0xc2fb53d2,0xb6b5563d,2
+np.float32,0x4200ce28,0x3f3504f0,2
+np.float32,0xc200ce28,0xbf3504f0,2
+np.float32,0x4280ce28,0x3f800000,2
+np.float32,0xc280ce28,0xbf800000,2
+np.float32,0x4300ce28,0x357dd672,2
+np.float32,0xc300ce28,0xb57dd672,2
+np.float32,0x4203f268,0x3f800000,2
+np.float32,0xc203f268,0xbf800000,2
+np.float32,0x4283f268,0xb6859a13,2
+np.float32,0xc283f268,0x36859a13,2
+np.float32,0x4303f268,0x37059a13,2
+np.float32,0xc303f268,0xb7059a13,2
+np.float32,0x420716a7,0x3f3504ee,2
+np.float32,0xc20716a7,0xbf3504ee,2
+np.float32,0x428716a7,0xbf800000,2
+np.float32,0xc28716a7,0x3f800000,2
+np.float32,0x430716a7,0xb5d88c6d,2
+np.float32,0xc30716a7,0x35d88c6d,2
+np.float32,0x420a3ae7,0xb6308908,2
+np.float32,0xc20a3ae7,0x36308908,2
+np.float32,0x428a3ae7,0x36b08908,2
+np.float32,0xc28a3ae7,0xb6b08908,2
+np.float32,0x430a3ae7,0x37308908,2
+np.float32,0xc30a3ae7,0xb7308908,2
+np.float32,0x420d5f26,0xbf350500,2
+np.float32,0xc20d5f26,0x3f350500,2
+np.float32,0x428d5f26,0x3f800000,2
+np.float32,0xc28d5f26,0xbf800000,2
+np.float32,0x430d5f26,0xb68c0105,2
+np.float32,0xc30d5f26,0x368c0105,2
+np.float32,0x42108365,0xbf800000,2
+np.float32,0xc2108365,0x3f800000,2
+np.float32,0x42908365,0x3592200d,2
+np.float32,0xc2908365,0xb592200d,2
+np.float32,0x43108365,0xb612200d,2
+np.float32,0xc3108365,0x3612200d,2
+np.float32,0x4213a7a5,0xbf3504df,2
+np.float32,0xc213a7a5,0x3f3504df,2
+np.float32,0x4293a7a5,0xbf800000,2
+np.float32,0xc293a7a5,0x3f800000,2
+np.float32,0x4313a7a5,0xb6e1deee,2
+np.float32,0xc313a7a5,0x36e1deee,2
+np.float32,0x4216cbe4,0x33ccde2e,2
+np.float32,0xc216cbe4,0xb3ccde2e,2
+np.float32,0x4296cbe4,0x344cde2e,2
+np.float32,0xc296cbe4,0xb44cde2e,2
+np.float32,0x4316cbe4,0x34ccde2e,2
+np.float32,0xc316cbe4,0xb4ccde2e,2
+np.float32,0x4219f024,0x3f35050f,2
+np.float32,0xc219f024,0xbf35050f,2
+np.float32,0x4299f024,0x3f800000,2
+np.float32,0xc299f024,0xbf800000,2
+np.float32,0x4319f024,0xb71bde6c,2
+np.float32,0xc319f024,0x371bde6c,2
+np.float32,0x421d1463,0x3f800000,2
+np.float32,0xc21d1463,0xbf800000,2
+np.float32,0x429d1463,0xb5c55799,2
+np.float32,0xc29d1463,0x35c55799,2
+np.float32,0x431d1463,0x36455799,2
+np.float32,0xc31d1463,0xb6455799,2
+np.float32,0x422038a3,0x3f3504d0,2
+np.float32,0xc22038a3,0xbf3504d0,2
+np.float32,0x42a038a3,0xbf800000,2
+np.float32,0xc2a038a3,0x3f800000,2
+np.float32,0x432038a3,0xb746cd61,2
+np.float32,0xc32038a3,0x3746cd61,2
+np.float32,0x42235ce2,0xb5b889b6,2
+np.float32,0xc2235ce2,0x35b889b6,2
+np.float32,0x42a35ce2,0x363889b6,2
+np.float32,0xc2a35ce2,0xb63889b6,2
+np.float32,0x43235ce2,0x36b889b6,2
+np.float32,0xc3235ce2,0xb6b889b6,2
+np.float32,0x42268121,0xbf3504f1,2
+np.float32,0xc2268121,0x3f3504f1,2
+np.float32,0x42a68121,0x3f800000,2
+np.float32,0xc2a68121,0xbf800000,2
+np.float32,0x43268121,0x35643aac,2
+np.float32,0xc3268121,0xb5643aac,2
+np.float32,0x4229a561,0xbf800000,2
+np.float32,0xc229a561,0x3f800000,2
+np.float32,0x42a9a561,0xb68733d0,2
+np.float32,0xc2a9a561,0x368733d0,2
+np.float32,0x4329a561,0x370733d0,2
+np.float32,0xc329a561,0xb70733d0,2
+np.float32,0x422cc9a0,0xbf3504ee,2
+np.float32,0xc22cc9a0,0x3f3504ee,2
+np.float32,0x42acc9a0,0xbf800000,2
+np.float32,0xc2acc9a0,0x3f800000,2
+np.float32,0x432cc9a0,0xb5e55a50,2
+np.float32,0xc32cc9a0,0x35e55a50,2
+np.float32,0x422fede0,0x363222c4,2
+np.float32,0xc22fede0,0xb63222c4,2
+np.float32,0x42afede0,0x36b222c4,2
+np.float32,0xc2afede0,0xb6b222c4,2
+np.float32,0x432fede0,0x373222c4,2
+np.float32,0xc32fede0,0xb73222c4,2
+np.float32,0x4233121f,0x3f350500,2
+np.float32,0xc233121f,0xbf350500,2
+np.float32,0x42b3121f,0x3f800000,2
+np.float32,0xc2b3121f,0xbf800000,2
+np.float32,0x4333121f,0xb68f347d,2
+np.float32,0xc333121f,0x368f347d,2
+np.float32,0x4236365e,0x3f800000,2
+np.float32,0xc236365e,0xbf800000,2
+np.float32,0x42b6365e,0x358bb91c,2
+np.float32,0xc2b6365e,0xb58bb91c,2
+np.float32,0x4336365e,0xb60bb91c,2
+np.float32,0xc336365e,0x360bb91c,2
+np.float32,0x42395a9e,0x3f3504df,2
+np.float32,0xc2395a9e,0xbf3504df,2
+np.float32,0x42b95a9e,0xbf800000,2
+np.float32,0xc2b95a9e,0x3f800000,2
+np.float32,0x43395a9e,0xb6e51267,2
+np.float32,0xc3395a9e,0x36e51267,2
+np.float32,0x423c7edd,0xb4000add,2
+np.float32,0xc23c7edd,0x34000add,2
+np.float32,0x42bc7edd,0x34800add,2
+np.float32,0xc2bc7edd,0xb4800add,2
+np.float32,0x433c7edd,0x35000add,2
+np.float32,0xc33c7edd,0xb5000add,2
+np.float32,0x423fa31d,0xbf35050f,2
+np.float32,0xc23fa31d,0x3f35050f,2
+np.float32,0x42bfa31d,0x3f800000,2
+np.float32,0xc2bfa31d,0xbf800000,2
+np.float32,0x433fa31d,0xb71d7828,2
+np.float32,0xc33fa31d,0x371d7828,2
+np.float32,0x4242c75c,0xbf800000,2
+np.float32,0xc242c75c,0x3f800000,2
+np.float32,0x42c2c75c,0xb5cbbe8a,2
+np.float32,0xc2c2c75c,0x35cbbe8a,2
+np.float32,0x4342c75c,0x364bbe8a,2
+np.float32,0xc342c75c,0xb64bbe8a,2
+np.float32,0x4245eb9c,0xbf3504d0,2
+np.float32,0xc245eb9c,0x3f3504d0,2
+np.float32,0x42c5eb9c,0xbf800000,2
+np.float32,0xc2c5eb9c,0x3f800000,2
+np.float32,0x4345eb9c,0xb748671d,2
+np.float32,0xc345eb9c,0x3748671d,2
+np.float32,0x42490fdb,0x35bbbd2e,2
+np.float32,0xc2490fdb,0xb5bbbd2e,2
+np.float32,0x42c90fdb,0x363bbd2e,2
+np.float32,0xc2c90fdb,0xb63bbd2e,2
+np.float32,0x43490fdb,0x36bbbd2e,2
+np.float32,0xc3490fdb,0xb6bbbd2e,2
+np.float32,0x424c341a,0x3f3504f1,2
+np.float32,0xc24c341a,0xbf3504f1,2
+np.float32,0x42cc341a,0x3f800000,2
+np.float32,0xc2cc341a,0xbf800000,2
+np.float32,0x434c341a,0x354a9ee6,2
+np.float32,0xc34c341a,0xb54a9ee6,2
+np.float32,0x424f585a,0x3f800000,2
+np.float32,0xc24f585a,0xbf800000,2
+np.float32,0x42cf585a,0xb688cd8c,2
+np.float32,0xc2cf585a,0x3688cd8c,2
+np.float32,0x434f585a,0x3708cd8c,2
+np.float32,0xc34f585a,0xb708cd8c,2
+np.float32,0x42527c99,0x3f3504ee,2
+np.float32,0xc2527c99,0xbf3504ee,2
+np.float32,0x42d27c99,0xbf800000,2
+np.float32,0xc2d27c99,0x3f800000,2
+np.float32,0x43527c99,0xb5f22833,2
+np.float32,0xc3527c99,0x35f22833,2
+np.float32,0x4255a0d9,0xb633bc81,2
+np.float32,0xc255a0d9,0x3633bc81,2
+np.float32,0x42d5a0d9,0x36b3bc81,2
+np.float32,0xc2d5a0d9,0xb6b3bc81,2
+np.float32,0x4355a0d9,0x3733bc81,2
+np.float32,0xc355a0d9,0xb733bc81,2
+np.float32,0x4258c518,0xbf350500,2
+np.float32,0xc258c518,0x3f350500,2
+np.float32,0x42d8c518,0x3f800000,2
+np.float32,0xc2d8c518,0xbf800000,2
+np.float32,0x4358c518,0xb69267f6,2
+np.float32,0xc358c518,0x369267f6,2
+np.float32,0x425be958,0xbf800000,2
+np.float32,0xc25be958,0x3f800000,2
+np.float32,0x42dbe958,0xb6deab75,2
+np.float32,0xc2dbe958,0x36deab75,2
+np.float32,0x435be958,0x375eab75,2
+np.float32,0xc35be958,0xb75eab75,2
+np.float32,0x425f0d97,0xbf3504df,2
+np.float32,0xc25f0d97,0x3f3504df,2
+np.float32,0x42df0d97,0xbf800000,2
+np.float32,0xc2df0d97,0x3f800000,2
+np.float32,0x435f0d97,0xb6e845e0,2
+np.float32,0xc35f0d97,0x36e845e0,2
+np.float32,0x426231d6,0x3419a6a2,2
+np.float32,0xc26231d6,0xb419a6a2,2
+np.float32,0x42e231d6,0x3499a6a2,2
+np.float32,0xc2e231d6,0xb499a6a2,2
+np.float32,0x436231d6,0x3519a6a2,2
+np.float32,0xc36231d6,0xb519a6a2,2
+np.float32,0x42655616,0x3f35050f,2
+np.float32,0xc2655616,0xbf35050f,2
+np.float32,0x42e55616,0x3f800000,2
+np.float32,0xc2e55616,0xbf800000,2
+np.float32,0x43655616,0xb71f11e5,2
+np.float32,0xc3655616,0x371f11e5,2
+np.float32,0x42687a55,0x3f800000,2
+np.float32,0xc2687a55,0xbf800000,2
+np.float32,0x42e87a55,0xb5d2257b,2
+np.float32,0xc2e87a55,0x35d2257b,2
+np.float32,0x43687a55,0x3652257b,2
+np.float32,0xc3687a55,0xb652257b,2
+np.float32,0x426b9e95,0x3f3504cf,2
+np.float32,0xc26b9e95,0xbf3504cf,2
+np.float32,0x42eb9e95,0xbf800000,2
+np.float32,0xc2eb9e95,0x3f800000,2
+np.float32,0x436b9e95,0xb74a00d9,2
+np.float32,0xc36b9e95,0x374a00d9,2
+np.float32,0x426ec2d4,0xb5bef0a7,2
+np.float32,0xc26ec2d4,0x35bef0a7,2
+np.float32,0x42eec2d4,0x363ef0a7,2
+np.float32,0xc2eec2d4,0xb63ef0a7,2
+np.float32,0x436ec2d4,0x36bef0a7,2
+np.float32,0xc36ec2d4,0xb6bef0a7,2
+np.float32,0x4271e713,0xbf3504f1,2
+np.float32,0xc271e713,0x3f3504f1,2
+np.float32,0x42f1e713,0x3f800000,2
+np.float32,0xc2f1e713,0xbf800000,2
+np.float32,0x4371e713,0x35310321,2
+np.float32,0xc371e713,0xb5310321,2
+np.float32,0x42750b53,0xbf800000,2
+np.float32,0xc2750b53,0x3f800000,2
+np.float32,0x42f50b53,0xb68a6748,2
+np.float32,0xc2f50b53,0x368a6748,2
+np.float32,0x43750b53,0x370a6748,2
+np.float32,0xc3750b53,0xb70a6748,2
+np.float32,0x42782f92,0xbf3504ee,2
+np.float32,0xc2782f92,0x3f3504ee,2
+np.float32,0x42f82f92,0xbf800000,2
+np.float32,0xc2f82f92,0x3f800000,2
+np.float32,0x43782f92,0xb5fef616,2
+np.float32,0xc3782f92,0x35fef616,2
+np.float32,0x427b53d2,0x3635563d,2
+np.float32,0xc27b53d2,0xb635563d,2
+np.float32,0x42fb53d2,0x36b5563d,2
+np.float32,0xc2fb53d2,0xb6b5563d,2
+np.float32,0x437b53d2,0x3735563d,2
+np.float32,0xc37b53d2,0xb735563d,2
+np.float32,0x427e7811,0x3f350500,2
+np.float32,0xc27e7811,0xbf350500,2
+np.float32,0x42fe7811,0x3f800000,2
+np.float32,0xc2fe7811,0xbf800000,2
+np.float32,0x437e7811,0xb6959b6f,2
+np.float32,0xc37e7811,0x36959b6f,2
+np.float32,0x4280ce28,0x3f800000,2
+np.float32,0xc280ce28,0xbf800000,2
+np.float32,0x4300ce28,0x357dd672,2
+np.float32,0xc300ce28,0xb57dd672,2
+np.float32,0x4380ce28,0xb5fdd672,2
+np.float32,0xc380ce28,0x35fdd672,2
+np.float32,0x42826048,0x3f3504de,2
+np.float32,0xc2826048,0xbf3504de,2
+np.float32,0x43026048,0xbf800000,2
+np.float32,0xc3026048,0x3f800000,2
+np.float32,0x43826048,0xb6eb7958,2
+np.float32,0xc3826048,0x36eb7958,2
+np.float32,0x4283f268,0xb6859a13,2
+np.float32,0xc283f268,0x36859a13,2
+np.float32,0x4303f268,0x37059a13,2
+np.float32,0xc303f268,0xb7059a13,2
+np.float32,0x4383f268,0x37859a13,2
+np.float32,0xc383f268,0xb7859a13,2
+np.float32,0x42858487,0xbf3504e2,2
+np.float32,0xc2858487,0x3f3504e2,2
+np.float32,0x43058487,0x3f800000,2
+np.float32,0xc3058487,0xbf800000,2
+np.float32,0x43858487,0x36bea8be,2
+np.float32,0xc3858487,0xb6bea8be,2
+np.float32,0x428716a7,0xbf800000,2
+np.float32,0xc28716a7,0x3f800000,2
+np.float32,0x430716a7,0xb5d88c6d,2
+np.float32,0xc30716a7,0x35d88c6d,2
+np.float32,0x438716a7,0x36588c6d,2
+np.float32,0xc38716a7,0xb6588c6d,2
+np.float32,0x4288a8c7,0xbf3504cf,2
+np.float32,0xc288a8c7,0x3f3504cf,2
+np.float32,0x4308a8c7,0xbf800000,2
+np.float32,0xc308a8c7,0x3f800000,2
+np.float32,0x4388a8c7,0xb74b9a96,2
+np.float32,0xc388a8c7,0x374b9a96,2
+np.float32,0x428a3ae7,0x36b08908,2
+np.float32,0xc28a3ae7,0xb6b08908,2
+np.float32,0x430a3ae7,0x37308908,2
+np.float32,0xc30a3ae7,0xb7308908,2
+np.float32,0x438a3ae7,0x37b08908,2
+np.float32,0xc38a3ae7,0xb7b08908,2
+np.float32,0x428bcd06,0x3f3504f2,2
+np.float32,0xc28bcd06,0xbf3504f2,2
+np.float32,0x430bcd06,0x3f800000,2
+np.float32,0xc30bcd06,0xbf800000,2
+np.float32,0x438bcd06,0x3517675b,2
+np.float32,0xc38bcd06,0xb517675b,2
+np.float32,0x428d5f26,0x3f800000,2
+np.float32,0xc28d5f26,0xbf800000,2
+np.float32,0x430d5f26,0xb68c0105,2
+np.float32,0xc30d5f26,0x368c0105,2
+np.float32,0x438d5f26,0x370c0105,2
+np.float32,0xc38d5f26,0xb70c0105,2
+np.float32,0x428ef146,0x3f3504c0,2
+np.float32,0xc28ef146,0xbf3504c0,2
+np.float32,0x430ef146,0xbf800000,2
+np.float32,0xc30ef146,0x3f800000,2
+np.float32,0x438ef146,0xb790bc40,2
+np.float32,0xc38ef146,0x3790bc40,2
+np.float32,0x42908365,0x3592200d,2
+np.float32,0xc2908365,0xb592200d,2
+np.float32,0x43108365,0xb612200d,2
+np.float32,0xc3108365,0x3612200d,2
+np.float32,0x43908365,0xb692200d,2
+np.float32,0xc3908365,0x3692200d,2
+np.float32,0x42921585,0xbf350501,2
+np.float32,0xc2921585,0x3f350501,2
+np.float32,0x43121585,0x3f800000,2
+np.float32,0xc3121585,0xbf800000,2
+np.float32,0x43921585,0xb698cee8,2
+np.float32,0xc3921585,0x3698cee8,2
+np.float32,0x4293a7a5,0xbf800000,2
+np.float32,0xc293a7a5,0x3f800000,2
+np.float32,0x4313a7a5,0xb6e1deee,2
+np.float32,0xc313a7a5,0x36e1deee,2
+np.float32,0x4393a7a5,0x3761deee,2
+np.float32,0xc393a7a5,0xb761deee,2
+np.float32,0x429539c5,0xbf3504b1,2
+np.float32,0xc29539c5,0x3f3504b1,2
+np.float32,0x431539c5,0xbf800000,2
+np.float32,0xc31539c5,0x3f800000,2
+np.float32,0x439539c5,0xb7bbab34,2
+np.float32,0xc39539c5,0x37bbab34,2
+np.float32,0x4296cbe4,0x344cde2e,2
+np.float32,0xc296cbe4,0xb44cde2e,2
+np.float32,0x4316cbe4,0x34ccde2e,2
+np.float32,0xc316cbe4,0xb4ccde2e,2
+np.float32,0x4396cbe4,0x354cde2e,2
+np.float32,0xc396cbe4,0xb54cde2e,2
+np.float32,0x42985e04,0x3f350510,2
+np.float32,0xc2985e04,0xbf350510,2
+np.float32,0x43185e04,0x3f800000,2
+np.float32,0xc3185e04,0xbf800000,2
+np.float32,0x43985e04,0xb722455d,2
+np.float32,0xc3985e04,0x3722455d,2
+np.float32,0x4299f024,0x3f800000,2
+np.float32,0xc299f024,0xbf800000,2
+np.float32,0x4319f024,0xb71bde6c,2
+np.float32,0xc319f024,0x371bde6c,2
+np.float32,0x4399f024,0x379bde6c,2
+np.float32,0xc399f024,0xb79bde6c,2
+np.float32,0x429b8243,0x3f3504fc,2
+np.float32,0xc29b8243,0xbf3504fc,2
+np.float32,0x431b8243,0xbf800000,2
+np.float32,0xc31b8243,0x3f800000,2
+np.float32,0x439b8243,0x364b2eb8,2
+np.float32,0xc39b8243,0xb64b2eb8,2
+np.float32,0x435b2047,0xbf350525,2
+np.float32,0x42a038a2,0xbf800000,2
+np.float32,0x432038a2,0x3664ca7e,2
+np.float32,0x4345eb9b,0x365e638c,2
+np.float32,0x42c5eb9b,0xbf800000,2
+np.float32,0x42eb9e94,0xbf800000,2
+np.float32,0x4350ea79,0x3f800000,2
+np.float32,0x42dbe957,0x3585522a,2
+np.float32,0x425be957,0xbf800000,2
+np.float32,0x435be957,0xb605522a,2
+np.float32,0x476362a2,0xbd7ff911,2
+np.float32,0x464c99a4,0x3e7f4d41,2
+np.float32,0x4471f73d,0x3e7fe1b0,2
+np.float32,0x445a6752,0x3e7ef367,2
+np.float32,0x474fa400,0x3e7f9fcd,2
+np.float32,0x45c1e72f,0xbe7fc7af,2
+np.float32,0x4558c91d,0x3e7e9f31,2
+np.float32,0x43784f94,0xbdff6654,2
+np.float32,0x466e8500,0xbe7ea0a3,2
+np.float32,0x468e1c25,0x3e7e22fb,2
+np.float32,0x44ea6cfc,0x3dff70c3,2
+np.float32,0x4605126c,0x3e7f89ef,2
+np.float32,0x4788b3c6,0xbb87d853,2
+np.float32,0x4531b042,0x3dffd163,2
+np.float32,0x43f1f71d,0x3dfff387,2
+np.float32,0x462c3fa5,0xbd7fe13d,2
+np.float32,0x441c5354,0xbdff76b4,2
+np.float32,0x44908b69,0x3e7dcf0d,2
+np.float32,0x478813ad,0xbe7e9d80,2
+np.float32,0x441c4351,0x3dff937b,2
diff --git a/venv/Lib/site-packages/numpy/core/tests/test__exceptions.py b/venv/Lib/site-packages/numpy/core/tests/test__exceptions.py
new file mode 100644
index 000000000..494b51f34
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test__exceptions.py
@@ -0,0 +1,42 @@
+"""
+Tests of the ._exceptions module. Primarily for exercising the __str__ methods.
+"""
+import numpy as np
+
+_ArrayMemoryError = np.core._exceptions._ArrayMemoryError
+
+class TestArrayMemoryError:
+    def test_str(self):
+        e = _ArrayMemoryError((1023,), np.dtype(np.uint8))
+        str(e)  # not crashing is enough
+
+    # testing these properties is easier than testing the full string repr
+    def test__size_to_string(self):
+        """ Test e._size_to_string """
+        f = _ArrayMemoryError._size_to_string
+        Ki = 1024
+        assert f(0) == '0 bytes'
+        assert f(1) == '1 bytes'
+        assert f(1023) == '1023 bytes'
+        assert f(Ki) == '1.00 KiB'
+        assert f(Ki+1) == '1.00 KiB'
+        assert f(10*Ki) == '10.0 KiB'
+        assert f(int(999.4*Ki)) == '999. KiB'
+        assert f(int(1023.4*Ki)) == '1023. KiB'
+        assert f(int(1023.5*Ki)) == '1.00 MiB'
+        assert f(Ki*Ki) == '1.00 MiB'
+
+        # 1023.9999 Mib should round to 1 GiB
+        assert f(int(Ki*Ki*Ki*0.9999)) == '1.00 GiB'
+        assert f(Ki*Ki*Ki*Ki*Ki*Ki) == '1.00 EiB'
+        # larger than sys.maxsize, adding larger prefices isn't going to help
+        # anyway.
+        assert f(Ki*Ki*Ki*Ki*Ki*Ki*123456) == '123456. EiB'
+
+    def test__total_size(self):
+        """ Test e._total_size """
+        e = _ArrayMemoryError((1,), np.dtype(np.uint8))
+        assert e._total_size == 1
+
+        e = _ArrayMemoryError((2, 4), np.dtype((np.uint64, 16)))
+        assert e._total_size == 1024
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_abc.py b/venv/Lib/site-packages/numpy/core/tests/test_abc.py
new file mode 100644
index 000000000..30e5748af
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_abc.py
@@ -0,0 +1,54 @@
+from numpy.testing import assert_
+
+import numbers
+
+import numpy as np
+from numpy.core.numerictypes import sctypes
+
+class TestABC:
+    def test_abstract(self):
+        assert_(issubclass(np.number, numbers.Number))
+
+        assert_(issubclass(np.inexact, numbers.Complex))
+        assert_(issubclass(np.complexfloating, numbers.Complex))
+        assert_(issubclass(np.floating, numbers.Real))
+
+        assert_(issubclass(np.integer, numbers.Integral))
+        assert_(issubclass(np.signedinteger, numbers.Integral))
+        assert_(issubclass(np.unsignedinteger, numbers.Integral))
+
+    def test_floats(self):
+        for t in sctypes['float']:
+            assert_(isinstance(t(), numbers.Real),
+                    "{0} is not instance of Real".format(t.__name__))
+            assert_(issubclass(t, numbers.Real),
+                    "{0} is not subclass of Real".format(t.__name__))
+            assert_(not isinstance(t(), numbers.Rational),
+                    "{0} is instance of Rational".format(t.__name__))
+            assert_(not issubclass(t, numbers.Rational),
+                    "{0} is subclass of Rational".format(t.__name__))
+
+    def test_complex(self):
+        for t in sctypes['complex']:
+            assert_(isinstance(t(), numbers.Complex),
+                    "{0} is not instance of Complex".format(t.__name__))
+            assert_(issubclass(t, numbers.Complex),
+                    "{0} is not subclass of Complex".format(t.__name__))
+            assert_(not isinstance(t(), numbers.Real),
+                    "{0} is instance of Real".format(t.__name__))
+            assert_(not issubclass(t, numbers.Real),
+                    "{0} is subclass of Real".format(t.__name__))
+
+    def test_int(self):
+        for t in sctypes['int']:
+            assert_(isinstance(t(), numbers.Integral),
+                    "{0} is not instance of Integral".format(t.__name__))
+            assert_(issubclass(t, numbers.Integral),
+                    "{0} is not subclass of Integral".format(t.__name__))
+
+    def test_uint(self):
+        for t in sctypes['uint']:
+            assert_(isinstance(t(), numbers.Integral),
+                    "{0} is not instance of Integral".format(t.__name__))
+            assert_(issubclass(t, numbers.Integral),
+                    "{0} is not subclass of Integral".format(t.__name__))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_api.py b/venv/Lib/site-packages/numpy/core/tests/test_api.py
new file mode 100644
index 000000000..09105905a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_api.py
@@ -0,0 +1,567 @@
+import sys
+
+import numpy as np
+from numpy.core._rational_tests import rational
+import pytest
+from numpy.testing import (
+     assert_, assert_equal, assert_array_equal, assert_raises, assert_warns,
+     HAS_REFCOUNT
+    )
+
+# Switch between new behaviour when NPY_RELAXED_STRIDES_CHECKING is set.
+NPY_RELAXED_STRIDES_CHECKING = np.ones((10, 1), order='C').flags.f_contiguous
+
+
+def test_array_array():
+    tobj = type(object)
+    ones11 = np.ones((1, 1), np.float64)
+    tndarray = type(ones11)
+    # Test is_ndarray
+    assert_equal(np.array(ones11, dtype=np.float64), ones11)
+    if HAS_REFCOUNT:
+        old_refcount = sys.getrefcount(tndarray)
+        np.array(ones11)
+        assert_equal(old_refcount, sys.getrefcount(tndarray))
+
+    # test None
+    assert_equal(np.array(None, dtype=np.float64),
+                 np.array(np.nan, dtype=np.float64))
+    if HAS_REFCOUNT:
+        old_refcount = sys.getrefcount(tobj)
+        np.array(None, dtype=np.float64)
+        assert_equal(old_refcount, sys.getrefcount(tobj))
+
+    # test scalar
+    assert_equal(np.array(1.0, dtype=np.float64),
+                 np.ones((), dtype=np.float64))
+    if HAS_REFCOUNT:
+        old_refcount = sys.getrefcount(np.float64)
+        np.array(np.array(1.0, dtype=np.float64), dtype=np.float64)
+        assert_equal(old_refcount, sys.getrefcount(np.float64))
+
+    # test string
+    S2 = np.dtype((bytes, 2))
+    S3 = np.dtype((bytes, 3))
+    S5 = np.dtype((bytes, 5))
+    assert_equal(np.array(b"1.0", dtype=np.float64),
+                 np.ones((), dtype=np.float64))
+    assert_equal(np.array(b"1.0").dtype, S3)
+    assert_equal(np.array(b"1.0", dtype=bytes).dtype, S3)
+    assert_equal(np.array(b"1.0", dtype=S2), np.array(b"1."))
+    assert_equal(np.array(b"1", dtype=S5), np.ones((), dtype=S5))
+
+    # test string
+    U2 = np.dtype((str, 2))
+    U3 = np.dtype((str, 3))
+    U5 = np.dtype((str, 5))
+    assert_equal(np.array("1.0", dtype=np.float64),
+                 np.ones((), dtype=np.float64))
+    assert_equal(np.array("1.0").dtype, U3)
+    assert_equal(np.array("1.0", dtype=str).dtype, U3)
+    assert_equal(np.array("1.0", dtype=U2), np.array(str("1.")))
+    assert_equal(np.array("1", dtype=U5), np.ones((), dtype=U5))
+
+    builtins = getattr(__builtins__, '__dict__', __builtins__)
+    assert_(hasattr(builtins, 'get'))
+
+    # test memoryview
+    dat = np.array(memoryview(b'1.0'), dtype=np.float64)
+    assert_equal(dat, [49.0, 46.0, 48.0])
+    assert_(dat.dtype.type is np.float64)
+
+    dat = np.array(memoryview(b'1.0'))
+    assert_equal(dat, [49, 46, 48])
+    assert_(dat.dtype.type is np.uint8)
+
+    # test array interface
+    a = np.array(100.0, dtype=np.float64)
+    o = type("o", (object,),
+             dict(__array_interface__=a.__array_interface__))
+    assert_equal(np.array(o, dtype=np.float64), a)
+
+    # test array_struct interface
+    a = np.array([(1, 4.0, 'Hello'), (2, 6.0, 'World')],
+                 dtype=[('f0', int), ('f1', float), ('f2', str)])
+    o = type("o", (object,),
+             dict(__array_struct__=a.__array_struct__))
+    ## wasn't what I expected... is np.array(o) supposed to equal a ?
+    ## instead we get a array([...], dtype=">V18")
+    assert_equal(bytes(np.array(o).data), bytes(a.data))
+
+    # test array
+    o = type("o", (object,),
+             dict(__array__=lambda *x: np.array(100.0, dtype=np.float64)))()
+    assert_equal(np.array(o, dtype=np.float64), np.array(100.0, np.float64))
+
+    # test recursion
+    nested = 1.5
+    for i in range(np.MAXDIMS):
+        nested = [nested]
+
+    # no error
+    np.array(nested)
+
+    # Exceeds recursion limit
+    assert_raises(ValueError, np.array, [nested], dtype=np.float64)
+
+    # Try with lists...
+    assert_equal(np.array([None] * 10, dtype=np.float64),
+                 np.full((10,), np.nan, dtype=np.float64))
+    assert_equal(np.array([[None]] * 10, dtype=np.float64),
+                 np.full((10, 1), np.nan, dtype=np.float64))
+    assert_equal(np.array([[None] * 10], dtype=np.float64),
+                 np.full((1, 10), np.nan, dtype=np.float64))
+    assert_equal(np.array([[None] * 10] * 10, dtype=np.float64),
+                 np.full((10, 10), np.nan, dtype=np.float64))
+
+    assert_equal(np.array([1.0] * 10, dtype=np.float64),
+                 np.ones((10,), dtype=np.float64))
+    assert_equal(np.array([[1.0]] * 10, dtype=np.float64),
+                 np.ones((10, 1), dtype=np.float64))
+    assert_equal(np.array([[1.0] * 10], dtype=np.float64),
+                 np.ones((1, 10), dtype=np.float64))
+    assert_equal(np.array([[1.0] * 10] * 10, dtype=np.float64),
+                 np.ones((10, 10), dtype=np.float64))
+
+    # Try with tuples
+    assert_equal(np.array((None,) * 10, dtype=np.float64),
+                 np.full((10,), np.nan, dtype=np.float64))
+    assert_equal(np.array([(None,)] * 10, dtype=np.float64),
+                 np.full((10, 1), np.nan, dtype=np.float64))
+    assert_equal(np.array([(None,) * 10], dtype=np.float64),
+                 np.full((1, 10), np.nan, dtype=np.float64))
+    assert_equal(np.array([(None,) * 10] * 10, dtype=np.float64),
+                 np.full((10, 10), np.nan, dtype=np.float64))
+
+    assert_equal(np.array((1.0,) * 10, dtype=np.float64),
+                 np.ones((10,), dtype=np.float64))
+    assert_equal(np.array([(1.0,)] * 10, dtype=np.float64),
+                 np.ones((10, 1), dtype=np.float64))
+    assert_equal(np.array([(1.0,) * 10], dtype=np.float64),
+                 np.ones((1, 10), dtype=np.float64))
+    assert_equal(np.array([(1.0,) * 10] * 10, dtype=np.float64),
+                 np.ones((10, 10), dtype=np.float64))
+
+@pytest.mark.parametrize("array", [True, False])
+def test_array_impossible_casts(array):
+    # All builtin types can forst cast as least theoretically
+    # but user dtypes cannot necessarily.
+    rt = rational(1, 2)
+    if array:
+        rt = np.array(rt)
+    with assert_raises(ValueError):
+        np.array(rt, dtype="M8")
+
+
+def test_fastCopyAndTranspose():
+    # 0D array
+    a = np.array(2)
+    b = np.fastCopyAndTranspose(a)
+    assert_equal(b, a.T)
+    assert_(b.flags.owndata)
+
+    # 1D array
+    a = np.array([3, 2, 7, 0])
+    b = np.fastCopyAndTranspose(a)
+    assert_equal(b, a.T)
+    assert_(b.flags.owndata)
+
+    # 2D array
+    a = np.arange(6).reshape(2, 3)
+    b = np.fastCopyAndTranspose(a)
+    assert_equal(b, a.T)
+    assert_(b.flags.owndata)
+
+def test_array_astype():
+    a = np.arange(6, dtype='f4').reshape(2, 3)
+    # Default behavior: allows unsafe casts, keeps memory layout,
+    #                   always copies.
+    b = a.astype('i4')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('i4'))
+    assert_equal(a.strides, b.strides)
+    b = a.T.astype('i4')
+    assert_equal(a.T, b)
+    assert_equal(b.dtype, np.dtype('i4'))
+    assert_equal(a.T.strides, b.strides)
+    b = a.astype('f4')
+    assert_equal(a, b)
+    assert_(not (a is b))
+
+    # copy=False parameter can sometimes skip a copy
+    b = a.astype('f4', copy=False)
+    assert_(a is b)
+
+    # order parameter allows overriding of the memory layout,
+    # forcing a copy if the layout is wrong
+    b = a.astype('f4', order='F', copy=False)
+    assert_equal(a, b)
+    assert_(not (a is b))
+    assert_(b.flags.f_contiguous)
+
+    b = a.astype('f4', order='C', copy=False)
+    assert_equal(a, b)
+    assert_(a is b)
+    assert_(b.flags.c_contiguous)
+
+    # casting parameter allows catching bad casts
+    b = a.astype('c8', casting='safe')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('c8'))
+
+    assert_raises(TypeError, a.astype, 'i4', casting='safe')
+
+    # subok=False passes through a non-subclassed array
+    b = a.astype('f4', subok=0, copy=False)
+    assert_(a is b)
+
+    class MyNDArray(np.ndarray):
+        pass
+
+    a = np.array([[0, 1, 2], [3, 4, 5]], dtype='f4').view(MyNDArray)
+
+    # subok=True passes through a subclass
+    b = a.astype('f4', subok=True, copy=False)
+    assert_(a is b)
+
+    # subok=True is default, and creates a subtype on a cast
+    b = a.astype('i4', copy=False)
+    assert_equal(a, b)
+    assert_equal(type(b), MyNDArray)
+
+    # subok=False never returns a subclass
+    b = a.astype('f4', subok=False, copy=False)
+    assert_equal(a, b)
+    assert_(not (a is b))
+    assert_(type(b) is not MyNDArray)
+
+    # Make sure converting from string object to fixed length string
+    # does not truncate.
+    a = np.array([b'a'*100], dtype='O')
+    b = a.astype('S')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('S100'))
+    a = np.array([u'a'*100], dtype='O')
+    b = a.astype('U')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('U100'))
+
+    # Same test as above but for strings shorter than 64 characters
+    a = np.array([b'a'*10], dtype='O')
+    b = a.astype('S')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('S10'))
+    a = np.array([u'a'*10], dtype='O')
+    b = a.astype('U')
+    assert_equal(a, b)
+    assert_equal(b.dtype, np.dtype('U10'))
+
+    a = np.array(123456789012345678901234567890, dtype='O').astype('S')
+    assert_array_equal(a, np.array(b'1234567890' * 3, dtype='S30'))
+    a = np.array(123456789012345678901234567890, dtype='O').astype('U')
+    assert_array_equal(a, np.array(u'1234567890' * 3, dtype='U30'))
+
+    a = np.array([123456789012345678901234567890], dtype='O').astype('S')
+    assert_array_equal(a, np.array(b'1234567890' * 3, dtype='S30'))
+    a = np.array([123456789012345678901234567890], dtype='O').astype('U')
+    assert_array_equal(a, np.array(u'1234567890' * 3, dtype='U30'))
+
+    a = np.array(123456789012345678901234567890, dtype='S')
+    assert_array_equal(a, np.array(b'1234567890' * 3, dtype='S30'))
+    a = np.array(123456789012345678901234567890, dtype='U')
+    assert_array_equal(a, np.array(u'1234567890' * 3, dtype='U30'))
+
+    a = np.array(u'a\u0140', dtype='U')
+    b = np.ndarray(buffer=a, dtype='uint32', shape=2)
+    assert_(b.size == 2)
+
+    a = np.array([1000], dtype='i4')
+    assert_raises(TypeError, a.astype, 'S1', casting='safe')
+
+    a = np.array(1000, dtype='i4')
+    assert_raises(TypeError, a.astype, 'U1', casting='safe')
+
+@pytest.mark.parametrize("t",
+    np.sctypes['uint'] + np.sctypes['int'] + np.sctypes['float']
+)
+def test_array_astype_warning(t):
+    # test ComplexWarning when casting from complex to float or int
+    a = np.array(10, dtype=np.complex_)
+    assert_warns(np.ComplexWarning, a.astype, t)
+
+@pytest.mark.parametrize(["dtype", "out_dtype"],
+        [(np.bytes_, np.bool_),
+         (np.unicode, np.bool_),
+         (np.dtype("S10,S9"), np.dtype("?,?"))])
+def test_string_to_boolean_cast(dtype, out_dtype):
+    """
+    Currently, for `astype` strings are cast to booleans effectively by
+    calling `bool(int(string)`. This is not consistent (see gh-9875) and
+    will eventually be deprecated.
+    """
+    arr = np.array(["10", "10\0\0\0", "0\0\0", "0"], dtype=dtype)
+    expected = np.array([True, True, False, False], dtype=out_dtype)
+    assert_array_equal(arr.astype(out_dtype), expected)
+
+@pytest.mark.parametrize(["dtype", "out_dtype"],
+        [(np.bytes_, np.bool_),
+         (np.unicode, np.bool_),
+         (np.dtype("S10,S9"), np.dtype("?,?"))])
+def test_string_to_boolean_cast_errors(dtype, out_dtype):
+    """
+    These currently error out, since cast to integers fails, but should not
+    error out in the future.
+    """
+    for invalid in ["False", "True", "", "\0", "non-empty"]:
+        arr = np.array([invalid], dtype=dtype)
+        with assert_raises(ValueError):
+            arr.astype(out_dtype)
+
+@pytest.mark.parametrize("str_type", [str, bytes, np.str_, np.unicode_])
+@pytest.mark.parametrize("scalar_type",
+        [np.complex64, np.complex128, np.clongdouble])
+def test_string_to_complex_cast(str_type, scalar_type):
+    value = scalar_type(b"1+3j")
+    assert scalar_type(value) == 1+3j
+    assert np.array([value], dtype=object).astype(scalar_type)[()] == 1+3j
+    assert np.array(value).astype(scalar_type)[()] == 1+3j
+    arr = np.zeros(1, dtype=scalar_type)
+    arr[0] = value
+    assert arr[0] == 1+3j
+
+@pytest.mark.parametrize("dtype", np.typecodes["AllFloat"])
+def test_none_to_nan_cast(dtype):
+    # Note that at the time of writing this test, the scalar constructors
+    # reject None
+    arr = np.zeros(1, dtype=dtype)
+    arr[0] = None
+    assert np.isnan(arr)[0]
+    assert np.isnan(np.array(None, dtype=dtype))[()]
+    assert np.isnan(np.array([None], dtype=dtype))[0]
+    assert np.isnan(np.array(None).astype(dtype))[()]
+
+def test_copyto_fromscalar():
+    a = np.arange(6, dtype='f4').reshape(2, 3)
+
+    # Simple copy
+    np.copyto(a, 1.5)
+    assert_equal(a, 1.5)
+    np.copyto(a.T, 2.5)
+    assert_equal(a, 2.5)
+
+    # Where-masked copy
+    mask = np.array([[0, 1, 0], [0, 0, 1]], dtype='?')
+    np.copyto(a, 3.5, where=mask)
+    assert_equal(a, [[2.5, 3.5, 2.5], [2.5, 2.5, 3.5]])
+    mask = np.array([[0, 1], [1, 1], [1, 0]], dtype='?')
+    np.copyto(a.T, 4.5, where=mask)
+    assert_equal(a, [[2.5, 4.5, 4.5], [4.5, 4.5, 3.5]])
+
+def test_copyto():
+    a = np.arange(6, dtype='i4').reshape(2, 3)
+
+    # Simple copy
+    np.copyto(a, [[3, 1, 5], [6, 2, 1]])
+    assert_equal(a, [[3, 1, 5], [6, 2, 1]])
+
+    # Overlapping copy should work
+    np.copyto(a[:, :2], a[::-1, 1::-1])
+    assert_equal(a, [[2, 6, 5], [1, 3, 1]])
+
+    # Defaults to 'same_kind' casting
+    assert_raises(TypeError, np.copyto, a, 1.5)
+
+    # Force a copy with 'unsafe' casting, truncating 1.5 to 1
+    np.copyto(a, 1.5, casting='unsafe')
+    assert_equal(a, 1)
+
+    # Copying with a mask
+    np.copyto(a, 3, where=[True, False, True])
+    assert_equal(a, [[3, 1, 3], [3, 1, 3]])
+
+    # Casting rule still applies with a mask
+    assert_raises(TypeError, np.copyto, a, 3.5, where=[True, False, True])
+
+    # Lists of integer 0's and 1's is ok too
+    np.copyto(a, 4.0, casting='unsafe', where=[[0, 1, 1], [1, 0, 0]])
+    assert_equal(a, [[3, 4, 4], [4, 1, 3]])
+
+    # Overlapping copy with mask should work
+    np.copyto(a[:, :2], a[::-1, 1::-1], where=[[0, 1], [1, 1]])
+    assert_equal(a, [[3, 4, 4], [4, 3, 3]])
+
+    # 'dst' must be an array
+    assert_raises(TypeError, np.copyto, [1, 2, 3], [2, 3, 4])
+
+def test_copyto_permut():
+    # test explicit overflow case
+    pad = 500
+    l = [True] * pad + [True, True, True, True]
+    r = np.zeros(len(l)-pad)
+    d = np.ones(len(l)-pad)
+    mask = np.array(l)[pad:]
+    np.copyto(r, d, where=mask[::-1])
+
+    # test all permutation of possible masks, 9 should be sufficient for
+    # current 4 byte unrolled code
+    power = 9
+    d = np.ones(power)
+    for i in range(2**power):
+        r = np.zeros(power)
+        l = [(i & x) != 0 for x in range(power)]
+        mask = np.array(l)
+        np.copyto(r, d, where=mask)
+        assert_array_equal(r == 1, l)
+        assert_equal(r.sum(), sum(l))
+
+        r = np.zeros(power)
+        np.copyto(r, d, where=mask[::-1])
+        assert_array_equal(r == 1, l[::-1])
+        assert_equal(r.sum(), sum(l))
+
+        r = np.zeros(power)
+        np.copyto(r[::2], d[::2], where=mask[::2])
+        assert_array_equal(r[::2] == 1, l[::2])
+        assert_equal(r[::2].sum(), sum(l[::2]))
+
+        r = np.zeros(power)
+        np.copyto(r[::2], d[::2], where=mask[::-2])
+        assert_array_equal(r[::2] == 1, l[::-2])
+        assert_equal(r[::2].sum(), sum(l[::-2]))
+
+        for c in [0xFF, 0x7F, 0x02, 0x10]:
+            r = np.zeros(power)
+            mask = np.array(l)
+            imask = np.array(l).view(np.uint8)
+            imask[mask != 0] = c
+            np.copyto(r, d, where=mask)
+            assert_array_equal(r == 1, l)
+            assert_equal(r.sum(), sum(l))
+
+    r = np.zeros(power)
+    np.copyto(r, d, where=True)
+    assert_equal(r.sum(), r.size)
+    r = np.ones(power)
+    d = np.zeros(power)
+    np.copyto(r, d, where=False)
+    assert_equal(r.sum(), r.size)
+
+def test_copy_order():
+    a = np.arange(24).reshape(2, 1, 3, 4)
+    b = a.copy(order='F')
+    c = np.arange(24).reshape(2, 1, 4, 3).swapaxes(2, 3)
+
+    def check_copy_result(x, y, ccontig, fcontig, strides=False):
+        assert_(not (x is y))
+        assert_equal(x, y)
+        assert_equal(res.flags.c_contiguous, ccontig)
+        assert_equal(res.flags.f_contiguous, fcontig)
+        # This check is impossible only because
+        # NPY_RELAXED_STRIDES_CHECKING changes the strides actively
+        if not NPY_RELAXED_STRIDES_CHECKING:
+            if strides:
+                assert_equal(x.strides, y.strides)
+            else:
+                assert_(x.strides != y.strides)
+
+    # Validate the initial state of a, b, and c
+    assert_(a.flags.c_contiguous)
+    assert_(not a.flags.f_contiguous)
+    assert_(not b.flags.c_contiguous)
+    assert_(b.flags.f_contiguous)
+    assert_(not c.flags.c_contiguous)
+    assert_(not c.flags.f_contiguous)
+
+    # Copy with order='C'
+    res = a.copy(order='C')
+    check_copy_result(res, a, ccontig=True, fcontig=False, strides=True)
+    res = b.copy(order='C')
+    check_copy_result(res, b, ccontig=True, fcontig=False, strides=False)
+    res = c.copy(order='C')
+    check_copy_result(res, c, ccontig=True, fcontig=False, strides=False)
+    res = np.copy(a, order='C')
+    check_copy_result(res, a, ccontig=True, fcontig=False, strides=True)
+    res = np.copy(b, order='C')
+    check_copy_result(res, b, ccontig=True, fcontig=False, strides=False)
+    res = np.copy(c, order='C')
+    check_copy_result(res, c, ccontig=True, fcontig=False, strides=False)
+
+    # Copy with order='F'
+    res = a.copy(order='F')
+    check_copy_result(res, a, ccontig=False, fcontig=True, strides=False)
+    res = b.copy(order='F')
+    check_copy_result(res, b, ccontig=False, fcontig=True, strides=True)
+    res = c.copy(order='F')
+    check_copy_result(res, c, ccontig=False, fcontig=True, strides=False)
+    res = np.copy(a, order='F')
+    check_copy_result(res, a, ccontig=False, fcontig=True, strides=False)
+    res = np.copy(b, order='F')
+    check_copy_result(res, b, ccontig=False, fcontig=True, strides=True)
+    res = np.copy(c, order='F')
+    check_copy_result(res, c, ccontig=False, fcontig=True, strides=False)
+
+    # Copy with order='K'
+    res = a.copy(order='K')
+    check_copy_result(res, a, ccontig=True, fcontig=False, strides=True)
+    res = b.copy(order='K')
+    check_copy_result(res, b, ccontig=False, fcontig=True, strides=True)
+    res = c.copy(order='K')
+    check_copy_result(res, c, ccontig=False, fcontig=False, strides=True)
+    res = np.copy(a, order='K')
+    check_copy_result(res, a, ccontig=True, fcontig=False, strides=True)
+    res = np.copy(b, order='K')
+    check_copy_result(res, b, ccontig=False, fcontig=True, strides=True)
+    res = np.copy(c, order='K')
+    check_copy_result(res, c, ccontig=False, fcontig=False, strides=True)
+
+def test_contiguous_flags():
+    a = np.ones((4, 4, 1))[::2,:,:]
+    if NPY_RELAXED_STRIDES_CHECKING:
+        a.strides = a.strides[:2] + (-123,)
+    b = np.ones((2, 2, 1, 2, 2)).swapaxes(3, 4)
+
+    def check_contig(a, ccontig, fcontig):
+        assert_(a.flags.c_contiguous == ccontig)
+        assert_(a.flags.f_contiguous == fcontig)
+
+    # Check if new arrays are correct:
+    check_contig(a, False, False)
+    check_contig(b, False, False)
+    if NPY_RELAXED_STRIDES_CHECKING:
+        check_contig(np.empty((2, 2, 0, 2, 2)), True, True)
+        check_contig(np.array([[[1], [2]]], order='F'), True, True)
+    else:
+        check_contig(np.empty((2, 2, 0, 2, 2)), True, False)
+        check_contig(np.array([[[1], [2]]], order='F'), False, True)
+    check_contig(np.empty((2, 2)), True, False)
+    check_contig(np.empty((2, 2), order='F'), False, True)
+
+    # Check that np.array creates correct contiguous flags:
+    check_contig(np.array(a, copy=False), False, False)
+    check_contig(np.array(a, copy=False, order='C'), True, False)
+    check_contig(np.array(a, ndmin=4, copy=False, order='F'), False, True)
+
+    if NPY_RELAXED_STRIDES_CHECKING:
+        # Check slicing update of flags and :
+        check_contig(a[0], True, True)
+        check_contig(a[None, ::4, ..., None], True, True)
+        check_contig(b[0, 0, ...], False, True)
+        check_contig(b[:,:, 0:0,:,:], True, True)
+    else:
+        # Check slicing update of flags:
+        check_contig(a[0], True, False)
+        # Would be nice if this was C-Contiguous:
+        check_contig(a[None, 0, ..., None], False, False)
+        check_contig(b[0, 0, 0, ...], False, True)
+
+    # Test ravel and squeeze.
+    check_contig(a.ravel(), True, True)
+    check_contig(np.ones((1, 3, 1)).squeeze(), True, True)
+
+def test_broadcast_arrays():
+    # Test user defined dtypes
+    a = np.array([(1, 2, 3)], dtype='u4,u4,u4')
+    b = np.array([(1, 2, 3), (4, 5, 6), (7, 8, 9)], dtype='u4,u4,u4')
+    result = np.broadcast_arrays(a, b)
+    assert_equal(result[0], np.array([(1, 2, 3), (1, 2, 3), (1, 2, 3)], dtype='u4,u4,u4'))
+    assert_equal(result[1], np.array([(1, 2, 3), (4, 5, 6), (7, 8, 9)], dtype='u4,u4,u4'))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_arrayprint.py b/venv/Lib/site-packages/numpy/core/tests/test_arrayprint.py
new file mode 100644
index 000000000..e29217461
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_arrayprint.py
@@ -0,0 +1,886 @@
+# -*- coding: utf-8 -*-
+import sys
+import gc
+from hypothesis import given
+from hypothesis.extra import numpy as hynp
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_warns, HAS_REFCOUNT,
+    assert_raises_regex,
+    )
+import textwrap
+
+class TestArrayRepr:
+    def test_nan_inf(self):
+        x = np.array([np.nan, np.inf])
+        assert_equal(repr(x), 'array([nan, inf])')
+
+    def test_subclass(self):
+        class sub(np.ndarray): pass
+
+        # one dimensional
+        x1d = np.array([1, 2]).view(sub)
+        assert_equal(repr(x1d), 'sub([1, 2])')
+
+        # two dimensional
+        x2d = np.array([[1, 2], [3, 4]]).view(sub)
+        assert_equal(repr(x2d),
+            'sub([[1, 2],\n'
+            '     [3, 4]])')
+
+        # two dimensional with flexible dtype
+        xstruct = np.ones((2,2), dtype=[('a', '<i4')]).view(sub)
+        assert_equal(repr(xstruct),
+            "sub([[(1,), (1,)],\n"
+            "     [(1,), (1,)]], dtype=[('a', '<i4')])"
+        )
+
+    @pytest.mark.xfail(reason="See gh-10544")
+    def test_object_subclass(self):
+        class sub(np.ndarray):
+            def __new__(cls, inp):
+                obj = np.asarray(inp).view(cls)
+                return obj
+
+            def __getitem__(self, ind):
+                ret = super(sub, self).__getitem__(ind)
+                return sub(ret)
+
+        # test that object + subclass is OK:
+        x = sub([None, None])
+        assert_equal(repr(x), 'sub([None, None], dtype=object)')
+        assert_equal(str(x), '[None None]')
+
+        x = sub([None, sub([None, None])])
+        assert_equal(repr(x),
+            'sub([None, sub([None, None], dtype=object)], dtype=object)')
+        assert_equal(str(x), '[None sub([None, None], dtype=object)]')
+
+    def test_0d_object_subclass(self):
+        # make sure that subclasses which return 0ds instead
+        # of scalars don't cause infinite recursion in str
+        class sub(np.ndarray):
+            def __new__(cls, inp):
+                obj = np.asarray(inp).view(cls)
+                return obj
+
+            def __getitem__(self, ind):
+                ret = super(sub, self).__getitem__(ind)
+                return sub(ret)
+
+        x = sub(1)
+        assert_equal(repr(x), 'sub(1)')
+        assert_equal(str(x), '1')
+
+        x = sub([1, 1])
+        assert_equal(repr(x), 'sub([1, 1])')
+        assert_equal(str(x), '[1 1]')
+
+        # check it works properly with object arrays too
+        x = sub(None)
+        assert_equal(repr(x), 'sub(None, dtype=object)')
+        assert_equal(str(x), 'None')
+
+        # plus recursive object arrays (even depth > 1)
+        y = sub(None)
+        x[()] = y
+        y[()] = x
+        assert_equal(repr(x),
+            'sub(sub(sub(..., dtype=object), dtype=object), dtype=object)')
+        assert_equal(str(x), '...')
+        x[()] = 0  # resolve circular references for garbage collector
+
+        # nested 0d-subclass-object
+        x = sub(None)
+        x[()] = sub(None)
+        assert_equal(repr(x), 'sub(sub(None, dtype=object), dtype=object)')
+        assert_equal(str(x), 'None')
+
+        # gh-10663
+        class DuckCounter(np.ndarray):
+            def __getitem__(self, item):
+                result = super(DuckCounter, self).__getitem__(item)
+                if not isinstance(result, DuckCounter):
+                    result = result[...].view(DuckCounter)
+                return result
+
+            def to_string(self):
+                return {0: 'zero', 1: 'one', 2: 'two'}.get(self.item(), 'many')
+
+            def __str__(self):
+                if self.shape == ():
+                    return self.to_string()
+                else:
+                    fmt = {'all': lambda x: x.to_string()}
+                    return np.array2string(self, formatter=fmt)
+
+        dc = np.arange(5).view(DuckCounter)
+        assert_equal(str(dc), "[zero one two many many]")
+        assert_equal(str(dc[0]), "zero")
+
+    def test_self_containing(self):
+        arr0d = np.array(None)
+        arr0d[()] = arr0d
+        assert_equal(repr(arr0d),
+            'array(array(..., dtype=object), dtype=object)')
+        arr0d[()] = 0  # resolve recursion for garbage collector
+
+        arr1d = np.array([None, None])
+        arr1d[1] = arr1d
+        assert_equal(repr(arr1d),
+            'array([None, array(..., dtype=object)], dtype=object)')
+        arr1d[1] = 0  # resolve recursion for garbage collector
+
+        first = np.array(None)
+        second = np.array(None)
+        first[()] = second
+        second[()] = first
+        assert_equal(repr(first),
+            'array(array(array(..., dtype=object), dtype=object), dtype=object)')
+        first[()] = 0  # resolve circular references for garbage collector
+
+    def test_containing_list(self):
+        # printing square brackets directly would be ambiguuous
+        arr1d = np.array([None, None])
+        arr1d[0] = [1, 2]
+        arr1d[1] = [3]
+        assert_equal(repr(arr1d),
+            'array([list([1, 2]), list([3])], dtype=object)')
+
+    def test_void_scalar_recursion(self):
+        # gh-9345
+        repr(np.void(b'test'))  # RecursionError ?
+
+    def test_fieldless_structured(self):
+        # gh-10366
+        no_fields = np.dtype([])
+        arr_no_fields = np.empty(4, dtype=no_fields)
+        assert_equal(repr(arr_no_fields), 'array([(), (), (), ()], dtype=[])')
+
+
+class TestComplexArray:
+    def test_str(self):
+        rvals = [0, 1, -1, np.inf, -np.inf, np.nan]
+        cvals = [complex(rp, ip) for rp in rvals for ip in rvals]
+        dtypes = [np.complex64, np.cdouble, np.clongdouble]
+        actual = [str(np.array([c], dt)) for c in cvals for dt in dtypes]
+        wanted = [
+            '[0.+0.j]',    '[0.+0.j]',    '[0.+0.j]',
+            '[0.+1.j]',    '[0.+1.j]',    '[0.+1.j]',
+            '[0.-1.j]',    '[0.-1.j]',    '[0.-1.j]',
+            '[0.+infj]',   '[0.+infj]',   '[0.+infj]',
+            '[0.-infj]',   '[0.-infj]',   '[0.-infj]',
+            '[0.+nanj]',   '[0.+nanj]',   '[0.+nanj]',
+            '[1.+0.j]',    '[1.+0.j]',    '[1.+0.j]',
+            '[1.+1.j]',    '[1.+1.j]',    '[1.+1.j]',
+            '[1.-1.j]',    '[1.-1.j]',    '[1.-1.j]',
+            '[1.+infj]',   '[1.+infj]',   '[1.+infj]',
+            '[1.-infj]',   '[1.-infj]',   '[1.-infj]',
+            '[1.+nanj]',   '[1.+nanj]',   '[1.+nanj]',
+            '[-1.+0.j]',   '[-1.+0.j]',   '[-1.+0.j]',
+            '[-1.+1.j]',   '[-1.+1.j]',   '[-1.+1.j]',
+            '[-1.-1.j]',   '[-1.-1.j]',   '[-1.-1.j]',
+            '[-1.+infj]',  '[-1.+infj]',  '[-1.+infj]',
+            '[-1.-infj]',  '[-1.-infj]',  '[-1.-infj]',
+            '[-1.+nanj]',  '[-1.+nanj]',  '[-1.+nanj]',
+            '[inf+0.j]',   '[inf+0.j]',   '[inf+0.j]',
+            '[inf+1.j]',   '[inf+1.j]',   '[inf+1.j]',
+            '[inf-1.j]',   '[inf-1.j]',   '[inf-1.j]',
+            '[inf+infj]',  '[inf+infj]',  '[inf+infj]',
+            '[inf-infj]',  '[inf-infj]',  '[inf-infj]',
+            '[inf+nanj]',  '[inf+nanj]',  '[inf+nanj]',
+            '[-inf+0.j]',  '[-inf+0.j]',  '[-inf+0.j]',
+            '[-inf+1.j]',  '[-inf+1.j]',  '[-inf+1.j]',
+            '[-inf-1.j]',  '[-inf-1.j]',  '[-inf-1.j]',
+            '[-inf+infj]', '[-inf+infj]', '[-inf+infj]',
+            '[-inf-infj]', '[-inf-infj]', '[-inf-infj]',
+            '[-inf+nanj]', '[-inf+nanj]', '[-inf+nanj]',
+            '[nan+0.j]',   '[nan+0.j]',   '[nan+0.j]',
+            '[nan+1.j]',   '[nan+1.j]',   '[nan+1.j]',
+            '[nan-1.j]',   '[nan-1.j]',   '[nan-1.j]',
+            '[nan+infj]',  '[nan+infj]',  '[nan+infj]',
+            '[nan-infj]',  '[nan-infj]',  '[nan-infj]',
+            '[nan+nanj]',  '[nan+nanj]',  '[nan+nanj]']
+
+        for res, val in zip(actual, wanted):
+            assert_equal(res, val)
+
+class TestArray2String:
+    def test_basic(self):
+        """Basic test of array2string."""
+        a = np.arange(3)
+        assert_(np.array2string(a) == '[0 1 2]')
+        assert_(np.array2string(a, max_line_width=4, legacy='1.13') == '[0 1\n 2]')
+        assert_(np.array2string(a, max_line_width=4) == '[0\n 1\n 2]')
+
+    def test_unexpected_kwarg(self):
+        # ensure than an appropriate TypeError
+        # is raised when array2string receives
+        # an unexpected kwarg
+
+        with assert_raises_regex(TypeError, 'nonsense'):
+            np.array2string(np.array([1, 2, 3]),
+                            nonsense=None)
+
+    def test_format_function(self):
+        """Test custom format function for each element in array."""
+        def _format_function(x):
+            if np.abs(x) < 1:
+                return '.'
+            elif np.abs(x) < 2:
+                return 'o'
+            else:
+                return 'O'
+
+        x = np.arange(3)
+        x_hex = "[0x0 0x1 0x2]"
+        x_oct = "[0o0 0o1 0o2]"
+        assert_(np.array2string(x, formatter={'all':_format_function}) ==
+                "[. o O]")
+        assert_(np.array2string(x, formatter={'int_kind':_format_function}) ==
+                "[. o O]")
+        assert_(np.array2string(x, formatter={'all':lambda x: "%.4f" % x}) ==
+                "[0.0000 1.0000 2.0000]")
+        assert_equal(np.array2string(x, formatter={'int':lambda x: hex(x)}),
+                x_hex)
+        assert_equal(np.array2string(x, formatter={'int':lambda x: oct(x)}),
+                x_oct)
+
+        x = np.arange(3.)
+        assert_(np.array2string(x, formatter={'float_kind':lambda x: "%.2f" % x}) ==
+                "[0.00 1.00 2.00]")
+        assert_(np.array2string(x, formatter={'float':lambda x: "%.2f" % x}) ==
+                "[0.00 1.00 2.00]")
+
+        s = np.array(['abc', 'def'])
+        assert_(np.array2string(s, formatter={'numpystr':lambda s: s*2}) ==
+                '[abcabc defdef]')
+
+
+    def test_structure_format(self):
+        dt = np.dtype([('name', np.str_, 16), ('grades', np.float64, (2,))])
+        x = np.array([('Sarah', (8.0, 7.0)), ('John', (6.0, 7.0))], dtype=dt)
+        assert_equal(np.array2string(x),
+                "[('Sarah', [8., 7.]) ('John', [6., 7.])]")
+
+        np.set_printoptions(legacy='1.13')
+        try:
+            # for issue #5692
+            A = np.zeros(shape=10, dtype=[("A", "M8[s]")])
+            A[5:].fill(np.datetime64('NaT'))
+            assert_equal(
+                np.array2string(A),
+                textwrap.dedent("""\
+                [('1970-01-01T00:00:00',) ('1970-01-01T00:00:00',) ('1970-01-01T00:00:00',)
+                 ('1970-01-01T00:00:00',) ('1970-01-01T00:00:00',) ('NaT',) ('NaT',)
+                 ('NaT',) ('NaT',) ('NaT',)]""")
+            )
+        finally:
+            np.set_printoptions(legacy=False)
+
+        # same again, but with non-legacy behavior
+        assert_equal(
+            np.array2string(A),
+            textwrap.dedent("""\
+            [('1970-01-01T00:00:00',) ('1970-01-01T00:00:00',)
+             ('1970-01-01T00:00:00',) ('1970-01-01T00:00:00',)
+             ('1970-01-01T00:00:00',) (                'NaT',)
+             (                'NaT',) (                'NaT',)
+             (                'NaT',) (                'NaT',)]""")
+        )
+
+        # and again, with timedeltas
+        A = np.full(10, 123456, dtype=[("A", "m8[s]")])
+        A[5:].fill(np.datetime64('NaT'))
+        assert_equal(
+            np.array2string(A),
+            textwrap.dedent("""\
+            [(123456,) (123456,) (123456,) (123456,) (123456,) ( 'NaT',) ( 'NaT',)
+             ( 'NaT',) ( 'NaT',) ( 'NaT',)]""")
+        )
+
+        # See #8160
+        struct_int = np.array([([1, -1],), ([123, 1],)], dtype=[('B', 'i4', 2)])
+        assert_equal(np.array2string(struct_int),
+                "[([  1,  -1],) ([123,   1],)]")
+        struct_2dint = np.array([([[0, 1], [2, 3]],), ([[12, 0], [0, 0]],)],
+                dtype=[('B', 'i4', (2, 2))])
+        assert_equal(np.array2string(struct_2dint),
+                "[([[ 0,  1], [ 2,  3]],) ([[12,  0], [ 0,  0]],)]")
+
+        # See #8172
+        array_scalar = np.array(
+                (1., 2.1234567890123456789, 3.), dtype=('f8,f8,f8'))
+        assert_equal(np.array2string(array_scalar), "(1., 2.12345679, 3.)")
+
+    def test_unstructured_void_repr(self):
+        a = np.array([27, 91, 50, 75,  7, 65, 10,  8,
+                      27, 91, 51, 49,109, 82,101,100], dtype='u1').view('V8')
+        assert_equal(repr(a[0]), r"void(b'\x1B\x5B\x32\x4B\x07\x41\x0A\x08')")
+        assert_equal(str(a[0]), r"b'\x1B\x5B\x32\x4B\x07\x41\x0A\x08'")
+        assert_equal(repr(a),
+            r"array([b'\x1B\x5B\x32\x4B\x07\x41\x0A\x08'," "\n"
+            r"       b'\x1B\x5B\x33\x31\x6D\x52\x65\x64'], dtype='|V8')")
+
+        assert_equal(eval(repr(a), vars(np)), a)
+        assert_equal(eval(repr(a[0]), vars(np)), a[0])
+
+    def test_edgeitems_kwarg(self):
+        # previously the global print options would be taken over the kwarg
+        arr = np.zeros(3, int)
+        assert_equal(
+            np.array2string(arr, edgeitems=1, threshold=0),
+            "[0 ... 0]"
+        )
+
+    def test_summarize_1d(self):
+        A = np.arange(1001)
+        strA = '[   0    1    2 ...  998  999 1000]'
+        assert_equal(str(A), strA)
+
+        reprA = 'array([   0,    1,    2, ...,  998,  999, 1000])'
+        assert_equal(repr(A), reprA)
+
+    def test_summarize_2d(self):
+        A = np.arange(1002).reshape(2, 501)
+        strA = '[[   0    1    2 ...  498  499  500]\n' \
+               ' [ 501  502  503 ...  999 1000 1001]]'
+        assert_equal(str(A), strA)
+
+        reprA = 'array([[   0,    1,    2, ...,  498,  499,  500],\n' \
+                '       [ 501,  502,  503, ...,  999, 1000, 1001]])'
+        assert_equal(repr(A), reprA)
+
+    def test_linewidth(self):
+        a = np.full(6, 1)
+
+        def make_str(a, width, **kw):
+            return np.array2string(a, separator="", max_line_width=width, **kw)
+
+        assert_equal(make_str(a, 8, legacy='1.13'), '[111111]')
+        assert_equal(make_str(a, 7, legacy='1.13'), '[111111]')
+        assert_equal(make_str(a, 5, legacy='1.13'), '[1111\n'
+                                                    ' 11]')
+
+        assert_equal(make_str(a, 8), '[111111]')
+        assert_equal(make_str(a, 7), '[11111\n'
+                                     ' 1]')
+        assert_equal(make_str(a, 5), '[111\n'
+                                     ' 111]')
+
+        b = a[None,None,:]
+
+        assert_equal(make_str(b, 12, legacy='1.13'), '[[[111111]]]')
+        assert_equal(make_str(b,  9, legacy='1.13'), '[[[111111]]]')
+        assert_equal(make_str(b,  8, legacy='1.13'), '[[[11111\n'
+                                                     '   1]]]')
+
+        assert_equal(make_str(b, 12), '[[[111111]]]')
+        assert_equal(make_str(b,  9), '[[[111\n'
+                                      '   111]]]')
+        assert_equal(make_str(b,  8), '[[[11\n'
+                                      '   11\n'
+                                      '   11]]]')
+
+    def test_wide_element(self):
+        a = np.array(['xxxxx'])
+        assert_equal(
+            np.array2string(a, max_line_width=5),
+            "['xxxxx']"
+        )
+        assert_equal(
+            np.array2string(a, max_line_width=5, legacy='1.13'),
+            "[ 'xxxxx']"
+        )
+
+    @given(hynp.from_dtype(np.dtype("U")))
+    def test_any_text(self, text):
+        # This test checks that, given any value that can be represented in an
+        # array of dtype("U") (i.e. unicode string), ...
+        a = np.array([text, text, text])
+        # casting a list of them to an array does not e.g. truncate the value
+        assert_equal(a[0], text)
+        # and that np.array2string puts a newline in the expected location
+        expected_repr = "[{0!r} {0!r}\n {0!r}]".format(text)
+        result = np.array2string(a, max_line_width=len(repr(text)) * 2 + 3)
+        assert_equal(result, expected_repr)
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_refcount(self):
+        # make sure we do not hold references to the array due to a recursive
+        # closure (gh-10620)
+        gc.disable()
+        a = np.arange(2)
+        r1 = sys.getrefcount(a)
+        np.array2string(a)
+        np.array2string(a)
+        r2 = sys.getrefcount(a)
+        gc.collect()
+        gc.enable()
+        assert_(r1 == r2)
+
+class TestPrintOptions:
+    """Test getting and setting global print options."""
+
+    def setup(self):
+        self.oldopts = np.get_printoptions()
+
+    def teardown(self):
+        np.set_printoptions(**self.oldopts)
+
+    def test_basic(self):
+        x = np.array([1.5, 0, 1.234567890])
+        assert_equal(repr(x), "array([1.5       , 0.        , 1.23456789])")
+        np.set_printoptions(precision=4)
+        assert_equal(repr(x), "array([1.5   , 0.    , 1.2346])")
+
+    def test_precision_zero(self):
+        np.set_printoptions(precision=0)
+        for values, string in (
+                ([0.], "0."), ([.3], "0."), ([-.3], "-0."), ([.7], "1."),
+                ([1.5], "2."), ([-1.5], "-2."), ([-15.34], "-15."),
+                ([100.], "100."), ([.2, -1, 122.51], "  0.,  -1., 123."),
+                ([0], "0"), ([-12], "-12"), ([complex(.3, -.7)], "0.-1.j")):
+            x = np.array(values)
+            assert_equal(repr(x), "array([%s])" % string)
+
+    def test_formatter(self):
+        x = np.arange(3)
+        np.set_printoptions(formatter={'all':lambda x: str(x-1)})
+        assert_equal(repr(x), "array([-1, 0, 1])")
+
+    def test_formatter_reset(self):
+        x = np.arange(3)
+        np.set_printoptions(formatter={'all':lambda x: str(x-1)})
+        assert_equal(repr(x), "array([-1, 0, 1])")
+        np.set_printoptions(formatter={'int':None})
+        assert_equal(repr(x), "array([0, 1, 2])")
+
+        np.set_printoptions(formatter={'all':lambda x: str(x-1)})
+        assert_equal(repr(x), "array([-1, 0, 1])")
+        np.set_printoptions(formatter={'all':None})
+        assert_equal(repr(x), "array([0, 1, 2])")
+
+        np.set_printoptions(formatter={'int':lambda x: str(x-1)})
+        assert_equal(repr(x), "array([-1, 0, 1])")
+        np.set_printoptions(formatter={'int_kind':None})
+        assert_equal(repr(x), "array([0, 1, 2])")
+
+        x = np.arange(3.)
+        np.set_printoptions(formatter={'float':lambda x: str(x-1)})
+        assert_equal(repr(x), "array([-1.0, 0.0, 1.0])")
+        np.set_printoptions(formatter={'float_kind':None})
+        assert_equal(repr(x), "array([0., 1., 2.])")
+
+    def test_0d_arrays(self):
+        assert_equal(str(np.array(u'café', '<U4')), u'café')
+
+        assert_equal(repr(np.array('café', '<U4')),
+                     "array('café', dtype='<U4')")
+        assert_equal(str(np.array('test', np.str_)), 'test')
+
+        a = np.zeros(1, dtype=[('a', '<i4', (3,))])
+        assert_equal(str(a[0]), '([0, 0, 0],)')
+
+        assert_equal(repr(np.datetime64('2005-02-25')[...]),
+                     "array('2005-02-25', dtype='datetime64[D]')")
+
+        assert_equal(repr(np.timedelta64('10', 'Y')[...]),
+                     "array(10, dtype='timedelta64[Y]')")
+
+        # repr of 0d arrays is affected by printoptions
+        x = np.array(1)
+        np.set_printoptions(formatter={'all':lambda x: "test"})
+        assert_equal(repr(x), "array(test)")
+        # str is unaffected
+        assert_equal(str(x), "1")
+
+        # check `style` arg raises
+        assert_warns(DeprecationWarning, np.array2string,
+                                         np.array(1.), style=repr)
+        # but not in legacy mode
+        np.array2string(np.array(1.), style=repr, legacy='1.13')
+        # gh-10934 style was broken in legacy mode, check it works
+        np.array2string(np.array(1.), legacy='1.13')
+
+    def test_float_spacing(self):
+        x = np.array([1., 2., 3.])
+        y = np.array([1., 2., -10.])
+        z = np.array([100., 2., -1.])
+        w = np.array([-100., 2., 1.])
+
+        assert_equal(repr(x), 'array([1., 2., 3.])')
+        assert_equal(repr(y), 'array([  1.,   2., -10.])')
+        assert_equal(repr(np.array(y[0])), 'array(1.)')
+        assert_equal(repr(np.array(y[-1])), 'array(-10.)')
+        assert_equal(repr(z), 'array([100.,   2.,  -1.])')
+        assert_equal(repr(w), 'array([-100.,    2.,    1.])')
+
+        assert_equal(repr(np.array([np.nan, np.inf])), 'array([nan, inf])')
+        assert_equal(repr(np.array([np.nan, -np.inf])), 'array([ nan, -inf])')
+
+        x = np.array([np.inf, 100000, 1.1234])
+        y = np.array([np.inf, 100000, -1.1234])
+        z = np.array([np.inf, 1.1234, -1e120])
+        np.set_printoptions(precision=2)
+        assert_equal(repr(x), 'array([     inf, 1.00e+05, 1.12e+00])')
+        assert_equal(repr(y), 'array([      inf,  1.00e+05, -1.12e+00])')
+        assert_equal(repr(z), 'array([       inf,  1.12e+000, -1.00e+120])')
+
+    def test_bool_spacing(self):
+        assert_equal(repr(np.array([True,  True])),
+                     'array([ True,  True])')
+        assert_equal(repr(np.array([True, False])),
+                     'array([ True, False])')
+        assert_equal(repr(np.array([True])),
+                     'array([ True])')
+        assert_equal(repr(np.array(True)),
+                     'array(True)')
+        assert_equal(repr(np.array(False)),
+                     'array(False)')
+
+    def test_sign_spacing(self):
+        a = np.arange(4.)
+        b = np.array([1.234e9])
+        c = np.array([1.0 + 1.0j, 1.123456789 + 1.123456789j], dtype='c16')
+
+        assert_equal(repr(a), 'array([0., 1., 2., 3.])')
+        assert_equal(repr(np.array(1.)), 'array(1.)')
+        assert_equal(repr(b), 'array([1.234e+09])')
+        assert_equal(repr(np.array([0.])), 'array([0.])')
+        assert_equal(repr(c),
+            "array([1.        +1.j        , 1.12345679+1.12345679j])")
+        assert_equal(repr(np.array([0., -0.])), 'array([ 0., -0.])')
+
+        np.set_printoptions(sign=' ')
+        assert_equal(repr(a), 'array([ 0.,  1.,  2.,  3.])')
+        assert_equal(repr(np.array(1.)), 'array( 1.)')
+        assert_equal(repr(b), 'array([ 1.234e+09])')
+        assert_equal(repr(c),
+            "array([ 1.        +1.j        ,  1.12345679+1.12345679j])")
+        assert_equal(repr(np.array([0., -0.])), 'array([ 0., -0.])')
+
+        np.set_printoptions(sign='+')
+        assert_equal(repr(a), 'array([+0., +1., +2., +3.])')
+        assert_equal(repr(np.array(1.)), 'array(+1.)')
+        assert_equal(repr(b), 'array([+1.234e+09])')
+        assert_equal(repr(c),
+            "array([+1.        +1.j        , +1.12345679+1.12345679j])")
+
+        np.set_printoptions(legacy='1.13')
+        assert_equal(repr(a), 'array([ 0.,  1.,  2.,  3.])')
+        assert_equal(repr(b),  'array([  1.23400000e+09])')
+        assert_equal(repr(-b), 'array([ -1.23400000e+09])')
+        assert_equal(repr(np.array(1.)), 'array(1.0)')
+        assert_equal(repr(np.array([0.])), 'array([ 0.])')
+        assert_equal(repr(c),
+            "array([ 1.00000000+1.j        ,  1.12345679+1.12345679j])")
+        # gh-10383
+        assert_equal(str(np.array([-1., 10])), "[ -1.  10.]")
+
+        assert_raises(TypeError, np.set_printoptions, wrongarg=True)
+
+    def test_float_overflow_nowarn(self):
+        # make sure internal computations in FloatingFormat don't
+        # warn about overflow
+        repr(np.array([1e4, 0.1], dtype='f2'))
+
+    def test_sign_spacing_structured(self):
+        a = np.ones(2, dtype='<f,<f')
+        assert_equal(repr(a),
+            "array([(1., 1.), (1., 1.)], dtype=[('f0', '<f4'), ('f1', '<f4')])")
+        assert_equal(repr(a[0]), "(1., 1.)")
+
+    def test_floatmode(self):
+        x = np.array([0.6104, 0.922, 0.457, 0.0906, 0.3733, 0.007244,
+                      0.5933, 0.947, 0.2383, 0.4226], dtype=np.float16)
+        y = np.array([0.2918820979355541, 0.5064172631089138,
+                      0.2848750619642916, 0.4342965294660567,
+                      0.7326538397312751, 0.3459503329096204,
+                      0.0862072768214508, 0.39112753029631175],
+                      dtype=np.float64)
+        z = np.arange(6, dtype=np.float16)/10
+        c = np.array([1.0 + 1.0j, 1.123456789 + 1.123456789j], dtype='c16')
+
+        # also make sure 1e23 is right (is between two fp numbers)
+        w = np.array(['1e{}'.format(i) for i in range(25)], dtype=np.float64)
+        # note: we construct w from the strings `1eXX` instead of doing
+        # `10.**arange(24)` because it turns out the two are not equivalent in
+        # python. On some architectures `1e23 != 10.**23`.
+        wp = np.array([1.234e1, 1e2, 1e123])
+
+        # unique mode
+        np.set_printoptions(floatmode='unique')
+        assert_equal(repr(x),
+            "array([0.6104  , 0.922   , 0.457   , 0.0906  , 0.3733  , 0.007244,\n"
+            "       0.5933  , 0.947   , 0.2383  , 0.4226  ], dtype=float16)")
+        assert_equal(repr(y),
+            "array([0.2918820979355541 , 0.5064172631089138 , 0.2848750619642916 ,\n"
+            "       0.4342965294660567 , 0.7326538397312751 , 0.3459503329096204 ,\n"
+            "       0.0862072768214508 , 0.39112753029631175])")
+        assert_equal(repr(z),
+            "array([0. , 0.1, 0.2, 0.3, 0.4, 0.5], dtype=float16)")
+        assert_equal(repr(w),
+            "array([1.e+00, 1.e+01, 1.e+02, 1.e+03, 1.e+04, 1.e+05, 1.e+06, 1.e+07,\n"
+            "       1.e+08, 1.e+09, 1.e+10, 1.e+11, 1.e+12, 1.e+13, 1.e+14, 1.e+15,\n"
+            "       1.e+16, 1.e+17, 1.e+18, 1.e+19, 1.e+20, 1.e+21, 1.e+22, 1.e+23,\n"
+            "       1.e+24])")
+        assert_equal(repr(wp), "array([1.234e+001, 1.000e+002, 1.000e+123])")
+        assert_equal(repr(c),
+            "array([1.         +1.j         , 1.123456789+1.123456789j])")
+
+        # maxprec mode, precision=8
+        np.set_printoptions(floatmode='maxprec', precision=8)
+        assert_equal(repr(x),
+            "array([0.6104  , 0.922   , 0.457   , 0.0906  , 0.3733  , 0.007244,\n"
+            "       0.5933  , 0.947   , 0.2383  , 0.4226  ], dtype=float16)")
+        assert_equal(repr(y),
+            "array([0.2918821 , 0.50641726, 0.28487506, 0.43429653, 0.73265384,\n"
+            "       0.34595033, 0.08620728, 0.39112753])")
+        assert_equal(repr(z),
+            "array([0. , 0.1, 0.2, 0.3, 0.4, 0.5], dtype=float16)")
+        assert_equal(repr(w[::5]),
+            "array([1.e+00, 1.e+05, 1.e+10, 1.e+15, 1.e+20])")
+        assert_equal(repr(wp), "array([1.234e+001, 1.000e+002, 1.000e+123])")
+        assert_equal(repr(c),
+            "array([1.        +1.j        , 1.12345679+1.12345679j])")
+
+        # fixed mode, precision=4
+        np.set_printoptions(floatmode='fixed', precision=4)
+        assert_equal(repr(x),
+            "array([0.6104, 0.9219, 0.4570, 0.0906, 0.3733, 0.0072, 0.5933, 0.9468,\n"
+            "       0.2383, 0.4226], dtype=float16)")
+        assert_equal(repr(y),
+            "array([0.2919, 0.5064, 0.2849, 0.4343, 0.7327, 0.3460, 0.0862, 0.3911])")
+        assert_equal(repr(z),
+            "array([0.0000, 0.1000, 0.2000, 0.3000, 0.3999, 0.5000], dtype=float16)")
+        assert_equal(repr(w[::5]),
+            "array([1.0000e+00, 1.0000e+05, 1.0000e+10, 1.0000e+15, 1.0000e+20])")
+        assert_equal(repr(wp), "array([1.2340e+001, 1.0000e+002, 1.0000e+123])")
+        assert_equal(repr(np.zeros(3)), "array([0.0000, 0.0000, 0.0000])")
+        assert_equal(repr(c),
+            "array([1.0000+1.0000j, 1.1235+1.1235j])")
+        # for larger precision, representation error becomes more apparent:
+        np.set_printoptions(floatmode='fixed', precision=8)
+        assert_equal(repr(z),
+            "array([0.00000000, 0.09997559, 0.19995117, 0.30004883, 0.39990234,\n"
+            "       0.50000000], dtype=float16)")
+
+        # maxprec_equal  mode, precision=8
+        np.set_printoptions(floatmode='maxprec_equal', precision=8)
+        assert_equal(repr(x),
+            "array([0.610352, 0.921875, 0.457031, 0.090576, 0.373291, 0.007244,\n"
+            "       0.593262, 0.946777, 0.238281, 0.422607], dtype=float16)")
+        assert_equal(repr(y),
+            "array([0.29188210, 0.50641726, 0.28487506, 0.43429653, 0.73265384,\n"
+            "       0.34595033, 0.08620728, 0.39112753])")
+        assert_equal(repr(z),
+            "array([0.0, 0.1, 0.2, 0.3, 0.4, 0.5], dtype=float16)")
+        assert_equal(repr(w[::5]),
+            "array([1.e+00, 1.e+05, 1.e+10, 1.e+15, 1.e+20])")
+        assert_equal(repr(wp), "array([1.234e+001, 1.000e+002, 1.000e+123])")
+        assert_equal(repr(c),
+            "array([1.00000000+1.00000000j, 1.12345679+1.12345679j])")
+
+    def test_legacy_mode_scalars(self):
+        # in legacy mode, str of floats get truncated, and complex scalars
+        # use * for non-finite imaginary part
+        np.set_printoptions(legacy='1.13')
+        assert_equal(str(np.float64(1.123456789123456789)), '1.12345678912')
+        assert_equal(str(np.complex128(complex(1, np.nan))), '(1+nan*j)')
+
+        np.set_printoptions(legacy=False)
+        assert_equal(str(np.float64(1.123456789123456789)),
+                     '1.1234567891234568')
+        assert_equal(str(np.complex128(complex(1, np.nan))), '(1+nanj)')
+
+    def test_legacy_stray_comma(self):
+        np.set_printoptions(legacy='1.13')
+        assert_equal(str(np.arange(10000)), '[   0    1    2 ..., 9997 9998 9999]')
+
+        np.set_printoptions(legacy=False)
+        assert_equal(str(np.arange(10000)), '[   0    1    2 ... 9997 9998 9999]')
+
+    def test_dtype_linewidth_wrapping(self):
+        np.set_printoptions(linewidth=75)
+        assert_equal(repr(np.arange(10,20., dtype='f4')),
+            "array([10., 11., 12., 13., 14., 15., 16., 17., 18., 19.], dtype=float32)")
+        assert_equal(repr(np.arange(10,23., dtype='f4')), textwrap.dedent("""\
+            array([10., 11., 12., 13., 14., 15., 16., 17., 18., 19., 20., 21., 22.],
+                  dtype=float32)"""))
+
+        styp = '<U4'
+        assert_equal(repr(np.ones(3, dtype=styp)),
+            "array(['1', '1', '1'], dtype='{}')".format(styp))
+        assert_equal(repr(np.ones(12, dtype=styp)), textwrap.dedent("""\
+            array(['1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1', '1'],
+                  dtype='{}')""".format(styp)))
+
+    def test_linewidth_repr(self):
+        a = np.full(7, fill_value=2)
+        np.set_printoptions(linewidth=17)
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([2, 2, 2,
+                   2, 2, 2,
+                   2])""")
+        )
+        np.set_printoptions(linewidth=17, legacy='1.13')
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([2, 2, 2,
+                   2, 2, 2, 2])""")
+        )
+
+        a = np.full(8, fill_value=2)
+
+        np.set_printoptions(linewidth=18, legacy=False)
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([2, 2, 2,
+                   2, 2, 2,
+                   2, 2])""")
+        )
+
+        np.set_printoptions(linewidth=18, legacy='1.13')
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([2, 2, 2, 2,
+                   2, 2, 2, 2])""")
+        )
+
+    def test_linewidth_str(self):
+        a = np.full(18, fill_value=2)
+        np.set_printoptions(linewidth=18)
+        assert_equal(
+            str(a),
+            textwrap.dedent("""\
+            [2 2 2 2 2 2 2 2
+             2 2 2 2 2 2 2 2
+             2 2]""")
+        )
+        np.set_printoptions(linewidth=18, legacy='1.13')
+        assert_equal(
+            str(a),
+            textwrap.dedent("""\
+            [2 2 2 2 2 2 2 2 2
+             2 2 2 2 2 2 2 2 2]""")
+        )
+
+    def test_edgeitems(self):
+        np.set_printoptions(edgeitems=1, threshold=1)
+        a = np.arange(27).reshape((3, 3, 3))
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([[[ 0, ...,  2],
+                    ...,
+                    [ 6, ...,  8]],
+
+                   ...,
+
+                   [[18, ..., 20],
+                    ...,
+                    [24, ..., 26]]])""")
+        )
+
+        b = np.zeros((3, 3, 1, 1))
+        assert_equal(
+            repr(b),
+            textwrap.dedent("""\
+            array([[[[0.]],
+
+                    ...,
+
+                    [[0.]]],
+
+
+                   ...,
+
+
+                   [[[0.]],
+
+                    ...,
+
+                    [[0.]]]])""")
+        )
+
+        # 1.13 had extra trailing spaces, and was missing newlines
+        np.set_printoptions(legacy='1.13')
+
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            array([[[ 0, ...,  2],
+                    ..., 
+                    [ 6, ...,  8]],
+
+                   ..., 
+                   [[18, ..., 20],
+                    ..., 
+                    [24, ..., 26]]])""")
+        )
+
+        assert_equal(
+            repr(b),
+            textwrap.dedent("""\
+            array([[[[ 0.]],
+
+                    ..., 
+                    [[ 0.]]],
+
+
+                   ..., 
+                   [[[ 0.]],
+
+                    ..., 
+                    [[ 0.]]]])""")
+        )
+
+    def test_bad_args(self):
+        assert_raises(ValueError, np.set_printoptions, threshold=float('nan'))
+        assert_raises(TypeError, np.set_printoptions, threshold='1')
+        assert_raises(TypeError, np.set_printoptions, threshold=b'1')
+
+def test_unicode_object_array():
+    expected = "array(['é'], dtype=object)"
+    x = np.array([u'\xe9'], dtype=object)
+    assert_equal(repr(x), expected)
+
+
+class TestContextManager:
+    def test_ctx_mgr(self):
+        # test that context manager actually works
+        with np.printoptions(precision=2):
+            s = str(np.array([2.0]) / 3)
+        assert_equal(s, '[0.67]')
+
+    def test_ctx_mgr_restores(self):
+        # test that print options are actually restrored
+        opts = np.get_printoptions()
+        with np.printoptions(precision=opts['precision'] - 1,
+                             linewidth=opts['linewidth'] - 4):
+            pass
+        assert_equal(np.get_printoptions(), opts)
+
+    def test_ctx_mgr_exceptions(self):
+        # test that print options are restored even if an exception is raised
+        opts = np.get_printoptions()
+        try:
+            with np.printoptions(precision=2, linewidth=11):
+                raise ValueError
+        except ValueError:
+            pass
+        assert_equal(np.get_printoptions(), opts)
+
+    def test_ctx_mgr_as_smth(self):
+        opts = {"precision": 2}
+        with np.printoptions(**opts) as ctx:
+            saved_opts = ctx.copy()
+        assert_equal({k: saved_opts[k] for k in opts}, opts)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_conversion_utils.py b/venv/Lib/site-packages/numpy/core/tests/test_conversion_utils.py
new file mode 100644
index 000000000..3c3f9e6e1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_conversion_utils.py
@@ -0,0 +1,156 @@
+"""
+Tests for numpy/core/src/multiarray/conversion_utils.c
+"""
+import re
+
+import pytest
+
+import numpy as np
+import numpy.core._multiarray_tests as mt
+
+
+class StringConverterTestCase:
+    allow_bytes = True
+    case_insensitive = True
+    exact_match = False
+
+    def _check_value_error(self, val):
+        pattern = r'\(got {}\)'.format(re.escape(repr(val)))
+        with pytest.raises(ValueError, match=pattern) as exc:
+            self.conv(val)
+
+    def _check(self, val, expected):
+        assert self.conv(val) == expected
+
+        if self.allow_bytes:
+            assert self.conv(val.encode('ascii')) == expected
+        else:
+            with pytest.raises(TypeError):
+                self.conv(val.encode('ascii'))
+
+        if len(val) != 1:
+            if self.exact_match:
+                self._check_value_error(val[:1])
+                self._check_value_error(val + '\0')
+            else:
+                assert self.conv(val[:1]) == expected
+
+        if self.case_insensitive:
+            if val != val.lower():
+                assert self.conv(val.lower()) == expected
+            if val != val.upper():
+                assert self.conv(val.upper()) == expected
+        else:
+            if val != val.lower():
+                self._check_value_error(val.lower())
+            if val != val.upper():
+                self._check_value_error(val.upper())
+
+    def test_wrong_type(self):
+        # common cases which apply to all the below
+        with pytest.raises(TypeError):
+            self.conv({})
+        with pytest.raises(TypeError):
+            self.conv([])
+
+    def test_wrong_value(self):
+        # nonsense strings
+        self._check_value_error('')
+        self._check_value_error('\N{greek small letter pi}')
+
+        if self.allow_bytes:
+            self._check_value_error(b'')
+            # bytes which can't be converted to strings via utf8
+            self._check_value_error(b"\xFF")
+        if self.exact_match:
+            self._check_value_error("there's no way this is supported")
+
+
+class TestByteorderConverter(StringConverterTestCase):
+    """ Tests of PyArray_ByteorderConverter """
+    conv = mt.run_byteorder_converter
+    def test_valid(self):
+        for s in ['big', '>']:
+            self._check(s, 'NPY_BIG')
+        for s in ['little', '<']:
+            self._check(s, 'NPY_LITTLE')
+        for s in ['native', '=']:
+            self._check(s, 'NPY_NATIVE')
+        for s in ['ignore', '|']:
+            self._check(s, 'NPY_IGNORE')
+        for s in ['swap']:
+            self._check(s, 'NPY_SWAP')
+
+
+class TestSortkindConverter(StringConverterTestCase):
+    """ Tests of PyArray_SortkindConverter """
+    conv = mt.run_sortkind_converter
+    def test_valid(self):
+        self._check('quick', 'NPY_QUICKSORT')
+        self._check('heap', 'NPY_HEAPSORT')
+        self._check('merge', 'NPY_STABLESORT')  # alias
+        self._check('stable', 'NPY_STABLESORT')
+
+
+class TestSelectkindConverter(StringConverterTestCase):
+    """ Tests of PyArray_SelectkindConverter """
+    conv = mt.run_selectkind_converter
+    case_insensitive = False
+    exact_match = True
+
+    def test_valid(self):
+        self._check('introselect', 'NPY_INTROSELECT')
+
+
+class TestSearchsideConverter(StringConverterTestCase):
+    """ Tests of PyArray_SearchsideConverter """
+    conv = mt.run_searchside_converter
+    def test_valid(self):
+        self._check('left', 'NPY_SEARCHLEFT')
+        self._check('right', 'NPY_SEARCHRIGHT')
+
+
+class TestOrderConverter(StringConverterTestCase):
+    """ Tests of PyArray_OrderConverter """
+    conv = mt.run_order_converter
+    def test_valid(self):
+        self._check('c', 'NPY_CORDER')
+        self._check('f', 'NPY_FORTRANORDER')
+        self._check('a', 'NPY_ANYORDER')
+        self._check('k', 'NPY_KEEPORDER')
+
+    def test_flatten_invalid_order(self):
+        # invalid after gh-14596
+        with pytest.raises(ValueError):
+            self.conv('Z')
+        for order in [False, True, 0, 8]:
+            with pytest.raises(TypeError):
+                self.conv(order)
+
+
+class TestClipmodeConverter(StringConverterTestCase):
+    """ Tests of PyArray_ClipmodeConverter """
+    conv = mt.run_clipmode_converter
+    def test_valid(self):
+        self._check('clip', 'NPY_CLIP')
+        self._check('wrap', 'NPY_WRAP')
+        self._check('raise', 'NPY_RAISE')
+
+        # integer values allowed here
+        assert self.conv(np.CLIP) == 'NPY_CLIP'
+        assert self.conv(np.WRAP) == 'NPY_WRAP'
+        assert self.conv(np.RAISE) == 'NPY_RAISE'
+
+
+class TestCastingConverter(StringConverterTestCase):
+    """ Tests of PyArray_CastingConverter """
+    conv = mt.run_casting_converter
+    case_insensitive = False
+    exact_match = True
+
+    def test_valid(self):
+        self._check("no", "NPY_NO_CASTING")
+        self._check("equiv", "NPY_EQUIV_CASTING")
+        self._check("safe", "NPY_SAFE_CASTING")
+        self._check("same_kind", "NPY_SAME_KIND_CASTING")
+        self._check("unsafe", "NPY_UNSAFE_CASTING")
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_cpu_features.py b/venv/Lib/site-packages/numpy/core/tests/test_cpu_features.py
new file mode 100644
index 000000000..bafa5a05f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_cpu_features.py
@@ -0,0 +1,171 @@
+import sys, platform, re, pytest
+from numpy.core._multiarray_umath import __cpu_features__
+
+def assert_features_equal(actual, desired, fname):
+    __tracebackhide__ = True  # Hide traceback for py.test
+    actual, desired = str(actual), str(desired)
+    if actual == desired:
+        return
+    detected = str(__cpu_features__).replace("'", "")
+    try:
+        with open("/proc/cpuinfo", "r") as fd:
+            cpuinfo = fd.read(2048)
+    except Exception as err:
+        cpuinfo = str(err)
+
+    try:
+        import subprocess
+        auxv = subprocess.check_output(['/bin/true'], env=dict(LD_SHOW_AUXV="1"))
+        auxv = auxv.decode()
+    except Exception as err:
+        auxv = str(err)
+
+    import textwrap
+    error_report = textwrap.indent(
+"""
+###########################################
+### Extra debugging information
+###########################################
+-------------------------------------------
+--- NumPy Detections
+-------------------------------------------
+%s
+-------------------------------------------
+--- SYS / CPUINFO
+-------------------------------------------
+%s....
+-------------------------------------------
+--- SYS / AUXV
+-------------------------------------------
+%s
+""" % (detected, cpuinfo, auxv), prefix='\r')
+
+    raise AssertionError((
+        "Failure Detection\n"
+        " NAME: '%s'\n"
+        " ACTUAL: %s\n"
+        " DESIRED: %s\n"
+        "%s"
+    ) % (fname, actual, desired, error_report))
+
+class AbstractTest(object):
+    features = []
+    features_groups = {}
+    features_map = {}
+    features_flags = set()
+
+    def load_flags(self):
+        # a hook
+        pass
+    def test_features(self):
+        self.load_flags()
+        for gname, features in self.features_groups.items():
+            test_features = [self.cpu_have(f) for f in features]
+            assert_features_equal(__cpu_features__.get(gname), all(test_features), gname)
+
+        for feature_name in self.features:
+            cpu_have = self.cpu_have(feature_name)
+            npy_have = __cpu_features__.get(feature_name)
+            assert_features_equal(npy_have, cpu_have, feature_name)
+
+    def cpu_have(self, feature_name):
+        map_names = self.features_map.get(feature_name, feature_name)
+        if isinstance(map_names, str):
+            return map_names in self.features_flags
+        for f in map_names:
+            if f in self.features_flags:
+                return True
+        return False
+
+    def load_flags_cpuinfo(self, magic_key):
+        self.features_flags = self.get_cpuinfo_item(magic_key)
+
+    def get_cpuinfo_item(self, magic_key):
+        values = set()
+        with open('/proc/cpuinfo') as fd:
+            for line in fd:
+                if not line.startswith(magic_key):
+                    continue
+                flags_value = [s.strip() for s in line.split(':', 1)]
+                if len(flags_value) == 2:
+                    values = values.union(flags_value[1].upper().split())
+        return values
+
+    def load_flags_auxv(self):
+        import subprocess
+        auxv = subprocess.check_output(['/bin/true'], env=dict(LD_SHOW_AUXV="1"))
+        for at in auxv.split(b'\n'):
+            if not at.startswith(b"AT_HWCAP"):
+                continue
+            hwcap_value = [s.strip() for s in at.split(b':', 1)]
+            if len(hwcap_value) == 2:
+                self.features_flags = self.features_flags.union(
+                    hwcap_value[1].upper().decode().split()
+                )
+
+is_linux = sys.platform.startswith('linux')
+machine  = platform.machine()
+is_x86   = re.match("^(amd64|x86|i386|i686)", machine, re.IGNORECASE)
+@pytest.mark.skipif(not is_linux or not is_x86, reason="Only for Linux and x86")
+class Test_X86_Features(AbstractTest):
+    features = [
+        "MMX", "SSE", "SSE2", "SSE3", "SSSE3", "SSE41", "POPCNT", "SSE42",
+        "AVX", "F16C", "XOP", "FMA4", "FMA3", "AVX2", "AVX512F", "AVX512CD",
+        "AVX512ER", "AVX512PF", "AVX5124FMAPS", "AVX5124VNNIW", "AVX512VPOPCNTDQ",
+        "AVX512VL", "AVX512BW", "AVX512DQ", "AVX512VNNI", "AVX512IFMA",
+        "AVX512VBMI", "AVX512VBMI2", "AVX512BITALG",
+    ]
+    features_groups = dict(
+        AVX512_KNL = ["AVX512F", "AVX512CD", "AVX512ER", "AVX512PF"],
+        AVX512_KNM = ["AVX512F", "AVX512CD", "AVX512ER", "AVX512PF", "AVX5124FMAPS",
+                      "AVX5124VNNIW", "AVX512VPOPCNTDQ"],
+        AVX512_SKX = ["AVX512F", "AVX512CD", "AVX512BW", "AVX512DQ", "AVX512VL"],
+        AVX512_CLX = ["AVX512F", "AVX512CD", "AVX512BW", "AVX512DQ", "AVX512VL", "AVX512VNNI"],
+        AVX512_CNL = ["AVX512F", "AVX512CD", "AVX512BW", "AVX512DQ", "AVX512VL", "AVX512IFMA",
+                      "AVX512VBMI"],
+        AVX512_ICL = ["AVX512F", "AVX512CD", "AVX512BW", "AVX512DQ", "AVX512VL", "AVX512IFMA",
+                      "AVX512VBMI", "AVX512VNNI", "AVX512VBMI2", "AVX512BITALG", "AVX512VPOPCNTDQ"],
+    )
+    features_map = dict(
+        SSE3="PNI", SSE41="SSE4_1", SSE42="SSE4_2", FMA3="FMA",
+        AVX512VNNI="AVX512_VNNI", AVX512BITALG="AVX512_BITALG", AVX512VBMI2="AVX512_VBMI2",
+        AVX5124FMAPS="AVX512_4FMAPS", AVX5124VNNIW="AVX512_4VNNIW", AVX512VPOPCNTDQ="AVX512_VPOPCNTDQ",
+    )
+    def load_flags(self):
+        self.load_flags_cpuinfo("flags")
+
+is_power = re.match("^(powerpc|ppc)64", machine, re.IGNORECASE)
+@pytest.mark.skipif(not is_linux or not is_power, reason="Only for Linux and Power")
+class Test_POWER_Features(AbstractTest):
+    features = ["VSX", "VSX2", "VSX3"]
+    features_map = dict(VSX2="ARCH_2_07", VSX3="ARCH_3_00")
+
+    def load_flags(self):
+        self.load_flags_auxv()
+
+is_arm = re.match("^(arm|aarch64)", machine, re.IGNORECASE)
+@pytest.mark.skipif(not is_linux or not is_arm, reason="Only for Linux and ARM")
+class Test_ARM_Features(AbstractTest):
+    features = [
+        "NEON", "ASIMD", "FPHP", "ASIMDHP", "ASIMDDP", "ASIMDFHM"
+    ]
+    features_groups = dict(
+        NEON_FP16  = ["NEON", "HALF"],
+        NEON_VFPV4 = ["NEON", "VFPV4"],
+    )
+    def load_flags(self):
+        self.load_flags_cpuinfo("Features")
+        arch = self.get_cpuinfo_item("CPU architecture")
+        # in case of mounting virtual filesystem of aarch64 kernel
+        is_rootfs_v8 = int('0'+next(iter(arch))) > 7 if arch else 0
+        if  re.match("^(aarch64|AARCH64)", machine) or is_rootfs_v8:
+            self.features_map = dict(
+                NEON="ASIMD", HALF="ASIMD", VFPV4="ASIMD"
+            )
+        else:
+            self.features_map = dict(
+                # ELF auxiliary vector and /proc/cpuinfo on Linux kernel(armv8 aarch32)
+                # doesn't provide information about ASIMD, so we assume that ASIMD is supported
+                # if the kernel reports any one of the following ARM8 features.
+                ASIMD=("AES", "SHA1", "SHA2", "PMULL", "CRC32")
+            )
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_datetime.py b/venv/Lib/site-packages/numpy/core/tests/test_datetime.py
new file mode 100644
index 000000000..438d52f97
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_datetime.py
@@ -0,0 +1,2373 @@
+
+import numpy
+import numpy as np
+import datetime
+import pytest
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_warns, suppress_warnings,
+    assert_raises_regex,
+    )
+from numpy.compat import pickle
+
+# Use pytz to test out various time zones if available
+try:
+    from pytz import timezone as tz
+    _has_pytz = True
+except ImportError:
+    _has_pytz = False
+
+try:
+    RecursionError
+except NameError:
+    RecursionError = RuntimeError  # python < 3.5
+
+
+class TestDateTime:
+    def test_datetime_dtype_creation(self):
+        for unit in ['Y', 'M', 'W', 'D',
+                     'h', 'm', 's', 'ms', 'us',
+                     'ns', 'ps', 'fs', 'as']:
+            dt1 = np.dtype('M8[750%s]' % unit)
+            assert_(dt1 == np.dtype('datetime64[750%s]' % unit))
+            dt2 = np.dtype('m8[%s]' % unit)
+            assert_(dt2 == np.dtype('timedelta64[%s]' % unit))
+
+        # Generic units shouldn't add [] to the end
+        assert_equal(str(np.dtype("M8")), "datetime64")
+
+        # Should be possible to specify the endianness
+        assert_equal(np.dtype("=M8"), np.dtype("M8"))
+        assert_equal(np.dtype("=M8[s]"), np.dtype("M8[s]"))
+        assert_(np.dtype(">M8") == np.dtype("M8") or
+                np.dtype("<M8") == np.dtype("M8"))
+        assert_(np.dtype(">M8[D]") == np.dtype("M8[D]") or
+                np.dtype("<M8[D]") == np.dtype("M8[D]"))
+        assert_(np.dtype(">M8") != np.dtype("<M8"))
+
+        assert_equal(np.dtype("=m8"), np.dtype("m8"))
+        assert_equal(np.dtype("=m8[s]"), np.dtype("m8[s]"))
+        assert_(np.dtype(">m8") == np.dtype("m8") or
+                np.dtype("<m8") == np.dtype("m8"))
+        assert_(np.dtype(">m8[D]") == np.dtype("m8[D]") or
+                np.dtype("<m8[D]") == np.dtype("m8[D]"))
+        assert_(np.dtype(">m8") != np.dtype("<m8"))
+
+        # Check that the parser rejects bad datetime types
+        assert_raises(TypeError, np.dtype, 'M8[badunit]')
+        assert_raises(TypeError, np.dtype, 'm8[badunit]')
+        assert_raises(TypeError, np.dtype, 'M8[YY]')
+        assert_raises(TypeError, np.dtype, 'm8[YY]')
+        assert_raises(TypeError, np.dtype, 'm4')
+        assert_raises(TypeError, np.dtype, 'M7')
+        assert_raises(TypeError, np.dtype, 'm7')
+        assert_raises(TypeError, np.dtype, 'M16')
+        assert_raises(TypeError, np.dtype, 'm16')
+
+    def test_datetime_casting_rules(self):
+        # Cannot cast safely/same_kind between timedelta and datetime
+        assert_(not np.can_cast('m8', 'M8', casting='same_kind'))
+        assert_(not np.can_cast('M8', 'm8', casting='same_kind'))
+        assert_(not np.can_cast('m8', 'M8', casting='safe'))
+        assert_(not np.can_cast('M8', 'm8', casting='safe'))
+
+        # Can cast safely/same_kind from integer to timedelta
+        assert_(np.can_cast('i8', 'm8', casting='same_kind'))
+        assert_(np.can_cast('i8', 'm8', casting='safe'))
+        assert_(np.can_cast('i4', 'm8', casting='same_kind'))
+        assert_(np.can_cast('i4', 'm8', casting='safe'))
+        assert_(np.can_cast('u4', 'm8', casting='same_kind'))
+        assert_(np.can_cast('u4', 'm8', casting='safe'))
+
+        # Cannot cast safely from unsigned integer of the same size, which
+        # could overflow
+        assert_(np.can_cast('u8', 'm8', casting='same_kind'))
+        assert_(not np.can_cast('u8', 'm8', casting='safe'))
+
+        # Cannot cast safely/same_kind from float to timedelta
+        assert_(not np.can_cast('f4', 'm8', casting='same_kind'))
+        assert_(not np.can_cast('f4', 'm8', casting='safe'))
+
+        # Cannot cast safely/same_kind from integer to datetime
+        assert_(not np.can_cast('i8', 'M8', casting='same_kind'))
+        assert_(not np.can_cast('i8', 'M8', casting='safe'))
+
+        # Cannot cast safely/same_kind from bool to datetime
+        assert_(not np.can_cast('b1', 'M8', casting='same_kind'))
+        assert_(not np.can_cast('b1', 'M8', casting='safe'))
+        # Can cast safely/same_kind from bool to timedelta
+        assert_(np.can_cast('b1', 'm8', casting='same_kind'))
+        assert_(np.can_cast('b1', 'm8', casting='safe'))
+
+        # Can cast datetime safely from months/years to days
+        assert_(np.can_cast('M8[M]', 'M8[D]', casting='safe'))
+        assert_(np.can_cast('M8[Y]', 'M8[D]', casting='safe'))
+        # Cannot cast timedelta safely from months/years to days
+        assert_(not np.can_cast('m8[M]', 'm8[D]', casting='safe'))
+        assert_(not np.can_cast('m8[Y]', 'm8[D]', casting='safe'))
+        # Can cast datetime same_kind from months/years to days
+        assert_(np.can_cast('M8[M]', 'M8[D]', casting='same_kind'))
+        assert_(np.can_cast('M8[Y]', 'M8[D]', casting='same_kind'))
+        # Can't cast timedelta same_kind from months/years to days
+        assert_(not np.can_cast('m8[M]', 'm8[D]', casting='same_kind'))
+        assert_(not np.can_cast('m8[Y]', 'm8[D]', casting='same_kind'))
+        # Can cast datetime same_kind across the date/time boundary
+        assert_(np.can_cast('M8[D]', 'M8[h]', casting='same_kind'))
+        # Can cast timedelta same_kind across the date/time boundary
+        assert_(np.can_cast('m8[D]', 'm8[h]', casting='same_kind'))
+        assert_(np.can_cast('m8[h]', 'm8[D]', casting='same_kind'))
+
+        # Cannot cast safely if the integer multiplier doesn't divide
+        assert_(not np.can_cast('M8[7h]', 'M8[3h]', casting='safe'))
+        assert_(not np.can_cast('M8[3h]', 'M8[6h]', casting='safe'))
+        # But can cast same_kind
+        assert_(np.can_cast('M8[7h]', 'M8[3h]', casting='same_kind'))
+        # Can cast safely if the integer multiplier does divide
+        assert_(np.can_cast('M8[6h]', 'M8[3h]', casting='safe'))
+
+        # We can always cast types with generic units (corresponding to NaT) to
+        # more specific types
+        assert_(np.can_cast('m8', 'm8[h]', casting='same_kind'))
+        assert_(np.can_cast('m8', 'm8[h]', casting='safe'))
+        assert_(np.can_cast('M8', 'M8[h]', casting='same_kind'))
+        assert_(np.can_cast('M8', 'M8[h]', casting='safe'))
+        # but not the other way around
+        assert_(not np.can_cast('m8[h]', 'm8', casting='same_kind'))
+        assert_(not np.can_cast('m8[h]', 'm8', casting='safe'))
+        assert_(not np.can_cast('M8[h]', 'M8', casting='same_kind'))
+        assert_(not np.can_cast('M8[h]', 'M8', casting='safe'))
+
+    def test_compare_generic_nat(self):
+        # regression tests for gh-6452
+        assert_(np.datetime64('NaT') !=
+                np.datetime64('2000') + np.timedelta64('NaT'))
+        assert_(np.datetime64('NaT') != np.datetime64('NaT', 'us'))
+        assert_(np.datetime64('NaT', 'us') != np.datetime64('NaT'))
+
+    @pytest.mark.parametrize("size", [
+        3, 21, 217, 1000])
+    def test_datetime_nat_argsort_stability(self, size):
+        # NaT < NaT should be False internally for
+        # sort stability
+        expected = np.arange(size)
+        arr = np.tile(np.datetime64('NaT'), size)
+        assert_equal(np.argsort(arr, kind='mergesort'), expected)
+    
+    @pytest.mark.parametrize("size", [
+        3, 21, 217, 1000])
+    def test_timedelta_nat_argsort_stability(self, size):
+        # NaT < NaT should be False internally for
+        # sort stability
+        expected = np.arange(size)
+        arr = np.tile(np.timedelta64('NaT'), size)
+        assert_equal(np.argsort(arr, kind='mergesort'), expected)
+
+    @pytest.mark.parametrize("arr, expected", [
+        # the example provided in gh-12629
+        (['NaT', 1, 2, 3],
+         [1, 2, 3, 'NaT']),
+        # multiple NaTs
+        (['NaT', 9, 'NaT', -707],
+         [-707, 9, 'NaT', 'NaT']),
+        # this sort explores another code path for NaT
+        ([1, -2, 3, 'NaT'],
+         [-2, 1, 3, 'NaT']),
+        # 2-D array
+        ([[51, -220, 'NaT'],
+          [-17, 'NaT', -90]],
+         [[-220, 51, 'NaT'],
+          [-90, -17, 'NaT']]),
+        ])
+    @pytest.mark.parametrize("dtype", [
+        'M8[ns]', 'M8[us]',
+        'm8[ns]', 'm8[us]'])
+    def test_datetime_timedelta_sort_nat(self, arr, expected, dtype):
+        # fix for gh-12629 and gh-15063; NaT sorting to end of array
+        arr = np.array(arr, dtype=dtype)
+        expected = np.array(expected, dtype=dtype)
+        arr.sort()
+        assert_equal(arr, expected)
+
+    def test_datetime_scalar_construction(self):
+        # Construct with different units
+        assert_equal(np.datetime64('1950-03-12', 'D'),
+                     np.datetime64('1950-03-12'))
+        assert_equal(np.datetime64('1950-03-12T13', 's'),
+                     np.datetime64('1950-03-12T13', 'm'))
+
+        # Default construction means NaT
+        assert_equal(np.datetime64(), np.datetime64('NaT'))
+
+        # Some basic strings and repr
+        assert_equal(str(np.datetime64('NaT')), 'NaT')
+        assert_equal(repr(np.datetime64('NaT')),
+                     "numpy.datetime64('NaT')")
+        assert_equal(str(np.datetime64('2011-02')), '2011-02')
+        assert_equal(repr(np.datetime64('2011-02')),
+                     "numpy.datetime64('2011-02')")
+
+        # None gets constructed as NaT
+        assert_equal(np.datetime64(None), np.datetime64('NaT'))
+
+        # Default construction of NaT is in generic units
+        assert_equal(np.datetime64().dtype, np.dtype('M8'))
+        assert_equal(np.datetime64('NaT').dtype, np.dtype('M8'))
+
+        # Construction from integers requires a specified unit
+        assert_raises(ValueError, np.datetime64, 17)
+
+        # When constructing from a scalar or zero-dimensional array,
+        # it either keeps the units or you can override them.
+        a = np.datetime64('2000-03-18T16', 'h')
+        b = np.array('2000-03-18T16', dtype='M8[h]')
+
+        assert_equal(a.dtype, np.dtype('M8[h]'))
+        assert_equal(b.dtype, np.dtype('M8[h]'))
+
+        assert_equal(np.datetime64(a), a)
+        assert_equal(np.datetime64(a).dtype, np.dtype('M8[h]'))
+
+        assert_equal(np.datetime64(b), a)
+        assert_equal(np.datetime64(b).dtype, np.dtype('M8[h]'))
+
+        assert_equal(np.datetime64(a, 's'), a)
+        assert_equal(np.datetime64(a, 's').dtype, np.dtype('M8[s]'))
+
+        assert_equal(np.datetime64(b, 's'), a)
+        assert_equal(np.datetime64(b, 's').dtype, np.dtype('M8[s]'))
+
+        # Construction from datetime.date
+        assert_equal(np.datetime64('1945-03-25'),
+                     np.datetime64(datetime.date(1945, 3, 25)))
+        assert_equal(np.datetime64('2045-03-25', 'D'),
+                     np.datetime64(datetime.date(2045, 3, 25), 'D'))
+        # Construction from datetime.datetime
+        assert_equal(np.datetime64('1980-01-25T14:36:22.5'),
+                     np.datetime64(datetime.datetime(1980, 1, 25,
+                                                14, 36, 22, 500000)))
+
+        # Construction with time units from a date is okay
+        assert_equal(np.datetime64('1920-03-13', 'h'),
+                     np.datetime64('1920-03-13T00'))
+        assert_equal(np.datetime64('1920-03', 'm'),
+                     np.datetime64('1920-03-01T00:00'))
+        assert_equal(np.datetime64('1920', 's'),
+                     np.datetime64('1920-01-01T00:00:00'))
+        assert_equal(np.datetime64(datetime.date(2045, 3, 25), 'ms'),
+                     np.datetime64('2045-03-25T00:00:00.000'))
+
+        # Construction with date units from a datetime is also okay
+        assert_equal(np.datetime64('1920-03-13T18', 'D'),
+                     np.datetime64('1920-03-13'))
+        assert_equal(np.datetime64('1920-03-13T18:33:12', 'M'),
+                     np.datetime64('1920-03'))
+        assert_equal(np.datetime64('1920-03-13T18:33:12.5', 'Y'),
+                     np.datetime64('1920'))
+
+    def test_datetime_scalar_construction_timezone(self):
+        # verify that supplying an explicit timezone works, but is deprecated
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.datetime64('2000-01-01T00Z'),
+                         np.datetime64('2000-01-01T00'))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.datetime64('2000-01-01T00-08'),
+                         np.datetime64('2000-01-01T08'))
+
+    def test_datetime_array_find_type(self):
+        dt = np.datetime64('1970-01-01', 'M')
+        arr = np.array([dt])
+        assert_equal(arr.dtype, np.dtype('M8[M]'))
+
+        # at the moment, we don't automatically convert these to datetime64
+
+        dt = datetime.date(1970, 1, 1)
+        arr = np.array([dt])
+        assert_equal(arr.dtype, np.dtype('O'))
+
+        dt = datetime.datetime(1970, 1, 1, 12, 30, 40)
+        arr = np.array([dt])
+        assert_equal(arr.dtype, np.dtype('O'))
+
+        # find "supertype" for non-dates and dates
+
+        b = np.bool_(True)
+        dm = np.datetime64('1970-01-01', 'M')
+        d = datetime.date(1970, 1, 1)
+        dt = datetime.datetime(1970, 1, 1, 12, 30, 40)
+
+        arr = np.array([b, dm])
+        assert_equal(arr.dtype, np.dtype('O'))
+
+        arr = np.array([b, d])
+        assert_equal(arr.dtype, np.dtype('O'))
+
+        arr = np.array([b, dt])
+        assert_equal(arr.dtype, np.dtype('O'))
+
+        arr = np.array([d, d]).astype('datetime64')
+        assert_equal(arr.dtype, np.dtype('M8[D]'))
+
+        arr = np.array([dt, dt]).astype('datetime64')
+        assert_equal(arr.dtype, np.dtype('M8[us]'))
+
+    @pytest.mark.parametrize("unit", [
+    # test all date / time units and use
+    # "generic" to select generic unit
+    ("Y"), ("M"), ("W"), ("D"), ("h"), ("m"),
+    ("s"), ("ms"), ("us"), ("ns"), ("ps"),
+    ("fs"), ("as"), ("generic") ])
+    def test_timedelta_np_int_construction(self, unit):
+        # regression test for gh-7617
+        if unit != "generic":
+            assert_equal(np.timedelta64(np.int64(123), unit),
+                         np.timedelta64(123, unit))
+        else:
+            assert_equal(np.timedelta64(np.int64(123)),
+                         np.timedelta64(123))
+
+    def test_timedelta_scalar_construction(self):
+        # Construct with different units
+        assert_equal(np.timedelta64(7, 'D'),
+                     np.timedelta64(1, 'W'))
+        assert_equal(np.timedelta64(120, 's'),
+                     np.timedelta64(2, 'm'))
+
+        # Default construction means 0
+        assert_equal(np.timedelta64(), np.timedelta64(0))
+
+        # None gets constructed as NaT
+        assert_equal(np.timedelta64(None), np.timedelta64('NaT'))
+
+        # Some basic strings and repr
+        assert_equal(str(np.timedelta64('NaT')), 'NaT')
+        assert_equal(repr(np.timedelta64('NaT')),
+                     "numpy.timedelta64('NaT')")
+        assert_equal(str(np.timedelta64(3, 's')), '3 seconds')
+        assert_equal(repr(np.timedelta64(-3, 's')),
+                     "numpy.timedelta64(-3,'s')")
+        assert_equal(repr(np.timedelta64(12)),
+                     "numpy.timedelta64(12)")
+
+        # Construction from an integer produces generic units
+        assert_equal(np.timedelta64(12).dtype, np.dtype('m8'))
+
+        # When constructing from a scalar or zero-dimensional array,
+        # it either keeps the units or you can override them.
+        a = np.timedelta64(2, 'h')
+        b = np.array(2, dtype='m8[h]')
+
+        assert_equal(a.dtype, np.dtype('m8[h]'))
+        assert_equal(b.dtype, np.dtype('m8[h]'))
+
+        assert_equal(np.timedelta64(a), a)
+        assert_equal(np.timedelta64(a).dtype, np.dtype('m8[h]'))
+
+        assert_equal(np.timedelta64(b), a)
+        assert_equal(np.timedelta64(b).dtype, np.dtype('m8[h]'))
+
+        assert_equal(np.timedelta64(a, 's'), a)
+        assert_equal(np.timedelta64(a, 's').dtype, np.dtype('m8[s]'))
+
+        assert_equal(np.timedelta64(b, 's'), a)
+        assert_equal(np.timedelta64(b, 's').dtype, np.dtype('m8[s]'))
+
+        # Construction from datetime.timedelta
+        assert_equal(np.timedelta64(5, 'D'),
+                     np.timedelta64(datetime.timedelta(days=5)))
+        assert_equal(np.timedelta64(102347621, 's'),
+                     np.timedelta64(datetime.timedelta(seconds=102347621)))
+        assert_equal(np.timedelta64(-10234760000, 'us'),
+                     np.timedelta64(datetime.timedelta(
+                                            microseconds=-10234760000)))
+        assert_equal(np.timedelta64(10234760000, 'us'),
+                     np.timedelta64(datetime.timedelta(
+                                            microseconds=10234760000)))
+        assert_equal(np.timedelta64(1023476, 'ms'),
+                     np.timedelta64(datetime.timedelta(milliseconds=1023476)))
+        assert_equal(np.timedelta64(10, 'm'),
+                     np.timedelta64(datetime.timedelta(minutes=10)))
+        assert_equal(np.timedelta64(281, 'h'),
+                     np.timedelta64(datetime.timedelta(hours=281)))
+        assert_equal(np.timedelta64(28, 'W'),
+                     np.timedelta64(datetime.timedelta(weeks=28)))
+
+        # Cannot construct across nonlinear time unit boundaries
+        a = np.timedelta64(3, 's')
+        assert_raises(TypeError, np.timedelta64, a, 'M')
+        assert_raises(TypeError, np.timedelta64, a, 'Y')
+        a = np.timedelta64(6, 'M')
+        assert_raises(TypeError, np.timedelta64, a, 'D')
+        assert_raises(TypeError, np.timedelta64, a, 'h')
+        a = np.timedelta64(1, 'Y')
+        assert_raises(TypeError, np.timedelta64, a, 'D')
+        assert_raises(TypeError, np.timedelta64, a, 'm')
+        a = datetime.timedelta(seconds=3)
+        assert_raises(TypeError, np.timedelta64, a, 'M')
+        assert_raises(TypeError, np.timedelta64, a, 'Y')
+        a = datetime.timedelta(weeks=3)
+        assert_raises(TypeError, np.timedelta64, a, 'M')
+        assert_raises(TypeError, np.timedelta64, a, 'Y')
+        a = datetime.timedelta()
+        assert_raises(TypeError, np.timedelta64, a, 'M')
+        assert_raises(TypeError, np.timedelta64, a, 'Y')
+
+    def test_timedelta_object_array_conversion(self):
+        # Regression test for gh-11096
+        inputs = [datetime.timedelta(28),
+                  datetime.timedelta(30),
+                  datetime.timedelta(31)]
+        expected = np.array([28, 30, 31], dtype='timedelta64[D]')
+        actual = np.array(inputs, dtype='timedelta64[D]')
+        assert_equal(expected, actual)
+
+    def test_timedelta_0_dim_object_array_conversion(self):
+        # Regression test for gh-11151
+        test = np.array(datetime.timedelta(seconds=20))
+        actual = test.astype(np.timedelta64)
+        # expected value from the array constructor workaround
+        # described in above issue
+        expected = np.array(datetime.timedelta(seconds=20),
+                            np.timedelta64)
+        assert_equal(actual, expected)
+
+    def test_timedelta_scalar_construction_units(self):
+        # String construction detecting units
+        assert_equal(np.datetime64('2010').dtype,
+                     np.dtype('M8[Y]'))
+        assert_equal(np.datetime64('2010-03').dtype,
+                     np.dtype('M8[M]'))
+        assert_equal(np.datetime64('2010-03-12').dtype,
+                     np.dtype('M8[D]'))
+        assert_equal(np.datetime64('2010-03-12T17').dtype,
+                     np.dtype('M8[h]'))
+        assert_equal(np.datetime64('2010-03-12T17:15').dtype,
+                     np.dtype('M8[m]'))
+        assert_equal(np.datetime64('2010-03-12T17:15:08').dtype,
+                     np.dtype('M8[s]'))
+
+        assert_equal(np.datetime64('2010-03-12T17:15:08.1').dtype,
+                     np.dtype('M8[ms]'))
+        assert_equal(np.datetime64('2010-03-12T17:15:08.12').dtype,
+                     np.dtype('M8[ms]'))
+        assert_equal(np.datetime64('2010-03-12T17:15:08.123').dtype,
+                     np.dtype('M8[ms]'))
+
+        assert_equal(np.datetime64('2010-03-12T17:15:08.1234').dtype,
+                     np.dtype('M8[us]'))
+        assert_equal(np.datetime64('2010-03-12T17:15:08.12345').dtype,
+                     np.dtype('M8[us]'))
+        assert_equal(np.datetime64('2010-03-12T17:15:08.123456').dtype,
+                     np.dtype('M8[us]'))
+
+        assert_equal(np.datetime64('1970-01-01T00:00:02.1234567').dtype,
+                     np.dtype('M8[ns]'))
+        assert_equal(np.datetime64('1970-01-01T00:00:02.12345678').dtype,
+                     np.dtype('M8[ns]'))
+        assert_equal(np.datetime64('1970-01-01T00:00:02.123456789').dtype,
+                     np.dtype('M8[ns]'))
+
+        assert_equal(np.datetime64('1970-01-01T00:00:02.1234567890').dtype,
+                     np.dtype('M8[ps]'))
+        assert_equal(np.datetime64('1970-01-01T00:00:02.12345678901').dtype,
+                     np.dtype('M8[ps]'))
+        assert_equal(np.datetime64('1970-01-01T00:00:02.123456789012').dtype,
+                     np.dtype('M8[ps]'))
+
+        assert_equal(np.datetime64(
+                     '1970-01-01T00:00:02.1234567890123').dtype,
+                     np.dtype('M8[fs]'))
+        assert_equal(np.datetime64(
+                     '1970-01-01T00:00:02.12345678901234').dtype,
+                     np.dtype('M8[fs]'))
+        assert_equal(np.datetime64(
+                     '1970-01-01T00:00:02.123456789012345').dtype,
+                     np.dtype('M8[fs]'))
+
+        assert_equal(np.datetime64(
+                    '1970-01-01T00:00:02.1234567890123456').dtype,
+                     np.dtype('M8[as]'))
+        assert_equal(np.datetime64(
+                    '1970-01-01T00:00:02.12345678901234567').dtype,
+                     np.dtype('M8[as]'))
+        assert_equal(np.datetime64(
+                    '1970-01-01T00:00:02.123456789012345678').dtype,
+                     np.dtype('M8[as]'))
+
+        # Python date object
+        assert_equal(np.datetime64(datetime.date(2010, 4, 16)).dtype,
+                     np.dtype('M8[D]'))
+
+        # Python datetime object
+        assert_equal(np.datetime64(
+                        datetime.datetime(2010, 4, 16, 13, 45, 18)).dtype,
+                     np.dtype('M8[us]'))
+
+        # 'today' special value
+        assert_equal(np.datetime64('today').dtype,
+                     np.dtype('M8[D]'))
+
+        # 'now' special value
+        assert_equal(np.datetime64('now').dtype,
+                     np.dtype('M8[s]'))
+
+    def test_datetime_nat_casting(self):
+        a = np.array('NaT', dtype='M8[D]')
+        b = np.datetime64('NaT', '[D]')
+
+        # Arrays
+        assert_equal(a.astype('M8[s]'), np.array('NaT', dtype='M8[s]'))
+        assert_equal(a.astype('M8[ms]'), np.array('NaT', dtype='M8[ms]'))
+        assert_equal(a.astype('M8[M]'), np.array('NaT', dtype='M8[M]'))
+        assert_equal(a.astype('M8[Y]'), np.array('NaT', dtype='M8[Y]'))
+        assert_equal(a.astype('M8[W]'), np.array('NaT', dtype='M8[W]'))
+
+        # Scalars -> Scalars
+        assert_equal(np.datetime64(b, '[s]'), np.datetime64('NaT', '[s]'))
+        assert_equal(np.datetime64(b, '[ms]'), np.datetime64('NaT', '[ms]'))
+        assert_equal(np.datetime64(b, '[M]'), np.datetime64('NaT', '[M]'))
+        assert_equal(np.datetime64(b, '[Y]'), np.datetime64('NaT', '[Y]'))
+        assert_equal(np.datetime64(b, '[W]'), np.datetime64('NaT', '[W]'))
+
+        # Arrays -> Scalars
+        assert_equal(np.datetime64(a, '[s]'), np.datetime64('NaT', '[s]'))
+        assert_equal(np.datetime64(a, '[ms]'), np.datetime64('NaT', '[ms]'))
+        assert_equal(np.datetime64(a, '[M]'), np.datetime64('NaT', '[M]'))
+        assert_equal(np.datetime64(a, '[Y]'), np.datetime64('NaT', '[Y]'))
+        assert_equal(np.datetime64(a, '[W]'), np.datetime64('NaT', '[W]'))
+
+        # NaN -> NaT
+        nan = np.array([np.nan] * 8)
+        fnan = nan.astype('f')
+        lnan = nan.astype('g')
+        cnan = nan.astype('D')
+        cfnan = nan.astype('F')
+        clnan = nan.astype('G')
+
+        nat = np.array([np.datetime64('NaT')] * 8)
+        assert_equal(nan.astype('M8[ns]'), nat)
+        assert_equal(fnan.astype('M8[ns]'), nat)
+        assert_equal(lnan.astype('M8[ns]'), nat)
+        assert_equal(cnan.astype('M8[ns]'), nat)
+        assert_equal(cfnan.astype('M8[ns]'), nat)
+        assert_equal(clnan.astype('M8[ns]'), nat)
+
+        nat = np.array([np.timedelta64('NaT')] * 8)
+        assert_equal(nan.astype('timedelta64[ns]'), nat)
+        assert_equal(fnan.astype('timedelta64[ns]'), nat)
+        assert_equal(lnan.astype('timedelta64[ns]'), nat)
+        assert_equal(cnan.astype('timedelta64[ns]'), nat)
+        assert_equal(cfnan.astype('timedelta64[ns]'), nat)
+        assert_equal(clnan.astype('timedelta64[ns]'), nat)
+
+    def test_days_creation(self):
+        assert_equal(np.array('1599', dtype='M8[D]').astype('i8'),
+                (1600-1970)*365 - (1972-1600)/4 + 3 - 365)
+        assert_equal(np.array('1600', dtype='M8[D]').astype('i8'),
+                (1600-1970)*365 - (1972-1600)/4 + 3)
+        assert_equal(np.array('1601', dtype='M8[D]').astype('i8'),
+                (1600-1970)*365 - (1972-1600)/4 + 3 + 366)
+        assert_equal(np.array('1900', dtype='M8[D]').astype('i8'),
+                (1900-1970)*365 - (1970-1900)//4)
+        assert_equal(np.array('1901', dtype='M8[D]').astype('i8'),
+                (1900-1970)*365 - (1970-1900)//4 + 365)
+        assert_equal(np.array('1967', dtype='M8[D]').astype('i8'), -3*365 - 1)
+        assert_equal(np.array('1968', dtype='M8[D]').astype('i8'), -2*365 - 1)
+        assert_equal(np.array('1969', dtype='M8[D]').astype('i8'), -1*365)
+        assert_equal(np.array('1970', dtype='M8[D]').astype('i8'), 0*365)
+        assert_equal(np.array('1971', dtype='M8[D]').astype('i8'), 1*365)
+        assert_equal(np.array('1972', dtype='M8[D]').astype('i8'), 2*365)
+        assert_equal(np.array('1973', dtype='M8[D]').astype('i8'), 3*365 + 1)
+        assert_equal(np.array('1974', dtype='M8[D]').astype('i8'), 4*365 + 1)
+        assert_equal(np.array('2000', dtype='M8[D]').astype('i8'),
+                 (2000 - 1970)*365 + (2000 - 1972)//4)
+        assert_equal(np.array('2001', dtype='M8[D]').astype('i8'),
+                 (2000 - 1970)*365 + (2000 - 1972)//4 + 366)
+        assert_equal(np.array('2400', dtype='M8[D]').astype('i8'),
+                 (2400 - 1970)*365 + (2400 - 1972)//4 - 3)
+        assert_equal(np.array('2401', dtype='M8[D]').astype('i8'),
+                 (2400 - 1970)*365 + (2400 - 1972)//4 - 3 + 366)
+
+        assert_equal(np.array('1600-02-29', dtype='M8[D]').astype('i8'),
+                (1600-1970)*365 - (1972-1600)//4 + 3 + 31 + 28)
+        assert_equal(np.array('1600-03-01', dtype='M8[D]').astype('i8'),
+                (1600-1970)*365 - (1972-1600)//4 + 3 + 31 + 29)
+        assert_equal(np.array('2000-02-29', dtype='M8[D]').astype('i8'),
+                 (2000 - 1970)*365 + (2000 - 1972)//4 + 31 + 28)
+        assert_equal(np.array('2000-03-01', dtype='M8[D]').astype('i8'),
+                 (2000 - 1970)*365 + (2000 - 1972)//4 + 31 + 29)
+        assert_equal(np.array('2001-03-22', dtype='M8[D]').astype('i8'),
+                 (2000 - 1970)*365 + (2000 - 1972)//4 + 366 + 31 + 28 + 21)
+
+    def test_days_to_pydate(self):
+        assert_equal(np.array('1599', dtype='M8[D]').astype('O'),
+                    datetime.date(1599, 1, 1))
+        assert_equal(np.array('1600', dtype='M8[D]').astype('O'),
+                    datetime.date(1600, 1, 1))
+        assert_equal(np.array('1601', dtype='M8[D]').astype('O'),
+                    datetime.date(1601, 1, 1))
+        assert_equal(np.array('1900', dtype='M8[D]').astype('O'),
+                    datetime.date(1900, 1, 1))
+        assert_equal(np.array('1901', dtype='M8[D]').astype('O'),
+                    datetime.date(1901, 1, 1))
+        assert_equal(np.array('2000', dtype='M8[D]').astype('O'),
+                    datetime.date(2000, 1, 1))
+        assert_equal(np.array('2001', dtype='M8[D]').astype('O'),
+                    datetime.date(2001, 1, 1))
+        assert_equal(np.array('1600-02-29', dtype='M8[D]').astype('O'),
+                    datetime.date(1600, 2, 29))
+        assert_equal(np.array('1600-03-01', dtype='M8[D]').astype('O'),
+                    datetime.date(1600, 3, 1))
+        assert_equal(np.array('2001-03-22', dtype='M8[D]').astype('O'),
+                    datetime.date(2001, 3, 22))
+
+    def test_dtype_comparison(self):
+        assert_(not (np.dtype('M8[us]') == np.dtype('M8[ms]')))
+        assert_(np.dtype('M8[us]') != np.dtype('M8[ms]'))
+        assert_(np.dtype('M8[2D]') != np.dtype('M8[D]'))
+        assert_(np.dtype('M8[D]') != np.dtype('M8[2D]'))
+
+    def test_pydatetime_creation(self):
+        a = np.array(['1960-03-12', datetime.date(1960, 3, 12)], dtype='M8[D]')
+        assert_equal(a[0], a[1])
+        a = np.array(['1999-12-31', datetime.date(1999, 12, 31)], dtype='M8[D]')
+        assert_equal(a[0], a[1])
+        a = np.array(['2000-01-01', datetime.date(2000, 1, 1)], dtype='M8[D]')
+        assert_equal(a[0], a[1])
+        # Will fail if the date changes during the exact right moment
+        a = np.array(['today', datetime.date.today()], dtype='M8[D]')
+        assert_equal(a[0], a[1])
+        # datetime.datetime.now() returns local time, not UTC
+        #a = np.array(['now', datetime.datetime.now()], dtype='M8[s]')
+        #assert_equal(a[0], a[1])
+
+        # we can give a datetime.date time units
+        assert_equal(np.array(datetime.date(1960, 3, 12), dtype='M8[s]'),
+                     np.array(np.datetime64('1960-03-12T00:00:00')))
+
+    def test_datetime_string_conversion(self):
+        a = ['2011-03-16', '1920-01-01', '2013-05-19']
+        str_a = np.array(a, dtype='S')
+        uni_a = np.array(a, dtype='U')
+        dt_a = np.array(a, dtype='M')
+
+        # String to datetime
+        assert_equal(dt_a, str_a.astype('M'))
+        assert_equal(dt_a.dtype, str_a.astype('M').dtype)
+        dt_b = np.empty_like(dt_a)
+        dt_b[...] = str_a
+        assert_equal(dt_a, dt_b)
+
+        # Datetime to string
+        assert_equal(str_a, dt_a.astype('S0'))
+        str_b = np.empty_like(str_a)
+        str_b[...] = dt_a
+        assert_equal(str_a, str_b)
+
+        # Unicode to datetime
+        assert_equal(dt_a, uni_a.astype('M'))
+        assert_equal(dt_a.dtype, uni_a.astype('M').dtype)
+        dt_b = np.empty_like(dt_a)
+        dt_b[...] = uni_a
+        assert_equal(dt_a, dt_b)
+
+        # Datetime to unicode
+        assert_equal(uni_a, dt_a.astype('U'))
+        uni_b = np.empty_like(uni_a)
+        uni_b[...] = dt_a
+        assert_equal(uni_a, uni_b)
+
+        # Datetime to long string - gh-9712
+        assert_equal(str_a, dt_a.astype((np.string_, 128)))
+        str_b = np.empty(str_a.shape, dtype=(np.string_, 128))
+        str_b[...] = dt_a
+        assert_equal(str_a, str_b)
+
+    def test_datetime_array_str(self):
+        a = np.array(['2011-03-16', '1920-01-01', '2013-05-19'], dtype='M')
+        assert_equal(str(a), "['2011-03-16' '1920-01-01' '2013-05-19']")
+
+        a = np.array(['2011-03-16T13:55', '1920-01-01T03:12'], dtype='M')
+        assert_equal(np.array2string(a, separator=', ',
+                    formatter={'datetime': lambda x:
+                            "'%s'" % np.datetime_as_string(x, timezone='UTC')}),
+                     "['2011-03-16T13:55Z', '1920-01-01T03:12Z']")
+
+        # Check that one NaT doesn't corrupt subsequent entries
+        a = np.array(['2010', 'NaT', '2030']).astype('M')
+        assert_equal(str(a), "['2010'  'NaT' '2030']")
+
+    def test_timedelta_array_str(self):
+        a = np.array([-1, 0, 100], dtype='m')
+        assert_equal(str(a), "[ -1   0 100]")
+        a = np.array(['NaT', 'NaT'], dtype='m')
+        assert_equal(str(a), "['NaT' 'NaT']")
+        # Check right-alignment with NaTs
+        a = np.array([-1, 'NaT', 0], dtype='m')
+        assert_equal(str(a), "[   -1 'NaT'     0]")
+        a = np.array([-1, 'NaT', 1234567], dtype='m')
+        assert_equal(str(a), "[     -1   'NaT' 1234567]")
+
+        # Test with other byteorder:
+        a = np.array([-1, 'NaT', 1234567], dtype='>m')
+        assert_equal(str(a), "[     -1   'NaT' 1234567]")
+        a = np.array([-1, 'NaT', 1234567], dtype='<m')
+        assert_equal(str(a), "[     -1   'NaT' 1234567]")
+
+    def test_pickle(self):
+        # Check that pickle roundtripping works
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            dt = np.dtype('M8[7D]')
+            assert_equal(pickle.loads(pickle.dumps(dt, protocol=proto)), dt)
+            dt = np.dtype('M8[W]')
+            assert_equal(pickle.loads(pickle.dumps(dt, protocol=proto)), dt)
+            scalar = np.datetime64('2016-01-01T00:00:00.000000000')
+            assert_equal(pickle.loads(pickle.dumps(scalar, protocol=proto)),
+                         scalar)
+            delta = scalar - np.datetime64('2015-01-01T00:00:00.000000000')
+            assert_equal(pickle.loads(pickle.dumps(delta, protocol=proto)),
+                         delta)
+
+        # Check that loading pickles from 1.6 works
+        pkl = b"cnumpy\ndtype\np0\n(S'M8'\np1\nI0\nI1\ntp2\nRp3\n" + \
+              b"(I4\nS'<'\np4\nNNNI-1\nI-1\nI0\n((dp5\n(S'D'\np6\n" + \
+              b"I7\nI1\nI1\ntp7\ntp8\ntp9\nb."
+        assert_equal(pickle.loads(pkl), np.dtype('<M8[7D]'))
+        pkl = b"cnumpy\ndtype\np0\n(S'M8'\np1\nI0\nI1\ntp2\nRp3\n" + \
+              b"(I4\nS'<'\np4\nNNNI-1\nI-1\nI0\n((dp5\n(S'W'\np6\n" + \
+              b"I1\nI1\nI1\ntp7\ntp8\ntp9\nb."
+        assert_equal(pickle.loads(pkl), np.dtype('<M8[W]'))
+        pkl = b"cnumpy\ndtype\np0\n(S'M8'\np1\nI0\nI1\ntp2\nRp3\n" + \
+              b"(I4\nS'>'\np4\nNNNI-1\nI-1\nI0\n((dp5\n(S'us'\np6\n" + \
+              b"I1\nI1\nI1\ntp7\ntp8\ntp9\nb."
+        assert_equal(pickle.loads(pkl), np.dtype('>M8[us]'))
+
+    def test_setstate(self):
+        "Verify that datetime dtype __setstate__ can handle bad arguments"
+        dt = np.dtype('>M8[us]')
+        assert_raises(ValueError, dt.__setstate__, (4, '>', None, None, None, -1, -1, 0, 1))
+        assert_(dt.__reduce__()[2] == np.dtype('>M8[us]').__reduce__()[2])
+        assert_raises(TypeError, dt.__setstate__, (4, '>', None, None, None, -1, -1, 0, ({}, 'xxx')))
+        assert_(dt.__reduce__()[2] == np.dtype('>M8[us]').__reduce__()[2])
+
+    def test_dtype_promotion(self):
+        # datetime <op> datetime computes the metadata gcd
+        # timedelta <op> timedelta computes the metadata gcd
+        for mM in ['m', 'M']:
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[2Y]'), np.dtype(mM+'8[2Y]')),
+                np.dtype(mM+'8[2Y]'))
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[12Y]'), np.dtype(mM+'8[15Y]')),
+                np.dtype(mM+'8[3Y]'))
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[62M]'), np.dtype(mM+'8[24M]')),
+                np.dtype(mM+'8[2M]'))
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[1W]'), np.dtype(mM+'8[2D]')),
+                np.dtype(mM+'8[1D]'))
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[W]'), np.dtype(mM+'8[13s]')),
+                np.dtype(mM+'8[s]'))
+            assert_equal(
+                np.promote_types(np.dtype(mM+'8[13W]'), np.dtype(mM+'8[49s]')),
+                np.dtype(mM+'8[7s]'))
+        # timedelta <op> timedelta raises when there is no reasonable gcd
+        assert_raises(TypeError, np.promote_types,
+                            np.dtype('m8[Y]'), np.dtype('m8[D]'))
+        assert_raises(TypeError, np.promote_types,
+                            np.dtype('m8[M]'), np.dtype('m8[W]'))
+        # timedelta <op> timedelta may overflow with big unit ranges
+        assert_raises(OverflowError, np.promote_types,
+                            np.dtype('m8[W]'), np.dtype('m8[fs]'))
+        assert_raises(OverflowError, np.promote_types,
+                            np.dtype('m8[s]'), np.dtype('m8[as]'))
+
+    def test_cast_overflow(self):
+        # gh-4486
+        def cast():
+            numpy.datetime64("1971-01-01 00:00:00.000000000000000").astype("<M8[D]")
+        assert_raises(OverflowError, cast)
+
+        def cast2():
+            numpy.datetime64("2014").astype("<M8[fs]")
+        assert_raises(OverflowError, cast2)
+
+    def test_pyobject_roundtrip(self):
+        # All datetime types should be able to roundtrip through object
+        a = np.array([0, 0, 0, 0, 0, 0, 0, 0, 0,
+                      -1020040340, -2942398, -1, 0, 1, 234523453, 1199164176],
+                                                        dtype=np.int64)
+        # With date units
+        for unit in ['M8[D]', 'M8[W]', 'M8[M]', 'M8[Y]']:
+            b = a.copy().view(dtype=unit)
+            b[0] = '-0001-01-01'
+            b[1] = '-0001-12-31'
+            b[2] = '0000-01-01'
+            b[3] = '0001-01-01'
+            b[4] = '1969-12-31'
+            b[5] = '1970-01-01'
+            b[6] = '9999-12-31'
+            b[7] = '10000-01-01'
+            b[8] = 'NaT'
+
+            assert_equal(b.astype(object).astype(unit), b,
+                            "Error roundtripping unit %s" % unit)
+        # With time units
+        for unit in ['M8[as]', 'M8[16fs]', 'M8[ps]', 'M8[us]',
+                     'M8[300as]', 'M8[20us]']:
+            b = a.copy().view(dtype=unit)
+            b[0] = '-0001-01-01T00'
+            b[1] = '-0001-12-31T00'
+            b[2] = '0000-01-01T00'
+            b[3] = '0001-01-01T00'
+            b[4] = '1969-12-31T23:59:59.999999'
+            b[5] = '1970-01-01T00'
+            b[6] = '9999-12-31T23:59:59.999999'
+            b[7] = '10000-01-01T00'
+            b[8] = 'NaT'
+
+            assert_equal(b.astype(object).astype(unit), b,
+                            "Error roundtripping unit %s" % unit)
+
+    def test_month_truncation(self):
+        # Make sure that months are truncating correctly
+        assert_equal(np.array('1945-03-01', dtype='M8[M]'),
+                     np.array('1945-03-31', dtype='M8[M]'))
+        assert_equal(np.array('1969-11-01', dtype='M8[M]'),
+             np.array('1969-11-30T23:59:59.99999', dtype='M').astype('M8[M]'))
+        assert_equal(np.array('1969-12-01', dtype='M8[M]'),
+             np.array('1969-12-31T23:59:59.99999', dtype='M').astype('M8[M]'))
+        assert_equal(np.array('1970-01-01', dtype='M8[M]'),
+             np.array('1970-01-31T23:59:59.99999', dtype='M').astype('M8[M]'))
+        assert_equal(np.array('1980-02-01', dtype='M8[M]'),
+             np.array('1980-02-29T23:59:59.99999', dtype='M').astype('M8[M]'))
+
+    def test_different_unit_comparison(self):
+        # Check some years with date units
+        for unit1 in ['Y', 'M', 'D']:
+            dt1 = np.dtype('M8[%s]' % unit1)
+            for unit2 in ['Y', 'M', 'D']:
+                dt2 = np.dtype('M8[%s]' % unit2)
+                assert_equal(np.array('1945', dtype=dt1),
+                             np.array('1945', dtype=dt2))
+                assert_equal(np.array('1970', dtype=dt1),
+                             np.array('1970', dtype=dt2))
+                assert_equal(np.array('9999', dtype=dt1),
+                             np.array('9999', dtype=dt2))
+                assert_equal(np.array('10000', dtype=dt1),
+                             np.array('10000-01-01', dtype=dt2))
+                assert_equal(np.datetime64('1945', unit1),
+                             np.datetime64('1945', unit2))
+                assert_equal(np.datetime64('1970', unit1),
+                             np.datetime64('1970', unit2))
+                assert_equal(np.datetime64('9999', unit1),
+                             np.datetime64('9999', unit2))
+                assert_equal(np.datetime64('10000', unit1),
+                             np.datetime64('10000-01-01', unit2))
+        # Check some datetimes with time units
+        for unit1 in ['6h', 'h', 'm', 's', '10ms', 'ms', 'us']:
+            dt1 = np.dtype('M8[%s]' % unit1)
+            for unit2 in ['h', 'm', 's', 'ms', 'us']:
+                dt2 = np.dtype('M8[%s]' % unit2)
+                assert_equal(np.array('1945-03-12T18', dtype=dt1),
+                             np.array('1945-03-12T18', dtype=dt2))
+                assert_equal(np.array('1970-03-12T18', dtype=dt1),
+                             np.array('1970-03-12T18', dtype=dt2))
+                assert_equal(np.array('9999-03-12T18', dtype=dt1),
+                             np.array('9999-03-12T18', dtype=dt2))
+                assert_equal(np.array('10000-01-01T00', dtype=dt1),
+                             np.array('10000-01-01T00', dtype=dt2))
+                assert_equal(np.datetime64('1945-03-12T18', unit1),
+                             np.datetime64('1945-03-12T18', unit2))
+                assert_equal(np.datetime64('1970-03-12T18', unit1),
+                             np.datetime64('1970-03-12T18', unit2))
+                assert_equal(np.datetime64('9999-03-12T18', unit1),
+                             np.datetime64('9999-03-12T18', unit2))
+                assert_equal(np.datetime64('10000-01-01T00', unit1),
+                             np.datetime64('10000-01-01T00', unit2))
+        # Check some days with units that won't overflow
+        for unit1 in ['D', '12h', 'h', 'm', 's', '4s', 'ms', 'us']:
+            dt1 = np.dtype('M8[%s]' % unit1)
+            for unit2 in ['D', 'h', 'm', 's', 'ms', 'us']:
+                dt2 = np.dtype('M8[%s]' % unit2)
+                assert_(np.equal(np.array('1932-02-17', dtype='M').astype(dt1),
+                     np.array('1932-02-17T00:00:00', dtype='M').astype(dt2),
+                     casting='unsafe'))
+                assert_(np.equal(np.array('10000-04-27', dtype='M').astype(dt1),
+                     np.array('10000-04-27T00:00:00', dtype='M').astype(dt2),
+                     casting='unsafe'))
+
+        # Shouldn't be able to compare datetime and timedelta
+        # TODO: Changing to 'same_kind' or 'safe' casting in the ufuncs by
+        #       default is needed to properly catch this kind of thing...
+        a = np.array('2012-12-21', dtype='M8[D]')
+        b = np.array(3, dtype='m8[D]')
+        #assert_raises(TypeError, np.less, a, b)
+        assert_raises(TypeError, np.less, a, b, casting='same_kind')
+
+    def test_datetime_like(self):
+        a = np.array([3], dtype='m8[4D]')
+        b = np.array(['2012-12-21'], dtype='M8[D]')
+
+        assert_equal(np.ones_like(a).dtype, a.dtype)
+        assert_equal(np.zeros_like(a).dtype, a.dtype)
+        assert_equal(np.empty_like(a).dtype, a.dtype)
+        assert_equal(np.ones_like(b).dtype, b.dtype)
+        assert_equal(np.zeros_like(b).dtype, b.dtype)
+        assert_equal(np.empty_like(b).dtype, b.dtype)
+
+    def test_datetime_unary(self):
+        for tda, tdb, tdzero, tdone, tdmone in \
+                [
+                 # One-dimensional arrays
+                 (np.array([3], dtype='m8[D]'),
+                  np.array([-3], dtype='m8[D]'),
+                  np.array([0], dtype='m8[D]'),
+                  np.array([1], dtype='m8[D]'),
+                  np.array([-1], dtype='m8[D]')),
+                 # NumPy scalars
+                 (np.timedelta64(3, '[D]'),
+                  np.timedelta64(-3, '[D]'),
+                  np.timedelta64(0, '[D]'),
+                  np.timedelta64(1, '[D]'),
+                  np.timedelta64(-1, '[D]'))]:
+            # negative ufunc
+            assert_equal(-tdb, tda)
+            assert_equal((-tdb).dtype, tda.dtype)
+            assert_equal(np.negative(tdb), tda)
+            assert_equal(np.negative(tdb).dtype, tda.dtype)
+
+            # positive ufunc
+            assert_equal(np.positive(tda), tda)
+            assert_equal(np.positive(tda).dtype, tda.dtype)
+            assert_equal(np.positive(tdb), tdb)
+            assert_equal(np.positive(tdb).dtype, tdb.dtype)
+
+            # absolute ufunc
+            assert_equal(np.absolute(tdb), tda)
+            assert_equal(np.absolute(tdb).dtype, tda.dtype)
+
+            # sign ufunc
+            assert_equal(np.sign(tda), tdone)
+            assert_equal(np.sign(tdb), tdmone)
+            assert_equal(np.sign(tdzero), tdzero)
+            assert_equal(np.sign(tda).dtype, tda.dtype)
+
+            # The ufuncs always produce native-endian results
+            assert_
+
+    def test_datetime_add(self):
+        for dta, dtb, dtc, dtnat, tda, tdb, tdc in \
+                    [
+                     # One-dimensional arrays
+                     (np.array(['2012-12-21'], dtype='M8[D]'),
+                      np.array(['2012-12-24'], dtype='M8[D]'),
+                      np.array(['2012-12-21T11'], dtype='M8[h]'),
+                      np.array(['NaT'], dtype='M8[D]'),
+                      np.array([3], dtype='m8[D]'),
+                      np.array([11], dtype='m8[h]'),
+                      np.array([3*24 + 11], dtype='m8[h]')),
+                     # NumPy scalars
+                     (np.datetime64('2012-12-21', '[D]'),
+                      np.datetime64('2012-12-24', '[D]'),
+                      np.datetime64('2012-12-21T11', '[h]'),
+                      np.datetime64('NaT', '[D]'),
+                      np.timedelta64(3, '[D]'),
+                      np.timedelta64(11, '[h]'),
+                      np.timedelta64(3*24 + 11, '[h]'))]:
+            # m8 + m8
+            assert_equal(tda + tdb, tdc)
+            assert_equal((tda + tdb).dtype, np.dtype('m8[h]'))
+            # m8 + bool
+            assert_equal(tdb + True, tdb + 1)
+            assert_equal((tdb + True).dtype, np.dtype('m8[h]'))
+            # m8 + int
+            assert_equal(tdb + 3*24, tdc)
+            assert_equal((tdb + 3*24).dtype, np.dtype('m8[h]'))
+            # bool + m8
+            assert_equal(False + tdb, tdb)
+            assert_equal((False + tdb).dtype, np.dtype('m8[h]'))
+            # int + m8
+            assert_equal(3*24 + tdb, tdc)
+            assert_equal((3*24 + tdb).dtype, np.dtype('m8[h]'))
+            # M8 + bool
+            assert_equal(dta + True, dta + 1)
+            assert_equal(dtnat + True, dtnat)
+            assert_equal((dta + True).dtype, np.dtype('M8[D]'))
+            # M8 + int
+            assert_equal(dta + 3, dtb)
+            assert_equal(dtnat + 3, dtnat)
+            assert_equal((dta + 3).dtype, np.dtype('M8[D]'))
+            # bool + M8
+            assert_equal(False + dta, dta)
+            assert_equal(False + dtnat, dtnat)
+            assert_equal((False + dta).dtype, np.dtype('M8[D]'))
+            # int + M8
+            assert_equal(3 + dta, dtb)
+            assert_equal(3 + dtnat, dtnat)
+            assert_equal((3 + dta).dtype, np.dtype('M8[D]'))
+            # M8 + m8
+            assert_equal(dta + tda, dtb)
+            assert_equal(dtnat + tda, dtnat)
+            assert_equal((dta + tda).dtype, np.dtype('M8[D]'))
+            # m8 + M8
+            assert_equal(tda + dta, dtb)
+            assert_equal(tda + dtnat, dtnat)
+            assert_equal((tda + dta).dtype, np.dtype('M8[D]'))
+
+            # In M8 + m8, the result goes to higher precision
+            assert_equal(np.add(dta, tdb, casting='unsafe'), dtc)
+            assert_equal(np.add(dta, tdb, casting='unsafe').dtype,
+                         np.dtype('M8[h]'))
+            assert_equal(np.add(tdb, dta, casting='unsafe'), dtc)
+            assert_equal(np.add(tdb, dta, casting='unsafe').dtype,
+                         np.dtype('M8[h]'))
+
+            # M8 + M8
+            assert_raises(TypeError, np.add, dta, dtb)
+
+    def test_datetime_subtract(self):
+        for dta, dtb, dtc, dtd, dte, dtnat, tda, tdb, tdc in \
+                    [
+                     # One-dimensional arrays
+                     (np.array(['2012-12-21'], dtype='M8[D]'),
+                      np.array(['2012-12-24'], dtype='M8[D]'),
+                      np.array(['1940-12-24'], dtype='M8[D]'),
+                      np.array(['1940-12-24T00'], dtype='M8[h]'),
+                      np.array(['1940-12-23T13'], dtype='M8[h]'),
+                      np.array(['NaT'], dtype='M8[D]'),
+                      np.array([3], dtype='m8[D]'),
+                      np.array([11], dtype='m8[h]'),
+                      np.array([3*24 - 11], dtype='m8[h]')),
+                     # NumPy scalars
+                     (np.datetime64('2012-12-21', '[D]'),
+                      np.datetime64('2012-12-24', '[D]'),
+                      np.datetime64('1940-12-24', '[D]'),
+                      np.datetime64('1940-12-24T00', '[h]'),
+                      np.datetime64('1940-12-23T13', '[h]'),
+                      np.datetime64('NaT', '[D]'),
+                      np.timedelta64(3, '[D]'),
+                      np.timedelta64(11, '[h]'),
+                      np.timedelta64(3*24 - 11, '[h]'))]:
+            # m8 - m8
+            assert_equal(tda - tdb, tdc)
+            assert_equal((tda - tdb).dtype, np.dtype('m8[h]'))
+            assert_equal(tdb - tda, -tdc)
+            assert_equal((tdb - tda).dtype, np.dtype('m8[h]'))
+            # m8 - bool
+            assert_equal(tdc - True, tdc - 1)
+            assert_equal((tdc - True).dtype, np.dtype('m8[h]'))
+            # m8 - int
+            assert_equal(tdc - 3*24, -tdb)
+            assert_equal((tdc - 3*24).dtype, np.dtype('m8[h]'))
+            # int - m8
+            assert_equal(False - tdb, -tdb)
+            assert_equal((False - tdb).dtype, np.dtype('m8[h]'))
+            # int - m8
+            assert_equal(3*24 - tdb, tdc)
+            assert_equal((3*24 - tdb).dtype, np.dtype('m8[h]'))
+            # M8 - bool
+            assert_equal(dtb - True, dtb - 1)
+            assert_equal(dtnat - True, dtnat)
+            assert_equal((dtb - True).dtype, np.dtype('M8[D]'))
+            # M8 - int
+            assert_equal(dtb - 3, dta)
+            assert_equal(dtnat - 3, dtnat)
+            assert_equal((dtb - 3).dtype, np.dtype('M8[D]'))
+            # M8 - m8
+            assert_equal(dtb - tda, dta)
+            assert_equal(dtnat - tda, dtnat)
+            assert_equal((dtb - tda).dtype, np.dtype('M8[D]'))
+
+            # In M8 - m8, the result goes to higher precision
+            assert_equal(np.subtract(dtc, tdb, casting='unsafe'), dte)
+            assert_equal(np.subtract(dtc, tdb, casting='unsafe').dtype,
+                         np.dtype('M8[h]'))
+
+            # M8 - M8 with different goes to higher precision
+            assert_equal(np.subtract(dtc, dtd, casting='unsafe'),
+                         np.timedelta64(0, 'h'))
+            assert_equal(np.subtract(dtc, dtd, casting='unsafe').dtype,
+                         np.dtype('m8[h]'))
+            assert_equal(np.subtract(dtd, dtc, casting='unsafe'),
+                         np.timedelta64(0, 'h'))
+            assert_equal(np.subtract(dtd, dtc, casting='unsafe').dtype,
+                         np.dtype('m8[h]'))
+
+            # m8 - M8
+            assert_raises(TypeError, np.subtract, tda, dta)
+            # bool - M8
+            assert_raises(TypeError, np.subtract, False, dta)
+            # int - M8
+            assert_raises(TypeError, np.subtract, 3, dta)
+
+    def test_datetime_multiply(self):
+        for dta, tda, tdb, tdc in \
+                    [
+                     # One-dimensional arrays
+                     (np.array(['2012-12-21'], dtype='M8[D]'),
+                      np.array([6], dtype='m8[h]'),
+                      np.array([9], dtype='m8[h]'),
+                      np.array([12], dtype='m8[h]')),
+                     # NumPy scalars
+                     (np.datetime64('2012-12-21', '[D]'),
+                      np.timedelta64(6, '[h]'),
+                      np.timedelta64(9, '[h]'),
+                      np.timedelta64(12, '[h]'))]:
+            # m8 * int
+            assert_equal(tda * 2, tdc)
+            assert_equal((tda * 2).dtype, np.dtype('m8[h]'))
+            # int * m8
+            assert_equal(2 * tda, tdc)
+            assert_equal((2 * tda).dtype, np.dtype('m8[h]'))
+            # m8 * float
+            assert_equal(tda * 1.5, tdb)
+            assert_equal((tda * 1.5).dtype, np.dtype('m8[h]'))
+            # float * m8
+            assert_equal(1.5 * tda, tdb)
+            assert_equal((1.5 * tda).dtype, np.dtype('m8[h]'))
+
+            # m8 * m8
+            assert_raises(TypeError, np.multiply, tda, tdb)
+            # m8 * M8
+            assert_raises(TypeError, np.multiply, dta, tda)
+            # M8 * m8
+            assert_raises(TypeError, np.multiply, tda, dta)
+            # M8 * int
+            assert_raises(TypeError, np.multiply, dta, 2)
+            # int * M8
+            assert_raises(TypeError, np.multiply, 2, dta)
+            # M8 * float
+            assert_raises(TypeError, np.multiply, dta, 1.5)
+            # float * M8
+            assert_raises(TypeError, np.multiply, 1.5, dta)
+
+        # NaTs
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning, "invalid value encountered in multiply")
+            nat = np.timedelta64('NaT')
+            def check(a, b, res):
+                assert_equal(a * b, res)
+                assert_equal(b * a, res)
+            for tp in (int, float):
+                check(nat, tp(2), nat)
+                check(nat, tp(0), nat)
+            for f in (float('inf'), float('nan')):
+                check(np.timedelta64(1), f, nat)
+                check(np.timedelta64(0), f, nat)
+                check(nat, f, nat)
+
+    @pytest.mark.parametrize("op1, op2, exp", [
+        # m8 same units round down
+        (np.timedelta64(7, 's'),
+         np.timedelta64(4, 's'),
+         1),
+        # m8 same units round down with negative
+        (np.timedelta64(7, 's'),
+         np.timedelta64(-4, 's'),
+         -2),
+        # m8 same units negative no round down
+        (np.timedelta64(8, 's'),
+         np.timedelta64(-4, 's'),
+         -2),
+        # m8 different units
+        (np.timedelta64(1, 'm'),
+         np.timedelta64(31, 's'),
+         1),
+        # m8 generic units
+        (np.timedelta64(1890),
+         np.timedelta64(31),
+         60),
+        # Y // M works
+        (np.timedelta64(2, 'Y'),
+         np.timedelta64('13', 'M'),
+         1),
+        # handle 1D arrays
+        (np.array([1, 2, 3], dtype='m8'),
+         np.array([2], dtype='m8'),
+         np.array([0, 1, 1], dtype=np.int64)),
+        ])
+    def test_timedelta_floor_divide(self, op1, op2, exp):
+        assert_equal(op1 // op2, exp)
+
+    @pytest.mark.parametrize("op1, op2", [
+        # div by 0
+        (np.timedelta64(10, 'us'),
+         np.timedelta64(0, 'us')),
+        # div with NaT
+        (np.timedelta64('NaT'),
+         np.timedelta64(50, 'us')),
+        # special case for int64 min
+        # in integer floor division
+        (np.timedelta64(np.iinfo(np.int64).min),
+         np.timedelta64(-1)),
+        ])
+    def test_timedelta_floor_div_warnings(self, op1, op2):
+        with assert_warns(RuntimeWarning):
+            actual = op1 // op2
+            assert_equal(actual, 0)
+            assert_equal(actual.dtype, np.int64)
+
+    @pytest.mark.parametrize("val1, val2", [
+        # the smallest integer that can't be represented
+        # exactly in a double should be preserved if we avoid
+        # casting to double in floordiv operation
+        (9007199254740993, 1),
+        # stress the alternate floordiv code path where
+        # operand signs don't match and remainder isn't 0
+        (9007199254740999, -2),
+        ])
+    def test_timedelta_floor_div_precision(self, val1, val2):
+        op1 = np.timedelta64(val1)
+        op2 = np.timedelta64(val2)
+        actual = op1 // op2
+        # Python reference integer floor
+        expected = val1 // val2
+        assert_equal(actual, expected)
+
+    @pytest.mark.parametrize("val1, val2", [
+        # years and months sometimes can't be unambiguously
+        # divided for floor division operation
+        (np.timedelta64(7, 'Y'),
+         np.timedelta64(3, 's')),
+        (np.timedelta64(7, 'M'),
+         np.timedelta64(1, 'D')),
+        ])
+    def test_timedelta_floor_div_error(self, val1, val2):
+        with assert_raises_regex(TypeError, "common metadata divisor"):
+            val1 // val2
+
+    @pytest.mark.parametrize("op1, op2", [
+        # reuse the test cases from floordiv
+        (np.timedelta64(7, 's'),
+         np.timedelta64(4, 's')),
+        # m8 same units round down with negative
+        (np.timedelta64(7, 's'),
+         np.timedelta64(-4, 's')),
+        # m8 same units negative no round down
+        (np.timedelta64(8, 's'),
+         np.timedelta64(-4, 's')),
+        # m8 different units
+        (np.timedelta64(1, 'm'),
+         np.timedelta64(31, 's')),
+        # m8 generic units
+        (np.timedelta64(1890),
+         np.timedelta64(31)),
+        # Y // M works
+        (np.timedelta64(2, 'Y'),
+         np.timedelta64('13', 'M')),
+        # handle 1D arrays
+        (np.array([1, 2, 3], dtype='m8'),
+         np.array([2], dtype='m8')),
+        ])
+    def test_timedelta_divmod(self, op1, op2):
+        expected = (op1 // op2, op1 % op2)
+        assert_equal(divmod(op1, op2), expected)
+
+    @pytest.mark.parametrize("op1, op2", [
+        # reuse cases from floordiv
+        # div by 0
+        (np.timedelta64(10, 'us'),
+         np.timedelta64(0, 'us')),
+        # div with NaT
+        (np.timedelta64('NaT'),
+         np.timedelta64(50, 'us')),
+        # special case for int64 min
+        # in integer floor division
+        (np.timedelta64(np.iinfo(np.int64).min),
+         np.timedelta64(-1)),
+        ])
+    def test_timedelta_divmod_warnings(self, op1, op2):
+        with assert_warns(RuntimeWarning):
+            expected = (op1 // op2, op1 % op2)
+        with assert_warns(RuntimeWarning):
+            actual = divmod(op1, op2)
+        assert_equal(actual, expected)
+
+    def test_datetime_divide(self):
+        for dta, tda, tdb, tdc, tdd in \
+                    [
+                     # One-dimensional arrays
+                     (np.array(['2012-12-21'], dtype='M8[D]'),
+                      np.array([6], dtype='m8[h]'),
+                      np.array([9], dtype='m8[h]'),
+                      np.array([12], dtype='m8[h]'),
+                      np.array([6], dtype='m8[m]')),
+                     # NumPy scalars
+                     (np.datetime64('2012-12-21', '[D]'),
+                      np.timedelta64(6, '[h]'),
+                      np.timedelta64(9, '[h]'),
+                      np.timedelta64(12, '[h]'),
+                      np.timedelta64(6, '[m]'))]:
+            # m8 / int
+            assert_equal(tdc / 2, tda)
+            assert_equal((tdc / 2).dtype, np.dtype('m8[h]'))
+            # m8 / float
+            assert_equal(tda / 0.5, tdc)
+            assert_equal((tda / 0.5).dtype, np.dtype('m8[h]'))
+            # m8 / m8
+            assert_equal(tda / tdb, 6.0 / 9.0)
+            assert_equal(np.divide(tda, tdb), 6.0 / 9.0)
+            assert_equal(np.true_divide(tda, tdb), 6.0 / 9.0)
+            assert_equal(tdb / tda, 9.0 / 6.0)
+            assert_equal((tda / tdb).dtype, np.dtype('f8'))
+            assert_equal(tda / tdd, 60.0)
+            assert_equal(tdd / tda, 1.0 / 60.0)
+
+            # int / m8
+            assert_raises(TypeError, np.divide, 2, tdb)
+            # float / m8
+            assert_raises(TypeError, np.divide, 0.5, tdb)
+            # m8 / M8
+            assert_raises(TypeError, np.divide, dta, tda)
+            # M8 / m8
+            assert_raises(TypeError, np.divide, tda, dta)
+            # M8 / int
+            assert_raises(TypeError, np.divide, dta, 2)
+            # int / M8
+            assert_raises(TypeError, np.divide, 2, dta)
+            # M8 / float
+            assert_raises(TypeError, np.divide, dta, 1.5)
+            # float / M8
+            assert_raises(TypeError, np.divide, 1.5, dta)
+
+        # NaTs
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning,  r".*encountered in true\_divide")
+            nat = np.timedelta64('NaT')
+            for tp in (int, float):
+                assert_equal(np.timedelta64(1) / tp(0), nat)
+                assert_equal(np.timedelta64(0) / tp(0), nat)
+                assert_equal(nat / tp(0), nat)
+                assert_equal(nat / tp(2), nat)
+            # Division by inf
+            assert_equal(np.timedelta64(1) / float('inf'), np.timedelta64(0))
+            assert_equal(np.timedelta64(0) / float('inf'), np.timedelta64(0))
+            assert_equal(nat / float('inf'), nat)
+            # Division by nan
+            assert_equal(np.timedelta64(1) / float('nan'), nat)
+            assert_equal(np.timedelta64(0) / float('nan'), nat)
+            assert_equal(nat / float('nan'), nat)
+
+    def test_datetime_compare(self):
+        # Test all the comparison operators
+        a = np.datetime64('2000-03-12T18:00:00.000000')
+        b = np.array(['2000-03-12T18:00:00.000000',
+                      '2000-03-12T17:59:59.999999',
+                      '2000-03-12T18:00:00.000001',
+                      '1970-01-11T12:00:00.909090',
+                      '2016-01-11T12:00:00.909090'],
+                      dtype='datetime64[us]')
+        assert_equal(np.equal(a, b), [1, 0, 0, 0, 0])
+        assert_equal(np.not_equal(a, b), [0, 1, 1, 1, 1])
+        assert_equal(np.less(a, b), [0, 0, 1, 0, 1])
+        assert_equal(np.less_equal(a, b), [1, 0, 1, 0, 1])
+        assert_equal(np.greater(a, b), [0, 1, 0, 1, 0])
+        assert_equal(np.greater_equal(a, b), [1, 1, 0, 1, 0])
+
+    def test_datetime_compare_nat(self):
+        dt_nat = np.datetime64('NaT', 'D')
+        dt_other = np.datetime64('2000-01-01')
+        td_nat = np.timedelta64('NaT', 'h')
+        td_other = np.timedelta64(1, 'h')
+
+        for op in [np.equal, np.less, np.less_equal,
+                   np.greater, np.greater_equal]:
+            assert_(not op(dt_nat, dt_nat))
+            assert_(not op(dt_nat, dt_other))
+            assert_(not op(dt_other, dt_nat))
+
+            assert_(not op(td_nat, td_nat))
+            assert_(not op(td_nat, td_other))
+            assert_(not op(td_other, td_nat))
+
+        assert_(np.not_equal(dt_nat, dt_nat))
+        assert_(np.not_equal(dt_nat, dt_other))
+        assert_(np.not_equal(dt_other, dt_nat))
+
+        assert_(np.not_equal(td_nat, td_nat))
+        assert_(np.not_equal(td_nat, td_other))
+        assert_(np.not_equal(td_other, td_nat))
+
+    def test_datetime_minmax(self):
+        # The metadata of the result should become the GCD
+        # of the operand metadata
+        a = np.array('1999-03-12T13', dtype='M8[2m]')
+        b = np.array('1999-03-12T12', dtype='M8[s]')
+        assert_equal(np.minimum(a, b), b)
+        assert_equal(np.minimum(a, b).dtype, np.dtype('M8[s]'))
+        assert_equal(np.fmin(a, b), b)
+        assert_equal(np.fmin(a, b).dtype, np.dtype('M8[s]'))
+        assert_equal(np.maximum(a, b), a)
+        assert_equal(np.maximum(a, b).dtype, np.dtype('M8[s]'))
+        assert_equal(np.fmax(a, b), a)
+        assert_equal(np.fmax(a, b).dtype, np.dtype('M8[s]'))
+        # Viewed as integers, the comparison is opposite because
+        # of the units chosen
+        assert_equal(np.minimum(a.view('i8'), b.view('i8')), a.view('i8'))
+
+        # Interaction with NaT
+        a = np.array('1999-03-12T13', dtype='M8[2m]')
+        dtnat = np.array('NaT', dtype='M8[h]')
+        assert_equal(np.minimum(a, dtnat), dtnat)
+        assert_equal(np.minimum(dtnat, a), dtnat)
+        assert_equal(np.maximum(a, dtnat), dtnat)
+        assert_equal(np.maximum(dtnat, a), dtnat)
+        assert_equal(np.fmin(dtnat, a), a)
+        assert_equal(np.fmin(a, dtnat), a)
+        assert_equal(np.fmax(dtnat, a), a)
+        assert_equal(np.fmax(a, dtnat), a)
+
+        # Also do timedelta
+        a = np.array(3, dtype='m8[h]')
+        b = np.array(3*3600 - 3, dtype='m8[s]')
+        assert_equal(np.minimum(a, b), b)
+        assert_equal(np.minimum(a, b).dtype, np.dtype('m8[s]'))
+        assert_equal(np.fmin(a, b), b)
+        assert_equal(np.fmin(a, b).dtype, np.dtype('m8[s]'))
+        assert_equal(np.maximum(a, b), a)
+        assert_equal(np.maximum(a, b).dtype, np.dtype('m8[s]'))
+        assert_equal(np.fmax(a, b), a)
+        assert_equal(np.fmax(a, b).dtype, np.dtype('m8[s]'))
+        # Viewed as integers, the comparison is opposite because
+        # of the units chosen
+        assert_equal(np.minimum(a.view('i8'), b.view('i8')), a.view('i8'))
+
+        # should raise between datetime and timedelta
+        #
+        # TODO: Allowing unsafe casting by
+        #       default in ufuncs strikes again... :(
+        a = np.array(3, dtype='m8[h]')
+        b = np.array('1999-03-12T12', dtype='M8[s]')
+        #assert_raises(TypeError, np.minimum, a, b)
+        #assert_raises(TypeError, np.maximum, a, b)
+        #assert_raises(TypeError, np.fmin, a, b)
+        #assert_raises(TypeError, np.fmax, a, b)
+        assert_raises(TypeError, np.minimum, a, b, casting='same_kind')
+        assert_raises(TypeError, np.maximum, a, b, casting='same_kind')
+        assert_raises(TypeError, np.fmin, a, b, casting='same_kind')
+        assert_raises(TypeError, np.fmax, a, b, casting='same_kind')
+
+    def test_hours(self):
+        t = np.ones(3, dtype='M8[s]')
+        t[0] = 60*60*24 + 60*60*10
+        assert_(t[0].item().hour == 10)
+
+    def test_divisor_conversion_year(self):
+        assert_(np.dtype('M8[Y/4]') == np.dtype('M8[3M]'))
+        assert_(np.dtype('M8[Y/13]') == np.dtype('M8[4W]'))
+        assert_(np.dtype('M8[3Y/73]') == np.dtype('M8[15D]'))
+
+    def test_divisor_conversion_month(self):
+        assert_(np.dtype('M8[M/2]') == np.dtype('M8[2W]'))
+        assert_(np.dtype('M8[M/15]') == np.dtype('M8[2D]'))
+        assert_(np.dtype('M8[3M/40]') == np.dtype('M8[54h]'))
+
+    def test_divisor_conversion_week(self):
+        assert_(np.dtype('m8[W/7]') == np.dtype('m8[D]'))
+        assert_(np.dtype('m8[3W/14]') == np.dtype('m8[36h]'))
+        assert_(np.dtype('m8[5W/140]') == np.dtype('m8[360m]'))
+
+    def test_divisor_conversion_day(self):
+        assert_(np.dtype('M8[D/12]') == np.dtype('M8[2h]'))
+        assert_(np.dtype('M8[D/120]') == np.dtype('M8[12m]'))
+        assert_(np.dtype('M8[3D/960]') == np.dtype('M8[270s]'))
+
+    def test_divisor_conversion_hour(self):
+        assert_(np.dtype('m8[h/30]') == np.dtype('m8[2m]'))
+        assert_(np.dtype('m8[3h/300]') == np.dtype('m8[36s]'))
+
+    def test_divisor_conversion_minute(self):
+        assert_(np.dtype('m8[m/30]') == np.dtype('m8[2s]'))
+        assert_(np.dtype('m8[3m/300]') == np.dtype('m8[600ms]'))
+
+    def test_divisor_conversion_second(self):
+        assert_(np.dtype('m8[s/100]') == np.dtype('m8[10ms]'))
+        assert_(np.dtype('m8[3s/10000]') == np.dtype('m8[300us]'))
+
+    def test_divisor_conversion_fs(self):
+        assert_(np.dtype('M8[fs/100]') == np.dtype('M8[10as]'))
+        assert_raises(ValueError, lambda: np.dtype('M8[3fs/10000]'))
+
+    def test_divisor_conversion_as(self):
+        assert_raises(ValueError, lambda: np.dtype('M8[as/10]'))
+
+    def test_string_parser_variants(self):
+        # Allow space instead of 'T' between date and time
+        assert_equal(np.array(['1980-02-29T01:02:03'], np.dtype('M8[s]')),
+                     np.array(['1980-02-29 01:02:03'], np.dtype('M8[s]')))
+        # Allow positive years
+        assert_equal(np.array(['+1980-02-29T01:02:03'], np.dtype('M8[s]')),
+                     np.array(['+1980-02-29 01:02:03'], np.dtype('M8[s]')))
+        # Allow negative years
+        assert_equal(np.array(['-1980-02-29T01:02:03'], np.dtype('M8[s]')),
+                     np.array(['-1980-02-29 01:02:03'], np.dtype('M8[s]')))
+        # UTC specifier
+        with assert_warns(DeprecationWarning):
+            assert_equal(
+                np.array(['+1980-02-29T01:02:03'], np.dtype('M8[s]')),
+                np.array(['+1980-02-29 01:02:03Z'], np.dtype('M8[s]')))
+        with assert_warns(DeprecationWarning):
+            assert_equal(
+                np.array(['-1980-02-29T01:02:03'], np.dtype('M8[s]')),
+                np.array(['-1980-02-29 01:02:03Z'], np.dtype('M8[s]')))
+        # Time zone offset
+        with assert_warns(DeprecationWarning):
+            assert_equal(
+                np.array(['1980-02-29T02:02:03'], np.dtype('M8[s]')),
+                np.array(['1980-02-29 00:32:03-0130'], np.dtype('M8[s]')))
+        with assert_warns(DeprecationWarning):
+            assert_equal(
+                np.array(['1980-02-28T22:32:03'], np.dtype('M8[s]')),
+                np.array(['1980-02-29 00:02:03+01:30'], np.dtype('M8[s]')))
+        with assert_warns(DeprecationWarning):
+            assert_equal(
+                np.array(['1980-02-29T02:32:03.506'], np.dtype('M8[s]')),
+                np.array(['1980-02-29 00:32:03.506-02'], np.dtype('M8[s]')))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.datetime64('1977-03-02T12:30-0230'),
+                         np.datetime64('1977-03-02T15:00'))
+
+    def test_string_parser_error_check(self):
+        # Arbitrary bad string
+        assert_raises(ValueError, np.array, ['badvalue'], np.dtype('M8[us]'))
+        # Character after year must be '-'
+        assert_raises(ValueError, np.array, ['1980X'], np.dtype('M8[us]'))
+        # Cannot have trailing '-'
+        assert_raises(ValueError, np.array, ['1980-'], np.dtype('M8[us]'))
+        # Month must be in range [1,12]
+        assert_raises(ValueError, np.array, ['1980-00'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-13'], np.dtype('M8[us]'))
+        # Month must have two digits
+        assert_raises(ValueError, np.array, ['1980-1'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-1-02'], np.dtype('M8[us]'))
+        # 'Mor' is not a valid month
+        assert_raises(ValueError, np.array, ['1980-Mor'], np.dtype('M8[us]'))
+        # Cannot have trailing '-'
+        assert_raises(ValueError, np.array, ['1980-01-'], np.dtype('M8[us]'))
+        # Day must be in range [1,len(month)]
+        assert_raises(ValueError, np.array, ['1980-01-0'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-01-00'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-01-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1979-02-29'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-30'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-03-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-04-31'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-05-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-06-31'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-07-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-08-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-09-31'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-10-32'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-11-31'], np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-12-32'], np.dtype('M8[us]'))
+        # Cannot have trailing characters
+        assert_raises(ValueError, np.array, ['1980-02-03%'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03 q'],
+                                                        np.dtype('M8[us]'))
+
+        # Hours must be in range [0, 23]
+        assert_raises(ValueError, np.array, ['1980-02-03 25'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03T25'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03 24:01'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03T24:01'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03 -1'],
+                                                        np.dtype('M8[us]'))
+        # No trailing ':'
+        assert_raises(ValueError, np.array, ['1980-02-03 01:'],
+                                                        np.dtype('M8[us]'))
+        # Minutes must be in range [0, 59]
+        assert_raises(ValueError, np.array, ['1980-02-03 01:-1'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03 01:60'],
+                                                        np.dtype('M8[us]'))
+        # No trailing ':'
+        assert_raises(ValueError, np.array, ['1980-02-03 01:60:'],
+                                                        np.dtype('M8[us]'))
+        # Seconds must be in range [0, 59]
+        assert_raises(ValueError, np.array, ['1980-02-03 01:10:-1'],
+                                                        np.dtype('M8[us]'))
+        assert_raises(ValueError, np.array, ['1980-02-03 01:01:60'],
+                                                        np.dtype('M8[us]'))
+        # Timezone offset must within a reasonable range
+        with assert_warns(DeprecationWarning):
+            assert_raises(ValueError, np.array, ['1980-02-03 01:01:00+0661'],
+                                                            np.dtype('M8[us]'))
+        with assert_warns(DeprecationWarning):
+            assert_raises(ValueError, np.array, ['1980-02-03 01:01:00+2500'],
+                                                            np.dtype('M8[us]'))
+        with assert_warns(DeprecationWarning):
+            assert_raises(ValueError, np.array, ['1980-02-03 01:01:00-0070'],
+                                                            np.dtype('M8[us]'))
+        with assert_warns(DeprecationWarning):
+            assert_raises(ValueError, np.array, ['1980-02-03 01:01:00-3000'],
+                                                            np.dtype('M8[us]'))
+        with assert_warns(DeprecationWarning):
+            assert_raises(ValueError, np.array, ['1980-02-03 01:01:00-25:00'],
+                                                            np.dtype('M8[us]'))
+
+    def test_creation_overflow(self):
+        date = '1980-03-23 20:00:00'
+        timesteps = np.array([date], dtype='datetime64[s]')[0].astype(np.int64)
+        for unit in ['ms', 'us', 'ns']:
+            timesteps *= 1000
+            x = np.array([date], dtype='datetime64[%s]' % unit)
+
+            assert_equal(timesteps, x[0].astype(np.int64),
+                         err_msg='Datetime conversion error for unit %s' % unit)
+
+        assert_equal(x[0].astype(np.int64), 322689600000000000)
+
+        # gh-13062
+        with pytest.raises(OverflowError):
+            np.datetime64(2**64, 'D')
+        with pytest.raises(OverflowError):
+            np.timedelta64(2**64, 'D')
+
+    def test_datetime_as_string(self):
+        # Check all the units with default string conversion
+        date = '1959-10-13'
+        datetime = '1959-10-13T12:34:56.789012345678901234'
+
+        assert_equal(np.datetime_as_string(np.datetime64(date, 'Y')),
+                     '1959')
+        assert_equal(np.datetime_as_string(np.datetime64(date, 'M')),
+                     '1959-10')
+        assert_equal(np.datetime_as_string(np.datetime64(date, 'D')),
+                     '1959-10-13')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'h')),
+                     '1959-10-13T12')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'm')),
+                     '1959-10-13T12:34')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 's')),
+                     '1959-10-13T12:34:56')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'ms')),
+                     '1959-10-13T12:34:56.789')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'us')),
+                     '1959-10-13T12:34:56.789012')
+
+        datetime = '1969-12-31T23:34:56.789012345678901234'
+
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'ns')),
+                     '1969-12-31T23:34:56.789012345')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'ps')),
+                     '1969-12-31T23:34:56.789012345678')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'fs')),
+                     '1969-12-31T23:34:56.789012345678901')
+
+        datetime = '1969-12-31T23:59:57.789012345678901234'
+
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'as')),
+                     datetime)
+        datetime = '1970-01-01T00:34:56.789012345678901234'
+
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'ns')),
+                     '1970-01-01T00:34:56.789012345')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'ps')),
+                     '1970-01-01T00:34:56.789012345678')
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'fs')),
+                     '1970-01-01T00:34:56.789012345678901')
+
+        datetime = '1970-01-01T00:00:05.789012345678901234'
+
+        assert_equal(np.datetime_as_string(np.datetime64(datetime, 'as')),
+                     datetime)
+
+        # String conversion with the unit= parameter
+        a = np.datetime64('2032-07-18T12:23:34.123456', 'us')
+        assert_equal(np.datetime_as_string(a, unit='Y', casting='unsafe'),
+                            '2032')
+        assert_equal(np.datetime_as_string(a, unit='M', casting='unsafe'),
+                            '2032-07')
+        assert_equal(np.datetime_as_string(a, unit='W', casting='unsafe'),
+                            '2032-07-18')
+        assert_equal(np.datetime_as_string(a, unit='D', casting='unsafe'),
+                            '2032-07-18')
+        assert_equal(np.datetime_as_string(a, unit='h'), '2032-07-18T12')
+        assert_equal(np.datetime_as_string(a, unit='m'),
+                            '2032-07-18T12:23')
+        assert_equal(np.datetime_as_string(a, unit='s'),
+                            '2032-07-18T12:23:34')
+        assert_equal(np.datetime_as_string(a, unit='ms'),
+                            '2032-07-18T12:23:34.123')
+        assert_equal(np.datetime_as_string(a, unit='us'),
+                            '2032-07-18T12:23:34.123456')
+        assert_equal(np.datetime_as_string(a, unit='ns'),
+                            '2032-07-18T12:23:34.123456000')
+        assert_equal(np.datetime_as_string(a, unit='ps'),
+                            '2032-07-18T12:23:34.123456000000')
+        assert_equal(np.datetime_as_string(a, unit='fs'),
+                            '2032-07-18T12:23:34.123456000000000')
+        assert_equal(np.datetime_as_string(a, unit='as'),
+                            '2032-07-18T12:23:34.123456000000000000')
+
+        # unit='auto' parameter
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T12:23:34.123456', 'us'), unit='auto'),
+                '2032-07-18T12:23:34.123456')
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T12:23:34.12', 'us'), unit='auto'),
+                '2032-07-18T12:23:34.120')
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T12:23:34', 'us'), unit='auto'),
+                '2032-07-18T12:23:34')
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T12:23:00', 'us'), unit='auto'),
+                '2032-07-18T12:23')
+        # 'auto' doesn't split up hour and minute
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T12:00:00', 'us'), unit='auto'),
+                '2032-07-18T12:00')
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-18T00:00:00', 'us'), unit='auto'),
+                '2032-07-18')
+        # 'auto' doesn't split up the date
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-07-01T00:00:00', 'us'), unit='auto'),
+                '2032-07-01')
+        assert_equal(np.datetime_as_string(
+                np.datetime64('2032-01-01T00:00:00', 'us'), unit='auto'),
+                '2032-01-01')
+
+    @pytest.mark.skipif(not _has_pytz, reason="The pytz module is not available.")
+    def test_datetime_as_string_timezone(self):
+        # timezone='local' vs 'UTC'
+        a = np.datetime64('2010-03-15T06:30', 'm')
+        assert_equal(np.datetime_as_string(a),
+                '2010-03-15T06:30')
+        assert_equal(np.datetime_as_string(a, timezone='naive'),
+                '2010-03-15T06:30')
+        assert_equal(np.datetime_as_string(a, timezone='UTC'),
+                '2010-03-15T06:30Z')
+        assert_(np.datetime_as_string(a, timezone='local') !=
+                '2010-03-15T06:30')
+
+        b = np.datetime64('2010-02-15T06:30', 'm')
+
+        assert_equal(np.datetime_as_string(a, timezone=tz('US/Central')),
+                     '2010-03-15T01:30-0500')
+        assert_equal(np.datetime_as_string(a, timezone=tz('US/Eastern')),
+                     '2010-03-15T02:30-0400')
+        assert_equal(np.datetime_as_string(a, timezone=tz('US/Pacific')),
+                     '2010-03-14T23:30-0700')
+
+        assert_equal(np.datetime_as_string(b, timezone=tz('US/Central')),
+                     '2010-02-15T00:30-0600')
+        assert_equal(np.datetime_as_string(b, timezone=tz('US/Eastern')),
+                     '2010-02-15T01:30-0500')
+        assert_equal(np.datetime_as_string(b, timezone=tz('US/Pacific')),
+                     '2010-02-14T22:30-0800')
+
+        # Dates to strings with a timezone attached is disabled by default
+        assert_raises(TypeError, np.datetime_as_string, a, unit='D',
+                           timezone=tz('US/Pacific'))
+        # Check that we can print out the date in the specified time zone
+        assert_equal(np.datetime_as_string(a, unit='D',
+                           timezone=tz('US/Pacific'), casting='unsafe'),
+                     '2010-03-14')
+        assert_equal(np.datetime_as_string(b, unit='D',
+                           timezone=tz('US/Central'), casting='unsafe'),
+                     '2010-02-15')
+
+    def test_datetime_arange(self):
+        # With two datetimes provided as strings
+        a = np.arange('2010-01-05', '2010-01-10', dtype='M8[D]')
+        assert_equal(a.dtype, np.dtype('M8[D]'))
+        assert_equal(a,
+            np.array(['2010-01-05', '2010-01-06', '2010-01-07',
+                      '2010-01-08', '2010-01-09'], dtype='M8[D]'))
+
+        a = np.arange('1950-02-10', '1950-02-06', -1, dtype='M8[D]')
+        assert_equal(a.dtype, np.dtype('M8[D]'))
+        assert_equal(a,
+            np.array(['1950-02-10', '1950-02-09', '1950-02-08',
+                      '1950-02-07'], dtype='M8[D]'))
+
+        # Unit should be detected as months here
+        a = np.arange('1969-05', '1970-05', 2, dtype='M8')
+        assert_equal(a.dtype, np.dtype('M8[M]'))
+        assert_equal(a,
+            np.datetime64('1969-05') + np.arange(12, step=2))
+
+        # datetime, integer|timedelta works as well
+        # produces arange (start, start + stop) in this case
+        a = np.arange('1969', 18, 3, dtype='M8')
+        assert_equal(a.dtype, np.dtype('M8[Y]'))
+        assert_equal(a,
+            np.datetime64('1969') + np.arange(18, step=3))
+        a = np.arange('1969-12-19', 22, np.timedelta64(2), dtype='M8')
+        assert_equal(a.dtype, np.dtype('M8[D]'))
+        assert_equal(a,
+            np.datetime64('1969-12-19') + np.arange(22, step=2))
+
+        # Step of 0 is disallowed
+        assert_raises(ValueError, np.arange, np.datetime64('today'),
+                                np.datetime64('today') + 3, 0)
+        # Promotion across nonlinear unit boundaries is disallowed
+        assert_raises(TypeError, np.arange, np.datetime64('2011-03-01', 'D'),
+                                np.timedelta64(5, 'M'))
+        assert_raises(TypeError, np.arange,
+                                np.datetime64('2012-02-03T14', 's'),
+                                np.timedelta64(5, 'Y'))
+
+    def test_datetime_arange_no_dtype(self):
+        d = np.array('2010-01-04', dtype="M8[D]")
+        assert_equal(np.arange(d, d + 1), d)
+        assert_raises(ValueError, np.arange, d)
+
+    def test_timedelta_arange(self):
+        a = np.arange(3, 10, dtype='m8')
+        assert_equal(a.dtype, np.dtype('m8'))
+        assert_equal(a, np.timedelta64(0) + np.arange(3, 10))
+
+        a = np.arange(np.timedelta64(3, 's'), 10, 2, dtype='m8')
+        assert_equal(a.dtype, np.dtype('m8[s]'))
+        assert_equal(a, np.timedelta64(0, 's') + np.arange(3, 10, 2))
+
+        # Step of 0 is disallowed
+        assert_raises(ValueError, np.arange, np.timedelta64(0),
+                                np.timedelta64(5), 0)
+        # Promotion across nonlinear unit boundaries is disallowed
+        assert_raises(TypeError, np.arange, np.timedelta64(0, 'D'),
+                                np.timedelta64(5, 'M'))
+        assert_raises(TypeError, np.arange, np.timedelta64(0, 'Y'),
+                                np.timedelta64(5, 'D'))
+
+    @pytest.mark.parametrize("val1, val2, expected", [
+        # case from gh-12092
+        (np.timedelta64(7, 's'),
+         np.timedelta64(3, 's'),
+         np.timedelta64(1, 's')),
+        # negative value cases
+        (np.timedelta64(3, 's'),
+         np.timedelta64(-2, 's'),
+         np.timedelta64(-1, 's')),
+        (np.timedelta64(-3, 's'),
+         np.timedelta64(2, 's'),
+         np.timedelta64(1, 's')),
+        # larger value cases
+        (np.timedelta64(17, 's'),
+         np.timedelta64(22, 's'),
+         np.timedelta64(17, 's')),
+        (np.timedelta64(22, 's'),
+         np.timedelta64(17, 's'),
+         np.timedelta64(5, 's')),
+        # different units
+        (np.timedelta64(1, 'm'),
+         np.timedelta64(57, 's'),
+         np.timedelta64(3, 's')),
+        (np.timedelta64(1, 'us'),
+         np.timedelta64(727, 'ns'),
+         np.timedelta64(273, 'ns')),
+        # NaT is propagated
+        (np.timedelta64('NaT'),
+         np.timedelta64(50, 'ns'),
+         np.timedelta64('NaT')),
+        # Y % M works
+        (np.timedelta64(2, 'Y'),
+         np.timedelta64(22, 'M'),
+         np.timedelta64(2, 'M')),
+        ])
+    def test_timedelta_modulus(self, val1, val2, expected):
+        assert_equal(val1 % val2, expected)
+
+    @pytest.mark.parametrize("val1, val2", [
+        # years and months sometimes can't be unambiguously
+        # divided for modulus operation
+        (np.timedelta64(7, 'Y'),
+         np.timedelta64(3, 's')),
+        (np.timedelta64(7, 'M'),
+         np.timedelta64(1, 'D')),
+        ])
+    def test_timedelta_modulus_error(self, val1, val2):
+        with assert_raises_regex(TypeError, "common metadata divisor"):
+            val1 % val2
+
+    def test_timedelta_modulus_div_by_zero(self):
+        with assert_warns(RuntimeWarning):
+            actual = np.timedelta64(10, 's') % np.timedelta64(0, 's')
+            assert_equal(actual, np.timedelta64('NaT'))
+
+    @pytest.mark.parametrize("val1, val2", [
+        # cases where one operand is not
+        # timedelta64
+        (np.timedelta64(7, 'Y'),
+         15,),
+        (7.5,
+         np.timedelta64(1, 'D')),
+        ])
+    def test_timedelta_modulus_type_resolution(self, val1, val2):
+        # NOTE: some of the operations may be supported
+        # in the future
+        with assert_raises_regex(TypeError,
+                                 "'remainder' cannot use operands with types"):
+            val1 % val2
+
+    def test_timedelta_arange_no_dtype(self):
+        d = np.array(5, dtype="m8[D]")
+        assert_equal(np.arange(d, d + 1), d)
+        assert_equal(np.arange(d), np.arange(0, d))
+
+    def test_datetime_maximum_reduce(self):
+        a = np.array(['2010-01-02', '1999-03-14', '1833-03'], dtype='M8[D]')
+        assert_equal(np.maximum.reduce(a).dtype, np.dtype('M8[D]'))
+        assert_equal(np.maximum.reduce(a),
+                     np.datetime64('2010-01-02'))
+
+        a = np.array([1, 4, 0, 7, 2], dtype='m8[s]')
+        assert_equal(np.maximum.reduce(a).dtype, np.dtype('m8[s]'))
+        assert_equal(np.maximum.reduce(a),
+                     np.timedelta64(7, 's'))
+
+    def test_datetime_busday_offset(self):
+        # First Monday in June
+        assert_equal(
+            np.busday_offset('2011-06', 0, roll='forward', weekmask='Mon'),
+            np.datetime64('2011-06-06'))
+        # Last Monday in June
+        assert_equal(
+            np.busday_offset('2011-07', -1, roll='forward', weekmask='Mon'),
+            np.datetime64('2011-06-27'))
+        assert_equal(
+            np.busday_offset('2011-07', -1, roll='forward', weekmask='Mon'),
+            np.datetime64('2011-06-27'))
+
+        # Default M-F business days, different roll modes
+        assert_equal(np.busday_offset('2010-08', 0, roll='backward'),
+                     np.datetime64('2010-07-30'))
+        assert_equal(np.busday_offset('2010-08', 0, roll='preceding'),
+                     np.datetime64('2010-07-30'))
+        assert_equal(np.busday_offset('2010-08', 0, roll='modifiedpreceding'),
+                     np.datetime64('2010-08-02'))
+        assert_equal(np.busday_offset('2010-08', 0, roll='modifiedfollowing'),
+                     np.datetime64('2010-08-02'))
+        assert_equal(np.busday_offset('2010-08', 0, roll='forward'),
+                     np.datetime64('2010-08-02'))
+        assert_equal(np.busday_offset('2010-08', 0, roll='following'),
+                     np.datetime64('2010-08-02'))
+        assert_equal(np.busday_offset('2010-10-30', 0, roll='following'),
+                     np.datetime64('2010-11-01'))
+        assert_equal(
+                np.busday_offset('2010-10-30', 0, roll='modifiedfollowing'),
+                np.datetime64('2010-10-29'))
+        assert_equal(
+                np.busday_offset('2010-10-30', 0, roll='modifiedpreceding'),
+                np.datetime64('2010-10-29'))
+        assert_equal(
+                np.busday_offset('2010-10-16', 0, roll='modifiedfollowing'),
+                np.datetime64('2010-10-18'))
+        assert_equal(
+                np.busday_offset('2010-10-16', 0, roll='modifiedpreceding'),
+                np.datetime64('2010-10-15'))
+        # roll='raise' by default
+        assert_raises(ValueError, np.busday_offset, '2011-06-04', 0)
+
+        # Bigger offset values
+        assert_equal(np.busday_offset('2006-02-01', 25),
+                     np.datetime64('2006-03-08'))
+        assert_equal(np.busday_offset('2006-03-08', -25),
+                     np.datetime64('2006-02-01'))
+        assert_equal(np.busday_offset('2007-02-25', 11, weekmask='SatSun'),
+                     np.datetime64('2007-04-07'))
+        assert_equal(np.busday_offset('2007-04-07', -11, weekmask='SatSun'),
+                     np.datetime64('2007-02-25'))
+
+        # NaT values when roll is not raise
+        assert_equal(np.busday_offset(np.datetime64('NaT'), 1, roll='nat'),
+                     np.datetime64('NaT'))
+        assert_equal(np.busday_offset(np.datetime64('NaT'), 1, roll='following'),
+                     np.datetime64('NaT'))
+        assert_equal(np.busday_offset(np.datetime64('NaT'), 1, roll='preceding'),
+                     np.datetime64('NaT'))
+
+    def test_datetime_busdaycalendar(self):
+        # Check that it removes NaT, duplicates, and weekends
+        # and sorts the result.
+        bdd = np.busdaycalendar(
+            holidays=['NaT', '2011-01-17', '2011-03-06', 'NaT',
+                       '2011-12-26', '2011-05-30', '2011-01-17'])
+        assert_equal(bdd.holidays,
+            np.array(['2011-01-17', '2011-05-30', '2011-12-26'], dtype='M8'))
+        # Default M-F weekmask
+        assert_equal(bdd.weekmask, np.array([1, 1, 1, 1, 1, 0, 0], dtype='?'))
+
+        # Check string weekmask with varying whitespace.
+        bdd = np.busdaycalendar(weekmask="Sun TueWed  Thu\tFri")
+        assert_equal(bdd.weekmask, np.array([0, 1, 1, 1, 1, 0, 1], dtype='?'))
+
+        # Check length 7 0/1 string
+        bdd = np.busdaycalendar(weekmask="0011001")
+        assert_equal(bdd.weekmask, np.array([0, 0, 1, 1, 0, 0, 1], dtype='?'))
+
+        # Check length 7 string weekmask.
+        bdd = np.busdaycalendar(weekmask="Mon Tue")
+        assert_equal(bdd.weekmask, np.array([1, 1, 0, 0, 0, 0, 0], dtype='?'))
+
+        # All-zeros weekmask should raise
+        assert_raises(ValueError, np.busdaycalendar, weekmask=[0, 0, 0, 0, 0, 0, 0])
+        # weekday names must be correct case
+        assert_raises(ValueError, np.busdaycalendar, weekmask="satsun")
+        # All-zeros weekmask should raise
+        assert_raises(ValueError, np.busdaycalendar, weekmask="")
+        # Invalid weekday name codes should raise
+        assert_raises(ValueError, np.busdaycalendar, weekmask="Mon Tue We")
+        assert_raises(ValueError, np.busdaycalendar, weekmask="Max")
+        assert_raises(ValueError, np.busdaycalendar, weekmask="Monday Tue")
+
+    def test_datetime_busday_holidays_offset(self):
+        # With exactly one holiday
+        assert_equal(
+            np.busday_offset('2011-11-10', 1, holidays=['2011-11-11']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-04', 5, holidays=['2011-11-11']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-10', 5, holidays=['2011-11-11']),
+            np.datetime64('2011-11-18'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1, holidays=['2011-11-11']),
+            np.datetime64('2011-11-10'))
+        assert_equal(
+            np.busday_offset('2011-11-18', -5, holidays=['2011-11-11']),
+            np.datetime64('2011-11-10'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -5, holidays=['2011-11-11']),
+            np.datetime64('2011-11-04'))
+        # With the holiday appearing twice
+        assert_equal(
+            np.busday_offset('2011-11-10', 1,
+                holidays=['2011-11-11', '2011-11-11']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1,
+                holidays=['2011-11-11', '2011-11-11']),
+            np.datetime64('2011-11-10'))
+        # With a NaT holiday
+        assert_equal(
+            np.busday_offset('2011-11-10', 1,
+                holidays=['2011-11-11', 'NaT']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1,
+                holidays=['NaT', '2011-11-11']),
+            np.datetime64('2011-11-10'))
+        # With another holiday after
+        assert_equal(
+            np.busday_offset('2011-11-10', 1,
+                holidays=['2011-11-11', '2011-11-24']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1,
+                holidays=['2011-11-11', '2011-11-24']),
+            np.datetime64('2011-11-10'))
+        # With another holiday before
+        assert_equal(
+            np.busday_offset('2011-11-10', 1,
+                holidays=['2011-10-10', '2011-11-11']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1,
+                holidays=['2011-10-10', '2011-11-11']),
+            np.datetime64('2011-11-10'))
+        # With another holiday before and after
+        assert_equal(
+            np.busday_offset('2011-11-10', 1,
+                holidays=['2011-10-10', '2011-11-11', '2011-11-24']),
+            np.datetime64('2011-11-14'))
+        assert_equal(
+            np.busday_offset('2011-11-14', -1,
+                holidays=['2011-10-10', '2011-11-11', '2011-11-24']),
+            np.datetime64('2011-11-10'))
+
+        # A bigger forward jump across more than one week/holiday
+        holidays = ['2011-10-10', '2011-11-11', '2011-11-24',
+                  '2011-12-25', '2011-05-30', '2011-02-21',
+                  '2011-12-26', '2012-01-02']
+        bdd = np.busdaycalendar(weekmask='1111100', holidays=holidays)
+        assert_equal(
+            np.busday_offset('2011-10-03', 4, holidays=holidays),
+            np.busday_offset('2011-10-03', 4))
+        assert_equal(
+            np.busday_offset('2011-10-03', 5, holidays=holidays),
+            np.busday_offset('2011-10-03', 5 + 1))
+        assert_equal(
+            np.busday_offset('2011-10-03', 27, holidays=holidays),
+            np.busday_offset('2011-10-03', 27 + 1))
+        assert_equal(
+            np.busday_offset('2011-10-03', 28, holidays=holidays),
+            np.busday_offset('2011-10-03', 28 + 2))
+        assert_equal(
+            np.busday_offset('2011-10-03', 35, holidays=holidays),
+            np.busday_offset('2011-10-03', 35 + 2))
+        assert_equal(
+            np.busday_offset('2011-10-03', 36, holidays=holidays),
+            np.busday_offset('2011-10-03', 36 + 3))
+        assert_equal(
+            np.busday_offset('2011-10-03', 56, holidays=holidays),
+            np.busday_offset('2011-10-03', 56 + 3))
+        assert_equal(
+            np.busday_offset('2011-10-03', 57, holidays=holidays),
+            np.busday_offset('2011-10-03', 57 + 4))
+        assert_equal(
+            np.busday_offset('2011-10-03', 60, holidays=holidays),
+            np.busday_offset('2011-10-03', 60 + 4))
+        assert_equal(
+            np.busday_offset('2011-10-03', 61, holidays=holidays),
+            np.busday_offset('2011-10-03', 61 + 5))
+        assert_equal(
+            np.busday_offset('2011-10-03', 61, busdaycal=bdd),
+            np.busday_offset('2011-10-03', 61 + 5))
+        # A bigger backward jump across more than one week/holiday
+        assert_equal(
+            np.busday_offset('2012-01-03', -1, holidays=holidays),
+            np.busday_offset('2012-01-03', -1 - 1))
+        assert_equal(
+            np.busday_offset('2012-01-03', -4, holidays=holidays),
+            np.busday_offset('2012-01-03', -4 - 1))
+        assert_equal(
+            np.busday_offset('2012-01-03', -5, holidays=holidays),
+            np.busday_offset('2012-01-03', -5 - 2))
+        assert_equal(
+            np.busday_offset('2012-01-03', -25, holidays=holidays),
+            np.busday_offset('2012-01-03', -25 - 2))
+        assert_equal(
+            np.busday_offset('2012-01-03', -26, holidays=holidays),
+            np.busday_offset('2012-01-03', -26 - 3))
+        assert_equal(
+            np.busday_offset('2012-01-03', -33, holidays=holidays),
+            np.busday_offset('2012-01-03', -33 - 3))
+        assert_equal(
+            np.busday_offset('2012-01-03', -34, holidays=holidays),
+            np.busday_offset('2012-01-03', -34 - 4))
+        assert_equal(
+            np.busday_offset('2012-01-03', -56, holidays=holidays),
+            np.busday_offset('2012-01-03', -56 - 4))
+        assert_equal(
+            np.busday_offset('2012-01-03', -57, holidays=holidays),
+            np.busday_offset('2012-01-03', -57 - 5))
+        assert_equal(
+            np.busday_offset('2012-01-03', -57, busdaycal=bdd),
+            np.busday_offset('2012-01-03', -57 - 5))
+
+        # Can't supply both a weekmask/holidays and busdaycal
+        assert_raises(ValueError, np.busday_offset, '2012-01-03', -15,
+                        weekmask='1111100', busdaycal=bdd)
+        assert_raises(ValueError, np.busday_offset, '2012-01-03', -15,
+                        holidays=holidays, busdaycal=bdd)
+
+        # Roll with the holidays
+        assert_equal(
+            np.busday_offset('2011-12-25', 0,
+                roll='forward', holidays=holidays),
+            np.datetime64('2011-12-27'))
+        assert_equal(
+            np.busday_offset('2011-12-26', 0,
+                roll='forward', holidays=holidays),
+            np.datetime64('2011-12-27'))
+        assert_equal(
+            np.busday_offset('2011-12-26', 0,
+                roll='backward', holidays=holidays),
+            np.datetime64('2011-12-23'))
+        assert_equal(
+            np.busday_offset('2012-02-27', 0,
+                roll='modifiedfollowing',
+                holidays=['2012-02-27', '2012-02-26', '2012-02-28',
+                          '2012-03-01', '2012-02-29']),
+            np.datetime64('2012-02-24'))
+        assert_equal(
+            np.busday_offset('2012-03-06', 0,
+                roll='modifiedpreceding',
+                holidays=['2012-03-02', '2012-03-03', '2012-03-01',
+                          '2012-03-05', '2012-03-07', '2012-03-06']),
+            np.datetime64('2012-03-08'))
+
+    def test_datetime_busday_holidays_count(self):
+        holidays = ['2011-01-01', '2011-10-10', '2011-11-11', '2011-11-24',
+                    '2011-12-25', '2011-05-30', '2011-02-21', '2011-01-17',
+                    '2011-12-26', '2012-01-02', '2011-02-21', '2011-05-30',
+                    '2011-07-01', '2011-07-04', '2011-09-05', '2011-10-10']
+        bdd = np.busdaycalendar(weekmask='1111100', holidays=holidays)
+
+        # Validate against busday_offset broadcast against
+        # a range of offsets
+        dates = np.busday_offset('2011-01-01', np.arange(366),
+                        roll='forward', busdaycal=bdd)
+        assert_equal(np.busday_count('2011-01-01', dates, busdaycal=bdd),
+                     np.arange(366))
+        # Returns negative value when reversed
+        assert_equal(np.busday_count(dates, '2011-01-01', busdaycal=bdd),
+                     -np.arange(366))
+
+        dates = np.busday_offset('2011-12-31', -np.arange(366),
+                        roll='forward', busdaycal=bdd)
+        assert_equal(np.busday_count(dates, '2011-12-31', busdaycal=bdd),
+                     np.arange(366))
+        # Returns negative value when reversed
+        assert_equal(np.busday_count('2011-12-31', dates, busdaycal=bdd),
+                     -np.arange(366))
+
+        # Can't supply both a weekmask/holidays and busdaycal
+        assert_raises(ValueError, np.busday_offset, '2012-01-03', '2012-02-03',
+                        weekmask='1111100', busdaycal=bdd)
+        assert_raises(ValueError, np.busday_offset, '2012-01-03', '2012-02-03',
+                        holidays=holidays, busdaycal=bdd)
+
+        # Number of Mondays in March 2011
+        assert_equal(np.busday_count('2011-03', '2011-04', weekmask='Mon'), 4)
+        # Returns negative value when reversed
+        assert_equal(np.busday_count('2011-04', '2011-03', weekmask='Mon'), -4)
+
+    def test_datetime_is_busday(self):
+        holidays = ['2011-01-01', '2011-10-10', '2011-11-11', '2011-11-24',
+                    '2011-12-25', '2011-05-30', '2011-02-21', '2011-01-17',
+                    '2011-12-26', '2012-01-02', '2011-02-21', '2011-05-30',
+                    '2011-07-01', '2011-07-04', '2011-09-05', '2011-10-10',
+                    'NaT']
+        bdd = np.busdaycalendar(weekmask='1111100', holidays=holidays)
+
+        # Weekend/weekday tests
+        assert_equal(np.is_busday('2011-01-01'), False)
+        assert_equal(np.is_busday('2011-01-02'), False)
+        assert_equal(np.is_busday('2011-01-03'), True)
+
+        # All the holidays are not business days
+        assert_equal(np.is_busday(holidays, busdaycal=bdd),
+                     np.zeros(len(holidays), dtype='?'))
+
+    def test_datetime_y2038(self):
+        # Test parsing on either side of the Y2038 boundary
+        a = np.datetime64('2038-01-19T03:14:07')
+        assert_equal(a.view(np.int64), 2**31 - 1)
+        a = np.datetime64('2038-01-19T03:14:08')
+        assert_equal(a.view(np.int64), 2**31)
+
+        # Test parsing on either side of the Y2038 boundary with
+        # a manually specified timezone offset
+        with assert_warns(DeprecationWarning):
+            a = np.datetime64('2038-01-19T04:14:07+0100')
+            assert_equal(a.view(np.int64), 2**31 - 1)
+        with assert_warns(DeprecationWarning):
+            a = np.datetime64('2038-01-19T04:14:08+0100')
+            assert_equal(a.view(np.int64), 2**31)
+
+        # Test parsing a date after Y2038
+        a = np.datetime64('2038-01-20T13:21:14')
+        assert_equal(str(a), '2038-01-20T13:21:14')
+
+    def test_isnat(self):
+        assert_(np.isnat(np.datetime64('NaT', 'ms')))
+        assert_(np.isnat(np.datetime64('NaT', 'ns')))
+        assert_(not np.isnat(np.datetime64('2038-01-19T03:14:07')))
+
+        assert_(np.isnat(np.timedelta64('NaT', "ms")))
+        assert_(not np.isnat(np.timedelta64(34, "ms")))
+
+        res = np.array([False, False, True])
+        for unit in ['Y', 'M', 'W', 'D',
+                     'h', 'm', 's', 'ms', 'us',
+                     'ns', 'ps', 'fs', 'as']:
+            arr = np.array([123, -321, "NaT"], dtype='<datetime64[%s]' % unit)
+            assert_equal(np.isnat(arr), res)
+            arr = np.array([123, -321, "NaT"], dtype='>datetime64[%s]' % unit)
+            assert_equal(np.isnat(arr), res)
+            arr = np.array([123, -321, "NaT"], dtype='<timedelta64[%s]' % unit)
+            assert_equal(np.isnat(arr), res)
+            arr = np.array([123, -321, "NaT"], dtype='>timedelta64[%s]' % unit)
+            assert_equal(np.isnat(arr), res)
+
+    def test_isnat_error(self):
+        # Test that only datetime dtype arrays are accepted
+        for t in np.typecodes["All"]:
+            if t in np.typecodes["Datetime"]:
+                continue
+            assert_raises(TypeError, np.isnat, np.zeros(10, t))
+
+    def test_isfinite_scalar(self):
+        assert_(not np.isfinite(np.datetime64('NaT', 'ms')))
+        assert_(not np.isfinite(np.datetime64('NaT', 'ns')))
+        assert_(np.isfinite(np.datetime64('2038-01-19T03:14:07')))
+
+        assert_(not np.isfinite(np.timedelta64('NaT', "ms")))
+        assert_(np.isfinite(np.timedelta64(34, "ms")))
+
+    @pytest.mark.parametrize('unit', ['Y', 'M', 'W', 'D', 'h', 'm', 's', 'ms',
+                                      'us', 'ns', 'ps', 'fs', 'as'])
+    @pytest.mark.parametrize('dstr', ['<datetime64[%s]', '>datetime64[%s]',
+                                      '<timedelta64[%s]', '>timedelta64[%s]'])
+    def test_isfinite_isinf_isnan_units(self, unit, dstr):
+        '''check isfinite, isinf, isnan for all units of <M, >M, <m, >m dtypes
+        '''
+        arr_val = [123, -321, "NaT"]
+        arr = np.array(arr_val,  dtype= dstr % unit)
+        pos = np.array([True, True,  False])
+        neg = np.array([False, False,  True])
+        false = np.array([False, False,  False])
+        assert_equal(np.isfinite(arr), pos)
+        assert_equal(np.isinf(arr), false)
+        assert_equal(np.isnan(arr), neg)
+
+    def test_assert_equal(self):
+        assert_raises(AssertionError, assert_equal,
+                np.datetime64('nat'), np.timedelta64('nat'))
+
+    def test_corecursive_input(self):
+        # construct a co-recursive list
+        a, b = [], []
+        a.append(b)
+        b.append(a)
+        obj_arr = np.array([None])
+        obj_arr[0] = a
+
+        # gh-11154: This shouldn't cause a C stack overflow
+        assert_raises(RecursionError, obj_arr.astype, 'M8')
+        assert_raises(RecursionError, obj_arr.astype, 'm8')
+
+    @pytest.mark.parametrize("time_unit", [
+        "Y", "M", "W", "D", "h", "m", "s", "ms", "us", "ns", "ps", "fs", "as",
+        # compound units
+        "10D", "2M",
+    ])
+    def test_limit_symmetry(self, time_unit):
+        """
+        Dates should have symmetric limits around the unix epoch at +/-np.int64
+        """
+        epoch = np.datetime64(0, time_unit)
+        latest = np.datetime64(np.iinfo(np.int64).max, time_unit)
+        earliest = np.datetime64(-np.iinfo(np.int64).max, time_unit)
+
+        # above should not have overflowed
+        assert earliest < epoch < latest
+
+    @pytest.mark.parametrize("time_unit", [
+        "Y", "M",
+        pytest.param("W", marks=pytest.mark.xfail(reason="gh-13197")),
+        "D", "h", "m",
+        "s", "ms", "us", "ns", "ps", "fs", "as",
+        pytest.param("10D", marks=pytest.mark.xfail(reason="similar to gh-13197")),
+    ])
+    @pytest.mark.parametrize("sign", [-1, 1])
+    def test_limit_str_roundtrip(self, time_unit, sign):
+        """
+        Limits should roundtrip when converted to strings.
+
+        This tests the conversion to and from npy_datetimestruct.
+        """
+        # TODO: add absolute (gold standard) time span limit strings
+        limit = np.datetime64(np.iinfo(np.int64).max * sign, time_unit)
+
+        # Convert to string and back. Explicit unit needed since the day and
+        # week reprs are not distinguishable.
+        limit_via_str = np.datetime64(str(limit), time_unit)
+        assert limit_via_str == limit
+
+
+class TestDateTimeData:
+
+    def test_basic(self):
+        a = np.array(['1980-03-23'], dtype=np.datetime64)
+        assert_equal(np.datetime_data(a.dtype), ('D', 1))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_defchararray.py b/venv/Lib/site-packages/numpy/core/tests/test_defchararray.py
new file mode 100644
index 000000000..bbb94f7d3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_defchararray.py
@@ -0,0 +1,667 @@
+
+import numpy as np
+from numpy.core.multiarray import _vec_string
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_raises,
+    assert_raises_regex
+    )
+
+kw_unicode_true = {'unicode': True}  # make 2to3 work properly
+kw_unicode_false = {'unicode': False}
+
+class TestBasic:
+    def test_from_object_array(self):
+        A = np.array([['abc', 2],
+                      ['long   ', '0123456789']], dtype='O')
+        B = np.char.array(A)
+        assert_equal(B.dtype.itemsize, 10)
+        assert_array_equal(B, [[b'abc', b'2'],
+                               [b'long', b'0123456789']])
+
+    def test_from_object_array_unicode(self):
+        A = np.array([['abc', u'Sigma \u03a3'],
+                      ['long   ', '0123456789']], dtype='O')
+        assert_raises(ValueError, np.char.array, (A,))
+        B = np.char.array(A, **kw_unicode_true)
+        assert_equal(B.dtype.itemsize, 10 * np.array('a', 'U').dtype.itemsize)
+        assert_array_equal(B, [['abc', u'Sigma \u03a3'],
+                               ['long', '0123456789']])
+
+    def test_from_string_array(self):
+        A = np.array([[b'abc', b'foo'],
+                      [b'long   ', b'0123456789']])
+        assert_equal(A.dtype.type, np.string_)
+        B = np.char.array(A)
+        assert_array_equal(B, A)
+        assert_equal(B.dtype, A.dtype)
+        assert_equal(B.shape, A.shape)
+        B[0, 0] = 'changed'
+        assert_(B[0, 0] != A[0, 0])
+        C = np.char.asarray(A)
+        assert_array_equal(C, A)
+        assert_equal(C.dtype, A.dtype)
+        C[0, 0] = 'changed again'
+        assert_(C[0, 0] != B[0, 0])
+        assert_(C[0, 0] == A[0, 0])
+
+    def test_from_unicode_array(self):
+        A = np.array([['abc', u'Sigma \u03a3'],
+                      ['long   ', '0123456789']])
+        assert_equal(A.dtype.type, np.unicode_)
+        B = np.char.array(A)
+        assert_array_equal(B, A)
+        assert_equal(B.dtype, A.dtype)
+        assert_equal(B.shape, A.shape)
+        B = np.char.array(A, **kw_unicode_true)
+        assert_array_equal(B, A)
+        assert_equal(B.dtype, A.dtype)
+        assert_equal(B.shape, A.shape)
+
+        def fail():
+            np.char.array(A, **kw_unicode_false)
+
+        assert_raises(UnicodeEncodeError, fail)
+
+    def test_unicode_upconvert(self):
+        A = np.char.array(['abc'])
+        B = np.char.array([u'\u03a3'])
+        assert_(issubclass((A + B).dtype.type, np.unicode_))
+
+    def test_from_string(self):
+        A = np.char.array(b'abc')
+        assert_equal(len(A), 1)
+        assert_equal(len(A[0]), 3)
+        assert_(issubclass(A.dtype.type, np.string_))
+
+    def test_from_unicode(self):
+        A = np.char.array(u'\u03a3')
+        assert_equal(len(A), 1)
+        assert_equal(len(A[0]), 1)
+        assert_equal(A.itemsize, 4)
+        assert_(issubclass(A.dtype.type, np.unicode_))
+
+class TestVecString:
+    def test_non_existent_method(self):
+
+        def fail():
+            _vec_string('a', np.string_, 'bogus')
+
+        assert_raises(AttributeError, fail)
+
+    def test_non_string_array(self):
+
+        def fail():
+            _vec_string(1, np.string_, 'strip')
+
+        assert_raises(TypeError, fail)
+
+    def test_invalid_args_tuple(self):
+
+        def fail():
+            _vec_string(['a'], np.string_, 'strip', 1)
+
+        assert_raises(TypeError, fail)
+
+    def test_invalid_type_descr(self):
+
+        def fail():
+            _vec_string(['a'], 'BOGUS', 'strip')
+
+        assert_raises(TypeError, fail)
+
+    def test_invalid_function_args(self):
+
+        def fail():
+            _vec_string(['a'], np.string_, 'strip', (1,))
+
+        assert_raises(TypeError, fail)
+
+    def test_invalid_result_type(self):
+
+        def fail():
+            _vec_string(['a'], np.int_, 'strip')
+
+        assert_raises(TypeError, fail)
+
+    def test_broadcast_error(self):
+
+        def fail():
+            _vec_string([['abc', 'def']], np.int_, 'find', (['a', 'd', 'j'],))
+
+        assert_raises(ValueError, fail)
+
+
+class TestWhitespace:
+    def setup(self):
+        self.A = np.array([['abc ', '123  '],
+                           ['789 ', 'xyz ']]).view(np.chararray)
+        self.B = np.array([['abc', '123'],
+                           ['789', 'xyz']]).view(np.chararray)
+
+    def test1(self):
+        assert_(np.all(self.A == self.B))
+        assert_(np.all(self.A >= self.B))
+        assert_(np.all(self.A <= self.B))
+        assert_(not np.any(self.A > self.B))
+        assert_(not np.any(self.A < self.B))
+        assert_(not np.any(self.A != self.B))
+
+class TestChar:
+    def setup(self):
+        self.A = np.array('abc1', dtype='c').view(np.chararray)
+
+    def test_it(self):
+        assert_equal(self.A.shape, (4,))
+        assert_equal(self.A.upper()[:2].tobytes(), b'AB')
+
+class TestComparisons:
+    def setup(self):
+        self.A = np.array([['abc', '123'],
+                           ['789', 'xyz']]).view(np.chararray)
+        self.B = np.array([['efg', '123  '],
+                           ['051', 'tuv']]).view(np.chararray)
+
+    def test_not_equal(self):
+        assert_array_equal((self.A != self.B), [[True, False], [True, True]])
+
+    def test_equal(self):
+        assert_array_equal((self.A == self.B), [[False, True], [False, False]])
+
+    def test_greater_equal(self):
+        assert_array_equal((self.A >= self.B), [[False, True], [True, True]])
+
+    def test_less_equal(self):
+        assert_array_equal((self.A <= self.B), [[True, True], [False, False]])
+
+    def test_greater(self):
+        assert_array_equal((self.A > self.B), [[False, False], [True, True]])
+
+    def test_less(self):
+        assert_array_equal((self.A < self.B), [[True, False], [False, False]])
+
+class TestComparisonsMixed1(TestComparisons):
+    """Ticket #1276"""
+
+    def setup(self):
+        TestComparisons.setup(self)
+        self.B = np.array([['efg', '123  '],
+                           ['051', 'tuv']], np.unicode_).view(np.chararray)
+
+class TestComparisonsMixed2(TestComparisons):
+    """Ticket #1276"""
+
+    def setup(self):
+        TestComparisons.setup(self)
+        self.A = np.array([['abc', '123'],
+                           ['789', 'xyz']], np.unicode_).view(np.chararray)
+
+class TestInformation:
+    def setup(self):
+        self.A = np.array([[' abc ', ''],
+                           ['12345', 'MixedCase'],
+                           ['123 \t 345 \0 ', 'UPPER']]).view(np.chararray)
+        self.B = np.array([[u' \u03a3 ', u''],
+                           [u'12345', u'MixedCase'],
+                           [u'123 \t 345 \0 ', u'UPPER']]).view(np.chararray)
+
+    def test_len(self):
+        assert_(issubclass(np.char.str_len(self.A).dtype.type, np.integer))
+        assert_array_equal(np.char.str_len(self.A), [[5, 0], [5, 9], [12, 5]])
+        assert_array_equal(np.char.str_len(self.B), [[3, 0], [5, 9], [12, 5]])
+
+    def test_count(self):
+        assert_(issubclass(self.A.count('').dtype.type, np.integer))
+        assert_array_equal(self.A.count('a'), [[1, 0], [0, 1], [0, 0]])
+        assert_array_equal(self.A.count('123'), [[0, 0], [1, 0], [1, 0]])
+        # Python doesn't seem to like counting NULL characters
+        # assert_array_equal(self.A.count('\0'), [[0, 0], [0, 0], [1, 0]])
+        assert_array_equal(self.A.count('a', 0, 2), [[1, 0], [0, 0], [0, 0]])
+        assert_array_equal(self.B.count('a'), [[0, 0], [0, 1], [0, 0]])
+        assert_array_equal(self.B.count('123'), [[0, 0], [1, 0], [1, 0]])
+        # assert_array_equal(self.B.count('\0'), [[0, 0], [0, 0], [1, 0]])
+
+    def test_endswith(self):
+        assert_(issubclass(self.A.endswith('').dtype.type, np.bool_))
+        assert_array_equal(self.A.endswith(' '), [[1, 0], [0, 0], [1, 0]])
+        assert_array_equal(self.A.endswith('3', 0, 3), [[0, 0], [1, 0], [1, 0]])
+
+        def fail():
+            self.A.endswith('3', 'fdjk')
+
+        assert_raises(TypeError, fail)
+
+    def test_find(self):
+        assert_(issubclass(self.A.find('a').dtype.type, np.integer))
+        assert_array_equal(self.A.find('a'), [[1, -1], [-1, 6], [-1, -1]])
+        assert_array_equal(self.A.find('3'), [[-1, -1], [2, -1], [2, -1]])
+        assert_array_equal(self.A.find('a', 0, 2), [[1, -1], [-1, -1], [-1, -1]])
+        assert_array_equal(self.A.find(['1', 'P']), [[-1, -1], [0, -1], [0, 1]])
+
+    def test_index(self):
+
+        def fail():
+            self.A.index('a')
+
+        assert_raises(ValueError, fail)
+        assert_(np.char.index('abcba', 'b') == 1)
+        assert_(issubclass(np.char.index('abcba', 'b').dtype.type, np.integer))
+
+    def test_isalnum(self):
+        assert_(issubclass(self.A.isalnum().dtype.type, np.bool_))
+        assert_array_equal(self.A.isalnum(), [[False, False], [True, True], [False, True]])
+
+    def test_isalpha(self):
+        assert_(issubclass(self.A.isalpha().dtype.type, np.bool_))
+        assert_array_equal(self.A.isalpha(), [[False, False], [False, True], [False, True]])
+
+    def test_isdigit(self):
+        assert_(issubclass(self.A.isdigit().dtype.type, np.bool_))
+        assert_array_equal(self.A.isdigit(), [[False, False], [True, False], [False, False]])
+
+    def test_islower(self):
+        assert_(issubclass(self.A.islower().dtype.type, np.bool_))
+        assert_array_equal(self.A.islower(), [[True, False], [False, False], [False, False]])
+
+    def test_isspace(self):
+        assert_(issubclass(self.A.isspace().dtype.type, np.bool_))
+        assert_array_equal(self.A.isspace(), [[False, False], [False, False], [False, False]])
+
+    def test_istitle(self):
+        assert_(issubclass(self.A.istitle().dtype.type, np.bool_))
+        assert_array_equal(self.A.istitle(), [[False, False], [False, False], [False, False]])
+
+    def test_isupper(self):
+        assert_(issubclass(self.A.isupper().dtype.type, np.bool_))
+        assert_array_equal(self.A.isupper(), [[False, False], [False, False], [False, True]])
+
+    def test_rfind(self):
+        assert_(issubclass(self.A.rfind('a').dtype.type, np.integer))
+        assert_array_equal(self.A.rfind('a'), [[1, -1], [-1, 6], [-1, -1]])
+        assert_array_equal(self.A.rfind('3'), [[-1, -1], [2, -1], [6, -1]])
+        assert_array_equal(self.A.rfind('a', 0, 2), [[1, -1], [-1, -1], [-1, -1]])
+        assert_array_equal(self.A.rfind(['1', 'P']), [[-1, -1], [0, -1], [0, 2]])
+
+    def test_rindex(self):
+
+        def fail():
+            self.A.rindex('a')
+
+        assert_raises(ValueError, fail)
+        assert_(np.char.rindex('abcba', 'b') == 3)
+        assert_(issubclass(np.char.rindex('abcba', 'b').dtype.type, np.integer))
+
+    def test_startswith(self):
+        assert_(issubclass(self.A.startswith('').dtype.type, np.bool_))
+        assert_array_equal(self.A.startswith(' '), [[1, 0], [0, 0], [0, 0]])
+        assert_array_equal(self.A.startswith('1', 0, 3), [[0, 0], [1, 0], [1, 0]])
+
+        def fail():
+            self.A.startswith('3', 'fdjk')
+
+        assert_raises(TypeError, fail)
+
+
+class TestMethods:
+    def setup(self):
+        self.A = np.array([[' abc ', ''],
+                           ['12345', 'MixedCase'],
+                           ['123 \t 345 \0 ', 'UPPER']],
+                          dtype='S').view(np.chararray)
+        self.B = np.array([[u' \u03a3 ', u''],
+                           [u'12345', u'MixedCase'],
+                           [u'123 \t 345 \0 ', u'UPPER']]).view(np.chararray)
+
+    def test_capitalize(self):
+        tgt = [[b' abc ', b''],
+               [b'12345', b'Mixedcase'],
+               [b'123 \t 345 \0 ', b'Upper']]
+        assert_(issubclass(self.A.capitalize().dtype.type, np.string_))
+        assert_array_equal(self.A.capitalize(), tgt)
+
+        tgt = [[u' \u03c3 ', ''],
+               ['12345', 'Mixedcase'],
+               ['123 \t 345 \0 ', 'Upper']]
+        assert_(issubclass(self.B.capitalize().dtype.type, np.unicode_))
+        assert_array_equal(self.B.capitalize(), tgt)
+
+    def test_center(self):
+        assert_(issubclass(self.A.center(10).dtype.type, np.string_))
+        C = self.A.center([10, 20])
+        assert_array_equal(np.char.str_len(C), [[10, 20], [10, 20], [12, 20]])
+
+        C = self.A.center(20, b'#')
+        assert_(np.all(C.startswith(b'#')))
+        assert_(np.all(C.endswith(b'#')))
+
+        C = np.char.center(b'FOO', [[10, 20], [15, 8]])
+        tgt = [[b'   FOO    ', b'        FOO         '],
+               [b'      FOO      ', b'  FOO   ']]
+        assert_(issubclass(C.dtype.type, np.string_))
+        assert_array_equal(C, tgt)
+
+    def test_decode(self):
+        A = np.char.array([b'\\u03a3'])
+        assert_(A.decode('unicode-escape')[0] == '\u03a3')
+
+    def test_encode(self):
+        B = self.B.encode('unicode_escape')
+        assert_(B[0][0] == str(' \\u03a3 ').encode('latin1'))
+
+    def test_expandtabs(self):
+        T = self.A.expandtabs()
+        assert_(T[2, 0] == b'123      345 \0')
+
+    def test_join(self):
+        # NOTE: list(b'123') == [49, 50, 51]
+        #       so that b','.join(b'123') results to an error on Py3
+        A0 = self.A.decode('ascii')
+
+        A = np.char.join([',', '#'], A0)
+        assert_(issubclass(A.dtype.type, np.unicode_))
+        tgt = np.array([[' ,a,b,c, ', ''],
+                        ['1,2,3,4,5', 'M#i#x#e#d#C#a#s#e'],
+                        ['1,2,3, ,\t, ,3,4,5, ,\x00, ', 'U#P#P#E#R']])
+        assert_array_equal(np.char.join([',', '#'], A0), tgt)
+
+    def test_ljust(self):
+        assert_(issubclass(self.A.ljust(10).dtype.type, np.string_))
+
+        C = self.A.ljust([10, 20])
+        assert_array_equal(np.char.str_len(C), [[10, 20], [10, 20], [12, 20]])
+
+        C = self.A.ljust(20, b'#')
+        assert_array_equal(C.startswith(b'#'), [
+                [False, True], [False, False], [False, False]])
+        assert_(np.all(C.endswith(b'#')))
+
+        C = np.char.ljust(b'FOO', [[10, 20], [15, 8]])
+        tgt = [[b'FOO       ', b'FOO                 '],
+               [b'FOO            ', b'FOO     ']]
+        assert_(issubclass(C.dtype.type, np.string_))
+        assert_array_equal(C, tgt)
+
+    def test_lower(self):
+        tgt = [[b' abc ', b''],
+               [b'12345', b'mixedcase'],
+               [b'123 \t 345 \0 ', b'upper']]
+        assert_(issubclass(self.A.lower().dtype.type, np.string_))
+        assert_array_equal(self.A.lower(), tgt)
+
+        tgt = [[u' \u03c3 ', u''],
+               [u'12345', u'mixedcase'],
+               [u'123 \t 345 \0 ', u'upper']]
+        assert_(issubclass(self.B.lower().dtype.type, np.unicode_))
+        assert_array_equal(self.B.lower(), tgt)
+
+    def test_lstrip(self):
+        tgt = [[b'abc ', b''],
+               [b'12345', b'MixedCase'],
+               [b'123 \t 345 \0 ', b'UPPER']]
+        assert_(issubclass(self.A.lstrip().dtype.type, np.string_))
+        assert_array_equal(self.A.lstrip(), tgt)
+
+        tgt = [[b' abc', b''],
+               [b'2345', b'ixedCase'],
+               [b'23 \t 345 \x00', b'UPPER']]
+        assert_array_equal(self.A.lstrip([b'1', b'M']), tgt)
+
+        tgt = [[u'\u03a3 ', ''],
+               ['12345', 'MixedCase'],
+               ['123 \t 345 \0 ', 'UPPER']]
+        assert_(issubclass(self.B.lstrip().dtype.type, np.unicode_))
+        assert_array_equal(self.B.lstrip(), tgt)
+
+    def test_partition(self):
+        P = self.A.partition([b'3', b'M'])
+        tgt = [[(b' abc ', b'', b''), (b'', b'', b'')],
+               [(b'12', b'3', b'45'), (b'', b'M', b'ixedCase')],
+               [(b'12', b'3', b' \t 345 \0 '), (b'UPPER', b'', b'')]]
+        assert_(issubclass(P.dtype.type, np.string_))
+        assert_array_equal(P, tgt)
+
+    def test_replace(self):
+        R = self.A.replace([b'3', b'a'],
+                           [b'##########', b'@'])
+        tgt = [[b' abc ', b''],
+               [b'12##########45', b'MixedC@se'],
+               [b'12########## \t ##########45 \x00', b'UPPER']]
+        assert_(issubclass(R.dtype.type, np.string_))
+        assert_array_equal(R, tgt)
+
+    def test_rjust(self):
+        assert_(issubclass(self.A.rjust(10).dtype.type, np.string_))
+
+        C = self.A.rjust([10, 20])
+        assert_array_equal(np.char.str_len(C), [[10, 20], [10, 20], [12, 20]])
+
+        C = self.A.rjust(20, b'#')
+        assert_(np.all(C.startswith(b'#')))
+        assert_array_equal(C.endswith(b'#'),
+                           [[False, True], [False, False], [False, False]])
+
+        C = np.char.rjust(b'FOO', [[10, 20], [15, 8]])
+        tgt = [[b'       FOO', b'                 FOO'],
+               [b'            FOO', b'     FOO']]
+        assert_(issubclass(C.dtype.type, np.string_))
+        assert_array_equal(C, tgt)
+
+    def test_rpartition(self):
+        P = self.A.rpartition([b'3', b'M'])
+        tgt = [[(b'', b'', b' abc '), (b'', b'', b'')],
+               [(b'12', b'3', b'45'), (b'', b'M', b'ixedCase')],
+               [(b'123 \t ', b'3', b'45 \0 '), (b'', b'', b'UPPER')]]
+        assert_(issubclass(P.dtype.type, np.string_))
+        assert_array_equal(P, tgt)
+
+    def test_rsplit(self):
+        A = self.A.rsplit(b'3')
+        tgt = [[[b' abc '], [b'']],
+               [[b'12', b'45'], [b'MixedCase']],
+               [[b'12', b' \t ', b'45 \x00 '], [b'UPPER']]]
+        assert_(issubclass(A.dtype.type, np.object_))
+        assert_equal(A.tolist(), tgt)
+
+    def test_rstrip(self):
+        assert_(issubclass(self.A.rstrip().dtype.type, np.string_))
+
+        tgt = [[b' abc', b''],
+               [b'12345', b'MixedCase'],
+               [b'123 \t 345', b'UPPER']]
+        assert_array_equal(self.A.rstrip(), tgt)
+
+        tgt = [[b' abc ', b''],
+               [b'1234', b'MixedCase'],
+               [b'123 \t 345 \x00', b'UPP']
+               ]
+        assert_array_equal(self.A.rstrip([b'5', b'ER']), tgt)
+
+        tgt = [[u' \u03a3', ''],
+               ['12345', 'MixedCase'],
+               ['123 \t 345', 'UPPER']]
+        assert_(issubclass(self.B.rstrip().dtype.type, np.unicode_))
+        assert_array_equal(self.B.rstrip(), tgt)
+
+    def test_strip(self):
+        tgt = [[b'abc', b''],
+               [b'12345', b'MixedCase'],
+               [b'123 \t 345', b'UPPER']]
+        assert_(issubclass(self.A.strip().dtype.type, np.string_))
+        assert_array_equal(self.A.strip(), tgt)
+
+        tgt = [[b' abc ', b''],
+               [b'234', b'ixedCas'],
+               [b'23 \t 345 \x00', b'UPP']]
+        assert_array_equal(self.A.strip([b'15', b'EReM']), tgt)
+
+        tgt = [[u'\u03a3', ''],
+               ['12345', 'MixedCase'],
+               ['123 \t 345', 'UPPER']]
+        assert_(issubclass(self.B.strip().dtype.type, np.unicode_))
+        assert_array_equal(self.B.strip(), tgt)
+
+    def test_split(self):
+        A = self.A.split(b'3')
+        tgt = [
+               [[b' abc '], [b'']],
+               [[b'12', b'45'], [b'MixedCase']],
+               [[b'12', b' \t ', b'45 \x00 '], [b'UPPER']]]
+        assert_(issubclass(A.dtype.type, np.object_))
+        assert_equal(A.tolist(), tgt)
+
+    def test_splitlines(self):
+        A = np.char.array(['abc\nfds\nwer']).splitlines()
+        assert_(issubclass(A.dtype.type, np.object_))
+        assert_(A.shape == (1,))
+        assert_(len(A[0]) == 3)
+
+    def test_swapcase(self):
+        tgt = [[b' ABC ', b''],
+               [b'12345', b'mIXEDcASE'],
+               [b'123 \t 345 \0 ', b'upper']]
+        assert_(issubclass(self.A.swapcase().dtype.type, np.string_))
+        assert_array_equal(self.A.swapcase(), tgt)
+
+        tgt = [[u' \u03c3 ', u''],
+               [u'12345', u'mIXEDcASE'],
+               [u'123 \t 345 \0 ', u'upper']]
+        assert_(issubclass(self.B.swapcase().dtype.type, np.unicode_))
+        assert_array_equal(self.B.swapcase(), tgt)
+
+    def test_title(self):
+        tgt = [[b' Abc ', b''],
+               [b'12345', b'Mixedcase'],
+               [b'123 \t 345 \0 ', b'Upper']]
+        assert_(issubclass(self.A.title().dtype.type, np.string_))
+        assert_array_equal(self.A.title(), tgt)
+
+        tgt = [[u' \u03a3 ', u''],
+               [u'12345', u'Mixedcase'],
+               [u'123 \t 345 \0 ', u'Upper']]
+        assert_(issubclass(self.B.title().dtype.type, np.unicode_))
+        assert_array_equal(self.B.title(), tgt)
+
+    def test_upper(self):
+        tgt = [[b' ABC ', b''],
+               [b'12345', b'MIXEDCASE'],
+               [b'123 \t 345 \0 ', b'UPPER']]
+        assert_(issubclass(self.A.upper().dtype.type, np.string_))
+        assert_array_equal(self.A.upper(), tgt)
+
+        tgt = [[u' \u03a3 ', u''],
+               [u'12345', u'MIXEDCASE'],
+               [u'123 \t 345 \0 ', u'UPPER']]
+        assert_(issubclass(self.B.upper().dtype.type, np.unicode_))
+        assert_array_equal(self.B.upper(), tgt)
+
+    def test_isnumeric(self):
+
+        def fail():
+            self.A.isnumeric()
+
+        assert_raises(TypeError, fail)
+        assert_(issubclass(self.B.isnumeric().dtype.type, np.bool_))
+        assert_array_equal(self.B.isnumeric(), [
+                [False, False], [True, False], [False, False]])
+
+    def test_isdecimal(self):
+
+        def fail():
+            self.A.isdecimal()
+
+        assert_raises(TypeError, fail)
+        assert_(issubclass(self.B.isdecimal().dtype.type, np.bool_))
+        assert_array_equal(self.B.isdecimal(), [
+                [False, False], [True, False], [False, False]])
+
+
+class TestOperations:
+    def setup(self):
+        self.A = np.array([['abc', '123'],
+                           ['789', 'xyz']]).view(np.chararray)
+        self.B = np.array([['efg', '456'],
+                           ['051', 'tuv']]).view(np.chararray)
+
+    def test_add(self):
+        AB = np.array([['abcefg', '123456'],
+                       ['789051', 'xyztuv']]).view(np.chararray)
+        assert_array_equal(AB, (self.A + self.B))
+        assert_(len((self.A + self.B)[0][0]) == 6)
+
+    def test_radd(self):
+        QA = np.array([['qabc', 'q123'],
+                       ['q789', 'qxyz']]).view(np.chararray)
+        assert_array_equal(QA, ('q' + self.A))
+
+    def test_mul(self):
+        A = self.A
+        for r in (2, 3, 5, 7, 197):
+            Ar = np.array([[A[0, 0]*r, A[0, 1]*r],
+                           [A[1, 0]*r, A[1, 1]*r]]).view(np.chararray)
+
+            assert_array_equal(Ar, (self.A * r))
+
+        for ob in [object(), 'qrs']:
+            with assert_raises_regex(ValueError,
+                                     'Can only multiply by integers'):
+                A*ob
+
+    def test_rmul(self):
+        A = self.A
+        for r in (2, 3, 5, 7, 197):
+            Ar = np.array([[A[0, 0]*r, A[0, 1]*r],
+                           [A[1, 0]*r, A[1, 1]*r]]).view(np.chararray)
+            assert_array_equal(Ar, (r * self.A))
+
+        for ob in [object(), 'qrs']:
+            with assert_raises_regex(ValueError,
+                                     'Can only multiply by integers'):
+                ob * A
+
+    def test_mod(self):
+        """Ticket #856"""
+        F = np.array([['%d', '%f'], ['%s', '%r']]).view(np.chararray)
+        C = np.array([[3, 7], [19, 1]])
+        FC = np.array([['3', '7.000000'],
+                       ['19', '1']]).view(np.chararray)
+        assert_array_equal(FC, F % C)
+
+        A = np.array([['%.3f', '%d'], ['%s', '%r']]).view(np.chararray)
+        A1 = np.array([['1.000', '1'], ['1', '1']]).view(np.chararray)
+        assert_array_equal(A1, (A % 1))
+
+        A2 = np.array([['1.000', '2'], ['3', '4']]).view(np.chararray)
+        assert_array_equal(A2, (A % [[1, 2], [3, 4]]))
+
+    def test_rmod(self):
+        assert_(("%s" % self.A) == str(self.A))
+        assert_(("%r" % self.A) == repr(self.A))
+
+        for ob in [42, object()]:
+            with assert_raises_regex(
+                    TypeError, "unsupported operand type.* and 'chararray'"):
+                ob % self.A
+
+    def test_slice(self):
+        """Regression test for https://github.com/numpy/numpy/issues/5982"""
+
+        arr = np.array([['abc ', 'def '], ['geh ', 'ijk ']],
+                       dtype='S4').view(np.chararray)
+        sl1 = arr[:]
+        assert_array_equal(sl1, arr)
+        assert_(sl1.base is arr)
+        assert_(sl1.base.base is arr.base)
+
+        sl2 = arr[:, :]
+        assert_array_equal(sl2, arr)
+        assert_(sl2.base is arr)
+        assert_(sl2.base.base is arr.base)
+
+        assert_(arr[0, 0] == b'abc')
+
+
+def test_empty_indexing():
+    """Regression test for ticket 1948."""
+    # Check that indexing a chararray with an empty list/array returns an
+    # empty chararray instead of a chararray with a single empty string in it.
+    s = np.chararray((4,))
+    assert_(s[[]].size == 0)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_deprecations.py b/venv/Lib/site-packages/numpy/core/tests/test_deprecations.py
new file mode 100644
index 000000000..82d24e0f7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_deprecations.py
@@ -0,0 +1,620 @@
+"""
+Tests related to deprecation warnings. Also a convenient place
+to document how deprecations should eventually be turned into errors.
+
+"""
+import datetime
+import operator
+import warnings
+import pytest
+import tempfile
+import re
+
+import numpy as np
+from numpy.testing import (
+    assert_raises, assert_warns, assert_, assert_array_equal
+    )
+
+from numpy.core._multiarray_tests import fromstring_null_term_c_api
+
+try:
+    import pytz
+    _has_pytz = True
+except ImportError:
+    _has_pytz = False
+
+
+class _DeprecationTestCase:
+    # Just as warning: warnings uses re.match, so the start of this message
+    # must match.
+    message = ''
+    warning_cls = DeprecationWarning
+
+    def setup(self):
+        self.warn_ctx = warnings.catch_warnings(record=True)
+        self.log = self.warn_ctx.__enter__()
+
+        # Do *not* ignore other DeprecationWarnings. Ignoring warnings
+        # can give very confusing results because of
+        # https://bugs.python.org/issue4180 and it is probably simplest to
+        # try to keep the tests cleanly giving only the right warning type.
+        # (While checking them set to "error" those are ignored anyway)
+        # We still have them show up, because otherwise they would be raised
+        warnings.filterwarnings("always", category=self.warning_cls)
+        warnings.filterwarnings("always", message=self.message,
+                                category=self.warning_cls)
+
+    def teardown(self):
+        self.warn_ctx.__exit__()
+
+    def assert_deprecated(self, function, num=1, ignore_others=False,
+                          function_fails=False,
+                          exceptions=np._NoValue,
+                          args=(), kwargs={}):
+        """Test if DeprecationWarnings are given and raised.
+
+        This first checks if the function when called gives `num`
+        DeprecationWarnings, after that it tries to raise these
+        DeprecationWarnings and compares them with `exceptions`.
+        The exceptions can be different for cases where this code path
+        is simply not anticipated and the exception is replaced.
+
+        Parameters
+        ----------
+        function : callable
+            The function to test
+        num : int
+            Number of DeprecationWarnings to expect. This should normally be 1.
+        ignore_others : bool
+            Whether warnings of the wrong type should be ignored (note that
+            the message is not checked)
+        function_fails : bool
+            If the function would normally fail, setting this will check for
+            warnings inside a try/except block.
+        exceptions : Exception or tuple of Exceptions
+            Exception to expect when turning the warnings into an error.
+            The default checks for DeprecationWarnings. If exceptions is
+            empty the function is expected to run successfully.
+        args : tuple
+            Arguments for `function`
+        kwargs : dict
+            Keyword arguments for `function`
+        """
+        # reset the log
+        self.log[:] = []
+
+        if exceptions is np._NoValue:
+            exceptions = (self.warning_cls,)
+
+        try:
+            function(*args, **kwargs)
+        except (Exception if function_fails else tuple()):
+            pass
+
+        # just in case, clear the registry
+        num_found = 0
+        for warning in self.log:
+            if warning.category is self.warning_cls:
+                num_found += 1
+            elif not ignore_others:
+                raise AssertionError(
+                        "expected %s but got: %s" %
+                        (self.warning_cls.__name__, warning.category))
+        if num is not None and num_found != num:
+            msg = "%i warnings found but %i expected." % (len(self.log), num)
+            lst = [str(w) for w in self.log]
+            raise AssertionError("\n".join([msg] + lst))
+
+        with warnings.catch_warnings():
+            warnings.filterwarnings("error", message=self.message,
+                                    category=self.warning_cls)
+            try:
+                function(*args, **kwargs)
+                if exceptions != tuple():
+                    raise AssertionError(
+                            "No error raised during function call")
+            except exceptions:
+                if exceptions == tuple():
+                    raise AssertionError(
+                            "Error raised during function call")
+
+    def assert_not_deprecated(self, function, args=(), kwargs={}):
+        """Test that warnings are not raised.
+
+        This is just a shorthand for:
+
+        self.assert_deprecated(function, num=0, ignore_others=True,
+                        exceptions=tuple(), args=args, kwargs=kwargs)
+        """
+        self.assert_deprecated(function, num=0, ignore_others=True,
+                        exceptions=tuple(), args=args, kwargs=kwargs)
+
+
+class _VisibleDeprecationTestCase(_DeprecationTestCase):
+    warning_cls = np.VisibleDeprecationWarning
+
+
+class TestNonTupleNDIndexDeprecation:
+    def test_basic(self):
+        a = np.zeros((5, 5))
+        with warnings.catch_warnings():
+            warnings.filterwarnings('always')
+            assert_warns(FutureWarning, a.__getitem__, [[0, 1], [0, 1]])
+            assert_warns(FutureWarning, a.__getitem__, [slice(None)])
+
+            warnings.filterwarnings('error')
+            assert_raises(FutureWarning, a.__getitem__, [[0, 1], [0, 1]])
+            assert_raises(FutureWarning, a.__getitem__, [slice(None)])
+
+            # a a[[0, 1]] always was advanced indexing, so no error/warning
+            a[[0, 1]]
+
+
+class TestComparisonDeprecations(_DeprecationTestCase):
+    """This tests the deprecation, for non-element-wise comparison logic.
+    This used to mean that when an error occurred during element-wise comparison
+    (i.e. broadcasting) NotImplemented was returned, but also in the comparison
+    itself, False was given instead of the error.
+
+    Also test FutureWarning for the None comparison.
+    """
+
+    message = "elementwise.* comparison failed; .*"
+
+    def test_normal_types(self):
+        for op in (operator.eq, operator.ne):
+            # Broadcasting errors:
+            self.assert_deprecated(op, args=(np.zeros(3), []))
+            a = np.zeros(3, dtype='i,i')
+            # (warning is issued a couple of times here)
+            self.assert_deprecated(op, args=(a, a[:-1]), num=None)
+
+            # ragged array comparison returns True/False
+            a = np.array([1, np.array([1,2,3])], dtype=object)
+            b = np.array([1, np.array([1,2,3])], dtype=object)
+            self.assert_deprecated(op, args=(a, b), num=None)
+
+    def test_string(self):
+        # For two string arrays, strings always raised the broadcasting error:
+        a = np.array(['a', 'b'])
+        b = np.array(['a', 'b', 'c'])
+        assert_raises(ValueError, lambda x, y: x == y, a, b)
+
+        # The empty list is not cast to string, and this used to pass due
+        # to dtype mismatch; now (2018-06-21) it correctly leads to a
+        # FutureWarning.
+        assert_warns(FutureWarning, lambda: a == [])
+
+    def test_void_dtype_equality_failures(self):
+        class NotArray:
+            def __array__(self):
+                raise TypeError
+
+            # Needed so Python 3 does not raise DeprecationWarning twice.
+            def __ne__(self, other):
+                return NotImplemented
+
+        self.assert_deprecated(lambda: np.arange(2) == NotArray())
+        self.assert_deprecated(lambda: np.arange(2) != NotArray())
+
+        struct1 = np.zeros(2, dtype="i4,i4")
+        struct2 = np.zeros(2, dtype="i4,i4,i4")
+
+        assert_warns(FutureWarning, lambda: struct1 == 1)
+        assert_warns(FutureWarning, lambda: struct1 == struct2)
+        assert_warns(FutureWarning, lambda: struct1 != 1)
+        assert_warns(FutureWarning, lambda: struct1 != struct2)
+
+    def test_array_richcompare_legacy_weirdness(self):
+        # It doesn't really work to use assert_deprecated here, b/c part of
+        # the point of assert_deprecated is to check that when warnings are
+        # set to "error" mode then the error is propagated -- which is good!
+        # But here we are testing a bunch of code that is deprecated *because*
+        # it has the habit of swallowing up errors and converting them into
+        # different warnings. So assert_warns will have to be sufficient.
+        assert_warns(FutureWarning, lambda: np.arange(2) == "a")
+        assert_warns(FutureWarning, lambda: np.arange(2) != "a")
+        # No warning for scalar comparisons
+        with warnings.catch_warnings():
+            warnings.filterwarnings("error")
+            assert_(not (np.array(0) == "a"))
+            assert_(np.array(0) != "a")
+            assert_(not (np.int16(0) == "a"))
+            assert_(np.int16(0) != "a")
+
+        for arg1 in [np.asarray(0), np.int16(0)]:
+            struct = np.zeros(2, dtype="i4,i4")
+            for arg2 in [struct, "a"]:
+                for f in [operator.lt, operator.le, operator.gt, operator.ge]:
+                    with warnings.catch_warnings() as l:
+                        warnings.filterwarnings("always")
+                        assert_raises(TypeError, f, arg1, arg2)
+                        assert_(not l)
+
+
+class TestDatetime64Timezone(_DeprecationTestCase):
+    """Parsing of datetime64 with timezones deprecated in 1.11.0, because
+    datetime64 is now timezone naive rather than UTC only.
+
+    It will be quite a while before we can remove this, because, at the very
+    least, a lot of existing code uses the 'Z' modifier to avoid conversion
+    from local time to UTC, even if otherwise it handles time in a timezone
+    naive fashion.
+    """
+    def test_string(self):
+        self.assert_deprecated(np.datetime64, args=('2000-01-01T00+01',))
+        self.assert_deprecated(np.datetime64, args=('2000-01-01T00Z',))
+
+    @pytest.mark.skipif(not _has_pytz,
+                        reason="The pytz module is not available.")
+    def test_datetime(self):
+        tz = pytz.timezone('US/Eastern')
+        dt = datetime.datetime(2000, 1, 1, 0, 0, tzinfo=tz)
+        self.assert_deprecated(np.datetime64, args=(dt,))
+
+
+class TestNonCContiguousViewDeprecation(_DeprecationTestCase):
+    """View of non-C-contiguous arrays deprecated in 1.11.0.
+
+    The deprecation will not be raised for arrays that are both C and F
+    contiguous, as C contiguous is dominant. There are more such arrays
+    with relaxed stride checking than without so the deprecation is not
+    as visible with relaxed stride checking in force.
+    """
+
+    def test_fortran_contiguous(self):
+        self.assert_deprecated(np.ones((2,2)).T.view, args=(complex,))
+        self.assert_deprecated(np.ones((2,2)).T.view, args=(np.int8,))
+
+
+class TestArrayDataAttributeAssignmentDeprecation(_DeprecationTestCase):
+    """Assigning the 'data' attribute of an ndarray is unsafe as pointed
+     out in gh-7093. Eventually, such assignment should NOT be allowed, but
+     in the interests of maintaining backwards compatibility, only a Deprecation-
+     Warning will be raised instead for the time being to give developers time to
+     refactor relevant code.
+    """
+
+    def test_data_attr_assignment(self):
+        a = np.arange(10)
+        b = np.linspace(0, 1, 10)
+
+        self.message = ("Assigning the 'data' attribute is an "
+                        "inherently unsafe operation and will "
+                        "be removed in the future.")
+        self.assert_deprecated(a.__setattr__, args=('data', b.data))
+
+
+class TestBinaryReprInsufficientWidthParameterForRepresentation(_DeprecationTestCase):
+    """
+    If a 'width' parameter is passed into ``binary_repr`` that is insufficient to
+    represent the number in base 2 (positive) or 2's complement (negative) form,
+    the function used to silently ignore the parameter and return a representation
+    using the minimal number of bits needed for the form in question. Such behavior
+    is now considered unsafe from a user perspective and will raise an error in the future.
+    """
+
+    def test_insufficient_width_positive(self):
+        args = (10,)
+        kwargs = {'width': 2}
+
+        self.message = ("Insufficient bit width provided. This behavior "
+                        "will raise an error in the future.")
+        self.assert_deprecated(np.binary_repr, args=args, kwargs=kwargs)
+
+    def test_insufficient_width_negative(self):
+        args = (-5,)
+        kwargs = {'width': 2}
+
+        self.message = ("Insufficient bit width provided. This behavior "
+                        "will raise an error in the future.")
+        self.assert_deprecated(np.binary_repr, args=args, kwargs=kwargs)
+
+
+class TestNumericStyleTypecodes(_DeprecationTestCase):
+    """
+    Deprecate the old numeric-style dtypes, which are especially
+    confusing for complex types, e.g. Complex32 -> complex64. When the
+    deprecation cycle is complete, the check for the strings should be
+    removed from PyArray_DescrConverter in descriptor.c, and the
+    deprecated keys should not be added as capitalized aliases in
+    _add_aliases in numerictypes.py.
+    """
+    def test_all_dtypes(self):
+        deprecated_types = [
+            'Bool', 'Complex32', 'Complex64', 'Float16', 'Float32', 'Float64',
+            'Int8', 'Int16', 'Int32', 'Int64', 'Object0', 'Timedelta64',
+            'UInt8', 'UInt16', 'UInt32', 'UInt64', 'Void0'
+            ]
+        for dt in deprecated_types:
+            self.assert_deprecated(np.dtype, exceptions=(TypeError,),
+                                   args=(dt,))
+
+
+class TestTestDeprecated:
+    def test_assert_deprecated(self):
+        test_case_instance = _DeprecationTestCase()
+        test_case_instance.setup()
+        assert_raises(AssertionError,
+                      test_case_instance.assert_deprecated,
+                      lambda: None)
+
+        def foo():
+            warnings.warn("foo", category=DeprecationWarning, stacklevel=2)
+
+        test_case_instance.assert_deprecated(foo)
+        test_case_instance.teardown()
+
+
+class TestNonNumericConjugate(_DeprecationTestCase):
+    """
+    Deprecate no-op behavior of ndarray.conjugate on non-numeric dtypes,
+    which conflicts with the error behavior of np.conjugate.
+    """
+    def test_conjugate(self):
+        for a in np.array(5), np.array(5j):
+            self.assert_not_deprecated(a.conjugate)
+        for a in (np.array('s'), np.array('2016', 'M'),
+                np.array((1, 2), [('a', int), ('b', int)])):
+            self.assert_deprecated(a.conjugate)
+
+
+class TestNPY_CHAR(_DeprecationTestCase):
+    # 2017-05-03, 1.13.0
+    def test_npy_char_deprecation(self):
+        from numpy.core._multiarray_tests import npy_char_deprecation
+        self.assert_deprecated(npy_char_deprecation)
+        assert_(npy_char_deprecation() == 'S1')
+
+
+class TestPyArray_AS1D(_DeprecationTestCase):
+    def test_npy_pyarrayas1d_deprecation(self):
+        from numpy.core._multiarray_tests import npy_pyarrayas1d_deprecation
+        assert_raises(NotImplementedError, npy_pyarrayas1d_deprecation)
+
+
+class TestPyArray_AS2D(_DeprecationTestCase):
+    def test_npy_pyarrayas2d_deprecation(self):
+        from numpy.core._multiarray_tests import npy_pyarrayas2d_deprecation
+        assert_raises(NotImplementedError, npy_pyarrayas2d_deprecation)
+
+
+class Test_UPDATEIFCOPY(_DeprecationTestCase):
+    """
+    v1.14 deprecates creating an array with the UPDATEIFCOPY flag, use
+    WRITEBACKIFCOPY instead
+    """
+    def test_npy_updateifcopy_deprecation(self):
+        from numpy.core._multiarray_tests import npy_updateifcopy_deprecation
+        arr = np.arange(9).reshape(3, 3)
+        v = arr.T
+        self.assert_deprecated(npy_updateifcopy_deprecation, args=(v,))
+
+
+class TestDatetimeEvent(_DeprecationTestCase):
+    # 2017-08-11, 1.14.0
+    def test_3_tuple(self):
+        for cls in (np.datetime64, np.timedelta64):
+            # two valid uses - (unit, num) and (unit, num, den, None)
+            self.assert_not_deprecated(cls, args=(1, ('ms', 2)))
+            self.assert_not_deprecated(cls, args=(1, ('ms', 2, 1, None)))
+
+            # trying to use the event argument, removed in 1.7.0, is deprecated
+            # it used to be a uint8
+            self.assert_deprecated(cls, args=(1, ('ms', 2, 'event')))
+            self.assert_deprecated(cls, args=(1, ('ms', 2, 63)))
+            self.assert_deprecated(cls, args=(1, ('ms', 2, 1, 'event')))
+            self.assert_deprecated(cls, args=(1, ('ms', 2, 1, 63)))
+
+
+class TestTruthTestingEmptyArrays(_DeprecationTestCase):
+    # 2017-09-25, 1.14.0
+    message = '.*truth value of an empty array is ambiguous.*'
+
+    def test_1d(self):
+        self.assert_deprecated(bool, args=(np.array([]),))
+
+    def test_2d(self):
+        self.assert_deprecated(bool, args=(np.zeros((1, 0)),))
+        self.assert_deprecated(bool, args=(np.zeros((0, 1)),))
+        self.assert_deprecated(bool, args=(np.zeros((0, 0)),))
+
+
+class TestBincount(_DeprecationTestCase):
+    # 2017-06-01, 1.14.0
+    def test_bincount_minlength(self):
+        self.assert_deprecated(lambda: np.bincount([1, 2, 3], minlength=None))
+
+
+class TestAlen(_DeprecationTestCase):
+    # 2019-08-02, 1.18.0
+    def test_alen(self):
+        self.assert_deprecated(lambda: np.alen(np.array([1, 2, 3])))
+
+
+class TestGeneratorSum(_DeprecationTestCase):
+    # 2018-02-25, 1.15.0
+    def test_generator_sum(self):
+        self.assert_deprecated(np.sum, args=((i for i in range(5)),))
+
+
+class TestSctypeNA(_VisibleDeprecationTestCase):
+    # 2018-06-24, 1.16
+    def test_sctypeNA(self):
+        self.assert_deprecated(lambda: np.sctypeNA['?'])
+        self.assert_deprecated(lambda: np.typeNA['?'])
+        self.assert_deprecated(lambda: np.typeNA.get('?'))
+
+
+class TestPositiveOnNonNumerical(_DeprecationTestCase):
+    # 2018-06-28, 1.16.0
+    def test_positive_on_non_number(self):
+        self.assert_deprecated(operator.pos, args=(np.array('foo'),))
+
+
+class TestFromstring(_DeprecationTestCase):
+    # 2017-10-19, 1.14
+    def test_fromstring(self):
+        self.assert_deprecated(np.fromstring, args=('\x00'*80,))
+
+
+class TestFromStringAndFileInvalidData(_DeprecationTestCase):
+    # 2019-06-08, 1.17.0
+    # Tests should be moved to real tests when deprecation is done.
+    message = "string or file could not be read to its end"
+
+    @pytest.mark.parametrize("invalid_str", [",invalid_data", "invalid_sep"])
+    def test_deprecate_unparsable_data_file(self, invalid_str):
+        x = np.array([1.51, 2, 3.51, 4], dtype=float)
+
+        with tempfile.TemporaryFile(mode="w") as f:
+            x.tofile(f, sep=',', format='%.2f')
+            f.write(invalid_str)
+
+            f.seek(0)
+            self.assert_deprecated(lambda: np.fromfile(f, sep=","))
+            f.seek(0)
+            self.assert_deprecated(lambda: np.fromfile(f, sep=",", count=5))
+            # Should not raise:
+            with warnings.catch_warnings():
+                warnings.simplefilter("error", DeprecationWarning)
+                f.seek(0)
+                res = np.fromfile(f, sep=",", count=4)
+                assert_array_equal(res, x)
+
+    @pytest.mark.parametrize("invalid_str", [",invalid_data", "invalid_sep"])
+    def test_deprecate_unparsable_string(self, invalid_str):
+        x = np.array([1.51, 2, 3.51, 4], dtype=float)
+        x_str = "1.51,2,3.51,4{}".format(invalid_str)
+
+        self.assert_deprecated(lambda: np.fromstring(x_str, sep=","))
+        self.assert_deprecated(lambda: np.fromstring(x_str, sep=",", count=5))
+
+        # The C-level API can use not fixed size, but 0 terminated strings,
+        # so test that as well:
+        bytestr = x_str.encode("ascii")
+        self.assert_deprecated(lambda: fromstring_null_term_c_api(bytestr))
+
+        with assert_warns(DeprecationWarning):
+            # this is slightly strange, in that fromstring leaves data
+            # potentially uninitialized (would be good to error when all is
+            # read, but count is larger then actual data maybe).
+            res = np.fromstring(x_str, sep=",", count=5)
+            assert_array_equal(res[:-1], x)
+
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", DeprecationWarning)
+
+            # Should not raise:
+            res = np.fromstring(x_str, sep=",", count=4)
+            assert_array_equal(res, x)
+
+
+class Test_GetSet_NumericOps(_DeprecationTestCase):
+    # 2018-09-20, 1.16.0
+    def test_get_numeric_ops(self):
+        from numpy.core._multiarray_tests import getset_numericops
+        self.assert_deprecated(getset_numericops, num=2)
+
+        # empty kwargs prevents any state actually changing which would break
+        # other tests.
+        self.assert_deprecated(np.set_numeric_ops, kwargs={})
+        assert_raises(ValueError, np.set_numeric_ops, add='abc')
+
+
+class TestShape1Fields(_DeprecationTestCase):
+    warning_cls = FutureWarning
+
+    # 2019-05-20, 1.17.0
+    def test_shape_1_fields(self):
+        self.assert_deprecated(np.dtype, args=([('a', int, 1)],))
+
+
+class TestNonZero(_DeprecationTestCase):
+    # 2019-05-26, 1.17.0
+    def test_zerod(self):
+        self.assert_deprecated(lambda: np.nonzero(np.array(0)))
+        self.assert_deprecated(lambda: np.nonzero(np.array(1)))
+
+
+def test_deprecate_ragged_arrays():
+    # 2019-11-29 1.19.0
+    #
+    # NEP 34 deprecated automatic object dtype when creating ragged
+    # arrays. Also see the "ragged" tests in `test_multiarray`
+    #
+    # emits a VisibleDeprecationWarning
+    arg = [1, [2, 3]]
+    with assert_warns(np.VisibleDeprecationWarning):
+        np.array(arg)
+
+
+class TestToString(_DeprecationTestCase):
+    # 2020-03-06 1.19.0
+    message = re.escape("tostring() is deprecated. Use tobytes() instead.")
+
+    def test_tostring(self):
+        arr = np.array(list(b"test\xFF"), dtype=np.uint8)
+        self.assert_deprecated(arr.tostring)
+
+    def test_tostring_matches_tobytes(self):
+        arr = np.array(list(b"test\xFF"), dtype=np.uint8)
+        b = arr.tobytes()
+        with assert_warns(DeprecationWarning):
+            s = arr.tostring()
+        assert s == b
+
+
+class TestDTypeCoercion(_DeprecationTestCase):
+    # 2020-02-06 1.19.0
+    message = "Converting .* to a dtype .*is deprecated"
+    deprecated_types = [
+        # The builtin scalar super types:
+        np.generic, np.flexible, np.number,
+        np.inexact, np.floating, np.complexfloating,
+        np.integer, np.unsignedinteger, np.signedinteger,
+        # character is a deprecated S1 special case:
+        np.character,
+    ]
+
+    def test_dtype_coercion(self):
+        for scalar_type in self.deprecated_types:
+            self.assert_deprecated(np.dtype, args=(scalar_type,))
+
+    def test_array_construction(self):
+        for scalar_type in self.deprecated_types:
+            self.assert_deprecated(np.array, args=([], scalar_type,))
+
+    def test_not_deprecated(self):
+        # All specific types are not deprecated:
+        for group in np.sctypes.values():
+            for scalar_type in group:
+                self.assert_not_deprecated(np.dtype, args=(scalar_type,))
+
+        for scalar_type in [type, dict, list, tuple]:
+            # Typical python types are coerced to object currently:
+            self.assert_not_deprecated(np.dtype, args=(scalar_type,))
+
+
+class BuiltInRoundComplexDType(_DeprecationTestCase):
+    # 2020-03-31 1.19.0
+    deprecated_types = [np.csingle, np.cdouble, np.clongdouble]
+    not_deprecated_types = [
+        np.int8, np.int16, np.int32, np.int64,
+        np.uint8, np.uint16, np.uint32, np.uint64,
+        np.float16, np.float32, np.float64,
+    ]
+
+    def test_deprecated(self):
+        for scalar_type in self.deprecated_types:
+            scalar = scalar_type(0)
+            self.assert_deprecated(round, args=(scalar,))
+            self.assert_deprecated(round, args=(scalar, 0))
+            self.assert_deprecated(round, args=(scalar,), kwargs={'ndigits': 0})
+    
+    def test_not_deprecated(self):
+        for scalar_type in self.not_deprecated_types:
+            scalar = scalar_type(0)
+            self.assert_not_deprecated(round, args=(scalar,))
+            self.assert_not_deprecated(round, args=(scalar, 0))
+            self.assert_not_deprecated(round, args=(scalar,), kwargs={'ndigits': 0})
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_dtype.py b/venv/Lib/site-packages/numpy/core/tests/test_dtype.py
new file mode 100644
index 000000000..c9a65cd9c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_dtype.py
@@ -0,0 +1,1293 @@
+import sys
+import operator
+import pytest
+import ctypes
+import gc
+
+import numpy as np
+from numpy.core._rational_tests import rational
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_raises, HAS_REFCOUNT)
+from numpy.compat import pickle
+from itertools import permutations
+
+def assert_dtype_equal(a, b):
+    assert_equal(a, b)
+    assert_equal(hash(a), hash(b),
+                 "two equivalent types do not hash to the same value !")
+
+def assert_dtype_not_equal(a, b):
+    assert_(a != b)
+    assert_(hash(a) != hash(b),
+            "two different types hash to the same value !")
+
+class TestBuiltin:
+    @pytest.mark.parametrize('t', [int, float, complex, np.int32, str, object,
+                                   np.compat.unicode])
+    def test_run(self, t):
+        """Only test hash runs at all."""
+        dt = np.dtype(t)
+        hash(dt)
+
+    @pytest.mark.parametrize('t', [int, float])
+    def test_dtype(self, t):
+        # Make sure equivalent byte order char hash the same (e.g. < and = on
+        # little endian)
+        dt = np.dtype(t)
+        dt2 = dt.newbyteorder("<")
+        dt3 = dt.newbyteorder(">")
+        if dt == dt2:
+            assert_(dt.byteorder != dt2.byteorder, "bogus test")
+            assert_dtype_equal(dt, dt2)
+        else:
+            assert_(dt.byteorder != dt3.byteorder, "bogus test")
+            assert_dtype_equal(dt, dt3)
+
+    def test_equivalent_dtype_hashing(self):
+        # Make sure equivalent dtypes with different type num hash equal
+        uintp = np.dtype(np.uintp)
+        if uintp.itemsize == 4:
+            left = uintp
+            right = np.dtype(np.uint32)
+        else:
+            left = uintp
+            right = np.dtype(np.ulonglong)
+        assert_(left == right)
+        assert_(hash(left) == hash(right))
+
+    def test_invalid_types(self):
+        # Make sure invalid type strings raise an error
+
+        assert_raises(TypeError, np.dtype, 'O3')
+        assert_raises(TypeError, np.dtype, 'O5')
+        assert_raises(TypeError, np.dtype, 'O7')
+        assert_raises(TypeError, np.dtype, 'b3')
+        assert_raises(TypeError, np.dtype, 'h4')
+        assert_raises(TypeError, np.dtype, 'I5')
+        assert_raises(TypeError, np.dtype, 'e3')
+        assert_raises(TypeError, np.dtype, 'f5')
+
+        if np.dtype('g').itemsize == 8 or np.dtype('g').itemsize == 16:
+            assert_raises(TypeError, np.dtype, 'g12')
+        elif np.dtype('g').itemsize == 12:
+            assert_raises(TypeError, np.dtype, 'g16')
+
+        if np.dtype('l').itemsize == 8:
+            assert_raises(TypeError, np.dtype, 'l4')
+            assert_raises(TypeError, np.dtype, 'L4')
+        else:
+            assert_raises(TypeError, np.dtype, 'l8')
+            assert_raises(TypeError, np.dtype, 'L8')
+
+        if np.dtype('q').itemsize == 8:
+            assert_raises(TypeError, np.dtype, 'q4')
+            assert_raises(TypeError, np.dtype, 'Q4')
+        else:
+            assert_raises(TypeError, np.dtype, 'q8')
+            assert_raises(TypeError, np.dtype, 'Q8')
+
+    @pytest.mark.parametrize(
+        'value',
+        ['m8', 'M8', 'datetime64', 'timedelta64',
+         'i4, (2,3)f8, f4', 'a3, 3u8, (3,4)a10',
+         '>f', '<f', '=f', '|f',
+        ])
+    def test_dtype_bytes_str_equivalence(self, value):
+        bytes_value = value.encode('ascii')
+        from_bytes = np.dtype(bytes_value)
+        from_str = np.dtype(value)
+        assert_dtype_equal(from_bytes, from_str)
+
+    def test_dtype_from_bytes(self):
+        # Empty bytes object
+        assert_raises(TypeError, np.dtype, b'')
+        # Byte order indicator, but no type
+        assert_raises(TypeError, np.dtype, b'|')
+
+        # Single character with ordinal < NPY_NTYPES returns
+        # type by index into _builtin_descrs
+        assert_dtype_equal(np.dtype(bytes([0])), np.dtype('bool'))
+        assert_dtype_equal(np.dtype(bytes([17])), np.dtype(object))
+
+        # Single character where value is a valid type code
+        assert_dtype_equal(np.dtype(b'f'), np.dtype('float32'))
+
+        # Bytes with non-ascii values raise errors
+        assert_raises(TypeError, np.dtype, b'\xff')
+        assert_raises(TypeError, np.dtype, b's\xff')
+
+    def test_bad_param(self):
+        # Can't give a size that's too small
+        assert_raises(ValueError, np.dtype,
+                        {'names':['f0', 'f1'],
+                         'formats':['i4', 'i1'],
+                         'offsets':[0, 4],
+                         'itemsize':4})
+        # If alignment is enabled, the alignment (4) must divide the itemsize
+        assert_raises(ValueError, np.dtype,
+                        {'names':['f0', 'f1'],
+                         'formats':['i4', 'i1'],
+                         'offsets':[0, 4],
+                         'itemsize':9}, align=True)
+        # If alignment is enabled, the individual fields must be aligned
+        assert_raises(ValueError, np.dtype,
+                        {'names':['f0', 'f1'],
+                         'formats':['i1', 'f4'],
+                         'offsets':[0, 2]}, align=True)
+
+    def test_field_order_equality(self):
+        x = np.dtype({'names': ['A', 'B'],
+                      'formats': ['i4', 'f4'],
+                      'offsets': [0, 4]})
+        y = np.dtype({'names': ['B', 'A'],
+                      'formats': ['f4', 'i4'],
+                      'offsets': [4, 0]})
+        assert_equal(x == y, False)
+
+class TestRecord:
+    def test_equivalent_record(self):
+        """Test whether equivalent record dtypes hash the same."""
+        a = np.dtype([('yo', int)])
+        b = np.dtype([('yo', int)])
+        assert_dtype_equal(a, b)
+
+    def test_different_names(self):
+        # In theory, they may hash the same (collision) ?
+        a = np.dtype([('yo', int)])
+        b = np.dtype([('ye', int)])
+        assert_dtype_not_equal(a, b)
+
+    def test_different_titles(self):
+        # In theory, they may hash the same (collision) ?
+        a = np.dtype({'names': ['r', 'b'],
+                      'formats': ['u1', 'u1'],
+                      'titles': ['Red pixel', 'Blue pixel']})
+        b = np.dtype({'names': ['r', 'b'],
+                      'formats': ['u1', 'u1'],
+                      'titles': ['RRed pixel', 'Blue pixel']})
+        assert_dtype_not_equal(a, b)
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_refcount_dictionary_setting(self):
+        names = ["name1"]
+        formats = ["f8"]
+        titles = ["t1"]
+        offsets = [0]
+        d = dict(names=names, formats=formats, titles=titles, offsets=offsets)
+        refcounts = {k: sys.getrefcount(i) for k, i in d.items()}
+        np.dtype(d)
+        refcounts_new = {k: sys.getrefcount(i) for k, i in d.items()}
+        assert refcounts == refcounts_new
+
+    def test_mutate(self):
+        # Mutating a dtype should reset the cached hash value
+        a = np.dtype([('yo', int)])
+        b = np.dtype([('yo', int)])
+        c = np.dtype([('ye', int)])
+        assert_dtype_equal(a, b)
+        assert_dtype_not_equal(a, c)
+        a.names = ['ye']
+        assert_dtype_equal(a, c)
+        assert_dtype_not_equal(a, b)
+        state = b.__reduce__()[2]
+        a.__setstate__(state)
+        assert_dtype_equal(a, b)
+        assert_dtype_not_equal(a, c)
+
+    def test_not_lists(self):
+        """Test if an appropriate exception is raised when passing bad values to
+        the dtype constructor.
+        """
+        assert_raises(TypeError, np.dtype,
+                      dict(names={'A', 'B'}, formats=['f8', 'i4']))
+        assert_raises(TypeError, np.dtype,
+                      dict(names=['A', 'B'], formats={'f8', 'i4'}))
+
+    def test_aligned_size(self):
+        # Check that structured dtypes get padded to an aligned size
+        dt = np.dtype('i4, i1', align=True)
+        assert_equal(dt.itemsize, 8)
+        dt = np.dtype([('f0', 'i4'), ('f1', 'i1')], align=True)
+        assert_equal(dt.itemsize, 8)
+        dt = np.dtype({'names':['f0', 'f1'],
+                       'formats':['i4', 'u1'],
+                       'offsets':[0, 4]}, align=True)
+        assert_equal(dt.itemsize, 8)
+        dt = np.dtype({'f0': ('i4', 0), 'f1':('u1', 4)}, align=True)
+        assert_equal(dt.itemsize, 8)
+        # Nesting should preserve that alignment
+        dt1 = np.dtype([('f0', 'i4'),
+                       ('f1', [('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')]),
+                       ('f2', 'i1')], align=True)
+        assert_equal(dt1.itemsize, 20)
+        dt2 = np.dtype({'names':['f0', 'f1', 'f2'],
+                       'formats':['i4',
+                                  [('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')],
+                                  'i1'],
+                       'offsets':[0, 4, 16]}, align=True)
+        assert_equal(dt2.itemsize, 20)
+        dt3 = np.dtype({'f0': ('i4', 0),
+                       'f1': ([('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')], 4),
+                       'f2': ('i1', 16)}, align=True)
+        assert_equal(dt3.itemsize, 20)
+        assert_equal(dt1, dt2)
+        assert_equal(dt2, dt3)
+        # Nesting should preserve packing
+        dt1 = np.dtype([('f0', 'i4'),
+                       ('f1', [('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')]),
+                       ('f2', 'i1')], align=False)
+        assert_equal(dt1.itemsize, 11)
+        dt2 = np.dtype({'names':['f0', 'f1', 'f2'],
+                       'formats':['i4',
+                                  [('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')],
+                                  'i1'],
+                       'offsets':[0, 4, 10]}, align=False)
+        assert_equal(dt2.itemsize, 11)
+        dt3 = np.dtype({'f0': ('i4', 0),
+                       'f1': ([('f1', 'i1'), ('f2', 'i4'), ('f3', 'i1')], 4),
+                       'f2': ('i1', 10)}, align=False)
+        assert_equal(dt3.itemsize, 11)
+        assert_equal(dt1, dt2)
+        assert_equal(dt2, dt3)
+        # Array of subtype should preserve alignment
+        dt1 = np.dtype([('a', '|i1'),
+                        ('b', [('f0', '<i2'),
+                        ('f1', '<f4')], 2)], align=True)
+        assert_equal(dt1.descr, [('a', '|i1'), ('', '|V3'),
+                                 ('b', [('f0', '<i2'), ('', '|V2'),
+                                 ('f1', '<f4')], (2,))])
+
+    def test_union_struct(self):
+        # Should be able to create union dtypes
+        dt = np.dtype({'names':['f0', 'f1', 'f2'], 'formats':['<u4', '<u2', '<u2'],
+                        'offsets':[0, 0, 2]}, align=True)
+        assert_equal(dt.itemsize, 4)
+        a = np.array([3], dtype='<u4').view(dt)
+        a['f1'] = 10
+        a['f2'] = 36
+        assert_equal(a['f0'], 10 + 36*256*256)
+        # Should be able to specify fields out of order
+        dt = np.dtype({'names':['f0', 'f1', 'f2'], 'formats':['<u4', '<u2', '<u2'],
+                        'offsets':[4, 0, 2]}, align=True)
+        assert_equal(dt.itemsize, 8)
+        # field name should not matter: assignment is by position
+        dt2 = np.dtype({'names':['f2', 'f0', 'f1'],
+                        'formats':['<u4', '<u2', '<u2'],
+                        'offsets':[4, 0, 2]}, align=True)
+        vals = [(0, 1, 2), (3, -1, 4)]
+        vals2 = [(0, 1, 2), (3, -1, 4)]
+        a = np.array(vals, dt)
+        b = np.array(vals2, dt2)
+        assert_equal(a.astype(dt2), b)
+        assert_equal(b.astype(dt), a)
+        assert_equal(a.view(dt2), b)
+        assert_equal(b.view(dt), a)
+        # Should not be able to overlap objects with other types
+        assert_raises(TypeError, np.dtype,
+                {'names':['f0', 'f1'],
+                 'formats':['O', 'i1'],
+                 'offsets':[0, 2]})
+        assert_raises(TypeError, np.dtype,
+                {'names':['f0', 'f1'],
+                 'formats':['i4', 'O'],
+                 'offsets':[0, 3]})
+        assert_raises(TypeError, np.dtype,
+                {'names':['f0', 'f1'],
+                 'formats':[[('a', 'O')], 'i1'],
+                 'offsets':[0, 2]})
+        assert_raises(TypeError, np.dtype,
+                {'names':['f0', 'f1'],
+                 'formats':['i4', [('a', 'O')]],
+                 'offsets':[0, 3]})
+        # Out of order should still be ok, however
+        dt = np.dtype({'names':['f0', 'f1'],
+                       'formats':['i1', 'O'],
+                       'offsets':[np.dtype('intp').itemsize, 0]})
+
+    def test_comma_datetime(self):
+        dt = np.dtype('M8[D],datetime64[Y],i8')
+        assert_equal(dt, np.dtype([('f0', 'M8[D]'),
+                                   ('f1', 'datetime64[Y]'),
+                                   ('f2', 'i8')]))
+
+    def test_from_dictproxy(self):
+        # Tests for PR #5920
+        dt = np.dtype({'names': ['a', 'b'], 'formats': ['i4', 'f4']})
+        assert_dtype_equal(dt, np.dtype(dt.fields))
+        dt2 = np.dtype((np.void, dt.fields))
+        assert_equal(dt2.fields, dt.fields)
+
+    def test_from_dict_with_zero_width_field(self):
+        # Regression test for #6430 / #2196
+        dt = np.dtype([('val1', np.float32, (0,)), ('val2', int)])
+        dt2 = np.dtype({'names': ['val1', 'val2'],
+                        'formats': [(np.float32, (0,)), int]})
+
+        assert_dtype_equal(dt, dt2)
+        assert_equal(dt.fields['val1'][0].itemsize, 0)
+        assert_equal(dt.itemsize, dt.fields['val2'][0].itemsize)
+
+    def test_bool_commastring(self):
+        d = np.dtype('?,?,?')  # raises?
+        assert_equal(len(d.names), 3)
+        for n in d.names:
+            assert_equal(d.fields[n][0], np.dtype('?'))
+
+    def test_nonint_offsets(self):
+        # gh-8059
+        def make_dtype(off):
+            return np.dtype({'names': ['A'], 'formats': ['i4'],
+                             'offsets': [off]})
+
+        assert_raises(TypeError, make_dtype, 'ASD')
+        assert_raises(OverflowError, make_dtype, 2**70)
+        assert_raises(TypeError, make_dtype, 2.3)
+        assert_raises(ValueError, make_dtype, -10)
+
+        # no errors here:
+        dt = make_dtype(np.uint32(0))
+        np.zeros(1, dtype=dt)[0].item()
+
+    def test_fields_by_index(self):
+        dt = np.dtype([('a', np.int8), ('b', np.float32, 3)])
+        assert_dtype_equal(dt[0], np.dtype(np.int8))
+        assert_dtype_equal(dt[1], np.dtype((np.float32, 3)))
+        assert_dtype_equal(dt[-1], dt[1])
+        assert_dtype_equal(dt[-2], dt[0])
+        assert_raises(IndexError, lambda: dt[-3])
+
+        assert_raises(TypeError, operator.getitem, dt, 3.0)
+
+        assert_equal(dt[1], dt[np.int8(1)])
+
+    @pytest.mark.parametrize('align_flag',[False, True])
+    def test_multifield_index(self, align_flag):
+        # indexing with a list produces subfields
+        # the align flag should be preserved
+        dt = np.dtype([
+            (('title', 'col1'), '<U20'), ('A', '<f8'), ('B', '<f8')
+        ], align=align_flag)
+
+        dt_sub = dt[['B', 'col1']]
+        assert_equal(
+            dt_sub,
+            np.dtype({
+                'names': ['B', 'col1'],
+                'formats': ['<f8', '<U20'],
+                'offsets': [88, 0],
+                'titles': [None, 'title'],
+                'itemsize': 96
+            })
+        )
+        assert_equal(dt_sub.isalignedstruct, align_flag)
+
+        dt_sub = dt[['B']]
+        assert_equal(
+            dt_sub,
+            np.dtype({
+                'names': ['B'],
+                'formats': ['<f8'],
+                'offsets': [88],
+                'itemsize': 96
+            })
+        )
+        assert_equal(dt_sub.isalignedstruct, align_flag)
+
+        dt_sub = dt[[]]
+        assert_equal(
+            dt_sub,
+            np.dtype({
+                'names': [],
+                'formats': [],
+                'offsets': [],
+                'itemsize': 96
+            })
+        )
+        assert_equal(dt_sub.isalignedstruct, align_flag)
+
+        assert_raises(TypeError, operator.getitem, dt, ())
+        assert_raises(TypeError, operator.getitem, dt, [1, 2, 3])
+        assert_raises(TypeError, operator.getitem, dt, ['col1', 2])
+        assert_raises(KeyError, operator.getitem, dt, ['fake'])
+        assert_raises(KeyError, operator.getitem, dt, ['title'])
+        assert_raises(ValueError, operator.getitem, dt, ['col1', 'col1'])
+
+    def test_partial_dict(self):
+        # 'names' is missing
+        assert_raises(ValueError, np.dtype,
+                {'formats': ['i4', 'i4'], 'f0': ('i4', 0), 'f1':('i4', 4)})
+
+    def test_fieldless_views(self):
+        a = np.zeros(2, dtype={'names':[], 'formats':[], 'offsets':[],
+                               'itemsize':8})
+        assert_raises(ValueError, a.view, np.dtype([]))
+
+        d = np.dtype((np.dtype([]), 10))
+        assert_equal(d.shape, (10,))
+        assert_equal(d.itemsize, 0)
+        assert_equal(d.base, np.dtype([]))
+
+        arr = np.fromiter((() for i in range(10)), [])
+        assert_equal(arr.dtype, np.dtype([]))
+        assert_raises(ValueError, np.frombuffer, b'', dtype=[])
+        assert_equal(np.frombuffer(b'', dtype=[], count=2),
+                     np.empty(2, dtype=[]))
+
+        assert_raises(ValueError, np.dtype, ([], 'f8'))
+        assert_raises(ValueError, np.zeros(1, dtype='i4').view, [])
+
+        assert_equal(np.zeros(2, dtype=[]) == np.zeros(2, dtype=[]),
+                     np.ones(2, dtype=bool))
+
+        assert_equal(np.zeros((1, 2), dtype=[]) == a,
+                     np.ones((1, 2), dtype=bool))
+
+
+class TestSubarray:
+    def test_single_subarray(self):
+        a = np.dtype((int, (2)))
+        b = np.dtype((int, (2,)))
+        assert_dtype_equal(a, b)
+
+        assert_equal(type(a.subdtype[1]), tuple)
+        assert_equal(type(b.subdtype[1]), tuple)
+
+    def test_equivalent_record(self):
+        """Test whether equivalent subarray dtypes hash the same."""
+        a = np.dtype((int, (2, 3)))
+        b = np.dtype((int, (2, 3)))
+        assert_dtype_equal(a, b)
+
+    def test_nonequivalent_record(self):
+        """Test whether different subarray dtypes hash differently."""
+        a = np.dtype((int, (2, 3)))
+        b = np.dtype((int, (3, 2)))
+        assert_dtype_not_equal(a, b)
+
+        a = np.dtype((int, (2, 3)))
+        b = np.dtype((int, (2, 2)))
+        assert_dtype_not_equal(a, b)
+
+        a = np.dtype((int, (1, 2, 3)))
+        b = np.dtype((int, (1, 2)))
+        assert_dtype_not_equal(a, b)
+
+    def test_shape_equal(self):
+        """Test some data types that are equal"""
+        assert_dtype_equal(np.dtype('f8'), np.dtype(('f8', tuple())))
+        # FutureWarning during deprecation period; after it is passed this
+        # should instead check that "(1)f8" == "1f8" == ("f8", 1).
+        with pytest.warns(FutureWarning):
+            assert_dtype_equal(np.dtype('f8'), np.dtype(('f8', 1)))
+        assert_dtype_equal(np.dtype((int, 2)), np.dtype((int, (2,))))
+        assert_dtype_equal(np.dtype(('<f4', (3, 2))), np.dtype(('<f4', (3, 2))))
+        d = ([('a', 'f4', (1, 2)), ('b', 'f8', (3, 1))], (3, 2))
+        assert_dtype_equal(np.dtype(d), np.dtype(d))
+
+    def test_shape_simple(self):
+        """Test some simple cases that shouldn't be equal"""
+        assert_dtype_not_equal(np.dtype('f8'), np.dtype(('f8', (1,))))
+        assert_dtype_not_equal(np.dtype(('f8', (1,))), np.dtype(('f8', (1, 1))))
+        assert_dtype_not_equal(np.dtype(('f4', (3, 2))), np.dtype(('f4', (2, 3))))
+
+    def test_shape_monster(self):
+        """Test some more complicated cases that shouldn't be equal"""
+        assert_dtype_not_equal(
+            np.dtype(([('a', 'f4', (2, 1)), ('b', 'f8', (1, 3))], (2, 2))),
+            np.dtype(([('a', 'f4', (1, 2)), ('b', 'f8', (1, 3))], (2, 2))))
+        assert_dtype_not_equal(
+            np.dtype(([('a', 'f4', (2, 1)), ('b', 'f8', (1, 3))], (2, 2))),
+            np.dtype(([('a', 'f4', (2, 1)), ('b', 'i8', (1, 3))], (2, 2))))
+        assert_dtype_not_equal(
+            np.dtype(([('a', 'f4', (2, 1)), ('b', 'f8', (1, 3))], (2, 2))),
+            np.dtype(([('e', 'f8', (1, 3)), ('d', 'f4', (2, 1))], (2, 2))))
+        assert_dtype_not_equal(
+            np.dtype(([('a', [('a', 'i4', 6)], (2, 1)), ('b', 'f8', (1, 3))], (2, 2))),
+            np.dtype(([('a', [('a', 'u4', 6)], (2, 1)), ('b', 'f8', (1, 3))], (2, 2))))
+
+    def test_shape_sequence(self):
+        # Any sequence of integers should work as shape, but the result
+        # should be a tuple (immutable) of base type integers.
+        a = np.array([1, 2, 3], dtype=np.int16)
+        l = [1, 2, 3]
+        # Array gets converted
+        dt = np.dtype([('a', 'f4', a)])
+        assert_(isinstance(dt['a'].shape, tuple))
+        assert_(isinstance(dt['a'].shape[0], int))
+        # List gets converted
+        dt = np.dtype([('a', 'f4', l)])
+        assert_(isinstance(dt['a'].shape, tuple))
+        #
+
+        class IntLike:
+            def __index__(self):
+                return 3
+
+            def __int__(self):
+                # (a PyNumber_Check fails without __int__)
+                return 3
+
+        dt = np.dtype([('a', 'f4', IntLike())])
+        assert_(isinstance(dt['a'].shape, tuple))
+        assert_(isinstance(dt['a'].shape[0], int))
+        dt = np.dtype([('a', 'f4', (IntLike(),))])
+        assert_(isinstance(dt['a'].shape, tuple))
+        assert_(isinstance(dt['a'].shape[0], int))
+
+    def test_shape_matches_ndim(self):
+        dt = np.dtype([('a', 'f4', ())])
+        assert_equal(dt['a'].shape, ())
+        assert_equal(dt['a'].ndim, 0)
+
+        dt = np.dtype([('a', 'f4')])
+        assert_equal(dt['a'].shape, ())
+        assert_equal(dt['a'].ndim, 0)
+
+        dt = np.dtype([('a', 'f4', 4)])
+        assert_equal(dt['a'].shape, (4,))
+        assert_equal(dt['a'].ndim, 1)
+
+        dt = np.dtype([('a', 'f4', (1, 2, 3))])
+        assert_equal(dt['a'].shape, (1, 2, 3))
+        assert_equal(dt['a'].ndim, 3)
+
+    def test_shape_invalid(self):
+        # Check that the shape is valid.
+        max_int = np.iinfo(np.intc).max
+        max_intp = np.iinfo(np.intp).max
+        # Too large values (the datatype is part of this)
+        assert_raises(ValueError, np.dtype, [('a', 'f4', max_int // 4 + 1)])
+        assert_raises(ValueError, np.dtype, [('a', 'f4', max_int + 1)])
+        assert_raises(ValueError, np.dtype, [('a', 'f4', (max_int, 2))])
+        # Takes a different code path (fails earlier:
+        assert_raises(ValueError, np.dtype, [('a', 'f4', max_intp + 1)])
+        # Negative values
+        assert_raises(ValueError, np.dtype, [('a', 'f4', -1)])
+        assert_raises(ValueError, np.dtype, [('a', 'f4', (-1, -1))])
+
+    def test_alignment(self):
+        #Check that subarrays are aligned
+        t1 = np.dtype('(1,)i4', align=True)
+        t2 = np.dtype('2i4', align=True)
+        assert_equal(t1.alignment, t2.alignment)
+
+
+def iter_struct_object_dtypes():
+    """
+    Iterates over a few complex dtypes and object pattern which
+    fill the array with a given object (defaults to a singleton).
+
+    Yields
+    ------
+    dtype : dtype
+    pattern : tuple
+        Structured tuple for use with `np.array`.
+    count : int
+        Number of objects stored in the dtype.
+    singleton : object
+        A singleton object. The returned pattern is constructed so that
+        all objects inside the datatype are set to the singleton.
+    """
+    obj = object()
+
+    dt = np.dtype([('b', 'O', (2, 3))])
+    p = ([[obj] * 3] * 2,)
+    yield pytest.param(dt, p, 6, obj, id="<subarray>")
+
+    dt = np.dtype([('a', 'i4'), ('b', 'O', (2, 3))])
+    p = (0, [[obj] * 3] * 2)
+    yield pytest.param(dt, p, 6, obj, id="<subarray in field>")
+
+    dt = np.dtype([('a', 'i4'),
+                   ('b', [('ba', 'O'), ('bb', 'i1')], (2, 3))])
+    p = (0, [[(obj, 0)] * 3] * 2)
+    yield pytest.param(dt, p, 6, obj, id="<structured subarray 1>")
+
+    dt = np.dtype([('a', 'i4'),
+                   ('b', [('ba', 'O'), ('bb', 'O')], (2, 3))])
+    p = (0, [[(obj, obj)] * 3] * 2)
+    yield pytest.param(dt, p, 12, obj, id="<structured subarray 2>")
+
+
+@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+class TestStructuredObjectRefcounting:
+    """These tests cover various uses of complicated structured types which
+    include objects and thus require reference counting.
+    """
+    @pytest.mark.parametrize(['dt', 'pat', 'count', 'singleton'],
+                             iter_struct_object_dtypes())
+    @pytest.mark.parametrize(["creation_func", "creation_obj"], [
+        pytest.param(np.empty, None,
+             # None is probably used for too many things
+             marks=pytest.mark.skip("unreliable due to python's behaviour")),
+        (np.ones, 1),
+        (np.zeros, 0)])
+    def test_structured_object_create_delete(self, dt, pat, count, singleton,
+                                             creation_func, creation_obj):
+        """Structured object reference counting in creation and deletion"""
+        # The test assumes that 0, 1, and None are singletons.
+        gc.collect()
+        before = sys.getrefcount(creation_obj)
+        arr = creation_func(3, dt)
+
+        now = sys.getrefcount(creation_obj)
+        assert now - before == count * 3
+        del arr
+        now = sys.getrefcount(creation_obj)
+        assert now == before
+
+    @pytest.mark.parametrize(['dt', 'pat', 'count', 'singleton'],
+                             iter_struct_object_dtypes())
+    def test_structured_object_item_setting(self, dt, pat, count, singleton):
+        """Structured object reference counting for simple item setting"""
+        one = 1
+
+        gc.collect()
+        before = sys.getrefcount(singleton)
+        arr = np.array([pat] * 3, dt)
+        assert sys.getrefcount(singleton) - before == count * 3
+        # Fill with `1` and check that it was replaced correctly:
+        before2 = sys.getrefcount(one)
+        arr[...] = one
+        after2 = sys.getrefcount(one)
+        assert after2 - before2 == count * 3
+        del arr
+        gc.collect()
+        assert sys.getrefcount(one) == before2
+        assert sys.getrefcount(singleton) == before
+
+    @pytest.mark.parametrize(['dt', 'pat', 'count', 'singleton'],
+                             iter_struct_object_dtypes())
+    @pytest.mark.parametrize(
+        ['shape', 'index', 'items_changed'],
+        [((3,), ([0, 2],), 2),
+         ((3, 2), ([0, 2], slice(None)), 4),
+         ((3, 2), ([0, 2], [1]), 2),
+         ((3,), ([True, False, True]), 2)])
+    def test_structured_object_indexing(self, shape, index, items_changed,
+                                        dt, pat, count, singleton):
+        """Structured object reference counting for advanced indexing."""
+        zero = 0
+        one = 1
+
+        arr = np.zeros(shape, dt)
+
+        gc.collect()
+        before_zero = sys.getrefcount(zero)
+        before_one = sys.getrefcount(one)
+        # Test item getting:
+        part = arr[index]
+        after_zero = sys.getrefcount(zero)
+        assert after_zero - before_zero == count * items_changed
+        del part
+        # Test item setting:
+        arr[index] = one
+        gc.collect()
+        after_zero = sys.getrefcount(zero)
+        after_one = sys.getrefcount(one)
+        assert before_zero - after_zero == count * items_changed
+        assert after_one - before_one == count * items_changed
+
+    @pytest.mark.parametrize(['dt', 'pat', 'count', 'singleton'],
+                             iter_struct_object_dtypes())
+    def test_structured_object_take_and_repeat(self, dt, pat, count, singleton):
+        """Structured object reference counting for specialized functions.
+        The older functions such as take and repeat use different code paths
+        then item setting (when writing this).
+        """
+        indices = [0, 1]
+
+        arr = np.array([pat] * 3, dt)
+        gc.collect()
+        before = sys.getrefcount(singleton)
+        res = arr.take(indices)
+        after = sys.getrefcount(singleton)
+        assert after - before == count * 2
+        new = res.repeat(10)
+        gc.collect()
+        after_repeat = sys.getrefcount(singleton)
+        assert after_repeat - after == count * 2 * 10
+
+
+class TestStructuredDtypeSparseFields:
+    """Tests subarray fields which contain sparse dtypes so that
+    not all memory is used by the dtype work. Such dtype's should
+    leave the underlying memory unchanged.
+    """
+    dtype = np.dtype([('a', {'names':['aa', 'ab'], 'formats':['f', 'f'],
+                             'offsets':[0, 4]}, (2, 3))])
+    sparse_dtype = np.dtype([('a', {'names':['ab'], 'formats':['f'],
+                                    'offsets':[4]}, (2, 3))])
+
+    @pytest.mark.xfail(reason="inaccessible data is changed see gh-12686.")
+    @pytest.mark.valgrind_error(reason="reads from uninitialized buffers.")
+    def test_sparse_field_assignment(self):
+        arr = np.zeros(3, self.dtype)
+        sparse_arr = arr.view(self.sparse_dtype)
+
+        sparse_arr[...] = np.finfo(np.float32).max
+        # dtype is reduced when accessing the field, so shape is (3, 2, 3):
+        assert_array_equal(arr["a"]["aa"], np.zeros((3, 2, 3)))
+
+    def test_sparse_field_assignment_fancy(self):
+        # Fancy assignment goes to the copyswap function for complex types:
+        arr = np.zeros(3, self.dtype)
+        sparse_arr = arr.view(self.sparse_dtype)
+
+        sparse_arr[[0, 1, 2]] = np.finfo(np.float32).max
+        # dtype is reduced when accessing the field, so shape is (3, 2, 3):
+        assert_array_equal(arr["a"]["aa"], np.zeros((3, 2, 3)))
+
+
+class TestMonsterType:
+    """Test deeply nested subtypes."""
+
+    def test1(self):
+        simple1 = np.dtype({'names': ['r', 'b'], 'formats': ['u1', 'u1'],
+            'titles': ['Red pixel', 'Blue pixel']})
+        a = np.dtype([('yo', int), ('ye', simple1),
+            ('yi', np.dtype((int, (3, 2))))])
+        b = np.dtype([('yo', int), ('ye', simple1),
+            ('yi', np.dtype((int, (3, 2))))])
+        assert_dtype_equal(a, b)
+
+        c = np.dtype([('yo', int), ('ye', simple1),
+            ('yi', np.dtype((a, (3, 2))))])
+        d = np.dtype([('yo', int), ('ye', simple1),
+            ('yi', np.dtype((a, (3, 2))))])
+        assert_dtype_equal(c, d)
+
+class TestMetadata:
+    def test_no_metadata(self):
+        d = np.dtype(int)
+        assert_(d.metadata is None)
+
+    def test_metadata_takes_dict(self):
+        d = np.dtype(int, metadata={'datum': 1})
+        assert_(d.metadata == {'datum': 1})
+
+    def test_metadata_rejects_nondict(self):
+        assert_raises(TypeError, np.dtype, int, metadata='datum')
+        assert_raises(TypeError, np.dtype, int, metadata=1)
+        assert_raises(TypeError, np.dtype, int, metadata=None)
+
+    def test_nested_metadata(self):
+        d = np.dtype([('a', np.dtype(int, metadata={'datum': 1}))])
+        assert_(d['a'].metadata == {'datum': 1})
+
+    def test_base_metadata_copied(self):
+        d = np.dtype((np.void, np.dtype('i4,i4', metadata={'datum': 1})))
+        assert_(d.metadata == {'datum': 1})
+
+class TestString:
+    def test_complex_dtype_str(self):
+        dt = np.dtype([('top', [('tiles', ('>f4', (64, 64)), (1,)),
+                                ('rtile', '>f4', (64, 36))], (3,)),
+                       ('bottom', [('bleft', ('>f4', (8, 64)), (1,)),
+                                   ('bright', '>f4', (8, 36))])])
+        assert_equal(str(dt),
+                     "[('top', [('tiles', ('>f4', (64, 64)), (1,)), "
+                     "('rtile', '>f4', (64, 36))], (3,)), "
+                     "('bottom', [('bleft', ('>f4', (8, 64)), (1,)), "
+                     "('bright', '>f4', (8, 36))])]")
+
+        # If the sticky aligned flag is set to True, it makes the
+        # str() function use a dict representation with an 'aligned' flag
+        dt = np.dtype([('top', [('tiles', ('>f4', (64, 64)), (1,)),
+                                ('rtile', '>f4', (64, 36))],
+                                (3,)),
+                       ('bottom', [('bleft', ('>f4', (8, 64)), (1,)),
+                                   ('bright', '>f4', (8, 36))])],
+                       align=True)
+        assert_equal(str(dt),
+                    "{'names':['top','bottom'], "
+                     "'formats':[([('tiles', ('>f4', (64, 64)), (1,)), "
+                                  "('rtile', '>f4', (64, 36))], (3,)),"
+                                 "[('bleft', ('>f4', (8, 64)), (1,)), "
+                                  "('bright', '>f4', (8, 36))]], "
+                     "'offsets':[0,76800], "
+                     "'itemsize':80000, "
+                     "'aligned':True}")
+        assert_equal(np.dtype(eval(str(dt))), dt)
+
+        dt = np.dtype({'names': ['r', 'g', 'b'], 'formats': ['u1', 'u1', 'u1'],
+                        'offsets': [0, 1, 2],
+                        'titles': ['Red pixel', 'Green pixel', 'Blue pixel']})
+        assert_equal(str(dt),
+                    "[(('Red pixel', 'r'), 'u1'), "
+                    "(('Green pixel', 'g'), 'u1'), "
+                    "(('Blue pixel', 'b'), 'u1')]")
+
+        dt = np.dtype({'names': ['rgba', 'r', 'g', 'b'],
+                       'formats': ['<u4', 'u1', 'u1', 'u1'],
+                       'offsets': [0, 0, 1, 2],
+                       'titles': ['Color', 'Red pixel',
+                                  'Green pixel', 'Blue pixel']})
+        assert_equal(str(dt),
+                    "{'names':['rgba','r','g','b'],"
+                    " 'formats':['<u4','u1','u1','u1'],"
+                    " 'offsets':[0,0,1,2],"
+                    " 'titles':['Color','Red pixel',"
+                              "'Green pixel','Blue pixel'],"
+                    " 'itemsize':4}")
+
+        dt = np.dtype({'names': ['r', 'b'], 'formats': ['u1', 'u1'],
+                        'offsets': [0, 2],
+                        'titles': ['Red pixel', 'Blue pixel']})
+        assert_equal(str(dt),
+                    "{'names':['r','b'],"
+                    " 'formats':['u1','u1'],"
+                    " 'offsets':[0,2],"
+                    " 'titles':['Red pixel','Blue pixel'],"
+                    " 'itemsize':3}")
+
+        dt = np.dtype([('a', '<m8[D]'), ('b', '<M8[us]')])
+        assert_equal(str(dt),
+                    "[('a', '<m8[D]'), ('b', '<M8[us]')]")
+
+    def test_repr_structured(self):
+        dt = np.dtype([('top', [('tiles', ('>f4', (64, 64)), (1,)),
+                                ('rtile', '>f4', (64, 36))], (3,)),
+                       ('bottom', [('bleft', ('>f4', (8, 64)), (1,)),
+                                   ('bright', '>f4', (8, 36))])])
+        assert_equal(repr(dt),
+                     "dtype([('top', [('tiles', ('>f4', (64, 64)), (1,)), "
+                     "('rtile', '>f4', (64, 36))], (3,)), "
+                     "('bottom', [('bleft', ('>f4', (8, 64)), (1,)), "
+                     "('bright', '>f4', (8, 36))])])")
+
+        dt = np.dtype({'names': ['r', 'g', 'b'], 'formats': ['u1', 'u1', 'u1'],
+                        'offsets': [0, 1, 2],
+                        'titles': ['Red pixel', 'Green pixel', 'Blue pixel']},
+                        align=True)
+        assert_equal(repr(dt),
+                    "dtype([(('Red pixel', 'r'), 'u1'), "
+                    "(('Green pixel', 'g'), 'u1'), "
+                    "(('Blue pixel', 'b'), 'u1')], align=True)")
+
+    def test_repr_structured_not_packed(self):
+        dt = np.dtype({'names': ['rgba', 'r', 'g', 'b'],
+                       'formats': ['<u4', 'u1', 'u1', 'u1'],
+                       'offsets': [0, 0, 1, 2],
+                       'titles': ['Color', 'Red pixel',
+                                  'Green pixel', 'Blue pixel']}, align=True)
+        assert_equal(repr(dt),
+                    "dtype({'names':['rgba','r','g','b'],"
+                    " 'formats':['<u4','u1','u1','u1'],"
+                    " 'offsets':[0,0,1,2],"
+                    " 'titles':['Color','Red pixel',"
+                              "'Green pixel','Blue pixel'],"
+                    " 'itemsize':4}, align=True)")
+
+        dt = np.dtype({'names': ['r', 'b'], 'formats': ['u1', 'u1'],
+                        'offsets': [0, 2],
+                        'titles': ['Red pixel', 'Blue pixel'],
+                        'itemsize': 4})
+        assert_equal(repr(dt),
+                    "dtype({'names':['r','b'], "
+                    "'formats':['u1','u1'], "
+                    "'offsets':[0,2], "
+                    "'titles':['Red pixel','Blue pixel'], "
+                    "'itemsize':4})")
+
+    def test_repr_structured_datetime(self):
+        dt = np.dtype([('a', '<M8[D]'), ('b', '<m8[us]')])
+        assert_equal(repr(dt),
+                    "dtype([('a', '<M8[D]'), ('b', '<m8[us]')])")
+
+    def test_repr_str_subarray(self):
+        dt = np.dtype(('<i2', (1,)))
+        assert_equal(repr(dt), "dtype(('<i2', (1,)))")
+        assert_equal(str(dt), "('<i2', (1,))")
+
+    def test_base_dtype_with_object_type(self):
+        # Issue gh-2798, should not error.
+        np.array(['a'], dtype="O").astype(("O", [("name", "O")]))
+
+    def test_empty_string_to_object(self):
+        # Pull request #4722
+        np.array(["", ""]).astype(object)
+
+    def test_void_subclass_unsized(self):
+        dt = np.dtype(np.record)
+        assert_equal(repr(dt), "dtype('V')")
+        assert_equal(str(dt), '|V0')
+        assert_equal(dt.name, 'record')
+
+    def test_void_subclass_sized(self):
+        dt = np.dtype((np.record, 2))
+        assert_equal(repr(dt), "dtype('V2')")
+        assert_equal(str(dt), '|V2')
+        assert_equal(dt.name, 'record16')
+
+    def test_void_subclass_fields(self):
+        dt = np.dtype((np.record, [('a', '<u2')]))
+        assert_equal(repr(dt), "dtype((numpy.record, [('a', '<u2')]))")
+        assert_equal(str(dt), "(numpy.record, [('a', '<u2')])")
+        assert_equal(dt.name, 'record16')
+
+
+class TestDtypeAttributeDeletion:
+
+    def test_dtype_non_writable_attributes_deletion(self):
+        dt = np.dtype(np.double)
+        attr = ["subdtype", "descr", "str", "name", "base", "shape",
+                "isbuiltin", "isnative", "isalignedstruct", "fields",
+                "metadata", "hasobject"]
+
+        for s in attr:
+            assert_raises(AttributeError, delattr, dt, s)
+
+    def test_dtype_writable_attributes_deletion(self):
+        dt = np.dtype(np.double)
+        attr = ["names"]
+        for s in attr:
+            assert_raises(AttributeError, delattr, dt, s)
+
+
+class TestDtypeAttributes:
+    def test_descr_has_trailing_void(self):
+        # see gh-6359
+        dtype = np.dtype({
+            'names': ['A', 'B'],
+            'formats': ['f4', 'f4'],
+            'offsets': [0, 8],
+            'itemsize': 16})
+        new_dtype = np.dtype(dtype.descr)
+        assert_equal(new_dtype.itemsize, 16)
+
+    def test_name_dtype_subclass(self):
+        # Ticket #4357
+        class user_def_subcls(np.void):
+            pass
+        assert_equal(np.dtype(user_def_subcls).name, 'user_def_subcls')
+
+
+class TestPickling:
+
+    def check_pickling(self, dtype):
+        for proto in range(pickle.HIGHEST_PROTOCOL + 1):
+            pickled = pickle.loads(pickle.dumps(dtype, proto))
+            assert_equal(pickled, dtype)
+            assert_equal(pickled.descr, dtype.descr)
+            if dtype.metadata is not None:
+                assert_equal(pickled.metadata, dtype.metadata)
+            # Check the reconstructed dtype is functional
+            x = np.zeros(3, dtype=dtype)
+            y = np.zeros(3, dtype=pickled)
+            assert_equal(x, y)
+            assert_equal(x[0], y[0])
+
+    @pytest.mark.parametrize('t', [int, float, complex, np.int32, str, object,
+                                   np.compat.unicode, bool])
+    def test_builtin(self, t):
+        self.check_pickling(np.dtype(t))
+
+    def test_structured(self):
+        dt = np.dtype(([('a', '>f4', (2, 1)), ('b', '<f8', (1, 3))], (2, 2)))
+        self.check_pickling(dt)
+
+    def test_structured_aligned(self):
+        dt = np.dtype('i4, i1', align=True)
+        self.check_pickling(dt)
+
+    def test_structured_unaligned(self):
+        dt = np.dtype('i4, i1', align=False)
+        self.check_pickling(dt)
+
+    def test_structured_padded(self):
+        dt = np.dtype({
+            'names': ['A', 'B'],
+            'formats': ['f4', 'f4'],
+            'offsets': [0, 8],
+            'itemsize': 16})
+        self.check_pickling(dt)
+
+    def test_structured_titles(self):
+        dt = np.dtype({'names': ['r', 'b'],
+                       'formats': ['u1', 'u1'],
+                       'titles': ['Red pixel', 'Blue pixel']})
+        self.check_pickling(dt)
+
+    @pytest.mark.parametrize('base', ['m8', 'M8'])
+    @pytest.mark.parametrize('unit', ['', 'Y', 'M', 'W', 'D', 'h', 'm', 's',
+                                      'ms', 'us', 'ns', 'ps', 'fs', 'as'])
+    def test_datetime(self, base, unit):
+        dt = np.dtype('%s[%s]' % (base, unit) if unit else base)
+        self.check_pickling(dt)
+        if unit:
+            dt = np.dtype('%s[7%s]' % (base, unit))
+            self.check_pickling(dt)
+
+    def test_metadata(self):
+        dt = np.dtype(int, metadata={'datum': 1})
+        self.check_pickling(dt)
+
+
+def test_rational_dtype():
+    # test for bug gh-5719
+    a = np.array([1111], dtype=rational).astype
+    assert_raises(OverflowError, a, 'int8')
+
+    # test that dtype detection finds user-defined types
+    x = rational(1)
+    assert_equal(np.array([x,x]).dtype, np.dtype(rational))
+
+
+def test_dtypes_are_true():
+    # test for gh-6294
+    assert bool(np.dtype('f8'))
+    assert bool(np.dtype('i8'))
+    assert bool(np.dtype([('a', 'i8'), ('b', 'f4')]))
+
+
+def test_invalid_dtype_string():
+    # test for gh-10440
+    assert_raises(TypeError, np.dtype, 'f8,i8,[f8,i8]')
+    assert_raises(TypeError, np.dtype, u'Fl\xfcgel')
+
+
+class TestFromDTypeAttribute:
+    def test_simple(self):
+        class dt:
+            dtype = "f8"
+
+        assert np.dtype(dt) == np.float64
+        assert np.dtype(dt()) == np.float64
+
+    def test_recursion(self):
+        class dt:
+            pass
+
+        dt.dtype = dt
+        with pytest.raises(RecursionError):
+            np.dtype(dt)
+
+        dt_instance = dt()
+        dt_instance.dtype = dt
+        with pytest.raises(RecursionError):
+            np.dtype(dt_instance)
+
+    def test_void_subtype(self):
+        class dt(np.void):
+            # This code path is fully untested before, so it is unclear
+            # what this should be useful for. Note that if np.void is used
+            # numpy will think we are deallocating a base type [1.17, 2019-02].
+            dtype = np.dtype("f,f")
+            pass
+
+        np.dtype(dt)
+        np.dtype(dt(1))
+
+    def test_void_subtype_recursion(self):
+        class dt(np.void):
+            pass
+
+        dt.dtype = dt
+
+        with pytest.raises(RecursionError):
+            np.dtype(dt)
+
+        with pytest.raises(RecursionError):
+            np.dtype(dt(1))
+
+class TestFromCTypes:
+
+    @staticmethod
+    def check(ctype, dtype):
+        dtype = np.dtype(dtype)
+        assert_equal(np.dtype(ctype), dtype)
+        assert_equal(np.dtype(ctype()), dtype)
+
+    def test_array(self):
+        c8 = ctypes.c_uint8
+        self.check(     3 * c8,  (np.uint8, (3,)))
+        self.check(     1 * c8,  (np.uint8, (1,)))
+        self.check(     0 * c8,  (np.uint8, (0,)))
+        self.check(1 * (3 * c8), ((np.uint8, (3,)), (1,)))
+        self.check(3 * (1 * c8), ((np.uint8, (1,)), (3,)))
+
+    def test_padded_structure(self):
+        class PaddedStruct(ctypes.Structure):
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16)
+            ]
+        expected = np.dtype([
+            ('a', np.uint8),
+            ('b', np.uint16)
+        ], align=True)
+        self.check(PaddedStruct, expected)
+
+    def test_bit_fields(self):
+        class BitfieldStruct(ctypes.Structure):
+            _fields_ = [
+                ('a', ctypes.c_uint8, 7),
+                ('b', ctypes.c_uint8, 1)
+            ]
+        assert_raises(TypeError, np.dtype, BitfieldStruct)
+        assert_raises(TypeError, np.dtype, BitfieldStruct())
+
+    def test_pointer(self):
+        p_uint8 = ctypes.POINTER(ctypes.c_uint8)
+        assert_raises(TypeError, np.dtype, p_uint8)
+
+    def test_void_pointer(self):
+        self.check(ctypes.c_void_p, np.uintp)
+
+    def test_union(self):
+        class Union(ctypes.Union):
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16),
+            ]
+        expected = np.dtype(dict(
+            names=['a', 'b'],
+            formats=[np.uint8, np.uint16],
+            offsets=[0, 0],
+            itemsize=2
+        ))
+        self.check(Union, expected)
+
+    def test_union_with_struct_packed(self):
+        class Struct(ctypes.Structure):
+            _pack_ = 1
+            _fields_ = [
+                ('one', ctypes.c_uint8),
+                ('two', ctypes.c_uint32)
+            ]
+
+        class Union(ctypes.Union):
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16),
+                ('c', ctypes.c_uint32),
+                ('d', Struct),
+            ]
+        expected = np.dtype(dict(
+            names=['a', 'b', 'c', 'd'],
+            formats=['u1', np.uint16, np.uint32, [('one', 'u1'), ('two', np.uint32)]],
+            offsets=[0, 0, 0, 0],
+            itemsize=ctypes.sizeof(Union)
+        ))
+        self.check(Union, expected)
+
+    def test_union_packed(self):
+        class Struct(ctypes.Structure):
+            _fields_ = [
+                ('one', ctypes.c_uint8),
+                ('two', ctypes.c_uint32)
+            ]
+            _pack_ = 1
+        class Union(ctypes.Union):
+            _pack_ = 1
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16),
+                ('c', ctypes.c_uint32),
+                ('d', Struct),
+            ]
+        expected = np.dtype(dict(
+            names=['a', 'b', 'c', 'd'],
+            formats=['u1', np.uint16, np.uint32, [('one', 'u1'), ('two', np.uint32)]],
+            offsets=[0, 0, 0, 0],
+            itemsize=ctypes.sizeof(Union)
+        ))
+        self.check(Union, expected)
+
+    def test_packed_structure(self):
+        class PackedStructure(ctypes.Structure):
+            _pack_ = 1
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16)
+            ]
+        expected = np.dtype([
+            ('a', np.uint8),
+            ('b', np.uint16)
+        ])
+        self.check(PackedStructure, expected)
+
+    def test_large_packed_structure(self):
+        class PackedStructure(ctypes.Structure):
+            _pack_ = 2
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16),
+                ('c', ctypes.c_uint8),
+                ('d', ctypes.c_uint16),
+                ('e', ctypes.c_uint32),
+                ('f', ctypes.c_uint32),
+                ('g', ctypes.c_uint8)
+                ]
+        expected = np.dtype(dict(
+            formats=[np.uint8, np.uint16, np.uint8, np.uint16, np.uint32, np.uint32, np.uint8 ],
+            offsets=[0, 2, 4, 6, 8, 12, 16],
+            names=['a', 'b', 'c', 'd', 'e', 'f', 'g'],
+            itemsize=18))
+        self.check(PackedStructure, expected)
+
+    def test_big_endian_structure_packed(self):
+        class BigEndStruct(ctypes.BigEndianStructure):
+            _fields_ = [
+                ('one', ctypes.c_uint8),
+                ('two', ctypes.c_uint32)
+            ]
+            _pack_ = 1
+        expected = np.dtype([('one', 'u1'), ('two', '>u4')])
+        self.check(BigEndStruct, expected)
+
+    def test_little_endian_structure_packed(self):
+        class LittleEndStruct(ctypes.LittleEndianStructure):
+            _fields_ = [
+                ('one', ctypes.c_uint8),
+                ('two', ctypes.c_uint32)
+            ]
+            _pack_ = 1
+        expected = np.dtype([('one', 'u1'), ('two', '<u4')])
+        self.check(LittleEndStruct, expected)
+
+    def test_little_endian_structure(self):
+        class PaddedStruct(ctypes.LittleEndianStructure):
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16)
+            ]
+        expected = np.dtype([
+            ('a', '<B'),
+            ('b', '<H')
+        ], align=True)
+        self.check(PaddedStruct, expected)
+
+    def test_big_endian_structure(self):
+        class PaddedStruct(ctypes.BigEndianStructure):
+            _fields_ = [
+                ('a', ctypes.c_uint8),
+                ('b', ctypes.c_uint16)
+            ]
+        expected = np.dtype([
+            ('a', '>B'),
+            ('b', '>H')
+        ], align=True)
+        self.check(PaddedStruct, expected)
+
+    def test_simple_endian_types(self):
+        self.check(ctypes.c_uint16.__ctype_le__, np.dtype('<u2'))
+        self.check(ctypes.c_uint16.__ctype_be__, np.dtype('>u2'))
+        self.check(ctypes.c_uint8.__ctype_le__, np.dtype('u1'))
+        self.check(ctypes.c_uint8.__ctype_be__, np.dtype('u1'))
+
+    all_types = set(np.typecodes['All'])
+    all_pairs = permutations(all_types, 2)
+
+    @pytest.mark.parametrize("pair", all_pairs)
+    def test_pairs(self, pair):
+        """
+        Check that np.dtype('x,y') matches [np.dtype('x'), np.dtype('y')]
+        Example: np.dtype('d,I') -> dtype([('f0', '<f8'), ('f1', '<u4')])
+        """
+        # gh-5645: check that np.dtype('i,L') can be used
+        pair_type = np.dtype('{},{}'.format(*pair))
+        expected = np.dtype([('f0', pair[0]), ('f1', pair[1])])
+        assert_equal(pair_type, expected)
+
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_einsum.py b/venv/Lib/site-packages/numpy/core/tests/test_einsum.py
new file mode 100644
index 000000000..da84735a0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_einsum.py
@@ -0,0 +1,1023 @@
+import itertools
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_almost_equal,
+    assert_raises, suppress_warnings, assert_raises_regex, assert_allclose
+    )
+
+# Setup for optimize einsum
+chars = 'abcdefghij'
+sizes = np.array([2, 3, 4, 5, 4, 3, 2, 6, 5, 4, 3])
+global_size_dict = dict(zip(chars, sizes))
+
+
+class TestEinsum:
+    def test_einsum_errors(self):
+        for do_opt in [True, False]:
+            # Need enough arguments
+            assert_raises(ValueError, np.einsum, optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "", optimize=do_opt)
+
+            # subscripts must be a string
+            assert_raises(TypeError, np.einsum, 0, 0, optimize=do_opt)
+
+            # out parameter must be an array
+            assert_raises(TypeError, np.einsum, "", 0, out='test',
+                          optimize=do_opt)
+
+            # order parameter must be a valid order
+            assert_raises(ValueError, np.einsum, "", 0, order='W',
+                          optimize=do_opt)
+
+            # casting parameter must be a valid casting
+            assert_raises(ValueError, np.einsum, "", 0, casting='blah',
+                          optimize=do_opt)
+
+            # dtype parameter must be a valid dtype
+            assert_raises(TypeError, np.einsum, "", 0, dtype='bad_data_type',
+                          optimize=do_opt)
+
+            # other keyword arguments are rejected
+            assert_raises(TypeError, np.einsum, "", 0, bad_arg=0,
+                          optimize=do_opt)
+
+            # issue 4528 revealed a segfault with this call
+            assert_raises(TypeError, np.einsum, *(None,)*63, optimize=do_opt)
+
+            # number of operands must match count in subscripts string
+            assert_raises(ValueError, np.einsum, "", 0, 0, optimize=do_opt)
+            assert_raises(ValueError, np.einsum, ",", 0, [0], [0],
+                          optimize=do_opt)
+            assert_raises(ValueError, np.einsum, ",", [0], optimize=do_opt)
+
+            # can't have more subscripts than dimensions in the operand
+            assert_raises(ValueError, np.einsum, "i", 0, optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "ij", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "...i", 0, optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "i...j", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "i...", 0, optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "ij...", [0, 0], optimize=do_opt)
+
+            # invalid ellipsis
+            assert_raises(ValueError, np.einsum, "i..", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, ".i...", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "j->..j", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "j->.j...", [0, 0], optimize=do_opt)
+
+            # invalid subscript character
+            assert_raises(ValueError, np.einsum, "i%...", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "...j$", [0, 0], optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "i->&", [0, 0], optimize=do_opt)
+
+            # output subscripts must appear in input
+            assert_raises(ValueError, np.einsum, "i->ij", [0, 0], optimize=do_opt)
+
+            # output subscripts may only be specified once
+            assert_raises(ValueError, np.einsum, "ij->jij", [[0, 0], [0, 0]],
+                          optimize=do_opt)
+
+            # dimensions much match when being collapsed
+            assert_raises(ValueError, np.einsum, "ii",
+                          np.arange(6).reshape(2, 3), optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "ii->i",
+                          np.arange(6).reshape(2, 3), optimize=do_opt)
+
+            # broadcasting to new dimensions must be enabled explicitly
+            assert_raises(ValueError, np.einsum, "i", np.arange(6).reshape(2, 3),
+                          optimize=do_opt)
+            assert_raises(ValueError, np.einsum, "i->i", [[0, 1], [0, 1]],
+                          out=np.arange(4).reshape(2, 2), optimize=do_opt)
+            with assert_raises_regex(ValueError, "'b'"):
+                # gh-11221 - 'c' erroneously appeared in the error message
+                a = np.ones((3, 3, 4, 5, 6))
+                b = np.ones((3, 4, 5))
+                np.einsum('aabcb,abc', a, b)
+
+    def test_einsum_views(self):
+        # pass-through
+        for do_opt in [True, False]:
+            a = np.arange(6)
+            a.shape = (2, 3)
+
+            b = np.einsum("...", a, optimize=do_opt)
+            assert_(b.base is a)
+
+            b = np.einsum(a, [Ellipsis], optimize=do_opt)
+            assert_(b.base is a)
+
+            b = np.einsum("ij", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a)
+
+            b = np.einsum(a, [0, 1], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a)
+
+            # output is writeable whenever input is writeable
+            b = np.einsum("...", a, optimize=do_opt)
+            assert_(b.flags['WRITEABLE'])
+            a.flags['WRITEABLE'] = False
+            b = np.einsum("...", a, optimize=do_opt)
+            assert_(not b.flags['WRITEABLE'])
+
+            # transpose
+            a = np.arange(6)
+            a.shape = (2, 3)
+
+            b = np.einsum("ji", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a.T)
+
+            b = np.einsum(a, [1, 0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a.T)
+
+            # diagonal
+            a = np.arange(9)
+            a.shape = (3, 3)
+
+            b = np.einsum("ii->i", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[i, i] for i in range(3)])
+
+            b = np.einsum(a, [0, 0], [0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[i, i] for i in range(3)])
+
+            # diagonal with various ways of broadcasting an additional dimension
+            a = np.arange(27)
+            a.shape = (3, 3, 3)
+
+            b = np.einsum("...ii->...i", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)] for x in a])
+
+            b = np.einsum(a, [Ellipsis, 0, 0], [Ellipsis, 0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)] for x in a])
+
+            b = np.einsum("ii...->...i", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)]
+                             for x in a.transpose(2, 0, 1)])
+
+            b = np.einsum(a, [0, 0, Ellipsis], [Ellipsis, 0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)]
+                             for x in a.transpose(2, 0, 1)])
+
+            b = np.einsum("...ii->i...", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[:, i, i] for i in range(3)])
+
+            b = np.einsum(a, [Ellipsis, 0, 0], [0, Ellipsis], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[:, i, i] for i in range(3)])
+
+            b = np.einsum("jii->ij", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[:, i, i] for i in range(3)])
+
+            b = np.einsum(a, [1, 0, 0], [0, 1], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[:, i, i] for i in range(3)])
+
+            b = np.einsum("ii...->i...", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a.transpose(2, 0, 1)[:, i, i] for i in range(3)])
+
+            b = np.einsum(a, [0, 0, Ellipsis], [0, Ellipsis], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a.transpose(2, 0, 1)[:, i, i] for i in range(3)])
+
+            b = np.einsum("i...i->i...", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a.transpose(1, 0, 2)[:, i, i] for i in range(3)])
+
+            b = np.einsum(a, [0, Ellipsis, 0], [0, Ellipsis], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a.transpose(1, 0, 2)[:, i, i] for i in range(3)])
+
+            b = np.einsum("i...i->...i", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)]
+                             for x in a.transpose(1, 0, 2)])
+
+            b = np.einsum(a, [0, Ellipsis, 0], [Ellipsis, 0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [[x[i, i] for i in range(3)]
+                             for x in a.transpose(1, 0, 2)])
+
+            # triple diagonal
+            a = np.arange(27)
+            a.shape = (3, 3, 3)
+
+            b = np.einsum("iii->i", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[i, i, i] for i in range(3)])
+
+            b = np.einsum(a, [0, 0, 0], [0], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, [a[i, i, i] for i in range(3)])
+
+            # swap axes
+            a = np.arange(24)
+            a.shape = (2, 3, 4)
+
+            b = np.einsum("ijk->jik", a, optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a.swapaxes(0, 1))
+
+            b = np.einsum(a, [0, 1, 2], [1, 0, 2], optimize=do_opt)
+            assert_(b.base is a)
+            assert_equal(b, a.swapaxes(0, 1))
+
+    def check_einsum_sums(self, dtype, do_opt=False):
+        # Check various sums.  Does many sizes to exercise unrolled loops.
+
+        # sum(a, axis=-1)
+        for n in range(1, 17):
+            a = np.arange(n, dtype=dtype)
+            assert_equal(np.einsum("i->", a, optimize=do_opt),
+                         np.sum(a, axis=-1).astype(dtype))
+            assert_equal(np.einsum(a, [0], [], optimize=do_opt),
+                         np.sum(a, axis=-1).astype(dtype))
+
+        for n in range(1, 17):
+            a = np.arange(2*3*n, dtype=dtype).reshape(2, 3, n)
+            assert_equal(np.einsum("...i->...", a, optimize=do_opt),
+                         np.sum(a, axis=-1).astype(dtype))
+            assert_equal(np.einsum(a, [Ellipsis, 0], [Ellipsis], optimize=do_opt),
+                         np.sum(a, axis=-1).astype(dtype))
+
+        # sum(a, axis=0)
+        for n in range(1, 17):
+            a = np.arange(2*n, dtype=dtype).reshape(2, n)
+            assert_equal(np.einsum("i...->...", a, optimize=do_opt),
+                         np.sum(a, axis=0).astype(dtype))
+            assert_equal(np.einsum(a, [0, Ellipsis], [Ellipsis], optimize=do_opt),
+                         np.sum(a, axis=0).astype(dtype))
+
+        for n in range(1, 17):
+            a = np.arange(2*3*n, dtype=dtype).reshape(2, 3, n)
+            assert_equal(np.einsum("i...->...", a, optimize=do_opt),
+                         np.sum(a, axis=0).astype(dtype))
+            assert_equal(np.einsum(a, [0, Ellipsis], [Ellipsis], optimize=do_opt),
+                         np.sum(a, axis=0).astype(dtype))
+
+        # trace(a)
+        for n in range(1, 17):
+            a = np.arange(n*n, dtype=dtype).reshape(n, n)
+            assert_equal(np.einsum("ii", a, optimize=do_opt),
+                         np.trace(a).astype(dtype))
+            assert_equal(np.einsum(a, [0, 0], optimize=do_opt),
+                         np.trace(a).astype(dtype))
+
+            # gh-15961: should accept numpy int64 type in subscript list
+            np_array = np.asarray([0, 0])
+            assert_equal(np.einsum(a, np_array, optimize=do_opt),
+                         np.trace(a).astype(dtype))
+            assert_equal(np.einsum(a, list(np_array), optimize=do_opt),
+                         np.trace(a).astype(dtype))
+
+        # multiply(a, b)
+        assert_equal(np.einsum("..., ...", 3, 4), 12)  # scalar case
+        for n in range(1, 17):
+            a = np.arange(3 * n, dtype=dtype).reshape(3, n)
+            b = np.arange(2 * 3 * n, dtype=dtype).reshape(2, 3, n)
+            assert_equal(np.einsum("..., ...", a, b, optimize=do_opt),
+                         np.multiply(a, b))
+            assert_equal(np.einsum(a, [Ellipsis], b, [Ellipsis], optimize=do_opt),
+                         np.multiply(a, b))
+
+        # inner(a,b)
+        for n in range(1, 17):
+            a = np.arange(2 * 3 * n, dtype=dtype).reshape(2, 3, n)
+            b = np.arange(n, dtype=dtype)
+            assert_equal(np.einsum("...i, ...i", a, b, optimize=do_opt), np.inner(a, b))
+            assert_equal(np.einsum(a, [Ellipsis, 0], b, [Ellipsis, 0], optimize=do_opt),
+                         np.inner(a, b))
+
+        for n in range(1, 11):
+            a = np.arange(n * 3 * 2, dtype=dtype).reshape(n, 3, 2)
+            b = np.arange(n, dtype=dtype)
+            assert_equal(np.einsum("i..., i...", a, b, optimize=do_opt),
+                         np.inner(a.T, b.T).T)
+            assert_equal(np.einsum(a, [0, Ellipsis], b, [0, Ellipsis], optimize=do_opt),
+                         np.inner(a.T, b.T).T)
+
+        # outer(a,b)
+        for n in range(1, 17):
+            a = np.arange(3, dtype=dtype)+1
+            b = np.arange(n, dtype=dtype)+1
+            assert_equal(np.einsum("i,j", a, b, optimize=do_opt),
+                         np.outer(a, b))
+            assert_equal(np.einsum(a, [0], b, [1], optimize=do_opt),
+                         np.outer(a, b))
+
+        # Suppress the complex warnings for the 'as f8' tests
+        with suppress_warnings() as sup:
+            sup.filter(np.ComplexWarning)
+
+            # matvec(a,b) / a.dot(b) where a is matrix, b is vector
+            for n in range(1, 17):
+                a = np.arange(4*n, dtype=dtype).reshape(4, n)
+                b = np.arange(n, dtype=dtype)
+                assert_equal(np.einsum("ij, j", a, b, optimize=do_opt),
+                             np.dot(a, b))
+                assert_equal(np.einsum(a, [0, 1], b, [1], optimize=do_opt),
+                             np.dot(a, b))
+
+                c = np.arange(4, dtype=dtype)
+                np.einsum("ij,j", a, b, out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c,
+                             np.dot(a.astype('f8'),
+                                    b.astype('f8')).astype(dtype))
+                c[...] = 0
+                np.einsum(a, [0, 1], b, [1], out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c,
+                             np.dot(a.astype('f8'),
+                                    b.astype('f8')).astype(dtype))
+
+            for n in range(1, 17):
+                a = np.arange(4*n, dtype=dtype).reshape(4, n)
+                b = np.arange(n, dtype=dtype)
+                assert_equal(np.einsum("ji,j", a.T, b.T, optimize=do_opt),
+                             np.dot(b.T, a.T))
+                assert_equal(np.einsum(a.T, [1, 0], b.T, [1], optimize=do_opt),
+                             np.dot(b.T, a.T))
+
+                c = np.arange(4, dtype=dtype)
+                np.einsum("ji,j", a.T, b.T, out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c,
+                             np.dot(b.T.astype('f8'),
+                                    a.T.astype('f8')).astype(dtype))
+                c[...] = 0
+                np.einsum(a.T, [1, 0], b.T, [1], out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c,
+                             np.dot(b.T.astype('f8'),
+                                    a.T.astype('f8')).astype(dtype))
+
+            # matmat(a,b) / a.dot(b) where a is matrix, b is matrix
+            for n in range(1, 17):
+                if n < 8 or dtype != 'f2':
+                    a = np.arange(4*n, dtype=dtype).reshape(4, n)
+                    b = np.arange(n*6, dtype=dtype).reshape(n, 6)
+                    assert_equal(np.einsum("ij,jk", a, b, optimize=do_opt),
+                                 np.dot(a, b))
+                    assert_equal(np.einsum(a, [0, 1], b, [1, 2], optimize=do_opt),
+                                 np.dot(a, b))
+
+            for n in range(1, 17):
+                a = np.arange(4*n, dtype=dtype).reshape(4, n)
+                b = np.arange(n*6, dtype=dtype).reshape(n, 6)
+                c = np.arange(24, dtype=dtype).reshape(4, 6)
+                np.einsum("ij,jk", a, b, out=c, dtype='f8', casting='unsafe',
+                          optimize=do_opt)
+                assert_equal(c,
+                             np.dot(a.astype('f8'),
+                                    b.astype('f8')).astype(dtype))
+                c[...] = 0
+                np.einsum(a, [0, 1], b, [1, 2], out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c,
+                             np.dot(a.astype('f8'),
+                                    b.astype('f8')).astype(dtype))
+
+            # matrix triple product (note this is not currently an efficient
+            # way to multiply 3 matrices)
+            a = np.arange(12, dtype=dtype).reshape(3, 4)
+            b = np.arange(20, dtype=dtype).reshape(4, 5)
+            c = np.arange(30, dtype=dtype).reshape(5, 6)
+            if dtype != 'f2':
+                assert_equal(np.einsum("ij,jk,kl", a, b, c, optimize=do_opt),
+                             a.dot(b).dot(c))
+                assert_equal(np.einsum(a, [0, 1], b, [1, 2], c, [2, 3],
+                                       optimize=do_opt), a.dot(b).dot(c))
+
+            d = np.arange(18, dtype=dtype).reshape(3, 6)
+            np.einsum("ij,jk,kl", a, b, c, out=d,
+                      dtype='f8', casting='unsafe', optimize=do_opt)
+            tgt = a.astype('f8').dot(b.astype('f8'))
+            tgt = tgt.dot(c.astype('f8')).astype(dtype)
+            assert_equal(d, tgt)
+
+            d[...] = 0
+            np.einsum(a, [0, 1], b, [1, 2], c, [2, 3], out=d,
+                      dtype='f8', casting='unsafe', optimize=do_opt)
+            tgt = a.astype('f8').dot(b.astype('f8'))
+            tgt = tgt.dot(c.astype('f8')).astype(dtype)
+            assert_equal(d, tgt)
+
+            # tensordot(a, b)
+            if np.dtype(dtype) != np.dtype('f2'):
+                a = np.arange(60, dtype=dtype).reshape(3, 4, 5)
+                b = np.arange(24, dtype=dtype).reshape(4, 3, 2)
+                assert_equal(np.einsum("ijk, jil -> kl", a, b),
+                             np.tensordot(a, b, axes=([1, 0], [0, 1])))
+                assert_equal(np.einsum(a, [0, 1, 2], b, [1, 0, 3], [2, 3]),
+                             np.tensordot(a, b, axes=([1, 0], [0, 1])))
+
+                c = np.arange(10, dtype=dtype).reshape(5, 2)
+                np.einsum("ijk,jil->kl", a, b, out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c, np.tensordot(a.astype('f8'), b.astype('f8'),
+                             axes=([1, 0], [0, 1])).astype(dtype))
+                c[...] = 0
+                np.einsum(a, [0, 1, 2], b, [1, 0, 3], [2, 3], out=c,
+                          dtype='f8', casting='unsafe', optimize=do_opt)
+                assert_equal(c, np.tensordot(a.astype('f8'), b.astype('f8'),
+                             axes=([1, 0], [0, 1])).astype(dtype))
+
+        # logical_and(logical_and(a!=0, b!=0), c!=0)
+        a = np.array([1,   3,   -2,   0,   12,  13,   0,   1], dtype=dtype)
+        b = np.array([0,   3.5, 0.,   -2,  0,   1,    3,   12], dtype=dtype)
+        c = np.array([True, True, False, True, True, False, True, True])
+        assert_equal(np.einsum("i,i,i->i", a, b, c,
+                     dtype='?', casting='unsafe', optimize=do_opt),
+                     np.logical_and(np.logical_and(a != 0, b != 0), c != 0))
+        assert_equal(np.einsum(a, [0], b, [0], c, [0], [0],
+                     dtype='?', casting='unsafe'),
+                     np.logical_and(np.logical_and(a != 0, b != 0), c != 0))
+
+        a = np.arange(9, dtype=dtype)
+        assert_equal(np.einsum(",i->", 3, a), 3*np.sum(a))
+        assert_equal(np.einsum(3, [], a, [0], []), 3*np.sum(a))
+        assert_equal(np.einsum("i,->", a, 3), 3*np.sum(a))
+        assert_equal(np.einsum(a, [0], 3, [], []), 3*np.sum(a))
+
+        # Various stride0, contiguous, and SSE aligned variants
+        for n in range(1, 25):
+            a = np.arange(n, dtype=dtype)
+            if np.dtype(dtype).itemsize > 1:
+                assert_equal(np.einsum("...,...", a, a, optimize=do_opt),
+                             np.multiply(a, a))
+                assert_equal(np.einsum("i,i", a, a, optimize=do_opt), np.dot(a, a))
+                assert_equal(np.einsum("i,->i", a, 2, optimize=do_opt), 2*a)
+                assert_equal(np.einsum(",i->i", 2, a, optimize=do_opt), 2*a)
+                assert_equal(np.einsum("i,->", a, 2, optimize=do_opt), 2*np.sum(a))
+                assert_equal(np.einsum(",i->", 2, a, optimize=do_opt), 2*np.sum(a))
+
+                assert_equal(np.einsum("...,...", a[1:], a[:-1], optimize=do_opt),
+                             np.multiply(a[1:], a[:-1]))
+                assert_equal(np.einsum("i,i", a[1:], a[:-1], optimize=do_opt),
+                             np.dot(a[1:], a[:-1]))
+                assert_equal(np.einsum("i,->i", a[1:], 2, optimize=do_opt), 2*a[1:])
+                assert_equal(np.einsum(",i->i", 2, a[1:], optimize=do_opt), 2*a[1:])
+                assert_equal(np.einsum("i,->", a[1:], 2, optimize=do_opt),
+                             2*np.sum(a[1:]))
+                assert_equal(np.einsum(",i->", 2, a[1:], optimize=do_opt),
+                             2*np.sum(a[1:]))
+
+        # An object array, summed as the data type
+        a = np.arange(9, dtype=object)
+
+        b = np.einsum("i->", a, dtype=dtype, casting='unsafe')
+        assert_equal(b, np.sum(a))
+        assert_equal(b.dtype, np.dtype(dtype))
+
+        b = np.einsum(a, [0], [], dtype=dtype, casting='unsafe')
+        assert_equal(b, np.sum(a))
+        assert_equal(b.dtype, np.dtype(dtype))
+
+        # A case which was failing (ticket #1885)
+        p = np.arange(2) + 1
+        q = np.arange(4).reshape(2, 2) + 3
+        r = np.arange(4).reshape(2, 2) + 7
+        assert_equal(np.einsum('z,mz,zm->', p, q, r), 253)
+
+        # singleton dimensions broadcast (gh-10343)
+        p = np.ones((10,2))
+        q = np.ones((1,2))
+        assert_array_equal(np.einsum('ij,ij->j', p, q, optimize=True),
+                           np.einsum('ij,ij->j', p, q, optimize=False))
+        assert_array_equal(np.einsum('ij,ij->j', p, q, optimize=True),
+                           [10.] * 2)
+
+        # a blas-compatible contraction broadcasting case which was failing
+        # for optimize=True (ticket #10930)
+        x = np.array([2., 3.])
+        y = np.array([4.])
+        assert_array_equal(np.einsum("i, i", x, y, optimize=False), 20.)
+        assert_array_equal(np.einsum("i, i", x, y, optimize=True), 20.)
+
+        # all-ones array was bypassing bug (ticket #10930)
+        p = np.ones((1, 5)) / 2
+        q = np.ones((5, 5)) / 2
+        for optimize in (True, False):
+            assert_array_equal(np.einsum("...ij,...jk->...ik", p, p,
+                                         optimize=optimize),
+                               np.einsum("...ij,...jk->...ik", p, q,
+                                         optimize=optimize))
+            assert_array_equal(np.einsum("...ij,...jk->...ik", p, q,
+                                         optimize=optimize),
+                               np.full((1, 5), 1.25))
+
+        # Cases which were failing (gh-10899)
+        x = np.eye(2, dtype=dtype)
+        y = np.ones(2, dtype=dtype)
+        assert_array_equal(np.einsum("ji,i->", x, y, optimize=optimize),
+                           [2.])  # contig_contig_outstride0_two
+        assert_array_equal(np.einsum("i,ij->", y, x, optimize=optimize),
+                           [2.])  # stride0_contig_outstride0_two
+        assert_array_equal(np.einsum("ij,i->", x, y, optimize=optimize),
+                           [2.])  # contig_stride0_outstride0_two
+
+    def test_einsum_sums_int8(self):
+        self.check_einsum_sums('i1')
+
+    def test_einsum_sums_uint8(self):
+        self.check_einsum_sums('u1')
+
+    def test_einsum_sums_int16(self):
+        self.check_einsum_sums('i2')
+
+    def test_einsum_sums_uint16(self):
+        self.check_einsum_sums('u2')
+
+    def test_einsum_sums_int32(self):
+        self.check_einsum_sums('i4')
+        self.check_einsum_sums('i4', True)
+
+    def test_einsum_sums_uint32(self):
+        self.check_einsum_sums('u4')
+        self.check_einsum_sums('u4', True)
+
+    def test_einsum_sums_int64(self):
+        self.check_einsum_sums('i8')
+
+    def test_einsum_sums_uint64(self):
+        self.check_einsum_sums('u8')
+
+    def test_einsum_sums_float16(self):
+        self.check_einsum_sums('f2')
+
+    def test_einsum_sums_float32(self):
+        self.check_einsum_sums('f4')
+
+    def test_einsum_sums_float64(self):
+        self.check_einsum_sums('f8')
+        self.check_einsum_sums('f8', True)
+
+    def test_einsum_sums_longdouble(self):
+        self.check_einsum_sums(np.longdouble)
+
+    def test_einsum_sums_cfloat64(self):
+        self.check_einsum_sums('c8')
+        self.check_einsum_sums('c8', True)
+
+    def test_einsum_sums_cfloat128(self):
+        self.check_einsum_sums('c16')
+
+    def test_einsum_sums_clongdouble(self):
+        self.check_einsum_sums(np.clongdouble)
+
+    def test_einsum_misc(self):
+        # This call used to crash because of a bug in
+        # PyArray_AssignZero
+        a = np.ones((1, 2))
+        b = np.ones((2, 2, 1))
+        assert_equal(np.einsum('ij...,j...->i...', a, b), [[[2], [2]]])
+        assert_equal(np.einsum('ij...,j...->i...', a, b, optimize=True), [[[2], [2]]])
+
+        # Regression test for issue #10369 (test unicode inputs with Python 2)
+        assert_equal(np.einsum(u'ij...,j...->i...', a, b), [[[2], [2]]])
+        assert_equal(np.einsum('...i,...i', [1, 2, 3], [2, 3, 4]), 20)
+        assert_equal(np.einsum(u'...i,...i', [1, 2, 3], [2, 3, 4]), 20)
+        assert_equal(np.einsum('...i,...i', [1, 2, 3], [2, 3, 4],
+                               optimize=u'greedy'), 20)
+
+        # The iterator had an issue with buffering this reduction
+        a = np.ones((5, 12, 4, 2, 3), np.int64)
+        b = np.ones((5, 12, 11), np.int64)
+        assert_equal(np.einsum('ijklm,ijn,ijn->', a, b, b),
+                     np.einsum('ijklm,ijn->', a, b))
+        assert_equal(np.einsum('ijklm,ijn,ijn->', a, b, b, optimize=True),
+                     np.einsum('ijklm,ijn->', a, b, optimize=True))
+
+        # Issue #2027, was a problem in the contiguous 3-argument
+        # inner loop implementation
+        a = np.arange(1, 3)
+        b = np.arange(1, 5).reshape(2, 2)
+        c = np.arange(1, 9).reshape(4, 2)
+        assert_equal(np.einsum('x,yx,zx->xzy', a, b, c),
+                     [[[1,  3], [3,  9], [5, 15], [7, 21]],
+                     [[8, 16], [16, 32], [24, 48], [32, 64]]])
+        assert_equal(np.einsum('x,yx,zx->xzy', a, b, c, optimize=True),
+                     [[[1,  3], [3,  9], [5, 15], [7, 21]],
+                     [[8, 16], [16, 32], [24, 48], [32, 64]]])
+
+        # Ensure explicitly setting out=None does not cause an error
+        # see issue gh-15776 and issue gh-15256
+        assert_equal(np.einsum('i,j', [1], [2], out=None), [[2]])
+
+    def test_subscript_range(self):
+        # Issue #7741, make sure that all letters of Latin alphabet (both uppercase & lowercase) can be used
+        # when creating a subscript from arrays
+        a = np.ones((2, 3))
+        b = np.ones((3, 4))
+        np.einsum(a, [0, 20], b, [20, 2], [0, 2], optimize=False)
+        np.einsum(a, [0, 27], b, [27, 2], [0, 2], optimize=False)
+        np.einsum(a, [0, 51], b, [51, 2], [0, 2], optimize=False)
+        assert_raises(ValueError, lambda: np.einsum(a, [0, 52], b, [52, 2], [0, 2], optimize=False))
+        assert_raises(ValueError, lambda: np.einsum(a, [-1, 5], b, [5, 2], [-1, 2], optimize=False))
+
+    def test_einsum_broadcast(self):
+        # Issue #2455 change in handling ellipsis
+        # remove the 'middle broadcast' error
+        # only use the 'RIGHT' iteration in prepare_op_axes
+        # adds auto broadcast on left where it belongs
+        # broadcast on right has to be explicit
+        # We need to test the optimized parsing as well
+
+        A = np.arange(2 * 3 * 4).reshape(2, 3, 4)
+        B = np.arange(3)
+        ref = np.einsum('ijk,j->ijk', A, B, optimize=False)
+        for opt in [True, False]:
+            assert_equal(np.einsum('ij...,j...->ij...', A, B, optimize=opt), ref)
+            assert_equal(np.einsum('ij...,...j->ij...', A, B, optimize=opt), ref)
+            assert_equal(np.einsum('ij...,j->ij...', A, B, optimize=opt), ref)  # used to raise error
+
+        A = np.arange(12).reshape((4, 3))
+        B = np.arange(6).reshape((3, 2))
+        ref = np.einsum('ik,kj->ij', A, B, optimize=False)
+        for opt in [True, False]:
+            assert_equal(np.einsum('ik...,k...->i...', A, B, optimize=opt), ref)
+            assert_equal(np.einsum('ik...,...kj->i...j', A, B, optimize=opt), ref)
+            assert_equal(np.einsum('...k,kj', A, B, optimize=opt), ref)  # used to raise error
+            assert_equal(np.einsum('ik,k...->i...', A, B, optimize=opt), ref)  # used to raise error
+
+        dims = [2, 3, 4, 5]
+        a = np.arange(np.prod(dims)).reshape(dims)
+        v = np.arange(dims[2])
+        ref = np.einsum('ijkl,k->ijl', a, v, optimize=False)
+        for opt in [True, False]:
+            assert_equal(np.einsum('ijkl,k', a, v, optimize=opt), ref)
+            assert_equal(np.einsum('...kl,k', a, v, optimize=opt), ref)  # used to raise error
+            assert_equal(np.einsum('...kl,k...', a, v, optimize=opt), ref)
+
+        J, K, M = 160, 160, 120
+        A = np.arange(J * K * M).reshape(1, 1, 1, J, K, M)
+        B = np.arange(J * K * M * 3).reshape(J, K, M, 3)
+        ref = np.einsum('...lmn,...lmno->...o', A, B, optimize=False)
+        for opt in [True, False]:
+            assert_equal(np.einsum('...lmn,lmno->...o', A, B,
+                                   optimize=opt), ref)  # used to raise error
+
+    def test_einsum_fixedstridebug(self):
+        # Issue #4485 obscure einsum bug
+        # This case revealed a bug in nditer where it reported a stride
+        # as 'fixed' (0) when it was in fact not fixed during processing
+        # (0 or 4). The reason for the bug was that the check for a fixed
+        # stride was using the information from the 2D inner loop reuse
+        # to restrict the iteration dimensions it had to validate to be
+        # the same, but that 2D inner loop reuse logic is only triggered
+        # during the buffer copying step, and hence it was invalid to
+        # rely on those values. The fix is to check all the dimensions
+        # of the stride in question, which in the test case reveals that
+        # the stride is not fixed.
+        #
+        # NOTE: This test is triggered by the fact that the default buffersize,
+        #       used by einsum, is 8192, and 3*2731 = 8193, is larger than that
+        #       and results in a mismatch between the buffering and the
+        #       striding for operand A.
+        A = np.arange(2 * 3).reshape(2, 3).astype(np.float32)
+        B = np.arange(2 * 3 * 2731).reshape(2, 3, 2731).astype(np.int16)
+        es = np.einsum('cl, cpx->lpx',  A,  B)
+        tp = np.tensordot(A,  B,  axes=(0,  0))
+        assert_equal(es,  tp)
+        # The following is the original test case from the bug report,
+        # made repeatable by changing random arrays to aranges.
+        A = np.arange(3 * 3).reshape(3, 3).astype(np.float64)
+        B = np.arange(3 * 3 * 64 * 64).reshape(3, 3, 64, 64).astype(np.float32)
+        es = np.einsum('cl, cpxy->lpxy',  A, B)
+        tp = np.tensordot(A, B,  axes=(0, 0))
+        assert_equal(es, tp)
+
+    def test_einsum_fixed_collapsingbug(self):
+        # Issue #5147.
+        # The bug only occurred when output argument of einssum was used.
+        x = np.random.normal(0, 1, (5, 5, 5, 5))
+        y1 = np.zeros((5, 5))
+        np.einsum('aabb->ab', x, out=y1)
+        idx = np.arange(5)
+        y2 = x[idx[:, None], idx[:, None], idx, idx]
+        assert_equal(y1, y2)
+
+    def test_einsum_failed_on_p9_and_s390x(self):
+        # Issues gh-14692 and gh-12689
+        # Bug with signed vs unsigned char errored on power9 and s390x Linux
+        tensor = np.random.random_sample((10, 10, 10, 10))
+        x = np.einsum('ijij->', tensor)
+        y = tensor.trace(axis1=0, axis2=2).trace()
+        assert_allclose(x, y)
+
+    def test_einsum_all_contig_non_contig_output(self):
+        # Issue gh-5907, tests that the all contiguous special case
+        # actually checks the contiguity of the output
+        x = np.ones((5, 5))
+        out = np.ones(10)[::2]
+        correct_base = np.ones(10)
+        correct_base[::2] = 5
+        # Always worked (inner iteration is done with 0-stride):
+        np.einsum('mi,mi,mi->m', x, x, x, out=out)
+        assert_array_equal(out.base, correct_base)
+        # Example 1:
+        out = np.ones(10)[::2]
+        np.einsum('im,im,im->m', x, x, x, out=out)
+        assert_array_equal(out.base, correct_base)
+        # Example 2, buffering causes x to be contiguous but
+        # special cases do not catch the operation before:
+        out = np.ones((2, 2, 2))[..., 0]
+        correct_base = np.ones((2, 2, 2))
+        correct_base[..., 0] = 2
+        x = np.ones((2, 2), np.float32)
+        np.einsum('ij,jk->ik', x, x, out=out)
+        assert_array_equal(out.base, correct_base)
+
+    def test_small_boolean_arrays(self):
+        # See gh-5946.
+        # Use array of True embedded in False.
+        a = np.zeros((16, 1, 1), dtype=np.bool_)[:2]
+        a[...] = True
+        out = np.zeros((16, 1, 1), dtype=np.bool_)[:2]
+        tgt = np.ones((2, 1, 1), dtype=np.bool_)
+        res = np.einsum('...ij,...jk->...ik', a, a, out=out)
+        assert_equal(res, tgt)
+
+    def test_out_is_res(self):
+        a = np.arange(9).reshape(3, 3)
+        res = np.einsum('...ij,...jk->...ik', a, a, out=a)
+        assert res is a
+
+    def optimize_compare(self, subscripts, operands=None):
+        # Tests all paths of the optimization function against
+        # conventional einsum
+        if operands is None:
+            args = [subscripts]
+            terms = subscripts.split('->')[0].split(',')
+            for term in terms:
+                dims = [global_size_dict[x] for x in term]
+                args.append(np.random.rand(*dims))
+        else:
+            args = [subscripts] + operands
+
+        noopt = np.einsum(*args, optimize=False)
+        opt = np.einsum(*args, optimize='greedy')
+        assert_almost_equal(opt, noopt)
+        opt = np.einsum(*args, optimize='optimal')
+        assert_almost_equal(opt, noopt)
+
+    def test_hadamard_like_products(self):
+        # Hadamard outer products
+        self.optimize_compare('a,ab,abc->abc')
+        self.optimize_compare('a,b,ab->ab')
+
+    def test_index_transformations(self):
+        # Simple index transformation cases
+        self.optimize_compare('ea,fb,gc,hd,abcd->efgh')
+        self.optimize_compare('ea,fb,abcd,gc,hd->efgh')
+        self.optimize_compare('abcd,ea,fb,gc,hd->efgh')
+
+    def test_complex(self):
+        # Long test cases
+        self.optimize_compare('acdf,jbje,gihb,hfac,gfac,gifabc,hfac')
+        self.optimize_compare('acdf,jbje,gihb,hfac,gfac,gifabc,hfac')
+        self.optimize_compare('cd,bdhe,aidb,hgca,gc,hgibcd,hgac')
+        self.optimize_compare('abhe,hidj,jgba,hiab,gab')
+        self.optimize_compare('bde,cdh,agdb,hica,ibd,hgicd,hiac')
+        self.optimize_compare('chd,bde,agbc,hiad,hgc,hgi,hiad')
+        self.optimize_compare('chd,bde,agbc,hiad,bdi,cgh,agdb')
+        self.optimize_compare('bdhe,acad,hiab,agac,hibd')
+
+    def test_collapse(self):
+        # Inner products
+        self.optimize_compare('ab,ab,c->')
+        self.optimize_compare('ab,ab,c->c')
+        self.optimize_compare('ab,ab,cd,cd->')
+        self.optimize_compare('ab,ab,cd,cd->ac')
+        self.optimize_compare('ab,ab,cd,cd->cd')
+        self.optimize_compare('ab,ab,cd,cd,ef,ef->')
+
+    def test_expand(self):
+        # Outer products
+        self.optimize_compare('ab,cd,ef->abcdef')
+        self.optimize_compare('ab,cd,ef->acdf')
+        self.optimize_compare('ab,cd,de->abcde')
+        self.optimize_compare('ab,cd,de->be')
+        self.optimize_compare('ab,bcd,cd->abcd')
+        self.optimize_compare('ab,bcd,cd->abd')
+
+    def test_edge_cases(self):
+        # Difficult edge cases for optimization
+        self.optimize_compare('eb,cb,fb->cef')
+        self.optimize_compare('dd,fb,be,cdb->cef')
+        self.optimize_compare('bca,cdb,dbf,afc->')
+        self.optimize_compare('dcc,fce,ea,dbf->ab')
+        self.optimize_compare('fdf,cdd,ccd,afe->ae')
+        self.optimize_compare('abcd,ad')
+        self.optimize_compare('ed,fcd,ff,bcf->be')
+        self.optimize_compare('baa,dcf,af,cde->be')
+        self.optimize_compare('bd,db,eac->ace')
+        self.optimize_compare('fff,fae,bef,def->abd')
+        self.optimize_compare('efc,dbc,acf,fd->abe')
+        self.optimize_compare('ba,ac,da->bcd')
+
+    def test_inner_product(self):
+        # Inner products
+        self.optimize_compare('ab,ab')
+        self.optimize_compare('ab,ba')
+        self.optimize_compare('abc,abc')
+        self.optimize_compare('abc,bac')
+        self.optimize_compare('abc,cba')
+
+    def test_random_cases(self):
+        # Randomly built test cases
+        self.optimize_compare('aab,fa,df,ecc->bde')
+        self.optimize_compare('ecb,fef,bad,ed->ac')
+        self.optimize_compare('bcf,bbb,fbf,fc->')
+        self.optimize_compare('bb,ff,be->e')
+        self.optimize_compare('bcb,bb,fc,fff->')
+        self.optimize_compare('fbb,dfd,fc,fc->')
+        self.optimize_compare('afd,ba,cc,dc->bf')
+        self.optimize_compare('adb,bc,fa,cfc->d')
+        self.optimize_compare('bbd,bda,fc,db->acf')
+        self.optimize_compare('dba,ead,cad->bce')
+        self.optimize_compare('aef,fbc,dca->bde')
+
+    def test_combined_views_mapping(self):
+        # gh-10792
+        a = np.arange(9).reshape(1, 1, 3, 1, 3)
+        b = np.einsum('bbcdc->d', a)
+        assert_equal(b, [12])
+
+    def test_broadcasting_dot_cases(self):
+        # Ensures broadcasting cases are not mistaken for GEMM
+
+        a = np.random.rand(1, 5, 4)
+        b = np.random.rand(4, 6)
+        c = np.random.rand(5, 6)
+        d = np.random.rand(10)
+
+        self.optimize_compare('ijk,kl,jl', operands=[a, b, c])
+        self.optimize_compare('ijk,kl,jl,i->i', operands=[a, b, c, d])
+
+        e = np.random.rand(1, 1, 5, 4)
+        f = np.random.rand(7, 7)
+        self.optimize_compare('abjk,kl,jl', operands=[e, b, c])
+        self.optimize_compare('abjk,kl,jl,ab->ab', operands=[e, b, c, f])
+
+        # Edge case found in gh-11308
+        g = np.arange(64).reshape(2, 4, 8)
+        self.optimize_compare('obk,ijk->ioj', operands=[g, g])
+
+
+class TestEinsumPath:
+    def build_operands(self, string, size_dict=global_size_dict):
+
+        # Builds views based off initial operands
+        operands = [string]
+        terms = string.split('->')[0].split(',')
+        for term in terms:
+            dims = [size_dict[x] for x in term]
+            operands.append(np.random.rand(*dims))
+
+        return operands
+
+    def assert_path_equal(self, comp, benchmark):
+        # Checks if list of tuples are equivalent
+        ret = (len(comp) == len(benchmark))
+        assert_(ret)
+        for pos in range(len(comp) - 1):
+            ret &= isinstance(comp[pos + 1], tuple)
+            ret &= (comp[pos + 1] == benchmark[pos + 1])
+        assert_(ret)
+
+    def test_memory_contraints(self):
+        # Ensure memory constraints are satisfied
+
+        outer_test = self.build_operands('a,b,c->abc')
+
+        path, path_str = np.einsum_path(*outer_test, optimize=('greedy', 0))
+        self.assert_path_equal(path, ['einsum_path', (0, 1, 2)])
+
+        path, path_str = np.einsum_path(*outer_test, optimize=('optimal', 0))
+        self.assert_path_equal(path, ['einsum_path', (0, 1, 2)])
+
+        long_test = self.build_operands('acdf,jbje,gihb,hfac')
+        path, path_str = np.einsum_path(*long_test, optimize=('greedy', 0))
+        self.assert_path_equal(path, ['einsum_path', (0, 1, 2, 3)])
+
+        path, path_str = np.einsum_path(*long_test, optimize=('optimal', 0))
+        self.assert_path_equal(path, ['einsum_path', (0, 1, 2, 3)])
+
+    def test_long_paths(self):
+        # Long complex cases
+
+        # Long test 1
+        long_test1 = self.build_operands('acdf,jbje,gihb,hfac,gfac,gifabc,hfac')
+        path, path_str = np.einsum_path(*long_test1, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path',
+                                      (3, 6), (3, 4), (2, 4), (2, 3), (0, 2), (0, 1)])
+
+        path, path_str = np.einsum_path(*long_test1, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path',
+                                      (3, 6), (3, 4), (2, 4), (2, 3), (0, 2), (0, 1)])
+
+        # Long test 2
+        long_test2 = self.build_operands('chd,bde,agbc,hiad,bdi,cgh,agdb')
+        path, path_str = np.einsum_path(*long_test2, optimize='greedy')
+        print(path)
+        self.assert_path_equal(path, ['einsum_path',
+                                      (3, 4), (0, 3), (3, 4), (1, 3), (1, 2), (0, 1)])
+
+        path, path_str = np.einsum_path(*long_test2, optimize='optimal')
+        print(path)
+        self.assert_path_equal(path, ['einsum_path',
+                                      (0, 5), (1, 4), (3, 4), (1, 3), (1, 2), (0, 1)])
+
+    def test_edge_paths(self):
+        # Difficult edge cases
+
+        # Edge test1
+        edge_test1 = self.build_operands('eb,cb,fb->cef')
+        path, path_str = np.einsum_path(*edge_test1, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path', (0, 2), (0, 1)])
+
+        path, path_str = np.einsum_path(*edge_test1, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path', (0, 2), (0, 1)])
+
+        # Edge test2
+        edge_test2 = self.build_operands('dd,fb,be,cdb->cef')
+        path, path_str = np.einsum_path(*edge_test2, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path', (0, 3), (0, 1), (0, 1)])
+
+        path, path_str = np.einsum_path(*edge_test2, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path', (0, 3), (0, 1), (0, 1)])
+
+        # Edge test3
+        edge_test3 = self.build_operands('bca,cdb,dbf,afc->')
+        path, path_str = np.einsum_path(*edge_test3, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path', (1, 2), (0, 2), (0, 1)])
+
+        path, path_str = np.einsum_path(*edge_test3, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path', (1, 2), (0, 2), (0, 1)])
+
+        # Edge test4
+        edge_test4 = self.build_operands('dcc,fce,ea,dbf->ab')
+        path, path_str = np.einsum_path(*edge_test4, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path', (1, 2), (0, 1), (0, 1)])
+
+        path, path_str = np.einsum_path(*edge_test4, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path', (1, 2), (0, 2), (0, 1)])
+
+        # Edge test5
+        edge_test4 = self.build_operands('a,ac,ab,ad,cd,bd,bc->',
+                                         size_dict={"a": 20, "b": 20, "c": 20, "d": 20})
+        path, path_str = np.einsum_path(*edge_test4, optimize='greedy')
+        self.assert_path_equal(path, ['einsum_path', (0, 1), (0, 1, 2, 3, 4, 5)])
+
+        path, path_str = np.einsum_path(*edge_test4, optimize='optimal')
+        self.assert_path_equal(path, ['einsum_path', (0, 1), (0, 1, 2, 3, 4, 5)])
+
+    def test_path_type_input(self):
+        # Test explicit path handeling
+        path_test = self.build_operands('dcc,fce,ea,dbf->ab')
+
+        path, path_str = np.einsum_path(*path_test, optimize=False)
+        self.assert_path_equal(path, ['einsum_path', (0, 1, 2, 3)])
+
+        path, path_str = np.einsum_path(*path_test, optimize=True)
+        self.assert_path_equal(path, ['einsum_path', (1, 2), (0, 1), (0, 1)])
+
+        exp_path = ['einsum_path', (0, 2), (0, 2), (0, 1)]
+        path, path_str = np.einsum_path(*path_test, optimize=exp_path)
+        self.assert_path_equal(path, exp_path)
+
+        # Double check einsum works on the input path
+        noopt = np.einsum(*path_test, optimize=False)
+        opt = np.einsum(*path_test, optimize=exp_path)
+        assert_almost_equal(noopt, opt)
+
+    def test_spaces(self):
+        #gh-10794
+        arr = np.array([[1]])
+        for sp in itertools.product(['', ' '], repeat=4):
+            # no error for any spacing
+            np.einsum('{}...a{}->{}...a{}'.format(*sp), arr)
+
+def test_overlap():
+    a = np.arange(9, dtype=int).reshape(3, 3)
+    b = np.arange(9, dtype=int).reshape(3, 3)
+    d = np.dot(a, b)
+    # sanity check
+    c = np.einsum('ij,jk->ik', a, b)
+    assert_equal(c, d)
+    #gh-10080, out overlaps one of the operands
+    c = np.einsum('ij,jk->ik', a, b, out=b)
+    assert_equal(c, d)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_errstate.py b/venv/Lib/site-packages/numpy/core/tests/test_errstate.py
new file mode 100644
index 000000000..184a37300
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_errstate.py
@@ -0,0 +1,59 @@
+import pytest
+import sysconfig
+
+import numpy as np
+from numpy.testing import assert_, assert_raises
+
+# The floating point emulation on ARM EABI systems lacking a hardware FPU is
+# known to be buggy. This is an attempt to identify these hosts. It may not
+# catch all possible cases, but it catches the known cases of gh-413 and
+# gh-15562.
+hosttype = sysconfig.get_config_var('HOST_GNU_TYPE')
+arm_softfloat = False if hosttype is None else hosttype.endswith('gnueabi')
+
+class TestErrstate:
+    @pytest.mark.skipif(arm_softfloat,
+                        reason='platform/cpu issue with FPU (gh-413,-15562)')
+    def test_invalid(self):
+        with np.errstate(all='raise', under='ignore'):
+            a = -np.arange(3)
+            # This should work
+            with np.errstate(invalid='ignore'):
+                np.sqrt(a)
+            # While this should fail!
+            with assert_raises(FloatingPointError):
+                np.sqrt(a)
+
+    @pytest.mark.skipif(arm_softfloat,
+                        reason='platform/cpu issue with FPU (gh-15562)')
+    def test_divide(self):
+        with np.errstate(all='raise', under='ignore'):
+            a = -np.arange(3)
+            # This should work
+            with np.errstate(divide='ignore'):
+                a // 0
+            # While this should fail!
+            with assert_raises(FloatingPointError):
+                a // 0
+            # As should this, see gh-15562
+            with assert_raises(FloatingPointError):
+                a // a
+
+    def test_errcall(self):
+        def foo(*args):
+            print(args)
+
+        olderrcall = np.geterrcall()
+        with np.errstate(call=foo):
+            assert_(np.geterrcall() is foo, 'call is not foo')
+            with np.errstate(call=None):
+                assert_(np.geterrcall() is None, 'call is not None')
+        assert_(np.geterrcall() is olderrcall, 'call is not olderrcall')
+
+    def test_errstate_decorator(self):
+        @np.errstate(all='ignore')
+        def foo():
+            a = -np.arange(3)
+            a // 0
+            
+        foo()
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_extint128.py b/venv/Lib/site-packages/numpy/core/tests/test_extint128.py
new file mode 100644
index 000000000..3b64915f3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_extint128.py
@@ -0,0 +1,219 @@
+import itertools
+import contextlib
+import operator
+import pytest
+
+import numpy as np
+import numpy.core._multiarray_tests as mt
+
+from numpy.testing import assert_raises, assert_equal
+
+
+INT64_MAX = np.iinfo(np.int64).max
+INT64_MIN = np.iinfo(np.int64).min
+INT64_MID = 2**32
+
+# int128 is not two's complement, the sign bit is separate
+INT128_MAX = 2**128 - 1
+INT128_MIN = -INT128_MAX
+INT128_MID = 2**64
+
+INT64_VALUES = (
+    [INT64_MIN + j for j in range(20)] +
+    [INT64_MAX - j for j in range(20)] +
+    [INT64_MID + j for j in range(-20, 20)] +
+    [2*INT64_MID + j for j in range(-20, 20)] +
+    [INT64_MID//2 + j for j in range(-20, 20)] +
+    list(range(-70, 70))
+)
+
+INT128_VALUES = (
+    [INT128_MIN + j for j in range(20)] +
+    [INT128_MAX - j for j in range(20)] +
+    [INT128_MID + j for j in range(-20, 20)] +
+    [2*INT128_MID + j for j in range(-20, 20)] +
+    [INT128_MID//2 + j for j in range(-20, 20)] +
+    list(range(-70, 70)) +
+    [False]  # negative zero
+)
+
+INT64_POS_VALUES = [x for x in INT64_VALUES if x > 0]
+
+
+@contextlib.contextmanager
+def exc_iter(*args):
+    """
+    Iterate over Cartesian product of *args, and if an exception is raised,
+    add information of the current iterate.
+    """
+
+    value = [None]
+
+    def iterate():
+        for v in itertools.product(*args):
+            value[0] = v
+            yield v
+
+    try:
+        yield iterate()
+    except Exception:
+        import traceback
+        msg = "At: %r\n%s" % (repr(value[0]),
+                              traceback.format_exc())
+        raise AssertionError(msg)
+
+
+def test_safe_binop():
+    # Test checked arithmetic routines
+
+    ops = [
+        (operator.add, 1),
+        (operator.sub, 2),
+        (operator.mul, 3)
+    ]
+
+    with exc_iter(ops, INT64_VALUES, INT64_VALUES) as it:
+        for xop, a, b in it:
+            pyop, op = xop
+            c = pyop(a, b)
+
+            if not (INT64_MIN <= c <= INT64_MAX):
+                assert_raises(OverflowError, mt.extint_safe_binop, a, b, op)
+            else:
+                d = mt.extint_safe_binop(a, b, op)
+                if c != d:
+                    # assert_equal is slow
+                    assert_equal(d, c)
+
+
+def test_to_128():
+    with exc_iter(INT64_VALUES) as it:
+        for a, in it:
+            b = mt.extint_to_128(a)
+            if a != b:
+                assert_equal(b, a)
+
+
+def test_to_64():
+    with exc_iter(INT128_VALUES) as it:
+        for a, in it:
+            if not (INT64_MIN <= a <= INT64_MAX):
+                assert_raises(OverflowError, mt.extint_to_64, a)
+            else:
+                b = mt.extint_to_64(a)
+                if a != b:
+                    assert_equal(b, a)
+
+
+def test_mul_64_64():
+    with exc_iter(INT64_VALUES, INT64_VALUES) as it:
+        for a, b in it:
+            c = a * b
+            d = mt.extint_mul_64_64(a, b)
+            if c != d:
+                assert_equal(d, c)
+
+
+def test_add_128():
+    with exc_iter(INT128_VALUES, INT128_VALUES) as it:
+        for a, b in it:
+            c = a + b
+            if not (INT128_MIN <= c <= INT128_MAX):
+                assert_raises(OverflowError, mt.extint_add_128, a, b)
+            else:
+                d = mt.extint_add_128(a, b)
+                if c != d:
+                    assert_equal(d, c)
+
+
+def test_sub_128():
+    with exc_iter(INT128_VALUES, INT128_VALUES) as it:
+        for a, b in it:
+            c = a - b
+            if not (INT128_MIN <= c <= INT128_MAX):
+                assert_raises(OverflowError, mt.extint_sub_128, a, b)
+            else:
+                d = mt.extint_sub_128(a, b)
+                if c != d:
+                    assert_equal(d, c)
+
+
+def test_neg_128():
+    with exc_iter(INT128_VALUES) as it:
+        for a, in it:
+            b = -a
+            c = mt.extint_neg_128(a)
+            if b != c:
+                assert_equal(c, b)
+
+
+def test_shl_128():
+    with exc_iter(INT128_VALUES) as it:
+        for a, in it:
+            if a < 0:
+                b = -(((-a) << 1) & (2**128-1))
+            else:
+                b = (a << 1) & (2**128-1)
+            c = mt.extint_shl_128(a)
+            if b != c:
+                assert_equal(c, b)
+
+
+def test_shr_128():
+    with exc_iter(INT128_VALUES) as it:
+        for a, in it:
+            if a < 0:
+                b = -((-a) >> 1)
+            else:
+                b = a >> 1
+            c = mt.extint_shr_128(a)
+            if b != c:
+                assert_equal(c, b)
+
+
+def test_gt_128():
+    with exc_iter(INT128_VALUES, INT128_VALUES) as it:
+        for a, b in it:
+            c = a > b
+            d = mt.extint_gt_128(a, b)
+            if c != d:
+                assert_equal(d, c)
+
+
+@pytest.mark.slow
+def test_divmod_128_64():
+    with exc_iter(INT128_VALUES, INT64_POS_VALUES) as it:
+        for a, b in it:
+            if a >= 0:
+                c, cr = divmod(a, b)
+            else:
+                c, cr = divmod(-a, b)
+                c = -c
+                cr = -cr
+
+            d, dr = mt.extint_divmod_128_64(a, b)
+
+            if c != d or d != dr or b*d + dr != a:
+                assert_equal(d, c)
+                assert_equal(dr, cr)
+                assert_equal(b*d + dr, a)
+
+
+def test_floordiv_128_64():
+    with exc_iter(INT128_VALUES, INT64_POS_VALUES) as it:
+        for a, b in it:
+            c = a // b
+            d = mt.extint_floordiv_128_64(a, b)
+
+            if c != d:
+                assert_equal(d, c)
+
+
+def test_ceildiv_128_64():
+    with exc_iter(INT128_VALUES, INT64_POS_VALUES) as it:
+        for a, b in it:
+            c = (a + b - 1) // b
+            d = mt.extint_ceildiv_128_64(a, b)
+
+            if c != d:
+                assert_equal(d, c)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_function_base.py b/venv/Lib/site-packages/numpy/core/tests/test_function_base.py
new file mode 100644
index 000000000..2197ef0cd
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_function_base.py
@@ -0,0 +1,370 @@
+from numpy import (
+    logspace, linspace, geomspace, dtype, array, sctypes, arange, isnan,
+    ndarray, sqrt, nextafter, stack
+    )
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_array_equal, assert_allclose,
+    )
+
+
+class PhysicalQuantity(float):
+    def __new__(cls, value):
+        return float.__new__(cls, value)
+
+    def __add__(self, x):
+        assert_(isinstance(x, PhysicalQuantity))
+        return PhysicalQuantity(float(x) + float(self))
+    __radd__ = __add__
+
+    def __sub__(self, x):
+        assert_(isinstance(x, PhysicalQuantity))
+        return PhysicalQuantity(float(self) - float(x))
+
+    def __rsub__(self, x):
+        assert_(isinstance(x, PhysicalQuantity))
+        return PhysicalQuantity(float(x) - float(self))
+
+    def __mul__(self, x):
+        return PhysicalQuantity(float(x) * float(self))
+    __rmul__ = __mul__
+
+    def __div__(self, x):
+        return PhysicalQuantity(float(self) / float(x))
+
+    def __rdiv__(self, x):
+        return PhysicalQuantity(float(x) / float(self))
+
+
+class PhysicalQuantity2(ndarray):
+    __array_priority__ = 10
+
+
+class TestLogspace:
+
+    def test_basic(self):
+        y = logspace(0, 6)
+        assert_(len(y) == 50)
+        y = logspace(0, 6, num=100)
+        assert_(y[-1] == 10 ** 6)
+        y = logspace(0, 6, endpoint=False)
+        assert_(y[-1] < 10 ** 6)
+        y = logspace(0, 6, num=7)
+        assert_array_equal(y, [1, 10, 100, 1e3, 1e4, 1e5, 1e6])
+
+    def test_start_stop_array(self):
+        start = array([0., 1.])
+        stop = array([6., 7.])
+        t1 = logspace(start, stop, 6)
+        t2 = stack([logspace(_start, _stop, 6)
+                    for _start, _stop in zip(start, stop)], axis=1)
+        assert_equal(t1, t2)
+        t3 = logspace(start, stop[0], 6)
+        t4 = stack([logspace(_start, stop[0], 6)
+                    for _start in start], axis=1)
+        assert_equal(t3, t4)
+        t5 = logspace(start, stop, 6, axis=-1)
+        assert_equal(t5, t2.T)
+
+    def test_dtype(self):
+        y = logspace(0, 6, dtype='float32')
+        assert_equal(y.dtype, dtype('float32'))
+        y = logspace(0, 6, dtype='float64')
+        assert_equal(y.dtype, dtype('float64'))
+        y = logspace(0, 6, dtype='int32')
+        assert_equal(y.dtype, dtype('int32'))
+
+    def test_physical_quantities(self):
+        a = PhysicalQuantity(1.0)
+        b = PhysicalQuantity(5.0)
+        assert_equal(logspace(a, b), logspace(1.0, 5.0))
+
+    def test_subclass(self):
+        a = array(1).view(PhysicalQuantity2)
+        b = array(7).view(PhysicalQuantity2)
+        ls = logspace(a, b)
+        assert type(ls) is PhysicalQuantity2
+        assert_equal(ls, logspace(1.0, 7.0))
+        ls = logspace(a, b, 1)
+        assert type(ls) is PhysicalQuantity2
+        assert_equal(ls, logspace(1.0, 7.0, 1))
+
+
+class TestGeomspace:
+
+    def test_basic(self):
+        y = geomspace(1, 1e6)
+        assert_(len(y) == 50)
+        y = geomspace(1, 1e6, num=100)
+        assert_(y[-1] == 10 ** 6)
+        y = geomspace(1, 1e6, endpoint=False)
+        assert_(y[-1] < 10 ** 6)
+        y = geomspace(1, 1e6, num=7)
+        assert_array_equal(y, [1, 10, 100, 1e3, 1e4, 1e5, 1e6])
+
+        y = geomspace(8, 2, num=3)
+        assert_allclose(y, [8, 4, 2])
+        assert_array_equal(y.imag, 0)
+
+        y = geomspace(-1, -100, num=3)
+        assert_array_equal(y, [-1, -10, -100])
+        assert_array_equal(y.imag, 0)
+
+        y = geomspace(-100, -1, num=3)
+        assert_array_equal(y, [-100, -10, -1])
+        assert_array_equal(y.imag, 0)
+
+    def test_complex(self):
+        # Purely imaginary
+        y = geomspace(1j, 16j, num=5)
+        assert_allclose(y, [1j, 2j, 4j, 8j, 16j])
+        assert_array_equal(y.real, 0)
+
+        y = geomspace(-4j, -324j, num=5)
+        assert_allclose(y, [-4j, -12j, -36j, -108j, -324j])
+        assert_array_equal(y.real, 0)
+
+        y = geomspace(1+1j, 1000+1000j, num=4)
+        assert_allclose(y, [1+1j, 10+10j, 100+100j, 1000+1000j])
+
+        y = geomspace(-1+1j, -1000+1000j, num=4)
+        assert_allclose(y, [-1+1j, -10+10j, -100+100j, -1000+1000j])
+
+        # Logarithmic spirals
+        y = geomspace(-1, 1, num=3, dtype=complex)
+        assert_allclose(y, [-1, 1j, +1])
+
+        y = geomspace(0+3j, -3+0j, 3)
+        assert_allclose(y, [0+3j, -3/sqrt(2)+3j/sqrt(2), -3+0j])
+        y = geomspace(0+3j, 3+0j, 3)
+        assert_allclose(y, [0+3j, 3/sqrt(2)+3j/sqrt(2), 3+0j])
+        y = geomspace(-3+0j, 0-3j, 3)
+        assert_allclose(y, [-3+0j, -3/sqrt(2)-3j/sqrt(2), 0-3j])
+        y = geomspace(0+3j, -3+0j, 3)
+        assert_allclose(y, [0+3j, -3/sqrt(2)+3j/sqrt(2), -3+0j])
+        y = geomspace(-2-3j, 5+7j, 7)
+        assert_allclose(y, [-2-3j, -0.29058977-4.15771027j,
+                            2.08885354-4.34146838j, 4.58345529-3.16355218j,
+                            6.41401745-0.55233457j, 6.75707386+3.11795092j,
+                            5+7j])
+
+        # Type promotion should prevent the -5 from becoming a NaN
+        y = geomspace(3j, -5, 2)
+        assert_allclose(y, [3j, -5])
+        y = geomspace(-5, 3j, 2)
+        assert_allclose(y, [-5, 3j])
+
+    def test_dtype(self):
+        y = geomspace(1, 1e6, dtype='float32')
+        assert_equal(y.dtype, dtype('float32'))
+        y = geomspace(1, 1e6, dtype='float64')
+        assert_equal(y.dtype, dtype('float64'))
+        y = geomspace(1, 1e6, dtype='int32')
+        assert_equal(y.dtype, dtype('int32'))
+
+        # Native types
+        y = geomspace(1, 1e6, dtype=float)
+        assert_equal(y.dtype, dtype('float_'))
+        y = geomspace(1, 1e6, dtype=complex)
+        assert_equal(y.dtype, dtype('complex'))
+
+    def test_start_stop_array_scalar(self):
+        lim1 = array([120, 100], dtype="int8")
+        lim2 = array([-120, -100], dtype="int8")
+        lim3 = array([1200, 1000], dtype="uint16")
+        t1 = geomspace(lim1[0], lim1[1], 5)
+        t2 = geomspace(lim2[0], lim2[1], 5)
+        t3 = geomspace(lim3[0], lim3[1], 5)
+        t4 = geomspace(120.0, 100.0, 5)
+        t5 = geomspace(-120.0, -100.0, 5)
+        t6 = geomspace(1200.0, 1000.0, 5)
+
+        # t3 uses float32, t6 uses float64
+        assert_allclose(t1, t4, rtol=1e-2)
+        assert_allclose(t2, t5, rtol=1e-2)
+        assert_allclose(t3, t6, rtol=1e-5)
+
+    def test_start_stop_array(self):
+        # Try to use all special cases.
+        start = array([1.e0, 32., 1j, -4j, 1+1j, -1])
+        stop = array([1.e4, 2., 16j, -324j, 10000+10000j, 1])
+        t1 = geomspace(start, stop, 5)
+        t2 = stack([geomspace(_start, _stop, 5)
+                    for _start, _stop in zip(start, stop)], axis=1)
+        assert_equal(t1, t2)
+        t3 = geomspace(start, stop[0], 5)
+        t4 = stack([geomspace(_start, stop[0], 5)
+                    for _start in start], axis=1)
+        assert_equal(t3, t4)
+        t5 = geomspace(start, stop, 5, axis=-1)
+        assert_equal(t5, t2.T)
+
+    def test_physical_quantities(self):
+        a = PhysicalQuantity(1.0)
+        b = PhysicalQuantity(5.0)
+        assert_equal(geomspace(a, b), geomspace(1.0, 5.0))
+
+    def test_subclass(self):
+        a = array(1).view(PhysicalQuantity2)
+        b = array(7).view(PhysicalQuantity2)
+        gs = geomspace(a, b)
+        assert type(gs) is PhysicalQuantity2
+        assert_equal(gs, geomspace(1.0, 7.0))
+        gs = geomspace(a, b, 1)
+        assert type(gs) is PhysicalQuantity2
+        assert_equal(gs, geomspace(1.0, 7.0, 1))
+
+    def test_bounds(self):
+        assert_raises(ValueError, geomspace, 0, 10)
+        assert_raises(ValueError, geomspace, 10, 0)
+        assert_raises(ValueError, geomspace, 0, 0)
+
+
+class TestLinspace:
+
+    def test_basic(self):
+        y = linspace(0, 10)
+        assert_(len(y) == 50)
+        y = linspace(2, 10, num=100)
+        assert_(y[-1] == 10)
+        y = linspace(2, 10, endpoint=False)
+        assert_(y[-1] < 10)
+        assert_raises(ValueError, linspace, 0, 10, num=-1)
+
+    def test_corner(self):
+        y = list(linspace(0, 1, 1))
+        assert_(y == [0.0], y)
+        assert_raises(TypeError, linspace, 0, 1, num=2.5)
+
+    def test_type(self):
+        t1 = linspace(0, 1, 0).dtype
+        t2 = linspace(0, 1, 1).dtype
+        t3 = linspace(0, 1, 2).dtype
+        assert_equal(t1, t2)
+        assert_equal(t2, t3)
+
+    def test_dtype(self):
+        y = linspace(0, 6, dtype='float32')
+        assert_equal(y.dtype, dtype('float32'))
+        y = linspace(0, 6, dtype='float64')
+        assert_equal(y.dtype, dtype('float64'))
+        y = linspace(0, 6, dtype='int32')
+        assert_equal(y.dtype, dtype('int32'))
+
+    def test_start_stop_array_scalar(self):
+        lim1 = array([-120, 100], dtype="int8")
+        lim2 = array([120, -100], dtype="int8")
+        lim3 = array([1200, 1000], dtype="uint16")
+        t1 = linspace(lim1[0], lim1[1], 5)
+        t2 = linspace(lim2[0], lim2[1], 5)
+        t3 = linspace(lim3[0], lim3[1], 5)
+        t4 = linspace(-120.0, 100.0, 5)
+        t5 = linspace(120.0, -100.0, 5)
+        t6 = linspace(1200.0, 1000.0, 5)
+        assert_equal(t1, t4)
+        assert_equal(t2, t5)
+        assert_equal(t3, t6)
+
+    def test_start_stop_array(self):
+        start = array([-120, 120], dtype="int8")
+        stop = array([100, -100], dtype="int8")
+        t1 = linspace(start, stop, 5)
+        t2 = stack([linspace(_start, _stop, 5)
+                    for _start, _stop in zip(start, stop)], axis=1)
+        assert_equal(t1, t2)
+        t3 = linspace(start, stop[0], 5)
+        t4 = stack([linspace(_start, stop[0], 5)
+                    for _start in start], axis=1)
+        assert_equal(t3, t4)
+        t5 = linspace(start, stop, 5, axis=-1)
+        assert_equal(t5, t2.T)
+
+    def test_complex(self):
+        lim1 = linspace(1 + 2j, 3 + 4j, 5)
+        t1 = array([1.0+2.j, 1.5+2.5j,  2.0+3j, 2.5+3.5j, 3.0+4j])
+        lim2 = linspace(1j, 10, 5)
+        t2 = array([0.0+1.j, 2.5+0.75j, 5.0+0.5j, 7.5+0.25j, 10.0+0j])
+        assert_equal(lim1, t1)
+        assert_equal(lim2, t2)
+
+    def test_physical_quantities(self):
+        a = PhysicalQuantity(0.0)
+        b = PhysicalQuantity(1.0)
+        assert_equal(linspace(a, b), linspace(0.0, 1.0))
+
+    def test_subclass(self):
+        a = array(0).view(PhysicalQuantity2)
+        b = array(1).view(PhysicalQuantity2)
+        ls = linspace(a, b)
+        assert type(ls) is PhysicalQuantity2
+        assert_equal(ls, linspace(0.0, 1.0))
+        ls = linspace(a, b, 1)
+        assert type(ls) is PhysicalQuantity2
+        assert_equal(ls, linspace(0.0, 1.0, 1))
+
+    def test_array_interface(self):
+        # Regression test for https://github.com/numpy/numpy/pull/6659
+        # Ensure that start/stop can be objects that implement
+        # __array_interface__ and are convertible to numeric scalars
+
+        class Arrayish:
+            """
+            A generic object that supports the __array_interface__ and hence
+            can in principle be converted to a numeric scalar, but is not
+            otherwise recognized as numeric, but also happens to support
+            multiplication by floats.
+
+            Data should be an object that implements the buffer interface,
+            and contains at least 4 bytes.
+            """
+
+            def __init__(self, data):
+                self._data = data
+
+            @property
+            def __array_interface__(self):
+                return {'shape': (), 'typestr': '<i4', 'data': self._data,
+                        'version': 3}
+
+            def __mul__(self, other):
+                # For the purposes of this test any multiplication is an
+                # identity operation :)
+                return self
+
+        one = Arrayish(array(1, dtype='<i4'))
+        five = Arrayish(array(5, dtype='<i4'))
+
+        assert_equal(linspace(one, five), linspace(1, 5))
+
+    def test_denormal_numbers(self):
+        # Regression test for gh-5437. Will probably fail when compiled
+        # with ICC, which flushes denormals to zero
+        for ftype in sctypes['float']:
+            stop = nextafter(ftype(0), ftype(1)) * 5  # A denormal number
+            assert_(any(linspace(0, stop, 10, endpoint=False, dtype=ftype)))
+
+    def test_equivalent_to_arange(self):
+        for j in range(1000):
+            assert_equal(linspace(0, j, j+1, dtype=int),
+                         arange(j+1, dtype=int))
+
+    def test_retstep(self):
+        for num in [0, 1, 2]:
+            for ept in [False, True]:
+                y = linspace(0, 1, num, endpoint=ept, retstep=True)
+                assert isinstance(y, tuple) and len(y) == 2
+                if num == 2:
+                    y0_expect = [0.0, 1.0] if ept else [0.0, 0.5]
+                    assert_array_equal(y[0], y0_expect)
+                    assert_equal(y[1], y0_expect[1])
+                elif num == 1 and not ept:
+                    assert_array_equal(y[0], [0.0])
+                    assert_equal(y[1], 1.0)
+                else:
+                    assert_array_equal(y[0], [0.0][:num])
+                    assert isnan(y[1])
+
+    def test_object(self):
+        start = array(1, dtype='O')
+        stop = array(2, dtype='O')
+        y = linspace(start, stop, 3)
+        assert_array_equal(y, array([1., 1.5, 2.]))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_getlimits.py b/venv/Lib/site-packages/numpy/core/tests/test_getlimits.py
new file mode 100644
index 000000000..bcf8cf659
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_getlimits.py
@@ -0,0 +1,121 @@
+""" Test functions for limits module.
+
+"""
+import numpy as np
+from numpy.core import finfo, iinfo
+from numpy import half, single, double, longdouble
+from numpy.testing import assert_equal, assert_, assert_raises
+from numpy.core.getlimits import _discovered_machar, _float_ma
+
+##################################################
+
+class TestPythonFloat:
+    def test_singleton(self):
+        ftype = finfo(float)
+        ftype2 = finfo(float)
+        assert_equal(id(ftype), id(ftype2))
+
+class TestHalf:
+    def test_singleton(self):
+        ftype = finfo(half)
+        ftype2 = finfo(half)
+        assert_equal(id(ftype), id(ftype2))
+
+class TestSingle:
+    def test_singleton(self):
+        ftype = finfo(single)
+        ftype2 = finfo(single)
+        assert_equal(id(ftype), id(ftype2))
+
+class TestDouble:
+    def test_singleton(self):
+        ftype = finfo(double)
+        ftype2 = finfo(double)
+        assert_equal(id(ftype), id(ftype2))
+
+class TestLongdouble:
+    def test_singleton(self):
+        ftype = finfo(longdouble)
+        ftype2 = finfo(longdouble)
+        assert_equal(id(ftype), id(ftype2))
+
+class TestFinfo:
+    def test_basic(self):
+        dts = list(zip(['f2', 'f4', 'f8', 'c8', 'c16'],
+                       [np.float16, np.float32, np.float64, np.complex64,
+                        np.complex128]))
+        for dt1, dt2 in dts:
+            for attr in ('bits', 'eps', 'epsneg', 'iexp', 'machar', 'machep',
+                         'max', 'maxexp', 'min', 'minexp', 'negep', 'nexp',
+                         'nmant', 'precision', 'resolution', 'tiny'):
+                assert_equal(getattr(finfo(dt1), attr),
+                             getattr(finfo(dt2), attr), attr)
+        assert_raises(ValueError, finfo, 'i4')
+
+class TestIinfo:
+    def test_basic(self):
+        dts = list(zip(['i1', 'i2', 'i4', 'i8',
+                   'u1', 'u2', 'u4', 'u8'],
+                  [np.int8, np.int16, np.int32, np.int64,
+                   np.uint8, np.uint16, np.uint32, np.uint64]))
+        for dt1, dt2 in dts:
+            for attr in ('bits', 'min', 'max'):
+                assert_equal(getattr(iinfo(dt1), attr),
+                             getattr(iinfo(dt2), attr), attr)
+        assert_raises(ValueError, iinfo, 'f4')
+
+    def test_unsigned_max(self):
+        types = np.sctypes['uint']
+        for T in types:
+            assert_equal(iinfo(T).max, T(-1))
+
+class TestRepr:
+    def test_iinfo_repr(self):
+        expected = "iinfo(min=-32768, max=32767, dtype=int16)"
+        assert_equal(repr(np.iinfo(np.int16)), expected)
+
+    def test_finfo_repr(self):
+        expected = "finfo(resolution=1e-06, min=-3.4028235e+38," + \
+                   " max=3.4028235e+38, dtype=float32)"
+        assert_equal(repr(np.finfo(np.float32)), expected)
+
+
+def test_instances():
+    iinfo(10)
+    finfo(3.0)
+
+
+def assert_ma_equal(discovered, ma_like):
+    # Check MachAr-like objects same as calculated MachAr instances
+    for key, value in discovered.__dict__.items():
+        assert_equal(value, getattr(ma_like, key))
+        if hasattr(value, 'shape'):
+            assert_equal(value.shape, getattr(ma_like, key).shape)
+            assert_equal(value.dtype, getattr(ma_like, key).dtype)
+
+
+def test_known_types():
+    # Test we are correctly compiling parameters for known types
+    for ftype, ma_like in ((np.float16, _float_ma[16]),
+                           (np.float32, _float_ma[32]),
+                           (np.float64, _float_ma[64])):
+        assert_ma_equal(_discovered_machar(ftype), ma_like)
+    # Suppress warning for broken discovery of double double on PPC
+    with np.errstate(all='ignore'):
+        ld_ma = _discovered_machar(np.longdouble)
+    bytes = np.dtype(np.longdouble).itemsize
+    if (ld_ma.it, ld_ma.maxexp) == (63, 16384) and bytes in (12, 16):
+        # 80-bit extended precision
+        assert_ma_equal(ld_ma, _float_ma[80])
+    elif (ld_ma.it, ld_ma.maxexp) == (112, 16384) and bytes == 16:
+        # IEE 754 128-bit
+        assert_ma_equal(ld_ma, _float_ma[128])
+
+
+def test_plausible_finfo():
+    # Assert that finfo returns reasonable results for all types
+    for ftype in np.sctypes['float'] + np.sctypes['complex']:
+        info = np.finfo(ftype)
+        assert_(info.nmant > 1)
+        assert_(info.minexp < -1)
+        assert_(info.maxexp > 1)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_half.py b/venv/Lib/site-packages/numpy/core/tests/test_half.py
new file mode 100644
index 000000000..ae9827bc7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_half.py
@@ -0,0 +1,539 @@
+import platform
+import pytest
+
+import numpy as np
+from numpy import uint16, float16, float32, float64
+from numpy.testing import assert_, assert_equal
+
+
+def assert_raises_fpe(strmatch, callable, *args, **kwargs):
+    try:
+        callable(*args, **kwargs)
+    except FloatingPointError as exc:
+        assert_(str(exc).find(strmatch) >= 0,
+                "Did not raise floating point %s error" % strmatch)
+    else:
+        assert_(False,
+                "Did not raise floating point %s error" % strmatch)
+
+class TestHalf:
+    def setup(self):
+        # An array of all possible float16 values
+        self.all_f16 = np.arange(0x10000, dtype=uint16)
+        self.all_f16.dtype = float16
+        self.all_f32 = np.array(self.all_f16, dtype=float32)
+        self.all_f64 = np.array(self.all_f16, dtype=float64)
+
+        # An array of all non-NaN float16 values, in sorted order
+        self.nonan_f16 = np.concatenate(
+                                (np.arange(0xfc00, 0x7fff, -1, dtype=uint16),
+                                 np.arange(0x0000, 0x7c01, 1, dtype=uint16)))
+        self.nonan_f16.dtype = float16
+        self.nonan_f32 = np.array(self.nonan_f16, dtype=float32)
+        self.nonan_f64 = np.array(self.nonan_f16, dtype=float64)
+
+        # An array of all finite float16 values, in sorted order
+        self.finite_f16 = self.nonan_f16[1:-1]
+        self.finite_f32 = self.nonan_f32[1:-1]
+        self.finite_f64 = self.nonan_f64[1:-1]
+
+    def test_half_conversions(self):
+        """Checks that all 16-bit values survive conversion
+           to/from 32-bit and 64-bit float"""
+        # Because the underlying routines preserve the NaN bits, every
+        # value is preserved when converting to/from other floats.
+
+        # Convert from float32 back to float16
+        b = np.array(self.all_f32, dtype=float16)
+        assert_equal(self.all_f16.view(dtype=uint16),
+                     b.view(dtype=uint16))
+
+        # Convert from float64 back to float16
+        b = np.array(self.all_f64, dtype=float16)
+        assert_equal(self.all_f16.view(dtype=uint16),
+                     b.view(dtype=uint16))
+
+        # Convert float16 to longdouble and back
+        # This doesn't necessarily preserve the extra NaN bits,
+        # so exclude NaNs.
+        a_ld = np.array(self.nonan_f16, dtype=np.longdouble)
+        b = np.array(a_ld, dtype=float16)
+        assert_equal(self.nonan_f16.view(dtype=uint16),
+                     b.view(dtype=uint16))
+
+        # Check the range for which all integers can be represented
+        i_int = np.arange(-2048, 2049)
+        i_f16 = np.array(i_int, dtype=float16)
+        j = np.array(i_f16, dtype=int)
+        assert_equal(i_int, j)
+
+    @pytest.mark.parametrize("offset", [None, "up", "down"])
+    @pytest.mark.parametrize("shift", [None, "up", "down"])
+    @pytest.mark.parametrize("float_t", [np.float32, np.float64])
+    def test_half_conversion_rounding(self, float_t, shift, offset):
+        # Assumes that round to even is used during casting.
+        max_pattern = np.float16(np.finfo(np.float16).max).view(np.uint16)
+
+        # Test all (positive) finite numbers, denormals are most interesting
+        # however:
+        f16s_patterns = np.arange(0, max_pattern+1, dtype=np.uint16)
+        f16s_float = f16s_patterns.view(np.float16).astype(float_t)
+
+        # Shift the values by half a bit up or a down (or do not shift),
+        if shift == "up":
+            f16s_float = 0.5 * (f16s_float[:-1] + f16s_float[1:])[1:]
+        elif shift == "down":
+            f16s_float = 0.5 * (f16s_float[:-1] + f16s_float[1:])[:-1]
+        else:
+            f16s_float = f16s_float[1:-1]
+
+        # Increase the float by a minimal value:
+        if offset == "up":
+            f16s_float = np.nextafter(f16s_float, float_t(1e50))
+        elif offset == "down":
+            f16s_float = np.nextafter(f16s_float, float_t(-1e50))
+
+        # Convert back to float16 and its bit pattern:
+        res_patterns = f16s_float.astype(np.float16).view(np.uint16)
+
+        # The above calculations tries the original values, or the exact
+        # mid points between the float16 values. It then further offsets them
+        # by as little as possible. If no offset occurs, "round to even"
+        # logic will be necessary, an arbitrarily small offset should cause
+        # normal up/down rounding always.
+
+        # Calculate the expected pattern:
+        cmp_patterns = f16s_patterns[1:-1].copy()
+
+        if shift == "down" and offset != "up":
+            shift_pattern = -1
+        elif shift == "up" and offset != "down":
+            shift_pattern = 1
+        else:
+            # There cannot be a shift, either shift is None, so all rounding
+            # will go back to original, or shift is reduced by offset too much.
+            shift_pattern = 0
+
+        # If rounding occurs, is it normal rounding or round to even?
+        if offset is None:
+            # Round to even occurs, modify only non-even, cast to allow + (-1)
+            cmp_patterns[0::2].view(np.int16)[...] += shift_pattern
+        else:
+            cmp_patterns.view(np.int16)[...] += shift_pattern
+
+        assert_equal(res_patterns, cmp_patterns)
+
+    @pytest.mark.parametrize(["float_t", "uint_t", "bits"],
+                             [(np.float32, np.uint32, 23),
+                              (np.float64, np.uint64, 52)])
+    def test_half_conversion_denormal_round_even(self, float_t, uint_t, bits):
+        # Test specifically that all bits are considered when deciding
+        # whether round to even should occur (i.e. no bits are lost at the
+        # end. Compare also gh-12721. The most bits can get lost for the
+        # smallest denormal:
+        smallest_value = np.uint16(1).view(np.float16).astype(float_t)
+        assert smallest_value == 2**-24
+
+        # Will be rounded to zero based on round to even rule:
+        rounded_to_zero = smallest_value / float_t(2)
+        assert rounded_to_zero.astype(np.float16) == 0
+
+        # The significand will be all 0 for the float_t, test that we do not
+        # lose the lower ones of these:
+        for i in range(bits):
+            # slightly increasing the value should make it round up:
+            larger_pattern = rounded_to_zero.view(uint_t) | uint_t(1 << i)
+            larger_value = larger_pattern.view(float_t)
+            assert larger_value.astype(np.float16) == smallest_value
+
+    def test_nans_infs(self):
+        with np.errstate(all='ignore'):
+            # Check some of the ufuncs
+            assert_equal(np.isnan(self.all_f16), np.isnan(self.all_f32))
+            assert_equal(np.isinf(self.all_f16), np.isinf(self.all_f32))
+            assert_equal(np.isfinite(self.all_f16), np.isfinite(self.all_f32))
+            assert_equal(np.signbit(self.all_f16), np.signbit(self.all_f32))
+            assert_equal(np.spacing(float16(65504)), np.inf)
+
+            # Check comparisons of all values with NaN
+            nan = float16(np.nan)
+
+            assert_(not (self.all_f16 == nan).any())
+            assert_(not (nan == self.all_f16).any())
+
+            assert_((self.all_f16 != nan).all())
+            assert_((nan != self.all_f16).all())
+
+            assert_(not (self.all_f16 < nan).any())
+            assert_(not (nan < self.all_f16).any())
+
+            assert_(not (self.all_f16 <= nan).any())
+            assert_(not (nan <= self.all_f16).any())
+
+            assert_(not (self.all_f16 > nan).any())
+            assert_(not (nan > self.all_f16).any())
+
+            assert_(not (self.all_f16 >= nan).any())
+            assert_(not (nan >= self.all_f16).any())
+
+    def test_half_values(self):
+        """Confirms a small number of known half values"""
+        a = np.array([1.0, -1.0,
+                      2.0, -2.0,
+                      0.0999755859375, 0.333251953125,  # 1/10, 1/3
+                      65504, -65504,           # Maximum magnitude
+                      2.0**(-14), -2.0**(-14),  # Minimum normal
+                      2.0**(-24), -2.0**(-24),  # Minimum subnormal
+                      0, -1/1e1000,            # Signed zeros
+                      np.inf, -np.inf])
+        b = np.array([0x3c00, 0xbc00,
+                      0x4000, 0xc000,
+                      0x2e66, 0x3555,
+                      0x7bff, 0xfbff,
+                      0x0400, 0x8400,
+                      0x0001, 0x8001,
+                      0x0000, 0x8000,
+                      0x7c00, 0xfc00], dtype=uint16)
+        b.dtype = float16
+        assert_equal(a, b)
+
+    def test_half_rounding(self):
+        """Checks that rounding when converting to half is correct"""
+        a = np.array([2.0**-25 + 2.0**-35,  # Rounds to minimum subnormal
+                      2.0**-25,       # Underflows to zero (nearest even mode)
+                      2.0**-26,       # Underflows to zero
+                      1.0+2.0**-11 + 2.0**-16,  # rounds to 1.0+2**(-10)
+                      1.0+2.0**-11,   # rounds to 1.0 (nearest even mode)
+                      1.0+2.0**-12,   # rounds to 1.0
+                      65519,          # rounds to 65504
+                      65520],         # rounds to inf
+                      dtype=float64)
+        rounded = [2.0**-24,
+                   0.0,
+                   0.0,
+                   1.0+2.0**(-10),
+                   1.0,
+                   1.0,
+                   65504,
+                   np.inf]
+
+        # Check float64->float16 rounding
+        b = np.array(a, dtype=float16)
+        assert_equal(b, rounded)
+
+        # Check float32->float16 rounding
+        a = np.array(a, dtype=float32)
+        b = np.array(a, dtype=float16)
+        assert_equal(b, rounded)
+
+    def test_half_correctness(self):
+        """Take every finite float16, and check the casting functions with
+           a manual conversion."""
+
+        # Create an array of all finite float16s
+        a_bits = self.finite_f16.view(dtype=uint16)
+
+        # Convert to 64-bit float manually
+        a_sgn = (-1.0)**((a_bits & 0x8000) >> 15)
+        a_exp = np.array((a_bits & 0x7c00) >> 10, dtype=np.int32) - 15
+        a_man = (a_bits & 0x03ff) * 2.0**(-10)
+        # Implicit bit of normalized floats
+        a_man[a_exp != -15] += 1
+        # Denormalized exponent is -14
+        a_exp[a_exp == -15] = -14
+
+        a_manual = a_sgn * a_man * 2.0**a_exp
+
+        a32_fail = np.nonzero(self.finite_f32 != a_manual)[0]
+        if len(a32_fail) != 0:
+            bad_index = a32_fail[0]
+            assert_equal(self.finite_f32, a_manual,
+                 "First non-equal is half value %x -> %g != %g" %
+                            (self.finite_f16[bad_index],
+                             self.finite_f32[bad_index],
+                             a_manual[bad_index]))
+
+        a64_fail = np.nonzero(self.finite_f64 != a_manual)[0]
+        if len(a64_fail) != 0:
+            bad_index = a64_fail[0]
+            assert_equal(self.finite_f64, a_manual,
+                 "First non-equal is half value %x -> %g != %g" %
+                            (self.finite_f16[bad_index],
+                             self.finite_f64[bad_index],
+                             a_manual[bad_index]))
+
+    def test_half_ordering(self):
+        """Make sure comparisons are working right"""
+
+        # All non-NaN float16 values in reverse order
+        a = self.nonan_f16[::-1].copy()
+
+        # 32-bit float copy
+        b = np.array(a, dtype=float32)
+
+        # Should sort the same
+        a.sort()
+        b.sort()
+        assert_equal(a, b)
+
+        # Comparisons should work
+        assert_((a[:-1] <= a[1:]).all())
+        assert_(not (a[:-1] > a[1:]).any())
+        assert_((a[1:] >= a[:-1]).all())
+        assert_(not (a[1:] < a[:-1]).any())
+        # All != except for +/-0
+        assert_equal(np.nonzero(a[:-1] < a[1:])[0].size, a.size-2)
+        assert_equal(np.nonzero(a[1:] > a[:-1])[0].size, a.size-2)
+
+    def test_half_funcs(self):
+        """Test the various ArrFuncs"""
+
+        # fill
+        assert_equal(np.arange(10, dtype=float16),
+                     np.arange(10, dtype=float32))
+
+        # fillwithscalar
+        a = np.zeros((5,), dtype=float16)
+        a.fill(1)
+        assert_equal(a, np.ones((5,), dtype=float16))
+
+        # nonzero and copyswap
+        a = np.array([0, 0, -1, -1/1e20, 0, 2.0**-24, 7.629e-6], dtype=float16)
+        assert_equal(a.nonzero()[0],
+                     [2, 5, 6])
+        a = a.byteswap().newbyteorder()
+        assert_equal(a.nonzero()[0],
+                     [2, 5, 6])
+
+        # dot
+        a = np.arange(0, 10, 0.5, dtype=float16)
+        b = np.ones((20,), dtype=float16)
+        assert_equal(np.dot(a, b),
+                     95)
+
+        # argmax
+        a = np.array([0, -np.inf, -2, 0.5, 12.55, 7.3, 2.1, 12.4], dtype=float16)
+        assert_equal(a.argmax(),
+                     4)
+        a = np.array([0, -np.inf, -2, np.inf, 12.55, np.nan, 2.1, 12.4], dtype=float16)
+        assert_equal(a.argmax(),
+                     5)
+
+        # getitem
+        a = np.arange(10, dtype=float16)
+        for i in range(10):
+            assert_equal(a.item(i), i)
+
+    def test_spacing_nextafter(self):
+        """Test np.spacing and np.nextafter"""
+        # All non-negative finite #'s
+        a = np.arange(0x7c00, dtype=uint16)
+        hinf = np.array((np.inf,), dtype=float16)
+        hnan = np.array((np.nan,), dtype=float16)
+        a_f16 = a.view(dtype=float16)
+
+        assert_equal(np.spacing(a_f16[:-1]), a_f16[1:]-a_f16[:-1])
+
+        assert_equal(np.nextafter(a_f16[:-1], hinf), a_f16[1:])
+        assert_equal(np.nextafter(a_f16[0], -hinf), -a_f16[1])
+        assert_equal(np.nextafter(a_f16[1:], -hinf), a_f16[:-1])
+
+        assert_equal(np.nextafter(hinf, a_f16), a_f16[-1])
+        assert_equal(np.nextafter(-hinf, a_f16), -a_f16[-1])
+
+        assert_equal(np.nextafter(hinf, hinf), hinf)
+        assert_equal(np.nextafter(hinf, -hinf), a_f16[-1])
+        assert_equal(np.nextafter(-hinf, hinf), -a_f16[-1])
+        assert_equal(np.nextafter(-hinf, -hinf), -hinf)
+
+        assert_equal(np.nextafter(a_f16, hnan), hnan[0])
+        assert_equal(np.nextafter(hnan, a_f16), hnan[0])
+
+        assert_equal(np.nextafter(hnan, hnan), hnan)
+        assert_equal(np.nextafter(hinf, hnan), hnan)
+        assert_equal(np.nextafter(hnan, hinf), hnan)
+
+        # switch to negatives
+        a |= 0x8000
+
+        assert_equal(np.spacing(a_f16[0]), np.spacing(a_f16[1]))
+        assert_equal(np.spacing(a_f16[1:]), a_f16[:-1]-a_f16[1:])
+
+        assert_equal(np.nextafter(a_f16[0], hinf), -a_f16[1])
+        assert_equal(np.nextafter(a_f16[1:], hinf), a_f16[:-1])
+        assert_equal(np.nextafter(a_f16[:-1], -hinf), a_f16[1:])
+
+        assert_equal(np.nextafter(hinf, a_f16), -a_f16[-1])
+        assert_equal(np.nextafter(-hinf, a_f16), a_f16[-1])
+
+        assert_equal(np.nextafter(a_f16, hnan), hnan[0])
+        assert_equal(np.nextafter(hnan, a_f16), hnan[0])
+
+    def test_half_ufuncs(self):
+        """Test the various ufuncs"""
+
+        a = np.array([0, 1, 2, 4, 2], dtype=float16)
+        b = np.array([-2, 5, 1, 4, 3], dtype=float16)
+        c = np.array([0, -1, -np.inf, np.nan, 6], dtype=float16)
+
+        assert_equal(np.add(a, b), [-2, 6, 3, 8, 5])
+        assert_equal(np.subtract(a, b), [2, -4, 1, 0, -1])
+        assert_equal(np.multiply(a, b), [0, 5, 2, 16, 6])
+        assert_equal(np.divide(a, b), [0, 0.199951171875, 2, 1, 0.66650390625])
+
+        assert_equal(np.equal(a, b), [False, False, False, True, False])
+        assert_equal(np.not_equal(a, b), [True, True, True, False, True])
+        assert_equal(np.less(a, b), [False, True, False, False, True])
+        assert_equal(np.less_equal(a, b), [False, True, False, True, True])
+        assert_equal(np.greater(a, b), [True, False, True, False, False])
+        assert_equal(np.greater_equal(a, b), [True, False, True, True, False])
+        assert_equal(np.logical_and(a, b), [False, True, True, True, True])
+        assert_equal(np.logical_or(a, b), [True, True, True, True, True])
+        assert_equal(np.logical_xor(a, b), [True, False, False, False, False])
+        assert_equal(np.logical_not(a), [True, False, False, False, False])
+
+        assert_equal(np.isnan(c), [False, False, False, True, False])
+        assert_equal(np.isinf(c), [False, False, True, False, False])
+        assert_equal(np.isfinite(c), [True, True, False, False, True])
+        assert_equal(np.signbit(b), [True, False, False, False, False])
+
+        assert_equal(np.copysign(b, a), [2, 5, 1, 4, 3])
+
+        assert_equal(np.maximum(a, b), [0, 5, 2, 4, 3])
+
+        x = np.maximum(b, c)
+        assert_(np.isnan(x[3]))
+        x[3] = 0
+        assert_equal(x, [0, 5, 1, 0, 6])
+
+        assert_equal(np.minimum(a, b), [-2, 1, 1, 4, 2])
+
+        x = np.minimum(b, c)
+        assert_(np.isnan(x[3]))
+        x[3] = 0
+        assert_equal(x, [-2, -1, -np.inf, 0, 3])
+
+        assert_equal(np.fmax(a, b), [0, 5, 2, 4, 3])
+        assert_equal(np.fmax(b, c), [0, 5, 1, 4, 6])
+        assert_equal(np.fmin(a, b), [-2, 1, 1, 4, 2])
+        assert_equal(np.fmin(b, c), [-2, -1, -np.inf, 4, 3])
+
+        assert_equal(np.floor_divide(a, b), [0, 0, 2, 1, 0])
+        assert_equal(np.remainder(a, b), [0, 1, 0, 0, 2])
+        assert_equal(np.divmod(a, b), ([0, 0, 2, 1, 0], [0, 1, 0, 0, 2]))
+        assert_equal(np.square(b), [4, 25, 1, 16, 9])
+        assert_equal(np.reciprocal(b), [-0.5, 0.199951171875, 1, 0.25, 0.333251953125])
+        assert_equal(np.ones_like(b), [1, 1, 1, 1, 1])
+        assert_equal(np.conjugate(b), b)
+        assert_equal(np.absolute(b), [2, 5, 1, 4, 3])
+        assert_equal(np.negative(b), [2, -5, -1, -4, -3])
+        assert_equal(np.positive(b), b)
+        assert_equal(np.sign(b), [-1, 1, 1, 1, 1])
+        assert_equal(np.modf(b), ([0, 0, 0, 0, 0], b))
+        assert_equal(np.frexp(b), ([-0.5, 0.625, 0.5, 0.5, 0.75], [2, 3, 1, 3, 2]))
+        assert_equal(np.ldexp(b, [0, 1, 2, 4, 2]), [-2, 10, 4, 64, 12])
+
+    def test_half_coercion(self):
+        """Test that half gets coerced properly with the other types"""
+        a16 = np.array((1,), dtype=float16)
+        a32 = np.array((1,), dtype=float32)
+        b16 = float16(1)
+        b32 = float32(1)
+
+        assert_equal(np.power(a16, 2).dtype, float16)
+        assert_equal(np.power(a16, 2.0).dtype, float16)
+        assert_equal(np.power(a16, b16).dtype, float16)
+        assert_equal(np.power(a16, b32).dtype, float16)
+        assert_equal(np.power(a16, a16).dtype, float16)
+        assert_equal(np.power(a16, a32).dtype, float32)
+
+        assert_equal(np.power(b16, 2).dtype, float64)
+        assert_equal(np.power(b16, 2.0).dtype, float64)
+        assert_equal(np.power(b16, b16).dtype, float16)
+        assert_equal(np.power(b16, b32).dtype, float32)
+        assert_equal(np.power(b16, a16).dtype, float16)
+        assert_equal(np.power(b16, a32).dtype, float32)
+
+        assert_equal(np.power(a32, a16).dtype, float32)
+        assert_equal(np.power(a32, b16).dtype, float32)
+        assert_equal(np.power(b32, a16).dtype, float16)
+        assert_equal(np.power(b32, b16).dtype, float32)
+
+    @pytest.mark.skipif(platform.machine() == "armv5tel",
+                        reason="See gh-413.")
+    def test_half_fpe(self):
+        with np.errstate(all='raise'):
+            sx16 = np.array((1e-4,), dtype=float16)
+            bx16 = np.array((1e4,), dtype=float16)
+            sy16 = float16(1e-4)
+            by16 = float16(1e4)
+
+            # Underflow errors
+            assert_raises_fpe('underflow', lambda a, b:a*b, sx16, sx16)
+            assert_raises_fpe('underflow', lambda a, b:a*b, sx16, sy16)
+            assert_raises_fpe('underflow', lambda a, b:a*b, sy16, sx16)
+            assert_raises_fpe('underflow', lambda a, b:a*b, sy16, sy16)
+            assert_raises_fpe('underflow', lambda a, b:a/b, sx16, bx16)
+            assert_raises_fpe('underflow', lambda a, b:a/b, sx16, by16)
+            assert_raises_fpe('underflow', lambda a, b:a/b, sy16, bx16)
+            assert_raises_fpe('underflow', lambda a, b:a/b, sy16, by16)
+            assert_raises_fpe('underflow', lambda a, b:a/b,
+                                             float16(2.**-14), float16(2**11))
+            assert_raises_fpe('underflow', lambda a, b:a/b,
+                                             float16(-2.**-14), float16(2**11))
+            assert_raises_fpe('underflow', lambda a, b:a/b,
+                                             float16(2.**-14+2**-24), float16(2))
+            assert_raises_fpe('underflow', lambda a, b:a/b,
+                                             float16(-2.**-14-2**-24), float16(2))
+            assert_raises_fpe('underflow', lambda a, b:a/b,
+                                             float16(2.**-14+2**-23), float16(4))
+
+            # Overflow errors
+            assert_raises_fpe('overflow', lambda a, b:a*b, bx16, bx16)
+            assert_raises_fpe('overflow', lambda a, b:a*b, bx16, by16)
+            assert_raises_fpe('overflow', lambda a, b:a*b, by16, bx16)
+            assert_raises_fpe('overflow', lambda a, b:a*b, by16, by16)
+            assert_raises_fpe('overflow', lambda a, b:a/b, bx16, sx16)
+            assert_raises_fpe('overflow', lambda a, b:a/b, bx16, sy16)
+            assert_raises_fpe('overflow', lambda a, b:a/b, by16, sx16)
+            assert_raises_fpe('overflow', lambda a, b:a/b, by16, sy16)
+            assert_raises_fpe('overflow', lambda a, b:a+b,
+                                             float16(65504), float16(17))
+            assert_raises_fpe('overflow', lambda a, b:a-b,
+                                             float16(-65504), float16(17))
+            assert_raises_fpe('overflow', np.nextafter, float16(65504), float16(np.inf))
+            assert_raises_fpe('overflow', np.nextafter, float16(-65504), float16(-np.inf))
+            assert_raises_fpe('overflow', np.spacing, float16(65504))
+
+            # Invalid value errors
+            assert_raises_fpe('invalid', np.divide, float16(np.inf), float16(np.inf))
+            assert_raises_fpe('invalid', np.spacing, float16(np.inf))
+            assert_raises_fpe('invalid', np.spacing, float16(np.nan))
+
+            # These should not raise
+            float16(65472)+float16(32)
+            float16(2**-13)/float16(2)
+            float16(2**-14)/float16(2**10)
+            np.spacing(float16(-65504))
+            np.nextafter(float16(65504), float16(-np.inf))
+            np.nextafter(float16(-65504), float16(np.inf))
+            np.nextafter(float16(np.inf), float16(0))
+            np.nextafter(float16(-np.inf), float16(0))
+            np.nextafter(float16(0), float16(np.nan))
+            np.nextafter(float16(np.nan), float16(0))
+            float16(2**-14)/float16(2**10)
+            float16(-2**-14)/float16(2**10)
+            float16(2**-14+2**-23)/float16(2)
+            float16(-2**-14-2**-23)/float16(2)
+
+    def test_half_array_interface(self):
+        """Test that half is compatible with __array_interface__"""
+        class Dummy:
+            pass
+
+        a = np.ones((1,), dtype=float16)
+        b = Dummy()
+        b.__array_interface__ = a.__array_interface__
+        c = np.array(b)
+        assert_(c.dtype == float16)
+        assert_equal(a, c)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_indexerrors.py b/venv/Lib/site-packages/numpy/core/tests/test_indexerrors.py
new file mode 100644
index 000000000..a0e9a8c55
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_indexerrors.py
@@ -0,0 +1,133 @@
+import numpy as np
+from numpy.testing import (
+        assert_raises, assert_raises_regex,
+        )
+
+
+class TestIndexErrors:
+    '''Tests to exercise indexerrors not covered by other tests.'''
+
+    def test_arraytypes_fasttake(self):
+        'take from a 0-length dimension'
+        x = np.empty((2, 3, 0, 4))
+        assert_raises(IndexError, x.take, [0], axis=2)
+        assert_raises(IndexError, x.take, [1], axis=2)
+        assert_raises(IndexError, x.take, [0], axis=2, mode='wrap')
+        assert_raises(IndexError, x.take, [0], axis=2, mode='clip')
+
+    def test_take_from_object(self):
+        # Check exception taking from object array
+        d = np.zeros(5, dtype=object)
+        assert_raises(IndexError, d.take, [6])
+
+        # Check exception taking from 0-d array
+        d = np.zeros((5, 0), dtype=object)
+        assert_raises(IndexError, d.take, [1], axis=1)
+        assert_raises(IndexError, d.take, [0], axis=1)
+        assert_raises(IndexError, d.take, [0])
+        assert_raises(IndexError, d.take, [0], mode='wrap')
+        assert_raises(IndexError, d.take, [0], mode='clip')
+
+    def test_multiindex_exceptions(self):
+        a = np.empty(5, dtype=object)
+        assert_raises(IndexError, a.item, 20)
+        a = np.empty((5, 0), dtype=object)
+        assert_raises(IndexError, a.item, (0, 0))
+
+        a = np.empty(5, dtype=object)
+        assert_raises(IndexError, a.itemset, 20, 0)
+        a = np.empty((5, 0), dtype=object)
+        assert_raises(IndexError, a.itemset, (0, 0), 0)
+
+    def test_put_exceptions(self):
+        a = np.zeros((5, 5))
+        assert_raises(IndexError, a.put, 100, 0)
+        a = np.zeros((5, 5), dtype=object)
+        assert_raises(IndexError, a.put, 100, 0)
+        a = np.zeros((5, 5, 0))
+        assert_raises(IndexError, a.put, 100, 0)
+        a = np.zeros((5, 5, 0), dtype=object)
+        assert_raises(IndexError, a.put, 100, 0)
+
+    def test_iterators_exceptions(self):
+        "cases in iterators.c"
+        def assign(obj, ind, val):
+            obj[ind] = val
+
+        a = np.zeros([1, 2, 3])
+        assert_raises(IndexError, lambda: a[0, 5, None, 2])
+        assert_raises(IndexError, lambda: a[0, 5, 0, 2])
+        assert_raises(IndexError, lambda: assign(a, (0, 5, None, 2), 1))
+        assert_raises(IndexError, lambda: assign(a, (0, 5, 0, 2),  1))
+
+        a = np.zeros([1, 0, 3])
+        assert_raises(IndexError, lambda: a[0, 0, None, 2])
+        assert_raises(IndexError, lambda: assign(a, (0, 0, None, 2), 1))
+
+        a = np.zeros([1, 2, 3])
+        assert_raises(IndexError, lambda: a.flat[10])
+        assert_raises(IndexError, lambda: assign(a.flat, 10, 5))
+        a = np.zeros([1, 0, 3])
+        assert_raises(IndexError, lambda: a.flat[10])
+        assert_raises(IndexError, lambda: assign(a.flat, 10, 5))
+
+        a = np.zeros([1, 2, 3])
+        assert_raises(IndexError, lambda: a.flat[np.array(10)])
+        assert_raises(IndexError, lambda: assign(a.flat, np.array(10), 5))
+        a = np.zeros([1, 0, 3])
+        assert_raises(IndexError, lambda: a.flat[np.array(10)])
+        assert_raises(IndexError, lambda: assign(a.flat, np.array(10), 5))
+
+        a = np.zeros([1, 2, 3])
+        assert_raises(IndexError, lambda: a.flat[np.array([10])])
+        assert_raises(IndexError, lambda: assign(a.flat, np.array([10]), 5))
+        a = np.zeros([1, 0, 3])
+        assert_raises(IndexError, lambda: a.flat[np.array([10])])
+        assert_raises(IndexError, lambda: assign(a.flat, np.array([10]), 5))
+
+    def test_mapping(self):
+        "cases from mapping.c"
+
+        def assign(obj, ind, val):
+            obj[ind] = val
+
+        a = np.zeros((0, 10))
+        assert_raises(IndexError, lambda: a[12])
+
+        a = np.zeros((3, 5))
+        assert_raises(IndexError, lambda: a[(10, 20)])
+        assert_raises(IndexError, lambda: assign(a, (10, 20), 1))
+        a = np.zeros((3, 0))
+        assert_raises(IndexError, lambda: a[(1, 0)])
+        assert_raises(IndexError, lambda: assign(a, (1, 0), 1))
+
+        a = np.zeros((10,))
+        assert_raises(IndexError, lambda: assign(a, 10, 1))
+        a = np.zeros((0,))
+        assert_raises(IndexError, lambda: assign(a, 10, 1))
+
+        a = np.zeros((3, 5))
+        assert_raises(IndexError, lambda: a[(1, [1, 20])])
+        assert_raises(IndexError, lambda: assign(a, (1, [1, 20]), 1))
+        a = np.zeros((3, 0))
+        assert_raises(IndexError, lambda: a[(1, [0, 1])])
+        assert_raises(IndexError, lambda: assign(a, (1, [0, 1]), 1))
+
+    def test_mapping_error_message(self):
+        a = np.zeros((3, 5))
+        index = (1, 2, 3, 4, 5)
+        assert_raises_regex(
+                IndexError,
+                "too many indices for array: "
+                "array is 2-dimensional, but 5 were indexed",
+                lambda: a[index])
+
+    def test_methods(self):
+        "cases from methods.c"
+
+        a = np.zeros((3, 3))
+        assert_raises(IndexError, lambda: a.item(100))
+        assert_raises(IndexError, lambda: a.itemset(100, 1))
+        a = np.zeros((0, 3))
+        assert_raises(IndexError, lambda: a.item(100))
+        assert_raises(IndexError, lambda: a.itemset(100, 1))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_indexing.py b/venv/Lib/site-packages/numpy/core/tests/test_indexing.py
new file mode 100644
index 000000000..4bb5cb11a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_indexing.py
@@ -0,0 +1,1296 @@
+import sys
+import warnings
+import functools
+import operator
+
+import numpy as np
+from numpy.core._multiarray_tests import array_indexing
+from itertools import product
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_array_equal, assert_warns,
+    HAS_REFCOUNT,
+    )
+
+
+class TestIndexing:
+    def test_index_no_floats(self):
+        a = np.array([[[5]]])
+
+        assert_raises(IndexError, lambda: a[0.0])
+        assert_raises(IndexError, lambda: a[0, 0.0])
+        assert_raises(IndexError, lambda: a[0.0, 0])
+        assert_raises(IndexError, lambda: a[0.0,:])
+        assert_raises(IndexError, lambda: a[:, 0.0])
+        assert_raises(IndexError, lambda: a[:, 0.0,:])
+        assert_raises(IndexError, lambda: a[0.0,:,:])
+        assert_raises(IndexError, lambda: a[0, 0, 0.0])
+        assert_raises(IndexError, lambda: a[0.0, 0, 0])
+        assert_raises(IndexError, lambda: a[0, 0.0, 0])
+        assert_raises(IndexError, lambda: a[-1.4])
+        assert_raises(IndexError, lambda: a[0, -1.4])
+        assert_raises(IndexError, lambda: a[-1.4, 0])
+        assert_raises(IndexError, lambda: a[-1.4,:])
+        assert_raises(IndexError, lambda: a[:, -1.4])
+        assert_raises(IndexError, lambda: a[:, -1.4,:])
+        assert_raises(IndexError, lambda: a[-1.4,:,:])
+        assert_raises(IndexError, lambda: a[0, 0, -1.4])
+        assert_raises(IndexError, lambda: a[-1.4, 0, 0])
+        assert_raises(IndexError, lambda: a[0, -1.4, 0])
+        assert_raises(IndexError, lambda: a[0.0:, 0.0])
+        assert_raises(IndexError, lambda: a[0.0:, 0.0,:])
+
+    def test_slicing_no_floats(self):
+        a = np.array([[5]])
+
+        # start as float.
+        assert_raises(TypeError, lambda: a[0.0:])
+        assert_raises(TypeError, lambda: a[0:, 0.0:2])
+        assert_raises(TypeError, lambda: a[0.0::2, :0])
+        assert_raises(TypeError, lambda: a[0.0:1:2,:])
+        assert_raises(TypeError, lambda: a[:, 0.0:])
+        # stop as float.
+        assert_raises(TypeError, lambda: a[:0.0])
+        assert_raises(TypeError, lambda: a[:0, 1:2.0])
+        assert_raises(TypeError, lambda: a[:0.0:2, :0])
+        assert_raises(TypeError, lambda: a[:0.0,:])
+        assert_raises(TypeError, lambda: a[:, 0:4.0:2])
+        # step as float.
+        assert_raises(TypeError, lambda: a[::1.0])
+        assert_raises(TypeError, lambda: a[0:, :2:2.0])
+        assert_raises(TypeError, lambda: a[1::4.0, :0])
+        assert_raises(TypeError, lambda: a[::5.0,:])
+        assert_raises(TypeError, lambda: a[:, 0:4:2.0])
+        # mixed.
+        assert_raises(TypeError, lambda: a[1.0:2:2.0])
+        assert_raises(TypeError, lambda: a[1.0::2.0])
+        assert_raises(TypeError, lambda: a[0:, :2.0:2.0])
+        assert_raises(TypeError, lambda: a[1.0:1:4.0, :0])
+        assert_raises(TypeError, lambda: a[1.0:5.0:5.0,:])
+        assert_raises(TypeError, lambda: a[:, 0.4:4.0:2.0])
+        # should still get the DeprecationWarning if step = 0.
+        assert_raises(TypeError, lambda: a[::0.0])
+
+    def test_index_no_array_to_index(self):
+        # No non-scalar arrays.
+        a = np.array([[[1]]])
+
+        assert_raises(TypeError, lambda: a[a:a:a])
+
+    def test_none_index(self):
+        # `None` index adds newaxis
+        a = np.array([1, 2, 3])
+        assert_equal(a[None], a[np.newaxis])
+        assert_equal(a[None].ndim, a.ndim + 1)
+
+    def test_empty_tuple_index(self):
+        # Empty tuple index creates a view
+        a = np.array([1, 2, 3])
+        assert_equal(a[()], a)
+        assert_(a[()].base is a)
+        a = np.array(0)
+        assert_(isinstance(a[()], np.int_))
+
+    def test_void_scalar_empty_tuple(self):
+        s = np.zeros((), dtype='V4')
+        assert_equal(s[()].dtype, s.dtype)
+        assert_equal(s[()], s)
+        assert_equal(type(s[...]), np.ndarray)
+
+    def test_same_kind_index_casting(self):
+        # Indexes should be cast with same-kind and not safe, even if that
+        # is somewhat unsafe. So test various different code paths.
+        index = np.arange(5)
+        u_index = index.astype(np.uintp)
+        arr = np.arange(10)
+
+        assert_array_equal(arr[index], arr[u_index])
+        arr[u_index] = np.arange(5)
+        assert_array_equal(arr, np.arange(10))
+
+        arr = np.arange(10).reshape(5, 2)
+        assert_array_equal(arr[index], arr[u_index])
+
+        arr[u_index] = np.arange(5)[:,None]
+        assert_array_equal(arr, np.arange(5)[:,None].repeat(2, axis=1))
+
+        arr = np.arange(25).reshape(5, 5)
+        assert_array_equal(arr[u_index, u_index], arr[index, index])
+
+    def test_empty_fancy_index(self):
+        # Empty list index creates an empty array
+        # with the same dtype (but with weird shape)
+        a = np.array([1, 2, 3])
+        assert_equal(a[[]], [])
+        assert_equal(a[[]].dtype, a.dtype)
+
+        b = np.array([], dtype=np.intp)
+        assert_equal(a[[]], [])
+        assert_equal(a[[]].dtype, a.dtype)
+
+        b = np.array([])
+        assert_raises(IndexError, a.__getitem__, b)
+
+    def test_ellipsis_index(self):
+        a = np.array([[1, 2, 3],
+                      [4, 5, 6],
+                      [7, 8, 9]])
+        assert_(a[...] is not a)
+        assert_equal(a[...], a)
+        # `a[...]` was `a` in numpy <1.9.
+        assert_(a[...].base is a)
+
+        # Slicing with ellipsis can skip an
+        # arbitrary number of dimensions
+        assert_equal(a[0, ...], a[0])
+        assert_equal(a[0, ...], a[0,:])
+        assert_equal(a[..., 0], a[:, 0])
+
+        # Slicing with ellipsis always results
+        # in an array, not a scalar
+        assert_equal(a[0, ..., 1], np.array(2))
+
+        # Assignment with `(Ellipsis,)` on 0-d arrays
+        b = np.array(1)
+        b[(Ellipsis,)] = 2
+        assert_equal(b, 2)
+
+    def test_single_int_index(self):
+        # Single integer index selects one row
+        a = np.array([[1, 2, 3],
+                      [4, 5, 6],
+                      [7, 8, 9]])
+
+        assert_equal(a[0], [1, 2, 3])
+        assert_equal(a[-1], [7, 8, 9])
+
+        # Index out of bounds produces IndexError
+        assert_raises(IndexError, a.__getitem__, 1 << 30)
+        # Index overflow produces IndexError
+        assert_raises(IndexError, a.__getitem__, 1 << 64)
+
+    def test_single_bool_index(self):
+        # Single boolean index
+        a = np.array([[1, 2, 3],
+                      [4, 5, 6],
+                      [7, 8, 9]])
+
+        assert_equal(a[np.array(True)], a[None])
+        assert_equal(a[np.array(False)], a[None][0:0])
+
+    def test_boolean_shape_mismatch(self):
+        arr = np.ones((5, 4, 3))
+
+        index = np.array([True])
+        assert_raises(IndexError, arr.__getitem__, index)
+
+        index = np.array([False] * 6)
+        assert_raises(IndexError, arr.__getitem__, index)
+
+        index = np.zeros((4, 4), dtype=bool)
+        assert_raises(IndexError, arr.__getitem__, index)
+
+        assert_raises(IndexError, arr.__getitem__, (slice(None), index))
+
+    def test_boolean_indexing_onedim(self):
+        # Indexing a 2-dimensional array with
+        # boolean array of length one
+        a = np.array([[ 0.,  0.,  0.]])
+        b = np.array([ True], dtype=bool)
+        assert_equal(a[b], a)
+        # boolean assignment
+        a[b] = 1.
+        assert_equal(a, [[1., 1., 1.]])
+
+    def test_boolean_assignment_value_mismatch(self):
+        # A boolean assignment should fail when the shape of the values
+        # cannot be broadcast to the subscription. (see also gh-3458)
+        a = np.arange(4)
+
+        def f(a, v):
+            a[a > -1] = v
+
+        assert_raises(ValueError, f, a, [])
+        assert_raises(ValueError, f, a, [1, 2, 3])
+        assert_raises(ValueError, f, a[:1], [1, 2, 3])
+
+    def test_boolean_assignment_needs_api(self):
+        # See also gh-7666
+        # This caused a segfault on Python 2 due to the GIL not being
+        # held when the iterator does not need it, but the transfer function
+        # does
+        arr = np.zeros(1000)
+        indx = np.zeros(1000, dtype=bool)
+        indx[:100] = True
+        arr[indx] = np.ones(100, dtype=object)
+
+        expected = np.zeros(1000)
+        expected[:100] = 1
+        assert_array_equal(arr, expected)
+
+    def test_boolean_indexing_twodim(self):
+        # Indexing a 2-dimensional array with
+        # 2-dimensional boolean array
+        a = np.array([[1, 2, 3],
+                      [4, 5, 6],
+                      [7, 8, 9]])
+        b = np.array([[ True, False,  True],
+                      [False,  True, False],
+                      [ True, False,  True]])
+        assert_equal(a[b], [1, 3, 5, 7, 9])
+        assert_equal(a[b[1]], [[4, 5, 6]])
+        assert_equal(a[b[0]], a[b[2]])
+
+        # boolean assignment
+        a[b] = 0
+        assert_equal(a, [[0, 2, 0],
+                         [4, 0, 6],
+                         [0, 8, 0]])
+
+    def test_boolean_indexing_list(self):
+        # Regression test for #13715. It's a use-after-free bug which the
+        # test won't directly catch, but it will show up in valgrind.
+        a = np.array([1, 2, 3])
+        b = [True, False, True]
+        # Two variants of the test because the first takes a fast path
+        assert_equal(a[b], [1, 3])
+        assert_equal(a[None, b], [[1, 3]])
+
+    def test_reverse_strides_and_subspace_bufferinit(self):
+        # This tests that the strides are not reversed for simple and
+        # subspace fancy indexing.
+        a = np.ones(5)
+        b = np.zeros(5, dtype=np.intp)[::-1]
+        c = np.arange(5)[::-1]
+
+        a[b] = c
+        # If the strides are not reversed, the 0 in the arange comes last.
+        assert_equal(a[0], 0)
+
+        # This also tests that the subspace buffer is initialized:
+        a = np.ones((5, 2))
+        c = np.arange(10).reshape(5, 2)[::-1]
+        a[b, :] = c
+        assert_equal(a[0], [0, 1])
+
+    def test_reversed_strides_result_allocation(self):
+        # Test a bug when calculating the output strides for a result array
+        # when the subspace size was 1 (and test other cases as well)
+        a = np.arange(10)[:, None]
+        i = np.arange(10)[::-1]
+        assert_array_equal(a[i], a[i.copy('C')])
+
+        a = np.arange(20).reshape(-1, 2)
+
+    def test_uncontiguous_subspace_assignment(self):
+        # During development there was a bug activating a skip logic
+        # based on ndim instead of size.
+        a = np.full((3, 4, 2), -1)
+        b = np.full((3, 4, 2), -1)
+
+        a[[0, 1]] = np.arange(2 * 4 * 2).reshape(2, 4, 2).T
+        b[[0, 1]] = np.arange(2 * 4 * 2).reshape(2, 4, 2).T.copy()
+
+        assert_equal(a, b)
+
+    def test_too_many_fancy_indices_special_case(self):
+        # Just documents behaviour, this is a small limitation.
+        a = np.ones((1,) * 32)  # 32 is NPY_MAXDIMS
+        assert_raises(IndexError, a.__getitem__, (np.array([0]),) * 32)
+
+    def test_scalar_array_bool(self):
+        # NumPy bools can be used as boolean index (python ones as of yet not)
+        a = np.array(1)
+        assert_equal(a[np.bool_(True)], a[np.array(True)])
+        assert_equal(a[np.bool_(False)], a[np.array(False)])
+
+        # After deprecating bools as integers:
+        #a = np.array([0,1,2])
+        #assert_equal(a[True, :], a[None, :])
+        #assert_equal(a[:, True], a[:, None])
+        #
+        #assert_(not np.may_share_memory(a, a[True, :]))
+
+    def test_everything_returns_views(self):
+        # Before `...` would return a itself.
+        a = np.arange(5)
+
+        assert_(a is not a[()])
+        assert_(a is not a[...])
+        assert_(a is not a[:])
+
+    def test_broaderrors_indexing(self):
+        a = np.zeros((5, 5))
+        assert_raises(IndexError, a.__getitem__, ([0, 1], [0, 1, 2]))
+        assert_raises(IndexError, a.__setitem__, ([0, 1], [0, 1, 2]), 0)
+
+    def test_trivial_fancy_out_of_bounds(self):
+        a = np.zeros(5)
+        ind = np.ones(20, dtype=np.intp)
+        ind[-1] = 10
+        assert_raises(IndexError, a.__getitem__, ind)
+        assert_raises(IndexError, a.__setitem__, ind, 0)
+        ind = np.ones(20, dtype=np.intp)
+        ind[0] = 11
+        assert_raises(IndexError, a.__getitem__, ind)
+        assert_raises(IndexError, a.__setitem__, ind, 0)
+
+    def test_trivial_fancy_not_possible(self):
+        # Test that the fast path for trivial assignment is not incorrectly
+        # used when the index is not contiguous or 1D, see also gh-11467.
+        a = np.arange(6)
+        idx = np.arange(6, dtype=np.intp).reshape(2, 1, 3)[:, :, 0]
+        assert_array_equal(a[idx], idx)
+
+        # this case must not go into the fast path, note that idx is
+        # a non-contiuguous none 1D array here.
+        a[idx] = -1
+        res = np.arange(6)
+        res[0] = -1
+        res[3] = -1
+        assert_array_equal(a, res)
+
+    def test_nonbaseclass_values(self):
+        class SubClass(np.ndarray):
+            def __array_finalize__(self, old):
+                # Have array finalize do funny things
+                self.fill(99)
+
+        a = np.zeros((5, 5))
+        s = a.copy().view(type=SubClass)
+        s.fill(1)
+
+        a[[0, 1, 2, 3, 4], :] = s
+        assert_((a == 1).all())
+
+        # Subspace is last, so transposing might want to finalize
+        a[:, [0, 1, 2, 3, 4]] = s
+        assert_((a == 1).all())
+
+        a.fill(0)
+        a[...] = s
+        assert_((a == 1).all())
+
+    def test_subclass_writeable(self):
+        d = np.rec.array([('NGC1001', 11), ('NGC1002', 1.), ('NGC1003', 1.)],
+                         dtype=[('target', 'S20'), ('V_mag', '>f4')])
+        ind = np.array([False,  True,  True], dtype=bool)
+        assert_(d[ind].flags.writeable)
+        ind = np.array([0, 1])
+        assert_(d[ind].flags.writeable)
+        assert_(d[...].flags.writeable)
+        assert_(d[0].flags.writeable)
+
+    def test_memory_order(self):
+        # This is not necessary to preserve. Memory layouts for
+        # more complex indices are not as simple.
+        a = np.arange(10)
+        b = np.arange(10).reshape(5,2).T
+        assert_(a[b].flags.f_contiguous)
+
+        # Takes a different implementation branch:
+        a = a.reshape(-1, 1)
+        assert_(a[b, 0].flags.f_contiguous)
+
+    def test_scalar_return_type(self):
+        # Full scalar indices should return scalars and object
+        # arrays should not call PyArray_Return on their items
+        class Zero:
+            # The most basic valid indexing
+            def __index__(self):
+                return 0
+
+        z = Zero()
+
+        class ArrayLike:
+            # Simple array, should behave like the array
+            def __array__(self):
+                return np.array(0)
+
+        a = np.zeros(())
+        assert_(isinstance(a[()], np.float_))
+        a = np.zeros(1)
+        assert_(isinstance(a[z], np.float_))
+        a = np.zeros((1, 1))
+        assert_(isinstance(a[z, np.array(0)], np.float_))
+        assert_(isinstance(a[z, ArrayLike()], np.float_))
+
+        # And object arrays do not call it too often:
+        b = np.array(0)
+        a = np.array(0, dtype=object)
+        a[()] = b
+        assert_(isinstance(a[()], np.ndarray))
+        a = np.array([b, None])
+        assert_(isinstance(a[z], np.ndarray))
+        a = np.array([[b, None]])
+        assert_(isinstance(a[z, np.array(0)], np.ndarray))
+        assert_(isinstance(a[z, ArrayLike()], np.ndarray))
+
+    def test_small_regressions(self):
+        # Reference count of intp for index checks
+        a = np.array([0])
+        if HAS_REFCOUNT:
+            refcount = sys.getrefcount(np.dtype(np.intp))
+        # item setting always checks indices in separate function:
+        a[np.array([0], dtype=np.intp)] = 1
+        a[np.array([0], dtype=np.uint8)] = 1
+        assert_raises(IndexError, a.__setitem__,
+                      np.array([1], dtype=np.intp), 1)
+        assert_raises(IndexError, a.__setitem__,
+                      np.array([1], dtype=np.uint8), 1)
+
+        if HAS_REFCOUNT:
+            assert_equal(sys.getrefcount(np.dtype(np.intp)), refcount)
+
+    def test_unaligned(self):
+        v = (np.zeros(64, dtype=np.int8) + ord('a'))[1:-7]
+        d = v.view(np.dtype("S8"))
+        # unaligned source
+        x = (np.zeros(16, dtype=np.int8) + ord('a'))[1:-7]
+        x = x.view(np.dtype("S8"))
+        x[...] = np.array("b" * 8, dtype="S")
+        b = np.arange(d.size)
+        #trivial
+        assert_equal(d[b], d)
+        d[b] = x
+        # nontrivial
+        # unaligned index array
+        b = np.zeros(d.size + 1).view(np.int8)[1:-(np.intp(0).itemsize - 1)]
+        b = b.view(np.intp)[:d.size]
+        b[...] = np.arange(d.size)
+        assert_equal(d[b.astype(np.int16)], d)
+        d[b.astype(np.int16)] = x
+        # boolean
+        d[b % 2 == 0]
+        d[b % 2 == 0] = x[::2]
+
+    def test_tuple_subclass(self):
+        arr = np.ones((5, 5))
+
+        # A tuple subclass should also be an nd-index
+        class TupleSubclass(tuple):
+            pass
+        index = ([1], [1])
+        index = TupleSubclass(index)
+        assert_(arr[index].shape == (1,))
+        # Unlike the non nd-index:
+        assert_(arr[index,].shape != (1,))
+
+    def test_broken_sequence_not_nd_index(self):
+        # See gh-5063:
+        # If we have an object which claims to be a sequence, but fails
+        # on item getting, this should not be converted to an nd-index (tuple)
+        # If this object happens to be a valid index otherwise, it should work
+        # This object here is very dubious and probably bad though:
+        class SequenceLike:
+            def __index__(self):
+                return 0
+
+            def __len__(self):
+                return 1
+
+            def __getitem__(self, item):
+                raise IndexError('Not possible')
+
+        arr = np.arange(10)
+        assert_array_equal(arr[SequenceLike()], arr[SequenceLike(),])
+
+        # also test that field indexing does not segfault
+        # for a similar reason, by indexing a structured array
+        arr = np.zeros((1,), dtype=[('f1', 'i8'), ('f2', 'i8')])
+        assert_array_equal(arr[SequenceLike()], arr[SequenceLike(),])
+
+    def test_indexing_array_weird_strides(self):
+        # See also gh-6221
+        # the shapes used here come from the issue and create the correct
+        # size for the iterator buffering size.
+        x = np.ones(10)
+        x2 = np.ones((10, 2))
+        ind = np.arange(10)[:, None, None, None]
+        ind = np.broadcast_to(ind, (10, 55, 4, 4))
+
+        # single advanced index case
+        assert_array_equal(x[ind], x[ind.copy()])
+        # higher dimensional advanced index
+        zind = np.zeros(4, dtype=np.intp)
+        assert_array_equal(x2[ind, zind], x2[ind.copy(), zind])
+
+    def test_indexing_array_negative_strides(self):
+        # From gh-8264,
+        # core dumps if negative strides are used in iteration
+        arro = np.zeros((4, 4))
+        arr = arro[::-1, ::-1]
+
+        slices = (slice(None), [0, 1, 2, 3])
+        arr[slices] = 10
+        assert_array_equal(arr, 10.)
+
+class TestFieldIndexing:
+    def test_scalar_return_type(self):
+        # Field access on an array should return an array, even if it
+        # is 0-d.
+        a = np.zeros((), [('a','f8')])
+        assert_(isinstance(a['a'], np.ndarray))
+        assert_(isinstance(a[['a']], np.ndarray))
+
+
+class TestBroadcastedAssignments:
+    def assign(self, a, ind, val):
+        a[ind] = val
+        return a
+
+    def test_prepending_ones(self):
+        a = np.zeros((3, 2))
+
+        a[...] = np.ones((1, 3, 2))
+        # Fancy with subspace with and without transpose
+        a[[0, 1, 2], :] = np.ones((1, 3, 2))
+        a[:, [0, 1]] = np.ones((1, 3, 2))
+        # Fancy without subspace (with broadcasting)
+        a[[[0], [1], [2]], [0, 1]] = np.ones((1, 3, 2))
+
+    def test_prepend_not_one(self):
+        assign = self.assign
+        s_ = np.s_
+        a = np.zeros(5)
+
+        # Too large and not only ones.
+        assert_raises(ValueError, assign, a, s_[...],  np.ones((2, 1)))
+        assert_raises(ValueError, assign, a, s_[[1, 2, 3],], np.ones((2, 1)))
+        assert_raises(ValueError, assign, a, s_[[[1], [2]],], np.ones((2,2,1)))
+
+    def test_simple_broadcasting_errors(self):
+        assign = self.assign
+        s_ = np.s_
+        a = np.zeros((5, 1))
+
+        assert_raises(ValueError, assign, a, s_[...], np.zeros((5, 2)))
+        assert_raises(ValueError, assign, a, s_[...], np.zeros((5, 0)))
+        assert_raises(ValueError, assign, a, s_[:, [0]], np.zeros((5, 2)))
+        assert_raises(ValueError, assign, a, s_[:, [0]], np.zeros((5, 0)))
+        assert_raises(ValueError, assign, a, s_[[0], :], np.zeros((2, 1)))
+
+    def test_index_is_larger(self):
+        # Simple case of fancy index broadcasting of the index.
+        a = np.zeros((5, 5))
+        a[[[0], [1], [2]], [0, 1, 2]] = [2, 3, 4]
+
+        assert_((a[:3, :3] == [2, 3, 4]).all())
+
+    def test_broadcast_subspace(self):
+        a = np.zeros((100, 100))
+        v = np.arange(100)[:,None]
+        b = np.arange(100)[::-1]
+        a[b] = v
+        assert_((a[::-1] == v).all())
+
+
+class TestSubclasses:
+    def test_basic(self):
+        # Test that indexing in various ways produces SubClass instances,
+        # and that the base is set up correctly: the original subclass
+        # instance for views, and a new ndarray for advanced/boolean indexing
+        # where a copy was made (latter a regression test for gh-11983).
+        class SubClass(np.ndarray):
+            pass
+
+        a = np.arange(5)
+        s = a.view(SubClass)
+        s_slice = s[:3]
+        assert_(type(s_slice) is SubClass)
+        assert_(s_slice.base is s)
+        assert_array_equal(s_slice, a[:3])
+
+        s_fancy = s[[0, 1, 2]]
+        assert_(type(s_fancy) is SubClass)
+        assert_(s_fancy.base is not s)
+        assert_(type(s_fancy.base) is np.ndarray)
+        assert_array_equal(s_fancy, a[[0, 1, 2]])
+        assert_array_equal(s_fancy.base, a[[0, 1, 2]])
+
+        s_bool = s[s > 0]
+        assert_(type(s_bool) is SubClass)
+        assert_(s_bool.base is not s)
+        assert_(type(s_bool.base) is np.ndarray)
+        assert_array_equal(s_bool, a[a > 0])
+        assert_array_equal(s_bool.base, a[a > 0])
+
+    def test_fancy_on_read_only(self):
+        # Test that fancy indexing on read-only SubClass does not make a
+        # read-only copy (gh-14132)
+        class SubClass(np.ndarray):
+            pass
+
+        a = np.arange(5)
+        s = a.view(SubClass)
+        s.flags.writeable = False
+        s_fancy = s[[0, 1, 2]]
+        assert_(s_fancy.flags.writeable)
+
+
+    def test_finalize_gets_full_info(self):
+        # Array finalize should be called on the filled array.
+        class SubClass(np.ndarray):
+            def __array_finalize__(self, old):
+                self.finalize_status = np.array(self)
+                self.old = old
+
+        s = np.arange(10).view(SubClass)
+        new_s = s[:3]
+        assert_array_equal(new_s.finalize_status, new_s)
+        assert_array_equal(new_s.old, s)
+
+        new_s = s[[0,1,2,3]]
+        assert_array_equal(new_s.finalize_status, new_s)
+        assert_array_equal(new_s.old, s)
+
+        new_s = s[s > 0]
+        assert_array_equal(new_s.finalize_status, new_s)
+        assert_array_equal(new_s.old, s)
+
+
+class TestFancyIndexingCast:
+    def test_boolean_index_cast_assign(self):
+        # Setup the boolean index and float arrays.
+        shape = (8, 63)
+        bool_index = np.zeros(shape).astype(bool)
+        bool_index[0, 1] = True
+        zero_array = np.zeros(shape)
+
+        # Assigning float is fine.
+        zero_array[bool_index] = np.array([1])
+        assert_equal(zero_array[0, 1], 1)
+
+        # Fancy indexing works, although we get a cast warning.
+        assert_warns(np.ComplexWarning,
+                     zero_array.__setitem__, ([0], [1]), np.array([2 + 1j]))
+        assert_equal(zero_array[0, 1], 2)  # No complex part
+
+        # Cast complex to float, throwing away the imaginary portion.
+        assert_warns(np.ComplexWarning,
+                     zero_array.__setitem__, bool_index, np.array([1j]))
+        assert_equal(zero_array[0, 1], 0)
+
+class TestFancyIndexingEquivalence:
+    def test_object_assign(self):
+        # Check that the field and object special case using copyto is active.
+        # The right hand side cannot be converted to an array here.
+        a = np.arange(5, dtype=object)
+        b = a.copy()
+        a[:3] = [1, (1,2), 3]
+        b[[0, 1, 2]] = [1, (1,2), 3]
+        assert_array_equal(a, b)
+
+        # test same for subspace fancy indexing
+        b = np.arange(5, dtype=object)[None, :]
+        b[[0], :3] = [[1, (1,2), 3]]
+        assert_array_equal(a, b[0])
+
+        # Check that swapping of axes works.
+        # There was a bug that made the later assignment throw a ValueError
+        # do to an incorrectly transposed temporary right hand side (gh-5714)
+        b = b.T
+        b[:3, [0]] = [[1], [(1,2)], [3]]
+        assert_array_equal(a, b[:, 0])
+
+        # Another test for the memory order of the subspace
+        arr = np.ones((3, 4, 5), dtype=object)
+        # Equivalent slicing assignment for comparison
+        cmp_arr = arr.copy()
+        cmp_arr[:1, ...] = [[[1], [2], [3], [4]]]
+        arr[[0], ...] = [[[1], [2], [3], [4]]]
+        assert_array_equal(arr, cmp_arr)
+        arr = arr.copy('F')
+        arr[[0], ...] = [[[1], [2], [3], [4]]]
+        assert_array_equal(arr, cmp_arr)
+
+    def test_cast_equivalence(self):
+        # Yes, normal slicing uses unsafe casting.
+        a = np.arange(5)
+        b = a.copy()
+
+        a[:3] = np.array(['2', '-3', '-1'])
+        b[[0, 2, 1]] = np.array(['2', '-1', '-3'])
+        assert_array_equal(a, b)
+
+        # test the same for subspace fancy indexing
+        b = np.arange(5)[None, :]
+        b[[0], :3] = np.array([['2', '-3', '-1']])
+        assert_array_equal(a, b[0])
+
+
+class TestMultiIndexingAutomated:
+    """
+    These tests use code to mimic the C-Code indexing for selection.
+
+    NOTE:
+
+        * This still lacks tests for complex item setting.
+        * If you change behavior of indexing, you might want to modify
+          these tests to try more combinations.
+        * Behavior was written to match numpy version 1.8. (though a
+          first version matched 1.7.)
+        * Only tuple indices are supported by the mimicking code.
+          (and tested as of writing this)
+        * Error types should match most of the time as long as there
+          is only one error. For multiple errors, what gets raised
+          will usually not be the same one. They are *not* tested.
+
+    Update 2016-11-30: It is probably not worth maintaining this test
+    indefinitely and it can be dropped if maintenance becomes a burden.
+
+    """
+
+    def setup(self):
+        self.a = np.arange(np.prod([3, 1, 5, 6])).reshape(3, 1, 5, 6)
+        self.b = np.empty((3, 0, 5, 6))
+        self.complex_indices = ['skip', Ellipsis,
+            0,
+            # Boolean indices, up to 3-d for some special cases of eating up
+            # dimensions, also need to test all False
+            np.array([True, False, False]),
+            np.array([[True, False], [False, True]]),
+            np.array([[[False, False], [False, False]]]),
+            # Some slices:
+            slice(-5, 5, 2),
+            slice(1, 1, 100),
+            slice(4, -1, -2),
+            slice(None, None, -3),
+            # Some Fancy indexes:
+            np.empty((0, 1, 1), dtype=np.intp),  # empty and can be broadcast
+            np.array([0, 1, -2]),
+            np.array([[2], [0], [1]]),
+            np.array([[0, -1], [0, 1]], dtype=np.dtype('intp').newbyteorder()),
+            np.array([2, -1], dtype=np.int8),
+            np.zeros([1]*31, dtype=int),  # trigger too large array.
+            np.array([0., 1.])]  # invalid datatype
+        # Some simpler indices that still cover a bit more
+        self.simple_indices = [Ellipsis, None, -1, [1], np.array([True]),
+                               'skip']
+        # Very simple ones to fill the rest:
+        self.fill_indices = [slice(None, None), 0]
+
+    def _get_multi_index(self, arr, indices):
+        """Mimic multi dimensional indexing.
+
+        Parameters
+        ----------
+        arr : ndarray
+            Array to be indexed.
+        indices : tuple of index objects
+
+        Returns
+        -------
+        out : ndarray
+            An array equivalent to the indexing operation (but always a copy).
+            `arr[indices]` should be identical.
+        no_copy : bool
+            Whether the indexing operation requires a copy. If this is `True`,
+            `np.may_share_memory(arr, arr[indices])` should be `True` (with
+            some exceptions for scalars and possibly 0-d arrays).
+
+        Notes
+        -----
+        While the function may mostly match the errors of normal indexing this
+        is generally not the case.
+        """
+        in_indices = list(indices)
+        indices = []
+        # if False, this is a fancy or boolean index
+        no_copy = True
+        # number of fancy/scalar indexes that are not consecutive
+        num_fancy = 0
+        # number of dimensions indexed by a "fancy" index
+        fancy_dim = 0
+        # NOTE: This is a funny twist (and probably OK to change).
+        # The boolean array has illegal indexes, but this is
+        # allowed if the broadcast fancy-indices are 0-sized.
+        # This variable is to catch that case.
+        error_unless_broadcast_to_empty = False
+
+        # We need to handle Ellipsis and make arrays from indices, also
+        # check if this is fancy indexing (set no_copy).
+        ndim = 0
+        ellipsis_pos = None  # define here mostly to replace all but first.
+        for i, indx in enumerate(in_indices):
+            if indx is None:
+                continue
+            if isinstance(indx, np.ndarray) and indx.dtype == bool:
+                no_copy = False
+                if indx.ndim == 0:
+                    raise IndexError
+                # boolean indices can have higher dimensions
+                ndim += indx.ndim
+                fancy_dim += indx.ndim
+                continue
+            if indx is Ellipsis:
+                if ellipsis_pos is None:
+                    ellipsis_pos = i
+                    continue  # do not increment ndim counter
+                raise IndexError
+            if isinstance(indx, slice):
+                ndim += 1
+                continue
+            if not isinstance(indx, np.ndarray):
+                # This could be open for changes in numpy.
+                # numpy should maybe raise an error if casting to intp
+                # is not safe. It rejects np.array([1., 2.]) but not
+                # [1., 2.] as index (same for ie. np.take).
+                # (Note the importance of empty lists if changing this here)
+                try:
+                    indx = np.array(indx, dtype=np.intp)
+                except ValueError:
+                    raise IndexError
+                in_indices[i] = indx
+            elif indx.dtype.kind != 'b' and indx.dtype.kind != 'i':
+                raise IndexError('arrays used as indices must be of '
+                                 'integer (or boolean) type')
+            if indx.ndim != 0:
+                no_copy = False
+            ndim += 1
+            fancy_dim += 1
+
+        if arr.ndim - ndim < 0:
+            # we can't take more dimensions then we have, not even for 0-d
+            # arrays.  since a[()] makes sense, but not a[(),]. We will
+            # raise an error later on, unless a broadcasting error occurs
+            # first.
+            raise IndexError
+
+        if ndim == 0 and None not in in_indices:
+            # Well we have no indexes or one Ellipsis. This is legal.
+            return arr.copy(), no_copy
+
+        if ellipsis_pos is not None:
+            in_indices[ellipsis_pos:ellipsis_pos+1] = ([slice(None, None)] *
+                                                       (arr.ndim - ndim))
+
+        for ax, indx in enumerate(in_indices):
+            if isinstance(indx, slice):
+                # convert to an index array
+                indx = np.arange(*indx.indices(arr.shape[ax]))
+                indices.append(['s', indx])
+                continue
+            elif indx is None:
+                # this is like taking a slice with one element from a new axis:
+                indices.append(['n', np.array([0], dtype=np.intp)])
+                arr = arr.reshape((arr.shape[:ax] + (1,) + arr.shape[ax:]))
+                continue
+            if isinstance(indx, np.ndarray) and indx.dtype == bool:
+                if indx.shape != arr.shape[ax:ax+indx.ndim]:
+                    raise IndexError
+
+                try:
+                    flat_indx = np.ravel_multi_index(np.nonzero(indx),
+                                    arr.shape[ax:ax+indx.ndim], mode='raise')
+                except Exception:
+                    error_unless_broadcast_to_empty = True
+                    # fill with 0s instead, and raise error later
+                    flat_indx = np.array([0]*indx.sum(), dtype=np.intp)
+                # concatenate axis into a single one:
+                if indx.ndim != 0:
+                    arr = arr.reshape((arr.shape[:ax]
+                                  + (np.prod(arr.shape[ax:ax+indx.ndim]),)
+                                  + arr.shape[ax+indx.ndim:]))
+                    indx = flat_indx
+                else:
+                    # This could be changed, a 0-d boolean index can
+                    # make sense (even outside the 0-d indexed array case)
+                    # Note that originally this is could be interpreted as
+                    # integer in the full integer special case.
+                    raise IndexError
+            else:
+                # If the index is a singleton, the bounds check is done
+                # before the broadcasting. This used to be different in <1.9
+                if indx.ndim == 0:
+                    if indx >= arr.shape[ax] or indx < -arr.shape[ax]:
+                        raise IndexError
+            if indx.ndim == 0:
+                # The index is a scalar. This used to be two fold, but if
+                # fancy indexing was active, the check was done later,
+                # possibly after broadcasting it away (1.7. or earlier).
+                # Now it is always done.
+                if indx >= arr.shape[ax] or indx < - arr.shape[ax]:
+                    raise IndexError
+            if (len(indices) > 0 and
+                    indices[-1][0] == 'f' and
+                    ax != ellipsis_pos):
+                # NOTE: There could still have been a 0-sized Ellipsis
+                # between them. Checked that with ellipsis_pos.
+                indices[-1].append(indx)
+            else:
+                # We have a fancy index that is not after an existing one.
+                # NOTE: A 0-d array triggers this as well, while one may
+                # expect it to not trigger it, since a scalar would not be
+                # considered fancy indexing.
+                num_fancy += 1
+                indices.append(['f', indx])
+
+        if num_fancy > 1 and not no_copy:
+            # We have to flush the fancy indexes left
+            new_indices = indices[:]
+            axes = list(range(arr.ndim))
+            fancy_axes = []
+            new_indices.insert(0, ['f'])
+            ni = 0
+            ai = 0
+            for indx in indices:
+                ni += 1
+                if indx[0] == 'f':
+                    new_indices[0].extend(indx[1:])
+                    del new_indices[ni]
+                    ni -= 1
+                    for ax in range(ai, ai + len(indx[1:])):
+                        fancy_axes.append(ax)
+                        axes.remove(ax)
+                ai += len(indx) - 1  # axis we are at
+            indices = new_indices
+            # and now we need to transpose arr:
+            arr = arr.transpose(*(fancy_axes + axes))
+
+        # We only have one 'f' index now and arr is transposed accordingly.
+        # Now handle newaxis by reshaping...
+        ax = 0
+        for indx in indices:
+            if indx[0] == 'f':
+                if len(indx) == 1:
+                    continue
+                # First of all, reshape arr to combine fancy axes into one:
+                orig_shape = arr.shape
+                orig_slice = orig_shape[ax:ax + len(indx[1:])]
+                arr = arr.reshape((arr.shape[:ax]
+                                    + (np.prod(orig_slice).astype(int),)
+                                    + arr.shape[ax + len(indx[1:]):]))
+
+                # Check if broadcasting works
+                res = np.broadcast(*indx[1:])
+                # unfortunately the indices might be out of bounds. So check
+                # that first, and use mode='wrap' then. However only if
+                # there are any indices...
+                if res.size != 0:
+                    if error_unless_broadcast_to_empty:
+                        raise IndexError
+                    for _indx, _size in zip(indx[1:], orig_slice):
+                        if _indx.size == 0:
+                            continue
+                        if np.any(_indx >= _size) or np.any(_indx < -_size):
+                                raise IndexError
+                if len(indx[1:]) == len(orig_slice):
+                    if np.product(orig_slice) == 0:
+                        # Work around for a crash or IndexError with 'wrap'
+                        # in some 0-sized cases.
+                        try:
+                            mi = np.ravel_multi_index(indx[1:], orig_slice,
+                                                      mode='raise')
+                        except Exception:
+                            # This happens with 0-sized orig_slice (sometimes?)
+                            # here it is a ValueError, but indexing gives a:
+                            raise IndexError('invalid index into 0-sized')
+                    else:
+                        mi = np.ravel_multi_index(indx[1:], orig_slice,
+                                                  mode='wrap')
+                else:
+                    # Maybe never happens...
+                    raise ValueError
+                arr = arr.take(mi.ravel(), axis=ax)
+                try:
+                    arr = arr.reshape((arr.shape[:ax]
+                                        + mi.shape
+                                        + arr.shape[ax+1:]))
+                except ValueError:
+                    # too many dimensions, probably
+                    raise IndexError
+                ax += mi.ndim
+                continue
+
+            # If we are here, we have a 1D array for take:
+            arr = arr.take(indx[1], axis=ax)
+            ax += 1
+
+        return arr, no_copy
+
+    def _check_multi_index(self, arr, index):
+        """Check a multi index item getting and simple setting.
+
+        Parameters
+        ----------
+        arr : ndarray
+            Array to be indexed, must be a reshaped arange.
+        index : tuple of indexing objects
+            Index being tested.
+        """
+        # Test item getting
+        try:
+            mimic_get, no_copy = self._get_multi_index(arr, index)
+        except Exception as e:
+            if HAS_REFCOUNT:
+                prev_refcount = sys.getrefcount(arr)
+            assert_raises(type(e), arr.__getitem__, index)
+            assert_raises(type(e), arr.__setitem__, index, 0)
+            if HAS_REFCOUNT:
+                assert_equal(prev_refcount, sys.getrefcount(arr))
+            return
+
+        self._compare_index_result(arr, index, mimic_get, no_copy)
+
+    def _check_single_index(self, arr, index):
+        """Check a single index item getting and simple setting.
+
+        Parameters
+        ----------
+        arr : ndarray
+            Array to be indexed, must be an arange.
+        index : indexing object
+            Index being tested. Must be a single index and not a tuple
+            of indexing objects (see also `_check_multi_index`).
+        """
+        try:
+            mimic_get, no_copy = self._get_multi_index(arr, (index,))
+        except Exception as e:
+            if HAS_REFCOUNT:
+                prev_refcount = sys.getrefcount(arr)
+            assert_raises(type(e), arr.__getitem__, index)
+            assert_raises(type(e), arr.__setitem__, index, 0)
+            if HAS_REFCOUNT:
+                assert_equal(prev_refcount, sys.getrefcount(arr))
+            return
+
+        self._compare_index_result(arr, index, mimic_get, no_copy)
+
+    def _compare_index_result(self, arr, index, mimic_get, no_copy):
+        """Compare mimicked result to indexing result.
+        """
+        arr = arr.copy()
+        indexed_arr = arr[index]
+        assert_array_equal(indexed_arr, mimic_get)
+        # Check if we got a view, unless its a 0-sized or 0-d array.
+        # (then its not a view, and that does not matter)
+        if indexed_arr.size != 0 and indexed_arr.ndim != 0:
+            assert_(np.may_share_memory(indexed_arr, arr) == no_copy)
+            # Check reference count of the original array
+            if HAS_REFCOUNT:
+                if no_copy:
+                    # refcount increases by one:
+                    assert_equal(sys.getrefcount(arr), 3)
+                else:
+                    assert_equal(sys.getrefcount(arr), 2)
+
+        # Test non-broadcast setitem:
+        b = arr.copy()
+        b[index] = mimic_get + 1000
+        if b.size == 0:
+            return  # nothing to compare here...
+        if no_copy and indexed_arr.ndim != 0:
+            # change indexed_arr in-place to manipulate original:
+            indexed_arr += 1000
+            assert_array_equal(arr, b)
+            return
+        # Use the fact that the array is originally an arange:
+        arr.flat[indexed_arr.ravel()] += 1000
+        assert_array_equal(arr, b)
+
+    def test_boolean(self):
+        a = np.array(5)
+        assert_equal(a[np.array(True)], 5)
+        a[np.array(True)] = 1
+        assert_equal(a, 1)
+        # NOTE: This is different from normal broadcasting, as
+        # arr[boolean_array] works like in a multi index. Which means
+        # it is aligned to the left. This is probably correct for
+        # consistency with arr[boolean_array,] also no broadcasting
+        # is done at all
+        self._check_multi_index(
+            self.a, (np.zeros_like(self.a, dtype=bool),))
+        self._check_multi_index(
+            self.a, (np.zeros_like(self.a, dtype=bool)[..., 0],))
+        self._check_multi_index(
+            self.a, (np.zeros_like(self.a, dtype=bool)[None, ...],))
+
+    def test_multidim(self):
+        # Automatically test combinations with complex indexes on 2nd (or 1st)
+        # spot and the simple ones in one other spot.
+        with warnings.catch_warnings():
+            # This is so that np.array(True) is not accepted in a full integer
+            # index, when running the file separately.
+            warnings.filterwarnings('error', '', DeprecationWarning)
+            warnings.filterwarnings('error', '', np.VisibleDeprecationWarning)
+
+            def isskip(idx):
+                return isinstance(idx, str) and idx == "skip"
+
+            for simple_pos in [0, 2, 3]:
+                tocheck = [self.fill_indices, self.complex_indices,
+                           self.fill_indices, self.fill_indices]
+                tocheck[simple_pos] = self.simple_indices
+                for index in product(*tocheck):
+                    index = tuple(i for i in index if not isskip(i))
+                    self._check_multi_index(self.a, index)
+                    self._check_multi_index(self.b, index)
+
+        # Check very simple item getting:
+        self._check_multi_index(self.a, (0, 0, 0, 0))
+        self._check_multi_index(self.b, (0, 0, 0, 0))
+        # Also check (simple cases of) too many indices:
+        assert_raises(IndexError, self.a.__getitem__, (0, 0, 0, 0, 0))
+        assert_raises(IndexError, self.a.__setitem__, (0, 0, 0, 0, 0), 0)
+        assert_raises(IndexError, self.a.__getitem__, (0, 0, [1], 0, 0))
+        assert_raises(IndexError, self.a.__setitem__, (0, 0, [1], 0, 0), 0)
+
+    def test_1d(self):
+        a = np.arange(10)
+        for index in self.complex_indices:
+            self._check_single_index(a, index)
+
+class TestFloatNonIntegerArgument:
+    """
+    These test that ``TypeError`` is raised when you try to use
+    non-integers as arguments to for indexing and slicing e.g. ``a[0.0:5]``
+    and ``a[0.5]``, or other functions like ``array.reshape(1., -1)``.
+
+    """
+    def test_valid_indexing(self):
+        # These should raise no errors.
+        a = np.array([[[5]]])
+
+        a[np.array([0])]
+        a[[0, 0]]
+        a[:, [0, 0]]
+        a[:, 0,:]
+        a[:,:,:]
+
+    def test_valid_slicing(self):
+        # These should raise no errors.
+        a = np.array([[[5]]])
+
+        a[::]
+        a[0:]
+        a[:2]
+        a[0:2]
+        a[::2]
+        a[1::2]
+        a[:2:2]
+        a[1:2:2]
+
+    def test_non_integer_argument_errors(self):
+        a = np.array([[5]])
+
+        assert_raises(TypeError, np.reshape, a, (1., 1., -1))
+        assert_raises(TypeError, np.reshape, a, (np.array(1.), -1))
+        assert_raises(TypeError, np.take, a, [0], 1.)
+        assert_raises(TypeError, np.take, a, [0], np.float64(1.))
+
+    def test_non_integer_sequence_multiplication(self):
+        # NumPy scalar sequence multiply should not work with non-integers
+        def mult(a, b):
+            return a * b
+
+        assert_raises(TypeError, mult, [1], np.float_(3))
+        # following should be OK
+        mult([1], np.int_(3))
+
+    def test_reduce_axis_float_index(self):
+        d = np.zeros((3,3,3))
+        assert_raises(TypeError, np.min, d, 0.5)
+        assert_raises(TypeError, np.min, d, (0.5, 1))
+        assert_raises(TypeError, np.min, d, (1, 2.2))
+        assert_raises(TypeError, np.min, d, (.2, 1.2))
+
+
+class TestBooleanIndexing:
+    # Using a boolean as integer argument/indexing is an error.
+    def test_bool_as_int_argument_errors(self):
+        a = np.array([[[1]]])
+
+        assert_raises(TypeError, np.reshape, a, (True, -1))
+        assert_raises(TypeError, np.reshape, a, (np.bool_(True), -1))
+        # Note that operator.index(np.array(True)) does not work, a boolean
+        # array is thus also deprecated, but not with the same message:
+        assert_raises(TypeError, operator.index, np.array(True))
+        assert_warns(DeprecationWarning, operator.index, np.True_)
+        assert_raises(TypeError, np.take, args=(a, [0], False))
+
+    def test_boolean_indexing_weirdness(self):
+        # Weird boolean indexing things
+        a = np.ones((2, 3, 4))
+        a[False, True, ...].shape == (0, 2, 3, 4)
+        a[True, [0, 1], True, True, [1], [[2]]] == (1, 2)
+        assert_raises(IndexError, lambda: a[False, [0, 1], ...])
+
+
+class TestArrayToIndexDeprecation:
+    """Creating an an index from array not 0-D is an error.
+
+    """
+    def test_array_to_index_error(self):
+        # so no exception is expected. The raising is effectively tested above.
+        a = np.array([[[1]]])
+
+        assert_raises(TypeError, operator.index, np.array([1]))
+        assert_raises(TypeError, np.reshape, a, (a, -1))
+        assert_raises(TypeError, np.take, a, [0], a)
+
+
+class TestNonIntegerArrayLike:
+    """Tests that array_likes only valid if can safely cast to integer.
+
+    For instance, lists give IndexError when they cannot be safely cast to
+    an integer.
+
+    """
+    def test_basic(self):
+        a = np.arange(10)
+
+        assert_raises(IndexError, a.__getitem__, [0.5, 1.5])
+        assert_raises(IndexError, a.__getitem__, (['1', '2'],))
+
+        # The following is valid
+        a.__getitem__([])
+
+
+class TestMultipleEllipsisError:
+    """An index can only have a single ellipsis.
+
+    """
+    def test_basic(self):
+        a = np.arange(10)
+        assert_raises(IndexError, lambda: a[..., ...])
+        assert_raises(IndexError, a.__getitem__, ((Ellipsis,) * 2,))
+        assert_raises(IndexError, a.__getitem__, ((Ellipsis,) * 3,))
+
+
+class TestCApiAccess:
+    def test_getitem(self):
+        subscript = functools.partial(array_indexing, 0)
+
+        # 0-d arrays don't work:
+        assert_raises(IndexError, subscript, np.ones(()), 0)
+        # Out of bound values:
+        assert_raises(IndexError, subscript, np.ones(10), 11)
+        assert_raises(IndexError, subscript, np.ones(10), -11)
+        assert_raises(IndexError, subscript, np.ones((10, 10)), 11)
+        assert_raises(IndexError, subscript, np.ones((10, 10)), -11)
+
+        a = np.arange(10)
+        assert_array_equal(a[4], subscript(a, 4))
+        a = a.reshape(5, 2)
+        assert_array_equal(a[-4], subscript(a, -4))
+
+    def test_setitem(self):
+        assign = functools.partial(array_indexing, 1)
+
+        # Deletion is impossible:
+        assert_raises(ValueError, assign, np.ones(10), 0)
+        # 0-d arrays don't work:
+        assert_raises(IndexError, assign, np.ones(()), 0, 0)
+        # Out of bound values:
+        assert_raises(IndexError, assign, np.ones(10), 11, 0)
+        assert_raises(IndexError, assign, np.ones(10), -11, 0)
+        assert_raises(IndexError, assign, np.ones((10, 10)), 11, 0)
+        assert_raises(IndexError, assign, np.ones((10, 10)), -11, 0)
+
+        a = np.arange(10)
+        assign(a, 4, 10)
+        assert_(a[4] == 10)
+
+        a = a.reshape(5, 2)
+        assign(a, 4, 10)
+        assert_array_equal(a[-1], [10, 10])
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_item_selection.py b/venv/Lib/site-packages/numpy/core/tests/test_item_selection.py
new file mode 100644
index 000000000..3c35245a3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_item_selection.py
@@ -0,0 +1,86 @@
+import sys
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_raises, assert_array_equal, HAS_REFCOUNT
+    )
+
+
+class TestTake:
+    def test_simple(self):
+        a = [[1, 2], [3, 4]]
+        a_str = [[b'1', b'2'], [b'3', b'4']]
+        modes = ['raise', 'wrap', 'clip']
+        indices = [-1, 4]
+        index_arrays = [np.empty(0, dtype=np.intp),
+                        np.empty(tuple(), dtype=np.intp),
+                        np.empty((1, 1), dtype=np.intp)]
+        real_indices = {'raise': {-1: 1, 4: IndexError},
+                        'wrap': {-1: 1, 4: 0},
+                        'clip': {-1: 0, 4: 1}}
+        # Currently all types but object, use the same function generation.
+        # So it should not be necessary to test all. However test also a non
+        # refcounted struct on top of object, which has a size that hits the
+        # default (non-specialized) path.
+        types = int, object, np.dtype([('', 'i2', 3)])
+        for t in types:
+            # ta works, even if the array may be odd if buffer interface is used
+            ta = np.array(a if np.issubdtype(t, np.number) else a_str, dtype=t)
+            tresult = list(ta.T.copy())
+            for index_array in index_arrays:
+                if index_array.size != 0:
+                    tresult[0].shape = (2,) + index_array.shape
+                    tresult[1].shape = (2,) + index_array.shape
+                for mode in modes:
+                    for index in indices:
+                        real_index = real_indices[mode][index]
+                        if real_index is IndexError and index_array.size != 0:
+                            index_array.put(0, index)
+                            assert_raises(IndexError, ta.take, index_array,
+                                          mode=mode, axis=1)
+                        elif index_array.size != 0:
+                            index_array.put(0, index)
+                            res = ta.take(index_array, mode=mode, axis=1)
+                            assert_array_equal(res, tresult[real_index])
+                        else:
+                            res = ta.take(index_array, mode=mode, axis=1)
+                            assert_(res.shape == (2,) + index_array.shape)
+
+    def test_refcounting(self):
+        objects = [object() for i in range(10)]
+        for mode in ('raise', 'clip', 'wrap'):
+            a = np.array(objects)
+            b = np.array([2, 2, 4, 5, 3, 5])
+            a.take(b, out=a[:6], mode=mode)
+            del a
+            if HAS_REFCOUNT:
+                assert_(all(sys.getrefcount(o) == 3 for o in objects))
+            # not contiguous, example:
+            a = np.array(objects * 2)[::2]
+            a.take(b, out=a[:6], mode=mode)
+            del a
+            if HAS_REFCOUNT:
+                assert_(all(sys.getrefcount(o) == 3 for o in objects))
+
+    def test_unicode_mode(self):
+        d = np.arange(10)
+        k = b'\xc3\xa4'.decode("UTF8")
+        assert_raises(ValueError, d.take, 5, mode=k)
+
+    def test_empty_partition(self):
+        # In reference to github issue #6530
+        a_original = np.array([0, 2, 4, 6, 8, 10])
+        a = a_original.copy()
+
+        # An empty partition should be a successful no-op
+        a.partition(np.array([], dtype=np.int16))
+
+        assert_array_equal(a, a_original)
+
+    def test_empty_argpartition(self):
+        # In reference to github issue #6530
+        a = np.array([0, 2, 4, 6, 8, 10])
+        a = a.argpartition(np.array([], dtype=np.int16))
+
+        b = np.array([0, 1, 2, 3, 4, 5])
+        assert_array_equal(a, b)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_longdouble.py b/venv/Lib/site-packages/numpy/core/tests/test_longdouble.py
new file mode 100644
index 000000000..acef995f3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_longdouble.py
@@ -0,0 +1,369 @@
+import warnings
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_warns, assert_array_equal,
+    temppath,
+    )
+from numpy.core.tests._locales import CommaDecimalPointLocale
+
+LD_INFO = np.finfo(np.longdouble)
+longdouble_longer_than_double = (LD_INFO.eps < np.finfo(np.double).eps)
+
+
+_o = 1 + LD_INFO.eps
+string_to_longdouble_inaccurate = (_o != np.longdouble(repr(_o)))
+del _o
+
+
+def test_scalar_extraction():
+    """Confirm that extracting a value doesn't convert to python float"""
+    o = 1 + LD_INFO.eps
+    a = np.array([o, o, o])
+    assert_equal(a[1], o)
+
+
+# Conversions string -> long double
+
+# 0.1 not exactly representable in base 2 floating point.
+repr_precision = len(repr(np.longdouble(0.1)))
+# +2 from macro block starting around line 842 in scalartypes.c.src.
+@pytest.mark.skipif(LD_INFO.precision + 2 >= repr_precision,
+                    reason="repr precision not enough to show eps")
+def test_repr_roundtrip():
+    # We will only see eps in repr if within printing precision.
+    o = 1 + LD_INFO.eps
+    assert_equal(np.longdouble(repr(o)), o, "repr was %s" % repr(o))
+
+
+@pytest.mark.skipif(string_to_longdouble_inaccurate, reason="Need strtold_l")
+def test_repr_roundtrip_bytes():
+    o = 1 + LD_INFO.eps
+    assert_equal(np.longdouble(repr(o).encode("ascii")), o)
+
+
+@pytest.mark.skipif(string_to_longdouble_inaccurate, reason="Need strtold_l")
+@pytest.mark.parametrize("strtype", (np.str_, np.bytes_, str, bytes))
+def test_array_and_stringlike_roundtrip(strtype):
+    """
+    Test that string representations of long-double roundtrip both
+    for array casting and scalar coercion, see also gh-15608.
+    """
+    o = 1 + LD_INFO.eps
+
+    if strtype in (np.bytes_, bytes):
+        o_str = strtype(repr(o).encode("ascii"))
+    else:
+        o_str = strtype(repr(o))
+
+    # Test that `o` is correctly coerced from the string-like
+    assert o == np.longdouble(o_str)
+
+    # Test that arrays also roundtrip correctly:
+    o_strarr = np.asarray([o] * 3, dtype=strtype)
+    assert (o == o_strarr.astype(np.longdouble)).all()
+
+    # And array coercion and casting to string give the same as scalar repr:
+    assert (o_strarr == o_str).all()
+    assert (np.asarray([o] * 3).astype(strtype) == o_str).all()
+
+
+def test_bogus_string():
+    assert_raises(ValueError, np.longdouble, "spam")
+    assert_raises(ValueError, np.longdouble, "1.0 flub")
+
+
+@pytest.mark.skipif(string_to_longdouble_inaccurate, reason="Need strtold_l")
+def test_fromstring():
+    o = 1 + LD_INFO.eps
+    s = (" " + repr(o))*5
+    a = np.array([o]*5)
+    assert_equal(np.fromstring(s, sep=" ", dtype=np.longdouble), a,
+                 err_msg="reading '%s'" % s)
+
+
+def test_fromstring_complex():
+    for ctype in ["complex", "cdouble", "cfloat"]:
+        # Check spacing between separator
+        assert_equal(np.fromstring("1, 2 ,  3  ,4", sep=",", dtype=ctype),
+                     np.array([1., 2., 3., 4.]))
+        # Real component not specified
+        assert_equal(np.fromstring("1j, -2j,  3j, 4e1j", sep=",", dtype=ctype),
+                     np.array([1.j, -2.j, 3.j, 40.j]))
+        # Both components specified
+        assert_equal(np.fromstring("1+1j,2-2j, -3+3j,  -4e1+4j", sep=",", dtype=ctype),
+                     np.array([1. + 1.j, 2. - 2.j, - 3. + 3.j, - 40. + 4j]))
+        # Spaces at wrong places
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1+2 j,3", dtype=ctype, sep=","),
+                         np.array([1.]))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1+ 2j,3", dtype=ctype, sep=","),
+                         np.array([1.]))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1 +2j,3", dtype=ctype, sep=","),
+                         np.array([1.]))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1+j", dtype=ctype, sep=","),
+                         np.array([1.]))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1+", dtype=ctype, sep=","),
+                         np.array([1.]))
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1j+1", dtype=ctype, sep=","),
+                         np.array([1j]))
+
+
+def test_fromstring_bogus():
+    with assert_warns(DeprecationWarning):
+        assert_equal(np.fromstring("1. 2. 3. flop 4.", dtype=float, sep=" "),
+                     np.array([1., 2., 3.]))
+
+
+def test_fromstring_empty():
+    with assert_warns(DeprecationWarning):
+        assert_equal(np.fromstring("xxxxx", sep="x"),
+                     np.array([]))
+
+
+def test_fromstring_missing():
+    with assert_warns(DeprecationWarning):
+        assert_equal(np.fromstring("1xx3x4x5x6", sep="x"),
+                     np.array([1]))
+
+
+class TestFileBased:
+
+    ldbl = 1 + LD_INFO.eps
+    tgt = np.array([ldbl]*5)
+    out = ''.join([repr(t) + '\n' for t in tgt])
+
+    def test_fromfile_bogus(self):
+        with temppath() as path:
+            with open(path, 'wt') as f:
+                f.write("1. 2. 3. flop 4.\n")
+
+            with assert_warns(DeprecationWarning):
+                res = np.fromfile(path, dtype=float, sep=" ")
+        assert_equal(res, np.array([1., 2., 3.]))
+
+    def test_fromfile_complex(self):
+        for ctype in ["complex", "cdouble", "cfloat"]:
+            # Check spacing between separator and only real component specified
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1, 2 ,  3  ,4\n")
+
+                res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1., 2., 3., 4.]))
+
+            # Real component not specified
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1j, -2j,  3j, 4e1j\n")
+
+                res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.j, -2.j, 3.j, 40.j]))
+
+            # Both components specified
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1+1j,2-2j, -3+3j,  -4e1+4j\n")
+
+                res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1. + 1.j, 2. - 2.j, - 3. + 3.j, - 40. + 4j]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1+2 j,3\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1+ 2j,3\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1 +2j,3\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1+j\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1+\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.]))
+
+            # Spaces at wrong places
+            with temppath() as path:
+                with open(path, 'wt') as f:
+                    f.write("1j+1\n")
+
+                with assert_warns(DeprecationWarning):
+                    res = np.fromfile(path, dtype=ctype, sep=",")
+            assert_equal(res, np.array([1.j]))
+
+
+
+    @pytest.mark.skipif(string_to_longdouble_inaccurate,
+                        reason="Need strtold_l")
+    def test_fromfile(self):
+        with temppath() as path:
+            with open(path, 'wt') as f:
+                f.write(self.out)
+            res = np.fromfile(path, dtype=np.longdouble, sep="\n")
+        assert_equal(res, self.tgt)
+
+    @pytest.mark.skipif(string_to_longdouble_inaccurate,
+                        reason="Need strtold_l")
+    def test_genfromtxt(self):
+        with temppath() as path:
+            with open(path, 'wt') as f:
+                f.write(self.out)
+            res = np.genfromtxt(path, dtype=np.longdouble)
+        assert_equal(res, self.tgt)
+
+    @pytest.mark.skipif(string_to_longdouble_inaccurate,
+                        reason="Need strtold_l")
+    def test_loadtxt(self):
+        with temppath() as path:
+            with open(path, 'wt') as f:
+                f.write(self.out)
+            res = np.loadtxt(path, dtype=np.longdouble)
+        assert_equal(res, self.tgt)
+
+    @pytest.mark.skipif(string_to_longdouble_inaccurate,
+                        reason="Need strtold_l")
+    def test_tofile_roundtrip(self):
+        with temppath() as path:
+            self.tgt.tofile(path, sep=" ")
+            res = np.fromfile(path, dtype=np.longdouble, sep=" ")
+        assert_equal(res, self.tgt)
+
+
+# Conversions long double -> string
+
+
+def test_repr_exact():
+    o = 1 + LD_INFO.eps
+    assert_(repr(o) != '1')
+
+
+@pytest.mark.skipif(longdouble_longer_than_double, reason="BUG #2376")
+@pytest.mark.skipif(string_to_longdouble_inaccurate,
+                    reason="Need strtold_l")
+def test_format():
+    o = 1 + LD_INFO.eps
+    assert_("{0:.40g}".format(o) != '1')
+
+
+@pytest.mark.skipif(longdouble_longer_than_double, reason="BUG #2376")
+@pytest.mark.skipif(string_to_longdouble_inaccurate,
+                    reason="Need strtold_l")
+def test_percent():
+    o = 1 + LD_INFO.eps
+    assert_("%.40g" % o != '1')
+
+
+@pytest.mark.skipif(longdouble_longer_than_double,
+                    reason="array repr problem")
+@pytest.mark.skipif(string_to_longdouble_inaccurate,
+                    reason="Need strtold_l")
+def test_array_repr():
+    o = 1 + LD_INFO.eps
+    a = np.array([o])
+    b = np.array([1], dtype=np.longdouble)
+    if not np.all(a != b):
+        raise ValueError("precision loss creating arrays")
+    assert_(repr(a) != repr(b))
+
+#
+# Locale tests: scalar types formatting should be independent of the locale
+#
+
+class TestCommaDecimalPointLocale(CommaDecimalPointLocale):
+
+    def test_repr_roundtrip_foreign(self):
+        o = 1.5
+        assert_equal(o, np.longdouble(repr(o)))
+
+    def test_fromstring_foreign_repr(self):
+        f = 1.234
+        a = np.fromstring(repr(f), dtype=float, sep=" ")
+        assert_equal(a[0], f)
+
+    def test_fromstring_best_effort_float(self):
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1,234", dtype=float, sep=" "),
+                         np.array([1.]))
+
+    def test_fromstring_best_effort(self):
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.fromstring("1,234", dtype=np.longdouble, sep=" "),
+                         np.array([1.]))
+
+    def test_fromstring_foreign(self):
+        s = "1.234"
+        a = np.fromstring(s, dtype=np.longdouble, sep=" ")
+        assert_equal(a[0], np.longdouble(s))
+
+    def test_fromstring_foreign_sep(self):
+        a = np.array([1, 2, 3, 4])
+        b = np.fromstring("1,2,3,4,", dtype=np.longdouble, sep=",")
+        assert_array_equal(a, b)
+
+    def test_fromstring_foreign_value(self):
+        with assert_warns(DeprecationWarning):
+            b = np.fromstring("1,234", dtype=np.longdouble, sep=" ")
+            assert_array_equal(b[0], 1)
+
+
+@pytest.mark.parametrize("int_val", [
+    # cases discussed in gh-10723
+    # and gh-9968
+    2 ** 1024, 0])
+def test_longdouble_from_int(int_val):
+    # for issue gh-9968
+    str_val = str(int_val)
+    # we'll expect a RuntimeWarning on platforms
+    # with np.longdouble equivalent to np.double
+    # for large integer input
+    with warnings.catch_warnings(record=True) as w:
+        warnings.filterwarnings('always', '', RuntimeWarning)
+        # can be inf==inf on some platforms
+        assert np.longdouble(int_val) == np.longdouble(str_val)
+        # we can't directly compare the int and
+        # max longdouble value on all platforms
+        if np.allclose(np.finfo(np.longdouble).max,
+                       np.finfo(np.double).max) and w:
+            assert w[0].category is RuntimeWarning
+
+@pytest.mark.parametrize("bool_val", [
+    True, False])
+def test_longdouble_from_bool(bool_val):
+    assert np.longdouble(bool_val) == np.longdouble(int(bool_val))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_machar.py b/venv/Lib/site-packages/numpy/core/tests/test_machar.py
new file mode 100644
index 000000000..673f309f1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_machar.py
@@ -0,0 +1,30 @@
+"""
+Test machar. Given recent changes to hardcode type data, we might want to get
+rid of both MachAr and this test at some point.
+
+"""
+from numpy.core.machar import MachAr
+import numpy.core.numerictypes as ntypes
+from numpy import errstate, array
+
+
+class TestMachAr:
+    def _run_machar_highprec(self):
+        # Instantiate MachAr instance with high enough precision to cause
+        # underflow
+        try:
+            hiprec = ntypes.float96
+            MachAr(lambda v: array(v, hiprec))
+        except AttributeError:
+            # Fixme, this needs to raise a 'skip' exception.
+            "Skipping test: no ntypes.float96 available on this platform."
+
+    def test_underlow(self):
+        # Regression test for #759:
+        # instantiating MachAr for dtype = np.float96 raises spurious warning.
+        with errstate(all='raise'):
+            try:
+                self._run_machar_highprec()
+            except FloatingPointError as e:
+                msg = "Caught %s exception, should not have been raised." % e
+                raise AssertionError(msg)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_mem_overlap.py b/venv/Lib/site-packages/numpy/core/tests/test_mem_overlap.py
new file mode 100644
index 000000000..675613de4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_mem_overlap.py
@@ -0,0 +1,926 @@
+import itertools
+import pytest
+
+import numpy as np
+from numpy.core._multiarray_tests import solve_diophantine, internal_overlap
+from numpy.core import _umath_tests
+from numpy.lib.stride_tricks import as_strided
+from numpy.testing import (
+    assert_, assert_raises, assert_equal, assert_array_equal
+    )
+
+
+ndims = 2
+size = 10
+shape = tuple([size] * ndims)
+
+MAY_SHARE_BOUNDS = 0
+MAY_SHARE_EXACT = -1
+
+
+def _indices_for_nelems(nelems):
+    """Returns slices of length nelems, from start onwards, in direction sign."""
+
+    if nelems == 0:
+        return [size // 2]  # int index
+
+    res = []
+    for step in (1, 2):
+        for sign in (-1, 1):
+            start = size // 2 - nelems * step * sign // 2
+            stop = start + nelems * step * sign
+            res.append(slice(start, stop, step * sign))
+
+    return res
+
+
+def _indices_for_axis():
+    """Returns (src, dst) pairs of indices."""
+
+    res = []
+    for nelems in (0, 2, 3):
+        ind = _indices_for_nelems(nelems)
+        res.extend(itertools.product(ind, ind))  # all assignments of size "nelems"
+
+    return res
+
+
+def _indices(ndims):
+    """Returns ((axis0_src, axis0_dst), (axis1_src, axis1_dst), ... ) index pairs."""
+
+    ind = _indices_for_axis()
+    return itertools.product(ind, repeat=ndims)
+
+
+def _check_assignment(srcidx, dstidx):
+    """Check assignment arr[dstidx] = arr[srcidx] works."""
+
+    arr = np.arange(np.product(shape)).reshape(shape)
+
+    cpy = arr.copy()
+
+    cpy[dstidx] = arr[srcidx]
+    arr[dstidx] = arr[srcidx]
+
+    assert_(np.all(arr == cpy),
+            'assigning arr[%s] = arr[%s]' % (dstidx, srcidx))
+
+
+def test_overlapping_assignments():
+    # Test automatically generated assignments which overlap in memory.
+
+    inds = _indices(ndims)
+
+    for ind in inds:
+        srcidx = tuple([a[0] for a in ind])
+        dstidx = tuple([a[1] for a in ind])
+
+        _check_assignment(srcidx, dstidx)
+
+
+@pytest.mark.slow
+def test_diophantine_fuzz():
+    # Fuzz test the diophantine solver
+    rng = np.random.RandomState(1234)
+
+    max_int = np.iinfo(np.intp).max
+
+    for ndim in range(10):
+        feasible_count = 0
+        infeasible_count = 0
+
+        min_count = 500//(ndim + 1)
+
+        while min(feasible_count, infeasible_count) < min_count:
+            # Ensure big and small integer problems
+            A_max = 1 + rng.randint(0, 11, dtype=np.intp)**6
+            U_max = rng.randint(0, 11, dtype=np.intp)**6
+
+            A_max = min(max_int, A_max)
+            U_max = min(max_int-1, U_max)
+
+            A = tuple(int(rng.randint(1, A_max+1, dtype=np.intp))
+                      for j in range(ndim))
+            U = tuple(int(rng.randint(0, U_max+2, dtype=np.intp))
+                      for j in range(ndim))
+
+            b_ub = min(max_int-2, sum(a*ub for a, ub in zip(A, U)))
+            b = rng.randint(-1, b_ub+2, dtype=np.intp)
+
+            if ndim == 0 and feasible_count < min_count:
+                b = 0
+
+            X = solve_diophantine(A, U, b)
+
+            if X is None:
+                # Check the simplified decision problem agrees
+                X_simplified = solve_diophantine(A, U, b, simplify=1)
+                assert_(X_simplified is None, (A, U, b, X_simplified))
+
+                # Check no solution exists (provided the problem is
+                # small enough so that brute force checking doesn't
+                # take too long)
+                ranges = tuple(range(0, a*ub+1, a) for a, ub in zip(A, U))
+
+                size = 1
+                for r in ranges:
+                    size *= len(r)
+                if size < 100000:
+                    assert_(not any(sum(w) == b for w in itertools.product(*ranges)))
+                    infeasible_count += 1
+            else:
+                # Check the simplified decision problem agrees
+                X_simplified = solve_diophantine(A, U, b, simplify=1)
+                assert_(X_simplified is not None, (A, U, b, X_simplified))
+
+                # Check validity
+                assert_(sum(a*x for a, x in zip(A, X)) == b)
+                assert_(all(0 <= x <= ub for x, ub in zip(X, U)))
+                feasible_count += 1
+
+
+def test_diophantine_overflow():
+    # Smoke test integer overflow detection
+    max_intp = np.iinfo(np.intp).max
+    max_int64 = np.iinfo(np.int64).max
+
+    if max_int64 <= max_intp:
+        # Check that the algorithm works internally in 128-bit;
+        # solving this problem requires large intermediate numbers
+        A = (max_int64//2, max_int64//2 - 10)
+        U = (max_int64//2, max_int64//2 - 10)
+        b = 2*(max_int64//2) - 10
+
+        assert_equal(solve_diophantine(A, U, b), (1, 1))
+
+
+def check_may_share_memory_exact(a, b):
+    got = np.may_share_memory(a, b, max_work=MAY_SHARE_EXACT)
+
+    assert_equal(np.may_share_memory(a, b),
+                 np.may_share_memory(a, b, max_work=MAY_SHARE_BOUNDS))
+
+    a.fill(0)
+    b.fill(0)
+    a.fill(1)
+    exact = b.any()
+
+    err_msg = ""
+    if got != exact:
+        err_msg = "    " + "\n    ".join([
+            "base_a - base_b = %r" % (a.__array_interface__['data'][0] - b.__array_interface__['data'][0],),
+            "shape_a = %r" % (a.shape,),
+            "shape_b = %r" % (b.shape,),
+            "strides_a = %r" % (a.strides,),
+            "strides_b = %r" % (b.strides,),
+            "size_a = %r" % (a.size,),
+            "size_b = %r" % (b.size,)
+        ])
+
+    assert_equal(got, exact, err_msg=err_msg)
+
+
+def test_may_share_memory_manual():
+    # Manual test cases for may_share_memory
+
+    # Base arrays
+    xs0 = [
+        np.zeros([13, 21, 23, 22], dtype=np.int8),
+        np.zeros([13, 21, 23*2, 22], dtype=np.int8)[:,:,::2,:]
+    ]
+
+    # Generate all negative stride combinations
+    xs = []
+    for x in xs0:
+        for ss in itertools.product(*(([slice(None), slice(None, None, -1)],)*4)):
+            xp = x[ss]
+            xs.append(xp)
+
+    for x in xs:
+        # The default is a simple extent check
+        assert_(np.may_share_memory(x[:,0,:], x[:,1,:]))
+        assert_(np.may_share_memory(x[:,0,:], x[:,1,:], max_work=None))
+
+        # Exact checks
+        check_may_share_memory_exact(x[:,0,:], x[:,1,:])
+        check_may_share_memory_exact(x[:,::7], x[:,3::3])
+
+        try:
+            xp = x.ravel()
+            if xp.flags.owndata:
+                continue
+            xp = xp.view(np.int16)
+        except ValueError:
+            continue
+
+        # 0-size arrays cannot overlap
+        check_may_share_memory_exact(x.ravel()[6:6],
+                                     xp.reshape(13, 21, 23, 11)[:,::7])
+
+        # Test itemsize is dealt with
+        check_may_share_memory_exact(x[:,::7],
+                                     xp.reshape(13, 21, 23, 11))
+        check_may_share_memory_exact(x[:,::7],
+                                     xp.reshape(13, 21, 23, 11)[:,3::3])
+        check_may_share_memory_exact(x.ravel()[6:7],
+                                     xp.reshape(13, 21, 23, 11)[:,::7])
+
+    # Check unit size
+    x = np.zeros([1], dtype=np.int8)
+    check_may_share_memory_exact(x, x)
+    check_may_share_memory_exact(x, x.copy())
+
+
+def iter_random_view_pairs(x, same_steps=True, equal_size=False):
+    rng = np.random.RandomState(1234)
+
+    if equal_size and same_steps:
+        raise ValueError()
+
+    def random_slice(n, step):
+        start = rng.randint(0, n+1, dtype=np.intp)
+        stop = rng.randint(start, n+1, dtype=np.intp)
+        if rng.randint(0, 2, dtype=np.intp) == 0:
+            stop, start = start, stop
+            step *= -1
+        return slice(start, stop, step)
+
+    def random_slice_fixed_size(n, step, size):
+        start = rng.randint(0, n+1 - size*step)
+        stop = start + (size-1)*step + 1
+        if rng.randint(0, 2) == 0:
+            stop, start = start-1, stop-1
+            if stop < 0:
+                stop = None
+            step *= -1
+        return slice(start, stop, step)
+
+    # First a few regular views
+    yield x, x
+    for j in range(1, 7, 3):
+        yield x[j:], x[:-j]
+        yield x[...,j:], x[...,:-j]
+
+    # An array with zero stride internal overlap
+    strides = list(x.strides)
+    strides[0] = 0
+    xp = as_strided(x, shape=x.shape, strides=strides)
+    yield x, xp
+    yield xp, xp
+
+    # An array with non-zero stride internal overlap
+    strides = list(x.strides)
+    if strides[0] > 1:
+        strides[0] = 1
+    xp = as_strided(x, shape=x.shape, strides=strides)
+    yield x, xp
+    yield xp, xp
+
+    # Then discontiguous views
+    while True:
+        steps = tuple(rng.randint(1, 11, dtype=np.intp)
+                      if rng.randint(0, 5, dtype=np.intp) == 0 else 1
+                      for j in range(x.ndim))
+        s1 = tuple(random_slice(p, s) for p, s in zip(x.shape, steps))
+
+        t1 = np.arange(x.ndim)
+        rng.shuffle(t1)
+
+        if equal_size:
+            t2 = t1
+        else:
+            t2 = np.arange(x.ndim)
+            rng.shuffle(t2)
+
+        a = x[s1]
+
+        if equal_size:
+            if a.size == 0:
+                continue
+
+            steps2 = tuple(rng.randint(1, max(2, p//(1+pa)))
+                           if rng.randint(0, 5) == 0 else 1
+                           for p, s, pa in zip(x.shape, s1, a.shape))
+            s2 = tuple(random_slice_fixed_size(p, s, pa)
+                       for p, s, pa in zip(x.shape, steps2, a.shape))
+        elif same_steps:
+            steps2 = steps
+        else:
+            steps2 = tuple(rng.randint(1, 11, dtype=np.intp)
+                           if rng.randint(0, 5, dtype=np.intp) == 0 else 1
+                           for j in range(x.ndim))
+
+        if not equal_size:
+            s2 = tuple(random_slice(p, s) for p, s in zip(x.shape, steps2))
+
+        a = a.transpose(t1)
+        b = x[s2].transpose(t2)
+
+        yield a, b
+
+
+def check_may_share_memory_easy_fuzz(get_max_work, same_steps, min_count):
+    # Check that overlap problems with common strides are solved with
+    # little work.
+    x = np.zeros([17,34,71,97], dtype=np.int16)
+
+    feasible = 0
+    infeasible = 0
+
+    pair_iter = iter_random_view_pairs(x, same_steps)
+
+    while min(feasible, infeasible) < min_count:
+        a, b = next(pair_iter)
+
+        bounds_overlap = np.may_share_memory(a, b)
+        may_share_answer = np.may_share_memory(a, b)
+        easy_answer = np.may_share_memory(a, b, max_work=get_max_work(a, b))
+        exact_answer = np.may_share_memory(a, b, max_work=MAY_SHARE_EXACT)
+
+        if easy_answer != exact_answer:
+            # assert_equal is slow...
+            assert_equal(easy_answer, exact_answer)
+
+        if may_share_answer != bounds_overlap:
+            assert_equal(may_share_answer, bounds_overlap)
+
+        if bounds_overlap:
+            if exact_answer:
+                feasible += 1
+            else:
+                infeasible += 1
+
+
+@pytest.mark.slow
+def test_may_share_memory_easy_fuzz():
+    # Check that overlap problems with common strides are always
+    # solved with little work.
+
+    check_may_share_memory_easy_fuzz(get_max_work=lambda a, b: 1,
+                                     same_steps=True,
+                                     min_count=2000)
+
+
+@pytest.mark.slow
+def test_may_share_memory_harder_fuzz():
+    # Overlap problems with not necessarily common strides take more
+    # work.
+    #
+    # The work bound below can't be reduced much. Harder problems can
+    # also exist but not be detected here, as the set of problems
+    # comes from RNG.
+
+    check_may_share_memory_easy_fuzz(get_max_work=lambda a, b: max(a.size, b.size)//2,
+                                     same_steps=False,
+                                     min_count=2000)
+
+
+def test_shares_memory_api():
+    x = np.zeros([4, 5, 6], dtype=np.int8)
+
+    assert_equal(np.shares_memory(x, x), True)
+    assert_equal(np.shares_memory(x, x.copy()), False)
+
+    a = x[:,::2,::3]
+    b = x[:,::3,::2]
+    assert_equal(np.shares_memory(a, b), True)
+    assert_equal(np.shares_memory(a, b, max_work=None), True)
+    assert_raises(np.TooHardError, np.shares_memory, a, b, max_work=1)
+
+
+def test_may_share_memory_bad_max_work():
+    x = np.zeros([1])
+    assert_raises(OverflowError, np.may_share_memory, x, x, max_work=10**100)
+    assert_raises(OverflowError, np.shares_memory, x, x, max_work=10**100)
+
+
+def test_internal_overlap_diophantine():
+    def check(A, U, exists=None):
+        X = solve_diophantine(A, U, 0, require_ub_nontrivial=1)
+
+        if exists is None:
+            exists = (X is not None)
+
+        if X is not None:
+            assert_(sum(a*x for a, x in zip(A, X)) == sum(a*u//2 for a, u in zip(A, U)))
+            assert_(all(0 <= x <= u for x, u in zip(X, U)))
+            assert_(any(x != u//2 for x, u in zip(X, U)))
+
+        if exists:
+            assert_(X is not None, repr(X))
+        else:
+            assert_(X is None, repr(X))
+
+    # Smoke tests
+    check((3, 2), (2*2, 3*2), exists=True)
+    check((3*2, 2), (15*2, (3-1)*2), exists=False)
+
+
+def test_internal_overlap_slices():
+    # Slicing an array never generates internal overlap
+
+    x = np.zeros([17,34,71,97], dtype=np.int16)
+
+    rng = np.random.RandomState(1234)
+
+    def random_slice(n, step):
+        start = rng.randint(0, n+1, dtype=np.intp)
+        stop = rng.randint(start, n+1, dtype=np.intp)
+        if rng.randint(0, 2, dtype=np.intp) == 0:
+            stop, start = start, stop
+            step *= -1
+        return slice(start, stop, step)
+
+    cases = 0
+    min_count = 5000
+
+    while cases < min_count:
+        steps = tuple(rng.randint(1, 11, dtype=np.intp)
+                      if rng.randint(0, 5, dtype=np.intp) == 0 else 1
+                      for j in range(x.ndim))
+        t1 = np.arange(x.ndim)
+        rng.shuffle(t1)
+        s1 = tuple(random_slice(p, s) for p, s in zip(x.shape, steps))
+        a = x[s1].transpose(t1)
+
+        assert_(not internal_overlap(a))
+        cases += 1
+
+
+def check_internal_overlap(a, manual_expected=None):
+    got = internal_overlap(a)
+
+    # Brute-force check
+    m = set()
+    ranges = tuple(range(n) for n in a.shape)
+    for v in itertools.product(*ranges):
+        offset = sum(s*w for s, w in zip(a.strides, v))
+        if offset in m:
+            expected = True
+            break
+        else:
+            m.add(offset)
+    else:
+        expected = False
+
+    # Compare
+    if got != expected:
+        assert_equal(got, expected, err_msg=repr((a.strides, a.shape)))
+    if manual_expected is not None and expected != manual_expected:
+        assert_equal(expected, manual_expected)
+    return got
+
+
+def test_internal_overlap_manual():
+    # Stride tricks can construct arrays with internal overlap
+
+    # We don't care about memory bounds, the array is not
+    # read/write accessed
+    x = np.arange(1).astype(np.int8)
+
+    # Check low-dimensional special cases
+
+    check_internal_overlap(x, False) # 1-dim
+    check_internal_overlap(x.reshape([]), False) # 0-dim
+
+    a = as_strided(x, strides=(3, 4), shape=(4, 4))
+    check_internal_overlap(a, False)
+
+    a = as_strided(x, strides=(3, 4), shape=(5, 4))
+    check_internal_overlap(a, True)
+
+    a = as_strided(x, strides=(0,), shape=(0,))
+    check_internal_overlap(a, False)
+
+    a = as_strided(x, strides=(0,), shape=(1,))
+    check_internal_overlap(a, False)
+
+    a = as_strided(x, strides=(0,), shape=(2,))
+    check_internal_overlap(a, True)
+
+    a = as_strided(x, strides=(0, -9993), shape=(87, 22))
+    check_internal_overlap(a, True)
+
+    a = as_strided(x, strides=(0, -9993), shape=(1, 22))
+    check_internal_overlap(a, False)
+
+    a = as_strided(x, strides=(0, -9993), shape=(0, 22))
+    check_internal_overlap(a, False)
+
+
+def test_internal_overlap_fuzz():
+    # Fuzz check; the brute-force check is fairly slow
+
+    x = np.arange(1).astype(np.int8)
+
+    overlap = 0
+    no_overlap = 0
+    min_count = 100
+
+    rng = np.random.RandomState(1234)
+
+    while min(overlap, no_overlap) < min_count:
+        ndim = rng.randint(1, 4, dtype=np.intp)
+
+        strides = tuple(rng.randint(-1000, 1000, dtype=np.intp)
+                        for j in range(ndim))
+        shape = tuple(rng.randint(1, 30, dtype=np.intp)
+                      for j in range(ndim))
+
+        a = as_strided(x, strides=strides, shape=shape)
+        result = check_internal_overlap(a)
+
+        if result:
+            overlap += 1
+        else:
+            no_overlap += 1
+
+
+def test_non_ndarray_inputs():
+    # Regression check for gh-5604
+
+    class MyArray:
+        def __init__(self, data):
+            self.data = data
+
+        @property
+        def __array_interface__(self):
+            return self.data.__array_interface__
+
+    class MyArray2:
+        def __init__(self, data):
+            self.data = data
+
+        def __array__(self):
+            return self.data
+
+    for cls in [MyArray, MyArray2]:
+        x = np.arange(5)
+
+        assert_(np.may_share_memory(cls(x[::2]), x[1::2]))
+        assert_(not np.shares_memory(cls(x[::2]), x[1::2]))
+
+        assert_(np.shares_memory(cls(x[1::3]), x[::2]))
+        assert_(np.may_share_memory(cls(x[1::3]), x[::2]))
+
+
+def view_element_first_byte(x):
+    """Construct an array viewing the first byte of each element of `x`"""
+    from numpy.lib.stride_tricks import DummyArray
+    interface = dict(x.__array_interface__)
+    interface['typestr'] = '|b1'
+    interface['descr'] = [('', '|b1')]
+    return np.asarray(DummyArray(interface, x))
+
+
+def assert_copy_equivalent(operation, args, out, **kwargs):
+    """
+    Check that operation(*args, out=out) produces results
+    equivalent to out[...] = operation(*args, out=out.copy())
+    """
+
+    kwargs['out'] = out
+    kwargs2 = dict(kwargs)
+    kwargs2['out'] = out.copy()
+
+    out_orig = out.copy()
+    out[...] = operation(*args, **kwargs2)
+    expected = out.copy()
+    out[...] = out_orig
+
+    got = operation(*args, **kwargs).copy()
+
+    if (got != expected).any():
+        assert_equal(got, expected)
+
+
+class TestUFunc:
+    """
+    Test ufunc call memory overlap handling
+    """
+
+    def check_unary_fuzz(self, operation, get_out_axis_size, dtype=np.int16,
+                             count=5000):
+        shapes = [7, 13, 8, 21, 29, 32]
+
+        rng = np.random.RandomState(1234)
+
+        for ndim in range(1, 6):
+            x = rng.randint(0, 2**16, size=shapes[:ndim]).astype(dtype)
+
+            it = iter_random_view_pairs(x, same_steps=False, equal_size=True)
+
+            min_count = count // (ndim + 1)**2
+
+            overlapping = 0
+            while overlapping < min_count:
+                a, b = next(it)
+
+                a_orig = a.copy()
+                b_orig = b.copy()
+
+                if get_out_axis_size is None:
+                    assert_copy_equivalent(operation, [a], out=b)
+
+                    if np.shares_memory(a, b):
+                        overlapping += 1
+                else:
+                    for axis in itertools.chain(range(ndim), [None]):
+                        a[...] = a_orig
+                        b[...] = b_orig
+
+                        # Determine size for reduction axis (None if scalar)
+                        outsize, scalarize = get_out_axis_size(a, b, axis)
+                        if outsize == 'skip':
+                            continue
+
+                        # Slice b to get an output array of the correct size
+                        sl = [slice(None)] * ndim
+                        if axis is None:
+                            if outsize is None:
+                                sl = [slice(0, 1)] + [0]*(ndim - 1)
+                            else:
+                                sl = [slice(0, outsize)] + [0]*(ndim - 1)
+                        else:
+                            if outsize is None:
+                                k = b.shape[axis]//2
+                                if ndim == 1:
+                                    sl[axis] = slice(k, k + 1)
+                                else:
+                                    sl[axis] = k
+                            else:
+                                assert b.shape[axis] >= outsize
+                                sl[axis] = slice(0, outsize)
+                        b_out = b[tuple(sl)]
+
+                        if scalarize:
+                            b_out = b_out.reshape([])
+
+                        if np.shares_memory(a, b_out):
+                            overlapping += 1
+
+                        # Check result
+                        assert_copy_equivalent(operation, [a], out=b_out, axis=axis)
+
+    @pytest.mark.slow
+    def test_unary_ufunc_call_fuzz(self):
+        self.check_unary_fuzz(np.invert, None, np.int16)
+
+    def test_binary_ufunc_accumulate_fuzz(self):
+        def get_out_axis_size(a, b, axis):
+            if axis is None:
+                if a.ndim == 1:
+                    return a.size, False
+                else:
+                    return 'skip', False  # accumulate doesn't support this
+            else:
+                return a.shape[axis], False
+
+        self.check_unary_fuzz(np.add.accumulate, get_out_axis_size,
+                              dtype=np.int16, count=500)
+
+    def test_binary_ufunc_reduce_fuzz(self):
+        def get_out_axis_size(a, b, axis):
+            return None, (axis is None or a.ndim == 1)
+
+        self.check_unary_fuzz(np.add.reduce, get_out_axis_size,
+                              dtype=np.int16, count=500)
+
+    def test_binary_ufunc_reduceat_fuzz(self):
+        def get_out_axis_size(a, b, axis):
+            if axis is None:
+                if a.ndim == 1:
+                    return a.size, False
+                else:
+                    return 'skip', False  # reduceat doesn't support this
+            else:
+                return a.shape[axis], False
+
+        def do_reduceat(a, out, axis):
+            if axis is None:
+                size = len(a)
+                step = size//len(out)
+            else:
+                size = a.shape[axis]
+                step = a.shape[axis] // out.shape[axis]
+            idx = np.arange(0, size, step)
+            return np.add.reduceat(a, idx, out=out, axis=axis)
+
+        self.check_unary_fuzz(do_reduceat, get_out_axis_size,
+                              dtype=np.int16, count=500)
+
+    def test_binary_ufunc_reduceat_manual(self):
+        def check(ufunc, a, ind, out):
+            c1 = ufunc.reduceat(a.copy(), ind.copy(), out=out.copy())
+            c2 = ufunc.reduceat(a, ind, out=out)
+            assert_array_equal(c1, c2)
+
+        # Exactly same input/output arrays
+        a = np.arange(10000, dtype=np.int16)
+        check(np.add, a, a[::-1].copy(), a)
+
+        # Overlap with index
+        a = np.arange(10000, dtype=np.int16)
+        check(np.add, a, a[::-1], a)
+
+    @pytest.mark.slow
+    def test_unary_gufunc_fuzz(self):
+        shapes = [7, 13, 8, 21, 29, 32]
+        gufunc = _umath_tests.euclidean_pdist
+
+        rng = np.random.RandomState(1234)
+
+        for ndim in range(2, 6):
+            x = rng.rand(*shapes[:ndim])
+
+            it = iter_random_view_pairs(x, same_steps=False, equal_size=True)
+
+            min_count = 500 // (ndim + 1)**2
+
+            overlapping = 0
+            while overlapping < min_count:
+                a, b = next(it)
+
+                if min(a.shape[-2:]) < 2 or min(b.shape[-2:]) < 2 or a.shape[-1] < 2:
+                    continue
+
+                # Ensure the shapes are so that euclidean_pdist is happy
+                if b.shape[-1] > b.shape[-2]:
+                    b = b[...,0,:]
+                else:
+                    b = b[...,:,0]
+
+                n = a.shape[-2]
+                p = n * (n - 1) // 2
+                if p <= b.shape[-1] and p > 0:
+                    b = b[...,:p]
+                else:
+                    n = max(2, int(np.sqrt(b.shape[-1]))//2)
+                    p = n * (n - 1) // 2
+                    a = a[...,:n,:]
+                    b = b[...,:p]
+
+                # Call
+                if np.shares_memory(a, b):
+                    overlapping += 1
+
+                with np.errstate(over='ignore', invalid='ignore'):
+                    assert_copy_equivalent(gufunc, [a], out=b)
+
+    def test_ufunc_at_manual(self):
+        def check(ufunc, a, ind, b=None):
+            a0 = a.copy()
+            if b is None:
+                ufunc.at(a0, ind.copy())
+                c1 = a0.copy()
+                ufunc.at(a, ind)
+                c2 = a.copy()
+            else:
+                ufunc.at(a0, ind.copy(), b.copy())
+                c1 = a0.copy()
+                ufunc.at(a, ind, b)
+                c2 = a.copy()
+            assert_array_equal(c1, c2)
+
+        # Overlap with index
+        a = np.arange(10000, dtype=np.int16)
+        check(np.invert, a[::-1], a)
+
+        # Overlap with second data array
+        a = np.arange(100, dtype=np.int16)
+        ind = np.arange(0, 100, 2, dtype=np.int16)
+        check(np.add, a, ind, a[25:75])
+
+    def test_unary_ufunc_1d_manual(self):
+        # Exercise branches in PyArray_EQUIVALENTLY_ITERABLE
+
+        def check(a, b):
+            a_orig = a.copy()
+            b_orig = b.copy()
+
+            b0 = b.copy()
+            c1 = ufunc(a, out=b0)
+            c2 = ufunc(a, out=b)
+            assert_array_equal(c1, c2)
+
+            # Trigger "fancy ufunc loop" code path
+            mask = view_element_first_byte(b).view(np.bool_)
+
+            a[...] = a_orig
+            b[...] = b_orig
+            c1 = ufunc(a, out=b.copy(), where=mask.copy()).copy()
+
+            a[...] = a_orig
+            b[...] = b_orig
+            c2 = ufunc(a, out=b, where=mask.copy()).copy()
+
+            # Also, mask overlapping with output
+            a[...] = a_orig
+            b[...] = b_orig
+            c3 = ufunc(a, out=b, where=mask).copy()
+
+            assert_array_equal(c1, c2)
+            assert_array_equal(c1, c3)
+
+        dtypes = [np.int8, np.int16, np.int32, np.int64, np.float32,
+                  np.float64, np.complex64, np.complex128]
+        dtypes = [np.dtype(x) for x in dtypes]
+
+        for dtype in dtypes:
+            if np.issubdtype(dtype, np.integer):
+                ufunc = np.invert
+            else:
+                ufunc = np.reciprocal
+
+            n = 1000
+            k = 10
+            indices = [
+                np.index_exp[:n],
+                np.index_exp[k:k+n],
+                np.index_exp[n-1::-1],
+                np.index_exp[k+n-1:k-1:-1],
+                np.index_exp[:2*n:2],
+                np.index_exp[k:k+2*n:2],
+                np.index_exp[2*n-1::-2],
+                np.index_exp[k+2*n-1:k-1:-2],
+            ]
+
+            for xi, yi in itertools.product(indices, indices):
+                v = np.arange(1, 1 + n*2 + k, dtype=dtype)
+                x = v[xi]
+                y = v[yi]
+
+                with np.errstate(all='ignore'):
+                    check(x, y)
+
+                    # Scalar cases
+                    check(x[:1], y)
+                    check(x[-1:], y)
+                    check(x[:1].reshape([]), y)
+                    check(x[-1:].reshape([]), y)
+
+    def test_unary_ufunc_where_same(self):
+        # Check behavior at wheremask overlap
+        ufunc = np.invert
+
+        def check(a, out, mask):
+            c1 = ufunc(a, out=out.copy(), where=mask.copy())
+            c2 = ufunc(a, out=out, where=mask)
+            assert_array_equal(c1, c2)
+
+        # Check behavior with same input and output arrays
+        x = np.arange(100).astype(np.bool_)
+        check(x, x, x)
+        check(x, x.copy(), x)
+        check(x, x, x.copy())
+
+    @pytest.mark.slow
+    def test_binary_ufunc_1d_manual(self):
+        ufunc = np.add
+
+        def check(a, b, c):
+            c0 = c.copy()
+            c1 = ufunc(a, b, out=c0)
+            c2 = ufunc(a, b, out=c)
+            assert_array_equal(c1, c2)
+
+        for dtype in [np.int8, np.int16, np.int32, np.int64,
+                      np.float32, np.float64, np.complex64, np.complex128]:
+            # Check different data dependency orders
+
+            n = 1000
+            k = 10
+
+            indices = []
+            for p in [1, 2]:
+                indices.extend([
+                    np.index_exp[:p*n:p],
+                    np.index_exp[k:k+p*n:p],
+                    np.index_exp[p*n-1::-p],
+                    np.index_exp[k+p*n-1:k-1:-p],
+                ])
+
+            for x, y, z in itertools.product(indices, indices, indices):
+                v = np.arange(6*n).astype(dtype)
+                x = v[x]
+                y = v[y]
+                z = v[z]
+
+                check(x, y, z)
+
+                # Scalar cases
+                check(x[:1], y, z)
+                check(x[-1:], y, z)
+                check(x[:1].reshape([]), y, z)
+                check(x[-1:].reshape([]), y, z)
+                check(x, y[:1], z)
+                check(x, y[-1:], z)
+                check(x, y[:1].reshape([]), z)
+                check(x, y[-1:].reshape([]), z)
+
+    def test_inplace_op_simple_manual(self):
+        rng = np.random.RandomState(1234)
+        x = rng.rand(200, 200)  # bigger than bufsize
+
+        x += x.T
+        assert_array_equal(x - x.T, 0)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_memmap.py b/venv/Lib/site-packages/numpy/core/tests/test_memmap.py
new file mode 100644
index 000000000..feef80ce8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_memmap.py
@@ -0,0 +1,213 @@
+import sys
+import os
+import shutil
+import mmap
+import pytest
+from pathlib import Path
+from tempfile import NamedTemporaryFile, TemporaryFile, mktemp, mkdtemp
+
+from numpy import (
+    memmap, sum, average, product, ndarray, isscalar, add, subtract, multiply)
+
+from numpy import arange, allclose, asarray
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, suppress_warnings
+    )
+
+class TestMemmap:
+    def setup(self):
+        self.tmpfp = NamedTemporaryFile(prefix='mmap')
+        self.tempdir = mkdtemp()
+        self.shape = (3, 4)
+        self.dtype = 'float32'
+        self.data = arange(12, dtype=self.dtype)
+        self.data.resize(self.shape)
+
+    def teardown(self):
+        self.tmpfp.close()
+        shutil.rmtree(self.tempdir)
+
+    def test_roundtrip(self):
+        # Write data to file
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        fp[:] = self.data[:]
+        del fp  # Test __del__ machinery, which handles cleanup
+
+        # Read data back from file
+        newfp = memmap(self.tmpfp, dtype=self.dtype, mode='r',
+                       shape=self.shape)
+        assert_(allclose(self.data, newfp))
+        assert_array_equal(self.data, newfp)
+        assert_equal(newfp.flags.writeable, False)
+
+    def test_open_with_filename(self):
+        tmpname = mktemp('', 'mmap', dir=self.tempdir)
+        fp = memmap(tmpname, dtype=self.dtype, mode='w+',
+                       shape=self.shape)
+        fp[:] = self.data[:]
+        del fp
+
+    def test_unnamed_file(self):
+        with TemporaryFile() as f:
+            fp = memmap(f, dtype=self.dtype, shape=self.shape)
+            del fp
+
+    def test_attributes(self):
+        offset = 1
+        mode = "w+"
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode=mode,
+                    shape=self.shape, offset=offset)
+        assert_equal(offset, fp.offset)
+        assert_equal(mode, fp.mode)
+        del fp
+
+    def test_filename(self):
+        tmpname = mktemp('', 'mmap', dir=self.tempdir)
+        fp = memmap(tmpname, dtype=self.dtype, mode='w+',
+                       shape=self.shape)
+        abspath = os.path.abspath(tmpname)
+        fp[:] = self.data[:]
+        assert_equal(abspath, fp.filename)
+        b = fp[:1]
+        assert_equal(abspath, b.filename)
+        del b
+        del fp
+
+    def test_path(self):
+        tmpname = mktemp('', 'mmap', dir=self.tempdir)
+        fp = memmap(Path(tmpname), dtype=self.dtype, mode='w+',
+                       shape=self.shape)
+        # os.path.realpath does not resolve symlinks on Windows
+        # see: https://bugs.python.org/issue9949
+        # use Path.resolve, just as memmap class does internally
+        abspath = str(Path(tmpname).resolve())
+        fp[:] = self.data[:]
+        assert_equal(abspath, str(fp.filename.resolve()))
+        b = fp[:1]
+        assert_equal(abspath, str(b.filename.resolve()))
+        del b
+        del fp
+
+    def test_filename_fileobj(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode="w+",
+                    shape=self.shape)
+        assert_equal(fp.filename, self.tmpfp.name)
+
+    @pytest.mark.skipif(sys.platform == 'gnu0',
+                        reason="Known to fail on hurd")
+    def test_flush(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        fp[:] = self.data[:]
+        assert_equal(fp[0], self.data[0])
+        fp.flush()
+
+    def test_del(self):
+        # Make sure a view does not delete the underlying mmap
+        fp_base = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        fp_base[0] = 5
+        fp_view = fp_base[0:1]
+        assert_equal(fp_view[0], 5)
+        del fp_view
+        # Should still be able to access and assign values after
+        # deleting the view
+        assert_equal(fp_base[0], 5)
+        fp_base[0] = 6
+        assert_equal(fp_base[0], 6)
+
+    def test_arithmetic_drops_references(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        tmp = (fp + 10)
+        if isinstance(tmp, memmap):
+            assert_(tmp._mmap is not fp._mmap)
+
+    def test_indexing_drops_references(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        tmp = fp[(1, 2), (2, 3)]
+        if isinstance(tmp, memmap):
+            assert_(tmp._mmap is not fp._mmap)
+
+    def test_slicing_keeps_references(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, mode='w+',
+                    shape=self.shape)
+        assert_(fp[:2, :2]._mmap is fp._mmap)
+
+    def test_view(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, shape=self.shape)
+        new1 = fp.view()
+        new2 = new1.view()
+        assert_(new1.base is fp)
+        assert_(new2.base is fp)
+        new_array = asarray(fp)
+        assert_(new_array.base is fp)
+
+    def test_ufunc_return_ndarray(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, shape=self.shape)
+        fp[:] = self.data
+
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning, "np.average currently does not preserve")
+            for unary_op in [sum, average, product]:
+                result = unary_op(fp)
+                assert_(isscalar(result))
+                assert_(result.__class__ is self.data[0, 0].__class__)
+
+                assert_(unary_op(fp, axis=0).__class__ is ndarray)
+                assert_(unary_op(fp, axis=1).__class__ is ndarray)
+
+        for binary_op in [add, subtract, multiply]:
+            assert_(binary_op(fp, self.data).__class__ is ndarray)
+            assert_(binary_op(self.data, fp).__class__ is ndarray)
+            assert_(binary_op(fp, fp).__class__ is ndarray)
+
+        fp += 1
+        assert(fp.__class__ is memmap)
+        add(fp, 1, out=fp)
+        assert(fp.__class__ is memmap)
+
+    def test_getitem(self):
+        fp = memmap(self.tmpfp, dtype=self.dtype, shape=self.shape)
+        fp[:] = self.data
+
+        assert_(fp[1:, :-1].__class__ is memmap)
+        # Fancy indexing returns a copy that is not memmapped
+        assert_(fp[[0, 1]].__class__ is ndarray)
+
+    def test_memmap_subclass(self):
+        class MemmapSubClass(memmap):
+            pass
+
+        fp = MemmapSubClass(self.tmpfp, dtype=self.dtype, shape=self.shape)
+        fp[:] = self.data
+
+        # We keep previous behavior for subclasses of memmap, i.e. the
+        # ufunc and __getitem__ output is never turned into a ndarray
+        assert_(sum(fp, axis=0).__class__ is MemmapSubClass)
+        assert_(sum(fp).__class__ is MemmapSubClass)
+        assert_(fp[1:, :-1].__class__ is MemmapSubClass)
+        assert(fp[[0, 1]].__class__ is MemmapSubClass)
+
+    def test_mmap_offset_greater_than_allocation_granularity(self):
+        size = 5 * mmap.ALLOCATIONGRANULARITY
+        offset = mmap.ALLOCATIONGRANULARITY + 1
+        fp = memmap(self.tmpfp, shape=size, mode='w+', offset=offset)
+        assert_(fp.offset == offset)
+
+    def test_no_shape(self):
+        self.tmpfp.write(b'a'*16)
+        mm = memmap(self.tmpfp, dtype='float64')
+        assert_equal(mm.shape, (2,))
+
+    def test_empty_array(self):
+        # gh-12653
+        with pytest.raises(ValueError, match='empty file'):
+            memmap(self.tmpfp, shape=(0,4), mode='w+')
+
+        self.tmpfp.write(b'\0')
+
+        # ok now the file is not empty
+        memmap(self.tmpfp, shape=(0,4), mode='w+')
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_multiarray.py b/venv/Lib/site-packages/numpy/core/tests/test_multiarray.py
new file mode 100644
index 000000000..002603ef0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_multiarray.py
@@ -0,0 +1,8453 @@
+import collections.abc
+import tempfile
+import sys
+import shutil
+import warnings
+import operator
+import io
+import itertools
+import functools
+import ctypes
+import os
+import gc
+import weakref
+import pytest
+from contextlib import contextmanager
+
+from numpy.compat import pickle
+
+import pathlib
+import builtins
+from decimal import Decimal
+
+import numpy as np
+from numpy.compat import strchar
+import numpy.core._multiarray_tests as _multiarray_tests
+from numpy.testing import (
+    assert_, assert_raises, assert_warns, assert_equal, assert_almost_equal,
+    assert_array_equal, assert_raises_regex, assert_array_almost_equal,
+    assert_allclose, IS_PYPY, HAS_REFCOUNT, assert_array_less, runstring,
+    temppath, suppress_warnings, break_cycles,
+    )
+from numpy.testing._private.utils import _no_tracing
+from numpy.core.tests._locales import CommaDecimalPointLocale
+
+# Need to test an object that does not fully implement math interface
+from datetime import timedelta, datetime
+
+
+def _aligned_zeros(shape, dtype=float, order="C", align=None):
+    """
+    Allocate a new ndarray with aligned memory.
+
+    The ndarray is guaranteed *not* aligned to twice the requested alignment.
+    Eg, if align=4, guarantees it is not aligned to 8. If align=None uses
+    dtype.alignment."""
+    dtype = np.dtype(dtype)
+    if dtype == np.dtype(object):
+        # Can't do this, fall back to standard allocation (which
+        # should always be sufficiently aligned)
+        if align is not None:
+            raise ValueError("object array alignment not supported")
+        return np.zeros(shape, dtype=dtype, order=order)
+    if align is None:
+        align = dtype.alignment
+    if not hasattr(shape, '__len__'):
+        shape = (shape,)
+    size = functools.reduce(operator.mul, shape) * dtype.itemsize
+    buf = np.empty(size + 2*align + 1, np.uint8)
+
+    ptr = buf.__array_interface__['data'][0]
+    offset = ptr % align
+    if offset != 0:
+        offset = align - offset
+    if (ptr % (2*align)) == 0:
+        offset += align
+
+    # Note: slices producing 0-size arrays do not necessarily change
+    # data pointer --- so we use and allocate size+1
+    buf = buf[offset:offset+size+1][:-1]
+    data = np.ndarray(shape, dtype, buf, order=order)
+    data.fill(0)
+    return data
+
+
+class TestFlags:
+    def setup(self):
+        self.a = np.arange(10)
+
+    def test_writeable(self):
+        mydict = locals()
+        self.a.flags.writeable = False
+        assert_raises(ValueError, runstring, 'self.a[0] = 3', mydict)
+        assert_raises(ValueError, runstring, 'self.a[0:1].itemset(3)', mydict)
+        self.a.flags.writeable = True
+        self.a[0] = 5
+        self.a[0] = 0
+
+    def test_writeable_any_base(self):
+        # Ensure that any base being writeable is sufficient to change flag;
+        # this is especially interesting for arrays from an array interface.
+        arr = np.arange(10)
+
+        class subclass(np.ndarray):
+            pass
+
+        # Create subclass so base will not be collapsed, this is OK to change
+        view1 = arr.view(subclass)
+        view2 = view1[...]
+        arr.flags.writeable = False
+        view2.flags.writeable = False
+        view2.flags.writeable = True  # Can be set to True again.
+
+        arr = np.arange(10)
+
+        class frominterface:
+            def __init__(self, arr):
+                self.arr = arr
+                self.__array_interface__ = arr.__array_interface__
+
+        view1 = np.asarray(frominterface)
+        view2 = view1[...]
+        view2.flags.writeable = False
+        view2.flags.writeable = True
+
+        view1.flags.writeable = False
+        view2.flags.writeable = False
+        with assert_raises(ValueError):
+            # Must assume not writeable, since only base is not:
+            view2.flags.writeable = True
+
+    def test_writeable_from_readonly(self):
+        # gh-9440 - make sure fromstring, from buffer on readonly buffers
+        # set writeable False
+        data = b'\x00' * 100
+        vals = np.frombuffer(data, 'B')
+        assert_raises(ValueError, vals.setflags, write=True)
+        types = np.dtype( [('vals', 'u1'), ('res3', 'S4')] )
+        values = np.core.records.fromstring(data, types)
+        vals = values['vals']
+        assert_raises(ValueError, vals.setflags, write=True)
+
+    def test_writeable_from_buffer(self):
+        data = bytearray(b'\x00' * 100)
+        vals = np.frombuffer(data, 'B')
+        assert_(vals.flags.writeable)
+        vals.setflags(write=False)
+        assert_(vals.flags.writeable is False)
+        vals.setflags(write=True)
+        assert_(vals.flags.writeable)
+        types = np.dtype( [('vals', 'u1'), ('res3', 'S4')] )
+        values = np.core.records.fromstring(data, types)
+        vals = values['vals']
+        assert_(vals.flags.writeable)
+        vals.setflags(write=False)
+        assert_(vals.flags.writeable is False)
+        vals.setflags(write=True)
+        assert_(vals.flags.writeable)
+
+    @pytest.mark.skipif(IS_PYPY, reason="PyPy always copies")
+    def test_writeable_pickle(self):
+        import pickle
+        # Small arrays will be copied without setting base.
+        # See condition for using PyArray_SetBaseObject in
+        # array_setstate.
+        a = np.arange(1000)
+        for v in range(pickle.HIGHEST_PROTOCOL):
+            vals = pickle.loads(pickle.dumps(a, v))
+            assert_(vals.flags.writeable)
+            assert_(isinstance(vals.base, bytes))
+
+    def test_writeable_from_c_data(self):
+        # Test that the writeable flag can be changed for an array wrapping
+        # low level C-data, but not owning its data.
+        # Also see that this is deprecated to change from python.
+        from numpy.core._multiarray_tests import get_c_wrapping_array
+
+        arr_writeable = get_c_wrapping_array(True)
+        assert not arr_writeable.flags.owndata
+        assert arr_writeable.flags.writeable
+        view = arr_writeable[...]
+
+        # Toggling the writeable flag works on the view:
+        view.flags.writeable = False
+        assert not view.flags.writeable
+        view.flags.writeable = True
+        assert view.flags.writeable
+        # Flag can be unset on the arr_writeable:
+        arr_writeable.flags.writeable = False
+
+        arr_readonly = get_c_wrapping_array(False)
+        assert not arr_readonly.flags.owndata
+        assert not arr_readonly.flags.writeable
+
+        for arr in [arr_writeable, arr_readonly]:
+            view = arr[...]
+            view.flags.writeable = False  # make sure it is readonly
+            arr.flags.writeable = False
+            assert not arr.flags.writeable
+
+            with assert_raises(ValueError):
+                view.flags.writeable = True
+
+            with warnings.catch_warnings():
+                warnings.simplefilter("error", DeprecationWarning)
+                with assert_raises(DeprecationWarning):
+                    arr.flags.writeable = True
+
+            with assert_warns(DeprecationWarning):
+                arr.flags.writeable = True
+
+    def test_warnonwrite(self):
+        a = np.arange(10)
+        a.flags._warn_on_write = True
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always')
+            a[1] = 10
+            a[2] = 10
+            # only warn once
+            assert_(len(w) == 1)
+
+    def test_otherflags(self):
+        assert_equal(self.a.flags.carray, True)
+        assert_equal(self.a.flags['C'], True)
+        assert_equal(self.a.flags.farray, False)
+        assert_equal(self.a.flags.behaved, True)
+        assert_equal(self.a.flags.fnc, False)
+        assert_equal(self.a.flags.forc, True)
+        assert_equal(self.a.flags.owndata, True)
+        assert_equal(self.a.flags.writeable, True)
+        assert_equal(self.a.flags.aligned, True)
+        with assert_warns(DeprecationWarning):
+            assert_equal(self.a.flags.updateifcopy, False)
+        with assert_warns(DeprecationWarning):
+            assert_equal(self.a.flags['U'], False)
+            assert_equal(self.a.flags['UPDATEIFCOPY'], False)
+        assert_equal(self.a.flags.writebackifcopy, False)
+        assert_equal(self.a.flags['X'], False)
+        assert_equal(self.a.flags['WRITEBACKIFCOPY'], False)
+
+    def test_string_align(self):
+        a = np.zeros(4, dtype=np.dtype('|S4'))
+        assert_(a.flags.aligned)
+        # not power of two are accessed byte-wise and thus considered aligned
+        a = np.zeros(5, dtype=np.dtype('|S4'))
+        assert_(a.flags.aligned)
+
+    def test_void_align(self):
+        a = np.zeros(4, dtype=np.dtype([("a", "i4"), ("b", "i4")]))
+        assert_(a.flags.aligned)
+
+
+class TestHash:
+    # see #3793
+    def test_int(self):
+        for st, ut, s in [(np.int8, np.uint8, 8),
+                          (np.int16, np.uint16, 16),
+                          (np.int32, np.uint32, 32),
+                          (np.int64, np.uint64, 64)]:
+            for i in range(1, s):
+                assert_equal(hash(st(-2**i)), hash(-2**i),
+                             err_msg="%r: -2**%d" % (st, i))
+                assert_equal(hash(st(2**(i - 1))), hash(2**(i - 1)),
+                             err_msg="%r: 2**%d" % (st, i - 1))
+                assert_equal(hash(st(2**i - 1)), hash(2**i - 1),
+                             err_msg="%r: 2**%d - 1" % (st, i))
+
+                i = max(i - 1, 1)
+                assert_equal(hash(ut(2**(i - 1))), hash(2**(i - 1)),
+                             err_msg="%r: 2**%d" % (ut, i - 1))
+                assert_equal(hash(ut(2**i - 1)), hash(2**i - 1),
+                             err_msg="%r: 2**%d - 1" % (ut, i))
+
+
+class TestAttributes:
+    def setup(self):
+        self.one = np.arange(10)
+        self.two = np.arange(20).reshape(4, 5)
+        self.three = np.arange(60, dtype=np.float64).reshape(2, 5, 6)
+
+    def test_attributes(self):
+        assert_equal(self.one.shape, (10,))
+        assert_equal(self.two.shape, (4, 5))
+        assert_equal(self.three.shape, (2, 5, 6))
+        self.three.shape = (10, 3, 2)
+        assert_equal(self.three.shape, (10, 3, 2))
+        self.three.shape = (2, 5, 6)
+        assert_equal(self.one.strides, (self.one.itemsize,))
+        num = self.two.itemsize
+        assert_equal(self.two.strides, (5*num, num))
+        num = self.three.itemsize
+        assert_equal(self.three.strides, (30*num, 6*num, num))
+        assert_equal(self.one.ndim, 1)
+        assert_equal(self.two.ndim, 2)
+        assert_equal(self.three.ndim, 3)
+        num = self.two.itemsize
+        assert_equal(self.two.size, 20)
+        assert_equal(self.two.nbytes, 20*num)
+        assert_equal(self.two.itemsize, self.two.dtype.itemsize)
+        assert_equal(self.two.base, np.arange(20))
+
+    def test_dtypeattr(self):
+        assert_equal(self.one.dtype, np.dtype(np.int_))
+        assert_equal(self.three.dtype, np.dtype(np.float_))
+        assert_equal(self.one.dtype.char, 'l')
+        assert_equal(self.three.dtype.char, 'd')
+        assert_(self.three.dtype.str[0] in '<>')
+        assert_equal(self.one.dtype.str[1], 'i')
+        assert_equal(self.three.dtype.str[1], 'f')
+
+    def test_int_subclassing(self):
+        # Regression test for https://github.com/numpy/numpy/pull/3526
+
+        numpy_int = np.int_(0)
+
+        # int_ doesn't inherit from Python int, because it's not fixed-width
+        assert_(not isinstance(numpy_int, int))
+
+    def test_stridesattr(self):
+        x = self.one
+
+        def make_array(size, offset, strides):
+            return np.ndarray(size, buffer=x, dtype=int,
+                              offset=offset*x.itemsize,
+                              strides=strides*x.itemsize)
+
+        assert_equal(make_array(4, 4, -1), np.array([4, 3, 2, 1]))
+        assert_raises(ValueError, make_array, 4, 4, -2)
+        assert_raises(ValueError, make_array, 4, 2, -1)
+        assert_raises(ValueError, make_array, 8, 3, 1)
+        assert_equal(make_array(8, 3, 0), np.array([3]*8))
+        # Check behavior reported in gh-2503:
+        assert_raises(ValueError, make_array, (2, 3), 5, np.array([-2, -3]))
+        make_array(0, 0, 10)
+
+    def test_set_stridesattr(self):
+        x = self.one
+
+        def make_array(size, offset, strides):
+            try:
+                r = np.ndarray([size], dtype=int, buffer=x,
+                               offset=offset*x.itemsize)
+            except Exception as e:
+                raise RuntimeError(e)
+            r.strides = strides = strides*x.itemsize
+            return r
+
+        assert_equal(make_array(4, 4, -1), np.array([4, 3, 2, 1]))
+        assert_equal(make_array(7, 3, 1), np.array([3, 4, 5, 6, 7, 8, 9]))
+        assert_raises(ValueError, make_array, 4, 4, -2)
+        assert_raises(ValueError, make_array, 4, 2, -1)
+        assert_raises(RuntimeError, make_array, 8, 3, 1)
+        # Check that the true extent of the array is used.
+        # Test relies on as_strided base not exposing a buffer.
+        x = np.lib.stride_tricks.as_strided(np.arange(1), (10, 10), (0, 0))
+
+        def set_strides(arr, strides):
+            arr.strides = strides
+
+        assert_raises(ValueError, set_strides, x, (10*x.itemsize, x.itemsize))
+
+        # Test for offset calculations:
+        x = np.lib.stride_tricks.as_strided(np.arange(10, dtype=np.int8)[-1],
+                                                    shape=(10,), strides=(-1,))
+        assert_raises(ValueError, set_strides, x[::-1], -1)
+        a = x[::-1]
+        a.strides = 1
+        a[::2].strides = 2
+
+        # test 0d
+        arr_0d = np.array(0)
+        arr_0d.strides = ()
+        assert_raises(TypeError, set_strides, arr_0d, None)
+
+    def test_fill(self):
+        for t in "?bhilqpBHILQPfdgFDGO":
+            x = np.empty((3, 2, 1), t)
+            y = np.empty((3, 2, 1), t)
+            x.fill(1)
+            y[...] = 1
+            assert_equal(x, y)
+
+    def test_fill_max_uint64(self):
+        x = np.empty((3, 2, 1), dtype=np.uint64)
+        y = np.empty((3, 2, 1), dtype=np.uint64)
+        value = 2**64 - 1
+        y[...] = value
+        x.fill(value)
+        assert_array_equal(x, y)
+
+    def test_fill_struct_array(self):
+        # Filling from a scalar
+        x = np.array([(0, 0.0), (1, 1.0)], dtype='i4,f8')
+        x.fill(x[0])
+        assert_equal(x['f1'][1], x['f1'][0])
+        # Filling from a tuple that can be converted
+        # to a scalar
+        x = np.zeros(2, dtype=[('a', 'f8'), ('b', 'i4')])
+        x.fill((3.5, -2))
+        assert_array_equal(x['a'], [3.5, 3.5])
+        assert_array_equal(x['b'], [-2, -2])
+
+
+class TestArrayConstruction:
+    def test_array(self):
+        d = np.ones(6)
+        r = np.array([d, d])
+        assert_equal(r, np.ones((2, 6)))
+
+        d = np.ones(6)
+        tgt = np.ones((2, 6))
+        r = np.array([d, d])
+        assert_equal(r, tgt)
+        tgt[1] = 2
+        r = np.array([d, d + 1])
+        assert_equal(r, tgt)
+
+        d = np.ones(6)
+        r = np.array([[d, d]])
+        assert_equal(r, np.ones((1, 2, 6)))
+
+        d = np.ones(6)
+        r = np.array([[d, d], [d, d]])
+        assert_equal(r, np.ones((2, 2, 6)))
+
+        d = np.ones((6, 6))
+        r = np.array([d, d])
+        assert_equal(r, np.ones((2, 6, 6)))
+
+        d = np.ones((6, ))
+        r = np.array([[d, d + 1], d + 2], dtype=object)
+        assert_equal(len(r), 2)
+        assert_equal(r[0], [d, d + 1])
+        assert_equal(r[1], d + 2)
+
+        tgt = np.ones((2, 3), dtype=bool)
+        tgt[0, 2] = False
+        tgt[1, 0:2] = False
+        r = np.array([[True, True, False], [False, False, True]])
+        assert_equal(r, tgt)
+        r = np.array([[True, False], [True, False], [False, True]])
+        assert_equal(r, tgt.T)
+
+    def test_array_empty(self):
+        assert_raises(TypeError, np.array)
+
+    def test_array_copy_false(self):
+        d = np.array([1, 2, 3])
+        e = np.array(d, copy=False)
+        d[1] = 3
+        assert_array_equal(e, [1, 3, 3])
+        e = np.array(d, copy=False, order='F')
+        d[1] = 4
+        assert_array_equal(e, [1, 4, 3])
+        e[2] = 7
+        assert_array_equal(d, [1, 4, 7])
+
+    def test_array_copy_true(self):
+        d = np.array([[1,2,3], [1, 2, 3]])
+        e = np.array(d, copy=True)
+        d[0, 1] = 3
+        e[0, 2] = -7
+        assert_array_equal(e, [[1, 2, -7], [1, 2, 3]])
+        assert_array_equal(d, [[1, 3, 3], [1, 2, 3]])
+        e = np.array(d, copy=True, order='F')
+        d[0, 1] = 5
+        e[0, 2] = 7
+        assert_array_equal(e, [[1, 3, 7], [1, 2, 3]])
+        assert_array_equal(d, [[1, 5, 3], [1,2,3]])
+
+    def test_array_cont(self):
+        d = np.ones(10)[::2]
+        assert_(np.ascontiguousarray(d).flags.c_contiguous)
+        assert_(np.ascontiguousarray(d).flags.f_contiguous)
+        assert_(np.asfortranarray(d).flags.c_contiguous)
+        assert_(np.asfortranarray(d).flags.f_contiguous)
+        d = np.ones((10, 10))[::2,::2]
+        assert_(np.ascontiguousarray(d).flags.c_contiguous)
+        assert_(np.asfortranarray(d).flags.f_contiguous)
+
+
+class TestAssignment:
+    def test_assignment_broadcasting(self):
+        a = np.arange(6).reshape(2, 3)
+
+        # Broadcasting the input to the output
+        a[...] = np.arange(3)
+        assert_equal(a, [[0, 1, 2], [0, 1, 2]])
+        a[...] = np.arange(2).reshape(2, 1)
+        assert_equal(a, [[0, 0, 0], [1, 1, 1]])
+
+        # For compatibility with <= 1.5, a limited version of broadcasting
+        # the output to the input.
+        #
+        # This behavior is inconsistent with NumPy broadcasting
+        # in general, because it only uses one of the two broadcasting
+        # rules (adding a new "1" dimension to the left of the shape),
+        # applied to the output instead of an input. In NumPy 2.0, this kind
+        # of broadcasting assignment will likely be disallowed.
+        a[...] = np.arange(6)[::-1].reshape(1, 2, 3)
+        assert_equal(a, [[5, 4, 3], [2, 1, 0]])
+        # The other type of broadcasting would require a reduction operation.
+
+        def assign(a, b):
+            a[...] = b
+
+        assert_raises(ValueError, assign, a, np.arange(12).reshape(2, 2, 3))
+
+    def test_assignment_errors(self):
+        # Address issue #2276
+        class C:
+            pass
+        a = np.zeros(1)
+
+        def assign(v):
+            a[0] = v
+
+        assert_raises((AttributeError, TypeError), assign, C())
+        assert_raises(ValueError, assign, [1])
+
+    def test_unicode_assignment(self):
+        # gh-5049
+        from numpy.core.numeric import set_string_function
+
+        @contextmanager
+        def inject_str(s):
+            """ replace ndarray.__str__ temporarily """
+            set_string_function(lambda x: s, repr=False)
+            try:
+                yield
+            finally:
+                set_string_function(None, repr=False)
+
+        a1d = np.array([u'test'])
+        a0d = np.array(u'done')
+        with inject_str(u'bad'):
+            a1d[0] = a0d  # previously this would invoke __str__
+        assert_equal(a1d[0], u'done')
+
+        # this would crash for the same reason
+        np.array([np.array(u'\xe5\xe4\xf6')])
+
+    def test_stringlike_empty_list(self):
+        # gh-8902
+        u = np.array([u'done'])
+        b = np.array([b'done'])
+
+        class bad_sequence:
+            def __getitem__(self): pass
+            def __len__(self): raise RuntimeError
+
+        assert_raises(ValueError, operator.setitem, u, 0, [])
+        assert_raises(ValueError, operator.setitem, b, 0, [])
+
+        assert_raises(ValueError, operator.setitem, u, 0, bad_sequence())
+        assert_raises(ValueError, operator.setitem, b, 0, bad_sequence())
+
+    def test_longdouble_assignment(self):
+        # only relevant if longdouble is larger than float
+        # we're looking for loss of precision
+
+        for dtype in (np.longdouble, np.longcomplex):
+            # gh-8902
+            tinyb = np.nextafter(np.longdouble(0), 1).astype(dtype)
+            tinya = np.nextafter(np.longdouble(0), -1).astype(dtype)
+
+            # construction
+            tiny1d = np.array([tinya])
+            assert_equal(tiny1d[0], tinya)
+
+            # scalar = scalar
+            tiny1d[0] = tinyb
+            assert_equal(tiny1d[0], tinyb)
+
+            # 0d = scalar
+            tiny1d[0, ...] = tinya
+            assert_equal(tiny1d[0], tinya)
+
+            # 0d = 0d
+            tiny1d[0, ...] = tinyb[...]
+            assert_equal(tiny1d[0], tinyb)
+
+            # scalar = 0d
+            tiny1d[0] = tinyb[...]
+            assert_equal(tiny1d[0], tinyb)
+
+            arr = np.array([np.array(tinya)])
+            assert_equal(arr[0], tinya)
+
+    def test_cast_to_string(self):
+        # cast to str should do "str(scalar)", not "str(scalar.item())"
+        # Example: In python2, str(float) is truncated, so we want to avoid
+        # str(np.float64(...).item()) as this would incorrectly truncate.
+        a = np.zeros(1, dtype='S20')
+        a[:] = np.array(['1.12345678901234567890'], dtype='f8')
+        assert_equal(a[0], b"1.1234567890123457")
+
+
+class TestDtypedescr:
+    def test_construction(self):
+        d1 = np.dtype('i4')
+        assert_equal(d1, np.dtype(np.int32))
+        d2 = np.dtype('f8')
+        assert_equal(d2, np.dtype(np.float64))
+
+    def test_byteorders(self):
+        assert_(np.dtype('<i4') != np.dtype('>i4'))
+        assert_(np.dtype([('a', '<i4')]) != np.dtype([('a', '>i4')]))
+
+    def test_structured_non_void(self):
+        fields = [('a', '<i2'), ('b', '<i2')]
+        dt_int = np.dtype(('i4', fields))
+        assert_equal(str(dt_int), "(numpy.int32, [('a', '<i2'), ('b', '<i2')])")
+
+        # gh-9821
+        arr_int = np.zeros(4, dt_int)
+        assert_equal(repr(arr_int),
+            "array([0, 0, 0, 0], dtype=(numpy.int32, [('a', '<i2'), ('b', '<i2')]))")
+
+
+class TestZeroRank:
+    def setup(self):
+        self.d = np.array(0), np.array('x', object)
+
+    def test_ellipsis_subscript(self):
+        a, b = self.d
+        assert_equal(a[...], 0)
+        assert_equal(b[...], 'x')
+        assert_(a[...].base is a)  # `a[...] is a` in numpy <1.9.
+        assert_(b[...].base is b)  # `b[...] is b` in numpy <1.9.
+
+    def test_empty_subscript(self):
+        a, b = self.d
+        assert_equal(a[()], 0)
+        assert_equal(b[()], 'x')
+        assert_(type(a[()]) is a.dtype.type)
+        assert_(type(b[()]) is str)
+
+    def test_invalid_subscript(self):
+        a, b = self.d
+        assert_raises(IndexError, lambda x: x[0], a)
+        assert_raises(IndexError, lambda x: x[0], b)
+        assert_raises(IndexError, lambda x: x[np.array([], int)], a)
+        assert_raises(IndexError, lambda x: x[np.array([], int)], b)
+
+    def test_ellipsis_subscript_assignment(self):
+        a, b = self.d
+        a[...] = 42
+        assert_equal(a, 42)
+        b[...] = ''
+        assert_equal(b.item(), '')
+
+    def test_empty_subscript_assignment(self):
+        a, b = self.d
+        a[()] = 42
+        assert_equal(a, 42)
+        b[()] = ''
+        assert_equal(b.item(), '')
+
+    def test_invalid_subscript_assignment(self):
+        a, b = self.d
+
+        def assign(x, i, v):
+            x[i] = v
+
+        assert_raises(IndexError, assign, a, 0, 42)
+        assert_raises(IndexError, assign, b, 0, '')
+        assert_raises(ValueError, assign, a, (), '')
+
+    def test_newaxis(self):
+        a, b = self.d
+        assert_equal(a[np.newaxis].shape, (1,))
+        assert_equal(a[..., np.newaxis].shape, (1,))
+        assert_equal(a[np.newaxis, ...].shape, (1,))
+        assert_equal(a[..., np.newaxis].shape, (1,))
+        assert_equal(a[np.newaxis, ..., np.newaxis].shape, (1, 1))
+        assert_equal(a[..., np.newaxis, np.newaxis].shape, (1, 1))
+        assert_equal(a[np.newaxis, np.newaxis, ...].shape, (1, 1))
+        assert_equal(a[(np.newaxis,)*10].shape, (1,)*10)
+
+    def test_invalid_newaxis(self):
+        a, b = self.d
+
+        def subscript(x, i):
+            x[i]
+
+        assert_raises(IndexError, subscript, a, (np.newaxis, 0))
+        assert_raises(IndexError, subscript, a, (np.newaxis,)*50)
+
+    def test_constructor(self):
+        x = np.ndarray(())
+        x[()] = 5
+        assert_equal(x[()], 5)
+        y = np.ndarray((), buffer=x)
+        y[()] = 6
+        assert_equal(x[()], 6)
+
+        # strides and shape must be the same length
+        with pytest.raises(ValueError):
+            np.ndarray((2,), strides=())
+        with pytest.raises(ValueError):
+            np.ndarray((), strides=(2,))
+
+    def test_output(self):
+        x = np.array(2)
+        assert_raises(ValueError, np.add, x, [1], x)
+
+    def test_real_imag(self):
+        # contiguity checks are for gh-11245
+        x = np.array(1j)
+        xr = x.real
+        xi = x.imag
+
+        assert_equal(xr, np.array(0))
+        assert_(type(xr) is np.ndarray)
+        assert_equal(xr.flags.contiguous, True)
+        assert_equal(xr.flags.f_contiguous, True)
+
+        assert_equal(xi, np.array(1))
+        assert_(type(xi) is np.ndarray)
+        assert_equal(xi.flags.contiguous, True)
+        assert_equal(xi.flags.f_contiguous, True)
+
+
+class TestScalarIndexing:
+    def setup(self):
+        self.d = np.array([0, 1])[0]
+
+    def test_ellipsis_subscript(self):
+        a = self.d
+        assert_equal(a[...], 0)
+        assert_equal(a[...].shape, ())
+
+    def test_empty_subscript(self):
+        a = self.d
+        assert_equal(a[()], 0)
+        assert_equal(a[()].shape, ())
+
+    def test_invalid_subscript(self):
+        a = self.d
+        assert_raises(IndexError, lambda x: x[0], a)
+        assert_raises(IndexError, lambda x: x[np.array([], int)], a)
+
+    def test_invalid_subscript_assignment(self):
+        a = self.d
+
+        def assign(x, i, v):
+            x[i] = v
+
+        assert_raises(TypeError, assign, a, 0, 42)
+
+    def test_newaxis(self):
+        a = self.d
+        assert_equal(a[np.newaxis].shape, (1,))
+        assert_equal(a[..., np.newaxis].shape, (1,))
+        assert_equal(a[np.newaxis, ...].shape, (1,))
+        assert_equal(a[..., np.newaxis].shape, (1,))
+        assert_equal(a[np.newaxis, ..., np.newaxis].shape, (1, 1))
+        assert_equal(a[..., np.newaxis, np.newaxis].shape, (1, 1))
+        assert_equal(a[np.newaxis, np.newaxis, ...].shape, (1, 1))
+        assert_equal(a[(np.newaxis,)*10].shape, (1,)*10)
+
+    def test_invalid_newaxis(self):
+        a = self.d
+
+        def subscript(x, i):
+            x[i]
+
+        assert_raises(IndexError, subscript, a, (np.newaxis, 0))
+        assert_raises(IndexError, subscript, a, (np.newaxis,)*50)
+
+    def test_overlapping_assignment(self):
+        # With positive strides
+        a = np.arange(4)
+        a[:-1] = a[1:]
+        assert_equal(a, [1, 2, 3, 3])
+
+        a = np.arange(4)
+        a[1:] = a[:-1]
+        assert_equal(a, [0, 0, 1, 2])
+
+        # With positive and negative strides
+        a = np.arange(4)
+        a[:] = a[::-1]
+        assert_equal(a, [3, 2, 1, 0])
+
+        a = np.arange(6).reshape(2, 3)
+        a[::-1,:] = a[:, ::-1]
+        assert_equal(a, [[5, 4, 3], [2, 1, 0]])
+
+        a = np.arange(6).reshape(2, 3)
+        a[::-1, ::-1] = a[:, ::-1]
+        assert_equal(a, [[3, 4, 5], [0, 1, 2]])
+
+        # With just one element overlapping
+        a = np.arange(5)
+        a[:3] = a[2:]
+        assert_equal(a, [2, 3, 4, 3, 4])
+
+        a = np.arange(5)
+        a[2:] = a[:3]
+        assert_equal(a, [0, 1, 0, 1, 2])
+
+        a = np.arange(5)
+        a[2::-1] = a[2:]
+        assert_equal(a, [4, 3, 2, 3, 4])
+
+        a = np.arange(5)
+        a[2:] = a[2::-1]
+        assert_equal(a, [0, 1, 2, 1, 0])
+
+        a = np.arange(5)
+        a[2::-1] = a[:1:-1]
+        assert_equal(a, [2, 3, 4, 3, 4])
+
+        a = np.arange(5)
+        a[:1:-1] = a[2::-1]
+        assert_equal(a, [0, 1, 0, 1, 2])
+
+
+class TestCreation:
+    """
+    Test the np.array constructor
+    """
+    def test_from_attribute(self):
+        class x:
+            def __array__(self, dtype=None):
+                pass
+
+        assert_raises(ValueError, np.array, x())
+
+    def test_from_string(self):
+        types = np.typecodes['AllInteger'] + np.typecodes['Float']
+        nstr = ['123', '123']
+        result = np.array([123, 123], dtype=int)
+        for type in types:
+            msg = 'String conversion for %s' % type
+            assert_equal(np.array(nstr, dtype=type), result, err_msg=msg)
+
+    def test_void(self):
+        arr = np.array([], dtype='V')
+        assert_equal(arr.dtype.kind, 'V')
+
+    def test_too_big_error(self):
+        # 45341 is the smallest integer greater than sqrt(2**31 - 1).
+        # 3037000500 is the smallest integer greater than sqrt(2**63 - 1).
+        # We want to make sure that the square byte array with those dimensions
+        # is too big on 32 or 64 bit systems respectively.
+        if np.iinfo('intp').max == 2**31 - 1:
+            shape = (46341, 46341)
+        elif np.iinfo('intp').max == 2**63 - 1:
+            shape = (3037000500, 3037000500)
+        else:
+            return
+        assert_raises(ValueError, np.empty, shape, dtype=np.int8)
+        assert_raises(ValueError, np.zeros, shape, dtype=np.int8)
+        assert_raises(ValueError, np.ones, shape, dtype=np.int8)
+
+    @pytest.mark.skipif(np.dtype(np.intp).itemsize != 8,
+                        reason="malloc may not fail on 32 bit systems")
+    def test_malloc_fails(self):
+        # This test is guaranteed to fail due to a too large allocation
+        with assert_raises(np.core._exceptions._ArrayMemoryError):
+            np.empty(np.iinfo(np.intp).max, dtype=np.uint8)
+
+    def test_zeros(self):
+        types = np.typecodes['AllInteger'] + np.typecodes['AllFloat']
+        for dt in types:
+            d = np.zeros((13,), dtype=dt)
+            assert_equal(np.count_nonzero(d), 0)
+            # true for ieee floats
+            assert_equal(d.sum(), 0)
+            assert_(not d.any())
+
+            d = np.zeros(2, dtype='(2,4)i4')
+            assert_equal(np.count_nonzero(d), 0)
+            assert_equal(d.sum(), 0)
+            assert_(not d.any())
+
+            d = np.zeros(2, dtype='4i4')
+            assert_equal(np.count_nonzero(d), 0)
+            assert_equal(d.sum(), 0)
+            assert_(not d.any())
+
+            d = np.zeros(2, dtype='(2,4)i4, (2,4)i4')
+            assert_equal(np.count_nonzero(d), 0)
+
+    @pytest.mark.slow
+    def test_zeros_big(self):
+        # test big array as they might be allocated different by the system
+        types = np.typecodes['AllInteger'] + np.typecodes['AllFloat']
+        for dt in types:
+            d = np.zeros((30 * 1024**2,), dtype=dt)
+            assert_(not d.any())
+            # This test can fail on 32-bit systems due to insufficient
+            # contiguous memory. Deallocating the previous array increases the
+            # chance of success.
+            del(d)
+
+    def test_zeros_obj(self):
+        # test initialization from PyLong(0)
+        d = np.zeros((13,), dtype=object)
+        assert_array_equal(d, [0] * 13)
+        assert_equal(np.count_nonzero(d), 0)
+
+    def test_zeros_obj_obj(self):
+        d = np.zeros(10, dtype=[('k', object, 2)])
+        assert_array_equal(d['k'], 0)
+
+    def test_zeros_like_like_zeros(self):
+        # test zeros_like returns the same as zeros
+        for c in np.typecodes['All']:
+            if c == 'V':
+                continue
+            d = np.zeros((3,3), dtype=c)
+            assert_array_equal(np.zeros_like(d), d)
+            assert_equal(np.zeros_like(d).dtype, d.dtype)
+        # explicitly check some special cases
+        d = np.zeros((3,3), dtype='S5')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+        d = np.zeros((3,3), dtype='U5')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+
+        d = np.zeros((3,3), dtype='<i4')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+        d = np.zeros((3,3), dtype='>i4')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+
+        d = np.zeros((3,3), dtype='<M8[s]')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+        d = np.zeros((3,3), dtype='>M8[s]')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+
+        d = np.zeros((3,3), dtype='f4,f4')
+        assert_array_equal(np.zeros_like(d), d)
+        assert_equal(np.zeros_like(d).dtype, d.dtype)
+
+    def test_empty_unicode(self):
+        # don't throw decode errors on garbage memory
+        for i in range(5, 100, 5):
+            d = np.empty(i, dtype='U')
+            str(d)
+
+    def test_sequence_non_homogenous(self):
+        assert_equal(np.array([4, 2**80]).dtype, object)
+        assert_equal(np.array([4, 2**80, 4]).dtype, object)
+        assert_equal(np.array([2**80, 4]).dtype, object)
+        assert_equal(np.array([2**80] * 3).dtype, object)
+        assert_equal(np.array([[1, 1],[1j, 1j]]).dtype, complex)
+        assert_equal(np.array([[1j, 1j],[1, 1]]).dtype, complex)
+        assert_equal(np.array([[1, 1, 1],[1, 1j, 1.], [1, 1, 1]]).dtype, complex)
+
+    def test_non_sequence_sequence(self):
+        """Should not segfault.
+
+        Class Fail breaks the sequence protocol for new style classes, i.e.,
+        those derived from object. Class Map is a mapping type indicated by
+        raising a ValueError. At some point we may raise a warning instead
+        of an error in the Fail case.
+
+        """
+        class Fail:
+            def __len__(self):
+                return 1
+
+            def __getitem__(self, index):
+                raise ValueError()
+
+        class Map:
+            def __len__(self):
+                return 1
+
+            def __getitem__(self, index):
+                raise KeyError()
+
+        a = np.array([Map()])
+        assert_(a.shape == (1,))
+        assert_(a.dtype == np.dtype(object))
+        assert_raises(ValueError, np.array, [Fail()])
+
+    def test_no_len_object_type(self):
+        # gh-5100, want object array from iterable object without len()
+        class Point2:
+            def __init__(self):
+                pass
+
+            def __getitem__(self, ind):
+                if ind in [0, 1]:
+                    return ind
+                else:
+                    raise IndexError()
+        d = np.array([Point2(), Point2(), Point2()])
+        assert_equal(d.dtype, np.dtype(object))
+
+    def test_false_len_sequence(self):
+        # gh-7264, segfault for this example
+        class C:
+            def __getitem__(self, i):
+                raise IndexError
+            def __len__(self):
+                return 42
+
+        a = np.array(C()) # segfault?
+        assert_equal(len(a), 0)
+
+    def test_false_len_iterable(self):
+        # Special case where a bad __getitem__ makes us fall back on __iter__:
+        class C:
+            def __getitem__(self, x):
+                raise Exception
+            def __iter__(self):
+                return iter(())
+            def __len__(self):
+                return 2
+
+        a = np.empty(2)
+        with assert_raises(ValueError):
+            a[:] = C()  # Segfault!
+
+    def test_failed_len_sequence(self):
+        # gh-7393
+        class A:
+            def __init__(self, data):
+                self._data = data
+            def __getitem__(self, item):
+                return type(self)(self._data[item])
+            def __len__(self):
+                return len(self._data)
+
+        # len(d) should give 3, but len(d[0]) will fail
+        d = A([1,2,3])
+        assert_equal(len(np.array(d)), 3)
+
+    def test_array_too_big(self):
+        # Test that array creation succeeds for arrays addressable by intp
+        # on the byte level and fails for too large arrays.
+        buf = np.zeros(100)
+
+        max_bytes = np.iinfo(np.intp).max
+        for dtype in ["intp", "S20", "b"]:
+            dtype = np.dtype(dtype)
+            itemsize = dtype.itemsize
+
+            np.ndarray(buffer=buf, strides=(0,),
+                       shape=(max_bytes//itemsize,), dtype=dtype)
+            assert_raises(ValueError, np.ndarray, buffer=buf, strides=(0,),
+                          shape=(max_bytes//itemsize + 1,), dtype=dtype)
+
+    def _ragged_creation(self, seq):
+        # without dtype=object, the ragged object should raise
+        with assert_warns(np.VisibleDeprecationWarning):
+            a = np.array(seq)
+        b = np.array(seq, dtype=object)
+        assert_equal(a, b)
+        return b
+
+    def test_ragged_ndim_object(self):
+        # Lists of mismatching depths are treated as object arrays
+        a = self._ragged_creation([[1], 2, 3])
+        assert_equal(a.shape, (3,))
+        assert_equal(a.dtype, object)
+
+        a = self._ragged_creation([1, [2], 3])
+        assert_equal(a.shape, (3,))
+        assert_equal(a.dtype, object)
+
+        a = self._ragged_creation([1, 2, [3]])
+        assert_equal(a.shape, (3,))
+        assert_equal(a.dtype, object)
+
+    def test_ragged_shape_object(self):
+        # The ragged dimension of a list is turned into an object array
+        a = self._ragged_creation([[1, 1], [2], [3]])
+        assert_equal(a.shape, (3,))
+        assert_equal(a.dtype, object)
+
+        a = self._ragged_creation([[1], [2, 2], [3]])
+        assert_equal(a.shape, (3,))
+        assert_equal(a.dtype, object)
+
+        a = self._ragged_creation([[1], [2], [3, 3]])
+        assert a.shape == (3,)
+        assert a.dtype == object
+
+    def test_array_of_ragged_array(self):
+        outer = np.array([None, None])
+        outer[0] = outer[1] = np.array([1, 2, 3])
+        assert np.array(outer).shape == (2,)
+        assert np.array([outer]).shape == (1, 2)
+
+        outer_ragged = np.array([None, None])
+        outer_ragged[0] = np.array([1, 2, 3])
+        outer_ragged[1] = np.array([1, 2, 3, 4])
+        # should both of these emit deprecation warnings?
+        assert np.array(outer_ragged).shape == (2,)
+        assert np.array([outer_ragged]).shape == (1, 2,)
+
+    def test_deep_nonragged_object(self):
+        # None of these should raise, even though they are missing dtype=object
+        a = np.array([[[Decimal(1)]]])
+        a = np.array([1, Decimal(1)])
+        a = np.array([[1], [Decimal(1)]])
+
+class TestStructured:
+    def test_subarray_field_access(self):
+        a = np.zeros((3, 5), dtype=[('a', ('i4', (2, 2)))])
+        a['a'] = np.arange(60).reshape(3, 5, 2, 2)
+
+        # Since the subarray is always in C-order, a transpose
+        # does not swap the subarray:
+        assert_array_equal(a.T['a'], a['a'].transpose(1, 0, 2, 3))
+
+        # In Fortran order, the subarray gets appended
+        # like in all other cases, not prepended as a special case
+        b = a.copy(order='F')
+        assert_equal(a['a'].shape, b['a'].shape)
+        assert_equal(a.T['a'].shape, a.T.copy()['a'].shape)
+
+    def test_subarray_comparison(self):
+        # Check that comparisons between record arrays with
+        # multi-dimensional field types work properly
+        a = np.rec.fromrecords(
+            [([1, 2, 3], 'a', [[1, 2], [3, 4]]), ([3, 3, 3], 'b', [[0, 0], [0, 0]])],
+            dtype=[('a', ('f4', 3)), ('b', object), ('c', ('i4', (2, 2)))])
+        b = a.copy()
+        assert_equal(a == b, [True, True])
+        assert_equal(a != b, [False, False])
+        b[1].b = 'c'
+        assert_equal(a == b, [True, False])
+        assert_equal(a != b, [False, True])
+        for i in range(3):
+            b[0].a = a[0].a
+            b[0].a[i] = 5
+            assert_equal(a == b, [False, False])
+            assert_equal(a != b, [True, True])
+        for i in range(2):
+            for j in range(2):
+                b = a.copy()
+                b[0].c[i, j] = 10
+                assert_equal(a == b, [False, True])
+                assert_equal(a != b, [True, False])
+
+        # Check that broadcasting with a subarray works
+        a = np.array([[(0,)], [(1,)]], dtype=[('a', 'f8')])
+        b = np.array([(0,), (0,), (1,)], dtype=[('a', 'f8')])
+        assert_equal(a == b, [[True, True, False], [False, False, True]])
+        assert_equal(b == a, [[True, True, False], [False, False, True]])
+        a = np.array([[(0,)], [(1,)]], dtype=[('a', 'f8', (1,))])
+        b = np.array([(0,), (0,), (1,)], dtype=[('a', 'f8', (1,))])
+        assert_equal(a == b, [[True, True, False], [False, False, True]])
+        assert_equal(b == a, [[True, True, False], [False, False, True]])
+        a = np.array([[([0, 0],)], [([1, 1],)]], dtype=[('a', 'f8', (2,))])
+        b = np.array([([0, 0],), ([0, 1],), ([1, 1],)], dtype=[('a', 'f8', (2,))])
+        assert_equal(a == b, [[True, False, False], [False, False, True]])
+        assert_equal(b == a, [[True, False, False], [False, False, True]])
+
+        # Check that broadcasting Fortran-style arrays with a subarray work
+        a = np.array([[([0, 0],)], [([1, 1],)]], dtype=[('a', 'f8', (2,))], order='F')
+        b = np.array([([0, 0],), ([0, 1],), ([1, 1],)], dtype=[('a', 'f8', (2,))])
+        assert_equal(a == b, [[True, False, False], [False, False, True]])
+        assert_equal(b == a, [[True, False, False], [False, False, True]])
+
+        # Check that incompatible sub-array shapes don't result to broadcasting
+        x = np.zeros((1,), dtype=[('a', ('f4', (1, 2))), ('b', 'i1')])
+        y = np.zeros((1,), dtype=[('a', ('f4', (2,))), ('b', 'i1')])
+        # This comparison invokes deprecated behaviour, and will probably
+        # start raising an error eventually. What we really care about in this
+        # test is just that it doesn't return True.
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning, "elementwise == comparison failed")
+            assert_equal(x == y, False)
+
+        x = np.zeros((1,), dtype=[('a', ('f4', (2, 1))), ('b', 'i1')])
+        y = np.zeros((1,), dtype=[('a', ('f4', (2,))), ('b', 'i1')])
+        # This comparison invokes deprecated behaviour, and will probably
+        # start raising an error eventually. What we really care about in this
+        # test is just that it doesn't return True.
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning, "elementwise == comparison failed")
+            assert_equal(x == y, False)
+
+        # Check that structured arrays that are different only in
+        # byte-order work
+        a = np.array([(5, 42), (10, 1)], dtype=[('a', '>i8'), ('b', '<f8')])
+        b = np.array([(5, 43), (10, 1)], dtype=[('a', '<i8'), ('b', '>f8')])
+        assert_equal(a == b, [False, True])
+
+    def test_casting(self):
+        # Check that casting a structured array to change its byte order
+        # works
+        a = np.array([(1,)], dtype=[('a', '<i4')])
+        assert_(np.can_cast(a.dtype, [('a', '>i4')], casting='unsafe'))
+        b = a.astype([('a', '>i4')])
+        assert_equal(b, a.byteswap().newbyteorder())
+        assert_equal(a['a'][0], b['a'][0])
+
+        # Check that equality comparison works on structured arrays if
+        # they are 'equiv'-castable
+        a = np.array([(5, 42), (10, 1)], dtype=[('a', '>i4'), ('b', '<f8')])
+        b = np.array([(5, 42), (10, 1)], dtype=[('a', '<i4'), ('b', '>f8')])
+        assert_(np.can_cast(a.dtype, b.dtype, casting='equiv'))
+        assert_equal(a == b, [True, True])
+
+        # Check that 'equiv' casting can change byte order
+        assert_(np.can_cast(a.dtype, b.dtype, casting='equiv'))
+        c = a.astype(b.dtype, casting='equiv')
+        assert_equal(a == c, [True, True])
+
+        # Check that 'safe' casting can change byte order and up-cast
+        # fields
+        t = [('a', '<i8'), ('b', '>f8')]
+        assert_(np.can_cast(a.dtype, t, casting='safe'))
+        c = a.astype(t, casting='safe')
+        assert_equal((c == np.array([(5, 42), (10, 1)], dtype=t)),
+                     [True, True])
+
+        # Check that 'same_kind' casting can change byte order and
+        # change field widths within a "kind"
+        t = [('a', '<i4'), ('b', '>f4')]
+        assert_(np.can_cast(a.dtype, t, casting='same_kind'))
+        c = a.astype(t, casting='same_kind')
+        assert_equal((c == np.array([(5, 42), (10, 1)], dtype=t)),
+                     [True, True])
+
+        # Check that casting fails if the casting rule should fail on
+        # any of the fields
+        t = [('a', '>i8'), ('b', '<f4')]
+        assert_(not np.can_cast(a.dtype, t, casting='safe'))
+        assert_raises(TypeError, a.astype, t, casting='safe')
+        t = [('a', '>i2'), ('b', '<f8')]
+        assert_(not np.can_cast(a.dtype, t, casting='equiv'))
+        assert_raises(TypeError, a.astype, t, casting='equiv')
+        t = [('a', '>i8'), ('b', '<i2')]
+        assert_(not np.can_cast(a.dtype, t, casting='same_kind'))
+        assert_raises(TypeError, a.astype, t, casting='same_kind')
+        assert_(not np.can_cast(a.dtype, b.dtype, casting='no'))
+        assert_raises(TypeError, a.astype, b.dtype, casting='no')
+
+        # Check that non-'unsafe' casting can't change the set of field names
+        for casting in ['no', 'safe', 'equiv', 'same_kind']:
+            t = [('a', '>i4')]
+            assert_(not np.can_cast(a.dtype, t, casting=casting))
+            t = [('a', '>i4'), ('b', '<f8'), ('c', 'i4')]
+            assert_(not np.can_cast(a.dtype, t, casting=casting))
+
+    def test_objview(self):
+        # https://github.com/numpy/numpy/issues/3286
+        a = np.array([], dtype=[('a', 'f'), ('b', 'f'), ('c', 'O')])
+        a[['a', 'b']]  # TypeError?
+
+        # https://github.com/numpy/numpy/issues/3253
+        dat2 = np.zeros(3, [('A', 'i'), ('B', '|O')])
+        dat2[['B', 'A']]  # TypeError?
+
+    def test_setfield(self):
+        # https://github.com/numpy/numpy/issues/3126
+        struct_dt = np.dtype([('elem', 'i4', 5),])
+        dt = np.dtype([('field', 'i4', 10),('struct', struct_dt)])
+        x = np.zeros(1, dt)
+        x[0]['field'] = np.ones(10, dtype='i4')
+        x[0]['struct'] = np.ones(1, dtype=struct_dt)
+        assert_equal(x[0]['field'], np.ones(10, dtype='i4'))
+
+    def test_setfield_object(self):
+        # make sure object field assignment with ndarray value
+        # on void scalar mimics setitem behavior
+        b = np.zeros(1, dtype=[('x', 'O')])
+        # next line should work identically to b['x'][0] = np.arange(3)
+        b[0]['x'] = np.arange(3)
+        assert_equal(b[0]['x'], np.arange(3))
+
+        # check that broadcasting check still works
+        c = np.zeros(1, dtype=[('x', 'O', 5)])
+
+        def testassign():
+            c[0]['x'] = np.arange(3)
+
+        assert_raises(ValueError, testassign)
+
+    def test_zero_width_string(self):
+        # Test for PR #6430 / issues #473, #4955, #2585
+
+        dt = np.dtype([('I', int), ('S', 'S0')])
+
+        x = np.zeros(4, dtype=dt)
+
+        assert_equal(x['S'], [b'', b'', b'', b''])
+        assert_equal(x['S'].itemsize, 0)
+
+        x['S'] = ['a', 'b', 'c', 'd']
+        assert_equal(x['S'], [b'', b'', b'', b''])
+        assert_equal(x['I'], [0, 0, 0, 0])
+
+        # Variation on test case from #4955
+        x['S'][x['I'] == 0] = 'hello'
+        assert_equal(x['S'], [b'', b'', b'', b''])
+        assert_equal(x['I'], [0, 0, 0, 0])
+
+        # Variation on test case from #2585
+        x['S'] = 'A'
+        assert_equal(x['S'], [b'', b'', b'', b''])
+        assert_equal(x['I'], [0, 0, 0, 0])
+
+        # Allow zero-width dtypes in ndarray constructor
+        y = np.ndarray(4, dtype=x['S'].dtype)
+        assert_equal(y.itemsize, 0)
+        assert_equal(x['S'], y)
+
+        # More tests for indexing an array with zero-width fields
+        assert_equal(np.zeros(4, dtype=[('a', 'S0,S0'),
+                                        ('b', 'u1')])['a'].itemsize, 0)
+        assert_equal(np.empty(3, dtype='S0,S0').itemsize, 0)
+        assert_equal(np.zeros(4, dtype='S0,u1')['f0'].itemsize, 0)
+
+        xx = x['S'].reshape((2, 2))
+        assert_equal(xx.itemsize, 0)
+        assert_equal(xx, [[b'', b''], [b'', b'']])
+        # check for no uninitialized memory due to viewing S0 array
+        assert_equal(xx[:].dtype, xx.dtype)
+        assert_array_equal(eval(repr(xx), dict(array=np.array)), xx)
+
+        b = io.BytesIO()
+        np.save(b, xx)
+
+        b.seek(0)
+        yy = np.load(b)
+        assert_equal(yy.itemsize, 0)
+        assert_equal(xx, yy)
+
+        with temppath(suffix='.npy') as tmp:
+            np.save(tmp, xx)
+            yy = np.load(tmp)
+            assert_equal(yy.itemsize, 0)
+            assert_equal(xx, yy)
+
+    def test_base_attr(self):
+        a = np.zeros(3, dtype='i4,f4')
+        b = a[0]
+        assert_(b.base is a)
+
+    def test_assignment(self):
+        def testassign(arr, v):
+            c = arr.copy()
+            c[0] = v  # assign using setitem
+            c[1:] = v # assign using "dtype_transfer" code paths
+            return c
+
+        dt = np.dtype([('foo', 'i8'), ('bar', 'i8')])
+        arr = np.ones(2, dt)
+        v1 = np.array([(2,3)], dtype=[('foo', 'i8'), ('bar', 'i8')])
+        v2 = np.array([(2,3)], dtype=[('bar', 'i8'), ('foo', 'i8')])
+        v3 = np.array([(2,3)], dtype=[('bar', 'i8'), ('baz', 'i8')])
+        v4 = np.array([(2,)],  dtype=[('bar', 'i8')])
+        v5 = np.array([(2,3)], dtype=[('foo', 'f8'), ('bar', 'f8')])
+        w = arr.view({'names': ['bar'], 'formats': ['i8'], 'offsets': [8]})
+
+        ans = np.array([(2,3),(2,3)], dtype=dt)
+        assert_equal(testassign(arr, v1), ans)
+        assert_equal(testassign(arr, v2), ans)
+        assert_equal(testassign(arr, v3), ans)
+        assert_raises(ValueError, lambda: testassign(arr, v4))
+        assert_equal(testassign(arr, v5), ans)
+        w[:] = 4
+        assert_equal(arr, np.array([(1,4),(1,4)], dtype=dt))
+
+        # test field-reordering, assignment by position, and self-assignment
+        a = np.array([(1,2,3)],
+                     dtype=[('foo', 'i8'), ('bar', 'i8'), ('baz', 'f4')])
+        a[['foo', 'bar']] = a[['bar', 'foo']]
+        assert_equal(a[0].item(), (2,1,3))
+
+        # test that this works even for 'simple_unaligned' structs
+        # (ie, that PyArray_EquivTypes cares about field order too)
+        a = np.array([(1,2)], dtype=[('a', 'i4'), ('b', 'i4')])
+        a[['a', 'b']] = a[['b', 'a']]
+        assert_equal(a[0].item(), (2,1))
+    
+    def test_scalar_assignment(self):
+        with assert_raises(ValueError):
+            arr = np.arange(25).reshape(5, 5)                                                                               
+            arr.itemset(3)  
+
+    def test_structuredscalar_indexing(self):
+        # test gh-7262
+        x = np.empty(shape=1, dtype="(2)3S,(2)3U")
+        assert_equal(x[["f0","f1"]][0], x[0][["f0","f1"]])
+        assert_equal(x[0], x[0][()])
+
+    def test_multiindex_titles(self):
+        a = np.zeros(4, dtype=[(('a', 'b'), 'i'), ('c', 'i'), ('d', 'i')])
+        assert_raises(KeyError, lambda : a[['a','c']])
+        assert_raises(KeyError, lambda : a[['a','a']])
+        assert_raises(ValueError, lambda : a[['b','b']])  # field exists, but repeated
+        a[['b','c']]  # no exception
+
+
+class TestBool:
+    def test_test_interning(self):
+        a0 = np.bool_(0)
+        b0 = np.bool_(False)
+        assert_(a0 is b0)
+        a1 = np.bool_(1)
+        b1 = np.bool_(True)
+        assert_(a1 is b1)
+        assert_(np.array([True])[0] is a1)
+        assert_(np.array(True)[()] is a1)
+
+    def test_sum(self):
+        d = np.ones(101, dtype=bool)
+        assert_equal(d.sum(), d.size)
+        assert_equal(d[::2].sum(), d[::2].size)
+        assert_equal(d[::-2].sum(), d[::-2].size)
+
+        d = np.frombuffer(b'\xff\xff' * 100, dtype=bool)
+        assert_equal(d.sum(), d.size)
+        assert_equal(d[::2].sum(), d[::2].size)
+        assert_equal(d[::-2].sum(), d[::-2].size)
+
+    def check_count_nonzero(self, power, length):
+        powers = [2 ** i for i in range(length)]
+        for i in range(2**power):
+            l = [(i & x) != 0 for x in powers]
+            a = np.array(l, dtype=bool)
+            c = builtins.sum(l)
+            assert_equal(np.count_nonzero(a), c)
+            av = a.view(np.uint8)
+            av *= 3
+            assert_equal(np.count_nonzero(a), c)
+            av *= 4
+            assert_equal(np.count_nonzero(a), c)
+            av[av != 0] = 0xFF
+            assert_equal(np.count_nonzero(a), c)
+
+    def test_count_nonzero(self):
+        # check all 12 bit combinations in a length 17 array
+        # covers most cases of the 16 byte unrolled code
+        self.check_count_nonzero(12, 17)
+
+    @pytest.mark.slow
+    def test_count_nonzero_all(self):
+        # check all combinations in a length 17 array
+        # covers all cases of the 16 byte unrolled code
+        self.check_count_nonzero(17, 17)
+
+    def test_count_nonzero_unaligned(self):
+        # prevent mistakes as e.g. gh-4060
+        for o in range(7):
+            a = np.zeros((18,), dtype=bool)[o+1:]
+            a[:o] = True
+            assert_equal(np.count_nonzero(a), builtins.sum(a.tolist()))
+            a = np.ones((18,), dtype=bool)[o+1:]
+            a[:o] = False
+            assert_equal(np.count_nonzero(a), builtins.sum(a.tolist()))
+
+    def _test_cast_from_flexible(self, dtype):
+        # empty string -> false
+        for n in range(3):
+            v = np.array(b'', (dtype, n))
+            assert_equal(bool(v), False)
+            assert_equal(bool(v[()]), False)
+            assert_equal(v.astype(bool), False)
+            assert_(isinstance(v.astype(bool), np.ndarray))
+            assert_(v[()].astype(bool) is np.False_)
+
+        # anything else -> true
+        for n in range(1, 4):
+            for val in [b'a', b'0', b' ']:
+                v = np.array(val, (dtype, n))
+                assert_equal(bool(v), True)
+                assert_equal(bool(v[()]), True)
+                assert_equal(v.astype(bool), True)
+                assert_(isinstance(v.astype(bool), np.ndarray))
+                assert_(v[()].astype(bool) is np.True_)
+
+    def test_cast_from_void(self):
+        self._test_cast_from_flexible(np.void)
+
+    @pytest.mark.xfail(reason="See gh-9847")
+    def test_cast_from_unicode(self):
+        self._test_cast_from_flexible(np.unicode_)
+
+    @pytest.mark.xfail(reason="See gh-9847")
+    def test_cast_from_bytes(self):
+        self._test_cast_from_flexible(np.bytes_)
+
+
+class TestZeroSizeFlexible:
+    @staticmethod
+    def _zeros(shape, dtype=str):
+        dtype = np.dtype(dtype)
+        if dtype == np.void:
+            return np.zeros(shape, dtype=(dtype, 0))
+
+        # not constructable directly
+        dtype = np.dtype([('x', dtype, 0)])
+        return np.zeros(shape, dtype=dtype)['x']
+
+    def test_create(self):
+        zs = self._zeros(10, bytes)
+        assert_equal(zs.itemsize, 0)
+        zs = self._zeros(10, np.void)
+        assert_equal(zs.itemsize, 0)
+        zs = self._zeros(10, str)
+        assert_equal(zs.itemsize, 0)
+
+    def _test_sort_partition(self, name, kinds, **kwargs):
+        # Previously, these would all hang
+        for dt in [bytes, np.void, str]:
+            zs = self._zeros(10, dt)
+            sort_method = getattr(zs, name)
+            sort_func = getattr(np, name)
+            for kind in kinds:
+                sort_method(kind=kind, **kwargs)
+                sort_func(zs, kind=kind, **kwargs)
+
+    def test_sort(self):
+        self._test_sort_partition('sort', kinds='qhs')
+
+    def test_argsort(self):
+        self._test_sort_partition('argsort', kinds='qhs')
+
+    def test_partition(self):
+        self._test_sort_partition('partition', kinds=['introselect'], kth=2)
+
+    def test_argpartition(self):
+        self._test_sort_partition('argpartition', kinds=['introselect'], kth=2)
+
+    def test_resize(self):
+        # previously an error
+        for dt in [bytes, np.void, str]:
+            zs = self._zeros(10, dt)
+            zs.resize(25)
+            zs.resize((10, 10))
+
+    def test_view(self):
+        for dt in [bytes, np.void, str]:
+            zs = self._zeros(10, dt)
+
+            # viewing as itself should be allowed
+            assert_equal(zs.view(dt).dtype, np.dtype(dt))
+
+            # viewing as any non-empty type gives an empty result
+            assert_equal(zs.view((dt, 1)).shape, (0,))
+
+    def test_dumps(self):
+        zs = self._zeros(10, int)
+        assert_equal(zs, pickle.loads(zs.dumps()))
+
+    def test_pickle(self):
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            for dt in [bytes, np.void, str]:
+                zs = self._zeros(10, dt)
+                p = pickle.dumps(zs, protocol=proto)
+                zs2 = pickle.loads(p)
+
+                assert_equal(zs.dtype, zs2.dtype)
+
+    @pytest.mark.skipif(pickle.HIGHEST_PROTOCOL < 5,
+                        reason="requires pickle protocol 5")
+    def test_pickle_with_buffercallback(self):
+        array = np.arange(10)
+        buffers = []
+        bytes_string = pickle.dumps(array, buffer_callback=buffers.append,
+                                    protocol=5)
+        array_from_buffer = pickle.loads(bytes_string, buffers=buffers)
+        # when using pickle protocol 5 with buffer callbacks,
+        # array_from_buffer is reconstructed from a buffer holding a view
+        # to the initial array's data, so modifying an element in array
+        # should modify it in array_from_buffer too.
+        array[0] = -1
+        assert array_from_buffer[0] == -1, array_from_buffer[0]
+
+
+class TestMethods:
+
+    sort_kinds = ['quicksort', 'heapsort', 'stable']
+
+    def test_compress(self):
+        tgt = [[5, 6, 7, 8, 9]]
+        arr = np.arange(10).reshape(2, 5)
+        out = arr.compress([0, 1], axis=0)
+        assert_equal(out, tgt)
+
+        tgt = [[1, 3], [6, 8]]
+        out = arr.compress([0, 1, 0, 1, 0], axis=1)
+        assert_equal(out, tgt)
+
+        tgt = [[1], [6]]
+        arr = np.arange(10).reshape(2, 5)
+        out = arr.compress([0, 1], axis=1)
+        assert_equal(out, tgt)
+
+        arr = np.arange(10).reshape(2, 5)
+        out = arr.compress([0, 1])
+        assert_equal(out, 1)
+
+    def test_choose(self):
+        x = 2*np.ones((3,), dtype=int)
+        y = 3*np.ones((3,), dtype=int)
+        x2 = 2*np.ones((2, 3), dtype=int)
+        y2 = 3*np.ones((2, 3), dtype=int)
+        ind = np.array([0, 0, 1])
+
+        A = ind.choose((x, y))
+        assert_equal(A, [2, 2, 3])
+
+        A = ind.choose((x2, y2))
+        assert_equal(A, [[2, 2, 3], [2, 2, 3]])
+
+        A = ind.choose((x, y2))
+        assert_equal(A, [[2, 2, 3], [2, 2, 3]])
+
+        oned = np.ones(1)
+        # gh-12031, caused SEGFAULT
+        assert_raises(TypeError, oned.choose,np.void(0), [oned])
+
+        # gh-6272 check overlap on out
+        x = np.arange(5)
+        y = np.choose([0,0,0], [x[:3], x[:3], x[:3]], out=x[1:4], mode='wrap')
+        assert_equal(y, np.array([0, 1, 2]))
+
+    def test_prod(self):
+        ba = [1, 2, 10, 11, 6, 5, 4]
+        ba2 = [[1, 2, 3, 4], [5, 6, 7, 9], [10, 3, 4, 5]]
+
+        for ctype in [np.int16, np.uint16, np.int32, np.uint32,
+                      np.float32, np.float64, np.complex64, np.complex128]:
+            a = np.array(ba, ctype)
+            a2 = np.array(ba2, ctype)
+            if ctype in ['1', 'b']:
+                assert_raises(ArithmeticError, a.prod)
+                assert_raises(ArithmeticError, a2.prod, axis=1)
+            else:
+                assert_equal(a.prod(axis=0), 26400)
+                assert_array_equal(a2.prod(axis=0),
+                                   np.array([50, 36, 84, 180], ctype))
+                assert_array_equal(a2.prod(axis=-1),
+                                   np.array([24, 1890, 600], ctype))
+
+    def test_repeat(self):
+        m = np.array([1, 2, 3, 4, 5, 6])
+        m_rect = m.reshape((2, 3))
+
+        A = m.repeat([1, 3, 2, 1, 1, 2])
+        assert_equal(A, [1, 2, 2, 2, 3,
+                         3, 4, 5, 6, 6])
+
+        A = m.repeat(2)
+        assert_equal(A, [1, 1, 2, 2, 3, 3,
+                         4, 4, 5, 5, 6, 6])
+
+        A = m_rect.repeat([2, 1], axis=0)
+        assert_equal(A, [[1, 2, 3],
+                         [1, 2, 3],
+                         [4, 5, 6]])
+
+        A = m_rect.repeat([1, 3, 2], axis=1)
+        assert_equal(A, [[1, 2, 2, 2, 3, 3],
+                         [4, 5, 5, 5, 6, 6]])
+
+        A = m_rect.repeat(2, axis=0)
+        assert_equal(A, [[1, 2, 3],
+                         [1, 2, 3],
+                         [4, 5, 6],
+                         [4, 5, 6]])
+
+        A = m_rect.repeat(2, axis=1)
+        assert_equal(A, [[1, 1, 2, 2, 3, 3],
+                         [4, 4, 5, 5, 6, 6]])
+
+    def test_reshape(self):
+        arr = np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]])
+
+        tgt = [[1, 2, 3, 4, 5, 6], [7, 8, 9, 10, 11, 12]]
+        assert_equal(arr.reshape(2, 6), tgt)
+
+        tgt = [[1, 2, 3, 4], [5, 6, 7, 8], [9, 10, 11, 12]]
+        assert_equal(arr.reshape(3, 4), tgt)
+
+        tgt = [[1, 10, 8, 6], [4, 2, 11, 9], [7, 5, 3, 12]]
+        assert_equal(arr.reshape((3, 4), order='F'), tgt)
+
+        tgt = [[1, 4, 7, 10], [2, 5, 8, 11], [3, 6, 9, 12]]
+        assert_equal(arr.T.reshape((3, 4), order='C'), tgt)
+
+    def test_round(self):
+        def check_round(arr, expected, *round_args):
+            assert_equal(arr.round(*round_args), expected)
+            # With output array
+            out = np.zeros_like(arr)
+            res = arr.round(*round_args, out=out)
+            assert_equal(out, expected)
+            assert_equal(out, res)
+
+        check_round(np.array([1.2, 1.5]), [1, 2])
+        check_round(np.array(1.5), 2)
+        check_round(np.array([12.2, 15.5]), [10, 20], -1)
+        check_round(np.array([12.15, 15.51]), [12.2, 15.5], 1)
+        # Complex rounding
+        check_round(np.array([4.5 + 1.5j]), [4 + 2j])
+        check_round(np.array([12.5 + 15.5j]), [10 + 20j], -1)
+
+    def test_squeeze(self):
+        a = np.array([[[1], [2], [3]]])
+        assert_equal(a.squeeze(), [1, 2, 3])
+        assert_equal(a.squeeze(axis=(0,)), [[1], [2], [3]])
+        assert_raises(ValueError, a.squeeze, axis=(1,))
+        assert_equal(a.squeeze(axis=(2,)), [[1, 2, 3]])
+
+    def test_transpose(self):
+        a = np.array([[1, 2], [3, 4]])
+        assert_equal(a.transpose(), [[1, 3], [2, 4]])
+        assert_raises(ValueError, lambda: a.transpose(0))
+        assert_raises(ValueError, lambda: a.transpose(0, 0))
+        assert_raises(ValueError, lambda: a.transpose(0, 1, 2))
+
+    def test_sort(self):
+        # test ordering for floats and complex containing nans. It is only
+        # necessary to check the less-than comparison, so sorts that
+        # only follow the insertion sort path are sufficient. We only
+        # test doubles and complex doubles as the logic is the same.
+
+        # check doubles
+        msg = "Test real sort order with nans"
+        a = np.array([np.nan, 1, 0])
+        b = np.sort(a)
+        assert_equal(b, a[::-1], msg)
+        # check complex
+        msg = "Test complex sort order with nans"
+        a = np.zeros(9, dtype=np.complex128)
+        a.real += [np.nan, np.nan, np.nan, 1, 0, 1, 1, 0, 0]
+        a.imag += [np.nan, 1, 0, np.nan, np.nan, 1, 0, 1, 0]
+        b = np.sort(a)
+        assert_equal(b, a[::-1], msg)
+
+    # all c scalar sorts use the same code with different types
+    # so it suffices to run a quick check with one type. The number
+    # of sorted items must be greater than ~50 to check the actual
+    # algorithm because quick and merge sort fall over to insertion
+    # sort for small arrays.
+
+    @pytest.mark.parametrize('dtype', [np.uint8, np.uint16, np.uint32, np.uint64,
+                                       np.float16, np.float32, np.float64,
+                                       np.longdouble])
+    def test_sort_unsigned(self, dtype):
+        a = np.arange(101, dtype=dtype)
+        b = a[::-1].copy()
+        for kind in self.sort_kinds:
+            msg = "scalar sort, kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    @pytest.mark.parametrize('dtype',
+                             [np.int8, np.int16, np.int32, np.int64, np.float16,
+                              np.float32, np.float64, np.longdouble])
+    def test_sort_signed(self, dtype):
+        a = np.arange(-50, 51, dtype=dtype)
+        b = a[::-1].copy()
+        for kind in self.sort_kinds:
+            msg = "scalar sort, kind=%s" % (kind)
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    @pytest.mark.parametrize('dtype', [np.float32, np.float64, np.longdouble])
+    @pytest.mark.parametrize('part', ['real', 'imag'])
+    def test_sort_complex(self, part, dtype):
+        # test complex sorts. These use the same code as the scalars
+        # but the compare function differs.
+        cdtype = {
+            np.single: np.csingle,
+            np.double: np.cdouble,
+            np.longdouble: np.clongdouble,
+        }[dtype]
+        a = np.arange(-50, 51, dtype=dtype)
+        b = a[::-1].copy()
+        ai = (a * (1+1j)).astype(cdtype)
+        bi = (b * (1+1j)).astype(cdtype)
+        setattr(ai, part, 1)
+        setattr(bi, part, 1)
+        for kind in self.sort_kinds:
+            msg = "complex sort, %s part == 1, kind=%s" % (part, kind)
+            c = ai.copy()
+            c.sort(kind=kind)
+            assert_equal(c, ai, msg)
+            c = bi.copy()
+            c.sort(kind=kind)
+            assert_equal(c, ai, msg)
+
+    def test_sort_complex_byte_swapping(self):
+        # test sorting of complex arrays requiring byte-swapping, gh-5441
+        for endianness in '<>':
+            for dt in np.typecodes['Complex']:
+                arr = np.array([1+3.j, 2+2.j, 3+1.j], dtype=endianness + dt)
+                c = arr.copy()
+                c.sort()
+                msg = 'byte-swapped complex sort, dtype={0}'.format(dt)
+                assert_equal(c, arr, msg)
+
+    @pytest.mark.parametrize('dtype', [np.bytes_, np.unicode_])
+    def test_sort_string(self, dtype):
+        # np.array will perform the encoding to bytes for us in the bytes test
+        a = np.array(['aaaaaaaa' + chr(i) for i in range(101)], dtype=dtype)
+        b = a[::-1].copy()
+        for kind in self.sort_kinds:
+            msg = "kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    def test_sort_object(self):
+        # test object array sorts.
+        a = np.empty((101,), dtype=object)
+        a[:] = list(range(101))
+        b = a[::-1]
+        for kind in ['q', 'h', 'm']:
+            msg = "kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    def test_sort_structured(self):
+        # test record array sorts.
+        dt = np.dtype([('f', float), ('i', int)])
+        a = np.array([(i, i) for i in range(101)], dtype=dt)
+        b = a[::-1]
+        for kind in ['q', 'h', 'm']:
+            msg = "kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    @pytest.mark.parametrize('dtype', ['datetime64[D]', 'timedelta64[D]'])
+    def test_sort_time(self, dtype):
+        # test datetime64 and timedelta64 sorts.
+        a = np.arange(0, 101, dtype=dtype)
+        b = a[::-1]
+        for kind in ['q', 'h', 'm']:
+            msg = "kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+            c = b.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    def test_sort_axis(self):
+        # check axis handling. This should be the same for all type
+        # specific sorts, so we only check it for one type and one kind
+        a = np.array([[3, 2], [1, 0]])
+        b = np.array([[1, 0], [3, 2]])
+        c = np.array([[2, 3], [0, 1]])
+        d = a.copy()
+        d.sort(axis=0)
+        assert_equal(d, b, "test sort with axis=0")
+        d = a.copy()
+        d.sort(axis=1)
+        assert_equal(d, c, "test sort with axis=1")
+        d = a.copy()
+        d.sort()
+        assert_equal(d, c, "test sort with default axis")
+
+    def test_sort_size_0(self):
+        # check axis handling for multidimensional empty arrays
+        a = np.array([])
+        a.shape = (3, 2, 1, 0)
+        for axis in range(-a.ndim, a.ndim):
+            msg = 'test empty array sort with axis={0}'.format(axis)
+            assert_equal(np.sort(a, axis=axis), a, msg)
+        msg = 'test empty array sort with axis=None'
+        assert_equal(np.sort(a, axis=None), a.ravel(), msg)
+
+    def test_sort_bad_ordering(self):
+        # test generic class with bogus ordering,
+        # should not segfault.
+        class Boom:
+            def __lt__(self, other):
+                return True
+
+        a = np.array([Boom()] * 100, dtype=object)
+        for kind in self.sort_kinds:
+            msg = "kind=%s" % kind
+            c = a.copy()
+            c.sort(kind=kind)
+            assert_equal(c, a, msg)
+
+    def test_void_sort(self):
+        # gh-8210 - previously segfaulted
+        for i in range(4):
+            rand = np.random.randint(256, size=4000, dtype=np.uint8)
+            arr = rand.view('V4')
+            arr[::-1].sort()
+
+        dt = np.dtype([('val', 'i4', (1,))])
+        for i in range(4):
+            rand = np.random.randint(256, size=4000, dtype=np.uint8)
+            arr = rand.view(dt)
+            arr[::-1].sort()
+
+    def test_sort_raises(self):
+        #gh-9404
+        arr = np.array([0, datetime.now(), 1], dtype=object)
+        for kind in self.sort_kinds:
+            assert_raises(TypeError, arr.sort, kind=kind)
+        #gh-3879
+        class Raiser:
+            def raises_anything(*args, **kwargs):
+                raise TypeError("SOMETHING ERRORED")
+            __eq__ = __ne__ = __lt__ = __gt__ = __ge__ = __le__ = raises_anything
+        arr = np.array([[Raiser(), n] for n in range(10)]).reshape(-1)
+        np.random.shuffle(arr)
+        for kind in self.sort_kinds:
+            assert_raises(TypeError, arr.sort, kind=kind)
+
+    def test_sort_degraded(self):
+        # test degraded dataset would take minutes to run with normal qsort
+        d = np.arange(1000000)
+        do = d.copy()
+        x = d
+        # create a median of 3 killer where each median is the sorted second
+        # last element of the quicksort partition
+        while x.size > 3:
+            mid = x.size // 2
+            x[mid], x[-2] = x[-2], x[mid]
+            x = x[:-2]
+
+        assert_equal(np.sort(d), do)
+        assert_equal(d[np.argsort(d)], do)
+
+    def test_copy(self):
+        def assert_fortran(arr):
+            assert_(arr.flags.fortran)
+            assert_(arr.flags.f_contiguous)
+            assert_(not arr.flags.c_contiguous)
+
+        def assert_c(arr):
+            assert_(not arr.flags.fortran)
+            assert_(not arr.flags.f_contiguous)
+            assert_(arr.flags.c_contiguous)
+
+        a = np.empty((2, 2), order='F')
+        # Test copying a Fortran array
+        assert_c(a.copy())
+        assert_c(a.copy('C'))
+        assert_fortran(a.copy('F'))
+        assert_fortran(a.copy('A'))
+
+        # Now test starting with a C array.
+        a = np.empty((2, 2), order='C')
+        assert_c(a.copy())
+        assert_c(a.copy('C'))
+        assert_fortran(a.copy('F'))
+        assert_c(a.copy('A'))
+
+    def test_sort_order(self):
+        # Test sorting an array with fields
+        x1 = np.array([21, 32, 14])
+        x2 = np.array(['my', 'first', 'name'])
+        x3 = np.array([3.1, 4.5, 6.2])
+        r = np.rec.fromarrays([x1, x2, x3], names='id,word,number')
+
+        r.sort(order=['id'])
+        assert_equal(r.id, np.array([14, 21, 32]))
+        assert_equal(r.word, np.array(['name', 'my', 'first']))
+        assert_equal(r.number, np.array([6.2, 3.1, 4.5]))
+
+        r.sort(order=['word'])
+        assert_equal(r.id, np.array([32, 21, 14]))
+        assert_equal(r.word, np.array(['first', 'my', 'name']))
+        assert_equal(r.number, np.array([4.5, 3.1, 6.2]))
+
+        r.sort(order=['number'])
+        assert_equal(r.id, np.array([21, 32, 14]))
+        assert_equal(r.word, np.array(['my', 'first', 'name']))
+        assert_equal(r.number, np.array([3.1, 4.5, 6.2]))
+
+        assert_raises_regex(ValueError, 'duplicate',
+            lambda: r.sort(order=['id', 'id']))
+
+        if sys.byteorder == 'little':
+            strtype = '>i2'
+        else:
+            strtype = '<i2'
+        mydtype = [('name', strchar + '5'), ('col2', strtype)]
+        r = np.array([('a', 1), ('b', 255), ('c', 3), ('d', 258)],
+                     dtype=mydtype)
+        r.sort(order='col2')
+        assert_equal(r['col2'], [1, 3, 255, 258])
+        assert_equal(r, np.array([('a', 1), ('c', 3), ('b', 255), ('d', 258)],
+                                 dtype=mydtype))
+
+    def test_argsort(self):
+        # all c scalar argsorts use the same code with different types
+        # so it suffices to run a quick check with one type. The number
+        # of sorted items must be greater than ~50 to check the actual
+        # algorithm because quick and merge sort fall over to insertion
+        # sort for small arrays.
+
+        for dtype in [np.int32, np.uint32, np.float32]:
+            a = np.arange(101, dtype=dtype)
+            b = a[::-1].copy()
+            for kind in self.sort_kinds:
+                msg = "scalar argsort, kind=%s, dtype=%s" % (kind, dtype)
+                assert_equal(a.copy().argsort(kind=kind), a, msg)
+                assert_equal(b.copy().argsort(kind=kind), b, msg)
+
+        # test complex argsorts. These use the same code as the scalars
+        # but the compare function differs.
+        ai = a*1j + 1
+        bi = b*1j + 1
+        for kind in self.sort_kinds:
+            msg = "complex argsort, kind=%s" % kind
+            assert_equal(ai.copy().argsort(kind=kind), a, msg)
+            assert_equal(bi.copy().argsort(kind=kind), b, msg)
+        ai = a + 1j
+        bi = b + 1j
+        for kind in self.sort_kinds:
+            msg = "complex argsort, kind=%s" % kind
+            assert_equal(ai.copy().argsort(kind=kind), a, msg)
+            assert_equal(bi.copy().argsort(kind=kind), b, msg)
+
+        # test argsort of complex arrays requiring byte-swapping, gh-5441
+        for endianness in '<>':
+            for dt in np.typecodes['Complex']:
+                arr = np.array([1+3.j, 2+2.j, 3+1.j], dtype=endianness + dt)
+                msg = 'byte-swapped complex argsort, dtype={0}'.format(dt)
+                assert_equal(arr.argsort(),
+                             np.arange(len(arr), dtype=np.intp), msg)
+
+        # test string argsorts.
+        s = 'aaaaaaaa'
+        a = np.array([s + chr(i) for i in range(101)])
+        b = a[::-1].copy()
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in self.sort_kinds:
+            msg = "string argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # test unicode argsorts.
+        s = 'aaaaaaaa'
+        a = np.array([s + chr(i) for i in range(101)], dtype=np.unicode_)
+        b = a[::-1]
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in self.sort_kinds:
+            msg = "unicode argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # test object array argsorts.
+        a = np.empty((101,), dtype=object)
+        a[:] = list(range(101))
+        b = a[::-1]
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in self.sort_kinds:
+            msg = "object argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # test structured array argsorts.
+        dt = np.dtype([('f', float), ('i', int)])
+        a = np.array([(i, i) for i in range(101)], dtype=dt)
+        b = a[::-1]
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in self.sort_kinds:
+            msg = "structured array argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # test datetime64 argsorts.
+        a = np.arange(0, 101, dtype='datetime64[D]')
+        b = a[::-1]
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in ['q', 'h', 'm']:
+            msg = "datetime64 argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # test timedelta64 argsorts.
+        a = np.arange(0, 101, dtype='timedelta64[D]')
+        b = a[::-1]
+        r = np.arange(101)
+        rr = r[::-1]
+        for kind in ['q', 'h', 'm']:
+            msg = "timedelta64 argsort, kind=%s" % kind
+            assert_equal(a.copy().argsort(kind=kind), r, msg)
+            assert_equal(b.copy().argsort(kind=kind), rr, msg)
+
+        # check axis handling. This should be the same for all type
+        # specific argsorts, so we only check it for one type and one kind
+        a = np.array([[3, 2], [1, 0]])
+        b = np.array([[1, 1], [0, 0]])
+        c = np.array([[1, 0], [1, 0]])
+        assert_equal(a.copy().argsort(axis=0), b)
+        assert_equal(a.copy().argsort(axis=1), c)
+        assert_equal(a.copy().argsort(), c)
+
+        # check axis handling for multidimensional empty arrays
+        a = np.array([])
+        a.shape = (3, 2, 1, 0)
+        for axis in range(-a.ndim, a.ndim):
+            msg = 'test empty array argsort with axis={0}'.format(axis)
+            assert_equal(np.argsort(a, axis=axis),
+                         np.zeros_like(a, dtype=np.intp), msg)
+        msg = 'test empty array argsort with axis=None'
+        assert_equal(np.argsort(a, axis=None),
+                     np.zeros_like(a.ravel(), dtype=np.intp), msg)
+
+        # check that stable argsorts are stable
+        r = np.arange(100)
+        # scalars
+        a = np.zeros(100)
+        assert_equal(a.argsort(kind='m'), r)
+        # complex
+        a = np.zeros(100, dtype=complex)
+        assert_equal(a.argsort(kind='m'), r)
+        # string
+        a = np.array(['aaaaaaaaa' for i in range(100)])
+        assert_equal(a.argsort(kind='m'), r)
+        # unicode
+        a = np.array(['aaaaaaaaa' for i in range(100)], dtype=np.unicode_)
+        assert_equal(a.argsort(kind='m'), r)
+
+    def test_sort_unicode_kind(self):
+        d = np.arange(10)
+        k = b'\xc3\xa4'.decode("UTF8")
+        assert_raises(ValueError, d.sort, kind=k)
+        assert_raises(ValueError, d.argsort, kind=k)
+
+    def test_searchsorted(self):
+        # test for floats and complex containing nans. The logic is the
+        # same for all float types so only test double types for now.
+        # The search sorted routines use the compare functions for the
+        # array type, so this checks if that is consistent with the sort
+        # order.
+
+        # check double
+        a = np.array([0, 1, np.nan])
+        msg = "Test real searchsorted with nans, side='l'"
+        b = a.searchsorted(a, side='l')
+        assert_equal(b, np.arange(3), msg)
+        msg = "Test real searchsorted with nans, side='r'"
+        b = a.searchsorted(a, side='r')
+        assert_equal(b, np.arange(1, 4), msg)
+        # check keyword arguments
+        a.searchsorted(v=1)
+        # check double complex
+        a = np.zeros(9, dtype=np.complex128)
+        a.real += [0, 0, 1, 1, 0, 1, np.nan, np.nan, np.nan]
+        a.imag += [0, 1, 0, 1, np.nan, np.nan, 0, 1, np.nan]
+        msg = "Test complex searchsorted with nans, side='l'"
+        b = a.searchsorted(a, side='l')
+        assert_equal(b, np.arange(9), msg)
+        msg = "Test complex searchsorted with nans, side='r'"
+        b = a.searchsorted(a, side='r')
+        assert_equal(b, np.arange(1, 10), msg)
+        msg = "Test searchsorted with little endian, side='l'"
+        a = np.array([0, 128], dtype='<i4')
+        b = a.searchsorted(np.array(128, dtype='<i4'))
+        assert_equal(b, 1, msg)
+        msg = "Test searchsorted with big endian, side='l'"
+        a = np.array([0, 128], dtype='>i4')
+        b = a.searchsorted(np.array(128, dtype='>i4'))
+        assert_equal(b, 1, msg)
+
+        # Check 0 elements
+        a = np.ones(0)
+        b = a.searchsorted([0, 1, 2], 'l')
+        assert_equal(b, [0, 0, 0])
+        b = a.searchsorted([0, 1, 2], 'r')
+        assert_equal(b, [0, 0, 0])
+        a = np.ones(1)
+        # Check 1 element
+        b = a.searchsorted([0, 1, 2], 'l')
+        assert_equal(b, [0, 0, 1])
+        b = a.searchsorted([0, 1, 2], 'r')
+        assert_equal(b, [0, 1, 1])
+        # Check all elements equal
+        a = np.ones(2)
+        b = a.searchsorted([0, 1, 2], 'l')
+        assert_equal(b, [0, 0, 2])
+        b = a.searchsorted([0, 1, 2], 'r')
+        assert_equal(b, [0, 2, 2])
+
+        # Test searching unaligned array
+        a = np.arange(10)
+        aligned = np.empty(a.itemsize * a.size + 1, 'uint8')
+        unaligned = aligned[1:].view(a.dtype)
+        unaligned[:] = a
+        # Test searching unaligned array
+        b = unaligned.searchsorted(a, 'l')
+        assert_equal(b, a)
+        b = unaligned.searchsorted(a, 'r')
+        assert_equal(b, a + 1)
+        # Test searching for unaligned keys
+        b = a.searchsorted(unaligned, 'l')
+        assert_equal(b, a)
+        b = a.searchsorted(unaligned, 'r')
+        assert_equal(b, a + 1)
+
+        # Test smart resetting of binsearch indices
+        a = np.arange(5)
+        b = a.searchsorted([6, 5, 4], 'l')
+        assert_equal(b, [5, 5, 4])
+        b = a.searchsorted([6, 5, 4], 'r')
+        assert_equal(b, [5, 5, 5])
+
+        # Test all type specific binary search functions
+        types = ''.join((np.typecodes['AllInteger'], np.typecodes['AllFloat'],
+                         np.typecodes['Datetime'], '?O'))
+        for dt in types:
+            if dt == 'M':
+                dt = 'M8[D]'
+            if dt == '?':
+                a = np.arange(2, dtype=dt)
+                out = np.arange(2)
+            else:
+                a = np.arange(0, 5, dtype=dt)
+                out = np.arange(5)
+            b = a.searchsorted(a, 'l')
+            assert_equal(b, out)
+            b = a.searchsorted(a, 'r')
+            assert_equal(b, out + 1)
+            # Test empty array, use a fresh array to get warnings in
+            # valgrind if access happens.
+            e = np.ndarray(shape=0, buffer=b'', dtype=dt)
+            b = e.searchsorted(a, 'l')
+            assert_array_equal(b, np.zeros(len(a), dtype=np.intp))
+            b = a.searchsorted(e, 'l')
+            assert_array_equal(b, np.zeros(0, dtype=np.intp))
+
+    def test_searchsorted_unicode(self):
+        # Test searchsorted on unicode strings.
+
+        # 1.6.1 contained a string length miscalculation in
+        # arraytypes.c.src:UNICODE_compare() which manifested as
+        # incorrect/inconsistent results from searchsorted.
+        a = np.array(['P:\\20x_dapi_cy3\\20x_dapi_cy3_20100185_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100186_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100187_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100189_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100190_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100191_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100192_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100193_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100194_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100195_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100196_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100197_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100198_1',
+                      'P:\\20x_dapi_cy3\\20x_dapi_cy3_20100199_1'],
+                     dtype=np.unicode_)
+        ind = np.arange(len(a))
+        assert_equal([a.searchsorted(v, 'left') for v in a], ind)
+        assert_equal([a.searchsorted(v, 'right') for v in a], ind + 1)
+        assert_equal([a.searchsorted(a[i], 'left') for i in ind], ind)
+        assert_equal([a.searchsorted(a[i], 'right') for i in ind], ind + 1)
+
+    def test_searchsorted_with_invalid_sorter(self):
+        a = np.array([5, 2, 1, 3, 4])
+        s = np.argsort(a)
+        assert_raises(TypeError, np.searchsorted, a, 0,
+                      sorter=np.array((1, (2, 3)), dtype=object))
+        assert_raises(TypeError, np.searchsorted, a, 0, sorter=[1.1])
+        assert_raises(ValueError, np.searchsorted, a, 0, sorter=[1, 2, 3, 4])
+        assert_raises(ValueError, np.searchsorted, a, 0, sorter=[1, 2, 3, 4, 5, 6])
+
+        # bounds check
+        assert_raises(ValueError, np.searchsorted, a, 4, sorter=[0, 1, 2, 3, 5])
+        assert_raises(ValueError, np.searchsorted, a, 0, sorter=[-1, 0, 1, 2, 3])
+        assert_raises(ValueError, np.searchsorted, a, 0, sorter=[4, 0, -1, 2, 3])
+
+    def test_searchsorted_with_sorter(self):
+        a = np.random.rand(300)
+        s = a.argsort()
+        b = np.sort(a)
+        k = np.linspace(0, 1, 20)
+        assert_equal(b.searchsorted(k), a.searchsorted(k, sorter=s))
+
+        a = np.array([0, 1, 2, 3, 5]*20)
+        s = a.argsort()
+        k = [0, 1, 2, 3, 5]
+        expected = [0, 20, 40, 60, 80]
+        assert_equal(a.searchsorted(k, side='l', sorter=s), expected)
+        expected = [20, 40, 60, 80, 100]
+        assert_equal(a.searchsorted(k, side='r', sorter=s), expected)
+
+        # Test searching unaligned array
+        keys = np.arange(10)
+        a = keys.copy()
+        np.random.shuffle(s)
+        s = a.argsort()
+        aligned = np.empty(a.itemsize * a.size + 1, 'uint8')
+        unaligned = aligned[1:].view(a.dtype)
+        # Test searching unaligned array
+        unaligned[:] = a
+        b = unaligned.searchsorted(keys, 'l', s)
+        assert_equal(b, keys)
+        b = unaligned.searchsorted(keys, 'r', s)
+        assert_equal(b, keys + 1)
+        # Test searching for unaligned keys
+        unaligned[:] = keys
+        b = a.searchsorted(unaligned, 'l', s)
+        assert_equal(b, keys)
+        b = a.searchsorted(unaligned, 'r', s)
+        assert_equal(b, keys + 1)
+
+        # Test all type specific indirect binary search functions
+        types = ''.join((np.typecodes['AllInteger'], np.typecodes['AllFloat'],
+                         np.typecodes['Datetime'], '?O'))
+        for dt in types:
+            if dt == 'M':
+                dt = 'M8[D]'
+            if dt == '?':
+                a = np.array([1, 0], dtype=dt)
+                # We want the sorter array to be of a type that is different
+                # from np.intp in all platforms, to check for #4698
+                s = np.array([1, 0], dtype=np.int16)
+                out = np.array([1, 0])
+            else:
+                a = np.array([3, 4, 1, 2, 0], dtype=dt)
+                # We want the sorter array to be of a type that is different
+                # from np.intp in all platforms, to check for #4698
+                s = np.array([4, 2, 3, 0, 1], dtype=np.int16)
+                out = np.array([3, 4, 1, 2, 0], dtype=np.intp)
+            b = a.searchsorted(a, 'l', s)
+            assert_equal(b, out)
+            b = a.searchsorted(a, 'r', s)
+            assert_equal(b, out + 1)
+            # Test empty array, use a fresh array to get warnings in
+            # valgrind if access happens.
+            e = np.ndarray(shape=0, buffer=b'', dtype=dt)
+            b = e.searchsorted(a, 'l', s[:0])
+            assert_array_equal(b, np.zeros(len(a), dtype=np.intp))
+            b = a.searchsorted(e, 'l', s)
+            assert_array_equal(b, np.zeros(0, dtype=np.intp))
+
+        # Test non-contiguous sorter array
+        a = np.array([3, 4, 1, 2, 0])
+        srt = np.empty((10,), dtype=np.intp)
+        srt[1::2] = -1
+        srt[::2] = [4, 2, 3, 0, 1]
+        s = srt[::2]
+        out = np.array([3, 4, 1, 2, 0], dtype=np.intp)
+        b = a.searchsorted(a, 'l', s)
+        assert_equal(b, out)
+        b = a.searchsorted(a, 'r', s)
+        assert_equal(b, out + 1)
+
+    def test_searchsorted_return_type(self):
+        # Functions returning indices should always return base ndarrays
+        class A(np.ndarray):
+            pass
+        a = np.arange(5).view(A)
+        b = np.arange(1, 3).view(A)
+        s = np.arange(5).view(A)
+        assert_(not isinstance(a.searchsorted(b, 'l'), A))
+        assert_(not isinstance(a.searchsorted(b, 'r'), A))
+        assert_(not isinstance(a.searchsorted(b, 'l', s), A))
+        assert_(not isinstance(a.searchsorted(b, 'r', s), A))
+
+    def test_argpartition_out_of_range(self):
+        # Test out of range values in kth raise an error, gh-5469
+        d = np.arange(10)
+        assert_raises(ValueError, d.argpartition, 10)
+        assert_raises(ValueError, d.argpartition, -11)
+        # Test also for generic type argpartition, which uses sorting
+        # and used to not bound check kth
+        d_obj = np.arange(10, dtype=object)
+        assert_raises(ValueError, d_obj.argpartition, 10)
+        assert_raises(ValueError, d_obj.argpartition, -11)
+
+    def test_partition_out_of_range(self):
+        # Test out of range values in kth raise an error, gh-5469
+        d = np.arange(10)
+        assert_raises(ValueError, d.partition, 10)
+        assert_raises(ValueError, d.partition, -11)
+        # Test also for generic type partition, which uses sorting
+        # and used to not bound check kth
+        d_obj = np.arange(10, dtype=object)
+        assert_raises(ValueError, d_obj.partition, 10)
+        assert_raises(ValueError, d_obj.partition, -11)
+
+    def test_argpartition_integer(self):
+        # Test non-integer values in kth raise an error/
+        d = np.arange(10)
+        assert_raises(TypeError, d.argpartition, 9.)
+        # Test also for generic type argpartition, which uses sorting
+        # and used to not bound check kth
+        d_obj = np.arange(10, dtype=object)
+        assert_raises(TypeError, d_obj.argpartition, 9.)
+
+    def test_partition_integer(self):
+        # Test out of range values in kth raise an error, gh-5469
+        d = np.arange(10)
+        assert_raises(TypeError, d.partition, 9.)
+        # Test also for generic type partition, which uses sorting
+        # and used to not bound check kth
+        d_obj = np.arange(10, dtype=object)
+        assert_raises(TypeError, d_obj.partition, 9.)
+
+    def test_partition_empty_array(self):
+        # check axis handling for multidimensional empty arrays
+        a = np.array([])
+        a.shape = (3, 2, 1, 0)
+        for axis in range(-a.ndim, a.ndim):
+            msg = 'test empty array partition with axis={0}'.format(axis)
+            assert_equal(np.partition(a, 0, axis=axis), a, msg)
+        msg = 'test empty array partition with axis=None'
+        assert_equal(np.partition(a, 0, axis=None), a.ravel(), msg)
+
+    def test_argpartition_empty_array(self):
+        # check axis handling for multidimensional empty arrays
+        a = np.array([])
+        a.shape = (3, 2, 1, 0)
+        for axis in range(-a.ndim, a.ndim):
+            msg = 'test empty array argpartition with axis={0}'.format(axis)
+            assert_equal(np.partition(a, 0, axis=axis),
+                         np.zeros_like(a, dtype=np.intp), msg)
+        msg = 'test empty array argpartition with axis=None'
+        assert_equal(np.partition(a, 0, axis=None),
+                     np.zeros_like(a.ravel(), dtype=np.intp), msg)
+
+    def test_partition(self):
+        d = np.arange(10)
+        assert_raises(TypeError, np.partition, d, 2, kind=1)
+        assert_raises(ValueError, np.partition, d, 2, kind="nonsense")
+        assert_raises(ValueError, np.argpartition, d, 2, kind="nonsense")
+        assert_raises(ValueError, d.partition, 2, axis=0, kind="nonsense")
+        assert_raises(ValueError, d.argpartition, 2, axis=0, kind="nonsense")
+        for k in ("introselect",):
+            d = np.array([])
+            assert_array_equal(np.partition(d, 0, kind=k), d)
+            assert_array_equal(np.argpartition(d, 0, kind=k), d)
+            d = np.ones(1)
+            assert_array_equal(np.partition(d, 0, kind=k)[0], d)
+            assert_array_equal(d[np.argpartition(d, 0, kind=k)],
+                               np.partition(d, 0, kind=k))
+
+            # kth not modified
+            kth = np.array([30, 15, 5])
+            okth = kth.copy()
+            np.partition(np.arange(40), kth)
+            assert_array_equal(kth, okth)
+
+            for r in ([2, 1], [1, 2], [1, 1]):
+                d = np.array(r)
+                tgt = np.sort(d)
+                assert_array_equal(np.partition(d, 0, kind=k)[0], tgt[0])
+                assert_array_equal(np.partition(d, 1, kind=k)[1], tgt[1])
+                assert_array_equal(d[np.argpartition(d, 0, kind=k)],
+                                   np.partition(d, 0, kind=k))
+                assert_array_equal(d[np.argpartition(d, 1, kind=k)],
+                                   np.partition(d, 1, kind=k))
+                for i in range(d.size):
+                    d[i:].partition(0, kind=k)
+                assert_array_equal(d, tgt)
+
+            for r in ([3, 2, 1], [1, 2, 3], [2, 1, 3], [2, 3, 1],
+                      [1, 1, 1], [1, 2, 2], [2, 2, 1], [1, 2, 1]):
+                d = np.array(r)
+                tgt = np.sort(d)
+                assert_array_equal(np.partition(d, 0, kind=k)[0], tgt[0])
+                assert_array_equal(np.partition(d, 1, kind=k)[1], tgt[1])
+                assert_array_equal(np.partition(d, 2, kind=k)[2], tgt[2])
+                assert_array_equal(d[np.argpartition(d, 0, kind=k)],
+                                   np.partition(d, 0, kind=k))
+                assert_array_equal(d[np.argpartition(d, 1, kind=k)],
+                                   np.partition(d, 1, kind=k))
+                assert_array_equal(d[np.argpartition(d, 2, kind=k)],
+                                   np.partition(d, 2, kind=k))
+                for i in range(d.size):
+                    d[i:].partition(0, kind=k)
+                assert_array_equal(d, tgt)
+
+            d = np.ones(50)
+            assert_array_equal(np.partition(d, 0, kind=k), d)
+            assert_array_equal(d[np.argpartition(d, 0, kind=k)],
+                               np.partition(d, 0, kind=k))
+
+            # sorted
+            d = np.arange(49)
+            assert_equal(np.partition(d, 5, kind=k)[5], 5)
+            assert_equal(np.partition(d, 15, kind=k)[15], 15)
+            assert_array_equal(d[np.argpartition(d, 5, kind=k)],
+                               np.partition(d, 5, kind=k))
+            assert_array_equal(d[np.argpartition(d, 15, kind=k)],
+                               np.partition(d, 15, kind=k))
+
+            # rsorted
+            d = np.arange(47)[::-1]
+            assert_equal(np.partition(d, 6, kind=k)[6], 6)
+            assert_equal(np.partition(d, 16, kind=k)[16], 16)
+            assert_array_equal(d[np.argpartition(d, 6, kind=k)],
+                               np.partition(d, 6, kind=k))
+            assert_array_equal(d[np.argpartition(d, 16, kind=k)],
+                               np.partition(d, 16, kind=k))
+
+            assert_array_equal(np.partition(d, -6, kind=k),
+                               np.partition(d, 41, kind=k))
+            assert_array_equal(np.partition(d, -16, kind=k),
+                               np.partition(d, 31, kind=k))
+            assert_array_equal(d[np.argpartition(d, -6, kind=k)],
+                               np.partition(d, 41, kind=k))
+
+            # median of 3 killer, O(n^2) on pure median 3 pivot quickselect
+            # exercises the median of median of 5 code used to keep O(n)
+            d = np.arange(1000000)
+            x = np.roll(d, d.size // 2)
+            mid = x.size // 2 + 1
+            assert_equal(np.partition(x, mid)[mid], mid)
+            d = np.arange(1000001)
+            x = np.roll(d, d.size // 2 + 1)
+            mid = x.size // 2 + 1
+            assert_equal(np.partition(x, mid)[mid], mid)
+
+            # max
+            d = np.ones(10)
+            d[1] = 4
+            assert_equal(np.partition(d, (2, -1))[-1], 4)
+            assert_equal(np.partition(d, (2, -1))[2], 1)
+            assert_equal(d[np.argpartition(d, (2, -1))][-1], 4)
+            assert_equal(d[np.argpartition(d, (2, -1))][2], 1)
+            d[1] = np.nan
+            assert_(np.isnan(d[np.argpartition(d, (2, -1))][-1]))
+            assert_(np.isnan(np.partition(d, (2, -1))[-1]))
+
+            # equal elements
+            d = np.arange(47) % 7
+            tgt = np.sort(np.arange(47) % 7)
+            np.random.shuffle(d)
+            for i in range(d.size):
+                assert_equal(np.partition(d, i, kind=k)[i], tgt[i])
+            assert_array_equal(d[np.argpartition(d, 6, kind=k)],
+                               np.partition(d, 6, kind=k))
+            assert_array_equal(d[np.argpartition(d, 16, kind=k)],
+                               np.partition(d, 16, kind=k))
+            for i in range(d.size):
+                d[i:].partition(0, kind=k)
+            assert_array_equal(d, tgt)
+
+            d = np.array([0, 1, 2, 3, 4, 5, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7,
+                          7, 7, 7, 7, 7, 9])
+            kth = [0, 3, 19, 20]
+            assert_equal(np.partition(d, kth, kind=k)[kth], (0, 3, 7, 7))
+            assert_equal(d[np.argpartition(d, kth, kind=k)][kth], (0, 3, 7, 7))
+
+            d = np.array([2, 1])
+            d.partition(0, kind=k)
+            assert_raises(ValueError, d.partition, 2)
+            assert_raises(np.AxisError, d.partition, 3, axis=1)
+            assert_raises(ValueError, np.partition, d, 2)
+            assert_raises(np.AxisError, np.partition, d, 2, axis=1)
+            assert_raises(ValueError, d.argpartition, 2)
+            assert_raises(np.AxisError, d.argpartition, 3, axis=1)
+            assert_raises(ValueError, np.argpartition, d, 2)
+            assert_raises(np.AxisError, np.argpartition, d, 2, axis=1)
+            d = np.arange(10).reshape((2, 5))
+            d.partition(1, axis=0, kind=k)
+            d.partition(4, axis=1, kind=k)
+            np.partition(d, 1, axis=0, kind=k)
+            np.partition(d, 4, axis=1, kind=k)
+            np.partition(d, 1, axis=None, kind=k)
+            np.partition(d, 9, axis=None, kind=k)
+            d.argpartition(1, axis=0, kind=k)
+            d.argpartition(4, axis=1, kind=k)
+            np.argpartition(d, 1, axis=0, kind=k)
+            np.argpartition(d, 4, axis=1, kind=k)
+            np.argpartition(d, 1, axis=None, kind=k)
+            np.argpartition(d, 9, axis=None, kind=k)
+            assert_raises(ValueError, d.partition, 2, axis=0)
+            assert_raises(ValueError, d.partition, 11, axis=1)
+            assert_raises(TypeError, d.partition, 2, axis=None)
+            assert_raises(ValueError, np.partition, d, 9, axis=1)
+            assert_raises(ValueError, np.partition, d, 11, axis=None)
+            assert_raises(ValueError, d.argpartition, 2, axis=0)
+            assert_raises(ValueError, d.argpartition, 11, axis=1)
+            assert_raises(ValueError, np.argpartition, d, 9, axis=1)
+            assert_raises(ValueError, np.argpartition, d, 11, axis=None)
+
+            td = [(dt, s) for dt in [np.int32, np.float32, np.complex64]
+                  for s in (9, 16)]
+            for dt, s in td:
+                aae = assert_array_equal
+                at = assert_
+
+                d = np.arange(s, dtype=dt)
+                np.random.shuffle(d)
+                d1 = np.tile(np.arange(s, dtype=dt), (4, 1))
+                map(np.random.shuffle, d1)
+                d0 = np.transpose(d1)
+                for i in range(d.size):
+                    p = np.partition(d, i, kind=k)
+                    assert_equal(p[i], i)
+                    # all before are smaller
+                    assert_array_less(p[:i], p[i])
+                    # all after are larger
+                    assert_array_less(p[i], p[i + 1:])
+                    aae(p, d[np.argpartition(d, i, kind=k)])
+
+                    p = np.partition(d1, i, axis=1, kind=k)
+                    aae(p[:, i], np.array([i] * d1.shape[0], dtype=dt))
+                    # array_less does not seem to work right
+                    at((p[:, :i].T <= p[:, i]).all(),
+                       msg="%d: %r <= %r" % (i, p[:, i], p[:, :i].T))
+                    at((p[:, i + 1:].T > p[:, i]).all(),
+                       msg="%d: %r < %r" % (i, p[:, i], p[:, i + 1:].T))
+                    aae(p, d1[np.arange(d1.shape[0])[:, None],
+                        np.argpartition(d1, i, axis=1, kind=k)])
+
+                    p = np.partition(d0, i, axis=0, kind=k)
+                    aae(p[i, :], np.array([i] * d1.shape[0], dtype=dt))
+                    # array_less does not seem to work right
+                    at((p[:i, :] <= p[i, :]).all(),
+                       msg="%d: %r <= %r" % (i, p[i, :], p[:i, :]))
+                    at((p[i + 1:, :] > p[i, :]).all(),
+                       msg="%d: %r < %r" % (i, p[i, :], p[:, i + 1:]))
+                    aae(p, d0[np.argpartition(d0, i, axis=0, kind=k),
+                        np.arange(d0.shape[1])[None, :]])
+
+                    # check inplace
+                    dc = d.copy()
+                    dc.partition(i, kind=k)
+                    assert_equal(dc, np.partition(d, i, kind=k))
+                    dc = d0.copy()
+                    dc.partition(i, axis=0, kind=k)
+                    assert_equal(dc, np.partition(d0, i, axis=0, kind=k))
+                    dc = d1.copy()
+                    dc.partition(i, axis=1, kind=k)
+                    assert_equal(dc, np.partition(d1, i, axis=1, kind=k))
+
+    def assert_partitioned(self, d, kth):
+        prev = 0
+        for k in np.sort(kth):
+            assert_array_less(d[prev:k], d[k], err_msg='kth %d' % k)
+            assert_((d[k:] >= d[k]).all(),
+                    msg="kth %d, %r not greater equal %d" % (k, d[k:], d[k]))
+            prev = k + 1
+
+    def test_partition_iterative(self):
+            d = np.arange(17)
+            kth = (0, 1, 2, 429, 231)
+            assert_raises(ValueError, d.partition, kth)
+            assert_raises(ValueError, d.argpartition, kth)
+            d = np.arange(10).reshape((2, 5))
+            assert_raises(ValueError, d.partition, kth, axis=0)
+            assert_raises(ValueError, d.partition, kth, axis=1)
+            assert_raises(ValueError, np.partition, d, kth, axis=1)
+            assert_raises(ValueError, np.partition, d, kth, axis=None)
+
+            d = np.array([3, 4, 2, 1])
+            p = np.partition(d, (0, 3))
+            self.assert_partitioned(p, (0, 3))
+            self.assert_partitioned(d[np.argpartition(d, (0, 3))], (0, 3))
+
+            assert_array_equal(p, np.partition(d, (-3, -1)))
+            assert_array_equal(p, d[np.argpartition(d, (-3, -1))])
+
+            d = np.arange(17)
+            np.random.shuffle(d)
+            d.partition(range(d.size))
+            assert_array_equal(np.arange(17), d)
+            np.random.shuffle(d)
+            assert_array_equal(np.arange(17), d[d.argpartition(range(d.size))])
+
+            # test unsorted kth
+            d = np.arange(17)
+            np.random.shuffle(d)
+            keys = np.array([1, 3, 8, -2])
+            np.random.shuffle(d)
+            p = np.partition(d, keys)
+            self.assert_partitioned(p, keys)
+            p = d[np.argpartition(d, keys)]
+            self.assert_partitioned(p, keys)
+            np.random.shuffle(keys)
+            assert_array_equal(np.partition(d, keys), p)
+            assert_array_equal(d[np.argpartition(d, keys)], p)
+
+            # equal kth
+            d = np.arange(20)[::-1]
+            self.assert_partitioned(np.partition(d, [5]*4), [5])
+            self.assert_partitioned(np.partition(d, [5]*4 + [6, 13]),
+                                    [5]*4 + [6, 13])
+            self.assert_partitioned(d[np.argpartition(d, [5]*4)], [5])
+            self.assert_partitioned(d[np.argpartition(d, [5]*4 + [6, 13])],
+                                    [5]*4 + [6, 13])
+
+            d = np.arange(12)
+            np.random.shuffle(d)
+            d1 = np.tile(np.arange(12), (4, 1))
+            map(np.random.shuffle, d1)
+            d0 = np.transpose(d1)
+
+            kth = (1, 6, 7, -1)
+            p = np.partition(d1, kth, axis=1)
+            pa = d1[np.arange(d1.shape[0])[:, None],
+                    d1.argpartition(kth, axis=1)]
+            assert_array_equal(p, pa)
+            for i in range(d1.shape[0]):
+                self.assert_partitioned(p[i,:], kth)
+            p = np.partition(d0, kth, axis=0)
+            pa = d0[np.argpartition(d0, kth, axis=0),
+                    np.arange(d0.shape[1])[None,:]]
+            assert_array_equal(p, pa)
+            for i in range(d0.shape[1]):
+                self.assert_partitioned(p[:, i], kth)
+
+    def test_partition_cdtype(self):
+        d = np.array([('Galahad', 1.7, 38), ('Arthur', 1.8, 41),
+                   ('Lancelot', 1.9, 38)],
+                  dtype=[('name', '|S10'), ('height', '<f8'), ('age', '<i4')])
+
+        tgt = np.sort(d, order=['age', 'height'])
+        assert_array_equal(np.partition(d, range(d.size),
+                                        order=['age', 'height']),
+                           tgt)
+        assert_array_equal(d[np.argpartition(d, range(d.size),
+                                             order=['age', 'height'])],
+                           tgt)
+        for k in range(d.size):
+            assert_equal(np.partition(d, k, order=['age', 'height'])[k],
+                        tgt[k])
+            assert_equal(d[np.argpartition(d, k, order=['age', 'height'])][k],
+                         tgt[k])
+
+        d = np.array(['Galahad', 'Arthur', 'zebra', 'Lancelot'])
+        tgt = np.sort(d)
+        assert_array_equal(np.partition(d, range(d.size)), tgt)
+        for k in range(d.size):
+            assert_equal(np.partition(d, k)[k], tgt[k])
+            assert_equal(d[np.argpartition(d, k)][k], tgt[k])
+
+    def test_partition_unicode_kind(self):
+        d = np.arange(10)
+        k = b'\xc3\xa4'.decode("UTF8")
+        assert_raises(ValueError, d.partition, 2, kind=k)
+        assert_raises(ValueError, d.argpartition, 2, kind=k)
+
+    def test_partition_fuzz(self):
+        # a few rounds of random data testing
+        for j in range(10, 30):
+            for i in range(1, j - 2):
+                d = np.arange(j)
+                np.random.shuffle(d)
+                d = d % np.random.randint(2, 30)
+                idx = np.random.randint(d.size)
+                kth = [0, idx, i, i + 1]
+                tgt = np.sort(d)[kth]
+                assert_array_equal(np.partition(d, kth)[kth], tgt,
+                                   err_msg="data: %r\n kth: %r" % (d, kth))
+
+    def test_argpartition_gh5524(self):
+        #  A test for functionality of argpartition on lists.
+        d = [6,7,3,2,9,0]
+        p = np.argpartition(d,1)
+        self.assert_partitioned(np.array(d)[p],[1])
+
+    def test_flatten(self):
+        x0 = np.array([[1, 2, 3], [4, 5, 6]], np.int32)
+        x1 = np.array([[[1, 2], [3, 4]], [[5, 6], [7, 8]]], np.int32)
+        y0 = np.array([1, 2, 3, 4, 5, 6], np.int32)
+        y0f = np.array([1, 4, 2, 5, 3, 6], np.int32)
+        y1 = np.array([1, 2, 3, 4, 5, 6, 7, 8], np.int32)
+        y1f = np.array([1, 5, 3, 7, 2, 6, 4, 8], np.int32)
+        assert_equal(x0.flatten(), y0)
+        assert_equal(x0.flatten('F'), y0f)
+        assert_equal(x0.flatten('F'), x0.T.flatten())
+        assert_equal(x1.flatten(), y1)
+        assert_equal(x1.flatten('F'), y1f)
+        assert_equal(x1.flatten('F'), x1.T.flatten())
+
+
+    @pytest.mark.parametrize('func', (np.dot, np.matmul))
+    def test_arr_mult(self, func):
+        a = np.array([[1, 0], [0, 1]])
+        b = np.array([[0, 1], [1, 0]])
+        c = np.array([[9, 1], [1, -9]])
+        d = np.arange(24).reshape(4, 6)
+        ddt = np.array(
+            [[  55,  145,  235,  325],
+             [ 145,  451,  757, 1063],
+             [ 235,  757, 1279, 1801],
+             [ 325, 1063, 1801, 2539]]
+        )
+        dtd = np.array(
+            [[504, 540, 576, 612, 648, 684],
+             [540, 580, 620, 660, 700, 740],
+             [576, 620, 664, 708, 752, 796],
+             [612, 660, 708, 756, 804, 852],
+             [648, 700, 752, 804, 856, 908],
+             [684, 740, 796, 852, 908, 964]]
+        )
+
+
+        # gemm vs syrk optimizations
+        for et in [np.float32, np.float64, np.complex64, np.complex128]:
+            eaf = a.astype(et)
+            assert_equal(func(eaf, eaf), eaf)
+            assert_equal(func(eaf.T, eaf), eaf)
+            assert_equal(func(eaf, eaf.T), eaf)
+            assert_equal(func(eaf.T, eaf.T), eaf)
+            assert_equal(func(eaf.T.copy(), eaf), eaf)
+            assert_equal(func(eaf, eaf.T.copy()), eaf)
+            assert_equal(func(eaf.T.copy(), eaf.T.copy()), eaf)
+
+        # syrk validations
+        for et in [np.float32, np.float64, np.complex64, np.complex128]:
+            eaf = a.astype(et)
+            ebf = b.astype(et)
+            assert_equal(func(ebf, ebf), eaf)
+            assert_equal(func(ebf.T, ebf), eaf)
+            assert_equal(func(ebf, ebf.T), eaf)
+            assert_equal(func(ebf.T, ebf.T), eaf)
+
+        # syrk - different shape, stride, and view validations
+        for et in [np.float32, np.float64, np.complex64, np.complex128]:
+            edf = d.astype(et)
+            assert_equal(
+                func(edf[::-1, :], edf.T),
+                func(edf[::-1, :].copy(), edf.T.copy())
+            )
+            assert_equal(
+                func(edf[:, ::-1], edf.T),
+                func(edf[:, ::-1].copy(), edf.T.copy())
+            )
+            assert_equal(
+                func(edf, edf[::-1, :].T),
+                func(edf, edf[::-1, :].T.copy())
+            )
+            assert_equal(
+                func(edf, edf[:, ::-1].T),
+                func(edf, edf[:, ::-1].T.copy())
+            )
+            assert_equal(
+                func(edf[:edf.shape[0] // 2, :], edf[::2, :].T),
+                func(edf[:edf.shape[0] // 2, :].copy(), edf[::2, :].T.copy())
+            )
+            assert_equal(
+                func(edf[::2, :], edf[:edf.shape[0] // 2, :].T),
+                func(edf[::2, :].copy(), edf[:edf.shape[0] // 2, :].T.copy())
+            )
+
+        # syrk - different shape
+        for et in [np.float32, np.float64, np.complex64, np.complex128]:
+            edf = d.astype(et)
+            eddtf = ddt.astype(et)
+            edtdf = dtd.astype(et)
+            assert_equal(func(edf, edf.T), eddtf)
+            assert_equal(func(edf.T, edf), edtdf)
+
+    @pytest.mark.parametrize('func', (np.dot, np.matmul))
+    @pytest.mark.parametrize('dtype', 'ifdFD')
+    def test_no_dgemv(self, func, dtype):
+        # check vector arg for contiguous before gemv
+        # gh-12156
+        a = np.arange(8.0, dtype=dtype).reshape(2, 4)
+        b = np.broadcast_to(1., (4, 1))
+        ret1 = func(a, b)
+        ret2 = func(a, b.copy())
+        assert_equal(ret1, ret2)
+
+        ret1 = func(b.T, a.T)
+        ret2 = func(b.T.copy(), a.T)
+        assert_equal(ret1, ret2)
+
+        # check for unaligned data
+        dt = np.dtype(dtype)
+        a = np.zeros(8 * dt.itemsize // 2 + 1, dtype='int16')[1:].view(dtype)
+        a = a.reshape(2, 4)
+        b = a[0]
+        # make sure it is not aligned
+        assert_(a.__array_interface__['data'][0] % dt.itemsize != 0)
+        ret1 = func(a, b)
+        ret2 = func(a.copy(), b.copy())
+        assert_equal(ret1, ret2)
+
+        ret1 = func(b.T, a.T)
+        ret2 = func(b.T.copy(), a.T.copy())
+        assert_equal(ret1, ret2)
+
+    def test_dot(self):
+        a = np.array([[1, 0], [0, 1]])
+        b = np.array([[0, 1], [1, 0]])
+        c = np.array([[9, 1], [1, -9]])
+        # function versus methods
+        assert_equal(np.dot(a, b), a.dot(b))
+        assert_equal(np.dot(np.dot(a, b), c), a.dot(b).dot(c))
+
+        # test passing in an output array
+        c = np.zeros_like(a)
+        a.dot(b, c)
+        assert_equal(c, np.dot(a, b))
+
+        # test keyword args
+        c = np.zeros_like(a)
+        a.dot(b=b, out=c)
+        assert_equal(c, np.dot(a, b))
+
+    def test_dot_type_mismatch(self):
+        c = 1.
+        A = np.array((1,1), dtype='i,i')
+
+        assert_raises(TypeError, np.dot, c, A)
+        assert_raises(TypeError, np.dot, A, c)
+
+    def test_dot_out_mem_overlap(self):
+        np.random.seed(1)
+
+        # Test BLAS and non-BLAS code paths, including all dtypes
+        # that dot() supports
+        dtypes = [np.dtype(code) for code in np.typecodes['All']
+                  if code not in 'USVM']
+        for dtype in dtypes:
+            a = np.random.rand(3, 3).astype(dtype)
+
+            # Valid dot() output arrays must be aligned
+            b = _aligned_zeros((3, 3), dtype=dtype)
+            b[...] = np.random.rand(3, 3)
+
+            y = np.dot(a, b)
+            x = np.dot(a, b, out=b)
+            assert_equal(x, y, err_msg=repr(dtype))
+
+            # Check invalid output array
+            assert_raises(ValueError, np.dot, a, b, out=b[::2])
+            assert_raises(ValueError, np.dot, a, b, out=b.T)
+
+    def test_dot_matmul_out(self):
+        # gh-9641
+        class Sub(np.ndarray):
+            pass
+        a = np.ones((2, 2)).view(Sub)
+        b = np.ones((2, 2)).view(Sub)
+        out = np.ones((2, 2))
+
+        # make sure out can be any ndarray (not only subclass of inputs)
+        np.dot(a, b, out=out)
+        np.matmul(a, b, out=out)
+
+    def test_dot_matmul_inner_array_casting_fails(self):
+
+        class A:
+            def __array__(self, *args, **kwargs):
+                raise NotImplementedError
+
+        # Don't override the error from calling __array__()
+        assert_raises(NotImplementedError, np.dot, A(), A())
+        assert_raises(NotImplementedError, np.matmul, A(), A())
+        assert_raises(NotImplementedError, np.inner, A(), A())
+
+    def test_matmul_out(self):
+        # overlapping memory
+        a = np.arange(18).reshape(2, 3, 3)
+        b = np.matmul(a, a)
+        c = np.matmul(a, a, out=a)
+        assert_(c is a)
+        assert_equal(c, b)
+        a = np.arange(18).reshape(2, 3, 3)
+        c = np.matmul(a, a, out=a[::-1, ...])
+        assert_(c.base is a.base)
+        assert_equal(c, b)
+
+    def test_diagonal(self):
+        a = np.arange(12).reshape((3, 4))
+        assert_equal(a.diagonal(), [0, 5, 10])
+        assert_equal(a.diagonal(0), [0, 5, 10])
+        assert_equal(a.diagonal(1), [1, 6, 11])
+        assert_equal(a.diagonal(-1), [4, 9])
+        assert_raises(np.AxisError, a.diagonal, axis1=0, axis2=5)
+        assert_raises(np.AxisError, a.diagonal, axis1=5, axis2=0)
+        assert_raises(np.AxisError, a.diagonal, axis1=5, axis2=5)
+        assert_raises(ValueError, a.diagonal, axis1=1, axis2=1)
+
+        b = np.arange(8).reshape((2, 2, 2))
+        assert_equal(b.diagonal(), [[0, 6], [1, 7]])
+        assert_equal(b.diagonal(0), [[0, 6], [1, 7]])
+        assert_equal(b.diagonal(1), [[2], [3]])
+        assert_equal(b.diagonal(-1), [[4], [5]])
+        assert_raises(ValueError, b.diagonal, axis1=0, axis2=0)
+        assert_equal(b.diagonal(0, 1, 2), [[0, 3], [4, 7]])
+        assert_equal(b.diagonal(0, 0, 1), [[0, 6], [1, 7]])
+        assert_equal(b.diagonal(offset=1, axis1=0, axis2=2), [[1], [3]])
+        # Order of axis argument doesn't matter:
+        assert_equal(b.diagonal(0, 2, 1), [[0, 3], [4, 7]])
+
+    def test_diagonal_view_notwriteable(self):
+        a = np.eye(3).diagonal()
+        assert_(not a.flags.writeable)
+        assert_(not a.flags.owndata)
+
+        a = np.diagonal(np.eye(3))
+        assert_(not a.flags.writeable)
+        assert_(not a.flags.owndata)
+
+        a = np.diag(np.eye(3))
+        assert_(not a.flags.writeable)
+        assert_(not a.flags.owndata)
+
+    def test_diagonal_memleak(self):
+        # Regression test for a bug that crept in at one point
+        a = np.zeros((100, 100))
+        if HAS_REFCOUNT:
+            assert_(sys.getrefcount(a) < 50)
+        for i in range(100):
+            a.diagonal()
+        if HAS_REFCOUNT:
+            assert_(sys.getrefcount(a) < 50)
+
+    def test_size_zero_memleak(self):
+        # Regression test for issue 9615
+        # Exercises a special-case code path for dot products of length
+        # zero in cblasfuncs (making it is specific to floating dtypes).
+        a = np.array([], dtype=np.float64)
+        x = np.array(2.0)
+        for _ in range(100):
+            np.dot(a, a, out=x)
+        if HAS_REFCOUNT:
+            assert_(sys.getrefcount(x) < 50)
+
+    def test_trace(self):
+        a = np.arange(12).reshape((3, 4))
+        assert_equal(a.trace(), 15)
+        assert_equal(a.trace(0), 15)
+        assert_equal(a.trace(1), 18)
+        assert_equal(a.trace(-1), 13)
+
+        b = np.arange(8).reshape((2, 2, 2))
+        assert_equal(b.trace(), [6, 8])
+        assert_equal(b.trace(0), [6, 8])
+        assert_equal(b.trace(1), [2, 3])
+        assert_equal(b.trace(-1), [4, 5])
+        assert_equal(b.trace(0, 0, 1), [6, 8])
+        assert_equal(b.trace(0, 0, 2), [5, 9])
+        assert_equal(b.trace(0, 1, 2), [3, 11])
+        assert_equal(b.trace(offset=1, axis1=0, axis2=2), [1, 3])
+
+    def test_trace_subclass(self):
+        # The class would need to overwrite trace to ensure single-element
+        # output also has the right subclass.
+        class MyArray(np.ndarray):
+            pass
+
+        b = np.arange(8).reshape((2, 2, 2)).view(MyArray)
+        t = b.trace()
+        assert_(isinstance(t, MyArray))
+
+    def test_put(self):
+        icodes = np.typecodes['AllInteger']
+        fcodes = np.typecodes['AllFloat']
+        for dt in icodes + fcodes + 'O':
+            tgt = np.array([0, 1, 0, 3, 0, 5], dtype=dt)
+
+            # test 1-d
+            a = np.zeros(6, dtype=dt)
+            a.put([1, 3, 5], [1, 3, 5])
+            assert_equal(a, tgt)
+
+            # test 2-d
+            a = np.zeros((2, 3), dtype=dt)
+            a.put([1, 3, 5], [1, 3, 5])
+            assert_equal(a, tgt.reshape(2, 3))
+
+        for dt in '?':
+            tgt = np.array([False, True, False, True, False, True], dtype=dt)
+
+            # test 1-d
+            a = np.zeros(6, dtype=dt)
+            a.put([1, 3, 5], [True]*3)
+            assert_equal(a, tgt)
+
+            # test 2-d
+            a = np.zeros((2, 3), dtype=dt)
+            a.put([1, 3, 5], [True]*3)
+            assert_equal(a, tgt.reshape(2, 3))
+
+        # check must be writeable
+        a = np.zeros(6)
+        a.flags.writeable = False
+        assert_raises(ValueError, a.put, [1, 3, 5], [1, 3, 5])
+
+        # when calling np.put, make sure a
+        # TypeError is raised if the object
+        # isn't an ndarray
+        bad_array = [1, 2, 3]
+        assert_raises(TypeError, np.put, bad_array, [0, 2], 5)
+
+    def test_ravel(self):
+        a = np.array([[0, 1], [2, 3]])
+        assert_equal(a.ravel(), [0, 1, 2, 3])
+        assert_(not a.ravel().flags.owndata)
+        assert_equal(a.ravel('F'), [0, 2, 1, 3])
+        assert_equal(a.ravel(order='C'), [0, 1, 2, 3])
+        assert_equal(a.ravel(order='F'), [0, 2, 1, 3])
+        assert_equal(a.ravel(order='A'), [0, 1, 2, 3])
+        assert_(not a.ravel(order='A').flags.owndata)
+        assert_equal(a.ravel(order='K'), [0, 1, 2, 3])
+        assert_(not a.ravel(order='K').flags.owndata)
+        assert_equal(a.ravel(), a.reshape(-1))
+
+        a = np.array([[0, 1], [2, 3]], order='F')
+        assert_equal(a.ravel(), [0, 1, 2, 3])
+        assert_equal(a.ravel(order='A'), [0, 2, 1, 3])
+        assert_equal(a.ravel(order='K'), [0, 2, 1, 3])
+        assert_(not a.ravel(order='A').flags.owndata)
+        assert_(not a.ravel(order='K').flags.owndata)
+        assert_equal(a.ravel(), a.reshape(-1))
+        assert_equal(a.ravel(order='A'), a.reshape(-1, order='A'))
+
+        a = np.array([[0, 1], [2, 3]])[::-1, :]
+        assert_equal(a.ravel(), [2, 3, 0, 1])
+        assert_equal(a.ravel(order='C'), [2, 3, 0, 1])
+        assert_equal(a.ravel(order='F'), [2, 0, 3, 1])
+        assert_equal(a.ravel(order='A'), [2, 3, 0, 1])
+        # 'K' doesn't reverse the axes of negative strides
+        assert_equal(a.ravel(order='K'), [2, 3, 0, 1])
+        assert_(a.ravel(order='K').flags.owndata)
+
+        # Test simple 1-d copy behaviour:
+        a = np.arange(10)[::2]
+        assert_(a.ravel('K').flags.owndata)
+        assert_(a.ravel('C').flags.owndata)
+        assert_(a.ravel('F').flags.owndata)
+
+        # Not contiguous and 1-sized axis with non matching stride
+        a = np.arange(2**3 * 2)[::2]
+        a = a.reshape(2, 1, 2, 2).swapaxes(-1, -2)
+        strides = list(a.strides)
+        strides[1] = 123
+        a.strides = strides
+        assert_(a.ravel(order='K').flags.owndata)
+        assert_equal(a.ravel('K'), np.arange(0, 15, 2))
+
+        # contiguous and 1-sized axis with non matching stride works:
+        a = np.arange(2**3)
+        a = a.reshape(2, 1, 2, 2).swapaxes(-1, -2)
+        strides = list(a.strides)
+        strides[1] = 123
+        a.strides = strides
+        assert_(np.may_share_memory(a.ravel(order='K'), a))
+        assert_equal(a.ravel(order='K'), np.arange(2**3))
+
+        # Test negative strides (not very interesting since non-contiguous):
+        a = np.arange(4)[::-1].reshape(2, 2)
+        assert_(a.ravel(order='C').flags.owndata)
+        assert_(a.ravel(order='K').flags.owndata)
+        assert_equal(a.ravel('C'), [3, 2, 1, 0])
+        assert_equal(a.ravel('K'), [3, 2, 1, 0])
+
+        # 1-element tidy strides test (NPY_RELAXED_STRIDES_CHECKING):
+        a = np.array([[1]])
+        a.strides = (123, 432)
+        # If the stride is not 8, NPY_RELAXED_STRIDES_CHECKING is messing
+        # them up on purpose:
+        if np.ones(1).strides == (8,):
+            assert_(np.may_share_memory(a.ravel('K'), a))
+            assert_equal(a.ravel('K').strides, (a.dtype.itemsize,))
+
+        for order in ('C', 'F', 'A', 'K'):
+            # 0-d corner case:
+            a = np.array(0)
+            assert_equal(a.ravel(order), [0])
+            assert_(np.may_share_memory(a.ravel(order), a))
+
+        # Test that certain non-inplace ravels work right (mostly) for 'K':
+        b = np.arange(2**4 * 2)[::2].reshape(2, 2, 2, 2)
+        a = b[..., ::2]
+        assert_equal(a.ravel('K'), [0, 4, 8, 12, 16, 20, 24, 28])
+        assert_equal(a.ravel('C'), [0, 4, 8, 12, 16, 20, 24, 28])
+        assert_equal(a.ravel('A'), [0, 4, 8, 12, 16, 20, 24, 28])
+        assert_equal(a.ravel('F'), [0, 16, 8, 24, 4, 20, 12, 28])
+
+        a = b[::2, ...]
+        assert_equal(a.ravel('K'), [0, 2, 4, 6, 8, 10, 12, 14])
+        assert_equal(a.ravel('C'), [0, 2, 4, 6, 8, 10, 12, 14])
+        assert_equal(a.ravel('A'), [0, 2, 4, 6, 8, 10, 12, 14])
+        assert_equal(a.ravel('F'), [0, 8, 4, 12, 2, 10, 6, 14])
+
+    def test_ravel_subclass(self):
+        class ArraySubclass(np.ndarray):
+            pass
+
+        a = np.arange(10).view(ArraySubclass)
+        assert_(isinstance(a.ravel('C'), ArraySubclass))
+        assert_(isinstance(a.ravel('F'), ArraySubclass))
+        assert_(isinstance(a.ravel('A'), ArraySubclass))
+        assert_(isinstance(a.ravel('K'), ArraySubclass))
+
+        a = np.arange(10)[::2].view(ArraySubclass)
+        assert_(isinstance(a.ravel('C'), ArraySubclass))
+        assert_(isinstance(a.ravel('F'), ArraySubclass))
+        assert_(isinstance(a.ravel('A'), ArraySubclass))
+        assert_(isinstance(a.ravel('K'), ArraySubclass))
+
+    def test_swapaxes(self):
+        a = np.arange(1*2*3*4).reshape(1, 2, 3, 4).copy()
+        idx = np.indices(a.shape)
+        assert_(a.flags['OWNDATA'])
+        b = a.copy()
+        # check exceptions
+        assert_raises(np.AxisError, a.swapaxes, -5, 0)
+        assert_raises(np.AxisError, a.swapaxes, 4, 0)
+        assert_raises(np.AxisError, a.swapaxes, 0, -5)
+        assert_raises(np.AxisError, a.swapaxes, 0, 4)
+
+        for i in range(-4, 4):
+            for j in range(-4, 4):
+                for k, src in enumerate((a, b)):
+                    c = src.swapaxes(i, j)
+                    # check shape
+                    shape = list(src.shape)
+                    shape[i] = src.shape[j]
+                    shape[j] = src.shape[i]
+                    assert_equal(c.shape, shape, str((i, j, k)))
+                    # check array contents
+                    i0, i1, i2, i3 = [dim-1 for dim in c.shape]
+                    j0, j1, j2, j3 = [dim-1 for dim in src.shape]
+                    assert_equal(src[idx[j0], idx[j1], idx[j2], idx[j3]],
+                                 c[idx[i0], idx[i1], idx[i2], idx[i3]],
+                                 str((i, j, k)))
+                    # check a view is always returned, gh-5260
+                    assert_(not c.flags['OWNDATA'], str((i, j, k)))
+                    # check on non-contiguous input array
+                    if k == 1:
+                        b = c
+
+    def test_conjugate(self):
+        a = np.array([1-1j, 1+1j, 23+23.0j])
+        ac = a.conj()
+        assert_equal(a.real, ac.real)
+        assert_equal(a.imag, -ac.imag)
+        assert_equal(ac, a.conjugate())
+        assert_equal(ac, np.conjugate(a))
+
+        a = np.array([1-1j, 1+1j, 23+23.0j], 'F')
+        ac = a.conj()
+        assert_equal(a.real, ac.real)
+        assert_equal(a.imag, -ac.imag)
+        assert_equal(ac, a.conjugate())
+        assert_equal(ac, np.conjugate(a))
+
+        a = np.array([1, 2, 3])
+        ac = a.conj()
+        assert_equal(a, ac)
+        assert_equal(ac, a.conjugate())
+        assert_equal(ac, np.conjugate(a))
+
+        a = np.array([1.0, 2.0, 3.0])
+        ac = a.conj()
+        assert_equal(a, ac)
+        assert_equal(ac, a.conjugate())
+        assert_equal(ac, np.conjugate(a))
+
+        a = np.array([1-1j, 1+1j, 1, 2.0], object)
+        ac = a.conj()
+        assert_equal(ac, [k.conjugate() for k in a])
+        assert_equal(ac, a.conjugate())
+        assert_equal(ac, np.conjugate(a))
+
+        a = np.array([1-1j, 1, 2.0, 'f'], object)
+        assert_raises(TypeError, lambda: a.conj())
+        assert_raises(TypeError, lambda: a.conjugate())
+
+    def test__complex__(self):
+        dtypes = ['i1', 'i2', 'i4', 'i8',
+                  'u1', 'u2', 'u4', 'u8',
+                  'f', 'd', 'g', 'F', 'D', 'G',
+                  '?', 'O']
+        for dt in dtypes:
+            a = np.array(7, dtype=dt)
+            b = np.array([7], dtype=dt)
+            c = np.array([[[[[7]]]]], dtype=dt)
+
+            msg = 'dtype: {0}'.format(dt)
+            ap = complex(a)
+            assert_equal(ap, a, msg)
+            bp = complex(b)
+            assert_equal(bp, b, msg)
+            cp = complex(c)
+            assert_equal(cp, c, msg)
+
+    def test__complex__should_not_work(self):
+        dtypes = ['i1', 'i2', 'i4', 'i8',
+                  'u1', 'u2', 'u4', 'u8',
+                  'f', 'd', 'g', 'F', 'D', 'G',
+                  '?', 'O']
+        for dt in dtypes:
+            a = np.array([1, 2, 3], dtype=dt)
+            assert_raises(TypeError, complex, a)
+
+        dt = np.dtype([('a', 'f8'), ('b', 'i1')])
+        b = np.array((1.0, 3), dtype=dt)
+        assert_raises(TypeError, complex, b)
+
+        c = np.array([(1.0, 3), (2e-3, 7)], dtype=dt)
+        assert_raises(TypeError, complex, c)
+
+        d = np.array('1+1j')
+        assert_raises(TypeError, complex, d)
+
+        e = np.array(['1+1j'], 'U')
+        assert_raises(TypeError, complex, e)
+
+class TestCequenceMethods:
+    def test_array_contains(self):
+        assert_(4.0 in np.arange(16.).reshape(4,4))
+        assert_(20.0 not in np.arange(16.).reshape(4,4))
+
+class TestBinop:
+    def test_inplace(self):
+        # test refcount 1 inplace conversion
+        assert_array_almost_equal(np.array([0.5]) * np.array([1.0, 2.0]),
+                                  [0.5, 1.0])
+
+        d = np.array([0.5, 0.5])[::2]
+        assert_array_almost_equal(d * (d * np.array([1.0, 2.0])),
+                                  [0.25, 0.5])
+
+        a = np.array([0.5])
+        b = np.array([0.5])
+        c = a + b
+        c = a - b
+        c = a * b
+        c = a / b
+        assert_equal(a, b)
+        assert_almost_equal(c, 1.)
+
+        c = a + b * 2. / b * a - a / b
+        assert_equal(a, b)
+        assert_equal(c, 0.5)
+
+        # true divide
+        a = np.array([5])
+        b = np.array([3])
+        c = (a * a) / b
+
+        assert_almost_equal(c, 25 / 3)
+        assert_equal(a, 5)
+        assert_equal(b, 3)
+
+    # ndarray.__rop__ always calls ufunc
+    # ndarray.__iop__ always calls ufunc
+    # ndarray.__op__, __rop__:
+    #   - defer if other has __array_ufunc__ and it is None
+    #           or other is not a subclass and has higher array priority
+    #   - else, call ufunc
+    def test_ufunc_binop_interaction(self):
+        # Python method name (without underscores)
+        #   -> (numpy ufunc, has_in_place_version, preferred_dtype)
+        ops = {
+            'add':      (np.add, True, float),
+            'sub':      (np.subtract, True, float),
+            'mul':      (np.multiply, True, float),
+            'truediv':  (np.true_divide, True, float),
+            'floordiv': (np.floor_divide, True, float),
+            'mod':      (np.remainder, True, float),
+            'divmod':   (np.divmod, False, float),
+            'pow':      (np.power, True, int),
+            'lshift':   (np.left_shift, True, int),
+            'rshift':   (np.right_shift, True, int),
+            'and':      (np.bitwise_and, True, int),
+            'xor':      (np.bitwise_xor, True, int),
+            'or':       (np.bitwise_or, True, int),
+            'matmul':   (np.matmul, False, float),
+            # 'ge':       (np.less_equal, False),
+            # 'gt':       (np.less, False),
+            # 'le':       (np.greater_equal, False),
+            # 'lt':       (np.greater, False),
+            # 'eq':       (np.equal, False),
+            # 'ne':       (np.not_equal, False),
+        }
+
+        class Coerced(Exception):
+            pass
+
+        def array_impl(self):
+            raise Coerced
+
+        def op_impl(self, other):
+            return "forward"
+
+        def rop_impl(self, other):
+            return "reverse"
+
+        def iop_impl(self, other):
+            return "in-place"
+
+        def array_ufunc_impl(self, ufunc, method, *args, **kwargs):
+            return ("__array_ufunc__", ufunc, method, args, kwargs)
+
+        # Create an object with the given base, in the given module, with a
+        # bunch of placeholder __op__ methods, and optionally a
+        # __array_ufunc__ and __array_priority__.
+        def make_obj(base, array_priority=False, array_ufunc=False,
+                     alleged_module="__main__"):
+            class_namespace = {"__array__": array_impl}
+            if array_priority is not False:
+                class_namespace["__array_priority__"] = array_priority
+            for op in ops:
+                class_namespace["__{0}__".format(op)] = op_impl
+                class_namespace["__r{0}__".format(op)] = rop_impl
+                class_namespace["__i{0}__".format(op)] = iop_impl
+            if array_ufunc is not False:
+                class_namespace["__array_ufunc__"] = array_ufunc
+            eval_namespace = {"base": base,
+                              "class_namespace": class_namespace,
+                              "__name__": alleged_module,
+                              }
+            MyType = eval("type('MyType', (base,), class_namespace)",
+                          eval_namespace)
+            if issubclass(MyType, np.ndarray):
+                # Use this range to avoid special case weirdnesses around
+                # divide-by-0, pow(x, 2), overflow due to pow(big, big), etc.
+                return np.arange(3, 7).reshape(2, 2).view(MyType)
+            else:
+                return MyType()
+
+        def check(obj, binop_override_expected, ufunc_override_expected,
+                  inplace_override_expected, check_scalar=True):
+            for op, (ufunc, has_inplace, dtype) in ops.items():
+                err_msg = ('op: %s, ufunc: %s, has_inplace: %s, dtype: %s'
+                           % (op, ufunc, has_inplace, dtype))
+                check_objs = [np.arange(3, 7, dtype=dtype).reshape(2, 2)]
+                if check_scalar:
+                    check_objs.append(check_objs[0][0])
+                for arr in check_objs:
+                    arr_method = getattr(arr, "__{0}__".format(op))
+
+                    def first_out_arg(result):
+                        if op == "divmod":
+                            assert_(isinstance(result, tuple))
+                            return result[0]
+                        else:
+                            return result
+
+                    # arr __op__ obj
+                    if binop_override_expected:
+                        assert_equal(arr_method(obj), NotImplemented, err_msg)
+                    elif ufunc_override_expected:
+                        assert_equal(arr_method(obj)[0], "__array_ufunc__",
+                                     err_msg)
+                    else:
+                        if (isinstance(obj, np.ndarray) and
+                            (type(obj).__array_ufunc__ is
+                             np.ndarray.__array_ufunc__)):
+                            # __array__ gets ignored
+                            res = first_out_arg(arr_method(obj))
+                            assert_(res.__class__ is obj.__class__, err_msg)
+                        else:
+                            assert_raises((TypeError, Coerced),
+                                          arr_method, obj, err_msg=err_msg)
+                    # obj __op__ arr
+                    arr_rmethod = getattr(arr, "__r{0}__".format(op))
+                    if ufunc_override_expected:
+                        res = arr_rmethod(obj)
+                        assert_equal(res[0], "__array_ufunc__",
+                                     err_msg=err_msg)
+                        assert_equal(res[1], ufunc, err_msg=err_msg)
+                    else:
+                        if (isinstance(obj, np.ndarray) and
+                                (type(obj).__array_ufunc__ is
+                                 np.ndarray.__array_ufunc__)):
+                            # __array__ gets ignored
+                            res = first_out_arg(arr_rmethod(obj))
+                            assert_(res.__class__ is obj.__class__, err_msg)
+                        else:
+                            # __array_ufunc__ = "asdf" creates a TypeError
+                            assert_raises((TypeError, Coerced),
+                                          arr_rmethod, obj, err_msg=err_msg)
+
+                    # arr __iop__ obj
+                    # array scalars don't have in-place operators
+                    if has_inplace and isinstance(arr, np.ndarray):
+                        arr_imethod = getattr(arr, "__i{0}__".format(op))
+                        if inplace_override_expected:
+                            assert_equal(arr_method(obj), NotImplemented,
+                                         err_msg=err_msg)
+                        elif ufunc_override_expected:
+                            res = arr_imethod(obj)
+                            assert_equal(res[0], "__array_ufunc__", err_msg)
+                            assert_equal(res[1], ufunc, err_msg)
+                            assert_(type(res[-1]["out"]) is tuple, err_msg)
+                            assert_(res[-1]["out"][0] is arr, err_msg)
+                        else:
+                            if (isinstance(obj, np.ndarray) and
+                                    (type(obj).__array_ufunc__ is
+                                    np.ndarray.__array_ufunc__)):
+                                # __array__ gets ignored
+                                assert_(arr_imethod(obj) is arr, err_msg)
+                            else:
+                                assert_raises((TypeError, Coerced),
+                                              arr_imethod, obj,
+                                              err_msg=err_msg)
+
+                    op_fn = getattr(operator, op, None)
+                    if op_fn is None:
+                        op_fn = getattr(operator, op + "_", None)
+                    if op_fn is None:
+                        op_fn = getattr(builtins, op)
+                    assert_equal(op_fn(obj, arr), "forward", err_msg)
+                    if not isinstance(obj, np.ndarray):
+                        if binop_override_expected:
+                            assert_equal(op_fn(arr, obj), "reverse", err_msg)
+                        elif ufunc_override_expected:
+                            assert_equal(op_fn(arr, obj)[0], "__array_ufunc__",
+                                         err_msg)
+                    if ufunc_override_expected:
+                        assert_equal(ufunc(obj, arr)[0], "__array_ufunc__",
+                                     err_msg)
+
+        # No array priority, no array_ufunc -> nothing called
+        check(make_obj(object), False, False, False)
+        # Negative array priority, no array_ufunc -> nothing called
+        # (has to be very negative, because scalar priority is -1000000.0)
+        check(make_obj(object, array_priority=-2**30), False, False, False)
+        # Positive array priority, no array_ufunc -> binops and iops only
+        check(make_obj(object, array_priority=1), True, False, True)
+        # ndarray ignores array_priority for ndarray subclasses
+        check(make_obj(np.ndarray, array_priority=1), False, False, False,
+              check_scalar=False)
+        # Positive array_priority and array_ufunc -> array_ufunc only
+        check(make_obj(object, array_priority=1,
+                       array_ufunc=array_ufunc_impl), False, True, False)
+        check(make_obj(np.ndarray, array_priority=1,
+                       array_ufunc=array_ufunc_impl), False, True, False)
+        # array_ufunc set to None -> defer binops only
+        check(make_obj(object, array_ufunc=None), True, False, False)
+        check(make_obj(np.ndarray, array_ufunc=None), True, False, False,
+              check_scalar=False)
+
+    def test_ufunc_override_normalize_signature(self):
+        # gh-5674
+        class SomeClass:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kw):
+                return kw
+
+        a = SomeClass()
+        kw = np.add(a, [1])
+        assert_('sig' not in kw and 'signature' not in kw)
+        kw = np.add(a, [1], sig='ii->i')
+        assert_('sig' not in kw and 'signature' in kw)
+        assert_equal(kw['signature'], 'ii->i')
+        kw = np.add(a, [1], signature='ii->i')
+        assert_('sig' not in kw and 'signature' in kw)
+        assert_equal(kw['signature'], 'ii->i')
+
+    def test_array_ufunc_index(self):
+        # Check that index is set appropriately, also if only an output
+        # is passed on (latter is another regression tests for github bug 4753)
+        # This also checks implicitly that 'out' is always a tuple.
+        class CheckIndex:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kw):
+                for i, a in enumerate(inputs):
+                    if a is self:
+                        return i
+                # calls below mean we must be in an output.
+                for j, a in enumerate(kw['out']):
+                    if a is self:
+                        return (j,)
+
+        a = CheckIndex()
+        dummy = np.arange(2.)
+        # 1 input, 1 output
+        assert_equal(np.sin(a), 0)
+        assert_equal(np.sin(dummy, a), (0,))
+        assert_equal(np.sin(dummy, out=a), (0,))
+        assert_equal(np.sin(dummy, out=(a,)), (0,))
+        assert_equal(np.sin(a, a), 0)
+        assert_equal(np.sin(a, out=a), 0)
+        assert_equal(np.sin(a, out=(a,)), 0)
+        # 1 input, 2 outputs
+        assert_equal(np.modf(dummy, a), (0,))
+        assert_equal(np.modf(dummy, None, a), (1,))
+        assert_equal(np.modf(dummy, dummy, a), (1,))
+        assert_equal(np.modf(dummy, out=(a, None)), (0,))
+        assert_equal(np.modf(dummy, out=(a, dummy)), (0,))
+        assert_equal(np.modf(dummy, out=(None, a)), (1,))
+        assert_equal(np.modf(dummy, out=(dummy, a)), (1,))
+        assert_equal(np.modf(a, out=(dummy, a)), 0)
+        with assert_raises(TypeError):
+            # Out argument must be tuple, since there are multiple outputs
+            np.modf(dummy, out=a)
+
+        assert_raises(ValueError, np.modf, dummy, out=(a,))
+
+        # 2 inputs, 1 output
+        assert_equal(np.add(a, dummy), 0)
+        assert_equal(np.add(dummy, a), 1)
+        assert_equal(np.add(dummy, dummy, a), (0,))
+        assert_equal(np.add(dummy, a, a), 1)
+        assert_equal(np.add(dummy, dummy, out=a), (0,))
+        assert_equal(np.add(dummy, dummy, out=(a,)), (0,))
+        assert_equal(np.add(a, dummy, out=a), 0)
+
+    def test_out_override(self):
+        # regression test for github bug 4753
+        class OutClass(np.ndarray):
+            def __array_ufunc__(self, ufunc, method, *inputs, **kw):
+                if 'out' in kw:
+                    tmp_kw = kw.copy()
+                    tmp_kw.pop('out')
+                    func = getattr(ufunc, method)
+                    kw['out'][0][...] = func(*inputs, **tmp_kw)
+
+        A = np.array([0]).view(OutClass)
+        B = np.array([5])
+        C = np.array([6])
+        np.multiply(C, B, A)
+        assert_equal(A[0], 30)
+        assert_(isinstance(A, OutClass))
+        A[0] = 0
+        np.multiply(C, B, out=A)
+        assert_equal(A[0], 30)
+        assert_(isinstance(A, OutClass))
+
+    def test_pow_override_with_errors(self):
+        # regression test for gh-9112
+        class PowerOnly(np.ndarray):
+            def __array_ufunc__(self, ufunc, method, *inputs, **kw):
+                if ufunc is not np.power:
+                    raise NotImplementedError
+                return "POWER!"
+        # explicit cast to float, to ensure the fast power path is taken.
+        a = np.array(5., dtype=np.float64).view(PowerOnly)
+        assert_equal(a ** 2.5, "POWER!")
+        with assert_raises(NotImplementedError):
+            a ** 0.5
+        with assert_raises(NotImplementedError):
+            a ** 0
+        with assert_raises(NotImplementedError):
+            a ** 1
+        with assert_raises(NotImplementedError):
+            a ** -1
+        with assert_raises(NotImplementedError):
+            a ** 2
+
+    def test_pow_array_object_dtype(self):
+        # test pow on arrays of object dtype
+        class SomeClass:
+            def __init__(self, num=None):
+                self.num = num
+
+            # want to ensure a fast pow path is not taken
+            def __mul__(self, other):
+                raise AssertionError('__mul__ should not be called')
+
+            def __div__(self, other):
+                raise AssertionError('__div__ should not be called')
+
+            def __pow__(self, exp):
+                return SomeClass(num=self.num ** exp)
+
+            def __eq__(self, other):
+                if isinstance(other, SomeClass):
+                    return self.num == other.num
+
+            __rpow__ = __pow__
+
+        def pow_for(exp, arr):
+            return np.array([x ** exp for x in arr])
+
+        obj_arr = np.array([SomeClass(1), SomeClass(2), SomeClass(3)])
+
+        assert_equal(obj_arr ** 0.5, pow_for(0.5, obj_arr))
+        assert_equal(obj_arr ** 0, pow_for(0, obj_arr))
+        assert_equal(obj_arr ** 1, pow_for(1, obj_arr))
+        assert_equal(obj_arr ** -1, pow_for(-1, obj_arr))
+        assert_equal(obj_arr ** 2, pow_for(2, obj_arr))
+
+    def test_pos_array_ufunc_override(self):
+        class A(np.ndarray):
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return getattr(ufunc, method)(*[i.view(np.ndarray) for
+                                                i in inputs], **kwargs)
+        tst = np.array('foo').view(A)
+        with assert_raises(TypeError):
+            +tst
+
+
+class TestTemporaryElide:
+    # elision is only triggered on relatively large arrays
+
+    def test_extension_incref_elide(self):
+        # test extension (e.g. cython) calling PyNumber_* slots without
+        # increasing the reference counts
+        #
+        # def incref_elide(a):
+        #    d = input.copy() # refcount 1
+        #    return d, d + d # PyNumber_Add without increasing refcount
+        from numpy.core._multiarray_tests import incref_elide
+        d = np.ones(100000)
+        orig, res = incref_elide(d)
+        d + d
+        # the return original should not be changed to an inplace operation
+        assert_array_equal(orig, d)
+        assert_array_equal(res, d + d)
+
+    def test_extension_incref_elide_stack(self):
+        # scanning if the refcount == 1 object is on the python stack to check
+        # that we are called directly from python is flawed as object may still
+        # be above the stack pointer and we have no access to the top of it
+        #
+        # def incref_elide_l(d):
+        #    return l[4] + l[4] # PyNumber_Add without increasing refcount
+        from numpy.core._multiarray_tests import incref_elide_l
+        # padding with 1 makes sure the object on the stack is not overwritten
+        l = [1, 1, 1, 1, np.ones(100000)]
+        res = incref_elide_l(l)
+        # the return original should not be changed to an inplace operation
+        assert_array_equal(l[4], np.ones(100000))
+        assert_array_equal(res, l[4] + l[4])
+
+    def test_temporary_with_cast(self):
+        # check that we don't elide into a temporary which would need casting
+        d = np.ones(200000, dtype=np.int64)
+        assert_equal(((d + d) + 2**222).dtype, np.dtype('O'))
+
+        r = ((d + d) / 2)
+        assert_equal(r.dtype, np.dtype('f8'))
+
+        r = np.true_divide((d + d), 2)
+        assert_equal(r.dtype, np.dtype('f8'))
+
+        r = ((d + d) / 2.)
+        assert_equal(r.dtype, np.dtype('f8'))
+
+        r = ((d + d) // 2)
+        assert_equal(r.dtype, np.dtype(np.int64))
+
+        # commutative elision into the astype result
+        f = np.ones(100000, dtype=np.float32)
+        assert_equal(((f + f) + f.astype(np.float64)).dtype, np.dtype('f8'))
+
+        # no elision into lower type
+        d = f.astype(np.float64)
+        assert_equal(((f + f) + d).dtype, d.dtype)
+        l = np.ones(100000, dtype=np.longdouble)
+        assert_equal(((d + d) + l).dtype, l.dtype)
+
+        # test unary abs with different output dtype
+        for dt in (np.complex64, np.complex128, np.clongdouble):
+            c = np.ones(100000, dtype=dt)
+            r = abs(c * 2.0)
+            assert_equal(r.dtype, np.dtype('f%d' % (c.itemsize // 2)))
+
+    def test_elide_broadcast(self):
+        # test no elision on broadcast to higher dimension
+        # only triggers elision code path in debug mode as triggering it in
+        # normal mode needs 256kb large matching dimension, so a lot of memory
+        d = np.ones((2000, 1), dtype=int)
+        b = np.ones((2000), dtype=bool)
+        r = (1 - d) + b
+        assert_equal(r, 1)
+        assert_equal(r.shape, (2000, 2000))
+
+    def test_elide_scalar(self):
+        # check inplace op does not create ndarray from scalars
+        a = np.bool_()
+        assert_(type(~(a & a)) is np.bool_)
+
+    def test_elide_scalar_readonly(self):
+        # The imaginary part of a real array is readonly. This needs to go
+        # through fast_scalar_power which is only called for powers of
+        # +1, -1, 0, 0.5, and 2, so use 2. Also need valid refcount for
+        # elision which can be gotten for the imaginary part of a real
+        # array. Should not error.
+        a = np.empty(100000, dtype=np.float64)
+        a.imag ** 2
+
+    def test_elide_readonly(self):
+        # don't try to elide readonly temporaries
+        r = np.asarray(np.broadcast_to(np.zeros(1), 100000).flat) * 0.0
+        assert_equal(r, 0)
+
+    def test_elide_updateifcopy(self):
+        a = np.ones(2**20)[::2]
+        b = a.flat.__array__() + 1
+        del b
+        assert_equal(a, 1)
+
+
+class TestCAPI:
+    def test_IsPythonScalar(self):
+        from numpy.core._multiarray_tests import IsPythonScalar
+        assert_(IsPythonScalar(b'foobar'))
+        assert_(IsPythonScalar(1))
+        assert_(IsPythonScalar(2**80))
+        assert_(IsPythonScalar(2.))
+        assert_(IsPythonScalar("a"))
+
+
+class TestSubscripting:
+    def test_test_zero_rank(self):
+        x = np.array([1, 2, 3])
+        assert_(isinstance(x[0], np.int_))
+        assert_(type(x[0, ...]) is np.ndarray)
+
+
+class TestPickling:
+    @pytest.mark.skipif(pickle.HIGHEST_PROTOCOL >= 5,
+                        reason=('this tests the error messages when trying to'
+                                'protocol 5 although it is not available'))
+    def test_correct_protocol5_error_message(self):
+        array = np.arange(10)
+
+        if sys.version_info[:2] in ((3, 6), (3, 7)):
+            # For the specific case of python3.6 and 3.7, raise a clear import
+            # error about the pickle5 backport when trying to use protocol=5
+            # without the pickle5 package
+            with pytest.raises(ImportError):
+                array.__reduce_ex__(5)
+
+        elif sys.version_info[:2] < (3, 6):
+            # when calling __reduce_ex__ explicitly with protocol=5 on python
+            # raise a ValueError saying that protocol 5 is not available for
+            # this python version
+            with pytest.raises(ValueError):
+                array.__reduce_ex__(5)
+
+    def test_record_array_with_object_dtype(self):
+        my_object = object()
+
+        arr_with_object = np.array(
+                [(my_object, 1, 2.0)],
+                dtype=[('a', object), ('b', int), ('c', float)])
+        arr_without_object = np.array(
+                [('xxx', 1, 2.0)],
+                dtype=[('a', str), ('b', int), ('c', float)])
+
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            depickled_arr_with_object = pickle.loads(
+                    pickle.dumps(arr_with_object, protocol=proto))
+            depickled_arr_without_object = pickle.loads(
+                    pickle.dumps(arr_without_object, protocol=proto))
+
+            assert_equal(arr_with_object.dtype,
+                         depickled_arr_with_object.dtype)
+            assert_equal(arr_without_object.dtype,
+                         depickled_arr_without_object.dtype)
+
+    @pytest.mark.skipif(pickle.HIGHEST_PROTOCOL < 5,
+                        reason="requires pickle protocol 5")
+    def test_f_contiguous_array(self):
+        f_contiguous_array = np.array([[1, 2, 3], [4, 5, 6]], order='F')
+        buffers = []
+
+        # When using pickle protocol 5, Fortran-contiguous arrays can be
+        # serialized using out-of-band buffers
+        bytes_string = pickle.dumps(f_contiguous_array, protocol=5,
+                                    buffer_callback=buffers.append)
+
+        assert len(buffers) > 0
+
+        depickled_f_contiguous_array = pickle.loads(bytes_string,
+                                                    buffers=buffers)
+
+        assert_equal(f_contiguous_array, depickled_f_contiguous_array)
+
+    def test_non_contiguous_array(self):
+        non_contiguous_array = np.arange(12).reshape(3, 4)[:, :2]
+        assert not non_contiguous_array.flags.c_contiguous
+        assert not non_contiguous_array.flags.f_contiguous
+
+        # make sure non-contiguous arrays can be pickled-depickled
+        # using any protocol
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            depickled_non_contiguous_array = pickle.loads(
+                    pickle.dumps(non_contiguous_array, protocol=proto))
+
+            assert_equal(non_contiguous_array, depickled_non_contiguous_array)
+
+    def test_roundtrip(self):
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            carray = np.array([[2, 9], [7, 0], [3, 8]])
+            DATA = [
+                carray,
+                np.transpose(carray),
+                np.array([('xxx', 1, 2.0)], dtype=[('a', (str, 3)), ('b', int),
+                                                   ('c', float)])
+            ]
+
+            refs = [weakref.ref(a) for a in DATA]
+            for a in DATA:
+                assert_equal(
+                        a, pickle.loads(pickle.dumps(a, protocol=proto)),
+                        err_msg="%r" % a)
+            del a, DATA, carray
+            break_cycles()
+            # check for reference leaks (gh-12793)
+            for ref in refs:
+                assert ref() is None
+
+    def _loads(self, obj):
+        return pickle.loads(obj, encoding='latin1')
+
+    # version 0 pickles, using protocol=2 to pickle
+    # version 0 doesn't have a version field
+    def test_version0_int8(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x04\x85cnumpy\ndtype\nq\x04U\x02i1K\x00K\x01\x87Rq\x05(U\x01|NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89U\x04\x01\x02\x03\x04tb.'
+        a = np.array([1, 2, 3, 4], dtype=np.int8)
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_version0_float32(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x04\x85cnumpy\ndtype\nq\x04U\x02f4K\x00K\x01\x87Rq\x05(U\x01<NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89U\x10\x00\x00\x80?\x00\x00\x00@\x00\x00@@\x00\x00\x80@tb.'
+        a = np.array([1.0, 2.0, 3.0, 4.0], dtype=np.float32)
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_version0_object(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x02\x85cnumpy\ndtype\nq\x04U\x02O8K\x00K\x01\x87Rq\x05(U\x01|NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89]q\x06(}q\x07U\x01aK\x01s}q\x08U\x01bK\x02setb.'
+        a = np.array([{'a': 1}, {'b': 2}])
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    # version 1 pickles, using protocol=2 to pickle
+    def test_version1_int8(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x01K\x04\x85cnumpy\ndtype\nq\x04U\x02i1K\x00K\x01\x87Rq\x05(K\x01U\x01|NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89U\x04\x01\x02\x03\x04tb.'
+        a = np.array([1, 2, 3, 4], dtype=np.int8)
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_version1_float32(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x01K\x04\x85cnumpy\ndtype\nq\x04U\x02f4K\x00K\x01\x87Rq\x05(K\x01U\x01<NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89U\x10\x00\x00\x80?\x00\x00\x00@\x00\x00@@\x00\x00\x80@tb.'
+        a = np.array([1.0, 2.0, 3.0, 4.0], dtype=np.float32)
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_version1_object(self):
+        s = b'\x80\x02cnumpy.core._internal\n_reconstruct\nq\x01cnumpy\nndarray\nq\x02K\x00\x85U\x01b\x87Rq\x03(K\x01K\x02\x85cnumpy\ndtype\nq\x04U\x02O8K\x00K\x01\x87Rq\x05(K\x01U\x01|NNJ\xff\xff\xff\xffJ\xff\xff\xff\xfftb\x89]q\x06(}q\x07U\x01aK\x01s}q\x08U\x01bK\x02setb.'
+        a = np.array([{'a': 1}, {'b': 2}])
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_subarray_int_shape(self):
+        s = b"cnumpy.core.multiarray\n_reconstruct\np0\n(cnumpy\nndarray\np1\n(I0\ntp2\nS'b'\np3\ntp4\nRp5\n(I1\n(I1\ntp6\ncnumpy\ndtype\np7\n(S'V6'\np8\nI0\nI1\ntp9\nRp10\n(I3\nS'|'\np11\nN(S'a'\np12\ng3\ntp13\n(dp14\ng12\n(g7\n(S'V4'\np15\nI0\nI1\ntp16\nRp17\n(I3\nS'|'\np18\n(g7\n(S'i1'\np19\nI0\nI1\ntp20\nRp21\n(I3\nS'|'\np22\nNNNI-1\nI-1\nI0\ntp23\nb(I2\nI2\ntp24\ntp25\nNNI4\nI1\nI0\ntp26\nbI0\ntp27\nsg3\n(g7\n(S'V2'\np28\nI0\nI1\ntp29\nRp30\n(I3\nS'|'\np31\n(g21\nI2\ntp32\nNNI2\nI1\nI0\ntp33\nbI4\ntp34\nsI6\nI1\nI0\ntp35\nbI00\nS'\\x01\\x01\\x01\\x01\\x01\\x02'\np36\ntp37\nb."
+        a = np.array([(1, (1, 2))], dtype=[('a', 'i1', (2, 2)), ('b', 'i1', 2)])
+        p = self._loads(s)
+        assert_equal(a, p)
+
+    def test_datetime64_byteorder(self):
+        original = np.array([['2015-02-24T00:00:00.000000000']], dtype='datetime64[ns]')
+
+        original_byte_reversed = original.copy(order='K')
+        original_byte_reversed.dtype = original_byte_reversed.dtype.newbyteorder('S')
+        original_byte_reversed.byteswap(inplace=True)
+
+        new = pickle.loads(pickle.dumps(original_byte_reversed))
+
+        assert_equal(original.dtype, new.dtype)
+
+
+class TestFancyIndexing:
+    def test_list(self):
+        x = np.ones((1, 1))
+        x[:, [0]] = 2.0
+        assert_array_equal(x, np.array([[2.0]]))
+
+        x = np.ones((1, 1, 1))
+        x[:, :, [0]] = 2.0
+        assert_array_equal(x, np.array([[[2.0]]]))
+
+    def test_tuple(self):
+        x = np.ones((1, 1))
+        x[:, (0,)] = 2.0
+        assert_array_equal(x, np.array([[2.0]]))
+        x = np.ones((1, 1, 1))
+        x[:, :, (0,)] = 2.0
+        assert_array_equal(x, np.array([[[2.0]]]))
+
+    def test_mask(self):
+        x = np.array([1, 2, 3, 4])
+        m = np.array([0, 1, 0, 0], bool)
+        assert_array_equal(x[m], np.array([2]))
+
+    def test_mask2(self):
+        x = np.array([[1, 2, 3, 4], [5, 6, 7, 8]])
+        m = np.array([0, 1], bool)
+        m2 = np.array([[0, 1, 0, 0], [1, 0, 0, 0]], bool)
+        m3 = np.array([[0, 1, 0, 0], [0, 0, 0, 0]], bool)
+        assert_array_equal(x[m], np.array([[5, 6, 7, 8]]))
+        assert_array_equal(x[m2], np.array([2, 5]))
+        assert_array_equal(x[m3], np.array([2]))
+
+    def test_assign_mask(self):
+        x = np.array([1, 2, 3, 4])
+        m = np.array([0, 1, 0, 0], bool)
+        x[m] = 5
+        assert_array_equal(x, np.array([1, 5, 3, 4]))
+
+    def test_assign_mask2(self):
+        xorig = np.array([[1, 2, 3, 4], [5, 6, 7, 8]])
+        m = np.array([0, 1], bool)
+        m2 = np.array([[0, 1, 0, 0], [1, 0, 0, 0]], bool)
+        m3 = np.array([[0, 1, 0, 0], [0, 0, 0, 0]], bool)
+        x = xorig.copy()
+        x[m] = 10
+        assert_array_equal(x, np.array([[1, 2, 3, 4], [10, 10, 10, 10]]))
+        x = xorig.copy()
+        x[m2] = 10
+        assert_array_equal(x, np.array([[1, 10, 3, 4], [10, 6, 7, 8]]))
+        x = xorig.copy()
+        x[m3] = 10
+        assert_array_equal(x, np.array([[1, 10, 3, 4], [5, 6, 7, 8]]))
+
+
+class TestStringCompare:
+    def test_string(self):
+        g1 = np.array(["This", "is", "example"])
+        g2 = np.array(["This", "was", "example"])
+        assert_array_equal(g1 == g2, [g1[i] == g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 != g2, [g1[i] != g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 <= g2, [g1[i] <= g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 >= g2, [g1[i] >= g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 < g2, [g1[i] < g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 > g2, [g1[i] > g2[i] for i in [0, 1, 2]])
+
+    def test_mixed(self):
+        g1 = np.array(["spam", "spa", "spammer", "and eggs"])
+        g2 = "spam"
+        assert_array_equal(g1 == g2, [x == g2 for x in g1])
+        assert_array_equal(g1 != g2, [x != g2 for x in g1])
+        assert_array_equal(g1 < g2, [x < g2 for x in g1])
+        assert_array_equal(g1 > g2, [x > g2 for x in g1])
+        assert_array_equal(g1 <= g2, [x <= g2 for x in g1])
+        assert_array_equal(g1 >= g2, [x >= g2 for x in g1])
+
+    def test_unicode(self):
+        g1 = np.array([u"This", u"is", u"example"])
+        g2 = np.array([u"This", u"was", u"example"])
+        assert_array_equal(g1 == g2, [g1[i] == g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 != g2, [g1[i] != g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 <= g2, [g1[i] <= g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 >= g2, [g1[i] >= g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 < g2,  [g1[i] < g2[i] for i in [0, 1, 2]])
+        assert_array_equal(g1 > g2,  [g1[i] > g2[i] for i in [0, 1, 2]])
+
+
+class TestArgmax:
+
+    nan_arr = [
+        ([0, 1, 2, 3, np.nan], 4),
+        ([0, 1, 2, np.nan, 3], 3),
+        ([np.nan, 0, 1, 2, 3], 0),
+        ([np.nan, 0, np.nan, 2, 3], 0),
+        ([0, 1, 2, 3, complex(0, np.nan)], 4),
+        ([0, 1, 2, 3, complex(np.nan, 0)], 4),
+        ([0, 1, 2, complex(np.nan, 0), 3], 3),
+        ([0, 1, 2, complex(0, np.nan), 3], 3),
+        ([complex(0, np.nan), 0, 1, 2, 3], 0),
+        ([complex(np.nan, np.nan), 0, 1, 2, 3], 0),
+        ([complex(np.nan, 0), complex(np.nan, 2), complex(np.nan, 1)], 0),
+        ([complex(np.nan, np.nan), complex(np.nan, 2), complex(np.nan, 1)], 0),
+        ([complex(np.nan, 0), complex(np.nan, 2), complex(np.nan, np.nan)], 0),
+
+        ([complex(0, 0), complex(0, 2), complex(0, 1)], 1),
+        ([complex(1, 0), complex(0, 2), complex(0, 1)], 0),
+        ([complex(1, 0), complex(0, 2), complex(1, 1)], 2),
+
+        ([np.datetime64('1923-04-14T12:43:12'),
+          np.datetime64('1994-06-21T14:43:15'),
+          np.datetime64('2001-10-15T04:10:32'),
+          np.datetime64('1995-11-25T16:02:16'),
+          np.datetime64('2005-01-04T03:14:12'),
+          np.datetime64('2041-12-03T14:05:03')], 5),
+        ([np.datetime64('1935-09-14T04:40:11'),
+          np.datetime64('1949-10-12T12:32:11'),
+          np.datetime64('2010-01-03T05:14:12'),
+          np.datetime64('2015-11-20T12:20:59'),
+          np.datetime64('1932-09-23T10:10:13'),
+          np.datetime64('2014-10-10T03:50:30')], 3),
+        # Assorted tests with NaTs
+        ([np.datetime64('NaT'),
+          np.datetime64('NaT'),
+          np.datetime64('2010-01-03T05:14:12'),
+          np.datetime64('NaT'),
+          np.datetime64('2015-09-23T10:10:13'),
+          np.datetime64('1932-10-10T03:50:30')], 0),
+        ([np.datetime64('2059-03-14T12:43:12'),
+          np.datetime64('1996-09-21T14:43:15'),
+          np.datetime64('NaT'),
+          np.datetime64('2022-12-25T16:02:16'),
+          np.datetime64('1963-10-04T03:14:12'),
+          np.datetime64('2013-05-08T18:15:23')], 2),
+        ([np.timedelta64(2, 's'),
+          np.timedelta64(1, 's'),
+          np.timedelta64('NaT', 's'),
+          np.timedelta64(3, 's')], 2),
+        ([np.timedelta64('NaT', 's')] * 3, 0),
+
+        ([timedelta(days=5, seconds=14), timedelta(days=2, seconds=35),
+          timedelta(days=-1, seconds=23)], 0),
+        ([timedelta(days=1, seconds=43), timedelta(days=10, seconds=5),
+          timedelta(days=5, seconds=14)], 1),
+        ([timedelta(days=10, seconds=24), timedelta(days=10, seconds=5),
+          timedelta(days=10, seconds=43)], 2),
+
+        ([False, False, False, False, True], 4),
+        ([False, False, False, True, False], 3),
+        ([True, False, False, False, False], 0),
+        ([True, False, True, False, False], 0),
+    ]
+
+    def test_all(self):
+        a = np.random.normal(0, 1, (4, 5, 6, 7, 8))
+        for i in range(a.ndim):
+            amax = a.max(i)
+            aargmax = a.argmax(i)
+            axes = list(range(a.ndim))
+            axes.remove(i)
+            assert_(np.all(amax == aargmax.choose(*a.transpose(i,*axes))))
+
+    def test_combinations(self):
+        for arr, pos in self.nan_arr:
+            with suppress_warnings() as sup:
+                sup.filter(RuntimeWarning,
+                           "invalid value encountered in reduce")
+                max_val = np.max(arr)
+
+            assert_equal(np.argmax(arr), pos, err_msg="%r" % arr)
+            assert_equal(arr[np.argmax(arr)], max_val, err_msg="%r" % arr)
+
+    def test_output_shape(self):
+        # see also gh-616
+        a = np.ones((10, 5))
+        # Check some simple shape mismatches
+        out = np.ones(11, dtype=np.int_)
+        assert_raises(ValueError, a.argmax, -1, out)
+
+        out = np.ones((2, 5), dtype=np.int_)
+        assert_raises(ValueError, a.argmax, -1, out)
+
+        # these could be relaxed possibly (used to allow even the previous)
+        out = np.ones((1, 10), dtype=np.int_)
+        assert_raises(ValueError, a.argmax, -1, out)
+
+        out = np.ones(10, dtype=np.int_)
+        a.argmax(-1, out=out)
+        assert_equal(out, a.argmax(-1))
+
+    def test_argmax_unicode(self):
+        d = np.zeros(6031, dtype='<U9')
+        d[5942] = "as"
+        assert_equal(d.argmax(), 5942)
+
+    def test_np_vs_ndarray(self):
+        # make sure both ndarray.argmax and numpy.argmax support out/axis args
+        a = np.random.normal(size=(2,3))
+
+        # check positional args
+        out1 = np.zeros(2, dtype=int)
+        out2 = np.zeros(2, dtype=int)
+        assert_equal(a.argmax(1, out1), np.argmax(a, 1, out2))
+        assert_equal(out1, out2)
+
+        # check keyword args
+        out1 = np.zeros(3, dtype=int)
+        out2 = np.zeros(3, dtype=int)
+        assert_equal(a.argmax(out=out1, axis=0), np.argmax(a, out=out2, axis=0))
+        assert_equal(out1, out2)
+
+    @pytest.mark.leaks_references(reason="replaces None with NULL.")
+    def test_object_argmax_with_NULLs(self):
+        # See gh-6032
+        a = np.empty(4, dtype='O')
+        ctypes.memset(a.ctypes.data, 0, a.nbytes)
+        assert_equal(a.argmax(), 0)
+        a[3] = 10
+        assert_equal(a.argmax(), 3)
+        a[1] = 30
+        assert_equal(a.argmax(), 1)
+
+
+class TestArgmin:
+
+    nan_arr = [
+        ([0, 1, 2, 3, np.nan], 4),
+        ([0, 1, 2, np.nan, 3], 3),
+        ([np.nan, 0, 1, 2, 3], 0),
+        ([np.nan, 0, np.nan, 2, 3], 0),
+        ([0, 1, 2, 3, complex(0, np.nan)], 4),
+        ([0, 1, 2, 3, complex(np.nan, 0)], 4),
+        ([0, 1, 2, complex(np.nan, 0), 3], 3),
+        ([0, 1, 2, complex(0, np.nan), 3], 3),
+        ([complex(0, np.nan), 0, 1, 2, 3], 0),
+        ([complex(np.nan, np.nan), 0, 1, 2, 3], 0),
+        ([complex(np.nan, 0), complex(np.nan, 2), complex(np.nan, 1)], 0),
+        ([complex(np.nan, np.nan), complex(np.nan, 2), complex(np.nan, 1)], 0),
+        ([complex(np.nan, 0), complex(np.nan, 2), complex(np.nan, np.nan)], 0),
+
+        ([complex(0, 0), complex(0, 2), complex(0, 1)], 0),
+        ([complex(1, 0), complex(0, 2), complex(0, 1)], 2),
+        ([complex(1, 0), complex(0, 2), complex(1, 1)], 1),
+
+        ([np.datetime64('1923-04-14T12:43:12'),
+          np.datetime64('1994-06-21T14:43:15'),
+          np.datetime64('2001-10-15T04:10:32'),
+          np.datetime64('1995-11-25T16:02:16'),
+          np.datetime64('2005-01-04T03:14:12'),
+          np.datetime64('2041-12-03T14:05:03')], 0),
+        ([np.datetime64('1935-09-14T04:40:11'),
+          np.datetime64('1949-10-12T12:32:11'),
+          np.datetime64('2010-01-03T05:14:12'),
+          np.datetime64('2014-11-20T12:20:59'),
+          np.datetime64('2015-09-23T10:10:13'),
+          np.datetime64('1932-10-10T03:50:30')], 5),
+        # Assorted tests with NaTs
+        ([np.datetime64('NaT'),
+          np.datetime64('NaT'),
+          np.datetime64('2010-01-03T05:14:12'),
+          np.datetime64('NaT'),
+          np.datetime64('2015-09-23T10:10:13'),
+          np.datetime64('1932-10-10T03:50:30')], 0),
+        ([np.datetime64('2059-03-14T12:43:12'),
+          np.datetime64('1996-09-21T14:43:15'),
+          np.datetime64('NaT'),
+          np.datetime64('2022-12-25T16:02:16'),
+          np.datetime64('1963-10-04T03:14:12'),
+          np.datetime64('2013-05-08T18:15:23')], 2),
+        ([np.timedelta64(2, 's'),
+          np.timedelta64(1, 's'),
+          np.timedelta64('NaT', 's'),
+          np.timedelta64(3, 's')], 2),
+        ([np.timedelta64('NaT', 's')] * 3, 0),
+
+        ([timedelta(days=5, seconds=14), timedelta(days=2, seconds=35),
+          timedelta(days=-1, seconds=23)], 2),
+        ([timedelta(days=1, seconds=43), timedelta(days=10, seconds=5),
+          timedelta(days=5, seconds=14)], 0),
+        ([timedelta(days=10, seconds=24), timedelta(days=10, seconds=5),
+          timedelta(days=10, seconds=43)], 1),
+
+        ([True, True, True, True, False], 4),
+        ([True, True, True, False, True], 3),
+        ([False, True, True, True, True], 0),
+        ([False, True, False, True, True], 0),
+    ]
+
+    def test_all(self):
+        a = np.random.normal(0, 1, (4, 5, 6, 7, 8))
+        for i in range(a.ndim):
+            amin = a.min(i)
+            aargmin = a.argmin(i)
+            axes = list(range(a.ndim))
+            axes.remove(i)
+            assert_(np.all(amin == aargmin.choose(*a.transpose(i,*axes))))
+
+    def test_combinations(self):
+        for arr, pos in self.nan_arr:
+            with suppress_warnings() as sup:
+                sup.filter(RuntimeWarning,
+                           "invalid value encountered in reduce")
+                min_val = np.min(arr)
+
+            assert_equal(np.argmin(arr), pos, err_msg="%r" % arr)
+            assert_equal(arr[np.argmin(arr)], min_val, err_msg="%r" % arr)
+
+    def test_minimum_signed_integers(self):
+
+        a = np.array([1, -2**7, -2**7 + 1], dtype=np.int8)
+        assert_equal(np.argmin(a), 1)
+
+        a = np.array([1, -2**15, -2**15 + 1], dtype=np.int16)
+        assert_equal(np.argmin(a), 1)
+
+        a = np.array([1, -2**31, -2**31 + 1], dtype=np.int32)
+        assert_equal(np.argmin(a), 1)
+
+        a = np.array([1, -2**63, -2**63 + 1], dtype=np.int64)
+        assert_equal(np.argmin(a), 1)
+
+    def test_output_shape(self):
+        # see also gh-616
+        a = np.ones((10, 5))
+        # Check some simple shape mismatches
+        out = np.ones(11, dtype=np.int_)
+        assert_raises(ValueError, a.argmin, -1, out)
+
+        out = np.ones((2, 5), dtype=np.int_)
+        assert_raises(ValueError, a.argmin, -1, out)
+
+        # these could be relaxed possibly (used to allow even the previous)
+        out = np.ones((1, 10), dtype=np.int_)
+        assert_raises(ValueError, a.argmin, -1, out)
+
+        out = np.ones(10, dtype=np.int_)
+        a.argmin(-1, out=out)
+        assert_equal(out, a.argmin(-1))
+
+    def test_argmin_unicode(self):
+        d = np.ones(6031, dtype='<U9')
+        d[6001] = "0"
+        assert_equal(d.argmin(), 6001)
+
+    def test_np_vs_ndarray(self):
+        # make sure both ndarray.argmin and numpy.argmin support out/axis args
+        a = np.random.normal(size=(2, 3))
+
+        # check positional args
+        out1 = np.zeros(2, dtype=int)
+        out2 = np.ones(2, dtype=int)
+        assert_equal(a.argmin(1, out1), np.argmin(a, 1, out2))
+        assert_equal(out1, out2)
+
+        # check keyword args
+        out1 = np.zeros(3, dtype=int)
+        out2 = np.ones(3, dtype=int)
+        assert_equal(a.argmin(out=out1, axis=0), np.argmin(a, out=out2, axis=0))
+        assert_equal(out1, out2)
+
+    @pytest.mark.leaks_references(reason="replaces None with NULL.")
+    def test_object_argmin_with_NULLs(self):
+        # See gh-6032
+        a = np.empty(4, dtype='O')
+        ctypes.memset(a.ctypes.data, 0, a.nbytes)
+        assert_equal(a.argmin(), 0)
+        a[3] = 30
+        assert_equal(a.argmin(), 3)
+        a[1] = 10
+        assert_equal(a.argmin(), 1)
+
+
+class TestMinMax:
+
+    def test_scalar(self):
+        assert_raises(np.AxisError, np.amax, 1, 1)
+        assert_raises(np.AxisError, np.amin, 1, 1)
+
+        assert_equal(np.amax(1, axis=0), 1)
+        assert_equal(np.amin(1, axis=0), 1)
+        assert_equal(np.amax(1, axis=None), 1)
+        assert_equal(np.amin(1, axis=None), 1)
+
+    def test_axis(self):
+        assert_raises(np.AxisError, np.amax, [1, 2, 3], 1000)
+        assert_equal(np.amax([[1, 2, 3]], axis=1), 3)
+
+    def test_datetime(self):
+        # Do not ignore NaT
+        for dtype in ('m8[s]', 'm8[Y]'):
+            a = np.arange(10).astype(dtype)
+            assert_equal(np.amin(a), a[0])
+            assert_equal(np.amax(a), a[9])
+            a[3] = 'NaT'
+            assert_equal(np.amin(a), a[3])
+            assert_equal(np.amax(a), a[3])
+
+
+class TestNewaxis:
+    def test_basic(self):
+        sk = np.array([0, -0.1, 0.1])
+        res = 250*sk[:, np.newaxis]
+        assert_almost_equal(res.ravel(), 250*sk)
+
+
+class TestClip:
+    def _check_range(self, x, cmin, cmax):
+        assert_(np.all(x >= cmin))
+        assert_(np.all(x <= cmax))
+
+    def _clip_type(self, type_group, array_max,
+                   clip_min, clip_max, inplace=False,
+                   expected_min=None, expected_max=None):
+        if expected_min is None:
+            expected_min = clip_min
+        if expected_max is None:
+            expected_max = clip_max
+
+        for T in np.sctypes[type_group]:
+            if sys.byteorder == 'little':
+                byte_orders = ['=', '>']
+            else:
+                byte_orders = ['<', '=']
+
+            for byteorder in byte_orders:
+                dtype = np.dtype(T).newbyteorder(byteorder)
+
+                x = (np.random.random(1000) * array_max).astype(dtype)
+                if inplace:
+                    # The tests that call us pass clip_min and clip_max that
+                    # might not fit in the destination dtype. They were written
+                    # assuming the previous unsafe casting, which now must be
+                    # passed explicitly to avoid a warning.
+                    x.clip(clip_min, clip_max, x, casting='unsafe')
+                else:
+                    x = x.clip(clip_min, clip_max)
+                    byteorder = '='
+
+                if x.dtype.byteorder == '|':
+                    byteorder = '|'
+                assert_equal(x.dtype.byteorder, byteorder)
+                self._check_range(x, expected_min, expected_max)
+        return x
+
+    def test_basic(self):
+        for inplace in [False, True]:
+            self._clip_type(
+                'float', 1024, -12.8, 100.2, inplace=inplace)
+            self._clip_type(
+                'float', 1024, 0, 0, inplace=inplace)
+
+            self._clip_type(
+                'int', 1024, -120, 100, inplace=inplace)
+            self._clip_type(
+                'int', 1024, 0, 0, inplace=inplace)
+
+            self._clip_type(
+                'uint', 1024, 0, 0, inplace=inplace)
+            self._clip_type(
+                'uint', 1024, -120, 100, inplace=inplace, expected_min=0)
+
+    def test_record_array(self):
+        rec = np.array([(-5, 2.0, 3.0), (5.0, 4.0, 3.0)],
+                       dtype=[('x', '<f8'), ('y', '<f8'), ('z', '<f8')])
+        y = rec['x'].clip(-0.3, 0.5)
+        self._check_range(y, -0.3, 0.5)
+
+    def test_max_or_min(self):
+        val = np.array([0, 1, 2, 3, 4, 5, 6, 7])
+        x = val.clip(3)
+        assert_(np.all(x >= 3))
+        x = val.clip(min=3)
+        assert_(np.all(x >= 3))
+        x = val.clip(max=4)
+        assert_(np.all(x <= 4))
+
+    def test_nan(self):
+        input_arr = np.array([-2., np.nan, 0.5, 3., 0.25, np.nan])
+        result = input_arr.clip(-1, 1)
+        expected = np.array([-1., np.nan, 0.5, 1., 0.25, np.nan])
+        assert_array_equal(result, expected)
+
+
+class TestCompress:
+    def test_axis(self):
+        tgt = [[5, 6, 7, 8, 9]]
+        arr = np.arange(10).reshape(2, 5)
+        out = np.compress([0, 1], arr, axis=0)
+        assert_equal(out, tgt)
+
+        tgt = [[1, 3], [6, 8]]
+        out = np.compress([0, 1, 0, 1, 0], arr, axis=1)
+        assert_equal(out, tgt)
+
+    def test_truncate(self):
+        tgt = [[1], [6]]
+        arr = np.arange(10).reshape(2, 5)
+        out = np.compress([0, 1], arr, axis=1)
+        assert_equal(out, tgt)
+
+    def test_flatten(self):
+        arr = np.arange(10).reshape(2, 5)
+        out = np.compress([0, 1], arr)
+        assert_equal(out, 1)
+
+
+class TestPutmask:
+    def tst_basic(self, x, T, mask, val):
+        np.putmask(x, mask, val)
+        assert_equal(x[mask], np.array(val, T))
+
+    def test_ip_types(self):
+        unchecked_types = [bytes, str, np.void]
+
+        x = np.random.random(1000)*100
+        mask = x < 40
+
+        for val in [-100, 0, 15]:
+            for types in np.sctypes.values():
+                for T in types:
+                    if T not in unchecked_types:
+                        self.tst_basic(x.copy().astype(T), T, mask, val)
+
+            # Also test string of a length which uses an untypical length
+            dt = np.dtype("S3")
+            self.tst_basic(x.astype(dt), dt.type, mask, dt.type(val)[:3])
+
+    def test_mask_size(self):
+        assert_raises(ValueError, np.putmask, np.array([1, 2, 3]), [True], 5)
+
+    @pytest.mark.parametrize('dtype', ('>i4', '<i4'))
+    def test_byteorder(self, dtype):
+        x = np.array([1, 2, 3], dtype)
+        np.putmask(x, [True, False, True], -1)
+        assert_array_equal(x, [-1, 2, -1])
+
+    def test_record_array(self):
+        # Note mixed byteorder.
+        rec = np.array([(-5, 2.0, 3.0), (5.0, 4.0, 3.0)],
+                      dtype=[('x', '<f8'), ('y', '>f8'), ('z', '<f8')])
+        np.putmask(rec['x'], [True, False], 10)
+        assert_array_equal(rec['x'], [10, 5])
+        assert_array_equal(rec['y'], [2, 4])
+        assert_array_equal(rec['z'], [3, 3])
+        np.putmask(rec['y'], [True, False], 11)
+        assert_array_equal(rec['x'], [10, 5])
+        assert_array_equal(rec['y'], [11, 4])
+        assert_array_equal(rec['z'], [3, 3])
+
+    def test_overlaps(self):
+        # gh-6272 check overlap
+        x = np.array([True, False, True, False])
+        np.putmask(x[1:4], [True, True, True], x[:3])
+        assert_equal(x, np.array([True, True, False, True]))
+
+        x = np.array([True, False, True, False])
+        np.putmask(x[1:4], x[:3], [True, False, True])
+        assert_equal(x, np.array([True, True, True, True]))
+
+
+class TestTake:
+    def tst_basic(self, x):
+        ind = list(range(x.shape[0]))
+        assert_array_equal(x.take(ind, axis=0), x)
+
+    def test_ip_types(self):
+        unchecked_types = [bytes, str, np.void]
+
+        x = np.random.random(24)*100
+        x.shape = 2, 3, 4
+        for types in np.sctypes.values():
+            for T in types:
+                if T not in unchecked_types:
+                    self.tst_basic(x.copy().astype(T))
+
+            # Also test string of a length which uses an untypical length
+            self.tst_basic(x.astype("S3"))
+
+    def test_raise(self):
+        x = np.random.random(24)*100
+        x.shape = 2, 3, 4
+        assert_raises(IndexError, x.take, [0, 1, 2], axis=0)
+        assert_raises(IndexError, x.take, [-3], axis=0)
+        assert_array_equal(x.take([-1], axis=0)[0], x[1])
+
+    def test_clip(self):
+        x = np.random.random(24)*100
+        x.shape = 2, 3, 4
+        assert_array_equal(x.take([-1], axis=0, mode='clip')[0], x[0])
+        assert_array_equal(x.take([2], axis=0, mode='clip')[0], x[1])
+
+    def test_wrap(self):
+        x = np.random.random(24)*100
+        x.shape = 2, 3, 4
+        assert_array_equal(x.take([-1], axis=0, mode='wrap')[0], x[1])
+        assert_array_equal(x.take([2], axis=0, mode='wrap')[0], x[0])
+        assert_array_equal(x.take([3], axis=0, mode='wrap')[0], x[1])
+
+    @pytest.mark.parametrize('dtype', ('>i4', '<i4'))
+    def test_byteorder(self, dtype):
+        x = np.array([1, 2, 3], dtype)
+        assert_array_equal(x.take([0, 2, 1]), [1, 3, 2])
+
+    def test_record_array(self):
+        # Note mixed byteorder.
+        rec = np.array([(-5, 2.0, 3.0), (5.0, 4.0, 3.0)],
+                      dtype=[('x', '<f8'), ('y', '>f8'), ('z', '<f8')])
+        rec1 = rec.take([1])
+        assert_(rec1['x'] == 5.0 and rec1['y'] == 4.0)
+
+    def test_out_overlap(self):
+        # gh-6272 check overlap on out
+        x = np.arange(5)
+        y = np.take(x, [1, 2, 3], out=x[2:5], mode='wrap')
+        assert_equal(y, np.array([1, 2, 3]))
+
+class TestLexsort:
+    @pytest.mark.parametrize('dtype',[
+        np.uint8, np.uint16, np.uint32, np.uint64,
+        np.int8, np.int16, np.int32, np.int64,
+        np.float16, np.float32, np.float64
+    ])
+    def test_basic(self, dtype):
+        a = np.array([1, 2, 1, 3, 1, 5], dtype=dtype)
+        b = np.array([0, 4, 5, 6, 2, 3], dtype=dtype)
+        idx = np.lexsort((b, a))
+        expected_idx = np.array([0, 4, 2, 1, 3, 5])
+        assert_array_equal(idx, expected_idx)
+        assert_array_equal(a[idx], np.sort(a))
+
+    def test_mixed(self):
+        a = np.array([1, 2, 1, 3, 1, 5])
+        b = np.array([0, 4, 5, 6, 2, 3], dtype='datetime64[D]')
+
+        idx = np.lexsort((b, a))
+        expected_idx = np.array([0, 4, 2, 1, 3, 5])
+        assert_array_equal(idx, expected_idx)
+
+    def test_datetime(self):
+        a = np.array([0,0,0], dtype='datetime64[D]')
+        b = np.array([2,1,0], dtype='datetime64[D]')
+        idx = np.lexsort((b, a))
+        expected_idx = np.array([2, 1, 0])
+        assert_array_equal(idx, expected_idx)
+
+        a = np.array([0,0,0], dtype='timedelta64[D]')
+        b = np.array([2,1,0], dtype='timedelta64[D]')
+        idx = np.lexsort((b, a))
+        expected_idx = np.array([2, 1, 0])
+        assert_array_equal(idx, expected_idx)
+
+    def test_object(self):  # gh-6312
+        a = np.random.choice(10, 1000)
+        b = np.random.choice(['abc', 'xy', 'wz', 'efghi', 'qwst', 'x'], 1000)
+
+        for u in a, b:
+            left = np.lexsort((u.astype('O'),))
+            right = np.argsort(u, kind='mergesort')
+            assert_array_equal(left, right)
+
+        for u, v in (a, b), (b, a):
+            idx = np.lexsort((u, v))
+            assert_array_equal(idx, np.lexsort((u.astype('O'), v)))
+            assert_array_equal(idx, np.lexsort((u, v.astype('O'))))
+            u, v = np.array(u, dtype='object'), np.array(v, dtype='object')
+            assert_array_equal(idx, np.lexsort((u, v)))
+
+    def test_invalid_axis(self): # gh-7528
+        x = np.linspace(0., 1., 42*3).reshape(42, 3)
+        assert_raises(np.AxisError, np.lexsort, x, axis=2)
+
+class TestIO:
+    """Test tofile, fromfile, tobytes, and fromstring"""
+
+    def setup(self):
+        shape = (2, 4, 3)
+        rand = np.random.random
+        self.x = rand(shape) + rand(shape).astype(complex)*1j
+        self.x[0,:, 1] = [np.nan, np.inf, -np.inf, np.nan]
+        self.dtype = self.x.dtype
+        self.tempdir = tempfile.mkdtemp()
+        self.filename = tempfile.mktemp(dir=self.tempdir)
+
+    def teardown(self):
+        shutil.rmtree(self.tempdir)
+
+    def test_nofile(self):
+        # this should probably be supported as a file
+        # but for now test for proper errors
+        b = io.BytesIO()
+        assert_raises(IOError, np.fromfile, b, np.uint8, 80)
+        d = np.ones(7)
+        assert_raises(IOError, lambda x: x.tofile(b), d)
+
+    def test_bool_fromstring(self):
+        v = np.array([True, False, True, False], dtype=np.bool_)
+        y = np.fromstring('1 0 -2.3 0.0', sep=' ', dtype=np.bool_)
+        assert_array_equal(v, y)
+
+    def test_uint64_fromstring(self):
+        d = np.fromstring("9923372036854775807 104783749223640",
+                          dtype=np.uint64, sep=' ')
+        e = np.array([9923372036854775807, 104783749223640], dtype=np.uint64)
+        assert_array_equal(d, e)
+
+    def test_int64_fromstring(self):
+        d = np.fromstring("-25041670086757 104783749223640",
+                          dtype=np.int64, sep=' ')
+        e = np.array([-25041670086757, 104783749223640], dtype=np.int64)
+        assert_array_equal(d, e)
+
+    def test_empty_files_binary(self):
+        with open(self.filename, 'w') as f:
+            pass
+        y = np.fromfile(self.filename)
+        assert_(y.size == 0, "Array not empty")
+
+    def test_empty_files_text(self):
+        with open(self.filename, 'wb') as f:
+            pass
+        y = np.fromfile(self.filename, sep=" ")
+        assert_(y.size == 0, "Array not empty")
+
+    def test_roundtrip_file(self):
+        with open(self.filename, 'wb') as f:
+            self.x.tofile(f)
+        # NB. doesn't work with flush+seek, due to use of C stdio
+        with open(self.filename, 'rb') as f:
+            y = np.fromfile(f, dtype=self.dtype)
+        assert_array_equal(y, self.x.flat)
+
+    def test_roundtrip_filename(self):
+        self.x.tofile(self.filename)
+        y = np.fromfile(self.filename, dtype=self.dtype)
+        assert_array_equal(y, self.x.flat)
+
+    def test_roundtrip_pathlib(self):
+        p = pathlib.Path(self.filename)
+        self.x.tofile(p)
+        y = np.fromfile(p, dtype=self.dtype)
+        assert_array_equal(y, self.x.flat)
+
+    def test_roundtrip_dump_pathlib(self):
+        p = pathlib.Path(self.filename)
+        self.x.dump(p)
+        y = np.load(p, allow_pickle=True)
+        assert_array_equal(y, self.x)
+
+    def test_roundtrip_binary_str(self):
+        s = self.x.tobytes()
+        y = np.frombuffer(s, dtype=self.dtype)
+        assert_array_equal(y, self.x.flat)
+
+        s = self.x.tobytes('F')
+        y = np.frombuffer(s, dtype=self.dtype)
+        assert_array_equal(y, self.x.flatten('F'))
+
+    def test_roundtrip_str(self):
+        x = self.x.real.ravel()
+        s = "@".join(map(str, x))
+        y = np.fromstring(s, sep="@")
+        # NB. str imbues less precision
+        nan_mask = ~np.isfinite(x)
+        assert_array_equal(x[nan_mask], y[nan_mask])
+        assert_array_almost_equal(x[~nan_mask], y[~nan_mask], decimal=5)
+
+    def test_roundtrip_repr(self):
+        x = self.x.real.ravel()
+        s = "@".join(map(repr, x))
+        y = np.fromstring(s, sep="@")
+        assert_array_equal(x, y)
+
+    def test_unseekable_fromfile(self):
+        # gh-6246
+        self.x.tofile(self.filename)
+
+        def fail(*args, **kwargs):
+            raise IOError('Can not tell or seek')
+
+        with io.open(self.filename, 'rb', buffering=0) as f:
+            f.seek = fail
+            f.tell = fail
+            assert_raises(IOError, np.fromfile, f, dtype=self.dtype)
+
+    def test_io_open_unbuffered_fromfile(self):
+        # gh-6632
+        self.x.tofile(self.filename)
+        with io.open(self.filename, 'rb', buffering=0) as f:
+            y = np.fromfile(f, dtype=self.dtype)
+            assert_array_equal(y, self.x.flat)
+
+    def test_largish_file(self):
+        # check the fallocate path on files > 16MB
+        d = np.zeros(4 * 1024 ** 2)
+        d.tofile(self.filename)
+        assert_equal(os.path.getsize(self.filename), d.nbytes)
+        assert_array_equal(d, np.fromfile(self.filename))
+        # check offset
+        with open(self.filename, "r+b") as f:
+            f.seek(d.nbytes)
+            d.tofile(f)
+            assert_equal(os.path.getsize(self.filename), d.nbytes * 2)
+        # check append mode (gh-8329)
+        open(self.filename, "w").close() # delete file contents
+        with open(self.filename, "ab") as f:
+            d.tofile(f)
+        assert_array_equal(d, np.fromfile(self.filename))
+        with open(self.filename, "ab") as f:
+            d.tofile(f)
+        assert_equal(os.path.getsize(self.filename), d.nbytes * 2)
+
+    def test_io_open_buffered_fromfile(self):
+        # gh-6632
+        self.x.tofile(self.filename)
+        with io.open(self.filename, 'rb', buffering=-1) as f:
+            y = np.fromfile(f, dtype=self.dtype)
+        assert_array_equal(y, self.x.flat)
+
+    def test_file_position_after_fromfile(self):
+        # gh-4118
+        sizes = [io.DEFAULT_BUFFER_SIZE//8,
+                 io.DEFAULT_BUFFER_SIZE,
+                 io.DEFAULT_BUFFER_SIZE*8]
+
+        for size in sizes:
+            with open(self.filename, 'wb') as f:
+                f.seek(size-1)
+                f.write(b'\0')
+
+            for mode in ['rb', 'r+b']:
+                err_msg = "%d %s" % (size, mode)
+
+                with open(self.filename, mode) as f:
+                    f.read(2)
+                    np.fromfile(f, dtype=np.float64, count=1)
+                    pos = f.tell()
+                assert_equal(pos, 10, err_msg=err_msg)
+
+    def test_file_position_after_tofile(self):
+        # gh-4118
+        sizes = [io.DEFAULT_BUFFER_SIZE//8,
+                 io.DEFAULT_BUFFER_SIZE,
+                 io.DEFAULT_BUFFER_SIZE*8]
+
+        for size in sizes:
+            err_msg = "%d" % (size,)
+
+            with open(self.filename, 'wb') as f:
+                f.seek(size-1)
+                f.write(b'\0')
+                f.seek(10)
+                f.write(b'12')
+                np.array([0], dtype=np.float64).tofile(f)
+                pos = f.tell()
+            assert_equal(pos, 10 + 2 + 8, err_msg=err_msg)
+
+            with open(self.filename, 'r+b') as f:
+                f.read(2)
+                f.seek(0, 1)  # seek between read&write required by ANSI C
+                np.array([0], dtype=np.float64).tofile(f)
+                pos = f.tell()
+            assert_equal(pos, 10, err_msg=err_msg)
+
+    def test_load_object_array_fromfile(self):
+        # gh-12300
+        with open(self.filename, 'w') as f:
+            # Ensure we have a file with consistent contents
+            pass
+
+        with open(self.filename, 'rb') as f:
+            assert_raises_regex(ValueError, "Cannot read into object array",
+                                np.fromfile, f, dtype=object)
+
+        assert_raises_regex(ValueError, "Cannot read into object array",
+                            np.fromfile, self.filename, dtype=object)
+
+    def test_fromfile_offset(self):
+        with open(self.filename, 'wb') as f:
+            self.x.tofile(f)
+
+        with open(self.filename, 'rb') as f:
+            y = np.fromfile(f, dtype=self.dtype, offset=0)
+            assert_array_equal(y, self.x.flat)
+
+        with open(self.filename, 'rb') as f:
+            count_items = len(self.x.flat) // 8
+            offset_items = len(self.x.flat) // 4
+            offset_bytes = self.dtype.itemsize * offset_items
+            y = np.fromfile(f, dtype=self.dtype, count=count_items, offset=offset_bytes)
+            assert_array_equal(y, self.x.flat[offset_items:offset_items+count_items])
+
+            # subsequent seeks should stack
+            offset_bytes = self.dtype.itemsize
+            z = np.fromfile(f, dtype=self.dtype, offset=offset_bytes)
+            assert_array_equal(z, self.x.flat[offset_items+count_items+1:])
+
+        with open(self.filename, 'wb') as f:
+            self.x.tofile(f, sep=",")
+
+        with open(self.filename, 'rb') as f:
+            assert_raises_regex(
+                    TypeError,
+                    "'offset' argument only permitted for binary files",
+                    np.fromfile, self.filename, dtype=self.dtype,
+                    sep=",", offset=1)
+
+    def _check_from(self, s, value, **kw):
+        if 'sep' not in kw:
+            y = np.frombuffer(s, **kw)
+        else:
+            y = np.fromstring(s, **kw)
+        assert_array_equal(y, value)
+
+        with open(self.filename, 'wb') as f:
+            f.write(s)
+        y = np.fromfile(self.filename, **kw)
+        assert_array_equal(y, value)
+
+    def test_nan(self):
+        self._check_from(
+            b"nan +nan -nan NaN nan(foo) +NaN(BAR) -NAN(q_u_u_x_)",
+            [np.nan, np.nan, np.nan, np.nan, np.nan, np.nan, np.nan],
+            sep=' ')
+
+    def test_inf(self):
+        self._check_from(
+            b"inf +inf -inf infinity -Infinity iNfInItY -inF",
+            [np.inf, np.inf, -np.inf, np.inf, -np.inf, np.inf, -np.inf],
+            sep=' ')
+
+    def test_numbers(self):
+        self._check_from(b"1.234 -1.234 .3 .3e55 -123133.1231e+133",
+                         [1.234, -1.234, .3, .3e55, -123133.1231e+133], sep=' ')
+
+    def test_binary(self):
+        self._check_from(b'\x00\x00\x80?\x00\x00\x00@\x00\x00@@\x00\x00\x80@',
+                         np.array([1, 2, 3, 4]),
+                         dtype='<f4')
+
+    @pytest.mark.slow  # takes > 1 minute on mechanical hard drive
+    def test_big_binary(self):
+        """Test workarounds for 32-bit limited fwrite, fseek, and ftell
+        calls in windows. These normally would hang doing something like this.
+        See http://projects.scipy.org/numpy/ticket/1660"""
+        if sys.platform != 'win32':
+            return
+        try:
+            # before workarounds, only up to 2**32-1 worked
+            fourgbplus = 2**32 + 2**16
+            testbytes = np.arange(8, dtype=np.int8)
+            n = len(testbytes)
+            flike = tempfile.NamedTemporaryFile()
+            f = flike.file
+            np.tile(testbytes, fourgbplus // testbytes.nbytes).tofile(f)
+            flike.seek(0)
+            a = np.fromfile(f, dtype=np.int8)
+            flike.close()
+            assert_(len(a) == fourgbplus)
+            # check only start and end for speed:
+            assert_((a[:n] == testbytes).all())
+            assert_((a[-n:] == testbytes).all())
+        except (MemoryError, ValueError):
+            pass
+
+    def test_string(self):
+        self._check_from(b'1,2,3,4', [1., 2., 3., 4.], sep=',')
+
+    def test_counted_string(self):
+        self._check_from(b'1,2,3,4', [1., 2., 3., 4.], count=4, sep=',')
+        self._check_from(b'1,2,3,4', [1., 2., 3.], count=3, sep=',')
+        self._check_from(b'1,2,3,4', [1., 2., 3., 4.], count=-1, sep=',')
+
+    def test_string_with_ws(self):
+        self._check_from(b'1 2  3     4   ', [1, 2, 3, 4], dtype=int, sep=' ')
+
+    def test_counted_string_with_ws(self):
+        self._check_from(b'1 2  3     4   ', [1, 2, 3], count=3, dtype=int,
+                         sep=' ')
+
+    def test_ascii(self):
+        self._check_from(b'1 , 2 , 3 , 4', [1., 2., 3., 4.], sep=',')
+        self._check_from(b'1,2,3,4', [1., 2., 3., 4.], dtype=float, sep=',')
+
+    def test_malformed(self):
+        with assert_warns(DeprecationWarning):
+            self._check_from(b'1.234 1,234', [1.234, 1.], sep=' ')
+
+    def test_long_sep(self):
+        self._check_from(b'1_x_3_x_4_x_5', [1, 3, 4, 5], sep='_x_')
+
+    def test_dtype(self):
+        v = np.array([1, 2, 3, 4], dtype=np.int_)
+        self._check_from(b'1,2,3,4', v, sep=',', dtype=np.int_)
+
+    def test_dtype_bool(self):
+        # can't use _check_from because fromstring can't handle True/False
+        v = np.array([True, False, True, False], dtype=np.bool_)
+        s = b'1,0,-2.3,0'
+        with open(self.filename, 'wb') as f:
+            f.write(s)
+        y = np.fromfile(self.filename, sep=',', dtype=np.bool_)
+        assert_(y.dtype == '?')
+        assert_array_equal(y, v)
+
+    def test_tofile_sep(self):
+        x = np.array([1.51, 2, 3.51, 4], dtype=float)
+        with open(self.filename, 'w') as f:
+            x.tofile(f, sep=',')
+        with open(self.filename, 'r') as f:
+            s = f.read()
+        #assert_equal(s, '1.51,2.0,3.51,4.0')
+        y = np.array([float(p) for p in s.split(',')])
+        assert_array_equal(x,y)
+
+    def test_tofile_format(self):
+        x = np.array([1.51, 2, 3.51, 4], dtype=float)
+        with open(self.filename, 'w') as f:
+            x.tofile(f, sep=',', format='%.2f')
+        with open(self.filename, 'r') as f:
+            s = f.read()
+        assert_equal(s, '1.51,2.00,3.51,4.00')
+
+    def test_locale(self):
+        with CommaDecimalPointLocale():
+            self.test_numbers()
+            self.test_nan()
+            self.test_inf()
+            self.test_counted_string()
+            self.test_ascii()
+            self.test_malformed()
+            self.test_tofile_sep()
+            self.test_tofile_format()
+
+    def test_fromfile_subarray_binary(self):
+        # Test subarray dtypes which are absorbed into the shape
+        x = np.arange(24, dtype="i4").reshape(2, 3, 4)
+        x.tofile(self.filename)
+        res = np.fromfile(self.filename, dtype="(3,4)i4")
+        assert_array_equal(x, res)
+
+        x_str = x.tobytes()
+        with assert_warns(DeprecationWarning):
+            # binary fromstring is deprecated
+            res = np.fromstring(x_str, dtype="(3,4)i4")
+            assert_array_equal(x, res)
+
+
+class TestFromBuffer:
+    @pytest.mark.parametrize('byteorder', ['<', '>'])
+    @pytest.mark.parametrize('dtype', [float, int, complex])
+    def test_basic(self, byteorder, dtype):
+        dt = np.dtype(dtype).newbyteorder(byteorder)
+        x = (np.random.random((4, 7)) * 5).astype(dt)
+        buf = x.tobytes()
+        assert_array_equal(np.frombuffer(buf, dtype=dt), x.flat)
+
+    def test_empty(self):
+        assert_array_equal(np.frombuffer(b''), np.array([]))
+
+
+class TestFlat:
+    def setup(self):
+        a0 = np.arange(20.0)
+        a = a0.reshape(4, 5)
+        a0.shape = (4, 5)
+        a.flags.writeable = False
+        self.a = a
+        self.b = a[::2, ::2]
+        self.a0 = a0
+        self.b0 = a0[::2, ::2]
+
+    def test_contiguous(self):
+        testpassed = False
+        try:
+            self.a.flat[12] = 100.0
+        except ValueError:
+            testpassed = True
+        assert_(testpassed)
+        assert_(self.a.flat[12] == 12.0)
+
+    def test_discontiguous(self):
+        testpassed = False
+        try:
+            self.b.flat[4] = 100.0
+        except ValueError:
+            testpassed = True
+        assert_(testpassed)
+        assert_(self.b.flat[4] == 12.0)
+
+    def test___array__(self):
+        c = self.a.flat.__array__()
+        d = self.b.flat.__array__()
+        e = self.a0.flat.__array__()
+        f = self.b0.flat.__array__()
+
+        assert_(c.flags.writeable is False)
+        assert_(d.flags.writeable is False)
+        # for 1.14 all are set to non-writeable on the way to replacing the
+        # UPDATEIFCOPY array returned for non-contiguous arrays.
+        assert_(e.flags.writeable is True)
+        assert_(f.flags.writeable is False)
+        with assert_warns(DeprecationWarning):
+            assert_(c.flags.updateifcopy is False)
+        with assert_warns(DeprecationWarning):
+            assert_(d.flags.updateifcopy is False)
+        with assert_warns(DeprecationWarning):
+            assert_(e.flags.updateifcopy is False)
+        with assert_warns(DeprecationWarning):
+            # UPDATEIFCOPY is removed.
+            assert_(f.flags.updateifcopy is False)
+        assert_(c.flags.writebackifcopy is False)
+        assert_(d.flags.writebackifcopy is False)
+        assert_(e.flags.writebackifcopy is False)
+        assert_(f.flags.writebackifcopy is False)
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_refcount(self):
+        # includes regression test for reference count error gh-13165
+        inds = [np.intp(0), np.array([True]*self.a.size), np.array([0]), None]
+        indtype = np.dtype(np.intp)
+        rc_indtype = sys.getrefcount(indtype)
+        for ind in inds:
+            rc_ind = sys.getrefcount(ind)
+            for _ in range(100):
+                try:
+                    self.a.flat[ind]
+                except IndexError:
+                    pass
+            assert_(abs(sys.getrefcount(ind) - rc_ind) < 50)
+            assert_(abs(sys.getrefcount(indtype) - rc_indtype) < 50)
+
+
+class TestResize:
+
+    @_no_tracing
+    def test_basic(self):
+        x = np.array([[1, 0, 0], [0, 1, 0], [0, 0, 1]])
+        if IS_PYPY:
+            x.resize((5, 5), refcheck=False)
+        else:
+            x.resize((5, 5))
+        assert_array_equal(x.flat[:9],
+                np.array([[1, 0, 0], [0, 1, 0], [0, 0, 1]]).flat)
+        assert_array_equal(x[9:].flat, 0)
+
+    def test_check_reference(self):
+        x = np.array([[1, 0, 0], [0, 1, 0], [0, 0, 1]])
+        y = x
+        assert_raises(ValueError, x.resize, (5, 1))
+        del y  # avoid pyflakes unused variable warning.
+
+    @_no_tracing
+    def test_int_shape(self):
+        x = np.eye(3)
+        if IS_PYPY:
+            x.resize(3, refcheck=False)
+        else:
+            x.resize(3)
+        assert_array_equal(x, np.eye(3)[0,:])
+
+    def test_none_shape(self):
+        x = np.eye(3)
+        x.resize(None)
+        assert_array_equal(x, np.eye(3))
+        x.resize()
+        assert_array_equal(x, np.eye(3))
+
+    def test_0d_shape(self):
+        # to it multiple times to test it does not break alloc cache gh-9216
+        for i in range(10):
+            x = np.empty((1,))
+            x.resize(())
+            assert_equal(x.shape, ())
+            assert_equal(x.size, 1)
+            x = np.empty(())
+            x.resize((1,))
+            assert_equal(x.shape, (1,))
+            assert_equal(x.size, 1)
+
+    def test_invalid_arguments(self):
+        assert_raises(TypeError, np.eye(3).resize, 'hi')
+        assert_raises(ValueError, np.eye(3).resize, -1)
+        assert_raises(TypeError, np.eye(3).resize, order=1)
+        assert_raises(TypeError, np.eye(3).resize, refcheck='hi')
+
+    @_no_tracing
+    def test_freeform_shape(self):
+        x = np.eye(3)
+        if IS_PYPY:
+            x.resize(3, 2, 1, refcheck=False)
+        else:
+            x.resize(3, 2, 1)
+        assert_(x.shape == (3, 2, 1))
+
+    @_no_tracing
+    def test_zeros_appended(self):
+        x = np.eye(3)
+        if IS_PYPY:
+            x.resize(2, 3, 3, refcheck=False)
+        else:
+            x.resize(2, 3, 3)
+        assert_array_equal(x[0], np.eye(3))
+        assert_array_equal(x[1], np.zeros((3, 3)))
+
+    @_no_tracing
+    def test_obj_obj(self):
+        # check memory is initialized on resize, gh-4857
+        a = np.ones(10, dtype=[('k', object, 2)])
+        if IS_PYPY:
+            a.resize(15, refcheck=False)
+        else:
+            a.resize(15,)
+        assert_equal(a.shape, (15,))
+        assert_array_equal(a['k'][-5:], 0)
+        assert_array_equal(a['k'][:-5], 1)
+
+    def test_empty_view(self):
+        # check that sizes containing a zero don't trigger a reallocate for
+        # already empty arrays
+        x = np.zeros((10, 0), int)
+        x_view = x[...]
+        x_view.resize((0, 10))
+        x_view.resize((0, 100))
+
+    def test_check_weakref(self):
+        x = np.array([[1, 0, 0], [0, 1, 0], [0, 0, 1]])
+        xref = weakref.ref(x)
+        assert_raises(ValueError, x.resize, (5, 1))
+        del xref  # avoid pyflakes unused variable warning.
+
+
+class TestRecord:
+    def test_field_rename(self):
+        dt = np.dtype([('f', float), ('i', int)])
+        dt.names = ['p', 'q']
+        assert_equal(dt.names, ['p', 'q'])
+
+    def test_multiple_field_name_occurrence(self):
+        def test_dtype_init():
+            np.dtype([("A", "f8"), ("B", "f8"), ("A", "f8")])
+
+        # Error raised when multiple fields have the same name
+        assert_raises(ValueError, test_dtype_init)
+
+    def test_bytes_fields(self):
+        # Bytes are not allowed in field names and not recognized in titles
+        # on Py3
+        assert_raises(TypeError, np.dtype, [(b'a', int)])
+        assert_raises(TypeError, np.dtype, [(('b', b'a'), int)])
+
+        dt = np.dtype([((b'a', 'b'), int)])
+        assert_raises(TypeError, dt.__getitem__, b'a')
+
+        x = np.array([(1,), (2,), (3,)], dtype=dt)
+        assert_raises(IndexError, x.__getitem__, b'a')
+
+        y = x[0]
+        assert_raises(IndexError, y.__getitem__, b'a')
+
+    def test_multiple_field_name_unicode(self):
+        def test_dtype_unicode():
+            np.dtype([("\u20B9", "f8"), ("B", "f8"), ("\u20B9", "f8")])
+
+        # Error raised when multiple fields have the same name(unicode included)
+        assert_raises(ValueError, test_dtype_unicode)
+
+    def test_fromarrays_unicode(self):
+        # A single name string provided to fromarrays() is allowed to be unicode
+        # on both Python 2 and 3:
+        x = np.core.records.fromarrays([[0], [1]], names=u'a,b', formats=u'i4,i4')
+        assert_equal(x['a'][0], 0)
+        assert_equal(x['b'][0], 1)
+
+    def test_unicode_order(self):
+        # Test that we can sort with order as a unicode field name in both Python 2 and
+        # 3:
+        name = u'b'
+        x = np.array([1, 3, 2], dtype=[(name, int)])
+        x.sort(order=name)
+        assert_equal(x[u'b'], np.array([1, 2, 3]))
+
+    def test_field_names(self):
+        # Test unicode and 8-bit / byte strings can be used
+        a = np.zeros((1,), dtype=[('f1', 'i4'),
+                                  ('f2', 'i4'),
+                                  ('f3', [('sf1', 'i4')])])
+        # byte string indexing fails gracefully
+        assert_raises(IndexError, a.__setitem__, b'f1', 1)
+        assert_raises(IndexError, a.__getitem__, b'f1')
+        assert_raises(IndexError, a['f1'].__setitem__, b'sf1', 1)
+        assert_raises(IndexError, a['f1'].__getitem__, b'sf1')
+        b = a.copy()
+        fn1 = str('f1')
+        b[fn1] = 1
+        assert_equal(b[fn1], 1)
+        fnn = str('not at all')
+        assert_raises(ValueError, b.__setitem__, fnn, 1)
+        assert_raises(ValueError, b.__getitem__, fnn)
+        b[0][fn1] = 2
+        assert_equal(b[fn1], 2)
+        # Subfield
+        assert_raises(ValueError, b[0].__setitem__, fnn, 1)
+        assert_raises(ValueError, b[0].__getitem__, fnn)
+        # Subfield
+        fn3 = str('f3')
+        sfn1 = str('sf1')
+        b[fn3][sfn1] = 1
+        assert_equal(b[fn3][sfn1], 1)
+        assert_raises(ValueError, b[fn3].__setitem__, fnn, 1)
+        assert_raises(ValueError, b[fn3].__getitem__, fnn)
+        # multiple subfields
+        fn2 = str('f2')
+        b[fn2] = 3
+
+        assert_equal(b[['f1', 'f2']][0].tolist(), (2, 3))
+        assert_equal(b[['f2', 'f1']][0].tolist(), (3, 2))
+        assert_equal(b[['f1', 'f3']][0].tolist(), (2, (1,)))
+
+        # non-ascii unicode field indexing is well behaved
+        assert_raises(ValueError, a.__setitem__, u'\u03e0', 1)
+        assert_raises(ValueError, a.__getitem__, u'\u03e0')
+
+    def test_record_hash(self):
+        a = np.array([(1, 2), (1, 2)], dtype='i1,i2')
+        a.flags.writeable = False
+        b = np.array([(1, 2), (3, 4)], dtype=[('num1', 'i1'), ('num2', 'i2')])
+        b.flags.writeable = False
+        c = np.array([(1, 2), (3, 4)], dtype='i1,i2')
+        c.flags.writeable = False
+        assert_(hash(a[0]) == hash(a[1]))
+        assert_(hash(a[0]) == hash(b[0]))
+        assert_(hash(a[0]) != hash(b[1]))
+        assert_(hash(c[0]) == hash(a[0]) and c[0] == a[0])
+
+    def test_record_no_hash(self):
+        a = np.array([(1, 2), (1, 2)], dtype='i1,i2')
+        assert_raises(TypeError, hash, a[0])
+
+    def test_empty_structure_creation(self):
+        # make sure these do not raise errors (gh-5631)
+        np.array([()], dtype={'names': [], 'formats': [],
+                           'offsets': [], 'itemsize': 12})
+        np.array([(), (), (), (), ()], dtype={'names': [], 'formats': [],
+                                           'offsets': [], 'itemsize': 12})
+
+    def test_multifield_indexing_view(self):
+        a = np.ones(3, dtype=[('a', 'i4'), ('b', 'f4'), ('c', 'u4')])
+        v = a[['a', 'c']]
+        assert_(v.base is a)
+        assert_(v.dtype == np.dtype({'names': ['a', 'c'],
+                                     'formats': ['i4', 'u4'],
+                                     'offsets': [0, 8]}))
+        v[:] = (4,5)
+        assert_equal(a[0].item(), (4, 1, 5))
+
+class TestView:
+    def test_basic(self):
+        x = np.array([(1, 2, 3, 4), (5, 6, 7, 8)],
+                     dtype=[('r', np.int8), ('g', np.int8),
+                            ('b', np.int8), ('a', np.int8)])
+        # We must be specific about the endianness here:
+        y = x.view(dtype='<i4')
+        # ... and again without the keyword.
+        z = x.view('<i4')
+        assert_array_equal(y, z)
+        assert_array_equal(y, [67305985, 134678021])
+
+
+def _mean(a, **args):
+    return a.mean(**args)
+
+
+def _var(a, **args):
+    return a.var(**args)
+
+
+def _std(a, **args):
+    return a.std(**args)
+
+
+class TestStats:
+
+    funcs = [_mean, _var, _std]
+
+    def setup(self):
+        np.random.seed(range(3))
+        self.rmat = np.random.random((4, 5))
+        self.cmat = self.rmat + 1j * self.rmat
+        self.omat = np.array([Decimal(repr(r)) for r in self.rmat.flat])
+        self.omat = self.omat.reshape(4, 5)
+
+    def test_python_type(self):
+        for x in (np.float16(1.), 1, 1., 1+0j):
+            assert_equal(np.mean([x]), 1.)
+            assert_equal(np.std([x]), 0.)
+            assert_equal(np.var([x]), 0.)
+
+    def test_keepdims(self):
+        mat = np.eye(3)
+        for f in self.funcs:
+            for axis in [0, 1]:
+                res = f(mat, axis=axis, keepdims=True)
+                assert_(res.ndim == mat.ndim)
+                assert_(res.shape[axis] == 1)
+            for axis in [None]:
+                res = f(mat, axis=axis, keepdims=True)
+                assert_(res.shape == (1, 1))
+
+    def test_out(self):
+        mat = np.eye(3)
+        for f in self.funcs:
+            out = np.zeros(3)
+            tgt = f(mat, axis=1)
+            res = f(mat, axis=1, out=out)
+            assert_almost_equal(res, out)
+            assert_almost_equal(res, tgt)
+        out = np.empty(2)
+        assert_raises(ValueError, f, mat, axis=1, out=out)
+        out = np.empty((2, 2))
+        assert_raises(ValueError, f, mat, axis=1, out=out)
+
+    def test_dtype_from_input(self):
+
+        icodes = np.typecodes['AllInteger']
+        fcodes = np.typecodes['AllFloat']
+
+        # object type
+        for f in self.funcs:
+            mat = np.array([[Decimal(1)]*3]*3)
+            tgt = mat.dtype.type
+            res = f(mat, axis=1).dtype.type
+            assert_(res is tgt)
+            # scalar case
+            res = type(f(mat, axis=None))
+            assert_(res is Decimal)
+
+        # integer types
+        for f in self.funcs:
+            for c in icodes:
+                mat = np.eye(3, dtype=c)
+                tgt = np.float64
+                res = f(mat, axis=1).dtype.type
+                assert_(res is tgt)
+                # scalar case
+                res = f(mat, axis=None).dtype.type
+                assert_(res is tgt)
+
+        # mean for float types
+        for f in [_mean]:
+            for c in fcodes:
+                mat = np.eye(3, dtype=c)
+                tgt = mat.dtype.type
+                res = f(mat, axis=1).dtype.type
+                assert_(res is tgt)
+                # scalar case
+                res = f(mat, axis=None).dtype.type
+                assert_(res is tgt)
+
+        # var, std for float types
+        for f in [_var, _std]:
+            for c in fcodes:
+                mat = np.eye(3, dtype=c)
+                # deal with complex types
+                tgt = mat.real.dtype.type
+                res = f(mat, axis=1).dtype.type
+                assert_(res is tgt)
+                # scalar case
+                res = f(mat, axis=None).dtype.type
+                assert_(res is tgt)
+
+    def test_dtype_from_dtype(self):
+        mat = np.eye(3)
+
+        # stats for integer types
+        # FIXME:
+        # this needs definition as there are lots places along the line
+        # where type casting may take place.
+
+        # for f in self.funcs:
+        #    for c in np.typecodes['AllInteger']:
+        #        tgt = np.dtype(c).type
+        #        res = f(mat, axis=1, dtype=c).dtype.type
+        #        assert_(res is tgt)
+        #        # scalar case
+        #        res = f(mat, axis=None, dtype=c).dtype.type
+        #        assert_(res is tgt)
+
+        # stats for float types
+        for f in self.funcs:
+            for c in np.typecodes['AllFloat']:
+                tgt = np.dtype(c).type
+                res = f(mat, axis=1, dtype=c).dtype.type
+                assert_(res is tgt)
+                # scalar case
+                res = f(mat, axis=None, dtype=c).dtype.type
+                assert_(res is tgt)
+
+    def test_ddof(self):
+        for f in [_var]:
+            for ddof in range(3):
+                dim = self.rmat.shape[1]
+                tgt = f(self.rmat, axis=1) * dim
+                res = f(self.rmat, axis=1, ddof=ddof) * (dim - ddof)
+        for f in [_std]:
+            for ddof in range(3):
+                dim = self.rmat.shape[1]
+                tgt = f(self.rmat, axis=1) * np.sqrt(dim)
+                res = f(self.rmat, axis=1, ddof=ddof) * np.sqrt(dim - ddof)
+                assert_almost_equal(res, tgt)
+                assert_almost_equal(res, tgt)
+
+    def test_ddof_too_big(self):
+        dim = self.rmat.shape[1]
+        for f in [_var, _std]:
+            for ddof in range(dim, dim + 2):
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    res = f(self.rmat, axis=1, ddof=ddof)
+                    assert_(not (res < 0).any())
+                    assert_(len(w) > 0)
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+
+    def test_empty(self):
+        A = np.zeros((0, 3))
+        for f in self.funcs:
+            for axis in [0, None]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_(np.isnan(f(A, axis=axis)).all())
+                    assert_(len(w) > 0)
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+            for axis in [1]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_equal(f(A, axis=axis), np.zeros([]))
+
+    def test_mean_values(self):
+        for mat in [self.rmat, self.cmat, self.omat]:
+            for axis in [0, 1]:
+                tgt = mat.sum(axis=axis)
+                res = _mean(mat, axis=axis) * mat.shape[axis]
+                assert_almost_equal(res, tgt)
+            for axis in [None]:
+                tgt = mat.sum(axis=axis)
+                res = _mean(mat, axis=axis) * np.prod(mat.shape)
+                assert_almost_equal(res, tgt)
+
+    def test_mean_float16(self):
+        # This fail if the sum inside mean is done in float16 instead
+        # of float32.
+        assert_(_mean(np.ones(100000, dtype='float16')) == 1)
+
+    def test_mean_axis_error(self):
+        # Ensure that AxisError is raised instead of IndexError when axis is
+        # out of bounds, see gh-15817.
+        with assert_raises(np.core._exceptions.AxisError):
+            np.arange(10).mean(axis=2)
+
+    def test_var_values(self):
+        for mat in [self.rmat, self.cmat, self.omat]:
+            for axis in [0, 1, None]:
+                msqr = _mean(mat * mat.conj(), axis=axis)
+                mean = _mean(mat, axis=axis)
+                tgt = msqr - mean * mean.conjugate()
+                res = _var(mat, axis=axis)
+                assert_almost_equal(res, tgt)
+
+    @pytest.mark.parametrize(('complex_dtype', 'ndec'), (
+        ('complex64', 6),
+        ('complex128', 7),
+        ('clongdouble', 7),
+    ))
+    def test_var_complex_values(self, complex_dtype, ndec):
+        # Test fast-paths for every builtin complex type
+        for axis in [0, 1, None]:
+            mat = self.cmat.copy().astype(complex_dtype)
+            msqr = _mean(mat * mat.conj(), axis=axis)
+            mean = _mean(mat, axis=axis)
+            tgt = msqr - mean * mean.conjugate()
+            res = _var(mat, axis=axis)
+            assert_almost_equal(res, tgt, decimal=ndec)
+
+    def test_var_dimensions(self):
+        # _var paths for complex number introduce additions on views that
+        # increase dimensions. Ensure this generalizes to higher dims
+        mat = np.stack([self.cmat]*3)
+        for axis in [0, 1, 2, -1, None]:
+            msqr = _mean(mat * mat.conj(), axis=axis)
+            mean = _mean(mat, axis=axis)
+            tgt = msqr - mean * mean.conjugate()
+            res = _var(mat, axis=axis)
+            assert_almost_equal(res, tgt)
+
+    def test_var_complex_byteorder(self):
+        # Test that var fast-path does not cause failures for complex arrays
+        # with non-native byteorder
+        cmat = self.cmat.copy().astype('complex128')
+        cmat_swapped = cmat.astype(cmat.dtype.newbyteorder())
+        assert_almost_equal(cmat.var(), cmat_swapped.var())
+
+    def test_var_axis_error(self):
+        # Ensure that AxisError is raised instead of IndexError when axis is
+        # out of bounds, see gh-15817.
+        with assert_raises(np.core._exceptions.AxisError):
+            np.arange(10).var(axis=2)
+
+    def test_std_values(self):
+        for mat in [self.rmat, self.cmat, self.omat]:
+            for axis in [0, 1, None]:
+                tgt = np.sqrt(_var(mat, axis=axis))
+                res = _std(mat, axis=axis)
+                assert_almost_equal(res, tgt)
+
+    def test_subclass(self):
+        class TestArray(np.ndarray):
+            def __new__(cls, data, info):
+                result = np.array(data)
+                result = result.view(cls)
+                result.info = info
+                return result
+
+            def __array_finalize__(self, obj):
+                self.info = getattr(obj, "info", '')
+
+        dat = TestArray([[1, 2, 3, 4], [5, 6, 7, 8]], 'jubba')
+        res = dat.mean(1)
+        assert_(res.info == dat.info)
+        res = dat.std(1)
+        assert_(res.info == dat.info)
+        res = dat.var(1)
+        assert_(res.info == dat.info)
+
+class TestVdot:
+    def test_basic(self):
+        dt_numeric = np.typecodes['AllFloat'] + np.typecodes['AllInteger']
+        dt_complex = np.typecodes['Complex']
+
+        # test real
+        a = np.eye(3)
+        for dt in dt_numeric + 'O':
+            b = a.astype(dt)
+            res = np.vdot(b, b)
+            assert_(np.isscalar(res))
+            assert_equal(np.vdot(b, b), 3)
+
+        # test complex
+        a = np.eye(3) * 1j
+        for dt in dt_complex + 'O':
+            b = a.astype(dt)
+            res = np.vdot(b, b)
+            assert_(np.isscalar(res))
+            assert_equal(np.vdot(b, b), 3)
+
+        # test boolean
+        b = np.eye(3, dtype=bool)
+        res = np.vdot(b, b)
+        assert_(np.isscalar(res))
+        assert_equal(np.vdot(b, b), True)
+
+    def test_vdot_array_order(self):
+        a = np.array([[1, 2], [3, 4]], order='C')
+        b = np.array([[1, 2], [3, 4]], order='F')
+        res = np.vdot(a, a)
+
+        # integer arrays are exact
+        assert_equal(np.vdot(a, b), res)
+        assert_equal(np.vdot(b, a), res)
+        assert_equal(np.vdot(b, b), res)
+
+    def test_vdot_uncontiguous(self):
+        for size in [2, 1000]:
+            # Different sizes match different branches in vdot.
+            a = np.zeros((size, 2, 2))
+            b = np.zeros((size, 2, 2))
+            a[:, 0, 0] = np.arange(size)
+            b[:, 0, 0] = np.arange(size) + 1
+            # Make a and b uncontiguous:
+            a = a[..., 0]
+            b = b[..., 0]
+
+            assert_equal(np.vdot(a, b),
+                         np.vdot(a.flatten(), b.flatten()))
+            assert_equal(np.vdot(a, b.copy()),
+                         np.vdot(a.flatten(), b.flatten()))
+            assert_equal(np.vdot(a.copy(), b),
+                         np.vdot(a.flatten(), b.flatten()))
+            assert_equal(np.vdot(a.copy('F'), b),
+                         np.vdot(a.flatten(), b.flatten()))
+            assert_equal(np.vdot(a, b.copy('F')),
+                         np.vdot(a.flatten(), b.flatten()))
+
+
+class TestDot:
+    def setup(self):
+        np.random.seed(128)
+        self.A = np.random.rand(4, 2)
+        self.b1 = np.random.rand(2, 1)
+        self.b2 = np.random.rand(2)
+        self.b3 = np.random.rand(1, 2)
+        self.b4 = np.random.rand(4)
+        self.N = 7
+
+    def test_dotmatmat(self):
+        A = self.A
+        res = np.dot(A.transpose(), A)
+        tgt = np.array([[1.45046013, 0.86323640],
+                        [0.86323640, 0.84934569]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotmatvec(self):
+        A, b1 = self.A, self.b1
+        res = np.dot(A, b1)
+        tgt = np.array([[0.32114320], [0.04889721],
+                        [0.15696029], [0.33612621]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotmatvec2(self):
+        A, b2 = self.A, self.b2
+        res = np.dot(A, b2)
+        tgt = np.array([0.29677940, 0.04518649, 0.14468333, 0.31039293])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecmat(self):
+        A, b4 = self.A, self.b4
+        res = np.dot(b4, A)
+        tgt = np.array([1.23495091, 1.12222648])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecmat2(self):
+        b3, A = self.b3, self.A
+        res = np.dot(b3, A.transpose())
+        tgt = np.array([[0.58793804, 0.08957460, 0.30605758, 0.62716383]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecmat3(self):
+        A, b4 = self.A, self.b4
+        res = np.dot(A.transpose(), b4)
+        tgt = np.array([1.23495091, 1.12222648])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecvecouter(self):
+        b1, b3 = self.b1, self.b3
+        res = np.dot(b1, b3)
+        tgt = np.array([[0.20128610, 0.08400440], [0.07190947, 0.03001058]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecvecinner(self):
+        b1, b3 = self.b1, self.b3
+        res = np.dot(b3, b1)
+        tgt = np.array([[ 0.23129668]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotcolumnvect1(self):
+        b1 = np.ones((3, 1))
+        b2 = [5.3]
+        res = np.dot(b1, b2)
+        tgt = np.array([5.3, 5.3, 5.3])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotcolumnvect2(self):
+        b1 = np.ones((3, 1)).transpose()
+        b2 = [6.2]
+        res = np.dot(b2, b1)
+        tgt = np.array([6.2, 6.2, 6.2])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecscalar(self):
+        np.random.seed(100)
+        b1 = np.random.rand(1, 1)
+        b2 = np.random.rand(1, 4)
+        res = np.dot(b1, b2)
+        tgt = np.array([[0.15126730, 0.23068496, 0.45905553, 0.00256425]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_dotvecscalar2(self):
+        np.random.seed(100)
+        b1 = np.random.rand(4, 1)
+        b2 = np.random.rand(1, 1)
+        res = np.dot(b1, b2)
+        tgt = np.array([[0.00256425],[0.00131359],[0.00200324],[ 0.00398638]])
+        assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_all(self):
+        dims = [(), (1,), (1, 1)]
+        dout = [(), (1,), (1, 1), (1,), (), (1,), (1, 1), (1,), (1, 1)]
+        for dim, (dim1, dim2) in zip(dout, itertools.product(dims, dims)):
+            b1 = np.zeros(dim1)
+            b2 = np.zeros(dim2)
+            res = np.dot(b1, b2)
+            tgt = np.zeros(dim)
+            assert_(res.shape == tgt.shape)
+            assert_almost_equal(res, tgt, decimal=self.N)
+
+    def test_vecobject(self):
+        class Vec:
+            def __init__(self, sequence=None):
+                if sequence is None:
+                    sequence = []
+                self.array = np.array(sequence)
+
+            def __add__(self, other):
+                out = Vec()
+                out.array = self.array + other.array
+                return out
+
+            def __sub__(self, other):
+                out = Vec()
+                out.array = self.array - other.array
+                return out
+
+            def __mul__(self, other):  # with scalar
+                out = Vec(self.array.copy())
+                out.array *= other
+                return out
+
+            def __rmul__(self, other):
+                return self*other
+
+        U_non_cont = np.transpose([[1., 1.], [1., 2.]])
+        U_cont = np.ascontiguousarray(U_non_cont)
+        x = np.array([Vec([1., 0.]), Vec([0., 1.])])
+        zeros = np.array([Vec([0., 0.]), Vec([0., 0.])])
+        zeros_test = np.dot(U_cont, x) - np.dot(U_non_cont, x)
+        assert_equal(zeros[0].array, zeros_test[0].array)
+        assert_equal(zeros[1].array, zeros_test[1].array)
+
+    def test_dot_2args(self):
+        from numpy.core.multiarray import dot
+
+        a = np.array([[1, 2], [3, 4]], dtype=float)
+        b = np.array([[1, 0], [1, 1]], dtype=float)
+        c = np.array([[3, 2], [7, 4]], dtype=float)
+
+        d = dot(a, b)
+        assert_allclose(c, d)
+
+    def test_dot_3args(self):
+        from numpy.core.multiarray import dot
+
+        np.random.seed(22)
+        f = np.random.random_sample((1024, 16))
+        v = np.random.random_sample((16, 32))
+
+        r = np.empty((1024, 32))
+        for i in range(12):
+            dot(f, v, r)
+        if HAS_REFCOUNT:
+            assert_equal(sys.getrefcount(r), 2)
+        r2 = dot(f, v, out=None)
+        assert_array_equal(r2, r)
+        assert_(r is dot(f, v, out=r))
+
+        v = v[:, 0].copy()  # v.shape == (16,)
+        r = r[:, 0].copy()  # r.shape == (1024,)
+        r2 = dot(f, v)
+        assert_(r is dot(f, v, r))
+        assert_array_equal(r2, r)
+
+    def test_dot_3args_errors(self):
+        from numpy.core.multiarray import dot
+
+        np.random.seed(22)
+        f = np.random.random_sample((1024, 16))
+        v = np.random.random_sample((16, 32))
+
+        r = np.empty((1024, 31))
+        assert_raises(ValueError, dot, f, v, r)
+
+        r = np.empty((1024,))
+        assert_raises(ValueError, dot, f, v, r)
+
+        r = np.empty((32,))
+        assert_raises(ValueError, dot, f, v, r)
+
+        r = np.empty((32, 1024))
+        assert_raises(ValueError, dot, f, v, r)
+        assert_raises(ValueError, dot, f, v, r.T)
+
+        r = np.empty((1024, 64))
+        assert_raises(ValueError, dot, f, v, r[:, ::2])
+        assert_raises(ValueError, dot, f, v, r[:, :32])
+
+        r = np.empty((1024, 32), dtype=np.float32)
+        assert_raises(ValueError, dot, f, v, r)
+
+        r = np.empty((1024, 32), dtype=int)
+        assert_raises(ValueError, dot, f, v, r)
+
+    def test_dot_array_order(self):
+        a = np.array([[1, 2], [3, 4]], order='C')
+        b = np.array([[1, 2], [3, 4]], order='F')
+        res = np.dot(a, a)
+
+        # integer arrays are exact
+        assert_equal(np.dot(a, b), res)
+        assert_equal(np.dot(b, a), res)
+        assert_equal(np.dot(b, b), res)
+
+    def test_accelerate_framework_sgemv_fix(self):
+
+        def aligned_array(shape, align, dtype, order='C'):
+            d = dtype(0)
+            N = np.prod(shape)
+            tmp = np.zeros(N * d.nbytes + align, dtype=np.uint8)
+            address = tmp.__array_interface__["data"][0]
+            for offset in range(align):
+                if (address + offset) % align == 0:
+                    break
+            tmp = tmp[offset:offset+N*d.nbytes].view(dtype=dtype)
+            return tmp.reshape(shape, order=order)
+
+        def as_aligned(arr, align, dtype, order='C'):
+            aligned = aligned_array(arr.shape, align, dtype, order)
+            aligned[:] = arr[:]
+            return aligned
+
+        def assert_dot_close(A, X, desired):
+            assert_allclose(np.dot(A, X), desired, rtol=1e-5, atol=1e-7)
+
+        m = aligned_array(100, 15, np.float32)
+        s = aligned_array((100, 100), 15, np.float32)
+        np.dot(s, m)  # this will always segfault if the bug is present
+
+        testdata = itertools.product((15,32), (10000,), (200,89), ('C','F'))
+        for align, m, n, a_order in testdata:
+            # Calculation in double precision
+            A_d = np.random.rand(m, n)
+            X_d = np.random.rand(n)
+            desired = np.dot(A_d, X_d)
+            # Calculation with aligned single precision
+            A_f = as_aligned(A_d, align, np.float32, order=a_order)
+            X_f = as_aligned(X_d, align, np.float32)
+            assert_dot_close(A_f, X_f, desired)
+            # Strided A rows
+            A_d_2 = A_d[::2]
+            desired = np.dot(A_d_2, X_d)
+            A_f_2 = A_f[::2]
+            assert_dot_close(A_f_2, X_f, desired)
+            # Strided A columns, strided X vector
+            A_d_22 = A_d_2[:, ::2]
+            X_d_2 = X_d[::2]
+            desired = np.dot(A_d_22, X_d_2)
+            A_f_22 = A_f_2[:, ::2]
+            X_f_2 = X_f[::2]
+            assert_dot_close(A_f_22, X_f_2, desired)
+            # Check the strides are as expected
+            if a_order == 'F':
+                assert_equal(A_f_22.strides, (8, 8 * m))
+            else:
+                assert_equal(A_f_22.strides, (8 * n, 8))
+            assert_equal(X_f_2.strides, (8,))
+            # Strides in A rows + cols only
+            X_f_2c = as_aligned(X_f_2, align, np.float32)
+            assert_dot_close(A_f_22, X_f_2c, desired)
+            # Strides just in A cols
+            A_d_12 = A_d[:, ::2]
+            desired = np.dot(A_d_12, X_d_2)
+            A_f_12 = A_f[:, ::2]
+            assert_dot_close(A_f_12, X_f_2c, desired)
+            # Strides in A cols and X
+            assert_dot_close(A_f_12, X_f_2, desired)
+
+
+class MatmulCommon:
+    """Common tests for '@' operator and numpy.matmul.
+
+    """
+    # Should work with these types. Will want to add
+    # "O" at some point
+    types = "?bhilqBHILQefdgFDGO"
+
+    def test_exceptions(self):
+        dims = [
+            ((1,), (2,)),            # mismatched vector vector
+            ((2, 1,), (2,)),         # mismatched matrix vector
+            ((2,), (1, 2)),          # mismatched vector matrix
+            ((1, 2), (3, 1)),        # mismatched matrix matrix
+            ((1,), ()),              # vector scalar
+            ((), (1)),               # scalar vector
+            ((1, 1), ()),            # matrix scalar
+            ((), (1, 1)),            # scalar matrix
+            ((2, 2, 1), (3, 1, 2)),  # cannot broadcast
+            ]
+
+        for dt, (dm1, dm2) in itertools.product(self.types, dims):
+            a = np.ones(dm1, dtype=dt)
+            b = np.ones(dm2, dtype=dt)
+            assert_raises(ValueError, self.matmul, a, b)
+
+    def test_shapes(self):
+        dims = [
+            ((1, 1), (2, 1, 1)),     # broadcast first argument
+            ((2, 1, 1), (1, 1)),     # broadcast second argument
+            ((2, 1, 1), (2, 1, 1)),  # matrix stack sizes match
+            ]
+
+        for dt, (dm1, dm2) in itertools.product(self.types, dims):
+            a = np.ones(dm1, dtype=dt)
+            b = np.ones(dm2, dtype=dt)
+            res = self.matmul(a, b)
+            assert_(res.shape == (2, 1, 1))
+
+        # vector vector returns scalars.
+        for dt in self.types:
+            a = np.ones((2,), dtype=dt)
+            b = np.ones((2,), dtype=dt)
+            c = self.matmul(a, b)
+            assert_(np.array(c).shape == ())
+
+    def test_result_types(self):
+        mat = np.ones((1,1))
+        vec = np.ones((1,))
+        for dt in self.types:
+            m = mat.astype(dt)
+            v = vec.astype(dt)
+            for arg in [(m, v), (v, m), (m, m)]:
+                res = self.matmul(*arg)
+                assert_(res.dtype == dt)
+
+            # vector vector returns scalars
+            if dt != "O":
+                res = self.matmul(v, v)
+                assert_(type(res) is np.dtype(dt).type)
+
+    def test_scalar_output(self):
+        vec1 = np.array([2])
+        vec2 = np.array([3, 4]).reshape(1, -1)
+        tgt = np.array([6, 8])
+        for dt in self.types[1:]:
+            v1 = vec1.astype(dt)
+            v2 = vec2.astype(dt)
+            res = self.matmul(v1, v2)
+            assert_equal(res, tgt)
+            res = self.matmul(v2.T, v1)
+            assert_equal(res, tgt)
+
+        # boolean type
+        vec = np.array([True, True], dtype='?').reshape(1, -1)
+        res = self.matmul(vec[:, 0], vec)
+        assert_equal(res, True)
+
+    def test_vector_vector_values(self):
+        vec1 = np.array([1, 2])
+        vec2 = np.array([3, 4]).reshape(-1, 1)
+        tgt1 = np.array([11])
+        tgt2 = np.array([[3, 6], [4, 8]])
+        for dt in self.types[1:]:
+            v1 = vec1.astype(dt)
+            v2 = vec2.astype(dt)
+            res = self.matmul(v1, v2)
+            assert_equal(res, tgt1)
+            # no broadcast, we must make v1 into a 2d ndarray
+            res = self.matmul(v2, v1.reshape(1, -1))
+            assert_equal(res, tgt2)
+
+        # boolean type
+        vec = np.array([True, True], dtype='?')
+        res = self.matmul(vec, vec)
+        assert_equal(res, True)
+
+    def test_vector_matrix_values(self):
+        vec = np.array([1, 2])
+        mat1 = np.array([[1, 2], [3, 4]])
+        mat2 = np.stack([mat1]*2, axis=0)
+        tgt1 = np.array([7, 10])
+        tgt2 = np.stack([tgt1]*2, axis=0)
+        for dt in self.types[1:]:
+            v = vec.astype(dt)
+            m1 = mat1.astype(dt)
+            m2 = mat2.astype(dt)
+            res = self.matmul(v, m1)
+            assert_equal(res, tgt1)
+            res = self.matmul(v, m2)
+            assert_equal(res, tgt2)
+
+        # boolean type
+        vec = np.array([True, False])
+        mat1 = np.array([[True, False], [False, True]])
+        mat2 = np.stack([mat1]*2, axis=0)
+        tgt1 = np.array([True, False])
+        tgt2 = np.stack([tgt1]*2, axis=0)
+
+        res = self.matmul(vec, mat1)
+        assert_equal(res, tgt1)
+        res = self.matmul(vec, mat2)
+        assert_equal(res, tgt2)
+
+    def test_matrix_vector_values(self):
+        vec = np.array([1, 2])
+        mat1 = np.array([[1, 2], [3, 4]])
+        mat2 = np.stack([mat1]*2, axis=0)
+        tgt1 = np.array([5, 11])
+        tgt2 = np.stack([tgt1]*2, axis=0)
+        for dt in self.types[1:]:
+            v = vec.astype(dt)
+            m1 = mat1.astype(dt)
+            m2 = mat2.astype(dt)
+            res = self.matmul(m1, v)
+            assert_equal(res, tgt1)
+            res = self.matmul(m2, v)
+            assert_equal(res, tgt2)
+
+        # boolean type
+        vec = np.array([True, False])
+        mat1 = np.array([[True, False], [False, True]])
+        mat2 = np.stack([mat1]*2, axis=0)
+        tgt1 = np.array([True, False])
+        tgt2 = np.stack([tgt1]*2, axis=0)
+
+        res = self.matmul(vec, mat1)
+        assert_equal(res, tgt1)
+        res = self.matmul(vec, mat2)
+        assert_equal(res, tgt2)
+
+    def test_matrix_matrix_values(self):
+        mat1 = np.array([[1, 2], [3, 4]])
+        mat2 = np.array([[1, 0], [1, 1]])
+        mat12 = np.stack([mat1, mat2], axis=0)
+        mat21 = np.stack([mat2, mat1], axis=0)
+        tgt11 = np.array([[7, 10], [15, 22]])
+        tgt12 = np.array([[3, 2], [7, 4]])
+        tgt21 = np.array([[1, 2], [4, 6]])
+        tgt12_21 = np.stack([tgt12, tgt21], axis=0)
+        tgt11_12 = np.stack((tgt11, tgt12), axis=0)
+        tgt11_21 = np.stack((tgt11, tgt21), axis=0)
+        for dt in self.types[1:]:
+            m1 = mat1.astype(dt)
+            m2 = mat2.astype(dt)
+            m12 = mat12.astype(dt)
+            m21 = mat21.astype(dt)
+
+            # matrix @ matrix
+            res = self.matmul(m1, m2)
+            assert_equal(res, tgt12)
+            res = self.matmul(m2, m1)
+            assert_equal(res, tgt21)
+
+            # stacked @ matrix
+            res = self.matmul(m12, m1)
+            assert_equal(res, tgt11_21)
+
+            # matrix @ stacked
+            res = self.matmul(m1, m12)
+            assert_equal(res, tgt11_12)
+
+            # stacked @ stacked
+            res = self.matmul(m12, m21)
+            assert_equal(res, tgt12_21)
+
+        # boolean type
+        m1 = np.array([[1, 1], [0, 0]], dtype=np.bool_)
+        m2 = np.array([[1, 0], [1, 1]], dtype=np.bool_)
+        m12 = np.stack([m1, m2], axis=0)
+        m21 = np.stack([m2, m1], axis=0)
+        tgt11 = m1
+        tgt12 = m1
+        tgt21 = np.array([[1, 1], [1, 1]], dtype=np.bool_)
+        tgt12_21 = np.stack([tgt12, tgt21], axis=0)
+        tgt11_12 = np.stack((tgt11, tgt12), axis=0)
+        tgt11_21 = np.stack((tgt11, tgt21), axis=0)
+
+        # matrix @ matrix
+        res = self.matmul(m1, m2)
+        assert_equal(res, tgt12)
+        res = self.matmul(m2, m1)
+        assert_equal(res, tgt21)
+
+        # stacked @ matrix
+        res = self.matmul(m12, m1)
+        assert_equal(res, tgt11_21)
+
+        # matrix @ stacked
+        res = self.matmul(m1, m12)
+        assert_equal(res, tgt11_12)
+
+        # stacked @ stacked
+        res = self.matmul(m12, m21)
+        assert_equal(res, tgt12_21)
+
+
+class TestMatmul(MatmulCommon):
+    matmul = np.matmul
+
+    def test_out_arg(self):
+        a = np.ones((5, 2), dtype=float)
+        b = np.array([[1, 3], [5, 7]], dtype=float)
+        tgt = np.dot(a, b)
+
+        # test as positional argument
+        msg = "out positional argument"
+        out = np.zeros((5, 2), dtype=float)
+        self.matmul(a, b, out)
+        assert_array_equal(out, tgt, err_msg=msg)
+
+        # test as keyword argument
+        msg = "out keyword argument"
+        out = np.zeros((5, 2), dtype=float)
+        self.matmul(a, b, out=out)
+        assert_array_equal(out, tgt, err_msg=msg)
+
+        # test out with not allowed type cast (safe casting)
+        msg = "Cannot cast ufunc .* output"
+        out = np.zeros((5, 2), dtype=np.int32)
+        assert_raises_regex(TypeError, msg, self.matmul, a, b, out=out)
+
+        # test out with type upcast to complex
+        out = np.zeros((5, 2), dtype=np.complex128)
+        c = self.matmul(a, b, out=out)
+        assert_(c is out)
+        with suppress_warnings() as sup:
+            sup.filter(np.ComplexWarning, '')
+            c = c.astype(tgt.dtype)
+        assert_array_equal(c, tgt)
+
+    def test_out_contiguous(self):
+        a = np.ones((5, 2), dtype=float)
+        b = np.array([[1, 3], [5, 7]], dtype=float)
+        v = np.array([1, 3], dtype=float)
+        tgt = np.dot(a, b)
+        tgt_mv = np.dot(a, v)
+
+        # test out non-contiguous
+        out = np.ones((5, 2, 2), dtype=float)
+        c = self.matmul(a, b, out=out[..., 0])
+        assert c.base is out
+        assert_array_equal(c, tgt)
+        c = self.matmul(a, v, out=out[:, 0, 0])
+        assert_array_equal(c, tgt_mv)
+        c = self.matmul(v, a.T, out=out[:, 0, 0])
+        assert_array_equal(c, tgt_mv)
+
+        # test out contiguous in only last dim
+        out = np.ones((10, 2), dtype=float)
+        c = self.matmul(a, b, out=out[::2, :])
+        assert_array_equal(c, tgt)
+
+        # test transposes of out, args
+        out = np.ones((5, 2), dtype=float)
+        c = self.matmul(b.T, a.T, out=out.T)
+        assert_array_equal(out, tgt)
+
+    m1 = np.arange(15.).reshape(5, 3)
+    m2 = np.arange(21.).reshape(3, 7)
+    m3 = np.arange(30.).reshape(5, 6)[:, ::2]  # non-contiguous
+    vc = np.arange(10.)
+    vr = np.arange(6.)
+    m0 = np.zeros((3, 0))
+    @pytest.mark.parametrize('args', (
+            # matrix-matrix
+            (m1, m2), (m2.T, m1.T), (m2.T.copy(), m1.T), (m2.T, m1.T.copy()),
+            # matrix-matrix-transpose, contiguous and non
+            (m1, m1.T), (m1.T, m1), (m1, m3.T), (m3, m1.T),
+            (m3, m3.T), (m3.T, m3),
+            # matrix-matrix non-contiguous
+            (m3, m2), (m2.T, m3.T), (m2.T.copy(), m3.T),
+            # vector-matrix, matrix-vector, contiguous
+            (m1, vr[:3]), (vc[:5], m1), (m1.T, vc[:5]), (vr[:3], m1.T),
+            # vector-matrix, matrix-vector, vector non-contiguous
+            (m1, vr[::2]), (vc[::2], m1), (m1.T, vc[::2]), (vr[::2], m1.T),
+            # vector-matrix, matrix-vector, matrix non-contiguous
+            (m3, vr[:3]), (vc[:5], m3), (m3.T, vc[:5]), (vr[:3], m3.T),
+            # vector-matrix, matrix-vector, both non-contiguous
+            (m3, vr[::2]), (vc[::2], m3), (m3.T, vc[::2]), (vr[::2], m3.T),
+            # size == 0
+            (m0, m0.T), (m0.T, m0), (m1, m0), (m0.T, m1.T),
+        ))
+    def test_dot_equivalent(self, args):
+        r1 = np.matmul(*args)
+        r2 = np.dot(*args)
+        assert_equal(r1, r2)
+
+        r3 = np.matmul(args[0].copy(), args[1].copy())
+        assert_equal(r1, r3)
+
+    def test_matmul_object(self):
+        import fractions
+
+        f = np.vectorize(fractions.Fraction)
+        def random_ints():
+            return np.random.randint(1, 1000, size=(10, 3, 3))
+        M1 = f(random_ints(), random_ints())
+        M2 = f(random_ints(), random_ints())
+
+        M3 = self.matmul(M1, M2)
+
+        [N1, N2, N3] = [a.astype(float) for a in [M1, M2, M3]]
+
+        assert_allclose(N3, self.matmul(N1, N2))
+
+    def test_matmul_object_type_scalar(self):
+        from fractions import Fraction as F
+        v = np.array([F(2,3), F(5,7)])
+        res = self.matmul(v, v)
+        assert_(type(res) is F)
+
+    def test_matmul_empty(self):
+        a = np.empty((3, 0), dtype=object)
+        b = np.empty((0, 3), dtype=object)
+        c = np.zeros((3, 3))
+        assert_array_equal(np.matmul(a, b), c)
+
+    def test_matmul_exception_multiply(self):
+        # test that matmul fails if `__mul__` is missing
+        class add_not_multiply():
+            def __add__(self, other):
+                return self
+        a = np.full((3,3), add_not_multiply())
+        with assert_raises(TypeError):
+            b = np.matmul(a, a)
+
+    def test_matmul_exception_add(self):
+        # test that matmul fails if `__add__` is missing
+        class multiply_not_add():
+            def __mul__(self, other):
+                return self
+        a = np.full((3,3), multiply_not_add())
+        with assert_raises(TypeError):
+            b = np.matmul(a, a)
+
+    def test_matmul_bool(self):
+        # gh-14439
+        a = np.array([[1, 0],[1, 1]], dtype=bool)
+        assert np.max(a.view(np.uint8)) == 1
+        b = np.matmul(a, a)
+        # matmul with boolean output should always be 0, 1
+        assert np.max(b.view(np.uint8)) == 1
+
+        rg = np.random.default_rng(np.random.PCG64(43))
+        d = rg.integers(2, size=4*5, dtype=np.int8)
+        d = d.reshape(4, 5) > 0
+        out1 = np.matmul(d, d.reshape(5, 4))
+        out2 = np.dot(d, d.reshape(5, 4))
+        assert_equal(out1, out2)
+
+        c = np.matmul(np.zeros((2, 0), dtype=bool), np.zeros(0, dtype=bool))
+        assert not np.any(c)
+
+
+class TestMatmulOperator(MatmulCommon):
+    import operator
+    matmul = operator.matmul
+
+    def test_array_priority_override(self):
+
+        class A:
+            __array_priority__ = 1000
+
+            def __matmul__(self, other):
+                return "A"
+
+            def __rmatmul__(self, other):
+                return "A"
+
+        a = A()
+        b = np.ones(2)
+        assert_equal(self.matmul(a, b), "A")
+        assert_equal(self.matmul(b, a), "A")
+
+    def test_matmul_raises(self):
+        assert_raises(TypeError, self.matmul, np.int8(5), np.int8(5))
+        assert_raises(TypeError, self.matmul, np.void(b'abc'), np.void(b'abc'))
+        assert_raises(ValueError, self.matmul, np.arange(10), np.void(b'abc'))
+
+def test_matmul_inplace():
+    # It would be nice to support in-place matmul eventually, but for now
+    # we don't have a working implementation, so better just to error out
+    # and nudge people to writing "a = a @ b".
+    a = np.eye(3)
+    b = np.eye(3)
+    assert_raises(TypeError, a.__imatmul__, b)
+    import operator
+    assert_raises(TypeError, operator.imatmul, a, b)
+    assert_raises(TypeError, exec, "a @= b", globals(), locals())
+
+def test_matmul_axes():
+    a = np.arange(3*4*5).reshape(3, 4, 5)
+    c = np.matmul(a, a, axes=[(-2, -1), (-1, -2), (1, 2)])
+    assert c.shape == (3, 4, 4)
+    d = np.matmul(a, a, axes=[(-2, -1), (-1, -2), (0, 1)])
+    assert d.shape == (4, 4, 3)
+    e = np.swapaxes(d, 0, 2)
+    assert_array_equal(e, c)
+    f = np.matmul(a, np.arange(3), axes=[(1, 0), (0), (0)])
+    assert f.shape == (4, 5)
+
+
+class TestInner:
+
+    def test_inner_type_mismatch(self):
+        c = 1.
+        A = np.array((1,1), dtype='i,i')
+
+        assert_raises(TypeError, np.inner, c, A)
+        assert_raises(TypeError, np.inner, A, c)
+
+    def test_inner_scalar_and_vector(self):
+        for dt in np.typecodes['AllInteger'] + np.typecodes['AllFloat'] + '?':
+            sca = np.array(3, dtype=dt)[()]
+            vec = np.array([1, 2], dtype=dt)
+            desired = np.array([3, 6], dtype=dt)
+            assert_equal(np.inner(vec, sca), desired)
+            assert_equal(np.inner(sca, vec), desired)
+
+    def test_vecself(self):
+        # Ticket 844.
+        # Inner product of a vector with itself segfaults or give
+        # meaningless result
+        a = np.zeros(shape=(1, 80), dtype=np.float64)
+        p = np.inner(a, a)
+        assert_almost_equal(p, 0, decimal=14)
+
+    def test_inner_product_with_various_contiguities(self):
+        # github issue 6532
+        for dt in np.typecodes['AllInteger'] + np.typecodes['AllFloat'] + '?':
+            # check an inner product involving a matrix transpose
+            A = np.array([[1, 2], [3, 4]], dtype=dt)
+            B = np.array([[1, 3], [2, 4]], dtype=dt)
+            C = np.array([1, 1], dtype=dt)
+            desired = np.array([4, 6], dtype=dt)
+            assert_equal(np.inner(A.T, C), desired)
+            assert_equal(np.inner(C, A.T), desired)
+            assert_equal(np.inner(B, C), desired)
+            assert_equal(np.inner(C, B), desired)
+            # check a matrix product
+            desired = np.array([[7, 10], [15, 22]], dtype=dt)
+            assert_equal(np.inner(A, B), desired)
+            # check the syrk vs. gemm paths
+            desired = np.array([[5, 11], [11, 25]], dtype=dt)
+            assert_equal(np.inner(A, A), desired)
+            assert_equal(np.inner(A, A.copy()), desired)
+            # check an inner product involving an aliased and reversed view
+            a = np.arange(5).astype(dt)
+            b = a[::-1]
+            desired = np.array(10, dtype=dt).item()
+            assert_equal(np.inner(b, a), desired)
+
+    def test_3d_tensor(self):
+        for dt in np.typecodes['AllInteger'] + np.typecodes['AllFloat'] + '?':
+            a = np.arange(24).reshape(2,3,4).astype(dt)
+            b = np.arange(24, 48).reshape(2,3,4).astype(dt)
+            desired = np.array(
+                [[[[ 158,  182,  206],
+                   [ 230,  254,  278]],
+
+                  [[ 566,  654,  742],
+                   [ 830,  918, 1006]],
+
+                  [[ 974, 1126, 1278],
+                   [1430, 1582, 1734]]],
+
+                 [[[1382, 1598, 1814],
+                   [2030, 2246, 2462]],
+
+                  [[1790, 2070, 2350],
+                   [2630, 2910, 3190]],
+
+                  [[2198, 2542, 2886],
+                   [3230, 3574, 3918]]]],
+                dtype=dt
+            )
+            assert_equal(np.inner(a, b), desired)
+            assert_equal(np.inner(b, a).transpose(2,3,0,1), desired)
+
+
+class TestAlen:
+    def test_basic(self):
+        with pytest.warns(DeprecationWarning):
+            m = np.array([1, 2, 3])
+            assert_equal(np.alen(m), 3)
+
+            m = np.array([[1, 2, 3], [4, 5, 7]])
+            assert_equal(np.alen(m), 2)
+
+            m = [1, 2, 3]
+            assert_equal(np.alen(m), 3)
+
+            m = [[1, 2, 3], [4, 5, 7]]
+            assert_equal(np.alen(m), 2)
+
+    def test_singleton(self):
+        with pytest.warns(DeprecationWarning):
+            assert_equal(np.alen(5), 1)
+
+
+class TestChoose:
+    def setup(self):
+        self.x = 2*np.ones((3,), dtype=int)
+        self.y = 3*np.ones((3,), dtype=int)
+        self.x2 = 2*np.ones((2, 3), dtype=int)
+        self.y2 = 3*np.ones((2, 3), dtype=int)
+        self.ind = [0, 0, 1]
+
+    def test_basic(self):
+        A = np.choose(self.ind, (self.x, self.y))
+        assert_equal(A, [2, 2, 3])
+
+    def test_broadcast1(self):
+        A = np.choose(self.ind, (self.x2, self.y2))
+        assert_equal(A, [[2, 2, 3], [2, 2, 3]])
+
+    def test_broadcast2(self):
+        A = np.choose(self.ind, (self.x, self.y2))
+        assert_equal(A, [[2, 2, 3], [2, 2, 3]])
+
+    @pytest.mark.parametrize("ops",
+        [(1000, np.array([1], dtype=np.uint8)),
+         (-1, np.array([1], dtype=np.uint8)),
+         (1., np.float32(3)),
+         (1., np.array([3], dtype=np.float32))],)
+    def test_output_dtype(self, ops):
+        expected_dt = np.result_type(*ops)
+        assert(np.choose([0], ops).dtype == expected_dt)
+
+
+class TestRepeat:
+    def setup(self):
+        self.m = np.array([1, 2, 3, 4, 5, 6])
+        self.m_rect = self.m.reshape((2, 3))
+
+    def test_basic(self):
+        A = np.repeat(self.m, [1, 3, 2, 1, 1, 2])
+        assert_equal(A, [1, 2, 2, 2, 3,
+                         3, 4, 5, 6, 6])
+
+    def test_broadcast1(self):
+        A = np.repeat(self.m, 2)
+        assert_equal(A, [1, 1, 2, 2, 3, 3,
+                         4, 4, 5, 5, 6, 6])
+
+    def test_axis_spec(self):
+        A = np.repeat(self.m_rect, [2, 1], axis=0)
+        assert_equal(A, [[1, 2, 3],
+                         [1, 2, 3],
+                         [4, 5, 6]])
+
+        A = np.repeat(self.m_rect, [1, 3, 2], axis=1)
+        assert_equal(A, [[1, 2, 2, 2, 3, 3],
+                         [4, 5, 5, 5, 6, 6]])
+
+    def test_broadcast2(self):
+        A = np.repeat(self.m_rect, 2, axis=0)
+        assert_equal(A, [[1, 2, 3],
+                         [1, 2, 3],
+                         [4, 5, 6],
+                         [4, 5, 6]])
+
+        A = np.repeat(self.m_rect, 2, axis=1)
+        assert_equal(A, [[1, 1, 2, 2, 3, 3],
+                         [4, 4, 5, 5, 6, 6]])
+
+
+# TODO: test for multidimensional
+NEIGH_MODE = {'zero': 0, 'one': 1, 'constant': 2, 'circular': 3, 'mirror': 4}
+
+
+@pytest.mark.parametrize('dt', [float, Decimal], ids=['float', 'object'])
+class TestNeighborhoodIter:
+    # Simple, 2d tests
+    def test_simple2d(self, dt):
+        # Test zero and one padding for simple data type
+        x = np.array([[0, 1], [2, 3]], dtype=dt)
+        r = [np.array([[0, 0, 0], [0, 0, 1]], dtype=dt),
+             np.array([[0, 0, 0], [0, 1, 0]], dtype=dt),
+             np.array([[0, 0, 1], [0, 2, 3]], dtype=dt),
+             np.array([[0, 1, 0], [2, 3, 0]], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 0, -1, 1], x[0], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        r = [np.array([[1, 1, 1], [1, 0, 1]], dtype=dt),
+             np.array([[1, 1, 1], [0, 1, 1]], dtype=dt),
+             np.array([[1, 0, 1], [1, 2, 3]], dtype=dt),
+             np.array([[0, 1, 1], [2, 3, 1]], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 0, -1, 1], x[0], NEIGH_MODE['one'])
+        assert_array_equal(l, r)
+
+        r = [np.array([[4, 4, 4], [4, 0, 1]], dtype=dt),
+             np.array([[4, 4, 4], [0, 1, 4]], dtype=dt),
+             np.array([[4, 0, 1], [4, 2, 3]], dtype=dt),
+             np.array([[0, 1, 4], [2, 3, 4]], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 0, -1, 1], 4, NEIGH_MODE['constant'])
+        assert_array_equal(l, r)
+
+    def test_mirror2d(self, dt):
+        x = np.array([[0, 1], [2, 3]], dtype=dt)
+        r = [np.array([[0, 0, 1], [0, 0, 1]], dtype=dt),
+             np.array([[0, 1, 1], [0, 1, 1]], dtype=dt),
+             np.array([[0, 0, 1], [2, 2, 3]], dtype=dt),
+             np.array([[0, 1, 1], [2, 3, 3]], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 0, -1, 1], x[0], NEIGH_MODE['mirror'])
+        assert_array_equal(l, r)
+
+    # Simple, 1d tests
+    def test_simple(self, dt):
+        # Test padding with constant values
+        x = np.linspace(1, 5, 5).astype(dt)
+        r = [[0, 1, 2], [1, 2, 3], [2, 3, 4], [3, 4, 5], [4, 5, 0]]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 1], x[0], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        r = [[1, 1, 2], [1, 2, 3], [2, 3, 4], [3, 4, 5], [4, 5, 1]]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 1], x[0], NEIGH_MODE['one'])
+        assert_array_equal(l, r)
+
+        r = [[x[4], 1, 2], [1, 2, 3], [2, 3, 4], [3, 4, 5], [4, 5, x[4]]]
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-1, 1], x[4], NEIGH_MODE['constant'])
+        assert_array_equal(l, r)
+
+    # Test mirror modes
+    def test_mirror(self, dt):
+        x = np.linspace(1, 5, 5).astype(dt)
+        r = np.array([[2, 1, 1, 2, 3], [1, 1, 2, 3, 4], [1, 2, 3, 4, 5],
+                [2, 3, 4, 5, 5], [3, 4, 5, 5, 4]], dtype=dt)
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-2, 2], x[1], NEIGH_MODE['mirror'])
+        assert_([i.dtype == dt for i in l])
+        assert_array_equal(l, r)
+
+    # Circular mode
+    def test_circular(self, dt):
+        x = np.linspace(1, 5, 5).astype(dt)
+        r = np.array([[4, 5, 1, 2, 3], [5, 1, 2, 3, 4], [1, 2, 3, 4, 5],
+                [2, 3, 4, 5, 1], [3, 4, 5, 1, 2]], dtype=dt)
+        l = _multiarray_tests.test_neighborhood_iterator(
+                x, [-2, 2], x[0], NEIGH_MODE['circular'])
+        assert_array_equal(l, r)
+
+
+# Test stacking neighborhood iterators
+class TestStackedNeighborhoodIter:
+    # Simple, 1d test: stacking 2 constant-padded neigh iterators
+    def test_simple_const(self):
+        dt = np.float64
+        # Test zero and one padding for simple data type
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([0], dtype=dt),
+             np.array([0], dtype=dt),
+             np.array([1], dtype=dt),
+             np.array([2], dtype=dt),
+             np.array([3], dtype=dt),
+             np.array([0], dtype=dt),
+             np.array([0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-2, 4], NEIGH_MODE['zero'], [0, 0], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        r = [np.array([1, 0, 1], dtype=dt),
+             np.array([0, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 0], dtype=dt),
+             np.array([3, 0, 1], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [-1, 1], NEIGH_MODE['one'])
+        assert_array_equal(l, r)
+
+    # 2nd simple, 1d test: stacking 2 neigh iterators, mixing const padding and
+    # mirror padding
+    def test_simple_mirror(self):
+        dt = np.float64
+        # Stacking zero on top of mirror
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([0, 1, 1], dtype=dt),
+             np.array([1, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 3], dtype=dt),
+             np.array([3, 3, 0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['mirror'], [-1, 1], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([1, 0, 0], dtype=dt),
+             np.array([0, 0, 1], dtype=dt),
+             np.array([0, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [-2, 0], NEIGH_MODE['mirror'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero: 2nd
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([0, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 0], dtype=dt),
+             np.array([3, 0, 0], dtype=dt),
+             np.array([0, 0, 3], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [0, 2], NEIGH_MODE['mirror'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero: 3rd
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([1, 0, 0, 1, 2], dtype=dt),
+             np.array([0, 0, 1, 2, 3], dtype=dt),
+             np.array([0, 1, 2, 3, 0], dtype=dt),
+             np.array([1, 2, 3, 0, 0], dtype=dt),
+             np.array([2, 3, 0, 0, 3], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [-2, 2], NEIGH_MODE['mirror'])
+        assert_array_equal(l, r)
+
+    # 3rd simple, 1d test: stacking 2 neigh iterators, mixing const padding and
+    # circular padding
+    def test_simple_circular(self):
+        dt = np.float64
+        # Stacking zero on top of mirror
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([0, 3, 1], dtype=dt),
+             np.array([3, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 1], dtype=dt),
+             np.array([3, 1, 0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['circular'], [-1, 1], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([3, 0, 0], dtype=dt),
+             np.array([0, 0, 1], dtype=dt),
+             np.array([0, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [-2, 0], NEIGH_MODE['circular'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero: 2nd
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([0, 1, 2], dtype=dt),
+             np.array([1, 2, 3], dtype=dt),
+             np.array([2, 3, 0], dtype=dt),
+             np.array([3, 0, 0], dtype=dt),
+             np.array([0, 0, 1], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [0, 2], NEIGH_MODE['circular'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero: 3rd
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([3, 0, 0, 1, 2], dtype=dt),
+             np.array([0, 0, 1, 2, 3], dtype=dt),
+             np.array([0, 1, 2, 3, 0], dtype=dt),
+             np.array([1, 2, 3, 0, 0], dtype=dt),
+             np.array([2, 3, 0, 0, 1], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [-1, 3], NEIGH_MODE['zero'], [-2, 2], NEIGH_MODE['circular'])
+        assert_array_equal(l, r)
+
+    # 4th simple, 1d test: stacking 2 neigh iterators, but with lower iterator
+    # being strictly within the array
+    def test_simple_strict_within(self):
+        dt = np.float64
+        # Stacking zero on top of zero, first neighborhood strictly inside the
+        # array
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([1, 2, 3, 0], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [1, 1], NEIGH_MODE['zero'], [-1, 2], NEIGH_MODE['zero'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero, first neighborhood strictly inside the
+        # array
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([1, 2, 3, 3], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [1, 1], NEIGH_MODE['zero'], [-1, 2], NEIGH_MODE['mirror'])
+        assert_array_equal(l, r)
+
+        # Stacking mirror on top of zero, first neighborhood strictly inside the
+        # array
+        x = np.array([1, 2, 3], dtype=dt)
+        r = [np.array([1, 2, 3, 1], dtype=dt)]
+        l = _multiarray_tests.test_neighborhood_iterator_oob(
+                x, [1, 1], NEIGH_MODE['zero'], [-1, 2], NEIGH_MODE['circular'])
+        assert_array_equal(l, r)
+
+class TestWarnings:
+
+    def test_complex_warning(self):
+        x = np.array([1, 2])
+        y = np.array([1-2j, 1+2j])
+
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", np.ComplexWarning)
+            assert_raises(np.ComplexWarning, x.__setitem__, slice(None), y)
+            assert_equal(x, [1, 2])
+
+
+class TestMinScalarType:
+
+    def test_usigned_shortshort(self):
+        dt = np.min_scalar_type(2**8-1)
+        wanted = np.dtype('uint8')
+        assert_equal(wanted, dt)
+
+    def test_usigned_short(self):
+        dt = np.min_scalar_type(2**16-1)
+        wanted = np.dtype('uint16')
+        assert_equal(wanted, dt)
+
+    def test_usigned_int(self):
+        dt = np.min_scalar_type(2**32-1)
+        wanted = np.dtype('uint32')
+        assert_equal(wanted, dt)
+
+    def test_usigned_longlong(self):
+        dt = np.min_scalar_type(2**63-1)
+        wanted = np.dtype('uint64')
+        assert_equal(wanted, dt)
+
+    def test_object(self):
+        dt = np.min_scalar_type(2**64)
+        wanted = np.dtype('O')
+        assert_equal(wanted, dt)
+
+
+from numpy.core._internal import _dtype_from_pep3118
+
+
+class TestPEP3118Dtype:
+    def _check(self, spec, wanted):
+        dt = np.dtype(wanted)
+        actual = _dtype_from_pep3118(spec)
+        assert_equal(actual, dt,
+                     err_msg="spec %r != dtype %r" % (spec, wanted))
+
+    def test_native_padding(self):
+        align = np.dtype('i').alignment
+        for j in range(8):
+            if j == 0:
+                s = 'bi'
+            else:
+                s = 'b%dxi' % j
+            self._check('@'+s, {'f0': ('i1', 0),
+                                'f1': ('i', align*(1 + j//align))})
+            self._check('='+s, {'f0': ('i1', 0),
+                                'f1': ('i', 1+j)})
+
+    def test_native_padding_2(self):
+        # Native padding should work also for structs and sub-arrays
+        self._check('x3T{xi}', {'f0': (({'f0': ('i', 4)}, (3,)), 4)})
+        self._check('^x3T{xi}', {'f0': (({'f0': ('i', 1)}, (3,)), 1)})
+
+    def test_trailing_padding(self):
+        # Trailing padding should be included, *and*, the item size
+        # should match the alignment if in aligned mode
+        align = np.dtype('i').alignment
+        size = np.dtype('i').itemsize
+
+        def aligned(n):
+            return align*(1 + (n-1)//align)
+
+        base = dict(formats=['i'], names=['f0'])
+
+        self._check('ix',    dict(itemsize=aligned(size + 1), **base))
+        self._check('ixx',   dict(itemsize=aligned(size + 2), **base))
+        self._check('ixxx',  dict(itemsize=aligned(size + 3), **base))
+        self._check('ixxxx', dict(itemsize=aligned(size + 4), **base))
+        self._check('i7x',   dict(itemsize=aligned(size + 7), **base))
+
+        self._check('^ix',    dict(itemsize=size + 1, **base))
+        self._check('^ixx',   dict(itemsize=size + 2, **base))
+        self._check('^ixxx',  dict(itemsize=size + 3, **base))
+        self._check('^ixxxx', dict(itemsize=size + 4, **base))
+        self._check('^i7x',   dict(itemsize=size + 7, **base))
+
+    def test_native_padding_3(self):
+        dt = np.dtype(
+                [('a', 'b'), ('b', 'i'),
+                    ('sub', np.dtype('b,i')), ('c', 'i')],
+                align=True)
+        self._check("T{b:a:xxxi:b:T{b:f0:=i:f1:}:sub:xxxi:c:}", dt)
+
+        dt = np.dtype(
+                [('a', 'b'), ('b', 'i'), ('c', 'b'), ('d', 'b'),
+                    ('e', 'b'), ('sub', np.dtype('b,i', align=True))])
+        self._check("T{b:a:=i:b:b:c:b:d:b:e:T{b:f0:xxxi:f1:}:sub:}", dt)
+
+    def test_padding_with_array_inside_struct(self):
+        dt = np.dtype(
+                [('a', 'b'), ('b', 'i'), ('c', 'b', (3,)),
+                    ('d', 'i')],
+                align=True)
+        self._check("T{b:a:xxxi:b:3b:c:xi:d:}", dt)
+
+    def test_byteorder_inside_struct(self):
+        # The byte order after @T{=i} should be '=', not '@'.
+        # Check this by noting the absence of native alignment.
+        self._check('@T{^i}xi', {'f0': ({'f0': ('i', 0)}, 0),
+                                 'f1': ('i', 5)})
+
+    def test_intra_padding(self):
+        # Natively aligned sub-arrays may require some internal padding
+        align = np.dtype('i').alignment
+        size = np.dtype('i').itemsize
+
+        def aligned(n):
+            return (align*(1 + (n-1)//align))
+
+        self._check('(3)T{ix}', (dict(
+            names=['f0'],
+            formats=['i'],
+            offsets=[0],
+            itemsize=aligned(size + 1)
+        ), (3,)))
+
+    def test_char_vs_string(self):
+        dt = np.dtype('c')
+        self._check('c', dt)
+
+        dt = np.dtype([('f0', 'S1', (4,)), ('f1', 'S4')])
+        self._check('4c4s', dt)
+
+    def test_field_order(self):
+        # gh-9053 - previously, we relied on dictionary key order
+        self._check("(0)I:a:f:b:", [('a', 'I', (0,)), ('b', 'f')])
+        self._check("(0)I:b:f:a:", [('b', 'I', (0,)), ('a', 'f')])
+
+    def test_unnamed_fields(self):
+        self._check('ii',     [('f0', 'i'), ('f1', 'i')])
+        self._check('ii:f0:', [('f1', 'i'), ('f0', 'i')])
+
+        self._check('i', 'i')
+        self._check('i:f0:', [('f0', 'i')])
+
+
+class TestNewBufferProtocol:
+    """ Test PEP3118 buffers """
+
+    def _check_roundtrip(self, obj):
+        obj = np.asarray(obj)
+        x = memoryview(obj)
+        y = np.asarray(x)
+        y2 = np.array(x)
+        assert_(not y.flags.owndata)
+        assert_(y2.flags.owndata)
+
+        assert_equal(y.dtype, obj.dtype)
+        assert_equal(y.shape, obj.shape)
+        assert_array_equal(obj, y)
+
+        assert_equal(y2.dtype, obj.dtype)
+        assert_equal(y2.shape, obj.shape)
+        assert_array_equal(obj, y2)
+
+    def test_roundtrip(self):
+        x = np.array([1, 2, 3, 4, 5], dtype='i4')
+        self._check_roundtrip(x)
+
+        x = np.array([[1, 2], [3, 4]], dtype=np.float64)
+        self._check_roundtrip(x)
+
+        x = np.zeros((3, 3, 3), dtype=np.float32)[:, 0,:]
+        self._check_roundtrip(x)
+
+        dt = [('a', 'b'),
+              ('b', 'h'),
+              ('c', 'i'),
+              ('d', 'l'),
+              ('dx', 'q'),
+              ('e', 'B'),
+              ('f', 'H'),
+              ('g', 'I'),
+              ('h', 'L'),
+              ('hx', 'Q'),
+              ('i', np.single),
+              ('j', np.double),
+              ('k', np.longdouble),
+              ('ix', np.csingle),
+              ('jx', np.cdouble),
+              ('kx', np.clongdouble),
+              ('l', 'S4'),
+              ('m', 'U4'),
+              ('n', 'V3'),
+              ('o', '?'),
+              ('p', np.half),
+              ]
+        x = np.array(
+                [(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+                    b'aaaa', 'bbbb', b'xxx', True, 1.0)],
+                dtype=dt)
+        self._check_roundtrip(x)
+
+        x = np.array(([[1, 2], [3, 4]],), dtype=[('a', (int, (2, 2)))])
+        self._check_roundtrip(x)
+
+        x = np.array([1, 2, 3], dtype='>i2')
+        self._check_roundtrip(x)
+
+        x = np.array([1, 2, 3], dtype='<i2')
+        self._check_roundtrip(x)
+
+        x = np.array([1, 2, 3], dtype='>i4')
+        self._check_roundtrip(x)
+
+        x = np.array([1, 2, 3], dtype='<i4')
+        self._check_roundtrip(x)
+
+        # check long long can be represented as non-native
+        x = np.array([1, 2, 3], dtype='>q')
+        self._check_roundtrip(x)
+
+        # Native-only data types can be passed through the buffer interface
+        # only in native byte order
+        if sys.byteorder == 'little':
+            x = np.array([1, 2, 3], dtype='>g')
+            assert_raises(ValueError, self._check_roundtrip, x)
+            x = np.array([1, 2, 3], dtype='<g')
+            self._check_roundtrip(x)
+        else:
+            x = np.array([1, 2, 3], dtype='>g')
+            self._check_roundtrip(x)
+            x = np.array([1, 2, 3], dtype='<g')
+            assert_raises(ValueError, self._check_roundtrip, x)
+
+    def test_roundtrip_half(self):
+        half_list = [
+            1.0,
+            -2.0,
+            6.5504 * 10**4,  # (max half precision)
+            2**-14,  # ~= 6.10352 * 10**-5 (minimum positive normal)
+            2**-24,  # ~= 5.96046 * 10**-8 (minimum strictly positive subnormal)
+            0.0,
+            -0.0,
+            float('+inf'),
+            float('-inf'),
+            0.333251953125,  # ~= 1/3
+        ]
+
+        x = np.array(half_list, dtype='>e')
+        self._check_roundtrip(x)
+        x = np.array(half_list, dtype='<e')
+        self._check_roundtrip(x)
+
+    def test_roundtrip_single_types(self):
+        for typ in np.typeDict.values():
+            dtype = np.dtype(typ)
+
+            if dtype.char in 'Mm':
+                # datetimes cannot be used in buffers
+                continue
+            if dtype.char == 'V':
+                # skip void
+                continue
+
+            x = np.zeros(4, dtype=dtype)
+            self._check_roundtrip(x)
+
+            if dtype.char not in 'qQgG':
+                dt = dtype.newbyteorder('<')
+                x = np.zeros(4, dtype=dt)
+                self._check_roundtrip(x)
+
+                dt = dtype.newbyteorder('>')
+                x = np.zeros(4, dtype=dt)
+                self._check_roundtrip(x)
+
+    def test_roundtrip_scalar(self):
+        # Issue #4015.
+        self._check_roundtrip(0)
+
+    def test_invalid_buffer_format(self):
+        # datetime64 cannot be used fully in a buffer yet
+        # Should be fixed in the next Numpy major release
+        dt = np.dtype([('a', 'uint16'), ('b', 'M8[s]')])
+        a = np.empty(3, dt)
+        assert_raises((ValueError, BufferError), memoryview, a)
+        assert_raises((ValueError, BufferError), memoryview, np.array((3), 'M8[D]'))
+
+    def test_export_simple_1d(self):
+        x = np.array([1, 2, 3, 4, 5], dtype='i')
+        y = memoryview(x)
+        assert_equal(y.format, 'i')
+        assert_equal(y.shape, (5,))
+        assert_equal(y.ndim, 1)
+        assert_equal(y.strides, (4,))
+        assert_equal(y.suboffsets, ())
+        assert_equal(y.itemsize, 4)
+
+    def test_export_simple_nd(self):
+        x = np.array([[1, 2], [3, 4]], dtype=np.float64)
+        y = memoryview(x)
+        assert_equal(y.format, 'd')
+        assert_equal(y.shape, (2, 2))
+        assert_equal(y.ndim, 2)
+        assert_equal(y.strides, (16, 8))
+        assert_equal(y.suboffsets, ())
+        assert_equal(y.itemsize, 8)
+
+    def test_export_discontiguous(self):
+        x = np.zeros((3, 3, 3), dtype=np.float32)[:, 0,:]
+        y = memoryview(x)
+        assert_equal(y.format, 'f')
+        assert_equal(y.shape, (3, 3))
+        assert_equal(y.ndim, 2)
+        assert_equal(y.strides, (36, 4))
+        assert_equal(y.suboffsets, ())
+        assert_equal(y.itemsize, 4)
+
+    def test_export_record(self):
+        dt = [('a', 'b'),
+              ('b', 'h'),
+              ('c', 'i'),
+              ('d', 'l'),
+              ('dx', 'q'),
+              ('e', 'B'),
+              ('f', 'H'),
+              ('g', 'I'),
+              ('h', 'L'),
+              ('hx', 'Q'),
+              ('i', np.single),
+              ('j', np.double),
+              ('k', np.longdouble),
+              ('ix', np.csingle),
+              ('jx', np.cdouble),
+              ('kx', np.clongdouble),
+              ('l', 'S4'),
+              ('m', 'U4'),
+              ('n', 'V3'),
+              ('o', '?'),
+              ('p', np.half),
+              ]
+        x = np.array(
+                [(1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1,
+                    b'aaaa', 'bbbb', b'   ', True, 1.0)],
+                dtype=dt)
+        y = memoryview(x)
+        assert_equal(y.shape, (1,))
+        assert_equal(y.ndim, 1)
+        assert_equal(y.suboffsets, ())
+
+        sz = sum([np.dtype(b).itemsize for a, b in dt])
+        if np.dtype('l').itemsize == 4:
+            assert_equal(y.format, 'T{b:a:=h:b:i:c:l:d:q:dx:B:e:@H:f:=I:g:L:h:Q:hx:f:i:d:j:^g:k:=Zf:ix:Zd:jx:^Zg:kx:4s:l:=4w:m:3x:n:?:o:@e:p:}')
+        else:
+            assert_equal(y.format, 'T{b:a:=h:b:i:c:q:d:q:dx:B:e:@H:f:=I:g:Q:h:Q:hx:f:i:d:j:^g:k:=Zf:ix:Zd:jx:^Zg:kx:4s:l:=4w:m:3x:n:?:o:@e:p:}')
+        # Cannot test if NPY_RELAXED_STRIDES_CHECKING changes the strides
+        if not (np.ones(1).strides[0] == np.iinfo(np.intp).max):
+            assert_equal(y.strides, (sz,))
+        assert_equal(y.itemsize, sz)
+
+    def test_export_subarray(self):
+        x = np.array(([[1, 2], [3, 4]],), dtype=[('a', ('i', (2, 2)))])
+        y = memoryview(x)
+        assert_equal(y.format, 'T{(2,2)i:a:}')
+        assert_equal(y.shape, ())
+        assert_equal(y.ndim, 0)
+        assert_equal(y.strides, ())
+        assert_equal(y.suboffsets, ())
+        assert_equal(y.itemsize, 16)
+
+    def test_export_endian(self):
+        x = np.array([1, 2, 3], dtype='>i')
+        y = memoryview(x)
+        if sys.byteorder == 'little':
+            assert_equal(y.format, '>i')
+        else:
+            assert_equal(y.format, 'i')
+
+        x = np.array([1, 2, 3], dtype='<i')
+        y = memoryview(x)
+        if sys.byteorder == 'little':
+            assert_equal(y.format, 'i')
+        else:
+            assert_equal(y.format, '<i')
+
+    def test_export_flags(self):
+        # Check SIMPLE flag, see also gh-3613 (exception should be BufferError)
+        assert_raises(ValueError,
+                      _multiarray_tests.get_buffer_info,
+                       np.arange(5)[::2], ('SIMPLE',))
+
+    def test_padding(self):
+        for j in range(8):
+            x = np.array([(1,), (2,)], dtype={'f0': (int, j)})
+            self._check_roundtrip(x)
+
+    def test_reference_leak(self):
+        if HAS_REFCOUNT:
+            count_1 = sys.getrefcount(np.core._internal)
+        a = np.zeros(4)
+        b = memoryview(a)
+        c = np.asarray(b)
+        if HAS_REFCOUNT:
+            count_2 = sys.getrefcount(np.core._internal)
+            assert_equal(count_1, count_2)
+        del c  # avoid pyflakes unused variable warning.
+
+    def test_padded_struct_array(self):
+        dt1 = np.dtype(
+                [('a', 'b'), ('b', 'i'), ('sub', np.dtype('b,i')), ('c', 'i')],
+                align=True)
+        x1 = np.arange(dt1.itemsize, dtype=np.int8).view(dt1)
+        self._check_roundtrip(x1)
+
+        dt2 = np.dtype(
+                [('a', 'b'), ('b', 'i'), ('c', 'b', (3,)), ('d', 'i')],
+                align=True)
+        x2 = np.arange(dt2.itemsize, dtype=np.int8).view(dt2)
+        self._check_roundtrip(x2)
+
+        dt3 = np.dtype(
+                [('a', 'b'), ('b', 'i'), ('c', 'b'), ('d', 'b'),
+                    ('e', 'b'), ('sub', np.dtype('b,i', align=True))])
+        x3 = np.arange(dt3.itemsize, dtype=np.int8).view(dt3)
+        self._check_roundtrip(x3)
+
+    def test_relaxed_strides(self):
+        # Test that relaxed strides are converted to non-relaxed
+        c = np.ones((1, 10, 10), dtype='i8')
+
+        # Check for NPY_RELAXED_STRIDES_CHECKING:
+        if np.ones((10, 1), order="C").flags.f_contiguous:
+            c.strides = (-1, 80, 8)
+
+        assert_(memoryview(c).strides == (800, 80, 8))
+
+        # Writing C-contiguous data to a BytesIO buffer should work
+        fd = io.BytesIO()
+        fd.write(c.data)
+
+        fortran = c.T
+        assert_(memoryview(fortran).strides == (8, 80, 800))
+
+        arr = np.ones((1, 10))
+        if arr.flags.f_contiguous:
+            shape, strides = _multiarray_tests.get_buffer_info(
+                    arr, ['F_CONTIGUOUS'])
+            assert_(strides[0] == 8)
+            arr = np.ones((10, 1), order='F')
+            shape, strides = _multiarray_tests.get_buffer_info(
+                    arr, ['C_CONTIGUOUS'])
+            assert_(strides[-1] == 8)
+
+    def test_out_of_order_fields(self):
+        dt = np.dtype(dict(
+            formats=['<i4', '<i4'],
+            names=['one', 'two'],
+            offsets=[4, 0],
+            itemsize=8
+        ))
+
+        # overlapping fields cannot be represented by PEP3118
+        arr = np.empty(1, dt)
+        with assert_raises(ValueError):
+            memoryview(arr)
+
+    def test_max_dims(self):
+        a = np.empty((1,) * 32)
+        self._check_roundtrip(a)
+
+    @pytest.mark.slow
+    def test_error_too_many_dims(self):
+        def make_ctype(shape, scalar_type):
+            t = scalar_type
+            for dim in shape[::-1]:
+                t = dim * t
+            return t
+
+        # construct a memoryview with 33 dimensions
+        c_u8_33d = make_ctype((1,)*33, ctypes.c_uint8)
+        m = memoryview(c_u8_33d())
+        assert_equal(m.ndim, 33)
+
+        assert_raises_regex(
+            RuntimeError, "ndim",
+            np.array, m)
+
+        # The above seems to create some deep cycles, clean them up for
+        # easier reference count debugging:
+        del c_u8_33d, m
+        for i in range(33):
+            if gc.collect() == 0:
+                break
+
+    def test_error_pointer_type(self):
+        # gh-6741
+        m = memoryview(ctypes.pointer(ctypes.c_uint8()))
+        assert_('&' in m.format)
+
+        assert_raises_regex(
+            ValueError, "format string",
+            np.array, m)
+
+    def test_error_message_unsupported(self):
+        # wchar has no corresponding numpy type - if this changes in future, we
+        # need a better way to construct an invalid memoryview format.
+        t = ctypes.c_wchar * 4
+        with assert_raises(ValueError) as cm:
+            np.array(t())
+
+        exc = cm.exception
+        with assert_raises_regex(
+            NotImplementedError,
+            r"Unrepresentable .* 'u' \(UCS-2 strings\)"
+        ):
+            raise exc.__cause__
+
+    def test_ctypes_integer_via_memoryview(self):
+        # gh-11150, due to bpo-10746
+        for c_integer in {ctypes.c_int, ctypes.c_long, ctypes.c_longlong}:
+            value = c_integer(42)
+            with warnings.catch_warnings(record=True):
+                warnings.filterwarnings('always', r'.*\bctypes\b', RuntimeWarning)
+                np.asarray(value)
+
+    def test_ctypes_struct_via_memoryview(self):
+        # gh-10528
+        class foo(ctypes.Structure):
+            _fields_ = [('a', ctypes.c_uint8), ('b', ctypes.c_uint32)]
+        f = foo(a=1, b=2)
+
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings('always', r'.*\bctypes\b', RuntimeWarning)
+            arr = np.asarray(f)
+
+        assert_equal(arr['a'], 1)
+        assert_equal(arr['b'], 2)
+        f.a = 3
+        assert_equal(arr['a'], 3)
+
+
+class TestArrayAttributeDeletion:
+
+    def test_multiarray_writable_attributes_deletion(self):
+        # ticket #2046, should not seqfault, raise AttributeError
+        a = np.ones(2)
+        attr = ['shape', 'strides', 'data', 'dtype', 'real', 'imag', 'flat']
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "Assigning the 'data' attribute")
+            for s in attr:
+                assert_raises(AttributeError, delattr, a, s)
+
+    def test_multiarray_not_writable_attributes_deletion(self):
+        a = np.ones(2)
+        attr = ["ndim", "flags", "itemsize", "size", "nbytes", "base",
+                "ctypes", "T", "__array_interface__", "__array_struct__",
+                "__array_priority__", "__array_finalize__"]
+        for s in attr:
+            assert_raises(AttributeError, delattr, a, s)
+
+    def test_multiarray_flags_writable_attribute_deletion(self):
+        a = np.ones(2).flags
+        attr = ['writebackifcopy', 'updateifcopy', 'aligned', 'writeable']
+        for s in attr:
+            assert_raises(AttributeError, delattr, a, s)
+
+    def test_multiarray_flags_not_writable_attribute_deletion(self):
+        a = np.ones(2).flags
+        attr = ["contiguous", "c_contiguous", "f_contiguous", "fortran",
+                "owndata", "fnc", "forc", "behaved", "carray", "farray",
+                "num"]
+        for s in attr:
+            assert_raises(AttributeError, delattr, a, s)
+
+
+class TestArrayInterface():
+    class Foo:
+        def __init__(self, value):
+            self.value = value
+            self.iface = {'typestr': 'f8'}
+
+        def __float__(self):
+            return float(self.value)
+
+        @property
+        def __array_interface__(self):
+            return self.iface
+
+
+    f = Foo(0.5)
+
+    @pytest.mark.parametrize('val, iface, expected', [
+        (f, {}, 0.5),
+        ([f], {}, [0.5]),
+        ([f, f], {}, [0.5, 0.5]),
+        (f, {'shape': ()}, 0.5),
+        (f, {'shape': None}, TypeError),
+        (f, {'shape': (1, 1)}, [[0.5]]),
+        (f, {'shape': (2,)}, ValueError),
+        (f, {'strides': ()}, 0.5),
+        (f, {'strides': (2,)}, ValueError),
+        (f, {'strides': 16}, TypeError),
+        ])
+    def test_scalar_interface(self, val, iface, expected):
+        # Test scalar coercion within the array interface
+        self.f.iface = {'typestr': 'f8'}
+        self.f.iface.update(iface)
+        if HAS_REFCOUNT:
+            pre_cnt = sys.getrefcount(np.dtype('f8'))
+        if isinstance(expected, type):
+            assert_raises(expected, np.array, val)
+        else:
+            result = np.array(val)
+            assert_equal(np.array(val), expected)
+            assert result.dtype == 'f8'
+            del result
+        if HAS_REFCOUNT:
+            post_cnt = sys.getrefcount(np.dtype('f8'))
+            assert_equal(pre_cnt, post_cnt)
+
+def test_interface_no_shape():
+    class ArrayLike:
+        array = np.array(1)
+        __array_interface__ = array.__array_interface__
+    assert_equal(np.array(ArrayLike()), 1)
+
+
+def test_array_interface_itemsize():
+    # See gh-6361
+    my_dtype = np.dtype({'names': ['A', 'B'], 'formats': ['f4', 'f4'],
+                         'offsets': [0, 8], 'itemsize': 16})
+    a = np.ones(10, dtype=my_dtype)
+    descr_t = np.dtype(a.__array_interface__['descr'])
+    typestr_t = np.dtype(a.__array_interface__['typestr'])
+    assert_equal(descr_t.itemsize, typestr_t.itemsize)
+
+
+def test_array_interface_empty_shape():
+    # See gh-7994
+    arr = np.array([1, 2, 3])
+    interface1 = dict(arr.__array_interface__)
+    interface1['shape'] = ()
+
+    class DummyArray1:
+        __array_interface__ = interface1
+
+    # NOTE: Because Py2 str/Py3 bytes supports the buffer interface, setting
+    # the interface data to bytes would invoke the bug this tests for, that
+    # __array_interface__ with shape=() is not allowed if the data is an object
+    # exposing the buffer interface
+    interface2 = dict(interface1)
+    interface2['data'] = arr[0].tobytes()
+
+    class DummyArray2:
+        __array_interface__ = interface2
+
+    arr1 = np.asarray(DummyArray1())
+    arr2 = np.asarray(DummyArray2())
+    arr3 = arr[:1].reshape(())
+    assert_equal(arr1, arr2)
+    assert_equal(arr1, arr3)
+
+def test_array_interface_offset():
+    arr = np.array([1, 2, 3], dtype='int32')
+    interface = dict(arr.__array_interface__)
+    interface['data'] = memoryview(arr)
+    interface['shape'] = (2,)
+    interface['offset'] = 4
+
+
+    class DummyArray:
+        __array_interface__ = interface
+
+    arr1 = np.asarray(DummyArray())
+    assert_equal(arr1, arr[1:])
+
+def test_flat_element_deletion():
+    it = np.ones(3).flat
+    try:
+        del it[1]
+        del it[1:2]
+    except TypeError:
+        pass
+    except Exception:
+        raise AssertionError
+
+
+def test_scalar_element_deletion():
+    a = np.zeros(2, dtype=[('x', 'int'), ('y', 'int')])
+    assert_raises(ValueError, a[0].__delitem__, 'x')
+
+
+class TestMemEventHook:
+    def test_mem_seteventhook(self):
+        # The actual tests are within the C code in
+        # multiarray/_multiarray_tests.c.src
+        _multiarray_tests.test_pydatamem_seteventhook_start()
+        # force an allocation and free of a numpy array
+        # needs to be larger then limit of small memory cacher in ctors.c
+        a = np.zeros(1000)
+        del a
+        break_cycles()
+        _multiarray_tests.test_pydatamem_seteventhook_end()
+
+class TestMapIter:
+    def test_mapiter(self):
+        # The actual tests are within the C code in
+        # multiarray/_multiarray_tests.c.src
+
+        a = np.arange(12).reshape((3, 4)).astype(float)
+        index = ([1, 1, 2, 0],
+                 [0, 0, 2, 3])
+        vals = [50, 50, 30, 16]
+
+        _multiarray_tests.test_inplace_increment(a, index, vals)
+        assert_equal(a, [[0.00, 1., 2.0, 19.],
+                         [104., 5., 6.0, 7.0],
+                         [8.00, 9., 40., 11.]])
+
+        b = np.arange(6).astype(float)
+        index = (np.array([1, 2, 0]),)
+        vals = [50, 4, 100.1]
+        _multiarray_tests.test_inplace_increment(b, index, vals)
+        assert_equal(b, [100.1,  51.,   6.,   3.,   4.,   5.])
+
+
+class TestAsCArray:
+    def test_1darray(self):
+        array = np.arange(24, dtype=np.double)
+        from_c = _multiarray_tests.test_as_c_array(array, 3)
+        assert_equal(array[3], from_c)
+
+    def test_2darray(self):
+        array = np.arange(24, dtype=np.double).reshape(3, 8)
+        from_c = _multiarray_tests.test_as_c_array(array, 2, 4)
+        assert_equal(array[2, 4], from_c)
+
+    def test_3darray(self):
+        array = np.arange(24, dtype=np.double).reshape(2, 3, 4)
+        from_c = _multiarray_tests.test_as_c_array(array, 1, 2, 3)
+        assert_equal(array[1, 2, 3], from_c)
+
+
+class TestConversion:
+    def test_array_scalar_relational_operation(self):
+        # All integer
+        for dt1 in np.typecodes['AllInteger']:
+            assert_(1 > np.array(0, dtype=dt1), "type %s failed" % (dt1,))
+            assert_(not 1 < np.array(0, dtype=dt1), "type %s failed" % (dt1,))
+
+            for dt2 in np.typecodes['AllInteger']:
+                assert_(np.array(1, dtype=dt1) > np.array(0, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1) < np.array(0, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+
+        # Unsigned integers
+        for dt1 in 'BHILQP':
+            assert_(-1 < np.array(1, dtype=dt1), "type %s failed" % (dt1,))
+            assert_(not -1 > np.array(1, dtype=dt1), "type %s failed" % (dt1,))
+            assert_(-1 != np.array(1, dtype=dt1), "type %s failed" % (dt1,))
+
+            # Unsigned vs signed
+            for dt2 in 'bhilqp':
+                assert_(np.array(1, dtype=dt1) > np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1) < np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(np.array(1, dtype=dt1) != np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+
+        # Signed integers and floats
+        for dt1 in 'bhlqp' + np.typecodes['Float']:
+            assert_(1 > np.array(-1, dtype=dt1), "type %s failed" % (dt1,))
+            assert_(not 1 < np.array(-1, dtype=dt1), "type %s failed" % (dt1,))
+            assert_(-1 == np.array(-1, dtype=dt1), "type %s failed" % (dt1,))
+
+            for dt2 in 'bhlqp' + np.typecodes['Float']:
+                assert_(np.array(1, dtype=dt1) > np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1) < np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(np.array(-1, dtype=dt1) == np.array(-1, dtype=dt2),
+                        "type %s and %s failed" % (dt1, dt2))
+
+    def test_to_bool_scalar(self):
+        assert_equal(bool(np.array([False])), False)
+        assert_equal(bool(np.array([True])), True)
+        assert_equal(bool(np.array([[42]])), True)
+        assert_raises(ValueError, bool, np.array([1, 2]))
+
+        class NotConvertible:
+            def __bool__(self):
+                raise NotImplementedError
+
+        assert_raises(NotImplementedError, bool, np.array(NotConvertible()))
+        assert_raises(NotImplementedError, bool, np.array([NotConvertible()]))
+
+        self_containing = np.array([None])
+        self_containing[0] = self_containing
+        try:
+            Error = RecursionError
+        except NameError:
+            Error = RuntimeError  # python < 3.5
+        assert_raises(Error, bool, self_containing)  # previously stack overflow
+        self_containing[0] = None  # resolve circular reference
+
+    def test_to_int_scalar(self):
+        # gh-9972 means that these aren't always the same
+        int_funcs = (int, lambda x: x.__int__())
+        for int_func in int_funcs:
+            assert_equal(int_func(np.array(0)), 0)
+            assert_equal(int_func(np.array([1])), 1)
+            assert_equal(int_func(np.array([[42]])), 42)
+            assert_raises(TypeError, int_func, np.array([1, 2]))
+
+            # gh-9972
+            assert_equal(4, int_func(np.array('4')))
+            assert_equal(5, int_func(np.bytes_(b'5')))
+            assert_equal(6, int_func(np.unicode_(u'6')))
+
+            class HasTrunc:
+                def __trunc__(self):
+                    return 3
+            assert_equal(3, int_func(np.array(HasTrunc())))
+            assert_equal(3, int_func(np.array([HasTrunc()])))
+
+            class NotConvertible:
+                def __int__(self):
+                    raise NotImplementedError
+            assert_raises(NotImplementedError,
+                int_func, np.array(NotConvertible()))
+            assert_raises(NotImplementedError,
+                int_func, np.array([NotConvertible()]))
+
+
+class TestWhere:
+    def test_basic(self):
+        dts = [bool, np.int16, np.int32, np.int64, np.double, np.complex128,
+               np.longdouble, np.clongdouble]
+        for dt in dts:
+            c = np.ones(53, dtype=bool)
+            assert_equal(np.where( c, dt(0), dt(1)), dt(0))
+            assert_equal(np.where(~c, dt(0), dt(1)), dt(1))
+            assert_equal(np.where(True, dt(0), dt(1)), dt(0))
+            assert_equal(np.where(False, dt(0), dt(1)), dt(1))
+            d = np.ones_like(c).astype(dt)
+            e = np.zeros_like(d)
+            r = d.astype(dt)
+            c[7] = False
+            r[7] = e[7]
+            assert_equal(np.where(c, e, e), e)
+            assert_equal(np.where(c, d, e), r)
+            assert_equal(np.where(c, d, e[0]), r)
+            assert_equal(np.where(c, d[0], e), r)
+            assert_equal(np.where(c[::2], d[::2], e[::2]), r[::2])
+            assert_equal(np.where(c[1::2], d[1::2], e[1::2]), r[1::2])
+            assert_equal(np.where(c[::3], d[::3], e[::3]), r[::3])
+            assert_equal(np.where(c[1::3], d[1::3], e[1::3]), r[1::3])
+            assert_equal(np.where(c[::-2], d[::-2], e[::-2]), r[::-2])
+            assert_equal(np.where(c[::-3], d[::-3], e[::-3]), r[::-3])
+            assert_equal(np.where(c[1::-3], d[1::-3], e[1::-3]), r[1::-3])
+
+    def test_exotic(self):
+        # object
+        assert_array_equal(np.where(True, None, None), np.array(None))
+        # zero sized
+        m = np.array([], dtype=bool).reshape(0, 3)
+        b = np.array([], dtype=np.float64).reshape(0, 3)
+        assert_array_equal(np.where(m, 0, b), np.array([]).reshape(0, 3))
+
+        # object cast
+        d = np.array([-1.34, -0.16, -0.54, -0.31, -0.08, -0.95, 0.000, 0.313,
+                      0.547, -0.18, 0.876, 0.236, 1.969, 0.310, 0.699, 1.013,
+                      1.267, 0.229, -1.39, 0.487])
+        nan = float('NaN')
+        e = np.array(['5z', '0l', nan, 'Wz', nan, nan, 'Xq', 'cs', nan, nan,
+                     'QN', nan, nan, 'Fd', nan, nan, 'kp', nan, '36', 'i1'],
+                     dtype=object)
+        m = np.array([0, 0, 1, 0, 1, 1, 0, 0, 1, 1,
+                      0, 1, 1, 0, 1, 1, 0, 1, 0, 0], dtype=bool)
+
+        r = e[:]
+        r[np.where(m)] = d[np.where(m)]
+        assert_array_equal(np.where(m, d, e), r)
+
+        r = e[:]
+        r[np.where(~m)] = d[np.where(~m)]
+        assert_array_equal(np.where(m, e, d), r)
+
+        assert_array_equal(np.where(m, e, e), e)
+
+        # minimal dtype result with NaN scalar (e.g required by pandas)
+        d = np.array([1., 2.], dtype=np.float32)
+        e = float('NaN')
+        assert_equal(np.where(True, d, e).dtype, np.float32)
+        e = float('Infinity')
+        assert_equal(np.where(True, d, e).dtype, np.float32)
+        e = float('-Infinity')
+        assert_equal(np.where(True, d, e).dtype, np.float32)
+        # also check upcast
+        e = float(1e150)
+        assert_equal(np.where(True, d, e).dtype, np.float64)
+
+    def test_ndim(self):
+        c = [True, False]
+        a = np.zeros((2, 25))
+        b = np.ones((2, 25))
+        r = np.where(np.array(c)[:,np.newaxis], a, b)
+        assert_array_equal(r[0], a[0])
+        assert_array_equal(r[1], b[0])
+
+        a = a.T
+        b = b.T
+        r = np.where(c, a, b)
+        assert_array_equal(r[:,0], a[:,0])
+        assert_array_equal(r[:,1], b[:,0])
+
+    def test_dtype_mix(self):
+        c = np.array([False, True, False, False, False, False, True, False,
+                     False, False, True, False])
+        a = np.uint32(1)
+        b = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.],
+                      dtype=np.float64)
+        r = np.array([5., 1., 3., 2., -1., -4., 1., -10., 10., 1., 1., 3.],
+                     dtype=np.float64)
+        assert_equal(np.where(c, a, b), r)
+
+        a = a.astype(np.float32)
+        b = b.astype(np.int64)
+        assert_equal(np.where(c, a, b), r)
+
+        # non bool mask
+        c = c.astype(int)
+        c[c != 0] = 34242324
+        assert_equal(np.where(c, a, b), r)
+        # invert
+        tmpmask = c != 0
+        c[c == 0] = 41247212
+        c[tmpmask] = 0
+        assert_equal(np.where(c, b, a), r)
+
+    def test_foreign(self):
+        c = np.array([False, True, False, False, False, False, True, False,
+                     False, False, True, False])
+        r = np.array([5., 1., 3., 2., -1., -4., 1., -10., 10., 1., 1., 3.],
+                     dtype=np.float64)
+        a = np.ones(1, dtype='>i4')
+        b = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.],
+                     dtype=np.float64)
+        assert_equal(np.where(c, a, b), r)
+
+        b = b.astype('>f8')
+        assert_equal(np.where(c, a, b), r)
+
+        a = a.astype('<i4')
+        assert_equal(np.where(c, a, b), r)
+
+        c = c.astype('>i4')
+        assert_equal(np.where(c, a, b), r)
+
+    def test_error(self):
+        c = [True, True]
+        a = np.ones((4, 5))
+        b = np.ones((5, 5))
+        assert_raises(ValueError, np.where, c, a, a)
+        assert_raises(ValueError, np.where, c[0], a, b)
+
+    def test_string(self):
+        # gh-4778 check strings are properly filled with nulls
+        a = np.array("abc")
+        b = np.array("x" * 753)
+        assert_equal(np.where(True, a, b), "abc")
+        assert_equal(np.where(False, b, a), "abc")
+
+        # check native datatype sized strings
+        a = np.array("abcd")
+        b = np.array("x" * 8)
+        assert_equal(np.where(True, a, b), "abcd")
+        assert_equal(np.where(False, b, a), "abcd")
+
+    def test_empty_result(self):
+        # pass empty where result through an assignment which reads the data of
+        # empty arrays, error detectable with valgrind, see gh-8922
+        x = np.zeros((1, 1))
+        ibad = np.vstack(np.where(x == 99.))
+        assert_array_equal(ibad,
+                           np.atleast_2d(np.array([[],[]], dtype=np.intp)))
+
+    def test_largedim(self):
+        # invalid read regression gh-9304
+        shape = [10, 2, 3, 4, 5, 6]
+        np.random.seed(2)
+        array = np.random.rand(*shape)
+
+        for i in range(10):
+            benchmark = array.nonzero()
+            result = array.nonzero()
+            assert_array_equal(benchmark, result)
+
+
+if not IS_PYPY:
+    # sys.getsizeof() is not valid on PyPy
+    class TestSizeOf:
+
+        def test_empty_array(self):
+            x = np.array([])
+            assert_(sys.getsizeof(x) > 0)
+
+        def check_array(self, dtype):
+            elem_size = dtype(0).itemsize
+
+            for length in [10, 50, 100, 500]:
+                x = np.arange(length, dtype=dtype)
+                assert_(sys.getsizeof(x) > length * elem_size)
+
+        def test_array_int32(self):
+            self.check_array(np.int32)
+
+        def test_array_int64(self):
+            self.check_array(np.int64)
+
+        def test_array_float32(self):
+            self.check_array(np.float32)
+
+        def test_array_float64(self):
+            self.check_array(np.float64)
+
+        def test_view(self):
+            d = np.ones(100)
+            assert_(sys.getsizeof(d[...]) < sys.getsizeof(d))
+
+        def test_reshape(self):
+            d = np.ones(100)
+            assert_(sys.getsizeof(d) < sys.getsizeof(d.reshape(100, 1, 1).copy()))
+
+        @_no_tracing
+        def test_resize(self):
+            d = np.ones(100)
+            old = sys.getsizeof(d)
+            d.resize(50)
+            assert_(old > sys.getsizeof(d))
+            d.resize(150)
+            assert_(old < sys.getsizeof(d))
+
+        def test_error(self):
+            d = np.ones(100)
+            assert_raises(TypeError, d.__sizeof__, "a")
+
+
+class TestHashing:
+
+    def test_arrays_not_hashable(self):
+        x = np.ones(3)
+        assert_raises(TypeError, hash, x)
+
+    def test_collections_hashable(self):
+        x = np.array([])
+        assert_(not isinstance(x, collections.abc.Hashable))
+
+
+class TestArrayPriority:
+    # This will go away when __array_priority__ is settled, meanwhile
+    # it serves to check unintended changes.
+    op = operator
+    binary_ops = [
+        op.pow, op.add, op.sub, op.mul, op.floordiv, op.truediv, op.mod,
+        op.and_, op.or_, op.xor, op.lshift, op.rshift, op.mod, op.gt,
+        op.ge, op.lt, op.le, op.ne, op.eq
+        ]
+
+    class Foo(np.ndarray):
+        __array_priority__ = 100.
+
+        def __new__(cls, *args, **kwargs):
+            return np.array(*args, **kwargs).view(cls)
+
+    class Bar(np.ndarray):
+        __array_priority__ = 101.
+
+        def __new__(cls, *args, **kwargs):
+            return np.array(*args, **kwargs).view(cls)
+
+    class Other:
+        __array_priority__ = 1000.
+
+        def _all(self, other):
+            return self.__class__()
+
+        __add__ = __radd__ = _all
+        __sub__ = __rsub__ = _all
+        __mul__ = __rmul__ = _all
+        __pow__ = __rpow__ = _all
+        __div__ = __rdiv__ = _all
+        __mod__ = __rmod__ = _all
+        __truediv__ = __rtruediv__ = _all
+        __floordiv__ = __rfloordiv__ = _all
+        __and__ = __rand__ = _all
+        __xor__ = __rxor__ = _all
+        __or__ = __ror__ = _all
+        __lshift__ = __rlshift__ = _all
+        __rshift__ = __rrshift__ = _all
+        __eq__ = _all
+        __ne__ = _all
+        __gt__ = _all
+        __ge__ = _all
+        __lt__ = _all
+        __le__ = _all
+
+    def test_ndarray_subclass(self):
+        a = np.array([1, 2])
+        b = self.Bar([1, 2])
+        for f in self.binary_ops:
+            msg = repr(f)
+            assert_(isinstance(f(a, b), self.Bar), msg)
+            assert_(isinstance(f(b, a), self.Bar), msg)
+
+    def test_ndarray_other(self):
+        a = np.array([1, 2])
+        b = self.Other()
+        for f in self.binary_ops:
+            msg = repr(f)
+            assert_(isinstance(f(a, b), self.Other), msg)
+            assert_(isinstance(f(b, a), self.Other), msg)
+
+    def test_subclass_subclass(self):
+        a = self.Foo([1, 2])
+        b = self.Bar([1, 2])
+        for f in self.binary_ops:
+            msg = repr(f)
+            assert_(isinstance(f(a, b), self.Bar), msg)
+            assert_(isinstance(f(b, a), self.Bar), msg)
+
+    def test_subclass_other(self):
+        a = self.Foo([1, 2])
+        b = self.Other()
+        for f in self.binary_ops:
+            msg = repr(f)
+            assert_(isinstance(f(a, b), self.Other), msg)
+            assert_(isinstance(f(b, a), self.Other), msg)
+
+
+class TestBytestringArrayNonzero:
+
+    def test_empty_bstring_array_is_falsey(self):
+        assert_(not np.array([''], dtype=str))
+
+    def test_whitespace_bstring_array_is_falsey(self):
+        a = np.array(['spam'], dtype=str)
+        a[0] = '  \0\0'
+        assert_(not a)
+
+    def test_all_null_bstring_array_is_falsey(self):
+        a = np.array(['spam'], dtype=str)
+        a[0] = '\0\0\0\0'
+        assert_(not a)
+
+    def test_null_inside_bstring_array_is_truthy(self):
+        a = np.array(['spam'], dtype=str)
+        a[0] = ' \0 \0'
+        assert_(a)
+
+
+class TestUnicodeEncoding:
+    """
+    Tests for encoding related bugs, such as UCS2 vs UCS4, round-tripping
+    issues, etc
+    """
+    def test_round_trip(self):
+        """ Tests that GETITEM, SETITEM, and PyArray_Scalar roundtrip """
+        # gh-15363
+        arr = np.zeros(shape=(), dtype="U1")
+        for i in range(1, sys.maxunicode + 1):
+            expected = chr(i)
+            arr[()] = expected
+            assert arr[()] == expected
+            assert arr.item() == expected
+
+    def test_assign_scalar(self):
+        # gh-3258
+        l = np.array(['aa', 'bb'])
+        l[:] = np.unicode_('cc')
+        assert_equal(l, ['cc', 'cc'])
+
+    def test_fill_scalar(self):
+        # gh-7227
+        l = np.array(['aa', 'bb'])
+        l.fill(np.unicode_('cc'))
+        assert_equal(l, ['cc', 'cc'])
+
+
+class TestUnicodeArrayNonzero:
+
+    def test_empty_ustring_array_is_falsey(self):
+        assert_(not np.array([''], dtype=np.unicode_))
+
+    def test_whitespace_ustring_array_is_falsey(self):
+        a = np.array(['eggs'], dtype=np.unicode_)
+        a[0] = '  \0\0'
+        assert_(not a)
+
+    def test_all_null_ustring_array_is_falsey(self):
+        a = np.array(['eggs'], dtype=np.unicode_)
+        a[0] = '\0\0\0\0'
+        assert_(not a)
+
+    def test_null_inside_ustring_array_is_truthy(self):
+        a = np.array(['eggs'], dtype=np.unicode_)
+        a[0] = ' \0 \0'
+        assert_(a)
+
+
+class TestFormat:
+
+    def test_0d(self):
+        a = np.array(np.pi)
+        assert_equal('{:0.3g}'.format(a), '3.14')
+        assert_equal('{:0.3g}'.format(a[()]), '3.14')
+
+    def test_1d_no_format(self):
+        a = np.array([np.pi])
+        assert_equal('{}'.format(a), str(a))
+
+    def test_1d_format(self):
+        # until gh-5543, ensure that the behaviour matches what it used to be
+        a = np.array([np.pi])
+        assert_raises(TypeError, '{:30}'.format, a)
+
+from numpy.testing import IS_PYPY
+
+class TestCTypes:
+
+    def test_ctypes_is_available(self):
+        test_arr = np.array([[1, 2, 3], [4, 5, 6]])
+
+        assert_equal(ctypes, test_arr.ctypes._ctypes)
+        assert_equal(tuple(test_arr.ctypes.shape), (2, 3))
+
+    def test_ctypes_is_not_available(self):
+        from numpy.core import _internal
+        _internal.ctypes = None
+        try:
+            test_arr = np.array([[1, 2, 3], [4, 5, 6]])
+
+            assert_(isinstance(test_arr.ctypes._ctypes,
+                               _internal._missing_ctypes))
+            assert_equal(tuple(test_arr.ctypes.shape), (2, 3))
+        finally:
+            _internal.ctypes = ctypes
+
+    def _make_readonly(x):
+        x.flags.writeable = False
+        return x
+
+    @pytest.mark.parametrize('arr', [
+        np.array([1, 2, 3]),
+        np.array([['one', 'two'], ['three', 'four']]),
+        np.array((1, 2), dtype='i4,i4'),
+        np.zeros((2,), dtype=
+            np.dtype(dict(
+                formats=['<i4', '<i4'],
+                names=['a', 'b'],
+                offsets=[0, 2],
+                itemsize=6
+            ))
+        ),
+        np.array([None], dtype=object),
+        np.array([]),
+        np.empty((0, 0)),
+        _make_readonly(np.array([1, 2, 3])),
+    ], ids=[
+        '1d',
+        '2d',
+        'structured',
+        'overlapping',
+        'object',
+        'empty',
+        'empty-2d',
+        'readonly'
+    ])
+    def test_ctypes_data_as_holds_reference(self, arr):
+        # gh-9647
+        # create a copy to ensure that pytest does not mess with the refcounts
+        arr = arr.copy()
+
+        arr_ref = weakref.ref(arr)
+
+        ctypes_ptr = arr.ctypes.data_as(ctypes.c_void_p)
+
+        # `ctypes_ptr` should hold onto `arr`
+        del arr
+        break_cycles()
+        assert_(arr_ref() is not None, "ctypes pointer did not hold onto a reference")
+
+        # but when the `ctypes_ptr` object dies, so should `arr`
+        del ctypes_ptr
+        if IS_PYPY:
+            # Pypy does not recycle arr objects immediately. Trigger gc to
+            # release arr. Cpython uses refcounts. An explicit call to gc
+            # should not be needed here.
+            break_cycles()
+        assert_(arr_ref() is None, "unknowable whether ctypes pointer holds a reference")
+
+    def test_ctypes_as_parameter_holds_reference(self):
+        arr = np.array([None]).copy()
+
+        arr_ref = weakref.ref(arr)
+
+        ctypes_ptr = arr.ctypes._as_parameter_
+
+        # `ctypes_ptr` should hold onto `arr`
+        del arr
+        break_cycles()
+        assert_(arr_ref() is not None, "ctypes pointer did not hold onto a reference")
+
+        # but when the `ctypes_ptr` object dies, so should `arr`
+        del ctypes_ptr
+        if IS_PYPY:
+            break_cycles()
+        assert_(arr_ref() is None, "unknowable whether ctypes pointer holds a reference")
+
+
+class TestWritebackIfCopy:
+    # all these tests use the WRITEBACKIFCOPY mechanism
+    def test_argmax_with_out(self):
+        mat = np.eye(5)
+        out = np.empty(5, dtype='i2')
+        res = np.argmax(mat, 0, out=out)
+        assert_equal(res, range(5))
+
+    def test_argmin_with_out(self):
+        mat = -np.eye(5)
+        out = np.empty(5, dtype='i2')
+        res = np.argmin(mat, 0, out=out)
+        assert_equal(res, range(5))
+
+    def test_insert_noncontiguous(self):
+        a = np.arange(6).reshape(2,3).T # force non-c-contiguous
+        # uses arr_insert
+        np.place(a, a>2, [44, 55])
+        assert_equal(a, np.array([[0, 44], [1, 55], [2, 44]]))
+        # hit one of the failing paths
+        assert_raises(ValueError, np.place, a, a>20, [])
+
+    def test_put_noncontiguous(self):
+        a = np.arange(6).reshape(2,3).T # force non-c-contiguous
+        np.put(a, [0, 2], [44, 55])
+        assert_equal(a, np.array([[44, 3], [55, 4], [2, 5]]))
+
+    def test_putmask_noncontiguous(self):
+        a = np.arange(6).reshape(2,3).T # force non-c-contiguous
+        # uses arr_putmask
+        np.putmask(a, a>2, a**2)
+        assert_equal(a, np.array([[0, 9], [1, 16], [2, 25]]))
+
+    def test_take_mode_raise(self):
+        a = np.arange(6, dtype='int')
+        out = np.empty(2, dtype='int')
+        np.take(a, [0, 2], out=out, mode='raise')
+        assert_equal(out, np.array([0, 2]))
+
+    def test_choose_mod_raise(self):
+        a = np.array([[1, 0, 1], [0, 1, 0], [1, 0, 1]])
+        out = np.empty((3,3), dtype='int')
+        choices = [-10, 10]
+        np.choose(a, choices, out=out, mode='raise')
+        assert_equal(out, np.array([[ 10, -10,  10],
+                                    [-10,  10, -10],
+                                    [ 10, -10,  10]]))
+
+    def test_flatiter__array__(self):
+        a = np.arange(9).reshape(3,3)
+        b = a.T.flat
+        c = b.__array__()
+        # triggers the WRITEBACKIFCOPY resolution, assuming refcount semantics
+        del c
+
+    def test_dot_out(self):
+        # if HAVE_CBLAS, will use WRITEBACKIFCOPY
+        a = np.arange(9, dtype=float).reshape(3,3)
+        b = np.dot(a, a, out=a)
+        assert_equal(b, np.array([[15, 18, 21], [42, 54, 66], [69, 90, 111]]))
+
+    def test_view_assign(self):
+        from numpy.core._multiarray_tests import npy_create_writebackifcopy, npy_resolve
+
+        arr = np.arange(9).reshape(3, 3).T
+        arr_wb = npy_create_writebackifcopy(arr)
+        assert_(arr_wb.flags.writebackifcopy)
+        assert_(arr_wb.base is arr)
+        arr_wb[...] = -100
+        npy_resolve(arr_wb)
+        # arr changes after resolve, even though we assigned to arr_wb
+        assert_equal(arr, -100)
+        # after resolve, the two arrays no longer reference each other
+        assert_(arr_wb.ctypes.data != 0)
+        assert_equal(arr_wb.base, None)
+        # assigning to arr_wb does not get transferred to arr
+        arr_wb[...] = 100
+        assert_equal(arr, -100)
+
+    @pytest.mark.leaks_references(
+            reason="increments self in dealloc; ignore since deprecated path.")
+    def test_dealloc_warning(self):
+        with suppress_warnings() as sup:
+            sup.record(RuntimeWarning)
+            arr = np.arange(9).reshape(3, 3)
+            v = arr.T
+            _multiarray_tests.npy_abuse_writebackifcopy(v)
+            assert len(sup.log) == 1
+
+    def test_view_discard_refcount(self):
+        from numpy.core._multiarray_tests import npy_create_writebackifcopy, npy_discard
+
+        arr = np.arange(9).reshape(3, 3).T
+        orig = arr.copy()
+        if HAS_REFCOUNT:
+            arr_cnt = sys.getrefcount(arr)
+        arr_wb = npy_create_writebackifcopy(arr)
+        assert_(arr_wb.flags.writebackifcopy)
+        assert_(arr_wb.base is arr)
+        arr_wb[...] = -100
+        npy_discard(arr_wb)
+        # arr remains unchanged after discard
+        assert_equal(arr, orig)
+        # after discard, the two arrays no longer reference each other
+        assert_(arr_wb.ctypes.data != 0)
+        assert_equal(arr_wb.base, None)
+        if HAS_REFCOUNT:
+            assert_equal(arr_cnt, sys.getrefcount(arr))
+        # assigning to arr_wb does not get transferred to arr
+        arr_wb[...] = 100
+        assert_equal(arr, orig)
+
+
+class TestArange:
+    def test_infinite(self):
+        assert_raises_regex(
+            ValueError, "size exceeded",
+            np.arange, 0, np.inf
+        )
+
+    def test_nan_step(self):
+        assert_raises_regex(
+            ValueError, "cannot compute length",
+            np.arange, 0, 1, np.nan
+        )
+
+    def test_zero_step(self):
+        assert_raises(ZeroDivisionError, np.arange, 0, 10, 0)
+        assert_raises(ZeroDivisionError, np.arange, 0.0, 10.0, 0.0)
+
+        # empty range
+        assert_raises(ZeroDivisionError, np.arange, 0, 0, 0)
+        assert_raises(ZeroDivisionError, np.arange, 0.0, 0.0, 0.0)
+
+
+class TestArrayFinalize:
+    """ Tests __array_finalize__ """
+
+    def test_receives_base(self):
+        # gh-11237
+        class SavesBase(np.ndarray):
+            def __array_finalize__(self, obj):
+                self.saved_base = self.base
+
+        a = np.array(1).view(SavesBase)
+        assert_(a.saved_base is a.base)
+
+    def test_lifetime_on_error(self):
+        # gh-11237
+        class RaisesInFinalize(np.ndarray):
+            def __array_finalize__(self, obj):
+                # crash, but keep this object alive
+                raise Exception(self)
+
+        # a plain object can't be weakref'd
+        class Dummy: pass
+
+        # get a weak reference to an object within an array
+        obj_arr = np.array(Dummy())
+        obj_ref = weakref.ref(obj_arr[()])
+
+        # get an array that crashed in __array_finalize__
+        with assert_raises(Exception) as e:
+            obj_arr.view(RaisesInFinalize)
+
+        obj_subarray = e.exception.args[0]
+        del e
+        assert_(isinstance(obj_subarray, RaisesInFinalize))
+
+        # reference should still be held by obj_arr
+        break_cycles()
+        assert_(obj_ref() is not None, "object should not already be dead")
+
+        del obj_arr
+        break_cycles()
+        assert_(obj_ref() is not None, "obj_arr should not hold the last reference")
+
+        del obj_subarray
+        break_cycles()
+        assert_(obj_ref() is None, "no references should remain")
+
+
+def test_orderconverter_with_nonASCII_unicode_ordering():
+    # gh-7475
+    a = np.arange(5)
+    assert_raises(ValueError, a.flatten, order=u'\xe2')
+
+
+def test_equal_override():
+    # gh-9153: ndarray.__eq__ uses special logic for structured arrays, which
+    # did not respect overrides with __array_priority__ or __array_ufunc__.
+    # The PR fixed this for __array_priority__ and __array_ufunc__ = None.
+    class MyAlwaysEqual:
+        def __eq__(self, other):
+            return "eq"
+
+        def __ne__(self, other):
+            return "ne"
+
+    class MyAlwaysEqualOld(MyAlwaysEqual):
+        __array_priority__ = 10000
+
+    class MyAlwaysEqualNew(MyAlwaysEqual):
+        __array_ufunc__ = None
+
+    array = np.array([(0, 1), (2, 3)], dtype='i4,i4')
+    for my_always_equal_cls in MyAlwaysEqualOld, MyAlwaysEqualNew:
+        my_always_equal = my_always_equal_cls()
+        assert_equal(my_always_equal == array, 'eq')
+        assert_equal(array == my_always_equal, 'eq')
+        assert_equal(my_always_equal != array, 'ne')
+        assert_equal(array != my_always_equal, 'ne')
+
+
+def test_npymath_complex():
+    # Smoketest npymath functions
+    from numpy.core._multiarray_tests import (
+        npy_cabs, npy_carg)
+
+    funcs = {npy_cabs: np.absolute,
+             npy_carg: np.angle}
+    vals = (1, np.inf, -np.inf, np.nan)
+    types = (np.complex64, np.complex128, np.clongdouble)
+
+    for fun, npfun in funcs.items():
+        for x, y in itertools.product(vals, vals):
+            for t in types:
+                z = t(complex(x, y))
+                got = fun(z)
+                expected = npfun(z)
+                assert_allclose(got, expected)
+
+
+def test_npymath_real():
+    # Smoketest npymath functions
+    from numpy.core._multiarray_tests import (
+        npy_log10, npy_cosh, npy_sinh, npy_tan, npy_tanh)
+
+    funcs = {npy_log10: np.log10,
+             npy_cosh: np.cosh,
+             npy_sinh: np.sinh,
+             npy_tan: np.tan,
+             npy_tanh: np.tanh}
+    vals = (1, np.inf, -np.inf, np.nan)
+    types = (np.float32, np.float64, np.longdouble)
+
+    with np.errstate(all='ignore'):
+        for fun, npfun in funcs.items():
+            for x, t in itertools.product(vals, types):
+                z = t(x)
+                got = fun(z)
+                expected = npfun(z)
+                assert_allclose(got, expected)
+
+def test_uintalignment_and_alignment():
+    # alignment code needs to satisfy these requirements:
+    #  1. numpy structs match C struct layout
+    #  2. ufuncs/casting is safe wrt to aligned access
+    #  3. copy code is safe wrt to "uint alidned" access
+    #
+    # Complex types are the main problem, whose alignment may not be the same
+    # as their "uint alignment".
+    #
+    # This test might only fail on certain platforms, where uint64 alignment is
+    # not equal to complex64 alignment. The second 2 tests will only fail
+    # for DEBUG=1.
+
+    d1 = np.dtype('u1,c8', align=True)
+    d2 = np.dtype('u4,c8', align=True)
+    d3 = np.dtype({'names': ['a', 'b'], 'formats': ['u1', d1]}, align=True)
+
+    assert_equal(np.zeros(1, dtype=d1)['f1'].flags['ALIGNED'], True)
+    assert_equal(np.zeros(1, dtype=d2)['f1'].flags['ALIGNED'], True)
+    assert_equal(np.zeros(1, dtype='u1,c8')['f1'].flags['ALIGNED'], False)
+
+    # check that C struct matches numpy struct size
+    s = _multiarray_tests.get_struct_alignments()
+    for d, (alignment, size) in zip([d1,d2,d3], s):
+        assert_equal(d.alignment, alignment)
+        assert_equal(d.itemsize, size)
+
+    # check that ufuncs don't complain in debug mode
+    # (this is probably OK if the aligned flag is true above)
+    src = np.zeros((2,2), dtype=d1)['f1']  # 4-byte aligned, often
+    np.exp(src)  # assert fails?
+
+    # check that copy code doesn't complain in debug mode
+    dst = np.zeros((2,2), dtype='c8')
+    dst[:,1] = src[:,1]  # assert in lowlevel_strided_loops fails?
+
+class TestAlignment:
+    # adapted from scipy._lib.tests.test__util.test__aligned_zeros
+    # Checks that unusual memory alignments don't trip up numpy.
+    # In particular, check RELAXED_STRIDES don't trip alignment assertions in
+    # NDEBUG mode for size-0 arrays (gh-12503)
+
+    def check(self, shape, dtype, order, align):
+        err_msg = repr((shape, dtype, order, align))
+        x = _aligned_zeros(shape, dtype, order, align=align)
+        if align is None:
+            align = np.dtype(dtype).alignment
+        assert_equal(x.__array_interface__['data'][0] % align, 0)
+        if hasattr(shape, '__len__'):
+            assert_equal(x.shape, shape, err_msg)
+        else:
+            assert_equal(x.shape, (shape,), err_msg)
+        assert_equal(x.dtype, dtype)
+        if order == "C":
+            assert_(x.flags.c_contiguous, err_msg)
+        elif order == "F":
+            if x.size > 0:
+                assert_(x.flags.f_contiguous, err_msg)
+        elif order is None:
+            assert_(x.flags.c_contiguous, err_msg)
+        else:
+            raise ValueError()
+
+    def test_various_alignments(self):
+        for align in [1, 2, 3, 4, 8, 12, 16, 32, 64, None]:
+            for n in [0, 1, 3, 11]:
+                for order in ["C", "F", None]:
+                    for dtype in list(np.typecodes["All"]) + ['i4,i4,i4']:
+                        if dtype == 'O':
+                            # object dtype can't be misaligned
+                            continue
+                        for shape in [n, (1, 2, 3, n)]:
+                            self.check(shape, np.dtype(dtype), order, align)
+
+    def test_strided_loop_alignments(self):
+        # particularly test that complex64 and float128 use right alignment
+        # code-paths, since these are particularly problematic. It is useful to
+        # turn on USE_DEBUG for this test, so lowlevel-loop asserts are run.
+        for align in [1, 2, 4, 8, 12, 16, None]:
+            xf64 = _aligned_zeros(3, np.float64)
+
+            xc64 = _aligned_zeros(3, np.complex64, align=align)
+            xf128 = _aligned_zeros(3, np.longdouble, align=align)
+
+            # test casting, both to and from misaligned
+            with suppress_warnings() as sup:
+                sup.filter(np.ComplexWarning, "Casting complex values")
+                xc64.astype('f8')
+            xf64.astype(np.complex64)
+            test = xc64 + xf64
+
+            xf128.astype('f8')
+            xf64.astype(np.longdouble)
+            test = xf128 + xf64
+
+            test = xf128 + xc64
+
+            # test copy, both to and from misaligned
+            # contig copy
+            xf64[:] = xf64.copy()
+            xc64[:] = xc64.copy()
+            xf128[:] = xf128.copy()
+            # strided copy
+            xf64[::2] = xf64[::2].copy()
+            xc64[::2] = xc64[::2].copy()
+            xf128[::2] = xf128[::2].copy()
+
+def test_getfield():
+    a = np.arange(32, dtype='uint16')
+    if sys.byteorder == 'little':
+        i = 0
+        j = 1
+    else:
+        i = 1
+        j = 0
+    b = a.getfield('int8', i)
+    assert_equal(b, a)
+    b = a.getfield('int8', j)
+    assert_equal(b, 0)
+    pytest.raises(ValueError, a.getfield, 'uint8', -1)
+    pytest.raises(ValueError, a.getfield, 'uint8', 16)
+    pytest.raises(ValueError, a.getfield, 'uint64', 0)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_nditer.py b/venv/Lib/site-packages/numpy/core/tests/test_nditer.py
new file mode 100644
index 000000000..c106c528d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_nditer.py
@@ -0,0 +1,2867 @@
+import sys
+import pytest
+
+import numpy as np
+import numpy.core._multiarray_tests as _multiarray_tests
+from numpy import array, arange, nditer, all
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_raises,
+    HAS_REFCOUNT, suppress_warnings
+    )
+
+
+def iter_multi_index(i):
+    ret = []
+    while not i.finished:
+        ret.append(i.multi_index)
+        i.iternext()
+    return ret
+
+def iter_indices(i):
+    ret = []
+    while not i.finished:
+        ret.append(i.index)
+        i.iternext()
+    return ret
+
+def iter_iterindices(i):
+    ret = []
+    while not i.finished:
+        ret.append(i.iterindex)
+        i.iternext()
+    return ret
+
+@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+def test_iter_refcount():
+    # Make sure the iterator doesn't leak
+
+    # Basic
+    a = arange(6)
+    dt = np.dtype('f4').newbyteorder()
+    rc_a = sys.getrefcount(a)
+    rc_dt = sys.getrefcount(dt)
+    with nditer(a, [],
+                [['readwrite', 'updateifcopy']],
+                casting='unsafe',
+                op_dtypes=[dt]) as it:
+        assert_(not it.iterationneedsapi)
+        assert_(sys.getrefcount(a) > rc_a)
+        assert_(sys.getrefcount(dt) > rc_dt)
+    # del 'it'
+    it = None
+    assert_equal(sys.getrefcount(a), rc_a)
+    assert_equal(sys.getrefcount(dt), rc_dt)
+
+    # With a copy
+    a = arange(6, dtype='f4')
+    dt = np.dtype('f4')
+    rc_a = sys.getrefcount(a)
+    rc_dt = sys.getrefcount(dt)
+    it = nditer(a, [],
+                [['readwrite']],
+                op_dtypes=[dt])
+    rc2_a = sys.getrefcount(a)
+    rc2_dt = sys.getrefcount(dt)
+    it2 = it.copy()
+    assert_(sys.getrefcount(a) > rc2_a)
+    assert_(sys.getrefcount(dt) > rc2_dt)
+    it = None
+    assert_equal(sys.getrefcount(a), rc2_a)
+    assert_equal(sys.getrefcount(dt), rc2_dt)
+    it2 = None
+    assert_equal(sys.getrefcount(a), rc_a)
+    assert_equal(sys.getrefcount(dt), rc_dt)
+
+    del it2  # avoid pyflakes unused variable warning
+
+def test_iter_best_order():
+    # The iterator should always find the iteration order
+    # with increasing memory addresses
+
+    # Test the ordering for 1-D to 5-D shapes
+    for shape in [(5,), (3, 4), (2, 3, 4), (2, 3, 4, 3), (2, 3, 2, 2, 3)]:
+        a = arange(np.prod(shape))
+        # Test each combination of positive and negative strides
+        for dirs in range(2**len(shape)):
+            dirs_index = [slice(None)]*len(shape)
+            for bit in range(len(shape)):
+                if ((2**bit) & dirs):
+                    dirs_index[bit] = slice(None, None, -1)
+            dirs_index = tuple(dirs_index)
+
+            aview = a.reshape(shape)[dirs_index]
+            # C-order
+            i = nditer(aview, [], [['readonly']])
+            assert_equal([x for x in i], a)
+            # Fortran-order
+            i = nditer(aview.T, [], [['readonly']])
+            assert_equal([x for x in i], a)
+            # Other order
+            if len(shape) > 2:
+                i = nditer(aview.swapaxes(0, 1), [], [['readonly']])
+                assert_equal([x for x in i], a)
+
+def test_iter_c_order():
+    # Test forcing C order
+
+    # Test the ordering for 1-D to 5-D shapes
+    for shape in [(5,), (3, 4), (2, 3, 4), (2, 3, 4, 3), (2, 3, 2, 2, 3)]:
+        a = arange(np.prod(shape))
+        # Test each combination of positive and negative strides
+        for dirs in range(2**len(shape)):
+            dirs_index = [slice(None)]*len(shape)
+            for bit in range(len(shape)):
+                if ((2**bit) & dirs):
+                    dirs_index[bit] = slice(None, None, -1)
+            dirs_index = tuple(dirs_index)
+
+            aview = a.reshape(shape)[dirs_index]
+            # C-order
+            i = nditer(aview, order='C')
+            assert_equal([x for x in i], aview.ravel(order='C'))
+            # Fortran-order
+            i = nditer(aview.T, order='C')
+            assert_equal([x for x in i], aview.T.ravel(order='C'))
+            # Other order
+            if len(shape) > 2:
+                i = nditer(aview.swapaxes(0, 1), order='C')
+                assert_equal([x for x in i],
+                                    aview.swapaxes(0, 1).ravel(order='C'))
+
+def test_iter_f_order():
+    # Test forcing F order
+
+    # Test the ordering for 1-D to 5-D shapes
+    for shape in [(5,), (3, 4), (2, 3, 4), (2, 3, 4, 3), (2, 3, 2, 2, 3)]:
+        a = arange(np.prod(shape))
+        # Test each combination of positive and negative strides
+        for dirs in range(2**len(shape)):
+            dirs_index = [slice(None)]*len(shape)
+            for bit in range(len(shape)):
+                if ((2**bit) & dirs):
+                    dirs_index[bit] = slice(None, None, -1)
+            dirs_index = tuple(dirs_index)
+
+            aview = a.reshape(shape)[dirs_index]
+            # C-order
+            i = nditer(aview, order='F')
+            assert_equal([x for x in i], aview.ravel(order='F'))
+            # Fortran-order
+            i = nditer(aview.T, order='F')
+            assert_equal([x for x in i], aview.T.ravel(order='F'))
+            # Other order
+            if len(shape) > 2:
+                i = nditer(aview.swapaxes(0, 1), order='F')
+                assert_equal([x for x in i],
+                                    aview.swapaxes(0, 1).ravel(order='F'))
+
+def test_iter_c_or_f_order():
+    # Test forcing any contiguous (C or F) order
+
+    # Test the ordering for 1-D to 5-D shapes
+    for shape in [(5,), (3, 4), (2, 3, 4), (2, 3, 4, 3), (2, 3, 2, 2, 3)]:
+        a = arange(np.prod(shape))
+        # Test each combination of positive and negative strides
+        for dirs in range(2**len(shape)):
+            dirs_index = [slice(None)]*len(shape)
+            for bit in range(len(shape)):
+                if ((2**bit) & dirs):
+                    dirs_index[bit] = slice(None, None, -1)
+            dirs_index = tuple(dirs_index)
+
+            aview = a.reshape(shape)[dirs_index]
+            # C-order
+            i = nditer(aview, order='A')
+            assert_equal([x for x in i], aview.ravel(order='A'))
+            # Fortran-order
+            i = nditer(aview.T, order='A')
+            assert_equal([x for x in i], aview.T.ravel(order='A'))
+            # Other order
+            if len(shape) > 2:
+                i = nditer(aview.swapaxes(0, 1), order='A')
+                assert_equal([x for x in i],
+                                    aview.swapaxes(0, 1).ravel(order='A'))
+
+def test_iter_best_order_multi_index_1d():
+    # The multi-indices should be correct with any reordering
+
+    a = arange(4)
+    # 1D order
+    i = nditer(a, ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(0,), (1,), (2,), (3,)])
+    # 1D reversed order
+    i = nditer(a[::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(3,), (2,), (1,), (0,)])
+
+def test_iter_best_order_multi_index_2d():
+    # The multi-indices should be correct with any reordering
+
+    a = arange(6)
+    # 2D C-order
+    i = nditer(a.reshape(2, 3), ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(0, 0), (0, 1), (0, 2), (1, 0), (1, 1), (1, 2)])
+    # 2D Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F'), ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(0, 0), (1, 0), (0, 1), (1, 1), (0, 2), (1, 2)])
+    # 2D reversed C-order
+    i = nditer(a.reshape(2, 3)[::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(1, 0), (1, 1), (1, 2), (0, 0), (0, 1), (0, 2)])
+    i = nditer(a.reshape(2, 3)[:, ::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(0, 2), (0, 1), (0, 0), (1, 2), (1, 1), (1, 0)])
+    i = nditer(a.reshape(2, 3)[::-1, ::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(1, 2), (1, 1), (1, 0), (0, 2), (0, 1), (0, 0)])
+    # 2D reversed Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(1, 0), (0, 0), (1, 1), (0, 1), (1, 2), (0, 2)])
+    i = nditer(a.reshape(2, 3).copy(order='F')[:, ::-1],
+                                                   ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(0, 2), (1, 2), (0, 1), (1, 1), (0, 0), (1, 0)])
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1, ::-1],
+                                                   ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i), [(1, 2), (0, 2), (1, 1), (0, 1), (1, 0), (0, 0)])
+
+def test_iter_best_order_multi_index_3d():
+    # The multi-indices should be correct with any reordering
+
+    a = arange(12)
+    # 3D C-order
+    i = nditer(a.reshape(2, 3, 2), ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (0, 2, 0), (0, 2, 1),
+                             (1, 0, 0), (1, 0, 1), (1, 1, 0), (1, 1, 1), (1, 2, 0), (1, 2, 1)])
+    # 3D Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F'), ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 0, 0), (1, 0, 0), (0, 1, 0), (1, 1, 0), (0, 2, 0), (1, 2, 0),
+                             (0, 0, 1), (1, 0, 1), (0, 1, 1), (1, 1, 1), (0, 2, 1), (1, 2, 1)])
+    # 3D reversed C-order
+    i = nditer(a.reshape(2, 3, 2)[::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(1, 0, 0), (1, 0, 1), (1, 1, 0), (1, 1, 1), (1, 2, 0), (1, 2, 1),
+                             (0, 0, 0), (0, 0, 1), (0, 1, 0), (0, 1, 1), (0, 2, 0), (0, 2, 1)])
+    i = nditer(a.reshape(2, 3, 2)[:, ::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 2, 0), (0, 2, 1), (0, 1, 0), (0, 1, 1), (0, 0, 0), (0, 0, 1),
+                             (1, 2, 0), (1, 2, 1), (1, 1, 0), (1, 1, 1), (1, 0, 0), (1, 0, 1)])
+    i = nditer(a.reshape(2, 3, 2)[:,:, ::-1], ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 0, 1), (0, 0, 0), (0, 1, 1), (0, 1, 0), (0, 2, 1), (0, 2, 0),
+                             (1, 0, 1), (1, 0, 0), (1, 1, 1), (1, 1, 0), (1, 2, 1), (1, 2, 0)])
+    # 3D reversed Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[::-1],
+                                                    ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(1, 0, 0), (0, 0, 0), (1, 1, 0), (0, 1, 0), (1, 2, 0), (0, 2, 0),
+                             (1, 0, 1), (0, 0, 1), (1, 1, 1), (0, 1, 1), (1, 2, 1), (0, 2, 1)])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:, ::-1],
+                                                    ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 2, 0), (1, 2, 0), (0, 1, 0), (1, 1, 0), (0, 0, 0), (1, 0, 0),
+                             (0, 2, 1), (1, 2, 1), (0, 1, 1), (1, 1, 1), (0, 0, 1), (1, 0, 1)])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:,:, ::-1],
+                                                    ['multi_index'], [['readonly']])
+    assert_equal(iter_multi_index(i),
+                            [(0, 0, 1), (1, 0, 1), (0, 1, 1), (1, 1, 1), (0, 2, 1), (1, 2, 1),
+                             (0, 0, 0), (1, 0, 0), (0, 1, 0), (1, 1, 0), (0, 2, 0), (1, 2, 0)])
+
+def test_iter_best_order_c_index_1d():
+    # The C index should be correct with any reordering
+
+    a = arange(4)
+    # 1D order
+    i = nditer(a, ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 1, 2, 3])
+    # 1D reversed order
+    i = nditer(a[::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [3, 2, 1, 0])
+
+def test_iter_best_order_c_index_2d():
+    # The C index should be correct with any reordering
+
+    a = arange(6)
+    # 2D C-order
+    i = nditer(a.reshape(2, 3), ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 1, 2, 3, 4, 5])
+    # 2D Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F'),
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 3, 1, 4, 2, 5])
+    # 2D reversed C-order
+    i = nditer(a.reshape(2, 3)[::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [3, 4, 5, 0, 1, 2])
+    i = nditer(a.reshape(2, 3)[:, ::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [2, 1, 0, 5, 4, 3])
+    i = nditer(a.reshape(2, 3)[::-1, ::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [5, 4, 3, 2, 1, 0])
+    # 2D reversed Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [3, 0, 4, 1, 5, 2])
+    i = nditer(a.reshape(2, 3).copy(order='F')[:, ::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [2, 5, 1, 4, 0, 3])
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1, ::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i), [5, 2, 4, 1, 3, 0])
+
+def test_iter_best_order_c_index_3d():
+    # The C index should be correct with any reordering
+
+    a = arange(12)
+    # 3D C-order
+    i = nditer(a.reshape(2, 3, 2), ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
+    # 3D Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F'),
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [0, 6, 2, 8, 4, 10, 1, 7, 3, 9, 5, 11])
+    # 3D reversed C-order
+    i = nditer(a.reshape(2, 3, 2)[::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5])
+    i = nditer(a.reshape(2, 3, 2)[:, ::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [4, 5, 2, 3, 0, 1, 10, 11, 8, 9, 6, 7])
+    i = nditer(a.reshape(2, 3, 2)[:,:, ::-1], ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10])
+    # 3D reversed Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [6, 0, 8, 2, 10, 4, 7, 1, 9, 3, 11, 5])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:, ::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [4, 10, 2, 8, 0, 6, 5, 11, 3, 9, 1, 7])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:,:, ::-1],
+                                    ['c_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [1, 7, 3, 9, 5, 11, 0, 6, 2, 8, 4, 10])
+
+def test_iter_best_order_f_index_1d():
+    # The Fortran index should be correct with any reordering
+
+    a = arange(4)
+    # 1D order
+    i = nditer(a, ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 1, 2, 3])
+    # 1D reversed order
+    i = nditer(a[::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [3, 2, 1, 0])
+
+def test_iter_best_order_f_index_2d():
+    # The Fortran index should be correct with any reordering
+
+    a = arange(6)
+    # 2D C-order
+    i = nditer(a.reshape(2, 3), ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 2, 4, 1, 3, 5])
+    # 2D Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F'),
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [0, 1, 2, 3, 4, 5])
+    # 2D reversed C-order
+    i = nditer(a.reshape(2, 3)[::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [1, 3, 5, 0, 2, 4])
+    i = nditer(a.reshape(2, 3)[:, ::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [4, 2, 0, 5, 3, 1])
+    i = nditer(a.reshape(2, 3)[::-1, ::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [5, 3, 1, 4, 2, 0])
+    # 2D reversed Fortran-order
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [1, 0, 3, 2, 5, 4])
+    i = nditer(a.reshape(2, 3).copy(order='F')[:, ::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [4, 5, 2, 3, 0, 1])
+    i = nditer(a.reshape(2, 3).copy(order='F')[::-1, ::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i), [5, 4, 3, 2, 1, 0])
+
+def test_iter_best_order_f_index_3d():
+    # The Fortran index should be correct with any reordering
+
+    a = arange(12)
+    # 3D C-order
+    i = nditer(a.reshape(2, 3, 2), ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [0, 6, 2, 8, 4, 10, 1, 7, 3, 9, 5, 11])
+    # 3D Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F'),
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11])
+    # 3D reversed C-order
+    i = nditer(a.reshape(2, 3, 2)[::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [1, 7, 3, 9, 5, 11, 0, 6, 2, 8, 4, 10])
+    i = nditer(a.reshape(2, 3, 2)[:, ::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [4, 10, 2, 8, 0, 6, 5, 11, 3, 9, 1, 7])
+    i = nditer(a.reshape(2, 3, 2)[:,:, ::-1], ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [6, 0, 8, 2, 10, 4, 7, 1, 9, 3, 11, 5])
+    # 3D reversed Fortran-order
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [1, 0, 3, 2, 5, 4, 7, 6, 9, 8, 11, 10])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:, ::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [4, 5, 2, 3, 0, 1, 10, 11, 8, 9, 6, 7])
+    i = nditer(a.reshape(2, 3, 2).copy(order='F')[:,:, ::-1],
+                                    ['f_index'], [['readonly']])
+    assert_equal(iter_indices(i),
+                            [6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5])
+
+def test_iter_no_inner_full_coalesce():
+    # Check no_inner iterators which coalesce into a single inner loop
+
+    for shape in [(5,), (3, 4), (2, 3, 4), (2, 3, 4, 3), (2, 3, 2, 2, 3)]:
+        size = np.prod(shape)
+        a = arange(size)
+        # Test each combination of forward and backwards indexing
+        for dirs in range(2**len(shape)):
+            dirs_index = [slice(None)]*len(shape)
+            for bit in range(len(shape)):
+                if ((2**bit) & dirs):
+                    dirs_index[bit] = slice(None, None, -1)
+            dirs_index = tuple(dirs_index)
+
+            aview = a.reshape(shape)[dirs_index]
+            # C-order
+            i = nditer(aview, ['external_loop'], [['readonly']])
+            assert_equal(i.ndim, 1)
+            assert_equal(i[0].shape, (size,))
+            # Fortran-order
+            i = nditer(aview.T, ['external_loop'], [['readonly']])
+            assert_equal(i.ndim, 1)
+            assert_equal(i[0].shape, (size,))
+            # Other order
+            if len(shape) > 2:
+                i = nditer(aview.swapaxes(0, 1),
+                                    ['external_loop'], [['readonly']])
+                assert_equal(i.ndim, 1)
+                assert_equal(i[0].shape, (size,))
+
+def test_iter_no_inner_dim_coalescing():
+    # Check no_inner iterators whose dimensions may not coalesce completely
+
+    # Skipping the last element in a dimension prevents coalescing
+    # with the next-bigger dimension
+    a = arange(24).reshape(2, 3, 4)[:,:, :-1]
+    i = nditer(a, ['external_loop'], [['readonly']])
+    assert_equal(i.ndim, 2)
+    assert_equal(i[0].shape, (3,))
+    a = arange(24).reshape(2, 3, 4)[:, :-1,:]
+    i = nditer(a, ['external_loop'], [['readonly']])
+    assert_equal(i.ndim, 2)
+    assert_equal(i[0].shape, (8,))
+    a = arange(24).reshape(2, 3, 4)[:-1,:,:]
+    i = nditer(a, ['external_loop'], [['readonly']])
+    assert_equal(i.ndim, 1)
+    assert_equal(i[0].shape, (12,))
+
+    # Even with lots of 1-sized dimensions, should still coalesce
+    a = arange(24).reshape(1, 1, 2, 1, 1, 3, 1, 1, 4, 1, 1)
+    i = nditer(a, ['external_loop'], [['readonly']])
+    assert_equal(i.ndim, 1)
+    assert_equal(i[0].shape, (24,))
+
+def test_iter_dim_coalescing():
+    # Check that the correct number of dimensions are coalesced
+
+    # Tracking a multi-index disables coalescing
+    a = arange(24).reshape(2, 3, 4)
+    i = nditer(a, ['multi_index'], [['readonly']])
+    assert_equal(i.ndim, 3)
+
+    # A tracked index can allow coalescing if it's compatible with the array
+    a3d = arange(24).reshape(2, 3, 4)
+    i = nditer(a3d, ['c_index'], [['readonly']])
+    assert_equal(i.ndim, 1)
+    i = nditer(a3d.swapaxes(0, 1), ['c_index'], [['readonly']])
+    assert_equal(i.ndim, 3)
+    i = nditer(a3d.T, ['c_index'], [['readonly']])
+    assert_equal(i.ndim, 3)
+    i = nditer(a3d.T, ['f_index'], [['readonly']])
+    assert_equal(i.ndim, 1)
+    i = nditer(a3d.T.swapaxes(0, 1), ['f_index'], [['readonly']])
+    assert_equal(i.ndim, 3)
+
+    # When C or F order is forced, coalescing may still occur
+    a3d = arange(24).reshape(2, 3, 4)
+    i = nditer(a3d, order='C')
+    assert_equal(i.ndim, 1)
+    i = nditer(a3d.T, order='C')
+    assert_equal(i.ndim, 3)
+    i = nditer(a3d, order='F')
+    assert_equal(i.ndim, 3)
+    i = nditer(a3d.T, order='F')
+    assert_equal(i.ndim, 1)
+    i = nditer(a3d, order='A')
+    assert_equal(i.ndim, 1)
+    i = nditer(a3d.T, order='A')
+    assert_equal(i.ndim, 1)
+
+def test_iter_broadcasting():
+    # Standard NumPy broadcasting rules
+
+    # 1D with scalar
+    i = nditer([arange(6), np.int32(2)], ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 6)
+    assert_equal(i.shape, (6,))
+
+    # 2D with scalar
+    i = nditer([arange(6).reshape(2, 3), np.int32(2)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 6)
+    assert_equal(i.shape, (2, 3))
+    # 2D with 1D
+    i = nditer([arange(6).reshape(2, 3), arange(3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 6)
+    assert_equal(i.shape, (2, 3))
+    i = nditer([arange(2).reshape(2, 1), arange(3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 6)
+    assert_equal(i.shape, (2, 3))
+    # 2D with 2D
+    i = nditer([arange(2).reshape(2, 1), arange(3).reshape(1, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 6)
+    assert_equal(i.shape, (2, 3))
+
+    # 3D with scalar
+    i = nditer([np.int32(2), arange(24).reshape(4, 2, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    # 3D with 1D
+    i = nditer([arange(3), arange(24).reshape(4, 2, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    i = nditer([arange(3), arange(8).reshape(4, 2, 1)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    # 3D with 2D
+    i = nditer([arange(6).reshape(2, 3), arange(24).reshape(4, 2, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    i = nditer([arange(2).reshape(2, 1), arange(24).reshape(4, 2, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    i = nditer([arange(3).reshape(1, 3), arange(8).reshape(4, 2, 1)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    # 3D with 3D
+    i = nditer([arange(2).reshape(1, 2, 1), arange(3).reshape(1, 1, 3),
+                        arange(4).reshape(4, 1, 1)],
+                        ['multi_index'], [['readonly']]*3)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    i = nditer([arange(6).reshape(1, 2, 3), arange(4).reshape(4, 1, 1)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+    i = nditer([arange(24).reshape(4, 2, 3), arange(12).reshape(4, 1, 3)],
+                        ['multi_index'], [['readonly']]*2)
+    assert_equal(i.itersize, 24)
+    assert_equal(i.shape, (4, 2, 3))
+
+def test_iter_itershape():
+    # Check that allocated outputs work with a specified shape
+    a = np.arange(6, dtype='i2').reshape(2, 3)
+    i = nditer([a, None], [], [['readonly'], ['writeonly', 'allocate']],
+                            op_axes=[[0, 1, None], None],
+                            itershape=(-1, -1, 4))
+    assert_equal(i.operands[1].shape, (2, 3, 4))
+    assert_equal(i.operands[1].strides, (24, 8, 2))
+
+    i = nditer([a.T, None], [], [['readonly'], ['writeonly', 'allocate']],
+                            op_axes=[[0, 1, None], None],
+                            itershape=(-1, -1, 4))
+    assert_equal(i.operands[1].shape, (3, 2, 4))
+    assert_equal(i.operands[1].strides, (8, 24, 2))
+
+    i = nditer([a.T, None], [], [['readonly'], ['writeonly', 'allocate']],
+                            order='F',
+                            op_axes=[[0, 1, None], None],
+                            itershape=(-1, -1, 4))
+    assert_equal(i.operands[1].shape, (3, 2, 4))
+    assert_equal(i.operands[1].strides, (2, 6, 12))
+
+    # If we specify 1 in the itershape, it shouldn't allow broadcasting
+    # of that dimension to a bigger value
+    assert_raises(ValueError, nditer, [a, None], [],
+                            [['readonly'], ['writeonly', 'allocate']],
+                            op_axes=[[0, 1, None], None],
+                            itershape=(-1, 1, 4))
+    # Test bug that for no op_axes but itershape, they are NULLed correctly
+    i = np.nditer([np.ones(2), None, None], itershape=(2,))
+
+def test_iter_broadcasting_errors():
+    # Check that errors are thrown for bad broadcasting shapes
+
+    # 1D with 1D
+    assert_raises(ValueError, nditer, [arange(2), arange(3)],
+                    [], [['readonly']]*2)
+    # 2D with 1D
+    assert_raises(ValueError, nditer,
+                    [arange(6).reshape(2, 3), arange(2)],
+                    [], [['readonly']]*2)
+    # 2D with 2D
+    assert_raises(ValueError, nditer,
+                    [arange(6).reshape(2, 3), arange(9).reshape(3, 3)],
+                    [], [['readonly']]*2)
+    assert_raises(ValueError, nditer,
+                    [arange(6).reshape(2, 3), arange(4).reshape(2, 2)],
+                    [], [['readonly']]*2)
+    # 3D with 3D
+    assert_raises(ValueError, nditer,
+                    [arange(36).reshape(3, 3, 4), arange(24).reshape(2, 3, 4)],
+                    [], [['readonly']]*2)
+    assert_raises(ValueError, nditer,
+                    [arange(8).reshape(2, 4, 1), arange(24).reshape(2, 3, 4)],
+                    [], [['readonly']]*2)
+
+    # Verify that the error message mentions the right shapes
+    try:
+        nditer([arange(2).reshape(1, 2, 1),
+                arange(3).reshape(1, 3),
+                arange(6).reshape(2, 3)],
+               [],
+               [['readonly'], ['readonly'], ['writeonly', 'no_broadcast']])
+        raise AssertionError('Should have raised a broadcast error')
+    except ValueError as e:
+        msg = str(e)
+        # The message should contain the shape of the 3rd operand
+        assert_(msg.find('(2,3)') >= 0,
+                'Message "%s" doesn\'t contain operand shape (2,3)' % msg)
+        # The message should contain the broadcast shape
+        assert_(msg.find('(1,2,3)') >= 0,
+                'Message "%s" doesn\'t contain broadcast shape (1,2,3)' % msg)
+
+    try:
+        nditer([arange(6).reshape(2, 3), arange(2)],
+               [],
+               [['readonly'], ['readonly']],
+               op_axes=[[0, 1], [0, np.newaxis]],
+               itershape=(4, 3))
+        raise AssertionError('Should have raised a broadcast error')
+    except ValueError as e:
+        msg = str(e)
+        # The message should contain "shape->remappedshape" for each operand
+        assert_(msg.find('(2,3)->(2,3)') >= 0,
+            'Message "%s" doesn\'t contain operand shape (2,3)->(2,3)' % msg)
+        assert_(msg.find('(2,)->(2,newaxis)') >= 0,
+                ('Message "%s" doesn\'t contain remapped operand shape' +
+                '(2,)->(2,newaxis)') % msg)
+        # The message should contain the itershape parameter
+        assert_(msg.find('(4,3)') >= 0,
+                'Message "%s" doesn\'t contain itershape parameter (4,3)' % msg)
+
+    try:
+        nditer([np.zeros((2, 1, 1)), np.zeros((2,))],
+               [],
+               [['writeonly', 'no_broadcast'], ['readonly']])
+        raise AssertionError('Should have raised a broadcast error')
+    except ValueError as e:
+        msg = str(e)
+        # The message should contain the shape of the bad operand
+        assert_(msg.find('(2,1,1)') >= 0,
+            'Message "%s" doesn\'t contain operand shape (2,1,1)' % msg)
+        # The message should contain the broadcast shape
+        assert_(msg.find('(2,1,2)') >= 0,
+                'Message "%s" doesn\'t contain the broadcast shape (2,1,2)' % msg)
+
+def test_iter_flags_errors():
+    # Check that bad combinations of flags produce errors
+
+    a = arange(6)
+
+    # Not enough operands
+    assert_raises(ValueError, nditer, [], [], [])
+    # Too many operands
+    assert_raises(ValueError, nditer, [a]*100, [], [['readonly']]*100)
+    # Bad global flag
+    assert_raises(ValueError, nditer, [a], ['bad flag'], [['readonly']])
+    # Bad op flag
+    assert_raises(ValueError, nditer, [a], [], [['readonly', 'bad flag']])
+    # Bad order parameter
+    assert_raises(ValueError, nditer, [a], [], [['readonly']], order='G')
+    # Bad casting parameter
+    assert_raises(ValueError, nditer, [a], [], [['readonly']], casting='noon')
+    # op_flags must match ops
+    assert_raises(ValueError, nditer, [a]*3, [], [['readonly']]*2)
+    # Cannot track both a C and an F index
+    assert_raises(ValueError, nditer, a,
+                ['c_index', 'f_index'], [['readonly']])
+    # Inner iteration and multi-indices/indices are incompatible
+    assert_raises(ValueError, nditer, a,
+                ['external_loop', 'multi_index'], [['readonly']])
+    assert_raises(ValueError, nditer, a,
+                ['external_loop', 'c_index'], [['readonly']])
+    assert_raises(ValueError, nditer, a,
+                ['external_loop', 'f_index'], [['readonly']])
+    # Must specify exactly one of readwrite/readonly/writeonly per operand
+    assert_raises(ValueError, nditer, a, [], [[]])
+    assert_raises(ValueError, nditer, a, [], [['readonly', 'writeonly']])
+    assert_raises(ValueError, nditer, a, [], [['readonly', 'readwrite']])
+    assert_raises(ValueError, nditer, a, [], [['writeonly', 'readwrite']])
+    assert_raises(ValueError, nditer, a,
+                [], [['readonly', 'writeonly', 'readwrite']])
+    # Python scalars are always readonly
+    assert_raises(TypeError, nditer, 1.5, [], [['writeonly']])
+    assert_raises(TypeError, nditer, 1.5, [], [['readwrite']])
+    # Array scalars are always readonly
+    assert_raises(TypeError, nditer, np.int32(1), [], [['writeonly']])
+    assert_raises(TypeError, nditer, np.int32(1), [], [['readwrite']])
+    # Check readonly array
+    a.flags.writeable = False
+    assert_raises(ValueError, nditer, a, [], [['writeonly']])
+    assert_raises(ValueError, nditer, a, [], [['readwrite']])
+    a.flags.writeable = True
+    # Multi-indices available only with the multi_index flag
+    i = nditer(arange(6), [], [['readonly']])
+    assert_raises(ValueError, lambda i:i.multi_index, i)
+    # Index available only with an index flag
+    assert_raises(ValueError, lambda i:i.index, i)
+    # GotoCoords and GotoIndex incompatible with buffering or no_inner
+
+    def assign_multi_index(i):
+        i.multi_index = (0,)
+
+    def assign_index(i):
+        i.index = 0
+
+    def assign_iterindex(i):
+        i.iterindex = 0
+
+    def assign_iterrange(i):
+        i.iterrange = (0, 1)
+    i = nditer(arange(6), ['external_loop'])
+    assert_raises(ValueError, assign_multi_index, i)
+    assert_raises(ValueError, assign_index, i)
+    assert_raises(ValueError, assign_iterindex, i)
+    assert_raises(ValueError, assign_iterrange, i)
+    i = nditer(arange(6), ['buffered'])
+    assert_raises(ValueError, assign_multi_index, i)
+    assert_raises(ValueError, assign_index, i)
+    assert_raises(ValueError, assign_iterrange, i)
+    # Can't iterate if size is zero
+    assert_raises(ValueError, nditer, np.array([]))
+
+def test_iter_slice():
+    a, b, c = np.arange(3), np.arange(3), np.arange(3.)
+    i = nditer([a, b, c], [], ['readwrite'])
+    with i:
+        i[0:2] = (3, 3)
+        assert_equal(a, [3, 1, 2])
+        assert_equal(b, [3, 1, 2])
+        assert_equal(c, [0, 1, 2])
+        i[1] = 12
+        assert_equal(i[0:2], [3, 12])
+
+def test_iter_assign_mapping():
+    a = np.arange(24, dtype='f8').reshape(2, 3, 4).T
+    it = np.nditer(a, [], [['readwrite', 'updateifcopy']],
+                       casting='same_kind', op_dtypes=[np.dtype('f4')])
+    with it:
+        it.operands[0][...] = 3
+        it.operands[0][...] = 14
+    assert_equal(a, 14)
+    it = np.nditer(a, [], [['readwrite', 'updateifcopy']],
+                       casting='same_kind', op_dtypes=[np.dtype('f4')])
+    with it:
+        x = it.operands[0][-1:1]
+        x[...] = 14
+        it.operands[0][...] = -1234
+    assert_equal(a, -1234)
+    # check for no warnings on dealloc
+    x = None
+    it = None
+
+def test_iter_nbo_align_contig():
+    # Check that byte order, alignment, and contig changes work
+
+    # Byte order change by requesting a specific dtype
+    a = np.arange(6, dtype='f4')
+    au = a.byteswap().newbyteorder()
+    assert_(a.dtype.byteorder != au.dtype.byteorder)
+    i = nditer(au, [], [['readwrite', 'updateifcopy']],
+                        casting='equiv',
+                        op_dtypes=[np.dtype('f4')])
+    with i:
+        # context manager triggers UPDATEIFCOPY on i at exit
+        assert_equal(i.dtypes[0].byteorder, a.dtype.byteorder)
+        assert_equal(i.operands[0].dtype.byteorder, a.dtype.byteorder)
+        assert_equal(i.operands[0], a)
+        i.operands[0][:] = 2
+    assert_equal(au, [2]*6)
+    del i  # should not raise a warning
+    # Byte order change by requesting NBO
+    a = np.arange(6, dtype='f4')
+    au = a.byteswap().newbyteorder()
+    assert_(a.dtype.byteorder != au.dtype.byteorder)
+    with nditer(au, [], [['readwrite', 'updateifcopy', 'nbo']],
+                        casting='equiv') as i:
+        # context manager triggers UPDATEIFCOPY on i at exit
+        assert_equal(i.dtypes[0].byteorder, a.dtype.byteorder)
+        assert_equal(i.operands[0].dtype.byteorder, a.dtype.byteorder)
+        assert_equal(i.operands[0], a)
+        i.operands[0][:] = 12345
+        i.operands[0][:] = 2
+    assert_equal(au, [2]*6)
+
+    # Unaligned input
+    a = np.zeros((6*4+1,), dtype='i1')[1:]
+    a.dtype = 'f4'
+    a[:] = np.arange(6, dtype='f4')
+    assert_(not a.flags.aligned)
+    # Without 'aligned', shouldn't copy
+    i = nditer(a, [], [['readonly']])
+    assert_(not i.operands[0].flags.aligned)
+    assert_equal(i.operands[0], a)
+    # With 'aligned', should make a copy
+    with nditer(a, [], [['readwrite', 'updateifcopy', 'aligned']]) as i:
+        assert_(i.operands[0].flags.aligned)
+        # context manager triggers UPDATEIFCOPY on i at exit
+        assert_equal(i.operands[0], a)
+        i.operands[0][:] = 3
+    assert_equal(a, [3]*6)
+
+    # Discontiguous input
+    a = arange(12)
+    # If it is contiguous, shouldn't copy
+    i = nditer(a[:6], [], [['readonly']])
+    assert_(i.operands[0].flags.contiguous)
+    assert_equal(i.operands[0], a[:6])
+    # If it isn't contiguous, should buffer
+    i = nditer(a[::2], ['buffered', 'external_loop'],
+                        [['readonly', 'contig']],
+                        buffersize=10)
+    assert_(i[0].flags.contiguous)
+    assert_equal(i[0], a[::2])
+
+def test_iter_array_cast():
+    # Check that arrays are cast as requested
+
+    # No cast 'f4' -> 'f4'
+    a = np.arange(6, dtype='f4').reshape(2, 3)
+    i = nditer(a, [], [['readwrite']], op_dtypes=[np.dtype('f4')])
+    with i:
+        assert_equal(i.operands[0], a)
+        assert_equal(i.operands[0].dtype, np.dtype('f4'))
+
+    # Byte-order cast '<f4' -> '>f4'
+    a = np.arange(6, dtype='<f4').reshape(2, 3)
+    with nditer(a, [], [['readwrite', 'updateifcopy']],
+            casting='equiv',
+            op_dtypes=[np.dtype('>f4')]) as i:
+        assert_equal(i.operands[0], a)
+        assert_equal(i.operands[0].dtype, np.dtype('>f4'))
+
+    # Safe case 'f4' -> 'f8'
+    a = np.arange(24, dtype='f4').reshape(2, 3, 4).swapaxes(1, 2)
+    i = nditer(a, [], [['readonly', 'copy']],
+            casting='safe',
+            op_dtypes=[np.dtype('f8')])
+    assert_equal(i.operands[0], a)
+    assert_equal(i.operands[0].dtype, np.dtype('f8'))
+    # The memory layout of the temporary should match a (a is (48,4,16))
+    # except negative strides get flipped to positive strides.
+    assert_equal(i.operands[0].strides, (96, 8, 32))
+    a = a[::-1,:, ::-1]
+    i = nditer(a, [], [['readonly', 'copy']],
+            casting='safe',
+            op_dtypes=[np.dtype('f8')])
+    assert_equal(i.operands[0], a)
+    assert_equal(i.operands[0].dtype, np.dtype('f8'))
+    assert_equal(i.operands[0].strides, (96, 8, 32))
+
+    # Same-kind cast 'f8' -> 'f4' -> 'f8'
+    a = np.arange(24, dtype='f8').reshape(2, 3, 4).T
+    with nditer(a, [],
+            [['readwrite', 'updateifcopy']],
+            casting='same_kind',
+            op_dtypes=[np.dtype('f4')]) as i:
+        assert_equal(i.operands[0], a)
+        assert_equal(i.operands[0].dtype, np.dtype('f4'))
+        assert_equal(i.operands[0].strides, (4, 16, 48))
+        # Check that WRITEBACKIFCOPY is activated at exit
+        i.operands[0][2, 1, 1] = -12.5
+        assert_(a[2, 1, 1] != -12.5)
+    assert_equal(a[2, 1, 1], -12.5)
+
+    a = np.arange(6, dtype='i4')[::-2]
+    with nditer(a, [],
+            [['writeonly', 'updateifcopy']],
+            casting='unsafe',
+            op_dtypes=[np.dtype('f4')]) as i:
+        assert_equal(i.operands[0].dtype, np.dtype('f4'))
+        # Even though the stride was negative in 'a', it
+        # becomes positive in the temporary
+        assert_equal(i.operands[0].strides, (4,))
+        i.operands[0][:] = [1, 2, 3]
+    assert_equal(a, [1, 2, 3])
+
+def test_iter_array_cast_errors():
+    # Check that invalid casts are caught
+
+    # Need to enable copying for casts to occur
+    assert_raises(TypeError, nditer, arange(2, dtype='f4'), [],
+                [['readonly']], op_dtypes=[np.dtype('f8')])
+    # Also need to allow casting for casts to occur
+    assert_raises(TypeError, nditer, arange(2, dtype='f4'), [],
+                [['readonly', 'copy']], casting='no',
+                op_dtypes=[np.dtype('f8')])
+    assert_raises(TypeError, nditer, arange(2, dtype='f4'), [],
+                [['readonly', 'copy']], casting='equiv',
+                op_dtypes=[np.dtype('f8')])
+    assert_raises(TypeError, nditer, arange(2, dtype='f8'), [],
+                [['writeonly', 'updateifcopy']],
+                casting='no',
+                op_dtypes=[np.dtype('f4')])
+    assert_raises(TypeError, nditer, arange(2, dtype='f8'), [],
+                [['writeonly', 'updateifcopy']],
+                casting='equiv',
+                op_dtypes=[np.dtype('f4')])
+    # '<f4' -> '>f4' should not work with casting='no'
+    assert_raises(TypeError, nditer, arange(2, dtype='<f4'), [],
+                [['readonly', 'copy']], casting='no',
+                op_dtypes=[np.dtype('>f4')])
+    # 'f4' -> 'f8' is a safe cast, but 'f8' -> 'f4' isn't
+    assert_raises(TypeError, nditer, arange(2, dtype='f4'), [],
+                [['readwrite', 'updateifcopy']],
+                casting='safe',
+                op_dtypes=[np.dtype('f8')])
+    assert_raises(TypeError, nditer, arange(2, dtype='f8'), [],
+                [['readwrite', 'updateifcopy']],
+                casting='safe',
+                op_dtypes=[np.dtype('f4')])
+    # 'f4' -> 'i4' is neither a safe nor a same-kind cast
+    assert_raises(TypeError, nditer, arange(2, dtype='f4'), [],
+                [['readonly', 'copy']],
+                casting='same_kind',
+                op_dtypes=[np.dtype('i4')])
+    assert_raises(TypeError, nditer, arange(2, dtype='i4'), [],
+                [['writeonly', 'updateifcopy']],
+                casting='same_kind',
+                op_dtypes=[np.dtype('f4')])
+
+def test_iter_scalar_cast():
+    # Check that scalars are cast as requested
+
+    # No cast 'f4' -> 'f4'
+    i = nditer(np.float32(2.5), [], [['readonly']],
+                    op_dtypes=[np.dtype('f4')])
+    assert_equal(i.dtypes[0], np.dtype('f4'))
+    assert_equal(i.value.dtype, np.dtype('f4'))
+    assert_equal(i.value, 2.5)
+    # Safe cast 'f4' -> 'f8'
+    i = nditer(np.float32(2.5), [],
+                    [['readonly', 'copy']],
+                    casting='safe',
+                    op_dtypes=[np.dtype('f8')])
+    assert_equal(i.dtypes[0], np.dtype('f8'))
+    assert_equal(i.value.dtype, np.dtype('f8'))
+    assert_equal(i.value, 2.5)
+    # Same-kind cast 'f8' -> 'f4'
+    i = nditer(np.float64(2.5), [],
+                    [['readonly', 'copy']],
+                    casting='same_kind',
+                    op_dtypes=[np.dtype('f4')])
+    assert_equal(i.dtypes[0], np.dtype('f4'))
+    assert_equal(i.value.dtype, np.dtype('f4'))
+    assert_equal(i.value, 2.5)
+    # Unsafe cast 'f8' -> 'i4'
+    i = nditer(np.float64(3.0), [],
+                    [['readonly', 'copy']],
+                    casting='unsafe',
+                    op_dtypes=[np.dtype('i4')])
+    assert_equal(i.dtypes[0], np.dtype('i4'))
+    assert_equal(i.value.dtype, np.dtype('i4'))
+    assert_equal(i.value, 3)
+    # Readonly scalars may be cast even without setting COPY or BUFFERED
+    i = nditer(3, [], [['readonly']], op_dtypes=[np.dtype('f8')])
+    assert_equal(i[0].dtype, np.dtype('f8'))
+    assert_equal(i[0], 3.)
+
+def test_iter_scalar_cast_errors():
+    # Check that invalid casts are caught
+
+    # Need to allow copying/buffering for write casts of scalars to occur
+    assert_raises(TypeError, nditer, np.float32(2), [],
+                [['readwrite']], op_dtypes=[np.dtype('f8')])
+    assert_raises(TypeError, nditer, 2.5, [],
+                [['readwrite']], op_dtypes=[np.dtype('f4')])
+    # 'f8' -> 'f4' isn't a safe cast if the value would overflow
+    assert_raises(TypeError, nditer, np.float64(1e60), [],
+                [['readonly']],
+                casting='safe',
+                op_dtypes=[np.dtype('f4')])
+    # 'f4' -> 'i4' is neither a safe nor a same-kind cast
+    assert_raises(TypeError, nditer, np.float32(2), [],
+                [['readonly']],
+                casting='same_kind',
+                op_dtypes=[np.dtype('i4')])
+
+def test_iter_object_arrays_basic():
+    # Check that object arrays work
+
+    obj = {'a':3,'b':'d'}
+    a = np.array([[1, 2, 3], None, obj, None], dtype='O')
+    if HAS_REFCOUNT:
+        rc = sys.getrefcount(obj)
+
+    # Need to allow references for object arrays
+    assert_raises(TypeError, nditer, a)
+    if HAS_REFCOUNT:
+        assert_equal(sys.getrefcount(obj), rc)
+
+    i = nditer(a, ['refs_ok'], ['readonly'])
+    vals = [x_[()] for x_ in i]
+    assert_equal(np.array(vals, dtype='O'), a)
+    vals, i, x = [None]*3
+    if HAS_REFCOUNT:
+        assert_equal(sys.getrefcount(obj), rc)
+
+    i = nditer(a.reshape(2, 2).T, ['refs_ok', 'buffered'],
+                        ['readonly'], order='C')
+    assert_(i.iterationneedsapi)
+    vals = [x_[()] for x_ in i]
+    assert_equal(np.array(vals, dtype='O'), a.reshape(2, 2).ravel(order='F'))
+    vals, i, x = [None]*3
+    if HAS_REFCOUNT:
+        assert_equal(sys.getrefcount(obj), rc)
+
+    i = nditer(a.reshape(2, 2).T, ['refs_ok', 'buffered'],
+                        ['readwrite'], order='C')
+    with i:
+        for x in i:
+            x[...] = None
+        vals, i, x = [None]*3
+    if HAS_REFCOUNT:
+        assert_(sys.getrefcount(obj) == rc-1)
+    assert_equal(a, np.array([None]*4, dtype='O'))
+
+def test_iter_object_arrays_conversions():
+    # Conversions to/from objects
+    a = np.arange(6, dtype='O')
+    i = nditer(a, ['refs_ok', 'buffered'], ['readwrite'],
+                    casting='unsafe', op_dtypes='i4')
+    with i:
+        for x in i:
+            x[...] += 1
+    assert_equal(a, np.arange(6)+1)
+
+    a = np.arange(6, dtype='i4')
+    i = nditer(a, ['refs_ok', 'buffered'], ['readwrite'],
+                    casting='unsafe', op_dtypes='O')
+    with i:
+        for x in i:
+            x[...] += 1
+    assert_equal(a, np.arange(6)+1)
+
+    # Non-contiguous object array
+    a = np.zeros((6,), dtype=[('p', 'i1'), ('a', 'O')])
+    a = a['a']
+    a[:] = np.arange(6)
+    i = nditer(a, ['refs_ok', 'buffered'], ['readwrite'],
+                    casting='unsafe', op_dtypes='i4')
+    with i:
+        for x in i:
+            x[...] += 1
+    assert_equal(a, np.arange(6)+1)
+
+    #Non-contiguous value array
+    a = np.zeros((6,), dtype=[('p', 'i1'), ('a', 'i4')])
+    a = a['a']
+    a[:] = np.arange(6) + 98172488
+    i = nditer(a, ['refs_ok', 'buffered'], ['readwrite'],
+                    casting='unsafe', op_dtypes='O')
+    with i:
+        ob = i[0][()]
+        if HAS_REFCOUNT:
+            rc = sys.getrefcount(ob)
+        for x in i:
+            x[...] += 1
+    if HAS_REFCOUNT:
+        assert_(sys.getrefcount(ob) == rc-1)
+    assert_equal(a, np.arange(6)+98172489)
+
+def test_iter_common_dtype():
+    # Check that the iterator finds a common data type correctly
+
+    i = nditer([array([3], dtype='f4'), array([0], dtype='f8')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*2,
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('f8'))
+    assert_equal(i.dtypes[1], np.dtype('f8'))
+    i = nditer([array([3], dtype='i4'), array([0], dtype='f4')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*2,
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('f8'))
+    assert_equal(i.dtypes[1], np.dtype('f8'))
+    i = nditer([array([3], dtype='f4'), array(0, dtype='f8')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*2,
+                    casting='same_kind')
+    assert_equal(i.dtypes[0], np.dtype('f4'))
+    assert_equal(i.dtypes[1], np.dtype('f4'))
+    i = nditer([array([3], dtype='u4'), array(0, dtype='i4')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*2,
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('u4'))
+    assert_equal(i.dtypes[1], np.dtype('u4'))
+    i = nditer([array([3], dtype='u4'), array(-12, dtype='i4')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*2,
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('i8'))
+    assert_equal(i.dtypes[1], np.dtype('i8'))
+    i = nditer([array([3], dtype='u4'), array(-12, dtype='i4'),
+                 array([2j], dtype='c8'), array([9], dtype='f8')],
+                    ['common_dtype'],
+                    [['readonly', 'copy']]*4,
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('c16'))
+    assert_equal(i.dtypes[1], np.dtype('c16'))
+    assert_equal(i.dtypes[2], np.dtype('c16'))
+    assert_equal(i.dtypes[3], np.dtype('c16'))
+    assert_equal(i.value, (3, -12, 2j, 9))
+
+    # When allocating outputs, other outputs aren't factored in
+    i = nditer([array([3], dtype='i4'), None, array([2j], dtype='c16')], [],
+                    [['readonly', 'copy'],
+                     ['writeonly', 'allocate'],
+                     ['writeonly']],
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('i4'))
+    assert_equal(i.dtypes[1], np.dtype('i4'))
+    assert_equal(i.dtypes[2], np.dtype('c16'))
+    # But, if common data types are requested, they are
+    i = nditer([array([3], dtype='i4'), None, array([2j], dtype='c16')],
+                    ['common_dtype'],
+                    [['readonly', 'copy'],
+                     ['writeonly', 'allocate'],
+                     ['writeonly']],
+                    casting='safe')
+    assert_equal(i.dtypes[0], np.dtype('c16'))
+    assert_equal(i.dtypes[1], np.dtype('c16'))
+    assert_equal(i.dtypes[2], np.dtype('c16'))
+
+def test_iter_copy_if_overlap():
+    # Ensure the iterator makes copies on read/write overlap, if requested
+
+    # Copy not needed, 1 op
+    for flag in ['readonly', 'writeonly', 'readwrite']:
+        a = arange(10)
+        i = nditer([a], ['copy_if_overlap'], [[flag]])
+        with i:
+            assert_(i.operands[0] is a)
+
+    # Copy needed, 2 ops, read-write overlap
+    x = arange(10)
+    a = x[1:]
+    b = x[:-1]
+    with nditer([a, b], ['copy_if_overlap'], [['readonly'], ['readwrite']]) as i:
+        assert_(not np.shares_memory(*i.operands))
+
+    # Copy not needed with elementwise, 2 ops, exactly same arrays
+    x = arange(10)
+    a = x
+    b = x
+    i = nditer([a, b], ['copy_if_overlap'], [['readonly', 'overlap_assume_elementwise'],
+                                             ['readwrite', 'overlap_assume_elementwise']])
+    with i:
+        assert_(i.operands[0] is a and i.operands[1] is b)
+    with nditer([a, b], ['copy_if_overlap'], [['readonly'], ['readwrite']]) as i:
+        assert_(i.operands[0] is a and not np.shares_memory(i.operands[1], b))
+
+    # Copy not needed, 2 ops, no overlap
+    x = arange(10)
+    a = x[::2]
+    b = x[1::2]
+    i = nditer([a, b], ['copy_if_overlap'], [['readonly'], ['writeonly']])
+    assert_(i.operands[0] is a and i.operands[1] is b)
+
+    # Copy needed, 2 ops, read-write overlap
+    x = arange(4, dtype=np.int8)
+    a = x[3:]
+    b = x.view(np.int32)[:1]
+    with nditer([a, b], ['copy_if_overlap'], [['readonly'], ['writeonly']]) as i:
+        assert_(not np.shares_memory(*i.operands))
+
+    # Copy needed, 3 ops, read-write overlap
+    for flag in ['writeonly', 'readwrite']:
+        x = np.ones([10, 10])
+        a = x
+        b = x.T
+        c = x
+        with nditer([a, b, c], ['copy_if_overlap'],
+                   [['readonly'], ['readonly'], [flag]]) as i:
+            a2, b2, c2 = i.operands
+            assert_(not np.shares_memory(a2, c2))
+            assert_(not np.shares_memory(b2, c2))
+
+    # Copy not needed, 3 ops, read-only overlap
+    x = np.ones([10, 10])
+    a = x
+    b = x.T
+    c = x
+    i = nditer([a, b, c], ['copy_if_overlap'],
+               [['readonly'], ['readonly'], ['readonly']])
+    a2, b2, c2 = i.operands
+    assert_(a is a2)
+    assert_(b is b2)
+    assert_(c is c2)
+
+    # Copy not needed, 3 ops, read-only overlap
+    x = np.ones([10, 10])
+    a = x
+    b = np.ones([10, 10])
+    c = x.T
+    i = nditer([a, b, c], ['copy_if_overlap'],
+               [['readonly'], ['writeonly'], ['readonly']])
+    a2, b2, c2 = i.operands
+    assert_(a is a2)
+    assert_(b is b2)
+    assert_(c is c2)
+
+    # Copy not needed, 3 ops, write-only overlap
+    x = np.arange(7)
+    a = x[:3]
+    b = x[3:6]
+    c = x[4:7]
+    i = nditer([a, b, c], ['copy_if_overlap'],
+               [['readonly'], ['writeonly'], ['writeonly']])
+    a2, b2, c2 = i.operands
+    assert_(a is a2)
+    assert_(b is b2)
+    assert_(c is c2)
+
+def test_iter_op_axes():
+    # Check that custom axes work
+
+    # Reverse the axes
+    a = arange(6).reshape(2, 3)
+    i = nditer([a, a.T], [], [['readonly']]*2, op_axes=[[0, 1], [1, 0]])
+    assert_(all([x == y for (x, y) in i]))
+    a = arange(24).reshape(2, 3, 4)
+    i = nditer([a.T, a], [], [['readonly']]*2, op_axes=[[2, 1, 0], None])
+    assert_(all([x == y for (x, y) in i]))
+
+    # Broadcast 1D to any dimension
+    a = arange(1, 31).reshape(2, 3, 5)
+    b = arange(1, 3)
+    i = nditer([a, b], [], [['readonly']]*2, op_axes=[None, [0, -1, -1]])
+    assert_equal([x*y for (x, y) in i], (a*b.reshape(2, 1, 1)).ravel())
+    b = arange(1, 4)
+    i = nditer([a, b], [], [['readonly']]*2, op_axes=[None, [-1, 0, -1]])
+    assert_equal([x*y for (x, y) in i], (a*b.reshape(1, 3, 1)).ravel())
+    b = arange(1, 6)
+    i = nditer([a, b], [], [['readonly']]*2,
+                            op_axes=[None, [np.newaxis, np.newaxis, 0]])
+    assert_equal([x*y for (x, y) in i], (a*b.reshape(1, 1, 5)).ravel())
+
+    # Inner product-style broadcasting
+    a = arange(24).reshape(2, 3, 4)
+    b = arange(40).reshape(5, 2, 4)
+    i = nditer([a, b], ['multi_index'], [['readonly']]*2,
+                            op_axes=[[0, 1, -1, -1], [-1, -1, 0, 1]])
+    assert_equal(i.shape, (2, 3, 5, 2))
+
+    # Matrix product-style broadcasting
+    a = arange(12).reshape(3, 4)
+    b = arange(20).reshape(4, 5)
+    i = nditer([a, b], ['multi_index'], [['readonly']]*2,
+                            op_axes=[[0, -1], [-1, 1]])
+    assert_equal(i.shape, (3, 5))
+
+def test_iter_op_axes_errors():
+    # Check that custom axes throws errors for bad inputs
+
+    # Wrong number of items in op_axes
+    a = arange(6).reshape(2, 3)
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0], [1], [0]])
+    # Out of bounds items in op_axes
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[2, 1], [0, 1]])
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0, 1], [2, -1]])
+    # Duplicate items in op_axes
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0, 0], [0, 1]])
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0, 1], [1, 1]])
+
+    # Different sized arrays in op_axes
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0, 1], [0, 1, 0]])
+
+    # Non-broadcastable dimensions in the result
+    assert_raises(ValueError, nditer, [a, a], [], [['readonly']]*2,
+                                    op_axes=[[0, 1], [1, 0]])
+
+def test_iter_copy():
+    # Check that copying the iterator works correctly
+    a = arange(24).reshape(2, 3, 4)
+
+    # Simple iterator
+    i = nditer(a)
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    i.iterindex = 3
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    # Buffered iterator
+    i = nditer(a, ['buffered', 'ranged'], order='F', buffersize=3)
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    i.iterindex = 3
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    i.iterrange = (3, 9)
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    i.iterrange = (2, 18)
+    next(i)
+    next(i)
+    j = i.copy()
+    assert_equal([x[()] for x in i], [x[()] for x in j])
+
+    # Casting iterator
+    with nditer(a, ['buffered'], order='F', casting='unsafe',
+                op_dtypes='f8', buffersize=5) as i:
+        j = i.copy()
+    assert_equal([x[()] for x in j], a.ravel(order='F'))
+
+    a = arange(24, dtype='<i4').reshape(2, 3, 4)
+    with nditer(a, ['buffered'], order='F', casting='unsafe',
+                op_dtypes='>f8', buffersize=5) as i:
+        j = i.copy()
+    assert_equal([x[()] for x in j], a.ravel(order='F'))
+
+def test_iter_allocate_output_simple():
+    # Check that the iterator will properly allocate outputs
+
+    # Simple case
+    a = arange(6)
+    i = nditer([a, None], [], [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')])
+    assert_equal(i.operands[1].shape, a.shape)
+    assert_equal(i.operands[1].dtype, np.dtype('f4'))
+
+def test_iter_allocate_output_buffered_readwrite():
+    # Allocated output with buffering + delay_bufalloc
+
+    a = arange(6)
+    i = nditer([a, None], ['buffered', 'delay_bufalloc'],
+                        [['readonly'], ['allocate', 'readwrite']])
+    with i:
+        i.operands[1][:] = 1
+        i.reset()
+        for x in i:
+            x[1][...] += x[0][...]
+        assert_equal(i.operands[1], a+1)
+
+def test_iter_allocate_output_itorder():
+    # The allocated output should match the iteration order
+
+    # C-order input, best iteration order
+    a = arange(6, dtype='i4').reshape(2, 3)
+    i = nditer([a, None], [], [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')])
+    assert_equal(i.operands[1].shape, a.shape)
+    assert_equal(i.operands[1].strides, a.strides)
+    assert_equal(i.operands[1].dtype, np.dtype('f4'))
+    # F-order input, best iteration order
+    a = arange(24, dtype='i4').reshape(2, 3, 4).T
+    i = nditer([a, None], [], [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')])
+    assert_equal(i.operands[1].shape, a.shape)
+    assert_equal(i.operands[1].strides, a.strides)
+    assert_equal(i.operands[1].dtype, np.dtype('f4'))
+    # Non-contiguous input, C iteration order
+    a = arange(24, dtype='i4').reshape(2, 3, 4).swapaxes(0, 1)
+    i = nditer([a, None], [],
+                        [['readonly'], ['writeonly', 'allocate']],
+                        order='C',
+                        op_dtypes=[None, np.dtype('f4')])
+    assert_equal(i.operands[1].shape, a.shape)
+    assert_equal(i.operands[1].strides, (32, 16, 4))
+    assert_equal(i.operands[1].dtype, np.dtype('f4'))
+
+def test_iter_allocate_output_opaxes():
+    # Specifying op_axes should work
+
+    a = arange(24, dtype='i4').reshape(2, 3, 4)
+    i = nditer([None, a], [], [['writeonly', 'allocate'], ['readonly']],
+                        op_dtypes=[np.dtype('u4'), None],
+                        op_axes=[[1, 2, 0], None])
+    assert_equal(i.operands[0].shape, (4, 2, 3))
+    assert_equal(i.operands[0].strides, (4, 48, 16))
+    assert_equal(i.operands[0].dtype, np.dtype('u4'))
+
+def test_iter_allocate_output_types_promotion():
+    # Check type promotion of automatic outputs
+
+    i = nditer([array([3], dtype='f4'), array([0], dtype='f8'), None], [],
+                    [['readonly']]*2+[['writeonly', 'allocate']])
+    assert_equal(i.dtypes[2], np.dtype('f8'))
+    i = nditer([array([3], dtype='i4'), array([0], dtype='f4'), None], [],
+                    [['readonly']]*2+[['writeonly', 'allocate']])
+    assert_equal(i.dtypes[2], np.dtype('f8'))
+    i = nditer([array([3], dtype='f4'), array(0, dtype='f8'), None], [],
+                    [['readonly']]*2+[['writeonly', 'allocate']])
+    assert_equal(i.dtypes[2], np.dtype('f4'))
+    i = nditer([array([3], dtype='u4'), array(0, dtype='i4'), None], [],
+                    [['readonly']]*2+[['writeonly', 'allocate']])
+    assert_equal(i.dtypes[2], np.dtype('u4'))
+    i = nditer([array([3], dtype='u4'), array(-12, dtype='i4'), None], [],
+                    [['readonly']]*2+[['writeonly', 'allocate']])
+    assert_equal(i.dtypes[2], np.dtype('i8'))
+
+def test_iter_allocate_output_types_byte_order():
+    # Verify the rules for byte order changes
+
+    # When there's just one input, the output type exactly matches
+    a = array([3], dtype='u4').newbyteorder()
+    i = nditer([a, None], [],
+                    [['readonly'], ['writeonly', 'allocate']])
+    assert_equal(i.dtypes[0], i.dtypes[1])
+    # With two or more inputs, the output type is in native byte order
+    i = nditer([a, a, None], [],
+                    [['readonly'], ['readonly'], ['writeonly', 'allocate']])
+    assert_(i.dtypes[0] != i.dtypes[2])
+    assert_equal(i.dtypes[0].newbyteorder('='), i.dtypes[2])
+
+def test_iter_allocate_output_types_scalar():
+    # If the inputs are all scalars, the output should be a scalar
+
+    i = nditer([None, 1, 2.3, np.float32(12), np.complex128(3)], [],
+                [['writeonly', 'allocate']] + [['readonly']]*4)
+    assert_equal(i.operands[0].dtype, np.dtype('complex128'))
+    assert_equal(i.operands[0].ndim, 0)
+
+def test_iter_allocate_output_subtype():
+    # Make sure that the subtype with priority wins
+    class MyNDArray(np.ndarray):
+        __array_priority__ = 15
+
+    # subclass vs ndarray
+    a = np.array([[1, 2], [3, 4]]).view(MyNDArray)
+    b = np.arange(4).reshape(2, 2).T
+    i = nditer([a, b, None], [],
+               [['readonly'], ['readonly'], ['writeonly', 'allocate']])
+    assert_equal(type(a), type(i.operands[2]))
+    assert_(type(b) is not type(i.operands[2]))
+    assert_equal(i.operands[2].shape, (2, 2))
+
+    # If subtypes are disabled, we should get back an ndarray.
+    i = nditer([a, b, None], [],
+               [['readonly'], ['readonly'],
+                ['writeonly', 'allocate', 'no_subtype']])
+    assert_equal(type(b), type(i.operands[2]))
+    assert_(type(a) is not type(i.operands[2]))
+    assert_equal(i.operands[2].shape, (2, 2))
+
+def test_iter_allocate_output_errors():
+    # Check that the iterator will throw errors for bad output allocations
+
+    # Need an input if no output data type is specified
+    a = arange(6)
+    assert_raises(TypeError, nditer, [a, None], [],
+                        [['writeonly'], ['writeonly', 'allocate']])
+    # Allocated output should be flagged for writing
+    assert_raises(ValueError, nditer, [a, None], [],
+                        [['readonly'], ['allocate', 'readonly']])
+    # Allocated output can't have buffering without delayed bufalloc
+    assert_raises(ValueError, nditer, [a, None], ['buffered'],
+                                            ['allocate', 'readwrite'])
+    # Must specify at least one input
+    assert_raises(ValueError, nditer, [None, None], [],
+                        [['writeonly', 'allocate'],
+                         ['writeonly', 'allocate']],
+                        op_dtypes=[np.dtype('f4'), np.dtype('f4')])
+    # If using op_axes, must specify all the axes
+    a = arange(24, dtype='i4').reshape(2, 3, 4)
+    assert_raises(ValueError, nditer, [a, None], [],
+                        [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')],
+                        op_axes=[None, [0, np.newaxis, 1]])
+    # If using op_axes, the axes must be within bounds
+    assert_raises(ValueError, nditer, [a, None], [],
+                        [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')],
+                        op_axes=[None, [0, 3, 1]])
+    # If using op_axes, there can't be duplicates
+    assert_raises(ValueError, nditer, [a, None], [],
+                        [['readonly'], ['writeonly', 'allocate']],
+                        op_dtypes=[None, np.dtype('f4')],
+                        op_axes=[None, [0, 2, 1, 0]])
+
+def test_iter_remove_axis():
+    a = arange(24).reshape(2, 3, 4)
+
+    i = nditer(a, ['multi_index'])
+    i.remove_axis(1)
+    assert_equal([x for x in i], a[:, 0,:].ravel())
+
+    a = a[::-1,:,:]
+    i = nditer(a, ['multi_index'])
+    i.remove_axis(0)
+    assert_equal([x for x in i], a[0,:,:].ravel())
+
+def test_iter_remove_multi_index_inner_loop():
+    # Check that removing multi-index support works
+
+    a = arange(24).reshape(2, 3, 4)
+
+    i = nditer(a, ['multi_index'])
+    assert_equal(i.ndim, 3)
+    assert_equal(i.shape, (2, 3, 4))
+    assert_equal(i.itviews[0].shape, (2, 3, 4))
+
+    # Removing the multi-index tracking causes all dimensions to coalesce
+    before = [x for x in i]
+    i.remove_multi_index()
+    after = [x for x in i]
+
+    assert_equal(before, after)
+    assert_equal(i.ndim, 1)
+    assert_raises(ValueError, lambda i:i.shape, i)
+    assert_equal(i.itviews[0].shape, (24,))
+
+    # Removing the inner loop means there's just one iteration
+    i.reset()
+    assert_equal(i.itersize, 24)
+    assert_equal(i[0].shape, tuple())
+    i.enable_external_loop()
+    assert_equal(i.itersize, 24)
+    assert_equal(i[0].shape, (24,))
+    assert_equal(i.value, arange(24))
+
+def test_iter_iterindex():
+    # Make sure iterindex works
+
+    buffersize = 5
+    a = arange(24).reshape(4, 3, 2)
+    for flags in ([], ['buffered']):
+        i = nditer(a, flags, buffersize=buffersize)
+        assert_equal(iter_iterindices(i), list(range(24)))
+        i.iterindex = 2
+        assert_equal(iter_iterindices(i), list(range(2, 24)))
+
+        i = nditer(a, flags, order='F', buffersize=buffersize)
+        assert_equal(iter_iterindices(i), list(range(24)))
+        i.iterindex = 5
+        assert_equal(iter_iterindices(i), list(range(5, 24)))
+
+        i = nditer(a[::-1], flags, order='F', buffersize=buffersize)
+        assert_equal(iter_iterindices(i), list(range(24)))
+        i.iterindex = 9
+        assert_equal(iter_iterindices(i), list(range(9, 24)))
+
+        i = nditer(a[::-1, ::-1], flags, order='C', buffersize=buffersize)
+        assert_equal(iter_iterindices(i), list(range(24)))
+        i.iterindex = 13
+        assert_equal(iter_iterindices(i), list(range(13, 24)))
+
+        i = nditer(a[::1, ::-1], flags, buffersize=buffersize)
+        assert_equal(iter_iterindices(i), list(range(24)))
+        i.iterindex = 23
+        assert_equal(iter_iterindices(i), list(range(23, 24)))
+        i.reset()
+        i.iterindex = 2
+        assert_equal(iter_iterindices(i), list(range(2, 24)))
+
+def test_iter_iterrange():
+    # Make sure getting and resetting the iterrange works
+
+    buffersize = 5
+    a = arange(24, dtype='i4').reshape(4, 3, 2)
+    a_fort = a.ravel(order='F')
+
+    i = nditer(a, ['ranged'], ['readonly'], order='F',
+                buffersize=buffersize)
+    assert_equal(i.iterrange, (0, 24))
+    assert_equal([x[()] for x in i], a_fort)
+    for r in [(0, 24), (1, 2), (3, 24), (5, 5), (0, 20), (23, 24)]:
+        i.iterrange = r
+        assert_equal(i.iterrange, r)
+        assert_equal([x[()] for x in i], a_fort[r[0]:r[1]])
+
+    i = nditer(a, ['ranged', 'buffered'], ['readonly'], order='F',
+                op_dtypes='f8', buffersize=buffersize)
+    assert_equal(i.iterrange, (0, 24))
+    assert_equal([x[()] for x in i], a_fort)
+    for r in [(0, 24), (1, 2), (3, 24), (5, 5), (0, 20), (23, 24)]:
+        i.iterrange = r
+        assert_equal(i.iterrange, r)
+        assert_equal([x[()] for x in i], a_fort[r[0]:r[1]])
+
+    def get_array(i):
+        val = np.array([], dtype='f8')
+        for x in i:
+            val = np.concatenate((val, x))
+        return val
+
+    i = nditer(a, ['ranged', 'buffered', 'external_loop'],
+                ['readonly'], order='F',
+                op_dtypes='f8', buffersize=buffersize)
+    assert_equal(i.iterrange, (0, 24))
+    assert_equal(get_array(i), a_fort)
+    for r in [(0, 24), (1, 2), (3, 24), (5, 5), (0, 20), (23, 24)]:
+        i.iterrange = r
+        assert_equal(i.iterrange, r)
+        assert_equal(get_array(i), a_fort[r[0]:r[1]])
+
+def test_iter_buffering():
+    # Test buffering with several buffer sizes and types
+    arrays = []
+    # F-order swapped array
+    arrays.append(np.arange(24,
+                    dtype='c16').reshape(2, 3, 4).T.newbyteorder().byteswap())
+    # Contiguous 1-dimensional array
+    arrays.append(np.arange(10, dtype='f4'))
+    # Unaligned array
+    a = np.zeros((4*16+1,), dtype='i1')[1:]
+    a.dtype = 'i4'
+    a[:] = np.arange(16, dtype='i4')
+    arrays.append(a)
+    # 4-D F-order array
+    arrays.append(np.arange(120, dtype='i4').reshape(5, 3, 2, 4).T)
+    for a in arrays:
+        for buffersize in (1, 2, 3, 5, 8, 11, 16, 1024):
+            vals = []
+            i = nditer(a, ['buffered', 'external_loop'],
+                           [['readonly', 'nbo', 'aligned']],
+                           order='C',
+                           casting='equiv',
+                           buffersize=buffersize)
+            while not i.finished:
+                assert_(i[0].size <= buffersize)
+                vals.append(i[0].copy())
+                i.iternext()
+            assert_equal(np.concatenate(vals), a.ravel(order='C'))
+
+def test_iter_write_buffering():
+    # Test that buffering of writes is working
+
+    # F-order swapped array
+    a = np.arange(24).reshape(2, 3, 4).T.newbyteorder().byteswap()
+    i = nditer(a, ['buffered'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='equiv',
+                   order='C',
+                   buffersize=16)
+    x = 0
+    with i:
+        while not i.finished:
+            i[0] = x
+            x += 1
+            i.iternext()
+    assert_equal(a.ravel(order='C'), np.arange(24))
+
+def test_iter_buffering_delayed_alloc():
+    # Test that delaying buffer allocation works
+
+    a = np.arange(6)
+    b = np.arange(1, dtype='f4')
+    i = nditer([a, b], ['buffered', 'delay_bufalloc', 'multi_index', 'reduce_ok'],
+                    ['readwrite'],
+                    casting='unsafe',
+                    op_dtypes='f4')
+    assert_(i.has_delayed_bufalloc)
+    assert_raises(ValueError, lambda i:i.multi_index, i)
+    assert_raises(ValueError, lambda i:i[0], i)
+    assert_raises(ValueError, lambda i:i[0:2], i)
+
+    def assign_iter(i):
+        i[0] = 0
+    assert_raises(ValueError, assign_iter, i)
+
+    i.reset()
+    assert_(not i.has_delayed_bufalloc)
+    assert_equal(i.multi_index, (0,))
+    with i:
+        assert_equal(i[0], 0)
+        i[1] = 1
+        assert_equal(i[0:2], [0, 1])
+        assert_equal([[x[0][()], x[1][()]] for x in i], list(zip(range(6), [1]*6)))
+
+def test_iter_buffered_cast_simple():
+    # Test that buffering can handle a simple cast
+
+    a = np.arange(10, dtype='f4')
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('f8')],
+                   buffersize=3)
+    with i:
+        for v in i:
+            v[...] *= 2
+
+    assert_equal(a, 2*np.arange(10, dtype='f4'))
+
+def test_iter_buffered_cast_byteswapped():
+    # Test that buffering can handle a cast which requires swap->cast->swap
+
+    a = np.arange(10, dtype='f4').newbyteorder().byteswap()
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('f8').newbyteorder()],
+                   buffersize=3)
+    with i:
+        for v in i:
+            v[...] *= 2
+
+    assert_equal(a, 2*np.arange(10, dtype='f4'))
+
+    with suppress_warnings() as sup:
+        sup.filter(np.ComplexWarning)
+
+        a = np.arange(10, dtype='f8').newbyteorder().byteswap()
+        i = nditer(a, ['buffered', 'external_loop'],
+                       [['readwrite', 'nbo', 'aligned']],
+                       casting='unsafe',
+                       op_dtypes=[np.dtype('c8').newbyteorder()],
+                       buffersize=3)
+        with i:
+            for v in i:
+                v[...] *= 2
+
+        assert_equal(a, 2*np.arange(10, dtype='f8'))
+
+def test_iter_buffered_cast_byteswapped_complex():
+    # Test that buffering can handle a cast which requires swap->cast->copy
+
+    a = np.arange(10, dtype='c8').newbyteorder().byteswap()
+    a += 2j
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('c16')],
+                   buffersize=3)
+    with i:
+        for v in i:
+            v[...] *= 2
+    assert_equal(a, 2*np.arange(10, dtype='c8') + 4j)
+
+    a = np.arange(10, dtype='c8')
+    a += 2j
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('c16').newbyteorder()],
+                   buffersize=3)
+    with i:
+        for v in i:
+            v[...] *= 2
+    assert_equal(a, 2*np.arange(10, dtype='c8') + 4j)
+
+    a = np.arange(10, dtype=np.clongdouble).newbyteorder().byteswap()
+    a += 2j
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('c16')],
+                   buffersize=3)
+    with i:
+        for v in i:
+            v[...] *= 2
+    assert_equal(a, 2*np.arange(10, dtype=np.clongdouble) + 4j)
+
+    a = np.arange(10, dtype=np.longdouble).newbyteorder().byteswap()
+    i = nditer(a, ['buffered', 'external_loop'],
+                   [['readwrite', 'nbo', 'aligned']],
+                   casting='same_kind',
+                   op_dtypes=[np.dtype('f4')],
+                   buffersize=7)
+    with i:
+        for v in i:
+            v[...] *= 2
+    assert_equal(a, 2*np.arange(10, dtype=np.longdouble))
+
+def test_iter_buffered_cast_structured_type():
+    # Tests buffering of structured types
+
+    # simple -> struct type (duplicates the value)
+    sdt = [('a', 'f4'), ('b', 'i8'), ('c', 'c8', (2, 3)), ('d', 'O')]
+    a = np.arange(3, dtype='f4') + 0.5
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt)
+    vals = [np.array(x) for x in i]
+    assert_equal(vals[0]['a'], 0.5)
+    assert_equal(vals[0]['b'], 0)
+    assert_equal(vals[0]['c'], [[(0.5)]*3]*2)
+    assert_equal(vals[0]['d'], 0.5)
+    assert_equal(vals[1]['a'], 1.5)
+    assert_equal(vals[1]['b'], 1)
+    assert_equal(vals[1]['c'], [[(1.5)]*3]*2)
+    assert_equal(vals[1]['d'], 1.5)
+    assert_equal(vals[0].dtype, np.dtype(sdt))
+
+    # object -> struct type
+    sdt = [('a', 'f4'), ('b', 'i8'), ('c', 'c8', (2, 3)), ('d', 'O')]
+    a = np.zeros((3,), dtype='O')
+    a[0] = (0.5, 0.5, [[0.5, 0.5, 0.5], [0.5, 0.5, 0.5]], 0.5)
+    a[1] = (1.5, 1.5, [[1.5, 1.5, 1.5], [1.5, 1.5, 1.5]], 1.5)
+    a[2] = (2.5, 2.5, [[2.5, 2.5, 2.5], [2.5, 2.5, 2.5]], 2.5)
+    if HAS_REFCOUNT:
+        rc = sys.getrefcount(a[0])
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt)
+    vals = [x.copy() for x in i]
+    assert_equal(vals[0]['a'], 0.5)
+    assert_equal(vals[0]['b'], 0)
+    assert_equal(vals[0]['c'], [[(0.5)]*3]*2)
+    assert_equal(vals[0]['d'], 0.5)
+    assert_equal(vals[1]['a'], 1.5)
+    assert_equal(vals[1]['b'], 1)
+    assert_equal(vals[1]['c'], [[(1.5)]*3]*2)
+    assert_equal(vals[1]['d'], 1.5)
+    assert_equal(vals[0].dtype, np.dtype(sdt))
+    vals, i, x = [None]*3
+    if HAS_REFCOUNT:
+        assert_equal(sys.getrefcount(a[0]), rc)
+
+    # single-field struct type -> simple
+    sdt = [('a', 'f4')]
+    a = np.array([(5.5,), (8,)], dtype=sdt)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes='i4')
+    assert_equal([x_[()] for x_ in i], [5, 8])
+
+    # make sure multi-field struct type -> simple doesn't work
+    sdt = [('a', 'f4'), ('b', 'i8'), ('d', 'O')]
+    a = np.array([(5.5, 7, 'test'), (8, 10, 11)], dtype=sdt)
+    assert_raises(TypeError, lambda: (
+        nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+               casting='unsafe',
+               op_dtypes='i4')))
+
+    # struct type -> struct type (field-wise copy)
+    sdt1 = [('a', 'f4'), ('b', 'i8'), ('d', 'O')]
+    sdt2 = [('d', 'u2'), ('a', 'O'), ('b', 'f8')]
+    a = np.array([(1, 2, 3), (4, 5, 6)], dtype=sdt1)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    assert_equal([np.array(x_) for x_ in i],
+                 [np.array((1, 2, 3), dtype=sdt2),
+                  np.array((4, 5, 6), dtype=sdt2)])
+
+    # make sure struct type -> struct type with different
+    # number of fields fails
+    sdt1 = [('a', 'f4'), ('b', 'i8'), ('d', 'O')]
+    sdt2 = [('b', 'O'), ('a', 'f8')]
+    a = np.array([(1, 2, 3), (4, 5, 6)], dtype=sdt1)
+
+    assert_raises(ValueError, lambda : (
+        nditer(a, ['buffered', 'refs_ok'], ['readwrite'],
+               casting='unsafe',
+               op_dtypes=sdt2)))
+
+
+def test_iter_buffered_cast_subarray():
+    # Tests buffering of subarrays
+
+    # one element -> many (copies it to all)
+    sdt1 = [('a', 'f4')]
+    sdt2 = [('a', 'f8', (3, 2, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    for x, count in zip(i, list(range(6))):
+        assert_(np.all(x['a'] == count))
+
+    # one element -> many -> back (copies it to all)
+    sdt1 = [('a', 'O', (1, 1))]
+    sdt2 = [('a', 'O', (3, 2, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'][:, 0, 0] = np.arange(6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readwrite'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    with i:
+        assert_equal(i[0].dtype, np.dtype(sdt2))
+        count = 0
+        for x in i:
+            assert_(np.all(x['a'] == count))
+            x['a'][0] += 2
+            count += 1
+    assert_equal(a['a'], np.arange(6).reshape(6, 1, 1)+2)
+
+    # many -> one element -> back (copies just element 0)
+    sdt1 = [('a', 'O', (3, 2, 2))]
+    sdt2 = [('a', 'O', (1,))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'][:, 0, 0, 0] = np.arange(6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readwrite'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    with i:
+        assert_equal(i[0].dtype, np.dtype(sdt2))
+        count = 0
+        for x in i:
+            assert_equal(x['a'], count)
+            x['a'] += 2
+            count += 1
+    assert_equal(a['a'], np.arange(6).reshape(6, 1, 1, 1)*np.ones((1, 3, 2, 2))+2)
+
+    # many -> one element -> back (copies just element 0)
+    sdt1 = [('a', 'f8', (3, 2, 2))]
+    sdt2 = [('a', 'O', (1,))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'][:, 0, 0, 0] = np.arange(6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'], count)
+        count += 1
+
+    # many -> one element (copies just element 0)
+    sdt1 = [('a', 'O', (3, 2, 2))]
+    sdt2 = [('a', 'f4', (1,))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'][:, 0, 0, 0] = np.arange(6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'], count)
+        count += 1
+
+    # many -> matching shape (straightforward copy)
+    sdt1 = [('a', 'O', (3, 2, 2))]
+    sdt2 = [('a', 'f4', (3, 2, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*3*2*2).reshape(6, 3, 2, 2)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'], a[count]['a'])
+        count += 1
+
+    # vector -> smaller vector (truncates)
+    sdt1 = [('a', 'f8', (6,))]
+    sdt2 = [('a', 'f4', (2,))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*6).reshape(6, 6)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'], a[count]['a'][:2])
+        count += 1
+
+    # vector -> bigger vector (pads with zeros)
+    sdt1 = [('a', 'f8', (2,))]
+    sdt2 = [('a', 'f4', (6,))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*2).reshape(6, 2)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'][:2], a[count]['a'])
+        assert_equal(x['a'][2:], [0, 0, 0, 0])
+        count += 1
+
+    # vector -> matrix (broadcasts)
+    sdt1 = [('a', 'f8', (2,))]
+    sdt2 = [('a', 'f4', (2, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*2).reshape(6, 2)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'][0], a[count]['a'])
+        assert_equal(x['a'][1], a[count]['a'])
+        count += 1
+
+    # vector -> matrix (broadcasts and zero-pads)
+    sdt1 = [('a', 'f8', (2, 1))]
+    sdt2 = [('a', 'f4', (3, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*2).reshape(6, 2, 1)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'][:2, 0], a[count]['a'][:, 0])
+        assert_equal(x['a'][:2, 1], a[count]['a'][:, 0])
+        assert_equal(x['a'][2,:], [0, 0])
+        count += 1
+
+    # matrix -> matrix (truncates and zero-pads)
+    sdt1 = [('a', 'f8', (2, 3))]
+    sdt2 = [('a', 'f4', (3, 2))]
+    a = np.zeros((6,), dtype=sdt1)
+    a['a'] = np.arange(6*2*3).reshape(6, 2, 3)
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe',
+                    op_dtypes=sdt2)
+    assert_equal(i[0].dtype, np.dtype(sdt2))
+    count = 0
+    for x in i:
+        assert_equal(x['a'][:2, 0], a[count]['a'][:, 0])
+        assert_equal(x['a'][:2, 1], a[count]['a'][:, 1])
+        assert_equal(x['a'][2,:], [0, 0])
+        count += 1
+
+def test_iter_buffering_badwriteback():
+    # Writing back from a buffer cannot combine elements
+
+    # a needs write buffering, but had a broadcast dimension
+    a = np.arange(6).reshape(2, 3, 1)
+    b = np.arange(12).reshape(2, 3, 2)
+    assert_raises(ValueError, nditer, [a, b],
+                  ['buffered', 'external_loop'],
+                  [['readwrite'], ['writeonly']],
+                  order='C')
+
+    # But if a is readonly, it's fine
+    nditer([a, b], ['buffered', 'external_loop'],
+           [['readonly'], ['writeonly']],
+           order='C')
+
+    # If a has just one element, it's fine too (constant 0 stride, a reduction)
+    a = np.arange(1).reshape(1, 1, 1)
+    nditer([a, b], ['buffered', 'external_loop', 'reduce_ok'],
+           [['readwrite'], ['writeonly']],
+           order='C')
+
+    # check that it fails on other dimensions too
+    a = np.arange(6).reshape(1, 3, 2)
+    assert_raises(ValueError, nditer, [a, b],
+                  ['buffered', 'external_loop'],
+                  [['readwrite'], ['writeonly']],
+                  order='C')
+    a = np.arange(4).reshape(2, 1, 2)
+    assert_raises(ValueError, nditer, [a, b],
+                  ['buffered', 'external_loop'],
+                  [['readwrite'], ['writeonly']],
+                  order='C')
+
+def test_iter_buffering_string():
+    # Safe casting disallows shrinking strings
+    a = np.array(['abc', 'a', 'abcd'], dtype=np.bytes_)
+    assert_equal(a.dtype, np.dtype('S4'))
+    assert_raises(TypeError, nditer, a, ['buffered'], ['readonly'],
+                  op_dtypes='S2')
+    i = nditer(a, ['buffered'], ['readonly'], op_dtypes='S6')
+    assert_equal(i[0], b'abc')
+    assert_equal(i[0].dtype, np.dtype('S6'))
+
+    a = np.array(['abc', 'a', 'abcd'], dtype=np.unicode_)
+    assert_equal(a.dtype, np.dtype('U4'))
+    assert_raises(TypeError, nditer, a, ['buffered'], ['readonly'],
+                    op_dtypes='U2')
+    i = nditer(a, ['buffered'], ['readonly'], op_dtypes='U6')
+    assert_equal(i[0], u'abc')
+    assert_equal(i[0].dtype, np.dtype('U6'))
+
+def test_iter_buffering_growinner():
+    # Test that the inner loop grows when no buffering is needed
+    a = np.arange(30)
+    i = nditer(a, ['buffered', 'growinner', 'external_loop'],
+                           buffersize=5)
+    # Should end up with just one inner loop here
+    assert_equal(i[0].size, a.size)
+
+
+@pytest.mark.slow
+def test_iter_buffered_reduce_reuse():
+    # large enough array for all views, including negative strides.
+    a = np.arange(2*3**5)[3**5:3**5+1]
+    flags = ['buffered', 'delay_bufalloc', 'multi_index', 'reduce_ok', 'refs_ok']
+    op_flags = [('readonly',), ('readwrite', 'allocate')]
+    op_axes_list = [[(0, 1, 2), (0, 1, -1)], [(0, 1, 2), (0, -1, -1)]]
+    # wrong dtype to force buffering
+    op_dtypes = [float, a.dtype]
+
+    def get_params():
+        for xs in range(-3**2, 3**2 + 1):
+            for ys in range(xs, 3**2 + 1):
+                for op_axes in op_axes_list:
+                    # last stride is reduced and because of that not
+                    # important for this test, as it is the inner stride.
+                    strides = (xs * a.itemsize, ys * a.itemsize, a.itemsize)
+                    arr = np.lib.stride_tricks.as_strided(a, (3, 3, 3), strides)
+
+                    for skip in [0, 1]:
+                        yield arr, op_axes, skip
+
+    for arr, op_axes, skip in get_params():
+        nditer2 = np.nditer([arr.copy(), None],
+                            op_axes=op_axes, flags=flags, op_flags=op_flags,
+                            op_dtypes=op_dtypes)
+        with nditer2:
+            nditer2.operands[-1][...] = 0
+            nditer2.reset()
+            nditer2.iterindex = skip
+
+            for (a2_in, b2_in) in nditer2:
+                b2_in += a2_in.astype(np.int_)
+
+            comp_res = nditer2.operands[-1]
+
+        for bufsize in range(0, 3**3):
+            nditer1 = np.nditer([arr, None],
+                                op_axes=op_axes, flags=flags, op_flags=op_flags,
+                                buffersize=bufsize, op_dtypes=op_dtypes)
+            with nditer1:
+                nditer1.operands[-1][...] = 0
+                nditer1.reset()
+                nditer1.iterindex = skip
+
+                for (a1_in, b1_in) in nditer1:
+                    b1_in += a1_in.astype(np.int_)
+
+                res = nditer1.operands[-1]
+            assert_array_equal(res, comp_res)
+
+
+def test_iter_no_broadcast():
+    # Test that the no_broadcast flag works
+    a = np.arange(24).reshape(2, 3, 4)
+    b = np.arange(6).reshape(2, 3, 1)
+    c = np.arange(12).reshape(3, 4)
+
+    nditer([a, b, c], [],
+           [['readonly', 'no_broadcast'],
+            ['readonly'], ['readonly']])
+    assert_raises(ValueError, nditer, [a, b, c], [],
+                  [['readonly'], ['readonly', 'no_broadcast'], ['readonly']])
+    assert_raises(ValueError, nditer, [a, b, c], [],
+                  [['readonly'], ['readonly'], ['readonly', 'no_broadcast']])
+
+
+class TestIterNested:
+
+    def test_basic(self):
+        # Test nested iteration basic usage
+        a = arange(12).reshape(2, 3, 2)
+
+        i, j = np.nested_iters(a, [[0], [1, 2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1, 2, 3, 4, 5], [6, 7, 8, 9, 10, 11]])
+
+        i, j = np.nested_iters(a, [[0, 1], [2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1], [2, 3], [4, 5], [6, 7], [8, 9], [10, 11]])
+
+        i, j = np.nested_iters(a, [[0, 2], [1]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 2, 4], [1, 3, 5], [6, 8, 10], [7, 9, 11]])
+
+    def test_reorder(self):
+        # Test nested iteration basic usage
+        a = arange(12).reshape(2, 3, 2)
+
+        # In 'K' order (default), it gets reordered
+        i, j = np.nested_iters(a, [[0], [2, 1]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1, 2, 3, 4, 5], [6, 7, 8, 9, 10, 11]])
+
+        i, j = np.nested_iters(a, [[1, 0], [2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1], [2, 3], [4, 5], [6, 7], [8, 9], [10, 11]])
+
+        i, j = np.nested_iters(a, [[2, 0], [1]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 2, 4], [1, 3, 5], [6, 8, 10], [7, 9, 11]])
+
+        # In 'C' order, it doesn't
+        i, j = np.nested_iters(a, [[0], [2, 1]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 2, 4, 1, 3, 5], [6, 8, 10, 7, 9, 11]])
+
+        i, j = np.nested_iters(a, [[1, 0], [2]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1], [6, 7], [2, 3], [8, 9], [4, 5], [10, 11]])
+
+        i, j = np.nested_iters(a, [[2, 0], [1]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 2, 4], [6, 8, 10], [1, 3, 5], [7, 9, 11]])
+
+    def test_flip_axes(self):
+        # Test nested iteration with negative axes
+        a = arange(12).reshape(2, 3, 2)[::-1, ::-1, ::-1]
+
+        # In 'K' order (default), the axes all get flipped
+        i, j = np.nested_iters(a, [[0], [1, 2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1, 2, 3, 4, 5], [6, 7, 8, 9, 10, 11]])
+
+        i, j = np.nested_iters(a, [[0, 1], [2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1], [2, 3], [4, 5], [6, 7], [8, 9], [10, 11]])
+
+        i, j = np.nested_iters(a, [[0, 2], [1]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 2, 4], [1, 3, 5], [6, 8, 10], [7, 9, 11]])
+
+        # In 'C' order, flipping axes is disabled
+        i, j = np.nested_iters(a, [[0], [1, 2]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[11, 10, 9, 8, 7, 6], [5, 4, 3, 2, 1, 0]])
+
+        i, j = np.nested_iters(a, [[0, 1], [2]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[11, 10], [9, 8], [7, 6], [5, 4], [3, 2], [1, 0]])
+
+        i, j = np.nested_iters(a, [[0, 2], [1]], order='C')
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[11, 9, 7], [10, 8, 6], [5, 3, 1], [4, 2, 0]])
+
+    def test_broadcast(self):
+        # Test nested iteration with broadcasting
+        a = arange(2).reshape(2, 1)
+        b = arange(3).reshape(1, 3)
+
+        i, j = np.nested_iters([a, b], [[0], [1]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[[0, 0], [0, 1], [0, 2]], [[1, 0], [1, 1], [1, 2]]])
+
+        i, j = np.nested_iters([a, b], [[1], [0]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[[0, 0], [1, 0]], [[0, 1], [1, 1]], [[0, 2], [1, 2]]])
+
+    def test_dtype_copy(self):
+        # Test nested iteration with a copy to change dtype
+
+        # copy
+        a = arange(6, dtype='i4').reshape(2, 3)
+        i, j = np.nested_iters(a, [[0], [1]],
+                            op_flags=['readonly', 'copy'],
+                            op_dtypes='f8')
+        assert_equal(j[0].dtype, np.dtype('f8'))
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1, 2], [3, 4, 5]])
+        vals = None
+
+        # writebackifcopy - using context manager
+        a = arange(6, dtype='f4').reshape(2, 3)
+        i, j = np.nested_iters(a, [[0], [1]],
+                            op_flags=['readwrite', 'updateifcopy'],
+                            casting='same_kind',
+                            op_dtypes='f8')
+        with i, j:
+            assert_equal(j[0].dtype, np.dtype('f8'))
+            for x in i:
+                for y in j:
+                    y[...] += 1
+            assert_equal(a, [[0, 1, 2], [3, 4, 5]])
+        assert_equal(a, [[1, 2, 3], [4, 5, 6]])
+
+        # writebackifcopy - using close()
+        a = arange(6, dtype='f4').reshape(2, 3)
+        i, j = np.nested_iters(a, [[0], [1]],
+                            op_flags=['readwrite', 'updateifcopy'],
+                            casting='same_kind',
+                            op_dtypes='f8')
+        assert_equal(j[0].dtype, np.dtype('f8'))
+        for x in i:
+            for y in j:
+                y[...] += 1
+        assert_equal(a, [[0, 1, 2], [3, 4, 5]])
+        i.close()
+        j.close()
+        assert_equal(a, [[1, 2, 3], [4, 5, 6]])
+
+    def test_dtype_buffered(self):
+        # Test nested iteration with buffering to change dtype
+
+        a = arange(6, dtype='f4').reshape(2, 3)
+        i, j = np.nested_iters(a, [[0], [1]],
+                            flags=['buffered'],
+                            op_flags=['readwrite'],
+                            casting='same_kind',
+                            op_dtypes='f8')
+        assert_equal(j[0].dtype, np.dtype('f8'))
+        for x in i:
+            for y in j:
+                y[...] += 1
+        assert_equal(a, [[1, 2, 3], [4, 5, 6]])
+
+    def test_0d(self):
+        a = np.arange(12).reshape(2, 3, 2)
+        i, j = np.nested_iters(a, [[], [1, 0, 2]])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]])
+
+        i, j = np.nested_iters(a, [[1, 0, 2], []])
+        vals = [list(j) for _ in i]
+        assert_equal(vals, [[0], [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11]])
+
+        i, j, k = np.nested_iters(a, [[2, 0], [], [1]])
+        vals = []
+        for x in i:
+            for y in j:
+                vals.append([z for z in k])
+        assert_equal(vals, [[0, 2, 4], [1, 3, 5], [6, 8, 10], [7, 9, 11]])
+
+    def test_iter_nested_iters_dtype_buffered(self):
+        # Test nested iteration with buffering to change dtype
+
+        a = arange(6, dtype='f4').reshape(2, 3)
+        i, j = np.nested_iters(a, [[0], [1]],
+                            flags=['buffered'],
+                            op_flags=['readwrite'],
+                            casting='same_kind',
+                            op_dtypes='f8')
+        with i, j:
+            assert_equal(j[0].dtype, np.dtype('f8'))
+            for x in i:
+                for y in j:
+                    y[...] += 1
+        assert_equal(a, [[1, 2, 3], [4, 5, 6]])
+
+def test_iter_reduction_error():
+
+    a = np.arange(6)
+    assert_raises(ValueError, nditer, [a, None], [],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[[0], [-1]])
+
+    a = np.arange(6).reshape(2, 3)
+    assert_raises(ValueError, nditer, [a, None], ['external_loop'],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[[0, 1], [-1, -1]])
+
+def test_iter_reduction():
+    # Test doing reductions with the iterator
+
+    a = np.arange(6)
+    i = nditer([a, None], ['reduce_ok'],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[[0], [-1]])
+    # Need to initialize the output operand to the addition unit
+    with i:
+        i.operands[1][...] = 0
+        # Do the reduction
+        for x, y in i:
+            y[...] += x
+        # Since no axes were specified, should have allocated a scalar
+        assert_equal(i.operands[1].ndim, 0)
+        assert_equal(i.operands[1], np.sum(a))
+
+    a = np.arange(6).reshape(2, 3)
+    i = nditer([a, None], ['reduce_ok', 'external_loop'],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[[0, 1], [-1, -1]])
+    # Need to initialize the output operand to the addition unit
+    with i:
+        i.operands[1][...] = 0
+        # Reduction shape/strides for the output
+        assert_equal(i[1].shape, (6,))
+        assert_equal(i[1].strides, (0,))
+        # Do the reduction
+        for x, y in i:
+            # Use a for loop instead of ``y[...] += x``
+            # (equivalent to ``y[...] = y[...].copy() + x``),
+            # because y has zero strides we use for the reduction
+            for j in range(len(y)):
+                y[j] += x[j]
+        # Since no axes were specified, should have allocated a scalar
+        assert_equal(i.operands[1].ndim, 0)
+        assert_equal(i.operands[1], np.sum(a))
+
+    # This is a tricky reduction case for the buffering double loop
+    # to handle
+    a = np.ones((2, 3, 5))
+    it1 = nditer([a, None], ['reduce_ok', 'external_loop'],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[None, [0, -1, 1]])
+    it2 = nditer([a, None], ['reduce_ok', 'external_loop',
+                            'buffered', 'delay_bufalloc'],
+                    [['readonly'], ['readwrite', 'allocate']],
+                    op_axes=[None, [0, -1, 1]], buffersize=10)
+    with it1, it2:
+        it1.operands[1].fill(0)
+        it2.operands[1].fill(0)
+        it2.reset()
+        for x in it1:
+            x[1][...] += x[0]
+        for x in it2:
+            x[1][...] += x[0]
+        assert_equal(it1.operands[1], it2.operands[1])
+        assert_equal(it2.operands[1].sum(), a.size)
+
+def test_iter_buffering_reduction():
+    # Test doing buffered reductions with the iterator
+
+    a = np.arange(6)
+    b = np.array(0., dtype='f8').byteswap().newbyteorder()
+    i = nditer([a, b], ['reduce_ok', 'buffered'],
+                    [['readonly'], ['readwrite', 'nbo']],
+                    op_axes=[[0], [-1]])
+    with i:
+        assert_equal(i[1].dtype, np.dtype('f8'))
+        assert_(i[1].dtype != b.dtype)
+        # Do the reduction
+        for x, y in i:
+            y[...] += x
+    # Since no axes were specified, should have allocated a scalar
+    assert_equal(b, np.sum(a))
+
+    a = np.arange(6).reshape(2, 3)
+    b = np.array([0, 0], dtype='f8').byteswap().newbyteorder()
+    i = nditer([a, b], ['reduce_ok', 'external_loop', 'buffered'],
+                    [['readonly'], ['readwrite', 'nbo']],
+                    op_axes=[[0, 1], [0, -1]])
+    # Reduction shape/strides for the output
+    with i:
+        assert_equal(i[1].shape, (3,))
+        assert_equal(i[1].strides, (0,))
+        # Do the reduction
+        for x, y in i:
+            # Use a for loop instead of ``y[...] += x``
+            # (equivalent to ``y[...] = y[...].copy() + x``),
+            # because y has zero strides we use for the reduction
+            for j in range(len(y)):
+                y[j] += x[j]
+    assert_equal(b, np.sum(a, axis=1))
+
+    # Iterator inner double loop was wrong on this one
+    p = np.arange(2) + 1
+    it = np.nditer([p, None],
+            ['delay_bufalloc', 'reduce_ok', 'buffered', 'external_loop'],
+            [['readonly'], ['readwrite', 'allocate']],
+            op_axes=[[-1, 0], [-1, -1]],
+            itershape=(2, 2))
+    with it:
+        it.operands[1].fill(0)
+        it.reset()
+        assert_equal(it[0], [1, 2, 1, 2])
+
+    # Iterator inner loop should take argument contiguity into account
+    x = np.ones((7, 13, 8), np.int8)[4:6,1:11:6,1:5].transpose(1, 2, 0)
+    x[...] = np.arange(x.size).reshape(x.shape)
+    y_base = np.arange(4*4, dtype=np.int8).reshape(4, 4)
+    y_base_copy = y_base.copy()
+    y = y_base[::2,:,None]
+
+    it = np.nditer([y, x],
+                   ['buffered', 'external_loop', 'reduce_ok'],
+                   [['readwrite'], ['readonly']])
+    with it:
+        for a, b in it:
+            a.fill(2)
+
+    assert_equal(y_base[1::2], y_base_copy[1::2])
+    assert_equal(y_base[::2], 2)
+
+def test_iter_buffering_reduction_reuse_reduce_loops():
+    # There was a bug triggering reuse of the reduce loop inappropriately,
+    # which caused processing to happen in unnecessarily small chunks
+    # and overran the buffer.
+
+    a = np.zeros((2, 7))
+    b = np.zeros((1, 7))
+    it = np.nditer([a, b], flags=['reduce_ok', 'external_loop', 'buffered'],
+                    op_flags=[['readonly'], ['readwrite']],
+                    buffersize=5)
+
+    with it:
+        bufsizes = [x.shape[0] for x, y in it]
+    assert_equal(bufsizes, [5, 2, 5, 2])
+    assert_equal(sum(bufsizes), a.size)
+
+def test_iter_writemasked_badinput():
+    a = np.zeros((2, 3))
+    b = np.zeros((3,))
+    m = np.array([[True, True, False], [False, True, False]])
+    m2 = np.array([True, True, False])
+    m3 = np.array([0, 1, 1], dtype='u1')
+    mbad1 = np.array([0, 1, 1], dtype='i1')
+    mbad2 = np.array([0, 1, 1], dtype='f4')
+
+    # Need an 'arraymask' if any operand is 'writemasked'
+    assert_raises(ValueError, nditer, [a, m], [],
+                    [['readwrite', 'writemasked'], ['readonly']])
+
+    # A 'writemasked' operand must not be readonly
+    assert_raises(ValueError, nditer, [a, m], [],
+                    [['readonly', 'writemasked'], ['readonly', 'arraymask']])
+
+    # 'writemasked' and 'arraymask' may not be used together
+    assert_raises(ValueError, nditer, [a, m], [],
+                    [['readonly'], ['readwrite', 'arraymask', 'writemasked']])
+
+    # 'arraymask' may only be specified once
+    assert_raises(ValueError, nditer, [a, m, m2], [],
+                    [['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask'],
+                     ['readonly', 'arraymask']])
+
+    # An 'arraymask' with nothing 'writemasked' also doesn't make sense
+    assert_raises(ValueError, nditer, [a, m], [],
+                    [['readwrite'], ['readonly', 'arraymask']])
+
+    # A writemasked reduction requires a similarly smaller mask
+    assert_raises(ValueError, nditer, [a, b, m], ['reduce_ok'],
+                    [['readonly'],
+                     ['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask']])
+    # But this should work with a smaller/equal mask to the reduction operand
+    np.nditer([a, b, m2], ['reduce_ok'],
+                    [['readonly'],
+                     ['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask']])
+    # The arraymask itself cannot be a reduction
+    assert_raises(ValueError, nditer, [a, b, m2], ['reduce_ok'],
+                    [['readonly'],
+                     ['readwrite', 'writemasked'],
+                     ['readwrite', 'arraymask']])
+
+    # A uint8 mask is ok too
+    np.nditer([a, m3], ['buffered'],
+                    [['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask']],
+                    op_dtypes=['f4', None],
+                    casting='same_kind')
+    # An int8 mask isn't ok
+    assert_raises(TypeError, np.nditer, [a, mbad1], ['buffered'],
+                    [['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask']],
+                    op_dtypes=['f4', None],
+                    casting='same_kind')
+    # A float32 mask isn't ok
+    assert_raises(TypeError, np.nditer, [a, mbad2], ['buffered'],
+                    [['readwrite', 'writemasked'],
+                     ['readonly', 'arraymask']],
+                    op_dtypes=['f4', None],
+                    casting='same_kind')
+
+def test_iter_writemasked():
+    a = np.zeros((3,), dtype='f8')
+    msk = np.array([True, True, False])
+
+    # When buffering is unused, 'writemasked' effectively does nothing.
+    # It's up to the user of the iterator to obey the requested semantics.
+    it = np.nditer([a, msk], [],
+                [['readwrite', 'writemasked'],
+                 ['readonly', 'arraymask']])
+    with it:
+        for x, m in it:
+            x[...] = 1
+    # Because we violated the semantics, all the values became 1
+    assert_equal(a, [1, 1, 1])
+
+    # Even if buffering is enabled, we still may be accessing the array
+    # directly.
+    it = np.nditer([a, msk], ['buffered'],
+                [['readwrite', 'writemasked'],
+                 ['readonly', 'arraymask']])
+    with it:
+        for x, m in it:
+            x[...] = 2.5
+    # Because we violated the semantics, all the values became 2.5
+    assert_equal(a, [2.5, 2.5, 2.5])
+
+    # If buffering will definitely happening, for instance because of
+    # a cast, only the items selected by the mask will be copied back from
+    # the buffer.
+    it = np.nditer([a, msk], ['buffered'],
+                [['readwrite', 'writemasked'],
+                 ['readonly', 'arraymask']],
+                op_dtypes=['i8', None],
+                casting='unsafe')
+    with it:
+        for x, m in it:
+            x[...] = 3
+    # Even though we violated the semantics, only the selected values
+    # were copied back
+    assert_equal(a, [3, 3, 2.5])
+
+def test_iter_non_writable_attribute_deletion():
+    it = np.nditer(np.ones(2))
+    attr = ["value", "shape", "operands", "itviews", "has_delayed_bufalloc",
+            "iterationneedsapi", "has_multi_index", "has_index", "dtypes",
+            "ndim", "nop", "itersize", "finished"]
+
+    for s in attr:
+        assert_raises(AttributeError, delattr, it, s)
+
+
+def test_iter_writable_attribute_deletion():
+    it = np.nditer(np.ones(2))
+    attr = [ "multi_index", "index", "iterrange", "iterindex"]
+    for s in attr:
+        assert_raises(AttributeError, delattr, it, s)
+
+
+def test_iter_element_deletion():
+    it = np.nditer(np.ones(3))
+    try:
+        del it[1]
+        del it[1:2]
+    except TypeError:
+        pass
+    except Exception:
+        raise AssertionError
+
+def test_iter_allocated_array_dtypes():
+    # If the dtype of an allocated output has a shape, the shape gets
+    # tacked onto the end of the result.
+    it = np.nditer(([1, 3, 20], None), op_dtypes=[None, ('i4', (2,))])
+    for a, b in it:
+        b[0] = a - 1
+        b[1] = a + 1
+    assert_equal(it.operands[1], [[0, 2], [2, 4], [19, 21]])
+
+    # Make sure this works for scalars too
+    it = np.nditer((10, 2, None), op_dtypes=[None, None, ('i4', (2, 2))])
+    for a, b, c in it:
+        c[0, 0] = a - b
+        c[0, 1] = a + b
+        c[1, 0] = a * b
+        c[1, 1] = a / b
+    assert_equal(it.operands[2], [[8, 12], [20, 5]])
+
+
+def test_0d_iter():
+    # Basic test for iteration of 0-d arrays:
+    i = nditer([2, 3], ['multi_index'], [['readonly']]*2)
+    assert_equal(i.ndim, 0)
+    assert_equal(next(i), (2, 3))
+    assert_equal(i.multi_index, ())
+    assert_equal(i.iterindex, 0)
+    assert_raises(StopIteration, next, i)
+    # test reset:
+    i.reset()
+    assert_equal(next(i), (2, 3))
+    assert_raises(StopIteration, next, i)
+
+    # test forcing to 0-d
+    i = nditer(np.arange(5), ['multi_index'], [['readonly']], op_axes=[()])
+    assert_equal(i.ndim, 0)
+    assert_equal(len(i), 1)
+
+    i = nditer(np.arange(5), ['multi_index'], [['readonly']],
+               op_axes=[()], itershape=())
+    assert_equal(i.ndim, 0)
+    assert_equal(len(i), 1)
+
+    # passing an itershape alone is not enough, the op_axes are also needed
+    with assert_raises(ValueError):
+        nditer(np.arange(5), ['multi_index'], [['readonly']], itershape=())
+
+    # Test a more complex buffered casting case (same as another test above)
+    sdt = [('a', 'f4'), ('b', 'i8'), ('c', 'c8', (2, 3)), ('d', 'O')]
+    a = np.array(0.5, dtype='f4')
+    i = nditer(a, ['buffered', 'refs_ok'], ['readonly'],
+                    casting='unsafe', op_dtypes=sdt)
+    vals = next(i)
+    assert_equal(vals['a'], 0.5)
+    assert_equal(vals['b'], 0)
+    assert_equal(vals['c'], [[(0.5)]*3]*2)
+    assert_equal(vals['d'], 0.5)
+
+
+def test_iter_too_large():
+    # The total size of the iterator must not exceed the maximum intp due
+    # to broadcasting. Dividing by 1024 will keep it small enough to
+    # give a legal array.
+    size = np.iinfo(np.intp).max // 1024
+    arr = np.lib.stride_tricks.as_strided(np.zeros(1), (size,), (0,))
+    assert_raises(ValueError, nditer, (arr, arr[:, None]))
+    # test the same for multiindex. That may get more interesting when
+    # removing 0 dimensional axis is allowed (since an iterator can grow then)
+    assert_raises(ValueError, nditer,
+                  (arr, arr[:, None]), flags=['multi_index'])
+
+
+def test_iter_too_large_with_multiindex():
+    # When a multi index is being tracked, the error is delayed this
+    # checks the delayed error messages and getting below that by
+    # removing an axis.
+    base_size = 2**10
+    num = 1
+    while base_size**num < np.iinfo(np.intp).max:
+        num += 1
+
+    shape_template = [1, 1] * num
+    arrays = []
+    for i in range(num):
+        shape = shape_template[:]
+        shape[i * 2] = 2**10
+        arrays.append(np.empty(shape))
+    arrays = tuple(arrays)
+
+    # arrays are now too large to be broadcast. The different modes test
+    # different nditer functionality with or without GIL.
+    for mode in range(6):
+        with assert_raises(ValueError):
+            _multiarray_tests.test_nditer_too_large(arrays, -1, mode)
+    # but if we do nothing with the nditer, it can be constructed:
+    _multiarray_tests.test_nditer_too_large(arrays, -1, 7)
+
+    # When an axis is removed, things should work again (half the time):
+    for i in range(num):
+        for mode in range(6):
+            # an axis with size 1024 is removed:
+            _multiarray_tests.test_nditer_too_large(arrays, i*2, mode)
+            # an axis with size 1 is removed:
+            with assert_raises(ValueError):
+                _multiarray_tests.test_nditer_too_large(arrays, i*2 + 1, mode)
+
+def test_writebacks():
+    a = np.arange(6, dtype='f4')
+    au = a.byteswap().newbyteorder()
+    assert_(a.dtype.byteorder != au.dtype.byteorder)
+    it = nditer(au, [], [['readwrite', 'updateifcopy']],
+                        casting='equiv', op_dtypes=[np.dtype('f4')])
+    with it:
+        it.operands[0][:] = 100
+    assert_equal(au, 100)
+    # do it again, this time raise an error,
+    it = nditer(au, [], [['readwrite', 'updateifcopy']],
+                        casting='equiv', op_dtypes=[np.dtype('f4')])
+    try:
+        with it:
+            assert_equal(au.flags.writeable, False)
+            it.operands[0][:] = 0
+            raise ValueError('exit context manager on exception')
+    except:
+        pass
+    assert_equal(au, 0)
+    assert_equal(au.flags.writeable, True)
+    # cannot reuse i outside context manager
+    assert_raises(ValueError, getattr, it, 'operands')
+
+    it = nditer(au, [], [['readwrite', 'updateifcopy']],
+                        casting='equiv', op_dtypes=[np.dtype('f4')])
+    with it:
+        x = it.operands[0]
+        x[:] = 6
+        assert_(x.flags.writebackifcopy)
+    assert_equal(au, 6)
+    assert_(not x.flags.writebackifcopy)
+    x[:] = 123 # x.data still valid
+    assert_equal(au, 6) # but not connected to au
+
+    it = nditer(au, [],
+                 [['readwrite', 'updateifcopy']],
+                 casting='equiv', op_dtypes=[np.dtype('f4')])
+    # reentering works
+    with it:
+        with it:
+            for x in it:
+                x[...] = 123
+
+    it = nditer(au, [],
+                 [['readwrite', 'updateifcopy']],
+                 casting='equiv', op_dtypes=[np.dtype('f4')])
+    # make sure exiting the inner context manager closes the iterator
+    with it:
+        with it:
+            for x in it:
+                x[...] = 123
+        assert_raises(ValueError, getattr, it, 'operands')
+    # do not crash if original data array is decrefed
+    it = nditer(au, [],
+                 [['readwrite', 'updateifcopy']],
+                 casting='equiv', op_dtypes=[np.dtype('f4')])
+    del au
+    with it:
+        for x in it:
+            x[...] = 123
+    # make sure we cannot reenter the closed iterator
+    enter = it.__enter__
+    assert_raises(RuntimeError, enter)
+
+def test_close_equivalent():
+    ''' using a context amanger and using nditer.close are equivalent
+    '''
+    def add_close(x, y, out=None):
+        addop = np.add
+        it = np.nditer([x, y, out], [],
+                    [['readonly'], ['readonly'], ['writeonly','allocate']])
+        for (a, b, c) in it:
+            addop(a, b, out=c)
+        ret = it.operands[2]
+        it.close()
+        return ret
+
+    def add_context(x, y, out=None):
+        addop = np.add
+        it = np.nditer([x, y, out], [],
+                    [['readonly'], ['readonly'], ['writeonly','allocate']])
+        with it:
+            for (a, b, c) in it:
+                addop(a, b, out=c)
+            return it.operands[2]
+    z = add_close(range(5), range(5))
+    assert_equal(z, range(0, 10, 2))
+    z = add_context(range(5), range(5))
+    assert_equal(z, range(0, 10, 2))
+
+def test_close_raises():
+    it = np.nditer(np.arange(3))
+    assert_equal (next(it), 0)
+    it.close()
+    assert_raises(StopIteration, next, it)
+    assert_raises(ValueError, getattr, it, 'operands')
+
+@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+def test_warn_noclose():
+    a = np.arange(6, dtype='f4')
+    au = a.byteswap().newbyteorder()
+    with suppress_warnings() as sup:
+        sup.record(RuntimeWarning)
+        it = np.nditer(au, [], [['readwrite', 'updateifcopy']],
+                        casting='equiv', op_dtypes=[np.dtype('f4')])
+        del it
+        assert len(sup.log) == 1
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_numeric.py b/venv/Lib/site-packages/numpy/core/tests/test_numeric.py
new file mode 100644
index 000000000..acd442e2f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_numeric.py
@@ -0,0 +1,3267 @@
+import sys
+import warnings
+import itertools
+import platform
+import pytest
+import math
+from decimal import Decimal
+
+import numpy as np
+from numpy.core import umath
+from numpy.random import rand, randint, randn
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_raises_regex,
+    assert_array_equal, assert_almost_equal, assert_array_almost_equal,
+    assert_warns, assert_array_max_ulp, HAS_REFCOUNT
+    )
+
+from hypothesis import assume, given, strategies as st
+from hypothesis.extra import numpy as hynp
+
+
+class TestResize:
+    def test_copies(self):
+        A = np.array([[1, 2], [3, 4]])
+        Ar1 = np.array([[1, 2, 3, 4], [1, 2, 3, 4]])
+        assert_equal(np.resize(A, (2, 4)), Ar1)
+
+        Ar2 = np.array([[1, 2], [3, 4], [1, 2], [3, 4]])
+        assert_equal(np.resize(A, (4, 2)), Ar2)
+
+        Ar3 = np.array([[1, 2, 3], [4, 1, 2], [3, 4, 1], [2, 3, 4]])
+        assert_equal(np.resize(A, (4, 3)), Ar3)
+
+    def test_zeroresize(self):
+        A = np.array([[1, 2], [3, 4]])
+        Ar = np.resize(A, (0,))
+        assert_array_equal(Ar, np.array([]))
+        assert_equal(A.dtype, Ar.dtype)
+
+        Ar = np.resize(A, (0, 2))
+        assert_equal(Ar.shape, (0, 2))
+
+        Ar = np.resize(A, (2, 0))
+        assert_equal(Ar.shape, (2, 0))
+
+    def test_reshape_from_zero(self):
+        # See also gh-6740
+        A = np.zeros(0, dtype=[('a', np.float32)])
+        Ar = np.resize(A, (2, 1))
+        assert_array_equal(Ar, np.zeros((2, 1), Ar.dtype))
+        assert_equal(A.dtype, Ar.dtype)
+
+
+class TestNonarrayArgs:
+    # check that non-array arguments to functions wrap them in arrays
+    def test_choose(self):
+        choices = [[0, 1, 2],
+                   [3, 4, 5],
+                   [5, 6, 7]]
+        tgt = [5, 1, 5]
+        a = [2, 0, 1]
+
+        out = np.choose(a, choices)
+        assert_equal(out, tgt)
+
+    def test_clip(self):
+        arr = [-1, 5, 2, 3, 10, -4, -9]
+        out = np.clip(arr, 2, 7)
+        tgt = [2, 5, 2, 3, 7, 2, 2]
+        assert_equal(out, tgt)
+
+    def test_compress(self):
+        arr = [[0, 1, 2, 3, 4],
+               [5, 6, 7, 8, 9]]
+        tgt = [[5, 6, 7, 8, 9]]
+        out = np.compress([0, 1], arr, axis=0)
+        assert_equal(out, tgt)
+
+    def test_count_nonzero(self):
+        arr = [[0, 1, 7, 0, 0],
+               [3, 0, 0, 2, 19]]
+        tgt = np.array([2, 3])
+        out = np.count_nonzero(arr, axis=1)
+        assert_equal(out, tgt)
+
+    def test_cumproduct(self):
+        A = [[1, 2, 3], [4, 5, 6]]
+        assert_(np.all(np.cumproduct(A) == np.array([1, 2, 6, 24, 120, 720])))
+
+    def test_diagonal(self):
+        a = [[0, 1, 2, 3],
+             [4, 5, 6, 7],
+             [8, 9, 10, 11]]
+        out = np.diagonal(a)
+        tgt = [0, 5, 10]
+
+        assert_equal(out, tgt)
+
+    def test_mean(self):
+        A = [[1, 2, 3], [4, 5, 6]]
+        assert_(np.mean(A) == 3.5)
+        assert_(np.all(np.mean(A, 0) == np.array([2.5, 3.5, 4.5])))
+        assert_(np.all(np.mean(A, 1) == np.array([2., 5.])))
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_(np.isnan(np.mean([])))
+            assert_(w[0].category is RuntimeWarning)
+
+    def test_ptp(self):
+        a = [3, 4, 5, 10, -3, -5, 6.0]
+        assert_equal(np.ptp(a, axis=0), 15.0)
+
+    def test_prod(self):
+        arr = [[1, 2, 3, 4],
+               [5, 6, 7, 9],
+               [10, 3, 4, 5]]
+        tgt = [24, 1890, 600]
+
+        assert_equal(np.prod(arr, axis=-1), tgt)
+
+    def test_ravel(self):
+        a = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
+        tgt = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
+        assert_equal(np.ravel(a), tgt)
+
+    def test_repeat(self):
+        a = [1, 2, 3]
+        tgt = [1, 1, 2, 2, 3, 3]
+
+        out = np.repeat(a, 2)
+        assert_equal(out, tgt)
+
+    def test_reshape(self):
+        arr = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
+        tgt = [[1, 2, 3, 4, 5, 6], [7, 8, 9, 10, 11, 12]]
+        assert_equal(np.reshape(arr, (2, 6)), tgt)
+
+    def test_round(self):
+        arr = [1.56, 72.54, 6.35, 3.25]
+        tgt = [1.6, 72.5, 6.4, 3.2]
+        assert_equal(np.around(arr, decimals=1), tgt)
+        s = np.float64(1.)
+        assert_(isinstance(s.round(), np.float64))
+        assert_equal(s.round(), 1.)
+
+    @pytest.mark.parametrize('dtype', [
+        np.int8, np.int16, np.int32, np.int64,
+        np.uint8, np.uint16, np.uint32, np.uint64,
+        np.float16, np.float32, np.float64,
+    ])
+    def test_dunder_round(self, dtype):
+        s = dtype(1)
+        assert_(isinstance(round(s), int))
+        assert_(isinstance(round(s, None), int))
+        assert_(isinstance(round(s, ndigits=None), int))
+        assert_equal(round(s), 1)
+        assert_equal(round(s, None), 1)
+        assert_equal(round(s, ndigits=None), 1)
+
+    @pytest.mark.parametrize('val, ndigits', [
+        pytest.param(2**31 - 1, -1,
+            marks=pytest.mark.xfail(reason="Out of range of int32")
+        ),
+        (2**31 - 1, 1-math.ceil(math.log10(2**31 - 1))),
+        (2**31 - 1, -math.ceil(math.log10(2**31 - 1)))
+    ])
+    def test_dunder_round_edgecases(self, val, ndigits):
+        assert_equal(round(val, ndigits), round(np.int32(val), ndigits))
+
+    def test_dunder_round_accuracy(self):
+        f = np.float64(5.1 * 10**73)
+        assert_(isinstance(round(f, -73), np.float64))
+        assert_array_max_ulp(round(f, -73), 5.0 * 10**73)
+        assert_(isinstance(round(f, ndigits=-73), np.float64))
+        assert_array_max_ulp(round(f, ndigits=-73), 5.0 * 10**73)
+
+        i = np.int64(501)
+        assert_(isinstance(round(i, -2), np.int64))
+        assert_array_max_ulp(round(i, -2), 500)
+        assert_(isinstance(round(i, ndigits=-2), np.int64))
+        assert_array_max_ulp(round(i, ndigits=-2), 500)
+
+    @pytest.mark.xfail(raises=AssertionError, reason="gh-15896")
+    def test_round_py_consistency(self):
+        f = 5.1 * 10**73
+        assert_equal(round(np.float64(f), -73), round(f, -73))
+
+    def test_searchsorted(self):
+        arr = [-8, -5, -1, 3, 6, 10]
+        out = np.searchsorted(arr, 0)
+        assert_equal(out, 3)
+
+    def test_size(self):
+        A = [[1, 2, 3], [4, 5, 6]]
+        assert_(np.size(A) == 6)
+        assert_(np.size(A, 0) == 2)
+        assert_(np.size(A, 1) == 3)
+
+    def test_squeeze(self):
+        A = [[[1, 1, 1], [2, 2, 2], [3, 3, 3]]]
+        assert_equal(np.squeeze(A).shape, (3, 3))
+        assert_equal(np.squeeze(np.zeros((1, 3, 1))).shape, (3,))
+        assert_equal(np.squeeze(np.zeros((1, 3, 1)), axis=0).shape, (3, 1))
+        assert_equal(np.squeeze(np.zeros((1, 3, 1)), axis=-1).shape, (1, 3))
+        assert_equal(np.squeeze(np.zeros((1, 3, 1)), axis=2).shape, (1, 3))
+        assert_equal(np.squeeze([np.zeros((3, 1))]).shape, (3,))
+        assert_equal(np.squeeze([np.zeros((3, 1))], axis=0).shape, (3, 1))
+        assert_equal(np.squeeze([np.zeros((3, 1))], axis=2).shape, (1, 3))
+        assert_equal(np.squeeze([np.zeros((3, 1))], axis=-1).shape, (1, 3))
+
+    def test_std(self):
+        A = [[1, 2, 3], [4, 5, 6]]
+        assert_almost_equal(np.std(A), 1.707825127659933)
+        assert_almost_equal(np.std(A, 0), np.array([1.5, 1.5, 1.5]))
+        assert_almost_equal(np.std(A, 1), np.array([0.81649658, 0.81649658]))
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_(np.isnan(np.std([])))
+            assert_(w[0].category is RuntimeWarning)
+
+    def test_swapaxes(self):
+        tgt = [[[0, 4], [2, 6]], [[1, 5], [3, 7]]]
+        a = [[[0, 1], [2, 3]], [[4, 5], [6, 7]]]
+        out = np.swapaxes(a, 0, 2)
+        assert_equal(out, tgt)
+
+    def test_sum(self):
+        m = [[1, 2, 3],
+             [4, 5, 6],
+             [7, 8, 9]]
+        tgt = [[6], [15], [24]]
+        out = np.sum(m, axis=1, keepdims=True)
+
+        assert_equal(tgt, out)
+
+    def test_take(self):
+        tgt = [2, 3, 5]
+        indices = [1, 2, 4]
+        a = [1, 2, 3, 4, 5]
+
+        out = np.take(a, indices)
+        assert_equal(out, tgt)
+
+    def test_trace(self):
+        c = [[1, 2], [3, 4], [5, 6]]
+        assert_equal(np.trace(c), 5)
+
+    def test_transpose(self):
+        arr = [[1, 2], [3, 4], [5, 6]]
+        tgt = [[1, 3, 5], [2, 4, 6]]
+        assert_equal(np.transpose(arr, (1, 0)), tgt)
+
+    def test_var(self):
+        A = [[1, 2, 3], [4, 5, 6]]
+        assert_almost_equal(np.var(A), 2.9166666666666665)
+        assert_almost_equal(np.var(A, 0), np.array([2.25, 2.25, 2.25]))
+        assert_almost_equal(np.var(A, 1), np.array([0.66666667, 0.66666667]))
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_(np.isnan(np.var([])))
+            assert_(w[0].category is RuntimeWarning)
+
+        B = np.array([None, 0])
+        B[0] = 1j
+        assert_almost_equal(np.var(B), 0.25)
+
+class TestIsscalar:
+    def test_isscalar(self):
+        assert_(np.isscalar(3.1))
+        assert_(np.isscalar(np.int16(12345)))
+        assert_(np.isscalar(False))
+        assert_(np.isscalar('numpy'))
+        assert_(not np.isscalar([3.1]))
+        assert_(not np.isscalar(None))
+
+        # PEP 3141
+        from fractions import Fraction
+        assert_(np.isscalar(Fraction(5, 17)))
+        from numbers import Number
+        assert_(np.isscalar(Number()))
+
+
+class TestBoolScalar:
+    def test_logical(self):
+        f = np.False_
+        t = np.True_
+        s = "xyz"
+        assert_((t and s) is s)
+        assert_((f and s) is f)
+
+    def test_bitwise_or(self):
+        f = np.False_
+        t = np.True_
+        assert_((t | t) is t)
+        assert_((f | t) is t)
+        assert_((t | f) is t)
+        assert_((f | f) is f)
+
+    def test_bitwise_and(self):
+        f = np.False_
+        t = np.True_
+        assert_((t & t) is t)
+        assert_((f & t) is f)
+        assert_((t & f) is f)
+        assert_((f & f) is f)
+
+    def test_bitwise_xor(self):
+        f = np.False_
+        t = np.True_
+        assert_((t ^ t) is f)
+        assert_((f ^ t) is t)
+        assert_((t ^ f) is t)
+        assert_((f ^ f) is f)
+
+
+class TestBoolArray:
+    def setup(self):
+        # offset for simd tests
+        self.t = np.array([True] * 41, dtype=bool)[1::]
+        self.f = np.array([False] * 41, dtype=bool)[1::]
+        self.o = np.array([False] * 42, dtype=bool)[2::]
+        self.nm = self.f.copy()
+        self.im = self.t.copy()
+        self.nm[3] = True
+        self.nm[-2] = True
+        self.im[3] = False
+        self.im[-2] = False
+
+    def test_all_any(self):
+        assert_(self.t.all())
+        assert_(self.t.any())
+        assert_(not self.f.all())
+        assert_(not self.f.any())
+        assert_(self.nm.any())
+        assert_(self.im.any())
+        assert_(not self.nm.all())
+        assert_(not self.im.all())
+        # check bad element in all positions
+        for i in range(256 - 7):
+            d = np.array([False] * 256, dtype=bool)[7::]
+            d[i] = True
+            assert_(np.any(d))
+            e = np.array([True] * 256, dtype=bool)[7::]
+            e[i] = False
+            assert_(not np.all(e))
+            assert_array_equal(e, ~d)
+        # big array test for blocked libc loops
+        for i in list(range(9, 6000, 507)) + [7764, 90021, -10]:
+            d = np.array([False] * 100043, dtype=bool)
+            d[i] = True
+            assert_(np.any(d), msg="%r" % i)
+            e = np.array([True] * 100043, dtype=bool)
+            e[i] = False
+            assert_(not np.all(e), msg="%r" % i)
+
+    def test_logical_not_abs(self):
+        assert_array_equal(~self.t, self.f)
+        assert_array_equal(np.abs(~self.t), self.f)
+        assert_array_equal(np.abs(~self.f), self.t)
+        assert_array_equal(np.abs(self.f), self.f)
+        assert_array_equal(~np.abs(self.f), self.t)
+        assert_array_equal(~np.abs(self.t), self.f)
+        assert_array_equal(np.abs(~self.nm), self.im)
+        np.logical_not(self.t, out=self.o)
+        assert_array_equal(self.o, self.f)
+        np.abs(self.t, out=self.o)
+        assert_array_equal(self.o, self.t)
+
+    def test_logical_and_or_xor(self):
+        assert_array_equal(self.t | self.t, self.t)
+        assert_array_equal(self.f | self.f, self.f)
+        assert_array_equal(self.t | self.f, self.t)
+        assert_array_equal(self.f | self.t, self.t)
+        np.logical_or(self.t, self.t, out=self.o)
+        assert_array_equal(self.o, self.t)
+        assert_array_equal(self.t & self.t, self.t)
+        assert_array_equal(self.f & self.f, self.f)
+        assert_array_equal(self.t & self.f, self.f)
+        assert_array_equal(self.f & self.t, self.f)
+        np.logical_and(self.t, self.t, out=self.o)
+        assert_array_equal(self.o, self.t)
+        assert_array_equal(self.t ^ self.t, self.f)
+        assert_array_equal(self.f ^ self.f, self.f)
+        assert_array_equal(self.t ^ self.f, self.t)
+        assert_array_equal(self.f ^ self.t, self.t)
+        np.logical_xor(self.t, self.t, out=self.o)
+        assert_array_equal(self.o, self.f)
+
+        assert_array_equal(self.nm & self.t, self.nm)
+        assert_array_equal(self.im & self.f, False)
+        assert_array_equal(self.nm & True, self.nm)
+        assert_array_equal(self.im & False, self.f)
+        assert_array_equal(self.nm | self.t, self.t)
+        assert_array_equal(self.im | self.f, self.im)
+        assert_array_equal(self.nm | True, self.t)
+        assert_array_equal(self.im | False, self.im)
+        assert_array_equal(self.nm ^ self.t, self.im)
+        assert_array_equal(self.im ^ self.f, self.im)
+        assert_array_equal(self.nm ^ True, self.im)
+        assert_array_equal(self.im ^ False, self.im)
+
+
+class TestBoolCmp:
+    def setup(self):
+        self.f = np.ones(256, dtype=np.float32)
+        self.ef = np.ones(self.f.size, dtype=bool)
+        self.d = np.ones(128, dtype=np.float64)
+        self.ed = np.ones(self.d.size, dtype=bool)
+        # generate values for all permutation of 256bit simd vectors
+        s = 0
+        for i in range(32):
+            self.f[s:s+8] = [i & 2**x for x in range(8)]
+            self.ef[s:s+8] = [(i & 2**x) != 0 for x in range(8)]
+            s += 8
+        s = 0
+        for i in range(16):
+            self.d[s:s+4] = [i & 2**x for x in range(4)]
+            self.ed[s:s+4] = [(i & 2**x) != 0 for x in range(4)]
+            s += 4
+
+        self.nf = self.f.copy()
+        self.nd = self.d.copy()
+        self.nf[self.ef] = np.nan
+        self.nd[self.ed] = np.nan
+
+        self.inff = self.f.copy()
+        self.infd = self.d.copy()
+        self.inff[::3][self.ef[::3]] = np.inf
+        self.infd[::3][self.ed[::3]] = np.inf
+        self.inff[1::3][self.ef[1::3]] = -np.inf
+        self.infd[1::3][self.ed[1::3]] = -np.inf
+        self.inff[2::3][self.ef[2::3]] = np.nan
+        self.infd[2::3][self.ed[2::3]] = np.nan
+        self.efnonan = self.ef.copy()
+        self.efnonan[2::3] = False
+        self.ednonan = self.ed.copy()
+        self.ednonan[2::3] = False
+
+        self.signf = self.f.copy()
+        self.signd = self.d.copy()
+        self.signf[self.ef] *= -1.
+        self.signd[self.ed] *= -1.
+        self.signf[1::6][self.ef[1::6]] = -np.inf
+        self.signd[1::6][self.ed[1::6]] = -np.inf
+        self.signf[3::6][self.ef[3::6]] = -np.nan
+        self.signd[3::6][self.ed[3::6]] = -np.nan
+        self.signf[4::6][self.ef[4::6]] = -0.
+        self.signd[4::6][self.ed[4::6]] = -0.
+
+    def test_float(self):
+        # offset for alignment test
+        for i in range(4):
+            assert_array_equal(self.f[i:] > 0, self.ef[i:])
+            assert_array_equal(self.f[i:] - 1 >= 0, self.ef[i:])
+            assert_array_equal(self.f[i:] == 0, ~self.ef[i:])
+            assert_array_equal(-self.f[i:] < 0, self.ef[i:])
+            assert_array_equal(-self.f[i:] + 1 <= 0, self.ef[i:])
+            r = self.f[i:] != 0
+            assert_array_equal(r, self.ef[i:])
+            r2 = self.f[i:] != np.zeros_like(self.f[i:])
+            r3 = 0 != self.f[i:]
+            assert_array_equal(r, r2)
+            assert_array_equal(r, r3)
+            # check bool == 0x1
+            assert_array_equal(r.view(np.int8), r.astype(np.int8))
+            assert_array_equal(r2.view(np.int8), r2.astype(np.int8))
+            assert_array_equal(r3.view(np.int8), r3.astype(np.int8))
+
+            # isnan on amd64 takes the same code path
+            assert_array_equal(np.isnan(self.nf[i:]), self.ef[i:])
+            assert_array_equal(np.isfinite(self.nf[i:]), ~self.ef[i:])
+            assert_array_equal(np.isfinite(self.inff[i:]), ~self.ef[i:])
+            assert_array_equal(np.isinf(self.inff[i:]), self.efnonan[i:])
+            assert_array_equal(np.signbit(self.signf[i:]), self.ef[i:])
+
+    def test_double(self):
+        # offset for alignment test
+        for i in range(2):
+            assert_array_equal(self.d[i:] > 0, self.ed[i:])
+            assert_array_equal(self.d[i:] - 1 >= 0, self.ed[i:])
+            assert_array_equal(self.d[i:] == 0, ~self.ed[i:])
+            assert_array_equal(-self.d[i:] < 0, self.ed[i:])
+            assert_array_equal(-self.d[i:] + 1 <= 0, self.ed[i:])
+            r = self.d[i:] != 0
+            assert_array_equal(r, self.ed[i:])
+            r2 = self.d[i:] != np.zeros_like(self.d[i:])
+            r3 = 0 != self.d[i:]
+            assert_array_equal(r, r2)
+            assert_array_equal(r, r3)
+            # check bool == 0x1
+            assert_array_equal(r.view(np.int8), r.astype(np.int8))
+            assert_array_equal(r2.view(np.int8), r2.astype(np.int8))
+            assert_array_equal(r3.view(np.int8), r3.astype(np.int8))
+
+            # isnan on amd64 takes the same code path
+            assert_array_equal(np.isnan(self.nd[i:]), self.ed[i:])
+            assert_array_equal(np.isfinite(self.nd[i:]), ~self.ed[i:])
+            assert_array_equal(np.isfinite(self.infd[i:]), ~self.ed[i:])
+            assert_array_equal(np.isinf(self.infd[i:]), self.ednonan[i:])
+            assert_array_equal(np.signbit(self.signd[i:]), self.ed[i:])
+
+
+class TestSeterr:
+    def test_default(self):
+        err = np.geterr()
+        assert_equal(err,
+                     dict(divide='warn',
+                          invalid='warn',
+                          over='warn',
+                          under='ignore')
+                     )
+
+    def test_set(self):
+        with np.errstate():
+            err = np.seterr()
+            old = np.seterr(divide='print')
+            assert_(err == old)
+            new = np.seterr()
+            assert_(new['divide'] == 'print')
+            np.seterr(over='raise')
+            assert_(np.geterr()['over'] == 'raise')
+            assert_(new['divide'] == 'print')
+            np.seterr(**old)
+            assert_(np.geterr() == old)
+
+    @pytest.mark.skipif(platform.machine() == "armv5tel", reason="See gh-413.")
+    def test_divide_err(self):
+        with np.errstate(divide='raise'):
+            with assert_raises(FloatingPointError):
+                np.array([1.]) / np.array([0.])
+
+            np.seterr(divide='ignore')
+            np.array([1.]) / np.array([0.])
+
+    def test_errobj(self):
+        olderrobj = np.geterrobj()
+        self.called = 0
+        try:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter("always")
+                with np.errstate(divide='warn'):
+                    np.seterrobj([20000, 1, None])
+                    np.array([1.]) / np.array([0.])
+                    assert_equal(len(w), 1)
+
+            def log_err(*args):
+                self.called += 1
+                extobj_err = args
+                assert_(len(extobj_err) == 2)
+                assert_("divide" in extobj_err[0])
+
+            with np.errstate(divide='ignore'):
+                np.seterrobj([20000, 3, log_err])
+                np.array([1.]) / np.array([0.])
+            assert_equal(self.called, 1)
+
+            np.seterrobj(olderrobj)
+            with np.errstate(divide='ignore'):
+                np.divide(1., 0., extobj=[20000, 3, log_err])
+            assert_equal(self.called, 2)
+        finally:
+            np.seterrobj(olderrobj)
+            del self.called
+
+    def test_errobj_noerrmask(self):
+        # errmask = 0 has a special code path for the default
+        olderrobj = np.geterrobj()
+        try:
+            # set errobj to something non default
+            np.seterrobj([umath.UFUNC_BUFSIZE_DEFAULT,
+                         umath.ERR_DEFAULT + 1, None])
+            # call a ufunc
+            np.isnan(np.array([6]))
+            # same with the default, lots of times to get rid of possible
+            # pre-existing stack in the code
+            for i in range(10000):
+                np.seterrobj([umath.UFUNC_BUFSIZE_DEFAULT, umath.ERR_DEFAULT,
+                             None])
+            np.isnan(np.array([6]))
+        finally:
+            np.seterrobj(olderrobj)
+
+
+class TestFloatExceptions:
+    def assert_raises_fpe(self, fpeerr, flop, x, y):
+        ftype = type(x)
+        try:
+            flop(x, y)
+            assert_(False,
+                    "Type %s did not raise fpe error '%s'." % (ftype, fpeerr))
+        except FloatingPointError as exc:
+            assert_(str(exc).find(fpeerr) >= 0,
+                    "Type %s raised wrong fpe error '%s'." % (ftype, exc))
+
+    def assert_op_raises_fpe(self, fpeerr, flop, sc1, sc2):
+        # Check that fpe exception is raised.
+        #
+        # Given a floating operation `flop` and two scalar values, check that
+        # the operation raises the floating point exception specified by
+        # `fpeerr`. Tests all variants with 0-d array scalars as well.
+
+        self.assert_raises_fpe(fpeerr, flop, sc1, sc2)
+        self.assert_raises_fpe(fpeerr, flop, sc1[()], sc2)
+        self.assert_raises_fpe(fpeerr, flop, sc1, sc2[()])
+        self.assert_raises_fpe(fpeerr, flop, sc1[()], sc2[()])
+
+    def test_floating_exceptions(self):
+        # Test basic arithmetic function errors
+        with np.errstate(all='raise'):
+            # Test for all real and complex float types
+            for typecode in np.typecodes['AllFloat']:
+                ftype = np.obj2sctype(typecode)
+                if np.dtype(ftype).kind == 'f':
+                    # Get some extreme values for the type
+                    fi = np.finfo(ftype)
+                    ft_tiny = fi.tiny
+                    ft_max = fi.max
+                    ft_eps = fi.eps
+                    underflow = 'underflow'
+                    divbyzero = 'divide by zero'
+                else:
+                    # 'c', complex, corresponding real dtype
+                    rtype = type(ftype(0).real)
+                    fi = np.finfo(rtype)
+                    ft_tiny = ftype(fi.tiny)
+                    ft_max = ftype(fi.max)
+                    ft_eps = ftype(fi.eps)
+                    # The complex types raise different exceptions
+                    underflow = ''
+                    divbyzero = ''
+                overflow = 'overflow'
+                invalid = 'invalid'
+
+                self.assert_raises_fpe(underflow,
+                                       lambda a, b: a/b, ft_tiny, ft_max)
+                self.assert_raises_fpe(underflow,
+                                       lambda a, b: a*b, ft_tiny, ft_tiny)
+                self.assert_raises_fpe(overflow,
+                                       lambda a, b: a*b, ft_max, ftype(2))
+                self.assert_raises_fpe(overflow,
+                                       lambda a, b: a/b, ft_max, ftype(0.5))
+                self.assert_raises_fpe(overflow,
+                                       lambda a, b: a+b, ft_max, ft_max*ft_eps)
+                self.assert_raises_fpe(overflow,
+                                       lambda a, b: a-b, -ft_max, ft_max*ft_eps)
+                self.assert_raises_fpe(overflow,
+                                       np.power, ftype(2), ftype(2**fi.nexp))
+                self.assert_raises_fpe(divbyzero,
+                                       lambda a, b: a/b, ftype(1), ftype(0))
+                self.assert_raises_fpe(invalid,
+                                       lambda a, b: a/b, ftype(np.inf), ftype(np.inf))
+                self.assert_raises_fpe(invalid,
+                                       lambda a, b: a/b, ftype(0), ftype(0))
+                self.assert_raises_fpe(invalid,
+                                       lambda a, b: a-b, ftype(np.inf), ftype(np.inf))
+                self.assert_raises_fpe(invalid,
+                                       lambda a, b: a+b, ftype(np.inf), ftype(-np.inf))
+                self.assert_raises_fpe(invalid,
+                                       lambda a, b: a*b, ftype(0), ftype(np.inf))
+
+    def test_warnings(self):
+        # test warning code path
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter("always")
+            with np.errstate(all="warn"):
+                np.divide(1, 0.)
+                assert_equal(len(w), 1)
+                assert_("divide by zero" in str(w[0].message))
+                np.array(1e300) * np.array(1e300)
+                assert_equal(len(w), 2)
+                assert_("overflow" in str(w[-1].message))
+                np.array(np.inf) - np.array(np.inf)
+                assert_equal(len(w), 3)
+                assert_("invalid value" in str(w[-1].message))
+                np.array(1e-300) * np.array(1e-300)
+                assert_equal(len(w), 4)
+                assert_("underflow" in str(w[-1].message))
+
+
+class TestTypes:
+    def check_promotion_cases(self, promote_func):
+        # tests that the scalars get coerced correctly.
+        b = np.bool_(0)
+        i8, i16, i32, i64 = np.int8(0), np.int16(0), np.int32(0), np.int64(0)
+        u8, u16, u32, u64 = np.uint8(0), np.uint16(0), np.uint32(0), np.uint64(0)
+        f32, f64, fld = np.float32(0), np.float64(0), np.longdouble(0)
+        c64, c128, cld = np.complex64(0), np.complex128(0), np.clongdouble(0)
+
+        # coercion within the same kind
+        assert_equal(promote_func(i8, i16), np.dtype(np.int16))
+        assert_equal(promote_func(i32, i8), np.dtype(np.int32))
+        assert_equal(promote_func(i16, i64), np.dtype(np.int64))
+        assert_equal(promote_func(u8, u32), np.dtype(np.uint32))
+        assert_equal(promote_func(f32, f64), np.dtype(np.float64))
+        assert_equal(promote_func(fld, f32), np.dtype(np.longdouble))
+        assert_equal(promote_func(f64, fld), np.dtype(np.longdouble))
+        assert_equal(promote_func(c128, c64), np.dtype(np.complex128))
+        assert_equal(promote_func(cld, c128), np.dtype(np.clongdouble))
+        assert_equal(promote_func(c64, fld), np.dtype(np.clongdouble))
+
+        # coercion between kinds
+        assert_equal(promote_func(b, i32), np.dtype(np.int32))
+        assert_equal(promote_func(b, u8), np.dtype(np.uint8))
+        assert_equal(promote_func(i8, u8), np.dtype(np.int16))
+        assert_equal(promote_func(u8, i32), np.dtype(np.int32))
+        assert_equal(promote_func(i64, u32), np.dtype(np.int64))
+        assert_equal(promote_func(u64, i32), np.dtype(np.float64))
+        assert_equal(promote_func(i32, f32), np.dtype(np.float64))
+        assert_equal(promote_func(i64, f32), np.dtype(np.float64))
+        assert_equal(promote_func(f32, i16), np.dtype(np.float32))
+        assert_equal(promote_func(f32, u32), np.dtype(np.float64))
+        assert_equal(promote_func(f32, c64), np.dtype(np.complex64))
+        assert_equal(promote_func(c128, f32), np.dtype(np.complex128))
+        assert_equal(promote_func(cld, f64), np.dtype(np.clongdouble))
+
+        # coercion between scalars and 1-D arrays
+        assert_equal(promote_func(np.array([b]), i8), np.dtype(np.int8))
+        assert_equal(promote_func(np.array([b]), u8), np.dtype(np.uint8))
+        assert_equal(promote_func(np.array([b]), i32), np.dtype(np.int32))
+        assert_equal(promote_func(np.array([b]), u32), np.dtype(np.uint32))
+        assert_equal(promote_func(np.array([i8]), i64), np.dtype(np.int8))
+        assert_equal(promote_func(u64, np.array([i32])), np.dtype(np.int32))
+        assert_equal(promote_func(i64, np.array([u32])), np.dtype(np.uint32))
+        assert_equal(promote_func(np.int32(-1), np.array([u64])),
+                     np.dtype(np.float64))
+        assert_equal(promote_func(f64, np.array([f32])), np.dtype(np.float32))
+        assert_equal(promote_func(fld, np.array([f32])), np.dtype(np.float32))
+        assert_equal(promote_func(np.array([f64]), fld), np.dtype(np.float64))
+        assert_equal(promote_func(fld, np.array([c64])),
+                     np.dtype(np.complex64))
+        assert_equal(promote_func(c64, np.array([f64])),
+                     np.dtype(np.complex128))
+        assert_equal(promote_func(np.complex64(3j), np.array([f64])),
+                     np.dtype(np.complex128))
+
+        # coercion between scalars and 1-D arrays, where
+        # the scalar has greater kind than the array
+        assert_equal(promote_func(np.array([b]), f64), np.dtype(np.float64))
+        assert_equal(promote_func(np.array([b]), i64), np.dtype(np.int64))
+        assert_equal(promote_func(np.array([b]), u64), np.dtype(np.uint64))
+        assert_equal(promote_func(np.array([i8]), f64), np.dtype(np.float64))
+        assert_equal(promote_func(np.array([u16]), f64), np.dtype(np.float64))
+
+        # uint and int are treated as the same "kind" for
+        # the purposes of array-scalar promotion.
+        assert_equal(promote_func(np.array([u16]), i32), np.dtype(np.uint16))
+
+        # float and complex are treated as the same "kind" for
+        # the purposes of array-scalar promotion, so that you can do
+        # (0j + float32array) to get a complex64 array instead of
+        # a complex128 array.
+        assert_equal(promote_func(np.array([f32]), c128),
+                     np.dtype(np.complex64))
+
+    def test_coercion(self):
+        def res_type(a, b):
+            return np.add(a, b).dtype
+
+        self.check_promotion_cases(res_type)
+
+        # Use-case: float/complex scalar * bool/int8 array
+        #           shouldn't narrow the float/complex type
+        for a in [np.array([True, False]), np.array([-3, 12], dtype=np.int8)]:
+            b = 1.234 * a
+            assert_equal(b.dtype, np.dtype('f8'), "array type %s" % a.dtype)
+            b = np.longdouble(1.234) * a
+            assert_equal(b.dtype, np.dtype(np.longdouble),
+                         "array type %s" % a.dtype)
+            b = np.float64(1.234) * a
+            assert_equal(b.dtype, np.dtype('f8'), "array type %s" % a.dtype)
+            b = np.float32(1.234) * a
+            assert_equal(b.dtype, np.dtype('f4'), "array type %s" % a.dtype)
+            b = np.float16(1.234) * a
+            assert_equal(b.dtype, np.dtype('f2'), "array type %s" % a.dtype)
+
+            b = 1.234j * a
+            assert_equal(b.dtype, np.dtype('c16'), "array type %s" % a.dtype)
+            b = np.clongdouble(1.234j) * a
+            assert_equal(b.dtype, np.dtype(np.clongdouble),
+                         "array type %s" % a.dtype)
+            b = np.complex128(1.234j) * a
+            assert_equal(b.dtype, np.dtype('c16'), "array type %s" % a.dtype)
+            b = np.complex64(1.234j) * a
+            assert_equal(b.dtype, np.dtype('c8'), "array type %s" % a.dtype)
+
+        # The following use-case is problematic, and to resolve its
+        # tricky side-effects requires more changes.
+        #
+        # Use-case: (1-t)*a, where 't' is a boolean array and 'a' is
+        #            a float32, shouldn't promote to float64
+        #
+        # a = np.array([1.0, 1.5], dtype=np.float32)
+        # t = np.array([True, False])
+        # b = t*a
+        # assert_equal(b, [1.0, 0.0])
+        # assert_equal(b.dtype, np.dtype('f4'))
+        # b = (1-t)*a
+        # assert_equal(b, [0.0, 1.5])
+        # assert_equal(b.dtype, np.dtype('f4'))
+        #
+        # Probably ~t (bitwise negation) is more proper to use here,
+        # but this is arguably less intuitive to understand at a glance, and
+        # would fail if 't' is actually an integer array instead of boolean:
+        #
+        # b = (~t)*a
+        # assert_equal(b, [0.0, 1.5])
+        # assert_equal(b.dtype, np.dtype('f4'))
+
+    def test_result_type(self):
+        self.check_promotion_cases(np.result_type)
+        assert_(np.result_type(None) == np.dtype(None))
+
+    def test_promote_types_endian(self):
+        # promote_types should always return native-endian types
+        assert_equal(np.promote_types('<i8', '<i8'), np.dtype('i8'))
+        assert_equal(np.promote_types('>i8', '>i8'), np.dtype('i8'))
+
+        assert_equal(np.promote_types('>i8', '>U16'), np.dtype('U21'))
+        assert_equal(np.promote_types('<i8', '<U16'), np.dtype('U21'))
+        assert_equal(np.promote_types('>U16', '>i8'), np.dtype('U21'))
+        assert_equal(np.promote_types('<U16', '<i8'), np.dtype('U21'))
+
+        assert_equal(np.promote_types('<S5', '<U8'), np.dtype('U8'))
+        assert_equal(np.promote_types('>S5', '>U8'), np.dtype('U8'))
+        assert_equal(np.promote_types('<U8', '<S5'), np.dtype('U8'))
+        assert_equal(np.promote_types('>U8', '>S5'), np.dtype('U8'))
+        assert_equal(np.promote_types('<U5', '<U8'), np.dtype('U8'))
+        assert_equal(np.promote_types('>U8', '>U5'), np.dtype('U8'))
+
+        assert_equal(np.promote_types('<M8', '<M8'), np.dtype('M8'))
+        assert_equal(np.promote_types('>M8', '>M8'), np.dtype('M8'))
+        assert_equal(np.promote_types('<m8', '<m8'), np.dtype('m8'))
+        assert_equal(np.promote_types('>m8', '>m8'), np.dtype('m8'))
+
+    def test_promote_types_strings(self):
+        assert_equal(np.promote_types('bool', 'S'), np.dtype('S5'))
+        assert_equal(np.promote_types('b', 'S'), np.dtype('S4'))
+        assert_equal(np.promote_types('u1', 'S'), np.dtype('S3'))
+        assert_equal(np.promote_types('u2', 'S'), np.dtype('S5'))
+        assert_equal(np.promote_types('u4', 'S'), np.dtype('S10'))
+        assert_equal(np.promote_types('u8', 'S'), np.dtype('S20'))
+        assert_equal(np.promote_types('i1', 'S'), np.dtype('S4'))
+        assert_equal(np.promote_types('i2', 'S'), np.dtype('S6'))
+        assert_equal(np.promote_types('i4', 'S'), np.dtype('S11'))
+        assert_equal(np.promote_types('i8', 'S'), np.dtype('S21'))
+        assert_equal(np.promote_types('bool', 'U'), np.dtype('U5'))
+        assert_equal(np.promote_types('b', 'U'), np.dtype('U4'))
+        assert_equal(np.promote_types('u1', 'U'), np.dtype('U3'))
+        assert_equal(np.promote_types('u2', 'U'), np.dtype('U5'))
+        assert_equal(np.promote_types('u4', 'U'), np.dtype('U10'))
+        assert_equal(np.promote_types('u8', 'U'), np.dtype('U20'))
+        assert_equal(np.promote_types('i1', 'U'), np.dtype('U4'))
+        assert_equal(np.promote_types('i2', 'U'), np.dtype('U6'))
+        assert_equal(np.promote_types('i4', 'U'), np.dtype('U11'))
+        assert_equal(np.promote_types('i8', 'U'), np.dtype('U21'))
+        assert_equal(np.promote_types('bool', 'S1'), np.dtype('S5'))
+        assert_equal(np.promote_types('bool', 'S30'), np.dtype('S30'))
+        assert_equal(np.promote_types('b', 'S1'), np.dtype('S4'))
+        assert_equal(np.promote_types('b', 'S30'), np.dtype('S30'))
+        assert_equal(np.promote_types('u1', 'S1'), np.dtype('S3'))
+        assert_equal(np.promote_types('u1', 'S30'), np.dtype('S30'))
+        assert_equal(np.promote_types('u2', 'S1'), np.dtype('S5'))
+        assert_equal(np.promote_types('u2', 'S30'), np.dtype('S30'))
+        assert_equal(np.promote_types('u4', 'S1'), np.dtype('S10'))
+        assert_equal(np.promote_types('u4', 'S30'), np.dtype('S30'))
+        assert_equal(np.promote_types('u8', 'S1'), np.dtype('S20'))
+        assert_equal(np.promote_types('u8', 'S30'), np.dtype('S30'))
+
+    def test_can_cast(self):
+        assert_(np.can_cast(np.int32, np.int64))
+        assert_(np.can_cast(np.float64, complex))
+        assert_(not np.can_cast(complex, float))
+
+        assert_(np.can_cast('i8', 'f8'))
+        assert_(not np.can_cast('i8', 'f4'))
+        assert_(np.can_cast('i4', 'S11'))
+
+        assert_(np.can_cast('i8', 'i8', 'no'))
+        assert_(not np.can_cast('<i8', '>i8', 'no'))
+
+        assert_(np.can_cast('<i8', '>i8', 'equiv'))
+        assert_(not np.can_cast('<i4', '>i8', 'equiv'))
+
+        assert_(np.can_cast('<i4', '>i8', 'safe'))
+        assert_(not np.can_cast('<i8', '>i4', 'safe'))
+
+        assert_(np.can_cast('<i8', '>i4', 'same_kind'))
+        assert_(not np.can_cast('<i8', '>u4', 'same_kind'))
+
+        assert_(np.can_cast('<i8', '>u4', 'unsafe'))
+
+        assert_(np.can_cast('bool', 'S5'))
+        assert_(not np.can_cast('bool', 'S4'))
+
+        assert_(np.can_cast('b', 'S4'))
+        assert_(not np.can_cast('b', 'S3'))
+
+        assert_(np.can_cast('u1', 'S3'))
+        assert_(not np.can_cast('u1', 'S2'))
+        assert_(np.can_cast('u2', 'S5'))
+        assert_(not np.can_cast('u2', 'S4'))
+        assert_(np.can_cast('u4', 'S10'))
+        assert_(not np.can_cast('u4', 'S9'))
+        assert_(np.can_cast('u8', 'S20'))
+        assert_(not np.can_cast('u8', 'S19'))
+
+        assert_(np.can_cast('i1', 'S4'))
+        assert_(not np.can_cast('i1', 'S3'))
+        assert_(np.can_cast('i2', 'S6'))
+        assert_(not np.can_cast('i2', 'S5'))
+        assert_(np.can_cast('i4', 'S11'))
+        assert_(not np.can_cast('i4', 'S10'))
+        assert_(np.can_cast('i8', 'S21'))
+        assert_(not np.can_cast('i8', 'S20'))
+
+        assert_(np.can_cast('bool', 'S5'))
+        assert_(not np.can_cast('bool', 'S4'))
+
+        assert_(np.can_cast('b', 'U4'))
+        assert_(not np.can_cast('b', 'U3'))
+
+        assert_(np.can_cast('u1', 'U3'))
+        assert_(not np.can_cast('u1', 'U2'))
+        assert_(np.can_cast('u2', 'U5'))
+        assert_(not np.can_cast('u2', 'U4'))
+        assert_(np.can_cast('u4', 'U10'))
+        assert_(not np.can_cast('u4', 'U9'))
+        assert_(np.can_cast('u8', 'U20'))
+        assert_(not np.can_cast('u8', 'U19'))
+
+        assert_(np.can_cast('i1', 'U4'))
+        assert_(not np.can_cast('i1', 'U3'))
+        assert_(np.can_cast('i2', 'U6'))
+        assert_(not np.can_cast('i2', 'U5'))
+        assert_(np.can_cast('i4', 'U11'))
+        assert_(not np.can_cast('i4', 'U10'))
+        assert_(np.can_cast('i8', 'U21'))
+        assert_(not np.can_cast('i8', 'U20'))
+
+        assert_raises(TypeError, np.can_cast, 'i4', None)
+        assert_raises(TypeError, np.can_cast, None, 'i4')
+
+        # Also test keyword arguments
+        assert_(np.can_cast(from_=np.int32, to=np.int64))
+
+    def test_can_cast_simple_to_structured(self):
+        # Non-structured can only be cast to structured in 'unsafe' mode.
+        assert_(not np.can_cast('i4', 'i4,i4'))
+        assert_(not np.can_cast('i4', 'i4,i2'))
+        assert_(np.can_cast('i4', 'i4,i4', casting='unsafe'))
+        assert_(np.can_cast('i4', 'i4,i2', casting='unsafe'))
+        # Even if there is just a single field which is OK.
+        assert_(not np.can_cast('i2', [('f1', 'i4')]))
+        assert_(not np.can_cast('i2', [('f1', 'i4')], casting='same_kind'))
+        assert_(np.can_cast('i2', [('f1', 'i4')], casting='unsafe'))
+        # It should be the same for recursive structured or subarrays.
+        assert_(not np.can_cast('i2', [('f1', 'i4,i4')]))
+        assert_(np.can_cast('i2', [('f1', 'i4,i4')], casting='unsafe'))
+        assert_(not np.can_cast('i2', [('f1', '(2,3)i4')]))
+        assert_(np.can_cast('i2', [('f1', '(2,3)i4')], casting='unsafe'))
+
+    def test_can_cast_structured_to_simple(self):
+        # Need unsafe casting for structured to simple.
+        assert_(not np.can_cast([('f1', 'i4')], 'i4'))
+        assert_(np.can_cast([('f1', 'i4')], 'i4', casting='unsafe'))
+        assert_(np.can_cast([('f1', 'i4')], 'i2', casting='unsafe'))
+        # Since it is unclear what is being cast, multiple fields to
+        # single should not work even for unsafe casting.
+        assert_(not np.can_cast('i4,i4', 'i4', casting='unsafe'))
+        # But a single field inside a single field is OK.
+        assert_(not np.can_cast([('f1', [('x', 'i4')])], 'i4'))
+        assert_(np.can_cast([('f1', [('x', 'i4')])], 'i4', casting='unsafe'))
+        # And a subarray is fine too - it will just take the first element
+        # (arguably not very consistently; might also take the first field).
+        assert_(not np.can_cast([('f0', '(3,)i4')], 'i4'))
+        assert_(np.can_cast([('f0', '(3,)i4')], 'i4', casting='unsafe'))
+        # But a structured subarray with multiple fields should fail.
+        assert_(not np.can_cast([('f0', ('i4,i4'), (2,))], 'i4',
+                                casting='unsafe'))
+
+    def test_can_cast_values(self):
+        # gh-5917
+        for dt in np.sctypes['int'] + np.sctypes['uint']:
+            ii = np.iinfo(dt)
+            assert_(np.can_cast(ii.min, dt))
+            assert_(np.can_cast(ii.max, dt))
+            assert_(not np.can_cast(ii.min - 1, dt))
+            assert_(not np.can_cast(ii.max + 1, dt))
+
+        for dt in np.sctypes['float']:
+            fi = np.finfo(dt)
+            assert_(np.can_cast(fi.min, dt))
+            assert_(np.can_cast(fi.max, dt))
+
+
+# Custom exception class to test exception propagation in fromiter
+class NIterError(Exception):
+    pass
+
+
+class TestFromiter:
+    def makegen(self):
+        return (x**2 for x in range(24))
+
+    def test_types(self):
+        ai32 = np.fromiter(self.makegen(), np.int32)
+        ai64 = np.fromiter(self.makegen(), np.int64)
+        af = np.fromiter(self.makegen(), float)
+        assert_(ai32.dtype == np.dtype(np.int32))
+        assert_(ai64.dtype == np.dtype(np.int64))
+        assert_(af.dtype == np.dtype(float))
+
+    def test_lengths(self):
+        expected = np.array(list(self.makegen()))
+        a = np.fromiter(self.makegen(), int)
+        a20 = np.fromiter(self.makegen(), int, 20)
+        assert_(len(a) == len(expected))
+        assert_(len(a20) == 20)
+        assert_raises(ValueError, np.fromiter,
+                          self.makegen(), int, len(expected) + 10)
+
+    def test_values(self):
+        expected = np.array(list(self.makegen()))
+        a = np.fromiter(self.makegen(), int)
+        a20 = np.fromiter(self.makegen(), int, 20)
+        assert_(np.alltrue(a == expected, axis=0))
+        assert_(np.alltrue(a20 == expected[:20], axis=0))
+
+    def load_data(self, n, eindex):
+        # Utility method for the issue 2592 tests.
+        # Raise an exception at the desired index in the iterator.
+        for e in range(n):
+            if e == eindex:
+                raise NIterError('error at index %s' % eindex)
+            yield e
+
+    def test_2592(self):
+        # Test iteration exceptions are correctly raised.
+        count, eindex = 10, 5
+        assert_raises(NIterError, np.fromiter,
+                          self.load_data(count, eindex), dtype=int, count=count)
+
+    def test_2592_edge(self):
+        # Test iter. exceptions, edge case (exception at end of iterator).
+        count = 10
+        eindex = count-1
+        assert_raises(NIterError, np.fromiter,
+                          self.load_data(count, eindex), dtype=int, count=count)
+
+
+class TestNonzero:
+    def test_nonzero_trivial(self):
+        assert_equal(np.count_nonzero(np.array([])), 0)
+        assert_equal(np.count_nonzero(np.array([], dtype='?')), 0)
+        assert_equal(np.nonzero(np.array([])), ([],))
+
+        assert_equal(np.count_nonzero(np.array([0])), 0)
+        assert_equal(np.count_nonzero(np.array([0], dtype='?')), 0)
+        assert_equal(np.nonzero(np.array([0])), ([],))
+
+        assert_equal(np.count_nonzero(np.array([1])), 1)
+        assert_equal(np.count_nonzero(np.array([1], dtype='?')), 1)
+        assert_equal(np.nonzero(np.array([1])), ([0],))
+
+    def test_nonzero_zerod(self):
+        assert_equal(np.count_nonzero(np.array(0)), 0)
+        assert_equal(np.count_nonzero(np.array(0, dtype='?')), 0)
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.nonzero(np.array(0)), ([],))
+
+        assert_equal(np.count_nonzero(np.array(1)), 1)
+        assert_equal(np.count_nonzero(np.array(1, dtype='?')), 1)
+        with assert_warns(DeprecationWarning):
+            assert_equal(np.nonzero(np.array(1)), ([0],))
+
+    def test_nonzero_onedim(self):
+        x = np.array([1, 0, 2, -1, 0, 0, 8])
+        assert_equal(np.count_nonzero(x), 4)
+        assert_equal(np.count_nonzero(x), 4)
+        assert_equal(np.nonzero(x), ([0, 2, 3, 6],))
+
+        x = np.array([(1, 2), (0, 0), (1, 1), (-1, 3), (0, 7)],
+                     dtype=[('a', 'i4'), ('b', 'i2')])
+        assert_equal(np.count_nonzero(x['a']), 3)
+        assert_equal(np.count_nonzero(x['b']), 4)
+        assert_equal(np.nonzero(x['a']), ([0, 2, 3],))
+        assert_equal(np.nonzero(x['b']), ([0, 2, 3, 4],))
+
+    def test_nonzero_twodim(self):
+        x = np.array([[0, 1, 0], [2, 0, 3]])
+        assert_equal(np.count_nonzero(x), 3)
+        assert_equal(np.nonzero(x), ([0, 1, 1], [1, 0, 2]))
+
+        x = np.eye(3)
+        assert_equal(np.count_nonzero(x), 3)
+        assert_equal(np.nonzero(x), ([0, 1, 2], [0, 1, 2]))
+
+        x = np.array([[(0, 1), (0, 0), (1, 11)],
+                   [(1, 1), (1, 0), (0, 0)],
+                   [(0, 0), (1, 5), (0, 1)]], dtype=[('a', 'f4'), ('b', 'u1')])
+        assert_equal(np.count_nonzero(x['a']), 4)
+        assert_equal(np.count_nonzero(x['b']), 5)
+        assert_equal(np.nonzero(x['a']), ([0, 1, 1, 2], [2, 0, 1, 1]))
+        assert_equal(np.nonzero(x['b']), ([0, 0, 1, 2, 2], [0, 2, 0, 1, 2]))
+
+        assert_(not x['a'].T.flags.aligned)
+        assert_equal(np.count_nonzero(x['a'].T), 4)
+        assert_equal(np.count_nonzero(x['b'].T), 5)
+        assert_equal(np.nonzero(x['a'].T), ([0, 1, 1, 2], [1, 1, 2, 0]))
+        assert_equal(np.nonzero(x['b'].T), ([0, 0, 1, 2, 2], [0, 1, 2, 0, 2]))
+
+    def test_sparse(self):
+        # test special sparse condition boolean code path
+        for i in range(20):
+            c = np.zeros(200, dtype=bool)
+            c[i::20] = True
+            assert_equal(np.nonzero(c)[0], np.arange(i, 200 + i, 20))
+
+            c = np.zeros(400, dtype=bool)
+            c[10 + i:20 + i] = True
+            c[20 + i*2] = True
+            assert_equal(np.nonzero(c)[0],
+                         np.concatenate((np.arange(10 + i, 20 + i), [20 + i*2])))
+
+    def test_return_type(self):
+        class C(np.ndarray):
+            pass
+
+        for view in (C, np.ndarray):
+            for nd in range(1, 4):
+                shape = tuple(range(2, 2+nd))
+                x = np.arange(np.prod(shape)).reshape(shape).view(view)
+                for nzx in (np.nonzero(x), x.nonzero()):
+                    for nzx_i in nzx:
+                        assert_(type(nzx_i) is np.ndarray)
+                        assert_(nzx_i.flags.writeable)
+
+    def test_count_nonzero_axis(self):
+        # Basic check of functionality
+        m = np.array([[0, 1, 7, 0, 0], [3, 0, 0, 2, 19]])
+
+        expected = np.array([1, 1, 1, 1, 1])
+        assert_equal(np.count_nonzero(m, axis=0), expected)
+
+        expected = np.array([2, 3])
+        assert_equal(np.count_nonzero(m, axis=1), expected)
+
+        assert_raises(ValueError, np.count_nonzero, m, axis=(1, 1))
+        assert_raises(TypeError, np.count_nonzero, m, axis='foo')
+        assert_raises(np.AxisError, np.count_nonzero, m, axis=3)
+        assert_raises(TypeError, np.count_nonzero,
+                      m, axis=np.array([[1], [2]]))
+
+    def test_count_nonzero_axis_all_dtypes(self):
+        # More thorough test that the axis argument is respected
+        # for all dtypes and responds correctly when presented with
+        # either integer or tuple arguments for axis
+        msg = "Mismatch for dtype: %s"
+
+        def assert_equal_w_dt(a, b, err_msg):
+            assert_equal(a.dtype, b.dtype, err_msg=err_msg)
+            assert_equal(a, b, err_msg=err_msg)
+
+        for dt in np.typecodes['All']:
+            err_msg = msg % (np.dtype(dt).name,)
+
+            if dt != 'V':
+                if dt != 'M':
+                    m = np.zeros((3, 3), dtype=dt)
+                    n = np.ones(1, dtype=dt)
+
+                    m[0, 0] = n[0]
+                    m[1, 0] = n[0]
+
+                else:  # np.zeros doesn't work for np.datetime64
+                    m = np.array(['1970-01-01'] * 9)
+                    m = m.reshape((3, 3))
+
+                    m[0, 0] = '1970-01-12'
+                    m[1, 0] = '1970-01-12'
+                    m = m.astype(dt)
+
+                expected = np.array([2, 0, 0], dtype=np.intp)
+                assert_equal_w_dt(np.count_nonzero(m, axis=0),
+                                  expected, err_msg=err_msg)
+
+                expected = np.array([1, 1, 0], dtype=np.intp)
+                assert_equal_w_dt(np.count_nonzero(m, axis=1),
+                                  expected, err_msg=err_msg)
+
+                expected = np.array(2)
+                assert_equal(np.count_nonzero(m, axis=(0, 1)),
+                             expected, err_msg=err_msg)
+                assert_equal(np.count_nonzero(m, axis=None),
+                             expected, err_msg=err_msg)
+                assert_equal(np.count_nonzero(m),
+                             expected, err_msg=err_msg)
+
+            if dt == 'V':
+                # There are no 'nonzero' objects for np.void, so the testing
+                # setup is slightly different for this dtype
+                m = np.array([np.void(1)] * 6).reshape((2, 3))
+
+                expected = np.array([0, 0, 0], dtype=np.intp)
+                assert_equal_w_dt(np.count_nonzero(m, axis=0),
+                                  expected, err_msg=err_msg)
+
+                expected = np.array([0, 0], dtype=np.intp)
+                assert_equal_w_dt(np.count_nonzero(m, axis=1),
+                                  expected, err_msg=err_msg)
+
+                expected = np.array(0)
+                assert_equal(np.count_nonzero(m, axis=(0, 1)),
+                             expected, err_msg=err_msg)
+                assert_equal(np.count_nonzero(m, axis=None),
+                             expected, err_msg=err_msg)
+                assert_equal(np.count_nonzero(m),
+                             expected, err_msg=err_msg)
+
+    def test_count_nonzero_axis_consistent(self):
+        # Check that the axis behaviour for valid axes in
+        # non-special cases is consistent (and therefore
+        # correct) by checking it against an integer array
+        # that is then casted to the generic object dtype
+        from itertools import combinations, permutations
+
+        axis = (0, 1, 2, 3)
+        size = (5, 5, 5, 5)
+        msg = "Mismatch for axis: %s"
+
+        rng = np.random.RandomState(1234)
+        m = rng.randint(-100, 100, size=size)
+        n = m.astype(object)
+
+        for length in range(len(axis)):
+            for combo in combinations(axis, length):
+                for perm in permutations(combo):
+                    assert_equal(
+                        np.count_nonzero(m, axis=perm),
+                        np.count_nonzero(n, axis=perm),
+                        err_msg=msg % (perm,))
+
+    def test_countnonzero_axis_empty(self):
+        a = np.array([[0, 0, 1], [1, 0, 1]])
+        assert_equal(np.count_nonzero(a, axis=()), a.astype(bool))
+
+    def test_countnonzero_keepdims(self):
+        a = np.array([[0, 0, 1, 0],
+                      [0, 3, 5, 0],
+                      [7, 9, 2, 0]])
+        assert_equal(np.count_nonzero(a, axis=0, keepdims=True),
+                     [[1, 2, 3, 0]])
+        assert_equal(np.count_nonzero(a, axis=1, keepdims=True),
+                     [[1], [2], [3]])
+        assert_equal(np.count_nonzero(a, keepdims=True),
+                     [[6]])
+
+    def test_array_method(self):
+        # Tests that the array method
+        # call to nonzero works
+        m = np.array([[1, 0, 0], [4, 0, 6]])
+        tgt = [[0, 1, 1], [0, 0, 2]]
+
+        assert_equal(m.nonzero(), tgt)
+
+    def test_nonzero_invalid_object(self):
+        # gh-9295
+        a = np.array([np.array([1, 2]), 3], dtype=object)
+        assert_raises(ValueError, np.nonzero, a)
+
+        class BoolErrors:
+            def __bool__(self):
+                raise ValueError("Not allowed")
+
+        assert_raises(ValueError, np.nonzero, np.array([BoolErrors()]))
+
+    def test_nonzero_sideeffect_safety(self):
+        # gh-13631
+        class FalseThenTrue:
+            _val = False
+            def __bool__(self):
+                try:
+                    return self._val
+                finally:
+                    self._val = True
+
+        class TrueThenFalse:
+            _val = True
+            def __bool__(self):
+                try:
+                    return self._val
+                finally:
+                    self._val = False
+
+        # result grows on the second pass
+        a = np.array([True, FalseThenTrue()])
+        assert_raises(RuntimeError, np.nonzero, a)
+
+        a = np.array([[True], [FalseThenTrue()]])
+        assert_raises(RuntimeError, np.nonzero, a)
+
+        # result shrinks on the second pass
+        a = np.array([False, TrueThenFalse()])
+        assert_raises(RuntimeError, np.nonzero, a)
+
+        a = np.array([[False], [TrueThenFalse()]])
+        assert_raises(RuntimeError, np.nonzero, a)
+
+    def test_nonzero_exception_safe(self):
+        # gh-13930
+
+        class ThrowsAfter:
+            def __init__(self, iters):
+                self.iters_left = iters
+
+            def __bool__(self):
+                if self.iters_left == 0:
+                    raise ValueError("called `iters` times")
+
+                self.iters_left -= 1
+                return True
+
+        """
+        Test that a ValueError is raised instead of a SystemError
+
+        If the __bool__ function is called after the error state is set,
+        Python (cpython) will raise a SystemError.
+        """
+
+        # assert that an exception in first pass is handled correctly
+        a = np.array([ThrowsAfter(5)]*10)
+        assert_raises(ValueError, np.nonzero, a)
+
+        # raise exception in second pass for 1-dimensional loop
+        a = np.array([ThrowsAfter(15)]*10)
+        assert_raises(ValueError, np.nonzero, a)
+
+        # raise exception in second pass for n-dimensional loop
+        a = np.array([[ThrowsAfter(15)]]*10)
+        assert_raises(ValueError, np.nonzero, a)
+
+
+class TestIndex:
+    def test_boolean(self):
+        a = rand(3, 5, 8)
+        V = rand(5, 8)
+        g1 = randint(0, 5, size=15)
+        g2 = randint(0, 8, size=15)
+        V[g1, g2] = -V[g1, g2]
+        assert_((np.array([a[0][V > 0], a[1][V > 0], a[2][V > 0]]) == a[:, V > 0]).all())
+
+    def test_boolean_edgecase(self):
+        a = np.array([], dtype='int32')
+        b = np.array([], dtype='bool')
+        c = a[b]
+        assert_equal(c, [])
+        assert_equal(c.dtype, np.dtype('int32'))
+
+
+class TestBinaryRepr:
+    def test_zero(self):
+        assert_equal(np.binary_repr(0), '0')
+
+    def test_positive(self):
+        assert_equal(np.binary_repr(10), '1010')
+        assert_equal(np.binary_repr(12522),
+                     '11000011101010')
+        assert_equal(np.binary_repr(10736848),
+                     '101000111101010011010000')
+
+    def test_negative(self):
+        assert_equal(np.binary_repr(-1), '-1')
+        assert_equal(np.binary_repr(-10), '-1010')
+        assert_equal(np.binary_repr(-12522),
+                     '-11000011101010')
+        assert_equal(np.binary_repr(-10736848),
+                     '-101000111101010011010000')
+
+    def test_sufficient_width(self):
+        assert_equal(np.binary_repr(0, width=5), '00000')
+        assert_equal(np.binary_repr(10, width=7), '0001010')
+        assert_equal(np.binary_repr(-5, width=7), '1111011')
+
+    def test_neg_width_boundaries(self):
+        # see gh-8670
+
+        # Ensure that the example in the issue does not
+        # break before proceeding to a more thorough test.
+        assert_equal(np.binary_repr(-128, width=8), '10000000')
+
+        for width in range(1, 11):
+            num = -2**(width - 1)
+            exp = '1' + (width - 1) * '0'
+            assert_equal(np.binary_repr(num, width=width), exp)
+
+    def test_large_neg_int64(self):
+        # See gh-14289.
+        assert_equal(np.binary_repr(np.int64(-2**62), width=64),
+                     '11' + '0'*62)
+
+
+class TestBaseRepr:
+    def test_base3(self):
+        assert_equal(np.base_repr(3**5, 3), '100000')
+
+    def test_positive(self):
+        assert_equal(np.base_repr(12, 10), '12')
+        assert_equal(np.base_repr(12, 10, 4), '000012')
+        assert_equal(np.base_repr(12, 4), '30')
+        assert_equal(np.base_repr(3731624803700888, 36), '10QR0ROFCEW')
+
+    def test_negative(self):
+        assert_equal(np.base_repr(-12, 10), '-12')
+        assert_equal(np.base_repr(-12, 10, 4), '-000012')
+        assert_equal(np.base_repr(-12, 4), '-30')
+
+    def test_base_range(self):
+        with assert_raises(ValueError):
+            np.base_repr(1, 1)
+        with assert_raises(ValueError):
+            np.base_repr(1, 37)
+
+
+class TestArrayComparisons:
+    def test_array_equal(self):
+        res = np.array_equal(np.array([1, 2]), np.array([1, 2]))
+        assert_(res)
+        assert_(type(res) is bool)
+        res = np.array_equal(np.array([1, 2]), np.array([1, 2, 3]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equal(np.array([1, 2]), np.array([3, 4]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equal(np.array([1, 2]), np.array([1, 3]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equal(np.array(['a'], dtype='S1'), np.array(['a'], dtype='S1'))
+        assert_(res)
+        assert_(type(res) is bool)
+        res = np.array_equal(np.array([('a', 1)], dtype='S1,u4'),
+                             np.array([('a', 1)], dtype='S1,u4'))
+        assert_(res)
+        assert_(type(res) is bool)
+
+    def test_array_equal_equal_nan(self):
+        # Test array_equal with equal_nan kwarg
+        a1 = np.array([1, 2, np.nan])
+        a2 = np.array([1, np.nan, 2])
+        a3 = np.array([1, 2, np.inf])
+
+        # equal_nan=False by default
+        assert_(not np.array_equal(a1, a1))
+        assert_(np.array_equal(a1, a1, equal_nan=True))
+        assert_(not np.array_equal(a1, a2, equal_nan=True))
+        # nan's not conflated with inf's
+        assert_(not np.array_equal(a1, a3, equal_nan=True))
+        # 0-D arrays
+        a = np.array(np.nan)
+        assert_(not np.array_equal(a, a))
+        assert_(np.array_equal(a, a, equal_nan=True))
+        # Non-float dtype - equal_nan should have no effect
+        a = np.array([1, 2, 3], dtype=int)
+        assert_(np.array_equal(a, a))
+        assert_(np.array_equal(a, a, equal_nan=True))
+        # Multi-dimensional array
+        a = np.array([[0, 1], [np.nan, 1]])
+        assert_(not np.array_equal(a, a))
+        assert_(np.array_equal(a, a, equal_nan=True))
+        # Complex values
+        a, b = [np.array([1 + 1j])]*2
+        a.real, b.imag = np.nan, np.nan
+        assert_(not np.array_equal(a, b, equal_nan=False))
+        assert_(np.array_equal(a, b, equal_nan=True))
+
+    def test_none_compares_elementwise(self):
+        a = np.array([None, 1, None], dtype=object)
+        assert_equal(a == None, [True, False, True])
+        assert_equal(a != None, [False, True, False])
+
+        a = np.ones(3)
+        assert_equal(a == None, [False, False, False])
+        assert_equal(a != None, [True, True, True])
+
+    def test_array_equiv(self):
+        res = np.array_equiv(np.array([1, 2]), np.array([1, 2]))
+        assert_(res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([1, 2, 3]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([3, 4]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([1, 3]))
+        assert_(not res)
+        assert_(type(res) is bool)
+
+        res = np.array_equiv(np.array([1, 1]), np.array([1]))
+        assert_(res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 1]), np.array([[1], [1]]))
+        assert_(res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([2]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([[1], [2]]))
+        assert_(not res)
+        assert_(type(res) is bool)
+        res = np.array_equiv(np.array([1, 2]), np.array([[1, 2, 3], [4, 5, 6], [7, 8, 9]]))
+        assert_(not res)
+        assert_(type(res) is bool)
+
+
+def assert_array_strict_equal(x, y):
+    assert_array_equal(x, y)
+    # Check flags, 32 bit arches typically don't provide 16 byte alignment
+    if ((x.dtype.alignment <= 8 or
+            np.intp().dtype.itemsize != 4) and
+            sys.platform != 'win32'):
+        assert_(x.flags == y.flags)
+    else:
+        assert_(x.flags.owndata == y.flags.owndata)
+        assert_(x.flags.writeable == y.flags.writeable)
+        assert_(x.flags.c_contiguous == y.flags.c_contiguous)
+        assert_(x.flags.f_contiguous == y.flags.f_contiguous)
+        assert_(x.flags.writebackifcopy == y.flags.writebackifcopy)
+    # check endianness
+    assert_(x.dtype.isnative == y.dtype.isnative)
+
+
+class TestClip:
+    def setup(self):
+        self.nr = 5
+        self.nc = 3
+
+    def fastclip(self, a, m, M, out=None, casting=None):
+        if out is None:
+            if casting is None:
+                return a.clip(m, M)
+            else:
+                return a.clip(m, M, casting=casting)
+        else:
+            if casting is None:
+                return a.clip(m, M, out)
+            else:
+                return a.clip(m, M, out, casting=casting)
+
+    def clip(self, a, m, M, out=None):
+        # use slow-clip
+        selector = np.less(a, m) + 2*np.greater(a, M)
+        return selector.choose((a, m, M), out=out)
+
+    # Handy functions
+    def _generate_data(self, n, m):
+        return randn(n, m)
+
+    def _generate_data_complex(self, n, m):
+        return randn(n, m) + 1.j * rand(n, m)
+
+    def _generate_flt_data(self, n, m):
+        return (randn(n, m)).astype(np.float32)
+
+    def _neg_byteorder(self, a):
+        a = np.asarray(a)
+        if sys.byteorder == 'little':
+            a = a.astype(a.dtype.newbyteorder('>'))
+        else:
+            a = a.astype(a.dtype.newbyteorder('<'))
+        return a
+
+    def _generate_non_native_data(self, n, m):
+        data = randn(n, m)
+        data = self._neg_byteorder(data)
+        assert_(not data.dtype.isnative)
+        return data
+
+    def _generate_int_data(self, n, m):
+        return (10 * rand(n, m)).astype(np.int64)
+
+    def _generate_int32_data(self, n, m):
+        return (10 * rand(n, m)).astype(np.int32)
+
+    # Now the real test cases
+
+    @pytest.mark.parametrize("dtype", '?bhilqpBHILQPefdgFDGO')
+    def test_ones_pathological(self, dtype):
+        # for preservation of behavior described in
+        # gh-12519; amin > amax behavior may still change
+        # in the future
+        arr = np.ones(10, dtype=dtype)
+        expected = np.zeros(10, dtype=dtype)
+        actual = np.clip(arr, 1, 0)
+        if dtype == 'O':
+            assert actual.tolist() == expected.tolist()
+        else:
+            assert_equal(actual, expected)
+
+    def test_simple_double(self):
+        # Test native double input with scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = 0.1
+        M = 0.6
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_int(self):
+        # Test native int input with scalar min/max.
+        a = self._generate_int_data(self.nr, self.nc)
+        a = a.astype(int)
+        m = -2
+        M = 4
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_array_double(self):
+        # Test native double input with array min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = np.zeros(a.shape)
+        M = m + 0.5
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_nonnative(self):
+        # Test non native double input with scalar min/max.
+        # Test native double input with non native double scalar min/max.
+        a = self._generate_non_native_data(self.nr, self.nc)
+        m = -0.5
+        M = 0.6
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_equal(ac, act)
+
+        # Test native double input with non native double scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5
+        M = self._neg_byteorder(0.6)
+        assert_(not M.dtype.isnative)
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_equal(ac, act)
+
+    def test_simple_complex(self):
+        # Test native complex input with native double scalar min/max.
+        # Test native input with complex double scalar min/max.
+        a = 3 * self._generate_data_complex(self.nr, self.nc)
+        m = -0.5
+        M = 1.
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+        # Test native input with complex double scalar min/max.
+        a = 3 * self._generate_data(self.nr, self.nc)
+        m = -0.5 + 1.j
+        M = 1. + 2.j
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_complex(self):
+        # Address Issue gh-5354 for clipping complex arrays
+        # Test native complex input without explicit min/max
+        # ie, either min=None or max=None
+        a = np.ones(10, dtype=complex)
+        m = a.min()
+        M = a.max()
+        am = self.fastclip(a, m, None)
+        aM = self.fastclip(a, None, M)
+        assert_array_strict_equal(am, a)
+        assert_array_strict_equal(aM, a)
+
+    def test_clip_non_contig(self):
+        # Test clip for non contiguous native input and native scalar min/max.
+        a = self._generate_data(self.nr * 2, self.nc * 3)
+        a = a[::2, ::3]
+        assert_(not a.flags['F_CONTIGUOUS'])
+        assert_(not a.flags['C_CONTIGUOUS'])
+        ac = self.fastclip(a, -1.6, 1.7)
+        act = self.clip(a, -1.6, 1.7)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_out(self):
+        # Test native double input with scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5
+        M = 0.6
+        ac = np.zeros(a.shape)
+        act = np.zeros(a.shape)
+        self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    @pytest.mark.parametrize("casting", [None, "unsafe"])
+    def test_simple_int32_inout(self, casting):
+        # Test native int32 input with double min/max and int32 out.
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.float64(0)
+        M = np.float64(2)
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        if casting is None:
+            with assert_warns(DeprecationWarning):
+                # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+                self.fastclip(a, m, M, ac, casting=casting)
+        else:
+            # explicitly passing "unsafe" will silence warning
+            self.fastclip(a, m, M, ac, casting=casting)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_int64_out(self):
+        # Test native int32 input with int32 scalar min/max and int64 out.
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.int32(-1)
+        M = np.int32(1)
+        ac = np.zeros(a.shape, dtype=np.int64)
+        act = ac.copy()
+        self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_int64_inout(self):
+        # Test native int32 input with double array min/max and int32 out.
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.zeros(a.shape, np.float64)
+        M = np.float64(1)
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        with assert_warns(DeprecationWarning):
+            # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+            self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_int32_out(self):
+        # Test native double input with scalar min/max and int out.
+        a = self._generate_data(self.nr, self.nc)
+        m = -1.0
+        M = 2.0
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        with assert_warns(DeprecationWarning):
+            # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+            self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_simple_inplace_01(self):
+        # Test native double input with array min/max in-place.
+        a = self._generate_data(self.nr, self.nc)
+        ac = a.copy()
+        m = np.zeros(a.shape)
+        M = 1.0
+        self.fastclip(a, m, M, a)
+        self.clip(a, m, M, ac)
+        assert_array_strict_equal(a, ac)
+
+    def test_simple_inplace_02(self):
+        # Test native double input with scalar min/max in-place.
+        a = self._generate_data(self.nr, self.nc)
+        ac = a.copy()
+        m = -0.5
+        M = 0.6
+        self.fastclip(a, m, M, a)
+        self.clip(ac, m, M, ac)
+        assert_array_strict_equal(a, ac)
+
+    def test_noncontig_inplace(self):
+        # Test non contiguous double input with double scalar min/max in-place.
+        a = self._generate_data(self.nr * 2, self.nc * 3)
+        a = a[::2, ::3]
+        assert_(not a.flags['F_CONTIGUOUS'])
+        assert_(not a.flags['C_CONTIGUOUS'])
+        ac = a.copy()
+        m = -0.5
+        M = 0.6
+        self.fastclip(a, m, M, a)
+        self.clip(ac, m, M, ac)
+        assert_array_equal(a, ac)
+
+    def test_type_cast_01(self):
+        # Test native double input with scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5
+        M = 0.6
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_02(self):
+        # Test native int32 input with int32 scalar min/max.
+        a = self._generate_int_data(self.nr, self.nc)
+        a = a.astype(np.int32)
+        m = -2
+        M = 4
+        ac = self.fastclip(a, m, M)
+        act = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_03(self):
+        # Test native int32 input with float64 scalar min/max.
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = -2
+        M = 4
+        ac = self.fastclip(a, np.float64(m), np.float64(M))
+        act = self.clip(a, np.float64(m), np.float64(M))
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_04(self):
+        # Test native int32 input with float32 scalar min/max.
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.float32(-2)
+        M = np.float32(4)
+        act = self.fastclip(a, m, M)
+        ac = self.clip(a, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_05(self):
+        # Test native int32 with double arrays min/max.
+        a = self._generate_int_data(self.nr, self.nc)
+        m = -0.5
+        M = 1.
+        ac = self.fastclip(a, m * np.zeros(a.shape), M)
+        act = self.clip(a, m * np.zeros(a.shape), M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_06(self):
+        # Test native with NON native scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = 0.5
+        m_s = self._neg_byteorder(m)
+        M = 1.
+        act = self.clip(a, m_s, M)
+        ac = self.fastclip(a, m_s, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_07(self):
+        # Test NON native with native array min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5 * np.ones(a.shape)
+        M = 1.
+        a_s = self._neg_byteorder(a)
+        assert_(not a_s.dtype.isnative)
+        act = a_s.clip(m, M)
+        ac = self.fastclip(a_s, m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_08(self):
+        # Test NON native with native scalar min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5
+        M = 1.
+        a_s = self._neg_byteorder(a)
+        assert_(not a_s.dtype.isnative)
+        ac = self.fastclip(a_s, m, M)
+        act = a_s.clip(m, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_09(self):
+        # Test native with NON native array min/max.
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5 * np.ones(a.shape)
+        M = 1.
+        m_s = self._neg_byteorder(m)
+        assert_(not m_s.dtype.isnative)
+        ac = self.fastclip(a, m_s, M)
+        act = self.clip(a, m_s, M)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_10(self):
+        # Test native int32 with float min/max and float out for output argument.
+        a = self._generate_int_data(self.nr, self.nc)
+        b = np.zeros(a.shape, dtype=np.float32)
+        m = np.float32(-0.5)
+        M = np.float32(1)
+        act = self.clip(a, m, M, out=b)
+        ac = self.fastclip(a, m, M, out=b)
+        assert_array_strict_equal(ac, act)
+
+    def test_type_cast_11(self):
+        # Test non native with native scalar, min/max, out non native
+        a = self._generate_non_native_data(self.nr, self.nc)
+        b = a.copy()
+        b = b.astype(b.dtype.newbyteorder('>'))
+        bt = b.copy()
+        m = -0.5
+        M = 1.
+        self.fastclip(a, m, M, out=b)
+        self.clip(a, m, M, out=bt)
+        assert_array_strict_equal(b, bt)
+
+    def test_type_cast_12(self):
+        # Test native int32 input and min/max and float out
+        a = self._generate_int_data(self.nr, self.nc)
+        b = np.zeros(a.shape, dtype=np.float32)
+        m = np.int32(0)
+        M = np.int32(1)
+        act = self.clip(a, m, M, out=b)
+        ac = self.fastclip(a, m, M, out=b)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_simple(self):
+        # Test native double input with scalar min/max
+        a = self._generate_data(self.nr, self.nc)
+        m = -0.5
+        M = 0.6
+        ac = np.zeros(a.shape)
+        act = np.zeros(a.shape)
+        self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_simple2(self):
+        # Test native int32 input with double min/max and int32 out
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.float64(0)
+        M = np.float64(2)
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        with assert_warns(DeprecationWarning):
+            # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+            self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_simple_int32(self):
+        # Test native int32 input with int32 scalar min/max and int64 out
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.int32(-1)
+        M = np.int32(1)
+        ac = np.zeros(a.shape, dtype=np.int64)
+        act = ac.copy()
+        self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_array_int32(self):
+        # Test native int32 input with double array min/max and int32 out
+        a = self._generate_int32_data(self.nr, self.nc)
+        m = np.zeros(a.shape, np.float64)
+        M = np.float64(1)
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        with assert_warns(DeprecationWarning):
+            # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+            self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_array_outint32(self):
+        # Test native double input with scalar min/max and int out
+        a = self._generate_data(self.nr, self.nc)
+        m = -1.0
+        M = 2.0
+        ac = np.zeros(a.shape, dtype=np.int32)
+        act = ac.copy()
+        with assert_warns(DeprecationWarning):
+            # NumPy 1.17.0, 2018-02-24 - casting is unsafe
+            self.fastclip(a, m, M, ac)
+        self.clip(a, m, M, act)
+        assert_array_strict_equal(ac, act)
+
+    def test_clip_with_out_transposed(self):
+        # Test that the out argument works when transposed
+        a = np.arange(16).reshape(4, 4)
+        out = np.empty_like(a).T
+        a.clip(4, 10, out=out)
+        expected = self.clip(a, 4, 10)
+        assert_array_equal(out, expected)
+
+    def test_clip_with_out_memory_overlap(self):
+        # Test that the out argument works when it has memory overlap
+        a = np.arange(16).reshape(4, 4)
+        ac = a.copy()
+        a[:-1].clip(4, 10, out=a[1:])
+        expected = self.clip(ac[:-1], 4, 10)
+        assert_array_equal(a[1:], expected)
+
+    def test_clip_inplace_array(self):
+        # Test native double input with array min/max
+        a = self._generate_data(self.nr, self.nc)
+        ac = a.copy()
+        m = np.zeros(a.shape)
+        M = 1.0
+        self.fastclip(a, m, M, a)
+        self.clip(a, m, M, ac)
+        assert_array_strict_equal(a, ac)
+
+    def test_clip_inplace_simple(self):
+        # Test native double input with scalar min/max
+        a = self._generate_data(self.nr, self.nc)
+        ac = a.copy()
+        m = -0.5
+        M = 0.6
+        self.fastclip(a, m, M, a)
+        self.clip(a, m, M, ac)
+        assert_array_strict_equal(a, ac)
+
+    def test_clip_func_takes_out(self):
+        # Ensure that the clip() function takes an out=argument.
+        a = self._generate_data(self.nr, self.nc)
+        ac = a.copy()
+        m = -0.5
+        M = 0.6
+        a2 = np.clip(a, m, M, out=a)
+        self.clip(a, m, M, ac)
+        assert_array_strict_equal(a2, ac)
+        assert_(a2 is a)
+
+    def test_clip_nan(self):
+        d = np.arange(7.)
+        with assert_warns(DeprecationWarning):
+            assert_equal(d.clip(min=np.nan), d)
+        with assert_warns(DeprecationWarning):
+            assert_equal(d.clip(max=np.nan), d)
+        with assert_warns(DeprecationWarning):
+            assert_equal(d.clip(min=np.nan, max=np.nan), d)
+        with assert_warns(DeprecationWarning):
+            assert_equal(d.clip(min=-2, max=np.nan), d)
+        with assert_warns(DeprecationWarning):
+            assert_equal(d.clip(min=np.nan, max=10), d)
+
+    def test_object_clip(self):
+        a = np.arange(10, dtype=object)
+        actual = np.clip(a, 1, 5)
+        expected = np.array([1, 1, 2, 3, 4, 5, 5, 5, 5, 5])
+        assert actual.tolist() == expected.tolist()
+
+    def test_clip_all_none(self):
+        a = np.arange(10, dtype=object)
+        with assert_raises_regex(ValueError, 'max or min'):
+            np.clip(a, None, None)
+
+    def test_clip_invalid_casting(self):
+        a = np.arange(10, dtype=object)
+        with assert_raises_regex(ValueError,
+                                 'casting must be one of'):
+            self.fastclip(a, 1, 8, casting="garbage")
+
+    @pytest.mark.parametrize("amin, amax", [
+        # two scalars
+        (1, 0),
+        # mix scalar and array
+        (1, np.zeros(10)),
+        # two arrays
+        (np.ones(10), np.zeros(10)),
+        ])
+    def test_clip_value_min_max_flip(self, amin, amax):
+        a = np.arange(10, dtype=np.int64)
+        # requirement from ufunc_docstrings.py
+        expected = np.minimum(np.maximum(a, amin), amax)
+        actual = np.clip(a, amin, amax)
+        assert_equal(actual, expected)
+
+    @pytest.mark.parametrize("arr, amin, amax, exp", [
+        # for a bug in npy_ObjectClip, based on a
+        # case produced by hypothesis
+        (np.zeros(10, dtype=np.int64),
+         0,
+         -2**64+1,
+         np.full(10, -2**64+1, dtype=object)),
+        # for bugs in NPY_TIMEDELTA_MAX, based on a case
+        # produced by hypothesis
+        (np.zeros(10, dtype='m8') - 1,
+         0,
+         0,
+         np.zeros(10, dtype='m8')),
+    ])
+    def test_clip_problem_cases(self, arr, amin, amax, exp):
+        actual = np.clip(arr, amin, amax)
+        assert_equal(actual, exp)
+
+    @pytest.mark.xfail(reason="no scalar nan propagation yet",
+                       raises=AssertionError,
+                       strict=True)
+    @pytest.mark.parametrize("arr, amin, amax", [
+        # problematic scalar nan case from hypothesis
+        (np.zeros(10, dtype=np.int64),
+         np.array(np.nan),
+         np.zeros(10, dtype=np.int32)),
+    ])
+    @pytest.mark.filterwarnings("ignore::DeprecationWarning")
+    def test_clip_scalar_nan_propagation(self, arr, amin, amax):
+        # enforcement of scalar nan propagation for comparisons
+        # called through clip()
+        expected = np.minimum(np.maximum(arr, amin), amax)
+        actual = np.clip(arr, amin, amax)
+        assert_equal(actual, expected)
+
+    @pytest.mark.xfail(reason="propagation doesn't match spec")
+    @pytest.mark.parametrize("arr, amin, amax", [
+        (np.array([1] * 10, dtype='m8'),
+         np.timedelta64('NaT'),
+         np.zeros(10, dtype=np.int32)),
+    ])
+    @pytest.mark.filterwarnings("ignore::DeprecationWarning")
+    def test_NaT_propagation(self, arr, amin, amax):
+        # NOTE: the expected function spec doesn't
+        # propagate NaT, but clip() now does
+        expected = np.minimum(np.maximum(arr, amin), amax)
+        actual = np.clip(arr, amin, amax)
+        assert_equal(actual, expected)
+
+    @given(data=st.data(), shape=hynp.array_shapes())
+    def test_clip_property(self, data, shape):
+        """A property-based test using Hypothesis.
+
+        This aims for maximum generality: it could in principle generate *any*
+        valid inputs to np.clip, and in practice generates much more varied
+        inputs than human testers come up with.
+
+        Because many of the inputs have tricky dependencies - compatible dtypes
+        and mutually-broadcastable shapes - we use `st.data()` strategy draw
+        values *inside* the test function, from strategies we construct based
+        on previous values.  An alternative would be to define a custom strategy
+        with `@st.composite`, but until we have duplicated code inline is fine.
+
+        That accounts for most of the function; the actual test is just three
+        lines to calculate and compare actual vs expected results!
+        """
+        # Our base array and bounds should not need to be of the same type as
+        # long as they are all compatible - so we allow any int or float type.
+        dtype_strategy = hynp.integer_dtypes() | hynp.floating_dtypes()
+
+        # The following line is a total hack to disable the varied-dtypes
+        # component of this test, because result != expected if dtypes can vary.
+        dtype_strategy = st.just(data.draw(dtype_strategy))
+
+        # Generate an arbitrary array of the chosen shape and dtype
+        # This is the value that we clip.
+        arr = data.draw(hynp.arrays(dtype=dtype_strategy, shape=shape))
+
+        # Generate shapes for the bounds which can be broadcast with each other
+        # and with the base shape.  Below, we might decide to use scalar bounds,
+        # but it's clearer to generate these shapes unconditionally in advance.
+        in_shapes, result_shape = data.draw(
+            hynp.mutually_broadcastable_shapes(
+                num_shapes=2,
+                base_shape=shape,
+                # Commenting out the min_dims line allows zero-dimensional arrays,
+                # and zero-dimensional arrays containing NaN make the test fail.
+                min_dims=1  
+                            
+            )
+        )
+        amin = data.draw(
+            dtype_strategy.flatmap(hynp.from_dtype)
+            | hynp.arrays(dtype=dtype_strategy, shape=in_shapes[0])
+        )
+        amax = data.draw(
+            dtype_strategy.flatmap(hynp.from_dtype)
+            | hynp.arrays(dtype=dtype_strategy, shape=in_shapes[1])
+        )
+        # If we allow either bound to be a scalar `nan`, the test will fail -
+        # so we just "assume" that away (if it is, this raises a special
+        # exception and Hypothesis will try again with different inputs)
+        assume(not np.isscalar(amin) or not np.isnan(amin))
+        assume(not np.isscalar(amax) or not np.isnan(amax))
+
+        # Then calculate our result and expected result and check that they're
+        # equal!  See gh-12519 for discussion deciding on this property.
+        result = np.clip(arr, amin, amax)
+        expected = np.minimum(amax, np.maximum(arr, amin))
+        assert_array_equal(result, expected)
+
+
+class TestAllclose:
+    rtol = 1e-5
+    atol = 1e-8
+
+    def setup(self):
+        self.olderr = np.seterr(invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.olderr)
+
+    def tst_allclose(self, x, y):
+        assert_(np.allclose(x, y), "%s and %s not close" % (x, y))
+
+    def tst_not_allclose(self, x, y):
+        assert_(not np.allclose(x, y), "%s and %s shouldn't be close" % (x, y))
+
+    def test_ip_allclose(self):
+        # Parametric test factory.
+        arr = np.array([100, 1000])
+        aran = np.arange(125).reshape((5, 5, 5))
+
+        atol = self.atol
+        rtol = self.rtol
+
+        data = [([1, 0], [1, 0]),
+                ([atol], [0]),
+                ([1], [1+rtol+atol]),
+                (arr, arr + arr*rtol),
+                (arr, arr + arr*rtol + atol*2),
+                (aran, aran + aran*rtol),
+                (np.inf, np.inf),
+                (np.inf, [np.inf])]
+
+        for (x, y) in data:
+            self.tst_allclose(x, y)
+
+    def test_ip_not_allclose(self):
+        # Parametric test factory.
+        aran = np.arange(125).reshape((5, 5, 5))
+
+        atol = self.atol
+        rtol = self.rtol
+
+        data = [([np.inf, 0], [1, np.inf]),
+                ([np.inf, 0], [1, 0]),
+                ([np.inf, np.inf], [1, np.inf]),
+                ([np.inf, np.inf], [1, 0]),
+                ([-np.inf, 0], [np.inf, 0]),
+                ([np.nan, 0], [np.nan, 0]),
+                ([atol*2], [0]),
+                ([1], [1+rtol+atol*2]),
+                (aran, aran + aran*atol + atol*2),
+                (np.array([np.inf, 1]), np.array([0, np.inf]))]
+
+        for (x, y) in data:
+            self.tst_not_allclose(x, y)
+
+    def test_no_parameter_modification(self):
+        x = np.array([np.inf, 1])
+        y = np.array([0, np.inf])
+        np.allclose(x, y)
+        assert_array_equal(x, np.array([np.inf, 1]))
+        assert_array_equal(y, np.array([0, np.inf]))
+
+    def test_min_int(self):
+        # Could make problems because of abs(min_int) == min_int
+        min_int = np.iinfo(np.int_).min
+        a = np.array([min_int], dtype=np.int_)
+        assert_(np.allclose(a, a))
+
+    def test_equalnan(self):
+        x = np.array([1.0, np.nan])
+        assert_(np.allclose(x, x, equal_nan=True))
+
+    def test_return_class_is_ndarray(self):
+        # Issue gh-6475
+        # Check that allclose does not preserve subtypes
+        class Foo(np.ndarray):
+            def __new__(cls, *args, **kwargs):
+                return np.array(*args, **kwargs).view(cls)
+
+        a = Foo([1])
+        assert_(type(np.allclose(a, a)) is bool)
+
+
+class TestIsclose:
+    rtol = 1e-5
+    atol = 1e-8
+
+    def setup(self):
+        atol = self.atol
+        rtol = self.rtol
+        arr = np.array([100, 1000])
+        aran = np.arange(125).reshape((5, 5, 5))
+
+        self.all_close_tests = [
+                ([1, 0], [1, 0]),
+                ([atol], [0]),
+                ([1], [1 + rtol + atol]),
+                (arr, arr + arr*rtol),
+                (arr, arr + arr*rtol + atol),
+                (aran, aran + aran*rtol),
+                (np.inf, np.inf),
+                (np.inf, [np.inf]),
+                ([np.inf, -np.inf], [np.inf, -np.inf]),
+                ]
+        self.none_close_tests = [
+                ([np.inf, 0], [1, np.inf]),
+                ([np.inf, -np.inf], [1, 0]),
+                ([np.inf, np.inf], [1, -np.inf]),
+                ([np.inf, np.inf], [1, 0]),
+                ([np.nan, 0], [np.nan, -np.inf]),
+                ([atol*2], [0]),
+                ([1], [1 + rtol + atol*2]),
+                (aran, aran + rtol*1.1*aran + atol*1.1),
+                (np.array([np.inf, 1]), np.array([0, np.inf])),
+                ]
+        self.some_close_tests = [
+                ([np.inf, 0], [np.inf, atol*2]),
+                ([atol, 1, 1e6*(1 + 2*rtol) + atol], [0, np.nan, 1e6]),
+                (np.arange(3), [0, 1, 2.1]),
+                (np.nan, [np.nan, np.nan, np.nan]),
+                ([0], [atol, np.inf, -np.inf, np.nan]),
+                (0, [atol, np.inf, -np.inf, np.nan]),
+                ]
+        self.some_close_results = [
+                [True, False],
+                [True, False, False],
+                [True, True, False],
+                [False, False, False],
+                [True, False, False, False],
+                [True, False, False, False],
+                ]
+
+    def test_ip_isclose(self):
+        self.setup()
+        tests = self.some_close_tests
+        results = self.some_close_results
+        for (x, y), result in zip(tests, results):
+            assert_array_equal(np.isclose(x, y), result)
+
+    def tst_all_isclose(self, x, y):
+        assert_(np.all(np.isclose(x, y)), "%s and %s not close" % (x, y))
+
+    def tst_none_isclose(self, x, y):
+        msg = "%s and %s shouldn't be close"
+        assert_(not np.any(np.isclose(x, y)), msg % (x, y))
+
+    def tst_isclose_allclose(self, x, y):
+        msg = "isclose.all() and allclose aren't same for %s and %s"
+        msg2 = "isclose and allclose aren't same for %s and %s"
+        if np.isscalar(x) and np.isscalar(y):
+            assert_(np.isclose(x, y) == np.allclose(x, y), msg=msg2 % (x, y))
+        else:
+            assert_array_equal(np.isclose(x, y).all(), np.allclose(x, y), msg % (x, y))
+
+    def test_ip_all_isclose(self):
+        self.setup()
+        for (x, y) in self.all_close_tests:
+            self.tst_all_isclose(x, y)
+
+    def test_ip_none_isclose(self):
+        self.setup()
+        for (x, y) in self.none_close_tests:
+            self.tst_none_isclose(x, y)
+
+    def test_ip_isclose_allclose(self):
+        self.setup()
+        tests = (self.all_close_tests + self.none_close_tests +
+                 self.some_close_tests)
+        for (x, y) in tests:
+            self.tst_isclose_allclose(x, y)
+
+    def test_equal_nan(self):
+        assert_array_equal(np.isclose(np.nan, np.nan, equal_nan=True), [True])
+        arr = np.array([1.0, np.nan])
+        assert_array_equal(np.isclose(arr, arr, equal_nan=True), [True, True])
+
+    def test_masked_arrays(self):
+        # Make sure to test the output type when arguments are interchanged.
+
+        x = np.ma.masked_where([True, True, False], np.arange(3))
+        assert_(type(x) is type(np.isclose(2, x)))
+        assert_(type(x) is type(np.isclose(x, 2)))
+
+        x = np.ma.masked_where([True, True, False], [np.nan, np.inf, np.nan])
+        assert_(type(x) is type(np.isclose(np.inf, x)))
+        assert_(type(x) is type(np.isclose(x, np.inf)))
+
+        x = np.ma.masked_where([True, True, False], [np.nan, np.nan, np.nan])
+        y = np.isclose(np.nan, x, equal_nan=True)
+        assert_(type(x) is type(y))
+        # Ensure that the mask isn't modified...
+        assert_array_equal([True, True, False], y.mask)
+        y = np.isclose(x, np.nan, equal_nan=True)
+        assert_(type(x) is type(y))
+        # Ensure that the mask isn't modified...
+        assert_array_equal([True, True, False], y.mask)
+
+        x = np.ma.masked_where([True, True, False], [np.nan, np.nan, np.nan])
+        y = np.isclose(x, x, equal_nan=True)
+        assert_(type(x) is type(y))
+        # Ensure that the mask isn't modified...
+        assert_array_equal([True, True, False], y.mask)
+
+    def test_scalar_return(self):
+        assert_(np.isscalar(np.isclose(1, 1)))
+
+    def test_no_parameter_modification(self):
+        x = np.array([np.inf, 1])
+        y = np.array([0, np.inf])
+        np.isclose(x, y)
+        assert_array_equal(x, np.array([np.inf, 1]))
+        assert_array_equal(y, np.array([0, np.inf]))
+
+    def test_non_finite_scalar(self):
+        # GH7014, when two scalars are compared the output should also be a
+        # scalar
+        assert_(np.isclose(np.inf, -np.inf) is np.False_)
+        assert_(np.isclose(0, np.inf) is np.False_)
+        assert_(type(np.isclose(0, np.inf)) is np.bool_)
+
+
+class TestStdVar:
+    def setup(self):
+        self.A = np.array([1, -1, 1, -1])
+        self.real_var = 1
+
+    def test_basic(self):
+        assert_almost_equal(np.var(self.A), self.real_var)
+        assert_almost_equal(np.std(self.A)**2, self.real_var)
+
+    def test_scalars(self):
+        assert_equal(np.var(1), 0)
+        assert_equal(np.std(1), 0)
+
+    def test_ddof1(self):
+        assert_almost_equal(np.var(self.A, ddof=1),
+                            self.real_var*len(self.A)/float(len(self.A)-1))
+        assert_almost_equal(np.std(self.A, ddof=1)**2,
+                            self.real_var*len(self.A)/float(len(self.A)-1))
+
+    def test_ddof2(self):
+        assert_almost_equal(np.var(self.A, ddof=2),
+                            self.real_var*len(self.A)/float(len(self.A)-2))
+        assert_almost_equal(np.std(self.A, ddof=2)**2,
+                            self.real_var*len(self.A)/float(len(self.A)-2))
+
+    def test_out_scalar(self):
+        d = np.arange(10)
+        out = np.array(0.)
+        r = np.std(d, out=out)
+        assert_(r is out)
+        assert_array_equal(r, out)
+        r = np.var(d, out=out)
+        assert_(r is out)
+        assert_array_equal(r, out)
+        r = np.mean(d, out=out)
+        assert_(r is out)
+        assert_array_equal(r, out)
+
+
+class TestStdVarComplex:
+    def test_basic(self):
+        A = np.array([1, 1.j, -1, -1.j])
+        real_var = 1
+        assert_almost_equal(np.var(A), real_var)
+        assert_almost_equal(np.std(A)**2, real_var)
+
+    def test_scalars(self):
+        assert_equal(np.var(1j), 0)
+        assert_equal(np.std(1j), 0)
+
+
+class TestCreationFuncs:
+    # Test ones, zeros, empty and full.
+
+    def setup(self):
+        dtypes = {np.dtype(tp) for tp in itertools.chain(*np.sctypes.values())}
+        # void, bytes, str
+        variable_sized = {tp for tp in dtypes if tp.str.endswith('0')}
+        self.dtypes = sorted(dtypes - variable_sized |
+                             {np.dtype(tp.str.replace("0", str(i)))
+                              for tp in variable_sized for i in range(1, 10)},
+                             key=lambda dtype: dtype.str)
+        self.orders = {'C': 'c_contiguous', 'F': 'f_contiguous'}
+        self.ndims = 10
+
+    def check_function(self, func, fill_value=None):
+        par = ((0, 1, 2),
+               range(self.ndims),
+               self.orders,
+               self.dtypes)
+        fill_kwarg = {}
+        if fill_value is not None:
+            fill_kwarg = {'fill_value': fill_value}
+
+        for size, ndims, order, dtype in itertools.product(*par):
+            shape = ndims * [size]
+
+            # do not fill void type
+            if fill_kwarg and dtype.str.startswith('|V'):
+                continue
+
+            arr = func(shape, order=order, dtype=dtype,
+                       **fill_kwarg)
+
+            assert_equal(arr.dtype, dtype)
+            assert_(getattr(arr.flags, self.orders[order]))
+
+            if fill_value is not None:
+                if dtype.str.startswith('|S'):
+                    val = str(fill_value)
+                else:
+                    val = fill_value
+                assert_equal(arr, dtype.type(val))
+
+    def test_zeros(self):
+        self.check_function(np.zeros)
+
+    def test_ones(self):
+        self.check_function(np.zeros)
+
+    def test_empty(self):
+        self.check_function(np.empty)
+
+    def test_full(self):
+        self.check_function(np.full, 0)
+        self.check_function(np.full, 1)
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_for_reference_leak(self):
+        # Make sure we have an object for reference
+        dim = 1
+        beg = sys.getrefcount(dim)
+        np.zeros([dim]*10)
+        assert_(sys.getrefcount(dim) == beg)
+        np.ones([dim]*10)
+        assert_(sys.getrefcount(dim) == beg)
+        np.empty([dim]*10)
+        assert_(sys.getrefcount(dim) == beg)
+        np.full([dim]*10, 0)
+        assert_(sys.getrefcount(dim) == beg)
+
+
+class TestLikeFuncs:
+    '''Test ones_like, zeros_like, empty_like and full_like'''
+
+    def setup(self):
+        self.data = [
+                # Array scalars
+                (np.array(3.), None),
+                (np.array(3), 'f8'),
+                # 1D arrays
+                (np.arange(6, dtype='f4'), None),
+                (np.arange(6), 'c16'),
+                # 2D C-layout arrays
+                (np.arange(6).reshape(2, 3), None),
+                (np.arange(6).reshape(3, 2), 'i1'),
+                # 2D F-layout arrays
+                (np.arange(6).reshape((2, 3), order='F'), None),
+                (np.arange(6).reshape((3, 2), order='F'), 'i1'),
+                # 3D C-layout arrays
+                (np.arange(24).reshape(2, 3, 4), None),
+                (np.arange(24).reshape(4, 3, 2), 'f4'),
+                # 3D F-layout arrays
+                (np.arange(24).reshape((2, 3, 4), order='F'), None),
+                (np.arange(24).reshape((4, 3, 2), order='F'), 'f4'),
+                # 3D non-C/F-layout arrays
+                (np.arange(24).reshape(2, 3, 4).swapaxes(0, 1), None),
+                (np.arange(24).reshape(4, 3, 2).swapaxes(0, 1), '?'),
+                     ]
+        self.shapes = [(), (5,), (5,6,), (5,6,7,)]
+
+    def compare_array_value(self, dz, value, fill_value):
+        if value is not None:
+            if fill_value:
+                try:
+                    z = dz.dtype.type(value)
+                except OverflowError:
+                    pass
+                else:
+                    assert_(np.all(dz == z))
+            else:
+                assert_(np.all(dz == value))
+
+    def check_like_function(self, like_function, value, fill_value=False):
+        if fill_value:
+            fill_kwarg = {'fill_value': value}
+        else:
+            fill_kwarg = {}
+        for d, dtype in self.data:
+            # default (K) order, dtype
+            dz = like_function(d, dtype=dtype, **fill_kwarg)
+            assert_equal(dz.shape, d.shape)
+            assert_equal(np.array(dz.strides)*d.dtype.itemsize,
+                         np.array(d.strides)*dz.dtype.itemsize)
+            assert_equal(d.flags.c_contiguous, dz.flags.c_contiguous)
+            assert_equal(d.flags.f_contiguous, dz.flags.f_contiguous)
+            if dtype is None:
+                assert_equal(dz.dtype, d.dtype)
+            else:
+                assert_equal(dz.dtype, np.dtype(dtype))
+            self.compare_array_value(dz, value, fill_value)
+
+            # C order, default dtype
+            dz = like_function(d, order='C', dtype=dtype, **fill_kwarg)
+            assert_equal(dz.shape, d.shape)
+            assert_(dz.flags.c_contiguous)
+            if dtype is None:
+                assert_equal(dz.dtype, d.dtype)
+            else:
+                assert_equal(dz.dtype, np.dtype(dtype))
+            self.compare_array_value(dz, value, fill_value)
+
+            # F order, default dtype
+            dz = like_function(d, order='F', dtype=dtype, **fill_kwarg)
+            assert_equal(dz.shape, d.shape)
+            assert_(dz.flags.f_contiguous)
+            if dtype is None:
+                assert_equal(dz.dtype, d.dtype)
+            else:
+                assert_equal(dz.dtype, np.dtype(dtype))
+            self.compare_array_value(dz, value, fill_value)
+
+            # A order
+            dz = like_function(d, order='A', dtype=dtype, **fill_kwarg)
+            assert_equal(dz.shape, d.shape)
+            if d.flags.f_contiguous:
+                assert_(dz.flags.f_contiguous)
+            else:
+                assert_(dz.flags.c_contiguous)
+            if dtype is None:
+                assert_equal(dz.dtype, d.dtype)
+            else:
+                assert_equal(dz.dtype, np.dtype(dtype))
+            self.compare_array_value(dz, value, fill_value)
+
+            # Test the 'shape' parameter
+            for s in self.shapes:
+                for o in 'CFA':
+                    sz = like_function(d, dtype=dtype, shape=s, order=o,
+                                       **fill_kwarg)
+                    assert_equal(sz.shape, s)
+                    if dtype is None:
+                        assert_equal(sz.dtype, d.dtype)
+                    else:
+                        assert_equal(sz.dtype, np.dtype(dtype))
+                    if o == 'C' or (o == 'A' and d.flags.c_contiguous):
+                        assert_(sz.flags.c_contiguous)
+                    elif o == 'F' or (o == 'A' and d.flags.f_contiguous):
+                        assert_(sz.flags.f_contiguous)
+                    self.compare_array_value(sz, value, fill_value)
+
+                if (d.ndim != len(s)):
+                    assert_equal(np.argsort(like_function(d, dtype=dtype,
+                                                          shape=s, order='K',
+                                                          **fill_kwarg).strides),
+                                 np.argsort(np.empty(s, dtype=dtype,
+                                                     order='C').strides))
+                else:
+                    assert_equal(np.argsort(like_function(d, dtype=dtype,
+                                                          shape=s, order='K',
+                                                          **fill_kwarg).strides),
+                                 np.argsort(d.strides))
+
+        # Test the 'subok' parameter
+        class MyNDArray(np.ndarray):
+            pass
+
+        a = np.array([[1, 2], [3, 4]]).view(MyNDArray)
+
+        b = like_function(a, **fill_kwarg)
+        assert_(type(b) is MyNDArray)
+
+        b = like_function(a, subok=False, **fill_kwarg)
+        assert_(type(b) is not MyNDArray)
+
+    def test_ones_like(self):
+        self.check_like_function(np.ones_like, 1)
+
+    def test_zeros_like(self):
+        self.check_like_function(np.zeros_like, 0)
+
+    def test_empty_like(self):
+        self.check_like_function(np.empty_like, None)
+
+    def test_filled_like(self):
+        self.check_like_function(np.full_like, 0, True)
+        self.check_like_function(np.full_like, 1, True)
+        self.check_like_function(np.full_like, 1000, True)
+        self.check_like_function(np.full_like, 123.456, True)
+        self.check_like_function(np.full_like, np.inf, True)
+
+
+class TestCorrelate:
+    def _setup(self, dt):
+        self.x = np.array([1, 2, 3, 4, 5], dtype=dt)
+        self.xs = np.arange(1, 20)[::3]
+        self.y = np.array([-1, -2, -3], dtype=dt)
+        self.z1 = np.array([ -3.,  -8., -14., -20., -26., -14.,  -5.], dtype=dt)
+        self.z1_4 = np.array([-2., -5., -8., -11., -14., -5.], dtype=dt)
+        self.z1r = np.array([-15., -22., -22., -16., -10.,  -4.,  -1.], dtype=dt)
+        self.z2 = np.array([-5., -14., -26., -20., -14., -8.,  -3.], dtype=dt)
+        self.z2r = np.array([-1., -4., -10., -16., -22., -22., -15.], dtype=dt)
+        self.zs = np.array([-3., -14., -30., -48., -66., -84.,
+                           -102., -54., -19.], dtype=dt)
+
+    def test_float(self):
+        self._setup(float)
+        z = np.correlate(self.x, self.y, 'full')
+        assert_array_almost_equal(z, self.z1)
+        z = np.correlate(self.x, self.y[:-1], 'full')
+        assert_array_almost_equal(z, self.z1_4)
+        z = np.correlate(self.y, self.x, 'full')
+        assert_array_almost_equal(z, self.z2)
+        z = np.correlate(self.x[::-1], self.y, 'full')
+        assert_array_almost_equal(z, self.z1r)
+        z = np.correlate(self.y, self.x[::-1], 'full')
+        assert_array_almost_equal(z, self.z2r)
+        z = np.correlate(self.xs, self.y, 'full')
+        assert_array_almost_equal(z, self.zs)
+
+    def test_object(self):
+        self._setup(Decimal)
+        z = np.correlate(self.x, self.y, 'full')
+        assert_array_almost_equal(z, self.z1)
+        z = np.correlate(self.y, self.x, 'full')
+        assert_array_almost_equal(z, self.z2)
+
+    def test_no_overwrite(self):
+        d = np.ones(100)
+        k = np.ones(3)
+        np.correlate(d, k)
+        assert_array_equal(d, np.ones(100))
+        assert_array_equal(k, np.ones(3))
+
+    def test_complex(self):
+        x = np.array([1, 2, 3, 4+1j], dtype=complex)
+        y = np.array([-1, -2j, 3+1j], dtype=complex)
+        r_z = np.array([3-1j, 6, 8+1j, 11+5j, -5+8j, -4-1j], dtype=complex)
+        r_z = r_z[::-1].conjugate()
+        z = np.correlate(y, x, mode='full')
+        assert_array_almost_equal(z, r_z)
+
+    def test_zero_size(self):
+        with pytest.raises(ValueError):
+            np.correlate(np.array([]), np.ones(1000), mode='full')
+        with pytest.raises(ValueError):
+            np.correlate(np.ones(1000), np.array([]), mode='full')
+
+class TestConvolve:
+    def test_object(self):
+        d = [1.] * 100
+        k = [1.] * 3
+        assert_array_almost_equal(np.convolve(d, k)[2:-2], np.full(98, 3))
+
+    def test_no_overwrite(self):
+        d = np.ones(100)
+        k = np.ones(3)
+        np.convolve(d, k)
+        assert_array_equal(d, np.ones(100))
+        assert_array_equal(k, np.ones(3))
+
+
+class TestArgwhere:
+
+    @pytest.mark.parametrize('nd', [0, 1, 2])
+    def test_nd(self, nd):
+        # get an nd array with multiple elements in every dimension
+        x = np.empty((2,)*nd, bool)
+
+        # none
+        x[...] = False
+        assert_equal(np.argwhere(x).shape, (0, nd))
+
+        # only one
+        x[...] = False
+        x.flat[0] = True
+        assert_equal(np.argwhere(x).shape, (1, nd))
+
+        # all but one
+        x[...] = True
+        x.flat[0] = False
+        assert_equal(np.argwhere(x).shape, (x.size - 1, nd))
+
+        # all
+        x[...] = True
+        assert_equal(np.argwhere(x).shape, (x.size, nd))
+
+    def test_2D(self):
+        x = np.arange(6).reshape((2, 3))
+        assert_array_equal(np.argwhere(x > 1),
+                           [[0, 2],
+                            [1, 0],
+                            [1, 1],
+                            [1, 2]])
+
+    def test_list(self):
+        assert_equal(np.argwhere([4, 0, 2, 1, 3]), [[0], [2], [3], [4]])
+
+
+class TestStringFunction:
+
+    def test_set_string_function(self):
+        a = np.array([1])
+        np.set_string_function(lambda x: "FOO", repr=True)
+        assert_equal(repr(a), "FOO")
+        np.set_string_function(None, repr=True)
+        assert_equal(repr(a), "array([1])")
+
+        np.set_string_function(lambda x: "FOO", repr=False)
+        assert_equal(str(a), "FOO")
+        np.set_string_function(None, repr=False)
+        assert_equal(str(a), "[1]")
+
+
+class TestRoll:
+    def test_roll1d(self):
+        x = np.arange(10)
+        xr = np.roll(x, 2)
+        assert_equal(xr, np.array([8, 9, 0, 1, 2, 3, 4, 5, 6, 7]))
+
+    def test_roll2d(self):
+        x2 = np.reshape(np.arange(10), (2, 5))
+        x2r = np.roll(x2, 1)
+        assert_equal(x2r, np.array([[9, 0, 1, 2, 3], [4, 5, 6, 7, 8]]))
+
+        x2r = np.roll(x2, 1, axis=0)
+        assert_equal(x2r, np.array([[5, 6, 7, 8, 9], [0, 1, 2, 3, 4]]))
+
+        x2r = np.roll(x2, 1, axis=1)
+        assert_equal(x2r, np.array([[4, 0, 1, 2, 3], [9, 5, 6, 7, 8]]))
+
+        # Roll multiple axes at once.
+        x2r = np.roll(x2, 1, axis=(0, 1))
+        assert_equal(x2r, np.array([[9, 5, 6, 7, 8], [4, 0, 1, 2, 3]]))
+
+        x2r = np.roll(x2, (1, 0), axis=(0, 1))
+        assert_equal(x2r, np.array([[5, 6, 7, 8, 9], [0, 1, 2, 3, 4]]))
+
+        x2r = np.roll(x2, (-1, 0), axis=(0, 1))
+        assert_equal(x2r, np.array([[5, 6, 7, 8, 9], [0, 1, 2, 3, 4]]))
+
+        x2r = np.roll(x2, (0, 1), axis=(0, 1))
+        assert_equal(x2r, np.array([[4, 0, 1, 2, 3], [9, 5, 6, 7, 8]]))
+
+        x2r = np.roll(x2, (0, -1), axis=(0, 1))
+        assert_equal(x2r, np.array([[1, 2, 3, 4, 0], [6, 7, 8, 9, 5]]))
+
+        x2r = np.roll(x2, (1, 1), axis=(0, 1))
+        assert_equal(x2r, np.array([[9, 5, 6, 7, 8], [4, 0, 1, 2, 3]]))
+
+        x2r = np.roll(x2, (-1, -1), axis=(0, 1))
+        assert_equal(x2r, np.array([[6, 7, 8, 9, 5], [1, 2, 3, 4, 0]]))
+
+        # Roll the same axis multiple times.
+        x2r = np.roll(x2, 1, axis=(0, 0))
+        assert_equal(x2r, np.array([[0, 1, 2, 3, 4], [5, 6, 7, 8, 9]]))
+
+        x2r = np.roll(x2, 1, axis=(1, 1))
+        assert_equal(x2r, np.array([[3, 4, 0, 1, 2], [8, 9, 5, 6, 7]]))
+
+        # Roll more than one turn in either direction.
+        x2r = np.roll(x2, 6, axis=1)
+        assert_equal(x2r, np.array([[4, 0, 1, 2, 3], [9, 5, 6, 7, 8]]))
+
+        x2r = np.roll(x2, -4, axis=1)
+        assert_equal(x2r, np.array([[4, 0, 1, 2, 3], [9, 5, 6, 7, 8]]))
+
+    def test_roll_empty(self):
+        x = np.array([])
+        assert_equal(np.roll(x, 1), np.array([]))
+
+
+class TestRollaxis:
+
+    # expected shape indexed by (axis, start) for array of
+    # shape (1, 2, 3, 4)
+    tgtshape = {(0, 0): (1, 2, 3, 4), (0, 1): (1, 2, 3, 4),
+                (0, 2): (2, 1, 3, 4), (0, 3): (2, 3, 1, 4),
+                (0, 4): (2, 3, 4, 1),
+                (1, 0): (2, 1, 3, 4), (1, 1): (1, 2, 3, 4),
+                (1, 2): (1, 2, 3, 4), (1, 3): (1, 3, 2, 4),
+                (1, 4): (1, 3, 4, 2),
+                (2, 0): (3, 1, 2, 4), (2, 1): (1, 3, 2, 4),
+                (2, 2): (1, 2, 3, 4), (2, 3): (1, 2, 3, 4),
+                (2, 4): (1, 2, 4, 3),
+                (3, 0): (4, 1, 2, 3), (3, 1): (1, 4, 2, 3),
+                (3, 2): (1, 2, 4, 3), (3, 3): (1, 2, 3, 4),
+                (3, 4): (1, 2, 3, 4)}
+
+    def test_exceptions(self):
+        a = np.arange(1*2*3*4).reshape(1, 2, 3, 4)
+        assert_raises(np.AxisError, np.rollaxis, a, -5, 0)
+        assert_raises(np.AxisError, np.rollaxis, a, 0, -5)
+        assert_raises(np.AxisError, np.rollaxis, a, 4, 0)
+        assert_raises(np.AxisError, np.rollaxis, a, 0, 5)
+
+    def test_results(self):
+        a = np.arange(1*2*3*4).reshape(1, 2, 3, 4).copy()
+        aind = np.indices(a.shape)
+        assert_(a.flags['OWNDATA'])
+        for (i, j) in self.tgtshape:
+            # positive axis, positive start
+            res = np.rollaxis(a, axis=i, start=j)
+            i0, i1, i2, i3 = aind[np.array(res.shape) - 1]
+            assert_(np.all(res[i0, i1, i2, i3] == a))
+            assert_(res.shape == self.tgtshape[(i, j)], str((i,j)))
+            assert_(not res.flags['OWNDATA'])
+
+            # negative axis, positive start
+            ip = i + 1
+            res = np.rollaxis(a, axis=-ip, start=j)
+            i0, i1, i2, i3 = aind[np.array(res.shape) - 1]
+            assert_(np.all(res[i0, i1, i2, i3] == a))
+            assert_(res.shape == self.tgtshape[(4 - ip, j)])
+            assert_(not res.flags['OWNDATA'])
+
+            # positive axis, negative start
+            jp = j + 1 if j < 4 else j
+            res = np.rollaxis(a, axis=i, start=-jp)
+            i0, i1, i2, i3 = aind[np.array(res.shape) - 1]
+            assert_(np.all(res[i0, i1, i2, i3] == a))
+            assert_(res.shape == self.tgtshape[(i, 4 - jp)])
+            assert_(not res.flags['OWNDATA'])
+
+            # negative axis, negative start
+            ip = i + 1
+            jp = j + 1 if j < 4 else j
+            res = np.rollaxis(a, axis=-ip, start=-jp)
+            i0, i1, i2, i3 = aind[np.array(res.shape) - 1]
+            assert_(np.all(res[i0, i1, i2, i3] == a))
+            assert_(res.shape == self.tgtshape[(4 - ip, 4 - jp)])
+            assert_(not res.flags['OWNDATA'])
+
+
+class TestMoveaxis:
+    def test_move_to_end(self):
+        x = np.random.randn(5, 6, 7)
+        for source, expected in [(0, (6, 7, 5)),
+                                 (1, (5, 7, 6)),
+                                 (2, (5, 6, 7)),
+                                 (-1, (5, 6, 7))]:
+            actual = np.moveaxis(x, source, -1).shape
+            assert_(actual, expected)
+
+    def test_move_new_position(self):
+        x = np.random.randn(1, 2, 3, 4)
+        for source, destination, expected in [
+                (0, 1, (2, 1, 3, 4)),
+                (1, 2, (1, 3, 2, 4)),
+                (1, -1, (1, 3, 4, 2)),
+                ]:
+            actual = np.moveaxis(x, source, destination).shape
+            assert_(actual, expected)
+
+    def test_preserve_order(self):
+        x = np.zeros((1, 2, 3, 4))
+        for source, destination in [
+                (0, 0),
+                (3, -1),
+                (-1, 3),
+                ([0, -1], [0, -1]),
+                ([2, 0], [2, 0]),
+                (range(4), range(4)),
+                ]:
+            actual = np.moveaxis(x, source, destination).shape
+            assert_(actual, (1, 2, 3, 4))
+
+    def test_move_multiples(self):
+        x = np.zeros((0, 1, 2, 3))
+        for source, destination, expected in [
+                ([0, 1], [2, 3], (2, 3, 0, 1)),
+                ([2, 3], [0, 1], (2, 3, 0, 1)),
+                ([0, 1, 2], [2, 3, 0], (2, 3, 0, 1)),
+                ([3, 0], [1, 0], (0, 3, 1, 2)),
+                ([0, 3], [0, 1], (0, 3, 1, 2)),
+                ]:
+            actual = np.moveaxis(x, source, destination).shape
+            assert_(actual, expected)
+
+    def test_errors(self):
+        x = np.random.randn(1, 2, 3)
+        assert_raises_regex(np.AxisError, 'source.*out of bounds',
+                            np.moveaxis, x, 3, 0)
+        assert_raises_regex(np.AxisError, 'source.*out of bounds',
+                            np.moveaxis, x, -4, 0)
+        assert_raises_regex(np.AxisError, 'destination.*out of bounds',
+                            np.moveaxis, x, 0, 5)
+        assert_raises_regex(ValueError, 'repeated axis in `source`',
+                            np.moveaxis, x, [0, 0], [0, 1])
+        assert_raises_regex(ValueError, 'repeated axis in `destination`',
+                            np.moveaxis, x, [0, 1], [1, 1])
+        assert_raises_regex(ValueError, 'must have the same number',
+                            np.moveaxis, x, 0, [0, 1])
+        assert_raises_regex(ValueError, 'must have the same number',
+                            np.moveaxis, x, [0, 1], [0])
+
+    def test_array_likes(self):
+        x = np.ma.zeros((1, 2, 3))
+        result = np.moveaxis(x, 0, 0)
+        assert_(x.shape, result.shape)
+        assert_(isinstance(result, np.ma.MaskedArray))
+
+        x = [1, 2, 3]
+        result = np.moveaxis(x, 0, 0)
+        assert_(x, list(result))
+        assert_(isinstance(result, np.ndarray))
+
+
+class TestCross:
+    def test_2x2(self):
+        u = [1, 2]
+        v = [3, 4]
+        z = -2
+        cp = np.cross(u, v)
+        assert_equal(cp, z)
+        cp = np.cross(v, u)
+        assert_equal(cp, -z)
+
+    def test_2x3(self):
+        u = [1, 2]
+        v = [3, 4, 5]
+        z = np.array([10, -5, -2])
+        cp = np.cross(u, v)
+        assert_equal(cp, z)
+        cp = np.cross(v, u)
+        assert_equal(cp, -z)
+
+    def test_3x3(self):
+        u = [1, 2, 3]
+        v = [4, 5, 6]
+        z = np.array([-3, 6, -3])
+        cp = np.cross(u, v)
+        assert_equal(cp, z)
+        cp = np.cross(v, u)
+        assert_equal(cp, -z)
+
+    def test_broadcasting(self):
+        # Ticket #2624 (Trac #2032)
+        u = np.tile([1, 2], (11, 1))
+        v = np.tile([3, 4], (11, 1))
+        z = -2
+        assert_equal(np.cross(u, v), z)
+        assert_equal(np.cross(v, u), -z)
+        assert_equal(np.cross(u, u), 0)
+
+        u = np.tile([1, 2], (11, 1)).T
+        v = np.tile([3, 4, 5], (11, 1))
+        z = np.tile([10, -5, -2], (11, 1))
+        assert_equal(np.cross(u, v, axisa=0), z)
+        assert_equal(np.cross(v, u.T), -z)
+        assert_equal(np.cross(v, v), 0)
+
+        u = np.tile([1, 2, 3], (11, 1)).T
+        v = np.tile([3, 4], (11, 1)).T
+        z = np.tile([-12, 9, -2], (11, 1))
+        assert_equal(np.cross(u, v, axisa=0, axisb=0), z)
+        assert_equal(np.cross(v.T, u.T), -z)
+        assert_equal(np.cross(u.T, u.T), 0)
+
+        u = np.tile([1, 2, 3], (5, 1))
+        v = np.tile([4, 5, 6], (5, 1)).T
+        z = np.tile([-3, 6, -3], (5, 1))
+        assert_equal(np.cross(u, v, axisb=0), z)
+        assert_equal(np.cross(v.T, u), -z)
+        assert_equal(np.cross(u, u), 0)
+
+    def test_broadcasting_shapes(self):
+        u = np.ones((2, 1, 3))
+        v = np.ones((5, 3))
+        assert_equal(np.cross(u, v).shape, (2, 5, 3))
+        u = np.ones((10, 3, 5))
+        v = np.ones((2, 5))
+        assert_equal(np.cross(u, v, axisa=1, axisb=0).shape, (10, 5, 3))
+        assert_raises(np.AxisError, np.cross, u, v, axisa=1, axisb=2)
+        assert_raises(np.AxisError, np.cross, u, v, axisa=3, axisb=0)
+        u = np.ones((10, 3, 5, 7))
+        v = np.ones((5, 7, 2))
+        assert_equal(np.cross(u, v, axisa=1, axisc=2).shape, (10, 5, 3, 7))
+        assert_raises(np.AxisError, np.cross, u, v, axisa=-5, axisb=2)
+        assert_raises(np.AxisError, np.cross, u, v, axisa=1, axisb=-4)
+        # gh-5885
+        u = np.ones((3, 4, 2))
+        for axisc in range(-2, 2):
+            assert_equal(np.cross(u, u, axisc=axisc).shape, (3, 4))
+
+
+def test_outer_out_param():
+    arr1 = np.ones((5,))
+    arr2 = np.ones((2,))
+    arr3 = np.linspace(-2, 2, 5)
+    out1 = np.ndarray(shape=(5,5))
+    out2 = np.ndarray(shape=(2, 5))
+    res1 = np.outer(arr1, arr3, out1)
+    assert_equal(res1, out1)
+    assert_equal(np.outer(arr2, arr3, out2), out2)
+
+
+class TestIndices:
+
+    def test_simple(self):
+        [x, y] = np.indices((4, 3))
+        assert_array_equal(x, np.array([[0, 0, 0],
+                                        [1, 1, 1],
+                                        [2, 2, 2],
+                                        [3, 3, 3]]))
+        assert_array_equal(y, np.array([[0, 1, 2],
+                                        [0, 1, 2],
+                                        [0, 1, 2],
+                                        [0, 1, 2]]))
+
+    def test_single_input(self):
+        [x] = np.indices((4,))
+        assert_array_equal(x, np.array([0, 1, 2, 3]))
+
+        [x] = np.indices((4,), sparse=True)
+        assert_array_equal(x, np.array([0, 1, 2, 3]))
+
+    def test_scalar_input(self):
+        assert_array_equal([], np.indices(()))
+        assert_array_equal([], np.indices((), sparse=True))
+        assert_array_equal([[]], np.indices((0,)))
+        assert_array_equal([[]], np.indices((0,), sparse=True))
+
+    def test_sparse(self):
+        [x, y] = np.indices((4,3), sparse=True)
+        assert_array_equal(x, np.array([[0], [1], [2], [3]]))
+        assert_array_equal(y, np.array([[0, 1, 2]]))
+
+    @pytest.mark.parametrize("dtype", [np.int32, np.int64, np.float32, np.float64])
+    @pytest.mark.parametrize("dims", [(), (0,), (4, 3)])
+    def test_return_type(self, dtype, dims):
+        inds = np.indices(dims, dtype=dtype)
+        assert_(inds.dtype == dtype)
+
+        for arr in np.indices(dims, dtype=dtype, sparse=True):
+            assert_(arr.dtype == dtype)
+
+
+class TestRequire:
+    flag_names = ['C', 'C_CONTIGUOUS', 'CONTIGUOUS',
+                  'F', 'F_CONTIGUOUS', 'FORTRAN',
+                  'A', 'ALIGNED',
+                  'W', 'WRITEABLE',
+                  'O', 'OWNDATA']
+
+    def generate_all_false(self, dtype):
+        arr = np.zeros((2, 2), [('junk', 'i1'), ('a', dtype)])
+        arr.setflags(write=False)
+        a = arr['a']
+        assert_(not a.flags['C'])
+        assert_(not a.flags['F'])
+        assert_(not a.flags['O'])
+        assert_(not a.flags['W'])
+        assert_(not a.flags['A'])
+        return a
+
+    def set_and_check_flag(self, flag, dtype, arr):
+        if dtype is None:
+            dtype = arr.dtype
+        b = np.require(arr, dtype, [flag])
+        assert_(b.flags[flag])
+        assert_(b.dtype == dtype)
+
+        # a further call to np.require ought to return the same array
+        # unless OWNDATA is specified.
+        c = np.require(b, None, [flag])
+        if flag[0] != 'O':
+            assert_(c is b)
+        else:
+            assert_(c.flags[flag])
+
+    def test_require_each(self):
+
+        id = ['f8', 'i4']
+        fd = [None, 'f8', 'c16']
+        for idtype, fdtype, flag in itertools.product(id, fd, self.flag_names):
+            a = self.generate_all_false(idtype)
+            self.set_and_check_flag(flag, fdtype,  a)
+
+    def test_unknown_requirement(self):
+        a = self.generate_all_false('f8')
+        assert_raises(KeyError, np.require, a, None, 'Q')
+
+    def test_non_array_input(self):
+        a = np.require([1, 2, 3, 4], 'i4', ['C', 'A', 'O'])
+        assert_(a.flags['O'])
+        assert_(a.flags['C'])
+        assert_(a.flags['A'])
+        assert_(a.dtype == 'i4')
+        assert_equal(a, [1, 2, 3, 4])
+
+    def test_C_and_F_simul(self):
+        a = self.generate_all_false('f8')
+        assert_raises(ValueError, np.require, a, None, ['C', 'F'])
+
+    def test_ensure_array(self):
+        class ArraySubclass(np.ndarray):
+            pass
+
+        a = ArraySubclass((2, 2))
+        b = np.require(a, None, ['E'])
+        assert_(type(b) is np.ndarray)
+
+    def test_preserve_subtype(self):
+        class ArraySubclass(np.ndarray):
+            pass
+
+        for flag in self.flag_names:
+            a = ArraySubclass((2, 2))
+            self.set_and_check_flag(flag, None, a)
+
+
+class TestBroadcast:
+    def test_broadcast_in_args(self):
+        # gh-5881
+        arrs = [np.empty((6, 7)), np.empty((5, 6, 1)), np.empty((7,)),
+                np.empty((5, 1, 7))]
+        mits = [np.broadcast(*arrs),
+                np.broadcast(np.broadcast(*arrs[:0]), np.broadcast(*arrs[0:])),
+                np.broadcast(np.broadcast(*arrs[:1]), np.broadcast(*arrs[1:])),
+                np.broadcast(np.broadcast(*arrs[:2]), np.broadcast(*arrs[2:])),
+                np.broadcast(arrs[0], np.broadcast(*arrs[1:-1]), arrs[-1])]
+        for mit in mits:
+            assert_equal(mit.shape, (5, 6, 7))
+            assert_equal(mit.ndim, 3)
+            assert_equal(mit.nd, 3)
+            assert_equal(mit.numiter, 4)
+            for a, ia in zip(arrs, mit.iters):
+                assert_(a is ia.base)
+
+    def test_broadcast_single_arg(self):
+        # gh-6899
+        arrs = [np.empty((5, 6, 7))]
+        mit = np.broadcast(*arrs)
+        assert_equal(mit.shape, (5, 6, 7))
+        assert_equal(mit.ndim, 3)
+        assert_equal(mit.nd, 3)
+        assert_equal(mit.numiter, 1)
+        assert_(arrs[0] is mit.iters[0].base)
+
+    def test_number_of_arguments(self):
+        arr = np.empty((5,))
+        for j in range(35):
+            arrs = [arr] * j
+            if j > 32:
+                assert_raises(ValueError, np.broadcast, *arrs)
+            else:
+                mit = np.broadcast(*arrs)
+                assert_equal(mit.numiter, j)
+
+    def test_broadcast_error_kwargs(self):
+        #gh-13455
+        arrs = [np.empty((5, 6, 7))]
+        mit  = np.broadcast(*arrs)
+        mit2 = np.broadcast(*arrs, **{})
+        assert_equal(mit.shape, mit2.shape)
+        assert_equal(mit.ndim, mit2.ndim)
+        assert_equal(mit.nd, mit2.nd)
+        assert_equal(mit.numiter, mit2.numiter)
+        assert_(mit.iters[0].base is mit2.iters[0].base)
+
+        assert_raises(ValueError, np.broadcast, 1, **{'x': 1})
+
+class TestKeepdims:
+
+    class sub_array(np.ndarray):
+        def sum(self, axis=None, dtype=None, out=None):
+            return np.ndarray.sum(self, axis, dtype, out, keepdims=True)
+
+    def test_raise(self):
+        sub_class = self.sub_array
+        x = np.arange(30).view(sub_class)
+        assert_raises(TypeError, np.sum, x, keepdims=True)
+
+
+class TestTensordot:
+
+    def test_zero_dimension(self):
+        # Test resolution to issue #5663
+        a = np.ndarray((3,0))
+        b = np.ndarray((0,4))
+        td = np.tensordot(a, b, (1, 0))
+        assert_array_equal(td, np.dot(a, b))
+        assert_array_equal(td, np.einsum('ij,jk', a, b))
+
+    def test_zero_dimensional(self):
+        # gh-12130
+        arr_0d = np.array(1)
+        ret = np.tensordot(arr_0d, arr_0d, ([], []))  # contracting no axes is well defined
+        assert_array_equal(ret, arr_0d)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_numerictypes.py b/venv/Lib/site-packages/numpy/core/tests/test_numerictypes.py
new file mode 100644
index 000000000..9cb00342d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_numerictypes.py
@@ -0,0 +1,554 @@
+import sys
+import itertools
+
+import pytest
+import numpy as np
+from numpy.testing import assert_, assert_equal, assert_raises, IS_PYPY
+
+# This is the structure of the table used for plain objects:
+#
+# +-+-+-+
+# |x|y|z|
+# +-+-+-+
+
+# Structure of a plain array description:
+Pdescr = [
+    ('x', 'i4', (2,)),
+    ('y', 'f8', (2, 2)),
+    ('z', 'u1')]
+
+# A plain list of tuples with values for testing:
+PbufferT = [
+    # x     y                  z
+    ([3, 2], [[6., 4.], [6., 4.]], 8),
+    ([4, 3], [[7., 5.], [7., 5.]], 9),
+    ]
+
+
+# This is the structure of the table used for nested objects (DON'T PANIC!):
+#
+# +-+---------------------------------+-----+----------+-+-+
+# |x|Info                             |color|info      |y|z|
+# | +-----+--+----------------+----+--+     +----+-----+ | |
+# | |value|y2|Info2           |name|z2|     |Name|Value| | |
+# | |     |  +----+-----+--+--+    |  |     |    |     | | |
+# | |     |  |name|value|y3|z3|    |  |     |    |     | | |
+# +-+-----+--+----+-----+--+--+----+--+-----+----+-----+-+-+
+#
+
+# The corresponding nested array description:
+Ndescr = [
+    ('x', 'i4', (2,)),
+    ('Info', [
+        ('value', 'c16'),
+        ('y2', 'f8'),
+        ('Info2', [
+            ('name', 'S2'),
+            ('value', 'c16', (2,)),
+            ('y3', 'f8', (2,)),
+            ('z3', 'u4', (2,))]),
+        ('name', 'S2'),
+        ('z2', 'b1')]),
+    ('color', 'S2'),
+    ('info', [
+        ('Name', 'U8'),
+        ('Value', 'c16')]),
+    ('y', 'f8', (2, 2)),
+    ('z', 'u1')]
+
+NbufferT = [
+    # x     Info                                                color info        y                  z
+    #       value y2 Info2                            name z2         Name Value
+    #                name   value    y3       z3
+    ([3, 2], (6j, 6., (b'nn', [6j, 4j], [6., 4.], [1, 2]), b'NN', True), b'cc', (u'NN', 6j), [[6., 4.], [6., 4.]], 8),
+    ([4, 3], (7j, 7., (b'oo', [7j, 5j], [7., 5.], [2, 1]), b'OO', False), b'dd', (u'OO', 7j), [[7., 5.], [7., 5.]], 9),
+    ]
+
+
+byteorder = {'little':'<', 'big':'>'}[sys.byteorder]
+
+def normalize_descr(descr):
+    "Normalize a description adding the platform byteorder."
+
+    out = []
+    for item in descr:
+        dtype = item[1]
+        if isinstance(dtype, str):
+            if dtype[0] not in ['|', '<', '>']:
+                onebyte = dtype[1:] == "1"
+                if onebyte or dtype[0] in ['S', 'V', 'b']:
+                    dtype = "|" + dtype
+                else:
+                    dtype = byteorder + dtype
+            if len(item) > 2 and np.prod(item[2]) > 1:
+                nitem = (item[0], dtype, item[2])
+            else:
+                nitem = (item[0], dtype)
+            out.append(nitem)
+        elif isinstance(dtype, list):
+            l = normalize_descr(dtype)
+            out.append((item[0], l))
+        else:
+            raise ValueError("Expected a str or list and got %s" %
+                             (type(item)))
+    return out
+
+
+############################################################
+#    Creation tests
+############################################################
+
+class CreateZeros:
+    """Check the creation of heterogeneous arrays zero-valued"""
+
+    def test_zeros0D(self):
+        """Check creation of 0-dimensional objects"""
+        h = np.zeros((), dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        assert_(h.dtype.fields['x'][0].name[:4] == 'void')
+        assert_(h.dtype.fields['x'][0].char == 'V')
+        assert_(h.dtype.fields['x'][0].type == np.void)
+        # A small check that data is ok
+        assert_equal(h['z'], np.zeros((), dtype='u1'))
+
+    def test_zerosSD(self):
+        """Check creation of single-dimensional objects"""
+        h = np.zeros((2,), dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        assert_(h.dtype['y'].name[:4] == 'void')
+        assert_(h.dtype['y'].char == 'V')
+        assert_(h.dtype['y'].type == np.void)
+        # A small check that data is ok
+        assert_equal(h['z'], np.zeros((2,), dtype='u1'))
+
+    def test_zerosMD(self):
+        """Check creation of multi-dimensional objects"""
+        h = np.zeros((2, 3), dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        assert_(h.dtype['z'].name == 'uint8')
+        assert_(h.dtype['z'].char == 'B')
+        assert_(h.dtype['z'].type == np.uint8)
+        # A small check that data is ok
+        assert_equal(h['z'], np.zeros((2, 3), dtype='u1'))
+
+
+class TestCreateZerosPlain(CreateZeros):
+    """Check the creation of heterogeneous arrays zero-valued (plain)"""
+    _descr = Pdescr
+
+class TestCreateZerosNested(CreateZeros):
+    """Check the creation of heterogeneous arrays zero-valued (nested)"""
+    _descr = Ndescr
+
+
+class CreateValues:
+    """Check the creation of heterogeneous arrays with values"""
+
+    def test_tuple(self):
+        """Check creation from tuples"""
+        h = np.array(self._buffer, dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        if self.multiple_rows:
+            assert_(h.shape == (2,))
+        else:
+            assert_(h.shape == ())
+
+    def test_list_of_tuple(self):
+        """Check creation from list of tuples"""
+        h = np.array([self._buffer], dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        if self.multiple_rows:
+            assert_(h.shape == (1, 2))
+        else:
+            assert_(h.shape == (1,))
+
+    def test_list_of_list_of_tuple(self):
+        """Check creation from list of list of tuples"""
+        h = np.array([[self._buffer]], dtype=self._descr)
+        assert_(normalize_descr(self._descr) == h.dtype.descr)
+        if self.multiple_rows:
+            assert_(h.shape == (1, 1, 2))
+        else:
+            assert_(h.shape == (1, 1))
+
+
+class TestCreateValuesPlainSingle(CreateValues):
+    """Check the creation of heterogeneous arrays (plain, single row)"""
+    _descr = Pdescr
+    multiple_rows = 0
+    _buffer = PbufferT[0]
+
+class TestCreateValuesPlainMultiple(CreateValues):
+    """Check the creation of heterogeneous arrays (plain, multiple rows)"""
+    _descr = Pdescr
+    multiple_rows = 1
+    _buffer = PbufferT
+
+class TestCreateValuesNestedSingle(CreateValues):
+    """Check the creation of heterogeneous arrays (nested, single row)"""
+    _descr = Ndescr
+    multiple_rows = 0
+    _buffer = NbufferT[0]
+
+class TestCreateValuesNestedMultiple(CreateValues):
+    """Check the creation of heterogeneous arrays (nested, multiple rows)"""
+    _descr = Ndescr
+    multiple_rows = 1
+    _buffer = NbufferT
+
+
+############################################################
+#    Reading tests
+############################################################
+
+class ReadValuesPlain:
+    """Check the reading of values in heterogeneous arrays (plain)"""
+
+    def test_access_fields(self):
+        h = np.array(self._buffer, dtype=self._descr)
+        if not self.multiple_rows:
+            assert_(h.shape == ())
+            assert_equal(h['x'], np.array(self._buffer[0], dtype='i4'))
+            assert_equal(h['y'], np.array(self._buffer[1], dtype='f8'))
+            assert_equal(h['z'], np.array(self._buffer[2], dtype='u1'))
+        else:
+            assert_(len(h) == 2)
+            assert_equal(h['x'], np.array([self._buffer[0][0],
+                                             self._buffer[1][0]], dtype='i4'))
+            assert_equal(h['y'], np.array([self._buffer[0][1],
+                                             self._buffer[1][1]], dtype='f8'))
+            assert_equal(h['z'], np.array([self._buffer[0][2],
+                                             self._buffer[1][2]], dtype='u1'))
+
+
+class TestReadValuesPlainSingle(ReadValuesPlain):
+    """Check the creation of heterogeneous arrays (plain, single row)"""
+    _descr = Pdescr
+    multiple_rows = 0
+    _buffer = PbufferT[0]
+
+class TestReadValuesPlainMultiple(ReadValuesPlain):
+    """Check the values of heterogeneous arrays (plain, multiple rows)"""
+    _descr = Pdescr
+    multiple_rows = 1
+    _buffer = PbufferT
+
+class ReadValuesNested:
+    """Check the reading of values in heterogeneous arrays (nested)"""
+
+    def test_access_top_fields(self):
+        """Check reading the top fields of a nested array"""
+        h = np.array(self._buffer, dtype=self._descr)
+        if not self.multiple_rows:
+            assert_(h.shape == ())
+            assert_equal(h['x'], np.array(self._buffer[0], dtype='i4'))
+            assert_equal(h['y'], np.array(self._buffer[4], dtype='f8'))
+            assert_equal(h['z'], np.array(self._buffer[5], dtype='u1'))
+        else:
+            assert_(len(h) == 2)
+            assert_equal(h['x'], np.array([self._buffer[0][0],
+                                           self._buffer[1][0]], dtype='i4'))
+            assert_equal(h['y'], np.array([self._buffer[0][4],
+                                           self._buffer[1][4]], dtype='f8'))
+            assert_equal(h['z'], np.array([self._buffer[0][5],
+                                           self._buffer[1][5]], dtype='u1'))
+
+    def test_nested1_acessors(self):
+        """Check reading the nested fields of a nested array (1st level)"""
+        h = np.array(self._buffer, dtype=self._descr)
+        if not self.multiple_rows:
+            assert_equal(h['Info']['value'],
+                         np.array(self._buffer[1][0], dtype='c16'))
+            assert_equal(h['Info']['y2'],
+                         np.array(self._buffer[1][1], dtype='f8'))
+            assert_equal(h['info']['Name'],
+                         np.array(self._buffer[3][0], dtype='U2'))
+            assert_equal(h['info']['Value'],
+                         np.array(self._buffer[3][1], dtype='c16'))
+        else:
+            assert_equal(h['Info']['value'],
+                         np.array([self._buffer[0][1][0],
+                                self._buffer[1][1][0]],
+                                dtype='c16'))
+            assert_equal(h['Info']['y2'],
+                         np.array([self._buffer[0][1][1],
+                                self._buffer[1][1][1]],
+                                dtype='f8'))
+            assert_equal(h['info']['Name'],
+                         np.array([self._buffer[0][3][0],
+                                self._buffer[1][3][0]],
+                               dtype='U2'))
+            assert_equal(h['info']['Value'],
+                         np.array([self._buffer[0][3][1],
+                                self._buffer[1][3][1]],
+                               dtype='c16'))
+
+    def test_nested2_acessors(self):
+        """Check reading the nested fields of a nested array (2nd level)"""
+        h = np.array(self._buffer, dtype=self._descr)
+        if not self.multiple_rows:
+            assert_equal(h['Info']['Info2']['value'],
+                         np.array(self._buffer[1][2][1], dtype='c16'))
+            assert_equal(h['Info']['Info2']['z3'],
+                         np.array(self._buffer[1][2][3], dtype='u4'))
+        else:
+            assert_equal(h['Info']['Info2']['value'],
+                         np.array([self._buffer[0][1][2][1],
+                                self._buffer[1][1][2][1]],
+                               dtype='c16'))
+            assert_equal(h['Info']['Info2']['z3'],
+                         np.array([self._buffer[0][1][2][3],
+                                self._buffer[1][1][2][3]],
+                               dtype='u4'))
+
+    def test_nested1_descriptor(self):
+        """Check access nested descriptors of a nested array (1st level)"""
+        h = np.array(self._buffer, dtype=self._descr)
+        assert_(h.dtype['Info']['value'].name == 'complex128')
+        assert_(h.dtype['Info']['y2'].name == 'float64')
+        assert_(h.dtype['info']['Name'].name == 'str256')
+        assert_(h.dtype['info']['Value'].name == 'complex128')
+
+    def test_nested2_descriptor(self):
+        """Check access nested descriptors of a nested array (2nd level)"""
+        h = np.array(self._buffer, dtype=self._descr)
+        assert_(h.dtype['Info']['Info2']['value'].name == 'void256')
+        assert_(h.dtype['Info']['Info2']['z3'].name == 'void64')
+
+
+class TestReadValuesNestedSingle(ReadValuesNested):
+    """Check the values of heterogeneous arrays (nested, single row)"""
+    _descr = Ndescr
+    multiple_rows = False
+    _buffer = NbufferT[0]
+
+class TestReadValuesNestedMultiple(ReadValuesNested):
+    """Check the values of heterogeneous arrays (nested, multiple rows)"""
+    _descr = Ndescr
+    multiple_rows = True
+    _buffer = NbufferT
+
+class TestEmptyField:
+    def test_assign(self):
+        a = np.arange(10, dtype=np.float32)
+        a.dtype = [("int",   "<0i4"), ("float", "<2f4")]
+        assert_(a['int'].shape == (5, 0))
+        assert_(a['float'].shape == (5, 2))
+
+class TestCommonType:
+    def test_scalar_loses1(self):
+        res = np.find_common_type(['f4', 'f4', 'i2'], ['f8'])
+        assert_(res == 'f4')
+
+    def test_scalar_loses2(self):
+        res = np.find_common_type(['f4', 'f4'], ['i8'])
+        assert_(res == 'f4')
+
+    def test_scalar_wins(self):
+        res = np.find_common_type(['f4', 'f4', 'i2'], ['c8'])
+        assert_(res == 'c8')
+
+    def test_scalar_wins2(self):
+        res = np.find_common_type(['u4', 'i4', 'i4'], ['f4'])
+        assert_(res == 'f8')
+
+    def test_scalar_wins3(self):  # doesn't go up to 'f16' on purpose
+        res = np.find_common_type(['u8', 'i8', 'i8'], ['f8'])
+        assert_(res == 'f8')
+
+class TestMultipleFields:
+    def setup(self):
+        self.ary = np.array([(1, 2, 3, 4), (5, 6, 7, 8)], dtype='i4,f4,i2,c8')
+
+    def _bad_call(self):
+        return self.ary['f0', 'f1']
+
+    def test_no_tuple(self):
+        assert_raises(IndexError, self._bad_call)
+
+    def test_return(self):
+        res = self.ary[['f0', 'f2']].tolist()
+        assert_(res == [(1, 3), (5, 7)])
+
+
+class TestIsSubDType:
+    # scalar types can be promoted into dtypes
+    wrappers = [np.dtype, lambda x: x]
+
+    def test_both_abstract(self):
+        assert_(np.issubdtype(np.floating, np.inexact))
+        assert_(not np.issubdtype(np.inexact, np.floating))
+
+    def test_same(self):
+        for cls in (np.float32, np.int32):
+            for w1, w2 in itertools.product(self.wrappers, repeat=2):
+                assert_(np.issubdtype(w1(cls), w2(cls)))
+
+    def test_subclass(self):
+        # note we cannot promote floating to a dtype, as it would turn into a
+        # concrete type
+        for w in self.wrappers:
+            assert_(np.issubdtype(w(np.float32), np.floating))
+            assert_(np.issubdtype(w(np.float64), np.floating))
+
+    def test_subclass_backwards(self):
+        for w in self.wrappers:
+            assert_(not np.issubdtype(np.floating, w(np.float32)))
+            assert_(not np.issubdtype(np.floating, w(np.float64)))
+
+    def test_sibling_class(self):
+        for w1, w2 in itertools.product(self.wrappers, repeat=2):
+            assert_(not np.issubdtype(w1(np.float32), w2(np.float64)))
+            assert_(not np.issubdtype(w1(np.float64), w2(np.float32)))
+
+    def test_nondtype_nonscalartype(self):
+        # See gh-14619 and gh-9505 which introduced the deprecation to fix
+        # this. These tests are directly taken from gh-9505
+        assert not np.issubdtype(np.float32, 'float64')
+        assert not np.issubdtype(np.float32, 'f8')
+        assert not np.issubdtype(np.int32, str)
+        assert not np.issubdtype(np.int32, 'int64')
+        assert not np.issubdtype(np.str_, 'void')
+        # for the following the correct spellings are
+        # np.integer, np.floating, or np.complexfloating respectively:
+        assert not np.issubdtype(np.int8, int)  # np.int8 is never np.int_
+        assert not np.issubdtype(np.float32, float)
+        assert not np.issubdtype(np.complex64, complex)
+        assert not np.issubdtype(np.float32, "float")
+        assert not np.issubdtype(np.float64, "f")
+
+        # Test the same for the correct first datatype and abstract one
+        # in the case of int, float, complex:
+        assert np.issubdtype(np.float64, 'float64')
+        assert np.issubdtype(np.float64, 'f8')
+        assert np.issubdtype(np.str_, str)
+        assert np.issubdtype(np.int64, 'int64')
+        assert np.issubdtype(np.void, 'void')
+        assert np.issubdtype(np.int8, np.integer)
+        assert np.issubdtype(np.float32, np.floating)
+        assert np.issubdtype(np.complex64, np.complexfloating)
+        assert np.issubdtype(np.float64, "float")
+        assert np.issubdtype(np.float32, "f")
+
+
+class TestSctypeDict:
+    def test_longdouble(self):
+        assert_(np.sctypeDict['f8'] is not np.longdouble)
+        assert_(np.sctypeDict['c16'] is not np.clongdouble)
+
+
+class TestBitName:
+    def test_abstract(self):
+        assert_raises(ValueError, np.core.numerictypes.bitname, np.floating)
+
+
+class TestMaximumSctype:
+
+    # note that parametrizing with sctype['int'] and similar would skip types
+    # with the same size (gh-11923)
+
+    @pytest.mark.parametrize('t', [np.byte, np.short, np.intc, np.int_, np.longlong])
+    def test_int(self, t):
+        assert_equal(np.maximum_sctype(t), np.sctypes['int'][-1])
+
+    @pytest.mark.parametrize('t', [np.ubyte, np.ushort, np.uintc, np.uint, np.ulonglong])
+    def test_uint(self, t):
+        assert_equal(np.maximum_sctype(t), np.sctypes['uint'][-1])
+
+    @pytest.mark.parametrize('t', [np.half, np.single, np.double, np.longdouble])
+    def test_float(self, t):
+        assert_equal(np.maximum_sctype(t), np.sctypes['float'][-1])
+
+    @pytest.mark.parametrize('t', [np.csingle, np.cdouble, np.clongdouble])
+    def test_complex(self, t):
+        assert_equal(np.maximum_sctype(t), np.sctypes['complex'][-1])
+
+    @pytest.mark.parametrize('t', [np.bool_, np.object_, np.unicode_, np.bytes_, np.void])
+    def test_other(self, t):
+        assert_equal(np.maximum_sctype(t), t)
+
+
+class Test_sctype2char:
+    # This function is old enough that we're really just documenting the quirks
+    # at this point.
+
+    def test_scalar_type(self):
+        assert_equal(np.sctype2char(np.double), 'd')
+        assert_equal(np.sctype2char(np.int_), 'l')
+        assert_equal(np.sctype2char(np.unicode_), 'U')
+        assert_equal(np.sctype2char(np.bytes_), 'S')
+
+    def test_other_type(self):
+        assert_equal(np.sctype2char(float), 'd')
+        assert_equal(np.sctype2char(list), 'O')
+        assert_equal(np.sctype2char(np.ndarray), 'O')
+
+    def test_third_party_scalar_type(self):
+        from numpy.core._rational_tests import rational
+        assert_raises(KeyError, np.sctype2char, rational)
+        assert_raises(KeyError, np.sctype2char, rational(1))
+
+    def test_array_instance(self):
+        assert_equal(np.sctype2char(np.array([1.0, 2.0])), 'd')
+
+    def test_abstract_type(self):
+        assert_raises(KeyError, np.sctype2char, np.floating)
+
+    def test_non_type(self):
+        assert_raises(ValueError, np.sctype2char, 1)
+
+@pytest.mark.parametrize("rep, expected", [
+    (np.int32, True),
+    (list, False),
+    (1.1, False),
+    (str, True),
+    (np.dtype(np.float64), True),
+    (np.dtype((np.int16, (3, 4))), True),
+    (np.dtype([('a', np.int8)]), True),
+    ])
+def test_issctype(rep, expected):
+    # ensure proper identification of scalar
+    # data-types by issctype()
+    actual = np.issctype(rep)
+    assert_equal(actual, expected)
+
+
+@pytest.mark.skipif(sys.flags.optimize > 1,
+                    reason="no docstrings present to inspect when PYTHONOPTIMIZE/Py_OptimizeFlag > 1")
+@pytest.mark.xfail(IS_PYPY,
+                   reason="PyPy cannot modify tp_doc after PyType_Ready")
+class TestDocStrings:
+    def test_platform_dependent_aliases(self):
+        if np.int64 is np.int_:
+            assert_('int64' in np.int_.__doc__)
+        elif np.int64 is np.longlong:
+            assert_('int64' in np.longlong.__doc__)
+
+
+class TestScalarTypeNames:
+    # gh-9799
+
+    numeric_types = [
+        np.byte, np.short, np.intc, np.int_, np.longlong,
+        np.ubyte, np.ushort, np.uintc, np.uint, np.ulonglong,
+        np.half, np.single, np.double, np.longdouble,
+        np.csingle, np.cdouble, np.clongdouble,
+    ]
+
+    def test_names_are_unique(self):
+        # none of the above may be aliases for each other
+        assert len(set(self.numeric_types)) == len(self.numeric_types)
+
+        # names must be unique
+        names = [t.__name__ for t in self.numeric_types]
+        assert len(set(names)) == len(names)
+
+    @pytest.mark.parametrize('t', numeric_types)
+    def test_names_reflect_attributes(self, t):
+        """ Test that names correspond to where the type is under ``np.`` """
+        assert getattr(np, t.__name__) is t
+
+    @pytest.mark.parametrize('t', numeric_types)
+    def test_names_are_undersood_by_dtype(self, t):
+        """ Test the dtype constructor maps names back to the type """
+        assert np.dtype(t.__name__).type is t
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_overrides.py b/venv/Lib/site-packages/numpy/core/tests/test_overrides.py
new file mode 100644
index 000000000..7e73d8c03
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_overrides.py
@@ -0,0 +1,427 @@
+import inspect
+import sys
+from unittest import mock
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_raises_regex)
+from numpy.core.overrides import (
+    _get_implementing_args, array_function_dispatch,
+    verify_matching_signatures, ARRAY_FUNCTION_ENABLED)
+from numpy.compat import pickle
+import pytest
+
+
+requires_array_function = pytest.mark.skipif(
+    not ARRAY_FUNCTION_ENABLED,
+    reason="__array_function__ dispatch not enabled.")
+
+
+def _return_not_implemented(self, *args, **kwargs):
+    return NotImplemented
+
+
+# need to define this at the top level to test pickling
+@array_function_dispatch(lambda array: (array,))
+def dispatched_one_arg(array):
+    """Docstring."""
+    return 'original'
+
+
+@array_function_dispatch(lambda array1, array2: (array1, array2))
+def dispatched_two_arg(array1, array2):
+    """Docstring."""
+    return 'original'
+
+
+class TestGetImplementingArgs:
+
+    def test_ndarray(self):
+        array = np.array(1)
+
+        args = _get_implementing_args([array])
+        assert_equal(list(args), [array])
+
+        args = _get_implementing_args([array, array])
+        assert_equal(list(args), [array])
+
+        args = _get_implementing_args([array, 1])
+        assert_equal(list(args), [array])
+
+        args = _get_implementing_args([1, array])
+        assert_equal(list(args), [array])
+
+    def test_ndarray_subclasses(self):
+
+        class OverrideSub(np.ndarray):
+            __array_function__ = _return_not_implemented
+
+        class NoOverrideSub(np.ndarray):
+            pass
+
+        array = np.array(1).view(np.ndarray)
+        override_sub = np.array(1).view(OverrideSub)
+        no_override_sub = np.array(1).view(NoOverrideSub)
+
+        args = _get_implementing_args([array, override_sub])
+        assert_equal(list(args), [override_sub, array])
+
+        args = _get_implementing_args([array, no_override_sub])
+        assert_equal(list(args), [no_override_sub, array])
+
+        args = _get_implementing_args(
+            [override_sub, no_override_sub])
+        assert_equal(list(args), [override_sub, no_override_sub])
+
+    def test_ndarray_and_duck_array(self):
+
+        class Other:
+            __array_function__ = _return_not_implemented
+
+        array = np.array(1)
+        other = Other()
+
+        args = _get_implementing_args([other, array])
+        assert_equal(list(args), [other, array])
+
+        args = _get_implementing_args([array, other])
+        assert_equal(list(args), [array, other])
+
+    def test_ndarray_subclass_and_duck_array(self):
+
+        class OverrideSub(np.ndarray):
+            __array_function__ = _return_not_implemented
+
+        class Other:
+            __array_function__ = _return_not_implemented
+
+        array = np.array(1)
+        subarray = np.array(1).view(OverrideSub)
+        other = Other()
+
+        assert_equal(_get_implementing_args([array, subarray, other]),
+                     [subarray, array, other])
+        assert_equal(_get_implementing_args([array, other, subarray]),
+                     [subarray, array, other])
+
+    def test_many_duck_arrays(self):
+
+        class A:
+            __array_function__ = _return_not_implemented
+
+        class B(A):
+            __array_function__ = _return_not_implemented
+
+        class C(A):
+            __array_function__ = _return_not_implemented
+
+        class D:
+            __array_function__ = _return_not_implemented
+
+        a = A()
+        b = B()
+        c = C()
+        d = D()
+
+        assert_equal(_get_implementing_args([1]), [])
+        assert_equal(_get_implementing_args([a]), [a])
+        assert_equal(_get_implementing_args([a, 1]), [a])
+        assert_equal(_get_implementing_args([a, a, a]), [a])
+        assert_equal(_get_implementing_args([a, d, a]), [a, d])
+        assert_equal(_get_implementing_args([a, b]), [b, a])
+        assert_equal(_get_implementing_args([b, a]), [b, a])
+        assert_equal(_get_implementing_args([a, b, c]), [b, c, a])
+        assert_equal(_get_implementing_args([a, c, b]), [c, b, a])
+
+    def test_too_many_duck_arrays(self):
+        namespace = dict(__array_function__=_return_not_implemented)
+        types = [type('A' + str(i), (object,), namespace) for i in range(33)]
+        relevant_args = [t() for t in types]
+
+        actual = _get_implementing_args(relevant_args[:32])
+        assert_equal(actual, relevant_args[:32])
+
+        with assert_raises_regex(TypeError, 'distinct argument types'):
+            _get_implementing_args(relevant_args)
+
+
+class TestNDArrayArrayFunction:
+
+    @requires_array_function
+    def test_method(self):
+
+        class Other:
+            __array_function__ = _return_not_implemented
+
+        class NoOverrideSub(np.ndarray):
+            pass
+
+        class OverrideSub(np.ndarray):
+            __array_function__ = _return_not_implemented
+
+        array = np.array([1])
+        other = Other()
+        no_override_sub = array.view(NoOverrideSub)
+        override_sub = array.view(OverrideSub)
+
+        result = array.__array_function__(func=dispatched_two_arg,
+                                          types=(np.ndarray,),
+                                          args=(array, 1.), kwargs={})
+        assert_equal(result, 'original')
+
+        result = array.__array_function__(func=dispatched_two_arg,
+                                          types=(np.ndarray, Other),
+                                          args=(array, other), kwargs={})
+        assert_(result is NotImplemented)
+
+        result = array.__array_function__(func=dispatched_two_arg,
+                                          types=(np.ndarray, NoOverrideSub),
+                                          args=(array, no_override_sub),
+                                          kwargs={})
+        assert_equal(result, 'original')
+
+        result = array.__array_function__(func=dispatched_two_arg,
+                                          types=(np.ndarray, OverrideSub),
+                                          args=(array, override_sub),
+                                          kwargs={})
+        assert_equal(result, 'original')
+
+        with assert_raises_regex(TypeError, 'no implementation found'):
+            np.concatenate((array, other))
+
+        expected = np.concatenate((array, array))
+        result = np.concatenate((array, no_override_sub))
+        assert_equal(result, expected.view(NoOverrideSub))
+        result = np.concatenate((array, override_sub))
+        assert_equal(result, expected.view(OverrideSub))
+
+    def test_no_wrapper(self):
+        # This shouldn't happen unless a user intentionally calls
+        # __array_function__ with invalid arguments, but check that we raise
+        # an appropriate error all the same.
+        array = np.array(1)
+        func = lambda x: x
+        with assert_raises_regex(AttributeError, '_implementation'):
+            array.__array_function__(func=func, types=(np.ndarray,),
+                                     args=(array,), kwargs={})
+
+
+@requires_array_function
+class TestArrayFunctionDispatch:
+
+    def test_pickle(self):
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            roundtripped = pickle.loads(
+                    pickle.dumps(dispatched_one_arg, protocol=proto))
+            assert_(roundtripped is dispatched_one_arg)
+
+    def test_name_and_docstring(self):
+        assert_equal(dispatched_one_arg.__name__, 'dispatched_one_arg')
+        if sys.flags.optimize < 2:
+            assert_equal(dispatched_one_arg.__doc__, 'Docstring.')
+
+    def test_interface(self):
+
+        class MyArray:
+            def __array_function__(self, func, types, args, kwargs):
+                return (self, func, types, args, kwargs)
+
+        original = MyArray()
+        (obj, func, types, args, kwargs) = dispatched_one_arg(original)
+        assert_(obj is original)
+        assert_(func is dispatched_one_arg)
+        assert_equal(set(types), {MyArray})
+        # assert_equal uses the overloaded np.iscomplexobj() internally
+        assert_(args == (original,))
+        assert_equal(kwargs, {})
+
+    def test_not_implemented(self):
+
+        class MyArray:
+            def __array_function__(self, func, types, args, kwargs):
+                return NotImplemented
+
+        array = MyArray()
+        with assert_raises_regex(TypeError, 'no implementation found'):
+            dispatched_one_arg(array)
+
+
+@requires_array_function
+class TestVerifyMatchingSignatures:
+
+    def test_verify_matching_signatures(self):
+
+        verify_matching_signatures(lambda x: 0, lambda x: 0)
+        verify_matching_signatures(lambda x=None: 0, lambda x=None: 0)
+        verify_matching_signatures(lambda x=1: 0, lambda x=None: 0)
+
+        with assert_raises(RuntimeError):
+            verify_matching_signatures(lambda a: 0, lambda b: 0)
+        with assert_raises(RuntimeError):
+            verify_matching_signatures(lambda x: 0, lambda x=None: 0)
+        with assert_raises(RuntimeError):
+            verify_matching_signatures(lambda x=None: 0, lambda y=None: 0)
+        with assert_raises(RuntimeError):
+            verify_matching_signatures(lambda x=1: 0, lambda y=1: 0)
+
+    def test_array_function_dispatch(self):
+
+        with assert_raises(RuntimeError):
+            @array_function_dispatch(lambda x: (x,))
+            def f(y):
+                pass
+
+        # should not raise
+        @array_function_dispatch(lambda x: (x,), verify=False)
+        def f(y):
+            pass
+
+
+def _new_duck_type_and_implements():
+    """Create a duck array type and implements functions."""
+    HANDLED_FUNCTIONS = {}
+
+    class MyArray:
+        def __array_function__(self, func, types, args, kwargs):
+            if func not in HANDLED_FUNCTIONS:
+                return NotImplemented
+            if not all(issubclass(t, MyArray) for t in types):
+                return NotImplemented
+            return HANDLED_FUNCTIONS[func](*args, **kwargs)
+
+    def implements(numpy_function):
+        """Register an __array_function__ implementations."""
+        def decorator(func):
+            HANDLED_FUNCTIONS[numpy_function] = func
+            return func
+        return decorator
+
+    return (MyArray, implements)
+
+
+@requires_array_function
+class TestArrayFunctionImplementation:
+
+    def test_one_arg(self):
+        MyArray, implements = _new_duck_type_and_implements()
+
+        @implements(dispatched_one_arg)
+        def _(array):
+            return 'myarray'
+
+        assert_equal(dispatched_one_arg(1), 'original')
+        assert_equal(dispatched_one_arg(MyArray()), 'myarray')
+
+    def test_optional_args(self):
+        MyArray, implements = _new_duck_type_and_implements()
+
+        @array_function_dispatch(lambda array, option=None: (array,))
+        def func_with_option(array, option='default'):
+            return option
+
+        @implements(func_with_option)
+        def my_array_func_with_option(array, new_option='myarray'):
+            return new_option
+
+        # we don't need to implement every option on __array_function__
+        # implementations
+        assert_equal(func_with_option(1), 'default')
+        assert_equal(func_with_option(1, option='extra'), 'extra')
+        assert_equal(func_with_option(MyArray()), 'myarray')
+        with assert_raises(TypeError):
+            func_with_option(MyArray(), option='extra')
+
+        # but new options on implementations can't be used
+        result = my_array_func_with_option(MyArray(), new_option='yes')
+        assert_equal(result, 'yes')
+        with assert_raises(TypeError):
+            func_with_option(MyArray(), new_option='no')
+
+    def test_not_implemented(self):
+        MyArray, implements = _new_duck_type_and_implements()
+
+        @array_function_dispatch(lambda array: (array,), module='my')
+        def func(array):
+            return array
+
+        array = np.array(1)
+        assert_(func(array) is array)
+        assert_equal(func.__module__, 'my')
+
+        with assert_raises_regex(
+                TypeError, "no implementation found for 'my.func'"):
+            func(MyArray())
+
+
+class TestNDArrayMethods:
+
+    def test_repr(self):
+        # gh-12162: should still be defined even if __array_function__ doesn't
+        # implement np.array_repr()
+
+        class MyArray(np.ndarray):
+            def __array_function__(*args, **kwargs):
+                return NotImplemented
+
+        array = np.array(1).view(MyArray)
+        assert_equal(repr(array), 'MyArray(1)')
+        assert_equal(str(array), '1')
+
+
+class TestNumPyFunctions:
+
+    def test_set_module(self):
+        assert_equal(np.sum.__module__, 'numpy')
+        assert_equal(np.char.equal.__module__, 'numpy.char')
+        assert_equal(np.fft.fft.__module__, 'numpy.fft')
+        assert_equal(np.linalg.solve.__module__, 'numpy.linalg')
+
+    def test_inspect_sum(self):
+        signature = inspect.signature(np.sum)
+        assert_('axis' in signature.parameters)
+
+    @requires_array_function
+    def test_override_sum(self):
+        MyArray, implements = _new_duck_type_and_implements()
+
+        @implements(np.sum)
+        def _(array):
+            return 'yes'
+
+        assert_equal(np.sum(MyArray()), 'yes')
+
+    @requires_array_function
+    def test_sum_on_mock_array(self):
+
+        # We need a proxy for mocks because __array_function__ is only looked
+        # up in the class dict
+        class ArrayProxy:
+            def __init__(self, value):
+                self.value = value
+            def __array_function__(self, *args, **kwargs):
+                return self.value.__array_function__(*args, **kwargs)
+            def __array__(self, *args, **kwargs):
+                return self.value.__array__(*args, **kwargs)
+
+        proxy = ArrayProxy(mock.Mock(spec=ArrayProxy))
+        proxy.value.__array_function__.return_value = 1
+        result = np.sum(proxy)
+        assert_equal(result, 1)
+        proxy.value.__array_function__.assert_called_once_with(
+            np.sum, (ArrayProxy,), (proxy,), {})
+        proxy.value.__array__.assert_not_called()
+
+    @requires_array_function
+    def test_sum_forwarding_implementation(self):
+
+        class MyArray(np.ndarray):
+
+            def sum(self, axis, out):
+                return 'summed'
+
+            def __array_function__(self, func, types, args, kwargs):
+                return super().__array_function__(func, types, args, kwargs)
+
+        # note: the internal implementation of np.sum() calls the .sum() method
+        array = np.array(1).view(MyArray)
+        assert_equal(np.sum(array), 'summed')
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_print.py b/venv/Lib/site-packages/numpy/core/tests/test_print.py
new file mode 100644
index 000000000..89a8b48bf
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_print.py
@@ -0,0 +1,200 @@
+import sys
+
+import pytest
+
+import numpy as np
+from numpy.testing import assert_, assert_equal
+from numpy.core.tests._locales import CommaDecimalPointLocale
+
+
+from io import StringIO
+
+_REF = {np.inf: 'inf', -np.inf: '-inf', np.nan: 'nan'}
+
+
+@pytest.mark.parametrize('tp', [np.float32, np.double, np.longdouble])
+def test_float_types(tp):
+    """ Check formatting.
+
+        This is only for the str function, and only for simple types.
+        The precision of np.float32 and np.longdouble aren't the same as the
+        python float precision.
+
+    """
+    for x in [0, 1, -1, 1e20]:
+        assert_equal(str(tp(x)), str(float(x)),
+                     err_msg='Failed str formatting for type %s' % tp)
+
+    if tp(1e16).itemsize > 4:
+        assert_equal(str(tp(1e16)), str(float('1e16')),
+                     err_msg='Failed str formatting for type %s' % tp)
+    else:
+        ref = '1e+16'
+        assert_equal(str(tp(1e16)), ref,
+                     err_msg='Failed str formatting for type %s' % tp)
+
+
+@pytest.mark.parametrize('tp', [np.float32, np.double, np.longdouble])
+def test_nan_inf_float(tp):
+    """ Check formatting of nan & inf.
+
+        This is only for the str function, and only for simple types.
+        The precision of np.float32 and np.longdouble aren't the same as the
+        python float precision.
+
+    """
+    for x in [np.inf, -np.inf, np.nan]:
+        assert_equal(str(tp(x)), _REF[x],
+                     err_msg='Failed str formatting for type %s' % tp)
+
+
+@pytest.mark.parametrize('tp', [np.complex64, np.cdouble, np.clongdouble])
+def test_complex_types(tp):
+    """Check formatting of complex types.
+
+        This is only for the str function, and only for simple types.
+        The precision of np.float32 and np.longdouble aren't the same as the
+        python float precision.
+
+    """
+    for x in [0, 1, -1, 1e20]:
+        assert_equal(str(tp(x)), str(complex(x)),
+                     err_msg='Failed str formatting for type %s' % tp)
+        assert_equal(str(tp(x*1j)), str(complex(x*1j)),
+                     err_msg='Failed str formatting for type %s' % tp)
+        assert_equal(str(tp(x + x*1j)), str(complex(x + x*1j)),
+                     err_msg='Failed str formatting for type %s' % tp)
+
+    if tp(1e16).itemsize > 8:
+        assert_equal(str(tp(1e16)), str(complex(1e16)),
+                     err_msg='Failed str formatting for type %s' % tp)
+    else:
+        ref = '(1e+16+0j)'
+        assert_equal(str(tp(1e16)), ref,
+                     err_msg='Failed str formatting for type %s' % tp)
+
+
+@pytest.mark.parametrize('dtype', [np.complex64, np.cdouble, np.clongdouble])
+def test_complex_inf_nan(dtype):
+    """Check inf/nan formatting of complex types."""
+    TESTS = {
+        complex(np.inf, 0): "(inf+0j)",
+        complex(0, np.inf): "infj",
+        complex(-np.inf, 0): "(-inf+0j)",
+        complex(0, -np.inf): "-infj",
+        complex(np.inf, 1): "(inf+1j)",
+        complex(1, np.inf): "(1+infj)",
+        complex(-np.inf, 1): "(-inf+1j)",
+        complex(1, -np.inf): "(1-infj)",
+        complex(np.nan, 0): "(nan+0j)",
+        complex(0, np.nan): "nanj",
+        complex(-np.nan, 0): "(nan+0j)",
+        complex(0, -np.nan): "nanj",
+        complex(np.nan, 1): "(nan+1j)",
+        complex(1, np.nan): "(1+nanj)",
+        complex(-np.nan, 1): "(nan+1j)",
+        complex(1, -np.nan): "(1+nanj)",
+    }
+    for c, s in TESTS.items():
+        assert_equal(str(dtype(c)), s)
+
+
+# print tests
+def _test_redirected_print(x, tp, ref=None):
+    file = StringIO()
+    file_tp = StringIO()
+    stdout = sys.stdout
+    try:
+        sys.stdout = file_tp
+        print(tp(x))
+        sys.stdout = file
+        if ref:
+            print(ref)
+        else:
+            print(x)
+    finally:
+        sys.stdout = stdout
+
+    assert_equal(file.getvalue(), file_tp.getvalue(),
+                 err_msg='print failed for type%s' % tp)
+
+
+@pytest.mark.parametrize('tp', [np.float32, np.double, np.longdouble])
+def test_float_type_print(tp):
+    """Check formatting when using print """
+    for x in [0, 1, -1, 1e20]:
+        _test_redirected_print(float(x), tp)
+
+    for x in [np.inf, -np.inf, np.nan]:
+        _test_redirected_print(float(x), tp, _REF[x])
+
+    if tp(1e16).itemsize > 4:
+        _test_redirected_print(float(1e16), tp)
+    else:
+        ref = '1e+16'
+        _test_redirected_print(float(1e16), tp, ref)
+
+
+@pytest.mark.parametrize('tp', [np.complex64, np.cdouble, np.clongdouble])
+def test_complex_type_print(tp):
+    """Check formatting when using print """
+    # We do not create complex with inf/nan directly because the feature is
+    # missing in python < 2.6
+    for x in [0, 1, -1, 1e20]:
+        _test_redirected_print(complex(x), tp)
+
+    if tp(1e16).itemsize > 8:
+        _test_redirected_print(complex(1e16), tp)
+    else:
+        ref = '(1e+16+0j)'
+        _test_redirected_print(complex(1e16), tp, ref)
+
+    _test_redirected_print(complex(np.inf, 1), tp, '(inf+1j)')
+    _test_redirected_print(complex(-np.inf, 1), tp, '(-inf+1j)')
+    _test_redirected_print(complex(-np.nan, 1), tp, '(nan+1j)')
+
+
+def test_scalar_format():
+    """Test the str.format method with NumPy scalar types"""
+    tests = [('{0}', True, np.bool_),
+            ('{0}', False, np.bool_),
+            ('{0:d}', 130, np.uint8),
+            ('{0:d}', 50000, np.uint16),
+            ('{0:d}', 3000000000, np.uint32),
+            ('{0:d}', 15000000000000000000, np.uint64),
+            ('{0:d}', -120, np.int8),
+            ('{0:d}', -30000, np.int16),
+            ('{0:d}', -2000000000, np.int32),
+            ('{0:d}', -7000000000000000000, np.int64),
+            ('{0:g}', 1.5, np.float16),
+            ('{0:g}', 1.5, np.float32),
+            ('{0:g}', 1.5, np.float64),
+            ('{0:g}', 1.5, np.longdouble),
+            ('{0:g}', 1.5+0.5j, np.complex64),
+            ('{0:g}', 1.5+0.5j, np.complex128),
+            ('{0:g}', 1.5+0.5j, np.clongdouble)]
+
+    for (fmat, val, valtype) in tests:
+        try:
+            assert_equal(fmat.format(val), fmat.format(valtype(val)),
+                    "failed with val %s, type %s" % (val, valtype))
+        except ValueError as e:
+            assert_(False,
+               "format raised exception (fmt='%s', val=%s, type=%s, exc='%s')" %
+                            (fmat, repr(val), repr(valtype), str(e)))
+
+
+#
+# Locale tests: scalar types formatting should be independent of the locale
+#
+
+class TestCommaDecimalPointLocale(CommaDecimalPointLocale):
+
+    def test_locale_single(self):
+        assert_equal(str(np.float32(1.2)), str(float(1.2)))
+
+    def test_locale_double(self):
+        assert_equal(str(np.double(1.2)), str(float(1.2)))
+
+    def test_locale_longdouble(self):
+        assert_equal(str(np.longdouble('1.2')), str(float(1.2)))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_protocols.py b/venv/Lib/site-packages/numpy/core/tests/test_protocols.py
new file mode 100644
index 000000000..55a2bcf72
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_protocols.py
@@ -0,0 +1,44 @@
+import pytest
+import warnings
+import numpy as np
+
+
+@pytest.mark.filterwarnings("error")
+def test_getattr_warning():
+    # issue gh-14735: make sure we clear only getattr errors, and let warnings
+    # through
+    class Wrapper:
+        def __init__(self, array):
+            self.array = array
+
+        def __len__(self):
+            return len(self.array)
+
+        def __getitem__(self, item):
+            return type(self)(self.array[item])
+
+        def __getattr__(self, name):
+            if name.startswith("__array_"):
+                warnings.warn("object got converted", UserWarning, stacklevel=1)
+
+            return getattr(self.array, name)
+
+        def __repr__(self):
+            return "<Wrapper({self.array})>".format(self=self)
+
+    array = Wrapper(np.arange(10))
+    with pytest.raises(UserWarning, match="object got converted"):
+        np.asarray(array)
+
+
+def test_array_called():
+    class Wrapper:
+        val = '0' * 100
+        def __array__(self, result=None):
+            return np.array([self.val], dtype=object)
+
+
+    wrapped = Wrapper()
+    arr = np.array(wrapped, dtype=str)
+    assert arr.dtype == 'U100'
+    assert arr[0] == Wrapper.val
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_records.py b/venv/Lib/site-packages/numpy/core/tests/test_records.py
new file mode 100644
index 000000000..4350a3407
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_records.py
@@ -0,0 +1,504 @@
+import collections.abc
+import textwrap
+from os import path
+from pathlib import Path
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_array_almost_equal,
+    assert_raises, temppath,
+    )
+from numpy.compat import pickle
+
+
+class TestFromrecords:
+    def test_fromrecords(self):
+        r = np.rec.fromrecords([[456, 'dbe', 1.2], [2, 'de', 1.3]],
+                            names='col1,col2,col3')
+        assert_equal(r[0].item(), (456, 'dbe', 1.2))
+        assert_equal(r['col1'].dtype.kind, 'i')
+        assert_equal(r['col2'].dtype.kind, 'U')
+        assert_equal(r['col2'].dtype.itemsize, 12)
+        assert_equal(r['col3'].dtype.kind, 'f')
+
+    def test_fromrecords_0len(self):
+        """ Verify fromrecords works with a 0-length input """
+        dtype = [('a', float), ('b', float)]
+        r = np.rec.fromrecords([], dtype=dtype)
+        assert_equal(r.shape, (0,))
+
+    def test_fromrecords_2d(self):
+        data = [
+            [(1, 2), (3, 4), (5, 6)],
+            [(6, 5), (4, 3), (2, 1)]
+        ]
+        expected_a = [[1, 3, 5], [6, 4, 2]]
+        expected_b = [[2, 4, 6], [5, 3, 1]]
+
+        # try with dtype
+        r1 = np.rec.fromrecords(data, dtype=[('a', int), ('b', int)])
+        assert_equal(r1['a'], expected_a)
+        assert_equal(r1['b'], expected_b)
+
+        # try with names
+        r2 = np.rec.fromrecords(data, names=['a', 'b'])
+        assert_equal(r2['a'], expected_a)
+        assert_equal(r2['b'], expected_b)
+
+        assert_equal(r1, r2)
+
+    def test_method_array(self):
+        r = np.rec.array(b'abcdefg' * 100, formats='i2,a3,i4', shape=3, byteorder='big')
+        assert_equal(r[1].item(), (25444, b'efg', 1633837924))
+
+    def test_method_array2(self):
+        r = np.rec.array([(1, 11, 'a'), (2, 22, 'b'), (3, 33, 'c'), (4, 44, 'd'), (5, 55, 'ex'),
+                     (6, 66, 'f'), (7, 77, 'g')], formats='u1,f4,a1')
+        assert_equal(r[1].item(), (2, 22.0, b'b'))
+
+    def test_recarray_slices(self):
+        r = np.rec.array([(1, 11, 'a'), (2, 22, 'b'), (3, 33, 'c'), (4, 44, 'd'), (5, 55, 'ex'),
+                     (6, 66, 'f'), (7, 77, 'g')], formats='u1,f4,a1')
+        assert_equal(r[1::2][1].item(), (4, 44.0, b'd'))
+
+    def test_recarray_fromarrays(self):
+        x1 = np.array([1, 2, 3, 4])
+        x2 = np.array(['a', 'dd', 'xyz', '12'])
+        x3 = np.array([1.1, 2, 3, 4])
+        r = np.rec.fromarrays([x1, x2, x3], names='a,b,c')
+        assert_equal(r[1].item(), (2, 'dd', 2.0))
+        x1[1] = 34
+        assert_equal(r.a, np.array([1, 2, 3, 4]))
+
+    def test_recarray_fromfile(self):
+        data_dir = path.join(path.dirname(__file__), 'data')
+        filename = path.join(data_dir, 'recarray_from_file.fits')
+        fd = open(filename, 'rb')
+        fd.seek(2880 * 2)
+        r1 = np.rec.fromfile(fd, formats='f8,i4,a5', shape=3, byteorder='big')
+        fd.seek(2880 * 2)
+        r2 = np.rec.array(fd, formats='f8,i4,a5', shape=3, byteorder='big')
+        fd.close()
+        assert_equal(r1, r2)
+
+    def test_recarray_from_obj(self):
+        count = 10
+        a = np.zeros(count, dtype='O')
+        b = np.zeros(count, dtype='f8')
+        c = np.zeros(count, dtype='f8')
+        for i in range(len(a)):
+            a[i] = list(range(1, 10))
+
+        mine = np.rec.fromarrays([a, b, c], names='date,data1,data2')
+        for i in range(len(a)):
+            assert_((mine.date[i] == list(range(1, 10))))
+            assert_((mine.data1[i] == 0.0))
+            assert_((mine.data2[i] == 0.0))
+
+    def test_recarray_repr(self):
+        a = np.array([(1, 0.1), (2, 0.2)],
+                     dtype=[('foo', '<i4'), ('bar', '<f8')])
+        a = np.rec.array(a)
+        assert_equal(
+            repr(a),
+            textwrap.dedent("""\
+            rec.array([(1, 0.1), (2, 0.2)],
+                      dtype=[('foo', '<i4'), ('bar', '<f8')])""")
+        )
+
+        # make sure non-structured dtypes also show up as rec.array
+        a = np.array(np.ones(4, dtype='f8'))
+        assert_(repr(np.rec.array(a)).startswith('rec.array'))
+
+        # check that the 'np.record' part of the dtype isn't shown
+        a = np.rec.array(np.ones(3, dtype='i4,i4'))
+        assert_equal(repr(a).find('numpy.record'), -1)
+        a = np.rec.array(np.ones(3, dtype='i4'))
+        assert_(repr(a).find('dtype=int32') != -1)
+
+    def test_0d_recarray_repr(self):
+        arr_0d = np.rec.array((1, 2.0, '2003'), dtype='<i4,<f8,<M8[Y]')
+        assert_equal(repr(arr_0d), textwrap.dedent("""\
+            rec.array((1, 2., '2003'),
+                      dtype=[('f0', '<i4'), ('f1', '<f8'), ('f2', '<M8[Y]')])"""))
+
+        record = arr_0d[()]
+        assert_equal(repr(record), "(1, 2., '2003')")
+        # 1.13 converted to python scalars before the repr
+        try:
+            np.set_printoptions(legacy='1.13')
+            assert_equal(repr(record), '(1, 2.0, datetime.date(2003, 1, 1))')
+        finally:
+            np.set_printoptions(legacy=False)
+
+    def test_recarray_from_repr(self):
+        a = np.array([(1,'ABC'), (2, "DEF")],
+                     dtype=[('foo', int), ('bar', 'S4')])
+        recordarr = np.rec.array(a)
+        recarr = a.view(np.recarray)
+        recordview = a.view(np.dtype((np.record, a.dtype)))
+
+        recordarr_r = eval("numpy." + repr(recordarr), {'numpy': np})
+        recarr_r = eval("numpy." + repr(recarr), {'numpy': np})
+        recordview_r = eval("numpy." + repr(recordview), {'numpy': np})
+
+        assert_equal(type(recordarr_r), np.recarray)
+        assert_equal(recordarr_r.dtype.type, np.record)
+        assert_equal(recordarr, recordarr_r)
+
+        assert_equal(type(recarr_r), np.recarray)
+        assert_equal(recarr_r.dtype.type, np.record)
+        assert_equal(recarr, recarr_r)
+
+        assert_equal(type(recordview_r), np.ndarray)
+        assert_equal(recordview.dtype.type, np.record)
+        assert_equal(recordview, recordview_r)
+
+    def test_recarray_views(self):
+        a = np.array([(1,'ABC'), (2, "DEF")],
+                     dtype=[('foo', int), ('bar', 'S4')])
+        b = np.array([1,2,3,4,5], dtype=np.int64)
+
+        #check that np.rec.array gives right dtypes
+        assert_equal(np.rec.array(a).dtype.type, np.record)
+        assert_equal(type(np.rec.array(a)), np.recarray)
+        assert_equal(np.rec.array(b).dtype.type, np.int64)
+        assert_equal(type(np.rec.array(b)), np.recarray)
+
+        #check that viewing as recarray does the same
+        assert_equal(a.view(np.recarray).dtype.type, np.record)
+        assert_equal(type(a.view(np.recarray)), np.recarray)
+        assert_equal(b.view(np.recarray).dtype.type, np.int64)
+        assert_equal(type(b.view(np.recarray)), np.recarray)
+
+        #check that view to non-structured dtype preserves type=np.recarray
+        r = np.rec.array(np.ones(4, dtype="f4,i4"))
+        rv = r.view('f8').view('f4,i4')
+        assert_equal(type(rv), np.recarray)
+        assert_equal(rv.dtype.type, np.record)
+
+        #check that getitem also preserves np.recarray and np.record
+        r = np.rec.array(np.ones(4, dtype=[('a', 'i4'), ('b', 'i4'),
+                                           ('c', 'i4,i4')]))
+        assert_equal(r['c'].dtype.type, np.record)
+        assert_equal(type(r['c']), np.recarray)
+
+        #and that it preserves subclasses (gh-6949)
+        class C(np.recarray):
+            pass
+
+        c = r.view(C)
+        assert_equal(type(c['c']), C)
+
+        # check that accessing nested structures keep record type, but
+        # not for subarrays, non-void structures, non-structured voids
+        test_dtype = [('a', 'f4,f4'), ('b', 'V8'), ('c', ('f4',2)),
+                      ('d', ('i8', 'i4,i4'))]
+        r = np.rec.array([((1,1), b'11111111', [1,1], 1),
+                          ((1,1), b'11111111', [1,1], 1)], dtype=test_dtype)
+        assert_equal(r.a.dtype.type, np.record)
+        assert_equal(r.b.dtype.type, np.void)
+        assert_equal(r.c.dtype.type, np.float32)
+        assert_equal(r.d.dtype.type, np.int64)
+        # check the same, but for views
+        r = np.rec.array(np.ones(4, dtype='i4,i4'))
+        assert_equal(r.view('f4,f4').dtype.type, np.record)
+        assert_equal(r.view(('i4',2)).dtype.type, np.int32)
+        assert_equal(r.view('V8').dtype.type, np.void)
+        assert_equal(r.view(('i8', 'i4,i4')).dtype.type, np.int64)
+
+        #check that we can undo the view
+        arrs = [np.ones(4, dtype='f4,i4'), np.ones(4, dtype='f8')]
+        for arr in arrs:
+            rec = np.rec.array(arr)
+            # recommended way to view as an ndarray:
+            arr2 = rec.view(rec.dtype.fields or rec.dtype, np.ndarray)
+            assert_equal(arr2.dtype.type, arr.dtype.type)
+            assert_equal(type(arr2), type(arr))
+
+    def test_recarray_from_names(self):
+        ra = np.rec.array([
+            (1, 'abc', 3.7000002861022949, 0),
+            (2, 'xy', 6.6999998092651367, 1),
+            (0, ' ', 0.40000000596046448, 0)],
+                       names='c1, c2, c3, c4')
+        pa = np.rec.fromrecords([
+            (1, 'abc', 3.7000002861022949, 0),
+            (2, 'xy', 6.6999998092651367, 1),
+            (0, ' ', 0.40000000596046448, 0)],
+                       names='c1, c2, c3, c4')
+        assert_(ra.dtype == pa.dtype)
+        assert_(ra.shape == pa.shape)
+        for k in range(len(ra)):
+            assert_(ra[k].item() == pa[k].item())
+
+    def test_recarray_conflict_fields(self):
+        ra = np.rec.array([(1, 'abc', 2.3), (2, 'xyz', 4.2),
+                        (3, 'wrs', 1.3)],
+                       names='field, shape, mean')
+        ra.mean = [1.1, 2.2, 3.3]
+        assert_array_almost_equal(ra['mean'], [1.1, 2.2, 3.3])
+        assert_(type(ra.mean) is type(ra.var))
+        ra.shape = (1, 3)
+        assert_(ra.shape == (1, 3))
+        ra.shape = ['A', 'B', 'C']
+        assert_array_equal(ra['shape'], [['A', 'B', 'C']])
+        ra.field = 5
+        assert_array_equal(ra['field'], [[5, 5, 5]])
+        assert_(isinstance(ra.field, collections.abc.Callable))
+
+    def test_fromrecords_with_explicit_dtype(self):
+        a = np.rec.fromrecords([(1, 'a'), (2, 'bbb')],
+                                dtype=[('a', int), ('b', object)])
+        assert_equal(a.a, [1, 2])
+        assert_equal(a[0].a, 1)
+        assert_equal(a.b, ['a', 'bbb'])
+        assert_equal(a[-1].b, 'bbb')
+        #
+        ndtype = np.dtype([('a', int), ('b', object)])
+        a = np.rec.fromrecords([(1, 'a'), (2, 'bbb')], dtype=ndtype)
+        assert_equal(a.a, [1, 2])
+        assert_equal(a[0].a, 1)
+        assert_equal(a.b, ['a', 'bbb'])
+        assert_equal(a[-1].b, 'bbb')
+
+    def test_recarray_stringtypes(self):
+        # Issue #3993
+        a = np.array([('abc ', 1), ('abc', 2)],
+                     dtype=[('foo', 'S4'), ('bar', int)])
+        a = a.view(np.recarray)
+        assert_equal(a.foo[0] == a.foo[1], False)
+
+    def test_recarray_returntypes(self):
+        qux_fields = {'C': (np.dtype('S5'), 0), 'D': (np.dtype('S5'), 6)}
+        a = np.rec.array([('abc ', (1,1), 1, ('abcde', 'fgehi')),
+                          ('abc', (2,3), 1, ('abcde', 'jklmn'))],
+                         dtype=[('foo', 'S4'),
+                                ('bar', [('A', int), ('B', int)]),
+                                ('baz', int), ('qux', qux_fields)])
+        assert_equal(type(a.foo), np.ndarray)
+        assert_equal(type(a['foo']), np.ndarray)
+        assert_equal(type(a.bar), np.recarray)
+        assert_equal(type(a['bar']), np.recarray)
+        assert_equal(a.bar.dtype.type, np.record)
+        assert_equal(type(a['qux']), np.recarray)
+        assert_equal(a.qux.dtype.type, np.record)
+        assert_equal(dict(a.qux.dtype.fields), qux_fields)
+        assert_equal(type(a.baz), np.ndarray)
+        assert_equal(type(a['baz']), np.ndarray)
+        assert_equal(type(a[0].bar), np.record)
+        assert_equal(type(a[0]['bar']), np.record)
+        assert_equal(a[0].bar.A, 1)
+        assert_equal(a[0].bar['A'], 1)
+        assert_equal(a[0]['bar'].A, 1)
+        assert_equal(a[0]['bar']['A'], 1)
+        assert_equal(a[0].qux.D, b'fgehi')
+        assert_equal(a[0].qux['D'], b'fgehi')
+        assert_equal(a[0]['qux'].D, b'fgehi')
+        assert_equal(a[0]['qux']['D'], b'fgehi')
+
+    def test_zero_width_strings(self):
+        # Test for #6430, based on the test case from #1901
+
+        cols = [['test'] * 3, [''] * 3]
+        rec = np.rec.fromarrays(cols)
+        assert_equal(rec['f0'], ['test', 'test', 'test'])
+        assert_equal(rec['f1'], ['', '', ''])
+
+        dt = np.dtype([('f0', '|S4'), ('f1', '|S')])
+        rec = np.rec.fromarrays(cols, dtype=dt)
+        assert_equal(rec.itemsize, 4)
+        assert_equal(rec['f0'], [b'test', b'test', b'test'])
+        assert_equal(rec['f1'], [b'', b'', b''])
+
+
+class TestPathUsage:
+    # Test that pathlib.Path can be used
+    def test_tofile_fromfile(self):
+        with temppath(suffix='.bin') as path:
+            path = Path(path)
+            np.random.seed(123)
+            a = np.random.rand(10).astype('f8,i4,a5')
+            a[5] = (0.5,10,'abcde')
+            with path.open("wb") as fd:
+                a.tofile(fd)
+            x = np.core.records.fromfile(path,
+                                         formats='f8,i4,a5',
+                                         shape=10)
+            assert_array_equal(x, a)
+
+
+class TestRecord:
+    def setup(self):
+        self.data = np.rec.fromrecords([(1, 2, 3), (4, 5, 6)],
+                            dtype=[("col1", "<i4"),
+                                   ("col2", "<i4"),
+                                   ("col3", "<i4")])
+
+    def test_assignment1(self):
+        a = self.data
+        assert_equal(a.col1[0], 1)
+        a[0].col1 = 0
+        assert_equal(a.col1[0], 0)
+
+    def test_assignment2(self):
+        a = self.data
+        assert_equal(a.col1[0], 1)
+        a.col1[0] = 0
+        assert_equal(a.col1[0], 0)
+
+    def test_invalid_assignment(self):
+        a = self.data
+
+        def assign_invalid_column(x):
+            x[0].col5 = 1
+
+        assert_raises(AttributeError, assign_invalid_column, a)
+
+    def test_nonwriteable_setfield(self):
+        # gh-8171
+        r = np.rec.array([(0,), (1,)], dtype=[('f', 'i4')])
+        r.flags.writeable = False
+        with assert_raises(ValueError):
+            r.f = [2, 3]
+        with assert_raises(ValueError):
+            r.setfield([2,3], *r.dtype.fields['f'])
+
+    def test_out_of_order_fields(self):
+        # names in the same order, padding added to descr
+        x = self.data[['col1', 'col2']]
+        assert_equal(x.dtype.names, ('col1', 'col2'))
+        assert_equal(x.dtype.descr,
+                     [('col1', '<i4'), ('col2', '<i4'), ('', '|V4')])
+
+        # names change order to match indexing, as of 1.14 - descr can't
+        # represent that
+        y = self.data[['col2', 'col1']]
+        assert_equal(y.dtype.names, ('col2', 'col1'))
+        assert_raises(ValueError, lambda: y.dtype.descr)
+
+    def test_pickle_1(self):
+        # Issue #1529
+        a = np.array([(1, [])], dtype=[('a', np.int32), ('b', np.int32, 0)])
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            assert_equal(a, pickle.loads(pickle.dumps(a, protocol=proto)))
+            assert_equal(a[0], pickle.loads(pickle.dumps(a[0],
+                                                         protocol=proto)))
+
+    def test_pickle_2(self):
+        a = self.data
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            assert_equal(a, pickle.loads(pickle.dumps(a, protocol=proto)))
+            assert_equal(a[0], pickle.loads(pickle.dumps(a[0],
+                                                         protocol=proto)))
+
+    def test_pickle_3(self):
+        # Issue #7140
+        a = self.data
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            pa = pickle.loads(pickle.dumps(a[0], protocol=proto))
+            assert_(pa.flags.c_contiguous)
+            assert_(pa.flags.f_contiguous)
+            assert_(pa.flags.writeable)
+            assert_(pa.flags.aligned)
+
+    def test_pickle_void(self):
+        # issue gh-13593
+        dt = np.dtype([('obj', 'O'), ('int', 'i')])
+        a = np.empty(1, dtype=dt)
+        data = (bytearray(b'eman'),)
+        a['obj'] = data
+        a['int'] = 42
+        ctor, args = a[0].__reduce__()
+        # check the constructor is what we expect before interpreting the arguments
+        assert ctor is np.core.multiarray.scalar
+        dtype, obj = args
+        # make sure we did not pickle the address
+        assert not isinstance(obj, bytes)
+
+        assert_raises(TypeError, ctor, dtype, 13)
+
+    def test_objview_record(self):
+        # https://github.com/numpy/numpy/issues/2599
+        dt = np.dtype([('foo', 'i8'), ('bar', 'O')])
+        r = np.zeros((1,3), dtype=dt).view(np.recarray)
+        r.foo = np.array([1, 2, 3])  # TypeError?
+
+        # https://github.com/numpy/numpy/issues/3256
+        ra = np.recarray((2,), dtype=[('x', object), ('y', float), ('z', int)])
+        ra[['x','y']]  # TypeError?
+
+    def test_record_scalar_setitem(self):
+        # https://github.com/numpy/numpy/issues/3561
+        rec = np.recarray(1, dtype=[('x', float, 5)])
+        rec[0].x = 1
+        assert_equal(rec[0].x, np.ones(5))
+
+    def test_missing_field(self):
+        # https://github.com/numpy/numpy/issues/4806
+        arr = np.zeros((3,), dtype=[('x', int), ('y', int)])
+        assert_raises(KeyError, lambda: arr[['nofield']])
+
+    def test_fromarrays_nested_structured_arrays(self):
+        arrays = [
+            np.arange(10),
+            np.ones(10, dtype=[('a', '<u2'), ('b', '<f4')]),
+        ]
+        arr = np.rec.fromarrays(arrays)  # ValueError?
+
+    @pytest.mark.parametrize('nfields', [0, 1, 2])
+    def test_assign_dtype_attribute(self, nfields):
+        dt = np.dtype([('a', np.uint8), ('b', np.uint8), ('c', np.uint8)][:nfields])
+        data = np.zeros(3, dt).view(np.recarray)
+
+        # the original and resulting dtypes differ on whether they are records
+        assert data.dtype.type == np.record
+        assert dt.type != np.record
+
+        # ensure that the dtype remains a record even when assigned
+        data.dtype = dt
+        assert data.dtype.type == np.record
+
+    @pytest.mark.parametrize('nfields', [0, 1, 2])
+    def test_nested_fields_are_records(self, nfields):
+        """ Test that nested structured types are treated as records too """
+        dt = np.dtype([('a', np.uint8), ('b', np.uint8), ('c', np.uint8)][:nfields])
+        dt_outer = np.dtype([('inner', dt)])
+
+        data = np.zeros(3, dt_outer).view(np.recarray)
+        assert isinstance(data, np.recarray)
+        assert isinstance(data['inner'], np.recarray)
+
+        data0 = data[0]
+        assert isinstance(data0, np.record)
+        assert isinstance(data0['inner'], np.record)
+
+    def test_nested_dtype_padding(self):
+        """ test that trailing padding is preserved """
+        # construct a dtype with padding at the end
+        dt = np.dtype([('a', np.uint8), ('b', np.uint8), ('c', np.uint8)])
+        dt_padded_end = dt[['a', 'b']]
+        assert dt_padded_end.itemsize == dt.itemsize
+
+        dt_outer = np.dtype([('inner', dt_padded_end)])
+
+        data = np.zeros(3, dt_outer).view(np.recarray)
+        assert_equal(data['inner'].dtype, dt_padded_end)
+
+        data0 = data[0]
+        assert_equal(data0['inner'].dtype, dt_padded_end)
+
+
+def test_find_duplicate():
+    l1 = [1, 2, 3, 4, 5, 6]
+    assert_(np.rec.find_duplicate(l1) == [])
+
+    l2 = [1, 2, 1, 4, 5, 6]
+    assert_(np.rec.find_duplicate(l2) == [1])
+
+    l3 = [1, 2, 1, 4, 1, 6, 2, 3]
+    assert_(np.rec.find_duplicate(l3) == [1, 2])
+
+    l3 = [2, 2, 1, 4, 1, 6, 2, 3]
+    assert_(np.rec.find_duplicate(l3) == [2, 1])
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_regression.py b/venv/Lib/site-packages/numpy/core/tests/test_regression.py
new file mode 100644
index 000000000..9b487f37d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_regression.py
@@ -0,0 +1,2505 @@
+import copy
+import sys
+import gc
+import tempfile
+import pytest
+from os import path
+from io import BytesIO
+from itertools import chain
+
+import numpy as np
+from numpy.testing import (
+        assert_, assert_equal, IS_PYPY, assert_almost_equal,
+        assert_array_equal, assert_array_almost_equal, assert_raises,
+        assert_raises_regex, assert_warns, suppress_warnings,
+        _assert_valid_refcount, HAS_REFCOUNT,
+        )
+from numpy.testing._private.utils import _no_tracing, requires_memory
+from numpy.compat import asbytes, asunicode, pickle
+
+try:
+    RecursionError
+except NameError:
+    RecursionError = RuntimeError  # python < 3.5
+
+class TestRegression:
+    def test_invalid_round(self):
+        # Ticket #3
+        v = 4.7599999999999998
+        assert_array_equal(np.array([v]), np.array(v))
+
+    def test_mem_empty(self):
+        # Ticket #7
+        np.empty((1,), dtype=[('x', np.int64)])
+
+    def test_pickle_transposed(self):
+        # Ticket #16
+        a = np.transpose(np.array([[2, 9], [7, 0], [3, 8]]))
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            with BytesIO() as f:
+                pickle.dump(a, f, protocol=proto)
+                f.seek(0)
+                b = pickle.load(f)
+            assert_array_equal(a, b)
+
+    def test_typeNA(self):
+        # Issue gh-515
+        with suppress_warnings() as sup:
+            sup.filter(np.VisibleDeprecationWarning)
+            assert_equal(np.typeNA[np.int64], 'Int64')
+            assert_equal(np.typeNA[np.uint64], 'UInt64')
+
+    def test_dtype_names(self):
+        # Ticket #35
+        # Should succeed
+        np.dtype([(('name', 'label'), np.int32, 3)])
+
+    def test_reduce(self):
+        # Ticket #40
+        assert_almost_equal(np.add.reduce([1., .5], dtype=None), 1.5)
+
+    def test_zeros_order(self):
+        # Ticket #43
+        np.zeros([3], int, 'C')
+        np.zeros([3], order='C')
+        np.zeros([3], int, order='C')
+
+    def test_asarray_with_order(self):
+        # Check that nothing is done when order='F' and array C/F-contiguous
+        a = np.ones(2)
+        assert_(a is np.asarray(a, order='F'))
+
+    def test_ravel_with_order(self):
+        # Check that ravel works when order='F' and array C/F-contiguous
+        a = np.ones(2)
+        assert_(not a.ravel('F').flags.owndata)
+
+    def test_sort_bigendian(self):
+        # Ticket #47
+        a = np.linspace(0, 10, 11)
+        c = a.astype(np.dtype('<f8'))
+        c.sort()
+        assert_array_almost_equal(c, a)
+
+    def test_negative_nd_indexing(self):
+        # Ticket #49
+        c = np.arange(125).reshape((5, 5, 5))
+        origidx = np.array([-1, 0, 1])
+        idx = np.array(origidx)
+        c[idx]
+        assert_array_equal(idx, origidx)
+
+    def test_char_dump(self):
+        # Ticket #50
+        ca = np.char.array(np.arange(1000, 1010), itemsize=4)
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            with BytesIO() as f:
+                pickle.dump(ca, f, protocol=proto)
+                f.seek(0)
+                ca = np.load(f, allow_pickle=True)
+
+    def test_noncontiguous_fill(self):
+        # Ticket #58.
+        a = np.zeros((5, 3))
+        b = a[:, :2,]
+
+        def rs():
+            b.shape = (10,)
+
+        assert_raises(AttributeError, rs)
+
+    def test_bool(self):
+        # Ticket #60
+        np.bool_(1)  # Should succeed
+
+    def test_indexing1(self):
+        # Ticket #64
+        descr = [('x', [('y', [('z', 'c16', (2,)),]),]),]
+        buffer = ((([6j, 4j],),),)
+        h = np.array(buffer, dtype=descr)
+        h['x']['y']['z']
+
+    def test_indexing2(self):
+        # Ticket #65
+        descr = [('x', 'i4', (2,))]
+        buffer = ([3, 2],)
+        h = np.array(buffer, dtype=descr)
+        h['x']
+
+    def test_round(self):
+        # Ticket #67
+        x = np.array([1+2j])
+        assert_almost_equal(x**(-1), [1/(1+2j)])
+
+    def test_scalar_compare(self):
+        # Trac Ticket #72
+        # https://github.com/numpy/numpy/issues/565
+        a = np.array(['test', 'auto'])
+        assert_array_equal(a == 'auto', np.array([False, True]))
+        assert_(a[1] == 'auto')
+        assert_(a[0] != 'auto')
+        b = np.linspace(0, 10, 11)
+        # This should return true for now, but will eventually raise an error:
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning)
+            assert_(b != 'auto')
+        assert_(b[0] != 'auto')
+
+    def test_unicode_swapping(self):
+        # Ticket #79
+        ulen = 1
+        ucs_value = u'\U0010FFFF'
+        ua = np.array([[[ucs_value*ulen]*2]*3]*4, dtype='U%s' % ulen)
+        ua.newbyteorder()  # Should succeed.
+
+    def test_object_array_fill(self):
+        # Ticket #86
+        x = np.zeros(1, 'O')
+        x.fill([])
+
+    def test_mem_dtype_align(self):
+        # Ticket #93
+        assert_raises(TypeError, np.dtype,
+                              {'names':['a'], 'formats':['foo']}, align=1)
+
+    def test_endian_bool_indexing(self):
+        # Ticket #105
+        a = np.arange(10., dtype='>f8')
+        b = np.arange(10., dtype='<f8')
+        xa = np.where((a > 2) & (a < 6))
+        xb = np.where((b > 2) & (b < 6))
+        ya = ((a > 2) & (a < 6))
+        yb = ((b > 2) & (b < 6))
+        assert_array_almost_equal(xa, ya.nonzero())
+        assert_array_almost_equal(xb, yb.nonzero())
+        assert_(np.all(a[ya] > 0.5))
+        assert_(np.all(b[yb] > 0.5))
+
+    def test_endian_where(self):
+        # GitHub issue #369
+        net = np.zeros(3, dtype='>f4')
+        net[1] = 0.00458849
+        net[2] = 0.605202
+        max_net = net.max()
+        test = np.where(net <= 0., max_net, net)
+        correct = np.array([ 0.60520202,  0.00458849,  0.60520202])
+        assert_array_almost_equal(test, correct)
+
+    def test_endian_recarray(self):
+        # Ticket #2185
+        dt = np.dtype([
+               ('head', '>u4'),
+               ('data', '>u4', 2),
+            ])
+        buf = np.recarray(1, dtype=dt)
+        buf[0]['head'] = 1
+        buf[0]['data'][:] = [1, 1]
+
+        h = buf[0]['head']
+        d = buf[0]['data'][0]
+        buf[0]['head'] = h
+        buf[0]['data'][0] = d
+        assert_(buf[0]['head'] == 1)
+
+    def test_mem_dot(self):
+        # Ticket #106
+        x = np.random.randn(0, 1)
+        y = np.random.randn(10, 1)
+        # Dummy array to detect bad memory access:
+        _z = np.ones(10)
+        _dummy = np.empty((0, 10))
+        z = np.lib.stride_tricks.as_strided(_z, _dummy.shape, _dummy.strides)
+        np.dot(x, np.transpose(y), out=z)
+        assert_equal(_z, np.ones(10))
+        # Do the same for the built-in dot:
+        np.core.multiarray.dot(x, np.transpose(y), out=z)
+        assert_equal(_z, np.ones(10))
+
+    def test_arange_endian(self):
+        # Ticket #111
+        ref = np.arange(10)
+        x = np.arange(10, dtype='<f8')
+        assert_array_equal(ref, x)
+        x = np.arange(10, dtype='>f8')
+        assert_array_equal(ref, x)
+
+    def test_arange_inf_step(self):
+        ref = np.arange(0, 1, 10)
+        x = np.arange(0, 1, np.inf)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, 1, -10)
+        x = np.arange(0, 1, -np.inf)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, -1, -10)
+        x = np.arange(0, -1, -np.inf)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, -1, 10)
+        x = np.arange(0, -1, np.inf)
+        assert_array_equal(ref, x)
+
+    def test_arange_underflow_stop_and_step(self):
+        finfo = np.finfo(np.float64)
+
+        ref = np.arange(0, finfo.eps, 2 * finfo.eps)
+        x = np.arange(0, finfo.eps, finfo.max)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, finfo.eps, -2 * finfo.eps)
+        x = np.arange(0, finfo.eps, -finfo.max)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, -finfo.eps, -2 * finfo.eps)
+        x = np.arange(0, -finfo.eps, -finfo.max)
+        assert_array_equal(ref, x)
+
+        ref = np.arange(0, -finfo.eps, 2 * finfo.eps)
+        x = np.arange(0, -finfo.eps, finfo.max)
+        assert_array_equal(ref, x)
+
+    def test_argmax(self):
+        # Ticket #119
+        a = np.random.normal(0, 1, (4, 5, 6, 7, 8))
+        for i in range(a.ndim):
+            a.argmax(i)  # Should succeed
+
+    def test_mem_divmod(self):
+        # Ticket #126
+        for i in range(10):
+            divmod(np.array([i])[0], 10)
+
+    def test_hstack_invalid_dims(self):
+        # Ticket #128
+        x = np.arange(9).reshape((3, 3))
+        y = np.array([0, 0, 0])
+        assert_raises(ValueError, np.hstack, (x, y))
+
+    def test_squeeze_type(self):
+        # Ticket #133
+        a = np.array([3])
+        b = np.array(3)
+        assert_(type(a.squeeze()) is np.ndarray)
+        assert_(type(b.squeeze()) is np.ndarray)
+
+    def test_add_identity(self):
+        # Ticket #143
+        assert_equal(0, np.add.identity)
+
+    def test_numpy_float_python_long_addition(self):
+        # Check that numpy float and python longs can be added correctly.
+        a = np.float_(23.) + 2**135
+        assert_equal(a, 23. + 2**135)
+
+    def test_binary_repr_0(self):
+        # Ticket #151
+        assert_equal('0', np.binary_repr(0))
+
+    def test_rec_iterate(self):
+        # Ticket #160
+        descr = np.dtype([('i', int), ('f', float), ('s', '|S3')])
+        x = np.rec.array([(1, 1.1, '1.0'),
+                         (2, 2.2, '2.0')], dtype=descr)
+        x[0].tolist()
+        [i for i in x[0]]
+
+    def test_unicode_string_comparison(self):
+        # Ticket #190
+        a = np.array('hello', np.unicode_)
+        b = np.array('world')
+        a == b
+
+    def test_tobytes_FORTRANORDER_discontiguous(self):
+        # Fix in r2836
+        # Create non-contiguous Fortran ordered array
+        x = np.array(np.random.rand(3, 3), order='F')[:, :2]
+        assert_array_almost_equal(x.ravel(), np.frombuffer(x.tobytes()))
+
+    def test_flat_assignment(self):
+        # Correct behaviour of ticket #194
+        x = np.empty((3, 1))
+        x.flat = np.arange(3)
+        assert_array_almost_equal(x, [[0], [1], [2]])
+        x.flat = np.arange(3, dtype=float)
+        assert_array_almost_equal(x, [[0], [1], [2]])
+
+    def test_broadcast_flat_assignment(self):
+        # Ticket #194
+        x = np.empty((3, 1))
+
+        def bfa():
+            x[:] = np.arange(3)
+
+        def bfb():
+            x[:] = np.arange(3, dtype=float)
+
+        assert_raises(ValueError, bfa)
+        assert_raises(ValueError, bfb)
+
+    def test_nonarray_assignment(self):
+        # See also Issue gh-2870, test for non-array assignment
+        # and equivalent unsafe casted array assignment
+        a = np.arange(10)
+        b = np.ones(10, dtype=bool)
+        r = np.arange(10)
+
+        def assign(a, b, c):
+            a[b] = c
+
+        assert_raises(ValueError, assign, a, b, np.nan)
+        a[b] = np.array(np.nan)  # but not this.
+        assert_raises(ValueError, assign, a, r, np.nan)
+        a[r] = np.array(np.nan)
+
+    def test_unpickle_dtype_with_object(self):
+        # Implemented in r2840
+        dt = np.dtype([('x', int), ('y', np.object_), ('z', 'O')])
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            with BytesIO() as f:
+                pickle.dump(dt, f, protocol=proto)
+                f.seek(0)
+                dt_ = pickle.load(f)
+            assert_equal(dt, dt_)
+
+    def test_mem_array_creation_invalid_specification(self):
+        # Ticket #196
+        dt = np.dtype([('x', int), ('y', np.object_)])
+        # Wrong way
+        assert_raises(ValueError, np.array, [1, 'object'], dt)
+        # Correct way
+        np.array([(1, 'object')], dt)
+
+    def test_recarray_single_element(self):
+        # Ticket #202
+        a = np.array([1, 2, 3], dtype=np.int32)
+        b = a.copy()
+        r = np.rec.array(a, shape=1, formats=['3i4'], names=['d'])
+        assert_array_equal(a, b)
+        assert_equal(a, r[0][0])
+
+    def test_zero_sized_array_indexing(self):
+        # Ticket #205
+        tmp = np.array([])
+
+        def index_tmp():
+            tmp[np.array(10)]
+
+        assert_raises(IndexError, index_tmp)
+
+    def test_chararray_rstrip(self):
+        # Ticket #222
+        x = np.chararray((1,), 5)
+        x[0] = b'a   '
+        x = x.rstrip()
+        assert_equal(x[0], b'a')
+
+    def test_object_array_shape(self):
+        # Ticket #239
+        assert_equal(np.array([[1, 2], 3, 4], dtype=object).shape, (3,))
+        assert_equal(np.array([[1, 2], [3, 4]], dtype=object).shape, (2, 2))
+        assert_equal(np.array([(1, 2), (3, 4)], dtype=object).shape, (2, 2))
+        assert_equal(np.array([], dtype=object).shape, (0,))
+        assert_equal(np.array([[], [], []], dtype=object).shape, (3, 0))
+        assert_equal(np.array([[3, 4], [5, 6], None], dtype=object).shape, (3,))
+
+    def test_mem_around(self):
+        # Ticket #243
+        x = np.zeros((1,))
+        y = [0]
+        decimal = 6
+        np.around(abs(x-y), decimal) <= 10.0**(-decimal)
+
+    def test_character_array_strip(self):
+        # Ticket #246
+        x = np.char.array(("x", "x ", "x  "))
+        for c in x:
+            assert_equal(c, "x")
+
+    def test_lexsort(self):
+        # Lexsort memory error
+        v = np.array([1, 2, 3, 4, 5, 6, 7, 8, 9, 10])
+        assert_equal(np.lexsort(v), 0)
+
+    def test_lexsort_invalid_sequence(self):
+        # Issue gh-4123
+        class BuggySequence:
+            def __len__(self):
+                return 4
+
+            def __getitem__(self, key):
+                raise KeyError
+
+        assert_raises(KeyError, np.lexsort, BuggySequence())
+
+    def test_lexsort_zerolen_custom_strides(self):
+        # Ticket #14228
+        xs = np.array([], dtype='i8')
+        assert xs.strides == (8,)
+        assert np.lexsort((xs,)).shape[0] == 0 # Works
+
+        xs.strides = (16,)
+        assert np.lexsort((xs,)).shape[0] == 0 # Was: MemoryError
+
+    def test_lexsort_zerolen_custom_strides_2d(self):
+        xs = np.array([], dtype='i8')
+
+        xs.shape = (0, 2)
+        xs.strides = (16, 16)
+        assert np.lexsort((xs,), axis=0).shape[0] == 0
+
+        xs.shape = (2, 0)
+        xs.strides = (16, 16)
+        assert np.lexsort((xs,), axis=0).shape[0] == 2
+
+    def test_lexsort_invalid_axis(self):
+        assert_raises(np.AxisError, np.lexsort, (np.arange(1),), axis=2)
+        assert_raises(np.AxisError, np.lexsort, (np.array([]),), axis=1)
+        assert_raises(np.AxisError, np.lexsort, (np.array(1),), axis=10)
+
+    def test_lexsort_zerolen_element(self):
+        dt = np.dtype([])  # a void dtype with no fields
+        xs = np.empty(4, dt)
+
+        assert np.lexsort((xs,)).shape[0] == xs.shape[0]
+
+    def test_pickle_py2_bytes_encoding(self):
+        # Check that arrays and scalars pickled on Py2 are
+        # unpickleable on Py3 using encoding='bytes'
+
+        test_data = [
+            # (original, py2_pickle)
+            (np.unicode_('\u6f2c'),
+             b"cnumpy.core.multiarray\nscalar\np0\n(cnumpy\ndtype\np1\n"
+             b"(S'U1'\np2\nI0\nI1\ntp3\nRp4\n(I3\nS'<'\np5\nNNNI4\nI4\n"
+             b"I0\ntp6\nbS',o\\x00\\x00'\np7\ntp8\nRp9\n."),
+
+            (np.array([9e123], dtype=np.float64),
+             b"cnumpy.core.multiarray\n_reconstruct\np0\n(cnumpy\nndarray\n"
+             b"p1\n(I0\ntp2\nS'b'\np3\ntp4\nRp5\n(I1\n(I1\ntp6\ncnumpy\ndtype\n"
+             b"p7\n(S'f8'\np8\nI0\nI1\ntp9\nRp10\n(I3\nS'<'\np11\nNNNI-1\nI-1\n"
+             b"I0\ntp12\nbI00\nS'O\\x81\\xb7Z\\xaa:\\xabY'\np13\ntp14\nb."),
+
+            (np.array([(9e123,)], dtype=[('name', float)]),
+             b"cnumpy.core.multiarray\n_reconstruct\np0\n(cnumpy\nndarray\np1\n"
+             b"(I0\ntp2\nS'b'\np3\ntp4\nRp5\n(I1\n(I1\ntp6\ncnumpy\ndtype\np7\n"
+             b"(S'V8'\np8\nI0\nI1\ntp9\nRp10\n(I3\nS'|'\np11\nN(S'name'\np12\ntp13\n"
+             b"(dp14\ng12\n(g7\n(S'f8'\np15\nI0\nI1\ntp16\nRp17\n(I3\nS'<'\np18\nNNNI-1\n"
+             b"I-1\nI0\ntp19\nbI0\ntp20\nsI8\nI1\nI0\ntp21\n"
+             b"bI00\nS'O\\x81\\xb7Z\\xaa:\\xabY'\np22\ntp23\nb."),
+        ]
+
+        for original, data in test_data:
+            result = pickle.loads(data, encoding='bytes')
+            assert_equal(result, original)
+
+            if isinstance(result, np.ndarray) and result.dtype.names is not None:
+                for name in result.dtype.names:
+                    assert_(isinstance(name, str))
+
+    def test_pickle_dtype(self):
+        # Ticket #251
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            pickle.dumps(float, protocol=proto)
+
+    def test_swap_real(self):
+        # Ticket #265
+        assert_equal(np.arange(4, dtype='>c8').imag.max(), 0.0)
+        assert_equal(np.arange(4, dtype='<c8').imag.max(), 0.0)
+        assert_equal(np.arange(4, dtype='>c8').real.max(), 3.0)
+        assert_equal(np.arange(4, dtype='<c8').real.max(), 3.0)
+
+    def test_object_array_from_list(self):
+        # Ticket #270
+        assert_(np.array([1, 'A', None]).shape == (3,))
+
+    def test_multiple_assign(self):
+        # Ticket #273
+        a = np.zeros((3, 1), int)
+        a[[1, 2]] = 1
+
+    def test_empty_array_type(self):
+        assert_equal(np.array([]).dtype, np.zeros(0).dtype)
+
+    def test_void_copyswap(self):
+        dt = np.dtype([('one', '<i4'), ('two', '<i4')])
+        x = np.array((1, 2), dtype=dt)
+        x = x.byteswap()
+        assert_(x['one'] > 1 and x['two'] > 2)
+
+    def test_method_args(self):
+        # Make sure methods and functions have same default axis
+        # keyword and arguments
+        funcs1 = ['argmax', 'argmin', 'sum', ('product', 'prod'),
+                 ('sometrue', 'any'),
+                 ('alltrue', 'all'), 'cumsum', ('cumproduct', 'cumprod'),
+                 'ptp', 'cumprod', 'prod', 'std', 'var', 'mean',
+                 'round', 'min', 'max', 'argsort', 'sort']
+        funcs2 = ['compress', 'take', 'repeat']
+
+        for func in funcs1:
+            arr = np.random.rand(8, 7)
+            arr2 = arr.copy()
+            if isinstance(func, tuple):
+                func_meth = func[1]
+                func = func[0]
+            else:
+                func_meth = func
+            res1 = getattr(arr, func_meth)()
+            res2 = getattr(np, func)(arr2)
+            if res1 is None:
+                res1 = arr
+
+            if res1.dtype.kind in 'uib':
+                assert_((res1 == res2).all(), func)
+            else:
+                assert_(abs(res1-res2).max() < 1e-8, func)
+
+        for func in funcs2:
+            arr1 = np.random.rand(8, 7)
+            arr2 = np.random.rand(8, 7)
+            res1 = None
+            if func == 'compress':
+                arr1 = arr1.ravel()
+                res1 = getattr(arr2, func)(arr1)
+            else:
+                arr2 = (15*arr2).astype(int).ravel()
+            if res1 is None:
+                res1 = getattr(arr1, func)(arr2)
+            res2 = getattr(np, func)(arr1, arr2)
+            assert_(abs(res1-res2).max() < 1e-8, func)
+
+    def test_mem_lexsort_strings(self):
+        # Ticket #298
+        lst = ['abc', 'cde', 'fgh']
+        np.lexsort((lst,))
+
+    def test_fancy_index(self):
+        # Ticket #302
+        x = np.array([1, 2])[np.array([0])]
+        assert_equal(x.shape, (1,))
+
+    def test_recarray_copy(self):
+        # Ticket #312
+        dt = [('x', np.int16), ('y', np.float64)]
+        ra = np.array([(1, 2.3)], dtype=dt)
+        rb = np.rec.array(ra, dtype=dt)
+        rb['x'] = 2.
+        assert_(ra['x'] != rb['x'])
+
+    def test_rec_fromarray(self):
+        # Ticket #322
+        x1 = np.array([[1, 2], [3, 4], [5, 6]])
+        x2 = np.array(['a', 'dd', 'xyz'])
+        x3 = np.array([1.1, 2, 3])
+        np.rec.fromarrays([x1, x2, x3], formats="(2,)i4,a3,f8")
+
+    def test_object_array_assign(self):
+        x = np.empty((2, 2), object)
+        x.flat[2] = (1, 2, 3)
+        assert_equal(x.flat[2], (1, 2, 3))
+
+    def test_ndmin_float64(self):
+        # Ticket #324
+        x = np.array([1, 2, 3], dtype=np.float64)
+        assert_equal(np.array(x, dtype=np.float32, ndmin=2).ndim, 2)
+        assert_equal(np.array(x, dtype=np.float64, ndmin=2).ndim, 2)
+
+    def test_ndmin_order(self):
+        # Issue #465 and related checks
+        assert_(np.array([1, 2], order='C', ndmin=3).flags.c_contiguous)
+        assert_(np.array([1, 2], order='F', ndmin=3).flags.f_contiguous)
+        assert_(np.array(np.ones((2, 2), order='F'), ndmin=3).flags.f_contiguous)
+        assert_(np.array(np.ones((2, 2), order='C'), ndmin=3).flags.c_contiguous)
+
+    def test_mem_axis_minimization(self):
+        # Ticket #327
+        data = np.arange(5)
+        data = np.add.outer(data, data)
+
+    def test_mem_float_imag(self):
+        # Ticket #330
+        np.float64(1.0).imag
+
+    def test_dtype_tuple(self):
+        # Ticket #334
+        assert_(np.dtype('i4') == np.dtype(('i4', ())))
+
+    def test_dtype_posttuple(self):
+        # Ticket #335
+        np.dtype([('col1', '()i4')])
+
+    def test_numeric_carray_compare(self):
+        # Ticket #341
+        assert_equal(np.array(['X'], 'c'), b'X')
+
+    def test_string_array_size(self):
+        # Ticket #342
+        assert_raises(ValueError,
+                              np.array, [['X'], ['X', 'X', 'X']], '|S1')
+
+    def test_dtype_repr(self):
+        # Ticket #344
+        dt1 = np.dtype(('uint32', 2))
+        dt2 = np.dtype(('uint32', (2,)))
+        assert_equal(dt1.__repr__(), dt2.__repr__())
+
+    def test_reshape_order(self):
+        # Make sure reshape order works.
+        a = np.arange(6).reshape(2, 3, order='F')
+        assert_equal(a, [[0, 2, 4], [1, 3, 5]])
+        a = np.array([[1, 2], [3, 4], [5, 6], [7, 8]])
+        b = a[:, 1]
+        assert_equal(b.reshape(2, 2, order='F'), [[2, 6], [4, 8]])
+
+    def test_reshape_zero_strides(self):
+        # Issue #380, test reshaping of zero strided arrays
+        a = np.ones(1)
+        a = np.lib.stride_tricks.as_strided(a, shape=(5,), strides=(0,))
+        assert_(a.reshape(5, 1).strides[0] == 0)
+
+    def test_reshape_zero_size(self):
+        # GitHub Issue #2700, setting shape failed for 0-sized arrays
+        a = np.ones((0, 2))
+        a.shape = (-1, 2)
+
+    # Cannot test if NPY_RELAXED_STRIDES_CHECKING changes the strides.
+    # With NPY_RELAXED_STRIDES_CHECKING the test becomes superfluous.
+    @pytest.mark.skipif(np.ones(1).strides[0] == np.iinfo(np.intp).max,
+                        reason="Using relaxed stride checking")
+    def test_reshape_trailing_ones_strides(self):
+        # GitHub issue gh-2949, bad strides for trailing ones of new shape
+        a = np.zeros(12, dtype=np.int32)[::2]  # not contiguous
+        strides_c = (16, 8, 8, 8)
+        strides_f = (8, 24, 48, 48)
+        assert_equal(a.reshape(3, 2, 1, 1).strides, strides_c)
+        assert_equal(a.reshape(3, 2, 1, 1, order='F').strides, strides_f)
+        assert_equal(np.array(0, dtype=np.int32).reshape(1, 1).strides, (4, 4))
+
+    def test_repeat_discont(self):
+        # Ticket #352
+        a = np.arange(12).reshape(4, 3)[:, 2]
+        assert_equal(a.repeat(3), [2, 2, 2, 5, 5, 5, 8, 8, 8, 11, 11, 11])
+
+    def test_array_index(self):
+        # Make sure optimization is not called in this case.
+        a = np.array([1, 2, 3])
+        a2 = np.array([[1, 2, 3]])
+        assert_equal(a[np.where(a == 3)], a2[np.where(a2 == 3)])
+
+    def test_object_argmax(self):
+        a = np.array([1, 2, 3], dtype=object)
+        assert_(a.argmax() == 2)
+
+    def test_recarray_fields(self):
+        # Ticket #372
+        dt0 = np.dtype([('f0', 'i4'), ('f1', 'i4')])
+        dt1 = np.dtype([('f0', 'i8'), ('f1', 'i8')])
+        for a in [np.array([(1, 2), (3, 4)], "i4,i4"),
+                  np.rec.array([(1, 2), (3, 4)], "i4,i4"),
+                  np.rec.array([(1, 2), (3, 4)]),
+                  np.rec.fromarrays([(1, 2), (3, 4)], "i4,i4"),
+                  np.rec.fromarrays([(1, 2), (3, 4)])]:
+            assert_(a.dtype in [dt0, dt1])
+
+    def test_random_shuffle(self):
+        # Ticket #374
+        a = np.arange(5).reshape((5, 1))
+        b = a.copy()
+        np.random.shuffle(b)
+        assert_equal(np.sort(b, axis=0), a)
+
+    def test_refcount_vdot(self):
+        # Changeset #3443
+        _assert_valid_refcount(np.vdot)
+
+    def test_startswith(self):
+        ca = np.char.array(['Hi', 'There'])
+        assert_equal(ca.startswith('H'), [True, False])
+
+    def test_noncommutative_reduce_accumulate(self):
+        # Ticket #413
+        tosubtract = np.arange(5)
+        todivide = np.array([2.0, 0.5, 0.25])
+        assert_equal(np.subtract.reduce(tosubtract), -10)
+        assert_equal(np.divide.reduce(todivide), 16.0)
+        assert_array_equal(np.subtract.accumulate(tosubtract),
+            np.array([0, -1, -3, -6, -10]))
+        assert_array_equal(np.divide.accumulate(todivide),
+            np.array([2., 4., 16.]))
+
+    def test_convolve_empty(self):
+        # Convolve should raise an error for empty input array.
+        assert_raises(ValueError, np.convolve, [], [1])
+        assert_raises(ValueError, np.convolve, [1], [])
+
+    def test_multidim_byteswap(self):
+        # Ticket #449
+        r = np.array([(1, (0, 1, 2))], dtype="i2,3i2")
+        assert_array_equal(r.byteswap(),
+                           np.array([(256, (0, 256, 512))], r.dtype))
+
+    def test_string_NULL(self):
+        # Changeset 3557
+        assert_equal(np.array("a\x00\x0b\x0c\x00").item(),
+                     'a\x00\x0b\x0c')
+
+    def test_junk_in_string_fields_of_recarray(self):
+        # Ticket #483
+        r = np.array([[b'abc']], dtype=[('var1', '|S20')])
+        assert_(asbytes(r['var1'][0][0]) == b'abc')
+
+    def test_take_output(self):
+        # Ensure that 'take' honours output parameter.
+        x = np.arange(12).reshape((3, 4))
+        a = np.take(x, [0, 2], axis=1)
+        b = np.zeros_like(a)
+        np.take(x, [0, 2], axis=1, out=b)
+        assert_array_equal(a, b)
+
+    def test_take_object_fail(self):
+        # Issue gh-3001
+        d = 123.
+        a = np.array([d, 1], dtype=object)
+        if HAS_REFCOUNT:
+            ref_d = sys.getrefcount(d)
+        try:
+            a.take([0, 100])
+        except IndexError:
+            pass
+        if HAS_REFCOUNT:
+            assert_(ref_d == sys.getrefcount(d))
+
+    def test_array_str_64bit(self):
+        # Ticket #501
+        s = np.array([1, np.nan], dtype=np.float64)
+        with np.errstate(all='raise'):
+            np.array_str(s)  # Should succeed
+
+    def test_frompyfunc_endian(self):
+        # Ticket #503
+        from math import radians
+        uradians = np.frompyfunc(radians, 1, 1)
+        big_endian = np.array([83.4, 83.5], dtype='>f8')
+        little_endian = np.array([83.4, 83.5], dtype='<f8')
+        assert_almost_equal(uradians(big_endian).astype(float),
+                            uradians(little_endian).astype(float))
+
+    def test_mem_string_arr(self):
+        # Ticket #514
+        s = "aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa"
+        t = []
+        np.hstack((t, s))
+
+    def test_arr_transpose(self):
+        # Ticket #516
+        x = np.random.rand(*(2,)*16)
+        x.transpose(list(range(16)))  # Should succeed
+
+    def test_string_mergesort(self):
+        # Ticket #540
+        x = np.array(['a']*32)
+        assert_array_equal(x.argsort(kind='m'), np.arange(32))
+
+    def test_argmax_byteorder(self):
+        # Ticket #546
+        a = np.arange(3, dtype='>f')
+        assert_(a[a.argmax()] == a.max())
+
+    def test_rand_seed(self):
+        # Ticket #555
+        for l in np.arange(4):
+            np.random.seed(l)
+
+    def test_mem_deallocation_leak(self):
+        # Ticket #562
+        a = np.zeros(5, dtype=float)
+        b = np.array(a, dtype=float)
+        del a, b
+
+    def test_mem_on_invalid_dtype(self):
+        "Ticket #583"
+        assert_raises(ValueError, np.fromiter, [['12', ''], ['13', '']], str)
+
+    def test_dot_negative_stride(self):
+        # Ticket #588
+        x = np.array([[1, 5, 25, 125., 625]])
+        y = np.array([[20.], [160.], [640.], [1280.], [1024.]])
+        z = y[::-1].copy()
+        y2 = y[::-1]
+        assert_equal(np.dot(x, z), np.dot(x, y2))
+
+    def test_object_casting(self):
+        # This used to trigger the object-type version of
+        # the bitwise_or operation, because float64 -> object
+        # casting succeeds
+        def rs():
+            x = np.ones([484, 286])
+            y = np.zeros([484, 286])
+            x |= y
+
+        assert_raises(TypeError, rs)
+
+    def test_unicode_scalar(self):
+        # Ticket #600
+        x = np.array(["DROND", "DROND1"], dtype="U6")
+        el = x[1]
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            new = pickle.loads(pickle.dumps(el, protocol=proto))
+            assert_equal(new, el)
+
+    def test_arange_non_native_dtype(self):
+        # Ticket #616
+        for T in ('>f4', '<f4'):
+            dt = np.dtype(T)
+            assert_equal(np.arange(0, dtype=dt).dtype, dt)
+            assert_equal(np.arange(0.5, dtype=dt).dtype, dt)
+            assert_equal(np.arange(5, dtype=dt).dtype, dt)
+
+    def test_bool_flat_indexing_invalid_nr_elements(self):
+        s = np.ones(10, dtype=float)
+        x = np.array((15,), dtype=float)
+
+        def ia(x, s, v):
+            x[(s > 0)] = v
+
+        assert_raises(IndexError, ia, x, s, np.zeros(9, dtype=float))
+        assert_raises(IndexError, ia, x, s, np.zeros(11, dtype=float))
+
+        # Old special case (different code path):
+        assert_raises(ValueError, ia, x.flat, s, np.zeros(9, dtype=float))
+        assert_raises(ValueError, ia, x.flat, s, np.zeros(11, dtype=float))
+
+    def test_mem_scalar_indexing(self):
+        # Ticket #603
+        x = np.array([0], dtype=float)
+        index = np.array(0, dtype=np.int32)
+        x[index]
+
+    def test_binary_repr_0_width(self):
+        assert_equal(np.binary_repr(0, width=3), '000')
+
+    def test_fromstring(self):
+        assert_equal(np.fromstring("12:09:09", dtype=int, sep=":"),
+                     [12, 9, 9])
+
+    def test_searchsorted_variable_length(self):
+        x = np.array(['a', 'aa', 'b'])
+        y = np.array(['d', 'e'])
+        assert_equal(x.searchsorted(y), [3, 3])
+
+    def test_string_argsort_with_zeros(self):
+        # Check argsort for strings containing zeros.
+        x = np.frombuffer(b"\x00\x02\x00\x01", dtype="|S2")
+        assert_array_equal(x.argsort(kind='m'), np.array([1, 0]))
+        assert_array_equal(x.argsort(kind='q'), np.array([1, 0]))
+
+    def test_string_sort_with_zeros(self):
+        # Check sort for strings containing zeros.
+        x = np.frombuffer(b"\x00\x02\x00\x01", dtype="|S2")
+        y = np.frombuffer(b"\x00\x01\x00\x02", dtype="|S2")
+        assert_array_equal(np.sort(x, kind="q"), y)
+
+    def test_copy_detection_zero_dim(self):
+        # Ticket #658
+        np.indices((0, 3, 4)).T.reshape(-1, 3)
+
+    def test_flat_byteorder(self):
+        # Ticket #657
+        x = np.arange(10)
+        assert_array_equal(x.astype('>i4'), x.astype('<i4').flat[:])
+        assert_array_equal(x.astype('>i4').flat[:], x.astype('<i4'))
+
+    def test_sign_bit(self):
+        x = np.array([0, -0.0, 0])
+        assert_equal(str(np.abs(x)), '[0. 0. 0.]')
+
+    def test_flat_index_byteswap(self):
+        for dt in (np.dtype('<i4'), np.dtype('>i4')):
+            x = np.array([-1, 0, 1], dtype=dt)
+            assert_equal(x.flat[0].dtype, x[0].dtype)
+
+    def test_copy_detection_corner_case(self):
+        # Ticket #658
+        np.indices((0, 3, 4)).T.reshape(-1, 3)
+
+    # Cannot test if NPY_RELAXED_STRIDES_CHECKING changes the strides.
+    # With NPY_RELAXED_STRIDES_CHECKING the test becomes superfluous,
+    # 0-sized reshape itself is tested elsewhere.
+    @pytest.mark.skipif(np.ones(1).strides[0] == np.iinfo(np.intp).max,
+                        reason="Using relaxed stride checking")
+    def test_copy_detection_corner_case2(self):
+        # Ticket #771: strides are not set correctly when reshaping 0-sized
+        # arrays
+        b = np.indices((0, 3, 4)).T.reshape(-1, 3)
+        assert_equal(b.strides, (3 * b.itemsize, b.itemsize))
+
+    def test_object_array_refcounting(self):
+        # Ticket #633
+        if not hasattr(sys, 'getrefcount'):
+            return
+
+        # NB. this is probably CPython-specific
+
+        cnt = sys.getrefcount
+
+        a = object()
+        b = object()
+        c = object()
+
+        cnt0_a = cnt(a)
+        cnt0_b = cnt(b)
+        cnt0_c = cnt(c)
+
+        # -- 0d -> 1-d broadcast slice assignment
+
+        arr = np.zeros(5, dtype=np.object_)
+
+        arr[:] = a
+        assert_equal(cnt(a), cnt0_a + 5)
+
+        arr[:] = b
+        assert_equal(cnt(a), cnt0_a)
+        assert_equal(cnt(b), cnt0_b + 5)
+
+        arr[:2] = c
+        assert_equal(cnt(b), cnt0_b + 3)
+        assert_equal(cnt(c), cnt0_c + 2)
+
+        del arr
+
+        # -- 1-d -> 2-d broadcast slice assignment
+
+        arr = np.zeros((5, 2), dtype=np.object_)
+        arr0 = np.zeros(2, dtype=np.object_)
+
+        arr0[0] = a
+        assert_(cnt(a) == cnt0_a + 1)
+        arr0[1] = b
+        assert_(cnt(b) == cnt0_b + 1)
+
+        arr[:, :] = arr0
+        assert_(cnt(a) == cnt0_a + 6)
+        assert_(cnt(b) == cnt0_b + 6)
+
+        arr[:, 0] = None
+        assert_(cnt(a) == cnt0_a + 1)
+
+        del arr, arr0
+
+        # -- 2-d copying + flattening
+
+        arr = np.zeros((5, 2), dtype=np.object_)
+
+        arr[:, 0] = a
+        arr[:, 1] = b
+        assert_(cnt(a) == cnt0_a + 5)
+        assert_(cnt(b) == cnt0_b + 5)
+
+        arr2 = arr.copy()
+        assert_(cnt(a) == cnt0_a + 10)
+        assert_(cnt(b) == cnt0_b + 10)
+
+        arr2 = arr[:, 0].copy()
+        assert_(cnt(a) == cnt0_a + 10)
+        assert_(cnt(b) == cnt0_b + 5)
+
+        arr2 = arr.flatten()
+        assert_(cnt(a) == cnt0_a + 10)
+        assert_(cnt(b) == cnt0_b + 10)
+
+        del arr, arr2
+
+        # -- concatenate, repeat, take, choose
+
+        arr1 = np.zeros((5, 1), dtype=np.object_)
+        arr2 = np.zeros((5, 1), dtype=np.object_)
+
+        arr1[...] = a
+        arr2[...] = b
+        assert_(cnt(a) == cnt0_a + 5)
+        assert_(cnt(b) == cnt0_b + 5)
+
+        tmp = np.concatenate((arr1, arr2))
+        assert_(cnt(a) == cnt0_a + 5 + 5)
+        assert_(cnt(b) == cnt0_b + 5 + 5)
+
+        tmp = arr1.repeat(3, axis=0)
+        assert_(cnt(a) == cnt0_a + 5 + 3*5)
+
+        tmp = arr1.take([1, 2, 3], axis=0)
+        assert_(cnt(a) == cnt0_a + 5 + 3)
+
+        x = np.array([[0], [1], [0], [1], [1]], int)
+        tmp = x.choose(arr1, arr2)
+        assert_(cnt(a) == cnt0_a + 5 + 2)
+        assert_(cnt(b) == cnt0_b + 5 + 3)
+
+        del tmp  # Avoid pyflakes unused variable warning
+
+    def test_mem_custom_float_to_array(self):
+        # Ticket 702
+        class MyFloat:
+            def __float__(self):
+                return 1.0
+
+        tmp = np.atleast_1d([MyFloat()])
+        tmp.astype(float)  # Should succeed
+
+    def test_object_array_refcount_self_assign(self):
+        # Ticket #711
+        class VictimObject:
+            deleted = False
+
+            def __del__(self):
+                self.deleted = True
+
+        d = VictimObject()
+        arr = np.zeros(5, dtype=np.object_)
+        arr[:] = d
+        del d
+        arr[:] = arr  # refcount of 'd' might hit zero here
+        assert_(not arr[0].deleted)
+        arr[:] = arr  # trying to induce a segfault by doing it again...
+        assert_(not arr[0].deleted)
+
+    def test_mem_fromiter_invalid_dtype_string(self):
+        x = [1, 2, 3]
+        assert_raises(ValueError,
+                              np.fromiter, [xi for xi in x], dtype='S')
+
+    def test_reduce_big_object_array(self):
+        # Ticket #713
+        oldsize = np.setbufsize(10*16)
+        a = np.array([None]*161, object)
+        assert_(not np.any(a))
+        np.setbufsize(oldsize)
+
+    def test_mem_0d_array_index(self):
+        # Ticket #714
+        np.zeros(10)[np.array(0)]
+
+    def test_nonnative_endian_fill(self):
+        # Non-native endian arrays were incorrectly filled with scalars
+        # before r5034.
+        if sys.byteorder == 'little':
+            dtype = np.dtype('>i4')
+        else:
+            dtype = np.dtype('<i4')
+        x = np.empty([1], dtype=dtype)
+        x.fill(1)
+        assert_equal(x, np.array([1], dtype=dtype))
+
+    def test_dot_alignment_sse2(self):
+        # Test for ticket #551, changeset r5140
+        x = np.zeros((30, 40))
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            y = pickle.loads(pickle.dumps(x, protocol=proto))
+            # y is now typically not aligned on a 8-byte boundary
+            z = np.ones((1, y.shape[0]))
+            # This shouldn't cause a segmentation fault:
+            np.dot(z, y)
+
+    def test_astype_copy(self):
+        # Ticket #788, changeset r5155
+        # The test data file was generated by scipy.io.savemat.
+        # The dtype is float64, but the isbuiltin attribute is 0.
+        data_dir = path.join(path.dirname(__file__), 'data')
+        filename = path.join(data_dir, "astype_copy.pkl")
+        with open(filename, 'rb') as f:
+            xp = pickle.load(f, encoding='latin1')
+        xpd = xp.astype(np.float64)
+        assert_((xp.__array_interface__['data'][0] !=
+                xpd.__array_interface__['data'][0]))
+
+    def test_compress_small_type(self):
+        # Ticket #789, changeset 5217.
+        # compress with out argument segfaulted if cannot cast safely
+        import numpy as np
+        a = np.array([[1, 2], [3, 4]])
+        b = np.zeros((2, 1), dtype=np.single)
+        try:
+            a.compress([True, False], axis=1, out=b)
+            raise AssertionError("compress with an out which cannot be "
+                                 "safely casted should not return "
+                                 "successfully")
+        except TypeError:
+            pass
+
+    def test_attributes(self):
+        # Ticket #791
+        class TestArray(np.ndarray):
+            def __new__(cls, data, info):
+                result = np.array(data)
+                result = result.view(cls)
+                result.info = info
+                return result
+
+            def __array_finalize__(self, obj):
+                self.info = getattr(obj, 'info', '')
+
+        dat = TestArray([[1, 2, 3, 4], [5, 6, 7, 8]], 'jubba')
+        assert_(dat.info == 'jubba')
+        dat.resize((4, 2))
+        assert_(dat.info == 'jubba')
+        dat.sort()
+        assert_(dat.info == 'jubba')
+        dat.fill(2)
+        assert_(dat.info == 'jubba')
+        dat.put([2, 3, 4], [6, 3, 4])
+        assert_(dat.info == 'jubba')
+        dat.setfield(4, np.int32, 0)
+        assert_(dat.info == 'jubba')
+        dat.setflags()
+        assert_(dat.info == 'jubba')
+        assert_(dat.all(1).info == 'jubba')
+        assert_(dat.any(1).info == 'jubba')
+        assert_(dat.argmax(1).info == 'jubba')
+        assert_(dat.argmin(1).info == 'jubba')
+        assert_(dat.argsort(1).info == 'jubba')
+        assert_(dat.astype(TestArray).info == 'jubba')
+        assert_(dat.byteswap().info == 'jubba')
+        assert_(dat.clip(2, 7).info == 'jubba')
+        assert_(dat.compress([0, 1, 1]).info == 'jubba')
+        assert_(dat.conj().info == 'jubba')
+        assert_(dat.conjugate().info == 'jubba')
+        assert_(dat.copy().info == 'jubba')
+        dat2 = TestArray([2, 3, 1, 0], 'jubba')
+        choices = [[0, 1, 2, 3], [10, 11, 12, 13],
+                   [20, 21, 22, 23], [30, 31, 32, 33]]
+        assert_(dat2.choose(choices).info == 'jubba')
+        assert_(dat.cumprod(1).info == 'jubba')
+        assert_(dat.cumsum(1).info == 'jubba')
+        assert_(dat.diagonal().info == 'jubba')
+        assert_(dat.flatten().info == 'jubba')
+        assert_(dat.getfield(np.int32, 0).info == 'jubba')
+        assert_(dat.imag.info == 'jubba')
+        assert_(dat.max(1).info == 'jubba')
+        assert_(dat.mean(1).info == 'jubba')
+        assert_(dat.min(1).info == 'jubba')
+        assert_(dat.newbyteorder().info == 'jubba')
+        assert_(dat.prod(1).info == 'jubba')
+        assert_(dat.ptp(1).info == 'jubba')
+        assert_(dat.ravel().info == 'jubba')
+        assert_(dat.real.info == 'jubba')
+        assert_(dat.repeat(2).info == 'jubba')
+        assert_(dat.reshape((2, 4)).info == 'jubba')
+        assert_(dat.round().info == 'jubba')
+        assert_(dat.squeeze().info == 'jubba')
+        assert_(dat.std(1).info == 'jubba')
+        assert_(dat.sum(1).info == 'jubba')
+        assert_(dat.swapaxes(0, 1).info == 'jubba')
+        assert_(dat.take([2, 3, 5]).info == 'jubba')
+        assert_(dat.transpose().info == 'jubba')
+        assert_(dat.T.info == 'jubba')
+        assert_(dat.var(1).info == 'jubba')
+        assert_(dat.view(TestArray).info == 'jubba')
+        # These methods do not preserve subclasses
+        assert_(type(dat.nonzero()[0]) is np.ndarray)
+        assert_(type(dat.nonzero()[1]) is np.ndarray)
+
+    def test_recarray_tolist(self):
+        # Ticket #793, changeset r5215
+        # Comparisons fail for NaN, so we can't use random memory
+        # for the test.
+        buf = np.zeros(40, dtype=np.int8)
+        a = np.recarray(2, formats="i4,f8,f8", names="id,x,y", buf=buf)
+        b = a.tolist()
+        assert_( a[0].tolist() == b[0])
+        assert_( a[1].tolist() == b[1])
+
+    def test_nonscalar_item_method(self):
+        # Make sure that .item() fails graciously when it should
+        a = np.arange(5)
+        assert_raises(ValueError, a.item)
+
+    def test_char_array_creation(self):
+        a = np.array('123', dtype='c')
+        b = np.array([b'1', b'2', b'3'])
+        assert_equal(a, b)
+
+    def test_unaligned_unicode_access(self):
+        # Ticket #825
+        for i in range(1, 9):
+            msg = 'unicode offset: %d chars' % i
+            t = np.dtype([('a', 'S%d' % i), ('b', 'U2')])
+            x = np.array([(b'a', u'b')], dtype=t)
+            assert_equal(str(x), "[(b'a', 'b')]", err_msg=msg)
+
+    def test_sign_for_complex_nan(self):
+        # Ticket 794.
+        with np.errstate(invalid='ignore'):
+            C = np.array([-np.inf, -2+1j, 0, 2-1j, np.inf, np.nan])
+            have = np.sign(C)
+            want = np.array([-1+0j, -1+0j, 0+0j, 1+0j, 1+0j, np.nan])
+            assert_equal(have, want)
+
+    def test_for_equal_names(self):
+        # Ticket #674
+        dt = np.dtype([('foo', float), ('bar', float)])
+        a = np.zeros(10, dt)
+        b = list(a.dtype.names)
+        b[0] = "notfoo"
+        a.dtype.names = b
+        assert_(a.dtype.names[0] == "notfoo")
+        assert_(a.dtype.names[1] == "bar")
+
+    def test_for_object_scalar_creation(self):
+        # Ticket #816
+        a = np.object_()
+        b = np.object_(3)
+        b2 = np.object_(3.0)
+        c = np.object_([4, 5])
+        d = np.object_([None, {}, []])
+        assert_(a is None)
+        assert_(type(b) is int)
+        assert_(type(b2) is float)
+        assert_(type(c) is np.ndarray)
+        assert_(c.dtype == object)
+        assert_(d.dtype == object)
+
+    def test_array_resize_method_system_error(self):
+        # Ticket #840 - order should be an invalid keyword.
+        x = np.array([[0, 1], [2, 3]])
+        assert_raises(TypeError, x.resize, (2, 2), order='C')
+
+    def test_for_zero_length_in_choose(self):
+        "Ticket #882"
+        a = np.array(1)
+        assert_raises(ValueError, lambda x: x.choose([]), a)
+
+    def test_array_ndmin_overflow(self):
+        "Ticket #947."
+        assert_raises(ValueError, lambda: np.array([1], ndmin=33))
+
+    def test_void_scalar_with_titles(self):
+        # No ticket
+        data = [('john', 4), ('mary', 5)]
+        dtype1 = [(('source:yy', 'name'), 'O'), (('source:xx', 'id'), int)]
+        arr = np.array(data, dtype=dtype1)
+        assert_(arr[0][0] == 'john')
+        assert_(arr[0][1] == 4)
+
+    def test_void_scalar_constructor(self):
+        #Issue #1550
+
+        #Create test string data, construct void scalar from data and assert
+        #that void scalar contains original data.
+        test_string = np.array("test")
+        test_string_void_scalar = np.core.multiarray.scalar(
+            np.dtype(("V", test_string.dtype.itemsize)), test_string.tobytes())
+
+        assert_(test_string_void_scalar.view(test_string.dtype) == test_string)
+
+        #Create record scalar, construct from data and assert that
+        #reconstructed scalar is correct.
+        test_record = np.ones((), "i,i")
+        test_record_void_scalar = np.core.multiarray.scalar(
+            test_record.dtype, test_record.tobytes())
+
+        assert_(test_record_void_scalar == test_record)
+
+        # Test pickle and unpickle of void and record scalars
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            assert_(pickle.loads(
+                pickle.dumps(test_string, protocol=proto)) == test_string)
+            assert_(pickle.loads(
+                pickle.dumps(test_record, protocol=proto)) == test_record)
+
+    @_no_tracing
+    def test_blasdot_uninitialized_memory(self):
+        # Ticket #950
+        for m in [0, 1, 2]:
+            for n in [0, 1, 2]:
+                for k in range(3):
+                    # Try to ensure that x->data contains non-zero floats
+                    x = np.array([123456789e199], dtype=np.float64)
+                    if IS_PYPY:
+                        x.resize((m, 0), refcheck=False)
+                    else:
+                        x.resize((m, 0))
+                    y = np.array([123456789e199], dtype=np.float64)
+                    if IS_PYPY:
+                        y.resize((0, n), refcheck=False)
+                    else:
+                        y.resize((0, n))
+
+                    # `dot` should just return zero (m, n) matrix
+                    z = np.dot(x, y)
+                    assert_(np.all(z == 0))
+                    assert_(z.shape == (m, n))
+
+    def test_zeros(self):
+        # Regression test for #1061.
+        # Set a size which cannot fit into a 64 bits signed integer
+        sz = 2 ** 64
+        with assert_raises_regex(ValueError,
+                                 'Maximum allowed dimension exceeded'):
+            np.empty(sz)
+
+    def test_huge_arange(self):
+        # Regression test for #1062.
+        # Set a size which cannot fit into a 64 bits signed integer
+        sz = 2 ** 64
+        with assert_raises_regex(ValueError,
+                                 'Maximum allowed size exceeded'):
+            np.arange(sz)
+            assert_(np.size == sz)
+
+    def test_fromiter_bytes(self):
+        # Ticket #1058
+        a = np.fromiter(list(range(10)), dtype='b')
+        b = np.fromiter(list(range(10)), dtype='B')
+        assert_(np.alltrue(a == np.array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])))
+        assert_(np.alltrue(b == np.array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])))
+
+    def test_array_from_sequence_scalar_array(self):
+        # Ticket #1078: segfaults when creating an array with a sequence of
+        # 0d arrays.
+        a = np.array((np.ones(2), np.array(2)), dtype=object)
+        assert_equal(a.shape, (2,))
+        assert_equal(a.dtype, np.dtype(object))
+        assert_equal(a[0], np.ones(2))
+        assert_equal(a[1], np.array(2))
+
+        a = np.array(((1,), np.array(1)), dtype=object)
+        assert_equal(a.shape, (2,))
+        assert_equal(a.dtype, np.dtype(object))
+        assert_equal(a[0], (1,))
+        assert_equal(a[1], np.array(1))
+
+    def test_array_from_sequence_scalar_array2(self):
+        # Ticket #1081: weird array with strange input...
+        t = np.array([np.array([]), np.array(0, object)], dtype=object)
+        assert_equal(t.shape, (2,))
+        assert_equal(t.dtype, np.dtype(object))
+
+    def test_array_too_big(self):
+        # Ticket #1080.
+        assert_raises(ValueError, np.zeros, [975]*7, np.int8)
+        assert_raises(ValueError, np.zeros, [26244]*5, np.int8)
+
+    def test_dtype_keyerrors_(self):
+        # Ticket #1106.
+        dt = np.dtype([('f1', np.uint)])
+        assert_raises(KeyError, dt.__getitem__, "f2")
+        assert_raises(IndexError, dt.__getitem__, 1)
+        assert_raises(TypeError, dt.__getitem__, 0.0)
+
+    def test_lexsort_buffer_length(self):
+        # Ticket #1217, don't segfault.
+        a = np.ones(100, dtype=np.int8)
+        b = np.ones(100, dtype=np.int32)
+        i = np.lexsort((a[::-1], b))
+        assert_equal(i, np.arange(100, dtype=int))
+
+    def test_object_array_to_fixed_string(self):
+        # Ticket #1235.
+        a = np.array(['abcdefgh', 'ijklmnop'], dtype=np.object_)
+        b = np.array(a, dtype=(np.str_, 8))
+        assert_equal(a, b)
+        c = np.array(a, dtype=(np.str_, 5))
+        assert_equal(c, np.array(['abcde', 'ijklm']))
+        d = np.array(a, dtype=(np.str_, 12))
+        assert_equal(a, d)
+        e = np.empty((2, ), dtype=(np.str_, 8))
+        e[:] = a[:]
+        assert_equal(a, e)
+
+    def test_unicode_to_string_cast(self):
+        # Ticket #1240.
+        a = np.array([[u'abc', u'\u03a3'],
+                      [u'asdf', u'erw']],
+                     dtype='U')
+        assert_raises(UnicodeEncodeError, np.array, a, 'S4')
+
+    def test_unicode_to_string_cast_error(self):
+        # gh-15790
+        a = np.array([u'\x80'] * 129, dtype='U3')
+        assert_raises(UnicodeEncodeError, np.array, a, 'S')
+        b = a.reshape(3, 43)[:-1, :-1]
+        assert_raises(UnicodeEncodeError, np.array, b, 'S')
+
+    def test_mixed_string_unicode_array_creation(self):
+        a = np.array(['1234', u'123'])
+        assert_(a.itemsize == 16)
+        a = np.array([u'123', '1234'])
+        assert_(a.itemsize == 16)
+        a = np.array(['1234', u'123', '12345'])
+        assert_(a.itemsize == 20)
+        a = np.array([u'123', '1234', u'12345'])
+        assert_(a.itemsize == 20)
+        a = np.array([u'123', '1234', u'1234'])
+        assert_(a.itemsize == 16)
+
+    def test_misaligned_objects_segfault(self):
+        # Ticket #1198 and #1267
+        a1 = np.zeros((10,), dtype='O,c')
+        a2 = np.array(['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j'], 'S10')
+        a1['f0'] = a2
+        repr(a1)
+        np.argmax(a1['f0'])
+        a1['f0'][1] = "FOO"
+        a1['f0'] = "FOO"
+        np.array(a1['f0'], dtype='S')
+        np.nonzero(a1['f0'])
+        a1.sort()
+        copy.deepcopy(a1)
+
+    def test_misaligned_scalars_segfault(self):
+        # Ticket #1267
+        s1 = np.array(('a', 'Foo'), dtype='c,O')
+        s2 = np.array(('b', 'Bar'), dtype='c,O')
+        s1['f1'] = s2['f1']
+        s1['f1'] = 'Baz'
+
+    def test_misaligned_dot_product_objects(self):
+        # Ticket #1267
+        # This didn't require a fix, but it's worth testing anyway, because
+        # it may fail if .dot stops enforcing the arrays to be BEHAVED
+        a = np.array([[(1, 'a'), (0, 'a')], [(0, 'a'), (1, 'a')]], dtype='O,c')
+        b = np.array([[(4, 'a'), (1, 'a')], [(2, 'a'), (2, 'a')]], dtype='O,c')
+        np.dot(a['f0'], b['f0'])
+
+    def test_byteswap_complex_scalar(self):
+        # Ticket #1259 and gh-441
+        for dtype in [np.dtype('<'+t) for t in np.typecodes['Complex']]:
+            z = np.array([2.2-1.1j], dtype)
+            x = z[0]  # always native-endian
+            y = x.byteswap()
+            if x.dtype.byteorder == z.dtype.byteorder:
+                # little-endian machine
+                assert_equal(x, np.frombuffer(y.tobytes(), dtype=dtype.newbyteorder()))
+            else:
+                # big-endian machine
+                assert_equal(x, np.frombuffer(y.tobytes(), dtype=dtype))
+            # double check real and imaginary parts:
+            assert_equal(x.real, y.real.byteswap())
+            assert_equal(x.imag, y.imag.byteswap())
+
+    def test_structured_arrays_with_objects1(self):
+        # Ticket #1299
+        stra = 'aaaa'
+        strb = 'bbbb'
+        x = np.array([[(0, stra), (1, strb)]], 'i8,O')
+        x[x.nonzero()] = x.ravel()[:1]
+        assert_(x[0, 1] == x[0, 0])
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_structured_arrays_with_objects2(self):
+        # Ticket #1299 second test
+        stra = 'aaaa'
+        strb = 'bbbb'
+        numb = sys.getrefcount(strb)
+        numa = sys.getrefcount(stra)
+        x = np.array([[(0, stra), (1, strb)]], 'i8,O')
+        x[x.nonzero()] = x.ravel()[:1]
+        assert_(sys.getrefcount(strb) == numb)
+        assert_(sys.getrefcount(stra) == numa + 2)
+
+    def test_duplicate_title_and_name(self):
+        # Ticket #1254
+        dtspec = [(('a', 'a'), 'i'), ('b', 'i')]
+        assert_raises(ValueError, np.dtype, dtspec)
+
+    def test_signed_integer_division_overflow(self):
+        # Ticket #1317.
+        def test_type(t):
+            min = np.array([np.iinfo(t).min])
+            min //= -1
+
+        with np.errstate(divide="ignore"):
+            for t in (np.int8, np.int16, np.int32, np.int64, int):
+                test_type(t)
+
+    def test_buffer_hashlib(self):
+        from hashlib import md5
+
+        x = np.array([1, 2, 3], dtype=np.dtype('<i4'))
+        assert_equal(md5(x).hexdigest(), '2a1dd1e1e59d0a384c26951e316cd7e6')
+
+    def test_0d_string_scalar(self):
+        # Bug #1436; the following should succeed
+        np.asarray('x', '>c')
+
+    def test_log1p_compiler_shenanigans(self):
+        # Check if log1p is behaving on 32 bit intel systems.
+        assert_(np.isfinite(np.log1p(np.exp2(-53))))
+
+    def test_fromiter_comparison(self):
+        a = np.fromiter(list(range(10)), dtype='b')
+        b = np.fromiter(list(range(10)), dtype='B')
+        assert_(np.alltrue(a == np.array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])))
+        assert_(np.alltrue(b == np.array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])))
+
+    def test_fromstring_crash(self):
+        # Ticket #1345: the following should not cause a crash
+        with assert_warns(DeprecationWarning):
+            np.fromstring(b'aa, aa, 1.0', sep=',')
+
+    def test_ticket_1539(self):
+        dtypes = [x for x in np.typeDict.values()
+                  if (issubclass(x, np.number)
+                      and not issubclass(x, np.timedelta64))]
+        a = np.array([], np.bool_)  # not x[0] because it is unordered
+        failures = []
+
+        for x in dtypes:
+            b = a.astype(x)
+            for y in dtypes:
+                c = a.astype(y)
+                try:
+                    np.dot(b, c)
+                except TypeError:
+                    failures.append((x, y))
+        if failures:
+            raise AssertionError("Failures: %r" % failures)
+
+    def test_ticket_1538(self):
+        x = np.finfo(np.float32)
+        for name in 'eps epsneg max min resolution tiny'.split():
+            assert_equal(type(getattr(x, name)), np.float32,
+                         err_msg=name)
+
+    def test_ticket_1434(self):
+        # Check that the out= argument in var and std has an effect
+        data = np.array(((1, 2, 3), (4, 5, 6), (7, 8, 9)))
+        out = np.zeros((3,))
+
+        ret = data.var(axis=1, out=out)
+        assert_(ret is out)
+        assert_array_equal(ret, data.var(axis=1))
+
+        ret = data.std(axis=1, out=out)
+        assert_(ret is out)
+        assert_array_equal(ret, data.std(axis=1))
+
+    def test_complex_nan_maximum(self):
+        cnan = complex(0, np.nan)
+        assert_equal(np.maximum(1, cnan), cnan)
+
+    def test_subclass_int_tuple_assignment(self):
+        # ticket #1563
+        class Subclass(np.ndarray):
+            def __new__(cls, i):
+                return np.ones((i,)).view(cls)
+
+        x = Subclass(5)
+        x[(0,)] = 2  # shouldn't raise an exception
+        assert_equal(x[0], 2)
+
+    def test_ufunc_no_unnecessary_views(self):
+        # ticket #1548
+        class Subclass(np.ndarray):
+            pass
+        x = np.array([1, 2, 3]).view(Subclass)
+        y = np.add(x, x, x)
+        assert_equal(id(x), id(y))
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_take_refcount(self):
+        # ticket #939
+        a = np.arange(16, dtype=float)
+        a.shape = (4, 4)
+        lut = np.ones((5 + 3, 4), float)
+        rgba = np.empty(shape=a.shape + (4,), dtype=lut.dtype)
+        c1 = sys.getrefcount(rgba)
+        try:
+            lut.take(a, axis=0, mode='clip', out=rgba)
+        except TypeError:
+            pass
+        c2 = sys.getrefcount(rgba)
+        assert_equal(c1, c2)
+
+    def test_fromfile_tofile_seeks(self):
+        # On Python 3, tofile/fromfile used to get (#1610) the Python
+        # file handle out of sync
+        f0 = tempfile.NamedTemporaryFile()
+        f = f0.file
+        f.write(np.arange(255, dtype='u1').tobytes())
+
+        f.seek(20)
+        ret = np.fromfile(f, count=4, dtype='u1')
+        assert_equal(ret, np.array([20, 21, 22, 23], dtype='u1'))
+        assert_equal(f.tell(), 24)
+
+        f.seek(40)
+        np.array([1, 2, 3], dtype='u1').tofile(f)
+        assert_equal(f.tell(), 43)
+
+        f.seek(40)
+        data = f.read(3)
+        assert_equal(data, b"\x01\x02\x03")
+
+        f.seek(80)
+        f.read(4)
+        data = np.fromfile(f, dtype='u1', count=4)
+        assert_equal(data, np.array([84, 85, 86, 87], dtype='u1'))
+
+        f.close()
+
+    def test_complex_scalar_warning(self):
+        for tp in [np.csingle, np.cdouble, np.clongdouble]:
+            x = tp(1+2j)
+            assert_warns(np.ComplexWarning, float, x)
+            with suppress_warnings() as sup:
+                sup.filter(np.ComplexWarning)
+                assert_equal(float(x), float(x.real))
+
+    def test_complex_scalar_complex_cast(self):
+        for tp in [np.csingle, np.cdouble, np.clongdouble]:
+            x = tp(1+2j)
+            assert_equal(complex(x), 1+2j)
+
+    def test_complex_boolean_cast(self):
+        # Ticket #2218
+        for tp in [np.csingle, np.cdouble, np.clongdouble]:
+            x = np.array([0, 0+0.5j, 0.5+0j], dtype=tp)
+            assert_equal(x.astype(bool), np.array([0, 1, 1], dtype=bool))
+            assert_(np.any(x))
+            assert_(np.all(x[1:]))
+
+    def test_uint_int_conversion(self):
+        x = 2**64 - 1
+        assert_equal(int(np.uint64(x)), x)
+
+    def test_duplicate_field_names_assign(self):
+        ra = np.fromiter(((i*3, i*2) for i in range(10)), dtype='i8,f8')
+        ra.dtype.names = ('f1', 'f2')
+        repr(ra)  # should not cause a segmentation fault
+        assert_raises(ValueError, setattr, ra.dtype, 'names', ('f1', 'f1'))
+
+    def test_eq_string_and_object_array(self):
+        # From e-mail thread "__eq__ with str and object" (Keith Goodman)
+        a1 = np.array(['a', 'b'], dtype=object)
+        a2 = np.array(['a', 'c'])
+        assert_array_equal(a1 == a2, [True, False])
+        assert_array_equal(a2 == a1, [True, False])
+
+    def test_nonzero_byteswap(self):
+        a = np.array([0x80000000, 0x00000080, 0], dtype=np.uint32)
+        a.dtype = np.float32
+        assert_equal(a.nonzero()[0], [1])
+        a = a.byteswap().newbyteorder()
+        assert_equal(a.nonzero()[0], [1])  # [0] if nonzero() ignores swap
+
+    def test_find_common_type_boolean(self):
+        # Ticket #1695
+        assert_(np.find_common_type([], ['?', '?']) == '?')
+
+    def test_empty_mul(self):
+        a = np.array([1.])
+        a[1:1] *= 2
+        assert_equal(a, [1.])
+
+    def test_array_side_effect(self):
+        # The second use of itemsize was throwing an exception because in
+        # ctors.c, discover_itemsize was calling PyObject_Length without
+        # checking the return code.  This failed to get the length of the
+        # number 2, and the exception hung around until something checked
+        # PyErr_Occurred() and returned an error.
+        assert_equal(np.dtype('S10').itemsize, 10)
+        np.array([['abc', 2], ['long   ', '0123456789']], dtype=np.string_)
+        assert_equal(np.dtype('S10').itemsize, 10)
+
+    def test_any_float(self):
+        # all and any for floats
+        a = np.array([0.1, 0.9])
+        assert_(np.any(a))
+        assert_(np.all(a))
+
+    def test_large_float_sum(self):
+        a = np.arange(10000, dtype='f')
+        assert_equal(a.sum(dtype='d'), a.astype('d').sum())
+
+    def test_ufunc_casting_out(self):
+        a = np.array(1.0, dtype=np.float32)
+        b = np.array(1.0, dtype=np.float64)
+        c = np.array(1.0, dtype=np.float32)
+        np.add(a, b, out=c)
+        assert_equal(c, 2.0)
+
+    def test_array_scalar_contiguous(self):
+        # Array scalars are both C and Fortran contiguous
+        assert_(np.array(1.0).flags.c_contiguous)
+        assert_(np.array(1.0).flags.f_contiguous)
+        assert_(np.array(np.float32(1.0)).flags.c_contiguous)
+        assert_(np.array(np.float32(1.0)).flags.f_contiguous)
+
+    def test_squeeze_contiguous(self):
+        # Similar to GitHub issue #387
+        a = np.zeros((1, 2)).squeeze()
+        b = np.zeros((2, 2, 2), order='F')[:, :, ::2].squeeze()
+        assert_(a.flags.c_contiguous)
+        assert_(a.flags.f_contiguous)
+        assert_(b.flags.f_contiguous)
+
+    def test_squeeze_axis_handling(self):
+        # Issue #10779
+        # Ensure proper handling of objects
+        # that don't support axis specification
+        # when squeezing
+
+        class OldSqueeze(np.ndarray):
+
+            def __new__(cls,
+                        input_array):
+                obj = np.asarray(input_array).view(cls)
+                return obj
+
+            # it is perfectly reasonable that prior
+            # to numpy version 1.7.0 a subclass of ndarray
+            # might have been created that did not expect
+            # squeeze to have an axis argument
+            # NOTE: this example is somewhat artificial;
+            # it is designed to simulate an old API
+            # expectation to guard against regression
+            def squeeze(self):
+                return super(OldSqueeze, self).squeeze()
+
+        oldsqueeze = OldSqueeze(np.array([[1],[2],[3]]))
+
+        # if no axis argument is specified the old API
+        # expectation should give the correct result
+        assert_equal(np.squeeze(oldsqueeze),
+                     np.array([1,2,3]))
+
+        # likewise, axis=None should work perfectly well
+        # with the old API expectation
+        assert_equal(np.squeeze(oldsqueeze, axis=None),
+                     np.array([1,2,3]))
+
+        # however, specification of any particular axis
+        # should raise a TypeError in the context of the
+        # old API specification, even when using a valid
+        # axis specification like 1 for this array
+        with assert_raises(TypeError):
+            # this would silently succeed for array
+            # subclasses / objects that did not support
+            # squeeze axis argument handling before fixing
+            # Issue #10779
+            np.squeeze(oldsqueeze, axis=1)
+
+        # check for the same behavior when using an invalid
+        # axis specification -- in this case axis=0 does not
+        # have size 1, but the priority should be to raise
+        # a TypeError for the axis argument and NOT a
+        # ValueError for squeezing a non-empty dimension
+        with assert_raises(TypeError):
+            np.squeeze(oldsqueeze, axis=0)
+
+        # the new API knows how to handle the axis
+        # argument and will return a ValueError if
+        # attempting to squeeze an axis that is not
+        # of length 1
+        with assert_raises(ValueError):
+            np.squeeze(np.array([[1],[2],[3]]), axis=0)
+
+    def test_reduce_contiguous(self):
+        # GitHub issue #387
+        a = np.add.reduce(np.zeros((2, 1, 2)), (0, 1))
+        b = np.add.reduce(np.zeros((2, 1, 2)), 1)
+        assert_(a.flags.c_contiguous)
+        assert_(a.flags.f_contiguous)
+        assert_(b.flags.c_contiguous)
+
+    def test_object_array_self_reference(self):
+        # Object arrays with references to themselves can cause problems
+        a = np.array(0, dtype=object)
+        a[()] = a
+        assert_raises(RecursionError, int, a)
+        assert_raises(RecursionError, float, a)
+        a[()] = None
+
+    def test_object_array_circular_reference(self):
+        # Test the same for a circular reference.
+        a = np.array(0, dtype=object)
+        b = np.array(0, dtype=object)
+        a[()] = b
+        b[()] = a
+        assert_raises(RecursionError, int, a)
+        # NumPy has no tp_traverse currently, so circular references
+        # cannot be detected. So resolve it:
+        a[()] = None
+
+        # This was causing a to become like the above
+        a = np.array(0, dtype=object)
+        a[...] += 1
+        assert_equal(a, 1)
+
+    def test_object_array_nested(self):
+        # but is fine with a reference to a different array
+        a = np.array(0, dtype=object)
+        b = np.array(0, dtype=object)
+        a[()] = b
+        assert_equal(int(a), int(0))
+        assert_equal(float(a), float(0))
+
+    def test_object_array_self_copy(self):
+        # An object array being copied into itself DECREF'ed before INCREF'ing
+        # causing segmentation faults (gh-3787)
+        a = np.array(object(), dtype=object)
+        np.copyto(a, a)
+        if HAS_REFCOUNT:
+            assert_(sys.getrefcount(a[()]) == 2)
+        a[()].__class__  # will segfault if object was deleted
+
+    def test_zerosize_accumulate(self):
+        "Ticket #1733"
+        x = np.array([[42, 0]], dtype=np.uint32)
+        assert_equal(np.add.accumulate(x[:-1, 0]), [])
+
+    def test_objectarray_setfield(self):
+        # Setfield should not overwrite Object fields with non-Object data
+        x = np.array([1, 2, 3], dtype=object)
+        assert_raises(TypeError, x.setfield, 4, np.int32, 0)
+
+    def test_setting_rank0_string(self):
+        "Ticket #1736"
+        s1 = b"hello1"
+        s2 = b"hello2"
+        a = np.zeros((), dtype="S10")
+        a[()] = s1
+        assert_equal(a, np.array(s1))
+        a[()] = np.array(s2)
+        assert_equal(a, np.array(s2))
+
+        a = np.zeros((), dtype='f4')
+        a[()] = 3
+        assert_equal(a, np.array(3))
+        a[()] = np.array(4)
+        assert_equal(a, np.array(4))
+
+    def test_string_astype(self):
+        "Ticket #1748"
+        s1 = b'black'
+        s2 = b'white'
+        s3 = b'other'
+        a = np.array([[s1], [s2], [s3]])
+        assert_equal(a.dtype, np.dtype('S5'))
+        b = a.astype(np.dtype('S0'))
+        assert_equal(b.dtype, np.dtype('S5'))
+
+    def test_ticket_1756(self):
+        # Ticket #1756
+        s = b'0123456789abcdef'
+        a = np.array([s]*5)
+        for i in range(1, 17):
+            a1 = np.array(a, "|S%d" % i)
+            a2 = np.array([s[:i]]*5)
+            assert_equal(a1, a2)
+
+    def test_fields_strides(self):
+        "gh-2355"
+        r = np.frombuffer(b'abcdefghijklmnop'*4*3, dtype='i4,(2,3)u2')
+        assert_equal(r[0:3:2]['f1'], r['f1'][0:3:2])
+        assert_equal(r[0:3:2]['f1'][0], r[0:3:2][0]['f1'])
+        assert_equal(r[0:3:2]['f1'][0][()], r[0:3:2][0]['f1'][()])
+        assert_equal(r[0:3:2]['f1'][0].strides, r[0:3:2][0]['f1'].strides)
+
+    def test_alignment_update(self):
+        # Check that alignment flag is updated on stride setting
+        a = np.arange(10)
+        assert_(a.flags.aligned)
+        a.strides = 3
+        assert_(not a.flags.aligned)
+
+    def test_ticket_1770(self):
+        "Should not segfault on python 3k"
+        import numpy as np
+        try:
+            a = np.zeros((1,), dtype=[('f1', 'f')])
+            a['f1'] = 1
+            a['f2'] = 1
+        except ValueError:
+            pass
+        except Exception:
+            raise AssertionError
+
+    def test_ticket_1608(self):
+        "x.flat shouldn't modify data"
+        x = np.array([[1, 2], [3, 4]]).T
+        np.array(x.flat)
+        assert_equal(x, [[1, 3], [2, 4]])
+
+    def test_pickle_string_overwrite(self):
+        import re
+
+        data = np.array([1], dtype='b')
+        blob = pickle.dumps(data, protocol=1)
+        data = pickle.loads(blob)
+
+        # Check that loads does not clobber interned strings
+        s = re.sub("a(.)", "\x01\\1", "a_")
+        assert_equal(s[0], "\x01")
+        data[0] = 0xbb
+        s = re.sub("a(.)", "\x01\\1", "a_")
+        assert_equal(s[0], "\x01")
+
+    def test_pickle_bytes_overwrite(self):
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            data = np.array([1], dtype='b')
+            data = pickle.loads(pickle.dumps(data, protocol=proto))
+            data[0] = 0xdd
+            bytestring = "\x01  ".encode('ascii')
+            assert_equal(bytestring[0:1], '\x01'.encode('ascii'))
+
+    def test_pickle_py2_array_latin1_hack(self):
+        # Check that unpickling hacks in Py3 that support
+        # encoding='latin1' work correctly.
+
+        # Python2 output for pickle.dumps(numpy.array([129], dtype='b'))
+        data = (b"cnumpy.core.multiarray\n_reconstruct\np0\n(cnumpy\nndarray\np1\n(I0\n"
+                b"tp2\nS'b'\np3\ntp4\nRp5\n(I1\n(I1\ntp6\ncnumpy\ndtype\np7\n(S'i1'\np8\n"
+                b"I0\nI1\ntp9\nRp10\n(I3\nS'|'\np11\nNNNI-1\nI-1\nI0\ntp12\nbI00\nS'\\x81'\n"
+                b"p13\ntp14\nb.")
+        # This should work:
+        result = pickle.loads(data, encoding='latin1')
+        assert_array_equal(result, np.array([129], dtype='b'))
+        # Should not segfault:
+        assert_raises(Exception, pickle.loads, data, encoding='koi8-r')
+
+    def test_pickle_py2_scalar_latin1_hack(self):
+        # Check that scalar unpickling hack in Py3 that supports
+        # encoding='latin1' work correctly.
+
+        # Python2 output for pickle.dumps(...)
+        datas = [
+            # (original, python2_pickle, koi8r_validity)
+            (np.unicode_('\u6bd2'),
+             (b"cnumpy.core.multiarray\nscalar\np0\n(cnumpy\ndtype\np1\n"
+              b"(S'U1'\np2\nI0\nI1\ntp3\nRp4\n(I3\nS'<'\np5\nNNNI4\nI4\nI0\n"
+              b"tp6\nbS'\\xd2k\\x00\\x00'\np7\ntp8\nRp9\n."),
+             'invalid'),
+
+            (np.float64(9e123),
+             (b"cnumpy.core.multiarray\nscalar\np0\n(cnumpy\ndtype\np1\n(S'f8'\n"
+              b"p2\nI0\nI1\ntp3\nRp4\n(I3\nS'<'\np5\nNNNI-1\nI-1\nI0\ntp6\n"
+              b"bS'O\\x81\\xb7Z\\xaa:\\xabY'\np7\ntp8\nRp9\n."),
+             'invalid'),
+
+            (np.bytes_(b'\x9c'),  # different 8-bit code point in KOI8-R vs latin1
+             (b"cnumpy.core.multiarray\nscalar\np0\n(cnumpy\ndtype\np1\n(S'S1'\np2\n"
+              b"I0\nI1\ntp3\nRp4\n(I3\nS'|'\np5\nNNNI1\nI1\nI0\ntp6\nbS'\\x9c'\np7\n"
+              b"tp8\nRp9\n."),
+             'different'),
+        ]
+        for original, data, koi8r_validity in datas:
+            result = pickle.loads(data, encoding='latin1')
+            assert_equal(result, original)
+
+            # Decoding under non-latin1 encoding (e.g.) KOI8-R can
+            # produce bad results, but should not segfault.
+            if koi8r_validity == 'different':
+                # Unicode code points happen to lie within latin1,
+                # but are different in koi8-r, resulting to silent
+                # bogus results
+                result = pickle.loads(data, encoding='koi8-r')
+                assert_(result != original)
+            elif koi8r_validity == 'invalid':
+                # Unicode code points outside latin1, so results
+                # to an encoding exception
+                assert_raises(ValueError, pickle.loads, data, encoding='koi8-r')
+            else:
+                raise ValueError(koi8r_validity)
+
+    def test_structured_type_to_object(self):
+        a_rec = np.array([(0, 1), (3, 2)], dtype='i4,i8')
+        a_obj = np.empty((2,), dtype=object)
+        a_obj[0] = (0, 1)
+        a_obj[1] = (3, 2)
+        # astype records -> object
+        assert_equal(a_rec.astype(object), a_obj)
+        # '=' records -> object
+        b = np.empty_like(a_obj)
+        b[...] = a_rec
+        assert_equal(b, a_obj)
+        # '=' object -> records
+        b = np.empty_like(a_rec)
+        b[...] = a_obj
+        assert_equal(b, a_rec)
+
+    def test_assign_obj_listoflists(self):
+        # Ticket # 1870
+        # The inner list should get assigned to the object elements
+        a = np.zeros(4, dtype=object)
+        b = a.copy()
+        a[0] = [1]
+        a[1] = [2]
+        a[2] = [3]
+        a[3] = [4]
+        b[...] = [[1], [2], [3], [4]]
+        assert_equal(a, b)
+        # The first dimension should get broadcast
+        a = np.zeros((2, 2), dtype=object)
+        a[...] = [[1, 2]]
+        assert_equal(a, [[1, 2], [1, 2]])
+
+    @pytest.mark.slow_pypy
+    def test_memoryleak(self):
+        # Ticket #1917 - ensure that array data doesn't leak
+        for i in range(1000):
+            # 100MB times 1000 would give 100GB of memory usage if it leaks
+            a = np.empty((100000000,), dtype='i1')
+            del a
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_ufunc_reduce_memoryleak(self):
+        a = np.arange(6)
+        acnt = sys.getrefcount(a)
+        np.add.reduce(a)
+        assert_equal(sys.getrefcount(a), acnt)
+
+    def test_search_sorted_invalid_arguments(self):
+        # Ticket #2021, should not segfault.
+        x = np.arange(0, 4, dtype='datetime64[D]')
+        assert_raises(TypeError, x.searchsorted, 1)
+
+    def test_string_truncation(self):
+        # Ticket #1990 - Data can be truncated in creation of an array from a
+        # mixed sequence of numeric values and strings
+        for val in [True, 1234, 123.4, complex(1, 234)]:
+            for tostr in [asunicode, asbytes]:
+                b = np.array([val, tostr('xx')])
+                assert_equal(tostr(b[0]), tostr(val))
+                b = np.array([tostr('xx'), val])
+                assert_equal(tostr(b[1]), tostr(val))
+
+                # test also with longer strings
+                b = np.array([val, tostr('xxxxxxxxxx')])
+                assert_equal(tostr(b[0]), tostr(val))
+                b = np.array([tostr('xxxxxxxxxx'), val])
+                assert_equal(tostr(b[1]), tostr(val))
+
+    def test_string_truncation_ucs2(self):
+        # Ticket #2081. Python compiled with two byte unicode
+        # can lead to truncation if itemsize is not properly
+        # adjusted for NumPy's four byte unicode.
+        a = np.array(['abcd'])
+        assert_equal(a.dtype.itemsize, 16)
+
+    def test_unique_stable(self):
+        # Ticket #2063 must always choose stable sort for argsort to
+        # get consistent results
+        v = np.array(([0]*5 + [1]*6 + [2]*6)*4)
+        res = np.unique(v, return_index=True)
+        tgt = (np.array([0, 1, 2]), np.array([ 0,  5, 11]))
+        assert_equal(res, tgt)
+
+    def test_unicode_alloc_dealloc_match(self):
+        # Ticket #1578, the mismatch only showed up when running
+        # python-debug for python versions >= 2.7, and then as
+        # a core dump and error message.
+        a = np.array(['abc'], dtype=np.unicode_)[0]
+        del a
+
+    def test_refcount_error_in_clip(self):
+        # Ticket #1588
+        a = np.zeros((2,), dtype='>i2').clip(min=0)
+        x = a + a
+        # This used to segfault:
+        y = str(x)
+        # Check the final string:
+        assert_(y == "[0 0]")
+
+    def test_searchsorted_wrong_dtype(self):
+        # Ticket #2189, it used to segfault, so we check that it raises the
+        # proper exception.
+        a = np.array([('a', 1)], dtype='S1, int')
+        assert_raises(TypeError, np.searchsorted, a, 1.2)
+        # Ticket #2066, similar problem:
+        dtype = np.format_parser(['i4', 'i4'], [], [])
+        a = np.recarray((2, ), dtype)
+        assert_raises(TypeError, np.searchsorted, a, 1)
+
+    def test_complex64_alignment(self):
+        # Issue gh-2668 (trac 2076), segfault on sparc due to misalignment
+        dtt = np.complex64
+        arr = np.arange(10, dtype=dtt)
+        # 2D array
+        arr2 = np.reshape(arr, (2, 5))
+        # Fortran write followed by (C or F) read caused bus error
+        data_str = arr2.tobytes('F')
+        data_back = np.ndarray(arr2.shape,
+                              arr2.dtype,
+                              buffer=data_str,
+                              order='F')
+        assert_array_equal(arr2, data_back)
+
+    def test_structured_count_nonzero(self):
+        arr = np.array([0, 1]).astype('i4, (2)i4')[:1]
+        count = np.count_nonzero(arr)
+        assert_equal(count, 0)
+
+    def test_copymodule_preserves_f_contiguity(self):
+        a = np.empty((2, 2), order='F')
+        b = copy.copy(a)
+        c = copy.deepcopy(a)
+        assert_(b.flags.fortran)
+        assert_(b.flags.f_contiguous)
+        assert_(c.flags.fortran)
+        assert_(c.flags.f_contiguous)
+
+    def test_fortran_order_buffer(self):
+        import numpy as np
+        a = np.array([['Hello', 'Foob']], dtype='U5', order='F')
+        arr = np.ndarray(shape=[1, 2, 5], dtype='U1', buffer=a)
+        arr2 = np.array([[[u'H', u'e', u'l', u'l', u'o'],
+                          [u'F', u'o', u'o', u'b', u'']]])
+        assert_array_equal(arr, arr2)
+
+    def test_assign_from_sequence_error(self):
+        # Ticket #4024.
+        arr = np.array([1, 2, 3])
+        assert_raises(ValueError, arr.__setitem__, slice(None), [9, 9])
+        arr.__setitem__(slice(None), [9])
+        assert_equal(arr, [9, 9, 9])
+
+    def test_format_on_flex_array_element(self):
+        # Ticket #4369.
+        dt = np.dtype([('date', '<M8[D]'), ('val', '<f8')])
+        arr = np.array([('2000-01-01', 1)], dt)
+        formatted = '{0}'.format(arr[0])
+        assert_equal(formatted, str(arr[0]))
+
+    def test_deepcopy_on_0d_array(self):
+        # Ticket #3311.
+        arr = np.array(3)
+        arr_cp = copy.deepcopy(arr)
+
+        assert_equal(arr, arr_cp)
+        assert_equal(arr.shape, arr_cp.shape)
+        assert_equal(int(arr), int(arr_cp))
+        assert_(arr is not arr_cp)
+        assert_(isinstance(arr_cp, type(arr)))
+
+    def test_deepcopy_F_order_object_array(self):
+        # Ticket #6456.
+        a = {'a': 1}
+        b = {'b': 2}
+        arr = np.array([[a, b], [a, b]], order='F')
+        arr_cp = copy.deepcopy(arr)
+
+        assert_equal(arr, arr_cp)
+        assert_(arr is not arr_cp)
+        # Ensure that we have actually copied the item.
+        assert_(arr[0, 1] is not arr_cp[1, 1])
+        # Ensure we are allowed to have references to the same object.
+        assert_(arr[0, 1] is arr[1, 1])
+        # Check the references hold for the copied objects.
+        assert_(arr_cp[0, 1] is arr_cp[1, 1])
+
+    def test_deepcopy_empty_object_array(self):
+        # Ticket #8536.
+        # Deepcopy should succeed
+        a = np.array([], dtype=object)
+        b = copy.deepcopy(a)
+        assert_(a.shape == b.shape)
+
+    def test_bool_subscript_crash(self):
+        # gh-4494
+        c = np.rec.array([(1, 2, 3), (4, 5, 6)])
+        masked = c[np.array([True, False])]
+        base = masked.base
+        del masked, c
+        base.dtype
+
+    def test_richcompare_crash(self):
+        # gh-4613
+        import operator as op
+
+        # dummy class where __array__ throws exception
+        class Foo:
+            __array_priority__ = 1002
+
+            def __array__(self, *args, **kwargs):
+                raise Exception()
+
+        rhs = Foo()
+        lhs = np.array(1)
+        for f in [op.lt, op.le, op.gt, op.ge]:
+            assert_raises(TypeError, f, lhs, rhs)
+        assert_(not op.eq(lhs, rhs))
+        assert_(op.ne(lhs, rhs))
+
+    def test_richcompare_scalar_and_subclass(self):
+        # gh-4709
+        class Foo(np.ndarray):
+            def __eq__(self, other):
+                return "OK"
+
+        x = np.array([1, 2, 3]).view(Foo)
+        assert_equal(10 == x, "OK")
+        assert_equal(np.int32(10) == x, "OK")
+        assert_equal(np.array([10]) == x, "OK")
+
+    def test_pickle_empty_string(self):
+        # gh-3926
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            test_string = np.string_('')
+            assert_equal(pickle.loads(
+                pickle.dumps(test_string, protocol=proto)), test_string)
+
+    def test_frompyfunc_many_args(self):
+        # gh-5672
+
+        def passer(*args):
+            pass
+
+        assert_raises(ValueError, np.frompyfunc, passer, 32, 1)
+
+    def test_repeat_broadcasting(self):
+        # gh-5743
+        a = np.arange(60).reshape(3, 4, 5)
+        for axis in chain(range(-a.ndim, a.ndim), [None]):
+            assert_equal(a.repeat(2, axis=axis), a.repeat([2], axis=axis))
+
+    def test_frompyfunc_nout_0(self):
+        # gh-2014
+
+        def f(x):
+            x[0], x[-1] = x[-1], x[0]
+
+        uf = np.frompyfunc(f, 1, 0)
+        a = np.array([[1, 2, 3], [4, 5], [6, 7, 8, 9]], dtype=object)
+        assert_equal(uf(a), ())
+        expected = np.array([[3, 2, 1], [5, 4], [9, 7, 8, 6]], dtype=object)
+        assert_array_equal(a, expected)
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_leak_in_structured_dtype_comparison(self):
+        # gh-6250
+        recordtype = np.dtype([('a', np.float64),
+                               ('b', np.int32),
+                               ('d', (str, 5))])
+
+        # Simple case
+        a = np.zeros(2, dtype=recordtype)
+        for i in range(100):
+            a == a
+        assert_(sys.getrefcount(a) < 10)
+
+        # The case in the bug report.
+        before = sys.getrefcount(a)
+        u, v = a[0], a[1]
+        u == v
+        del u, v
+        gc.collect()
+        after = sys.getrefcount(a)
+        assert_equal(before, after)
+
+    def test_empty_percentile(self):
+        # gh-6530 / gh-6553
+        assert_array_equal(np.percentile(np.arange(10), []), np.array([]))
+
+    def test_void_compare_segfault(self):
+        # gh-6922. The following should not segfault
+        a = np.ones(3, dtype=[('object', 'O'), ('int', '<i2')])
+        a.sort()
+
+    def test_reshape_size_overflow(self):
+        # gh-7455
+        a = np.ones(20)[::2]
+        if np.dtype(np.intp).itemsize == 8:
+            # 64 bit. The following are the prime factors of 2**63 + 5,
+            # plus a leading 2, so when multiplied together as int64,
+            # the result overflows to a total size of 10.
+            new_shape = (2, 13, 419, 691, 823, 2977518503)
+        else:
+            # 32 bit. The following are the prime factors of 2**31 + 5,
+            # plus a leading 2, so when multiplied together as int32,
+            # the result overflows to a total size of 10.
+            new_shape = (2, 7, 7, 43826197)
+        assert_raises(ValueError, a.reshape, new_shape)
+
+    def test_invalid_structured_dtypes(self):
+        # gh-2865
+        # mapping python objects to other dtypes
+        assert_raises(ValueError, np.dtype, ('O', [('name', 'i8')]))
+        assert_raises(ValueError, np.dtype, ('i8', [('name', 'O')]))
+        assert_raises(ValueError, np.dtype,
+                      ('i8', [('name', [('name', 'O')])]))
+        assert_raises(ValueError, np.dtype, ([('a', 'i4'), ('b', 'i4')], 'O'))
+        assert_raises(ValueError, np.dtype, ('i8', 'O'))
+        # wrong number/type of tuple elements in dict
+        assert_raises(ValueError, np.dtype,
+                      ('i', {'name': ('i', 0, 'title', 'oops')}))
+        assert_raises(ValueError, np.dtype,
+                      ('i', {'name': ('i', 'wrongtype', 'title')}))
+        # disallowed as of 1.13
+        assert_raises(ValueError, np.dtype,
+                      ([('a', 'O'), ('b', 'O')], [('c', 'O'), ('d', 'O')]))
+        # allowed as a special case due to existing use, see gh-2798
+        a = np.ones(1, dtype=('O', [('name', 'O')]))
+        assert_equal(a[0], 1)
+
+    def test_correct_hash_dict(self):
+        # gh-8887 - __hash__ would be None despite tp_hash being set
+        all_types = set(np.typeDict.values()) - {np.void}
+        for t in all_types:
+            val = t()
+
+            try:
+                hash(val)
+            except TypeError as e:
+                assert_equal(t.__hash__, None)
+            else:
+                assert_(t.__hash__ != None)
+
+    def test_scalar_copy(self):
+        scalar_types = set(np.sctypeDict.values())
+        values = {
+            np.void: b"a",
+            np.bytes_: b"a",
+            np.unicode_: "a",
+            np.datetime64: "2017-08-25",
+        }
+        for sctype in scalar_types:
+            item = sctype(values.get(sctype, 1))
+            item2 = copy.copy(item)
+            assert_equal(item, item2)
+
+    def test_void_item_memview(self):
+        va = np.zeros(10, 'V4')
+        x = va[:1].item()
+        va[0] = b'\xff\xff\xff\xff'
+        del va
+        assert_equal(x, b'\x00\x00\x00\x00')
+
+    def test_void_getitem(self):
+        # Test fix for gh-11668.
+        assert_(np.array([b'a'], 'V1').astype('O') == b'a')
+        assert_(np.array([b'ab'], 'V2').astype('O') == b'ab')
+        assert_(np.array([b'abc'], 'V3').astype('O') == b'abc')
+        assert_(np.array([b'abcd'], 'V4').astype('O') == b'abcd')
+
+    def test_structarray_title(self):
+        # The following used to segfault on pypy, due to NPY_TITLE_KEY
+        # not working properly and resulting to double-decref of the
+        # structured array field items:
+        # See: https://bitbucket.org/pypy/pypy/issues/2789
+        for j in range(5):
+            structure = np.array([1], dtype=[(('x', 'X'), np.object_)])
+            structure[0]['x'] = np.array([2])
+            gc.collect()
+
+    def test_dtype_scalar_squeeze(self):
+        # gh-11384
+        values = {
+            'S': b"a",
+            'M': "2018-06-20",
+        }
+        for ch in np.typecodes['All']:
+            if ch in 'O':
+                continue
+            sctype = np.dtype(ch).type
+            scvalue = sctype(values.get(ch, 3))
+            for axis in [None, ()]:
+                squeezed = scvalue.squeeze(axis=axis)
+                assert_equal(squeezed, scvalue)
+                assert_equal(type(squeezed), type(scvalue))
+
+    def test_field_access_by_title(self):
+        # gh-11507
+        s = 'Some long field name'
+        if HAS_REFCOUNT:
+            base = sys.getrefcount(s)
+        t = np.dtype([((s, 'f1'), np.float64)])
+        data = np.zeros(10, t)
+        for i in range(10):
+            str(data[['f1']])
+            if HAS_REFCOUNT:
+                assert_(base <= sys.getrefcount(s))
+
+    @pytest.mark.parametrize('val', [
+        # arrays and scalars
+        np.ones((10, 10), dtype='int32'),
+        np.uint64(10),
+        ])
+    @pytest.mark.parametrize('protocol',
+        range(2, pickle.HIGHEST_PROTOCOL + 1)
+        )
+    def test_pickle_module(self, protocol, val):
+        # gh-12837
+        s = pickle.dumps(val, protocol)
+        assert b'_multiarray_umath' not in s
+        if protocol == 5 and len(val.shape) > 0:
+            # unpickling ndarray goes through _frombuffer for protocol 5
+            assert b'numpy.core.numeric' in s
+        else:
+            assert b'numpy.core.multiarray' in s
+
+    def test_object_casting_errors(self):
+        # gh-11993 update to ValueError (see gh-16909), since strings can in
+        # principle be converted to complex, but this string cannot.
+        arr = np.array(['AAAAA', 18465886.0, 18465886.0], dtype=object)
+        assert_raises(ValueError, arr.astype, 'c8')
+
+    def test_eff1d_casting(self):
+        # gh-12711
+        x = np.array([1, 2, 4, 7, 0], dtype=np.int16)
+        res = np.ediff1d(x, to_begin=-99, to_end=np.array([88, 99]))
+        assert_equal(res, [-99,   1,   2,   3,  -7,  88,  99])
+
+        # The use of safe casting means, that 1<<20 is cast unsafely, an
+        # error may be better, but currently there is no mechanism for it.
+        res = np.ediff1d(x, to_begin=(1<<20), to_end=(1<<20))
+        assert_equal(res, [0,   1,   2,   3,  -7,  0])
+
+    def test_pickle_datetime64_array(self):
+        # gh-12745 (would fail with pickle5 installed)
+        d = np.datetime64('2015-07-04 12:59:59.50', 'ns')
+        arr = np.array([d])
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            dumped = pickle.dumps(arr, protocol=proto)
+            assert_equal(pickle.loads(dumped), arr)
+
+    def test_bad_array_interface(self):
+        class T:
+            __array_interface__ = {}
+
+        np.array([T()])
+
+    def test_2d__array__shape(self):
+        class T(object):
+            def __array__(self):
+                return np.ndarray(shape=(0,0))
+
+            # Make sure __array__ is used instead of Sequence methods.
+            def __iter__(self):
+                return iter([])
+
+            def __getitem__(self, idx):
+                raise AssertionError("__getitem__ was called")
+
+            def __len__(self):
+                return 0
+
+
+        t = T()
+        # gh-13659, would raise in broadcasting [x=t for x in result]
+        arr = np.array([t])
+        assert arr.shape == (1, 0, 0)
+
+    @pytest.mark.skipif(sys.maxsize < 2 ** 31 + 1, reason='overflows 32-bit python')
+    @pytest.mark.skipif(sys.platform == 'win32' and sys.version_info[:2] < (3, 8),
+                        reason='overflows on windows, fixed in bpo-16865')
+    def test_to_ctypes(self):
+        #gh-14214
+        arr = np.zeros((2 ** 31 + 1,), 'b')
+        assert arr.size * arr.itemsize > 2 ** 31
+        c_arr = np.ctypeslib.as_ctypes(arr)
+        assert_equal(c_arr._length_, arr.size)
+
+    @pytest.mark.skipif(sys.maxsize < 2 ** 31 + 1, reason='overflows 32-bit python')
+    @requires_memory(free_bytes=9e9)
+    def test_dot_big_stride(self):
+        # gh-17111
+        # blas stride = stride//itemsize > int32 max
+        int32_max = np.iinfo(np.int32).max
+        n = int32_max + 3
+        a = np.empty([n], dtype=np.float32)
+        b = a[::n-1]
+        b[...] = 1
+        assert b.strides[0] > int32_max * b.dtype.itemsize
+        assert np.dot(b, b) == 2.0
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalar_ctors.py b/venv/Lib/site-packages/numpy/core/tests/test_scalar_ctors.py
new file mode 100644
index 000000000..7645a0853
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalar_ctors.py
@@ -0,0 +1,81 @@
+"""
+Test the scalar constructors, which also do type-coercion
+"""
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_equal, assert_almost_equal, assert_warns,
+    )
+
+class TestFromString:
+    def test_floating(self):
+        # Ticket #640, floats from string
+        fsingle = np.single('1.234')
+        fdouble = np.double('1.234')
+        flongdouble = np.longdouble('1.234')
+        assert_almost_equal(fsingle, 1.234)
+        assert_almost_equal(fdouble, 1.234)
+        assert_almost_equal(flongdouble, 1.234)
+
+    def test_floating_overflow(self):
+        """ Strings containing an unrepresentable float overflow """
+        fhalf = np.half('1e10000')
+        assert_equal(fhalf, np.inf)
+        fsingle = np.single('1e10000')
+        assert_equal(fsingle, np.inf)
+        fdouble = np.double('1e10000')
+        assert_equal(fdouble, np.inf)
+        flongdouble = assert_warns(RuntimeWarning, np.longdouble, '1e10000')
+        assert_equal(flongdouble, np.inf)
+
+        fhalf = np.half('-1e10000')
+        assert_equal(fhalf, -np.inf)
+        fsingle = np.single('-1e10000')
+        assert_equal(fsingle, -np.inf)
+        fdouble = np.double('-1e10000')
+        assert_equal(fdouble, -np.inf)
+        flongdouble = assert_warns(RuntimeWarning, np.longdouble, '-1e10000')
+        assert_equal(flongdouble, -np.inf)
+
+
+class TestExtraArgs:
+    def test_superclass(self):
+        # try both positional and keyword arguments
+        s = np.str_(b'\\x61', encoding='unicode-escape')
+        assert s == 'a'
+        s = np.str_(b'\\x61', 'unicode-escape')
+        assert s == 'a'
+
+        # previously this would return '\\xx'
+        with pytest.raises(UnicodeDecodeError):
+            np.str_(b'\\xx', encoding='unicode-escape')
+        with pytest.raises(UnicodeDecodeError):
+            np.str_(b'\\xx', 'unicode-escape')
+
+        # superclass fails, but numpy succeeds
+        assert np.bytes_(-2) == b'-2'
+
+    def test_datetime(self):
+        dt = np.datetime64('2000-01', ('M', 2))
+        assert np.datetime_data(dt) == ('M', 2)
+
+        with pytest.raises(TypeError):
+            np.datetime64('2000', garbage=True)
+
+    def test_bool(self):
+        with pytest.raises(TypeError):
+            np.bool(False, garbage=True)
+
+    def test_void(self):
+        with pytest.raises(TypeError):
+            np.void(b'test', garbage=True)
+
+
+class TestFromInt:
+    def test_intp(self):
+        # Ticket #99
+        assert_equal(1024, np.intp(1024))
+
+    def test_uint64_from_negative(self):
+        assert_equal(np.uint64(-2), np.uint64(18446744073709551614))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalar_methods.py b/venv/Lib/site-packages/numpy/core/tests/test_scalar_methods.py
new file mode 100644
index 000000000..4f5fd2988
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalar_methods.py
@@ -0,0 +1,103 @@
+"""
+Test the scalar constructors, which also do type-coercion
+"""
+import fractions
+import platform
+
+import pytest
+import numpy as np
+
+from numpy.testing import assert_equal, assert_raises
+
+
+class TestAsIntegerRatio:
+    # derived in part from the cpython test "test_floatasratio"
+
+    @pytest.mark.parametrize("ftype", [
+        np.half, np.single, np.double, np.longdouble])
+    @pytest.mark.parametrize("f, ratio", [
+        (0.875, (7, 8)),
+        (-0.875, (-7, 8)),
+        (0.0, (0, 1)),
+        (11.5, (23, 2)),
+        ])
+    def test_small(self, ftype, f, ratio):
+        assert_equal(ftype(f).as_integer_ratio(), ratio)
+
+    @pytest.mark.parametrize("ftype", [
+        np.half, np.single, np.double, np.longdouble])
+    def test_simple_fractions(self, ftype):
+        R = fractions.Fraction
+        assert_equal(R(0, 1),
+                     R(*ftype(0.0).as_integer_ratio()))
+        assert_equal(R(5, 2),
+                     R(*ftype(2.5).as_integer_ratio()))
+        assert_equal(R(1, 2),
+                     R(*ftype(0.5).as_integer_ratio()))
+        assert_equal(R(-2100, 1),
+                     R(*ftype(-2100.0).as_integer_ratio()))
+
+    @pytest.mark.parametrize("ftype", [
+        np.half, np.single, np.double, np.longdouble])
+    def test_errors(self, ftype):
+        assert_raises(OverflowError, ftype('inf').as_integer_ratio)
+        assert_raises(OverflowError, ftype('-inf').as_integer_ratio)
+        assert_raises(ValueError, ftype('nan').as_integer_ratio)
+
+    def test_against_known_values(self):
+        R = fractions.Fraction
+        assert_equal(R(1075, 512),
+                     R(*np.half(2.1).as_integer_ratio()))
+        assert_equal(R(-1075, 512),
+                     R(*np.half(-2.1).as_integer_ratio()))
+        assert_equal(R(4404019, 2097152),
+                     R(*np.single(2.1).as_integer_ratio()))
+        assert_equal(R(-4404019, 2097152),
+                     R(*np.single(-2.1).as_integer_ratio()))
+        assert_equal(R(4728779608739021, 2251799813685248),
+                     R(*np.double(2.1).as_integer_ratio()))
+        assert_equal(R(-4728779608739021, 2251799813685248),
+                     R(*np.double(-2.1).as_integer_ratio()))
+        # longdouble is platform dependent
+
+    @pytest.mark.parametrize("ftype, frac_vals, exp_vals", [
+        # dtype test cases generated using hypothesis
+        # first five generated cases per dtype
+        (np.half, [0.0, 0.01154830649280303, 0.31082276347447274,
+                   0.527350517124794, 0.8308562335072596],
+                  [0, 1, 0, -8, 12]),
+        (np.single, [0.0, 0.09248576989263226, 0.8160498218131407,
+                     0.17389442853722373, 0.7956044195067877],
+                    [0, 12, 10, 17, -26]),
+        (np.double, [0.0, 0.031066908499895136, 0.5214135908877832,
+                     0.45780736035689296, 0.5906586745934036],
+                    [0, -801, 51, 194, -653]),
+        pytest.param(
+            np.longdouble,
+            [0.0, 0.20492557202724854, 0.4277180662199366, 0.9888085019891495,
+             0.9620175814461964],
+            [0, -7400, 14266, -7822, -8721],
+            marks=[
+                pytest.mark.skipif(
+                    np.finfo(np.double) == np.finfo(np.longdouble),
+                    reason="long double is same as double"),
+                pytest.mark.skipif(
+                    platform.machine().startswith("ppc"),
+                    reason="IBM double double"),
+            ]
+        )
+    ])
+    def test_roundtrip(self, ftype, frac_vals, exp_vals):
+        for frac, exp in zip(frac_vals, exp_vals):
+            f = np.ldexp(frac, exp, dtype=ftype)
+            n, d = f.as_integer_ratio()
+
+            try:
+                # workaround for gh-9968
+                nf = np.longdouble(str(n))
+                df = np.longdouble(str(d))
+            except (OverflowError, RuntimeWarning):
+                # the values may not fit in any float type
+                pytest.skip("longdouble too small on this platform")
+
+            assert_equal(nf / df, f, "{}/{}".format(n, d))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalarbuffer.py b/venv/Lib/site-packages/numpy/core/tests/test_scalarbuffer.py
new file mode 100644
index 000000000..b1c1bbbb1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalarbuffer.py
@@ -0,0 +1,119 @@
+"""
+Test scalar buffer interface adheres to PEP 3118
+"""
+import numpy as np
+import pytest
+
+from numpy.testing import assert_, assert_equal, assert_raises
+
+# PEP3118 format strings for native (standard alignment and byteorder) types
+scalars_and_codes = [
+    (np.bool_, '?'),
+    (np.byte, 'b'),
+    (np.short, 'h'),
+    (np.intc, 'i'),
+    (np.int_, 'l'),
+    (np.longlong, 'q'),
+    (np.ubyte, 'B'),
+    (np.ushort, 'H'),
+    (np.uintc, 'I'),
+    (np.uint, 'L'),
+    (np.ulonglong, 'Q'),
+    (np.half, 'e'),
+    (np.single, 'f'),
+    (np.double, 'd'),
+    (np.longdouble, 'g'),
+    (np.csingle, 'Zf'),
+    (np.cdouble, 'Zd'),
+    (np.clongdouble, 'Zg'),
+]
+scalars_only, codes_only = zip(*scalars_and_codes)
+
+
+class TestScalarPEP3118:
+
+    @pytest.mark.parametrize('scalar', scalars_only, ids=codes_only)
+    def test_scalar_match_array(self, scalar):
+        x = scalar()
+        a = np.array([], dtype=np.dtype(scalar))
+        mv_x = memoryview(x)
+        mv_a = memoryview(a)
+        assert_equal(mv_x.format, mv_a.format)
+
+    @pytest.mark.parametrize('scalar', scalars_only, ids=codes_only)
+    def test_scalar_dim(self, scalar):
+        x = scalar()
+        mv_x = memoryview(x)
+        assert_equal(mv_x.itemsize, np.dtype(scalar).itemsize)
+        assert_equal(mv_x.ndim, 0)
+        assert_equal(mv_x.shape, ())
+        assert_equal(mv_x.strides, ())
+        assert_equal(mv_x.suboffsets, ())
+
+    @pytest.mark.parametrize('scalar, code', scalars_and_codes, ids=codes_only)
+    def test_scalar_known_code(self, scalar, code):
+        x = scalar()
+        mv_x = memoryview(x)
+        assert_equal(mv_x.format, code)
+
+    def test_void_scalar_structured_data(self):
+        dt = np.dtype([('name', np.unicode_, 16), ('grades', np.float64, (2,))])
+        x = np.array(('ndarray_scalar', (1.2, 3.0)), dtype=dt)[()]
+        assert_(isinstance(x, np.void))
+        mv_x = memoryview(x)
+        expected_size = 16 * np.dtype((np.unicode_, 1)).itemsize
+        expected_size += 2 * np.dtype(np.float64).itemsize
+        assert_equal(mv_x.itemsize, expected_size)
+        assert_equal(mv_x.ndim, 0)
+        assert_equal(mv_x.shape, ())
+        assert_equal(mv_x.strides, ())
+        assert_equal(mv_x.suboffsets, ())
+
+        # check scalar format string against ndarray format string
+        a = np.array([('Sarah', (8.0, 7.0)), ('John', (6.0, 7.0))], dtype=dt)
+        assert_(isinstance(a, np.ndarray))
+        mv_a = memoryview(a)
+        assert_equal(mv_x.itemsize, mv_a.itemsize)
+        assert_equal(mv_x.format, mv_a.format)
+
+    def _as_dict(self, m):
+        return dict(strides=m.strides, shape=m.shape, itemsize=m.itemsize,
+                    ndim=m.ndim, format=m.format)
+
+    def test_datetime_memoryview(self):
+        # gh-11656
+        # Values verified with v1.13.3, shape is not () as in test_scalar_dim
+
+        dt1 = np.datetime64('2016-01-01')
+        dt2 = np.datetime64('2017-01-01')
+        expected = dict(strides=(1,), itemsize=1, ndim=1, shape=(8,),
+                        format='B')
+        v = memoryview(dt1)
+        assert self._as_dict(v) == expected
+
+        v = memoryview(dt2 - dt1)
+        assert self._as_dict(v) == expected
+
+        dt = np.dtype([('a', 'uint16'), ('b', 'M8[s]')])
+        a = np.empty(1, dt)
+        # Fails to create a PEP 3118 valid buffer
+        assert_raises((ValueError, BufferError), memoryview, a[0])
+
+    @pytest.mark.parametrize('s', [
+        pytest.param("\x32\x32", id="ascii"),
+        pytest.param("\uFE0F\uFE0F", id="basic multilingual"),
+        pytest.param("\U0001f4bb\U0001f4bb", id="non-BMP"),
+    ])
+    def test_str_ucs4(self, s):
+        s = np.str_(s)  # only our subclass implements the buffer protocol
+
+        # all the same, characters always encode as ucs4
+        expected = dict(strides=(), itemsize=8, ndim=0, shape=(), format='2w')
+
+        v = memoryview(s)
+        assert self._as_dict(v) == expected
+
+        # integers of the paltform-appropriate endianness
+        code_points = np.frombuffer(v, dtype='i4')
+
+        assert_equal(code_points, [ord(c) for c in s])
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalarinherit.py b/venv/Lib/site-packages/numpy/core/tests/test_scalarinherit.py
new file mode 100644
index 000000000..74829986c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalarinherit.py
@@ -0,0 +1,91 @@
+# -*- coding: utf-8 -*-
+""" Test printing of scalar types.
+
+"""
+import pytest
+
+import numpy as np
+from numpy.testing import assert_
+
+
+class A:
+    pass
+class B(A, np.float64):
+    pass
+
+class C(B):
+    pass
+class D(C, B):
+    pass
+
+class B0(np.float64, A):
+    pass
+class C0(B0):
+    pass
+
+class HasNew:
+    def __new__(cls, *args, **kwargs):
+        return cls, args, kwargs
+
+class B1(np.float64, HasNew):
+    pass
+
+
+class TestInherit:
+    def test_init(self):
+        x = B(1.0)
+        assert_(str(x) == '1.0')
+        y = C(2.0)
+        assert_(str(y) == '2.0')
+        z = D(3.0)
+        assert_(str(z) == '3.0')
+
+    def test_init2(self):
+        x = B0(1.0)
+        assert_(str(x) == '1.0')
+        y = C0(2.0)
+        assert_(str(y) == '2.0')
+
+    def test_gh_15395(self):
+        # HasNew is the second base, so `np.float64` should have priority
+        x = B1(1.0)
+        assert_(str(x) == '1.0')
+
+        # previously caused RecursionError!?
+        with pytest.raises(TypeError):
+            B1(1.0, 2.0)
+
+
+class TestCharacter:
+    def test_char_radd(self):
+        # GH issue 9620, reached gentype_add and raise TypeError
+        np_s = np.string_('abc')
+        np_u = np.unicode_('abc')
+        s = b'def'
+        u = u'def'
+        assert_(np_s.__radd__(np_s) is NotImplemented)
+        assert_(np_s.__radd__(np_u) is NotImplemented)
+        assert_(np_s.__radd__(s) is NotImplemented)
+        assert_(np_s.__radd__(u) is NotImplemented)
+        assert_(np_u.__radd__(np_s) is NotImplemented)
+        assert_(np_u.__radd__(np_u) is NotImplemented)
+        assert_(np_u.__radd__(s) is NotImplemented)
+        assert_(np_u.__radd__(u) is NotImplemented)
+        assert_(s + np_s == b'defabc')
+        assert_(u + np_u == u'defabc')
+
+
+        class Mystr(str, np.generic):
+            # would segfault
+            pass
+
+        ret = s + Mystr('abc')
+        assert_(type(ret) is type(s))
+
+    def test_char_repeat(self):
+        np_s = np.string_('abc')
+        np_u = np.unicode_('abc')
+        res_s = b'abc' * 5
+        res_u = u'abc' * 5
+        assert_(np_s * 5 == res_s)
+        assert_(np_u * 5 == res_u)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalarmath.py b/venv/Lib/site-packages/numpy/core/tests/test_scalarmath.py
new file mode 100644
index 000000000..c7f44cf50
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalarmath.py
@@ -0,0 +1,702 @@
+import sys
+import warnings
+import itertools
+import operator
+import platform
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_almost_equal,
+    assert_array_equal, IS_PYPY, suppress_warnings, _gen_alignment_data,
+    assert_warns, assert_raises_regex,
+    )
+
+types = [np.bool_, np.byte, np.ubyte, np.short, np.ushort, np.intc, np.uintc,
+         np.int_, np.uint, np.longlong, np.ulonglong,
+         np.single, np.double, np.longdouble, np.csingle,
+         np.cdouble, np.clongdouble]
+
+floating_types = np.floating.__subclasses__()
+complex_floating_types = np.complexfloating.__subclasses__()
+
+
+# This compares scalarmath against ufuncs.
+
+class TestTypes:
+    def test_types(self):
+        for atype in types:
+            a = atype(1)
+            assert_(a == 1, "error with %r: got %r" % (atype, a))
+
+    def test_type_add(self):
+        # list of types
+        for k, atype in enumerate(types):
+            a_scalar = atype(3)
+            a_array = np.array([3], dtype=atype)
+            for l, btype in enumerate(types):
+                b_scalar = btype(1)
+                b_array = np.array([1], dtype=btype)
+                c_scalar = a_scalar + b_scalar
+                c_array = a_array + b_array
+                # It was comparing the type numbers, but the new ufunc
+                # function-finding mechanism finds the lowest function
+                # to which both inputs can be cast - which produces 'l'
+                # when you do 'q' + 'b'.  The old function finding mechanism
+                # skipped ahead based on the first argument, but that
+                # does not produce properly symmetric results...
+                assert_equal(c_scalar.dtype, c_array.dtype,
+                           "error with types (%d/'%c' + %d/'%c')" %
+                            (k, np.dtype(atype).char, l, np.dtype(btype).char))
+
+    def test_type_create(self):
+        for k, atype in enumerate(types):
+            a = np.array([1, 2, 3], atype)
+            b = atype([1, 2, 3])
+            assert_equal(a, b)
+
+    def test_leak(self):
+        # test leak of scalar objects
+        # a leak would show up in valgrind as still-reachable of ~2.6MB
+        for i in range(200000):
+            np.add(1, 1)
+
+
+class TestBaseMath:
+    def test_blocked(self):
+        # test alignments offsets for simd instructions
+        # alignments for vz + 2 * (vs - 1) + 1
+        for dt, sz in [(np.float32, 11), (np.float64, 7), (np.int32, 11)]:
+            for out, inp1, inp2, msg in _gen_alignment_data(dtype=dt,
+                                                            type='binary',
+                                                            max_size=sz):
+                exp1 = np.ones_like(inp1)
+                inp1[...] = np.ones_like(inp1)
+                inp2[...] = np.zeros_like(inp2)
+                assert_almost_equal(np.add(inp1, inp2), exp1, err_msg=msg)
+                assert_almost_equal(np.add(inp1, 2), exp1 + 2, err_msg=msg)
+                assert_almost_equal(np.add(1, inp2), exp1, err_msg=msg)
+
+                np.add(inp1, inp2, out=out)
+                assert_almost_equal(out, exp1, err_msg=msg)
+
+                inp2[...] += np.arange(inp2.size, dtype=dt) + 1
+                assert_almost_equal(np.square(inp2),
+                                    np.multiply(inp2, inp2),  err_msg=msg)
+                # skip true divide for ints
+                if dt != np.int32:
+                    assert_almost_equal(np.reciprocal(inp2),
+                                        np.divide(1, inp2),  err_msg=msg)
+
+                inp1[...] = np.ones_like(inp1)
+                np.add(inp1, 2, out=out)
+                assert_almost_equal(out, exp1 + 2, err_msg=msg)
+                inp2[...] = np.ones_like(inp2)
+                np.add(2, inp2, out=out)
+                assert_almost_equal(out, exp1 + 2, err_msg=msg)
+
+    def test_lower_align(self):
+        # check data that is not aligned to element size
+        # i.e doubles are aligned to 4 bytes on i386
+        d = np.zeros(23 * 8, dtype=np.int8)[4:-4].view(np.float64)
+        o = np.zeros(23 * 8, dtype=np.int8)[4:-4].view(np.float64)
+        assert_almost_equal(d + d, d * 2)
+        np.add(d, d, out=o)
+        np.add(np.ones_like(d), d, out=o)
+        np.add(d, np.ones_like(d), out=o)
+        np.add(np.ones_like(d), d)
+        np.add(d, np.ones_like(d))
+
+
+class TestPower:
+    def test_small_types(self):
+        for t in [np.int8, np.int16, np.float16]:
+            a = t(3)
+            b = a ** 4
+            assert_(b == 81, "error with %r: got %r" % (t, b))
+
+    def test_large_types(self):
+        for t in [np.int32, np.int64, np.float32, np.float64, np.longdouble]:
+            a = t(51)
+            b = a ** 4
+            msg = "error with %r: got %r" % (t, b)
+            if np.issubdtype(t, np.integer):
+                assert_(b == 6765201, msg)
+            else:
+                assert_almost_equal(b, 6765201, err_msg=msg)
+
+    def test_integers_to_negative_integer_power(self):
+        # Note that the combination of uint64 with a signed integer
+        # has common type np.float64. The other combinations should all
+        # raise a ValueError for integer ** negative integer.
+        exp = [np.array(-1, dt)[()] for dt in 'bhilq']
+
+        # 1 ** -1 possible special case
+        base = [np.array(1, dt)[()] for dt in 'bhilqBHILQ']
+        for i1, i2 in itertools.product(base, exp):
+            if i1.dtype != np.uint64:
+                assert_raises(ValueError, operator.pow, i1, i2)
+            else:
+                res = operator.pow(i1, i2)
+                assert_(res.dtype.type is np.float64)
+                assert_almost_equal(res, 1.)
+
+        # -1 ** -1 possible special case
+        base = [np.array(-1, dt)[()] for dt in 'bhilq']
+        for i1, i2 in itertools.product(base, exp):
+            if i1.dtype != np.uint64:
+                assert_raises(ValueError, operator.pow, i1, i2)
+            else:
+                res = operator.pow(i1, i2)
+                assert_(res.dtype.type is np.float64)
+                assert_almost_equal(res, -1.)
+
+        # 2 ** -1 perhaps generic
+        base = [np.array(2, dt)[()] for dt in 'bhilqBHILQ']
+        for i1, i2 in itertools.product(base, exp):
+            if i1.dtype != np.uint64:
+                assert_raises(ValueError, operator.pow, i1, i2)
+            else:
+                res = operator.pow(i1, i2)
+                assert_(res.dtype.type is np.float64)
+                assert_almost_equal(res, .5)
+
+    def test_mixed_types(self):
+        typelist = [np.int8, np.int16, np.float16,
+                    np.float32, np.float64, np.int8,
+                    np.int16, np.int32, np.int64]
+        for t1 in typelist:
+            for t2 in typelist:
+                a = t1(3)
+                b = t2(2)
+                result = a**b
+                msg = ("error with %r and %r:"
+                       "got %r, expected %r") % (t1, t2, result, 9)
+                if np.issubdtype(np.dtype(result), np.integer):
+                    assert_(result == 9, msg)
+                else:
+                    assert_almost_equal(result, 9, err_msg=msg)
+
+    def test_modular_power(self):
+        # modular power is not implemented, so ensure it errors
+        a = 5
+        b = 4
+        c = 10
+        expected = pow(a, b, c)  # noqa: F841
+        for t in (np.int32, np.float32, np.complex64):
+            # note that 3-operand power only dispatches on the first argument
+            assert_raises(TypeError, operator.pow, t(a), b, c)
+            assert_raises(TypeError, operator.pow, np.array(t(a)), b, c)
+
+
+def floordiv_and_mod(x, y):
+    return (x // y, x % y)
+
+
+def _signs(dt):
+    if dt in np.typecodes['UnsignedInteger']:
+        return (+1,)
+    else:
+        return (+1, -1)
+
+
+class TestModulus:
+
+    def test_modulus_basic(self):
+        dt = np.typecodes['AllInteger'] + np.typecodes['Float']
+        for op in [floordiv_and_mod, divmod]:
+            for dt1, dt2 in itertools.product(dt, dt):
+                for sg1, sg2 in itertools.product(_signs(dt1), _signs(dt2)):
+                    fmt = 'op: %s, dt1: %s, dt2: %s, sg1: %s, sg2: %s'
+                    msg = fmt % (op.__name__, dt1, dt2, sg1, sg2)
+                    a = np.array(sg1*71, dtype=dt1)[()]
+                    b = np.array(sg2*19, dtype=dt2)[()]
+                    div, rem = op(a, b)
+                    assert_equal(div*b + rem, a, err_msg=msg)
+                    if sg2 == -1:
+                        assert_(b < rem <= 0, msg)
+                    else:
+                        assert_(b > rem >= 0, msg)
+
+    def test_float_modulus_exact(self):
+        # test that float results are exact for small integers. This also
+        # holds for the same integers scaled by powers of two.
+        nlst = list(range(-127, 0))
+        plst = list(range(1, 128))
+        dividend = nlst + [0] + plst
+        divisor = nlst + plst
+        arg = list(itertools.product(dividend, divisor))
+        tgt = list(divmod(*t) for t in arg)
+
+        a, b = np.array(arg, dtype=int).T
+        # convert exact integer results from Python to float so that
+        # signed zero can be used, it is checked.
+        tgtdiv, tgtrem = np.array(tgt, dtype=float).T
+        tgtdiv = np.where((tgtdiv == 0.0) & ((b < 0) ^ (a < 0)), -0.0, tgtdiv)
+        tgtrem = np.where((tgtrem == 0.0) & (b < 0), -0.0, tgtrem)
+
+        for op in [floordiv_and_mod, divmod]:
+            for dt in np.typecodes['Float']:
+                msg = 'op: %s, dtype: %s' % (op.__name__, dt)
+                fa = a.astype(dt)
+                fb = b.astype(dt)
+                # use list comprehension so a_ and b_ are scalars
+                div, rem = zip(*[op(a_, b_) for  a_, b_ in zip(fa, fb)])
+                assert_equal(div, tgtdiv, err_msg=msg)
+                assert_equal(rem, tgtrem, err_msg=msg)
+
+    def test_float_modulus_roundoff(self):
+        # gh-6127
+        dt = np.typecodes['Float']
+        for op in [floordiv_and_mod, divmod]:
+            for dt1, dt2 in itertools.product(dt, dt):
+                for sg1, sg2 in itertools.product((+1, -1), (+1, -1)):
+                    fmt = 'op: %s, dt1: %s, dt2: %s, sg1: %s, sg2: %s'
+                    msg = fmt % (op.__name__, dt1, dt2, sg1, sg2)
+                    a = np.array(sg1*78*6e-8, dtype=dt1)[()]
+                    b = np.array(sg2*6e-8, dtype=dt2)[()]
+                    div, rem = op(a, b)
+                    # Equal assertion should hold when fmod is used
+                    assert_equal(div*b + rem, a, err_msg=msg)
+                    if sg2 == -1:
+                        assert_(b < rem <= 0, msg)
+                    else:
+                        assert_(b > rem >= 0, msg)
+
+    def test_float_modulus_corner_cases(self):
+        # Check remainder magnitude.
+        for dt in np.typecodes['Float']:
+            b = np.array(1.0, dtype=dt)
+            a = np.nextafter(np.array(0.0, dtype=dt), -b)
+            rem = operator.mod(a, b)
+            assert_(rem <= b, 'dt: %s' % dt)
+            rem = operator.mod(-a, -b)
+            assert_(rem >= -b, 'dt: %s' % dt)
+
+        # Check nans, inf
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning, "invalid value encountered in remainder")
+            for dt in np.typecodes['Float']:
+                fone = np.array(1.0, dtype=dt)
+                fzer = np.array(0.0, dtype=dt)
+                finf = np.array(np.inf, dtype=dt)
+                fnan = np.array(np.nan, dtype=dt)
+                rem = operator.mod(fone, fzer)
+                assert_(np.isnan(rem), 'dt: %s' % dt)
+                # MSVC 2008 returns NaN here, so disable the check.
+                #rem = operator.mod(fone, finf)
+                #assert_(rem == fone, 'dt: %s' % dt)
+                rem = operator.mod(fone, fnan)
+                assert_(np.isnan(rem), 'dt: %s' % dt)
+                rem = operator.mod(finf, fone)
+                assert_(np.isnan(rem), 'dt: %s' % dt)
+
+    def test_inplace_floordiv_handling(self):
+        # issue gh-12927
+        # this only applies to in-place floordiv //=, because the output type
+        # promotes to float which does not fit
+        a = np.array([1, 2], np.int64)
+        b = np.array([1, 2], np.uint64)
+        pattern = 'could not be coerced to provided output parameter'
+        with assert_raises_regex(TypeError, pattern):
+            a //= b
+
+
+class TestComplexDivision:
+    def test_zero_division(self):
+        with np.errstate(all="ignore"):
+            for t in [np.complex64, np.complex128]:
+                a = t(0.0)
+                b = t(1.0)
+                assert_(np.isinf(b/a))
+                b = t(complex(np.inf, np.inf))
+                assert_(np.isinf(b/a))
+                b = t(complex(np.inf, np.nan))
+                assert_(np.isinf(b/a))
+                b = t(complex(np.nan, np.inf))
+                assert_(np.isinf(b/a))
+                b = t(complex(np.nan, np.nan))
+                assert_(np.isnan(b/a))
+                b = t(0.)
+                assert_(np.isnan(b/a))
+
+    def test_signed_zeros(self):
+        with np.errstate(all="ignore"):
+            for t in [np.complex64, np.complex128]:
+                # tupled (numerator, denominator, expected)
+                # for testing as expected == numerator/denominator
+                data = (
+                    (( 0.0,-1.0), ( 0.0, 1.0), (-1.0,-0.0)),
+                    (( 0.0,-1.0), ( 0.0,-1.0), ( 1.0,-0.0)),
+                    (( 0.0,-1.0), (-0.0,-1.0), ( 1.0, 0.0)),
+                    (( 0.0,-1.0), (-0.0, 1.0), (-1.0, 0.0)),
+                    (( 0.0, 1.0), ( 0.0,-1.0), (-1.0, 0.0)),
+                    (( 0.0,-1.0), ( 0.0,-1.0), ( 1.0,-0.0)),
+                    ((-0.0,-1.0), ( 0.0,-1.0), ( 1.0,-0.0)),
+                    ((-0.0, 1.0), ( 0.0,-1.0), (-1.0,-0.0))
+                )
+                for cases in data:
+                    n = cases[0]
+                    d = cases[1]
+                    ex = cases[2]
+                    result = t(complex(n[0], n[1])) / t(complex(d[0], d[1]))
+                    # check real and imag parts separately to avoid comparison
+                    # in array context, which does not account for signed zeros
+                    assert_equal(result.real, ex[0])
+                    assert_equal(result.imag, ex[1])
+
+    def test_branches(self):
+        with np.errstate(all="ignore"):
+            for t in [np.complex64, np.complex128]:
+                # tupled (numerator, denominator, expected)
+                # for testing as expected == numerator/denominator
+                data = list()
+
+                # trigger branch: real(fabs(denom)) > imag(fabs(denom))
+                # followed by else condition as neither are == 0
+                data.append((( 2.0, 1.0), ( 2.0, 1.0), (1.0, 0.0)))
+
+                # trigger branch: real(fabs(denom)) > imag(fabs(denom))
+                # followed by if condition as both are == 0
+                # is performed in test_zero_division(), so this is skipped
+
+                # trigger else if branch: real(fabs(denom)) < imag(fabs(denom))
+                data.append((( 1.0, 2.0), ( 1.0, 2.0), (1.0, 0.0)))
+
+                for cases in data:
+                    n = cases[0]
+                    d = cases[1]
+                    ex = cases[2]
+                    result = t(complex(n[0], n[1])) / t(complex(d[0], d[1]))
+                    # check real and imag parts separately to avoid comparison
+                    # in array context, which does not account for signed zeros
+                    assert_equal(result.real, ex[0])
+                    assert_equal(result.imag, ex[1])
+
+
+class TestConversion:
+    def test_int_from_long(self):
+        l = [1e6, 1e12, 1e18, -1e6, -1e12, -1e18]
+        li = [10**6, 10**12, 10**18, -10**6, -10**12, -10**18]
+        for T in [None, np.float64, np.int64]:
+            a = np.array(l, dtype=T)
+            assert_equal([int(_m) for _m in a], li)
+
+        a = np.array(l[:3], dtype=np.uint64)
+        assert_equal([int(_m) for _m in a], li[:3])
+
+    def test_iinfo_long_values(self):
+        for code in 'bBhH':
+            res = np.array(np.iinfo(code).max + 1, dtype=code)
+            tgt = np.iinfo(code).min
+            assert_(res == tgt)
+
+        for code in np.typecodes['AllInteger']:
+            res = np.array(np.iinfo(code).max, dtype=code)
+            tgt = np.iinfo(code).max
+            assert_(res == tgt)
+
+        for code in np.typecodes['AllInteger']:
+            res = np.typeDict[code](np.iinfo(code).max)
+            tgt = np.iinfo(code).max
+            assert_(res == tgt)
+
+    def test_int_raise_behaviour(self):
+        def overflow_error_func(dtype):
+            np.typeDict[dtype](np.iinfo(dtype).max + 1)
+
+        for code in 'lLqQ':
+            assert_raises(OverflowError, overflow_error_func, code)
+
+    def test_int_from_infinite_longdouble(self):
+        # gh-627
+        x = np.longdouble(np.inf)
+        assert_raises(OverflowError, int, x)
+        with suppress_warnings() as sup:
+            sup.record(np.ComplexWarning)
+            x = np.clongdouble(np.inf)
+            assert_raises(OverflowError, int, x)
+            assert_equal(len(sup.log), 1)
+
+    @pytest.mark.skipif(not IS_PYPY, reason="Test is PyPy only (gh-9972)")
+    def test_int_from_infinite_longdouble___int__(self):
+        x = np.longdouble(np.inf)
+        assert_raises(OverflowError, x.__int__)
+        with suppress_warnings() as sup:
+            sup.record(np.ComplexWarning)
+            x = np.clongdouble(np.inf)
+            assert_raises(OverflowError, x.__int__)
+            assert_equal(len(sup.log), 1)
+
+    @pytest.mark.skipif(np.finfo(np.double) == np.finfo(np.longdouble),
+                        reason="long double is same as double")
+    @pytest.mark.skipif(platform.machine().startswith("ppc"),
+                        reason="IBM double double")
+    def test_int_from_huge_longdouble(self):
+        # Produce a longdouble that would overflow a double,
+        # use exponent that avoids bug in Darwin pow function.
+        exp = np.finfo(np.double).maxexp - 1
+        huge_ld = 2 * 1234 * np.longdouble(2) ** exp
+        huge_i = 2 * 1234 * 2 ** exp
+        assert_(huge_ld != np.inf)
+        assert_equal(int(huge_ld), huge_i)
+
+    def test_int_from_longdouble(self):
+        x = np.longdouble(1.5)
+        assert_equal(int(x), 1)
+        x = np.longdouble(-10.5)
+        assert_equal(int(x), -10)
+
+    def test_numpy_scalar_relational_operators(self):
+        # All integer
+        for dt1 in np.typecodes['AllInteger']:
+            assert_(1 > np.array(0, dtype=dt1)[()], "type %s failed" % (dt1,))
+            assert_(not 1 < np.array(0, dtype=dt1)[()], "type %s failed" % (dt1,))
+
+            for dt2 in np.typecodes['AllInteger']:
+                assert_(np.array(1, dtype=dt1)[()] > np.array(0, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1)[()] < np.array(0, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+
+        #Unsigned integers
+        for dt1 in 'BHILQP':
+            assert_(-1 < np.array(1, dtype=dt1)[()], "type %s failed" % (dt1,))
+            assert_(not -1 > np.array(1, dtype=dt1)[()], "type %s failed" % (dt1,))
+            assert_(-1 != np.array(1, dtype=dt1)[()], "type %s failed" % (dt1,))
+
+            #unsigned vs signed
+            for dt2 in 'bhilqp':
+                assert_(np.array(1, dtype=dt1)[()] > np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1)[()] < np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(np.array(1, dtype=dt1)[()] != np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+
+        #Signed integers and floats
+        for dt1 in 'bhlqp' + np.typecodes['Float']:
+            assert_(1 > np.array(-1, dtype=dt1)[()], "type %s failed" % (dt1,))
+            assert_(not 1 < np.array(-1, dtype=dt1)[()], "type %s failed" % (dt1,))
+            assert_(-1 == np.array(-1, dtype=dt1)[()], "type %s failed" % (dt1,))
+
+            for dt2 in 'bhlqp' + np.typecodes['Float']:
+                assert_(np.array(1, dtype=dt1)[()] > np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(not np.array(1, dtype=dt1)[()] < np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+                assert_(np.array(-1, dtype=dt1)[()] == np.array(-1, dtype=dt2)[()],
+                        "type %s and %s failed" % (dt1, dt2))
+
+    def test_scalar_comparison_to_none(self):
+        # Scalars should just return False and not give a warnings.
+        # The comparisons are flagged by pep8, ignore that.
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', FutureWarning)
+            assert_(not np.float32(1) == None)
+            assert_(not np.str_('test') == None)
+            # This is dubious (see below):
+            assert_(not np.datetime64('NaT') == None)
+
+            assert_(np.float32(1) != None)
+            assert_(np.str_('test') != None)
+            # This is dubious (see below):
+            assert_(np.datetime64('NaT') != None)
+        assert_(len(w) == 0)
+
+        # For documentation purposes, this is why the datetime is dubious.
+        # At the time of deprecation this was no behaviour change, but
+        # it has to be considered when the deprecations are done.
+        assert_(np.equal(np.datetime64('NaT'), None))
+
+
+#class TestRepr:
+#    def test_repr(self):
+#        for t in types:
+#            val = t(1197346475.0137341)
+#            val_repr = repr(val)
+#            val2 = eval(val_repr)
+#            assert_equal( val, val2 )
+
+
+class TestRepr:
+    def _test_type_repr(self, t):
+        finfo = np.finfo(t)
+        last_fraction_bit_idx = finfo.nexp + finfo.nmant
+        last_exponent_bit_idx = finfo.nexp
+        storage_bytes = np.dtype(t).itemsize*8
+        # could add some more types to the list below
+        for which in ['small denorm', 'small norm']:
+            # Values from https://en.wikipedia.org/wiki/IEEE_754
+            constr = np.array([0x00]*storage_bytes, dtype=np.uint8)
+            if which == 'small denorm':
+                byte = last_fraction_bit_idx // 8
+                bytebit = 7-(last_fraction_bit_idx % 8)
+                constr[byte] = 1 << bytebit
+            elif which == 'small norm':
+                byte = last_exponent_bit_idx // 8
+                bytebit = 7-(last_exponent_bit_idx % 8)
+                constr[byte] = 1 << bytebit
+            else:
+                raise ValueError('hmm')
+            val = constr.view(t)[0]
+            val_repr = repr(val)
+            val2 = t(eval(val_repr))
+            if not (val2 == 0 and val < 1e-100):
+                assert_equal(val, val2)
+
+    def test_float_repr(self):
+        # long double test cannot work, because eval goes through a python
+        # float
+        for t in [np.float32, np.float64]:
+            self._test_type_repr(t)
+
+
+if not IS_PYPY:
+    # sys.getsizeof() is not valid on PyPy
+    class TestSizeOf:
+
+        def test_equal_nbytes(self):
+            for type in types:
+                x = type(0)
+                assert_(sys.getsizeof(x) > x.nbytes)
+
+        def test_error(self):
+            d = np.float32()
+            assert_raises(TypeError, d.__sizeof__, "a")
+
+
+class TestMultiply:
+    def test_seq_repeat(self):
+        # Test that basic sequences get repeated when multiplied with
+        # numpy integers. And errors are raised when multiplied with others.
+        # Some of this behaviour may be controversial and could be open for
+        # change.
+        accepted_types = set(np.typecodes["AllInteger"])
+        deprecated_types = {'?'}
+        forbidden_types = (
+            set(np.typecodes["All"]) - accepted_types - deprecated_types)
+        forbidden_types -= {'V'}  # can't default-construct void scalars
+
+        for seq_type in (list, tuple):
+            seq = seq_type([1, 2, 3])
+            for numpy_type in accepted_types:
+                i = np.dtype(numpy_type).type(2)
+                assert_equal(seq * i, seq * int(i))
+                assert_equal(i * seq, int(i) * seq)
+
+            for numpy_type in deprecated_types:
+                i = np.dtype(numpy_type).type()
+                assert_equal(
+                    assert_warns(DeprecationWarning, operator.mul, seq, i),
+                    seq * int(i))
+                assert_equal(
+                    assert_warns(DeprecationWarning, operator.mul, i, seq),
+                    int(i) * seq)
+
+            for numpy_type in forbidden_types:
+                i = np.dtype(numpy_type).type()
+                assert_raises(TypeError, operator.mul, seq, i)
+                assert_raises(TypeError, operator.mul, i, seq)
+
+    def test_no_seq_repeat_basic_array_like(self):
+        # Test that an array-like which does not know how to be multiplied
+        # does not attempt sequence repeat (raise TypeError).
+        # See also gh-7428.
+        class ArrayLike:
+            def __init__(self, arr):
+                self.arr = arr
+            def __array__(self):
+                return self.arr
+
+        # Test for simple ArrayLike above and memoryviews (original report)
+        for arr_like in (ArrayLike(np.ones(3)), memoryview(np.ones(3))):
+            assert_array_equal(arr_like * np.float32(3.), np.full(3, 3.))
+            assert_array_equal(np.float32(3.) * arr_like, np.full(3, 3.))
+            assert_array_equal(arr_like * np.int_(3), np.full(3, 3))
+            assert_array_equal(np.int_(3) * arr_like, np.full(3, 3))
+
+
+class TestNegative:
+    def test_exceptions(self):
+        a = np.ones((), dtype=np.bool_)[()]
+        assert_raises(TypeError, operator.neg, a)
+
+    def test_result(self):
+        types = np.typecodes['AllInteger'] + np.typecodes['AllFloat']
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning)
+            for dt in types:
+                a = np.ones((), dtype=dt)[()]
+                assert_equal(operator.neg(a) + a, 0)
+
+
+class TestSubtract:
+    def test_exceptions(self):
+        a = np.ones((), dtype=np.bool_)[()]
+        assert_raises(TypeError, operator.sub, a, a)
+
+    def test_result(self):
+        types = np.typecodes['AllInteger'] + np.typecodes['AllFloat']
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning)
+            for dt in types:
+                a = np.ones((), dtype=dt)[()]
+                assert_equal(operator.sub(a, a), 0)
+
+
+class TestAbs:
+    def _test_abs_func(self, absfunc):
+        for tp in floating_types + complex_floating_types:
+            x = tp(-1.5)
+            assert_equal(absfunc(x), 1.5)
+            x = tp(0.0)
+            res = absfunc(x)
+            # assert_equal() checks zero signedness
+            assert_equal(res, 0.0)
+            x = tp(-0.0)
+            res = absfunc(x)
+            assert_equal(res, 0.0)
+
+            x = tp(np.finfo(tp).max)
+            assert_equal(absfunc(x), x.real)
+
+            x = tp(np.finfo(tp).tiny)
+            assert_equal(absfunc(x), x.real)
+
+            x = tp(np.finfo(tp).min)
+            assert_equal(absfunc(x), -x.real)
+
+    def test_builtin_abs(self):
+        self._test_abs_func(abs)
+
+    def test_numpy_abs(self):
+        self._test_abs_func(np.abs)
+
+
+class TestBitShifts:
+
+    @pytest.mark.parametrize('type_code', np.typecodes['AllInteger'])
+    @pytest.mark.parametrize('op',
+        [operator.rshift, operator.lshift], ids=['>>', '<<'])
+    def test_shift_all_bits(self, type_code, op):
+        """ Shifts where the shift amount is the width of the type or wider """
+        # gh-2449
+        dt = np.dtype(type_code)
+        nbits = dt.itemsize * 8
+        for val in [5, -5]:
+            for shift in [nbits, nbits + 4]:
+                val_scl = dt.type(val)
+                shift_scl = dt.type(shift)
+                res_scl = op(val_scl, shift_scl)
+                if val_scl < 0 and op is operator.rshift:
+                    # sign bit is preserved
+                    assert_equal(res_scl, -1)
+                else:
+                    assert_equal(res_scl, 0)
+
+                # Result on scalars should be the same as on arrays
+                val_arr = np.array([val]*32, dtype=dt)
+                shift_arr = np.array([shift]*32, dtype=dt)
+                res_arr = op(val_arr, shift_arr)
+                assert_equal(res_arr, res_scl)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_scalarprint.py b/venv/Lib/site-packages/numpy/core/tests/test_scalarprint.py
new file mode 100644
index 000000000..6502ec4c1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_scalarprint.py
@@ -0,0 +1,322 @@
+# -*- coding: utf-8 -*-
+""" Test printing of scalar types.
+
+"""
+import code
+import platform
+import pytest
+import sys
+
+from tempfile import TemporaryFile
+import numpy as np
+from numpy.testing import assert_, assert_equal
+
+class TestRealScalars:
+    def test_str(self):
+        svals = [0.0, -0.0, 1, -1, np.inf, -np.inf, np.nan]
+        styps = [np.float16, np.float32, np.float64, np.longdouble]
+        wanted = [
+             ['0.0',  '0.0',  '0.0',  '0.0' ],
+             ['-0.0', '-0.0', '-0.0', '-0.0'],
+             ['1.0',  '1.0',  '1.0',  '1.0' ],
+             ['-1.0', '-1.0', '-1.0', '-1.0'],
+             ['inf',  'inf',  'inf',  'inf' ],
+             ['-inf', '-inf', '-inf', '-inf'],
+             ['nan',  'nan',  'nan',  'nan']]
+
+        for wants, val in zip(wanted, svals):
+            for want, styp in zip(wants, styps):
+                msg = 'for str({}({}))'.format(np.dtype(styp).name, repr(val))
+                assert_equal(str(styp(val)), want, err_msg=msg)
+
+    def test_scalar_cutoffs(self):
+        # test that both the str and repr of np.float64 behaves
+        # like python floats in python3.
+        def check(v):
+            assert_equal(str(np.float64(v)), str(v))
+            assert_equal(str(np.float64(v)), repr(v))
+            assert_equal(repr(np.float64(v)), repr(v))
+            assert_equal(repr(np.float64(v)), str(v))
+
+        # check we use the same number of significant digits
+        check(1.12345678901234567890)
+        check(0.0112345678901234567890)
+
+        # check switch from scientific output to positional and back
+        check(1e-5)
+        check(1e-4)
+        check(1e15)
+        check(1e16)
+
+    def test_py2_float_print(self):
+        # gh-10753
+        # In python2, the python float type implements an obsolete method
+        # tp_print, which overrides tp_repr and tp_str when using "print" to
+        # output to a "real file" (ie, not a StringIO). Make sure we don't
+        # inherit it.
+        x = np.double(0.1999999999999)
+        with TemporaryFile('r+t') as f:
+            print(x, file=f)
+            f.seek(0)
+            output = f.read()
+        assert_equal(output, str(x) + '\n')
+        # In python2 the value float('0.1999999999999') prints with reduced
+        # precision as '0.2', but we want numpy's np.double('0.1999999999999')
+        # to print the unique value, '0.1999999999999'.
+
+        # gh-11031
+        # Only in the python2 interactive shell and when stdout is a "real"
+        # file, the output of the last command is printed to stdout without
+        # Py_PRINT_RAW (unlike the print statement) so `>>> x` and `>>> print
+        # x` are potentially different. Make sure they are the same. The only
+        # way I found to get prompt-like output is using an actual prompt from
+        # the 'code' module. Again, must use tempfile to get a "real" file.
+
+        # dummy user-input which enters one line and then ctrl-Ds.
+        def userinput():
+            yield 'np.sqrt(2)'
+            raise EOFError
+        gen = userinput()
+        input_func = lambda prompt="": next(gen)
+
+        with TemporaryFile('r+t') as fo, TemporaryFile('r+t') as fe:
+            orig_stdout, orig_stderr = sys.stdout, sys.stderr
+            sys.stdout, sys.stderr = fo, fe
+
+            code.interact(local={'np': np}, readfunc=input_func, banner='')
+
+            sys.stdout, sys.stderr = orig_stdout, orig_stderr
+
+            fo.seek(0)
+            capture = fo.read().strip()
+
+        assert_equal(capture, repr(np.sqrt(2)))
+
+    def test_dragon4(self):
+        # these tests are adapted from Ryan Juckett's dragon4 implementation,
+        # see dragon4.c for details.
+
+        fpos32 = lambda x, **k: np.format_float_positional(np.float32(x), **k)
+        fsci32 = lambda x, **k: np.format_float_scientific(np.float32(x), **k)
+        fpos64 = lambda x, **k: np.format_float_positional(np.float64(x), **k)
+        fsci64 = lambda x, **k: np.format_float_scientific(np.float64(x), **k)
+
+        preckwd = lambda prec: {'unique': False, 'precision': prec}
+
+        assert_equal(fpos32('1.0'), "1.")
+        assert_equal(fsci32('1.0'), "1.e+00")
+        assert_equal(fpos32('10.234'), "10.234")
+        assert_equal(fpos32('-10.234'), "-10.234")
+        assert_equal(fsci32('10.234'), "1.0234e+01")
+        assert_equal(fsci32('-10.234'), "-1.0234e+01")
+        assert_equal(fpos32('1000.0'), "1000.")
+        assert_equal(fpos32('1.0', precision=0), "1.")
+        assert_equal(fsci32('1.0', precision=0), "1.e+00")
+        assert_equal(fpos32('10.234', precision=0), "10.")
+        assert_equal(fpos32('-10.234', precision=0), "-10.")
+        assert_equal(fsci32('10.234', precision=0), "1.e+01")
+        assert_equal(fsci32('-10.234', precision=0), "-1.e+01")
+        assert_equal(fpos32('10.234', precision=2), "10.23")
+        assert_equal(fsci32('-10.234', precision=2), "-1.02e+01")
+        assert_equal(fsci64('9.9999999999999995e-08', **preckwd(16)),
+                            '9.9999999999999995e-08')
+        assert_equal(fsci64('9.8813129168249309e-324', **preckwd(16)),
+                            '9.8813129168249309e-324')
+        assert_equal(fsci64('9.9999999999999694e-311', **preckwd(16)),
+                            '9.9999999999999694e-311')
+
+
+        # test rounding
+        # 3.1415927410 is closest float32 to np.pi
+        assert_equal(fpos32('3.14159265358979323846', **preckwd(10)),
+                            "3.1415927410")
+        assert_equal(fsci32('3.14159265358979323846', **preckwd(10)),
+                            "3.1415927410e+00")
+        assert_equal(fpos64('3.14159265358979323846', **preckwd(10)),
+                            "3.1415926536")
+        assert_equal(fsci64('3.14159265358979323846', **preckwd(10)),
+                            "3.1415926536e+00")
+        # 299792448 is closest float32 to 299792458
+        assert_equal(fpos32('299792458.0', **preckwd(5)), "299792448.00000")
+        assert_equal(fsci32('299792458.0', **preckwd(5)), "2.99792e+08")
+        assert_equal(fpos64('299792458.0', **preckwd(5)), "299792458.00000")
+        assert_equal(fsci64('299792458.0', **preckwd(5)), "2.99792e+08")
+
+        assert_equal(fpos32('3.14159265358979323846', **preckwd(25)),
+                            "3.1415927410125732421875000")
+        assert_equal(fpos64('3.14159265358979323846', **preckwd(50)),
+                         "3.14159265358979311599796346854418516159057617187500")
+        assert_equal(fpos64('3.14159265358979323846'), "3.141592653589793")
+
+
+        # smallest numbers
+        assert_equal(fpos32(0.5**(126 + 23), unique=False, precision=149),
+                    "0.00000000000000000000000000000000000000000000140129846432"
+                    "4817070923729583289916131280261941876515771757068283889791"
+                    "08268586060148663818836212158203125")
+        assert_equal(fpos64(0.5**(1022 + 52), unique=False, precision=1074),
+                    "0.00000000000000000000000000000000000000000000000000000000"
+                    "0000000000000000000000000000000000000000000000000000000000"
+                    "0000000000000000000000000000000000000000000000000000000000"
+                    "0000000000000000000000000000000000000000000000000000000000"
+                    "0000000000000000000000000000000000000000000000000000000000"
+                    "0000000000000000000000000000000000049406564584124654417656"
+                    "8792868221372365059802614324764425585682500675507270208751"
+                    "8652998363616359923797965646954457177309266567103559397963"
+                    "9877479601078187812630071319031140452784581716784898210368"
+                    "8718636056998730723050006387409153564984387312473397273169"
+                    "6151400317153853980741262385655911710266585566867681870395"
+                    "6031062493194527159149245532930545654440112748012970999954"
+                    "1931989409080416563324524757147869014726780159355238611550"
+                    "1348035264934720193790268107107491703332226844753335720832"
+                    "4319360923828934583680601060115061698097530783422773183292"
+                    "4790498252473077637592724787465608477820373446969953364701"
+                    "7972677717585125660551199131504891101451037862738167250955"
+                    "8373897335989936648099411642057026370902792427675445652290"
+                    "87538682506419718265533447265625")
+
+        # largest numbers
+        assert_equal(fpos32(np.finfo(np.float32).max, **preckwd(0)),
+                    "340282346638528859811704183484516925440.")
+        assert_equal(fpos64(np.finfo(np.float64).max, **preckwd(0)),
+                    "1797693134862315708145274237317043567980705675258449965989"
+                    "1747680315726078002853876058955863276687817154045895351438"
+                    "2464234321326889464182768467546703537516986049910576551282"
+                    "0762454900903893289440758685084551339423045832369032229481"
+                    "6580855933212334827479782620414472316873817718091929988125"
+                    "0404026184124858368.")
+        # Warning: In unique mode only the integer digits necessary for
+        # uniqueness are computed, the rest are 0. Should we change this?
+        assert_equal(fpos32(np.finfo(np.float32).max, precision=0),
+                    "340282350000000000000000000000000000000.")
+
+        # test trailing zeros
+        assert_equal(fpos32('1.0', unique=False, precision=3), "1.000")
+        assert_equal(fpos64('1.0', unique=False, precision=3), "1.000")
+        assert_equal(fsci32('1.0', unique=False, precision=3), "1.000e+00")
+        assert_equal(fsci64('1.0', unique=False, precision=3), "1.000e+00")
+        assert_equal(fpos32('1.5', unique=False, precision=3), "1.500")
+        assert_equal(fpos64('1.5', unique=False, precision=3), "1.500")
+        assert_equal(fsci32('1.5', unique=False, precision=3), "1.500e+00")
+        assert_equal(fsci64('1.5', unique=False, precision=3), "1.500e+00")
+        # gh-10713
+        assert_equal(fpos64('324', unique=False, precision=5, fractional=False), "324.00")
+
+    def test_dragon4_interface(self):
+        tps = [np.float16, np.float32, np.float64]
+        if hasattr(np, 'float128'):
+            tps.append(np.float128)
+
+        fpos = np.format_float_positional
+        fsci = np.format_float_scientific
+
+        for tp in tps:
+            # test padding
+            assert_equal(fpos(tp('1.0'), pad_left=4, pad_right=4), "   1.    ")
+            assert_equal(fpos(tp('-1.0'), pad_left=4, pad_right=4), "  -1.    ")
+            assert_equal(fpos(tp('-10.2'),
+                         pad_left=4, pad_right=4), " -10.2   ")
+
+            # test exp_digits
+            assert_equal(fsci(tp('1.23e1'), exp_digits=5), "1.23e+00001")
+
+            # test fixed (non-unique) mode
+            assert_equal(fpos(tp('1.0'), unique=False, precision=4), "1.0000")
+            assert_equal(fsci(tp('1.0'), unique=False, precision=4),
+                         "1.0000e+00")
+
+            # test trimming
+            # trim of 'k' or '.' only affects non-unique mode, since unique
+            # mode will not output trailing 0s.
+            assert_equal(fpos(tp('1.'), unique=False, precision=4, trim='k'),
+                         "1.0000")
+
+            assert_equal(fpos(tp('1.'), unique=False, precision=4, trim='.'),
+                         "1.")
+            assert_equal(fpos(tp('1.2'), unique=False, precision=4, trim='.'),
+                         "1.2" if tp != np.float16 else "1.2002")
+
+            assert_equal(fpos(tp('1.'), unique=False, precision=4, trim='0'),
+                         "1.0")
+            assert_equal(fpos(tp('1.2'), unique=False, precision=4, trim='0'),
+                         "1.2" if tp != np.float16 else "1.2002")
+            assert_equal(fpos(tp('1.'), trim='0'), "1.0")
+
+            assert_equal(fpos(tp('1.'), unique=False, precision=4, trim='-'),
+                         "1")
+            assert_equal(fpos(tp('1.2'), unique=False, precision=4, trim='-'),
+                         "1.2" if tp != np.float16 else "1.2002")
+            assert_equal(fpos(tp('1.'), trim='-'), "1")
+
+    @pytest.mark.skipif(not platform.machine().startswith("ppc64"),
+                        reason="only applies to ppc float128 values")
+    def test_ppc64_ibm_double_double128(self):
+        # check that the precision decreases once we get into the subnormal
+        # range. Unlike float64, this starts around 1e-292 instead of 1e-308,
+        # which happens when the first double is normal and the second is
+        # subnormal.
+        x = np.float128('2.123123123123123123123123123123123e-286')
+        got = [str(x/np.float128('2e' + str(i))) for i in range(0,40)]
+        expected = [
+            "1.06156156156156156156156156156157e-286",
+            "1.06156156156156156156156156156158e-287",
+            "1.06156156156156156156156156156159e-288",
+            "1.0615615615615615615615615615616e-289",
+            "1.06156156156156156156156156156157e-290",
+            "1.06156156156156156156156156156156e-291",
+            "1.0615615615615615615615615615616e-292",
+            "1.0615615615615615615615615615615e-293",
+            "1.061561561561561561561561561562e-294",
+            "1.06156156156156156156156156155e-295",
+            "1.0615615615615615615615615616e-296",
+            "1.06156156156156156156156156e-297",
+            "1.06156156156156156156156157e-298",
+            "1.0615615615615615615615616e-299",
+            "1.06156156156156156156156e-300",
+            "1.06156156156156156156155e-301",
+            "1.0615615615615615615616e-302",
+            "1.061561561561561561562e-303",
+            "1.06156156156156156156e-304",
+            "1.0615615615615615618e-305",
+            "1.06156156156156156e-306",
+            "1.06156156156156157e-307",
+            "1.0615615615615616e-308",
+            "1.06156156156156e-309",
+            "1.06156156156157e-310",
+            "1.0615615615616e-311",
+            "1.06156156156e-312",
+            "1.06156156154e-313",
+            "1.0615615616e-314",
+            "1.06156156e-315",
+            "1.06156155e-316",
+            "1.061562e-317",
+            "1.06156e-318",
+            "1.06155e-319",
+            "1.0617e-320",
+            "1.06e-321",
+            "1.04e-322",
+            "1e-323",
+            "0.0",
+            "0.0"]
+        assert_equal(got, expected)
+
+        # Note: we follow glibc behavior, but it (or gcc) might not be right.
+        # In particular we can get two values that print the same but are not
+        # equal:
+        a = np.float128('2')/np.float128('3')
+        b = np.float128(str(a))
+        assert_equal(str(a), str(b))
+        assert_(a != b)
+
+    def float32_roundtrip(self):
+        # gh-9360
+        x = np.float32(1024 - 2**-14)
+        y = np.float32(1024 - 2**-13)
+        assert_(repr(x) != repr(y))
+        assert_equal(np.float32(repr(x)), x)
+        assert_equal(np.float32(repr(y)), y)
+
+    def float64_vs_python(self):
+        # gh-2643, gh-6136, gh-6908
+        assert_equal(repr(np.float64(0.1)), repr(0.1))
+        assert_(repr(np.float64(0.20000000000000004)) != repr(0.2))
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_shape_base.py b/venv/Lib/site-packages/numpy/core/tests/test_shape_base.py
new file mode 100644
index 000000000..546ecf001
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_shape_base.py
@@ -0,0 +1,713 @@
+import pytest
+import numpy as np
+from numpy.core import (
+    array, arange, atleast_1d, atleast_2d, atleast_3d, block, vstack, hstack,
+    newaxis, concatenate, stack
+    )
+from numpy.core.shape_base import (_block_dispatcher, _block_setup,
+                                   _block_concatenate, _block_slicing)
+from numpy.testing import (
+    assert_, assert_raises, assert_array_equal, assert_equal,
+    assert_raises_regex, assert_warns
+    )
+
+
+class TestAtleast1d:
+    def test_0D_array(self):
+        a = array(1)
+        b = array(2)
+        res = [atleast_1d(a), atleast_1d(b)]
+        desired = [array([1]), array([2])]
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = array([1, 2])
+        b = array([2, 3])
+        res = [atleast_1d(a), atleast_1d(b)]
+        desired = [array([1, 2]), array([2, 3])]
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        res = [atleast_1d(a), atleast_1d(b)]
+        desired = [a, b]
+        assert_array_equal(res, desired)
+
+    def test_3D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        a = array([a, a])
+        b = array([b, b])
+        res = [atleast_1d(a), atleast_1d(b)]
+        desired = [a, b]
+        assert_array_equal(res, desired)
+
+    def test_r1array(self):
+        """ Test to make sure equivalent Travis O's r1array function
+        """
+        assert_(atleast_1d(3).shape == (1,))
+        assert_(atleast_1d(3j).shape == (1,))
+        assert_(atleast_1d(3.0).shape == (1,))
+        assert_(atleast_1d([[2, 3], [4, 5]]).shape == (2, 2))
+
+
+class TestAtleast2d:
+    def test_0D_array(self):
+        a = array(1)
+        b = array(2)
+        res = [atleast_2d(a), atleast_2d(b)]
+        desired = [array([[1]]), array([[2]])]
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = array([1, 2])
+        b = array([2, 3])
+        res = [atleast_2d(a), atleast_2d(b)]
+        desired = [array([[1, 2]]), array([[2, 3]])]
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        res = [atleast_2d(a), atleast_2d(b)]
+        desired = [a, b]
+        assert_array_equal(res, desired)
+
+    def test_3D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        a = array([a, a])
+        b = array([b, b])
+        res = [atleast_2d(a), atleast_2d(b)]
+        desired = [a, b]
+        assert_array_equal(res, desired)
+
+    def test_r2array(self):
+        """ Test to make sure equivalent Travis O's r2array function
+        """
+        assert_(atleast_2d(3).shape == (1, 1))
+        assert_(atleast_2d([3j, 1]).shape == (1, 2))
+        assert_(atleast_2d([[[3, 1], [4, 5]], [[3, 5], [1, 2]]]).shape == (2, 2, 2))
+
+
+class TestAtleast3d:
+    def test_0D_array(self):
+        a = array(1)
+        b = array(2)
+        res = [atleast_3d(a), atleast_3d(b)]
+        desired = [array([[[1]]]), array([[[2]]])]
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = array([1, 2])
+        b = array([2, 3])
+        res = [atleast_3d(a), atleast_3d(b)]
+        desired = [array([[[1], [2]]]), array([[[2], [3]]])]
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        res = [atleast_3d(a), atleast_3d(b)]
+        desired = [a[:,:, newaxis], b[:,:, newaxis]]
+        assert_array_equal(res, desired)
+
+    def test_3D_array(self):
+        a = array([[1, 2], [1, 2]])
+        b = array([[2, 3], [2, 3]])
+        a = array([a, a])
+        b = array([b, b])
+        res = [atleast_3d(a), atleast_3d(b)]
+        desired = [a, b]
+        assert_array_equal(res, desired)
+
+
+class TestHstack:
+    def test_non_iterable(self):
+        assert_raises(TypeError, hstack, 1)
+
+    def test_empty_input(self):
+        assert_raises(ValueError, hstack, ())
+
+    def test_0D_array(self):
+        a = array(1)
+        b = array(2)
+        res = hstack([a, b])
+        desired = array([1, 2])
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = array([1])
+        b = array([2])
+        res = hstack([a, b])
+        desired = array([1, 2])
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = array([[1], [2]])
+        b = array([[1], [2]])
+        res = hstack([a, b])
+        desired = array([[1, 1], [2, 2]])
+        assert_array_equal(res, desired)
+
+    def test_generator(self):
+        with assert_warns(FutureWarning):
+            hstack((np.arange(3) for _ in range(2)))
+        with assert_warns(FutureWarning):
+            hstack(map(lambda x: x, np.ones((3, 2))))
+
+
+class TestVstack:
+    def test_non_iterable(self):
+        assert_raises(TypeError, vstack, 1)
+
+    def test_empty_input(self):
+        assert_raises(ValueError, vstack, ())
+
+    def test_0D_array(self):
+        a = array(1)
+        b = array(2)
+        res = vstack([a, b])
+        desired = array([[1], [2]])
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = array([1])
+        b = array([2])
+        res = vstack([a, b])
+        desired = array([[1], [2]])
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = array([[1], [2]])
+        b = array([[1], [2]])
+        res = vstack([a, b])
+        desired = array([[1], [2], [1], [2]])
+        assert_array_equal(res, desired)
+
+    def test_2D_array2(self):
+        a = array([1, 2])
+        b = array([1, 2])
+        res = vstack([a, b])
+        desired = array([[1, 2], [1, 2]])
+        assert_array_equal(res, desired)
+
+    def test_generator(self):
+        with assert_warns(FutureWarning):
+            vstack((np.arange(3) for _ in range(2)))
+
+
+class TestConcatenate:
+    def test_returns_copy(self):
+        a = np.eye(3)
+        b = np.concatenate([a])
+        b[0, 0] = 2
+        assert b[0, 0] != a[0, 0]
+
+    def test_exceptions(self):
+        # test axis must be in bounds
+        for ndim in [1, 2, 3]:
+            a = np.ones((1,)*ndim)
+            np.concatenate((a, a), axis=0)  # OK
+            assert_raises(np.AxisError, np.concatenate, (a, a), axis=ndim)
+            assert_raises(np.AxisError, np.concatenate, (a, a), axis=-(ndim + 1))
+
+        # Scalars cannot be concatenated
+        assert_raises(ValueError, concatenate, (0,))
+        assert_raises(ValueError, concatenate, (np.array(0),))
+
+        # dimensionality must match
+        assert_raises_regex(
+            ValueError,
+            r"all the input arrays must have same number of dimensions, but "
+            r"the array at index 0 has 1 dimension\(s\) and the array at "
+            r"index 1 has 2 dimension\(s\)",
+            np.concatenate, (np.zeros(1), np.zeros((1, 1))))
+
+        # test shapes must match except for concatenation axis
+        a = np.ones((1, 2, 3))
+        b = np.ones((2, 2, 3))
+        axis = list(range(3))
+        for i in range(3):
+            np.concatenate((a, b), axis=axis[0])  # OK
+            assert_raises_regex(
+                ValueError,
+                "all the input array dimensions for the concatenation axis "
+                "must match exactly, but along dimension {}, the array at "
+                "index 0 has size 1 and the array at index 1 has size 2"
+                .format(i),
+                np.concatenate, (a, b), axis=axis[1])
+            assert_raises(ValueError, np.concatenate, (a, b), axis=axis[2])
+            a = np.moveaxis(a, -1, 0)
+            b = np.moveaxis(b, -1, 0)
+            axis.append(axis.pop(0))
+
+        # No arrays to concatenate raises ValueError
+        assert_raises(ValueError, concatenate, ())
+
+    def test_concatenate_axis_None(self):
+        a = np.arange(4, dtype=np.float64).reshape((2, 2))
+        b = list(range(3))
+        c = ['x']
+        r = np.concatenate((a, a), axis=None)
+        assert_equal(r.dtype, a.dtype)
+        assert_equal(r.ndim, 1)
+        r = np.concatenate((a, b), axis=None)
+        assert_equal(r.size, a.size + len(b))
+        assert_equal(r.dtype, a.dtype)
+        r = np.concatenate((a, b, c), axis=None)
+        d = array(['0.0', '1.0', '2.0', '3.0',
+                   '0', '1', '2', 'x'])
+        assert_array_equal(r, d)
+
+        out = np.zeros(a.size + len(b))
+        r = np.concatenate((a, b), axis=None)
+        rout = np.concatenate((a, b), axis=None, out=out)
+        assert_(out is rout)
+        assert_equal(r, rout)
+
+    def test_large_concatenate_axis_None(self):
+        # When no axis is given, concatenate uses flattened versions.
+        # This also had a bug with many arrays (see gh-5979).
+        x = np.arange(1, 100)
+        r = np.concatenate(x, None)
+        assert_array_equal(x, r)
+
+        # This should probably be deprecated:
+        r = np.concatenate(x, 100)  # axis is >= MAXDIMS
+        assert_array_equal(x, r)
+
+    def test_concatenate(self):
+        # Test concatenate function
+        # One sequence returns unmodified (but as array)
+        r4 = list(range(4))
+        assert_array_equal(concatenate((r4,)), r4)
+        # Any sequence
+        assert_array_equal(concatenate((tuple(r4),)), r4)
+        assert_array_equal(concatenate((array(r4),)), r4)
+        # 1D default concatenation
+        r3 = list(range(3))
+        assert_array_equal(concatenate((r4, r3)), r4 + r3)
+        # Mixed sequence types
+        assert_array_equal(concatenate((tuple(r4), r3)), r4 + r3)
+        assert_array_equal(concatenate((array(r4), r3)), r4 + r3)
+        # Explicit axis specification
+        assert_array_equal(concatenate((r4, r3), 0), r4 + r3)
+        # Including negative
+        assert_array_equal(concatenate((r4, r3), -1), r4 + r3)
+        # 2D
+        a23 = array([[10, 11, 12], [13, 14, 15]])
+        a13 = array([[0, 1, 2]])
+        res = array([[10, 11, 12], [13, 14, 15], [0, 1, 2]])
+        assert_array_equal(concatenate((a23, a13)), res)
+        assert_array_equal(concatenate((a23, a13), 0), res)
+        assert_array_equal(concatenate((a23.T, a13.T), 1), res.T)
+        assert_array_equal(concatenate((a23.T, a13.T), -1), res.T)
+        # Arrays much match shape
+        assert_raises(ValueError, concatenate, (a23.T, a13.T), 0)
+        # 3D
+        res = arange(2 * 3 * 7).reshape((2, 3, 7))
+        a0 = res[..., :4]
+        a1 = res[..., 4:6]
+        a2 = res[..., 6:]
+        assert_array_equal(concatenate((a0, a1, a2), 2), res)
+        assert_array_equal(concatenate((a0, a1, a2), -1), res)
+        assert_array_equal(concatenate((a0.T, a1.T, a2.T), 0), res.T)
+
+        out = res.copy()
+        rout = concatenate((a0, a1, a2), 2, out=out)
+        assert_(out is rout)
+        assert_equal(res, rout)
+
+    def test_bad_out_shape(self):
+        a = array([1, 2])
+        b = array([3, 4])
+
+        assert_raises(ValueError, concatenate, (a, b), out=np.empty(5))
+        assert_raises(ValueError, concatenate, (a, b), out=np.empty((4,1)))
+        assert_raises(ValueError, concatenate, (a, b), out=np.empty((1,4)))
+        concatenate((a, b), out=np.empty(4))
+
+    def test_out_dtype(self):
+        out = np.empty(4, np.float32)
+        res = concatenate((array([1, 2]), array([3, 4])), out=out)
+        assert_(out is res)
+
+        out = np.empty(4, np.complex64)
+        res = concatenate((array([0.1, 0.2]), array([0.3, 0.4])), out=out)
+        assert_(out is res)
+
+        # invalid cast
+        out = np.empty(4, np.int32)
+        assert_raises(TypeError, concatenate,
+            (array([0.1, 0.2]), array([0.3, 0.4])), out=out)
+
+
+def test_stack():
+    # non-iterable input
+    assert_raises(TypeError, stack, 1)
+
+    # 0d input
+    for input_ in [(1, 2, 3),
+                   [np.int32(1), np.int32(2), np.int32(3)],
+                   [np.array(1), np.array(2), np.array(3)]]:
+        assert_array_equal(stack(input_), [1, 2, 3])
+    # 1d input examples
+    a = np.array([1, 2, 3])
+    b = np.array([4, 5, 6])
+    r1 = array([[1, 2, 3], [4, 5, 6]])
+    assert_array_equal(np.stack((a, b)), r1)
+    assert_array_equal(np.stack((a, b), axis=1), r1.T)
+    # all input types
+    assert_array_equal(np.stack(list([a, b])), r1)
+    assert_array_equal(np.stack(array([a, b])), r1)
+    # all shapes for 1d input
+    arrays = [np.random.randn(3) for _ in range(10)]
+    axes = [0, 1, -1, -2]
+    expected_shapes = [(10, 3), (3, 10), (3, 10), (10, 3)]
+    for axis, expected_shape in zip(axes, expected_shapes):
+        assert_equal(np.stack(arrays, axis).shape, expected_shape)
+    assert_raises_regex(np.AxisError, 'out of bounds', stack, arrays, axis=2)
+    assert_raises_regex(np.AxisError, 'out of bounds', stack, arrays, axis=-3)
+    # all shapes for 2d input
+    arrays = [np.random.randn(3, 4) for _ in range(10)]
+    axes = [0, 1, 2, -1, -2, -3]
+    expected_shapes = [(10, 3, 4), (3, 10, 4), (3, 4, 10),
+                       (3, 4, 10), (3, 10, 4), (10, 3, 4)]
+    for axis, expected_shape in zip(axes, expected_shapes):
+        assert_equal(np.stack(arrays, axis).shape, expected_shape)
+    # empty arrays
+    assert_(stack([[], [], []]).shape == (3, 0))
+    assert_(stack([[], [], []], axis=1).shape == (0, 3))
+    # out
+    out = np.zeros_like(r1)
+    np.stack((a, b), out=out)
+    assert_array_equal(out, r1)
+    # edge cases
+    assert_raises_regex(ValueError, 'need at least one array', stack, [])
+    assert_raises_regex(ValueError, 'must have the same shape',
+                        stack, [1, np.arange(3)])
+    assert_raises_regex(ValueError, 'must have the same shape',
+                        stack, [np.arange(3), 1])
+    assert_raises_regex(ValueError, 'must have the same shape',
+                        stack, [np.arange(3), 1], axis=1)
+    assert_raises_regex(ValueError, 'must have the same shape',
+                        stack, [np.zeros((3, 3)), np.zeros(3)], axis=1)
+    assert_raises_regex(ValueError, 'must have the same shape',
+                        stack, [np.arange(2), np.arange(3)])
+    # generator is deprecated
+    with assert_warns(FutureWarning):
+        result = stack((x for x in range(3)))
+    assert_array_equal(result, np.array([0, 1, 2]))
+
+
+class TestBlock:
+    @pytest.fixture(params=['block', 'force_concatenate', 'force_slicing'])
+    def block(self, request):
+        # blocking small arrays and large arrays go through different paths.
+        # the algorithm is triggered depending on the number of element
+        # copies required.
+        # We define a test fixture that forces most tests to go through
+        # both code paths.
+        # Ultimately, this should be removed if a single algorithm is found
+        # to be faster for both small and large arrays.
+        def _block_force_concatenate(arrays):
+            arrays, list_ndim, result_ndim, _ = _block_setup(arrays)
+            return _block_concatenate(arrays, list_ndim, result_ndim)
+
+        def _block_force_slicing(arrays):
+            arrays, list_ndim, result_ndim, _ = _block_setup(arrays)
+            return _block_slicing(arrays, list_ndim, result_ndim)
+
+        if request.param == 'force_concatenate':
+            return _block_force_concatenate
+        elif request.param == 'force_slicing':
+            return _block_force_slicing
+        elif request.param == 'block':
+            return block
+        else:
+            raise ValueError('Unknown blocking request. There is a typo in the tests.')
+
+    def test_returns_copy(self, block):
+        a = np.eye(3)
+        b = block(a)
+        b[0, 0] = 2
+        assert b[0, 0] != a[0, 0]
+
+    def test_block_total_size_estimate(self, block):
+        _, _, _, total_size = _block_setup([1])
+        assert total_size == 1
+
+        _, _, _, total_size = _block_setup([[1]])
+        assert total_size == 1
+
+        _, _, _, total_size = _block_setup([[1, 1]])
+        assert total_size == 2
+
+        _, _, _, total_size = _block_setup([[1], [1]])
+        assert total_size == 2
+
+        _, _, _, total_size = _block_setup([[1, 2], [3, 4]])
+        assert total_size == 4
+
+    def test_block_simple_row_wise(self, block):
+        a_2d = np.ones((2, 2))
+        b_2d = 2 * a_2d
+        desired = np.array([[1, 1, 2, 2],
+                            [1, 1, 2, 2]])
+        result = block([a_2d, b_2d])
+        assert_equal(desired, result)
+
+    def test_block_simple_column_wise(self, block):
+        a_2d = np.ones((2, 2))
+        b_2d = 2 * a_2d
+        expected = np.array([[1, 1],
+                             [1, 1],
+                             [2, 2],
+                             [2, 2]])
+        result = block([[a_2d], [b_2d]])
+        assert_equal(expected, result)
+
+    def test_block_with_1d_arrays_row_wise(self, block):
+        # # # 1-D vectors are treated as row arrays
+        a = np.array([1, 2, 3])
+        b = np.array([2, 3, 4])
+        expected = np.array([1, 2, 3, 2, 3, 4])
+        result = block([a, b])
+        assert_equal(expected, result)
+
+    def test_block_with_1d_arrays_multiple_rows(self, block):
+        a = np.array([1, 2, 3])
+        b = np.array([2, 3, 4])
+        expected = np.array([[1, 2, 3, 2, 3, 4],
+                             [1, 2, 3, 2, 3, 4]])
+        result = block([[a, b], [a, b]])
+        assert_equal(expected, result)
+
+    def test_block_with_1d_arrays_column_wise(self, block):
+        # # # 1-D vectors are treated as row arrays
+        a_1d = np.array([1, 2, 3])
+        b_1d = np.array([2, 3, 4])
+        expected = np.array([[1, 2, 3],
+                             [2, 3, 4]])
+        result = block([[a_1d], [b_1d]])
+        assert_equal(expected, result)
+
+    def test_block_mixed_1d_and_2d(self, block):
+        a_2d = np.ones((2, 2))
+        b_1d = np.array([2, 2])
+        result = block([[a_2d], [b_1d]])
+        expected = np.array([[1, 1],
+                             [1, 1],
+                             [2, 2]])
+        assert_equal(expected, result)
+
+    def test_block_complicated(self, block):
+        # a bit more complicated
+        one_2d = np.array([[1, 1, 1]])
+        two_2d = np.array([[2, 2, 2]])
+        three_2d = np.array([[3, 3, 3, 3, 3, 3]])
+        four_1d = np.array([4, 4, 4, 4, 4, 4])
+        five_0d = np.array(5)
+        six_1d = np.array([6, 6, 6, 6, 6])
+        zero_2d = np.zeros((2, 6))
+
+        expected = np.array([[1, 1, 1, 2, 2, 2],
+                             [3, 3, 3, 3, 3, 3],
+                             [4, 4, 4, 4, 4, 4],
+                             [5, 6, 6, 6, 6, 6],
+                             [0, 0, 0, 0, 0, 0],
+                             [0, 0, 0, 0, 0, 0]])
+
+        result = block([[one_2d, two_2d],
+                        [three_2d],
+                        [four_1d],
+                        [five_0d, six_1d],
+                        [zero_2d]])
+        assert_equal(result, expected)
+
+    def test_nested(self, block):
+        one = np.array([1, 1, 1])
+        two = np.array([[2, 2, 2], [2, 2, 2], [2, 2, 2]])
+        three = np.array([3, 3, 3])
+        four = np.array([4, 4, 4])
+        five = np.array(5)
+        six = np.array([6, 6, 6, 6, 6])
+        zero = np.zeros((2, 6))
+
+        result = block([
+            [
+                block([
+                   [one],
+                   [three],
+                   [four]
+                ]),
+                two
+            ],
+            [five, six],
+            [zero]
+        ])
+        expected = np.array([[1, 1, 1, 2, 2, 2],
+                             [3, 3, 3, 2, 2, 2],
+                             [4, 4, 4, 2, 2, 2],
+                             [5, 6, 6, 6, 6, 6],
+                             [0, 0, 0, 0, 0, 0],
+                             [0, 0, 0, 0, 0, 0]])
+
+        assert_equal(result, expected)
+
+    def test_3d(self, block):
+        a000 = np.ones((2, 2, 2), int) * 1
+
+        a100 = np.ones((3, 2, 2), int) * 2
+        a010 = np.ones((2, 3, 2), int) * 3
+        a001 = np.ones((2, 2, 3), int) * 4
+
+        a011 = np.ones((2, 3, 3), int) * 5
+        a101 = np.ones((3, 2, 3), int) * 6
+        a110 = np.ones((3, 3, 2), int) * 7
+
+        a111 = np.ones((3, 3, 3), int) * 8
+
+        result = block([
+            [
+                [a000, a001],
+                [a010, a011],
+            ],
+            [
+                [a100, a101],
+                [a110, a111],
+            ]
+        ])
+        expected = array([[[1, 1, 4, 4, 4],
+                           [1, 1, 4, 4, 4],
+                           [3, 3, 5, 5, 5],
+                           [3, 3, 5, 5, 5],
+                           [3, 3, 5, 5, 5]],
+
+                          [[1, 1, 4, 4, 4],
+                           [1, 1, 4, 4, 4],
+                           [3, 3, 5, 5, 5],
+                           [3, 3, 5, 5, 5],
+                           [3, 3, 5, 5, 5]],
+
+                          [[2, 2, 6, 6, 6],
+                           [2, 2, 6, 6, 6],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8]],
+
+                          [[2, 2, 6, 6, 6],
+                           [2, 2, 6, 6, 6],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8]],
+
+                          [[2, 2, 6, 6, 6],
+                           [2, 2, 6, 6, 6],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8],
+                           [7, 7, 8, 8, 8]]])
+
+        assert_array_equal(result, expected)
+
+    def test_block_with_mismatched_shape(self, block):
+        a = np.array([0, 0])
+        b = np.eye(2)
+        assert_raises(ValueError, block, [a, b])
+        assert_raises(ValueError, block, [b, a])
+
+        to_block = [[np.ones((2,3)), np.ones((2,2))],
+                    [np.ones((2,2)), np.ones((2,2))]]
+        assert_raises(ValueError, block, to_block)
+    def test_no_lists(self, block):
+        assert_equal(block(1),         np.array(1))
+        assert_equal(block(np.eye(3)), np.eye(3))
+
+    def test_invalid_nesting(self, block):
+        msg = 'depths are mismatched'
+        assert_raises_regex(ValueError, msg, block, [1, [2]])
+        assert_raises_regex(ValueError, msg, block, [1, []])
+        assert_raises_regex(ValueError, msg, block, [[1], 2])
+        assert_raises_regex(ValueError, msg, block, [[], 2])
+        assert_raises_regex(ValueError, msg, block, [
+            [[1], [2]],
+            [[3, 4]],
+            [5]  # missing brackets
+        ])
+
+    def test_empty_lists(self, block):
+        assert_raises_regex(ValueError, 'empty', block, [])
+        assert_raises_regex(ValueError, 'empty', block, [[]])
+        assert_raises_regex(ValueError, 'empty', block, [[1], []])
+
+    def test_tuple(self, block):
+        assert_raises_regex(TypeError, 'tuple', block, ([1, 2], [3, 4]))
+        assert_raises_regex(TypeError, 'tuple', block, [(1, 2), (3, 4)])
+
+    def test_different_ndims(self, block):
+        a = 1.
+        b = 2 * np.ones((1, 2))
+        c = 3 * np.ones((1, 1, 3))
+
+        result = block([a, b, c])
+        expected = np.array([[[1., 2., 2., 3., 3., 3.]]])
+
+        assert_equal(result, expected)
+
+    def test_different_ndims_depths(self, block):
+        a = 1.
+        b = 2 * np.ones((1, 2))
+        c = 3 * np.ones((1, 2, 3))
+
+        result = block([[a, b], [c]])
+        expected = np.array([[[1., 2., 2.],
+                              [3., 3., 3.],
+                              [3., 3., 3.]]])
+
+        assert_equal(result, expected)
+
+    def test_block_memory_order(self, block):
+        # 3D
+        arr_c = np.zeros((3,)*3, order='C')
+        arr_f = np.zeros((3,)*3, order='F')
+
+        b_c = [[[arr_c, arr_c],
+                [arr_c, arr_c]],
+               [[arr_c, arr_c],
+                [arr_c, arr_c]]]
+
+        b_f = [[[arr_f, arr_f],
+                [arr_f, arr_f]],
+               [[arr_f, arr_f],
+                [arr_f, arr_f]]]
+
+        assert block(b_c).flags['C_CONTIGUOUS']
+        assert block(b_f).flags['F_CONTIGUOUS']
+
+        arr_c = np.zeros((3, 3), order='C')
+        arr_f = np.zeros((3, 3), order='F')
+        # 2D
+        b_c = [[arr_c, arr_c],
+               [arr_c, arr_c]]
+
+        b_f = [[arr_f, arr_f],
+               [arr_f, arr_f]]
+
+        assert block(b_c).flags['C_CONTIGUOUS']
+        assert block(b_f).flags['F_CONTIGUOUS']
+
+
+def test_block_dispatcher():
+    class ArrayLike:
+        pass
+    a = ArrayLike()
+    b = ArrayLike()
+    c = ArrayLike()
+    assert_equal(list(_block_dispatcher(a)), [a])
+    assert_equal(list(_block_dispatcher([a])), [a])
+    assert_equal(list(_block_dispatcher([a, b])), [a, b])
+    assert_equal(list(_block_dispatcher([[a], [b, [c]]])), [a, b, c])
+    # don't recurse into non-lists
+    assert_equal(list(_block_dispatcher((a, b))), [(a, b)])
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_ufunc.py b/venv/Lib/site-packages/numpy/core/tests/test_ufunc.py
new file mode 100644
index 000000000..abdaeeb93
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_ufunc.py
@@ -0,0 +1,2023 @@
+import warnings
+import itertools
+
+import pytest
+
+import numpy as np
+import numpy.core._umath_tests as umt
+import numpy.linalg._umath_linalg as uml
+import numpy.core._operand_flag_tests as opflag_tests
+import numpy.core._rational_tests as _rational_tests
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_array_equal,
+    assert_almost_equal, assert_array_almost_equal, assert_no_warnings,
+    assert_allclose,
+    )
+from numpy.compat import pickle
+
+
+UNARY_UFUNCS = [obj for obj in np.core.umath.__dict__.values()
+                    if isinstance(obj, np.ufunc)]
+UNARY_OBJECT_UFUNCS = [uf for uf in UNARY_UFUNCS if "O->O" in uf.types]
+
+
+class TestUfuncKwargs:
+    def test_kwarg_exact(self):
+        assert_raises(TypeError, np.add, 1, 2, castingx='safe')
+        assert_raises(TypeError, np.add, 1, 2, dtypex=int)
+        assert_raises(TypeError, np.add, 1, 2, extobjx=[4096])
+        assert_raises(TypeError, np.add, 1, 2, outx=None)
+        assert_raises(TypeError, np.add, 1, 2, sigx='ii->i')
+        assert_raises(TypeError, np.add, 1, 2, signaturex='ii->i')
+        assert_raises(TypeError, np.add, 1, 2, subokx=False)
+        assert_raises(TypeError, np.add, 1, 2, wherex=[True])
+
+    def test_sig_signature(self):
+        assert_raises(ValueError, np.add, 1, 2, sig='ii->i',
+                      signature='ii->i')
+
+    def test_sig_dtype(self):
+        assert_raises(RuntimeError, np.add, 1, 2, sig='ii->i',
+                      dtype=int)
+        assert_raises(RuntimeError, np.add, 1, 2, signature='ii->i',
+                      dtype=int)
+
+    def test_extobj_refcount(self):
+        # Should not segfault with USE_DEBUG.
+        assert_raises(TypeError, np.add, 1, 2, extobj=[4096], parrot=True)
+
+
+class TestUfuncGenericLoops:
+    """Test generic loops.
+
+    The loops to be tested are:
+
+        PyUFunc_ff_f_As_dd_d
+        PyUFunc_ff_f
+        PyUFunc_dd_d
+        PyUFunc_gg_g
+        PyUFunc_FF_F_As_DD_D
+        PyUFunc_DD_D
+        PyUFunc_FF_F
+        PyUFunc_GG_G
+        PyUFunc_OO_O
+        PyUFunc_OO_O_method
+        PyUFunc_f_f_As_d_d
+        PyUFunc_d_d
+        PyUFunc_f_f
+        PyUFunc_g_g
+        PyUFunc_F_F_As_D_D
+        PyUFunc_F_F
+        PyUFunc_D_D
+        PyUFunc_G_G
+        PyUFunc_O_O
+        PyUFunc_O_O_method
+        PyUFunc_On_Om
+
+    Where:
+
+        f -- float
+        d -- double
+        g -- long double
+        F -- complex float
+        D -- complex double
+        G -- complex long double
+        O -- python object
+
+    It is difficult to assure that each of these loops is entered from the
+    Python level as the special cased loops are a moving target and the
+    corresponding types are architecture dependent. We probably need to
+    define C level testing ufuncs to get at them. For the time being, I've
+    just looked at the signatures registered in the build directory to find
+    relevant functions.
+
+    """
+    np_dtypes = [
+        (np.single, np.single), (np.single, np.double),
+        (np.csingle, np.csingle), (np.csingle, np.cdouble),
+        (np.double, np.double), (np.longdouble, np.longdouble),
+        (np.cdouble, np.cdouble), (np.clongdouble, np.clongdouble)]
+
+    @pytest.mark.parametrize('input_dtype,output_dtype', np_dtypes)
+    def test_unary_PyUFunc(self, input_dtype, output_dtype, f=np.exp, x=0, y=1):
+        xs = np.full(10, input_dtype(x), dtype=output_dtype)
+        ys = f(xs)[::2]
+        assert_allclose(ys, y)
+        assert_equal(ys.dtype, output_dtype)
+
+    def f2(x, y):
+        return x**y
+
+    @pytest.mark.parametrize('input_dtype,output_dtype', np_dtypes)
+    def test_binary_PyUFunc(self, input_dtype, output_dtype, f=f2, x=0, y=1):
+        xs = np.full(10, input_dtype(x), dtype=output_dtype)
+        ys = f(xs, xs)[::2]
+        assert_allclose(ys, y)
+        assert_equal(ys.dtype, output_dtype)
+
+    # class to use in testing object method loops
+    class foo:
+        def conjugate(self):
+            return np.bool_(1)
+
+        def logical_xor(self, obj):
+            return np.bool_(1)
+
+    def test_unary_PyUFunc_O_O(self):
+        x = np.ones(10, dtype=object)
+        assert_(np.all(np.abs(x) == 1))
+
+    def test_unary_PyUFunc_O_O_method_simple(self, foo=foo):
+        x = np.full(10, foo(), dtype=object)
+        assert_(np.all(np.conjugate(x) == True))
+
+    def test_binary_PyUFunc_OO_O(self):
+        x = np.ones(10, dtype=object)
+        assert_(np.all(np.add(x, x) == 2))
+
+    def test_binary_PyUFunc_OO_O_method(self, foo=foo):
+        x = np.full(10, foo(), dtype=object)
+        assert_(np.all(np.logical_xor(x, x)))
+
+    def test_binary_PyUFunc_On_Om_method(self, foo=foo):
+        x = np.full((10, 2, 3), foo(), dtype=object)
+        assert_(np.all(np.logical_xor(x, x)))
+
+    def test_python_complex_conjugate(self):
+        # The conjugate ufunc should fall back to calling the method:
+        arr = np.array([1+2j, 3-4j], dtype="O")
+        assert isinstance(arr[0], complex)
+        res = np.conjugate(arr)
+        assert res.dtype == np.dtype("O")
+        assert_array_equal(res, np.array([1-2j, 3+4j], dtype="O"))
+
+    @pytest.mark.parametrize("ufunc", UNARY_OBJECT_UFUNCS)
+    def test_unary_PyUFunc_O_O_method_full(self, ufunc):
+        """Compare the result of the object loop with non-object one"""
+        val = np.float64(np.pi/4)
+
+        class MyFloat(np.float64):
+            def __getattr__(self, attr):
+                try:
+                    return super().__getattr__(attr)
+                except AttributeError:
+                    return lambda: getattr(np.core.umath, attr)(val)
+
+        num_arr = np.array([val], dtype=np.float64)
+        obj_arr = np.array([MyFloat(val)], dtype="O")
+
+        with np.errstate(all="raise"):
+            try:
+                res_num = ufunc(num_arr)
+            except Exception as exc:
+                with assert_raises(type(exc)):
+                    ufunc(obj_arr)
+            else:
+                res_obj = ufunc(obj_arr)
+                assert_array_equal(res_num.astype("O"), res_obj)
+
+
+class TestUfunc:
+    def test_pickle(self):
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            assert_(pickle.loads(pickle.dumps(np.sin,
+                                              protocol=proto)) is np.sin)
+
+            # Check that ufunc not defined in the top level numpy namespace
+            # such as numpy.core._rational_tests.test_add can also be pickled
+            res = pickle.loads(pickle.dumps(_rational_tests.test_add,
+                                            protocol=proto))
+            assert_(res is _rational_tests.test_add)
+
+    def test_pickle_withstring(self):
+        astring = (b"cnumpy.core\n_ufunc_reconstruct\np0\n"
+                   b"(S'numpy.core.umath'\np1\nS'cos'\np2\ntp3\nRp4\n.")
+        assert_(pickle.loads(astring) is np.cos)
+
+    def test_reduceat_shifting_sum(self):
+        L = 6
+        x = np.arange(L)
+        idx = np.array(list(zip(np.arange(L - 2), np.arange(L - 2) + 2))).ravel()
+        assert_array_equal(np.add.reduceat(x, idx)[::2], [1, 3, 5, 7])
+
+    def test_all_ufunc(self):
+        """Try to check presence and results of all ufuncs.
+
+        The list of ufuncs comes from generate_umath.py and is as follows:
+
+        =====  ====  =============  ===============  ========================
+        done   args   function        types                notes
+        =====  ====  =============  ===============  ========================
+        n      1     conjugate      nums + O
+        n      1     absolute       nums + O         complex -> real
+        n      1     negative       nums + O
+        n      1     sign           nums + O         -> int
+        n      1     invert         bool + ints + O  flts raise an error
+        n      1     degrees        real + M         cmplx raise an error
+        n      1     radians        real + M         cmplx raise an error
+        n      1     arccos         flts + M
+        n      1     arccosh        flts + M
+        n      1     arcsin         flts + M
+        n      1     arcsinh        flts + M
+        n      1     arctan         flts + M
+        n      1     arctanh        flts + M
+        n      1     cos            flts + M
+        n      1     sin            flts + M
+        n      1     tan            flts + M
+        n      1     cosh           flts + M
+        n      1     sinh           flts + M
+        n      1     tanh           flts + M
+        n      1     exp            flts + M
+        n      1     expm1          flts + M
+        n      1     log            flts + M
+        n      1     log10          flts + M
+        n      1     log1p          flts + M
+        n      1     sqrt           flts + M         real x < 0 raises error
+        n      1     ceil           real + M
+        n      1     trunc          real + M
+        n      1     floor          real + M
+        n      1     fabs           real + M
+        n      1     rint           flts + M
+        n      1     isnan          flts             -> bool
+        n      1     isinf          flts             -> bool
+        n      1     isfinite       flts             -> bool
+        n      1     signbit        real             -> bool
+        n      1     modf           real             -> (frac, int)
+        n      1     logical_not    bool + nums + M  -> bool
+        n      2     left_shift     ints + O         flts raise an error
+        n      2     right_shift    ints + O         flts raise an error
+        n      2     add            bool + nums + O  boolean + is ||
+        n      2     subtract       bool + nums + O  boolean - is ^
+        n      2     multiply       bool + nums + O  boolean * is &
+        n      2     divide         nums + O
+        n      2     floor_divide   nums + O
+        n      2     true_divide    nums + O         bBhH -> f, iIlLqQ -> d
+        n      2     fmod           nums + M
+        n      2     power          nums + O
+        n      2     greater        bool + nums + O  -> bool
+        n      2     greater_equal  bool + nums + O  -> bool
+        n      2     less           bool + nums + O  -> bool
+        n      2     less_equal     bool + nums + O  -> bool
+        n      2     equal          bool + nums + O  -> bool
+        n      2     not_equal      bool + nums + O  -> bool
+        n      2     logical_and    bool + nums + M  -> bool
+        n      2     logical_or     bool + nums + M  -> bool
+        n      2     logical_xor    bool + nums + M  -> bool
+        n      2     maximum        bool + nums + O
+        n      2     minimum        bool + nums + O
+        n      2     bitwise_and    bool + ints + O  flts raise an error
+        n      2     bitwise_or     bool + ints + O  flts raise an error
+        n      2     bitwise_xor    bool + ints + O  flts raise an error
+        n      2     arctan2        real + M
+        n      2     remainder      ints + real + O
+        n      2     hypot          real + M
+        =====  ====  =============  ===============  ========================
+
+        Types other than those listed will be accepted, but they are cast to
+        the smallest compatible type for which the function is defined. The
+        casting rules are:
+
+        bool -> int8 -> float32
+        ints -> double
+
+        """
+        pass
+
+    # from include/numpy/ufuncobject.h
+    size_inferred = 2
+    can_ignore = 4
+    def test_signature0(self):
+        # the arguments to test_signature are: nin, nout, core_signature
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, "(i),(i)->()")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (1,  1,  0))
+        assert_equal(ixs, (0, 0))
+        assert_equal(flags, (self.size_inferred,))
+        assert_equal(sizes, (-1,))
+
+    def test_signature1(self):
+        # empty core signature; treat as plain ufunc (with trivial core)
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, "(),()->()")
+        assert_equal(enabled, 0)
+        assert_equal(num_dims, (0,  0,  0))
+        assert_equal(ixs, ())
+        assert_equal(flags, ())
+        assert_equal(sizes, ())
+
+    def test_signature2(self):
+        # more complicated names for variables
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, "(i1,i2),(J_1)->(_kAB)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (2, 1, 1))
+        assert_equal(ixs, (0, 1, 2, 3))
+        assert_equal(flags, (self.size_inferred,)*4)
+        assert_equal(sizes, (-1, -1, -1, -1))
+
+    def test_signature3(self):
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, u"(i1, i12),   (J_1)->(i12, i2)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (2, 1, 2))
+        assert_equal(ixs, (0, 1, 2, 1, 3))
+        assert_equal(flags, (self.size_inferred,)*4)
+        assert_equal(sizes, (-1, -1, -1, -1))
+
+    def test_signature4(self):
+        # matrix_multiply signature from _umath_tests
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, "(n,k),(k,m)->(n,m)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (2, 2, 2))
+        assert_equal(ixs, (0, 1, 1, 2, 0, 2))
+        assert_equal(flags, (self.size_inferred,)*3)
+        assert_equal(sizes, (-1, -1, -1))
+
+    def test_signature5(self):
+        # matmul signature from _umath_tests
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            2, 1, "(n?,k),(k,m?)->(n?,m?)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (2, 2, 2))
+        assert_equal(ixs, (0, 1, 1, 2, 0, 2))
+        assert_equal(flags, (self.size_inferred | self.can_ignore,
+                             self.size_inferred,
+                             self.size_inferred | self.can_ignore))
+        assert_equal(sizes, (-1, -1, -1))
+
+    def test_signature6(self):
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            1, 1, "(3)->()")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (1, 0))
+        assert_equal(ixs, (0,))
+        assert_equal(flags, (0,))
+        assert_equal(sizes, (3,))
+
+    def test_signature7(self):
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            3, 1, "(3),(03,3),(n)->(9)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (1, 2, 1, 1))
+        assert_equal(ixs, (0, 0, 0, 1, 2))
+        assert_equal(flags, (0, self.size_inferred, 0))
+        assert_equal(sizes, (3, -1, 9))
+
+    def test_signature8(self):
+        enabled, num_dims, ixs, flags, sizes = umt.test_signature(
+            3, 1, "(3?),(3?,3?),(n)->(9)")
+        assert_equal(enabled, 1)
+        assert_equal(num_dims, (1, 2, 1, 1))
+        assert_equal(ixs, (0, 0, 0, 1, 2))
+        assert_equal(flags, (self.can_ignore, self.size_inferred, 0))
+        assert_equal(sizes, (3, -1, 9))
+
+    def test_signature_failure_extra_parenthesis(self):
+        with assert_raises(ValueError):
+            umt.test_signature(2, 1, "((i)),(i)->()")
+
+    def test_signature_failure_mismatching_parenthesis(self):
+        with assert_raises(ValueError):
+            umt.test_signature(2, 1, "(i),)i(->()")
+
+    def test_signature_failure_signature_missing_input_arg(self):
+        with assert_raises(ValueError):
+            umt.test_signature(2, 1, "(i),->()")
+
+    def test_signature_failure_signature_missing_output_arg(self):
+        with assert_raises(ValueError):
+            umt.test_signature(2, 2, "(i),(i)->()")
+
+    def test_get_signature(self):
+        assert_equal(umt.inner1d.signature, "(i),(i)->()")
+
+    def test_forced_sig(self):
+        a = 0.5*np.arange(3, dtype='f8')
+        assert_equal(np.add(a, 0.5), [0.5, 1, 1.5])
+        assert_equal(np.add(a, 0.5, sig='i', casting='unsafe'), [0, 0, 1])
+        assert_equal(np.add(a, 0.5, sig='ii->i', casting='unsafe'), [0, 0, 1])
+        assert_equal(np.add(a, 0.5, sig=('i4',), casting='unsafe'), [0, 0, 1])
+        assert_equal(np.add(a, 0.5, sig=('i4', 'i4', 'i4'),
+                                            casting='unsafe'), [0, 0, 1])
+
+        b = np.zeros((3,), dtype='f8')
+        np.add(a, 0.5, out=b)
+        assert_equal(b, [0.5, 1, 1.5])
+        b[:] = 0
+        np.add(a, 0.5, sig='i', out=b, casting='unsafe')
+        assert_equal(b, [0, 0, 1])
+        b[:] = 0
+        np.add(a, 0.5, sig='ii->i', out=b, casting='unsafe')
+        assert_equal(b, [0, 0, 1])
+        b[:] = 0
+        np.add(a, 0.5, sig=('i4',), out=b, casting='unsafe')
+        assert_equal(b, [0, 0, 1])
+        b[:] = 0
+        np.add(a, 0.5, sig=('i4', 'i4', 'i4'), out=b, casting='unsafe')
+        assert_equal(b, [0, 0, 1])
+
+    def test_true_divide(self):
+        a = np.array(10)
+        b = np.array(20)
+        tgt = np.array(0.5)
+
+        for tc in 'bhilqBHILQefdgFDG':
+            dt = np.dtype(tc)
+            aa = a.astype(dt)
+            bb = b.astype(dt)
+
+            # Check result value and dtype.
+            for x, y in itertools.product([aa, -aa], [bb, -bb]):
+
+                # Check with no output type specified
+                if tc in 'FDG':
+                    tgt = complex(x)/complex(y)
+                else:
+                    tgt = float(x)/float(y)
+
+                res = np.true_divide(x, y)
+                rtol = max(np.finfo(res).resolution, 1e-15)
+                assert_allclose(res, tgt, rtol=rtol)
+
+                if tc in 'bhilqBHILQ':
+                    assert_(res.dtype.name == 'float64')
+                else:
+                    assert_(res.dtype.name == dt.name )
+
+                # Check with output type specified.  This also checks for the
+                # incorrect casts in issue gh-3484 because the unary '-' does
+                # not change types, even for unsigned types, Hence casts in the
+                # ufunc from signed to unsigned and vice versa will lead to
+                # errors in the values.
+                for tcout in 'bhilqBHILQ':
+                    dtout = np.dtype(tcout)
+                    assert_raises(TypeError, np.true_divide, x, y, dtype=dtout)
+
+                for tcout in 'efdg':
+                    dtout = np.dtype(tcout)
+                    if tc in 'FDG':
+                        # Casting complex to float is not allowed
+                        assert_raises(TypeError, np.true_divide, x, y, dtype=dtout)
+                    else:
+                        tgt = float(x)/float(y)
+                        rtol = max(np.finfo(dtout).resolution, 1e-15)
+                        atol = max(np.finfo(dtout).tiny, 3e-308)
+                        # Some test values result in invalid for float16.
+                        with np.errstate(invalid='ignore'):
+                            res = np.true_divide(x, y, dtype=dtout)
+                        if not np.isfinite(res) and tcout == 'e':
+                            continue
+                        assert_allclose(res, tgt, rtol=rtol, atol=atol)
+                        assert_(res.dtype.name == dtout.name)
+
+                for tcout in 'FDG':
+                    dtout = np.dtype(tcout)
+                    tgt = complex(x)/complex(y)
+                    rtol = max(np.finfo(dtout).resolution, 1e-15)
+                    atol = max(np.finfo(dtout).tiny, 3e-308)
+                    res = np.true_divide(x, y, dtype=dtout)
+                    if not np.isfinite(res):
+                        continue
+                    assert_allclose(res, tgt, rtol=rtol, atol=atol)
+                    assert_(res.dtype.name == dtout.name)
+
+        # Check booleans
+        a = np.ones((), dtype=np.bool_)
+        res = np.true_divide(a, a)
+        assert_(res == 1.0)
+        assert_(res.dtype.name == 'float64')
+        res = np.true_divide(~a, a)
+        assert_(res == 0.0)
+        assert_(res.dtype.name == 'float64')
+
+    def test_sum_stability(self):
+        a = np.ones(500, dtype=np.float32)
+        assert_almost_equal((a / 10.).sum() - a.size / 10., 0, 4)
+
+        a = np.ones(500, dtype=np.float64)
+        assert_almost_equal((a / 10.).sum() - a.size / 10., 0, 13)
+
+    def test_sum(self):
+        for dt in (int, np.float16, np.float32, np.float64, np.longdouble):
+            for v in (0, 1, 2, 7, 8, 9, 15, 16, 19, 127,
+                      128, 1024, 1235):
+                tgt = dt(v * (v + 1) / 2)
+                d = np.arange(1, v + 1, dtype=dt)
+
+                # warning if sum overflows, which it does in float16
+                overflow = not np.isfinite(tgt)
+
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter("always")
+                    assert_almost_equal(np.sum(d), tgt)
+                    assert_equal(len(w), 1 * overflow)
+
+                    assert_almost_equal(np.sum(d[::-1]), tgt)
+                    assert_equal(len(w), 2 * overflow)
+
+            d = np.ones(500, dtype=dt)
+            assert_almost_equal(np.sum(d[::2]), 250.)
+            assert_almost_equal(np.sum(d[1::2]), 250.)
+            assert_almost_equal(np.sum(d[::3]), 167.)
+            assert_almost_equal(np.sum(d[1::3]), 167.)
+            assert_almost_equal(np.sum(d[::-2]), 250.)
+            assert_almost_equal(np.sum(d[-1::-2]), 250.)
+            assert_almost_equal(np.sum(d[::-3]), 167.)
+            assert_almost_equal(np.sum(d[-1::-3]), 167.)
+            # sum with first reduction entry != 0
+            d = np.ones((1,), dtype=dt)
+            d += d
+            assert_almost_equal(d, 2.)
+
+    def test_sum_complex(self):
+        for dt in (np.complex64, np.complex128, np.clongdouble):
+            for v in (0, 1, 2, 7, 8, 9, 15, 16, 19, 127,
+                      128, 1024, 1235):
+                tgt = dt(v * (v + 1) / 2) - dt((v * (v + 1) / 2) * 1j)
+                d = np.empty(v, dtype=dt)
+                d.real = np.arange(1, v + 1)
+                d.imag = -np.arange(1, v + 1)
+                assert_almost_equal(np.sum(d), tgt)
+                assert_almost_equal(np.sum(d[::-1]), tgt)
+
+            d = np.ones(500, dtype=dt) + 1j
+            assert_almost_equal(np.sum(d[::2]), 250. + 250j)
+            assert_almost_equal(np.sum(d[1::2]), 250. + 250j)
+            assert_almost_equal(np.sum(d[::3]), 167. + 167j)
+            assert_almost_equal(np.sum(d[1::3]), 167. + 167j)
+            assert_almost_equal(np.sum(d[::-2]), 250. + 250j)
+            assert_almost_equal(np.sum(d[-1::-2]), 250. + 250j)
+            assert_almost_equal(np.sum(d[::-3]), 167. + 167j)
+            assert_almost_equal(np.sum(d[-1::-3]), 167. + 167j)
+            # sum with first reduction entry != 0
+            d = np.ones((1,), dtype=dt) + 1j
+            d += d
+            assert_almost_equal(d, 2. + 2j)
+
+    def test_sum_initial(self):
+        # Integer, single axis
+        assert_equal(np.sum([3], initial=2), 5)
+
+        # Floating point
+        assert_almost_equal(np.sum([0.2], initial=0.1), 0.3)
+
+        # Multiple non-adjacent axes
+        assert_equal(np.sum(np.ones((2, 3, 5), dtype=np.int64), axis=(0, 2), initial=2),
+                     [12, 12, 12])
+
+    def test_sum_where(self):
+        # More extensive tests done in test_reduction_with_where.
+        assert_equal(np.sum([[1., 2.], [3., 4.]], where=[True, False]), 4.)
+        assert_equal(np.sum([[1., 2.], [3., 4.]], axis=0, initial=5.,
+                            where=[True, False]), [9., 5.])
+
+    def test_inner1d(self):
+        a = np.arange(6).reshape((2, 3))
+        assert_array_equal(umt.inner1d(a, a), np.sum(a*a, axis=-1))
+        a = np.arange(6)
+        assert_array_equal(umt.inner1d(a, a), np.sum(a*a))
+
+    def test_broadcast(self):
+        msg = "broadcast"
+        a = np.arange(4).reshape((2, 1, 2))
+        b = np.arange(4).reshape((1, 2, 2))
+        assert_array_equal(umt.inner1d(a, b), np.sum(a*b, axis=-1), err_msg=msg)
+        msg = "extend & broadcast loop dimensions"
+        b = np.arange(4).reshape((2, 2))
+        assert_array_equal(umt.inner1d(a, b), np.sum(a*b, axis=-1), err_msg=msg)
+        # Broadcast in core dimensions should fail
+        a = np.arange(8).reshape((4, 2))
+        b = np.arange(4).reshape((4, 1))
+        assert_raises(ValueError, umt.inner1d, a, b)
+        # Extend core dimensions should fail
+        a = np.arange(8).reshape((4, 2))
+        b = np.array(7)
+        assert_raises(ValueError, umt.inner1d, a, b)
+        # Broadcast should fail
+        a = np.arange(2).reshape((2, 1, 1))
+        b = np.arange(3).reshape((3, 1, 1))
+        assert_raises(ValueError, umt.inner1d, a, b)
+
+        # Writing to a broadcasted array with overlap should warn, gh-2705
+        a = np.arange(2)
+        b = np.arange(4).reshape((2, 2))
+        u, v = np.broadcast_arrays(a, b)
+        assert_equal(u.strides[0], 0)
+        x = u + v
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter("always")
+            u += v
+            assert_equal(len(w), 1)
+            assert_(x[0,0]  != u[0, 0])
+
+    def test_type_cast(self):
+        msg = "type cast"
+        a = np.arange(6, dtype='short').reshape((2, 3))
+        assert_array_equal(umt.inner1d(a, a), np.sum(a*a, axis=-1),
+                           err_msg=msg)
+        msg = "type cast on one argument"
+        a = np.arange(6).reshape((2, 3))
+        b = a + 0.1
+        assert_array_almost_equal(umt.inner1d(a, b), np.sum(a*b, axis=-1),
+                                  err_msg=msg)
+
+    def test_endian(self):
+        msg = "big endian"
+        a = np.arange(6, dtype='>i4').reshape((2, 3))
+        assert_array_equal(umt.inner1d(a, a), np.sum(a*a, axis=-1),
+                           err_msg=msg)
+        msg = "little endian"
+        a = np.arange(6, dtype='<i4').reshape((2, 3))
+        assert_array_equal(umt.inner1d(a, a), np.sum(a*a, axis=-1),
+                           err_msg=msg)
+
+        # Output should always be native-endian
+        Ba = np.arange(1, dtype='>f8')
+        La = np.arange(1, dtype='<f8')
+        assert_equal((Ba+Ba).dtype, np.dtype('f8'))
+        assert_equal((Ba+La).dtype, np.dtype('f8'))
+        assert_equal((La+Ba).dtype, np.dtype('f8'))
+        assert_equal((La+La).dtype, np.dtype('f8'))
+
+        assert_equal(np.absolute(La).dtype, np.dtype('f8'))
+        assert_equal(np.absolute(Ba).dtype, np.dtype('f8'))
+        assert_equal(np.negative(La).dtype, np.dtype('f8'))
+        assert_equal(np.negative(Ba).dtype, np.dtype('f8'))
+
+    def test_incontiguous_array(self):
+        msg = "incontiguous memory layout of array"
+        x = np.arange(64).reshape((2, 2, 2, 2, 2, 2))
+        a = x[:, 0,:, 0,:, 0]
+        b = x[:, 1,:, 1,:, 1]
+        a[0, 0, 0] = -1
+        msg2 = "make sure it references to the original array"
+        assert_equal(x[0, 0, 0, 0, 0, 0], -1, err_msg=msg2)
+        assert_array_equal(umt.inner1d(a, b), np.sum(a*b, axis=-1), err_msg=msg)
+        x = np.arange(24).reshape(2, 3, 4)
+        a = x.T
+        b = x.T
+        a[0, 0, 0] = -1
+        assert_equal(x[0, 0, 0], -1, err_msg=msg2)
+        assert_array_equal(umt.inner1d(a, b), np.sum(a*b, axis=-1), err_msg=msg)
+
+    def test_output_argument(self):
+        msg = "output argument"
+        a = np.arange(12).reshape((2, 3, 2))
+        b = np.arange(4).reshape((2, 1, 2)) + 1
+        c = np.zeros((2, 3), dtype='int')
+        umt.inner1d(a, b, c)
+        assert_array_equal(c, np.sum(a*b, axis=-1), err_msg=msg)
+        c[:] = -1
+        umt.inner1d(a, b, out=c)
+        assert_array_equal(c, np.sum(a*b, axis=-1), err_msg=msg)
+
+        msg = "output argument with type cast"
+        c = np.zeros((2, 3), dtype='int16')
+        umt.inner1d(a, b, c)
+        assert_array_equal(c, np.sum(a*b, axis=-1), err_msg=msg)
+        c[:] = -1
+        umt.inner1d(a, b, out=c)
+        assert_array_equal(c, np.sum(a*b, axis=-1), err_msg=msg)
+
+        msg = "output argument with incontiguous layout"
+        c = np.zeros((2, 3, 4), dtype='int16')
+        umt.inner1d(a, b, c[..., 0])
+        assert_array_equal(c[..., 0], np.sum(a*b, axis=-1), err_msg=msg)
+        c[:] = -1
+        umt.inner1d(a, b, out=c[..., 0])
+        assert_array_equal(c[..., 0], np.sum(a*b, axis=-1), err_msg=msg)
+
+    def test_axes_argument(self):
+        # inner1d signature: '(i),(i)->()'
+        inner1d = umt.inner1d
+        a = np.arange(27.).reshape((3, 3, 3))
+        b = np.arange(10., 19.).reshape((3, 1, 3))
+        # basic tests on inputs (outputs tested below with matrix_multiply).
+        c = inner1d(a, b)
+        assert_array_equal(c, (a * b).sum(-1))
+        # default
+        c = inner1d(a, b, axes=[(-1,), (-1,), ()])
+        assert_array_equal(c, (a * b).sum(-1))
+        # integers ok for single axis.
+        c = inner1d(a, b, axes=[-1, -1, ()])
+        assert_array_equal(c, (a * b).sum(-1))
+        # mix fine
+        c = inner1d(a, b, axes=[(-1,), -1, ()])
+        assert_array_equal(c, (a * b).sum(-1))
+        # can omit last axis.
+        c = inner1d(a, b, axes=[-1, -1])
+        assert_array_equal(c, (a * b).sum(-1))
+        # can pass in other types of integer (with __index__ protocol)
+        c = inner1d(a, b, axes=[np.int8(-1), np.array(-1, dtype=np.int32)])
+        assert_array_equal(c, (a * b).sum(-1))
+        # swap some axes
+        c = inner1d(a, b, axes=[0, 0])
+        assert_array_equal(c, (a * b).sum(0))
+        c = inner1d(a, b, axes=[0, 2])
+        assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1))
+        # Check errors for improperly constructed axes arguments.
+        # should have list.
+        assert_raises(TypeError, inner1d, a, b, axes=-1)
+        # needs enough elements
+        assert_raises(ValueError, inner1d, a, b, axes=[-1])
+        # should pass in indices.
+        assert_raises(TypeError, inner1d, a, b, axes=[-1.0, -1.0])
+        assert_raises(TypeError, inner1d, a, b, axes=[(-1.0,), -1])
+        assert_raises(TypeError, inner1d, a, b, axes=[None, 1])
+        # cannot pass an index unless there is only one dimension
+        # (output is wrong in this case)
+        assert_raises(TypeError, inner1d, a, b, axes=[-1, -1, -1])
+        # or pass in generally the wrong number of axes
+        assert_raises(ValueError, inner1d, a, b, axes=[-1, -1, (-1,)])
+        assert_raises(ValueError, inner1d, a, b, axes=[-1, (-2, -1), ()])
+        # axes need to have same length.
+        assert_raises(ValueError, inner1d, a, b, axes=[0, 1])
+
+        # matrix_multiply signature: '(m,n),(n,p)->(m,p)'
+        mm = umt.matrix_multiply
+        a = np.arange(12).reshape((2, 3, 2))
+        b = np.arange(8).reshape((2, 2, 2, 1)) + 1
+        # Sanity check.
+        c = mm(a, b)
+        assert_array_equal(c, np.matmul(a, b))
+        # Default axes.
+        c = mm(a, b, axes=[(-2, -1), (-2, -1), (-2, -1)])
+        assert_array_equal(c, np.matmul(a, b))
+        # Default with explicit axes.
+        c = mm(a, b, axes=[(1, 2), (2, 3), (2, 3)])
+        assert_array_equal(c, np.matmul(a, b))
+        # swap some axes.
+        c = mm(a, b, axes=[(0, -1), (1, 2), (-2, -1)])
+        assert_array_equal(c, np.matmul(a.transpose(1, 0, 2),
+                                        b.transpose(0, 3, 1, 2)))
+        # Default with output array.
+        c = np.empty((2, 2, 3, 1))
+        d = mm(a, b, out=c, axes=[(1, 2), (2, 3), (2, 3)])
+        assert_(c is d)
+        assert_array_equal(c, np.matmul(a, b))
+        # Transposed output array
+        c = np.empty((1, 2, 2, 3))
+        d = mm(a, b, out=c, axes=[(-2, -1), (-2, -1), (3, 0)])
+        assert_(c is d)
+        assert_array_equal(c, np.matmul(a, b).transpose(3, 0, 1, 2))
+        # Check errors for improperly constructed axes arguments.
+        # wrong argument
+        assert_raises(TypeError, mm, a, b, axis=1)
+        # axes should be list
+        assert_raises(TypeError, mm, a, b, axes=1)
+        assert_raises(TypeError, mm, a, b, axes=((-2, -1), (-2, -1), (-2, -1)))
+        # list needs to have right length
+        assert_raises(ValueError, mm, a, b, axes=[])
+        assert_raises(ValueError, mm, a, b, axes=[(-2, -1)])
+        # list should contain tuples for multiple axes
+        assert_raises(TypeError, mm, a, b, axes=[-1, -1, -1])
+        assert_raises(TypeError, mm, a, b, axes=[(-2, -1), (-2, -1), -1])
+        assert_raises(TypeError,
+                      mm, a, b, axes=[[-2, -1], [-2, -1], [-2, -1]])
+        assert_raises(TypeError,
+                      mm, a, b, axes=[(-2, -1), (-2, -1), [-2, -1]])
+        assert_raises(TypeError, mm, a, b, axes=[(-2, -1), (-2, -1), None])
+        # tuples should not have duplicated values
+        assert_raises(ValueError, mm, a, b, axes=[(-2, -1), (-2, -1), (-2, -2)])
+        # arrays should have enough axes.
+        z = np.zeros((2, 2))
+        assert_raises(ValueError, mm, z, z[0])
+        assert_raises(ValueError, mm, z, z, out=z[:, 0])
+        assert_raises(ValueError, mm, z[1], z, axes=[0, 1])
+        assert_raises(ValueError, mm, z, z, out=z[0], axes=[0, 1])
+        # Regular ufuncs should not accept axes.
+        assert_raises(TypeError, np.add, 1., 1., axes=[0])
+        # should be able to deal with bad unrelated kwargs.
+        assert_raises(TypeError, mm, z, z, axes=[0, 1], parrot=True)
+
+    def test_axis_argument(self):
+        # inner1d signature: '(i),(i)->()'
+        inner1d = umt.inner1d
+        a = np.arange(27.).reshape((3, 3, 3))
+        b = np.arange(10., 19.).reshape((3, 1, 3))
+        c = inner1d(a, b)
+        assert_array_equal(c, (a * b).sum(-1))
+        c = inner1d(a, b, axis=-1)
+        assert_array_equal(c, (a * b).sum(-1))
+        out = np.zeros_like(c)
+        d = inner1d(a, b, axis=-1, out=out)
+        assert_(d is out)
+        assert_array_equal(d, c)
+        c = inner1d(a, b, axis=0)
+        assert_array_equal(c, (a * b).sum(0))
+        # Sanity checks on innerwt and cumsum.
+        a = np.arange(6).reshape((2, 3))
+        b = np.arange(10, 16).reshape((2, 3))
+        w = np.arange(20, 26).reshape((2, 3))
+        assert_array_equal(umt.innerwt(a, b, w, axis=0),
+                           np.sum(a * b * w, axis=0))
+        assert_array_equal(umt.cumsum(a, axis=0), np.cumsum(a, axis=0))
+        assert_array_equal(umt.cumsum(a, axis=-1), np.cumsum(a, axis=-1))
+        out = np.empty_like(a)
+        b = umt.cumsum(a, out=out, axis=0)
+        assert_(out is b)
+        assert_array_equal(b, np.cumsum(a, axis=0))
+        b = umt.cumsum(a, out=out, axis=1)
+        assert_(out is b)
+        assert_array_equal(b, np.cumsum(a, axis=-1))
+        # Check errors.
+        # Cannot pass in both axis and axes.
+        assert_raises(TypeError, inner1d, a, b, axis=0, axes=[0, 0])
+        # Not an integer.
+        assert_raises(TypeError, inner1d, a, b, axis=[0])
+        # more than 1 core dimensions.
+        mm = umt.matrix_multiply
+        assert_raises(TypeError, mm, a, b, axis=1)
+        # Output wrong size in axis.
+        out = np.empty((1, 2, 3), dtype=a.dtype)
+        assert_raises(ValueError, umt.cumsum, a, out=out, axis=0)
+        # Regular ufuncs should not accept axis.
+        assert_raises(TypeError, np.add, 1., 1., axis=0)
+
+    def test_keepdims_argument(self):
+        # inner1d signature: '(i),(i)->()'
+        inner1d = umt.inner1d
+        a = np.arange(27.).reshape((3, 3, 3))
+        b = np.arange(10., 19.).reshape((3, 1, 3))
+        c = inner1d(a, b)
+        assert_array_equal(c, (a * b).sum(-1))
+        c = inner1d(a, b, keepdims=False)
+        assert_array_equal(c, (a * b).sum(-1))
+        c = inner1d(a, b, keepdims=True)
+        assert_array_equal(c, (a * b).sum(-1, keepdims=True))
+        out = np.zeros_like(c)
+        d = inner1d(a, b, keepdims=True, out=out)
+        assert_(d is out)
+        assert_array_equal(d, c)
+        # Now combined with axis and axes.
+        c = inner1d(a, b, axis=-1, keepdims=False)
+        assert_array_equal(c, (a * b).sum(-1, keepdims=False))
+        c = inner1d(a, b, axis=-1, keepdims=True)
+        assert_array_equal(c, (a * b).sum(-1, keepdims=True))
+        c = inner1d(a, b, axis=0, keepdims=False)
+        assert_array_equal(c, (a * b).sum(0, keepdims=False))
+        c = inner1d(a, b, axis=0, keepdims=True)
+        assert_array_equal(c, (a * b).sum(0, keepdims=True))
+        c = inner1d(a, b, axes=[(-1,), (-1,), ()], keepdims=False)
+        assert_array_equal(c, (a * b).sum(-1))
+        c = inner1d(a, b, axes=[(-1,), (-1,), (-1,)], keepdims=True)
+        assert_array_equal(c, (a * b).sum(-1, keepdims=True))
+        c = inner1d(a, b, axes=[0, 0], keepdims=False)
+        assert_array_equal(c, (a * b).sum(0))
+        c = inner1d(a, b, axes=[0, 0, 0], keepdims=True)
+        assert_array_equal(c, (a * b).sum(0, keepdims=True))
+        c = inner1d(a, b, axes=[0, 2], keepdims=False)
+        assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1))
+        c = inner1d(a, b, axes=[0, 2], keepdims=True)
+        assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
+                                                             keepdims=True))
+        c = inner1d(a, b, axes=[0, 2, 2], keepdims=True)
+        assert_array_equal(c, (a.transpose(1, 2, 0) * b).sum(-1,
+                                                             keepdims=True))
+        c = inner1d(a, b, axes=[0, 2, 0], keepdims=True)
+        assert_array_equal(c, (a * b.transpose(2, 0, 1)).sum(0, keepdims=True))
+        # Hardly useful, but should work.
+        c = inner1d(a, b, axes=[0, 2, 1], keepdims=True)
+        assert_array_equal(c, (a.transpose(1, 0, 2) * b.transpose(0, 2, 1))
+                           .sum(1, keepdims=True))
+        # Check with two core dimensions.
+        a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
+        expected = uml.det(a)
+        c = uml.det(a, keepdims=False)
+        assert_array_equal(c, expected)
+        c = uml.det(a, keepdims=True)
+        assert_array_equal(c, expected[:, np.newaxis, np.newaxis])
+        a = np.eye(3) * np.arange(4.)[:, np.newaxis, np.newaxis]
+        expected_s, expected_l = uml.slogdet(a)
+        cs, cl = uml.slogdet(a, keepdims=False)
+        assert_array_equal(cs, expected_s)
+        assert_array_equal(cl, expected_l)
+        cs, cl = uml.slogdet(a, keepdims=True)
+        assert_array_equal(cs, expected_s[:, np.newaxis, np.newaxis])
+        assert_array_equal(cl, expected_l[:, np.newaxis, np.newaxis])
+        # Sanity check on innerwt.
+        a = np.arange(6).reshape((2, 3))
+        b = np.arange(10, 16).reshape((2, 3))
+        w = np.arange(20, 26).reshape((2, 3))
+        assert_array_equal(umt.innerwt(a, b, w, keepdims=True),
+                           np.sum(a * b * w, axis=-1, keepdims=True))
+        assert_array_equal(umt.innerwt(a, b, w, axis=0, keepdims=True),
+                           np.sum(a * b * w, axis=0, keepdims=True))
+        # Check errors.
+        # Not a boolean
+        assert_raises(TypeError, inner1d, a, b, keepdims='true')
+        # More than 1 core dimension, and core output dimensions.
+        mm = umt.matrix_multiply
+        assert_raises(TypeError, mm, a, b, keepdims=True)
+        assert_raises(TypeError, mm, a, b, keepdims=False)
+        # Regular ufuncs should not accept keepdims.
+        assert_raises(TypeError, np.add, 1., 1., keepdims=False)
+
+    def test_innerwt(self):
+        a = np.arange(6).reshape((2, 3))
+        b = np.arange(10, 16).reshape((2, 3))
+        w = np.arange(20, 26).reshape((2, 3))
+        assert_array_equal(umt.innerwt(a, b, w), np.sum(a*b*w, axis=-1))
+        a = np.arange(100, 124).reshape((2, 3, 4))
+        b = np.arange(200, 224).reshape((2, 3, 4))
+        w = np.arange(300, 324).reshape((2, 3, 4))
+        assert_array_equal(umt.innerwt(a, b, w), np.sum(a*b*w, axis=-1))
+
+    def test_innerwt_empty(self):
+        """Test generalized ufunc with zero-sized operands"""
+        a = np.array([], dtype='f8')
+        b = np.array([], dtype='f8')
+        w = np.array([], dtype='f8')
+        assert_array_equal(umt.innerwt(a, b, w), np.sum(a*b*w, axis=-1))
+
+    def test_cross1d(self):
+        """Test with fixed-sized signature."""
+        a = np.eye(3)
+        assert_array_equal(umt.cross1d(a, a), np.zeros((3, 3)))
+        out = np.zeros((3, 3))
+        result = umt.cross1d(a[0], a, out)
+        assert_(result is out)
+        assert_array_equal(result, np.vstack((np.zeros(3), a[2], -a[1])))
+        assert_raises(ValueError, umt.cross1d, np.eye(4), np.eye(4))
+        assert_raises(ValueError, umt.cross1d, a, np.arange(4.))
+        assert_raises(ValueError, umt.cross1d, a, np.arange(3.), np.zeros((3, 4)))
+
+    def test_can_ignore_signature(self):
+        # Comparing the effects of ? in signature:
+        # matrix_multiply: (m,n),(n,p)->(m,p)    # all must be there.
+        # matmul:        (m?,n),(n,p?)->(m?,p?)  # allow missing m, p.
+        mat = np.arange(12).reshape((2, 3, 2))
+        single_vec = np.arange(2)
+        col_vec = single_vec[:, np.newaxis]
+        col_vec_array = np.arange(8).reshape((2, 2, 2, 1)) + 1
+        # matrix @ single column vector with proper dimension
+        mm_col_vec = umt.matrix_multiply(mat, col_vec)
+        # matmul does the same thing
+        matmul_col_vec = umt.matmul(mat, col_vec)
+        assert_array_equal(matmul_col_vec, mm_col_vec)
+        # matrix @ vector without dimension making it a column vector.
+        # matrix multiply fails -> missing core dim.
+        assert_raises(ValueError, umt.matrix_multiply, mat, single_vec)
+        # matmul mimicker passes, and returns a vector.
+        matmul_col = umt.matmul(mat, single_vec)
+        assert_array_equal(matmul_col, mm_col_vec.squeeze())
+        # Now with a column array: same as for column vector,
+        # broadcasting sensibly.
+        mm_col_vec = umt.matrix_multiply(mat, col_vec_array)
+        matmul_col_vec = umt.matmul(mat, col_vec_array)
+        assert_array_equal(matmul_col_vec, mm_col_vec)
+        # As above, but for row vector
+        single_vec = np.arange(3)
+        row_vec = single_vec[np.newaxis, :]
+        row_vec_array = np.arange(24).reshape((4, 2, 1, 1, 3)) + 1
+        # row vector @ matrix
+        mm_row_vec = umt.matrix_multiply(row_vec, mat)
+        matmul_row_vec = umt.matmul(row_vec, mat)
+        assert_array_equal(matmul_row_vec, mm_row_vec)
+        # single row vector @ matrix
+        assert_raises(ValueError, umt.matrix_multiply, single_vec, mat)
+        matmul_row = umt.matmul(single_vec, mat)
+        assert_array_equal(matmul_row, mm_row_vec.squeeze())
+        # row vector array @ matrix
+        mm_row_vec = umt.matrix_multiply(row_vec_array, mat)
+        matmul_row_vec = umt.matmul(row_vec_array, mat)
+        assert_array_equal(matmul_row_vec, mm_row_vec)
+        # Now for vector combinations
+        # row vector @ column vector
+        col_vec = row_vec.T
+        col_vec_array = row_vec_array.swapaxes(-2, -1)
+        mm_row_col_vec = umt.matrix_multiply(row_vec, col_vec)
+        matmul_row_col_vec = umt.matmul(row_vec, col_vec)
+        assert_array_equal(matmul_row_col_vec, mm_row_col_vec)
+        # single row vector @ single col vector
+        assert_raises(ValueError, umt.matrix_multiply, single_vec, single_vec)
+        matmul_row_col = umt.matmul(single_vec, single_vec)
+        assert_array_equal(matmul_row_col, mm_row_col_vec.squeeze())
+        # row vector array @ matrix
+        mm_row_col_array = umt.matrix_multiply(row_vec_array, col_vec_array)
+        matmul_row_col_array = umt.matmul(row_vec_array, col_vec_array)
+        assert_array_equal(matmul_row_col_array, mm_row_col_array)
+        # Finally, check that things are *not* squeezed if one gives an
+        # output.
+        out = np.zeros_like(mm_row_col_array)
+        out = umt.matrix_multiply(row_vec_array, col_vec_array, out=out)
+        assert_array_equal(out, mm_row_col_array)
+        out[:] = 0
+        out = umt.matmul(row_vec_array, col_vec_array, out=out)
+        assert_array_equal(out, mm_row_col_array)
+        # And check one cannot put missing dimensions back.
+        out = np.zeros_like(mm_row_col_vec)
+        assert_raises(ValueError, umt.matrix_multiply, single_vec, single_vec,
+                      out)
+        # But fine for matmul, since it is just a broadcast.
+        out = umt.matmul(single_vec, single_vec, out)
+        assert_array_equal(out, mm_row_col_vec.squeeze())
+
+    def test_matrix_multiply(self):
+        self.compare_matrix_multiply_results(np.int64)
+        self.compare_matrix_multiply_results(np.double)
+
+    def test_matrix_multiply_umath_empty(self):
+        res = umt.matrix_multiply(np.ones((0, 10)), np.ones((10, 0)))
+        assert_array_equal(res, np.zeros((0, 0)))
+        res = umt.matrix_multiply(np.ones((10, 0)), np.ones((0, 10)))
+        assert_array_equal(res, np.zeros((10, 10)))
+
+    def compare_matrix_multiply_results(self, tp):
+        d1 = np.array(np.random.rand(2, 3, 4), dtype=tp)
+        d2 = np.array(np.random.rand(2, 3, 4), dtype=tp)
+        msg = "matrix multiply on type %s" % d1.dtype.name
+
+        def permute_n(n):
+            if n == 1:
+                return ([0],)
+            ret = ()
+            base = permute_n(n-1)
+            for perm in base:
+                for i in range(n):
+                    new = perm + [n-1]
+                    new[n-1] = new[i]
+                    new[i] = n-1
+                    ret += (new,)
+            return ret
+
+        def slice_n(n):
+            if n == 0:
+                return ((),)
+            ret = ()
+            base = slice_n(n-1)
+            for sl in base:
+                ret += (sl+(slice(None),),)
+                ret += (sl+(slice(0, 1),),)
+            return ret
+
+        def broadcastable(s1, s2):
+            return s1 == s2 or s1 == 1 or s2 == 1
+
+        permute_3 = permute_n(3)
+        slice_3 = slice_n(3) + ((slice(None, None, -1),)*3,)
+
+        ref = True
+        for p1 in permute_3:
+            for p2 in permute_3:
+                for s1 in slice_3:
+                    for s2 in slice_3:
+                        a1 = d1.transpose(p1)[s1]
+                        a2 = d2.transpose(p2)[s2]
+                        ref = ref and a1.base is not None
+                        ref = ref and a2.base is not None
+                        if (a1.shape[-1] == a2.shape[-2] and
+                                broadcastable(a1.shape[0], a2.shape[0])):
+                            assert_array_almost_equal(
+                                umt.matrix_multiply(a1, a2),
+                                np.sum(a2[..., np.newaxis].swapaxes(-3, -1) *
+                                       a1[..., np.newaxis,:], axis=-1),
+                                err_msg=msg + ' %s %s' % (str(a1.shape),
+                                                          str(a2.shape)))
+
+        assert_equal(ref, True, err_msg="reference check")
+
+    def test_euclidean_pdist(self):
+        a = np.arange(12, dtype=float).reshape(4, 3)
+        out = np.empty((a.shape[0] * (a.shape[0] - 1) // 2,), dtype=a.dtype)
+        umt.euclidean_pdist(a, out)
+        b = np.sqrt(np.sum((a[:, None] - a)**2, axis=-1))
+        b = b[~np.tri(a.shape[0], dtype=bool)]
+        assert_almost_equal(out, b)
+        # An output array is required to determine p with signature (n,d)->(p)
+        assert_raises(ValueError, umt.euclidean_pdist, a)
+
+    def test_cumsum(self):
+        a = np.arange(10)
+        result = umt.cumsum(a)
+        assert_array_equal(result, a.cumsum())
+
+    def test_object_logical(self):
+        a = np.array([3, None, True, False, "test", ""], dtype=object)
+        assert_equal(np.logical_or(a, None),
+                        np.array([x or None for x in a], dtype=object))
+        assert_equal(np.logical_or(a, True),
+                        np.array([x or True for x in a], dtype=object))
+        assert_equal(np.logical_or(a, 12),
+                        np.array([x or 12 for x in a], dtype=object))
+        assert_equal(np.logical_or(a, "blah"),
+                        np.array([x or "blah" for x in a], dtype=object))
+
+        assert_equal(np.logical_and(a, None),
+                        np.array([x and None for x in a], dtype=object))
+        assert_equal(np.logical_and(a, True),
+                        np.array([x and True for x in a], dtype=object))
+        assert_equal(np.logical_and(a, 12),
+                        np.array([x and 12 for x in a], dtype=object))
+        assert_equal(np.logical_and(a, "blah"),
+                        np.array([x and "blah" for x in a], dtype=object))
+
+        assert_equal(np.logical_not(a),
+                        np.array([not x for x in a], dtype=object))
+
+        assert_equal(np.logical_or.reduce(a), 3)
+        assert_equal(np.logical_and.reduce(a), None)
+
+    def test_object_comparison(self):
+        class HasComparisons:
+            def __eq__(self, other):
+                return '=='
+
+        arr0d = np.array(HasComparisons())
+        assert_equal(arr0d == arr0d, True)
+        assert_equal(np.equal(arr0d, arr0d), True)  # normal behavior is a cast
+
+        arr1d = np.array([HasComparisons()])
+        assert_equal(arr1d == arr1d, np.array([True]))
+        assert_equal(np.equal(arr1d, arr1d), np.array([True]))  # normal behavior is a cast
+        assert_equal(np.equal(arr1d, arr1d, dtype=object), np.array(['==']))
+
+    def test_object_array_reduction(self):
+        # Reductions on object arrays
+        a = np.array(['a', 'b', 'c'], dtype=object)
+        assert_equal(np.sum(a), 'abc')
+        assert_equal(np.max(a), 'c')
+        assert_equal(np.min(a), 'a')
+        a = np.array([True, False, True], dtype=object)
+        assert_equal(np.sum(a), 2)
+        assert_equal(np.prod(a), 0)
+        assert_equal(np.any(a), True)
+        assert_equal(np.all(a), False)
+        assert_equal(np.max(a), True)
+        assert_equal(np.min(a), False)
+        assert_equal(np.array([[1]], dtype=object).sum(), 1)
+        assert_equal(np.array([[[1, 2]]], dtype=object).sum((0, 1)), [1, 2])
+        assert_equal(np.array([1], dtype=object).sum(initial=1), 2)
+        assert_equal(np.array([[1], [2, 3]], dtype=object)
+                     .sum(initial=[0], where=[False, True]), [0, 2, 3])
+
+    def test_object_array_accumulate_inplace(self):
+        # Checks that in-place accumulates work, see also gh-7402
+        arr = np.ones(4, dtype=object)
+        arr[:] = [[1] for i in range(4)]
+        # Twice reproduced also for tuples:
+        np.add.accumulate(arr, out=arr)
+        np.add.accumulate(arr, out=arr)
+        assert_array_equal(arr,
+                           np.array([[1]*i for i in [1, 3, 6, 10]], dtype=object),
+                          )
+
+        # And the same if the axis argument is used
+        arr = np.ones((2, 4), dtype=object)
+        arr[0, :] = [[2] for i in range(4)]
+        np.add.accumulate(arr, out=arr, axis=-1)
+        np.add.accumulate(arr, out=arr, axis=-1)
+        assert_array_equal(arr[0, :],
+                           np.array([[2]*i for i in [1, 3, 6, 10]], dtype=object),
+                          )
+
+    def test_object_array_reduceat_inplace(self):
+        # Checks that in-place reduceats work, see also gh-7465
+        arr = np.empty(4, dtype=object)
+        arr[:] = [[1] for i in range(4)]
+        out = np.empty(4, dtype=object)
+        out[:] = [[1] for i in range(4)]
+        np.add.reduceat(arr, np.arange(4), out=arr)
+        np.add.reduceat(arr, np.arange(4), out=arr)
+        assert_array_equal(arr, out)
+
+        # And the same if the axis argument is used
+        arr = np.ones((2, 4), dtype=object)
+        arr[0, :] = [[2] for i in range(4)]
+        out = np.ones((2, 4), dtype=object)
+        out[0, :] = [[2] for i in range(4)]
+        np.add.reduceat(arr, np.arange(4), out=arr, axis=-1)
+        np.add.reduceat(arr, np.arange(4), out=arr, axis=-1)
+        assert_array_equal(arr, out)
+
+    def test_zerosize_reduction(self):
+        # Test with default dtype and object dtype
+        for a in [[], np.array([], dtype=object)]:
+            assert_equal(np.sum(a), 0)
+            assert_equal(np.prod(a), 1)
+            assert_equal(np.any(a), False)
+            assert_equal(np.all(a), True)
+            assert_raises(ValueError, np.max, a)
+            assert_raises(ValueError, np.min, a)
+
+    def test_axis_out_of_bounds(self):
+        a = np.array([False, False])
+        assert_raises(np.AxisError, a.all, axis=1)
+        a = np.array([False, False])
+        assert_raises(np.AxisError, a.all, axis=-2)
+
+        a = np.array([False, False])
+        assert_raises(np.AxisError, a.any, axis=1)
+        a = np.array([False, False])
+        assert_raises(np.AxisError, a.any, axis=-2)
+
+    def test_scalar_reduction(self):
+        # The functions 'sum', 'prod', etc allow specifying axis=0
+        # even for scalars
+        assert_equal(np.sum(3, axis=0), 3)
+        assert_equal(np.prod(3.5, axis=0), 3.5)
+        assert_equal(np.any(True, axis=0), True)
+        assert_equal(np.all(False, axis=0), False)
+        assert_equal(np.max(3, axis=0), 3)
+        assert_equal(np.min(2.5, axis=0), 2.5)
+
+        # Check scalar behaviour for ufuncs without an identity
+        assert_equal(np.power.reduce(3), 3)
+
+        # Make sure that scalars are coming out from this operation
+        assert_(type(np.prod(np.float32(2.5), axis=0)) is np.float32)
+        assert_(type(np.sum(np.float32(2.5), axis=0)) is np.float32)
+        assert_(type(np.max(np.float32(2.5), axis=0)) is np.float32)
+        assert_(type(np.min(np.float32(2.5), axis=0)) is np.float32)
+
+        # check if scalars/0-d arrays get cast
+        assert_(type(np.any(0, axis=0)) is np.bool_)
+
+        # assert that 0-d arrays get wrapped
+        class MyArray(np.ndarray):
+            pass
+        a = np.array(1).view(MyArray)
+        assert_(type(np.any(a)) is MyArray)
+
+    def test_casting_out_param(self):
+        # Test that it's possible to do casts on output
+        a = np.ones((200, 100), np.int64)
+        b = np.ones((200, 100), np.int64)
+        c = np.ones((200, 100), np.float64)
+        np.add(a, b, out=c)
+        assert_equal(c, 2)
+
+        a = np.zeros(65536)
+        b = np.zeros(65536, dtype=np.float32)
+        np.subtract(a, 0, out=b)
+        assert_equal(b, 0)
+
+    def test_where_param(self):
+        # Test that the where= ufunc parameter works with regular arrays
+        a = np.arange(7)
+        b = np.ones(7)
+        c = np.zeros(7)
+        np.add(a, b, out=c, where=(a % 2 == 1))
+        assert_equal(c, [0, 2, 0, 4, 0, 6, 0])
+
+        a = np.arange(4).reshape(2, 2) + 2
+        np.power(a, [2, 3], out=a, where=[[0, 1], [1, 0]])
+        assert_equal(a, [[2, 27], [16, 5]])
+        # Broadcasting the where= parameter
+        np.subtract(a, 2, out=a, where=[True, False])
+        assert_equal(a, [[0, 27], [14, 5]])
+
+    def test_where_param_buffer_output(self):
+        # This test is temporarily skipped because it requires
+        # adding masking features to the nditer to work properly
+
+        # With casting on output
+        a = np.ones(10, np.int64)
+        b = np.ones(10, np.int64)
+        c = 1.5 * np.ones(10, np.float64)
+        np.add(a, b, out=c, where=[1, 0, 0, 1, 0, 0, 1, 1, 1, 0])
+        assert_equal(c, [2, 1.5, 1.5, 2, 1.5, 1.5, 2, 2, 2, 1.5])
+
+    def test_where_param_alloc(self):
+        # With casting and allocated output
+        a = np.array([1], dtype=np.int64)
+        m = np.array([True], dtype=bool)
+        assert_equal(np.sqrt(a, where=m), [1])
+
+        # No casting and allocated output
+        a = np.array([1], dtype=np.float64)
+        m = np.array([True], dtype=bool)
+        assert_equal(np.sqrt(a, where=m), [1])
+
+    def check_identityless_reduction(self, a):
+        # np.minimum.reduce is an identityless reduction
+
+        # Verify that it sees the zero at various positions
+        a[...] = 1
+        a[1, 0, 0] = 0
+        assert_equal(np.minimum.reduce(a, axis=None), 0)
+        assert_equal(np.minimum.reduce(a, axis=(0, 1)), [0, 1, 1, 1])
+        assert_equal(np.minimum.reduce(a, axis=(0, 2)), [0, 1, 1])
+        assert_equal(np.minimum.reduce(a, axis=(1, 2)), [1, 0])
+        assert_equal(np.minimum.reduce(a, axis=0),
+                                    [[0, 1, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=1),
+                                    [[1, 1, 1, 1], [0, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=2),
+                                    [[1, 1, 1], [0, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=()), a)
+
+        a[...] = 1
+        a[0, 1, 0] = 0
+        assert_equal(np.minimum.reduce(a, axis=None), 0)
+        assert_equal(np.minimum.reduce(a, axis=(0, 1)), [0, 1, 1, 1])
+        assert_equal(np.minimum.reduce(a, axis=(0, 2)), [1, 0, 1])
+        assert_equal(np.minimum.reduce(a, axis=(1, 2)), [0, 1])
+        assert_equal(np.minimum.reduce(a, axis=0),
+                                    [[1, 1, 1, 1], [0, 1, 1, 1], [1, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=1),
+                                    [[0, 1, 1, 1], [1, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=2),
+                                    [[1, 0, 1], [1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=()), a)
+
+        a[...] = 1
+        a[0, 0, 1] = 0
+        assert_equal(np.minimum.reduce(a, axis=None), 0)
+        assert_equal(np.minimum.reduce(a, axis=(0, 1)), [1, 0, 1, 1])
+        assert_equal(np.minimum.reduce(a, axis=(0, 2)), [0, 1, 1])
+        assert_equal(np.minimum.reduce(a, axis=(1, 2)), [0, 1])
+        assert_equal(np.minimum.reduce(a, axis=0),
+                                    [[1, 0, 1, 1], [1, 1, 1, 1], [1, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=1),
+                                    [[1, 0, 1, 1], [1, 1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=2),
+                                    [[0, 1, 1], [1, 1, 1]])
+        assert_equal(np.minimum.reduce(a, axis=()), a)
+
+    def test_identityless_reduction_corder(self):
+        a = np.empty((2, 3, 4), order='C')
+        self.check_identityless_reduction(a)
+
+    def test_identityless_reduction_forder(self):
+        a = np.empty((2, 3, 4), order='F')
+        self.check_identityless_reduction(a)
+
+    def test_identityless_reduction_otherorder(self):
+        a = np.empty((2, 4, 3), order='C').swapaxes(1, 2)
+        self.check_identityless_reduction(a)
+
+    def test_identityless_reduction_noncontig(self):
+        a = np.empty((3, 5, 4), order='C').swapaxes(1, 2)
+        a = a[1:, 1:, 1:]
+        self.check_identityless_reduction(a)
+
+    def test_identityless_reduction_noncontig_unaligned(self):
+        a = np.empty((3*4*5*8 + 1,), dtype='i1')
+        a = a[1:].view(dtype='f8')
+        a.shape = (3, 4, 5)
+        a = a[1:, 1:, 1:]
+        self.check_identityless_reduction(a)
+
+    def test_initial_reduction(self):
+        # np.minimum.reduce is an identityless reduction
+
+        # For cases like np.maximum(np.abs(...), initial=0)
+        # More generally, a supremum over non-negative numbers.
+        assert_equal(np.maximum.reduce([], initial=0), 0)
+
+        # For cases like reduction of an empty array over the reals.
+        assert_equal(np.minimum.reduce([], initial=np.inf), np.inf)
+        assert_equal(np.maximum.reduce([], initial=-np.inf), -np.inf)
+
+        # Random tests
+        assert_equal(np.minimum.reduce([5], initial=4), 4)
+        assert_equal(np.maximum.reduce([4], initial=5), 5)
+        assert_equal(np.maximum.reduce([5], initial=4), 5)
+        assert_equal(np.minimum.reduce([4], initial=5), 4)
+
+        # Check initial=None raises ValueError for both types of ufunc reductions
+        assert_raises(ValueError, np.minimum.reduce, [], initial=None)
+        assert_raises(ValueError, np.add.reduce, [], initial=None)
+
+        # Check that np._NoValue gives default behavior.
+        assert_equal(np.add.reduce([], initial=np._NoValue), 0)
+
+        # Check that initial kwarg behaves as intended for dtype=object
+        a = np.array([10], dtype=object)
+        res = np.add.reduce(a, initial=5)
+        assert_equal(res, 15)
+
+    @pytest.mark.parametrize('axis', (0, 1, None))
+    @pytest.mark.parametrize('where', (np.array([False, True, True]),
+                                       np.array([[True], [False], [True]]),
+                                       np.array([[True, False, False],
+                                                 [False, True, False],
+                                                 [False, True, True]])))
+    def test_reduction_with_where(self, axis, where):
+        a = np.arange(9.).reshape(3, 3)
+        a_copy = a.copy()
+        a_check = np.zeros_like(a)
+        np.positive(a, out=a_check, where=where)
+
+        res = np.add.reduce(a, axis=axis, where=where)
+        check = a_check.sum(axis)
+        assert_equal(res, check)
+        # Check we do not overwrite elements of a internally.
+        assert_array_equal(a, a_copy)
+
+    @pytest.mark.parametrize(('axis', 'where'),
+                             ((0, np.array([True, False, True])),
+                              (1, [True, True, False]),
+                              (None, True)))
+    @pytest.mark.parametrize('initial', (-np.inf, 5.))
+    def test_reduction_with_where_and_initial(self, axis, where, initial):
+        a = np.arange(9.).reshape(3, 3)
+        a_copy = a.copy()
+        a_check = np.full(a.shape, -np.inf)
+        np.positive(a, out=a_check, where=where)
+
+        res = np.maximum.reduce(a, axis=axis, where=where, initial=initial)
+        check = a_check.max(axis, initial=initial)
+        assert_equal(res, check)
+
+    def test_reduction_where_initial_needed(self):
+        a = np.arange(9.).reshape(3, 3)
+        m = [False, True, False]
+        assert_raises(ValueError, np.maximum.reduce, a, where=m)
+
+    def test_identityless_reduction_nonreorderable(self):
+        a = np.array([[8.0, 2.0, 2.0], [1.0, 0.5, 0.25]])
+
+        res = np.divide.reduce(a, axis=0)
+        assert_equal(res, [8.0, 4.0, 8.0])
+
+        res = np.divide.reduce(a, axis=1)
+        assert_equal(res, [2.0, 8.0])
+
+        res = np.divide.reduce(a, axis=())
+        assert_equal(res, a)
+
+        assert_raises(ValueError, np.divide.reduce, a, axis=(0, 1))
+
+    def test_reduce_zero_axis(self):
+        # If we have a n x m array and do a reduction with axis=1, then we are
+        # doing n reductions, and each reduction takes an m-element array. For
+        # a reduction operation without an identity, then:
+        #   n > 0, m > 0: fine
+        #   n = 0, m > 0: fine, doing 0 reductions of m-element arrays
+        #   n > 0, m = 0: can't reduce a 0-element array, ValueError
+        #   n = 0, m = 0: can't reduce a 0-element array, ValueError (for
+        #     consistency with the above case)
+        # This test doesn't actually look at return values, it just checks to
+        # make sure that error we get an error in exactly those cases where we
+        # expect one, and assumes the calculations themselves are done
+        # correctly.
+
+        def ok(f, *args, **kwargs):
+            f(*args, **kwargs)
+
+        def err(f, *args, **kwargs):
+            assert_raises(ValueError, f, *args, **kwargs)
+
+        def t(expect, func, n, m):
+            expect(func, np.zeros((n, m)), axis=1)
+            expect(func, np.zeros((m, n)), axis=0)
+            expect(func, np.zeros((n // 2, n // 2, m)), axis=2)
+            expect(func, np.zeros((n // 2, m, n // 2)), axis=1)
+            expect(func, np.zeros((n, m // 2, m // 2)), axis=(1, 2))
+            expect(func, np.zeros((m // 2, n, m // 2)), axis=(0, 2))
+            expect(func, np.zeros((m // 3, m // 3, m // 3,
+                                  n // 2, n // 2)),
+                                 axis=(0, 1, 2))
+            # Check what happens if the inner (resp. outer) dimensions are a
+            # mix of zero and non-zero:
+            expect(func, np.zeros((10, m, n)), axis=(0, 1))
+            expect(func, np.zeros((10, n, m)), axis=(0, 2))
+            expect(func, np.zeros((m, 10, n)), axis=0)
+            expect(func, np.zeros((10, m, n)), axis=1)
+            expect(func, np.zeros((10, n, m)), axis=2)
+
+        # np.maximum is just an arbitrary ufunc with no reduction identity
+        assert_equal(np.maximum.identity, None)
+        t(ok, np.maximum.reduce, 30, 30)
+        t(ok, np.maximum.reduce, 0, 30)
+        t(err, np.maximum.reduce, 30, 0)
+        t(err, np.maximum.reduce, 0, 0)
+        err(np.maximum.reduce, [])
+        np.maximum.reduce(np.zeros((0, 0)), axis=())
+
+        # all of the combinations are fine for a reduction that has an
+        # identity
+        t(ok, np.add.reduce, 30, 30)
+        t(ok, np.add.reduce, 0, 30)
+        t(ok, np.add.reduce, 30, 0)
+        t(ok, np.add.reduce, 0, 0)
+        np.add.reduce([])
+        np.add.reduce(np.zeros((0, 0)), axis=())
+
+        # OTOH, accumulate always makes sense for any combination of n and m,
+        # because it maps an m-element array to an m-element array. These
+        # tests are simpler because accumulate doesn't accept multiple axes.
+        for uf in (np.maximum, np.add):
+            uf.accumulate(np.zeros((30, 0)), axis=0)
+            uf.accumulate(np.zeros((0, 30)), axis=0)
+            uf.accumulate(np.zeros((30, 30)), axis=0)
+            uf.accumulate(np.zeros((0, 0)), axis=0)
+
+    def test_safe_casting(self):
+        # In old versions of numpy, in-place operations used the 'unsafe'
+        # casting rules. In versions >= 1.10, 'same_kind' is the
+        # default and an exception is raised instead of a warning.
+        # when 'same_kind' is not satisfied.
+        a = np.array([1, 2, 3], dtype=int)
+        # Non-in-place addition is fine
+        assert_array_equal(assert_no_warnings(np.add, a, 1.1),
+                           [2.1, 3.1, 4.1])
+        assert_raises(TypeError, np.add, a, 1.1, out=a)
+
+        def add_inplace(a, b):
+            a += b
+
+        assert_raises(TypeError, add_inplace, a, 1.1)
+        # Make sure that explicitly overriding the exception is allowed:
+        assert_no_warnings(np.add, a, 1.1, out=a, casting="unsafe")
+        assert_array_equal(a, [2, 3, 4])
+
+    def test_ufunc_custom_out(self):
+        # Test ufunc with built in input types and custom output type
+
+        a = np.array([0, 1, 2], dtype='i8')
+        b = np.array([0, 1, 2], dtype='i8')
+        c = np.empty(3, dtype=_rational_tests.rational)
+
+        # Output must be specified so numpy knows what
+        # ufunc signature to look for
+        result = _rational_tests.test_add(a, b, c)
+        target = np.array([0, 2, 4], dtype=_rational_tests.rational)
+        assert_equal(result, target)
+
+        # no output type should raise TypeError
+        with assert_raises(TypeError):
+            _rational_tests.test_add(a, b)
+
+    def test_operand_flags(self):
+        a = np.arange(16, dtype='l').reshape(4, 4)
+        b = np.arange(9, dtype='l').reshape(3, 3)
+        opflag_tests.inplace_add(a[:-1, :-1], b)
+        assert_equal(a, np.array([[0, 2, 4, 3], [7, 9, 11, 7],
+            [14, 16, 18, 11], [12, 13, 14, 15]], dtype='l'))
+
+        a = np.array(0)
+        opflag_tests.inplace_add(a, 3)
+        assert_equal(a, 3)
+        opflag_tests.inplace_add(a, [3, 4])
+        assert_equal(a, 10)
+
+    def test_struct_ufunc(self):
+        import numpy.core._struct_ufunc_tests as struct_ufunc
+
+        a = np.array([(1, 2, 3)], dtype='u8,u8,u8')
+        b = np.array([(1, 2, 3)], dtype='u8,u8,u8')
+
+        result = struct_ufunc.add_triplet(a, b)
+        assert_equal(result, np.array([(2, 4, 6)], dtype='u8,u8,u8'))
+        assert_raises(RuntimeError, struct_ufunc.register_fail)
+
+    def test_custom_ufunc(self):
+        a = np.array(
+            [_rational_tests.rational(1, 2),
+             _rational_tests.rational(1, 3),
+             _rational_tests.rational(1, 4)],
+            dtype=_rational_tests.rational)
+        b = np.array(
+            [_rational_tests.rational(1, 2),
+             _rational_tests.rational(1, 3),
+             _rational_tests.rational(1, 4)],
+            dtype=_rational_tests.rational)
+
+        result = _rational_tests.test_add_rationals(a, b)
+        expected = np.array(
+            [_rational_tests.rational(1),
+             _rational_tests.rational(2, 3),
+             _rational_tests.rational(1, 2)],
+            dtype=_rational_tests.rational)
+        assert_equal(result, expected)
+
+    def test_custom_ufunc_forced_sig(self):
+        # gh-9351 - looking for a non-first userloop would previously hang
+        with assert_raises(TypeError):
+            np.multiply(_rational_tests.rational(1), 1,
+                        signature=(_rational_tests.rational, int, None))
+
+    def test_custom_array_like(self):
+
+        class MyThing:
+            __array_priority__ = 1000
+
+            rmul_count = 0
+            getitem_count = 0
+
+            def __init__(self, shape):
+                self.shape = shape
+
+            def __len__(self):
+                return self.shape[0]
+
+            def __getitem__(self, i):
+                MyThing.getitem_count += 1
+                if not isinstance(i, tuple):
+                    i = (i,)
+                if len(i) > self.ndim:
+                    raise IndexError("boo")
+
+                return MyThing(self.shape[len(i):])
+
+            def __rmul__(self, other):
+                MyThing.rmul_count += 1
+                return self
+
+        np.float64(5)*MyThing((3, 3))
+        assert_(MyThing.rmul_count == 1, MyThing.rmul_count)
+        assert_(MyThing.getitem_count <= 2, MyThing.getitem_count)
+
+    def test_inplace_fancy_indexing(self):
+
+        a = np.arange(10)
+        np.add.at(a, [2, 5, 2], 1)
+        assert_equal(a, [0, 1, 4, 3, 4, 6, 6, 7, 8, 9])
+
+        a = np.arange(10)
+        b = np.array([100, 100, 100])
+        np.add.at(a, [2, 5, 2], b)
+        assert_equal(a, [0, 1, 202, 3, 4, 105, 6, 7, 8, 9])
+
+        a = np.arange(9).reshape(3, 3)
+        b = np.array([[100, 100, 100], [200, 200, 200], [300, 300, 300]])
+        np.add.at(a, (slice(None), [1, 2, 1]), b)
+        assert_equal(a, [[0, 201, 102], [3, 404, 205], [6, 607, 308]])
+
+        a = np.arange(27).reshape(3, 3, 3)
+        b = np.array([100, 200, 300])
+        np.add.at(a, (slice(None), slice(None), [1, 2, 1]), b)
+        assert_equal(a,
+            [[[0, 401, 202],
+              [3, 404, 205],
+              [6, 407, 208]],
+
+             [[9, 410, 211],
+              [12, 413, 214],
+              [15, 416, 217]],
+
+             [[18, 419, 220],
+              [21, 422, 223],
+              [24, 425, 226]]])
+
+        a = np.arange(9).reshape(3, 3)
+        b = np.array([[100, 100, 100], [200, 200, 200], [300, 300, 300]])
+        np.add.at(a, ([1, 2, 1], slice(None)), b)
+        assert_equal(a, [[0, 1, 2], [403, 404, 405], [206, 207, 208]])
+
+        a = np.arange(27).reshape(3, 3, 3)
+        b = np.array([100, 200, 300])
+        np.add.at(a, (slice(None), [1, 2, 1], slice(None)), b)
+        assert_equal(a,
+            [[[0,  1,  2],
+              [203, 404, 605],
+              [106, 207, 308]],
+
+             [[9,  10, 11],
+              [212, 413, 614],
+              [115, 216, 317]],
+
+             [[18, 19, 20],
+              [221, 422, 623],
+              [124, 225, 326]]])
+
+        a = np.arange(9).reshape(3, 3)
+        b = np.array([100, 200, 300])
+        np.add.at(a, (0, [1, 2, 1]), b)
+        assert_equal(a, [[0, 401, 202], [3, 4, 5], [6, 7, 8]])
+
+        a = np.arange(27).reshape(3, 3, 3)
+        b = np.array([100, 200, 300])
+        np.add.at(a, ([1, 2, 1], 0, slice(None)), b)
+        assert_equal(a,
+            [[[0,  1,  2],
+              [3,  4,  5],
+              [6,  7,  8]],
+
+             [[209, 410, 611],
+              [12,  13, 14],
+              [15,  16, 17]],
+
+             [[118, 219, 320],
+              [21,  22, 23],
+              [24,  25, 26]]])
+
+        a = np.arange(27).reshape(3, 3, 3)
+        b = np.array([100, 200, 300])
+        np.add.at(a, (slice(None), slice(None), slice(None)), b)
+        assert_equal(a,
+            [[[100, 201, 302],
+              [103, 204, 305],
+              [106, 207, 308]],
+
+             [[109, 210, 311],
+              [112, 213, 314],
+              [115, 216, 317]],
+
+             [[118, 219, 320],
+              [121, 222, 323],
+              [124, 225, 326]]])
+
+        a = np.arange(10)
+        np.negative.at(a, [2, 5, 2])
+        assert_equal(a, [0, 1, 2, 3, 4, -5, 6, 7, 8, 9])
+
+        # Test 0-dim array
+        a = np.array(0)
+        np.add.at(a, (), 1)
+        assert_equal(a, 1)
+
+        assert_raises(IndexError, np.add.at, a, 0, 1)
+        assert_raises(IndexError, np.add.at, a, [], 1)
+
+        # Test mixed dtypes
+        a = np.arange(10)
+        np.power.at(a, [1, 2, 3, 2], 3.5)
+        assert_equal(a, np.array([0, 1, 4414, 46, 4, 5, 6, 7, 8, 9]))
+
+        # Test boolean indexing and boolean ufuncs
+        a = np.arange(10)
+        index = a % 2 == 0
+        np.equal.at(a, index, [0, 2, 4, 6, 8])
+        assert_equal(a, [1, 1, 1, 3, 1, 5, 1, 7, 1, 9])
+
+        # Test unary operator
+        a = np.arange(10, dtype='u4')
+        np.invert.at(a, [2, 5, 2])
+        assert_equal(a, [0, 1, 2, 3, 4, 5 ^ 0xffffffff, 6, 7, 8, 9])
+
+        # Test empty subspace
+        orig = np.arange(4)
+        a = orig[:, None][:, 0:0]
+        np.add.at(a, [0, 1], 3)
+        assert_array_equal(orig, np.arange(4))
+
+        # Test with swapped byte order
+        index = np.array([1, 2, 1], np.dtype('i').newbyteorder())
+        values = np.array([1, 2, 3, 4], np.dtype('f').newbyteorder())
+        np.add.at(values, index, 3)
+        assert_array_equal(values, [1, 8, 6, 4])
+
+        # Test exception thrown
+        values = np.array(['a', 1], dtype=object)
+        assert_raises(TypeError, np.add.at, values, [0, 1], 1)
+        assert_array_equal(values, np.array(['a', 1], dtype=object))
+
+        # Test multiple output ufuncs raise error, gh-5665
+        assert_raises(ValueError, np.modf.at, np.arange(10), [1])
+
+    def test_reduce_arguments(self):
+        f = np.add.reduce
+        d = np.ones((5,2), dtype=int)
+        o = np.ones((2,), dtype=d.dtype)
+        r = o * 5
+        assert_equal(f(d), r)
+        # a, axis=0, dtype=None, out=None, keepdims=False
+        assert_equal(f(d, axis=0), r)
+        assert_equal(f(d, 0), r)
+        assert_equal(f(d, 0, dtype=None), r)
+        assert_equal(f(d, 0, dtype='i'), r)
+        assert_equal(f(d, 0, 'i'), r)
+        assert_equal(f(d, 0, None), r)
+        assert_equal(f(d, 0, None, out=None), r)
+        assert_equal(f(d, 0, None, out=o), r)
+        assert_equal(f(d, 0, None, o), r)
+        assert_equal(f(d, 0, None, None), r)
+        assert_equal(f(d, 0, None, None, keepdims=False), r)
+        assert_equal(f(d, 0, None, None, True), r.reshape((1,) + r.shape))
+        assert_equal(f(d, 0, None, None, False, 0), r)
+        assert_equal(f(d, 0, None, None, False, initial=0), r)
+        assert_equal(f(d, 0, None, None, False, 0, True), r)
+        assert_equal(f(d, 0, None, None, False, 0, where=True), r)
+        # multiple keywords
+        assert_equal(f(d, axis=0, dtype=None, out=None, keepdims=False), r)
+        assert_equal(f(d, 0, dtype=None, out=None, keepdims=False), r)
+        assert_equal(f(d, 0, None, out=None, keepdims=False), r)
+        assert_equal(f(d, 0, None, out=None, keepdims=False, initial=0,
+                       where=True), r)
+
+        # too little
+        assert_raises(TypeError, f)
+        # too much
+        assert_raises(TypeError, f, d, 0, None, None, False, 0, True, 1)
+        # invalid axis
+        assert_raises(TypeError, f, d, "invalid")
+        assert_raises(TypeError, f, d, axis="invalid")
+        assert_raises(TypeError, f, d, axis="invalid", dtype=None,
+                      keepdims=True)
+        # invalid dtype
+        assert_raises(TypeError, f, d, 0, "invalid")
+        assert_raises(TypeError, f, d, dtype="invalid")
+        assert_raises(TypeError, f, d, dtype="invalid", out=None)
+        # invalid out
+        assert_raises(TypeError, f, d, 0, None, "invalid")
+        assert_raises(TypeError, f, d, out="invalid")
+        assert_raises(TypeError, f, d, out="invalid", dtype=None)
+        # keepdims boolean, no invalid value
+        # assert_raises(TypeError, f, d, 0, None, None, "invalid")
+        # assert_raises(TypeError, f, d, keepdims="invalid", axis=0, dtype=None)
+        # invalid mix
+        assert_raises(TypeError, f, d, 0, keepdims="invalid", dtype="invalid",
+                     out=None)
+
+        # invalid keyword
+        assert_raises(TypeError, f, d, axis=0, dtype=None, invalid=0)
+        assert_raises(TypeError, f, d, invalid=0)
+        assert_raises(TypeError, f, d, 0, keepdims=True, invalid="invalid",
+                      out=None)
+        assert_raises(TypeError, f, d, axis=0, dtype=None, keepdims=True,
+                      out=None, invalid=0)
+        assert_raises(TypeError, f, d, axis=0, dtype=None,
+                      out=None, invalid=0)
+
+    def test_structured_equal(self):
+        # https://github.com/numpy/numpy/issues/4855
+
+        class MyA(np.ndarray):
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return getattr(ufunc, method)(*(input.view(np.ndarray)
+                                              for input in inputs), **kwargs)
+        a = np.arange(12.).reshape(4,3)
+        ra = a.view(dtype=('f8,f8,f8')).squeeze()
+        mra = ra.view(MyA)
+
+        target = np.array([ True, False, False, False], dtype=bool)
+        assert_equal(np.all(target == (mra == ra[0])), True)
+
+    def test_scalar_equal(self):
+        # Scalar comparisons should always work, without deprecation warnings.
+        # even when the ufunc fails.
+        a = np.array(0.)
+        b = np.array('a')
+        assert_(a != b)
+        assert_(b != a)
+        assert_(not (a == b))
+        assert_(not (b == a))
+
+    def test_NotImplemented_not_returned(self):
+        # See gh-5964 and gh-2091. Some of these functions are not operator
+        # related and were fixed for other reasons in the past.
+        binary_funcs = [
+            np.power, np.add, np.subtract, np.multiply, np.divide,
+            np.true_divide, np.floor_divide, np.bitwise_and, np.bitwise_or,
+            np.bitwise_xor, np.left_shift, np.right_shift, np.fmax,
+            np.fmin, np.fmod, np.hypot, np.logaddexp, np.logaddexp2,
+            np.logical_and, np.logical_or, np.logical_xor, np.maximum,
+            np.minimum, np.mod,
+            np.greater, np.greater_equal, np.less, np.less_equal,
+            np.equal, np.not_equal]
+
+        a = np.array('1')
+        b = 1
+        c = np.array([1., 2.])
+        for f in binary_funcs:
+            assert_raises(TypeError, f, a, b)
+            assert_raises(TypeError, f, c, a)
+
+    def test_reduce_noncontig_output(self):
+        # Check that reduction deals with non-contiguous output arrays
+        # appropriately.
+        #
+        # gh-8036
+
+        x = np.arange(7*13*8, dtype=np.int16).reshape(7, 13, 8)
+        x = x[4:6,1:11:6,1:5].transpose(1, 2, 0)
+        y_base = np.arange(4*4, dtype=np.int16).reshape(4, 4)
+        y = y_base[::2,:]
+
+        y_base_copy = y_base.copy()
+
+        r0 = np.add.reduce(x, out=y.copy(), axis=2)
+        r1 = np.add.reduce(x, out=y, axis=2)
+
+        # The results should match, and y_base shouldn't get clobbered
+        assert_equal(r0, r1)
+        assert_equal(y_base[1,:], y_base_copy[1,:])
+        assert_equal(y_base[3,:], y_base_copy[3,:])
+
+    @pytest.mark.parametrize('output_shape',
+                             [(), (1,), (1, 1), (1, 3), (4, 3)])
+    @pytest.mark.parametrize('f_reduce', [np.add.reduce, np.minimum.reduce])
+    def test_reduce_wrong_dimension_output(self, f_reduce, output_shape):
+        # Test that we're not incorrectly broadcasting dimensions.
+        # See gh-15144 (failed for np.add.reduce previously).
+        a = np.arange(12.).reshape(4, 3)
+        out = np.empty(output_shape, a.dtype)
+        assert_raises(ValueError, f_reduce, a, axis=0, out=out)
+        if output_shape != (1, 3):
+            assert_raises(ValueError, f_reduce, a, axis=0, out=out,
+                          keepdims=True)
+        else:
+            check = f_reduce(a, axis=0, out=out, keepdims=True)
+            assert_(check is out)
+            assert_array_equal(check, f_reduce(a, axis=0, keepdims=True))
+
+    def test_no_doc_string(self):
+        # gh-9337
+        assert_('\n' not in umt.inner1d_no_doc.__doc__)
+
+    def test_invalid_args(self):
+        # gh-7961
+        exc = pytest.raises(TypeError, np.sqrt, None)
+        # minimally check the exception text
+        assert exc.match('loop of ufunc does not support')
+
+    @pytest.mark.parametrize('nat', [np.datetime64('nat'), np.timedelta64('nat')])
+    def test_nat_is_not_finite(self, nat):
+        try:
+            assert not np.isfinite(nat)
+        except TypeError:
+            pass  # ok, just not implemented
+
+    @pytest.mark.parametrize('nat', [np.datetime64('nat'), np.timedelta64('nat')])
+    def test_nat_is_nan(self, nat):
+        try:
+            assert np.isnan(nat)
+        except TypeError:
+            pass  # ok, just not implemented
+
+    @pytest.mark.parametrize('nat', [np.datetime64('nat'), np.timedelta64('nat')])
+    def test_nat_is_not_inf(self, nat):
+        try:
+            assert not np.isinf(nat)
+        except TypeError:
+            pass  # ok, just not implemented
+
+
+@pytest.mark.parametrize('ufunc', [getattr(np, x) for x in dir(np)
+                                if isinstance(getattr(np, x), np.ufunc)])
+def test_ufunc_types(ufunc):
+    '''
+    Check all ufuncs that the correct type is returned. Avoid
+    object and boolean types since many operations are not defined for
+    for them.
+
+    Choose the shape so even dot and matmul will succeed
+    '''
+    for typ in ufunc.types:
+        # types is a list of strings like ii->i
+        if 'O' in typ or '?' in typ:
+            continue
+        inp, out = typ.split('->')
+        args = [np.ones((3, 3), t) for t in inp]
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings("always")
+            res = ufunc(*args)
+        if isinstance(res, tuple):
+            outs = tuple(out)
+            assert len(res) == len(outs)
+            for r, t in zip(res, outs):
+                assert r.dtype == np.dtype(t)
+        else:
+            assert res.dtype == np.dtype(out)
+
+@pytest.mark.parametrize('ufunc', [getattr(np, x) for x in dir(np)
+                                if isinstance(getattr(np, x), np.ufunc)])
+def test_ufunc_noncontiguous(ufunc):
+    '''
+    Check that contiguous and non-contiguous calls to ufuncs
+    have the same results for values in range(9)
+    '''
+    for typ in ufunc.types:
+        # types is a list of strings like ii->i
+        if any(set('O?mM') & set(typ)):
+            # bool, object, datetime are too irregular for this simple test
+            continue
+        inp, out = typ.split('->')
+        args_c = [np.empty(6, t) for t in inp]
+        args_n = [np.empty(18, t)[::3] for t in inp]
+        for a in args_c:
+            a.flat = range(1,7)
+        for a in args_n:
+            a.flat = range(1,7)
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings("always")
+            res_c = ufunc(*args_c)
+            res_n = ufunc(*args_n)
+        if len(out) == 1:
+            res_c = (res_c,)
+            res_n = (res_n,)
+        for c_ar, n_ar in zip(res_c, res_n):
+            dt = c_ar.dtype
+            if np.issubdtype(dt, np.floating):
+                # for floating point results allow a small fuss in comparisons
+                # since different algorithms (libm vs. intrinsics) can be used
+                # for different input strides
+                res_eps = np.finfo(dt).eps
+                tol = 2*res_eps
+                assert_allclose(res_c, res_n, atol=tol, rtol=tol)
+            else:
+                assert_equal(c_ar, n_ar)
+
+
+@pytest.mark.parametrize('ufunc', [np.sign, np.equal])
+def test_ufunc_warn_with_nan(ufunc):
+    # issue gh-15127
+    # test that calling certain ufuncs with a non-standard `nan` value does not
+    # emit a warning
+    # `b` holds a 64 bit signaling nan: the most significant bit of the
+    # significand is zero.
+    b = np.array([0x7ff0000000000001], 'i8').view('f8')
+    assert np.isnan(b)
+    if ufunc.nin == 1:
+        ufunc(b)
+    elif ufunc.nin == 2:
+        ufunc(b, b.copy())
+    else:
+        raise ValueError('ufunc with more than 2 inputs')
+
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_umath.py b/venv/Lib/site-packages/numpy/core/tests/test_umath.py
new file mode 100644
index 000000000..7caa4c7f9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_umath.py
@@ -0,0 +1,3226 @@
+import platform
+import warnings
+import fnmatch
+import itertools
+import pytest
+from fractions import Fraction
+
+import numpy.core.umath as ncu
+from numpy.core import _umath_tests as ncu_tests
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_raises_regex,
+    assert_array_equal, assert_almost_equal, assert_array_almost_equal,
+    assert_array_max_ulp, assert_allclose, assert_no_warnings, suppress_warnings,
+    _gen_alignment_data, assert_array_almost_equal_nulp
+    )
+
+def on_powerpc():
+    """ True if we are running on a Power PC platform."""
+    return platform.processor() == 'powerpc' or \
+           platform.machine().startswith('ppc')
+
+
+def bad_arcsinh():
+    """The blacklisted trig functions are not accurate on aarch64 for
+    complex256. Rather than dig through the actual problem skip the
+    test. This should be fixed when we can move past glibc2.17
+    which is the version in manylinux2014
+    """
+    x = 1.78e-10
+    v1 = np.arcsinh(np.float128(x))
+    v2 = np.arcsinh(np.complex256(x)).real
+    # The eps for float128 is 1-e33, so this is way bigger
+    return abs((v1 / v2) - 1.0) > 1e-23
+
+if platform.machine() == 'aarch64' and bad_arcsinh():
+    skip_longcomplex_msg = ('Trig functions of np.longcomplex values known to be '
+                            'inaccurate on aarch64 for some compilation '
+                            'configurations, should be fixed by building on a '
+                            'platform using glibc>2.17')
+else:
+    skip_longcomplex_msg = ''
+
+
+class _FilterInvalids:
+    def setup(self):
+        self.olderr = np.seterr(invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.olderr)
+
+
+class TestConstants:
+    def test_pi(self):
+        assert_allclose(ncu.pi, 3.141592653589793, 1e-15)
+
+    def test_e(self):
+        assert_allclose(ncu.e, 2.718281828459045, 1e-15)
+
+    def test_euler_gamma(self):
+        assert_allclose(ncu.euler_gamma, 0.5772156649015329, 1e-15)
+
+
+class TestOut:
+    def test_out_subok(self):
+        for subok in (True, False):
+            a = np.array(0.5)
+            o = np.empty(())
+
+            r = np.add(a, 2, o, subok=subok)
+            assert_(r is o)
+            r = np.add(a, 2, out=o, subok=subok)
+            assert_(r is o)
+            r = np.add(a, 2, out=(o,), subok=subok)
+            assert_(r is o)
+
+            d = np.array(5.7)
+            o1 = np.empty(())
+            o2 = np.empty((), dtype=np.int32)
+
+            r1, r2 = np.frexp(d, o1, None, subok=subok)
+            assert_(r1 is o1)
+            r1, r2 = np.frexp(d, None, o2, subok=subok)
+            assert_(r2 is o2)
+            r1, r2 = np.frexp(d, o1, o2, subok=subok)
+            assert_(r1 is o1)
+            assert_(r2 is o2)
+
+            r1, r2 = np.frexp(d, out=(o1, None), subok=subok)
+            assert_(r1 is o1)
+            r1, r2 = np.frexp(d, out=(None, o2), subok=subok)
+            assert_(r2 is o2)
+            r1, r2 = np.frexp(d, out=(o1, o2), subok=subok)
+            assert_(r1 is o1)
+            assert_(r2 is o2)
+
+            with assert_raises(TypeError):
+                # Out argument must be tuple, since there are multiple outputs.
+                r1, r2 = np.frexp(d, out=o1, subok=subok)
+
+            assert_raises(ValueError, np.add, a, 2, o, o, subok=subok)
+            assert_raises(ValueError, np.add, a, 2, o, out=o, subok=subok)
+            assert_raises(ValueError, np.add, a, 2, None, out=o, subok=subok)
+            assert_raises(ValueError, np.add, a, 2, out=(o, o), subok=subok)
+            assert_raises(ValueError, np.add, a, 2, out=(), subok=subok)
+            assert_raises(TypeError, np.add, a, 2, [], subok=subok)
+            assert_raises(TypeError, np.add, a, 2, out=[], subok=subok)
+            assert_raises(TypeError, np.add, a, 2, out=([],), subok=subok)
+            o.flags.writeable = False
+            assert_raises(ValueError, np.add, a, 2, o, subok=subok)
+            assert_raises(ValueError, np.add, a, 2, out=o, subok=subok)
+            assert_raises(ValueError, np.add, a, 2, out=(o,), subok=subok)
+
+    def test_out_wrap_subok(self):
+        class ArrayWrap(np.ndarray):
+            __array_priority__ = 10
+
+            def __new__(cls, arr):
+                return np.asarray(arr).view(cls).copy()
+
+            def __array_wrap__(self, arr, context):
+                return arr.view(type(self))
+
+        for subok in (True, False):
+            a = ArrayWrap([0.5])
+
+            r = np.add(a, 2, subok=subok)
+            if subok:
+                assert_(isinstance(r, ArrayWrap))
+            else:
+                assert_(type(r) == np.ndarray)
+
+            r = np.add(a, 2, None, subok=subok)
+            if subok:
+                assert_(isinstance(r, ArrayWrap))
+            else:
+                assert_(type(r) == np.ndarray)
+
+            r = np.add(a, 2, out=None, subok=subok)
+            if subok:
+                assert_(isinstance(r, ArrayWrap))
+            else:
+                assert_(type(r) == np.ndarray)
+
+            r = np.add(a, 2, out=(None,), subok=subok)
+            if subok:
+                assert_(isinstance(r, ArrayWrap))
+            else:
+                assert_(type(r) == np.ndarray)
+
+            d = ArrayWrap([5.7])
+            o1 = np.empty((1,))
+            o2 = np.empty((1,), dtype=np.int32)
+
+            r1, r2 = np.frexp(d, o1, subok=subok)
+            if subok:
+                assert_(isinstance(r2, ArrayWrap))
+            else:
+                assert_(type(r2) == np.ndarray)
+
+            r1, r2 = np.frexp(d, o1, None, subok=subok)
+            if subok:
+                assert_(isinstance(r2, ArrayWrap))
+            else:
+                assert_(type(r2) == np.ndarray)
+
+            r1, r2 = np.frexp(d, None, o2, subok=subok)
+            if subok:
+                assert_(isinstance(r1, ArrayWrap))
+            else:
+                assert_(type(r1) == np.ndarray)
+
+            r1, r2 = np.frexp(d, out=(o1, None), subok=subok)
+            if subok:
+                assert_(isinstance(r2, ArrayWrap))
+            else:
+                assert_(type(r2) == np.ndarray)
+
+            r1, r2 = np.frexp(d, out=(None, o2), subok=subok)
+            if subok:
+                assert_(isinstance(r1, ArrayWrap))
+            else:
+                assert_(type(r1) == np.ndarray)
+
+            with assert_raises(TypeError):
+                # Out argument must be tuple, since there are multiple outputs.
+                r1, r2 = np.frexp(d, out=o1, subok=subok)
+
+
+class TestComparisons:
+    def test_ignore_object_identity_in_equal(self):
+        # Check comparing identical objects whose comparison
+        # is not a simple boolean, e.g., arrays that are compared elementwise.
+        a = np.array([np.array([1, 2, 3]), None], dtype=object)
+        assert_raises(ValueError, np.equal, a, a)
+
+        # Check error raised when comparing identical non-comparable objects.
+        class FunkyType:
+            def __eq__(self, other):
+                raise TypeError("I won't compare")
+
+        a = np.array([FunkyType()])
+        assert_raises(TypeError, np.equal, a, a)
+
+        # Check identity doesn't override comparison mismatch.
+        a = np.array([np.nan], dtype=object)
+        assert_equal(np.equal(a, a), [False])
+
+    def test_ignore_object_identity_in_not_equal(self):
+        # Check comparing identical objects whose comparison
+        # is not a simple boolean, e.g., arrays that are compared elementwise.
+        a = np.array([np.array([1, 2, 3]), None], dtype=object)
+        assert_raises(ValueError, np.not_equal, a, a)
+
+        # Check error raised when comparing identical non-comparable objects.
+        class FunkyType:
+            def __ne__(self, other):
+                raise TypeError("I won't compare")
+
+        a = np.array([FunkyType()])
+        assert_raises(TypeError, np.not_equal, a, a)
+
+        # Check identity doesn't override comparison mismatch.
+        a = np.array([np.nan], dtype=object)
+        assert_equal(np.not_equal(a, a), [True])
+
+
+class TestAdd:
+    def test_reduce_alignment(self):
+        # gh-9876
+        # make sure arrays with weird strides work with the optimizations in
+        # pairwise_sum_@TYPE@. On x86, the 'b' field will count as aligned at a
+        # 4 byte offset, even though its itemsize is 8.
+        a = np.zeros(2, dtype=[('a', np.int32), ('b', np.float64)])
+        a['a'] = -1
+        assert_equal(a['b'].sum(), 0)
+
+
+class TestDivision:
+    def test_division_int(self):
+        # int division should follow Python
+        x = np.array([5, 10, 90, 100, -5, -10, -90, -100, -120])
+        if 5 / 10 == 0.5:
+            assert_equal(x / 100, [0.05, 0.1, 0.9, 1,
+                                   -0.05, -0.1, -0.9, -1, -1.2])
+        else:
+            assert_equal(x / 100, [0, 0, 0, 1, -1, -1, -1, -1, -2])
+        assert_equal(x // 100, [0, 0, 0, 1, -1, -1, -1, -1, -2])
+        assert_equal(x % 100, [5, 10, 90, 0, 95, 90, 10, 0, 80])
+
+    def test_division_complex(self):
+        # check that implementation is correct
+        msg = "Complex division implementation check"
+        x = np.array([1. + 1.*1j, 1. + .5*1j, 1. + 2.*1j], dtype=np.complex128)
+        assert_almost_equal(x**2/x, x, err_msg=msg)
+        # check overflow, underflow
+        msg = "Complex division overflow/underflow check"
+        x = np.array([1.e+110, 1.e-110], dtype=np.complex128)
+        y = x**2/x
+        assert_almost_equal(y/x, [1, 1], err_msg=msg)
+
+    def test_zero_division_complex(self):
+        with np.errstate(invalid="ignore", divide="ignore"):
+            x = np.array([0.0], dtype=np.complex128)
+            y = 1.0/x
+            assert_(np.isinf(y)[0])
+            y = complex(np.inf, np.nan)/x
+            assert_(np.isinf(y)[0])
+            y = complex(np.nan, np.inf)/x
+            assert_(np.isinf(y)[0])
+            y = complex(np.inf, np.inf)/x
+            assert_(np.isinf(y)[0])
+            y = 0.0/x
+            assert_(np.isnan(y)[0])
+
+    def test_floor_division_complex(self):
+        # check that implementation is correct
+        msg = "Complex floor division implementation check"
+        x = np.array([.9 + 1j, -.1 + 1j, .9 + .5*1j, .9 + 2.*1j], dtype=np.complex128)
+        y = np.array([0., -1., 0., 0.], dtype=np.complex128)
+        assert_equal(np.floor_divide(x**2, x), y, err_msg=msg)
+        # check overflow, underflow
+        msg = "Complex floor division overflow/underflow check"
+        x = np.array([1.e+110, 1.e-110], dtype=np.complex128)
+        y = np.floor_divide(x**2, x)
+        assert_equal(y, [1.e+110, 0], err_msg=msg)
+
+    def test_floor_division_signed_zero(self):
+        # Check that the sign bit is correctly set when dividing positive and
+        # negative zero by one.
+        x = np.zeros(10)
+        assert_equal(np.signbit(x//1), 0)
+        assert_equal(np.signbit((-x)//1), 1)
+
+def floor_divide_and_remainder(x, y):
+    return (np.floor_divide(x, y), np.remainder(x, y))
+
+
+def _signs(dt):
+    if dt in np.typecodes['UnsignedInteger']:
+        return (+1,)
+    else:
+        return (+1, -1)
+
+
+class TestRemainder:
+
+    def test_remainder_basic(self):
+        dt = np.typecodes['AllInteger'] + np.typecodes['Float']
+        for op in [floor_divide_and_remainder, np.divmod]:
+            for dt1, dt2 in itertools.product(dt, dt):
+                for sg1, sg2 in itertools.product(_signs(dt1), _signs(dt2)):
+                    fmt = 'op: %s, dt1: %s, dt2: %s, sg1: %s, sg2: %s'
+                    msg = fmt % (op.__name__, dt1, dt2, sg1, sg2)
+                    a = np.array(sg1*71, dtype=dt1)
+                    b = np.array(sg2*19, dtype=dt2)
+                    div, rem = op(a, b)
+                    assert_equal(div*b + rem, a, err_msg=msg)
+                    if sg2 == -1:
+                        assert_(b < rem <= 0, msg)
+                    else:
+                        assert_(b > rem >= 0, msg)
+
+    def test_float_remainder_exact(self):
+        # test that float results are exact for small integers. This also
+        # holds for the same integers scaled by powers of two.
+        nlst = list(range(-127, 0))
+        plst = list(range(1, 128))
+        dividend = nlst + [0] + plst
+        divisor = nlst + plst
+        arg = list(itertools.product(dividend, divisor))
+        tgt = list(divmod(*t) for t in arg)
+
+        a, b = np.array(arg, dtype=int).T
+        # convert exact integer results from Python to float so that
+        # signed zero can be used, it is checked.
+        tgtdiv, tgtrem = np.array(tgt, dtype=float).T
+        tgtdiv = np.where((tgtdiv == 0.0) & ((b < 0) ^ (a < 0)), -0.0, tgtdiv)
+        tgtrem = np.where((tgtrem == 0.0) & (b < 0), -0.0, tgtrem)
+
+        for op in [floor_divide_and_remainder, np.divmod]:
+            for dt in np.typecodes['Float']:
+                msg = 'op: %s, dtype: %s' % (op.__name__, dt)
+                fa = a.astype(dt)
+                fb = b.astype(dt)
+                div, rem = op(fa, fb)
+                assert_equal(div, tgtdiv, err_msg=msg)
+                assert_equal(rem, tgtrem, err_msg=msg)
+
+    def test_float_remainder_roundoff(self):
+        # gh-6127
+        dt = np.typecodes['Float']
+        for op in [floor_divide_and_remainder, np.divmod]:
+            for dt1, dt2 in itertools.product(dt, dt):
+                for sg1, sg2 in itertools.product((+1, -1), (+1, -1)):
+                    fmt = 'op: %s, dt1: %s, dt2: %s, sg1: %s, sg2: %s'
+                    msg = fmt % (op.__name__, dt1, dt2, sg1, sg2)
+                    a = np.array(sg1*78*6e-8, dtype=dt1)
+                    b = np.array(sg2*6e-8, dtype=dt2)
+                    div, rem = op(a, b)
+                    # Equal assertion should hold when fmod is used
+                    assert_equal(div*b + rem, a, err_msg=msg)
+                    if sg2 == -1:
+                        assert_(b < rem <= 0, msg)
+                    else:
+                        assert_(b > rem >= 0, msg)
+
+    def test_float_remainder_corner_cases(self):
+        # Check remainder magnitude.
+        for dt in np.typecodes['Float']:
+            b = np.array(1.0, dtype=dt)
+            a = np.nextafter(np.array(0.0, dtype=dt), -b)
+            rem = np.remainder(a, b)
+            assert_(rem <= b, 'dt: %s' % dt)
+            rem = np.remainder(-a, -b)
+            assert_(rem >= -b, 'dt: %s' % dt)
+
+        # Check nans, inf
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning, "invalid value encountered in remainder")
+            for dt in np.typecodes['Float']:
+                fone = np.array(1.0, dtype=dt)
+                fzer = np.array(0.0, dtype=dt)
+                finf = np.array(np.inf, dtype=dt)
+                fnan = np.array(np.nan, dtype=dt)
+                rem = np.remainder(fone, fzer)
+                assert_(np.isnan(rem), 'dt: %s, rem: %s' % (dt, rem))
+                # MSVC 2008 returns NaN here, so disable the check.
+                #rem = np.remainder(fone, finf)
+                #assert_(rem == fone, 'dt: %s, rem: %s' % (dt, rem))
+                rem = np.remainder(fone, fnan)
+                assert_(np.isnan(rem), 'dt: %s, rem: %s' % (dt, rem))
+                rem = np.remainder(finf, fone)
+                assert_(np.isnan(rem), 'dt: %s, rem: %s' % (dt, rem))
+
+
+class TestCbrt:
+    def test_cbrt_scalar(self):
+        assert_almost_equal((np.cbrt(np.float32(-2.5)**3)), -2.5)
+
+    def test_cbrt(self):
+        x = np.array([1., 2., -3., np.inf, -np.inf])
+        assert_almost_equal(np.cbrt(x**3), x)
+
+        assert_(np.isnan(np.cbrt(np.nan)))
+        assert_equal(np.cbrt(np.inf), np.inf)
+        assert_equal(np.cbrt(-np.inf), -np.inf)
+
+
+class TestPower:
+    def test_power_float(self):
+        x = np.array([1., 2., 3.])
+        assert_equal(x**0, [1., 1., 1.])
+        assert_equal(x**1, x)
+        assert_equal(x**2, [1., 4., 9.])
+        y = x.copy()
+        y **= 2
+        assert_equal(y, [1., 4., 9.])
+        assert_almost_equal(x**(-1), [1., 0.5, 1./3])
+        assert_almost_equal(x**(0.5), [1., ncu.sqrt(2), ncu.sqrt(3)])
+
+        for out, inp, msg in _gen_alignment_data(dtype=np.float32,
+                                                 type='unary',
+                                                 max_size=11):
+            exp = [ncu.sqrt(i) for i in inp]
+            assert_almost_equal(inp**(0.5), exp, err_msg=msg)
+            np.sqrt(inp, out=out)
+            assert_equal(out, exp, err_msg=msg)
+
+        for out, inp, msg in _gen_alignment_data(dtype=np.float64,
+                                                 type='unary',
+                                                 max_size=7):
+            exp = [ncu.sqrt(i) for i in inp]
+            assert_almost_equal(inp**(0.5), exp, err_msg=msg)
+            np.sqrt(inp, out=out)
+            assert_equal(out, exp, err_msg=msg)
+
+    def test_power_complex(self):
+        x = np.array([1+2j, 2+3j, 3+4j])
+        assert_equal(x**0, [1., 1., 1.])
+        assert_equal(x**1, x)
+        assert_almost_equal(x**2, [-3+4j, -5+12j, -7+24j])
+        assert_almost_equal(x**3, [(1+2j)**3, (2+3j)**3, (3+4j)**3])
+        assert_almost_equal(x**4, [(1+2j)**4, (2+3j)**4, (3+4j)**4])
+        assert_almost_equal(x**(-1), [1/(1+2j), 1/(2+3j), 1/(3+4j)])
+        assert_almost_equal(x**(-2), [1/(1+2j)**2, 1/(2+3j)**2, 1/(3+4j)**2])
+        assert_almost_equal(x**(-3), [(-11+2j)/125, (-46-9j)/2197,
+                                      (-117-44j)/15625])
+        assert_almost_equal(x**(0.5), [ncu.sqrt(1+2j), ncu.sqrt(2+3j),
+                                       ncu.sqrt(3+4j)])
+        norm = 1./((x**14)[0])
+        assert_almost_equal(x**14 * norm,
+                [i * norm for i in [-76443+16124j, 23161315+58317492j,
+                                    5583548873 + 2465133864j]])
+
+        # Ticket #836
+        def assert_complex_equal(x, y):
+            assert_array_equal(x.real, y.real)
+            assert_array_equal(x.imag, y.imag)
+
+        for z in [complex(0, np.inf), complex(1, np.inf)]:
+            z = np.array([z], dtype=np.complex_)
+            with np.errstate(invalid="ignore"):
+                assert_complex_equal(z**1, z)
+                assert_complex_equal(z**2, z*z)
+                assert_complex_equal(z**3, z*z*z)
+
+    def test_power_zero(self):
+        # ticket #1271
+        zero = np.array([0j])
+        one = np.array([1+0j])
+        cnan = np.array([complex(np.nan, np.nan)])
+        # FIXME cinf not tested.
+        #cinf = np.array([complex(np.inf, 0)])
+
+        def assert_complex_equal(x, y):
+            x, y = np.asarray(x), np.asarray(y)
+            assert_array_equal(x.real, y.real)
+            assert_array_equal(x.imag, y.imag)
+
+        # positive powers
+        for p in [0.33, 0.5, 1, 1.5, 2, 3, 4, 5, 6.6]:
+            assert_complex_equal(np.power(zero, p), zero)
+
+        # zero power
+        assert_complex_equal(np.power(zero, 0), one)
+        with np.errstate(invalid="ignore"):
+            assert_complex_equal(np.power(zero, 0+1j), cnan)
+
+            # negative power
+            for p in [0.33, 0.5, 1, 1.5, 2, 3, 4, 5, 6.6]:
+                assert_complex_equal(np.power(zero, -p), cnan)
+            assert_complex_equal(np.power(zero, -1+0.2j), cnan)
+
+    def test_fast_power(self):
+        x = np.array([1, 2, 3], np.int16)
+        res = x**2.0
+        assert_((x**2.00001).dtype is res.dtype)
+        assert_array_equal(res, [1, 4, 9])
+        # check the inplace operation on the casted copy doesn't mess with x
+        assert_(not np.may_share_memory(res, x))
+        assert_array_equal(x, [1, 2, 3])
+
+        # Check that the fast path ignores 1-element not 0-d arrays
+        res = x ** np.array([[[2]]])
+        assert_equal(res.shape, (1, 1, 3))
+
+    def test_integer_power(self):
+        a = np.array([15, 15], 'i8')
+        b = np.power(a, a)
+        assert_equal(b, [437893890380859375, 437893890380859375])
+
+    def test_integer_power_with_integer_zero_exponent(self):
+        dtypes = np.typecodes['Integer']
+        for dt in dtypes:
+            arr = np.arange(-10, 10, dtype=dt)
+            assert_equal(np.power(arr, 0), np.ones_like(arr))
+
+        dtypes = np.typecodes['UnsignedInteger']
+        for dt in dtypes:
+            arr = np.arange(10, dtype=dt)
+            assert_equal(np.power(arr, 0), np.ones_like(arr))
+
+    def test_integer_power_of_1(self):
+        dtypes = np.typecodes['AllInteger']
+        for dt in dtypes:
+            arr = np.arange(10, dtype=dt)
+            assert_equal(np.power(1, arr), np.ones_like(arr))
+
+    def test_integer_power_of_zero(self):
+        dtypes = np.typecodes['AllInteger']
+        for dt in dtypes:
+            arr = np.arange(1, 10, dtype=dt)
+            assert_equal(np.power(0, arr), np.zeros_like(arr))
+
+    def test_integer_to_negative_power(self):
+        dtypes = np.typecodes['Integer']
+        for dt in dtypes:
+            a = np.array([0, 1, 2, 3], dtype=dt)
+            b = np.array([0, 1, 2, -3], dtype=dt)
+            one = np.array(1, dtype=dt)
+            minusone = np.array(-1, dtype=dt)
+            assert_raises(ValueError, np.power, a, b)
+            assert_raises(ValueError, np.power, a, minusone)
+            assert_raises(ValueError, np.power, one, b)
+            assert_raises(ValueError, np.power, one, minusone)
+
+
+class TestFloat_power:
+    def test_type_conversion(self):
+        arg_type = '?bhilBHILefdgFDG'
+        res_type = 'ddddddddddddgDDG'
+        for dtin, dtout in zip(arg_type, res_type):
+            msg = "dtin: %s, dtout: %s" % (dtin, dtout)
+            arg = np.ones(1, dtype=dtin)
+            res = np.float_power(arg, arg)
+            assert_(res.dtype.name == np.dtype(dtout).name, msg)
+
+
+class TestLog2:
+    def test_log2_values(self):
+        x = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024]
+        y = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+        for dt in ['f', 'd', 'g']:
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)
+            assert_almost_equal(np.log2(xf), yf)
+
+    def test_log2_ints(self):
+        # a good log2 implementation should provide this,
+        # might fail on OS with bad libm
+        for i in range(1, 65):
+            v = np.log2(2.**i)
+            assert_equal(v, float(i), err_msg='at exponent %d' % i)
+
+    def test_log2_special(self):
+        assert_equal(np.log2(1.), 0.)
+        assert_equal(np.log2(np.inf), np.inf)
+        assert_(np.isnan(np.log2(np.nan)))
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_(np.isnan(np.log2(-1.)))
+            assert_(np.isnan(np.log2(-np.inf)))
+            assert_equal(np.log2(0.), -np.inf)
+            assert_(w[0].category is RuntimeWarning)
+            assert_(w[1].category is RuntimeWarning)
+            assert_(w[2].category is RuntimeWarning)
+
+
+class TestExp2:
+    def test_exp2_values(self):
+        x = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024]
+        y = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+        for dt in ['f', 'd', 'g']:
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)
+            assert_almost_equal(np.exp2(yf), xf)
+
+
+class TestLogAddExp2(_FilterInvalids):
+    # Need test for intermediate precisions
+    def test_logaddexp2_values(self):
+        x = [1, 2, 3, 4, 5]
+        y = [5, 4, 3, 2, 1]
+        z = [6, 6, 6, 6, 6]
+        for dt, dec_ in zip(['f', 'd', 'g'], [6, 15, 15]):
+            xf = np.log2(np.array(x, dtype=dt))
+            yf = np.log2(np.array(y, dtype=dt))
+            zf = np.log2(np.array(z, dtype=dt))
+            assert_almost_equal(np.logaddexp2(xf, yf), zf, decimal=dec_)
+
+    def test_logaddexp2_range(self):
+        x = [1000000, -1000000, 1000200, -1000200]
+        y = [1000200, -1000200, 1000000, -1000000]
+        z = [1000200, -1000000, 1000200, -1000000]
+        for dt in ['f', 'd', 'g']:
+            logxf = np.array(x, dtype=dt)
+            logyf = np.array(y, dtype=dt)
+            logzf = np.array(z, dtype=dt)
+            assert_almost_equal(np.logaddexp2(logxf, logyf), logzf)
+
+    def test_inf(self):
+        inf = np.inf
+        x = [inf, -inf,  inf, -inf, inf, 1,  -inf,  1]
+        y = [inf,  inf, -inf, -inf, 1,   inf, 1,   -inf]
+        z = [inf,  inf,  inf, -inf, inf, inf, 1,    1]
+        with np.errstate(invalid='raise'):
+            for dt in ['f', 'd', 'g']:
+                logxf = np.array(x, dtype=dt)
+                logyf = np.array(y, dtype=dt)
+                logzf = np.array(z, dtype=dt)
+                assert_equal(np.logaddexp2(logxf, logyf), logzf)
+
+    def test_nan(self):
+        assert_(np.isnan(np.logaddexp2(np.nan, np.inf)))
+        assert_(np.isnan(np.logaddexp2(np.inf, np.nan)))
+        assert_(np.isnan(np.logaddexp2(np.nan, 0)))
+        assert_(np.isnan(np.logaddexp2(0, np.nan)))
+        assert_(np.isnan(np.logaddexp2(np.nan, np.nan)))
+
+    def test_reduce(self):
+        assert_equal(np.logaddexp2.identity, -np.inf)
+        assert_equal(np.logaddexp2.reduce([]), -np.inf)
+        assert_equal(np.logaddexp2.reduce([-np.inf]), -np.inf)
+        assert_equal(np.logaddexp2.reduce([-np.inf, 0]), 0)
+
+
+class TestLog:
+    def test_log_values(self):
+        x = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024]
+        y = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+        for dt in ['f', 'd', 'g']:
+            log2_ = 0.69314718055994530943
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)*log2_
+            assert_almost_equal(np.log(xf), yf)
+
+
+class TestExp:
+    def test_exp_values(self):
+        x = [1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024]
+        y = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
+        for dt in ['f', 'd', 'g']:
+            log2_ = 0.69314718055994530943
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)*log2_
+            assert_almost_equal(np.exp(yf), xf)
+
+    def test_exp_strides(self):
+        np.random.seed(42)
+        strides = np.array([-4,-3,-2,-1,1,2,3,4])
+        sizes = np.arange(2,100)
+        for ii in sizes:
+            x_f64 = np.float64(np.random.uniform(low=0.01, high=709.1,size=ii))
+            y_true = np.exp(x_f64)
+            for jj in strides:
+                assert_array_almost_equal_nulp(np.exp(x_f64[::jj]), y_true[::jj], nulp=2)
+
+class TestSpecialFloats:
+    def test_exp_values(self):
+        x = [np.nan,  np.nan, np.inf, 0.]
+        y = [np.nan, -np.nan, np.inf, -np.inf]
+        for dt in ['f', 'd', 'g']:
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)
+            assert_equal(np.exp(yf), xf)
+
+        with np.errstate(over='raise'):
+            assert_raises(FloatingPointError, np.exp, np.float32(100.))
+            assert_raises(FloatingPointError, np.exp, np.float32(1E19))
+            assert_raises(FloatingPointError, np.exp, np.float64(800.))
+            assert_raises(FloatingPointError, np.exp, np.float64(1E19))
+
+    def test_log_values(self):
+        with np.errstate(all='ignore'):
+            x = [np.nan,  np.nan, np.inf, np.nan, -np.inf, np.nan]
+            y = [np.nan, -np.nan, np.inf, -np.inf, 0., -1.0]
+            for dt in ['f', 'd', 'g']:
+                xf = np.array(x, dtype=dt)
+                yf = np.array(y, dtype=dt)
+                assert_equal(np.log(yf), xf)
+
+        with np.errstate(divide='raise'):
+            assert_raises(FloatingPointError, np.log, np.float32(0.))
+
+        with np.errstate(invalid='raise'):
+            assert_raises(FloatingPointError, np.log, np.float32(-np.inf))
+            assert_raises(FloatingPointError, np.log, np.float32(-1.0))
+
+    def test_sincos_values(self):
+        with np.errstate(all='ignore'):
+            x = [np.nan,  np.nan, np.nan, np.nan]
+            y = [np.nan, -np.nan, np.inf, -np.inf]
+            for dt in ['f', 'd', 'g']:
+                xf = np.array(x, dtype=dt)
+                yf = np.array(y, dtype=dt)
+                assert_equal(np.sin(yf), xf)
+                assert_equal(np.cos(yf), xf)
+
+        with np.errstate(invalid='raise'):
+            assert_raises(FloatingPointError, np.sin, np.float32(-np.inf))
+            assert_raises(FloatingPointError, np.sin, np.float32(np.inf))
+            assert_raises(FloatingPointError, np.cos, np.float32(-np.inf))
+            assert_raises(FloatingPointError, np.cos, np.float32(np.inf))
+
+    def test_sqrt_values(self):
+        with np.errstate(all='ignore'):
+            x = [np.nan,  np.nan, np.inf, np.nan, 0.]
+            y = [np.nan, -np.nan, np.inf, -np.inf, 0.]
+            for dt in ['f', 'd', 'g']:
+                xf = np.array(x, dtype=dt)
+                yf = np.array(y, dtype=dt)
+                assert_equal(np.sqrt(yf), xf)
+
+        #with np.errstate(invalid='raise'):
+        #    for dt in ['f', 'd', 'g']:
+        #        assert_raises(FloatingPointError, np.sqrt, np.array(-100., dtype=dt))
+
+    def test_abs_values(self):
+        x = [np.nan,  np.nan, np.inf, np.inf, 0., 0., 1.0, 1.0]
+        y = [np.nan, -np.nan, np.inf, -np.inf, 0., -0., -1.0, 1.0]
+        for dt in ['f', 'd', 'g']:
+            xf = np.array(x, dtype=dt)
+            yf = np.array(y, dtype=dt)
+            assert_equal(np.abs(yf), xf)
+
+    def test_square_values(self):
+        x = [np.nan,  np.nan, np.inf, np.inf]
+        y = [np.nan, -np.nan, np.inf, -np.inf]
+        with np.errstate(all='ignore'):
+            for dt in ['f', 'd', 'g']:
+                xf = np.array(x, dtype=dt)
+                yf = np.array(y, dtype=dt)
+                assert_equal(np.square(yf), xf)
+
+        with np.errstate(over='raise'):
+            assert_raises(FloatingPointError, np.square, np.array(1E32,  dtype='f'))
+            assert_raises(FloatingPointError, np.square, np.array(1E200, dtype='d'))
+
+    def test_reciprocal_values(self):
+        with np.errstate(all='ignore'):
+            x = [np.nan,  np.nan, 0.0, -0.0, np.inf, -np.inf]
+            y = [np.nan, -np.nan, np.inf, -np.inf, 0., -0.]
+            for dt in ['f', 'd', 'g']:
+                xf = np.array(x, dtype=dt)
+                yf = np.array(y, dtype=dt)
+                assert_equal(np.reciprocal(yf), xf)
+
+        with np.errstate(divide='raise'):
+            for dt in ['f', 'd', 'g']:
+                assert_raises(FloatingPointError, np.reciprocal, np.array(-0.0, dtype=dt))
+
+# func : [maxulperror, low, high]
+avx_ufuncs = {'sqrt'        :[1,  0.,   100.],
+              'absolute'    :[0, -100., 100.],
+              'reciprocal'  :[1,  1.,   100.],
+              'square'      :[1, -100., 100.],
+              'rint'        :[0, -100., 100.],
+              'floor'       :[0, -100., 100.],
+              'ceil'        :[0, -100., 100.],
+              'trunc'       :[0, -100., 100.]}
+
+class TestAVXUfuncs:
+    def test_avx_based_ufunc(self):
+        strides = np.array([-4,-3,-2,-1,1,2,3,4])
+        np.random.seed(42)
+        for func, prop in avx_ufuncs.items():
+            maxulperr = prop[0]
+            minval = prop[1]
+            maxval = prop[2]
+            # various array sizes to ensure masking in AVX is tested
+            for size in range(1,32):
+                myfunc = getattr(np, func)
+                x_f32 = np.float32(np.random.uniform(low=minval, high=maxval,
+                    size=size))
+                x_f64 = np.float64(x_f32)
+                x_f128 = np.longdouble(x_f32)
+                y_true128 = myfunc(x_f128)
+                if maxulperr == 0:
+                    assert_equal(myfunc(x_f32), np.float32(y_true128))
+                    assert_equal(myfunc(x_f64), np.float64(y_true128))
+                else:
+                    assert_array_max_ulp(myfunc(x_f32), np.float32(y_true128),
+                            maxulp=maxulperr)
+                    assert_array_max_ulp(myfunc(x_f64), np.float64(y_true128),
+                            maxulp=maxulperr)
+                # various strides to test gather instruction
+                if size > 1:
+                    y_true32 = myfunc(x_f32)
+                    y_true64 = myfunc(x_f64)
+                    for jj in strides:
+                        assert_equal(myfunc(x_f64[::jj]), y_true64[::jj])
+                        assert_equal(myfunc(x_f32[::jj]), y_true32[::jj])
+
+class TestAVXFloat32Transcendental:
+    def test_exp_float32(self):
+        np.random.seed(42)
+        x_f32 = np.float32(np.random.uniform(low=0.0,high=88.1,size=1000000))
+        x_f64 = np.float64(x_f32)
+        assert_array_max_ulp(np.exp(x_f32), np.float32(np.exp(x_f64)), maxulp=3)
+
+    def test_log_float32(self):
+        np.random.seed(42)
+        x_f32 = np.float32(np.random.uniform(low=0.0,high=1000,size=1000000))
+        x_f64 = np.float64(x_f32)
+        assert_array_max_ulp(np.log(x_f32), np.float32(np.log(x_f64)), maxulp=4)
+
+    def test_sincos_float32(self):
+        np.random.seed(42)
+        N = 1000000
+        M = np.int_(N/20)
+        index = np.random.randint(low=0, high=N, size=M)
+        x_f32 = np.float32(np.random.uniform(low=-100.,high=100.,size=N))
+        # test coverage for elements > 117435.992f for which glibc is used
+        x_f32[index] = np.float32(10E+10*np.random.rand(M))
+        x_f64 = np.float64(x_f32)
+        assert_array_max_ulp(np.sin(x_f32), np.float32(np.sin(x_f64)), maxulp=2)
+        assert_array_max_ulp(np.cos(x_f32), np.float32(np.cos(x_f64)), maxulp=2)
+
+    def test_strided_float32(self):
+        np.random.seed(42)
+        strides = np.array([-4,-3,-2,-1,1,2,3,4])
+        sizes = np.arange(2,100)
+        for ii in sizes:
+            x_f32 = np.float32(np.random.uniform(low=0.01,high=88.1,size=ii))
+            x_f32_large = x_f32.copy()
+            x_f32_large[3:-1:4] = 120000.0
+            exp_true = np.exp(x_f32)
+            log_true = np.log(x_f32)
+            sin_true = np.sin(x_f32_large)
+            cos_true = np.cos(x_f32_large)
+            for jj in strides:
+                assert_array_almost_equal_nulp(np.exp(x_f32[::jj]), exp_true[::jj], nulp=2)
+                assert_array_almost_equal_nulp(np.log(x_f32[::jj]), log_true[::jj], nulp=2)
+                assert_array_almost_equal_nulp(np.sin(x_f32_large[::jj]), sin_true[::jj], nulp=2)
+                assert_array_almost_equal_nulp(np.cos(x_f32_large[::jj]), cos_true[::jj], nulp=2)
+
+class TestLogAddExp(_FilterInvalids):
+    def test_logaddexp_values(self):
+        x = [1, 2, 3, 4, 5]
+        y = [5, 4, 3, 2, 1]
+        z = [6, 6, 6, 6, 6]
+        for dt, dec_ in zip(['f', 'd', 'g'], [6, 15, 15]):
+            xf = np.log(np.array(x, dtype=dt))
+            yf = np.log(np.array(y, dtype=dt))
+            zf = np.log(np.array(z, dtype=dt))
+            assert_almost_equal(np.logaddexp(xf, yf), zf, decimal=dec_)
+
+    def test_logaddexp_range(self):
+        x = [1000000, -1000000, 1000200, -1000200]
+        y = [1000200, -1000200, 1000000, -1000000]
+        z = [1000200, -1000000, 1000200, -1000000]
+        for dt in ['f', 'd', 'g']:
+            logxf = np.array(x, dtype=dt)
+            logyf = np.array(y, dtype=dt)
+            logzf = np.array(z, dtype=dt)
+            assert_almost_equal(np.logaddexp(logxf, logyf), logzf)
+
+    def test_inf(self):
+        inf = np.inf
+        x = [inf, -inf,  inf, -inf, inf, 1,  -inf,  1]
+        y = [inf,  inf, -inf, -inf, 1,   inf, 1,   -inf]
+        z = [inf,  inf,  inf, -inf, inf, inf, 1,    1]
+        with np.errstate(invalid='raise'):
+            for dt in ['f', 'd', 'g']:
+                logxf = np.array(x, dtype=dt)
+                logyf = np.array(y, dtype=dt)
+                logzf = np.array(z, dtype=dt)
+                assert_equal(np.logaddexp(logxf, logyf), logzf)
+
+    def test_nan(self):
+        assert_(np.isnan(np.logaddexp(np.nan, np.inf)))
+        assert_(np.isnan(np.logaddexp(np.inf, np.nan)))
+        assert_(np.isnan(np.logaddexp(np.nan, 0)))
+        assert_(np.isnan(np.logaddexp(0, np.nan)))
+        assert_(np.isnan(np.logaddexp(np.nan, np.nan)))
+
+    def test_reduce(self):
+        assert_equal(np.logaddexp.identity, -np.inf)
+        assert_equal(np.logaddexp.reduce([]), -np.inf)
+
+
+class TestLog1p:
+    def test_log1p(self):
+        assert_almost_equal(ncu.log1p(0.2), ncu.log(1.2))
+        assert_almost_equal(ncu.log1p(1e-6), ncu.log(1+1e-6))
+
+    def test_special(self):
+        with np.errstate(invalid="ignore", divide="ignore"):
+            assert_equal(ncu.log1p(np.nan), np.nan)
+            assert_equal(ncu.log1p(np.inf), np.inf)
+            assert_equal(ncu.log1p(-1.), -np.inf)
+            assert_equal(ncu.log1p(-2.), np.nan)
+            assert_equal(ncu.log1p(-np.inf), np.nan)
+
+
+class TestExpm1:
+    def test_expm1(self):
+        assert_almost_equal(ncu.expm1(0.2), ncu.exp(0.2)-1)
+        assert_almost_equal(ncu.expm1(1e-6), ncu.exp(1e-6)-1)
+
+    def test_special(self):
+        assert_equal(ncu.expm1(np.inf), np.inf)
+        assert_equal(ncu.expm1(0.), 0.)
+        assert_equal(ncu.expm1(-0.), -0.)
+        assert_equal(ncu.expm1(np.inf), np.inf)
+        assert_equal(ncu.expm1(-np.inf), -1.)
+
+    def test_complex(self):
+        x = np.asarray(1e-12)
+        assert_allclose(x, ncu.expm1(x))
+        x = x.astype(np.complex128)
+        assert_allclose(x, ncu.expm1(x))
+
+
+class TestHypot:
+    def test_simple(self):
+        assert_almost_equal(ncu.hypot(1, 1), ncu.sqrt(2))
+        assert_almost_equal(ncu.hypot(0, 0), 0)
+
+    def test_reduce(self):
+        assert_almost_equal(ncu.hypot.reduce([3.0, 4.0]), 5.0)
+        assert_almost_equal(ncu.hypot.reduce([3.0, 4.0, 0]), 5.0)
+        assert_almost_equal(ncu.hypot.reduce([9.0, 12.0, 20.0]), 25.0)
+        assert_equal(ncu.hypot.reduce([]), 0.0)
+
+
+def assert_hypot_isnan(x, y):
+    with np.errstate(invalid='ignore'):
+        assert_(np.isnan(ncu.hypot(x, y)),
+                "hypot(%s, %s) is %s, not nan" % (x, y, ncu.hypot(x, y)))
+
+
+def assert_hypot_isinf(x, y):
+    with np.errstate(invalid='ignore'):
+        assert_(np.isinf(ncu.hypot(x, y)),
+                "hypot(%s, %s) is %s, not inf" % (x, y, ncu.hypot(x, y)))
+
+
+class TestHypotSpecialValues:
+    def test_nan_outputs(self):
+        assert_hypot_isnan(np.nan, np.nan)
+        assert_hypot_isnan(np.nan, 1)
+
+    def test_nan_outputs2(self):
+        assert_hypot_isinf(np.nan, np.inf)
+        assert_hypot_isinf(np.inf, np.nan)
+        assert_hypot_isinf(np.inf, 0)
+        assert_hypot_isinf(0, np.inf)
+        assert_hypot_isinf(np.inf, np.inf)
+        assert_hypot_isinf(np.inf, 23.0)
+
+    def test_no_fpe(self):
+        assert_no_warnings(ncu.hypot, np.inf, 0)
+
+
+def assert_arctan2_isnan(x, y):
+    assert_(np.isnan(ncu.arctan2(x, y)), "arctan(%s, %s) is %s, not nan" % (x, y, ncu.arctan2(x, y)))
+
+
+def assert_arctan2_ispinf(x, y):
+    assert_((np.isinf(ncu.arctan2(x, y)) and ncu.arctan2(x, y) > 0), "arctan(%s, %s) is %s, not +inf" % (x, y, ncu.arctan2(x, y)))
+
+
+def assert_arctan2_isninf(x, y):
+    assert_((np.isinf(ncu.arctan2(x, y)) and ncu.arctan2(x, y) < 0), "arctan(%s, %s) is %s, not -inf" % (x, y, ncu.arctan2(x, y)))
+
+
+def assert_arctan2_ispzero(x, y):
+    assert_((ncu.arctan2(x, y) == 0 and not np.signbit(ncu.arctan2(x, y))), "arctan(%s, %s) is %s, not +0" % (x, y, ncu.arctan2(x, y)))
+
+
+def assert_arctan2_isnzero(x, y):
+    assert_((ncu.arctan2(x, y) == 0 and np.signbit(ncu.arctan2(x, y))), "arctan(%s, %s) is %s, not -0" % (x, y, ncu.arctan2(x, y)))
+
+
+class TestArctan2SpecialValues:
+    def test_one_one(self):
+        # atan2(1, 1) returns pi/4.
+        assert_almost_equal(ncu.arctan2(1, 1), 0.25 * np.pi)
+        assert_almost_equal(ncu.arctan2(-1, 1), -0.25 * np.pi)
+        assert_almost_equal(ncu.arctan2(1, -1), 0.75 * np.pi)
+
+    def test_zero_nzero(self):
+        # atan2(+-0, -0) returns +-pi.
+        assert_almost_equal(ncu.arctan2(np.PZERO, np.NZERO), np.pi)
+        assert_almost_equal(ncu.arctan2(np.NZERO, np.NZERO), -np.pi)
+
+    def test_zero_pzero(self):
+        # atan2(+-0, +0) returns +-0.
+        assert_arctan2_ispzero(np.PZERO, np.PZERO)
+        assert_arctan2_isnzero(np.NZERO, np.PZERO)
+
+    def test_zero_negative(self):
+        # atan2(+-0, x) returns +-pi for x < 0.
+        assert_almost_equal(ncu.arctan2(np.PZERO, -1), np.pi)
+        assert_almost_equal(ncu.arctan2(np.NZERO, -1), -np.pi)
+
+    def test_zero_positive(self):
+        # atan2(+-0, x) returns +-0 for x > 0.
+        assert_arctan2_ispzero(np.PZERO, 1)
+        assert_arctan2_isnzero(np.NZERO, 1)
+
+    def test_positive_zero(self):
+        # atan2(y, +-0) returns +pi/2 for y > 0.
+        assert_almost_equal(ncu.arctan2(1, np.PZERO), 0.5 * np.pi)
+        assert_almost_equal(ncu.arctan2(1, np.NZERO), 0.5 * np.pi)
+
+    def test_negative_zero(self):
+        # atan2(y, +-0) returns -pi/2 for y < 0.
+        assert_almost_equal(ncu.arctan2(-1, np.PZERO), -0.5 * np.pi)
+        assert_almost_equal(ncu.arctan2(-1, np.NZERO), -0.5 * np.pi)
+
+    def test_any_ninf(self):
+        # atan2(+-y, -infinity) returns +-pi for finite y > 0.
+        assert_almost_equal(ncu.arctan2(1, np.NINF),  np.pi)
+        assert_almost_equal(ncu.arctan2(-1, np.NINF), -np.pi)
+
+    def test_any_pinf(self):
+        # atan2(+-y, +infinity) returns +-0 for finite y > 0.
+        assert_arctan2_ispzero(1, np.inf)
+        assert_arctan2_isnzero(-1, np.inf)
+
+    def test_inf_any(self):
+        # atan2(+-infinity, x) returns +-pi/2 for finite x.
+        assert_almost_equal(ncu.arctan2( np.inf, 1),  0.5 * np.pi)
+        assert_almost_equal(ncu.arctan2(-np.inf, 1), -0.5 * np.pi)
+
+    def test_inf_ninf(self):
+        # atan2(+-infinity, -infinity) returns +-3*pi/4.
+        assert_almost_equal(ncu.arctan2( np.inf, -np.inf),  0.75 * np.pi)
+        assert_almost_equal(ncu.arctan2(-np.inf, -np.inf), -0.75 * np.pi)
+
+    def test_inf_pinf(self):
+        # atan2(+-infinity, +infinity) returns +-pi/4.
+        assert_almost_equal(ncu.arctan2( np.inf, np.inf),  0.25 * np.pi)
+        assert_almost_equal(ncu.arctan2(-np.inf, np.inf), -0.25 * np.pi)
+
+    def test_nan_any(self):
+        # atan2(nan, x) returns nan for any x, including inf
+        assert_arctan2_isnan(np.nan, np.inf)
+        assert_arctan2_isnan(np.inf, np.nan)
+        assert_arctan2_isnan(np.nan, np.nan)
+
+
+class TestLdexp:
+    def _check_ldexp(self, tp):
+        assert_almost_equal(ncu.ldexp(np.array(2., np.float32),
+                                      np.array(3, tp)), 16.)
+        assert_almost_equal(ncu.ldexp(np.array(2., np.float64),
+                                      np.array(3, tp)), 16.)
+        assert_almost_equal(ncu.ldexp(np.array(2., np.longdouble),
+                                      np.array(3, tp)), 16.)
+
+    def test_ldexp(self):
+        # The default Python int type should work
+        assert_almost_equal(ncu.ldexp(2., 3),  16.)
+        # The following int types should all be accepted
+        self._check_ldexp(np.int8)
+        self._check_ldexp(np.int16)
+        self._check_ldexp(np.int32)
+        self._check_ldexp('i')
+        self._check_ldexp('l')
+
+    def test_ldexp_overflow(self):
+        # silence warning emitted on overflow
+        with np.errstate(over="ignore"):
+            imax = np.iinfo(np.dtype('l')).max
+            imin = np.iinfo(np.dtype('l')).min
+            assert_equal(ncu.ldexp(2., imax), np.inf)
+            assert_equal(ncu.ldexp(2., imin), 0)
+
+
+class TestMaximum(_FilterInvalids):
+    def test_reduce(self):
+        dflt = np.typecodes['AllFloat']
+        dint = np.typecodes['AllInteger']
+        seq1 = np.arange(11)
+        seq2 = seq1[::-1]
+        func = np.maximum.reduce
+        for dt in dint:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 10)
+            assert_equal(func(tmp2), 10)
+        for dt in dflt:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 10)
+            assert_equal(func(tmp2), 10)
+            tmp1[::2] = np.nan
+            tmp2[::2] = np.nan
+            assert_equal(func(tmp1), np.nan)
+            assert_equal(func(tmp2), np.nan)
+
+    def test_reduce_complex(self):
+        assert_equal(np.maximum.reduce([1, 2j]), 1)
+        assert_equal(np.maximum.reduce([1+3j, 2j]), 1+3j)
+
+    def test_float_nans(self):
+        nan = np.nan
+        arg1 = np.array([0,   nan, nan])
+        arg2 = np.array([nan, 0,   nan])
+        out = np.array([nan, nan, nan])
+        assert_equal(np.maximum(arg1, arg2), out)
+
+    def test_object_nans(self):
+        # Multiple checks to give this a chance to
+        # fail if cmp is used instead of rich compare.
+        # Failure cannot be guaranteed.
+        for i in range(1):
+            x = np.array(float('nan'), object)
+            y = 1.0
+            z = np.array(float('nan'), object)
+            assert_(np.maximum(x, y) == 1.0)
+            assert_(np.maximum(z, y) == 1.0)
+
+    def test_complex_nans(self):
+        nan = np.nan
+        for cnan in [complex(nan, 0), complex(0, nan), complex(nan, nan)]:
+            arg1 = np.array([0, cnan, cnan], dtype=complex)
+            arg2 = np.array([cnan, 0, cnan], dtype=complex)
+            out = np.array([nan, nan, nan], dtype=complex)
+            assert_equal(np.maximum(arg1, arg2), out)
+
+    def test_object_array(self):
+        arg1 = np.arange(5, dtype=object)
+        arg2 = arg1 + 1
+        assert_equal(np.maximum(arg1, arg2), arg2)
+
+    def test_strided_array(self):
+        arr1 = np.array([-4.0, 1.0, 10.0,  0.0, np.nan, -np.nan, np.inf, -np.inf])
+        arr2 = np.array([-2.0,-1.0, np.nan, 1.0, 0.0,    np.nan, 1.0,    -3.0])
+        maxtrue  = np.array([-2.0, 1.0, np.nan, 1.0, np.nan, np.nan, np.inf, -3.0])
+        out = np.ones(8)
+        out_maxtrue = np.array([-2.0, 1.0, 1.0, 10.0, 1.0, 1.0, np.nan, 1.0])
+        assert_equal(np.maximum(arr1,arr2), maxtrue)
+        assert_equal(np.maximum(arr1[::2],arr2[::2]), maxtrue[::2])
+        assert_equal(np.maximum(arr1[:4:], arr2[::2]), np.array([-2.0, np.nan, 10.0, 1.0]))
+        assert_equal(np.maximum(arr1[::3], arr2[:3:]), np.array([-2.0, 0.0, np.nan]))
+        assert_equal(np.maximum(arr1[:6:2], arr2[::3], out=out[::3]), np.array([-2.0, 10., np.nan]))
+        assert_equal(out, out_maxtrue)
+
+
+class TestMinimum(_FilterInvalids):
+    def test_reduce(self):
+        dflt = np.typecodes['AllFloat']
+        dint = np.typecodes['AllInteger']
+        seq1 = np.arange(11)
+        seq2 = seq1[::-1]
+        func = np.minimum.reduce
+        for dt in dint:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 0)
+            assert_equal(func(tmp2), 0)
+        for dt in dflt:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 0)
+            assert_equal(func(tmp2), 0)
+            tmp1[::2] = np.nan
+            tmp2[::2] = np.nan
+            assert_equal(func(tmp1), np.nan)
+            assert_equal(func(tmp2), np.nan)
+
+    def test_reduce_complex(self):
+        assert_equal(np.minimum.reduce([1, 2j]), 2j)
+        assert_equal(np.minimum.reduce([1+3j, 2j]), 2j)
+
+    def test_float_nans(self):
+        nan = np.nan
+        arg1 = np.array([0,   nan, nan])
+        arg2 = np.array([nan, 0,   nan])
+        out = np.array([nan, nan, nan])
+        assert_equal(np.minimum(arg1, arg2), out)
+
+    def test_object_nans(self):
+        # Multiple checks to give this a chance to
+        # fail if cmp is used instead of rich compare.
+        # Failure cannot be guaranteed.
+        for i in range(1):
+            x = np.array(float('nan'), object)
+            y = 1.0
+            z = np.array(float('nan'), object)
+            assert_(np.minimum(x, y) == 1.0)
+            assert_(np.minimum(z, y) == 1.0)
+
+    def test_complex_nans(self):
+        nan = np.nan
+        for cnan in [complex(nan, 0), complex(0, nan), complex(nan, nan)]:
+            arg1 = np.array([0, cnan, cnan], dtype=complex)
+            arg2 = np.array([cnan, 0, cnan], dtype=complex)
+            out = np.array([nan, nan, nan], dtype=complex)
+            assert_equal(np.minimum(arg1, arg2), out)
+
+    def test_object_array(self):
+        arg1 = np.arange(5, dtype=object)
+        arg2 = arg1 + 1
+        assert_equal(np.minimum(arg1, arg2), arg1)
+
+    def test_strided_array(self):
+        arr1 = np.array([-4.0, 1.0, 10.0,  0.0, np.nan, -np.nan, np.inf, -np.inf])
+        arr2 = np.array([-2.0,-1.0, np.nan, 1.0, 0.0,    np.nan, 1.0,    -3.0])
+        mintrue  = np.array([-4.0, -1.0, np.nan, 0.0, np.nan, np.nan, 1.0, -np.inf])
+        out = np.ones(8)
+        out_mintrue = np.array([-4.0, 1.0, 1.0, 1.0, 1.0, 1.0, np.nan, 1.0])
+        assert_equal(np.minimum(arr1,arr2), mintrue)
+        assert_equal(np.minimum(arr1[::2],arr2[::2]), mintrue[::2])
+        assert_equal(np.minimum(arr1[:4:], arr2[::2]), np.array([-4.0, np.nan, 0.0, 0.0]))
+        assert_equal(np.minimum(arr1[::3], arr2[:3:]), np.array([-4.0, -1.0, np.nan]))
+        assert_equal(np.minimum(arr1[:6:2], arr2[::3], out=out[::3]), np.array([-4.0, 1.0, np.nan]))
+        assert_equal(out, out_mintrue)
+
+class TestFmax(_FilterInvalids):
+    def test_reduce(self):
+        dflt = np.typecodes['AllFloat']
+        dint = np.typecodes['AllInteger']
+        seq1 = np.arange(11)
+        seq2 = seq1[::-1]
+        func = np.fmax.reduce
+        for dt in dint:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 10)
+            assert_equal(func(tmp2), 10)
+        for dt in dflt:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 10)
+            assert_equal(func(tmp2), 10)
+            tmp1[::2] = np.nan
+            tmp2[::2] = np.nan
+            assert_equal(func(tmp1), 9)
+            assert_equal(func(tmp2), 9)
+
+    def test_reduce_complex(self):
+        assert_equal(np.fmax.reduce([1, 2j]), 1)
+        assert_equal(np.fmax.reduce([1+3j, 2j]), 1+3j)
+
+    def test_float_nans(self):
+        nan = np.nan
+        arg1 = np.array([0,   nan, nan])
+        arg2 = np.array([nan, 0,   nan])
+        out = np.array([0,   0,   nan])
+        assert_equal(np.fmax(arg1, arg2), out)
+
+    def test_complex_nans(self):
+        nan = np.nan
+        for cnan in [complex(nan, 0), complex(0, nan), complex(nan, nan)]:
+            arg1 = np.array([0, cnan, cnan], dtype=complex)
+            arg2 = np.array([cnan, 0, cnan], dtype=complex)
+            out = np.array([0,    0, nan], dtype=complex)
+            assert_equal(np.fmax(arg1, arg2), out)
+
+
+class TestFmin(_FilterInvalids):
+    def test_reduce(self):
+        dflt = np.typecodes['AllFloat']
+        dint = np.typecodes['AllInteger']
+        seq1 = np.arange(11)
+        seq2 = seq1[::-1]
+        func = np.fmin.reduce
+        for dt in dint:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 0)
+            assert_equal(func(tmp2), 0)
+        for dt in dflt:
+            tmp1 = seq1.astype(dt)
+            tmp2 = seq2.astype(dt)
+            assert_equal(func(tmp1), 0)
+            assert_equal(func(tmp2), 0)
+            tmp1[::2] = np.nan
+            tmp2[::2] = np.nan
+            assert_equal(func(tmp1), 1)
+            assert_equal(func(tmp2), 1)
+
+    def test_reduce_complex(self):
+        assert_equal(np.fmin.reduce([1, 2j]), 2j)
+        assert_equal(np.fmin.reduce([1+3j, 2j]), 2j)
+
+    def test_float_nans(self):
+        nan = np.nan
+        arg1 = np.array([0,   nan, nan])
+        arg2 = np.array([nan, 0,   nan])
+        out = np.array([0,   0,   nan])
+        assert_equal(np.fmin(arg1, arg2), out)
+
+    def test_complex_nans(self):
+        nan = np.nan
+        for cnan in [complex(nan, 0), complex(0, nan), complex(nan, nan)]:
+            arg1 = np.array([0, cnan, cnan], dtype=complex)
+            arg2 = np.array([cnan, 0, cnan], dtype=complex)
+            out = np.array([0,    0, nan], dtype=complex)
+            assert_equal(np.fmin(arg1, arg2), out)
+
+
+class TestBool:
+    def test_exceptions(self):
+        a = np.ones(1, dtype=np.bool_)
+        assert_raises(TypeError, np.negative, a)
+        assert_raises(TypeError, np.positive, a)
+        assert_raises(TypeError, np.subtract, a, a)
+
+    def test_truth_table_logical(self):
+        # 2, 3 and 4 serves as true values
+        input1 = [0, 0, 3, 2]
+        input2 = [0, 4, 0, 2]
+
+        typecodes = (np.typecodes['AllFloat']
+                     + np.typecodes['AllInteger']
+                     + '?')     # boolean
+        for dtype in map(np.dtype, typecodes):
+            arg1 = np.asarray(input1, dtype=dtype)
+            arg2 = np.asarray(input2, dtype=dtype)
+
+            # OR
+            out = [False, True, True, True]
+            for func in (np.logical_or, np.maximum):
+                assert_equal(func(arg1, arg2).astype(bool), out)
+            # AND
+            out = [False, False, False, True]
+            for func in (np.logical_and, np.minimum):
+                assert_equal(func(arg1, arg2).astype(bool), out)
+            # XOR
+            out = [False, True, True, False]
+            for func in (np.logical_xor, np.not_equal):
+                assert_equal(func(arg1, arg2).astype(bool), out)
+
+    def test_truth_table_bitwise(self):
+        arg1 = [False, False, True, True]
+        arg2 = [False, True, False, True]
+
+        out = [False, True, True, True]
+        assert_equal(np.bitwise_or(arg1, arg2), out)
+
+        out = [False, False, False, True]
+        assert_equal(np.bitwise_and(arg1, arg2), out)
+
+        out = [False, True, True, False]
+        assert_equal(np.bitwise_xor(arg1, arg2), out)
+
+    def test_reduce(self):
+        none = np.array([0, 0, 0, 0], bool)
+        some = np.array([1, 0, 1, 1], bool)
+        every = np.array([1, 1, 1, 1], bool)
+        empty = np.array([], bool)
+
+        arrs = [none, some, every, empty]
+
+        for arr in arrs:
+            assert_equal(np.logical_and.reduce(arr), all(arr))
+
+        for arr in arrs:
+            assert_equal(np.logical_or.reduce(arr), any(arr))
+
+        for arr in arrs:
+            assert_equal(np.logical_xor.reduce(arr), arr.sum() % 2 == 1)
+
+
+class TestBitwiseUFuncs:
+
+    bitwise_types = [np.dtype(c) for c in '?' + 'bBhHiIlLqQ' + 'O']
+
+    def test_values(self):
+        for dt in self.bitwise_types:
+            zeros = np.array([0], dtype=dt)
+            ones = np.array([-1], dtype=dt)
+            msg = "dt = '%s'" % dt.char
+
+            assert_equal(np.bitwise_not(zeros), ones, err_msg=msg)
+            assert_equal(np.bitwise_not(ones), zeros, err_msg=msg)
+
+            assert_equal(np.bitwise_or(zeros, zeros), zeros, err_msg=msg)
+            assert_equal(np.bitwise_or(zeros, ones), ones, err_msg=msg)
+            assert_equal(np.bitwise_or(ones, zeros), ones, err_msg=msg)
+            assert_equal(np.bitwise_or(ones, ones), ones, err_msg=msg)
+
+            assert_equal(np.bitwise_xor(zeros, zeros), zeros, err_msg=msg)
+            assert_equal(np.bitwise_xor(zeros, ones), ones, err_msg=msg)
+            assert_equal(np.bitwise_xor(ones, zeros), ones, err_msg=msg)
+            assert_equal(np.bitwise_xor(ones, ones), zeros, err_msg=msg)
+
+            assert_equal(np.bitwise_and(zeros, zeros), zeros, err_msg=msg)
+            assert_equal(np.bitwise_and(zeros, ones), zeros, err_msg=msg)
+            assert_equal(np.bitwise_and(ones, zeros), zeros, err_msg=msg)
+            assert_equal(np.bitwise_and(ones, ones), ones, err_msg=msg)
+
+    def test_types(self):
+        for dt in self.bitwise_types:
+            zeros = np.array([0], dtype=dt)
+            ones = np.array([-1], dtype=dt)
+            msg = "dt = '%s'" % dt.char
+
+            assert_(np.bitwise_not(zeros).dtype == dt, msg)
+            assert_(np.bitwise_or(zeros, zeros).dtype == dt, msg)
+            assert_(np.bitwise_xor(zeros, zeros).dtype == dt, msg)
+            assert_(np.bitwise_and(zeros, zeros).dtype == dt, msg)
+
+    def test_identity(self):
+        assert_(np.bitwise_or.identity == 0, 'bitwise_or')
+        assert_(np.bitwise_xor.identity == 0, 'bitwise_xor')
+        assert_(np.bitwise_and.identity == -1, 'bitwise_and')
+
+    def test_reduction(self):
+        binary_funcs = (np.bitwise_or, np.bitwise_xor, np.bitwise_and)
+
+        for dt in self.bitwise_types:
+            zeros = np.array([0], dtype=dt)
+            ones = np.array([-1], dtype=dt)
+            for f in binary_funcs:
+                msg = "dt: '%s', f: '%s'" % (dt, f)
+                assert_equal(f.reduce(zeros), zeros, err_msg=msg)
+                assert_equal(f.reduce(ones), ones, err_msg=msg)
+
+        # Test empty reduction, no object dtype
+        for dt in self.bitwise_types[:-1]:
+            # No object array types
+            empty = np.array([], dtype=dt)
+            for f in binary_funcs:
+                msg = "dt: '%s', f: '%s'" % (dt, f)
+                tgt = np.array(f.identity, dtype=dt)
+                res = f.reduce(empty)
+                assert_equal(res, tgt, err_msg=msg)
+                assert_(res.dtype == tgt.dtype, msg)
+
+        # Empty object arrays use the identity.  Note that the types may
+        # differ, the actual type used is determined by the assign_identity
+        # function and is not the same as the type returned by the identity
+        # method.
+        for f in binary_funcs:
+            msg = "dt: '%s'" % (f,)
+            empty = np.array([], dtype=object)
+            tgt = f.identity
+            res = f.reduce(empty)
+            assert_equal(res, tgt, err_msg=msg)
+
+        # Non-empty object arrays do not use the identity
+        for f in binary_funcs:
+            msg = "dt: '%s'" % (f,)
+            btype = np.array([True], dtype=object)
+            assert_(type(f.reduce(btype)) is bool, msg)
+
+
+class TestInt:
+    def test_logical_not(self):
+        x = np.ones(10, dtype=np.int16)
+        o = np.ones(10 * 2, dtype=bool)
+        tgt = o.copy()
+        tgt[::2] = False
+        os = o[::2]
+        assert_array_equal(np.logical_not(x, out=os), False)
+        assert_array_equal(o, tgt)
+
+
+class TestFloatingPoint:
+    def test_floating_point(self):
+        assert_equal(ncu.FLOATING_POINT_SUPPORT, 1)
+
+
+class TestDegrees:
+    def test_degrees(self):
+        assert_almost_equal(ncu.degrees(np.pi), 180.0)
+        assert_almost_equal(ncu.degrees(-0.5*np.pi), -90.0)
+
+
+class TestRadians:
+    def test_radians(self):
+        assert_almost_equal(ncu.radians(180.0), np.pi)
+        assert_almost_equal(ncu.radians(-90.0), -0.5*np.pi)
+
+
+class TestHeavside:
+    def test_heaviside(self):
+        x = np.array([[-30.0, -0.1, 0.0, 0.2], [7.5, np.nan, np.inf, -np.inf]])
+        expectedhalf = np.array([[0.0, 0.0, 0.5, 1.0], [1.0, np.nan, 1.0, 0.0]])
+        expected1 = expectedhalf.copy()
+        expected1[0, 2] = 1
+
+        h = ncu.heaviside(x, 0.5)
+        assert_equal(h, expectedhalf)
+
+        h = ncu.heaviside(x, 1.0)
+        assert_equal(h, expected1)
+
+        x = x.astype(np.float32)
+
+        h = ncu.heaviside(x, np.float32(0.5))
+        assert_equal(h, expectedhalf.astype(np.float32))
+
+        h = ncu.heaviside(x, np.float32(1.0))
+        assert_equal(h, expected1.astype(np.float32))
+
+
+class TestSign:
+    def test_sign(self):
+        a = np.array([np.inf, -np.inf, np.nan, 0.0, 3.0, -3.0])
+        out = np.zeros(a.shape)
+        tgt = np.array([1., -1., np.nan, 0.0, 1.0, -1.0])
+
+        with np.errstate(invalid='ignore'):
+            res = ncu.sign(a)
+            assert_equal(res, tgt)
+            res = ncu.sign(a, out)
+            assert_equal(res, tgt)
+            assert_equal(out, tgt)
+
+    def test_sign_dtype_object(self):
+        # In reference to github issue #6229
+
+        foo = np.array([-.1, 0, .1])
+        a = np.sign(foo.astype(object))
+        b = np.sign(foo)
+
+        assert_array_equal(a, b)
+
+    def test_sign_dtype_nan_object(self):
+        # In reference to github issue #6229
+        def test_nan():
+            foo = np.array([np.nan])
+            # FIXME: a not used
+            a = np.sign(foo.astype(object))
+
+        assert_raises(TypeError, test_nan)
+
+class TestMinMax:
+    def test_minmax_blocked(self):
+        # simd tests on max/min, test all alignments, slow but important
+        # for 2 * vz + 2 * (vs - 1) + 1 (unrolled once)
+        for dt, sz in [(np.float32, 15), (np.float64, 7)]:
+            for out, inp, msg in _gen_alignment_data(dtype=dt, type='unary',
+                                                     max_size=sz):
+                for i in range(inp.size):
+                    inp[:] = np.arange(inp.size, dtype=dt)
+                    inp[i] = np.nan
+                    emsg = lambda: '%r\n%s' % (inp, msg)
+                    with suppress_warnings() as sup:
+                        sup.filter(RuntimeWarning,
+                                   "invalid value encountered in reduce")
+                        assert_(np.isnan(inp.max()), msg=emsg)
+                        assert_(np.isnan(inp.min()), msg=emsg)
+
+                    inp[i] = 1e10
+                    assert_equal(inp.max(), 1e10, err_msg=msg)
+                    inp[i] = -1e10
+                    assert_equal(inp.min(), -1e10, err_msg=msg)
+
+    def test_lower_align(self):
+        # check data that is not aligned to element size
+        # i.e doubles are aligned to 4 bytes on i386
+        d = np.zeros(23 * 8, dtype=np.int8)[4:-4].view(np.float64)
+        assert_equal(d.max(), d[0])
+        assert_equal(d.min(), d[0])
+
+    def test_reduce_reorder(self):
+        # gh 10370, 11029 Some compilers reorder the call to npy_getfloatstatus
+        # and put it before the call to an intrisic function that causes
+        # invalid status to be set. Also make sure warnings are not emitted
+        for n in (2, 4, 8, 16, 32):
+            for dt in (np.float32, np.float16, np.complex64):
+                for r in np.diagflat(np.array([np.nan] * n, dtype=dt)):
+                    assert_equal(np.min(r), np.nan)
+
+    def test_minimize_no_warns(self):
+        a = np.minimum(np.nan, 1)
+        assert_equal(a, np.nan)
+
+
+class TestAbsoluteNegative:
+    def test_abs_neg_blocked(self):
+        # simd tests on abs, test all alignments for vz + 2 * (vs - 1) + 1
+        for dt, sz in [(np.float32, 11), (np.float64, 5)]:
+            for out, inp, msg in _gen_alignment_data(dtype=dt, type='unary',
+                                                     max_size=sz):
+                tgt = [ncu.absolute(i) for i in inp]
+                np.absolute(inp, out=out)
+                assert_equal(out, tgt, err_msg=msg)
+                assert_((out >= 0).all())
+
+                tgt = [-1*(i) for i in inp]
+                np.negative(inp, out=out)
+                assert_equal(out, tgt, err_msg=msg)
+
+                for v in [np.nan, -np.inf, np.inf]:
+                    for i in range(inp.size):
+                        d = np.arange(inp.size, dtype=dt)
+                        inp[:] = -d
+                        inp[i] = v
+                        d[i] = -v if v == -np.inf else v
+                        assert_array_equal(np.abs(inp), d, err_msg=msg)
+                        np.abs(inp, out=out)
+                        assert_array_equal(out, d, err_msg=msg)
+
+                        assert_array_equal(-inp, -1*inp, err_msg=msg)
+                        d = -1 * inp
+                        np.negative(inp, out=out)
+                        assert_array_equal(out, d, err_msg=msg)
+
+    def test_lower_align(self):
+        # check data that is not aligned to element size
+        # i.e doubles are aligned to 4 bytes on i386
+        d = np.zeros(23 * 8, dtype=np.int8)[4:-4].view(np.float64)
+        assert_equal(np.abs(d), d)
+        assert_equal(np.negative(d), -d)
+        np.negative(d, out=d)
+        np.negative(np.ones_like(d), out=d)
+        np.abs(d, out=d)
+        np.abs(np.ones_like(d), out=d)
+
+
+class TestPositive:
+    def test_valid(self):
+        valid_dtypes = [int, float, complex, object]
+        for dtype in valid_dtypes:
+            x = np.arange(5, dtype=dtype)
+            result = np.positive(x)
+            assert_equal(x, result, err_msg=str(dtype))
+
+    def test_invalid(self):
+        with assert_raises(TypeError):
+            np.positive(True)
+        with assert_raises(TypeError):
+            np.positive(np.datetime64('2000-01-01'))
+        with assert_raises(TypeError):
+            np.positive(np.array(['foo'], dtype=str))
+        with assert_raises(TypeError):
+            np.positive(np.array(['bar'], dtype=object))
+
+
+class TestSpecialMethods:
+    def test_wrap(self):
+
+        class with_wrap:
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_wrap__(self, arr, context):
+                r = with_wrap()
+                r.arr = arr
+                r.context = context
+                return r
+
+        a = with_wrap()
+        x = ncu.minimum(a, a)
+        assert_equal(x.arr, np.zeros(1))
+        func, args, i = x.context
+        assert_(func is ncu.minimum)
+        assert_equal(len(args), 2)
+        assert_equal(args[0], a)
+        assert_equal(args[1], a)
+        assert_equal(i, 0)
+
+    def test_wrap_and_prepare_out(self):
+        # Calling convention for out should not affect how special methods are
+        # called
+
+        class StoreArrayPrepareWrap(np.ndarray):
+            _wrap_args = None
+            _prepare_args = None
+            def __new__(cls):
+                return np.empty(()).view(cls)
+            def __array_wrap__(self, obj, context):
+                self._wrap_args = context[1]
+                return obj
+            def __array_prepare__(self, obj, context):
+                self._prepare_args = context[1]
+                return obj
+            @property
+            def args(self):
+                # We need to ensure these are fetched at the same time, before
+                # any other ufuncs are called by the assertions
+                return (self._prepare_args, self._wrap_args)
+            def __repr__(self):
+                return "a"  # for short test output
+
+        def do_test(f_call, f_expected):
+            a = StoreArrayPrepareWrap()
+            f_call(a)
+            p, w = a.args
+            expected = f_expected(a)
+            try:
+                assert_equal(p, expected)
+                assert_equal(w, expected)
+            except AssertionError as e:
+                # assert_equal produces truly useless error messages
+                raise AssertionError("\n".join([
+                    "Bad arguments passed in ufunc call",
+                    " expected:              {}".format(expected),
+                    " __array_prepare__ got: {}".format(p),
+                    " __array_wrap__ got:    {}".format(w)
+                ]))
+
+        # method not on the out argument
+        do_test(lambda a: np.add(a, 0),              lambda a: (a, 0))
+        do_test(lambda a: np.add(a, 0, None),        lambda a: (a, 0))
+        do_test(lambda a: np.add(a, 0, out=None),    lambda a: (a, 0))
+        do_test(lambda a: np.add(a, 0, out=(None,)), lambda a: (a, 0))
+
+        # method on the out argument
+        do_test(lambda a: np.add(0, 0, a),           lambda a: (0, 0, a))
+        do_test(lambda a: np.add(0, 0, out=a),       lambda a: (0, 0, a))
+        do_test(lambda a: np.add(0, 0, out=(a,)),    lambda a: (0, 0, a))
+
+    def test_wrap_with_iterable(self):
+        # test fix for bug #1026:
+
+        class with_wrap(np.ndarray):
+            __array_priority__ = 10
+
+            def __new__(cls):
+                return np.asarray(1).view(cls).copy()
+
+            def __array_wrap__(self, arr, context):
+                return arr.view(type(self))
+
+        a = with_wrap()
+        x = ncu.multiply(a, (1, 2, 3))
+        assert_(isinstance(x, with_wrap))
+        assert_array_equal(x, np.array((1, 2, 3)))
+
+    def test_priority_with_scalar(self):
+        # test fix for bug #826:
+
+        class A(np.ndarray):
+            __array_priority__ = 10
+
+            def __new__(cls):
+                return np.asarray(1.0, 'float64').view(cls).copy()
+
+        a = A()
+        x = np.float64(1)*a
+        assert_(isinstance(x, A))
+        assert_array_equal(x, np.array(1))
+
+    def test_old_wrap(self):
+
+        class with_wrap:
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_wrap__(self, arr):
+                r = with_wrap()
+                r.arr = arr
+                return r
+
+        a = with_wrap()
+        x = ncu.minimum(a, a)
+        assert_equal(x.arr, np.zeros(1))
+
+    def test_priority(self):
+
+        class A:
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_wrap__(self, arr, context):
+                r = type(self)()
+                r.arr = arr
+                r.context = context
+                return r
+
+        class B(A):
+            __array_priority__ = 20.
+
+        class C(A):
+            __array_priority__ = 40.
+
+        x = np.zeros(1)
+        a = A()
+        b = B()
+        c = C()
+        f = ncu.minimum
+        assert_(type(f(x, x)) is np.ndarray)
+        assert_(type(f(x, a)) is A)
+        assert_(type(f(x, b)) is B)
+        assert_(type(f(x, c)) is C)
+        assert_(type(f(a, x)) is A)
+        assert_(type(f(b, x)) is B)
+        assert_(type(f(c, x)) is C)
+
+        assert_(type(f(a, a)) is A)
+        assert_(type(f(a, b)) is B)
+        assert_(type(f(b, a)) is B)
+        assert_(type(f(b, b)) is B)
+        assert_(type(f(b, c)) is C)
+        assert_(type(f(c, b)) is C)
+        assert_(type(f(c, c)) is C)
+
+        assert_(type(ncu.exp(a) is A))
+        assert_(type(ncu.exp(b) is B))
+        assert_(type(ncu.exp(c) is C))
+
+    def test_failing_wrap(self):
+
+        class A:
+            def __array__(self):
+                return np.zeros(2)
+
+            def __array_wrap__(self, arr, context):
+                raise RuntimeError
+
+        a = A()
+        assert_raises(RuntimeError, ncu.maximum, a, a)
+        assert_raises(RuntimeError, ncu.maximum.reduce, a)
+
+    def test_failing_out_wrap(self):
+
+        singleton = np.array([1.0])
+
+        class Ok(np.ndarray):
+            def __array_wrap__(self, obj):
+                return singleton
+
+        class Bad(np.ndarray):
+            def __array_wrap__(self, obj):
+                raise RuntimeError
+
+        ok = np.empty(1).view(Ok)
+        bad = np.empty(1).view(Bad)
+        # double-free (segfault) of "ok" if "bad" raises an exception
+        for i in range(10):
+            assert_raises(RuntimeError, ncu.frexp, 1, ok, bad)
+
+    def test_none_wrap(self):
+        # Tests that issue #8507 is resolved. Previously, this would segfault
+
+        class A:
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_wrap__(self, arr, context=None):
+                return None
+
+        a = A()
+        assert_equal(ncu.maximum(a, a), None)
+
+    def test_default_prepare(self):
+
+        class with_wrap:
+            __array_priority__ = 10
+
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_wrap__(self, arr, context):
+                return arr
+
+        a = with_wrap()
+        x = ncu.minimum(a, a)
+        assert_equal(x, np.zeros(1))
+        assert_equal(type(x), np.ndarray)
+
+    def test_prepare(self):
+
+        class with_prepare(np.ndarray):
+            __array_priority__ = 10
+
+            def __array_prepare__(self, arr, context):
+                # make sure we can return a new
+                return np.array(arr).view(type=with_prepare)
+
+        a = np.array(1).view(type=with_prepare)
+        x = np.add(a, a)
+        assert_equal(x, np.array(2))
+        assert_equal(type(x), with_prepare)
+
+    def test_prepare_out(self):
+
+        class with_prepare(np.ndarray):
+            __array_priority__ = 10
+
+            def __array_prepare__(self, arr, context):
+                return np.array(arr).view(type=with_prepare)
+
+        a = np.array([1]).view(type=with_prepare)
+        x = np.add(a, a, a)
+        # Returned array is new, because of the strange
+        # __array_prepare__ above
+        assert_(not np.shares_memory(x, a))
+        assert_equal(x, np.array([2]))
+        assert_equal(type(x), with_prepare)
+
+    def test_failing_prepare(self):
+
+        class A:
+            def __array__(self):
+                return np.zeros(1)
+
+            def __array_prepare__(self, arr, context=None):
+                raise RuntimeError
+
+        a = A()
+        assert_raises(RuntimeError, ncu.maximum, a, a)
+
+    def test_array_too_many_args(self):
+
+        class A(object):
+            def __array__(self, dtype, context):
+                return np.zeros(1)
+
+        a = A()
+        assert_raises_regex(TypeError, '2 required positional', np.sum, a)
+
+    def test_ufunc_override(self):
+        # check override works even with instance with high priority.
+        class A:
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                return self, func, method, inputs, kwargs
+
+        class MyNDArray(np.ndarray):
+            __array_priority__ = 100
+
+        a = A()
+        b = np.array([1]).view(MyNDArray)
+        res0 = np.multiply(a, b)
+        res1 = np.multiply(b, b, out=a)
+
+        # self
+        assert_equal(res0[0], a)
+        assert_equal(res1[0], a)
+        assert_equal(res0[1], np.multiply)
+        assert_equal(res1[1], np.multiply)
+        assert_equal(res0[2], '__call__')
+        assert_equal(res1[2], '__call__')
+        assert_equal(res0[3], (a, b))
+        assert_equal(res1[3], (b, b))
+        assert_equal(res0[4], {})
+        assert_equal(res1[4], {'out': (a,)})
+
+    def test_ufunc_override_mro(self):
+
+        # Some multi arg functions for testing.
+        def tres_mul(a, b, c):
+            return a * b * c
+
+        def quatro_mul(a, b, c, d):
+            return a * b * c * d
+
+        # Make these into ufuncs.
+        three_mul_ufunc = np.frompyfunc(tres_mul, 3, 1)
+        four_mul_ufunc = np.frompyfunc(quatro_mul, 4, 1)
+
+        class A:
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                return "A"
+
+        class ASub(A):
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                return "ASub"
+
+        class B:
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                return "B"
+
+        class C:
+            def __init__(self):
+                self.count = 0
+
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                self.count += 1
+                return NotImplemented
+
+        class CSub(C):
+            def __array_ufunc__(self, func, method, *inputs, **kwargs):
+                self.count += 1
+                return NotImplemented
+
+        a = A()
+        a_sub = ASub()
+        b = B()
+        c = C()
+
+        # Standard
+        res = np.multiply(a, a_sub)
+        assert_equal(res, "ASub")
+        res = np.multiply(a_sub, b)
+        assert_equal(res, "ASub")
+
+        # With 1 NotImplemented
+        res = np.multiply(c, a)
+        assert_equal(res, "A")
+        assert_equal(c.count, 1)
+        # Check our counter works, so we can trust tests below.
+        res = np.multiply(c, a)
+        assert_equal(c.count, 2)
+
+        # Both NotImplemented.
+        c = C()
+        c_sub = CSub()
+        assert_raises(TypeError, np.multiply, c, c_sub)
+        assert_equal(c.count, 1)
+        assert_equal(c_sub.count, 1)
+        c.count = c_sub.count = 0
+        assert_raises(TypeError, np.multiply, c_sub, c)
+        assert_equal(c.count, 1)
+        assert_equal(c_sub.count, 1)
+        c.count = 0
+        assert_raises(TypeError, np.multiply, c, c)
+        assert_equal(c.count, 1)
+        c.count = 0
+        assert_raises(TypeError, np.multiply, 2, c)
+        assert_equal(c.count, 1)
+
+        # Ternary testing.
+        assert_equal(three_mul_ufunc(a, 1, 2), "A")
+        assert_equal(three_mul_ufunc(1, a, 2), "A")
+        assert_equal(three_mul_ufunc(1, 2, a), "A")
+
+        assert_equal(three_mul_ufunc(a, a, 6), "A")
+        assert_equal(three_mul_ufunc(a, 2, a), "A")
+        assert_equal(three_mul_ufunc(a, 2, b), "A")
+        assert_equal(three_mul_ufunc(a, 2, a_sub), "ASub")
+        assert_equal(three_mul_ufunc(a, a_sub, 3), "ASub")
+        c.count = 0
+        assert_equal(three_mul_ufunc(c, a_sub, 3), "ASub")
+        assert_equal(c.count, 1)
+        c.count = 0
+        assert_equal(three_mul_ufunc(1, a_sub, c), "ASub")
+        assert_equal(c.count, 0)
+
+        c.count = 0
+        assert_equal(three_mul_ufunc(a, b, c), "A")
+        assert_equal(c.count, 0)
+        c_sub.count = 0
+        assert_equal(three_mul_ufunc(a, b, c_sub), "A")
+        assert_equal(c_sub.count, 0)
+        assert_equal(three_mul_ufunc(1, 2, b), "B")
+
+        assert_raises(TypeError, three_mul_ufunc, 1, 2, c)
+        assert_raises(TypeError, three_mul_ufunc, c_sub, 2, c)
+        assert_raises(TypeError, three_mul_ufunc, c_sub, 2, 3)
+
+        # Quaternary testing.
+        assert_equal(four_mul_ufunc(a, 1, 2, 3), "A")
+        assert_equal(four_mul_ufunc(1, a, 2, 3), "A")
+        assert_equal(four_mul_ufunc(1, 1, a, 3), "A")
+        assert_equal(four_mul_ufunc(1, 1, 2, a), "A")
+
+        assert_equal(four_mul_ufunc(a, b, 2, 3), "A")
+        assert_equal(four_mul_ufunc(1, a, 2, b), "A")
+        assert_equal(four_mul_ufunc(b, 1, a, 3), "B")
+        assert_equal(four_mul_ufunc(a_sub, 1, 2, a), "ASub")
+        assert_equal(four_mul_ufunc(a, 1, 2, a_sub), "ASub")
+
+        c = C()
+        c_sub = CSub()
+        assert_raises(TypeError, four_mul_ufunc, 1, 2, 3, c)
+        assert_equal(c.count, 1)
+        c.count = 0
+        assert_raises(TypeError, four_mul_ufunc, 1, 2, c_sub, c)
+        assert_equal(c_sub.count, 1)
+        assert_equal(c.count, 1)
+        c2 = C()
+        c.count = c_sub.count = 0
+        assert_raises(TypeError, four_mul_ufunc, 1, c, c_sub, c2)
+        assert_equal(c_sub.count, 1)
+        assert_equal(c.count, 1)
+        assert_equal(c2.count, 0)
+        c.count = c2.count = c_sub.count = 0
+        assert_raises(TypeError, four_mul_ufunc, c2, c, c_sub, c)
+        assert_equal(c_sub.count, 1)
+        assert_equal(c.count, 0)
+        assert_equal(c2.count, 1)
+
+    def test_ufunc_override_methods(self):
+
+        class A:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return self, ufunc, method, inputs, kwargs
+
+        # __call__
+        a = A()
+        res = np.multiply.__call__(1, a, foo='bar', answer=42)
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], '__call__')
+        assert_equal(res[3], (1, a))
+        assert_equal(res[4], {'foo': 'bar', 'answer': 42})
+
+        # __call__, wrong args
+        assert_raises(TypeError, np.multiply, a)
+        assert_raises(TypeError, np.multiply, a, a, a, a)
+        assert_raises(TypeError, np.multiply, a, a, sig='a', signature='a')
+        assert_raises(TypeError, ncu_tests.inner1d, a, a, axis=0, axes=[0, 0])
+
+        # reduce, positional args
+        res = np.multiply.reduce(a, 'axis0', 'dtype0', 'out0', 'keep0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'reduce')
+        assert_equal(res[3], (a,))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'keepdims': 'keep0',
+                              'axis': 'axis0'})
+
+        # reduce, kwargs
+        res = np.multiply.reduce(a, axis='axis0', dtype='dtype0', out='out0',
+                                 keepdims='keep0', initial='init0',
+                                 where='where0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'reduce')
+        assert_equal(res[3], (a,))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'keepdims': 'keep0',
+                              'axis': 'axis0',
+                              'initial': 'init0',
+                              'where': 'where0'})
+
+        # reduce, output equal to None removed, but not other explicit ones,
+        # even if they are at their default value.
+        res = np.multiply.reduce(a, 0, None, None, False)
+        assert_equal(res[4], {'axis': 0, 'dtype': None, 'keepdims': False})
+        res = np.multiply.reduce(a, out=None, axis=0, keepdims=True)
+        assert_equal(res[4], {'axis': 0, 'keepdims': True})
+        res = np.multiply.reduce(a, None, out=(None,), dtype=None)
+        assert_equal(res[4], {'axis': None, 'dtype': None})
+        res = np.multiply.reduce(a, 0, None, None, False, 2, True)
+        assert_equal(res[4], {'axis': 0, 'dtype': None, 'keepdims': False,
+                              'initial': 2, 'where': True})
+        # np._NoValue ignored for initial
+        res = np.multiply.reduce(a, 0, None, None, False,
+                                 np._NoValue, True)
+        assert_equal(res[4], {'axis': 0, 'dtype': None, 'keepdims': False,
+                              'where': True})
+        # None kept for initial, True for where.
+        res = np.multiply.reduce(a, 0, None, None, False, None, True)
+        assert_equal(res[4], {'axis': 0, 'dtype': None, 'keepdims': False,
+                              'initial': None, 'where': True})
+
+        # reduce, wrong args
+        assert_raises(ValueError, np.multiply.reduce, a, out=())
+        assert_raises(ValueError, np.multiply.reduce, a, out=('out0', 'out1'))
+        assert_raises(TypeError, np.multiply.reduce, a, 'axis0', axis='axis0')
+
+        # accumulate, pos args
+        res = np.multiply.accumulate(a, 'axis0', 'dtype0', 'out0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'accumulate')
+        assert_equal(res[3], (a,))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'axis': 'axis0'})
+
+        # accumulate, kwargs
+        res = np.multiply.accumulate(a, axis='axis0', dtype='dtype0',
+                                     out='out0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'accumulate')
+        assert_equal(res[3], (a,))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'axis': 'axis0'})
+
+        # accumulate, output equal to None removed.
+        res = np.multiply.accumulate(a, 0, None, None)
+        assert_equal(res[4], {'axis': 0, 'dtype': None})
+        res = np.multiply.accumulate(a, out=None, axis=0, dtype='dtype1')
+        assert_equal(res[4], {'axis': 0, 'dtype': 'dtype1'})
+        res = np.multiply.accumulate(a, None, out=(None,), dtype=None)
+        assert_equal(res[4], {'axis': None, 'dtype': None})
+
+        # accumulate, wrong args
+        assert_raises(ValueError, np.multiply.accumulate, a, out=())
+        assert_raises(ValueError, np.multiply.accumulate, a,
+                      out=('out0', 'out1'))
+        assert_raises(TypeError, np.multiply.accumulate, a,
+                      'axis0', axis='axis0')
+
+        # reduceat, pos args
+        res = np.multiply.reduceat(a, [4, 2], 'axis0', 'dtype0', 'out0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'reduceat')
+        assert_equal(res[3], (a, [4, 2]))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'axis': 'axis0'})
+
+        # reduceat, kwargs
+        res = np.multiply.reduceat(a, [4, 2], axis='axis0', dtype='dtype0',
+                                   out='out0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'reduceat')
+        assert_equal(res[3], (a, [4, 2]))
+        assert_equal(res[4], {'dtype':'dtype0',
+                              'out': ('out0',),
+                              'axis': 'axis0'})
+
+        # reduceat, output equal to None removed.
+        res = np.multiply.reduceat(a, [4, 2], 0, None, None)
+        assert_equal(res[4], {'axis': 0, 'dtype': None})
+        res = np.multiply.reduceat(a, [4, 2], axis=None, out=None, dtype='dt')
+        assert_equal(res[4], {'axis': None, 'dtype': 'dt'})
+        res = np.multiply.reduceat(a, [4, 2], None, None, out=(None,))
+        assert_equal(res[4], {'axis': None, 'dtype': None})
+
+        # reduceat, wrong args
+        assert_raises(ValueError, np.multiply.reduce, a, [4, 2], out=())
+        assert_raises(ValueError, np.multiply.reduce, a, [4, 2],
+                      out=('out0', 'out1'))
+        assert_raises(TypeError, np.multiply.reduce, a, [4, 2],
+                      'axis0', axis='axis0')
+
+        # outer
+        res = np.multiply.outer(a, 42)
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'outer')
+        assert_equal(res[3], (a, 42))
+        assert_equal(res[4], {})
+
+        # outer, wrong args
+        assert_raises(TypeError, np.multiply.outer, a)
+        assert_raises(TypeError, np.multiply.outer, a, a, a, a)
+        assert_raises(TypeError, np.multiply.outer, a, a, sig='a', signature='a')
+
+        # at
+        res = np.multiply.at(a, [4, 2], 'b0')
+        assert_equal(res[0], a)
+        assert_equal(res[1], np.multiply)
+        assert_equal(res[2], 'at')
+        assert_equal(res[3], (a, [4, 2], 'b0'))
+
+        # at, wrong args
+        assert_raises(TypeError, np.multiply.at, a)
+        assert_raises(TypeError, np.multiply.at, a, a, a, a)
+
+    def test_ufunc_override_out(self):
+
+        class A:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return kwargs
+
+        class B:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return kwargs
+
+        a = A()
+        b = B()
+        res0 = np.multiply(a, b, 'out_arg')
+        res1 = np.multiply(a, b, out='out_arg')
+        res2 = np.multiply(2, b, 'out_arg')
+        res3 = np.multiply(3, b, out='out_arg')
+        res4 = np.multiply(a, 4, 'out_arg')
+        res5 = np.multiply(a, 5, out='out_arg')
+
+        assert_equal(res0['out'][0], 'out_arg')
+        assert_equal(res1['out'][0], 'out_arg')
+        assert_equal(res2['out'][0], 'out_arg')
+        assert_equal(res3['out'][0], 'out_arg')
+        assert_equal(res4['out'][0], 'out_arg')
+        assert_equal(res5['out'][0], 'out_arg')
+
+        # ufuncs with multiple output modf and frexp.
+        res6 = np.modf(a, 'out0', 'out1')
+        res7 = np.frexp(a, 'out0', 'out1')
+        assert_equal(res6['out'][0], 'out0')
+        assert_equal(res6['out'][1], 'out1')
+        assert_equal(res7['out'][0], 'out0')
+        assert_equal(res7['out'][1], 'out1')
+
+        # While we're at it, check that default output is never passed on.
+        assert_(np.sin(a, None) == {})
+        assert_(np.sin(a, out=None) == {})
+        assert_(np.sin(a, out=(None,)) == {})
+        assert_(np.modf(a, None) == {})
+        assert_(np.modf(a, None, None) == {})
+        assert_(np.modf(a, out=(None, None)) == {})
+        with assert_raises(TypeError):
+            # Out argument must be tuple, since there are multiple outputs.
+            np.modf(a, out=None)
+
+        # don't give positional and output argument, or too many arguments.
+        # wrong number of arguments in the tuple is an error too.
+        assert_raises(TypeError, np.multiply, a, b, 'one', out='two')
+        assert_raises(TypeError, np.multiply, a, b, 'one', 'two')
+        assert_raises(ValueError, np.multiply, a, b, out=('one', 'two'))
+        assert_raises(ValueError, np.multiply, a, out=())
+        assert_raises(TypeError, np.modf, a, 'one', out=('two', 'three'))
+        assert_raises(TypeError, np.modf, a, 'one', 'two', 'three')
+        assert_raises(ValueError, np.modf, a, out=('one', 'two', 'three'))
+        assert_raises(ValueError, np.modf, a, out=('one',))
+
+    def test_ufunc_override_exception(self):
+
+        class A:
+            def __array_ufunc__(self, *a, **kwargs):
+                raise ValueError("oops")
+
+        a = A()
+        assert_raises(ValueError, np.negative, 1, out=a)
+        assert_raises(ValueError, np.negative, a)
+        assert_raises(ValueError, np.divide, 1., a)
+
+    def test_ufunc_override_not_implemented(self):
+
+        class A:
+            def __array_ufunc__(self, *args, **kwargs):
+                return NotImplemented
+
+        msg = ("operand type(s) all returned NotImplemented from "
+               "__array_ufunc__(<ufunc 'negative'>, '__call__', <*>): 'A'")
+        with assert_raises_regex(TypeError, fnmatch.translate(msg)):
+            np.negative(A())
+
+        msg = ("operand type(s) all returned NotImplemented from "
+               "__array_ufunc__(<ufunc 'add'>, '__call__', <*>, <object *>, "
+               "out=(1,)): 'A', 'object', 'int'")
+        with assert_raises_regex(TypeError, fnmatch.translate(msg)):
+            np.add(A(), object(), out=1)
+
+    def test_ufunc_override_disabled(self):
+
+        class OptOut:
+            __array_ufunc__ = None
+
+        opt_out = OptOut()
+
+        # ufuncs always raise
+        msg = "operand 'OptOut' does not support ufuncs"
+        with assert_raises_regex(TypeError, msg):
+            np.add(opt_out, 1)
+        with assert_raises_regex(TypeError, msg):
+            np.add(1, opt_out)
+        with assert_raises_regex(TypeError, msg):
+            np.negative(opt_out)
+
+        # opt-outs still hold even when other arguments have pathological
+        # __array_ufunc__ implementations
+
+        class GreedyArray:
+            def __array_ufunc__(self, *args, **kwargs):
+                return self
+
+        greedy = GreedyArray()
+        assert_(np.negative(greedy) is greedy)
+        with assert_raises_regex(TypeError, msg):
+            np.add(greedy, opt_out)
+        with assert_raises_regex(TypeError, msg):
+            np.add(greedy, 1, out=opt_out)
+
+    def test_gufunc_override(self):
+        # gufunc are just ufunc instances, but follow a different path,
+        # so check __array_ufunc__ overrides them properly.
+        class A:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                return self, ufunc, method, inputs, kwargs
+
+        inner1d = ncu_tests.inner1d
+        a = A()
+        res = inner1d(a, a)
+        assert_equal(res[0], a)
+        assert_equal(res[1], inner1d)
+        assert_equal(res[2], '__call__')
+        assert_equal(res[3], (a, a))
+        assert_equal(res[4], {})
+
+        res = inner1d(1, 1, out=a)
+        assert_equal(res[0], a)
+        assert_equal(res[1], inner1d)
+        assert_equal(res[2], '__call__')
+        assert_equal(res[3], (1, 1))
+        assert_equal(res[4], {'out': (a,)})
+
+        # wrong number of arguments in the tuple is an error too.
+        assert_raises(TypeError, inner1d, a, out='two')
+        assert_raises(TypeError, inner1d, a, a, 'one', out='two')
+        assert_raises(TypeError, inner1d, a, a, 'one', 'two')
+        assert_raises(ValueError, inner1d, a, a, out=('one', 'two'))
+        assert_raises(ValueError, inner1d, a, a, out=())
+
+    def test_ufunc_override_with_super(self):
+        # NOTE: this class is given as an example in doc/subclassing.py;
+        # if you make any changes here, do update it there too.
+        class A(np.ndarray):
+            def __array_ufunc__(self, ufunc, method, *inputs, out=None, **kwargs):
+                args = []
+                in_no = []
+                for i, input_ in enumerate(inputs):
+                    if isinstance(input_, A):
+                        in_no.append(i)
+                        args.append(input_.view(np.ndarray))
+                    else:
+                        args.append(input_)
+
+                outputs = out
+                out_no = []
+                if outputs:
+                    out_args = []
+                    for j, output in enumerate(outputs):
+                        if isinstance(output, A):
+                            out_no.append(j)
+                            out_args.append(output.view(np.ndarray))
+                        else:
+                            out_args.append(output)
+                    kwargs['out'] = tuple(out_args)
+                else:
+                    outputs = (None,) * ufunc.nout
+
+                info = {}
+                if in_no:
+                    info['inputs'] = in_no
+                if out_no:
+                    info['outputs'] = out_no
+
+                results = super(A, self).__array_ufunc__(ufunc, method,
+                                                         *args, **kwargs)
+                if results is NotImplemented:
+                    return NotImplemented
+
+                if method == 'at':
+                    if isinstance(inputs[0], A):
+                        inputs[0].info = info
+                    return
+
+                if ufunc.nout == 1:
+                    results = (results,)
+
+                results = tuple((np.asarray(result).view(A)
+                                 if output is None else output)
+                                for result, output in zip(results, outputs))
+                if results and isinstance(results[0], A):
+                    results[0].info = info
+
+                return results[0] if len(results) == 1 else results
+
+        class B:
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                if any(isinstance(input_, A) for input_ in inputs):
+                    return "A!"
+                else:
+                    return NotImplemented
+
+        d = np.arange(5.)
+        # 1 input, 1 output
+        a = np.arange(5.).view(A)
+        b = np.sin(a)
+        check = np.sin(d)
+        assert_(np.all(check == b))
+        assert_equal(b.info, {'inputs': [0]})
+        b = np.sin(d, out=(a,))
+        assert_(np.all(check == b))
+        assert_equal(b.info, {'outputs': [0]})
+        assert_(b is a)
+        a = np.arange(5.).view(A)
+        b = np.sin(a, out=a)
+        assert_(np.all(check == b))
+        assert_equal(b.info, {'inputs': [0], 'outputs': [0]})
+
+        # 1 input, 2 outputs
+        a = np.arange(5.).view(A)
+        b1, b2 = np.modf(a)
+        assert_equal(b1.info, {'inputs': [0]})
+        b1, b2 = np.modf(d, out=(None, a))
+        assert_(b2 is a)
+        assert_equal(b1.info, {'outputs': [1]})
+        a = np.arange(5.).view(A)
+        b = np.arange(5.).view(A)
+        c1, c2 = np.modf(a, out=(a, b))
+        assert_(c1 is a)
+        assert_(c2 is b)
+        assert_equal(c1.info, {'inputs': [0], 'outputs': [0, 1]})
+
+        # 2 input, 1 output
+        a = np.arange(5.).view(A)
+        b = np.arange(5.).view(A)
+        c = np.add(a, b, out=a)
+        assert_(c is a)
+        assert_equal(c.info, {'inputs': [0, 1], 'outputs': [0]})
+        # some tests with a non-ndarray subclass
+        a = np.arange(5.)
+        b = B()
+        assert_(a.__array_ufunc__(np.add, '__call__', a, b) is NotImplemented)
+        assert_(b.__array_ufunc__(np.add, '__call__', a, b) is NotImplemented)
+        assert_raises(TypeError, np.add, a, b)
+        a = a.view(A)
+        assert_(a.__array_ufunc__(np.add, '__call__', a, b) is NotImplemented)
+        assert_(b.__array_ufunc__(np.add, '__call__', a, b) == "A!")
+        assert_(np.add(a, b) == "A!")
+        # regression check for gh-9102 -- tests ufunc.reduce implicitly.
+        d = np.array([[1, 2, 3], [1, 2, 3]])
+        a = d.view(A)
+        c = a.any()
+        check = d.any()
+        assert_equal(c, check)
+        assert_(c.info, {'inputs': [0]})
+        c = a.max()
+        check = d.max()
+        assert_equal(c, check)
+        assert_(c.info, {'inputs': [0]})
+        b = np.array(0).view(A)
+        c = a.max(out=b)
+        assert_equal(c, check)
+        assert_(c is b)
+        assert_(c.info, {'inputs': [0], 'outputs': [0]})
+        check = a.max(axis=0)
+        b = np.zeros_like(check).view(A)
+        c = a.max(axis=0, out=b)
+        assert_equal(c, check)
+        assert_(c is b)
+        assert_(c.info, {'inputs': [0], 'outputs': [0]})
+        # simple explicit tests of reduce, accumulate, reduceat
+        check = np.add.reduce(d, axis=1)
+        c = np.add.reduce(a, axis=1)
+        assert_equal(c, check)
+        assert_(c.info, {'inputs': [0]})
+        b = np.zeros_like(c)
+        c = np.add.reduce(a, 1, None, b)
+        assert_equal(c, check)
+        assert_(c is b)
+        assert_(c.info, {'inputs': [0], 'outputs': [0]})
+        check = np.add.accumulate(d, axis=0)
+        c = np.add.accumulate(a, axis=0)
+        assert_equal(c, check)
+        assert_(c.info, {'inputs': [0]})
+        b = np.zeros_like(c)
+        c = np.add.accumulate(a, 0, None, b)
+        assert_equal(c, check)
+        assert_(c is b)
+        assert_(c.info, {'inputs': [0], 'outputs': [0]})
+        indices = [0, 2, 1]
+        check = np.add.reduceat(d, indices, axis=1)
+        c = np.add.reduceat(a, indices, axis=1)
+        assert_equal(c, check)
+        assert_(c.info, {'inputs': [0]})
+        b = np.zeros_like(c)
+        c = np.add.reduceat(a, indices, 1, None, b)
+        assert_equal(c, check)
+        assert_(c is b)
+        assert_(c.info, {'inputs': [0], 'outputs': [0]})
+        # and a few tests for at
+        d = np.array([[1, 2, 3], [1, 2, 3]])
+        check = d.copy()
+        a = d.copy().view(A)
+        np.add.at(check, ([0, 1], [0, 2]), 1.)
+        np.add.at(a, ([0, 1], [0, 2]), 1.)
+        assert_equal(a, check)
+        assert_(a.info, {'inputs': [0]})
+        b = np.array(1.).view(A)
+        a = d.copy().view(A)
+        np.add.at(a, ([0, 1], [0, 2]), b)
+        assert_equal(a, check)
+        assert_(a.info, {'inputs': [0, 2]})
+
+
+class TestChoose:
+    def test_mixed(self):
+        c = np.array([True, True])
+        a = np.array([True, True])
+        assert_equal(np.choose(c, (a, 1)), np.array([1, 1]))
+
+
+class TestRationalFunctions:
+    def test_lcm(self):
+        self._test_lcm_inner(np.int16)
+        self._test_lcm_inner(np.uint16)
+
+    def test_lcm_object(self):
+        self._test_lcm_inner(np.object_)
+
+    def test_gcd(self):
+        self._test_gcd_inner(np.int16)
+        self._test_lcm_inner(np.uint16)
+
+    def test_gcd_object(self):
+        self._test_gcd_inner(np.object_)
+
+    def _test_lcm_inner(self, dtype):
+        # basic use
+        a = np.array([12, 120], dtype=dtype)
+        b = np.array([20, 200], dtype=dtype)
+        assert_equal(np.lcm(a, b), [60, 600])
+
+        if not issubclass(dtype, np.unsignedinteger):
+            # negatives are ignored
+            a = np.array([12, -12,  12, -12], dtype=dtype)
+            b = np.array([20,  20, -20, -20], dtype=dtype)
+            assert_equal(np.lcm(a, b), [60]*4)
+
+        # reduce
+        a = np.array([3, 12, 20], dtype=dtype)
+        assert_equal(np.lcm.reduce([3, 12, 20]), 60)
+
+        # broadcasting, and a test including 0
+        a = np.arange(6).astype(dtype)
+        b = 20
+        assert_equal(np.lcm(a, b), [0, 20, 20, 60, 20, 20])
+
+    def _test_gcd_inner(self, dtype):
+        # basic use
+        a = np.array([12, 120], dtype=dtype)
+        b = np.array([20, 200], dtype=dtype)
+        assert_equal(np.gcd(a, b), [4, 40])
+
+        if not issubclass(dtype, np.unsignedinteger):
+            # negatives are ignored
+            a = np.array([12, -12,  12, -12], dtype=dtype)
+            b = np.array([20,  20, -20, -20], dtype=dtype)
+            assert_equal(np.gcd(a, b), [4]*4)
+
+        # reduce
+        a = np.array([15, 25, 35], dtype=dtype)
+        assert_equal(np.gcd.reduce(a), 5)
+
+        # broadcasting, and a test including 0
+        a = np.arange(6).astype(dtype)
+        b = 20
+        assert_equal(np.gcd(a, b), [20,  1,  2,  1,  4,  5])
+
+    def test_lcm_overflow(self):
+        # verify that we don't overflow when a*b does overflow
+        big = np.int32(np.iinfo(np.int32).max // 11)
+        a = 2*big
+        b = 5*big
+        assert_equal(np.lcm(a, b), 10*big)
+
+    def test_gcd_overflow(self):
+        for dtype in (np.int32, np.int64):
+            # verify that we don't overflow when taking abs(x)
+            # not relevant for lcm, where the result is unrepresentable anyway
+            a = dtype(np.iinfo(dtype).min)  # negative power of two
+            q = -(a // 4)
+            assert_equal(np.gcd(a,  q*3), q)
+            assert_equal(np.gcd(a, -q*3), q)
+
+    def test_decimal(self):
+        from decimal import Decimal
+        a = np.array([1,  1, -1, -1]) * Decimal('0.20')
+        b = np.array([1, -1,  1, -1]) * Decimal('0.12')
+
+        assert_equal(np.gcd(a, b), 4*[Decimal('0.04')])
+        assert_equal(np.lcm(a, b), 4*[Decimal('0.60')])
+
+    def test_float(self):
+        # not well-defined on float due to rounding errors
+        assert_raises(TypeError, np.gcd, 0.3, 0.4)
+        assert_raises(TypeError, np.lcm, 0.3, 0.4)
+
+    def test_builtin_long(self):
+        # sanity check that array coercion is alright for builtin longs
+        assert_equal(np.array(2**200).item(), 2**200)
+
+        # expressed as prime factors
+        a = np.array(2**100 * 3**5)
+        b = np.array([2**100 * 5**7, 2**50 * 3**10])
+        assert_equal(np.gcd(a, b), [2**100,               2**50 * 3**5])
+        assert_equal(np.lcm(a, b), [2**100 * 3**5 * 5**7, 2**100 * 3**10])
+
+        assert_equal(np.gcd(2**100, 3**100), 1)
+
+
+class TestRoundingFunctions:
+
+    def test_object_direct(self):
+        """ test direct implementation of these magic methods """
+        class C:
+            def __floor__(self):
+                return 1
+            def __ceil__(self):
+                return 2
+            def __trunc__(self):
+                return 3
+
+        arr = np.array([C(), C()])
+        assert_equal(np.floor(arr), [1, 1])
+        assert_equal(np.ceil(arr),  [2, 2])
+        assert_equal(np.trunc(arr), [3, 3])
+
+    def test_object_indirect(self):
+        """ test implementations via __float__ """
+        class C:
+            def __float__(self):
+                return -2.5
+
+        arr = np.array([C(), C()])
+        assert_equal(np.floor(arr), [-3, -3])
+        assert_equal(np.ceil(arr),  [-2, -2])
+        with pytest.raises(TypeError):
+            np.trunc(arr)  # consistent with math.trunc
+
+    def test_fraction(self):
+        f = Fraction(-4, 3)
+        assert_equal(np.floor(f), -2)
+        assert_equal(np.ceil(f), -1)
+        assert_equal(np.trunc(f), -1)
+
+
+class TestComplexFunctions:
+    funcs = [np.arcsin,  np.arccos,  np.arctan, np.arcsinh, np.arccosh,
+             np.arctanh, np.sin,     np.cos,    np.tan,     np.exp,
+             np.exp2,    np.log,     np.sqrt,   np.log10,   np.log2,
+             np.log1p]
+
+    def test_it(self):
+        for f in self.funcs:
+            if f is np.arccosh:
+                x = 1.5
+            else:
+                x = .5
+            fr = f(x)
+            fz = f(complex(x))
+            assert_almost_equal(fz.real, fr, err_msg='real part %s' % f)
+            assert_almost_equal(fz.imag, 0., err_msg='imag part %s' % f)
+
+    def test_precisions_consistent(self):
+        z = 1 + 1j
+        for f in self.funcs:
+            fcf = f(np.csingle(z))
+            fcd = f(np.cdouble(z))
+            fcl = f(np.clongdouble(z))
+            assert_almost_equal(fcf, fcd, decimal=6, err_msg='fch-fcd %s' % f)
+            assert_almost_equal(fcl, fcd, decimal=15, err_msg='fch-fcl %s' % f)
+
+    def test_branch_cuts(self):
+        # check branch cuts and continuity on them
+        _check_branch_cut(np.log,   -0.5, 1j, 1, -1, True)
+        _check_branch_cut(np.log2,  -0.5, 1j, 1, -1, True)
+        _check_branch_cut(np.log10, -0.5, 1j, 1, -1, True)
+        _check_branch_cut(np.log1p, -1.5, 1j, 1, -1, True)
+        _check_branch_cut(np.sqrt,  -0.5, 1j, 1, -1, True)
+
+        _check_branch_cut(np.arcsin, [ -2, 2],   [1j, 1j], 1, -1, True)
+        _check_branch_cut(np.arccos, [ -2, 2],   [1j, 1j], 1, -1, True)
+        _check_branch_cut(np.arctan, [0-2j, 2j],  [1,  1], -1, 1, True)
+
+        _check_branch_cut(np.arcsinh, [0-2j,  2j], [1,   1], -1, 1, True)
+        _check_branch_cut(np.arccosh, [ -1, 0.5], [1j,  1j], 1, -1, True)
+        _check_branch_cut(np.arctanh, [ -2,   2], [1j, 1j], 1, -1, True)
+
+        # check against bogus branch cuts: assert continuity between quadrants
+        _check_branch_cut(np.arcsin, [0-2j, 2j], [ 1,  1], 1, 1)
+        _check_branch_cut(np.arccos, [0-2j, 2j], [ 1,  1], 1, 1)
+        _check_branch_cut(np.arctan, [ -2,  2], [1j, 1j], 1, 1)
+
+        _check_branch_cut(np.arcsinh, [ -2,  2, 0], [1j, 1j, 1], 1, 1)
+        _check_branch_cut(np.arccosh, [0-2j, 2j, 2], [1,  1,  1j], 1, 1)
+        _check_branch_cut(np.arctanh, [0-2j, 2j, 0], [1,  1,  1j], 1, 1)
+
+    def test_branch_cuts_complex64(self):
+        # check branch cuts and continuity on them
+        _check_branch_cut(np.log,   -0.5, 1j, 1, -1, True, np.complex64)
+        _check_branch_cut(np.log2,  -0.5, 1j, 1, -1, True, np.complex64)
+        _check_branch_cut(np.log10, -0.5, 1j, 1, -1, True, np.complex64)
+        _check_branch_cut(np.log1p, -1.5, 1j, 1, -1, True, np.complex64)
+        _check_branch_cut(np.sqrt,  -0.5, 1j, 1, -1, True, np.complex64)
+
+        _check_branch_cut(np.arcsin, [ -2, 2],   [1j, 1j], 1, -1, True, np.complex64)
+        _check_branch_cut(np.arccos, [ -2, 2],   [1j, 1j], 1, -1, True, np.complex64)
+        _check_branch_cut(np.arctan, [0-2j, 2j],  [1,  1], -1, 1, True, np.complex64)
+
+        _check_branch_cut(np.arcsinh, [0-2j,  2j], [1,   1], -1, 1, True, np.complex64)
+        _check_branch_cut(np.arccosh, [ -1, 0.5], [1j,  1j], 1, -1, True, np.complex64)
+        _check_branch_cut(np.arctanh, [ -2,   2], [1j, 1j], 1, -1, True, np.complex64)
+
+        # check against bogus branch cuts: assert continuity between quadrants
+        _check_branch_cut(np.arcsin, [0-2j, 2j], [ 1,  1], 1, 1, False, np.complex64)
+        _check_branch_cut(np.arccos, [0-2j, 2j], [ 1,  1], 1, 1, False, np.complex64)
+        _check_branch_cut(np.arctan, [ -2,  2], [1j, 1j], 1, 1, False, np.complex64)
+
+        _check_branch_cut(np.arcsinh, [ -2,  2, 0], [1j, 1j, 1], 1, 1, False, np.complex64)
+        _check_branch_cut(np.arccosh, [0-2j, 2j, 2], [1,  1,  1j], 1, 1, False, np.complex64)
+        _check_branch_cut(np.arctanh, [0-2j, 2j, 0], [1,  1,  1j], 1, 1, False, np.complex64)
+
+    def test_against_cmath(self):
+        import cmath
+
+        points = [-1-1j, -1+1j, +1-1j, +1+1j]
+        name_map = {'arcsin': 'asin', 'arccos': 'acos', 'arctan': 'atan',
+                    'arcsinh': 'asinh', 'arccosh': 'acosh', 'arctanh': 'atanh'}
+        atol = 4*np.finfo(complex).eps
+        for func in self.funcs:
+            fname = func.__name__.split('.')[-1]
+            cname = name_map.get(fname, fname)
+            try:
+                cfunc = getattr(cmath, cname)
+            except AttributeError:
+                continue
+            for p in points:
+                a = complex(func(np.complex_(p)))
+                b = cfunc(p)
+                assert_(abs(a - b) < atol, "%s %s: %s; cmath: %s" % (fname, p, a, b))
+
+    @pytest.mark.parametrize('dtype', [np.complex64, np.complex_, np.longcomplex])
+    def test_loss_of_precision(self, dtype):
+        """Check loss of precision in complex arc* functions"""
+
+        # Check against known-good functions
+
+        info = np.finfo(dtype)
+        real_dtype = dtype(0.).real.dtype
+        eps = info.eps
+
+        def check(x, rtol):
+            x = x.astype(real_dtype)
+
+            z = x.astype(dtype)
+            d = np.absolute(np.arcsinh(x)/np.arcsinh(z).real - 1)
+            assert_(np.all(d < rtol), (np.argmax(d), x[np.argmax(d)], d.max(),
+                                      'arcsinh'))
+
+            z = (1j*x).astype(dtype)
+            d = np.absolute(np.arcsinh(x)/np.arcsin(z).imag - 1)
+            assert_(np.all(d < rtol), (np.argmax(d), x[np.argmax(d)], d.max(),
+                                      'arcsin'))
+
+            z = x.astype(dtype)
+            d = np.absolute(np.arctanh(x)/np.arctanh(z).real - 1)
+            assert_(np.all(d < rtol), (np.argmax(d), x[np.argmax(d)], d.max(),
+                                      'arctanh'))
+
+            z = (1j*x).astype(dtype)
+            d = np.absolute(np.arctanh(x)/np.arctan(z).imag - 1)
+            assert_(np.all(d < rtol), (np.argmax(d), x[np.argmax(d)], d.max(),
+                                      'arctan'))
+
+        # The switchover was chosen as 1e-3; hence there can be up to
+        # ~eps/1e-3 of relative cancellation error before it
+
+        x_series = np.logspace(-20, -3.001, 200)
+        x_basic = np.logspace(-2.999, 0, 10, endpoint=False)
+
+        if dtype is np.longcomplex:
+            # It's not guaranteed that the system-provided arc functions
+            # are accurate down to a few epsilons. (Eg. on Linux 64-bit)
+            # So, give more leeway for long complex tests here:
+            # Can use 2.1 for > Ubuntu LTS Trusty (2014), glibc = 2.19.
+            if skip_longcomplex_msg:
+                pytest.skip(skip_longcomplex_msg)
+            check(x_series, 50.0*eps)
+        else:
+            check(x_series, 2.1*eps)
+        check(x_basic, 2.0*eps/1e-3)
+
+        # Check a few points
+
+        z = np.array([1e-5*(1+1j)], dtype=dtype)
+        p = 9.999999999333333333e-6 + 1.000000000066666666e-5j
+        d = np.absolute(1-np.arctanh(z)/p)
+        assert_(np.all(d < 1e-15))
+
+        p = 1.0000000000333333333e-5 + 9.999999999666666667e-6j
+        d = np.absolute(1-np.arcsinh(z)/p)
+        assert_(np.all(d < 1e-15))
+
+        p = 9.999999999333333333e-6j + 1.000000000066666666e-5
+        d = np.absolute(1-np.arctan(z)/p)
+        assert_(np.all(d < 1e-15))
+
+        p = 1.0000000000333333333e-5j + 9.999999999666666667e-6
+        d = np.absolute(1-np.arcsin(z)/p)
+        assert_(np.all(d < 1e-15))
+
+        # Check continuity across switchover points
+
+        def check(func, z0, d=1):
+            z0 = np.asarray(z0, dtype=dtype)
+            zp = z0 + abs(z0) * d * eps * 2
+            zm = z0 - abs(z0) * d * eps * 2
+            assert_(np.all(zp != zm), (zp, zm))
+
+            # NB: the cancellation error at the switchover is at least eps
+            good = (abs(func(zp) - func(zm)) < 2*eps)
+            assert_(np.all(good), (func, z0[~good]))
+
+        for func in (np.arcsinh, np.arcsinh, np.arcsin, np.arctanh, np.arctan):
+            pts = [rp+1j*ip for rp in (-1e-3, 0, 1e-3) for ip in(-1e-3, 0, 1e-3)
+                   if rp != 0 or ip != 0]
+            check(func, pts, 1)
+            check(func, pts, 1j)
+            check(func, pts, 1+1j)
+
+
+class TestAttributes:
+    def test_attributes(self):
+        add = ncu.add
+        assert_equal(add.__name__, 'add')
+        assert_(add.ntypes >= 18)  # don't fail if types added
+        assert_('ii->i' in add.types)
+        assert_equal(add.nin, 2)
+        assert_equal(add.nout, 1)
+        assert_equal(add.identity, 0)
+
+    def test_doc(self):
+        # don't bother checking the long list of kwargs, which are likely to
+        # change
+        assert_(ncu.add.__doc__.startswith(
+            "add(x1, x2, /, out=None, *, where=True"))
+        assert_(ncu.frexp.__doc__.startswith(
+            "frexp(x[, out1, out2], / [, out=(None, None)], *, where=True"))
+
+
+class TestSubclass:
+
+    def test_subclass_op(self):
+
+        class simple(np.ndarray):
+            def __new__(subtype, shape):
+                self = np.ndarray.__new__(subtype, shape, dtype=object)
+                self.fill(0)
+                return self
+
+        a = simple((3, 4))
+        assert_equal(a+a, a)
+
+
+class TestFrompyfunc(object):
+
+    def test_identity(self):
+        def mul(a, b):
+            return a * b
+
+        # with identity=value
+        mul_ufunc = np.frompyfunc(mul, nin=2, nout=1, identity=1)
+        assert_equal(mul_ufunc.reduce([2, 3, 4]), 24)
+        assert_equal(mul_ufunc.reduce(np.ones((2, 2)), axis=(0, 1)), 1)
+        assert_equal(mul_ufunc.reduce([]), 1)
+
+        # with identity=None (reorderable)
+        mul_ufunc = np.frompyfunc(mul, nin=2, nout=1, identity=None)
+        assert_equal(mul_ufunc.reduce([2, 3, 4]), 24)
+        assert_equal(mul_ufunc.reduce(np.ones((2, 2)), axis=(0, 1)), 1)
+        assert_raises(ValueError, lambda: mul_ufunc.reduce([]))
+
+        # with no identity (not reorderable)
+        mul_ufunc = np.frompyfunc(mul, nin=2, nout=1)
+        assert_equal(mul_ufunc.reduce([2, 3, 4]), 24)
+        assert_raises(ValueError, lambda: mul_ufunc.reduce(np.ones((2, 2)), axis=(0, 1)))
+        assert_raises(ValueError, lambda: mul_ufunc.reduce([]))
+
+
+def _check_branch_cut(f, x0, dx, re_sign=1, im_sign=-1, sig_zero_ok=False,
+                      dtype=complex):
+    """
+    Check for a branch cut in a function.
+
+    Assert that `x0` lies on a branch cut of function `f` and `f` is
+    continuous from the direction `dx`.
+
+    Parameters
+    ----------
+    f : func
+        Function to check
+    x0 : array-like
+        Point on branch cut
+    dx : array-like
+        Direction to check continuity in
+    re_sign, im_sign : {1, -1}
+        Change of sign of the real or imaginary part expected
+    sig_zero_ok : bool
+        Whether to check if the branch cut respects signed zero (if applicable)
+    dtype : dtype
+        Dtype to check (should be complex)
+
+    """
+    x0 = np.atleast_1d(x0).astype(dtype)
+    dx = np.atleast_1d(dx).astype(dtype)
+
+    if np.dtype(dtype).char == 'F':
+        scale = np.finfo(dtype).eps * 1e2
+        atol = np.float32(1e-2)
+    else:
+        scale = np.finfo(dtype).eps * 1e3
+        atol = 1e-4
+
+    y0 = f(x0)
+    yp = f(x0 + dx*scale*np.absolute(x0)/np.absolute(dx))
+    ym = f(x0 - dx*scale*np.absolute(x0)/np.absolute(dx))
+
+    assert_(np.all(np.absolute(y0.real - yp.real) < atol), (y0, yp))
+    assert_(np.all(np.absolute(y0.imag - yp.imag) < atol), (y0, yp))
+    assert_(np.all(np.absolute(y0.real - ym.real*re_sign) < atol), (y0, ym))
+    assert_(np.all(np.absolute(y0.imag - ym.imag*im_sign) < atol), (y0, ym))
+
+    if sig_zero_ok:
+        # check that signed zeros also work as a displacement
+        jr = (x0.real == 0) & (dx.real != 0)
+        ji = (x0.imag == 0) & (dx.imag != 0)
+        if np.any(jr):
+            x = x0[jr]
+            x.real = np.NZERO
+            ym = f(x)
+            assert_(np.all(np.absolute(y0[jr].real - ym.real*re_sign) < atol), (y0[jr], ym))
+            assert_(np.all(np.absolute(y0[jr].imag - ym.imag*im_sign) < atol), (y0[jr], ym))
+
+        if np.any(ji):
+            x = x0[ji]
+            x.imag = np.NZERO
+            ym = f(x)
+            assert_(np.all(np.absolute(y0[ji].real - ym.real*re_sign) < atol), (y0[ji], ym))
+            assert_(np.all(np.absolute(y0[ji].imag - ym.imag*im_sign) < atol), (y0[ji], ym))
+
+def test_copysign():
+    assert_(np.copysign(1, -1) == -1)
+    with np.errstate(divide="ignore"):
+        assert_(1 / np.copysign(0, -1) < 0)
+        assert_(1 / np.copysign(0, 1) > 0)
+    assert_(np.signbit(np.copysign(np.nan, -1)))
+    assert_(not np.signbit(np.copysign(np.nan, 1)))
+
+def _test_nextafter(t):
+    one = t(1)
+    two = t(2)
+    zero = t(0)
+    eps = np.finfo(t).eps
+    assert_(np.nextafter(one, two) - one == eps)
+    assert_(np.nextafter(one, zero) - one < 0)
+    assert_(np.isnan(np.nextafter(np.nan, one)))
+    assert_(np.isnan(np.nextafter(one, np.nan)))
+    assert_(np.nextafter(one, one) == one)
+
+def test_nextafter():
+    return _test_nextafter(np.float64)
+
+
+def test_nextafterf():
+    return _test_nextafter(np.float32)
+
+
+@pytest.mark.skipif(np.finfo(np.double) == np.finfo(np.longdouble),
+                    reason="long double is same as double")
+@pytest.mark.xfail(condition=platform.machine().startswith("ppc64"),
+                    reason="IBM double double")
+def test_nextafterl():
+    return _test_nextafter(np.longdouble)
+
+
+def test_nextafter_0():
+    for t, direction in itertools.product(np.sctypes['float'], (1, -1)):
+        tiny = np.finfo(t).tiny
+        assert_(0. < direction * np.nextafter(t(0), t(direction)) < tiny)
+        assert_equal(np.nextafter(t(0), t(direction)) / t(2.1), direction * 0.0)
+
+def _test_spacing(t):
+    one = t(1)
+    eps = np.finfo(t).eps
+    nan = t(np.nan)
+    inf = t(np.inf)
+    with np.errstate(invalid='ignore'):
+        assert_(np.spacing(one) == eps)
+        assert_(np.isnan(np.spacing(nan)))
+        assert_(np.isnan(np.spacing(inf)))
+        assert_(np.isnan(np.spacing(-inf)))
+        assert_(np.spacing(t(1e30)) != 0)
+
+def test_spacing():
+    return _test_spacing(np.float64)
+
+def test_spacingf():
+    return _test_spacing(np.float32)
+
+
+@pytest.mark.skipif(np.finfo(np.double) == np.finfo(np.longdouble),
+                    reason="long double is same as double")
+@pytest.mark.xfail(condition=platform.machine().startswith("ppc64"),
+                    reason="IBM double double")
+def test_spacingl():
+    return _test_spacing(np.longdouble)
+
+def test_spacing_gfortran():
+    # Reference from this fortran file, built with gfortran 4.3.3 on linux
+    # 32bits:
+    #       PROGRAM test_spacing
+    #        INTEGER, PARAMETER :: SGL = SELECTED_REAL_KIND(p=6, r=37)
+    #        INTEGER, PARAMETER :: DBL = SELECTED_REAL_KIND(p=13, r=200)
+    #
+    #        WRITE(*,*) spacing(0.00001_DBL)
+    #        WRITE(*,*) spacing(1.0_DBL)
+    #        WRITE(*,*) spacing(1000._DBL)
+    #        WRITE(*,*) spacing(10500._DBL)
+    #
+    #        WRITE(*,*) spacing(0.00001_SGL)
+    #        WRITE(*,*) spacing(1.0_SGL)
+    #        WRITE(*,*) spacing(1000._SGL)
+    #        WRITE(*,*) spacing(10500._SGL)
+    #       END PROGRAM
+    ref = {np.float64: [1.69406589450860068E-021,
+                        2.22044604925031308E-016,
+                        1.13686837721616030E-013,
+                        1.81898940354585648E-012],
+           np.float32: [9.09494702E-13,
+                        1.19209290E-07,
+                        6.10351563E-05,
+                        9.76562500E-04]}
+
+    for dt, dec_ in zip([np.float32, np.float64], (10, 20)):
+        x = np.array([1e-5, 1, 1000, 10500], dtype=dt)
+        assert_array_almost_equal(np.spacing(x), ref[dt], decimal=dec_)
+
+def test_nextafter_vs_spacing():
+    # XXX: spacing does not handle long double yet
+    for t in [np.float32, np.float64]:
+        for _f in [1, 1e-5, 1000]:
+            f = t(_f)
+            f1 = t(_f + 1)
+            assert_(np.nextafter(f, f1) - f == np.spacing(f))
+
+def test_pos_nan():
+    """Check np.nan is a positive nan."""
+    assert_(np.signbit(np.nan) == 0)
+
+def test_reduceat():
+    """Test bug in reduceat when structured arrays are not copied."""
+    db = np.dtype([('name', 'S11'), ('time', np.int64), ('value', np.float32)])
+    a = np.empty([100], dtype=db)
+    a['name'] = 'Simple'
+    a['time'] = 10
+    a['value'] = 100
+    indx = [0, 7, 15, 25]
+
+    h2 = []
+    val1 = indx[0]
+    for val2 in indx[1:]:
+        h2.append(np.add.reduce(a['value'][val1:val2]))
+        val1 = val2
+    h2.append(np.add.reduce(a['value'][val1:]))
+    h2 = np.array(h2)
+
+    # test buffered -- this should work
+    h1 = np.add.reduceat(a['value'], indx)
+    assert_array_almost_equal(h1, h2)
+
+    # This is when the error occurs.
+    # test no buffer
+    np.setbufsize(32)
+    h1 = np.add.reduceat(a['value'], indx)
+    np.setbufsize(np.UFUNC_BUFSIZE_DEFAULT)
+    assert_array_almost_equal(h1, h2)
+
+def test_reduceat_empty():
+    """Reduceat should work with empty arrays"""
+    indices = np.array([], 'i4')
+    x = np.array([], 'f8')
+    result = np.add.reduceat(x, indices)
+    assert_equal(result.dtype, x.dtype)
+    assert_equal(result.shape, (0,))
+    # Another case with a slightly different zero-sized shape
+    x = np.ones((5, 2))
+    result = np.add.reduceat(x, [], axis=0)
+    assert_equal(result.dtype, x.dtype)
+    assert_equal(result.shape, (0, 2))
+    result = np.add.reduceat(x, [], axis=1)
+    assert_equal(result.dtype, x.dtype)
+    assert_equal(result.shape, (5, 0))
+
+def test_complex_nan_comparisons():
+    nans = [complex(np.nan, 0), complex(0, np.nan), complex(np.nan, np.nan)]
+    fins = [complex(1, 0), complex(-1, 0), complex(0, 1), complex(0, -1),
+            complex(1, 1), complex(-1, -1), complex(0, 0)]
+
+    with np.errstate(invalid='ignore'):
+        for x in nans + fins:
+            x = np.array([x])
+            for y in nans + fins:
+                y = np.array([y])
+
+                if np.isfinite(x) and np.isfinite(y):
+                    continue
+
+                assert_equal(x < y, False, err_msg="%r < %r" % (x, y))
+                assert_equal(x > y, False, err_msg="%r > %r" % (x, y))
+                assert_equal(x <= y, False, err_msg="%r <= %r" % (x, y))
+                assert_equal(x >= y, False, err_msg="%r >= %r" % (x, y))
+                assert_equal(x == y, False, err_msg="%r == %r" % (x, y))
+
+
+def test_rint_big_int():
+    # np.rint bug for large integer values on Windows 32-bit and MKL
+    # https://github.com/numpy/numpy/issues/6685
+    val = 4607998452777363968
+    # This is exactly representable in floating point
+    assert_equal(val, int(float(val)))
+    # Rint should not change the value
+    assert_equal(val, np.rint(val))
+
+@pytest.mark.parametrize('ftype', [np.float32, np.float64])
+def test_memoverlap_accumulate(ftype):
+    # Reproduces bug https://github.com/numpy/numpy/issues/15597
+    arr = np.array([0.61, 0.60, 0.77, 0.41, 0.19], dtype=ftype)
+    out_max = np.array([0.61, 0.61, 0.77, 0.77, 0.77], dtype=ftype)
+    out_min = np.array([0.61, 0.60, 0.60, 0.41, 0.19], dtype=ftype)
+    assert_equal(np.maximum.accumulate(arr), out_max)
+    assert_equal(np.minimum.accumulate(arr), out_min)
+
+def test_signaling_nan_exceptions():
+    with assert_no_warnings():
+        a = np.ndarray(shape=(), dtype='float32', buffer=b'\x00\xe0\xbf\xff')
+        np.isnan(a)
+
+@pytest.mark.parametrize("arr", [
+    np.arange(2),
+    np.matrix([0, 1]),
+    np.matrix([[0, 1], [2, 5]]),
+    ])
+def test_outer_subclass_preserve(arr):
+    # for gh-8661
+    class foo(np.ndarray): pass
+    actual = np.multiply.outer(arr.view(foo), arr.view(foo))
+    assert actual.__class__.__name__ == 'foo'
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_umath_accuracy.py b/venv/Lib/site-packages/numpy/core/tests/test_umath_accuracy.py
new file mode 100644
index 000000000..33080edbb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_umath_accuracy.py
@@ -0,0 +1,59 @@
+import numpy as np
+import platform
+from os import path
+import sys
+import pytest
+from ctypes import c_longlong, c_double, c_float, c_int, cast, pointer, POINTER
+from numpy.testing import assert_array_max_ulp
+from numpy.core._multiarray_umath import __cpu_features__
+
+IS_AVX = __cpu_features__.get('AVX512F', False) or \
+        (__cpu_features__.get('FMA3', False) and __cpu_features__.get('AVX2', False))
+runtest = sys.platform.startswith('linux') and IS_AVX
+platform_skip = pytest.mark.skipif(not runtest,
+                                   reason="avoid testing inconsistent platform "
+                                   "library implementations")
+
+# convert string to hex function taken from:
+# https://stackoverflow.com/questions/1592158/convert-hex-to-float #
+def convert(s, datatype="np.float32"):
+    i = int(s, 16)                   # convert from hex to a Python int
+    if (datatype == "np.float64"):
+        cp = pointer(c_longlong(i))           # make this into a c long long integer
+        fp = cast(cp, POINTER(c_double))  # cast the int pointer to a double pointer
+    else:
+        cp = pointer(c_int(i))           # make this into a c integer
+        fp = cast(cp, POINTER(c_float))  # cast the int pointer to a float pointer
+
+    return fp.contents.value         # dereference the pointer, get the float
+
+str_to_float = np.vectorize(convert)
+files = ['umath-validation-set-exp',
+         'umath-validation-set-log',
+         'umath-validation-set-sin',
+         'umath-validation-set-cos']
+
+class TestAccuracy:
+    @platform_skip
+    def test_validate_transcendentals(self):
+        with np.errstate(all='ignore'):
+            for filename in files:
+                data_dir = path.join(path.dirname(__file__), 'data')
+                filepath = path.join(data_dir, filename)
+                with open(filepath) as fid:
+                    file_without_comments = (r for r in fid if not r[0] in ('$', '#'))
+                    data = np.genfromtxt(file_without_comments,
+                                         dtype=('|S39','|S39','|S39',int),
+                                         names=('type','input','output','ulperr'),
+                                         delimiter=',',
+                                         skip_header=1)
+                    npfunc = getattr(np, filename.split('-')[3])
+                    for datatype in np.unique(data['type']):
+                        data_subset = data[data['type'] == datatype]
+                        inval  = np.array(str_to_float(data_subset['input'].astype(str), data_subset['type'].astype(str)), dtype=eval(datatype))
+                        outval = np.array(str_to_float(data_subset['output'].astype(str), data_subset['type'].astype(str)), dtype=eval(datatype))
+                        perm = np.random.permutation(len(inval))
+                        inval = inval[perm]
+                        outval = outval[perm]
+                        maxulperr = data_subset['ulperr'].max()
+                        assert_array_max_ulp(npfunc(inval), outval, maxulperr)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_umath_complex.py b/venv/Lib/site-packages/numpy/core/tests/test_umath_complex.py
new file mode 100644
index 000000000..a685abe9a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_umath_complex.py
@@ -0,0 +1,610 @@
+import sys
+import platform
+import pytest
+
+import numpy as np
+# import the c-extension module directly since _arg is not exported via umath
+import numpy.core._multiarray_umath as ncu
+from numpy.testing import (
+    assert_raises, assert_equal, assert_array_equal, assert_almost_equal, assert_array_max_ulp
+    )
+
+# TODO: branch cuts (use Pauli code)
+# TODO: conj 'symmetry'
+# TODO: FPU exceptions
+
+# At least on Windows the results of many complex functions are not conforming
+# to the C99 standard. See ticket 1574.
+# Ditto for Solaris (ticket 1642) and OS X on PowerPC.
+#FIXME: this will probably change when we require full C99 campatibility
+with np.errstate(all='ignore'):
+    functions_seem_flaky = ((np.exp(complex(np.inf, 0)).imag != 0)
+                            or (np.log(complex(np.NZERO, 0)).imag != np.pi))
+# TODO: replace with a check on whether platform-provided C99 funcs are used
+xfail_complex_tests = (not sys.platform.startswith('linux') or functions_seem_flaky)
+
+# TODO This can be xfail when the generator functions are got rid of.
+platform_skip = pytest.mark.skipif(xfail_complex_tests,
+                                   reason="Inadequate C99 complex support")
+
+
+
+class TestCexp:
+    def test_simple(self):
+        check = check_complex_value
+        f = np.exp
+
+        check(f, 1, 0, np.exp(1), 0, False)
+        check(f, 0, 1, np.cos(1), np.sin(1), False)
+
+        ref = np.exp(1) * complex(np.cos(1), np.sin(1))
+        check(f, 1, 1, ref.real, ref.imag, False)
+
+    @platform_skip
+    def test_special_values(self):
+        # C99: Section G 6.3.1
+
+        check = check_complex_value
+        f = np.exp
+
+        # cexp(+-0 + 0i) is 1 + 0i
+        check(f, np.PZERO, 0, 1, 0, False)
+        check(f, np.NZERO, 0, 1, 0, False)
+
+        # cexp(x + infi) is nan + nani for finite x and raises 'invalid' FPU
+        # exception
+        check(f,  1, np.inf, np.nan, np.nan)
+        check(f, -1, np.inf, np.nan, np.nan)
+        check(f,  0, np.inf, np.nan, np.nan)
+
+        # cexp(inf + 0i) is inf + 0i
+        check(f,  np.inf, 0, np.inf, 0)
+
+        # cexp(-inf + yi) is +0 * (cos(y) + i sin(y)) for finite y
+        check(f,  -np.inf, 1, np.PZERO, np.PZERO)
+        check(f,  -np.inf, 0.75 * np.pi, np.NZERO, np.PZERO)
+
+        # cexp(inf + yi) is +inf * (cos(y) + i sin(y)) for finite y
+        check(f,  np.inf, 1, np.inf, np.inf)
+        check(f,  np.inf, 0.75 * np.pi, -np.inf, np.inf)
+
+        # cexp(-inf + inf i) is +-0 +- 0i (signs unspecified)
+        def _check_ninf_inf(dummy):
+            msgform = "cexp(-inf, inf) is (%f, %f), expected (+-0, +-0)"
+            with np.errstate(invalid='ignore'):
+                z = f(np.array(complex(-np.inf, np.inf)))
+                if z.real != 0 or z.imag != 0:
+                    raise AssertionError(msgform % (z.real, z.imag))
+
+        _check_ninf_inf(None)
+
+        # cexp(inf + inf i) is +-inf + NaNi and raised invalid FPU ex.
+        def _check_inf_inf(dummy):
+            msgform = "cexp(inf, inf) is (%f, %f), expected (+-inf, nan)"
+            with np.errstate(invalid='ignore'):
+                z = f(np.array(complex(np.inf, np.inf)))
+                if not np.isinf(z.real) or not np.isnan(z.imag):
+                    raise AssertionError(msgform % (z.real, z.imag))
+
+        _check_inf_inf(None)
+
+        # cexp(-inf + nan i) is +-0 +- 0i
+        def _check_ninf_nan(dummy):
+            msgform = "cexp(-inf, nan) is (%f, %f), expected (+-0, +-0)"
+            with np.errstate(invalid='ignore'):
+                z = f(np.array(complex(-np.inf, np.nan)))
+                if z.real != 0 or z.imag != 0:
+                    raise AssertionError(msgform % (z.real, z.imag))
+
+        _check_ninf_nan(None)
+
+        # cexp(inf + nan i) is +-inf + nan
+        def _check_inf_nan(dummy):
+            msgform = "cexp(-inf, nan) is (%f, %f), expected (+-inf, nan)"
+            with np.errstate(invalid='ignore'):
+                z = f(np.array(complex(np.inf, np.nan)))
+                if not np.isinf(z.real) or not np.isnan(z.imag):
+                    raise AssertionError(msgform % (z.real, z.imag))
+
+        _check_inf_nan(None)
+
+        # cexp(nan + yi) is nan + nani for y != 0 (optional: raises invalid FPU
+        # ex)
+        check(f, np.nan, 1, np.nan, np.nan)
+        check(f, np.nan, -1, np.nan, np.nan)
+
+        check(f, np.nan,  np.inf, np.nan, np.nan)
+        check(f, np.nan, -np.inf, np.nan, np.nan)
+
+        # cexp(nan + nani) is nan + nani
+        check(f, np.nan, np.nan, np.nan, np.nan)
+
+    # TODO This can be xfail when the generator functions are got rid of.
+    @pytest.mark.skip(reason="cexp(nan + 0I) is wrong on most platforms")
+    def test_special_values2(self):
+        # XXX: most implementations get it wrong here (including glibc <= 2.10)
+        # cexp(nan + 0i) is nan + 0i
+        check = check_complex_value
+        f = np.exp
+
+        check(f, np.nan, 0, np.nan, 0)
+
+class TestClog:
+    def test_simple(self):
+        x = np.array([1+0j, 1+2j])
+        y_r = np.log(np.abs(x)) + 1j * np.angle(x)
+        y = np.log(x)
+        for i in range(len(x)):
+            assert_almost_equal(y[i], y_r[i])
+
+    @platform_skip
+    @pytest.mark.skipif(platform.machine() == "armv5tel", reason="See gh-413.")
+    def test_special_values(self):
+        xl = []
+        yl = []
+
+        # From C99 std (Sec 6.3.2)
+        # XXX: check exceptions raised
+        # --- raise for invalid fails.
+
+        # clog(-0 + i0) returns -inf + i pi and raises the 'divide-by-zero'
+        # floating-point exception.
+        with np.errstate(divide='raise'):
+            x = np.array([np.NZERO], dtype=complex)
+            y = complex(-np.inf, np.pi)
+            assert_raises(FloatingPointError, np.log, x)
+        with np.errstate(divide='ignore'):
+            assert_almost_equal(np.log(x), y)
+
+        xl.append(x)
+        yl.append(y)
+
+        # clog(+0 + i0) returns -inf + i0 and raises the 'divide-by-zero'
+        # floating-point exception.
+        with np.errstate(divide='raise'):
+            x = np.array([0], dtype=complex)
+            y = complex(-np.inf, 0)
+            assert_raises(FloatingPointError, np.log, x)
+        with np.errstate(divide='ignore'):
+            assert_almost_equal(np.log(x), y)
+
+        xl.append(x)
+        yl.append(y)
+
+        # clog(x + i inf returns +inf + i pi /2, for finite x.
+        x = np.array([complex(1, np.inf)], dtype=complex)
+        y = complex(np.inf, 0.5 * np.pi)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        x = np.array([complex(-1, np.inf)], dtype=complex)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(x + iNaN) returns NaN + iNaN and optionally raises the
+        # 'invalid' floating- point exception, for finite x.
+        with np.errstate(invalid='raise'):
+            x = np.array([complex(1., np.nan)], dtype=complex)
+            y = complex(np.nan, np.nan)
+            #assert_raises(FloatingPointError, np.log, x)
+        with np.errstate(invalid='ignore'):
+            assert_almost_equal(np.log(x), y)
+
+        xl.append(x)
+        yl.append(y)
+
+        with np.errstate(invalid='raise'):
+            x = np.array([np.inf + 1j * np.nan], dtype=complex)
+            #assert_raises(FloatingPointError, np.log, x)
+        with np.errstate(invalid='ignore'):
+            assert_almost_equal(np.log(x), y)
+
+        xl.append(x)
+        yl.append(y)
+
+        # clog(- inf + iy) returns +inf + ipi , for finite positive-signed y.
+        x = np.array([-np.inf + 1j], dtype=complex)
+        y = complex(np.inf, np.pi)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(+ inf + iy) returns +inf + i0, for finite positive-signed y.
+        x = np.array([np.inf + 1j], dtype=complex)
+        y = complex(np.inf, 0)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(- inf + i inf) returns +inf + i3pi /4.
+        x = np.array([complex(-np.inf, np.inf)], dtype=complex)
+        y = complex(np.inf, 0.75 * np.pi)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(+ inf + i inf) returns +inf + ipi /4.
+        x = np.array([complex(np.inf, np.inf)], dtype=complex)
+        y = complex(np.inf, 0.25 * np.pi)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(+/- inf + iNaN) returns +inf + iNaN.
+        x = np.array([complex(np.inf, np.nan)], dtype=complex)
+        y = complex(np.inf, np.nan)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        x = np.array([complex(-np.inf, np.nan)], dtype=complex)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(NaN + iy) returns NaN + iNaN and optionally raises the
+        # 'invalid' floating-point exception, for finite y.
+        x = np.array([complex(np.nan, 1)], dtype=complex)
+        y = complex(np.nan, np.nan)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(NaN + i inf) returns +inf + iNaN.
+        x = np.array([complex(np.nan, np.inf)], dtype=complex)
+        y = complex(np.inf, np.nan)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(NaN + iNaN) returns NaN + iNaN.
+        x = np.array([complex(np.nan, np.nan)], dtype=complex)
+        y = complex(np.nan, np.nan)
+        assert_almost_equal(np.log(x), y)
+        xl.append(x)
+        yl.append(y)
+
+        # clog(conj(z)) = conj(clog(z)).
+        xa = np.array(xl, dtype=complex)
+        ya = np.array(yl, dtype=complex)
+        with np.errstate(divide='ignore'):
+            for i in range(len(xa)):
+                assert_almost_equal(np.log(xa[i].conj()), ya[i].conj())
+
+
+class TestCsqrt:
+
+    def test_simple(self):
+        # sqrt(1)
+        check_complex_value(np.sqrt, 1, 0, 1, 0)
+
+        # sqrt(1i)
+        rres = 0.5*np.sqrt(2)
+        ires = rres
+        check_complex_value(np.sqrt, 0, 1, rres, ires, False)
+
+        # sqrt(-1)
+        check_complex_value(np.sqrt, -1, 0, 0, 1)
+
+    def test_simple_conjugate(self):
+        ref = np.conj(np.sqrt(complex(1, 1)))
+
+        def f(z):
+            return np.sqrt(np.conj(z))
+
+        check_complex_value(f, 1, 1, ref.real, ref.imag, False)
+
+    #def test_branch_cut(self):
+    #    _check_branch_cut(f, -1, 0, 1, -1)
+
+    @platform_skip
+    def test_special_values(self):
+        # C99: Sec G 6.4.2
+
+        check = check_complex_value
+        f = np.sqrt
+
+        # csqrt(+-0 + 0i) is 0 + 0i
+        check(f, np.PZERO, 0, 0, 0)
+        check(f, np.NZERO, 0, 0, 0)
+
+        # csqrt(x + infi) is inf + infi for any x (including NaN)
+        check(f,  1, np.inf, np.inf, np.inf)
+        check(f, -1, np.inf, np.inf, np.inf)
+
+        check(f, np.PZERO, np.inf, np.inf, np.inf)
+        check(f, np.NZERO, np.inf, np.inf, np.inf)
+        check(f,   np.inf, np.inf, np.inf, np.inf)
+        check(f,  -np.inf, np.inf, np.inf, np.inf)
+        check(f,  -np.nan, np.inf, np.inf, np.inf)
+
+        # csqrt(x + nani) is nan + nani for any finite x
+        check(f,  1, np.nan, np.nan, np.nan)
+        check(f, -1, np.nan, np.nan, np.nan)
+        check(f,  0, np.nan, np.nan, np.nan)
+
+        # csqrt(-inf + yi) is +0 + infi for any finite y > 0
+        check(f, -np.inf, 1, np.PZERO, np.inf)
+
+        # csqrt(inf + yi) is +inf + 0i for any finite y > 0
+        check(f, np.inf, 1, np.inf, np.PZERO)
+
+        # csqrt(-inf + nani) is nan +- infi (both +i infi are valid)
+        def _check_ninf_nan(dummy):
+            msgform = "csqrt(-inf, nan) is (%f, %f), expected (nan, +-inf)"
+            z = np.sqrt(np.array(complex(-np.inf, np.nan)))
+            #Fixme: ugly workaround for isinf bug.
+            with np.errstate(invalid='ignore'):
+                if not (np.isnan(z.real) and np.isinf(z.imag)):
+                    raise AssertionError(msgform % (z.real, z.imag))
+
+        _check_ninf_nan(None)
+
+        # csqrt(+inf + nani) is inf + nani
+        check(f, np.inf, np.nan, np.inf, np.nan)
+
+        # csqrt(nan + yi) is nan + nani for any finite y (infinite handled in x
+        # + nani)
+        check(f, np.nan,       0, np.nan, np.nan)
+        check(f, np.nan,       1, np.nan, np.nan)
+        check(f, np.nan,  np.nan, np.nan, np.nan)
+
+        # XXX: check for conj(csqrt(z)) == csqrt(conj(z)) (need to fix branch
+        # cuts first)
+
+class TestCpow:
+    def setup(self):
+        self.olderr = np.seterr(invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.olderr)
+
+    def test_simple(self):
+        x = np.array([1+1j, 0+2j, 1+2j, np.inf, np.nan])
+        y_r = x ** 2
+        y = np.power(x, 2)
+        for i in range(len(x)):
+            assert_almost_equal(y[i], y_r[i])
+
+    def test_scalar(self):
+        x = np.array([1, 1j,         2,  2.5+.37j, np.inf, np.nan])
+        y = np.array([1, 1j, -0.5+1.5j, -0.5+1.5j,      2,      3])
+        lx = list(range(len(x)))
+        # Compute the values for complex type in python
+        p_r = [complex(x[i]) ** complex(y[i]) for i in lx]
+        # Substitute a result allowed by C99 standard
+        p_r[4] = complex(np.inf, np.nan)
+        # Do the same with numpy complex scalars
+        n_r = [x[i] ** y[i] for i in lx]
+        for i in lx:
+            assert_almost_equal(n_r[i], p_r[i], err_msg='Loop %d\n' % i)
+
+    def test_array(self):
+        x = np.array([1, 1j,         2,  2.5+.37j, np.inf, np.nan])
+        y = np.array([1, 1j, -0.5+1.5j, -0.5+1.5j,      2,      3])
+        lx = list(range(len(x)))
+        # Compute the values for complex type in python
+        p_r = [complex(x[i]) ** complex(y[i]) for i in lx]
+        # Substitute a result allowed by C99 standard
+        p_r[4] = complex(np.inf, np.nan)
+        # Do the same with numpy arrays
+        n_r = x ** y
+        for i in lx:
+            assert_almost_equal(n_r[i], p_r[i], err_msg='Loop %d\n' % i)
+
+class TestCabs:
+    def setup(self):
+        self.olderr = np.seterr(invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.olderr)
+
+    def test_simple(self):
+        x = np.array([1+1j, 0+2j, 1+2j, np.inf, np.nan])
+        y_r = np.array([np.sqrt(2.), 2, np.sqrt(5), np.inf, np.nan])
+        y = np.abs(x)
+        for i in range(len(x)):
+            assert_almost_equal(y[i], y_r[i])
+
+    def test_fabs(self):
+        # Test that np.abs(x +- 0j) == np.abs(x) (as mandated by C99 for cabs)
+        x = np.array([1+0j], dtype=complex)
+        assert_array_equal(np.abs(x), np.real(x))
+
+        x = np.array([complex(1, np.NZERO)], dtype=complex)
+        assert_array_equal(np.abs(x), np.real(x))
+
+        x = np.array([complex(np.inf, np.NZERO)], dtype=complex)
+        assert_array_equal(np.abs(x), np.real(x))
+
+        x = np.array([complex(np.nan, np.NZERO)], dtype=complex)
+        assert_array_equal(np.abs(x), np.real(x))
+
+    def test_cabs_inf_nan(self):
+        x, y = [], []
+
+        # cabs(+-nan + nani) returns nan
+        x.append(np.nan)
+        y.append(np.nan)
+        check_real_value(np.abs,  np.nan, np.nan, np.nan)
+
+        x.append(np.nan)
+        y.append(-np.nan)
+        check_real_value(np.abs, -np.nan, np.nan, np.nan)
+
+        # According to C99 standard, if exactly one of the real/part is inf and
+        # the other nan, then cabs should return inf
+        x.append(np.inf)
+        y.append(np.nan)
+        check_real_value(np.abs,  np.inf, np.nan, np.inf)
+
+        x.append(-np.inf)
+        y.append(np.nan)
+        check_real_value(np.abs, -np.inf, np.nan, np.inf)
+
+        # cabs(conj(z)) == conj(cabs(z)) (= cabs(z))
+        def f(a):
+            return np.abs(np.conj(a))
+
+        def g(a, b):
+            return np.abs(complex(a, b))
+
+        xa = np.array(x, dtype=complex)
+        for i in range(len(xa)):
+            ref = g(x[i], y[i])
+            check_real_value(f, x[i], y[i], ref)
+
+class TestCarg:
+    def test_simple(self):
+        check_real_value(ncu._arg, 1, 0, 0, False)
+        check_real_value(ncu._arg, 0, 1, 0.5*np.pi, False)
+
+        check_real_value(ncu._arg, 1, 1, 0.25*np.pi, False)
+        check_real_value(ncu._arg, np.PZERO, np.PZERO, np.PZERO)
+
+    # TODO This can be xfail when the generator functions are got rid of.
+    @pytest.mark.skip(
+        reason="Complex arithmetic with signed zero fails on most platforms")
+    def test_zero(self):
+        # carg(-0 +- 0i) returns +- pi
+        check_real_value(ncu._arg, np.NZERO, np.PZERO,  np.pi, False)
+        check_real_value(ncu._arg, np.NZERO, np.NZERO, -np.pi, False)
+
+        # carg(+0 +- 0i) returns +- 0
+        check_real_value(ncu._arg, np.PZERO, np.PZERO, np.PZERO)
+        check_real_value(ncu._arg, np.PZERO, np.NZERO, np.NZERO)
+
+        # carg(x +- 0i) returns +- 0 for x > 0
+        check_real_value(ncu._arg, 1, np.PZERO, np.PZERO, False)
+        check_real_value(ncu._arg, 1, np.NZERO, np.NZERO, False)
+
+        # carg(x +- 0i) returns +- pi for x < 0
+        check_real_value(ncu._arg, -1, np.PZERO,  np.pi, False)
+        check_real_value(ncu._arg, -1, np.NZERO, -np.pi, False)
+
+        # carg(+- 0 + yi) returns pi/2 for y > 0
+        check_real_value(ncu._arg, np.PZERO, 1, 0.5 * np.pi, False)
+        check_real_value(ncu._arg, np.NZERO, 1, 0.5 * np.pi, False)
+
+        # carg(+- 0 + yi) returns -pi/2 for y < 0
+        check_real_value(ncu._arg, np.PZERO, -1, 0.5 * np.pi, False)
+        check_real_value(ncu._arg, np.NZERO, -1, -0.5 * np.pi, False)
+
+    #def test_branch_cuts(self):
+    #    _check_branch_cut(ncu._arg, -1, 1j, -1, 1)
+
+    def test_special_values(self):
+        # carg(-np.inf +- yi) returns +-pi for finite y > 0
+        check_real_value(ncu._arg, -np.inf,  1,  np.pi, False)
+        check_real_value(ncu._arg, -np.inf, -1, -np.pi, False)
+
+        # carg(np.inf +- yi) returns +-0 for finite y > 0
+        check_real_value(ncu._arg, np.inf,  1, np.PZERO, False)
+        check_real_value(ncu._arg, np.inf, -1, np.NZERO, False)
+
+        # carg(x +- np.infi) returns +-pi/2 for finite x
+        check_real_value(ncu._arg, 1,  np.inf,  0.5 * np.pi, False)
+        check_real_value(ncu._arg, 1, -np.inf, -0.5 * np.pi, False)
+
+        # carg(-np.inf +- np.infi) returns +-3pi/4
+        check_real_value(ncu._arg, -np.inf,  np.inf,  0.75 * np.pi, False)
+        check_real_value(ncu._arg, -np.inf, -np.inf, -0.75 * np.pi, False)
+
+        # carg(np.inf +- np.infi) returns +-pi/4
+        check_real_value(ncu._arg, np.inf,  np.inf,  0.25 * np.pi, False)
+        check_real_value(ncu._arg, np.inf, -np.inf, -0.25 * np.pi, False)
+
+        # carg(x + yi) returns np.nan if x or y is nan
+        check_real_value(ncu._arg, np.nan,      0, np.nan, False)
+        check_real_value(ncu._arg,      0, np.nan, np.nan, False)
+
+        check_real_value(ncu._arg, np.nan, np.inf, np.nan, False)
+        check_real_value(ncu._arg, np.inf, np.nan, np.nan, False)
+
+
+def check_real_value(f, x1, y1, x, exact=True):
+    z1 = np.array([complex(x1, y1)])
+    if exact:
+        assert_equal(f(z1), x)
+    else:
+        assert_almost_equal(f(z1), x)
+
+
+def check_complex_value(f, x1, y1, x2, y2, exact=True):
+    z1 = np.array([complex(x1, y1)])
+    z2 = complex(x2, y2)
+    with np.errstate(invalid='ignore'):
+        if exact:
+            assert_equal(f(z1), z2)
+        else:
+            assert_almost_equal(f(z1), z2)
+
+class TestSpecialComplexAVX(object):
+    @pytest.mark.parametrize("stride", [-4,-2,-1,1,2,4])
+    @pytest.mark.parametrize("astype", [np.complex64, np.complex128])
+    def test_array(self, stride, astype):
+        arr = np.array([np.complex(np.nan , np.nan),
+                        np.complex(np.nan , np.inf),
+                        np.complex(np.inf , np.nan),
+                        np.complex(np.inf , np.inf),
+                        np.complex(0.     , np.inf),
+                        np.complex(np.inf , 0.),
+                        np.complex(0.     , 0.),
+                        np.complex(0.     , np.nan),
+                        np.complex(np.nan , 0.)], dtype=astype)
+        abs_true = np.array([np.nan, np.inf, np.inf, np.inf, np.inf, np.inf, 0., np.nan, np.nan], dtype=arr.real.dtype)
+        sq_true = np.array([np.complex(np.nan,  np.nan),
+                            np.complex(np.nan,  np.nan),
+                            np.complex(np.nan,  np.nan),
+                            np.complex(np.nan,  np.inf),
+                            np.complex(-np.inf, np.nan),
+                            np.complex(np.inf,  np.nan),
+                            np.complex(0.,     0.),
+                            np.complex(np.nan, np.nan),
+                            np.complex(np.nan, np.nan)], dtype=astype)
+        assert_equal(np.abs(arr[::stride]), abs_true[::stride])
+        with np.errstate(invalid='ignore'):
+            assert_equal(np.square(arr[::stride]), sq_true[::stride])
+
+class TestComplexAbsoluteAVX(object):
+    @pytest.mark.parametrize("arraysize", [1,2,3,4,5,6,7,8,9,10,11,13,15,17,18,19])
+    @pytest.mark.parametrize("stride", [-4,-3,-2,-1,1,2,3,4])
+    @pytest.mark.parametrize("astype", [np.complex64, np.complex128])
+    # test to ensure masking and strides work as intended in the AVX implementation
+    def test_array(self, arraysize, stride, astype):
+        arr = np.ones(arraysize, dtype=astype)
+        abs_true = np.ones(arraysize, dtype=arr.real.dtype)
+        assert_equal(np.abs(arr[::stride]), abs_true[::stride])
+
+# Testcase taken as is from https://github.com/numpy/numpy/issues/16660
+class TestComplexAbsoluteMixedDTypes(object):
+    @pytest.mark.parametrize("stride", [-4,-3,-2,-1,1,2,3,4])
+    @pytest.mark.parametrize("astype", [np.complex64, np.complex128])
+    @pytest.mark.parametrize("func", ['abs', 'square', 'conjugate'])
+    
+    def test_array(self, stride, astype, func):
+        dtype = [('template_id', '<i8'), ('bank_chisq','<f4'),
+                 ('bank_chisq_dof','<i8'), ('chisq', '<f4'), ('chisq_dof','<i8'),
+                 ('cont_chisq', '<f4'), ('psd_var_val', '<f4'), ('sg_chisq','<f4'),
+                 ('mycomplex', astype), ('time_index', '<i8')]
+        vec = np.array([
+               (0, 0., 0, -31.666483, 200, 0., 0.,  1.      ,  3.0+4.0j   ,  613090),
+               (1, 0., 0, 260.91525 ,  42, 0., 0.,  1.      ,  5.0+12.0j  ,  787315),
+               (1, 0., 0,  52.15155 ,  42, 0., 0.,  1.      ,  8.0+15.0j  ,  806641),
+               (1, 0., 0,  52.430195,  42, 0., 0.,  1.      ,  7.0+24.0j  , 1363540),
+               (2, 0., 0, 304.43646 ,  58, 0., 0.,  1.      ,  20.0+21.0j ,  787323),
+               (3, 0., 0, 299.42108 ,  52, 0., 0.,  1.      ,  12.0+35.0j ,  787332),
+               (4, 0., 0,  39.4836  ,  28, 0., 0.,  9.182192,  9.0+40.0j  ,  787304),
+               (4, 0., 0,  76.83787 ,  28, 0., 0.,  1.      ,  28.0+45.0j, 1321869),
+               (5, 0., 0, 143.26366 ,  24, 0., 0., 10.996129,  11.0+60.0j ,  787299)], dtype=dtype)
+        myfunc = getattr(np, func)
+        a = vec['mycomplex']
+        g = myfunc(a[::stride])
+        
+        b = vec['mycomplex'].copy()
+        h = myfunc(b[::stride])
+        
+        assert_array_max_ulp(h.real, g.real, 1)
+        assert_array_max_ulp(h.imag, g.imag, 1)
diff --git a/venv/Lib/site-packages/numpy/core/tests/test_unicode.py b/venv/Lib/site-packages/numpy/core/tests/test_unicode.py
new file mode 100644
index 000000000..8e0dd47cb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/tests/test_unicode.py
@@ -0,0 +1,362 @@
+import numpy as np
+from numpy.testing import assert_, assert_equal, assert_array_equal
+
+def buffer_length(arr):
+    if isinstance(arr, str):
+        if not arr:
+            charmax = 0
+        else:
+            charmax = max([ord(c) for c in arr])
+        if charmax < 256:
+            size = 1
+        elif charmax < 65536:
+            size = 2
+        else:
+            size = 4
+        return size * len(arr)
+    v = memoryview(arr)
+    if v.shape is None:
+        return len(v) * v.itemsize
+    else:
+        return np.prod(v.shape) * v.itemsize
+
+# In both cases below we need to make sure that the byte swapped value (as
+# UCS4) is still a valid unicode:
+# Value that can be represented in UCS2 interpreters
+ucs2_value = u'\u0900'
+# Value that cannot be represented in UCS2 interpreters (but can in UCS4)
+ucs4_value = u'\U00100900'
+
+
+def test_string_cast():
+    str_arr = np.array(["1234", "1234\0\0"], dtype='S')
+    uni_arr1 = str_arr.astype('>U')
+    uni_arr2 = str_arr.astype('<U')
+
+    assert_(str_arr != uni_arr1)
+    assert_(str_arr != uni_arr2)
+    assert_array_equal(uni_arr1, uni_arr2)
+
+
+############################################################
+#    Creation tests
+############################################################
+
+class CreateZeros:
+    """Check the creation of zero-valued arrays"""
+
+    def content_check(self, ua, ua_scalar, nbytes):
+
+        # Check the length of the unicode base type
+        assert_(int(ua.dtype.str[2:]) == self.ulen)
+        # Check the length of the data buffer
+        assert_(buffer_length(ua) == nbytes)
+        # Small check that data in array element is ok
+        assert_(ua_scalar == u'')
+        # Encode to ascii and double check
+        assert_(ua_scalar.encode('ascii') == b'')
+        # Check buffer lengths for scalars
+        assert_(buffer_length(ua_scalar) == 0)
+
+    def test_zeros0D(self):
+        # Check creation of 0-dimensional objects
+        ua = np.zeros((), dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[()], 4*self.ulen)
+
+    def test_zerosSD(self):
+        # Check creation of single-dimensional objects
+        ua = np.zeros((2,), dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[0], 4*self.ulen*2)
+        self.content_check(ua, ua[1], 4*self.ulen*2)
+
+    def test_zerosMD(self):
+        # Check creation of multi-dimensional objects
+        ua = np.zeros((2, 3, 4), dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[0, 0, 0], 4*self.ulen*2*3*4)
+        self.content_check(ua, ua[-1, -1, -1], 4*self.ulen*2*3*4)
+
+
+class TestCreateZeros_1(CreateZeros):
+    """Check the creation of zero-valued arrays (size 1)"""
+    ulen = 1
+
+
+class TestCreateZeros_2(CreateZeros):
+    """Check the creation of zero-valued arrays (size 2)"""
+    ulen = 2
+
+
+class TestCreateZeros_1009(CreateZeros):
+    """Check the creation of zero-valued arrays (size 1009)"""
+    ulen = 1009
+
+
+class CreateValues:
+    """Check the creation of unicode arrays with values"""
+
+    def content_check(self, ua, ua_scalar, nbytes):
+
+        # Check the length of the unicode base type
+        assert_(int(ua.dtype.str[2:]) == self.ulen)
+        # Check the length of the data buffer
+        assert_(buffer_length(ua) == nbytes)
+        # Small check that data in array element is ok
+        assert_(ua_scalar == self.ucs_value*self.ulen)
+        # Encode to UTF-8 and double check
+        assert_(ua_scalar.encode('utf-8') ==
+                        (self.ucs_value*self.ulen).encode('utf-8'))
+        # Check buffer lengths for scalars
+        if self.ucs_value == ucs4_value:
+            # In UCS2, the \U0010FFFF will be represented using a
+            # surrogate *pair*
+            assert_(buffer_length(ua_scalar) == 2*2*self.ulen)
+        else:
+            # In UCS2, the \uFFFF will be represented using a
+            # regular 2-byte word
+            assert_(buffer_length(ua_scalar) == 2*self.ulen)
+
+    def test_values0D(self):
+        # Check creation of 0-dimensional objects with values
+        ua = np.array(self.ucs_value*self.ulen, dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[()], 4*self.ulen)
+
+    def test_valuesSD(self):
+        # Check creation of single-dimensional objects with values
+        ua = np.array([self.ucs_value*self.ulen]*2, dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[0], 4*self.ulen*2)
+        self.content_check(ua, ua[1], 4*self.ulen*2)
+
+    def test_valuesMD(self):
+        # Check creation of multi-dimensional objects with values
+        ua = np.array([[[self.ucs_value*self.ulen]*2]*3]*4, dtype='U%s' % self.ulen)
+        self.content_check(ua, ua[0, 0, 0], 4*self.ulen*2*3*4)
+        self.content_check(ua, ua[-1, -1, -1], 4*self.ulen*2*3*4)
+
+
+class TestCreateValues_1_UCS2(CreateValues):
+    """Check the creation of valued arrays (size 1, UCS2 values)"""
+    ulen = 1
+    ucs_value = ucs2_value
+
+
+class TestCreateValues_1_UCS4(CreateValues):
+    """Check the creation of valued arrays (size 1, UCS4 values)"""
+    ulen = 1
+    ucs_value = ucs4_value
+
+
+class TestCreateValues_2_UCS2(CreateValues):
+    """Check the creation of valued arrays (size 2, UCS2 values)"""
+    ulen = 2
+    ucs_value = ucs2_value
+
+
+class TestCreateValues_2_UCS4(CreateValues):
+    """Check the creation of valued arrays (size 2, UCS4 values)"""
+    ulen = 2
+    ucs_value = ucs4_value
+
+
+class TestCreateValues_1009_UCS2(CreateValues):
+    """Check the creation of valued arrays (size 1009, UCS2 values)"""
+    ulen = 1009
+    ucs_value = ucs2_value
+
+
+class TestCreateValues_1009_UCS4(CreateValues):
+    """Check the creation of valued arrays (size 1009, UCS4 values)"""
+    ulen = 1009
+    ucs_value = ucs4_value
+
+
+############################################################
+#    Assignment tests
+############################################################
+
+class AssignValues:
+    """Check the assignment of unicode arrays with values"""
+
+    def content_check(self, ua, ua_scalar, nbytes):
+
+        # Check the length of the unicode base type
+        assert_(int(ua.dtype.str[2:]) == self.ulen)
+        # Check the length of the data buffer
+        assert_(buffer_length(ua) == nbytes)
+        # Small check that data in array element is ok
+        assert_(ua_scalar == self.ucs_value*self.ulen)
+        # Encode to UTF-8 and double check
+        assert_(ua_scalar.encode('utf-8') ==
+                        (self.ucs_value*self.ulen).encode('utf-8'))
+        # Check buffer lengths for scalars
+        if self.ucs_value == ucs4_value:
+            # In UCS2, the \U0010FFFF will be represented using a
+            # surrogate *pair*
+            assert_(buffer_length(ua_scalar) == 2*2*self.ulen)
+        else:
+            # In UCS2, the \uFFFF will be represented using a
+            # regular 2-byte word
+            assert_(buffer_length(ua_scalar) == 2*self.ulen)
+
+    def test_values0D(self):
+        # Check assignment of 0-dimensional objects with values
+        ua = np.zeros((), dtype='U%s' % self.ulen)
+        ua[()] = self.ucs_value*self.ulen
+        self.content_check(ua, ua[()], 4*self.ulen)
+
+    def test_valuesSD(self):
+        # Check assignment of single-dimensional objects with values
+        ua = np.zeros((2,), dtype='U%s' % self.ulen)
+        ua[0] = self.ucs_value*self.ulen
+        self.content_check(ua, ua[0], 4*self.ulen*2)
+        ua[1] = self.ucs_value*self.ulen
+        self.content_check(ua, ua[1], 4*self.ulen*2)
+
+    def test_valuesMD(self):
+        # Check assignment of multi-dimensional objects with values
+        ua = np.zeros((2, 3, 4), dtype='U%s' % self.ulen)
+        ua[0, 0, 0] = self.ucs_value*self.ulen
+        self.content_check(ua, ua[0, 0, 0], 4*self.ulen*2*3*4)
+        ua[-1, -1, -1] = self.ucs_value*self.ulen
+        self.content_check(ua, ua[-1, -1, -1], 4*self.ulen*2*3*4)
+
+
+class TestAssignValues_1_UCS2(AssignValues):
+    """Check the assignment of valued arrays (size 1, UCS2 values)"""
+    ulen = 1
+    ucs_value = ucs2_value
+
+
+class TestAssignValues_1_UCS4(AssignValues):
+    """Check the assignment of valued arrays (size 1, UCS4 values)"""
+    ulen = 1
+    ucs_value = ucs4_value
+
+
+class TestAssignValues_2_UCS2(AssignValues):
+    """Check the assignment of valued arrays (size 2, UCS2 values)"""
+    ulen = 2
+    ucs_value = ucs2_value
+
+
+class TestAssignValues_2_UCS4(AssignValues):
+    """Check the assignment of valued arrays (size 2, UCS4 values)"""
+    ulen = 2
+    ucs_value = ucs4_value
+
+
+class TestAssignValues_1009_UCS2(AssignValues):
+    """Check the assignment of valued arrays (size 1009, UCS2 values)"""
+    ulen = 1009
+    ucs_value = ucs2_value
+
+
+class TestAssignValues_1009_UCS4(AssignValues):
+    """Check the assignment of valued arrays (size 1009, UCS4 values)"""
+    ulen = 1009
+    ucs_value = ucs4_value
+
+
+############################################################
+#    Byteorder tests
+############################################################
+
+class ByteorderValues:
+    """Check the byteorder of unicode arrays in round-trip conversions"""
+
+    def test_values0D(self):
+        # Check byteorder of 0-dimensional objects
+        ua = np.array(self.ucs_value*self.ulen, dtype='U%s' % self.ulen)
+        ua2 = ua.newbyteorder()
+        # This changes the interpretation of the data region (but not the
+        #  actual data), therefore the returned scalars are not
+        #  the same (they are byte-swapped versions of each other).
+        assert_(ua[()] != ua2[()])
+        ua3 = ua2.newbyteorder()
+        # Arrays must be equal after the round-trip
+        assert_equal(ua, ua3)
+
+    def test_valuesSD(self):
+        # Check byteorder of single-dimensional objects
+        ua = np.array([self.ucs_value*self.ulen]*2, dtype='U%s' % self.ulen)
+        ua2 = ua.newbyteorder()
+        assert_((ua != ua2).all())
+        assert_(ua[-1] != ua2[-1])
+        ua3 = ua2.newbyteorder()
+        # Arrays must be equal after the round-trip
+        assert_equal(ua, ua3)
+
+    def test_valuesMD(self):
+        # Check byteorder of multi-dimensional objects
+        ua = np.array([[[self.ucs_value*self.ulen]*2]*3]*4,
+                      dtype='U%s' % self.ulen)
+        ua2 = ua.newbyteorder()
+        assert_((ua != ua2).all())
+        assert_(ua[-1, -1, -1] != ua2[-1, -1, -1])
+        ua3 = ua2.newbyteorder()
+        # Arrays must be equal after the round-trip
+        assert_equal(ua, ua3)
+
+    def test_values_cast(self):
+        # Check byteorder of when casting the array for a strided and
+        # contiguous array:
+        test1 = np.array([self.ucs_value*self.ulen]*2, dtype='U%s' % self.ulen)
+        test2 = np.repeat(test1, 2)[::2]
+        for ua in (test1, test2):
+            ua2 = ua.astype(dtype=ua.dtype.newbyteorder())
+            assert_((ua == ua2).all())
+            assert_(ua[-1] == ua2[-1])
+            ua3 = ua2.astype(dtype=ua.dtype)
+            # Arrays must be equal after the round-trip
+            assert_equal(ua, ua3)
+
+    def test_values_updowncast(self):
+        # Check byteorder of when casting the array to a longer and shorter
+        # string length for strided and contiguous arrays
+        test1 = np.array([self.ucs_value*self.ulen]*2, dtype='U%s' % self.ulen)
+        test2 = np.repeat(test1, 2)[::2]
+        for ua in (test1, test2):
+            # Cast to a longer type with zero padding
+            longer_type = np.dtype('U%s' % (self.ulen+1)).newbyteorder()
+            ua2 = ua.astype(dtype=longer_type)
+            assert_((ua == ua2).all())
+            assert_(ua[-1] == ua2[-1])
+            # Cast back again with truncating:
+            ua3 = ua2.astype(dtype=ua.dtype)
+            # Arrays must be equal after the round-trip
+            assert_equal(ua, ua3)
+
+
+class TestByteorder_1_UCS2(ByteorderValues):
+    """Check the byteorder in unicode (size 1, UCS2 values)"""
+    ulen = 1
+    ucs_value = ucs2_value
+
+
+class TestByteorder_1_UCS4(ByteorderValues):
+    """Check the byteorder in unicode (size 1, UCS4 values)"""
+    ulen = 1
+    ucs_value = ucs4_value
+
+
+class TestByteorder_2_UCS2(ByteorderValues):
+    """Check the byteorder in unicode (size 2, UCS2 values)"""
+    ulen = 2
+    ucs_value = ucs2_value
+
+
+class TestByteorder_2_UCS4(ByteorderValues):
+    """Check the byteorder in unicode (size 2, UCS4 values)"""
+    ulen = 2
+    ucs_value = ucs4_value
+
+
+class TestByteorder_1009_UCS2(ByteorderValues):
+    """Check the byteorder in unicode (size 1009, UCS2 values)"""
+    ulen = 1009
+    ucs_value = ucs2_value
+
+
+class TestByteorder_1009_UCS4(ByteorderValues):
+    """Check the byteorder in unicode (size 1009, UCS4 values)"""
+    ulen = 1009
+    ucs_value = ucs4_value
diff --git a/venv/Lib/site-packages/numpy/core/umath.py b/venv/Lib/site-packages/numpy/core/umath.py
new file mode 100644
index 000000000..6a5474ffe
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/umath.py
@@ -0,0 +1,36 @@
+"""
+Create the numpy.core.umath namespace for backward compatibility. In v1.16
+the multiarray and umath c-extension modules were merged into a single
+_multiarray_umath extension module. So we replicate the old namespace
+by importing from the extension module.
+
+"""
+
+from . import _multiarray_umath
+from ._multiarray_umath import *  # noqa: F403
+# These imports are needed for backward compatibility,
+# do not change them. issue gh-11862
+# _ones_like is semi-public, on purpose not added to __all__
+from ._multiarray_umath import _UFUNC_API, _add_newdoc_ufunc, _ones_like
+
+__all__ = [
+    '_UFUNC_API', 'ERR_CALL', 'ERR_DEFAULT', 'ERR_IGNORE', 'ERR_LOG',
+    'ERR_PRINT', 'ERR_RAISE', 'ERR_WARN', 'FLOATING_POINT_SUPPORT',
+    'FPE_DIVIDEBYZERO', 'FPE_INVALID', 'FPE_OVERFLOW', 'FPE_UNDERFLOW', 'NAN',
+    'NINF', 'NZERO', 'PINF', 'PZERO', 'SHIFT_DIVIDEBYZERO', 'SHIFT_INVALID',
+    'SHIFT_OVERFLOW', 'SHIFT_UNDERFLOW', 'UFUNC_BUFSIZE_DEFAULT',
+    'UFUNC_PYVALS_NAME', '_add_newdoc_ufunc', 'absolute', 'add',
+    'arccos', 'arccosh', 'arcsin', 'arcsinh', 'arctan', 'arctan2', 'arctanh',
+    'bitwise_and', 'bitwise_or', 'bitwise_xor', 'cbrt', 'ceil', 'conj',
+    'conjugate', 'copysign', 'cos', 'cosh', 'deg2rad', 'degrees', 'divide',
+    'divmod', 'e', 'equal', 'euler_gamma', 'exp', 'exp2', 'expm1', 'fabs',
+    'floor', 'floor_divide', 'float_power', 'fmax', 'fmin', 'fmod', 'frexp',
+    'frompyfunc', 'gcd', 'geterrobj', 'greater', 'greater_equal', 'heaviside',
+    'hypot', 'invert', 'isfinite', 'isinf', 'isnan', 'isnat', 'lcm', 'ldexp',
+    'left_shift', 'less', 'less_equal', 'log', 'log10', 'log1p', 'log2',
+    'logaddexp', 'logaddexp2', 'logical_and', 'logical_not', 'logical_or',
+    'logical_xor', 'maximum', 'minimum', 'mod', 'modf', 'multiply', 'negative',
+    'nextafter', 'not_equal', 'pi', 'positive', 'power', 'rad2deg', 'radians',
+    'reciprocal', 'remainder', 'right_shift', 'rint', 'seterrobj', 'sign',
+    'signbit', 'sin', 'sinh', 'spacing', 'sqrt', 'square', 'subtract', 'tan',
+    'tanh', 'true_divide', 'trunc']
diff --git a/venv/Lib/site-packages/numpy/core/umath_tests.py b/venv/Lib/site-packages/numpy/core/umath_tests.py
new file mode 100644
index 000000000..90ab17e67
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/core/umath_tests.py
@@ -0,0 +1,13 @@
+"""
+Shim for _umath_tests to allow a deprecation period for the new name.
+
+"""
+import warnings
+
+# 2018-04-04, numpy 1.15.0
+warnings.warn(("numpy.core.umath_tests is an internal NumPy "
+               "module and should not be imported. It will "
+               "be removed in a future NumPy release."),
+              category=DeprecationWarning, stacklevel=2)
+
+from ._umath_tests import *
diff --git a/venv/Lib/site-packages/numpy/ctypeslib.py b/venv/Lib/site-packages/numpy/ctypeslib.py
new file mode 100644
index 000000000..ec3cdc33d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ctypeslib.py
@@ -0,0 +1,542 @@
+"""
+============================
+``ctypes`` Utility Functions
+============================
+
+See Also
+---------
+load_library : Load a C library.
+ndpointer : Array restype/argtype with verification.
+as_ctypes : Create a ctypes array from an ndarray.
+as_array : Create an ndarray from a ctypes array.
+
+References
+----------
+.. [1] "SciPy Cookbook: ctypes", https://scipy-cookbook.readthedocs.io/items/Ctypes.html
+
+Examples
+--------
+Load the C library:
+
+>>> _lib = np.ctypeslib.load_library('libmystuff', '.')     #doctest: +SKIP
+
+Our result type, an ndarray that must be of type double, be 1-dimensional
+and is C-contiguous in memory:
+
+>>> array_1d_double = np.ctypeslib.ndpointer(
+...                          dtype=np.double,
+...                          ndim=1, flags='CONTIGUOUS')    #doctest: +SKIP
+
+Our C-function typically takes an array and updates its values
+in-place.  For example::
+
+    void foo_func(double* x, int length)
+    {
+        int i;
+        for (i = 0; i < length; i++) {
+            x[i] = i*i;
+        }
+    }
+
+We wrap it using:
+
+>>> _lib.foo_func.restype = None                      #doctest: +SKIP
+>>> _lib.foo_func.argtypes = [array_1d_double, c_int] #doctest: +SKIP
+
+Then, we're ready to call ``foo_func``:
+
+>>> out = np.empty(15, dtype=np.double)
+>>> _lib.foo_func(out, len(out))                #doctest: +SKIP
+
+"""
+__all__ = ['load_library', 'ndpointer', 'ctypes_load_library',
+           'c_intp', 'as_ctypes', 'as_array']
+
+import os
+from numpy import (
+    integer, ndarray, dtype as _dtype, deprecate, array, frombuffer
+)
+from numpy.core.multiarray import _flagdict, flagsobj
+
+try:
+    import ctypes
+except ImportError:
+    ctypes = None
+
+if ctypes is None:
+    def _dummy(*args, **kwds):
+        """
+        Dummy object that raises an ImportError if ctypes is not available.
+
+        Raises
+        ------
+        ImportError
+            If ctypes is not available.
+
+        """
+        raise ImportError("ctypes is not available.")
+    ctypes_load_library = _dummy
+    load_library = _dummy
+    as_ctypes = _dummy
+    as_array = _dummy
+    from numpy import intp as c_intp
+    _ndptr_base = object
+else:
+    import numpy.core._internal as nic
+    c_intp = nic._getintp_ctype()
+    del nic
+    _ndptr_base = ctypes.c_void_p
+
+    # Adapted from Albert Strasheim
+    def load_library(libname, loader_path):
+        """
+        It is possible to load a library using
+        >>> lib = ctypes.cdll[<full_path_name>] # doctest: +SKIP
+
+        But there are cross-platform considerations, such as library file extensions,
+        plus the fact Windows will just load the first library it finds with that name.
+        NumPy supplies the load_library function as a convenience.
+
+        Parameters
+        ----------
+        libname : str
+            Name of the library, which can have 'lib' as a prefix,
+            but without an extension.
+        loader_path : str
+            Where the library can be found.
+
+        Returns
+        -------
+        ctypes.cdll[libpath] : library object
+           A ctypes library object
+
+        Raises
+        ------
+        OSError
+            If there is no library with the expected extension, or the
+            library is defective and cannot be loaded.
+        """
+        if ctypes.__version__ < '1.0.1':
+            import warnings
+            warnings.warn("All features of ctypes interface may not work "
+                          "with ctypes < 1.0.1", stacklevel=2)
+
+        ext = os.path.splitext(libname)[1]
+        if not ext:
+            # Try to load library with platform-specific name, otherwise
+            # default to libname.[so|pyd].  Sometimes, these files are built
+            # erroneously on non-linux platforms.
+            from numpy.distutils.misc_util import get_shared_lib_extension
+            so_ext = get_shared_lib_extension()
+            libname_ext = [libname + so_ext]
+            # mac, windows and linux >= py3.2 shared library and loadable
+            # module have different extensions so try both
+            so_ext2 = get_shared_lib_extension(is_python_ext=True)
+            if not so_ext2 == so_ext:
+                libname_ext.insert(0, libname + so_ext2)
+        else:
+            libname_ext = [libname]
+
+        loader_path = os.path.abspath(loader_path)
+        if not os.path.isdir(loader_path):
+            libdir = os.path.dirname(loader_path)
+        else:
+            libdir = loader_path
+
+        for ln in libname_ext:
+            libpath = os.path.join(libdir, ln)
+            if os.path.exists(libpath):
+                try:
+                    return ctypes.cdll[libpath]
+                except OSError:
+                    ## defective lib file
+                    raise
+        ## if no successful return in the libname_ext loop:
+        raise OSError("no file with expected extension")
+
+    ctypes_load_library = deprecate(load_library, 'ctypes_load_library',
+                                    'load_library')
+
+def _num_fromflags(flaglist):
+    num = 0
+    for val in flaglist:
+        num += _flagdict[val]
+    return num
+
+_flagnames = ['C_CONTIGUOUS', 'F_CONTIGUOUS', 'ALIGNED', 'WRITEABLE',
+              'OWNDATA', 'UPDATEIFCOPY', 'WRITEBACKIFCOPY']
+def _flags_fromnum(num):
+    res = []
+    for key in _flagnames:
+        value = _flagdict[key]
+        if (num & value):
+            res.append(key)
+    return res
+
+
+class _ndptr(_ndptr_base):
+    @classmethod
+    def from_param(cls, obj):
+        if not isinstance(obj, ndarray):
+            raise TypeError("argument must be an ndarray")
+        if cls._dtype_ is not None \
+               and obj.dtype != cls._dtype_:
+            raise TypeError("array must have data type %s" % cls._dtype_)
+        if cls._ndim_ is not None \
+               and obj.ndim != cls._ndim_:
+            raise TypeError("array must have %d dimension(s)" % cls._ndim_)
+        if cls._shape_ is not None \
+               and obj.shape != cls._shape_:
+            raise TypeError("array must have shape %s" % str(cls._shape_))
+        if cls._flags_ is not None \
+               and ((obj.flags.num & cls._flags_) != cls._flags_):
+            raise TypeError("array must have flags %s" %
+                    _flags_fromnum(cls._flags_))
+        return obj.ctypes
+
+
+class _concrete_ndptr(_ndptr):
+    """
+    Like _ndptr, but with `_shape_` and `_dtype_` specified.
+
+    Notably, this means the pointer has enough information to reconstruct
+    the array, which is not generally true.
+    """
+    def _check_retval_(self):
+        """
+        This method is called when this class is used as the .restype
+        attribute for a shared-library function, to automatically wrap the
+        pointer into an array.
+        """
+        return self.contents
+
+    @property
+    def contents(self):
+        """
+        Get an ndarray viewing the data pointed to by this pointer.
+
+        This mirrors the `contents` attribute of a normal ctypes pointer
+        """
+        full_dtype = _dtype((self._dtype_, self._shape_))
+        full_ctype = ctypes.c_char * full_dtype.itemsize
+        buffer = ctypes.cast(self, ctypes.POINTER(full_ctype)).contents
+        return frombuffer(buffer, dtype=full_dtype).squeeze(axis=0)
+
+
+# Factory for an array-checking class with from_param defined for
+#  use with ctypes argtypes mechanism
+_pointer_type_cache = {}
+def ndpointer(dtype=None, ndim=None, shape=None, flags=None):
+    """
+    Array-checking restype/argtypes.
+
+    An ndpointer instance is used to describe an ndarray in restypes
+    and argtypes specifications.  This approach is more flexible than
+    using, for example, ``POINTER(c_double)``, since several restrictions
+    can be specified, which are verified upon calling the ctypes function.
+    These include data type, number of dimensions, shape and flags.  If a
+    given array does not satisfy the specified restrictions,
+    a ``TypeError`` is raised.
+
+    Parameters
+    ----------
+    dtype : data-type, optional
+        Array data-type.
+    ndim : int, optional
+        Number of array dimensions.
+    shape : tuple of ints, optional
+        Array shape.
+    flags : str or tuple of str
+        Array flags; may be one or more of:
+
+          - C_CONTIGUOUS / C / CONTIGUOUS
+          - F_CONTIGUOUS / F / FORTRAN
+          - OWNDATA / O
+          - WRITEABLE / W
+          - ALIGNED / A
+          - WRITEBACKIFCOPY / X
+          - UPDATEIFCOPY / U
+
+    Returns
+    -------
+    klass : ndpointer type object
+        A type object, which is an ``_ndtpr`` instance containing
+        dtype, ndim, shape and flags information.
+
+    Raises
+    ------
+    TypeError
+        If a given array does not satisfy the specified restrictions.
+
+    Examples
+    --------
+    >>> clib.somefunc.argtypes = [np.ctypeslib.ndpointer(dtype=np.float64,
+    ...                                                  ndim=1,
+    ...                                                  flags='C_CONTIGUOUS')]
+    ... #doctest: +SKIP
+    >>> clib.somefunc(np.array([1, 2, 3], dtype=np.float64))
+    ... #doctest: +SKIP
+
+    """
+
+    # normalize dtype to an Optional[dtype]
+    if dtype is not None:
+        dtype = _dtype(dtype)
+
+    # normalize flags to an Optional[int]
+    num = None
+    if flags is not None:
+        if isinstance(flags, str):
+            flags = flags.split(',')
+        elif isinstance(flags, (int, integer)):
+            num = flags
+            flags = _flags_fromnum(num)
+        elif isinstance(flags, flagsobj):
+            num = flags.num
+            flags = _flags_fromnum(num)
+        if num is None:
+            try:
+                flags = [x.strip().upper() for x in flags]
+            except Exception:
+                raise TypeError("invalid flags specification")
+            num = _num_fromflags(flags)
+
+    # normalize shape to an Optional[tuple]
+    if shape is not None:
+        try:
+            shape = tuple(shape)
+        except TypeError:
+            # single integer -> 1-tuple
+            shape = (shape,)
+
+    cache_key = (dtype, ndim, shape, num)
+
+    try:
+        return _pointer_type_cache[cache_key]
+    except KeyError:
+        pass
+
+    # produce a name for the new type
+    if dtype is None:
+        name = 'any'
+    elif dtype.names is not None:
+        name = str(id(dtype))
+    else:
+        name = dtype.str
+    if ndim is not None:
+        name += "_%dd" % ndim
+    if shape is not None:
+        name += "_"+"x".join(str(x) for x in shape)
+    if flags is not None:
+        name += "_"+"_".join(flags)
+
+    if dtype is not None and shape is not None:
+        base = _concrete_ndptr
+    else:
+        base = _ndptr
+
+    klass = type("ndpointer_%s"%name, (base,),
+                 {"_dtype_": dtype,
+                  "_shape_" : shape,
+                  "_ndim_" : ndim,
+                  "_flags_" : num})
+    _pointer_type_cache[cache_key] = klass
+    return klass
+
+
+if ctypes is not None:
+    def _ctype_ndarray(element_type, shape):
+        """ Create an ndarray of the given element type and shape """
+        for dim in shape[::-1]:
+            element_type = dim * element_type
+            # prevent the type name include np.ctypeslib
+            element_type.__module__ = None
+        return element_type
+
+
+    def _get_scalar_type_map():
+        """
+        Return a dictionary mapping native endian scalar dtype to ctypes types
+        """
+        ct = ctypes
+        simple_types = [
+            ct.c_byte, ct.c_short, ct.c_int, ct.c_long, ct.c_longlong,
+            ct.c_ubyte, ct.c_ushort, ct.c_uint, ct.c_ulong, ct.c_ulonglong,
+            ct.c_float, ct.c_double,
+            ct.c_bool,
+        ]
+        return {_dtype(ctype): ctype for ctype in simple_types}
+
+
+    _scalar_type_map = _get_scalar_type_map()
+
+
+    def _ctype_from_dtype_scalar(dtype):
+        # swapping twice ensure that `=` is promoted to <, >, or |
+        dtype_with_endian = dtype.newbyteorder('S').newbyteorder('S')
+        dtype_native = dtype.newbyteorder('=')
+        try:
+            ctype = _scalar_type_map[dtype_native]
+        except KeyError:
+            raise NotImplementedError(
+                "Converting {!r} to a ctypes type".format(dtype)
+            )
+
+        if dtype_with_endian.byteorder == '>':
+            ctype = ctype.__ctype_be__
+        elif dtype_with_endian.byteorder == '<':
+            ctype = ctype.__ctype_le__
+
+        return ctype
+
+
+    def _ctype_from_dtype_subarray(dtype):
+        element_dtype, shape = dtype.subdtype
+        ctype = _ctype_from_dtype(element_dtype)
+        return _ctype_ndarray(ctype, shape)
+
+
+    def _ctype_from_dtype_structured(dtype):
+        # extract offsets of each field
+        field_data = []
+        for name in dtype.names:
+            field_dtype, offset = dtype.fields[name][:2]
+            field_data.append((offset, name, _ctype_from_dtype(field_dtype)))
+
+        # ctypes doesn't care about field order
+        field_data = sorted(field_data, key=lambda f: f[0])
+
+        if len(field_data) > 1 and all(offset == 0 for offset, name, ctype in field_data):
+            # union, if multiple fields all at address 0
+            size = 0
+            _fields_ = []
+            for offset, name, ctype in field_data:
+                _fields_.append((name, ctype))
+                size = max(size, ctypes.sizeof(ctype))
+
+            # pad to the right size
+            if dtype.itemsize != size:
+                _fields_.append(('', ctypes.c_char * dtype.itemsize))
+
+            # we inserted manual padding, so always `_pack_`
+            return type('union', (ctypes.Union,), dict(
+                _fields_=_fields_,
+                _pack_=1,
+                __module__=None,
+            ))
+        else:
+            last_offset = 0
+            _fields_ = []
+            for offset, name, ctype in field_data:
+                padding = offset - last_offset
+                if padding < 0:
+                    raise NotImplementedError("Overlapping fields")
+                if padding > 0:
+                    _fields_.append(('', ctypes.c_char * padding))
+
+                _fields_.append((name, ctype))
+                last_offset = offset + ctypes.sizeof(ctype)
+
+
+            padding = dtype.itemsize - last_offset
+            if padding > 0:
+                _fields_.append(('', ctypes.c_char * padding))
+
+            # we inserted manual padding, so always `_pack_`
+            return type('struct', (ctypes.Structure,), dict(
+                _fields_=_fields_,
+                _pack_=1,
+                __module__=None,
+            ))
+
+
+    def _ctype_from_dtype(dtype):
+        if dtype.fields is not None:
+            return _ctype_from_dtype_structured(dtype)
+        elif dtype.subdtype is not None:
+            return _ctype_from_dtype_subarray(dtype)
+        else:
+            return _ctype_from_dtype_scalar(dtype)
+
+
+    def as_ctypes_type(dtype):
+        r"""
+        Convert a dtype into a ctypes type.
+
+        Parameters
+        ----------
+        dtype : dtype
+            The dtype to convert
+
+        Returns
+        -------
+        ctype
+            A ctype scalar, union, array, or struct
+
+        Raises
+        ------
+        NotImplementedError
+            If the conversion is not possible
+
+        Notes
+        -----
+        This function does not losslessly round-trip in either direction.
+
+        ``np.dtype(as_ctypes_type(dt))`` will:
+
+         - insert padding fields
+         - reorder fields to be sorted by offset
+         - discard field titles
+
+        ``as_ctypes_type(np.dtype(ctype))`` will:
+
+         - discard the class names of `ctypes.Structure`\ s and
+           `ctypes.Union`\ s
+         - convert single-element `ctypes.Union`\ s into single-element
+           `ctypes.Structure`\ s
+         - insert padding fields
+
+        """
+        return _ctype_from_dtype(_dtype(dtype))
+
+
+    def as_array(obj, shape=None):
+        """
+        Create a numpy array from a ctypes array or POINTER.
+
+        The numpy array shares the memory with the ctypes object.
+
+        The shape parameter must be given if converting from a ctypes POINTER.
+        The shape parameter is ignored if converting from a ctypes array
+        """
+        if isinstance(obj, ctypes._Pointer):
+            # convert pointers to an array of the desired shape
+            if shape is None:
+                raise TypeError(
+                    'as_array() requires a shape argument when called on a '
+                    'pointer')
+            p_arr_type = ctypes.POINTER(_ctype_ndarray(obj._type_, shape))
+            obj = ctypes.cast(obj, p_arr_type).contents
+
+        return array(obj, copy=False)
+
+
+    def as_ctypes(obj):
+        """Create and return a ctypes object from a numpy array.  Actually
+        anything that exposes the __array_interface__ is accepted."""
+        ai = obj.__array_interface__
+        if ai["strides"]:
+            raise TypeError("strided arrays not supported")
+        if ai["version"] != 3:
+            raise TypeError("only __array_interface__ version 3 supported")
+        addr, readonly = ai["data"]
+        if readonly:
+            raise TypeError("readonly arrays unsupported")
+
+        # can't use `_dtype((ai["typestr"], ai["shape"]))` here, as it overflows
+        # dtype.itemsize (gh-14214)
+        ctype_scalar = as_ctypes_type(ai["typestr"])
+        result_type = _ctype_ndarray(ctype_scalar, ai["shape"])
+        result = result_type.from_address(addr)
+        result.__keep = obj
+        return result
diff --git a/venv/Lib/site-packages/numpy/distutils/__config__.py b/venv/Lib/site-packages/numpy/distutils/__config__.py
new file mode 100644
index 000000000..142f63a8e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/__config__.py
@@ -0,0 +1,77 @@
+# This file is generated by numpy's setup.py
+# It contains system_info results at the time of building this package.
+__all__ = ["get_info","show"]
+
+
+import os
+import sys
+
+extra_dll_dir = os.path.join(os.path.dirname(__file__), '.libs')
+
+if sys.platform == 'win32' and os.path.isdir(extra_dll_dir):
+    if sys.version_info >= (3, 8):
+        os.add_dll_directory(extra_dll_dir)
+    else:
+        os.environ.setdefault('PATH', '')
+        os.environ['PATH'] += os.pathsep + extra_dll_dir
+
+blas_mkl_info={}
+blis_info={}
+openblas_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_info'], 'libraries': ['openblas_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+blas_opt_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_info'], 'libraries': ['openblas_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+lapack_mkl_info={}
+openblas_lapack_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_lapack_info'], 'libraries': ['openblas_lapack_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+lapack_opt_info={'library_dirs': ['D:\\a\\1\\s\\numpy\\build\\openblas_lapack_info'], 'libraries': ['openblas_lapack_info'], 'language': 'f77', 'define_macros': [('HAVE_CBLAS', None)]}
+
+def get_info(name):
+    g = globals()
+    return g.get(name, g.get(name + "_info", {}))
+
+def show():
+    """
+    Show libraries in the system on which NumPy was built.
+
+    Print information about various resources (libraries, library
+    directories, include directories, etc.) in the system on which
+    NumPy was built.
+
+    See Also
+    --------
+    get_include : Returns the directory containing NumPy C
+                  header files.
+
+    Notes
+    -----
+    Classes specifying the information to be printed are defined
+    in the `numpy.distutils.system_info` module.
+
+    Information may include:
+
+    * ``language``: language used to write the libraries (mostly
+      C or f77)
+    * ``libraries``: names of libraries found in the system
+    * ``library_dirs``: directories containing the libraries
+    * ``include_dirs``: directories containing library header files
+    * ``src_dirs``: directories containing library source files
+    * ``define_macros``: preprocessor macros used by
+      ``distutils.setup``
+
+    Examples
+    --------
+    >>> np.show_config()
+    blas_opt_info:
+        language = c
+        define_macros = [('HAVE_CBLAS', None)]
+        libraries = ['openblas', 'openblas']
+        library_dirs = ['/usr/local/lib']
+    """
+    for name,info_dict in globals().items():
+        if name[0] == "_" or type(info_dict) is not type({}): continue
+        print(name + ":")
+        if not info_dict:
+            print("  NOT AVAILABLE")
+        for k,v in info_dict.items():
+            v = str(v)
+            if k == "sources" and len(v) > 200:
+                v = v[:60] + " ...\n... " + v[-60:]
+            print("    %s = %s" % (k,v))
diff --git a/venv/Lib/site-packages/numpy/distutils/__init__.py b/venv/Lib/site-packages/numpy/distutils/__init__.py
new file mode 100644
index 000000000..79974d1c2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/__init__.py
@@ -0,0 +1,51 @@
+"""
+An enhanced distutils, providing support for Fortran compilers, for BLAS,
+LAPACK and other common libraries for numerical computing, and more.
+
+Public submodules are::
+
+    misc_util
+    system_info
+    cpu_info
+    log
+    exec_command
+
+For details, please see the *Packaging* and *NumPy Distutils User Guide*
+sections of the NumPy Reference Guide.
+
+For configuring the preference for and location of libraries like BLAS and
+LAPACK, and for setting include paths and similar build options, please see
+``site.cfg.example`` in the root of the NumPy repository or sdist.
+
+"""
+
+# Must import local ccompiler ASAP in order to get
+# customized CCompiler.spawn effective.
+from . import ccompiler
+from . import unixccompiler
+
+from .npy_pkg_config import *
+
+# If numpy is installed, add distutils.test()
+try:
+    from . import __config__
+    # Normally numpy is installed if the above import works, but an interrupted
+    # in-place build could also have left a __config__.py.  In that case the
+    # next import may still fail, so keep it inside the try block.
+    from numpy._pytesttester import PytestTester
+    test = PytestTester(__name__)
+    del PytestTester
+except ImportError:
+    pass
+
+
+def customized_fcompiler(plat=None, compiler=None):
+    from numpy.distutils.fcompiler import new_fcompiler
+    c = new_fcompiler(plat=plat, compiler=compiler)
+    c.customize()
+    return c
+
+def customized_ccompiler(plat=None, compiler=None, verbose=1):
+    c = ccompiler.new_compiler(plat=plat, compiler=compiler, verbose=verbose)
+    c.customize('')
+    return c
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/__config__.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/__config__.cpython-36.pyc
new file mode 100644
index 000000000..dbf903a93
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/__config__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..0c2eda594
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/_shell_utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/_shell_utils.cpython-36.pyc
new file mode 100644
index 000000000..c9095be98
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/_shell_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/ccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/ccompiler.cpython-36.pyc
new file mode 100644
index 000000000..18d47883a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/ccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/conv_template.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/conv_template.cpython-36.pyc
new file mode 100644
index 000000000..548a89b59
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/conv_template.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/core.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/core.cpython-36.pyc
new file mode 100644
index 000000000..68f4739a5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/cpuinfo.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/cpuinfo.cpython-36.pyc
new file mode 100644
index 000000000..c9454ea31
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/cpuinfo.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/exec_command.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/exec_command.cpython-36.pyc
new file mode 100644
index 000000000..410d263ab
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/exec_command.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/extension.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/extension.cpython-36.pyc
new file mode 100644
index 000000000..2f6a4288b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/extension.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/from_template.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/from_template.cpython-36.pyc
new file mode 100644
index 000000000..016af020a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/from_template.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/intelccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/intelccompiler.cpython-36.pyc
new file mode 100644
index 000000000..c13e93b66
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/intelccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/lib2def.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/lib2def.cpython-36.pyc
new file mode 100644
index 000000000..cc6a0edf5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/lib2def.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/line_endings.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/line_endings.cpython-36.pyc
new file mode 100644
index 000000000..92258f95a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/line_endings.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/log.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/log.cpython-36.pyc
new file mode 100644
index 000000000..7409c1a8a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/log.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/mingw32ccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/mingw32ccompiler.cpython-36.pyc
new file mode 100644
index 000000000..abdc4de3c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/mingw32ccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/misc_util.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/misc_util.cpython-36.pyc
new file mode 100644
index 000000000..57412f0c6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/misc_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/msvc9compiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/msvc9compiler.cpython-36.pyc
new file mode 100644
index 000000000..bca5ce2dd
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/msvc9compiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/msvccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/msvccompiler.cpython-36.pyc
new file mode 100644
index 000000000..e7fcbc631
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/msvccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/npy_pkg_config.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/npy_pkg_config.cpython-36.pyc
new file mode 100644
index 000000000..fe8d10e9c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/npy_pkg_config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/numpy_distribution.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/numpy_distribution.cpython-36.pyc
new file mode 100644
index 000000000..dd011093f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/numpy_distribution.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/pathccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/pathccompiler.cpython-36.pyc
new file mode 100644
index 000000000..00fd0b7b6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/pathccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..c987284c8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/system_info.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/system_info.cpython-36.pyc
new file mode 100644
index 000000000..df70c0ca0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/system_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/__pycache__/unixccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/__pycache__/unixccompiler.cpython-36.pyc
new file mode 100644
index 000000000..52d63351d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/__pycache__/unixccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/_shell_utils.py b/venv/Lib/site-packages/numpy/distutils/_shell_utils.py
new file mode 100644
index 000000000..82abd5f4e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/_shell_utils.py
@@ -0,0 +1,91 @@
+"""
+Helper functions for interacting with the shell, and consuming shell-style
+parameters provided in config files.
+"""
+import os
+import shlex
+import subprocess
+try:
+    from shlex import quote
+except ImportError:
+    from pipes import quote
+
+__all__ = ['WindowsParser', 'PosixParser', 'NativeParser']
+
+
+class CommandLineParser:
+    """
+    An object that knows how to split and join command-line arguments.
+
+    It must be true that ``argv == split(join(argv))`` for all ``argv``.
+    The reverse neednt be true - `join(split(cmd))` may result in the addition
+    or removal of unnecessary escaping.
+    """
+    @staticmethod
+    def join(argv):
+        """ Join a list of arguments into a command line string """
+        raise NotImplementedError
+
+    @staticmethod
+    def split(cmd):
+        """ Split a command line string into a list of arguments """
+        raise NotImplementedError
+
+
+class WindowsParser:
+    """
+    The parsing behavior used by `subprocess.call("string")` on Windows, which
+    matches the Microsoft C/C++ runtime.
+
+    Note that this is _not_ the behavior of cmd.
+    """
+    @staticmethod
+    def join(argv):
+        # note that list2cmdline is specific to the windows syntax
+        return subprocess.list2cmdline(argv)
+
+    @staticmethod
+    def split(cmd):
+        import ctypes  # guarded import for systems without ctypes
+        try:
+            ctypes.windll
+        except AttributeError:
+            raise NotImplementedError
+
+        # Windows has special parsing rules for the executable (no quotes),
+        # that we do not care about - insert a dummy element
+        if not cmd:
+            return []
+        cmd = 'dummy ' + cmd
+
+        CommandLineToArgvW = ctypes.windll.shell32.CommandLineToArgvW
+        CommandLineToArgvW.restype = ctypes.POINTER(ctypes.c_wchar_p)
+        CommandLineToArgvW.argtypes = (ctypes.c_wchar_p, ctypes.POINTER(ctypes.c_int))
+
+        nargs = ctypes.c_int()
+        lpargs = CommandLineToArgvW(cmd, ctypes.byref(nargs))
+        args = [lpargs[i] for i in range(nargs.value)]
+        assert not ctypes.windll.kernel32.LocalFree(lpargs)
+
+        # strip the element we inserted
+        assert args[0] == "dummy"
+        return args[1:]
+
+
+class PosixParser:
+    """
+    The parsing behavior used by `subprocess.call("string", shell=True)` on Posix.
+    """
+    @staticmethod
+    def join(argv):
+        return ' '.join(quote(arg) for arg in argv)
+
+    @staticmethod
+    def split(cmd):
+        return shlex.split(cmd, posix=True)
+
+
+if os.name == 'nt':
+    NativeParser = WindowsParser
+elif os.name == 'posix':
+    NativeParser = PosixParser
diff --git a/venv/Lib/site-packages/numpy/distutils/ccompiler.py b/venv/Lib/site-packages/numpy/distutils/ccompiler.py
new file mode 100644
index 000000000..9ea083774
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/ccompiler.py
@@ -0,0 +1,799 @@
+import os
+import re
+import sys
+import shlex
+import time
+import subprocess
+from copy import copy
+from distutils import ccompiler
+from distutils.ccompiler import (
+    compiler_class, gen_lib_options, get_default_compiler, new_compiler,
+    CCompiler
+)
+from distutils.errors import (
+    DistutilsExecError, DistutilsModuleError, DistutilsPlatformError,
+    CompileError, UnknownFileError
+)
+from distutils.sysconfig import customize_compiler
+from distutils.version import LooseVersion
+
+from numpy.distutils import log
+from numpy.distutils.exec_command import (
+    filepath_from_subprocess_output, forward_bytes_to_stdout
+)
+from numpy.distutils.misc_util import cyg2win32, is_sequence, mingw32, \
+                                      get_num_build_jobs, \
+                                      _commandline_dep_string
+
+# globals for parallel build management
+try:
+    import threading
+except ImportError:
+    import dummy_threading as threading
+_job_semaphore = None
+_global_lock = threading.Lock()
+_processing_files = set()
+
+
+def _needs_build(obj, cc_args, extra_postargs, pp_opts):
+    """
+    Check if an objects needs to be rebuild based on its dependencies
+
+    Parameters
+    ----------
+    obj : str
+        object file
+
+    Returns
+    -------
+    bool
+    """
+    # defined in unixcompiler.py
+    dep_file = obj + '.d'
+    if not os.path.exists(dep_file):
+        return True
+
+    # dep_file is a makefile containing 'object: dependencies'
+    # formatted like posix shell (spaces escaped, \ line continuations)
+    # the last line contains the compiler commandline arguments as some
+    # projects may compile an extension multiple times with different
+    # arguments
+    with open(dep_file, "r") as f:
+        lines = f.readlines()
+
+    cmdline =_commandline_dep_string(cc_args, extra_postargs, pp_opts)
+    last_cmdline = lines[-1]
+    if last_cmdline != cmdline:
+        return True
+
+    contents = ''.join(lines[:-1])
+    deps = [x for x in shlex.split(contents, posix=True)
+            if x != "\n" and not x.endswith(":")]
+
+    try:
+        t_obj = os.stat(obj).st_mtime
+
+        # check if any of the dependencies is newer than the object
+        # the dependencies includes the source used to create the object
+        for f in deps:
+            if os.stat(f).st_mtime > t_obj:
+                return True
+    except OSError:
+        # no object counts as newer (shouldn't happen if dep_file exists)
+        return True
+
+    return False
+
+
+def replace_method(klass, method_name, func):
+    # Py3k does not have unbound method anymore, MethodType does not work
+    m = lambda self, *args, **kw: func(self, *args, **kw)
+    setattr(klass, method_name, m)
+
+
+######################################################################
+## Method that subclasses may redefine. But don't call this method,
+## it i private to CCompiler class and may return unexpected
+## results if used elsewhere. So, you have been warned..
+
+def CCompiler_find_executables(self):
+    """
+    Does nothing here, but is called by the get_version method and can be
+    overridden by subclasses. In particular it is redefined in the `FCompiler`
+    class where more documentation can be found.
+
+    """
+    pass
+
+
+replace_method(CCompiler, 'find_executables', CCompiler_find_executables)
+
+
+# Using customized CCompiler.spawn.
+def CCompiler_spawn(self, cmd, display=None):
+    """
+    Execute a command in a sub-process.
+
+    Parameters
+    ----------
+    cmd : str
+        The command to execute.
+    display : str or sequence of str, optional
+        The text to add to the log file kept by `numpy.distutils`.
+        If not given, `display` is equal to `cmd`.
+
+    Returns
+    -------
+    None
+
+    Raises
+    ------
+    DistutilsExecError
+        If the command failed, i.e. the exit status was not 0.
+
+    """
+    if display is None:
+        display = cmd
+        if is_sequence(display):
+            display = ' '.join(list(display))
+    log.info(display)
+    try:
+        if self.verbose:
+            subprocess.check_output(cmd)
+        else:
+            subprocess.check_output(cmd, stderr=subprocess.STDOUT)
+    except subprocess.CalledProcessError as exc:
+        o = exc.output
+        s = exc.returncode
+    except OSError:
+        # OSError doesn't have the same hooks for the exception
+        # output, but exec_command() historically would use an
+        # empty string for EnvironmentError (base class for
+        # OSError)
+        o = b''
+        # status previously used by exec_command() for parent
+        # of OSError
+        s = 127
+    else:
+        # use a convenience return here so that any kind of
+        # caught exception will execute the default code after the
+        # try / except block, which handles various exceptions
+        return None
+
+    if is_sequence(cmd):
+        cmd = ' '.join(list(cmd))
+
+    if self.verbose:
+        forward_bytes_to_stdout(o)
+
+    if re.search(b'Too many open files', o):
+        msg = '\nTry rerunning setup command until build succeeds.'
+    else:
+        msg = ''
+    raise DistutilsExecError('Command "%s" failed with exit status %d%s' %
+                            (cmd, s, msg))
+
+replace_method(CCompiler, 'spawn', CCompiler_spawn)
+
+def CCompiler_object_filenames(self, source_filenames, strip_dir=0, output_dir=''):
+    """
+    Return the name of the object files for the given source files.
+
+    Parameters
+    ----------
+    source_filenames : list of str
+        The list of paths to source files. Paths can be either relative or
+        absolute, this is handled transparently.
+    strip_dir : bool, optional
+        Whether to strip the directory from the returned paths. If True,
+        the file name prepended by `output_dir` is returned. Default is False.
+    output_dir : str, optional
+        If given, this path is prepended to the returned paths to the
+        object files.
+
+    Returns
+    -------
+    obj_names : list of str
+        The list of paths to the object files corresponding to the source
+        files in `source_filenames`.
+
+    """
+    if output_dir is None:
+        output_dir = ''
+    obj_names = []
+    for src_name in source_filenames:
+        base, ext = os.path.splitext(os.path.normpath(src_name))
+        base = os.path.splitdrive(base)[1] # Chop off the drive
+        base = base[os.path.isabs(base):]  # If abs, chop off leading /
+        if base.startswith('..'):
+            # Resolve starting relative path components, middle ones
+            # (if any) have been handled by os.path.normpath above.
+            i = base.rfind('..')+2
+            d = base[:i]
+            d = os.path.basename(os.path.abspath(d))
+            base = d + base[i:]
+        if ext not in self.src_extensions:
+            raise UnknownFileError("unknown file type '%s' (from '%s')" % (ext, src_name))
+        if strip_dir:
+            base = os.path.basename(base)
+        obj_name = os.path.join(output_dir, base + self.obj_extension)
+        obj_names.append(obj_name)
+    return obj_names
+
+replace_method(CCompiler, 'object_filenames', CCompiler_object_filenames)
+
+def CCompiler_compile(self, sources, output_dir=None, macros=None,
+                      include_dirs=None, debug=0, extra_preargs=None,
+                      extra_postargs=None, depends=None):
+    """
+    Compile one or more source files.
+
+    Please refer to the Python distutils API reference for more details.
+
+    Parameters
+    ----------
+    sources : list of str
+        A list of filenames
+    output_dir : str, optional
+        Path to the output directory.
+    macros : list of tuples
+        A list of macro definitions.
+    include_dirs : list of str, optional
+        The directories to add to the default include file search path for
+        this compilation only.
+    debug : bool, optional
+        Whether or not to output debug symbols in or alongside the object
+        file(s).
+    extra_preargs, extra_postargs : ?
+        Extra pre- and post-arguments.
+    depends : list of str, optional
+        A list of file names that all targets depend on.
+
+    Returns
+    -------
+    objects : list of str
+        A list of object file names, one per source file `sources`.
+
+    Raises
+    ------
+    CompileError
+        If compilation fails.
+
+    """
+    # This method is effective only with Python >=2.3 distutils.
+    # Any changes here should be applied also to fcompiler.compile
+    # method to support pre Python 2.3 distutils.
+    global _job_semaphore
+
+    jobs = get_num_build_jobs()
+
+    # setup semaphore to not exceed number of compile jobs when parallelized at
+    # extension level (python >= 3.5)
+    with _global_lock:
+        if _job_semaphore is None:
+            _job_semaphore = threading.Semaphore(jobs)
+
+    if not sources:
+        return []
+    from numpy.distutils.fcompiler import (FCompiler, is_f_file,
+                                           has_f90_header)
+    if isinstance(self, FCompiler):
+        display = []
+        for fc in ['f77', 'f90', 'fix']:
+            fcomp = getattr(self, 'compiler_'+fc)
+            if fcomp is None:
+                continue
+            display.append("Fortran %s compiler: %s" % (fc, ' '.join(fcomp)))
+        display = '\n'.join(display)
+    else:
+        ccomp = self.compiler_so
+        display = "C compiler: %s\n" % (' '.join(ccomp),)
+    log.info(display)
+    macros, objects, extra_postargs, pp_opts, build = \
+            self._setup_compile(output_dir, macros, include_dirs, sources,
+                                depends, extra_postargs)
+    cc_args = self._get_cc_args(pp_opts, debug, extra_preargs)
+    display = "compile options: '%s'" % (' '.join(cc_args))
+    if extra_postargs:
+        display += "\nextra options: '%s'" % (' '.join(extra_postargs))
+    log.info(display)
+
+    def single_compile(args):
+        obj, (src, ext) = args
+        if not _needs_build(obj, cc_args, extra_postargs, pp_opts):
+            return
+
+        # check if we are currently already processing the same object
+        # happens when using the same source in multiple extensions
+        while True:
+            # need explicit lock as there is no atomic check and add with GIL
+            with _global_lock:
+                # file not being worked on, start working
+                if obj not in _processing_files:
+                    _processing_files.add(obj)
+                    break
+            # wait for the processing to end
+            time.sleep(0.1)
+
+        try:
+            # retrieve slot from our #job semaphore and build
+            with _job_semaphore:
+                self._compile(obj, src, ext, cc_args, extra_postargs, pp_opts)
+        finally:
+            # register being done processing
+            with _global_lock:
+                _processing_files.remove(obj)
+
+
+    if isinstance(self, FCompiler):
+        objects_to_build = list(build.keys())
+        f77_objects, other_objects = [], []
+        for obj in objects:
+            if obj in objects_to_build:
+                src, ext = build[obj]
+                if self.compiler_type=='absoft':
+                    obj = cyg2win32(obj)
+                    src = cyg2win32(src)
+                if is_f_file(src) and not has_f90_header(src):
+                    f77_objects.append((obj, (src, ext)))
+                else:
+                    other_objects.append((obj, (src, ext)))
+
+        # f77 objects can be built in parallel
+        build_items = f77_objects
+        # build f90 modules serial, module files are generated during
+        # compilation and may be used by files later in the list so the
+        # ordering is important
+        for o in other_objects:
+            single_compile(o)
+    else:
+        build_items = build.items()
+
+    if len(build) > 1 and jobs > 1:
+        # build parallel
+        import multiprocessing.pool
+        pool = multiprocessing.pool.ThreadPool(jobs)
+        pool.map(single_compile, build_items)
+        pool.close()
+    else:
+        # build serial
+        for o in build_items:
+            single_compile(o)
+
+    # Return *all* object filenames, not just the ones we just built.
+    return objects
+
+replace_method(CCompiler, 'compile', CCompiler_compile)
+
+def CCompiler_customize_cmd(self, cmd, ignore=()):
+    """
+    Customize compiler using distutils command.
+
+    Parameters
+    ----------
+    cmd : class instance
+        An instance inheriting from `distutils.cmd.Command`.
+    ignore : sequence of str, optional
+        List of `CCompiler` commands (without ``'set_'``) that should not be
+        altered. Strings that are checked for are:
+        ``('include_dirs', 'define', 'undef', 'libraries', 'library_dirs',
+        'rpath', 'link_objects')``.
+
+    Returns
+    -------
+    None
+
+    """
+    log.info('customize %s using %s' % (self.__class__.__name__,
+                                        cmd.__class__.__name__))
+    def allow(attr):
+        return getattr(cmd, attr, None) is not None and attr not in ignore
+
+    if allow('include_dirs'):
+        self.set_include_dirs(cmd.include_dirs)
+    if allow('define'):
+        for (name, value) in cmd.define:
+            self.define_macro(name, value)
+    if allow('undef'):
+        for macro in cmd.undef:
+            self.undefine_macro(macro)
+    if allow('libraries'):
+        self.set_libraries(self.libraries + cmd.libraries)
+    if allow('library_dirs'):
+        self.set_library_dirs(self.library_dirs + cmd.library_dirs)
+    if allow('rpath'):
+        self.set_runtime_library_dirs(cmd.rpath)
+    if allow('link_objects'):
+        self.set_link_objects(cmd.link_objects)
+
+replace_method(CCompiler, 'customize_cmd', CCompiler_customize_cmd)
+
+def _compiler_to_string(compiler):
+    props = []
+    mx = 0
+    keys = list(compiler.executables.keys())
+    for key in ['version', 'libraries', 'library_dirs',
+                'object_switch', 'compile_switch',
+                'include_dirs', 'define', 'undef', 'rpath', 'link_objects']:
+        if key not in keys:
+            keys.append(key)
+    for key in keys:
+        if hasattr(compiler, key):
+            v = getattr(compiler, key)
+            mx = max(mx, len(key))
+            props.append((key, repr(v)))
+    fmt = '%-' + repr(mx+1) + 's = %s'
+    lines = [fmt % prop for prop in props]
+    return '\n'.join(lines)
+
+def CCompiler_show_customization(self):
+    """
+    Print the compiler customizations to stdout.
+
+    Parameters
+    ----------
+    None
+
+    Returns
+    -------
+    None
+
+    Notes
+    -----
+    Printing is only done if the distutils log threshold is < 2.
+
+    """
+    if 0:
+        for attrname in ['include_dirs', 'define', 'undef',
+                         'libraries', 'library_dirs',
+                         'rpath', 'link_objects']:
+            attr = getattr(self, attrname, None)
+            if not attr:
+                continue
+            log.info("compiler '%s' is set to %s" % (attrname, attr))
+    try:
+        self.get_version()
+    except Exception:
+        pass
+    if log._global_log.threshold<2:
+        print('*'*80)
+        print(self.__class__)
+        print(_compiler_to_string(self))
+        print('*'*80)
+
+replace_method(CCompiler, 'show_customization', CCompiler_show_customization)
+
+def CCompiler_customize(self, dist, need_cxx=0):
+    """
+    Do any platform-specific customization of a compiler instance.
+
+    This method calls `distutils.sysconfig.customize_compiler` for
+    platform-specific customization, as well as optionally remove a flag
+    to suppress spurious warnings in case C++ code is being compiled.
+
+    Parameters
+    ----------
+    dist : object
+        This parameter is not used for anything.
+    need_cxx : bool, optional
+        Whether or not C++ has to be compiled. If so (True), the
+        ``"-Wstrict-prototypes"`` option is removed to prevent spurious
+        warnings. Default is False.
+
+    Returns
+    -------
+    None
+
+    Notes
+    -----
+    All the default options used by distutils can be extracted with::
+
+      from distutils import sysconfig
+      sysconfig.get_config_vars('CC', 'CXX', 'OPT', 'BASECFLAGS',
+                                'CCSHARED', 'LDSHARED', 'SO')
+
+    """
+    # See FCompiler.customize for suggested usage.
+    log.info('customize %s' % (self.__class__.__name__))
+    customize_compiler(self)
+    if need_cxx:
+        # In general, distutils uses -Wstrict-prototypes, but this option is
+        # not valid for C++ code, only for C.  Remove it if it's there to
+        # avoid a spurious warning on every compilation.
+        try:
+            self.compiler_so.remove('-Wstrict-prototypes')
+        except (AttributeError, ValueError):
+            pass
+
+        if hasattr(self, 'compiler') and 'cc' in self.compiler[0]:
+            if not self.compiler_cxx:
+                if self.compiler[0].startswith('gcc'):
+                    a, b = 'gcc', 'g++'
+                else:
+                    a, b = 'cc', 'c++'
+                self.compiler_cxx = [self.compiler[0].replace(a, b)]\
+                                    + self.compiler[1:]
+        else:
+            if hasattr(self, 'compiler'):
+                log.warn("#### %s #######" % (self.compiler,))
+            if not hasattr(self, 'compiler_cxx'):
+                log.warn('Missing compiler_cxx fix for ' + self.__class__.__name__)
+
+
+    # check if compiler supports gcc style automatic dependencies
+    # run on every extension so skip for known good compilers
+    if hasattr(self, 'compiler') and ('gcc' in self.compiler[0] or
+                                      'g++' in self.compiler[0] or
+                                      'clang' in self.compiler[0]):
+        self._auto_depends = True
+    elif os.name == 'posix':
+        import tempfile
+        import shutil
+        tmpdir = tempfile.mkdtemp()
+        try:
+            fn = os.path.join(tmpdir, "file.c")
+            with open(fn, "w") as f:
+                f.write("int a;\n")
+            self.compile([fn], output_dir=tmpdir,
+                         extra_preargs=['-MMD', '-MF', fn + '.d'])
+            self._auto_depends = True
+        except CompileError:
+            self._auto_depends = False
+        finally:
+            shutil.rmtree(tmpdir)
+
+    return
+
+replace_method(CCompiler, 'customize', CCompiler_customize)
+
+def simple_version_match(pat=r'[-.\d]+', ignore='', start=''):
+    """
+    Simple matching of version numbers, for use in CCompiler and FCompiler.
+
+    Parameters
+    ----------
+    pat : str, optional
+        A regular expression matching version numbers.
+        Default is ``r'[-.\\d]+'``.
+    ignore : str, optional
+        A regular expression matching patterns to skip.
+        Default is ``''``, in which case nothing is skipped.
+    start : str, optional
+        A regular expression matching the start of where to start looking
+        for version numbers.
+        Default is ``''``, in which case searching is started at the
+        beginning of the version string given to `matcher`.
+
+    Returns
+    -------
+    matcher : callable
+        A function that is appropriate to use as the ``.version_match``
+        attribute of a `CCompiler` class. `matcher` takes a single parameter,
+        a version string.
+
+    """
+    def matcher(self, version_string):
+        # version string may appear in the second line, so getting rid
+        # of new lines:
+        version_string = version_string.replace('\n', ' ')
+        pos = 0
+        if start:
+            m = re.match(start, version_string)
+            if not m:
+                return None
+            pos = m.end()
+        while True:
+            m = re.search(pat, version_string[pos:])
+            if not m:
+                return None
+            if ignore and re.match(ignore, m.group(0)):
+                pos = m.end()
+                continue
+            break
+        return m.group(0)
+    return matcher
+
+def CCompiler_get_version(self, force=False, ok_status=[0]):
+    """
+    Return compiler version, or None if compiler is not available.
+
+    Parameters
+    ----------
+    force : bool, optional
+        If True, force a new determination of the version, even if the
+        compiler already has a version attribute. Default is False.
+    ok_status : list of int, optional
+        The list of status values returned by the version look-up process
+        for which a version string is returned. If the status value is not
+        in `ok_status`, None is returned. Default is ``[0]``.
+
+    Returns
+    -------
+    version : str or None
+        Version string, in the format of `distutils.version.LooseVersion`.
+
+    """
+    if not force and hasattr(self, 'version'):
+        return self.version
+    self.find_executables()
+    try:
+        version_cmd = self.version_cmd
+    except AttributeError:
+        return None
+    if not version_cmd or not version_cmd[0]:
+        return None
+    try:
+        matcher = self.version_match
+    except AttributeError:
+        try:
+            pat = self.version_pattern
+        except AttributeError:
+            return None
+        def matcher(version_string):
+            m = re.match(pat, version_string)
+            if not m:
+                return None
+            version = m.group('version')
+            return version
+
+    try:
+        output = subprocess.check_output(version_cmd, stderr=subprocess.STDOUT)
+    except subprocess.CalledProcessError as exc:
+        output = exc.output
+        status = exc.returncode
+    except OSError:
+        # match the historical returns for a parent
+        # exception class caught by exec_command()
+        status = 127
+        output = b''
+    else:
+        # output isn't actually a filepath but we do this
+        # for now to match previous distutils behavior
+        output = filepath_from_subprocess_output(output)
+        status = 0
+
+    version = None
+    if status in ok_status:
+        version = matcher(output)
+        if version:
+            version = LooseVersion(version)
+    self.version = version
+    return version
+
+replace_method(CCompiler, 'get_version', CCompiler_get_version)
+
+def CCompiler_cxx_compiler(self):
+    """
+    Return the C++ compiler.
+
+    Parameters
+    ----------
+    None
+
+    Returns
+    -------
+    cxx : class instance
+        The C++ compiler, as a `CCompiler` instance.
+
+    """
+    if self.compiler_type in ('msvc', 'intelw', 'intelemw'):
+        return self
+
+    cxx = copy(self)
+    cxx.compiler_so = [cxx.compiler_cxx[0]] + cxx.compiler_so[1:]
+    if sys.platform.startswith('aix') and 'ld_so_aix' in cxx.linker_so[0]:
+        # AIX needs the ld_so_aix script included with Python
+        cxx.linker_so = [cxx.linker_so[0], cxx.compiler_cxx[0]] \
+                        + cxx.linker_so[2:]
+    else:
+        cxx.linker_so = [cxx.compiler_cxx[0]] + cxx.linker_so[1:]
+    return cxx
+
+replace_method(CCompiler, 'cxx_compiler', CCompiler_cxx_compiler)
+
+compiler_class['intel'] = ('intelccompiler', 'IntelCCompiler',
+                           "Intel C Compiler for 32-bit applications")
+compiler_class['intele'] = ('intelccompiler', 'IntelItaniumCCompiler',
+                            "Intel C Itanium Compiler for Itanium-based applications")
+compiler_class['intelem'] = ('intelccompiler', 'IntelEM64TCCompiler',
+                             "Intel C Compiler for 64-bit applications")
+compiler_class['intelw'] = ('intelccompiler', 'IntelCCompilerW',
+                            "Intel C Compiler for 32-bit applications on Windows")
+compiler_class['intelemw'] = ('intelccompiler', 'IntelEM64TCCompilerW',
+                              "Intel C Compiler for 64-bit applications on Windows")
+compiler_class['pathcc'] = ('pathccompiler', 'PathScaleCCompiler',
+                            "PathScale Compiler for SiCortex-based applications")
+ccompiler._default_compilers += (('linux.*', 'intel'),
+                                 ('linux.*', 'intele'),
+                                 ('linux.*', 'intelem'),
+                                 ('linux.*', 'pathcc'),
+                                 ('nt', 'intelw'),
+                                 ('nt', 'intelemw'))
+
+if sys.platform == 'win32':
+    compiler_class['mingw32'] = ('mingw32ccompiler', 'Mingw32CCompiler',
+                                 "Mingw32 port of GNU C Compiler for Win32"\
+                                 "(for MSC built Python)")
+    if mingw32():
+        # On windows platforms, we want to default to mingw32 (gcc)
+        # because msvc can't build blitz stuff.
+        log.info('Setting mingw32 as default compiler for nt.')
+        ccompiler._default_compilers = (('nt', 'mingw32'),) \
+                                       + ccompiler._default_compilers
+
+
+_distutils_new_compiler = new_compiler
+def new_compiler (plat=None,
+                  compiler=None,
+                  verbose=None,
+                  dry_run=0,
+                  force=0):
+    # Try first C compilers from numpy.distutils.
+    if verbose is None:
+        verbose = log.get_threshold() <= log.INFO
+    if plat is None:
+        plat = os.name
+    try:
+        if compiler is None:
+            compiler = get_default_compiler(plat)
+        (module_name, class_name, long_description) = compiler_class[compiler]
+    except KeyError:
+        msg = "don't know how to compile C/C++ code on platform '%s'" % plat
+        if compiler is not None:
+            msg = msg + " with '%s' compiler" % compiler
+        raise DistutilsPlatformError(msg)
+    module_name = "numpy.distutils." + module_name
+    try:
+        __import__ (module_name)
+    except ImportError as e:
+        msg = str(e)
+        log.info('%s in numpy.distutils; trying from distutils',
+                 str(msg))
+        module_name = module_name[6:]
+        try:
+            __import__(module_name)
+        except ImportError as e:
+            msg = str(e)
+            raise DistutilsModuleError("can't compile C/C++ code: unable to load module '%s'" % \
+                  module_name)
+    try:
+        module = sys.modules[module_name]
+        klass = vars(module)[class_name]
+    except KeyError:
+        raise DistutilsModuleError(("can't compile C/C++ code: unable to find class '%s' " +
+               "in module '%s'") % (class_name, module_name))
+    compiler = klass(None, dry_run, force)
+    compiler.verbose = verbose
+    log.debug('new_compiler returns %s' % (klass))
+    return compiler
+
+ccompiler.new_compiler = new_compiler
+
+_distutils_gen_lib_options = gen_lib_options
+def gen_lib_options(compiler, library_dirs, runtime_library_dirs, libraries):
+    # the version of this function provided by CPython allows the following
+    # to return lists, which are unpacked automatically:
+    # - compiler.runtime_library_dir_option
+    # our version extends the behavior to:
+    # - compiler.library_dir_option
+    # - compiler.library_option
+    # - compiler.find_library_file
+    r = _distutils_gen_lib_options(compiler, library_dirs,
+                                   runtime_library_dirs, libraries)
+    lib_opts = []
+    for i in r:
+        if is_sequence(i):
+            lib_opts.extend(list(i))
+        else:
+            lib_opts.append(i)
+    return lib_opts
+ccompiler.gen_lib_options = gen_lib_options
+
+# Also fix up the various compiler modules, which do
+# from distutils.ccompiler import gen_lib_options
+# Don't bother with mwerks, as we don't support Classic Mac.
+for _cc in ['msvc9', 'msvc', '_msvc', 'bcpp', 'cygwinc', 'emxc', 'unixc']:
+    _m = sys.modules.get('distutils.' + _cc + 'compiler')
+    if _m is not None:
+        setattr(_m, 'gen_lib_options', gen_lib_options)
+
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__init__.py b/venv/Lib/site-packages/numpy/distutils/command/__init__.py
new file mode 100644
index 000000000..3ba501de0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/__init__.py
@@ -0,0 +1,41 @@
+"""distutils.command
+
+Package containing implementation of all the standard Distutils
+commands.
+
+"""
+def test_na_writable_attributes_deletion():
+    a = np.NA(2)
+    attr =  ['payload', 'dtype']
+    for s in attr:
+        assert_raises(AttributeError, delattr, a, s)
+
+
+__revision__ = "$Id: __init__.py,v 1.3 2005/05/16 11:08:49 pearu Exp $"
+
+distutils_all = [  #'build_py',
+                   'clean',
+                   'install_clib',
+                   'install_scripts',
+                   'bdist',
+                   'bdist_dumb',
+                   'bdist_wininst',
+                ]
+
+__import__('distutils.command', globals(), locals(), distutils_all)
+
+__all__ = ['build',
+           'config_compiler',
+           'config',
+           'build_src',
+           'build_py',
+           'build_ext',
+           'build_clib',
+           'build_scripts',
+           'install',
+           'install_data',
+           'install_headers',
+           'install_lib',
+           'bdist_rpm',
+           'sdist',
+          ] + distutils_all
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..92bf9c175
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/autodist.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/autodist.cpython-36.pyc
new file mode 100644
index 000000000..16d581626
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/autodist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/bdist_rpm.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/bdist_rpm.cpython-36.pyc
new file mode 100644
index 000000000..b730dc8e6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/bdist_rpm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build.cpython-36.pyc
new file mode 100644
index 000000000..418835ba6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_clib.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_clib.cpython-36.pyc
new file mode 100644
index 000000000..a77ccbd74
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_clib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_ext.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_ext.cpython-36.pyc
new file mode 100644
index 000000000..e5da8ea91
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_ext.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_py.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_py.cpython-36.pyc
new file mode 100644
index 000000000..de1968318
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_py.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_scripts.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_scripts.cpython-36.pyc
new file mode 100644
index 000000000..ea80e1bbb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_src.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_src.cpython-36.pyc
new file mode 100644
index 000000000..95584dbc8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/build_src.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config.cpython-36.pyc
new file mode 100644
index 000000000..693441bee
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config_compiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config_compiler.cpython-36.pyc
new file mode 100644
index 000000000..003582c93
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/config_compiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/develop.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/develop.cpython-36.pyc
new file mode 100644
index 000000000..c9747e7b7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/develop.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/egg_info.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/egg_info.cpython-36.pyc
new file mode 100644
index 000000000..204f43a4b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/egg_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install.cpython-36.pyc
new file mode 100644
index 000000000..25020372e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_clib.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_clib.cpython-36.pyc
new file mode 100644
index 000000000..004f48cbc
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_clib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_data.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_data.cpython-36.pyc
new file mode 100644
index 000000000..55549d3b0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_data.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_headers.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_headers.cpython-36.pyc
new file mode 100644
index 000000000..952de7d9e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/install_headers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/__pycache__/sdist.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/sdist.cpython-36.pyc
new file mode 100644
index 000000000..34af76430
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/command/__pycache__/sdist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/command/autodist.py b/venv/Lib/site-packages/numpy/distutils/command/autodist.py
new file mode 100644
index 000000000..8f6436004
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/autodist.py
@@ -0,0 +1,123 @@
+"""This module implements additional tests ala autoconf which can be useful.
+
+"""
+import textwrap
+
+# We put them here since they could be easily reused outside numpy.distutils
+
+def check_inline(cmd):
+    """Return the inline identifier (may be empty)."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        #ifndef __cplusplus
+        static %(inline)s int static_func (void)
+        {
+            return 0;
+        }
+        %(inline)s int nostatic_func (void)
+        {
+            return 0;
+        }
+        #endif""")
+
+    for kw in ['inline', '__inline__', '__inline']:
+        st = cmd.try_compile(body % {'inline': kw}, None, None)
+        if st:
+            return kw
+
+    return ''
+
+
+def check_restrict(cmd):
+    """Return the restrict identifier (may be empty)."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        static int static_func (char * %(restrict)s a)
+        {
+            return 0;
+        }
+        """)
+
+    for kw in ['restrict', '__restrict__', '__restrict']:
+        st = cmd.try_compile(body % {'restrict': kw}, None, None)
+        if st:
+            return kw
+
+    return ''
+
+
+def check_compiler_gcc4(cmd):
+    """Return True if the C compiler is GCC 4.x."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        int
+        main()
+        {
+        #if (! defined __GNUC__) || (__GNUC__ < 4)
+        #error gcc >= 4 required
+        #endif
+            return 0;
+        }
+        """)
+    return cmd.try_compile(body, None, None)
+
+
+def check_gcc_function_attribute(cmd, attribute, name):
+    """Return True if the given function attribute is supported."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        #pragma GCC diagnostic error "-Wattributes"
+        #pragma clang diagnostic error "-Wattributes"
+
+        int %s %s(void* unused)
+        {
+            return 0;
+        }
+
+        int
+        main()
+        {
+            return 0;
+        }
+        """) % (attribute, name)
+    return cmd.try_compile(body, None, None) != 0
+
+
+def check_gcc_function_attribute_with_intrinsics(cmd, attribute, name, code,
+                                                include):
+    """Return True if the given function attribute is supported with
+    intrinsics."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        #include<%s>
+        int %s %s(void)
+        {
+            %s;
+            return 0;
+        }
+
+        int
+        main()
+        {
+            return 0;
+        }
+        """) % (include, attribute, name, code)
+    return cmd.try_compile(body, None, None) != 0
+
+
+def check_gcc_variable_attribute(cmd, attribute):
+    """Return True if the given variable attribute is supported."""
+    cmd._check_compiler()
+    body = textwrap.dedent("""
+        #pragma GCC diagnostic error "-Wattributes"
+        #pragma clang diagnostic error "-Wattributes"
+
+        int %s foo;
+
+        int
+        main()
+        {
+            return 0;
+        }
+        """) % (attribute, )
+    return cmd.try_compile(body, None, None) != 0
diff --git a/venv/Lib/site-packages/numpy/distutils/command/bdist_rpm.py b/venv/Lib/site-packages/numpy/distutils/command/bdist_rpm.py
new file mode 100644
index 000000000..682e7a8eb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/bdist_rpm.py
@@ -0,0 +1,22 @@
+import os
+import sys
+if 'setuptools' in sys.modules:
+    from setuptools.command.bdist_rpm import bdist_rpm as old_bdist_rpm
+else:
+    from distutils.command.bdist_rpm import bdist_rpm as old_bdist_rpm
+
+class bdist_rpm(old_bdist_rpm):
+
+    def _make_spec_file(self):
+        spec_file = old_bdist_rpm._make_spec_file(self)
+
+        # Replace hardcoded setup.py script name
+        # with the real setup script name.
+        setup_py = os.path.basename(sys.argv[0])
+        if setup_py == 'setup.py':
+            return spec_file
+        new_spec_file = []
+        for line in spec_file:
+            line = line.replace('setup.py', setup_py)
+            new_spec_file.append(line)
+        return new_spec_file
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build.py b/venv/Lib/site-packages/numpy/distutils/command/build.py
new file mode 100644
index 000000000..a156a7c6e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build.py
@@ -0,0 +1,40 @@
+import os
+import sys
+from distutils.command.build import build as old_build
+from distutils.util import get_platform
+from numpy.distutils.command.config_compiler import show_fortran_compilers
+
+class build(old_build):
+
+    sub_commands = [('config_cc',     lambda *args: True),
+                    ('config_fc',     lambda *args: True),
+                    ('build_src',     old_build.has_ext_modules),
+                    ] + old_build.sub_commands
+
+    user_options = old_build.user_options + [
+        ('fcompiler=', None,
+         "specify the Fortran compiler type"),
+        ('warn-error', None,
+         "turn all warnings into errors (-Werror)"),
+        ]
+
+    help_options = old_build.help_options + [
+        ('help-fcompiler', None, "list available Fortran compilers",
+         show_fortran_compilers),
+        ]
+
+    def initialize_options(self):
+        old_build.initialize_options(self)
+        self.fcompiler = None
+        self.warn_error = False
+
+    def finalize_options(self):
+        build_scripts = self.build_scripts
+        old_build.finalize_options(self)
+        plat_specifier = ".{}-{}.{}".format(get_platform(), *sys.version_info[:2])
+        if build_scripts is None:
+            self.build_scripts = os.path.join(self.build_base,
+                                              'scripts' + plat_specifier)
+
+    def run(self):
+        old_build.run(self)
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build_clib.py b/venv/Lib/site-packages/numpy/distutils/command/build_clib.py
new file mode 100644
index 000000000..f6a84e351
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build_clib.py
@@ -0,0 +1,332 @@
+""" Modified version of build_clib that handles fortran source files.
+"""
+import os
+from glob import glob
+import shutil
+from distutils.command.build_clib import build_clib as old_build_clib
+from distutils.errors import DistutilsSetupError, DistutilsError, \
+    DistutilsFileError
+
+from numpy.distutils import log
+from distutils.dep_util import newer_group
+from numpy.distutils.misc_util import (
+    filter_sources, get_lib_source_files, get_numpy_include_dirs,
+    has_cxx_sources, has_f_sources, is_sequence
+)
+
+# Fix Python distutils bug sf #1718574:
+_l = old_build_clib.user_options
+for _i in range(len(_l)):
+    if _l[_i][0] in ['build-clib', 'build-temp']:
+        _l[_i] = (_l[_i][0] + '=',) + _l[_i][1:]
+#
+
+
+class build_clib(old_build_clib):
+
+    description = "build C/C++/F libraries used by Python extensions"
+
+    user_options = old_build_clib.user_options + [
+        ('fcompiler=', None,
+         "specify the Fortran compiler type"),
+        ('inplace', 'i', 'Build in-place'),
+        ('parallel=', 'j',
+         "number of parallel jobs"),
+        ('warn-error', None,
+         "turn all warnings into errors (-Werror)"),
+    ]
+
+    boolean_options = old_build_clib.boolean_options + ['inplace', 'warn-error']
+
+    def initialize_options(self):
+        old_build_clib.initialize_options(self)
+        self.fcompiler = None
+        self.inplace = 0
+        self.parallel = None
+        self.warn_error = None
+
+    def finalize_options(self):
+        if self.parallel:
+            try:
+                self.parallel = int(self.parallel)
+            except ValueError as e:
+                raise ValueError("--parallel/-j argument must be an integer") from e
+        old_build_clib.finalize_options(self)
+        self.set_undefined_options('build',
+                                        ('parallel', 'parallel'),
+                                        ('warn_error', 'warn_error'),
+                                  )
+
+    def have_f_sources(self):
+        for (lib_name, build_info) in self.libraries:
+            if has_f_sources(build_info.get('sources', [])):
+                return True
+        return False
+
+    def have_cxx_sources(self):
+        for (lib_name, build_info) in self.libraries:
+            if has_cxx_sources(build_info.get('sources', [])):
+                return True
+        return False
+
+    def run(self):
+        if not self.libraries:
+            return
+
+        # Make sure that library sources are complete.
+        languages = []
+
+        # Make sure that extension sources are complete.
+        self.run_command('build_src')
+
+        for (lib_name, build_info) in self.libraries:
+            l = build_info.get('language', None)
+            if l and l not in languages:
+                languages.append(l)
+
+        from distutils.ccompiler import new_compiler
+        self.compiler = new_compiler(compiler=self.compiler,
+                                     dry_run=self.dry_run,
+                                     force=self.force)
+        self.compiler.customize(self.distribution,
+                                need_cxx=self.have_cxx_sources())
+
+        if self.warn_error:
+            self.compiler.compiler.append('-Werror')
+            self.compiler.compiler_so.append('-Werror')
+
+        libraries = self.libraries
+        self.libraries = None
+        self.compiler.customize_cmd(self)
+        self.libraries = libraries
+
+        self.compiler.show_customization()
+
+        if self.have_f_sources():
+            from numpy.distutils.fcompiler import new_fcompiler
+            self._f_compiler = new_fcompiler(compiler=self.fcompiler,
+                                             verbose=self.verbose,
+                                             dry_run=self.dry_run,
+                                             force=self.force,
+                                             requiref90='f90' in languages,
+                                             c_compiler=self.compiler)
+            if self._f_compiler is not None:
+                self._f_compiler.customize(self.distribution)
+
+                libraries = self.libraries
+                self.libraries = None
+                self._f_compiler.customize_cmd(self)
+                self.libraries = libraries
+
+                self._f_compiler.show_customization()
+        else:
+            self._f_compiler = None
+
+        self.build_libraries(self.libraries)
+
+        if self.inplace:
+            for l in self.distribution.installed_libraries:
+                libname = self.compiler.library_filename(l.name)
+                source = os.path.join(self.build_clib, libname)
+                target = os.path.join(l.target_dir, libname)
+                self.mkpath(l.target_dir)
+                shutil.copy(source, target)
+
+    def get_source_files(self):
+        self.check_library_list(self.libraries)
+        filenames = []
+        for lib in self.libraries:
+            filenames.extend(get_lib_source_files(lib))
+        return filenames
+
+    def build_libraries(self, libraries):
+        for (lib_name, build_info) in libraries:
+            self.build_a_library(build_info, lib_name, libraries)
+
+    def build_a_library(self, build_info, lib_name, libraries):
+        # default compilers
+        compiler = self.compiler
+        fcompiler = self._f_compiler
+
+        sources = build_info.get('sources')
+        if sources is None or not is_sequence(sources):
+            raise DistutilsSetupError(("in 'libraries' option (library '%s'), " +
+                                       "'sources' must be present and must be " +
+                                       "a list of source filenames") % lib_name)
+        sources = list(sources)
+
+        c_sources, cxx_sources, f_sources, fmodule_sources \
+            = filter_sources(sources)
+        requiref90 = not not fmodule_sources or \
+            build_info.get('language', 'c') == 'f90'
+
+        # save source type information so that build_ext can use it.
+        source_languages = []
+        if c_sources:
+            source_languages.append('c')
+        if cxx_sources:
+            source_languages.append('c++')
+        if requiref90:
+            source_languages.append('f90')
+        elif f_sources:
+            source_languages.append('f77')
+        build_info['source_languages'] = source_languages
+
+        lib_file = compiler.library_filename(lib_name,
+                                             output_dir=self.build_clib)
+        depends = sources + build_info.get('depends', [])
+        if not (self.force or newer_group(depends, lib_file, 'newer')):
+            log.debug("skipping '%s' library (up-to-date)", lib_name)
+            return
+        else:
+            log.info("building '%s' library", lib_name)
+
+        config_fc = build_info.get('config_fc', {})
+        if fcompiler is not None and config_fc:
+            log.info('using additional config_fc from setup script '
+                     'for fortran compiler: %s'
+                     % (config_fc,))
+            from numpy.distutils.fcompiler import new_fcompiler
+            fcompiler = new_fcompiler(compiler=fcompiler.compiler_type,
+                                      verbose=self.verbose,
+                                      dry_run=self.dry_run,
+                                      force=self.force,
+                                      requiref90=requiref90,
+                                      c_compiler=self.compiler)
+            if fcompiler is not None:
+                dist = self.distribution
+                base_config_fc = dist.get_option_dict('config_fc').copy()
+                base_config_fc.update(config_fc)
+                fcompiler.customize(base_config_fc)
+
+        # check availability of Fortran compilers
+        if (f_sources or fmodule_sources) and fcompiler is None:
+            raise DistutilsError("library %s has Fortran sources"
+                                 " but no Fortran compiler found" % (lib_name))
+
+        if fcompiler is not None:
+            fcompiler.extra_f77_compile_args = build_info.get(
+                'extra_f77_compile_args') or []
+            fcompiler.extra_f90_compile_args = build_info.get(
+                'extra_f90_compile_args') or []
+
+        macros = build_info.get('macros')
+        include_dirs = build_info.get('include_dirs')
+        if include_dirs is None:
+            include_dirs = []
+        extra_postargs = build_info.get('extra_compiler_args') or []
+
+        include_dirs.extend(get_numpy_include_dirs())
+        # where compiled F90 module files are:
+        module_dirs = build_info.get('module_dirs') or []
+        module_build_dir = os.path.dirname(lib_file)
+        if requiref90:
+            self.mkpath(module_build_dir)
+
+        if compiler.compiler_type == 'msvc':
+            # this hack works around the msvc compiler attributes
+            # problem, msvc uses its own convention :(
+            c_sources += cxx_sources
+            cxx_sources = []
+
+        objects = []
+        if c_sources:
+            log.info("compiling C sources")
+            objects = compiler.compile(c_sources,
+                                       output_dir=self.build_temp,
+                                       macros=macros,
+                                       include_dirs=include_dirs,
+                                       debug=self.debug,
+                                       extra_postargs=extra_postargs)
+
+        if cxx_sources:
+            log.info("compiling C++ sources")
+            cxx_compiler = compiler.cxx_compiler()
+            cxx_objects = cxx_compiler.compile(cxx_sources,
+                                               output_dir=self.build_temp,
+                                               macros=macros,
+                                               include_dirs=include_dirs,
+                                               debug=self.debug,
+                                               extra_postargs=extra_postargs)
+            objects.extend(cxx_objects)
+
+        if f_sources or fmodule_sources:
+            extra_postargs = []
+            f_objects = []
+
+            if requiref90:
+                if fcompiler.module_dir_switch is None:
+                    existing_modules = glob('*.mod')
+                extra_postargs += fcompiler.module_options(
+                    module_dirs, module_build_dir)
+
+            if fmodule_sources:
+                log.info("compiling Fortran 90 module sources")
+                f_objects += fcompiler.compile(fmodule_sources,
+                                               output_dir=self.build_temp,
+                                               macros=macros,
+                                               include_dirs=include_dirs,
+                                               debug=self.debug,
+                                               extra_postargs=extra_postargs)
+
+            if requiref90 and self._f_compiler.module_dir_switch is None:
+                # move new compiled F90 module files to module_build_dir
+                for f in glob('*.mod'):
+                    if f in existing_modules:
+                        continue
+                    t = os.path.join(module_build_dir, f)
+                    if os.path.abspath(f) == os.path.abspath(t):
+                        continue
+                    if os.path.isfile(t):
+                        os.remove(t)
+                    try:
+                        self.move_file(f, module_build_dir)
+                    except DistutilsFileError:
+                        log.warn('failed to move %r to %r'
+                                 % (f, module_build_dir))
+
+            if f_sources:
+                log.info("compiling Fortran sources")
+                f_objects += fcompiler.compile(f_sources,
+                                               output_dir=self.build_temp,
+                                               macros=macros,
+                                               include_dirs=include_dirs,
+                                               debug=self.debug,
+                                               extra_postargs=extra_postargs)
+        else:
+            f_objects = []
+
+        if f_objects and not fcompiler.can_ccompiler_link(compiler):
+            # Default linker cannot link Fortran object files, and results
+            # need to be wrapped later. Instead of creating a real static
+            # library, just keep track of the object files.
+            listfn = os.path.join(self.build_clib,
+                                  lib_name + '.fobjects')
+            with open(listfn, 'w') as f:
+                f.write("\n".join(os.path.abspath(obj) for obj in f_objects))
+
+            listfn = os.path.join(self.build_clib,
+                                  lib_name + '.cobjects')
+            with open(listfn, 'w') as f:
+                f.write("\n".join(os.path.abspath(obj) for obj in objects))
+
+            # create empty "library" file for dependency tracking
+            lib_fname = os.path.join(self.build_clib,
+                                     lib_name + compiler.static_lib_extension)
+            with open(lib_fname, 'wb') as f:
+                pass
+        else:
+            # assume that default linker is suitable for
+            # linking Fortran object files
+            objects.extend(f_objects)
+            compiler.create_static_lib(objects, lib_name,
+                                       output_dir=self.build_clib,
+                                       debug=self.debug)
+
+        # fix library dependencies
+        clib_libraries = build_info.get('libraries', [])
+        for lname, binfo in libraries:
+            if lname in clib_libraries:
+                clib_libraries.extend(binfo.get('libraries', []))
+        if clib_libraries:
+            build_info['libraries'] = clib_libraries
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build_ext.py b/venv/Lib/site-packages/numpy/distutils/command/build_ext.py
new file mode 100644
index 000000000..d53285c92
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build_ext.py
@@ -0,0 +1,609 @@
+""" Modified version of build_ext that handles fortran source files.
+
+"""
+import os
+import subprocess
+from glob import glob
+
+from distutils.dep_util import newer_group
+from distutils.command.build_ext import build_ext as old_build_ext
+from distutils.errors import DistutilsFileError, DistutilsSetupError,\
+    DistutilsError
+from distutils.file_util import copy_file
+
+from numpy.distutils import log
+from numpy.distutils.exec_command import filepath_from_subprocess_output
+from numpy.distutils.system_info import combine_paths
+from numpy.distutils.misc_util import (
+    filter_sources, get_ext_source_files, get_numpy_include_dirs,
+    has_cxx_sources, has_f_sources, is_sequence
+)
+from numpy.distutils.command.config_compiler import show_fortran_compilers
+
+
+
+class build_ext (old_build_ext):
+
+    description = "build C/C++/F extensions (compile/link to build directory)"
+
+    user_options = old_build_ext.user_options + [
+        ('fcompiler=', None,
+         "specify the Fortran compiler type"),
+        ('parallel=', 'j',
+         "number of parallel jobs"),
+        ('warn-error', None,
+         "turn all warnings into errors (-Werror)"),
+    ]
+
+    help_options = old_build_ext.help_options + [
+        ('help-fcompiler', None, "list available Fortran compilers",
+         show_fortran_compilers),
+    ]
+
+    boolean_options = old_build_ext.boolean_options + ['warn-error']
+
+    def initialize_options(self):
+        old_build_ext.initialize_options(self)
+        self.fcompiler = None
+        self.parallel = None
+        self.warn_error = None
+
+    def finalize_options(self):
+        if self.parallel:
+            try:
+                self.parallel = int(self.parallel)
+            except ValueError as e:
+                raise ValueError("--parallel/-j argument must be an integer") from e
+
+        # Ensure that self.include_dirs and self.distribution.include_dirs
+        # refer to the same list object. finalize_options will modify
+        # self.include_dirs, but self.distribution.include_dirs is used
+        # during the actual build.
+        # self.include_dirs is None unless paths are specified with
+        # --include-dirs.
+        # The include paths will be passed to the compiler in the order:
+        # numpy paths, --include-dirs paths, Python include path.
+        if isinstance(self.include_dirs, str):
+            self.include_dirs = self.include_dirs.split(os.pathsep)
+        incl_dirs = self.include_dirs or []
+        if self.distribution.include_dirs is None:
+            self.distribution.include_dirs = []
+        self.include_dirs = self.distribution.include_dirs
+        self.include_dirs.extend(incl_dirs)
+
+        old_build_ext.finalize_options(self)
+        self.set_undefined_options('build',
+                                        ('parallel', 'parallel'),
+                                        ('warn_error', 'warn_error'),
+                                  )
+
+    def run(self):
+        if not self.extensions:
+            return
+
+        # Make sure that extension sources are complete.
+        self.run_command('build_src')
+
+        if self.distribution.has_c_libraries():
+            if self.inplace:
+                if self.distribution.have_run.get('build_clib'):
+                    log.warn('build_clib already run, it is too late to '
+                             'ensure in-place build of build_clib')
+                    build_clib = self.distribution.get_command_obj(
+                        'build_clib')
+                else:
+                    build_clib = self.distribution.get_command_obj(
+                        'build_clib')
+                    build_clib.inplace = 1
+                    build_clib.ensure_finalized()
+                    build_clib.run()
+                    self.distribution.have_run['build_clib'] = 1
+
+            else:
+                self.run_command('build_clib')
+                build_clib = self.get_finalized_command('build_clib')
+            self.library_dirs.append(build_clib.build_clib)
+        else:
+            build_clib = None
+
+        # Not including C libraries to the list of
+        # extension libraries automatically to prevent
+        # bogus linking commands. Extensions must
+        # explicitly specify the C libraries that they use.
+
+        from distutils.ccompiler import new_compiler
+        from numpy.distutils.fcompiler import new_fcompiler
+
+        compiler_type = self.compiler
+        # Initialize C compiler:
+        self.compiler = new_compiler(compiler=compiler_type,
+                                     verbose=self.verbose,
+                                     dry_run=self.dry_run,
+                                     force=self.force)
+        self.compiler.customize(self.distribution)
+        self.compiler.customize_cmd(self)
+
+        if self.warn_error:
+            self.compiler.compiler.append('-Werror')
+            self.compiler.compiler_so.append('-Werror')
+
+        self.compiler.show_customization()
+
+        # Setup directory for storing generated extra DLL files on Windows
+        self.extra_dll_dir = os.path.join(self.build_temp, '.libs')
+        if not os.path.isdir(self.extra_dll_dir):
+            os.makedirs(self.extra_dll_dir)
+
+        # Create mapping of libraries built by build_clib:
+        clibs = {}
+        if build_clib is not None:
+            for libname, build_info in build_clib.libraries or []:
+                if libname in clibs and clibs[libname] != build_info:
+                    log.warn('library %r defined more than once,'
+                             ' overwriting build_info\n%s... \nwith\n%s...'
+                             % (libname, repr(clibs[libname])[:300], repr(build_info)[:300]))
+                clibs[libname] = build_info
+        # .. and distribution libraries:
+        for libname, build_info in self.distribution.libraries or []:
+            if libname in clibs:
+                # build_clib libraries have a precedence before distribution ones
+                continue
+            clibs[libname] = build_info
+
+        # Determine if C++/Fortran 77/Fortran 90 compilers are needed.
+        # Update extension libraries, library_dirs, and macros.
+        all_languages = set()
+        for ext in self.extensions:
+            ext_languages = set()
+            c_libs = []
+            c_lib_dirs = []
+            macros = []
+            for libname in ext.libraries:
+                if libname in clibs:
+                    binfo = clibs[libname]
+                    c_libs += binfo.get('libraries', [])
+                    c_lib_dirs += binfo.get('library_dirs', [])
+                    for m in binfo.get('macros', []):
+                        if m not in macros:
+                            macros.append(m)
+
+                for l in clibs.get(libname, {}).get('source_languages', []):
+                    ext_languages.add(l)
+            if c_libs:
+                new_c_libs = ext.libraries + c_libs
+                log.info('updating extension %r libraries from %r to %r'
+                         % (ext.name, ext.libraries, new_c_libs))
+                ext.libraries = new_c_libs
+                ext.library_dirs = ext.library_dirs + c_lib_dirs
+            if macros:
+                log.info('extending extension %r defined_macros with %r'
+                         % (ext.name, macros))
+                ext.define_macros = ext.define_macros + macros
+
+            # determine extension languages
+            if has_f_sources(ext.sources):
+                ext_languages.add('f77')
+            if has_cxx_sources(ext.sources):
+                ext_languages.add('c++')
+            l = ext.language or self.compiler.detect_language(ext.sources)
+            if l:
+                ext_languages.add(l)
+            # reset language attribute for choosing proper linker
+            if 'c++' in ext_languages:
+                ext_language = 'c++'
+            elif 'f90' in ext_languages:
+                ext_language = 'f90'
+            elif 'f77' in ext_languages:
+                ext_language = 'f77'
+            else:
+                ext_language = 'c'  # default
+            if l and l != ext_language and ext.language:
+                log.warn('resetting extension %r language from %r to %r.' %
+                         (ext.name, l, ext_language))
+            ext.language = ext_language
+            # global language
+            all_languages.update(ext_languages)
+
+        need_f90_compiler = 'f90' in all_languages
+        need_f77_compiler = 'f77' in all_languages
+        need_cxx_compiler = 'c++' in all_languages
+
+        # Initialize C++ compiler:
+        if need_cxx_compiler:
+            self._cxx_compiler = new_compiler(compiler=compiler_type,
+                                              verbose=self.verbose,
+                                              dry_run=self.dry_run,
+                                              force=self.force)
+            compiler = self._cxx_compiler
+            compiler.customize(self.distribution, need_cxx=need_cxx_compiler)
+            compiler.customize_cmd(self)
+            compiler.show_customization()
+            self._cxx_compiler = compiler.cxx_compiler()
+        else:
+            self._cxx_compiler = None
+
+        # Initialize Fortran 77 compiler:
+        if need_f77_compiler:
+            ctype = self.fcompiler
+            self._f77_compiler = new_fcompiler(compiler=self.fcompiler,
+                                               verbose=self.verbose,
+                                               dry_run=self.dry_run,
+                                               force=self.force,
+                                               requiref90=False,
+                                               c_compiler=self.compiler)
+            fcompiler = self._f77_compiler
+            if fcompiler:
+                ctype = fcompiler.compiler_type
+                fcompiler.customize(self.distribution)
+            if fcompiler and fcompiler.get_version():
+                fcompiler.customize_cmd(self)
+                fcompiler.show_customization()
+            else:
+                self.warn('f77_compiler=%s is not available.' %
+                          (ctype))
+                self._f77_compiler = None
+        else:
+            self._f77_compiler = None
+
+        # Initialize Fortran 90 compiler:
+        if need_f90_compiler:
+            ctype = self.fcompiler
+            self._f90_compiler = new_fcompiler(compiler=self.fcompiler,
+                                               verbose=self.verbose,
+                                               dry_run=self.dry_run,
+                                               force=self.force,
+                                               requiref90=True,
+                                               c_compiler=self.compiler)
+            fcompiler = self._f90_compiler
+            if fcompiler:
+                ctype = fcompiler.compiler_type
+                fcompiler.customize(self.distribution)
+            if fcompiler and fcompiler.get_version():
+                fcompiler.customize_cmd(self)
+                fcompiler.show_customization()
+            else:
+                self.warn('f90_compiler=%s is not available.' %
+                          (ctype))
+                self._f90_compiler = None
+        else:
+            self._f90_compiler = None
+
+        # Build extensions
+        self.build_extensions()
+
+        # Copy over any extra DLL files
+        # FIXME: In the case where there are more than two packages,
+        # we blindly assume that both packages need all of the libraries,
+        # resulting in a larger wheel than is required. This should be fixed,
+        # but it's so rare that I won't bother to handle it.
+        pkg_roots = {
+            self.get_ext_fullname(ext.name).split('.')[0]
+            for ext in self.extensions
+        }
+        for pkg_root in pkg_roots:
+            shared_lib_dir = os.path.join(pkg_root, '.libs')
+            if not self.inplace:
+                shared_lib_dir = os.path.join(self.build_lib, shared_lib_dir)
+            for fn in os.listdir(self.extra_dll_dir):
+                if not os.path.isdir(shared_lib_dir):
+                    os.makedirs(shared_lib_dir)
+                if not fn.lower().endswith('.dll'):
+                    continue
+                runtime_lib = os.path.join(self.extra_dll_dir, fn)
+                copy_file(runtime_lib, shared_lib_dir)
+
+    def swig_sources(self, sources, extensions=None):
+        # Do nothing. Swig sources have been handled in build_src command.
+        return sources
+
+    def build_extension(self, ext):
+        sources = ext.sources
+        if sources is None or not is_sequence(sources):
+            raise DistutilsSetupError(
+                ("in 'ext_modules' option (extension '%s'), " +
+                 "'sources' must be present and must be " +
+                 "a list of source filenames") % ext.name)
+        sources = list(sources)
+
+        if not sources:
+            return
+
+        fullname = self.get_ext_fullname(ext.name)
+        if self.inplace:
+            modpath = fullname.split('.')
+            package = '.'.join(modpath[0:-1])
+            base = modpath[-1]
+            build_py = self.get_finalized_command('build_py')
+            package_dir = build_py.get_package_dir(package)
+            ext_filename = os.path.join(package_dir,
+                                        self.get_ext_filename(base))
+        else:
+            ext_filename = os.path.join(self.build_lib,
+                                        self.get_ext_filename(fullname))
+        depends = sources + ext.depends
+
+        if not (self.force or newer_group(depends, ext_filename, 'newer')):
+            log.debug("skipping '%s' extension (up-to-date)", ext.name)
+            return
+        else:
+            log.info("building '%s' extension", ext.name)
+
+        extra_args = ext.extra_compile_args or []
+        macros = ext.define_macros[:]
+        for undef in ext.undef_macros:
+            macros.append((undef,))
+
+        c_sources, cxx_sources, f_sources, fmodule_sources = \
+            filter_sources(ext.sources)
+
+        if self.compiler.compiler_type == 'msvc':
+            if cxx_sources:
+                # Needed to compile kiva.agg._agg extension.
+                extra_args.append('/Zm1000')
+            # this hack works around the msvc compiler attributes
+            # problem, msvc uses its own convention :(
+            c_sources += cxx_sources
+            cxx_sources = []
+
+        # Set Fortran/C++ compilers for compilation and linking.
+        if ext.language == 'f90':
+            fcompiler = self._f90_compiler
+        elif ext.language == 'f77':
+            fcompiler = self._f77_compiler
+        else:  # in case ext.language is c++, for instance
+            fcompiler = self._f90_compiler or self._f77_compiler
+        if fcompiler is not None:
+            fcompiler.extra_f77_compile_args = (ext.extra_f77_compile_args or []) if hasattr(
+                ext, 'extra_f77_compile_args') else []
+            fcompiler.extra_f90_compile_args = (ext.extra_f90_compile_args or []) if hasattr(
+                ext, 'extra_f90_compile_args') else []
+        cxx_compiler = self._cxx_compiler
+
+        # check for the availability of required compilers
+        if cxx_sources and cxx_compiler is None:
+            raise DistutilsError("extension %r has C++ sources"
+                                 "but no C++ compiler found" % (ext.name))
+        if (f_sources or fmodule_sources) and fcompiler is None:
+            raise DistutilsError("extension %r has Fortran sources "
+                                 "but no Fortran compiler found" % (ext.name))
+        if ext.language in ['f77', 'f90'] and fcompiler is None:
+            self.warn("extension %r has Fortran libraries "
+                      "but no Fortran linker found, using default linker" % (ext.name))
+        if ext.language == 'c++' and cxx_compiler is None:
+            self.warn("extension %r has C++ libraries "
+                      "but no C++ linker found, using default linker" % (ext.name))
+
+        kws = {'depends': ext.depends}
+        output_dir = self.build_temp
+
+        include_dirs = ext.include_dirs + get_numpy_include_dirs()
+
+        c_objects = []
+        if c_sources:
+            log.info("compiling C sources")
+            c_objects = self.compiler.compile(c_sources,
+                                              output_dir=output_dir,
+                                              macros=macros,
+                                              include_dirs=include_dirs,
+                                              debug=self.debug,
+                                              extra_postargs=extra_args,
+                                              **kws)
+
+        if cxx_sources:
+            log.info("compiling C++ sources")
+            c_objects += cxx_compiler.compile(cxx_sources,
+                                              output_dir=output_dir,
+                                              macros=macros,
+                                              include_dirs=include_dirs,
+                                              debug=self.debug,
+                                              extra_postargs=extra_args,
+                                              **kws)
+
+        extra_postargs = []
+        f_objects = []
+        if fmodule_sources:
+            log.info("compiling Fortran 90 module sources")
+            module_dirs = ext.module_dirs[:]
+            module_build_dir = os.path.join(
+                self.build_temp, os.path.dirname(
+                    self.get_ext_filename(fullname)))
+
+            self.mkpath(module_build_dir)
+            if fcompiler.module_dir_switch is None:
+                existing_modules = glob('*.mod')
+            extra_postargs += fcompiler.module_options(
+                module_dirs, module_build_dir)
+            f_objects += fcompiler.compile(fmodule_sources,
+                                           output_dir=self.build_temp,
+                                           macros=macros,
+                                           include_dirs=include_dirs,
+                                           debug=self.debug,
+                                           extra_postargs=extra_postargs,
+                                           depends=ext.depends)
+
+            if fcompiler.module_dir_switch is None:
+                for f in glob('*.mod'):
+                    if f in existing_modules:
+                        continue
+                    t = os.path.join(module_build_dir, f)
+                    if os.path.abspath(f) == os.path.abspath(t):
+                        continue
+                    if os.path.isfile(t):
+                        os.remove(t)
+                    try:
+                        self.move_file(f, module_build_dir)
+                    except DistutilsFileError:
+                        log.warn('failed to move %r to %r' %
+                                 (f, module_build_dir))
+        if f_sources:
+            log.info("compiling Fortran sources")
+            f_objects += fcompiler.compile(f_sources,
+                                           output_dir=self.build_temp,
+                                           macros=macros,
+                                           include_dirs=include_dirs,
+                                           debug=self.debug,
+                                           extra_postargs=extra_postargs,
+                                           depends=ext.depends)
+
+        if f_objects and not fcompiler.can_ccompiler_link(self.compiler):
+            unlinkable_fobjects = f_objects
+            objects = c_objects
+        else:
+            unlinkable_fobjects = []
+            objects = c_objects + f_objects
+
+        if ext.extra_objects:
+            objects.extend(ext.extra_objects)
+        extra_args = ext.extra_link_args or []
+        libraries = self.get_libraries(ext)[:]
+        library_dirs = ext.library_dirs[:]
+
+        linker = self.compiler.link_shared_object
+        # Always use system linker when using MSVC compiler.
+        if self.compiler.compiler_type in ('msvc', 'intelw', 'intelemw'):
+            # expand libraries with fcompiler libraries as we are
+            # not using fcompiler linker
+            self._libs_with_msvc_and_fortran(
+                fcompiler, libraries, library_dirs)
+
+        elif ext.language in ['f77', 'f90'] and fcompiler is not None:
+            linker = fcompiler.link_shared_object
+        if ext.language == 'c++' and cxx_compiler is not None:
+            linker = cxx_compiler.link_shared_object
+
+        if fcompiler is not None:
+            objects, libraries = self._process_unlinkable_fobjects(
+                    objects, libraries,
+                    fcompiler, library_dirs,
+                    unlinkable_fobjects)
+
+        linker(objects, ext_filename,
+               libraries=libraries,
+               library_dirs=library_dirs,
+               runtime_library_dirs=ext.runtime_library_dirs,
+               extra_postargs=extra_args,
+               export_symbols=self.get_export_symbols(ext),
+               debug=self.debug,
+               build_temp=self.build_temp,
+               target_lang=ext.language)
+
+    def _add_dummy_mingwex_sym(self, c_sources):
+        build_src = self.get_finalized_command("build_src").build_src
+        build_clib = self.get_finalized_command("build_clib").build_clib
+        objects = self.compiler.compile([os.path.join(build_src,
+                                                      "gfortran_vs2003_hack.c")],
+                                        output_dir=self.build_temp)
+        self.compiler.create_static_lib(
+            objects, "_gfortran_workaround", output_dir=build_clib, debug=self.debug)
+
+    def _process_unlinkable_fobjects(self, objects, libraries,
+                                     fcompiler, library_dirs,
+                                     unlinkable_fobjects):
+        libraries = list(libraries)
+        objects = list(objects)
+        unlinkable_fobjects = list(unlinkable_fobjects)
+
+        # Expand possible fake static libraries to objects
+        for lib in list(libraries):
+            for libdir in library_dirs:
+                fake_lib = os.path.join(libdir, lib + '.fobjects')
+                if os.path.isfile(fake_lib):
+                    # Replace fake static library
+                    libraries.remove(lib)
+                    with open(fake_lib, 'r') as f:
+                        unlinkable_fobjects.extend(f.read().splitlines())
+
+                    # Expand C objects
+                    c_lib = os.path.join(libdir, lib + '.cobjects')
+                    with open(c_lib, 'r') as f:
+                        objects.extend(f.read().splitlines())
+
+        # Wrap unlinkable objects to a linkable one
+        if unlinkable_fobjects:
+            fobjects = [os.path.abspath(obj) for obj in unlinkable_fobjects]
+            wrapped = fcompiler.wrap_unlinkable_objects(
+                    fobjects, output_dir=self.build_temp,
+                    extra_dll_dir=self.extra_dll_dir)
+            objects.extend(wrapped)
+
+        return objects, libraries
+
+    def _libs_with_msvc_and_fortran(self, fcompiler, c_libraries,
+                                    c_library_dirs):
+        if fcompiler is None:
+            return
+
+        for libname in c_libraries:
+            if libname.startswith('msvc'):
+                continue
+            fileexists = False
+            for libdir in c_library_dirs or []:
+                libfile = os.path.join(libdir, '%s.lib' % (libname))
+                if os.path.isfile(libfile):
+                    fileexists = True
+                    break
+            if fileexists:
+                continue
+            # make g77-compiled static libs available to MSVC
+            fileexists = False
+            for libdir in c_library_dirs:
+                libfile = os.path.join(libdir, 'lib%s.a' % (libname))
+                if os.path.isfile(libfile):
+                    # copy libname.a file to name.lib so that MSVC linker
+                    # can find it
+                    libfile2 = os.path.join(self.build_temp, libname + '.lib')
+                    copy_file(libfile, libfile2)
+                    if self.build_temp not in c_library_dirs:
+                        c_library_dirs.append(self.build_temp)
+                    fileexists = True
+                    break
+            if fileexists:
+                continue
+            log.warn('could not find library %r in directories %s'
+                     % (libname, c_library_dirs))
+
+        # Always use system linker when using MSVC compiler.
+        f_lib_dirs = []
+        for dir in fcompiler.library_dirs:
+            # correct path when compiling in Cygwin but with normal Win
+            # Python
+            if dir.startswith('/usr/lib'):
+                try:
+                    dir = subprocess.check_output(['cygpath', '-w', dir])
+                except (OSError, subprocess.CalledProcessError):
+                    pass
+                else:
+                    dir = filepath_from_subprocess_output(dir)
+            f_lib_dirs.append(dir)
+        c_library_dirs.extend(f_lib_dirs)
+
+        # make g77-compiled static libs available to MSVC
+        for lib in fcompiler.libraries:
+            if not lib.startswith('msvc'):
+                c_libraries.append(lib)
+                p = combine_paths(f_lib_dirs, 'lib' + lib + '.a')
+                if p:
+                    dst_name = os.path.join(self.build_temp, lib + '.lib')
+                    if not os.path.isfile(dst_name):
+                        copy_file(p[0], dst_name)
+                    if self.build_temp not in c_library_dirs:
+                        c_library_dirs.append(self.build_temp)
+
+    def get_source_files(self):
+        self.check_extensions_list(self.extensions)
+        filenames = []
+        for ext in self.extensions:
+            filenames.extend(get_ext_source_files(ext))
+        return filenames
+
+    def get_outputs(self):
+        self.check_extensions_list(self.extensions)
+
+        outputs = []
+        for ext in self.extensions:
+            if not ext.sources:
+                continue
+            fullname = self.get_ext_fullname(ext.name)
+            outputs.append(os.path.join(self.build_lib,
+                                        self.get_ext_filename(fullname)))
+        return outputs
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build_py.py b/venv/Lib/site-packages/numpy/distutils/command/build_py.py
new file mode 100644
index 000000000..d30dc5bf4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build_py.py
@@ -0,0 +1,31 @@
+from distutils.command.build_py import build_py as old_build_py
+from numpy.distutils.misc_util import is_string
+
+class build_py(old_build_py):
+
+    def run(self):
+        build_src = self.get_finalized_command('build_src')
+        if build_src.py_modules_dict and self.packages is None:
+            self.packages = list(build_src.py_modules_dict.keys ())
+        old_build_py.run(self)
+
+    def find_package_modules(self, package, package_dir):
+        modules = old_build_py.find_package_modules(self, package, package_dir)
+
+        # Find build_src generated *.py files.
+        build_src = self.get_finalized_command('build_src')
+        modules += build_src.py_modules_dict.get(package, [])
+
+        return modules
+
+    def find_modules(self):
+        old_py_modules = self.py_modules[:]
+        new_py_modules = [_m for _m in self.py_modules if is_string(_m)]
+        self.py_modules[:] = new_py_modules
+        modules = old_build_py.find_modules(self)
+        self.py_modules[:] = old_py_modules
+
+        return modules
+
+    # XXX: Fix find_source_files for item in py_modules such that item is 3-tuple
+    # and item[2] is source file.
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build_scripts.py b/venv/Lib/site-packages/numpy/distutils/command/build_scripts.py
new file mode 100644
index 000000000..d5cadb274
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build_scripts.py
@@ -0,0 +1,49 @@
+""" Modified version of build_scripts that handles building scripts from functions.
+
+"""
+from distutils.command.build_scripts import build_scripts as old_build_scripts
+from numpy.distutils import log
+from numpy.distutils.misc_util import is_string
+
+class build_scripts(old_build_scripts):
+
+    def generate_scripts(self, scripts):
+        new_scripts = []
+        func_scripts = []
+        for script in scripts:
+            if is_string(script):
+                new_scripts.append(script)
+            else:
+                func_scripts.append(script)
+        if not func_scripts:
+            return new_scripts
+
+        build_dir = self.build_dir
+        self.mkpath(build_dir)
+        for func in func_scripts:
+            script = func(build_dir)
+            if not script:
+                continue
+            if is_string(script):
+                log.info("  adding '%s' to scripts" % (script,))
+                new_scripts.append(script)
+            else:
+                [log.info("  adding '%s' to scripts" % (s,)) for s in script]
+                new_scripts.extend(list(script))
+        return new_scripts
+
+    def run (self):
+        if not self.scripts:
+            return
+
+        self.scripts = self.generate_scripts(self.scripts)
+        # Now make sure that the distribution object has this list of scripts.
+        # setuptools' develop command requires that this be a list of filenames,
+        # not functions.
+        self.distribution.scripts = self.scripts
+
+        return old_build_scripts.run(self)
+
+    def get_source_files(self):
+        from numpy.distutils.misc_util import get_script_files
+        return get_script_files(self.scripts)
diff --git a/venv/Lib/site-packages/numpy/distutils/command/build_src.py b/venv/Lib/site-packages/numpy/distutils/command/build_src.py
new file mode 100644
index 000000000..303d6197c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/build_src.py
@@ -0,0 +1,773 @@
+""" Build swig and f2py sources.
+"""
+import os
+import re
+import sys
+import shlex
+import copy
+
+from distutils.command import build_ext
+from distutils.dep_util import newer_group, newer
+from distutils.util import get_platform
+from distutils.errors import DistutilsError, DistutilsSetupError
+
+
+# this import can't be done here, as it uses numpy stuff only available
+# after it's installed
+#import numpy.f2py
+from numpy.distutils import log
+from numpy.distutils.misc_util import (
+    fortran_ext_match, appendpath, is_string, is_sequence, get_cmd
+    )
+from numpy.distutils.from_template import process_file as process_f_file
+from numpy.distutils.conv_template import process_file as process_c_file
+
+def subst_vars(target, source, d):
+    """Substitute any occurrence of @foo@ by d['foo'] from source file into
+    target."""
+    var = re.compile('@([a-zA-Z_]+)@')
+    with open(source, 'r') as fs:
+        with open(target, 'w') as ft:
+            for l in fs:
+                m = var.search(l)
+                if m:
+                    ft.write(l.replace('@%s@' % m.group(1), d[m.group(1)]))
+                else:
+                    ft.write(l)
+
+class build_src(build_ext.build_ext):
+
+    description = "build sources from SWIG, F2PY files or a function"
+
+    user_options = [
+        ('build-src=', 'd', "directory to \"build\" sources to"),
+        ('f2py-opts=', None, "list of f2py command line options"),
+        ('swig=', None, "path to the SWIG executable"),
+        ('swig-opts=', None, "list of SWIG command line options"),
+        ('swig-cpp', None, "make SWIG create C++ files (default is autodetected from sources)"),
+        ('f2pyflags=', None, "additional flags to f2py (use --f2py-opts= instead)"), # obsolete
+        ('swigflags=', None, "additional flags to swig (use --swig-opts= instead)"), # obsolete
+        ('force', 'f', "forcibly build everything (ignore file timestamps)"),
+        ('inplace', 'i',
+         "ignore build-lib and put compiled extensions into the source " +
+         "directory alongside your pure Python modules"),
+        ('verbose-cfg', None,
+         "change logging level from WARN to INFO which will show all " +
+         "compiler output")
+        ]
+
+    boolean_options = ['force', 'inplace', 'verbose-cfg']
+
+    help_options = []
+
+    def initialize_options(self):
+        self.extensions = None
+        self.package = None
+        self.py_modules = None
+        self.py_modules_dict = None
+        self.build_src = None
+        self.build_lib = None
+        self.build_base = None
+        self.force = None
+        self.inplace = None
+        self.package_dir = None
+        self.f2pyflags = None # obsolete
+        self.f2py_opts = None
+        self.swigflags = None # obsolete
+        self.swig_opts = None
+        self.swig_cpp = None
+        self.swig = None
+        self.verbose_cfg = None
+
+    def finalize_options(self):
+        self.set_undefined_options('build',
+                                   ('build_base', 'build_base'),
+                                   ('build_lib', 'build_lib'),
+                                   ('force', 'force'))
+        if self.package is None:
+            self.package = self.distribution.ext_package
+        self.extensions = self.distribution.ext_modules
+        self.libraries = self.distribution.libraries or []
+        self.py_modules = self.distribution.py_modules or []
+        self.data_files = self.distribution.data_files or []
+
+        if self.build_src is None:
+            plat_specifier = ".{}-{}.{}".format(get_platform(), *sys.version_info[:2])
+            self.build_src = os.path.join(self.build_base, 'src'+plat_specifier)
+
+        # py_modules_dict is used in build_py.find_package_modules
+        self.py_modules_dict = {}
+
+        if self.f2pyflags:
+            if self.f2py_opts:
+                log.warn('ignoring --f2pyflags as --f2py-opts already used')
+            else:
+                self.f2py_opts = self.f2pyflags
+            self.f2pyflags = None
+        if self.f2py_opts is None:
+            self.f2py_opts = []
+        else:
+            self.f2py_opts = shlex.split(self.f2py_opts)
+
+        if self.swigflags:
+            if self.swig_opts:
+                log.warn('ignoring --swigflags as --swig-opts already used')
+            else:
+                self.swig_opts = self.swigflags
+            self.swigflags = None
+
+        if self.swig_opts is None:
+            self.swig_opts = []
+        else:
+            self.swig_opts = shlex.split(self.swig_opts)
+
+        # use options from build_ext command
+        build_ext = self.get_finalized_command('build_ext')
+        if self.inplace is None:
+            self.inplace = build_ext.inplace
+        if self.swig_cpp is None:
+            self.swig_cpp = build_ext.swig_cpp
+        for c in ['swig', 'swig_opt']:
+            o = '--'+c.replace('_', '-')
+            v = getattr(build_ext, c, None)
+            if v:
+                if getattr(self, c):
+                    log.warn('both build_src and build_ext define %s option' % (o))
+                else:
+                    log.info('using "%s=%s" option from build_ext command' % (o, v))
+                    setattr(self, c, v)
+
+    def run(self):
+        log.info("build_src")
+        if not (self.extensions or self.libraries):
+            return
+        self.build_sources()
+
+    def build_sources(self):
+
+        if self.inplace:
+            self.get_package_dir = \
+                     self.get_finalized_command('build_py').get_package_dir
+
+        self.build_py_modules_sources()
+
+        for libname_info in self.libraries:
+            self.build_library_sources(*libname_info)
+
+        if self.extensions:
+            self.check_extensions_list(self.extensions)
+
+            for ext in self.extensions:
+                self.build_extension_sources(ext)
+
+        self.build_data_files_sources()
+        self.build_npy_pkg_config()
+
+    def build_data_files_sources(self):
+        if not self.data_files:
+            return
+        log.info('building data_files sources')
+        from numpy.distutils.misc_util import get_data_files
+        new_data_files = []
+        for data in self.data_files:
+            if isinstance(data, str):
+                new_data_files.append(data)
+            elif isinstance(data, tuple):
+                d, files = data
+                if self.inplace:
+                    build_dir = self.get_package_dir('.'.join(d.split(os.sep)))
+                else:
+                    build_dir = os.path.join(self.build_src, d)
+                funcs = [f for f in files if hasattr(f, '__call__')]
+                files = [f for f in files if not hasattr(f, '__call__')]
+                for f in funcs:
+                    if f.__code__.co_argcount==1:
+                        s = f(build_dir)
+                    else:
+                        s = f()
+                    if s is not None:
+                        if isinstance(s, list):
+                            files.extend(s)
+                        elif isinstance(s, str):
+                            files.append(s)
+                        else:
+                            raise TypeError(repr(s))
+                filenames = get_data_files((d, files))
+                new_data_files.append((d, filenames))
+            else:
+                raise TypeError(repr(data))
+        self.data_files[:] = new_data_files
+
+
+    def _build_npy_pkg_config(self, info, gd):
+        template, install_dir, subst_dict = info
+        template_dir = os.path.dirname(template)
+        for k, v in gd.items():
+            subst_dict[k] = v
+
+        if self.inplace == 1:
+            generated_dir = os.path.join(template_dir, install_dir)
+        else:
+            generated_dir = os.path.join(self.build_src, template_dir,
+                    install_dir)
+        generated = os.path.basename(os.path.splitext(template)[0])
+        generated_path = os.path.join(generated_dir, generated)
+        if not os.path.exists(generated_dir):
+            os.makedirs(generated_dir)
+
+        subst_vars(generated_path, template, subst_dict)
+
+        # Where to install relatively to install prefix
+        full_install_dir = os.path.join(template_dir, install_dir)
+        return full_install_dir, generated_path
+
+    def build_npy_pkg_config(self):
+        log.info('build_src: building npy-pkg config files')
+
+        # XXX: another ugly workaround to circumvent distutils brain damage. We
+        # need the install prefix here, but finalizing the options of the
+        # install command when only building sources cause error. Instead, we
+        # copy the install command instance, and finalize the copy so that it
+        # does not disrupt how distutils want to do things when with the
+        # original install command instance.
+        install_cmd = copy.copy(get_cmd('install'))
+        if not install_cmd.finalized == 1:
+            install_cmd.finalize_options()
+        build_npkg = False
+        if self.inplace == 1:
+            top_prefix = '.'
+            build_npkg = True
+        elif hasattr(install_cmd, 'install_libbase'):
+            top_prefix = install_cmd.install_libbase
+            build_npkg = True
+
+        if build_npkg:
+            for pkg, infos in self.distribution.installed_pkg_config.items():
+                pkg_path = self.distribution.package_dir[pkg]
+                prefix = os.path.join(os.path.abspath(top_prefix), pkg_path)
+                d = {'prefix': prefix}
+                for info in infos:
+                    install_dir, generated = self._build_npy_pkg_config(info, d)
+                    self.distribution.data_files.append((install_dir,
+                        [generated]))
+
+    def build_py_modules_sources(self):
+        if not self.py_modules:
+            return
+        log.info('building py_modules sources')
+        new_py_modules = []
+        for source in self.py_modules:
+            if is_sequence(source) and len(source)==3:
+                package, module_base, source = source
+                if self.inplace:
+                    build_dir = self.get_package_dir(package)
+                else:
+                    build_dir = os.path.join(self.build_src,
+                                             os.path.join(*package.split('.')))
+                if hasattr(source, '__call__'):
+                    target = os.path.join(build_dir, module_base + '.py')
+                    source = source(target)
+                if source is None:
+                    continue
+                modules = [(package, module_base, source)]
+                if package not in self.py_modules_dict:
+                    self.py_modules_dict[package] = []
+                self.py_modules_dict[package] += modules
+            else:
+                new_py_modules.append(source)
+        self.py_modules[:] = new_py_modules
+
+    def build_library_sources(self, lib_name, build_info):
+        sources = list(build_info.get('sources', []))
+
+        if not sources:
+            return
+
+        log.info('building library "%s" sources' % (lib_name))
+
+        sources = self.generate_sources(sources, (lib_name, build_info))
+
+        sources = self.template_sources(sources, (lib_name, build_info))
+
+        sources, h_files = self.filter_h_files(sources)
+
+        if h_files:
+            log.info('%s - nothing done with h_files = %s',
+                     self.package, h_files)
+
+        #for f in h_files:
+        #    self.distribution.headers.append((lib_name,f))
+
+        build_info['sources'] = sources
+        return
+
+    def build_extension_sources(self, ext):
+
+        sources = list(ext.sources)
+
+        log.info('building extension "%s" sources' % (ext.name))
+
+        fullname = self.get_ext_fullname(ext.name)
+
+        modpath = fullname.split('.')
+        package = '.'.join(modpath[0:-1])
+
+        if self.inplace:
+            self.ext_target_dir = self.get_package_dir(package)
+
+        sources = self.generate_sources(sources, ext)
+        sources = self.template_sources(sources, ext)
+        sources = self.swig_sources(sources, ext)
+        sources = self.f2py_sources(sources, ext)
+        sources = self.pyrex_sources(sources, ext)
+
+        sources, py_files = self.filter_py_files(sources)
+
+        if package not in self.py_modules_dict:
+            self.py_modules_dict[package] = []
+        modules = []
+        for f in py_files:
+            module = os.path.splitext(os.path.basename(f))[0]
+            modules.append((package, module, f))
+        self.py_modules_dict[package] += modules
+
+        sources, h_files = self.filter_h_files(sources)
+
+        if h_files:
+            log.info('%s - nothing done with h_files = %s',
+                     package, h_files)
+        #for f in h_files:
+        #    self.distribution.headers.append((package,f))
+
+        ext.sources = sources
+
+    def generate_sources(self, sources, extension):
+        new_sources = []
+        func_sources = []
+        for source in sources:
+            if is_string(source):
+                new_sources.append(source)
+            else:
+                func_sources.append(source)
+        if not func_sources:
+            return new_sources
+        if self.inplace and not is_sequence(extension):
+            build_dir = self.ext_target_dir
+        else:
+            if is_sequence(extension):
+                name = extension[0]
+            #    if 'include_dirs' not in extension[1]:
+            #        extension[1]['include_dirs'] = []
+            #    incl_dirs = extension[1]['include_dirs']
+            else:
+                name = extension.name
+            #    incl_dirs = extension.include_dirs
+            #if self.build_src not in incl_dirs:
+            #    incl_dirs.append(self.build_src)
+            build_dir = os.path.join(*([self.build_src]
+                                       +name.split('.')[:-1]))
+        self.mkpath(build_dir)
+
+        if self.verbose_cfg:
+            new_level = log.INFO
+        else:
+            new_level = log.WARN
+        old_level = log.set_threshold(new_level)
+
+        for func in func_sources:
+            source = func(extension, build_dir)
+            if not source:
+                continue
+            if is_sequence(source):
+                [log.info("  adding '%s' to sources." % (s,)) for s in source]
+                new_sources.extend(source)
+            else:
+                log.info("  adding '%s' to sources." % (source,))
+                new_sources.append(source)
+        log.set_threshold(old_level)
+        return new_sources
+
+    def filter_py_files(self, sources):
+        return self.filter_files(sources, ['.py'])
+
+    def filter_h_files(self, sources):
+        return self.filter_files(sources, ['.h', '.hpp', '.inc'])
+
+    def filter_files(self, sources, exts = []):
+        new_sources = []
+        files = []
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext in exts:
+                files.append(source)
+            else:
+                new_sources.append(source)
+        return new_sources, files
+
+    def template_sources(self, sources, extension):
+        new_sources = []
+        if is_sequence(extension):
+            depends = extension[1].get('depends')
+            include_dirs = extension[1].get('include_dirs')
+        else:
+            depends = extension.depends
+            include_dirs = extension.include_dirs
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext == '.src':  # Template file
+                if self.inplace:
+                    target_dir = os.path.dirname(base)
+                else:
+                    target_dir = appendpath(self.build_src, os.path.dirname(base))
+                self.mkpath(target_dir)
+                target_file = os.path.join(target_dir, os.path.basename(base))
+                if (self.force or newer_group([source] + depends, target_file)):
+                    if _f_pyf_ext_match(base):
+                        log.info("from_template:> %s" % (target_file))
+                        outstr = process_f_file(source)
+                    else:
+                        log.info("conv_template:> %s" % (target_file))
+                        outstr = process_c_file(source)
+                    with open(target_file, 'w') as fid:
+                        fid.write(outstr)
+                if _header_ext_match(target_file):
+                    d = os.path.dirname(target_file)
+                    if d not in include_dirs:
+                        log.info("  adding '%s' to include_dirs." % (d))
+                        include_dirs.append(d)
+                new_sources.append(target_file)
+            else:
+                new_sources.append(source)
+        return new_sources
+
+    def pyrex_sources(self, sources, extension):
+        """Pyrex not supported; this remains for Cython support (see below)"""
+        new_sources = []
+        ext_name = extension.name.split('.')[-1]
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext == '.pyx':
+                target_file = self.generate_a_pyrex_source(base, ext_name,
+                                                           source,
+                                                           extension)
+                new_sources.append(target_file)
+            else:
+                new_sources.append(source)
+        return new_sources
+
+    def generate_a_pyrex_source(self, base, ext_name, source, extension):
+        """Pyrex is not supported, but some projects monkeypatch this method.
+
+        That allows compiling Cython code, see gh-6955.
+        This method will remain here for compatibility reasons.
+        """
+        return []
+
+    def f2py_sources(self, sources, extension):
+        new_sources = []
+        f2py_sources = []
+        f_sources = []
+        f2py_targets = {}
+        target_dirs = []
+        ext_name = extension.name.split('.')[-1]
+        skip_f2py = 0
+
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext == '.pyf': # F2PY interface file
+                if self.inplace:
+                    target_dir = os.path.dirname(base)
+                else:
+                    target_dir = appendpath(self.build_src, os.path.dirname(base))
+                if os.path.isfile(source):
+                    name = get_f2py_modulename(source)
+                    if name != ext_name:
+                        raise DistutilsSetupError('mismatch of extension names: %s '
+                                                  'provides %r but expected %r' % (
+                            source, name, ext_name))
+                    target_file = os.path.join(target_dir, name+'module.c')
+                else:
+                    log.debug('  source %s does not exist: skipping f2py\'ing.' \
+                              % (source))
+                    name = ext_name
+                    skip_f2py = 1
+                    target_file = os.path.join(target_dir, name+'module.c')
+                    if not os.path.isfile(target_file):
+                        log.warn('  target %s does not exist:\n   '\
+                                 'Assuming %smodule.c was generated with '\
+                                 '"build_src --inplace" command.' \
+                                 % (target_file, name))
+                        target_dir = os.path.dirname(base)
+                        target_file = os.path.join(target_dir, name+'module.c')
+                        if not os.path.isfile(target_file):
+                            raise DistutilsSetupError("%r missing" % (target_file,))
+                        log.info('   Yes! Using %r as up-to-date target.' \
+                                 % (target_file))
+                target_dirs.append(target_dir)
+                f2py_sources.append(source)
+                f2py_targets[source] = target_file
+                new_sources.append(target_file)
+            elif fortran_ext_match(ext):
+                f_sources.append(source)
+            else:
+                new_sources.append(source)
+
+        if not (f2py_sources or f_sources):
+            return new_sources
+
+        for d in target_dirs:
+            self.mkpath(d)
+
+        f2py_options = extension.f2py_options + self.f2py_opts
+
+        if self.distribution.libraries:
+            for name, build_info in self.distribution.libraries:
+                if name in extension.libraries:
+                    f2py_options.extend(build_info.get('f2py_options', []))
+
+        log.info("f2py options: %s" % (f2py_options))
+
+        if f2py_sources:
+            if len(f2py_sources) != 1:
+                raise DistutilsSetupError(
+                    'only one .pyf file is allowed per extension module but got'\
+                    ' more: %r' % (f2py_sources,))
+            source = f2py_sources[0]
+            target_file = f2py_targets[source]
+            target_dir = os.path.dirname(target_file) or '.'
+            depends = [source] + extension.depends
+            if (self.force or newer_group(depends, target_file, 'newer')) \
+                   and not skip_f2py:
+                log.info("f2py: %s" % (source))
+                import numpy.f2py
+                numpy.f2py.run_main(f2py_options
+                                    + ['--build-dir', target_dir, source])
+            else:
+                log.debug("  skipping '%s' f2py interface (up-to-date)" % (source))
+        else:
+            #XXX TODO: --inplace support for sdist command
+            if is_sequence(extension):
+                name = extension[0]
+            else: name = extension.name
+            target_dir = os.path.join(*([self.build_src]
+                                        +name.split('.')[:-1]))
+            target_file = os.path.join(target_dir, ext_name + 'module.c')
+            new_sources.append(target_file)
+            depends = f_sources + extension.depends
+            if (self.force or newer_group(depends, target_file, 'newer')) \
+                   and not skip_f2py:
+                log.info("f2py:> %s" % (target_file))
+                self.mkpath(target_dir)
+                import numpy.f2py
+                numpy.f2py.run_main(f2py_options + ['--lower',
+                                                '--build-dir', target_dir]+\
+                                ['-m', ext_name]+f_sources)
+            else:
+                log.debug("  skipping f2py fortran files for '%s' (up-to-date)"\
+                          % (target_file))
+
+        if not os.path.isfile(target_file):
+            raise DistutilsError("f2py target file %r not generated" % (target_file,))
+
+        build_dir = os.path.join(self.build_src, target_dir)
+        target_c = os.path.join(build_dir, 'fortranobject.c')
+        target_h = os.path.join(build_dir, 'fortranobject.h')
+        log.info("  adding '%s' to sources." % (target_c))
+        new_sources.append(target_c)
+        if build_dir not in extension.include_dirs:
+            log.info("  adding '%s' to include_dirs." % (build_dir))
+            extension.include_dirs.append(build_dir)
+
+        if not skip_f2py:
+            import numpy.f2py
+            d = os.path.dirname(numpy.f2py.__file__)
+            source_c = os.path.join(d, 'src', 'fortranobject.c')
+            source_h = os.path.join(d, 'src', 'fortranobject.h')
+            if newer(source_c, target_c) or newer(source_h, target_h):
+                self.mkpath(os.path.dirname(target_c))
+                self.copy_file(source_c, target_c)
+                self.copy_file(source_h, target_h)
+        else:
+            if not os.path.isfile(target_c):
+                raise DistutilsSetupError("f2py target_c file %r not found" % (target_c,))
+            if not os.path.isfile(target_h):
+                raise DistutilsSetupError("f2py target_h file %r not found" % (target_h,))
+
+        for name_ext in ['-f2pywrappers.f', '-f2pywrappers2.f90']:
+            filename = os.path.join(target_dir, ext_name + name_ext)
+            if os.path.isfile(filename):
+                log.info("  adding '%s' to sources." % (filename))
+                f_sources.append(filename)
+
+        return new_sources + f_sources
+
+    def swig_sources(self, sources, extension):
+        # Assuming SWIG 1.3.14 or later. See compatibility note in
+        #   http://www.swig.org/Doc1.3/Python.html#Python_nn6
+
+        new_sources = []
+        swig_sources = []
+        swig_targets = {}
+        target_dirs = []
+        py_files = []     # swig generated .py files
+        target_ext = '.c'
+        if '-c++' in extension.swig_opts:
+            typ = 'c++'
+            is_cpp = True
+            extension.swig_opts.remove('-c++')
+        elif self.swig_cpp:
+            typ = 'c++'
+            is_cpp = True
+        else:
+            typ = None
+            is_cpp = False
+        skip_swig = 0
+        ext_name = extension.name.split('.')[-1]
+
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext == '.i': # SWIG interface file
+                # the code below assumes that the sources list
+                # contains not more than one .i SWIG interface file
+                if self.inplace:
+                    target_dir = os.path.dirname(base)
+                    py_target_dir = self.ext_target_dir
+                else:
+                    target_dir = appendpath(self.build_src, os.path.dirname(base))
+                    py_target_dir = target_dir
+                if os.path.isfile(source):
+                    name = get_swig_modulename(source)
+                    if name != ext_name[1:]:
+                        raise DistutilsSetupError(
+                            'mismatch of extension names: %s provides %r'
+                            ' but expected %r' % (source, name, ext_name[1:]))
+                    if typ is None:
+                        typ = get_swig_target(source)
+                        is_cpp = typ=='c++'
+                    else:
+                        typ2 = get_swig_target(source)
+                        if typ2 is None:
+                            log.warn('source %r does not define swig target, assuming %s swig target' \
+                                     % (source, typ))
+                        elif typ!=typ2:
+                            log.warn('expected %r but source %r defines %r swig target' \
+                                     % (typ, source, typ2))
+                            if typ2=='c++':
+                                log.warn('resetting swig target to c++ (some targets may have .c extension)')
+                                is_cpp = True
+                            else:
+                                log.warn('assuming that %r has c++ swig target' % (source))
+                    if is_cpp:
+                        target_ext = '.cpp'
+                    target_file = os.path.join(target_dir, '%s_wrap%s' \
+                                               % (name, target_ext))
+                else:
+                    log.warn('  source %s does not exist: skipping swig\'ing.' \
+                             % (source))
+                    name = ext_name[1:]
+                    skip_swig = 1
+                    target_file = _find_swig_target(target_dir, name)
+                    if not os.path.isfile(target_file):
+                        log.warn('  target %s does not exist:\n   '\
+                                 'Assuming %s_wrap.{c,cpp} was generated with '\
+                                 '"build_src --inplace" command.' \
+                                 % (target_file, name))
+                        target_dir = os.path.dirname(base)
+                        target_file = _find_swig_target(target_dir, name)
+                        if not os.path.isfile(target_file):
+                            raise DistutilsSetupError("%r missing" % (target_file,))
+                        log.warn('   Yes! Using %r as up-to-date target.' \
+                                 % (target_file))
+                target_dirs.append(target_dir)
+                new_sources.append(target_file)
+                py_files.append(os.path.join(py_target_dir, name+'.py'))
+                swig_sources.append(source)
+                swig_targets[source] = new_sources[-1]
+            else:
+                new_sources.append(source)
+
+        if not swig_sources:
+            return new_sources
+
+        if skip_swig:
+            return new_sources + py_files
+
+        for d in target_dirs:
+            self.mkpath(d)
+
+        swig = self.swig or self.find_swig()
+        swig_cmd = [swig, "-python"] + extension.swig_opts
+        if is_cpp:
+            swig_cmd.append('-c++')
+        for d in extension.include_dirs:
+            swig_cmd.append('-I'+d)
+        for source in swig_sources:
+            target = swig_targets[source]
+            depends = [source] + extension.depends
+            if self.force or newer_group(depends, target, 'newer'):
+                log.info("%s: %s" % (os.path.basename(swig) \
+                                     + (is_cpp and '++' or ''), source))
+                self.spawn(swig_cmd + self.swig_opts \
+                           + ["-o", target, '-outdir', py_target_dir, source])
+            else:
+                log.debug("  skipping '%s' swig interface (up-to-date)" \
+                         % (source))
+
+        return new_sources + py_files
+
+_f_pyf_ext_match = re.compile(r'.*[.](f90|f95|f77|for|ftn|f|pyf)\Z', re.I).match
+_header_ext_match = re.compile(r'.*[.](inc|h|hpp)\Z', re.I).match
+
+#### SWIG related auxiliary functions ####
+_swig_module_name_match = re.compile(r'\s*%module\s*(.*\(\s*package\s*=\s*"(?P<package>[\w_]+)".*\)|)\s*(?P<name>[\w_]+)',
+                                     re.I).match
+_has_c_header = re.compile(r'-[*]-\s*c\s*-[*]-', re.I).search
+_has_cpp_header = re.compile(r'-[*]-\s*c[+][+]\s*-[*]-', re.I).search
+
+def get_swig_target(source):
+    with open(source, 'r') as f:
+        result = None
+        line = f.readline()
+        if _has_cpp_header(line):
+            result = 'c++'
+        if _has_c_header(line):
+            result = 'c'
+    return result
+
+def get_swig_modulename(source):
+    with open(source, 'r') as f:
+        name = None
+        for line in f:
+            m = _swig_module_name_match(line)
+            if m:
+                name = m.group('name')
+                break
+    return name
+
+def _find_swig_target(target_dir, name):
+    for ext in ['.cpp', '.c']:
+        target = os.path.join(target_dir, '%s_wrap%s' % (name, ext))
+        if os.path.isfile(target):
+            break
+    return target
+
+#### F2PY related auxiliary functions ####
+
+_f2py_module_name_match = re.compile(r'\s*python\s*module\s*(?P<name>[\w_]+)',
+                                     re.I).match
+_f2py_user_module_name_match = re.compile(r'\s*python\s*module\s*(?P<name>[\w_]*?'
+                                          r'__user__[\w_]*)', re.I).match
+
+def get_f2py_modulename(source):
+    name = None
+    with open(source) as f:
+        for line in f:
+            m = _f2py_module_name_match(line)
+            if m:
+                if _f2py_user_module_name_match(line): # skip *__user__* names
+                    continue
+                name = m.group('name')
+                break
+    return name
+
+##########################################
diff --git a/venv/Lib/site-packages/numpy/distutils/command/config.py b/venv/Lib/site-packages/numpy/distutils/command/config.py
new file mode 100644
index 000000000..e54a54449
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/config.py
@@ -0,0 +1,510 @@
+# Added Fortran compiler support to config. Currently useful only for
+# try_compile call. try_run works but is untested for most of Fortran
+# compilers (they must define linker_exe first).
+# Pearu Peterson
+import os
+import signal
+import subprocess
+import sys
+import textwrap
+import warnings
+
+from distutils.command.config import config as old_config
+from distutils.command.config import LANG_EXT
+from distutils import log
+from distutils.file_util import copy_file
+from distutils.ccompiler import CompileError, LinkError
+import distutils
+from numpy.distutils.exec_command import filepath_from_subprocess_output
+from numpy.distutils.mingw32ccompiler import generate_manifest
+from numpy.distutils.command.autodist import (check_gcc_function_attribute,
+                                              check_gcc_function_attribute_with_intrinsics,
+                                              check_gcc_variable_attribute,
+                                              check_inline,
+                                              check_restrict,
+                                              check_compiler_gcc4)
+
+LANG_EXT['f77'] = '.f'
+LANG_EXT['f90'] = '.f90'
+
+class config(old_config):
+    old_config.user_options += [
+        ('fcompiler=', None, "specify the Fortran compiler type"),
+        ]
+
+    def initialize_options(self):
+        self.fcompiler = None
+        old_config.initialize_options(self)
+
+    def _check_compiler (self):
+        old_config._check_compiler(self)
+        from numpy.distutils.fcompiler import FCompiler, new_fcompiler
+
+        if sys.platform == 'win32' and (self.compiler.compiler_type in
+                                        ('msvc', 'intelw', 'intelemw')):
+            # XXX: hack to circumvent a python 2.6 bug with msvc9compiler:
+            # initialize call query_vcvarsall, which throws an IOError, and
+            # causes an error along the way without much information. We try to
+            # catch it here, hoping it is early enough, and print an helpful
+            # message instead of Error: None.
+            if not self.compiler.initialized:
+                try:
+                    self.compiler.initialize()
+                except IOError as e:
+                    msg = textwrap.dedent("""\
+                        Could not initialize compiler instance: do you have Visual Studio
+                        installed?  If you are trying to build with MinGW, please use "python setup.py
+                        build -c mingw32" instead.  If you have Visual Studio installed, check it is
+                        correctly installed, and the right version (VS 2008 for python 2.6, 2.7 and 3.2,
+                        VS 2010 for >= 3.3).
+
+                        Original exception was: %s, and the Compiler class was %s
+                        ============================================================================""") \
+                        % (e, self.compiler.__class__.__name__)
+                    print(textwrap.dedent("""\
+                        ============================================================================"""))
+                    raise distutils.errors.DistutilsPlatformError(msg)
+
+            # After MSVC is initialized, add an explicit /MANIFEST to linker
+            # flags.  See issues gh-4245 and gh-4101 for details.  Also
+            # relevant are issues 4431 and 16296 on the Python bug tracker.
+            from distutils import msvc9compiler
+            if msvc9compiler.get_build_version() >= 10:
+                for ldflags in [self.compiler.ldflags_shared,
+                                self.compiler.ldflags_shared_debug]:
+                    if '/MANIFEST' not in ldflags:
+                        ldflags.append('/MANIFEST')
+
+        if not isinstance(self.fcompiler, FCompiler):
+            self.fcompiler = new_fcompiler(compiler=self.fcompiler,
+                                           dry_run=self.dry_run, force=1,
+                                           c_compiler=self.compiler)
+            if self.fcompiler is not None:
+                self.fcompiler.customize(self.distribution)
+                if self.fcompiler.get_version():
+                    self.fcompiler.customize_cmd(self)
+                    self.fcompiler.show_customization()
+
+    def _wrap_method(self, mth, lang, args):
+        from distutils.ccompiler import CompileError
+        from distutils.errors import DistutilsExecError
+        save_compiler = self.compiler
+        if lang in ['f77', 'f90']:
+            self.compiler = self.fcompiler
+        try:
+            ret = mth(*((self,)+args))
+        except (DistutilsExecError, CompileError) as e:
+            str(e)
+            self.compiler = save_compiler
+            raise CompileError
+        self.compiler = save_compiler
+        return ret
+
+    def _compile (self, body, headers, include_dirs, lang):
+        src, obj = self._wrap_method(old_config._compile, lang,
+                                     (body, headers, include_dirs, lang))
+        # _compile in unixcompiler.py sometimes creates .d dependency files.
+        # Clean them up.
+        self.temp_files.append(obj + '.d')
+        return src, obj
+
+    def _link (self, body,
+               headers, include_dirs,
+               libraries, library_dirs, lang):
+        if self.compiler.compiler_type=='msvc':
+            libraries = (libraries or [])[:]
+            library_dirs = (library_dirs or [])[:]
+            if lang in ['f77', 'f90']:
+                lang = 'c' # always use system linker when using MSVC compiler
+                if self.fcompiler:
+                    for d in self.fcompiler.library_dirs or []:
+                        # correct path when compiling in Cygwin but with
+                        # normal Win Python
+                        if d.startswith('/usr/lib'):
+                            try:
+                                d = subprocess.check_output(['cygpath',
+                                                             '-w', d])
+                            except (OSError, subprocess.CalledProcessError):
+                                pass
+                            else:
+                                d = filepath_from_subprocess_output(d)
+                        library_dirs.append(d)
+                    for libname in self.fcompiler.libraries or []:
+                        if libname not in libraries:
+                            libraries.append(libname)
+            for libname in libraries:
+                if libname.startswith('msvc'): continue
+                fileexists = False
+                for libdir in library_dirs or []:
+                    libfile = os.path.join(libdir, '%s.lib' % (libname))
+                    if os.path.isfile(libfile):
+                        fileexists = True
+                        break
+                if fileexists: continue
+                # make g77-compiled static libs available to MSVC
+                fileexists = False
+                for libdir in library_dirs:
+                    libfile = os.path.join(libdir, 'lib%s.a' % (libname))
+                    if os.path.isfile(libfile):
+                        # copy libname.a file to name.lib so that MSVC linker
+                        # can find it
+                        libfile2 = os.path.join(libdir, '%s.lib' % (libname))
+                        copy_file(libfile, libfile2)
+                        self.temp_files.append(libfile2)
+                        fileexists = True
+                        break
+                if fileexists: continue
+                log.warn('could not find library %r in directories %s' \
+                         % (libname, library_dirs))
+        elif self.compiler.compiler_type == 'mingw32':
+            generate_manifest(self)
+        return self._wrap_method(old_config._link, lang,
+                                 (body, headers, include_dirs,
+                                  libraries, library_dirs, lang))
+
+    def check_header(self, header, include_dirs=None, library_dirs=None, lang='c'):
+        self._check_compiler()
+        return self.try_compile(
+                "/* we need a dummy line to make distutils happy */",
+                [header], include_dirs)
+
+    def check_decl(self, symbol,
+                   headers=None, include_dirs=None):
+        self._check_compiler()
+        body = textwrap.dedent("""
+            int main(void)
+            {
+            #ifndef %s
+                (void) %s;
+            #endif
+                ;
+                return 0;
+            }""") % (symbol, symbol)
+
+        return self.try_compile(body, headers, include_dirs)
+
+    def check_macro_true(self, symbol,
+                         headers=None, include_dirs=None):
+        self._check_compiler()
+        body = textwrap.dedent("""
+            int main(void)
+            {
+            #if %s
+            #else
+            #error false or undefined macro
+            #endif
+                ;
+                return 0;
+            }""") % (symbol,)
+
+        return self.try_compile(body, headers, include_dirs)
+
+    def check_type(self, type_name, headers=None, include_dirs=None,
+            library_dirs=None):
+        """Check type availability. Return True if the type can be compiled,
+        False otherwise"""
+        self._check_compiler()
+
+        # First check the type can be compiled
+        body = textwrap.dedent(r"""
+            int main(void) {
+              if ((%(name)s *) 0)
+                return 0;
+              if (sizeof (%(name)s))
+                return 0;
+            }
+            """) % {'name': type_name}
+
+        st = False
+        try:
+            try:
+                self._compile(body % {'type': type_name},
+                        headers, include_dirs, 'c')
+                st = True
+            except distutils.errors.CompileError:
+                st = False
+        finally:
+            self._clean()
+
+        return st
+
+    def check_type_size(self, type_name, headers=None, include_dirs=None, library_dirs=None, expected=None):
+        """Check size of a given type."""
+        self._check_compiler()
+
+        # First check the type can be compiled
+        body = textwrap.dedent(r"""
+            typedef %(type)s npy_check_sizeof_type;
+            int main (void)
+            {
+                static int test_array [1 - 2 * !(((long) (sizeof (npy_check_sizeof_type))) >= 0)];
+                test_array [0] = 0
+
+                ;
+                return 0;
+            }
+            """)
+        self._compile(body % {'type': type_name},
+                headers, include_dirs, 'c')
+        self._clean()
+
+        if expected:
+            body = textwrap.dedent(r"""
+                typedef %(type)s npy_check_sizeof_type;
+                int main (void)
+                {
+                    static int test_array [1 - 2 * !(((long) (sizeof (npy_check_sizeof_type))) == %(size)s)];
+                    test_array [0] = 0
+
+                    ;
+                    return 0;
+                }
+                """)
+            for size in expected:
+                try:
+                    self._compile(body % {'type': type_name, 'size': size},
+                            headers, include_dirs, 'c')
+                    self._clean()
+                    return size
+                except CompileError:
+                    pass
+
+        # this fails to *compile* if size > sizeof(type)
+        body = textwrap.dedent(r"""
+            typedef %(type)s npy_check_sizeof_type;
+            int main (void)
+            {
+                static int test_array [1 - 2 * !(((long) (sizeof (npy_check_sizeof_type))) <= %(size)s)];
+                test_array [0] = 0
+
+                ;
+                return 0;
+            }
+            """)
+
+        # The principle is simple: we first find low and high bounds of size
+        # for the type, where low/high are looked up on a log scale. Then, we
+        # do a binary search to find the exact size between low and high
+        low = 0
+        mid = 0
+        while True:
+            try:
+                self._compile(body % {'type': type_name, 'size': mid},
+                        headers, include_dirs, 'c')
+                self._clean()
+                break
+            except CompileError:
+                #log.info("failure to test for bound %d" % mid)
+                low = mid + 1
+                mid = 2 * mid + 1
+
+        high = mid
+        # Binary search:
+        while low != high:
+            mid = (high - low) // 2 + low
+            try:
+                self._compile(body % {'type': type_name, 'size': mid},
+                        headers, include_dirs, 'c')
+                self._clean()
+                high = mid
+            except CompileError:
+                low = mid + 1
+        return low
+
+    def check_func(self, func,
+                   headers=None, include_dirs=None,
+                   libraries=None, library_dirs=None,
+                   decl=False, call=False, call_args=None):
+        # clean up distutils's config a bit: add void to main(), and
+        # return a value.
+        self._check_compiler()
+        body = []
+        if decl:
+            if type(decl) == str:
+                body.append(decl)
+            else:
+                body.append("int %s (void);" % func)
+        # Handle MSVC intrinsics: force MS compiler to make a function call.
+        # Useful to test for some functions when built with optimization on, to
+        # avoid build error because the intrinsic and our 'fake' test
+        # declaration do not match.
+        body.append("#ifdef _MSC_VER")
+        body.append("#pragma function(%s)" % func)
+        body.append("#endif")
+        body.append("int main (void) {")
+        if call:
+            if call_args is None:
+                call_args = ''
+            body.append("  %s(%s);" % (func, call_args))
+        else:
+            body.append("  %s;" % func)
+        body.append("  return 0;")
+        body.append("}")
+        body = '\n'.join(body) + "\n"
+
+        return self.try_link(body, headers, include_dirs,
+                             libraries, library_dirs)
+
+    def check_funcs_once(self, funcs,
+                   headers=None, include_dirs=None,
+                   libraries=None, library_dirs=None,
+                   decl=False, call=False, call_args=None):
+        """Check a list of functions at once.
+
+        This is useful to speed up things, since all the functions in the funcs
+        list will be put in one compilation unit.
+
+        Arguments
+        ---------
+        funcs : seq
+            list of functions to test
+        include_dirs : seq
+            list of header paths
+        libraries : seq
+            list of libraries to link the code snippet to
+        library_dirs : seq
+            list of library paths
+        decl : dict
+            for every (key, value), the declaration in the value will be
+            used for function in key. If a function is not in the
+            dictionary, no declaration will be used.
+        call : dict
+            for every item (f, value), if the value is True, a call will be
+            done to the function f.
+        """
+        self._check_compiler()
+        body = []
+        if decl:
+            for f, v in decl.items():
+                if v:
+                    body.append("int %s (void);" % f)
+
+        # Handle MS intrinsics. See check_func for more info.
+        body.append("#ifdef _MSC_VER")
+        for func in funcs:
+            body.append("#pragma function(%s)" % func)
+        body.append("#endif")
+
+        body.append("int main (void) {")
+        if call:
+            for f in funcs:
+                if f in call and call[f]:
+                    if not (call_args and f in call_args and call_args[f]):
+                        args = ''
+                    else:
+                        args = call_args[f]
+                    body.append("  %s(%s);" % (f, args))
+                else:
+                    body.append("  %s;" % f)
+        else:
+            for f in funcs:
+                body.append("  %s;" % f)
+        body.append("  return 0;")
+        body.append("}")
+        body = '\n'.join(body) + "\n"
+
+        return self.try_link(body, headers, include_dirs,
+                             libraries, library_dirs)
+
+    def check_inline(self):
+        """Return the inline keyword recognized by the compiler, empty string
+        otherwise."""
+        return check_inline(self)
+
+    def check_restrict(self):
+        """Return the restrict keyword recognized by the compiler, empty string
+        otherwise."""
+        return check_restrict(self)
+
+    def check_compiler_gcc4(self):
+        """Return True if the C compiler is gcc >= 4."""
+        return check_compiler_gcc4(self)
+
+    def check_gcc_function_attribute(self, attribute, name):
+        return check_gcc_function_attribute(self, attribute, name)
+
+    def check_gcc_function_attribute_with_intrinsics(self, attribute, name,
+                                                     code, include):
+        return check_gcc_function_attribute_with_intrinsics(self, attribute,
+                                                            name, code, include)
+
+    def check_gcc_variable_attribute(self, attribute):
+        return check_gcc_variable_attribute(self, attribute)
+
+    def get_output(self, body, headers=None, include_dirs=None,
+                   libraries=None, library_dirs=None,
+                   lang="c", use_tee=None):
+        """Try to compile, link to an executable, and run a program
+        built from 'body' and 'headers'. Returns the exit status code
+        of the program and its output.
+        """
+        # 2008-11-16, RemoveMe
+        warnings.warn("\n+++++++++++++++++++++++++++++++++++++++++++++++++\n"
+                      "Usage of get_output is deprecated: please do not \n"
+                      "use it anymore, and avoid configuration checks \n"
+                      "involving running executable on the target machine.\n"
+                      "+++++++++++++++++++++++++++++++++++++++++++++++++\n",
+                      DeprecationWarning, stacklevel=2)
+        self._check_compiler()
+        exitcode, output = 255, ''
+        try:
+            grabber = GrabStdout()
+            try:
+                src, obj, exe = self._link(body, headers, include_dirs,
+                                           libraries, library_dirs, lang)
+                grabber.restore()
+            except Exception:
+                output = grabber.data
+                grabber.restore()
+                raise
+            exe = os.path.join('.', exe)
+            try:
+                # specify cwd arg for consistency with
+                # historic usage pattern of exec_command()
+                # also, note that exe appears to be a string,
+                # which exec_command() handled, but we now
+                # use a list for check_output() -- this assumes
+                # that exe is always a single command
+                output = subprocess.check_output([exe], cwd='.')
+            except subprocess.CalledProcessError as exc:
+                exitstatus = exc.returncode
+                output = ''
+            except OSError:
+                # preserve the EnvironmentError exit status
+                # used historically in exec_command()
+                exitstatus = 127
+                output = ''
+            else:
+                output = filepath_from_subprocess_output(output)
+            if hasattr(os, 'WEXITSTATUS'):
+                exitcode = os.WEXITSTATUS(exitstatus)
+                if os.WIFSIGNALED(exitstatus):
+                    sig = os.WTERMSIG(exitstatus)
+                    log.error('subprocess exited with signal %d' % (sig,))
+                    if sig == signal.SIGINT:
+                        # control-C
+                        raise KeyboardInterrupt
+            else:
+                exitcode = exitstatus
+            log.info("success!")
+        except (CompileError, LinkError):
+            log.info("failure.")
+        self._clean()
+        return exitcode, output
+
+class GrabStdout:
+
+    def __init__(self):
+        self.sys_stdout = sys.stdout
+        self.data = ''
+        sys.stdout = self
+
+    def write (self, data):
+        self.sys_stdout.write(data)
+        self.data += data
+
+    def flush (self):
+        self.sys_stdout.flush()
+
+    def restore(self):
+        sys.stdout = self.sys_stdout
diff --git a/venv/Lib/site-packages/numpy/distutils/command/config_compiler.py b/venv/Lib/site-packages/numpy/distutils/command/config_compiler.py
new file mode 100644
index 000000000..44265bfcc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/config_compiler.py
@@ -0,0 +1,126 @@
+from distutils.core import Command
+from numpy.distutils import log
+
+#XXX: Linker flags
+
+def show_fortran_compilers(_cache=None):
+    # Using cache to prevent infinite recursion.
+    if _cache:
+        return
+    elif _cache is None:
+        _cache = []
+    _cache.append(1)
+    from numpy.distutils.fcompiler import show_fcompilers
+    import distutils.core
+    dist = distutils.core._setup_distribution
+    show_fcompilers(dist)
+
+class config_fc(Command):
+    """ Distutils command to hold user specified options
+    to Fortran compilers.
+
+    config_fc command is used by the FCompiler.customize() method.
+    """
+
+    description = "specify Fortran 77/Fortran 90 compiler information"
+
+    user_options = [
+        ('fcompiler=', None, "specify Fortran compiler type"),
+        ('f77exec=', None, "specify F77 compiler command"),
+        ('f90exec=', None, "specify F90 compiler command"),
+        ('f77flags=', None, "specify F77 compiler flags"),
+        ('f90flags=', None, "specify F90 compiler flags"),
+        ('opt=', None, "specify optimization flags"),
+        ('arch=', None, "specify architecture specific optimization flags"),
+        ('debug', 'g', "compile with debugging information"),
+        ('noopt', None, "compile without optimization"),
+        ('noarch', None, "compile without arch-dependent optimization"),
+        ]
+
+    help_options = [
+        ('help-fcompiler', None, "list available Fortran compilers",
+         show_fortran_compilers),
+        ]
+
+    boolean_options = ['debug', 'noopt', 'noarch']
+
+    def initialize_options(self):
+        self.fcompiler = None
+        self.f77exec = None
+        self.f90exec = None
+        self.f77flags = None
+        self.f90flags = None
+        self.opt = None
+        self.arch = None
+        self.debug = None
+        self.noopt = None
+        self.noarch = None
+
+    def finalize_options(self):
+        log.info('unifing config_fc, config, build_clib, build_ext, build commands --fcompiler options')
+        build_clib = self.get_finalized_command('build_clib')
+        build_ext = self.get_finalized_command('build_ext')
+        config = self.get_finalized_command('config')
+        build = self.get_finalized_command('build')
+        cmd_list = [self, config, build_clib, build_ext, build]
+        for a in ['fcompiler']:
+            l = []
+            for c in cmd_list:
+                v = getattr(c, a)
+                if v is not None:
+                    if not isinstance(v, str): v = v.compiler_type
+                    if v not in l: l.append(v)
+            if not l: v1 = None
+            else: v1 = l[0]
+            if len(l)>1:
+                log.warn('  commands have different --%s options: %s'\
+                         ', using first in list as default' % (a, l))
+            if v1:
+                for c in cmd_list:
+                    if getattr(c, a) is None: setattr(c, a, v1)
+
+    def run(self):
+        # Do nothing.
+        return
+
+class config_cc(Command):
+    """ Distutils command to hold user specified options
+    to C/C++ compilers.
+    """
+
+    description = "specify C/C++ compiler information"
+
+    user_options = [
+        ('compiler=', None, "specify C/C++ compiler type"),
+        ]
+
+    def initialize_options(self):
+        self.compiler = None
+
+    def finalize_options(self):
+        log.info('unifing config_cc, config, build_clib, build_ext, build commands --compiler options')
+        build_clib = self.get_finalized_command('build_clib')
+        build_ext = self.get_finalized_command('build_ext')
+        config = self.get_finalized_command('config')
+        build = self.get_finalized_command('build')
+        cmd_list = [self, config, build_clib, build_ext, build]
+        for a in ['compiler']:
+            l = []
+            for c in cmd_list:
+                v = getattr(c, a)
+                if v is not None:
+                    if not isinstance(v, str): v = v.compiler_type
+                    if v not in l: l.append(v)
+            if not l: v1 = None
+            else: v1 = l[0]
+            if len(l)>1:
+                log.warn('  commands have different --%s options: %s'\
+                         ', using first in list as default' % (a, l))
+            if v1:
+                for c in cmd_list:
+                    if getattr(c, a) is None: setattr(c, a, v1)
+        return
+
+    def run(self):
+        # Do nothing.
+        return
diff --git a/venv/Lib/site-packages/numpy/distutils/command/develop.py b/venv/Lib/site-packages/numpy/distutils/command/develop.py
new file mode 100644
index 000000000..af24baf2e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/develop.py
@@ -0,0 +1,15 @@
+""" Override the develop command from setuptools so we can ensure that our
+generated files (from build_src or build_scripts) are properly converted to real
+files with filenames.
+
+"""
+from setuptools.command.develop import develop as old_develop
+
+class develop(old_develop):
+    __doc__ = old_develop.__doc__
+    def install_for_development(self):
+        # Build sources in-place, too.
+        self.reinitialize_command('build_src', inplace=1)
+        # Make sure scripts are built.
+        self.run_command('build_scripts')
+        old_develop.install_for_development(self)
diff --git a/venv/Lib/site-packages/numpy/distutils/command/egg_info.py b/venv/Lib/site-packages/numpy/distutils/command/egg_info.py
new file mode 100644
index 000000000..14c62b4d1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/egg_info.py
@@ -0,0 +1,25 @@
+import sys
+
+from setuptools.command.egg_info import egg_info as _egg_info
+
+class egg_info(_egg_info):
+    def run(self):
+        if 'sdist' in sys.argv:
+            import warnings
+            import textwrap
+            msg = textwrap.dedent("""
+                `build_src` is being run, this may lead to missing
+                files in your sdist!  You want to use distutils.sdist
+                instead of the setuptools version:
+
+                    from distutils.command.sdist import sdist
+                    cmdclass={'sdist': sdist}"
+
+                See numpy's setup.py or gh-7131 for details.""")
+            warnings.warn(msg, UserWarning, stacklevel=2)
+
+        # We need to ensure that build_src has been executed in order to give
+        # setuptools' egg_info command real filenames instead of functions which
+        # generate files.
+        self.run_command("build_src")
+        _egg_info.run(self)
diff --git a/venv/Lib/site-packages/numpy/distutils/command/install.py b/venv/Lib/site-packages/numpy/distutils/command/install.py
new file mode 100644
index 000000000..2eff2d145
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/install.py
@@ -0,0 +1,79 @@
+import sys
+if 'setuptools' in sys.modules:
+    import setuptools.command.install as old_install_mod
+    have_setuptools = True
+else:
+    import distutils.command.install as old_install_mod
+    have_setuptools = False
+from distutils.file_util import write_file
+
+old_install = old_install_mod.install
+
+class install(old_install):
+
+    # Always run install_clib - the command is cheap, so no need to bypass it;
+    # but it's not run by setuptools -- so it's run again in install_data
+    sub_commands = old_install.sub_commands + [
+        ('install_clib', lambda x: True)
+    ]
+
+    def finalize_options (self):
+        old_install.finalize_options(self)
+        self.install_lib = self.install_libbase
+
+    def setuptools_run(self):
+        """ The setuptools version of the .run() method.
+
+        We must pull in the entire code so we can override the level used in the
+        _getframe() call since we wrap this call by one more level.
+        """
+        from distutils.command.install import install as distutils_install
+
+        # Explicit request for old-style install?  Just do it
+        if self.old_and_unmanageable or self.single_version_externally_managed:
+            return distutils_install.run(self)
+
+        # Attempt to detect whether we were called from setup() or by another
+        # command.  If we were called by setup(), our caller will be the
+        # 'run_command' method in 'distutils.dist', and *its* caller will be
+        # the 'run_commands' method.  If we were called any other way, our
+        # immediate caller *might* be 'run_command', but it won't have been
+        # called by 'run_commands'.  This is slightly kludgy, but seems to
+        # work.
+        #
+        caller = sys._getframe(3)
+        caller_module = caller.f_globals.get('__name__', '')
+        caller_name = caller.f_code.co_name
+
+        if caller_module != 'distutils.dist' or caller_name!='run_commands':
+            # We weren't called from the command line or setup(), so we
+            # should run in backward-compatibility mode to support bdist_*
+            # commands.
+            distutils_install.run(self)
+        else:
+            self.do_egg_install()
+
+    def run(self):
+        if not have_setuptools:
+            r = old_install.run(self)
+        else:
+            r = self.setuptools_run()
+        if self.record:
+            # bdist_rpm fails when INSTALLED_FILES contains
+            # paths with spaces. Such paths must be enclosed
+            # with double-quotes.
+            with open(self.record, 'r') as f:
+                lines = []
+                need_rewrite = False
+                for l in f:
+                    l = l.rstrip()
+                    if ' ' in l:
+                        need_rewrite = True
+                        l = '"%s"' % (l)
+                    lines.append(l)
+            if need_rewrite:
+                self.execute(write_file,
+                             (self.record, lines),
+                             "re-writing list of installed files to '%s'" %
+                             self.record)
+        return r
diff --git a/venv/Lib/site-packages/numpy/distutils/command/install_clib.py b/venv/Lib/site-packages/numpy/distutils/command/install_clib.py
new file mode 100644
index 000000000..aa2e5594c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/install_clib.py
@@ -0,0 +1,40 @@
+import os
+from distutils.core import Command
+from distutils.ccompiler import new_compiler
+from numpy.distutils.misc_util import get_cmd
+
+class install_clib(Command):
+    description = "Command to install installable C libraries"
+
+    user_options = []
+
+    def initialize_options(self):
+        self.install_dir = None
+        self.outfiles = []
+
+    def finalize_options(self):
+        self.set_undefined_options('install', ('install_lib', 'install_dir'))
+
+    def run (self):
+        build_clib_cmd = get_cmd("build_clib")
+        if not build_clib_cmd.build_clib:
+            # can happen if the user specified `--skip-build`
+            build_clib_cmd.finalize_options()
+        build_dir = build_clib_cmd.build_clib
+
+        # We need the compiler to get the library name -> filename association
+        if not build_clib_cmd.compiler:
+            compiler = new_compiler(compiler=None)
+            compiler.customize(self.distribution)
+        else:
+            compiler = build_clib_cmd.compiler
+
+        for l in self.distribution.installed_libraries:
+            target_dir = os.path.join(self.install_dir, l.target_dir)
+            name = compiler.library_filename(l.name)
+            source = os.path.join(build_dir, name)
+            self.mkpath(target_dir)
+            self.outfiles.append(self.copy_file(source, target_dir)[0])
+
+    def get_outputs(self):
+        return self.outfiles
diff --git a/venv/Lib/site-packages/numpy/distutils/command/install_data.py b/venv/Lib/site-packages/numpy/distutils/command/install_data.py
new file mode 100644
index 000000000..0a2e68ae1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/install_data.py
@@ -0,0 +1,24 @@
+import sys
+have_setuptools = ('setuptools' in sys.modules)
+
+from distutils.command.install_data import install_data as old_install_data
+
+#data installer with improved intelligence over distutils
+#data files are copied into the project directory instead
+#of willy-nilly
+class install_data (old_install_data):
+
+    def run(self):
+        old_install_data.run(self)
+
+        if have_setuptools:
+            # Run install_clib again, since setuptools does not run sub-commands
+            # of install automatically
+            self.run_command('install_clib')
+
+    def finalize_options (self):
+        self.set_undefined_options('install',
+                                   ('install_lib', 'install_dir'),
+                                   ('root', 'root'),
+                                   ('force', 'force'),
+                                  )
diff --git a/venv/Lib/site-packages/numpy/distutils/command/install_headers.py b/venv/Lib/site-packages/numpy/distutils/command/install_headers.py
new file mode 100644
index 000000000..bb4ad563b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/install_headers.py
@@ -0,0 +1,25 @@
+import os
+from distutils.command.install_headers import install_headers as old_install_headers
+
+class install_headers (old_install_headers):
+
+    def run (self):
+        headers = self.distribution.headers
+        if not headers:
+            return
+
+        prefix = os.path.dirname(self.install_dir)
+        for header in headers:
+            if isinstance(header, tuple):
+                # Kind of a hack, but I don't know where else to change this...
+                if header[0] == 'numpy.core':
+                    header = ('numpy', header[1])
+                    if os.path.splitext(header[1])[1] == '.inc':
+                        continue
+                d = os.path.join(*([prefix]+header[0].split('.')))
+                header = header[1]
+            else:
+                d = self.install_dir
+            self.mkpath(d)
+            (out, _) = self.copy_file(header, d)
+            self.outfiles.append(out)
diff --git a/venv/Lib/site-packages/numpy/distutils/command/sdist.py b/venv/Lib/site-packages/numpy/distutils/command/sdist.py
new file mode 100644
index 000000000..e34193883
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/command/sdist.py
@@ -0,0 +1,27 @@
+import sys
+if 'setuptools' in sys.modules:
+    from setuptools.command.sdist import sdist as old_sdist
+else:
+    from distutils.command.sdist import sdist as old_sdist
+
+from numpy.distutils.misc_util import get_data_files
+
+class sdist(old_sdist):
+
+    def add_defaults (self):
+        old_sdist.add_defaults(self)
+
+        dist = self.distribution
+
+        if dist.has_data_files():
+            for data in dist.data_files:
+                self.filelist.extend(get_data_files(data))
+
+        if dist.has_headers():
+            headers = []
+            for h in dist.headers:
+                if isinstance(h, str): headers.append(h)
+                else: headers.append(h[1])
+            self.filelist.extend(headers)
+
+        return
diff --git a/venv/Lib/site-packages/numpy/distutils/conv_template.py b/venv/Lib/site-packages/numpy/distutils/conv_template.py
new file mode 100644
index 000000000..d08015fdf
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/conv_template.py
@@ -0,0 +1,330 @@
+#!/usr/bin/env python3
+"""
+takes templated file .xxx.src and produces .xxx file  where .xxx is
+.i or .c or .h, using the following template rules
+
+/**begin repeat  -- on a line by itself marks the start of a repeated code
+                    segment
+/**end repeat**/ -- on a line by itself marks it's end
+
+After the /**begin repeat and before the */, all the named templates are placed
+these should all have the same number of replacements
+
+Repeat blocks can be nested, with each nested block labeled with its depth,
+i.e.
+/**begin repeat1
+ *....
+ */
+/**end repeat1**/
+
+When using nested loops, you can optionally exclude particular
+combinations of the variables using (inside the comment portion of the inner loop):
+
+ :exclude: var1=value1, var2=value2, ...
+
+This will exclude the pattern where var1 is value1 and var2 is value2 when
+the result is being generated.
+
+
+In the main body each replace will use one entry from the list of named replacements
+
+ Note that all #..# forms in a block must have the same number of
+   comma-separated entries.
+
+Example:
+
+    An input file containing
+
+        /**begin repeat
+         * #a = 1,2,3#
+         * #b = 1,2,3#
+         */
+
+        /**begin repeat1
+         * #c = ted, jim#
+         */
+        @a@, @b@, @c@
+        /**end repeat1**/
+
+        /**end repeat**/
+
+    produces
+
+        line 1 "template.c.src"
+
+        /*
+         *********************************************************************
+         **       This file was autogenerated from a template  DO NOT EDIT!!**
+         **       Changes should be made to the original source (.src) file **
+         *********************************************************************
+         */
+
+        #line 9
+        1, 1, ted
+
+        #line 9
+        1, 1, jim
+
+        #line 9
+        2, 2, ted
+
+        #line 9
+        2, 2, jim
+
+        #line 9
+        3, 3, ted
+
+        #line 9
+        3, 3, jim
+
+"""
+
+__all__ = ['process_str', 'process_file']
+
+import os
+import sys
+import re
+
+# names for replacement that are already global.
+global_names = {}
+
+# header placed at the front of head processed file
+header =\
+"""
+/*
+ *****************************************************************************
+ **       This file was autogenerated from a template  DO NOT EDIT!!!!      **
+ **       Changes should be made to the original source (.src) file         **
+ *****************************************************************************
+ */
+
+"""
+# Parse string for repeat loops
+def parse_structure(astr, level):
+    """
+    The returned line number is from the beginning of the string, starting
+    at zero. Returns an empty list if no loops found.
+
+    """
+    if level == 0 :
+        loopbeg = "/**begin repeat"
+        loopend = "/**end repeat**/"
+    else :
+        loopbeg = "/**begin repeat%d" % level
+        loopend = "/**end repeat%d**/" % level
+
+    ind = 0
+    line = 0
+    spanlist = []
+    while True:
+        start = astr.find(loopbeg, ind)
+        if start == -1:
+            break
+        start2 = astr.find("*/", start)
+        start2 = astr.find("\n", start2)
+        fini1 = astr.find(loopend, start2)
+        fini2 = astr.find("\n", fini1)
+        line += astr.count("\n", ind, start2+1)
+        spanlist.append((start, start2+1, fini1, fini2+1, line))
+        line += astr.count("\n", start2+1, fini2)
+        ind = fini2
+    spanlist.sort()
+    return spanlist
+
+
+def paren_repl(obj):
+    torep = obj.group(1)
+    numrep = obj.group(2)
+    return ','.join([torep]*int(numrep))
+
+parenrep = re.compile(r"[(]([^)]*)[)]\*(\d+)")
+plainrep = re.compile(r"([^*]+)\*(\d+)")
+def parse_values(astr):
+    # replaces all occurrences of '(a,b,c)*4' in astr
+    # with 'a,b,c,a,b,c,a,b,c,a,b,c'. Empty braces generate
+    # empty values, i.e., ()*4 yields ',,,'. The result is
+    # split at ',' and a list of values returned.
+    astr = parenrep.sub(paren_repl, astr)
+    # replaces occurrences of xxx*3 with xxx, xxx, xxx
+    astr = ','.join([plainrep.sub(paren_repl, x.strip())
+                     for x in astr.split(',')])
+    return astr.split(',')
+
+
+stripast = re.compile(r"\n\s*\*?")
+named_re = re.compile(r"#\s*(\w*)\s*=([^#]*)#")
+exclude_vars_re = re.compile(r"(\w*)=(\w*)")
+exclude_re = re.compile(":exclude:")
+def parse_loop_header(loophead) :
+    """Find all named replacements in the header
+
+    Returns a list of dictionaries, one for each loop iteration,
+    where each key is a name to be substituted and the corresponding
+    value is the replacement string.
+
+    Also return a list of exclusions.  The exclusions are dictionaries
+     of key value pairs. There can be more than one exclusion.
+     [{'var1':'value1', 'var2', 'value2'[,...]}, ...]
+
+    """
+    # Strip out '\n' and leading '*', if any, in continuation lines.
+    # This should not effect code previous to this change as
+    # continuation lines were not allowed.
+    loophead = stripast.sub("", loophead)
+    # parse out the names and lists of values
+    names = []
+    reps = named_re.findall(loophead)
+    nsub = None
+    for rep in reps:
+        name = rep[0]
+        vals = parse_values(rep[1])
+        size = len(vals)
+        if nsub is None :
+            nsub = size
+        elif nsub != size :
+            msg = "Mismatch in number of values, %d != %d\n%s = %s"
+            raise ValueError(msg % (nsub, size, name, vals))
+        names.append((name, vals))
+
+
+    # Find any exclude variables
+    excludes = []
+
+    for obj in exclude_re.finditer(loophead):
+        span = obj.span()
+        # find next newline
+        endline = loophead.find('\n', span[1])
+        substr = loophead[span[1]:endline]
+        ex_names = exclude_vars_re.findall(substr)
+        excludes.append(dict(ex_names))
+
+    # generate list of dictionaries, one for each template iteration
+    dlist = []
+    if nsub is None :
+        raise ValueError("No substitution variables found")
+    for i in range(nsub):
+        tmp = {name: vals[i] for name, vals in names}
+        dlist.append(tmp)
+    return dlist
+
+replace_re = re.compile(r"@([\w]+)@")
+def parse_string(astr, env, level, line) :
+    lineno = "#line %d\n" % line
+
+    # local function for string replacement, uses env
+    def replace(match):
+        name = match.group(1)
+        try :
+            val = env[name]
+        except KeyError:
+            msg = 'line %d: no definition of key "%s"'%(line, name)
+            raise ValueError(msg)
+        return val
+
+    code = [lineno]
+    struct = parse_structure(astr, level)
+    if struct :
+        # recurse over inner loops
+        oldend = 0
+        newlevel = level + 1
+        for sub in struct:
+            pref = astr[oldend:sub[0]]
+            head = astr[sub[0]:sub[1]]
+            text = astr[sub[1]:sub[2]]
+            oldend = sub[3]
+            newline = line + sub[4]
+            code.append(replace_re.sub(replace, pref))
+            try :
+                envlist = parse_loop_header(head)
+            except ValueError as e:
+                msg = "line %d: %s" % (newline, e)
+                raise ValueError(msg)
+            for newenv in envlist :
+                newenv.update(env)
+                newcode = parse_string(text, newenv, newlevel, newline)
+                code.extend(newcode)
+        suff = astr[oldend:]
+        code.append(replace_re.sub(replace, suff))
+    else :
+        # replace keys
+        code.append(replace_re.sub(replace, astr))
+    code.append('\n')
+    return ''.join(code)
+
+def process_str(astr):
+    code = [header]
+    code.extend(parse_string(astr, global_names, 0, 1))
+    return ''.join(code)
+
+
+include_src_re = re.compile(r"(\n|\A)#include\s*['\"]"
+                            r"(?P<name>[\w\d./\\]+[.]src)['\"]", re.I)
+
+def resolve_includes(source):
+    d = os.path.dirname(source)
+    with open(source) as fid:
+        lines = []
+        for line in fid:
+            m = include_src_re.match(line)
+            if m:
+                fn = m.group('name')
+                if not os.path.isabs(fn):
+                    fn = os.path.join(d, fn)
+                if os.path.isfile(fn):
+                    print('Including file', fn)
+                    lines.extend(resolve_includes(fn))
+                else:
+                    lines.append(line)
+            else:
+                lines.append(line)
+    return lines
+
+def process_file(source):
+    lines = resolve_includes(source)
+    sourcefile = os.path.normcase(source).replace("\\", "\\\\")
+    try:
+        code = process_str(''.join(lines))
+    except ValueError as e:
+        raise ValueError('In "%s" loop at %s' % (sourcefile, e))
+    return '#line 1 "%s"\n%s' % (sourcefile, code)
+
+
+def unique_key(adict):
+    # this obtains a unique key given a dictionary
+    # currently it works by appending together n of the letters of the
+    #   current keys and increasing n until a unique key is found
+    # -- not particularly quick
+    allkeys = list(adict.keys())
+    done = False
+    n = 1
+    while not done:
+        newkey = "".join([x[:n] for x in allkeys])
+        if newkey in allkeys:
+            n += 1
+        else:
+            done = True
+    return newkey
+
+
+def main():
+    try:
+        file = sys.argv[1]
+    except IndexError:
+        fid = sys.stdin
+        outfile = sys.stdout
+    else:
+        fid = open(file, 'r')
+        (base, ext) = os.path.splitext(file)
+        newname = base
+        outfile = open(newname, 'w')
+
+    allstr = fid.read()
+    try:
+        writestr = process_str(allstr)
+    except ValueError as e:
+        raise ValueError("In %s loop at %s" % (file, e))
+
+    outfile.write(writestr)
+
+if __name__ == "__main__":
+    main()
diff --git a/venv/Lib/site-packages/numpy/distutils/core.py b/venv/Lib/site-packages/numpy/distutils/core.py
new file mode 100644
index 000000000..d5551f349
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/core.py
@@ -0,0 +1,215 @@
+import sys
+from distutils.core import Distribution
+
+if 'setuptools' in sys.modules:
+    have_setuptools = True
+    from setuptools import setup as old_setup
+    # easy_install imports math, it may be picked up from cwd
+    from setuptools.command import easy_install
+    try:
+        # very old versions of setuptools don't have this
+        from setuptools.command import bdist_egg
+    except ImportError:
+        have_setuptools = False
+else:
+    from distutils.core import setup as old_setup
+    have_setuptools = False
+
+import warnings
+import distutils.core
+import distutils.dist
+
+from numpy.distutils.extension import Extension
+from numpy.distutils.numpy_distribution import NumpyDistribution
+from numpy.distutils.command import config, config_compiler, \
+     build, build_py, build_ext, build_clib, build_src, build_scripts, \
+     sdist, install_data, install_headers, install, bdist_rpm, \
+     install_clib
+from numpy.distutils.misc_util import is_sequence, is_string
+
+numpy_cmdclass = {'build':            build.build,
+                  'build_src':        build_src.build_src,
+                  'build_scripts':    build_scripts.build_scripts,
+                  'config_cc':        config_compiler.config_cc,
+                  'config_fc':        config_compiler.config_fc,
+                  'config':           config.config,
+                  'build_ext':        build_ext.build_ext,
+                  'build_py':         build_py.build_py,
+                  'build_clib':       build_clib.build_clib,
+                  'sdist':            sdist.sdist,
+                  'install_data':     install_data.install_data,
+                  'install_headers':  install_headers.install_headers,
+                  'install_clib':     install_clib.install_clib,
+                  'install':          install.install,
+                  'bdist_rpm':        bdist_rpm.bdist_rpm,
+                  }
+if have_setuptools:
+    # Use our own versions of develop and egg_info to ensure that build_src is
+    # handled appropriately.
+    from numpy.distutils.command import develop, egg_info
+    numpy_cmdclass['bdist_egg'] = bdist_egg.bdist_egg
+    numpy_cmdclass['develop'] = develop.develop
+    numpy_cmdclass['easy_install'] = easy_install.easy_install
+    numpy_cmdclass['egg_info'] = egg_info.egg_info
+
+def _dict_append(d, **kws):
+    for k, v in kws.items():
+        if k not in d:
+            d[k] = v
+            continue
+        dv = d[k]
+        if isinstance(dv, tuple):
+            d[k] = dv + tuple(v)
+        elif isinstance(dv, list):
+            d[k] = dv + list(v)
+        elif isinstance(dv, dict):
+            _dict_append(dv, **v)
+        elif is_string(dv):
+            d[k] = dv + v
+        else:
+            raise TypeError(repr(type(dv)))
+
+def _command_line_ok(_cache=None):
+    """ Return True if command line does not contain any
+    help or display requests.
+    """
+    if _cache:
+        return _cache[0]
+    elif _cache is None:
+        _cache = []
+    ok = True
+    display_opts = ['--'+n for n in Distribution.display_option_names]
+    for o in Distribution.display_options:
+        if o[1]:
+            display_opts.append('-'+o[1])
+    for arg in sys.argv:
+        if arg.startswith('--help') or arg=='-h' or arg in display_opts:
+            ok = False
+            break
+    _cache.append(ok)
+    return ok
+
+def get_distribution(always=False):
+    dist = distutils.core._setup_distribution
+    # XXX Hack to get numpy installable with easy_install.
+    # The problem is easy_install runs it's own setup(), which
+    # sets up distutils.core._setup_distribution. However,
+    # when our setup() runs, that gets overwritten and lost.
+    # We can't use isinstance, as the DistributionWithoutHelpCommands
+    # class is local to a function in setuptools.command.easy_install
+    if dist is not None and \
+            'DistributionWithoutHelpCommands' in repr(dist):
+        dist = None
+    if always and dist is None:
+        dist = NumpyDistribution()
+    return dist
+
+def setup(**attr):
+
+    cmdclass = numpy_cmdclass.copy()
+
+    new_attr = attr.copy()
+    if 'cmdclass' in new_attr:
+        cmdclass.update(new_attr['cmdclass'])
+    new_attr['cmdclass'] = cmdclass
+
+    if 'configuration' in new_attr:
+        # To avoid calling configuration if there are any errors
+        # or help request in command in the line.
+        configuration = new_attr.pop('configuration')
+
+        old_dist = distutils.core._setup_distribution
+        old_stop = distutils.core._setup_stop_after
+        distutils.core._setup_distribution = None
+        distutils.core._setup_stop_after = "commandline"
+        try:
+            dist = setup(**new_attr)
+        finally:
+            distutils.core._setup_distribution = old_dist
+            distutils.core._setup_stop_after = old_stop
+        if dist.help or not _command_line_ok():
+            # probably displayed help, skip running any commands
+            return dist
+
+        # create setup dictionary and append to new_attr
+        config = configuration()
+        if hasattr(config, 'todict'):
+            config = config.todict()
+        _dict_append(new_attr, **config)
+
+    # Move extension source libraries to libraries
+    libraries = []
+    for ext in new_attr.get('ext_modules', []):
+        new_libraries = []
+        for item in ext.libraries:
+            if is_sequence(item):
+                lib_name, build_info = item
+                _check_append_ext_library(libraries, lib_name, build_info)
+                new_libraries.append(lib_name)
+            elif is_string(item):
+                new_libraries.append(item)
+            else:
+                raise TypeError("invalid description of extension module "
+                                "library %r" % (item,))
+        ext.libraries = new_libraries
+    if libraries:
+        if 'libraries' not in new_attr:
+            new_attr['libraries'] = []
+        for item in libraries:
+            _check_append_library(new_attr['libraries'], item)
+
+    # sources in ext_modules or libraries may contain header files
+    if ('ext_modules' in new_attr or 'libraries' in new_attr) \
+       and 'headers' not in new_attr:
+        new_attr['headers'] = []
+
+    # Use our custom NumpyDistribution class instead of distutils' one
+    new_attr['distclass'] = NumpyDistribution
+
+    return old_setup(**new_attr)
+
+def _check_append_library(libraries, item):
+    for libitem in libraries:
+        if is_sequence(libitem):
+            if is_sequence(item):
+                if item[0]==libitem[0]:
+                    if item[1] is libitem[1]:
+                        return
+                    warnings.warn("[0] libraries list contains %r with"
+                                  " different build_info" % (item[0],),
+                                  stacklevel=2)
+                    break
+            else:
+                if item==libitem[0]:
+                    warnings.warn("[1] libraries list contains %r with"
+                                  " no build_info" % (item[0],),
+                                  stacklevel=2)
+                    break
+        else:
+            if is_sequence(item):
+                if item[0]==libitem:
+                    warnings.warn("[2] libraries list contains %r with"
+                                  " no build_info" % (item[0],),
+                                  stacklevel=2)
+                    break
+            else:
+                if item==libitem:
+                    return
+    libraries.append(item)
+
+def _check_append_ext_library(libraries, lib_name, build_info):
+    for item in libraries:
+        if is_sequence(item):
+            if item[0]==lib_name:
+                if item[1] is build_info:
+                    return
+                warnings.warn("[3] libraries list contains %r with"
+                              " different build_info" % (lib_name,),
+                              stacklevel=2)
+                break
+        elif item==lib_name:
+            warnings.warn("[4] libraries list contains %r with"
+                          " no build_info" % (lib_name,),
+                          stacklevel=2)
+            break
+    libraries.append((lib_name, build_info))
diff --git a/venv/Lib/site-packages/numpy/distutils/cpuinfo.py b/venv/Lib/site-packages/numpy/distutils/cpuinfo.py
new file mode 100644
index 000000000..51ce3c129
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/cpuinfo.py
@@ -0,0 +1,683 @@
+#!/usr/bin/env python3
+"""
+cpuinfo
+
+Copyright 2002 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@cens.ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy (BSD style) license.  See LICENSE.txt that came with
+this distribution for specifics.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+Pearu Peterson
+
+"""
+__all__ = ['cpu']
+
+import os
+import platform
+import re
+import sys
+import types
+import warnings
+
+from subprocess import getstatusoutput
+
+
+def getoutput(cmd, successful_status=(0,), stacklevel=1):
+    try:
+        status, output = getstatusoutput(cmd)
+    except EnvironmentError as e:
+        warnings.warn(str(e), UserWarning, stacklevel=stacklevel)
+        return False, ""
+    if os.WIFEXITED(status) and os.WEXITSTATUS(status) in successful_status:
+        return True, output
+    return False, output
+
+def command_info(successful_status=(0,), stacklevel=1, **kw):
+    info = {}
+    for key in kw:
+        ok, output = getoutput(kw[key], successful_status=successful_status,
+                               stacklevel=stacklevel+1)
+        if ok:
+            info[key] = output.strip()
+    return info
+
+def command_by_line(cmd, successful_status=(0,), stacklevel=1):
+    ok, output = getoutput(cmd, successful_status=successful_status,
+                           stacklevel=stacklevel+1)
+    if not ok:
+        return
+    for line in output.splitlines():
+        yield line.strip()
+
+def key_value_from_command(cmd, sep, successful_status=(0,),
+                           stacklevel=1):
+    d = {}
+    for line in command_by_line(cmd, successful_status=successful_status,
+                                stacklevel=stacklevel+1):
+        l = [s.strip() for s in line.split(sep, 1)]
+        if len(l) == 2:
+            d[l[0]] = l[1]
+    return d
+
+class CPUInfoBase:
+    """Holds CPU information and provides methods for requiring
+    the availability of various CPU features.
+    """
+
+    def _try_call(self, func):
+        try:
+            return func()
+        except Exception:
+            pass
+
+    def __getattr__(self, name):
+        if not name.startswith('_'):
+            if hasattr(self, '_'+name):
+                attr = getattr(self, '_'+name)
+                if isinstance(attr, types.MethodType):
+                    return lambda func=self._try_call,attr=attr : func(attr)
+            else:
+                return lambda : None
+        raise AttributeError(name)
+
+    def _getNCPUs(self):
+        return 1
+
+    def __get_nbits(self):
+        abits = platform.architecture()[0]
+        nbits = re.compile(r'(\d+)bit').search(abits).group(1)
+        return nbits
+
+    def _is_32bit(self):
+        return self.__get_nbits() == '32'
+
+    def _is_64bit(self):
+        return self.__get_nbits() == '64'
+
+class LinuxCPUInfo(CPUInfoBase):
+
+    info = None
+
+    def __init__(self):
+        if self.info is not None:
+            return
+        info = [ {} ]
+        ok, output = getoutput('uname -m')
+        if ok:
+            info[0]['uname_m'] = output.strip()
+        try:
+            fo = open('/proc/cpuinfo')
+        except EnvironmentError as e:
+            warnings.warn(str(e), UserWarning, stacklevel=2)
+        else:
+            for line in fo:
+                name_value = [s.strip() for s in line.split(':', 1)]
+                if len(name_value) != 2:
+                    continue
+                name, value = name_value
+                if not info or name in info[-1]: # next processor
+                    info.append({})
+                info[-1][name] = value
+            fo.close()
+        self.__class__.info = info
+
+    def _not_impl(self): pass
+
+    # Athlon
+
+    def _is_AMD(self):
+        return self.info[0]['vendor_id']=='AuthenticAMD'
+
+    def _is_AthlonK6_2(self):
+        return self._is_AMD() and self.info[0]['model'] == '2'
+
+    def _is_AthlonK6_3(self):
+        return self._is_AMD() and self.info[0]['model'] == '3'
+
+    def _is_AthlonK6(self):
+        return re.match(r'.*?AMD-K6', self.info[0]['model name']) is not None
+
+    def _is_AthlonK7(self):
+        return re.match(r'.*?AMD-K7', self.info[0]['model name']) is not None
+
+    def _is_AthlonMP(self):
+        return re.match(r'.*?Athlon\(tm\) MP\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_AMD64(self):
+        return self.is_AMD() and self.info[0]['family'] == '15'
+
+    def _is_Athlon64(self):
+        return re.match(r'.*?Athlon\(tm\) 64\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_AthlonHX(self):
+        return re.match(r'.*?Athlon HX\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_Opteron(self):
+        return re.match(r'.*?Opteron\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_Hammer(self):
+        return re.match(r'.*?Hammer\b',
+                        self.info[0]['model name']) is not None
+
+    # Alpha
+
+    def _is_Alpha(self):
+        return self.info[0]['cpu']=='Alpha'
+
+    def _is_EV4(self):
+        return self.is_Alpha() and self.info[0]['cpu model'] == 'EV4'
+
+    def _is_EV5(self):
+        return self.is_Alpha() and self.info[0]['cpu model'] == 'EV5'
+
+    def _is_EV56(self):
+        return self.is_Alpha() and self.info[0]['cpu model'] == 'EV56'
+
+    def _is_PCA56(self):
+        return self.is_Alpha() and self.info[0]['cpu model'] == 'PCA56'
+
+    # Intel
+
+    #XXX
+    _is_i386 = _not_impl
+
+    def _is_Intel(self):
+        return self.info[0]['vendor_id']=='GenuineIntel'
+
+    def _is_i486(self):
+        return self.info[0]['cpu']=='i486'
+
+    def _is_i586(self):
+        return self.is_Intel() and self.info[0]['cpu family'] == '5'
+
+    def _is_i686(self):
+        return self.is_Intel() and self.info[0]['cpu family'] == '6'
+
+    def _is_Celeron(self):
+        return re.match(r'.*?Celeron',
+                        self.info[0]['model name']) is not None
+
+    def _is_Pentium(self):
+        return re.match(r'.*?Pentium',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumII(self):
+        return re.match(r'.*?Pentium.*?II\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumPro(self):
+        return re.match(r'.*?PentiumPro\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumMMX(self):
+        return re.match(r'.*?Pentium.*?MMX\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumIII(self):
+        return re.match(r'.*?Pentium.*?III\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumIV(self):
+        return re.match(r'.*?Pentium.*?(IV|4)\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_PentiumM(self):
+        return re.match(r'.*?Pentium.*?M\b',
+                        self.info[0]['model name']) is not None
+
+    def _is_Prescott(self):
+        return self.is_PentiumIV() and self.has_sse3()
+
+    def _is_Nocona(self):
+        return (self.is_Intel()
+                and (self.info[0]['cpu family'] == '6'
+                     or self.info[0]['cpu family'] == '15')
+                and (self.has_sse3() and not self.has_ssse3())
+                and re.match(r'.*?\blm\b', self.info[0]['flags']) is not None)
+
+    def _is_Core2(self):
+        return (self.is_64bit() and self.is_Intel() and
+                re.match(r'.*?Core\(TM\)2\b',
+                         self.info[0]['model name']) is not None)
+
+    def _is_Itanium(self):
+        return re.match(r'.*?Itanium\b',
+                        self.info[0]['family']) is not None
+
+    def _is_XEON(self):
+        return re.match(r'.*?XEON\b',
+                        self.info[0]['model name'], re.IGNORECASE) is not None
+
+    _is_Xeon = _is_XEON
+
+    # Varia
+
+    def _is_singleCPU(self):
+        return len(self.info) == 1
+
+    def _getNCPUs(self):
+        return len(self.info)
+
+    def _has_fdiv_bug(self):
+        return self.info[0]['fdiv_bug']=='yes'
+
+    def _has_f00f_bug(self):
+        return self.info[0]['f00f_bug']=='yes'
+
+    def _has_mmx(self):
+        return re.match(r'.*?\bmmx\b', self.info[0]['flags']) is not None
+
+    def _has_sse(self):
+        return re.match(r'.*?\bsse\b', self.info[0]['flags']) is not None
+
+    def _has_sse2(self):
+        return re.match(r'.*?\bsse2\b', self.info[0]['flags']) is not None
+
+    def _has_sse3(self):
+        return re.match(r'.*?\bpni\b', self.info[0]['flags']) is not None
+
+    def _has_ssse3(self):
+        return re.match(r'.*?\bssse3\b', self.info[0]['flags']) is not None
+
+    def _has_3dnow(self):
+        return re.match(r'.*?\b3dnow\b', self.info[0]['flags']) is not None
+
+    def _has_3dnowext(self):
+        return re.match(r'.*?\b3dnowext\b', self.info[0]['flags']) is not None
+
+class IRIXCPUInfo(CPUInfoBase):
+    info = None
+
+    def __init__(self):
+        if self.info is not None:
+            return
+        info = key_value_from_command('sysconf', sep=' ',
+                                      successful_status=(0, 1))
+        self.__class__.info = info
+
+    def _not_impl(self): pass
+
+    def _is_singleCPU(self):
+        return self.info.get('NUM_PROCESSORS') == '1'
+
+    def _getNCPUs(self):
+        return int(self.info.get('NUM_PROCESSORS', 1))
+
+    def __cputype(self, n):
+        return self.info.get('PROCESSORS').split()[0].lower() == 'r%s' % (n)
+    def _is_r2000(self): return self.__cputype(2000)
+    def _is_r3000(self): return self.__cputype(3000)
+    def _is_r3900(self): return self.__cputype(3900)
+    def _is_r4000(self): return self.__cputype(4000)
+    def _is_r4100(self): return self.__cputype(4100)
+    def _is_r4300(self): return self.__cputype(4300)
+    def _is_r4400(self): return self.__cputype(4400)
+    def _is_r4600(self): return self.__cputype(4600)
+    def _is_r4650(self): return self.__cputype(4650)
+    def _is_r5000(self): return self.__cputype(5000)
+    def _is_r6000(self): return self.__cputype(6000)
+    def _is_r8000(self): return self.__cputype(8000)
+    def _is_r10000(self): return self.__cputype(10000)
+    def _is_r12000(self): return self.__cputype(12000)
+    def _is_rorion(self): return self.__cputype('orion')
+
+    def get_ip(self):
+        try: return self.info.get('MACHINE')
+        except Exception: pass
+    def __machine(self, n):
+        return self.info.get('MACHINE').lower() == 'ip%s' % (n)
+    def _is_IP19(self): return self.__machine(19)
+    def _is_IP20(self): return self.__machine(20)
+    def _is_IP21(self): return self.__machine(21)
+    def _is_IP22(self): return self.__machine(22)
+    def _is_IP22_4k(self): return self.__machine(22) and self._is_r4000()
+    def _is_IP22_5k(self): return self.__machine(22)  and self._is_r5000()
+    def _is_IP24(self): return self.__machine(24)
+    def _is_IP25(self): return self.__machine(25)
+    def _is_IP26(self): return self.__machine(26)
+    def _is_IP27(self): return self.__machine(27)
+    def _is_IP28(self): return self.__machine(28)
+    def _is_IP30(self): return self.__machine(30)
+    def _is_IP32(self): return self.__machine(32)
+    def _is_IP32_5k(self): return self.__machine(32) and self._is_r5000()
+    def _is_IP32_10k(self): return self.__machine(32) and self._is_r10000()
+
+
+class DarwinCPUInfo(CPUInfoBase):
+    info = None
+
+    def __init__(self):
+        if self.info is not None:
+            return
+        info = command_info(arch='arch',
+                            machine='machine')
+        info['sysctl_hw'] = key_value_from_command('sysctl hw', sep='=')
+        self.__class__.info = info
+
+    def _not_impl(self): pass
+
+    def _getNCPUs(self):
+        return int(self.info['sysctl_hw'].get('hw.ncpu', 1))
+
+    def _is_Power_Macintosh(self):
+        return self.info['sysctl_hw']['hw.machine']=='Power Macintosh'
+
+    def _is_i386(self):
+        return self.info['arch']=='i386'
+    def _is_ppc(self):
+        return self.info['arch']=='ppc'
+
+    def __machine(self, n):
+        return self.info['machine'] == 'ppc%s'%n
+    def _is_ppc601(self): return self.__machine(601)
+    def _is_ppc602(self): return self.__machine(602)
+    def _is_ppc603(self): return self.__machine(603)
+    def _is_ppc603e(self): return self.__machine('603e')
+    def _is_ppc604(self): return self.__machine(604)
+    def _is_ppc604e(self): return self.__machine('604e')
+    def _is_ppc620(self): return self.__machine(620)
+    def _is_ppc630(self): return self.__machine(630)
+    def _is_ppc740(self): return self.__machine(740)
+    def _is_ppc7400(self): return self.__machine(7400)
+    def _is_ppc7450(self): return self.__machine(7450)
+    def _is_ppc750(self): return self.__machine(750)
+    def _is_ppc403(self): return self.__machine(403)
+    def _is_ppc505(self): return self.__machine(505)
+    def _is_ppc801(self): return self.__machine(801)
+    def _is_ppc821(self): return self.__machine(821)
+    def _is_ppc823(self): return self.__machine(823)
+    def _is_ppc860(self): return self.__machine(860)
+
+
+class SunOSCPUInfo(CPUInfoBase):
+
+    info = None
+
+    def __init__(self):
+        if self.info is not None:
+            return
+        info = command_info(arch='arch',
+                            mach='mach',
+                            uname_i='uname_i',
+                            isainfo_b='isainfo -b',
+                            isainfo_n='isainfo -n',
+                            )
+        info['uname_X'] = key_value_from_command('uname -X', sep='=')
+        for line in command_by_line('psrinfo -v 0'):
+            m = re.match(r'\s*The (?P<p>[\w\d]+) processor operates at', line)
+            if m:
+                info['processor'] = m.group('p')
+                break
+        self.__class__.info = info
+
+    def _not_impl(self): pass
+
+    def _is_i386(self):
+        return self.info['isainfo_n']=='i386'
+    def _is_sparc(self):
+        return self.info['isainfo_n']=='sparc'
+    def _is_sparcv9(self):
+        return self.info['isainfo_n']=='sparcv9'
+
+    def _getNCPUs(self):
+        return int(self.info['uname_X'].get('NumCPU', 1))
+
+    def _is_sun4(self):
+        return self.info['arch']=='sun4'
+
+    def _is_SUNW(self):
+        return re.match(r'SUNW', self.info['uname_i']) is not None
+    def _is_sparcstation5(self):
+        return re.match(r'.*SPARCstation-5', self.info['uname_i']) is not None
+    def _is_ultra1(self):
+        return re.match(r'.*Ultra-1', self.info['uname_i']) is not None
+    def _is_ultra250(self):
+        return re.match(r'.*Ultra-250', self.info['uname_i']) is not None
+    def _is_ultra2(self):
+        return re.match(r'.*Ultra-2', self.info['uname_i']) is not None
+    def _is_ultra30(self):
+        return re.match(r'.*Ultra-30', self.info['uname_i']) is not None
+    def _is_ultra4(self):
+        return re.match(r'.*Ultra-4', self.info['uname_i']) is not None
+    def _is_ultra5_10(self):
+        return re.match(r'.*Ultra-5_10', self.info['uname_i']) is not None
+    def _is_ultra5(self):
+        return re.match(r'.*Ultra-5', self.info['uname_i']) is not None
+    def _is_ultra60(self):
+        return re.match(r'.*Ultra-60', self.info['uname_i']) is not None
+    def _is_ultra80(self):
+        return re.match(r'.*Ultra-80', self.info['uname_i']) is not None
+    def _is_ultraenterprice(self):
+        return re.match(r'.*Ultra-Enterprise', self.info['uname_i']) is not None
+    def _is_ultraenterprice10k(self):
+        return re.match(r'.*Ultra-Enterprise-10000', self.info['uname_i']) is not None
+    def _is_sunfire(self):
+        return re.match(r'.*Sun-Fire', self.info['uname_i']) is not None
+    def _is_ultra(self):
+        return re.match(r'.*Ultra', self.info['uname_i']) is not None
+
+    def _is_cpusparcv7(self):
+        return self.info['processor']=='sparcv7'
+    def _is_cpusparcv8(self):
+        return self.info['processor']=='sparcv8'
+    def _is_cpusparcv9(self):
+        return self.info['processor']=='sparcv9'
+
+class Win32CPUInfo(CPUInfoBase):
+
+    info = None
+    pkey = r"HARDWARE\DESCRIPTION\System\CentralProcessor"
+    # XXX: what does the value of
+    #   HKEY_LOCAL_MACHINE\HARDWARE\DESCRIPTION\System\CentralProcessor\0
+    # mean?
+
+    def __init__(self):
+        if self.info is not None:
+            return
+        info = []
+        try:
+            #XXX: Bad style to use so long `try:...except:...`. Fix it!
+            import winreg
+
+            prgx = re.compile(r"family\s+(?P<FML>\d+)\s+model\s+(?P<MDL>\d+)"
+                              r"\s+stepping\s+(?P<STP>\d+)", re.IGNORECASE)
+            chnd=winreg.OpenKey(winreg.HKEY_LOCAL_MACHINE, self.pkey)
+            pnum=0
+            while True:
+                try:
+                    proc=winreg.EnumKey(chnd, pnum)
+                except winreg.error:
+                    break
+                else:
+                    pnum+=1
+                    info.append({"Processor":proc})
+                    phnd=winreg.OpenKey(chnd, proc)
+                    pidx=0
+                    while True:
+                        try:
+                            name, value, vtpe=winreg.EnumValue(phnd, pidx)
+                        except winreg.error:
+                            break
+                        else:
+                            pidx=pidx+1
+                            info[-1][name]=value
+                            if name=="Identifier":
+                                srch=prgx.search(value)
+                                if srch:
+                                    info[-1]["Family"]=int(srch.group("FML"))
+                                    info[-1]["Model"]=int(srch.group("MDL"))
+                                    info[-1]["Stepping"]=int(srch.group("STP"))
+        except Exception as e:
+            print(e, '(ignoring)')
+        self.__class__.info = info
+
+    def _not_impl(self): pass
+
+    # Athlon
+
+    def _is_AMD(self):
+        return self.info[0]['VendorIdentifier']=='AuthenticAMD'
+
+    def _is_Am486(self):
+        return self.is_AMD() and self.info[0]['Family']==4
+
+    def _is_Am5x86(self):
+        return self.is_AMD() and self.info[0]['Family']==4
+
+    def _is_AMDK5(self):
+        return self.is_AMD() and self.info[0]['Family']==5 \
+               and self.info[0]['Model'] in [0, 1, 2, 3]
+
+    def _is_AMDK6(self):
+        return self.is_AMD() and self.info[0]['Family']==5 \
+               and self.info[0]['Model'] in [6, 7]
+
+    def _is_AMDK6_2(self):
+        return self.is_AMD() and self.info[0]['Family']==5 \
+               and self.info[0]['Model']==8
+
+    def _is_AMDK6_3(self):
+        return self.is_AMD() and self.info[0]['Family']==5 \
+               and self.info[0]['Model']==9
+
+    def _is_AMDK7(self):
+        return self.is_AMD() and self.info[0]['Family'] == 6
+
+    # To reliably distinguish between the different types of AMD64 chips
+    # (Athlon64, Operton, Athlon64 X2, Semperon, Turion 64, etc.) would
+    # require looking at the 'brand' from cpuid
+
+    def _is_AMD64(self):
+        return self.is_AMD() and self.info[0]['Family'] == 15
+
+    # Intel
+
+    def _is_Intel(self):
+        return self.info[0]['VendorIdentifier']=='GenuineIntel'
+
+    def _is_i386(self):
+        return self.info[0]['Family']==3
+
+    def _is_i486(self):
+        return self.info[0]['Family']==4
+
+    def _is_i586(self):
+        return self.is_Intel() and self.info[0]['Family']==5
+
+    def _is_i686(self):
+        return self.is_Intel() and self.info[0]['Family']==6
+
+    def _is_Pentium(self):
+        return self.is_Intel() and self.info[0]['Family']==5
+
+    def _is_PentiumMMX(self):
+        return self.is_Intel() and self.info[0]['Family']==5 \
+               and self.info[0]['Model']==4
+
+    def _is_PentiumPro(self):
+        return self.is_Intel() and self.info[0]['Family']==6 \
+               and self.info[0]['Model']==1
+
+    def _is_PentiumII(self):
+        return self.is_Intel() and self.info[0]['Family']==6 \
+               and self.info[0]['Model'] in [3, 5, 6]
+
+    def _is_PentiumIII(self):
+        return self.is_Intel() and self.info[0]['Family']==6 \
+               and self.info[0]['Model'] in [7, 8, 9, 10, 11]
+
+    def _is_PentiumIV(self):
+        return self.is_Intel() and self.info[0]['Family']==15
+
+    def _is_PentiumM(self):
+        return self.is_Intel() and self.info[0]['Family'] == 6 \
+               and self.info[0]['Model'] in [9, 13, 14]
+
+    def _is_Core2(self):
+        return self.is_Intel() and self.info[0]['Family'] == 6 \
+               and self.info[0]['Model'] in [15, 16, 17]
+
+    # Varia
+
+    def _is_singleCPU(self):
+        return len(self.info) == 1
+
+    def _getNCPUs(self):
+        return len(self.info)
+
+    def _has_mmx(self):
+        if self.is_Intel():
+            return (self.info[0]['Family']==5 and self.info[0]['Model']==4) \
+                   or (self.info[0]['Family'] in [6, 15])
+        elif self.is_AMD():
+            return self.info[0]['Family'] in [5, 6, 15]
+        else:
+            return False
+
+    def _has_sse(self):
+        if self.is_Intel():
+            return ((self.info[0]['Family']==6 and
+                     self.info[0]['Model'] in [7, 8, 9, 10, 11])
+                     or self.info[0]['Family']==15)
+        elif self.is_AMD():
+            return ((self.info[0]['Family']==6 and
+                     self.info[0]['Model'] in [6, 7, 8, 10])
+                     or self.info[0]['Family']==15)
+        else:
+            return False
+
+    def _has_sse2(self):
+        if self.is_Intel():
+            return self.is_Pentium4() or self.is_PentiumM() \
+                   or self.is_Core2()
+        elif self.is_AMD():
+            return self.is_AMD64()
+        else:
+            return False
+
+    def _has_3dnow(self):
+        return self.is_AMD() and self.info[0]['Family'] in [5, 6, 15]
+
+    def _has_3dnowext(self):
+        return self.is_AMD() and self.info[0]['Family'] in [6, 15]
+
+if sys.platform.startswith('linux'): # variations: linux2,linux-i386 (any others?)
+    cpuinfo = LinuxCPUInfo
+elif sys.platform.startswith('irix'):
+    cpuinfo = IRIXCPUInfo
+elif sys.platform == 'darwin':
+    cpuinfo = DarwinCPUInfo
+elif sys.platform.startswith('sunos'):
+    cpuinfo = SunOSCPUInfo
+elif sys.platform.startswith('win32'):
+    cpuinfo = Win32CPUInfo
+elif sys.platform.startswith('cygwin'):
+    cpuinfo = LinuxCPUInfo
+#XXX: other OS's. Eg. use _winreg on Win32. Or os.uname on unices.
+else:
+    cpuinfo = CPUInfoBase
+
+cpu = cpuinfo()
+
+#if __name__ == "__main__":
+#
+#    cpu.is_blaa()
+#    cpu.is_Intel()
+#    cpu.is_Alpha()
+#
+#    print('CPU information:'),
+#    for name in dir(cpuinfo):
+#        if name[0]=='_' and name[1]!='_':
+#            r = getattr(cpu,name[1:])()
+#            if r:
+#                if r!=1:
+#                    print('%s=%s' %(name[1:],r))
+#                else:
+#                    print(name[1:]),
+#    print()
diff --git a/venv/Lib/site-packages/numpy/distutils/exec_command.py b/venv/Lib/site-packages/numpy/distutils/exec_command.py
new file mode 100644
index 000000000..fb10d2470
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/exec_command.py
@@ -0,0 +1,316 @@
+"""
+exec_command
+
+Implements exec_command function that is (almost) equivalent to
+commands.getstatusoutput function but on NT, DOS systems the
+returned status is actually correct (though, the returned status
+values may be different by a factor). In addition, exec_command
+takes keyword arguments for (re-)defining environment variables.
+
+Provides functions:
+
+  exec_command  --- execute command in a specified directory and
+                    in the modified environment.
+  find_executable --- locate a command using info from environment
+                    variable PATH. Equivalent to posix `which`
+                    command.
+
+Author: Pearu Peterson <pearu@cens.ioc.ee>
+Created: 11 January 2003
+
+Requires: Python 2.x
+
+Successfully tested on:
+
+========  ============  =================================================
+os.name   sys.platform  comments
+========  ============  =================================================
+posix     linux2        Debian (sid) Linux, Python 2.1.3+, 2.2.3+, 2.3.3
+                        PyCrust 0.9.3, Idle 1.0.2
+posix     linux2        Red Hat 9 Linux, Python 2.1.3, 2.2.2, 2.3.2
+posix     sunos5        SunOS 5.9, Python 2.2, 2.3.2
+posix     darwin        Darwin 7.2.0, Python 2.3
+nt        win32         Windows Me
+                        Python 2.3(EE), Idle 1.0, PyCrust 0.7.2
+                        Python 2.1.1 Idle 0.8
+nt        win32         Windows 98, Python 2.1.1. Idle 0.8
+nt        win32         Cygwin 98-4.10, Python 2.1.1(MSC) - echo tests
+                        fail i.e. redefining environment variables may
+                        not work. FIXED: don't use cygwin echo!
+                        Comment: also `cmd /c echo` will not work
+                        but redefining environment variables do work.
+posix     cygwin        Cygwin 98-4.10, Python 2.3.3(cygming special)
+nt        win32         Windows XP, Python 2.3.3
+========  ============  =================================================
+
+Known bugs:
+
+* Tests, that send messages to stderr, fail when executed from MSYS prompt
+  because the messages are lost at some point.
+
+"""
+__all__ = ['exec_command', 'find_executable']
+
+import os
+import sys
+import subprocess
+import locale
+import warnings
+
+from numpy.distutils.misc_util import is_sequence, make_temp_file
+from numpy.distutils import log
+
+def filepath_from_subprocess_output(output):
+    """
+    Convert `bytes` in the encoding used by a subprocess into a filesystem-appropriate `str`.
+
+    Inherited from `exec_command`, and possibly incorrect.
+    """
+    mylocale = locale.getpreferredencoding(False)
+    if mylocale is None:
+        mylocale = 'ascii'
+    output = output.decode(mylocale, errors='replace')
+    output = output.replace('\r\n', '\n')
+    # Another historical oddity
+    if output[-1:] == '\n':
+        output = output[:-1]
+    return output
+
+
+def forward_bytes_to_stdout(val):
+    """
+    Forward bytes from a subprocess call to the console, without attempting to
+    decode them.
+
+    The assumption is that the subprocess call already returned bytes in
+    a suitable encoding.
+    """
+    if hasattr(sys.stdout, 'buffer'):
+        # use the underlying binary output if there is one
+        sys.stdout.buffer.write(val)
+    elif hasattr(sys.stdout, 'encoding'):
+        # round-trip the encoding if necessary
+        sys.stdout.write(val.decode(sys.stdout.encoding))
+    else:
+        # make a best-guess at the encoding
+        sys.stdout.write(val.decode('utf8', errors='replace'))
+
+
+def temp_file_name():
+    # 2019-01-30, 1.17
+    warnings.warn('temp_file_name is deprecated since NumPy v1.17, use '
+                  'tempfile.mkstemp instead', DeprecationWarning, stacklevel=1)
+    fo, name = make_temp_file()
+    fo.close()
+    return name
+
+def get_pythonexe():
+    pythonexe = sys.executable
+    if os.name in ['nt', 'dos']:
+        fdir, fn = os.path.split(pythonexe)
+        fn = fn.upper().replace('PYTHONW', 'PYTHON')
+        pythonexe = os.path.join(fdir, fn)
+        assert os.path.isfile(pythonexe), '%r is not a file' % (pythonexe,)
+    return pythonexe
+
+def find_executable(exe, path=None, _cache={}):
+    """Return full path of a executable or None.
+
+    Symbolic links are not followed.
+    """
+    key = exe, path
+    try:
+        return _cache[key]
+    except KeyError:
+        pass
+    log.debug('find_executable(%r)' % exe)
+    orig_exe = exe
+
+    if path is None:
+        path = os.environ.get('PATH', os.defpath)
+    if os.name=='posix':
+        realpath = os.path.realpath
+    else:
+        realpath = lambda a:a
+
+    if exe.startswith('"'):
+        exe = exe[1:-1]
+
+    suffixes = ['']
+    if os.name in ['nt', 'dos', 'os2']:
+        fn, ext = os.path.splitext(exe)
+        extra_suffixes = ['.exe', '.com', '.bat']
+        if ext.lower() not in extra_suffixes:
+            suffixes = extra_suffixes
+
+    if os.path.isabs(exe):
+        paths = ['']
+    else:
+        paths = [ os.path.abspath(p) for p in path.split(os.pathsep) ]
+
+    for path in paths:
+        fn = os.path.join(path, exe)
+        for s in suffixes:
+            f_ext = fn+s
+            if not os.path.islink(f_ext):
+                f_ext = realpath(f_ext)
+            if os.path.isfile(f_ext) and os.access(f_ext, os.X_OK):
+                log.info('Found executable %s' % f_ext)
+                _cache[key] = f_ext
+                return f_ext
+
+    log.warn('Could not locate executable %s' % orig_exe)
+    return None
+
+############################################################
+
+def _preserve_environment( names ):
+    log.debug('_preserve_environment(%r)' % (names))
+    env = {name: os.environ.get(name) for name in names}
+    return env
+
+def _update_environment( **env ):
+    log.debug('_update_environment(...)')
+    for name, value in env.items():
+        os.environ[name] = value or ''
+
+def exec_command(command, execute_in='', use_shell=None, use_tee=None,
+                 _with_python = 1, **env ):
+    """
+    Return (status,output) of executed command.
+
+    .. deprecated:: 1.17
+        Use subprocess.Popen instead
+
+    Parameters
+    ----------
+    command : str
+        A concatenated string of executable and arguments.
+    execute_in : str
+        Before running command ``cd execute_in`` and after ``cd -``.
+    use_shell : {bool, None}, optional
+        If True, execute ``sh -c command``. Default None (True)
+    use_tee : {bool, None}, optional
+        If True use tee. Default None (True)
+
+
+    Returns
+    -------
+    res : str
+        Both stdout and stderr messages.
+
+    Notes
+    -----
+    On NT, DOS systems the returned status is correct for external commands.
+    Wild cards will not work for non-posix systems or when use_shell=0.
+
+    """
+    # 2019-01-30, 1.17
+    warnings.warn('exec_command is deprecated since NumPy v1.17, use '
+                  'subprocess.Popen instead', DeprecationWarning, stacklevel=1)
+    log.debug('exec_command(%r,%s)' % (command,
+         ','.join(['%s=%r'%kv for kv in env.items()])))
+
+    if use_tee is None:
+        use_tee = os.name=='posix'
+    if use_shell is None:
+        use_shell = os.name=='posix'
+    execute_in = os.path.abspath(execute_in)
+    oldcwd = os.path.abspath(os.getcwd())
+
+    if __name__[-12:] == 'exec_command':
+        exec_dir = os.path.dirname(os.path.abspath(__file__))
+    elif os.path.isfile('exec_command.py'):
+        exec_dir = os.path.abspath('.')
+    else:
+        exec_dir = os.path.abspath(sys.argv[0])
+        if os.path.isfile(exec_dir):
+            exec_dir = os.path.dirname(exec_dir)
+
+    if oldcwd!=execute_in:
+        os.chdir(execute_in)
+        log.debug('New cwd: %s' % execute_in)
+    else:
+        log.debug('Retaining cwd: %s' % oldcwd)
+
+    oldenv = _preserve_environment( list(env.keys()) )
+    _update_environment( **env )
+
+    try:
+        st = _exec_command(command,
+                           use_shell=use_shell,
+                           use_tee=use_tee,
+                           **env)
+    finally:
+        if oldcwd!=execute_in:
+            os.chdir(oldcwd)
+            log.debug('Restored cwd to %s' % oldcwd)
+        _update_environment(**oldenv)
+
+    return st
+
+
+def _exec_command(command, use_shell=None, use_tee = None, **env):
+    """
+    Internal workhorse for exec_command().
+    """
+    if use_shell is None:
+        use_shell = os.name=='posix'
+    if use_tee is None:
+        use_tee = os.name=='posix'
+
+    if os.name == 'posix' and use_shell:
+        # On POSIX, subprocess always uses /bin/sh, override
+        sh = os.environ.get('SHELL', '/bin/sh')
+        if is_sequence(command):
+            command = [sh, '-c', ' '.join(command)]
+        else:
+            command = [sh, '-c', command]
+        use_shell = False
+
+    elif os.name == 'nt' and is_sequence(command):
+        # On Windows, join the string for CreateProcess() ourselves as
+        # subprocess does it a bit differently
+        command = ' '.join(_quote_arg(arg) for arg in command)
+
+    # Inherit environment by default
+    env = env or None
+    try:
+        # universal_newlines is set to False so that communicate()
+        # will return bytes. We need to decode the output ourselves
+        # so that Python will not raise a UnicodeDecodeError when
+        # it encounters an invalid character; rather, we simply replace it
+        proc = subprocess.Popen(command, shell=use_shell, env=env,
+                                stdout=subprocess.PIPE,
+                                stderr=subprocess.STDOUT,
+                                universal_newlines=False)
+    except EnvironmentError:
+        # Return 127, as os.spawn*() and /bin/sh do
+        return 127, ''
+
+    text, err = proc.communicate()
+    mylocale = locale.getpreferredencoding(False)
+    if mylocale is None:
+        mylocale = 'ascii'
+    text = text.decode(mylocale, errors='replace')
+    text = text.replace('\r\n', '\n')
+    # Another historical oddity
+    if text[-1:] == '\n':
+        text = text[:-1]
+
+    if use_tee and text:
+        print(text)
+    return proc.returncode, text
+
+
+def _quote_arg(arg):
+    """
+    Quote the argument for safe use in a shell command line.
+    """
+    # If there is a quote in the string, assume relevants parts of the
+    # string are already quoted (e.g. '-I"C:\\Program Files\\..."')
+    if '"' not in arg and ' ' in arg:
+        return '"%s"' % arg
+    return arg
+
+############################################################
diff --git a/venv/Lib/site-packages/numpy/distutils/extension.py b/venv/Lib/site-packages/numpy/distutils/extension.py
new file mode 100644
index 000000000..67114ef2e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/extension.py
@@ -0,0 +1,103 @@
+"""distutils.extension
+
+Provides the Extension class, used to describe C/C++ extension
+modules in setup scripts.
+
+Overridden to support f2py.
+
+"""
+import re
+from distutils.extension import Extension as old_Extension
+
+
+cxx_ext_re = re.compile(r'.*[.](cpp|cxx|cc)\Z', re.I).match
+fortran_pyf_ext_re = re.compile(r'.*[.](f90|f95|f77|for|ftn|f|pyf)\Z', re.I).match
+
+
+class Extension(old_Extension):
+    """
+    Parameters
+    ----------
+    name : str
+        Extension name.
+    sources : list of str
+        List of source file locations relative to the top directory of
+        the package.
+    extra_compile_args : list of str
+        Extra command line arguments to pass to the compiler.
+    extra_f77_compile_args : list of str
+        Extra command line arguments to pass to the fortran77 compiler.
+    extra_f90_compile_args : list of str
+        Extra command line arguments to pass to the fortran90 compiler.
+    """
+    def __init__(
+            self, name, sources,
+            include_dirs=None,
+            define_macros=None,
+            undef_macros=None,
+            library_dirs=None,
+            libraries=None,
+            runtime_library_dirs=None,
+            extra_objects=None,
+            extra_compile_args=None,
+            extra_link_args=None,
+            export_symbols=None,
+            swig_opts=None,
+            depends=None,
+            language=None,
+            f2py_options=None,
+            module_dirs=None,
+            extra_f77_compile_args=None,
+            extra_f90_compile_args=None,):
+
+        old_Extension.__init__(
+                self, name, [],
+                include_dirs=include_dirs,
+                define_macros=define_macros,
+                undef_macros=undef_macros,
+                library_dirs=library_dirs,
+                libraries=libraries,
+                runtime_library_dirs=runtime_library_dirs,
+                extra_objects=extra_objects,
+                extra_compile_args=extra_compile_args,
+                extra_link_args=extra_link_args,
+                export_symbols=export_symbols)
+
+        # Avoid assert statements checking that sources contains strings:
+        self.sources = sources
+
+        # Python 2.4 distutils new features
+        self.swig_opts = swig_opts or []
+        # swig_opts is assumed to be a list. Here we handle the case where it
+        # is specified as a string instead.
+        if isinstance(self.swig_opts, str):
+            import warnings
+            msg = "swig_opts is specified as a string instead of a list"
+            warnings.warn(msg, SyntaxWarning, stacklevel=2)
+            self.swig_opts = self.swig_opts.split()
+
+        # Python 2.3 distutils new features
+        self.depends = depends or []
+        self.language = language
+
+        # numpy_distutils features
+        self.f2py_options = f2py_options or []
+        self.module_dirs = module_dirs or []
+        self.extra_f77_compile_args = extra_f77_compile_args or []
+        self.extra_f90_compile_args = extra_f90_compile_args or []
+
+        return
+
+    def has_cxx_sources(self):
+        for source in self.sources:
+            if cxx_ext_re(str(source)):
+                return True
+        return False
+
+    def has_f2py_sources(self):
+        for source in self.sources:
+            if fortran_pyf_ext_re(source):
+                return True
+        return False
+
+# class Extension
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__init__.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/__init__.py
new file mode 100644
index 000000000..1c3069363
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/__init__.py
@@ -0,0 +1,1027 @@
+"""numpy.distutils.fcompiler
+
+Contains FCompiler, an abstract base class that defines the interface
+for the numpy.distutils Fortran compiler abstraction model.
+
+Terminology:
+
+To be consistent, where the term 'executable' is used, it means the single
+file, like 'gcc', that is executed, and should be a string. In contrast,
+'command' means the entire command line, like ['gcc', '-c', 'file.c'], and
+should be a list.
+
+But note that FCompiler.executables is actually a dictionary of commands.
+
+"""
+__all__ = ['FCompiler', 'new_fcompiler', 'show_fcompilers',
+           'dummy_fortran_file']
+
+import os
+import sys
+import re
+
+from numpy.compat import open_latin1
+
+from distutils.sysconfig import get_python_lib
+from distutils.fancy_getopt import FancyGetopt
+from distutils.errors import DistutilsModuleError, \
+     DistutilsExecError, CompileError, LinkError, DistutilsPlatformError
+from distutils.util import split_quoted, strtobool
+
+from numpy.distutils.ccompiler import CCompiler, gen_lib_options
+from numpy.distutils import log
+from numpy.distutils.misc_util import is_string, all_strings, is_sequence, \
+    make_temp_file, get_shared_lib_extension
+from numpy.distutils.exec_command import find_executable
+from numpy.distutils import _shell_utils
+
+from .environment import EnvironmentConfig
+
+__metaclass__ = type
+
+class CompilerNotFound(Exception):
+    pass
+
+def flaglist(s):
+    if is_string(s):
+        return split_quoted(s)
+    else:
+        return s
+
+def str2bool(s):
+    if is_string(s):
+        return strtobool(s)
+    return bool(s)
+
+def is_sequence_of_strings(seq):
+    return is_sequence(seq) and all_strings(seq)
+
+class FCompiler(CCompiler):
+    """Abstract base class to define the interface that must be implemented
+    by real Fortran compiler classes.
+
+    Methods that subclasses may redefine:
+
+        update_executables(), find_executables(), get_version()
+        get_flags(), get_flags_opt(), get_flags_arch(), get_flags_debug()
+        get_flags_f77(), get_flags_opt_f77(), get_flags_arch_f77(),
+        get_flags_debug_f77(), get_flags_f90(), get_flags_opt_f90(),
+        get_flags_arch_f90(), get_flags_debug_f90(),
+        get_flags_fix(), get_flags_linker_so()
+
+    DON'T call these methods (except get_version) after
+    constructing a compiler instance or inside any other method.
+    All methods, except update_executables() and find_executables(),
+    may call the get_version() method.
+
+    After constructing a compiler instance, always call customize(dist=None)
+    method that finalizes compiler construction and makes the following
+    attributes available:
+      compiler_f77
+      compiler_f90
+      compiler_fix
+      linker_so
+      archiver
+      ranlib
+      libraries
+      library_dirs
+    """
+
+    # These are the environment variables and distutils keys used.
+    # Each configuration description is
+    # (<hook name>, <environment variable>, <key in distutils.cfg>, <convert>, <append>)
+    # The hook names are handled by the self._environment_hook method.
+    #  - names starting with 'self.' call methods in this class
+    #  - names starting with 'exe.' return the key in the executables dict
+    #  - names like 'flags.YYY' return self.get_flag_YYY()
+    # convert is either None or a function to convert a string to the
+    # appropriate type used.
+
+    distutils_vars = EnvironmentConfig(
+        distutils_section='config_fc',
+        noopt = (None, None, 'noopt', str2bool, False),
+        noarch = (None, None, 'noarch', str2bool, False),
+        debug = (None, None, 'debug', str2bool, False),
+        verbose = (None, None, 'verbose', str2bool, False),
+    )
+
+    command_vars = EnvironmentConfig(
+        distutils_section='config_fc',
+        compiler_f77 = ('exe.compiler_f77', 'F77', 'f77exec', None, False),
+        compiler_f90 = ('exe.compiler_f90', 'F90', 'f90exec', None, False),
+        compiler_fix = ('exe.compiler_fix', 'F90', 'f90exec', None, False),
+        version_cmd = ('exe.version_cmd', None, None, None, False),
+        linker_so = ('exe.linker_so', 'LDSHARED', 'ldshared', None, False),
+        linker_exe = ('exe.linker_exe', 'LD', 'ld', None, False),
+        archiver = (None, 'AR', 'ar', None, False),
+        ranlib = (None, 'RANLIB', 'ranlib', None, False),
+    )
+
+    flag_vars = EnvironmentConfig(
+        distutils_section='config_fc',
+        f77 = ('flags.f77', 'F77FLAGS', 'f77flags', flaglist, True),
+        f90 = ('flags.f90', 'F90FLAGS', 'f90flags', flaglist, True),
+        free = ('flags.free', 'FREEFLAGS', 'freeflags', flaglist, True),
+        fix = ('flags.fix', None, None, flaglist, False),
+        opt = ('flags.opt', 'FOPT', 'opt', flaglist, True),
+        opt_f77 = ('flags.opt_f77', None, None, flaglist, False),
+        opt_f90 = ('flags.opt_f90', None, None, flaglist, False),
+        arch = ('flags.arch', 'FARCH', 'arch', flaglist, False),
+        arch_f77 = ('flags.arch_f77', None, None, flaglist, False),
+        arch_f90 = ('flags.arch_f90', None, None, flaglist, False),
+        debug = ('flags.debug', 'FDEBUG', 'fdebug', flaglist, True),
+        debug_f77 = ('flags.debug_f77', None, None, flaglist, False),
+        debug_f90 = ('flags.debug_f90', None, None, flaglist, False),
+        flags = ('self.get_flags', 'FFLAGS', 'fflags', flaglist, True),
+        linker_so = ('flags.linker_so', 'LDFLAGS', 'ldflags', flaglist, True),
+        linker_exe = ('flags.linker_exe', 'LDFLAGS', 'ldflags', flaglist, True),
+        ar = ('flags.ar', 'ARFLAGS', 'arflags', flaglist, True),
+    )
+
+    language_map = {'.f': 'f77',
+                    '.for': 'f77',
+                    '.F': 'f77',    # XXX: needs preprocessor
+                    '.ftn': 'f77',
+                    '.f77': 'f77',
+                    '.f90': 'f90',
+                    '.F90': 'f90',  # XXX: needs preprocessor
+                    '.f95': 'f90',
+                    }
+    language_order = ['f90', 'f77']
+
+
+    # These will be set by the subclass
+
+    compiler_type = None
+    compiler_aliases = ()
+    version_pattern = None
+
+    possible_executables = []
+    executables = {
+        'version_cmd': ["f77", "-v"],
+        'compiler_f77': ["f77"],
+        'compiler_f90': ["f90"],
+        'compiler_fix': ["f90", "-fixed"],
+        'linker_so': ["f90", "-shared"],
+        'linker_exe': ["f90"],
+        'archiver': ["ar", "-cr"],
+        'ranlib': None,
+        }
+
+    # If compiler does not support compiling Fortran 90 then it can
+    # suggest using another compiler. For example, gnu would suggest
+    # gnu95 compiler type when there are F90 sources.
+    suggested_f90_compiler = None
+
+    compile_switch = "-c"
+    object_switch = "-o "   # Ending space matters! It will be stripped
+                            # but if it is missing then object_switch
+                            # will be prefixed to object file name by
+                            # string concatenation.
+    library_switch = "-o "  # Ditto!
+
+    # Switch to specify where module files are created and searched
+    # for USE statement.  Normally it is a string and also here ending
+    # space matters. See above.
+    module_dir_switch = None
+
+    # Switch to specify where module files are searched for USE statement.
+    module_include_switch = '-I'
+
+    pic_flags = []           # Flags to create position-independent code
+
+    src_extensions = ['.for', '.ftn', '.f77', '.f', '.f90', '.f95', '.F', '.F90', '.FOR']
+    obj_extension = ".o"
+
+    shared_lib_extension = get_shared_lib_extension()
+    static_lib_extension = ".a"  # or .lib
+    static_lib_format = "lib%s%s" # or %s%s
+    shared_lib_format = "%s%s"
+    exe_extension = ""
+
+    _exe_cache = {}
+
+    _executable_keys = ['version_cmd', 'compiler_f77', 'compiler_f90',
+                        'compiler_fix', 'linker_so', 'linker_exe', 'archiver',
+                        'ranlib']
+
+    # This will be set by new_fcompiler when called in
+    # command/{build_ext.py, build_clib.py, config.py} files.
+    c_compiler = None
+
+    # extra_{f77,f90}_compile_args are set by build_ext.build_extension method
+    extra_f77_compile_args = []
+    extra_f90_compile_args = []
+
+    def __init__(self, *args, **kw):
+        CCompiler.__init__(self, *args, **kw)
+        self.distutils_vars = self.distutils_vars.clone(self._environment_hook)
+        self.command_vars = self.command_vars.clone(self._environment_hook)
+        self.flag_vars = self.flag_vars.clone(self._environment_hook)
+        self.executables = self.executables.copy()
+        for e in self._executable_keys:
+            if e not in self.executables:
+                self.executables[e] = None
+
+        # Some methods depend on .customize() being called first, so
+        # this keeps track of whether that's happened yet.
+        self._is_customised = False
+
+    def __copy__(self):
+        obj = self.__new__(self.__class__)
+        obj.__dict__.update(self.__dict__)
+        obj.distutils_vars = obj.distutils_vars.clone(obj._environment_hook)
+        obj.command_vars = obj.command_vars.clone(obj._environment_hook)
+        obj.flag_vars = obj.flag_vars.clone(obj._environment_hook)
+        obj.executables = obj.executables.copy()
+        return obj
+
+    def copy(self):
+        return self.__copy__()
+
+    # Use properties for the attributes used by CCompiler. Setting them
+    # as attributes from the self.executables dictionary is error-prone,
+    # so we get them from there each time.
+    def _command_property(key):
+        def fget(self):
+            assert self._is_customised
+            return self.executables[key]
+        return property(fget=fget)
+    version_cmd = _command_property('version_cmd')
+    compiler_f77 = _command_property('compiler_f77')
+    compiler_f90 = _command_property('compiler_f90')
+    compiler_fix = _command_property('compiler_fix')
+    linker_so = _command_property('linker_so')
+    linker_exe = _command_property('linker_exe')
+    archiver = _command_property('archiver')
+    ranlib = _command_property('ranlib')
+
+    # Make our terminology consistent.
+    def set_executable(self, key, value):
+        self.set_command(key, value)
+
+    def set_commands(self, **kw):
+        for k, v in kw.items():
+            self.set_command(k, v)
+
+    def set_command(self, key, value):
+        if not key in self._executable_keys:
+            raise ValueError(
+                "unknown executable '%s' for class %s" %
+                (key, self.__class__.__name__))
+        if is_string(value):
+            value = split_quoted(value)
+        assert value is None or is_sequence_of_strings(value[1:]), (key, value)
+        self.executables[key] = value
+
+    ######################################################################
+    ## Methods that subclasses may redefine. But don't call these methods!
+    ## They are private to FCompiler class and may return unexpected
+    ## results if used elsewhere. So, you have been warned..
+
+    def find_executables(self):
+        """Go through the self.executables dictionary, and attempt to
+        find and assign appropriate executables.
+
+        Executable names are looked for in the environment (environment
+        variables, the distutils.cfg, and command line), the 0th-element of
+        the command list, and the self.possible_executables list.
+
+        Also, if the 0th element is "<F77>" or "<F90>", the Fortran 77
+        or the Fortran 90 compiler executable is used, unless overridden
+        by an environment setting.
+
+        Subclasses should call this if overridden.
+        """
+        assert self._is_customised
+        exe_cache = self._exe_cache
+        def cached_find_executable(exe):
+            if exe in exe_cache:
+                return exe_cache[exe]
+            fc_exe = find_executable(exe)
+            exe_cache[exe] = exe_cache[fc_exe] = fc_exe
+            return fc_exe
+        def verify_command_form(name, value):
+            if value is not None and not is_sequence_of_strings(value):
+                raise ValueError(
+                    "%s value %r is invalid in class %s" %
+                    (name, value, self.__class__.__name__))
+        def set_exe(exe_key, f77=None, f90=None):
+            cmd = self.executables.get(exe_key, None)
+            if not cmd:
+                return None
+            # Note that we get cmd[0] here if the environment doesn't
+            # have anything set
+            exe_from_environ = getattr(self.command_vars, exe_key)
+            if not exe_from_environ:
+                possibles = [f90, f77] + self.possible_executables
+            else:
+                possibles = [exe_from_environ] + self.possible_executables
+
+            seen = set()
+            unique_possibles = []
+            for e in possibles:
+                if e == '<F77>':
+                    e = f77
+                elif e == '<F90>':
+                    e = f90
+                if not e or e in seen:
+                    continue
+                seen.add(e)
+                unique_possibles.append(e)
+
+            for exe in unique_possibles:
+                fc_exe = cached_find_executable(exe)
+                if fc_exe:
+                    cmd[0] = fc_exe
+                    return fc_exe
+            self.set_command(exe_key, None)
+            return None
+
+        ctype = self.compiler_type
+        f90 = set_exe('compiler_f90')
+        if not f90:
+            f77 = set_exe('compiler_f77')
+            if f77:
+                log.warn('%s: no Fortran 90 compiler found' % ctype)
+            else:
+                raise CompilerNotFound('%s: f90 nor f77' % ctype)
+        else:
+            f77 = set_exe('compiler_f77', f90=f90)
+            if not f77:
+                log.warn('%s: no Fortran 77 compiler found' % ctype)
+            set_exe('compiler_fix', f90=f90)
+
+        set_exe('linker_so', f77=f77, f90=f90)
+        set_exe('linker_exe', f77=f77, f90=f90)
+        set_exe('version_cmd', f77=f77, f90=f90)
+        set_exe('archiver')
+        set_exe('ranlib')
+
+    def update_executables(self):
+        """Called at the beginning of customisation. Subclasses should
+        override this if they need to set up the executables dictionary.
+
+        Note that self.find_executables() is run afterwards, so the
+        self.executables dictionary values can contain <F77> or <F90> as
+        the command, which will be replaced by the found F77 or F90
+        compiler.
+        """
+        pass
+
+    def get_flags(self):
+        """List of flags common to all compiler types."""
+        return [] + self.pic_flags
+
+    def _get_command_flags(self, key):
+        cmd = self.executables.get(key, None)
+        if cmd is None:
+            return []
+        return cmd[1:]
+
+    def get_flags_f77(self):
+        """List of Fortran 77 specific flags."""
+        return self._get_command_flags('compiler_f77')
+    def get_flags_f90(self):
+        """List of Fortran 90 specific flags."""
+        return self._get_command_flags('compiler_f90')
+    def get_flags_free(self):
+        """List of Fortran 90 free format specific flags."""
+        return []
+    def get_flags_fix(self):
+        """List of Fortran 90 fixed format specific flags."""
+        return self._get_command_flags('compiler_fix')
+    def get_flags_linker_so(self):
+        """List of linker flags to build a shared library."""
+        return self._get_command_flags('linker_so')
+    def get_flags_linker_exe(self):
+        """List of linker flags to build an executable."""
+        return self._get_command_flags('linker_exe')
+    def get_flags_ar(self):
+        """List of archiver flags. """
+        return self._get_command_flags('archiver')
+    def get_flags_opt(self):
+        """List of architecture independent compiler flags."""
+        return []
+    def get_flags_arch(self):
+        """List of architecture dependent compiler flags."""
+        return []
+    def get_flags_debug(self):
+        """List of compiler flags to compile with debugging information."""
+        return []
+
+    get_flags_opt_f77 = get_flags_opt_f90 = get_flags_opt
+    get_flags_arch_f77 = get_flags_arch_f90 = get_flags_arch
+    get_flags_debug_f77 = get_flags_debug_f90 = get_flags_debug
+
+    def get_libraries(self):
+        """List of compiler libraries."""
+        return self.libraries[:]
+    def get_library_dirs(self):
+        """List of compiler library directories."""
+        return self.library_dirs[:]
+
+    def get_version(self, force=False, ok_status=[0]):
+        assert self._is_customised
+        version = CCompiler.get_version(self, force=force, ok_status=ok_status)
+        if version is None:
+            raise CompilerNotFound()
+        return version
+
+
+    ############################################################
+
+    ## Public methods:
+
+    def customize(self, dist = None):
+        """Customize Fortran compiler.
+
+        This method gets Fortran compiler specific information from
+        (i) class definition, (ii) environment, (iii) distutils config
+        files, and (iv) command line (later overrides earlier).
+
+        This method should be always called after constructing a
+        compiler instance. But not in __init__ because Distribution
+        instance is needed for (iii) and (iv).
+        """
+        log.info('customize %s' % (self.__class__.__name__))
+
+        self._is_customised = True
+
+        self.distutils_vars.use_distribution(dist)
+        self.command_vars.use_distribution(dist)
+        self.flag_vars.use_distribution(dist)
+
+        self.update_executables()
+
+        # find_executables takes care of setting the compiler commands,
+        # version_cmd, linker_so, linker_exe, ar, and ranlib
+        self.find_executables()
+
+        noopt = self.distutils_vars.get('noopt', False)
+        noarch = self.distutils_vars.get('noarch', noopt)
+        debug = self.distutils_vars.get('debug', False)
+
+        f77 = self.command_vars.compiler_f77
+        f90 = self.command_vars.compiler_f90
+
+        f77flags = []
+        f90flags = []
+        freeflags = []
+        fixflags = []
+
+        if f77:
+            f77 = _shell_utils.NativeParser.split(f77)
+            f77flags = self.flag_vars.f77
+        if f90:
+            f90 = _shell_utils.NativeParser.split(f90)
+            f90flags = self.flag_vars.f90
+            freeflags = self.flag_vars.free
+        # XXX Assuming that free format is default for f90 compiler.
+        fix = self.command_vars.compiler_fix
+        # NOTE: this and similar examples are probably just
+        # excluding --coverage flag when F90 = gfortran --coverage
+        # instead of putting that flag somewhere more appropriate
+        # this and similar examples where a Fortran compiler
+        # environment variable has been customized by CI or a user
+        # should perhaps eventually be more thoroughly tested and more
+        # robustly handled
+        if fix:
+            fix = _shell_utils.NativeParser.split(fix)
+            fixflags = self.flag_vars.fix + f90flags
+
+        oflags, aflags, dflags = [], [], []
+        # examine get_flags_<tag>_<compiler> for extra flags
+        # only add them if the method is different from get_flags_<tag>
+        def get_flags(tag, flags):
+            # note that self.flag_vars.<tag> calls self.get_flags_<tag>()
+            flags.extend(getattr(self.flag_vars, tag))
+            this_get = getattr(self, 'get_flags_' + tag)
+            for name, c, flagvar in [('f77', f77, f77flags),
+                                     ('f90', f90, f90flags),
+                                     ('f90', fix, fixflags)]:
+                t = '%s_%s' % (tag, name)
+                if c and this_get is not getattr(self, 'get_flags_' + t):
+                    flagvar.extend(getattr(self.flag_vars, t))
+        if not noopt:
+            get_flags('opt', oflags)
+            if not noarch:
+                get_flags('arch', aflags)
+        if debug:
+            get_flags('debug', dflags)
+
+        fflags = self.flag_vars.flags + dflags + oflags + aflags
+
+        if f77:
+            self.set_commands(compiler_f77=f77+f77flags+fflags)
+        if f90:
+            self.set_commands(compiler_f90=f90+freeflags+f90flags+fflags)
+        if fix:
+            self.set_commands(compiler_fix=fix+fixflags+fflags)
+
+
+        #XXX: Do we need LDSHARED->SOSHARED, LDFLAGS->SOFLAGS
+        linker_so = self.linker_so
+        if linker_so:
+            linker_so_flags = self.flag_vars.linker_so
+            if sys.platform.startswith('aix'):
+                python_lib = get_python_lib(standard_lib=1)
+                ld_so_aix = os.path.join(python_lib, 'config', 'ld_so_aix')
+                python_exp = os.path.join(python_lib, 'config', 'python.exp')
+                linker_so = [ld_so_aix] + linker_so + ['-bI:'+python_exp]
+            self.set_commands(linker_so=linker_so+linker_so_flags)
+
+        linker_exe = self.linker_exe
+        if linker_exe:
+            linker_exe_flags = self.flag_vars.linker_exe
+            self.set_commands(linker_exe=linker_exe+linker_exe_flags)
+
+        ar = self.command_vars.archiver
+        if ar:
+            arflags = self.flag_vars.ar
+            self.set_commands(archiver=[ar]+arflags)
+
+        self.set_library_dirs(self.get_library_dirs())
+        self.set_libraries(self.get_libraries())
+
+    def dump_properties(self):
+        """Print out the attributes of a compiler instance."""
+        props = []
+        for key in list(self.executables.keys()) + \
+                ['version', 'libraries', 'library_dirs',
+                 'object_switch', 'compile_switch']:
+            if hasattr(self, key):
+                v = getattr(self, key)
+                props.append((key, None, '= '+repr(v)))
+        props.sort()
+
+        pretty_printer = FancyGetopt(props)
+        for l in pretty_printer.generate_help("%s instance properties:" \
+                                              % (self.__class__.__name__)):
+            if l[:4]=='  --':
+                l = '  ' + l[4:]
+            print(l)
+
+    ###################
+
+    def _compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
+        """Compile 'src' to product 'obj'."""
+        src_flags = {}
+        if is_f_file(src) and not has_f90_header(src):
+            flavor = ':f77'
+            compiler = self.compiler_f77
+            src_flags = get_f77flags(src)
+            extra_compile_args = self.extra_f77_compile_args or []
+        elif is_free_format(src):
+            flavor = ':f90'
+            compiler = self.compiler_f90
+            if compiler is None:
+                raise DistutilsExecError('f90 not supported by %s needed for %s'\
+                      % (self.__class__.__name__, src))
+            extra_compile_args = self.extra_f90_compile_args or []
+        else:
+            flavor = ':fix'
+            compiler = self.compiler_fix
+            if compiler is None:
+                raise DistutilsExecError('f90 (fixed) not supported by %s needed for %s'\
+                      % (self.__class__.__name__, src))
+            extra_compile_args = self.extra_f90_compile_args or []
+        if self.object_switch[-1]==' ':
+            o_args = [self.object_switch.strip(), obj]
+        else:
+            o_args = [self.object_switch.strip()+obj]
+
+        assert self.compile_switch.strip()
+        s_args = [self.compile_switch, src]
+
+        if extra_compile_args:
+            log.info('extra %s options: %r' \
+                     % (flavor[1:], ' '.join(extra_compile_args)))
+
+        extra_flags = src_flags.get(self.compiler_type, [])
+        if extra_flags:
+            log.info('using compile options from source: %r' \
+                     % ' '.join(extra_flags))
+
+        command = compiler + cc_args + extra_flags + s_args + o_args \
+                  + extra_postargs + extra_compile_args
+
+        display = '%s: %s' % (os.path.basename(compiler[0]) + flavor,
+                              src)
+        try:
+            self.spawn(command, display=display)
+        except DistutilsExecError as e:
+            msg = str(e)
+            raise CompileError(msg)
+
+    def module_options(self, module_dirs, module_build_dir):
+        options = []
+        if self.module_dir_switch is not None:
+            if self.module_dir_switch[-1]==' ':
+                options.extend([self.module_dir_switch.strip(), module_build_dir])
+            else:
+                options.append(self.module_dir_switch.strip()+module_build_dir)
+        else:
+            print('XXX: module_build_dir=%r option ignored' % (module_build_dir))
+            print('XXX: Fix module_dir_switch for ', self.__class__.__name__)
+        if self.module_include_switch is not None:
+            for d in [module_build_dir]+module_dirs:
+                options.append('%s%s' % (self.module_include_switch, d))
+        else:
+            print('XXX: module_dirs=%r option ignored' % (module_dirs))
+            print('XXX: Fix module_include_switch for ', self.__class__.__name__)
+        return options
+
+    def library_option(self, lib):
+        return "-l" + lib
+    def library_dir_option(self, dir):
+        return "-L" + dir
+
+    def link(self, target_desc, objects,
+             output_filename, output_dir=None, libraries=None,
+             library_dirs=None, runtime_library_dirs=None,
+             export_symbols=None, debug=0, extra_preargs=None,
+             extra_postargs=None, build_temp=None, target_lang=None):
+        objects, output_dir = self._fix_object_args(objects, output_dir)
+        libraries, library_dirs, runtime_library_dirs = \
+            self._fix_lib_args(libraries, library_dirs, runtime_library_dirs)
+
+        lib_opts = gen_lib_options(self, library_dirs, runtime_library_dirs,
+                                   libraries)
+        if is_string(output_dir):
+            output_filename = os.path.join(output_dir, output_filename)
+        elif output_dir is not None:
+            raise TypeError("'output_dir' must be a string or None")
+
+        if self._need_link(objects, output_filename):
+            if self.library_switch[-1]==' ':
+                o_args = [self.library_switch.strip(), output_filename]
+            else:
+                o_args = [self.library_switch.strip()+output_filename]
+
+            if is_string(self.objects):
+                ld_args = objects + [self.objects]
+            else:
+                ld_args = objects + self.objects
+            ld_args = ld_args + lib_opts + o_args
+            if debug:
+                ld_args[:0] = ['-g']
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+            self.mkpath(os.path.dirname(output_filename))
+            if target_desc == CCompiler.EXECUTABLE:
+                linker = self.linker_exe[:]
+            else:
+                linker = self.linker_so[:]
+            command = linker + ld_args
+            try:
+                self.spawn(command)
+            except DistutilsExecError as e:
+                msg = str(e)
+                raise LinkError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    def _environment_hook(self, name, hook_name):
+        if hook_name is None:
+            return None
+        if is_string(hook_name):
+            if hook_name.startswith('self.'):
+                hook_name = hook_name[5:]
+                hook = getattr(self, hook_name)
+                return hook()
+            elif hook_name.startswith('exe.'):
+                hook_name = hook_name[4:]
+                var = self.executables[hook_name]
+                if var:
+                    return var[0]
+                else:
+                    return None
+            elif hook_name.startswith('flags.'):
+                hook_name = hook_name[6:]
+                hook = getattr(self, 'get_flags_' + hook_name)
+                return hook()
+        else:
+            return hook_name()
+
+    def can_ccompiler_link(self, ccompiler):
+        """
+        Check if the given C compiler can link objects produced by
+        this compiler.
+        """
+        return True
+
+    def wrap_unlinkable_objects(self, objects, output_dir, extra_dll_dir):
+        """
+        Convert a set of object files that are not compatible with the default
+        linker, to a file that is compatible.
+
+        Parameters
+        ----------
+        objects : list
+            List of object files to include.
+        output_dir : str
+            Output directory to place generated object files.
+        extra_dll_dir : str
+            Output directory to place extra DLL files that need to be
+            included on Windows.
+
+        Returns
+        -------
+        converted_objects : list of str
+             List of converted object files.
+             Note that the number of output files is not necessarily
+             the same as inputs.
+
+        """
+        raise NotImplementedError()
+
+    ## class FCompiler
+
+_default_compilers = (
+    # sys.platform mappings
+    ('win32', ('gnu', 'intelv', 'absoft', 'compaqv', 'intelev', 'gnu95', 'g95',
+               'intelvem', 'intelem', 'flang')),
+    ('cygwin.*', ('gnu', 'intelv', 'absoft', 'compaqv', 'intelev', 'gnu95', 'g95')),
+    ('linux.*', ('gnu95', 'intel', 'lahey', 'pg', 'absoft', 'nag', 'vast', 'compaq',
+                 'intele', 'intelem', 'gnu', 'g95', 'pathf95', 'nagfor')),
+    ('darwin.*', ('gnu95', 'nag', 'absoft', 'ibm', 'intel', 'gnu', 'g95', 'pg')),
+    ('sunos.*', ('sun', 'gnu', 'gnu95', 'g95')),
+    ('irix.*', ('mips', 'gnu', 'gnu95',)),
+    ('aix.*', ('ibm', 'gnu', 'gnu95',)),
+    # os.name mappings
+    ('posix', ('gnu', 'gnu95',)),
+    ('nt', ('gnu', 'gnu95',)),
+    ('mac', ('gnu95', 'gnu', 'pg')),
+    )
+
+fcompiler_class = None
+fcompiler_aliases = None
+
+def load_all_fcompiler_classes():
+    """Cache all the FCompiler classes found in modules in the
+    numpy.distutils.fcompiler package.
+    """
+    from glob import glob
+    global fcompiler_class, fcompiler_aliases
+    if fcompiler_class is not None:
+        return
+    pys = os.path.join(os.path.dirname(__file__), '*.py')
+    fcompiler_class = {}
+    fcompiler_aliases = {}
+    for fname in glob(pys):
+        module_name, ext = os.path.splitext(os.path.basename(fname))
+        module_name = 'numpy.distutils.fcompiler.' + module_name
+        __import__ (module_name)
+        module = sys.modules[module_name]
+        if hasattr(module, 'compilers'):
+            for cname in module.compilers:
+                klass = getattr(module, cname)
+                desc = (klass.compiler_type, klass, klass.description)
+                fcompiler_class[klass.compiler_type] = desc
+                for alias in klass.compiler_aliases:
+                    if alias in fcompiler_aliases:
+                        raise ValueError("alias %r defined for both %s and %s"
+                                         % (alias, klass.__name__,
+                                            fcompiler_aliases[alias][1].__name__))
+                    fcompiler_aliases[alias] = desc
+
+def _find_existing_fcompiler(compiler_types,
+                             osname=None, platform=None,
+                             requiref90=False,
+                             c_compiler=None):
+    from numpy.distutils.core import get_distribution
+    dist = get_distribution(always=True)
+    for compiler_type in compiler_types:
+        v = None
+        try:
+            c = new_fcompiler(plat=platform, compiler=compiler_type,
+                              c_compiler=c_compiler)
+            c.customize(dist)
+            v = c.get_version()
+            if requiref90 and c.compiler_f90 is None:
+                v = None
+                new_compiler = c.suggested_f90_compiler
+                if new_compiler:
+                    log.warn('Trying %r compiler as suggested by %r '
+                             'compiler for f90 support.' % (compiler_type,
+                                                            new_compiler))
+                    c = new_fcompiler(plat=platform, compiler=new_compiler,
+                                      c_compiler=c_compiler)
+                    c.customize(dist)
+                    v = c.get_version()
+                    if v is not None:
+                        compiler_type = new_compiler
+            if requiref90 and c.compiler_f90 is None:
+                raise ValueError('%s does not support compiling f90 codes, '
+                                 'skipping.' % (c.__class__.__name__))
+        except DistutilsModuleError:
+            log.debug("_find_existing_fcompiler: compiler_type='%s' raised DistutilsModuleError", compiler_type)
+        except CompilerNotFound:
+            log.debug("_find_existing_fcompiler: compiler_type='%s' not found", compiler_type)
+        if v is not None:
+            return compiler_type
+    return None
+
+def available_fcompilers_for_platform(osname=None, platform=None):
+    if osname is None:
+        osname = os.name
+    if platform is None:
+        platform = sys.platform
+    matching_compiler_types = []
+    for pattern, compiler_type in _default_compilers:
+        if re.match(pattern, platform) or re.match(pattern, osname):
+            for ct in compiler_type:
+                if ct not in matching_compiler_types:
+                    matching_compiler_types.append(ct)
+    if not matching_compiler_types:
+        matching_compiler_types.append('gnu')
+    return matching_compiler_types
+
+def get_default_fcompiler(osname=None, platform=None, requiref90=False,
+                          c_compiler=None):
+    """Determine the default Fortran compiler to use for the given
+    platform."""
+    matching_compiler_types = available_fcompilers_for_platform(osname,
+                                                                platform)
+    log.info("get_default_fcompiler: matching types: '%s'",
+             matching_compiler_types)
+    compiler_type =  _find_existing_fcompiler(matching_compiler_types,
+                                              osname=osname,
+                                              platform=platform,
+                                              requiref90=requiref90,
+                                              c_compiler=c_compiler)
+    return compiler_type
+
+# Flag to avoid rechecking for Fortran compiler every time
+failed_fcompilers = set()
+
+def new_fcompiler(plat=None,
+                  compiler=None,
+                  verbose=0,
+                  dry_run=0,
+                  force=0,
+                  requiref90=False,
+                  c_compiler = None):
+    """Generate an instance of some FCompiler subclass for the supplied
+    platform/compiler combination.
+    """
+    global failed_fcompilers
+    fcompiler_key = (plat, compiler)
+    if fcompiler_key in failed_fcompilers:
+        return None
+
+    load_all_fcompiler_classes()
+    if plat is None:
+        plat = os.name
+    if compiler is None:
+        compiler = get_default_fcompiler(plat, requiref90=requiref90,
+                                         c_compiler=c_compiler)
+    if compiler in fcompiler_class:
+        module_name, klass, long_description = fcompiler_class[compiler]
+    elif compiler in fcompiler_aliases:
+        module_name, klass, long_description = fcompiler_aliases[compiler]
+    else:
+        msg = "don't know how to compile Fortran code on platform '%s'" % plat
+        if compiler is not None:
+            msg = msg + " with '%s' compiler." % compiler
+            msg = msg + " Supported compilers are: %s)" \
+                  % (','.join(fcompiler_class.keys()))
+        log.warn(msg)
+        failed_fcompilers.add(fcompiler_key)
+        return None
+
+    compiler = klass(verbose=verbose, dry_run=dry_run, force=force)
+    compiler.c_compiler = c_compiler
+    return compiler
+
+def show_fcompilers(dist=None):
+    """Print list of available compilers (used by the "--help-fcompiler"
+    option to "config_fc").
+    """
+    if dist is None:
+        from distutils.dist import Distribution
+        from numpy.distutils.command.config_compiler import config_fc
+        dist = Distribution()
+        dist.script_name = os.path.basename(sys.argv[0])
+        dist.script_args = ['config_fc'] + sys.argv[1:]
+        try:
+            dist.script_args.remove('--help-fcompiler')
+        except ValueError:
+            pass
+        dist.cmdclass['config_fc'] = config_fc
+        dist.parse_config_files()
+        dist.parse_command_line()
+    compilers = []
+    compilers_na = []
+    compilers_ni = []
+    if not fcompiler_class:
+        load_all_fcompiler_classes()
+    platform_compilers = available_fcompilers_for_platform()
+    for compiler in platform_compilers:
+        v = None
+        log.set_verbosity(-2)
+        try:
+            c = new_fcompiler(compiler=compiler, verbose=dist.verbose)
+            c.customize(dist)
+            v = c.get_version()
+        except (DistutilsModuleError, CompilerNotFound) as e:
+            log.debug("show_fcompilers: %s not found" % (compiler,))
+            log.debug(repr(e))
+
+        if v is None:
+            compilers_na.append(("fcompiler="+compiler, None,
+                              fcompiler_class[compiler][2]))
+        else:
+            c.dump_properties()
+            compilers.append(("fcompiler="+compiler, None,
+                              fcompiler_class[compiler][2] + ' (%s)' % v))
+
+    compilers_ni = list(set(fcompiler_class.keys()) - set(platform_compilers))
+    compilers_ni = [("fcompiler="+fc, None, fcompiler_class[fc][2])
+                    for fc in compilers_ni]
+
+    compilers.sort()
+    compilers_na.sort()
+    compilers_ni.sort()
+    pretty_printer = FancyGetopt(compilers)
+    pretty_printer.print_help("Fortran compilers found:")
+    pretty_printer = FancyGetopt(compilers_na)
+    pretty_printer.print_help("Compilers available for this "
+                              "platform, but not found:")
+    if compilers_ni:
+        pretty_printer = FancyGetopt(compilers_ni)
+        pretty_printer.print_help("Compilers not available on this platform:")
+    print("For compiler details, run 'config_fc --verbose' setup command.")
+
+
+def dummy_fortran_file():
+    fo, name = make_temp_file(suffix='.f')
+    fo.write("      subroutine dummy()\n      end\n")
+    fo.close()
+    return name[:-2]
+
+
+is_f_file = re.compile(r'.*[.](for|ftn|f77|f)\Z', re.I).match
+_has_f_header = re.compile(r'-[*]-\s*fortran\s*-[*]-', re.I).search
+_has_f90_header = re.compile(r'-[*]-\s*f90\s*-[*]-', re.I).search
+_has_fix_header = re.compile(r'-[*]-\s*fix\s*-[*]-', re.I).search
+_free_f90_start = re.compile(r'[^c*!]\s*[^\s\d\t]', re.I).match
+
+def is_free_format(file):
+    """Check if file is in free format Fortran."""
+    # f90 allows both fixed and free format, assuming fixed unless
+    # signs of free format are detected.
+    result = 0
+    f = open_latin1(file, 'r')
+    line = f.readline()
+    n = 10000 # the number of non-comment lines to scan for hints
+    if _has_f_header(line):
+        n = 0
+    elif _has_f90_header(line):
+        n = 0
+        result = 1
+    while n>0 and line:
+        line = line.rstrip()
+        if line and line[0]!='!':
+            n -= 1
+            if (line[0]!='\t' and _free_f90_start(line[:5])) or line[-1:]=='&':
+                result = 1
+                break
+        line = f.readline()
+    f.close()
+    return result
+
+def has_f90_header(src):
+    f = open_latin1(src, 'r')
+    line = f.readline()
+    f.close()
+    return _has_f90_header(line) or _has_fix_header(line)
+
+_f77flags_re = re.compile(r'(c|)f77flags\s*\(\s*(?P<fcname>\w+)\s*\)\s*=\s*(?P<fflags>.*)', re.I)
+def get_f77flags(src):
+    """
+    Search the first 20 lines of fortran 77 code for line pattern
+      `CF77FLAGS(<fcompiler type>)=<f77 flags>`
+    Return a dictionary {<fcompiler type>:<f77 flags>}.
+    """
+    flags = {}
+    f = open_latin1(src, 'r')
+    i = 0
+    for line in f:
+        i += 1
+        if i>20: break
+        m = _f77flags_re.match(line)
+        if not m: continue
+        fcname = m.group('fcname').strip()
+        fflags = m.group('fflags').strip()
+        flags[fcname] = split_quoted(fflags)
+    f.close()
+    return flags
+
+# TODO: implement get_f90flags and use it in _compile similarly to get_f77flags
+
+if __name__ == '__main__':
+    show_fcompilers()
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..d54ea2e4d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/absoft.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/absoft.cpython-36.pyc
new file mode 100644
index 000000000..519e57022
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/absoft.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/compaq.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/compaq.cpython-36.pyc
new file mode 100644
index 000000000..6be4096da
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/compaq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/environment.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/environment.cpython-36.pyc
new file mode 100644
index 000000000..45673b2e2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/environment.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/g95.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/g95.cpython-36.pyc
new file mode 100644
index 000000000..f4d7b30bf
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/g95.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/gnu.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/gnu.cpython-36.pyc
new file mode 100644
index 000000000..e09296f8b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/gnu.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/hpux.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/hpux.cpython-36.pyc
new file mode 100644
index 000000000..ceecd2c90
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/hpux.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/ibm.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/ibm.cpython-36.pyc
new file mode 100644
index 000000000..e6206d2df
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/ibm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/intel.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/intel.cpython-36.pyc
new file mode 100644
index 000000000..8df31d411
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/intel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/lahey.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/lahey.cpython-36.pyc
new file mode 100644
index 000000000..738d09a85
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/lahey.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/mips.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/mips.cpython-36.pyc
new file mode 100644
index 000000000..108042565
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/mips.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/nag.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/nag.cpython-36.pyc
new file mode 100644
index 000000000..e907312e6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/nag.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/none.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/none.cpython-36.pyc
new file mode 100644
index 000000000..026192941
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/none.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pathf95.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pathf95.cpython-36.pyc
new file mode 100644
index 000000000..2fd363392
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pathf95.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pg.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pg.cpython-36.pyc
new file mode 100644
index 000000000..756750702
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/pg.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/sun.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/sun.cpython-36.pyc
new file mode 100644
index 000000000..4fc1a02a1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/sun.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/vast.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/vast.cpython-36.pyc
new file mode 100644
index 000000000..c99d72a71
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/fcompiler/__pycache__/vast.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/absoft.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/absoft.py
new file mode 100644
index 000000000..efe3a4cb5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/absoft.py
@@ -0,0 +1,156 @@
+
+# http://www.absoft.com/literature/osxuserguide.pdf
+# http://www.absoft.com/documentation.html
+
+# Notes:
+# - when using -g77 then use -DUNDERSCORE_G77 to compile f2py
+#   generated extension modules (works for f2py v2.45.241_1936 and up)
+import os
+
+from numpy.distutils.cpuinfo import cpu
+from numpy.distutils.fcompiler import FCompiler, dummy_fortran_file
+from numpy.distutils.misc_util import cyg2win32
+
+compilers = ['AbsoftFCompiler']
+
+class AbsoftFCompiler(FCompiler):
+
+    compiler_type = 'absoft'
+    description = 'Absoft Corp Fortran Compiler'
+    #version_pattern = r'FORTRAN 77 Compiler (?P<version>[^\s*,]*).*?Absoft Corp'
+    version_pattern = r'(f90:.*?(Absoft Pro FORTRAN Version|FORTRAN 77 Compiler|Absoft Fortran Compiler Version|Copyright Absoft Corporation.*?Version))'+\
+                       r' (?P<version>[^\s*,]*)(.*?Absoft Corp|)'
+
+    # on windows: f90 -V -c dummy.f
+    # f90: Copyright Absoft Corporation 1994-1998 mV2; Cray Research, Inc. 1994-1996 CF90 (2.x.x.x  f36t87) Version 2.3 Wed Apr 19, 2006  13:05:16
+
+    # samt5735(8)$ f90 -V -c dummy.f
+    # f90: Copyright Absoft Corporation 1994-2002; Absoft Pro FORTRAN Version 8.0
+    # Note that fink installs g77 as f77, so need to use f90 for detection.
+
+    executables = {
+        'version_cmd'  : None,          # set by update_executables
+        'compiler_f77' : ["f77"],
+        'compiler_fix' : ["f90"],
+        'compiler_f90' : ["f90"],
+        'linker_so'    : ["<F90>"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    if os.name=='nt':
+        library_switch = '/out:'      #No space after /out:!
+
+    module_dir_switch = None
+    module_include_switch = '-p'
+
+    def update_executables(self):
+        f = cyg2win32(dummy_fortran_file())
+        self.executables['version_cmd'] = ['<F90>', '-V', '-c',
+                                           f+'.f', '-o', f+'.o']
+
+    def get_flags_linker_so(self):
+        if os.name=='nt':
+            opt = ['/dll']
+        # The "-K shared" switches are being left in for pre-9.0 versions
+        # of Absoft though I don't think versions earlier than 9 can
+        # actually be used to build shared libraries.  In fact, version
+        # 8 of Absoft doesn't recognize "-K shared" and will fail.
+        elif self.get_version() >= '9.0':
+            opt = ['-shared']
+        else:
+            opt = ["-K", "shared"]
+        return opt
+
+    def library_dir_option(self, dir):
+        if os.name=='nt':
+            return ['-link', '/PATH:%s' % (dir)]
+        return "-L" + dir
+
+    def library_option(self, lib):
+        if os.name=='nt':
+            return '%s.lib' % (lib)
+        return "-l" + lib
+
+    def get_library_dirs(self):
+        opt = FCompiler.get_library_dirs(self)
+        d = os.environ.get('ABSOFT')
+        if d:
+            if self.get_version() >= '10.0':
+                # use shared libraries, the static libraries were not compiled -fPIC
+                prefix = 'sh'
+            else:
+                prefix = ''
+            if cpu.is_64bit():
+                suffix = '64'
+            else:
+                suffix = ''
+            opt.append(os.path.join(d, '%slib%s' % (prefix, suffix)))
+        return opt
+
+    def get_libraries(self):
+        opt = FCompiler.get_libraries(self)
+        if self.get_version() >= '11.0':
+            opt.extend(['af90math', 'afio', 'af77math', 'amisc'])
+        elif self.get_version() >= '10.0':
+            opt.extend(['af90math', 'afio', 'af77math', 'U77'])
+        elif self.get_version() >= '8.0':
+            opt.extend(['f90math', 'fio', 'f77math', 'U77'])
+        else:
+            opt.extend(['fio', 'f90math', 'fmath', 'U77'])
+        if os.name =='nt':
+            opt.append('COMDLG32')
+        return opt
+
+    def get_flags(self):
+        opt = FCompiler.get_flags(self)
+        if os.name != 'nt':
+            opt.extend(['-s'])
+            if self.get_version():
+                if self.get_version()>='8.2':
+                    opt.append('-fpic')
+        return opt
+
+    def get_flags_f77(self):
+        opt = FCompiler.get_flags_f77(self)
+        opt.extend(['-N22', '-N90', '-N110'])
+        v = self.get_version()
+        if os.name == 'nt':
+            if v and v>='8.0':
+                opt.extend(['-f', '-N15'])
+        else:
+            opt.append('-f')
+            if v:
+                if v<='4.6':
+                    opt.append('-B108')
+                else:
+                    # Though -N15 is undocumented, it works with
+                    # Absoft 8.0 on Linux
+                    opt.append('-N15')
+        return opt
+
+    def get_flags_f90(self):
+        opt = FCompiler.get_flags_f90(self)
+        opt.extend(["-YCFRL=1", "-YCOM_NAMES=LCS", "-YCOM_PFX", "-YEXT_PFX",
+                    "-YCOM_SFX=_", "-YEXT_SFX=_", "-YEXT_NAMES=LCS"])
+        if self.get_version():
+            if self.get_version()>'4.6':
+                opt.extend(["-YDEALLOC=ALL"])
+        return opt
+
+    def get_flags_fix(self):
+        opt = FCompiler.get_flags_fix(self)
+        opt.extend(["-YCFRL=1", "-YCOM_NAMES=LCS", "-YCOM_PFX", "-YEXT_PFX",
+                    "-YCOM_SFX=_", "-YEXT_SFX=_", "-YEXT_NAMES=LCS"])
+        opt.extend(["-f", "fixed"])
+        return opt
+
+    def get_flags_opt(self):
+        opt = ['-O']
+        return opt
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='absoft').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/compaq.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/compaq.py
new file mode 100644
index 000000000..6ce590c7c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/compaq.py
@@ -0,0 +1,120 @@
+
+#http://www.compaq.com/fortran/docs/
+import os
+import sys
+
+from numpy.distutils.fcompiler import FCompiler
+from distutils.errors import DistutilsPlatformError
+
+compilers = ['CompaqFCompiler']
+if os.name != 'posix' or sys.platform[:6] == 'cygwin' :
+    # Otherwise we'd get a false positive on posix systems with
+    # case-insensitive filesystems (like darwin), because we'll pick
+    # up /bin/df
+    compilers.append('CompaqVisualFCompiler')
+
+class CompaqFCompiler(FCompiler):
+
+    compiler_type = 'compaq'
+    description = 'Compaq Fortran Compiler'
+    version_pattern = r'Compaq Fortran (?P<version>[^\s]*).*'
+
+    if sys.platform[:5]=='linux':
+        fc_exe = 'fort'
+    else:
+        fc_exe = 'f90'
+
+    executables = {
+        'version_cmd'  : ['<F90>', "-version"],
+        'compiler_f77' : [fc_exe, "-f77rtl", "-fixed"],
+        'compiler_fix' : [fc_exe, "-fixed"],
+        'compiler_f90' : [fc_exe],
+        'linker_so'    : ['<F90>'],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    module_dir_switch = '-module ' # not tested
+    module_include_switch = '-I'
+
+    def get_flags(self):
+        return ['-assume no2underscore', '-nomixed_str_len_arg']
+    def get_flags_debug(self):
+        return ['-g', '-check bounds']
+    def get_flags_opt(self):
+        return ['-O4', '-align dcommons', '-assume bigarrays',
+                '-assume nozsize', '-math_library fast']
+    def get_flags_arch(self):
+        return ['-arch host', '-tune host']
+    def get_flags_linker_so(self):
+        if sys.platform[:5]=='linux':
+            return ['-shared']
+        return ['-shared', '-Wl,-expect_unresolved,*']
+
+class CompaqVisualFCompiler(FCompiler):
+
+    compiler_type = 'compaqv'
+    description = 'DIGITAL or Compaq Visual Fortran Compiler'
+    version_pattern = (r'(DIGITAL|Compaq) Visual Fortran Optimizing Compiler'
+                       r' Version (?P<version>[^\s]*).*')
+
+    compile_switch = '/compile_only'
+    object_switch = '/object:'
+    library_switch = '/OUT:'      #No space after /OUT:!
+
+    static_lib_extension = ".lib"
+    static_lib_format = "%s%s"
+    module_dir_switch = '/module:'
+    module_include_switch = '/I'
+
+    ar_exe = 'lib.exe'
+    fc_exe = 'DF'
+
+    if sys.platform=='win32':
+        from numpy.distutils.msvccompiler import MSVCCompiler
+
+        try:
+            m = MSVCCompiler()
+            m.initialize()
+            ar_exe = m.lib
+        except DistutilsPlatformError:
+            pass
+        except AttributeError as e:
+            if '_MSVCCompiler__root' in str(msg):
+                print('Ignoring "%s" (I think it is msvccompiler.py bug)' % (msg))
+            else:
+                raise
+        except IOError as e:
+            if not "vcvarsall.bat" in str(e):
+                print("Unexpected IOError in", __file__)
+                raise e
+        except ValueError as e:
+            if not "'path'" in str(e):
+                print("Unexpected ValueError in", __file__)
+                raise e
+
+    executables = {
+        'version_cmd'  : ['<F90>', "/what"],
+        'compiler_f77' : [fc_exe, "/f77rtl", "/fixed"],
+        'compiler_fix' : [fc_exe, "/fixed"],
+        'compiler_f90' : [fc_exe],
+        'linker_so'    : ['<F90>'],
+        'archiver'     : [ar_exe, "/OUT:"],
+        'ranlib'       : None
+        }
+
+    def get_flags(self):
+        return ['/nologo', '/MD', '/WX', '/iface=(cref,nomixed_str_len_arg)',
+                '/names:lowercase', '/assume:underscore']
+    def get_flags_opt(self):
+        return ['/Ox', '/fast', '/optimize:5', '/unroll:0', '/math_library:fast']
+    def get_flags_arch(self):
+        return ['/threads']
+    def get_flags_debug(self):
+        return ['/debug']
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='compaq').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/environment.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/environment.py
new file mode 100644
index 000000000..21a5be003
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/environment.py
@@ -0,0 +1,85 @@
+import os
+from distutils.dist import Distribution
+
+__metaclass__ = type
+
+class EnvironmentConfig:
+    def __init__(self, distutils_section='ALL', **kw):
+        self._distutils_section = distutils_section
+        self._conf_keys = kw
+        self._conf = None
+        self._hook_handler = None
+
+    def dump_variable(self, name):
+        conf_desc = self._conf_keys[name]
+        hook, envvar, confvar, convert, append = conf_desc
+        if not convert:
+            convert = lambda x : x
+        print('%s.%s:' % (self._distutils_section, name))
+        v = self._hook_handler(name, hook)
+        print('  hook   : %s' % (convert(v),))
+        if envvar:
+            v = os.environ.get(envvar, None)
+            print('  environ: %s' % (convert(v),))
+        if confvar and self._conf:
+            v = self._conf.get(confvar, (None, None))[1]
+            print('  config : %s' % (convert(v),))
+
+    def dump_variables(self):
+        for name in self._conf_keys:
+            self.dump_variable(name)
+
+    def __getattr__(self, name):
+        try:
+            conf_desc = self._conf_keys[name]
+        except KeyError:
+            raise AttributeError(name)
+        return self._get_var(name, conf_desc)
+
+    def get(self, name, default=None):
+        try:
+            conf_desc = self._conf_keys[name]
+        except KeyError:
+            return default
+        var = self._get_var(name, conf_desc)
+        if var is None:
+            var = default
+        return var
+
+    def _get_var(self, name, conf_desc):
+        hook, envvar, confvar, convert, append = conf_desc
+        if convert is None:
+            convert = lambda x: x
+        var = self._hook_handler(name, hook)
+        if envvar is not None:
+            envvar_contents = os.environ.get(envvar)
+            if envvar_contents is not None:
+                envvar_contents = convert(envvar_contents)
+                if var and append:
+                    if os.environ.get('NPY_DISTUTILS_APPEND_FLAGS', '1') == '1':
+                        var.extend(envvar_contents)
+                    else:
+                        # NPY_DISTUTILS_APPEND_FLAGS was explicitly set to 0
+                        # to keep old (overwrite flags rather than append to
+                        # them) behavior
+                        var = envvar_contents
+                else:
+                    var = envvar_contents
+        if confvar is not None and self._conf:
+            if confvar in self._conf:
+                source, confvar_contents = self._conf[confvar]
+                var = convert(confvar_contents)
+        return var
+
+
+    def clone(self, hook_handler):
+        ec = self.__class__(distutils_section=self._distutils_section,
+                            **self._conf_keys)
+        ec._hook_handler = hook_handler
+        return ec
+
+    def use_distribution(self, dist):
+        if isinstance(dist, Distribution):
+            self._conf = dist.get_option_dict(self._distutils_section)
+        else:
+            self._conf = dist
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/g95.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/g95.py
new file mode 100644
index 000000000..e109a972a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/g95.py
@@ -0,0 +1,42 @@
+# http://g95.sourceforge.net/
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['G95FCompiler']
+
+class G95FCompiler(FCompiler):
+    compiler_type = 'g95'
+    description = 'G95 Fortran Compiler'
+
+#    version_pattern = r'G95 \((GCC (?P<gccversion>[\d.]+)|.*?) \(g95!\) (?P<version>.*)\).*'
+    # $ g95 --version
+    # G95 (GCC 4.0.3 (g95!) May 22 2006)
+
+    version_pattern = r'G95 \((GCC (?P<gccversion>[\d.]+)|.*?) \(g95 (?P<version>.*)!\) (?P<date>.*)\).*'
+    # $ g95 --version
+    # G95 (GCC 4.0.3 (g95 0.90!) Aug 22 2006)
+
+    executables = {
+        'version_cmd'  : ["<F90>", "--version"],
+        'compiler_f77' : ["g95", "-ffixed-form"],
+        'compiler_fix' : ["g95", "-ffixed-form"],
+        'compiler_f90' : ["g95"],
+        'linker_so'    : ["<F90>", "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+    pic_flags = ['-fpic']
+    module_dir_switch = '-fmod='
+    module_include_switch = '-I'
+
+    def get_flags(self):
+        return ['-fno-second-underscore']
+    def get_flags_opt(self):
+        return ['-O']
+    def get_flags_debug(self):
+        return ['-g']
+
+if __name__ == '__main__':
+    from distutils import log
+    from numpy.distutils import customized_fcompiler
+    log.set_verbosity(2)
+    print(customized_fcompiler('g95').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/gnu.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/gnu.py
new file mode 100644
index 000000000..caa08549e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/gnu.py
@@ -0,0 +1,556 @@
+import re
+import os
+import sys
+import warnings
+import platform
+import tempfile
+import hashlib
+import base64
+import subprocess
+from subprocess import Popen, PIPE, STDOUT
+from numpy.distutils.exec_command import filepath_from_subprocess_output
+from numpy.distutils.fcompiler import FCompiler
+from distutils.version import LooseVersion
+
+compilers = ['GnuFCompiler', 'Gnu95FCompiler']
+
+TARGET_R = re.compile(r"Target: ([a-zA-Z0-9_\-]*)")
+
+# XXX: handle cross compilation
+
+
+def is_win64():
+    return sys.platform == "win32" and platform.architecture()[0] == "64bit"
+
+
+if is_win64():
+    #_EXTRAFLAGS = ["-fno-leading-underscore"]
+    _EXTRAFLAGS = []
+else:
+    _EXTRAFLAGS = []
+
+
+class GnuFCompiler(FCompiler):
+    compiler_type = 'gnu'
+    compiler_aliases = ('g77', )
+    description = 'GNU Fortran 77 compiler'
+
+    def gnu_version_match(self, version_string):
+        """Handle the different versions of GNU fortran compilers"""
+        # Strip warning(s) that may be emitted by gfortran
+        while version_string.startswith('gfortran: warning'):
+            version_string = version_string[version_string.find('\n') + 1:]
+
+        # Gfortran versions from after 2010 will output a simple string
+        # (usually "x.y", "x.y.z" or "x.y.z-q") for ``-dumpversion``; older
+        # gfortrans may still return long version strings (``-dumpversion`` was
+        # an alias for ``--version``)
+        if len(version_string) <= 20:
+            # Try to find a valid version string
+            m = re.search(r'([0-9.]+)', version_string)
+            if m:
+                # g77 provides a longer version string that starts with GNU
+                # Fortran
+                if version_string.startswith('GNU Fortran'):
+                    return ('g77', m.group(1))
+
+                # gfortran only outputs a version string such as #.#.#, so check
+                # if the match is at the start of the string
+                elif m.start() == 0:
+                    return ('gfortran', m.group(1))
+        else:
+            # Output probably from --version, try harder:
+            m = re.search(r'GNU Fortran\s+95.*?([0-9-.]+)', version_string)
+            if m:
+                return ('gfortran', m.group(1))
+            m = re.search(
+                r'GNU Fortran.*?\-?([0-9-.]+\.[0-9-.]+)', version_string)
+            if m:
+                v = m.group(1)
+                if v.startswith('0') or v.startswith('2') or v.startswith('3'):
+                    # the '0' is for early g77's
+                    return ('g77', v)
+                else:
+                    # at some point in the 4.x series, the ' 95' was dropped
+                    # from the version string
+                    return ('gfortran', v)
+
+        # If still nothing, raise an error to make the problem easy to find.
+        err = 'A valid Fortran version was not found in this string:\n'
+        raise ValueError(err + version_string)
+
+    def version_match(self, version_string):
+        v = self.gnu_version_match(version_string)
+        if not v or v[0] != 'g77':
+            return None
+        return v[1]
+
+    possible_executables = ['g77', 'f77']
+    executables = {
+        'version_cmd'  : [None, "-dumpversion"],
+        'compiler_f77' : [None, "-g", "-Wall", "-fno-second-underscore"],
+        'compiler_f90' : None,  # Use --fcompiler=gnu95 for f90 codes
+        'compiler_fix' : None,
+        'linker_so'    : [None, "-g", "-Wall"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"],
+        'linker_exe'   : [None, "-g", "-Wall"]
+    }
+    module_dir_switch = None
+    module_include_switch = None
+
+    # Cygwin: f771: warning: -fPIC ignored for target (all code is
+    # position independent)
+    if os.name != 'nt' and sys.platform != 'cygwin':
+        pic_flags = ['-fPIC']
+
+    # use -mno-cygwin for g77 when Python is not Cygwin-Python
+    if sys.platform == 'win32':
+        for key in ['version_cmd', 'compiler_f77', 'linker_so', 'linker_exe']:
+            executables[key].append('-mno-cygwin')
+
+    g2c = 'g2c'
+    suggested_f90_compiler = 'gnu95'
+
+    def get_flags_linker_so(self):
+        opt = self.linker_so[1:]
+        if sys.platform == 'darwin':
+            target = os.environ.get('MACOSX_DEPLOYMENT_TARGET', None)
+            # If MACOSX_DEPLOYMENT_TARGET is set, we simply trust the value
+            # and leave it alone.  But, distutils will complain if the
+            # environment's value is different from the one in the Python
+            # Makefile used to build Python.  We let disutils handle this
+            # error checking.
+            if not target:
+                # If MACOSX_DEPLOYMENT_TARGET is not set in the environment,
+                # we try to get it first from sysconfig and then
+                # fall back to setting it to 10.9 This is a reasonable default
+                # even when using the official Python dist and those derived
+                # from it.
+                import sysconfig
+                target = sysconfig.get_config_var('MACOSX_DEPLOYMENT_TARGET')
+                if not target:
+                    target = '10.9'
+                    s = f'Env. variable MACOSX_DEPLOYMENT_TARGET set to {target}'
+                    warnings.warn(s, stacklevel=2)
+                os.environ['MACOSX_DEPLOYMENT_TARGET'] = target
+            opt.extend(['-undefined', 'dynamic_lookup', '-bundle'])
+        else:
+            opt.append("-shared")
+        if sys.platform.startswith('sunos'):
+            # SunOS often has dynamically loaded symbols defined in the
+            # static library libg2c.a  The linker doesn't like this.  To
+            # ignore the problem, use the -mimpure-text flag.  It isn't
+            # the safest thing, but seems to work. 'man gcc' says:
+            # ".. Instead of using -mimpure-text, you should compile all
+            #  source code with -fpic or -fPIC."
+            opt.append('-mimpure-text')
+        return opt
+
+    def get_libgcc_dir(self):
+        try:
+            output = subprocess.check_output(self.compiler_f77 +
+                                            ['-print-libgcc-file-name'])
+        except (OSError, subprocess.CalledProcessError):
+            pass
+        else:
+            output = filepath_from_subprocess_output(output)
+            return os.path.dirname(output)
+        return None
+
+    def get_libgfortran_dir(self):
+        if sys.platform[:5] == 'linux':
+            libgfortran_name = 'libgfortran.so'
+        elif sys.platform == 'darwin':
+            libgfortran_name = 'libgfortran.dylib'
+        else:
+            libgfortran_name = None
+
+        libgfortran_dir = None
+        if libgfortran_name:
+            find_lib_arg = ['-print-file-name={0}'.format(libgfortran_name)]
+            try:
+                output = subprocess.check_output(
+                                       self.compiler_f77 + find_lib_arg)
+            except (OSError, subprocess.CalledProcessError):
+                pass
+            else:
+                output = filepath_from_subprocess_output(output)
+                libgfortran_dir = os.path.dirname(output)
+        return libgfortran_dir
+
+    def get_library_dirs(self):
+        opt = []
+        if sys.platform[:5] != 'linux':
+            d = self.get_libgcc_dir()
+            if d:
+                # if windows and not cygwin, libg2c lies in a different folder
+                if sys.platform == 'win32' and not d.startswith('/usr/lib'):
+                    d = os.path.normpath(d)
+                    path = os.path.join(d, "lib%s.a" % self.g2c)
+                    if not os.path.exists(path):
+                        root = os.path.join(d, *((os.pardir, ) * 4))
+                        d2 = os.path.abspath(os.path.join(root, 'lib'))
+                        path = os.path.join(d2, "lib%s.a" % self.g2c)
+                        if os.path.exists(path):
+                            opt.append(d2)
+                opt.append(d)
+        # For Macports / Linux, libgfortran and libgcc are not co-located
+        lib_gfortran_dir = self.get_libgfortran_dir()
+        if lib_gfortran_dir:
+            opt.append(lib_gfortran_dir)
+        return opt
+
+    def get_libraries(self):
+        opt = []
+        d = self.get_libgcc_dir()
+        if d is not None:
+            g2c = self.g2c + '-pic'
+            f = self.static_lib_format % (g2c, self.static_lib_extension)
+            if not os.path.isfile(os.path.join(d, f)):
+                g2c = self.g2c
+        else:
+            g2c = self.g2c
+
+        if g2c is not None:
+            opt.append(g2c)
+        c_compiler = self.c_compiler
+        if sys.platform == 'win32' and c_compiler and \
+                c_compiler.compiler_type == 'msvc':
+            opt.append('gcc')
+        if sys.platform == 'darwin':
+            opt.append('cc_dynamic')
+        return opt
+
+    def get_flags_debug(self):
+        return ['-g']
+
+    def get_flags_opt(self):
+        v = self.get_version()
+        if v and v <= '3.3.3':
+            # With this compiler version building Fortran BLAS/LAPACK
+            # with -O3 caused failures in lib.lapack heevr,syevr tests.
+            opt = ['-O2']
+        else:
+            opt = ['-O3']
+        opt.append('-funroll-loops')
+        return opt
+
+    def _c_arch_flags(self):
+        """ Return detected arch flags from CFLAGS """
+        from distutils import sysconfig
+        try:
+            cflags = sysconfig.get_config_vars()['CFLAGS']
+        except KeyError:
+            return []
+        arch_re = re.compile(r"-arch\s+(\w+)")
+        arch_flags = []
+        for arch in arch_re.findall(cflags):
+            arch_flags += ['-arch', arch]
+        return arch_flags
+
+    def get_flags_arch(self):
+        return []
+
+    def runtime_library_dir_option(self, dir):
+        if sys.platform == 'win32':
+            # Linux/Solaris/Unix support RPATH, Windows does not
+            raise NotImplementedError
+
+        # TODO: could use -Xlinker here, if it's supported
+        assert "," not in dir
+
+        if sys.platform == 'darwin':
+            return f'-Wl,-rpath,{dir}'
+        elif sys.platform[:3] == 'aix':
+            # AIX RPATH is called LIBPATH
+            return f'-Wl,-blibpath:{dir}'
+        else:
+            return f'-Wl,-rpath={dir}'
+
+
+class Gnu95FCompiler(GnuFCompiler):
+    compiler_type = 'gnu95'
+    compiler_aliases = ('gfortran', )
+    description = 'GNU Fortran 95 compiler'
+
+    def version_match(self, version_string):
+        v = self.gnu_version_match(version_string)
+        if not v or v[0] != 'gfortran':
+            return None
+        v = v[1]
+        if LooseVersion(v) >= "4":
+            # gcc-4 series releases do not support -mno-cygwin option
+            pass
+        else:
+            # use -mno-cygwin flag for gfortran when Python is not
+            # Cygwin-Python
+            if sys.platform == 'win32':
+                for key in [
+                        'version_cmd', 'compiler_f77', 'compiler_f90',
+                        'compiler_fix', 'linker_so', 'linker_exe'
+                ]:
+                    self.executables[key].append('-mno-cygwin')
+        return v
+
+    possible_executables = ['gfortran', 'f95']
+    executables = {
+        'version_cmd'  : ["<F90>", "-dumpversion"],
+        'compiler_f77' : [None, "-Wall", "-g", "-ffixed-form",
+                          "-fno-second-underscore"] + _EXTRAFLAGS,
+        'compiler_f90' : [None, "-Wall", "-g",
+                          "-fno-second-underscore"] + _EXTRAFLAGS,
+        'compiler_fix' : [None, "-Wall",  "-g","-ffixed-form",
+                          "-fno-second-underscore"] + _EXTRAFLAGS,
+        'linker_so'    : ["<F90>", "-Wall", "-g"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"],
+        'linker_exe'   : [None, "-Wall"]
+    }
+
+    module_dir_switch = '-J'
+    module_include_switch = '-I'
+
+    if sys.platform[:3] == 'aix':
+        executables['linker_so'].append('-lpthread')
+        if platform.architecture()[0][:2] == '64':
+            for key in ['compiler_f77', 'compiler_f90','compiler_fix','linker_so', 'linker_exe']:
+                executables[key].append('-maix64')
+
+    g2c = 'gfortran'
+
+    def _universal_flags(self, cmd):
+        """Return a list of -arch flags for every supported architecture."""
+        if not sys.platform == 'darwin':
+            return []
+        arch_flags = []
+        # get arches the C compiler gets.
+        c_archs = self._c_arch_flags()
+        if "i386" in c_archs:
+            c_archs[c_archs.index("i386")] = "i686"
+        # check the arches the Fortran compiler supports, and compare with
+        # arch flags from C compiler
+        for arch in ["ppc", "i686", "x86_64", "ppc64"]:
+            if _can_target(cmd, arch) and arch in c_archs:
+                arch_flags.extend(["-arch", arch])
+        return arch_flags
+
+    def get_flags(self):
+        flags = GnuFCompiler.get_flags(self)
+        arch_flags = self._universal_flags(self.compiler_f90)
+        if arch_flags:
+            flags[:0] = arch_flags
+        return flags
+
+    def get_flags_linker_so(self):
+        flags = GnuFCompiler.get_flags_linker_so(self)
+        arch_flags = self._universal_flags(self.linker_so)
+        if arch_flags:
+            flags[:0] = arch_flags
+        return flags
+
+    def get_library_dirs(self):
+        opt = GnuFCompiler.get_library_dirs(self)
+        if sys.platform == 'win32':
+            c_compiler = self.c_compiler
+            if c_compiler and c_compiler.compiler_type == "msvc":
+                target = self.get_target()
+                if target:
+                    d = os.path.normpath(self.get_libgcc_dir())
+                    root = os.path.join(d, *((os.pardir, ) * 4))
+                    path = os.path.join(root, "lib")
+                    mingwdir = os.path.normpath(path)
+                    if os.path.exists(os.path.join(mingwdir, "libmingwex.a")):
+                        opt.append(mingwdir)
+        # For Macports / Linux, libgfortran and libgcc are not co-located
+        lib_gfortran_dir = self.get_libgfortran_dir()
+        if lib_gfortran_dir:
+            opt.append(lib_gfortran_dir)
+        return opt
+
+    def get_libraries(self):
+        opt = GnuFCompiler.get_libraries(self)
+        if sys.platform == 'darwin':
+            opt.remove('cc_dynamic')
+        if sys.platform == 'win32':
+            c_compiler = self.c_compiler
+            if c_compiler and c_compiler.compiler_type == "msvc":
+                if "gcc" in opt:
+                    i = opt.index("gcc")
+                    opt.insert(i + 1, "mingwex")
+                    opt.insert(i + 1, "mingw32")
+            c_compiler = self.c_compiler
+            if c_compiler and c_compiler.compiler_type == "msvc":
+                return []
+            else:
+                pass
+        return opt
+
+    def get_target(self):
+        try:
+            output = subprocess.check_output(self.compiler_f77 + ['-v'])
+        except (OSError, subprocess.CalledProcessError):
+            pass
+        else:
+            output = filepath_from_subprocess_output(output)
+            m = TARGET_R.search(output)
+            if m:
+                return m.group(1)
+        return ""
+
+    def _hash_files(self, filenames):
+        h = hashlib.sha1()
+        for fn in filenames:
+            with open(fn, 'rb') as f:
+                while True:
+                    block = f.read(131072)
+                    if not block:
+                        break
+                    h.update(block)
+        text = base64.b32encode(h.digest())
+        text = text.decode('ascii')
+        return text.rstrip('=')
+
+    def _link_wrapper_lib(self, objects, output_dir, extra_dll_dir,
+                          chained_dlls, is_archive):
+        """Create a wrapper shared library for the given objects
+
+        Return an MSVC-compatible lib
+        """
+
+        c_compiler = self.c_compiler
+        if c_compiler.compiler_type != "msvc":
+            raise ValueError("This method only supports MSVC")
+
+        object_hash = self._hash_files(list(objects) + list(chained_dlls))
+
+        if is_win64():
+            tag = 'win_amd64'
+        else:
+            tag = 'win32'
+
+        basename = 'lib' + os.path.splitext(
+            os.path.basename(objects[0]))[0][:8]
+        root_name = basename + '.' + object_hash + '.gfortran-' + tag
+        dll_name = root_name + '.dll'
+        def_name = root_name + '.def'
+        lib_name = root_name + '.lib'
+        dll_path = os.path.join(extra_dll_dir, dll_name)
+        def_path = os.path.join(output_dir, def_name)
+        lib_path = os.path.join(output_dir, lib_name)
+
+        if os.path.isfile(lib_path):
+            # Nothing to do
+            return lib_path, dll_path
+
+        if is_archive:
+            objects = (["-Wl,--whole-archive"] + list(objects) +
+                       ["-Wl,--no-whole-archive"])
+        self.link_shared_object(
+            objects,
+            dll_name,
+            output_dir=extra_dll_dir,
+            extra_postargs=list(chained_dlls) + [
+                '-Wl,--allow-multiple-definition',
+                '-Wl,--output-def,' + def_path,
+                '-Wl,--export-all-symbols',
+                '-Wl,--enable-auto-import',
+                '-static',
+                '-mlong-double-64',
+            ])
+
+        # No PowerPC!
+        if is_win64():
+            specifier = '/MACHINE:X64'
+        else:
+            specifier = '/MACHINE:X86'
+
+        # MSVC specific code
+        lib_args = ['/def:' + def_path, '/OUT:' + lib_path, specifier]
+        if not c_compiler.initialized:
+            c_compiler.initialize()
+        c_compiler.spawn([c_compiler.lib] + lib_args)
+
+        return lib_path, dll_path
+
+    def can_ccompiler_link(self, compiler):
+        # MSVC cannot link objects compiled by GNU fortran
+        return compiler.compiler_type not in ("msvc", )
+
+    def wrap_unlinkable_objects(self, objects, output_dir, extra_dll_dir):
+        """
+        Convert a set of object files that are not compatible with the default
+        linker, to a file that is compatible.
+        """
+        if self.c_compiler.compiler_type == "msvc":
+            # Compile a DLL and return the lib for the DLL as
+            # the object. Also keep track of previous DLLs that
+            # we have compiled so that we can link against them.
+
+            # If there are .a archives, assume they are self-contained
+            # static libraries, and build separate DLLs for each
+            archives = []
+            plain_objects = []
+            for obj in objects:
+                if obj.lower().endswith('.a'):
+                    archives.append(obj)
+                else:
+                    plain_objects.append(obj)
+
+            chained_libs = []
+            chained_dlls = []
+            for archive in archives[::-1]:
+                lib, dll = self._link_wrapper_lib(
+                    [archive],
+                    output_dir,
+                    extra_dll_dir,
+                    chained_dlls=chained_dlls,
+                    is_archive=True)
+                chained_libs.insert(0, lib)
+                chained_dlls.insert(0, dll)
+
+            if not plain_objects:
+                return chained_libs
+
+            lib, dll = self._link_wrapper_lib(
+                plain_objects,
+                output_dir,
+                extra_dll_dir,
+                chained_dlls=chained_dlls,
+                is_archive=False)
+            return [lib] + chained_libs
+        else:
+            raise ValueError("Unsupported C compiler")
+
+
+def _can_target(cmd, arch):
+    """Return true if the architecture supports the -arch flag"""
+    newcmd = cmd[:]
+    fid, filename = tempfile.mkstemp(suffix=".f")
+    os.close(fid)
+    try:
+        d = os.path.dirname(filename)
+        output = os.path.splitext(filename)[0] + ".o"
+        try:
+            newcmd.extend(["-arch", arch, "-c", filename])
+            p = Popen(newcmd, stderr=STDOUT, stdout=PIPE, cwd=d)
+            p.communicate()
+            return p.returncode == 0
+        finally:
+            if os.path.exists(output):
+                os.remove(output)
+    finally:
+        os.remove(filename)
+    return False
+
+
+if __name__ == '__main__':
+    from distutils import log
+    from numpy.distutils import customized_fcompiler
+    log.set_verbosity(2)
+
+    print(customized_fcompiler('gnu').get_version())
+    try:
+        print(customized_fcompiler('g95').get_version())
+    except Exception as e:
+        print(e)
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/hpux.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/hpux.py
new file mode 100644
index 000000000..09e6483bf
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/hpux.py
@@ -0,0 +1,41 @@
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['HPUXFCompiler']
+
+class HPUXFCompiler(FCompiler):
+
+    compiler_type = 'hpux'
+    description = 'HP Fortran 90 Compiler'
+    version_pattern =  r'HP F90 (?P<version>[^\s*,]*)'
+
+    executables = {
+        'version_cmd'  : ["f90", "+version"],
+        'compiler_f77' : ["f90"],
+        'compiler_fix' : ["f90"],
+        'compiler_f90' : ["f90"],
+        'linker_so'    : ["ld", "-b"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+    module_dir_switch = None #XXX: fix me
+    module_include_switch = None #XXX: fix me
+    pic_flags = ['+Z']
+    def get_flags(self):
+        return self.pic_flags + ['+ppu', '+DD64']
+    def get_flags_opt(self):
+        return ['-O3']
+    def get_libraries(self):
+        return ['m']
+    def get_library_dirs(self):
+        opt = ['/usr/lib/hpux64']
+        return opt
+    def get_version(self, force=0, ok_status=[256, 0, 1]):
+        # XXX status==256 may indicate 'unrecognized option' or
+        #     'no input file'. So, version_cmd needs more work.
+        return FCompiler.get_version(self, force, ok_status)
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(10)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='hpux').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/ibm.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/ibm.py
new file mode 100644
index 000000000..4a83682e5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/ibm.py
@@ -0,0 +1,97 @@
+import os
+import re
+import sys
+import subprocess
+
+from numpy.distutils.fcompiler import FCompiler
+from numpy.distutils.exec_command import find_executable
+from numpy.distutils.misc_util import make_temp_file
+from distutils import log
+
+compilers = ['IBMFCompiler']
+
+class IBMFCompiler(FCompiler):
+    compiler_type = 'ibm'
+    description = 'IBM XL Fortran Compiler'
+    version_pattern =  r'(xlf\(1\)\s*|)IBM XL Fortran ((Advanced Edition |)Version |Enterprise Edition V|for AIX, V)(?P<version>[^\s*]*)'
+    #IBM XL Fortran Enterprise Edition V10.1 for AIX \nVersion: 10.01.0000.0004
+
+    executables = {
+        'version_cmd'  : ["<F77>", "-qversion"],
+        'compiler_f77' : ["xlf"],
+        'compiler_fix' : ["xlf90", "-qfixed"],
+        'compiler_f90' : ["xlf90"],
+        'linker_so'    : ["xlf95"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    def get_version(self,*args,**kwds):
+        version = FCompiler.get_version(self,*args,**kwds)
+
+        if version is None and sys.platform.startswith('aix'):
+            # use lslpp to find out xlf version
+            lslpp = find_executable('lslpp')
+            xlf = find_executable('xlf')
+            if os.path.exists(xlf) and os.path.exists(lslpp):
+                try:
+                    o = subprocess.check_output([lslpp, '-Lc', 'xlfcmp'])
+                except (OSError, subprocess.CalledProcessError):
+                    pass
+                else:
+                    m = re.search(r'xlfcmp:(?P<version>\d+([.]\d+)+)', o)
+                    if m: version = m.group('version')
+
+        xlf_dir = '/etc/opt/ibmcmp/xlf'
+        if version is None and os.path.isdir(xlf_dir):
+            # linux:
+            # If the output of xlf does not contain version info
+            # (that's the case with xlf 8.1, for instance) then
+            # let's try another method:
+            l = sorted(os.listdir(xlf_dir))
+            l.reverse()
+            l = [d for d in l if os.path.isfile(os.path.join(xlf_dir, d, 'xlf.cfg'))]
+            if l:
+                from distutils.version import LooseVersion
+                self.version = version = LooseVersion(l[0])
+        return version
+
+    def get_flags(self):
+        return ['-qextname']
+
+    def get_flags_debug(self):
+        return ['-g']
+
+    def get_flags_linker_so(self):
+        opt = []
+        if sys.platform=='darwin':
+            opt.append('-Wl,-bundle,-flat_namespace,-undefined,suppress')
+        else:
+            opt.append('-bshared')
+        version = self.get_version(ok_status=[0, 40])
+        if version is not None:
+            if sys.platform.startswith('aix'):
+                xlf_cfg = '/etc/xlf.cfg'
+            else:
+                xlf_cfg = '/etc/opt/ibmcmp/xlf/%s/xlf.cfg' % version
+            fo, new_cfg = make_temp_file(suffix='_xlf.cfg')
+            log.info('Creating '+new_cfg)
+            with open(xlf_cfg, 'r') as fi:
+                crt1_match = re.compile(r'\s*crt\s*[=]\s*(?P<path>.*)/crt1.o').match
+                for line in fi:
+                    m = crt1_match(line)
+                    if m:
+                        fo.write('crt = %s/bundle1.o\n' % (m.group('path')))
+                    else:
+                        fo.write(line)
+            fo.close()
+            opt.append('-F'+new_cfg)
+        return opt
+
+    def get_flags_opt(self):
+        return ['-O3']
+
+if __name__ == '__main__':
+    from numpy.distutils import customized_fcompiler
+    log.set_verbosity(2)
+    print(customized_fcompiler(compiler='ibm').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/intel.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/intel.py
new file mode 100644
index 000000000..c7b3c2340
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/intel.py
@@ -0,0 +1,220 @@
+# http://developer.intel.com/software/products/compilers/flin/
+import sys
+
+from numpy.distutils.ccompiler import simple_version_match
+from numpy.distutils.fcompiler import FCompiler, dummy_fortran_file
+
+compilers = ['IntelFCompiler', 'IntelVisualFCompiler',
+             'IntelItaniumFCompiler', 'IntelItaniumVisualFCompiler',
+             'IntelEM64VisualFCompiler', 'IntelEM64TFCompiler']
+
+
+def intel_version_match(type):
+    # Match against the important stuff in the version string
+    return simple_version_match(start=r'Intel.*?Fortran.*?(?:%s).*?Version' % (type,))
+
+
+class BaseIntelFCompiler(FCompiler):
+    def update_executables(self):
+        f = dummy_fortran_file()
+        self.executables['version_cmd'] = ['<F77>', '-FI', '-V', '-c',
+                                           f + '.f', '-o', f + '.o']
+
+    def runtime_library_dir_option(self, dir):
+        # TODO: could use -Xlinker here, if it's supported
+        assert "," not in dir
+
+        return '-Wl,-rpath=%s' % dir
+
+
+class IntelFCompiler(BaseIntelFCompiler):
+
+    compiler_type = 'intel'
+    compiler_aliases = ('ifort',)
+    description = 'Intel Fortran Compiler for 32-bit apps'
+    version_match = intel_version_match('32-bit|IA-32')
+
+    possible_executables = ['ifort', 'ifc']
+
+    executables = {
+        'version_cmd'  : None,          # set by update_executables
+        'compiler_f77' : [None, "-72", "-w90", "-w95"],
+        'compiler_f90' : [None],
+        'compiler_fix' : [None, "-FI"],
+        'linker_so'    : ["<F90>", "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    pic_flags = ['-fPIC']
+    module_dir_switch = '-module '  # Don't remove ending space!
+    module_include_switch = '-I'
+
+    def get_flags_free(self):
+        return ['-FR']
+
+    def get_flags(self):
+        return ['-fPIC']
+
+    def get_flags_opt(self):  # Scipy test failures with -O2
+        v = self.get_version()
+        mpopt = 'openmp' if v and v < '15' else 'qopenmp'
+        return ['-fp-model', 'strict', '-O1', '-{}'.format(mpopt)]
+
+    def get_flags_arch(self):
+        return []
+
+    def get_flags_linker_so(self):
+        opt = FCompiler.get_flags_linker_so(self)
+        v = self.get_version()
+        if v and v >= '8.0':
+            opt.append('-nofor_main')
+        if sys.platform == 'darwin':
+            # Here, it's -dynamiclib
+            try:
+                idx = opt.index('-shared')
+                opt.remove('-shared')
+            except ValueError:
+                idx = 0
+            opt[idx:idx] = ['-dynamiclib', '-Wl,-undefined,dynamic_lookup']
+        return opt
+
+
+class IntelItaniumFCompiler(IntelFCompiler):
+    compiler_type = 'intele'
+    compiler_aliases = ()
+    description = 'Intel Fortran Compiler for Itanium apps'
+
+    version_match = intel_version_match('Itanium|IA-64')
+
+    possible_executables = ['ifort', 'efort', 'efc']
+
+    executables = {
+        'version_cmd'  : None,
+        'compiler_f77' : [None, "-FI", "-w90", "-w95"],
+        'compiler_fix' : [None, "-FI"],
+        'compiler_f90' : [None],
+        'linker_so'    : ['<F90>', "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+
+class IntelEM64TFCompiler(IntelFCompiler):
+    compiler_type = 'intelem'
+    compiler_aliases = ()
+    description = 'Intel Fortran Compiler for 64-bit apps'
+
+    version_match = intel_version_match('EM64T-based|Intel\\(R\\) 64|64|IA-64|64-bit')
+
+    possible_executables = ['ifort', 'efort', 'efc']
+
+    executables = {
+        'version_cmd'  : None,
+        'compiler_f77' : [None, "-FI"],
+        'compiler_fix' : [None, "-FI"],
+        'compiler_f90' : [None],
+        'linker_so'    : ['<F90>', "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    def get_flags(self):
+        return ['-fPIC']
+
+    def get_flags_opt(self):  # Scipy test failures with -O2
+        v = self.get_version()
+        mpopt = 'openmp' if v and v < '15' else 'qopenmp'
+        return ['-fp-model', 'strict', '-O1', '-{}'.format(mpopt)]
+
+    def get_flags_arch(self):
+        return []
+
+# Is there no difference in the version string between the above compilers
+# and the Visual compilers?
+
+
+class IntelVisualFCompiler(BaseIntelFCompiler):
+    compiler_type = 'intelv'
+    description = 'Intel Visual Fortran Compiler for 32-bit apps'
+    version_match = intel_version_match('32-bit|IA-32')
+
+    def update_executables(self):
+        f = dummy_fortran_file()
+        self.executables['version_cmd'] = ['<F77>', '/FI', '/c',
+                                           f + '.f', '/o', f + '.o']
+
+    ar_exe = 'lib.exe'
+    possible_executables = ['ifort', 'ifl']
+
+    executables = {
+        'version_cmd'  : None,
+        'compiler_f77' : [None],
+        'compiler_fix' : [None],
+        'compiler_f90' : [None],
+        'linker_so'    : [None],
+        'archiver'     : [ar_exe, "/verbose", "/OUT:"],
+        'ranlib'       : None
+        }
+
+    compile_switch = '/c '
+    object_switch = '/Fo'     # No space after /Fo!
+    library_switch = '/OUT:'  # No space after /OUT:!
+    module_dir_switch = '/module:'  # No space after /module:
+    module_include_switch = '/I'
+
+    def get_flags(self):
+        opt = ['/nologo', '/MD', '/nbs', '/names:lowercase', '/assume:underscore']
+        return opt
+
+    def get_flags_free(self):
+        return []
+
+    def get_flags_debug(self):
+        return ['/4Yb', '/d2']
+
+    def get_flags_opt(self):
+        return ['/O1']  # Scipy test failures with /O2
+
+    def get_flags_arch(self):
+        return ["/arch:IA32", "/QaxSSE3"]
+
+    def runtime_library_dir_option(self, dir):
+        raise NotImplementedError
+
+
+class IntelItaniumVisualFCompiler(IntelVisualFCompiler):
+    compiler_type = 'intelev'
+    description = 'Intel Visual Fortran Compiler for Itanium apps'
+
+    version_match = intel_version_match('Itanium')
+
+    possible_executables = ['efl']  # XXX this is a wild guess
+    ar_exe = IntelVisualFCompiler.ar_exe
+
+    executables = {
+        'version_cmd'  : None,
+        'compiler_f77' : [None, "-FI", "-w90", "-w95"],
+        'compiler_fix' : [None, "-FI", "-4L72", "-w"],
+        'compiler_f90' : [None],
+        'linker_so'    : ['<F90>', "-shared"],
+        'archiver'     : [ar_exe, "/verbose", "/OUT:"],
+        'ranlib'       : None
+        }
+
+
+class IntelEM64VisualFCompiler(IntelVisualFCompiler):
+    compiler_type = 'intelvem'
+    description = 'Intel Visual Fortran Compiler for 64-bit apps'
+
+    version_match = simple_version_match(start=r'Intel\(R\).*?64,')
+
+    def get_flags_arch(self):
+        return []
+
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='intel').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/lahey.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/lahey.py
new file mode 100644
index 000000000..e92583826
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/lahey.py
@@ -0,0 +1,45 @@
+import os
+
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['LaheyFCompiler']
+
+class LaheyFCompiler(FCompiler):
+
+    compiler_type = 'lahey'
+    description = 'Lahey/Fujitsu Fortran 95 Compiler'
+    version_pattern =  r'Lahey/Fujitsu Fortran 95 Compiler Release (?P<version>[^\s*]*)'
+
+    executables = {
+        'version_cmd'  : ["<F90>", "--version"],
+        'compiler_f77' : ["lf95", "--fix"],
+        'compiler_fix' : ["lf95", "--fix"],
+        'compiler_f90' : ["lf95"],
+        'linker_so'    : ["lf95", "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    module_dir_switch = None  #XXX Fix me
+    module_include_switch = None #XXX Fix me
+
+    def get_flags_opt(self):
+        return ['-O']
+    def get_flags_debug(self):
+        return ['-g', '--chk', '--chkglobal']
+    def get_library_dirs(self):
+        opt = []
+        d = os.environ.get('LAHEY')
+        if d:
+            opt.append(os.path.join(d, 'lib'))
+        return opt
+    def get_libraries(self):
+        opt = []
+        opt.extend(['fj9f6', 'fj9i6', 'fj9ipp', 'fj9e6'])
+        return opt
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='lahey').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/mips.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/mips.py
new file mode 100644
index 000000000..a09738045
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/mips.py
@@ -0,0 +1,54 @@
+from numpy.distutils.cpuinfo import cpu
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['MIPSFCompiler']
+
+class MIPSFCompiler(FCompiler):
+
+    compiler_type = 'mips'
+    description = 'MIPSpro Fortran Compiler'
+    version_pattern =  r'MIPSpro Compilers: Version (?P<version>[^\s*,]*)'
+
+    executables = {
+        'version_cmd'  : ["<F90>", "-version"],
+        'compiler_f77' : ["f77", "-f77"],
+        'compiler_fix' : ["f90", "-fixedform"],
+        'compiler_f90' : ["f90"],
+        'linker_so'    : ["f90", "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : None
+        }
+    module_dir_switch = None #XXX: fix me
+    module_include_switch = None #XXX: fix me
+    pic_flags = ['-KPIC']
+
+    def get_flags(self):
+        return self.pic_flags + ['-n32']
+    def get_flags_opt(self):
+        return ['-O3']
+    def get_flags_arch(self):
+        opt = []
+        for a in '19 20 21 22_4k 22_5k 24 25 26 27 28 30 32_5k 32_10k'.split():
+            if getattr(cpu, 'is_IP%s'%a)():
+                opt.append('-TARG:platform=IP%s' % a)
+                break
+        return opt
+    def get_flags_arch_f77(self):
+        r = None
+        if cpu.is_r10000(): r = 10000
+        elif cpu.is_r12000(): r = 12000
+        elif cpu.is_r8000(): r = 8000
+        elif cpu.is_r5000(): r = 5000
+        elif cpu.is_r4000(): r = 4000
+        if r is not None:
+            return ['r%s' % (r)]
+        return []
+    def get_flags_arch_f90(self):
+        r = self.get_flags_arch_f77()
+        if r:
+            r[0] = '-' + r[0]
+        return r
+
+if __name__ == '__main__':
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='mips').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/nag.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/nag.py
new file mode 100644
index 000000000..908e724e6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/nag.py
@@ -0,0 +1,82 @@
+import sys
+import re
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['NAGFCompiler', 'NAGFORCompiler']
+
+class BaseNAGFCompiler(FCompiler):
+    version_pattern = r'NAG.* Release (?P<version>[^(\s]*)'
+
+    def version_match(self, version_string):
+        m = re.search(self.version_pattern, version_string)
+        if m:
+            return m.group('version')
+        else:
+            return None
+
+    def get_flags_linker_so(self):
+        return ["-Wl,-shared"]
+    def get_flags_opt(self):
+        return ['-O4']
+    def get_flags_arch(self):
+        return ['']
+
+class NAGFCompiler(BaseNAGFCompiler):
+
+    compiler_type = 'nag'
+    description = 'NAGWare Fortran 95 Compiler'
+
+    executables = {
+        'version_cmd'  : ["<F90>", "-V"],
+        'compiler_f77' : ["f95", "-fixed"],
+        'compiler_fix' : ["f95", "-fixed"],
+        'compiler_f90' : ["f95"],
+        'linker_so'    : ["<F90>"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    def get_flags_linker_so(self):
+        if sys.platform == 'darwin':
+            return ['-unsharedf95', '-Wl,-bundle,-flat_namespace,-undefined,suppress']
+        return BaseNAGFCompiler.get_flags_linker_so(self)
+    def get_flags_arch(self):
+        version = self.get_version()
+        if version and version < '5.1':
+            return ['-target=native']
+        else:
+            return BaseNAGFCompiler.get_flags_arch(self)
+    def get_flags_debug(self):
+        return ['-g', '-gline', '-g90', '-nan', '-C']
+
+class NAGFORCompiler(BaseNAGFCompiler):
+
+    compiler_type = 'nagfor'
+    description = 'NAG Fortran Compiler'
+
+    executables = {
+        'version_cmd'  : ["nagfor", "-V"],
+        'compiler_f77' : ["nagfor", "-fixed"],
+        'compiler_fix' : ["nagfor", "-fixed"],
+        'compiler_f90' : ["nagfor"],
+        'linker_so'    : ["nagfor"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+
+    def get_flags_debug(self):
+        version = self.get_version()
+        if version and version > '6.1':
+            return ['-g', '-u', '-nan', '-C=all', '-thread_safe',
+                    '-kind=unique', '-Warn=allocation', '-Warn=subnormal']
+        else:
+            return ['-g', '-nan', '-C=all', '-u', '-thread_safe']
+
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    compiler = customized_fcompiler(compiler='nagfor')
+    print(compiler.get_version())
+    print(compiler.get_flags_debug())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/none.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/none.py
new file mode 100644
index 000000000..ef411fffc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/none.py
@@ -0,0 +1,28 @@
+from numpy.distutils.fcompiler import FCompiler
+from numpy.distutils import customized_fcompiler
+
+compilers = ['NoneFCompiler']
+
+class NoneFCompiler(FCompiler):
+
+    compiler_type = 'none'
+    description = 'Fake Fortran compiler'
+
+    executables = {'compiler_f77': None,
+                   'compiler_f90': None,
+                   'compiler_fix': None,
+                   'linker_so': None,
+                   'linker_exe': None,
+                   'archiver': None,
+                   'ranlib': None,
+                   'version_cmd': None,
+                   }
+
+    def find_executables(self):
+        pass
+
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    print(customized_fcompiler(compiler='none').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/pathf95.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/pathf95.py
new file mode 100644
index 000000000..0768cb12e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/pathf95.py
@@ -0,0 +1,33 @@
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['PathScaleFCompiler']
+
+class PathScaleFCompiler(FCompiler):
+
+    compiler_type = 'pathf95'
+    description = 'PathScale Fortran Compiler'
+    version_pattern =  r'PathScale\(TM\) Compiler Suite: Version (?P<version>[\d.]+)'
+
+    executables = {
+        'version_cmd'  : ["pathf95", "-version"],
+        'compiler_f77' : ["pathf95", "-fixedform"],
+        'compiler_fix' : ["pathf95", "-fixedform"],
+        'compiler_f90' : ["pathf95"],
+        'linker_so'    : ["pathf95", "-shared"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+    }
+    pic_flags = ['-fPIC']
+    module_dir_switch = '-module ' # Don't remove ending space!
+    module_include_switch = '-I'
+
+    def get_flags_opt(self):
+        return ['-O3']
+    def get_flags_debug(self):
+        return ['-g']
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='pathf95').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/pg.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/pg.py
new file mode 100644
index 000000000..eb628cb63
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/pg.py
@@ -0,0 +1,128 @@
+# http://www.pgroup.com
+import sys
+
+from numpy.distutils.fcompiler import FCompiler
+from sys import platform
+from os.path import join, dirname, normpath
+
+compilers = ['PGroupFCompiler', 'PGroupFlangCompiler']
+
+
+class PGroupFCompiler(FCompiler):
+
+    compiler_type = 'pg'
+    description = 'Portland Group Fortran Compiler'
+    version_pattern = r'\s*pg(f77|f90|hpf|fortran) (?P<version>[\d.-]+).*'
+
+    if platform == 'darwin':
+        executables = {
+            'version_cmd': ["<F77>", "-V"],
+            'compiler_f77': ["pgfortran", "-dynamiclib"],
+            'compiler_fix': ["pgfortran", "-Mfixed", "-dynamiclib"],
+            'compiler_f90': ["pgfortran", "-dynamiclib"],
+            'linker_so': ["libtool"],
+            'archiver': ["ar", "-cr"],
+            'ranlib': ["ranlib"]
+        }
+        pic_flags = ['']
+    else:
+        executables = {
+            'version_cmd': ["<F77>", "-V"],
+            'compiler_f77': ["pgfortran"],
+            'compiler_fix': ["pgfortran", "-Mfixed"],
+            'compiler_f90': ["pgfortran"],
+            'linker_so': ["pgfortran"],
+            'archiver': ["ar", "-cr"],
+            'ranlib': ["ranlib"]
+        }
+        pic_flags = ['-fpic']
+
+    module_dir_switch = '-module '
+    module_include_switch = '-I'
+
+    def get_flags(self):
+        opt = ['-Minform=inform', '-Mnosecond_underscore']
+        return self.pic_flags + opt
+
+    def get_flags_opt(self):
+        return ['-fast']
+
+    def get_flags_debug(self):
+        return ['-g']
+
+    if platform == 'darwin':
+        def get_flags_linker_so(self):
+            return ["-dynamic", '-undefined', 'dynamic_lookup']
+
+    else:
+        def get_flags_linker_so(self):
+            return ["-shared", '-fpic']
+
+    def runtime_library_dir_option(self, dir):
+        return '-R%s' % dir
+
+
+import functools
+
+class PGroupFlangCompiler(FCompiler):
+    compiler_type = 'flang'
+    description = 'Portland Group Fortran LLVM Compiler'
+    version_pattern = r'\s*(flang|clang) version (?P<version>[\d.-]+).*'
+
+    ar_exe = 'lib.exe'
+    possible_executables = ['flang']
+
+    executables = {
+        'version_cmd': ["<F77>", "--version"],
+        'compiler_f77': ["flang"],
+        'compiler_fix': ["flang"],
+        'compiler_f90': ["flang"],
+        'linker_so': [None],
+        'archiver': [ar_exe, "/verbose", "/OUT:"],
+        'ranlib': None
+    }
+
+    library_switch = '/OUT:'  # No space after /OUT:!
+    module_dir_switch = '-module '  # Don't remove ending space!
+
+    def get_libraries(self):
+        opt = FCompiler.get_libraries(self)
+        opt.extend(['flang', 'flangrti', 'ompstub'])
+        return opt
+
+    @functools.lru_cache(maxsize=128)
+    def get_library_dirs(self):
+        """List of compiler library directories."""
+        opt = FCompiler.get_library_dirs(self)
+        flang_dir = dirname(self.executables['compiler_f77'][0])
+        opt.append(normpath(join(flang_dir, '..', 'lib')))
+
+        return opt
+
+    def get_flags(self):
+        return []
+
+    def get_flags_free(self):
+        return []
+
+    def get_flags_debug(self):
+        return ['-g']
+
+    def get_flags_opt(self):
+        return ['-O3']
+
+    def get_flags_arch(self):
+        return []
+
+    def runtime_library_dir_option(self, dir):
+        raise NotImplementedError
+
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    if 'flang' in sys.argv:
+        print(customized_fcompiler(compiler='flang').get_version())
+    else:
+        print(customized_fcompiler(compiler='pg').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/sun.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/sun.py
new file mode 100644
index 000000000..d039f0b25
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/sun.py
@@ -0,0 +1,51 @@
+from numpy.distutils.ccompiler import simple_version_match
+from numpy.distutils.fcompiler import FCompiler
+
+compilers = ['SunFCompiler']
+
+class SunFCompiler(FCompiler):
+
+    compiler_type = 'sun'
+    description = 'Sun or Forte Fortran 95 Compiler'
+    # ex:
+    # f90: Sun WorkShop 6 update 2 Fortran 95 6.2 Patch 111690-10 2003/08/28
+    version_match = simple_version_match(
+                      start=r'f9[05]: (Sun|Forte|WorkShop).*Fortran 95')
+
+    executables = {
+        'version_cmd'  : ["<F90>", "-V"],
+        'compiler_f77' : ["f90"],
+        'compiler_fix' : ["f90", "-fixed"],
+        'compiler_f90' : ["f90"],
+        'linker_so'    : ["<F90>", "-Bdynamic", "-G"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+    module_dir_switch = '-moddir='
+    module_include_switch = '-M'
+    pic_flags = ['-xcode=pic32']
+
+    def get_flags_f77(self):
+        ret = ["-ftrap=%none"]
+        if (self.get_version() or '') >= '7':
+            ret.append("-f77")
+        else:
+            ret.append("-fixed")
+        return ret
+    def get_opt(self):
+        return ['-fast', '-dalign']
+    def get_arch(self):
+        return ['-xtarget=generic']
+    def get_libraries(self):
+        opt = []
+        opt.extend(['fsu', 'sunmath', 'mvec'])
+        return opt
+
+    def runtime_library_dir_option(self, dir):
+        return '-R%s' % dir
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='sun').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/fcompiler/vast.py b/venv/Lib/site-packages/numpy/distutils/fcompiler/vast.py
new file mode 100644
index 000000000..92a1647ba
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/fcompiler/vast.py
@@ -0,0 +1,52 @@
+import os
+
+from numpy.distutils.fcompiler.gnu import GnuFCompiler
+
+compilers = ['VastFCompiler']
+
+class VastFCompiler(GnuFCompiler):
+    compiler_type = 'vast'
+    compiler_aliases = ()
+    description = 'Pacific-Sierra Research Fortran 90 Compiler'
+    version_pattern = (r'\s*Pacific-Sierra Research vf90 '
+                       r'(Personal|Professional)\s+(?P<version>[^\s]*)')
+
+    # VAST f90 does not support -o with -c. So, object files are created
+    # to the current directory and then moved to build directory
+    object_switch = ' && function _mvfile { mv -v `basename $1` $1 ; } && _mvfile '
+
+    executables = {
+        'version_cmd'  : ["vf90", "-v"],
+        'compiler_f77' : ["g77"],
+        'compiler_fix' : ["f90", "-Wv,-ya"],
+        'compiler_f90' : ["f90"],
+        'linker_so'    : ["<F90>"],
+        'archiver'     : ["ar", "-cr"],
+        'ranlib'       : ["ranlib"]
+        }
+    module_dir_switch = None  #XXX Fix me
+    module_include_switch = None #XXX Fix me
+
+    def find_executables(self):
+        pass
+
+    def get_version_cmd(self):
+        f90 = self.compiler_f90[0]
+        d, b = os.path.split(f90)
+        vf90 = os.path.join(d, 'v'+b)
+        return vf90
+
+    def get_flags_arch(self):
+        vast_version = self.get_version()
+        gnu = GnuFCompiler()
+        gnu.customize(None)
+        self.version = gnu.get_version()
+        opt = GnuFCompiler.get_flags_arch(self)
+        self.version = vast_version
+        return opt
+
+if __name__ == '__main__':
+    from distutils import log
+    log.set_verbosity(2)
+    from numpy.distutils import customized_fcompiler
+    print(customized_fcompiler(compiler='vast').get_version())
diff --git a/venv/Lib/site-packages/numpy/distutils/from_template.py b/venv/Lib/site-packages/numpy/distutils/from_template.py
new file mode 100644
index 000000000..070b7d8b8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/from_template.py
@@ -0,0 +1,262 @@
+#!/usr/bin/env python3
+"""
+
+process_file(filename)
+
+  takes templated file .xxx.src and produces .xxx file where .xxx
+  is .pyf .f90 or .f using the following template rules:
+
+  '<..>' denotes a template.
+
+  All function and subroutine blocks in a source file with names that
+  contain '<..>' will be replicated according to the rules in '<..>'.
+
+  The number of comma-separated words in '<..>' will determine the number of
+  replicates.
+
+  '<..>' may have two different forms, named and short. For example,
+
+  named:
+   <p=d,s,z,c> where anywhere inside a block '<p>' will be replaced with
+   'd', 's', 'z', and 'c' for each replicate of the block.
+
+   <_c>  is already defined: <_c=s,d,c,z>
+   <_t>  is already defined: <_t=real,double precision,complex,double complex>
+
+  short:
+   <s,d,c,z>, a short form of the named, useful when no <p> appears inside
+   a block.
+
+  In general, '<..>' contains a comma separated list of arbitrary
+  expressions. If these expression must contain a comma|leftarrow|rightarrow,
+  then prepend the comma|leftarrow|rightarrow with a backslash.
+
+  If an expression matches '\\<index>' then it will be replaced
+  by <index>-th expression.
+
+  Note that all '<..>' forms in a block must have the same number of
+  comma-separated entries.
+
+ Predefined named template rules:
+  <prefix=s,d,c,z>
+  <ftype=real,double precision,complex,double complex>
+  <ftypereal=real,double precision,\\0,\\1>
+  <ctype=float,double,complex_float,complex_double>
+  <ctypereal=float,double,\\0,\\1>
+
+"""
+__all__ = ['process_str', 'process_file']
+
+import os
+import sys
+import re
+
+routine_start_re = re.compile(r'(\n|\A)((     (\$|\*))|)\s*(subroutine|function)\b', re.I)
+routine_end_re = re.compile(r'\n\s*end\s*(subroutine|function)\b.*(\n|\Z)', re.I)
+function_start_re = re.compile(r'\n     (\$|\*)\s*function\b', re.I)
+
+def parse_structure(astr):
+    """ Return a list of tuples for each function or subroutine each
+    tuple is the start and end of a subroutine or function to be
+    expanded.
+    """
+
+    spanlist = []
+    ind = 0
+    while True:
+        m = routine_start_re.search(astr, ind)
+        if m is None:
+            break
+        start = m.start()
+        if function_start_re.match(astr, start, m.end()):
+            while True:
+                i = astr.rfind('\n', ind, start)
+                if i==-1:
+                    break
+                start = i
+                if astr[i:i+7]!='\n     $':
+                    break
+        start += 1
+        m = routine_end_re.search(astr, m.end())
+        ind = end = m and m.end()-1 or len(astr)
+        spanlist.append((start, end))
+    return spanlist
+
+template_re = re.compile(r"<\s*(\w[\w\d]*)\s*>")
+named_re = re.compile(r"<\s*(\w[\w\d]*)\s*=\s*(.*?)\s*>")
+list_re = re.compile(r"<\s*((.*?))\s*>")
+
+def find_repl_patterns(astr):
+    reps = named_re.findall(astr)
+    names = {}
+    for rep in reps:
+        name = rep[0].strip() or unique_key(names)
+        repl = rep[1].replace(r'\,', '@comma@')
+        thelist = conv(repl)
+        names[name] = thelist
+    return names
+
+def find_and_remove_repl_patterns(astr):
+    names = find_repl_patterns(astr)
+    astr = re.subn(named_re, '', astr)[0]
+    return astr, names
+
+item_re = re.compile(r"\A\\(?P<index>\d+)\Z")
+def conv(astr):
+    b = astr.split(',')
+    l = [x.strip() for x in b]
+    for i in range(len(l)):
+        m = item_re.match(l[i])
+        if m:
+            j = int(m.group('index'))
+            l[i] = l[j]
+    return ','.join(l)
+
+def unique_key(adict):
+    """ Obtain a unique key given a dictionary."""
+    allkeys = list(adict.keys())
+    done = False
+    n = 1
+    while not done:
+        newkey = '__l%s' % (n)
+        if newkey in allkeys:
+            n += 1
+        else:
+            done = True
+    return newkey
+
+
+template_name_re = re.compile(r'\A\s*(\w[\w\d]*)\s*\Z')
+def expand_sub(substr, names):
+    substr = substr.replace(r'\>', '@rightarrow@')
+    substr = substr.replace(r'\<', '@leftarrow@')
+    lnames = find_repl_patterns(substr)
+    substr = named_re.sub(r"<\1>", substr)  # get rid of definition templates
+
+    def listrepl(mobj):
+        thelist = conv(mobj.group(1).replace(r'\,', '@comma@'))
+        if template_name_re.match(thelist):
+            return "<%s>" % (thelist)
+        name = None
+        for key in lnames.keys():    # see if list is already in dictionary
+            if lnames[key] == thelist:
+                name = key
+        if name is None:      # this list is not in the dictionary yet
+            name = unique_key(lnames)
+            lnames[name] = thelist
+        return "<%s>" % name
+
+    substr = list_re.sub(listrepl, substr) # convert all lists to named templates
+                                           # newnames are constructed as needed
+
+    numsubs = None
+    base_rule = None
+    rules = {}
+    for r in template_re.findall(substr):
+        if r not in rules:
+            thelist = lnames.get(r, names.get(r, None))
+            if thelist is None:
+                raise ValueError('No replicates found for <%s>' % (r))
+            if r not in names and not thelist.startswith('_'):
+                names[r] = thelist
+            rule = [i.replace('@comma@', ',') for i in thelist.split(',')]
+            num = len(rule)
+
+            if numsubs is None:
+                numsubs = num
+                rules[r] = rule
+                base_rule = r
+            elif num == numsubs:
+                rules[r] = rule
+            else:
+                print("Mismatch in number of replacements (base <%s=%s>)"
+                      " for <%s=%s>. Ignoring." %
+                      (base_rule, ','.join(rules[base_rule]), r, thelist))
+    if not rules:
+        return substr
+
+    def namerepl(mobj):
+        name = mobj.group(1)
+        return rules.get(name, (k+1)*[name])[k]
+
+    newstr = ''
+    for k in range(numsubs):
+        newstr += template_re.sub(namerepl, substr) + '\n\n'
+
+    newstr = newstr.replace('@rightarrow@', '>')
+    newstr = newstr.replace('@leftarrow@', '<')
+    return newstr
+
+def process_str(allstr):
+    newstr = allstr
+    writestr = ''
+
+    struct = parse_structure(newstr)
+
+    oldend = 0
+    names = {}
+    names.update(_special_names)
+    for sub in struct:
+        cleanedstr, defs = find_and_remove_repl_patterns(newstr[oldend:sub[0]])
+        writestr += cleanedstr
+        names.update(defs)
+        writestr += expand_sub(newstr[sub[0]:sub[1]], names)
+        oldend =  sub[1]
+    writestr += newstr[oldend:]
+
+    return writestr
+
+include_src_re = re.compile(r"(\n|\A)\s*include\s*['\"](?P<name>[\w\d./\\]+[.]src)['\"]", re.I)
+
+def resolve_includes(source):
+    d = os.path.dirname(source)
+    with open(source) as fid:
+        lines = []
+        for line in fid:
+            m = include_src_re.match(line)
+            if m:
+                fn = m.group('name')
+                if not os.path.isabs(fn):
+                    fn = os.path.join(d, fn)
+                if os.path.isfile(fn):
+                    print('Including file', fn)
+                    lines.extend(resolve_includes(fn))
+                else:
+                    lines.append(line)
+            else:
+                lines.append(line)
+    return lines
+
+def process_file(source):
+    lines = resolve_includes(source)
+    return process_str(''.join(lines))
+
+_special_names = find_repl_patterns('''
+<_c=s,d,c,z>
+<_t=real,double precision,complex,double complex>
+<prefix=s,d,c,z>
+<ftype=real,double precision,complex,double complex>
+<ctype=float,double,complex_float,complex_double>
+<ftypereal=real,double precision,\\0,\\1>
+<ctypereal=float,double,\\0,\\1>
+''')
+
+def main():
+    try:
+        file = sys.argv[1]
+    except IndexError:
+        fid = sys.stdin
+        outfile = sys.stdout
+    else:
+        fid = open(file, 'r')
+        (base, ext) = os.path.splitext(file)
+        newname = base
+        outfile = open(newname, 'w')
+
+    allstr = fid.read()
+    writestr = process_str(allstr)
+    outfile.write(writestr)
+
+
+if __name__ == "__main__":
+    main()
diff --git a/venv/Lib/site-packages/numpy/distutils/intelccompiler.py b/venv/Lib/site-packages/numpy/distutils/intelccompiler.py
new file mode 100644
index 000000000..0388ad577
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/intelccompiler.py
@@ -0,0 +1,111 @@
+import platform
+
+from distutils.unixccompiler import UnixCCompiler
+from numpy.distutils.exec_command import find_executable
+from numpy.distutils.ccompiler import simple_version_match
+if platform.system() == 'Windows':
+    from numpy.distutils.msvc9compiler import MSVCCompiler
+
+
+class IntelCCompiler(UnixCCompiler):
+    """A modified Intel compiler compatible with a GCC-built Python."""
+    compiler_type = 'intel'
+    cc_exe = 'icc'
+    cc_args = 'fPIC'
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        UnixCCompiler.__init__(self, verbose, dry_run, force)
+
+        v = self.get_version()
+        mpopt = 'openmp' if v and v < '15' else 'qopenmp'
+        self.cc_exe = ('icc -fPIC -fp-model strict -O3 '
+                       '-fomit-frame-pointer -{}').format(mpopt)
+        compiler = self.cc_exe
+
+        if platform.system() == 'Darwin':
+            shared_flag = '-Wl,-undefined,dynamic_lookup'
+        else:
+            shared_flag = '-shared'
+        self.set_executables(compiler=compiler,
+                             compiler_so=compiler,
+                             compiler_cxx=compiler,
+                             archiver='xiar' + ' cru',
+                             linker_exe=compiler + ' -shared-intel',
+                             linker_so=compiler + ' ' + shared_flag +
+                             ' -shared-intel')
+
+
+class IntelItaniumCCompiler(IntelCCompiler):
+    compiler_type = 'intele'
+
+    # On Itanium, the Intel Compiler used to be called ecc, let's search for
+    # it (now it's also icc, so ecc is last in the search).
+    for cc_exe in map(find_executable, ['icc', 'ecc']):
+        if cc_exe:
+            break
+
+
+class IntelEM64TCCompiler(UnixCCompiler):
+    """
+    A modified Intel x86_64 compiler compatible with a 64bit GCC-built Python.
+    """
+    compiler_type = 'intelem'
+    cc_exe = 'icc -m64'
+    cc_args = '-fPIC'
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        UnixCCompiler.__init__(self, verbose, dry_run, force)
+
+        v = self.get_version()
+        mpopt = 'openmp' if v and v < '15' else 'qopenmp'
+        self.cc_exe = ('icc -m64 -fPIC -fp-model strict -O3 '
+                       '-fomit-frame-pointer -{}').format(mpopt)
+        compiler = self.cc_exe
+
+        if platform.system() == 'Darwin':
+            shared_flag = '-Wl,-undefined,dynamic_lookup'
+        else:
+            shared_flag = '-shared'
+        self.set_executables(compiler=compiler,
+                             compiler_so=compiler,
+                             compiler_cxx=compiler,
+                             archiver='xiar' + ' cru',
+                             linker_exe=compiler + ' -shared-intel',
+                             linker_so=compiler + ' ' + shared_flag +
+                             ' -shared-intel')
+
+
+if platform.system() == 'Windows':
+    class IntelCCompilerW(MSVCCompiler):
+        """
+        A modified Intel compiler compatible with an MSVC-built Python.
+        """
+        compiler_type = 'intelw'
+        compiler_cxx = 'icl'
+
+        def __init__(self, verbose=0, dry_run=0, force=0):
+            MSVCCompiler.__init__(self, verbose, dry_run, force)
+            version_match = simple_version_match(start=r'Intel\(R\).*?32,')
+            self.__version = version_match
+
+        def initialize(self, plat_name=None):
+            MSVCCompiler.initialize(self, plat_name)
+            self.cc = self.find_exe('icl.exe')
+            self.lib = self.find_exe('xilib')
+            self.linker = self.find_exe('xilink')
+            self.compile_options = ['/nologo', '/O3', '/MD', '/W3',
+                                    '/Qstd=c99']
+            self.compile_options_debug = ['/nologo', '/Od', '/MDd', '/W3',
+                                          '/Qstd=c99', '/Z7', '/D_DEBUG']
+
+    class IntelEM64TCCompilerW(IntelCCompilerW):
+        """
+        A modified Intel x86_64 compiler compatible with
+        a 64bit MSVC-built Python.
+        """
+        compiler_type = 'intelemw'
+
+        def __init__(self, verbose=0, dry_run=0, force=0):
+            MSVCCompiler.__init__(self, verbose, dry_run, force)
+            version_match = simple_version_match(start=r'Intel\(R\).*?64,')
+            self.__version = version_match
diff --git a/venv/Lib/site-packages/numpy/distutils/lib2def.py b/venv/Lib/site-packages/numpy/distutils/lib2def.py
new file mode 100644
index 000000000..820ed71f5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/lib2def.py
@@ -0,0 +1,116 @@
+import re
+import sys
+import subprocess
+
+__doc__ = """This module generates a DEF file from the symbols in
+an MSVC-compiled DLL import library.  It correctly discriminates between
+data and functions.  The data is collected from the output of the program
+nm(1).
+
+Usage:
+    python lib2def.py [libname.lib] [output.def]
+or
+    python lib2def.py [libname.lib] > output.def
+
+libname.lib defaults to python<py_ver>.lib and output.def defaults to stdout
+
+Author: Robert Kern <kernr@mail.ncifcrf.gov>
+Last Update: April 30, 1999
+"""
+
+__version__ = '0.1a'
+
+py_ver = "%d%d" % tuple(sys.version_info[:2])
+
+DEFAULT_NM = ['nm', '-Cs']
+
+DEF_HEADER = """LIBRARY         python%s.dll
+;CODE           PRELOAD MOVEABLE DISCARDABLE
+;DATA           PRELOAD SINGLE
+
+EXPORTS
+""" % py_ver
+# the header of the DEF file
+
+FUNC_RE = re.compile(r"^(.*) in python%s\.dll" % py_ver, re.MULTILINE)
+DATA_RE = re.compile(r"^_imp__(.*) in python%s\.dll" % py_ver, re.MULTILINE)
+
+def parse_cmd():
+    """Parses the command-line arguments.
+
+libfile, deffile = parse_cmd()"""
+    if len(sys.argv) == 3:
+        if sys.argv[1][-4:] == '.lib' and sys.argv[2][-4:] == '.def':
+            libfile, deffile = sys.argv[1:]
+        elif sys.argv[1][-4:] == '.def' and sys.argv[2][-4:] == '.lib':
+            deffile, libfile = sys.argv[1:]
+        else:
+            print("I'm assuming that your first argument is the library")
+            print("and the second is the DEF file.")
+    elif len(sys.argv) == 2:
+        if sys.argv[1][-4:] == '.def':
+            deffile = sys.argv[1]
+            libfile = 'python%s.lib' % py_ver
+        elif sys.argv[1][-4:] == '.lib':
+            deffile = None
+            libfile = sys.argv[1]
+    else:
+        libfile = 'python%s.lib' % py_ver
+        deffile = None
+    return libfile, deffile
+
+def getnm(nm_cmd=['nm', '-Cs', 'python%s.lib' % py_ver], shell=True):
+    """Returns the output of nm_cmd via a pipe.
+
+nm_output = getnm(nm_cmd = 'nm -Cs py_lib')"""
+    p = subprocess.Popen(nm_cmd, shell=shell, stdout=subprocess.PIPE,
+                         stderr=subprocess.PIPE, universal_newlines=True)
+    nm_output, nm_err = p.communicate()
+    if p.returncode != 0:
+        raise RuntimeError('failed to run "%s": "%s"' % (
+                                     ' '.join(nm_cmd), nm_err))
+    return nm_output
+
+def parse_nm(nm_output):
+    """Returns a tuple of lists: dlist for the list of data
+symbols and flist for the list of function symbols.
+
+dlist, flist = parse_nm(nm_output)"""
+    data = DATA_RE.findall(nm_output)
+    func = FUNC_RE.findall(nm_output)
+
+    flist = []
+    for sym in data:
+        if sym in func and (sym[:2] == 'Py' or sym[:3] == '_Py' or sym[:4] == 'init'):
+            flist.append(sym)
+
+    dlist = []
+    for sym in data:
+        if sym not in flist and (sym[:2] == 'Py' or sym[:3] == '_Py'):
+            dlist.append(sym)
+
+    dlist.sort()
+    flist.sort()
+    return dlist, flist
+
+def output_def(dlist, flist, header, file = sys.stdout):
+    """Outputs the final DEF file to a file defaulting to stdout.
+
+output_def(dlist, flist, header, file = sys.stdout)"""
+    for data_sym in dlist:
+        header = header + '\t%s DATA\n' % data_sym
+    header = header + '\n' # blank line
+    for func_sym in flist:
+        header = header + '\t%s\n' % func_sym
+    file.write(header)
+
+if __name__ == '__main__':
+    libfile, deffile = parse_cmd()
+    if deffile is None:
+        deffile = sys.stdout
+    else:
+        deffile = open(deffile, 'w')
+    nm_cmd = DEFAULT_NM + [str(libfile)]
+    nm_output = getnm(nm_cmd, shell=False)
+    dlist, flist = parse_nm(nm_output)
+    output_def(dlist, flist, DEF_HEADER, deffile)
diff --git a/venv/Lib/site-packages/numpy/distutils/line_endings.py b/venv/Lib/site-packages/numpy/distutils/line_endings.py
new file mode 100644
index 000000000..686e5ebd9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/line_endings.py
@@ -0,0 +1,77 @@
+""" Functions for converting from DOS to UNIX line endings
+
+"""
+import os
+import re
+import sys
+
+
+def dos2unix(file):
+    "Replace CRLF with LF in argument files.  Print names of changed files."
+    if os.path.isdir(file):
+        print(file, "Directory!")
+        return
+
+    with open(file, "rb") as fp:
+        data = fp.read()
+    if '\0' in data:
+        print(file, "Binary!")
+        return
+
+    newdata = re.sub("\r\n", "\n", data)
+    if newdata != data:
+        print('dos2unix:', file)
+        with open(file, "wb") as f:
+            f.write(newdata)
+        return file
+    else:
+        print(file, 'ok')
+
+def dos2unix_one_dir(modified_files, dir_name, file_names):
+    for file in file_names:
+        full_path = os.path.join(dir_name, file)
+        file = dos2unix(full_path)
+        if file is not None:
+            modified_files.append(file)
+
+def dos2unix_dir(dir_name):
+    modified_files = []
+    os.path.walk(dir_name, dos2unix_one_dir, modified_files)
+    return modified_files
+#----------------------------------
+
+def unix2dos(file):
+    "Replace LF with CRLF in argument files.  Print names of changed files."
+    if os.path.isdir(file):
+        print(file, "Directory!")
+        return
+
+    with open(file, "rb") as fp:
+        data = fp.read()
+    if '\0' in data:
+        print(file, "Binary!")
+        return
+    newdata = re.sub("\r\n", "\n", data)
+    newdata = re.sub("\n", "\r\n", newdata)
+    if newdata != data:
+        print('unix2dos:', file)
+        with open(file, "wb") as f:
+            f.write(newdata)
+        return file
+    else:
+        print(file, 'ok')
+
+def unix2dos_one_dir(modified_files, dir_name, file_names):
+    for file in file_names:
+        full_path = os.path.join(dir_name, file)
+        unix2dos(full_path)
+        if file is not None:
+            modified_files.append(file)
+
+def unix2dos_dir(dir_name):
+    modified_files = []
+    os.path.walk(dir_name, unix2dos_one_dir, modified_files)
+    return modified_files
+
+if __name__ == "__main__":
+    dos2unix_dir(sys.argv[1])
diff --git a/venv/Lib/site-packages/numpy/distutils/log.py b/venv/Lib/site-packages/numpy/distutils/log.py
new file mode 100644
index 000000000..a8113b9c6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/log.py
@@ -0,0 +1,89 @@
+# Colored log
+import sys
+from distutils.log import *  # noqa: F403
+from distutils.log import Log as old_Log
+from distutils.log import _global_log
+
+from numpy.distutils.misc_util import (red_text, default_text, cyan_text,
+        green_text, is_sequence, is_string)
+
+
+def _fix_args(args,flag=1):
+    if is_string(args):
+        return args.replace('%', '%%')
+    if flag and is_sequence(args):
+        return tuple([_fix_args(a, flag=0) for a in args])
+    return args
+
+
+class Log(old_Log):
+    def _log(self, level, msg, args):
+        if level >= self.threshold:
+            if args:
+                msg = msg % _fix_args(args)
+            if 0:
+                if msg.startswith('copying ') and msg.find(' -> ') != -1:
+                    return
+                if msg.startswith('byte-compiling '):
+                    return
+            print(_global_color_map[level](msg))
+            sys.stdout.flush()
+
+    def good(self, msg, *args):
+        """
+        If we log WARN messages, log this message as a 'nice' anti-warn
+        message.
+
+        """
+        if WARN >= self.threshold:
+            if args:
+                print(green_text(msg % _fix_args(args)))
+            else:
+                print(green_text(msg))
+            sys.stdout.flush()
+
+
+_global_log.__class__ = Log
+
+good = _global_log.good
+
+def set_threshold(level, force=False):
+    prev_level = _global_log.threshold
+    if prev_level > DEBUG or force:
+        # If we're running at DEBUG, don't change the threshold, as there's
+        # likely a good reason why we're running at this level.
+        _global_log.threshold = level
+        if level <= DEBUG:
+            info('set_threshold: setting threshold to DEBUG level,'
+                    ' it can be changed only with force argument')
+    else:
+        info('set_threshold: not changing threshold from DEBUG level'
+                ' %s to %s' % (prev_level, level))
+    return prev_level
+
+def get_threshold():
+	return _global_log.threshold
+
+def set_verbosity(v, force=False):
+    prev_level = _global_log.threshold
+    if v < 0:
+        set_threshold(ERROR, force)
+    elif v == 0:
+        set_threshold(WARN, force)
+    elif v == 1:
+        set_threshold(INFO, force)
+    elif v >= 2:
+        set_threshold(DEBUG, force)
+    return {FATAL:-2,ERROR:-1,WARN:0,INFO:1,DEBUG:2}.get(prev_level, 1)
+
+
+_global_color_map = {
+    DEBUG:cyan_text,
+    INFO:default_text,
+    WARN:red_text,
+    ERROR:red_text,
+    FATAL:red_text
+}
+
+# don't use INFO,.. flags in set_verbosity, these flags are for set_threshold.
+set_verbosity(0, force=True)
diff --git a/venv/Lib/site-packages/numpy/distutils/mingw/gfortran_vs2003_hack.c b/venv/Lib/site-packages/numpy/distutils/mingw/gfortran_vs2003_hack.c
new file mode 100644
index 000000000..485a675d8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/mingw/gfortran_vs2003_hack.c
@@ -0,0 +1,6 @@
+int _get_output_format(void)
+{
+    return 0;
+}
+
+int _imp____lc_codepage = 0;
diff --git a/venv/Lib/site-packages/numpy/distutils/mingw32ccompiler.py b/venv/Lib/site-packages/numpy/distutils/mingw32ccompiler.py
new file mode 100644
index 000000000..7cb6fadcc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/mingw32ccompiler.py
@@ -0,0 +1,653 @@
+"""
+Support code for building Python extensions on Windows.
+
+    # NT stuff
+    # 1. Make sure libpython<version>.a exists for gcc.  If not, build it.
+    # 2. Force windows to use gcc (we're struggling with MSVC and g77 support)
+    # 3. Force windows to use g77
+
+"""
+import os
+import sys
+import subprocess
+import re
+import textwrap
+
+# Overwrite certain distutils.ccompiler functions:
+import numpy.distutils.ccompiler  # noqa: F401
+from numpy.distutils import log
+# NT stuff
+# 1. Make sure libpython<version>.a exists for gcc.  If not, build it.
+# 2. Force windows to use gcc (we're struggling with MSVC and g77 support)
+#    --> this is done in numpy/distutils/ccompiler.py
+# 3. Force windows to use g77
+
+import distutils.cygwinccompiler
+from distutils.version import StrictVersion
+from distutils.unixccompiler import UnixCCompiler
+from distutils.msvccompiler import get_build_version as get_build_msvc_version
+from distutils.errors import UnknownFileError
+from numpy.distutils.misc_util import (msvc_runtime_library,
+                                       msvc_runtime_version,
+                                       msvc_runtime_major,
+                                       get_build_architecture)
+
+def get_msvcr_replacement():
+    """Replacement for outdated version of get_msvcr from cygwinccompiler"""
+    msvcr = msvc_runtime_library()
+    return [] if msvcr is None else [msvcr]
+
+# monkey-patch cygwinccompiler with our updated version from misc_util
+# to avoid getting an exception raised on Python 3.5
+distutils.cygwinccompiler.get_msvcr = get_msvcr_replacement
+
+# Useful to generate table of symbols from a dll
+_START = re.compile(r'\[Ordinal/Name Pointer\] Table')
+_TABLE = re.compile(r'^\s+\[([\s*[0-9]*)\] ([a-zA-Z0-9_]*)')
+
+# the same as cygwin plus some additional parameters
+class Mingw32CCompiler(distutils.cygwinccompiler.CygwinCCompiler):
+    """ A modified MingW32 compiler compatible with an MSVC built Python.
+
+    """
+
+    compiler_type = 'mingw32'
+
+    def __init__ (self,
+                  verbose=0,
+                  dry_run=0,
+                  force=0):
+
+        distutils.cygwinccompiler.CygwinCCompiler.__init__ (self, verbose,
+                                                            dry_run, force)
+
+        # we need to support 3.2 which doesn't match the standard
+        # get_versions methods regex
+        if self.gcc_version is None:
+            try:
+                out_string  = subprocess.check_output(['gcc', '-dumpversion'])
+            except (OSError, CalledProcessError):
+                out_string = ""  # ignore failures to match old behavior
+            result = re.search(r'(\d+\.\d+)', out_string)
+            if result:
+                self.gcc_version = StrictVersion(result.group(1))
+
+        # A real mingw32 doesn't need to specify a different entry point,
+        # but cygwin 2.91.57 in no-cygwin-mode needs it.
+        if self.gcc_version <= "2.91.57":
+            entry_point = '--entry _DllMain@12'
+        else:
+            entry_point = ''
+
+        if self.linker_dll == 'dllwrap':
+            # Commented out '--driver-name g++' part that fixes weird
+            #   g++.exe: g++: No such file or directory
+            # error (mingw 1.0 in Enthon24 tree, gcc-3.4.5).
+            # If the --driver-name part is required for some environment
+            # then make the inclusion of this part specific to that
+            # environment.
+            self.linker = 'dllwrap' #  --driver-name g++'
+        elif self.linker_dll == 'gcc':
+            self.linker = 'g++'
+
+        # **changes: eric jones 4/11/01
+        # 1. Check for import library on Windows.  Build if it doesn't exist.
+
+        build_import_library()
+
+        # Check for custom msvc runtime library on Windows. Build if it doesn't exist.
+        msvcr_success = build_msvcr_library()
+        msvcr_dbg_success = build_msvcr_library(debug=True)
+        if msvcr_success or msvcr_dbg_success:
+            # add preprocessor statement for using customized msvcr lib
+            self.define_macro('NPY_MINGW_USE_CUSTOM_MSVCR')
+
+        # Define the MSVC version as hint for MinGW
+        msvcr_version = msvc_runtime_version()
+        if msvcr_version:
+            self.define_macro('__MSVCRT_VERSION__', '0x%04i' % msvcr_version)
+
+        # MS_WIN64 should be defined when building for amd64 on windows,
+        # but python headers define it only for MS compilers, which has all
+        # kind of bad consequences, like using Py_ModuleInit4 instead of
+        # Py_ModuleInit4_64, etc... So we add it here
+        if get_build_architecture() == 'AMD64':
+            if self.gcc_version < "4.0":
+                self.set_executables(
+                    compiler='gcc -g -DDEBUG -DMS_WIN64 -mno-cygwin -O0 -Wall',
+                    compiler_so='gcc -g -DDEBUG -DMS_WIN64 -mno-cygwin -O0'
+                                ' -Wall -Wstrict-prototypes',
+                    linker_exe='gcc -g -mno-cygwin',
+                    linker_so='gcc -g -mno-cygwin -shared')
+            else:
+                # gcc-4 series releases do not support -mno-cygwin option
+                self.set_executables(
+                    compiler='gcc -g -DDEBUG -DMS_WIN64 -O0 -Wall',
+                    compiler_so='gcc -g -DDEBUG -DMS_WIN64 -O0 -Wall -Wstrict-prototypes',
+                    linker_exe='gcc -g',
+                    linker_so='gcc -g -shared')
+        else:
+            if self.gcc_version <= "3.0.0":
+                self.set_executables(
+                    compiler='gcc -mno-cygwin -O2 -w',
+                    compiler_so='gcc -mno-cygwin -mdll -O2 -w'
+                                ' -Wstrict-prototypes',
+                    linker_exe='g++ -mno-cygwin',
+                    linker_so='%s -mno-cygwin -mdll -static %s' %
+                              (self.linker, entry_point))
+            elif self.gcc_version < "4.0":
+                self.set_executables(
+                    compiler='gcc -mno-cygwin -O2 -Wall',
+                    compiler_so='gcc -mno-cygwin -O2 -Wall'
+                                ' -Wstrict-prototypes',
+                    linker_exe='g++ -mno-cygwin',
+                    linker_so='g++ -mno-cygwin -shared')
+            else:
+                # gcc-4 series releases do not support -mno-cygwin option
+                self.set_executables(compiler='gcc -O2 -Wall',
+                                     compiler_so='gcc -O2 -Wall -Wstrict-prototypes',
+                                     linker_exe='g++ ',
+                                     linker_so='g++ -shared')
+        # added for python2.3 support
+        # we can't pass it through set_executables because pre 2.2 would fail
+        self.compiler_cxx = ['g++']
+
+        # Maybe we should also append -mthreads, but then the finished dlls
+        # need another dll (mingwm10.dll see Mingw32 docs) (-mthreads: Support
+        # thread-safe exception handling on `Mingw32')
+
+        # no additional libraries needed
+        #self.dll_libraries=[]
+        return
+
+    # __init__ ()
+
+    def link(self,
+             target_desc,
+             objects,
+             output_filename,
+             output_dir,
+             libraries,
+             library_dirs,
+             runtime_library_dirs,
+             export_symbols = None,
+             debug=0,
+             extra_preargs=None,
+             extra_postargs=None,
+             build_temp=None,
+             target_lang=None):
+        # Include the appropriate MSVC runtime library if Python was built
+        # with MSVC >= 7.0 (MinGW standard is msvcrt)
+        runtime_library = msvc_runtime_library()
+        if runtime_library:
+            if not libraries:
+                libraries = []
+            libraries.append(runtime_library)
+        args = (self,
+                target_desc,
+                objects,
+                output_filename,
+                output_dir,
+                libraries,
+                library_dirs,
+                runtime_library_dirs,
+                None, #export_symbols, we do this in our def-file
+                debug,
+                extra_preargs,
+                extra_postargs,
+                build_temp,
+                target_lang)
+        if self.gcc_version < "3.0.0":
+            func = distutils.cygwinccompiler.CygwinCCompiler.link
+        else:
+            func = UnixCCompiler.link
+        func(*args[:func.__code__.co_argcount])
+        return
+
+    def object_filenames (self,
+                          source_filenames,
+                          strip_dir=0,
+                          output_dir=''):
+        if output_dir is None: output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            # use normcase to make sure '.rc' is really '.rc' and not '.RC'
+            (base, ext) = os.path.splitext (os.path.normcase(src_name))
+
+            # added these lines to strip off windows drive letters
+            # without it, .o files are placed next to .c files
+            # instead of the build directory
+            drv, base = os.path.splitdrive(base)
+            if drv:
+                base = base[1:]
+
+            if ext not in (self.src_extensions + ['.rc', '.res']):
+                raise UnknownFileError(
+                      "unknown file type '%s' (from '%s')" % \
+                      (ext, src_name))
+            if strip_dir:
+                base = os.path.basename (base)
+            if ext == '.res' or ext == '.rc':
+                # these need to be compiled to object files
+                obj_names.append (os.path.join (output_dir,
+                                                base + ext + self.obj_extension))
+            else:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.obj_extension))
+        return obj_names
+
+    # object_filenames ()
+
+
+def find_python_dll():
+    # We can't do much here:
+    # - find it in the virtualenv (sys.prefix)
+    # - find it in python main dir (sys.base_prefix, if in a virtualenv)
+    # - sys.real_prefix is main dir for virtualenvs in Python 2.7
+    # - in system32,
+    # - ortherwise (Sxs), I don't know how to get it.
+    stems = [sys.prefix]
+    if hasattr(sys, 'base_prefix') and sys.base_prefix != sys.prefix:
+        stems.append(sys.base_prefix)
+    elif hasattr(sys, 'real_prefix') and sys.real_prefix != sys.prefix:
+        stems.append(sys.real_prefix)
+
+    sub_dirs = ['', 'lib', 'bin']
+    # generate possible combinations of directory trees and sub-directories
+    lib_dirs = []
+    for stem in stems:
+        for folder in sub_dirs:
+            lib_dirs.append(os.path.join(stem, folder))
+
+    # add system directory as well
+    if 'SYSTEMROOT' in os.environ:
+        lib_dirs.append(os.path.join(os.environ['SYSTEMROOT'], 'System32'))
+
+    # search in the file system for possible candidates
+    major_version, minor_version = tuple(sys.version_info[:2])
+    patterns = ['python%d%d.dll']
+
+    for pat in patterns:
+        dllname = pat % (major_version, minor_version)
+        print("Looking for %s" % dllname)
+        for folder in lib_dirs:
+            dll = os.path.join(folder, dllname)
+            if os.path.exists(dll):
+                return dll
+
+    raise ValueError("%s not found in %s" % (dllname, lib_dirs))
+
+def dump_table(dll):
+    st = subprocess.check_output(["objdump.exe", "-p", dll])
+    return st.split(b'\n')
+
+def generate_def(dll, dfile):
+    """Given a dll file location,  get all its exported symbols and dump them
+    into the given def file.
+
+    The .def file will be overwritten"""
+    dump = dump_table(dll)
+    for i in range(len(dump)):
+        if _START.match(dump[i].decode()):
+            break
+    else:
+        raise ValueError("Symbol table not found")
+
+    syms = []
+    for j in range(i+1, len(dump)):
+        m = _TABLE.match(dump[j].decode())
+        if m:
+            syms.append((int(m.group(1).strip()), m.group(2)))
+        else:
+            break
+
+    if len(syms) == 0:
+        log.warn('No symbols found in %s' % dll)
+
+    with open(dfile, 'w') as d:
+        d.write('LIBRARY        %s\n' % os.path.basename(dll))
+        d.write(';CODE          PRELOAD MOVEABLE DISCARDABLE\n')
+        d.write(';DATA          PRELOAD SINGLE\n')
+        d.write('\nEXPORTS\n')
+        for s in syms:
+            #d.write('@%d    %s\n' % (s[0], s[1]))
+            d.write('%s\n' % s[1])
+
+def find_dll(dll_name):
+
+    arch = {'AMD64' : 'amd64',
+            'Intel' : 'x86'}[get_build_architecture()]
+
+    def _find_dll_in_winsxs(dll_name):
+        # Walk through the WinSxS directory to find the dll.
+        winsxs_path = os.path.join(os.environ.get('WINDIR', r'C:\WINDOWS'),
+                                   'winsxs')
+        if not os.path.exists(winsxs_path):
+            return None
+        for root, dirs, files in os.walk(winsxs_path):
+            if dll_name in files and arch in root:
+                return os.path.join(root, dll_name)
+        return None
+
+    def _find_dll_in_path(dll_name):
+        # First, look in the Python directory, then scan PATH for
+        # the given dll name.
+        for path in [sys.prefix] + os.environ['PATH'].split(';'):
+            filepath = os.path.join(path, dll_name)
+            if os.path.exists(filepath):
+                return os.path.abspath(filepath)
+
+    return _find_dll_in_winsxs(dll_name) or _find_dll_in_path(dll_name)
+
+def build_msvcr_library(debug=False):
+    if os.name != 'nt':
+        return False
+
+    # If the version number is None, then we couldn't find the MSVC runtime at
+    # all, because we are running on a Python distribution which is customed
+    # compiled; trust that the compiler is the same as the one available to us
+    # now, and that it is capable of linking with the correct runtime without
+    # any extra options.
+    msvcr_ver = msvc_runtime_major()
+    if msvcr_ver is None:
+        log.debug('Skip building import library: '
+                  'Runtime is not compiled with MSVC')
+        return False
+
+    # Skip using a custom library for versions < MSVC 8.0
+    if msvcr_ver < 80:
+        log.debug('Skip building msvcr library:'
+                  ' custom functionality not present')
+        return False
+
+    msvcr_name = msvc_runtime_library()
+    if debug:
+        msvcr_name += 'd'
+
+    # Skip if custom library already exists
+    out_name = "lib%s.a" % msvcr_name
+    out_file = os.path.join(sys.prefix, 'libs', out_name)
+    if os.path.isfile(out_file):
+        log.debug('Skip building msvcr library: "%s" exists' %
+                  (out_file,))
+        return True
+
+    # Find the msvcr dll
+    msvcr_dll_name = msvcr_name + '.dll'
+    dll_file = find_dll(msvcr_dll_name)
+    if not dll_file:
+        log.warn('Cannot build msvcr library: "%s" not found' %
+                 msvcr_dll_name)
+        return False
+
+    def_name = "lib%s.def" % msvcr_name
+    def_file = os.path.join(sys.prefix, 'libs', def_name)
+
+    log.info('Building msvcr library: "%s" (from %s)' \
+             % (out_file, dll_file))
+
+    # Generate a symbol definition file from the msvcr dll
+    generate_def(dll_file, def_file)
+
+    # Create a custom mingw library for the given symbol definitions
+    cmd = ['dlltool', '-d', def_file, '-l', out_file]
+    retcode = subprocess.call(cmd)
+
+    # Clean up symbol definitions
+    os.remove(def_file)
+
+    return (not retcode)
+
+def build_import_library():
+    if os.name != 'nt':
+        return
+
+    arch = get_build_architecture()
+    if arch == 'AMD64':
+        return _build_import_library_amd64()
+    elif arch == 'Intel':
+        return _build_import_library_x86()
+    else:
+        raise ValueError("Unhandled arch %s" % arch)
+
+def _check_for_import_lib():
+    """Check if an import library for the Python runtime already exists."""
+    major_version, minor_version = tuple(sys.version_info[:2])
+
+    # patterns for the file name of the library itself
+    patterns = ['libpython%d%d.a',
+                'libpython%d%d.dll.a',
+                'libpython%d.%d.dll.a']
+
+    # directory trees that may contain the library
+    stems = [sys.prefix]
+    if hasattr(sys, 'base_prefix') and sys.base_prefix != sys.prefix:
+        stems.append(sys.base_prefix)
+    elif hasattr(sys, 'real_prefix') and sys.real_prefix != sys.prefix:
+        stems.append(sys.real_prefix)
+
+    # possible subdirectories within those trees where it is placed
+    sub_dirs = ['libs', 'lib']
+
+    # generate a list of candidate locations
+    candidates = []
+    for pat in patterns:
+        filename = pat % (major_version, minor_version)
+        for stem_dir in stems:
+            for folder in sub_dirs:
+                candidates.append(os.path.join(stem_dir, folder, filename))
+
+    # test the filesystem to see if we can find any of these
+    for fullname in candidates:
+        if os.path.isfile(fullname):
+            # already exists, in location given
+            return (True, fullname)
+
+    # needs to be built, preferred location given first
+    return (False, candidates[0])
+
+def _build_import_library_amd64():
+    out_exists, out_file = _check_for_import_lib()
+    if out_exists:
+        log.debug('Skip building import library: "%s" exists', out_file)
+        return
+
+    # get the runtime dll for which we are building import library
+    dll_file = find_python_dll()
+    log.info('Building import library (arch=AMD64): "%s" (from %s)' %
+             (out_file, dll_file))
+
+    # generate symbol list from this library
+    def_name = "python%d%d.def" % tuple(sys.version_info[:2])
+    def_file = os.path.join(sys.prefix, 'libs', def_name)
+    generate_def(dll_file, def_file)
+
+    # generate import library from this symbol list
+    cmd = ['dlltool', '-d', def_file, '-l', out_file]
+    subprocess.check_call(cmd)
+
+def _build_import_library_x86():
+    """ Build the import libraries for Mingw32-gcc on Windows
+    """
+    out_exists, out_file = _check_for_import_lib()
+    if out_exists:
+        log.debug('Skip building import library: "%s" exists', out_file)
+        return
+
+    lib_name = "python%d%d.lib" % tuple(sys.version_info[:2])
+    lib_file = os.path.join(sys.prefix, 'libs', lib_name)
+    if not os.path.isfile(lib_file):
+        # didn't find library file in virtualenv, try base distribution, too,
+        # and use that instead if found there. for Python 2.7 venvs, the base
+        # directory is in attribute real_prefix instead of base_prefix.
+        if hasattr(sys, 'base_prefix'):
+            base_lib = os.path.join(sys.base_prefix, 'libs', lib_name)
+        elif hasattr(sys, 'real_prefix'):
+            base_lib = os.path.join(sys.real_prefix, 'libs', lib_name)
+        else:
+            base_lib = ''  # os.path.isfile('') == False
+
+        if os.path.isfile(base_lib):
+            lib_file = base_lib
+        else:
+            log.warn('Cannot build import library: "%s" not found', lib_file)
+            return
+    log.info('Building import library (ARCH=x86): "%s"', out_file)
+
+    from numpy.distutils import lib2def
+
+    def_name = "python%d%d.def" % tuple(sys.version_info[:2])
+    def_file = os.path.join(sys.prefix, 'libs', def_name)
+    nm_output = lib2def.getnm(
+            lib2def.DEFAULT_NM + [lib_file], shell=False)
+    dlist, flist = lib2def.parse_nm(nm_output)
+    with open(def_file, 'w') as fid:
+        lib2def.output_def(dlist, flist, lib2def.DEF_HEADER, fid)
+
+    dll_name = find_python_dll ()
+
+    cmd = ["dlltool",
+           "--dllname", dll_name,
+           "--def", def_file,
+           "--output-lib", out_file]
+    status = subprocess.check_output(cmd)
+    if status:
+        log.warn('Failed to build import library for gcc. Linking will fail.')
+    return
+
+#=====================================
+# Dealing with Visual Studio MANIFESTS
+#=====================================
+
+# Functions to deal with visual studio manifests. Manifest are a mechanism to
+# enforce strong DLL versioning on windows, and has nothing to do with
+# distutils MANIFEST. manifests are XML files with version info, and used by
+# the OS loader; they are necessary when linking against a DLL not in the
+# system path; in particular, official python 2.6 binary is built against the
+# MS runtime 9 (the one from VS 2008), which is not available on most windows
+# systems; python 2.6 installer does install it in the Win SxS (Side by side)
+# directory, but this requires the manifest for this to work. This is a big
+# mess, thanks MS for a wonderful system.
+
+# XXX: ideally, we should use exactly the same version as used by python. I
+# submitted a patch to get this version, but it was only included for python
+# 2.6.1 and above. So for versions below, we use a "best guess".
+_MSVCRVER_TO_FULLVER = {}
+if sys.platform == 'win32':
+    try:
+        import msvcrt
+        # I took one version in my SxS directory: no idea if it is the good
+        # one, and we can't retrieve it from python
+        _MSVCRVER_TO_FULLVER['80'] = "8.0.50727.42"
+        _MSVCRVER_TO_FULLVER['90'] = "9.0.21022.8"
+        # Value from msvcrt.CRT_ASSEMBLY_VERSION under Python 3.3.0
+        # on Windows XP:
+        _MSVCRVER_TO_FULLVER['100'] = "10.0.30319.460"
+        # Python 3.7 uses 1415, but get_build_version returns 140 ??
+        _MSVCRVER_TO_FULLVER['140'] = "14.15.26726.0"
+        if hasattr(msvcrt, "CRT_ASSEMBLY_VERSION"):
+            major, minor, rest = msvcrt.CRT_ASSEMBLY_VERSION.split(".", 2)
+            _MSVCRVER_TO_FULLVER[major + minor] = msvcrt.CRT_ASSEMBLY_VERSION
+            del major, minor, rest
+    except ImportError:
+        # If we are here, means python was not built with MSVC. Not sure what
+        # to do in that case: manifest building will fail, but it should not be
+        # used in that case anyway
+        log.warn('Cannot import msvcrt: using manifest will not be possible')
+
+def msvc_manifest_xml(maj, min):
+    """Given a major and minor version of the MSVCR, returns the
+    corresponding XML file."""
+    try:
+        fullver = _MSVCRVER_TO_FULLVER[str(maj * 10 + min)]
+    except KeyError:
+        raise ValueError("Version %d,%d of MSVCRT not supported yet" %
+                         (maj, min))
+    # Don't be fooled, it looks like an XML, but it is not. In particular, it
+    # should not have any space before starting, and its size should be
+    # divisible by 4, most likely for alignment constraints when the xml is
+    # embedded in the binary...
+    # This template was copied directly from the python 2.6 binary (using
+    # strings.exe from mingw on python.exe).
+    template = textwrap.dedent("""\
+        <assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
+          <trustInfo xmlns="urn:schemas-microsoft-com:asm.v3">
+            <security>
+              <requestedPrivileges>
+                <requestedExecutionLevel level="asInvoker" uiAccess="false"></requestedExecutionLevel>
+              </requestedPrivileges>
+            </security>
+          </trustInfo>
+          <dependency>
+            <dependentAssembly>
+              <assemblyIdentity type="win32" name="Microsoft.VC%(maj)d%(min)d.CRT" version="%(fullver)s" processorArchitecture="*" publicKeyToken="1fc8b3b9a1e18e3b"></assemblyIdentity>
+            </dependentAssembly>
+          </dependency>
+        </assembly>""")
+
+    return template % {'fullver': fullver, 'maj': maj, 'min': min}
+
+def manifest_rc(name, type='dll'):
+    """Return the rc file used to generate the res file which will be embedded
+    as manifest for given manifest file name, of given type ('dll' or
+    'exe').
+
+    Parameters
+    ----------
+    name : str
+            name of the manifest file to embed
+    type : str {'dll', 'exe'}
+            type of the binary which will embed the manifest
+
+    """
+    if type == 'dll':
+        rctype = 2
+    elif type == 'exe':
+        rctype = 1
+    else:
+        raise ValueError("Type %s not supported" % type)
+
+    return """\
+#include "winuser.h"
+%d RT_MANIFEST %s""" % (rctype, name)
+
+def check_embedded_msvcr_match_linked(msver):
+    """msver is the ms runtime version used for the MANIFEST."""
+    # check msvcr major version are the same for linking and
+    # embedding
+    maj = msvc_runtime_major()
+    if maj:
+        if not maj == int(msver):
+            raise ValueError(
+                  "Discrepancy between linked msvcr " \
+                  "(%d) and the one about to be embedded " \
+                  "(%d)" % (int(msver), maj))
+
+def configtest_name(config):
+    base = os.path.basename(config._gen_temp_sourcefile("yo", [], "c"))
+    return os.path.splitext(base)[0]
+
+def manifest_name(config):
+    # Get configest name (including suffix)
+    root = configtest_name(config)
+    exext = config.compiler.exe_extension
+    return root + exext + ".manifest"
+
+def rc_name(config):
+    # Get configtest name (including suffix)
+    root = configtest_name(config)
+    return root + ".rc"
+
+def generate_manifest(config):
+    msver = get_build_msvc_version()
+    if msver is not None:
+        if msver >= 8:
+            check_embedded_msvcr_match_linked(msver)
+            ma = int(msver)
+            mi = int((msver - ma) * 10)
+            # Write the manifest file
+            manxml = msvc_manifest_xml(ma, mi)
+            man = open(manifest_name(config), "w")
+            config.temp_files.append(manifest_name(config))
+            man.write(manxml)
+            man.close()
diff --git a/venv/Lib/site-packages/numpy/distutils/misc_util.py b/venv/Lib/site-packages/numpy/distutils/misc_util.py
new file mode 100644
index 000000000..9f9e9f1ac
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/misc_util.py
@@ -0,0 +1,2391 @@
+import os
+import re
+import sys
+import copy
+import glob
+import atexit
+import tempfile
+import subprocess
+import shutil
+import multiprocessing
+import textwrap
+
+import distutils
+from distutils.errors import DistutilsError
+try:
+    from threading import local as tlocal
+except ImportError:
+    from dummy_threading import local as tlocal
+
+# stores temporary directory of each thread to only create one per thread
+_tdata = tlocal()
+
+# store all created temporary directories so they can be deleted on exit
+_tmpdirs = []
+def clean_up_temporary_directory():
+    if _tmpdirs is not None:
+        for d in _tmpdirs:
+            try:
+                shutil.rmtree(d)
+            except OSError:
+                pass
+
+atexit.register(clean_up_temporary_directory)
+
+from numpy.compat import npy_load_module
+
+__all__ = ['Configuration', 'get_numpy_include_dirs', 'default_config_dict',
+           'dict_append', 'appendpath', 'generate_config_py',
+           'get_cmd', 'allpath', 'get_mathlibs',
+           'terminal_has_colors', 'red_text', 'green_text', 'yellow_text',
+           'blue_text', 'cyan_text', 'cyg2win32', 'mingw32', 'all_strings',
+           'has_f_sources', 'has_cxx_sources', 'filter_sources',
+           'get_dependencies', 'is_local_src_dir', 'get_ext_source_files',
+           'get_script_files', 'get_lib_source_files', 'get_data_files',
+           'dot_join', 'get_frame', 'minrelpath', 'njoin',
+           'is_sequence', 'is_string', 'as_list', 'gpaths', 'get_language',
+           'quote_args', 'get_build_architecture', 'get_info', 'get_pkg_info',
+           'get_num_build_jobs']
+
+class InstallableLib:
+    """
+    Container to hold information on an installable library.
+
+    Parameters
+    ----------
+    name : str
+        Name of the installed library.
+    build_info : dict
+        Dictionary holding build information.
+    target_dir : str
+        Absolute path specifying where to install the library.
+
+    See Also
+    --------
+    Configuration.add_installed_library
+
+    Notes
+    -----
+    The three parameters are stored as attributes with the same names.
+
+    """
+    def __init__(self, name, build_info, target_dir):
+        self.name = name
+        self.build_info = build_info
+        self.target_dir = target_dir
+
+
+def get_num_build_jobs():
+    """
+    Get number of parallel build jobs set by the --parallel command line
+    argument of setup.py
+    If the command did not receive a setting the environment variable
+    NPY_NUM_BUILD_JOBS is checked. If that is unset, return the number of
+    processors on the system, with a maximum of 8 (to prevent
+    overloading the system if there a lot of CPUs).
+
+    Returns
+    -------
+    out : int
+        number of parallel jobs that can be run
+
+    """
+    from numpy.distutils.core import get_distribution
+    try:
+        cpu_count = len(os.sched_getaffinity(0))
+    except AttributeError:
+        cpu_count = multiprocessing.cpu_count()
+    cpu_count = min(cpu_count, 8)
+    envjobs = int(os.environ.get("NPY_NUM_BUILD_JOBS", cpu_count))
+    dist = get_distribution()
+    # may be None during configuration
+    if dist is None:
+        return envjobs
+
+    # any of these three may have the job set, take the largest
+    cmdattr = (getattr(dist.get_command_obj('build'), 'parallel', None),
+               getattr(dist.get_command_obj('build_ext'), 'parallel', None),
+               getattr(dist.get_command_obj('build_clib'), 'parallel', None))
+    if all(x is None for x in cmdattr):
+        return envjobs
+    else:
+        return max(x for x in cmdattr if x is not None)
+
+def quote_args(args):
+    # don't used _nt_quote_args as it does not check if
+    # args items already have quotes or not.
+    args = list(args)
+    for i in range(len(args)):
+        a = args[i]
+        if ' ' in a and a[0] not in '"\'':
+            args[i] = '"%s"' % (a)
+    return args
+
+def allpath(name):
+    "Convert a /-separated pathname to one using the OS's path separator."
+    splitted = name.split('/')
+    return os.path.join(*splitted)
+
+def rel_path(path, parent_path):
+    """Return path relative to parent_path."""
+    # Use realpath to avoid issues with symlinked dirs (see gh-7707)
+    pd = os.path.realpath(os.path.abspath(parent_path))
+    apath = os.path.realpath(os.path.abspath(path))
+    if len(apath) < len(pd):
+        return path
+    if apath == pd:
+        return ''
+    if pd == apath[:len(pd)]:
+        assert apath[len(pd)] in [os.sep], repr((path, apath[len(pd)]))
+        path = apath[len(pd)+1:]
+    return path
+
+def get_path_from_frame(frame, parent_path=None):
+    """Return path of the module given a frame object from the call stack.
+
+    Returned path is relative to parent_path when given,
+    otherwise it is absolute path.
+    """
+
+    # First, try to find if the file name is in the frame.
+    try:
+        caller_file = eval('__file__', frame.f_globals, frame.f_locals)
+        d = os.path.dirname(os.path.abspath(caller_file))
+    except NameError:
+        # __file__ is not defined, so let's try __name__. We try this second
+        # because setuptools spoofs __name__ to be '__main__' even though
+        # sys.modules['__main__'] might be something else, like easy_install(1).
+        caller_name = eval('__name__', frame.f_globals, frame.f_locals)
+        __import__(caller_name)
+        mod = sys.modules[caller_name]
+        if hasattr(mod, '__file__'):
+            d = os.path.dirname(os.path.abspath(mod.__file__))
+        else:
+            # we're probably running setup.py as execfile("setup.py")
+            # (likely we're building an egg)
+            d = os.path.abspath('.')
+
+    if parent_path is not None:
+        d = rel_path(d, parent_path)
+
+    return d or '.'
+
+def njoin(*path):
+    """Join two or more pathname components +
+    - convert a /-separated pathname to one using the OS's path separator.
+    - resolve `..` and `.` from path.
+
+    Either passing n arguments as in njoin('a','b'), or a sequence
+    of n names as in njoin(['a','b']) is handled, or a mixture of such arguments.
+    """
+    paths = []
+    for p in path:
+        if is_sequence(p):
+            # njoin(['a', 'b'], 'c')
+            paths.append(njoin(*p))
+        else:
+            assert is_string(p)
+            paths.append(p)
+    path = paths
+    if not path:
+        # njoin()
+        joined = ''
+    else:
+        # njoin('a', 'b')
+        joined = os.path.join(*path)
+    if os.path.sep != '/':
+        joined = joined.replace('/', os.path.sep)
+    return minrelpath(joined)
+
+def get_mathlibs(path=None):
+    """Return the MATHLIB line from numpyconfig.h
+    """
+    if path is not None:
+        config_file = os.path.join(path, '_numpyconfig.h')
+    else:
+        # Look for the file in each of the numpy include directories.
+        dirs = get_numpy_include_dirs()
+        for path in dirs:
+            fn = os.path.join(path, '_numpyconfig.h')
+            if os.path.exists(fn):
+                config_file = fn
+                break
+        else:
+            raise DistutilsError('_numpyconfig.h not found in numpy include '
+                'dirs %r' % (dirs,))
+
+    with open(config_file) as fid:
+        mathlibs = []
+        s = '#define MATHLIB'
+        for line in fid:
+            if line.startswith(s):
+                value = line[len(s):].strip()
+                if value:
+                    mathlibs.extend(value.split(','))
+    return mathlibs
+
+def minrelpath(path):
+    """Resolve `..` and '.' from path.
+    """
+    if not is_string(path):
+        return path
+    if '.' not in path:
+        return path
+    l = path.split(os.sep)
+    while l:
+        try:
+            i = l.index('.', 1)
+        except ValueError:
+            break
+        del l[i]
+    j = 1
+    while l:
+        try:
+            i = l.index('..', j)
+        except ValueError:
+            break
+        if l[i-1]=='..':
+            j += 1
+        else:
+            del l[i], l[i-1]
+            j = 1
+    if not l:
+        return ''
+    return os.sep.join(l)
+
+def sorted_glob(fileglob):
+    """sorts output of python glob for https://bugs.python.org/issue30461
+    to allow extensions to have reproducible build results"""
+    return sorted(glob.glob(fileglob))
+
+def _fix_paths(paths, local_path, include_non_existing):
+    assert is_sequence(paths), repr(type(paths))
+    new_paths = []
+    assert not is_string(paths), repr(paths)
+    for n in paths:
+        if is_string(n):
+            if '*' in n or '?' in n:
+                p = sorted_glob(n)
+                p2 = sorted_glob(njoin(local_path, n))
+                if p2:
+                    new_paths.extend(p2)
+                elif p:
+                    new_paths.extend(p)
+                else:
+                    if include_non_existing:
+                        new_paths.append(n)
+                    print('could not resolve pattern in %r: %r' %
+                            (local_path, n))
+            else:
+                n2 = njoin(local_path, n)
+                if os.path.exists(n2):
+                    new_paths.append(n2)
+                else:
+                    if os.path.exists(n):
+                        new_paths.append(n)
+                    elif include_non_existing:
+                        new_paths.append(n)
+                    if not os.path.exists(n):
+                        print('non-existing path in %r: %r' %
+                                (local_path, n))
+
+        elif is_sequence(n):
+            new_paths.extend(_fix_paths(n, local_path, include_non_existing))
+        else:
+            new_paths.append(n)
+    return [minrelpath(p) for p in new_paths]
+
+def gpaths(paths, local_path='', include_non_existing=True):
+    """Apply glob to paths and prepend local_path if needed.
+    """
+    if is_string(paths):
+        paths = (paths,)
+    return _fix_paths(paths, local_path, include_non_existing)
+
+def make_temp_file(suffix='', prefix='', text=True):
+    if not hasattr(_tdata, 'tempdir'):
+        _tdata.tempdir = tempfile.mkdtemp()
+        _tmpdirs.append(_tdata.tempdir)
+    fid, name = tempfile.mkstemp(suffix=suffix,
+                                 prefix=prefix,
+                                 dir=_tdata.tempdir,
+                                 text=text)
+    fo = os.fdopen(fid, 'w')
+    return fo, name
+
+# Hooks for colored terminal output.
+# See also https://web.archive.org/web/20100314204946/http://www.livinglogic.de/Python/ansistyle
+def terminal_has_colors():
+    if sys.platform=='cygwin' and 'USE_COLOR' not in os.environ:
+        # Avoid importing curses that causes illegal operation
+        # with a message:
+        #  PYTHON2 caused an invalid page fault in
+        #  module CYGNURSES7.DLL as 015f:18bbfc28
+        # Details: Python 2.3.3 [GCC 3.3.1 (cygming special)]
+        #          ssh to Win32 machine from debian
+        #          curses.version is 2.2
+        #          CYGWIN_98-4.10, release 1.5.7(0.109/3/2))
+        return 0
+    if hasattr(sys.stdout, 'isatty') and sys.stdout.isatty():
+        try:
+            import curses
+            curses.setupterm()
+            if (curses.tigetnum("colors") >= 0
+                and curses.tigetnum("pairs") >= 0
+                and ((curses.tigetstr("setf") is not None
+                      and curses.tigetstr("setb") is not None)
+                     or (curses.tigetstr("setaf") is not None
+                         and curses.tigetstr("setab") is not None)
+                     or curses.tigetstr("scp") is not None)):
+                return 1
+        except Exception:
+            pass
+    return 0
+
+if terminal_has_colors():
+    _colour_codes = dict(black=0, red=1, green=2, yellow=3,
+                         blue=4, magenta=5, cyan=6, white=7, default=9)
+    def colour_text(s, fg=None, bg=None, bold=False):
+        seq = []
+        if bold:
+            seq.append('1')
+        if fg:
+            fgcode = 30 + _colour_codes.get(fg.lower(), 0)
+            seq.append(str(fgcode))
+        if bg:
+            bgcode = 40 + _colour_codes.get(fg.lower(), 7)
+            seq.append(str(bgcode))
+        if seq:
+            return '\x1b[%sm%s\x1b[0m' % (';'.join(seq), s)
+        else:
+            return s
+else:
+    def colour_text(s, fg=None, bg=None):
+        return s
+
+def default_text(s):
+    return colour_text(s, 'default')
+def red_text(s):
+    return colour_text(s, 'red')
+def green_text(s):
+    return colour_text(s, 'green')
+def yellow_text(s):
+    return colour_text(s, 'yellow')
+def cyan_text(s):
+    return colour_text(s, 'cyan')
+def blue_text(s):
+    return colour_text(s, 'blue')
+
+#########################
+
+def cyg2win32(path):
+    if sys.platform=='cygwin' and path.startswith('/cygdrive'):
+        path = path[10] + ':' + os.path.normcase(path[11:])
+    return path
+
+def mingw32():
+    """Return true when using mingw32 environment.
+    """
+    if sys.platform=='win32':
+        if os.environ.get('OSTYPE', '')=='msys':
+            return True
+        if os.environ.get('MSYSTEM', '')=='MINGW32':
+            return True
+    return False
+
+def msvc_runtime_version():
+    "Return version of MSVC runtime library, as defined by __MSC_VER__ macro"
+    msc_pos = sys.version.find('MSC v.')
+    if msc_pos != -1:
+        msc_ver = int(sys.version[msc_pos+6:msc_pos+10])
+    else:
+        msc_ver = None
+    return msc_ver
+
+def msvc_runtime_library():
+    "Return name of MSVC runtime library if Python was built with MSVC >= 7"
+    ver = msvc_runtime_major ()
+    if ver:
+        if ver < 140:
+            return "msvcr%i" % ver
+        else:
+            return "vcruntime%i" % ver
+    else:
+        return None
+
+def msvc_runtime_major():
+    "Return major version of MSVC runtime coded like get_build_msvc_version"
+    major = {1300:  70,  # MSVC 7.0
+             1310:  71,  # MSVC 7.1
+             1400:  80,  # MSVC 8
+             1500:  90,  # MSVC 9  (aka 2008)
+             1600: 100,  # MSVC 10 (aka 2010)
+             1900: 140,  # MSVC 14 (aka 2015)
+    }.get(msvc_runtime_version(), None)
+    return major
+
+#########################
+
+#XXX need support for .C that is also C++
+cxx_ext_match = re.compile(r'.*[.](cpp|cxx|cc)\Z', re.I).match
+fortran_ext_match = re.compile(r'.*[.](f90|f95|f77|for|ftn|f)\Z', re.I).match
+f90_ext_match = re.compile(r'.*[.](f90|f95)\Z', re.I).match
+f90_module_name_match = re.compile(r'\s*module\s*(?P<name>[\w_]+)', re.I).match
+def _get_f90_modules(source):
+    """Return a list of Fortran f90 module names that
+    given source file defines.
+    """
+    if not f90_ext_match(source):
+        return []
+    modules = []
+    with open(source, 'r') as f:
+        for line in f:
+            m = f90_module_name_match(line)
+            if m:
+                name = m.group('name')
+                modules.append(name)
+                # break  # XXX can we assume that there is one module per file?
+    return modules
+
+def is_string(s):
+    return isinstance(s, str)
+
+def all_strings(lst):
+    """Return True if all items in lst are string objects. """
+    for item in lst:
+        if not is_string(item):
+            return False
+    return True
+
+def is_sequence(seq):
+    if is_string(seq):
+        return False
+    try:
+        len(seq)
+    except Exception:
+        return False
+    return True
+
+def is_glob_pattern(s):
+    return is_string(s) and ('*' in s or '?' in s)
+
+def as_list(seq):
+    if is_sequence(seq):
+        return list(seq)
+    else:
+        return [seq]
+
+def get_language(sources):
+    # not used in numpy/scipy packages, use build_ext.detect_language instead
+    """Determine language value (c,f77,f90) from sources """
+    language = None
+    for source in sources:
+        if isinstance(source, str):
+            if f90_ext_match(source):
+                language = 'f90'
+                break
+            elif fortran_ext_match(source):
+                language = 'f77'
+    return language
+
+def has_f_sources(sources):
+    """Return True if sources contains Fortran files """
+    for source in sources:
+        if fortran_ext_match(source):
+            return True
+    return False
+
+def has_cxx_sources(sources):
+    """Return True if sources contains C++ files """
+    for source in sources:
+        if cxx_ext_match(source):
+            return True
+    return False
+
+def filter_sources(sources):
+    """Return four lists of filenames containing
+    C, C++, Fortran, and Fortran 90 module sources,
+    respectively.
+    """
+    c_sources = []
+    cxx_sources = []
+    f_sources = []
+    fmodule_sources = []
+    for source in sources:
+        if fortran_ext_match(source):
+            modules = _get_f90_modules(source)
+            if modules:
+                fmodule_sources.append(source)
+            else:
+                f_sources.append(source)
+        elif cxx_ext_match(source):
+            cxx_sources.append(source)
+        else:
+            c_sources.append(source)
+    return c_sources, cxx_sources, f_sources, fmodule_sources
+
+
+def _get_headers(directory_list):
+    # get *.h files from list of directories
+    headers = []
+    for d in directory_list:
+        head = sorted_glob(os.path.join(d, "*.h")) #XXX: *.hpp files??
+        headers.extend(head)
+    return headers
+
+def _get_directories(list_of_sources):
+    # get unique directories from list of sources.
+    direcs = []
+    for f in list_of_sources:
+        d = os.path.split(f)
+        if d[0] != '' and not d[0] in direcs:
+            direcs.append(d[0])
+    return direcs
+
+def _commandline_dep_string(cc_args, extra_postargs, pp_opts):
+    """
+    Return commandline representation used to determine if a file needs
+    to be recompiled
+    """
+    cmdline = 'commandline: '
+    cmdline += ' '.join(cc_args)
+    cmdline += ' '.join(extra_postargs)
+    cmdline += ' '.join(pp_opts) + '\n'
+    return cmdline
+
+
+def get_dependencies(sources):
+    #XXX scan sources for include statements
+    return _get_headers(_get_directories(sources))
+
+def is_local_src_dir(directory):
+    """Return true if directory is local directory.
+    """
+    if not is_string(directory):
+        return False
+    abs_dir = os.path.abspath(directory)
+    c = os.path.commonprefix([os.getcwd(), abs_dir])
+    new_dir = abs_dir[len(c):].split(os.sep)
+    if new_dir and not new_dir[0]:
+        new_dir = new_dir[1:]
+    if new_dir and new_dir[0]=='build':
+        return False
+    new_dir = os.sep.join(new_dir)
+    return os.path.isdir(new_dir)
+
+def general_source_files(top_path):
+    pruned_directories = {'CVS':1, '.svn':1, 'build':1}
+    prune_file_pat = re.compile(r'(?:[~#]|\.py[co]|\.o)$')
+    for dirpath, dirnames, filenames in os.walk(top_path, topdown=True):
+        pruned = [ d for d in dirnames if d not in pruned_directories ]
+        dirnames[:] = pruned
+        for f in filenames:
+            if not prune_file_pat.search(f):
+                yield os.path.join(dirpath, f)
+
+def general_source_directories_files(top_path):
+    """Return a directory name relative to top_path and
+    files contained.
+    """
+    pruned_directories = ['CVS', '.svn', 'build']
+    prune_file_pat = re.compile(r'(?:[~#]|\.py[co]|\.o)$')
+    for dirpath, dirnames, filenames in os.walk(top_path, topdown=True):
+        pruned = [ d for d in dirnames if d not in pruned_directories ]
+        dirnames[:] = pruned
+        for d in dirnames:
+            dpath = os.path.join(dirpath, d)
+            rpath = rel_path(dpath, top_path)
+            files = []
+            for f in os.listdir(dpath):
+                fn = os.path.join(dpath, f)
+                if os.path.isfile(fn) and not prune_file_pat.search(fn):
+                    files.append(fn)
+            yield rpath, files
+    dpath = top_path
+    rpath = rel_path(dpath, top_path)
+    filenames = [os.path.join(dpath, f) for f in os.listdir(dpath) \
+                 if not prune_file_pat.search(f)]
+    files = [f for f in filenames if os.path.isfile(f)]
+    yield rpath, files
+
+
+def get_ext_source_files(ext):
+    # Get sources and any include files in the same directory.
+    filenames = []
+    sources = [_m for _m in ext.sources if is_string(_m)]
+    filenames.extend(sources)
+    filenames.extend(get_dependencies(sources))
+    for d in ext.depends:
+        if is_local_src_dir(d):
+            filenames.extend(list(general_source_files(d)))
+        elif os.path.isfile(d):
+            filenames.append(d)
+    return filenames
+
+def get_script_files(scripts):
+    scripts = [_m for _m in scripts if is_string(_m)]
+    return scripts
+
+def get_lib_source_files(lib):
+    filenames = []
+    sources = lib[1].get('sources', [])
+    sources = [_m for _m in sources if is_string(_m)]
+    filenames.extend(sources)
+    filenames.extend(get_dependencies(sources))
+    depends = lib[1].get('depends', [])
+    for d in depends:
+        if is_local_src_dir(d):
+            filenames.extend(list(general_source_files(d)))
+        elif os.path.isfile(d):
+            filenames.append(d)
+    return filenames
+
+def get_shared_lib_extension(is_python_ext=False):
+    """Return the correct file extension for shared libraries.
+
+    Parameters
+    ----------
+    is_python_ext : bool, optional
+        Whether the shared library is a Python extension.  Default is False.
+
+    Returns
+    -------
+    so_ext : str
+        The shared library extension.
+
+    Notes
+    -----
+    For Python shared libs, `so_ext` will typically be '.so' on Linux and OS X,
+    and '.pyd' on Windows.  For Python >= 3.2 `so_ext` has a tag prepended on
+    POSIX systems according to PEP 3149.  For Python 3.2 this is implemented on
+    Linux, but not on OS X.
+
+    """
+    confvars = distutils.sysconfig.get_config_vars()
+    # SO is deprecated in 3.3.1, use EXT_SUFFIX instead
+    so_ext = confvars.get('EXT_SUFFIX', None)
+    if so_ext is None:
+        so_ext = confvars.get('SO', '')
+
+    if not is_python_ext:
+        # hardcode known values, config vars (including SHLIB_SUFFIX) are
+        # unreliable (see #3182)
+        # darwin, windows and debug linux are wrong in 3.3.1 and older
+        if (sys.platform.startswith('linux') or
+            sys.platform.startswith('gnukfreebsd')):
+            so_ext = '.so'
+        elif sys.platform.startswith('darwin'):
+            so_ext = '.dylib'
+        elif sys.platform.startswith('win'):
+            so_ext = '.dll'
+        else:
+            # fall back to config vars for unknown platforms
+            # fix long extension for Python >=3.2, see PEP 3149.
+            if 'SOABI' in confvars:
+                # Does nothing unless SOABI config var exists
+                so_ext = so_ext.replace('.' + confvars.get('SOABI'), '', 1)
+
+    return so_ext
+
+def get_data_files(data):
+    if is_string(data):
+        return [data]
+    sources = data[1]
+    filenames = []
+    for s in sources:
+        if hasattr(s, '__call__'):
+            continue
+        if is_local_src_dir(s):
+            filenames.extend(list(general_source_files(s)))
+        elif is_string(s):
+            if os.path.isfile(s):
+                filenames.append(s)
+            else:
+                print('Not existing data file:', s)
+        else:
+            raise TypeError(repr(s))
+    return filenames
+
+def dot_join(*args):
+    return '.'.join([a for a in args if a])
+
+def get_frame(level=0):
+    """Return frame object from call stack with given level.
+    """
+    try:
+        return sys._getframe(level+1)
+    except AttributeError:
+        frame = sys.exc_info()[2].tb_frame
+        for _ in range(level+1):
+            frame = frame.f_back
+        return frame
+
+
+######################
+
+class Configuration:
+
+    _list_keys = ['packages', 'ext_modules', 'data_files', 'include_dirs',
+                  'libraries', 'headers', 'scripts', 'py_modules',
+                  'installed_libraries', 'define_macros']
+    _dict_keys = ['package_dir', 'installed_pkg_config']
+    _extra_keys = ['name', 'version']
+
+    numpy_include_dirs = []
+
+    def __init__(self,
+                 package_name=None,
+                 parent_name=None,
+                 top_path=None,
+                 package_path=None,
+                 caller_level=1,
+                 setup_name='setup.py',
+                 **attrs):
+        """Construct configuration instance of a package.
+
+        package_name -- name of the package
+                        Ex.: 'distutils'
+        parent_name  -- name of the parent package
+                        Ex.: 'numpy'
+        top_path     -- directory of the toplevel package
+                        Ex.: the directory where the numpy package source sits
+        package_path -- directory of package. Will be computed by magic from the
+                        directory of the caller module if not specified
+                        Ex.: the directory where numpy.distutils is
+        caller_level -- frame level to caller namespace, internal parameter.
+        """
+        self.name = dot_join(parent_name, package_name)
+        self.version = None
+
+        caller_frame = get_frame(caller_level)
+        self.local_path = get_path_from_frame(caller_frame, top_path)
+        # local_path -- directory of a file (usually setup.py) that
+        #               defines a configuration() function.
+        # local_path -- directory of a file (usually setup.py) that
+        #               defines a configuration() function.
+        if top_path is None:
+            top_path = self.local_path
+            self.local_path = ''
+        if package_path is None:
+            package_path = self.local_path
+        elif os.path.isdir(njoin(self.local_path, package_path)):
+            package_path = njoin(self.local_path, package_path)
+        if not os.path.isdir(package_path or '.'):
+            raise ValueError("%r is not a directory" % (package_path,))
+        self.top_path = top_path
+        self.package_path = package_path
+        # this is the relative path in the installed package
+        self.path_in_package = os.path.join(*self.name.split('.'))
+
+        self.list_keys = self._list_keys[:]
+        self.dict_keys = self._dict_keys[:]
+
+        for n in self.list_keys:
+            v = copy.copy(attrs.get(n, []))
+            setattr(self, n, as_list(v))
+
+        for n in self.dict_keys:
+            v = copy.copy(attrs.get(n, {}))
+            setattr(self, n, v)
+
+        known_keys = self.list_keys + self.dict_keys
+        self.extra_keys = self._extra_keys[:]
+        for n in attrs.keys():
+            if n in known_keys:
+                continue
+            a = attrs[n]
+            setattr(self, n, a)
+            if isinstance(a, list):
+                self.list_keys.append(n)
+            elif isinstance(a, dict):
+                self.dict_keys.append(n)
+            else:
+                self.extra_keys.append(n)
+
+        if os.path.exists(njoin(package_path, '__init__.py')):
+            self.packages.append(self.name)
+            self.package_dir[self.name] = package_path
+
+        self.options = dict(
+            ignore_setup_xxx_py = False,
+            assume_default_configuration = False,
+            delegate_options_to_subpackages = False,
+            quiet = False,
+            )
+
+        caller_instance = None
+        for i in range(1, 3):
+            try:
+                f = get_frame(i)
+            except ValueError:
+                break
+            try:
+                caller_instance = eval('self', f.f_globals, f.f_locals)
+                break
+            except NameError:
+                pass
+        if isinstance(caller_instance, self.__class__):
+            if caller_instance.options['delegate_options_to_subpackages']:
+                self.set_options(**caller_instance.options)
+
+        self.setup_name = setup_name
+
+    def todict(self):
+        """
+        Return a dictionary compatible with the keyword arguments of distutils
+        setup function.
+
+        Examples
+        --------
+        >>> setup(**config.todict())                           #doctest: +SKIP
+        """
+
+        self._optimize_data_files()
+        d = {}
+        known_keys = self.list_keys + self.dict_keys + self.extra_keys
+        for n in known_keys:
+            a = getattr(self, n)
+            if a:
+                d[n] = a
+        return d
+
+    def info(self, message):
+        if not self.options['quiet']:
+            print(message)
+
+    def warn(self, message):
+        sys.stderr.write('Warning: %s\n' % (message,))
+
+    def set_options(self, **options):
+        """
+        Configure Configuration instance.
+
+        The following options are available:
+         - ignore_setup_xxx_py
+         - assume_default_configuration
+         - delegate_options_to_subpackages
+         - quiet
+
+        """
+        for key, value in options.items():
+            if key in self.options:
+                self.options[key] = value
+            else:
+                raise ValueError('Unknown option: '+key)
+
+    def get_distribution(self):
+        """Return the distutils distribution object for self."""
+        from numpy.distutils.core import get_distribution
+        return get_distribution()
+
+    def _wildcard_get_subpackage(self, subpackage_name,
+                                 parent_name,
+                                 caller_level = 1):
+        l = subpackage_name.split('.')
+        subpackage_path = njoin([self.local_path]+l)
+        dirs = [_m for _m in sorted_glob(subpackage_path) if os.path.isdir(_m)]
+        config_list = []
+        for d in dirs:
+            if not os.path.isfile(njoin(d, '__init__.py')):
+                continue
+            if 'build' in d.split(os.sep):
+                continue
+            n = '.'.join(d.split(os.sep)[-len(l):])
+            c = self.get_subpackage(n,
+                                    parent_name = parent_name,
+                                    caller_level = caller_level+1)
+            config_list.extend(c)
+        return config_list
+
+    def _get_configuration_from_setup_py(self, setup_py,
+                                         subpackage_name,
+                                         subpackage_path,
+                                         parent_name,
+                                         caller_level = 1):
+        # In case setup_py imports local modules:
+        sys.path.insert(0, os.path.dirname(setup_py))
+        try:
+            setup_name = os.path.splitext(os.path.basename(setup_py))[0]
+            n = dot_join(self.name, subpackage_name, setup_name)
+            setup_module = npy_load_module('_'.join(n.split('.')),
+                                           setup_py,
+                                           ('.py', 'U', 1))
+            if not hasattr(setup_module, 'configuration'):
+                if not self.options['assume_default_configuration']:
+                    self.warn('Assuming default configuration '\
+                              '(%s does not define configuration())'\
+                              % (setup_module))
+                config = Configuration(subpackage_name, parent_name,
+                                       self.top_path, subpackage_path,
+                                       caller_level = caller_level + 1)
+            else:
+                pn = dot_join(*([parent_name] + subpackage_name.split('.')[:-1]))
+                args = (pn,)
+                if setup_module.configuration.__code__.co_argcount > 1:
+                    args = args + (self.top_path,)
+                config = setup_module.configuration(*args)
+            if config.name!=dot_join(parent_name, subpackage_name):
+                self.warn('Subpackage %r configuration returned as %r' % \
+                          (dot_join(parent_name, subpackage_name), config.name))
+        finally:
+            del sys.path[0]
+        return config
+
+    def get_subpackage(self,subpackage_name,
+                       subpackage_path=None,
+                       parent_name=None,
+                       caller_level = 1):
+        """Return list of subpackage configurations.
+
+        Parameters
+        ----------
+        subpackage_name : str or None
+            Name of the subpackage to get the configuration. '*' in
+            subpackage_name is handled as a wildcard.
+        subpackage_path : str
+            If None, then the path is assumed to be the local path plus the
+            subpackage_name. If a setup.py file is not found in the
+            subpackage_path, then a default configuration is used.
+        parent_name : str
+            Parent name.
+        """
+        if subpackage_name is None:
+            if subpackage_path is None:
+                raise ValueError(
+                    "either subpackage_name or subpackage_path must be specified")
+            subpackage_name = os.path.basename(subpackage_path)
+
+        # handle wildcards
+        l = subpackage_name.split('.')
+        if subpackage_path is None and '*' in subpackage_name:
+            return self._wildcard_get_subpackage(subpackage_name,
+                                                 parent_name,
+                                                 caller_level = caller_level+1)
+        assert '*' not in subpackage_name, repr((subpackage_name, subpackage_path, parent_name))
+        if subpackage_path is None:
+            subpackage_path = njoin([self.local_path] + l)
+        else:
+            subpackage_path = njoin([subpackage_path] + l[:-1])
+            subpackage_path = self.paths([subpackage_path])[0]
+        setup_py = njoin(subpackage_path, self.setup_name)
+        if not self.options['ignore_setup_xxx_py']:
+            if not os.path.isfile(setup_py):
+                setup_py = njoin(subpackage_path,
+                                 'setup_%s.py' % (subpackage_name))
+        if not os.path.isfile(setup_py):
+            if not self.options['assume_default_configuration']:
+                self.warn('Assuming default configuration '\
+                          '(%s/{setup_%s,setup}.py was not found)' \
+                          % (os.path.dirname(setup_py), subpackage_name))
+            config = Configuration(subpackage_name, parent_name,
+                                   self.top_path, subpackage_path,
+                                   caller_level = caller_level+1)
+        else:
+            config = self._get_configuration_from_setup_py(
+                setup_py,
+                subpackage_name,
+                subpackage_path,
+                parent_name,
+                caller_level = caller_level + 1)
+        if config:
+            return [config]
+        else:
+            return []
+
+    def add_subpackage(self,subpackage_name,
+                       subpackage_path=None,
+                       standalone = False):
+        """Add a sub-package to the current Configuration instance.
+
+        This is useful in a setup.py script for adding sub-packages to a
+        package.
+
+        Parameters
+        ----------
+        subpackage_name : str
+            name of the subpackage
+        subpackage_path : str
+            if given, the subpackage path such as the subpackage is in
+            subpackage_path / subpackage_name. If None,the subpackage is
+            assumed to be located in the local path / subpackage_name.
+        standalone : bool
+        """
+
+        if standalone:
+            parent_name = None
+        else:
+            parent_name = self.name
+        config_list = self.get_subpackage(subpackage_name, subpackage_path,
+                                          parent_name = parent_name,
+                                          caller_level = 2)
+        if not config_list:
+            self.warn('No configuration returned, assuming unavailable.')
+        for config in config_list:
+            d = config
+            if isinstance(config, Configuration):
+                d = config.todict()
+            assert isinstance(d, dict), repr(type(d))
+
+            self.info('Appending %s configuration to %s' \
+                      % (d.get('name'), self.name))
+            self.dict_append(**d)
+
+        dist = self.get_distribution()
+        if dist is not None:
+            self.warn('distutils distribution has been initialized,'\
+                      ' it may be too late to add a subpackage '+ subpackage_name)
+
+    def add_data_dir(self, data_path):
+        """Recursively add files under data_path to data_files list.
+
+        Recursively add files under data_path to the list of data_files to be
+        installed (and distributed). The data_path can be either a relative
+        path-name, or an absolute path-name, or a 2-tuple where the first
+        argument shows where in the install directory the data directory
+        should be installed to.
+
+        Parameters
+        ----------
+        data_path : seq or str
+            Argument can be either
+
+                * 2-sequence (<datadir suffix>, <path to data directory>)
+                * path to data directory where python datadir suffix defaults
+                  to package dir.
+
+        Notes
+        -----
+        Rules for installation paths::
+
+            foo/bar -> (foo/bar, foo/bar) -> parent/foo/bar
+            (gun, foo/bar) -> parent/gun
+            foo/* -> (foo/a, foo/a), (foo/b, foo/b) -> parent/foo/a, parent/foo/b
+            (gun, foo/*) -> (gun, foo/a), (gun, foo/b) -> gun
+            (gun/*, foo/*) -> parent/gun/a, parent/gun/b
+            /foo/bar -> (bar, /foo/bar) -> parent/bar
+            (gun, /foo/bar) -> parent/gun
+            (fun/*/gun/*, sun/foo/bar) -> parent/fun/foo/gun/bar
+
+        Examples
+        --------
+        For example suppose the source directory contains fun/foo.dat and
+        fun/bar/car.dat:
+
+        >>> self.add_data_dir('fun')                       #doctest: +SKIP
+        >>> self.add_data_dir(('sun', 'fun'))              #doctest: +SKIP
+        >>> self.add_data_dir(('gun', '/full/path/to/fun'))#doctest: +SKIP
+
+        Will install data-files to the locations::
+
+            <package install directory>/
+              fun/
+                foo.dat
+                bar/
+                  car.dat
+              sun/
+                foo.dat
+                bar/
+                  car.dat
+              gun/
+                foo.dat
+                car.dat
+
+        """
+        if is_sequence(data_path):
+            d, data_path = data_path
+        else:
+            d = None
+        if is_sequence(data_path):
+            [self.add_data_dir((d, p)) for p in data_path]
+            return
+        if not is_string(data_path):
+            raise TypeError("not a string: %r" % (data_path,))
+        if d is None:
+            if os.path.isabs(data_path):
+                return self.add_data_dir((os.path.basename(data_path), data_path))
+            return self.add_data_dir((data_path, data_path))
+        paths = self.paths(data_path, include_non_existing=False)
+        if is_glob_pattern(data_path):
+            if is_glob_pattern(d):
+                pattern_list = allpath(d).split(os.sep)
+                pattern_list.reverse()
+                # /a/*//b/ -> /a/*/b
+                rl = list(range(len(pattern_list)-1)); rl.reverse()
+                for i in rl:
+                    if not pattern_list[i]:
+                        del pattern_list[i]
+                #
+                for path in paths:
+                    if not os.path.isdir(path):
+                        print('Not a directory, skipping', path)
+                        continue
+                    rpath = rel_path(path, self.local_path)
+                    path_list = rpath.split(os.sep)
+                    path_list.reverse()
+                    target_list = []
+                    i = 0
+                    for s in pattern_list:
+                        if is_glob_pattern(s):
+                            if i>=len(path_list):
+                                raise ValueError('cannot fill pattern %r with %r' \
+                                      % (d, path))
+                            target_list.append(path_list[i])
+                        else:
+                            assert s==path_list[i], repr((s, path_list[i], data_path, d, path, rpath))
+                            target_list.append(s)
+                        i += 1
+                    if path_list[i:]:
+                        self.warn('mismatch of pattern_list=%s and path_list=%s'\
+                                  % (pattern_list, path_list))
+                    target_list.reverse()
+                    self.add_data_dir((os.sep.join(target_list), path))
+            else:
+                for path in paths:
+                    self.add_data_dir((d, path))
+            return
+        assert not is_glob_pattern(d), repr(d)
+
+        dist = self.get_distribution()
+        if dist is not None and dist.data_files is not None:
+            data_files = dist.data_files
+        else:
+            data_files = self.data_files
+
+        for path in paths:
+            for d1, f in list(general_source_directories_files(path)):
+                target_path = os.path.join(self.path_in_package, d, d1)
+                data_files.append((target_path, f))
+
+    def _optimize_data_files(self):
+        data_dict = {}
+        for p, files in self.data_files:
+            if p not in data_dict:
+                data_dict[p] = set()
+            for f in files:
+                data_dict[p].add(f)
+        self.data_files[:] = [(p, list(files)) for p, files in data_dict.items()]
+
+    def add_data_files(self,*files):
+        """Add data files to configuration data_files.
+
+        Parameters
+        ----------
+        files : sequence
+            Argument(s) can be either
+
+                * 2-sequence (<datadir prefix>,<path to data file(s)>)
+                * paths to data files where python datadir prefix defaults
+                  to package dir.
+
+        Notes
+        -----
+        The form of each element of the files sequence is very flexible
+        allowing many combinations of where to get the files from the package
+        and where they should ultimately be installed on the system. The most
+        basic usage is for an element of the files argument sequence to be a
+        simple filename. This will cause that file from the local path to be
+        installed to the installation path of the self.name package (package
+        path). The file argument can also be a relative path in which case the
+        entire relative path will be installed into the package directory.
+        Finally, the file can be an absolute path name in which case the file
+        will be found at the absolute path name but installed to the package
+        path.
+
+        This basic behavior can be augmented by passing a 2-tuple in as the
+        file argument. The first element of the tuple should specify the
+        relative path (under the package install directory) where the
+        remaining sequence of files should be installed to (it has nothing to
+        do with the file-names in the source distribution). The second element
+        of the tuple is the sequence of files that should be installed. The
+        files in this sequence can be filenames, relative paths, or absolute
+        paths. For absolute paths the file will be installed in the top-level
+        package installation directory (regardless of the first argument).
+        Filenames and relative path names will be installed in the package
+        install directory under the path name given as the first element of
+        the tuple.
+
+        Rules for installation paths:
+
+          #. file.txt -> (., file.txt)-> parent/file.txt
+          #. foo/file.txt -> (foo, foo/file.txt) -> parent/foo/file.txt
+          #. /foo/bar/file.txt -> (., /foo/bar/file.txt) -> parent/file.txt
+          #. ``*``.txt -> parent/a.txt, parent/b.txt
+          #. foo/``*``.txt`` -> parent/foo/a.txt, parent/foo/b.txt
+          #. ``*/*.txt`` -> (``*``, ``*``/``*``.txt) -> parent/c/a.txt, parent/d/b.txt
+          #. (sun, file.txt) -> parent/sun/file.txt
+          #. (sun, bar/file.txt) -> parent/sun/file.txt
+          #. (sun, /foo/bar/file.txt) -> parent/sun/file.txt
+          #. (sun, ``*``.txt) -> parent/sun/a.txt, parent/sun/b.txt
+          #. (sun, bar/``*``.txt) -> parent/sun/a.txt, parent/sun/b.txt
+          #. (sun/``*``, ``*``/``*``.txt) -> parent/sun/c/a.txt, parent/d/b.txt
+
+        An additional feature is that the path to a data-file can actually be
+        a function that takes no arguments and returns the actual path(s) to
+        the data-files. This is useful when the data files are generated while
+        building the package.
+
+        Examples
+        --------
+        Add files to the list of data_files to be included with the package.
+
+            >>> self.add_data_files('foo.dat',
+            ...     ('fun', ['gun.dat', 'nun/pun.dat', '/tmp/sun.dat']),
+            ...     'bar/cat.dat',
+            ...     '/full/path/to/can.dat')                   #doctest: +SKIP
+
+        will install these data files to::
+
+            <package install directory>/
+             foo.dat
+             fun/
+               gun.dat
+               nun/
+                 pun.dat
+             sun.dat
+             bar/
+               car.dat
+             can.dat
+
+        where <package install directory> is the package (or sub-package)
+        directory such as '/usr/lib/python2.4/site-packages/mypackage' ('C:
+        \\Python2.4 \\Lib \\site-packages \\mypackage') or
+        '/usr/lib/python2.4/site- packages/mypackage/mysubpackage' ('C:
+        \\Python2.4 \\Lib \\site-packages \\mypackage \\mysubpackage').
+        """
+
+        if len(files)>1:
+            for f in files:
+                self.add_data_files(f)
+            return
+        assert len(files)==1
+        if is_sequence(files[0]):
+            d, files = files[0]
+        else:
+            d = None
+        if is_string(files):
+            filepat = files
+        elif is_sequence(files):
+            if len(files)==1:
+                filepat = files[0]
+            else:
+                for f in files:
+                    self.add_data_files((d, f))
+                return
+        else:
+            raise TypeError(repr(type(files)))
+
+        if d is None:
+            if hasattr(filepat, '__call__'):
+                d = ''
+            elif os.path.isabs(filepat):
+                d = ''
+            else:
+                d = os.path.dirname(filepat)
+            self.add_data_files((d, files))
+            return
+
+        paths = self.paths(filepat, include_non_existing=False)
+        if is_glob_pattern(filepat):
+            if is_glob_pattern(d):
+                pattern_list = d.split(os.sep)
+                pattern_list.reverse()
+                for path in paths:
+                    path_list = path.split(os.sep)
+                    path_list.reverse()
+                    path_list.pop() # filename
+                    target_list = []
+                    i = 0
+                    for s in pattern_list:
+                        if is_glob_pattern(s):
+                            target_list.append(path_list[i])
+                            i += 1
+                        else:
+                            target_list.append(s)
+                    target_list.reverse()
+                    self.add_data_files((os.sep.join(target_list), path))
+            else:
+                self.add_data_files((d, paths))
+            return
+        assert not is_glob_pattern(d), repr((d, filepat))
+
+        dist = self.get_distribution()
+        if dist is not None and dist.data_files is not None:
+            data_files = dist.data_files
+        else:
+            data_files = self.data_files
+
+        data_files.append((os.path.join(self.path_in_package, d), paths))
+
+    ### XXX Implement add_py_modules
+
+    def add_define_macros(self, macros):
+        """Add define macros to configuration
+
+        Add the given sequence of macro name and value duples to the beginning
+        of the define_macros list This list will be visible to all extension
+        modules of the current package.
+        """
+        dist = self.get_distribution()
+        if dist is not None:
+            if not hasattr(dist, 'define_macros'):
+                dist.define_macros = []
+            dist.define_macros.extend(macros)
+        else:
+            self.define_macros.extend(macros)
+
+
+    def add_include_dirs(self,*paths):
+        """Add paths to configuration include directories.
+
+        Add the given sequence of paths to the beginning of the include_dirs
+        list. This list will be visible to all extension modules of the
+        current package.
+        """
+        include_dirs = self.paths(paths)
+        dist = self.get_distribution()
+        if dist is not None:
+            if dist.include_dirs is None:
+                dist.include_dirs = []
+            dist.include_dirs.extend(include_dirs)
+        else:
+            self.include_dirs.extend(include_dirs)
+
+    def add_headers(self,*files):
+        """Add installable headers to configuration.
+
+        Add the given sequence of files to the beginning of the headers list.
+        By default, headers will be installed under <python-
+        include>/<self.name.replace('.','/')>/ directory. If an item of files
+        is a tuple, then its first argument specifies the actual installation
+        location relative to the <python-include> path.
+
+        Parameters
+        ----------
+        files : str or seq
+            Argument(s) can be either:
+
+                * 2-sequence (<includedir suffix>,<path to header file(s)>)
+                * path(s) to header file(s) where python includedir suffix will
+                  default to package name.
+        """
+        headers = []
+        for path in files:
+            if is_string(path):
+                [headers.append((self.name, p)) for p in self.paths(path)]
+            else:
+                if not isinstance(path, (tuple, list)) or len(path) != 2:
+                    raise TypeError(repr(path))
+                [headers.append((path[0], p)) for p in self.paths(path[1])]
+        dist = self.get_distribution()
+        if dist is not None:
+            if dist.headers is None:
+                dist.headers = []
+            dist.headers.extend(headers)
+        else:
+            self.headers.extend(headers)
+
+    def paths(self,*paths,**kws):
+        """Apply glob to paths and prepend local_path if needed.
+
+        Applies glob.glob(...) to each path in the sequence (if needed) and
+        pre-pends the local_path if needed. Because this is called on all
+        source lists, this allows wildcard characters to be specified in lists
+        of sources for extension modules and libraries and scripts and allows
+        path-names be relative to the source directory.
+
+        """
+        include_non_existing = kws.get('include_non_existing', True)
+        return gpaths(paths,
+                      local_path = self.local_path,
+                      include_non_existing=include_non_existing)
+
+    def _fix_paths_dict(self, kw):
+        for k in kw.keys():
+            v = kw[k]
+            if k in ['sources', 'depends', 'include_dirs', 'library_dirs',
+                     'module_dirs', 'extra_objects']:
+                new_v = self.paths(v)
+                kw[k] = new_v
+
+    def add_extension(self,name,sources,**kw):
+        """Add extension to configuration.
+
+        Create and add an Extension instance to the ext_modules list. This
+        method also takes the following optional keyword arguments that are
+        passed on to the Extension constructor.
+
+        Parameters
+        ----------
+        name : str
+            name of the extension
+        sources : seq
+            list of the sources. The list of sources may contain functions
+            (called source generators) which must take an extension instance
+            and a build directory as inputs and return a source file or list of
+            source files or None. If None is returned then no sources are
+            generated. If the Extension instance has no sources after
+            processing all source generators, then no extension module is
+            built.
+        include_dirs :
+        define_macros :
+        undef_macros :
+        library_dirs :
+        libraries :
+        runtime_library_dirs :
+        extra_objects :
+        extra_compile_args :
+        extra_link_args :
+        extra_f77_compile_args :
+        extra_f90_compile_args :
+        export_symbols :
+        swig_opts :
+        depends :
+            The depends list contains paths to files or directories that the
+            sources of the extension module depend on. If any path in the
+            depends list is newer than the extension module, then the module
+            will be rebuilt.
+        language :
+        f2py_options :
+        module_dirs :
+        extra_info : dict or list
+            dict or list of dict of keywords to be appended to keywords.
+
+        Notes
+        -----
+        The self.paths(...) method is applied to all lists that may contain
+        paths.
+        """
+        ext_args = copy.copy(kw)
+        ext_args['name'] = dot_join(self.name, name)
+        ext_args['sources'] = sources
+
+        if 'extra_info' in ext_args:
+            extra_info = ext_args['extra_info']
+            del ext_args['extra_info']
+            if isinstance(extra_info, dict):
+                extra_info = [extra_info]
+            for info in extra_info:
+                assert isinstance(info, dict), repr(info)
+                dict_append(ext_args,**info)
+
+        self._fix_paths_dict(ext_args)
+
+        # Resolve out-of-tree dependencies
+        libraries = ext_args.get('libraries', [])
+        libnames = []
+        ext_args['libraries'] = []
+        for libname in libraries:
+            if isinstance(libname, tuple):
+                self._fix_paths_dict(libname[1])
+
+            # Handle library names of the form libname@relative/path/to/library
+            if '@' in libname:
+                lname, lpath = libname.split('@', 1)
+                lpath = os.path.abspath(njoin(self.local_path, lpath))
+                if os.path.isdir(lpath):
+                    c = self.get_subpackage(None, lpath,
+                                            caller_level = 2)
+                    if isinstance(c, Configuration):
+                        c = c.todict()
+                    for l in [l[0] for l in c.get('libraries', [])]:
+                        llname = l.split('__OF__', 1)[0]
+                        if llname == lname:
+                            c.pop('name', None)
+                            dict_append(ext_args,**c)
+                            break
+                    continue
+            libnames.append(libname)
+
+        ext_args['libraries'] = libnames + ext_args['libraries']
+        ext_args['define_macros'] = \
+            self.define_macros + ext_args.get('define_macros', [])
+
+        from numpy.distutils.core import Extension
+        ext = Extension(**ext_args)
+        self.ext_modules.append(ext)
+
+        dist = self.get_distribution()
+        if dist is not None:
+            self.warn('distutils distribution has been initialized,'\
+                      ' it may be too late to add an extension '+name)
+        return ext
+
+    def add_library(self,name,sources,**build_info):
+        """
+        Add library to configuration.
+
+        Parameters
+        ----------
+        name : str
+            Name of the extension.
+        sources : sequence
+            List of the sources. The list of sources may contain functions
+            (called source generators) which must take an extension instance
+            and a build directory as inputs and return a source file or list of
+            source files or None. If None is returned then no sources are
+            generated. If the Extension instance has no sources after
+            processing all source generators, then no extension module is
+            built.
+        build_info : dict, optional
+            The following keys are allowed:
+
+                * depends
+                * macros
+                * include_dirs
+                * extra_compiler_args
+                * extra_f77_compile_args
+                * extra_f90_compile_args
+                * f2py_options
+                * language
+
+        """
+        self._add_library(name, sources, None, build_info)
+
+        dist = self.get_distribution()
+        if dist is not None:
+            self.warn('distutils distribution has been initialized,'\
+                      ' it may be too late to add a library '+ name)
+
+    def _add_library(self, name, sources, install_dir, build_info):
+        """Common implementation for add_library and add_installed_library. Do
+        not use directly"""
+        build_info = copy.copy(build_info)
+        build_info['sources'] = sources
+
+        # Sometimes, depends is not set up to an empty list by default, and if
+        # depends is not given to add_library, distutils barfs (#1134)
+        if not 'depends' in build_info:
+            build_info['depends'] = []
+
+        self._fix_paths_dict(build_info)
+
+        # Add to libraries list so that it is build with build_clib
+        self.libraries.append((name, build_info))
+
+    def add_installed_library(self, name, sources, install_dir, build_info=None):
+        """
+        Similar to add_library, but the specified library is installed.
+
+        Most C libraries used with `distutils` are only used to build python
+        extensions, but libraries built through this method will be installed
+        so that they can be reused by third-party packages.
+
+        Parameters
+        ----------
+        name : str
+            Name of the installed library.
+        sources : sequence
+            List of the library's source files. See `add_library` for details.
+        install_dir : str
+            Path to install the library, relative to the current sub-package.
+        build_info : dict, optional
+            The following keys are allowed:
+
+                * depends
+                * macros
+                * include_dirs
+                * extra_compiler_args
+                * extra_f77_compile_args
+                * extra_f90_compile_args
+                * f2py_options
+                * language
+
+        Returns
+        -------
+        None
+
+        See Also
+        --------
+        add_library, add_npy_pkg_config, get_info
+
+        Notes
+        -----
+        The best way to encode the options required to link against the specified
+        C libraries is to use a "libname.ini" file, and use `get_info` to
+        retrieve the required options (see `add_npy_pkg_config` for more
+        information).
+
+        """
+        if not build_info:
+            build_info = {}
+
+        install_dir = os.path.join(self.package_path, install_dir)
+        self._add_library(name, sources, install_dir, build_info)
+        self.installed_libraries.append(InstallableLib(name, build_info, install_dir))
+
+    def add_npy_pkg_config(self, template, install_dir, subst_dict=None):
+        """
+        Generate and install a npy-pkg config file from a template.
+
+        The config file generated from `template` is installed in the
+        given install directory, using `subst_dict` for variable substitution.
+
+        Parameters
+        ----------
+        template : str
+            The path of the template, relatively to the current package path.
+        install_dir : str
+            Where to install the npy-pkg config file, relatively to the current
+            package path.
+        subst_dict : dict, optional
+            If given, any string of the form ``@key@`` will be replaced by
+            ``subst_dict[key]`` in the template file when installed. The install
+            prefix is always available through the variable ``@prefix@``, since the
+            install prefix is not easy to get reliably from setup.py.
+
+        See also
+        --------
+        add_installed_library, get_info
+
+        Notes
+        -----
+        This works for both standard installs and in-place builds, i.e. the
+        ``@prefix@`` refer to the source directory for in-place builds.
+
+        Examples
+        --------
+        ::
+
+            config.add_npy_pkg_config('foo.ini.in', 'lib', {'foo': bar})
+
+        Assuming the foo.ini.in file has the following content::
+
+            [meta]
+            Name=@foo@
+            Version=1.0
+            Description=dummy description
+
+            [default]
+            Cflags=-I@prefix@/include
+            Libs=
+
+        The generated file will have the following content::
+
+            [meta]
+            Name=bar
+            Version=1.0
+            Description=dummy description
+
+            [default]
+            Cflags=-Iprefix_dir/include
+            Libs=
+
+        and will be installed as foo.ini in the 'lib' subpath.
+
+        When cross-compiling with numpy distutils, it might be necessary to
+        use modified npy-pkg-config files.  Using the default/generated files
+        will link with the host libraries (i.e. libnpymath.a).  For
+        cross-compilation you of-course need to link with target libraries,
+        while using the host Python installation.
+
+        You can copy out the numpy/core/lib/npy-pkg-config directory, add a
+        pkgdir value to the .ini files and set NPY_PKG_CONFIG_PATH environment
+        variable to point to the directory with the modified npy-pkg-config
+        files.
+
+        Example npymath.ini modified for cross-compilation::
+
+            [meta]
+            Name=npymath
+            Description=Portable, core math library implementing C99 standard
+            Version=0.1
+
+            [variables]
+            pkgname=numpy.core
+            pkgdir=/build/arm-linux-gnueabi/sysroot/usr/lib/python3.7/site-packages/numpy/core
+            prefix=${pkgdir}
+            libdir=${prefix}/lib
+            includedir=${prefix}/include
+
+            [default]
+            Libs=-L${libdir} -lnpymath
+            Cflags=-I${includedir}
+            Requires=mlib
+
+            [msvc]
+            Libs=/LIBPATH:${libdir} npymath.lib
+            Cflags=/INCLUDE:${includedir}
+            Requires=mlib
+
+        """
+        if subst_dict is None:
+            subst_dict = {}
+        template = os.path.join(self.package_path, template)
+
+        if self.name in self.installed_pkg_config:
+            self.installed_pkg_config[self.name].append((template, install_dir,
+                subst_dict))
+        else:
+            self.installed_pkg_config[self.name] = [(template, install_dir,
+                subst_dict)]
+
+
+    def add_scripts(self,*files):
+        """Add scripts to configuration.
+
+        Add the sequence of files to the beginning of the scripts list.
+        Scripts will be installed under the <prefix>/bin/ directory.
+
+        """
+        scripts = self.paths(files)
+        dist = self.get_distribution()
+        if dist is not None:
+            if dist.scripts is None:
+                dist.scripts = []
+            dist.scripts.extend(scripts)
+        else:
+            self.scripts.extend(scripts)
+
+    def dict_append(self,**dict):
+        for key in self.list_keys:
+            a = getattr(self, key)
+            a.extend(dict.get(key, []))
+        for key in self.dict_keys:
+            a = getattr(self, key)
+            a.update(dict.get(key, {}))
+        known_keys = self.list_keys + self.dict_keys + self.extra_keys
+        for key in dict.keys():
+            if key not in known_keys:
+                a = getattr(self, key, None)
+                if a and a==dict[key]: continue
+                self.warn('Inheriting attribute %r=%r from %r' \
+                          % (key, dict[key], dict.get('name', '?')))
+                setattr(self, key, dict[key])
+                self.extra_keys.append(key)
+            elif key in self.extra_keys:
+                self.info('Ignoring attempt to set %r (from %r to %r)' \
+                          % (key, getattr(self, key), dict[key]))
+            elif key in known_keys:
+                # key is already processed above
+                pass
+            else:
+                raise ValueError("Don't know about key=%r" % (key))
+
+    def __str__(self):
+        from pprint import pformat
+        known_keys = self.list_keys + self.dict_keys + self.extra_keys
+        s = '<'+5*'-' + '\n'
+        s += 'Configuration of '+self.name+':\n'
+        known_keys.sort()
+        for k in known_keys:
+            a = getattr(self, k, None)
+            if a:
+                s += '%s = %s\n' % (k, pformat(a))
+        s += 5*'-' + '>'
+        return s
+
+    def get_config_cmd(self):
+        """
+        Returns the numpy.distutils config command instance.
+        """
+        cmd = get_cmd('config')
+        cmd.ensure_finalized()
+        cmd.dump_source = 0
+        cmd.noisy = 0
+        old_path = os.environ.get('PATH')
+        if old_path:
+            path = os.pathsep.join(['.', old_path])
+            os.environ['PATH'] = path
+        return cmd
+
+    def get_build_temp_dir(self):
+        """
+        Return a path to a temporary directory where temporary files should be
+        placed.
+        """
+        cmd = get_cmd('build')
+        cmd.ensure_finalized()
+        return cmd.build_temp
+
+    def have_f77c(self):
+        """Check for availability of Fortran 77 compiler.
+
+        Use it inside source generating function to ensure that
+        setup distribution instance has been initialized.
+
+        Notes
+        -----
+        True if a Fortran 77 compiler is available (because a simple Fortran 77
+        code was able to be compiled successfully).
+        """
+        simple_fortran_subroutine = '''
+        subroutine simple
+        end
+        '''
+        config_cmd = self.get_config_cmd()
+        flag = config_cmd.try_compile(simple_fortran_subroutine, lang='f77')
+        return flag
+
+    def have_f90c(self):
+        """Check for availability of Fortran 90 compiler.
+
+        Use it inside source generating function to ensure that
+        setup distribution instance has been initialized.
+
+        Notes
+        -----
+        True if a Fortran 90 compiler is available (because a simple Fortran
+        90 code was able to be compiled successfully)
+        """
+        simple_fortran_subroutine = '''
+        subroutine simple
+        end
+        '''
+        config_cmd = self.get_config_cmd()
+        flag = config_cmd.try_compile(simple_fortran_subroutine, lang='f90')
+        return flag
+
+    def append_to(self, extlib):
+        """Append libraries, include_dirs to extension or library item.
+        """
+        if is_sequence(extlib):
+            lib_name, build_info = extlib
+            dict_append(build_info,
+                        libraries=self.libraries,
+                        include_dirs=self.include_dirs)
+        else:
+            from numpy.distutils.core import Extension
+            assert isinstance(extlib, Extension), repr(extlib)
+            extlib.libraries.extend(self.libraries)
+            extlib.include_dirs.extend(self.include_dirs)
+
+    def _get_svn_revision(self, path):
+        """Return path's SVN revision number.
+        """
+        try:
+            output = subprocess.check_output(['svnversion'], cwd=path)
+        except (subprocess.CalledProcessError, OSError):
+            pass
+        else:
+            m = re.match(rb'(?P<revision>\d+)', output)
+            if m:
+                return int(m.group('revision'))
+
+        if sys.platform=='win32' and os.environ.get('SVN_ASP_DOT_NET_HACK', None):
+            entries = njoin(path, '_svn', 'entries')
+        else:
+            entries = njoin(path, '.svn', 'entries')
+        if os.path.isfile(entries):
+            with open(entries) as f:
+                fstr = f.read()
+            if fstr[:5] == '<?xml':  # pre 1.4
+                m = re.search(r'revision="(?P<revision>\d+)"', fstr)
+                if m:
+                    return int(m.group('revision'))
+            else:  # non-xml entries file --- check to be sure that
+                m = re.search(r'dir[\n\r]+(?P<revision>\d+)', fstr)
+                if m:
+                    return int(m.group('revision'))
+        return None
+
+    def _get_hg_revision(self, path):
+        """Return path's Mercurial revision number.
+        """
+        try:
+            output = subprocess.check_output(
+                ['hg', 'identify', '--num'], cwd=path)
+        except (subprocess.CalledProcessError, OSError):
+            pass
+        else:
+            m = re.match(rb'(?P<revision>\d+)', output)
+            if m:
+                return int(m.group('revision'))
+
+        branch_fn = njoin(path, '.hg', 'branch')
+        branch_cache_fn = njoin(path, '.hg', 'branch.cache')
+
+        if os.path.isfile(branch_fn):
+            branch0 = None
+            with open(branch_fn) as f:
+                revision0 = f.read().strip()
+
+            branch_map = {}
+            for line in file(branch_cache_fn, 'r'):
+                branch1, revision1  = line.split()[:2]
+                if revision1==revision0:
+                    branch0 = branch1
+                try:
+                    revision1 = int(revision1)
+                except ValueError:
+                    continue
+                branch_map[branch1] = revision1
+
+            return branch_map.get(branch0)
+
+        return None
+
+
+    def get_version(self, version_file=None, version_variable=None):
+        """Try to get version string of a package.
+
+        Return a version string of the current package or None if the version
+        information could not be detected.
+
+        Notes
+        -----
+        This method scans files named
+        __version__.py, <packagename>_version.py, version.py, and
+        __svn_version__.py for string variables version, __version__, and
+        <packagename>_version, until a version number is found.
+        """
+        version = getattr(self, 'version', None)
+        if version is not None:
+            return version
+
+        # Get version from version file.
+        if version_file is None:
+            files = ['__version__.py',
+                     self.name.split('.')[-1]+'_version.py',
+                     'version.py',
+                     '__svn_version__.py',
+                     '__hg_version__.py']
+        else:
+            files = [version_file]
+        if version_variable is None:
+            version_vars = ['version',
+                            '__version__',
+                            self.name.split('.')[-1]+'_version']
+        else:
+            version_vars = [version_variable]
+        for f in files:
+            fn = njoin(self.local_path, f)
+            if os.path.isfile(fn):
+                info = ('.py', 'U', 1)
+                name = os.path.splitext(os.path.basename(fn))[0]
+                n = dot_join(self.name, name)
+                try:
+                    version_module = npy_load_module('_'.join(n.split('.')),
+                                                     fn, info)
+                except ImportError as e:
+                    self.warn(str(e))
+                    version_module = None
+                if version_module is None:
+                    continue
+
+                for a in version_vars:
+                    version = getattr(version_module, a, None)
+                    if version is not None:
+                        break
+                if version is not None:
+                    break
+
+        if version is not None:
+            self.version = version
+            return version
+
+        # Get version as SVN or Mercurial revision number
+        revision = self._get_svn_revision(self.local_path)
+        if revision is None:
+            revision = self._get_hg_revision(self.local_path)
+
+        if revision is not None:
+            version = str(revision)
+            self.version = version
+
+        return version
+
+    def make_svn_version_py(self, delete=True):
+        """Appends a data function to the data_files list that will generate
+        __svn_version__.py file to the current package directory.
+
+        Generate package __svn_version__.py file from SVN revision number,
+        it will be removed after python exits but will be available
+        when sdist, etc commands are executed.
+
+        Notes
+        -----
+        If __svn_version__.py existed before, nothing is done.
+
+        This is
+        intended for working with source directories that are in an SVN
+        repository.
+        """
+        target = njoin(self.local_path, '__svn_version__.py')
+        revision = self._get_svn_revision(self.local_path)
+        if os.path.isfile(target) or revision is None:
+            return
+        else:
+            def generate_svn_version_py():
+                if not os.path.isfile(target):
+                    version = str(revision)
+                    self.info('Creating %s (version=%r)' % (target, version))
+                    with open(target, 'w') as f:
+                        f.write('version = %r\n' % (version))
+
+                def rm_file(f=target,p=self.info):
+                    if delete:
+                        try: os.remove(f); p('removed '+f)
+                        except OSError: pass
+                        try: os.remove(f+'c'); p('removed '+f+'c')
+                        except OSError: pass
+
+                atexit.register(rm_file)
+
+                return target
+
+            self.add_data_files(('', generate_svn_version_py()))
+
+    def make_hg_version_py(self, delete=True):
+        """Appends a data function to the data_files list that will generate
+        __hg_version__.py file to the current package directory.
+
+        Generate package __hg_version__.py file from Mercurial revision,
+        it will be removed after python exits but will be available
+        when sdist, etc commands are executed.
+
+        Notes
+        -----
+        If __hg_version__.py existed before, nothing is done.
+
+        This is intended for working with source directories that are
+        in an Mercurial repository.
+        """
+        target = njoin(self.local_path, '__hg_version__.py')
+        revision = self._get_hg_revision(self.local_path)
+        if os.path.isfile(target) or revision is None:
+            return
+        else:
+            def generate_hg_version_py():
+                if not os.path.isfile(target):
+                    version = str(revision)
+                    self.info('Creating %s (version=%r)' % (target, version))
+                    with open(target, 'w') as f:
+                        f.write('version = %r\n' % (version))
+
+                def rm_file(f=target,p=self.info):
+                    if delete:
+                        try: os.remove(f); p('removed '+f)
+                        except OSError: pass
+                        try: os.remove(f+'c'); p('removed '+f+'c')
+                        except OSError: pass
+
+                atexit.register(rm_file)
+
+                return target
+
+            self.add_data_files(('', generate_hg_version_py()))
+
+    def make_config_py(self,name='__config__'):
+        """Generate package __config__.py file containing system_info
+        information used during building the package.
+
+        This file is installed to the
+        package installation directory.
+
+        """
+        self.py_modules.append((self.name, name, generate_config_py))
+
+    def get_info(self,*names):
+        """Get resources information.
+
+        Return information (from system_info.get_info) for all of the names in
+        the argument list in a single dictionary.
+        """
+        from .system_info import get_info, dict_append
+        info_dict = {}
+        for a in names:
+            dict_append(info_dict,**get_info(a))
+        return info_dict
+
+
+def get_cmd(cmdname, _cache={}):
+    if cmdname not in _cache:
+        import distutils.core
+        dist = distutils.core._setup_distribution
+        if dist is None:
+            from distutils.errors import DistutilsInternalError
+            raise DistutilsInternalError(
+                  'setup distribution instance not initialized')
+        cmd = dist.get_command_obj(cmdname)
+        _cache[cmdname] = cmd
+    return _cache[cmdname]
+
+def get_numpy_include_dirs():
+    # numpy_include_dirs are set by numpy/core/setup.py, otherwise []
+    include_dirs = Configuration.numpy_include_dirs[:]
+    if not include_dirs:
+        import numpy
+        include_dirs = [ numpy.get_include() ]
+    # else running numpy/core/setup.py
+    return include_dirs
+
+def get_npy_pkg_dir():
+    """Return the path where to find the npy-pkg-config directory.
+
+    If the NPY_PKG_CONFIG_PATH environment variable is set, the value of that
+    is returned.  Otherwise, a path inside the location of the numpy module is
+    returned.
+
+    The NPY_PKG_CONFIG_PATH can be useful when cross-compiling, maintaining
+    customized npy-pkg-config .ini files for the cross-compilation
+    environment, and using them when cross-compiling.
+
+    """
+    # XXX: import here for bootstrapping reasons
+    import numpy
+    d = os.environ.get('NPY_PKG_CONFIG_PATH')
+    if d is not None:
+        return d
+    d = os.path.join(os.path.dirname(numpy.__file__),
+            'core', 'lib', 'npy-pkg-config')
+    return d
+
+def get_pkg_info(pkgname, dirs=None):
+    """
+    Return library info for the given package.
+
+    Parameters
+    ----------
+    pkgname : str
+        Name of the package (should match the name of the .ini file, without
+        the extension, e.g. foo for the file foo.ini).
+    dirs : sequence, optional
+        If given, should be a sequence of additional directories where to look
+        for npy-pkg-config files. Those directories are searched prior to the
+        NumPy directory.
+
+    Returns
+    -------
+    pkginfo : class instance
+        The `LibraryInfo` instance containing the build information.
+
+    Raises
+    ------
+    PkgNotFound
+        If the package is not found.
+
+    See Also
+    --------
+    Configuration.add_npy_pkg_config, Configuration.add_installed_library,
+    get_info
+
+    """
+    from numpy.distutils.npy_pkg_config import read_config
+
+    if dirs:
+        dirs.append(get_npy_pkg_dir())
+    else:
+        dirs = [get_npy_pkg_dir()]
+    return read_config(pkgname, dirs)
+
+def get_info(pkgname, dirs=None):
+    """
+    Return an info dict for a given C library.
+
+    The info dict contains the necessary options to use the C library.
+
+    Parameters
+    ----------
+    pkgname : str
+        Name of the package (should match the name of the .ini file, without
+        the extension, e.g. foo for the file foo.ini).
+    dirs : sequence, optional
+        If given, should be a sequence of additional directories where to look
+        for npy-pkg-config files. Those directories are searched prior to the
+        NumPy directory.
+
+    Returns
+    -------
+    info : dict
+        The dictionary with build information.
+
+    Raises
+    ------
+    PkgNotFound
+        If the package is not found.
+
+    See Also
+    --------
+    Configuration.add_npy_pkg_config, Configuration.add_installed_library,
+    get_pkg_info
+
+    Examples
+    --------
+    To get the necessary information for the npymath library from NumPy:
+
+    >>> npymath_info = np.distutils.misc_util.get_info('npymath')
+    >>> npymath_info                                    #doctest: +SKIP
+    {'define_macros': [], 'libraries': ['npymath'], 'library_dirs':
+    ['.../numpy/core/lib'], 'include_dirs': ['.../numpy/core/include']}
+
+    This info dict can then be used as input to a `Configuration` instance::
+
+      config.add_extension('foo', sources=['foo.c'], extra_info=npymath_info)
+
+    """
+    from numpy.distutils.npy_pkg_config import parse_flags
+    pkg_info = get_pkg_info(pkgname, dirs)
+
+    # Translate LibraryInfo instance into a build_info dict
+    info = parse_flags(pkg_info.cflags())
+    for k, v in parse_flags(pkg_info.libs()).items():
+        info[k].extend(v)
+
+    # add_extension extra_info argument is ANAL
+    info['define_macros'] = info['macros']
+    del info['macros']
+    del info['ignored']
+
+    return info
+
+def is_bootstrapping():
+    import builtins
+
+    try:
+        builtins.__NUMPY_SETUP__
+        return True
+    except AttributeError:
+        return False
+
+
+#########################
+
+def default_config_dict(name = None, parent_name = None, local_path=None):
+    """Return a configuration dictionary for usage in
+    configuration() function defined in file setup_<name>.py.
+    """
+    import warnings
+    warnings.warn('Use Configuration(%r,%r,top_path=%r) instead of '\
+                  'deprecated default_config_dict(%r,%r,%r)'
+                  % (name, parent_name, local_path,
+                     name, parent_name, local_path,
+                     ), stacklevel=2)
+    c = Configuration(name, parent_name, local_path)
+    return c.todict()
+
+
+def dict_append(d, **kws):
+    for k, v in kws.items():
+        if k in d:
+            ov = d[k]
+            if isinstance(ov, str):
+                d[k] = v
+            else:
+                d[k].extend(v)
+        else:
+            d[k] = v
+
+def appendpath(prefix, path):
+    if os.path.sep != '/':
+        prefix = prefix.replace('/', os.path.sep)
+        path = path.replace('/', os.path.sep)
+    drive = ''
+    if os.path.isabs(path):
+        drive = os.path.splitdrive(prefix)[0]
+        absprefix = os.path.splitdrive(os.path.abspath(prefix))[1]
+        pathdrive, path = os.path.splitdrive(path)
+        d = os.path.commonprefix([absprefix, path])
+        if os.path.join(absprefix[:len(d)], absprefix[len(d):]) != absprefix \
+           or os.path.join(path[:len(d)], path[len(d):]) != path:
+            # Handle invalid paths
+            d = os.path.dirname(d)
+        subpath = path[len(d):]
+        if os.path.isabs(subpath):
+            subpath = subpath[1:]
+    else:
+        subpath = path
+    return os.path.normpath(njoin(drive + prefix, subpath))
+
+def generate_config_py(target):
+    """Generate config.py file containing system_info information
+    used during building the package.
+
+    Usage:
+        config['py_modules'].append((packagename, '__config__',generate_config_py))
+    """
+    from numpy.distutils.system_info import system_info
+    from distutils.dir_util import mkpath
+    mkpath(os.path.dirname(target))
+    with open(target, 'w') as f:
+        f.write('# This file is generated by numpy\'s %s\n' % (os.path.basename(sys.argv[0])))
+        f.write('# It contains system_info results at the time of building this package.\n')
+        f.write('__all__ = ["get_info","show"]\n\n')
+
+        # For gfortran+msvc combination, extra shared libraries may exist
+        f.write(textwrap.dedent("""
+            import os
+            import sys
+
+            extra_dll_dir = os.path.join(os.path.dirname(__file__), '.libs')
+
+            if sys.platform == 'win32' and os.path.isdir(extra_dll_dir):
+                if sys.version_info >= (3, 8):
+                    os.add_dll_directory(extra_dll_dir)
+                else:
+                    os.environ.setdefault('PATH', '')
+                    os.environ['PATH'] += os.pathsep + extra_dll_dir
+
+            """))
+
+        for k, i in system_info.saved_results.items():
+            f.write('%s=%r\n' % (k, i))
+        f.write(textwrap.dedent(r'''
+            def get_info(name):
+                g = globals()
+                return g.get(name, g.get(name + "_info", {}))
+
+            def show():
+                """
+                Show libraries in the system on which NumPy was built.
+
+                Print information about various resources (libraries, library
+                directories, include directories, etc.) in the system on which
+                NumPy was built.
+
+                See Also
+                --------
+                get_include : Returns the directory containing NumPy C
+                              header files.
+
+                Notes
+                -----
+                Classes specifying the information to be printed are defined
+                in the `numpy.distutils.system_info` module.
+
+                Information may include:
+
+                * ``language``: language used to write the libraries (mostly
+                  C or f77)
+                * ``libraries``: names of libraries found in the system
+                * ``library_dirs``: directories containing the libraries
+                * ``include_dirs``: directories containing library header files
+                * ``src_dirs``: directories containing library source files
+                * ``define_macros``: preprocessor macros used by
+                  ``distutils.setup``
+
+                Examples
+                --------
+                >>> np.show_config()
+                blas_opt_info:
+                    language = c
+                    define_macros = [('HAVE_CBLAS', None)]
+                    libraries = ['openblas', 'openblas']
+                    library_dirs = ['/usr/local/lib']
+                """
+                for name,info_dict in globals().items():
+                    if name[0] == "_" or type(info_dict) is not type({}): continue
+                    print(name + ":")
+                    if not info_dict:
+                        print("  NOT AVAILABLE")
+                    for k,v in info_dict.items():
+                        v = str(v)
+                        if k == "sources" and len(v) > 200:
+                            v = v[:60] + " ...\n... " + v[-60:]
+                        print("    %s = %s" % (k,v))
+                    '''))
+
+    return target
+
+def msvc_version(compiler):
+    """Return version major and minor of compiler instance if it is
+    MSVC, raise an exception otherwise."""
+    if not compiler.compiler_type == "msvc":
+        raise ValueError("Compiler instance is not msvc (%s)"\
+                         % compiler.compiler_type)
+    return compiler._MSVCCompiler__version
+
+def get_build_architecture():
+    # Importing distutils.msvccompiler triggers a warning on non-Windows
+    # systems, so delay the import to here.
+    from distutils.msvccompiler import get_build_architecture
+    return get_build_architecture()
diff --git a/venv/Lib/site-packages/numpy/distutils/msvc9compiler.py b/venv/Lib/site-packages/numpy/distutils/msvc9compiler.py
new file mode 100644
index 000000000..68239495d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/msvc9compiler.py
@@ -0,0 +1,63 @@
+import os
+from distutils.msvc9compiler import MSVCCompiler as _MSVCCompiler
+
+from .system_info import platform_bits
+
+
+def _merge(old, new):
+    """Concatenate two environment paths avoiding repeats.
+
+    Here `old` is the environment string before the base class initialize
+    function is called and `new` is the string after the call. The new string
+    will be a fixed string if it is not obtained from the current environment,
+    or the same as the old string if obtained from the same environment. The aim
+    here is not to append the new string if it is already contained in the old
+    string so as to limit the growth of the environment string.
+
+    Parameters
+    ----------
+    old : string
+        Previous environment string.
+    new : string
+        New environment string.
+
+    Returns
+    -------
+    ret : string
+        Updated environment string.
+
+    """
+    if not old:
+        return new
+    if new in old:
+        return old
+
+    # Neither new nor old is empty. Give old priority.
+    return ';'.join([old, new])
+
+
+class MSVCCompiler(_MSVCCompiler):
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        _MSVCCompiler.__init__(self, verbose, dry_run, force)
+
+    def initialize(self, plat_name=None):
+        # The 'lib' and 'include' variables may be overwritten
+        # by MSVCCompiler.initialize, so save them for later merge.
+        environ_lib = os.getenv('lib')
+        environ_include = os.getenv('include')
+        _MSVCCompiler.initialize(self, plat_name)
+
+        # Merge current and previous values of 'lib' and 'include'
+        os.environ['lib'] = _merge(environ_lib, os.environ['lib'])
+        os.environ['include'] = _merge(environ_include, os.environ['include'])
+
+        # msvc9 building for 32 bits requires SSE2 to work around a
+        # compiler bug.
+        if platform_bits == 32:
+            self.compile_options += ['/arch:SSE2']
+            self.compile_options_debug += ['/arch:SSE2']
+
+    def manifest_setup_ldargs(self, output_filename, build_temp, ld_args):
+        ld_args.append('/MANIFEST')
+        _MSVCCompiler.manifest_setup_ldargs(self, output_filename,
+                                            build_temp, ld_args)
diff --git a/venv/Lib/site-packages/numpy/distutils/msvccompiler.py b/venv/Lib/site-packages/numpy/distutils/msvccompiler.py
new file mode 100644
index 000000000..681a254b8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/msvccompiler.py
@@ -0,0 +1,58 @@
+import os
+from distutils.msvccompiler import MSVCCompiler as _MSVCCompiler
+
+from .system_info import platform_bits
+
+
+def _merge(old, new):
+    """Concatenate two environment paths avoiding repeats.
+
+    Here `old` is the environment string before the base class initialize
+    function is called and `new` is the string after the call. The new string
+    will be a fixed string if it is not obtained from the current environment,
+    or the same as the old string if obtained from the same environment. The aim
+    here is not to append the new string if it is already contained in the old
+    string so as to limit the growth of the environment string.
+
+    Parameters
+    ----------
+    old : string
+        Previous environment string.
+    new : string
+        New environment string.
+
+    Returns
+    -------
+    ret : string
+        Updated environment string.
+
+    """
+    if new in old:
+        return old
+    if not old:
+        return new
+
+    # Neither new nor old is empty. Give old priority.
+    return ';'.join([old, new])
+
+
+class MSVCCompiler(_MSVCCompiler):
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        _MSVCCompiler.__init__(self, verbose, dry_run, force)
+
+    def initialize(self):
+        # The 'lib' and 'include' variables may be overwritten
+        # by MSVCCompiler.initialize, so save them for later merge.
+        environ_lib = os.getenv('lib', '')
+        environ_include = os.getenv('include', '')
+        _MSVCCompiler.initialize(self)
+
+        # Merge current and previous values of 'lib' and 'include'
+        os.environ['lib'] = _merge(environ_lib, os.environ['lib'])
+        os.environ['include'] = _merge(environ_include, os.environ['include'])
+
+        # msvc9 building for 32 bits requires SSE2 to work around a
+        # compiler bug.
+        if platform_bits == 32:
+            self.compile_options += ['/arch:SSE2']
+            self.compile_options_debug += ['/arch:SSE2']
diff --git a/venv/Lib/site-packages/numpy/distutils/npy_pkg_config.py b/venv/Lib/site-packages/numpy/distutils/npy_pkg_config.py
new file mode 100644
index 000000000..951ce5fb8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/npy_pkg_config.py
@@ -0,0 +1,437 @@
+import sys
+import re
+import os
+
+from configparser import RawConfigParser
+
+__all__ = ['FormatError', 'PkgNotFound', 'LibraryInfo', 'VariableSet',
+        'read_config', 'parse_flags']
+
+_VAR = re.compile(r'\$\{([a-zA-Z0-9_-]+)\}')
+
+class FormatError(IOError):
+    """
+    Exception thrown when there is a problem parsing a configuration file.
+
+    """
+    def __init__(self, msg):
+        self.msg = msg
+
+    def __str__(self):
+        return self.msg
+
+class PkgNotFound(IOError):
+    """Exception raised when a package can not be located."""
+    def __init__(self, msg):
+        self.msg = msg
+
+    def __str__(self):
+        return self.msg
+
+def parse_flags(line):
+    """
+    Parse a line from a config file containing compile flags.
+
+    Parameters
+    ----------
+    line : str
+        A single line containing one or more compile flags.
+
+    Returns
+    -------
+    d : dict
+        Dictionary of parsed flags, split into relevant categories.
+        These categories are the keys of `d`:
+
+        * 'include_dirs'
+        * 'library_dirs'
+        * 'libraries'
+        * 'macros'
+        * 'ignored'
+
+    """
+    d = {'include_dirs': [], 'library_dirs': [], 'libraries': [],
+         'macros': [], 'ignored': []}
+
+    flags = (' ' + line).split(' -')
+    for flag in flags:
+        flag = '-' + flag
+        if len(flag) > 0:
+            if flag.startswith('-I'):
+                d['include_dirs'].append(flag[2:].strip())
+            elif flag.startswith('-L'):
+                d['library_dirs'].append(flag[2:].strip())
+            elif flag.startswith('-l'):
+                d['libraries'].append(flag[2:].strip())
+            elif flag.startswith('-D'):
+                d['macros'].append(flag[2:].strip())
+            else:
+                d['ignored'].append(flag)
+
+    return d
+
+def _escape_backslash(val):
+    return val.replace('\\', '\\\\')
+
+class LibraryInfo:
+    """
+    Object containing build information about a library.
+
+    Parameters
+    ----------
+    name : str
+        The library name.
+    description : str
+        Description of the library.
+    version : str
+        Version string.
+    sections : dict
+        The sections of the configuration file for the library. The keys are
+        the section headers, the values the text under each header.
+    vars : class instance
+        A `VariableSet` instance, which contains ``(name, value)`` pairs for
+        variables defined in the configuration file for the library.
+    requires : sequence, optional
+        The required libraries for the library to be installed.
+
+    Notes
+    -----
+    All input parameters (except "sections" which is a method) are available as
+    attributes of the same name.
+
+    """
+    def __init__(self, name, description, version, sections, vars, requires=None):
+        self.name = name
+        self.description = description
+        if requires:
+            self.requires = requires
+        else:
+            self.requires = []
+        self.version = version
+        self._sections = sections
+        self.vars = vars
+
+    def sections(self):
+        """
+        Return the section headers of the config file.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        keys : list of str
+            The list of section headers.
+
+        """
+        return list(self._sections.keys())
+
+    def cflags(self, section="default"):
+        val = self.vars.interpolate(self._sections[section]['cflags'])
+        return _escape_backslash(val)
+
+    def libs(self, section="default"):
+        val = self.vars.interpolate(self._sections[section]['libs'])
+        return _escape_backslash(val)
+
+    def __str__(self):
+        m = ['Name: %s' % self.name, 'Description: %s' % self.description]
+        if self.requires:
+            m.append('Requires:')
+        else:
+            m.append('Requires: %s' % ",".join(self.requires))
+        m.append('Version: %s' % self.version)
+
+        return "\n".join(m)
+
+class VariableSet:
+    """
+    Container object for the variables defined in a config file.
+
+    `VariableSet` can be used as a plain dictionary, with the variable names
+    as keys.
+
+    Parameters
+    ----------
+    d : dict
+        Dict of items in the "variables" section of the configuration file.
+
+    """
+    def __init__(self, d):
+        self._raw_data = dict([(k, v) for k, v in d.items()])
+
+        self._re = {}
+        self._re_sub = {}
+
+        self._init_parse()
+
+    def _init_parse(self):
+        for k, v in self._raw_data.items():
+            self._init_parse_var(k, v)
+
+    def _init_parse_var(self, name, value):
+        self._re[name] = re.compile(r'\$\{%s\}' % name)
+        self._re_sub[name] = value
+
+    def interpolate(self, value):
+        # Brute force: we keep interpolating until there is no '${var}' anymore
+        # or until interpolated string is equal to input string
+        def _interpolate(value):
+            for k in self._re.keys():
+                value = self._re[k].sub(self._re_sub[k], value)
+            return value
+        while _VAR.search(value):
+            nvalue = _interpolate(value)
+            if nvalue == value:
+                break
+            value = nvalue
+
+        return value
+
+    def variables(self):
+        """
+        Return the list of variable names.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        names : list of str
+            The names of all variables in the `VariableSet` instance.
+
+        """
+        return list(self._raw_data.keys())
+
+    # Emulate a dict to set/get variables values
+    def __getitem__(self, name):
+        return self._raw_data[name]
+
+    def __setitem__(self, name, value):
+        self._raw_data[name] = value
+        self._init_parse_var(name, value)
+
+def parse_meta(config):
+    if not config.has_section('meta'):
+        raise FormatError("No meta section found !")
+
+    d = dict(config.items('meta'))
+
+    for k in ['name', 'description', 'version']:
+        if not k in d:
+            raise FormatError("Option %s (section [meta]) is mandatory, "
+                "but not found" % k)
+
+    if not 'requires' in d:
+        d['requires'] = []
+
+    return d
+
+def parse_variables(config):
+    if not config.has_section('variables'):
+        raise FormatError("No variables section found !")
+
+    d = {}
+
+    for name, value in config.items("variables"):
+        d[name] = value
+
+    return VariableSet(d)
+
+def parse_sections(config):
+    return meta_d, r
+
+def pkg_to_filename(pkg_name):
+    return "%s.ini" % pkg_name
+
+def parse_config(filename, dirs=None):
+    if dirs:
+        filenames = [os.path.join(d, filename) for d in dirs]
+    else:
+        filenames = [filename]
+
+    config = RawConfigParser()
+
+    n = config.read(filenames)
+    if not len(n) >= 1:
+        raise PkgNotFound("Could not find file(s) %s" % str(filenames))
+
+    # Parse meta and variables sections
+    meta = parse_meta(config)
+
+    vars = {}
+    if config.has_section('variables'):
+        for name, value in config.items("variables"):
+            vars[name] = _escape_backslash(value)
+
+    # Parse "normal" sections
+    secs = [s for s in config.sections() if not s in ['meta', 'variables']]
+    sections = {}
+
+    requires = {}
+    for s in secs:
+        d = {}
+        if config.has_option(s, "requires"):
+            requires[s] = config.get(s, 'requires')
+
+        for name, value in config.items(s):
+            d[name] = value
+        sections[s] = d
+
+    return meta, vars, sections, requires
+
+def _read_config_imp(filenames, dirs=None):
+    def _read_config(f):
+        meta, vars, sections, reqs = parse_config(f, dirs)
+        # recursively add sections and variables of required libraries
+        for rname, rvalue in reqs.items():
+            nmeta, nvars, nsections, nreqs = _read_config(pkg_to_filename(rvalue))
+
+            # Update var dict for variables not in 'top' config file
+            for k, v in nvars.items():
+                if not k in vars:
+                    vars[k] = v
+
+            # Update sec dict
+            for oname, ovalue in nsections[rname].items():
+                if ovalue:
+                    sections[rname][oname] += ' %s' % ovalue
+
+        return meta, vars, sections, reqs
+
+    meta, vars, sections, reqs = _read_config(filenames)
+
+    # FIXME: document this. If pkgname is defined in the variables section, and
+    # there is no pkgdir variable defined, pkgdir is automatically defined to
+    # the path of pkgname. This requires the package to be imported to work
+    if not 'pkgdir' in vars and "pkgname" in vars:
+        pkgname = vars["pkgname"]
+        if not pkgname in sys.modules:
+            raise ValueError("You should import %s to get information on %s" %
+                             (pkgname, meta["name"]))
+
+        mod = sys.modules[pkgname]
+        vars["pkgdir"] = _escape_backslash(os.path.dirname(mod.__file__))
+
+    return LibraryInfo(name=meta["name"], description=meta["description"],
+            version=meta["version"], sections=sections, vars=VariableSet(vars))
+
+# Trivial cache to cache LibraryInfo instances creation. To be really
+# efficient, the cache should be handled in read_config, since a same file can
+# be parsed many time outside LibraryInfo creation, but I doubt this will be a
+# problem in practice
+_CACHE = {}
+def read_config(pkgname, dirs=None):
+    """
+    Return library info for a package from its configuration file.
+
+    Parameters
+    ----------
+    pkgname : str
+        Name of the package (should match the name of the .ini file, without
+        the extension, e.g. foo for the file foo.ini).
+    dirs : sequence, optional
+        If given, should be a sequence of directories - usually including
+        the NumPy base directory - where to look for npy-pkg-config files.
+
+    Returns
+    -------
+    pkginfo : class instance
+        The `LibraryInfo` instance containing the build information.
+
+    Raises
+    ------
+    PkgNotFound
+        If the package is not found.
+
+    See Also
+    --------
+    misc_util.get_info, misc_util.get_pkg_info
+
+    Examples
+    --------
+    >>> npymath_info = np.distutils.npy_pkg_config.read_config('npymath')
+    >>> type(npymath_info)
+    <class 'numpy.distutils.npy_pkg_config.LibraryInfo'>
+    >>> print(npymath_info)
+    Name: npymath
+    Description: Portable, core math library implementing C99 standard
+    Requires:
+    Version: 0.1  #random
+
+    """
+    try:
+        return _CACHE[pkgname]
+    except KeyError:
+        v = _read_config_imp(pkg_to_filename(pkgname), dirs)
+        _CACHE[pkgname] = v
+        return v
+
+# TODO:
+#   - implements version comparison (modversion + atleast)
+
+# pkg-config simple emulator - useful for debugging, and maybe later to query
+# the system
+if __name__ == '__main__':
+    from optparse import OptionParser
+    import glob
+
+    parser = OptionParser()
+    parser.add_option("--cflags", dest="cflags", action="store_true",
+                      help="output all preprocessor and compiler flags")
+    parser.add_option("--libs", dest="libs", action="store_true",
+                      help="output all linker flags")
+    parser.add_option("--use-section", dest="section",
+                      help="use this section instead of default for options")
+    parser.add_option("--version", dest="version", action="store_true",
+                      help="output version")
+    parser.add_option("--atleast-version", dest="min_version",
+                      help="Minimal version")
+    parser.add_option("--list-all", dest="list_all", action="store_true",
+                      help="Minimal version")
+    parser.add_option("--define-variable", dest="define_variable",
+                      help="Replace variable with the given value")
+
+    (options, args) = parser.parse_args(sys.argv)
+
+    if len(args) < 2:
+        raise ValueError("Expect package name on the command line:")
+
+    if options.list_all:
+        files = glob.glob("*.ini")
+        for f in files:
+            info = read_config(f)
+            print("%s\t%s - %s" % (info.name, info.name, info.description))
+
+    pkg_name = args[1]
+    d = os.environ.get('NPY_PKG_CONFIG_PATH')
+    if d:
+        info = read_config(pkg_name, ['numpy/core/lib/npy-pkg-config', '.', d])
+    else:
+        info = read_config(pkg_name, ['numpy/core/lib/npy-pkg-config', '.'])
+
+    if options.section:
+        section = options.section
+    else:
+        section = "default"
+
+    if options.define_variable:
+        m = re.search(r'([\S]+)=([\S]+)', options.define_variable)
+        if not m:
+            raise ValueError("--define-variable option should be of "
+                             "the form --define-variable=foo=bar")
+        else:
+            name = m.group(1)
+            value = m.group(2)
+        info.vars[name] = value
+
+    if options.cflags:
+        print(info.cflags(section))
+    if options.libs:
+        print(info.libs(section))
+    if options.version:
+        print(info.version)
+    if options.min_version:
+        print(info.version >= options.min_version)
diff --git a/venv/Lib/site-packages/numpy/distutils/numpy_distribution.py b/venv/Lib/site-packages/numpy/distutils/numpy_distribution.py
new file mode 100644
index 000000000..ea8182659
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/numpy_distribution.py
@@ -0,0 +1,17 @@
+# XXX: Handle setuptools ?
+from distutils.core import Distribution
+
+# This class is used because we add new files (sconscripts, and so on) with the
+# scons command
+class NumpyDistribution(Distribution):
+    def __init__(self, attrs = None):
+        # A list of (sconscripts, pre_hook, post_hook, src, parent_names)
+        self.scons_data = []
+        # A list of installable libraries
+        self.installed_libraries = []
+        # A dict of pkg_config files to generate/install
+        self.installed_pkg_config = {}
+        Distribution.__init__(self, attrs)
+
+    def has_scons_scripts(self):
+        return bool(self.scons_data)
diff --git a/venv/Lib/site-packages/numpy/distutils/pathccompiler.py b/venv/Lib/site-packages/numpy/distutils/pathccompiler.py
new file mode 100644
index 000000000..48051810e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/pathccompiler.py
@@ -0,0 +1,21 @@
+from distutils.unixccompiler import UnixCCompiler
+
+class PathScaleCCompiler(UnixCCompiler):
+
+    """
+    PathScale compiler compatible with an gcc built Python.
+    """
+
+    compiler_type = 'pathcc'
+    cc_exe = 'pathcc'
+    cxx_exe = 'pathCC'
+
+    def __init__ (self, verbose=0, dry_run=0, force=0):
+        UnixCCompiler.__init__ (self, verbose, dry_run, force)
+        cc_compiler = self.cc_exe
+        cxx_compiler = self.cxx_exe
+        self.set_executables(compiler=cc_compiler,
+                             compiler_so=cc_compiler,
+                             compiler_cxx=cxx_compiler,
+                             linker_exe=cc_compiler,
+                             linker_so=cc_compiler + ' -shared')
diff --git a/venv/Lib/site-packages/numpy/distutils/setup.py b/venv/Lib/site-packages/numpy/distutils/setup.py
new file mode 100644
index 000000000..88cd1a160
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/setup.py
@@ -0,0 +1,15 @@
+#!/usr/bin/env python3
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('distutils', parent_package, top_path)
+    config.add_subpackage('command')
+    config.add_subpackage('fcompiler')
+    config.add_subpackage('tests')
+    config.add_data_files('site.cfg')
+    config.add_data_files('mingw/gfortran_vs2003_hack.c')
+    config.make_config_py()
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core      import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/distutils/system_info.py b/venv/Lib/site-packages/numpy/distutils/system_info.py
new file mode 100644
index 000000000..3a6a7b29d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/system_info.py
@@ -0,0 +1,2991 @@
+#!/usr/bin/env python3
+"""
+This file defines a set of system_info classes for getting
+information about various resources (libraries, library directories,
+include directories, etc.) in the system. Usage:
+    info_dict = get_info(<name>)
+  where <name> is a string 'atlas','x11','fftw','lapack','blas',
+  'lapack_src', 'blas_src', etc. For a complete list of allowed names,
+  see the definition of get_info() function below.
+
+  Returned info_dict is a dictionary which is compatible with
+  distutils.setup keyword arguments. If info_dict == {}, then the
+  asked resource is not available (system_info could not find it).
+
+  Several *_info classes specify an environment variable to specify
+  the locations of software. When setting the corresponding environment
+  variable to 'None' then the software will be ignored, even when it
+  is available in system.
+
+Global parameters:
+  system_info.search_static_first - search static libraries (.a)
+             in precedence to shared ones (.so, .sl) if enabled.
+  system_info.verbosity - output the results to stdout if enabled.
+
+The file 'site.cfg' is looked for in
+
+1) Directory of main setup.py file being run.
+2) Home directory of user running the setup.py file as ~/.numpy-site.cfg
+3) System wide directory (location of this file...)
+
+The first one found is used to get system configuration options The
+format is that used by ConfigParser (i.e., Windows .INI style). The
+section ALL is not intended for general use.
+
+Appropriate defaults are used if nothing is specified.
+
+The order of finding the locations of resources is the following:
+ 1. environment variable
+ 2. section in site.cfg
+ 3. DEFAULT section in site.cfg
+ 4. System default search paths (see ``default_*`` variables below).
+Only the first complete match is returned.
+
+Currently, the following classes are available, along with their section names:
+
+    Numeric_info:Numeric
+    _numpy_info:Numeric
+    _pkg_config_info:None
+    accelerate_info:accelerate
+    agg2_info:agg2
+    amd_info:amd
+    atlas_3_10_blas_info:atlas
+    atlas_3_10_blas_threads_info:atlas
+    atlas_3_10_info:atlas
+    atlas_3_10_threads_info:atlas
+    atlas_blas_info:atlas
+    atlas_blas_threads_info:atlas
+    atlas_info:atlas
+    atlas_threads_info:atlas
+    blas64__opt_info:ALL               # usage recommended (general ILP64 BLAS, 64_ symbol suffix)
+    blas_ilp64_opt_info:ALL            # usage recommended (general ILP64 BLAS)
+    blas_ilp64_plain_opt_info:ALL      # usage recommended (general ILP64 BLAS, no symbol suffix)
+    blas_info:blas
+    blas_mkl_info:mkl
+    blas_opt_info:ALL                  # usage recommended
+    blas_src_info:blas_src
+    blis_info:blis
+    boost_python_info:boost_python
+    dfftw_info:fftw
+    dfftw_threads_info:fftw
+    djbfft_info:djbfft
+    f2py_info:ALL
+    fft_opt_info:ALL
+    fftw2_info:fftw
+    fftw3_info:fftw3
+    fftw_info:fftw
+    fftw_threads_info:fftw
+    flame_info:flame
+    freetype2_info:freetype2
+    gdk_2_info:gdk_2
+    gdk_info:gdk
+    gdk_pixbuf_2_info:gdk_pixbuf_2
+    gdk_pixbuf_xlib_2_info:gdk_pixbuf_xlib_2
+    gdk_x11_2_info:gdk_x11_2
+    gtkp_2_info:gtkp_2
+    gtkp_x11_2_info:gtkp_x11_2
+    lapack64__opt_info:ALL             # usage recommended (general ILP64 LAPACK, 64_ symbol suffix)
+    lapack_atlas_3_10_info:atlas
+    lapack_atlas_3_10_threads_info:atlas
+    lapack_atlas_info:atlas
+    lapack_atlas_threads_info:atlas
+    lapack_ilp64_opt_info:ALL          # usage recommended (general ILP64 LAPACK)
+    lapack_ilp64_plain_opt_info:ALL    # usage recommended (general ILP64 LAPACK, no symbol suffix)
+    lapack_info:lapack
+    lapack_mkl_info:mkl
+    lapack_opt_info:ALL                # usage recommended
+    lapack_src_info:lapack_src
+    mkl_info:mkl
+    numarray_info:numarray
+    numerix_info:numerix
+    numpy_info:numpy
+    openblas64__info:openblas64_
+    openblas64__lapack_info:openblas64_
+    openblas_clapack_info:openblas
+    openblas_ilp64_info:openblas_ilp64
+    openblas_ilp64_lapack_info:openblas_ilp64
+    openblas_info:openblas
+    openblas_lapack_info:openblas
+    sfftw_info:fftw
+    sfftw_threads_info:fftw
+    system_info:ALL
+    umfpack_info:umfpack
+    wx_info:wx
+    x11_info:x11
+    xft_info:xft
+
+Example:
+----------
+[DEFAULT]
+# default section
+library_dirs = /usr/lib:/usr/local/lib:/opt/lib
+include_dirs = /usr/include:/usr/local/include:/opt/include
+src_dirs = /usr/local/src:/opt/src
+# search static libraries (.a) in preference to shared ones (.so)
+search_static_first = 0
+
+[fftw]
+libraries = rfftw, fftw
+
+[atlas]
+library_dirs = /usr/lib/3dnow:/usr/lib/3dnow/atlas
+# for overriding the names of the atlas libraries
+libraries = lapack, f77blas, cblas, atlas
+
+[x11]
+library_dirs = /usr/X11R6/lib
+include_dirs = /usr/X11R6/include
+----------
+
+Note that the ``libraries`` key is the default setting for libraries.
+
+Authors:
+  Pearu Peterson <pearu@cens.ioc.ee>, February 2002
+  David M. Cooke <cookedm@physics.mcmaster.ca>, April 2002
+
+Copyright 2002 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@cens.ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy (BSD style) license.  See LICENSE.txt that came with
+this distribution for specifics.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+
+"""
+import sys
+import os
+import re
+import copy
+import warnings
+import subprocess
+import textwrap
+
+from glob import glob
+from functools import reduce
+from configparser import NoOptionError
+from configparser import RawConfigParser as ConfigParser
+# It seems that some people are importing ConfigParser from here so is
+# good to keep its class name. Use of RawConfigParser is needed in
+# order to be able to load path names with percent in them, like
+# `feature%2Fcool` which is common on git flow branch names.
+
+from distutils.errors import DistutilsError
+from distutils.dist import Distribution
+import distutils.sysconfig
+from numpy.distutils import log
+from distutils.util import get_platform
+
+from numpy.distutils.exec_command import (
+    find_executable, filepath_from_subprocess_output,
+    )
+from numpy.distutils.misc_util import (is_sequence, is_string,
+                                       get_shared_lib_extension)
+from numpy.distutils.command.config import config as cmd_config
+from numpy.distutils import customized_ccompiler as _customized_ccompiler
+from numpy.distutils import _shell_utils
+import distutils.ccompiler
+import tempfile
+import shutil
+
+
+# Determine number of bits
+import platform
+_bits = {'32bit': 32, '64bit': 64}
+platform_bits = _bits[platform.architecture()[0]]
+
+
+global_compiler = None
+
+def customized_ccompiler():
+    global global_compiler
+    if not global_compiler:
+        global_compiler = _customized_ccompiler()
+    return global_compiler
+
+
+def _c_string_literal(s):
+    """
+    Convert a python string into a literal suitable for inclusion into C code
+    """
+    # only these three characters are forbidden in C strings
+    s = s.replace('\\', r'\\')
+    s = s.replace('"',  r'\"')
+    s = s.replace('\n', r'\n')
+    return '"{}"'.format(s)
+
+
+def libpaths(paths, bits):
+    """Return a list of library paths valid on 32 or 64 bit systems.
+
+    Inputs:
+      paths : sequence
+        A sequence of strings (typically paths)
+      bits : int
+        An integer, the only valid values are 32 or 64.  A ValueError exception
+      is raised otherwise.
+
+    Examples:
+
+    Consider a list of directories
+    >>> paths = ['/usr/X11R6/lib','/usr/X11/lib','/usr/lib']
+
+    For a 32-bit platform, this is already valid:
+    >>> np.distutils.system_info.libpaths(paths,32)
+    ['/usr/X11R6/lib', '/usr/X11/lib', '/usr/lib']
+
+    On 64 bits, we prepend the '64' postfix
+    >>> np.distutils.system_info.libpaths(paths,64)
+    ['/usr/X11R6/lib64', '/usr/X11R6/lib', '/usr/X11/lib64', '/usr/X11/lib',
+    '/usr/lib64', '/usr/lib']
+    """
+    if bits not in (32, 64):
+        raise ValueError("Invalid bit size in libpaths: 32 or 64 only")
+
+    # Handle 32bit case
+    if bits == 32:
+        return paths
+
+    # Handle 64bit case
+    out = []
+    for p in paths:
+        out.extend([p + '64', p])
+
+    return out
+
+
+if sys.platform == 'win32':
+    default_lib_dirs = ['C:\\',
+                        os.path.join(distutils.sysconfig.EXEC_PREFIX,
+                                     'libs')]
+    default_runtime_dirs = []
+    default_include_dirs = []
+    default_src_dirs = ['.']
+    default_x11_lib_dirs = []
+    default_x11_include_dirs = []
+    _include_dirs = [
+        'include',
+        'include/suitesparse',
+    ]
+    _lib_dirs = [
+        'lib',
+    ]
+
+    _include_dirs = [d.replace('/', os.sep) for d in _include_dirs]
+    _lib_dirs = [d.replace('/', os.sep) for d in _lib_dirs]
+    def add_system_root(library_root):
+        """Add a package manager root to the include directories"""
+        global default_lib_dirs
+        global default_include_dirs
+
+        library_root = os.path.normpath(library_root)
+
+        default_lib_dirs.extend(
+            os.path.join(library_root, d) for d in _lib_dirs)
+        default_include_dirs.extend(
+            os.path.join(library_root, d) for d in _include_dirs)
+
+    # VCpkg is the de-facto package manager on windows for C/C++
+    # libraries. If it is on the PATH, then we append its paths here.
+    vcpkg = shutil.which('vcpkg')
+    if vcpkg:
+        vcpkg_dir = os.path.dirname(vcpkg)
+        if platform.architecture() == '32bit':
+            specifier = 'x86'
+        else:
+            specifier = 'x64'
+
+        vcpkg_installed = os.path.join(vcpkg_dir, 'installed')
+        for vcpkg_root in [
+            os.path.join(vcpkg_installed, specifier + '-windows'),
+            os.path.join(vcpkg_installed, specifier + '-windows-static'),
+        ]:
+            add_system_root(vcpkg_root)
+
+    # Conda is another popular package manager that provides libraries
+    conda = shutil.which('conda')
+    if conda:
+        conda_dir = os.path.dirname(conda)
+        add_system_root(os.path.join(conda_dir, '..', 'Library'))
+        add_system_root(os.path.join(conda_dir, 'Library'))
+
+else:
+    default_lib_dirs = libpaths(['/usr/local/lib', '/opt/lib', '/usr/lib',
+                                 '/opt/local/lib', '/sw/lib'], platform_bits)
+    default_runtime_dirs = []
+    default_include_dirs = ['/usr/local/include',
+                            '/opt/include', '/usr/include',
+                            # path of umfpack under macports
+                            '/opt/local/include/ufsparse',
+                            '/opt/local/include', '/sw/include',
+                            '/usr/include/suitesparse']
+    default_src_dirs = ['.', '/usr/local/src', '/opt/src', '/sw/src']
+
+    default_x11_lib_dirs = libpaths(['/usr/X11R6/lib', '/usr/X11/lib',
+                                     '/usr/lib'], platform_bits)
+    default_x11_include_dirs = ['/usr/X11R6/include', '/usr/X11/include',
+                                '/usr/include']
+
+    if os.path.exists('/usr/lib/X11'):
+        globbed_x11_dir = glob('/usr/lib/*/libX11.so')
+        if globbed_x11_dir:
+            x11_so_dir = os.path.split(globbed_x11_dir[0])[0]
+            default_x11_lib_dirs.extend([x11_so_dir, '/usr/lib/X11'])
+            default_x11_include_dirs.extend(['/usr/lib/X11/include',
+                                             '/usr/include/X11'])
+
+    with open(os.devnull, 'w') as tmp:
+        try:
+            p = subprocess.Popen(["gcc", "-print-multiarch"], stdout=subprocess.PIPE,
+                         stderr=tmp)
+        except (OSError, DistutilsError):
+            # OSError if gcc is not installed, or SandboxViolation (DistutilsError
+            # subclass) if an old setuptools bug is triggered (see gh-3160).
+            pass
+        else:
+            triplet = str(p.communicate()[0].decode().strip())
+            if p.returncode == 0:
+                # gcc supports the "-print-multiarch" option
+                default_x11_lib_dirs += [os.path.join("/usr/lib/", triplet)]
+                default_lib_dirs += [os.path.join("/usr/lib/", triplet)]
+
+
+if os.path.join(sys.prefix, 'lib') not in default_lib_dirs:
+    default_lib_dirs.insert(0, os.path.join(sys.prefix, 'lib'))
+    default_include_dirs.append(os.path.join(sys.prefix, 'include'))
+    default_src_dirs.append(os.path.join(sys.prefix, 'src'))
+
+default_lib_dirs = [_m for _m in default_lib_dirs if os.path.isdir(_m)]
+default_runtime_dirs = [_m for _m in default_runtime_dirs if os.path.isdir(_m)]
+default_include_dirs = [_m for _m in default_include_dirs if os.path.isdir(_m)]
+default_src_dirs = [_m for _m in default_src_dirs if os.path.isdir(_m)]
+
+so_ext = get_shared_lib_extension()
+
+
+def get_standard_file(fname):
+    """Returns a list of files named 'fname' from
+    1) System-wide directory (directory-location of this module)
+    2) Users HOME directory (os.environ['HOME'])
+    3) Local directory
+    """
+    # System-wide file
+    filenames = []
+    try:
+        f = __file__
+    except NameError:
+        f = sys.argv[0]
+    else:
+        sysfile = os.path.join(os.path.split(os.path.abspath(f))[0],
+                               fname)
+        if os.path.isfile(sysfile):
+            filenames.append(sysfile)
+
+    # Home directory
+    # And look for the user config file
+    try:
+        f = os.path.expanduser('~')
+    except KeyError:
+        pass
+    else:
+        user_file = os.path.join(f, fname)
+        if os.path.isfile(user_file):
+            filenames.append(user_file)
+
+    # Local file
+    if os.path.isfile(fname):
+        filenames.append(os.path.abspath(fname))
+
+    return filenames
+
+
+def get_info(name, notfound_action=0):
+    """
+    notfound_action:
+      0 - do nothing
+      1 - display warning message
+      2 - raise error
+    """
+    cl = {'atlas': atlas_info,  # use lapack_opt or blas_opt instead
+          'atlas_threads': atlas_threads_info,                # ditto
+          'atlas_blas': atlas_blas_info,
+          'atlas_blas_threads': atlas_blas_threads_info,
+          'lapack_atlas': lapack_atlas_info,  # use lapack_opt instead
+          'lapack_atlas_threads': lapack_atlas_threads_info,  # ditto
+          'atlas_3_10': atlas_3_10_info,  # use lapack_opt or blas_opt instead
+          'atlas_3_10_threads': atlas_3_10_threads_info,                # ditto
+          'atlas_3_10_blas': atlas_3_10_blas_info,
+          'atlas_3_10_blas_threads': atlas_3_10_blas_threads_info,
+          'lapack_atlas_3_10': lapack_atlas_3_10_info,  # use lapack_opt instead
+          'lapack_atlas_3_10_threads': lapack_atlas_3_10_threads_info,  # ditto
+          'flame': flame_info,          # use lapack_opt instead
+          'mkl': mkl_info,
+          # openblas which may or may not have embedded lapack
+          'openblas': openblas_info,          # use blas_opt instead
+          # openblas with embedded lapack
+          'openblas_lapack': openblas_lapack_info, # use blas_opt instead
+          'openblas_clapack': openblas_clapack_info, # use blas_opt instead
+          'blis': blis_info,                  # use blas_opt instead
+          'lapack_mkl': lapack_mkl_info,      # use lapack_opt instead
+          'blas_mkl': blas_mkl_info,          # use blas_opt instead
+          'accelerate': accelerate_info,      # use blas_opt instead
+          'openblas64_': openblas64__info,
+          'openblas64__lapack': openblas64__lapack_info,
+          'openblas_ilp64': openblas_ilp64_info,
+          'openblas_ilp64_lapack': openblas_ilp64_lapack_info,
+          'x11': x11_info,
+          'fft_opt': fft_opt_info,
+          'fftw': fftw_info,
+          'fftw2': fftw2_info,
+          'fftw3': fftw3_info,
+          'dfftw': dfftw_info,
+          'sfftw': sfftw_info,
+          'fftw_threads': fftw_threads_info,
+          'dfftw_threads': dfftw_threads_info,
+          'sfftw_threads': sfftw_threads_info,
+          'djbfft': djbfft_info,
+          'blas': blas_info,                  # use blas_opt instead
+          'lapack': lapack_info,              # use lapack_opt instead
+          'lapack_src': lapack_src_info,
+          'blas_src': blas_src_info,
+          'numpy': numpy_info,
+          'f2py': f2py_info,
+          'Numeric': Numeric_info,
+          'numeric': Numeric_info,
+          'numarray': numarray_info,
+          'numerix': numerix_info,
+          'lapack_opt': lapack_opt_info,
+          'lapack_ilp64_opt': lapack_ilp64_opt_info,
+          'lapack_ilp64_plain_opt': lapack_ilp64_plain_opt_info,
+          'lapack64__opt': lapack64__opt_info,
+          'blas_opt': blas_opt_info,
+          'blas_ilp64_opt': blas_ilp64_opt_info,
+          'blas_ilp64_plain_opt': blas_ilp64_plain_opt_info,
+          'blas64__opt': blas64__opt_info,
+          'boost_python': boost_python_info,
+          'agg2': agg2_info,
+          'wx': wx_info,
+          'gdk_pixbuf_xlib_2': gdk_pixbuf_xlib_2_info,
+          'gdk-pixbuf-xlib-2.0': gdk_pixbuf_xlib_2_info,
+          'gdk_pixbuf_2': gdk_pixbuf_2_info,
+          'gdk-pixbuf-2.0': gdk_pixbuf_2_info,
+          'gdk': gdk_info,
+          'gdk_2': gdk_2_info,
+          'gdk-2.0': gdk_2_info,
+          'gdk_x11_2': gdk_x11_2_info,
+          'gdk-x11-2.0': gdk_x11_2_info,
+          'gtkp_x11_2': gtkp_x11_2_info,
+          'gtk+-x11-2.0': gtkp_x11_2_info,
+          'gtkp_2': gtkp_2_info,
+          'gtk+-2.0': gtkp_2_info,
+          'xft': xft_info,
+          'freetype2': freetype2_info,
+          'umfpack': umfpack_info,
+          'amd': amd_info,
+          }.get(name.lower(), system_info)
+    return cl().get_info(notfound_action)
+
+
+class NotFoundError(DistutilsError):
+    """Some third-party program or library is not found."""
+
+
+class AliasedOptionError(DistutilsError):
+    """
+    Aliases entries in config files should not be existing.
+    In section '{section}' we found multiple appearances of options {options}."""
+
+
+class AtlasNotFoundError(NotFoundError):
+    """
+    Atlas (http://github.com/math-atlas/math-atlas) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [atlas]) or by setting
+    the ATLAS environment variable."""
+
+
+class FlameNotFoundError(NotFoundError):
+    """
+    FLAME (http://www.cs.utexas.edu/~flame/web/) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [flame])."""
+
+
+class LapackNotFoundError(NotFoundError):
+    """
+    Lapack (http://www.netlib.org/lapack/) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [lapack]) or by setting
+    the LAPACK environment variable."""
+
+
+class LapackSrcNotFoundError(LapackNotFoundError):
+    """
+    Lapack (http://www.netlib.org/lapack/) sources not found.
+    Directories to search for the sources can be specified in the
+    numpy/distutils/site.cfg file (section [lapack_src]) or by setting
+    the LAPACK_SRC environment variable."""
+
+
+class LapackILP64NotFoundError(NotFoundError):
+    """
+    64-bit Lapack libraries not found.
+    Known libraries in numpy/distutils/site.cfg file are:
+    openblas64_, openblas_ilp64
+    """
+
+class BlasOptNotFoundError(NotFoundError):
+    """
+    Optimized (vendor) Blas libraries are not found.
+    Falls back to netlib Blas library which has worse performance.
+    A better performance should be easily gained by switching
+    Blas library."""
+
+class BlasNotFoundError(NotFoundError):
+    """
+    Blas (http://www.netlib.org/blas/) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [blas]) or by setting
+    the BLAS environment variable."""
+
+class BlasILP64NotFoundError(NotFoundError):
+    """
+    64-bit Blas libraries not found.
+    Known libraries in numpy/distutils/site.cfg file are:
+    openblas64_, openblas_ilp64
+    """
+
+class BlasSrcNotFoundError(BlasNotFoundError):
+    """
+    Blas (http://www.netlib.org/blas/) sources not found.
+    Directories to search for the sources can be specified in the
+    numpy/distutils/site.cfg file (section [blas_src]) or by setting
+    the BLAS_SRC environment variable."""
+
+
+class FFTWNotFoundError(NotFoundError):
+    """
+    FFTW (http://www.fftw.org/) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [fftw]) or by setting
+    the FFTW environment variable."""
+
+
+class DJBFFTNotFoundError(NotFoundError):
+    """
+    DJBFFT (https://cr.yp.to/djbfft.html) libraries not found.
+    Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [djbfft]) or by setting
+    the DJBFFT environment variable."""
+
+
+class NumericNotFoundError(NotFoundError):
+    """
+    Numeric (https://www.numpy.org/) module not found.
+    Get it from above location, install it, and retry setup.py."""
+
+
+class X11NotFoundError(NotFoundError):
+    """X11 libraries not found."""
+
+
+class UmfpackNotFoundError(NotFoundError):
+    """
+    UMFPACK sparse solver (https://www.cise.ufl.edu/research/sparse/umfpack/)
+    not found. Directories to search for the libraries can be specified in the
+    numpy/distutils/site.cfg file (section [umfpack]) or by setting
+    the UMFPACK environment variable."""
+
+
+class system_info:
+
+    """ get_info() is the only public method. Don't use others.
+    """
+    dir_env_var = None
+    # XXX: search_static_first is disabled by default, may disappear in
+    # future unless it is proved to be useful.
+    search_static_first = 0
+    # The base-class section name is a random word "ALL" and is not really
+    # intended for general use. It cannot be None nor can it be DEFAULT as
+    # these break the ConfigParser. See gh-15338
+    section = 'ALL'
+    saved_results = {}
+
+    notfounderror = NotFoundError
+
+    def __init__(self,
+                  default_lib_dirs=default_lib_dirs,
+                  default_include_dirs=default_include_dirs,
+                  ):
+        self.__class__.info = {}
+        self.local_prefixes = []
+        defaults = {'library_dirs': os.pathsep.join(default_lib_dirs),
+                    'include_dirs': os.pathsep.join(default_include_dirs),
+                    'runtime_library_dirs': os.pathsep.join(default_runtime_dirs),
+                    'rpath': '',
+                    'src_dirs': os.pathsep.join(default_src_dirs),
+                    'search_static_first': str(self.search_static_first),
+                    'extra_compile_args': '', 'extra_link_args': ''}
+        self.cp = ConfigParser(defaults)
+        self.files = []
+        self.files.extend(get_standard_file('.numpy-site.cfg'))
+        self.files.extend(get_standard_file('site.cfg'))
+        self.parse_config_files()
+
+        if self.section is not None:
+            self.search_static_first = self.cp.getboolean(
+                self.section, 'search_static_first')
+        assert isinstance(self.search_static_first, int)
+
+    def parse_config_files(self):
+        self.cp.read(self.files)
+        if not self.cp.has_section(self.section):
+            if self.section is not None:
+                self.cp.add_section(self.section)
+
+    def calc_libraries_info(self):
+        libs = self.get_libraries()
+        dirs = self.get_lib_dirs()
+        # The extensions use runtime_library_dirs
+        r_dirs = self.get_runtime_lib_dirs()
+        # Intrinsic distutils use rpath, we simply append both entries
+        # as though they were one entry
+        r_dirs.extend(self.get_runtime_lib_dirs(key='rpath'))
+        info = {}
+        for lib in libs:
+            i = self.check_libs(dirs, [lib])
+            if i is not None:
+                dict_append(info, **i)
+            else:
+                log.info('Library %s was not found. Ignoring' % (lib))
+
+            if r_dirs:
+                i = self.check_libs(r_dirs, [lib])
+                if i is not None:
+                    # Swap library keywords found to runtime_library_dirs
+                    # the libraries are insisting on the user having defined
+                    # them using the library_dirs, and not necessarily by
+                    # runtime_library_dirs
+                    del i['libraries']
+                    i['runtime_library_dirs'] = i.pop('library_dirs')
+                    dict_append(info, **i)
+                else:
+                    log.info('Runtime library %s was not found. Ignoring' % (lib))
+
+        return info
+
+    def set_info(self, **info):
+        if info:
+            lib_info = self.calc_libraries_info()
+            dict_append(info, **lib_info)
+            # Update extra information
+            extra_info = self.calc_extra_info()
+            dict_append(info, **extra_info)
+        self.saved_results[self.__class__.__name__] = info
+
+    def get_option_single(self, *options):
+        """ Ensure that only one of `options` are found in the section
+
+        Parameters
+        ----------
+        *options : list of str
+           a list of options to be found in the section (``self.section``)
+
+        Returns
+        -------
+        str :
+            the option that is uniquely found in the section
+
+        Raises
+        ------
+        AliasedOptionError :
+            in case more than one of the options are found
+        """
+        found = map(lambda opt: self.cp.has_option(self.section, opt), options)
+        found = list(found)
+        if sum(found) == 1:
+            return options[found.index(True)]
+        elif sum(found) == 0:
+            # nothing is found anyways
+            return options[0]
+
+        # Else we have more than 1 key found
+        if AliasedOptionError.__doc__ is None:
+            raise AliasedOptionError()
+        raise AliasedOptionError(AliasedOptionError.__doc__.format(
+            section=self.section, options='[{}]'.format(', '.join(options))))
+
+
+    def has_info(self):
+        return self.__class__.__name__ in self.saved_results
+
+    def calc_extra_info(self):
+        """ Updates the information in the current information with
+        respect to these flags:
+          extra_compile_args
+          extra_link_args
+        """
+        info = {}
+        for key in ['extra_compile_args', 'extra_link_args']:
+            # Get values
+            opt = self.cp.get(self.section, key)
+            opt = _shell_utils.NativeParser.split(opt)
+            if opt:
+                tmp = {key: opt}
+                dict_append(info, **tmp)
+        return info
+
+    def get_info(self, notfound_action=0):
+        """ Return a dictionary with items that are compatible
+            with numpy.distutils.setup keyword arguments.
+        """
+        flag = 0
+        if not self.has_info():
+            flag = 1
+            log.info(self.__class__.__name__ + ':')
+            if hasattr(self, 'calc_info'):
+                self.calc_info()
+            if notfound_action:
+                if not self.has_info():
+                    if notfound_action == 1:
+                        warnings.warn(self.notfounderror.__doc__, stacklevel=2)
+                    elif notfound_action == 2:
+                        raise self.notfounderror(self.notfounderror.__doc__)
+                    else:
+                        raise ValueError(repr(notfound_action))
+
+            if not self.has_info():
+                log.info('  NOT AVAILABLE')
+                self.set_info()
+            else:
+                log.info('  FOUND:')
+
+        res = self.saved_results.get(self.__class__.__name__)
+        if log.get_threshold() <= log.INFO and flag:
+            for k, v in res.items():
+                v = str(v)
+                if k in ['sources', 'libraries'] and len(v) > 270:
+                    v = v[:120] + '...\n...\n...' + v[-120:]
+                log.info('    %s = %s', k, v)
+            log.info('')
+
+        return copy.deepcopy(res)
+
+    def get_paths(self, section, key):
+        dirs = self.cp.get(section, key).split(os.pathsep)
+        env_var = self.dir_env_var
+        if env_var:
+            if is_sequence(env_var):
+                e0 = env_var[-1]
+                for e in env_var:
+                    if e in os.environ:
+                        e0 = e
+                        break
+                if not env_var[0] == e0:
+                    log.info('Setting %s=%s' % (env_var[0], e0))
+                env_var = e0
+        if env_var and env_var in os.environ:
+            d = os.environ[env_var]
+            if d == 'None':
+                log.info('Disabled %s: %s',
+                         self.__class__.__name__, '(%s is None)'
+                         % (env_var,))
+                return []
+            if os.path.isfile(d):
+                dirs = [os.path.dirname(d)] + dirs
+                l = getattr(self, '_lib_names', [])
+                if len(l) == 1:
+                    b = os.path.basename(d)
+                    b = os.path.splitext(b)[0]
+                    if b[:3] == 'lib':
+                        log.info('Replacing _lib_names[0]==%r with %r' \
+                              % (self._lib_names[0], b[3:]))
+                        self._lib_names[0] = b[3:]
+            else:
+                ds = d.split(os.pathsep)
+                ds2 = []
+                for d in ds:
+                    if os.path.isdir(d):
+                        ds2.append(d)
+                        for dd in ['include', 'lib']:
+                            d1 = os.path.join(d, dd)
+                            if os.path.isdir(d1):
+                                ds2.append(d1)
+                dirs = ds2 + dirs
+        default_dirs = self.cp.get(self.section, key).split(os.pathsep)
+        dirs.extend(default_dirs)
+        ret = []
+        for d in dirs:
+            if len(d) > 0 and not os.path.isdir(d):
+                warnings.warn('Specified path %s is invalid.' % d, stacklevel=2)
+                continue
+
+            if d not in ret:
+                ret.append(d)
+
+        log.debug('( %s = %s )', key, ':'.join(ret))
+        return ret
+
+    def get_lib_dirs(self, key='library_dirs'):
+        return self.get_paths(self.section, key)
+
+    def get_runtime_lib_dirs(self, key='runtime_library_dirs'):
+        path = self.get_paths(self.section, key)
+        if path == ['']:
+            path = []
+        return path
+
+    def get_include_dirs(self, key='include_dirs'):
+        return self.get_paths(self.section, key)
+
+    def get_src_dirs(self, key='src_dirs'):
+        return self.get_paths(self.section, key)
+
+    def get_libs(self, key, default):
+        try:
+            libs = self.cp.get(self.section, key)
+        except NoOptionError:
+            if not default:
+                return []
+            if is_string(default):
+                return [default]
+            return default
+        return [b for b in [a.strip() for a in libs.split(',')] if b]
+
+    def get_libraries(self, key='libraries'):
+        if hasattr(self, '_lib_names'):
+            return self.get_libs(key, default=self._lib_names)
+        else:
+            return self.get_libs(key, '')
+
+    def library_extensions(self):
+        c = customized_ccompiler()
+        static_exts = []
+        if c.compiler_type != 'msvc':
+            # MSVC doesn't understand binutils
+            static_exts.append('.a')
+        if sys.platform == 'win32':
+            static_exts.append('.lib')  # .lib is used by MSVC and others
+        if self.search_static_first:
+            exts = static_exts + [so_ext]
+        else:
+            exts = [so_ext] + static_exts
+        if sys.platform == 'cygwin':
+            exts.append('.dll.a')
+        if sys.platform == 'darwin':
+            exts.append('.dylib')
+        return exts
+
+    def check_libs(self, lib_dirs, libs, opt_libs=[]):
+        """If static or shared libraries are available then return
+        their info dictionary.
+
+        Checks for all libraries as shared libraries first, then
+        static (or vice versa if self.search_static_first is True).
+        """
+        exts = self.library_extensions()
+        info = None
+        for ext in exts:
+            info = self._check_libs(lib_dirs, libs, opt_libs, [ext])
+            if info is not None:
+                break
+        if not info:
+            log.info('  libraries %s not found in %s', ','.join(libs),
+                     lib_dirs)
+        return info
+
+    def check_libs2(self, lib_dirs, libs, opt_libs=[]):
+        """If static or shared libraries are available then return
+        their info dictionary.
+
+        Checks each library for shared or static.
+        """
+        exts = self.library_extensions()
+        info = self._check_libs(lib_dirs, libs, opt_libs, exts)
+        if not info:
+            log.info('  libraries %s not found in %s', ','.join(libs),
+                     lib_dirs)
+
+        return info
+
+    def _find_lib(self, lib_dir, lib, exts):
+        assert is_string(lib_dir)
+        # under windows first try without 'lib' prefix
+        if sys.platform == 'win32':
+            lib_prefixes = ['', 'lib']
+        else:
+            lib_prefixes = ['lib']
+        # for each library name, see if we can find a file for it.
+        for ext in exts:
+            for prefix in lib_prefixes:
+                p = self.combine_paths(lib_dir, prefix + lib + ext)
+                if p:
+                    break
+            if p:
+                assert len(p) == 1
+                # ??? splitext on p[0] would do this for cygwin
+                # doesn't seem correct
+                if ext == '.dll.a':
+                    lib += '.dll'
+                if ext == '.lib':
+                    lib = prefix + lib
+                return lib
+
+        return False
+
+    def _find_libs(self, lib_dirs, libs, exts):
+        # make sure we preserve the order of libs, as it can be important
+        found_dirs, found_libs = [], []
+        for lib in libs:
+            for lib_dir in lib_dirs:
+                found_lib = self._find_lib(lib_dir, lib, exts)
+                if found_lib:
+                    found_libs.append(found_lib)
+                    if lib_dir not in found_dirs:
+                        found_dirs.append(lib_dir)
+                    break
+        return found_dirs, found_libs
+
+    def _check_libs(self, lib_dirs, libs, opt_libs, exts):
+        """Find mandatory and optional libs in expected paths.
+
+        Missing optional libraries are silently forgotten.
+        """
+        if not is_sequence(lib_dirs):
+            lib_dirs = [lib_dirs]
+        # First, try to find the mandatory libraries
+        found_dirs, found_libs = self._find_libs(lib_dirs, libs, exts)
+        if len(found_libs) > 0 and len(found_libs) == len(libs):
+            # Now, check for optional libraries
+            opt_found_dirs, opt_found_libs = self._find_libs(lib_dirs, opt_libs, exts)
+            found_libs.extend(opt_found_libs)
+            for lib_dir in opt_found_dirs:
+                if lib_dir not in found_dirs:
+                    found_dirs.append(lib_dir)
+            info = {'libraries': found_libs, 'library_dirs': found_dirs}
+            return info
+        else:
+            return None
+
+    def combine_paths(self, *args):
+        """Return a list of existing paths composed by all combinations
+        of items from the arguments.
+        """
+        return combine_paths(*args)
+
+
+class fft_opt_info(system_info):
+
+    def calc_info(self):
+        info = {}
+        fftw_info = get_info('fftw3') or get_info('fftw2') or get_info('dfftw')
+        djbfft_info = get_info('djbfft')
+        if fftw_info:
+            dict_append(info, **fftw_info)
+            if djbfft_info:
+                dict_append(info, **djbfft_info)
+            self.set_info(**info)
+            return
+
+
+class fftw_info(system_info):
+    #variables to override
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    notfounderror = FFTWNotFoundError
+    ver_info = [{'name':'fftw3',
+                    'libs':['fftw3'],
+                    'includes':['fftw3.h'],
+                    'macros':[('SCIPY_FFTW3_H', None)]},
+                  {'name':'fftw2',
+                    'libs':['rfftw', 'fftw'],
+                    'includes':['fftw.h', 'rfftw.h'],
+                    'macros':[('SCIPY_FFTW_H', None)]}]
+
+    def calc_ver_info(self, ver_param):
+        """Returns True on successful version detection, else False"""
+        lib_dirs = self.get_lib_dirs()
+        incl_dirs = self.get_include_dirs()
+
+        opt = self.get_option_single(self.section + '_libs', 'libraries')
+        libs = self.get_libs(opt, ver_param['libs'])
+        info = self.check_libs(lib_dirs, libs)
+        if info is not None:
+            flag = 0
+            for d in incl_dirs:
+                if len(self.combine_paths(d, ver_param['includes'])) \
+                   == len(ver_param['includes']):
+                    dict_append(info, include_dirs=[d])
+                    flag = 1
+                    break
+            if flag:
+                dict_append(info, define_macros=ver_param['macros'])
+            else:
+                info = None
+        if info is not None:
+            self.set_info(**info)
+            return True
+        else:
+            log.info('  %s not found' % (ver_param['name']))
+            return False
+
+    def calc_info(self):
+        for i in self.ver_info:
+            if self.calc_ver_info(i):
+                break
+
+
+class fftw2_info(fftw_info):
+    #variables to override
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    notfounderror = FFTWNotFoundError
+    ver_info = [{'name':'fftw2',
+                    'libs':['rfftw', 'fftw'],
+                    'includes':['fftw.h', 'rfftw.h'],
+                    'macros':[('SCIPY_FFTW_H', None)]}
+                  ]
+
+
+class fftw3_info(fftw_info):
+    #variables to override
+    section = 'fftw3'
+    dir_env_var = 'FFTW3'
+    notfounderror = FFTWNotFoundError
+    ver_info = [{'name':'fftw3',
+                    'libs':['fftw3'],
+                    'includes':['fftw3.h'],
+                    'macros':[('SCIPY_FFTW3_H', None)]},
+                  ]
+
+
+class dfftw_info(fftw_info):
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    ver_info = [{'name':'dfftw',
+                    'libs':['drfftw', 'dfftw'],
+                    'includes':['dfftw.h', 'drfftw.h'],
+                    'macros':[('SCIPY_DFFTW_H', None)]}]
+
+
+class sfftw_info(fftw_info):
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    ver_info = [{'name':'sfftw',
+                    'libs':['srfftw', 'sfftw'],
+                    'includes':['sfftw.h', 'srfftw.h'],
+                    'macros':[('SCIPY_SFFTW_H', None)]}]
+
+
+class fftw_threads_info(fftw_info):
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    ver_info = [{'name':'fftw threads',
+                    'libs':['rfftw_threads', 'fftw_threads'],
+                    'includes':['fftw_threads.h', 'rfftw_threads.h'],
+                    'macros':[('SCIPY_FFTW_THREADS_H', None)]}]
+
+
+class dfftw_threads_info(fftw_info):
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    ver_info = [{'name':'dfftw threads',
+                    'libs':['drfftw_threads', 'dfftw_threads'],
+                    'includes':['dfftw_threads.h', 'drfftw_threads.h'],
+                    'macros':[('SCIPY_DFFTW_THREADS_H', None)]}]
+
+
+class sfftw_threads_info(fftw_info):
+    section = 'fftw'
+    dir_env_var = 'FFTW'
+    ver_info = [{'name':'sfftw threads',
+                    'libs':['srfftw_threads', 'sfftw_threads'],
+                    'includes':['sfftw_threads.h', 'srfftw_threads.h'],
+                    'macros':[('SCIPY_SFFTW_THREADS_H', None)]}]
+
+
+class djbfft_info(system_info):
+    section = 'djbfft'
+    dir_env_var = 'DJBFFT'
+    notfounderror = DJBFFTNotFoundError
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend(self.combine_paths(d, ['djbfft']) + [d])
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        incl_dirs = self.get_include_dirs()
+        info = None
+        for d in lib_dirs:
+            p = self.combine_paths(d, ['djbfft.a'])
+            if p:
+                info = {'extra_objects': p}
+                break
+            p = self.combine_paths(d, ['libdjbfft.a', 'libdjbfft' + so_ext])
+            if p:
+                info = {'libraries': ['djbfft'], 'library_dirs': [d]}
+                break
+        if info is None:
+            return
+        for d in incl_dirs:
+            if len(self.combine_paths(d, ['fftc8.h', 'fftfreq.h'])) == 2:
+                dict_append(info, include_dirs=[d],
+                            define_macros=[('SCIPY_DJBFFT_H', None)])
+                self.set_info(**info)
+                return
+        return
+
+
+class mkl_info(system_info):
+    section = 'mkl'
+    dir_env_var = 'MKLROOT'
+    _lib_mkl = ['mkl_rt']
+
+    def get_mkl_rootdir(self):
+        mklroot = os.environ.get('MKLROOT', None)
+        if mklroot is not None:
+            return mklroot
+        paths = os.environ.get('LD_LIBRARY_PATH', '').split(os.pathsep)
+        ld_so_conf = '/etc/ld.so.conf'
+        if os.path.isfile(ld_so_conf):
+            with open(ld_so_conf, 'r') as f:
+                for d in f:
+                    d = d.strip()
+                    if d:
+                        paths.append(d)
+        intel_mkl_dirs = []
+        for path in paths:
+            path_atoms = path.split(os.sep)
+            for m in path_atoms:
+                if m.startswith('mkl'):
+                    d = os.sep.join(path_atoms[:path_atoms.index(m) + 2])
+                    intel_mkl_dirs.append(d)
+                    break
+        for d in paths:
+            dirs = glob(os.path.join(d, 'mkl', '*'))
+            dirs += glob(os.path.join(d, 'mkl*'))
+            for sub_dir in dirs:
+                if os.path.isdir(os.path.join(sub_dir, 'lib')):
+                    return sub_dir
+        return None
+
+    def __init__(self):
+        mklroot = self.get_mkl_rootdir()
+        if mklroot is None:
+            system_info.__init__(self)
+        else:
+            from .cpuinfo import cpu
+            if cpu.is_Itanium():
+                plt = '64'
+            elif cpu.is_Intel() and cpu.is_64bit():
+                plt = 'intel64'
+            else:
+                plt = '32'
+            system_info.__init__(
+                self,
+                default_lib_dirs=[os.path.join(mklroot, 'lib', plt)],
+                default_include_dirs=[os.path.join(mklroot, 'include')])
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        incl_dirs = self.get_include_dirs()
+        opt = self.get_option_single('mkl_libs', 'libraries')
+        mkl_libs = self.get_libs(opt, self._lib_mkl)
+        info = self.check_libs2(lib_dirs, mkl_libs)
+        if info is None:
+            return
+        dict_append(info,
+                    define_macros=[('SCIPY_MKL_H', None),
+                                   ('HAVE_CBLAS', None)],
+                    include_dirs=incl_dirs)
+        if sys.platform == 'win32':
+            pass  # win32 has no pthread library
+        else:
+            dict_append(info, libraries=['pthread'])
+        self.set_info(**info)
+
+
+class lapack_mkl_info(mkl_info):
+    pass
+
+
+class blas_mkl_info(mkl_info):
+    pass
+
+
+class atlas_info(system_info):
+    section = 'atlas'
+    dir_env_var = 'ATLAS'
+    _lib_names = ['f77blas', 'cblas']
+    if sys.platform[:7] == 'freebsd':
+        _lib_atlas = ['atlas_r']
+        _lib_lapack = ['alapack_r']
+    else:
+        _lib_atlas = ['atlas']
+        _lib_lapack = ['lapack']
+
+    notfounderror = AtlasNotFoundError
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend(self.combine_paths(d, ['atlas*', 'ATLAS*',
+                                         'sse', '3dnow', 'sse2']) + [d])
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        info = {}
+        opt = self.get_option_single('atlas_libs', 'libraries')
+        atlas_libs = self.get_libs(opt, self._lib_names + self._lib_atlas)
+        lapack_libs = self.get_libs('lapack_libs', self._lib_lapack)
+        atlas = None
+        lapack = None
+        atlas_1 = None
+        for d in lib_dirs:
+            # FIXME: lapack_atlas is unused
+            lapack_atlas = self.check_libs2(d, ['lapack_atlas'], [])
+            atlas = self.check_libs2(d, atlas_libs, [])
+            if atlas is not None:
+                lib_dirs2 = [d] + self.combine_paths(d, ['atlas*', 'ATLAS*'])
+                lapack = self.check_libs2(lib_dirs2, lapack_libs, [])
+                if lapack is not None:
+                    break
+            if atlas:
+                atlas_1 = atlas
+        log.info(self.__class__)
+        if atlas is None:
+            atlas = atlas_1
+        if atlas is None:
+            return
+        include_dirs = self.get_include_dirs()
+        h = (self.combine_paths(lib_dirs + include_dirs, 'cblas.h') or [None])
+        h = h[0]
+        if h:
+            h = os.path.dirname(h)
+            dict_append(info, include_dirs=[h])
+        info['language'] = 'c'
+        if lapack is not None:
+            dict_append(info, **lapack)
+            dict_append(info, **atlas)
+        elif 'lapack_atlas' in atlas['libraries']:
+            dict_append(info, **atlas)
+            dict_append(info,
+                        define_macros=[('ATLAS_WITH_LAPACK_ATLAS', None)])
+            self.set_info(**info)
+            return
+        else:
+            dict_append(info, **atlas)
+            dict_append(info, define_macros=[('ATLAS_WITHOUT_LAPACK', None)])
+            message = textwrap.dedent("""
+                *********************************************************************
+                    Could not find lapack library within the ATLAS installation.
+                *********************************************************************
+                """)
+            warnings.warn(message, stacklevel=2)
+            self.set_info(**info)
+            return
+
+        # Check if lapack library is complete, only warn if it is not.
+        lapack_dir = lapack['library_dirs'][0]
+        lapack_name = lapack['libraries'][0]
+        lapack_lib = None
+        lib_prefixes = ['lib']
+        if sys.platform == 'win32':
+            lib_prefixes.append('')
+        for e in self.library_extensions():
+            for prefix in lib_prefixes:
+                fn = os.path.join(lapack_dir, prefix + lapack_name + e)
+                if os.path.exists(fn):
+                    lapack_lib = fn
+                    break
+            if lapack_lib:
+                break
+        if lapack_lib is not None:
+            sz = os.stat(lapack_lib)[6]
+            if sz <= 4000 * 1024:
+                message = textwrap.dedent("""
+                    *********************************************************************
+                        Lapack library (from ATLAS) is probably incomplete:
+                          size of %s is %sk (expected >4000k)
+
+                        Follow the instructions in the KNOWN PROBLEMS section of the file
+                        numpy/INSTALL.txt.
+                    *********************************************************************
+                    """) % (lapack_lib, sz / 1024)
+                warnings.warn(message, stacklevel=2)
+            else:
+                info['language'] = 'f77'
+
+        atlas_version, atlas_extra_info = get_atlas_version(**atlas)
+        dict_append(info, **atlas_extra_info)
+
+        self.set_info(**info)
+
+
+class atlas_blas_info(atlas_info):
+    _lib_names = ['f77blas', 'cblas']
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        info = {}
+        opt = self.get_option_single('atlas_libs', 'libraries')
+        atlas_libs = self.get_libs(opt, self._lib_names + self._lib_atlas)
+        atlas = self.check_libs2(lib_dirs, atlas_libs, [])
+        if atlas is None:
+            return
+        include_dirs = self.get_include_dirs()
+        h = (self.combine_paths(lib_dirs + include_dirs, 'cblas.h') or [None])
+        h = h[0]
+        if h:
+            h = os.path.dirname(h)
+            dict_append(info, include_dirs=[h])
+        info['language'] = 'c'
+        info['define_macros'] = [('HAVE_CBLAS', None)]
+
+        atlas_version, atlas_extra_info = get_atlas_version(**atlas)
+        dict_append(atlas, **atlas_extra_info)
+
+        dict_append(info, **atlas)
+
+        self.set_info(**info)
+        return
+
+
+class atlas_threads_info(atlas_info):
+    dir_env_var = ['PTATLAS', 'ATLAS']
+    _lib_names = ['ptf77blas', 'ptcblas']
+
+
+class atlas_blas_threads_info(atlas_blas_info):
+    dir_env_var = ['PTATLAS', 'ATLAS']
+    _lib_names = ['ptf77blas', 'ptcblas']
+
+
+class lapack_atlas_info(atlas_info):
+    _lib_names = ['lapack_atlas'] + atlas_info._lib_names
+
+
+class lapack_atlas_threads_info(atlas_threads_info):
+    _lib_names = ['lapack_atlas'] + atlas_threads_info._lib_names
+
+
+class atlas_3_10_info(atlas_info):
+    _lib_names = ['satlas']
+    _lib_atlas = _lib_names
+    _lib_lapack = _lib_names
+
+
+class atlas_3_10_blas_info(atlas_3_10_info):
+    _lib_names = ['satlas']
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        info = {}
+        opt = self.get_option_single('atlas_lib', 'libraries')
+        atlas_libs = self.get_libs(opt, self._lib_names)
+        atlas = self.check_libs2(lib_dirs, atlas_libs, [])
+        if atlas is None:
+            return
+        include_dirs = self.get_include_dirs()
+        h = (self.combine_paths(lib_dirs + include_dirs, 'cblas.h') or [None])
+        h = h[0]
+        if h:
+            h = os.path.dirname(h)
+            dict_append(info, include_dirs=[h])
+        info['language'] = 'c'
+        info['define_macros'] = [('HAVE_CBLAS', None)]
+
+        atlas_version, atlas_extra_info = get_atlas_version(**atlas)
+        dict_append(atlas, **atlas_extra_info)
+
+        dict_append(info, **atlas)
+
+        self.set_info(**info)
+        return
+
+
+class atlas_3_10_threads_info(atlas_3_10_info):
+    dir_env_var = ['PTATLAS', 'ATLAS']
+    _lib_names = ['tatlas']
+    _lib_atlas = _lib_names
+    _lib_lapack = _lib_names
+
+
+class atlas_3_10_blas_threads_info(atlas_3_10_blas_info):
+    dir_env_var = ['PTATLAS', 'ATLAS']
+    _lib_names = ['tatlas']
+
+
+class lapack_atlas_3_10_info(atlas_3_10_info):
+    pass
+
+
+class lapack_atlas_3_10_threads_info(atlas_3_10_threads_info):
+    pass
+
+
+class lapack_info(system_info):
+    section = 'lapack'
+    dir_env_var = 'LAPACK'
+    _lib_names = ['lapack']
+    notfounderror = LapackNotFoundError
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+
+        opt = self.get_option_single('lapack_libs', 'libraries')
+        lapack_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs(lib_dirs, lapack_libs, [])
+        if info is None:
+            return
+        info['language'] = 'f77'
+        self.set_info(**info)
+
+
+class lapack_src_info(system_info):
+    section = 'lapack_src'
+    dir_env_var = 'LAPACK_SRC'
+    notfounderror = LapackSrcNotFoundError
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend([d] + self.combine_paths(d, ['LAPACK*/SRC', 'SRC']))
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        src_dirs = self.get_src_dirs()
+        src_dir = ''
+        for d in src_dirs:
+            if os.path.isfile(os.path.join(d, 'dgesv.f')):
+                src_dir = d
+                break
+        if not src_dir:
+            #XXX: Get sources from netlib. May be ask first.
+            return
+        # The following is extracted from LAPACK-3.0/SRC/Makefile.
+        # Added missing names from lapack-lite-3.1.1/SRC/Makefile
+        # while keeping removed names for Lapack-3.0 compatibility.
+        allaux = '''
+        ilaenv ieeeck lsame lsamen xerbla
+        iparmq
+        '''  # *.f
+        laux = '''
+        bdsdc bdsqr disna labad lacpy ladiv lae2 laebz laed0 laed1
+        laed2 laed3 laed4 laed5 laed6 laed7 laed8 laed9 laeda laev2
+        lagtf lagts lamch lamrg lanst lapy2 lapy3 larnv larrb larre
+        larrf lartg laruv las2 lascl lasd0 lasd1 lasd2 lasd3 lasd4
+        lasd5 lasd6 lasd7 lasd8 lasd9 lasda lasdq lasdt laset lasq1
+        lasq2 lasq3 lasq4 lasq5 lasq6 lasr lasrt lassq lasv2 pttrf
+        stebz stedc steqr sterf
+
+        larra larrc larrd larr larrk larrj larrr laneg laisnan isnan
+        lazq3 lazq4
+        '''  # [s|d]*.f
+        lasrc = '''
+        gbbrd gbcon gbequ gbrfs gbsv gbsvx gbtf2 gbtrf gbtrs gebak
+        gebal gebd2 gebrd gecon geequ gees geesx geev geevx gegs gegv
+        gehd2 gehrd gelq2 gelqf gels gelsd gelss gelsx gelsy geql2
+        geqlf geqp3 geqpf geqr2 geqrf gerfs gerq2 gerqf gesc2 gesdd
+        gesv gesvd gesvx getc2 getf2 getrf getri getrs ggbak ggbal
+        gges ggesx ggev ggevx ggglm gghrd gglse ggqrf ggrqf ggsvd
+        ggsvp gtcon gtrfs gtsv gtsvx gttrf gttrs gtts2 hgeqz hsein
+        hseqr labrd lacon laein lags2 lagtm lahqr lahrd laic1 lals0
+        lalsa lalsd langb lange langt lanhs lansb lansp lansy lantb
+        lantp lantr lapll lapmt laqgb laqge laqp2 laqps laqsb laqsp
+        laqsy lar1v lar2v larf larfb larfg larft larfx largv larrv
+        lartv larz larzb larzt laswp lasyf latbs latdf latps latrd
+        latrs latrz latzm lauu2 lauum pbcon pbequ pbrfs pbstf pbsv
+        pbsvx pbtf2 pbtrf pbtrs pocon poequ porfs posv posvx potf2
+        potrf potri potrs ppcon ppequ pprfs ppsv ppsvx pptrf pptri
+        pptrs ptcon pteqr ptrfs ptsv ptsvx pttrs ptts2 spcon sprfs
+        spsv spsvx sptrf sptri sptrs stegr stein sycon syrfs sysv
+        sysvx sytf2 sytrf sytri sytrs tbcon tbrfs tbtrs tgevc tgex2
+        tgexc tgsen tgsja tgsna tgsy2 tgsyl tpcon tprfs tptri tptrs
+        trcon trevc trexc trrfs trsen trsna trsyl trti2 trtri trtrs
+        tzrqf tzrzf
+
+        lacn2 lahr2 stemr laqr0 laqr1 laqr2 laqr3 laqr4 laqr5
+        '''  # [s|c|d|z]*.f
+        sd_lasrc = '''
+        laexc lag2 lagv2 laln2 lanv2 laqtr lasy2 opgtr opmtr org2l
+        org2r orgbr orghr orgl2 orglq orgql orgqr orgr2 orgrq orgtr
+        orm2l orm2r ormbr ormhr orml2 ormlq ormql ormqr ormr2 ormr3
+        ormrq ormrz ormtr rscl sbev sbevd sbevx sbgst sbgv sbgvd sbgvx
+        sbtrd spev spevd spevx spgst spgv spgvd spgvx sptrd stev stevd
+        stevr stevx syev syevd syevr syevx sygs2 sygst sygv sygvd
+        sygvx sytd2 sytrd
+        '''  # [s|d]*.f
+        cz_lasrc = '''
+        bdsqr hbev hbevd hbevx hbgst hbgv hbgvd hbgvx hbtrd hecon heev
+        heevd heevr heevx hegs2 hegst hegv hegvd hegvx herfs hesv
+        hesvx hetd2 hetf2 hetrd hetrf hetri hetrs hpcon hpev hpevd
+        hpevx hpgst hpgv hpgvd hpgvx hprfs hpsv hpsvx hptrd hptrf
+        hptri hptrs lacgv lacp2 lacpy lacrm lacrt ladiv laed0 laed7
+        laed8 laesy laev2 lahef lanhb lanhe lanhp lanht laqhb laqhe
+        laqhp larcm larnv lartg lascl laset lasr lassq pttrf rot spmv
+        spr stedc steqr symv syr ung2l ung2r ungbr unghr ungl2 unglq
+        ungql ungqr ungr2 ungrq ungtr unm2l unm2r unmbr unmhr unml2
+        unmlq unmql unmqr unmr2 unmr3 unmrq unmrz unmtr upgtr upmtr
+        '''  # [c|z]*.f
+        #######
+        sclaux = laux + ' econd '                  # s*.f
+        dzlaux = laux + ' secnd '                  # d*.f
+        slasrc = lasrc + sd_lasrc                  # s*.f
+        dlasrc = lasrc + sd_lasrc                  # d*.f
+        clasrc = lasrc + cz_lasrc + ' srot srscl '  # c*.f
+        zlasrc = lasrc + cz_lasrc + ' drot drscl '  # z*.f
+        oclasrc = ' icmax1 scsum1 '                # *.f
+        ozlasrc = ' izmax1 dzsum1 '                # *.f
+        sources = ['s%s.f' % f for f in (sclaux + slasrc).split()] \
+                  + ['d%s.f' % f for f in (dzlaux + dlasrc).split()] \
+                  + ['c%s.f' % f for f in (clasrc).split()] \
+                  + ['z%s.f' % f for f in (zlasrc).split()] \
+                  + ['%s.f' % f for f in (allaux + oclasrc + ozlasrc).split()]
+        sources = [os.path.join(src_dir, f) for f in sources]
+        # Lapack 3.1:
+        src_dir2 = os.path.join(src_dir, '..', 'INSTALL')
+        sources += [os.path.join(src_dir2, p + 'lamch.f') for p in 'sdcz']
+        # Lapack 3.2.1:
+        sources += [os.path.join(src_dir, p + 'larfp.f') for p in 'sdcz']
+        sources += [os.path.join(src_dir, 'ila' + p + 'lr.f') for p in 'sdcz']
+        sources += [os.path.join(src_dir, 'ila' + p + 'lc.f') for p in 'sdcz']
+        # Should we check here actual existence of source files?
+        # Yes, the file listing is different between 3.0 and 3.1
+        # versions.
+        sources = [f for f in sources if os.path.isfile(f)]
+        info = {'sources': sources, 'language': 'f77'}
+        self.set_info(**info)
+
+atlas_version_c_text = r'''
+/* This file is generated from numpy/distutils/system_info.py */
+void ATL_buildinfo(void);
+int main(void) {
+  ATL_buildinfo();
+  return 0;
+}
+'''
+
+_cached_atlas_version = {}
+
+
+def get_atlas_version(**config):
+    libraries = config.get('libraries', [])
+    library_dirs = config.get('library_dirs', [])
+    key = (tuple(libraries), tuple(library_dirs))
+    if key in _cached_atlas_version:
+        return _cached_atlas_version[key]
+    c = cmd_config(Distribution())
+    atlas_version = None
+    info = {}
+    try:
+        s, o = c.get_output(atlas_version_c_text,
+                            libraries=libraries, library_dirs=library_dirs,
+                           )
+        if s and re.search(r'undefined reference to `_gfortran', o, re.M):
+            s, o = c.get_output(atlas_version_c_text,
+                                libraries=libraries + ['gfortran'],
+                                library_dirs=library_dirs,
+                               )
+            if not s:
+                warnings.warn(textwrap.dedent("""
+                    *****************************************************
+                    Linkage with ATLAS requires gfortran. Use
+
+                      python setup.py config_fc --fcompiler=gnu95 ...
+
+                    when building extension libraries that use ATLAS.
+                    Make sure that -lgfortran is used for C++ extensions.
+                    *****************************************************
+                    """), stacklevel=2)
+                dict_append(info, language='f90',
+                            define_macros=[('ATLAS_REQUIRES_GFORTRAN', None)])
+    except Exception:  # failed to get version from file -- maybe on Windows
+        # look at directory name
+        for o in library_dirs:
+            m = re.search(r'ATLAS_(?P<version>\d+[.]\d+[.]\d+)_', o)
+            if m:
+                atlas_version = m.group('version')
+            if atlas_version is not None:
+                break
+
+        # final choice --- look at ATLAS_VERSION environment
+        #   variable
+        if atlas_version is None:
+            atlas_version = os.environ.get('ATLAS_VERSION', None)
+        if atlas_version:
+            dict_append(info, define_macros=[(
+                'ATLAS_INFO', _c_string_literal(atlas_version))
+            ])
+        else:
+            dict_append(info, define_macros=[('NO_ATLAS_INFO', -1)])
+        return atlas_version or '?.?.?', info
+
+    if not s:
+        m = re.search(r'ATLAS version (?P<version>\d+[.]\d+[.]\d+)', o)
+        if m:
+            atlas_version = m.group('version')
+    if atlas_version is None:
+        if re.search(r'undefined symbol: ATL_buildinfo', o, re.M):
+            atlas_version = '3.2.1_pre3.3.6'
+        else:
+            log.info('Status: %d', s)
+            log.info('Output: %s', o)
+
+    elif atlas_version == '3.2.1_pre3.3.6':
+        dict_append(info, define_macros=[('NO_ATLAS_INFO', -2)])
+    else:
+        dict_append(info, define_macros=[(
+            'ATLAS_INFO', _c_string_literal(atlas_version))
+        ])
+    result = _cached_atlas_version[key] = atlas_version, info
+    return result
+
+
+class lapack_opt_info(system_info):
+    notfounderror = LapackNotFoundError
+    # List of all known BLAS libraries, in the default order
+    lapack_order = ['mkl', 'openblas', 'flame', 'atlas', 'accelerate', 'lapack']
+    order_env_var_name = 'NPY_LAPACK_ORDER'
+
+    def _calc_info_mkl(self):
+        info = get_info('lapack_mkl')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_openblas(self):
+        info = get_info('openblas_lapack')
+        if info:
+            self.set_info(**info)
+            return True
+        info = get_info('openblas_clapack')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_flame(self):
+        info = get_info('flame')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_atlas(self):
+        info = get_info('atlas_3_10_threads')
+        if not info:
+            info = get_info('atlas_3_10')
+        if not info:
+            info = get_info('atlas_threads')
+        if not info:
+            info = get_info('atlas')
+        if info:
+            # Figure out if ATLAS has lapack...
+            # If not we need the lapack library, but not BLAS!
+            l = info.get('define_macros', [])
+            if ('ATLAS_WITH_LAPACK_ATLAS', None) in l \
+               or ('ATLAS_WITHOUT_LAPACK', None) in l:
+                # Get LAPACK (with possible warnings)
+                # If not found we don't accept anything
+                # since we can't use ATLAS with LAPACK!
+                lapack_info = self._get_info_lapack()
+                if not lapack_info:
+                    return False
+                dict_append(info, **lapack_info)
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_accelerate(self):
+        info = get_info('accelerate')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _get_info_blas(self):
+        # Default to get the optimized BLAS implementation
+        info = get_info('blas_opt')
+        if not info:
+            warnings.warn(BlasNotFoundError.__doc__ or '', stacklevel=3)
+            info_src = get_info('blas_src')
+            if not info_src:
+                warnings.warn(BlasSrcNotFoundError.__doc__ or '', stacklevel=3)
+                return {}
+            dict_append(info, libraries=[('fblas_src', info_src)])
+        return info
+
+    def _get_info_lapack(self):
+        info = get_info('lapack')
+        if not info:
+            warnings.warn(LapackNotFoundError.__doc__ or '', stacklevel=3)
+            info_src = get_info('lapack_src')
+            if not info_src:
+                warnings.warn(LapackSrcNotFoundError.__doc__ or '', stacklevel=3)
+                return {}
+            dict_append(info, libraries=[('flapack_src', info_src)])
+        return info
+
+    def _calc_info_lapack(self):
+        info = self._get_info_lapack()
+        if info:
+            info_blas = self._get_info_blas()
+            dict_append(info, **info_blas)
+            dict_append(info, define_macros=[('NO_ATLAS_INFO', 1)])
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info(self, name):
+        return getattr(self, '_calc_info_{}'.format(name))()
+
+    def calc_info(self):
+        user_order = os.environ.get(self.order_env_var_name, None)
+        if user_order is None:
+            lapack_order = self.lapack_order
+        else:
+            # the user has requested the order of the
+            # check they are all in the available list, a COMMA SEPARATED list
+            user_order = user_order.lower().split(',')
+            non_existing = []
+            lapack_order = []
+            for order in user_order:
+                if order in self.lapack_order:
+                    lapack_order.append(order)
+                elif len(order) > 0:
+                    non_existing.append(order)
+            if len(non_existing) > 0:
+                raise ValueError("lapack_opt_info user defined "
+                                 "LAPACK order has unacceptable "
+                                 "values: {}".format(non_existing))
+
+        for lapack in lapack_order:
+            if self._calc_info(lapack):
+                return
+
+        if 'lapack' not in lapack_order:
+            # Since the user may request *not* to use any library, we still need
+            # to raise warnings to signal missing packages!
+            warnings.warn(LapackNotFoundError.__doc__ or '', stacklevel=2)
+            warnings.warn(LapackSrcNotFoundError.__doc__ or '', stacklevel=2)
+
+
+class _ilp64_opt_info_mixin:
+    symbol_suffix = None
+    symbol_prefix = None
+
+    def _check_info(self, info):
+        macros = dict(info.get('define_macros', []))
+        prefix = macros.get('BLAS_SYMBOL_PREFIX', '')
+        suffix = macros.get('BLAS_SYMBOL_SUFFIX', '')
+
+        if self.symbol_prefix not in (None, prefix):
+            return False
+
+        if self.symbol_suffix not in (None, suffix):
+            return False
+
+        return bool(info)
+
+
+class lapack_ilp64_opt_info(lapack_opt_info, _ilp64_opt_info_mixin):
+    notfounderror = LapackILP64NotFoundError
+    lapack_order = ['openblas64_', 'openblas_ilp64']
+    order_env_var_name = 'NPY_LAPACK_ILP64_ORDER'
+
+    def _calc_info(self, name):
+        info = get_info(name + '_lapack')
+        if self._check_info(info):
+            self.set_info(**info)
+            return True
+        return False
+
+
+class lapack_ilp64_plain_opt_info(lapack_ilp64_opt_info):
+    # Same as lapack_ilp64_opt_info, but fix symbol names
+    symbol_prefix = ''
+    symbol_suffix = ''
+
+
+class lapack64__opt_info(lapack_ilp64_opt_info):
+    symbol_prefix = ''
+    symbol_suffix = '64_'
+
+
+class blas_opt_info(system_info):
+    notfounderror = BlasNotFoundError
+    # List of all known BLAS libraries, in the default order
+    blas_order = ['mkl', 'blis', 'openblas', 'atlas', 'accelerate', 'blas']
+    order_env_var_name = 'NPY_BLAS_ORDER'
+
+    def _calc_info_mkl(self):
+        info = get_info('blas_mkl')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_blis(self):
+        info = get_info('blis')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_openblas(self):
+        info = get_info('openblas')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_atlas(self):
+        info = get_info('atlas_3_10_blas_threads')
+        if not info:
+            info = get_info('atlas_3_10_blas')
+        if not info:
+            info = get_info('atlas_blas_threads')
+        if not info:
+            info = get_info('atlas_blas')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_accelerate(self):
+        info = get_info('accelerate')
+        if info:
+            self.set_info(**info)
+            return True
+        return False
+
+    def _calc_info_blas(self):
+        # Warn about a non-optimized BLAS library
+        warnings.warn(BlasOptNotFoundError.__doc__ or '', stacklevel=3)
+        info = {}
+        dict_append(info, define_macros=[('NO_ATLAS_INFO', 1)])
+
+        blas = get_info('blas')
+        if blas:
+            dict_append(info, **blas)
+        else:
+            # Not even BLAS was found!
+            warnings.warn(BlasNotFoundError.__doc__ or '', stacklevel=3)
+
+            blas_src = get_info('blas_src')
+            if not blas_src:
+                warnings.warn(BlasSrcNotFoundError.__doc__ or '', stacklevel=3)
+                return False
+            dict_append(info, libraries=[('fblas_src', blas_src)])
+
+        self.set_info(**info)
+        return True
+
+    def _calc_info(self, name):
+        return getattr(self, '_calc_info_{}'.format(name))()
+
+    def calc_info(self):
+        user_order = os.environ.get(self.order_env_var_name, None)
+        if user_order is None:
+            blas_order = self.blas_order
+        else:
+            # the user has requested the order of the
+            # check they are all in the available list
+            user_order = user_order.lower().split(',')
+            non_existing = []
+            blas_order = []
+            for order in user_order:
+                if order in self.blas_order:
+                    blas_order.append(order)
+                elif len(order) > 0:
+                    non_existing.append(order)
+            if len(non_existing) > 0:
+                raise ValueError("blas_opt_info user defined BLAS order has unacceptable values: {}".format(non_existing))
+
+        for blas in blas_order:
+            if self._calc_info(blas):
+                return
+
+        if 'blas' not in blas_order:
+            # Since the user may request *not* to use any library, we still need
+            # to raise warnings to signal missing packages!
+            warnings.warn(BlasNotFoundError.__doc__ or '', stacklevel=2)
+            warnings.warn(BlasSrcNotFoundError.__doc__ or '', stacklevel=2)
+
+
+class blas_ilp64_opt_info(blas_opt_info, _ilp64_opt_info_mixin):
+    notfounderror = BlasILP64NotFoundError
+    blas_order = ['openblas64_', 'openblas_ilp64']
+    order_env_var_name = 'NPY_BLAS_ILP64_ORDER'
+
+    def _calc_info(self, name):
+        info = get_info(name)
+        if self._check_info(info):
+            self.set_info(**info)
+            return True
+        return False
+
+
+class blas_ilp64_plain_opt_info(blas_ilp64_opt_info):
+    symbol_prefix = ''
+    symbol_suffix = ''
+
+
+class blas64__opt_info(blas_ilp64_opt_info):
+    symbol_prefix = ''
+    symbol_suffix = '64_'
+
+
+class blas_info(system_info):
+    section = 'blas'
+    dir_env_var = 'BLAS'
+    _lib_names = ['blas']
+    notfounderror = BlasNotFoundError
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        opt = self.get_option_single('blas_libs', 'libraries')
+        blas_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs(lib_dirs, blas_libs, [])
+        if info is None:
+            return
+        else:
+            info['include_dirs'] = self.get_include_dirs()
+        if platform.system() == 'Windows':
+            # The check for windows is needed because get_cblas_libs uses the
+            # same compiler that was used to compile Python and msvc is
+            # often not installed when mingw is being used. This rough
+            # treatment is not desirable, but windows is tricky.
+            info['language'] = 'f77'  # XXX: is it generally true?
+        else:
+            lib = self.get_cblas_libs(info)
+            if lib is not None:
+                info['language'] = 'c'
+                info['libraries'] = lib
+                info['define_macros'] = [('HAVE_CBLAS', None)]
+        self.set_info(**info)
+
+    def get_cblas_libs(self, info):
+        """ Check whether we can link with CBLAS interface
+
+        This method will search through several combinations of libraries
+        to check whether CBLAS is present:
+
+        1. Libraries in ``info['libraries']``, as is
+        2. As 1. but also explicitly adding ``'cblas'`` as a library
+        3. As 1. but also explicitly adding ``'blas'`` as a library
+        4. Check only library ``'cblas'``
+        5. Check only library ``'blas'``
+
+        Parameters
+        ----------
+        info : dict
+           system information dictionary for compilation and linking
+
+        Returns
+        -------
+        libraries : list of str or None
+            a list of libraries that enables the use of CBLAS interface.
+            Returns None if not found or a compilation error occurs.
+
+            Since 1.17 returns a list.
+        """
+        # primitive cblas check by looking for the header and trying to link
+        # cblas or blas
+        c = customized_ccompiler()
+        tmpdir = tempfile.mkdtemp()
+        s = textwrap.dedent("""\
+            #include <cblas.h>
+            int main(int argc, const char *argv[])
+            {
+                double a[4] = {1,2,3,4};
+                double b[4] = {5,6,7,8};
+                return cblas_ddot(4, a, 1, b, 1) > 10;
+            }""")
+        src = os.path.join(tmpdir, 'source.c')
+        try:
+            with open(src, 'wt') as f:
+                f.write(s)
+
+            try:
+                # check we can compile (find headers)
+                obj = c.compile([src], output_dir=tmpdir,
+                                include_dirs=self.get_include_dirs())
+            except (distutils.ccompiler.CompileError, distutils.ccompiler.LinkError):
+                return None
+
+            # check we can link (find library)
+            # some systems have separate cblas and blas libs.
+            for libs in [info['libraries'], ['cblas'] + info['libraries'],
+                         ['blas'] + info['libraries'], ['cblas'], ['blas']]:
+                try:
+                    c.link_executable(obj, os.path.join(tmpdir, "a.out"),
+                                      libraries=libs,
+                                      library_dirs=info['library_dirs'],
+                                      extra_postargs=info.get('extra_link_args', []))
+                    return libs
+                except distutils.ccompiler.LinkError:
+                    pass
+        finally:
+            shutil.rmtree(tmpdir)
+        return None
+
+
+class openblas_info(blas_info):
+    section = 'openblas'
+    dir_env_var = 'OPENBLAS'
+    _lib_names = ['openblas']
+    _require_symbols = []
+    notfounderror = BlasNotFoundError
+
+    @property
+    def symbol_prefix(self):
+        try:
+            return self.cp.get(self.section, 'symbol_prefix')
+        except NoOptionError:
+            return ''
+
+    @property
+    def symbol_suffix(self):
+        try:
+            return self.cp.get(self.section, 'symbol_suffix')
+        except NoOptionError:
+            return ''
+
+    def _calc_info(self):
+        c = customized_ccompiler()
+
+        lib_dirs = self.get_lib_dirs()
+
+        # Prefer to use libraries over openblas_libs
+        opt = self.get_option_single('openblas_libs', 'libraries')
+        openblas_libs = self.get_libs(opt, self._lib_names)
+
+        info = self.check_libs(lib_dirs, openblas_libs, [])
+
+        if c.compiler_type == "msvc" and info is None:
+            from numpy.distutils.fcompiler import new_fcompiler
+            f = new_fcompiler(c_compiler=c)
+            if f and f.compiler_type == 'gnu95':
+                # Try gfortran-compatible library files
+                info = self.check_msvc_gfortran_libs(lib_dirs, openblas_libs)
+                # Skip lapack check, we'd need build_ext to do it
+                skip_symbol_check = True
+        elif info:
+            skip_symbol_check = False
+            info['language'] = 'c'
+
+        if info is None:
+            return None
+
+        # Add extra info for OpenBLAS
+        extra_info = self.calc_extra_info()
+        dict_append(info, **extra_info)
+
+        if not (skip_symbol_check or self.check_symbols(info)):
+            return None
+
+        info['define_macros'] = [('HAVE_CBLAS', None)]
+        if self.symbol_prefix:
+            info['define_macros'] += [('BLAS_SYMBOL_PREFIX', self.symbol_prefix)]
+        if self.symbol_suffix:
+            info['define_macros'] += [('BLAS_SYMBOL_SUFFIX', self.symbol_suffix)]
+
+        return info
+
+    def calc_info(self):
+        info = self._calc_info()
+        if info is not None:
+            self.set_info(**info)
+
+    def check_msvc_gfortran_libs(self, library_dirs, libraries):
+        # First, find the full path to each library directory
+        library_paths = []
+        for library in libraries:
+            for library_dir in library_dirs:
+                # MinGW static ext will be .a
+                fullpath = os.path.join(library_dir, library + '.a')
+                if os.path.isfile(fullpath):
+                    library_paths.append(fullpath)
+                    break
+            else:
+                return None
+
+        # Generate numpy.distutils virtual static library file
+        basename = self.__class__.__name__
+        tmpdir = os.path.join(os.getcwd(), 'build', basename)
+        if not os.path.isdir(tmpdir):
+            os.makedirs(tmpdir)
+
+        info = {'library_dirs': [tmpdir],
+                'libraries': [basename],
+                'language': 'f77'}
+
+        fake_lib_file = os.path.join(tmpdir, basename + '.fobjects')
+        fake_clib_file = os.path.join(tmpdir, basename + '.cobjects')
+        with open(fake_lib_file, 'w') as f:
+            f.write("\n".join(library_paths))
+        with open(fake_clib_file, 'w') as f:
+            pass
+
+        return info
+
+    def check_symbols(self, info):
+        res = False
+        c = customized_ccompiler()
+
+        tmpdir = tempfile.mkdtemp()
+
+        prototypes = "\n".join("void %s%s%s();" % (self.symbol_prefix,
+                                                   symbol_name,
+                                                   self.symbol_suffix)
+                               for symbol_name in self._require_symbols)
+        calls = "\n".join("%s%s%s();" % (self.symbol_prefix,
+                                         symbol_name,
+                                         self.symbol_suffix)
+                          for symbol_name in self._require_symbols)
+        s = textwrap.dedent("""\
+            %(prototypes)s
+            int main(int argc, const char *argv[])
+            {
+                %(calls)s
+                return 0;
+            }""") % dict(prototypes=prototypes, calls=calls)
+        src = os.path.join(tmpdir, 'source.c')
+        out = os.path.join(tmpdir, 'a.out')
+        # Add the additional "extra" arguments
+        try:
+            extra_args = info['extra_link_args']
+        except Exception:
+            extra_args = []
+        try:
+            with open(src, 'wt') as f:
+                f.write(s)
+            obj = c.compile([src], output_dir=tmpdir)
+            try:
+                c.link_executable(obj, out, libraries=info['libraries'],
+                                  library_dirs=info['library_dirs'],
+                                  extra_postargs=extra_args)
+                res = True
+            except distutils.ccompiler.LinkError:
+                res = False
+        finally:
+            shutil.rmtree(tmpdir)
+        return res
+
+class openblas_lapack_info(openblas_info):
+    section = 'openblas'
+    dir_env_var = 'OPENBLAS'
+    _lib_names = ['openblas']
+    _require_symbols = ['zungqr_']
+    notfounderror = BlasNotFoundError
+
+class openblas_clapack_info(openblas_lapack_info):
+    _lib_names = ['openblas', 'lapack']
+
+class openblas_ilp64_info(openblas_info):
+    section = 'openblas_ilp64'
+    dir_env_var = 'OPENBLAS_ILP64'
+    _lib_names = ['openblas64']
+    _require_symbols = ['dgemm_', 'cblas_dgemm']
+    notfounderror = BlasILP64NotFoundError
+
+    def _calc_info(self):
+        info = super()._calc_info()
+        if info is not None:
+            info['define_macros'] += [('HAVE_BLAS_ILP64', None)]
+        return info
+
+class openblas_ilp64_lapack_info(openblas_ilp64_info):
+    _require_symbols = ['dgemm_', 'cblas_dgemm', 'zungqr_', 'LAPACKE_zungqr']
+
+    def _calc_info(self):
+        info = super()._calc_info()
+        if info:
+            info['define_macros'] += [('HAVE_LAPACKE', None)]
+        return info
+
+class openblas64__info(openblas_ilp64_info):
+    # ILP64 Openblas, with default symbol suffix
+    section = 'openblas64_'
+    dir_env_var = 'OPENBLAS64_'
+    _lib_names = ['openblas64_']
+    symbol_suffix = '64_'
+    symbol_prefix = ''
+
+class openblas64__lapack_info(openblas_ilp64_lapack_info, openblas64__info):
+    pass
+
+class blis_info(blas_info):
+    section = 'blis'
+    dir_env_var = 'BLIS'
+    _lib_names = ['blis']
+    notfounderror = BlasNotFoundError
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        opt = self.get_option_single('blis_libs', 'libraries')
+        blis_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs2(lib_dirs, blis_libs, [])
+        if info is None:
+            return
+
+        # Add include dirs
+        incl_dirs = self.get_include_dirs()
+        dict_append(info,
+                    language='c',
+                    define_macros=[('HAVE_CBLAS', None)],
+                    include_dirs=incl_dirs)
+        self.set_info(**info)
+
+
+class flame_info(system_info):
+    """ Usage of libflame for LAPACK operations
+
+    This requires libflame to be compiled with lapack wrappers:
+
+    ./configure --enable-lapack2flame ...
+
+    Be aware that libflame 5.1.0 has some missing names in the shared library, so
+    if you have problems, try the static flame library.
+    """
+    section = 'flame'
+    _lib_names = ['flame']
+    notfounderror = FlameNotFoundError
+
+    def check_embedded_lapack(self, info):
+        """ libflame does not necessarily have a wrapper for fortran LAPACK, we need to check """
+        c = customized_ccompiler()
+
+        tmpdir = tempfile.mkdtemp()
+        s = textwrap.dedent("""\
+            void zungqr_();
+            int main(int argc, const char *argv[])
+            {
+                zungqr_();
+                return 0;
+            }""")
+        src = os.path.join(tmpdir, 'source.c')
+        out = os.path.join(tmpdir, 'a.out')
+        # Add the additional "extra" arguments
+        extra_args = info.get('extra_link_args', [])
+        try:
+            with open(src, 'wt') as f:
+                f.write(s)
+            obj = c.compile([src], output_dir=tmpdir)
+            try:
+                c.link_executable(obj, out, libraries=info['libraries'],
+                                  library_dirs=info['library_dirs'],
+                                  extra_postargs=extra_args)
+                return True
+            except distutils.ccompiler.LinkError:
+                return False
+        finally:
+            shutil.rmtree(tmpdir)
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+        flame_libs = self.get_libs('libraries', self._lib_names)
+
+        info = self.check_libs2(lib_dirs, flame_libs, [])
+        if info is None:
+            return
+
+        if self.check_embedded_lapack(info):
+            # check if the user has supplied all information required
+            self.set_info(**info)
+        else:
+            # Try and get the BLAS lib to see if we can get it to work
+            blas_info = get_info('blas_opt')
+            if not blas_info:
+                # since we already failed once, this ain't going to work either
+                return
+
+            # Now we need to merge the two dictionaries
+            for key in blas_info:
+                if isinstance(blas_info[key], list):
+                    info[key] = info.get(key, []) + blas_info[key]
+                elif isinstance(blas_info[key], tuple):
+                    info[key] = info.get(key, ()) + blas_info[key]
+                else:
+                    info[key] = info.get(key, '') + blas_info[key]
+
+            # Now check again
+            if self.check_embedded_lapack(info):
+                self.set_info(**info)
+
+
+class accelerate_info(system_info):
+    section = 'accelerate'
+    _lib_names = ['accelerate', 'veclib']
+    notfounderror = BlasNotFoundError
+
+    def calc_info(self):
+        # Make possible to enable/disable from config file/env var
+        libraries = os.environ.get('ACCELERATE')
+        if libraries:
+            libraries = [libraries]
+        else:
+            libraries = self.get_libs('libraries', self._lib_names)
+        libraries = [lib.strip().lower() for lib in libraries]
+
+        if (sys.platform == 'darwin' and
+                not os.getenv('_PYTHON_HOST_PLATFORM', None)):
+            # Use the system BLAS from Accelerate or vecLib under OSX
+            args = []
+            link_args = []
+            if get_platform()[-4:] == 'i386' or 'intel' in get_platform() or \
+               'x86_64' in get_platform() or \
+               'i386' in platform.platform():
+                intel = 1
+            else:
+                intel = 0
+            if (os.path.exists('/System/Library/Frameworks'
+                              '/Accelerate.framework/') and
+                    'accelerate' in libraries):
+                if intel:
+                    args.extend(['-msse3'])
+                else:
+                    args.extend(['-faltivec'])
+                args.extend([
+                    '-I/System/Library/Frameworks/vecLib.framework/Headers'])
+                link_args.extend(['-Wl,-framework', '-Wl,Accelerate'])
+            elif (os.path.exists('/System/Library/Frameworks'
+                                 '/vecLib.framework/') and
+                      'veclib' in libraries):
+                if intel:
+                    args.extend(['-msse3'])
+                else:
+                    args.extend(['-faltivec'])
+                args.extend([
+                    '-I/System/Library/Frameworks/vecLib.framework/Headers'])
+                link_args.extend(['-Wl,-framework', '-Wl,vecLib'])
+
+            if args:
+                self.set_info(extra_compile_args=args,
+                              extra_link_args=link_args,
+                              define_macros=[('NO_ATLAS_INFO', 3),
+                                             ('HAVE_CBLAS', None)])
+
+        return
+
+class blas_src_info(system_info):
+    section = 'blas_src'
+    dir_env_var = 'BLAS_SRC'
+    notfounderror = BlasSrcNotFoundError
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend([d] + self.combine_paths(d, ['blas']))
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        src_dirs = self.get_src_dirs()
+        src_dir = ''
+        for d in src_dirs:
+            if os.path.isfile(os.path.join(d, 'daxpy.f')):
+                src_dir = d
+                break
+        if not src_dir:
+            #XXX: Get sources from netlib. May be ask first.
+            return
+        blas1 = '''
+        caxpy csscal dnrm2 dzasum saxpy srotg zdotc ccopy cswap drot
+        dznrm2 scasum srotm zdotu cdotc dasum drotg icamax scnrm2
+        srotmg zdrot cdotu daxpy drotm idamax scopy sscal zdscal crotg
+        dcabs1 drotmg isamax sdot sswap zrotg cscal dcopy dscal izamax
+        snrm2 zaxpy zscal csrot ddot dswap sasum srot zcopy zswap
+        scabs1
+        '''
+        blas2 = '''
+        cgbmv chpmv ctrsv dsymv dtrsv sspr2 strmv zhemv ztpmv cgemv
+        chpr dgbmv dsyr lsame ssymv strsv zher ztpsv cgerc chpr2 dgemv
+        dsyr2 sgbmv ssyr xerbla zher2 ztrmv cgeru ctbmv dger dtbmv
+        sgemv ssyr2 zgbmv zhpmv ztrsv chbmv ctbsv dsbmv dtbsv sger
+        stbmv zgemv zhpr chemv ctpmv dspmv dtpmv ssbmv stbsv zgerc
+        zhpr2 cher ctpsv dspr dtpsv sspmv stpmv zgeru ztbmv cher2
+        ctrmv dspr2 dtrmv sspr stpsv zhbmv ztbsv
+        '''
+        blas3 = '''
+        cgemm csymm ctrsm dsyrk sgemm strmm zhemm zsyr2k chemm csyr2k
+        dgemm dtrmm ssymm strsm zher2k zsyrk cher2k csyrk dsymm dtrsm
+        ssyr2k zherk ztrmm cherk ctrmm dsyr2k ssyrk zgemm zsymm ztrsm
+        '''
+        sources = [os.path.join(src_dir, f + '.f') \
+                   for f in (blas1 + blas2 + blas3).split()]
+        #XXX: should we check here actual existence of source files?
+        sources = [f for f in sources if os.path.isfile(f)]
+        info = {'sources': sources, 'language': 'f77'}
+        self.set_info(**info)
+
+
+class x11_info(system_info):
+    section = 'x11'
+    notfounderror = X11NotFoundError
+    _lib_names = ['X11']
+
+    def __init__(self):
+        system_info.__init__(self,
+                             default_lib_dirs=default_x11_lib_dirs,
+                             default_include_dirs=default_x11_include_dirs)
+
+    def calc_info(self):
+        if sys.platform  in ['win32']:
+            return
+        lib_dirs = self.get_lib_dirs()
+        include_dirs = self.get_include_dirs()
+        opt = self.get_option_single('x11_libs', 'libraries')
+        x11_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs(lib_dirs, x11_libs, [])
+        if info is None:
+            return
+        inc_dir = None
+        for d in include_dirs:
+            if self.combine_paths(d, 'X11/X.h'):
+                inc_dir = d
+                break
+        if inc_dir is not None:
+            dict_append(info, include_dirs=[inc_dir])
+        self.set_info(**info)
+
+
+class _numpy_info(system_info):
+    section = 'Numeric'
+    modulename = 'Numeric'
+    notfounderror = NumericNotFoundError
+
+    def __init__(self):
+        include_dirs = []
+        try:
+            module = __import__(self.modulename)
+            prefix = []
+            for name in module.__file__.split(os.sep):
+                if name == 'lib':
+                    break
+                prefix.append(name)
+
+            # Ask numpy for its own include path before attempting
+            # anything else
+            try:
+                include_dirs.append(getattr(module, 'get_include')())
+            except AttributeError:
+                pass
+
+            include_dirs.append(distutils.sysconfig.get_python_inc(
+                                        prefix=os.sep.join(prefix)))
+        except ImportError:
+            pass
+        py_incl_dir = distutils.sysconfig.get_python_inc()
+        include_dirs.append(py_incl_dir)
+        py_pincl_dir = distutils.sysconfig.get_python_inc(plat_specific=True)
+        if py_pincl_dir not in include_dirs:
+            include_dirs.append(py_pincl_dir)
+        for d in default_include_dirs:
+            d = os.path.join(d, os.path.basename(py_incl_dir))
+            if d not in include_dirs:
+                include_dirs.append(d)
+        system_info.__init__(self,
+                             default_lib_dirs=[],
+                             default_include_dirs=include_dirs)
+
+    def calc_info(self):
+        try:
+            module = __import__(self.modulename)
+        except ImportError:
+            return
+        info = {}
+        macros = []
+        for v in ['__version__', 'version']:
+            vrs = getattr(module, v, None)
+            if vrs is None:
+                continue
+            macros = [(self.modulename.upper() + '_VERSION',
+                      _c_string_literal(vrs)),
+                      (self.modulename.upper(), None)]
+            break
+        dict_append(info, define_macros=macros)
+        include_dirs = self.get_include_dirs()
+        inc_dir = None
+        for d in include_dirs:
+            if self.combine_paths(d,
+                                  os.path.join(self.modulename,
+                                               'arrayobject.h')):
+                inc_dir = d
+                break
+        if inc_dir is not None:
+            dict_append(info, include_dirs=[inc_dir])
+        if info:
+            self.set_info(**info)
+        return
+
+
+class numarray_info(_numpy_info):
+    section = 'numarray'
+    modulename = 'numarray'
+
+
+class Numeric_info(_numpy_info):
+    section = 'Numeric'
+    modulename = 'Numeric'
+
+
+class numpy_info(_numpy_info):
+    section = 'numpy'
+    modulename = 'numpy'
+
+
+class numerix_info(system_info):
+    section = 'numerix'
+
+    def calc_info(self):
+        which = None, None
+        if os.getenv("NUMERIX"):
+            which = os.getenv("NUMERIX"), "environment var"
+        # If all the above fail, default to numpy.
+        if which[0] is None:
+            which = "numpy", "defaulted"
+            try:
+                import numpy  # noqa: F401
+                which = "numpy", "defaulted"
+            except ImportError as e:
+                msg1 = str(e)
+                try:
+                    import Numeric  # noqa: F401
+                    which = "numeric", "defaulted"
+                except ImportError as e:
+                    msg2 = str(e)
+                    try:
+                        import numarray  # noqa: F401
+                        which = "numarray", "defaulted"
+                    except ImportError as e:
+                        msg3 = str(e)
+                        log.info(msg1)
+                        log.info(msg2)
+                        log.info(msg3)
+        which = which[0].strip().lower(), which[1]
+        if which[0] not in ["numeric", "numarray", "numpy"]:
+            raise ValueError("numerix selector must be either 'Numeric' "
+                             "or 'numarray' or 'numpy' but the value obtained"
+                             " from the %s was '%s'." % (which[1], which[0]))
+        os.environ['NUMERIX'] = which[0]
+        self.set_info(**get_info(which[0]))
+
+
+class f2py_info(system_info):
+    def calc_info(self):
+        try:
+            import numpy.f2py as f2py
+        except ImportError:
+            return
+        f2py_dir = os.path.join(os.path.dirname(f2py.__file__), 'src')
+        self.set_info(sources=[os.path.join(f2py_dir, 'fortranobject.c')],
+                      include_dirs=[f2py_dir])
+        return
+
+
+class boost_python_info(system_info):
+    section = 'boost_python'
+    dir_env_var = 'BOOST'
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend([d] + self.combine_paths(d, ['boost*']))
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        src_dirs = self.get_src_dirs()
+        src_dir = ''
+        for d in src_dirs:
+            if os.path.isfile(os.path.join(d, 'libs', 'python', 'src',
+                                           'module.cpp')):
+                src_dir = d
+                break
+        if not src_dir:
+            return
+        py_incl_dirs = [distutils.sysconfig.get_python_inc()]
+        py_pincl_dir = distutils.sysconfig.get_python_inc(plat_specific=True)
+        if py_pincl_dir not in py_incl_dirs:
+            py_incl_dirs.append(py_pincl_dir)
+        srcs_dir = os.path.join(src_dir, 'libs', 'python', 'src')
+        bpl_srcs = glob(os.path.join(srcs_dir, '*.cpp'))
+        bpl_srcs += glob(os.path.join(srcs_dir, '*', '*.cpp'))
+        info = {'libraries': [('boost_python_src',
+                               {'include_dirs': [src_dir] + py_incl_dirs,
+                                'sources':bpl_srcs}
+                              )],
+                'include_dirs': [src_dir],
+                }
+        if info:
+            self.set_info(**info)
+        return
+
+
+class agg2_info(system_info):
+    section = 'agg2'
+    dir_env_var = 'AGG2'
+
+    def get_paths(self, section, key):
+        pre_dirs = system_info.get_paths(self, section, key)
+        dirs = []
+        for d in pre_dirs:
+            dirs.extend([d] + self.combine_paths(d, ['agg2*']))
+        return [d for d in dirs if os.path.isdir(d)]
+
+    def calc_info(self):
+        src_dirs = self.get_src_dirs()
+        src_dir = ''
+        for d in src_dirs:
+            if os.path.isfile(os.path.join(d, 'src', 'agg_affine_matrix.cpp')):
+                src_dir = d
+                break
+        if not src_dir:
+            return
+        if sys.platform == 'win32':
+            agg2_srcs = glob(os.path.join(src_dir, 'src', 'platform',
+                                          'win32', 'agg_win32_bmp.cpp'))
+        else:
+            agg2_srcs = glob(os.path.join(src_dir, 'src', '*.cpp'))
+            agg2_srcs += [os.path.join(src_dir, 'src', 'platform',
+                                       'X11',
+                                       'agg_platform_support.cpp')]
+
+        info = {'libraries':
+                [('agg2_src',
+                  {'sources': agg2_srcs,
+                   'include_dirs': [os.path.join(src_dir, 'include')],
+                  }
+                 )],
+                'include_dirs': [os.path.join(src_dir, 'include')],
+                }
+        if info:
+            self.set_info(**info)
+        return
+
+
+class _pkg_config_info(system_info):
+    section = None
+    config_env_var = 'PKG_CONFIG'
+    default_config_exe = 'pkg-config'
+    append_config_exe = ''
+    version_macro_name = None
+    release_macro_name = None
+    version_flag = '--modversion'
+    cflags_flag = '--cflags'
+
+    def get_config_exe(self):
+        if self.config_env_var in os.environ:
+            return os.environ[self.config_env_var]
+        return self.default_config_exe
+
+    def get_config_output(self, config_exe, option):
+        cmd = config_exe + ' ' + self.append_config_exe + ' ' + option
+        try:
+            o = subprocess.check_output(cmd)
+        except (OSError, subprocess.CalledProcessError):
+            pass
+        else:
+            o = filepath_from_subprocess_output(o)
+            return o
+
+    def calc_info(self):
+        config_exe = find_executable(self.get_config_exe())
+        if not config_exe:
+            log.warn('File not found: %s. Cannot determine %s info.' \
+                  % (config_exe, self.section))
+            return
+        info = {}
+        macros = []
+        libraries = []
+        library_dirs = []
+        include_dirs = []
+        extra_link_args = []
+        extra_compile_args = []
+        version = self.get_config_output(config_exe, self.version_flag)
+        if version:
+            macros.append((self.__class__.__name__.split('.')[-1].upper(),
+                           _c_string_literal(version)))
+            if self.version_macro_name:
+                macros.append((self.version_macro_name + '_%s'
+                               % (version.replace('.', '_')), None))
+        if self.release_macro_name:
+            release = self.get_config_output(config_exe, '--release')
+            if release:
+                macros.append((self.release_macro_name + '_%s'
+                               % (release.replace('.', '_')), None))
+        opts = self.get_config_output(config_exe, '--libs')
+        if opts:
+            for opt in opts.split():
+                if opt[:2] == '-l':
+                    libraries.append(opt[2:])
+                elif opt[:2] == '-L':
+                    library_dirs.append(opt[2:])
+                else:
+                    extra_link_args.append(opt)
+        opts = self.get_config_output(config_exe, self.cflags_flag)
+        if opts:
+            for opt in opts.split():
+                if opt[:2] == '-I':
+                    include_dirs.append(opt[2:])
+                elif opt[:2] == '-D':
+                    if '=' in opt:
+                        n, v = opt[2:].split('=')
+                        macros.append((n, v))
+                    else:
+                        macros.append((opt[2:], None))
+                else:
+                    extra_compile_args.append(opt)
+        if macros:
+            dict_append(info, define_macros=macros)
+        if libraries:
+            dict_append(info, libraries=libraries)
+        if library_dirs:
+            dict_append(info, library_dirs=library_dirs)
+        if include_dirs:
+            dict_append(info, include_dirs=include_dirs)
+        if extra_link_args:
+            dict_append(info, extra_link_args=extra_link_args)
+        if extra_compile_args:
+            dict_append(info, extra_compile_args=extra_compile_args)
+        if info:
+            self.set_info(**info)
+        return
+
+
+class wx_info(_pkg_config_info):
+    section = 'wx'
+    config_env_var = 'WX_CONFIG'
+    default_config_exe = 'wx-config'
+    append_config_exe = ''
+    version_macro_name = 'WX_VERSION'
+    release_macro_name = 'WX_RELEASE'
+    version_flag = '--version'
+    cflags_flag = '--cxxflags'
+
+
+class gdk_pixbuf_xlib_2_info(_pkg_config_info):
+    section = 'gdk_pixbuf_xlib_2'
+    append_config_exe = 'gdk-pixbuf-xlib-2.0'
+    version_macro_name = 'GDK_PIXBUF_XLIB_VERSION'
+
+
+class gdk_pixbuf_2_info(_pkg_config_info):
+    section = 'gdk_pixbuf_2'
+    append_config_exe = 'gdk-pixbuf-2.0'
+    version_macro_name = 'GDK_PIXBUF_VERSION'
+
+
+class gdk_x11_2_info(_pkg_config_info):
+    section = 'gdk_x11_2'
+    append_config_exe = 'gdk-x11-2.0'
+    version_macro_name = 'GDK_X11_VERSION'
+
+
+class gdk_2_info(_pkg_config_info):
+    section = 'gdk_2'
+    append_config_exe = 'gdk-2.0'
+    version_macro_name = 'GDK_VERSION'
+
+
+class gdk_info(_pkg_config_info):
+    section = 'gdk'
+    append_config_exe = 'gdk'
+    version_macro_name = 'GDK_VERSION'
+
+
+class gtkp_x11_2_info(_pkg_config_info):
+    section = 'gtkp_x11_2'
+    append_config_exe = 'gtk+-x11-2.0'
+    version_macro_name = 'GTK_X11_VERSION'
+
+
+class gtkp_2_info(_pkg_config_info):
+    section = 'gtkp_2'
+    append_config_exe = 'gtk+-2.0'
+    version_macro_name = 'GTK_VERSION'
+
+
+class xft_info(_pkg_config_info):
+    section = 'xft'
+    append_config_exe = 'xft'
+    version_macro_name = 'XFT_VERSION'
+
+
+class freetype2_info(_pkg_config_info):
+    section = 'freetype2'
+    append_config_exe = 'freetype2'
+    version_macro_name = 'FREETYPE2_VERSION'
+
+
+class amd_info(system_info):
+    section = 'amd'
+    dir_env_var = 'AMD'
+    _lib_names = ['amd']
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+
+        opt = self.get_option_single('amd_libs', 'libraries')
+        amd_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs(lib_dirs, amd_libs, [])
+        if info is None:
+            return
+
+        include_dirs = self.get_include_dirs()
+
+        inc_dir = None
+        for d in include_dirs:
+            p = self.combine_paths(d, 'amd.h')
+            if p:
+                inc_dir = os.path.dirname(p[0])
+                break
+        if inc_dir is not None:
+            dict_append(info, include_dirs=[inc_dir],
+                        define_macros=[('SCIPY_AMD_H', None)],
+                        swig_opts=['-I' + inc_dir])
+
+        self.set_info(**info)
+        return
+
+
+class umfpack_info(system_info):
+    section = 'umfpack'
+    dir_env_var = 'UMFPACK'
+    notfounderror = UmfpackNotFoundError
+    _lib_names = ['umfpack']
+
+    def calc_info(self):
+        lib_dirs = self.get_lib_dirs()
+
+        opt = self.get_option_single('umfpack_libs', 'libraries')
+        umfpack_libs = self.get_libs(opt, self._lib_names)
+        info = self.check_libs(lib_dirs, umfpack_libs, [])
+        if info is None:
+            return
+
+        include_dirs = self.get_include_dirs()
+
+        inc_dir = None
+        for d in include_dirs:
+            p = self.combine_paths(d, ['', 'umfpack'], 'umfpack.h')
+            if p:
+                inc_dir = os.path.dirname(p[0])
+                break
+        if inc_dir is not None:
+            dict_append(info, include_dirs=[inc_dir],
+                        define_macros=[('SCIPY_UMFPACK_H', None)],
+                        swig_opts=['-I' + inc_dir])
+
+        dict_append(info, **get_info('amd'))
+
+        self.set_info(**info)
+        return
+
+
+def combine_paths(*args, **kws):
+    """ Return a list of existing paths composed by all combinations of
+        items from arguments.
+    """
+    r = []
+    for a in args:
+        if not a:
+            continue
+        if is_string(a):
+            a = [a]
+        r.append(a)
+    args = r
+    if not args:
+        return []
+    if len(args) == 1:
+        result = reduce(lambda a, b: a + b, map(glob, args[0]), [])
+    elif len(args) == 2:
+        result = []
+        for a0 in args[0]:
+            for a1 in args[1]:
+                result.extend(glob(os.path.join(a0, a1)))
+    else:
+        result = combine_paths(*(combine_paths(args[0], args[1]) + args[2:]))
+    log.debug('(paths: %s)', ','.join(result))
+    return result
+
+language_map = {'c': 0, 'c++': 1, 'f77': 2, 'f90': 3}
+inv_language_map = {0: 'c', 1: 'c++', 2: 'f77', 3: 'f90'}
+
+
+def dict_append(d, **kws):
+    languages = []
+    for k, v in kws.items():
+        if k == 'language':
+            languages.append(v)
+            continue
+        if k in d:
+            if k in ['library_dirs', 'include_dirs',
+                     'extra_compile_args', 'extra_link_args',
+                     'runtime_library_dirs', 'define_macros']:
+                [d[k].append(vv) for vv in v if vv not in d[k]]
+            else:
+                d[k].extend(v)
+        else:
+            d[k] = v
+    if languages:
+        l = inv_language_map[max([language_map.get(l, 0) for l in languages])]
+        d['language'] = l
+    return
+
+
+def parseCmdLine(argv=(None,)):
+    import optparse
+    parser = optparse.OptionParser("usage: %prog [-v] [info objs]")
+    parser.add_option('-v', '--verbose', action='store_true', dest='verbose',
+                      default=False,
+                      help='be verbose and print more messages')
+
+    opts, args = parser.parse_args(args=argv[1:])
+    return opts, args
+
+
+def show_all(argv=None):
+    import inspect
+    if argv is None:
+        argv = sys.argv
+    opts, args = parseCmdLine(argv)
+    if opts.verbose:
+        log.set_threshold(log.DEBUG)
+    else:
+        log.set_threshold(log.INFO)
+    show_only = []
+    for n in args:
+        if n[-5:] != '_info':
+            n = n + '_info'
+        show_only.append(n)
+    show_all = not show_only
+    _gdict_ = globals().copy()
+    for name, c in _gdict_.items():
+        if not inspect.isclass(c):
+            continue
+        if not issubclass(c, system_info) or c is system_info:
+            continue
+        if not show_all:
+            if name not in show_only:
+                continue
+            del show_only[show_only.index(name)]
+        conf = c()
+        conf.verbosity = 2
+        # FIXME: r not used
+        r = conf.get_info()
+    if show_only:
+        log.info('Info classes not defined: %s', ','.join(show_only))
+
+if __name__ == "__main__":
+    show_all()
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__init__.py b/venv/Lib/site-packages/numpy/distutils/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..51a563893
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_exec_command.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_exec_command.cpython-36.pyc
new file mode 100644
index 000000000..b6ea0c400
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_exec_command.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler.cpython-36.pyc
new file mode 100644
index 000000000..7f3609932
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_gnu.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_gnu.cpython-36.pyc
new file mode 100644
index 000000000..cb0eac816
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_gnu.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_intel.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_intel.cpython-36.pyc
new file mode 100644
index 000000000..89e9187f6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_intel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_nagfor.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_nagfor.cpython-36.pyc
new file mode 100644
index 000000000..54c091a9e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_fcompiler_nagfor.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_from_template.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_from_template.cpython-36.pyc
new file mode 100644
index 000000000..8b613f599
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_from_template.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_mingw32ccompiler.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_mingw32ccompiler.cpython-36.pyc
new file mode 100644
index 000000000..682a7b295
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_mingw32ccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_misc_util.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_misc_util.cpython-36.pyc
new file mode 100644
index 000000000..24832ecd8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_misc_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_npy_pkg_config.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_npy_pkg_config.cpython-36.pyc
new file mode 100644
index 000000000..bfc8a3b9d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_npy_pkg_config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_shell_utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_shell_utils.cpython-36.pyc
new file mode 100644
index 000000000..b7caa5862
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_shell_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_system_info.cpython-36.pyc b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_system_info.cpython-36.pyc
new file mode 100644
index 000000000..170a0e9a0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/distutils/tests/__pycache__/test_system_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_exec_command.py b/venv/Lib/site-packages/numpy/distutils/tests/test_exec_command.py
new file mode 100644
index 000000000..d6eb7d1c3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_exec_command.py
@@ -0,0 +1,214 @@
+import os
+import sys
+from tempfile import TemporaryFile
+
+from numpy.distutils import exec_command
+from numpy.distutils.exec_command import get_pythonexe
+from numpy.testing import tempdir, assert_, assert_warns
+
+# In python 3 stdout, stderr are text (unicode compliant) devices, so to
+# emulate them import StringIO from the io module.
+from io import StringIO
+
+class redirect_stdout:
+    """Context manager to redirect stdout for exec_command test."""
+    def __init__(self, stdout=None):
+        self._stdout = stdout or sys.stdout
+
+    def __enter__(self):
+        self.old_stdout = sys.stdout
+        sys.stdout = self._stdout
+
+    def __exit__(self, exc_type, exc_value, traceback):
+        self._stdout.flush()
+        sys.stdout = self.old_stdout
+        # note: closing sys.stdout won't close it.
+        self._stdout.close()
+
+class redirect_stderr:
+    """Context manager to redirect stderr for exec_command test."""
+    def __init__(self, stderr=None):
+        self._stderr = stderr or sys.stderr
+
+    def __enter__(self):
+        self.old_stderr = sys.stderr
+        sys.stderr = self._stderr
+
+    def __exit__(self, exc_type, exc_value, traceback):
+        self._stderr.flush()
+        sys.stderr = self.old_stderr
+        # note: closing sys.stderr won't close it.
+        self._stderr.close()
+
+class emulate_nonposix:
+    """Context manager to emulate os.name != 'posix' """
+    def __init__(self, osname='non-posix'):
+        self._new_name = osname
+
+    def __enter__(self):
+        self._old_name = os.name
+        os.name = self._new_name
+
+    def __exit__(self, exc_type, exc_value, traceback):
+        os.name = self._old_name
+
+
+def test_exec_command_stdout():
+    # Regression test for gh-2999 and gh-2915.
+    # There are several packages (nose, scipy.weave.inline, Sage inline
+    # Fortran) that replace stdout, in which case it doesn't have a fileno
+    # method.  This is tested here, with a do-nothing command that fails if the
+    # presence of fileno() is assumed in exec_command.
+
+    # The code has a special case for posix systems, so if we are on posix test
+    # both that the special case works and that the generic code works.
+
+    # Test posix version:
+    with redirect_stdout(StringIO()):
+        with redirect_stderr(TemporaryFile()):
+            with assert_warns(DeprecationWarning):
+                exec_command.exec_command("cd '.'")
+
+    if os.name == 'posix':
+        # Test general (non-posix) version:
+        with emulate_nonposix():
+            with redirect_stdout(StringIO()):
+                with redirect_stderr(TemporaryFile()):
+                    with assert_warns(DeprecationWarning):
+                        exec_command.exec_command("cd '.'")
+
+def test_exec_command_stderr():
+    # Test posix version:
+    with redirect_stdout(TemporaryFile(mode='w+')):
+        with redirect_stderr(StringIO()):
+            with assert_warns(DeprecationWarning):
+                exec_command.exec_command("cd '.'")
+
+    if os.name == 'posix':
+        # Test general (non-posix) version:
+        with emulate_nonposix():
+            with redirect_stdout(TemporaryFile()):
+                with redirect_stderr(StringIO()):
+                    with assert_warns(DeprecationWarning):
+                        exec_command.exec_command("cd '.'")
+
+
+class TestExecCommand:
+    def setup(self):
+        self.pyexe = get_pythonexe()
+
+    def check_nt(self, **kws):
+        s, o = exec_command.exec_command('cmd /C echo path=%path%')
+        assert_(s == 0)
+        assert_(o != '')
+
+        s, o = exec_command.exec_command(
+         '"%s" -c "import sys;sys.stderr.write(sys.platform)"' % self.pyexe)
+        assert_(s == 0)
+        assert_(o == 'win32')
+
+    def check_posix(self, **kws):
+        s, o = exec_command.exec_command("echo Hello", **kws)
+        assert_(s == 0)
+        assert_(o == 'Hello')
+
+        s, o = exec_command.exec_command('echo $AAA', **kws)
+        assert_(s == 0)
+        assert_(o == '')
+
+        s, o = exec_command.exec_command('echo "$AAA"', AAA='Tere', **kws)
+        assert_(s == 0)
+        assert_(o == 'Tere')
+
+        s, o = exec_command.exec_command('echo "$AAA"', **kws)
+        assert_(s == 0)
+        assert_(o == '')
+
+        if 'BBB' not in os.environ:
+            os.environ['BBB'] = 'Hi'
+            s, o = exec_command.exec_command('echo "$BBB"', **kws)
+            assert_(s == 0)
+            assert_(o == 'Hi')
+
+            s, o = exec_command.exec_command('echo "$BBB"', BBB='Hey', **kws)
+            assert_(s == 0)
+            assert_(o == 'Hey')
+
+            s, o = exec_command.exec_command('echo "$BBB"', **kws)
+            assert_(s == 0)
+            assert_(o == 'Hi')
+
+            del os.environ['BBB']
+
+            s, o = exec_command.exec_command('echo "$BBB"', **kws)
+            assert_(s == 0)
+            assert_(o == '')
+
+
+        s, o = exec_command.exec_command('this_is_not_a_command', **kws)
+        assert_(s != 0)
+        assert_(o != '')
+
+        s, o = exec_command.exec_command('echo path=$PATH', **kws)
+        assert_(s == 0)
+        assert_(o != '')
+
+        s, o = exec_command.exec_command(
+             '"%s" -c "import sys,os;sys.stderr.write(os.name)"' %
+             self.pyexe, **kws)
+        assert_(s == 0)
+        assert_(o == 'posix')
+
+    def check_basic(self, *kws):
+        s, o = exec_command.exec_command(
+                     '"%s" -c "raise \'Ignore me.\'"' % self.pyexe, **kws)
+        assert_(s != 0)
+        assert_(o != '')
+
+        s, o = exec_command.exec_command(
+             '"%s" -c "import sys;sys.stderr.write(\'0\');'
+             'sys.stderr.write(\'1\');sys.stderr.write(\'2\')"' %
+             self.pyexe, **kws)
+        assert_(s == 0)
+        assert_(o == '012')
+
+        s, o = exec_command.exec_command(
+                 '"%s" -c "import sys;sys.exit(15)"' % self.pyexe, **kws)
+        assert_(s == 15)
+        assert_(o == '')
+
+        s, o = exec_command.exec_command(
+                     '"%s" -c "print(\'Heipa\'")' % self.pyexe, **kws)
+        assert_(s == 0)
+        assert_(o == 'Heipa')
+
+    def check_execute_in(self, **kws):
+        with tempdir() as tmpdir:
+            fn = "file"
+            tmpfile = os.path.join(tmpdir, fn)
+            with open(tmpfile, 'w') as f:
+                f.write('Hello')
+
+            s, o = exec_command.exec_command(
+                 '"%s" -c "f = open(\'%s\', \'r\'); f.close()"' %
+                 (self.pyexe, fn), **kws)
+            assert_(s != 0)
+            assert_(o != '')
+            s, o = exec_command.exec_command(
+                     '"%s" -c "f = open(\'%s\', \'r\'); print(f.read()); '
+                     'f.close()"' % (self.pyexe, fn), execute_in=tmpdir, **kws)
+            assert_(s == 0)
+            assert_(o == 'Hello')
+
+    def test_basic(self):
+        with redirect_stdout(StringIO()):
+            with redirect_stderr(StringIO()):
+                with assert_warns(DeprecationWarning):
+                    if os.name == "posix":
+                        self.check_posix(use_tee=0)
+                        self.check_posix(use_tee=1)
+                    elif os.name == "nt":
+                        self.check_nt(use_tee=0)
+                        self.check_nt(use_tee=1)
+                    self.check_execute_in(use_tee=0)
+                    self.check_execute_in(use_tee=1)
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler.py b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler.py
new file mode 100644
index 000000000..dd97f1e72
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler.py
@@ -0,0 +1,43 @@
+from numpy.testing import assert_
+import numpy.distutils.fcompiler
+
+customizable_flags = [
+    ('f77', 'F77FLAGS'),
+    ('f90', 'F90FLAGS'),
+    ('free', 'FREEFLAGS'),
+    ('arch', 'FARCH'),
+    ('debug', 'FDEBUG'),
+    ('flags', 'FFLAGS'),
+    ('linker_so', 'LDFLAGS'),
+]
+
+
+def test_fcompiler_flags(monkeypatch):
+    monkeypatch.setenv('NPY_DISTUTILS_APPEND_FLAGS', '0')
+    fc = numpy.distutils.fcompiler.new_fcompiler(compiler='none')
+    flag_vars = fc.flag_vars.clone(lambda *args, **kwargs: None)
+
+    for opt, envvar in customizable_flags:
+        new_flag = '-dummy-{}-flag'.format(opt)
+        prev_flags = getattr(flag_vars, opt)
+
+        monkeypatch.setenv(envvar, new_flag)
+        new_flags = getattr(flag_vars, opt)
+
+        monkeypatch.delenv(envvar)
+        assert_(new_flags == [new_flag])
+
+    monkeypatch.setenv('NPY_DISTUTILS_APPEND_FLAGS', '1')
+
+    for opt, envvar in customizable_flags:
+        new_flag = '-dummy-{}-flag'.format(opt)
+        prev_flags = getattr(flag_vars, opt)
+        monkeypatch.setenv(envvar, new_flag)
+        new_flags = getattr(flag_vars, opt)
+
+        monkeypatch.delenv(envvar)
+        if prev_flags is None:
+            assert_(new_flags == [new_flag])
+        else:
+            assert_(new_flags == prev_flags + [new_flag])
+
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py
new file mode 100644
index 000000000..0817ae58c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_gnu.py
@@ -0,0 +1,55 @@
+from numpy.testing import assert_
+
+import numpy.distutils.fcompiler
+
+g77_version_strings = [
+    ('GNU Fortran 0.5.25 20010319 (prerelease)', '0.5.25'),
+    ('GNU Fortran (GCC 3.2) 3.2 20020814 (release)', '3.2'),
+    ('GNU Fortran (GCC) 3.3.3 20040110 (prerelease) (Debian)', '3.3.3'),
+    ('GNU Fortran (GCC) 3.3.3 (Debian 20040401)', '3.3.3'),
+    ('GNU Fortran (GCC 3.2.2 20030222 (Red Hat Linux 3.2.2-5)) 3.2.2'
+       ' 20030222 (Red Hat Linux 3.2.2-5)', '3.2.2'),
+]
+
+gfortran_version_strings = [
+    ('GNU Fortran 95 (GCC 4.0.3 20051023 (prerelease) (Debian 4.0.2-3))',
+     '4.0.3'),
+    ('GNU Fortran 95 (GCC) 4.1.0', '4.1.0'),
+    ('GNU Fortran 95 (GCC) 4.2.0 20060218 (experimental)', '4.2.0'),
+    ('GNU Fortran (GCC) 4.3.0 20070316 (experimental)', '4.3.0'),
+    ('GNU Fortran (rubenvb-4.8.0) 4.8.0', '4.8.0'),
+    ('4.8.0', '4.8.0'),
+    ('4.0.3-7', '4.0.3'),
+    ("gfortran: warning: couldn't understand kern.osversion '14.1.0\n4.9.1",
+     '4.9.1'),
+    ("gfortran: warning: couldn't understand kern.osversion '14.1.0\n"
+     "gfortran: warning: yet another warning\n4.9.1",
+     '4.9.1'),
+    ('GNU Fortran (crosstool-NG 8a21ab48) 7.2.0', '7.2.0')
+]
+
+class TestG77Versions:
+    def test_g77_version(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu')
+        for vs, version in g77_version_strings:
+            v = fc.version_match(vs)
+            assert_(v == version, (vs, v))
+
+    def test_not_g77(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu')
+        for vs, _ in gfortran_version_strings:
+            v = fc.version_match(vs)
+            assert_(v is None, (vs, v))
+
+class TestGFortranVersions:
+    def test_gfortran_version(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu95')
+        for vs, version in gfortran_version_strings:
+            v = fc.version_match(vs)
+            assert_(v == version, (vs, v))
+
+    def test_not_gfortran(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='gnu95')
+        for vs, _ in g77_version_strings:
+            v = fc.version_match(vs)
+            assert_(v is None, (vs, v))
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_intel.py b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_intel.py
new file mode 100644
index 000000000..45c9cdac1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_intel.py
@@ -0,0 +1,30 @@
+import numpy.distutils.fcompiler
+from numpy.testing import assert_
+
+
+intel_32bit_version_strings = [
+    ("Intel(R) Fortran Intel(R) 32-bit Compiler Professional for applications"
+     "running on Intel(R) 32, Version 11.1", '11.1'),
+]
+
+intel_64bit_version_strings = [
+    ("Intel(R) Fortran IA-64 Compiler Professional for applications"
+     "running on IA-64, Version 11.0", '11.0'),
+    ("Intel(R) Fortran Intel(R) 64 Compiler Professional for applications"
+     "running on Intel(R) 64, Version 11.1", '11.1')
+]
+
+class TestIntelFCompilerVersions:
+    def test_32bit_version(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='intel')
+        for vs, version in intel_32bit_version_strings:
+            v = fc.version_match(vs)
+            assert_(v == version)
+
+
+class TestIntelEM64TFCompilerVersions:
+    def test_64bit_version(self):
+        fc = numpy.distutils.fcompiler.new_fcompiler(compiler='intelem')
+        for vs, version in intel_64bit_version_strings:
+            v = fc.version_match(vs)
+            assert_(v == version)
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_nagfor.py b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_nagfor.py
new file mode 100644
index 000000000..2e04f5266
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_fcompiler_nagfor.py
@@ -0,0 +1,22 @@
+from numpy.testing import assert_
+import numpy.distutils.fcompiler
+
+nag_version_strings = [('nagfor', 'NAG Fortran Compiler Release '
+                        '6.2(Chiyoda) Build 6200', '6.2'),
+                       ('nagfor', 'NAG Fortran Compiler Release '
+                        '6.1(Tozai) Build 6136', '6.1'),
+                       ('nagfor', 'NAG Fortran Compiler Release '
+                        '6.0(Hibiya) Build 1021', '6.0'),
+                       ('nagfor', 'NAG Fortran Compiler Release '
+                        '5.3.2(971)', '5.3.2'),
+                       ('nag', 'NAGWare Fortran 95 compiler Release 5.1'
+                        '(347,355-367,375,380-383,389,394,399,401-402,407,'
+                        '431,435,437,446,459-460,463,472,494,496,503,508,'
+                        '511,517,529,555,557,565)', '5.1')]
+
+class TestNagFCompilerVersions:
+    def test_version_match(self):
+        for comp, vs, version in nag_version_strings:
+            fc = numpy.distutils.fcompiler.new_fcompiler(compiler=comp)
+            v = fc.version_match(vs)
+            assert_(v == version)
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_from_template.py b/venv/Lib/site-packages/numpy/distutils/tests/test_from_template.py
new file mode 100644
index 000000000..588175496
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_from_template.py
@@ -0,0 +1,44 @@
+
+from numpy.distutils.from_template import process_str
+from numpy.testing import assert_equal
+
+
+pyf_src = """
+python module foo
+    <_rd=real,double precision>
+    interface
+        subroutine <s,d>foosub(tol)
+            <_rd>, intent(in,out) :: tol
+        end subroutine <s,d>foosub
+    end interface
+end python module foo
+"""
+
+expected_pyf = """
+python module foo
+    interface
+        subroutine sfoosub(tol)
+            real, intent(in,out) :: tol
+        end subroutine sfoosub
+        subroutine dfoosub(tol)
+            double precision, intent(in,out) :: tol
+        end subroutine dfoosub
+    end interface
+end python module foo
+"""
+
+
+def normalize_whitespace(s):
+    """
+    Remove leading and trailing whitespace, and convert internal
+    stretches of whitespace to a single space.
+    """
+    return ' '.join(s.split())
+
+
+def test_from_template():
+    """Regression test for gh-10712."""
+    pyf = process_str(pyf_src)
+    normalized_pyf = normalize_whitespace(pyf)
+    normalized_expected_pyf = normalize_whitespace(expected_pyf)
+    assert_equal(normalized_pyf, normalized_expected_pyf)
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_mingw32ccompiler.py b/venv/Lib/site-packages/numpy/distutils/tests/test_mingw32ccompiler.py
new file mode 100644
index 000000000..ebedacb32
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_mingw32ccompiler.py
@@ -0,0 +1,42 @@
+import shutil
+import subprocess
+import sys
+import pytest
+
+from numpy.distutils import mingw32ccompiler
+
+
+@pytest.mark.skipif(sys.platform != 'win32', reason='win32 only test')
+def test_build_import():
+    '''Test the mingw32ccompiler.build_import_library, which builds a
+    `python.a` from the MSVC `python.lib`
+    '''
+
+    # make sure `nm.exe` exists and supports the current python version. This
+    # can get mixed up when the PATH has a 64-bit nm but the python is 32-bit
+    try:
+        out = subprocess.check_output(['nm.exe', '--help'])
+    except FileNotFoundError:
+        pytest.skip("'nm.exe' not on path, is mingw installed?")
+    supported = out[out.find(b'supported targets:'):]
+    if sys.maxsize < 2**32:
+        if b'pe-i386' not in supported:
+            raise ValueError("'nm.exe' found but it does not support 32-bit "
+                             "dlls when using 32-bit python. Supported "
+                             "formats: '%s'" % supported)
+    elif b'pe-x86-64' not in supported:
+        raise ValueError("'nm.exe' found but it does not support 64-bit "
+                         "dlls when using 64-bit python. Supported "
+                         "formats: '%s'" % supported)
+    # Hide the import library to force a build
+    has_import_lib, fullpath = mingw32ccompiler._check_for_import_lib()
+    if has_import_lib: 
+        shutil.move(fullpath, fullpath + '.bak')
+
+    try: 
+        # Whew, now we can actually test the function
+        mingw32ccompiler.build_import_library()
+
+    finally:
+        if has_import_lib:
+            shutil.move(fullpath + '.bak', fullpath)
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_misc_util.py b/venv/Lib/site-packages/numpy/distutils/tests/test_misc_util.py
new file mode 100644
index 000000000..605c80483
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_misc_util.py
@@ -0,0 +1,82 @@
+from os.path import join, sep, dirname
+
+from numpy.distutils.misc_util import (
+    appendpath, minrelpath, gpaths, get_shared_lib_extension, get_info
+    )
+from numpy.testing import (
+    assert_, assert_equal
+    )
+
+ajoin = lambda *paths: join(*((sep,)+paths))
+
+class TestAppendpath:
+
+    def test_1(self):
+        assert_equal(appendpath('prefix', 'name'), join('prefix', 'name'))
+        assert_equal(appendpath('/prefix', 'name'), ajoin('prefix', 'name'))
+        assert_equal(appendpath('/prefix', '/name'), ajoin('prefix', 'name'))
+        assert_equal(appendpath('prefix', '/name'), join('prefix', 'name'))
+
+    def test_2(self):
+        assert_equal(appendpath('prefix/sub', 'name'),
+                     join('prefix', 'sub', 'name'))
+        assert_equal(appendpath('prefix/sub', 'sup/name'),
+                     join('prefix', 'sub', 'sup', 'name'))
+        assert_equal(appendpath('/prefix/sub', '/prefix/name'),
+                     ajoin('prefix', 'sub', 'name'))
+
+    def test_3(self):
+        assert_equal(appendpath('/prefix/sub', '/prefix/sup/name'),
+                     ajoin('prefix', 'sub', 'sup', 'name'))
+        assert_equal(appendpath('/prefix/sub/sub2', '/prefix/sup/sup2/name'),
+                     ajoin('prefix', 'sub', 'sub2', 'sup', 'sup2', 'name'))
+        assert_equal(appendpath('/prefix/sub/sub2', '/prefix/sub/sup/name'),
+                     ajoin('prefix', 'sub', 'sub2', 'sup', 'name'))
+
+class TestMinrelpath:
+
+    def test_1(self):
+        n = lambda path: path.replace('/', sep)
+        assert_equal(minrelpath(n('aa/bb')), n('aa/bb'))
+        assert_equal(minrelpath('..'), '..')
+        assert_equal(minrelpath(n('aa/..')), '')
+        assert_equal(minrelpath(n('aa/../bb')), 'bb')
+        assert_equal(minrelpath(n('aa/bb/..')), 'aa')
+        assert_equal(minrelpath(n('aa/bb/../..')), '')
+        assert_equal(minrelpath(n('aa/bb/../cc/../dd')), n('aa/dd'))
+        assert_equal(minrelpath(n('.././..')), n('../..'))
+        assert_equal(minrelpath(n('aa/bb/.././../dd')), n('dd'))
+
+class TestGpaths:
+
+    def test_gpaths(self):
+        local_path = minrelpath(join(dirname(__file__), '..'))
+        ls = gpaths('command/*.py', local_path)
+        assert_(join(local_path, 'command', 'build_src.py') in ls, repr(ls))
+        f = gpaths('system_info.py', local_path)
+        assert_(join(local_path, 'system_info.py') == f[0], repr(f))
+
+class TestSharedExtension:
+
+    def test_get_shared_lib_extension(self):
+        import sys
+        ext = get_shared_lib_extension(is_python_ext=False)
+        if sys.platform.startswith('linux'):
+            assert_equal(ext, '.so')
+        elif sys.platform.startswith('gnukfreebsd'):
+            assert_equal(ext, '.so')
+        elif sys.platform.startswith('darwin'):
+            assert_equal(ext, '.dylib')
+        elif sys.platform.startswith('win'):
+            assert_equal(ext, '.dll')
+        # just check for no crash
+        assert_(get_shared_lib_extension(is_python_ext=True))
+
+
+def test_installed_npymath_ini():
+    # Regression test for gh-7707.  If npymath.ini wasn't installed, then this
+    # will give an error.
+    info = get_info('npymath')
+
+    assert isinstance(info, dict)
+    assert "define_macros" in info
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_npy_pkg_config.py b/venv/Lib/site-packages/numpy/distutils/tests/test_npy_pkg_config.py
new file mode 100644
index 000000000..b287ebe2e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_npy_pkg_config.py
@@ -0,0 +1,84 @@
+import os
+
+from numpy.distutils.npy_pkg_config import read_config, parse_flags
+from numpy.testing import temppath, assert_
+
+simple = """\
+[meta]
+Name = foo
+Description = foo lib
+Version = 0.1
+
+[default]
+cflags = -I/usr/include
+libs = -L/usr/lib
+"""
+simple_d = {'cflags': '-I/usr/include', 'libflags': '-L/usr/lib',
+        'version': '0.1', 'name': 'foo'}
+
+simple_variable = """\
+[meta]
+Name = foo
+Description = foo lib
+Version = 0.1
+
+[variables]
+prefix = /foo/bar
+libdir = ${prefix}/lib
+includedir = ${prefix}/include
+
+[default]
+cflags = -I${includedir}
+libs = -L${libdir}
+"""
+simple_variable_d = {'cflags': '-I/foo/bar/include', 'libflags': '-L/foo/bar/lib',
+        'version': '0.1', 'name': 'foo'}
+
+class TestLibraryInfo:
+    def test_simple(self):
+        with temppath('foo.ini') as path:
+            with open(path,  'w') as f:
+                f.write(simple)
+            pkg = os.path.splitext(path)[0]
+            out = read_config(pkg)
+
+        assert_(out.cflags() == simple_d['cflags'])
+        assert_(out.libs() == simple_d['libflags'])
+        assert_(out.name == simple_d['name'])
+        assert_(out.version == simple_d['version'])
+
+    def test_simple_variable(self):
+        with temppath('foo.ini') as path:
+            with open(path,  'w') as f:
+                f.write(simple_variable)
+            pkg = os.path.splitext(path)[0]
+            out = read_config(pkg)
+
+        assert_(out.cflags() == simple_variable_d['cflags'])
+        assert_(out.libs() == simple_variable_d['libflags'])
+        assert_(out.name == simple_variable_d['name'])
+        assert_(out.version == simple_variable_d['version'])
+        out.vars['prefix'] = '/Users/david'
+        assert_(out.cflags() == '-I/Users/david/include')
+
+class TestParseFlags:
+    def test_simple_cflags(self):
+        d = parse_flags("-I/usr/include")
+        assert_(d['include_dirs'] == ['/usr/include'])
+
+        d = parse_flags("-I/usr/include -DFOO")
+        assert_(d['include_dirs'] == ['/usr/include'])
+        assert_(d['macros'] == ['FOO'])
+
+        d = parse_flags("-I /usr/include -DFOO")
+        assert_(d['include_dirs'] == ['/usr/include'])
+        assert_(d['macros'] == ['FOO'])
+
+    def test_simple_lflags(self):
+        d = parse_flags("-L/usr/lib -lfoo -L/usr/lib -lbar")
+        assert_(d['library_dirs'] == ['/usr/lib', '/usr/lib'])
+        assert_(d['libraries'] == ['foo', 'bar'])
+
+        d = parse_flags("-L /usr/lib -lfoo -L/usr/lib -lbar")
+        assert_(d['library_dirs'] == ['/usr/lib', '/usr/lib'])
+        assert_(d['libraries'] == ['foo', 'bar'])
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_shell_utils.py b/venv/Lib/site-packages/numpy/distutils/tests/test_shell_utils.py
new file mode 100644
index 000000000..32bd283e5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_shell_utils.py
@@ -0,0 +1,76 @@
+import pytest
+import subprocess
+import json
+import sys
+
+from numpy.distutils import _shell_utils
+
+argv_cases = [
+    [r'exe'],
+    [r'path/exe'],
+    [r'path\exe'],
+    [r'\\server\path\exe'],
+    [r'path to/exe'],
+    [r'path to\exe'],
+
+    [r'exe', '--flag'],
+    [r'path/exe', '--flag'],
+    [r'path\exe', '--flag'],
+    [r'path to/exe', '--flag'],
+    [r'path to\exe', '--flag'],
+
+    # flags containing literal quotes in their name
+    [r'path to/exe', '--flag-"quoted"'],
+    [r'path to\exe', '--flag-"quoted"'],
+    [r'path to/exe', '"--flag-quoted"'],
+    [r'path to\exe', '"--flag-quoted"'],
+]
+
+
+@pytest.fixture(params=[
+    _shell_utils.WindowsParser,
+    _shell_utils.PosixParser
+])
+def Parser(request):
+    return request.param
+
+
+@pytest.fixture
+def runner(Parser):
+    if Parser != _shell_utils.NativeParser:
+        pytest.skip('Unable to run with non-native parser')
+
+    if Parser == _shell_utils.WindowsParser:
+        return lambda cmd: subprocess.check_output(cmd)
+    elif Parser == _shell_utils.PosixParser:
+        # posix has no non-shell string parsing
+        return lambda cmd: subprocess.check_output(cmd, shell=True)
+    else:
+        raise NotImplementedError
+
+
+@pytest.mark.parametrize('argv', argv_cases)
+def test_join_matches_subprocess(Parser, runner, argv):
+    """
+    Test that join produces strings understood by subprocess
+    """
+    # invoke python to return its arguments as json
+    cmd = [
+        sys.executable, '-c',
+        'import json, sys; print(json.dumps(sys.argv[1:]))'
+    ]
+    joined = Parser.join(cmd + argv)
+    json_out = runner(joined).decode()
+    assert json.loads(json_out) == argv
+
+
+@pytest.mark.parametrize('argv', argv_cases)
+def test_roundtrip(Parser, argv):
+    """
+    Test that split is the inverse operation of join
+    """
+    try:
+        joined = Parser.join(argv)
+        assert argv == Parser.split(joined)
+    except NotImplementedError:
+        pytest.skip("Not implemented")
diff --git a/venv/Lib/site-packages/numpy/distutils/tests/test_system_info.py b/venv/Lib/site-packages/numpy/distutils/tests/test_system_info.py
new file mode 100644
index 000000000..0768ffdde
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/tests/test_system_info.py
@@ -0,0 +1,287 @@
+import os
+import shutil
+import pytest
+from tempfile import mkstemp, mkdtemp
+from subprocess import Popen, PIPE
+from distutils.errors import DistutilsError
+
+from numpy.testing import assert_, assert_equal, assert_raises
+from numpy.distutils import ccompiler, customized_ccompiler
+from numpy.distutils.system_info import system_info, ConfigParser, mkl_info
+from numpy.distutils.system_info import AliasedOptionError
+from numpy.distutils.system_info import default_lib_dirs, default_include_dirs
+from numpy.distutils import _shell_utils
+
+
+def get_class(name, notfound_action=1):
+    """
+    notfound_action:
+      0 - do nothing
+      1 - display warning message
+      2 - raise error
+    """
+    cl = {'temp1': Temp1Info,
+          'temp2': Temp2Info,
+          'duplicate_options': DuplicateOptionInfo,
+          }.get(name.lower(), _system_info)
+    return cl()
+
+simple_site = """
+[ALL]
+library_dirs = {dir1:s}{pathsep:s}{dir2:s}
+libraries = {lib1:s},{lib2:s}
+extra_compile_args = -I/fake/directory -I"/path with/spaces" -Os
+runtime_library_dirs = {dir1:s}
+
+[temp1]
+library_dirs = {dir1:s}
+libraries = {lib1:s}
+runtime_library_dirs = {dir1:s}
+
+[temp2]
+library_dirs = {dir2:s}
+libraries = {lib2:s}
+extra_link_args = -Wl,-rpath={lib2_escaped:s}
+rpath = {dir2:s}
+
+[duplicate_options]
+mylib_libs = {lib1:s}
+libraries = {lib2:s}
+"""
+site_cfg = simple_site
+
+fakelib_c_text = """
+/* This file is generated from numpy/distutils/testing/test_system_info.py */
+#include<stdio.h>
+void foo(void) {
+   printf("Hello foo");
+}
+void bar(void) {
+   printf("Hello bar");
+}
+"""
+
+def have_compiler():
+    """ Return True if there appears to be an executable compiler
+    """
+    compiler = customized_ccompiler()
+    try:
+        cmd = compiler.compiler  # Unix compilers
+    except AttributeError:
+        try:
+            if not compiler.initialized:
+                compiler.initialize()  # MSVC is different
+        except (DistutilsError, ValueError):
+            return False
+        cmd = [compiler.cc]
+    try:
+        p = Popen(cmd, stdout=PIPE, stderr=PIPE)
+        p.stdout.close()
+        p.stderr.close()
+        p.wait()
+    except OSError:
+        return False
+    return True
+
+
+HAVE_COMPILER = have_compiler()
+
+
+class _system_info(system_info):
+
+    def __init__(self,
+                 default_lib_dirs=default_lib_dirs,
+                 default_include_dirs=default_include_dirs,
+                 verbosity=1,
+                 ):
+        self.__class__.info = {}
+        self.local_prefixes = []
+        defaults = {'library_dirs': '',
+                    'include_dirs': '',
+                    'runtime_library_dirs': '',
+                    'rpath': '',
+                    'src_dirs': '',
+                    'search_static_first': "0",
+                    'extra_compile_args': '',
+                    'extra_link_args': ''}
+        self.cp = ConfigParser(defaults)
+        # We have to parse the config files afterwards
+        # to have a consistent temporary filepath
+
+    def _check_libs(self, lib_dirs, libs, opt_libs, exts):
+        """Override _check_libs to return with all dirs """
+        info = {'libraries': libs, 'library_dirs': lib_dirs}
+        return info
+
+
+class Temp1Info(_system_info):
+    """For testing purposes"""
+    section = 'temp1'
+
+
+class Temp2Info(_system_info):
+    """For testing purposes"""
+    section = 'temp2'
+
+class DuplicateOptionInfo(_system_info):
+    """For testing purposes"""
+    section = 'duplicate_options'
+
+
+class TestSystemInfoReading:
+
+    def setup(self):
+        """ Create the libraries """
+        # Create 2 sources and 2 libraries
+        self._dir1 = mkdtemp()
+        self._src1 = os.path.join(self._dir1, 'foo.c')
+        self._lib1 = os.path.join(self._dir1, 'libfoo.so')
+        self._dir2 = mkdtemp()
+        self._src2 = os.path.join(self._dir2, 'bar.c')
+        self._lib2 = os.path.join(self._dir2, 'libbar.so')
+        # Update local site.cfg
+        global simple_site, site_cfg
+        site_cfg = simple_site.format(**{
+            'dir1': self._dir1,
+            'lib1': self._lib1,
+            'dir2': self._dir2,
+            'lib2': self._lib2,
+            'pathsep': os.pathsep,
+            'lib2_escaped': _shell_utils.NativeParser.join([self._lib2])
+        })
+        # Write site.cfg
+        fd, self._sitecfg = mkstemp()
+        os.close(fd)
+        with open(self._sitecfg, 'w') as fd:
+            fd.write(site_cfg)
+        # Write the sources
+        with open(self._src1, 'w') as fd:
+            fd.write(fakelib_c_text)
+        with open(self._src2, 'w') as fd:
+            fd.write(fakelib_c_text)
+        # We create all class-instances
+
+        def site_and_parse(c, site_cfg):
+            c.files = [site_cfg]
+            c.parse_config_files()
+            return c
+        self.c_default = site_and_parse(get_class('default'), self._sitecfg)
+        self.c_temp1 = site_and_parse(get_class('temp1'), self._sitecfg)
+        self.c_temp2 = site_and_parse(get_class('temp2'), self._sitecfg)
+        self.c_dup_options = site_and_parse(get_class('duplicate_options'),
+                                            self._sitecfg)
+
+
+    def teardown(self):
+        # Do each removal separately
+        try:
+            shutil.rmtree(self._dir1)
+        except Exception:
+            pass
+        try:
+            shutil.rmtree(self._dir2)
+        except Exception:
+            pass
+        try:
+            os.remove(self._sitecfg)
+        except Exception:
+            pass
+
+    def test_all(self):
+        # Read in all information in the ALL block
+        tsi = self.c_default
+        assert_equal(tsi.get_lib_dirs(), [self._dir1, self._dir2])
+        assert_equal(tsi.get_libraries(), [self._lib1, self._lib2])
+        assert_equal(tsi.get_runtime_lib_dirs(), [self._dir1])
+        extra = tsi.calc_extra_info()
+        assert_equal(extra['extra_compile_args'], ['-I/fake/directory', '-I/path with/spaces', '-Os'])
+
+    def test_temp1(self):
+        # Read in all information in the temp1 block
+        tsi = self.c_temp1
+        assert_equal(tsi.get_lib_dirs(), [self._dir1])
+        assert_equal(tsi.get_libraries(), [self._lib1])
+        assert_equal(tsi.get_runtime_lib_dirs(), [self._dir1])
+
+    def test_temp2(self):
+        # Read in all information in the temp2 block
+        tsi = self.c_temp2
+        assert_equal(tsi.get_lib_dirs(), [self._dir2])
+        assert_equal(tsi.get_libraries(), [self._lib2])
+        # Now from rpath and not runtime_library_dirs
+        assert_equal(tsi.get_runtime_lib_dirs(key='rpath'), [self._dir2])
+        extra = tsi.calc_extra_info()
+        assert_equal(extra['extra_link_args'], ['-Wl,-rpath=' + self._lib2])
+
+    def test_duplicate_options(self):
+        # Ensure that duplicates are raising an AliasedOptionError
+        tsi = self.c_dup_options
+        assert_raises(AliasedOptionError, tsi.get_option_single, "mylib_libs", "libraries")
+        assert_equal(tsi.get_libs("mylib_libs", [self._lib1]), [self._lib1])
+        assert_equal(tsi.get_libs("libraries", [self._lib2]), [self._lib2])
+
+    @pytest.mark.skipif(not HAVE_COMPILER, reason="Missing compiler")
+    def test_compile1(self):
+        # Compile source and link the first source
+        c = customized_ccompiler()
+        previousDir = os.getcwd()
+        try:
+            # Change directory to not screw up directories
+            os.chdir(self._dir1)
+            c.compile([os.path.basename(self._src1)], output_dir=self._dir1)
+            # Ensure that the object exists
+            assert_(os.path.isfile(self._src1.replace('.c', '.o')) or
+                    os.path.isfile(self._src1.replace('.c', '.obj')))
+        finally:
+            os.chdir(previousDir)
+
+    @pytest.mark.skipif(not HAVE_COMPILER, reason="Missing compiler")
+    @pytest.mark.skipif('msvc' in repr(ccompiler.new_compiler()),
+                         reason="Fails with MSVC compiler ")
+    def test_compile2(self):
+        # Compile source and link the second source
+        tsi = self.c_temp2
+        c = customized_ccompiler()
+        extra_link_args = tsi.calc_extra_info()['extra_link_args']
+        previousDir = os.getcwd()
+        try:
+            # Change directory to not screw up directories
+            os.chdir(self._dir2)
+            c.compile([os.path.basename(self._src2)], output_dir=self._dir2,
+                      extra_postargs=extra_link_args)
+            # Ensure that the object exists
+            assert_(os.path.isfile(self._src2.replace('.c', '.o')))
+        finally:
+            os.chdir(previousDir)
+
+    def test_overrides(self):
+        previousDir = os.getcwd()
+        cfg = os.path.join(self._dir1, 'site.cfg')
+        shutil.copy(self._sitecfg, cfg)
+        try:
+            os.chdir(self._dir1)
+            # Check that the '[ALL]' section does not override
+            # missing values from other sections
+            info = mkl_info()
+            lib_dirs = info.cp['ALL']['library_dirs'].split(os.pathsep)
+            assert info.get_lib_dirs() != lib_dirs
+
+            # But if we copy the values to a '[mkl]' section the value
+            # is correct
+            with open(cfg, 'r') as fid:
+                mkl = fid.read().replace('ALL', 'mkl')
+            with open(cfg, 'w') as fid:
+                fid.write(mkl)
+            info = mkl_info()
+            assert info.get_lib_dirs() == lib_dirs
+
+            # Also, the values will be taken from a section named '[DEFAULT]'
+            with open(cfg, 'r') as fid:
+                dflt = fid.read().replace('mkl', 'DEFAULT')
+            with open(cfg, 'w') as fid:
+                fid.write(dflt)
+            info = mkl_info()
+            assert info.get_lib_dirs() == lib_dirs
+        finally:
+            os.chdir(previousDir)
+        
diff --git a/venv/Lib/site-packages/numpy/distutils/unixccompiler.py b/venv/Lib/site-packages/numpy/distutils/unixccompiler.py
new file mode 100644
index 000000000..5f36c439f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/distutils/unixccompiler.py
@@ -0,0 +1,132 @@
+"""
+unixccompiler - can handle very long argument lists for ar.
+
+"""
+import os
+
+from distutils.errors import CompileError, DistutilsExecError, LibError
+from distutils.unixccompiler import UnixCCompiler
+from numpy.distutils.ccompiler import replace_method
+from numpy.distutils.misc_util import _commandline_dep_string
+from numpy.distutils import log
+
+# Note that UnixCCompiler._compile appeared in Python 2.3
+def UnixCCompiler__compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
+    """Compile a single source files with a Unix-style compiler."""
+    # HP ad-hoc fix, see ticket 1383
+    ccomp = self.compiler_so
+    if ccomp[0] == 'aCC':
+        # remove flags that will trigger ANSI-C mode for aCC
+        if '-Ae' in ccomp:
+            ccomp.remove('-Ae')
+        if '-Aa' in ccomp:
+            ccomp.remove('-Aa')
+        # add flags for (almost) sane C++ handling
+        ccomp += ['-AA']
+        self.compiler_so = ccomp
+    # ensure OPT environment variable is read
+    if 'OPT' in os.environ:
+        from distutils.sysconfig import get_config_vars
+        opt = " ".join(os.environ['OPT'].split())
+        gcv_opt = " ".join(get_config_vars('OPT')[0].split())
+        ccomp_s = " ".join(self.compiler_so)
+        if opt not in ccomp_s:
+            ccomp_s = ccomp_s.replace(gcv_opt, opt)
+            self.compiler_so = ccomp_s.split()
+        llink_s = " ".join(self.linker_so)
+        if opt not in llink_s:
+            self.linker_so = llink_s.split() + opt.split()
+
+    display = '%s: %s' % (os.path.basename(self.compiler_so[0]), src)
+
+    # gcc style automatic dependencies, outputs a makefile (-MF) that lists
+    # all headers needed by a c file as a side effect of compilation (-MMD)
+    if getattr(self, '_auto_depends', False):
+        deps = ['-MMD', '-MF', obj + '.d']
+    else:
+        deps = []
+
+    try:
+        self.spawn(self.compiler_so + cc_args + [src, '-o', obj] + deps +
+                   extra_postargs, display = display)
+    except DistutilsExecError as e:
+        msg = str(e)
+        raise CompileError(msg)
+
+    # add commandline flags to dependency file
+    if deps:
+        with open(obj + '.d', 'a') as f:
+            f.write(_commandline_dep_string(cc_args, extra_postargs, pp_opts))
+
+replace_method(UnixCCompiler, '_compile', UnixCCompiler__compile)
+
+
+def UnixCCompiler_create_static_lib(self, objects, output_libname,
+                                    output_dir=None, debug=0, target_lang=None):
+    """
+    Build a static library in a separate sub-process.
+
+    Parameters
+    ----------
+    objects : list or tuple of str
+        List of paths to object files used to build the static library.
+    output_libname : str
+        The library name as an absolute or relative (if `output_dir` is used)
+        path.
+    output_dir : str, optional
+        The path to the output directory. Default is None, in which case
+        the ``output_dir`` attribute of the UnixCCompiler instance.
+    debug : bool, optional
+        This parameter is not used.
+    target_lang : str, optional
+        This parameter is not used.
+
+    Returns
+    -------
+    None
+
+    """
+    objects, output_dir = self._fix_object_args(objects, output_dir)
+
+    output_filename = \
+                    self.library_filename(output_libname, output_dir=output_dir)
+
+    if self._need_link(objects, output_filename):
+        try:
+            # previous .a may be screwed up; best to remove it first
+            # and recreate.
+            # Also, ar on OS X doesn't handle updating universal archives
+            os.unlink(output_filename)
+        except (IOError, OSError):
+            pass
+        self.mkpath(os.path.dirname(output_filename))
+        tmp_objects = objects + self.objects
+        while tmp_objects:
+            objects = tmp_objects[:50]
+            tmp_objects = tmp_objects[50:]
+            display = '%s: adding %d object files to %s' % (
+                           os.path.basename(self.archiver[0]),
+                           len(objects), output_filename)
+            self.spawn(self.archiver + [output_filename] + objects,
+                       display = display)
+
+        # Not many Unices required ranlib anymore -- SunOS 4.x is, I
+        # think the only major Unix that does.  Maybe we need some
+        # platform intelligence here to skip ranlib if it's not
+        # needed -- or maybe Python's configure script took care of
+        # it for us, hence the check for leading colon.
+        if self.ranlib:
+            display = '%s:@ %s' % (os.path.basename(self.ranlib[0]),
+                                   output_filename)
+            try:
+                self.spawn(self.ranlib + [output_filename],
+                           display = display)
+            except DistutilsExecError as e:
+                msg = str(e)
+                raise LibError(msg)
+    else:
+        log.debug("skipping %s (up-to-date)", output_filename)
+    return
+
+replace_method(UnixCCompiler, 'create_static_lib',
+               UnixCCompiler_create_static_lib)
diff --git a/venv/Lib/site-packages/numpy/doc/__init__.py b/venv/Lib/site-packages/numpy/doc/__init__.py
new file mode 100644
index 000000000..8a944fecd
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/__init__.py
@@ -0,0 +1,26 @@
+import os
+
+ref_dir = os.path.join(os.path.dirname(__file__))
+
+__all__ = sorted(f[:-3] for f in os.listdir(ref_dir) if f.endswith('.py') and
+           not f.startswith('__'))
+
+for f in __all__:
+    __import__(__name__ + '.' + f)
+
+del f, ref_dir
+
+__doc__ = """\
+Topical documentation
+=====================
+
+The following topics are available:
+%s
+
+You can view them by
+
+>>> help(np.doc.TOPIC)                                      #doctest: +SKIP
+
+""" % '\n- '.join([''] + __all__)
+
+__all__.extend(['__doc__'])
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..6aa6159ba
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/basics.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/basics.cpython-36.pyc
new file mode 100644
index 000000000..ca25cf21c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/basics.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/broadcasting.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/broadcasting.cpython-36.pyc
new file mode 100644
index 000000000..6bccf1a8a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/broadcasting.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/byteswapping.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/byteswapping.cpython-36.pyc
new file mode 100644
index 000000000..fc4d26412
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/byteswapping.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/constants.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/constants.cpython-36.pyc
new file mode 100644
index 000000000..31658b02b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/constants.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/creation.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/creation.cpython-36.pyc
new file mode 100644
index 000000000..f0acf60b9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/creation.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/dispatch.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/dispatch.cpython-36.pyc
new file mode 100644
index 000000000..4ec6f2bcc
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/dispatch.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/glossary.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/glossary.cpython-36.pyc
new file mode 100644
index 000000000..2519bd7be
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/glossary.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/indexing.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/indexing.cpython-36.pyc
new file mode 100644
index 000000000..4798c8268
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/indexing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/internals.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/internals.cpython-36.pyc
new file mode 100644
index 000000000..3d0bed997
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/internals.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/misc.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/misc.cpython-36.pyc
new file mode 100644
index 000000000..c538bf5b4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/misc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/structured_arrays.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/structured_arrays.cpython-36.pyc
new file mode 100644
index 000000000..1b11b436b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/structured_arrays.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/subclassing.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/subclassing.cpython-36.pyc
new file mode 100644
index 000000000..7063b9cf0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/subclassing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/__pycache__/ufuncs.cpython-36.pyc b/venv/Lib/site-packages/numpy/doc/__pycache__/ufuncs.cpython-36.pyc
new file mode 100644
index 000000000..523cebf5c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/doc/__pycache__/ufuncs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/doc/basics.py b/venv/Lib/site-packages/numpy/doc/basics.py
new file mode 100644
index 000000000..635c1b1b8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/basics.py
@@ -0,0 +1,341 @@
+"""
+============
+Array basics
+============
+
+Array types and conversions between types
+=========================================
+
+NumPy supports a much greater variety of numerical types than Python does.
+This section shows which are available, and how to modify an array's data-type.
+
+The primitive types supported are tied closely to those in C:
+
+.. list-table::
+    :header-rows: 1
+
+    * - Numpy type
+      - C type
+      - Description
+
+    * - `np.bool_`
+      - ``bool``
+      - Boolean (True or False) stored as a byte
+
+    * - `np.byte`
+      - ``signed char``
+      - Platform-defined
+
+    * - `np.ubyte`
+      - ``unsigned char``
+      - Platform-defined
+
+    * - `np.short`
+      - ``short``
+      - Platform-defined
+
+    * - `np.ushort`
+      - ``unsigned short``
+      - Platform-defined
+
+    * - `np.intc`
+      - ``int``
+      - Platform-defined
+
+    * - `np.uintc`
+      - ``unsigned int``
+      - Platform-defined
+
+    * - `np.int_`
+      - ``long``
+      - Platform-defined
+
+    * - `np.uint`
+      - ``unsigned long``
+      - Platform-defined
+
+    * - `np.longlong`
+      - ``long long``
+      - Platform-defined
+
+    * - `np.ulonglong`
+      - ``unsigned long long``
+      - Platform-defined
+
+    * - `np.half` / `np.float16`
+      -
+      - Half precision float:
+        sign bit, 5 bits exponent, 10 bits mantissa
+
+    * - `np.single`
+      - ``float``
+      - Platform-defined single precision float:
+        typically sign bit, 8 bits exponent, 23 bits mantissa
+
+    * - `np.double`
+      - ``double``
+      - Platform-defined double precision float:
+        typically sign bit, 11 bits exponent, 52 bits mantissa.
+
+    * - `np.longdouble`
+      - ``long double``
+      - Platform-defined extended-precision float
+
+    * - `np.csingle`
+      - ``float complex``
+      - Complex number, represented by two single-precision floats (real and imaginary components)
+
+    * - `np.cdouble`
+      - ``double complex``
+      - Complex number, represented by two double-precision floats (real and imaginary components).
+
+    * - `np.clongdouble`
+      - ``long double complex``
+      - Complex number, represented by two extended-precision floats (real and imaginary components).
+
+
+Since many of these have platform-dependent definitions, a set of fixed-size
+aliases are provided:
+
+.. list-table::
+    :header-rows: 1
+
+    * - Numpy type
+      - C type
+      - Description
+
+    * - `np.int8`
+      - ``int8_t``
+      - Byte (-128 to 127)
+
+    * - `np.int16`
+      - ``int16_t``
+      - Integer (-32768 to 32767)
+
+    * - `np.int32`
+      - ``int32_t``
+      - Integer (-2147483648 to 2147483647)
+
+    * - `np.int64`
+      - ``int64_t``
+      - Integer (-9223372036854775808 to 9223372036854775807)
+
+    * - `np.uint8`
+      - ``uint8_t``
+      - Unsigned integer (0 to 255)
+
+    * - `np.uint16`
+      - ``uint16_t``
+      - Unsigned integer (0 to 65535)
+
+    * - `np.uint32`
+      - ``uint32_t``
+      - Unsigned integer (0 to 4294967295)
+
+    * - `np.uint64`
+      - ``uint64_t``
+      - Unsigned integer (0 to 18446744073709551615)
+
+    * - `np.intp`
+      - ``intptr_t``
+      - Integer used for indexing, typically the same as ``ssize_t``
+
+    * - `np.uintp`
+      - ``uintptr_t``
+      - Integer large enough to hold a pointer
+
+    * - `np.float32`
+      - ``float``
+      -
+
+    * - `np.float64` / `np.float_`
+      - ``double``
+      - Note that this matches the precision of the builtin python `float`.
+
+    * - `np.complex64`
+      - ``float complex``
+      - Complex number, represented by two 32-bit floats (real and imaginary components)
+
+    * - `np.complex128` / `np.complex_`
+      - ``double complex``
+      - Note that this matches the precision of the builtin python `complex`.
+
+
+NumPy numerical types are instances of ``dtype`` (data-type) objects, each
+having unique characteristics.  Once you have imported NumPy using
+
+  ::
+
+    >>> import numpy as np
+
+the dtypes are available as ``np.bool_``, ``np.float32``, etc.
+
+Advanced types, not listed in the table above, are explored in
+section :ref:`structured_arrays`.
+
+There are 5 basic numerical types representing booleans (bool), integers (int),
+unsigned integers (uint) floating point (float) and complex. Those with numbers
+in their name indicate the bitsize of the type (i.e. how many bits are needed
+to represent a single value in memory).  Some types, such as ``int`` and
+``intp``, have differing bitsizes, dependent on the platforms (e.g. 32-bit
+vs. 64-bit machines).  This should be taken into account when interfacing
+with low-level code (such as C or Fortran) where the raw memory is addressed.
+
+Data-types can be used as functions to convert python numbers to array scalars
+(see the array scalar section for an explanation), python sequences of numbers
+to arrays of that type, or as arguments to the dtype keyword that many numpy
+functions or methods accept. Some examples::
+
+    >>> import numpy as np
+    >>> x = np.float32(1.0)
+    >>> x
+    1.0
+    >>> y = np.int_([1,2,4])
+    >>> y
+    array([1, 2, 4])
+    >>> z = np.arange(3, dtype=np.uint8)
+    >>> z
+    array([0, 1, 2], dtype=uint8)
+
+Array types can also be referred to by character codes, mostly to retain
+backward compatibility with older packages such as Numeric.  Some
+documentation may still refer to these, for example::
+
+  >>> np.array([1, 2, 3], dtype='f')
+  array([ 1.,  2.,  3.], dtype=float32)
+
+We recommend using dtype objects instead.
+
+To convert the type of an array, use the .astype() method (preferred) or
+the type itself as a function. For example: ::
+
+    >>> z.astype(float)                 #doctest: +NORMALIZE_WHITESPACE
+    array([  0.,  1.,  2.])
+    >>> np.int8(z)
+    array([0, 1, 2], dtype=int8)
+
+Note that, above, we use the *Python* float object as a dtype.  NumPy knows
+that ``int`` refers to ``np.int_``, ``bool`` means ``np.bool_``,
+that ``float`` is ``np.float_`` and ``complex`` is ``np.complex_``.
+The other data-types do not have Python equivalents.
+
+To determine the type of an array, look at the dtype attribute::
+
+    >>> z.dtype
+    dtype('uint8')
+
+dtype objects also contain information about the type, such as its bit-width
+and its byte-order.  The data type can also be used indirectly to query
+properties of the type, such as whether it is an integer::
+
+    >>> d = np.dtype(int)
+    >>> d
+    dtype('int32')
+
+    >>> np.issubdtype(d, np.integer)
+    True
+
+    >>> np.issubdtype(d, np.floating)
+    False
+
+
+Array Scalars
+=============
+
+NumPy generally returns elements of arrays as array scalars (a scalar
+with an associated dtype).  Array scalars differ from Python scalars, but
+for the most part they can be used interchangeably (the primary
+exception is for versions of Python older than v2.x, where integer array
+scalars cannot act as indices for lists and tuples).  There are some
+exceptions, such as when code requires very specific attributes of a scalar
+or when it checks specifically whether a value is a Python scalar. Generally,
+problems are easily fixed by explicitly converting array scalars
+to Python scalars, using the corresponding Python type function
+(e.g., ``int``, ``float``, ``complex``, ``str``, ``unicode``).
+
+The primary advantage of using array scalars is that
+they preserve the array type (Python may not have a matching scalar type
+available, e.g. ``int16``).  Therefore, the use of array scalars ensures
+identical behaviour between arrays and scalars, irrespective of whether the
+value is inside an array or not.  NumPy scalars also have many of the same
+methods arrays do.
+
+Overflow Errors
+===============
+
+The fixed size of NumPy numeric types may cause overflow errors when a value
+requires more memory than available in the data type. For example, 
+`numpy.power` evaluates ``100 * 10 ** 8`` correctly for 64-bit integers,
+but gives 1874919424 (incorrect) for a 32-bit integer.
+
+    >>> np.power(100, 8, dtype=np.int64)
+    10000000000000000
+    >>> np.power(100, 8, dtype=np.int32)
+    1874919424
+
+The behaviour of NumPy and Python integer types differs significantly for
+integer overflows and may confuse users expecting NumPy integers to behave
+similar to Python's ``int``. Unlike NumPy, the size of Python's ``int`` is
+flexible. This means Python integers may expand to accommodate any integer and
+will not overflow.
+
+NumPy provides `numpy.iinfo` and `numpy.finfo` to verify the
+minimum or maximum values of NumPy integer and floating point values
+respectively ::
+
+    >>> np.iinfo(int) # Bounds of the default integer on this system.
+    iinfo(min=-9223372036854775808, max=9223372036854775807, dtype=int64)
+    >>> np.iinfo(np.int32) # Bounds of a 32-bit integer
+    iinfo(min=-2147483648, max=2147483647, dtype=int32)
+    >>> np.iinfo(np.int64) # Bounds of a 64-bit integer
+    iinfo(min=-9223372036854775808, max=9223372036854775807, dtype=int64)
+
+If 64-bit integers are still too small the result may be cast to a
+floating point number. Floating point numbers offer a larger, but inexact,
+range of possible values.
+
+    >>> np.power(100, 100, dtype=np.int64) # Incorrect even with 64-bit int
+    0
+    >>> np.power(100, 100, dtype=np.float64)
+    1e+200
+
+Extended Precision
+==================
+
+Python's floating-point numbers are usually 64-bit floating-point numbers,
+nearly equivalent to ``np.float64``. In some unusual situations it may be
+useful to use floating-point numbers with more precision. Whether this
+is possible in numpy depends on the hardware and on the development
+environment: specifically, x86 machines provide hardware floating-point
+with 80-bit precision, and while most C compilers provide this as their
+``long double`` type, MSVC (standard for Windows builds) makes
+``long double`` identical to ``double`` (64 bits). NumPy makes the
+compiler's ``long double`` available as ``np.longdouble`` (and
+``np.clongdouble`` for the complex numbers). You can find out what your
+numpy provides with ``np.finfo(np.longdouble)``.
+
+NumPy does not provide a dtype with more precision than C's
+``long double``\\; in particular, the 128-bit IEEE quad precision
+data type (FORTRAN's ``REAL*16``\\) is not available.
+
+For efficient memory alignment, ``np.longdouble`` is usually stored
+padded with zero bits, either to 96 or 128 bits. Which is more efficient
+depends on hardware and development environment; typically on 32-bit
+systems they are padded to 96 bits, while on 64-bit systems they are
+typically padded to 128 bits. ``np.longdouble`` is padded to the system
+default; ``np.float96`` and ``np.float128`` are provided for users who
+want specific padding. In spite of the names, ``np.float96`` and
+``np.float128`` provide only as much precision as ``np.longdouble``,
+that is, 80 bits on most x86 machines and 64 bits in standard
+Windows builds.
+
+Be warned that even if ``np.longdouble`` offers more precision than
+python ``float``, it is easy to lose that extra precision, since
+python often forces values to pass through ``float``. For example,
+the ``%`` formatting operator requires its arguments to be converted
+to standard python types, and it is therefore impossible to preserve
+extended precision even if many decimal places are requested. It can
+be useful to test your code with the value
+``1 + np.finfo(np.longdouble).eps``.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/broadcasting.py b/venv/Lib/site-packages/numpy/doc/broadcasting.py
new file mode 100644
index 000000000..63975e6a9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/broadcasting.py
@@ -0,0 +1,180 @@
+"""
+========================
+Broadcasting over arrays
+========================
+
+.. note::
+    See `this article
+    <https://numpy.org/devdocs/user/theory.broadcasting.html>`_
+    for illustrations of broadcasting concepts.
+
+
+The term broadcasting describes how numpy treats arrays with different
+shapes during arithmetic operations. Subject to certain constraints,
+the smaller array is "broadcast" across the larger array so that they
+have compatible shapes. Broadcasting provides a means of vectorizing
+array operations so that looping occurs in C instead of Python. It does
+this without making needless copies of data and usually leads to
+efficient algorithm implementations. There are, however, cases where
+broadcasting is a bad idea because it leads to inefficient use of memory
+that slows computation.
+
+NumPy operations are usually done on pairs of arrays on an
+element-by-element basis.  In the simplest case, the two arrays must
+have exactly the same shape, as in the following example:
+
+  >>> a = np.array([1.0, 2.0, 3.0])
+  >>> b = np.array([2.0, 2.0, 2.0])
+  >>> a * b
+  array([ 2.,  4.,  6.])
+
+NumPy's broadcasting rule relaxes this constraint when the arrays'
+shapes meet certain constraints. The simplest broadcasting example occurs
+when an array and a scalar value are combined in an operation:
+
+>>> a = np.array([1.0, 2.0, 3.0])
+>>> b = 2.0
+>>> a * b
+array([ 2.,  4.,  6.])
+
+The result is equivalent to the previous example where ``b`` was an array.
+We can think of the scalar ``b`` being *stretched* during the arithmetic
+operation into an array with the same shape as ``a``. The new elements in
+``b`` are simply copies of the original scalar. The stretching analogy is
+only conceptual.  NumPy is smart enough to use the original scalar value
+without actually making copies so that broadcasting operations are as
+memory and computationally efficient as possible.
+
+The code in the second example is more efficient than that in the first
+because broadcasting moves less memory around during the multiplication
+(``b`` is a scalar rather than an array).
+
+General Broadcasting Rules
+==========================
+When operating on two arrays, NumPy compares their shapes element-wise.
+It starts with the trailing dimensions and works its way forward.  Two
+dimensions are compatible when
+
+1) they are equal, or
+2) one of them is 1
+
+If these conditions are not met, a
+``ValueError: operands could not be broadcast together`` exception is 
+thrown, indicating that the arrays have incompatible shapes. The size of 
+the resulting array is the size that is not 1 along each axis of the inputs.
+
+Arrays do not need to have the same *number* of dimensions.  For example,
+if you have a ``256x256x3`` array of RGB values, and you want to scale
+each color in the image by a different value, you can multiply the image
+by a one-dimensional array with 3 values. Lining up the sizes of the
+trailing axes of these arrays according to the broadcast rules, shows that
+they are compatible::
+
+  Image  (3d array): 256 x 256 x 3
+  Scale  (1d array):             3
+  Result (3d array): 256 x 256 x 3
+
+When either of the dimensions compared is one, the other is
+used.  In other words, dimensions with size 1 are stretched or "copied"
+to match the other.
+
+In the following example, both the ``A`` and ``B`` arrays have axes with
+length one that are expanded to a larger size during the broadcast
+operation::
+
+  A      (4d array):  8 x 1 x 6 x 1
+  B      (3d array):      7 x 1 x 5
+  Result (4d array):  8 x 7 x 6 x 5
+
+Here are some more examples::
+
+  A      (2d array):  5 x 4
+  B      (1d array):      1
+  Result (2d array):  5 x 4
+
+  A      (2d array):  5 x 4
+  B      (1d array):      4
+  Result (2d array):  5 x 4
+
+  A      (3d array):  15 x 3 x 5
+  B      (3d array):  15 x 1 x 5
+  Result (3d array):  15 x 3 x 5
+
+  A      (3d array):  15 x 3 x 5
+  B      (2d array):       3 x 5
+  Result (3d array):  15 x 3 x 5
+
+  A      (3d array):  15 x 3 x 5
+  B      (2d array):       3 x 1
+  Result (3d array):  15 x 3 x 5
+
+Here are examples of shapes that do not broadcast::
+
+  A      (1d array):  3
+  B      (1d array):  4 # trailing dimensions do not match
+
+  A      (2d array):      2 x 1
+  B      (3d array):  8 x 4 x 3 # second from last dimensions mismatched
+
+An example of broadcasting in practice::
+
+ >>> x = np.arange(4)
+ >>> xx = x.reshape(4,1)
+ >>> y = np.ones(5)
+ >>> z = np.ones((3,4))
+
+ >>> x.shape
+ (4,)
+
+ >>> y.shape
+ (5,)
+
+ >>> x + y
+ ValueError: operands could not be broadcast together with shapes (4,) (5,)
+
+ >>> xx.shape
+ (4, 1)
+
+ >>> y.shape
+ (5,)
+
+ >>> (xx + y).shape
+ (4, 5)
+
+ >>> xx + y
+ array([[ 1.,  1.,  1.,  1.,  1.],
+        [ 2.,  2.,  2.,  2.,  2.],
+        [ 3.,  3.,  3.,  3.,  3.],
+        [ 4.,  4.,  4.,  4.,  4.]])
+
+ >>> x.shape
+ (4,)
+
+ >>> z.shape
+ (3, 4)
+
+ >>> (x + z).shape
+ (3, 4)
+
+ >>> x + z
+ array([[ 1.,  2.,  3.,  4.],
+        [ 1.,  2.,  3.,  4.],
+        [ 1.,  2.,  3.,  4.]])
+
+Broadcasting provides a convenient way of taking the outer product (or
+any other outer operation) of two arrays. The following example shows an
+outer addition operation of two 1-d arrays::
+
+  >>> a = np.array([0.0, 10.0, 20.0, 30.0])
+  >>> b = np.array([1.0, 2.0, 3.0])
+  >>> a[:, np.newaxis] + b
+  array([[  1.,   2.,   3.],
+         [ 11.,  12.,  13.],
+         [ 21.,  22.,  23.],
+         [ 31.,  32.,  33.]])
+
+Here the ``newaxis`` index operator inserts a new axis into ``a``,
+making it a two-dimensional ``4x1`` array.  Combining the ``4x1`` array
+with ``b``, which has shape ``(3,)``, yields a ``4x3`` array.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/byteswapping.py b/venv/Lib/site-packages/numpy/doc/byteswapping.py
new file mode 100644
index 000000000..fe9461977
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/byteswapping.py
@@ -0,0 +1,155 @@
+"""
+
+=============================
+ Byteswapping and byte order
+=============================
+
+Introduction to byte ordering and ndarrays
+==========================================
+
+The ``ndarray`` is an object that provide a python array interface to data
+in memory.
+
+It often happens that the memory that you want to view with an array is
+not of the same byte ordering as the computer on which you are running
+Python.
+
+For example, I might be working on a computer with a little-endian CPU -
+such as an Intel Pentium, but I have loaded some data from a file
+written by a computer that is big-endian.  Let's say I have loaded 4
+bytes from a file written by a Sun (big-endian) computer.  I know that
+these 4 bytes represent two 16-bit integers.  On a big-endian machine, a
+two-byte integer is stored with the Most Significant Byte (MSB) first,
+and then the Least Significant Byte (LSB). Thus the bytes are, in memory order:
+
+#. MSB integer 1
+#. LSB integer 1
+#. MSB integer 2
+#. LSB integer 2
+
+Let's say the two integers were in fact 1 and 770.  Because 770 = 256 *
+3 + 2, the 4 bytes in memory would contain respectively: 0, 1, 3, 2.
+The bytes I have loaded from the file would have these contents:
+
+>>> big_end_buffer = bytearray([0,1,3,2])
+>>> big_end_buffer
+bytearray(b'\\x00\\x01\\x03\\x02')
+
+We might want to use an ``ndarray`` to access these integers.  In that
+case, we can create an array around this memory, and tell numpy that
+there are two integers, and that they are 16 bit and big-endian:
+
+>>> import numpy as np
+>>> big_end_arr = np.ndarray(shape=(2,),dtype='>i2', buffer=big_end_buffer)
+>>> big_end_arr[0]
+1
+>>> big_end_arr[1]
+770
+
+Note the array ``dtype`` above of ``>i2``.  The ``>`` means 'big-endian'
+(``<`` is little-endian) and ``i2`` means 'signed 2-byte integer'.  For
+example, if our data represented a single unsigned 4-byte little-endian
+integer, the dtype string would be ``<u4``.
+
+In fact, why don't we try that?
+
+>>> little_end_u4 = np.ndarray(shape=(1,),dtype='<u4', buffer=big_end_buffer)
+>>> little_end_u4[0] == 1 * 256**1 + 3 * 256**2 + 2 * 256**3
+True
+
+Returning to our ``big_end_arr`` - in this case our underlying data is
+big-endian (data endianness) and we've set the dtype to match (the dtype
+is also big-endian).  However, sometimes you need to flip these around.
+
+.. warning::
+
+    Scalars currently do not include byte order information, so extracting
+    a scalar from an array will return an integer in native byte order.
+    Hence:
+
+    >>> big_end_arr[0].dtype.byteorder == little_end_u4[0].dtype.byteorder
+    True
+
+Changing byte ordering
+======================
+
+As you can imagine from the introduction, there are two ways you can
+affect the relationship between the byte ordering of the array and the
+underlying memory it is looking at:
+
+* Change the byte-ordering information in the array dtype so that it
+  interprets the underlying data as being in a different byte order.
+  This is the role of ``arr.newbyteorder()``
+* Change the byte-ordering of the underlying data, leaving the dtype
+  interpretation as it was.  This is what ``arr.byteswap()`` does.
+
+The common situations in which you need to change byte ordering are:
+
+#. Your data and dtype endianness don't match, and you want to change
+   the dtype so that it matches the data.
+#. Your data and dtype endianness don't match, and you want to swap the
+   data so that they match the dtype
+#. Your data and dtype endianness match, but you want the data swapped
+   and the dtype to reflect this
+
+Data and dtype endianness don't match, change dtype to match data
+-----------------------------------------------------------------
+
+We make something where they don't match:
+
+>>> wrong_end_dtype_arr = np.ndarray(shape=(2,),dtype='<i2', buffer=big_end_buffer)
+>>> wrong_end_dtype_arr[0]
+256
+
+The obvious fix for this situation is to change the dtype so it gives
+the correct endianness:
+
+>>> fixed_end_dtype_arr = wrong_end_dtype_arr.newbyteorder()
+>>> fixed_end_dtype_arr[0]
+1
+
+Note the array has not changed in memory:
+
+>>> fixed_end_dtype_arr.tobytes() == big_end_buffer
+True
+
+Data and type endianness don't match, change data to match dtype
+----------------------------------------------------------------
+
+You might want to do this if you need the data in memory to be a certain
+ordering.  For example you might be writing the memory out to a file
+that needs a certain byte ordering.
+
+>>> fixed_end_mem_arr = wrong_end_dtype_arr.byteswap()
+>>> fixed_end_mem_arr[0]
+1
+
+Now the array *has* changed in memory:
+
+>>> fixed_end_mem_arr.tobytes() == big_end_buffer
+False
+
+Data and dtype endianness match, swap data and dtype
+----------------------------------------------------
+
+You may have a correctly specified array dtype, but you need the array
+to have the opposite byte order in memory, and you want the dtype to
+match so the array values make sense.  In this case you just do both of
+the previous operations:
+
+>>> swapped_end_arr = big_end_arr.byteswap().newbyteorder()
+>>> swapped_end_arr[0]
+1
+>>> swapped_end_arr.tobytes() == big_end_buffer
+False
+
+An easier way of casting the data to a specific dtype and byte ordering
+can be achieved with the ndarray astype method:
+
+>>> swapped_end_arr = big_end_arr.astype('<i2')
+>>> swapped_end_arr[0]
+1
+>>> swapped_end_arr.tobytes() == big_end_buffer
+False
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/constants.py b/venv/Lib/site-packages/numpy/doc/constants.py
new file mode 100644
index 000000000..2c629ad33
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/constants.py
@@ -0,0 +1,417 @@
+# -*- coding: utf-8 -*-
+"""
+=========
+Constants
+=========
+
+.. currentmodule:: numpy
+
+NumPy includes several constants:
+
+%(constant_list)s
+"""
+#
+# Note: the docstring is autogenerated.
+#
+import re
+import textwrap
+
+# Maintain same format as in numpy.add_newdocs
+constants = []
+def add_newdoc(module, name, doc):
+    constants.append((name, doc))
+
+add_newdoc('numpy', 'pi',
+    """
+    ``pi = 3.1415926535897932384626433...``
+
+    References
+    ----------
+    https://en.wikipedia.org/wiki/Pi
+
+    """)
+
+add_newdoc('numpy', 'e',
+    """
+    Euler's constant, base of natural logarithms, Napier's constant.
+
+    ``e = 2.71828182845904523536028747135266249775724709369995...``
+
+    See Also
+    --------
+    exp : Exponential function
+    log : Natural logarithm
+
+    References
+    ----------
+    https://en.wikipedia.org/wiki/E_%28mathematical_constant%29
+
+    """)
+
+add_newdoc('numpy', 'euler_gamma',
+    """
+    ``γ = 0.5772156649015328606065120900824024310421...``
+
+    References
+    ----------
+    https://en.wikipedia.org/wiki/Euler-Mascheroni_constant
+
+    """)
+
+add_newdoc('numpy', 'inf',
+    """
+    IEEE 754 floating point representation of (positive) infinity.
+
+    Returns
+    -------
+    y : float
+        A floating point representation of positive infinity.
+
+    See Also
+    --------
+    isinf : Shows which elements are positive or negative infinity
+
+    isposinf : Shows which elements are positive infinity
+
+    isneginf : Shows which elements are negative infinity
+
+    isnan : Shows which elements are Not a Number
+
+    isfinite : Shows which elements are finite (not one of Not a Number,
+    positive infinity and negative infinity)
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+    Also that positive infinity is not equivalent to negative infinity. But
+    infinity is equivalent to positive infinity.
+
+    `Inf`, `Infinity`, `PINF` and `infty` are aliases for `inf`.
+
+    Examples
+    --------
+    >>> np.inf
+    inf
+    >>> np.array([1]) / 0.
+    array([ Inf])
+
+    """)
+
+add_newdoc('numpy', 'nan',
+    """
+    IEEE 754 floating point representation of Not a Number (NaN).
+
+    Returns
+    -------
+    y : A floating point representation of Not a Number.
+
+    See Also
+    --------
+    isnan : Shows which elements are Not a Number.
+
+    isfinite : Shows which elements are finite (not one of
+    Not a Number, positive infinity and negative infinity)
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+
+    `NaN` and `NAN` are aliases of `nan`.
+
+    Examples
+    --------
+    >>> np.nan
+    nan
+    >>> np.log(-1)
+    nan
+    >>> np.log([-1, 1, 2])
+    array([        NaN,  0.        ,  0.69314718])
+
+    """)
+
+add_newdoc('numpy', 'newaxis',
+    """
+    A convenient alias for None, useful for indexing arrays.
+
+    See Also
+    --------
+    `numpy.doc.indexing`
+
+    Examples
+    --------
+    >>> newaxis is None
+    True
+    >>> x = np.arange(3)
+    >>> x
+    array([0, 1, 2])
+    >>> x[:, newaxis]
+    array([[0],
+    [1],
+    [2]])
+    >>> x[:, newaxis, newaxis]
+    array([[[0]],
+    [[1]],
+    [[2]]])
+    >>> x[:, newaxis] * x
+    array([[0, 0, 0],
+    [0, 1, 2],
+    [0, 2, 4]])
+
+    Outer product, same as ``outer(x, y)``:
+
+    >>> y = np.arange(3, 6)
+    >>> x[:, newaxis] * y
+    array([[ 0,  0,  0],
+    [ 3,  4,  5],
+    [ 6,  8, 10]])
+
+    ``x[newaxis, :]`` is equivalent to ``x[newaxis]`` and ``x[None]``:
+
+    >>> x[newaxis, :].shape
+    (1, 3)
+    >>> x[newaxis].shape
+    (1, 3)
+    >>> x[None].shape
+    (1, 3)
+    >>> x[:, newaxis].shape
+    (3, 1)
+
+    """)
+
+add_newdoc('numpy', 'NZERO',
+    """
+    IEEE 754 floating point representation of negative zero.
+
+    Returns
+    -------
+    y : float
+        A floating point representation of negative zero.
+
+    See Also
+    --------
+    PZERO : Defines positive zero.
+
+    isinf : Shows which elements are positive or negative infinity.
+
+    isposinf : Shows which elements are positive infinity.
+
+    isneginf : Shows which elements are negative infinity.
+
+    isnan : Shows which elements are Not a Number.
+
+    isfinite : Shows which elements are finite - not one of
+               Not a Number, positive infinity and negative infinity.
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). Negative zero is considered to be a finite number.
+
+    Examples
+    --------
+    >>> np.NZERO
+    -0.0
+    >>> np.PZERO
+    0.0
+
+    >>> np.isfinite([np.NZERO])
+    array([ True])
+    >>> np.isnan([np.NZERO])
+    array([False])
+    >>> np.isinf([np.NZERO])
+    array([False])
+
+    """)
+
+add_newdoc('numpy', 'PZERO',
+    """
+    IEEE 754 floating point representation of positive zero.
+
+    Returns
+    -------
+    y : float
+        A floating point representation of positive zero.
+
+    See Also
+    --------
+    NZERO : Defines negative zero.
+
+    isinf : Shows which elements are positive or negative infinity.
+
+    isposinf : Shows which elements are positive infinity.
+
+    isneginf : Shows which elements are negative infinity.
+
+    isnan : Shows which elements are Not a Number.
+
+    isfinite : Shows which elements are finite - not one of
+               Not a Number, positive infinity and negative infinity.
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). Positive zero is considered to be a finite number.
+
+    Examples
+    --------
+    >>> np.PZERO
+    0.0
+    >>> np.NZERO
+    -0.0
+
+    >>> np.isfinite([np.PZERO])
+    array([ True])
+    >>> np.isnan([np.PZERO])
+    array([False])
+    >>> np.isinf([np.PZERO])
+    array([False])
+
+    """)
+
+add_newdoc('numpy', 'NAN',
+    """
+    IEEE 754 floating point representation of Not a Number (NaN).
+
+    `NaN` and `NAN` are equivalent definitions of `nan`. Please use
+    `nan` instead of `NAN`.
+
+    See Also
+    --------
+    nan
+
+    """)
+
+add_newdoc('numpy', 'NaN',
+    """
+    IEEE 754 floating point representation of Not a Number (NaN).
+
+    `NaN` and `NAN` are equivalent definitions of `nan`. Please use
+    `nan` instead of `NaN`.
+
+    See Also
+    --------
+    nan
+
+    """)
+
+add_newdoc('numpy', 'NINF',
+    """
+    IEEE 754 floating point representation of negative infinity.
+
+    Returns
+    -------
+    y : float
+        A floating point representation of negative infinity.
+
+    See Also
+    --------
+    isinf : Shows which elements are positive or negative infinity
+
+    isposinf : Shows which elements are positive infinity
+
+    isneginf : Shows which elements are negative infinity
+
+    isnan : Shows which elements are Not a Number
+
+    isfinite : Shows which elements are finite (not one of Not a Number,
+    positive infinity and negative infinity)
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+    Also that positive infinity is not equivalent to negative infinity. But
+    infinity is equivalent to positive infinity.
+
+    Examples
+    --------
+    >>> np.NINF
+    -inf
+    >>> np.log(0)
+    -inf
+
+    """)
+
+add_newdoc('numpy', 'PINF',
+    """
+    IEEE 754 floating point representation of (positive) infinity.
+
+    Use `inf` because `Inf`, `Infinity`, `PINF` and `infty` are aliases for
+    `inf`. For more details, see `inf`.
+
+    See Also
+    --------
+    inf
+
+    """)
+
+add_newdoc('numpy', 'infty',
+    """
+    IEEE 754 floating point representation of (positive) infinity.
+
+    Use `inf` because `Inf`, `Infinity`, `PINF` and `infty` are aliases for
+    `inf`. For more details, see `inf`.
+
+    See Also
+    --------
+    inf
+
+    """)
+
+add_newdoc('numpy', 'Inf',
+    """
+    IEEE 754 floating point representation of (positive) infinity.
+
+    Use `inf` because `Inf`, `Infinity`, `PINF` and `infty` are aliases for
+    `inf`. For more details, see `inf`.
+
+    See Also
+    --------
+    inf
+
+    """)
+
+add_newdoc('numpy', 'Infinity',
+    """
+    IEEE 754 floating point representation of (positive) infinity.
+
+    Use `inf` because `Inf`, `Infinity`, `PINF` and `infty` are aliases for
+    `inf`. For more details, see `inf`.
+
+    See Also
+    --------
+    inf
+
+    """)
+
+
+if __doc__:
+    constants_str = []
+    constants.sort()
+    for name, doc in constants:
+        s = textwrap.dedent(doc).replace("\n", "\n    ")
+
+        # Replace sections by rubrics
+        lines = s.split("\n")
+        new_lines = []
+        for line in lines:
+            m = re.match(r'^(\s+)[-=]+\s*$', line)
+            if m and new_lines:
+                prev = textwrap.dedent(new_lines.pop())
+                new_lines.append('%s.. rubric:: %s' % (m.group(1), prev))
+                new_lines.append('')
+            else:
+                new_lines.append(line)
+        s = "\n".join(new_lines)
+
+        # Done.
+        constants_str.append(""".. data:: %s\n    %s""" % (name, s))
+    constants_str = "\n".join(constants_str)
+
+    __doc__ = __doc__ % dict(constant_list=constants_str)
+    del constants_str, name, doc
+    del line, lines, new_lines, m, s, prev
+
+del constants, add_newdoc
diff --git a/venv/Lib/site-packages/numpy/doc/creation.py b/venv/Lib/site-packages/numpy/doc/creation.py
new file mode 100644
index 000000000..067f8bb33
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/creation.py
@@ -0,0 +1,143 @@
+"""
+==============
+Array Creation
+==============
+
+Introduction
+============
+
+There are 5 general mechanisms for creating arrays:
+
+1) Conversion from other Python structures (e.g., lists, tuples)
+2) Intrinsic numpy array creation objects (e.g., arange, ones, zeros,
+   etc.)
+3) Reading arrays from disk, either from standard or custom formats
+4) Creating arrays from raw bytes through the use of strings or buffers
+5) Use of special library functions (e.g., random)
+
+This section will not cover means of replicating, joining, or otherwise
+expanding or mutating existing arrays. Nor will it cover creating object
+arrays or structured arrays. Both of those are covered in their own sections.
+
+Converting Python array_like Objects to NumPy Arrays
+====================================================
+
+In general, numerical data arranged in an array-like structure in Python can
+be converted to arrays through the use of the array() function. The most
+obvious examples are lists and tuples. See the documentation for array() for
+details for its use. Some objects may support the array-protocol and allow
+conversion to arrays this way. A simple way to find out if the object can be
+converted to a numpy array using array() is simply to try it interactively and
+see if it works! (The Python Way).
+
+Examples: ::
+
+ >>> x = np.array([2,3,1,0])
+ >>> x = np.array([2, 3, 1, 0])
+ >>> x = np.array([[1,2.0],[0,0],(1+1j,3.)]) # note mix of tuple and lists,
+     and types
+ >>> x = np.array([[ 1.+0.j, 2.+0.j], [ 0.+0.j, 0.+0.j], [ 1.+1.j, 3.+0.j]])
+
+Intrinsic NumPy Array Creation
+==============================
+
+NumPy has built-in functions for creating arrays from scratch:
+
+zeros(shape) will create an array filled with 0 values with the specified
+shape. The default dtype is float64. ::
+
+ >>> np.zeros((2, 3))
+ array([[ 0., 0., 0.], [ 0., 0., 0.]])
+
+ones(shape) will create an array filled with 1 values. It is identical to
+zeros in all other respects.
+
+arange() will create arrays with regularly incrementing values. Check the
+docstring for complete information on the various ways it can be used. A few
+examples will be given here: ::
+
+ >>> np.arange(10)
+ array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+ >>> np.arange(2, 10, dtype=float)
+ array([ 2., 3., 4., 5., 6., 7., 8., 9.])
+ >>> np.arange(2, 3, 0.1)
+ array([ 2. , 2.1, 2.2, 2.3, 2.4, 2.5, 2.6, 2.7, 2.8, 2.9])
+
+Note that there are some subtleties regarding the last usage that the user
+should be aware of that are described in the arange docstring.
+
+linspace() will create arrays with a specified number of elements, and
+spaced equally between the specified beginning and end values. For
+example: ::
+
+ >>> np.linspace(1., 4., 6)
+ array([ 1. ,  1.6,  2.2,  2.8,  3.4,  4. ])
+
+The advantage of this creation function is that one can guarantee the
+number of elements and the starting and end point, which arange()
+generally will not do for arbitrary start, stop, and step values.
+
+indices() will create a set of arrays (stacked as a one-higher dimensioned
+array), one per dimension with each representing variation in that dimension.
+An example illustrates much better than a verbal description: ::
+
+ >>> np.indices((3,3))
+ array([[[0, 0, 0], [1, 1, 1], [2, 2, 2]], [[0, 1, 2], [0, 1, 2], [0, 1, 2]]])
+
+This is particularly useful for evaluating functions of multiple dimensions on
+a regular grid.
+
+Reading Arrays From Disk
+========================
+
+This is presumably the most common case of large array creation. The details,
+of course, depend greatly on the format of data on disk and so this section
+can only give general pointers on how to handle various formats.
+
+Standard Binary Formats
+-----------------------
+
+Various fields have standard formats for array data. The following lists the
+ones with known python libraries to read them and return numpy arrays (there
+may be others for which it is possible to read and convert to numpy arrays so
+check the last section as well)
+::
+
+ HDF5: h5py
+ FITS: Astropy
+
+Examples of formats that cannot be read directly but for which it is not hard to
+convert are those formats supported by libraries like PIL (able to read and
+write many image formats such as jpg, png, etc).
+
+Common ASCII Formats
+------------------------
+
+Comma Separated Value files (CSV) are widely used (and an export and import
+option for programs like Excel). There are a number of ways of reading these
+files in Python. There are CSV functions in Python and functions in pylab
+(part of matplotlib).
+
+More generic ascii files can be read using the io package in scipy.
+
+Custom Binary Formats
+---------------------
+
+There are a variety of approaches one can use. If the file has a relatively
+simple format then one can write a simple I/O library and use the numpy
+fromfile() function and .tofile() method to read and write numpy arrays
+directly (mind your byteorder though!) If a good C or C++ library exists that
+read the data, one can wrap that library with a variety of techniques though
+that certainly is much more work and requires significantly more advanced
+knowledge to interface with C or C++.
+
+Use of Special Libraries
+------------------------
+
+There are libraries that can be used to generate arrays for special purposes
+and it isn't possible to enumerate all of them. The most common uses are use
+of the many array generation functions in random that can generate arrays of
+random values, and some utility functions to generate special matrices (e.g.
+diagonal).
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/dispatch.py b/venv/Lib/site-packages/numpy/doc/dispatch.py
new file mode 100644
index 000000000..ba76a43ae
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/dispatch.py
@@ -0,0 +1,271 @@
+""".. _dispatch_mechanism:
+
+Numpy's dispatch mechanism, introduced in numpy version v1.16 is the
+recommended approach for writing custom N-dimensional array containers that are
+compatible with the numpy API and provide custom implementations of numpy
+functionality. Applications include `dask <http://dask.pydata.org>`_ arrays, an
+N-dimensional array distributed across multiple nodes, and `cupy
+<https://docs-cupy.chainer.org/en/stable/>`_ arrays, an N-dimensional array on
+a GPU.
+
+To get a feel for writing custom array containers, we'll begin with a simple
+example that has rather narrow utility but illustrates the concepts involved.
+
+>>> import numpy as np
+>>> class DiagonalArray:
+...     def __init__(self, N, value):
+...         self._N = N
+...         self._i = value
+...     def __repr__(self):
+...         return f"{self.__class__.__name__}(N={self._N}, value={self._i})"
+...     def __array__(self):
+...         return self._i * np.eye(self._N)
+...
+
+Our custom array can be instantiated like:
+
+>>> arr = DiagonalArray(5, 1)
+>>> arr
+DiagonalArray(N=5, value=1)
+
+We can convert to a numpy array using :func:`numpy.array` or
+:func:`numpy.asarray`, which will call its ``__array__`` method to obtain a
+standard ``numpy.ndarray``.
+
+>>> np.asarray(arr)
+array([[1., 0., 0., 0., 0.],
+       [0., 1., 0., 0., 0.],
+       [0., 0., 1., 0., 0.],
+       [0., 0., 0., 1., 0.],
+       [0., 0., 0., 0., 1.]])
+
+If we operate on ``arr`` with a numpy function, numpy will again use the
+``__array__`` interface to convert it to an array and then apply the function
+in the usual way.
+
+>>> np.multiply(arr, 2)
+array([[2., 0., 0., 0., 0.],
+       [0., 2., 0., 0., 0.],
+       [0., 0., 2., 0., 0.],
+       [0., 0., 0., 2., 0.],
+       [0., 0., 0., 0., 2.]])
+
+
+Notice that the return type is a standard ``numpy.ndarray``.
+
+>>> type(arr)
+numpy.ndarray
+
+How can we pass our custom array type through this function? Numpy allows a
+class to indicate that it would like to handle computations in a custom-defined
+way through the interfaces ``__array_ufunc__`` and ``__array_function__``. Let's
+take one at a time, starting with ``_array_ufunc__``. This method covers
+:ref:`ufuncs`, a class of functions that includes, for example,
+:func:`numpy.multiply` and :func:`numpy.sin`.
+
+The ``__array_ufunc__`` receives:
+
+- ``ufunc``, a function like ``numpy.multiply``
+- ``method``, a string, differentiating between ``numpy.multiply(...)`` and
+  variants like ``numpy.multiply.outer``, ``numpy.multiply.accumulate``, and so
+  on.  For the common case, ``numpy.multiply(...)``, ``method == '__call__'``.
+- ``inputs``, which could be a mixture of different types
+- ``kwargs``, keyword arguments passed to the function
+
+For this example we will only handle the method ``__call__``.
+
+>>> from numbers import Number
+>>> class DiagonalArray:
+...     def __init__(self, N, value):
+...         self._N = N
+...         self._i = value
+...     def __repr__(self):
+...         return f"{self.__class__.__name__}(N={self._N}, value={self._i})"
+...     def __array__(self):
+...         return self._i * np.eye(self._N)
+...     def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+...         if method == '__call__':
+...             N = None
+...             scalars = []
+...             for input in inputs:
+...                 if isinstance(input, Number):
+...                     scalars.append(input)
+...                 elif isinstance(input, self.__class__):
+...                     scalars.append(input._i)
+...                     if N is not None:
+...                         if N != self._N:
+...                             raise TypeError("inconsistent sizes")
+...                     else:
+...                         N = self._N
+...                 else:
+...                     return NotImplemented
+...             return self.__class__(N, ufunc(*scalars, **kwargs))
+...         else:
+...             return NotImplemented
+...
+
+Now our custom array type passes through numpy functions.
+
+>>> arr = DiagonalArray(5, 1)
+>>> np.multiply(arr, 3)
+DiagonalArray(N=5, value=3)
+>>> np.add(arr, 3)
+DiagonalArray(N=5, value=4)
+>>> np.sin(arr)
+DiagonalArray(N=5, value=0.8414709848078965)
+
+At this point ``arr + 3`` does not work.
+
+>>> arr + 3
+TypeError: unsupported operand type(s) for *: 'DiagonalArray' and 'int'
+
+To support it, we need to define the Python interfaces ``__add__``, ``__lt__``,
+and so on to dispatch to the corresponding ufunc. We can achieve this
+conveniently by inheriting from the mixin
+:class:`~numpy.lib.mixins.NDArrayOperatorsMixin`.
+
+>>> import numpy.lib.mixins
+>>> class DiagonalArray(numpy.lib.mixins.NDArrayOperatorsMixin):
+...     def __init__(self, N, value):
+...         self._N = N
+...         self._i = value
+...     def __repr__(self):
+...         return f"{self.__class__.__name__}(N={self._N}, value={self._i})"
+...     def __array__(self):
+...         return self._i * np.eye(self._N)
+...     def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+...         if method == '__call__':
+...             N = None
+...             scalars = []
+...             for input in inputs:
+...                 if isinstance(input, Number):
+...                     scalars.append(input)
+...                 elif isinstance(input, self.__class__):
+...                     scalars.append(input._i)
+...                     if N is not None:
+...                         if N != self._N:
+...                             raise TypeError("inconsistent sizes")
+...                     else:
+...                         N = self._N
+...                 else:
+...                     return NotImplemented
+...             return self.__class__(N, ufunc(*scalars, **kwargs))
+...         else:
+...             return NotImplemented
+...
+
+>>> arr = DiagonalArray(5, 1)
+>>> arr + 3
+DiagonalArray(N=5, value=4)
+>>> arr > 0
+DiagonalArray(N=5, value=True)
+
+Now let's tackle ``__array_function__``. We'll create dict that maps numpy
+functions to our custom variants.
+
+>>> HANDLED_FUNCTIONS = {}
+>>> class DiagonalArray(numpy.lib.mixins.NDArrayOperatorsMixin):
+...     def __init__(self, N, value):
+...         self._N = N
+...         self._i = value
+...     def __repr__(self):
+...         return f"{self.__class__.__name__}(N={self._N}, value={self._i})"
+...     def __array__(self):
+...         return self._i * np.eye(self._N)
+...     def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+...         if method == '__call__':
+...             N = None
+...             scalars = []
+...             for input in inputs:
+...                 # In this case we accept only scalar numbers or DiagonalArrays.
+...                 if isinstance(input, Number):
+...                     scalars.append(input)
+...                 elif isinstance(input, self.__class__):
+...                     scalars.append(input._i)
+...                     if N is not None:
+...                         if N != self._N:
+...                             raise TypeError("inconsistent sizes")
+...                     else:
+...                         N = self._N
+...                 else:
+...                     return NotImplemented
+...             return self.__class__(N, ufunc(*scalars, **kwargs))
+...         else:
+...             return NotImplemented
+...    def __array_function__(self, func, types, args, kwargs):
+...        if func not in HANDLED_FUNCTIONS:
+...            return NotImplemented
+...        # Note: this allows subclasses that don't override
+...        # __array_function__ to handle DiagonalArray objects.
+...        if not all(issubclass(t, self.__class__) for t in types):
+...            return NotImplemented
+...        return HANDLED_FUNCTIONS[func](*args, **kwargs)
+...
+
+A convenient pattern is to define a decorator ``implements`` that can be used
+to add functions to ``HANDLED_FUNCTIONS``.
+
+>>> def implements(np_function):
+...    "Register an __array_function__ implementation for DiagonalArray objects."
+...    def decorator(func):
+...        HANDLED_FUNCTIONS[np_function] = func
+...        return func
+...    return decorator
+...
+
+Now we write implementations of numpy functions for ``DiagonalArray``.
+For completeness, to support the usage ``arr.sum()`` add a method ``sum`` that
+calls ``numpy.sum(self)``, and the same for ``mean``.
+
+>>> @implements(np.sum)
+... def sum(arr):
+...     "Implementation of np.sum for DiagonalArray objects"
+...     return arr._i * arr._N
+...
+>>> @implements(np.mean)
+... def mean(arr):
+...     "Implementation of np.mean for DiagonalArray objects"
+...     return arr._i / arr._N
+...
+>>> arr = DiagonalArray(5, 1)
+>>> np.sum(arr)
+5
+>>> np.mean(arr)
+0.2
+
+If the user tries to use any numpy functions not included in
+``HANDLED_FUNCTIONS``, a ``TypeError`` will be raised by numpy, indicating that
+this operation is not supported. For example, concatenating two
+``DiagonalArrays`` does not produce another diagonal array, so it is not
+supported.
+
+>>> np.concatenate([arr, arr])
+TypeError: no implementation found for 'numpy.concatenate' on types that implement __array_function__: [<class '__main__.DiagonalArray'>]
+
+Additionally, our implementations of ``sum`` and ``mean`` do not accept the
+optional arguments that numpy's implementation does.
+
+>>> np.sum(arr, axis=0)
+TypeError: sum() got an unexpected keyword argument 'axis'
+
+The user always has the option of converting to a normal ``numpy.ndarray`` with
+:func:`numpy.asarray` and using standard numpy from there.
+
+>>> np.concatenate([np.asarray(arr), np.asarray(arr)])
+array([[1., 0., 0., 0., 0.],
+       [0., 1., 0., 0., 0.],
+       [0., 0., 1., 0., 0.],
+       [0., 0., 0., 1., 0.],
+       [0., 0., 0., 0., 1.],
+       [1., 0., 0., 0., 0.],
+       [0., 1., 0., 0., 0.],
+       [0., 0., 1., 0., 0.],
+       [0., 0., 0., 1., 0.],
+       [0., 0., 0., 0., 1.]])
+
+Refer to the `dask source code <https://github.com/dask/dask>`_ and
+`cupy source code <https://github.com/cupy/cupy>`_  for more fully-worked
+examples of custom array containers.
+
+See also `NEP 18 <http://www.numpy.org/neps/nep-0018-array-function-protocol.html>`_.
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/glossary.py b/venv/Lib/site-packages/numpy/doc/glossary.py
new file mode 100644
index 000000000..16a3b9241
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/glossary.py
@@ -0,0 +1,475 @@
+"""
+========
+Glossary
+========
+
+.. glossary::
+
+   along an axis
+       Axes are defined for arrays with more than one dimension.  A
+       2-dimensional array has two corresponding axes: the first running
+       vertically downwards across rows (axis 0), and the second running
+       horizontally across columns (axis 1).
+
+       Many operations can take place along one of these axes.  For example,
+       we can sum each row of an array, in which case we operate along
+       columns, or axis 1::
+
+         >>> x = np.arange(12).reshape((3,4))
+
+         >>> x
+         array([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+
+         >>> x.sum(axis=1)
+         array([ 6, 22, 38])
+
+   array
+       A homogeneous container of numerical elements.  Each element in the
+       array occupies a fixed amount of memory (hence homogeneous), and
+       can be a numerical element of a single type (such as float, int
+       or complex) or a combination (such as ``(float, int, float)``).  Each
+       array has an associated data-type (or ``dtype``), which describes
+       the numerical type of its elements::
+
+         >>> x = np.array([1, 2, 3], float)
+
+         >>> x
+         array([ 1.,  2.,  3.])
+
+         >>> x.dtype # floating point number, 64 bits of memory per element
+         dtype('float64')
+
+
+         # More complicated data type: each array element is a combination of
+         # and integer and a floating point number
+         >>> np.array([(1, 2.0), (3, 4.0)], dtype=[('x', int), ('y', float)])
+         array([(1, 2.0), (3, 4.0)],
+               dtype=[('x', '<i4'), ('y', '<f8')])
+
+       Fast element-wise operations, called a :term:`ufunc`, operate on arrays.
+
+   array_like
+       Any sequence that can be interpreted as an ndarray.  This includes
+       nested lists, tuples, scalars and existing arrays.
+
+   attribute
+       A property of an object that can be accessed using ``obj.attribute``,
+       e.g., ``shape`` is an attribute of an array::
+
+         >>> x = np.array([1, 2, 3])
+         >>> x.shape
+         (3,)
+
+   big-endian
+       When storing a multi-byte value in memory as a sequence of bytes, the
+       sequence addresses/sends/stores the most significant byte first (lowest
+       address) and the least significant byte last (highest address). Common in
+       micro-processors and used for transmission of data over network protocols.
+
+   BLAS
+       `Basic Linear Algebra Subprograms <https://en.wikipedia.org/wiki/Basic_Linear_Algebra_Subprograms>`_
+
+   broadcast
+       NumPy can do operations on arrays whose shapes are mismatched::
+
+         >>> x = np.array([1, 2])
+         >>> y = np.array([[3], [4]])
+
+         >>> x
+         array([1, 2])
+
+         >>> y
+         array([[3],
+                [4]])
+
+         >>> x + y
+         array([[4, 5],
+                [5, 6]])
+
+       See `numpy.doc.broadcasting` for more information.
+
+   C order
+       See `row-major`
+
+   column-major
+       A way to represent items in a N-dimensional array in the 1-dimensional
+       computer memory. In column-major order, the leftmost index "varies the
+       fastest": for example the array::
+
+            [[1, 2, 3],
+             [4, 5, 6]]
+
+       is represented in the column-major order as::
+
+           [1, 4, 2, 5, 3, 6]
+
+       Column-major order is also known as the Fortran order, as the Fortran
+       programming language uses it.
+
+   decorator
+       An operator that transforms a function.  For example, a ``log``
+       decorator may be defined to print debugging information upon
+       function execution::
+
+         >>> def log(f):
+         ...     def new_logging_func(*args, **kwargs):
+         ...         print("Logging call with parameters:", args, kwargs)
+         ...         return f(*args, **kwargs)
+         ...
+         ...     return new_logging_func
+
+       Now, when we define a function, we can "decorate" it using ``log``::
+
+         >>> @log
+         ... def add(a, b):
+         ...     return a + b
+
+       Calling ``add`` then yields:
+
+       >>> add(1, 2)
+       Logging call with parameters: (1, 2) {}
+       3
+
+   dictionary
+       Resembling a language dictionary, which provides a mapping between
+       words and descriptions thereof, a Python dictionary is a mapping
+       between two objects::
+
+         >>> x = {1: 'one', 'two': [1, 2]}
+
+       Here, `x` is a dictionary mapping keys to values, in this case
+       the integer 1 to the string "one", and the string "two" to
+       the list ``[1, 2]``.  The values may be accessed using their
+       corresponding keys::
+
+         >>> x[1]
+         'one'
+
+         >>> x['two']
+         [1, 2]
+
+       Note that dictionaries are not stored in any specific order.  Also,
+       most mutable (see *immutable* below) objects, such as lists, may not
+       be used as keys.
+
+       For more information on dictionaries, read the
+       `Python tutorial <https://docs.python.org/tutorial/>`_.
+
+   field
+       In a :term:`structured data type`, each sub-type is called a `field`.
+       The `field` has a name (a string), a type (any valid dtype), and
+       an optional `title`. See :ref:`arrays.dtypes`
+
+   Fortran order
+       See `column-major`
+
+   flattened
+       Collapsed to a one-dimensional array. See `numpy.ndarray.flatten`
+       for details.
+
+   homogenous
+       Describes a block of memory comprised of blocks, each block comprised of 
+       items and of the same size, and blocks are interpreted in exactly the
+       same way. In the simplest case each block contains a single item, for
+       instance int32 or float64.
+
+   immutable
+       An object that cannot be modified after execution is called
+       immutable.  Two common examples are strings and tuples.
+
+   instance
+       A class definition gives the blueprint for constructing an object::
+
+         >>> class House:
+         ...     wall_colour = 'white'
+
+       Yet, we have to *build* a house before it exists::
+
+         >>> h = House() # build a house
+
+       Now, ``h`` is called a ``House`` instance.  An instance is therefore
+       a specific realisation of a class.
+
+   iterable
+       A sequence that allows "walking" (iterating) over items, typically
+       using a loop such as::
+
+         >>> x = [1, 2, 3]
+         >>> [item**2 for item in x]
+         [1, 4, 9]
+
+       It is often used in combination with ``enumerate``::
+         >>> keys = ['a','b','c']
+         >>> for n, k in enumerate(keys):
+         ...     print("Key %d: %s" % (n, k))
+         ...
+         Key 0: a
+         Key 1: b
+         Key 2: c
+
+   itemsize
+       The size of the dtype element in bytes.
+
+   list
+       A Python container that can hold any number of objects or items.
+       The items do not have to be of the same type, and can even be
+       lists themselves::
+
+         >>> x = [2, 2.0, "two", [2, 2.0]]
+
+       The list `x` contains 4 items, each which can be accessed individually::
+
+         >>> x[2] # the string 'two'
+         'two'
+
+         >>> x[3] # a list, containing an integer 2 and a float 2.0
+         [2, 2.0]
+
+       It is also possible to select more than one item at a time,
+       using *slicing*::
+
+         >>> x[0:2] # or, equivalently, x[:2]
+         [2, 2.0]
+
+       In code, arrays are often conveniently expressed as nested lists::
+
+
+         >>> np.array([[1, 2], [3, 4]])
+         array([[1, 2],
+                [3, 4]])
+
+       For more information, read the section on lists in the `Python
+       tutorial <https://docs.python.org/tutorial/>`_.  For a mapping
+       type (key-value), see *dictionary*.
+
+   little-endian
+       When storing a multi-byte value in memory as a sequence of bytes, the
+       sequence addresses/sends/stores the least significant byte first (lowest
+       address) and the most significant byte last (highest address). Common in
+       x86 processors.
+
+   mask
+       A boolean array, used to select only certain elements for an operation::
+
+         >>> x = np.arange(5)
+         >>> x
+         array([0, 1, 2, 3, 4])
+
+         >>> mask = (x > 2)
+         >>> mask
+         array([False, False, False, True,  True])
+
+         >>> x[mask] = -1
+         >>> x
+         array([ 0,  1,  2,  -1, -1])
+
+   masked array
+       Array that suppressed values indicated by a mask::
+
+         >>> x = np.ma.masked_array([np.nan, 2, np.nan], [True, False, True])
+         >>> x
+         masked_array(data = [-- 2.0 --],
+                      mask = [ True False  True],
+                fill_value = 1e+20)
+
+         >>> x + [1, 2, 3]
+         masked_array(data = [-- 4.0 --],
+                      mask = [ True False  True],
+                fill_value = 1e+20)
+
+
+       Masked arrays are often used when operating on arrays containing
+       missing or invalid entries.
+
+   matrix
+       A 2-dimensional ndarray that preserves its two-dimensional nature
+       throughout operations.  It has certain special operations, such as ``*``
+       (matrix multiplication) and ``**`` (matrix power), defined::
+
+         >>> x = np.mat([[1, 2], [3, 4]])
+         >>> x
+         matrix([[1, 2],
+                 [3, 4]])
+
+         >>> x**2
+         matrix([[ 7, 10],
+               [15, 22]])
+
+   method
+       A function associated with an object.  For example, each ndarray has a
+       method called ``repeat``::
+
+         >>> x = np.array([1, 2, 3])
+         >>> x.repeat(2)
+         array([1, 1, 2, 2, 3, 3])
+
+   ndarray
+       See *array*.
+
+   record array
+       An :term:`ndarray` with :term:`structured data type` which has been
+       subclassed as ``np.recarray`` and whose dtype is of type ``np.record``,
+       making the fields of its data type to be accessible by attribute.
+
+   reference
+       If ``a`` is a reference to ``b``, then ``(a is b) == True``.  Therefore,
+       ``a`` and ``b`` are different names for the same Python object.
+
+   row-major
+       A way to represent items in a N-dimensional array in the 1-dimensional
+       computer memory. In row-major order, the rightmost index "varies
+       the fastest": for example the array::
+
+            [[1, 2, 3],
+             [4, 5, 6]]
+
+       is represented in the row-major order as::
+
+           [1, 2, 3, 4, 5, 6]
+
+       Row-major order is also known as the C order, as the C programming
+       language uses it. New NumPy arrays are by default in row-major order.
+
+   self
+       Often seen in method signatures, ``self`` refers to the instance
+       of the associated class.  For example:
+
+         >>> class Paintbrush:
+         ...     color = 'blue'
+         ...
+         ...     def paint(self):
+         ...         print("Painting the city %s!" % self.color)
+         ...
+         >>> p = Paintbrush()
+         >>> p.color = 'red'
+         >>> p.paint() # self refers to 'p'
+         Painting the city red!
+
+   slice
+       Used to select only certain elements from a sequence:
+
+       >>> x = range(5)
+       >>> x
+       [0, 1, 2, 3, 4]
+
+       >>> x[1:3] # slice from 1 to 3 (excluding 3 itself)
+       [1, 2]
+
+       >>> x[1:5:2] # slice from 1 to 5, but skipping every second element
+       [1, 3]
+
+       >>> x[::-1] # slice a sequence in reverse
+       [4, 3, 2, 1, 0]
+
+       Arrays may have more than one dimension, each which can be sliced
+       individually:
+
+       >>> x = np.array([[1, 2], [3, 4]])
+       >>> x
+       array([[1, 2],
+              [3, 4]])
+
+       >>> x[:, 1]
+       array([2, 4])
+
+   structure
+       See :term:`structured data type`
+
+   structured data type
+       A data type composed of other datatypes
+
+   subarray data type
+       A :term:`structured data type` may contain a :term:`ndarray` with its
+       own dtype and shape:
+
+       >>> dt = np.dtype([('a', np.int32), ('b', np.float32, (3,))])
+       >>> np.zeros(3, dtype=dt)
+       array([(0, [0., 0., 0.]), (0, [0., 0., 0.]), (0, [0., 0., 0.])],
+             dtype=[('a', '<i4'), ('b', '<f4', (3,))])
+
+   title
+       In addition to field names, structured array fields may have an
+       associated :ref:`title <titles>` which is an alias to the name and is
+       commonly used for plotting.
+
+   tuple
+       A sequence that may contain a variable number of types of any
+       kind.  A tuple is immutable, i.e., once constructed it cannot be
+       changed.  Similar to a list, it can be indexed and sliced::
+
+         >>> x = (1, 'one', [1, 2])
+         >>> x
+         (1, 'one', [1, 2])
+
+         >>> x[0]
+         1
+
+         >>> x[:2]
+         (1, 'one')
+
+       A useful concept is "tuple unpacking", which allows variables to
+       be assigned to the contents of a tuple::
+
+         >>> x, y = (1, 2)
+         >>> x, y = 1, 2
+
+       This is often used when a function returns multiple values:
+
+         >>> def return_many():
+         ...     return 1, 'alpha', None
+
+         >>> a, b, c = return_many()
+         >>> a, b, c
+         (1, 'alpha', None)
+
+         >>> a
+         1
+         >>> b
+         'alpha'
+
+   ufunc
+       Universal function.  A fast element-wise, :term:`vectorized
+       <vectorization>` array operation.  Examples include ``add``, ``sin`` and
+       ``logical_or``.
+
+   vectorization
+       Optimizing a looping block by specialized code. In a traditional sense,
+       vectorization performs the same operation on multiple elements with
+       fixed strides between them via specialized hardware. Compilers know how
+       to take advantage of well-constructed loops to implement such
+       optimizations. NumPy uses :ref:`vectorization <whatis-vectorization>`
+       to mean any optimization via specialized code performing the same
+       operations on multiple elements, typically achieving speedups by
+       avoiding some of the overhead in looking up and converting the elements.
+
+   view
+       An array that does not own its data, but refers to another array's
+       data instead.  For example, we may create a view that only shows
+       every second element of another array::
+
+         >>> x = np.arange(5)
+         >>> x
+         array([0, 1, 2, 3, 4])
+
+         >>> y = x[::2]
+         >>> y
+         array([0, 2, 4])
+
+         >>> x[0] = 3 # changing x changes y as well, since y is a view on x
+         >>> y
+         array([3, 2, 4])
+
+   wrapper
+       Python is a high-level (highly abstracted, or English-like) language.
+       This abstraction comes at a price in execution speed, and sometimes
+       it becomes necessary to use lower level languages to do fast
+       computations.  A wrapper is code that provides a bridge between
+       high and the low level languages, allowing, e.g., Python to execute
+       code written in C or Fortran.
+
+       Examples include ctypes, SWIG and Cython (which wraps C and C++)
+       and f2py (which wraps Fortran).
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/indexing.py b/venv/Lib/site-packages/numpy/doc/indexing.py
new file mode 100644
index 000000000..c7dda2790
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/indexing.py
@@ -0,0 +1,456 @@
+"""
+==============
+Array indexing
+==============
+
+Array indexing refers to any use of the square brackets ([]) to index
+array values. There are many options to indexing, which give numpy
+indexing great power, but with power comes some complexity and the
+potential for confusion. This section is just an overview of the
+various options and issues related to indexing. Aside from single
+element indexing, the details on most of these options are to be
+found in related sections.
+
+Assignment vs referencing
+=========================
+
+Most of the following examples show the use of indexing when
+referencing data in an array. The examples work just as well
+when assigning to an array. See the section at the end for
+specific examples and explanations on how assignments work.
+
+Single element indexing
+=======================
+
+Single element indexing for a 1-D array is what one expects. It work
+exactly like that for other standard Python sequences. It is 0-based,
+and accepts negative indices for indexing from the end of the array. ::
+
+    >>> x = np.arange(10)
+    >>> x[2]
+    2
+    >>> x[-2]
+    8
+
+Unlike lists and tuples, numpy arrays support multidimensional indexing
+for multidimensional arrays. That means that it is not necessary to
+separate each dimension's index into its own set of square brackets. ::
+
+    >>> x.shape = (2,5) # now x is 2-dimensional
+    >>> x[1,3]
+    8
+    >>> x[1,-1]
+    9
+
+Note that if one indexes a multidimensional array with fewer indices
+than dimensions, one gets a subdimensional array. For example: ::
+
+    >>> x[0]
+    array([0, 1, 2, 3, 4])
+
+That is, each index specified selects the array corresponding to the
+rest of the dimensions selected. In the above example, choosing 0
+means that the remaining dimension of length 5 is being left unspecified,
+and that what is returned is an array of that dimensionality and size.
+It must be noted that the returned array is not a copy of the original,
+but points to the same values in memory as does the original array.
+In  this case, the 1-D array at the first position (0) is returned.
+So using a single index on the returned array, results in a single
+element being returned. That is: ::
+
+    >>> x[0][2]
+    2
+
+So note that ``x[0,2] = x[0][2]`` though the second case is more
+inefficient as a new temporary array is created after the first index
+that is subsequently indexed by 2.
+
+Note to those used to IDL or Fortran memory order as it relates to
+indexing.  NumPy uses C-order indexing. That means that the last
+index usually represents the most rapidly changing memory location,
+unlike Fortran or IDL, where the first index represents the most
+rapidly changing location in memory. This difference represents a
+great potential for confusion.
+
+Other indexing options
+======================
+
+It is possible to slice and stride arrays to extract arrays of the
+same number of dimensions, but of different sizes than the original.
+The slicing and striding works exactly the same way it does for lists
+and tuples except that they can be applied to multiple dimensions as
+well. A few examples illustrates best: ::
+
+ >>> x = np.arange(10)
+ >>> x[2:5]
+ array([2, 3, 4])
+ >>> x[:-7]
+ array([0, 1, 2])
+ >>> x[1:7:2]
+ array([1, 3, 5])
+ >>> y = np.arange(35).reshape(5,7)
+ >>> y[1:5:2,::3]
+ array([[ 7, 10, 13],
+        [21, 24, 27]])
+
+Note that slices of arrays do not copy the internal array data but
+only produce new views of the original data. This is different from
+list or tuple slicing and an explicit ``copy()`` is recommended if
+the original data is not required anymore.
+
+It is possible to index arrays with other arrays for the purposes of
+selecting lists of values out of arrays into new arrays. There are
+two different ways of accomplishing this. One uses one or more arrays
+of index values. The other involves giving a boolean array of the proper
+shape to indicate the values to be selected. Index arrays are a very
+powerful tool that allow one to avoid looping over individual elements in
+arrays and thus greatly improve performance.
+
+It is possible to use special features to effectively increase the
+number of dimensions in an array through indexing so the resulting
+array acquires the shape needed for use in an expression or with a
+specific function.
+
+Index arrays
+============
+
+NumPy arrays may be indexed with other arrays (or any other sequence-
+like object that can be converted to an array, such as lists, with the
+exception of tuples; see the end of this document for why this is). The
+use of index arrays ranges from simple, straightforward cases to
+complex, hard-to-understand cases. For all cases of index arrays, what
+is returned is a copy of the original data, not a view as one gets for
+slices.
+
+Index arrays must be of integer type. Each value in the array indicates
+which value in the array to use in place of the index. To illustrate: ::
+
+ >>> x = np.arange(10,1,-1)
+ >>> x
+ array([10,  9,  8,  7,  6,  5,  4,  3,  2])
+ >>> x[np.array([3, 3, 1, 8])]
+ array([7, 7, 9, 2])
+
+
+The index array consisting of the values 3, 3, 1 and 8 correspondingly
+create an array of length 4 (same as the index array) where each index
+is replaced by the value the index array has in the array being indexed.
+
+Negative values are permitted and work as they do with single indices
+or slices: ::
+
+ >>> x[np.array([3,3,-3,8])]
+ array([7, 7, 4, 2])
+
+It is an error to have index values out of bounds: ::
+
+ >>> x[np.array([3, 3, 20, 8])]
+ <type 'exceptions.IndexError'>: index 20 out of bounds 0<=index<9
+
+Generally speaking, what is returned when index arrays are used is
+an array with the same shape as the index array, but with the type
+and values of the array being indexed. As an example, we can use a
+multidimensional index array instead: ::
+
+ >>> x[np.array([[1,1],[2,3]])]
+ array([[9, 9],
+        [8, 7]])
+
+Indexing Multi-dimensional arrays
+=================================
+
+Things become more complex when multidimensional arrays are indexed,
+particularly with multidimensional index arrays. These tend to be
+more unusual uses, but they are permitted, and they are useful for some
+problems. We'll  start with the simplest multidimensional case (using
+the array y from the previous examples): ::
+
+ >>> y[np.array([0,2,4]), np.array([0,1,2])]
+ array([ 0, 15, 30])
+
+In this case, if the index arrays have a matching shape, and there is
+an index array for each dimension of the array being indexed, the
+resultant array has the same shape as the index arrays, and the values
+correspond to the index set for each position in the index arrays. In
+this example, the first index value is 0 for both index arrays, and
+thus the first value of the resultant array is y[0,0]. The next value
+is y[2,1], and the last is y[4,2].
+
+If the index arrays do not have the same shape, there is an attempt to
+broadcast them to the same shape.  If they cannot be broadcast to the
+same shape, an exception is raised: ::
+
+ >>> y[np.array([0,2,4]), np.array([0,1])]
+ <type 'exceptions.ValueError'>: shape mismatch: objects cannot be
+ broadcast to a single shape
+
+The broadcasting mechanism permits index arrays to be combined with
+scalars for other indices. The effect is that the scalar value is used
+for all the corresponding values of the index arrays: ::
+
+ >>> y[np.array([0,2,4]), 1]
+ array([ 1, 15, 29])
+
+Jumping to the next level of complexity, it is possible to only
+partially index an array with index arrays. It takes a bit of thought
+to understand what happens in such cases. For example if we just use
+one index array with y: ::
+
+ >>> y[np.array([0,2,4])]
+ array([[ 0,  1,  2,  3,  4,  5,  6],
+        [14, 15, 16, 17, 18, 19, 20],
+        [28, 29, 30, 31, 32, 33, 34]])
+
+What results is the construction of a new array where each value of
+the index array selects one row from the array being indexed and the
+resultant array has the resulting shape (number of index elements,
+size of row).
+
+An example of where this may be useful is for a color lookup table
+where we want to map the values of an image into RGB triples for
+display. The lookup table could have a shape (nlookup, 3). Indexing
+such an array with an image with shape (ny, nx) with dtype=np.uint8
+(or any integer type so long as values are with the bounds of the
+lookup table) will result in an array of shape (ny, nx, 3) where a
+triple of RGB values is associated with each pixel location.
+
+In general, the shape of the resultant array will be the concatenation
+of the shape of the index array (or the shape that all the index arrays
+were broadcast to) with the shape of any unused dimensions (those not
+indexed) in the array being indexed.
+
+Boolean or "mask" index arrays
+==============================
+
+Boolean arrays used as indices are treated in a different manner
+entirely than index arrays. Boolean arrays must be of the same shape
+as the initial dimensions of the array being indexed. In the
+most straightforward case, the boolean array has the same shape: ::
+
+ >>> b = y>20
+ >>> y[b]
+ array([21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34])
+
+Unlike in the case of integer index arrays, in the boolean case, the
+result is a 1-D array containing all the elements in the indexed array
+corresponding to all the true elements in the boolean array. The
+elements in the indexed array are always iterated and returned in
+:term:`row-major` (C-style) order. The result is also identical to
+``y[np.nonzero(b)]``. As with index arrays, what is returned is a copy
+of the data, not a view as one gets with slices.
+
+The result will be multidimensional if y has more dimensions than b.
+For example: ::
+
+ >>> b[:,5] # use a 1-D boolean whose first dim agrees with the first dim of y
+ array([False, False, False,  True,  True])
+ >>> y[b[:,5]]
+ array([[21, 22, 23, 24, 25, 26, 27],
+        [28, 29, 30, 31, 32, 33, 34]])
+
+Here the 4th and 5th rows are selected from the indexed array and
+combined to make a 2-D array.
+
+In general, when the boolean array has fewer dimensions than the array
+being indexed, this is equivalent to y[b, ...], which means
+y is indexed by b followed by as many : as are needed to fill
+out the rank of y.
+Thus the shape of the result is one dimension containing the number
+of True elements of the boolean array, followed by the remaining
+dimensions of the array being indexed.
+
+For example, using a 2-D boolean array of shape (2,3)
+with four True elements to select rows from a 3-D array of shape
+(2,3,5) results in a 2-D result of shape (4,5): ::
+
+ >>> x = np.arange(30).reshape(2,3,5)
+ >>> x
+ array([[[ 0,  1,  2,  3,  4],
+         [ 5,  6,  7,  8,  9],
+         [10, 11, 12, 13, 14]],
+        [[15, 16, 17, 18, 19],
+         [20, 21, 22, 23, 24],
+         [25, 26, 27, 28, 29]]])
+ >>> b = np.array([[True, True, False], [False, True, True]])
+ >>> x[b]
+ array([[ 0,  1,  2,  3,  4],
+        [ 5,  6,  7,  8,  9],
+        [20, 21, 22, 23, 24],
+        [25, 26, 27, 28, 29]])
+
+For further details, consult the numpy reference documentation on array indexing.
+
+Combining index arrays with slices
+==================================
+
+Index arrays may be combined with slices. For example: ::
+
+ >>> y[np.array([0, 2, 4]), 1:3]
+ array([[ 1,  2],
+        [15, 16],
+        [29, 30]])
+
+In effect, the slice and index array operation are independent.
+The slice operation extracts columns with index 1 and 2,
+(i.e. the 2nd and 3rd columns),
+followed by the index array operation which extracts rows with 
+index 0, 2 and 4 (i.e the first, third and fifth rows).
+
+This is equivalent to::
+
+ >>> y[:, 1:3][np.array([0, 2, 4]), :]
+ array([[ 1,  2],
+        [15, 16],
+        [29, 30]])
+
+Likewise, slicing can be combined with broadcasted boolean indices: ::
+
+ >>> b = y > 20
+ >>> b
+ array([[False, False, False, False, False, False, False],
+       [False, False, False, False, False, False, False],
+       [False, False, False, False, False, False, False],
+       [ True,  True,  True,  True,  True,  True,  True],
+       [ True,  True,  True,  True,  True,  True,  True]])
+ >>> y[b[:,5],1:3]
+ array([[22, 23],
+        [29, 30]])
+
+Structural indexing tools
+=========================
+
+To facilitate easy matching of array shapes with expressions and in
+assignments, the np.newaxis object can be used within array indices
+to add new dimensions with a size of 1. For example: ::
+
+ >>> y.shape
+ (5, 7)
+ >>> y[:,np.newaxis,:].shape
+ (5, 1, 7)
+
+Note that there are no new elements in the array, just that the
+dimensionality is increased. This can be handy to combine two
+arrays in a way that otherwise would require explicitly reshaping
+operations. For example: ::
+
+ >>> x = np.arange(5)
+ >>> x[:,np.newaxis] + x[np.newaxis,:]
+ array([[0, 1, 2, 3, 4],
+        [1, 2, 3, 4, 5],
+        [2, 3, 4, 5, 6],
+        [3, 4, 5, 6, 7],
+        [4, 5, 6, 7, 8]])
+
+The ellipsis syntax maybe used to indicate selecting in full any
+remaining unspecified dimensions. For example: ::
+
+ >>> z = np.arange(81).reshape(3,3,3,3)
+ >>> z[1,...,2]
+ array([[29, 32, 35],
+        [38, 41, 44],
+        [47, 50, 53]])
+
+This is equivalent to: ::
+
+ >>> z[1,:,:,2]
+ array([[29, 32, 35],
+        [38, 41, 44],
+        [47, 50, 53]])
+
+Assigning values to indexed arrays
+==================================
+
+As mentioned, one can select a subset of an array to assign to using
+a single index, slices, and index and mask arrays. The value being
+assigned to the indexed array must be shape consistent (the same shape
+or broadcastable to the shape the index produces). For example, it is
+permitted to assign a constant to a slice: ::
+
+ >>> x = np.arange(10)
+ >>> x[2:7] = 1
+
+or an array of the right size: ::
+
+ >>> x[2:7] = np.arange(5)
+
+Note that assignments may result in changes if assigning
+higher types to lower types (like floats to ints) or even
+exceptions (assigning complex to floats or ints): ::
+
+ >>> x[1] = 1.2
+ >>> x[1]
+ 1
+ >>> x[1] = 1.2j
+ TypeError: can't convert complex to int
+
+
+Unlike some of the references (such as array and mask indices)
+assignments are always made to the original data in the array
+(indeed, nothing else would make sense!). Note though, that some
+actions may not work as one may naively expect. This particular
+example is often surprising to people: ::
+
+ >>> x = np.arange(0, 50, 10)
+ >>> x
+ array([ 0, 10, 20, 30, 40])
+ >>> x[np.array([1, 1, 3, 1])] += 1
+ >>> x
+ array([ 0, 11, 20, 31, 40])
+
+Where people expect that the 1st location will be incremented by 3.
+In fact, it will only be incremented by 1. The reason is because
+a new array is extracted from the original (as a temporary) containing
+the values at 1, 1, 3, 1, then the value 1 is added to the temporary,
+and then the temporary is assigned back to the original array. Thus
+the value of the array at x[1]+1 is assigned to x[1] three times,
+rather than being incremented 3 times.
+
+Dealing with variable numbers of indices within programs
+========================================================
+
+The index syntax is very powerful but limiting when dealing with
+a variable number of indices. For example, if you want to write
+a function that can handle arguments with various numbers of
+dimensions without having to write special case code for each
+number of possible dimensions, how can that be done? If one
+supplies to the index a tuple, the tuple will be interpreted
+as a list of indices. For example (using the previous definition
+for the array z): ::
+
+ >>> indices = (1,1,1,1)
+ >>> z[indices]
+ 40
+
+So one can use code to construct tuples of any number of indices
+and then use these within an index.
+
+Slices can be specified within programs by using the slice() function
+in Python. For example: ::
+
+ >>> indices = (1,1,1,slice(0,2)) # same as [1,1,1,0:2]
+ >>> z[indices]
+ array([39, 40])
+
+Likewise, ellipsis can be specified by code by using the Ellipsis
+object: ::
+
+ >>> indices = (1, Ellipsis, 1) # same as [1,...,1]
+ >>> z[indices]
+ array([[28, 31, 34],
+        [37, 40, 43],
+        [46, 49, 52]])
+
+For this reason it is possible to use the output from the np.nonzero()
+function directly as an index since it always returns a tuple of index
+arrays.
+
+Because the special treatment of tuples, they are not automatically
+converted to an array as a list would be. As an example: ::
+
+ >>> z[[1,1,1,1]] # produces a large array
+ array([[[[27, 28, 29],
+          [30, 31, 32], ...
+ >>> z[(1,1,1,1)] # returns a single value
+ 40
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/internals.py b/venv/Lib/site-packages/numpy/doc/internals.py
new file mode 100644
index 000000000..6718f1108
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/internals.py
@@ -0,0 +1,162 @@
+"""
+===============
+Array Internals
+===============
+
+Internal organization of numpy arrays
+=====================================
+
+It helps to understand a bit about how numpy arrays are handled under the covers to help understand numpy better. This section will not go into great detail. Those wishing to understand the full details are referred to Travis Oliphant's book "Guide to NumPy".
+
+NumPy arrays consist of two major components, the raw array data (from now on,
+referred to as the data buffer), and the information about the raw array data.
+The data buffer is typically what people think of as arrays in C or Fortran,
+a contiguous (and fixed) block of memory containing fixed sized data items.
+NumPy also contains a significant set of data that describes how to interpret
+the data in the data buffer. This extra information contains (among other things):
+
+ 1) The basic data element's size in bytes
+ 2) The start of the data within the data buffer (an offset relative to the
+    beginning of the data buffer).
+ 3) The number of dimensions and the size of each dimension
+ 4) The separation between elements for each dimension (the 'stride'). This
+    does not have to be a multiple of the element size
+ 5) The byte order of the data (which may not be the native byte order)
+ 6) Whether the buffer is read-only
+ 7) Information (via the dtype object) about the interpretation of the basic
+    data element. The basic data element may be as simple as a int or a float,
+    or it may be a compound object (e.g., struct-like), a fixed character field,
+    or Python object pointers.
+ 8) Whether the array is to interpreted as C-order or Fortran-order.
+
+This arrangement allow for very flexible use of arrays. One thing that it allows
+is simple changes of the metadata to change the interpretation of the array buffer.
+Changing the byteorder of the array is a simple change involving no rearrangement
+of the data. The shape of the array can be changed very easily without changing
+anything in the data buffer or any data copying at all
+
+Among other things that are made possible is one can create a new array metadata
+object that uses the same data buffer
+to create a new view of that data buffer that has a different interpretation
+of the buffer (e.g., different shape, offset, byte order, strides, etc) but
+shares the same data bytes. Many operations in numpy do just this such as
+slices. Other operations, such as transpose, don't move data elements
+around in the array, but rather change the information about the shape and strides so that the indexing of the array changes, but the data in the doesn't move.
+
+Typically these new versions of the array metadata but the same data buffer are
+new 'views' into the data buffer. There is a different ndarray object, but it
+uses the same data buffer. This is why it is necessary to force copies through
+use of the .copy() method if one really wants to make a new and independent
+copy of the data buffer.
+
+New views into arrays mean the object reference counts for the data buffer
+increase. Simply doing away with the original array object will not remove the
+data buffer if other views of it still exist.
+
+Multidimensional Array Indexing Order Issues
+============================================
+
+What is the right way to index
+multi-dimensional arrays? Before you jump to conclusions about the one and
+true way to index multi-dimensional arrays, it pays to understand why this is
+a confusing issue. This section will try to explain in detail how numpy
+indexing works and why we adopt the convention we do for images, and when it
+may be appropriate to adopt other conventions.
+
+The first thing to understand is
+that there are two conflicting conventions for indexing 2-dimensional arrays.
+Matrix notation uses the first index to indicate which row is being selected and
+the second index to indicate which column is selected. This is opposite the
+geometrically oriented-convention for images where people generally think the
+first index represents x position (i.e., column) and the second represents y
+position (i.e., row). This alone is the source of much confusion;
+matrix-oriented users and image-oriented users expect two different things with
+regard to indexing.
+
+The second issue to understand is how indices correspond
+to the order the array is stored in memory. In Fortran the first index is the
+most rapidly varying index when moving through the elements of a two
+dimensional array as it is stored in memory. If you adopt the matrix
+convention for indexing, then this means the matrix is stored one column at a
+time (since the first index moves to the next row as it changes). Thus Fortran
+is considered a Column-major language. C has just the opposite convention. In
+C, the last index changes most rapidly as one moves through the array as
+stored in memory. Thus C is a Row-major language. The matrix is stored by
+rows. Note that in both cases it presumes that the matrix convention for
+indexing is being used, i.e., for both Fortran and C, the first index is the
+row. Note this convention implies that the indexing convention is invariant
+and that the data order changes to keep that so.
+
+But that's not the only way
+to look at it. Suppose one has large two-dimensional arrays (images or
+matrices) stored in data files. Suppose the data are stored by rows rather than
+by columns. If we are to preserve our index convention (whether matrix or
+image) that means that depending on the language we use, we may be forced to
+reorder the data if it is read into memory to preserve our indexing
+convention. For example if we read row-ordered data into memory without
+reordering, it will match the matrix indexing convention for C, but not for
+Fortran. Conversely, it will match the image indexing convention for Fortran,
+but not for C. For C, if one is using data stored in row order, and one wants
+to preserve the image index convention, the data must be reordered when
+reading into memory.
+
+In the end, which you do for Fortran or C depends on
+which is more important, not reordering data or preserving the indexing
+convention. For large images, reordering data is potentially expensive, and
+often the indexing convention is inverted to avoid that.
+
+The situation with
+numpy makes this issue yet more complicated. The internal machinery of numpy
+arrays is flexible enough to accept any ordering of indices. One can simply
+reorder indices by manipulating the internal stride information for arrays
+without reordering the data at all. NumPy will know how to map the new index
+order to the data without moving the data.
+
+So if this is true, why not choose
+the index order that matches what you most expect? In particular, why not define
+row-ordered images to use the image convention? (This is sometimes referred
+to as the Fortran convention vs the C convention, thus the 'C' and 'FORTRAN'
+order options for array ordering in numpy.) The drawback of doing this is
+potential performance penalties. It's common to access the data sequentially,
+either implicitly in array operations or explicitly by looping over rows of an
+image. When that is done, then the data will be accessed in non-optimal order.
+As the first index is incremented, what is actually happening is that elements
+spaced far apart in memory are being sequentially accessed, with usually poor
+memory access speeds. For example, for a two dimensional image 'im' defined so
+that im[0, 10] represents the value at x=0, y=10. To be consistent with usual
+Python behavior then im[0] would represent a column at x=0. Yet that data
+would be spread over the whole array since the data are stored in row order.
+Despite the flexibility of numpy's indexing, it can't really paper over the fact
+basic operations are rendered inefficient because of data order or that getting
+contiguous subarrays is still awkward (e.g., im[:,0] for the first row, vs
+im[0]), thus one can't use an idiom such as for row in im; for col in im does
+work, but doesn't yield contiguous column data.
+
+As it turns out, numpy is
+smart enough when dealing with ufuncs to determine which index is the most
+rapidly varying one in memory and uses that for the innermost loop. Thus for
+ufuncs there is no large intrinsic advantage to either approach in most cases.
+On the other hand, use of .flat with an FORTRAN ordered array will lead to
+non-optimal memory access as adjacent elements in the flattened array (iterator,
+actually) are not contiguous in memory.
+
+Indeed, the fact is that Python
+indexing on lists and other sequences naturally leads to an outside-to inside
+ordering (the first index gets the largest grouping, the next the next largest,
+and the last gets the smallest element). Since image data are normally stored
+by rows, this corresponds to position within rows being the last item indexed.
+
+If you do want to use Fortran ordering realize that
+there are two approaches to consider: 1) accept that the first index is just not
+the most rapidly changing in memory and have all your I/O routines reorder
+your data when going from memory to disk or visa versa, or use numpy's
+mechanism for mapping the first index to the most rapidly varying data. We
+recommend the former if possible. The disadvantage of the latter is that many
+of numpy's functions will yield arrays without Fortran ordering unless you are
+careful to use the 'order' keyword. Doing this would be highly inconvenient.
+
+Otherwise we recommend simply learning to reverse the usual order of indices
+when accessing elements of an array. Granted, it goes against the grain, but
+it is more in line with Python semantics and the natural order of the data.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/misc.py b/venv/Lib/site-packages/numpy/doc/misc.py
new file mode 100644
index 000000000..fc1c4cd01
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/misc.py
@@ -0,0 +1,226 @@
+"""
+=============
+Miscellaneous
+=============
+
+IEEE 754 Floating Point Special Values
+--------------------------------------
+
+Special values defined in numpy: nan, inf,
+
+NaNs can be used as a poor-man's mask (if you don't care what the
+original value was)
+
+Note: cannot use equality to test NaNs. E.g.: ::
+
+ >>> myarr = np.array([1., 0., np.nan, 3.])
+ >>> np.nonzero(myarr == np.nan)
+ (array([], dtype=int64),)
+ >>> np.nan == np.nan  # is always False! Use special numpy functions instead.
+ False
+ >>> myarr[myarr == np.nan] = 0. # doesn't work
+ >>> myarr
+ array([  1.,   0.,  NaN,   3.])
+ >>> myarr[np.isnan(myarr)] = 0. # use this instead find
+ >>> myarr
+ array([ 1.,  0.,  0.,  3.])
+
+Other related special value functions: ::
+
+ isinf():    True if value is inf
+ isfinite(): True if not nan or inf
+ nan_to_num(): Map nan to 0, inf to max float, -inf to min float
+
+The following corresponds to the usual functions except that nans are excluded
+from the results: ::
+
+ nansum()
+ nanmax()
+ nanmin()
+ nanargmax()
+ nanargmin()
+
+ >>> x = np.arange(10.)
+ >>> x[3] = np.nan
+ >>> x.sum()
+ nan
+ >>> np.nansum(x)
+ 42.0
+
+How numpy handles numerical exceptions
+--------------------------------------
+
+The default is to ``'warn'`` for ``invalid``, ``divide``, and ``overflow``
+and ``'ignore'`` for ``underflow``.  But this can be changed, and it can be
+set individually for different kinds of exceptions. The different behaviors
+are:
+
+ - 'ignore' : Take no action when the exception occurs.
+ - 'warn'   : Print a `RuntimeWarning` (via the Python `warnings` module).
+ - 'raise'  : Raise a `FloatingPointError`.
+ - 'call'   : Call a function specified using the `seterrcall` function.
+ - 'print'  : Print a warning directly to ``stdout``.
+ - 'log'    : Record error in a Log object specified by `seterrcall`.
+
+These behaviors can be set for all kinds of errors or specific ones:
+
+ - all       : apply to all numeric exceptions
+ - invalid   : when NaNs are generated
+ - divide    : divide by zero (for integers as well!)
+ - overflow  : floating point overflows
+ - underflow : floating point underflows
+
+Note that integer divide-by-zero is handled by the same machinery.
+These behaviors are set on a per-thread basis.
+
+Examples
+--------
+
+::
+
+ >>> oldsettings = np.seterr(all='warn')
+ >>> np.zeros(5,dtype=np.float32)/0.
+ invalid value encountered in divide
+ >>> j = np.seterr(under='ignore')
+ >>> np.array([1.e-100])**10
+ >>> j = np.seterr(invalid='raise')
+ >>> np.sqrt(np.array([-1.]))
+ FloatingPointError: invalid value encountered in sqrt
+ >>> def errorhandler(errstr, errflag):
+ ...      print("saw stupid error!")
+ >>> np.seterrcall(errorhandler)
+ <function err_handler at 0x...>
+ >>> j = np.seterr(all='call')
+ >>> np.zeros(5, dtype=np.int32)/0
+ FloatingPointError: invalid value encountered in divide
+ saw stupid error!
+ >>> j = np.seterr(**oldsettings) # restore previous
+ ...                              # error-handling settings
+
+Interfacing to C
+----------------
+Only a survey of the choices. Little detail on how each works.
+
+1) Bare metal, wrap your own C-code manually.
+
+ - Plusses:
+
+   - Efficient
+   - No dependencies on other tools
+
+ - Minuses:
+
+   - Lots of learning overhead:
+
+     - need to learn basics of Python C API
+     - need to learn basics of numpy C API
+     - need to learn how to handle reference counting and love it.
+
+   - Reference counting often difficult to get right.
+
+     - getting it wrong leads to memory leaks, and worse, segfaults
+
+   - API will change for Python 3.0!
+
+2) Cython
+
+ - Plusses:
+
+   - avoid learning C API's
+   - no dealing with reference counting
+   - can code in pseudo python and generate C code
+   - can also interface to existing C code
+   - should shield you from changes to Python C api
+   - has become the de-facto standard within the scientific Python community
+   - fast indexing support for arrays
+
+ - Minuses:
+
+   - Can write code in non-standard form which may become obsolete
+   - Not as flexible as manual wrapping
+
+3) ctypes
+
+ - Plusses:
+
+   - part of Python standard library
+   - good for interfacing to existing sharable libraries, particularly
+     Windows DLLs
+   - avoids API/reference counting issues
+   - good numpy support: arrays have all these in their ctypes
+     attribute: ::
+
+       a.ctypes.data              a.ctypes.get_strides
+       a.ctypes.data_as           a.ctypes.shape
+       a.ctypes.get_as_parameter  a.ctypes.shape_as
+       a.ctypes.get_data          a.ctypes.strides
+       a.ctypes.get_shape         a.ctypes.strides_as
+
+ - Minuses:
+
+   - can't use for writing code to be turned into C extensions, only a wrapper
+     tool.
+
+4) SWIG (automatic wrapper generator)
+
+ - Plusses:
+
+   - around a long time
+   - multiple scripting language support
+   - C++ support
+   - Good for wrapping large (many functions) existing C libraries
+
+ - Minuses:
+
+   - generates lots of code between Python and the C code
+   - can cause performance problems that are nearly impossible to optimize
+     out
+   - interface files can be hard to write
+   - doesn't necessarily avoid reference counting issues or needing to know
+     API's
+
+5) scipy.weave
+
+ - Plusses:
+
+   - can turn many numpy expressions into C code
+   - dynamic compiling and loading of generated C code
+   - can embed pure C code in Python module and have weave extract, generate
+     interfaces and compile, etc.
+
+ - Minuses:
+
+   - Future very uncertain: it's the only part of Scipy not ported to Python 3
+     and is effectively deprecated in favor of Cython.
+
+6) Psyco
+
+ - Plusses:
+
+   - Turns pure python into efficient machine code through jit-like
+     optimizations
+   - very fast when it optimizes well
+
+ - Minuses:
+
+   - Only on intel (windows?)
+   - Doesn't do much for numpy?
+
+Interfacing to Fortran:
+-----------------------
+The clear choice to wrap Fortran code is
+`f2py <https://docs.scipy.org/doc/numpy/f2py/>`_.
+
+Pyfort is an older alternative, but not supported any longer.
+Fwrap is a newer project that looked promising but isn't being developed any
+longer.
+
+Interfacing to C++:
+-------------------
+ 1) Cython
+ 2) CXX
+ 3) Boost.python
+ 4) SWIG
+ 5) SIP (used mainly in PyQT)
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/structured_arrays.py b/venv/Lib/site-packages/numpy/doc/structured_arrays.py
new file mode 100644
index 000000000..359d4f7f4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/structured_arrays.py
@@ -0,0 +1,646 @@
+"""
+=================
+Structured Arrays
+=================
+
+Introduction
+============
+
+Structured arrays are ndarrays whose datatype is a composition of simpler
+datatypes organized as a sequence of named :term:`fields <field>`. For example,
+::
+
+ >>> x = np.array([('Rex', 9, 81.0), ('Fido', 3, 27.0)],
+ ...              dtype=[('name', 'U10'), ('age', 'i4'), ('weight', 'f4')])
+ >>> x
+ array([('Rex', 9, 81.), ('Fido', 3, 27.)],
+       dtype=[('name', 'U10'), ('age', '<i4'), ('weight', '<f4')])
+
+Here ``x`` is a one-dimensional array of length two whose datatype is a
+structure with three fields: 1. A string of length 10 or less named 'name', 2.
+a 32-bit integer named 'age', and 3. a 32-bit float named 'weight'.
+
+If you index ``x`` at position 1 you get a structure::
+
+ >>> x[1]
+ ('Fido', 3, 27.0)
+
+You can access and modify individual fields of a structured array by indexing
+with the field name::
+
+ >>> x['age']
+ array([9, 3], dtype=int32)
+ >>> x['age'] = 5
+ >>> x
+ array([('Rex', 5, 81.), ('Fido', 5, 27.)],
+       dtype=[('name', 'U10'), ('age', '<i4'), ('weight', '<f4')])
+
+Structured datatypes are designed to be able to mimic 'structs' in the C
+language, and share a similar memory layout. They are meant for interfacing with
+C code and for low-level manipulation of structured buffers, for example for
+interpreting binary blobs. For these purposes they support specialized features
+such as subarrays, nested datatypes, and unions, and allow control over the
+memory layout of the structure.
+
+Users looking to manipulate tabular data, such as stored in csv files, may find
+other pydata projects more suitable, such as xarray, pandas, or DataArray.
+These provide a high-level interface for tabular data analysis and are better
+optimized for that use. For instance, the C-struct-like memory layout of
+structured arrays in numpy can lead to poor cache behavior in comparison.
+
+.. _defining-structured-types:
+
+Structured Datatypes
+====================
+
+A structured datatype can be thought of as a sequence of bytes of a certain
+length (the structure's :term:`itemsize`) which is interpreted as a collection
+of fields. Each field has a name, a datatype, and a byte offset within the
+structure. The datatype of a field may be any numpy datatype including other
+structured datatypes, and it may also be a :term:`subarray data type` which
+behaves like an ndarray of a specified shape. The offsets of the fields are
+arbitrary, and fields may even overlap. These offsets are usually determined
+automatically by numpy, but can also be specified.
+
+Structured Datatype Creation
+----------------------------
+
+Structured datatypes may be created using the function :func:`numpy.dtype`.
+There are 4 alternative forms of specification which vary in flexibility and
+conciseness. These are further documented in the
+:ref:`Data Type Objects <arrays.dtypes.constructing>` reference page, and in
+summary they are:
+
+1.   A list of tuples, one tuple per field
+
+     Each tuple has the form ``(fieldname, datatype, shape)`` where shape is
+     optional. ``fieldname`` is a string (or tuple if titles are used, see
+     :ref:`Field Titles <titles>` below), ``datatype`` may be any object
+     convertible to a datatype, and ``shape`` is a tuple of integers specifying
+     subarray shape.
+
+      >>> np.dtype([('x', 'f4'), ('y', np.float32), ('z', 'f4', (2, 2))])
+      dtype([('x', '<f4'), ('y', '<f4'), ('z', '<f4', (2, 2))])
+
+     If ``fieldname`` is the empty string ``''``, the field will be given a
+     default name of the form ``f#``, where ``#`` is the integer index of the
+     field, counting from 0 from the left::
+
+      >>> np.dtype([('x', 'f4'), ('', 'i4'), ('z', 'i8')])
+      dtype([('x', '<f4'), ('f1', '<i4'), ('z', '<i8')])
+
+     The byte offsets of the fields within the structure and the total
+     structure itemsize are determined automatically.
+
+2.   A string of comma-separated dtype specifications
+
+     In this shorthand notation any of the :ref:`string dtype specifications
+     <arrays.dtypes.constructing>` may be used in a string and separated by
+     commas. The itemsize and byte offsets of the fields are determined
+     automatically, and the field names are given the default names ``f0``,
+     ``f1``, etc. ::
+
+      >>> np.dtype('i8, f4, S3')
+      dtype([('f0', '<i8'), ('f1', '<f4'), ('f2', 'S3')])
+      >>> np.dtype('3int8, float32, (2, 3)float64')
+      dtype([('f0', 'i1', (3,)), ('f1', '<f4'), ('f2', '<f8', (2, 3))])
+
+3.   A dictionary of field parameter arrays
+
+     This is the most flexible form of specification since it allows control
+     over the byte-offsets of the fields and the itemsize of the structure.
+
+     The dictionary has two required keys, 'names' and 'formats', and four
+     optional keys, 'offsets', 'itemsize', 'aligned' and 'titles'. The values
+     for 'names' and 'formats' should respectively be a list of field names and
+     a list of dtype specifications, of the same length. The optional 'offsets'
+     value should be a list of integer byte-offsets, one for each field within
+     the structure. If 'offsets' is not given the offsets are determined
+     automatically. The optional 'itemsize' value should be an integer
+     describing the total size in bytes of the dtype, which must be large
+     enough to contain all the fields.
+     ::
+
+      >>> np.dtype({'names': ['col1', 'col2'], 'formats': ['i4', 'f4']})
+      dtype([('col1', '<i4'), ('col2', '<f4')])
+      >>> np.dtype({'names': ['col1', 'col2'],
+      ...           'formats': ['i4', 'f4'],
+      ...           'offsets': [0, 4],
+      ...           'itemsize': 12})
+      dtype({'names':['col1','col2'], 'formats':['<i4','<f4'], 'offsets':[0,4], 'itemsize':12})
+
+     Offsets may be chosen such that the fields overlap, though this will mean
+     that assigning to one field may clobber any overlapping field's data. As
+     an exception, fields of :class:`numpy.object` type cannot overlap with
+     other fields, because of the risk of clobbering the internal object
+     pointer and then dereferencing it.
+
+     The optional 'aligned' value can be set to ``True`` to make the automatic
+     offset computation use aligned offsets (see :ref:`offsets-and-alignment`),
+     as if the 'align' keyword argument of :func:`numpy.dtype` had been set to
+     True.
+
+     The optional 'titles' value should be a list of titles of the same length
+     as 'names', see :ref:`Field Titles <titles>` below.
+
+4.   A dictionary of field names
+
+     The use of this form of specification is discouraged, but documented here
+     because older numpy code may use it. The keys of the dictionary are the
+     field names and the values are tuples specifying type and offset::
+
+      >>> np.dtype({'col1': ('i1', 0), 'col2': ('f4', 1)})
+      dtype([('col1', 'i1'), ('col2', '<f4')])
+
+     This form is discouraged because Python dictionaries do not preserve order
+     in Python versions before Python 3.6, and the order of the fields in a
+     structured dtype has meaning. :ref:`Field Titles <titles>` may be
+     specified by using a 3-tuple, see below.
+
+Manipulating and Displaying Structured Datatypes
+------------------------------------------------
+
+The list of field names of a structured datatype can be found in the ``names``
+attribute of the dtype object::
+
+ >>> d = np.dtype([('x', 'i8'), ('y', 'f4')])
+ >>> d.names
+ ('x', 'y')
+
+The field names may be modified by assigning to the ``names`` attribute using a
+sequence of strings of the same length.
+
+The dtype object also has a dictionary-like attribute, ``fields``, whose keys
+are the field names (and :ref:`Field Titles <titles>`, see below) and whose
+values are tuples containing the dtype and byte offset of each field. ::
+
+ >>> d.fields
+ mappingproxy({'x': (dtype('int64'), 0), 'y': (dtype('float32'), 8)})
+
+Both the ``names`` and ``fields`` attributes will equal ``None`` for
+unstructured arrays. The recommended way to test if a dtype is structured is
+with `if dt.names is not None` rather than `if dt.names`, to account for dtypes
+with 0 fields.
+
+The string representation of a structured datatype is shown in the "list of
+tuples" form if possible, otherwise numpy falls back to using the more general
+dictionary form.
+
+.. _offsets-and-alignment:
+
+Automatic Byte Offsets and Alignment
+------------------------------------
+
+Numpy uses one of two methods to automatically determine the field byte offsets
+and the overall itemsize of a structured datatype, depending on whether
+``align=True`` was specified as a keyword argument to :func:`numpy.dtype`.
+
+By default (``align=False``), numpy will pack the fields together such that
+each field starts at the byte offset the previous field ended, and the fields
+are contiguous in memory. ::
+
+ >>> def print_offsets(d):
+ ...     print("offsets:", [d.fields[name][1] for name in d.names])
+ ...     print("itemsize:", d.itemsize)
+ >>> print_offsets(np.dtype('u1, u1, i4, u1, i8, u2'))
+ offsets: [0, 1, 2, 6, 7, 15]
+ itemsize: 17
+
+If ``align=True`` is set, numpy will pad the structure in the same way many C
+compilers would pad a C-struct. Aligned structures can give a performance
+improvement in some cases, at the cost of increased datatype size. Padding
+bytes are inserted between fields such that each field's byte offset will be a
+multiple of that field's alignment, which is usually equal to the field's size
+in bytes for simple datatypes, see :c:member:`PyArray_Descr.alignment`.  The
+structure will also have trailing padding added so that its itemsize is a
+multiple of the largest field's alignment. ::
+
+ >>> print_offsets(np.dtype('u1, u1, i4, u1, i8, u2', align=True))
+ offsets: [0, 1, 4, 8, 16, 24]
+ itemsize: 32
+
+Note that although almost all modern C compilers pad in this way by default,
+padding in C structs is C-implementation-dependent so this memory layout is not
+guaranteed to exactly match that of a corresponding struct in a C program. Some
+work may be needed, either on the numpy side or the C side, to obtain exact
+correspondence.
+
+If offsets were specified using the optional ``offsets`` key in the
+dictionary-based dtype specification, setting ``align=True`` will check that
+each field's offset is a multiple of its size and that the itemsize is a
+multiple of the largest field size, and raise an exception if not.
+
+If the offsets of the fields and itemsize of a structured array satisfy the
+alignment conditions, the array will have the ``ALIGNED`` :attr:`flag
+<numpy.ndarray.flags>` set.
+
+A convenience function :func:`numpy.lib.recfunctions.repack_fields` converts an
+aligned dtype or array to a packed one and vice versa. It takes either a dtype
+or structured ndarray as an argument, and returns a copy with fields re-packed,
+with or without padding bytes.
+
+.. _titles:
+
+Field Titles
+------------
+
+In addition to field names, fields may also have an associated :term:`title`,
+an alternate name, which is sometimes used as an additional description or
+alias for the field. The title may be used to index an array, just like a
+field name.
+
+To add titles when using the list-of-tuples form of dtype specification, the
+field name may be specified as a tuple of two strings instead of a single
+string, which will be the field's title and field name respectively. For
+example::
+
+ >>> np.dtype([(('my title', 'name'), 'f4')])
+ dtype([(('my title', 'name'), '<f4')])
+
+When using the first form of dictionary-based specification, the titles may be
+supplied as an extra ``'titles'`` key as described above. When using the second
+(discouraged) dictionary-based specification, the title can be supplied by
+providing a 3-element tuple ``(datatype, offset, title)`` instead of the usual
+2-element tuple::
+
+ >>> np.dtype({'name': ('i4', 0, 'my title')})
+ dtype([(('my title', 'name'), '<i4')])
+
+The ``dtype.fields`` dictionary will contain titles as keys, if any
+titles are used.  This means effectively that a field with a title will be
+represented twice in the fields dictionary. The tuple values for these fields
+will also have a third element, the field title. Because of this, and because
+the ``names`` attribute preserves the field order while the ``fields``
+attribute may not, it is recommended to iterate through the fields of a dtype
+using the ``names`` attribute of the dtype, which will not list titles, as
+in::
+
+ >>> for name in d.names:
+ ...     print(d.fields[name][:2])
+ (dtype('int64'), 0)
+ (dtype('float32'), 8)
+
+Union types
+-----------
+
+Structured datatypes are implemented in numpy to have base type
+:class:`numpy.void` by default, but it is possible to interpret other numpy
+types as structured types using the ``(base_dtype, dtype)`` form of dtype
+specification described in
+:ref:`Data Type Objects <arrays.dtypes.constructing>`.  Here, ``base_dtype`` is
+the desired underlying dtype, and fields and flags will be copied from
+``dtype``. This dtype is similar to a 'union' in C.
+
+Indexing and Assignment to Structured arrays
+============================================
+
+Assigning data to a Structured Array
+------------------------------------
+
+There are a number of ways to assign values to a structured array: Using python
+tuples, using scalar values, or using other structured arrays.
+
+Assignment from Python Native Types (Tuples)
+````````````````````````````````````````````
+
+The simplest way to assign values to a structured array is using python tuples.
+Each assigned value should be a tuple of length equal to the number of fields
+in the array, and not a list or array as these will trigger numpy's
+broadcasting rules. The tuple's elements are assigned to the successive fields
+of the array, from left to right::
+
+ >>> x = np.array([(1, 2, 3), (4, 5, 6)], dtype='i8, f4, f8')
+ >>> x[1] = (7, 8, 9)
+ >>> x
+ array([(1, 2., 3.), (7, 8., 9.)],
+      dtype=[('f0', '<i8'), ('f1', '<f4'), ('f2', '<f8')])
+
+Assignment from Scalars
+```````````````````````
+
+A scalar assigned to a structured element will be assigned to all fields. This
+happens when a scalar is assigned to a structured array, or when an
+unstructured array is assigned to a structured array::
+
+ >>> x = np.zeros(2, dtype='i8, f4, ?, S1')
+ >>> x[:] = 3
+ >>> x
+ array([(3, 3., True, b'3'), (3, 3., True, b'3')],
+       dtype=[('f0', '<i8'), ('f1', '<f4'), ('f2', '?'), ('f3', 'S1')])
+ >>> x[:] = np.arange(2)
+ >>> x
+ array([(0, 0., False, b'0'), (1, 1., True, b'1')],
+       dtype=[('f0', '<i8'), ('f1', '<f4'), ('f2', '?'), ('f3', 'S1')])
+
+Structured arrays can also be assigned to unstructured arrays, but only if the
+structured datatype has just a single field::
+
+ >>> twofield = np.zeros(2, dtype=[('A', 'i4'), ('B', 'i4')])
+ >>> onefield = np.zeros(2, dtype=[('A', 'i4')])
+ >>> nostruct = np.zeros(2, dtype='i4')
+ >>> nostruct[:] = twofield
+ Traceback (most recent call last):
+ ...
+ TypeError: Cannot cast array data from dtype([('A', '<i4'), ('B', '<i4')]) to dtype('int32') according to the rule 'unsafe'
+
+Assignment from other Structured Arrays
+```````````````````````````````````````
+
+Assignment between two structured arrays occurs as if the source elements had
+been converted to tuples and then assigned to the destination elements. That
+is, the first field of the source array is assigned to the first field of the
+destination array, and the second field likewise, and so on, regardless of
+field names. Structured arrays with a different number of fields cannot be
+assigned to each other. Bytes of the destination structure which are not
+included in any of the fields are unaffected. ::
+
+ >>> a = np.zeros(3, dtype=[('a', 'i8'), ('b', 'f4'), ('c', 'S3')])
+ >>> b = np.ones(3, dtype=[('x', 'f4'), ('y', 'S3'), ('z', 'O')])
+ >>> b[:] = a
+ >>> b
+ array([(0., b'0.0', b''), (0., b'0.0', b''), (0., b'0.0', b'')],
+       dtype=[('x', '<f4'), ('y', 'S3'), ('z', 'O')])
+
+
+Assignment involving subarrays
+``````````````````````````````
+
+When assigning to fields which are subarrays, the assigned value will first be
+broadcast to the shape of the subarray.
+
+Indexing Structured Arrays
+--------------------------
+
+Accessing Individual Fields
+```````````````````````````
+
+Individual fields of a structured array may be accessed and modified by indexing
+the array with the field name. ::
+
+ >>> x = np.array([(1, 2), (3, 4)], dtype=[('foo', 'i8'), ('bar', 'f4')])
+ >>> x['foo']
+ array([1, 3])
+ >>> x['foo'] = 10
+ >>> x
+ array([(10, 2.), (10, 4.)],
+       dtype=[('foo', '<i8'), ('bar', '<f4')])
+
+The resulting array is a view into the original array. It shares the same
+memory locations and writing to the view will modify the original array. ::
+
+ >>> y = x['bar']
+ >>> y[:] = 11
+ >>> x
+ array([(10, 11.), (10, 11.)],
+       dtype=[('foo', '<i8'), ('bar', '<f4')])
+
+This view has the same dtype and itemsize as the indexed field, so it is
+typically a non-structured array, except in the case of nested structures.
+
+ >>> y.dtype, y.shape, y.strides
+ (dtype('float32'), (2,), (12,))
+
+If the accessed field is a subarray, the dimensions of the subarray
+are appended to the shape of the result::
+
+   >>> x = np.zeros((2, 2), dtype=[('a', np.int32), ('b', np.float64, (3, 3))])
+   >>> x['a'].shape
+   (2, 2)
+   >>> x['b'].shape
+   (2, 2, 3, 3)
+
+Accessing Multiple Fields
+```````````````````````````
+
+One can index and assign to a structured array with a multi-field index, where
+the index is a list of field names.
+
+.. warning::
+    The behavior of multi-field indexes changed from Numpy 1.15 to Numpy 1.16.
+
+The result of indexing with a multi-field index is a view into the original
+array, as follows::
+
+ >>> a = np.zeros(3, dtype=[('a', 'i4'), ('b', 'i4'), ('c', 'f4')])
+ >>> a[['a', 'c']]
+ array([(0, 0.), (0, 0.), (0, 0.)],
+      dtype={'names':['a','c'], 'formats':['<i4','<f4'], 'offsets':[0,8], 'itemsize':12})
+
+Assignment to the view modifies the original array. The view's fields will be
+in the order they were indexed. Note that unlike for single-field indexing, the
+dtype of the view has the same itemsize as the original array, and has fields
+at the same offsets as in the original array, and unindexed fields are merely
+missing.
+
+.. warning::
+    In Numpy 1.15, indexing an array with a multi-field index returned a copy of
+    the result above, but with fields packed together in memory as if
+    passed through :func:`numpy.lib.recfunctions.repack_fields`.
+
+    The new behavior as of Numpy 1.16 leads to extra "padding" bytes at the
+    location of unindexed fields compared to 1.15. You will need to update any
+    code which depends on the data having a "packed" layout. For instance code
+    such as::
+
+     >>> a[['a', 'c']].view('i8')  # Fails in Numpy 1.16
+     Traceback (most recent call last):
+        File "<stdin>", line 1, in <module>
+     ValueError: When changing to a smaller dtype, its size must be a divisor of the size of original dtype
+
+    will need to be changed. This code has raised a ``FutureWarning`` since
+    Numpy 1.12, and similar code has raised ``FutureWarning`` since 1.7.
+
+    In 1.16 a number of functions have been introduced in the
+    :mod:`numpy.lib.recfunctions` module to help users account for this
+    change. These are
+    :func:`numpy.lib.recfunctions.repack_fields`.
+    :func:`numpy.lib.recfunctions.structured_to_unstructured`,
+    :func:`numpy.lib.recfunctions.unstructured_to_structured`,
+    :func:`numpy.lib.recfunctions.apply_along_fields`,
+    :func:`numpy.lib.recfunctions.assign_fields_by_name`,  and
+    :func:`numpy.lib.recfunctions.require_fields`.
+
+    The function :func:`numpy.lib.recfunctions.repack_fields` can always be
+    used to reproduce the old behavior, as it will return a packed copy of the
+    structured array. The code above, for example, can be replaced with:
+
+     >>> from numpy.lib.recfunctions import repack_fields
+     >>> repack_fields(a[['a', 'c']]).view('i8')  # supported in 1.16
+     array([0, 0, 0])
+
+    Furthermore, numpy now provides a new function
+    :func:`numpy.lib.recfunctions.structured_to_unstructured` which is a safer
+    and more efficient alternative for users who wish to convert structured
+    arrays to unstructured arrays, as the view above is often indeded to do.
+    This function allows safe conversion to an unstructured type taking into
+    account padding, often avoids a copy, and also casts the datatypes
+    as needed, unlike the view. Code such as:
+
+     >>> b = np.zeros(3, dtype=[('x', 'f4'), ('y', 'f4'), ('z', 'f4')])
+     >>> b[['x', 'z']].view('f4')
+     array([0., 0., 0., 0., 0., 0., 0., 0., 0.], dtype=float32)
+
+    can be made safer by replacing with:
+
+     >>> from numpy.lib.recfunctions import structured_to_unstructured
+     >>> structured_to_unstructured(b[['x', 'z']])
+     array([0, 0, 0])
+
+
+Assignment to an array with a multi-field index modifies the original array::
+
+ >>> a[['a', 'c']] = (2, 3)
+ >>> a
+ array([(2, 0, 3.), (2, 0, 3.), (2, 0, 3.)],
+       dtype=[('a', '<i4'), ('b', '<i4'), ('c', '<f4')])
+
+This obeys the structured array assignment rules described above. For example,
+this means that one can swap the values of two fields using appropriate
+multi-field indexes::
+
+ >>> a[['a', 'c']] = a[['c', 'a']]
+
+Indexing with an Integer to get a Structured Scalar
+```````````````````````````````````````````````````
+
+Indexing a single element of a structured array (with an integer index) returns
+a structured scalar::
+
+ >>> x = np.array([(1, 2., 3.)], dtype='i, f, f')
+ >>> scalar = x[0]
+ >>> scalar
+ (1, 2., 3.)
+ >>> type(scalar)
+ <class 'numpy.void'>
+
+Unlike other numpy scalars, structured scalars are mutable and act like views
+into the original array, such that modifying the scalar will modify the
+original array. Structured scalars also support access and assignment by field
+name::
+
+ >>> x = np.array([(1, 2), (3, 4)], dtype=[('foo', 'i8'), ('bar', 'f4')])
+ >>> s = x[0]
+ >>> s['bar'] = 100
+ >>> x
+ array([(1, 100.), (3, 4.)],
+       dtype=[('foo', '<i8'), ('bar', '<f4')])
+
+Similarly to tuples, structured scalars can also be indexed with an integer::
+
+ >>> scalar = np.array([(1, 2., 3.)], dtype='i, f, f')[0]
+ >>> scalar[0]
+ 1
+ >>> scalar[1] = 4
+
+Thus, tuples might be thought of as the native Python equivalent to numpy's
+structured types, much like native python integers are the equivalent to
+numpy's integer types. Structured scalars may be converted to a tuple by
+calling :func:`ndarray.item`::
+
+ >>> scalar.item(), type(scalar.item())
+ ((1, 4.0, 3.0), <class 'tuple'>)
+
+Viewing Structured Arrays Containing Objects
+--------------------------------------------
+
+In order to prevent clobbering object pointers in fields of
+:class:`numpy.object` type, numpy currently does not allow views of structured
+arrays containing objects.
+
+Structure Comparison
+--------------------
+
+If the dtypes of two void structured arrays are equal, testing the equality of
+the arrays will result in a boolean array with the dimensions of the original
+arrays, with elements set to ``True`` where all fields of the corresponding
+structures are equal. Structured dtypes are equal if the field names,
+dtypes and titles are the same, ignoring endianness, and the fields are in
+the same order::
+
+ >>> a = np.zeros(2, dtype=[('a', 'i4'), ('b', 'i4')])
+ >>> b = np.ones(2, dtype=[('a', 'i4'), ('b', 'i4')])
+ >>> a == b
+ array([False, False])
+
+Currently, if the dtypes of two void structured arrays are not equivalent the
+comparison fails, returning the scalar value ``False``. This behavior is
+deprecated as of numpy 1.10 and will raise an error or perform elementwise
+comparison in the future.
+
+The ``<`` and ``>`` operators always return ``False`` when comparing void
+structured arrays, and arithmetic and bitwise operations are not supported.
+
+Record Arrays
+=============
+
+As an optional convenience numpy provides an ndarray subclass,
+:class:`numpy.recarray`, and associated helper functions in the
+:mod:`numpy.rec` submodule, that allows access to fields of structured arrays
+by attribute instead of only by index. Record arrays also use a special
+datatype, :class:`numpy.record`, that allows field access by attribute on the
+structured scalars obtained from the array.
+
+The simplest way to create a record array is with :func:`numpy.rec.array`::
+
+ >>> recordarr = np.rec.array([(1, 2., 'Hello'), (2, 3., "World")],
+ ...                    dtype=[('foo', 'i4'),('bar', 'f4'), ('baz', 'S10')])
+ >>> recordarr.bar
+ array([ 2.,  3.], dtype=float32)
+ >>> recordarr[1:2]
+ rec.array([(2, 3., b'World')],
+       dtype=[('foo', '<i4'), ('bar', '<f4'), ('baz', 'S10')])
+ >>> recordarr[1:2].foo
+ array([2], dtype=int32)
+ >>> recordarr.foo[1:2]
+ array([2], dtype=int32)
+ >>> recordarr[1].baz
+ b'World'
+
+:func:`numpy.rec.array` can convert a wide variety of arguments into record
+arrays, including structured arrays::
+
+ >>> arr = np.array([(1, 2., 'Hello'), (2, 3., "World")],
+ ...             dtype=[('foo', 'i4'), ('bar', 'f4'), ('baz', 'S10')])
+ >>> recordarr = np.rec.array(arr)
+
+The :mod:`numpy.rec` module provides a number of other convenience functions for
+creating record arrays, see :ref:`record array creation routines
+<routines.array-creation.rec>`.
+
+A record array representation of a structured array can be obtained using the
+appropriate `view <numpy-ndarray-view>`_::
+
+ >>> arr = np.array([(1, 2., 'Hello'), (2, 3., "World")],
+ ...                dtype=[('foo', 'i4'),('bar', 'f4'), ('baz', 'a10')])
+ >>> recordarr = arr.view(dtype=np.dtype((np.record, arr.dtype)),
+ ...                      type=np.recarray)
+
+For convenience, viewing an ndarray as type :class:`np.recarray` will
+automatically convert to :class:`np.record` datatype, so the dtype can be left
+out of the view::
+
+ >>> recordarr = arr.view(np.recarray)
+ >>> recordarr.dtype
+ dtype((numpy.record, [('foo', '<i4'), ('bar', '<f4'), ('baz', 'S10')]))
+
+To get back to a plain ndarray both the dtype and type must be reset. The
+following view does so, taking into account the unusual case that the
+recordarr was not a structured type::
+
+ >>> arr2 = recordarr.view(recordarr.dtype.fields or recordarr.dtype, np.ndarray)
+
+Record array fields accessed by index or by attribute are returned as a record
+array if the field has a structured type but as a plain ndarray otherwise. ::
+
+ >>> recordarr = np.rec.array([('Hello', (1, 2)), ("World", (3, 4))],
+ ...                 dtype=[('foo', 'S6'),('bar', [('A', int), ('B', int)])])
+ >>> type(recordarr.foo)
+ <class 'numpy.ndarray'>
+ >>> type(recordarr.bar)
+ <class 'numpy.recarray'>
+
+Note that if a field has the same name as an ndarray attribute, the ndarray
+attribute takes precedence. Such fields will be inaccessible by attribute but
+will still be accessible by index.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/subclassing.py b/venv/Lib/site-packages/numpy/doc/subclassing.py
new file mode 100644
index 000000000..7dc10e1c8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/subclassing.py
@@ -0,0 +1,752 @@
+"""=============================
+Subclassing ndarray in python
+=============================
+
+Introduction
+------------
+
+Subclassing ndarray is relatively simple, but it has some complications
+compared to other Python objects.  On this page we explain the machinery
+that allows you to subclass ndarray, and the implications for
+implementing a subclass.
+
+ndarrays and object creation
+============================
+
+Subclassing ndarray is complicated by the fact that new instances of
+ndarray classes can come about in three different ways.  These are:
+
+#. Explicit constructor call - as in ``MySubClass(params)``.  This is
+   the usual route to Python instance creation.
+#. View casting - casting an existing ndarray as a given subclass
+#. New from template - creating a new instance from a template
+   instance. Examples include returning slices from a subclassed array,
+   creating return types from ufuncs, and copying arrays.  See
+   :ref:`new-from-template` for more details
+
+The last two are characteristics of ndarrays - in order to support
+things like array slicing.  The complications of subclassing ndarray are
+due to the mechanisms numpy has to support these latter two routes of
+instance creation.
+
+.. _view-casting:
+
+View casting
+------------
+
+*View casting* is the standard ndarray mechanism by which you take an
+ndarray of any subclass, and return a view of the array as another
+(specified) subclass:
+
+>>> import numpy as np
+>>> # create a completely useless ndarray subclass
+>>> class C(np.ndarray): pass
+>>> # create a standard ndarray
+>>> arr = np.zeros((3,))
+>>> # take a view of it, as our useless subclass
+>>> c_arr = arr.view(C)
+>>> type(c_arr)
+<class 'C'>
+
+.. _new-from-template:
+
+Creating new from template
+--------------------------
+
+New instances of an ndarray subclass can also come about by a very
+similar mechanism to :ref:`view-casting`, when numpy finds it needs to
+create a new instance from a template instance.  The most obvious place
+this has to happen is when you are taking slices of subclassed arrays.
+For example:
+
+>>> v = c_arr[1:]
+>>> type(v) # the view is of type 'C'
+<class 'C'>
+>>> v is c_arr # but it's a new instance
+False
+
+The slice is a *view* onto the original ``c_arr`` data.  So, when we
+take a view from the ndarray, we return a new ndarray, of the same
+class, that points to the data in the original.
+
+There are other points in the use of ndarrays where we need such views,
+such as copying arrays (``c_arr.copy()``), creating ufunc output arrays
+(see also :ref:`array-wrap`), and reducing methods (like
+``c_arr.mean()``).
+
+Relationship of view casting and new-from-template
+--------------------------------------------------
+
+These paths both use the same machinery.  We make the distinction here,
+because they result in different input to your methods.  Specifically,
+:ref:`view-casting` means you have created a new instance of your array
+type from any potential subclass of ndarray.  :ref:`new-from-template`
+means you have created a new instance of your class from a pre-existing
+instance, allowing you - for example - to copy across attributes that
+are particular to your subclass.
+
+Implications for subclassing
+----------------------------
+
+If we subclass ndarray, we need to deal not only with explicit
+construction of our array type, but also :ref:`view-casting` or
+:ref:`new-from-template`.  NumPy has the machinery to do this, and this
+machinery that makes subclassing slightly non-standard.
+
+There are two aspects to the machinery that ndarray uses to support
+views and new-from-template in subclasses.
+
+The first is the use of the ``ndarray.__new__`` method for the main work
+of object initialization, rather then the more usual ``__init__``
+method.  The second is the use of the ``__array_finalize__`` method to
+allow subclasses to clean up after the creation of views and new
+instances from templates.
+
+A brief Python primer on ``__new__`` and ``__init__``
+=====================================================
+
+``__new__`` is a standard Python method, and, if present, is called
+before ``__init__`` when we create a class instance. See the `python
+__new__ documentation
+<https://docs.python.org/reference/datamodel.html#object.__new__>`_ for more detail.
+
+For example, consider the following Python code:
+
+.. testcode::
+
+  class C:
+      def __new__(cls, *args):
+          print('Cls in __new__:', cls)
+          print('Args in __new__:', args)
+          # The `object` type __new__ method takes a single argument.
+          return object.__new__(cls)
+
+      def __init__(self, *args):
+          print('type(self) in __init__:', type(self))
+          print('Args in __init__:', args)
+
+meaning that we get:
+
+>>> c = C('hello')
+Cls in __new__: <class 'C'>
+Args in __new__: ('hello',)
+type(self) in __init__: <class 'C'>
+Args in __init__: ('hello',)
+
+When we call ``C('hello')``, the ``__new__`` method gets its own class
+as first argument, and the passed argument, which is the string
+``'hello'``.  After python calls ``__new__``, it usually (see below)
+calls our ``__init__`` method, with the output of ``__new__`` as the
+first argument (now a class instance), and the passed arguments
+following.
+
+As you can see, the object can be initialized in the ``__new__``
+method or the ``__init__`` method, or both, and in fact ndarray does
+not have an ``__init__`` method, because all the initialization is
+done in the ``__new__`` method.
+
+Why use ``__new__`` rather than just the usual ``__init__``?  Because
+in some cases, as for ndarray, we want to be able to return an object
+of some other class.  Consider the following:
+
+.. testcode::
+
+  class D(C):
+      def __new__(cls, *args):
+          print('D cls is:', cls)
+          print('D args in __new__:', args)
+          return C.__new__(C, *args)
+
+      def __init__(self, *args):
+          # we never get here
+          print('In D __init__')
+
+meaning that:
+
+>>> obj = D('hello')
+D cls is: <class 'D'>
+D args in __new__: ('hello',)
+Cls in __new__: <class 'C'>
+Args in __new__: ('hello',)
+>>> type(obj)
+<class 'C'>
+
+The definition of ``C`` is the same as before, but for ``D``, the
+``__new__`` method returns an instance of class ``C`` rather than
+``D``.  Note that the ``__init__`` method of ``D`` does not get
+called.  In general, when the ``__new__`` method returns an object of
+class other than the class in which it is defined, the ``__init__``
+method of that class is not called.
+
+This is how subclasses of the ndarray class are able to return views
+that preserve the class type.  When taking a view, the standard
+ndarray machinery creates the new ndarray object with something
+like::
+
+  obj = ndarray.__new__(subtype, shape, ...
+
+where ``subdtype`` is the subclass.  Thus the returned view is of the
+same class as the subclass, rather than being of class ``ndarray``.
+
+That solves the problem of returning views of the same type, but now
+we have a new problem.  The machinery of ndarray can set the class
+this way, in its standard methods for taking views, but the ndarray
+``__new__`` method knows nothing of what we have done in our own
+``__new__`` method in order to set attributes, and so on.  (Aside -
+why not call ``obj = subdtype.__new__(...`` then?  Because we may not
+have a ``__new__`` method with the same call signature).
+
+The role of ``__array_finalize__``
+==================================
+
+``__array_finalize__`` is the mechanism that numpy provides to allow
+subclasses to handle the various ways that new instances get created.
+
+Remember that subclass instances can come about in these three ways:
+
+#. explicit constructor call (``obj = MySubClass(params)``).  This will
+   call the usual sequence of ``MySubClass.__new__`` then (if it exists)
+   ``MySubClass.__init__``.
+#. :ref:`view-casting`
+#. :ref:`new-from-template`
+
+Our ``MySubClass.__new__`` method only gets called in the case of the
+explicit constructor call, so we can't rely on ``MySubClass.__new__`` or
+``MySubClass.__init__`` to deal with the view casting and
+new-from-template.  It turns out that ``MySubClass.__array_finalize__``
+*does* get called for all three methods of object creation, so this is
+where our object creation housekeeping usually goes.
+
+* For the explicit constructor call, our subclass will need to create a
+  new ndarray instance of its own class.  In practice this means that
+  we, the authors of the code, will need to make a call to
+  ``ndarray.__new__(MySubClass,...)``, a class-hierarchy prepared call to
+  ``super(MySubClass, cls).__new__(cls, ...)``, or do view casting of an
+  existing array (see below)
+* For view casting and new-from-template, the equivalent of
+  ``ndarray.__new__(MySubClass,...`` is called, at the C level.
+
+The arguments that ``__array_finalize__`` receives differ for the three
+methods of instance creation above.
+
+The following code allows us to look at the call sequences and arguments:
+
+.. testcode::
+
+   import numpy as np
+
+   class C(np.ndarray):
+       def __new__(cls, *args, **kwargs):
+           print('In __new__ with class %s' % cls)
+           return super(C, cls).__new__(cls, *args, **kwargs)
+
+       def __init__(self, *args, **kwargs):
+           # in practice you probably will not need or want an __init__
+           # method for your subclass
+           print('In __init__ with class %s' % self.__class__)
+
+       def __array_finalize__(self, obj):
+           print('In array_finalize:')
+           print('   self type is %s' % type(self))
+           print('   obj type is %s' % type(obj))
+
+
+Now:
+
+>>> # Explicit constructor
+>>> c = C((10,))
+In __new__ with class <class 'C'>
+In array_finalize:
+   self type is <class 'C'>
+   obj type is <type 'NoneType'>
+In __init__ with class <class 'C'>
+>>> # View casting
+>>> a = np.arange(10)
+>>> cast_a = a.view(C)
+In array_finalize:
+   self type is <class 'C'>
+   obj type is <type 'numpy.ndarray'>
+>>> # Slicing (example of new-from-template)
+>>> cv = c[:1]
+In array_finalize:
+   self type is <class 'C'>
+   obj type is <class 'C'>
+
+The signature of ``__array_finalize__`` is::
+
+    def __array_finalize__(self, obj):
+
+One sees that the ``super`` call, which goes to
+``ndarray.__new__``, passes ``__array_finalize__`` the new object, of our
+own class (``self``) as well as the object from which the view has been
+taken (``obj``).  As you can see from the output above, the ``self`` is
+always a newly created instance of our subclass, and the type of ``obj``
+differs for the three instance creation methods:
+
+* When called from the explicit constructor, ``obj`` is ``None``
+* When called from view casting, ``obj`` can be an instance of any
+  subclass of ndarray, including our own.
+* When called in new-from-template, ``obj`` is another instance of our
+  own subclass, that we might use to update the new ``self`` instance.
+
+Because ``__array_finalize__`` is the only method that always sees new
+instances being created, it is the sensible place to fill in instance
+defaults for new object attributes, among other tasks.
+
+This may be clearer with an example.
+
+Simple example - adding an extra attribute to ndarray
+-----------------------------------------------------
+
+.. testcode::
+
+  import numpy as np
+
+  class InfoArray(np.ndarray):
+
+      def __new__(subtype, shape, dtype=float, buffer=None, offset=0,
+                  strides=None, order=None, info=None):
+          # Create the ndarray instance of our type, given the usual
+          # ndarray input arguments.  This will call the standard
+          # ndarray constructor, but return an object of our type.
+          # It also triggers a call to InfoArray.__array_finalize__
+          obj = super(InfoArray, subtype).__new__(subtype, shape, dtype,
+                                                  buffer, offset, strides,
+                                                  order)
+          # set the new 'info' attribute to the value passed
+          obj.info = info
+          # Finally, we must return the newly created object:
+          return obj
+
+      def __array_finalize__(self, obj):
+          # ``self`` is a new object resulting from
+          # ndarray.__new__(InfoArray, ...), therefore it only has
+          # attributes that the ndarray.__new__ constructor gave it -
+          # i.e. those of a standard ndarray.
+          #
+          # We could have got to the ndarray.__new__ call in 3 ways:
+          # From an explicit constructor - e.g. InfoArray():
+          #    obj is None
+          #    (we're in the middle of the InfoArray.__new__
+          #    constructor, and self.info will be set when we return to
+          #    InfoArray.__new__)
+          if obj is None: return
+          # From view casting - e.g arr.view(InfoArray):
+          #    obj is arr
+          #    (type(obj) can be InfoArray)
+          # From new-from-template - e.g infoarr[:3]
+          #    type(obj) is InfoArray
+          #
+          # Note that it is here, rather than in the __new__ method,
+          # that we set the default value for 'info', because this
+          # method sees all creation of default objects - with the
+          # InfoArray.__new__ constructor, but also with
+          # arr.view(InfoArray).
+          self.info = getattr(obj, 'info', None)
+          # We do not need to return anything
+
+
+Using the object looks like this:
+
+  >>> obj = InfoArray(shape=(3,)) # explicit constructor
+  >>> type(obj)
+  <class 'InfoArray'>
+  >>> obj.info is None
+  True
+  >>> obj = InfoArray(shape=(3,), info='information')
+  >>> obj.info
+  'information'
+  >>> v = obj[1:] # new-from-template - here - slicing
+  >>> type(v)
+  <class 'InfoArray'>
+  >>> v.info
+  'information'
+  >>> arr = np.arange(10)
+  >>> cast_arr = arr.view(InfoArray) # view casting
+  >>> type(cast_arr)
+  <class 'InfoArray'>
+  >>> cast_arr.info is None
+  True
+
+This class isn't very useful, because it has the same constructor as the
+bare ndarray object, including passing in buffers and shapes and so on.
+We would probably prefer the constructor to be able to take an already
+formed ndarray from the usual numpy calls to ``np.array`` and return an
+object.
+
+Slightly more realistic example - attribute added to existing array
+-------------------------------------------------------------------
+
+Here is a class that takes a standard ndarray that already exists, casts
+as our type, and adds an extra attribute.
+
+.. testcode::
+
+  import numpy as np
+
+  class RealisticInfoArray(np.ndarray):
+
+      def __new__(cls, input_array, info=None):
+          # Input array is an already formed ndarray instance
+          # We first cast to be our class type
+          obj = np.asarray(input_array).view(cls)
+          # add the new attribute to the created instance
+          obj.info = info
+          # Finally, we must return the newly created object:
+          return obj
+
+      def __array_finalize__(self, obj):
+          # see InfoArray.__array_finalize__ for comments
+          if obj is None: return
+          self.info = getattr(obj, 'info', None)
+
+
+So:
+
+  >>> arr = np.arange(5)
+  >>> obj = RealisticInfoArray(arr, info='information')
+  >>> type(obj)
+  <class 'RealisticInfoArray'>
+  >>> obj.info
+  'information'
+  >>> v = obj[1:]
+  >>> type(v)
+  <class 'RealisticInfoArray'>
+  >>> v.info
+  'information'
+
+.. _array-ufunc:
+
+``__array_ufunc__`` for ufuncs
+------------------------------
+
+  .. versionadded:: 1.13
+
+A subclass can override what happens when executing numpy ufuncs on it by
+overriding the default ``ndarray.__array_ufunc__`` method. This method is
+executed *instead* of the ufunc and should return either the result of the
+operation, or :obj:`NotImplemented` if the operation requested is not
+implemented.
+
+The signature of ``__array_ufunc__`` is::
+
+    def __array_ufunc__(ufunc, method, *inputs, **kwargs):
+
+    - *ufunc* is the ufunc object that was called.
+    - *method* is a string indicating how the Ufunc was called, either
+      ``"__call__"`` to indicate it was called directly, or one of its
+      :ref:`methods<ufuncs.methods>`: ``"reduce"``, ``"accumulate"``,
+      ``"reduceat"``, ``"outer"``, or ``"at"``.
+    - *inputs* is a tuple of the input arguments to the ``ufunc``
+    - *kwargs* contains any optional or keyword arguments passed to the
+      function. This includes any ``out`` arguments, which are always
+      contained in a tuple.
+
+A typical implementation would convert any inputs or outputs that are
+instances of one's own class, pass everything on to a superclass using
+``super()``, and finally return the results after possible
+back-conversion. An example, taken from the test case
+``test_ufunc_override_with_super`` in ``core/tests/test_umath.py``, is the
+following.
+
+.. testcode::
+
+    input numpy as np
+
+    class A(np.ndarray):
+        def __array_ufunc__(self, ufunc, method, *inputs, out=None, **kwargs):
+            args = []
+            in_no = []
+            for i, input_ in enumerate(inputs):
+                if isinstance(input_, A):
+                    in_no.append(i)
+                    args.append(input_.view(np.ndarray))
+                else:
+                    args.append(input_)
+
+            outputs = out
+            out_no = []
+            if outputs:
+                out_args = []
+                for j, output in enumerate(outputs):
+                    if isinstance(output, A):
+                        out_no.append(j)
+                        out_args.append(output.view(np.ndarray))
+                    else:
+                        out_args.append(output)
+                kwargs['out'] = tuple(out_args)
+            else:
+                outputs = (None,) * ufunc.nout
+
+            info = {}
+            if in_no:
+                info['inputs'] = in_no
+            if out_no:
+                info['outputs'] = out_no
+
+            results = super(A, self).__array_ufunc__(ufunc, method,
+                                                     *args, **kwargs)
+            if results is NotImplemented:
+                return NotImplemented
+
+            if method == 'at':
+                if isinstance(inputs[0], A):
+                    inputs[0].info = info
+                return
+
+            if ufunc.nout == 1:
+                results = (results,)
+
+            results = tuple((np.asarray(result).view(A)
+                             if output is None else output)
+                            for result, output in zip(results, outputs))
+            if results and isinstance(results[0], A):
+                results[0].info = info
+
+            return results[0] if len(results) == 1 else results
+
+So, this class does not actually do anything interesting: it just
+converts any instances of its own to regular ndarray (otherwise, we'd
+get infinite recursion!), and adds an ``info`` dictionary that tells
+which inputs and outputs it converted. Hence, e.g.,
+
+>>> a = np.arange(5.).view(A)
+>>> b = np.sin(a)
+>>> b.info
+{'inputs': [0]}
+>>> b = np.sin(np.arange(5.), out=(a,))
+>>> b.info
+{'outputs': [0]}
+>>> a = np.arange(5.).view(A)
+>>> b = np.ones(1).view(A)
+>>> c = a + b
+>>> c.info
+{'inputs': [0, 1]}
+>>> a += b
+>>> a.info
+{'inputs': [0, 1], 'outputs': [0]}
+
+Note that another approach would be to to use ``getattr(ufunc,
+methods)(*inputs, **kwargs)`` instead of the ``super`` call. For this example,
+the result would be identical, but there is a difference if another operand
+also defines ``__array_ufunc__``. E.g., lets assume that we evalulate
+``np.add(a, b)``, where ``b`` is an instance of another class ``B`` that has
+an override.  If you use ``super`` as in the example,
+``ndarray.__array_ufunc__`` will notice that ``b`` has an override, which
+means it cannot evaluate the result itself. Thus, it will return
+`NotImplemented` and so will our class ``A``. Then, control will be passed
+over to ``b``, which either knows how to deal with us and produces a result,
+or does not and returns `NotImplemented`, raising a ``TypeError``.
+
+If instead, we replace our ``super`` call with ``getattr(ufunc, method)``, we
+effectively do ``np.add(a.view(np.ndarray), b)``. Again, ``B.__array_ufunc__``
+will be called, but now it sees an ``ndarray`` as the other argument. Likely,
+it will know how to handle this, and return a new instance of the ``B`` class
+to us. Our example class is not set up to handle this, but it might well be
+the best approach if, e.g., one were to re-implement ``MaskedArray`` using
+``__array_ufunc__``.
+
+As a final note: if the ``super`` route is suited to a given class, an
+advantage of using it is that it helps in constructing class hierarchies.
+E.g., suppose that our other class ``B`` also used the ``super`` in its
+``__array_ufunc__`` implementation, and we created a class ``C`` that depended
+on both, i.e., ``class C(A, B)`` (with, for simplicity, not another
+``__array_ufunc__`` override). Then any ufunc on an instance of ``C`` would
+pass on to ``A.__array_ufunc__``, the ``super`` call in ``A`` would go to
+``B.__array_ufunc__``, and the ``super`` call in ``B`` would go to
+``ndarray.__array_ufunc__``, thus allowing ``A`` and ``B`` to collaborate.
+
+.. _array-wrap:
+
+``__array_wrap__`` for ufuncs and other functions
+-------------------------------------------------
+
+Prior to numpy 1.13, the behaviour of ufuncs could only be tuned using
+``__array_wrap__`` and ``__array_prepare__``. These two allowed one to
+change the output type of a ufunc, but, in contrast to
+``__array_ufunc__``, did not allow one to make any changes to the inputs.
+It is hoped to eventually deprecate these, but ``__array_wrap__`` is also
+used by other numpy functions and methods, such as ``squeeze``, so at the
+present time is still needed for full functionality.
+
+Conceptually, ``__array_wrap__`` "wraps up the action" in the sense of
+allowing a subclass to set the type of the return value and update
+attributes and metadata.  Let's show how this works with an example.  First
+we return to the simpler example subclass, but with a different name and
+some print statements:
+
+.. testcode::
+
+  import numpy as np
+
+  class MySubClass(np.ndarray):
+
+      def __new__(cls, input_array, info=None):
+          obj = np.asarray(input_array).view(cls)
+          obj.info = info
+          return obj
+
+      def __array_finalize__(self, obj):
+          print('In __array_finalize__:')
+          print('   self is %s' % repr(self))
+          print('   obj is %s' % repr(obj))
+          if obj is None: return
+          self.info = getattr(obj, 'info', None)
+
+      def __array_wrap__(self, out_arr, context=None):
+          print('In __array_wrap__:')
+          print('   self is %s' % repr(self))
+          print('   arr is %s' % repr(out_arr))
+          # then just call the parent
+          return super(MySubClass, self).__array_wrap__(self, out_arr, context)
+
+We run a ufunc on an instance of our new array:
+
+>>> obj = MySubClass(np.arange(5), info='spam')
+In __array_finalize__:
+   self is MySubClass([0, 1, 2, 3, 4])
+   obj is array([0, 1, 2, 3, 4])
+>>> arr2 = np.arange(5)+1
+>>> ret = np.add(arr2, obj)
+In __array_wrap__:
+   self is MySubClass([0, 1, 2, 3, 4])
+   arr is array([1, 3, 5, 7, 9])
+In __array_finalize__:
+   self is MySubClass([1, 3, 5, 7, 9])
+   obj is MySubClass([0, 1, 2, 3, 4])
+>>> ret
+MySubClass([1, 3, 5, 7, 9])
+>>> ret.info
+'spam'
+
+Note that the ufunc (``np.add``) has called the ``__array_wrap__`` method
+with arguments ``self`` as ``obj``, and ``out_arr`` as the (ndarray) result
+of the addition.  In turn, the default ``__array_wrap__``
+(``ndarray.__array_wrap__``) has cast the result to class ``MySubClass``,
+and called ``__array_finalize__`` - hence the copying of the ``info``
+attribute.  This has all happened at the C level.
+
+But, we could do anything we wanted:
+
+.. testcode::
+
+  class SillySubClass(np.ndarray):
+
+      def __array_wrap__(self, arr, context=None):
+          return 'I lost your data'
+
+>>> arr1 = np.arange(5)
+>>> obj = arr1.view(SillySubClass)
+>>> arr2 = np.arange(5)
+>>> ret = np.multiply(obj, arr2)
+>>> ret
+'I lost your data'
+
+So, by defining a specific ``__array_wrap__`` method for our subclass,
+we can tweak the output from ufuncs. The ``__array_wrap__`` method
+requires ``self``, then an argument - which is the result of the ufunc -
+and an optional parameter *context*. This parameter is returned by
+ufuncs as a 3-element tuple: (name of the ufunc, arguments of the ufunc,
+domain of the ufunc), but is not set by other numpy functions. Though,
+as seen above, it is possible to do otherwise, ``__array_wrap__`` should
+return an instance of its containing class.  See the masked array
+subclass for an implementation.
+
+In addition to ``__array_wrap__``, which is called on the way out of the
+ufunc, there is also an ``__array_prepare__`` method which is called on
+the way into the ufunc, after the output arrays are created but before any
+computation has been performed. The default implementation does nothing
+but pass through the array. ``__array_prepare__`` should not attempt to
+access the array data or resize the array, it is intended for setting the
+output array type, updating attributes and metadata, and performing any
+checks based on the input that may be desired before computation begins.
+Like ``__array_wrap__``, ``__array_prepare__`` must return an ndarray or
+subclass thereof or raise an error.
+
+Extra gotchas - custom ``__del__`` methods and ndarray.base
+-----------------------------------------------------------
+
+One of the problems that ndarray solves is keeping track of memory
+ownership of ndarrays and their views.  Consider the case where we have
+created an ndarray, ``arr`` and have taken a slice with ``v = arr[1:]``.
+The two objects are looking at the same memory.  NumPy keeps track of
+where the data came from for a particular array or view, with the
+``base`` attribute:
+
+>>> # A normal ndarray, that owns its own data
+>>> arr = np.zeros((4,))
+>>> # In this case, base is None
+>>> arr.base is None
+True
+>>> # We take a view
+>>> v1 = arr[1:]
+>>> # base now points to the array that it derived from
+>>> v1.base is arr
+True
+>>> # Take a view of a view
+>>> v2 = v1[1:]
+>>> # base points to the view it derived from
+>>> v2.base is v1
+True
+
+In general, if the array owns its own memory, as for ``arr`` in this
+case, then ``arr.base`` will be None - there are some exceptions to this
+- see the numpy book for more details.
+
+The ``base`` attribute is useful in being able to tell whether we have
+a view or the original array.  This in turn can be useful if we need
+to know whether or not to do some specific cleanup when the subclassed
+array is deleted.  For example, we may only want to do the cleanup if
+the original array is deleted, but not the views.  For an example of
+how this can work, have a look at the ``memmap`` class in
+``numpy.core``.
+
+Subclassing and Downstream Compatibility
+----------------------------------------
+
+When sub-classing ``ndarray`` or creating duck-types that mimic the ``ndarray``
+interface, it is your responsibility to decide how aligned your APIs will be
+with those of numpy. For convenience, many numpy functions that have a corresponding
+``ndarray`` method (e.g., ``sum``, ``mean``, ``take``, ``reshape``) work by checking
+if the first argument to a function has a method of the same name. If it exists, the
+method is called instead of coercing the arguments to a numpy array.
+
+For example, if you want your sub-class or duck-type to be compatible with
+numpy's ``sum`` function, the method signature for this object's ``sum`` method
+should be the following:
+
+.. testcode::
+
+    def sum(self, axis=None, dtype=None, out=None, keepdims=False):
+    ...
+
+This is the exact same method signature for ``np.sum``, so now if a user calls
+``np.sum`` on this object, numpy will call the object's own ``sum`` method and
+pass in these arguments enumerated above in the signature, and no errors will
+be raised because the signatures are completely compatible with each other.
+
+If, however, you decide to deviate from this signature and do something like this:
+
+.. testcode::
+
+   def sum(self, axis=None, dtype=None):
+   ...
+
+This object is no longer compatible with ``np.sum`` because if you call ``np.sum``,
+it will pass in unexpected arguments ``out`` and ``keepdims``, causing a TypeError
+to be raised.
+
+If you wish to maintain compatibility with numpy and its subsequent versions (which
+might add new keyword arguments) but do not want to surface all of numpy's arguments,
+your function's signature should accept ``**kwargs``. For example:
+
+.. testcode::
+
+   def sum(self, axis=None, dtype=None, **unused_kwargs):
+   ...
+
+This object is now compatible with ``np.sum`` again because any extraneous arguments
+(i.e. keywords that are not ``axis`` or ``dtype``) will be hidden away in the
+``**unused_kwargs`` parameter.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/doc/ufuncs.py b/venv/Lib/site-packages/numpy/doc/ufuncs.py
new file mode 100644
index 000000000..eecc15083
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/doc/ufuncs.py
@@ -0,0 +1,137 @@
+"""
+===================
+Universal Functions
+===================
+
+Ufuncs are, generally speaking, mathematical functions or operations that are
+applied element-by-element to the contents of an array. That is, the result
+in each output array element only depends on the value in the corresponding
+input array (or arrays) and on no other array elements. NumPy comes with a
+large suite of ufuncs, and scipy extends that suite substantially. The simplest
+example is the addition operator: ::
+
+ >>> np.array([0,2,3,4]) + np.array([1,1,-1,2])
+ array([1, 3, 2, 6])
+
+The ufunc module lists all the available ufuncs in numpy. Documentation on
+the specific ufuncs may be found in those modules. This documentation is
+intended to address the more general aspects of ufuncs common to most of
+them. All of the ufuncs that make use of Python operators (e.g., +, -, etc.)
+have equivalent functions defined (e.g. add() for +)
+
+Type coercion
+=============
+
+What happens when a binary operator (e.g., +,-,\\*,/, etc) deals with arrays of
+two different types? What is the type of the result? Typically, the result is
+the higher of the two types. For example: ::
+
+ float32 + float64 -> float64
+ int8 + int32 -> int32
+ int16 + float32 -> float32
+ float32 + complex64 -> complex64
+
+There are some less obvious cases generally involving mixes of types
+(e.g. uints, ints and floats) where equal bit sizes for each are not
+capable of saving all the information in a different type of equivalent
+bit size. Some examples are int32 vs float32 or uint32 vs int32.
+Generally, the result is the higher type of larger size than both
+(if available). So: ::
+
+ int32 + float32 -> float64
+ uint32 + int32 -> int64
+
+Finally, the type coercion behavior when expressions involve Python
+scalars is different than that seen for arrays. Since Python has a
+limited number of types, combining a Python int with a dtype=np.int8
+array does not coerce to the higher type but instead, the type of the
+array prevails. So the rules for Python scalars combined with arrays is
+that the result will be that of the array equivalent the Python scalar
+if the Python scalar is of a higher 'kind' than the array (e.g., float
+vs. int), otherwise the resultant type will be that of the array.
+For example: ::
+
+  Python int + int8 -> int8
+  Python float + int8 -> float64
+
+ufunc methods
+=============
+
+Binary ufuncs support 4 methods.
+
+**.reduce(arr)** applies the binary operator to elements of the array in
+  sequence. For example: ::
+
+ >>> np.add.reduce(np.arange(10))  # adds all elements of array
+ 45
+
+For multidimensional arrays, the first dimension is reduced by default: ::
+
+ >>> np.add.reduce(np.arange(10).reshape(2,5))
+     array([ 5,  7,  9, 11, 13])
+
+The axis keyword can be used to specify different axes to reduce: ::
+
+ >>> np.add.reduce(np.arange(10).reshape(2,5),axis=1)
+ array([10, 35])
+
+**.accumulate(arr)** applies the binary operator and generates an an
+equivalently shaped array that includes the accumulated amount for each
+element of the array. A couple examples: ::
+
+ >>> np.add.accumulate(np.arange(10))
+ array([ 0,  1,  3,  6, 10, 15, 21, 28, 36, 45])
+ >>> np.multiply.accumulate(np.arange(1,9))
+ array([    1,     2,     6,    24,   120,   720,  5040, 40320])
+
+The behavior for multidimensional arrays is the same as for .reduce(),
+as is the use of the axis keyword).
+
+**.reduceat(arr,indices)** allows one to apply reduce to selected parts
+  of an array. It is a difficult method to understand. See the documentation
+  at:
+
+**.outer(arr1,arr2)** generates an outer operation on the two arrays arr1 and
+  arr2. It will work on multidimensional arrays (the shape of the result is
+  the concatenation of the two input shapes.: ::
+
+ >>> np.multiply.outer(np.arange(3),np.arange(4))
+ array([[0, 0, 0, 0],
+        [0, 1, 2, 3],
+        [0, 2, 4, 6]])
+
+Output arguments
+================
+
+All ufuncs accept an optional output array. The array must be of the expected
+output shape. Beware that if the type of the output array is of a different
+(and lower) type than the output result, the results may be silently truncated
+or otherwise corrupted in the downcast to the lower type. This usage is useful
+when one wants to avoid creating large temporary arrays and instead allows one
+to reuse the same array memory repeatedly (at the expense of not being able to
+use more convenient operator notation in expressions). Note that when the
+output argument is used, the ufunc still returns a reference to the result.
+
+ >>> x = np.arange(2)
+ >>> np.add(np.arange(2),np.arange(2.),x)
+ array([0, 2])
+ >>> x
+ array([0, 2])
+
+and & or as ufuncs
+==================
+
+Invariably people try to use the python 'and' and 'or' as logical operators
+(and quite understandably). But these operators do not behave as normal
+operators since Python treats these quite differently. They cannot be
+overloaded with array equivalents. Thus using 'and' or 'or' with an array
+results in an error. There are two alternatives:
+
+ 1) use the ufunc functions logical_and() and logical_or().
+ 2) use the bitwise operators & and \\|. The drawback of these is that if
+    the arguments to these operators are not boolean arrays, the result is
+    likely incorrect. On the other hand, most usages of logical_and and
+    logical_or are with boolean arrays. As long as one is careful, this is
+    a convenient way to apply these operators.
+
+"""
diff --git a/venv/Lib/site-packages/numpy/dual.py b/venv/Lib/site-packages/numpy/dual.py
new file mode 100644
index 000000000..92afec52d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/dual.py
@@ -0,0 +1,69 @@
+"""
+Aliases for functions which may be accelerated by Scipy.
+
+Scipy_ can be built to use accelerated or otherwise improved libraries
+for FFTs, linear algebra, and special functions. This module allows
+developers to transparently support these accelerated functions when
+scipy is available but still support users who have only installed
+NumPy.
+
+.. _Scipy : https://www.scipy.org
+
+"""
+# This module should be used for functions both in numpy and scipy if
+#  you want to use the numpy version if available but the scipy version
+#  otherwise.
+#  Usage  --- from numpy.dual import fft, inv
+
+__all__ = ['fft', 'ifft', 'fftn', 'ifftn', 'fft2', 'ifft2',
+           'norm', 'inv', 'svd', 'solve', 'det', 'eig', 'eigvals',
+           'eigh', 'eigvalsh', 'lstsq', 'pinv', 'cholesky', 'i0']
+
+import numpy.linalg as linpkg
+import numpy.fft as fftpkg
+from numpy.lib import i0
+import sys
+
+
+fft = fftpkg.fft
+ifft = fftpkg.ifft
+fftn = fftpkg.fftn
+ifftn = fftpkg.ifftn
+fft2 = fftpkg.fft2
+ifft2 = fftpkg.ifft2
+
+norm = linpkg.norm
+inv = linpkg.inv
+svd = linpkg.svd
+solve = linpkg.solve
+det = linpkg.det
+eig = linpkg.eig
+eigvals = linpkg.eigvals
+eigh = linpkg.eigh
+eigvalsh = linpkg.eigvalsh
+lstsq = linpkg.lstsq
+pinv = linpkg.pinv
+cholesky = linpkg.cholesky
+
+_restore_dict = {}
+
+def register_func(name, func):
+    if name not in __all__:
+        raise ValueError("{} not a dual function.".format(name))
+    f = sys._getframe(0).f_globals
+    _restore_dict[name] = f[name]
+    f[name] = func
+
+def restore_func(name):
+    if name not in __all__:
+        raise ValueError("{} not a dual function.".format(name))
+    try:
+        val = _restore_dict[name]
+    except KeyError:
+        return
+    else:
+        sys._getframe(0).f_globals[name] = val
+
+def restore_all():
+    for name in _restore_dict.keys():
+        restore_func(name)
diff --git a/venv/Lib/site-packages/numpy/f2py/__init__.py b/venv/Lib/site-packages/numpy/f2py/__init__.py
new file mode 100644
index 000000000..949bac0ff
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/__init__.py
@@ -0,0 +1,118 @@
+#!/usr/bin/env python3
+"""Fortran to Python Interface Generator.
+
+"""
+__all__ = ['run_main', 'compile', 'f2py_testing']
+
+import sys
+import subprocess
+import os
+
+from . import f2py2e
+from . import f2py_testing
+from . import diagnose
+
+run_main = f2py2e.run_main
+main = f2py2e.main
+
+
+def compile(source,
+            modulename='untitled',
+            extra_args='',
+            verbose=True,
+            source_fn=None,
+            extension='.f'
+           ):
+    """
+    Build extension module from a Fortran 77 source string with f2py.
+
+    Parameters
+    ----------
+    source : str or bytes
+        Fortran source of module / subroutine to compile
+
+        .. versionchanged:: 1.16.0
+           Accept str as well as bytes
+
+    modulename : str, optional
+        The name of the compiled python module
+    extra_args : str or list, optional
+        Additional parameters passed to f2py
+
+        .. versionchanged:: 1.16.0
+            A list of args may also be provided.
+
+    verbose : bool, optional
+        Print f2py output to screen
+    source_fn : str, optional
+        Name of the file where the fortran source is written.
+        The default is to use a temporary file with the extension
+        provided by the `extension` parameter
+    extension : {'.f', '.f90'}, optional
+        Filename extension if `source_fn` is not provided.
+        The extension tells which fortran standard is used.
+        The default is `.f`, which implies F77 standard.
+
+        .. versionadded:: 1.11.0
+
+    Returns
+    -------
+    result : int
+        0 on success
+
+    Examples
+    --------
+    .. include:: compile_session.dat
+        :literal:
+
+    """
+    import tempfile
+    import shlex
+
+    if source_fn is None:
+        f, fname = tempfile.mkstemp(suffix=extension)
+        # f is a file descriptor so need to close it
+        # carefully -- not with .close() directly
+        os.close(f)
+    else:
+        fname = source_fn
+
+    if not isinstance(source, str):
+        source = str(source, 'utf-8')
+    try:
+        with open(fname, 'w') as f:
+            f.write(source)
+
+        args = ['-c', '-m', modulename, f.name]
+
+        if isinstance(extra_args, str):
+            is_posix = (os.name == 'posix')
+            extra_args = shlex.split(extra_args, posix=is_posix)
+
+        args.extend(extra_args)
+
+        c = [sys.executable,
+             '-c',
+             'import numpy.f2py as f2py2e;f2py2e.main()'] + args
+        try:
+            output = subprocess.check_output(c)
+        except subprocess.CalledProcessError as exc:
+            status = exc.returncode
+            output = ''
+        except OSError:
+            # preserve historic status code used by exec_command()
+            status = 127
+            output = ''
+        else:
+            status = 0
+            output = output.decode()
+        if verbose:
+            print(output)
+    finally:
+        if source_fn is None:
+            os.remove(fname)
+    return status
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/f2py/__main__.py b/venv/Lib/site-packages/numpy/f2py/__main__.py
new file mode 100644
index 000000000..c6115070e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/__main__.py
@@ -0,0 +1,4 @@
+# See http://cens.ioc.ee/projects/f2py2e/
+from numpy.f2py.f2py2e import main
+
+main()
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..3aeed8028
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/__main__.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/__main__.cpython-36.pyc
new file mode 100644
index 000000000..973df4509
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/__main__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/__version__.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/__version__.cpython-36.pyc
new file mode 100644
index 000000000..9e370737b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/__version__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/auxfuncs.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/auxfuncs.cpython-36.pyc
new file mode 100644
index 000000000..10f151b10
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/auxfuncs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/capi_maps.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/capi_maps.cpython-36.pyc
new file mode 100644
index 000000000..2346d9378
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/capi_maps.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/cb_rules.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/cb_rules.cpython-36.pyc
new file mode 100644
index 000000000..d0d75b7bb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/cb_rules.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/cfuncs.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/cfuncs.cpython-36.pyc
new file mode 100644
index 000000000..cd048b8ad
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/cfuncs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/common_rules.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/common_rules.cpython-36.pyc
new file mode 100644
index 000000000..383a03f26
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/common_rules.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/crackfortran.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/crackfortran.cpython-36.pyc
new file mode 100644
index 000000000..b7626b3ad
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/crackfortran.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/diagnose.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/diagnose.cpython-36.pyc
new file mode 100644
index 000000000..d65ac1dad
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/diagnose.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py2e.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py2e.cpython-36.pyc
new file mode 100644
index 000000000..32e6c5c35
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py2e.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py_testing.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py_testing.cpython-36.pyc
new file mode 100644
index 000000000..534921da4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/f2py_testing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/f90mod_rules.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/f90mod_rules.cpython-36.pyc
new file mode 100644
index 000000000..de1ab772a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/f90mod_rules.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/func2subr.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/func2subr.cpython-36.pyc
new file mode 100644
index 000000000..56635ea99
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/func2subr.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/rules.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/rules.cpython-36.pyc
new file mode 100644
index 000000000..4d2b9c9ac
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/rules.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..cf098cd24
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__pycache__/use_rules.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/__pycache__/use_rules.cpython-36.pyc
new file mode 100644
index 000000000..ea479d049
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/__pycache__/use_rules.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/__version__.py b/venv/Lib/site-packages/numpy/f2py/__version__.py
new file mode 100644
index 000000000..104c2e1a8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/__version__.py
@@ -0,0 +1,8 @@
+major = 2
+
+try:
+    from __svn_version__ import version
+    version_info = (major, version)
+    version = '%s_%s' % version_info
+except (ImportError, ValueError):
+    version = str(major)
diff --git a/venv/Lib/site-packages/numpy/f2py/auxfuncs.py b/venv/Lib/site-packages/numpy/f2py/auxfuncs.py
new file mode 100644
index 000000000..80b150655
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/auxfuncs.py
@@ -0,0 +1,852 @@
+#!/usr/bin/env python3
+"""
+
+Auxiliary functions for f2py2e.
+
+Copyright 1999,2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy (BSD style) LICENSE.
+
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/07/24 19:01:55 $
+Pearu Peterson
+
+"""
+import pprint
+import sys
+import types
+from functools import reduce
+
+from . import __version__
+from . import cfuncs
+
+__all__ = [
+    'applyrules', 'debugcapi', 'dictappend', 'errmess', 'gentitle',
+    'getargs2', 'getcallprotoargument', 'getcallstatement',
+    'getfortranname', 'getpymethoddef', 'getrestdoc', 'getusercode',
+    'getusercode1', 'hasbody', 'hascallstatement', 'hascommon',
+    'hasexternals', 'hasinitvalue', 'hasnote', 'hasresultnote',
+    'isallocatable', 'isarray', 'isarrayofstrings', 'iscomplex',
+    'iscomplexarray', 'iscomplexfunction', 'iscomplexfunction_warn',
+    'isdouble', 'isdummyroutine', 'isexternal', 'isfunction',
+    'isfunction_wrap', 'isint1array', 'isinteger', 'isintent_aux',
+    'isintent_c', 'isintent_callback', 'isintent_copy', 'isintent_dict',
+    'isintent_hide', 'isintent_in', 'isintent_inout', 'isintent_inplace',
+    'isintent_nothide', 'isintent_out', 'isintent_overwrite', 'islogical',
+    'islogicalfunction', 'islong_complex', 'islong_double',
+    'islong_doublefunction', 'islong_long', 'islong_longfunction',
+    'ismodule', 'ismoduleroutine', 'isoptional', 'isprivate', 'isrequired',
+    'isroutine', 'isscalar', 'issigned_long_longarray', 'isstring',
+    'isstringarray', 'isstringfunction', 'issubroutine',
+    'issubroutine_wrap', 'isthreadsafe', 'isunsigned', 'isunsigned_char',
+    'isunsigned_chararray', 'isunsigned_long_long',
+    'isunsigned_long_longarray', 'isunsigned_short',
+    'isunsigned_shortarray', 'l_and', 'l_not', 'l_or', 'outmess',
+    'replace', 'show', 'stripcomma', 'throw_error',
+]
+
+
+f2py_version = __version__.version
+
+
+errmess = sys.stderr.write
+show = pprint.pprint
+
+options = {}
+debugoptions = []
+wrapfuncs = 1
+
+
+def outmess(t):
+    if options.get('verbose', 1):
+        sys.stdout.write(t)
+
+
+def debugcapi(var):
+    return 'capi' in debugoptions
+
+
+def _isstring(var):
+    return 'typespec' in var and var['typespec'] == 'character' and \
+           not isexternal(var)
+
+
+def isstring(var):
+    return _isstring(var) and not isarray(var)
+
+
+def ischaracter(var):
+    return isstring(var) and 'charselector' not in var
+
+
+def isstringarray(var):
+    return isarray(var) and _isstring(var)
+
+
+def isarrayofstrings(var):
+    # leaving out '*' for now so that `character*(*) a(m)` and `character
+    # a(m,*)` are treated differently. Luckily `character**` is illegal.
+    return isstringarray(var) and var['dimension'][-1] == '(*)'
+
+
+def isarray(var):
+    return 'dimension' in var and not isexternal(var)
+
+
+def isscalar(var):
+    return not (isarray(var) or isstring(var) or isexternal(var))
+
+
+def iscomplex(var):
+    return isscalar(var) and \
+           var.get('typespec') in ['complex', 'double complex']
+
+
+def islogical(var):
+    return isscalar(var) and var.get('typespec') == 'logical'
+
+
+def isinteger(var):
+    return isscalar(var) and var.get('typespec') == 'integer'
+
+
+def isreal(var):
+    return isscalar(var) and var.get('typespec') == 'real'
+
+
+def get_kind(var):
+    try:
+        return var['kindselector']['*']
+    except KeyError:
+        try:
+            return var['kindselector']['kind']
+        except KeyError:
+            pass
+
+
+def islong_long(var):
+    if not isscalar(var):
+        return 0
+    if var.get('typespec') not in ['integer', 'logical']:
+        return 0
+    return get_kind(var) == '8'
+
+
+def isunsigned_char(var):
+    if not isscalar(var):
+        return 0
+    if var.get('typespec') != 'integer':
+        return 0
+    return get_kind(var) == '-1'
+
+
+def isunsigned_short(var):
+    if not isscalar(var):
+        return 0
+    if var.get('typespec') != 'integer':
+        return 0
+    return get_kind(var) == '-2'
+
+
+def isunsigned(var):
+    if not isscalar(var):
+        return 0
+    if var.get('typespec') != 'integer':
+        return 0
+    return get_kind(var) == '-4'
+
+
+def isunsigned_long_long(var):
+    if not isscalar(var):
+        return 0
+    if var.get('typespec') != 'integer':
+        return 0
+    return get_kind(var) == '-8'
+
+
+def isdouble(var):
+    if not isscalar(var):
+        return 0
+    if not var.get('typespec') == 'real':
+        return 0
+    return get_kind(var) == '8'
+
+
+def islong_double(var):
+    if not isscalar(var):
+        return 0
+    if not var.get('typespec') == 'real':
+        return 0
+    return get_kind(var) == '16'
+
+
+def islong_complex(var):
+    if not iscomplex(var):
+        return 0
+    return get_kind(var) == '32'
+
+
+def iscomplexarray(var):
+    return isarray(var) and \
+           var.get('typespec') in ['complex', 'double complex']
+
+
+def isint1array(var):
+    return isarray(var) and var.get('typespec') == 'integer' \
+        and get_kind(var) == '1'
+
+
+def isunsigned_chararray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '-1'
+
+
+def isunsigned_shortarray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '-2'
+
+
+def isunsignedarray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '-4'
+
+
+def isunsigned_long_longarray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '-8'
+
+
+def issigned_chararray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '1'
+
+
+def issigned_shortarray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '2'
+
+
+def issigned_array(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '4'
+
+
+def issigned_long_longarray(var):
+    return isarray(var) and var.get('typespec') in ['integer', 'logical']\
+        and get_kind(var) == '8'
+
+
+def isallocatable(var):
+    return 'attrspec' in var and 'allocatable' in var['attrspec']
+
+
+def ismutable(var):
+    return not ('dimension' not in var or isstring(var))
+
+
+def ismoduleroutine(rout):
+    return 'modulename' in rout
+
+
+def ismodule(rout):
+    return 'block' in rout and 'module' == rout['block']
+
+
+def isfunction(rout):
+    return 'block' in rout and 'function' == rout['block']
+
+def isfunction_wrap(rout):
+    if isintent_c(rout):
+        return 0
+    return wrapfuncs and isfunction(rout) and (not isexternal(rout))
+
+
+def issubroutine(rout):
+    return 'block' in rout and 'subroutine' == rout['block']
+
+
+def issubroutine_wrap(rout):
+    if isintent_c(rout):
+        return 0
+    return issubroutine(rout) and hasassumedshape(rout)
+
+
+def hasassumedshape(rout):
+    if rout.get('hasassumedshape'):
+        return True
+    for a in rout['args']:
+        for d in rout['vars'].get(a, {}).get('dimension', []):
+            if d == ':':
+                rout['hasassumedshape'] = True
+                return True
+    return False
+
+
+def isroutine(rout):
+    return isfunction(rout) or issubroutine(rout)
+
+
+def islogicalfunction(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return islogical(rout['vars'][a])
+    return 0
+
+
+def islong_longfunction(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return islong_long(rout['vars'][a])
+    return 0
+
+
+def islong_doublefunction(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return islong_double(rout['vars'][a])
+    return 0
+
+
+def iscomplexfunction(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return iscomplex(rout['vars'][a])
+    return 0
+
+
+def iscomplexfunction_warn(rout):
+    if iscomplexfunction(rout):
+        outmess("""\
+    **************************************************************
+        Warning: code with a function returning complex value
+        may not work correctly with your Fortran compiler.
+        Run the following test before using it in your applications:
+        $(f2py install dir)/test-site/{b/runme_scalar,e/runme}
+        When using GNU gcc/g77 compilers, codes should work correctly.
+    **************************************************************\n""")
+        return 1
+    return 0
+
+
+def isstringfunction(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return isstring(rout['vars'][a])
+    return 0
+
+
+def hasexternals(rout):
+    return 'externals' in rout and rout['externals']
+
+
+def isthreadsafe(rout):
+    return 'f2pyenhancements' in rout and \
+           'threadsafe' in rout['f2pyenhancements']
+
+
+def hasvariables(rout):
+    return 'vars' in rout and rout['vars']
+
+
+def isoptional(var):
+    return ('attrspec' in var and 'optional' in var['attrspec'] and
+            'required' not in var['attrspec']) and isintent_nothide(var)
+
+
+def isexternal(var):
+    return 'attrspec' in var and 'external' in var['attrspec']
+
+
+def isrequired(var):
+    return not isoptional(var) and isintent_nothide(var)
+
+
+def isintent_in(var):
+    if 'intent' not in var:
+        return 1
+    if 'hide' in var['intent']:
+        return 0
+    if 'inplace' in var['intent']:
+        return 0
+    if 'in' in var['intent']:
+        return 1
+    if 'out' in var['intent']:
+        return 0
+    if 'inout' in var['intent']:
+        return 0
+    if 'outin' in var['intent']:
+        return 0
+    return 1
+
+
+def isintent_inout(var):
+    return ('intent' in var and ('inout' in var['intent'] or
+            'outin' in var['intent']) and 'in' not in var['intent'] and
+            'hide' not in var['intent'] and 'inplace' not in var['intent'])
+
+
+def isintent_out(var):
+    return 'out' in var.get('intent', [])
+
+
+def isintent_hide(var):
+    return ('intent' in var and ('hide' in var['intent'] or
+            ('out' in var['intent'] and 'in' not in var['intent'] and
+                (not l_or(isintent_inout, isintent_inplace)(var)))))
+
+def isintent_nothide(var):
+    return not isintent_hide(var)
+
+
+def isintent_c(var):
+    return 'c' in var.get('intent', [])
+
+
+def isintent_cache(var):
+    return 'cache' in var.get('intent', [])
+
+
+def isintent_copy(var):
+    return 'copy' in var.get('intent', [])
+
+
+def isintent_overwrite(var):
+    return 'overwrite' in var.get('intent', [])
+
+
+def isintent_callback(var):
+    return 'callback' in var.get('intent', [])
+
+
+def isintent_inplace(var):
+    return 'inplace' in var.get('intent', [])
+
+
+def isintent_aux(var):
+    return 'aux' in var.get('intent', [])
+
+
+def isintent_aligned4(var):
+    return 'aligned4' in var.get('intent', [])
+
+
+def isintent_aligned8(var):
+    return 'aligned8' in var.get('intent', [])
+
+
+def isintent_aligned16(var):
+    return 'aligned16' in var.get('intent', [])
+
+isintent_dict = {isintent_in: 'INTENT_IN', isintent_inout: 'INTENT_INOUT',
+                 isintent_out: 'INTENT_OUT', isintent_hide: 'INTENT_HIDE',
+                 isintent_cache: 'INTENT_CACHE',
+                 isintent_c: 'INTENT_C', isoptional: 'OPTIONAL',
+                 isintent_inplace: 'INTENT_INPLACE',
+                 isintent_aligned4: 'INTENT_ALIGNED4',
+                 isintent_aligned8: 'INTENT_ALIGNED8',
+                 isintent_aligned16: 'INTENT_ALIGNED16',
+                 }
+
+
+def isprivate(var):
+    return 'attrspec' in var and 'private' in var['attrspec']
+
+
+def hasinitvalue(var):
+    return '=' in var
+
+
+def hasinitvalueasstring(var):
+    if not hasinitvalue(var):
+        return 0
+    return var['='][0] in ['"', "'"]
+
+
+def hasnote(var):
+    return 'note' in var
+
+
+def hasresultnote(rout):
+    if not isfunction(rout):
+        return 0
+    if 'result' in rout:
+        a = rout['result']
+    else:
+        a = rout['name']
+    if a in rout['vars']:
+        return hasnote(rout['vars'][a])
+    return 0
+
+
+def hascommon(rout):
+    return 'common' in rout
+
+
+def containscommon(rout):
+    if hascommon(rout):
+        return 1
+    if hasbody(rout):
+        for b in rout['body']:
+            if containscommon(b):
+                return 1
+    return 0
+
+
+def containsmodule(block):
+    if ismodule(block):
+        return 1
+    if not hasbody(block):
+        return 0
+    for b in block['body']:
+        if containsmodule(b):
+            return 1
+    return 0
+
+
+def hasbody(rout):
+    return 'body' in rout
+
+
+def hascallstatement(rout):
+    return getcallstatement(rout) is not None
+
+
+def istrue(var):
+    return 1
+
+
+def isfalse(var):
+    return 0
+
+
+class F2PYError(Exception):
+    pass
+
+
+class throw_error:
+
+    def __init__(self, mess):
+        self.mess = mess
+
+    def __call__(self, var):
+        mess = '\n\n  var = %s\n  Message: %s\n' % (var, self.mess)
+        raise F2PYError(mess)
+
+
+def l_and(*f):
+    l, l2 = 'lambda v', []
+    for i in range(len(f)):
+        l = '%s,f%d=f[%d]' % (l, i, i)
+        l2.append('f%d(v)' % (i))
+    return eval('%s:%s' % (l, ' and '.join(l2)))
+
+
+def l_or(*f):
+    l, l2 = 'lambda v', []
+    for i in range(len(f)):
+        l = '%s,f%d=f[%d]' % (l, i, i)
+        l2.append('f%d(v)' % (i))
+    return eval('%s:%s' % (l, ' or '.join(l2)))
+
+
+def l_not(f):
+    return eval('lambda v,f=f:not f(v)')
+
+
+def isdummyroutine(rout):
+    try:
+        return rout['f2pyenhancements']['fortranname'] == ''
+    except KeyError:
+        return 0
+
+
+def getfortranname(rout):
+    try:
+        name = rout['f2pyenhancements']['fortranname']
+        if name == '':
+            raise KeyError
+        if not name:
+            errmess('Failed to use fortranname from %s\n' %
+                    (rout['f2pyenhancements']))
+            raise KeyError
+    except KeyError:
+        name = rout['name']
+    return name
+
+
+def getmultilineblock(rout, blockname, comment=1, counter=0):
+    try:
+        r = rout['f2pyenhancements'].get(blockname)
+    except KeyError:
+        return
+    if not r:
+        return
+    if counter > 0 and isinstance(r, str):
+        return
+    if isinstance(r, list):
+        if counter >= len(r):
+            return
+        r = r[counter]
+    if r[:3] == "'''":
+        if comment:
+            r = '\t/* start ' + blockname + \
+                ' multiline (' + repr(counter) + ') */\n' + r[3:]
+        else:
+            r = r[3:]
+        if r[-3:] == "'''":
+            if comment:
+                r = r[:-3] + '\n\t/* end multiline (' + repr(counter) + ')*/'
+            else:
+                r = r[:-3]
+        else:
+            errmess("%s multiline block should end with `'''`: %s\n"
+                    % (blockname, repr(r)))
+    return r
+
+
+def getcallstatement(rout):
+    return getmultilineblock(rout, 'callstatement')
+
+
+def getcallprotoargument(rout, cb_map={}):
+    r = getmultilineblock(rout, 'callprotoargument', comment=0)
+    if r:
+        return r
+    if hascallstatement(rout):
+        outmess(
+            'warning: callstatement is defined without callprotoargument\n')
+        return
+    from .capi_maps import getctype
+    arg_types, arg_types2 = [], []
+    if l_and(isstringfunction, l_not(isfunction_wrap))(rout):
+        arg_types.extend(['char*', 'size_t'])
+    for n in rout['args']:
+        var = rout['vars'][n]
+        if isintent_callback(var):
+            continue
+        if n in cb_map:
+            ctype = cb_map[n] + '_typedef'
+        else:
+            ctype = getctype(var)
+            if l_and(isintent_c, l_or(isscalar, iscomplex))(var):
+                pass
+            elif isstring(var):
+                pass
+            else:
+                ctype = ctype + '*'
+            if isstring(var) or isarrayofstrings(var):
+                arg_types2.append('size_t')
+        arg_types.append(ctype)
+
+    proto_args = ','.join(arg_types + arg_types2)
+    if not proto_args:
+        proto_args = 'void'
+    return proto_args
+
+
+def getusercode(rout):
+    return getmultilineblock(rout, 'usercode')
+
+
+def getusercode1(rout):
+    return getmultilineblock(rout, 'usercode', counter=1)
+
+
+def getpymethoddef(rout):
+    return getmultilineblock(rout, 'pymethoddef')
+
+
+def getargs(rout):
+    sortargs, args = [], []
+    if 'args' in rout:
+        args = rout['args']
+        if 'sortvars' in rout:
+            for a in rout['sortvars']:
+                if a in args:
+                    sortargs.append(a)
+            for a in args:
+                if a not in sortargs:
+                    sortargs.append(a)
+        else:
+            sortargs = rout['args']
+    return args, sortargs
+
+
+def getargs2(rout):
+    sortargs, args = [], rout.get('args', [])
+    auxvars = [a for a in rout['vars'].keys() if isintent_aux(rout['vars'][a])
+               and a not in args]
+    args = auxvars + args
+    if 'sortvars' in rout:
+        for a in rout['sortvars']:
+            if a in args:
+                sortargs.append(a)
+        for a in args:
+            if a not in sortargs:
+                sortargs.append(a)
+    else:
+        sortargs = auxvars + rout['args']
+    return args, sortargs
+
+
+def getrestdoc(rout):
+    if 'f2pymultilines' not in rout:
+        return None
+    k = None
+    if rout['block'] == 'python module':
+        k = rout['block'], rout['name']
+    return rout['f2pymultilines'].get(k, None)
+
+
+def gentitle(name):
+    l = (80 - len(name) - 6) // 2
+    return '/*%s %s %s*/' % (l * '*', name, l * '*')
+
+
+def flatlist(l):
+    if isinstance(l, list):
+        return reduce(lambda x, y, f=flatlist: x + f(y), l, [])
+    return [l]
+
+
+def stripcomma(s):
+    if s and s[-1] == ',':
+        return s[:-1]
+    return s
+
+
+def replace(str, d, defaultsep=''):
+    if isinstance(d, list):
+        return [replace(str, _m, defaultsep) for _m in d]
+    if isinstance(str, list):
+        return [replace(_m, d, defaultsep) for _m in str]
+    for k in 2 * list(d.keys()):
+        if k == 'separatorsfor':
+            continue
+        if 'separatorsfor' in d and k in d['separatorsfor']:
+            sep = d['separatorsfor'][k]
+        else:
+            sep = defaultsep
+        if isinstance(d[k], list):
+            str = str.replace('#%s#' % (k), sep.join(flatlist(d[k])))
+        else:
+            str = str.replace('#%s#' % (k), d[k])
+    return str
+
+
+def dictappend(rd, ar):
+    if isinstance(ar, list):
+        for a in ar:
+            rd = dictappend(rd, a)
+        return rd
+    for k in ar.keys():
+        if k[0] == '_':
+            continue
+        if k in rd:
+            if isinstance(rd[k], str):
+                rd[k] = [rd[k]]
+            if isinstance(rd[k], list):
+                if isinstance(ar[k], list):
+                    rd[k] = rd[k] + ar[k]
+                else:
+                    rd[k].append(ar[k])
+            elif isinstance(rd[k], dict):
+                if isinstance(ar[k], dict):
+                    if k == 'separatorsfor':
+                        for k1 in ar[k].keys():
+                            if k1 not in rd[k]:
+                                rd[k][k1] = ar[k][k1]
+                    else:
+                        rd[k] = dictappend(rd[k], ar[k])
+        else:
+            rd[k] = ar[k]
+    return rd
+
+
+def applyrules(rules, d, var={}):
+    ret = {}
+    if isinstance(rules, list):
+        for r in rules:
+            rr = applyrules(r, d, var)
+            ret = dictappend(ret, rr)
+            if '_break' in rr:
+                break
+        return ret
+    if '_check' in rules and (not rules['_check'](var)):
+        return ret
+    if 'need' in rules:
+        res = applyrules({'needs': rules['need']}, d, var)
+        if 'needs' in res:
+            cfuncs.append_needs(res['needs'])
+
+    for k in rules.keys():
+        if k == 'separatorsfor':
+            ret[k] = rules[k]
+            continue
+        if isinstance(rules[k], str):
+            ret[k] = replace(rules[k], d)
+        elif isinstance(rules[k], list):
+            ret[k] = []
+            for i in rules[k]:
+                ar = applyrules({k: i}, d, var)
+                if k in ar:
+                    ret[k].append(ar[k])
+        elif k[0] == '_':
+            continue
+        elif isinstance(rules[k], dict):
+            ret[k] = []
+            for k1 in rules[k].keys():
+                if isinstance(k1, types.FunctionType) and k1(var):
+                    if isinstance(rules[k][k1], list):
+                        for i in rules[k][k1]:
+                            if isinstance(i, dict):
+                                res = applyrules({'supertext': i}, d, var)
+                                if 'supertext' in res:
+                                    i = res['supertext']
+                                else:
+                                    i = ''
+                            ret[k].append(replace(i, d))
+                    else:
+                        i = rules[k][k1]
+                        if isinstance(i, dict):
+                            res = applyrules({'supertext': i}, d)
+                            if 'supertext' in res:
+                                i = res['supertext']
+                            else:
+                                i = ''
+                        ret[k].append(replace(i, d))
+        else:
+            errmess('applyrules: ignoring rule %s.\n' % repr(rules[k]))
+        if isinstance(ret[k], list):
+            if len(ret[k]) == 1:
+                ret[k] = ret[k][0]
+            if ret[k] == []:
+                del ret[k]
+    return ret
diff --git a/venv/Lib/site-packages/numpy/f2py/capi_maps.py b/venv/Lib/site-packages/numpy/f2py/capi_maps.py
new file mode 100644
index 000000000..fabbfc4c2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/capi_maps.py
@@ -0,0 +1,840 @@
+#!/usr/bin/env python3
+"""
+
+Copyright 1999,2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/05/06 10:57:33 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.60 $"[10:-1]
+
+from . import __version__
+f2py_version = __version__.version
+
+import copy
+import re
+import os
+from .crackfortran import markoutercomma
+from . import cb_rules
+
+# The environment provided by auxfuncs.py is needed for some calls to eval.
+# As the needed functions cannot be determined by static inspection of the
+# code, it is safest to use import * pending a major refactoring of f2py.
+from .auxfuncs import *
+
+__all__ = [
+    'getctype', 'getstrlength', 'getarrdims', 'getpydocsign',
+    'getarrdocsign', 'getinit', 'sign2map', 'routsign2map', 'modsign2map',
+    'cb_sign2map', 'cb_routsign2map', 'common_sign2map'
+]
+
+
+# Numarray and Numeric users should set this False
+using_newcore = True
+
+depargs = []
+lcb_map = {}
+lcb2_map = {}
+# forced casting: mainly caused by the fact that Python or Numeric
+#                 C/APIs do not support the corresponding C types.
+c2py_map = {'double': 'float',
+            'float': 'float',                          # forced casting
+            'long_double': 'float',                    # forced casting
+            'char': 'int',                             # forced casting
+            'signed_char': 'int',                      # forced casting
+            'unsigned_char': 'int',                    # forced casting
+            'short': 'int',                            # forced casting
+            'unsigned_short': 'int',                   # forced casting
+            'int': 'int',                              # (forced casting)
+            'long': 'int',
+            'long_long': 'long',
+            'unsigned': 'int',                         # forced casting
+            'complex_float': 'complex',                # forced casting
+            'complex_double': 'complex',
+            'complex_long_double': 'complex',          # forced casting
+            'string': 'string',
+            }
+c2capi_map = {'double': 'NPY_DOUBLE',
+              'float': 'NPY_FLOAT',
+              'long_double': 'NPY_DOUBLE',           # forced casting
+              'char': 'NPY_STRING',
+              'unsigned_char': 'NPY_UBYTE',
+              'signed_char': 'NPY_BYTE',
+              'short': 'NPY_SHORT',
+              'unsigned_short': 'NPY_USHORT',
+              'int': 'NPY_INT',
+              'unsigned': 'NPY_UINT',
+              'long': 'NPY_LONG',
+              'long_long': 'NPY_LONG',                # forced casting
+              'complex_float': 'NPY_CFLOAT',
+              'complex_double': 'NPY_CDOUBLE',
+              'complex_long_double': 'NPY_CDOUBLE',   # forced casting
+              'string': 'NPY_STRING'}
+
+# These new maps aren't used anywhere yet, but should be by default
+#  unless building numeric or numarray extensions.
+if using_newcore:
+    c2capi_map = {'double': 'NPY_DOUBLE',
+                  'float': 'NPY_FLOAT',
+                  'long_double': 'NPY_LONGDOUBLE',
+                  'char': 'NPY_BYTE',
+                  'unsigned_char': 'NPY_UBYTE',
+                  'signed_char': 'NPY_BYTE',
+                  'short': 'NPY_SHORT',
+                  'unsigned_short': 'NPY_USHORT',
+                  'int': 'NPY_INT',
+                  'unsigned': 'NPY_UINT',
+                  'long': 'NPY_LONG',
+                  'unsigned_long': 'NPY_ULONG',
+                  'long_long': 'NPY_LONGLONG',
+                  'unsigned_long_long': 'NPY_ULONGLONG',
+                  'complex_float': 'NPY_CFLOAT',
+                  'complex_double': 'NPY_CDOUBLE',
+                  'complex_long_double': 'NPY_CDOUBLE',
+                  'string':'NPY_STRING'
+
+                  }
+c2pycode_map = {'double': 'd',
+                'float': 'f',
+                'long_double': 'd',                       # forced casting
+                'char': '1',
+                'signed_char': '1',
+                'unsigned_char': 'b',
+                'short': 's',
+                'unsigned_short': 'w',
+                'int': 'i',
+                'unsigned': 'u',
+                'long': 'l',
+                'long_long': 'L',
+                'complex_float': 'F',
+                'complex_double': 'D',
+                'complex_long_double': 'D',               # forced casting
+                'string': 'c'
+                }
+if using_newcore:
+    c2pycode_map = {'double': 'd',
+                    'float': 'f',
+                    'long_double': 'g',
+                    'char': 'b',
+                    'unsigned_char': 'B',
+                    'signed_char': 'b',
+                    'short': 'h',
+                    'unsigned_short': 'H',
+                    'int': 'i',
+                    'unsigned': 'I',
+                    'long': 'l',
+                    'unsigned_long': 'L',
+                    'long_long': 'q',
+                    'unsigned_long_long': 'Q',
+                    'complex_float': 'F',
+                    'complex_double': 'D',
+                    'complex_long_double': 'G',
+                    'string': 'S'}
+c2buildvalue_map = {'double': 'd',
+                    'float': 'f',
+                    'char': 'b',
+                    'signed_char': 'b',
+                    'short': 'h',
+                    'int': 'i',
+                    'long': 'l',
+                    'long_long': 'L',
+                    'complex_float': 'N',
+                    'complex_double': 'N',
+                    'complex_long_double': 'N',
+                    'string': 'y'}
+
+if using_newcore:
+    # c2buildvalue_map=???
+    pass
+
+f2cmap_all = {'real': {'': 'float', '4': 'float', '8': 'double',
+                       '12': 'long_double', '16': 'long_double'},
+              'integer': {'': 'int', '1': 'signed_char', '2': 'short',
+                          '4': 'int', '8': 'long_long',
+                          '-1': 'unsigned_char', '-2': 'unsigned_short',
+                          '-4': 'unsigned', '-8': 'unsigned_long_long'},
+              'complex': {'': 'complex_float', '8': 'complex_float',
+                          '16': 'complex_double', '24': 'complex_long_double',
+                          '32': 'complex_long_double'},
+              'complexkind': {'': 'complex_float', '4': 'complex_float',
+                              '8': 'complex_double', '12': 'complex_long_double',
+                              '16': 'complex_long_double'},
+              'logical': {'': 'int', '1': 'char', '2': 'short', '4': 'int',
+                          '8': 'long_long'},
+              'double complex': {'': 'complex_double'},
+              'double precision': {'': 'double'},
+              'byte': {'': 'char'},
+              'character': {'': 'string'}
+              }
+
+f2cmap_default = copy.deepcopy(f2cmap_all)
+
+
+def load_f2cmap_file(f2cmap_file):
+    global f2cmap_all
+
+    f2cmap_all = copy.deepcopy(f2cmap_default)
+
+    if f2cmap_file is None:
+        # Default value
+        f2cmap_file = '.f2py_f2cmap'
+        if not os.path.isfile(f2cmap_file):
+            return
+
+    # User defined additions to f2cmap_all.
+    # f2cmap_file must contain a dictionary of dictionaries, only.  For
+    # example, {'real':{'low':'float'}} means that Fortran 'real(low)' is
+    # interpreted as C 'float'.  This feature is useful for F90/95 users if
+    # they use PARAMETERSs in type specifications.
+    try:
+        outmess('Reading f2cmap from {!r} ...\n'.format(f2cmap_file))
+        with open(f2cmap_file, 'r') as f:
+            d = eval(f.read(), {}, {})
+        for k, d1 in list(d.items()):
+            for k1 in list(d1.keys()):
+                d1[k1.lower()] = d1[k1]
+            d[k.lower()] = d[k]
+        for k in list(d.keys()):
+            if k not in f2cmap_all:
+                f2cmap_all[k] = {}
+            for k1 in list(d[k].keys()):
+                if d[k][k1] in c2py_map:
+                    if k1 in f2cmap_all[k]:
+                        outmess(
+                            "\tWarning: redefinition of {'%s':{'%s':'%s'->'%s'}}\n" % (k, k1, f2cmap_all[k][k1], d[k][k1]))
+                    f2cmap_all[k][k1] = d[k][k1]
+                    outmess('\tMapping "%s(kind=%s)" to "%s"\n' %
+                            (k, k1, d[k][k1]))
+                else:
+                    errmess("\tIgnoring map {'%s':{'%s':'%s'}}: '%s' must be in %s\n" % (
+                        k, k1, d[k][k1], d[k][k1], list(c2py_map.keys())))
+        outmess('Successfully applied user defined f2cmap changes\n')
+    except Exception as msg:
+        errmess(
+            'Failed to apply user defined f2cmap changes: %s. Skipping.\n' % (msg))
+
+cformat_map = {'double': '%g',
+               'float': '%g',
+               'long_double': '%Lg',
+               'char': '%d',
+               'signed_char': '%d',
+               'unsigned_char': '%hhu',
+               'short': '%hd',
+               'unsigned_short': '%hu',
+               'int': '%d',
+               'unsigned': '%u',
+               'long': '%ld',
+               'unsigned_long': '%lu',
+               'long_long': '%ld',
+               'complex_float': '(%g,%g)',
+               'complex_double': '(%g,%g)',
+               'complex_long_double': '(%Lg,%Lg)',
+               'string': '%s',
+               }
+
+# Auxiliary functions
+
+
+def getctype(var):
+    """
+    Determines C type
+    """
+    ctype = 'void'
+    if isfunction(var):
+        if 'result' in var:
+            a = var['result']
+        else:
+            a = var['name']
+        if a in var['vars']:
+            return getctype(var['vars'][a])
+        else:
+            errmess('getctype: function %s has no return value?!\n' % a)
+    elif issubroutine(var):
+        return ctype
+    elif 'typespec' in var and var['typespec'].lower() in f2cmap_all:
+        typespec = var['typespec'].lower()
+        f2cmap = f2cmap_all[typespec]
+        ctype = f2cmap['']  # default type
+        if 'kindselector' in var:
+            if '*' in var['kindselector']:
+                try:
+                    ctype = f2cmap[var['kindselector']['*']]
+                except KeyError:
+                    errmess('getctype: "%s %s %s" not supported.\n' %
+                            (var['typespec'], '*', var['kindselector']['*']))
+            elif 'kind' in var['kindselector']:
+                if typespec + 'kind' in f2cmap_all:
+                    f2cmap = f2cmap_all[typespec + 'kind']
+                try:
+                    ctype = f2cmap[var['kindselector']['kind']]
+                except KeyError:
+                    if typespec in f2cmap_all:
+                        f2cmap = f2cmap_all[typespec]
+                    try:
+                        ctype = f2cmap[str(var['kindselector']['kind'])]
+                    except KeyError:
+                        errmess('getctype: "%s(kind=%s)" is mapped to C "%s" (to override define dict(%s = dict(%s="<C typespec>")) in %s/.f2py_f2cmap file).\n'
+                                % (typespec, var['kindselector']['kind'], ctype,
+                                   typespec, var['kindselector']['kind'], os.getcwd()))
+
+    else:
+        if not isexternal(var):
+            errmess(
+                'getctype: No C-type found in "%s", assuming void.\n' % var)
+    return ctype
+
+
+def getstrlength(var):
+    if isstringfunction(var):
+        if 'result' in var:
+            a = var['result']
+        else:
+            a = var['name']
+        if a in var['vars']:
+            return getstrlength(var['vars'][a])
+        else:
+            errmess('getstrlength: function %s has no return value?!\n' % a)
+    if not isstring(var):
+        errmess(
+            'getstrlength: expected a signature of a string but got: %s\n' % (repr(var)))
+    len = '1'
+    if 'charselector' in var:
+        a = var['charselector']
+        if '*' in a:
+            len = a['*']
+        elif 'len' in a:
+            len = a['len']
+    if re.match(r'\(\s*([*]|[:])\s*\)', len) or re.match(r'([*]|[:])', len):
+        if isintent_hide(var):
+            errmess('getstrlength:intent(hide): expected a string with defined length but got: %s\n' % (
+                repr(var)))
+        len = '-1'
+    return len
+
+
+def getarrdims(a, var, verbose=0):
+    ret = {}
+    if isstring(var) and not isarray(var):
+        ret['dims'] = getstrlength(var)
+        ret['size'] = ret['dims']
+        ret['rank'] = '1'
+    elif isscalar(var):
+        ret['size'] = '1'
+        ret['rank'] = '0'
+        ret['dims'] = ''
+    elif isarray(var):
+        dim = copy.copy(var['dimension'])
+        ret['size'] = '*'.join(dim)
+        try:
+            ret['size'] = repr(eval(ret['size']))
+        except Exception:
+            pass
+        ret['dims'] = ','.join(dim)
+        ret['rank'] = repr(len(dim))
+        ret['rank*[-1]'] = repr(len(dim) * [-1])[1:-1]
+        for i in range(len(dim)):  # solve dim for dependencies
+            v = []
+            if dim[i] in depargs:
+                v = [dim[i]]
+            else:
+                for va in depargs:
+                    if re.match(r'.*?\b%s\b.*' % va, dim[i]):
+                        v.append(va)
+            for va in v:
+                if depargs.index(va) > depargs.index(a):
+                    dim[i] = '*'
+                    break
+        ret['setdims'], i = '', -1
+        for d in dim:
+            i = i + 1
+            if d not in ['*', ':', '(*)', '(:)']:
+                ret['setdims'] = '%s#varname#_Dims[%d]=%s,' % (
+                    ret['setdims'], i, d)
+        if ret['setdims']:
+            ret['setdims'] = ret['setdims'][:-1]
+        ret['cbsetdims'], i = '', -1
+        for d in var['dimension']:
+            i = i + 1
+            if d not in ['*', ':', '(*)', '(:)']:
+                ret['cbsetdims'] = '%s#varname#_Dims[%d]=%s,' % (
+                    ret['cbsetdims'], i, d)
+            elif isintent_in(var):
+                outmess('getarrdims:warning: assumed shape array, using 0 instead of %r\n'
+                        % (d))
+                ret['cbsetdims'] = '%s#varname#_Dims[%d]=%s,' % (
+                    ret['cbsetdims'], i, 0)
+            elif verbose:
+                errmess(
+                    'getarrdims: If in call-back function: array argument %s must have bounded dimensions: got %s\n' % (repr(a), repr(d)))
+        if ret['cbsetdims']:
+            ret['cbsetdims'] = ret['cbsetdims'][:-1]
+#         if not isintent_c(var):
+#             var['dimension'].reverse()
+    return ret
+
+
+def getpydocsign(a, var):
+    global lcb_map
+    if isfunction(var):
+        if 'result' in var:
+            af = var['result']
+        else:
+            af = var['name']
+        if af in var['vars']:
+            return getpydocsign(af, var['vars'][af])
+        else:
+            errmess('getctype: function %s has no return value?!\n' % af)
+        return '', ''
+    sig, sigout = a, a
+    opt = ''
+    if isintent_in(var):
+        opt = 'input'
+    elif isintent_inout(var):
+        opt = 'in/output'
+    out_a = a
+    if isintent_out(var):
+        for k in var['intent']:
+            if k[:4] == 'out=':
+                out_a = k[4:]
+                break
+    init = ''
+    ctype = getctype(var)
+
+    if hasinitvalue(var):
+        init, showinit = getinit(a, var)
+        init = ', optional\\n    Default: %s' % showinit
+    if isscalar(var):
+        if isintent_inout(var):
+            sig = '%s : %s rank-0 array(%s,\'%s\')%s' % (a, opt, c2py_map[ctype],
+                                                         c2pycode_map[ctype], init)
+        else:
+            sig = '%s : %s %s%s' % (a, opt, c2py_map[ctype], init)
+        sigout = '%s : %s' % (out_a, c2py_map[ctype])
+    elif isstring(var):
+        if isintent_inout(var):
+            sig = '%s : %s rank-0 array(string(len=%s),\'c\')%s' % (
+                a, opt, getstrlength(var), init)
+        else:
+            sig = '%s : %s string(len=%s)%s' % (
+                a, opt, getstrlength(var), init)
+        sigout = '%s : string(len=%s)' % (out_a, getstrlength(var))
+    elif isarray(var):
+        dim = var['dimension']
+        rank = repr(len(dim))
+        sig = '%s : %s rank-%s array(\'%s\') with bounds (%s)%s' % (a, opt, rank,
+                                                                    c2pycode_map[
+                                                                        ctype],
+                                                                    ','.join(dim), init)
+        if a == out_a:
+            sigout = '%s : rank-%s array(\'%s\') with bounds (%s)'\
+                % (a, rank, c2pycode_map[ctype], ','.join(dim))
+        else:
+            sigout = '%s : rank-%s array(\'%s\') with bounds (%s) and %s storage'\
+                % (out_a, rank, c2pycode_map[ctype], ','.join(dim), a)
+    elif isexternal(var):
+        ua = ''
+        if a in lcb_map and lcb_map[a] in lcb2_map and 'argname' in lcb2_map[lcb_map[a]]:
+            ua = lcb2_map[lcb_map[a]]['argname']
+            if not ua == a:
+                ua = ' => %s' % ua
+            else:
+                ua = ''
+        sig = '%s : call-back function%s' % (a, ua)
+        sigout = sig
+    else:
+        errmess(
+            'getpydocsign: Could not resolve docsignature for "%s".\\n' % a)
+    return sig, sigout
+
+
+def getarrdocsign(a, var):
+    ctype = getctype(var)
+    if isstring(var) and (not isarray(var)):
+        sig = '%s : rank-0 array(string(len=%s),\'c\')' % (a,
+                                                           getstrlength(var))
+    elif isscalar(var):
+        sig = '%s : rank-0 array(%s,\'%s\')' % (a, c2py_map[ctype],
+                                                c2pycode_map[ctype],)
+    elif isarray(var):
+        dim = var['dimension']
+        rank = repr(len(dim))
+        sig = '%s : rank-%s array(\'%s\') with bounds (%s)' % (a, rank,
+                                                               c2pycode_map[
+                                                                   ctype],
+                                                               ','.join(dim))
+    return sig
+
+
+def getinit(a, var):
+    if isstring(var):
+        init, showinit = '""', "''"
+    else:
+        init, showinit = '', ''
+    if hasinitvalue(var):
+        init = var['=']
+        showinit = init
+        if iscomplex(var) or iscomplexarray(var):
+            ret = {}
+
+            try:
+                v = var["="]
+                if ',' in v:
+                    ret['init.r'], ret['init.i'] = markoutercomma(
+                        v[1:-1]).split('@,@')
+                else:
+                    v = eval(v, {}, {})
+                    ret['init.r'], ret['init.i'] = str(v.real), str(v.imag)
+            except Exception:
+                raise ValueError(
+                    'getinit: expected complex number `(r,i)\' but got `%s\' as initial value of %r.' % (init, a))
+            if isarray(var):
+                init = '(capi_c.r=%s,capi_c.i=%s,capi_c)' % (
+                    ret['init.r'], ret['init.i'])
+        elif isstring(var):
+            if not init:
+                init, showinit = '""', "''"
+            if init[0] == "'":
+                init = '"%s"' % (init[1:-1].replace('"', '\\"'))
+            if init[0] == '"':
+                showinit = "'%s'" % (init[1:-1])
+    return init, showinit
+
+
+def sign2map(a, var):
+    """
+    varname,ctype,atype
+    init,init.r,init.i,pytype
+    vardebuginfo,vardebugshowvalue,varshowvalue
+    varrfromat
+    intent
+    """
+    out_a = a
+    if isintent_out(var):
+        for k in var['intent']:
+            if k[:4] == 'out=':
+                out_a = k[4:]
+                break
+    ret = {'varname': a, 'outvarname': out_a, 'ctype': getctype(var)}
+    intent_flags = []
+    for f, s in isintent_dict.items():
+        if f(var):
+            intent_flags.append('F2PY_%s' % s)
+    if intent_flags:
+        # XXX: Evaluate intent_flags here.
+        ret['intent'] = '|'.join(intent_flags)
+    else:
+        ret['intent'] = 'F2PY_INTENT_IN'
+    if isarray(var):
+        ret['varrformat'] = 'N'
+    elif ret['ctype'] in c2buildvalue_map:
+        ret['varrformat'] = c2buildvalue_map[ret['ctype']]
+    else:
+        ret['varrformat'] = 'O'
+    ret['init'], ret['showinit'] = getinit(a, var)
+    if hasinitvalue(var) and iscomplex(var) and not isarray(var):
+        ret['init.r'], ret['init.i'] = markoutercomma(
+            ret['init'][1:-1]).split('@,@')
+    if isexternal(var):
+        ret['cbnamekey'] = a
+        if a in lcb_map:
+            ret['cbname'] = lcb_map[a]
+            ret['maxnofargs'] = lcb2_map[lcb_map[a]]['maxnofargs']
+            ret['nofoptargs'] = lcb2_map[lcb_map[a]]['nofoptargs']
+            ret['cbdocstr'] = lcb2_map[lcb_map[a]]['docstr']
+            ret['cblatexdocstr'] = lcb2_map[lcb_map[a]]['latexdocstr']
+        else:
+            ret['cbname'] = a
+            errmess('sign2map: Confused: external %s is not in lcb_map%s.\n' % (
+                a, list(lcb_map.keys())))
+    if isstring(var):
+        ret['length'] = getstrlength(var)
+    if isarray(var):
+        ret = dictappend(ret, getarrdims(a, var))
+        dim = copy.copy(var['dimension'])
+    if ret['ctype'] in c2capi_map:
+        ret['atype'] = c2capi_map[ret['ctype']]
+    # Debug info
+    if debugcapi(var):
+        il = [isintent_in, 'input', isintent_out, 'output',
+              isintent_inout, 'inoutput', isrequired, 'required',
+              isoptional, 'optional', isintent_hide, 'hidden',
+              iscomplex, 'complex scalar',
+              l_and(isscalar, l_not(iscomplex)), 'scalar',
+              isstring, 'string', isarray, 'array',
+              iscomplexarray, 'complex array', isstringarray, 'string array',
+              iscomplexfunction, 'complex function',
+              l_and(isfunction, l_not(iscomplexfunction)), 'function',
+              isexternal, 'callback',
+              isintent_callback, 'callback',
+              isintent_aux, 'auxiliary',
+              ]
+        rl = []
+        for i in range(0, len(il), 2):
+            if il[i](var):
+                rl.append(il[i + 1])
+        if isstring(var):
+            rl.append('slen(%s)=%s' % (a, ret['length']))
+        if isarray(var):
+            ddim = ','.join(
+                map(lambda x, y: '%s|%s' % (x, y), var['dimension'], dim))
+            rl.append('dims(%s)' % ddim)
+        if isexternal(var):
+            ret['vardebuginfo'] = 'debug-capi:%s=>%s:%s' % (
+                a, ret['cbname'], ','.join(rl))
+        else:
+            ret['vardebuginfo'] = 'debug-capi:%s %s=%s:%s' % (
+                ret['ctype'], a, ret['showinit'], ','.join(rl))
+        if isscalar(var):
+            if ret['ctype'] in cformat_map:
+                ret['vardebugshowvalue'] = 'debug-capi:%s=%s' % (
+                    a, cformat_map[ret['ctype']])
+        if isstring(var):
+            ret['vardebugshowvalue'] = 'debug-capi:slen(%s)=%%d %s=\\"%%s\\"' % (
+                a, a)
+        if isexternal(var):
+            ret['vardebugshowvalue'] = 'debug-capi:%s=%%p' % (a)
+    if ret['ctype'] in cformat_map:
+        ret['varshowvalue'] = '#name#:%s=%s' % (a, cformat_map[ret['ctype']])
+        ret['showvalueformat'] = '%s' % (cformat_map[ret['ctype']])
+    if isstring(var):
+        ret['varshowvalue'] = '#name#:slen(%s)=%%d %s=\\"%%s\\"' % (a, a)
+    ret['pydocsign'], ret['pydocsignout'] = getpydocsign(a, var)
+    if hasnote(var):
+        ret['note'] = var['note']
+    return ret
+
+
+def routsign2map(rout):
+    """
+    name,NAME,begintitle,endtitle
+    rname,ctype,rformat
+    routdebugshowvalue
+    """
+    global lcb_map
+    name = rout['name']
+    fname = getfortranname(rout)
+    ret = {'name': name,
+           'texname': name.replace('_', '\\_'),
+           'name_lower': name.lower(),
+           'NAME': name.upper(),
+           'begintitle': gentitle(name),
+           'endtitle': gentitle('end of %s' % name),
+           'fortranname': fname,
+           'FORTRANNAME': fname.upper(),
+           'callstatement': getcallstatement(rout) or '',
+           'usercode': getusercode(rout) or '',
+           'usercode1': getusercode1(rout) or '',
+           }
+    if '_' in fname:
+        ret['F_FUNC'] = 'F_FUNC_US'
+    else:
+        ret['F_FUNC'] = 'F_FUNC'
+    if '_' in name:
+        ret['F_WRAPPEDFUNC'] = 'F_WRAPPEDFUNC_US'
+    else:
+        ret['F_WRAPPEDFUNC'] = 'F_WRAPPEDFUNC'
+    lcb_map = {}
+    if 'use' in rout:
+        for u in rout['use'].keys():
+            if u in cb_rules.cb_map:
+                for un in cb_rules.cb_map[u]:
+                    ln = un[0]
+                    if 'map' in rout['use'][u]:
+                        for k in rout['use'][u]['map'].keys():
+                            if rout['use'][u]['map'][k] == un[0]:
+                                ln = k
+                                break
+                    lcb_map[ln] = un[1]
+    elif 'externals' in rout and rout['externals']:
+        errmess('routsign2map: Confused: function %s has externals %s but no "use" statement.\n' % (
+            ret['name'], repr(rout['externals'])))
+    ret['callprotoargument'] = getcallprotoargument(rout, lcb_map) or ''
+    if isfunction(rout):
+        if 'result' in rout:
+            a = rout['result']
+        else:
+            a = rout['name']
+        ret['rname'] = a
+        ret['pydocsign'], ret['pydocsignout'] = getpydocsign(a, rout)
+        ret['ctype'] = getctype(rout['vars'][a])
+        if hasresultnote(rout):
+            ret['resultnote'] = rout['vars'][a]['note']
+            rout['vars'][a]['note'] = ['See elsewhere.']
+        if ret['ctype'] in c2buildvalue_map:
+            ret['rformat'] = c2buildvalue_map[ret['ctype']]
+        else:
+            ret['rformat'] = 'O'
+            errmess('routsign2map: no c2buildvalue key for type %s\n' %
+                    (repr(ret['ctype'])))
+        if debugcapi(rout):
+            if ret['ctype'] in cformat_map:
+                ret['routdebugshowvalue'] = 'debug-capi:%s=%s' % (
+                    a, cformat_map[ret['ctype']])
+            if isstringfunction(rout):
+                ret['routdebugshowvalue'] = 'debug-capi:slen(%s)=%%d %s=\\"%%s\\"' % (
+                    a, a)
+        if isstringfunction(rout):
+            ret['rlength'] = getstrlength(rout['vars'][a])
+            if ret['rlength'] == '-1':
+                errmess('routsign2map: expected explicit specification of the length of the string returned by the fortran function %s; taking 10.\n' % (
+                    repr(rout['name'])))
+                ret['rlength'] = '10'
+    if hasnote(rout):
+        ret['note'] = rout['note']
+        rout['note'] = ['See elsewhere.']
+    return ret
+
+
+def modsign2map(m):
+    """
+    modulename
+    """
+    if ismodule(m):
+        ret = {'f90modulename': m['name'],
+               'F90MODULENAME': m['name'].upper(),
+               'texf90modulename': m['name'].replace('_', '\\_')}
+    else:
+        ret = {'modulename': m['name'],
+               'MODULENAME': m['name'].upper(),
+               'texmodulename': m['name'].replace('_', '\\_')}
+    ret['restdoc'] = getrestdoc(m) or []
+    if hasnote(m):
+        ret['note'] = m['note']
+    ret['usercode'] = getusercode(m) or ''
+    ret['usercode1'] = getusercode1(m) or ''
+    if m['body']:
+        ret['interface_usercode'] = getusercode(m['body'][0]) or ''
+    else:
+        ret['interface_usercode'] = ''
+    ret['pymethoddef'] = getpymethoddef(m) or ''
+    if 'coutput' in m:
+        ret['coutput'] = m['coutput']
+    if 'f2py_wrapper_output' in m:
+        ret['f2py_wrapper_output'] = m['f2py_wrapper_output']
+    return ret
+
+
+def cb_sign2map(a, var, index=None):
+    ret = {'varname': a}
+    ret['varname_i'] = ret['varname']
+    ret['ctype'] = getctype(var)
+    if ret['ctype'] in c2capi_map:
+        ret['atype'] = c2capi_map[ret['ctype']]
+    if ret['ctype'] in cformat_map:
+        ret['showvalueformat'] = '%s' % (cformat_map[ret['ctype']])
+    if isarray(var):
+        ret = dictappend(ret, getarrdims(a, var))
+    ret['pydocsign'], ret['pydocsignout'] = getpydocsign(a, var)
+    if hasnote(var):
+        ret['note'] = var['note']
+        var['note'] = ['See elsewhere.']
+    return ret
+
+
+def cb_routsign2map(rout, um):
+    """
+    name,begintitle,endtitle,argname
+    ctype,rctype,maxnofargs,nofoptargs,returncptr
+    """
+    ret = {'name': 'cb_%s_in_%s' % (rout['name'], um),
+           'returncptr': ''}
+    if isintent_callback(rout):
+        if '_' in rout['name']:
+            F_FUNC = 'F_FUNC_US'
+        else:
+            F_FUNC = 'F_FUNC'
+        ret['callbackname'] = '%s(%s,%s)' \
+                              % (F_FUNC,
+                                 rout['name'].lower(),
+                                 rout['name'].upper(),
+                                 )
+        ret['static'] = 'extern'
+    else:
+        ret['callbackname'] = ret['name']
+        ret['static'] = 'static'
+    ret['argname'] = rout['name']
+    ret['begintitle'] = gentitle(ret['name'])
+    ret['endtitle'] = gentitle('end of %s' % ret['name'])
+    ret['ctype'] = getctype(rout)
+    ret['rctype'] = 'void'
+    if ret['ctype'] == 'string':
+        ret['rctype'] = 'void'
+    else:
+        ret['rctype'] = ret['ctype']
+    if ret['rctype'] != 'void':
+        if iscomplexfunction(rout):
+            ret['returncptr'] = """
+#ifdef F2PY_CB_RETURNCOMPLEX
+return_value=
+#endif
+"""
+        else:
+            ret['returncptr'] = 'return_value='
+    if ret['ctype'] in cformat_map:
+        ret['showvalueformat'] = '%s' % (cformat_map[ret['ctype']])
+    if isstringfunction(rout):
+        ret['strlength'] = getstrlength(rout)
+    if isfunction(rout):
+        if 'result' in rout:
+            a = rout['result']
+        else:
+            a = rout['name']
+        if hasnote(rout['vars'][a]):
+            ret['note'] = rout['vars'][a]['note']
+            rout['vars'][a]['note'] = ['See elsewhere.']
+        ret['rname'] = a
+        ret['pydocsign'], ret['pydocsignout'] = getpydocsign(a, rout)
+        if iscomplexfunction(rout):
+            ret['rctype'] = """
+#ifdef F2PY_CB_RETURNCOMPLEX
+#ctype#
+#else
+void
+#endif
+"""
+    else:
+        if hasnote(rout):
+            ret['note'] = rout['note']
+            rout['note'] = ['See elsewhere.']
+    nofargs = 0
+    nofoptargs = 0
+    if 'args' in rout and 'vars' in rout:
+        for a in rout['args']:
+            var = rout['vars'][a]
+            if l_or(isintent_in, isintent_inout)(var):
+                nofargs = nofargs + 1
+                if isoptional(var):
+                    nofoptargs = nofoptargs + 1
+    ret['maxnofargs'] = repr(nofargs)
+    ret['nofoptargs'] = repr(nofoptargs)
+    if hasnote(rout) and isfunction(rout) and 'result' in rout:
+        ret['routnote'] = rout['note']
+        rout['note'] = ['See elsewhere.']
+    return ret
+
+
+def common_sign2map(a, var):  # obsolute
+    ret = {'varname': a, 'ctype': getctype(var)}
+    if isstringarray(var):
+        ret['ctype'] = 'char'
+    if ret['ctype'] in c2capi_map:
+        ret['atype'] = c2capi_map[ret['ctype']]
+    if ret['ctype'] in cformat_map:
+        ret['showvalueformat'] = '%s' % (cformat_map[ret['ctype']])
+    if isarray(var):
+        ret = dictappend(ret, getarrdims(a, var))
+    elif isstring(var):
+        ret['size'] = getstrlength(var)
+        ret['rank'] = '1'
+    ret['pydocsign'], ret['pydocsignout'] = getpydocsign(a, var)
+    if hasnote(var):
+        ret['note'] = var['note']
+        var['note'] = ['See elsewhere.']
+    # for strings this returns 0-rank but actually is 1-rank
+    ret['arrdocstr'] = getarrdocsign(a, var)
+    return ret
diff --git a/venv/Lib/site-packages/numpy/f2py/cb_rules.py b/venv/Lib/site-packages/numpy/f2py/cb_rules.py
new file mode 100644
index 000000000..87887c152
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/cb_rules.py
@@ -0,0 +1,574 @@
+#!/usr/bin/env python3
+"""
+
+Build call-back mechanism for f2py2e.
+
+Copyright 2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/07/20 11:27:58 $
+Pearu Peterson
+
+"""
+from . import __version__
+from .auxfuncs import (
+    applyrules, debugcapi, dictappend, errmess, getargs, hasnote, isarray,
+    iscomplex, iscomplexarray, iscomplexfunction, isfunction, isintent_c,
+    isintent_hide, isintent_in, isintent_inout, isintent_nothide,
+    isintent_out, isoptional, isrequired, isscalar, isstring,
+    isstringfunction, issubroutine, l_and, l_not, l_or, outmess, replace,
+    stripcomma, throw_error
+)
+from . import cfuncs
+
+f2py_version = __version__.version
+
+
+################## Rules for callback function ##############
+
+cb_routine_rules = {
+    'cbtypedefs': 'typedef #rctype#(*#name#_typedef)(#optargs_td##args_td##strarglens_td##noargs#);',
+    'body': """
+#begintitle#
+PyObject *#name#_capi = NULL;/*was Py_None*/
+PyTupleObject *#name#_args_capi = NULL;
+int #name#_nofargs = 0;
+jmp_buf #name#_jmpbuf;
+/*typedef #rctype#(*#name#_typedef)(#optargs_td##args_td##strarglens_td##noargs#);*/
+#static# #rctype# #callbackname# (#optargs##args##strarglens##noargs#) {
+\tPyTupleObject *capi_arglist = #name#_args_capi;
+\tPyObject *capi_return = NULL;
+\tPyObject *capi_tmp = NULL;
+\tPyObject *capi_arglist_list = NULL;
+\tint capi_j,capi_i = 0;
+\tint capi_longjmp_ok = 1;
+#decl#
+#ifdef F2PY_REPORT_ATEXIT
+f2py_cb_start_clock();
+#endif
+\tCFUNCSMESS(\"cb:Call-back function #name# (maxnofargs=#maxnofargs#(-#nofoptargs#))\\n\");
+\tCFUNCSMESSPY(\"cb:#name#_capi=\",#name#_capi);
+\tif (#name#_capi==NULL) {
+\t\tcapi_longjmp_ok = 0;
+\t\t#name#_capi = PyObject_GetAttrString(#modulename#_module,\"#argname#\");
+\t}
+\tif (#name#_capi==NULL) {
+\t\tPyErr_SetString(#modulename#_error,\"cb: Callback #argname# not defined (as an argument or module #modulename# attribute).\\n\");
+\t\tgoto capi_fail;
+\t}
+\tif (F2PyCapsule_Check(#name#_capi)) {
+\t#name#_typedef #name#_cptr;
+\t#name#_cptr = F2PyCapsule_AsVoidPtr(#name#_capi);
+\t#returncptr#(*#name#_cptr)(#optargs_nm##args_nm##strarglens_nm#);
+\t#return#
+\t}
+\tif (capi_arglist==NULL) {
+\t\tcapi_longjmp_ok = 0;
+\t\tcapi_tmp = PyObject_GetAttrString(#modulename#_module,\"#argname#_extra_args\");
+\t\tif (capi_tmp) {
+\t\t\tcapi_arglist = (PyTupleObject *)PySequence_Tuple(capi_tmp);
+\t\t\tif (capi_arglist==NULL) {
+\t\t\t\tPyErr_SetString(#modulename#_error,\"Failed to convert #modulename#.#argname#_extra_args to tuple.\\n\");
+\t\t\t\tgoto capi_fail;
+\t\t\t}
+\t\t} else {
+\t\t\tPyErr_Clear();
+\t\t\tcapi_arglist = (PyTupleObject *)Py_BuildValue(\"()\");
+\t\t}
+\t}
+\tif (capi_arglist == NULL) {
+\t\tPyErr_SetString(#modulename#_error,\"Callback #argname# argument list is not set.\\n\");
+\t\tgoto capi_fail;
+\t}
+#setdims#
+#ifdef PYPY_VERSION
+#define CAPI_ARGLIST_SETITEM(idx, value) PyList_SetItem((PyObject *)capi_arglist_list, idx, value)
+\tcapi_arglist_list = PySequence_List(capi_arglist);
+\tif (capi_arglist_list == NULL) goto capi_fail;
+#else
+#define CAPI_ARGLIST_SETITEM(idx, value) PyTuple_SetItem((PyObject *)capi_arglist, idx, value)
+#endif
+#pyobjfrom#
+#undef CAPI_ARGLIST_SETITEM
+#ifdef PYPY_VERSION
+\tCFUNCSMESSPY(\"cb:capi_arglist=\",capi_arglist_list);
+#else
+\tCFUNCSMESSPY(\"cb:capi_arglist=\",capi_arglist);
+#endif
+\tCFUNCSMESS(\"cb:Call-back calling Python function #argname#.\\n\");
+#ifdef F2PY_REPORT_ATEXIT
+f2py_cb_start_call_clock();
+#endif
+#ifdef PYPY_VERSION
+\tcapi_return = PyObject_CallObject(#name#_capi,(PyObject *)capi_arglist_list);
+\tPy_DECREF(capi_arglist_list);
+\tcapi_arglist_list = NULL;
+#else
+\tcapi_return = PyObject_CallObject(#name#_capi,(PyObject *)capi_arglist);
+#endif
+#ifdef F2PY_REPORT_ATEXIT
+f2py_cb_stop_call_clock();
+#endif
+\tCFUNCSMESSPY(\"cb:capi_return=\",capi_return);
+\tif (capi_return == NULL) {
+\t\tfprintf(stderr,\"capi_return is NULL\\n\");
+\t\tgoto capi_fail;
+\t}
+\tif (capi_return == Py_None) {
+\t\tPy_DECREF(capi_return);
+\t\tcapi_return = Py_BuildValue(\"()\");
+\t}
+\telse if (!PyTuple_Check(capi_return)) {
+\t\tcapi_return = Py_BuildValue(\"(N)\",capi_return);
+\t}
+\tcapi_j = PyTuple_Size(capi_return);
+\tcapi_i = 0;
+#frompyobj#
+\tCFUNCSMESS(\"cb:#name#:successful\\n\");
+\tPy_DECREF(capi_return);
+#ifdef F2PY_REPORT_ATEXIT
+f2py_cb_stop_clock();
+#endif
+\tgoto capi_return_pt;
+capi_fail:
+\tfprintf(stderr,\"Call-back #name# failed.\\n\");
+\tPy_XDECREF(capi_return);
+\tPy_XDECREF(capi_arglist_list);
+\tif (capi_longjmp_ok)
+\t\tlongjmp(#name#_jmpbuf,-1);
+capi_return_pt:
+\t;
+#return#
+}
+#endtitle#
+""",
+    'need': ['setjmp.h', 'CFUNCSMESS'],
+    'maxnofargs': '#maxnofargs#',
+    'nofoptargs': '#nofoptargs#',
+    'docstr': """\
+\tdef #argname#(#docsignature#): return #docreturn#\\n\\
+#docstrsigns#""",
+    'latexdocstr': """
+{{}\\verb@def #argname#(#latexdocsignature#): return #docreturn#@{}}
+#routnote#
+
+#latexdocstrsigns#""",
+    'docstrshort': 'def #argname#(#docsignature#): return #docreturn#'
+}
+cb_rout_rules = [
+    {  # Init
+        'separatorsfor': {'decl': '\n',
+                          'args': ',', 'optargs': '', 'pyobjfrom': '\n', 'freemem': '\n',
+                          'args_td': ',', 'optargs_td': '',
+                          'args_nm': ',', 'optargs_nm': '',
+                          'frompyobj': '\n', 'setdims': '\n',
+                          'docstrsigns': '\\n"\n"',
+                          'latexdocstrsigns': '\n',
+                          'latexdocstrreq': '\n', 'latexdocstropt': '\n',
+                          'latexdocstrout': '\n', 'latexdocstrcbs': '\n',
+                          },
+        'decl': '/*decl*/', 'pyobjfrom': '/*pyobjfrom*/', 'frompyobj': '/*frompyobj*/',
+        'args': [], 'optargs': '', 'return': '', 'strarglens': '', 'freemem': '/*freemem*/',
+        'args_td': [], 'optargs_td': '', 'strarglens_td': '',
+        'args_nm': [], 'optargs_nm': '', 'strarglens_nm': '',
+        'noargs': '',
+        'setdims': '/*setdims*/',
+        'docstrsigns': '', 'latexdocstrsigns': '',
+        'docstrreq': '\tRequired arguments:',
+        'docstropt': '\tOptional arguments:',
+        'docstrout': '\tReturn objects:',
+        'docstrcbs': '\tCall-back functions:',
+        'docreturn': '', 'docsign': '', 'docsignopt': '',
+        'latexdocstrreq': '\\noindent Required arguments:',
+        'latexdocstropt': '\\noindent Optional arguments:',
+        'latexdocstrout': '\\noindent Return objects:',
+        'latexdocstrcbs': '\\noindent Call-back functions:',
+        'routnote': {hasnote: '--- #note#', l_not(hasnote): ''},
+    }, {  # Function
+        'decl': '\t#ctype# return_value;',
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting return_value->");'},
+                      '\tif (capi_j>capi_i)\n\t\tGETSCALARFROMPYTUPLE(capi_return,capi_i++,&return_value,#ctype#,"#ctype#_from_pyobj failed in converting return_value of call-back function #name# to C #ctype#\\n");',
+                      {debugcapi:
+                       '\tfprintf(stderr,"#showvalueformat#.\\n",return_value);'}
+                      ],
+        'need': ['#ctype#_from_pyobj', {debugcapi: 'CFUNCSMESS'}, 'GETSCALARFROMPYTUPLE'],
+        'return': '\treturn return_value;',
+        '_check': l_and(isfunction, l_not(isstringfunction), l_not(iscomplexfunction))
+    },
+    {  # String function
+        'pyobjfrom': {debugcapi: '\tfprintf(stderr,"debug-capi:cb:#name#:%d:\\n",return_value_len);'},
+        'args': '#ctype# return_value,int return_value_len',
+        'args_nm': 'return_value,&return_value_len',
+        'args_td': '#ctype# ,int',
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting return_value->\\"");'},
+                      """\tif (capi_j>capi_i)
+\t\tGETSTRFROMPYTUPLE(capi_return,capi_i++,return_value,return_value_len);""",
+                      {debugcapi:
+                       '\tfprintf(stderr,"#showvalueformat#\\".\\n",return_value);'}
+                      ],
+        'need': ['#ctype#_from_pyobj', {debugcapi: 'CFUNCSMESS'},
+                 'string.h', 'GETSTRFROMPYTUPLE'],
+        'return': 'return;',
+        '_check': isstringfunction
+    },
+    {  # Complex function
+        'optargs': """
+#ifndef F2PY_CB_RETURNCOMPLEX
+#ctype# *return_value
+#endif
+""",
+        'optargs_nm': """
+#ifndef F2PY_CB_RETURNCOMPLEX
+return_value
+#endif
+""",
+        'optargs_td': """
+#ifndef F2PY_CB_RETURNCOMPLEX
+#ctype# *
+#endif
+""",
+        'decl': """
+#ifdef F2PY_CB_RETURNCOMPLEX
+\t#ctype# return_value;
+#endif
+""",
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting return_value->");'},
+                      """\
+\tif (capi_j>capi_i)
+#ifdef F2PY_CB_RETURNCOMPLEX
+\t\tGETSCALARFROMPYTUPLE(capi_return,capi_i++,&return_value,#ctype#,\"#ctype#_from_pyobj failed in converting return_value of call-back function #name# to C #ctype#\\n\");
+#else
+\t\tGETSCALARFROMPYTUPLE(capi_return,capi_i++,return_value,#ctype#,\"#ctype#_from_pyobj failed in converting return_value of call-back function #name# to C #ctype#\\n\");
+#endif
+""",
+                      {debugcapi: """
+#ifdef F2PY_CB_RETURNCOMPLEX
+\tfprintf(stderr,\"#showvalueformat#.\\n\",(return_value).r,(return_value).i);
+#else
+\tfprintf(stderr,\"#showvalueformat#.\\n\",(*return_value).r,(*return_value).i);
+#endif
+
+"""}
+                      ],
+        'return': """
+#ifdef F2PY_CB_RETURNCOMPLEX
+\treturn return_value;
+#else
+\treturn;
+#endif
+""",
+        'need': ['#ctype#_from_pyobj', {debugcapi: 'CFUNCSMESS'},
+                 'string.h', 'GETSCALARFROMPYTUPLE', '#ctype#'],
+        '_check': iscomplexfunction
+    },
+    {'docstrout': '\t\t#pydocsignout#',
+     'latexdocstrout': ['\\item[]{{}\\verb@#pydocsignout#@{}}',
+                        {hasnote: '--- #note#'}],
+     'docreturn': '#rname#,',
+     '_check': isfunction},
+    {'_check': issubroutine, 'return': 'return;'}
+]
+
+cb_arg_rules = [
+    {  # Doc
+        'docstropt': {l_and(isoptional, isintent_nothide): '\t\t#pydocsign#'},
+        'docstrreq': {l_and(isrequired, isintent_nothide): '\t\t#pydocsign#'},
+        'docstrout': {isintent_out: '\t\t#pydocsignout#'},
+        'latexdocstropt': {l_and(isoptional, isintent_nothide): ['\\item[]{{}\\verb@#pydocsign#@{}}',
+                                                                 {hasnote: '--- #note#'}]},
+        'latexdocstrreq': {l_and(isrequired, isintent_nothide): ['\\item[]{{}\\verb@#pydocsign#@{}}',
+                                                                 {hasnote: '--- #note#'}]},
+        'latexdocstrout': {isintent_out: ['\\item[]{{}\\verb@#pydocsignout#@{}}',
+                                          {l_and(hasnote, isintent_hide): '--- #note#',
+                                           l_and(hasnote, isintent_nothide): '--- See above.'}]},
+        'docsign': {l_and(isrequired, isintent_nothide): '#varname#,'},
+        'docsignopt': {l_and(isoptional, isintent_nothide): '#varname#,'},
+        'depend': ''
+    },
+    {
+        'args': {
+            l_and(isscalar, isintent_c): '#ctype# #varname_i#',
+            l_and(isscalar, l_not(isintent_c)): '#ctype# *#varname_i#_cb_capi',
+            isarray: '#ctype# *#varname_i#',
+            isstring: '#ctype# #varname_i#'
+        },
+        'args_nm': {
+            l_and(isscalar, isintent_c): '#varname_i#',
+            l_and(isscalar, l_not(isintent_c)): '#varname_i#_cb_capi',
+            isarray: '#varname_i#',
+            isstring: '#varname_i#'
+        },
+        'args_td': {
+            l_and(isscalar, isintent_c): '#ctype#',
+            l_and(isscalar, l_not(isintent_c)): '#ctype# *',
+            isarray: '#ctype# *',
+            isstring: '#ctype#'
+        },
+        # untested with multiple args
+        'strarglens': {isstring: ',int #varname_i#_cb_len'},
+        'strarglens_td': {isstring: ',int'},  # untested with multiple args
+        # untested with multiple args
+        'strarglens_nm': {isstring: ',#varname_i#_cb_len'},
+    },
+    {  # Scalars
+        'decl': {l_not(isintent_c): '\t#ctype# #varname_i#=(*#varname_i#_cb_capi);'},
+        'error': {l_and(isintent_c, isintent_out,
+                        throw_error('intent(c,out) is forbidden for callback scalar arguments')):
+                  ''},
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting #varname#->");'},
+                      {isintent_out:
+                       '\tif (capi_j>capi_i)\n\t\tGETSCALARFROMPYTUPLE(capi_return,capi_i++,#varname_i#_cb_capi,#ctype#,"#ctype#_from_pyobj failed in converting argument #varname# of call-back function #name# to C #ctype#\\n");'},
+                      {l_and(debugcapi, l_and(l_not(iscomplex), isintent_c)):
+                          '\tfprintf(stderr,"#showvalueformat#.\\n",#varname_i#);'},
+                      {l_and(debugcapi, l_and(l_not(iscomplex), l_not( isintent_c))):
+                          '\tfprintf(stderr,"#showvalueformat#.\\n",*#varname_i#_cb_capi);'},
+                      {l_and(debugcapi, l_and(iscomplex, isintent_c)):
+                          '\tfprintf(stderr,"#showvalueformat#.\\n",(#varname_i#).r,(#varname_i#).i);'},
+                      {l_and(debugcapi, l_and(iscomplex, l_not( isintent_c))):
+                          '\tfprintf(stderr,"#showvalueformat#.\\n",(*#varname_i#_cb_capi).r,(*#varname_i#_cb_capi).i);'},
+                      ],
+        'need': [{isintent_out: ['#ctype#_from_pyobj', 'GETSCALARFROMPYTUPLE']},
+                 {debugcapi: 'CFUNCSMESS'}],
+        '_check': isscalar
+    }, {
+        'pyobjfrom': [{isintent_in: """\
+\tif (#name#_nofargs>capi_i)
+\t\tif (CAPI_ARGLIST_SETITEM(capi_i++,pyobj_from_#ctype#1(#varname_i#)))
+\t\t\tgoto capi_fail;"""},
+                      {isintent_inout: """\
+\tif (#name#_nofargs>capi_i)
+\t\tif (CAPI_ARGLIST_SETITEM(capi_i++,pyarr_from_p_#ctype#1(#varname_i#_cb_capi)))
+\t\t\tgoto capi_fail;"""}],
+        'need': [{isintent_in: 'pyobj_from_#ctype#1'},
+                 {isintent_inout: 'pyarr_from_p_#ctype#1'},
+                 {iscomplex: '#ctype#'}],
+        '_check': l_and(isscalar, isintent_nothide),
+        '_optional': ''
+    }, {  # String
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting #varname#->\\"");'},
+                      """\tif (capi_j>capi_i)
+\t\tGETSTRFROMPYTUPLE(capi_return,capi_i++,#varname_i#,#varname_i#_cb_len);""",
+                      {debugcapi:
+                       '\tfprintf(stderr,"#showvalueformat#\\":%d:.\\n",#varname_i#,#varname_i#_cb_len);'},
+                      ],
+        'need': ['#ctype#', 'GETSTRFROMPYTUPLE',
+                 {debugcapi: 'CFUNCSMESS'}, 'string.h'],
+        '_check': l_and(isstring, isintent_out)
+    }, {
+        'pyobjfrom': [{debugcapi: '\tfprintf(stderr,"debug-capi:cb:#varname#=\\"#showvalueformat#\\":%d:\\n",#varname_i#,#varname_i#_cb_len);'},
+                      {isintent_in: """\
+\tif (#name#_nofargs>capi_i)
+\t\tif (CAPI_ARGLIST_SETITEM(capi_i++,pyobj_from_#ctype#1size(#varname_i#,#varname_i#_cb_len)))
+\t\t\tgoto capi_fail;"""},
+                      {isintent_inout: """\
+\tif (#name#_nofargs>capi_i) {
+\t\tint #varname_i#_cb_dims[] = {#varname_i#_cb_len};
+\t\tif (CAPI_ARGLIST_SETITEM(capi_i++,pyarr_from_p_#ctype#1(#varname_i#,#varname_i#_cb_dims)))
+\t\t\tgoto capi_fail;
+\t}"""}],
+        'need': [{isintent_in: 'pyobj_from_#ctype#1size'},
+                 {isintent_inout: 'pyarr_from_p_#ctype#1'}],
+        '_check': l_and(isstring, isintent_nothide),
+        '_optional': ''
+    },
+    # Array ...
+    {
+        'decl': '\tnpy_intp #varname_i#_Dims[#rank#] = {#rank*[-1]#};',
+        'setdims': '\t#cbsetdims#;',
+        '_check': isarray,
+        '_depend': ''
+    },
+    {
+        'pyobjfrom': [{debugcapi: '\tfprintf(stderr,"debug-capi:cb:#varname#\\n");'},
+                      {isintent_c: """\
+\tif (#name#_nofargs>capi_i) {
+\t\tint itemsize_ = #atype# == NPY_STRING ? 1 : 0;
+\t\t/*XXX: Hmm, what will destroy this array??? */
+\t\tPyArrayObject *tmp_arr = (PyArrayObject *)PyArray_New(&PyArray_Type,#rank#,#varname_i#_Dims,#atype#,NULL,(char*)#varname_i#,itemsize_,NPY_ARRAY_CARRAY,NULL);
+""",
+                       l_not(isintent_c): """\
+\tif (#name#_nofargs>capi_i) {
+\t\tint itemsize_ = #atype# == NPY_STRING ? 1 : 0;
+\t\t/*XXX: Hmm, what will destroy this array??? */
+\t\tPyArrayObject *tmp_arr = (PyArrayObject *)PyArray_New(&PyArray_Type,#rank#,#varname_i#_Dims,#atype#,NULL,(char*)#varname_i#,itemsize_,NPY_ARRAY_FARRAY,NULL);
+""",
+                       },
+                      """
+\t\tif (tmp_arr==NULL)
+\t\t\tgoto capi_fail;
+\t\tif (CAPI_ARGLIST_SETITEM(capi_i++,(PyObject *)tmp_arr))
+\t\t\tgoto capi_fail;
+}"""],
+        '_check': l_and(isarray, isintent_nothide, l_or(isintent_in, isintent_inout)),
+        '_optional': '',
+    }, {
+        'frompyobj': [{debugcapi: '\tCFUNCSMESS("cb:Getting #varname#->");'},
+                      """\tif (capi_j>capi_i) {
+\t\tPyArrayObject *rv_cb_arr = NULL;
+\t\tif ((capi_tmp = PyTuple_GetItem(capi_return,capi_i++))==NULL) goto capi_fail;
+\t\trv_cb_arr =  array_from_pyobj(#atype#,#varname_i#_Dims,#rank#,F2PY_INTENT_IN""",
+                      {isintent_c: '|F2PY_INTENT_C'},
+                      """,capi_tmp);
+\t\tif (rv_cb_arr == NULL) {
+\t\t\tfprintf(stderr,\"rv_cb_arr is NULL\\n\");
+\t\t\tgoto capi_fail;
+\t\t}
+\t\tMEMCOPY(#varname_i#,PyArray_DATA(rv_cb_arr),PyArray_NBYTES(rv_cb_arr));
+\t\tif (capi_tmp != (PyObject *)rv_cb_arr) {
+\t\t\tPy_DECREF(rv_cb_arr);
+\t\t}
+\t}""",
+                      {debugcapi: '\tfprintf(stderr,"<-.\\n");'},
+                      ],
+        'need': ['MEMCOPY', {iscomplexarray: '#ctype#'}],
+        '_check': l_and(isarray, isintent_out)
+    }, {
+        'docreturn': '#varname#,',
+        '_check': isintent_out
+    }
+]
+
+################## Build call-back module #############
+cb_map = {}
+
+
+def buildcallbacks(m):
+    cb_map[m['name']] = []
+    for bi in m['body']:
+        if bi['block'] == 'interface':
+            for b in bi['body']:
+                if b:
+                    buildcallback(b, m['name'])
+                else:
+                    errmess('warning: empty body for %s\n' % (m['name']))
+
+
+def buildcallback(rout, um):
+    from . import capi_maps
+
+    outmess('\tConstructing call-back function "cb_%s_in_%s"\n' %
+            (rout['name'], um))
+    args, depargs = getargs(rout)
+    capi_maps.depargs = depargs
+    var = rout['vars']
+    vrd = capi_maps.cb_routsign2map(rout, um)
+    rd = dictappend({}, vrd)
+    cb_map[um].append([rout['name'], rd['name']])
+    for r in cb_rout_rules:
+        if ('_check' in r and r['_check'](rout)) or ('_check' not in r):
+            ar = applyrules(r, vrd, rout)
+            rd = dictappend(rd, ar)
+    savevrd = {}
+    for i, a in enumerate(args):
+        vrd = capi_maps.cb_sign2map(a, var[a], index=i)
+        savevrd[a] = vrd
+        for r in cb_arg_rules:
+            if '_depend' in r:
+                continue
+            if '_optional' in r and isoptional(var[a]):
+                continue
+            if ('_check' in r and r['_check'](var[a])) or ('_check' not in r):
+                ar = applyrules(r, vrd, var[a])
+                rd = dictappend(rd, ar)
+                if '_break' in r:
+                    break
+    for a in args:
+        vrd = savevrd[a]
+        for r in cb_arg_rules:
+            if '_depend' in r:
+                continue
+            if ('_optional' not in r) or ('_optional' in r and isrequired(var[a])):
+                continue
+            if ('_check' in r and r['_check'](var[a])) or ('_check' not in r):
+                ar = applyrules(r, vrd, var[a])
+                rd = dictappend(rd, ar)
+                if '_break' in r:
+                    break
+    for a in depargs:
+        vrd = savevrd[a]
+        for r in cb_arg_rules:
+            if '_depend' not in r:
+                continue
+            if '_optional' in r:
+                continue
+            if ('_check' in r and r['_check'](var[a])) or ('_check' not in r):
+                ar = applyrules(r, vrd, var[a])
+                rd = dictappend(rd, ar)
+                if '_break' in r:
+                    break
+    if 'args' in rd and 'optargs' in rd:
+        if isinstance(rd['optargs'], list):
+            rd['optargs'] = rd['optargs'] + ["""
+#ifndef F2PY_CB_RETURNCOMPLEX
+,
+#endif
+"""]
+            rd['optargs_nm'] = rd['optargs_nm'] + ["""
+#ifndef F2PY_CB_RETURNCOMPLEX
+,
+#endif
+"""]
+            rd['optargs_td'] = rd['optargs_td'] + ["""
+#ifndef F2PY_CB_RETURNCOMPLEX
+,
+#endif
+"""]
+    if isinstance(rd['docreturn'], list):
+        rd['docreturn'] = stripcomma(
+            replace('#docreturn#', {'docreturn': rd['docreturn']}))
+    optargs = stripcomma(replace('#docsignopt#',
+                                 {'docsignopt': rd['docsignopt']}
+                                 ))
+    if optargs == '':
+        rd['docsignature'] = stripcomma(
+            replace('#docsign#', {'docsign': rd['docsign']}))
+    else:
+        rd['docsignature'] = replace('#docsign#[#docsignopt#]',
+                                     {'docsign': rd['docsign'],
+                                      'docsignopt': optargs,
+                                      })
+    rd['latexdocsignature'] = rd['docsignature'].replace('_', '\\_')
+    rd['latexdocsignature'] = rd['latexdocsignature'].replace(',', ', ')
+    rd['docstrsigns'] = []
+    rd['latexdocstrsigns'] = []
+    for k in ['docstrreq', 'docstropt', 'docstrout', 'docstrcbs']:
+        if k in rd and isinstance(rd[k], list):
+            rd['docstrsigns'] = rd['docstrsigns'] + rd[k]
+        k = 'latex' + k
+        if k in rd and isinstance(rd[k], list):
+            rd['latexdocstrsigns'] = rd['latexdocstrsigns'] + rd[k][0:1] +\
+                ['\\begin{description}'] + rd[k][1:] +\
+                ['\\end{description}']
+    if 'args' not in rd:
+        rd['args'] = ''
+        rd['args_td'] = ''
+        rd['args_nm'] = ''
+    if not (rd.get('args') or rd.get('optargs') or rd.get('strarglens')):
+        rd['noargs'] = 'void'
+
+    ar = applyrules(cb_routine_rules, rd)
+    cfuncs.callbacks[rd['name']] = ar['body']
+    if isinstance(ar['need'], str):
+        ar['need'] = [ar['need']]
+
+    if 'need' in rd:
+        for t in cfuncs.typedefs.keys():
+            if t in rd['need']:
+                ar['need'].append(t)
+
+    cfuncs.typedefs_generated[rd['name'] + '_typedef'] = ar['cbtypedefs']
+    ar['need'].append(rd['name'] + '_typedef')
+    cfuncs.needs[rd['name']] = ar['need']
+
+    capi_maps.lcb2_map[rd['name']] = {'maxnofargs': ar['maxnofargs'],
+                                      'nofoptargs': ar['nofoptargs'],
+                                      'docstr': ar['docstr'],
+                                      'latexdocstr': ar['latexdocstr'],
+                                      'argname': rd['argname']
+                                      }
+    outmess('\t  %s\n' % (ar['docstrshort']))
+    return
+################## Build call-back function #############
diff --git a/venv/Lib/site-packages/numpy/f2py/cfuncs.py b/venv/Lib/site-packages/numpy/f2py/cfuncs.py
new file mode 100644
index 000000000..f1ac214d4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/cfuncs.py
@@ -0,0 +1,1263 @@
+#!/usr/bin/env python3
+"""
+
+C declarations, CPP macros, and C functions for f2py2e.
+Only required declarations/macros/functions will be used.
+
+Copyright 1999,2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/05/06 11:42:34 $
+Pearu Peterson
+
+"""
+import sys
+import copy
+
+from . import __version__
+
+f2py_version = __version__.version
+errmess = sys.stderr.write
+
+##################### Definitions ##################
+
+outneeds = {'includes0': [], 'includes': [], 'typedefs': [], 'typedefs_generated': [],
+            'userincludes': [],
+            'cppmacros': [], 'cfuncs': [], 'callbacks': [], 'f90modhooks': [],
+            'commonhooks': []}
+needs = {}
+includes0 = {'includes0': '/*need_includes0*/'}
+includes = {'includes': '/*need_includes*/'}
+userincludes = {'userincludes': '/*need_userincludes*/'}
+typedefs = {'typedefs': '/*need_typedefs*/'}
+typedefs_generated = {'typedefs_generated': '/*need_typedefs_generated*/'}
+cppmacros = {'cppmacros': '/*need_cppmacros*/'}
+cfuncs = {'cfuncs': '/*need_cfuncs*/'}
+callbacks = {'callbacks': '/*need_callbacks*/'}
+f90modhooks = {'f90modhooks': '/*need_f90modhooks*/',
+               'initf90modhooksstatic': '/*initf90modhooksstatic*/',
+               'initf90modhooksdynamic': '/*initf90modhooksdynamic*/',
+               }
+commonhooks = {'commonhooks': '/*need_commonhooks*/',
+               'initcommonhooks': '/*need_initcommonhooks*/',
+               }
+
+############ Includes ###################
+
+includes0['math.h'] = '#include <math.h>'
+includes0['string.h'] = '#include <string.h>'
+includes0['setjmp.h'] = '#include <setjmp.h>'
+
+includes['Python.h'] = '#include "Python.h"'
+needs['arrayobject.h'] = ['Python.h']
+includes['arrayobject.h'] = '''#define PY_ARRAY_UNIQUE_SYMBOL PyArray_API
+#include "arrayobject.h"'''
+
+includes['arrayobject.h'] = '#include "fortranobject.h"'
+includes['stdarg.h'] = '#include <stdarg.h>'
+
+############# Type definitions ###############
+
+typedefs['unsigned_char'] = 'typedef unsigned char unsigned_char;'
+typedefs['unsigned_short'] = 'typedef unsigned short unsigned_short;'
+typedefs['unsigned_long'] = 'typedef unsigned long unsigned_long;'
+typedefs['signed_char'] = 'typedef signed char signed_char;'
+typedefs['long_long'] = """\
+#ifdef _WIN32
+typedef __int64 long_long;
+#else
+typedef long long long_long;
+typedef unsigned long long unsigned_long_long;
+#endif
+"""
+typedefs['unsigned_long_long'] = """\
+#ifdef _WIN32
+typedef __uint64 long_long;
+#else
+typedef unsigned long long unsigned_long_long;
+#endif
+"""
+typedefs['long_double'] = """\
+#ifndef _LONG_DOUBLE
+typedef long double long_double;
+#endif
+"""
+typedefs[
+    'complex_long_double'] = 'typedef struct {long double r,i;} complex_long_double;'
+typedefs['complex_float'] = 'typedef struct {float r,i;} complex_float;'
+typedefs['complex_double'] = 'typedef struct {double r,i;} complex_double;'
+typedefs['string'] = """typedef char * string;"""
+
+
+############### CPP macros ####################
+cppmacros['CFUNCSMESS'] = """\
+#ifdef DEBUGCFUNCS
+#define CFUNCSMESS(mess) fprintf(stderr,\"debug-capi:\"mess);
+#define CFUNCSMESSPY(mess,obj) CFUNCSMESS(mess) \\
+    PyObject_Print((PyObject *)obj,stderr,Py_PRINT_RAW);\\
+    fprintf(stderr,\"\\n\");
+#else
+#define CFUNCSMESS(mess)
+#define CFUNCSMESSPY(mess,obj)
+#endif
+"""
+cppmacros['F_FUNC'] = """\
+#if defined(PREPEND_FORTRAN)
+#if defined(NO_APPEND_FORTRAN)
+#if defined(UPPERCASE_FORTRAN)
+#define F_FUNC(f,F) _##F
+#else
+#define F_FUNC(f,F) _##f
+#endif
+#else
+#if defined(UPPERCASE_FORTRAN)
+#define F_FUNC(f,F) _##F##_
+#else
+#define F_FUNC(f,F) _##f##_
+#endif
+#endif
+#else
+#if defined(NO_APPEND_FORTRAN)
+#if defined(UPPERCASE_FORTRAN)
+#define F_FUNC(f,F) F
+#else
+#define F_FUNC(f,F) f
+#endif
+#else
+#if defined(UPPERCASE_FORTRAN)
+#define F_FUNC(f,F) F##_
+#else
+#define F_FUNC(f,F) f##_
+#endif
+#endif
+#endif
+#if defined(UNDERSCORE_G77)
+#define F_FUNC_US(f,F) F_FUNC(f##_,F##_)
+#else
+#define F_FUNC_US(f,F) F_FUNC(f,F)
+#endif
+"""
+cppmacros['F_WRAPPEDFUNC'] = """\
+#if defined(PREPEND_FORTRAN)
+#if defined(NO_APPEND_FORTRAN)
+#if defined(UPPERCASE_FORTRAN)
+#define F_WRAPPEDFUNC(f,F) _F2PYWRAP##F
+#else
+#define F_WRAPPEDFUNC(f,F) _f2pywrap##f
+#endif
+#else
+#if defined(UPPERCASE_FORTRAN)
+#define F_WRAPPEDFUNC(f,F) _F2PYWRAP##F##_
+#else
+#define F_WRAPPEDFUNC(f,F) _f2pywrap##f##_
+#endif
+#endif
+#else
+#if defined(NO_APPEND_FORTRAN)
+#if defined(UPPERCASE_FORTRAN)
+#define F_WRAPPEDFUNC(f,F) F2PYWRAP##F
+#else
+#define F_WRAPPEDFUNC(f,F) f2pywrap##f
+#endif
+#else
+#if defined(UPPERCASE_FORTRAN)
+#define F_WRAPPEDFUNC(f,F) F2PYWRAP##F##_
+#else
+#define F_WRAPPEDFUNC(f,F) f2pywrap##f##_
+#endif
+#endif
+#endif
+#if defined(UNDERSCORE_G77)
+#define F_WRAPPEDFUNC_US(f,F) F_WRAPPEDFUNC(f##_,F##_)
+#else
+#define F_WRAPPEDFUNC_US(f,F) F_WRAPPEDFUNC(f,F)
+#endif
+"""
+cppmacros['F_MODFUNC'] = """\
+#if defined(F90MOD2CCONV1) /*E.g. Compaq Fortran */
+#if defined(NO_APPEND_FORTRAN)
+#define F_MODFUNCNAME(m,f) $ ## m ## $ ## f
+#else
+#define F_MODFUNCNAME(m,f) $ ## m ## $ ## f ## _
+#endif
+#endif
+
+#if defined(F90MOD2CCONV2) /*E.g. IBM XL Fortran, not tested though */
+#if defined(NO_APPEND_FORTRAN)
+#define F_MODFUNCNAME(m,f)  __ ## m ## _MOD_ ## f
+#else
+#define F_MODFUNCNAME(m,f)  __ ## m ## _MOD_ ## f ## _
+#endif
+#endif
+
+#if defined(F90MOD2CCONV3) /*E.g. MIPSPro Compilers */
+#if defined(NO_APPEND_FORTRAN)
+#define F_MODFUNCNAME(m,f)  f ## .in. ## m
+#else
+#define F_MODFUNCNAME(m,f)  f ## .in. ## m ## _
+#endif
+#endif
+/*
+#if defined(UPPERCASE_FORTRAN)
+#define F_MODFUNC(m,M,f,F) F_MODFUNCNAME(M,F)
+#else
+#define F_MODFUNC(m,M,f,F) F_MODFUNCNAME(m,f)
+#endif
+*/
+
+#define F_MODFUNC(m,f) (*(f2pymodstruct##m##.##f))
+"""
+cppmacros['SWAPUNSAFE'] = """\
+#define SWAP(a,b) (size_t)(a) = ((size_t)(a) ^ (size_t)(b));\\
+ (size_t)(b) = ((size_t)(a) ^ (size_t)(b));\\
+ (size_t)(a) = ((size_t)(a) ^ (size_t)(b))
+"""
+cppmacros['SWAP'] = """\
+#define SWAP(a,b,t) {\\
+    t *c;\\
+    c = a;\\
+    a = b;\\
+    b = c;}
+"""
+# cppmacros['ISCONTIGUOUS']='#define ISCONTIGUOUS(m) (PyArray_FLAGS(m) &
+# NPY_ARRAY_C_CONTIGUOUS)'
+cppmacros['PRINTPYOBJERR'] = """\
+#define PRINTPYOBJERR(obj)\\
+    fprintf(stderr,\"#modulename#.error is related to \");\\
+    PyObject_Print((PyObject *)obj,stderr,Py_PRINT_RAW);\\
+    fprintf(stderr,\"\\n\");
+"""
+cppmacros['MINMAX'] = """\
+#ifndef max
+#define max(a,b) ((a > b) ? (a) : (b))
+#endif
+#ifndef min
+#define min(a,b) ((a < b) ? (a) : (b))
+#endif
+#ifndef MAX
+#define MAX(a,b) ((a > b) ? (a) : (b))
+#endif
+#ifndef MIN
+#define MIN(a,b) ((a < b) ? (a) : (b))
+#endif
+"""
+needs['len..'] = ['f2py_size']
+cppmacros['len..'] = """\
+#define rank(var) var ## _Rank
+#define shape(var,dim) var ## _Dims[dim]
+#define old_rank(var) (PyArray_NDIM((PyArrayObject *)(capi_ ## var ## _tmp)))
+#define old_shape(var,dim) PyArray_DIM(((PyArrayObject *)(capi_ ## var ## _tmp)),dim)
+#define fshape(var,dim) shape(var,rank(var)-dim-1)
+#define len(var) shape(var,0)
+#define flen(var) fshape(var,0)
+#define old_size(var) PyArray_SIZE((PyArrayObject *)(capi_ ## var ## _tmp))
+/* #define index(i) capi_i ## i */
+#define slen(var) capi_ ## var ## _len
+#define size(var, ...) f2py_size((PyArrayObject *)(capi_ ## var ## _tmp), ## __VA_ARGS__, -1)
+"""
+needs['f2py_size'] = ['stdarg.h']
+cfuncs['f2py_size'] = """\
+static int f2py_size(PyArrayObject* var, ...)
+{
+  npy_int sz = 0;
+  npy_int dim;
+  npy_int rank;
+  va_list argp;
+  va_start(argp, var);
+  dim = va_arg(argp, npy_int);
+  if (dim==-1)
+    {
+      sz = PyArray_SIZE(var);
+    }
+  else
+    {
+      rank = PyArray_NDIM(var);
+      if (dim>=1 && dim<=rank)
+        sz = PyArray_DIM(var, dim-1);
+      else
+        fprintf(stderr, \"f2py_size: 2nd argument value=%d fails to satisfy 1<=value<=%d. Result will be 0.\\n\", dim, rank);
+    }
+  va_end(argp);
+  return sz;
+}
+"""
+
+cppmacros[
+    'pyobj_from_char1'] = '#define pyobj_from_char1(v) (PyInt_FromLong(v))'
+cppmacros[
+    'pyobj_from_short1'] = '#define pyobj_from_short1(v) (PyInt_FromLong(v))'
+needs['pyobj_from_int1'] = ['signed_char']
+cppmacros['pyobj_from_int1'] = '#define pyobj_from_int1(v) (PyInt_FromLong(v))'
+cppmacros[
+    'pyobj_from_long1'] = '#define pyobj_from_long1(v) (PyLong_FromLong(v))'
+needs['pyobj_from_long_long1'] = ['long_long']
+cppmacros['pyobj_from_long_long1'] = """\
+#ifdef HAVE_LONG_LONG
+#define pyobj_from_long_long1(v) (PyLong_FromLongLong(v))
+#else
+#warning HAVE_LONG_LONG is not available. Redefining pyobj_from_long_long.
+#define pyobj_from_long_long1(v) (PyLong_FromLong(v))
+#endif
+"""
+needs['pyobj_from_long_double1'] = ['long_double']
+cppmacros[
+    'pyobj_from_long_double1'] = '#define pyobj_from_long_double1(v) (PyFloat_FromDouble(v))'
+cppmacros[
+    'pyobj_from_double1'] = '#define pyobj_from_double1(v) (PyFloat_FromDouble(v))'
+cppmacros[
+    'pyobj_from_float1'] = '#define pyobj_from_float1(v) (PyFloat_FromDouble(v))'
+needs['pyobj_from_complex_long_double1'] = ['complex_long_double']
+cppmacros[
+    'pyobj_from_complex_long_double1'] = '#define pyobj_from_complex_long_double1(v) (PyComplex_FromDoubles(v.r,v.i))'
+needs['pyobj_from_complex_double1'] = ['complex_double']
+cppmacros[
+    'pyobj_from_complex_double1'] = '#define pyobj_from_complex_double1(v) (PyComplex_FromDoubles(v.r,v.i))'
+needs['pyobj_from_complex_float1'] = ['complex_float']
+cppmacros[
+    'pyobj_from_complex_float1'] = '#define pyobj_from_complex_float1(v) (PyComplex_FromDoubles(v.r,v.i))'
+needs['pyobj_from_string1'] = ['string']
+cppmacros[
+    'pyobj_from_string1'] = '#define pyobj_from_string1(v) (PyString_FromString((char *)v))'
+needs['pyobj_from_string1size'] = ['string']
+cppmacros[
+    'pyobj_from_string1size'] = '#define pyobj_from_string1size(v,len) (PyUString_FromStringAndSize((char *)v, len))'
+needs['TRYPYARRAYTEMPLATE'] = ['PRINTPYOBJERR']
+cppmacros['TRYPYARRAYTEMPLATE'] = """\
+/* New SciPy */
+#define TRYPYARRAYTEMPLATECHAR case NPY_STRING: *(char *)(PyArray_DATA(arr))=*v; break;
+#define TRYPYARRAYTEMPLATELONG case NPY_LONG: *(long *)(PyArray_DATA(arr))=*v; break;
+#define TRYPYARRAYTEMPLATEOBJECT case NPY_OBJECT: PyArray_SETITEM(arr,PyArray_DATA(arr),pyobj_from_ ## ctype ## 1(*v)); break;
+
+#define TRYPYARRAYTEMPLATE(ctype,typecode) \\
+        PyArrayObject *arr = NULL;\\
+        if (!obj) return -2;\\
+        if (!PyArray_Check(obj)) return -1;\\
+        if (!(arr=(PyArrayObject *)obj)) {fprintf(stderr,\"TRYPYARRAYTEMPLATE:\");PRINTPYOBJERR(obj);return 0;}\\
+        if (PyArray_DESCR(arr)->type==typecode)  {*(ctype *)(PyArray_DATA(arr))=*v; return 1;}\\
+        switch (PyArray_TYPE(arr)) {\\
+                case NPY_DOUBLE: *(double *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_INT: *(int *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_LONG: *(long *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_FLOAT: *(float *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_CDOUBLE: *(double *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_CFLOAT: *(float *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_BOOL: *(npy_bool *)(PyArray_DATA(arr))=(*v!=0); break;\\
+                case NPY_UBYTE: *(unsigned char *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_BYTE: *(signed char *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_SHORT: *(short *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_USHORT: *(npy_ushort *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_UINT: *(npy_uint *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_ULONG: *(npy_ulong *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_LONGLONG: *(npy_longlong *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_ULONGLONG: *(npy_ulonglong *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_LONGDOUBLE: *(npy_longdouble *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_CLONGDOUBLE: *(npy_longdouble *)(PyArray_DATA(arr))=*v; break;\\
+                case NPY_OBJECT: PyArray_SETITEM(arr, PyArray_DATA(arr), pyobj_from_ ## ctype ## 1(*v)); break;\\
+        default: return -2;\\
+        };\\
+        return 1
+"""
+
+needs['TRYCOMPLEXPYARRAYTEMPLATE'] = ['PRINTPYOBJERR']
+cppmacros['TRYCOMPLEXPYARRAYTEMPLATE'] = """\
+#define TRYCOMPLEXPYARRAYTEMPLATEOBJECT case NPY_OBJECT: PyArray_SETITEM(arr, PyArray_DATA(arr), pyobj_from_complex_ ## ctype ## 1((*v))); break;
+#define TRYCOMPLEXPYARRAYTEMPLATE(ctype,typecode)\\
+        PyArrayObject *arr = NULL;\\
+        if (!obj) return -2;\\
+        if (!PyArray_Check(obj)) return -1;\\
+        if (!(arr=(PyArrayObject *)obj)) {fprintf(stderr,\"TRYCOMPLEXPYARRAYTEMPLATE:\");PRINTPYOBJERR(obj);return 0;}\\
+        if (PyArray_DESCR(arr)->type==typecode) {\\
+            *(ctype *)(PyArray_DATA(arr))=(*v).r;\\
+            *(ctype *)(PyArray_DATA(arr)+sizeof(ctype))=(*v).i;\\
+            return 1;\\
+        }\\
+        switch (PyArray_TYPE(arr)) {\\
+                case NPY_CDOUBLE: *(double *)(PyArray_DATA(arr))=(*v).r;*(double *)(PyArray_DATA(arr)+sizeof(double))=(*v).i;break;\\
+                case NPY_CFLOAT: *(float *)(PyArray_DATA(arr))=(*v).r;*(float *)(PyArray_DATA(arr)+sizeof(float))=(*v).i;break;\\
+                case NPY_DOUBLE: *(double *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_LONG: *(long *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_FLOAT: *(float *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_INT: *(int *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_SHORT: *(short *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_UBYTE: *(unsigned char *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_BYTE: *(signed char *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_BOOL: *(npy_bool *)(PyArray_DATA(arr))=((*v).r!=0 && (*v).i!=0); break;\\
+                case NPY_USHORT: *(npy_ushort *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_UINT: *(npy_uint *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_ULONG: *(npy_ulong *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_LONGLONG: *(npy_longlong *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_ULONGLONG: *(npy_ulonglong *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_LONGDOUBLE: *(npy_longdouble *)(PyArray_DATA(arr))=(*v).r; break;\\
+                case NPY_CLONGDOUBLE: *(npy_longdouble *)(PyArray_DATA(arr))=(*v).r;*(npy_longdouble *)(PyArray_DATA(arr)+sizeof(npy_longdouble))=(*v).i;break;\\
+                case NPY_OBJECT: PyArray_SETITEM(arr, PyArray_DATA(arr), pyobj_from_complex_ ## ctype ## 1((*v))); break;\\
+                default: return -2;\\
+        };\\
+        return -1;
+"""
+# cppmacros['NUMFROMARROBJ']="""\
+# define NUMFROMARROBJ(typenum,ctype) \\
+#     if (PyArray_Check(obj)) arr = (PyArrayObject *)obj;\\
+#     else arr = (PyArrayObject *)PyArray_ContiguousFromObject(obj,typenum,0,0);\\
+#     if (arr) {\\
+#         if (PyArray_TYPE(arr)==NPY_OBJECT) {\\
+#             if (!ctype ## _from_pyobj(v,(PyArray_DESCR(arr)->getitem)(PyArray_DATA(arr)),\"\"))\\
+#             goto capi_fail;\\
+#         } else {\\
+#             (PyArray_DESCR(arr)->cast[typenum])(PyArray_DATA(arr),1,(char*)v,1,1);\\
+#         }\\
+#         if ((PyObject *)arr != obj) { Py_DECREF(arr); }\\
+#         return 1;\\
+#     }
+# """
+# XXX: Note that CNUMFROMARROBJ is identical with NUMFROMARROBJ
+# cppmacros['CNUMFROMARROBJ']="""\
+# define CNUMFROMARROBJ(typenum,ctype) \\
+#     if (PyArray_Check(obj)) arr = (PyArrayObject *)obj;\\
+#     else arr = (PyArrayObject *)PyArray_ContiguousFromObject(obj,typenum,0,0);\\
+#     if (arr) {\\
+#         if (PyArray_TYPE(arr)==NPY_OBJECT) {\\
+#             if (!ctype ## _from_pyobj(v,(PyArray_DESCR(arr)->getitem)(PyArray_DATA(arr)),\"\"))\\
+#             goto capi_fail;\\
+#         } else {\\
+#             (PyArray_DESCR(arr)->cast[typenum])((void *)(PyArray_DATA(arr)),1,(void *)(v),1,1);\\
+#         }\\
+#         if ((PyObject *)arr != obj) { Py_DECREF(arr); }\\
+#         return 1;\\
+#     }
+# """
+
+
+needs['GETSTRFROMPYTUPLE'] = ['STRINGCOPYN', 'PRINTPYOBJERR']
+cppmacros['GETSTRFROMPYTUPLE'] = """\
+#define GETSTRFROMPYTUPLE(tuple,index,str,len) {\\
+        PyObject *rv_cb_str = PyTuple_GetItem((tuple),(index));\\
+        if (rv_cb_str == NULL)\\
+            goto capi_fail;\\
+        if (PyString_Check(rv_cb_str)) {\\
+            str[len-1]='\\0';\\
+            STRINGCOPYN((str),PyString_AS_STRING((PyStringObject*)rv_cb_str),(len));\\
+        } else {\\
+            PRINTPYOBJERR(rv_cb_str);\\
+            PyErr_SetString(#modulename#_error,\"string object expected\");\\
+            goto capi_fail;\\
+        }\\
+    }
+"""
+cppmacros['GETSCALARFROMPYTUPLE'] = """\
+#define GETSCALARFROMPYTUPLE(tuple,index,var,ctype,mess) {\\
+        if ((capi_tmp = PyTuple_GetItem((tuple),(index)))==NULL) goto capi_fail;\\
+        if (!(ctype ## _from_pyobj((var),capi_tmp,mess)))\\
+            goto capi_fail;\\
+    }
+"""
+
+cppmacros['FAILNULL'] = """\\
+#define FAILNULL(p) do {                                            \\
+    if ((p) == NULL) {                                              \\
+        PyErr_SetString(PyExc_MemoryError, "NULL pointer found");   \\
+        goto capi_fail;                                             \\
+    }                                                               \\
+} while (0)
+"""
+needs['MEMCOPY'] = ['string.h', 'FAILNULL']
+cppmacros['MEMCOPY'] = """\
+#define MEMCOPY(to,from,n)\\
+    do { FAILNULL(to); FAILNULL(from); (void)memcpy(to,from,n); } while (0)
+"""
+cppmacros['STRINGMALLOC'] = """\
+#define STRINGMALLOC(str,len)\\
+    if ((str = (string)malloc(sizeof(char)*(len+1))) == NULL) {\\
+        PyErr_SetString(PyExc_MemoryError, \"out of memory\");\\
+        goto capi_fail;\\
+    } else {\\
+        (str)[len] = '\\0';\\
+    }
+"""
+cppmacros['STRINGFREE'] = """\
+#define STRINGFREE(str) do {if (!(str == NULL)) free(str);} while (0)
+"""
+needs['STRINGCOPYN'] = ['string.h', 'FAILNULL']
+cppmacros['STRINGCOPYN'] = """\
+#define STRINGCOPYN(to,from,buf_size)                           \\
+    do {                                                        \\
+        int _m = (buf_size);                                    \\
+        char *_to = (to);                                       \\
+        char *_from = (from);                                   \\
+        FAILNULL(_to); FAILNULL(_from);                         \\
+        (void)strncpy(_to, _from, sizeof(char)*_m);             \\
+        _to[_m-1] = '\\0';                                      \\
+        /* Padding with spaces instead of nulls */              \\
+        for (_m -= 2; _m >= 0 && _to[_m] == '\\0'; _m--) {      \\
+            _to[_m] = ' ';                                      \\
+        }                                                       \\
+    } while (0)
+"""
+needs['STRINGCOPY'] = ['string.h', 'FAILNULL']
+cppmacros['STRINGCOPY'] = """\
+#define STRINGCOPY(to,from)\\
+    do { FAILNULL(to); FAILNULL(from); (void)strcpy(to,from); } while (0)
+"""
+cppmacros['CHECKGENERIC'] = """\
+#define CHECKGENERIC(check,tcheck,name) \\
+    if (!(check)) {\\
+        PyErr_SetString(#modulename#_error,\"(\"tcheck\") failed for \"name);\\
+        /*goto capi_fail;*/\\
+    } else """
+cppmacros['CHECKARRAY'] = """\
+#define CHECKARRAY(check,tcheck,name) \\
+    if (!(check)) {\\
+        PyErr_SetString(#modulename#_error,\"(\"tcheck\") failed for \"name);\\
+        /*goto capi_fail;*/\\
+    } else """
+cppmacros['CHECKSTRING'] = """\
+#define CHECKSTRING(check,tcheck,name,show,var)\\
+    if (!(check)) {\\
+        char errstring[256];\\
+        sprintf(errstring, \"%s: \"show, \"(\"tcheck\") failed for \"name, slen(var), var);\\
+        PyErr_SetString(#modulename#_error, errstring);\\
+        /*goto capi_fail;*/\\
+    } else """
+cppmacros['CHECKSCALAR'] = """\
+#define CHECKSCALAR(check,tcheck,name,show,var)\\
+    if (!(check)) {\\
+        char errstring[256];\\
+        sprintf(errstring, \"%s: \"show, \"(\"tcheck\") failed for \"name, var);\\
+        PyErr_SetString(#modulename#_error,errstring);\\
+        /*goto capi_fail;*/\\
+    } else """
+# cppmacros['CHECKDIMS']="""\
+# define CHECKDIMS(dims,rank) \\
+#     for (int i=0;i<(rank);i++)\\
+#         if (dims[i]<0) {\\
+#             fprintf(stderr,\"Unspecified array argument requires a complete dimension specification.\\n\");\\
+#             goto capi_fail;\\
+#         }
+# """
+cppmacros[
+    'ARRSIZE'] = '#define ARRSIZE(dims,rank) (_PyArray_multiply_list(dims,rank))'
+cppmacros['OLDPYNUM'] = """\
+#ifdef OLDPYNUM
+#error You need to install NumPy version 0.13 or higher. See https://scipy.org/install.html
+#endif
+"""
+################# C functions ###############
+
+cfuncs['calcarrindex'] = """\
+static int calcarrindex(int *i,PyArrayObject *arr) {
+    int k,ii = i[0];
+    for (k=1; k < PyArray_NDIM(arr); k++)
+        ii += (ii*(PyArray_DIM(arr,k) - 1)+i[k]); /* assuming contiguous arr */
+    return ii;
+}"""
+cfuncs['calcarrindextr'] = """\
+static int calcarrindextr(int *i,PyArrayObject *arr) {
+    int k,ii = i[PyArray_NDIM(arr)-1];
+    for (k=1; k < PyArray_NDIM(arr); k++)
+        ii += (ii*(PyArray_DIM(arr,PyArray_NDIM(arr)-k-1) - 1)+i[PyArray_NDIM(arr)-k-1]); /* assuming contiguous arr */
+    return ii;
+}"""
+cfuncs['forcomb'] = """\
+static struct { int nd;npy_intp *d;int *i,*i_tr,tr; } forcombcache;
+static int initforcomb(npy_intp *dims,int nd,int tr) {
+  int k;
+  if (dims==NULL) return 0;
+  if (nd<0) return 0;
+  forcombcache.nd = nd;
+  forcombcache.d = dims;
+  forcombcache.tr = tr;
+  if ((forcombcache.i = (int *)malloc(sizeof(int)*nd))==NULL) return 0;
+  if ((forcombcache.i_tr = (int *)malloc(sizeof(int)*nd))==NULL) return 0;
+  for (k=1;k<nd;k++) {
+    forcombcache.i[k] = forcombcache.i_tr[nd-k-1] = 0;
+  }
+  forcombcache.i[0] = forcombcache.i_tr[nd-1] = -1;
+  return 1;
+}
+static int *nextforcomb(void) {
+  int j,*i,*i_tr,k;
+  int nd=forcombcache.nd;
+  if ((i=forcombcache.i) == NULL) return NULL;
+  if ((i_tr=forcombcache.i_tr) == NULL) return NULL;
+  if (forcombcache.d == NULL) return NULL;
+  i[0]++;
+  if (i[0]==forcombcache.d[0]) {
+    j=1;
+    while ((j<nd) && (i[j]==forcombcache.d[j]-1)) j++;
+    if (j==nd) {
+      free(i);
+      free(i_tr);
+      return NULL;
+    }
+    for (k=0;k<j;k++) i[k] = i_tr[nd-k-1] = 0;
+    i[j]++;
+    i_tr[nd-j-1]++;
+  } else
+    i_tr[nd-1]++;
+  if (forcombcache.tr) return i_tr;
+  return i;
+}"""
+needs['try_pyarr_from_string'] = ['STRINGCOPYN', 'PRINTPYOBJERR', 'string']
+cfuncs['try_pyarr_from_string'] = """\
+static int try_pyarr_from_string(PyObject *obj,const string str) {
+    PyArrayObject *arr = NULL;
+    if (PyArray_Check(obj) && (!((arr = (PyArrayObject *)obj) == NULL)))
+        { STRINGCOPYN(PyArray_DATA(arr),str,PyArray_NBYTES(arr)); }
+    return 1;
+capi_fail:
+    PRINTPYOBJERR(obj);
+    PyErr_SetString(#modulename#_error,\"try_pyarr_from_string failed\");
+    return 0;
+}
+"""
+needs['string_from_pyobj'] = ['string', 'STRINGMALLOC', 'STRINGCOPYN']
+cfuncs['string_from_pyobj'] = """\
+static int string_from_pyobj(string *str,int *len,const string inistr,PyObject *obj,const char *errmess) {
+    PyArrayObject *arr = NULL;
+    PyObject *tmp = NULL;
+#ifdef DEBUGCFUNCS
+fprintf(stderr,\"string_from_pyobj(str='%s',len=%d,inistr='%s',obj=%p)\\n\",(char*)str,*len,(char *)inistr,obj);
+#endif
+    if (obj == Py_None) {
+        if (*len == -1)
+            *len = strlen(inistr); /* Will this cause problems? */
+        STRINGMALLOC(*str,*len);
+        STRINGCOPYN(*str,inistr,*len+1);
+        return 1;
+    }
+    if (PyArray_Check(obj)) {
+        if ((arr = (PyArrayObject *)obj) == NULL)
+            goto capi_fail;
+        if (!ISCONTIGUOUS(arr)) {
+            PyErr_SetString(PyExc_ValueError,\"array object is non-contiguous.\");
+            goto capi_fail;
+        }
+        if (*len == -1)
+            *len = (PyArray_ITEMSIZE(arr))*PyArray_SIZE(arr);
+        STRINGMALLOC(*str,*len);
+        STRINGCOPYN(*str,PyArray_DATA(arr),*len+1);
+        return 1;
+    }
+    if (PyString_Check(obj)) {
+        tmp = obj;
+        Py_INCREF(tmp);
+    }
+    else if (PyUnicode_Check(obj)) {
+        tmp = PyUnicode_AsASCIIString(obj);
+    }
+    else {
+        PyObject *tmp2;
+        tmp2 = PyObject_Str(obj);
+        if (tmp2) {
+            tmp = PyUnicode_AsASCIIString(tmp2);
+            Py_DECREF(tmp2);
+        }
+        else {
+            tmp = NULL;
+        }
+    }
+    if (tmp == NULL) goto capi_fail;
+    if (*len == -1)
+        *len = PyString_GET_SIZE(tmp);
+    STRINGMALLOC(*str,*len);
+    STRINGCOPYN(*str,PyString_AS_STRING(tmp),*len+1);
+    Py_DECREF(tmp);
+    return 1;
+capi_fail:
+    Py_XDECREF(tmp);
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL) err = #modulename#_error;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+needs['char_from_pyobj'] = ['int_from_pyobj']
+cfuncs['char_from_pyobj'] = """\
+static int char_from_pyobj(char* v,PyObject *obj,const char *errmess) {
+    int i=0;
+    if (int_from_pyobj(&i,obj,errmess)) {
+        *v = (char)i;
+        return 1;
+    }
+    return 0;
+}
+"""
+needs['signed_char_from_pyobj'] = ['int_from_pyobj', 'signed_char']
+cfuncs['signed_char_from_pyobj'] = """\
+static int signed_char_from_pyobj(signed_char* v,PyObject *obj,const char *errmess) {
+    int i=0;
+    if (int_from_pyobj(&i,obj,errmess)) {
+        *v = (signed_char)i;
+        return 1;
+    }
+    return 0;
+}
+"""
+needs['short_from_pyobj'] = ['int_from_pyobj']
+cfuncs['short_from_pyobj'] = """\
+static int short_from_pyobj(short* v,PyObject *obj,const char *errmess) {
+    int i=0;
+    if (int_from_pyobj(&i,obj,errmess)) {
+        *v = (short)i;
+        return 1;
+    }
+    return 0;
+}
+"""
+cfuncs['int_from_pyobj'] = """\
+static int int_from_pyobj(int* v,PyObject *obj,const char *errmess) {
+    PyObject* tmp = NULL;
+    if (PyInt_Check(obj)) {
+        *v = (int)PyInt_AS_LONG(obj);
+        return 1;
+    }
+    tmp = PyNumber_Int(obj);
+    if (tmp) {
+        *v = PyInt_AS_LONG(tmp);
+        Py_DECREF(tmp);
+        return 1;
+    }
+    if (PyComplex_Check(obj))
+        tmp = PyObject_GetAttrString(obj,\"real\");
+    else if (PyString_Check(obj) || PyUnicode_Check(obj))
+        /*pass*/;
+    else if (PySequence_Check(obj))
+        tmp = PySequence_GetItem(obj,0);
+    if (tmp) {
+        PyErr_Clear();
+        if (int_from_pyobj(v,tmp,errmess)) {Py_DECREF(tmp); return 1;}
+        Py_DECREF(tmp);
+    }
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL) err = #modulename#_error;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+cfuncs['long_from_pyobj'] = """\
+static int long_from_pyobj(long* v,PyObject *obj,const char *errmess) {
+    PyObject* tmp = NULL;
+    if (PyInt_Check(obj)) {
+        *v = PyInt_AS_LONG(obj);
+        return 1;
+    }
+    tmp = PyNumber_Int(obj);
+    if (tmp) {
+        *v = PyInt_AS_LONG(tmp);
+        Py_DECREF(tmp);
+        return 1;
+    }
+    if (PyComplex_Check(obj))
+        tmp = PyObject_GetAttrString(obj,\"real\");
+    else if (PyString_Check(obj) || PyUnicode_Check(obj))
+        /*pass*/;
+    else if (PySequence_Check(obj))
+        tmp = PySequence_GetItem(obj,0);
+    if (tmp) {
+        PyErr_Clear();
+        if (long_from_pyobj(v,tmp,errmess)) {Py_DECREF(tmp); return 1;}
+        Py_DECREF(tmp);
+    }
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL) err = #modulename#_error;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+needs['long_long_from_pyobj'] = ['long_long']
+cfuncs['long_long_from_pyobj'] = """\
+static int long_long_from_pyobj(long_long* v,PyObject *obj,const char *errmess) {
+    PyObject* tmp = NULL;
+    if (PyLong_Check(obj)) {
+        *v = PyLong_AsLongLong(obj);
+        return (!PyErr_Occurred());
+    }
+    if (PyInt_Check(obj)) {
+        *v = (long_long)PyInt_AS_LONG(obj);
+        return 1;
+    }
+    tmp = PyNumber_Long(obj);
+    if (tmp) {
+        *v = PyLong_AsLongLong(tmp);
+        Py_DECREF(tmp);
+        return (!PyErr_Occurred());
+    }
+    if (PyComplex_Check(obj))
+        tmp = PyObject_GetAttrString(obj,\"real\");
+    else if (PyString_Check(obj) || PyUnicode_Check(obj))
+        /*pass*/;
+    else if (PySequence_Check(obj))
+        tmp = PySequence_GetItem(obj,0);
+    if (tmp) {
+        PyErr_Clear();
+        if (long_long_from_pyobj(v,tmp,errmess)) {Py_DECREF(tmp); return 1;}
+        Py_DECREF(tmp);
+    }
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL) err = #modulename#_error;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+needs['long_double_from_pyobj'] = ['double_from_pyobj', 'long_double']
+cfuncs['long_double_from_pyobj'] = """\
+static int long_double_from_pyobj(long_double* v,PyObject *obj,const char *errmess) {
+    double d=0;
+    if (PyArray_CheckScalar(obj)){
+        if PyArray_IsScalar(obj, LongDouble) {
+            PyArray_ScalarAsCtype(obj, v);
+            return 1;
+        }
+        else if (PyArray_Check(obj) && PyArray_TYPE(obj)==NPY_LONGDOUBLE) {
+            (*v) = *((npy_longdouble *)PyArray_DATA(obj));
+            return 1;
+        }
+    }
+    if (double_from_pyobj(&d,obj,errmess)) {
+        *v = (long_double)d;
+        return 1;
+    }
+    return 0;
+}
+"""
+cfuncs['double_from_pyobj'] = """\
+static int double_from_pyobj(double* v,PyObject *obj,const char *errmess) {
+    PyObject* tmp = NULL;
+    if (PyFloat_Check(obj)) {
+#ifdef __sgi
+        *v = PyFloat_AsDouble(obj);
+#else
+        *v = PyFloat_AS_DOUBLE(obj);
+#endif
+        return 1;
+    }
+    tmp = PyNumber_Float(obj);
+    if (tmp) {
+#ifdef __sgi
+        *v = PyFloat_AsDouble(tmp);
+#else
+        *v = PyFloat_AS_DOUBLE(tmp);
+#endif
+        Py_DECREF(tmp);
+        return 1;
+    }
+    if (PyComplex_Check(obj))
+        tmp = PyObject_GetAttrString(obj,\"real\");
+    else if (PyString_Check(obj) || PyUnicode_Check(obj))
+        /*pass*/;
+    else if (PySequence_Check(obj))
+        tmp = PySequence_GetItem(obj,0);
+    if (tmp) {
+        PyErr_Clear();
+        if (double_from_pyobj(v,tmp,errmess)) {Py_DECREF(tmp); return 1;}
+        Py_DECREF(tmp);
+    }
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL) err = #modulename#_error;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+needs['float_from_pyobj'] = ['double_from_pyobj']
+cfuncs['float_from_pyobj'] = """\
+static int float_from_pyobj(float* v,PyObject *obj,const char *errmess) {
+    double d=0.0;
+    if (double_from_pyobj(&d,obj,errmess)) {
+        *v = (float)d;
+        return 1;
+    }
+    return 0;
+}
+"""
+needs['complex_long_double_from_pyobj'] = ['complex_long_double', 'long_double',
+                                           'complex_double_from_pyobj']
+cfuncs['complex_long_double_from_pyobj'] = """\
+static int complex_long_double_from_pyobj(complex_long_double* v,PyObject *obj,const char *errmess) {
+    complex_double cd={0.0,0.0};
+    if (PyArray_CheckScalar(obj)){
+        if PyArray_IsScalar(obj, CLongDouble) {
+            PyArray_ScalarAsCtype(obj, v);
+            return 1;
+        }
+        else if (PyArray_Check(obj) && PyArray_TYPE(obj)==NPY_CLONGDOUBLE) {
+            (*v).r = ((npy_clongdouble *)PyArray_DATA(obj))->real;
+            (*v).i = ((npy_clongdouble *)PyArray_DATA(obj))->imag;
+            return 1;
+        }
+    }
+    if (complex_double_from_pyobj(&cd,obj,errmess)) {
+        (*v).r = (long_double)cd.r;
+        (*v).i = (long_double)cd.i;
+        return 1;
+    }
+    return 0;
+}
+"""
+needs['complex_double_from_pyobj'] = ['complex_double']
+cfuncs['complex_double_from_pyobj'] = """\
+static int complex_double_from_pyobj(complex_double* v,PyObject *obj,const char *errmess) {
+    Py_complex c;
+    if (PyComplex_Check(obj)) {
+        c=PyComplex_AsCComplex(obj);
+        (*v).r=c.real, (*v).i=c.imag;
+        return 1;
+    }
+    if (PyArray_IsScalar(obj, ComplexFloating)) {
+        if (PyArray_IsScalar(obj, CFloat)) {
+            npy_cfloat new;
+            PyArray_ScalarAsCtype(obj, &new);
+            (*v).r = (double)new.real;
+            (*v).i = (double)new.imag;
+        }
+        else if (PyArray_IsScalar(obj, CLongDouble)) {
+            npy_clongdouble new;
+            PyArray_ScalarAsCtype(obj, &new);
+            (*v).r = (double)new.real;
+            (*v).i = (double)new.imag;
+        }
+        else { /* if (PyArray_IsScalar(obj, CDouble)) */
+            PyArray_ScalarAsCtype(obj, v);
+        }
+        return 1;
+    }
+    if (PyArray_CheckScalar(obj)) { /* 0-dim array or still array scalar */
+        PyObject *arr;
+        if (PyArray_Check(obj)) {
+            arr = PyArray_Cast((PyArrayObject *)obj, NPY_CDOUBLE);
+        }
+        else {
+            arr = PyArray_FromScalar(obj, PyArray_DescrFromType(NPY_CDOUBLE));
+        }
+        if (arr==NULL) return 0;
+        (*v).r = ((npy_cdouble *)PyArray_DATA(arr))->real;
+        (*v).i = ((npy_cdouble *)PyArray_DATA(arr))->imag;
+        return 1;
+    }
+    /* Python does not provide PyNumber_Complex function :-( */
+    (*v).i=0.0;
+    if (PyFloat_Check(obj)) {
+#ifdef __sgi
+        (*v).r = PyFloat_AsDouble(obj);
+#else
+        (*v).r = PyFloat_AS_DOUBLE(obj);
+#endif
+        return 1;
+    }
+    if (PyInt_Check(obj)) {
+        (*v).r = (double)PyInt_AS_LONG(obj);
+        return 1;
+    }
+    if (PyLong_Check(obj)) {
+        (*v).r = PyLong_AsDouble(obj);
+        return (!PyErr_Occurred());
+    }
+    if (PySequence_Check(obj) && !(PyString_Check(obj) || PyUnicode_Check(obj))) {
+        PyObject *tmp = PySequence_GetItem(obj,0);
+        if (tmp) {
+            if (complex_double_from_pyobj(v,tmp,errmess)) {
+                Py_DECREF(tmp);
+                return 1;
+            }
+            Py_DECREF(tmp);
+        }
+    }
+    {
+        PyObject* err = PyErr_Occurred();
+        if (err==NULL)
+            err = PyExc_TypeError;
+        PyErr_SetString(err,errmess);
+    }
+    return 0;
+}
+"""
+needs['complex_float_from_pyobj'] = [
+    'complex_float', 'complex_double_from_pyobj']
+cfuncs['complex_float_from_pyobj'] = """\
+static int complex_float_from_pyobj(complex_float* v,PyObject *obj,const char *errmess) {
+    complex_double cd={0.0,0.0};
+    if (complex_double_from_pyobj(&cd,obj,errmess)) {
+        (*v).r = (float)cd.r;
+        (*v).i = (float)cd.i;
+        return 1;
+    }
+    return 0;
+}
+"""
+needs['try_pyarr_from_char'] = ['pyobj_from_char1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_char'] = 'static int try_pyarr_from_char(PyObject* obj,char* v) {\n    TRYPYARRAYTEMPLATE(char,\'c\');\n}\n'
+needs['try_pyarr_from_signed_char'] = ['TRYPYARRAYTEMPLATE', 'unsigned_char']
+cfuncs[
+    'try_pyarr_from_unsigned_char'] = 'static int try_pyarr_from_unsigned_char(PyObject* obj,unsigned_char* v) {\n    TRYPYARRAYTEMPLATE(unsigned_char,\'b\');\n}\n'
+needs['try_pyarr_from_signed_char'] = ['TRYPYARRAYTEMPLATE', 'signed_char']
+cfuncs[
+    'try_pyarr_from_signed_char'] = 'static int try_pyarr_from_signed_char(PyObject* obj,signed_char* v) {\n    TRYPYARRAYTEMPLATE(signed_char,\'1\');\n}\n'
+needs['try_pyarr_from_short'] = ['pyobj_from_short1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_short'] = 'static int try_pyarr_from_short(PyObject* obj,short* v) {\n    TRYPYARRAYTEMPLATE(short,\'s\');\n}\n'
+needs['try_pyarr_from_int'] = ['pyobj_from_int1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_int'] = 'static int try_pyarr_from_int(PyObject* obj,int* v) {\n    TRYPYARRAYTEMPLATE(int,\'i\');\n}\n'
+needs['try_pyarr_from_long'] = ['pyobj_from_long1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_long'] = 'static int try_pyarr_from_long(PyObject* obj,long* v) {\n    TRYPYARRAYTEMPLATE(long,\'l\');\n}\n'
+needs['try_pyarr_from_long_long'] = [
+    'pyobj_from_long_long1', 'TRYPYARRAYTEMPLATE', 'long_long']
+cfuncs[
+    'try_pyarr_from_long_long'] = 'static int try_pyarr_from_long_long(PyObject* obj,long_long* v) {\n    TRYPYARRAYTEMPLATE(long_long,\'L\');\n}\n'
+needs['try_pyarr_from_float'] = ['pyobj_from_float1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_float'] = 'static int try_pyarr_from_float(PyObject* obj,float* v) {\n    TRYPYARRAYTEMPLATE(float,\'f\');\n}\n'
+needs['try_pyarr_from_double'] = ['pyobj_from_double1', 'TRYPYARRAYTEMPLATE']
+cfuncs[
+    'try_pyarr_from_double'] = 'static int try_pyarr_from_double(PyObject* obj,double* v) {\n    TRYPYARRAYTEMPLATE(double,\'d\');\n}\n'
+needs['try_pyarr_from_complex_float'] = [
+    'pyobj_from_complex_float1', 'TRYCOMPLEXPYARRAYTEMPLATE', 'complex_float']
+cfuncs[
+    'try_pyarr_from_complex_float'] = 'static int try_pyarr_from_complex_float(PyObject* obj,complex_float* v) {\n    TRYCOMPLEXPYARRAYTEMPLATE(float,\'F\');\n}\n'
+needs['try_pyarr_from_complex_double'] = [
+    'pyobj_from_complex_double1', 'TRYCOMPLEXPYARRAYTEMPLATE', 'complex_double']
+cfuncs[
+    'try_pyarr_from_complex_double'] = 'static int try_pyarr_from_complex_double(PyObject* obj,complex_double* v) {\n    TRYCOMPLEXPYARRAYTEMPLATE(double,\'D\');\n}\n'
+
+needs['create_cb_arglist'] = ['CFUNCSMESS', 'PRINTPYOBJERR', 'MINMAX']
+
+# create the list of arguments to be used when calling back to python
+cfuncs['create_cb_arglist'] = """\
+static int create_cb_arglist(PyObject* fun,PyTupleObject* xa,const int maxnofargs,const int nofoptargs,int *nofargs,PyTupleObject **args,const char *errmess) {
+    PyObject *tmp = NULL;
+    PyObject *tmp_fun = NULL;
+    int tot,opt,ext,siz,i,di=0;
+    CFUNCSMESS(\"create_cb_arglist\\n\");
+    tot=opt=ext=siz=0;
+    /* Get the total number of arguments */
+    if (PyFunction_Check(fun)) {
+        tmp_fun = fun;
+        Py_INCREF(tmp_fun);
+    }
+    else {
+        di = 1;
+        if (PyObject_HasAttrString(fun,\"im_func\")) {
+            tmp_fun = PyObject_GetAttrString(fun,\"im_func\");
+        }
+        else if (PyObject_HasAttrString(fun,\"__call__\")) {
+            tmp = PyObject_GetAttrString(fun,\"__call__\");
+            if (PyObject_HasAttrString(tmp,\"im_func\"))
+                tmp_fun = PyObject_GetAttrString(tmp,\"im_func\");
+            else {
+                tmp_fun = fun; /* built-in function */
+                Py_INCREF(tmp_fun);
+                tot = maxnofargs;
+                if (PyCFunction_Check(fun)) {
+                    /* In case the function has a co_argcount (like on PyPy) */
+                    di = 0;
+                }
+                if (xa != NULL)
+                    tot += PyTuple_Size((PyObject *)xa);
+            }
+            Py_XDECREF(tmp);
+        }
+        else if (PyFortran_Check(fun) || PyFortran_Check1(fun)) {
+            tot = maxnofargs;
+            if (xa != NULL)
+                tot += PyTuple_Size((PyObject *)xa);
+            tmp_fun = fun;
+            Py_INCREF(tmp_fun);
+        }
+        else if (F2PyCapsule_Check(fun)) {
+            tot = maxnofargs;
+            if (xa != NULL)
+                ext = PyTuple_Size((PyObject *)xa);
+            if(ext>0) {
+                fprintf(stderr,\"extra arguments tuple cannot be used with CObject call-back\\n\");
+                goto capi_fail;
+            }
+            tmp_fun = fun;
+            Py_INCREF(tmp_fun);
+        }
+    }
+if (tmp_fun==NULL) {
+fprintf(stderr,\"Call-back argument must be function|instance|instance.__call__|f2py-function but got %s.\\n\",(fun==NULL?\"NULL\":Py_TYPE(fun)->tp_name));
+goto capi_fail;
+}
+    if (PyObject_HasAttrString(tmp_fun,\"__code__\")) {
+        if (PyObject_HasAttrString(tmp = PyObject_GetAttrString(tmp_fun,\"__code__\"),\"co_argcount\")) {
+            PyObject *tmp_argcount = PyObject_GetAttrString(tmp,\"co_argcount\");
+            Py_DECREF(tmp);
+            if (tmp_argcount == NULL) {
+                goto capi_fail;
+            }
+            tot = PyInt_AsLong(tmp_argcount) - di;
+            Py_DECREF(tmp_argcount);
+        }
+    }
+    /* Get the number of optional arguments */
+    if (PyObject_HasAttrString(tmp_fun,\"__defaults__\")) {
+        if (PyTuple_Check(tmp = PyObject_GetAttrString(tmp_fun,\"__defaults__\")))
+            opt = PyTuple_Size(tmp);
+        Py_XDECREF(tmp);
+    }
+    /* Get the number of extra arguments */
+    if (xa != NULL)
+        ext = PyTuple_Size((PyObject *)xa);
+    /* Calculate the size of call-backs argument list */
+    siz = MIN(maxnofargs+ext,tot);
+    *nofargs = MAX(0,siz-ext);
+#ifdef DEBUGCFUNCS
+    fprintf(stderr,\"debug-capi:create_cb_arglist:maxnofargs(-nofoptargs),tot,opt,ext,siz,nofargs=%d(-%d),%d,%d,%d,%d,%d\\n\",maxnofargs,nofoptargs,tot,opt,ext,siz,*nofargs);
+#endif
+    if (siz<tot-opt) {
+        fprintf(stderr,\"create_cb_arglist: Failed to build argument list (siz) with enough arguments (tot-opt) required by user-supplied function (siz,tot,opt=%d,%d,%d).\\n\",siz,tot,opt);
+        goto capi_fail;
+    }
+    /* Initialize argument list */
+    *args = (PyTupleObject *)PyTuple_New(siz);
+    for (i=0;i<*nofargs;i++) {
+        Py_INCREF(Py_None);
+        PyTuple_SET_ITEM((PyObject *)(*args),i,Py_None);
+    }
+    if (xa != NULL)
+        for (i=(*nofargs);i<siz;i++) {
+            tmp = PyTuple_GetItem((PyObject *)xa,i-(*nofargs));
+            Py_INCREF(tmp);
+            PyTuple_SET_ITEM(*args,i,tmp);
+        }
+    CFUNCSMESS(\"create_cb_arglist-end\\n\");
+    Py_DECREF(tmp_fun);
+    return 1;
+capi_fail:
+    if ((PyErr_Occurred())==NULL)
+        PyErr_SetString(#modulename#_error,errmess);
+    Py_XDECREF(tmp_fun);
+    return 0;
+}
+"""
+
+
+def buildcfuncs():
+    from .capi_maps import c2capi_map
+    for k in c2capi_map.keys():
+        m = 'pyarr_from_p_%s1' % k
+        cppmacros[
+            m] = '#define %s(v) (PyArray_SimpleNewFromData(0,NULL,%s,(char *)v))' % (m, c2capi_map[k])
+    k = 'string'
+    m = 'pyarr_from_p_%s1' % k
+    # NPY_CHAR compatibility, NPY_STRING with itemsize 1
+    cppmacros[
+        m] = '#define %s(v,dims) (PyArray_New(&PyArray_Type, 1, dims, NPY_STRING, NULL, v, 1, NPY_ARRAY_CARRAY, NULL))' % (m)
+
+
+############ Auxiliary functions for sorting needs ###################
+
+def append_needs(need, flag=1):
+    # This function modifies the contents of the global `outneeds` dict.
+    if isinstance(need, list):
+        for n in need:
+            append_needs(n, flag)
+    elif isinstance(need, str):
+        if not need:
+            return
+        if need in includes0:
+            n = 'includes0'
+        elif need in includes:
+            n = 'includes'
+        elif need in typedefs:
+            n = 'typedefs'
+        elif need in typedefs_generated:
+            n = 'typedefs_generated'
+        elif need in cppmacros:
+            n = 'cppmacros'
+        elif need in cfuncs:
+            n = 'cfuncs'
+        elif need in callbacks:
+            n = 'callbacks'
+        elif need in f90modhooks:
+            n = 'f90modhooks'
+        elif need in commonhooks:
+            n = 'commonhooks'
+        else:
+            errmess('append_needs: unknown need %s\n' % (repr(need)))
+            return
+        if need in outneeds[n]:
+            return
+        if flag:
+            tmp = {}
+            if need in needs:
+                for nn in needs[need]:
+                    t = append_needs(nn, 0)
+                    if isinstance(t, dict):
+                        for nnn in t.keys():
+                            if nnn in tmp:
+                                tmp[nnn] = tmp[nnn] + t[nnn]
+                            else:
+                                tmp[nnn] = t[nnn]
+            for nn in tmp.keys():
+                for nnn in tmp[nn]:
+                    if nnn not in outneeds[nn]:
+                        outneeds[nn] = [nnn] + outneeds[nn]
+            outneeds[n].append(need)
+        else:
+            tmp = {}
+            if need in needs:
+                for nn in needs[need]:
+                    t = append_needs(nn, flag)
+                    if isinstance(t, dict):
+                        for nnn in t.keys():
+                            if nnn in tmp:
+                                tmp[nnn] = t[nnn] + tmp[nnn]
+                            else:
+                                tmp[nnn] = t[nnn]
+            if n not in tmp:
+                tmp[n] = []
+            tmp[n].append(need)
+            return tmp
+    else:
+        errmess('append_needs: expected list or string but got :%s\n' %
+                (repr(need)))
+
+
+def get_needs():
+    # This function modifies the contents of the global `outneeds` dict.
+    res = {}
+    for n in outneeds.keys():
+        out = []
+        saveout = copy.copy(outneeds[n])
+        while len(outneeds[n]) > 0:
+            if outneeds[n][0] not in needs:
+                out.append(outneeds[n][0])
+                del outneeds[n][0]
+            else:
+                flag = 0
+                for k in outneeds[n][1:]:
+                    if k in needs[outneeds[n][0]]:
+                        flag = 1
+                        break
+                if flag:
+                    outneeds[n] = outneeds[n][1:] + [outneeds[n][0]]
+                else:
+                    out.append(outneeds[n][0])
+                    del outneeds[n][0]
+            if saveout and (0 not in map(lambda x, y: x == y, saveout, outneeds[n])) \
+                    and outneeds[n] != []:
+                print(n, saveout)
+                errmess(
+                    'get_needs: no progress in sorting needs, probably circular dependence, skipping.\n')
+                out = out + saveout
+                break
+            saveout = copy.copy(outneeds[n])
+        if out == []:
+            out = [n]
+        res[n] = out
+    return res
diff --git a/venv/Lib/site-packages/numpy/f2py/common_rules.py b/venv/Lib/site-packages/numpy/f2py/common_rules.py
new file mode 100644
index 000000000..90483e55b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/common_rules.py
@@ -0,0 +1,147 @@
+#!/usr/bin/env python3
+"""
+
+Build common block mechanism for f2py2e.
+
+Copyright 2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/05/06 10:57:33 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.19 $"[10:-1]
+
+from . import __version__
+f2py_version = __version__.version
+
+from .auxfuncs import (
+    hasbody, hascommon, hasnote, isintent_hide, outmess
+)
+from . import capi_maps
+from . import func2subr
+from .crackfortran import rmbadname
+
+
+def findcommonblocks(block, top=1):
+    ret = []
+    if hascommon(block):
+        for key, value in block['common'].items():
+            vars_ = {v: block['vars'][v] for v in value}
+            ret.append((key, value, vars_))
+    elif hasbody(block):
+        for b in block['body']:
+            ret = ret + findcommonblocks(b, 0)
+    if top:
+        tret = []
+        names = []
+        for t in ret:
+            if t[0] not in names:
+                names.append(t[0])
+                tret.append(t)
+        return tret
+    return ret
+
+
+def buildhooks(m):
+    ret = {'commonhooks': [], 'initcommonhooks': [],
+           'docs': ['"COMMON blocks:\\n"']}
+    fwrap = ['']
+
+    def fadd(line, s=fwrap):
+        s[0] = '%s\n      %s' % (s[0], line)
+    chooks = ['']
+
+    def cadd(line, s=chooks):
+        s[0] = '%s\n%s' % (s[0], line)
+    ihooks = ['']
+
+    def iadd(line, s=ihooks):
+        s[0] = '%s\n%s' % (s[0], line)
+    doc = ['']
+
+    def dadd(line, s=doc):
+        s[0] = '%s\n%s' % (s[0], line)
+    for (name, vnames, vars) in findcommonblocks(m):
+        lower_name = name.lower()
+        hnames, inames = [], []
+        for n in vnames:
+            if isintent_hide(vars[n]):
+                hnames.append(n)
+            else:
+                inames.append(n)
+        if hnames:
+            outmess('\t\tConstructing COMMON block support for "%s"...\n\t\t  %s\n\t\t  Hidden: %s\n' % (
+                name, ','.join(inames), ','.join(hnames)))
+        else:
+            outmess('\t\tConstructing COMMON block support for "%s"...\n\t\t  %s\n' % (
+                name, ','.join(inames)))
+        fadd('subroutine f2pyinit%s(setupfunc)' % name)
+        fadd('external setupfunc')
+        for n in vnames:
+            fadd(func2subr.var2fixfortran(vars, n))
+        if name == '_BLNK_':
+            fadd('common %s' % (','.join(vnames)))
+        else:
+            fadd('common /%s/ %s' % (name, ','.join(vnames)))
+        fadd('call setupfunc(%s)' % (','.join(inames)))
+        fadd('end\n')
+        cadd('static FortranDataDef f2py_%s_def[] = {' % (name))
+        idims = []
+        for n in inames:
+            ct = capi_maps.getctype(vars[n])
+            at = capi_maps.c2capi_map[ct]
+            dm = capi_maps.getarrdims(n, vars[n])
+            if dm['dims']:
+                idims.append('(%s)' % (dm['dims']))
+            else:
+                idims.append('')
+            dms = dm['dims'].strip()
+            if not dms:
+                dms = '-1'
+            cadd('\t{\"%s\",%s,{{%s}},%s},' % (n, dm['rank'], dms, at))
+        cadd('\t{NULL}\n};')
+        inames1 = rmbadname(inames)
+        inames1_tps = ','.join(['char *' + s for s in inames1])
+        cadd('static void f2py_setup_%s(%s) {' % (name, inames1_tps))
+        cadd('\tint i_f2py=0;')
+        for n in inames1:
+            cadd('\tf2py_%s_def[i_f2py++].data = %s;' % (name, n))
+        cadd('}')
+        if '_' in lower_name:
+            F_FUNC = 'F_FUNC_US'
+        else:
+            F_FUNC = 'F_FUNC'
+        cadd('extern void %s(f2pyinit%s,F2PYINIT%s)(void(*)(%s));'
+             % (F_FUNC, lower_name, name.upper(),
+                ','.join(['char*'] * len(inames1))))
+        cadd('static void f2py_init_%s(void) {' % name)
+        cadd('\t%s(f2pyinit%s,F2PYINIT%s)(f2py_setup_%s);'
+             % (F_FUNC, lower_name, name.upper(), name))
+        cadd('}\n')
+        iadd('\ttmp = PyFortranObject_New(f2py_%s_def,f2py_init_%s);' % (name, name))
+        iadd('\tF2PyDict_SetItemString(d, \"%s\", tmp);' % name)
+        iadd('\tPy_DECREF(tmp);')
+        tname = name.replace('_', '\\_')
+        dadd('\\subsection{Common block \\texttt{%s}}\n' % (tname))
+        dadd('\\begin{description}')
+        for n in inames:
+            dadd('\\item[]{{}\\verb@%s@{}}' %
+                 (capi_maps.getarrdocsign(n, vars[n])))
+            if hasnote(vars[n]):
+                note = vars[n]['note']
+                if isinstance(note, list):
+                    note = '\n'.join(note)
+                dadd('--- %s' % (note))
+        dadd('\\end{description}')
+        ret['docs'].append(
+            '"\t/%s/ %s\\n"' % (name, ','.join(map(lambda v, d: v + d, inames, idims))))
+    ret['commonhooks'] = chooks
+    ret['initcommonhooks'] = ihooks
+    ret['latexdoc'] = doc[0]
+    if len(ret['docs']) <= 1:
+        ret['docs'] = ''
+    return ret, fwrap[0]
diff --git a/venv/Lib/site-packages/numpy/f2py/crackfortran.py b/venv/Lib/site-packages/numpy/f2py/crackfortran.py
new file mode 100644
index 000000000..3d2f97a56
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/crackfortran.py
@@ -0,0 +1,3347 @@
+#!/usr/bin/env python3
+"""
+crackfortran --- read fortran (77,90) code and extract declaration information.
+
+Copyright 1999-2004 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/09/27 07:13:49 $
+Pearu Peterson
+
+
+Usage of crackfortran:
+======================
+Command line keys: -quiet,-verbose,-fix,-f77,-f90,-show,-h <pyffilename>
+                   -m <module name for f77 routines>,--ignore-contains
+Functions: crackfortran, crack2fortran
+The following Fortran statements/constructions are supported
+(or will be if needed):
+   block data,byte,call,character,common,complex,contains,data,
+   dimension,double complex,double precision,end,external,function,
+   implicit,integer,intent,interface,intrinsic,
+   logical,module,optional,parameter,private,public,
+   program,real,(sequence?),subroutine,type,use,virtual,
+   include,pythonmodule
+Note: 'virtual' is mapped to 'dimension'.
+Note: 'implicit integer (z) static (z)' is 'implicit static (z)' (this is minor bug).
+Note: code after 'contains' will be ignored until its scope ends.
+Note: 'common' statement is extended: dimensions are moved to variable definitions
+Note: f2py directive: <commentchar>f2py<line> is read as <line>
+Note: pythonmodule is introduced to represent Python module
+
+Usage:
+  `postlist=crackfortran(files)`
+  `postlist` contains declaration information read from the list of files `files`.
+  `crack2fortran(postlist)` returns a fortran code to be saved to pyf-file
+
+  `postlist` has the following structure:
+ *** it is a list of dictionaries containing `blocks':
+     B = {'block','body','vars','parent_block'[,'name','prefix','args','result',
+          'implicit','externals','interfaced','common','sortvars',
+          'commonvars','note']}
+     B['block'] = 'interface' | 'function' | 'subroutine' | 'module' |
+                  'program' | 'block data' | 'type' | 'pythonmodule'
+     B['body'] --- list containing `subblocks' with the same structure as `blocks'
+     B['parent_block'] --- dictionary of a parent block:
+                             C['body'][<index>]['parent_block'] is C
+     B['vars'] --- dictionary of variable definitions
+     B['sortvars'] --- dictionary of variable definitions sorted by dependence (independent first)
+     B['name'] --- name of the block (not if B['block']=='interface')
+     B['prefix'] --- prefix string (only if B['block']=='function')
+     B['args'] --- list of argument names if B['block']== 'function' | 'subroutine'
+     B['result'] --- name of the return value (only if B['block']=='function')
+     B['implicit'] --- dictionary {'a':<variable definition>,'b':...} | None
+     B['externals'] --- list of variables being external
+     B['interfaced'] --- list of variables being external and defined
+     B['common'] --- dictionary of common blocks (list of objects)
+     B['commonvars'] --- list of variables used in common blocks (dimensions are moved to variable definitions)
+     B['from'] --- string showing the 'parents' of the current block
+     B['use'] --- dictionary of modules used in current block:
+         {<modulename>:{['only':<0|1>],['map':{<local_name1>:<use_name1>,...}]}}
+     B['note'] --- list of LaTeX comments on the block
+     B['f2pyenhancements'] --- optional dictionary
+          {'threadsafe':'','fortranname':<name>,
+           'callstatement':<C-expr>|<multi-line block>,
+           'callprotoargument':<C-expr-list>,
+           'usercode':<multi-line block>|<list of multi-line blocks>,
+           'pymethoddef:<multi-line block>'
+           }
+     B['entry'] --- dictionary {entryname:argslist,..}
+     B['varnames'] --- list of variable names given in the order of reading the
+                       Fortran code, useful for derived types.
+     B['saved_interface'] --- a string of scanned routine signature, defines explicit interface
+ *** Variable definition is a dictionary
+     D = B['vars'][<variable name>] =
+     {'typespec'[,'attrspec','kindselector','charselector','=','typename']}
+     D['typespec'] = 'byte' | 'character' | 'complex' | 'double complex' |
+                     'double precision' | 'integer' | 'logical' | 'real' | 'type'
+     D['attrspec'] --- list of attributes (e.g. 'dimension(<arrayspec>)',
+                       'external','intent(in|out|inout|hide|c|callback|cache|aligned4|aligned8|aligned16)',
+                       'optional','required', etc)
+     K = D['kindselector'] = {['*','kind']} (only if D['typespec'] =
+                         'complex' | 'integer' | 'logical' | 'real' )
+     C = D['charselector'] = {['*','len','kind']}
+                             (only if D['typespec']=='character')
+     D['='] --- initialization expression string
+     D['typename'] --- name of the type if D['typespec']=='type'
+     D['dimension'] --- list of dimension bounds
+     D['intent'] --- list of intent specifications
+     D['depend'] --- list of variable names on which current variable depends on
+     D['check'] --- list of C-expressions; if C-expr returns zero, exception is raised
+     D['note'] --- list of LaTeX comments on the variable
+ *** Meaning of kind/char selectors (few examples):
+     D['typespec>']*K['*']
+     D['typespec'](kind=K['kind'])
+     character*C['*']
+     character(len=C['len'],kind=C['kind'])
+     (see also fortran type declaration statement formats below)
+
+Fortran 90 type declaration statement format (F77 is subset of F90)
+====================================================================
+(Main source: IBM XL Fortran 5.1 Language Reference Manual)
+type declaration = <typespec> [[<attrspec>]::] <entitydecl>
+<typespec> = byte                          |
+             character[<charselector>]     |
+             complex[<kindselector>]       |
+             double complex                |
+             double precision              |
+             integer[<kindselector>]       |
+             logical[<kindselector>]       |
+             real[<kindselector>]          |
+             type(<typename>)
+<charselector> = * <charlen>               |
+             ([len=]<len>[,[kind=]<kind>]) |
+             (kind=<kind>[,len=<len>])
+<kindselector> = * <intlen>                |
+             ([kind=]<kind>)
+<attrspec> = comma separated list of attributes.
+             Only the following attributes are used in
+             building up the interface:
+                external
+                (parameter --- affects '=' key)
+                optional
+                intent
+             Other attributes are ignored.
+<intentspec> = in | out | inout
+<arrayspec> = comma separated list of dimension bounds.
+<entitydecl> = <name> [[*<charlen>][(<arrayspec>)] | [(<arrayspec>)]*<charlen>]
+                      [/<init_expr>/ | =<init_expr>] [,<entitydecl>]
+
+In addition, the following attributes are used: check,depend,note
+
+TODO:
+    * Apply 'parameter' attribute (e.g. 'integer parameter :: i=2' 'real x(i)'
+                                   -> 'real x(2)')
+    The above may be solved by creating appropriate preprocessor program, for example.
+
+"""
+import sys
+import string
+import fileinput
+import re
+import os
+import copy
+import platform
+
+from . import __version__
+
+# The environment provided by auxfuncs.py is needed for some calls to eval.
+# As the needed functions cannot be determined by static inspection of the
+# code, it is safest to use import * pending a major refactoring of f2py.
+from .auxfuncs import *
+
+
+f2py_version = __version__.version
+
+# Global flags:
+strictf77 = 1          # Ignore `!' comments unless line[0]=='!'
+sourcecodeform = 'fix'  # 'fix','free'
+quiet = 0              # Be verbose if 0 (Obsolete: not used any more)
+verbose = 1            # Be quiet if 0, extra verbose if > 1.
+tabchar = 4 * ' '
+pyffilename = ''
+f77modulename = ''
+skipemptyends = 0      # for old F77 programs without 'program' statement
+ignorecontains = 1
+dolowercase = 1
+debug = []
+
+# Global variables
+beginpattern = ''
+currentfilename = ''
+expectbegin = 1
+f90modulevars = {}
+filepositiontext = ''
+gotnextfile = 1
+groupcache = None
+groupcounter = 0
+grouplist = {groupcounter: []}
+groupname = ''
+include_paths = []
+neededmodule = -1
+onlyfuncs = []
+previous_context = None
+skipblocksuntil = -1
+skipfuncs = []
+skipfunctions = []
+usermodules = []
+
+
+def reset_global_f2py_vars():
+    global groupcounter, grouplist, neededmodule, expectbegin
+    global skipblocksuntil, usermodules, f90modulevars, gotnextfile
+    global filepositiontext, currentfilename, skipfunctions, skipfuncs
+    global onlyfuncs, include_paths, previous_context
+    global strictf77, sourcecodeform, quiet, verbose, tabchar, pyffilename
+    global f77modulename, skipemptyends, ignorecontains, dolowercase, debug
+
+    # flags
+    strictf77 = 1
+    sourcecodeform = 'fix'
+    quiet = 0
+    verbose = 1
+    tabchar = 4 * ' '
+    pyffilename = ''
+    f77modulename = ''
+    skipemptyends = 0
+    ignorecontains = 1
+    dolowercase = 1
+    debug = []
+    # variables
+    groupcounter = 0
+    grouplist = {groupcounter: []}
+    neededmodule = -1
+    expectbegin = 1
+    skipblocksuntil = -1
+    usermodules = []
+    f90modulevars = {}
+    gotnextfile = 1
+    filepositiontext = ''
+    currentfilename = ''
+    skipfunctions = []
+    skipfuncs = []
+    onlyfuncs = []
+    include_paths = []
+    previous_context = None
+
+
+def outmess(line, flag=1):
+    global filepositiontext
+
+    if not verbose:
+        return
+    if not quiet:
+        if flag:
+            sys.stdout.write(filepositiontext)
+        sys.stdout.write(line)
+
+re._MAXCACHE = 50
+defaultimplicitrules = {}
+for c in "abcdefghopqrstuvwxyz$_":
+    defaultimplicitrules[c] = {'typespec': 'real'}
+for c in "ijklmn":
+    defaultimplicitrules[c] = {'typespec': 'integer'}
+del c
+badnames = {}
+invbadnames = {}
+for n in ['int', 'double', 'float', 'char', 'short', 'long', 'void', 'case', 'while',
+          'return', 'signed', 'unsigned', 'if', 'for', 'typedef', 'sizeof', 'union',
+          'struct', 'static', 'register', 'new', 'break', 'do', 'goto', 'switch',
+          'continue', 'else', 'inline', 'extern', 'delete', 'const', 'auto',
+          'len', 'rank', 'shape', 'index', 'slen', 'size', '_i',
+          'max', 'min',
+          'flen', 'fshape',
+          'string', 'complex_double', 'float_double', 'stdin', 'stderr', 'stdout',
+          'type', 'default']:
+    badnames[n] = n + '_bn'
+    invbadnames[n + '_bn'] = n
+
+
+def rmbadname1(name):
+    if name in badnames:
+        errmess('rmbadname1: Replacing "%s" with "%s".\n' %
+                (name, badnames[name]))
+        return badnames[name]
+    return name
+
+
+def rmbadname(names):
+    return [rmbadname1(_m) for _m in names]
+
+
+def undo_rmbadname1(name):
+    if name in invbadnames:
+        errmess('undo_rmbadname1: Replacing "%s" with "%s".\n'
+                % (name, invbadnames[name]))
+        return invbadnames[name]
+    return name
+
+
+def undo_rmbadname(names):
+    return [undo_rmbadname1(_m) for _m in names]
+
+
+def getextension(name):
+    i = name.rfind('.')
+    if i == -1:
+        return ''
+    if '\\' in name[i:]:
+        return ''
+    if '/' in name[i:]:
+        return ''
+    return name[i + 1:]
+
+is_f_file = re.compile(r'.*[.](for|ftn|f77|f)\Z', re.I).match
+_has_f_header = re.compile(r'-[*]-\s*fortran\s*-[*]-', re.I).search
+_has_f90_header = re.compile(r'-[*]-\s*f90\s*-[*]-', re.I).search
+_has_fix_header = re.compile(r'-[*]-\s*fix\s*-[*]-', re.I).search
+_free_f90_start = re.compile(r'[^c*]\s*[^\s\d\t]', re.I).match
+
+
+def is_free_format(file):
+    """Check if file is in free format Fortran."""
+    # f90 allows both fixed and free format, assuming fixed unless
+    # signs of free format are detected.
+    result = 0
+    with open(file, 'r') as f:
+        line = f.readline()
+        n = 15  # the number of non-comment lines to scan for hints
+        if _has_f_header(line):
+            n = 0
+        elif _has_f90_header(line):
+            n = 0
+            result = 1
+        while n > 0 and line:
+            if line[0] != '!' and line.strip():
+                n -= 1
+                if (line[0] != '\t' and _free_f90_start(line[:5])) or line[-2:-1] == '&':
+                    result = 1
+                    break
+            line = f.readline()
+    return result
+
+
+# Read fortran (77,90) code
+def readfortrancode(ffile, dowithline=show, istop=1):
+    """
+    Read fortran codes from files and
+     1) Get rid of comments, line continuations, and empty lines; lower cases.
+     2) Call dowithline(line) on every line.
+     3) Recursively call itself when statement \"include '<filename>'\" is met.
+    """
+    global gotnextfile, filepositiontext, currentfilename, sourcecodeform, strictf77
+    global beginpattern, quiet, verbose, dolowercase, include_paths
+
+    if not istop:
+        saveglobals = gotnextfile, filepositiontext, currentfilename, sourcecodeform, strictf77,\
+            beginpattern, quiet, verbose, dolowercase
+    if ffile == []:
+        return
+    localdolowercase = dolowercase
+    cont = 0
+    finalline = ''
+    ll = ''
+    includeline = re.compile(
+        r'\s*include\s*(\'|")(?P<name>[^\'"]*)(\'|")', re.I)
+    cont1 = re.compile(r'(?P<line>.*)&\s*\Z')
+    cont2 = re.compile(r'(\s*&|)(?P<line>.*)')
+    mline_mark = re.compile(r".*?'''")
+    if istop:
+        dowithline('', -1)
+    ll, l1 = '', ''
+    spacedigits = [' '] + [str(_m) for _m in range(10)]
+    filepositiontext = ''
+    fin = fileinput.FileInput(ffile)
+    while True:
+        l = fin.readline()
+        if not l:
+            break
+        if fin.isfirstline():
+            filepositiontext = ''
+            currentfilename = fin.filename()
+            gotnextfile = 1
+            l1 = l
+            strictf77 = 0
+            sourcecodeform = 'fix'
+            ext = os.path.splitext(currentfilename)[1]
+            if is_f_file(currentfilename) and \
+                    not (_has_f90_header(l) or _has_fix_header(l)):
+                strictf77 = 1
+            elif is_free_format(currentfilename) and not _has_fix_header(l):
+                sourcecodeform = 'free'
+            if strictf77:
+                beginpattern = beginpattern77
+            else:
+                beginpattern = beginpattern90
+            outmess('\tReading file %s (format:%s%s)\n'
+                    % (repr(currentfilename), sourcecodeform,
+                       strictf77 and ',strict' or ''))
+
+        l = l.expandtabs().replace('\xa0', ' ')
+        # Get rid of newline characters
+        while not l == '':
+            if l[-1] not in "\n\r\f":
+                break
+            l = l[:-1]
+        if not strictf77:
+            (l, rl) = split_by_unquoted(l, '!')
+            l += ' '
+            if rl[:5].lower() == '!f2py':  # f2py directive
+                l, _ = split_by_unquoted(l + 4 * ' ' + rl[5:], '!')
+        if l.strip() == '':  # Skip empty line
+            cont = 0
+            continue
+        if sourcecodeform == 'fix':
+            if l[0] in ['*', 'c', '!', 'C', '#']:
+                if l[1:5].lower() == 'f2py':  # f2py directive
+                    l = '     ' + l[5:]
+                else:  # Skip comment line
+                    cont = 0
+                    continue
+            elif strictf77:
+                if len(l) > 72:
+                    l = l[:72]
+            if not (l[0] in spacedigits):
+                raise Exception('readfortrancode: Found non-(space,digit) char '
+                                'in the first column.\n\tAre you sure that '
+                                'this code is in fix form?\n\tline=%s' % repr(l))
+
+            if (not cont or strictf77) and (len(l) > 5 and not l[5] == ' '):
+                # Continuation of a previous line
+                ll = ll + l[6:]
+                finalline = ''
+                origfinalline = ''
+            else:
+                if not strictf77:
+                    # F90 continuation
+                    r = cont1.match(l)
+                    if r:
+                        l = r.group('line')  # Continuation follows ..
+                    if cont:
+                        ll = ll + cont2.match(l).group('line')
+                        finalline = ''
+                        origfinalline = ''
+                    else:
+                        # clean up line beginning from possible digits.
+                        l = '     ' + l[5:]
+                        if localdolowercase:
+                            finalline = ll.lower()
+                        else:
+                            finalline = ll
+                        origfinalline = ll
+                        ll = l
+                    cont = (r is not None)
+                else:
+                    # clean up line beginning from possible digits.
+                    l = '     ' + l[5:]
+                    if localdolowercase:
+                        finalline = ll.lower()
+                    else:
+                        finalline = ll
+                    origfinalline = ll
+                    ll = l
+
+        elif sourcecodeform == 'free':
+            if not cont and ext == '.pyf' and mline_mark.match(l):
+                l = l + '\n'
+                while True:
+                    lc = fin.readline()
+                    if not lc:
+                        errmess(
+                            'Unexpected end of file when reading multiline\n')
+                        break
+                    l = l + lc
+                    if mline_mark.match(lc):
+                        break
+                l = l.rstrip()
+            r = cont1.match(l)
+            if r:
+                l = r.group('line')  # Continuation follows ..
+            if cont:
+                ll = ll + cont2.match(l).group('line')
+                finalline = ''
+                origfinalline = ''
+            else:
+                if localdolowercase:
+                    finalline = ll.lower()
+                else:
+                    finalline = ll
+                origfinalline = ll
+                ll = l
+            cont = (r is not None)
+        else:
+            raise ValueError(
+                "Flag sourcecodeform must be either 'fix' or 'free': %s" % repr(sourcecodeform))
+        filepositiontext = 'Line #%d in %s:"%s"\n\t' % (
+            fin.filelineno() - 1, currentfilename, l1)
+        m = includeline.match(origfinalline)
+        if m:
+            fn = m.group('name')
+            if os.path.isfile(fn):
+                readfortrancode(fn, dowithline=dowithline, istop=0)
+            else:
+                include_dirs = [
+                    os.path.dirname(currentfilename)] + include_paths
+                foundfile = 0
+                for inc_dir in include_dirs:
+                    fn1 = os.path.join(inc_dir, fn)
+                    if os.path.isfile(fn1):
+                        foundfile = 1
+                        readfortrancode(fn1, dowithline=dowithline, istop=0)
+                        break
+                if not foundfile:
+                    outmess('readfortrancode: could not find include file %s in %s. Ignoring.\n' % (
+                        repr(fn), os.pathsep.join(include_dirs)))
+        else:
+            dowithline(finalline)
+        l1 = ll
+    if localdolowercase:
+        finalline = ll.lower()
+    else:
+        finalline = ll
+    origfinalline = ll
+    filepositiontext = 'Line #%d in %s:"%s"\n\t' % (
+        fin.filelineno() - 1, currentfilename, l1)
+    m = includeline.match(origfinalline)
+    if m:
+        fn = m.group('name')
+        if os.path.isfile(fn):
+            readfortrancode(fn, dowithline=dowithline, istop=0)
+        else:
+            include_dirs = [os.path.dirname(currentfilename)] + include_paths
+            foundfile = 0
+            for inc_dir in include_dirs:
+                fn1 = os.path.join(inc_dir, fn)
+                if os.path.isfile(fn1):
+                    foundfile = 1
+                    readfortrancode(fn1, dowithline=dowithline, istop=0)
+                    break
+            if not foundfile:
+                outmess('readfortrancode: could not find include file %s in %s. Ignoring.\n' % (
+                    repr(fn), os.pathsep.join(include_dirs)))
+    else:
+        dowithline(finalline)
+    filepositiontext = ''
+    fin.close()
+    if istop:
+        dowithline('', 1)
+    else:
+        gotnextfile, filepositiontext, currentfilename, sourcecodeform, strictf77,\
+            beginpattern, quiet, verbose, dolowercase = saveglobals
+
+# Crack line
+beforethisafter = r'\s*(?P<before>%s(?=\s*(\b(%s)\b)))' + \
+    r'\s*(?P<this>(\b(%s)\b))' + \
+    r'\s*(?P<after>%s)\s*\Z'
+##
+fortrantypes = r'character|logical|integer|real|complex|double\s*(precision\s*(complex|)|complex)|type(?=\s*\([\w\s,=(*)]*\))|byte'
+typespattern = re.compile(
+    beforethisafter % ('', fortrantypes, fortrantypes, '.*'), re.I), 'type'
+typespattern4implicit = re.compile(beforethisafter % (
+    '', fortrantypes + '|static|automatic|undefined', fortrantypes + '|static|automatic|undefined', '.*'), re.I)
+#
+functionpattern = re.compile(beforethisafter % (
+    r'([a-z]+[\w\s(=*+-/)]*?|)', 'function', 'function', '.*'), re.I), 'begin'
+subroutinepattern = re.compile(beforethisafter % (
+    r'[a-z\s]*?', 'subroutine', 'subroutine', '.*'), re.I), 'begin'
+# modulepattern=re.compile(beforethisafter%('[a-z\s]*?','module','module','.*'),re.I),'begin'
+#
+groupbegins77 = r'program|block\s*data'
+beginpattern77 = re.compile(
+    beforethisafter % ('', groupbegins77, groupbegins77, '.*'), re.I), 'begin'
+groupbegins90 = groupbegins77 + \
+    r'|module(?!\s*procedure)|python\s*module|interface|type(?!\s*\()'
+beginpattern90 = re.compile(
+    beforethisafter % ('', groupbegins90, groupbegins90, '.*'), re.I), 'begin'
+groupends = (r'end|endprogram|endblockdata|endmodule|endpythonmodule|'
+             r'endinterface|endsubroutine|endfunction')
+endpattern = re.compile(
+    beforethisafter % ('', groupends, groupends, r'[\w\s]*'), re.I), 'end'
+# endifs='end\s*(if|do|where|select|while|forall)'
+endifs = r'(end\s*(if|do|where|select|while|forall))|(module\s*procedure)'
+endifpattern = re.compile(
+    beforethisafter % (r'[\w]*?', endifs, endifs, r'[\w\s]*'), re.I), 'endif'
+#
+implicitpattern = re.compile(
+    beforethisafter % ('', 'implicit', 'implicit', '.*'), re.I), 'implicit'
+dimensionpattern = re.compile(beforethisafter % (
+    '', 'dimension|virtual', 'dimension|virtual', '.*'), re.I), 'dimension'
+externalpattern = re.compile(
+    beforethisafter % ('', 'external', 'external', '.*'), re.I), 'external'
+optionalpattern = re.compile(
+    beforethisafter % ('', 'optional', 'optional', '.*'), re.I), 'optional'
+requiredpattern = re.compile(
+    beforethisafter % ('', 'required', 'required', '.*'), re.I), 'required'
+publicpattern = re.compile(
+    beforethisafter % ('', 'public', 'public', '.*'), re.I), 'public'
+privatepattern = re.compile(
+    beforethisafter % ('', 'private', 'private', '.*'), re.I), 'private'
+intrinsicpattern = re.compile(
+    beforethisafter % ('', 'intrinsic', 'intrinsic', '.*'), re.I), 'intrinsic'
+intentpattern = re.compile(beforethisafter % (
+    '', 'intent|depend|note|check', 'intent|depend|note|check', r'\s*\(.*?\).*'), re.I), 'intent'
+parameterpattern = re.compile(
+    beforethisafter % ('', 'parameter', 'parameter', r'\s*\(.*'), re.I), 'parameter'
+datapattern = re.compile(
+    beforethisafter % ('', 'data', 'data', '.*'), re.I), 'data'
+callpattern = re.compile(
+    beforethisafter % ('', 'call', 'call', '.*'), re.I), 'call'
+entrypattern = re.compile(
+    beforethisafter % ('', 'entry', 'entry', '.*'), re.I), 'entry'
+callfunpattern = re.compile(
+    beforethisafter % ('', 'callfun', 'callfun', '.*'), re.I), 'callfun'
+commonpattern = re.compile(
+    beforethisafter % ('', 'common', 'common', '.*'), re.I), 'common'
+usepattern = re.compile(
+    beforethisafter % ('', 'use', 'use', '.*'), re.I), 'use'
+containspattern = re.compile(
+    beforethisafter % ('', 'contains', 'contains', ''), re.I), 'contains'
+formatpattern = re.compile(
+    beforethisafter % ('', 'format', 'format', '.*'), re.I), 'format'
+# Non-fortran and f2py-specific statements
+f2pyenhancementspattern = re.compile(beforethisafter % ('', 'threadsafe|fortranname|callstatement|callprotoargument|usercode|pymethoddef',
+                                                        'threadsafe|fortranname|callstatement|callprotoargument|usercode|pymethoddef', '.*'), re.I | re.S), 'f2pyenhancements'
+multilinepattern = re.compile(
+    r"\s*(?P<before>''')(?P<this>.*?)(?P<after>''')\s*\Z", re.S), 'multiline'
+##
+
+def split_by_unquoted(line, characters):
+    """
+    Splits the line into (line[:i], line[i:]),
+    where i is the index of first occurrence of one of the characters
+    not within quotes, or len(line) if no such index exists
+    """
+    assert not (set('"\'') & set(characters)), "cannot split by unquoted quotes"
+    r = re.compile(
+        r"\A(?P<before>({single_quoted}|{double_quoted}|{not_quoted})*)"
+        r"(?P<after>{char}.*)\Z".format(
+            not_quoted="[^\"'{}]".format(re.escape(characters)),
+            char="[{}]".format(re.escape(characters)),
+            single_quoted=r"('([^'\\]|(\\.))*')",
+            double_quoted=r'("([^"\\]|(\\.))*")'))
+    m = r.match(line)
+    if m:
+        d = m.groupdict()
+        return (d["before"], d["after"])
+    return (line, "")
+
+def _simplifyargs(argsline):
+    a = []
+    for n in markoutercomma(argsline).split('@,@'):
+        for r in '(),':
+            n = n.replace(r, '_')
+        a.append(n)
+    return ','.join(a)
+
+crackline_re_1 = re.compile(r'\s*(?P<result>\b[a-z]+[\w]*\b)\s*[=].*', re.I)
+
+
+def crackline(line, reset=0):
+    """
+    reset=-1  --- initialize
+    reset=0   --- crack the line
+    reset=1   --- final check if mismatch of blocks occurred
+
+    Cracked data is saved in grouplist[0].
+    """
+    global beginpattern, groupcounter, groupname, groupcache, grouplist
+    global filepositiontext, currentfilename, neededmodule, expectbegin
+    global skipblocksuntil, skipemptyends, previous_context, gotnextfile
+
+    _, has_semicolon = split_by_unquoted(line, ";")
+    if has_semicolon and not (f2pyenhancementspattern[0].match(line) or
+                               multilinepattern[0].match(line)):
+        # XXX: non-zero reset values need testing
+        assert reset == 0, repr(reset)
+        # split line on unquoted semicolons
+        line, semicolon_line = split_by_unquoted(line, ";")
+        while semicolon_line:
+            crackline(line, reset)
+            line, semicolon_line = split_by_unquoted(semicolon_line[1:], ";")
+        crackline(line, reset)
+        return
+    if reset < 0:
+        groupcounter = 0
+        groupname = {groupcounter: ''}
+        groupcache = {groupcounter: {}}
+        grouplist = {groupcounter: []}
+        groupcache[groupcounter]['body'] = []
+        groupcache[groupcounter]['vars'] = {}
+        groupcache[groupcounter]['block'] = ''
+        groupcache[groupcounter]['name'] = ''
+        neededmodule = -1
+        skipblocksuntil = -1
+        return
+    if reset > 0:
+        fl = 0
+        if f77modulename and neededmodule == groupcounter:
+            fl = 2
+        while groupcounter > fl:
+            outmess('crackline: groupcounter=%s groupname=%s\n' %
+                    (repr(groupcounter), repr(groupname)))
+            outmess(
+                'crackline: Mismatch of blocks encountered. Trying to fix it by assuming "end" statement.\n')
+            grouplist[groupcounter - 1].append(groupcache[groupcounter])
+            grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+            del grouplist[groupcounter]
+            groupcounter = groupcounter - 1
+        if f77modulename and neededmodule == groupcounter:
+            grouplist[groupcounter - 1].append(groupcache[groupcounter])
+            grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+            del grouplist[groupcounter]
+            groupcounter = groupcounter - 1  # end interface
+            grouplist[groupcounter - 1].append(groupcache[groupcounter])
+            grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+            del grouplist[groupcounter]
+            groupcounter = groupcounter - 1  # end module
+            neededmodule = -1
+        return
+    if line == '':
+        return
+    flag = 0
+    for pat in [dimensionpattern, externalpattern, intentpattern, optionalpattern,
+                requiredpattern,
+                parameterpattern, datapattern, publicpattern, privatepattern,
+                intrinsicpattern,
+                endifpattern, endpattern,
+                formatpattern,
+                beginpattern, functionpattern, subroutinepattern,
+                implicitpattern, typespattern, commonpattern,
+                callpattern, usepattern, containspattern,
+                entrypattern,
+                f2pyenhancementspattern,
+                multilinepattern
+                ]:
+        m = pat[0].match(line)
+        if m:
+            break
+        flag = flag + 1
+    if not m:
+        re_1 = crackline_re_1
+        if 0 <= skipblocksuntil <= groupcounter:
+            return
+        if 'externals' in groupcache[groupcounter]:
+            for name in groupcache[groupcounter]['externals']:
+                if name in invbadnames:
+                    name = invbadnames[name]
+                if 'interfaced' in groupcache[groupcounter] and name in groupcache[groupcounter]['interfaced']:
+                    continue
+                m1 = re.match(
+                    r'(?P<before>[^"]*)\b%s\b\s*@\(@(?P<args>[^@]*)@\)@.*\Z' % name, markouterparen(line), re.I)
+                if m1:
+                    m2 = re_1.match(m1.group('before'))
+                    a = _simplifyargs(m1.group('args'))
+                    if m2:
+                        line = 'callfun %s(%s) result (%s)' % (
+                            name, a, m2.group('result'))
+                    else:
+                        line = 'callfun %s(%s)' % (name, a)
+                    m = callfunpattern[0].match(line)
+                    if not m:
+                        outmess(
+                            'crackline: could not resolve function call for line=%s.\n' % repr(line))
+                        return
+                    analyzeline(m, 'callfun', line)
+                    return
+        if verbose > 1 or (verbose == 1 and currentfilename.lower().endswith('.pyf')):
+            previous_context = None
+            outmess('crackline:%d: No pattern for line\n' % (groupcounter))
+        return
+    elif pat[1] == 'end':
+        if 0 <= skipblocksuntil < groupcounter:
+            groupcounter = groupcounter - 1
+            if skipblocksuntil <= groupcounter:
+                return
+        if groupcounter <= 0:
+            raise Exception('crackline: groupcounter(=%s) is nonpositive. '
+                            'Check the blocks.'
+                            % (groupcounter))
+        m1 = beginpattern[0].match((line))
+        if (m1) and (not m1.group('this') == groupname[groupcounter]):
+            raise Exception('crackline: End group %s does not match with '
+                            'previous Begin group %s\n\t%s' %
+                            (repr(m1.group('this')), repr(groupname[groupcounter]),
+                             filepositiontext)
+                            )
+        if skipblocksuntil == groupcounter:
+            skipblocksuntil = -1
+        grouplist[groupcounter - 1].append(groupcache[groupcounter])
+        grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+        del grouplist[groupcounter]
+        groupcounter = groupcounter - 1
+        if not skipemptyends:
+            expectbegin = 1
+    elif pat[1] == 'begin':
+        if 0 <= skipblocksuntil <= groupcounter:
+            groupcounter = groupcounter + 1
+            return
+        gotnextfile = 0
+        analyzeline(m, pat[1], line)
+        expectbegin = 0
+    elif pat[1] == 'endif':
+        pass
+    elif pat[1] == 'contains':
+        if ignorecontains:
+            return
+        if 0 <= skipblocksuntil <= groupcounter:
+            return
+        skipblocksuntil = groupcounter
+    else:
+        if 0 <= skipblocksuntil <= groupcounter:
+            return
+        analyzeline(m, pat[1], line)
+
+
+def markouterparen(line):
+    l = ''
+    f = 0
+    for c in line:
+        if c == '(':
+            f = f + 1
+            if f == 1:
+                l = l + '@(@'
+                continue
+        elif c == ')':
+            f = f - 1
+            if f == 0:
+                l = l + '@)@'
+                continue
+        l = l + c
+    return l
+
+
+def markoutercomma(line, comma=','):
+    l = ''
+    f = 0
+    before, after = split_by_unquoted(line, comma + '()')
+    l += before
+    while after:
+        if (after[0] == comma) and (f == 0):
+            l += '@' + comma + '@'
+        else:
+            l += after[0]
+            if after[0] == '(':
+                f += 1
+            elif after[0] == ')':
+                f -= 1
+        before, after = split_by_unquoted(after[1:], comma + '()')
+        l += before
+    assert not f, repr((f, line, l))
+    return l
+
+def unmarkouterparen(line):
+    r = line.replace('@(@', '(').replace('@)@', ')')
+    return r
+
+
+def appenddecl(decl, decl2, force=1):
+    if not decl:
+        decl = {}
+    if not decl2:
+        return decl
+    if decl is decl2:
+        return decl
+    for k in list(decl2.keys()):
+        if k == 'typespec':
+            if force or k not in decl:
+                decl[k] = decl2[k]
+        elif k == 'attrspec':
+            for l in decl2[k]:
+                decl = setattrspec(decl, l, force)
+        elif k == 'kindselector':
+            decl = setkindselector(decl, decl2[k], force)
+        elif k == 'charselector':
+            decl = setcharselector(decl, decl2[k], force)
+        elif k in ['=', 'typename']:
+            if force or k not in decl:
+                decl[k] = decl2[k]
+        elif k == 'note':
+            pass
+        elif k in ['intent', 'check', 'dimension', 'optional', 'required']:
+            errmess('appenddecl: "%s" not implemented.\n' % k)
+        else:
+            raise Exception('appenddecl: Unknown variable definition key:' +
+                            str(k))
+    return decl
+
+selectpattern = re.compile(
+    r'\s*(?P<this>(@\(@.*?@\)@|[*][\d*]+|[*]\s*@\(@.*?@\)@|))(?P<after>.*)\Z', re.I)
+nameargspattern = re.compile(
+    r'\s*(?P<name>\b[\w$]+\b)\s*(@\(@\s*(?P<args>[\w\s,]*)\s*@\)@|)\s*((result(\s*@\(@\s*(?P<result>\b[\w$]+\b)\s*@\)@|))|(bind\s*@\(@\s*(?P<bind>.*)\s*@\)@))*\s*\Z', re.I)
+callnameargspattern = re.compile(
+    r'\s*(?P<name>\b[\w$]+\b)\s*@\(@\s*(?P<args>.*)\s*@\)@\s*\Z', re.I)
+real16pattern = re.compile(
+    r'([-+]?(?:\d+(?:\.\d*)?|\d*\.\d+))[dD]((?:[-+]?\d+)?)')
+real8pattern = re.compile(
+    r'([-+]?((?:\d+(?:\.\d*)?|\d*\.\d+))[eE]((?:[-+]?\d+)?)|(\d+\.\d*))')
+
+_intentcallbackpattern = re.compile(r'intent\s*\(.*?\bcallback\b', re.I)
+
+
+def _is_intent_callback(vdecl):
+    for a in vdecl.get('attrspec', []):
+        if _intentcallbackpattern.match(a):
+            return 1
+    return 0
+
+
+def _resolvenameargspattern(line):
+    line = markouterparen(line)
+    m1 = nameargspattern.match(line)
+    if m1:
+        return m1.group('name'), m1.group('args'), m1.group('result'), m1.group('bind')
+    m1 = callnameargspattern.match(line)
+    if m1:
+        return m1.group('name'), m1.group('args'), None, None
+    return None, [], None, None
+
+
+def analyzeline(m, case, line):
+    global groupcounter, groupname, groupcache, grouplist, filepositiontext
+    global currentfilename, f77modulename, neededinterface, neededmodule
+    global expectbegin, gotnextfile, previous_context
+
+    block = m.group('this')
+    if case != 'multiline':
+        previous_context = None
+    if expectbegin and case not in ['begin', 'call', 'callfun', 'type'] \
+       and not skipemptyends and groupcounter < 1:
+        newname = os.path.basename(currentfilename).split('.')[0]
+        outmess(
+            'analyzeline: no group yet. Creating program group with name "%s".\n' % newname)
+        gotnextfile = 0
+        groupcounter = groupcounter + 1
+        groupname[groupcounter] = 'program'
+        groupcache[groupcounter] = {}
+        grouplist[groupcounter] = []
+        groupcache[groupcounter]['body'] = []
+        groupcache[groupcounter]['vars'] = {}
+        groupcache[groupcounter]['block'] = 'program'
+        groupcache[groupcounter]['name'] = newname
+        groupcache[groupcounter]['from'] = 'fromsky'
+        expectbegin = 0
+    if case in ['begin', 'call', 'callfun']:
+        # Crack line => block,name,args,result
+        block = block.lower()
+        if re.match(r'block\s*data', block, re.I):
+            block = 'block data'
+        if re.match(r'python\s*module', block, re.I):
+            block = 'python module'
+        name, args, result, bind = _resolvenameargspattern(m.group('after'))
+        if name is None:
+            if block == 'block data':
+                name = '_BLOCK_DATA_'
+            else:
+                name = ''
+            if block not in ['interface', 'block data']:
+                outmess('analyzeline: No name/args pattern found for line.\n')
+
+        previous_context = (block, name, groupcounter)
+        if args:
+            args = rmbadname([x.strip()
+                              for x in markoutercomma(args).split('@,@')])
+        else:
+            args = []
+        if '' in args:
+            while '' in args:
+                args.remove('')
+            outmess(
+                'analyzeline: argument list is malformed (missing argument).\n')
+
+        # end of crack line => block,name,args,result
+        needmodule = 0
+        needinterface = 0
+
+        if case in ['call', 'callfun']:
+            needinterface = 1
+            if 'args' not in groupcache[groupcounter]:
+                return
+            if name not in groupcache[groupcounter]['args']:
+                return
+            for it in grouplist[groupcounter]:
+                if it['name'] == name:
+                    return
+            if name in groupcache[groupcounter]['interfaced']:
+                return
+            block = {'call': 'subroutine', 'callfun': 'function'}[case]
+        if f77modulename and neededmodule == -1 and groupcounter <= 1:
+            neededmodule = groupcounter + 2
+            needmodule = 1
+            if block != 'interface':
+                needinterface = 1
+        # Create new block(s)
+        groupcounter = groupcounter + 1
+        groupcache[groupcounter] = {}
+        grouplist[groupcounter] = []
+        if needmodule:
+            if verbose > 1:
+                outmess('analyzeline: Creating module block %s\n' %
+                        repr(f77modulename), 0)
+            groupname[groupcounter] = 'module'
+            groupcache[groupcounter]['block'] = 'python module'
+            groupcache[groupcounter]['name'] = f77modulename
+            groupcache[groupcounter]['from'] = ''
+            groupcache[groupcounter]['body'] = []
+            groupcache[groupcounter]['externals'] = []
+            groupcache[groupcounter]['interfaced'] = []
+            groupcache[groupcounter]['vars'] = {}
+            groupcounter = groupcounter + 1
+            groupcache[groupcounter] = {}
+            grouplist[groupcounter] = []
+        if needinterface:
+            if verbose > 1:
+                outmess('analyzeline: Creating additional interface block (groupcounter=%s).\n' % (
+                    groupcounter), 0)
+            groupname[groupcounter] = 'interface'
+            groupcache[groupcounter]['block'] = 'interface'
+            groupcache[groupcounter]['name'] = 'unknown_interface'
+            groupcache[groupcounter]['from'] = '%s:%s' % (
+                groupcache[groupcounter - 1]['from'], groupcache[groupcounter - 1]['name'])
+            groupcache[groupcounter]['body'] = []
+            groupcache[groupcounter]['externals'] = []
+            groupcache[groupcounter]['interfaced'] = []
+            groupcache[groupcounter]['vars'] = {}
+            groupcounter = groupcounter + 1
+            groupcache[groupcounter] = {}
+            grouplist[groupcounter] = []
+        groupname[groupcounter] = block
+        groupcache[groupcounter]['block'] = block
+        if not name:
+            name = 'unknown_' + block
+        groupcache[groupcounter]['prefix'] = m.group('before')
+        groupcache[groupcounter]['name'] = rmbadname1(name)
+        groupcache[groupcounter]['result'] = result
+        if groupcounter == 1:
+            groupcache[groupcounter]['from'] = currentfilename
+        else:
+            if f77modulename and groupcounter == 3:
+                groupcache[groupcounter]['from'] = '%s:%s' % (
+                    groupcache[groupcounter - 1]['from'], currentfilename)
+            else:
+                groupcache[groupcounter]['from'] = '%s:%s' % (
+                    groupcache[groupcounter - 1]['from'], groupcache[groupcounter - 1]['name'])
+        for k in list(groupcache[groupcounter].keys()):
+            if not groupcache[groupcounter][k]:
+                del groupcache[groupcounter][k]
+
+        groupcache[groupcounter]['args'] = args
+        groupcache[groupcounter]['body'] = []
+        groupcache[groupcounter]['externals'] = []
+        groupcache[groupcounter]['interfaced'] = []
+        groupcache[groupcounter]['vars'] = {}
+        groupcache[groupcounter]['entry'] = {}
+        # end of creation
+        if block == 'type':
+            groupcache[groupcounter]['varnames'] = []
+
+        if case in ['call', 'callfun']:  # set parents variables
+            if name not in groupcache[groupcounter - 2]['externals']:
+                groupcache[groupcounter - 2]['externals'].append(name)
+            groupcache[groupcounter]['vars'] = copy.deepcopy(
+                groupcache[groupcounter - 2]['vars'])
+            try:
+                del groupcache[groupcounter]['vars'][name][
+                    groupcache[groupcounter]['vars'][name]['attrspec'].index('external')]
+            except Exception:
+                pass
+        if block in ['function', 'subroutine']:  # set global attributes
+            try:
+                groupcache[groupcounter]['vars'][name] = appenddecl(
+                    groupcache[groupcounter]['vars'][name], groupcache[groupcounter - 2]['vars'][''])
+            except Exception:
+                pass
+            if case == 'callfun':  # return type
+                if result and result in groupcache[groupcounter]['vars']:
+                    if not name == result:
+                        groupcache[groupcounter]['vars'][name] = appenddecl(
+                            groupcache[groupcounter]['vars'][name], groupcache[groupcounter]['vars'][result])
+            # if groupcounter>1: # name is interfaced
+            try:
+                groupcache[groupcounter - 2]['interfaced'].append(name)
+            except Exception:
+                pass
+        if block == 'function':
+            t = typespattern[0].match(m.group('before') + ' ' + name)
+            if t:
+                typespec, selector, attr, edecl = cracktypespec0(
+                    t.group('this'), t.group('after'))
+                updatevars(typespec, selector, attr, edecl)
+
+        if case in ['call', 'callfun']:
+            grouplist[groupcounter - 1].append(groupcache[groupcounter])
+            grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+            del grouplist[groupcounter]
+            groupcounter = groupcounter - 1  # end routine
+            grouplist[groupcounter - 1].append(groupcache[groupcounter])
+            grouplist[groupcounter - 1][-1]['body'] = grouplist[groupcounter]
+            del grouplist[groupcounter]
+            groupcounter = groupcounter - 1  # end interface
+
+    elif case == 'entry':
+        name, args, result, bind = _resolvenameargspattern(m.group('after'))
+        if name is not None:
+            if args:
+                args = rmbadname([x.strip()
+                                  for x in markoutercomma(args).split('@,@')])
+            else:
+                args = []
+            assert result is None, repr(result)
+            groupcache[groupcounter]['entry'][name] = args
+            previous_context = ('entry', name, groupcounter)
+    elif case == 'type':
+        typespec, selector, attr, edecl = cracktypespec0(
+            block, m.group('after'))
+        last_name = updatevars(typespec, selector, attr, edecl)
+        if last_name is not None:
+            previous_context = ('variable', last_name, groupcounter)
+    elif case in ['dimension', 'intent', 'optional', 'required', 'external', 'public', 'private', 'intrinsic']:
+        edecl = groupcache[groupcounter]['vars']
+        ll = m.group('after').strip()
+        i = ll.find('::')
+        if i < 0 and case == 'intent':
+            i = markouterparen(ll).find('@)@') - 2
+            ll = ll[:i + 1] + '::' + ll[i + 1:]
+            i = ll.find('::')
+            if ll[i:] == '::' and 'args' in groupcache[groupcounter]:
+                outmess('All arguments will have attribute %s%s\n' %
+                        (m.group('this'), ll[:i]))
+                ll = ll + ','.join(groupcache[groupcounter]['args'])
+        if i < 0:
+            i = 0
+            pl = ''
+        else:
+            pl = ll[:i].strip()
+            ll = ll[i + 2:]
+        ch = markoutercomma(pl).split('@,@')
+        if len(ch) > 1:
+            pl = ch[0]
+            outmess('analyzeline: cannot handle multiple attributes without type specification. Ignoring %r.\n' % (
+                ','.join(ch[1:])))
+        last_name = None
+
+        for e in [x.strip() for x in markoutercomma(ll).split('@,@')]:
+            m1 = namepattern.match(e)
+            if not m1:
+                if case in ['public', 'private']:
+                    k = ''
+                else:
+                    print(m.groupdict())
+                    outmess('analyzeline: no name pattern found in %s statement for %s. Skipping.\n' % (
+                        case, repr(e)))
+                    continue
+            else:
+                k = rmbadname1(m1.group('name'))
+            if k not in edecl:
+                edecl[k] = {}
+            if case == 'dimension':
+                ap = case + m1.group('after')
+            if case == 'intent':
+                ap = m.group('this') + pl
+                if _intentcallbackpattern.match(ap):
+                    if k not in groupcache[groupcounter]['args']:
+                        if groupcounter > 1:
+                            if '__user__' not in groupcache[groupcounter - 2]['name']:
+                                outmess(
+                                    'analyzeline: missing __user__ module (could be nothing)\n')
+                            # fixes ticket 1693
+                            if k != groupcache[groupcounter]['name']:
+                                outmess('analyzeline: appending intent(callback) %s'
+                                        ' to %s arguments\n' % (k, groupcache[groupcounter]['name']))
+                                groupcache[groupcounter]['args'].append(k)
+                        else:
+                            errmess(
+                                'analyzeline: intent(callback) %s is ignored' % (k))
+                    else:
+                        errmess('analyzeline: intent(callback) %s is already'
+                                ' in argument list' % (k))
+            if case in ['optional', 'required', 'public', 'external', 'private', 'intrinsic']:
+                ap = case
+            if 'attrspec' in edecl[k]:
+                edecl[k]['attrspec'].append(ap)
+            else:
+                edecl[k]['attrspec'] = [ap]
+            if case == 'external':
+                if groupcache[groupcounter]['block'] == 'program':
+                    outmess('analyzeline: ignoring program arguments\n')
+                    continue
+                if k not in groupcache[groupcounter]['args']:
+                    continue
+                if 'externals' not in groupcache[groupcounter]:
+                    groupcache[groupcounter]['externals'] = []
+                groupcache[groupcounter]['externals'].append(k)
+            last_name = k
+        groupcache[groupcounter]['vars'] = edecl
+        if last_name is not None:
+            previous_context = ('variable', last_name, groupcounter)
+    elif case == 'parameter':
+        edecl = groupcache[groupcounter]['vars']
+        ll = m.group('after').strip()[1:-1]
+        last_name = None
+        for e in markoutercomma(ll).split('@,@'):
+            try:
+                k, initexpr = [x.strip() for x in e.split('=')]
+            except Exception:
+                outmess(
+                    'analyzeline: could not extract name,expr in parameter statement "%s" of "%s"\n' % (e, ll))
+                continue
+            params = get_parameters(edecl)
+            k = rmbadname1(k)
+            if k not in edecl:
+                edecl[k] = {}
+            if '=' in edecl[k] and (not edecl[k]['='] == initexpr):
+                outmess('analyzeline: Overwriting the value of parameter "%s" ("%s") with "%s".\n' % (
+                    k, edecl[k]['='], initexpr))
+            t = determineexprtype(initexpr, params)
+            if t:
+                if t.get('typespec') == 'real':
+                    tt = list(initexpr)
+                    for m in real16pattern.finditer(initexpr):
+                        tt[m.start():m.end()] = list(
+                            initexpr[m.start():m.end()].lower().replace('d', 'e'))
+                    initexpr = ''.join(tt)
+                elif t.get('typespec') == 'complex':
+                    initexpr = initexpr[1:].lower().replace('d', 'e').\
+                        replace(',', '+1j*(')
+            try:
+                v = eval(initexpr, {}, params)
+            except (SyntaxError, NameError, TypeError) as msg:
+                errmess('analyzeline: Failed to evaluate %r. Ignoring: %s\n'
+                        % (initexpr, msg))
+                continue
+            edecl[k]['='] = repr(v)
+            if 'attrspec' in edecl[k]:
+                edecl[k]['attrspec'].append('parameter')
+            else:
+                edecl[k]['attrspec'] = ['parameter']
+            last_name = k
+        groupcache[groupcounter]['vars'] = edecl
+        if last_name is not None:
+            previous_context = ('variable', last_name, groupcounter)
+    elif case == 'implicit':
+        if m.group('after').strip().lower() == 'none':
+            groupcache[groupcounter]['implicit'] = None
+        elif m.group('after'):
+            if 'implicit' in groupcache[groupcounter]:
+                impl = groupcache[groupcounter]['implicit']
+            else:
+                impl = {}
+            if impl is None:
+                outmess(
+                    'analyzeline: Overwriting earlier "implicit none" statement.\n')
+                impl = {}
+            for e in markoutercomma(m.group('after')).split('@,@'):
+                decl = {}
+                m1 = re.match(
+                    r'\s*(?P<this>.*?)\s*(\(\s*(?P<after>[a-z-, ]+)\s*\)\s*|)\Z', e, re.I)
+                if not m1:
+                    outmess(
+                        'analyzeline: could not extract info of implicit statement part "%s"\n' % (e))
+                    continue
+                m2 = typespattern4implicit.match(m1.group('this'))
+                if not m2:
+                    outmess(
+                        'analyzeline: could not extract types pattern of implicit statement part "%s"\n' % (e))
+                    continue
+                typespec, selector, attr, edecl = cracktypespec0(
+                    m2.group('this'), m2.group('after'))
+                kindselect, charselect, typename = cracktypespec(
+                    typespec, selector)
+                decl['typespec'] = typespec
+                decl['kindselector'] = kindselect
+                decl['charselector'] = charselect
+                decl['typename'] = typename
+                for k in list(decl.keys()):
+                    if not decl[k]:
+                        del decl[k]
+                for r in markoutercomma(m1.group('after')).split('@,@'):
+                    if '-' in r:
+                        try:
+                            begc, endc = [x.strip() for x in r.split('-')]
+                        except Exception:
+                            outmess(
+                                'analyzeline: expected "<char>-<char>" instead of "%s" in range list of implicit statement\n' % r)
+                            continue
+                    else:
+                        begc = endc = r.strip()
+                    if not len(begc) == len(endc) == 1:
+                        outmess(
+                            'analyzeline: expected "<char>-<char>" instead of "%s" in range list of implicit statement (2)\n' % r)
+                        continue
+                    for o in range(ord(begc), ord(endc) + 1):
+                        impl[chr(o)] = decl
+            groupcache[groupcounter]['implicit'] = impl
+    elif case == 'data':
+        ll = []
+        dl = ''
+        il = ''
+        f = 0
+        fc = 1
+        inp = 0
+        for c in m.group('after'):
+            if not inp:
+                if c == "'":
+                    fc = not fc
+                if c == '/' and fc:
+                    f = f + 1
+                    continue
+            if c == '(':
+                inp = inp + 1
+            elif c == ')':
+                inp = inp - 1
+            if f == 0:
+                dl = dl + c
+            elif f == 1:
+                il = il + c
+            elif f == 2:
+                dl = dl.strip()
+                if dl.startswith(','):
+                    dl = dl[1:].strip()
+                ll.append([dl, il])
+                dl = c
+                il = ''
+                f = 0
+        if f == 2:
+            dl = dl.strip()
+            if dl.startswith(','):
+                dl = dl[1:].strip()
+            ll.append([dl, il])
+        vars = {}
+        if 'vars' in groupcache[groupcounter]:
+            vars = groupcache[groupcounter]['vars']
+        last_name = None
+        for l in ll:
+            l = [x.strip() for x in l]
+            if l[0][0] == ',':
+                l[0] = l[0][1:]
+            if l[0][0] == '(':
+                outmess(
+                    'analyzeline: implied-DO list "%s" is not supported. Skipping.\n' % l[0])
+                continue
+            i = 0
+            j = 0
+            llen = len(l[1])
+            for v in rmbadname([x.strip() for x in markoutercomma(l[0]).split('@,@')]):
+                if v[0] == '(':
+                    outmess(
+                        'analyzeline: implied-DO list "%s" is not supported. Skipping.\n' % v)
+                    # XXX: subsequent init expressions may get wrong values.
+                    # Ignoring since data statements are irrelevant for
+                    # wrapping.
+                    continue
+                fc = 0
+                while (i < llen) and (fc or not l[1][i] == ','):
+                    if l[1][i] == "'":
+                        fc = not fc
+                    i = i + 1
+                i = i + 1
+                if v not in vars:
+                    vars[v] = {}
+                if '=' in vars[v] and not vars[v]['='] == l[1][j:i - 1]:
+                    outmess('analyzeline: changing init expression of "%s" ("%s") to "%s"\n' % (
+                        v, vars[v]['='], l[1][j:i - 1]))
+                vars[v]['='] = l[1][j:i - 1]
+                j = i
+                last_name = v
+        groupcache[groupcounter]['vars'] = vars
+        if last_name is not None:
+            previous_context = ('variable', last_name, groupcounter)
+    elif case == 'common':
+        line = m.group('after').strip()
+        if not line[0] == '/':
+            line = '//' + line
+        cl = []
+        f = 0
+        bn = ''
+        ol = ''
+        for c in line:
+            if c == '/':
+                f = f + 1
+                continue
+            if f >= 3:
+                bn = bn.strip()
+                if not bn:
+                    bn = '_BLNK_'
+                cl.append([bn, ol])
+                f = f - 2
+                bn = ''
+                ol = ''
+            if f % 2:
+                bn = bn + c
+            else:
+                ol = ol + c
+        bn = bn.strip()
+        if not bn:
+            bn = '_BLNK_'
+        cl.append([bn, ol])
+        commonkey = {}
+        if 'common' in groupcache[groupcounter]:
+            commonkey = groupcache[groupcounter]['common']
+        for c in cl:
+            if c[0] not in commonkey:
+                commonkey[c[0]] = []
+            for i in [x.strip() for x in markoutercomma(c[1]).split('@,@')]:
+                if i:
+                    commonkey[c[0]].append(i)
+        groupcache[groupcounter]['common'] = commonkey
+        previous_context = ('common', bn, groupcounter)
+    elif case == 'use':
+        m1 = re.match(
+            r'\A\s*(?P<name>\b[\w]+\b)\s*((,(\s*\bonly\b\s*:|(?P<notonly>))\s*(?P<list>.*))|)\s*\Z', m.group('after'), re.I)
+        if m1:
+            mm = m1.groupdict()
+            if 'use' not in groupcache[groupcounter]:
+                groupcache[groupcounter]['use'] = {}
+            name = m1.group('name')
+            groupcache[groupcounter]['use'][name] = {}
+            isonly = 0
+            if 'list' in mm and mm['list'] is not None:
+                if 'notonly' in mm and mm['notonly'] is None:
+                    isonly = 1
+                groupcache[groupcounter]['use'][name]['only'] = isonly
+                ll = [x.strip() for x in mm['list'].split(',')]
+                rl = {}
+                for l in ll:
+                    if '=' in l:
+                        m2 = re.match(
+                            r'\A\s*(?P<local>\b[\w]+\b)\s*=\s*>\s*(?P<use>\b[\w]+\b)\s*\Z', l, re.I)
+                        if m2:
+                            rl[m2.group('local').strip()] = m2.group(
+                                'use').strip()
+                        else:
+                            outmess(
+                                'analyzeline: Not local=>use pattern found in %s\n' % repr(l))
+                    else:
+                        rl[l] = l
+                    groupcache[groupcounter]['use'][name]['map'] = rl
+            else:
+                pass
+        else:
+            print(m.groupdict())
+            outmess('analyzeline: Could not crack the use statement.\n')
+    elif case in ['f2pyenhancements']:
+        if 'f2pyenhancements' not in groupcache[groupcounter]:
+            groupcache[groupcounter]['f2pyenhancements'] = {}
+        d = groupcache[groupcounter]['f2pyenhancements']
+        if m.group('this') == 'usercode' and 'usercode' in d:
+            if isinstance(d['usercode'], str):
+                d['usercode'] = [d['usercode']]
+            d['usercode'].append(m.group('after'))
+        else:
+            d[m.group('this')] = m.group('after')
+    elif case == 'multiline':
+        if previous_context is None:
+            if verbose:
+                outmess('analyzeline: No context for multiline block.\n')
+            return
+        gc = groupcounter
+        appendmultiline(groupcache[gc],
+                        previous_context[:2],
+                        m.group('this'))
+    else:
+        if verbose > 1:
+            print(m.groupdict())
+            outmess('analyzeline: No code implemented for line.\n')
+
+
+def appendmultiline(group, context_name, ml):
+    if 'f2pymultilines' not in group:
+        group['f2pymultilines'] = {}
+    d = group['f2pymultilines']
+    if context_name not in d:
+        d[context_name] = []
+    d[context_name].append(ml)
+    return
+
+
+def cracktypespec0(typespec, ll):
+    selector = None
+    attr = None
+    if re.match(r'double\s*complex', typespec, re.I):
+        typespec = 'double complex'
+    elif re.match(r'double\s*precision', typespec, re.I):
+        typespec = 'double precision'
+    else:
+        typespec = typespec.strip().lower()
+    m1 = selectpattern.match(markouterparen(ll))
+    if not m1:
+        outmess(
+            'cracktypespec0: no kind/char_selector pattern found for line.\n')
+        return
+    d = m1.groupdict()
+    for k in list(d.keys()):
+        d[k] = unmarkouterparen(d[k])
+    if typespec in ['complex', 'integer', 'logical', 'real', 'character', 'type']:
+        selector = d['this']
+        ll = d['after']
+    i = ll.find('::')
+    if i >= 0:
+        attr = ll[:i].strip()
+        ll = ll[i + 2:]
+    return typespec, selector, attr, ll
+#####
+namepattern = re.compile(r'\s*(?P<name>\b[\w]+\b)\s*(?P<after>.*)\s*\Z', re.I)
+kindselector = re.compile(
+    r'\s*(\(\s*(kind\s*=)?\s*(?P<kind>.*)\s*\)|[*]\s*(?P<kind2>.*?))\s*\Z', re.I)
+charselector = re.compile(
+    r'\s*(\((?P<lenkind>.*)\)|[*]\s*(?P<charlen>.*))\s*\Z', re.I)
+lenkindpattern = re.compile(
+    r'\s*(kind\s*=\s*(?P<kind>.*?)\s*(@,@\s*len\s*=\s*(?P<len>.*)|)|(len\s*=\s*|)(?P<len2>.*?)\s*(@,@\s*(kind\s*=\s*|)(?P<kind2>.*)|))\s*\Z', re.I)
+lenarraypattern = re.compile(
+    r'\s*(@\(@\s*(?!/)\s*(?P<array>.*?)\s*@\)@\s*[*]\s*(?P<len>.*?)|([*]\s*(?P<len2>.*?)|)\s*(@\(@\s*(?!/)\s*(?P<array2>.*?)\s*@\)@|))\s*(=\s*(?P<init>.*?)|(@\(@|)/\s*(?P<init2>.*?)\s*/(@\)@|)|)\s*\Z', re.I)
+
+
+def removespaces(expr):
+    expr = expr.strip()
+    if len(expr) <= 1:
+        return expr
+    expr2 = expr[0]
+    for i in range(1, len(expr) - 1):
+        if (expr[i] == ' ' and
+            ((expr[i + 1] in "()[]{}=+-/* ") or
+                (expr[i - 1] in "()[]{}=+-/* "))):
+            continue
+        expr2 = expr2 + expr[i]
+    expr2 = expr2 + expr[-1]
+    return expr2
+
+
+def markinnerspaces(line):
+    l = ''
+    f = 0
+    cc = '\''
+    cb = ''
+    for c in line:
+        if cb == '\\' and c in ['\\', '\'', '"']:
+            l = l + c
+            cb = c
+            continue
+        if f == 0 and c in ['\'', '"']:
+            cc = c
+        if c == cc:
+            f = f + 1
+        elif c == cc:
+            f = f - 1
+        elif c == ' ' and f == 1:
+            l = l + '@_@'
+            continue
+        l = l + c
+        cb = c
+    return l
+
+
+def updatevars(typespec, selector, attrspec, entitydecl):
+    global groupcache, groupcounter
+
+    last_name = None
+    kindselect, charselect, typename = cracktypespec(typespec, selector)
+    if attrspec:
+        attrspec = [x.strip() for x in markoutercomma(attrspec).split('@,@')]
+        l = []
+        c = re.compile(r'(?P<start>[a-zA-Z]+)')
+        for a in attrspec:
+            if not a:
+                continue
+            m = c.match(a)
+            if m:
+                s = m.group('start').lower()
+                a = s + a[len(s):]
+            l.append(a)
+        attrspec = l
+    el = [x.strip() for x in markoutercomma(entitydecl).split('@,@')]
+    el1 = []
+    for e in el:
+        for e1 in [x.strip() for x in markoutercomma(removespaces(markinnerspaces(e)), comma=' ').split('@ @')]:
+            if e1:
+                el1.append(e1.replace('@_@', ' '))
+    for e in el1:
+        m = namepattern.match(e)
+        if not m:
+            outmess(
+                'updatevars: no name pattern found for entity=%s. Skipping.\n' % (repr(e)))
+            continue
+        ename = rmbadname1(m.group('name'))
+        edecl = {}
+        if ename in groupcache[groupcounter]['vars']:
+            edecl = groupcache[groupcounter]['vars'][ename].copy()
+            not_has_typespec = 'typespec' not in edecl
+            if not_has_typespec:
+                edecl['typespec'] = typespec
+            elif typespec and (not typespec == edecl['typespec']):
+                outmess('updatevars: attempt to change the type of "%s" ("%s") to "%s". Ignoring.\n' % (
+                    ename, edecl['typespec'], typespec))
+            if 'kindselector' not in edecl:
+                edecl['kindselector'] = copy.copy(kindselect)
+            elif kindselect:
+                for k in list(kindselect.keys()):
+                    if k in edecl['kindselector'] and (not kindselect[k] == edecl['kindselector'][k]):
+                        outmess('updatevars: attempt to change the kindselector "%s" of "%s" ("%s") to "%s". Ignoring.\n' % (
+                            k, ename, edecl['kindselector'][k], kindselect[k]))
+                    else:
+                        edecl['kindselector'][k] = copy.copy(kindselect[k])
+            if 'charselector' not in edecl and charselect:
+                if not_has_typespec:
+                    edecl['charselector'] = charselect
+                else:
+                    errmess('updatevars:%s: attempt to change empty charselector to %r. Ignoring.\n'
+                            % (ename, charselect))
+            elif charselect:
+                for k in list(charselect.keys()):
+                    if k in edecl['charselector'] and (not charselect[k] == edecl['charselector'][k]):
+                        outmess('updatevars: attempt to change the charselector "%s" of "%s" ("%s") to "%s". Ignoring.\n' % (
+                            k, ename, edecl['charselector'][k], charselect[k]))
+                    else:
+                        edecl['charselector'][k] = copy.copy(charselect[k])
+            if 'typename' not in edecl:
+                edecl['typename'] = typename
+            elif typename and (not edecl['typename'] == typename):
+                outmess('updatevars: attempt to change the typename of "%s" ("%s") to "%s". Ignoring.\n' % (
+                    ename, edecl['typename'], typename))
+            if 'attrspec' not in edecl:
+                edecl['attrspec'] = copy.copy(attrspec)
+            elif attrspec:
+                for a in attrspec:
+                    if a not in edecl['attrspec']:
+                        edecl['attrspec'].append(a)
+        else:
+            edecl['typespec'] = copy.copy(typespec)
+            edecl['kindselector'] = copy.copy(kindselect)
+            edecl['charselector'] = copy.copy(charselect)
+            edecl['typename'] = typename
+            edecl['attrspec'] = copy.copy(attrspec)
+        if m.group('after'):
+            m1 = lenarraypattern.match(markouterparen(m.group('after')))
+            if m1:
+                d1 = m1.groupdict()
+                for lk in ['len', 'array', 'init']:
+                    if d1[lk + '2'] is not None:
+                        d1[lk] = d1[lk + '2']
+                        del d1[lk + '2']
+                for k in list(d1.keys()):
+                    if d1[k] is not None:
+                        d1[k] = unmarkouterparen(d1[k])
+                    else:
+                        del d1[k]
+                if 'len' in d1 and 'array' in d1:
+                    if d1['len'] == '':
+                        d1['len'] = d1['array']
+                        del d1['array']
+                    else:
+                        d1['array'] = d1['array'] + ',' + d1['len']
+                        del d1['len']
+                        errmess('updatevars: "%s %s" is mapped to "%s %s(%s)"\n' % (
+                            typespec, e, typespec, ename, d1['array']))
+                if 'array' in d1:
+                    dm = 'dimension(%s)' % d1['array']
+                    if 'attrspec' not in edecl or (not edecl['attrspec']):
+                        edecl['attrspec'] = [dm]
+                    else:
+                        edecl['attrspec'].append(dm)
+                        for dm1 in edecl['attrspec']:
+                            if dm1[:9] == 'dimension' and dm1 != dm:
+                                del edecl['attrspec'][-1]
+                                errmess('updatevars:%s: attempt to change %r to %r. Ignoring.\n'
+                                        % (ename, dm1, dm))
+                                break
+
+                if 'len' in d1:
+                    if typespec in ['complex', 'integer', 'logical', 'real']:
+                        if ('kindselector' not in edecl) or (not edecl['kindselector']):
+                            edecl['kindselector'] = {}
+                        edecl['kindselector']['*'] = d1['len']
+                    elif typespec == 'character':
+                        if ('charselector' not in edecl) or (not edecl['charselector']):
+                            edecl['charselector'] = {}
+                        if 'len' in edecl['charselector']:
+                            del edecl['charselector']['len']
+                        edecl['charselector']['*'] = d1['len']
+                if 'init' in d1:
+                    if '=' in edecl and (not edecl['='] == d1['init']):
+                        outmess('updatevars: attempt to change the init expression of "%s" ("%s") to "%s". Ignoring.\n' % (
+                            ename, edecl['='], d1['init']))
+                    else:
+                        edecl['='] = d1['init']
+            else:
+                outmess('updatevars: could not crack entity declaration "%s". Ignoring.\n' % (
+                    ename + m.group('after')))
+        for k in list(edecl.keys()):
+            if not edecl[k]:
+                del edecl[k]
+        groupcache[groupcounter]['vars'][ename] = edecl
+        if 'varnames' in groupcache[groupcounter]:
+            groupcache[groupcounter]['varnames'].append(ename)
+        last_name = ename
+    return last_name
+
+
+def cracktypespec(typespec, selector):
+    kindselect = None
+    charselect = None
+    typename = None
+    if selector:
+        if typespec in ['complex', 'integer', 'logical', 'real']:
+            kindselect = kindselector.match(selector)
+            if not kindselect:
+                outmess(
+                    'cracktypespec: no kindselector pattern found for %s\n' % (repr(selector)))
+                return
+            kindselect = kindselect.groupdict()
+            kindselect['*'] = kindselect['kind2']
+            del kindselect['kind2']
+            for k in list(kindselect.keys()):
+                if not kindselect[k]:
+                    del kindselect[k]
+            for k, i in list(kindselect.items()):
+                kindselect[k] = rmbadname1(i)
+        elif typespec == 'character':
+            charselect = charselector.match(selector)
+            if not charselect:
+                outmess(
+                    'cracktypespec: no charselector pattern found for %s\n' % (repr(selector)))
+                return
+            charselect = charselect.groupdict()
+            charselect['*'] = charselect['charlen']
+            del charselect['charlen']
+            if charselect['lenkind']:
+                lenkind = lenkindpattern.match(
+                    markoutercomma(charselect['lenkind']))
+                lenkind = lenkind.groupdict()
+                for lk in ['len', 'kind']:
+                    if lenkind[lk + '2']:
+                        lenkind[lk] = lenkind[lk + '2']
+                    charselect[lk] = lenkind[lk]
+                    del lenkind[lk + '2']
+            del charselect['lenkind']
+            for k in list(charselect.keys()):
+                if not charselect[k]:
+                    del charselect[k]
+            for k, i in list(charselect.items()):
+                charselect[k] = rmbadname1(i)
+        elif typespec == 'type':
+            typename = re.match(r'\s*\(\s*(?P<name>\w+)\s*\)', selector, re.I)
+            if typename:
+                typename = typename.group('name')
+            else:
+                outmess('cracktypespec: no typename found in %s\n' %
+                        (repr(typespec + selector)))
+        else:
+            outmess('cracktypespec: no selector used for %s\n' %
+                    (repr(selector)))
+    return kindselect, charselect, typename
+######
+
+
+def setattrspec(decl, attr, force=0):
+    if not decl:
+        decl = {}
+    if not attr:
+        return decl
+    if 'attrspec' not in decl:
+        decl['attrspec'] = [attr]
+        return decl
+    if force:
+        decl['attrspec'].append(attr)
+    if attr in decl['attrspec']:
+        return decl
+    if attr == 'static' and 'automatic' not in decl['attrspec']:
+        decl['attrspec'].append(attr)
+    elif attr == 'automatic' and 'static' not in decl['attrspec']:
+        decl['attrspec'].append(attr)
+    elif attr == 'public':
+        if 'private' not in decl['attrspec']:
+            decl['attrspec'].append(attr)
+    elif attr == 'private':
+        if 'public' not in decl['attrspec']:
+            decl['attrspec'].append(attr)
+    else:
+        decl['attrspec'].append(attr)
+    return decl
+
+
+def setkindselector(decl, sel, force=0):
+    if not decl:
+        decl = {}
+    if not sel:
+        return decl
+    if 'kindselector' not in decl:
+        decl['kindselector'] = sel
+        return decl
+    for k in list(sel.keys()):
+        if force or k not in decl['kindselector']:
+            decl['kindselector'][k] = sel[k]
+    return decl
+
+
+def setcharselector(decl, sel, force=0):
+    if not decl:
+        decl = {}
+    if not sel:
+        return decl
+    if 'charselector' not in decl:
+        decl['charselector'] = sel
+        return decl
+    for k in list(sel.keys()):
+        if force or k not in decl['charselector']:
+            decl['charselector'][k] = sel[k]
+    return decl
+
+
+def getblockname(block, unknown='unknown'):
+    if 'name' in block:
+        return block['name']
+    return unknown
+
+# post processing
+
+
+def setmesstext(block):
+    global filepositiontext
+
+    try:
+        filepositiontext = 'In: %s:%s\n' % (block['from'], block['name'])
+    except Exception:
+        pass
+
+
+def get_usedict(block):
+    usedict = {}
+    if 'parent_block' in block:
+        usedict = get_usedict(block['parent_block'])
+    if 'use' in block:
+        usedict.update(block['use'])
+    return usedict
+
+
+def get_useparameters(block, param_map=None):
+    global f90modulevars
+
+    if param_map is None:
+        param_map = {}
+    usedict = get_usedict(block)
+    if not usedict:
+        return param_map
+    for usename, mapping in list(usedict.items()):
+        usename = usename.lower()
+        if usename not in f90modulevars:
+            outmess('get_useparameters: no module %s info used by %s\n' %
+                    (usename, block.get('name')))
+            continue
+        mvars = f90modulevars[usename]
+        params = get_parameters(mvars)
+        if not params:
+            continue
+        # XXX: apply mapping
+        if mapping:
+            errmess('get_useparameters: mapping for %s not impl.' % (mapping))
+        for k, v in list(params.items()):
+            if k in param_map:
+                outmess('get_useparameters: overriding parameter %s with'
+                        ' value from module %s' % (repr(k), repr(usename)))
+            param_map[k] = v
+
+    return param_map
+
+
+def postcrack2(block, tab='', param_map=None):
+    global f90modulevars
+
+    if not f90modulevars:
+        return block
+    if isinstance(block, list):
+        ret = [postcrack2(g, tab=tab + '\t', param_map=param_map)
+               for g in block]
+        return ret
+    setmesstext(block)
+    outmess('%sBlock: %s\n' % (tab, block['name']), 0)
+
+    if param_map is None:
+        param_map = get_useparameters(block)
+
+    if param_map is not None and 'vars' in block:
+        vars = block['vars']
+        for n in list(vars.keys()):
+            var = vars[n]
+            if 'kindselector' in var:
+                kind = var['kindselector']
+                if 'kind' in kind:
+                    val = kind['kind']
+                    if val in param_map:
+                        kind['kind'] = param_map[val]
+    new_body = [postcrack2(b, tab=tab + '\t', param_map=param_map)
+                for b in block['body']]
+    block['body'] = new_body
+
+    return block
+
+
+def postcrack(block, args=None, tab=''):
+    """
+    TODO:
+          function return values
+          determine expression types if in argument list
+    """
+    global usermodules, onlyfunctions
+
+    if isinstance(block, list):
+        gret = []
+        uret = []
+        for g in block:
+            setmesstext(g)
+            g = postcrack(g, tab=tab + '\t')
+            # sort user routines to appear first
+            if 'name' in g and '__user__' in g['name']:
+                uret.append(g)
+            else:
+                gret.append(g)
+        return uret + gret
+    setmesstext(block)
+    if not isinstance(block, dict) and 'block' not in block:
+        raise Exception('postcrack: Expected block dictionary instead of ' +
+                        str(block))
+    if 'name' in block and not block['name'] == 'unknown_interface':
+        outmess('%sBlock: %s\n' % (tab, block['name']), 0)
+    block = analyzeargs(block)
+    block = analyzecommon(block)
+    block['vars'] = analyzevars(block)
+    block['sortvars'] = sortvarnames(block['vars'])
+    if 'args' in block and block['args']:
+        args = block['args']
+    block['body'] = analyzebody(block, args, tab=tab)
+
+    userisdefined = []
+    if 'use' in block:
+        useblock = block['use']
+        for k in list(useblock.keys()):
+            if '__user__' in k:
+                userisdefined.append(k)
+    else:
+        useblock = {}
+    name = ''
+    if 'name' in block:
+        name = block['name']
+    # and not userisdefined: # Build a __user__ module
+    if 'externals' in block and block['externals']:
+        interfaced = []
+        if 'interfaced' in block:
+            interfaced = block['interfaced']
+        mvars = copy.copy(block['vars'])
+        if name:
+            mname = name + '__user__routines'
+        else:
+            mname = 'unknown__user__routines'
+        if mname in userisdefined:
+            i = 1
+            while '%s_%i' % (mname, i) in userisdefined:
+                i = i + 1
+            mname = '%s_%i' % (mname, i)
+        interface = {'block': 'interface', 'body': [],
+                     'vars': {}, 'name': name + '_user_interface'}
+        for e in block['externals']:
+            if e in interfaced:
+                edef = []
+                j = -1
+                for b in block['body']:
+                    j = j + 1
+                    if b['block'] == 'interface':
+                        i = -1
+                        for bb in b['body']:
+                            i = i + 1
+                            if 'name' in bb and bb['name'] == e:
+                                edef = copy.copy(bb)
+                                del b['body'][i]
+                                break
+                        if edef:
+                            if not b['body']:
+                                del block['body'][j]
+                            del interfaced[interfaced.index(e)]
+                            break
+                interface['body'].append(edef)
+            else:
+                if e in mvars and not isexternal(mvars[e]):
+                    interface['vars'][e] = mvars[e]
+        if interface['vars'] or interface['body']:
+            block['interfaced'] = interfaced
+            mblock = {'block': 'python module', 'body': [
+                interface], 'vars': {}, 'name': mname, 'interfaced': block['externals']}
+            useblock[mname] = {}
+            usermodules.append(mblock)
+    if useblock:
+        block['use'] = useblock
+    return block
+
+
+def sortvarnames(vars):
+    indep = []
+    dep = []
+    for v in list(vars.keys()):
+        if 'depend' in vars[v] and vars[v]['depend']:
+            dep.append(v)
+        else:
+            indep.append(v)
+    n = len(dep)
+    i = 0
+    while dep:  # XXX: How to catch dependence cycles correctly?
+        v = dep[0]
+        fl = 0
+        for w in dep[1:]:
+            if w in vars[v]['depend']:
+                fl = 1
+                break
+        if fl:
+            dep = dep[1:] + [v]
+            i = i + 1
+            if i > n:
+                errmess('sortvarnames: failed to compute dependencies because'
+                        ' of cyclic dependencies between '
+                        + ', '.join(dep) + '\n')
+                indep = indep + dep
+                break
+        else:
+            indep.append(v)
+            dep = dep[1:]
+            n = len(dep)
+            i = 0
+    return indep
+
+
+def analyzecommon(block):
+    if not hascommon(block):
+        return block
+    commonvars = []
+    for k in list(block['common'].keys()):
+        comvars = []
+        for e in block['common'][k]:
+            m = re.match(
+                r'\A\s*\b(?P<name>.*?)\b\s*(\((?P<dims>.*?)\)|)\s*\Z', e, re.I)
+            if m:
+                dims = []
+                if m.group('dims'):
+                    dims = [x.strip()
+                            for x in markoutercomma(m.group('dims')).split('@,@')]
+                n = rmbadname1(m.group('name').strip())
+                if n in block['vars']:
+                    if 'attrspec' in block['vars'][n]:
+                        block['vars'][n]['attrspec'].append(
+                            'dimension(%s)' % (','.join(dims)))
+                    else:
+                        block['vars'][n]['attrspec'] = [
+                            'dimension(%s)' % (','.join(dims))]
+                else:
+                    if dims:
+                        block['vars'][n] = {
+                            'attrspec': ['dimension(%s)' % (','.join(dims))]}
+                    else:
+                        block['vars'][n] = {}
+                if n not in commonvars:
+                    commonvars.append(n)
+            else:
+                n = e
+                errmess(
+                    'analyzecommon: failed to extract "<name>[(<dims>)]" from "%s" in common /%s/.\n' % (e, k))
+            comvars.append(n)
+        block['common'][k] = comvars
+    if 'commonvars' not in block:
+        block['commonvars'] = commonvars
+    else:
+        block['commonvars'] = block['commonvars'] + commonvars
+    return block
+
+
+def analyzebody(block, args, tab=''):
+    global usermodules, skipfuncs, onlyfuncs, f90modulevars
+
+    setmesstext(block)
+    body = []
+    for b in block['body']:
+        b['parent_block'] = block
+        if b['block'] in ['function', 'subroutine']:
+            if args is not None and b['name'] not in args:
+                continue
+            else:
+                as_ = b['args']
+            if b['name'] in skipfuncs:
+                continue
+            if onlyfuncs and b['name'] not in onlyfuncs:
+                continue
+            b['saved_interface'] = crack2fortrangen(
+                b, '\n' + ' ' * 6, as_interface=True)
+
+        else:
+            as_ = args
+        b = postcrack(b, as_, tab=tab + '\t')
+        if b['block'] == 'interface' and not b['body']:
+            if 'f2pyenhancements' not in b:
+                continue
+        if b['block'].replace(' ', '') == 'pythonmodule':
+            usermodules.append(b)
+        else:
+            if b['block'] == 'module':
+                f90modulevars[b['name']] = b['vars']
+            body.append(b)
+    return body
+
+
+def buildimplicitrules(block):
+    setmesstext(block)
+    implicitrules = defaultimplicitrules
+    attrrules = {}
+    if 'implicit' in block:
+        if block['implicit'] is None:
+            implicitrules = None
+            if verbose > 1:
+                outmess(
+                    'buildimplicitrules: no implicit rules for routine %s.\n' % repr(block['name']))
+        else:
+            for k in list(block['implicit'].keys()):
+                if block['implicit'][k].get('typespec') not in ['static', 'automatic']:
+                    implicitrules[k] = block['implicit'][k]
+                else:
+                    attrrules[k] = block['implicit'][k]['typespec']
+    return implicitrules, attrrules
+
+
+def myeval(e, g=None, l=None):
+    r = eval(e, g, l)
+    if type(r) in [type(0), type(0.0)]:
+        return r
+    raise ValueError('r=%r' % (r))
+
+getlincoef_re_1 = re.compile(r'\A\b\w+\b\Z', re.I)
+
+
+def getlincoef(e, xset):  # e = a*x+b ; x in xset
+    try:
+        c = int(myeval(e, {}, {}))
+        return 0, c, None
+    except Exception:
+        pass
+    if getlincoef_re_1.match(e):
+        return 1, 0, e
+    len_e = len(e)
+    for x in xset:
+        if len(x) > len_e:
+            continue
+        if re.search(r'\w\s*\([^)]*\b' + x + r'\b', e):
+            # skip function calls having x as an argument, e.g max(1, x)
+            continue
+        re_1 = re.compile(r'(?P<before>.*?)\b' + x + r'\b(?P<after>.*)', re.I)
+        m = re_1.match(e)
+        if m:
+            try:
+                m1 = re_1.match(e)
+                while m1:
+                    ee = '%s(%s)%s' % (
+                        m1.group('before'), 0, m1.group('after'))
+                    m1 = re_1.match(ee)
+                b = myeval(ee, {}, {})
+                m1 = re_1.match(e)
+                while m1:
+                    ee = '%s(%s)%s' % (
+                        m1.group('before'), 1, m1.group('after'))
+                    m1 = re_1.match(ee)
+                a = myeval(ee, {}, {}) - b
+                m1 = re_1.match(e)
+                while m1:
+                    ee = '%s(%s)%s' % (
+                        m1.group('before'), 0.5, m1.group('after'))
+                    m1 = re_1.match(ee)
+                c = myeval(ee, {}, {})
+                # computing another point to be sure that expression is linear
+                m1 = re_1.match(e)
+                while m1:
+                    ee = '%s(%s)%s' % (
+                        m1.group('before'), 1.5, m1.group('after'))
+                    m1 = re_1.match(ee)
+                c2 = myeval(ee, {}, {})
+                if (a * 0.5 + b == c and a * 1.5 + b == c2):
+                    return a, b, x
+            except Exception:
+                pass
+            break
+    return None, None, None
+
+_varname_match = re.compile(r'\A[a-z]\w*\Z').match
+
+
+def getarrlen(dl, args, star='*'):
+    edl = []
+    try:
+        edl.append(myeval(dl[0], {}, {}))
+    except Exception:
+        edl.append(dl[0])
+    try:
+        edl.append(myeval(dl[1], {}, {}))
+    except Exception:
+        edl.append(dl[1])
+    if isinstance(edl[0], int):
+        p1 = 1 - edl[0]
+        if p1 == 0:
+            d = str(dl[1])
+        elif p1 < 0:
+            d = '%s-%s' % (dl[1], -p1)
+        else:
+            d = '%s+%s' % (dl[1], p1)
+    elif isinstance(edl[1], int):
+        p1 = 1 + edl[1]
+        if p1 == 0:
+            d = '-(%s)' % (dl[0])
+        else:
+            d = '%s-(%s)' % (p1, dl[0])
+    else:
+        d = '%s-(%s)+1' % (dl[1], dl[0])
+    try:
+        return repr(myeval(d, {}, {})), None, None
+    except Exception:
+        pass
+    d1, d2 = getlincoef(dl[0], args), getlincoef(dl[1], args)
+    if None not in [d1[0], d2[0]]:
+        if (d1[0], d2[0]) == (0, 0):
+            return repr(d2[1] - d1[1] + 1), None, None
+        b = d2[1] - d1[1] + 1
+        d1 = (d1[0], 0, d1[2])
+        d2 = (d2[0], b, d2[2])
+        if d1[0] == 0 and d2[2] in args:
+            if b < 0:
+                return '%s * %s - %s' % (d2[0], d2[2], -b), d2[2], '+%s)/(%s)' % (-b, d2[0])
+            elif b:
+                return '%s * %s + %s' % (d2[0], d2[2], b), d2[2], '-%s)/(%s)' % (b, d2[0])
+            else:
+                return '%s * %s' % (d2[0], d2[2]), d2[2], ')/(%s)' % (d2[0])
+        if d2[0] == 0 and d1[2] in args:
+
+            if b < 0:
+                return '%s * %s - %s' % (-d1[0], d1[2], -b), d1[2], '+%s)/(%s)' % (-b, -d1[0])
+            elif b:
+                return '%s * %s + %s' % (-d1[0], d1[2], b), d1[2], '-%s)/(%s)' % (b, -d1[0])
+            else:
+                return '%s * %s' % (-d1[0], d1[2]), d1[2], ')/(%s)' % (-d1[0])
+        if d1[2] == d2[2] and d1[2] in args:
+            a = d2[0] - d1[0]
+            if not a:
+                return repr(b), None, None
+            if b < 0:
+                return '%s * %s - %s' % (a, d1[2], -b), d2[2], '+%s)/(%s)' % (-b, a)
+            elif b:
+                return '%s * %s + %s' % (a, d1[2], b), d2[2], '-%s)/(%s)' % (b, a)
+            else:
+                return '%s * %s' % (a, d1[2]), d2[2], ')/(%s)' % (a)
+        if d1[0] == d2[0] == 1:
+            c = str(d1[2])
+            if c not in args:
+                if _varname_match(c):
+                    outmess('\tgetarrlen:variable "%s" undefined\n' % (c))
+                c = '(%s)' % c
+            if b == 0:
+                d = '%s-%s' % (d2[2], c)
+            elif b < 0:
+                d = '%s-%s-%s' % (d2[2], c, -b)
+            else:
+                d = '%s-%s+%s' % (d2[2], c, b)
+        elif d1[0] == 0:
+            c2 = str(d2[2])
+            if c2 not in args:
+                if _varname_match(c2):
+                    outmess('\tgetarrlen:variable "%s" undefined\n' % (c2))
+                c2 = '(%s)' % c2
+            if d2[0] == 1:
+                pass
+            elif d2[0] == -1:
+                c2 = '-%s' % c2
+            else:
+                c2 = '%s*%s' % (d2[0], c2)
+
+            if b == 0:
+                d = c2
+            elif b < 0:
+                d = '%s-%s' % (c2, -b)
+            else:
+                d = '%s+%s' % (c2, b)
+        elif d2[0] == 0:
+            c1 = str(d1[2])
+            if c1 not in args:
+                if _varname_match(c1):
+                    outmess('\tgetarrlen:variable "%s" undefined\n' % (c1))
+                c1 = '(%s)' % c1
+            if d1[0] == 1:
+                c1 = '-%s' % c1
+            elif d1[0] == -1:
+                c1 = '+%s' % c1
+            elif d1[0] < 0:
+                c1 = '+%s*%s' % (-d1[0], c1)
+            else:
+                c1 = '-%s*%s' % (d1[0], c1)
+
+            if b == 0:
+                d = c1
+            elif b < 0:
+                d = '%s-%s' % (c1, -b)
+            else:
+                d = '%s+%s' % (c1, b)
+        else:
+            c1 = str(d1[2])
+            if c1 not in args:
+                if _varname_match(c1):
+                    outmess('\tgetarrlen:variable "%s" undefined\n' % (c1))
+                c1 = '(%s)' % c1
+            if d1[0] == 1:
+                c1 = '-%s' % c1
+            elif d1[0] == -1:
+                c1 = '+%s' % c1
+            elif d1[0] < 0:
+                c1 = '+%s*%s' % (-d1[0], c1)
+            else:
+                c1 = '-%s*%s' % (d1[0], c1)
+
+            c2 = str(d2[2])
+            if c2 not in args:
+                if _varname_match(c2):
+                    outmess('\tgetarrlen:variable "%s" undefined\n' % (c2))
+                c2 = '(%s)' % c2
+            if d2[0] == 1:
+                pass
+            elif d2[0] == -1:
+                c2 = '-%s' % c2
+            else:
+                c2 = '%s*%s' % (d2[0], c2)
+
+            if b == 0:
+                d = '%s%s' % (c2, c1)
+            elif b < 0:
+                d = '%s%s-%s' % (c2, c1, -b)
+            else:
+                d = '%s%s+%s' % (c2, c1, b)
+    return d, None, None
+
+word_pattern = re.compile(r'\b[a-z][\w$]*\b', re.I)
+
+
+def _get_depend_dict(name, vars, deps):
+    if name in vars:
+        words = vars[name].get('depend', [])
+
+        if '=' in vars[name] and not isstring(vars[name]):
+            for word in word_pattern.findall(vars[name]['=']):
+                if word not in words and word in vars:
+                    words.append(word)
+        for word in words[:]:
+            for w in deps.get(word, []) \
+                    or _get_depend_dict(word, vars, deps):
+                if w not in words:
+                    words.append(w)
+    else:
+        outmess('_get_depend_dict: no dependence info for %s\n' % (repr(name)))
+        words = []
+    deps[name] = words
+    return words
+
+
+def _calc_depend_dict(vars):
+    names = list(vars.keys())
+    depend_dict = {}
+    for n in names:
+        _get_depend_dict(n, vars, depend_dict)
+    return depend_dict
+
+
+def get_sorted_names(vars):
+    """
+    """
+    depend_dict = _calc_depend_dict(vars)
+    names = []
+    for name in list(depend_dict.keys()):
+        if not depend_dict[name]:
+            names.append(name)
+            del depend_dict[name]
+    while depend_dict:
+        for name, lst in list(depend_dict.items()):
+            new_lst = [n for n in lst if n in depend_dict]
+            if not new_lst:
+                names.append(name)
+                del depend_dict[name]
+            else:
+                depend_dict[name] = new_lst
+    return [name for name in names if name in vars]
+
+
+def _kind_func(string):
+    # XXX: return something sensible.
+    if string[0] in "'\"":
+        string = string[1:-1]
+    if real16pattern.match(string):
+        return 8
+    elif real8pattern.match(string):
+        return 4
+    return 'kind(' + string + ')'
+
+
+def _selected_int_kind_func(r):
+    # XXX: This should be processor dependent
+    m = 10 ** r
+    if m <= 2 ** 8:
+        return 1
+    if m <= 2 ** 16:
+        return 2
+    if m <= 2 ** 32:
+        return 4
+    if m <= 2 ** 63:
+        return 8
+    if m <= 2 ** 128:
+        return 16
+    return -1
+
+
+def _selected_real_kind_func(p, r=0, radix=0):
+    # XXX: This should be processor dependent
+    # This is only good for 0 <= p <= 20
+    if p < 7:
+        return 4
+    if p < 16:
+        return 8
+    machine = platform.machine().lower()
+    if machine.startswith(('aarch64', 'power', 'ppc', 'riscv', 's390x', 'sparc')):
+        if p <= 20:
+            return 16
+    else:
+        if p < 19:
+            return 10
+        elif p <= 20:
+            return 16
+    return -1
+
+
+def get_parameters(vars, global_params={}):
+    params = copy.copy(global_params)
+    g_params = copy.copy(global_params)
+    for name, func in [('kind', _kind_func),
+                       ('selected_int_kind', _selected_int_kind_func),
+                       ('selected_real_kind', _selected_real_kind_func), ]:
+        if name not in g_params:
+            g_params[name] = func
+    param_names = []
+    for n in get_sorted_names(vars):
+        if 'attrspec' in vars[n] and 'parameter' in vars[n]['attrspec']:
+            param_names.append(n)
+    kind_re = re.compile(r'\bkind\s*\(\s*(?P<value>.*)\s*\)', re.I)
+    selected_int_kind_re = re.compile(
+        r'\bselected_int_kind\s*\(\s*(?P<value>.*)\s*\)', re.I)
+    selected_kind_re = re.compile(
+        r'\bselected_(int|real)_kind\s*\(\s*(?P<value>.*)\s*\)', re.I)
+    for n in param_names:
+        if '=' in vars[n]:
+            v = vars[n]['=']
+            if islogical(vars[n]):
+                v = v.lower()
+                for repl in [
+                    ('.false.', 'False'),
+                    ('.true.', 'True'),
+                    # TODO: test .eq., .neq., etc replacements.
+                ]:
+                    v = v.replace(*repl)
+            v = kind_re.sub(r'kind("\1")', v)
+            v = selected_int_kind_re.sub(r'selected_int_kind(\1)', v)
+
+            # We need to act according to the data.
+            # The easy case is if the data has a kind-specifier,
+            # then we may easily remove those specifiers.
+            # However, it may be that the user uses other specifiers...(!)
+            is_replaced = False
+            if 'kindselector' in vars[n]:
+                if 'kind' in vars[n]['kindselector']:
+                    orig_v_len = len(v)
+                    v = v.replace('_' + vars[n]['kindselector']['kind'], '')
+                    # Again, this will be true if even a single specifier
+                    # has been replaced, see comment above.
+                    is_replaced = len(v) < orig_v_len
+                    
+            if not is_replaced:
+                if not selected_kind_re.match(v):
+                    v_ = v.split('_')
+                    # In case there are additive parameters
+                    if len(v_) > 1: 
+                        v = ''.join(v_[:-1]).lower().replace(v_[-1].lower(), '')
+
+            # Currently this will not work for complex numbers.
+            # There is missing code for extracting a complex number,
+            # which may be defined in either of these:
+            #  a) (Re, Im)
+            #  b) cmplx(Re, Im)
+            #  c) dcmplx(Re, Im)
+            #  d) cmplx(Re, Im, <prec>)
+
+            if isdouble(vars[n]):
+                tt = list(v)
+                for m in real16pattern.finditer(v):
+                    tt[m.start():m.end()] = list(
+                        v[m.start():m.end()].lower().replace('d', 'e'))
+                v = ''.join(tt)
+
+            elif iscomplex(vars[n]):
+                # FIXME complex numbers may also have exponents
+                if v[0] == '(' and v[-1] == ')':
+                    # FIXME, unused l looks like potential bug
+                    l = markoutercomma(v[1:-1]).split('@,@')
+
+            try:
+                params[n] = eval(v, g_params, params)
+            except Exception as msg:
+                params[n] = v
+                outmess('get_parameters: got "%s" on %s\n' % (msg, repr(v)))
+            if isstring(vars[n]) and isinstance(params[n], int):
+                params[n] = chr(params[n])
+            nl = n.lower()
+            if nl != n:
+                params[nl] = params[n]
+        else:
+            print(vars[n])
+            outmess(
+                'get_parameters:parameter %s does not have value?!\n' % (repr(n)))
+    return params
+
+
+def _eval_length(length, params):
+    if length in ['(:)', '(*)', '*']:
+        return '(*)'
+    return _eval_scalar(length, params)
+
+_is_kind_number = re.compile(r'\d+_').match
+
+
+def _eval_scalar(value, params):
+    if _is_kind_number(value):
+        value = value.split('_')[0]
+    try:
+        value = str(eval(value, {}, params))
+    except (NameError, SyntaxError, TypeError):
+        return value
+    except Exception as msg:
+        errmess('"%s" in evaluating %r '
+                '(available names: %s)\n'
+                % (msg, value, list(params.keys())))
+    return value
+
+
+def analyzevars(block):
+    global f90modulevars
+
+    setmesstext(block)
+    implicitrules, attrrules = buildimplicitrules(block)
+    vars = copy.copy(block['vars'])
+    if block['block'] == 'function' and block['name'] not in vars:
+        vars[block['name']] = {}
+    if '' in block['vars']:
+        del vars['']
+        if 'attrspec' in block['vars']['']:
+            gen = block['vars']['']['attrspec']
+            for n in list(vars.keys()):
+                for k in ['public', 'private']:
+                    if k in gen:
+                        vars[n] = setattrspec(vars[n], k)
+    svars = []
+    args = block['args']
+    for a in args:
+        try:
+            vars[a]
+            svars.append(a)
+        except KeyError:
+            pass
+    for n in list(vars.keys()):
+        if n not in args:
+            svars.append(n)
+
+    params = get_parameters(vars, get_useparameters(block))
+
+    dep_matches = {}
+    name_match = re.compile(r'\w[\w\d_$]*').match
+    for v in list(vars.keys()):
+        m = name_match(v)
+        if m:
+            n = v[m.start():m.end()]
+            try:
+                dep_matches[n]
+            except KeyError:
+                dep_matches[n] = re.compile(r'.*\b%s\b' % (v), re.I).match
+    for n in svars:
+        if n[0] in list(attrrules.keys()):
+            vars[n] = setattrspec(vars[n], attrrules[n[0]])
+        if 'typespec' not in vars[n]:
+            if not('attrspec' in vars[n] and 'external' in vars[n]['attrspec']):
+                if implicitrules:
+                    ln0 = n[0].lower()
+                    for k in list(implicitrules[ln0].keys()):
+                        if k == 'typespec' and implicitrules[ln0][k] == 'undefined':
+                            continue
+                        if k not in vars[n]:
+                            vars[n][k] = implicitrules[ln0][k]
+                        elif k == 'attrspec':
+                            for l in implicitrules[ln0][k]:
+                                vars[n] = setattrspec(vars[n], l)
+                elif n in block['args']:
+                    outmess('analyzevars: typespec of variable %s is not defined in routine %s.\n' % (
+                        repr(n), block['name']))
+
+        if 'charselector' in vars[n]:
+            if 'len' in vars[n]['charselector']:
+                l = vars[n]['charselector']['len']
+                try:
+                    l = str(eval(l, {}, params))
+                except Exception:
+                    pass
+                vars[n]['charselector']['len'] = l
+
+        if 'kindselector' in vars[n]:
+            if 'kind' in vars[n]['kindselector']:
+                l = vars[n]['kindselector']['kind']
+                try:
+                    l = str(eval(l, {}, params))
+                except Exception:
+                    pass
+                vars[n]['kindselector']['kind'] = l
+
+        savelindims = {}
+        if 'attrspec' in vars[n]:
+            attr = vars[n]['attrspec']
+            attr.reverse()
+            vars[n]['attrspec'] = []
+            dim, intent, depend, check, note = None, None, None, None, None
+            for a in attr:
+                if a[:9] == 'dimension':
+                    dim = (a[9:].strip())[1:-1]
+                elif a[:6] == 'intent':
+                    intent = (a[6:].strip())[1:-1]
+                elif a[:6] == 'depend':
+                    depend = (a[6:].strip())[1:-1]
+                elif a[:5] == 'check':
+                    check = (a[5:].strip())[1:-1]
+                elif a[:4] == 'note':
+                    note = (a[4:].strip())[1:-1]
+                else:
+                    vars[n] = setattrspec(vars[n], a)
+                if intent:
+                    if 'intent' not in vars[n]:
+                        vars[n]['intent'] = []
+                    for c in [x.strip() for x in markoutercomma(intent).split('@,@')]:
+                        # Remove spaces so that 'in out' becomes 'inout'
+                        tmp = c.replace(' ', '')
+                        if tmp not in vars[n]['intent']:
+                            vars[n]['intent'].append(tmp)
+                    intent = None
+                if note:
+                    note = note.replace('\\n\\n', '\n\n')
+                    note = note.replace('\\n ', '\n')
+                    if 'note' not in vars[n]:
+                        vars[n]['note'] = [note]
+                    else:
+                        vars[n]['note'].append(note)
+                    note = None
+                if depend is not None:
+                    if 'depend' not in vars[n]:
+                        vars[n]['depend'] = []
+                    for c in rmbadname([x.strip() for x in markoutercomma(depend).split('@,@')]):
+                        if c not in vars[n]['depend']:
+                            vars[n]['depend'].append(c)
+                    depend = None
+                if check is not None:
+                    if 'check' not in vars[n]:
+                        vars[n]['check'] = []
+                    for c in [x.strip() for x in markoutercomma(check).split('@,@')]:
+                        if c not in vars[n]['check']:
+                            vars[n]['check'].append(c)
+                    check = None
+            if dim and 'dimension' not in vars[n]:
+                vars[n]['dimension'] = []
+                for d in rmbadname([x.strip() for x in markoutercomma(dim).split('@,@')]):
+                    star = '*'
+                    if d == ':':
+                        star = ':'
+                    if d in params:
+                        d = str(params[d])
+                    for p in list(params.keys()):
+                        re_1 = re.compile(r'(?P<before>.*?)\b' + p + r'\b(?P<after>.*)', re.I)
+                        m = re_1.match(d)
+                        while m:
+                            d = m.group('before') + \
+                                str(params[p]) + m.group('after')
+                            m = re_1.match(d)
+                    if d == star:
+                        dl = [star]
+                    else:
+                        dl = markoutercomma(d, ':').split('@:@')
+                    if len(dl) == 2 and '*' in dl:  # e.g. dimension(5:*)
+                        dl = ['*']
+                        d = '*'
+                    if len(dl) == 1 and not dl[0] == star:
+                        dl = ['1', dl[0]]
+                    if len(dl) == 2:
+                        d, v, di = getarrlen(dl, list(block['vars'].keys()))
+                        if d[:4] == '1 * ':
+                            d = d[4:]
+                        if di and di[-4:] == '/(1)':
+                            di = di[:-4]
+                        if v:
+                            savelindims[d] = v, di
+                    vars[n]['dimension'].append(d)
+        if 'dimension' in vars[n]:
+            if isintent_c(vars[n]):
+                shape_macro = 'shape'
+            else:
+                shape_macro = 'shape'  # 'fshape'
+            if isstringarray(vars[n]):
+                if 'charselector' in vars[n]:
+                    d = vars[n]['charselector']
+                    if '*' in d:
+                        d = d['*']
+                        errmess('analyzevars: character array "character*%s %s(%s)" is considered as "character %s(%s)"; "intent(c)" is forced.\n'
+                                % (d, n,
+                                   ','.join(vars[n]['dimension']),
+                                   n, ','.join(vars[n]['dimension'] + [d])))
+                        vars[n]['dimension'].append(d)
+                        del vars[n]['charselector']
+                        if 'intent' not in vars[n]:
+                            vars[n]['intent'] = []
+                        if 'c' not in vars[n]['intent']:
+                            vars[n]['intent'].append('c')
+                    else:
+                        errmess(
+                            "analyzevars: charselector=%r unhandled." % (d))
+        if 'check' not in vars[n] and 'args' in block and n in block['args']:
+            flag = 'depend' not in vars[n]
+            if flag:
+                vars[n]['depend'] = []
+            vars[n]['check'] = []
+            if 'dimension' in vars[n]:
+                #/----< no check
+                i = -1
+                ni = len(vars[n]['dimension'])
+                for d in vars[n]['dimension']:
+                    ddeps = []  # dependencies of 'd'
+                    ad = ''
+                    pd = ''
+                    if d not in vars:
+                        if d in savelindims:
+                            pd, ad = '(', savelindims[d][1]
+                            d = savelindims[d][0]
+                        else:
+                            for r in block['args']:
+                                if r not in vars:
+                                    continue
+                                if re.match(r'.*?\b' + r + r'\b', d, re.I):
+                                    ddeps.append(r)
+                    if d in vars:
+                        if 'attrspec' in vars[d]:
+                            for aa in vars[d]['attrspec']:
+                                if aa[:6] == 'depend':
+                                    ddeps += aa[6:].strip()[1:-1].split(',')
+                        if 'depend' in vars[d]:
+                            ddeps = ddeps + vars[d]['depend']
+                    i = i + 1
+                    if d in vars and ('depend' not in vars[d]) \
+                       and ('=' not in vars[d]) and (d not in vars[n]['depend']) \
+                       and l_or(isintent_in, isintent_inout, isintent_inplace)(vars[n]):
+                        vars[d]['depend'] = [n]
+                        if ni > 1:
+                            vars[d]['='] = '%s%s(%s,%s)%s' % (
+                                pd, shape_macro, n, i, ad)
+                        else:
+                            vars[d]['='] = '%slen(%s)%s' % (pd, n, ad)
+                        #  /---< no check
+                        if 1 and 'check' not in vars[d]:
+                            if ni > 1:
+                                vars[d]['check'] = ['%s%s(%s,%i)%s==%s'
+                                                    % (pd, shape_macro, n, i, ad, d)]
+                            else:
+                                vars[d]['check'] = [
+                                    '%slen(%s)%s>=%s' % (pd, n, ad, d)]
+                        if 'attrspec' not in vars[d]:
+                            vars[d]['attrspec'] = ['optional']
+                        if ('optional' not in vars[d]['attrspec']) and\
+                           ('required' not in vars[d]['attrspec']):
+                            vars[d]['attrspec'].append('optional')
+                    elif d not in ['*', ':']:
+                        #/----< no check
+                        if flag:
+                            if d in vars:
+                                if n not in ddeps:
+                                    vars[n]['depend'].append(d)
+                            else:
+                                vars[n]['depend'] = vars[n]['depend'] + ddeps
+            elif isstring(vars[n]):
+                length = '1'
+                if 'charselector' in vars[n]:
+                    if '*' in vars[n]['charselector']:
+                        length = _eval_length(vars[n]['charselector']['*'],
+                                              params)
+                        vars[n]['charselector']['*'] = length
+                    elif 'len' in vars[n]['charselector']:
+                        length = _eval_length(vars[n]['charselector']['len'],
+                                              params)
+                        del vars[n]['charselector']['len']
+                        vars[n]['charselector']['*'] = length
+
+            if not vars[n]['check']:
+                del vars[n]['check']
+            if flag and not vars[n]['depend']:
+                del vars[n]['depend']
+        if '=' in vars[n]:
+            if 'attrspec' not in vars[n]:
+                vars[n]['attrspec'] = []
+            if ('optional' not in vars[n]['attrspec']) and \
+               ('required' not in vars[n]['attrspec']):
+                vars[n]['attrspec'].append('optional')
+            if 'depend' not in vars[n]:
+                vars[n]['depend'] = []
+                for v, m in list(dep_matches.items()):
+                    if m(vars[n]['=']):
+                        vars[n]['depend'].append(v)
+                if not vars[n]['depend']:
+                    del vars[n]['depend']
+            if isscalar(vars[n]):
+                vars[n]['='] = _eval_scalar(vars[n]['='], params)
+
+    for n in list(vars.keys()):
+        if n == block['name']:  # n is block name
+            if 'note' in vars[n]:
+                block['note'] = vars[n]['note']
+            if block['block'] == 'function':
+                if 'result' in block and block['result'] in vars:
+                    vars[n] = appenddecl(vars[n], vars[block['result']])
+                if 'prefix' in block:
+                    pr = block['prefix']
+                    ispure = 0
+                    isrec = 1
+                    pr1 = pr.replace('pure', '')
+                    ispure = (not pr == pr1)
+                    pr = pr1.replace('recursive', '')
+                    isrec = (not pr == pr1)
+                    m = typespattern[0].match(pr)
+                    if m:
+                        typespec, selector, attr, edecl = cracktypespec0(
+                            m.group('this'), m.group('after'))
+                        kindselect, charselect, typename = cracktypespec(
+                            typespec, selector)
+                        vars[n]['typespec'] = typespec
+                        if kindselect:
+                            if 'kind' in kindselect:
+                                try:
+                                    kindselect['kind'] = eval(
+                                        kindselect['kind'], {}, params)
+                                except Exception:
+                                    pass
+                            vars[n]['kindselector'] = kindselect
+                        if charselect:
+                            vars[n]['charselector'] = charselect
+                        if typename:
+                            vars[n]['typename'] = typename
+                        if ispure:
+                            vars[n] = setattrspec(vars[n], 'pure')
+                        if isrec:
+                            vars[n] = setattrspec(vars[n], 'recursive')
+                    else:
+                        outmess(
+                            'analyzevars: prefix (%s) were not used\n' % repr(block['prefix']))
+    if not block['block'] in ['module', 'pythonmodule', 'python module', 'block data']:
+        if 'commonvars' in block:
+            neededvars = copy.copy(block['args'] + block['commonvars'])
+        else:
+            neededvars = copy.copy(block['args'])
+        for n in list(vars.keys()):
+            if l_or(isintent_callback, isintent_aux)(vars[n]):
+                neededvars.append(n)
+        if 'entry' in block:
+            neededvars.extend(list(block['entry'].keys()))
+            for k in list(block['entry'].keys()):
+                for n in block['entry'][k]:
+                    if n not in neededvars:
+                        neededvars.append(n)
+        if block['block'] == 'function':
+            if 'result' in block:
+                neededvars.append(block['result'])
+            else:
+                neededvars.append(block['name'])
+        if block['block'] in ['subroutine', 'function']:
+            name = block['name']
+            if name in vars and 'intent' in vars[name]:
+                block['intent'] = vars[name]['intent']
+        if block['block'] == 'type':
+            neededvars.extend(list(vars.keys()))
+        for n in list(vars.keys()):
+            if n not in neededvars:
+                del vars[n]
+    return vars
+
+analyzeargs_re_1 = re.compile(r'\A[a-z]+[\w$]*\Z', re.I)
+
+
+def expr2name(a, block, args=[]):
+    orig_a = a
+    a_is_expr = not analyzeargs_re_1.match(a)
+    if a_is_expr:  # `a` is an expression
+        implicitrules, attrrules = buildimplicitrules(block)
+        at = determineexprtype(a, block['vars'], implicitrules)
+        na = 'e_'
+        for c in a:
+            c = c.lower()
+            if c not in string.ascii_lowercase + string.digits:
+                c = '_'
+            na = na + c
+        if na[-1] == '_':
+            na = na + 'e'
+        else:
+            na = na + '_e'
+        a = na
+        while a in block['vars'] or a in block['args']:
+            a = a + 'r'
+    if a in args:
+        k = 1
+        while a + str(k) in args:
+            k = k + 1
+        a = a + str(k)
+    if a_is_expr:
+        block['vars'][a] = at
+    else:
+        if a not in block['vars']:
+            if orig_a in block['vars']:
+                block['vars'][a] = block['vars'][orig_a]
+            else:
+                block['vars'][a] = {}
+        if 'externals' in block and orig_a in block['externals'] + block['interfaced']:
+            block['vars'][a] = setattrspec(block['vars'][a], 'external')
+    return a
+
+
+def analyzeargs(block):
+    setmesstext(block)
+    implicitrules, attrrules = buildimplicitrules(block)
+    if 'args' not in block:
+        block['args'] = []
+    args = []
+    for a in block['args']:
+        a = expr2name(a, block, args)
+        args.append(a)
+    block['args'] = args
+    if 'entry' in block:
+        for k, args1 in list(block['entry'].items()):
+            for a in args1:
+                if a not in block['vars']:
+                    block['vars'][a] = {}
+
+    for b in block['body']:
+        if b['name'] in args:
+            if 'externals' not in block:
+                block['externals'] = []
+            if b['name'] not in block['externals']:
+                block['externals'].append(b['name'])
+    if 'result' in block and block['result'] not in block['vars']:
+        block['vars'][block['result']] = {}
+    return block
+
+determineexprtype_re_1 = re.compile(r'\A\(.+?[,].+?\)\Z', re.I)
+determineexprtype_re_2 = re.compile(r'\A[+-]?\d+(_(?P<name>[\w]+)|)\Z', re.I)
+determineexprtype_re_3 = re.compile(
+    r'\A[+-]?[\d.]+[\d+\-de.]*(_(?P<name>[\w]+)|)\Z', re.I)
+determineexprtype_re_4 = re.compile(r'\A\(.*\)\Z', re.I)
+determineexprtype_re_5 = re.compile(r'\A(?P<name>\w+)\s*\(.*?\)\s*\Z', re.I)
+
+
+def _ensure_exprdict(r):
+    if isinstance(r, int):
+        return {'typespec': 'integer'}
+    if isinstance(r, float):
+        return {'typespec': 'real'}
+    if isinstance(r, complex):
+        return {'typespec': 'complex'}
+    if isinstance(r, dict):
+        return r
+    raise AssertionError(repr(r))
+
+
+def determineexprtype(expr, vars, rules={}):
+    if expr in vars:
+        return _ensure_exprdict(vars[expr])
+    expr = expr.strip()
+    if determineexprtype_re_1.match(expr):
+        return {'typespec': 'complex'}
+    m = determineexprtype_re_2.match(expr)
+    if m:
+        if 'name' in m.groupdict() and m.group('name'):
+            outmess(
+                'determineexprtype: selected kind types not supported (%s)\n' % repr(expr))
+        return {'typespec': 'integer'}
+    m = determineexprtype_re_3.match(expr)
+    if m:
+        if 'name' in m.groupdict() and m.group('name'):
+            outmess(
+                'determineexprtype: selected kind types not supported (%s)\n' % repr(expr))
+        return {'typespec': 'real'}
+    for op in ['+', '-', '*', '/']:
+        for e in [x.strip() for x in markoutercomma(expr, comma=op).split('@' + op + '@')]:
+            if e in vars:
+                return _ensure_exprdict(vars[e])
+    t = {}
+    if determineexprtype_re_4.match(expr):  # in parenthesis
+        t = determineexprtype(expr[1:-1], vars, rules)
+    else:
+        m = determineexprtype_re_5.match(expr)
+        if m:
+            rn = m.group('name')
+            t = determineexprtype(m.group('name'), vars, rules)
+            if t and 'attrspec' in t:
+                del t['attrspec']
+            if not t:
+                if rn[0] in rules:
+                    return _ensure_exprdict(rules[rn[0]])
+    if expr[0] in '\'"':
+        return {'typespec': 'character', 'charselector': {'*': '*'}}
+    if not t:
+        outmess(
+            'determineexprtype: could not determine expressions (%s) type.\n' % (repr(expr)))
+    return t
+
+######
+
+
+def crack2fortrangen(block, tab='\n', as_interface=False):
+    global skipfuncs, onlyfuncs
+
+    setmesstext(block)
+    ret = ''
+    if isinstance(block, list):
+        for g in block:
+            if g and g['block'] in ['function', 'subroutine']:
+                if g['name'] in skipfuncs:
+                    continue
+                if onlyfuncs and g['name'] not in onlyfuncs:
+                    continue
+            ret = ret + crack2fortrangen(g, tab, as_interface=as_interface)
+        return ret
+    prefix = ''
+    name = ''
+    args = ''
+    blocktype = block['block']
+    if blocktype == 'program':
+        return ''
+    argsl = []
+    if 'name' in block:
+        name = block['name']
+    if 'args' in block:
+        vars = block['vars']
+        for a in block['args']:
+            a = expr2name(a, block, argsl)
+            if not isintent_callback(vars[a]):
+                argsl.append(a)
+        if block['block'] == 'function' or argsl:
+            args = '(%s)' % ','.join(argsl)
+    f2pyenhancements = ''
+    if 'f2pyenhancements' in block:
+        for k in list(block['f2pyenhancements'].keys()):
+            f2pyenhancements = '%s%s%s %s' % (
+                f2pyenhancements, tab + tabchar, k, block['f2pyenhancements'][k])
+    intent_lst = block.get('intent', [])[:]
+    if blocktype == 'function' and 'callback' in intent_lst:
+        intent_lst.remove('callback')
+    if intent_lst:
+        f2pyenhancements = '%s%sintent(%s) %s' %\
+                           (f2pyenhancements, tab + tabchar,
+                            ','.join(intent_lst), name)
+    use = ''
+    if 'use' in block:
+        use = use2fortran(block['use'], tab + tabchar)
+    common = ''
+    if 'common' in block:
+        common = common2fortran(block['common'], tab + tabchar)
+    if name == 'unknown_interface':
+        name = ''
+    result = ''
+    if 'result' in block:
+        result = ' result (%s)' % block['result']
+        if block['result'] not in argsl:
+            argsl.append(block['result'])
+    body = crack2fortrangen(block['body'], tab + tabchar)
+    vars = vars2fortran(
+        block, block['vars'], argsl, tab + tabchar, as_interface=as_interface)
+    mess = ''
+    if 'from' in block and not as_interface:
+        mess = '! in %s' % block['from']
+    if 'entry' in block:
+        entry_stmts = ''
+        for k, i in list(block['entry'].items()):
+            entry_stmts = '%s%sentry %s(%s)' \
+                          % (entry_stmts, tab + tabchar, k, ','.join(i))
+        body = body + entry_stmts
+    if blocktype == 'block data' and name == '_BLOCK_DATA_':
+        name = ''
+    ret = '%s%s%s %s%s%s %s%s%s%s%s%s%send %s %s' % (
+        tab, prefix, blocktype, name, args, result, mess, f2pyenhancements, use, vars, common, body, tab, blocktype, name)
+    return ret
+
+
+def common2fortran(common, tab=''):
+    ret = ''
+    for k in list(common.keys()):
+        if k == '_BLNK_':
+            ret = '%s%scommon %s' % (ret, tab, ','.join(common[k]))
+        else:
+            ret = '%s%scommon /%s/ %s' % (ret, tab, k, ','.join(common[k]))
+    return ret
+
+
+def use2fortran(use, tab=''):
+    ret = ''
+    for m in list(use.keys()):
+        ret = '%s%suse %s,' % (ret, tab, m)
+        if use[m] == {}:
+            if ret and ret[-1] == ',':
+                ret = ret[:-1]
+            continue
+        if 'only' in use[m] and use[m]['only']:
+            ret = '%s only:' % (ret)
+        if 'map' in use[m] and use[m]['map']:
+            c = ' '
+            for k in list(use[m]['map'].keys()):
+                if k == use[m]['map'][k]:
+                    ret = '%s%s%s' % (ret, c, k)
+                    c = ','
+                else:
+                    ret = '%s%s%s=>%s' % (ret, c, k, use[m]['map'][k])
+                    c = ','
+        if ret and ret[-1] == ',':
+            ret = ret[:-1]
+    return ret
+
+
+def true_intent_list(var):
+    lst = var['intent']
+    ret = []
+    for intent in lst:
+        try:
+            f = globals()['isintent_%s' % intent]
+        except KeyError:
+            pass
+        else:
+            if f(var):
+                ret.append(intent)
+    return ret
+
+
+def vars2fortran(block, vars, args, tab='', as_interface=False):
+    """
+    TODO:
+    public sub
+    ...
+    """
+    setmesstext(block)
+    ret = ''
+    nout = []
+    for a in args:
+        if a in block['vars']:
+            nout.append(a)
+    if 'commonvars' in block:
+        for a in block['commonvars']:
+            if a in vars:
+                if a not in nout:
+                    nout.append(a)
+            else:
+                errmess(
+                    'vars2fortran: Confused?!: "%s" is not defined in vars.\n' % a)
+    if 'varnames' in block:
+        nout.extend(block['varnames'])
+    if not as_interface:
+        for a in list(vars.keys()):
+            if a not in nout:
+                nout.append(a)
+    for a in nout:
+        if 'depend' in vars[a]:
+            for d in vars[a]['depend']:
+                if d in vars and 'depend' in vars[d] and a in vars[d]['depend']:
+                    errmess(
+                        'vars2fortran: Warning: cross-dependence between variables "%s" and "%s"\n' % (a, d))
+        if 'externals' in block and a in block['externals']:
+            if isintent_callback(vars[a]):
+                ret = '%s%sintent(callback) %s' % (ret, tab, a)
+            ret = '%s%sexternal %s' % (ret, tab, a)
+            if isoptional(vars[a]):
+                ret = '%s%soptional %s' % (ret, tab, a)
+            if a in vars and 'typespec' not in vars[a]:
+                continue
+            cont = 1
+            for b in block['body']:
+                if a == b['name'] and b['block'] == 'function':
+                    cont = 0
+                    break
+            if cont:
+                continue
+        if a not in vars:
+            show(vars)
+            outmess('vars2fortran: No definition for argument "%s".\n' % a)
+            continue
+        if a == block['name'] and not block['block'] == 'function':
+            continue
+        if 'typespec' not in vars[a]:
+            if 'attrspec' in vars[a] and 'external' in vars[a]['attrspec']:
+                if a in args:
+                    ret = '%s%sexternal %s' % (ret, tab, a)
+                continue
+            show(vars[a])
+            outmess('vars2fortran: No typespec for argument "%s".\n' % a)
+            continue
+        vardef = vars[a]['typespec']
+        if vardef == 'type' and 'typename' in vars[a]:
+            vardef = '%s(%s)' % (vardef, vars[a]['typename'])
+        selector = {}
+        if 'kindselector' in vars[a]:
+            selector = vars[a]['kindselector']
+        elif 'charselector' in vars[a]:
+            selector = vars[a]['charselector']
+        if '*' in selector:
+            if selector['*'] in ['*', ':']:
+                vardef = '%s*(%s)' % (vardef, selector['*'])
+            else:
+                vardef = '%s*%s' % (vardef, selector['*'])
+        else:
+            if 'len' in selector:
+                vardef = '%s(len=%s' % (vardef, selector['len'])
+                if 'kind' in selector:
+                    vardef = '%s,kind=%s)' % (vardef, selector['kind'])
+                else:
+                    vardef = '%s)' % (vardef)
+            elif 'kind' in selector:
+                vardef = '%s(kind=%s)' % (vardef, selector['kind'])
+        c = ' '
+        if 'attrspec' in vars[a]:
+            attr = [l for l in vars[a]['attrspec']
+                    if l not in ['external']]
+            if attr:
+                vardef = '%s, %s' % (vardef, ','.join(attr))
+                c = ','
+        if 'dimension' in vars[a]:
+            vardef = '%s%sdimension(%s)' % (
+                vardef, c, ','.join(vars[a]['dimension']))
+            c = ','
+        if 'intent' in vars[a]:
+            lst = true_intent_list(vars[a])
+            if lst:
+                vardef = '%s%sintent(%s)' % (vardef, c, ','.join(lst))
+            c = ','
+        if 'check' in vars[a]:
+            vardef = '%s%scheck(%s)' % (vardef, c, ','.join(vars[a]['check']))
+            c = ','
+        if 'depend' in vars[a]:
+            vardef = '%s%sdepend(%s)' % (
+                vardef, c, ','.join(vars[a]['depend']))
+            c = ','
+        if '=' in vars[a]:
+            v = vars[a]['=']
+            if vars[a]['typespec'] in ['complex', 'double complex']:
+                try:
+                    v = eval(v)
+                    v = '(%s,%s)' % (v.real, v.imag)
+                except Exception:
+                    pass
+            vardef = '%s :: %s=%s' % (vardef, a, v)
+        else:
+            vardef = '%s :: %s' % (vardef, a)
+        ret = '%s%s%s' % (ret, tab, vardef)
+    return ret
+######
+
+
+def crackfortran(files):
+    global usermodules
+
+    outmess('Reading fortran codes...\n', 0)
+    readfortrancode(files, crackline)
+    outmess('Post-processing...\n', 0)
+    usermodules = []
+    postlist = postcrack(grouplist[0])
+    outmess('Post-processing (stage 2)...\n', 0)
+    postlist = postcrack2(postlist)
+    return usermodules + postlist
+
+
+def crack2fortran(block):
+    global f2py_version
+
+    pyf = crack2fortrangen(block) + '\n'
+    header = """!    -*- f90 -*-
+! Note: the context of this file is case sensitive.
+"""
+    footer = """
+! This file was auto-generated with f2py (version:%s).
+! See http://cens.ioc.ee/projects/f2py2e/
+""" % (f2py_version)
+    return header + pyf + footer
+
+if __name__ == "__main__":
+    files = []
+    funcs = []
+    f = 1
+    f2 = 0
+    f3 = 0
+    showblocklist = 0
+    for l in sys.argv[1:]:
+        if l == '':
+            pass
+        elif l[0] == ':':
+            f = 0
+        elif l == '-quiet':
+            quiet = 1
+            verbose = 0
+        elif l == '-verbose':
+            verbose = 2
+            quiet = 0
+        elif l == '-fix':
+            if strictf77:
+                outmess(
+                    'Use option -f90 before -fix if Fortran 90 code is in fix form.\n', 0)
+            skipemptyends = 1
+            sourcecodeform = 'fix'
+        elif l == '-skipemptyends':
+            skipemptyends = 1
+        elif l == '--ignore-contains':
+            ignorecontains = 1
+        elif l == '-f77':
+            strictf77 = 1
+            sourcecodeform = 'fix'
+        elif l == '-f90':
+            strictf77 = 0
+            sourcecodeform = 'free'
+            skipemptyends = 1
+        elif l == '-h':
+            f2 = 1
+        elif l == '-show':
+            showblocklist = 1
+        elif l == '-m':
+            f3 = 1
+        elif l[0] == '-':
+            errmess('Unknown option %s\n' % repr(l))
+        elif f2:
+            f2 = 0
+            pyffilename = l
+        elif f3:
+            f3 = 0
+            f77modulename = l
+        elif f:
+            try:
+                open(l).close()
+                files.append(l)
+            except IOError as detail:
+                errmess('IOError: %s\n' % str(detail))
+        else:
+            funcs.append(l)
+    if not strictf77 and f77modulename and not skipemptyends:
+        outmess("""\
+  Warning: You have specified module name for non Fortran 77 code
+  that should not need one (expect if you are scanning F90 code
+  for non module blocks but then you should use flag -skipemptyends
+  and also be sure that the files do not contain programs without program statement).
+""", 0)
+
+    postlist = crackfortran(files)
+    if pyffilename:
+        outmess('Writing fortran code to file %s\n' % repr(pyffilename), 0)
+        pyf = crack2fortran(postlist)
+        with open(pyffilename, 'w') as f: 
+            f.write(pyf)
+    if showblocklist:
+        show(postlist)
diff --git a/venv/Lib/site-packages/numpy/f2py/diagnose.py b/venv/Lib/site-packages/numpy/f2py/diagnose.py
new file mode 100644
index 000000000..21ee399f0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/diagnose.py
@@ -0,0 +1,154 @@
+#!/usr/bin/env python3
+import os
+import sys
+import tempfile
+
+
+def run_command(cmd):
+    print('Running %r:' % (cmd))
+    os.system(cmd)
+    print('------')
+
+
+def run():
+    _path = os.getcwd()
+    os.chdir(tempfile.gettempdir())
+    print('------')
+    print('os.name=%r' % (os.name))
+    print('------')
+    print('sys.platform=%r' % (sys.platform))
+    print('------')
+    print('sys.version:')
+    print(sys.version)
+    print('------')
+    print('sys.prefix:')
+    print(sys.prefix)
+    print('------')
+    print('sys.path=%r' % (':'.join(sys.path)))
+    print('------')
+
+    try:
+        import numpy
+        has_newnumpy = 1
+    except ImportError:
+        print('Failed to import new numpy:', sys.exc_info()[1])
+        has_newnumpy = 0
+
+    try:
+        from numpy.f2py import f2py2e
+        has_f2py2e = 1
+    except ImportError:
+        print('Failed to import f2py2e:', sys.exc_info()[1])
+        has_f2py2e = 0
+
+    try:
+        import numpy.distutils
+        has_numpy_distutils = 2
+    except ImportError:
+        try:
+            import numpy_distutils
+            has_numpy_distutils = 1
+        except ImportError:
+            print('Failed to import numpy_distutils:', sys.exc_info()[1])
+            has_numpy_distutils = 0
+
+    if has_newnumpy:
+        try:
+            print('Found new numpy version %r in %s' %
+                  (numpy.__version__, numpy.__file__))
+        except Exception as msg:
+            print('error:', msg)
+            print('------')
+
+    if has_f2py2e:
+        try:
+            print('Found f2py2e version %r in %s' %
+                  (f2py2e.__version__.version, f2py2e.__file__))
+        except Exception as msg:
+            print('error:', msg)
+            print('------')
+
+    if has_numpy_distutils:
+        try:
+            if has_numpy_distutils == 2:
+                print('Found numpy.distutils version %r in %r' % (
+                    numpy.distutils.__version__,
+                    numpy.distutils.__file__))
+            else:
+                print('Found numpy_distutils version %r in %r' % (
+                    numpy_distutils.numpy_distutils_version.numpy_distutils_version,
+                    numpy_distutils.__file__))
+            print('------')
+        except Exception as msg:
+            print('error:', msg)
+            print('------')
+        try:
+            if has_numpy_distutils == 1:
+                print(
+                    'Importing numpy_distutils.command.build_flib ...', end=' ')
+                import numpy_distutils.command.build_flib as build_flib
+                print('ok')
+                print('------')
+                try:
+                    print(
+                        'Checking availability of supported Fortran compilers:')
+                    for compiler_class in build_flib.all_compilers:
+                        compiler_class(verbose=1).is_available()
+                        print('------')
+                except Exception as msg:
+                    print('error:', msg)
+                    print('------')
+        except Exception as msg:
+            print(
+                'error:', msg, '(ignore it, build_flib is obsolute for numpy.distutils 0.2.2 and up)')
+            print('------')
+        try:
+            if has_numpy_distutils == 2:
+                print('Importing numpy.distutils.fcompiler ...', end=' ')
+                import numpy.distutils.fcompiler as fcompiler
+            else:
+                print('Importing numpy_distutils.fcompiler ...', end=' ')
+                import numpy_distutils.fcompiler as fcompiler
+            print('ok')
+            print('------')
+            try:
+                print('Checking availability of supported Fortran compilers:')
+                fcompiler.show_fcompilers()
+                print('------')
+            except Exception as msg:
+                print('error:', msg)
+                print('------')
+        except Exception as msg:
+            print('error:', msg)
+            print('------')
+        try:
+            if has_numpy_distutils == 2:
+                print('Importing numpy.distutils.cpuinfo ...', end=' ')
+                from numpy.distutils.cpuinfo import cpuinfo
+                print('ok')
+                print('------')
+            else:
+                try:
+                    print(
+                        'Importing numpy_distutils.command.cpuinfo ...', end=' ')
+                    from numpy_distutils.command.cpuinfo import cpuinfo
+                    print('ok')
+                    print('------')
+                except Exception as msg:
+                    print('error:', msg, '(ignore it)')
+                    print('Importing numpy_distutils.cpuinfo ...', end=' ')
+                    from numpy_distutils.cpuinfo import cpuinfo
+                    print('ok')
+                    print('------')
+            cpu = cpuinfo()
+            print('CPU information:', end=' ')
+            for name in dir(cpuinfo):
+                if name[0] == '_' and name[1] != '_' and getattr(cpu, name[1:])():
+                    print(name[1:], end=' ')
+            print('------')
+        except Exception as msg:
+            print('error:', msg)
+            print('------')
+    os.chdir(_path)
+if __name__ == "__main__":
+    run()
diff --git a/venv/Lib/site-packages/numpy/f2py/f2py2e.py b/venv/Lib/site-packages/numpy/f2py/f2py2e.py
new file mode 100644
index 000000000..71a049e41
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/f2py2e.py
@@ -0,0 +1,694 @@
+#!/usr/bin/env python3
+"""
+
+f2py2e - Fortran to Python C/API generator. 2nd Edition.
+         See __usage__ below.
+
+Copyright 1999--2011 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@cens.ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/05/06 08:31:19 $
+Pearu Peterson
+
+"""
+import sys
+import os
+import pprint
+import re
+
+from . import crackfortran
+from . import rules
+from . import cb_rules
+from . import auxfuncs
+from . import cfuncs
+from . import f90mod_rules
+from . import __version__
+from . import capi_maps
+
+f2py_version = __version__.version
+errmess = sys.stderr.write
+# outmess=sys.stdout.write
+show = pprint.pprint
+outmess = auxfuncs.outmess
+
+try:
+    from numpy import __version__ as numpy_version
+except ImportError:
+    numpy_version = 'N/A'
+
+__usage__ = """\
+Usage:
+
+1) To construct extension module sources:
+
+      f2py [<options>] <fortran files> [[[only:]||[skip:]] \\
+                                        <fortran functions> ] \\
+                                       [: <fortran files> ...]
+
+2) To compile fortran files and build extension modules:
+
+      f2py -c [<options>, <build_flib options>, <extra options>] <fortran files>
+
+3) To generate signature files:
+
+      f2py -h <filename.pyf> ...< same options as in (1) >
+
+Description: This program generates a Python C/API file (<modulename>module.c)
+             that contains wrappers for given fortran functions so that they
+             can be called from Python. With the -c option the corresponding
+             extension modules are built.
+
+Options:
+
+  --2d-numpy       Use numpy.f2py tool with NumPy support. [DEFAULT]
+  --2d-numeric     Use f2py2e tool with Numeric support.
+  --2d-numarray    Use f2py2e tool with Numarray support.
+  --g3-numpy       Use 3rd generation f2py from the separate f2py package.
+                   [NOT AVAILABLE YET]
+
+  -h <filename>    Write signatures of the fortran routines to file <filename>
+                   and exit. You can then edit <filename> and use it instead
+                   of <fortran files>. If <filename>==stdout then the
+                   signatures are printed to stdout.
+  <fortran functions>  Names of fortran routines for which Python C/API
+                   functions will be generated. Default is all that are found
+                   in <fortran files>.
+  <fortran files>  Paths to fortran/signature files that will be scanned for
+                   <fortran functions> in order to determine their signatures.
+  skip:            Ignore fortran functions that follow until `:'.
+  only:            Use only fortran functions that follow until `:'.
+  :                Get back to <fortran files> mode.
+
+  -m <modulename>  Name of the module; f2py generates a Python/C API
+                   file <modulename>module.c or extension module <modulename>.
+                   Default is 'untitled'.
+
+  --[no-]lower     Do [not] lower the cases in <fortran files>. By default,
+                   --lower is assumed with -h key, and --no-lower without -h key.
+
+  --build-dir <dirname>  All f2py generated files are created in <dirname>.
+                   Default is tempfile.mkdtemp().
+
+  --overwrite-signature  Overwrite existing signature file.
+
+  --[no-]latex-doc Create (or not) <modulename>module.tex.
+                   Default is --no-latex-doc.
+  --short-latex    Create 'incomplete' LaTeX document (without commands
+                   \\documentclass, \\tableofcontents, and \\begin{document},
+                   \\end{document}).
+
+  --[no-]rest-doc Create (or not) <modulename>module.rst.
+                   Default is --no-rest-doc.
+
+  --debug-capi     Create C/API code that reports the state of the wrappers
+                   during runtime. Useful for debugging.
+
+  --[no-]wrap-functions    Create Fortran subroutine wrappers to Fortran 77
+                   functions. --wrap-functions is default because it ensures
+                   maximum portability/compiler independence.
+
+  --include-paths <path1>:<path2>:...   Search include files from the given
+                   directories.
+
+  --help-link [..] List system resources found by system_info.py. See also
+                   --link-<resource> switch below. [..] is optional list
+                   of resources names. E.g. try 'f2py --help-link lapack_opt'.
+
+  --f2cmap <filename>  Load Fortran-to-Python KIND specification from the given
+                   file. Default: .f2py_f2cmap in current directory.
+
+  --quiet          Run quietly.
+  --verbose        Run with extra verbosity.
+  -v               Print f2py version ID and exit.
+
+
+numpy.distutils options (only effective with -c):
+
+  --fcompiler=         Specify Fortran compiler type by vendor
+  --compiler=          Specify C compiler type (as defined by distutils)
+
+  --help-fcompiler     List available Fortran compilers and exit
+  --f77exec=           Specify the path to F77 compiler
+  --f90exec=           Specify the path to F90 compiler
+  --f77flags=          Specify F77 compiler flags
+  --f90flags=          Specify F90 compiler flags
+  --opt=               Specify optimization flags
+  --arch=              Specify architecture specific optimization flags
+  --noopt              Compile without optimization
+  --noarch             Compile without arch-dependent optimization
+  --debug              Compile with debugging information
+
+Extra options (only effective with -c):
+
+  --link-<resource>    Link extension module with <resource> as defined
+                       by numpy.distutils/system_info.py. E.g. to link
+                       with optimized LAPACK libraries (vecLib on MacOSX,
+                       ATLAS elsewhere), use --link-lapack_opt.
+                       See also --help-link switch.
+
+  -L/path/to/lib/ -l<libname>
+  -D<define> -U<name>
+  -I/path/to/include/
+  <filename>.o <filename>.so <filename>.a
+
+  Using the following macros may be required with non-gcc Fortran
+  compilers:
+    -DPREPEND_FORTRAN -DNO_APPEND_FORTRAN -DUPPERCASE_FORTRAN
+    -DUNDERSCORE_G77
+
+  When using -DF2PY_REPORT_ATEXIT, a performance report of F2PY
+  interface is printed out at exit (platforms: Linux).
+
+  When using -DF2PY_REPORT_ON_ARRAY_COPY=<int>, a message is
+  sent to stderr whenever F2PY interface makes a copy of an
+  array. Integer <int> sets the threshold for array sizes when
+  a message should be shown.
+
+Version:     %s
+numpy Version: %s
+Requires:    Python 3.5 or higher.
+License:     NumPy license (see LICENSE.txt in the NumPy source code)
+Copyright 1999 - 2011 Pearu Peterson all rights reserved.
+http://cens.ioc.ee/projects/f2py2e/""" % (f2py_version, numpy_version)
+
+
+def scaninputline(inputline):
+    files, skipfuncs, onlyfuncs, debug = [], [], [], []
+    f, f2, f3, f5, f6, f7, f8, f9, f10 = 1, 0, 0, 0, 0, 0, 0, 0, 0
+    verbose = 1
+    dolc = -1
+    dolatexdoc = 0
+    dorestdoc = 0
+    wrapfuncs = 1
+    buildpath = '.'
+    include_paths = []
+    signsfile, modulename = None, None
+    options = {'buildpath': buildpath,
+               'coutput': None,
+               'f2py_wrapper_output': None}
+    for l in inputline:
+        if l == '':
+            pass
+        elif l == 'only:':
+            f = 0
+        elif l == 'skip:':
+            f = -1
+        elif l == ':':
+            f = 1
+        elif l[:8] == '--debug-':
+            debug.append(l[8:])
+        elif l == '--lower':
+            dolc = 1
+        elif l == '--build-dir':
+            f6 = 1
+        elif l == '--no-lower':
+            dolc = 0
+        elif l == '--quiet':
+            verbose = 0
+        elif l == '--verbose':
+            verbose += 1
+        elif l == '--latex-doc':
+            dolatexdoc = 1
+        elif l == '--no-latex-doc':
+            dolatexdoc = 0
+        elif l == '--rest-doc':
+            dorestdoc = 1
+        elif l == '--no-rest-doc':
+            dorestdoc = 0
+        elif l == '--wrap-functions':
+            wrapfuncs = 1
+        elif l == '--no-wrap-functions':
+            wrapfuncs = 0
+        elif l == '--short-latex':
+            options['shortlatex'] = 1
+        elif l == '--coutput':
+            f8 = 1
+        elif l == '--f2py-wrapper-output':
+            f9 = 1
+        elif l == '--f2cmap':
+            f10 = 1
+        elif l == '--overwrite-signature':
+            options['h-overwrite'] = 1
+        elif l == '-h':
+            f2 = 1
+        elif l == '-m':
+            f3 = 1
+        elif l[:2] == '-v':
+            print(f2py_version)
+            sys.exit()
+        elif l == '--show-compilers':
+            f5 = 1
+        elif l[:8] == '-include':
+            cfuncs.outneeds['userincludes'].append(l[9:-1])
+            cfuncs.userincludes[l[9:-1]] = '#include ' + l[8:]
+        elif l[:15] in '--include_paths':
+            outmess(
+                'f2py option --include_paths is deprecated, use --include-paths instead.\n')
+            f7 = 1
+        elif l[:15] in '--include-paths':
+            f7 = 1
+        elif l[0] == '-':
+            errmess('Unknown option %s\n' % repr(l))
+            sys.exit()
+        elif f2:
+            f2 = 0
+            signsfile = l
+        elif f3:
+            f3 = 0
+            modulename = l
+        elif f6:
+            f6 = 0
+            buildpath = l
+        elif f7:
+            f7 = 0
+            include_paths.extend(l.split(os.pathsep))
+        elif f8:
+            f8 = 0
+            options["coutput"] = l
+        elif f9:
+            f9 = 0
+            options["f2py_wrapper_output"] = l
+        elif f10:
+            f10 = 0
+            options["f2cmap_file"] = l
+        elif f == 1:
+            try:
+                with open(l):
+                    pass
+                files.append(l)
+            except IOError as detail:
+                errmess('IOError: %s. Skipping file "%s".\n' %
+                        (str(detail), l))
+        elif f == -1:
+            skipfuncs.append(l)
+        elif f == 0:
+            onlyfuncs.append(l)
+    if not f5 and not files and not modulename:
+        print(__usage__)
+        sys.exit()
+    if not os.path.isdir(buildpath):
+        if not verbose:
+            outmess('Creating build directory %s' % (buildpath))
+        os.mkdir(buildpath)
+    if signsfile:
+        signsfile = os.path.join(buildpath, signsfile)
+    if signsfile and os.path.isfile(signsfile) and 'h-overwrite' not in options:
+        errmess(
+            'Signature file "%s" exists!!! Use --overwrite-signature to overwrite.\n' % (signsfile))
+        sys.exit()
+
+    options['debug'] = debug
+    options['verbose'] = verbose
+    if dolc == -1 and not signsfile:
+        options['do-lower'] = 0
+    else:
+        options['do-lower'] = dolc
+    if modulename:
+        options['module'] = modulename
+    if signsfile:
+        options['signsfile'] = signsfile
+    if onlyfuncs:
+        options['onlyfuncs'] = onlyfuncs
+    if skipfuncs:
+        options['skipfuncs'] = skipfuncs
+    options['dolatexdoc'] = dolatexdoc
+    options['dorestdoc'] = dorestdoc
+    options['wrapfuncs'] = wrapfuncs
+    options['buildpath'] = buildpath
+    options['include_paths'] = include_paths
+    options.setdefault('f2cmap_file', None)
+    return files, options
+
+
+def callcrackfortran(files, options):
+    rules.options = options
+    crackfortran.debug = options['debug']
+    crackfortran.verbose = options['verbose']
+    if 'module' in options:
+        crackfortran.f77modulename = options['module']
+    if 'skipfuncs' in options:
+        crackfortran.skipfuncs = options['skipfuncs']
+    if 'onlyfuncs' in options:
+        crackfortran.onlyfuncs = options['onlyfuncs']
+    crackfortran.include_paths[:] = options['include_paths']
+    crackfortran.dolowercase = options['do-lower']
+    postlist = crackfortran.crackfortran(files)
+    if 'signsfile' in options:
+        outmess('Saving signatures to file "%s"\n' % (options['signsfile']))
+        pyf = crackfortran.crack2fortran(postlist)
+        if options['signsfile'][-6:] == 'stdout':
+            sys.stdout.write(pyf)
+        else:
+            with open(options['signsfile'], 'w') as f:
+                f.write(pyf)
+    if options["coutput"] is None:
+        for mod in postlist:
+            mod["coutput"] = "%smodule.c" % mod["name"]
+    else:
+        for mod in postlist:
+            mod["coutput"] = options["coutput"]
+    if options["f2py_wrapper_output"] is None:
+        for mod in postlist:
+            mod["f2py_wrapper_output"] = "%s-f2pywrappers.f" % mod["name"]
+    else:
+        for mod in postlist:
+            mod["f2py_wrapper_output"] = options["f2py_wrapper_output"]
+    return postlist
+
+
+def buildmodules(lst):
+    cfuncs.buildcfuncs()
+    outmess('Building modules...\n')
+    modules, mnames, isusedby = [], [], {}
+    for i in range(len(lst)):
+        if '__user__' in lst[i]['name']:
+            cb_rules.buildcallbacks(lst[i])
+        else:
+            if 'use' in lst[i]:
+                for u in lst[i]['use'].keys():
+                    if u not in isusedby:
+                        isusedby[u] = []
+                    isusedby[u].append(lst[i]['name'])
+            modules.append(lst[i])
+            mnames.append(lst[i]['name'])
+    ret = {}
+    for i in range(len(mnames)):
+        if mnames[i] in isusedby:
+            outmess('\tSkipping module "%s" which is used by %s.\n' % (
+                mnames[i], ','.join(['"%s"' % s for s in isusedby[mnames[i]]])))
+        else:
+            um = []
+            if 'use' in modules[i]:
+                for u in modules[i]['use'].keys():
+                    if u in isusedby and u in mnames:
+                        um.append(modules[mnames.index(u)])
+                    else:
+                        outmess(
+                            '\tModule "%s" uses nonexisting "%s" which will be ignored.\n' % (mnames[i], u))
+            ret[mnames[i]] = {}
+            dict_append(ret[mnames[i]], rules.buildmodule(modules[i], um))
+    return ret
+
+
+def dict_append(d_out, d_in):
+    for (k, v) in d_in.items():
+        if k not in d_out:
+            d_out[k] = []
+        if isinstance(v, list):
+            d_out[k] = d_out[k] + v
+        else:
+            d_out[k].append(v)
+
+
+def run_main(comline_list):
+    """
+    Equivalent to running::
+
+        f2py <args>
+
+    where ``<args>=string.join(<list>,' ')``, but in Python.  Unless
+    ``-h`` is used, this function returns a dictionary containing
+    information on generated modules and their dependencies on source
+    files.  For example, the command ``f2py -m scalar scalar.f`` can be
+    executed from Python as follows
+
+    You cannot build extension modules with this function, that is,
+    using ``-c`` is not allowed. Use ``compile`` command instead
+
+    Examples
+    --------
+    .. include:: run_main_session.dat
+        :literal:
+
+    """
+    crackfortran.reset_global_f2py_vars()
+    f2pydir = os.path.dirname(os.path.abspath(cfuncs.__file__))
+    fobjhsrc = os.path.join(f2pydir, 'src', 'fortranobject.h')
+    fobjcsrc = os.path.join(f2pydir, 'src', 'fortranobject.c')
+    files, options = scaninputline(comline_list)
+    auxfuncs.options = options
+    capi_maps.load_f2cmap_file(options['f2cmap_file'])
+    postlist = callcrackfortran(files, options)
+    isusedby = {}
+    for i in range(len(postlist)):
+        if 'use' in postlist[i]:
+            for u in postlist[i]['use'].keys():
+                if u not in isusedby:
+                    isusedby[u] = []
+                isusedby[u].append(postlist[i]['name'])
+    for i in range(len(postlist)):
+        if postlist[i]['block'] == 'python module' and '__user__' in postlist[i]['name']:
+            if postlist[i]['name'] in isusedby:
+                # if not quiet:
+                outmess('Skipping Makefile build for module "%s" which is used by %s\n' % (
+                    postlist[i]['name'], ','.join(['"%s"' % s for s in isusedby[postlist[i]['name']]])))
+    if 'signsfile' in options:
+        if options['verbose'] > 1:
+            outmess(
+                'Stopping. Edit the signature file and then run f2py on the signature file: ')
+            outmess('%s %s\n' %
+                    (os.path.basename(sys.argv[0]), options['signsfile']))
+        return
+    for i in range(len(postlist)):
+        if postlist[i]['block'] != 'python module':
+            if 'python module' not in options:
+                errmess(
+                    'Tip: If your original code is Fortran source then you must use -m option.\n')
+            raise TypeError('All blocks must be python module blocks but got %s' % (
+                repr(postlist[i]['block'])))
+    auxfuncs.debugoptions = options['debug']
+    f90mod_rules.options = options
+    auxfuncs.wrapfuncs = options['wrapfuncs']
+
+    ret = buildmodules(postlist)
+
+    for mn in ret.keys():
+        dict_append(ret[mn], {'csrc': fobjcsrc, 'h': fobjhsrc})
+    return ret
+
+
+def filter_files(prefix, suffix, files, remove_prefix=None):
+    """
+    Filter files by prefix and suffix.
+    """
+    filtered, rest = [], []
+    match = re.compile(prefix + r'.*' + suffix + r'\Z').match
+    if remove_prefix:
+        ind = len(prefix)
+    else:
+        ind = 0
+    for file in [x.strip() for x in files]:
+        if match(file):
+            filtered.append(file[ind:])
+        else:
+            rest.append(file)
+    return filtered, rest
+
+
+def get_prefix(module):
+    p = os.path.dirname(os.path.dirname(module.__file__))
+    return p
+
+
+def run_compile():
+    """
+    Do it all in one call!
+    """
+    import tempfile
+
+    i = sys.argv.index('-c')
+    del sys.argv[i]
+
+    remove_build_dir = 0
+    try:
+        i = sys.argv.index('--build-dir')
+    except ValueError:
+        i = None
+    if i is not None:
+        build_dir = sys.argv[i + 1]
+        del sys.argv[i + 1]
+        del sys.argv[i]
+    else:
+        remove_build_dir = 1
+        build_dir = tempfile.mkdtemp()
+
+    _reg1 = re.compile(r'[-][-]link[-]')
+    sysinfo_flags = [_m for _m in sys.argv[1:] if _reg1.match(_m)]
+    sys.argv = [_m for _m in sys.argv if _m not in sysinfo_flags]
+    if sysinfo_flags:
+        sysinfo_flags = [f[7:] for f in sysinfo_flags]
+
+    _reg2 = re.compile(
+        r'[-][-]((no[-]|)(wrap[-]functions|lower)|debug[-]capi|quiet)|[-]include')
+    f2py_flags = [_m for _m in sys.argv[1:] if _reg2.match(_m)]
+    sys.argv = [_m for _m in sys.argv if _m not in f2py_flags]
+    f2py_flags2 = []
+    fl = 0
+    for a in sys.argv[1:]:
+        if a in ['only:', 'skip:']:
+            fl = 1
+        elif a == ':':
+            fl = 0
+        if fl or a == ':':
+            f2py_flags2.append(a)
+    if f2py_flags2 and f2py_flags2[-1] != ':':
+        f2py_flags2.append(':')
+    f2py_flags.extend(f2py_flags2)
+
+    sys.argv = [_m for _m in sys.argv if _m not in f2py_flags2]
+    _reg3 = re.compile(
+        r'[-][-]((f(90)?compiler([-]exec|)|compiler)=|help[-]compiler)')
+    flib_flags = [_m for _m in sys.argv[1:] if _reg3.match(_m)]
+    sys.argv = [_m for _m in sys.argv if _m not in flib_flags]
+    _reg4 = re.compile(
+        r'[-][-]((f(77|90)(flags|exec)|opt|arch)=|(debug|noopt|noarch|help[-]fcompiler))')
+    fc_flags = [_m for _m in sys.argv[1:] if _reg4.match(_m)]
+    sys.argv = [_m for _m in sys.argv if _m not in fc_flags]
+
+    if 1:
+        del_list = []
+        for s in flib_flags:
+            v = '--fcompiler='
+            if s[:len(v)] == v:
+                from numpy.distutils import fcompiler
+                fcompiler.load_all_fcompiler_classes()
+                allowed_keys = list(fcompiler.fcompiler_class.keys())
+                nv = ov = s[len(v):].lower()
+                if ov not in allowed_keys:
+                    vmap = {}  # XXX
+                    try:
+                        nv = vmap[ov]
+                    except KeyError:
+                        if ov not in vmap.values():
+                            print('Unknown vendor: "%s"' % (s[len(v):]))
+                    nv = ov
+                i = flib_flags.index(s)
+                flib_flags[i] = '--fcompiler=' + nv
+                continue
+        for s in del_list:
+            i = flib_flags.index(s)
+            del flib_flags[i]
+        assert len(flib_flags) <= 2, repr(flib_flags)
+
+    _reg5 = re.compile(r'[-][-](verbose)')
+    setup_flags = [_m for _m in sys.argv[1:] if _reg5.match(_m)]
+    sys.argv = [_m for _m in sys.argv if _m not in setup_flags]
+
+    if '--quiet' in f2py_flags:
+        setup_flags.append('--quiet')
+
+    modulename = 'untitled'
+    sources = sys.argv[1:]
+
+    for optname in ['--include_paths', '--include-paths', '--f2cmap']:
+        if optname in sys.argv:
+            i = sys.argv.index(optname)
+            f2py_flags.extend(sys.argv[i:i + 2])
+            del sys.argv[i + 1], sys.argv[i]
+            sources = sys.argv[1:]
+
+    if '-m' in sys.argv:
+        i = sys.argv.index('-m')
+        modulename = sys.argv[i + 1]
+        del sys.argv[i + 1], sys.argv[i]
+        sources = sys.argv[1:]
+    else:
+        from numpy.distutils.command.build_src import get_f2py_modulename
+        pyf_files, sources = filter_files('', '[.]pyf([.]src|)', sources)
+        sources = pyf_files + sources
+        for f in pyf_files:
+            modulename = get_f2py_modulename(f)
+            if modulename:
+                break
+
+    extra_objects, sources = filter_files('', '[.](o|a|so)', sources)
+    include_dirs, sources = filter_files('-I', '', sources, remove_prefix=1)
+    library_dirs, sources = filter_files('-L', '', sources, remove_prefix=1)
+    libraries, sources = filter_files('-l', '', sources, remove_prefix=1)
+    undef_macros, sources = filter_files('-U', '', sources, remove_prefix=1)
+    define_macros, sources = filter_files('-D', '', sources, remove_prefix=1)
+    for i in range(len(define_macros)):
+        name_value = define_macros[i].split('=', 1)
+        if len(name_value) == 1:
+            name_value.append(None)
+        if len(name_value) == 2:
+            define_macros[i] = tuple(name_value)
+        else:
+            print('Invalid use of -D:', name_value)
+
+    from numpy.distutils.system_info import get_info
+
+    num_info = {}
+    if num_info:
+        include_dirs.extend(num_info.get('include_dirs', []))
+
+    from numpy.distutils.core import setup, Extension
+    ext_args = {'name': modulename, 'sources': sources,
+                'include_dirs': include_dirs,
+                'library_dirs': library_dirs,
+                'libraries': libraries,
+                'define_macros': define_macros,
+                'undef_macros': undef_macros,
+                'extra_objects': extra_objects,
+                'f2py_options': f2py_flags,
+                }
+
+    if sysinfo_flags:
+        from numpy.distutils.misc_util import dict_append
+        for n in sysinfo_flags:
+            i = get_info(n)
+            if not i:
+                outmess('No %s resources found in system'
+                        ' (try `f2py --help-link`)\n' % (repr(n)))
+            dict_append(ext_args, **i)
+
+    ext = Extension(**ext_args)
+    sys.argv = [sys.argv[0]] + setup_flags
+    sys.argv.extend(['build',
+                     '--build-temp', build_dir,
+                     '--build-base', build_dir,
+                     '--build-platlib', '.'])
+    if fc_flags:
+        sys.argv.extend(['config_fc'] + fc_flags)
+    if flib_flags:
+        sys.argv.extend(['build_ext'] + flib_flags)
+
+    setup(ext_modules=[ext])
+
+    if remove_build_dir and os.path.exists(build_dir):
+        import shutil
+        outmess('Removing build directory %s\n' % (build_dir))
+        shutil.rmtree(build_dir)
+
+
+def main():
+    if '--help-link' in sys.argv[1:]:
+        sys.argv.remove('--help-link')
+        from numpy.distutils.system_info import show_all
+        show_all()
+        return
+
+    # Probably outdated options that were not working before 1.16
+    if '--g3-numpy' in sys.argv[1:]:
+        sys.stderr.write("G3 f2py support is not implemented, yet.\\n")
+        sys.exit(1)
+    elif '--2e-numeric' in sys.argv[1:]:
+        sys.argv.remove('--2e-numeric')
+    elif '--2e-numarray' in sys.argv[1:]:
+        # Note that this errors becaust the -DNUMARRAY argument is
+        # not recognized. Just here for back compatibility and the
+        # error message.
+        sys.argv.append("-DNUMARRAY")
+        sys.argv.remove('--2e-numarray')
+    elif '--2e-numpy' in sys.argv[1:]:
+        sys.argv.remove('--2e-numpy')
+    else:
+        pass
+
+    if '-c' in sys.argv[1:]:
+        run_compile()
+    else:
+        run_main(sys.argv[1:])
diff --git a/venv/Lib/site-packages/numpy/f2py/f2py_testing.py b/venv/Lib/site-packages/numpy/f2py/f2py_testing.py
new file mode 100644
index 000000000..1f109e67a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/f2py_testing.py
@@ -0,0 +1,46 @@
+import sys
+import re
+
+from numpy.testing import jiffies, memusage
+
+
+def cmdline():
+    m = re.compile(r'\A\d+\Z')
+    args = []
+    repeat = 1
+    for a in sys.argv[1:]:
+        if m.match(a):
+            repeat = eval(a)
+        else:
+            args.append(a)
+    f2py_opts = ' '.join(args)
+    return repeat, f2py_opts
+
+
+def run(runtest, test_functions, repeat=1):
+    l = [(t, repr(t.__doc__.split('\n')[1].strip())) for t in test_functions]
+    start_memusage = memusage()
+    diff_memusage = None
+    start_jiffies = jiffies()
+    i = 0
+    while i < repeat:
+        i += 1
+        for t, fname in l:
+            runtest(t)
+            if start_memusage is None:
+                continue
+            if diff_memusage is None:
+                diff_memusage = memusage() - start_memusage
+            else:
+                diff_memusage2 = memusage() - start_memusage
+                if diff_memusage2 != diff_memusage:
+                    print('memory usage change at step %i:' % i,
+                          diff_memusage2 - diff_memusage,
+                          fname)
+                    diff_memusage = diff_memusage2
+    current_memusage = memusage()
+    print('run', repeat * len(test_functions), 'tests',
+          'in %.2f seconds' % ((jiffies() - start_jiffies) / 100.0))
+    if start_memusage:
+        print('initial virtual memory size:', start_memusage, 'bytes')
+        print('current virtual memory size:', current_memusage, 'bytes')
diff --git a/venv/Lib/site-packages/numpy/f2py/f90mod_rules.py b/venv/Lib/site-packages/numpy/f2py/f90mod_rules.py
new file mode 100644
index 000000000..122fa8939
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/f90mod_rules.py
@@ -0,0 +1,269 @@
+#!/usr/bin/env python3
+"""
+
+Build F90 module support for f2py2e.
+
+Copyright 2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/02/03 19:30:23 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.27 $"[10:-1]
+
+f2py_version = 'See `f2py -v`'
+
+import numpy as np
+
+from . import capi_maps
+from . import func2subr
+from .crackfortran import undo_rmbadname, undo_rmbadname1
+
+# The environment provided by auxfuncs.py is needed for some calls to eval.
+# As the needed functions cannot be determined by static inspection of the
+# code, it is safest to use import * pending a major refactoring of f2py.
+from .auxfuncs import *
+
+options = {}
+
+
+def findf90modules(m):
+    if ismodule(m):
+        return [m]
+    if not hasbody(m):
+        return []
+    ret = []
+    for b in m['body']:
+        if ismodule(b):
+            ret.append(b)
+        else:
+            ret = ret + findf90modules(b)
+    return ret
+
+fgetdims1 = """\
+      external f2pysetdata
+      logical ns
+      integer r,i
+      integer(%d) s(*)
+      ns = .FALSE.
+      if (allocated(d)) then
+         do i=1,r
+            if ((size(d,i).ne.s(i)).and.(s(i).ge.0)) then
+               ns = .TRUE.
+            end if
+         end do
+         if (ns) then
+            deallocate(d)
+         end if
+      end if
+      if ((.not.allocated(d)).and.(s(1).ge.1)) then""" % np.intp().itemsize
+
+fgetdims2 = """\
+      end if
+      if (allocated(d)) then
+         do i=1,r
+            s(i) = size(d,i)
+         end do
+      end if
+      flag = 1
+      call f2pysetdata(d,allocated(d))"""
+
+fgetdims2_sa = """\
+      end if
+      if (allocated(d)) then
+         do i=1,r
+            s(i) = size(d,i)
+         end do
+         !s(r) must be equal to len(d(1))
+      end if
+      flag = 2
+      call f2pysetdata(d,allocated(d))"""
+
+
+def buildhooks(pymod):
+    from . import rules
+    ret = {'f90modhooks': [], 'initf90modhooks': [], 'body': [],
+           'need': ['F_FUNC', 'arrayobject.h'],
+           'separatorsfor': {'includes0': '\n', 'includes': '\n'},
+           'docs': ['"Fortran 90/95 modules:\\n"'],
+           'latexdoc': []}
+    fhooks = ['']
+
+    def fadd(line, s=fhooks):
+        s[0] = '%s\n      %s' % (s[0], line)
+    doc = ['']
+
+    def dadd(line, s=doc):
+        s[0] = '%s\n%s' % (s[0], line)
+    for m in findf90modules(pymod):
+        sargs, fargs, efargs, modobjs, notvars, onlyvars = [], [], [], [], [
+            m['name']], []
+        sargsp = []
+        ifargs = []
+        mfargs = []
+        if hasbody(m):
+            for b in m['body']:
+                notvars.append(b['name'])
+        for n in m['vars'].keys():
+            var = m['vars'][n]
+            if (n not in notvars) and (not l_or(isintent_hide, isprivate)(var)):
+                onlyvars.append(n)
+                mfargs.append(n)
+        outmess('\t\tConstructing F90 module support for "%s"...\n' %
+                (m['name']))
+        if onlyvars:
+            outmess('\t\t  Variables: %s\n' % (' '.join(onlyvars)))
+        chooks = ['']
+
+        def cadd(line, s=chooks):
+            s[0] = '%s\n%s' % (s[0], line)
+        ihooks = ['']
+
+        def iadd(line, s=ihooks):
+            s[0] = '%s\n%s' % (s[0], line)
+
+        vrd = capi_maps.modsign2map(m)
+        cadd('static FortranDataDef f2py_%s_def[] = {' % (m['name']))
+        dadd('\\subsection{Fortran 90/95 module \\texttt{%s}}\n' % (m['name']))
+        if hasnote(m):
+            note = m['note']
+            if isinstance(note, list):
+                note = '\n'.join(note)
+            dadd(note)
+        if onlyvars:
+            dadd('\\begin{description}')
+        for n in onlyvars:
+            var = m['vars'][n]
+            modobjs.append(n)
+            ct = capi_maps.getctype(var)
+            at = capi_maps.c2capi_map[ct]
+            dm = capi_maps.getarrdims(n, var)
+            dms = dm['dims'].replace('*', '-1').strip()
+            dms = dms.replace(':', '-1').strip()
+            if not dms:
+                dms = '-1'
+            use_fgetdims2 = fgetdims2
+            if isstringarray(var):
+                if 'charselector' in var and 'len' in var['charselector']:
+                    cadd('\t{"%s",%s,{{%s,%s}},%s},'
+                         % (undo_rmbadname1(n), dm['rank'], dms, var['charselector']['len'], at))
+                    use_fgetdims2 = fgetdims2_sa
+                else:
+                    cadd('\t{"%s",%s,{{%s}},%s},' %
+                         (undo_rmbadname1(n), dm['rank'], dms, at))
+            else:
+                cadd('\t{"%s",%s,{{%s}},%s},' %
+                     (undo_rmbadname1(n), dm['rank'], dms, at))
+            dadd('\\item[]{{}\\verb@%s@{}}' %
+                 (capi_maps.getarrdocsign(n, var)))
+            if hasnote(var):
+                note = var['note']
+                if isinstance(note, list):
+                    note = '\n'.join(note)
+                dadd('--- %s' % (note))
+            if isallocatable(var):
+                fargs.append('f2py_%s_getdims_%s' % (m['name'], n))
+                efargs.append(fargs[-1])
+                sargs.append(
+                    'void (*%s)(int*,int*,void(*)(char*,int*),int*)' % (n))
+                sargsp.append('void (*)(int*,int*,void(*)(char*,int*),int*)')
+                iadd('\tf2py_%s_def[i_f2py++].func = %s;' % (m['name'], n))
+                fadd('subroutine %s(r,s,f2pysetdata,flag)' % (fargs[-1]))
+                fadd('use %s, only: d => %s\n' %
+                     (m['name'], undo_rmbadname1(n)))
+                fadd('integer flag\n')
+                fhooks[0] = fhooks[0] + fgetdims1
+                dms = range(1, int(dm['rank']) + 1)
+                fadd(' allocate(d(%s))\n' %
+                     (','.join(['s(%s)' % i for i in dms])))
+                fhooks[0] = fhooks[0] + use_fgetdims2
+                fadd('end subroutine %s' % (fargs[-1]))
+            else:
+                fargs.append(n)
+                sargs.append('char *%s' % (n))
+                sargsp.append('char*')
+                iadd('\tf2py_%s_def[i_f2py++].data = %s;' % (m['name'], n))
+        if onlyvars:
+            dadd('\\end{description}')
+        if hasbody(m):
+            for b in m['body']:
+                if not isroutine(b):
+                    print('Skipping', b['block'], b['name'])
+                    continue
+                modobjs.append('%s()' % (b['name']))
+                b['modulename'] = m['name']
+                api, wrap = rules.buildapi(b)
+                if isfunction(b):
+                    fhooks[0] = fhooks[0] + wrap
+                    fargs.append('f2pywrap_%s_%s' % (m['name'], b['name']))
+                    ifargs.append(func2subr.createfuncwrapper(b, signature=1))
+                else:
+                    if wrap:
+                        fhooks[0] = fhooks[0] + wrap
+                        fargs.append('f2pywrap_%s_%s' % (m['name'], b['name']))
+                        ifargs.append(
+                            func2subr.createsubrwrapper(b, signature=1))
+                    else:
+                        fargs.append(b['name'])
+                        mfargs.append(fargs[-1])
+                api['externroutines'] = []
+                ar = applyrules(api, vrd)
+                ar['docs'] = []
+                ar['docshort'] = []
+                ret = dictappend(ret, ar)
+                cadd('\t{"%s",-1,{{-1}},0,NULL,(void *)f2py_rout_#modulename#_%s_%s,doc_f2py_rout_#modulename#_%s_%s},' %
+                     (b['name'], m['name'], b['name'], m['name'], b['name']))
+                sargs.append('char *%s' % (b['name']))
+                sargsp.append('char *')
+                iadd('\tf2py_%s_def[i_f2py++].data = %s;' %
+                     (m['name'], b['name']))
+        cadd('\t{NULL}\n};\n')
+        iadd('}')
+        ihooks[0] = 'static void f2py_setup_%s(%s) {\n\tint i_f2py=0;%s' % (
+            m['name'], ','.join(sargs), ihooks[0])
+        if '_' in m['name']:
+            F_FUNC = 'F_FUNC_US'
+        else:
+            F_FUNC = 'F_FUNC'
+        iadd('extern void %s(f2pyinit%s,F2PYINIT%s)(void (*)(%s));'
+             % (F_FUNC, m['name'], m['name'].upper(), ','.join(sargsp)))
+        iadd('static void f2py_init_%s(void) {' % (m['name']))
+        iadd('\t%s(f2pyinit%s,F2PYINIT%s)(f2py_setup_%s);'
+             % (F_FUNC, m['name'], m['name'].upper(), m['name']))
+        iadd('}\n')
+        ret['f90modhooks'] = ret['f90modhooks'] + chooks + ihooks
+        ret['initf90modhooks'] = ['\tPyDict_SetItemString(d, "%s", PyFortranObject_New(f2py_%s_def,f2py_init_%s));' % (
+            m['name'], m['name'], m['name'])] + ret['initf90modhooks']
+        fadd('')
+        fadd('subroutine f2pyinit%s(f2pysetupfunc)' % (m['name']))
+        if mfargs:
+            for a in undo_rmbadname(mfargs):
+                fadd('use %s, only : %s' % (m['name'], a))
+        if ifargs:
+            fadd(' '.join(['interface'] + ifargs))
+            fadd('end interface')
+        fadd('external f2pysetupfunc')
+        if efargs:
+            for a in undo_rmbadname(efargs):
+                fadd('external %s' % (a))
+        fadd('call f2pysetupfunc(%s)' % (','.join(undo_rmbadname(fargs))))
+        fadd('end subroutine f2pyinit%s\n' % (m['name']))
+
+        dadd('\n'.join(ret['latexdoc']).replace(
+            r'\subsection{', r'\subsubsection{'))
+
+        ret['latexdoc'] = []
+        ret['docs'].append('"\t%s --- %s"' % (m['name'],
+                                              ','.join(undo_rmbadname(modobjs))))
+
+    ret['routine_defs'] = ''
+    ret['doc'] = []
+    ret['docshort'] = []
+    ret['latexdoc'] = doc[0]
+    if len(ret['docs']) <= 1:
+        ret['docs'] = ''
+    return ret, fhooks[0]
diff --git a/venv/Lib/site-packages/numpy/f2py/func2subr.py b/venv/Lib/site-packages/numpy/f2py/func2subr.py
new file mode 100644
index 000000000..e9976f43c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/func2subr.py
@@ -0,0 +1,297 @@
+#!/usr/bin/env python3
+"""
+
+Rules for building C/API module with f2py2e.
+
+Copyright 1999,2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2004/11/26 11:13:06 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.16 $"[10:-1]
+
+f2py_version = 'See `f2py -v`'
+
+import copy
+
+from .auxfuncs import (
+    getfortranname, isexternal, isfunction, isfunction_wrap, isintent_in,
+    isintent_out, islogicalfunction, ismoduleroutine, isscalar,
+    issubroutine, issubroutine_wrap, outmess, show
+)
+
+
+def var2fixfortran(vars, a, fa=None, f90mode=None):
+    if fa is None:
+        fa = a
+    if a not in vars:
+        show(vars)
+        outmess('var2fixfortran: No definition for argument "%s".\n' % a)
+        return ''
+    if 'typespec' not in vars[a]:
+        show(vars[a])
+        outmess('var2fixfortran: No typespec for argument "%s".\n' % a)
+        return ''
+    vardef = vars[a]['typespec']
+    if vardef == 'type' and 'typename' in vars[a]:
+        vardef = '%s(%s)' % (vardef, vars[a]['typename'])
+    selector = {}
+    lk = ''
+    if 'kindselector' in vars[a]:
+        selector = vars[a]['kindselector']
+        lk = 'kind'
+    elif 'charselector' in vars[a]:
+        selector = vars[a]['charselector']
+        lk = 'len'
+    if '*' in selector:
+        if f90mode:
+            if selector['*'] in ['*', ':', '(*)']:
+                vardef = '%s(len=*)' % (vardef)
+            else:
+                vardef = '%s(%s=%s)' % (vardef, lk, selector['*'])
+        else:
+            if selector['*'] in ['*', ':']:
+                vardef = '%s*(%s)' % (vardef, selector['*'])
+            else:
+                vardef = '%s*%s' % (vardef, selector['*'])
+    else:
+        if 'len' in selector:
+            vardef = '%s(len=%s' % (vardef, selector['len'])
+            if 'kind' in selector:
+                vardef = '%s,kind=%s)' % (vardef, selector['kind'])
+            else:
+                vardef = '%s)' % (vardef)
+        elif 'kind' in selector:
+            vardef = '%s(kind=%s)' % (vardef, selector['kind'])
+
+    vardef = '%s %s' % (vardef, fa)
+    if 'dimension' in vars[a]:
+        vardef = '%s(%s)' % (vardef, ','.join(vars[a]['dimension']))
+    return vardef
+
+
+def createfuncwrapper(rout, signature=0):
+    assert isfunction(rout)
+
+    extra_args = []
+    vars = rout['vars']
+    for a in rout['args']:
+        v = rout['vars'][a]
+        for i, d in enumerate(v.get('dimension', [])):
+            if d == ':':
+                dn = 'f2py_%s_d%s' % (a, i)
+                dv = dict(typespec='integer', intent=['hide'])
+                dv['='] = 'shape(%s, %s)' % (a, i)
+                extra_args.append(dn)
+                vars[dn] = dv
+                v['dimension'][i] = dn
+    rout['args'].extend(extra_args)
+    need_interface = bool(extra_args)
+
+    ret = ['']
+
+    def add(line, ret=ret):
+        ret[0] = '%s\n      %s' % (ret[0], line)
+    name = rout['name']
+    fortranname = getfortranname(rout)
+    f90mode = ismoduleroutine(rout)
+    newname = '%sf2pywrap' % (name)
+
+    if newname not in vars:
+        vars[newname] = vars[name]
+        args = [newname] + rout['args'][1:]
+    else:
+        args = [newname] + rout['args']
+
+    l = var2fixfortran(vars, name, newname, f90mode)
+    if l[:13] == 'character*(*)':
+        if f90mode:
+            l = 'character(len=10)' + l[13:]
+        else:
+            l = 'character*10' + l[13:]
+        charselect = vars[name]['charselector']
+        if charselect.get('*', '') == '(*)':
+            charselect['*'] = '10'
+    sargs = ', '.join(args)
+    if f90mode:
+        add('subroutine f2pywrap_%s_%s (%s)' %
+            (rout['modulename'], name, sargs))
+        if not signature:
+            add('use %s, only : %s' % (rout['modulename'], fortranname))
+    else:
+        add('subroutine f2pywrap%s (%s)' % (name, sargs))
+        if not need_interface:
+            add('external %s' % (fortranname))
+            l = l + ', ' + fortranname
+    if need_interface:
+        for line in rout['saved_interface'].split('\n'):
+            if line.lstrip().startswith('use '):
+                add(line)
+
+    args = args[1:]
+    dumped_args = []
+    for a in args:
+        if isexternal(vars[a]):
+            add('external %s' % (a))
+            dumped_args.append(a)
+    for a in args:
+        if a in dumped_args:
+            continue
+        if isscalar(vars[a]):
+            add(var2fixfortran(vars, a, f90mode=f90mode))
+            dumped_args.append(a)
+    for a in args:
+        if a in dumped_args:
+            continue
+        if isintent_in(vars[a]):
+            add(var2fixfortran(vars, a, f90mode=f90mode))
+            dumped_args.append(a)
+    for a in args:
+        if a in dumped_args:
+            continue
+        add(var2fixfortran(vars, a, f90mode=f90mode))
+
+    add(l)
+
+    if need_interface:
+        if f90mode:
+            # f90 module already defines needed interface
+            pass
+        else:
+            add('interface')
+            add(rout['saved_interface'].lstrip())
+            add('end interface')
+
+    sargs = ', '.join([a for a in args if a not in extra_args])
+
+    if not signature:
+        if islogicalfunction(rout):
+            add('%s = .not.(.not.%s(%s))' % (newname, fortranname, sargs))
+        else:
+            add('%s = %s(%s)' % (newname, fortranname, sargs))
+    if f90mode:
+        add('end subroutine f2pywrap_%s_%s' % (rout['modulename'], name))
+    else:
+        add('end')
+    return ret[0]
+
+
+def createsubrwrapper(rout, signature=0):
+    assert issubroutine(rout)
+
+    extra_args = []
+    vars = rout['vars']
+    for a in rout['args']:
+        v = rout['vars'][a]
+        for i, d in enumerate(v.get('dimension', [])):
+            if d == ':':
+                dn = 'f2py_%s_d%s' % (a, i)
+                dv = dict(typespec='integer', intent=['hide'])
+                dv['='] = 'shape(%s, %s)' % (a, i)
+                extra_args.append(dn)
+                vars[dn] = dv
+                v['dimension'][i] = dn
+    rout['args'].extend(extra_args)
+    need_interface = bool(extra_args)
+
+    ret = ['']
+
+    def add(line, ret=ret):
+        ret[0] = '%s\n      %s' % (ret[0], line)
+    name = rout['name']
+    fortranname = getfortranname(rout)
+    f90mode = ismoduleroutine(rout)
+
+    args = rout['args']
+
+    sargs = ', '.join(args)
+    if f90mode:
+        add('subroutine f2pywrap_%s_%s (%s)' %
+            (rout['modulename'], name, sargs))
+        if not signature:
+            add('use %s, only : %s' % (rout['modulename'], fortranname))
+    else:
+        add('subroutine f2pywrap%s (%s)' % (name, sargs))
+        if not need_interface:
+            add('external %s' % (fortranname))
+
+    if need_interface:
+        for line in rout['saved_interface'].split('\n'):
+            if line.lstrip().startswith('use '):
+                add(line)
+
+    dumped_args = []
+    for a in args:
+        if isexternal(vars[a]):
+            add('external %s' % (a))
+            dumped_args.append(a)
+    for a in args:
+        if a in dumped_args:
+            continue
+        if isscalar(vars[a]):
+            add(var2fixfortran(vars, a, f90mode=f90mode))
+            dumped_args.append(a)
+    for a in args:
+        if a in dumped_args:
+            continue
+        add(var2fixfortran(vars, a, f90mode=f90mode))
+
+    if need_interface:
+        if f90mode:
+            # f90 module already defines needed interface
+            pass
+        else:
+            add('interface')
+            add(rout['saved_interface'].lstrip())
+            add('end interface')
+
+    sargs = ', '.join([a for a in args if a not in extra_args])
+
+    if not signature:
+        add('call %s(%s)' % (fortranname, sargs))
+    if f90mode:
+        add('end subroutine f2pywrap_%s_%s' % (rout['modulename'], name))
+    else:
+        add('end')
+    return ret[0]
+
+
+def assubr(rout):
+    if isfunction_wrap(rout):
+        fortranname = getfortranname(rout)
+        name = rout['name']
+        outmess('\t\tCreating wrapper for Fortran function "%s"("%s")...\n' % (
+            name, fortranname))
+        rout = copy.copy(rout)
+        fname = name
+        rname = fname
+        if 'result' in rout:
+            rname = rout['result']
+            rout['vars'][fname] = rout['vars'][rname]
+        fvar = rout['vars'][fname]
+        if not isintent_out(fvar):
+            if 'intent' not in fvar:
+                fvar['intent'] = []
+            fvar['intent'].append('out')
+            flag = 1
+            for i in fvar['intent']:
+                if i.startswith('out='):
+                    flag = 0
+                    break
+            if flag:
+                fvar['intent'].append('out=%s' % (rname))
+        rout['args'][:] = [fname] + rout['args']
+        return rout, createfuncwrapper(rout)
+    if issubroutine_wrap(rout):
+        fortranname = getfortranname(rout)
+        name = rout['name']
+        outmess('\t\tCreating wrapper for Fortran subroutine "%s"("%s")...\n' % (
+            name, fortranname))
+        rout = copy.copy(rout)
+        return rout, createsubrwrapper(rout)
+    return rout, ''
diff --git a/venv/Lib/site-packages/numpy/f2py/rules.py b/venv/Lib/site-packages/numpy/f2py/rules.py
new file mode 100644
index 000000000..ecfc71ae3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/rules.py
@@ -0,0 +1,1455 @@
+#!/usr/bin/env python3
+"""
+
+Rules for building C/API module with f2py2e.
+
+Here is a skeleton of a new wrapper function (13Dec2001):
+
+wrapper_function(args)
+  declarations
+  get_python_arguments, say, `a' and `b'
+
+  get_a_from_python
+  if (successful) {
+
+    get_b_from_python
+    if (successful) {
+
+      callfortran
+      if (successful) {
+
+        put_a_to_python
+        if (successful) {
+
+          put_b_to_python
+          if (successful) {
+
+            buildvalue = ...
+
+          }
+
+        }
+
+      }
+
+    }
+    cleanup_b
+
+  }
+  cleanup_a
+
+  return buildvalue
+
+Copyright 1999,2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2005/08/30 08:58:42 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.129 $"[10:-1]
+
+from . import __version__
+f2py_version = __version__.version
+
+import os
+import time
+import copy
+
+from .auxfuncs import (
+    applyrules, debugcapi, dictappend, errmess, gentitle, getargs2,
+    hascallstatement, hasexternals, hasinitvalue, hasnote, hasresultnote,
+    isarray, isarrayofstrings, iscomplex, iscomplexarray,
+    iscomplexfunction, iscomplexfunction_warn, isdummyroutine, isexternal,
+    isfunction, isfunction_wrap, isint1array, isintent_aux, isintent_c,
+    isintent_callback, isintent_copy, isintent_hide, isintent_inout,
+    isintent_nothide, isintent_out, isintent_overwrite, islogical,
+    islong_complex, islong_double, islong_doublefunction, islong_long,
+    islong_longfunction, ismoduleroutine, isoptional, isrequired, isscalar,
+    issigned_long_longarray, isstring, isstringarray, isstringfunction,
+    issubroutine, issubroutine_wrap, isthreadsafe, isunsigned,
+    isunsigned_char, isunsigned_chararray, isunsigned_long_long,
+    isunsigned_long_longarray, isunsigned_short, isunsigned_shortarray,
+    l_and, l_not, l_or, outmess, replace, stripcomma,
+)
+
+from . import capi_maps
+from . import cfuncs
+from . import common_rules
+from . import use_rules
+from . import f90mod_rules
+from . import func2subr
+
+options = {}
+sepdict = {}
+#for k in ['need_cfuncs']: sepdict[k]=','
+for k in ['decl',
+          'frompyobj',
+          'cleanupfrompyobj',
+          'topyarr', 'method',
+          'pyobjfrom', 'closepyobjfrom',
+          'freemem',
+          'userincludes',
+          'includes0', 'includes', 'typedefs', 'typedefs_generated',
+          'cppmacros', 'cfuncs', 'callbacks',
+          'latexdoc',
+          'restdoc',
+          'routine_defs', 'externroutines',
+          'initf2pywraphooks',
+          'commonhooks', 'initcommonhooks',
+          'f90modhooks', 'initf90modhooks']:
+    sepdict[k] = '\n'
+
+#################### Rules for C/API module #################
+
+generationtime = int(os.environ.get('SOURCE_DATE_EPOCH', time.time()))
+module_rules = {
+    'modulebody': """\
+/* File: #modulename#module.c
+ * This file is auto-generated with f2py (version:#f2py_version#).
+ * f2py is a Fortran to Python Interface Generator (FPIG), Second Edition,
+ * written by Pearu Peterson <pearu@cens.ioc.ee>.
+ * Generation date: """ + time.asctime(time.gmtime(generationtime)) + """
+ * Do not edit this file directly unless you know what you are doing!!!
+ */
+
+#ifdef __cplusplus
+extern \"C\" {
+#endif
+
+""" + gentitle("See f2py2e/cfuncs.py: includes") + """
+#includes#
+#includes0#
+
+""" + gentitle("See f2py2e/rules.py: mod_rules['modulebody']") + """
+static PyObject *#modulename#_error;
+static PyObject *#modulename#_module;
+
+""" + gentitle("See f2py2e/cfuncs.py: typedefs") + """
+#typedefs#
+
+""" + gentitle("See f2py2e/cfuncs.py: typedefs_generated") + """
+#typedefs_generated#
+
+""" + gentitle("See f2py2e/cfuncs.py: cppmacros") + """
+#cppmacros#
+
+""" + gentitle("See f2py2e/cfuncs.py: cfuncs") + """
+#cfuncs#
+
+""" + gentitle("See f2py2e/cfuncs.py: userincludes") + """
+#userincludes#
+
+""" + gentitle("See f2py2e/capi_rules.py: usercode") + """
+#usercode#
+
+/* See f2py2e/rules.py */
+#externroutines#
+
+""" + gentitle("See f2py2e/capi_rules.py: usercode1") + """
+#usercode1#
+
+""" + gentitle("See f2py2e/cb_rules.py: buildcallback") + """
+#callbacks#
+
+""" + gentitle("See f2py2e/rules.py: buildapi") + """
+#body#
+
+""" + gentitle("See f2py2e/f90mod_rules.py: buildhooks") + """
+#f90modhooks#
+
+""" + gentitle("See f2py2e/rules.py: module_rules['modulebody']") + """
+
+""" + gentitle("See f2py2e/common_rules.py: buildhooks") + """
+#commonhooks#
+
+""" + gentitle("See f2py2e/rules.py") + """
+
+static FortranDataDef f2py_routine_defs[] = {
+#routine_defs#
+\t{NULL}
+};
+
+static PyMethodDef f2py_module_methods[] = {
+#pymethoddef#
+\t{NULL,NULL}
+};
+
+static struct PyModuleDef moduledef = {
+\tPyModuleDef_HEAD_INIT,
+\t"#modulename#",
+\tNULL,
+\t-1,
+\tf2py_module_methods,
+\tNULL,
+\tNULL,
+\tNULL,
+\tNULL
+};
+
+PyMODINIT_FUNC PyInit_#modulename#(void) {
+\tint i;
+\tPyObject *m,*d, *s, *tmp;
+\tm = #modulename#_module = PyModule_Create(&moduledef);
+\tPy_SET_TYPE(&PyFortran_Type, &PyType_Type);
+\timport_array();
+\tif (PyErr_Occurred())
+\t\t{PyErr_SetString(PyExc_ImportError, \"can't initialize module #modulename# (failed to import numpy)\"); return m;}
+\td = PyModule_GetDict(m);
+\ts = PyString_FromString(\"$R""" + """evision: $\");
+\tPyDict_SetItemString(d, \"__version__\", s);
+\tPy_DECREF(s);
+\ts = PyUnicode_FromString(
+\t\t\"This module '#modulename#' is auto-generated with f2py (version:#f2py_version#).\\nFunctions:\\n\"\n#docs#\".\");
+\tPyDict_SetItemString(d, \"__doc__\", s);
+\tPy_DECREF(s);
+\t#modulename#_error = PyErr_NewException (\"#modulename#.error\", NULL, NULL);
+\t/*
+\t * Store the error object inside the dict, so that it could get deallocated.
+\t * (in practice, this is a module, so it likely will not and cannot.)
+\t */
+\tPyDict_SetItemString(d, \"_#modulename#_error\", #modulename#_error);
+\tPy_DECREF(#modulename#_error);
+\tfor(i=0;f2py_routine_defs[i].name!=NULL;i++) {
+\t\ttmp = PyFortranObject_NewAsAttr(&f2py_routine_defs[i]);
+\t\tPyDict_SetItemString(d, f2py_routine_defs[i].name, tmp);
+\t\tPy_DECREF(tmp);
+\t}
+#initf2pywraphooks#
+#initf90modhooks#
+#initcommonhooks#
+#interface_usercode#
+
+#ifdef F2PY_REPORT_ATEXIT
+\tif (! PyErr_Occurred())
+\t\ton_exit(f2py_report_on_exit,(void*)\"#modulename#\");
+#endif
+\treturn m;
+}
+#ifdef __cplusplus
+}
+#endif
+""",
+    'separatorsfor': {'latexdoc': '\n\n',
+                      'restdoc': '\n\n'},
+    'latexdoc': ['\\section{Module \\texttt{#texmodulename#}}\n',
+                 '#modnote#\n',
+                 '#latexdoc#'],
+    'restdoc': ['Module #modulename#\n' + '=' * 80,
+                '\n#restdoc#']
+}
+
+defmod_rules = [
+    {'body': '/*eof body*/',
+     'method': '/*eof method*/',
+     'externroutines': '/*eof externroutines*/',
+     'routine_defs': '/*eof routine_defs*/',
+     'initf90modhooks': '/*eof initf90modhooks*/',
+     'initf2pywraphooks': '/*eof initf2pywraphooks*/',
+     'initcommonhooks': '/*eof initcommonhooks*/',
+     'latexdoc': '',
+     'restdoc': '',
+     'modnote': {hasnote: '#note#', l_not(hasnote): ''},
+     }
+]
+
+routine_rules = {
+    'separatorsfor': sepdict,
+    'body': """
+#begintitle#
+static char doc_#apiname#[] = \"\\\n#docreturn##name#(#docsignatureshort#)\\n\\nWrapper for ``#name#``.\\\n\\n#docstrsigns#\";
+/* #declfortranroutine# */
+static PyObject *#apiname#(const PyObject *capi_self,
+                           PyObject *capi_args,
+                           PyObject *capi_keywds,
+                           #functype# (*f2py_func)(#callprotoargument#)) {
+\tPyObject * volatile capi_buildvalue = NULL;
+\tvolatile int f2py_success = 1;
+#decl#
+\tstatic char *capi_kwlist[] = {#kwlist##kwlistopt##kwlistxa#NULL};
+#usercode#
+#routdebugenter#
+#ifdef F2PY_REPORT_ATEXIT
+f2py_start_clock();
+#endif
+\tif (!PyArg_ParseTupleAndKeywords(capi_args,capi_keywds,\\
+\t\t\"#argformat#|#keyformat##xaformat#:#pyname#\",\\
+\t\tcapi_kwlist#args_capi##keys_capi##keys_xa#))\n\t\treturn NULL;
+#frompyobj#
+/*end of frompyobj*/
+#ifdef F2PY_REPORT_ATEXIT
+f2py_start_call_clock();
+#endif
+#callfortranroutine#
+if (PyErr_Occurred())
+  f2py_success = 0;
+#ifdef F2PY_REPORT_ATEXIT
+f2py_stop_call_clock();
+#endif
+/*end of callfortranroutine*/
+\t\tif (f2py_success) {
+#pyobjfrom#
+/*end of pyobjfrom*/
+\t\tCFUNCSMESS(\"Building return value.\\n\");
+\t\tcapi_buildvalue = Py_BuildValue(\"#returnformat#\"#return#);
+/*closepyobjfrom*/
+#closepyobjfrom#
+\t\t} /*if (f2py_success) after callfortranroutine*/
+/*cleanupfrompyobj*/
+#cleanupfrompyobj#
+\tif (capi_buildvalue == NULL) {
+#routdebugfailure#
+\t} else {
+#routdebugleave#
+\t}
+\tCFUNCSMESS(\"Freeing memory.\\n\");
+#freemem#
+#ifdef F2PY_REPORT_ATEXIT
+f2py_stop_clock();
+#endif
+\treturn capi_buildvalue;
+}
+#endtitle#
+""",
+    'routine_defs': '#routine_def#',
+    'initf2pywraphooks': '#initf2pywraphook#',
+    'externroutines': '#declfortranroutine#',
+    'doc': '#docreturn##name#(#docsignature#)',
+    'docshort': '#docreturn##name#(#docsignatureshort#)',
+    'docs': '"\t#docreturn##name#(#docsignature#)\\n"\n',
+    'need': ['arrayobject.h', 'CFUNCSMESS', 'MINMAX'],
+    'cppmacros': {debugcapi: '#define DEBUGCFUNCS'},
+    'latexdoc': ['\\subsection{Wrapper function \\texttt{#texname#}}\n',
+                 """
+\\noindent{{}\\verb@#docreturn##name#@{}}\\texttt{(#latexdocsignatureshort#)}
+#routnote#
+
+#latexdocstrsigns#
+"""],
+    'restdoc': ['Wrapped function ``#name#``\n' + '-' * 80,
+
+                ]
+}
+
+################## Rules for C/API function ##############
+
+rout_rules = [
+    {  # Init
+        'separatorsfor': {'callfortranroutine': '\n', 'routdebugenter': '\n', 'decl': '\n',
+                          'routdebugleave': '\n', 'routdebugfailure': '\n',
+                          'setjmpbuf': ' || ',
+                          'docstrreq': '\n', 'docstropt': '\n', 'docstrout': '\n',
+                          'docstrcbs': '\n', 'docstrsigns': '\\n"\n"',
+                          'latexdocstrsigns': '\n',
+                          'latexdocstrreq': '\n', 'latexdocstropt': '\n',
+                          'latexdocstrout': '\n', 'latexdocstrcbs': '\n',
+                          },
+        'kwlist': '', 'kwlistopt': '', 'callfortran': '', 'callfortranappend': '',
+        'docsign': '', 'docsignopt': '', 'decl': '/*decl*/',
+        'freemem': '/*freemem*/',
+        'docsignshort': '', 'docsignoptshort': '',
+        'docstrsigns': '', 'latexdocstrsigns': '',
+        'docstrreq': '\\nParameters\\n----------',
+        'docstropt': '\\nOther Parameters\\n----------------',
+        'docstrout': '\\nReturns\\n-------',
+        'docstrcbs': '\\nNotes\\n-----\\nCall-back functions::\\n',
+        'latexdocstrreq': '\\noindent Required arguments:',
+        'latexdocstropt': '\\noindent Optional arguments:',
+        'latexdocstrout': '\\noindent Return objects:',
+        'latexdocstrcbs': '\\noindent Call-back functions:',
+        'args_capi': '', 'keys_capi': '', 'functype': '',
+        'frompyobj': '/*frompyobj*/',
+        # this list will be reversed
+        'cleanupfrompyobj': ['/*end of cleanupfrompyobj*/'],
+        'pyobjfrom': '/*pyobjfrom*/',
+        # this list will be reversed
+        'closepyobjfrom': ['/*end of closepyobjfrom*/'],
+        'topyarr': '/*topyarr*/', 'routdebugleave': '/*routdebugleave*/',
+        'routdebugenter': '/*routdebugenter*/',
+        'routdebugfailure': '/*routdebugfailure*/',
+        'callfortranroutine': '/*callfortranroutine*/',
+        'argformat': '', 'keyformat': '', 'need_cfuncs': '',
+        'docreturn': '', 'return': '', 'returnformat': '', 'rformat': '',
+        'kwlistxa': '', 'keys_xa': '', 'xaformat': '', 'docsignxa': '', 'docsignxashort': '',
+        'initf2pywraphook': '',
+        'routnote': {hasnote: '--- #note#', l_not(hasnote): ''},
+    }, {
+        'apiname': 'f2py_rout_#modulename#_#name#',
+        'pyname': '#modulename#.#name#',
+        'decl': '',
+        '_check': l_not(ismoduleroutine)
+    }, {
+        'apiname': 'f2py_rout_#modulename#_#f90modulename#_#name#',
+        'pyname': '#modulename#.#f90modulename#.#name#',
+        'decl': '',
+        '_check': ismoduleroutine
+    }, {  # Subroutine
+        'functype': 'void',
+        'declfortranroutine': {l_and(l_not(l_or(ismoduleroutine, isintent_c)), l_not(isdummyroutine)): 'extern void #F_FUNC#(#fortranname#,#FORTRANNAME#)(#callprotoargument#);',
+                               l_and(l_not(ismoduleroutine), isintent_c, l_not(isdummyroutine)): 'extern void #fortranname#(#callprotoargument#);',
+                               ismoduleroutine: '',
+                               isdummyroutine: ''
+                               },
+        'routine_def': {l_not(l_or(ismoduleroutine, isintent_c, isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#F_FUNC#(#fortranname#,#FORTRANNAME#),(f2py_init_func)#apiname#,doc_#apiname#},',
+                        l_and(l_not(ismoduleroutine), isintent_c, l_not(isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#fortranname#,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        l_and(l_not(ismoduleroutine), isdummyroutine): '\t{\"#name#\",-1,{{-1}},0,NULL,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        },
+        'need': {l_and(l_not(l_or(ismoduleroutine, isintent_c)), l_not(isdummyroutine)): 'F_FUNC'},
+        'callfortranroutine': [
+            {debugcapi: [
+                """\tfprintf(stderr,\"debug-capi:Fortran subroutine `#fortranname#(#callfortran#)\'\\n\");"""]},
+            {hasexternals: """\
+\t\tif (#setjmpbuf#) {
+\t\t\tf2py_success = 0;
+\t\t} else {"""},
+            {isthreadsafe: '\t\t\tPy_BEGIN_ALLOW_THREADS'},
+            {hascallstatement: '''\t\t\t\t#callstatement#;
+\t\t\t\t/*(*f2py_func)(#callfortran#);*/'''},
+            {l_not(l_or(hascallstatement, isdummyroutine))
+                   : '\t\t\t\t(*f2py_func)(#callfortran#);'},
+            {isthreadsafe: '\t\t\tPy_END_ALLOW_THREADS'},
+            {hasexternals: """\t\t}"""}
+        ],
+        '_check': l_and(issubroutine, l_not(issubroutine_wrap)),
+    }, {  # Wrapped function
+        'functype': 'void',
+        'declfortranroutine': {l_not(l_or(ismoduleroutine, isdummyroutine)): 'extern void #F_WRAPPEDFUNC#(#name_lower#,#NAME#)(#callprotoargument#);',
+                               isdummyroutine: '',
+                               },
+
+        'routine_def': {l_not(l_or(ismoduleroutine, isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#F_WRAPPEDFUNC#(#name_lower#,#NAME#),(f2py_init_func)#apiname#,doc_#apiname#},',
+                        isdummyroutine: '\t{\"#name#\",-1,{{-1}},0,NULL,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        },
+        'initf2pywraphook': {l_not(l_or(ismoduleroutine, isdummyroutine)): '''
+    {
+      extern #ctype# #F_FUNC#(#name_lower#,#NAME#)(void);
+      PyObject* o = PyDict_GetItemString(d,"#name#");
+      tmp = F2PyCapsule_FromVoidPtr((void*)#F_FUNC#(#name_lower#,#NAME#),NULL);
+      PyObject_SetAttrString(o,"_cpointer", tmp);
+      Py_DECREF(tmp);
+      s = PyUnicode_FromString("#name#");
+      PyObject_SetAttrString(o,"__name__", s);
+      Py_DECREF(s);
+    }
+    '''},
+        'need': {l_not(l_or(ismoduleroutine, isdummyroutine)): ['F_WRAPPEDFUNC', 'F_FUNC']},
+        'callfortranroutine': [
+            {debugcapi: [
+                """\tfprintf(stderr,\"debug-capi:Fortran subroutine `f2pywrap#name_lower#(#callfortran#)\'\\n\");"""]},
+            {hasexternals: """\
+\tif (#setjmpbuf#) {
+\t\tf2py_success = 0;
+\t} else {"""},
+            {isthreadsafe: '\tPy_BEGIN_ALLOW_THREADS'},
+            {l_not(l_or(hascallstatement, isdummyroutine))
+                   : '\t(*f2py_func)(#callfortran#);'},
+            {hascallstatement:
+                '\t#callstatement#;\n\t/*(*f2py_func)(#callfortran#);*/'},
+            {isthreadsafe: '\tPy_END_ALLOW_THREADS'},
+            {hasexternals: '\t}'}
+        ],
+        '_check': isfunction_wrap,
+    }, {  # Wrapped subroutine
+        'functype': 'void',
+        'declfortranroutine': {l_not(l_or(ismoduleroutine, isdummyroutine)): 'extern void #F_WRAPPEDFUNC#(#name_lower#,#NAME#)(#callprotoargument#);',
+                               isdummyroutine: '',
+                               },
+
+        'routine_def': {l_not(l_or(ismoduleroutine, isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#F_WRAPPEDFUNC#(#name_lower#,#NAME#),(f2py_init_func)#apiname#,doc_#apiname#},',
+                        isdummyroutine: '\t{\"#name#\",-1,{{-1}},0,NULL,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        },
+        'initf2pywraphook': {l_not(l_or(ismoduleroutine, isdummyroutine)): '''
+    {
+      extern void #F_FUNC#(#name_lower#,#NAME#)(void);
+      PyObject* o = PyDict_GetItemString(d,"#name#");
+      tmp = F2PyCapsule_FromVoidPtr((void*)#F_FUNC#(#name_lower#,#NAME#),NULL);
+      PyObject_SetAttrString(o,"_cpointer", tmp);
+      Py_DECREF(tmp);
+      s = PyUnicode_FromString("#name#");
+      PyObject_SetAttrString(o,"__name__", s);
+      Py_DECREF(s);
+    }
+    '''},
+        'need': {l_not(l_or(ismoduleroutine, isdummyroutine)): ['F_WRAPPEDFUNC', 'F_FUNC']},
+        'callfortranroutine': [
+            {debugcapi: [
+                """\tfprintf(stderr,\"debug-capi:Fortran subroutine `f2pywrap#name_lower#(#callfortran#)\'\\n\");"""]},
+            {hasexternals: """\
+\tif (#setjmpbuf#) {
+\t\tf2py_success = 0;
+\t} else {"""},
+            {isthreadsafe: '\tPy_BEGIN_ALLOW_THREADS'},
+            {l_not(l_or(hascallstatement, isdummyroutine))
+                   : '\t(*f2py_func)(#callfortran#);'},
+            {hascallstatement:
+                '\t#callstatement#;\n\t/*(*f2py_func)(#callfortran#);*/'},
+            {isthreadsafe: '\tPy_END_ALLOW_THREADS'},
+            {hasexternals: '\t}'}
+        ],
+        '_check': issubroutine_wrap,
+    }, {  # Function
+        'functype': '#ctype#',
+        'docreturn': {l_not(isintent_hide): '#rname#,'},
+        'docstrout': '#pydocsignout#',
+        'latexdocstrout': ['\\item[]{{}\\verb@#pydocsignout#@{}}',
+                           {hasresultnote: '--- #resultnote#'}],
+        'callfortranroutine': [{l_and(debugcapi, isstringfunction): """\
+#ifdef USESCOMPAQFORTRAN
+\tfprintf(stderr,\"debug-capi:Fortran function #ctype# #fortranname#(#callcompaqfortran#)\\n\");
+#else
+\tfprintf(stderr,\"debug-capi:Fortran function #ctype# #fortranname#(#callfortran#)\\n\");
+#endif
+"""},
+                               {l_and(debugcapi, l_not(isstringfunction)): """\
+\tfprintf(stderr,\"debug-capi:Fortran function #ctype# #fortranname#(#callfortran#)\\n\");
+"""}
+                               ],
+        '_check': l_and(isfunction, l_not(isfunction_wrap))
+    }, {  # Scalar function
+        'declfortranroutine': {l_and(l_not(l_or(ismoduleroutine, isintent_c)), l_not(isdummyroutine)): 'extern #ctype# #F_FUNC#(#fortranname#,#FORTRANNAME#)(#callprotoargument#);',
+                               l_and(l_not(ismoduleroutine), isintent_c, l_not(isdummyroutine)): 'extern #ctype# #fortranname#(#callprotoargument#);',
+                               isdummyroutine: ''
+                               },
+        'routine_def': {l_and(l_not(l_or(ismoduleroutine, isintent_c)), l_not(isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#F_FUNC#(#fortranname#,#FORTRANNAME#),(f2py_init_func)#apiname#,doc_#apiname#},',
+                        l_and(l_not(ismoduleroutine), isintent_c, l_not(isdummyroutine)): '\t{\"#name#\",-1,{{-1}},0,(char *)#fortranname#,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        isdummyroutine: '\t{\"#name#\",-1,{{-1}},0,NULL,(f2py_init_func)#apiname#,doc_#apiname#},',
+                        },
+        'decl': [{iscomplexfunction_warn: '\t#ctype# #name#_return_value={0,0};',
+                  l_not(iscomplexfunction): '\t#ctype# #name#_return_value=0;'},
+                 {iscomplexfunction:
+                  '\tPyObject *#name#_return_value_capi = Py_None;'}
+                 ],
+        'callfortranroutine': [
+            {hasexternals: """\
+\tif (#setjmpbuf#) {
+\t\tf2py_success = 0;
+\t} else {"""},
+            {isthreadsafe: '\tPy_BEGIN_ALLOW_THREADS'},
+            {hascallstatement: '''\t#callstatement#;
+/*\t#name#_return_value = (*f2py_func)(#callfortran#);*/
+'''},
+            {l_not(l_or(hascallstatement, isdummyroutine))
+                   : '\t#name#_return_value = (*f2py_func)(#callfortran#);'},
+            {isthreadsafe: '\tPy_END_ALLOW_THREADS'},
+            {hasexternals: '\t}'},
+            {l_and(debugcapi, iscomplexfunction)
+                   : '\tfprintf(stderr,"#routdebugshowvalue#\\n",#name#_return_value.r,#name#_return_value.i);'},
+            {l_and(debugcapi, l_not(iscomplexfunction)): '\tfprintf(stderr,"#routdebugshowvalue#\\n",#name#_return_value);'}],
+        'pyobjfrom': {iscomplexfunction: '\t#name#_return_value_capi = pyobj_from_#ctype#1(#name#_return_value);'},
+        'need': [{l_not(isdummyroutine): 'F_FUNC'},
+                 {iscomplexfunction: 'pyobj_from_#ctype#1'},
+                 {islong_longfunction: 'long_long'},
+                 {islong_doublefunction: 'long_double'}],
+        'returnformat': {l_not(isintent_hide): '#rformat#'},
+        'return': {iscomplexfunction: ',#name#_return_value_capi',
+                   l_not(l_or(iscomplexfunction, isintent_hide)): ',#name#_return_value'},
+        '_check': l_and(isfunction, l_not(isstringfunction), l_not(isfunction_wrap))
+    }, {  # String function # in use for --no-wrap
+        'declfortranroutine': 'extern void #F_FUNC#(#fortranname#,#FORTRANNAME#)(#callprotoargument#);',
+        'routine_def': {l_not(l_or(ismoduleroutine, isintent_c)):
+                        '\t{\"#name#\",-1,{{-1}},0,(char *)#F_FUNC#(#fortranname#,#FORTRANNAME#),(f2py_init_func)#apiname#,doc_#apiname#},',
+                        l_and(l_not(ismoduleroutine), isintent_c):
+                        '\t{\"#name#\",-1,{{-1}},0,(char *)#fortranname#,(f2py_init_func)#apiname#,doc_#apiname#},'
+                        },
+        'decl': ['\t#ctype# #name#_return_value = NULL;',
+                 '\tint #name#_return_value_len = 0;'],
+        'callfortran':'#name#_return_value,#name#_return_value_len,',
+        'callfortranroutine':['\t#name#_return_value_len = #rlength#;',
+                              '\tif ((#name#_return_value = (string)malloc(sizeof(char)*(#name#_return_value_len+1))) == NULL) {',
+                              '\t\tPyErr_SetString(PyExc_MemoryError, \"out of memory\");',
+                              '\t\tf2py_success = 0;',
+                              '\t} else {',
+                              "\t\t(#name#_return_value)[#name#_return_value_len] = '\\0';",
+                              '\t}',
+                              '\tif (f2py_success) {',
+                              {hasexternals: """\
+\t\tif (#setjmpbuf#) {
+\t\t\tf2py_success = 0;
+\t\t} else {"""},
+                              {isthreadsafe: '\t\tPy_BEGIN_ALLOW_THREADS'},
+                              """\
+#ifdef USESCOMPAQFORTRAN
+\t\t(*f2py_func)(#callcompaqfortran#);
+#else
+\t\t(*f2py_func)(#callfortran#);
+#endif
+""",
+                              {isthreadsafe: '\t\tPy_END_ALLOW_THREADS'},
+                              {hasexternals: '\t\t}'},
+                              {debugcapi:
+                                  '\t\tfprintf(stderr,"#routdebugshowvalue#\\n",#name#_return_value_len,#name#_return_value);'},
+                              '\t} /* if (f2py_success) after (string)malloc */',
+                              ],
+        'returnformat': '#rformat#',
+        'return': ',#name#_return_value',
+        'freemem': '\tSTRINGFREE(#name#_return_value);',
+        'need': ['F_FUNC', '#ctype#', 'STRINGFREE'],
+        '_check':l_and(isstringfunction, l_not(isfunction_wrap))  # ???obsolete
+    },
+    {  # Debugging
+        'routdebugenter': '\tfprintf(stderr,"debug-capi:Python C/API function #modulename#.#name#(#docsignature#)\\n");',
+        'routdebugleave': '\tfprintf(stderr,"debug-capi:Python C/API function #modulename#.#name#: successful.\\n");',
+        'routdebugfailure': '\tfprintf(stderr,"debug-capi:Python C/API function #modulename#.#name#: failure.\\n");',
+        '_check': debugcapi
+    }
+]
+
+################ Rules for arguments ##################
+
+typedef_need_dict = {islong_long: 'long_long',
+                     islong_double: 'long_double',
+                     islong_complex: 'complex_long_double',
+                     isunsigned_char: 'unsigned_char',
+                     isunsigned_short: 'unsigned_short',
+                     isunsigned: 'unsigned',
+                     isunsigned_long_long: 'unsigned_long_long',
+                     isunsigned_chararray: 'unsigned_char',
+                     isunsigned_shortarray: 'unsigned_short',
+                     isunsigned_long_longarray: 'unsigned_long_long',
+                     issigned_long_longarray: 'long_long',
+                     }
+
+aux_rules = [
+    {
+        'separatorsfor': sepdict
+    },
+    {  # Common
+        'frompyobj': ['\t/* Processing auxiliary variable #varname# */',
+                      {debugcapi: '\tfprintf(stderr,"#vardebuginfo#\\n");'}, ],
+        'cleanupfrompyobj': '\t/* End of cleaning variable #varname# */',
+        'need': typedef_need_dict,
+    },
+    # Scalars (not complex)
+    {  # Common
+        'decl': '\t#ctype# #varname# = 0;',
+        'need': {hasinitvalue: 'math.h'},
+        'frompyobj': {hasinitvalue: '\t#varname# = #init#;'},
+        '_check': l_and(isscalar, l_not(iscomplex)),
+    },
+    {
+        'return': ',#varname#',
+        'docstrout': '#pydocsignout#',
+        'docreturn': '#outvarname#,',
+        'returnformat': '#varrformat#',
+        '_check': l_and(isscalar, l_not(iscomplex), isintent_out),
+    },
+    # Complex scalars
+    {  # Common
+        'decl': '\t#ctype# #varname#;',
+        'frompyobj': {hasinitvalue: '\t#varname#.r = #init.r#, #varname#.i = #init.i#;'},
+        '_check': iscomplex
+    },
+    # String
+    {  # Common
+        'decl': ['\t#ctype# #varname# = NULL;',
+                 '\tint slen(#varname#);',
+                 ],
+        'need':['len..'],
+        '_check':isstring
+    },
+    # Array
+    {  # Common
+        'decl': ['\t#ctype# *#varname# = NULL;',
+                 '\tnpy_intp #varname#_Dims[#rank#] = {#rank*[-1]#};',
+                 '\tconst int #varname#_Rank = #rank#;',
+                 ],
+        'need':['len..', {hasinitvalue: 'forcomb'}, {hasinitvalue: 'CFUNCSMESS'}],
+        '_check': isarray
+    },
+    # Scalararray
+    {  # Common
+        '_check': l_and(isarray, l_not(iscomplexarray))
+    }, {  # Not hidden
+        '_check': l_and(isarray, l_not(iscomplexarray), isintent_nothide)
+    },
+    # Integer*1 array
+    {'need': '#ctype#',
+     '_check': isint1array,
+     '_depend': ''
+     },
+    # Integer*-1 array
+    {'need': '#ctype#',
+     '_check': isunsigned_chararray,
+     '_depend': ''
+     },
+    # Integer*-2 array
+    {'need': '#ctype#',
+     '_check': isunsigned_shortarray,
+     '_depend': ''
+     },
+    # Integer*-8 array
+    {'need': '#ctype#',
+     '_check': isunsigned_long_longarray,
+     '_depend': ''
+     },
+    # Complexarray
+    {'need': '#ctype#',
+     '_check': iscomplexarray,
+     '_depend': ''
+     },
+    # Stringarray
+    {
+        'callfortranappend': {isarrayofstrings: 'flen(#varname#),'},
+        'need': 'string',
+        '_check': isstringarray
+    }
+]
+
+arg_rules = [
+    {
+        'separatorsfor': sepdict
+    },
+    {  # Common
+        'frompyobj': ['\t/* Processing variable #varname# */',
+                      {debugcapi: '\tfprintf(stderr,"#vardebuginfo#\\n");'}, ],
+        'cleanupfrompyobj': '\t/* End of cleaning variable #varname# */',
+        '_depend': '',
+        'need': typedef_need_dict,
+    },
+    # Doc signatures
+    {
+        'docstropt': {l_and(isoptional, isintent_nothide): '#pydocsign#'},
+        'docstrreq': {l_and(isrequired, isintent_nothide): '#pydocsign#'},
+        'docstrout': {isintent_out: '#pydocsignout#'},
+        'latexdocstropt': {l_and(isoptional, isintent_nothide): ['\\item[]{{}\\verb@#pydocsign#@{}}',
+                                                                 {hasnote: '--- #note#'}]},
+        'latexdocstrreq': {l_and(isrequired, isintent_nothide): ['\\item[]{{}\\verb@#pydocsign#@{}}',
+                                                                 {hasnote: '--- #note#'}]},
+        'latexdocstrout': {isintent_out: ['\\item[]{{}\\verb@#pydocsignout#@{}}',
+                                          {l_and(hasnote, isintent_hide): '--- #note#',
+                                           l_and(hasnote, isintent_nothide): '--- See above.'}]},
+        'depend': ''
+    },
+    # Required/Optional arguments
+    {
+        'kwlist': '"#varname#",',
+        'docsign': '#varname#,',
+        '_check': l_and(isintent_nothide, l_not(isoptional))
+    },
+    {
+        'kwlistopt': '"#varname#",',
+        'docsignopt': '#varname#=#showinit#,',
+        'docsignoptshort': '#varname#,',
+        '_check': l_and(isintent_nothide, isoptional)
+    },
+    # Docstring/BuildValue
+    {
+        'docreturn': '#outvarname#,',
+        'returnformat': '#varrformat#',
+        '_check': isintent_out
+    },
+    # Externals (call-back functions)
+    {  # Common
+        'docsignxa': {isintent_nothide: '#varname#_extra_args=(),'},
+        'docsignxashort': {isintent_nothide: '#varname#_extra_args,'},
+        'docstropt': {isintent_nothide: '#varname#_extra_args : input tuple, optional\\n    Default: ()'},
+        'docstrcbs': '#cbdocstr#',
+        'latexdocstrcbs': '\\item[] #cblatexdocstr#',
+        'latexdocstropt': {isintent_nothide: '\\item[]{{}\\verb@#varname#_extra_args := () input tuple@{}} --- Extra arguments for call-back function {{}\\verb@#varname#@{}}.'},
+        'decl': ['\tPyObject *#varname#_capi = Py_None;',
+                 '\tPyTupleObject *#varname#_xa_capi = NULL;',
+                 '\tPyTupleObject *#varname#_args_capi = NULL;',
+                 '\tint #varname#_nofargs_capi = 0;',
+                 {l_not(isintent_callback):
+                  '\t#cbname#_typedef #varname#_cptr;'}
+                 ],
+        'kwlistxa': {isintent_nothide: '"#varname#_extra_args",'},
+        'argformat': {isrequired: 'O'},
+        'keyformat': {isoptional: 'O'},
+        'xaformat': {isintent_nothide: 'O!'},
+        'args_capi': {isrequired: ',&#varname#_capi'},
+        'keys_capi': {isoptional: ',&#varname#_capi'},
+        'keys_xa': ',&PyTuple_Type,&#varname#_xa_capi',
+        'setjmpbuf': '(setjmp(#cbname#_jmpbuf))',
+        'callfortran': {l_not(isintent_callback): '#varname#_cptr,'},
+        'need': ['#cbname#', 'setjmp.h'],
+        '_check':isexternal
+    },
+    {
+        'frompyobj': [{l_not(isintent_callback): """\
+if(F2PyCapsule_Check(#varname#_capi)) {
+  #varname#_cptr = F2PyCapsule_AsVoidPtr(#varname#_capi);
+} else {
+  #varname#_cptr = #cbname#;
+}
+"""}, {isintent_callback: """\
+if (#varname#_capi==Py_None) {
+  #varname#_capi = PyObject_GetAttrString(#modulename#_module,\"#varname#\");
+  if (#varname#_capi) {
+    if (#varname#_xa_capi==NULL) {
+      if (PyObject_HasAttrString(#modulename#_module,\"#varname#_extra_args\")) {
+        PyObject* capi_tmp = PyObject_GetAttrString(#modulename#_module,\"#varname#_extra_args\");
+        if (capi_tmp) {
+          #varname#_xa_capi = (PyTupleObject *)PySequence_Tuple(capi_tmp);
+          Py_DECREF(capi_tmp);
+        }
+        else {
+          #varname#_xa_capi = (PyTupleObject *)Py_BuildValue(\"()\");
+        }
+        if (#varname#_xa_capi==NULL) {
+          PyErr_SetString(#modulename#_error,\"Failed to convert #modulename#.#varname#_extra_args to tuple.\\n\");
+          return NULL;
+        }
+      }
+    }
+  }
+  if (#varname#_capi==NULL) {
+    PyErr_SetString(#modulename#_error,\"Callback #varname# not defined (as an argument or module #modulename# attribute).\\n\");
+    return NULL;
+  }
+}
+"""},
+            """\
+\t#varname#_nofargs_capi = #cbname#_nofargs;
+\tif (create_cb_arglist(#varname#_capi,#varname#_xa_capi,#maxnofargs#,#nofoptargs#,&#cbname#_nofargs,&#varname#_args_capi,\"failed in processing argument list for call-back #varname#.\")) {
+\t\tjmp_buf #varname#_jmpbuf;""",
+            {debugcapi: ["""\
+\t\tfprintf(stderr,\"debug-capi:Assuming %d arguments; at most #maxnofargs#(-#nofoptargs#) is expected.\\n\",#cbname#_nofargs);
+\t\tCFUNCSMESSPY(\"for #varname#=\",#cbname#_capi);""",
+                         {l_not(isintent_callback): """\t\tfprintf(stderr,\"#vardebugshowvalue# (call-back in C).\\n\",#cbname#);"""}]},
+            """\
+\t\tCFUNCSMESS(\"Saving jmpbuf for `#varname#`.\\n\");
+\t\tSWAP(#varname#_capi,#cbname#_capi,PyObject);
+\t\tSWAP(#varname#_args_capi,#cbname#_args_capi,PyTupleObject);
+\t\tmemcpy(&#varname#_jmpbuf,&#cbname#_jmpbuf,sizeof(jmp_buf));""",
+        ],
+        'cleanupfrompyobj':
+        """\
+\t\tCFUNCSMESS(\"Restoring jmpbuf for `#varname#`.\\n\");
+\t\t#cbname#_capi = #varname#_capi;
+\t\tPy_DECREF(#cbname#_args_capi);
+\t\t#cbname#_args_capi = #varname#_args_capi;
+\t\t#cbname#_nofargs = #varname#_nofargs_capi;
+\t\tmemcpy(&#cbname#_jmpbuf,&#varname#_jmpbuf,sizeof(jmp_buf));
+\t}""",
+        'need': ['SWAP', 'create_cb_arglist'],
+        '_check':isexternal,
+        '_depend':''
+    },
+    # Scalars (not complex)
+    {  # Common
+        'decl': '\t#ctype# #varname# = 0;',
+        'pyobjfrom': {debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",#varname#);'},
+        'callfortran': {isintent_c: '#varname#,', l_not(isintent_c): '&#varname#,'},
+        'return': {isintent_out: ',#varname#'},
+        '_check': l_and(isscalar, l_not(iscomplex))
+    }, {
+        'need': {hasinitvalue: 'math.h'},
+        '_check': l_and(isscalar, l_not(iscomplex)),
+    }, {  # Not hidden
+        'decl': '\tPyObject *#varname#_capi = Py_None;',
+        'argformat': {isrequired: 'O'},
+        'keyformat': {isoptional: 'O'},
+        'args_capi': {isrequired: ',&#varname#_capi'},
+        'keys_capi': {isoptional: ',&#varname#_capi'},
+        'pyobjfrom': {isintent_inout: """\
+\tf2py_success = try_pyarr_from_#ctype#(#varname#_capi,&#varname#);
+\tif (f2py_success) {"""},
+        'closepyobjfrom': {isintent_inout: "\t} /*if (f2py_success) of #varname# pyobjfrom*/"},
+        'need': {isintent_inout: 'try_pyarr_from_#ctype#'},
+        '_check': l_and(isscalar, l_not(iscomplex), isintent_nothide)
+    }, {
+        'frompyobj': [
+            # hasinitvalue...
+            #   if pyobj is None:
+            #     varname = init
+            #   else
+            #     from_pyobj(varname)
+            #
+            # isoptional and noinitvalue...
+            #   if pyobj is not None:
+            #     from_pyobj(varname)
+            #   else:
+            #     varname is uninitialized
+            #
+            # ...
+            #   from_pyobj(varname)
+            #
+            {hasinitvalue: '\tif (#varname#_capi == Py_None) #varname# = #init#; else',
+             '_depend': ''},
+            {l_and(isoptional, l_not(hasinitvalue)): '\tif (#varname#_capi != Py_None)',
+             '_depend': ''},
+            {l_not(islogical): '''\
+\t\tf2py_success = #ctype#_from_pyobj(&#varname#,#varname#_capi,"#pyname#() #nth# (#varname#) can\'t be converted to #ctype#");
+\tif (f2py_success) {'''},
+            {islogical: '''\
+\t\t#varname# = (#ctype#)PyObject_IsTrue(#varname#_capi);
+\t\tf2py_success = 1;
+\tif (f2py_success) {'''},
+        ],
+        'cleanupfrompyobj': '\t} /*if (f2py_success) of #varname#*/',
+        'need': {l_not(islogical): '#ctype#_from_pyobj'},
+        '_check': l_and(isscalar, l_not(iscomplex), isintent_nothide),
+        '_depend': ''
+    }, {  # Hidden
+        'frompyobj': {hasinitvalue: '\t#varname# = #init#;'},
+        'need': typedef_need_dict,
+        '_check': l_and(isscalar, l_not(iscomplex), isintent_hide),
+        '_depend': ''
+    }, {  # Common
+        'frompyobj': {debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",#varname#);'},
+        '_check': l_and(isscalar, l_not(iscomplex)),
+        '_depend': ''
+    },
+    # Complex scalars
+    {  # Common
+        'decl': '\t#ctype# #varname#;',
+        'callfortran': {isintent_c: '#varname#,', l_not(isintent_c): '&#varname#,'},
+        'pyobjfrom': {debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",#varname#.r,#varname#.i);'},
+        'return': {isintent_out: ',#varname#_capi'},
+        '_check': iscomplex
+    }, {  # Not hidden
+        'decl': '\tPyObject *#varname#_capi = Py_None;',
+        'argformat': {isrequired: 'O'},
+        'keyformat': {isoptional: 'O'},
+        'args_capi': {isrequired: ',&#varname#_capi'},
+        'keys_capi': {isoptional: ',&#varname#_capi'},
+        'need': {isintent_inout: 'try_pyarr_from_#ctype#'},
+        'pyobjfrom': {isintent_inout: """\
+\t\tf2py_success = try_pyarr_from_#ctype#(#varname#_capi,&#varname#);
+\t\tif (f2py_success) {"""},
+        'closepyobjfrom': {isintent_inout: "\t\t} /*if (f2py_success) of #varname# pyobjfrom*/"},
+        '_check': l_and(iscomplex, isintent_nothide)
+    }, {
+        'frompyobj': [{hasinitvalue: '\tif (#varname#_capi==Py_None) {#varname#.r = #init.r#, #varname#.i = #init.i#;} else'},
+                      {l_and(isoptional, l_not(hasinitvalue))
+                             : '\tif (#varname#_capi != Py_None)'},
+                      '\t\tf2py_success = #ctype#_from_pyobj(&#varname#,#varname#_capi,"#pyname#() #nth# (#varname#) can\'t be converted to #ctype#");'
+                      '\n\tif (f2py_success) {'],
+        'cleanupfrompyobj': '\t}  /*if (f2py_success) of #varname# frompyobj*/',
+        'need': ['#ctype#_from_pyobj'],
+        '_check': l_and(iscomplex, isintent_nothide),
+        '_depend': ''
+    }, {  # Hidden
+        'decl': {isintent_out: '\tPyObject *#varname#_capi = Py_None;'},
+        '_check': l_and(iscomplex, isintent_hide)
+    }, {
+        'frompyobj': {hasinitvalue: '\t#varname#.r = #init.r#, #varname#.i = #init.i#;'},
+        '_check': l_and(iscomplex, isintent_hide),
+        '_depend': ''
+    }, {  # Common
+        'pyobjfrom': {isintent_out: '\t#varname#_capi = pyobj_from_#ctype#1(#varname#);'},
+        'need': ['pyobj_from_#ctype#1'],
+        '_check': iscomplex
+    }, {
+        'frompyobj': {debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",#varname#.r,#varname#.i);'},
+        '_check': iscomplex,
+        '_depend': ''
+    },
+    # String
+    {  # Common
+        'decl': ['\t#ctype# #varname# = NULL;',
+                 '\tint slen(#varname#);',
+                 '\tPyObject *#varname#_capi = Py_None;'],
+        'callfortran':'#varname#,',
+        'callfortranappend':'slen(#varname#),',
+        'pyobjfrom':{debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",slen(#varname#),#varname#);'},
+        'return': {isintent_out: ',#varname#'},
+        'need': ['len..'],  # 'STRINGFREE'],
+        '_check':isstring
+    }, {  # Common
+        'frompyobj': """\
+\tslen(#varname#) = #length#;
+\tf2py_success = #ctype#_from_pyobj(&#varname#,&slen(#varname#),#init#,#varname#_capi,\"#ctype#_from_pyobj failed in converting #nth# `#varname#\' of #pyname# to C #ctype#\");
+\tif (f2py_success) {""",
+        'cleanupfrompyobj': """\
+\t\tSTRINGFREE(#varname#);
+\t}  /*if (f2py_success) of #varname#*/""",
+        'need': ['#ctype#_from_pyobj', 'len..', 'STRINGFREE'],
+        '_check':isstring,
+        '_depend':''
+    }, {  # Not hidden
+        'argformat': {isrequired: 'O'},
+        'keyformat': {isoptional: 'O'},
+        'args_capi': {isrequired: ',&#varname#_capi'},
+        'keys_capi': {isoptional: ',&#varname#_capi'},
+        'pyobjfrom': {isintent_inout: '''\
+\tf2py_success = try_pyarr_from_#ctype#(#varname#_capi,#varname#);
+\tif (f2py_success) {'''},
+        'closepyobjfrom': {isintent_inout: '\t} /*if (f2py_success) of #varname# pyobjfrom*/'},
+        'need': {isintent_inout: 'try_pyarr_from_#ctype#'},
+        '_check': l_and(isstring, isintent_nothide)
+    }, {  # Hidden
+        '_check': l_and(isstring, isintent_hide)
+    }, {
+        'frompyobj': {debugcapi: '\tfprintf(stderr,"#vardebugshowvalue#\\n",slen(#varname#),#varname#);'},
+        '_check': isstring,
+        '_depend': ''
+    },
+    # Array
+    {  # Common
+        'decl': ['\t#ctype# *#varname# = NULL;',
+                 '\tnpy_intp #varname#_Dims[#rank#] = {#rank*[-1]#};',
+                 '\tconst int #varname#_Rank = #rank#;',
+                 '\tPyArrayObject *capi_#varname#_tmp = NULL;',
+                 '\tint capi_#varname#_intent = 0;',
+                 ],
+        'callfortran':'#varname#,',
+        'return':{isintent_out: ',capi_#varname#_tmp'},
+        'need': 'len..',
+        '_check': isarray
+    }, {  # intent(overwrite) array
+        'decl': '\tint capi_overwrite_#varname# = 1;',
+        'kwlistxa': '"overwrite_#varname#",',
+        'xaformat': 'i',
+        'keys_xa': ',&capi_overwrite_#varname#',
+        'docsignxa': 'overwrite_#varname#=1,',
+        'docsignxashort': 'overwrite_#varname#,',
+        'docstropt': 'overwrite_#varname# : input int, optional\\n    Default: 1',
+        '_check': l_and(isarray, isintent_overwrite),
+    }, {
+        'frompyobj': '\tcapi_#varname#_intent |= (capi_overwrite_#varname#?0:F2PY_INTENT_COPY);',
+        '_check': l_and(isarray, isintent_overwrite),
+        '_depend': '',
+    },
+    {  # intent(copy) array
+        'decl': '\tint capi_overwrite_#varname# = 0;',
+        'kwlistxa': '"overwrite_#varname#",',
+        'xaformat': 'i',
+        'keys_xa': ',&capi_overwrite_#varname#',
+        'docsignxa': 'overwrite_#varname#=0,',
+        'docsignxashort': 'overwrite_#varname#,',
+        'docstropt': 'overwrite_#varname# : input int, optional\\n    Default: 0',
+        '_check': l_and(isarray, isintent_copy),
+    }, {
+        'frompyobj': '\tcapi_#varname#_intent |= (capi_overwrite_#varname#?0:F2PY_INTENT_COPY);',
+        '_check': l_and(isarray, isintent_copy),
+        '_depend': '',
+    }, {
+        'need': [{hasinitvalue: 'forcomb'}, {hasinitvalue: 'CFUNCSMESS'}],
+        '_check': isarray,
+        '_depend': ''
+    }, {  # Not hidden
+        'decl': '\tPyObject *#varname#_capi = Py_None;',
+        'argformat': {isrequired: 'O'},
+        'keyformat': {isoptional: 'O'},
+        'args_capi': {isrequired: ',&#varname#_capi'},
+        'keys_capi': {isoptional: ',&#varname#_capi'},
+        '_check': l_and(isarray, isintent_nothide)
+    }, {
+        'frompyobj': ['\t#setdims#;',
+                      '\tcapi_#varname#_intent |= #intent#;',
+                      {isintent_hide:
+                       '\tcapi_#varname#_tmp = array_from_pyobj(#atype#,#varname#_Dims,#varname#_Rank,capi_#varname#_intent,Py_None);'},
+                      {isintent_nothide:
+                       '\tcapi_#varname#_tmp = array_from_pyobj(#atype#,#varname#_Dims,#varname#_Rank,capi_#varname#_intent,#varname#_capi);'},
+                      """\
+\tif (capi_#varname#_tmp == NULL) {
+\t\tPyObject *exc, *val, *tb;
+\t\tPyErr_Fetch(&exc, &val, &tb);
+\t\tPyErr_SetString(exc ? exc : #modulename#_error,\"failed in converting #nth# `#varname#\' of #pyname# to C/Fortran array\" );
+\t\tnpy_PyErr_ChainExceptionsCause(exc, val, tb);
+\t} else {
+\t\t#varname# = (#ctype# *)(PyArray_DATA(capi_#varname#_tmp));
+""",
+                      {hasinitvalue: [
+                          {isintent_nothide:
+                              '\tif (#varname#_capi == Py_None) {'},
+                          {isintent_hide: '\t{'},
+                          {iscomplexarray: '\t\t#ctype# capi_c;'},
+                          """\
+\t\tint *_i,capi_i=0;
+\t\tCFUNCSMESS(\"#name#: Initializing #varname#=#init#\\n\");
+\t\tif (initforcomb(PyArray_DIMS(capi_#varname#_tmp),PyArray_NDIM(capi_#varname#_tmp),1)) {
+\t\t\twhile ((_i = nextforcomb()))
+\t\t\t\t#varname#[capi_i++] = #init#; /* fortran way */
+\t\t} else {
+\t\t\tPyObject *exc, *val, *tb;
+\t\t\tPyErr_Fetch(&exc, &val, &tb);
+\t\t\tPyErr_SetString(exc ? exc : #modulename#_error,\"Initialization of #nth# #varname# failed (initforcomb).\");
+\t\t\tnpy_PyErr_ChainExceptionsCause(exc, val, tb);
+\t\t\tf2py_success = 0;
+\t\t}
+\t}
+\tif (f2py_success) {"""]},
+                      ],
+        'cleanupfrompyobj': [  # note that this list will be reversed
+            '\t}  /*if (capi_#varname#_tmp == NULL) ... else of #varname#*/',
+            {l_not(l_or(isintent_out, isintent_hide)): """\
+\tif((PyObject *)capi_#varname#_tmp!=#varname#_capi) {
+\t\tPy_XDECREF(capi_#varname#_tmp); }"""},
+            {l_and(isintent_hide, l_not(isintent_out))
+                   : """\t\tPy_XDECREF(capi_#varname#_tmp);"""},
+            {hasinitvalue: '\t}  /*if (f2py_success) of #varname# init*/'},
+        ],
+        '_check': isarray,
+        '_depend': ''
+    },
+    # Scalararray
+    {  # Common
+        '_check': l_and(isarray, l_not(iscomplexarray))
+    }, {  # Not hidden
+        '_check': l_and(isarray, l_not(iscomplexarray), isintent_nothide)
+    },
+    # Integer*1 array
+    {'need': '#ctype#',
+     '_check': isint1array,
+     '_depend': ''
+     },
+    # Integer*-1 array
+    {'need': '#ctype#',
+     '_check': isunsigned_chararray,
+     '_depend': ''
+     },
+    # Integer*-2 array
+    {'need': '#ctype#',
+     '_check': isunsigned_shortarray,
+     '_depend': ''
+     },
+    # Integer*-8 array
+    {'need': '#ctype#',
+     '_check': isunsigned_long_longarray,
+     '_depend': ''
+     },
+    # Complexarray
+    {'need': '#ctype#',
+     '_check': iscomplexarray,
+     '_depend': ''
+     },
+    # Stringarray
+    {
+        'callfortranappend': {isarrayofstrings: 'flen(#varname#),'},
+        'need': 'string',
+        '_check': isstringarray
+    }
+]
+
+################# Rules for checking ###############
+
+check_rules = [
+    {
+        'frompyobj': {debugcapi: '\tfprintf(stderr,\"debug-capi:Checking `#check#\'\\n\");'},
+        'need': 'len..'
+    }, {
+        'frompyobj': '\tCHECKSCALAR(#check#,\"#check#\",\"#nth# #varname#\",\"#varshowvalue#\",#varname#) {',
+        'cleanupfrompyobj': '\t} /*CHECKSCALAR(#check#)*/',
+        'need': 'CHECKSCALAR',
+        '_check': l_and(isscalar, l_not(iscomplex)),
+        '_break': ''
+    }, {
+        'frompyobj': '\tCHECKSTRING(#check#,\"#check#\",\"#nth# #varname#\",\"#varshowvalue#\",#varname#) {',
+        'cleanupfrompyobj': '\t} /*CHECKSTRING(#check#)*/',
+        'need': 'CHECKSTRING',
+        '_check': isstring,
+        '_break': ''
+    }, {
+        'need': 'CHECKARRAY',
+        'frompyobj': '\tCHECKARRAY(#check#,\"#check#\",\"#nth# #varname#\") {',
+        'cleanupfrompyobj': '\t} /*CHECKARRAY(#check#)*/',
+        '_check': isarray,
+        '_break': ''
+    }, {
+        'need': 'CHECKGENERIC',
+        'frompyobj': '\tCHECKGENERIC(#check#,\"#check#\",\"#nth# #varname#\") {',
+        'cleanupfrompyobj': '\t} /*CHECKGENERIC(#check#)*/',
+    }
+]
+
+########## Applying the rules. No need to modify what follows #############
+
+#################### Build C/API module #######################
+
+
+def buildmodule(m, um):
+    """
+    Return
+    """
+    outmess('\tBuilding module "%s"...\n' % (m['name']))
+    ret = {}
+    mod_rules = defmod_rules[:]
+    vrd = capi_maps.modsign2map(m)
+    rd = dictappend({'f2py_version': f2py_version}, vrd)
+    funcwrappers = []
+    funcwrappers2 = []  # F90 codes
+    for n in m['interfaced']:
+        nb = None
+        for bi in m['body']:
+            if not bi['block'] == 'interface':
+                errmess('buildmodule: Expected interface block. Skipping.\n')
+                continue
+            for b in bi['body']:
+                if b['name'] == n:
+                    nb = b
+                    break
+
+        if not nb:
+            errmess(
+                'buildmodule: Could not found the body of interfaced routine "%s". Skipping.\n' % (n))
+            continue
+        nb_list = [nb]
+        if 'entry' in nb:
+            for k, a in nb['entry'].items():
+                nb1 = copy.deepcopy(nb)
+                del nb1['entry']
+                nb1['name'] = k
+                nb1['args'] = a
+                nb_list.append(nb1)
+        for nb in nb_list:
+            api, wrap = buildapi(nb)
+            if wrap:
+                if ismoduleroutine(nb):
+                    funcwrappers2.append(wrap)
+                else:
+                    funcwrappers.append(wrap)
+            ar = applyrules(api, vrd)
+            rd = dictappend(rd, ar)
+
+    # Construct COMMON block support
+    cr, wrap = common_rules.buildhooks(m)
+    if wrap:
+        funcwrappers.append(wrap)
+    ar = applyrules(cr, vrd)
+    rd = dictappend(rd, ar)
+
+    # Construct F90 module support
+    mr, wrap = f90mod_rules.buildhooks(m)
+    if wrap:
+        funcwrappers2.append(wrap)
+    ar = applyrules(mr, vrd)
+    rd = dictappend(rd, ar)
+
+    for u in um:
+        ar = use_rules.buildusevars(u, m['use'][u['name']])
+        rd = dictappend(rd, ar)
+
+    needs = cfuncs.get_needs()
+    code = {}
+    for n in needs.keys():
+        code[n] = []
+        for k in needs[n]:
+            c = ''
+            if k in cfuncs.includes0:
+                c = cfuncs.includes0[k]
+            elif k in cfuncs.includes:
+                c = cfuncs.includes[k]
+            elif k in cfuncs.userincludes:
+                c = cfuncs.userincludes[k]
+            elif k in cfuncs.typedefs:
+                c = cfuncs.typedefs[k]
+            elif k in cfuncs.typedefs_generated:
+                c = cfuncs.typedefs_generated[k]
+            elif k in cfuncs.cppmacros:
+                c = cfuncs.cppmacros[k]
+            elif k in cfuncs.cfuncs:
+                c = cfuncs.cfuncs[k]
+            elif k in cfuncs.callbacks:
+                c = cfuncs.callbacks[k]
+            elif k in cfuncs.f90modhooks:
+                c = cfuncs.f90modhooks[k]
+            elif k in cfuncs.commonhooks:
+                c = cfuncs.commonhooks[k]
+            else:
+                errmess('buildmodule: unknown need %s.\n' % (repr(k)))
+                continue
+            code[n].append(c)
+    mod_rules.append(code)
+    for r in mod_rules:
+        if ('_check' in r and r['_check'](m)) or ('_check' not in r):
+            ar = applyrules(r, vrd, m)
+            rd = dictappend(rd, ar)
+    ar = applyrules(module_rules, rd)
+
+    fn = os.path.join(options['buildpath'], vrd['coutput'])
+    ret['csrc'] = fn
+    with open(fn, 'w') as f:
+        f.write(ar['modulebody'].replace('\t', 2 * ' '))
+    outmess('\tWrote C/API module "%s" to file "%s"\n' % (m['name'], fn))
+
+    if options['dorestdoc']:
+        fn = os.path.join(
+            options['buildpath'], vrd['modulename'] + 'module.rest')
+        with open(fn, 'w') as f:
+            f.write('.. -*- rest -*-\n')
+            f.write('\n'.join(ar['restdoc']))
+        outmess('\tReST Documentation is saved to file "%s/%smodule.rest"\n' %
+                (options['buildpath'], vrd['modulename']))
+    if options['dolatexdoc']:
+        fn = os.path.join(
+            options['buildpath'], vrd['modulename'] + 'module.tex')
+        ret['ltx'] = fn
+        with open(fn, 'w') as f:
+            f.write(
+                '%% This file is auto-generated with f2py (version:%s)\n' % (f2py_version))
+            if 'shortlatex' not in options:
+                f.write(
+                    '\\documentclass{article}\n\\usepackage{a4wide}\n\\begin{document}\n\\tableofcontents\n\n')
+                f.write('\n'.join(ar['latexdoc']))
+            if 'shortlatex' not in options:
+                f.write('\\end{document}')
+        outmess('\tDocumentation is saved to file "%s/%smodule.tex"\n' %
+                (options['buildpath'], vrd['modulename']))
+    if funcwrappers:
+        wn = os.path.join(options['buildpath'], vrd['f2py_wrapper_output'])
+        ret['fsrc'] = wn
+        with open(wn, 'w') as f:
+            f.write('C     -*- fortran -*-\n')
+            f.write(
+                'C     This file is autogenerated with f2py (version:%s)\n' % (f2py_version))
+            f.write(
+                'C     It contains Fortran 77 wrappers to fortran functions.\n')
+            lines = []
+            for l in ('\n\n'.join(funcwrappers) + '\n').split('\n'):
+                if l and l[0] == ' ':
+                    while len(l) >= 66:
+                        lines.append(l[:66] + '\n     &')
+                        l = l[66:]
+                    lines.append(l + '\n')
+                else:
+                    lines.append(l + '\n')
+            lines = ''.join(lines).replace('\n     &\n', '\n')
+            f.write(lines)
+        outmess('\tFortran 77 wrappers are saved to "%s"\n' % (wn))
+    if funcwrappers2:
+        wn = os.path.join(
+            options['buildpath'], '%s-f2pywrappers2.f90' % (vrd['modulename']))
+        ret['fsrc'] = wn
+        with open(wn, 'w') as f:
+            f.write('!     -*- f90 -*-\n')
+            f.write(
+                '!     This file is autogenerated with f2py (version:%s)\n' % (f2py_version))
+            f.write(
+                '!     It contains Fortran 90 wrappers to fortran functions.\n')
+            lines = []
+            for l in ('\n\n'.join(funcwrappers2) + '\n').split('\n'):
+                if len(l) > 72 and l[0] == ' ':
+                    lines.append(l[:72] + '&\n     &')
+                    l = l[72:]
+                    while len(l) > 66:
+                        lines.append(l[:66] + '&\n     &')
+                        l = l[66:]
+                    lines.append(l + '\n')
+                else:
+                    lines.append(l + '\n')
+            lines = ''.join(lines).replace('\n     &\n', '\n')
+            f.write(lines)
+        outmess('\tFortran 90 wrappers are saved to "%s"\n' % (wn))
+    return ret
+
+################## Build C/API function #############
+
+stnd = {1: 'st', 2: 'nd', 3: 'rd', 4: 'th', 5: 'th',
+        6: 'th', 7: 'th', 8: 'th', 9: 'th', 0: 'th'}
+
+
+def buildapi(rout):
+    rout, wrap = func2subr.assubr(rout)
+    args, depargs = getargs2(rout)
+    capi_maps.depargs = depargs
+    var = rout['vars']
+
+    if ismoduleroutine(rout):
+        outmess('\t\t\tConstructing wrapper function "%s.%s"...\n' %
+                (rout['modulename'], rout['name']))
+    else:
+        outmess('\t\tConstructing wrapper function "%s"...\n' % (rout['name']))
+    # Routine
+    vrd = capi_maps.routsign2map(rout)
+    rd = dictappend({}, vrd)
+    for r in rout_rules:
+        if ('_check' in r and r['_check'](rout)) or ('_check' not in r):
+            ar = applyrules(r, vrd, rout)
+            rd = dictappend(rd, ar)
+
+    # Args
+    nth, nthk = 0, 0
+    savevrd = {}
+    for a in args:
+        vrd = capi_maps.sign2map(a, var[a])
+        if isintent_aux(var[a]):
+            _rules = aux_rules
+        else:
+            _rules = arg_rules
+            if not isintent_hide(var[a]):
+                if not isoptional(var[a]):
+                    nth = nth + 1
+                    vrd['nth'] = repr(nth) + stnd[nth % 10] + ' argument'
+                else:
+                    nthk = nthk + 1
+                    vrd['nth'] = repr(nthk) + stnd[nthk % 10] + ' keyword'
+            else:
+                vrd['nth'] = 'hidden'
+        savevrd[a] = vrd
+        for r in _rules:
+            if '_depend' in r:
+                continue
+            if ('_check' in r and r['_check'](var[a])) or ('_check' not in r):
+                ar = applyrules(r, vrd, var[a])
+                rd = dictappend(rd, ar)
+                if '_break' in r:
+                    break
+    for a in depargs:
+        if isintent_aux(var[a]):
+            _rules = aux_rules
+        else:
+            _rules = arg_rules
+        vrd = savevrd[a]
+        for r in _rules:
+            if '_depend' not in r:
+                continue
+            if ('_check' in r and r['_check'](var[a])) or ('_check' not in r):
+                ar = applyrules(r, vrd, var[a])
+                rd = dictappend(rd, ar)
+                if '_break' in r:
+                    break
+        if 'check' in var[a]:
+            for c in var[a]['check']:
+                vrd['check'] = c
+                ar = applyrules(check_rules, vrd, var[a])
+                rd = dictappend(rd, ar)
+    if isinstance(rd['cleanupfrompyobj'], list):
+        rd['cleanupfrompyobj'].reverse()
+    if isinstance(rd['closepyobjfrom'], list):
+        rd['closepyobjfrom'].reverse()
+    rd['docsignature'] = stripcomma(replace('#docsign##docsignopt##docsignxa#',
+                                            {'docsign': rd['docsign'],
+                                             'docsignopt': rd['docsignopt'],
+                                             'docsignxa': rd['docsignxa']}))
+    optargs = stripcomma(replace('#docsignopt##docsignxa#',
+                                 {'docsignxa': rd['docsignxashort'],
+                                  'docsignopt': rd['docsignoptshort']}
+                                 ))
+    if optargs == '':
+        rd['docsignatureshort'] = stripcomma(
+            replace('#docsign#', {'docsign': rd['docsign']}))
+    else:
+        rd['docsignatureshort'] = replace('#docsign#[#docsignopt#]',
+                                          {'docsign': rd['docsign'],
+                                           'docsignopt': optargs,
+                                           })
+    rd['latexdocsignatureshort'] = rd['docsignatureshort'].replace('_', '\\_')
+    rd['latexdocsignatureshort'] = rd[
+        'latexdocsignatureshort'].replace(',', ', ')
+    cfs = stripcomma(replace('#callfortran##callfortranappend#', {
+                     'callfortran': rd['callfortran'], 'callfortranappend': rd['callfortranappend']}))
+    if len(rd['callfortranappend']) > 1:
+        rd['callcompaqfortran'] = stripcomma(replace('#callfortran# 0,#callfortranappend#', {
+                                             'callfortran': rd['callfortran'], 'callfortranappend': rd['callfortranappend']}))
+    else:
+        rd['callcompaqfortran'] = cfs
+    rd['callfortran'] = cfs
+    if isinstance(rd['docreturn'], list):
+        rd['docreturn'] = stripcomma(
+            replace('#docreturn#', {'docreturn': rd['docreturn']})) + ' = '
+    rd['docstrsigns'] = []
+    rd['latexdocstrsigns'] = []
+    for k in ['docstrreq', 'docstropt', 'docstrout', 'docstrcbs']:
+        if k in rd and isinstance(rd[k], list):
+            rd['docstrsigns'] = rd['docstrsigns'] + rd[k]
+        k = 'latex' + k
+        if k in rd and isinstance(rd[k], list):
+            rd['latexdocstrsigns'] = rd['latexdocstrsigns'] + rd[k][0:1] +\
+                ['\\begin{description}'] + rd[k][1:] +\
+                ['\\end{description}']
+
+    ar = applyrules(routine_rules, rd)
+    if ismoduleroutine(rout):
+        outmess('\t\t\t  %s\n' % (ar['docshort']))
+    else:
+        outmess('\t\t  %s\n' % (ar['docshort']))
+    return ar, wrap
+
+
+#################### EOF rules.py #######################
diff --git a/venv/Lib/site-packages/numpy/f2py/setup.py b/venv/Lib/site-packages/numpy/f2py/setup.py
new file mode 100644
index 000000000..80b47e527
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/setup.py
@@ -0,0 +1,72 @@
+#!/usr/bin/env python3
+"""
+setup.py for installing F2PY
+
+Usage:
+   pip install .
+
+Copyright 2001-2005 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@cens.ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Revision: 1.32 $
+$Date: 2005/01/30 17:22:14 $
+Pearu Peterson
+
+"""
+from numpy.distutils.core import setup
+from numpy.distutils.misc_util import Configuration
+
+
+from __version__ import version
+
+
+def configuration(parent_package='', top_path=None):
+    config = Configuration('f2py', parent_package, top_path)
+    config.add_subpackage('tests')
+    config.add_data_dir('tests/src')
+    config.add_data_files(
+        'src/fortranobject.c',
+        'src/fortranobject.h')
+    return config
+
+
+if __name__ == "__main__":
+
+    config = configuration(top_path='')
+    config = config.todict()
+
+    config['download_url'] = "http://cens.ioc.ee/projects/f2py2e/2.x"\
+                             "/F2PY-2-latest.tar.gz"
+    config['classifiers'] = [
+        'Development Status :: 5 - Production/Stable',
+        'Intended Audience :: Developers',
+        'Intended Audience :: Science/Research',
+        'License :: OSI Approved :: NumPy License',
+        'Natural Language :: English',
+        'Operating System :: OS Independent',
+        'Programming Language :: C',
+        'Programming Language :: Fortran',
+        'Programming Language :: Python',
+        'Topic :: Scientific/Engineering',
+        'Topic :: Software Development :: Code Generators',
+    ]
+    setup(version=version,
+          description="F2PY - Fortran to Python Interface Generator",
+          author="Pearu Peterson",
+          author_email="pearu@cens.ioc.ee",
+          maintainer="Pearu Peterson",
+          maintainer_email="pearu@cens.ioc.ee",
+          license="BSD",
+          platforms="Unix, Windows (mingw|cygwin), Mac OSX",
+          long_description="""\
+The Fortran to Python Interface Generator, or F2PY for short, is a
+command line tool (f2py) for generating Python C/API modules for
+wrapping Fortran 77/90/95 subroutines, accessing common blocks from
+Python, and calling Python functions from Fortran (call-backs).
+Interfacing subroutines/data from Fortran 90/95 modules is supported.""",
+          url="http://cens.ioc.ee/projects/f2py2e/",
+          keywords=['Fortran', 'f2py'],
+          **config)
diff --git a/venv/Lib/site-packages/numpy/f2py/src/fortranobject.c b/venv/Lib/site-packages/numpy/f2py/src/fortranobject.c
new file mode 100644
index 000000000..b3a04bcf0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/src/fortranobject.c
@@ -0,0 +1,1042 @@
+#define FORTRANOBJECT_C
+#include "fortranobject.h"
+
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include <stdlib.h>
+#include <string.h>
+
+/*
+  This file implements: FortranObject, array_from_pyobj, copy_ND_array
+
+  Author: Pearu Peterson <pearu@cens.ioc.ee>
+  $Revision: 1.52 $
+  $Date: 2005/07/11 07:44:20 $
+*/
+
+int
+F2PyDict_SetItemString(PyObject *dict, char *name, PyObject *obj)
+{
+    if (obj==NULL) {
+        fprintf(stderr, "Error loading %s\n", name);
+        if (PyErr_Occurred()) {
+            PyErr_Print();
+            PyErr_Clear();
+        }
+        return -1;
+    }
+    return PyDict_SetItemString(dict, name, obj);
+}
+
+/************************* FortranObject *******************************/
+
+typedef PyObject *(*fortranfunc)(PyObject *,PyObject *,PyObject *,void *);
+
+PyObject *
+PyFortranObject_New(FortranDataDef* defs, f2py_void_func init) {
+    int i;
+    PyFortranObject *fp = NULL;
+    PyObject *v = NULL;
+    if (init!=NULL) {                        /* Initialize F90 module objects */
+        (*(init))();
+    }
+    fp = PyObject_New(PyFortranObject, &PyFortran_Type);
+    if (fp == NULL) {
+        return NULL;
+    }
+    if ((fp->dict = PyDict_New()) == NULL) {
+        Py_DECREF(fp);
+        return NULL;
+    }
+    fp->len = 0;
+    while (defs[fp->len].name != NULL) {
+        fp->len++;
+    }
+    if (fp->len == 0) {
+        goto fail;
+    }
+    fp->defs = defs;
+    for (i=0;i<fp->len;i++) {
+        if (fp->defs[i].rank == -1) {                      /* Is Fortran routine */
+            v = PyFortranObject_NewAsAttr(&(fp->defs[i]));
+            if (v==NULL) {
+                goto fail;
+            }
+            PyDict_SetItemString(fp->dict,fp->defs[i].name,v);
+            Py_XDECREF(v);
+        } else
+            if ((fp->defs[i].data)!=NULL) { /* Is Fortran variable or array (not allocatable) */
+                if (fp->defs[i].type == NPY_STRING) {
+                    int n = fp->defs[i].rank-1;
+                    v = PyArray_New(&PyArray_Type, n, fp->defs[i].dims.d,
+                                    NPY_STRING, NULL, fp->defs[i].data, fp->defs[i].dims.d[n],
+                                    NPY_ARRAY_FARRAY, NULL);
+                }
+                else {
+                    v = PyArray_New(&PyArray_Type, fp->defs[i].rank, fp->defs[i].dims.d,
+                                    fp->defs[i].type, NULL, fp->defs[i].data, 0, NPY_ARRAY_FARRAY,
+                                    NULL);
+                }
+                if (v==NULL) {
+                    goto fail;
+                }
+                PyDict_SetItemString(fp->dict,fp->defs[i].name,v);
+                Py_XDECREF(v);
+            }
+    }
+    return (PyObject *)fp;
+ fail:
+    Py_XDECREF(fp);
+    return NULL;
+}
+
+PyObject *
+PyFortranObject_NewAsAttr(FortranDataDef* defs) { /* used for calling F90 module routines */
+    PyFortranObject *fp = NULL;
+    fp = PyObject_New(PyFortranObject, &PyFortran_Type);
+    if (fp == NULL) return NULL;
+    if ((fp->dict = PyDict_New())==NULL) {
+        PyObject_Del(fp);
+        return NULL;
+    }
+    fp->len = 1;
+    fp->defs = defs;
+    return (PyObject *)fp;
+}
+
+/* Fortran methods */
+
+static void
+fortran_dealloc(PyFortranObject *fp) {
+    Py_XDECREF(fp->dict);
+    PyObject_Del(fp);
+}
+
+
+/* Returns number of bytes consumed from buf, or -1 on error. */
+static Py_ssize_t
+format_def(char *buf, Py_ssize_t size, FortranDataDef def)
+{
+    char *p = buf;
+    int i, n;
+
+    n = PyOS_snprintf(p, size, "array(%" NPY_INTP_FMT, def.dims.d[0]);
+    if (n < 0 || n >= size) {
+        return -1;
+    }
+    p += n;
+    size -= n;
+
+    for (i = 1; i < def.rank; i++) {
+        n = PyOS_snprintf(p, size, ",%" NPY_INTP_FMT, def.dims.d[i]);
+        if (n < 0 || n >= size) {
+            return -1;
+        }
+        p += n;
+        size -= n;
+    }
+
+    if (size <= 0) {
+        return -1;
+    }
+
+    *p++ = ')';
+    size--;
+
+    if (def.data == NULL) {
+        static const char notalloc[] = ", not allocated";
+        if ((size_t) size < sizeof(notalloc)) {
+            return -1;
+        }
+        memcpy(p, notalloc, sizeof(notalloc));
+    }
+
+    return p - buf;
+}
+
+static PyObject *
+fortran_doc(FortranDataDef def)
+{
+    char *buf, *p;
+    PyObject *s = NULL;
+    Py_ssize_t n, origsize, size = 100;
+
+    if (def.doc != NULL) {
+        size += strlen(def.doc);
+    }
+    origsize = size;
+    buf = p = (char *)PyMem_Malloc(size);
+    if (buf == NULL) {
+        return PyErr_NoMemory();
+    }
+
+    if (def.rank == -1) {
+        if (def.doc) {
+            n = strlen(def.doc);
+            if (n > size) {
+                goto fail;
+            }
+            memcpy(p, def.doc, n);
+            p += n;
+            size -= n;
+        }
+        else {
+            n = PyOS_snprintf(p, size, "%s - no docs available", def.name);
+            if (n < 0 || n >= size) {
+                goto fail;
+            }
+            p += n;
+            size -= n;
+        }
+    }
+    else {
+        PyArray_Descr *d = PyArray_DescrFromType(def.type);
+        n = PyOS_snprintf(p, size, "'%c'-", d->type);
+        Py_DECREF(d);
+        if (n < 0 || n >= size) {
+            goto fail;
+        }
+        p += n;
+        size -= n;
+
+        if (def.data == NULL) {
+            n = format_def(p, size, def) == -1;
+            if (n < 0) {
+                goto fail;
+            }
+            p += n;
+            size -= n;
+        }
+        else if (def.rank > 0) {
+            n = format_def(p, size, def);
+            if (n < 0) {
+                goto fail;
+            }
+            p += n;
+            size -= n;
+        }
+        else {
+            n = strlen("scalar");
+            if (size < n) {
+                goto fail;
+            }
+            memcpy(p, "scalar", n);
+            p += n;
+            size -= n;
+        }
+    }
+    if (size <= 1) {
+        goto fail;
+    }
+    *p++ = '\n';
+    size--;
+
+    /* p now points one beyond the last character of the string in buf */
+    s = PyUnicode_FromStringAndSize(buf, p - buf);
+
+    PyMem_Free(buf);
+    return s;
+
+ fail:
+    fprintf(stderr, "fortranobject.c: fortran_doc: len(p)=%zd>%zd=size:"
+                    " too long docstring required, increase size\n",
+            p - buf, origsize);
+    PyMem_Free(buf);
+    return NULL;
+}
+
+static FortranDataDef *save_def; /* save pointer of an allocatable array */
+static void set_data(char *d,npy_intp *f) {  /* callback from Fortran */
+    if (*f)                                  /* In fortran f=allocated(d) */
+        save_def->data = d;
+    else
+        save_def->data = NULL;
+    /* printf("set_data: d=%p,f=%d\n",d,*f); */
+}
+
+static PyObject *
+fortran_getattr(PyFortranObject *fp, char *name) {
+    int i,j,k,flag;
+    if (fp->dict != NULL) {
+        PyObject *v = _PyDict_GetItemStringWithError(fp->dict, name);
+        if (v == NULL && PyErr_Occurred()) {
+            return NULL;
+        }
+        else if (v != NULL) {
+            Py_INCREF(v);
+            return v;
+        }
+    }
+    for (i=0,j=1;i<fp->len && (j=strcmp(name,fp->defs[i].name));i++);
+    if (j==0)
+        if (fp->defs[i].rank!=-1) {                   /* F90 allocatable array */
+            if (fp->defs[i].func==NULL) return NULL;
+            for(k=0;k<fp->defs[i].rank;++k)
+                fp->defs[i].dims.d[k]=-1;
+            save_def = &fp->defs[i];
+            (*(fp->defs[i].func))(&fp->defs[i].rank,fp->defs[i].dims.d,set_data,&flag);
+            if (flag==2)
+                k = fp->defs[i].rank + 1;
+            else
+                k = fp->defs[i].rank;
+            if (fp->defs[i].data !=NULL) {              /* array is allocated */
+                PyObject *v = PyArray_New(&PyArray_Type, k, fp->defs[i].dims.d,
+                                          fp->defs[i].type, NULL, fp->defs[i].data, 0, NPY_ARRAY_FARRAY,
+                                          NULL);
+                if (v==NULL) return NULL;
+                /* Py_INCREF(v); */
+                return v;
+            } else {                                    /* array is not allocated */
+                Py_RETURN_NONE;
+            }
+        }
+    if (strcmp(name,"__dict__")==0) {
+        Py_INCREF(fp->dict);
+        return fp->dict;
+    }
+    if (strcmp(name,"__doc__")==0) {
+        PyObject *s = PyUnicode_FromString(""), *s2, *s3;
+        for (i=0;i<fp->len;i++) {
+            s2 = fortran_doc(fp->defs[i]);
+            s3 = PyUnicode_Concat(s, s2);
+            Py_DECREF(s2);
+            Py_DECREF(s);
+            s = s3;
+        }
+        if (PyDict_SetItemString(fp->dict, name, s))
+            return NULL;
+        return s;
+    }
+    if ((strcmp(name,"_cpointer")==0) && (fp->len==1)) {
+        PyObject *cobj = F2PyCapsule_FromVoidPtr((void *)(fp->defs[0].data),NULL);
+        if (PyDict_SetItemString(fp->dict, name, cobj))
+            return NULL;
+        return cobj;
+    }
+    PyObject *str, *ret;
+    str = PyUnicode_FromString(name);
+    ret = PyObject_GenericGetAttr((PyObject *)fp, str);
+    Py_DECREF(str);
+    return ret;
+}
+
+static int
+fortran_setattr(PyFortranObject *fp, char *name, PyObject *v) {
+    int i,j,flag;
+    PyArrayObject *arr = NULL;
+    for (i=0,j=1;i<fp->len && (j=strcmp(name,fp->defs[i].name));i++);
+    if (j==0) {
+        if (fp->defs[i].rank==-1) {
+            PyErr_SetString(PyExc_AttributeError,"over-writing fortran routine");
+            return -1;
+        }
+        if (fp->defs[i].func!=NULL) { /* is allocatable array */
+            npy_intp dims[F2PY_MAX_DIMS];
+            int k;
+            save_def = &fp->defs[i];
+            if (v!=Py_None) {     /* set new value (reallocate if needed --
+                                     see f2py generated code for more
+                                     details ) */
+                for(k=0;k<fp->defs[i].rank;k++) dims[k]=-1;
+                if ((arr = array_from_pyobj(fp->defs[i].type,dims,fp->defs[i].rank,F2PY_INTENT_IN,v))==NULL)
+                    return -1;
+                (*(fp->defs[i].func))(&fp->defs[i].rank,PyArray_DIMS(arr),set_data,&flag);
+            } else {             /* deallocate */
+                for(k=0;k<fp->defs[i].rank;k++) dims[k]=0;
+                (*(fp->defs[i].func))(&fp->defs[i].rank,dims,set_data,&flag);
+                for(k=0;k<fp->defs[i].rank;k++) dims[k]=-1;
+            }
+            memcpy(fp->defs[i].dims.d,dims,fp->defs[i].rank*sizeof(npy_intp));
+        } else {                     /* not allocatable array */
+            if ((arr = array_from_pyobj(fp->defs[i].type,fp->defs[i].dims.d,fp->defs[i].rank,F2PY_INTENT_IN,v))==NULL)
+                return -1;
+        }
+        if (fp->defs[i].data!=NULL) { /* copy Python object to Fortran array */
+            npy_intp s = PyArray_MultiplyList(fp->defs[i].dims.d,PyArray_NDIM(arr));
+            if (s==-1)
+                s = PyArray_MultiplyList(PyArray_DIMS(arr),PyArray_NDIM(arr));
+            if (s<0 ||
+                (memcpy(fp->defs[i].data,PyArray_DATA(arr),s*PyArray_ITEMSIZE(arr)))==NULL) {
+                if ((PyObject*)arr!=v) {
+                    Py_DECREF(arr);
+                }
+                return -1;
+            }
+            if ((PyObject*)arr!=v) {
+                Py_DECREF(arr);
+            }
+        } else return (fp->defs[i].func==NULL?-1:0);
+        return 0; /* successful */
+    }
+    if (fp->dict == NULL) {
+        fp->dict = PyDict_New();
+        if (fp->dict == NULL)
+            return -1;
+    }
+    if (v == NULL) {
+        int rv = PyDict_DelItemString(fp->dict, name);
+        if (rv < 0)
+            PyErr_SetString(PyExc_AttributeError,"delete non-existing fortran attribute");
+        return rv;
+    }
+    else
+        return PyDict_SetItemString(fp->dict, name, v);
+}
+
+static PyObject*
+fortran_call(PyFortranObject *fp, PyObject *arg, PyObject *kw) {
+    int i = 0;
+    /*  printf("fortran call
+        name=%s,func=%p,data=%p,%p\n",fp->defs[i].name,
+        fp->defs[i].func,fp->defs[i].data,&fp->defs[i].data); */
+    if (fp->defs[i].rank==-1) {/* is Fortran routine */
+        if (fp->defs[i].func==NULL) {
+            PyErr_Format(PyExc_RuntimeError, "no function to call");
+            return NULL;
+        }
+        else if (fp->defs[i].data==NULL)
+            /* dummy routine */
+            return (*((fortranfunc)(fp->defs[i].func)))((PyObject *)fp,arg,kw,NULL);
+        else
+            return (*((fortranfunc)(fp->defs[i].func)))((PyObject *)fp,arg,kw,
+                                                        (void *)fp->defs[i].data);
+    }
+    PyErr_Format(PyExc_TypeError, "this fortran object is not callable");
+    return NULL;
+}
+
+static PyObject *
+fortran_repr(PyFortranObject *fp)
+{
+    PyObject *name = NULL, *repr = NULL;
+    name = PyObject_GetAttrString((PyObject *)fp, "__name__");
+    PyErr_Clear();
+    if (name != NULL && PyUnicode_Check(name)) {
+        repr = PyUnicode_FromFormat("<fortran %U>", name);
+    }
+    else {
+        repr = PyUnicode_FromString("<fortran object>");
+    }
+    Py_XDECREF(name);
+    return repr;
+}
+
+
+PyTypeObject PyFortran_Type = {
+    PyVarObject_HEAD_INIT(NULL, 0)
+    .tp_name ="fortran",
+    .tp_basicsize = sizeof(PyFortranObject),
+    .tp_dealloc = (destructor)fortran_dealloc,
+    .tp_getattr = (getattrfunc)fortran_getattr,
+    .tp_setattr = (setattrfunc)fortran_setattr,
+    .tp_repr = (reprfunc)fortran_repr,
+    .tp_call = (ternaryfunc)fortran_call,
+};
+
+/************************* f2py_report_atexit *******************************/
+
+#ifdef F2PY_REPORT_ATEXIT
+static int passed_time = 0;
+static int passed_counter = 0;
+static int passed_call_time = 0;
+static struct timeb start_time;
+static struct timeb stop_time;
+static struct timeb start_call_time;
+static struct timeb stop_call_time;
+static int cb_passed_time = 0;
+static int cb_passed_counter = 0;
+static int cb_passed_call_time = 0;
+static struct timeb cb_start_time;
+static struct timeb cb_stop_time;
+static struct timeb cb_start_call_time;
+static struct timeb cb_stop_call_time;
+
+extern void f2py_start_clock(void) { ftime(&start_time); }
+extern
+void f2py_start_call_clock(void) {
+    f2py_stop_clock();
+    ftime(&start_call_time);
+}
+extern
+void f2py_stop_clock(void) {
+    ftime(&stop_time);
+    passed_time += 1000*(stop_time.time - start_time.time);
+    passed_time += stop_time.millitm - start_time.millitm;
+}
+extern
+void f2py_stop_call_clock(void) {
+    ftime(&stop_call_time);
+    passed_call_time += 1000*(stop_call_time.time - start_call_time.time);
+    passed_call_time += stop_call_time.millitm - start_call_time.millitm;
+    passed_counter += 1;
+    f2py_start_clock();
+}
+
+extern void f2py_cb_start_clock(void) { ftime(&cb_start_time); }
+extern
+void f2py_cb_start_call_clock(void) {
+    f2py_cb_stop_clock();
+    ftime(&cb_start_call_time);
+}
+extern
+void f2py_cb_stop_clock(void) {
+    ftime(&cb_stop_time);
+    cb_passed_time += 1000*(cb_stop_time.time - cb_start_time.time);
+    cb_passed_time += cb_stop_time.millitm - cb_start_time.millitm;
+}
+extern
+void f2py_cb_stop_call_clock(void) {
+    ftime(&cb_stop_call_time);
+    cb_passed_call_time += 1000*(cb_stop_call_time.time - cb_start_call_time.time);
+    cb_passed_call_time += cb_stop_call_time.millitm - cb_start_call_time.millitm;
+    cb_passed_counter += 1;
+    f2py_cb_start_clock();
+}
+
+static int f2py_report_on_exit_been_here = 0;
+extern
+void f2py_report_on_exit(int exit_flag,void *name) {
+    if (f2py_report_on_exit_been_here) {
+        fprintf(stderr,"             %s\n",(char*)name);
+        return;
+    }
+    f2py_report_on_exit_been_here = 1;
+    fprintf(stderr,"                      /-----------------------\\\n");
+    fprintf(stderr,"                     < F2PY performance report >\n");
+    fprintf(stderr,"                      \\-----------------------/\n");
+    fprintf(stderr,"Overall time spent in ...\n");
+    fprintf(stderr,"(a) wrapped (Fortran/C) functions           : %8d msec\n",
+            passed_call_time);
+    fprintf(stderr,"(b) f2py interface,           %6d calls  : %8d msec\n",
+            passed_counter,passed_time);
+    fprintf(stderr,"(c) call-back (Python) functions            : %8d msec\n",
+            cb_passed_call_time);
+    fprintf(stderr,"(d) f2py call-back interface, %6d calls  : %8d msec\n",
+            cb_passed_counter,cb_passed_time);
+
+    fprintf(stderr,"(e) wrapped (Fortran/C) functions (actual) : %8d msec\n\n",
+            passed_call_time-cb_passed_call_time-cb_passed_time);
+    fprintf(stderr,"Use -DF2PY_REPORT_ATEXIT_DISABLE to disable this message.\n");
+    fprintf(stderr,"Exit status: %d\n",exit_flag);
+    fprintf(stderr,"Modules    : %s\n",(char*)name);
+}
+#endif
+
+/********************** report on array copy ****************************/
+
+#ifdef F2PY_REPORT_ON_ARRAY_COPY
+static void f2py_report_on_array_copy(PyArrayObject* arr) {
+    const npy_intp arr_size = PyArray_Size((PyObject *)arr);
+    if (arr_size>F2PY_REPORT_ON_ARRAY_COPY) {
+        fprintf(stderr,"copied an array: size=%ld, elsize=%"NPY_INTP_FMT"\n",
+                arr_size, (npy_intp)PyArray_ITEMSIZE(arr));
+    }
+}
+static void f2py_report_on_array_copy_fromany(void) {
+    fprintf(stderr,"created an array from object\n");
+}
+
+#define F2PY_REPORT_ON_ARRAY_COPY_FROMARR f2py_report_on_array_copy((PyArrayObject *)arr)
+#define F2PY_REPORT_ON_ARRAY_COPY_FROMANY f2py_report_on_array_copy_fromany()
+#else
+#define F2PY_REPORT_ON_ARRAY_COPY_FROMARR
+#define F2PY_REPORT_ON_ARRAY_COPY_FROMANY
+#endif
+
+
+/************************* array_from_obj *******************************/
+
+/*
+ * File: array_from_pyobj.c
+ *
+ * Description:
+ * ------------
+ * Provides array_from_pyobj function that returns a contiguous array
+ * object with the given dimensions and required storage order, either
+ * in row-major (C) or column-major (Fortran) order. The function
+ * array_from_pyobj is very flexible about its Python object argument
+ * that can be any number, list, tuple, or array.
+ *
+ * array_from_pyobj is used in f2py generated Python extension
+ * modules.
+ *
+ * Author: Pearu Peterson <pearu@cens.ioc.ee>
+ * Created: 13-16 January 2002
+ * $Id: fortranobject.c,v 1.52 2005/07/11 07:44:20 pearu Exp $
+ */
+
+static int check_and_fix_dimensions(const PyArrayObject* arr,
+                                    const int rank,
+                                    npy_intp *dims);
+
+static int
+count_negative_dimensions(const int rank,
+                          const npy_intp *dims) {
+    int i=0,r=0;
+    while (i<rank) {
+        if (dims[i] < 0) ++r;
+        ++i;
+    }
+    return r;
+}
+
+#ifdef DEBUG_COPY_ND_ARRAY
+void dump_dims(int rank, npy_intp const* dims) {
+    int i;
+    printf("[");
+    for(i=0;i<rank;++i) {
+        printf("%3" NPY_INTP_FMT, dims[i]);
+    }
+    printf("]\n");
+}
+void dump_attrs(const PyArrayObject* obj) {
+    const PyArrayObject_fields *arr = (const PyArrayObject_fields*) obj;
+    int rank = PyArray_NDIM(arr);
+    npy_intp size = PyArray_Size((PyObject *)arr);
+    printf("\trank = %d, flags = %d, size = %" NPY_INTP_FMT  "\n",
+           rank,arr->flags,size);
+    printf("\tstrides = ");
+    dump_dims(rank,arr->strides);
+    printf("\tdimensions = ");
+    dump_dims(rank,arr->dimensions);
+}
+#endif
+
+#define SWAPTYPE(a,b,t) {t c; c = (a); (a) = (b); (b) = c; }
+
+static int swap_arrays(PyArrayObject* obj1, PyArrayObject* obj2) {
+    PyArrayObject_fields *arr1 = (PyArrayObject_fields*) obj1,
+                         *arr2 = (PyArrayObject_fields*) obj2;
+    SWAPTYPE(arr1->data,arr2->data,char*);
+    SWAPTYPE(arr1->nd,arr2->nd,int);
+    SWAPTYPE(arr1->dimensions,arr2->dimensions,npy_intp*);
+    SWAPTYPE(arr1->strides,arr2->strides,npy_intp*);
+    SWAPTYPE(arr1->base,arr2->base,PyObject*);
+    SWAPTYPE(arr1->descr,arr2->descr,PyArray_Descr*);
+    SWAPTYPE(arr1->flags,arr2->flags,int);
+    /* SWAPTYPE(arr1->weakreflist,arr2->weakreflist,PyObject*); */
+    return 0;
+}
+
+#define ARRAY_ISCOMPATIBLE(arr,type_num)                                \
+    (  (PyArray_ISINTEGER(arr) && PyTypeNum_ISINTEGER(type_num))        \
+       ||(PyArray_ISFLOAT(arr) && PyTypeNum_ISFLOAT(type_num))          \
+       ||(PyArray_ISCOMPLEX(arr) && PyTypeNum_ISCOMPLEX(type_num))      \
+       ||(PyArray_ISBOOL(arr) && PyTypeNum_ISBOOL(type_num))            \
+       )
+
+extern
+PyArrayObject* array_from_pyobj(const int type_num,
+                                npy_intp *dims,
+                                const int rank,
+                                const int intent,
+                                PyObject *obj) {
+    /*
+     * Note about reference counting
+     *  -----------------------------
+     * If the caller returns the array to Python, it must be done with
+     * Py_BuildValue("N",arr).
+     * Otherwise, if obj!=arr then the caller must call Py_DECREF(arr).
+     *
+     * Note on intent(cache,out,..)
+     * ---------------------
+     * Don't expect correct data when returning intent(cache) array.
+     *
+     */
+    char mess[200];
+    PyArrayObject *arr = NULL;
+    PyArray_Descr *descr;
+    char typechar;
+    int elsize;
+
+    if ((intent & F2PY_INTENT_HIDE)
+        || ((intent & F2PY_INTENT_CACHE) && (obj==Py_None))
+        || ((intent & F2PY_OPTIONAL) && (obj==Py_None))
+        ) {
+        /* intent(cache), optional, intent(hide) */
+        if (count_negative_dimensions(rank,dims) > 0) {
+            int i;
+            strcpy(mess, "failed to create intent(cache|hide)|optional array"
+                   "-- must have defined dimensions but got (");
+            for(i=0;i<rank;++i)
+                sprintf(mess+strlen(mess),"%" NPY_INTP_FMT ",",dims[i]);
+            strcat(mess, ")");
+            PyErr_SetString(PyExc_ValueError,mess);
+            return NULL;
+        }
+        arr = (PyArrayObject *)
+            PyArray_New(&PyArray_Type, rank, dims, type_num,
+                        NULL,NULL,1,
+                        !(intent&F2PY_INTENT_C),
+                        NULL);
+        if (arr==NULL) return NULL;
+        if (!(intent & F2PY_INTENT_CACHE))
+            PyArray_FILLWBYTE(arr, 0);
+        return arr;
+    }
+
+    descr = PyArray_DescrFromType(type_num);
+    /* compatibility with NPY_CHAR */
+    if (type_num == NPY_STRING) {
+        PyArray_DESCR_REPLACE(descr);
+        if (descr == NULL) {
+            return NULL;
+        }
+        descr->elsize = 1;
+        descr->type = NPY_CHARLTR;
+    }
+    elsize = descr->elsize;
+    typechar = descr->type;
+    Py_DECREF(descr);
+    if (PyArray_Check(obj)) {
+        arr = (PyArrayObject *)obj;
+
+        if (intent & F2PY_INTENT_CACHE) {
+            /* intent(cache) */
+            if (PyArray_ISONESEGMENT(arr)
+                && PyArray_ITEMSIZE(arr)>=elsize) {
+                if (check_and_fix_dimensions(arr, rank, dims)) {
+                    return NULL;
+                }
+                if (intent & F2PY_INTENT_OUT)
+                    Py_INCREF(arr);
+                return arr;
+            }
+            strcpy(mess, "failed to initialize intent(cache) array");
+            if (!PyArray_ISONESEGMENT(arr))
+                strcat(mess, " -- input must be in one segment");
+            if (PyArray_ITEMSIZE(arr)<elsize)
+                sprintf(mess+strlen(mess),
+                        " -- expected at least elsize=%d but got %" NPY_INTP_FMT,
+                        elsize,
+                        (npy_intp)PyArray_ITEMSIZE(arr)
+                        );
+            PyErr_SetString(PyExc_ValueError,mess);
+            return NULL;
+        }
+
+        /* here we have always intent(in) or intent(inout) or intent(inplace) */
+
+        if (check_and_fix_dimensions(arr, rank, dims)) {
+            return NULL;
+        }
+        /*
+        printf("intent alignment=%d\n", F2PY_GET_ALIGNMENT(intent));
+        printf("alignment check=%d\n", F2PY_CHECK_ALIGNMENT(arr, intent));
+        int i;
+        for (i=1;i<=16;i++)
+          printf("i=%d isaligned=%d\n", i, ARRAY_ISALIGNED(arr, i));
+        */
+        if ((! (intent & F2PY_INTENT_COPY))
+            && PyArray_ITEMSIZE(arr)==elsize
+            && ARRAY_ISCOMPATIBLE(arr,type_num)
+            && F2PY_CHECK_ALIGNMENT(arr, intent)
+            ) {
+            if ((intent & F2PY_INTENT_C)?PyArray_ISCARRAY(arr):PyArray_ISFARRAY(arr)) {
+                if ((intent & F2PY_INTENT_OUT)) {
+                    Py_INCREF(arr);
+                }
+                /* Returning input array */
+                return arr;
+            }
+        }
+
+        if (intent & F2PY_INTENT_INOUT) {
+            strcpy(mess, "failed to initialize intent(inout) array");
+            if ((intent & F2PY_INTENT_C) && !PyArray_ISCARRAY(arr))
+                strcat(mess, " -- input not contiguous");
+            if (!(intent & F2PY_INTENT_C) && !PyArray_ISFARRAY(arr))
+                strcat(mess, " -- input not fortran contiguous");
+            if (PyArray_ITEMSIZE(arr)!=elsize)
+                sprintf(mess+strlen(mess),
+                        " -- expected elsize=%d but got %" NPY_INTP_FMT,
+                        elsize,
+                        (npy_intp)PyArray_ITEMSIZE(arr)
+                        );
+            if (!(ARRAY_ISCOMPATIBLE(arr,type_num)))
+                sprintf(mess+strlen(mess)," -- input '%c' not compatible to '%c'",
+                        PyArray_DESCR(arr)->type,typechar);
+            if (!(F2PY_CHECK_ALIGNMENT(arr, intent)))
+              sprintf(mess+strlen(mess)," -- input not %d-aligned", F2PY_GET_ALIGNMENT(intent));
+            PyErr_SetString(PyExc_ValueError,mess);
+            return NULL;
+        }
+
+        /* here we have always intent(in) or intent(inplace) */
+
+        {
+            PyArrayObject * retarr;
+            retarr = (PyArrayObject *) \
+                PyArray_New(&PyArray_Type, PyArray_NDIM(arr), PyArray_DIMS(arr), type_num,
+                            NULL,NULL,1,
+                            !(intent&F2PY_INTENT_C),
+                            NULL);
+            if (retarr==NULL)
+                return NULL;
+            F2PY_REPORT_ON_ARRAY_COPY_FROMARR;
+            if (PyArray_CopyInto(retarr, arr)) {
+                Py_DECREF(retarr);
+                return NULL;
+            }
+            if (intent & F2PY_INTENT_INPLACE) {
+                if (swap_arrays(arr,retarr))
+                    return NULL; /* XXX: set exception */
+                Py_XDECREF(retarr);
+                if (intent & F2PY_INTENT_OUT)
+                    Py_INCREF(arr);
+            } else {
+                arr = retarr;
+            }
+        }
+        return arr;
+    }
+
+    if ((intent & F2PY_INTENT_INOUT) ||
+            (intent & F2PY_INTENT_INPLACE) ||
+            (intent & F2PY_INTENT_CACHE)) {
+        PyErr_Format(PyExc_TypeError,
+                     "failed to initialize intent(inout|inplace|cache) "
+                     "array, input '%s' object is not an array",
+                     Py_TYPE(obj)->tp_name);
+        return NULL;
+    }
+
+    {
+        PyArray_Descr * descr = PyArray_DescrFromType(type_num);
+        /* compatibility with NPY_CHAR */
+        if (type_num == NPY_STRING) {
+            PyArray_DESCR_REPLACE(descr);
+            if (descr == NULL) {
+                return NULL;
+            }
+            descr->elsize = 1;
+            descr->type = NPY_CHARLTR;
+        }
+        F2PY_REPORT_ON_ARRAY_COPY_FROMANY;
+        arr = (PyArrayObject *) \
+            PyArray_FromAny(obj, descr, 0,0,
+                            ((intent & F2PY_INTENT_C)?NPY_ARRAY_CARRAY:NPY_ARRAY_FARRAY) \
+                            | NPY_ARRAY_FORCECAST, NULL);
+        if (arr==NULL)
+            return NULL;
+        if (check_and_fix_dimensions(arr, rank, dims)) {
+            return NULL;
+        }
+        return arr;
+    }
+
+}
+
+/*****************************************/
+/* Helper functions for array_from_pyobj */
+/*****************************************/
+
+static
+int check_and_fix_dimensions(const PyArrayObject* arr, const int rank, npy_intp *dims)
+{
+    /*
+     * This function fills in blanks (that are -1's) in dims list using
+     * the dimensions from arr. It also checks that non-blank dims will
+     * match with the corresponding values in arr dimensions.
+     *
+     * Returns 0 if the function is successful.
+     *
+     * If an error condition is detected, an exception is set and 1 is returned.
+     */
+    const npy_intp arr_size = (PyArray_NDIM(arr))?PyArray_Size((PyObject *)arr):1;
+#ifdef DEBUG_COPY_ND_ARRAY
+    dump_attrs(arr);
+    printf("check_and_fix_dimensions:init: dims=");
+    dump_dims(rank,dims);
+#endif
+    if (rank > PyArray_NDIM(arr)) { /* [1,2] -> [[1],[2]]; 1 -> [[1]]  */
+        npy_intp new_size = 1;
+        int free_axe = -1;
+        int i;
+        npy_intp d;
+        /* Fill dims where -1 or 0; check dimensions; calc new_size; */
+        for(i=0;i<PyArray_NDIM(arr);++i) {
+            d = PyArray_DIM(arr,i);
+            if (dims[i] >= 0) {
+                if (d>1 && dims[i]!=d) {
+                    PyErr_Format(PyExc_ValueError,
+                                 "%d-th dimension must be fixed to %"
+                                 NPY_INTP_FMT " but got %" NPY_INTP_FMT "\n",
+                                 i, dims[i], d);
+                    return 1;
+                }
+                if (!dims[i]) dims[i] = 1;
+            } else {
+                dims[i] = d ? d : 1;
+            }
+            new_size *= dims[i];
+        }
+        for(i=PyArray_NDIM(arr);i<rank;++i)
+            if (dims[i]>1) {
+                PyErr_Format(PyExc_ValueError,
+                             "%d-th dimension must be %" NPY_INTP_FMT
+                             " but got 0 (not defined).\n",
+                             i, dims[i]);
+                return 1;
+            } else if (free_axe<0)
+                free_axe = i;
+            else
+                dims[i] = 1;
+        if (free_axe>=0) {
+            dims[free_axe] = arr_size/new_size;
+            new_size *= dims[free_axe];
+        }
+        if (new_size != arr_size) {
+            PyErr_Format(PyExc_ValueError,
+                         "unexpected array size: new_size=%" NPY_INTP_FMT
+                         ", got array with arr_size=%" NPY_INTP_FMT
+                         " (maybe too many free indices)\n",
+                         new_size, arr_size);
+            return 1;
+        }
+    } else if (rank==PyArray_NDIM(arr)) {
+        npy_intp new_size = 1;
+        int i;
+        npy_intp d;
+        for (i=0; i<rank; ++i) {
+            d = PyArray_DIM(arr,i);
+            if (dims[i]>=0) {
+                if (d > 1 && d!=dims[i]) {
+                    PyErr_Format(PyExc_ValueError,
+                                 "%d-th dimension must be fixed to %"
+                                 NPY_INTP_FMT " but got %" NPY_INTP_FMT "\n",
+                                 i, dims[i], d);
+                    return 1;
+                }
+                if (!dims[i]) dims[i] = 1;
+            } else dims[i] = d;
+            new_size *= dims[i];
+        }
+        if (new_size != arr_size) {
+            PyErr_Format(PyExc_ValueError,
+                         "unexpected array size: new_size=%" NPY_INTP_FMT
+                         ", got array with arr_size=%" NPY_INTP_FMT "\n",
+                         new_size, arr_size);
+            return 1;
+        }
+    } else { /* [[1,2]] -> [[1],[2]] */
+        int i,j;
+        npy_intp d;
+        int effrank;
+        npy_intp size;
+        for (i=0,effrank=0;i<PyArray_NDIM(arr);++i)
+            if (PyArray_DIM(arr,i)>1) ++effrank;
+        if (dims[rank-1]>=0)
+            if (effrank>rank) {
+                PyErr_Format(PyExc_ValueError,
+                             "too many axes: %d (effrank=%d), "
+                             "expected rank=%d\n",
+                             PyArray_NDIM(arr), effrank, rank);
+                return 1;
+            }
+
+        for (i=0,j=0;i<rank;++i) {
+            while (j<PyArray_NDIM(arr) && PyArray_DIM(arr,j)<2) ++j;
+            if (j>=PyArray_NDIM(arr)) d = 1;
+            else d = PyArray_DIM(arr,j++);
+            if (dims[i]>=0) {
+                if (d>1 && d!=dims[i]) {
+                    PyErr_Format(PyExc_ValueError,
+                                 "%d-th dimension must be fixed to %"
+                                 NPY_INTP_FMT " but got %" NPY_INTP_FMT
+                                 " (real index=%d)\n",
+                                 i, dims[i], d, j-1);
+                    return 1;
+                }
+                if (!dims[i]) dims[i] = 1;
+            } else
+                dims[i] = d;
+        }
+
+        for (i=rank;i<PyArray_NDIM(arr);++i) { /* [[1,2],[3,4]] -> [1,2,3,4] */
+            while (j<PyArray_NDIM(arr) && PyArray_DIM(arr,j)<2) ++j;
+            if (j>=PyArray_NDIM(arr)) d = 1;
+            else d = PyArray_DIM(arr,j++);
+            dims[rank-1] *= d;
+        }
+        for (i=0,size=1;i<rank;++i) size *= dims[i];
+        if (size != arr_size) {
+            char msg[200];
+            int len;
+            snprintf(msg, sizeof(msg),
+                     "unexpected array size: size=%" NPY_INTP_FMT
+                     ", arr_size=%" NPY_INTP_FMT
+                     ", rank=%d, effrank=%d, arr.nd=%d, dims=[",
+                     size, arr_size, rank, effrank, PyArray_NDIM(arr));
+            for (i = 0; i < rank; ++i) {
+                len = strlen(msg);
+                snprintf(msg + len, sizeof(msg) - len,
+                         " %" NPY_INTP_FMT, dims[i]);
+            }
+            len = strlen(msg);
+            snprintf(msg + len, sizeof(msg) - len, " ], arr.dims=[");
+            for (i = 0; i < PyArray_NDIM(arr); ++i) {
+                len = strlen(msg);
+                snprintf(msg + len, sizeof(msg) - len,
+                         " %" NPY_INTP_FMT, PyArray_DIM(arr, i));
+            }
+            len = strlen(msg);
+            snprintf(msg + len, sizeof(msg) - len, " ]\n");
+            PyErr_SetString(PyExc_ValueError, msg);
+            return 1;
+        }
+    }
+#ifdef DEBUG_COPY_ND_ARRAY
+    printf("check_and_fix_dimensions:end: dims=");
+    dump_dims(rank,dims);
+#endif
+    return 0;
+}
+
+/* End of file: array_from_pyobj.c */
+
+/************************* copy_ND_array *******************************/
+
+extern
+int copy_ND_array(const PyArrayObject *arr, PyArrayObject *out)
+{
+    F2PY_REPORT_ON_ARRAY_COPY_FROMARR;
+    return PyArray_CopyInto(out, (PyArrayObject *)arr);
+}
+
+/*********************************************/
+/* Compatibility functions for Python >= 3.0 */
+/*********************************************/
+
+PyObject *
+F2PyCapsule_FromVoidPtr(void *ptr, void (*dtor)(PyObject *))
+{
+    PyObject *ret = PyCapsule_New(ptr, NULL, dtor);
+    if (ret == NULL) {
+        PyErr_Clear();
+    }
+    return ret;
+}
+
+void *
+F2PyCapsule_AsVoidPtr(PyObject *obj)
+{
+    void *ret = PyCapsule_GetPointer(obj, NULL);
+    if (ret == NULL) {
+        PyErr_Clear();
+    }
+    return ret;
+}
+
+int
+F2PyCapsule_Check(PyObject *ptr)
+{
+    return PyCapsule_CheckExact(ptr);
+}
+
+#ifdef __cplusplus
+}
+#endif
+/************************* EOF fortranobject.c *******************************/
diff --git a/venv/Lib/site-packages/numpy/f2py/src/fortranobject.h b/venv/Lib/site-packages/numpy/f2py/src/fortranobject.h
new file mode 100644
index 000000000..5c382ab7b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/src/fortranobject.h
@@ -0,0 +1,129 @@
+#ifndef Py_FORTRANOBJECT_H
+#define Py_FORTRANOBJECT_H
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+#include "Python.h"
+
+#ifdef FORTRANOBJECT_C
+#define NO_IMPORT_ARRAY
+#endif
+#define PY_ARRAY_UNIQUE_SYMBOL _npy_f2py_ARRAY_API
+#include "numpy/arrayobject.h"
+#include "numpy/npy_3kcompat.h"
+
+
+#ifdef F2PY_REPORT_ATEXIT
+#include <sys/timeb.h>
+  extern void f2py_start_clock(void);
+  extern void f2py_stop_clock(void);
+  extern void f2py_start_call_clock(void);
+  extern void f2py_stop_call_clock(void);
+  extern void f2py_cb_start_clock(void);
+  extern void f2py_cb_stop_clock(void);
+  extern void f2py_cb_start_call_clock(void);
+  extern void f2py_cb_stop_call_clock(void);
+  extern void f2py_report_on_exit(int,void*);
+#endif
+
+#ifdef DMALLOC
+#include "dmalloc.h"
+#endif
+
+/* Fortran object interface */
+
+/*
+123456789-123456789-123456789-123456789-123456789-123456789-123456789-12
+
+PyFortranObject represents various Fortran objects:
+Fortran (module) routines, COMMON blocks, module data.
+
+Author: Pearu Peterson <pearu@cens.ioc.ee>
+*/
+
+#define F2PY_MAX_DIMS 40
+
+typedef void (*f2py_set_data_func)(char*,npy_intp*);
+typedef void (*f2py_void_func)(void);
+typedef void (*f2py_init_func)(int*,npy_intp*,f2py_set_data_func,int*);
+
+  /*typedef void* (*f2py_c_func)(void*,...);*/
+
+typedef void *(*f2pycfunc)(void);
+
+typedef struct {
+  char *name;                /* attribute (array||routine) name */
+  int rank;                  /* array rank, 0 for scalar, max is F2PY_MAX_DIMS,
+                                || rank=-1 for Fortran routine */
+  struct {npy_intp d[F2PY_MAX_DIMS];} dims; /* dimensions of the array, || not used */
+  int type;                  /* PyArray_<type> || not used */
+  char *data;                /* pointer to array || Fortran routine */
+  f2py_init_func func;       /* initialization function for
+                                allocatable arrays:
+                                func(&rank,dims,set_ptr_func,name,len(name))
+                                || C/API wrapper for Fortran routine */
+  char *doc;                 /* documentation string; only recommended
+                                for routines. */
+} FortranDataDef;
+
+typedef struct {
+  PyObject_HEAD
+  int len;                   /* Number of attributes */
+  FortranDataDef *defs;      /* An array of FortranDataDef's */
+  PyObject       *dict;      /* Fortran object attribute dictionary */
+} PyFortranObject;
+
+#define PyFortran_Check(op) (Py_TYPE(op) == &PyFortran_Type)
+#define PyFortran_Check1(op) (0==strcmp(Py_TYPE(op)->tp_name,"fortran"))
+
+  extern PyTypeObject PyFortran_Type;
+  extern int F2PyDict_SetItemString(PyObject* dict, char *name, PyObject *obj);
+  extern PyObject * PyFortranObject_New(FortranDataDef* defs, f2py_void_func init);
+  extern PyObject * PyFortranObject_NewAsAttr(FortranDataDef* defs);
+
+PyObject * F2PyCapsule_FromVoidPtr(void *ptr, void (*dtor)(PyObject *));
+void * F2PyCapsule_AsVoidPtr(PyObject *obj);
+int F2PyCapsule_Check(PyObject *ptr);
+
+#define ISCONTIGUOUS(m) (PyArray_FLAGS(m) & NPY_ARRAY_C_CONTIGUOUS)
+#define F2PY_INTENT_IN 1
+#define F2PY_INTENT_INOUT 2
+#define F2PY_INTENT_OUT 4
+#define F2PY_INTENT_HIDE 8
+#define F2PY_INTENT_CACHE 16
+#define F2PY_INTENT_COPY 32
+#define F2PY_INTENT_C 64
+#define F2PY_OPTIONAL 128
+#define F2PY_INTENT_INPLACE 256
+#define F2PY_INTENT_ALIGNED4 512
+#define F2PY_INTENT_ALIGNED8 1024
+#define F2PY_INTENT_ALIGNED16 2048
+
+#define ARRAY_ISALIGNED(ARR, SIZE) ((size_t)(PyArray_DATA(ARR)) % (SIZE) == 0)
+#define F2PY_ALIGN4(intent) (intent & F2PY_INTENT_ALIGNED4)
+#define F2PY_ALIGN8(intent) (intent & F2PY_INTENT_ALIGNED8)
+#define F2PY_ALIGN16(intent) (intent & F2PY_INTENT_ALIGNED16)
+
+#define F2PY_GET_ALIGNMENT(intent) \
+        (F2PY_ALIGN4(intent) ? 4 : \
+         (F2PY_ALIGN8(intent) ? 8 : \
+          (F2PY_ALIGN16(intent) ? 16 : 1) ))
+#define F2PY_CHECK_ALIGNMENT(arr, intent) ARRAY_ISALIGNED(arr, F2PY_GET_ALIGNMENT(intent))
+
+  extern PyArrayObject* array_from_pyobj(const int type_num,
+                                         npy_intp *dims,
+                                         const int rank,
+                                         const int intent,
+                                         PyObject *obj);
+  extern int copy_ND_array(const PyArrayObject *in, PyArrayObject *out);
+
+#ifdef DEBUG_COPY_ND_ARRAY
+  extern void dump_attrs(const PyArrayObject* arr);
+#endif
+
+
+#ifdef __cplusplus
+}
+#endif
+#endif /* !Py_FORTRANOBJECT_H */
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__init__.py b/venv/Lib/site-packages/numpy/f2py/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..1e0cd157e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_array_from_pyobj.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_array_from_pyobj.cpython-36.pyc
new file mode 100644
index 000000000..641c7988d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_array_from_pyobj.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_assumed_shape.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_assumed_shape.cpython-36.pyc
new file mode 100644
index 000000000..9483e0d05
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_assumed_shape.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_block_docstring.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_block_docstring.cpython-36.pyc
new file mode 100644
index 000000000..6b37608cb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_block_docstring.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_callback.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_callback.cpython-36.pyc
new file mode 100644
index 000000000..ea1ba0fdb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_callback.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_common.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_common.cpython-36.pyc
new file mode 100644
index 000000000..b2baf452a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_common.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_compile_function.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_compile_function.cpython-36.pyc
new file mode 100644
index 000000000..833f949e2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_compile_function.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_crackfortran.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_crackfortran.cpython-36.pyc
new file mode 100644
index 000000000..e0eb346e5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_crackfortran.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_kind.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_kind.cpython-36.pyc
new file mode 100644
index 000000000..ccdf78271
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_kind.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_mixed.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_mixed.cpython-36.pyc
new file mode 100644
index 000000000..2504240c1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_mixed.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_parameter.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_parameter.cpython-36.pyc
new file mode 100644
index 000000000..519b0231b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_parameter.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_quoted_character.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_quoted_character.cpython-36.pyc
new file mode 100644
index 000000000..a0961855d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_quoted_character.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..3b3577d09
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_character.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_character.cpython-36.pyc
new file mode 100644
index 000000000..364863704
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_character.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_complex.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_complex.cpython-36.pyc
new file mode 100644
index 000000000..f6e148b6b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_complex.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_integer.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_integer.cpython-36.pyc
new file mode 100644
index 000000000..000818d44
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_integer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_logical.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_logical.cpython-36.pyc
new file mode 100644
index 000000000..1acc8e3a1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_logical.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_real.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_real.cpython-36.pyc
new file mode 100644
index 000000000..5de8a7aa6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_return_real.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_semicolon_split.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_semicolon_split.cpython-36.pyc
new file mode 100644
index 000000000..20088dc94
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_semicolon_split.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_size.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_size.cpython-36.pyc
new file mode 100644
index 000000000..99614dc5b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_size.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_string.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_string.cpython-36.pyc
new file mode 100644
index 000000000..795c789d6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/test_string.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/util.cpython-36.pyc b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/util.cpython-36.pyc
new file mode 100644
index 000000000..0d6d0d472
Binary files /dev/null and b/venv/Lib/site-packages/numpy/f2py/tests/__pycache__/util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/array_from_pyobj/wrapmodule.c b/venv/Lib/site-packages/numpy/f2py/tests/src/array_from_pyobj/wrapmodule.c
new file mode 100644
index 000000000..0db33e714
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/array_from_pyobj/wrapmodule.c
@@ -0,0 +1,233 @@
+/* File: wrapmodule.c
+ * This file is auto-generated with f2py (version:2_1330).
+ * Hand edited by Pearu.
+ * f2py is a Fortran to Python Interface Generator (FPIG), Second Edition,
+ * written by Pearu Peterson <pearu@cens.ioc.ee>.
+ * See http://cens.ioc.ee/projects/f2py2e/
+ * Generation date: Fri Oct 21 22:41:12 2005
+ * $Revision:$
+ * $Date:$
+ * Do not edit this file directly unless you know what you are doing!!!
+ */
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+/*********************** See f2py2e/cfuncs.py: includes ***********************/
+#include "Python.h"
+#include "fortranobject.h"
+#include <math.h>
+
+static PyObject *wrap_error;
+static PyObject *wrap_module;
+
+/************************************ call ************************************/
+static char doc_f2py_rout_wrap_call[] = "\
+Function signature:\n\
+  arr = call(type_num,dims,intent,obj)\n\
+Required arguments:\n"
+"  type_num : input int\n"
+"  dims : input int-sequence\n"
+"  intent : input int\n"
+"  obj : input python object\n"
+"Return objects:\n"
+"  arr : array";
+static PyObject *f2py_rout_wrap_call(PyObject *capi_self,
+                                     PyObject *capi_args) {
+  PyObject * volatile capi_buildvalue = NULL;
+  int type_num = 0;
+  npy_intp *dims = NULL;
+  PyObject *dims_capi = Py_None;
+  int rank = 0;
+  int intent = 0;
+  PyArrayObject *capi_arr_tmp = NULL;
+  PyObject *arr_capi = Py_None;
+  int i;
+
+  if (!PyArg_ParseTuple(capi_args,"iOiO|:wrap.call",\
+                        &type_num,&dims_capi,&intent,&arr_capi))
+    return NULL;
+  rank = PySequence_Length(dims_capi);
+  dims = malloc(rank*sizeof(npy_intp));
+  for (i=0;i<rank;++i) {
+    PyObject *tmp;
+    tmp = PySequence_GetItem(dims_capi, i);
+    if (tmp == NULL) {
+        goto fail;
+    }
+    dims[i] = (npy_intp)PyInt_AsLong(tmp);
+    Py_DECREF(tmp);
+    if (dims[i] == -1 && PyErr_Occurred()) {
+        goto fail;
+    }
+  }
+  capi_arr_tmp = array_from_pyobj(type_num,dims,rank,intent|F2PY_INTENT_OUT,arr_capi);
+  if (capi_arr_tmp == NULL) {
+    free(dims);
+    return NULL;
+  }
+  capi_buildvalue = Py_BuildValue("N",capi_arr_tmp);
+  free(dims);
+  return capi_buildvalue;
+
+fail:
+  free(dims);
+  return NULL;
+}
+
+static char doc_f2py_rout_wrap_attrs[] = "\
+Function signature:\n\
+  arr = array_attrs(arr)\n\
+Required arguments:\n"
+"  arr : input array object\n"
+"Return objects:\n"
+"  data : data address in hex\n"
+"  nd : int\n"
+"  dimensions : tuple\n"
+"  strides : tuple\n"
+"  base : python object\n"
+"  (kind,type,type_num,elsize,alignment) : 4-tuple\n"
+"  flags : int\n"
+"  itemsize : int\n"
+;
+static PyObject *f2py_rout_wrap_attrs(PyObject *capi_self,
+                                      PyObject *capi_args) {
+  PyObject *arr_capi = Py_None;
+  PyArrayObject *arr = NULL;
+  PyObject *dimensions = NULL;
+  PyObject *strides = NULL;
+  char s[100];
+  int i;
+  memset(s,0,100*sizeof(char));
+  if (!PyArg_ParseTuple(capi_args,"O!|:wrap.attrs",
+                        &PyArray_Type,&arr_capi))
+    return NULL;
+  arr = (PyArrayObject *)arr_capi;
+  sprintf(s,"%p",PyArray_DATA(arr));
+  dimensions = PyTuple_New(PyArray_NDIM(arr));
+  strides = PyTuple_New(PyArray_NDIM(arr));
+  for (i=0;i<PyArray_NDIM(arr);++i) {
+    PyTuple_SetItem(dimensions,i,PyInt_FromLong(PyArray_DIM(arr,i)));
+    PyTuple_SetItem(strides,i,PyInt_FromLong(PyArray_STRIDE(arr,i)));
+  }
+  return Py_BuildValue("siNNO(cciii)ii",s,PyArray_NDIM(arr),
+                       dimensions,strides,
+                       (PyArray_BASE(arr)==NULL?Py_None:PyArray_BASE(arr)),
+                       PyArray_DESCR(arr)->kind,
+                       PyArray_DESCR(arr)->type,
+                       PyArray_TYPE(arr),
+                       PyArray_ITEMSIZE(arr),
+                       PyArray_DESCR(arr)->alignment,
+                       PyArray_FLAGS(arr),
+                       PyArray_ITEMSIZE(arr));
+}
+
+static PyMethodDef f2py_module_methods[] = {
+
+  {"call",f2py_rout_wrap_call,METH_VARARGS,doc_f2py_rout_wrap_call},
+  {"array_attrs",f2py_rout_wrap_attrs,METH_VARARGS,doc_f2py_rout_wrap_attrs},
+  {NULL,NULL}
+};
+
+static struct PyModuleDef moduledef = {
+    PyModuleDef_HEAD_INIT,
+    "test_array_from_pyobj_ext",
+    NULL,
+    -1,
+    f2py_module_methods,
+    NULL,
+    NULL,
+    NULL,
+    NULL
+};
+
+PyMODINIT_FUNC PyInit_test_array_from_pyobj_ext(void) {
+  PyObject *m,*d, *s;
+  m = wrap_module = PyModule_Create(&moduledef);
+  Py_SET_TYPE(&PyFortran_Type, &PyType_Type);
+  import_array();
+  if (PyErr_Occurred())
+    Py_FatalError("can't initialize module wrap (failed to import numpy)");
+  d = PyModule_GetDict(m);
+  s = PyString_FromString("This module 'wrap' is auto-generated with f2py (version:2_1330).\nFunctions:\n"
+"  arr = call(type_num,dims,intent,obj)\n"
+".");
+  PyDict_SetItemString(d, "__doc__", s);
+  wrap_error = PyErr_NewException ("wrap.error", NULL, NULL);
+  Py_DECREF(s);
+
+#define ADDCONST(NAME, CONST)              \
+    s = PyInt_FromLong(CONST);             \
+    PyDict_SetItemString(d, NAME, s);      \
+    Py_DECREF(s)
+
+  ADDCONST("F2PY_INTENT_IN", F2PY_INTENT_IN);
+  ADDCONST("F2PY_INTENT_INOUT", F2PY_INTENT_INOUT);
+  ADDCONST("F2PY_INTENT_OUT", F2PY_INTENT_OUT);
+  ADDCONST("F2PY_INTENT_HIDE", F2PY_INTENT_HIDE);
+  ADDCONST("F2PY_INTENT_CACHE", F2PY_INTENT_CACHE);
+  ADDCONST("F2PY_INTENT_COPY", F2PY_INTENT_COPY);
+  ADDCONST("F2PY_INTENT_C", F2PY_INTENT_C);
+  ADDCONST("F2PY_OPTIONAL", F2PY_OPTIONAL);
+  ADDCONST("F2PY_INTENT_INPLACE", F2PY_INTENT_INPLACE);
+  ADDCONST("NPY_BOOL", NPY_BOOL);
+  ADDCONST("NPY_BYTE", NPY_BYTE);
+  ADDCONST("NPY_UBYTE", NPY_UBYTE);
+  ADDCONST("NPY_SHORT", NPY_SHORT);
+  ADDCONST("NPY_USHORT", NPY_USHORT);
+  ADDCONST("NPY_INT", NPY_INT);
+  ADDCONST("NPY_UINT", NPY_UINT);
+  ADDCONST("NPY_INTP", NPY_INTP);
+  ADDCONST("NPY_UINTP", NPY_UINTP);
+  ADDCONST("NPY_LONG", NPY_LONG);
+  ADDCONST("NPY_ULONG", NPY_ULONG);
+  ADDCONST("NPY_LONGLONG", NPY_LONGLONG);
+  ADDCONST("NPY_ULONGLONG", NPY_ULONGLONG);
+  ADDCONST("NPY_FLOAT", NPY_FLOAT);
+  ADDCONST("NPY_DOUBLE", NPY_DOUBLE);
+  ADDCONST("NPY_LONGDOUBLE", NPY_LONGDOUBLE);
+  ADDCONST("NPY_CFLOAT", NPY_CFLOAT);
+  ADDCONST("NPY_CDOUBLE", NPY_CDOUBLE);
+  ADDCONST("NPY_CLONGDOUBLE", NPY_CLONGDOUBLE);
+  ADDCONST("NPY_OBJECT", NPY_OBJECT);
+  ADDCONST("NPY_STRING", NPY_STRING);
+  ADDCONST("NPY_UNICODE", NPY_UNICODE);
+  ADDCONST("NPY_VOID", NPY_VOID);
+  ADDCONST("NPY_NTYPES", NPY_NTYPES);
+  ADDCONST("NPY_NOTYPE", NPY_NOTYPE);
+  ADDCONST("NPY_USERDEF", NPY_USERDEF);
+
+  ADDCONST("CONTIGUOUS", NPY_ARRAY_C_CONTIGUOUS);
+  ADDCONST("FORTRAN", NPY_ARRAY_F_CONTIGUOUS);
+  ADDCONST("OWNDATA", NPY_ARRAY_OWNDATA);
+  ADDCONST("FORCECAST", NPY_ARRAY_FORCECAST);
+  ADDCONST("ENSURECOPY", NPY_ARRAY_ENSURECOPY);
+  ADDCONST("ENSUREARRAY", NPY_ARRAY_ENSUREARRAY);
+  ADDCONST("ALIGNED", NPY_ARRAY_ALIGNED);
+  ADDCONST("WRITEABLE", NPY_ARRAY_WRITEABLE);
+  ADDCONST("UPDATEIFCOPY", NPY_ARRAY_UPDATEIFCOPY);
+  ADDCONST("WRITEBACKIFCOPY", NPY_ARRAY_WRITEBACKIFCOPY);
+
+  ADDCONST("BEHAVED", NPY_ARRAY_BEHAVED);
+  ADDCONST("BEHAVED_NS", NPY_ARRAY_BEHAVED_NS);
+  ADDCONST("CARRAY", NPY_ARRAY_CARRAY);
+  ADDCONST("FARRAY", NPY_ARRAY_FARRAY);
+  ADDCONST("CARRAY_RO", NPY_ARRAY_CARRAY_RO);
+  ADDCONST("FARRAY_RO", NPY_ARRAY_FARRAY_RO);
+  ADDCONST("DEFAULT", NPY_ARRAY_DEFAULT);
+  ADDCONST("UPDATE_ALL", NPY_ARRAY_UPDATE_ALL);
+
+#undef ADDCONST(
+
+  if (PyErr_Occurred())
+    Py_FatalError("can't initialize module wrap");
+
+#ifdef F2PY_REPORT_ATEXIT
+  on_exit(f2py_report_on_exit,(void*)"array_from_pyobj.wrap.call");
+#endif
+
+  return m;
+}
+#ifdef __cplusplus
+}
+#endif
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/.f2py_f2cmap b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/.f2py_f2cmap
new file mode 100644
index 000000000..2665f89b5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/.f2py_f2cmap
@@ -0,0 +1 @@
+dict(real=dict(rk="double"))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_free.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_free.f90
new file mode 100644
index 000000000..b301710f5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_free.f90
@@ -0,0 +1,34 @@
+
+subroutine sum(x, res)
+  implicit none
+  real, intent(in) :: x(:)
+  real, intent(out) :: res
+
+  integer :: i
+
+  !print *, "sum: size(x) = ", size(x)
+
+  res = 0.0
+
+  do i = 1, size(x)
+    res = res + x(i)
+  enddo
+
+end subroutine sum
+
+function fsum(x) result (res)
+  implicit none
+  real, intent(in) :: x(:)
+  real :: res
+
+  integer :: i
+
+  !print *, "fsum: size(x) = ", size(x)
+
+  res = 0.0
+
+  do i = 1, size(x)
+    res = res + x(i)
+  enddo
+
+end function fsum
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_mod.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_mod.f90
new file mode 100644
index 000000000..cbe6317ed
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_mod.f90
@@ -0,0 +1,41 @@
+
+module mod
+
+contains
+
+subroutine sum(x, res)
+  implicit none
+  real, intent(in) :: x(:)
+  real, intent(out) :: res
+
+  integer :: i
+
+  !print *, "sum: size(x) = ", size(x)
+
+  res = 0.0
+
+  do i = 1, size(x)
+    res = res + x(i)
+  enddo
+
+end subroutine sum
+
+function fsum(x) result (res)
+  implicit none
+  real, intent(in) :: x(:)
+  real :: res
+
+  integer :: i
+
+  !print *, "fsum: size(x) = ", size(x)
+
+  res = 0.0
+
+  do i = 1, size(x)
+    res = res + x(i)
+  enddo
+
+end function fsum
+
+
+end module mod
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_use.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_use.f90
new file mode 100644
index 000000000..337465ac5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/foo_use.f90
@@ -0,0 +1,19 @@
+subroutine sum_with_use(x, res)
+  use precision
+
+  implicit none
+
+  real(kind=rk), intent(in) :: x(:)
+  real(kind=rk), intent(out) :: res
+
+  integer :: i
+
+  !print *, "size(x) = ", size(x)
+
+  res = 0.0
+
+  do i = 1, size(x)
+    res = res + x(i)
+  enddo
+
+ end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/precision.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/precision.f90
new file mode 100644
index 000000000..ed6c70cbb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/assumed_shape/precision.f90
@@ -0,0 +1,4 @@
+module precision
+  integer, parameter :: rk = selected_real_kind(8)
+  integer, parameter :: ik = selected_real_kind(4)
+end module
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/common/block.f b/venv/Lib/site-packages/numpy/f2py/tests/src/common/block.f
new file mode 100644
index 000000000..7ea7968fe
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/common/block.f
@@ -0,0 +1,11 @@
+      SUBROUTINE INITCB
+      DOUBLE PRECISION LONG
+      CHARACTER        STRING
+      INTEGER          OK
+    
+      COMMON  /BLOCK/ LONG, STRING, OK
+      LONG = 1.0
+      STRING = '2'
+      OK = 3
+      RETURN
+      END
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/kind/foo.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/kind/foo.f90
new file mode 100644
index 000000000..d3d15cfb2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/kind/foo.f90
@@ -0,0 +1,20 @@
+
+
+subroutine selectedrealkind(p, r, res)
+  implicit none
+  
+  integer, intent(in) :: p, r
+  !f2py integer :: r=0
+  integer, intent(out) :: res
+  res = selected_real_kind(p, r)
+
+end subroutine
+
+subroutine selectedintkind(p, res)
+  implicit none
+
+  integer, intent(in) :: p
+  integer, intent(out) :: res
+  res = selected_int_kind(p)
+
+end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo.f b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo.f
new file mode 100644
index 000000000..c34742578
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo.f
@@ -0,0 +1,5 @@
+      subroutine bar11(a)
+cf2py intent(out) a
+      integer a
+      a = 11
+      end
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_fixed.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_fixed.f90
new file mode 100644
index 000000000..7543a6acb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_fixed.f90
@@ -0,0 +1,8 @@
+      module foo_fixed
+      contains
+        subroutine bar12(a)
+!f2py intent(out) a
+          integer a
+          a = 12
+        end subroutine bar12
+      end module foo_fixed
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_free.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_free.f90
new file mode 100644
index 000000000..c1b641f13
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/mixed/foo_free.f90
@@ -0,0 +1,8 @@
+module foo_free
+contains
+  subroutine bar13(a)
+    !f2py intent(out) a
+    integer a
+    a = 13
+  end subroutine bar13
+end module foo_free
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_both.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_both.f90
new file mode 100644
index 000000000..ac90cedc5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_both.f90
@@ -0,0 +1,57 @@
+! Check that parameters are correct intercepted.
+! Constants with comma separations are commonly
+! used, for instance Pi = 3._dp
+subroutine foo(x)
+  implicit none
+  integer, parameter :: sp = selected_real_kind(6)
+  integer, parameter :: dp = selected_real_kind(15)
+  integer, parameter :: ii = selected_int_kind(9)
+  integer, parameter :: il = selected_int_kind(18)
+  real(dp), intent(inout) :: x
+  dimension x(3)
+  real(sp), parameter :: three_s = 3._sp
+  real(dp), parameter :: three_d = 3._dp
+  integer(ii), parameter :: three_i = 3_ii
+  integer(il), parameter :: three_l = 3_il
+  x(1) = x(1) + x(2) * three_s * three_i + x(3) * three_d * three_l
+  x(2) = x(2) * three_s
+  x(3) = x(3) * three_l
+  return
+end subroutine
+
+
+subroutine foo_no(x)
+  implicit none
+  integer, parameter :: sp = selected_real_kind(6)
+  integer, parameter :: dp = selected_real_kind(15)
+  integer, parameter :: ii = selected_int_kind(9)
+  integer, parameter :: il = selected_int_kind(18)
+  real(dp), intent(inout) :: x
+  dimension x(3)
+  real(sp), parameter :: three_s = 3.
+  real(dp), parameter :: three_d = 3.
+  integer(ii), parameter :: three_i = 3
+  integer(il), parameter :: three_l = 3
+  x(1) = x(1) + x(2) * three_s * three_i + x(3) * three_d * three_l
+  x(2) = x(2) * three_s
+  x(3) = x(3) * three_l
+  return
+end subroutine
+
+subroutine foo_sum(x)
+  implicit none
+  integer, parameter :: sp = selected_real_kind(6)
+  integer, parameter :: dp = selected_real_kind(15)
+  integer, parameter :: ii = selected_int_kind(9)
+  integer, parameter :: il = selected_int_kind(18)
+  real(dp), intent(inout) :: x
+  dimension x(3)
+  real(sp), parameter :: three_s = 2._sp + 1._sp
+  real(dp), parameter :: three_d = 1._dp + 2._dp
+  integer(ii), parameter :: three_i = 2_ii + 1_ii
+  integer(il), parameter :: three_l = 1_il + 2_il
+  x(1) = x(1) + x(2) * three_s * three_i + x(3) * three_d * three_l
+  x(2) = x(2) * three_s
+  x(3) = x(3) * three_l
+  return
+end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_compound.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_compound.f90
new file mode 100644
index 000000000..e51f5e9b2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_compound.f90
@@ -0,0 +1,15 @@
+! Check that parameters are correct intercepted.
+! Constants with comma separations are commonly
+! used, for instance Pi = 3._dp
+subroutine foo_compound_int(x)
+  implicit none
+  integer, parameter :: ii = selected_int_kind(9)
+  integer(ii), intent(inout) :: x
+  dimension x(3)
+  integer(ii), parameter :: three = 3_ii
+  integer(ii), parameter :: two = 2_ii
+  integer(ii), parameter :: six = three * 1_ii * two
+
+  x(1) = x(1) + x(2) + x(3) * six
+  return
+end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_integer.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_integer.f90
new file mode 100644
index 000000000..aaa83d2eb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_integer.f90
@@ -0,0 +1,22 @@
+! Check that parameters are correct intercepted.
+! Constants with comma separations are commonly
+! used, for instance Pi = 3._dp
+subroutine foo_int(x)
+  implicit none
+  integer, parameter :: ii = selected_int_kind(9)
+  integer(ii), intent(inout) :: x
+  dimension x(3)
+  integer(ii), parameter :: three = 3_ii
+  x(1) = x(1) + x(2) + x(3) * three
+  return
+end subroutine
+
+subroutine foo_long(x)
+  implicit none
+  integer, parameter :: ii = selected_int_kind(18)
+  integer(ii), intent(inout) :: x
+  dimension x(3)
+  integer(ii), parameter :: three = 3_ii
+  x(1) = x(1) + x(2) + x(3) * three
+  return
+end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_non_compound.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_non_compound.f90
new file mode 100644
index 000000000..62c9a5b94
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_non_compound.f90
@@ -0,0 +1,23 @@
+! Check that parameters are correct intercepted.
+! Specifically that types of constants without 
+! compound kind specs are correctly inferred
+! adapted Gibbs iteration code from pymc 
+! for this test case 
+subroutine foo_non_compound_int(x)
+  implicit none
+  integer, parameter :: ii = selected_int_kind(9)
+
+  integer(ii)   maxiterates
+  parameter (maxiterates=2)
+
+  integer(ii)   maxseries
+  parameter (maxseries=2)
+
+  integer(ii)   wasize
+  parameter (wasize=maxiterates*maxseries)
+  integer(ii), intent(inout) :: x
+  dimension x(wasize)
+
+  x(1) = x(1) + x(2) + x(3) + x(4) * wasize
+  return
+end subroutine
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_real.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_real.f90
new file mode 100644
index 000000000..02ac9dd99
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/parameter/constant_real.f90
@@ -0,0 +1,23 @@
+! Check that parameters are correct intercepted.
+! Constants with comma separations are commonly
+! used, for instance Pi = 3._dp
+subroutine foo_single(x)
+  implicit none
+  integer, parameter :: rp = selected_real_kind(6)
+  real(rp), intent(inout) :: x
+  dimension x(3)
+  real(rp), parameter :: three = 3._rp
+  x(1) = x(1) + x(2) + x(3) * three
+  return
+end subroutine
+
+subroutine foo_double(x)
+  implicit none
+  integer, parameter :: rp = selected_real_kind(15)
+  real(rp), intent(inout) :: x
+  dimension x(3)
+  real(rp), parameter :: three = 3._rp
+  x(1) = x(1) + x(2) + x(3) * three
+  return
+end subroutine
+
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/regression/inout.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/regression/inout.f90
new file mode 100644
index 000000000..80cdad90c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/regression/inout.f90
@@ -0,0 +1,9 @@
+! Check that intent(in out) translates as intent(inout).
+! The separation seems to be a common usage.
+      subroutine foo(x)
+          implicit none
+          real(4), intent(in out) :: x
+          dimension x(3)
+          x(1) = x(1) + x(2) + x(3)
+          return
+      end
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/size/foo.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/size/foo.f90
new file mode 100644
index 000000000..5b66f8c43
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/size/foo.f90
@@ -0,0 +1,44 @@
+
+subroutine foo(a, n, m, b)
+  implicit none
+
+  real, intent(in) :: a(n, m)
+  integer, intent(in) :: n, m
+  real, intent(out) :: b(size(a, 1))
+
+  integer :: i
+
+  do i = 1, size(b)
+    b(i) = sum(a(i,:))
+  enddo
+end subroutine
+
+subroutine trans(x,y)
+  implicit none
+  real, intent(in), dimension(:,:) :: x
+  real, intent(out), dimension( size(x,2), size(x,1) ) :: y
+  integer :: N, M, i, j
+  N = size(x,1)
+  M = size(x,2)
+  DO i=1,N
+     do j=1,M
+        y(j,i) = x(i,j)
+     END DO
+  END DO
+end subroutine trans
+
+subroutine flatten(x,y)
+  implicit none
+  real, intent(in), dimension(:,:) :: x
+  real, intent(out), dimension( size(x) ) :: y
+  integer :: N, M, i, j, k
+  N = size(x,1)
+  M = size(x,2)
+  k = 1
+  DO i=1,N
+     do j=1,M
+        y(k) = x(i,j)
+        k = k + 1
+     END DO
+  END DO
+end subroutine flatten
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/src/string/char.f90 b/venv/Lib/site-packages/numpy/f2py/tests/src/string/char.f90
new file mode 100644
index 000000000..bb7985ce5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/src/string/char.f90
@@ -0,0 +1,29 @@
+MODULE char_test
+
+CONTAINS
+
+SUBROUTINE change_strings(strings, n_strs, out_strings)
+    IMPLICIT NONE
+
+    ! Inputs
+    INTEGER, INTENT(IN) :: n_strs
+    CHARACTER, INTENT(IN), DIMENSION(2,n_strs) :: strings
+    CHARACTER, INTENT(OUT), DIMENSION(2,n_strs) :: out_strings
+
+!f2py INTEGER, INTENT(IN) :: n_strs
+!f2py CHARACTER, INTENT(IN), DIMENSION(2,n_strs) :: strings
+!f2py CHARACTER, INTENT(OUT), DIMENSION(2,n_strs) :: strings
+
+    ! Misc.
+    INTEGER*4 :: j
+
+
+    DO j=1, n_strs
+        out_strings(1,j) = strings(1,j)
+        out_strings(2,j) = 'A'
+    END DO
+
+END SUBROUTINE change_strings
+
+END MODULE char_test
+
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_array_from_pyobj.py b/venv/Lib/site-packages/numpy/f2py/tests/test_array_from_pyobj.py
new file mode 100644
index 000000000..b719f2495
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_array_from_pyobj.py
@@ -0,0 +1,579 @@
+import os
+import sys
+import copy
+import pytest
+
+from numpy import (
+    array, alltrue, ndarray, zeros, dtype, intp, clongdouble
+    )
+from numpy.testing import assert_, assert_equal
+from numpy.core.multiarray import typeinfo
+from . import util
+
+wrap = None
+
+
+def setup_module():
+    """
+    Build the required testing extension module
+
+    """
+    global wrap
+
+    # Check compiler availability first
+    if not util.has_c_compiler():
+        pytest.skip("No C compiler available")
+
+    if wrap is None:
+        config_code = """
+        config.add_extension('test_array_from_pyobj_ext',
+                             sources=['wrapmodule.c', 'fortranobject.c'],
+                             define_macros=[])
+        """
+        d = os.path.dirname(__file__)
+        src = [os.path.join(d, 'src', 'array_from_pyobj', 'wrapmodule.c'),
+               os.path.join(d, '..', 'src', 'fortranobject.c'),
+               os.path.join(d, '..', 'src', 'fortranobject.h')]
+        wrap = util.build_module_distutils(src, config_code,
+                                           'test_array_from_pyobj_ext')
+
+
+def flags_info(arr):
+    flags = wrap.array_attrs(arr)[6]
+    return flags2names(flags)
+
+
+def flags2names(flags):
+    info = []
+    for flagname in ['CONTIGUOUS', 'FORTRAN', 'OWNDATA', 'ENSURECOPY',
+                     'ENSUREARRAY', 'ALIGNED', 'NOTSWAPPED', 'WRITEABLE',
+                     'WRITEBACKIFCOPY', 'UPDATEIFCOPY', 'BEHAVED', 'BEHAVED_RO',
+                     'CARRAY', 'FARRAY'
+                     ]:
+        if abs(flags) & getattr(wrap, flagname, 0):
+            info.append(flagname)
+    return info
+
+
+class Intent:
+
+    def __init__(self, intent_list=[]):
+        self.intent_list = intent_list[:]
+        flags = 0
+        for i in intent_list:
+            if i == 'optional':
+                flags |= wrap.F2PY_OPTIONAL
+            else:
+                flags |= getattr(wrap, 'F2PY_INTENT_' + i.upper())
+        self.flags = flags
+
+    def __getattr__(self, name):
+        name = name.lower()
+        if name == 'in_':
+            name = 'in'
+        return self.__class__(self.intent_list + [name])
+
+    def __str__(self):
+        return 'intent(%s)' % (','.join(self.intent_list))
+
+    def __repr__(self):
+        return 'Intent(%r)' % (self.intent_list)
+
+    def is_intent(self, *names):
+        for name in names:
+            if name not in self.intent_list:
+                return False
+        return True
+
+    def is_intent_exact(self, *names):
+        return len(self.intent_list) == len(names) and self.is_intent(*names)
+
+intent = Intent()
+
+_type_names = ['BOOL', 'BYTE', 'UBYTE', 'SHORT', 'USHORT', 'INT', 'UINT',
+               'LONG', 'ULONG', 'LONGLONG', 'ULONGLONG',
+               'FLOAT', 'DOUBLE', 'CFLOAT']
+
+_cast_dict = {'BOOL': ['BOOL']}
+_cast_dict['BYTE'] = _cast_dict['BOOL'] + ['BYTE']
+_cast_dict['UBYTE'] = _cast_dict['BOOL'] + ['UBYTE']
+_cast_dict['BYTE'] = ['BYTE']
+_cast_dict['UBYTE'] = ['UBYTE']
+_cast_dict['SHORT'] = _cast_dict['BYTE'] + ['UBYTE', 'SHORT']
+_cast_dict['USHORT'] = _cast_dict['UBYTE'] + ['BYTE', 'USHORT']
+_cast_dict['INT'] = _cast_dict['SHORT'] + ['USHORT', 'INT']
+_cast_dict['UINT'] = _cast_dict['USHORT'] + ['SHORT', 'UINT']
+
+_cast_dict['LONG'] = _cast_dict['INT'] + ['LONG']
+_cast_dict['ULONG'] = _cast_dict['UINT'] + ['ULONG']
+
+_cast_dict['LONGLONG'] = _cast_dict['LONG'] + ['LONGLONG']
+_cast_dict['ULONGLONG'] = _cast_dict['ULONG'] + ['ULONGLONG']
+
+_cast_dict['FLOAT'] = _cast_dict['SHORT'] + ['USHORT', 'FLOAT']
+_cast_dict['DOUBLE'] = _cast_dict['INT'] + ['UINT', 'FLOAT', 'DOUBLE']
+
+_cast_dict['CFLOAT'] = _cast_dict['FLOAT'] + ['CFLOAT']
+
+# 32 bit system malloc typically does not provide the alignment required by
+# 16 byte long double types this means the inout intent cannot be satisfied
+# and several tests fail as the alignment flag can be randomly true or fals
+# when numpy gains an aligned allocator the tests could be enabled again
+if ((intp().dtype.itemsize != 4 or clongdouble().dtype.alignment <= 8) and
+        sys.platform != 'win32'):
+    _type_names.extend(['LONGDOUBLE', 'CDOUBLE', 'CLONGDOUBLE'])
+    _cast_dict['LONGDOUBLE'] = _cast_dict['LONG'] + \
+        ['ULONG', 'FLOAT', 'DOUBLE', 'LONGDOUBLE']
+    _cast_dict['CLONGDOUBLE'] = _cast_dict['LONGDOUBLE'] + \
+        ['CFLOAT', 'CDOUBLE', 'CLONGDOUBLE']
+    _cast_dict['CDOUBLE'] = _cast_dict['DOUBLE'] + ['CFLOAT', 'CDOUBLE']
+
+
+class Type:
+    _type_cache = {}
+
+    def __new__(cls, name):
+        if isinstance(name, dtype):
+            dtype0 = name
+            name = None
+            for n, i in typeinfo.items():
+                if not isinstance(i, type) and dtype0.type is i.type:
+                    name = n
+                    break
+        obj = cls._type_cache.get(name.upper(), None)
+        if obj is not None:
+            return obj
+        obj = object.__new__(cls)
+        obj._init(name)
+        cls._type_cache[name.upper()] = obj
+        return obj
+
+    def _init(self, name):
+        self.NAME = name.upper()
+        info = typeinfo[self.NAME]
+        self.type_num = getattr(wrap, 'NPY_' + self.NAME)
+        assert_equal(self.type_num, info.num)
+        self.dtype = info.type
+        self.elsize = info.bits / 8
+        self.dtypechar = info.char
+
+    def cast_types(self):
+        return [self.__class__(_m) for _m in _cast_dict[self.NAME]]
+
+    def all_types(self):
+        return [self.__class__(_m) for _m in _type_names]
+
+    def smaller_types(self):
+        bits = typeinfo[self.NAME].alignment
+        types = []
+        for name in _type_names:
+            if typeinfo[name].alignment < bits:
+                types.append(Type(name))
+        return types
+
+    def equal_types(self):
+        bits = typeinfo[self.NAME].alignment
+        types = []
+        for name in _type_names:
+            if name == self.NAME:
+                continue
+            if typeinfo[name].alignment == bits:
+                types.append(Type(name))
+        return types
+
+    def larger_types(self):
+        bits = typeinfo[self.NAME].alignment
+        types = []
+        for name in _type_names:
+            if typeinfo[name].alignment > bits:
+                types.append(Type(name))
+        return types
+
+
+class Array:
+
+    def __init__(self, typ, dims, intent, obj):
+        self.type = typ
+        self.dims = dims
+        self.intent = intent
+        self.obj_copy = copy.deepcopy(obj)
+        self.obj = obj
+
+        # arr.dtypechar may be different from typ.dtypechar
+        self.arr = wrap.call(typ.type_num, dims, intent.flags, obj)
+
+        assert_(isinstance(self.arr, ndarray), repr(type(self.arr)))
+
+        self.arr_attr = wrap.array_attrs(self.arr)
+
+        if len(dims) > 1:
+            if self.intent.is_intent('c'):
+                assert_(intent.flags & wrap.F2PY_INTENT_C)
+                assert_(not self.arr.flags['FORTRAN'],
+                        repr((self.arr.flags, getattr(obj, 'flags', None))))
+                assert_(self.arr.flags['CONTIGUOUS'])
+                assert_(not self.arr_attr[6] & wrap.FORTRAN)
+            else:
+                assert_(not intent.flags & wrap.F2PY_INTENT_C)
+                assert_(self.arr.flags['FORTRAN'])
+                assert_(not self.arr.flags['CONTIGUOUS'])
+                assert_(self.arr_attr[6] & wrap.FORTRAN)
+
+        if obj is None:
+            self.pyarr = None
+            self.pyarr_attr = None
+            return
+
+        if intent.is_intent('cache'):
+            assert_(isinstance(obj, ndarray), repr(type(obj)))
+            self.pyarr = array(obj).reshape(*dims).copy()
+        else:
+            self.pyarr = array(array(obj, dtype=typ.dtypechar).reshape(*dims),
+                               order=self.intent.is_intent('c') and 'C' or 'F')
+            assert_(self.pyarr.dtype == typ,
+                    repr((self.pyarr.dtype, typ)))
+        assert_(self.pyarr.flags['OWNDATA'], (obj, intent))
+        self.pyarr_attr = wrap.array_attrs(self.pyarr)
+
+        if len(dims) > 1:
+            if self.intent.is_intent('c'):
+                assert_(not self.pyarr.flags['FORTRAN'])
+                assert_(self.pyarr.flags['CONTIGUOUS'])
+                assert_(not self.pyarr_attr[6] & wrap.FORTRAN)
+            else:
+                assert_(self.pyarr.flags['FORTRAN'])
+                assert_(not self.pyarr.flags['CONTIGUOUS'])
+                assert_(self.pyarr_attr[6] & wrap.FORTRAN)
+
+        assert_(self.arr_attr[1] == self.pyarr_attr[1])  # nd
+        assert_(self.arr_attr[2] == self.pyarr_attr[2])  # dimensions
+        if self.arr_attr[1] <= 1:
+            assert_(self.arr_attr[3] == self.pyarr_attr[3],
+                    repr((self.arr_attr[3], self.pyarr_attr[3],
+                          self.arr.tobytes(), self.pyarr.tobytes())))  # strides
+        assert_(self.arr_attr[5][-2:] == self.pyarr_attr[5][-2:],
+                repr((self.arr_attr[5], self.pyarr_attr[5])))  # descr
+        assert_(self.arr_attr[6] == self.pyarr_attr[6],
+                repr((self.arr_attr[6], self.pyarr_attr[6],
+                      flags2names(0 * self.arr_attr[6] - self.pyarr_attr[6]),
+                      flags2names(self.arr_attr[6]), intent)))  # flags
+
+        if intent.is_intent('cache'):
+            assert_(self.arr_attr[5][3] >= self.type.elsize,
+                    repr((self.arr_attr[5][3], self.type.elsize)))
+        else:
+            assert_(self.arr_attr[5][3] == self.type.elsize,
+                    repr((self.arr_attr[5][3], self.type.elsize)))
+        assert_(self.arr_equal(self.pyarr, self.arr))
+
+        if isinstance(self.obj, ndarray):
+            if typ.elsize == Type(obj.dtype).elsize:
+                if not intent.is_intent('copy') and self.arr_attr[1] <= 1:
+                    assert_(self.has_shared_memory())
+
+    def arr_equal(self, arr1, arr2):
+        if arr1.shape != arr2.shape:
+            return False
+        s = arr1 == arr2
+        return alltrue(s.flatten())
+
+    def __str__(self):
+        return str(self.arr)
+
+    def has_shared_memory(self):
+        """Check that created array shares data with input array.
+        """
+        if self.obj is self.arr:
+            return True
+        if not isinstance(self.obj, ndarray):
+            return False
+        obj_attr = wrap.array_attrs(self.obj)
+        return obj_attr[0] == self.arr_attr[0]
+
+
+class TestIntent:
+
+    def test_in_out(self):
+        assert_equal(str(intent.in_.out), 'intent(in,out)')
+        assert_(intent.in_.c.is_intent('c'))
+        assert_(not intent.in_.c.is_intent_exact('c'))
+        assert_(intent.in_.c.is_intent_exact('c', 'in'))
+        assert_(intent.in_.c.is_intent_exact('in', 'c'))
+        assert_(not intent.in_.is_intent('c'))
+
+
+class TestSharedMemory:
+    num2seq = [1, 2]
+    num23seq = [[1, 2, 3], [4, 5, 6]]
+
+    @pytest.fixture(autouse=True, scope='class', params=_type_names)
+    def setup_type(self, request):
+        request.cls.type = Type(request.param)
+        request.cls.array = lambda self, dims, intent, obj: \
+            Array(Type(request.param), dims, intent, obj)
+
+    def test_in_from_2seq(self):
+        a = self.array([2], intent.in_, self.num2seq)
+        assert_(not a.has_shared_memory())
+
+    def test_in_from_2casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num2seq, dtype=t.dtype)
+            a = self.array([len(self.num2seq)], intent.in_, obj)
+            if t.elsize == self.type.elsize:
+                assert_(
+                    a.has_shared_memory(), repr((self.type.dtype, t.dtype)))
+            else:
+                assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_inout_2seq(self):
+        obj = array(self.num2seq, dtype=self.type.dtype)
+        a = self.array([len(self.num2seq)], intent.inout, obj)
+        assert_(a.has_shared_memory())
+
+        try:
+            a = self.array([2], intent.in_.inout, self.num2seq)
+        except TypeError as msg:
+            if not str(msg).startswith('failed to initialize intent'
+                                       '(inout|inplace|cache) array'):
+                raise
+        else:
+            raise SystemError('intent(inout) should have failed on sequence')
+
+    def test_f_inout_23seq(self):
+        obj = array(self.num23seq, dtype=self.type.dtype, order='F')
+        shape = (len(self.num23seq), len(self.num23seq[0]))
+        a = self.array(shape, intent.in_.inout, obj)
+        assert_(a.has_shared_memory())
+
+        obj = array(self.num23seq, dtype=self.type.dtype, order='C')
+        shape = (len(self.num23seq), len(self.num23seq[0]))
+        try:
+            a = self.array(shape, intent.in_.inout, obj)
+        except ValueError as msg:
+            if not str(msg).startswith('failed to initialize intent'
+                                       '(inout) array'):
+                raise
+        else:
+            raise SystemError(
+                'intent(inout) should have failed on improper array')
+
+    def test_c_inout_23seq(self):
+        obj = array(self.num23seq, dtype=self.type.dtype)
+        shape = (len(self.num23seq), len(self.num23seq[0]))
+        a = self.array(shape, intent.in_.c.inout, obj)
+        assert_(a.has_shared_memory())
+
+    def test_in_copy_from_2casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num2seq, dtype=t.dtype)
+            a = self.array([len(self.num2seq)], intent.in_.copy, obj)
+            assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_c_in_from_23seq(self):
+        a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                       intent.in_, self.num23seq)
+        assert_(not a.has_shared_memory())
+
+    def test_in_from_23casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num23seq, dtype=t.dtype)
+            a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                           intent.in_, obj)
+            assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_f_in_from_23casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num23seq, dtype=t.dtype, order='F')
+            a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                           intent.in_, obj)
+            if t.elsize == self.type.elsize:
+                assert_(a.has_shared_memory(), repr(t.dtype))
+            else:
+                assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_c_in_from_23casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num23seq, dtype=t.dtype)
+            a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                           intent.in_.c, obj)
+            if t.elsize == self.type.elsize:
+                assert_(a.has_shared_memory(), repr(t.dtype))
+            else:
+                assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_f_copy_in_from_23casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num23seq, dtype=t.dtype, order='F')
+            a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                           intent.in_.copy, obj)
+            assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_c_copy_in_from_23casttype(self):
+        for t in self.type.cast_types():
+            obj = array(self.num23seq, dtype=t.dtype)
+            a = self.array([len(self.num23seq), len(self.num23seq[0])],
+                           intent.in_.c.copy, obj)
+            assert_(not a.has_shared_memory(), repr(t.dtype))
+
+    def test_in_cache_from_2casttype(self):
+        for t in self.type.all_types():
+            if t.elsize != self.type.elsize:
+                continue
+            obj = array(self.num2seq, dtype=t.dtype)
+            shape = (len(self.num2seq),)
+            a = self.array(shape, intent.in_.c.cache, obj)
+            assert_(a.has_shared_memory(), repr(t.dtype))
+
+            a = self.array(shape, intent.in_.cache, obj)
+            assert_(a.has_shared_memory(), repr(t.dtype))
+
+            obj = array(self.num2seq, dtype=t.dtype, order='F')
+            a = self.array(shape, intent.in_.c.cache, obj)
+            assert_(a.has_shared_memory(), repr(t.dtype))
+
+            a = self.array(shape, intent.in_.cache, obj)
+            assert_(a.has_shared_memory(), repr(t.dtype))
+
+            try:
+                a = self.array(shape, intent.in_.cache, obj[::-1])
+            except ValueError as msg:
+                if not str(msg).startswith('failed to initialize'
+                                           ' intent(cache) array'):
+                    raise
+            else:
+                raise SystemError(
+                    'intent(cache) should have failed on multisegmented array')
+
+    def test_in_cache_from_2casttype_failure(self):
+        for t in self.type.all_types():
+            if t.elsize >= self.type.elsize:
+                continue
+            obj = array(self.num2seq, dtype=t.dtype)
+            shape = (len(self.num2seq),)
+            try:
+                self.array(shape, intent.in_.cache, obj)  # Should succeed
+            except ValueError as msg:
+                if not str(msg).startswith('failed to initialize'
+                                           ' intent(cache) array'):
+                    raise
+            else:
+                raise SystemError(
+                    'intent(cache) should have failed on smaller array')
+
+    def test_cache_hidden(self):
+        shape = (2,)
+        a = self.array(shape, intent.cache.hide, None)
+        assert_(a.arr.shape == shape)
+
+        shape = (2, 3)
+        a = self.array(shape, intent.cache.hide, None)
+        assert_(a.arr.shape == shape)
+
+        shape = (-1, 3)
+        try:
+            a = self.array(shape, intent.cache.hide, None)
+        except ValueError as msg:
+            if not str(msg).startswith('failed to create intent'
+                                       '(cache|hide)|optional array'):
+                raise
+        else:
+            raise SystemError(
+                'intent(cache) should have failed on undefined dimensions')
+
+    def test_hidden(self):
+        shape = (2,)
+        a = self.array(shape, intent.hide, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+
+        shape = (2, 3)
+        a = self.array(shape, intent.hide, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+        assert_(a.arr.flags['FORTRAN'] and not a.arr.flags['CONTIGUOUS'])
+
+        shape = (2, 3)
+        a = self.array(shape, intent.c.hide, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+        assert_(not a.arr.flags['FORTRAN'] and a.arr.flags['CONTIGUOUS'])
+
+        shape = (-1, 3)
+        try:
+            a = self.array(shape, intent.hide, None)
+        except ValueError as msg:
+            if not str(msg).startswith('failed to create intent'
+                                       '(cache|hide)|optional array'):
+                raise
+        else:
+            raise SystemError('intent(hide) should have failed'
+                              ' on undefined dimensions')
+
+    def test_optional_none(self):
+        shape = (2,)
+        a = self.array(shape, intent.optional, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+
+        shape = (2, 3)
+        a = self.array(shape, intent.optional, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+        assert_(a.arr.flags['FORTRAN'] and not a.arr.flags['CONTIGUOUS'])
+
+        shape = (2, 3)
+        a = self.array(shape, intent.c.optional, None)
+        assert_(a.arr.shape == shape)
+        assert_(a.arr_equal(a.arr, zeros(shape, dtype=self.type.dtype)))
+        assert_(not a.arr.flags['FORTRAN'] and a.arr.flags['CONTIGUOUS'])
+
+    def test_optional_from_2seq(self):
+        obj = self.num2seq
+        shape = (len(obj),)
+        a = self.array(shape, intent.optional, obj)
+        assert_(a.arr.shape == shape)
+        assert_(not a.has_shared_memory())
+
+    def test_optional_from_23seq(self):
+        obj = self.num23seq
+        shape = (len(obj), len(obj[0]))
+        a = self.array(shape, intent.optional, obj)
+        assert_(a.arr.shape == shape)
+        assert_(not a.has_shared_memory())
+
+        a = self.array(shape, intent.optional.c, obj)
+        assert_(a.arr.shape == shape)
+        assert_(not a.has_shared_memory())
+
+    def test_inplace(self):
+        obj = array(self.num23seq, dtype=self.type.dtype)
+        assert_(not obj.flags['FORTRAN'] and obj.flags['CONTIGUOUS'])
+        shape = obj.shape
+        a = self.array(shape, intent.inplace, obj)
+        assert_(obj[1][2] == a.arr[1][2], repr((obj, a.arr)))
+        a.arr[1][2] = 54
+        assert_(obj[1][2] == a.arr[1][2] ==
+                array(54, dtype=self.type.dtype), repr((obj, a.arr)))
+        assert_(a.arr is obj)
+        assert_(obj.flags['FORTRAN'])  # obj attributes are changed inplace!
+        assert_(not obj.flags['CONTIGUOUS'])
+
+    def test_inplace_from_casttype(self):
+        for t in self.type.cast_types():
+            if t is self.type:
+                continue
+            obj = array(self.num23seq, dtype=t.dtype)
+            assert_(obj.dtype.type == t.dtype)
+            assert_(obj.dtype.type is not self.type.dtype)
+            assert_(not obj.flags['FORTRAN'] and obj.flags['CONTIGUOUS'])
+            shape = obj.shape
+            a = self.array(shape, intent.inplace, obj)
+            assert_(obj[1][2] == a.arr[1][2], repr((obj, a.arr)))
+            a.arr[1][2] = 54
+            assert_(obj[1][2] == a.arr[1][2] ==
+                    array(54, dtype=self.type.dtype), repr((obj, a.arr)))
+            assert_(a.arr is obj)
+            assert_(obj.flags['FORTRAN'])  # obj attributes changed inplace!
+            assert_(not obj.flags['CONTIGUOUS'])
+            assert_(obj.dtype.type is self.type.dtype)  # obj changed inplace!
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_assumed_shape.py b/venv/Lib/site-packages/numpy/f2py/tests/test_assumed_shape.py
new file mode 100644
index 000000000..dfc252660
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_assumed_shape.py
@@ -0,0 +1,53 @@
+import os
+import pytest
+import tempfile
+
+from numpy.testing import assert_
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestAssumedShapeSumExample(util.F2PyTest):
+    sources = [_path('src', 'assumed_shape', 'foo_free.f90'),
+               _path('src', 'assumed_shape', 'foo_use.f90'),
+               _path('src', 'assumed_shape', 'precision.f90'),
+               _path('src', 'assumed_shape', 'foo_mod.f90'),
+               _path('src', 'assumed_shape', '.f2py_f2cmap'),
+               ]
+
+    @pytest.mark.slow
+    def test_all(self):
+        r = self.module.fsum([1, 2])
+        assert_(r == 3, repr(r))
+        r = self.module.sum([1, 2])
+        assert_(r == 3, repr(r))
+        r = self.module.sum_with_use([1, 2])
+        assert_(r == 3, repr(r))
+
+        r = self.module.mod.sum([1, 2])
+        assert_(r == 3, repr(r))
+        r = self.module.mod.fsum([1, 2])
+        assert_(r == 3, repr(r))
+
+
+class TestF2cmapOption(TestAssumedShapeSumExample):
+    def setup(self):
+        # Use a custom file name for .f2py_f2cmap
+        self.sources = list(self.sources)
+        f2cmap_src = self.sources.pop(-1)
+
+        self.f2cmap_file = tempfile.NamedTemporaryFile(delete=False)
+        with open(f2cmap_src, 'rb') as f:
+            self.f2cmap_file.write(f.read())
+        self.f2cmap_file.close()
+
+        self.sources.append(self.f2cmap_file.name)
+        self.options = ["--f2cmap", self.f2cmap_file.name]
+
+        super(TestF2cmapOption, self).setup()
+
+    def teardown(self):
+        os.unlink(self.f2cmap_file.name)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_block_docstring.py b/venv/Lib/site-packages/numpy/f2py/tests/test_block_docstring.py
new file mode 100644
index 000000000..e431f5ba6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_block_docstring.py
@@ -0,0 +1,23 @@
+import sys
+import pytest
+from . import util
+
+from numpy.testing import assert_equal, IS_PYPY
+
+class TestBlockDocString(util.F2PyTest):
+    code = """
+      SUBROUTINE FOO()
+      INTEGER BAR(2, 3)
+
+      COMMON  /BLOCK/ BAR
+      RETURN
+      END
+    """
+
+    @pytest.mark.skipif(sys.platform=='win32',
+                        reason='Fails with MinGW64 Gfortran (Issue #9673)')
+    @pytest.mark.xfail(IS_PYPY,
+                       reason="PyPy cannot modify tp_doc after PyType_Ready")
+    def test_block_docstring(self):
+        expected = "'i'-array(2,3)\n"
+        assert_equal(self.module.block.__doc__, expected)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_callback.py b/venv/Lib/site-packages/numpy/f2py/tests/test_callback.py
new file mode 100644
index 000000000..4e29ab9fc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_callback.py
@@ -0,0 +1,163 @@
+import math
+import textwrap
+import sys
+import pytest
+
+import numpy as np
+from numpy.testing import assert_, assert_equal, IS_PYPY
+from . import util
+
+
+class TestF77Callback(util.F2PyTest):
+    code = """
+       subroutine t(fun,a)
+       integer a
+cf2py  intent(out) a
+       external fun
+       call fun(a)
+       end
+
+       subroutine func(a)
+cf2py  intent(in,out) a
+       integer a
+       a = a + 11
+       end
+
+       subroutine func0(a)
+cf2py  intent(out) a
+       integer a
+       a = 11
+       end
+
+       subroutine t2(a)
+cf2py  intent(callback) fun
+       integer a
+cf2py  intent(out) a
+       external fun
+       call fun(a)
+       end
+
+       subroutine string_callback(callback, a)
+       external callback
+       double precision callback
+       double precision a
+       character*1 r
+cf2py  intent(out) a
+       r = 'r'
+       a = callback(r)
+       end
+
+       subroutine string_callback_array(callback, cu, lencu, a)
+       external callback
+       integer callback
+       integer lencu
+       character*8 cu(lencu)
+       integer a
+cf2py  intent(out) a
+
+       a = callback(cu, lencu)
+       end
+    """
+
+    @pytest.mark.parametrize('name', 't,t2'.split(','))
+    def test_all(self, name):
+        self.check_function(name)
+
+    @pytest.mark.xfail(IS_PYPY,
+                       reason="PyPy cannot modify tp_doc after PyType_Ready")
+    def test_docstring(self):
+        expected = textwrap.dedent("""\
+        a = t(fun,[fun_extra_args])
+
+        Wrapper for ``t``.
+
+        Parameters
+        ----------
+        fun : call-back function
+
+        Other Parameters
+        ----------------
+        fun_extra_args : input tuple, optional
+            Default: ()
+
+        Returns
+        -------
+        a : int
+
+        Notes
+        -----
+        Call-back functions::
+
+          def fun(): return a
+          Return objects:
+            a : int
+        """)
+        assert_equal(self.module.t.__doc__, expected)
+
+    def check_function(self, name):
+        t = getattr(self.module, name)
+        r = t(lambda: 4)
+        assert_(r == 4, repr(r))
+        r = t(lambda a: 5, fun_extra_args=(6,))
+        assert_(r == 5, repr(r))
+        r = t(lambda a: a, fun_extra_args=(6,))
+        assert_(r == 6, repr(r))
+        r = t(lambda a: 5 + a, fun_extra_args=(7,))
+        assert_(r == 12, repr(r))
+        r = t(lambda a: math.degrees(a), fun_extra_args=(math.pi,))
+        assert_(r == 180, repr(r))
+        r = t(math.degrees, fun_extra_args=(math.pi,))
+        assert_(r == 180, repr(r))
+
+        r = t(self.module.func, fun_extra_args=(6,))
+        assert_(r == 17, repr(r))
+        r = t(self.module.func0)
+        assert_(r == 11, repr(r))
+        r = t(self.module.func0._cpointer)
+        assert_(r == 11, repr(r))
+
+        class A:
+
+            def __call__(self):
+                return 7
+
+            def mth(self):
+                return 9
+        a = A()
+        r = t(a)
+        assert_(r == 7, repr(r))
+        r = t(a.mth)
+        assert_(r == 9, repr(r))
+
+    @pytest.mark.skipif(sys.platform=='win32',
+                        reason='Fails with MinGW64 Gfortran (Issue #9673)')
+    def test_string_callback(self):
+
+        def callback(code):
+            if code == 'r':
+                return 0
+            else:
+                return 1
+
+        f = getattr(self.module, 'string_callback')
+        r = f(callback)
+        assert_(r == 0, repr(r))
+
+    @pytest.mark.skipif(sys.platform=='win32',
+                        reason='Fails with MinGW64 Gfortran (Issue #9673)')
+    def test_string_callback_array(self):
+        # See gh-10027
+        cu = np.zeros((1, 8), 'S1')
+
+        def callback(cu, lencu):
+            if cu.shape != (lencu, 8):
+                return 1
+            if cu.dtype != 'S1':
+                return 2
+            if not np.all(cu == b''):
+                return 3
+            return 0
+
+        f = getattr(self.module, 'string_callback_array')
+        res = f(callback, cu, len(cu))
+        assert_(res == 0, repr(res))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_common.py b/venv/Lib/site-packages/numpy/f2py/tests/test_common.py
new file mode 100644
index 000000000..e4bf35504
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_common.py
@@ -0,0 +1,25 @@
+import os
+import sys
+import pytest
+
+import numpy as np
+from . import util
+
+from numpy.testing import assert_array_equal
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+class TestCommonBlock(util.F2PyTest):
+    sources = [_path('src', 'common', 'block.f')]
+
+    @pytest.mark.skipif(sys.platform=='win32',
+                        reason='Fails with MinGW64 Gfortran (Issue #9673)')
+    def test_common_block(self):
+        self.module.initcb()
+        assert_array_equal(self.module.block.long_bn,
+                           np.array(1.0, dtype=np.float64))
+        assert_array_equal(self.module.block.string_bn,
+                           np.array('2', dtype='|S1'))
+        assert_array_equal(self.module.block.ok,
+                           np.array(3, dtype=np.int32))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_compile_function.py b/venv/Lib/site-packages/numpy/f2py/tests/test_compile_function.py
new file mode 100644
index 000000000..f76fd6448
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_compile_function.py
@@ -0,0 +1,125 @@
+"""See https://github.com/numpy/numpy/pull/11937.
+
+"""
+import sys
+import os
+import uuid
+from importlib import import_module
+import pytest
+
+import numpy.f2py
+
+from numpy.testing import assert_equal
+from . import util
+
+
+def setup_module():
+    if not util.has_c_compiler():
+        pytest.skip("Needs C compiler")
+    if not util.has_f77_compiler():
+        pytest.skip('Needs FORTRAN 77 compiler')
+
+
+# extra_args can be a list (since gh-11937) or string.
+# also test absence of extra_args
+@pytest.mark.parametrize(
+    "extra_args", [['--noopt', '--debug'], '--noopt --debug', '']
+    )
+@pytest.mark.leaks_references(reason="Imported module seems never deleted.")
+def test_f2py_init_compile(extra_args):
+    # flush through the f2py __init__ compile() function code path as a
+    # crude test for input handling following migration from
+    # exec_command() to subprocess.check_output() in gh-11937
+
+    # the Fortran 77 syntax requires 6 spaces before any commands, but
+    # more space may be added/
+    fsource =  """
+        integer function foo()
+        foo = 10 + 5
+        return
+        end
+    """
+    # use various helper functions in util.py to enable robust build /
+    # compile and reimport cycle in test suite
+    moddir = util.get_module_dir()
+    modname = util.get_temp_module_name()
+
+    cwd = os.getcwd()
+    target = os.path.join(moddir, str(uuid.uuid4()) + '.f')
+    # try running compile() with and without a source_fn provided so
+    # that the code path where a temporary file for writing Fortran
+    # source is created is also explored
+    for source_fn in [target, None]:
+        # mimic the path changing behavior used by build_module() in
+        # util.py, but don't actually use build_module() because it has
+        # its own invocation of subprocess that circumvents the
+        # f2py.compile code block under test
+        try:
+            os.chdir(moddir)
+            ret_val = numpy.f2py.compile(
+                fsource,
+                modulename=modname,
+                extra_args=extra_args,
+                source_fn=source_fn
+                )
+        finally:
+            os.chdir(cwd)
+
+        # check for compile success return value
+        assert_equal(ret_val, 0)
+
+        # we are not currently able to import the Python-Fortran
+        # interface module on Windows / Appveyor, even though we do get
+        # successful compilation on that platform with Python 3.x
+        if sys.platform != 'win32':
+            # check for sensible result of Fortran function; that means
+            # we can import the module name in Python and retrieve the
+            # result of the sum operation
+            return_check = import_module(modname)
+            calc_result = return_check.foo()
+            assert_equal(calc_result, 15)
+            # Removal from sys.modules, is not as such necessary. Even with
+            # removal, the module (dict) stays alive.
+            del sys.modules[modname]
+
+
+def test_f2py_init_compile_failure():
+    # verify an appropriate integer status value returned by
+    # f2py.compile() when invalid Fortran is provided
+    ret_val = numpy.f2py.compile(b"invalid")
+    assert_equal(ret_val, 1)
+
+
+def test_f2py_init_compile_bad_cmd():
+    # verify that usage of invalid command in f2py.compile() returns
+    # status value of 127 for historic consistency with exec_command()
+    # error handling
+
+    # patch the sys Python exe path temporarily to induce an OSError
+    # downstream NOTE: how bad of an idea is this patching?
+    try:
+        temp = sys.executable
+        sys.executable = 'does not exist'
+
+        # the OSError should take precedence over invalid Fortran
+        ret_val = numpy.f2py.compile(b"invalid")
+        assert_equal(ret_val, 127)
+    finally:
+        sys.executable = temp
+
+
+@pytest.mark.parametrize('fsource',
+        ['program test_f2py\nend program test_f2py',
+         b'program test_f2py\nend program test_f2py',])
+def test_compile_from_strings(tmpdir, fsource):
+    # Make sure we can compile str and bytes gh-12796
+    cwd = os.getcwd()
+    try:
+        os.chdir(str(tmpdir))
+        ret_val = numpy.f2py.compile(
+                fsource,
+                modulename='test_compile_from_strings',
+                extension='.f90')
+        assert_equal(ret_val, 0)
+    finally:
+        os.chdir(cwd)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_crackfortran.py b/venv/Lib/site-packages/numpy/f2py/tests/test_crackfortran.py
new file mode 100644
index 000000000..735804024
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_crackfortran.py
@@ -0,0 +1,88 @@
+import numpy as np
+from numpy.testing import assert_array_equal
+from . import util
+from numpy.f2py import crackfortran
+import tempfile
+import textwrap
+
+
+class TestNoSpace(util.F2PyTest):
+    # issue gh-15035: add handling for endsubroutine, endfunction with no space
+    # between "end" and the block name
+    code = """
+        subroutine subb(k)
+          real(8), intent(inout) :: k(:)
+          k=k+1
+        endsubroutine
+
+        subroutine subc(w,k)
+          real(8), intent(in) :: w(:)
+          real(8), intent(out) :: k(size(w))
+          k=w+1
+        endsubroutine
+
+        function t0(value)
+          character value
+          character t0
+          t0 = value
+        endfunction
+    """
+
+    def test_module(self):
+        k = np.array([1, 2, 3], dtype=np.float64)
+        w = np.array([1, 2, 3], dtype=np.float64)
+        self.module.subb(k)
+        assert_array_equal(k, w + 1)
+        self.module.subc([w, k])
+        assert_array_equal(k, w + 1)
+        assert self.module.t0(23) == b'2'
+
+class TestPublicPrivate():
+    def test_defaultPrivate(self, tmp_path):
+        f_path = tmp_path / "mod.f90"
+        with f_path.open('w') as ff:
+            ff.write(textwrap.dedent("""\
+            module foo
+              private
+              integer :: a
+              public :: setA
+              integer :: b
+            contains
+              subroutine setA(v)
+                integer, intent(in) :: v
+                a = v
+              end subroutine setA
+            end module foo
+            """))
+        mod = crackfortran.crackfortran([str(f_path)])
+        assert len(mod) == 1
+        mod = mod[0]
+        assert 'private' in mod['vars']['a']['attrspec']
+        assert 'public' not in mod['vars']['a']['attrspec']
+        assert 'private' in mod['vars']['b']['attrspec']
+        assert 'public' not in mod['vars']['b']['attrspec']
+        assert 'private' not in mod['vars']['seta']['attrspec']
+        assert 'public' in mod['vars']['seta']['attrspec']
+
+    def test_defaultPublic(self, tmp_path):
+        f_path = tmp_path / "mod.f90"
+        with f_path.open('w') as ff:
+            ff.write(textwrap.dedent("""\
+            module foo
+              public
+              integer, private :: a
+              public :: setA
+            contains
+              subroutine setA(v)
+                integer, intent(in) :: v
+                a = v
+              end subroutine setA
+            end module foo
+            """))
+        mod = crackfortran.crackfortran([str(f_path)])
+        assert len(mod) == 1
+        mod = mod[0]
+        assert 'private' in mod['vars']['a']['attrspec']
+        assert 'public' not in mod['vars']['a']['attrspec']
+        assert 'private' not in mod['vars']['seta']['attrspec']
+        assert 'public' in mod['vars']['seta']['attrspec']
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_kind.py b/venv/Lib/site-packages/numpy/f2py/tests/test_kind.py
new file mode 100644
index 000000000..a7e2b28ed
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_kind.py
@@ -0,0 +1,32 @@
+import os
+import pytest
+
+from numpy.testing import assert_
+from numpy.f2py.crackfortran import (
+    _selected_int_kind_func as selected_int_kind,
+    _selected_real_kind_func as selected_real_kind
+    )
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestKind(util.F2PyTest):
+    sources = [_path('src', 'kind', 'foo.f90')]
+
+    @pytest.mark.slow
+    def test_all(self):
+        selectedrealkind = self.module.selectedrealkind
+        selectedintkind = self.module.selectedintkind
+
+        for i in range(40):
+            assert_(selectedintkind(i) in [selected_int_kind(i), -1],
+                    'selectedintkind(%s): expected %r but got %r' %
+                    (i, selected_int_kind(i), selectedintkind(i)))
+
+        for i in range(20):
+            assert_(selectedrealkind(i) in [selected_real_kind(i), -1],
+                    'selectedrealkind(%s): expected %r but got %r' %
+                    (i, selected_real_kind(i), selectedrealkind(i)))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_mixed.py b/venv/Lib/site-packages/numpy/f2py/tests/test_mixed.py
new file mode 100644
index 000000000..04266ca5b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_mixed.py
@@ -0,0 +1,35 @@
+import os
+import textwrap
+import pytest
+
+from numpy.testing import assert_, assert_equal, IS_PYPY
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestMixed(util.F2PyTest):
+    sources = [_path('src', 'mixed', 'foo.f'),
+               _path('src', 'mixed', 'foo_fixed.f90'),
+               _path('src', 'mixed', 'foo_free.f90')]
+
+    def test_all(self):
+        assert_(self.module.bar11() == 11)
+        assert_(self.module.foo_fixed.bar12() == 12)
+        assert_(self.module.foo_free.bar13() == 13)
+
+    @pytest.mark.xfail(IS_PYPY,
+                       reason="PyPy cannot modify tp_doc after PyType_Ready")
+    def test_docstring(self):
+        expected = textwrap.dedent("""\
+        a = bar11()
+
+        Wrapper for ``bar11``.
+
+        Returns
+        -------
+        a : int
+        """)
+        assert_equal(self.module.bar11.__doc__, expected)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_parameter.py b/venv/Lib/site-packages/numpy/f2py/tests/test_parameter.py
new file mode 100644
index 000000000..b61827169
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_parameter.py
@@ -0,0 +1,116 @@
+import os
+import pytest
+
+import numpy as np
+from numpy.testing import assert_raises, assert_equal
+
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestParameters(util.F2PyTest):
+    # Check that intent(in out) translates as intent(inout)
+    sources = [_path('src', 'parameter', 'constant_real.f90'),
+               _path('src', 'parameter', 'constant_integer.f90'),
+               _path('src', 'parameter', 'constant_both.f90'),
+               _path('src', 'parameter', 'constant_compound.f90'),
+               _path('src', 'parameter', 'constant_non_compound.f90'),
+    ]
+
+    @pytest.mark.slow
+    def test_constant_real_single(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float32)[::2]
+        assert_raises(ValueError, self.module.foo_single, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float32)
+        self.module.foo_single(x)
+        assert_equal(x, [0 + 1 + 2*3, 1, 2])
+
+    @pytest.mark.slow
+    def test_constant_real_double(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float64)[::2]
+        assert_raises(ValueError, self.module.foo_double, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float64)
+        self.module.foo_double(x)
+        assert_equal(x, [0 + 1 + 2*3, 1, 2])
+
+    @pytest.mark.slow
+    def test_constant_compound_int(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.int32)[::2]
+        assert_raises(ValueError, self.module.foo_compound_int, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.int32)
+        self.module.foo_compound_int(x)
+        assert_equal(x, [0 + 1 + 2*6, 1, 2])
+
+    @pytest.mark.slow
+    def test_constant_non_compound_int(self):
+        # check values
+        x = np.arange(4, dtype=np.int32)
+        self.module.foo_non_compound_int(x)
+        assert_equal(x, [0 + 1 + 2 + 3*4, 1, 2, 3])
+
+    @pytest.mark.slow
+    def test_constant_integer_int(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.int32)[::2]
+        assert_raises(ValueError, self.module.foo_int, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.int32)
+        self.module.foo_int(x)
+        assert_equal(x, [0 + 1 + 2*3, 1, 2])
+
+    @pytest.mark.slow
+    def test_constant_integer_long(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.int64)[::2]
+        assert_raises(ValueError, self.module.foo_long, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.int64)
+        self.module.foo_long(x)
+        assert_equal(x, [0 + 1 + 2*3, 1, 2])
+
+    @pytest.mark.slow
+    def test_constant_both(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float64)[::2]
+        assert_raises(ValueError, self.module.foo, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float64)
+        self.module.foo(x)
+        assert_equal(x, [0 + 1*3*3 + 2*3*3, 1*3, 2*3])
+
+    @pytest.mark.slow
+    def test_constant_no(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float64)[::2]
+        assert_raises(ValueError, self.module.foo_no, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float64)
+        self.module.foo_no(x)
+        assert_equal(x, [0 + 1*3*3 + 2*3*3, 1*3, 2*3])
+
+    @pytest.mark.slow
+    def test_constant_sum(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float64)[::2]
+        assert_raises(ValueError, self.module.foo_sum, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float64)
+        self.module.foo_sum(x)
+        assert_equal(x, [0 + 1*3*3 + 2*3*3, 1*3, 2*3])
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_quoted_character.py b/venv/Lib/site-packages/numpy/f2py/tests/test_quoted_character.py
new file mode 100644
index 000000000..20c77666c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_quoted_character.py
@@ -0,0 +1,32 @@
+"""See https://github.com/numpy/numpy/pull/10676.
+
+"""
+import sys
+import pytest
+
+from numpy.testing import assert_equal
+from . import util
+
+
+class TestQuotedCharacter(util.F2PyTest):
+    code = """
+      SUBROUTINE FOO(OUT1, OUT2, OUT3, OUT4, OUT5, OUT6)
+      CHARACTER SINGLE, DOUBLE, SEMICOL, EXCLA, OPENPAR, CLOSEPAR
+      PARAMETER (SINGLE="'", DOUBLE='"', SEMICOL=';', EXCLA="!",
+     1           OPENPAR="(", CLOSEPAR=")")
+      CHARACTER OUT1, OUT2, OUT3, OUT4, OUT5, OUT6
+Cf2py intent(out) OUT1, OUT2, OUT3, OUT4, OUT5, OUT6
+      OUT1 = SINGLE
+      OUT2 = DOUBLE
+      OUT3 = SEMICOL
+      OUT4 = EXCLA
+      OUT5 = OPENPAR
+      OUT6 = CLOSEPAR
+      RETURN
+      END
+    """
+
+    @pytest.mark.skipif(sys.platform=='win32',
+                        reason='Fails with MinGW64 Gfortran (Issue #9673)')
+    def test_quoted_character(self):
+        assert_equal(self.module.foo(), (b"'", b'"', b';', b'!', b'(', b')'))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_regression.py b/venv/Lib/site-packages/numpy/f2py/tests/test_regression.py
new file mode 100644
index 000000000..67e00f1f7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_regression.py
@@ -0,0 +1,27 @@
+import os
+import pytest
+
+import numpy as np
+from numpy.testing import assert_raises, assert_equal
+
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestIntentInOut(util.F2PyTest):
+    # Check that intent(in out) translates as intent(inout)
+    sources = [_path('src', 'regression', 'inout.f90')]
+
+    @pytest.mark.slow
+    def test_inout(self):
+        # non-contiguous should raise error
+        x = np.arange(6, dtype=np.float32)[::2]
+        assert_raises(ValueError, self.module.foo, x)
+
+        # check values with contiguous array
+        x = np.arange(3, dtype=np.float32)
+        self.module.foo(x)
+        assert_equal(x, [3, 1, 2])
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_return_character.py b/venv/Lib/site-packages/numpy/f2py/tests/test_return_character.py
new file mode 100644
index 000000000..429e69bb4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_return_character.py
@@ -0,0 +1,145 @@
+import pytest
+
+from numpy import array
+from numpy.testing import assert_
+from . import util
+import platform
+IS_S390X = platform.machine() == 's390x'
+
+
+class TestReturnCharacter(util.F2PyTest):
+
+    def check_function(self, t, tname):
+        if tname in ['t0', 't1', 's0', 's1']:
+            assert_(t(23) == b'2')
+            r = t('ab')
+            assert_(r == b'a', repr(r))
+            r = t(array('ab'))
+            assert_(r == b'a', repr(r))
+            r = t(array(77, 'u1'))
+            assert_(r == b'M', repr(r))
+            #assert_(_raises(ValueError, t, array([77,87])))
+            #assert_(_raises(ValueError, t, array(77)))
+        elif tname in ['ts', 'ss']:
+            assert_(t(23) == b'23        ', repr(t(23)))
+            assert_(t('123456789abcdef') == b'123456789a')
+        elif tname in ['t5', 's5']:
+            assert_(t(23) == b'23   ', repr(t(23)))
+            assert_(t('ab') == b'ab   ', repr(t('ab')))
+            assert_(t('123456789abcdef') == b'12345')
+        else:
+            raise NotImplementedError
+
+
+class TestF77ReturnCharacter(TestReturnCharacter):
+    code = """
+       function t0(value)
+         character value
+         character t0
+         t0 = value
+       end
+       function t1(value)
+         character*1 value
+         character*1 t1
+         t1 = value
+       end
+       function t5(value)
+         character*5 value
+         character*5 t5
+         t5 = value
+       end
+       function ts(value)
+         character*(*) value
+         character*(*) ts
+         ts = value
+       end
+
+       subroutine s0(t0,value)
+         character value
+         character t0
+cf2py    intent(out) t0
+         t0 = value
+       end
+       subroutine s1(t1,value)
+         character*1 value
+         character*1 t1
+cf2py    intent(out) t1
+         t1 = value
+       end
+       subroutine s5(t5,value)
+         character*5 value
+         character*5 t5
+cf2py    intent(out) t5
+         t5 = value
+       end
+       subroutine ss(ts,value)
+         character*(*) value
+         character*10 ts
+cf2py    intent(out) ts
+         ts = value
+       end
+    """
+
+    @pytest.mark.xfail(IS_S390X, reason="calback returns ' '")
+    @pytest.mark.parametrize('name', 't0,t1,t5,s0,s1,s5,ss'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name), name)
+
+
+class TestF90ReturnCharacter(TestReturnCharacter):
+    suffix = ".f90"
+    code = """
+module f90_return_char
+  contains
+       function t0(value)
+         character :: value
+         character :: t0
+         t0 = value
+       end function t0
+       function t1(value)
+         character(len=1) :: value
+         character(len=1) :: t1
+         t1 = value
+       end function t1
+       function t5(value)
+         character(len=5) :: value
+         character(len=5) :: t5
+         t5 = value
+       end function t5
+       function ts(value)
+         character(len=*) :: value
+         character(len=10) :: ts
+         ts = value
+       end function ts
+
+       subroutine s0(t0,value)
+         character :: value
+         character :: t0
+!f2py    intent(out) t0
+         t0 = value
+       end subroutine s0
+       subroutine s1(t1,value)
+         character(len=1) :: value
+         character(len=1) :: t1
+!f2py    intent(out) t1
+         t1 = value
+       end subroutine s1
+       subroutine s5(t5,value)
+         character(len=5) :: value
+         character(len=5) :: t5
+!f2py    intent(out) t5
+         t5 = value
+       end subroutine s5
+       subroutine ss(ts,value)
+         character(len=*) :: value
+         character(len=10) :: ts
+!f2py    intent(out) ts
+         ts = value
+       end subroutine ss
+end module f90_return_char
+    """
+
+    @pytest.mark.xfail(IS_S390X, reason="calback returns ' '")
+    @pytest.mark.parametrize('name', 't0,t1,t5,ts,s0,s1,s5,ss'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module.f90_return_char, name), name)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_return_complex.py b/venv/Lib/site-packages/numpy/f2py/tests/test_return_complex.py
new file mode 100644
index 000000000..3d2e2b94f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_return_complex.py
@@ -0,0 +1,163 @@
+import pytest
+
+from numpy import array
+from numpy.testing import assert_, assert_raises
+from . import util
+
+
+class TestReturnComplex(util.F2PyTest):
+
+    def check_function(self, t, tname):
+        if tname in ['t0', 't8', 's0', 's8']:
+            err = 1e-5
+        else:
+            err = 0.0
+        assert_(abs(t(234j) - 234.0j) <= err)
+        assert_(abs(t(234.6) - 234.6) <= err)
+        assert_(abs(t(234) - 234.0) <= err)
+        assert_(abs(t(234.6 + 3j) - (234.6 + 3j)) <= err)
+        #assert_( abs(t('234')-234.)<=err)
+        #assert_( abs(t('234.6')-234.6)<=err)
+        assert_(abs(t(-234) + 234.) <= err)
+        assert_(abs(t([234]) - 234.) <= err)
+        assert_(abs(t((234,)) - 234.) <= err)
+        assert_(abs(t(array(234)) - 234.) <= err)
+        assert_(abs(t(array(23 + 4j, 'F')) - (23 + 4j)) <= err)
+        assert_(abs(t(array([234])) - 234.) <= err)
+        assert_(abs(t(array([[234]])) - 234.) <= err)
+        assert_(abs(t(array([234], 'b')) + 22.) <= err)
+        assert_(abs(t(array([234], 'h')) - 234.) <= err)
+        assert_(abs(t(array([234], 'i')) - 234.) <= err)
+        assert_(abs(t(array([234], 'l')) - 234.) <= err)
+        assert_(abs(t(array([234], 'q')) - 234.) <= err)
+        assert_(abs(t(array([234], 'f')) - 234.) <= err)
+        assert_(abs(t(array([234], 'd')) - 234.) <= err)
+        assert_(abs(t(array([234 + 3j], 'F')) - (234 + 3j)) <= err)
+        assert_(abs(t(array([234], 'D')) - 234.) <= err)
+
+        #assert_raises(TypeError, t, array([234], 'a1'))
+        assert_raises(TypeError, t, 'abc')
+
+        assert_raises(IndexError, t, [])
+        assert_raises(IndexError, t, ())
+
+        assert_raises(TypeError, t, t)
+        assert_raises(TypeError, t, {})
+
+        try:
+            r = t(10 ** 400)
+            assert_(repr(r) in ['(inf+0j)', '(Infinity+0j)'], repr(r))
+        except OverflowError:
+            pass
+
+
+class TestF77ReturnComplex(TestReturnComplex):
+    code = """
+       function t0(value)
+         complex value
+         complex t0
+         t0 = value
+       end
+       function t8(value)
+         complex*8 value
+         complex*8 t8
+         t8 = value
+       end
+       function t16(value)
+         complex*16 value
+         complex*16 t16
+         t16 = value
+       end
+       function td(value)
+         double complex value
+         double complex td
+         td = value
+       end
+
+       subroutine s0(t0,value)
+         complex value
+         complex t0
+cf2py    intent(out) t0
+         t0 = value
+       end
+       subroutine s8(t8,value)
+         complex*8 value
+         complex*8 t8
+cf2py    intent(out) t8
+         t8 = value
+       end
+       subroutine s16(t16,value)
+         complex*16 value
+         complex*16 t16
+cf2py    intent(out) t16
+         t16 = value
+       end
+       subroutine sd(td,value)
+         double complex value
+         double complex td
+cf2py    intent(out) td
+         td = value
+       end
+    """
+
+    @pytest.mark.parametrize('name', 't0,t8,t16,td,s0,s8,s16,sd'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name), name)
+
+
+class TestF90ReturnComplex(TestReturnComplex):
+    suffix = ".f90"
+    code = """
+module f90_return_complex
+  contains
+       function t0(value)
+         complex :: value
+         complex :: t0
+         t0 = value
+       end function t0
+       function t8(value)
+         complex(kind=4) :: value
+         complex(kind=4) :: t8
+         t8 = value
+       end function t8
+       function t16(value)
+         complex(kind=8) :: value
+         complex(kind=8) :: t16
+         t16 = value
+       end function t16
+       function td(value)
+         double complex :: value
+         double complex :: td
+         td = value
+       end function td
+
+       subroutine s0(t0,value)
+         complex :: value
+         complex :: t0
+!f2py    intent(out) t0
+         t0 = value
+       end subroutine s0
+       subroutine s8(t8,value)
+         complex(kind=4) :: value
+         complex(kind=4) :: t8
+!f2py    intent(out) t8
+         t8 = value
+       end subroutine s8
+       subroutine s16(t16,value)
+         complex(kind=8) :: value
+         complex(kind=8) :: t16
+!f2py    intent(out) t16
+         t16 = value
+       end subroutine s16
+       subroutine sd(td,value)
+         double complex :: value
+         double complex :: td
+!f2py    intent(out) td
+         td = value
+       end subroutine sd
+end module f90_return_complex
+    """
+
+    @pytest.mark.parametrize('name', 't0,t8,t16,td,s0,s8,s16,sd'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module.f90_return_complex, name), name)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_return_integer.py b/venv/Lib/site-packages/numpy/f2py/tests/test_return_integer.py
new file mode 100644
index 000000000..0a8121dc1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_return_integer.py
@@ -0,0 +1,175 @@
+import pytest
+
+from numpy import array
+from numpy.testing import assert_, assert_raises
+from . import util
+
+
+class TestReturnInteger(util.F2PyTest):
+
+    def check_function(self, t, tname):
+        assert_(t(123) == 123, repr(t(123)))
+        assert_(t(123.6) == 123)
+        assert_(t('123') == 123)
+        assert_(t(-123) == -123)
+        assert_(t([123]) == 123)
+        assert_(t((123,)) == 123)
+        assert_(t(array(123)) == 123)
+        assert_(t(array([123])) == 123)
+        assert_(t(array([[123]])) == 123)
+        assert_(t(array([123], 'b')) == 123)
+        assert_(t(array([123], 'h')) == 123)
+        assert_(t(array([123], 'i')) == 123)
+        assert_(t(array([123], 'l')) == 123)
+        assert_(t(array([123], 'B')) == 123)
+        assert_(t(array([123], 'f')) == 123)
+        assert_(t(array([123], 'd')) == 123)
+
+        #assert_raises(ValueError, t, array([123],'S3'))
+        assert_raises(ValueError, t, 'abc')
+
+        assert_raises(IndexError, t, [])
+        assert_raises(IndexError, t, ())
+
+        assert_raises(Exception, t, t)
+        assert_raises(Exception, t, {})
+
+        if tname in ['t8', 's8']:
+            assert_raises(OverflowError, t, 100000000000000000000000)
+            assert_raises(OverflowError, t, 10000000011111111111111.23)
+
+
+class TestF77ReturnInteger(TestReturnInteger):
+    code = """
+       function t0(value)
+         integer value
+         integer t0
+         t0 = value
+       end
+       function t1(value)
+         integer*1 value
+         integer*1 t1
+         t1 = value
+       end
+       function t2(value)
+         integer*2 value
+         integer*2 t2
+         t2 = value
+       end
+       function t4(value)
+         integer*4 value
+         integer*4 t4
+         t4 = value
+       end
+       function t8(value)
+         integer*8 value
+         integer*8 t8
+         t8 = value
+       end
+
+       subroutine s0(t0,value)
+         integer value
+         integer t0
+cf2py    intent(out) t0
+         t0 = value
+       end
+       subroutine s1(t1,value)
+         integer*1 value
+         integer*1 t1
+cf2py    intent(out) t1
+         t1 = value
+       end
+       subroutine s2(t2,value)
+         integer*2 value
+         integer*2 t2
+cf2py    intent(out) t2
+         t2 = value
+       end
+       subroutine s4(t4,value)
+         integer*4 value
+         integer*4 t4
+cf2py    intent(out) t4
+         t4 = value
+       end
+       subroutine s8(t8,value)
+         integer*8 value
+         integer*8 t8
+cf2py    intent(out) t8
+         t8 = value
+       end
+    """
+
+    @pytest.mark.parametrize('name',
+                             't0,t1,t2,t4,t8,s0,s1,s2,s4,s8'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name), name)
+
+
+class TestF90ReturnInteger(TestReturnInteger):
+    suffix = ".f90"
+    code = """
+module f90_return_integer
+  contains
+       function t0(value)
+         integer :: value
+         integer :: t0
+         t0 = value
+       end function t0
+       function t1(value)
+         integer(kind=1) :: value
+         integer(kind=1) :: t1
+         t1 = value
+       end function t1
+       function t2(value)
+         integer(kind=2) :: value
+         integer(kind=2) :: t2
+         t2 = value
+       end function t2
+       function t4(value)
+         integer(kind=4) :: value
+         integer(kind=4) :: t4
+         t4 = value
+       end function t4
+       function t8(value)
+         integer(kind=8) :: value
+         integer(kind=8) :: t8
+         t8 = value
+       end function t8
+
+       subroutine s0(t0,value)
+         integer :: value
+         integer :: t0
+!f2py    intent(out) t0
+         t0 = value
+       end subroutine s0
+       subroutine s1(t1,value)
+         integer(kind=1) :: value
+         integer(kind=1) :: t1
+!f2py    intent(out) t1
+         t1 = value
+       end subroutine s1
+       subroutine s2(t2,value)
+         integer(kind=2) :: value
+         integer(kind=2) :: t2
+!f2py    intent(out) t2
+         t2 = value
+       end subroutine s2
+       subroutine s4(t4,value)
+         integer(kind=4) :: value
+         integer(kind=4) :: t4
+!f2py    intent(out) t4
+         t4 = value
+       end subroutine s4
+       subroutine s8(t8,value)
+         integer(kind=8) :: value
+         integer(kind=8) :: t8
+!f2py    intent(out) t8
+         t8 = value
+       end subroutine s8
+end module f90_return_integer
+    """
+
+    @pytest.mark.parametrize('name',
+                             't0,t1,t2,t4,t8,s0,s1,s2,s4,s8'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module.f90_return_integer, name), name)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_return_logical.py b/venv/Lib/site-packages/numpy/f2py/tests/test_return_logical.py
new file mode 100644
index 000000000..9db939c7e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_return_logical.py
@@ -0,0 +1,185 @@
+import pytest
+
+from numpy import array
+from numpy.testing import assert_, assert_raises
+from . import util
+
+
+class TestReturnLogical(util.F2PyTest):
+
+    def check_function(self, t):
+        assert_(t(True) == 1, repr(t(True)))
+        assert_(t(False) == 0, repr(t(False)))
+        assert_(t(0) == 0)
+        assert_(t(None) == 0)
+        assert_(t(0.0) == 0)
+        assert_(t(0j) == 0)
+        assert_(t(1j) == 1)
+        assert_(t(234) == 1)
+        assert_(t(234.6) == 1)
+        assert_(t(234.6 + 3j) == 1)
+        assert_(t('234') == 1)
+        assert_(t('aaa') == 1)
+        assert_(t('') == 0)
+        assert_(t([]) == 0)
+        assert_(t(()) == 0)
+        assert_(t({}) == 0)
+        assert_(t(t) == 1)
+        assert_(t(-234) == 1)
+        assert_(t(10 ** 100) == 1)
+        assert_(t([234]) == 1)
+        assert_(t((234,)) == 1)
+        assert_(t(array(234)) == 1)
+        assert_(t(array([234])) == 1)
+        assert_(t(array([[234]])) == 1)
+        assert_(t(array([234], 'b')) == 1)
+        assert_(t(array([234], 'h')) == 1)
+        assert_(t(array([234], 'i')) == 1)
+        assert_(t(array([234], 'l')) == 1)
+        assert_(t(array([234], 'f')) == 1)
+        assert_(t(array([234], 'd')) == 1)
+        assert_(t(array([234 + 3j], 'F')) == 1)
+        assert_(t(array([234], 'D')) == 1)
+        assert_(t(array(0)) == 0)
+        assert_(t(array([0])) == 0)
+        assert_(t(array([[0]])) == 0)
+        assert_(t(array([0j])) == 0)
+        assert_(t(array([1])) == 1)
+        assert_raises(ValueError, t, array([0, 0]))
+
+
+class TestF77ReturnLogical(TestReturnLogical):
+    code = """
+       function t0(value)
+         logical value
+         logical t0
+         t0 = value
+       end
+       function t1(value)
+         logical*1 value
+         logical*1 t1
+         t1 = value
+       end
+       function t2(value)
+         logical*2 value
+         logical*2 t2
+         t2 = value
+       end
+       function t4(value)
+         logical*4 value
+         logical*4 t4
+         t4 = value
+       end
+c       function t8(value)
+c         logical*8 value
+c         logical*8 t8
+c         t8 = value
+c       end
+
+       subroutine s0(t0,value)
+         logical value
+         logical t0
+cf2py    intent(out) t0
+         t0 = value
+       end
+       subroutine s1(t1,value)
+         logical*1 value
+         logical*1 t1
+cf2py    intent(out) t1
+         t1 = value
+       end
+       subroutine s2(t2,value)
+         logical*2 value
+         logical*2 t2
+cf2py    intent(out) t2
+         t2 = value
+       end
+       subroutine s4(t4,value)
+         logical*4 value
+         logical*4 t4
+cf2py    intent(out) t4
+         t4 = value
+       end
+c       subroutine s8(t8,value)
+c         logical*8 value
+c         logical*8 t8
+cf2py    intent(out) t8
+c         t8 = value
+c       end
+    """
+
+    @pytest.mark.slow
+    @pytest.mark.parametrize('name', 't0,t1,t2,t4,s0,s1,s2,s4'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name))
+
+
+class TestF90ReturnLogical(TestReturnLogical):
+    suffix = ".f90"
+    code = """
+module f90_return_logical
+  contains
+       function t0(value)
+         logical :: value
+         logical :: t0
+         t0 = value
+       end function t0
+       function t1(value)
+         logical(kind=1) :: value
+         logical(kind=1) :: t1
+         t1 = value
+       end function t1
+       function t2(value)
+         logical(kind=2) :: value
+         logical(kind=2) :: t2
+         t2 = value
+       end function t2
+       function t4(value)
+         logical(kind=4) :: value
+         logical(kind=4) :: t4
+         t4 = value
+       end function t4
+       function t8(value)
+         logical(kind=8) :: value
+         logical(kind=8) :: t8
+         t8 = value
+       end function t8
+
+       subroutine s0(t0,value)
+         logical :: value
+         logical :: t0
+!f2py    intent(out) t0
+         t0 = value
+       end subroutine s0
+       subroutine s1(t1,value)
+         logical(kind=1) :: value
+         logical(kind=1) :: t1
+!f2py    intent(out) t1
+         t1 = value
+       end subroutine s1
+       subroutine s2(t2,value)
+         logical(kind=2) :: value
+         logical(kind=2) :: t2
+!f2py    intent(out) t2
+         t2 = value
+       end subroutine s2
+       subroutine s4(t4,value)
+         logical(kind=4) :: value
+         logical(kind=4) :: t4
+!f2py    intent(out) t4
+         t4 = value
+       end subroutine s4
+       subroutine s8(t8,value)
+         logical(kind=8) :: value
+         logical(kind=8) :: t8
+!f2py    intent(out) t8
+         t8 = value
+       end subroutine s8
+end module f90_return_logical
+    """
+
+    @pytest.mark.slow
+    @pytest.mark.parametrize('name',
+                             't0,t1,t2,t4,t8,s0,s1,s2,s4,s8'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module.f90_return_logical, name))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_return_real.py b/venv/Lib/site-packages/numpy/f2py/tests/test_return_real.py
new file mode 100644
index 000000000..8e5022a8e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_return_real.py
@@ -0,0 +1,203 @@
+import platform
+import pytest
+
+from numpy import array
+from numpy.testing import assert_, assert_raises
+from . import util
+
+
+class TestReturnReal(util.F2PyTest):
+
+    def check_function(self, t, tname):
+        if tname in ['t0', 't4', 's0', 's4']:
+            err = 1e-5
+        else:
+            err = 0.0
+        assert_(abs(t(234) - 234.0) <= err)
+        assert_(abs(t(234.6) - 234.6) <= err)
+        assert_(abs(t('234') - 234) <= err)
+        assert_(abs(t('234.6') - 234.6) <= err)
+        assert_(abs(t(-234) + 234) <= err)
+        assert_(abs(t([234]) - 234) <= err)
+        assert_(abs(t((234,)) - 234.) <= err)
+        assert_(abs(t(array(234)) - 234.) <= err)
+        assert_(abs(t(array([234])) - 234.) <= err)
+        assert_(abs(t(array([[234]])) - 234.) <= err)
+        assert_(abs(t(array([234], 'b')) + 22) <= err)
+        assert_(abs(t(array([234], 'h')) - 234.) <= err)
+        assert_(abs(t(array([234], 'i')) - 234.) <= err)
+        assert_(abs(t(array([234], 'l')) - 234.) <= err)
+        assert_(abs(t(array([234], 'B')) - 234.) <= err)
+        assert_(abs(t(array([234], 'f')) - 234.) <= err)
+        assert_(abs(t(array([234], 'd')) - 234.) <= err)
+        if tname in ['t0', 't4', 's0', 's4']:
+            assert_(t(1e200) == t(1e300))  # inf
+
+        #assert_raises(ValueError, t, array([234], 'S1'))
+        assert_raises(ValueError, t, 'abc')
+
+        assert_raises(IndexError, t, [])
+        assert_raises(IndexError, t, ())
+
+        assert_raises(Exception, t, t)
+        assert_raises(Exception, t, {})
+
+        try:
+            r = t(10 ** 400)
+            assert_(repr(r) in ['inf', 'Infinity'], repr(r))
+        except OverflowError:
+            pass
+
+
+
+@pytest.mark.skipif(
+    platform.system() == 'Darwin',
+    reason="Prone to error when run with numpy/f2py/tests on mac os, "
+           "but not when run in isolation")
+class TestCReturnReal(TestReturnReal):
+    suffix = ".pyf"
+    module_name = "c_ext_return_real"
+    code = """
+python module c_ext_return_real
+usercode \'\'\'
+float t4(float value) { return value; }
+void s4(float *t4, float value) { *t4 = value; }
+double t8(double value) { return value; }
+void s8(double *t8, double value) { *t8 = value; }
+\'\'\'
+interface
+  function t4(value)
+    real*4 intent(c) :: t4,value
+  end
+  function t8(value)
+    real*8 intent(c) :: t8,value
+  end
+  subroutine s4(t4,value)
+    intent(c) s4
+    real*4 intent(out) :: t4
+    real*4 intent(c) :: value
+  end
+  subroutine s8(t8,value)
+    intent(c) s8
+    real*8 intent(out) :: t8
+    real*8 intent(c) :: value
+  end
+end interface
+end python module c_ext_return_real
+    """
+
+    @pytest.mark.parametrize('name', 't4,t8,s4,s8'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name), name)
+
+
+class TestF77ReturnReal(TestReturnReal):
+    code = """
+       function t0(value)
+         real value
+         real t0
+         t0 = value
+       end
+       function t4(value)
+         real*4 value
+         real*4 t4
+         t4 = value
+       end
+       function t8(value)
+         real*8 value
+         real*8 t8
+         t8 = value
+       end
+       function td(value)
+         double precision value
+         double precision td
+         td = value
+       end
+
+       subroutine s0(t0,value)
+         real value
+         real t0
+cf2py    intent(out) t0
+         t0 = value
+       end
+       subroutine s4(t4,value)
+         real*4 value
+         real*4 t4
+cf2py    intent(out) t4
+         t4 = value
+       end
+       subroutine s8(t8,value)
+         real*8 value
+         real*8 t8
+cf2py    intent(out) t8
+         t8 = value
+       end
+       subroutine sd(td,value)
+         double precision value
+         double precision td
+cf2py    intent(out) td
+         td = value
+       end
+    """
+
+    @pytest.mark.parametrize('name', 't0,t4,t8,td,s0,s4,s8,sd'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module, name), name)
+
+
+class TestF90ReturnReal(TestReturnReal):
+    suffix = ".f90"
+    code = """
+module f90_return_real
+  contains
+       function t0(value)
+         real :: value
+         real :: t0
+         t0 = value
+       end function t0
+       function t4(value)
+         real(kind=4) :: value
+         real(kind=4) :: t4
+         t4 = value
+       end function t4
+       function t8(value)
+         real(kind=8) :: value
+         real(kind=8) :: t8
+         t8 = value
+       end function t8
+       function td(value)
+         double precision :: value
+         double precision :: td
+         td = value
+       end function td
+
+       subroutine s0(t0,value)
+         real :: value
+         real :: t0
+!f2py    intent(out) t0
+         t0 = value
+       end subroutine s0
+       subroutine s4(t4,value)
+         real(kind=4) :: value
+         real(kind=4) :: t4
+!f2py    intent(out) t4
+         t4 = value
+       end subroutine s4
+       subroutine s8(t8,value)
+         real(kind=8) :: value
+         real(kind=8) :: t8
+!f2py    intent(out) t8
+         t8 = value
+       end subroutine s8
+       subroutine sd(td,value)
+         double precision :: value
+         double precision :: td
+!f2py    intent(out) td
+         td = value
+       end subroutine sd
+end module f90_return_real
+    """
+
+    @pytest.mark.parametrize('name', 't0,t4,t8,td,s0,s4,s8,sd'.split(','))
+    def test_all(self, name):
+        self.check_function(getattr(self.module.f90_return_real, name), name)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_semicolon_split.py b/venv/Lib/site-packages/numpy/f2py/tests/test_semicolon_split.py
new file mode 100644
index 000000000..d8b4bf222
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_semicolon_split.py
@@ -0,0 +1,63 @@
+import platform
+import pytest
+
+from . import util
+from numpy.testing import assert_equal
+
+@pytest.mark.skipif(
+    platform.system() == 'Darwin',
+    reason="Prone to error when run with numpy/f2py/tests on mac os, "
+           "but not when run in isolation")
+class TestMultiline(util.F2PyTest):
+    suffix = ".pyf"
+    module_name = "multiline"
+    code = """
+python module {module}
+    usercode '''
+void foo(int* x) {{
+    char dummy = ';';
+    *x = 42;
+}}
+'''
+    interface
+        subroutine foo(x)
+            intent(c) foo
+            integer intent(out) :: x
+        end subroutine foo
+    end interface
+end python module {module}
+    """.format(module=module_name)
+
+    def test_multiline(self):
+        assert_equal(self.module.foo(), 42)
+
+
+@pytest.mark.skipif(
+    platform.system() == 'Darwin',
+    reason="Prone to error when run with numpy/f2py/tests on mac os, "
+           "but not when run in isolation")
+class TestCallstatement(util.F2PyTest):
+    suffix = ".pyf"
+    module_name = "callstatement"
+    code = """
+python module {module}
+    usercode '''
+void foo(int* x) {{
+}}
+'''
+    interface
+        subroutine foo(x)
+            intent(c) foo
+            integer intent(out) :: x
+            callprotoargument int*
+            callstatement {{ &
+                ; &
+                x = 42; &
+            }}
+        end subroutine foo
+    end interface
+end python module {module}
+    """.format(module=module_name)
+
+    def test_callstatement(self):
+        assert_equal(self.module.foo(), 42)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_size.py b/venv/Lib/site-packages/numpy/f2py/tests/test_size.py
new file mode 100644
index 000000000..b609fa77f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_size.py
@@ -0,0 +1,49 @@
+import os
+import pytest
+
+from numpy.testing import assert_equal
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+
+class TestSizeSumExample(util.F2PyTest):
+    sources = [_path('src', 'size', 'foo.f90')]
+
+    @pytest.mark.slow
+    def test_all(self):
+        r = self.module.foo([[]])
+        assert_equal(r, [0], repr(r))
+
+        r = self.module.foo([[1, 2]])
+        assert_equal(r, [3], repr(r))
+
+        r = self.module.foo([[1, 2], [3, 4]])
+        assert_equal(r, [3, 7], repr(r))
+
+        r = self.module.foo([[1, 2], [3, 4], [5, 6]])
+        assert_equal(r, [3, 7, 11], repr(r))
+
+    @pytest.mark.slow
+    def test_transpose(self):
+        r = self.module.trans([[]])
+        assert_equal(r.T, [[]], repr(r))
+
+        r = self.module.trans([[1, 2]])
+        assert_equal(r, [[1], [2]], repr(r))
+
+        r = self.module.trans([[1, 2, 3], [4, 5, 6]])
+        assert_equal(r, [[1, 4], [2, 5], [3, 6]], repr(r))
+
+    @pytest.mark.slow
+    def test_flatten(self):
+        r = self.module.flatten([[]])
+        assert_equal(r, [], repr(r))
+
+        r = self.module.flatten([[1, 2]])
+        assert_equal(r, [1, 2], repr(r))
+
+        r = self.module.flatten([[1, 2, 3], [4, 5, 6]])
+        assert_equal(r, [1, 2, 3, 4, 5, 6], repr(r))
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/test_string.py b/venv/Lib/site-packages/numpy/f2py/tests/test_string.py
new file mode 100644
index 000000000..e3ec96af9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/test_string.py
@@ -0,0 +1,22 @@
+import os
+import pytest
+
+from numpy.testing import assert_array_equal
+import numpy as np
+from . import util
+
+
+def _path(*a):
+    return os.path.join(*((os.path.dirname(__file__),) + a))
+
+class TestString(util.F2PyTest):
+    sources = [_path('src', 'string', 'char.f90')]
+
+    @pytest.mark.slow
+    def test_char(self):
+        strings = np.array(['ab', 'cd', 'ef'], dtype='c').T
+        inp, out = self.module.char_test.change_strings(strings, strings.shape[1])
+        assert_array_equal(inp, strings)
+        expected = strings.copy()
+        expected[1, :] = 'AAA'
+        assert_array_equal(out, expected)
diff --git a/venv/Lib/site-packages/numpy/f2py/tests/util.py b/venv/Lib/site-packages/numpy/f2py/tests/util.py
new file mode 100644
index 000000000..c5b06697d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/tests/util.py
@@ -0,0 +1,361 @@
+"""
+Utility functions for
+
+- building and importing modules on test time, using a temporary location
+- detecting if compilers are present
+
+"""
+import os
+import sys
+import subprocess
+import tempfile
+import shutil
+import atexit
+import textwrap
+import re
+import pytest
+
+from numpy.compat import asbytes, asstr
+from numpy.testing import temppath
+from importlib import import_module
+
+from hashlib import md5
+
+#
+# Maintaining a temporary module directory
+#
+
+_module_dir = None
+_module_num = 5403
+
+
+def _cleanup():
+    global _module_dir
+    if _module_dir is not None:
+        try:
+            sys.path.remove(_module_dir)
+        except ValueError:
+            pass
+        try:
+            shutil.rmtree(_module_dir)
+        except (IOError, OSError):
+            pass
+        _module_dir = None
+
+
+def get_module_dir():
+    global _module_dir
+    if _module_dir is None:
+        _module_dir = tempfile.mkdtemp()
+        atexit.register(_cleanup)
+        if _module_dir not in sys.path:
+            sys.path.insert(0, _module_dir)
+    return _module_dir
+
+
+def get_temp_module_name():
+    # Assume single-threaded, and the module dir usable only by this thread
+    global _module_num
+    d = get_module_dir()
+    name = "_test_ext_module_%d" % _module_num
+    _module_num += 1
+    if name in sys.modules:
+        # this should not be possible, but check anyway
+        raise RuntimeError("Temporary module name already in use.")
+    return name
+
+
+def _memoize(func):
+    memo = {}
+
+    def wrapper(*a, **kw):
+        key = repr((a, kw))
+        if key not in memo:
+            try:
+                memo[key] = func(*a, **kw)
+            except Exception as e:
+                memo[key] = e
+                raise
+        ret = memo[key]
+        if isinstance(ret, Exception):
+            raise ret
+        return ret
+    wrapper.__name__ = func.__name__
+    return wrapper
+
+#
+# Building modules
+#
+
+
+@_memoize
+def build_module(source_files, options=[], skip=[], only=[], module_name=None):
+    """
+    Compile and import a f2py module, built from the given files.
+
+    """
+
+    code = ("import sys; sys.path = %s; import numpy.f2py as f2py2e; "
+            "f2py2e.main()" % repr(sys.path))
+
+    d = get_module_dir()
+
+    # Copy files
+    dst_sources = []
+    f2py_sources = []
+    for fn in source_files:
+        if not os.path.isfile(fn):
+            raise RuntimeError("%s is not a file" % fn)
+        dst = os.path.join(d, os.path.basename(fn))
+        shutil.copyfile(fn, dst)
+        dst_sources.append(dst)
+
+        base, ext = os.path.splitext(dst)
+        if ext in ('.f90', '.f', '.c', '.pyf'):
+            f2py_sources.append(dst)
+
+    # Prepare options
+    if module_name is None:
+        module_name = get_temp_module_name()
+    f2py_opts = ['-c', '-m', module_name] + options + f2py_sources
+    if skip:
+        f2py_opts += ['skip:'] + skip
+    if only:
+        f2py_opts += ['only:'] + only
+
+    # Build
+    cwd = os.getcwd()
+    try:
+        os.chdir(d)
+        cmd = [sys.executable, '-c', code] + f2py_opts
+        p = subprocess.Popen(cmd, stdout=subprocess.PIPE,
+                             stderr=subprocess.STDOUT)
+        out, err = p.communicate()
+        if p.returncode != 0:
+            raise RuntimeError("Running f2py failed: %s\n%s"
+                               % (cmd[4:], asstr(out)))
+    finally:
+        os.chdir(cwd)
+
+        # Partial cleanup
+        for fn in dst_sources:
+            os.unlink(fn)
+
+    # Import
+    return import_module(module_name)
+
+
+@_memoize
+def build_code(source_code, options=[], skip=[], only=[], suffix=None,
+               module_name=None):
+    """
+    Compile and import Fortran code using f2py.
+
+    """
+    if suffix is None:
+        suffix = '.f'
+    with temppath(suffix=suffix) as path:
+        with open(path, 'w') as f:
+            f.write(source_code)
+        return build_module([path], options=options, skip=skip, only=only,
+                            module_name=module_name)
+
+#
+# Check if compilers are available at all...
+#
+
+_compiler_status = None
+
+
+def _get_compiler_status():
+    global _compiler_status
+    if _compiler_status is not None:
+        return _compiler_status
+
+    _compiler_status = (False, False, False)
+
+    # XXX: this is really ugly. But I don't know how to invoke Distutils
+    #      in a safer way...
+    code = textwrap.dedent("""\
+        import os
+        import sys
+        sys.path = %(syspath)s
+
+        def configuration(parent_name='',top_path=None):
+            global config
+            from numpy.distutils.misc_util import Configuration
+            config = Configuration('', parent_name, top_path)
+            return config
+
+        from numpy.distutils.core import setup
+        setup(configuration=configuration)
+
+        config_cmd = config.get_config_cmd()
+        have_c = config_cmd.try_compile('void foo() {}')
+        print('COMPILERS:%%d,%%d,%%d' %% (have_c,
+                                          config.have_f77c(),
+                                          config.have_f90c()))
+        sys.exit(99)
+        """)
+    code = code % dict(syspath=repr(sys.path))
+
+    tmpdir = tempfile.mkdtemp()
+    try:
+        script = os.path.join(tmpdir, 'setup.py')
+
+        with open(script, 'w') as f:
+            f.write(code)
+
+        cmd = [sys.executable, 'setup.py', 'config']
+        p = subprocess.Popen(cmd, stdout=subprocess.PIPE,
+                             stderr=subprocess.STDOUT,
+                             cwd=tmpdir)
+        out, err = p.communicate()
+    finally:
+        shutil.rmtree(tmpdir)
+
+    m = re.search(br'COMPILERS:(\d+),(\d+),(\d+)', out)
+    if m:
+        _compiler_status = (bool(int(m.group(1))), bool(int(m.group(2))),
+                            bool(int(m.group(3))))
+    # Finished
+    return _compiler_status
+
+
+def has_c_compiler():
+    return _get_compiler_status()[0]
+
+
+def has_f77_compiler():
+    return _get_compiler_status()[1]
+
+
+def has_f90_compiler():
+    return _get_compiler_status()[2]
+
+#
+# Building with distutils
+#
+
+
+@_memoize
+def build_module_distutils(source_files, config_code, module_name, **kw):
+    """
+    Build a module via distutils and import it.
+
+    """
+    from numpy.distutils.misc_util import Configuration
+    from numpy.distutils.core import setup
+
+    d = get_module_dir()
+
+    # Copy files
+    dst_sources = []
+    for fn in source_files:
+        if not os.path.isfile(fn):
+            raise RuntimeError("%s is not a file" % fn)
+        dst = os.path.join(d, os.path.basename(fn))
+        shutil.copyfile(fn, dst)
+        dst_sources.append(dst)
+
+    # Build script
+    config_code = textwrap.dedent(config_code).replace("\n", "\n    ")
+
+    code = textwrap.dedent("""\
+        import os
+        import sys
+        sys.path = %(syspath)s
+
+        def configuration(parent_name='',top_path=None):
+            from numpy.distutils.misc_util import Configuration
+            config = Configuration('', parent_name, top_path)
+            %(config_code)s
+            return config
+
+        if __name__ == "__main__":
+            from numpy.distutils.core import setup
+            setup(configuration=configuration)
+        """) % dict(config_code=config_code, syspath=repr(sys.path))
+
+    script = os.path.join(d, get_temp_module_name() + '.py')
+    dst_sources.append(script)
+    with open(script, 'wb') as f:
+        f.write(asbytes(code))
+
+    # Build
+    cwd = os.getcwd()
+    try:
+        os.chdir(d)
+        cmd = [sys.executable, script, 'build_ext', '-i']
+        p = subprocess.Popen(cmd, stdout=subprocess.PIPE,
+                             stderr=subprocess.STDOUT)
+        out, err = p.communicate()
+        if p.returncode != 0:
+            raise RuntimeError("Running distutils build failed: %s\n%s"
+                               % (cmd[4:], asstr(out)))
+    finally:
+        os.chdir(cwd)
+
+        # Partial cleanup
+        for fn in dst_sources:
+            os.unlink(fn)
+
+    # Import
+    __import__(module_name)
+    return sys.modules[module_name]
+
+#
+# Unittest convenience
+#
+
+
+class F2PyTest:
+    code = None
+    sources = None
+    options = []
+    skip = []
+    only = []
+    suffix = '.f'
+    module = None
+    module_name = None
+
+    def setup(self):
+        if sys.platform == 'win32':
+            pytest.skip('Fails with MinGW64 Gfortran (Issue #9673)')
+
+        if self.module is not None:
+            return
+
+        # Check compiler availability first
+        if not has_c_compiler():
+            pytest.skip("No C compiler available")
+
+        codes = []
+        if self.sources:
+            codes.extend(self.sources)
+        if self.code is not None:
+            codes.append(self.suffix)
+
+        needs_f77 = False
+        needs_f90 = False
+        for fn in codes:
+            if fn.endswith('.f'):
+                needs_f77 = True
+            elif fn.endswith('.f90'):
+                needs_f90 = True
+        if needs_f77 and not has_f77_compiler():
+            pytest.skip("No Fortran 77 compiler available")
+        if needs_f90 and not has_f90_compiler():
+            pytest.skip("No Fortran 90 compiler available")
+
+        # Build the module
+        if self.code is not None:
+            self.module = build_code(self.code, options=self.options,
+                                     skip=self.skip, only=self.only,
+                                     suffix=self.suffix,
+                                     module_name=self.module_name)
+
+        if self.sources is not None:
+            self.module = build_module(self.sources, options=self.options,
+                                       skip=self.skip, only=self.only,
+                                       module_name=self.module_name)
diff --git a/venv/Lib/site-packages/numpy/f2py/use_rules.py b/venv/Lib/site-packages/numpy/f2py/use_rules.py
new file mode 100644
index 000000000..f1b71e83c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/f2py/use_rules.py
@@ -0,0 +1,113 @@
+#!/usr/bin/env python3
+"""
+
+Build 'use others module data' mechanism for f2py2e.
+
+Unfinished.
+
+Copyright 2000 Pearu Peterson all rights reserved,
+Pearu Peterson <pearu@ioc.ee>
+Permission to use, modify, and distribute this software is given under the
+terms of the NumPy License.
+
+NO WARRANTY IS EXPRESSED OR IMPLIED.  USE AT YOUR OWN RISK.
+$Date: 2000/09/10 12:35:43 $
+Pearu Peterson
+
+"""
+__version__ = "$Revision: 1.3 $"[10:-1]
+
+f2py_version = 'See `f2py -v`'
+
+
+from .auxfuncs import (
+    applyrules, dictappend, gentitle, hasnote, outmess
+)
+
+
+usemodule_rules = {
+    'body': """
+#begintitle#
+static char doc_#apiname#[] = \"\\\nVariable wrapper signature:\\n\\
+\t #name# = get_#name#()\\n\\
+Arguments:\\n\\
+#docstr#\";
+extern F_MODFUNC(#usemodulename#,#USEMODULENAME#,#realname#,#REALNAME#);
+static PyObject *#apiname#(PyObject *capi_self, PyObject *capi_args) {
+/*#decl#*/
+\tif (!PyArg_ParseTuple(capi_args, \"\")) goto capi_fail;
+printf(\"c: %d\\n\",F_MODFUNC(#usemodulename#,#USEMODULENAME#,#realname#,#REALNAME#));
+\treturn Py_BuildValue(\"\");
+capi_fail:
+\treturn NULL;
+}
+""",
+    'method': '\t{\"get_#name#\",#apiname#,METH_VARARGS|METH_KEYWORDS,doc_#apiname#},',
+    'need': ['F_MODFUNC']
+}
+
+################
+
+
+def buildusevars(m, r):
+    ret = {}
+    outmess(
+        '\t\tBuilding use variable hooks for module "%s" (feature only for F90/F95)...\n' % (m['name']))
+    varsmap = {}
+    revmap = {}
+    if 'map' in r:
+        for k in r['map'].keys():
+            if r['map'][k] in revmap:
+                outmess('\t\t\tVariable "%s<=%s" is already mapped by "%s". Skipping.\n' % (
+                    r['map'][k], k, revmap[r['map'][k]]))
+            else:
+                revmap[r['map'][k]] = k
+    if 'only' in r and r['only']:
+        for v in r['map'].keys():
+            if r['map'][v] in m['vars']:
+
+                if revmap[r['map'][v]] == v:
+                    varsmap[v] = r['map'][v]
+                else:
+                    outmess('\t\t\tIgnoring map "%s=>%s". See above.\n' %
+                            (v, r['map'][v]))
+            else:
+                outmess(
+                    '\t\t\tNo definition for variable "%s=>%s". Skipping.\n' % (v, r['map'][v]))
+    else:
+        for v in m['vars'].keys():
+            if v in revmap:
+                varsmap[v] = revmap[v]
+            else:
+                varsmap[v] = v
+    for v in varsmap.keys():
+        ret = dictappend(ret, buildusevar(v, varsmap[v], m['vars'], m['name']))
+    return ret
+
+
+def buildusevar(name, realname, vars, usemodulename):
+    outmess('\t\t\tConstructing wrapper function for variable "%s=>%s"...\n' % (
+        name, realname))
+    ret = {}
+    vrd = {'name': name,
+           'realname': realname,
+           'REALNAME': realname.upper(),
+           'usemodulename': usemodulename,
+           'USEMODULENAME': usemodulename.upper(),
+           'texname': name.replace('_', '\\_'),
+           'begintitle': gentitle('%s=>%s' % (name, realname)),
+           'endtitle': gentitle('end of %s=>%s' % (name, realname)),
+           'apiname': '#modulename#_use_%s_from_%s' % (realname, usemodulename)
+           }
+    nummap = {0: 'Ro', 1: 'Ri', 2: 'Rii', 3: 'Riii', 4: 'Riv',
+              5: 'Rv', 6: 'Rvi', 7: 'Rvii', 8: 'Rviii', 9: 'Rix'}
+    vrd['texnamename'] = name
+    for i in nummap.keys():
+        vrd['texnamename'] = vrd['texnamename'].replace(repr(i), nummap[i])
+    if hasnote(vars[realname]):
+        vrd['note'] = vars[realname]['note']
+    rd = dictappend({}, vrd)
+
+    print(name, realname, vars[realname])
+    ret = applyrules(usemodule_rules, rd)
+    return ret
diff --git a/venv/Lib/site-packages/numpy/fft/__init__.py b/venv/Lib/site-packages/numpy/fft/__init__.py
new file mode 100644
index 000000000..36cfe81b3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/__init__.py
@@ -0,0 +1,199 @@
+"""
+Discrete Fourier Transform (:mod:`numpy.fft`)
+=============================================
+
+.. currentmodule:: numpy.fft
+
+Standard FFTs
+-------------
+
+.. autosummary::
+   :toctree: generated/
+
+   fft       Discrete Fourier transform.
+   ifft      Inverse discrete Fourier transform.
+   fft2      Discrete Fourier transform in two dimensions.
+   ifft2     Inverse discrete Fourier transform in two dimensions.
+   fftn      Discrete Fourier transform in N-dimensions.
+   ifftn     Inverse discrete Fourier transform in N dimensions.
+
+Real FFTs
+---------
+
+.. autosummary::
+   :toctree: generated/
+
+   rfft      Real discrete Fourier transform.
+   irfft     Inverse real discrete Fourier transform.
+   rfft2     Real discrete Fourier transform in two dimensions.
+   irfft2    Inverse real discrete Fourier transform in two dimensions.
+   rfftn     Real discrete Fourier transform in N dimensions.
+   irfftn    Inverse real discrete Fourier transform in N dimensions.
+
+Hermitian FFTs
+--------------
+
+.. autosummary::
+   :toctree: generated/
+
+   hfft      Hermitian discrete Fourier transform.
+   ihfft     Inverse Hermitian discrete Fourier transform.
+
+Helper routines
+---------------
+
+.. autosummary::
+   :toctree: generated/
+
+   fftfreq   Discrete Fourier Transform sample frequencies.
+   rfftfreq  DFT sample frequencies (for usage with rfft, irfft).
+   fftshift  Shift zero-frequency component to center of spectrum.
+   ifftshift Inverse of fftshift.
+
+
+Background information
+----------------------
+
+Fourier analysis is fundamentally a method for expressing a function as a
+sum of periodic components, and for recovering the function from those
+components.  When both the function and its Fourier transform are
+replaced with discretized counterparts, it is called the discrete Fourier
+transform (DFT).  The DFT has become a mainstay of numerical computing in
+part because of a very fast algorithm for computing it, called the Fast
+Fourier Transform (FFT), which was known to Gauss (1805) and was brought
+to light in its current form by Cooley and Tukey [CT]_.  Press et al. [NR]_
+provide an accessible introduction to Fourier analysis and its
+applications.
+
+Because the discrete Fourier transform separates its input into
+components that contribute at discrete frequencies, it has a great number
+of applications in digital signal processing, e.g., for filtering, and in
+this context the discretized input to the transform is customarily
+referred to as a *signal*, which exists in the *time domain*.  The output
+is called a *spectrum* or *transform* and exists in the *frequency
+domain*.
+
+Implementation details
+----------------------
+
+There are many ways to define the DFT, varying in the sign of the
+exponent, normalization, etc.  In this implementation, the DFT is defined
+as
+
+.. math::
+   A_k =  \\sum_{m=0}^{n-1} a_m \\exp\\left\\{-2\\pi i{mk \\over n}\\right\\}
+   \\qquad k = 0,\\ldots,n-1.
+
+The DFT is in general defined for complex inputs and outputs, and a
+single-frequency component at linear frequency :math:`f` is
+represented by a complex exponential
+:math:`a_m = \\exp\\{2\\pi i\\,f m\\Delta t\\}`, where :math:`\\Delta t`
+is the sampling interval.
+
+The values in the result follow so-called "standard" order: If ``A =
+fft(a, n)``, then ``A[0]`` contains the zero-frequency term (the sum of
+the signal), which is always purely real for real inputs. Then ``A[1:n/2]``
+contains the positive-frequency terms, and ``A[n/2+1:]`` contains the
+negative-frequency terms, in order of decreasingly negative frequency.
+For an even number of input points, ``A[n/2]`` represents both positive and
+negative Nyquist frequency, and is also purely real for real input.  For
+an odd number of input points, ``A[(n-1)/2]`` contains the largest positive
+frequency, while ``A[(n+1)/2]`` contains the largest negative frequency.
+The routine ``np.fft.fftfreq(n)`` returns an array giving the frequencies
+of corresponding elements in the output.  The routine
+``np.fft.fftshift(A)`` shifts transforms and their frequencies to put the
+zero-frequency components in the middle, and ``np.fft.ifftshift(A)`` undoes
+that shift.
+
+When the input `a` is a time-domain signal and ``A = fft(a)``, ``np.abs(A)``
+is its amplitude spectrum and ``np.abs(A)**2`` is its power spectrum.
+The phase spectrum is obtained by ``np.angle(A)``.
+
+The inverse DFT is defined as
+
+.. math::
+   a_m = \\frac{1}{n}\\sum_{k=0}^{n-1}A_k\\exp\\left\\{2\\pi i{mk\\over n}\\right\\}
+   \\qquad m = 0,\\ldots,n-1.
+
+It differs from the forward transform by the sign of the exponential
+argument and the default normalization by :math:`1/n`.
+
+Type Promotion
+--------------
+
+`numpy.fft` promotes ``float32`` and ``complex64`` arrays to ``float64`` and
+``complex128`` arrays respectively. For an FFT implementation that does not
+promote input arrays, see `scipy.fftpack`.
+
+Normalization
+-------------
+
+The default normalization has the direct transforms unscaled and the inverse
+transforms are scaled by :math:`1/n`. It is possible to obtain unitary
+transforms by setting the keyword argument ``norm`` to ``"ortho"`` (default is
+`None`) so that both direct and inverse transforms will be scaled by
+:math:`1/\\sqrt{n}`.
+
+Real and Hermitian transforms
+-----------------------------
+
+When the input is purely real, its transform is Hermitian, i.e., the
+component at frequency :math:`f_k` is the complex conjugate of the
+component at frequency :math:`-f_k`, which means that for real
+inputs there is no information in the negative frequency components that
+is not already available from the positive frequency components.
+The family of `rfft` functions is
+designed to operate on real inputs, and exploits this symmetry by
+computing only the positive frequency components, up to and including the
+Nyquist frequency.  Thus, ``n`` input points produce ``n/2+1`` complex
+output points.  The inverses of this family assumes the same symmetry of
+its input, and for an output of ``n`` points uses ``n/2+1`` input points.
+
+Correspondingly, when the spectrum is purely real, the signal is
+Hermitian.  The `hfft` family of functions exploits this symmetry by
+using ``n/2+1`` complex points in the input (time) domain for ``n`` real
+points in the frequency domain.
+
+In higher dimensions, FFTs are used, e.g., for image analysis and
+filtering.  The computational efficiency of the FFT means that it can
+also be a faster way to compute large convolutions, using the property
+that a convolution in the time domain is equivalent to a point-by-point
+multiplication in the frequency domain.
+
+Higher dimensions
+-----------------
+
+In two dimensions, the DFT is defined as
+
+.. math::
+   A_{kl} =  \\sum_{m=0}^{M-1} \\sum_{n=0}^{N-1}
+   a_{mn}\\exp\\left\\{-2\\pi i \\left({mk\\over M}+{nl\\over N}\\right)\\right\\}
+   \\qquad k = 0, \\ldots, M-1;\\quad l = 0, \\ldots, N-1,
+
+which extends in the obvious way to higher dimensions, and the inverses
+in higher dimensions also extend in the same way.
+
+References
+----------
+
+.. [CT] Cooley, James W., and John W. Tukey, 1965, "An algorithm for the
+        machine calculation of complex Fourier series," *Math. Comput.*
+        19: 297-301.
+
+.. [NR] Press, W., Teukolsky, S., Vetterline, W.T., and Flannery, B.P.,
+        2007, *Numerical Recipes: The Art of Scientific Computing*, ch.
+        12-13.  Cambridge Univ. Press, Cambridge, UK.
+
+Examples
+--------
+
+For examples, see the various functions.
+
+"""
+
+from ._pocketfft import *
+from .helper import *
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/fft/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..ff25e2821
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/__pycache__/_pocketfft.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/__pycache__/_pocketfft.cpython-36.pyc
new file mode 100644
index 000000000..faffbcd34
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/__pycache__/_pocketfft.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/__pycache__/helper.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/__pycache__/helper.cpython-36.pyc
new file mode 100644
index 000000000..7eb0bf2a5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/__pycache__/helper.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..18f79ac00
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/_pocketfft.py b/venv/Lib/site-packages/numpy/fft/_pocketfft.py
new file mode 100644
index 000000000..e9f554fe7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/_pocketfft.py
@@ -0,0 +1,1304 @@
+"""
+Discrete Fourier Transforms
+
+Routines in this module:
+
+fft(a, n=None, axis=-1)
+ifft(a, n=None, axis=-1)
+rfft(a, n=None, axis=-1)
+irfft(a, n=None, axis=-1)
+hfft(a, n=None, axis=-1)
+ihfft(a, n=None, axis=-1)
+fftn(a, s=None, axes=None)
+ifftn(a, s=None, axes=None)
+rfftn(a, s=None, axes=None)
+irfftn(a, s=None, axes=None)
+fft2(a, s=None, axes=(-2,-1))
+ifft2(a, s=None, axes=(-2, -1))
+rfft2(a, s=None, axes=(-2,-1))
+irfft2(a, s=None, axes=(-2, -1))
+
+i = inverse transform
+r = transform of purely real data
+h = Hermite transform
+n = n-dimensional transform
+2 = 2-dimensional transform
+(Note: 2D routines are just nD routines with different default
+behavior.)
+
+"""
+__all__ = ['fft', 'ifft', 'rfft', 'irfft', 'hfft', 'ihfft', 'rfftn',
+           'irfftn', 'rfft2', 'irfft2', 'fft2', 'ifft2', 'fftn', 'ifftn']
+
+import functools
+
+from numpy.core import asarray, zeros, swapaxes, conjugate, take, sqrt
+from . import _pocketfft_internal as pfi
+from numpy.core.multiarray import normalize_axis_index
+from numpy.core import overrides
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy.fft')
+
+
+# `inv_norm` is a float by which the result of the transform needs to be
+# divided. This replaces the original, more intuitive 'fct` parameter to avoid
+# divisions by zero (or alternatively additional checks) in the case of
+# zero-length axes during its computation.
+def _raw_fft(a, n, axis, is_real, is_forward, inv_norm):
+    axis = normalize_axis_index(axis, a.ndim)
+    if n is None:
+        n = a.shape[axis]
+
+    if n < 1:
+        raise ValueError("Invalid number of FFT data points (%d) specified."
+                         % n)
+
+    fct = 1/inv_norm
+
+    if a.shape[axis] != n:
+        s = list(a.shape)
+        index = [slice(None)]*len(s)
+        if s[axis] > n:
+            index[axis] = slice(0, n)
+            a = a[tuple(index)]
+        else:
+            index[axis] = slice(0, s[axis])
+            s[axis] = n
+            z = zeros(s, a.dtype.char)
+            z[tuple(index)] = a
+            a = z
+
+    if axis == a.ndim-1:
+        r = pfi.execute(a, is_real, is_forward, fct)
+    else:
+        a = swapaxes(a, axis, -1)
+        r = pfi.execute(a, is_real, is_forward, fct)
+        r = swapaxes(r, axis, -1)
+    return r
+
+
+def _unitary(norm):
+    if norm is None:
+        return False
+    if norm=="ortho":
+        return True
+    raise ValueError("Invalid norm value %s, should be None or \"ortho\"."
+                     % norm)
+
+
+def _fft_dispatcher(a, n=None, axis=None, norm=None):
+    return (a,)
+
+
+@array_function_dispatch(_fft_dispatcher)
+def fft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the one-dimensional discrete Fourier Transform.
+
+    This function computes the one-dimensional *n*-point discrete Fourier
+    Transform (DFT) with the efficient Fast Fourier Transform (FFT)
+    algorithm [CT].
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex.
+    n : int, optional
+        Length of the transformed axis of the output.
+        If `n` is smaller than the length of the input, the input is cropped.
+        If it is larger, the input is padded with zeros.  If `n` is not given,
+        the length of the input along the axis specified by `axis` is used.
+    axis : int, optional
+        Axis over which to compute the FFT.  If not given, the last axis is
+        used.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+
+    Raises
+    ------
+    IndexError
+        if `axes` is larger than the last axis of `a`.
+
+    See Also
+    --------
+    numpy.fft : for definition of the DFT and conventions used.
+    ifft : The inverse of `fft`.
+    fft2 : The two-dimensional FFT.
+    fftn : The *n*-dimensional FFT.
+    rfftn : The *n*-dimensional FFT of real input.
+    fftfreq : Frequency bins for given FFT parameters.
+
+    Notes
+    -----
+    FFT (Fast Fourier Transform) refers to a way the discrete Fourier
+    Transform (DFT) can be calculated efficiently, by using symmetries in the
+    calculated terms.  The symmetry is highest when `n` is a power of 2, and
+    the transform is therefore most efficient for these sizes.
+
+    The DFT is defined, with the conventions used in this implementation, in
+    the documentation for the `numpy.fft` module.
+
+    References
+    ----------
+    .. [CT] Cooley, James W., and John W. Tukey, 1965, "An algorithm for the
+            machine calculation of complex Fourier series," *Math. Comput.*
+            19: 297-301.
+
+    Examples
+    --------
+    >>> np.fft.fft(np.exp(2j * np.pi * np.arange(8) / 8))
+    array([-2.33486982e-16+1.14423775e-17j,  8.00000000e+00-1.25557246e-15j,
+            2.33486982e-16+2.33486982e-16j,  0.00000000e+00+1.22464680e-16j,
+           -1.14423775e-17+2.33486982e-16j,  0.00000000e+00+5.20784380e-16j,
+            1.14423775e-17+1.14423775e-17j,  0.00000000e+00+1.22464680e-16j])
+
+    In this example, real input has an FFT which is Hermitian, i.e., symmetric
+    in the real part and anti-symmetric in the imaginary part, as described in
+    the `numpy.fft` documentation:
+
+    >>> import matplotlib.pyplot as plt
+    >>> t = np.arange(256)
+    >>> sp = np.fft.fft(np.sin(t))
+    >>> freq = np.fft.fftfreq(t.shape[-1])
+    >>> plt.plot(freq, sp.real, freq, sp.imag)
+    [<matplotlib.lines.Line2D object at 0x...>, <matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.show()
+
+    """
+
+    a = asarray(a)
+    if n is None:
+        n = a.shape[axis]
+    inv_norm = 1
+    if norm is not None and _unitary(norm):
+        inv_norm = sqrt(n)
+    output = _raw_fft(a, n, axis, False, True, inv_norm)
+    return output
+
+
+@array_function_dispatch(_fft_dispatcher)
+def ifft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the one-dimensional inverse discrete Fourier Transform.
+
+    This function computes the inverse of the one-dimensional *n*-point
+    discrete Fourier transform computed by `fft`.  In other words,
+    ``ifft(fft(a)) == a`` to within numerical accuracy.
+    For a general description of the algorithm and definitions,
+    see `numpy.fft`.
+
+    The input should be ordered in the same way as is returned by `fft`,
+    i.e.,
+
+    * ``a[0]`` should contain the zero frequency term,
+    * ``a[1:n//2]`` should contain the positive-frequency terms,
+    * ``a[n//2 + 1:]`` should contain the negative-frequency terms, in
+      increasing order starting from the most negative frequency.
+
+    For an even number of input points, ``A[n//2]`` represents the sum of
+    the values at the positive and negative Nyquist frequencies, as the two
+    are aliased together. See `numpy.fft` for details.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex.
+    n : int, optional
+        Length of the transformed axis of the output.
+        If `n` is smaller than the length of the input, the input is cropped.
+        If it is larger, the input is padded with zeros.  If `n` is not given,
+        the length of the input along the axis specified by `axis` is used.
+        See notes about padding issues.
+    axis : int, optional
+        Axis over which to compute the inverse DFT.  If not given, the last
+        axis is used.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+
+    Raises
+    ------
+    IndexError
+        If `axes` is larger than the last axis of `a`.
+
+    See Also
+    --------
+    numpy.fft : An introduction, with definitions and general explanations.
+    fft : The one-dimensional (forward) FFT, of which `ifft` is the inverse
+    ifft2 : The two-dimensional inverse FFT.
+    ifftn : The n-dimensional inverse FFT.
+
+    Notes
+    -----
+    If the input parameter `n` is larger than the size of the input, the input
+    is padded by appending zeros at the end.  Even though this is the common
+    approach, it might lead to surprising results.  If a different padding is
+    desired, it must be performed before calling `ifft`.
+
+    Examples
+    --------
+    >>> np.fft.ifft([0, 4, 0, 0])
+    array([ 1.+0.j,  0.+1.j, -1.+0.j,  0.-1.j]) # may vary
+
+    Create and plot a band-limited signal with random phases:
+
+    >>> import matplotlib.pyplot as plt
+    >>> t = np.arange(400)
+    >>> n = np.zeros((400,), dtype=complex)
+    >>> n[40:60] = np.exp(1j*np.random.uniform(0, 2*np.pi, (20,)))
+    >>> s = np.fft.ifft(n)
+    >>> plt.plot(t, s.real, 'b-', t, s.imag, 'r--')
+    [<matplotlib.lines.Line2D object at ...>, <matplotlib.lines.Line2D object at ...>]
+    >>> plt.legend(('real', 'imaginary'))
+    <matplotlib.legend.Legend object at ...>
+    >>> plt.show()
+
+    """
+    a = asarray(a)
+    if n is None:
+        n = a.shape[axis]
+    if norm is not None and _unitary(norm):
+        inv_norm = sqrt(max(n, 1))
+    else:
+        inv_norm = n
+    output = _raw_fft(a, n, axis, False, False, inv_norm)
+    return output
+
+
+
+@array_function_dispatch(_fft_dispatcher)
+def rfft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the one-dimensional discrete Fourier Transform for real input.
+
+    This function computes the one-dimensional *n*-point discrete Fourier
+    Transform (DFT) of a real-valued array by means of an efficient algorithm
+    called the Fast Fourier Transform (FFT).
+
+    Parameters
+    ----------
+    a : array_like
+        Input array
+    n : int, optional
+        Number of points along transformation axis in the input to use.
+        If `n` is smaller than the length of the input, the input is cropped.
+        If it is larger, the input is padded with zeros. If `n` is not given,
+        the length of the input along the axis specified by `axis` is used.
+    axis : int, optional
+        Axis over which to compute the FFT. If not given, the last axis is
+        used.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+        If `n` is even, the length of the transformed axis is ``(n/2)+1``.
+        If `n` is odd, the length is ``(n+1)/2``.
+
+    Raises
+    ------
+    IndexError
+        If `axis` is larger than the last axis of `a`.
+
+    See Also
+    --------
+    numpy.fft : For definition of the DFT and conventions used.
+    irfft : The inverse of `rfft`.
+    fft : The one-dimensional FFT of general (complex) input.
+    fftn : The *n*-dimensional FFT.
+    rfftn : The *n*-dimensional FFT of real input.
+
+    Notes
+    -----
+    When the DFT is computed for purely real input, the output is
+    Hermitian-symmetric, i.e. the negative frequency terms are just the complex
+    conjugates of the corresponding positive-frequency terms, and the
+    negative-frequency terms are therefore redundant.  This function does not
+    compute the negative frequency terms, and the length of the transformed
+    axis of the output is therefore ``n//2 + 1``.
+
+    When ``A = rfft(a)`` and fs is the sampling frequency, ``A[0]`` contains
+    the zero-frequency term 0*fs, which is real due to Hermitian symmetry.
+
+    If `n` is even, ``A[-1]`` contains the term representing both positive
+    and negative Nyquist frequency (+fs/2 and -fs/2), and must also be purely
+    real. If `n` is odd, there is no term at fs/2; ``A[-1]`` contains
+    the largest positive frequency (fs/2*(n-1)/n), and is complex in the
+    general case.
+
+    If the input `a` contains an imaginary part, it is silently discarded.
+
+    Examples
+    --------
+    >>> np.fft.fft([0, 1, 0, 0])
+    array([ 1.+0.j,  0.-1.j, -1.+0.j,  0.+1.j]) # may vary
+    >>> np.fft.rfft([0, 1, 0, 0])
+    array([ 1.+0.j,  0.-1.j, -1.+0.j]) # may vary
+
+    Notice how the final element of the `fft` output is the complex conjugate
+    of the second element, for real input. For `rfft`, this symmetry is
+    exploited to compute only the non-negative frequency terms.
+
+    """
+    a = asarray(a)
+    inv_norm = 1
+    if norm is not None and _unitary(norm):
+        if n is None:
+            n = a.shape[axis]
+        inv_norm = sqrt(n)
+    output = _raw_fft(a, n, axis, True, True, inv_norm)
+    return output
+
+
+@array_function_dispatch(_fft_dispatcher)
+def irfft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the inverse of the n-point DFT for real input.
+
+    This function computes the inverse of the one-dimensional *n*-point
+    discrete Fourier Transform of real input computed by `rfft`.
+    In other words, ``irfft(rfft(a), len(a)) == a`` to within numerical
+    accuracy. (See Notes below for why ``len(a)`` is necessary here.)
+
+    The input is expected to be in the form returned by `rfft`, i.e. the
+    real zero-frequency term followed by the complex positive frequency terms
+    in order of increasing frequency.  Since the discrete Fourier Transform of
+    real input is Hermitian-symmetric, the negative frequency terms are taken
+    to be the complex conjugates of the corresponding positive frequency terms.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array.
+    n : int, optional
+        Length of the transformed axis of the output.
+        For `n` output points, ``n//2+1`` input points are necessary.  If the
+        input is longer than this, it is cropped.  If it is shorter than this,
+        it is padded with zeros.  If `n` is not given, it is taken to be
+        ``2*(m-1)`` where ``m`` is the length of the input along the axis
+        specified by `axis`.
+    axis : int, optional
+        Axis over which to compute the inverse FFT. If not given, the last
+        axis is used.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+        The length of the transformed axis is `n`, or, if `n` is not given,
+        ``2*(m-1)`` where ``m`` is the length of the transformed axis of the
+        input. To get an odd number of output points, `n` must be specified.
+
+    Raises
+    ------
+    IndexError
+        If `axis` is larger than the last axis of `a`.
+
+    See Also
+    --------
+    numpy.fft : For definition of the DFT and conventions used.
+    rfft : The one-dimensional FFT of real input, of which `irfft` is inverse.
+    fft : The one-dimensional FFT.
+    irfft2 : The inverse of the two-dimensional FFT of real input.
+    irfftn : The inverse of the *n*-dimensional FFT of real input.
+
+    Notes
+    -----
+    Returns the real valued `n`-point inverse discrete Fourier transform
+    of `a`, where `a` contains the non-negative frequency terms of a
+    Hermitian-symmetric sequence. `n` is the length of the result, not the
+    input.
+
+    If you specify an `n` such that `a` must be zero-padded or truncated, the
+    extra/removed values will be added/removed at high frequencies. One can
+    thus resample a series to `m` points via Fourier interpolation by:
+    ``a_resamp = irfft(rfft(a), m)``.
+
+    The correct interpretation of the hermitian input depends on the length of
+    the original data, as given by `n`. This is because each input shape could
+    correspond to either an odd or even length signal. By default, `irfft`
+    assumes an even output length which puts the last entry at the Nyquist
+    frequency; aliasing with its symmetric counterpart. By Hermitian symmetry,
+    the value is thus treated as purely real. To avoid losing information, the
+    correct length of the real input **must** be given.
+
+    Examples
+    --------
+    >>> np.fft.ifft([1, -1j, -1, 1j])
+    array([0.+0.j,  1.+0.j,  0.+0.j,  0.+0.j]) # may vary
+    >>> np.fft.irfft([1, -1j, -1])
+    array([0.,  1.,  0.,  0.])
+
+    Notice how the last term in the input to the ordinary `ifft` is the
+    complex conjugate of the second term, and the output has zero imaginary
+    part everywhere.  When calling `irfft`, the negative frequencies are not
+    specified, and the output array is purely real.
+
+    """
+    a = asarray(a)
+    if n is None:
+        n = (a.shape[axis] - 1) * 2
+    inv_norm = n
+    if norm is not None and _unitary(norm):
+        inv_norm = sqrt(n)
+    output = _raw_fft(a, n, axis, True, False, inv_norm)
+    return output
+
+
+@array_function_dispatch(_fft_dispatcher)
+def hfft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the FFT of a signal that has Hermitian symmetry, i.e., a real
+    spectrum.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array.
+    n : int, optional
+        Length of the transformed axis of the output. For `n` output
+        points, ``n//2 + 1`` input points are necessary.  If the input is
+        longer than this, it is cropped.  If it is shorter than this, it is
+        padded with zeros.  If `n` is not given, it is taken to be ``2*(m-1)``
+        where ``m`` is the length of the input along the axis specified by
+        `axis`.
+    axis : int, optional
+        Axis over which to compute the FFT. If not given, the last
+        axis is used.
+    norm : {None, "ortho"}, optional
+        Normalization mode (see `numpy.fft`). Default is None.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    out : ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+        The length of the transformed axis is `n`, or, if `n` is not given,
+        ``2*m - 2`` where ``m`` is the length of the transformed axis of
+        the input. To get an odd number of output points, `n` must be
+        specified, for instance as ``2*m - 1`` in the typical case,
+
+    Raises
+    ------
+    IndexError
+        If `axis` is larger than the last axis of `a`.
+
+    See also
+    --------
+    rfft : Compute the one-dimensional FFT for real input.
+    ihfft : The inverse of `hfft`.
+
+    Notes
+    -----
+    `hfft`/`ihfft` are a pair analogous to `rfft`/`irfft`, but for the
+    opposite case: here the signal has Hermitian symmetry in the time
+    domain and is real in the frequency domain. So here it's `hfft` for
+    which you must supply the length of the result if it is to be odd.
+
+    * even: ``ihfft(hfft(a, 2*len(a) - 2)) == a``, within roundoff error,
+    * odd: ``ihfft(hfft(a, 2*len(a) - 1)) == a``, within roundoff error.
+
+    The correct interpretation of the hermitian input depends on the length of
+    the original data, as given by `n`. This is because each input shape could
+    correspond to either an odd or even length signal. By default, `hfft`
+    assumes an even output length which puts the last entry at the Nyquist
+    frequency; aliasing with its symmetric counterpart. By Hermitian symmetry,
+    the value is thus treated as purely real. To avoid losing information, the
+    shape of the full signal **must** be given.
+
+    Examples
+    --------
+    >>> signal = np.array([1, 2, 3, 4, 3, 2])
+    >>> np.fft.fft(signal)
+    array([15.+0.j,  -4.+0.j,   0.+0.j,  -1.-0.j,   0.+0.j,  -4.+0.j]) # may vary
+    >>> np.fft.hfft(signal[:4]) # Input first half of signal
+    array([15.,  -4.,   0.,  -1.,   0.,  -4.])
+    >>> np.fft.hfft(signal, 6)  # Input entire signal and truncate
+    array([15.,  -4.,   0.,  -1.,   0.,  -4.])
+
+
+    >>> signal = np.array([[1, 1.j], [-1.j, 2]])
+    >>> np.conj(signal.T) - signal   # check Hermitian symmetry
+    array([[ 0.-0.j,  -0.+0.j], # may vary
+           [ 0.+0.j,  0.-0.j]])
+    >>> freq_spectrum = np.fft.hfft(signal)
+    >>> freq_spectrum
+    array([[ 1.,  1.],
+           [ 2., -2.]])
+
+    """
+    a = asarray(a)
+    if n is None:
+        n = (a.shape[axis] - 1) * 2
+    unitary = _unitary(norm)
+    return irfft(conjugate(a), n, axis) * (sqrt(n) if unitary else n)
+
+
+@array_function_dispatch(_fft_dispatcher)
+def ihfft(a, n=None, axis=-1, norm=None):
+    """
+    Compute the inverse FFT of a signal that has Hermitian symmetry.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    n : int, optional
+        Length of the inverse FFT, the number of points along
+        transformation axis in the input to use.  If `n` is smaller than
+        the length of the input, the input is cropped.  If it is larger,
+        the input is padded with zeros. If `n` is not given, the length of
+        the input along the axis specified by `axis` is used.
+    axis : int, optional
+        Axis over which to compute the inverse FFT. If not given, the last
+        axis is used.
+    norm : {None, "ortho"}, optional
+        Normalization mode (see `numpy.fft`). Default is None.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axis
+        indicated by `axis`, or the last one if `axis` is not specified.
+        The length of the transformed axis is ``n//2 + 1``.
+
+    See also
+    --------
+    hfft, irfft
+
+    Notes
+    -----
+    `hfft`/`ihfft` are a pair analogous to `rfft`/`irfft`, but for the
+    opposite case: here the signal has Hermitian symmetry in the time
+    domain and is real in the frequency domain. So here it's `hfft` for
+    which you must supply the length of the result if it is to be odd:
+
+    * even: ``ihfft(hfft(a, 2*len(a) - 2)) == a``, within roundoff error,
+    * odd: ``ihfft(hfft(a, 2*len(a) - 1)) == a``, within roundoff error.
+
+    Examples
+    --------
+    >>> spectrum = np.array([ 15, -4, 0, -1, 0, -4])
+    >>> np.fft.ifft(spectrum)
+    array([1.+0.j,  2.+0.j,  3.+0.j,  4.+0.j,  3.+0.j,  2.+0.j]) # may vary
+    >>> np.fft.ihfft(spectrum)
+    array([ 1.-0.j,  2.-0.j,  3.-0.j,  4.-0.j]) # may vary
+
+    """
+    a = asarray(a)
+    if n is None:
+        n = a.shape[axis]
+    unitary = _unitary(norm)
+    output = conjugate(rfft(a, n, axis))
+    return output * (1 / (sqrt(n) if unitary else n))
+
+
+def _cook_nd_args(a, s=None, axes=None, invreal=0):
+    if s is None:
+        shapeless = 1
+        if axes is None:
+            s = list(a.shape)
+        else:
+            s = take(a.shape, axes)
+    else:
+        shapeless = 0
+    s = list(s)
+    if axes is None:
+        axes = list(range(-len(s), 0))
+    if len(s) != len(axes):
+        raise ValueError("Shape and axes have different lengths.")
+    if invreal and shapeless:
+        s[-1] = (a.shape[axes[-1]] - 1) * 2
+    return s, axes
+
+
+def _raw_fftnd(a, s=None, axes=None, function=fft, norm=None):
+    a = asarray(a)
+    s, axes = _cook_nd_args(a, s, axes)
+    itl = list(range(len(axes)))
+    itl.reverse()
+    for ii in itl:
+        a = function(a, n=s[ii], axis=axes[ii], norm=norm)
+    return a
+
+
+def _fftn_dispatcher(a, s=None, axes=None, norm=None):
+    return (a,)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def fftn(a, s=None, axes=None, norm=None):
+    """
+    Compute the N-dimensional discrete Fourier Transform.
+
+    This function computes the *N*-dimensional discrete Fourier Transform over
+    any number of axes in an *M*-dimensional array by means of the Fast Fourier
+    Transform (FFT).
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex.
+    s : sequence of ints, optional
+        Shape (length of each transformed axis) of the output
+        (``s[0]`` refers to axis 0, ``s[1]`` to axis 1, etc.).
+        This corresponds to ``n`` for ``fft(x, n)``.
+        Along any axis, if the given shape is smaller than that of the input,
+        the input is cropped.  If it is larger, the input is padded with zeros.
+        if `s` is not given, the shape of the input along the axes specified
+        by `axes` is used.
+    axes : sequence of ints, optional
+        Axes over which to compute the FFT.  If not given, the last ``len(s)``
+        axes are used, or all axes if `s` is also not specified.
+        Repeated indices in `axes` means that the transform over that axis is
+        performed multiple times.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or by a combination of `s` and `a`,
+        as explained in the parameters section above.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    numpy.fft : Overall view of discrete Fourier transforms, with definitions
+        and conventions used.
+    ifftn : The inverse of `fftn`, the inverse *n*-dimensional FFT.
+    fft : The one-dimensional FFT, with definitions and conventions used.
+    rfftn : The *n*-dimensional FFT of real input.
+    fft2 : The two-dimensional FFT.
+    fftshift : Shifts zero-frequency terms to centre of array
+
+    Notes
+    -----
+    The output, analogously to `fft`, contains the term for zero frequency in
+    the low-order corner of all axes, the positive frequency terms in the
+    first half of all axes, the term for the Nyquist frequency in the middle
+    of all axes and the negative frequency terms in the second half of all
+    axes, in order of decreasingly negative frequency.
+
+    See `numpy.fft` for details, definitions and conventions used.
+
+    Examples
+    --------
+    >>> a = np.mgrid[:3, :3, :3][0]
+    >>> np.fft.fftn(a, axes=(1, 2))
+    array([[[ 0.+0.j,   0.+0.j,   0.+0.j], # may vary
+            [ 0.+0.j,   0.+0.j,   0.+0.j],
+            [ 0.+0.j,   0.+0.j,   0.+0.j]],
+           [[ 9.+0.j,   0.+0.j,   0.+0.j],
+            [ 0.+0.j,   0.+0.j,   0.+0.j],
+            [ 0.+0.j,   0.+0.j,   0.+0.j]],
+           [[18.+0.j,   0.+0.j,   0.+0.j],
+            [ 0.+0.j,   0.+0.j,   0.+0.j],
+            [ 0.+0.j,   0.+0.j,   0.+0.j]]])
+    >>> np.fft.fftn(a, (2, 2), axes=(0, 1))
+    array([[[ 2.+0.j,  2.+0.j,  2.+0.j], # may vary
+            [ 0.+0.j,  0.+0.j,  0.+0.j]],
+           [[-2.+0.j, -2.+0.j, -2.+0.j],
+            [ 0.+0.j,  0.+0.j,  0.+0.j]]])
+
+    >>> import matplotlib.pyplot as plt
+    >>> [X, Y] = np.meshgrid(2 * np.pi * np.arange(200) / 12,
+    ...                      2 * np.pi * np.arange(200) / 34)
+    >>> S = np.sin(X) + np.cos(Y) + np.random.uniform(0, 1, X.shape)
+    >>> FS = np.fft.fftn(S)
+    >>> plt.imshow(np.log(np.abs(np.fft.fftshift(FS))**2))
+    <matplotlib.image.AxesImage object at 0x...>
+    >>> plt.show()
+
+    """
+
+    return _raw_fftnd(a, s, axes, fft, norm)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def ifftn(a, s=None, axes=None, norm=None):
+    """
+    Compute the N-dimensional inverse discrete Fourier Transform.
+
+    This function computes the inverse of the N-dimensional discrete
+    Fourier Transform over any number of axes in an M-dimensional array by
+    means of the Fast Fourier Transform (FFT).  In other words,
+    ``ifftn(fftn(a)) == a`` to within numerical accuracy.
+    For a description of the definitions and conventions used, see `numpy.fft`.
+
+    The input, analogously to `ifft`, should be ordered in the same way as is
+    returned by `fftn`, i.e. it should have the term for zero frequency
+    in all axes in the low-order corner, the positive frequency terms in the
+    first half of all axes, the term for the Nyquist frequency in the middle
+    of all axes and the negative frequency terms in the second half of all
+    axes, in order of decreasingly negative frequency.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex.
+    s : sequence of ints, optional
+        Shape (length of each transformed axis) of the output
+        (``s[0]`` refers to axis 0, ``s[1]`` to axis 1, etc.).
+        This corresponds to ``n`` for ``ifft(x, n)``.
+        Along any axis, if the given shape is smaller than that of the input,
+        the input is cropped.  If it is larger, the input is padded with zeros.
+        if `s` is not given, the shape of the input along the axes specified
+        by `axes` is used.  See notes for issue on `ifft` zero padding.
+    axes : sequence of ints, optional
+        Axes over which to compute the IFFT.  If not given, the last ``len(s)``
+        axes are used, or all axes if `s` is also not specified.
+        Repeated indices in `axes` means that the inverse transform over that
+        axis is performed multiple times.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or by a combination of `s` or `a`,
+        as explained in the parameters section above.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    numpy.fft : Overall view of discrete Fourier transforms, with definitions
+         and conventions used.
+    fftn : The forward *n*-dimensional FFT, of which `ifftn` is the inverse.
+    ifft : The one-dimensional inverse FFT.
+    ifft2 : The two-dimensional inverse FFT.
+    ifftshift : Undoes `fftshift`, shifts zero-frequency terms to beginning
+        of array.
+
+    Notes
+    -----
+    See `numpy.fft` for definitions and conventions used.
+
+    Zero-padding, analogously with `ifft`, is performed by appending zeros to
+    the input along the specified dimension.  Although this is the common
+    approach, it might lead to surprising results.  If another form of zero
+    padding is desired, it must be performed before `ifftn` is called.
+
+    Examples
+    --------
+    >>> a = np.eye(4)
+    >>> np.fft.ifftn(np.fft.fftn(a, axes=(0,)), axes=(1,))
+    array([[1.+0.j,  0.+0.j,  0.+0.j,  0.+0.j], # may vary
+           [0.+0.j,  1.+0.j,  0.+0.j,  0.+0.j],
+           [0.+0.j,  0.+0.j,  1.+0.j,  0.+0.j],
+           [0.+0.j,  0.+0.j,  0.+0.j,  1.+0.j]])
+
+
+    Create and plot an image with band-limited frequency content:
+
+    >>> import matplotlib.pyplot as plt
+    >>> n = np.zeros((200,200), dtype=complex)
+    >>> n[60:80, 20:40] = np.exp(1j*np.random.uniform(0, 2*np.pi, (20, 20)))
+    >>> im = np.fft.ifftn(n).real
+    >>> plt.imshow(im)
+    <matplotlib.image.AxesImage object at 0x...>
+    >>> plt.show()
+
+    """
+
+    return _raw_fftnd(a, s, axes, ifft, norm)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def fft2(a, s=None, axes=(-2, -1), norm=None):
+    """
+    Compute the 2-dimensional discrete Fourier Transform
+
+    This function computes the *n*-dimensional discrete Fourier Transform
+    over any axes in an *M*-dimensional array by means of the
+    Fast Fourier Transform (FFT).  By default, the transform is computed over
+    the last two axes of the input array, i.e., a 2-dimensional FFT.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex
+    s : sequence of ints, optional
+        Shape (length of each transformed axis) of the output
+        (``s[0]`` refers to axis 0, ``s[1]`` to axis 1, etc.).
+        This corresponds to ``n`` for ``fft(x, n)``.
+        Along each axis, if the given shape is smaller than that of the input,
+        the input is cropped.  If it is larger, the input is padded with zeros.
+        if `s` is not given, the shape of the input along the axes specified
+        by `axes` is used.
+    axes : sequence of ints, optional
+        Axes over which to compute the FFT.  If not given, the last two
+        axes are used.  A repeated index in `axes` means the transform over
+        that axis is performed multiple times.  A one-element sequence means
+        that a one-dimensional FFT is performed.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or the last two axes if `axes` is not given.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length, or `axes` not given and
+        ``len(s) != 2``.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    numpy.fft : Overall view of discrete Fourier transforms, with definitions
+         and conventions used.
+    ifft2 : The inverse two-dimensional FFT.
+    fft : The one-dimensional FFT.
+    fftn : The *n*-dimensional FFT.
+    fftshift : Shifts zero-frequency terms to the center of the array.
+        For two-dimensional input, swaps first and third quadrants, and second
+        and fourth quadrants.
+
+    Notes
+    -----
+    `fft2` is just `fftn` with a different default for `axes`.
+
+    The output, analogously to `fft`, contains the term for zero frequency in
+    the low-order corner of the transformed axes, the positive frequency terms
+    in the first half of these axes, the term for the Nyquist frequency in the
+    middle of the axes and the negative frequency terms in the second half of
+    the axes, in order of decreasingly negative frequency.
+
+    See `fftn` for details and a plotting example, and `numpy.fft` for
+    definitions and conventions used.
+
+
+    Examples
+    --------
+    >>> a = np.mgrid[:5, :5][0]
+    >>> np.fft.fft2(a)
+    array([[ 50.  +0.j        ,   0.  +0.j        ,   0.  +0.j        , # may vary
+              0.  +0.j        ,   0.  +0.j        ],
+           [-12.5+17.20477401j,   0.  +0.j        ,   0.  +0.j        ,
+              0.  +0.j        ,   0.  +0.j        ],
+           [-12.5 +4.0614962j ,   0.  +0.j        ,   0.  +0.j        ,
+              0.  +0.j        ,   0.  +0.j        ],
+           [-12.5 -4.0614962j ,   0.  +0.j        ,   0.  +0.j        ,
+              0.  +0.j        ,   0.  +0.j        ],
+           [-12.5-17.20477401j,   0.  +0.j        ,   0.  +0.j        ,
+              0.  +0.j        ,   0.  +0.j        ]])
+
+    """
+
+    return _raw_fftnd(a, s, axes, fft, norm)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def ifft2(a, s=None, axes=(-2, -1), norm=None):
+    """
+    Compute the 2-dimensional inverse discrete Fourier Transform.
+
+    This function computes the inverse of the 2-dimensional discrete Fourier
+    Transform over any number of axes in an M-dimensional array by means of
+    the Fast Fourier Transform (FFT).  In other words, ``ifft2(fft2(a)) == a``
+    to within numerical accuracy.  By default, the inverse transform is
+    computed over the last two axes of the input array.
+
+    The input, analogously to `ifft`, should be ordered in the same way as is
+    returned by `fft2`, i.e. it should have the term for zero frequency
+    in the low-order corner of the two axes, the positive frequency terms in
+    the first half of these axes, the term for the Nyquist frequency in the
+    middle of the axes and the negative frequency terms in the second half of
+    both axes, in order of decreasingly negative frequency.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, can be complex.
+    s : sequence of ints, optional
+        Shape (length of each axis) of the output (``s[0]`` refers to axis 0,
+        ``s[1]`` to axis 1, etc.).  This corresponds to `n` for ``ifft(x, n)``.
+        Along each axis, if the given shape is smaller than that of the input,
+        the input is cropped.  If it is larger, the input is padded with zeros.
+        if `s` is not given, the shape of the input along the axes specified
+        by `axes` is used.  See notes for issue on `ifft` zero padding.
+    axes : sequence of ints, optional
+        Axes over which to compute the FFT.  If not given, the last two
+        axes are used.  A repeated index in `axes` means the transform over
+        that axis is performed multiple times.  A one-element sequence means
+        that a one-dimensional FFT is performed.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or the last two axes if `axes` is not given.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length, or `axes` not given and
+        ``len(s) != 2``.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    numpy.fft : Overall view of discrete Fourier transforms, with definitions
+         and conventions used.
+    fft2 : The forward 2-dimensional FFT, of which `ifft2` is the inverse.
+    ifftn : The inverse of the *n*-dimensional FFT.
+    fft : The one-dimensional FFT.
+    ifft : The one-dimensional inverse FFT.
+
+    Notes
+    -----
+    `ifft2` is just `ifftn` with a different default for `axes`.
+
+    See `ifftn` for details and a plotting example, and `numpy.fft` for
+    definition and conventions used.
+
+    Zero-padding, analogously with `ifft`, is performed by appending zeros to
+    the input along the specified dimension.  Although this is the common
+    approach, it might lead to surprising results.  If another form of zero
+    padding is desired, it must be performed before `ifft2` is called.
+
+    Examples
+    --------
+    >>> a = 4 * np.eye(4)
+    >>> np.fft.ifft2(a)
+    array([[1.+0.j,  0.+0.j,  0.+0.j,  0.+0.j], # may vary
+           [0.+0.j,  0.+0.j,  0.+0.j,  1.+0.j],
+           [0.+0.j,  0.+0.j,  1.+0.j,  0.+0.j],
+           [0.+0.j,  1.+0.j,  0.+0.j,  0.+0.j]])
+
+    """
+
+    return _raw_fftnd(a, s, axes, ifft, norm)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def rfftn(a, s=None, axes=None, norm=None):
+    """
+    Compute the N-dimensional discrete Fourier Transform for real input.
+
+    This function computes the N-dimensional discrete Fourier Transform over
+    any number of axes in an M-dimensional real array by means of the Fast
+    Fourier Transform (FFT).  By default, all axes are transformed, with the
+    real transform performed over the last axis, while the remaining
+    transforms are complex.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, taken to be real.
+    s : sequence of ints, optional
+        Shape (length along each transformed axis) to use from the input.
+        (``s[0]`` refers to axis 0, ``s[1]`` to axis 1, etc.).
+        The final element of `s` corresponds to `n` for ``rfft(x, n)``, while
+        for the remaining axes, it corresponds to `n` for ``fft(x, n)``.
+        Along any axis, if the given shape is smaller than that of the input,
+        the input is cropped.  If it is larger, the input is padded with zeros.
+        if `s` is not given, the shape of the input along the axes specified
+        by `axes` is used.
+    axes : sequence of ints, optional
+        Axes over which to compute the FFT.  If not given, the last ``len(s)``
+        axes are used, or all axes if `s` is also not specified.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : complex ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or by a combination of `s` and `a`,
+        as explained in the parameters section above.
+        The length of the last axis transformed will be ``s[-1]//2+1``,
+        while the remaining transformed axes will have lengths according to
+        `s`, or unchanged from the input.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    irfftn : The inverse of `rfftn`, i.e. the inverse of the n-dimensional FFT
+         of real input.
+    fft : The one-dimensional FFT, with definitions and conventions used.
+    rfft : The one-dimensional FFT of real input.
+    fftn : The n-dimensional FFT.
+    rfft2 : The two-dimensional FFT of real input.
+
+    Notes
+    -----
+    The transform for real input is performed over the last transformation
+    axis, as by `rfft`, then the transform over the remaining axes is
+    performed as by `fftn`.  The order of the output is as for `rfft` for the
+    final transformation axis, and as for `fftn` for the remaining
+    transformation axes.
+
+    See `fft` for details, definitions and conventions used.
+
+    Examples
+    --------
+    >>> a = np.ones((2, 2, 2))
+    >>> np.fft.rfftn(a)
+    array([[[8.+0.j,  0.+0.j], # may vary
+            [0.+0.j,  0.+0.j]],
+           [[0.+0.j,  0.+0.j],
+            [0.+0.j,  0.+0.j]]])
+
+    >>> np.fft.rfftn(a, axes=(2, 0))
+    array([[[4.+0.j,  0.+0.j], # may vary
+            [4.+0.j,  0.+0.j]],
+           [[0.+0.j,  0.+0.j],
+            [0.+0.j,  0.+0.j]]])
+
+    """
+    a = asarray(a)
+    s, axes = _cook_nd_args(a, s, axes)
+    a = rfft(a, s[-1], axes[-1], norm)
+    for ii in range(len(axes)-1):
+        a = fft(a, s[ii], axes[ii], norm)
+    return a
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def rfft2(a, s=None, axes=(-2, -1), norm=None):
+    """
+    Compute the 2-dimensional FFT of a real array.
+
+    Parameters
+    ----------
+    a : array
+        Input array, taken to be real.
+    s : sequence of ints, optional
+        Shape of the FFT.
+    axes : sequence of ints, optional
+        Axes over which to compute the FFT.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : ndarray
+        The result of the real 2-D FFT.
+
+    See Also
+    --------
+    rfftn : Compute the N-dimensional discrete Fourier Transform for real
+            input.
+
+    Notes
+    -----
+    This is really just `rfftn` with different default behavior.
+    For more details see `rfftn`.
+
+    """
+
+    return rfftn(a, s, axes, norm)
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def irfftn(a, s=None, axes=None, norm=None):
+    """
+    Compute the inverse of the N-dimensional FFT of real input.
+
+    This function computes the inverse of the N-dimensional discrete
+    Fourier Transform for real input over any number of axes in an
+    M-dimensional array by means of the Fast Fourier Transform (FFT).  In
+    other words, ``irfftn(rfftn(a), a.shape) == a`` to within numerical
+    accuracy. (The ``a.shape`` is necessary like ``len(a)`` is for `irfft`,
+    and for the same reason.)
+
+    The input should be ordered in the same way as is returned by `rfftn`,
+    i.e. as for `irfft` for the final transformation axis, and as for `ifftn`
+    along all the other axes.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    s : sequence of ints, optional
+        Shape (length of each transformed axis) of the output
+        (``s[0]`` refers to axis 0, ``s[1]`` to axis 1, etc.). `s` is also the
+        number of input points used along this axis, except for the last axis,
+        where ``s[-1]//2+1`` points of the input are used.
+        Along any axis, if the shape indicated by `s` is smaller than that of
+        the input, the input is cropped.  If it is larger, the input is padded
+        with zeros. If `s` is not given, the shape of the input along the axes
+        specified by axes is used. Except for the last axis which is taken to be
+        ``2*(m-1)`` where ``m`` is the length of the input along that axis.
+    axes : sequence of ints, optional
+        Axes over which to compute the inverse FFT. If not given, the last
+        `len(s)` axes are used, or all axes if `s` is also not specified.
+        Repeated indices in `axes` means that the inverse transform over that
+        axis is performed multiple times.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : ndarray
+        The truncated or zero-padded input, transformed along the axes
+        indicated by `axes`, or by a combination of `s` or `a`,
+        as explained in the parameters section above.
+        The length of each transformed axis is as given by the corresponding
+        element of `s`, or the length of the input in every axis except for the
+        last one if `s` is not given.  In the final transformed axis the length
+        of the output when `s` is not given is ``2*(m-1)`` where ``m`` is the
+        length of the final transformed axis of the input.  To get an odd
+        number of output points in the final axis, `s` must be specified.
+
+    Raises
+    ------
+    ValueError
+        If `s` and `axes` have different length.
+    IndexError
+        If an element of `axes` is larger than than the number of axes of `a`.
+
+    See Also
+    --------
+    rfftn : The forward n-dimensional FFT of real input,
+            of which `ifftn` is the inverse.
+    fft : The one-dimensional FFT, with definitions and conventions used.
+    irfft : The inverse of the one-dimensional FFT of real input.
+    irfft2 : The inverse of the two-dimensional FFT of real input.
+
+    Notes
+    -----
+    See `fft` for definitions and conventions used.
+
+    See `rfft` for definitions and conventions used for real input.
+
+    The correct interpretation of the hermitian input depends on the shape of
+    the original data, as given by `s`. This is because each input shape could
+    correspond to either an odd or even length signal. By default, `irfftn`
+    assumes an even output length which puts the last entry at the Nyquist
+    frequency; aliasing with its symmetric counterpart. When performing the
+    final complex to real transform, the last value is thus treated as purely
+    real. To avoid losing information, the correct shape of the real input
+    **must** be given.
+
+    Examples
+    --------
+    >>> a = np.zeros((3, 2, 2))
+    >>> a[0, 0, 0] = 3 * 2 * 2
+    >>> np.fft.irfftn(a)
+    array([[[1.,  1.],
+            [1.,  1.]],
+           [[1.,  1.],
+            [1.,  1.]],
+           [[1.,  1.],
+            [1.,  1.]]])
+
+    """
+    a = asarray(a)
+    s, axes = _cook_nd_args(a, s, axes, invreal=1)
+    for ii in range(len(axes)-1):
+        a = ifft(a, s[ii], axes[ii], norm)
+    a = irfft(a, s[-1], axes[-1], norm)
+    return a
+
+
+@array_function_dispatch(_fftn_dispatcher)
+def irfft2(a, s=None, axes=(-2, -1), norm=None):
+    """
+    Compute the 2-dimensional inverse FFT of a real array.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array
+    s : sequence of ints, optional
+        Shape of the real output to the inverse FFT.
+    axes : sequence of ints, optional
+        The axes over which to compute the inverse fft.
+        Default is the last two axes.
+    norm : {None, "ortho"}, optional
+        .. versionadded:: 1.10.0
+
+        Normalization mode (see `numpy.fft`). Default is None.
+
+    Returns
+    -------
+    out : ndarray
+        The result of the inverse real 2-D FFT.
+
+    See Also
+    --------
+    irfftn : Compute the inverse of the N-dimensional FFT of real input.
+
+    Notes
+    -----
+    This is really `irfftn` with different defaults.
+    For more details see `irfftn`.
+
+    """
+
+    return irfftn(a, s, axes, norm)
diff --git a/venv/Lib/site-packages/numpy/fft/_pocketfft_internal.cp36-win32.pyd b/venv/Lib/site-packages/numpy/fft/_pocketfft_internal.cp36-win32.pyd
new file mode 100644
index 000000000..aaf0f38c2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/_pocketfft_internal.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/fft/helper.py b/venv/Lib/site-packages/numpy/fft/helper.py
new file mode 100644
index 000000000..3dacd9ee1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/helper.py
@@ -0,0 +1,222 @@
+"""
+Discrete Fourier Transforms - helper.py
+
+"""
+from numpy.compat import integer_types
+from numpy.core import integer, empty, arange, asarray, roll
+from numpy.core.overrides import array_function_dispatch, set_module
+
+# Created by Pearu Peterson, September 2002
+
+__all__ = ['fftshift', 'ifftshift', 'fftfreq', 'rfftfreq']
+
+integer_types = integer_types + (integer,)
+
+
+def _fftshift_dispatcher(x, axes=None):
+    return (x,)
+
+
+@array_function_dispatch(_fftshift_dispatcher, module='numpy.fft')
+def fftshift(x, axes=None):
+    """
+    Shift the zero-frequency component to the center of the spectrum.
+
+    This function swaps half-spaces for all axes listed (defaults to all).
+    Note that ``y[0]`` is the Nyquist component only if ``len(x)`` is even.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array.
+    axes : int or shape tuple, optional
+        Axes over which to shift.  Default is None, which shifts all axes.
+
+    Returns
+    -------
+    y : ndarray
+        The shifted array.
+
+    See Also
+    --------
+    ifftshift : The inverse of `fftshift`.
+
+    Examples
+    --------
+    >>> freqs = np.fft.fftfreq(10, 0.1)
+    >>> freqs
+    array([ 0.,  1.,  2., ..., -3., -2., -1.])
+    >>> np.fft.fftshift(freqs)
+    array([-5., -4., -3., -2., -1.,  0.,  1.,  2.,  3.,  4.])
+
+    Shift the zero-frequency component only along the second axis:
+
+    >>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
+    >>> freqs
+    array([[ 0.,  1.,  2.],
+           [ 3.,  4., -4.],
+           [-3., -2., -1.]])
+    >>> np.fft.fftshift(freqs, axes=(1,))
+    array([[ 2.,  0.,  1.],
+           [-4.,  3.,  4.],
+           [-1., -3., -2.]])
+
+    """
+    x = asarray(x)
+    if axes is None:
+        axes = tuple(range(x.ndim))
+        shift = [dim // 2 for dim in x.shape]
+    elif isinstance(axes, integer_types):
+        shift = x.shape[axes] // 2
+    else:
+        shift = [x.shape[ax] // 2 for ax in axes]
+
+    return roll(x, shift, axes)
+
+
+@array_function_dispatch(_fftshift_dispatcher, module='numpy.fft')
+def ifftshift(x, axes=None):
+    """
+    The inverse of `fftshift`. Although identical for even-length `x`, the
+    functions differ by one sample for odd-length `x`.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array.
+    axes : int or shape tuple, optional
+        Axes over which to calculate.  Defaults to None, which shifts all axes.
+
+    Returns
+    -------
+    y : ndarray
+        The shifted array.
+
+    See Also
+    --------
+    fftshift : Shift zero-frequency component to the center of the spectrum.
+
+    Examples
+    --------
+    >>> freqs = np.fft.fftfreq(9, d=1./9).reshape(3, 3)
+    >>> freqs
+    array([[ 0.,  1.,  2.],
+           [ 3.,  4., -4.],
+           [-3., -2., -1.]])
+    >>> np.fft.ifftshift(np.fft.fftshift(freqs))
+    array([[ 0.,  1.,  2.],
+           [ 3.,  4., -4.],
+           [-3., -2., -1.]])
+
+    """
+    x = asarray(x)
+    if axes is None:
+        axes = tuple(range(x.ndim))
+        shift = [-(dim // 2) for dim in x.shape]
+    elif isinstance(axes, integer_types):
+        shift = -(x.shape[axes] // 2)
+    else:
+        shift = [-(x.shape[ax] // 2) for ax in axes]
+
+    return roll(x, shift, axes)
+
+
+@set_module('numpy.fft')
+def fftfreq(n, d=1.0):
+    """
+    Return the Discrete Fourier Transform sample frequencies.
+
+    The returned float array `f` contains the frequency bin centers in cycles
+    per unit of the sample spacing (with zero at the start).  For instance, if
+    the sample spacing is in seconds, then the frequency unit is cycles/second.
+
+    Given a window length `n` and a sample spacing `d`::
+
+      f = [0, 1, ...,   n/2-1,     -n/2, ..., -1] / (d*n)   if n is even
+      f = [0, 1, ..., (n-1)/2, -(n-1)/2, ..., -1] / (d*n)   if n is odd
+
+    Parameters
+    ----------
+    n : int
+        Window length.
+    d : scalar, optional
+        Sample spacing (inverse of the sampling rate). Defaults to 1.
+
+    Returns
+    -------
+    f : ndarray
+        Array of length `n` containing the sample frequencies.
+
+    Examples
+    --------
+    >>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5], dtype=float)
+    >>> fourier = np.fft.fft(signal)
+    >>> n = signal.size
+    >>> timestep = 0.1
+    >>> freq = np.fft.fftfreq(n, d=timestep)
+    >>> freq
+    array([ 0.  ,  1.25,  2.5 , ..., -3.75, -2.5 , -1.25])
+
+    """
+    if not isinstance(n, integer_types):
+        raise ValueError("n should be an integer")
+    val = 1.0 / (n * d)
+    results = empty(n, int)
+    N = (n-1)//2 + 1
+    p1 = arange(0, N, dtype=int)
+    results[:N] = p1
+    p2 = arange(-(n//2), 0, dtype=int)
+    results[N:] = p2
+    return results * val
+
+
+@set_module('numpy.fft')
+def rfftfreq(n, d=1.0):
+    """
+    Return the Discrete Fourier Transform sample frequencies
+    (for usage with rfft, irfft).
+
+    The returned float array `f` contains the frequency bin centers in cycles
+    per unit of the sample spacing (with zero at the start).  For instance, if
+    the sample spacing is in seconds, then the frequency unit is cycles/second.
+
+    Given a window length `n` and a sample spacing `d`::
+
+      f = [0, 1, ...,     n/2-1,     n/2] / (d*n)   if n is even
+      f = [0, 1, ..., (n-1)/2-1, (n-1)/2] / (d*n)   if n is odd
+
+    Unlike `fftfreq` (but like `scipy.fftpack.rfftfreq`)
+    the Nyquist frequency component is considered to be positive.
+
+    Parameters
+    ----------
+    n : int
+        Window length.
+    d : scalar, optional
+        Sample spacing (inverse of the sampling rate). Defaults to 1.
+
+    Returns
+    -------
+    f : ndarray
+        Array of length ``n//2 + 1`` containing the sample frequencies.
+
+    Examples
+    --------
+    >>> signal = np.array([-2, 8, 6, 4, 1, 0, 3, 5, -3, 4], dtype=float)
+    >>> fourier = np.fft.rfft(signal)
+    >>> n = signal.size
+    >>> sample_rate = 100
+    >>> freq = np.fft.fftfreq(n, d=1./sample_rate)
+    >>> freq
+    array([  0.,  10.,  20., ..., -30., -20., -10.])
+    >>> freq = np.fft.rfftfreq(n, d=1./sample_rate)
+    >>> freq
+    array([  0.,  10.,  20.,  30.,  40.,  50.])
+
+    """
+    if not isinstance(n, integer_types):
+        raise ValueError("n should be an integer")
+    val = 1.0/(n*d)
+    N = n//2 + 1
+    results = arange(0, N, dtype=int)
+    return results * val
diff --git a/venv/Lib/site-packages/numpy/fft/setup.py b/venv/Lib/site-packages/numpy/fft/setup.py
new file mode 100644
index 000000000..9ed824e4f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/setup.py
@@ -0,0 +1,21 @@
+import sys
+
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('fft', parent_package, top_path)
+
+    config.add_subpackage('tests')
+
+    # AIX needs to be told to use large file support - at all times
+    defs = [('_LARGE_FILES', None)] if sys.platform[:3] == "aix" else []
+    # Configure pocketfft_internal
+    config.add_extension('_pocketfft_internal',
+                         sources=['_pocketfft.c'],
+                         define_macros=defs,
+                         )
+
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/fft/tests/__init__.py b/venv/Lib/site-packages/numpy/fft/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/fft/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4412082a0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_helper.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_helper.cpython-36.pyc
new file mode 100644
index 000000000..d0529ba8c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_helper.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_pocketfft.cpython-36.pyc b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_pocketfft.cpython-36.pyc
new file mode 100644
index 000000000..a8b85420a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/fft/tests/__pycache__/test_pocketfft.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/fft/tests/test_helper.py b/venv/Lib/site-packages/numpy/fft/tests/test_helper.py
new file mode 100644
index 000000000..68f5990af
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/tests/test_helper.py
@@ -0,0 +1,168 @@
+"""Test functions for fftpack.helper module
+
+Copied from fftpack.helper by Pearu Peterson, October 2005
+
+"""
+import numpy as np
+from numpy.testing import assert_array_almost_equal
+from numpy import fft, pi
+
+
+class TestFFTShift:
+
+    def test_definition(self):
+        x = [0, 1, 2, 3, 4, -4, -3, -2, -1]
+        y = [-4, -3, -2, -1, 0, 1, 2, 3, 4]
+        assert_array_almost_equal(fft.fftshift(x), y)
+        assert_array_almost_equal(fft.ifftshift(y), x)
+        x = [0, 1, 2, 3, 4, -5, -4, -3, -2, -1]
+        y = [-5, -4, -3, -2, -1, 0, 1, 2, 3, 4]
+        assert_array_almost_equal(fft.fftshift(x), y)
+        assert_array_almost_equal(fft.ifftshift(y), x)
+
+    def test_inverse(self):
+        for n in [1, 4, 9, 100, 211]:
+            x = np.random.random((n,))
+            assert_array_almost_equal(fft.ifftshift(fft.fftshift(x)), x)
+
+    def test_axes_keyword(self):
+        freqs = [[0, 1, 2], [3, 4, -4], [-3, -2, -1]]
+        shifted = [[-1, -3, -2], [2, 0, 1], [-4, 3, 4]]
+        assert_array_almost_equal(fft.fftshift(freqs, axes=(0, 1)), shifted)
+        assert_array_almost_equal(fft.fftshift(freqs, axes=0),
+                                  fft.fftshift(freqs, axes=(0,)))
+        assert_array_almost_equal(fft.ifftshift(shifted, axes=(0, 1)), freqs)
+        assert_array_almost_equal(fft.ifftshift(shifted, axes=0),
+                                  fft.ifftshift(shifted, axes=(0,)))
+
+        assert_array_almost_equal(fft.fftshift(freqs), shifted)
+        assert_array_almost_equal(fft.ifftshift(shifted), freqs)
+
+    def test_uneven_dims(self):
+        """ Test 2D input, which has uneven dimension sizes """
+        freqs = [
+            [0, 1],
+            [2, 3],
+            [4, 5]
+        ]
+
+        # shift in dimension 0
+        shift_dim0 = [
+            [4, 5],
+            [0, 1],
+            [2, 3]
+        ]
+        assert_array_almost_equal(fft.fftshift(freqs, axes=0), shift_dim0)
+        assert_array_almost_equal(fft.ifftshift(shift_dim0, axes=0), freqs)
+        assert_array_almost_equal(fft.fftshift(freqs, axes=(0,)), shift_dim0)
+        assert_array_almost_equal(fft.ifftshift(shift_dim0, axes=[0]), freqs)
+
+        # shift in dimension 1
+        shift_dim1 = [
+            [1, 0],
+            [3, 2],
+            [5, 4]
+        ]
+        assert_array_almost_equal(fft.fftshift(freqs, axes=1), shift_dim1)
+        assert_array_almost_equal(fft.ifftshift(shift_dim1, axes=1), freqs)
+
+        # shift in both dimensions
+        shift_dim_both = [
+            [5, 4],
+            [1, 0],
+            [3, 2]
+        ]
+        assert_array_almost_equal(fft.fftshift(freqs, axes=(0, 1)), shift_dim_both)
+        assert_array_almost_equal(fft.ifftshift(shift_dim_both, axes=(0, 1)), freqs)
+        assert_array_almost_equal(fft.fftshift(freqs, axes=[0, 1]), shift_dim_both)
+        assert_array_almost_equal(fft.ifftshift(shift_dim_both, axes=[0, 1]), freqs)
+
+        # axes=None (default) shift in all dimensions
+        assert_array_almost_equal(fft.fftshift(freqs, axes=None), shift_dim_both)
+        assert_array_almost_equal(fft.ifftshift(shift_dim_both, axes=None), freqs)
+        assert_array_almost_equal(fft.fftshift(freqs), shift_dim_both)
+        assert_array_almost_equal(fft.ifftshift(shift_dim_both), freqs)
+
+    def test_equal_to_original(self):
+        """ Test that the new (>=v1.15) implementation (see #10073) is equal to the original (<=v1.14) """
+        from numpy.compat import integer_types
+        from numpy.core import asarray, concatenate, arange, take
+
+        def original_fftshift(x, axes=None):
+            """ How fftshift was implemented in v1.14"""
+            tmp = asarray(x)
+            ndim = tmp.ndim
+            if axes is None:
+                axes = list(range(ndim))
+            elif isinstance(axes, integer_types):
+                axes = (axes,)
+            y = tmp
+            for k in axes:
+                n = tmp.shape[k]
+                p2 = (n + 1) // 2
+                mylist = concatenate((arange(p2, n), arange(p2)))
+                y = take(y, mylist, k)
+            return y
+
+        def original_ifftshift(x, axes=None):
+            """ How ifftshift was implemented in v1.14 """
+            tmp = asarray(x)
+            ndim = tmp.ndim
+            if axes is None:
+                axes = list(range(ndim))
+            elif isinstance(axes, integer_types):
+                axes = (axes,)
+            y = tmp
+            for k in axes:
+                n = tmp.shape[k]
+                p2 = n - (n + 1) // 2
+                mylist = concatenate((arange(p2, n), arange(p2)))
+                y = take(y, mylist, k)
+            return y
+
+        # create possible 2d array combinations and try all possible keywords
+        # compare output to original functions
+        for i in range(16):
+            for j in range(16):
+                for axes_keyword in [0, 1, None, (0,), (0, 1)]:
+                    inp = np.random.rand(i, j)
+
+                    assert_array_almost_equal(fft.fftshift(inp, axes_keyword),
+                                              original_fftshift(inp, axes_keyword))
+
+                    assert_array_almost_equal(fft.ifftshift(inp, axes_keyword),
+                                              original_ifftshift(inp, axes_keyword))
+
+
+class TestFFTFreq:
+
+    def test_definition(self):
+        x = [0, 1, 2, 3, 4, -4, -3, -2, -1]
+        assert_array_almost_equal(9*fft.fftfreq(9), x)
+        assert_array_almost_equal(9*pi*fft.fftfreq(9, pi), x)
+        x = [0, 1, 2, 3, 4, -5, -4, -3, -2, -1]
+        assert_array_almost_equal(10*fft.fftfreq(10), x)
+        assert_array_almost_equal(10*pi*fft.fftfreq(10, pi), x)
+
+
+class TestRFFTFreq:
+
+    def test_definition(self):
+        x = [0, 1, 2, 3, 4]
+        assert_array_almost_equal(9*fft.rfftfreq(9), x)
+        assert_array_almost_equal(9*pi*fft.rfftfreq(9, pi), x)
+        x = [0, 1, 2, 3, 4, 5]
+        assert_array_almost_equal(10*fft.rfftfreq(10), x)
+        assert_array_almost_equal(10*pi*fft.rfftfreq(10, pi), x)
+
+
+class TestIRFFTN:
+
+    def test_not_last_axis_success(self):
+        ar, ai = np.random.random((2, 16, 8, 32))
+        a = ar + 1j*ai
+
+        axes = (-2,)
+
+        # Should not raise error
+        fft.irfftn(a, axes=axes)
diff --git a/venv/Lib/site-packages/numpy/fft/tests/test_pocketfft.py b/venv/Lib/site-packages/numpy/fft/tests/test_pocketfft.py
new file mode 100644
index 000000000..7c3db0485
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/fft/tests/test_pocketfft.py
@@ -0,0 +1,255 @@
+import numpy as np
+import pytest
+from numpy.random import random
+from numpy.testing import (
+        assert_array_equal, assert_raises, assert_allclose
+        )
+import threading
+import queue
+
+
+def fft1(x):
+    L = len(x)
+    phase = -2j*np.pi*(np.arange(L)/float(L))
+    phase = np.arange(L).reshape(-1, 1) * phase
+    return np.sum(x*np.exp(phase), axis=1)
+
+
+class TestFFTShift:
+
+    def test_fft_n(self):
+        assert_raises(ValueError, np.fft.fft, [1, 2, 3], 0)
+
+
+class TestFFT1D:
+
+    def test_identity(self):
+        maxlen = 512
+        x = random(maxlen) + 1j*random(maxlen)
+        xr = random(maxlen)
+        for i in range(1,maxlen):
+            assert_allclose(np.fft.ifft(np.fft.fft(x[0:i])), x[0:i],
+                            atol=1e-12)
+            assert_allclose(np.fft.irfft(np.fft.rfft(xr[0:i]),i),
+                            xr[0:i], atol=1e-12)
+
+    def test_fft(self):
+        x = random(30) + 1j*random(30)
+        assert_allclose(fft1(x), np.fft.fft(x), atol=1e-6)
+        assert_allclose(fft1(x) / np.sqrt(30),
+                        np.fft.fft(x, norm="ortho"), atol=1e-6)
+
+    @pytest.mark.parametrize('norm', (None, 'ortho'))
+    def test_ifft(self, norm):
+        x = random(30) + 1j*random(30)
+        assert_allclose(
+            x, np.fft.ifft(np.fft.fft(x, norm=norm), norm=norm),
+            atol=1e-6)
+        # Ensure we get the correct error message
+        with pytest.raises(ValueError,
+                           match='Invalid number of FFT data points'):
+            np.fft.ifft([], norm=norm)
+
+    def test_fft2(self):
+        x = random((30, 20)) + 1j*random((30, 20))
+        assert_allclose(np.fft.fft(np.fft.fft(x, axis=1), axis=0),
+                        np.fft.fft2(x), atol=1e-6)
+        assert_allclose(np.fft.fft2(x) / np.sqrt(30 * 20),
+                        np.fft.fft2(x, norm="ortho"), atol=1e-6)
+
+    def test_ifft2(self):
+        x = random((30, 20)) + 1j*random((30, 20))
+        assert_allclose(np.fft.ifft(np.fft.ifft(x, axis=1), axis=0),
+                        np.fft.ifft2(x), atol=1e-6)
+        assert_allclose(np.fft.ifft2(x) * np.sqrt(30 * 20),
+                        np.fft.ifft2(x, norm="ortho"), atol=1e-6)
+
+    def test_fftn(self):
+        x = random((30, 20, 10)) + 1j*random((30, 20, 10))
+        assert_allclose(
+            np.fft.fft(np.fft.fft(np.fft.fft(x, axis=2), axis=1), axis=0),
+            np.fft.fftn(x), atol=1e-6)
+        assert_allclose(np.fft.fftn(x) / np.sqrt(30 * 20 * 10),
+                        np.fft.fftn(x, norm="ortho"), atol=1e-6)
+
+    def test_ifftn(self):
+        x = random((30, 20, 10)) + 1j*random((30, 20, 10))
+        assert_allclose(
+            np.fft.ifft(np.fft.ifft(np.fft.ifft(x, axis=2), axis=1), axis=0),
+            np.fft.ifftn(x), atol=1e-6)
+        assert_allclose(np.fft.ifftn(x) * np.sqrt(30 * 20 * 10),
+                        np.fft.ifftn(x, norm="ortho"), atol=1e-6)
+
+    def test_rfft(self):
+        x = random(30)
+        for n in [x.size, 2*x.size]:
+            for norm in [None, 'ortho']:
+                assert_allclose(
+                    np.fft.fft(x, n=n, norm=norm)[:(n//2 + 1)],
+                    np.fft.rfft(x, n=n, norm=norm), atol=1e-6)
+            assert_allclose(
+                np.fft.rfft(x, n=n) / np.sqrt(n),
+                np.fft.rfft(x, n=n, norm="ortho"), atol=1e-6)
+
+    def test_irfft(self):
+        x = random(30)
+        assert_allclose(x, np.fft.irfft(np.fft.rfft(x)), atol=1e-6)
+        assert_allclose(
+            x, np.fft.irfft(np.fft.rfft(x, norm="ortho"), norm="ortho"), atol=1e-6)
+
+    def test_rfft2(self):
+        x = random((30, 20))
+        assert_allclose(np.fft.fft2(x)[:, :11], np.fft.rfft2(x), atol=1e-6)
+        assert_allclose(np.fft.rfft2(x) / np.sqrt(30 * 20),
+                        np.fft.rfft2(x, norm="ortho"), atol=1e-6)
+
+    def test_irfft2(self):
+        x = random((30, 20))
+        assert_allclose(x, np.fft.irfft2(np.fft.rfft2(x)), atol=1e-6)
+        assert_allclose(
+            x, np.fft.irfft2(np.fft.rfft2(x, norm="ortho"), norm="ortho"), atol=1e-6)
+
+    def test_rfftn(self):
+        x = random((30, 20, 10))
+        assert_allclose(np.fft.fftn(x)[:, :, :6], np.fft.rfftn(x), atol=1e-6)
+        assert_allclose(np.fft.rfftn(x) / np.sqrt(30 * 20 * 10),
+                        np.fft.rfftn(x, norm="ortho"), atol=1e-6)
+
+    def test_irfftn(self):
+        x = random((30, 20, 10))
+        assert_allclose(x, np.fft.irfftn(np.fft.rfftn(x)), atol=1e-6)
+        assert_allclose(
+            x, np.fft.irfftn(np.fft.rfftn(x, norm="ortho"), norm="ortho"), atol=1e-6)
+
+    def test_hfft(self):
+        x = random(14) + 1j*random(14)
+        x_herm = np.concatenate((random(1), x, random(1)))
+        x = np.concatenate((x_herm, x[::-1].conj()))
+        assert_allclose(np.fft.fft(x), np.fft.hfft(x_herm), atol=1e-6)
+        assert_allclose(np.fft.hfft(x_herm) / np.sqrt(30),
+                        np.fft.hfft(x_herm, norm="ortho"), atol=1e-6)
+
+    def test_ihttf(self):
+        x = random(14) + 1j*random(14)
+        x_herm = np.concatenate((random(1), x, random(1)))
+        x = np.concatenate((x_herm, x[::-1].conj()))
+        assert_allclose(x_herm, np.fft.ihfft(np.fft.hfft(x_herm)), atol=1e-6)
+        assert_allclose(
+            x_herm, np.fft.ihfft(np.fft.hfft(x_herm, norm="ortho"),
+                                 norm="ortho"), atol=1e-6)
+
+    @pytest.mark.parametrize("op", [np.fft.fftn, np.fft.ifftn,
+                                    np.fft.rfftn, np.fft.irfftn])
+    def test_axes(self, op):
+        x = random((30, 20, 10))
+        axes = [(0, 1, 2), (0, 2, 1), (1, 0, 2), (1, 2, 0), (2, 0, 1), (2, 1, 0)]
+        for a in axes:
+            op_tr = op(np.transpose(x, a))
+            tr_op = np.transpose(op(x, axes=a), a)
+            assert_allclose(op_tr, tr_op, atol=1e-6)
+
+    def test_all_1d_norm_preserving(self):
+        # verify that round-trip transforms are norm-preserving
+        x = random(30)
+        x_norm = np.linalg.norm(x)
+        n = x.size * 2
+        func_pairs = [(np.fft.fft, np.fft.ifft),
+                      (np.fft.rfft, np.fft.irfft),
+                      # hfft: order so the first function takes x.size samples
+                      #       (necessary for comparison to x_norm above)
+                      (np.fft.ihfft, np.fft.hfft),
+                      ]
+        for forw, back in func_pairs:
+            for n in [x.size, 2*x.size]:
+                for norm in [None, 'ortho']:
+                    tmp = forw(x, n=n, norm=norm)
+                    tmp = back(tmp, n=n, norm=norm)
+                    assert_allclose(x_norm,
+                                    np.linalg.norm(tmp), atol=1e-6)
+
+    @pytest.mark.parametrize("dtype", [np.half, np.single, np.double,
+                                       np.longdouble])
+    def test_dtypes(self, dtype):
+        # make sure that all input precisions are accepted and internally
+        # converted to 64bit
+        x = random(30).astype(dtype)
+        assert_allclose(np.fft.ifft(np.fft.fft(x)), x, atol=1e-6)
+        assert_allclose(np.fft.irfft(np.fft.rfft(x)), x, atol=1e-6)
+
+
+@pytest.mark.parametrize(
+        "dtype",
+        [np.float32, np.float64, np.complex64, np.complex128])
+@pytest.mark.parametrize("order", ["F", 'non-contiguous'])
+@pytest.mark.parametrize(
+        "fft",
+        [np.fft.fft, np.fft.fft2, np.fft.fftn,
+         np.fft.ifft, np.fft.ifft2, np.fft.ifftn])
+def test_fft_with_order(dtype, order, fft):
+    # Check that FFT/IFFT produces identical results for C, Fortran and
+    # non contiguous arrays
+    rng = np.random.RandomState(42)
+    X = rng.rand(8, 7, 13).astype(dtype, copy=False)
+    # See discussion in pull/14178
+    _tol = 8.0 * np.sqrt(np.log2(X.size)) * np.finfo(X.dtype).eps
+    if order == 'F':
+        Y = np.asfortranarray(X)
+    else:
+        # Make a non contiguous array
+        Y = X[::-1]
+        X = np.ascontiguousarray(X[::-1])
+
+    if fft.__name__.endswith('fft'):
+        for axis in range(3):
+            X_res = fft(X, axis=axis)
+            Y_res = fft(Y, axis=axis)
+            assert_allclose(X_res, Y_res, atol=_tol, rtol=_tol)
+    elif fft.__name__.endswith(('fft2', 'fftn')):
+        axes = [(0, 1), (1, 2), (0, 2)]
+        if fft.__name__.endswith('fftn'):
+            axes.extend([(0,), (1,), (2,), None])
+        for ax in axes:
+            X_res = fft(X, axes=ax)
+            Y_res = fft(Y, axes=ax)
+            assert_allclose(X_res, Y_res, atol=_tol, rtol=_tol)
+    else:
+        raise ValueError()
+
+
+class TestFFTThreadSafe:
+    threads = 16
+    input_shape = (800, 200)
+
+    def _test_mtsame(self, func, *args):
+        def worker(args, q):
+            q.put(func(*args))
+
+        q = queue.Queue()
+        expected = func(*args)
+
+        # Spin off a bunch of threads to call the same function simultaneously
+        t = [threading.Thread(target=worker, args=(args, q))
+             for i in range(self.threads)]
+        [x.start() for x in t]
+
+        [x.join() for x in t]
+        # Make sure all threads returned the correct value
+        for i in range(self.threads):
+            assert_array_equal(q.get(timeout=5), expected,
+                'Function returned wrong value in multithreaded context')
+
+    def test_fft(self):
+        a = np.ones(self.input_shape) * 1+0j
+        self._test_mtsame(np.fft.fft, a)
+
+    def test_ifft(self):
+        a = np.ones(self.input_shape) * 1+0j
+        self._test_mtsame(np.fft.ifft, a)
+
+    def test_rfft(self):
+        a = np.ones(self.input_shape)
+        self._test_mtsame(np.fft.rfft, a)
+
+    def test_irfft(self):
+        a = np.ones(self.input_shape) * 1+0j
+        self._test_mtsame(np.fft.irfft, a)
diff --git a/venv/Lib/site-packages/numpy/lib/__init__.py b/venv/Lib/site-packages/numpy/lib/__init__.py
new file mode 100644
index 000000000..cb0de0d15
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/__init__.py
@@ -0,0 +1,63 @@
+"""
+**Note:** almost all functions in the ``numpy.lib`` namespace
+are also present in the main ``numpy`` namespace.  Please use the
+functions as ``np.<funcname>`` where possible.
+
+``numpy.lib`` is mostly a space for implementing functions that don't
+belong in core or in another NumPy submodule with a clear purpose
+(e.g. ``random``, ``fft``, ``linalg``, ``ma``).
+
+Most contains basic functions that are used by several submodules and are
+useful to have in the main name-space.
+
+"""
+import math
+
+from numpy.version import version as __version__
+
+# Public submodules
+# Note: recfunctions and (maybe) format are public too, but not imported
+from . import mixins
+from . import scimath as emath
+
+# Private submodules
+from .type_check import *
+from .index_tricks import *
+from .function_base import *
+from .nanfunctions import *
+from .shape_base import *
+from .stride_tricks import *
+from .twodim_base import *
+from .ufunclike import *
+from .histograms import *
+
+from .polynomial import *
+from .utils import *
+from .arraysetops import *
+from .npyio import *
+from .financial import *
+from .arrayterator import Arrayterator
+from .arraypad import *
+from ._version import *
+from numpy.core._multiarray_umath import tracemalloc_domain
+
+__all__ = ['emath', 'math', 'tracemalloc_domain', 'Arrayterator']
+__all__ += type_check.__all__
+__all__ += index_tricks.__all__
+__all__ += function_base.__all__
+__all__ += shape_base.__all__
+__all__ += stride_tricks.__all__
+__all__ += twodim_base.__all__
+__all__ += ufunclike.__all__
+__all__ += arraypad.__all__
+__all__ += polynomial.__all__
+__all__ += utils.__all__
+__all__ += arraysetops.__all__
+__all__ += npyio.__all__
+__all__ += financial.__all__
+__all__ += nanfunctions.__all__
+__all__ += histograms.__all__
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..0f4f07b60
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/_datasource.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/_datasource.cpython-36.pyc
new file mode 100644
index 000000000..f275820e4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/_datasource.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/_iotools.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/_iotools.cpython-36.pyc
new file mode 100644
index 000000000..9c2e24b72
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/_iotools.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/_version.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/_version.cpython-36.pyc
new file mode 100644
index 000000000..46a7bb2aa
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/_version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/arraypad.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/arraypad.cpython-36.pyc
new file mode 100644
index 000000000..f14a19365
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/arraypad.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/arraysetops.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/arraysetops.cpython-36.pyc
new file mode 100644
index 000000000..d3b0ce1cc
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/arraysetops.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/arrayterator.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/arrayterator.cpython-36.pyc
new file mode 100644
index 000000000..07b3e1f5e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/arrayterator.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/financial.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/financial.cpython-36.pyc
new file mode 100644
index 000000000..944c5817f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/financial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/format.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/format.cpython-36.pyc
new file mode 100644
index 000000000..1f11e482f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/format.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/function_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/function_base.cpython-36.pyc
new file mode 100644
index 000000000..b7c92f597
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/function_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/histograms.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/histograms.cpython-36.pyc
new file mode 100644
index 000000000..b50da7fb9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/histograms.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/index_tricks.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/index_tricks.cpython-36.pyc
new file mode 100644
index 000000000..a9f9736e8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/index_tricks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/mixins.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/mixins.cpython-36.pyc
new file mode 100644
index 000000000..556a1be53
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/mixins.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/nanfunctions.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/nanfunctions.cpython-36.pyc
new file mode 100644
index 000000000..74929faaf
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/nanfunctions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/npyio.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/npyio.cpython-36.pyc
new file mode 100644
index 000000000..ccec8baa8
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/npyio.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/polynomial.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/polynomial.cpython-36.pyc
new file mode 100644
index 000000000..2eab6f53b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/polynomial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/recfunctions.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/recfunctions.cpython-36.pyc
new file mode 100644
index 000000000..6efbe28b1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/recfunctions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/scimath.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/scimath.cpython-36.pyc
new file mode 100644
index 000000000..35f833e9b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/scimath.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..2b2aa130d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/shape_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/shape_base.cpython-36.pyc
new file mode 100644
index 000000000..c697f833e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/shape_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/stride_tricks.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/stride_tricks.cpython-36.pyc
new file mode 100644
index 000000000..7aee7b235
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/stride_tricks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/twodim_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/twodim_base.cpython-36.pyc
new file mode 100644
index 000000000..3533bddab
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/twodim_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/type_check.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/type_check.cpython-36.pyc
new file mode 100644
index 000000000..144c8528c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/type_check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/ufunclike.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/ufunclike.cpython-36.pyc
new file mode 100644
index 000000000..03fd33607
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/ufunclike.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/user_array.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/user_array.cpython-36.pyc
new file mode 100644
index 000000000..9ee2a3676
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/user_array.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..f6ae20e70
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/_datasource.py b/venv/Lib/site-packages/numpy/lib/_datasource.py
new file mode 100644
index 000000000..f5d0cc217
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/_datasource.py
@@ -0,0 +1,706 @@
+"""A file interface for handling local and remote data files.
+
+The goal of datasource is to abstract some of the file system operations
+when dealing with data files so the researcher doesn't have to know all the
+low-level details.  Through datasource, a researcher can obtain and use a
+file with one function call, regardless of location of the file.
+
+DataSource is meant to augment standard python libraries, not replace them.
+It should work seamlessly with standard file IO operations and the os
+module.
+
+DataSource files can originate locally or remotely:
+
+- local files : '/home/guido/src/local/data.txt'
+- URLs (http, ftp, ...) : 'http://www.scipy.org/not/real/data.txt'
+
+DataSource files can also be compressed or uncompressed.  Currently only
+gzip, bz2 and xz are supported.
+
+Example::
+
+    >>> # Create a DataSource, use os.curdir (default) for local storage.
+    >>> from numpy import DataSource
+    >>> ds = DataSource()
+    >>>
+    >>> # Open a remote file.
+    >>> # DataSource downloads the file, stores it locally in:
+    >>> #     './www.google.com/index.html'
+    >>> # opens the file and returns a file object.
+    >>> fp = ds.open('http://www.google.com/') # doctest: +SKIP
+    >>>
+    >>> # Use the file as you normally would
+    >>> fp.read() # doctest: +SKIP
+    >>> fp.close() # doctest: +SKIP
+
+"""
+import os
+import shutil
+import io
+from contextlib import closing
+
+from numpy.core.overrides import set_module
+
+
+_open = open
+
+
+def _check_mode(mode, encoding, newline):
+    """Check mode and that encoding and newline are compatible.
+
+    Parameters
+    ----------
+    mode : str
+        File open mode.
+    encoding : str
+        File encoding.
+    newline : str
+        Newline for text files.
+
+    """
+    if "t" in mode:
+        if "b" in mode:
+            raise ValueError("Invalid mode: %r" % (mode,))
+    else:
+        if encoding is not None:
+            raise ValueError("Argument 'encoding' not supported in binary mode")
+        if newline is not None:
+            raise ValueError("Argument 'newline' not supported in binary mode")
+
+
+# Using a class instead of a module-level dictionary
+# to reduce the initial 'import numpy' overhead by
+# deferring the import of lzma, bz2 and gzip until needed
+
+# TODO: .zip support, .tar support?
+class _FileOpeners:
+    """
+    Container for different methods to open (un-)compressed files.
+
+    `_FileOpeners` contains a dictionary that holds one method for each
+    supported file format. Attribute lookup is implemented in such a way
+    that an instance of `_FileOpeners` itself can be indexed with the keys
+    of that dictionary. Currently uncompressed files as well as files
+    compressed with ``gzip``, ``bz2`` or ``xz`` compression are supported.
+
+    Notes
+    -----
+    `_file_openers`, an instance of `_FileOpeners`, is made available for
+    use in the `_datasource` module.
+
+    Examples
+    --------
+    >>> import gzip
+    >>> np.lib._datasource._file_openers.keys()
+    [None, '.bz2', '.gz', '.xz', '.lzma']
+    >>> np.lib._datasource._file_openers['.gz'] is gzip.open
+    True
+
+    """
+
+    def __init__(self):
+        self._loaded = False
+        self._file_openers = {None: io.open}
+
+    def _load(self):
+        if self._loaded:
+            return
+
+        try:
+            import bz2
+            self._file_openers[".bz2"] = bz2.open
+        except ImportError:
+            pass
+
+        try:
+            import gzip
+            self._file_openers[".gz"] = gzip.open
+        except ImportError:
+            pass
+
+        try:
+            import lzma
+            self._file_openers[".xz"] = lzma.open
+            self._file_openers[".lzma"] = lzma.open
+        except (ImportError, AttributeError):
+            # There are incompatible backports of lzma that do not have the
+            # lzma.open attribute, so catch that as well as ImportError.
+            pass
+
+        self._loaded = True
+
+    def keys(self):
+        """
+        Return the keys of currently supported file openers.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        keys : list
+            The keys are None for uncompressed files and the file extension
+            strings (i.e. ``'.gz'``, ``'.xz'``) for supported compression
+            methods.
+
+        """
+        self._load()
+        return list(self._file_openers.keys())
+
+    def __getitem__(self, key):
+        self._load()
+        return self._file_openers[key]
+
+_file_openers = _FileOpeners()
+
+def open(path, mode='r', destpath=os.curdir, encoding=None, newline=None):
+    """
+    Open `path` with `mode` and return the file object.
+
+    If ``path`` is an URL, it will be downloaded, stored in the
+    `DataSource` `destpath` directory and opened from there.
+
+    Parameters
+    ----------
+    path : str
+        Local file path or URL to open.
+    mode : str, optional
+        Mode to open `path`. Mode 'r' for reading, 'w' for writing, 'a' to
+        append. Available modes depend on the type of object specified by
+        path.  Default is 'r'.
+    destpath : str, optional
+        Path to the directory where the source file gets downloaded to for
+        use.  If `destpath` is None, a temporary directory will be created.
+        The default path is the current directory.
+    encoding : {None, str}, optional
+        Open text file with given encoding. The default encoding will be
+        what `io.open` uses.
+    newline : {None, str}, optional
+        Newline to use when reading text file.
+
+    Returns
+    -------
+    out : file object
+        The opened file.
+
+    Notes
+    -----
+    This is a convenience function that instantiates a `DataSource` and
+    returns the file object from ``DataSource.open(path)``.
+
+    """
+
+    ds = DataSource(destpath)
+    return ds.open(path, mode, encoding=encoding, newline=newline)
+
+
+@set_module('numpy')
+class DataSource:
+    """
+    DataSource(destpath='.')
+
+    A generic data source file (file, http, ftp, ...).
+
+    DataSources can be local files or remote files/URLs.  The files may
+    also be compressed or uncompressed. DataSource hides some of the
+    low-level details of downloading the file, allowing you to simply pass
+    in a valid file path (or URL) and obtain a file object.
+
+    Parameters
+    ----------
+    destpath : str or None, optional
+        Path to the directory where the source file gets downloaded to for
+        use.  If `destpath` is None, a temporary directory will be created.
+        The default path is the current directory.
+
+    Notes
+    -----
+    URLs require a scheme string (``http://``) to be used, without it they
+    will fail::
+
+        >>> repos = np.DataSource()
+        >>> repos.exists('www.google.com/index.html')
+        False
+        >>> repos.exists('http://www.google.com/index.html')
+        True
+
+    Temporary directories are deleted when the DataSource is deleted.
+
+    Examples
+    --------
+    ::
+
+        >>> ds = np.DataSource('/home/guido')
+        >>> urlname = 'http://www.google.com/'
+        >>> gfile = ds.open('http://www.google.com/')
+        >>> ds.abspath(urlname)
+        '/home/guido/www.google.com/index.html'
+
+        >>> ds = np.DataSource(None)  # use with temporary file
+        >>> ds.open('/home/guido/foobar.txt')
+        <open file '/home/guido.foobar.txt', mode 'r' at 0x91d4430>
+        >>> ds.abspath('/home/guido/foobar.txt')
+        '/tmp/.../home/guido/foobar.txt'
+
+    """
+
+    def __init__(self, destpath=os.curdir):
+        """Create a DataSource with a local path at destpath."""
+        if destpath:
+            self._destpath = os.path.abspath(destpath)
+            self._istmpdest = False
+        else:
+            import tempfile  # deferring import to improve startup time
+            self._destpath = tempfile.mkdtemp()
+            self._istmpdest = True
+
+    def __del__(self):
+        # Remove temp directories
+        if hasattr(self, '_istmpdest') and self._istmpdest:
+            shutil.rmtree(self._destpath)
+
+    def _iszip(self, filename):
+        """Test if the filename is a zip file by looking at the file extension.
+
+        """
+        fname, ext = os.path.splitext(filename)
+        return ext in _file_openers.keys()
+
+    def _iswritemode(self, mode):
+        """Test if the given mode will open a file for writing."""
+
+        # Currently only used to test the bz2 files.
+        _writemodes = ("w", "+")
+        for c in mode:
+            if c in _writemodes:
+                return True
+        return False
+
+    def _splitzipext(self, filename):
+        """Split zip extension from filename and return filename.
+
+        *Returns*:
+            base, zip_ext : {tuple}
+
+        """
+
+        if self._iszip(filename):
+            return os.path.splitext(filename)
+        else:
+            return filename, None
+
+    def _possible_names(self, filename):
+        """Return a tuple containing compressed filename variations."""
+        names = [filename]
+        if not self._iszip(filename):
+            for zipext in _file_openers.keys():
+                if zipext:
+                    names.append(filename+zipext)
+        return names
+
+    def _isurl(self, path):
+        """Test if path is a net location.  Tests the scheme and netloc."""
+
+        # We do this here to reduce the 'import numpy' initial import time.
+        from urllib.parse import urlparse
+
+        # BUG : URLs require a scheme string ('http://') to be used.
+        #       www.google.com will fail.
+        #       Should we prepend the scheme for those that don't have it and
+        #       test that also?  Similar to the way we append .gz and test for
+        #       for compressed versions of files.
+
+        scheme, netloc, upath, uparams, uquery, ufrag = urlparse(path)
+        return bool(scheme and netloc)
+
+    def _cache(self, path):
+        """Cache the file specified by path.
+
+        Creates a copy of the file in the datasource cache.
+
+        """
+        # We import these here because importing urllib is slow and
+        # a significant fraction of numpy's total import time.
+        from urllib.request import urlopen
+        from urllib.error import URLError
+
+        upath = self.abspath(path)
+
+        # ensure directory exists
+        if not os.path.exists(os.path.dirname(upath)):
+            os.makedirs(os.path.dirname(upath))
+
+        # TODO: Doesn't handle compressed files!
+        if self._isurl(path):
+            try:
+                with closing(urlopen(path)) as openedurl:
+                    with _open(upath, 'wb') as f:
+                        shutil.copyfileobj(openedurl, f)
+            except URLError:
+                raise URLError("URL not found: %s" % path)
+        else:
+            shutil.copyfile(path, upath)
+        return upath
+
+    def _findfile(self, path):
+        """Searches for ``path`` and returns full path if found.
+
+        If path is an URL, _findfile will cache a local copy and return the
+        path to the cached file.  If path is a local file, _findfile will
+        return a path to that local file.
+
+        The search will include possible compressed versions of the file
+        and return the first occurrence found.
+
+        """
+
+        # Build list of possible local file paths
+        if not self._isurl(path):
+            # Valid local paths
+            filelist = self._possible_names(path)
+            # Paths in self._destpath
+            filelist += self._possible_names(self.abspath(path))
+        else:
+            # Cached URLs in self._destpath
+            filelist = self._possible_names(self.abspath(path))
+            # Remote URLs
+            filelist = filelist + self._possible_names(path)
+
+        for name in filelist:
+            if self.exists(name):
+                if self._isurl(name):
+                    name = self._cache(name)
+                return name
+        return None
+
+    def abspath(self, path):
+        """
+        Return absolute path of file in the DataSource directory.
+
+        If `path` is an URL, then `abspath` will return either the location
+        the file exists locally or the location it would exist when opened
+        using the `open` method.
+
+        Parameters
+        ----------
+        path : str
+            Can be a local file or a remote URL.
+
+        Returns
+        -------
+        out : str
+            Complete path, including the `DataSource` destination directory.
+
+        Notes
+        -----
+        The functionality is based on `os.path.abspath`.
+
+        """
+        # We do this here to reduce the 'import numpy' initial import time.
+        from urllib.parse import urlparse
+
+        # TODO:  This should be more robust.  Handles case where path includes
+        #        the destpath, but not other sub-paths. Failing case:
+        #        path = /home/guido/datafile.txt
+        #        destpath = /home/alex/
+        #        upath = self.abspath(path)
+        #        upath == '/home/alex/home/guido/datafile.txt'
+
+        # handle case where path includes self._destpath
+        splitpath = path.split(self._destpath, 2)
+        if len(splitpath) > 1:
+            path = splitpath[1]
+        scheme, netloc, upath, uparams, uquery, ufrag = urlparse(path)
+        netloc = self._sanitize_relative_path(netloc)
+        upath = self._sanitize_relative_path(upath)
+        return os.path.join(self._destpath, netloc, upath)
+
+    def _sanitize_relative_path(self, path):
+        """Return a sanitised relative path for which
+        os.path.abspath(os.path.join(base, path)).startswith(base)
+        """
+        last = None
+        path = os.path.normpath(path)
+        while path != last:
+            last = path
+            # Note: os.path.join treats '/' as os.sep on Windows
+            path = path.lstrip(os.sep).lstrip('/')
+            path = path.lstrip(os.pardir).lstrip('..')
+            drive, path = os.path.splitdrive(path)  # for Windows
+        return path
+
+    def exists(self, path):
+        """
+        Test if path exists.
+
+        Test if `path` exists as (and in this order):
+
+        - a local file.
+        - a remote URL that has been downloaded and stored locally in the
+          `DataSource` directory.
+        - a remote URL that has not been downloaded, but is valid and
+          accessible.
+
+        Parameters
+        ----------
+        path : str
+            Can be a local file or a remote URL.
+
+        Returns
+        -------
+        out : bool
+            True if `path` exists.
+
+        Notes
+        -----
+        When `path` is an URL, `exists` will return True if it's either
+        stored locally in the `DataSource` directory, or is a valid remote
+        URL.  `DataSource` does not discriminate between the two, the file
+        is accessible if it exists in either location.
+
+        """
+
+        # First test for local path
+        if os.path.exists(path):
+            return True
+
+        # We import this here because importing urllib is slow and
+        # a significant fraction of numpy's total import time.
+        from urllib.request import urlopen
+        from urllib.error import URLError
+
+        # Test cached url
+        upath = self.abspath(path)
+        if os.path.exists(upath):
+            return True
+
+        # Test remote url
+        if self._isurl(path):
+            try:
+                netfile = urlopen(path)
+                netfile.close()
+                del(netfile)
+                return True
+            except URLError:
+                return False
+        return False
+
+    def open(self, path, mode='r', encoding=None, newline=None):
+        """
+        Open and return file-like object.
+
+        If `path` is an URL, it will be downloaded, stored in the
+        `DataSource` directory and opened from there.
+
+        Parameters
+        ----------
+        path : str
+            Local file path or URL to open.
+        mode : {'r', 'w', 'a'}, optional
+            Mode to open `path`.  Mode 'r' for reading, 'w' for writing,
+            'a' to append. Available modes depend on the type of object
+            specified by `path`. Default is 'r'.
+        encoding : {None, str}, optional
+            Open text file with given encoding. The default encoding will be
+            what `io.open` uses.
+        newline : {None, str}, optional
+            Newline to use when reading text file.
+
+        Returns
+        -------
+        out : file object
+            File object.
+
+        """
+
+        # TODO: There is no support for opening a file for writing which
+        #       doesn't exist yet (creating a file).  Should there be?
+
+        # TODO: Add a ``subdir`` parameter for specifying the subdirectory
+        #       used to store URLs in self._destpath.
+
+        if self._isurl(path) and self._iswritemode(mode):
+            raise ValueError("URLs are not writeable")
+
+        # NOTE: _findfile will fail on a new file opened for writing.
+        found = self._findfile(path)
+        if found:
+            _fname, ext = self._splitzipext(found)
+            if ext == 'bz2':
+                mode.replace("+", "")
+            return _file_openers[ext](found, mode=mode,
+                                      encoding=encoding, newline=newline)
+        else:
+            raise IOError("%s not found." % path)
+
+
+class Repository (DataSource):
+    """
+    Repository(baseurl, destpath='.')
+
+    A data repository where multiple DataSource's share a base
+    URL/directory.
+
+    `Repository` extends `DataSource` by prepending a base URL (or
+    directory) to all the files it handles. Use `Repository` when you will
+    be working with multiple files from one base URL.  Initialize
+    `Repository` with the base URL, then refer to each file by its filename
+    only.
+
+    Parameters
+    ----------
+    baseurl : str
+        Path to the local directory or remote location that contains the
+        data files.
+    destpath : str or None, optional
+        Path to the directory where the source file gets downloaded to for
+        use.  If `destpath` is None, a temporary directory will be created.
+        The default path is the current directory.
+
+    Examples
+    --------
+    To analyze all files in the repository, do something like this
+    (note: this is not self-contained code)::
+
+        >>> repos = np.lib._datasource.Repository('/home/user/data/dir/')
+        >>> for filename in filelist:
+        ...     fp = repos.open(filename)
+        ...     fp.analyze()
+        ...     fp.close()
+
+    Similarly you could use a URL for a repository::
+
+        >>> repos = np.lib._datasource.Repository('http://www.xyz.edu/data')
+
+    """
+
+    def __init__(self, baseurl, destpath=os.curdir):
+        """Create a Repository with a shared url or directory of baseurl."""
+        DataSource.__init__(self, destpath=destpath)
+        self._baseurl = baseurl
+
+    def __del__(self):
+        DataSource.__del__(self)
+
+    def _fullpath(self, path):
+        """Return complete path for path.  Prepends baseurl if necessary."""
+        splitpath = path.split(self._baseurl, 2)
+        if len(splitpath) == 1:
+            result = os.path.join(self._baseurl, path)
+        else:
+            result = path    # path contains baseurl already
+        return result
+
+    def _findfile(self, path):
+        """Extend DataSource method to prepend baseurl to ``path``."""
+        return DataSource._findfile(self, self._fullpath(path))
+
+    def abspath(self, path):
+        """
+        Return absolute path of file in the Repository directory.
+
+        If `path` is an URL, then `abspath` will return either the location
+        the file exists locally or the location it would exist when opened
+        using the `open` method.
+
+        Parameters
+        ----------
+        path : str
+            Can be a local file or a remote URL. This may, but does not
+            have to, include the `baseurl` with which the `Repository` was
+            initialized.
+
+        Returns
+        -------
+        out : str
+            Complete path, including the `DataSource` destination directory.
+
+        """
+        return DataSource.abspath(self, self._fullpath(path))
+
+    def exists(self, path):
+        """
+        Test if path exists prepending Repository base URL to path.
+
+        Test if `path` exists as (and in this order):
+
+        - a local file.
+        - a remote URL that has been downloaded and stored locally in the
+          `DataSource` directory.
+        - a remote URL that has not been downloaded, but is valid and
+          accessible.
+
+        Parameters
+        ----------
+        path : str
+            Can be a local file or a remote URL. This may, but does not
+            have to, include the `baseurl` with which the `Repository` was
+            initialized.
+
+        Returns
+        -------
+        out : bool
+            True if `path` exists.
+
+        Notes
+        -----
+        When `path` is an URL, `exists` will return True if it's either
+        stored locally in the `DataSource` directory, or is a valid remote
+        URL.  `DataSource` does not discriminate between the two, the file
+        is accessible if it exists in either location.
+
+        """
+        return DataSource.exists(self, self._fullpath(path))
+
+    def open(self, path, mode='r', encoding=None, newline=None):
+        """
+        Open and return file-like object prepending Repository base URL.
+
+        If `path` is an URL, it will be downloaded, stored in the
+        DataSource directory and opened from there.
+
+        Parameters
+        ----------
+        path : str
+            Local file path or URL to open. This may, but does not have to,
+            include the `baseurl` with which the `Repository` was
+            initialized.
+        mode : {'r', 'w', 'a'}, optional
+            Mode to open `path`.  Mode 'r' for reading, 'w' for writing,
+            'a' to append. Available modes depend on the type of object
+            specified by `path`. Default is 'r'.
+        encoding : {None, str}, optional
+            Open text file with given encoding. The default encoding will be
+            what `io.open` uses.
+        newline : {None, str}, optional
+            Newline to use when reading text file.
+
+        Returns
+        -------
+        out : file object
+            File object.
+
+        """
+        return DataSource.open(self, self._fullpath(path), mode,
+                               encoding=encoding, newline=newline)
+
+    def listdir(self):
+        """
+        List files in the source Repository.
+
+        Returns
+        -------
+        files : list of str
+            List of file names (not containing a directory part).
+
+        Notes
+        -----
+        Does not currently work for remote repositories.
+
+        """
+        if self._isurl(self._baseurl):
+            raise NotImplementedError(
+                  "Directory listing of URLs, not supported yet.")
+        else:
+            return os.listdir(self._baseurl)
diff --git a/venv/Lib/site-packages/numpy/lib/_iotools.py b/venv/Lib/site-packages/numpy/lib/_iotools.py
new file mode 100644
index 000000000..7560bf4da
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/_iotools.py
@@ -0,0 +1,897 @@
+"""A collection of functions designed to help I/O with ascii files.
+
+"""
+__docformat__ = "restructuredtext en"
+
+import numpy as np
+import numpy.core.numeric as nx
+from numpy.compat import asbytes, asunicode, bytes
+
+
+def _decode_line(line, encoding=None):
+    """Decode bytes from binary input streams.
+
+    Defaults to decoding from 'latin1'. That differs from the behavior of
+    np.compat.asunicode that decodes from 'ascii'.
+
+    Parameters
+    ----------
+    line : str or bytes
+         Line to be decoded.
+
+    Returns
+    -------
+    decoded_line : unicode
+         Unicode in Python 2, a str (unicode) in Python 3.
+
+    """
+    if type(line) is bytes:
+        if encoding is None:
+            line = line.decode('latin1')
+        else:
+            line = line.decode(encoding)
+
+    return line
+
+
+def _is_string_like(obj):
+    """
+    Check whether obj behaves like a string.
+    """
+    try:
+        obj + ''
+    except (TypeError, ValueError):
+        return False
+    return True
+
+
+def _is_bytes_like(obj):
+    """
+    Check whether obj behaves like a bytes object.
+    """
+    try:
+        obj + b''
+    except (TypeError, ValueError):
+        return False
+    return True
+
+
+def has_nested_fields(ndtype):
+    """
+    Returns whether one or several fields of a dtype are nested.
+
+    Parameters
+    ----------
+    ndtype : dtype
+        Data-type of a structured array.
+
+    Raises
+    ------
+    AttributeError
+        If `ndtype` does not have a `names` attribute.
+
+    Examples
+    --------
+    >>> dt = np.dtype([('name', 'S4'), ('x', float), ('y', float)])
+    >>> np.lib._iotools.has_nested_fields(dt)
+    False
+
+    """
+    for name in ndtype.names or ():
+        if ndtype[name].names is not None:
+            return True
+    return False
+
+
+def flatten_dtype(ndtype, flatten_base=False):
+    """
+    Unpack a structured data-type by collapsing nested fields and/or fields
+    with a shape.
+
+    Note that the field names are lost.
+
+    Parameters
+    ----------
+    ndtype : dtype
+        The datatype to collapse
+    flatten_base : bool, optional
+       If True, transform a field with a shape into several fields. Default is
+       False.
+
+    Examples
+    --------
+    >>> dt = np.dtype([('name', 'S4'), ('x', float), ('y', float),
+    ...                ('block', int, (2, 3))])
+    >>> np.lib._iotools.flatten_dtype(dt)
+    [dtype('S4'), dtype('float64'), dtype('float64'), dtype('int64')]
+    >>> np.lib._iotools.flatten_dtype(dt, flatten_base=True)
+    [dtype('S4'),
+     dtype('float64'),
+     dtype('float64'),
+     dtype('int64'),
+     dtype('int64'),
+     dtype('int64'),
+     dtype('int64'),
+     dtype('int64'),
+     dtype('int64')]
+
+    """
+    names = ndtype.names
+    if names is None:
+        if flatten_base:
+            return [ndtype.base] * int(np.prod(ndtype.shape))
+        return [ndtype.base]
+    else:
+        types = []
+        for field in names:
+            info = ndtype.fields[field]
+            flat_dt = flatten_dtype(info[0], flatten_base)
+            types.extend(flat_dt)
+        return types
+
+
+class LineSplitter:
+    """
+    Object to split a string at a given delimiter or at given places.
+
+    Parameters
+    ----------
+    delimiter : str, int, or sequence of ints, optional
+        If a string, character used to delimit consecutive fields.
+        If an integer or a sequence of integers, width(s) of each field.
+    comments : str, optional
+        Character used to mark the beginning of a comment. Default is '#'.
+    autostrip : bool, optional
+        Whether to strip each individual field. Default is True.
+
+    """
+
+    def autostrip(self, method):
+        """
+        Wrapper to strip each member of the output of `method`.
+
+        Parameters
+        ----------
+        method : function
+            Function that takes a single argument and returns a sequence of
+            strings.
+
+        Returns
+        -------
+        wrapped : function
+            The result of wrapping `method`. `wrapped` takes a single input
+            argument and returns a list of strings that are stripped of
+            white-space.
+
+        """
+        return lambda input: [_.strip() for _ in method(input)]
+
+    def __init__(self, delimiter=None, comments='#', autostrip=True,
+                 encoding=None):
+        delimiter = _decode_line(delimiter)
+        comments = _decode_line(comments)
+
+        self.comments = comments
+
+        # Delimiter is a character
+        if (delimiter is None) or isinstance(delimiter, str):
+            delimiter = delimiter or None
+            _handyman = self._delimited_splitter
+        # Delimiter is a list of field widths
+        elif hasattr(delimiter, '__iter__'):
+            _handyman = self._variablewidth_splitter
+            idx = np.cumsum([0] + list(delimiter))
+            delimiter = [slice(i, j) for (i, j) in zip(idx[:-1], idx[1:])]
+        # Delimiter is a single integer
+        elif int(delimiter):
+            (_handyman, delimiter) = (
+                    self._fixedwidth_splitter, int(delimiter))
+        else:
+            (_handyman, delimiter) = (self._delimited_splitter, None)
+        self.delimiter = delimiter
+        if autostrip:
+            self._handyman = self.autostrip(_handyman)
+        else:
+            self._handyman = _handyman
+        self.encoding = encoding
+
+    def _delimited_splitter(self, line):
+        """Chop off comments, strip, and split at delimiter. """
+        if self.comments is not None:
+            line = line.split(self.comments)[0]
+        line = line.strip(" \r\n")
+        if not line:
+            return []
+        return line.split(self.delimiter)
+
+    def _fixedwidth_splitter(self, line):
+        if self.comments is not None:
+            line = line.split(self.comments)[0]
+        line = line.strip("\r\n")
+        if not line:
+            return []
+        fixed = self.delimiter
+        slices = [slice(i, i + fixed) for i in range(0, len(line), fixed)]
+        return [line[s] for s in slices]
+
+    def _variablewidth_splitter(self, line):
+        if self.comments is not None:
+            line = line.split(self.comments)[0]
+        if not line:
+            return []
+        slices = self.delimiter
+        return [line[s] for s in slices]
+
+    def __call__(self, line):
+        return self._handyman(_decode_line(line, self.encoding))
+
+
+class NameValidator:
+    """
+    Object to validate a list of strings to use as field names.
+
+    The strings are stripped of any non alphanumeric character, and spaces
+    are replaced by '_'. During instantiation, the user can define a list
+    of names to exclude, as well as a list of invalid characters. Names in
+    the exclusion list are appended a '_' character.
+
+    Once an instance has been created, it can be called with a list of
+    names, and a list of valid names will be created.  The `__call__`
+    method accepts an optional keyword "default" that sets the default name
+    in case of ambiguity. By default this is 'f', so that names will
+    default to `f0`, `f1`, etc.
+
+    Parameters
+    ----------
+    excludelist : sequence, optional
+        A list of names to exclude. This list is appended to the default
+        list ['return', 'file', 'print']. Excluded names are appended an
+        underscore: for example, `file` becomes `file_` if supplied.
+    deletechars : str, optional
+        A string combining invalid characters that must be deleted from the
+        names.
+    case_sensitive : {True, False, 'upper', 'lower'}, optional
+        * If True, field names are case-sensitive.
+        * If False or 'upper', field names are converted to upper case.
+        * If 'lower', field names are converted to lower case.
+
+        The default value is True.
+    replace_space : '_', optional
+        Character(s) used in replacement of white spaces.
+
+    Notes
+    -----
+    Calling an instance of `NameValidator` is the same as calling its
+    method `validate`.
+
+    Examples
+    --------
+    >>> validator = np.lib._iotools.NameValidator()
+    >>> validator(['file', 'field2', 'with space', 'CaSe'])
+    ('file_', 'field2', 'with_space', 'CaSe')
+
+    >>> validator = np.lib._iotools.NameValidator(excludelist=['excl'],
+    ...                                           deletechars='q',
+    ...                                           case_sensitive=False)
+    >>> validator(['excl', 'field2', 'no_q', 'with space', 'CaSe'])
+    ('EXCL', 'FIELD2', 'NO_Q', 'WITH_SPACE', 'CASE')
+
+    """
+
+    defaultexcludelist = ['return', 'file', 'print']
+    defaultdeletechars = set(r"""~!@#$%^&*()-=+~\|]}[{';: /?.>,<""")
+
+    def __init__(self, excludelist=None, deletechars=None,
+                 case_sensitive=None, replace_space='_'):
+        # Process the exclusion list ..
+        if excludelist is None:
+            excludelist = []
+        excludelist.extend(self.defaultexcludelist)
+        self.excludelist = excludelist
+        # Process the list of characters to delete
+        if deletechars is None:
+            delete = self.defaultdeletechars
+        else:
+            delete = set(deletechars)
+        delete.add('"')
+        self.deletechars = delete
+        # Process the case option .....
+        if (case_sensitive is None) or (case_sensitive is True):
+            self.case_converter = lambda x: x
+        elif (case_sensitive is False) or case_sensitive.startswith('u'):
+            self.case_converter = lambda x: x.upper()
+        elif case_sensitive.startswith('l'):
+            self.case_converter = lambda x: x.lower()
+        else:
+            msg = 'unrecognized case_sensitive value %s.' % case_sensitive
+            raise ValueError(msg)
+
+        self.replace_space = replace_space
+
+    def validate(self, names, defaultfmt="f%i", nbfields=None):
+        """
+        Validate a list of strings as field names for a structured array.
+
+        Parameters
+        ----------
+        names : sequence of str
+            Strings to be validated.
+        defaultfmt : str, optional
+            Default format string, used if validating a given string
+            reduces its length to zero.
+        nbfields : integer, optional
+            Final number of validated names, used to expand or shrink the
+            initial list of names.
+
+        Returns
+        -------
+        validatednames : list of str
+            The list of validated field names.
+
+        Notes
+        -----
+        A `NameValidator` instance can be called directly, which is the
+        same as calling `validate`. For examples, see `NameValidator`.
+
+        """
+        # Initial checks ..............
+        if (names is None):
+            if (nbfields is None):
+                return None
+            names = []
+        if isinstance(names, str):
+            names = [names, ]
+        if nbfields is not None:
+            nbnames = len(names)
+            if (nbnames < nbfields):
+                names = list(names) + [''] * (nbfields - nbnames)
+            elif (nbnames > nbfields):
+                names = names[:nbfields]
+        # Set some shortcuts ...........
+        deletechars = self.deletechars
+        excludelist = self.excludelist
+        case_converter = self.case_converter
+        replace_space = self.replace_space
+        # Initializes some variables ...
+        validatednames = []
+        seen = dict()
+        nbempty = 0
+
+        for item in names:
+            item = case_converter(item).strip()
+            if replace_space:
+                item = item.replace(' ', replace_space)
+            item = ''.join([c for c in item if c not in deletechars])
+            if item == '':
+                item = defaultfmt % nbempty
+                while item in names:
+                    nbempty += 1
+                    item = defaultfmt % nbempty
+                nbempty += 1
+            elif item in excludelist:
+                item += '_'
+            cnt = seen.get(item, 0)
+            if cnt > 0:
+                validatednames.append(item + '_%d' % cnt)
+            else:
+                validatednames.append(item)
+            seen[item] = cnt + 1
+        return tuple(validatednames)
+
+    def __call__(self, names, defaultfmt="f%i", nbfields=None):
+        return self.validate(names, defaultfmt=defaultfmt, nbfields=nbfields)
+
+
+def str2bool(value):
+    """
+    Tries to transform a string supposed to represent a boolean to a boolean.
+
+    Parameters
+    ----------
+    value : str
+        The string that is transformed to a boolean.
+
+    Returns
+    -------
+    boolval : bool
+        The boolean representation of `value`.
+
+    Raises
+    ------
+    ValueError
+        If the string is not 'True' or 'False' (case independent)
+
+    Examples
+    --------
+    >>> np.lib._iotools.str2bool('TRUE')
+    True
+    >>> np.lib._iotools.str2bool('false')
+    False
+
+    """
+    value = value.upper()
+    if value == 'TRUE':
+        return True
+    elif value == 'FALSE':
+        return False
+    else:
+        raise ValueError("Invalid boolean")
+
+
+class ConverterError(Exception):
+    """
+    Exception raised when an error occurs in a converter for string values.
+
+    """
+    pass
+
+
+class ConverterLockError(ConverterError):
+    """
+    Exception raised when an attempt is made to upgrade a locked converter.
+
+    """
+    pass
+
+
+class ConversionWarning(UserWarning):
+    """
+    Warning issued when a string converter has a problem.
+
+    Notes
+    -----
+    In `genfromtxt` a `ConversionWarning` is issued if raising exceptions
+    is explicitly suppressed with the "invalid_raise" keyword.
+
+    """
+    pass
+
+
+class StringConverter:
+    """
+    Factory class for function transforming a string into another object
+    (int, float).
+
+    After initialization, an instance can be called to transform a string
+    into another object. If the string is recognized as representing a
+    missing value, a default value is returned.
+
+    Attributes
+    ----------
+    func : function
+        Function used for the conversion.
+    default : any
+        Default value to return when the input corresponds to a missing
+        value.
+    type : type
+        Type of the output.
+    _status : int
+        Integer representing the order of the conversion.
+    _mapper : sequence of tuples
+        Sequence of tuples (dtype, function, default value) to evaluate in
+        order.
+    _locked : bool
+        Holds `locked` parameter.
+
+    Parameters
+    ----------
+    dtype_or_func : {None, dtype, function}, optional
+        If a `dtype`, specifies the input data type, used to define a basic
+        function and a default value for missing data. For example, when
+        `dtype` is float, the `func` attribute is set to `float` and the
+        default value to `np.nan`.  If a function, this function is used to
+        convert a string to another object. In this case, it is recommended
+        to give an associated default value as input.
+    default : any, optional
+        Value to return by default, that is, when the string to be
+        converted is flagged as missing. If not given, `StringConverter`
+        tries to supply a reasonable default value.
+    missing_values : {None, sequence of str}, optional
+        ``None`` or sequence of strings indicating a missing value. If ``None``
+        then missing values are indicated by empty entries. The default is
+        ``None``.
+    locked : bool, optional
+        Whether the StringConverter should be locked to prevent automatic
+        upgrade or not. Default is False.
+
+    """
+    _mapper = [(nx.bool_, str2bool, False),
+               (nx.int_, int, -1),]
+
+    # On 32-bit systems, we need to make sure that we explicitly include
+    # nx.int64 since ns.int_ is nx.int32.
+    if nx.dtype(nx.int_).itemsize < nx.dtype(nx.int64).itemsize:
+        _mapper.append((nx.int64, int, -1))
+
+    _mapper.extend([(nx.float64, float, nx.nan),
+                    (nx.complex128, complex, nx.nan + 0j),
+                    (nx.longdouble, nx.longdouble, nx.nan),
+                    # If a non-default dtype is passed, fall back to generic
+                    # ones (should only be used for the converter)
+                    (nx.integer, int, -1),
+                    (nx.floating, float, nx.nan),
+                    (nx.complexfloating, complex, nx.nan + 0j),
+                    # Last, try with the string types (must be last, because
+                    # `_mapper[-1]` is used as default in some cases)
+                    (nx.unicode_, asunicode, '???'),
+                    (nx.string_, asbytes, '???'),
+                    ])
+
+    @classmethod
+    def _getdtype(cls, val):
+        """Returns the dtype of the input variable."""
+        return np.array(val).dtype
+
+    @classmethod
+    def _getsubdtype(cls, val):
+        """Returns the type of the dtype of the input variable."""
+        return np.array(val).dtype.type
+
+    @classmethod
+    def _dtypeortype(cls, dtype):
+        """Returns dtype for datetime64 and type of dtype otherwise."""
+
+        # This is a bit annoying. We want to return the "general" type in most
+        # cases (ie. "string" rather than "S10"), but we want to return the
+        # specific type for datetime64 (ie. "datetime64[us]" rather than
+        # "datetime64").
+        if dtype.type == np.datetime64:
+            return dtype
+        return dtype.type
+
+    @classmethod
+    def upgrade_mapper(cls, func, default=None):
+        """
+        Upgrade the mapper of a StringConverter by adding a new function and
+        its corresponding default.
+
+        The input function (or sequence of functions) and its associated
+        default value (if any) is inserted in penultimate position of the
+        mapper.  The corresponding type is estimated from the dtype of the
+        default value.
+
+        Parameters
+        ----------
+        func : var
+            Function, or sequence of functions
+
+        Examples
+        --------
+        >>> import dateutil.parser
+        >>> import datetime
+        >>> dateparser = dateutil.parser.parse
+        >>> defaultdate = datetime.date(2000, 1, 1)
+        >>> StringConverter.upgrade_mapper(dateparser, default=defaultdate)
+        """
+        # Func is a single functions
+        if hasattr(func, '__call__'):
+            cls._mapper.insert(-1, (cls._getsubdtype(default), func, default))
+            return
+        elif hasattr(func, '__iter__'):
+            if isinstance(func[0], (tuple, list)):
+                for _ in func:
+                    cls._mapper.insert(-1, _)
+                return
+            if default is None:
+                default = [None] * len(func)
+            else:
+                default = list(default)
+                default.append([None] * (len(func) - len(default)))
+            for fct, dft in zip(func, default):
+                cls._mapper.insert(-1, (cls._getsubdtype(dft), fct, dft))
+
+    @classmethod
+    def _find_map_entry(cls, dtype):
+        # if a converter for the specific dtype is available use that
+        for i, (deftype, func, default_def) in enumerate(cls._mapper):
+            if dtype.type == deftype:
+                return i, (deftype, func, default_def)
+
+        # otherwise find an inexact match
+        for i, (deftype, func, default_def) in enumerate(cls._mapper):
+            if np.issubdtype(dtype.type, deftype):
+                return i, (deftype, func, default_def)
+
+        raise LookupError
+
+    def __init__(self, dtype_or_func=None, default=None, missing_values=None,
+                 locked=False):
+        # Defines a lock for upgrade
+        self._locked = bool(locked)
+        # No input dtype: minimal initialization
+        if dtype_or_func is None:
+            self.func = str2bool
+            self._status = 0
+            self.default = default or False
+            dtype = np.dtype('bool')
+        else:
+            # Is the input a np.dtype ?
+            try:
+                self.func = None
+                dtype = np.dtype(dtype_or_func)
+            except TypeError:
+                # dtype_or_func must be a function, then
+                if not hasattr(dtype_or_func, '__call__'):
+                    errmsg = ("The input argument `dtype` is neither a"
+                              " function nor a dtype (got '%s' instead)")
+                    raise TypeError(errmsg % type(dtype_or_func))
+                # Set the function
+                self.func = dtype_or_func
+                # If we don't have a default, try to guess it or set it to
+                # None
+                if default is None:
+                    try:
+                        default = self.func('0')
+                    except ValueError:
+                        default = None
+                dtype = self._getdtype(default)
+
+            # find the best match in our mapper
+            try:
+                self._status, (_, func, default_def) = self._find_map_entry(dtype)
+            except LookupError:
+                # no match
+                self.default = default
+                _, func, _ = self._mapper[-1]
+                self._status = 0
+            else:
+                # use the found default only if we did not already have one
+                if default is None:
+                    self.default = default_def
+                else:
+                    self.default = default
+
+            # If the input was a dtype, set the function to the last we saw
+            if self.func is None:
+                self.func = func
+
+            # If the status is 1 (int), change the function to
+            # something more robust.
+            if self.func == self._mapper[1][1]:
+                if issubclass(dtype.type, np.uint64):
+                    self.func = np.uint64
+                elif issubclass(dtype.type, np.int64):
+                    self.func = np.int64
+                else:
+                    self.func = lambda x: int(float(x))
+        # Store the list of strings corresponding to missing values.
+        if missing_values is None:
+            self.missing_values = {''}
+        else:
+            if isinstance(missing_values, str):
+                missing_values = missing_values.split(",")
+            self.missing_values = set(list(missing_values) + [''])
+
+        self._callingfunction = self._strict_call
+        self.type = self._dtypeortype(dtype)
+        self._checked = False
+        self._initial_default = default
+
+    def _loose_call(self, value):
+        try:
+            return self.func(value)
+        except ValueError:
+            return self.default
+
+    def _strict_call(self, value):
+        try:
+
+            # We check if we can convert the value using the current function
+            new_value = self.func(value)
+
+            # In addition to having to check whether func can convert the
+            # value, we also have to make sure that we don't get overflow
+            # errors for integers.
+            if self.func is int:
+                try:
+                    np.array(value, dtype=self.type)
+                except OverflowError:
+                    raise ValueError
+
+            # We're still here so we can now return the new value
+            return new_value
+
+        except ValueError:
+            if value.strip() in self.missing_values:
+                if not self._status:
+                    self._checked = False
+                return self.default
+            raise ValueError("Cannot convert string '%s'" % value)
+
+    def __call__(self, value):
+        return self._callingfunction(value)
+
+    def _do_upgrade(self):
+        # Raise an exception if we locked the converter...
+        if self._locked:
+            errmsg = "Converter is locked and cannot be upgraded"
+            raise ConverterLockError(errmsg)
+        _statusmax = len(self._mapper)
+        # Complains if we try to upgrade by the maximum
+        _status = self._status
+        if _status == _statusmax:
+            errmsg = "Could not find a valid conversion function"
+            raise ConverterError(errmsg)
+        elif _status < _statusmax - 1:
+            _status += 1
+        self.type, self.func, default = self._mapper[_status]
+        self._status = _status
+        if self._initial_default is not None:
+            self.default = self._initial_default
+        else:
+            self.default = default
+
+    def upgrade(self, value):
+        """
+        Find the best converter for a given string, and return the result.
+
+        The supplied string `value` is converted by testing different
+        converters in order. First the `func` method of the
+        `StringConverter` instance is tried, if this fails other available
+        converters are tried.  The order in which these other converters
+        are tried is determined by the `_status` attribute of the instance.
+
+        Parameters
+        ----------
+        value : str
+            The string to convert.
+
+        Returns
+        -------
+        out : any
+            The result of converting `value` with the appropriate converter.
+
+        """
+        self._checked = True
+        try:
+            return self._strict_call(value)
+        except ValueError:
+            self._do_upgrade()
+            return self.upgrade(value)
+
+    def iterupgrade(self, value):
+        self._checked = True
+        if not hasattr(value, '__iter__'):
+            value = (value,)
+        _strict_call = self._strict_call
+        try:
+            for _m in value:
+                _strict_call(_m)
+        except ValueError:
+            self._do_upgrade()
+            self.iterupgrade(value)
+
+    def update(self, func, default=None, testing_value=None,
+               missing_values='', locked=False):
+        """
+        Set StringConverter attributes directly.
+
+        Parameters
+        ----------
+        func : function
+            Conversion function.
+        default : any, optional
+            Value to return by default, that is, when the string to be
+            converted is flagged as missing. If not given,
+            `StringConverter` tries to supply a reasonable default value.
+        testing_value : str, optional
+            A string representing a standard input value of the converter.
+            This string is used to help defining a reasonable default
+            value.
+        missing_values : {sequence of str, None}, optional
+            Sequence of strings indicating a missing value. If ``None``, then
+            the existing `missing_values` are cleared. The default is `''`.
+        locked : bool, optional
+            Whether the StringConverter should be locked to prevent
+            automatic upgrade or not. Default is False.
+
+        Notes
+        -----
+        `update` takes the same parameters as the constructor of
+        `StringConverter`, except that `func` does not accept a `dtype`
+        whereas `dtype_or_func` in the constructor does.
+
+        """
+        self.func = func
+        self._locked = locked
+
+        # Don't reset the default to None if we can avoid it
+        if default is not None:
+            self.default = default
+            self.type = self._dtypeortype(self._getdtype(default))
+        else:
+            try:
+                tester = func(testing_value or '1')
+            except (TypeError, ValueError):
+                tester = None
+            self.type = self._dtypeortype(self._getdtype(tester))
+
+        # Add the missing values to the existing set or clear it.
+        if missing_values is None:
+            # Clear all missing values even though the ctor initializes it to
+            # set(['']) when the argument is None.
+            self.missing_values = set()
+        else:
+            if not np.iterable(missing_values):
+                missing_values = [missing_values]
+            if not all(isinstance(v, str) for v in missing_values):
+                raise TypeError("missing_values must be strings or unicode")
+            self.missing_values.update(missing_values)
+
+
+def easy_dtype(ndtype, names=None, defaultfmt="f%i", **validationargs):
+    """
+    Convenience function to create a `np.dtype` object.
+
+    The function processes the input `dtype` and matches it with the given
+    names.
+
+    Parameters
+    ----------
+    ndtype : var
+        Definition of the dtype. Can be any string or dictionary recognized
+        by the `np.dtype` function, or a sequence of types.
+    names : str or sequence, optional
+        Sequence of strings to use as field names for a structured dtype.
+        For convenience, `names` can be a string of a comma-separated list
+        of names.
+    defaultfmt : str, optional
+        Format string used to define missing names, such as ``"f%i"``
+        (default) or ``"fields_%02i"``.
+    validationargs : optional
+        A series of optional arguments used to initialize a
+        `NameValidator`.
+
+    Examples
+    --------
+    >>> np.lib._iotools.easy_dtype(float)
+    dtype('float64')
+    >>> np.lib._iotools.easy_dtype("i4, f8")
+    dtype([('f0', '<i4'), ('f1', '<f8')])
+    >>> np.lib._iotools.easy_dtype("i4, f8", defaultfmt="field_%03i")
+    dtype([('field_000', '<i4'), ('field_001', '<f8')])
+
+    >>> np.lib._iotools.easy_dtype((int, float, float), names="a,b,c")
+    dtype([('a', '<i8'), ('b', '<f8'), ('c', '<f8')])
+    >>> np.lib._iotools.easy_dtype(float, names="a,b,c")
+    dtype([('a', '<f8'), ('b', '<f8'), ('c', '<f8')])
+
+    """
+    try:
+        ndtype = np.dtype(ndtype)
+    except TypeError:
+        validate = NameValidator(**validationargs)
+        nbfields = len(ndtype)
+        if names is None:
+            names = [''] * len(ndtype)
+        elif isinstance(names, str):
+            names = names.split(",")
+        names = validate(names, nbfields=nbfields, defaultfmt=defaultfmt)
+        ndtype = np.dtype(dict(formats=ndtype, names=names))
+    else:
+        # Explicit names
+        if names is not None:
+            validate = NameValidator(**validationargs)
+            if isinstance(names, str):
+                names = names.split(",")
+            # Simple dtype: repeat to match the nb of names
+            if ndtype.names is None:
+                formats = tuple([ndtype.type] * len(names))
+                names = validate(names, defaultfmt=defaultfmt)
+                ndtype = np.dtype(list(zip(names, formats)))
+            # Structured dtype: just validate the names as needed
+            else:
+                ndtype.names = validate(names, nbfields=len(ndtype.names),
+                                        defaultfmt=defaultfmt)
+        # No implicit names
+        elif ndtype.names is not None:
+            validate = NameValidator(**validationargs)
+            # Default initial names : should we change the format ?
+            numbered_names = tuple("f%i" % i for i in range(len(ndtype.names)))
+            if ((ndtype.names == numbered_names) and (defaultfmt != "f%i")):
+                ndtype.names = validate([''] * len(ndtype.names),
+                                        defaultfmt=defaultfmt)
+            # Explicit initial names : just validate
+            else:
+                ndtype.names = validate(ndtype.names, defaultfmt=defaultfmt)
+    return ndtype
diff --git a/venv/Lib/site-packages/numpy/lib/_version.py b/venv/Lib/site-packages/numpy/lib/_version.py
new file mode 100644
index 000000000..d4098acb5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/_version.py
@@ -0,0 +1,155 @@
+"""Utility to compare (NumPy) version strings.
+
+The NumpyVersion class allows properly comparing numpy version strings.
+The LooseVersion and StrictVersion classes that distutils provides don't
+work; they don't recognize anything like alpha/beta/rc/dev versions.
+
+"""
+import re
+
+
+__all__ = ['NumpyVersion']
+
+
+class NumpyVersion():
+    """Parse and compare numpy version strings.
+
+    NumPy has the following versioning scheme (numbers given are examples; they
+    can be > 9) in principle):
+
+    - Released version: '1.8.0', '1.8.1', etc.
+    - Alpha: '1.8.0a1', '1.8.0a2', etc.
+    - Beta: '1.8.0b1', '1.8.0b2', etc.
+    - Release candidates: '1.8.0rc1', '1.8.0rc2', etc.
+    - Development versions: '1.8.0.dev-f1234afa' (git commit hash appended)
+    - Development versions after a1: '1.8.0a1.dev-f1234afa',
+                                     '1.8.0b2.dev-f1234afa',
+                                     '1.8.1rc1.dev-f1234afa', etc.
+    - Development versions (no git hash available): '1.8.0.dev-Unknown'
+
+    Comparing needs to be done against a valid version string or other
+    `NumpyVersion` instance. Note that all development versions of the same
+    (pre-)release compare equal.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    vstring : str
+        NumPy version string (``np.__version__``).
+
+    Examples
+    --------
+    >>> from numpy.lib import NumpyVersion
+    >>> if NumpyVersion(np.__version__) < '1.7.0':
+    ...     print('skip')
+    >>> # skip
+
+    >>> NumpyVersion('1.7')  # raises ValueError, add ".0"
+    Traceback (most recent call last):
+        ...
+    ValueError: Not a valid numpy version string
+
+    """
+
+    def __init__(self, vstring):
+        self.vstring = vstring
+        ver_main = re.match(r'\d[.]\d+[.]\d+', vstring)
+        if not ver_main:
+            raise ValueError("Not a valid numpy version string")
+
+        self.version = ver_main.group()
+        self.major, self.minor, self.bugfix = [int(x) for x in
+            self.version.split('.')]
+        if len(vstring) == ver_main.end():
+            self.pre_release = 'final'
+        else:
+            alpha = re.match(r'a\d', vstring[ver_main.end():])
+            beta = re.match(r'b\d', vstring[ver_main.end():])
+            rc = re.match(r'rc\d', vstring[ver_main.end():])
+            pre_rel = [m for m in [alpha, beta, rc] if m is not None]
+            if pre_rel:
+                self.pre_release = pre_rel[0].group()
+            else:
+                self.pre_release = ''
+
+        self.is_devversion = bool(re.search(r'.dev', vstring))
+
+    def _compare_version(self, other):
+        """Compare major.minor.bugfix"""
+        if self.major == other.major:
+            if self.minor == other.minor:
+                if self.bugfix == other.bugfix:
+                    vercmp = 0
+                elif self.bugfix > other.bugfix:
+                    vercmp = 1
+                else:
+                    vercmp = -1
+            elif self.minor > other.minor:
+                vercmp = 1
+            else:
+                vercmp = -1
+        elif self.major > other.major:
+            vercmp = 1
+        else:
+            vercmp = -1
+
+        return vercmp
+
+    def _compare_pre_release(self, other):
+        """Compare alpha/beta/rc/final."""
+        if self.pre_release == other.pre_release:
+            vercmp = 0
+        elif self.pre_release == 'final':
+            vercmp = 1
+        elif other.pre_release == 'final':
+            vercmp = -1
+        elif self.pre_release > other.pre_release:
+            vercmp = 1
+        else:
+            vercmp = -1
+
+        return vercmp
+
+    def _compare(self, other):
+        if not isinstance(other, (str, NumpyVersion)):
+            raise ValueError("Invalid object to compare with NumpyVersion.")
+
+        if isinstance(other, str):
+            other = NumpyVersion(other)
+
+        vercmp = self._compare_version(other)
+        if vercmp == 0:
+            # Same x.y.z version, check for alpha/beta/rc
+            vercmp = self._compare_pre_release(other)
+            if vercmp == 0:
+                # Same version and same pre-release, check if dev version
+                if self.is_devversion is other.is_devversion:
+                    vercmp = 0
+                elif self.is_devversion:
+                    vercmp = -1
+                else:
+                    vercmp = 1
+
+        return vercmp
+
+    def __lt__(self, other):
+        return self._compare(other) < 0
+
+    def __le__(self, other):
+        return self._compare(other) <= 0
+
+    def __eq__(self, other):
+        return self._compare(other) == 0
+
+    def __ne__(self, other):
+        return self._compare(other) != 0
+
+    def __gt__(self, other):
+        return self._compare(other) > 0
+
+    def __ge__(self, other):
+        return self._compare(other) >= 0
+
+    def __repr(self):
+        return "NumpyVersion(%s)" % self.vstring
diff --git a/venv/Lib/site-packages/numpy/lib/arraypad.py b/venv/Lib/site-packages/numpy/lib/arraypad.py
new file mode 100644
index 000000000..7569e7651
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/arraypad.py
@@ -0,0 +1,879 @@
+"""
+The arraypad module contains a group of functions to pad values onto the edges
+of an n-dimensional array.
+
+"""
+import numpy as np
+from numpy.core.overrides import array_function_dispatch
+from numpy.lib.index_tricks import ndindex
+
+
+__all__ = ['pad']
+
+
+###############################################################################
+# Private utility functions.
+
+
+def _round_if_needed(arr, dtype):
+    """
+    Rounds arr inplace if destination dtype is integer.
+
+    Parameters
+    ----------
+    arr : ndarray
+        Input array.
+    dtype : dtype
+        The dtype of the destination array.
+    """
+    if np.issubdtype(dtype, np.integer):
+        arr.round(out=arr)
+
+
+def _slice_at_axis(sl, axis):
+    """
+    Construct tuple of slices to slice an array in the given dimension.
+
+    Parameters
+    ----------
+    sl : slice
+        The slice for the given dimension.
+    axis : int
+        The axis to which `sl` is applied. All other dimensions are left
+        "unsliced".
+
+    Returns
+    -------
+    sl : tuple of slices
+        A tuple with slices matching `shape` in length.
+
+    Examples
+    --------
+    >>> _slice_at_axis(slice(None, 3, -1), 1)
+    (slice(None, None, None), slice(None, 3, -1), (...,))
+    """
+    return (slice(None),) * axis + (sl,) + (...,)
+
+
+def _view_roi(array, original_area_slice, axis):
+    """
+    Get a view of the current region of interest during iterative padding.
+
+    When padding multiple dimensions iteratively corner values are
+    unnecessarily overwritten multiple times. This function reduces the
+    working area for the first dimensions so that corners are excluded.
+
+    Parameters
+    ----------
+    array : ndarray
+        The array with the region of interest.
+    original_area_slice : tuple of slices
+        Denotes the area with original values of the unpadded array.
+    axis : int
+        The currently padded dimension assuming that `axis` is padded before
+        `axis` + 1.
+
+    Returns
+    -------
+    roi : ndarray
+        The region of interest of the original `array`.
+    """
+    axis += 1
+    sl = (slice(None),) * axis + original_area_slice[axis:]
+    return array[sl]
+
+
+def _pad_simple(array, pad_width, fill_value=None):
+    """
+    Pad array on all sides with either a single value or undefined values.
+
+    Parameters
+    ----------
+    array : ndarray
+        Array to grow.
+    pad_width : sequence of tuple[int, int]
+        Pad width on both sides for each dimension in `arr`.
+    fill_value : scalar, optional
+        If provided the padded area is filled with this value, otherwise
+        the pad area left undefined.
+
+    Returns
+    -------
+    padded : ndarray
+        The padded array with the same dtype as`array`. Its order will default
+        to C-style if `array` is not F-contiguous.
+    original_area_slice : tuple
+        A tuple of slices pointing to the area of the original array.
+    """
+    # Allocate grown array
+    new_shape = tuple(
+        left + size + right
+        for size, (left, right) in zip(array.shape, pad_width)
+    )
+    order = 'F' if array.flags.fnc else 'C'  # Fortran and not also C-order
+    padded = np.empty(new_shape, dtype=array.dtype, order=order)
+
+    if fill_value is not None:
+        padded.fill(fill_value)
+
+    # Copy old array into correct space
+    original_area_slice = tuple(
+        slice(left, left + size)
+        for size, (left, right) in zip(array.shape, pad_width)
+    )
+    padded[original_area_slice] = array
+
+    return padded, original_area_slice
+
+
+def _set_pad_area(padded, axis, width_pair, value_pair):
+    """
+    Set empty-padded area in given dimension.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Array with the pad area which is modified inplace.
+    axis : int
+        Dimension with the pad area to set.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+    value_pair : tuple of scalars or ndarrays
+        Values inserted into the pad area on each side. It must match or be
+        broadcastable to the shape of `arr`.
+    """
+    left_slice = _slice_at_axis(slice(None, width_pair[0]), axis)
+    padded[left_slice] = value_pair[0]
+
+    right_slice = _slice_at_axis(
+        slice(padded.shape[axis] - width_pair[1], None), axis)
+    padded[right_slice] = value_pair[1]
+
+
+def _get_edges(padded, axis, width_pair):
+    """
+    Retrieve edge values from empty-padded array in given dimension.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Empty-padded array.
+    axis : int
+        Dimension in which the edges are considered.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+
+    Returns
+    -------
+    left_edge, right_edge : ndarray
+        Edge values of the valid area in `padded` in the given dimension. Its
+        shape will always match `padded` except for the dimension given by
+        `axis` which will have a length of 1.
+    """
+    left_index = width_pair[0]
+    left_slice = _slice_at_axis(slice(left_index, left_index + 1), axis)
+    left_edge = padded[left_slice]
+
+    right_index = padded.shape[axis] - width_pair[1]
+    right_slice = _slice_at_axis(slice(right_index - 1, right_index), axis)
+    right_edge = padded[right_slice]
+
+    return left_edge, right_edge
+
+
+def _get_linear_ramps(padded, axis, width_pair, end_value_pair):
+    """
+    Construct linear ramps for empty-padded array in given dimension.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Empty-padded array.
+    axis : int
+        Dimension in which the ramps are constructed.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+    end_value_pair : (scalar, scalar)
+        End values for the linear ramps which form the edge of the fully padded
+        array. These values are included in the linear ramps.
+
+    Returns
+    -------
+    left_ramp, right_ramp : ndarray
+        Linear ramps to set on both sides of `padded`.
+    """
+    edge_pair = _get_edges(padded, axis, width_pair)
+
+    left_ramp = np.linspace(
+        start=end_value_pair[0],
+        stop=edge_pair[0].squeeze(axis),  # Dimensions is replaced by linspace
+        num=width_pair[0],
+        endpoint=False,
+        dtype=padded.dtype,
+        axis=axis,
+    )
+
+    right_ramp = np.linspace(
+        start=end_value_pair[1],
+        stop=edge_pair[1].squeeze(axis),  # Dimension is replaced by linspace
+        num=width_pair[1],
+        endpoint=False,
+        dtype=padded.dtype,
+        axis=axis,
+    )
+    # Reverse linear space in appropriate dimension
+    right_ramp = right_ramp[_slice_at_axis(slice(None, None, -1), axis)]
+
+    return left_ramp, right_ramp
+
+
+def _get_stats(padded, axis, width_pair, length_pair, stat_func):
+    """
+    Calculate statistic for the empty-padded array in given dimension.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Empty-padded array.
+    axis : int
+        Dimension in which the statistic is calculated.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+    length_pair : 2-element sequence of None or int
+        Gives the number of values in valid area from each side that is
+        taken into account when calculating the statistic. If None the entire
+        valid area in `padded` is considered.
+    stat_func : function
+        Function to compute statistic. The expected signature is
+        ``stat_func(x: ndarray, axis: int, keepdims: bool) -> ndarray``.
+
+    Returns
+    -------
+    left_stat, right_stat : ndarray
+        Calculated statistic for both sides of `padded`.
+    """
+    # Calculate indices of the edges of the area with original values
+    left_index = width_pair[0]
+    right_index = padded.shape[axis] - width_pair[1]
+    # as well as its length
+    max_length = right_index - left_index
+
+    # Limit stat_lengths to max_length
+    left_length, right_length = length_pair
+    if left_length is None or max_length < left_length:
+        left_length = max_length
+    if right_length is None or max_length < right_length:
+        right_length = max_length
+
+    if (left_length == 0 or right_length == 0) \
+            and stat_func in {np.amax, np.amin}:
+        # amax and amin can't operate on an empty array,
+        # raise a more descriptive warning here instead of the default one
+        raise ValueError("stat_length of 0 yields no value for padding")
+
+    # Calculate statistic for the left side
+    left_slice = _slice_at_axis(
+        slice(left_index, left_index + left_length), axis)
+    left_chunk = padded[left_slice]
+    left_stat = stat_func(left_chunk, axis=axis, keepdims=True)
+    _round_if_needed(left_stat, padded.dtype)
+
+    if left_length == right_length == max_length:
+        # return early as right_stat must be identical to left_stat
+        return left_stat, left_stat
+
+    # Calculate statistic for the right side
+    right_slice = _slice_at_axis(
+        slice(right_index - right_length, right_index), axis)
+    right_chunk = padded[right_slice]
+    right_stat = stat_func(right_chunk, axis=axis, keepdims=True)
+    _round_if_needed(right_stat, padded.dtype)
+
+    return left_stat, right_stat
+
+
+def _set_reflect_both(padded, axis, width_pair, method, include_edge=False):
+    """
+    Pad `axis` of `arr` with reflection.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Input array of arbitrary shape.
+    axis : int
+        Axis along which to pad `arr`.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+    method : str
+        Controls method of reflection; options are 'even' or 'odd'.
+    include_edge : bool
+        If true, edge value is included in reflection, otherwise the edge
+        value forms the symmetric axis to the reflection.
+
+    Returns
+    -------
+    pad_amt : tuple of ints, length 2
+        New index positions of padding to do along the `axis`. If these are
+        both 0, padding is done in this dimension.
+    """
+    left_pad, right_pad = width_pair
+    old_length = padded.shape[axis] - right_pad - left_pad
+
+    if include_edge:
+        # Edge is included, we need to offset the pad amount by 1
+        edge_offset = 1
+    else:
+        edge_offset = 0  # Edge is not included, no need to offset pad amount
+        old_length -= 1  # but must be omitted from the chunk
+
+    if left_pad > 0:
+        # Pad with reflected values on left side:
+        # First limit chunk size which can't be larger than pad area
+        chunk_length = min(old_length, left_pad)
+        # Slice right to left, stop on or next to edge, start relative to stop
+        stop = left_pad - edge_offset
+        start = stop + chunk_length
+        left_slice = _slice_at_axis(slice(start, stop, -1), axis)
+        left_chunk = padded[left_slice]
+
+        if method == "odd":
+            # Negate chunk and align with edge
+            edge_slice = _slice_at_axis(slice(left_pad, left_pad + 1), axis)
+            left_chunk = 2 * padded[edge_slice] - left_chunk
+
+        # Insert chunk into padded area
+        start = left_pad - chunk_length
+        stop = left_pad
+        pad_area = _slice_at_axis(slice(start, stop), axis)
+        padded[pad_area] = left_chunk
+        # Adjust pointer to left edge for next iteration
+        left_pad -= chunk_length
+
+    if right_pad > 0:
+        # Pad with reflected values on right side:
+        # First limit chunk size which can't be larger than pad area
+        chunk_length = min(old_length, right_pad)
+        # Slice right to left, start on or next to edge, stop relative to start
+        start = -right_pad + edge_offset - 2
+        stop = start - chunk_length
+        right_slice = _slice_at_axis(slice(start, stop, -1), axis)
+        right_chunk = padded[right_slice]
+
+        if method == "odd":
+            # Negate chunk and align with edge
+            edge_slice = _slice_at_axis(
+                slice(-right_pad - 1, -right_pad), axis)
+            right_chunk = 2 * padded[edge_slice] - right_chunk
+
+        # Insert chunk into padded area
+        start = padded.shape[axis] - right_pad
+        stop = start + chunk_length
+        pad_area = _slice_at_axis(slice(start, stop), axis)
+        padded[pad_area] = right_chunk
+        # Adjust pointer to right edge for next iteration
+        right_pad -= chunk_length
+
+    return left_pad, right_pad
+
+
+def _set_wrap_both(padded, axis, width_pair):
+    """
+    Pad `axis` of `arr` with wrapped values.
+
+    Parameters
+    ----------
+    padded : ndarray
+        Input array of arbitrary shape.
+    axis : int
+        Axis along which to pad `arr`.
+    width_pair : (int, int)
+        Pair of widths that mark the pad area on both sides in the given
+        dimension.
+
+    Returns
+    -------
+    pad_amt : tuple of ints, length 2
+        New index positions of padding to do along the `axis`. If these are
+        both 0, padding is done in this dimension.
+    """
+    left_pad, right_pad = width_pair
+    period = padded.shape[axis] - right_pad - left_pad
+
+    # If the current dimension of `arr` doesn't contain enough valid values
+    # (not part of the undefined pad area) we need to pad multiple times.
+    # Each time the pad area shrinks on both sides which is communicated with
+    # these variables.
+    new_left_pad = 0
+    new_right_pad = 0
+
+    if left_pad > 0:
+        # Pad with wrapped values on left side
+        # First slice chunk from right side of the non-pad area.
+        # Use min(period, left_pad) to ensure that chunk is not larger than
+        # pad area
+        right_slice = _slice_at_axis(
+            slice(-right_pad - min(period, left_pad),
+                  -right_pad if right_pad != 0 else None),
+            axis
+        )
+        right_chunk = padded[right_slice]
+
+        if left_pad > period:
+            # Chunk is smaller than pad area
+            pad_area = _slice_at_axis(slice(left_pad - period, left_pad), axis)
+            new_left_pad = left_pad - period
+        else:
+            # Chunk matches pad area
+            pad_area = _slice_at_axis(slice(None, left_pad), axis)
+        padded[pad_area] = right_chunk
+
+    if right_pad > 0:
+        # Pad with wrapped values on right side
+        # First slice chunk from left side of the non-pad area.
+        # Use min(period, right_pad) to ensure that chunk is not larger than
+        # pad area
+        left_slice = _slice_at_axis(
+            slice(left_pad, left_pad + min(period, right_pad),), axis)
+        left_chunk = padded[left_slice]
+
+        if right_pad > period:
+            # Chunk is smaller than pad area
+            pad_area = _slice_at_axis(
+                slice(-right_pad, -right_pad + period), axis)
+            new_right_pad = right_pad - period
+        else:
+            # Chunk matches pad area
+            pad_area = _slice_at_axis(slice(-right_pad, None), axis)
+        padded[pad_area] = left_chunk
+
+    return new_left_pad, new_right_pad
+
+
+def _as_pairs(x, ndim, as_index=False):
+    """
+    Broadcast `x` to an array with the shape (`ndim`, 2).
+
+    A helper function for `pad` that prepares and validates arguments like
+    `pad_width` for iteration in pairs.
+
+    Parameters
+    ----------
+    x : {None, scalar, array-like}
+        The object to broadcast to the shape (`ndim`, 2).
+    ndim : int
+        Number of pairs the broadcasted `x` will have.
+    as_index : bool, optional
+        If `x` is not None, try to round each element of `x` to an integer
+        (dtype `np.intp`) and ensure every element is positive.
+
+    Returns
+    -------
+    pairs : nested iterables, shape (`ndim`, 2)
+        The broadcasted version of `x`.
+
+    Raises
+    ------
+    ValueError
+        If `as_index` is True and `x` contains negative elements.
+        Or if `x` is not broadcastable to the shape (`ndim`, 2).
+    """
+    if x is None:
+        # Pass through None as a special case, otherwise np.round(x) fails
+        # with an AttributeError
+        return ((None, None),) * ndim
+
+    x = np.array(x)
+    if as_index:
+        x = np.round(x).astype(np.intp, copy=False)
+
+    if x.ndim < 3:
+        # Optimization: Possibly use faster paths for cases where `x` has
+        # only 1 or 2 elements. `np.broadcast_to` could handle these as well
+        # but is currently slower
+
+        if x.size == 1:
+            # x was supplied as a single value
+            x = x.ravel()  # Ensure x[0] works for x.ndim == 0, 1, 2
+            if as_index and x < 0:
+                raise ValueError("index can't contain negative values")
+            return ((x[0], x[0]),) * ndim
+
+        if x.size == 2 and x.shape != (2, 1):
+            # x was supplied with a single value for each side
+            # but except case when each dimension has a single value
+            # which should be broadcasted to a pair,
+            # e.g. [[1], [2]] -> [[1, 1], [2, 2]] not [[1, 2], [1, 2]]
+            x = x.ravel()  # Ensure x[0], x[1] works
+            if as_index and (x[0] < 0 or x[1] < 0):
+                raise ValueError("index can't contain negative values")
+            return ((x[0], x[1]),) * ndim
+
+    if as_index and x.min() < 0:
+        raise ValueError("index can't contain negative values")
+
+    # Converting the array with `tolist` seems to improve performance
+    # when iterating and indexing the result (see usage in `pad`)
+    return np.broadcast_to(x, (ndim, 2)).tolist()
+
+
+def _pad_dispatcher(array, pad_width, mode=None, **kwargs):
+    return (array,)
+
+
+###############################################################################
+# Public functions
+
+
+@array_function_dispatch(_pad_dispatcher, module='numpy')
+def pad(array, pad_width, mode='constant', **kwargs):
+    """
+    Pad an array.
+
+    Parameters
+    ----------
+    array : array_like of rank N
+        The array to pad.
+    pad_width : {sequence, array_like, int}
+        Number of values padded to the edges of each axis.
+        ((before_1, after_1), ... (before_N, after_N)) unique pad widths
+        for each axis.
+        ((before, after),) yields same before and after pad for each axis.
+        (pad,) or int is a shortcut for before = after = pad width for all
+        axes.
+    mode : str or function, optional
+        One of the following string values or a user supplied function.
+
+        'constant' (default)
+            Pads with a constant value.
+        'edge'
+            Pads with the edge values of array.
+        'linear_ramp'
+            Pads with the linear ramp between end_value and the
+            array edge value.
+        'maximum'
+            Pads with the maximum value of all or part of the
+            vector along each axis.
+        'mean'
+            Pads with the mean value of all or part of the
+            vector along each axis.
+        'median'
+            Pads with the median value of all or part of the
+            vector along each axis.
+        'minimum'
+            Pads with the minimum value of all or part of the
+            vector along each axis.
+        'reflect'
+            Pads with the reflection of the vector mirrored on
+            the first and last values of the vector along each
+            axis.
+        'symmetric'
+            Pads with the reflection of the vector mirrored
+            along the edge of the array.
+        'wrap'
+            Pads with the wrap of the vector along the axis.
+            The first values are used to pad the end and the
+            end values are used to pad the beginning.
+        'empty'
+            Pads with undefined values.
+
+            .. versionadded:: 1.17
+
+        <function>
+            Padding function, see Notes.
+    stat_length : sequence or int, optional
+        Used in 'maximum', 'mean', 'median', and 'minimum'.  Number of
+        values at edge of each axis used to calculate the statistic value.
+
+        ((before_1, after_1), ... (before_N, after_N)) unique statistic
+        lengths for each axis.
+
+        ((before, after),) yields same before and after statistic lengths
+        for each axis.
+
+        (stat_length,) or int is a shortcut for before = after = statistic
+        length for all axes.
+
+        Default is ``None``, to use the entire axis.
+    constant_values : sequence or scalar, optional
+        Used in 'constant'.  The values to set the padded values for each
+        axis.
+
+        ``((before_1, after_1), ... (before_N, after_N))`` unique pad constants
+        for each axis.
+
+        ``((before, after),)`` yields same before and after constants for each
+        axis.
+
+        ``(constant,)`` or ``constant`` is a shortcut for ``before = after = constant`` for
+        all axes.
+
+        Default is 0.
+    end_values : sequence or scalar, optional
+        Used in 'linear_ramp'.  The values used for the ending value of the
+        linear_ramp and that will form the edge of the padded array.
+
+        ``((before_1, after_1), ... (before_N, after_N))`` unique end values
+        for each axis.
+
+        ``((before, after),)`` yields same before and after end values for each
+        axis.
+
+        ``(constant,)`` or ``constant`` is a shortcut for ``before = after = constant`` for
+        all axes.
+
+        Default is 0.
+    reflect_type : {'even', 'odd'}, optional
+        Used in 'reflect', and 'symmetric'.  The 'even' style is the
+        default with an unaltered reflection around the edge value.  For
+        the 'odd' style, the extended part of the array is created by
+        subtracting the reflected values from two times the edge value.
+
+    Returns
+    -------
+    pad : ndarray
+        Padded array of rank equal to `array` with shape increased
+        according to `pad_width`.
+
+    Notes
+    -----
+    .. versionadded:: 1.7.0
+
+    For an array with rank greater than 1, some of the padding of later
+    axes is calculated from padding of previous axes.  This is easiest to
+    think about with a rank 2 array where the corners of the padded array
+    are calculated by using padded values from the first axis.
+
+    The padding function, if used, should modify a rank 1 array in-place. It
+    has the following signature::
+
+        padding_func(vector, iaxis_pad_width, iaxis, kwargs)
+
+    where
+
+        vector : ndarray
+            A rank 1 array already padded with zeros.  Padded values are
+            vector[:iaxis_pad_width[0]] and vector[-iaxis_pad_width[1]:].
+        iaxis_pad_width : tuple
+            A 2-tuple of ints, iaxis_pad_width[0] represents the number of
+            values padded at the beginning of vector where
+            iaxis_pad_width[1] represents the number of values padded at
+            the end of vector.
+        iaxis : int
+            The axis currently being calculated.
+        kwargs : dict
+            Any keyword arguments the function requires.
+
+    Examples
+    --------
+    >>> a = [1, 2, 3, 4, 5]
+    >>> np.pad(a, (2, 3), 'constant', constant_values=(4, 6))
+    array([4, 4, 1, ..., 6, 6, 6])
+
+    >>> np.pad(a, (2, 3), 'edge')
+    array([1, 1, 1, ..., 5, 5, 5])
+
+    >>> np.pad(a, (2, 3), 'linear_ramp', end_values=(5, -4))
+    array([ 5,  3,  1,  2,  3,  4,  5,  2, -1, -4])
+
+    >>> np.pad(a, (2,), 'maximum')
+    array([5, 5, 1, 2, 3, 4, 5, 5, 5])
+
+    >>> np.pad(a, (2,), 'mean')
+    array([3, 3, 1, 2, 3, 4, 5, 3, 3])
+
+    >>> np.pad(a, (2,), 'median')
+    array([3, 3, 1, 2, 3, 4, 5, 3, 3])
+
+    >>> a = [[1, 2], [3, 4]]
+    >>> np.pad(a, ((3, 2), (2, 3)), 'minimum')
+    array([[1, 1, 1, 2, 1, 1, 1],
+           [1, 1, 1, 2, 1, 1, 1],
+           [1, 1, 1, 2, 1, 1, 1],
+           [1, 1, 1, 2, 1, 1, 1],
+           [3, 3, 3, 4, 3, 3, 3],
+           [1, 1, 1, 2, 1, 1, 1],
+           [1, 1, 1, 2, 1, 1, 1]])
+
+    >>> a = [1, 2, 3, 4, 5]
+    >>> np.pad(a, (2, 3), 'reflect')
+    array([3, 2, 1, 2, 3, 4, 5, 4, 3, 2])
+
+    >>> np.pad(a, (2, 3), 'reflect', reflect_type='odd')
+    array([-1,  0,  1,  2,  3,  4,  5,  6,  7,  8])
+
+    >>> np.pad(a, (2, 3), 'symmetric')
+    array([2, 1, 1, 2, 3, 4, 5, 5, 4, 3])
+
+    >>> np.pad(a, (2, 3), 'symmetric', reflect_type='odd')
+    array([0, 1, 1, 2, 3, 4, 5, 5, 6, 7])
+
+    >>> np.pad(a, (2, 3), 'wrap')
+    array([4, 5, 1, 2, 3, 4, 5, 1, 2, 3])
+
+    >>> def pad_with(vector, pad_width, iaxis, kwargs):
+    ...     pad_value = kwargs.get('padder', 10)
+    ...     vector[:pad_width[0]] = pad_value
+    ...     vector[-pad_width[1]:] = pad_value
+    >>> a = np.arange(6)
+    >>> a = a.reshape((2, 3))
+    >>> np.pad(a, 2, pad_with)
+    array([[10, 10, 10, 10, 10, 10, 10],
+           [10, 10, 10, 10, 10, 10, 10],
+           [10, 10,  0,  1,  2, 10, 10],
+           [10, 10,  3,  4,  5, 10, 10],
+           [10, 10, 10, 10, 10, 10, 10],
+           [10, 10, 10, 10, 10, 10, 10]])
+    >>> np.pad(a, 2, pad_with, padder=100)
+    array([[100, 100, 100, 100, 100, 100, 100],
+           [100, 100, 100, 100, 100, 100, 100],
+           [100, 100,   0,   1,   2, 100, 100],
+           [100, 100,   3,   4,   5, 100, 100],
+           [100, 100, 100, 100, 100, 100, 100],
+           [100, 100, 100, 100, 100, 100, 100]])
+    """
+    array = np.asarray(array)
+    pad_width = np.asarray(pad_width)
+
+    if not pad_width.dtype.kind == 'i':
+        raise TypeError('`pad_width` must be of integral type.')
+
+    # Broadcast to shape (array.ndim, 2)
+    pad_width = _as_pairs(pad_width, array.ndim, as_index=True)
+
+    if callable(mode):
+        # Old behavior: Use user-supplied function with np.apply_along_axis
+        function = mode
+        # Create a new zero padded array
+        padded, _ = _pad_simple(array, pad_width, fill_value=0)
+        # And apply along each axis
+
+        for axis in range(padded.ndim):
+            # Iterate using ndindex as in apply_along_axis, but assuming that
+            # function operates inplace on the padded array.
+
+            # view with the iteration axis at the end
+            view = np.moveaxis(padded, axis, -1)
+
+            # compute indices for the iteration axes, and append a trailing
+            # ellipsis to prevent 0d arrays decaying to scalars (gh-8642)
+            inds = ndindex(view.shape[:-1])
+            inds = (ind + (Ellipsis,) for ind in inds)
+            for ind in inds:
+                function(view[ind], pad_width[axis], axis, kwargs)
+
+        return padded
+
+    # Make sure that no unsupported keywords were passed for the current mode
+    allowed_kwargs = {
+        'empty': [], 'edge': [], 'wrap': [],
+        'constant': ['constant_values'],
+        'linear_ramp': ['end_values'],
+        'maximum': ['stat_length'],
+        'mean': ['stat_length'],
+        'median': ['stat_length'],
+        'minimum': ['stat_length'],
+        'reflect': ['reflect_type'],
+        'symmetric': ['reflect_type'],
+    }
+    try:
+        unsupported_kwargs = set(kwargs) - set(allowed_kwargs[mode])
+    except KeyError:
+        raise ValueError("mode '{}' is not supported".format(mode))
+    if unsupported_kwargs:
+        raise ValueError("unsupported keyword arguments for mode '{}': {}"
+                         .format(mode, unsupported_kwargs))
+
+    stat_functions = {"maximum": np.amax, "minimum": np.amin,
+                      "mean": np.mean, "median": np.median}
+
+    # Create array with final shape and original values
+    # (padded area is undefined)
+    padded, original_area_slice = _pad_simple(array, pad_width)
+    # And prepare iteration over all dimensions
+    # (zipping may be more readable than using enumerate)
+    axes = range(padded.ndim)
+
+    if mode == "constant":
+        values = kwargs.get("constant_values", 0)
+        values = _as_pairs(values, padded.ndim)
+        for axis, width_pair, value_pair in zip(axes, pad_width, values):
+            roi = _view_roi(padded, original_area_slice, axis)
+            _set_pad_area(roi, axis, width_pair, value_pair)
+
+    elif mode == "empty":
+        pass  # Do nothing as _pad_simple already returned the correct result
+
+    elif array.size == 0:
+        # Only modes "constant" and "empty" can extend empty axes, all other
+        # modes depend on `array` not being empty
+        # -> ensure every empty axis is only "padded with 0"
+        for axis, width_pair in zip(axes, pad_width):
+            if array.shape[axis] == 0 and any(width_pair):
+                raise ValueError(
+                    "can't extend empty axis {} using modes other than "
+                    "'constant' or 'empty'".format(axis)
+                )
+        # passed, don't need to do anything more as _pad_simple already
+        # returned the correct result
+
+    elif mode == "edge":
+        for axis, width_pair in zip(axes, pad_width):
+            roi = _view_roi(padded, original_area_slice, axis)
+            edge_pair = _get_edges(roi, axis, width_pair)
+            _set_pad_area(roi, axis, width_pair, edge_pair)
+
+    elif mode == "linear_ramp":
+        end_values = kwargs.get("end_values", 0)
+        end_values = _as_pairs(end_values, padded.ndim)
+        for axis, width_pair, value_pair in zip(axes, pad_width, end_values):
+            roi = _view_roi(padded, original_area_slice, axis)
+            ramp_pair = _get_linear_ramps(roi, axis, width_pair, value_pair)
+            _set_pad_area(roi, axis, width_pair, ramp_pair)
+
+    elif mode in stat_functions:
+        func = stat_functions[mode]
+        length = kwargs.get("stat_length", None)
+        length = _as_pairs(length, padded.ndim, as_index=True)
+        for axis, width_pair, length_pair in zip(axes, pad_width, length):
+            roi = _view_roi(padded, original_area_slice, axis)
+            stat_pair = _get_stats(roi, axis, width_pair, length_pair, func)
+            _set_pad_area(roi, axis, width_pair, stat_pair)
+
+    elif mode in {"reflect", "symmetric"}:
+        method = kwargs.get("reflect_type", "even")
+        include_edge = True if mode == "symmetric" else False
+        for axis, (left_index, right_index) in zip(axes, pad_width):
+            if array.shape[axis] == 1 and (left_index > 0 or right_index > 0):
+                # Extending singleton dimension for 'reflect' is legacy
+                # behavior; it really should raise an error.
+                edge_pair = _get_edges(padded, axis, (left_index, right_index))
+                _set_pad_area(
+                    padded, axis, (left_index, right_index), edge_pair)
+                continue
+
+            roi = _view_roi(padded, original_area_slice, axis)
+            while left_index > 0 or right_index > 0:
+                # Iteratively pad until dimension is filled with reflected
+                # values. This is necessary if the pad area is larger than
+                # the length of the original values in the current dimension.
+                left_index, right_index = _set_reflect_both(
+                    roi, axis, (left_index, right_index),
+                    method, include_edge
+                )
+
+    elif mode == "wrap":
+        for axis, (left_index, right_index) in zip(axes, pad_width):
+            roi = _view_roi(padded, original_area_slice, axis)
+            while left_index > 0 or right_index > 0:
+                # Iteratively pad until dimension is filled with wrapped
+                # values. This is necessary if the pad area is larger than
+                # the length of the original values in the current dimension.
+                left_index, right_index = _set_wrap_both(
+                    roi, axis, (left_index, right_index))
+
+    return padded
diff --git a/venv/Lib/site-packages/numpy/lib/arraysetops.py b/venv/Lib/site-packages/numpy/lib/arraysetops.py
new file mode 100644
index 000000000..22687b941
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/arraysetops.py
@@ -0,0 +1,798 @@
+"""
+Set operations for arrays based on sorting.
+
+:Contains:
+  unique,
+  isin,
+  ediff1d,
+  intersect1d,
+  setxor1d,
+  in1d,
+  union1d,
+  setdiff1d
+
+:Notes:
+
+For floating point arrays, inaccurate results may appear due to usual round-off
+and floating point comparison issues.
+
+Speed could be gained in some operations by an implementation of
+sort(), that can provide directly the permutation vectors, avoiding
+thus calls to argsort().
+
+To do: Optionally return indices analogously to unique for all functions.
+
+:Author: Robert Cimrman
+
+"""
+import functools
+
+import numpy as np
+from numpy.core import overrides
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = [
+    'ediff1d', 'intersect1d', 'setxor1d', 'union1d', 'setdiff1d', 'unique',
+    'in1d', 'isin'
+    ]
+
+
+def _ediff1d_dispatcher(ary, to_end=None, to_begin=None):
+    return (ary, to_end, to_begin)
+
+
+@array_function_dispatch(_ediff1d_dispatcher)
+def ediff1d(ary, to_end=None, to_begin=None):
+    """
+    The differences between consecutive elements of an array.
+
+    Parameters
+    ----------
+    ary : array_like
+        If necessary, will be flattened before the differences are taken.
+    to_end : array_like, optional
+        Number(s) to append at the end of the returned differences.
+    to_begin : array_like, optional
+        Number(s) to prepend at the beginning of the returned differences.
+
+    Returns
+    -------
+    ediff1d : ndarray
+        The differences. Loosely, this is ``ary.flat[1:] - ary.flat[:-1]``.
+
+    See Also
+    --------
+    diff, gradient
+
+    Notes
+    -----
+    When applied to masked arrays, this function drops the mask information
+    if the `to_begin` and/or `to_end` parameters are used.
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 4, 7, 0])
+    >>> np.ediff1d(x)
+    array([ 1,  2,  3, -7])
+
+    >>> np.ediff1d(x, to_begin=-99, to_end=np.array([88, 99]))
+    array([-99,   1,   2, ...,  -7,  88,  99])
+
+    The returned array is always 1D.
+
+    >>> y = [[1, 2, 4], [1, 6, 24]]
+    >>> np.ediff1d(y)
+    array([ 1,  2, -3,  5, 18])
+
+    """
+    # force a 1d array
+    ary = np.asanyarray(ary).ravel()
+
+    # enforce that the dtype of `ary` is used for the output
+    dtype_req = ary.dtype
+
+    # fast track default case
+    if to_begin is None and to_end is None:
+        return ary[1:] - ary[:-1]
+
+    if to_begin is None:
+        l_begin = 0
+    else:
+        to_begin = np.asanyarray(to_begin)
+        if not np.can_cast(to_begin, dtype_req, casting="same_kind"):
+            raise TypeError("dtype of `to_end` must be compatible "
+                            "with input `ary` under the `same_kind` rule.")
+
+        to_begin = to_begin.ravel()
+        l_begin = len(to_begin)
+
+    if to_end is None:
+        l_end = 0
+    else:
+        to_end = np.asanyarray(to_end)
+        if not np.can_cast(to_end, dtype_req, casting="same_kind"):
+            raise TypeError("dtype of `to_end` must be compatible "
+                            "with input `ary` under the `same_kind` rule.")
+
+        to_end = to_end.ravel()
+        l_end = len(to_end)
+
+    # do the calculation in place and copy to_begin and to_end
+    l_diff = max(len(ary) - 1, 0)
+    result = np.empty(l_diff + l_begin + l_end, dtype=ary.dtype)
+    result = ary.__array_wrap__(result)
+    if l_begin > 0:
+        result[:l_begin] = to_begin
+    if l_end > 0:
+        result[l_begin + l_diff:] = to_end
+    np.subtract(ary[1:], ary[:-1], result[l_begin:l_begin + l_diff])
+    return result
+
+
+def _unpack_tuple(x):
+    """ Unpacks one-element tuples for use as return values """
+    if len(x) == 1:
+        return x[0]
+    else:
+        return x
+
+
+def _unique_dispatcher(ar, return_index=None, return_inverse=None,
+                       return_counts=None, axis=None):
+    return (ar,)
+
+
+@array_function_dispatch(_unique_dispatcher)
+def unique(ar, return_index=False, return_inverse=False,
+           return_counts=False, axis=None):
+    """
+    Find the unique elements of an array.
+
+    Returns the sorted unique elements of an array. There are three optional
+    outputs in addition to the unique elements:
+
+    * the indices of the input array that give the unique values
+    * the indices of the unique array that reconstruct the input array
+    * the number of times each unique value comes up in the input array
+
+    Parameters
+    ----------
+    ar : array_like
+        Input array. Unless `axis` is specified, this will be flattened if it
+        is not already 1-D.
+    return_index : bool, optional
+        If True, also return the indices of `ar` (along the specified axis,
+        if provided, or in the flattened array) that result in the unique array.
+    return_inverse : bool, optional
+        If True, also return the indices of the unique array (for the specified
+        axis, if provided) that can be used to reconstruct `ar`.
+    return_counts : bool, optional
+        If True, also return the number of times each unique item appears
+        in `ar`.
+
+        .. versionadded:: 1.9.0
+
+    axis : int or None, optional
+        The axis to operate on. If None, `ar` will be flattened. If an integer,
+        the subarrays indexed by the given axis will be flattened and treated
+        as the elements of a 1-D array with the dimension of the given axis,
+        see the notes for more details.  Object arrays or structured arrays
+        that contain objects are not supported if the `axis` kwarg is used. The
+        default is None.
+
+        .. versionadded:: 1.13.0
+
+    Returns
+    -------
+    unique : ndarray
+        The sorted unique values.
+    unique_indices : ndarray, optional
+        The indices of the first occurrences of the unique values in the
+        original array. Only provided if `return_index` is True.
+    unique_inverse : ndarray, optional
+        The indices to reconstruct the original array from the
+        unique array. Only provided if `return_inverse` is True.
+    unique_counts : ndarray, optional
+        The number of times each of the unique values comes up in the
+        original array. Only provided if `return_counts` is True.
+
+        .. versionadded:: 1.9.0
+
+    See Also
+    --------
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Notes
+    -----
+    When an axis is specified the subarrays indexed by the axis are sorted.
+    This is done by making the specified axis the first dimension of the array
+    (move the axis to the first dimension to keep the order of the other axes)
+    and then flattening the subarrays in C order. The flattened subarrays are
+    then viewed as a structured type with each element given a label, with the
+    effect that we end up with a 1-D array of structured types that can be
+    treated in the same way as any other 1-D array. The result is that the
+    flattened subarrays are sorted in lexicographic order starting with the
+    first element.
+
+    Examples
+    --------
+    >>> np.unique([1, 1, 2, 2, 3, 3])
+    array([1, 2, 3])
+    >>> a = np.array([[1, 1], [2, 3]])
+    >>> np.unique(a)
+    array([1, 2, 3])
+
+    Return the unique rows of a 2D array
+
+    >>> a = np.array([[1, 0, 0], [1, 0, 0], [2, 3, 4]])
+    >>> np.unique(a, axis=0)
+    array([[1, 0, 0], [2, 3, 4]])
+
+    Return the indices of the original array that give the unique values:
+
+    >>> a = np.array(['a', 'b', 'b', 'c', 'a'])
+    >>> u, indices = np.unique(a, return_index=True)
+    >>> u
+    array(['a', 'b', 'c'], dtype='<U1')
+    >>> indices
+    array([0, 1, 3])
+    >>> a[indices]
+    array(['a', 'b', 'c'], dtype='<U1')
+
+    Reconstruct the input array from the unique values:
+
+    >>> a = np.array([1, 2, 6, 4, 2, 3, 2])
+    >>> u, indices = np.unique(a, return_inverse=True)
+    >>> u
+    array([1, 2, 3, 4, 6])
+    >>> indices
+    array([0, 1, 4, 3, 1, 2, 1])
+    >>> u[indices]
+    array([1, 2, 6, 4, 2, 3, 2])
+
+    """
+    ar = np.asanyarray(ar)
+    if axis is None:
+        ret = _unique1d(ar, return_index, return_inverse, return_counts)
+        return _unpack_tuple(ret)
+
+    # axis was specified and not None
+    try:
+        ar = np.moveaxis(ar, axis, 0)
+    except np.AxisError:
+        # this removes the "axis1" or "axis2" prefix from the error message
+        raise np.AxisError(axis, ar.ndim)
+
+    # Must reshape to a contiguous 2D array for this to work...
+    orig_shape, orig_dtype = ar.shape, ar.dtype
+    ar = ar.reshape(orig_shape[0], np.prod(orig_shape[1:], dtype=np.intp))
+    ar = np.ascontiguousarray(ar)
+    dtype = [('f{i}'.format(i=i), ar.dtype) for i in range(ar.shape[1])]
+
+    # At this point, `ar` has shape `(n, m)`, and `dtype` is a structured
+    # data type with `m` fields where each field has the data type of `ar`.
+    # In the following, we create the array `consolidated`, which has
+    # shape `(n,)` with data type `dtype`.
+    try:
+        if ar.shape[1] > 0:
+            consolidated = ar.view(dtype)
+        else:
+            # If ar.shape[1] == 0, then dtype will be `np.dtype([])`, which is
+            # a data type with itemsize 0, and the call `ar.view(dtype)` will
+            # fail.  Instead, we'll use `np.empty` to explicitly create the
+            # array with shape `(len(ar),)`.  Because `dtype` in this case has
+            # itemsize 0, the total size of the result is still 0 bytes.
+            consolidated = np.empty(len(ar), dtype=dtype)
+    except TypeError:
+        # There's no good way to do this for object arrays, etc...
+        msg = 'The axis argument to unique is not supported for dtype {dt}'
+        raise TypeError(msg.format(dt=ar.dtype))
+
+    def reshape_uniq(uniq):
+        n = len(uniq)
+        uniq = uniq.view(orig_dtype)
+        uniq = uniq.reshape(n, *orig_shape[1:])
+        uniq = np.moveaxis(uniq, 0, axis)
+        return uniq
+
+    output = _unique1d(consolidated, return_index,
+                       return_inverse, return_counts)
+    output = (reshape_uniq(output[0]),) + output[1:]
+    return _unpack_tuple(output)
+
+
+def _unique1d(ar, return_index=False, return_inverse=False,
+              return_counts=False):
+    """
+    Find the unique elements of an array, ignoring shape.
+    """
+    ar = np.asanyarray(ar).flatten()
+
+    optional_indices = return_index or return_inverse
+
+    if optional_indices:
+        perm = ar.argsort(kind='mergesort' if return_index else 'quicksort')
+        aux = ar[perm]
+    else:
+        ar.sort()
+        aux = ar
+    mask = np.empty(aux.shape, dtype=np.bool_)
+    mask[:1] = True
+    mask[1:] = aux[1:] != aux[:-1]
+
+    ret = (aux[mask],)
+    if return_index:
+        ret += (perm[mask],)
+    if return_inverse:
+        imask = np.cumsum(mask) - 1
+        inv_idx = np.empty(mask.shape, dtype=np.intp)
+        inv_idx[perm] = imask
+        ret += (inv_idx,)
+    if return_counts:
+        idx = np.concatenate(np.nonzero(mask) + ([mask.size],))
+        ret += (np.diff(idx),)
+    return ret
+
+
+def _intersect1d_dispatcher(
+        ar1, ar2, assume_unique=None, return_indices=None):
+    return (ar1, ar2)
+
+
+@array_function_dispatch(_intersect1d_dispatcher)
+def intersect1d(ar1, ar2, assume_unique=False, return_indices=False):
+    """
+    Find the intersection of two arrays.
+
+    Return the sorted, unique values that are in both of the input arrays.
+
+    Parameters
+    ----------
+    ar1, ar2 : array_like
+        Input arrays. Will be flattened if not already 1D.
+    assume_unique : bool
+        If True, the input arrays are both assumed to be unique, which
+        can speed up the calculation.  Default is False.
+    return_indices : bool
+        If True, the indices which correspond to the intersection of the two
+        arrays are returned. The first instance of a value is used if there are
+        multiple. Default is False.
+
+        .. versionadded:: 1.15.0
+
+    Returns
+    -------
+    intersect1d : ndarray
+        Sorted 1D array of common and unique elements.
+    comm1 : ndarray
+        The indices of the first occurrences of the common values in `ar1`.
+        Only provided if `return_indices` is True.
+    comm2 : ndarray
+        The indices of the first occurrences of the common values in `ar2`.
+        Only provided if `return_indices` is True.
+
+
+    See Also
+    --------
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Examples
+    --------
+    >>> np.intersect1d([1, 3, 4, 3], [3, 1, 2, 1])
+    array([1, 3])
+
+    To intersect more than two arrays, use functools.reduce:
+
+    >>> from functools import reduce
+    >>> reduce(np.intersect1d, ([1, 3, 4, 3], [3, 1, 2, 1], [6, 3, 4, 2]))
+    array([3])
+
+    To return the indices of the values common to the input arrays
+    along with the intersected values:
+
+    >>> x = np.array([1, 1, 2, 3, 4])
+    >>> y = np.array([2, 1, 4, 6])
+    >>> xy, x_ind, y_ind = np.intersect1d(x, y, return_indices=True)
+    >>> x_ind, y_ind
+    (array([0, 2, 4]), array([1, 0, 2]))
+    >>> xy, x[x_ind], y[y_ind]
+    (array([1, 2, 4]), array([1, 2, 4]), array([1, 2, 4]))
+
+    """
+    ar1 = np.asanyarray(ar1)
+    ar2 = np.asanyarray(ar2)
+
+    if not assume_unique:
+        if return_indices:
+            ar1, ind1 = unique(ar1, return_index=True)
+            ar2, ind2 = unique(ar2, return_index=True)
+        else:
+            ar1 = unique(ar1)
+            ar2 = unique(ar2)
+    else:
+        ar1 = ar1.ravel()
+        ar2 = ar2.ravel()
+
+    aux = np.concatenate((ar1, ar2))
+    if return_indices:
+        aux_sort_indices = np.argsort(aux, kind='mergesort')
+        aux = aux[aux_sort_indices]
+    else:
+        aux.sort()
+
+    mask = aux[1:] == aux[:-1]
+    int1d = aux[:-1][mask]
+
+    if return_indices:
+        ar1_indices = aux_sort_indices[:-1][mask]
+        ar2_indices = aux_sort_indices[1:][mask] - ar1.size
+        if not assume_unique:
+            ar1_indices = ind1[ar1_indices]
+            ar2_indices = ind2[ar2_indices]
+
+        return int1d, ar1_indices, ar2_indices
+    else:
+        return int1d
+
+
+def _setxor1d_dispatcher(ar1, ar2, assume_unique=None):
+    return (ar1, ar2)
+
+
+@array_function_dispatch(_setxor1d_dispatcher)
+def setxor1d(ar1, ar2, assume_unique=False):
+    """
+    Find the set exclusive-or of two arrays.
+
+    Return the sorted, unique values that are in only one (not both) of the
+    input arrays.
+
+    Parameters
+    ----------
+    ar1, ar2 : array_like
+        Input arrays.
+    assume_unique : bool
+        If True, the input arrays are both assumed to be unique, which
+        can speed up the calculation.  Default is False.
+
+    Returns
+    -------
+    setxor1d : ndarray
+        Sorted 1D array of unique values that are in only one of the input
+        arrays.
+
+    Examples
+    --------
+    >>> a = np.array([1, 2, 3, 2, 4])
+    >>> b = np.array([2, 3, 5, 7, 5])
+    >>> np.setxor1d(a,b)
+    array([1, 4, 5, 7])
+
+    """
+    if not assume_unique:
+        ar1 = unique(ar1)
+        ar2 = unique(ar2)
+
+    aux = np.concatenate((ar1, ar2))
+    if aux.size == 0:
+        return aux
+
+    aux.sort()
+    flag = np.concatenate(([True], aux[1:] != aux[:-1], [True]))
+    return aux[flag[1:] & flag[:-1]]
+
+
+def _in1d_dispatcher(ar1, ar2, assume_unique=None, invert=None):
+    return (ar1, ar2)
+
+
+@array_function_dispatch(_in1d_dispatcher)
+def in1d(ar1, ar2, assume_unique=False, invert=False):
+    """
+    Test whether each element of a 1-D array is also present in a second array.
+
+    Returns a boolean array the same length as `ar1` that is True
+    where an element of `ar1` is in `ar2` and False otherwise.
+
+    We recommend using :func:`isin` instead of `in1d` for new code.
+
+    Parameters
+    ----------
+    ar1 : (M,) array_like
+        Input array.
+    ar2 : array_like
+        The values against which to test each value of `ar1`.
+    assume_unique : bool, optional
+        If True, the input arrays are both assumed to be unique, which
+        can speed up the calculation.  Default is False.
+    invert : bool, optional
+        If True, the values in the returned array are inverted (that is,
+        False where an element of `ar1` is in `ar2` and True otherwise).
+        Default is False. ``np.in1d(a, b, invert=True)`` is equivalent
+        to (but is faster than) ``np.invert(in1d(a, b))``.
+
+        .. versionadded:: 1.8.0
+
+    Returns
+    -------
+    in1d : (M,) ndarray, bool
+        The values `ar1[in1d]` are in `ar2`.
+
+    See Also
+    --------
+    isin                  : Version of this function that preserves the
+                            shape of ar1.
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Notes
+    -----
+    `in1d` can be considered as an element-wise function version of the
+    python keyword `in`, for 1-D sequences. ``in1d(a, b)`` is roughly
+    equivalent to ``np.array([item in b for item in a])``.
+    However, this idea fails if `ar2` is a set, or similar (non-sequence)
+    container:  As ``ar2`` is converted to an array, in those cases
+    ``asarray(ar2)`` is an object array rather than the expected array of
+    contained values.
+
+    .. versionadded:: 1.4.0
+
+    Examples
+    --------
+    >>> test = np.array([0, 1, 2, 5, 0])
+    >>> states = [0, 2]
+    >>> mask = np.in1d(test, states)
+    >>> mask
+    array([ True, False,  True, False,  True])
+    >>> test[mask]
+    array([0, 2, 0])
+    >>> mask = np.in1d(test, states, invert=True)
+    >>> mask
+    array([False,  True, False,  True, False])
+    >>> test[mask]
+    array([1, 5])
+    """
+    # Ravel both arrays, behavior for the first array could be different
+    ar1 = np.asarray(ar1).ravel()
+    ar2 = np.asarray(ar2).ravel()
+
+    # Check if one of the arrays may contain arbitrary objects
+    contains_object = ar1.dtype.hasobject or ar2.dtype.hasobject
+
+    # This code is run when
+    # a) the first condition is true, making the code significantly faster
+    # b) the second condition is true (i.e. `ar1` or `ar2` may contain
+    #    arbitrary objects), since then sorting is not guaranteed to work
+    if len(ar2) < 10 * len(ar1) ** 0.145 or contains_object:
+        if invert:
+            mask = np.ones(len(ar1), dtype=bool)
+            for a in ar2:
+                mask &= (ar1 != a)
+        else:
+            mask = np.zeros(len(ar1), dtype=bool)
+            for a in ar2:
+                mask |= (ar1 == a)
+        return mask
+
+    # Otherwise use sorting
+    if not assume_unique:
+        ar1, rev_idx = np.unique(ar1, return_inverse=True)
+        ar2 = np.unique(ar2)
+
+    ar = np.concatenate((ar1, ar2))
+    # We need this to be a stable sort, so always use 'mergesort'
+    # here. The values from the first array should always come before
+    # the values from the second array.
+    order = ar.argsort(kind='mergesort')
+    sar = ar[order]
+    if invert:
+        bool_ar = (sar[1:] != sar[:-1])
+    else:
+        bool_ar = (sar[1:] == sar[:-1])
+    flag = np.concatenate((bool_ar, [invert]))
+    ret = np.empty(ar.shape, dtype=bool)
+    ret[order] = flag
+
+    if assume_unique:
+        return ret[:len(ar1)]
+    else:
+        return ret[rev_idx]
+
+
+def _isin_dispatcher(element, test_elements, assume_unique=None, invert=None):
+    return (element, test_elements)
+
+
+@array_function_dispatch(_isin_dispatcher)
+def isin(element, test_elements, assume_unique=False, invert=False):
+    """
+    Calculates `element in test_elements`, broadcasting over `element` only.
+    Returns a boolean array of the same shape as `element` that is True
+    where an element of `element` is in `test_elements` and False otherwise.
+
+    Parameters
+    ----------
+    element : array_like
+        Input array.
+    test_elements : array_like
+        The values against which to test each value of `element`.
+        This argument is flattened if it is an array or array_like.
+        See notes for behavior with non-array-like parameters.
+    assume_unique : bool, optional
+        If True, the input arrays are both assumed to be unique, which
+        can speed up the calculation.  Default is False.
+    invert : bool, optional
+        If True, the values in the returned array are inverted, as if
+        calculating `element not in test_elements`. Default is False.
+        ``np.isin(a, b, invert=True)`` is equivalent to (but faster
+        than) ``np.invert(np.isin(a, b))``.
+
+    Returns
+    -------
+    isin : ndarray, bool
+        Has the same shape as `element`. The values `element[isin]`
+        are in `test_elements`.
+
+    See Also
+    --------
+    in1d                  : Flattened version of this function.
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Notes
+    -----
+
+    `isin` is an element-wise function version of the python keyword `in`.
+    ``isin(a, b)`` is roughly equivalent to
+    ``np.array([item in b for item in a])`` if `a` and `b` are 1-D sequences.
+
+    `element` and `test_elements` are converted to arrays if they are not
+    already. If `test_elements` is a set (or other non-sequence collection)
+    it will be converted to an object array with one element, rather than an
+    array of the values contained in `test_elements`. This is a consequence
+    of the `array` constructor's way of handling non-sequence collections.
+    Converting the set to a list usually gives the desired behavior.
+
+    .. versionadded:: 1.13.0
+
+    Examples
+    --------
+    >>> element = 2*np.arange(4).reshape((2, 2))
+    >>> element
+    array([[0, 2],
+           [4, 6]])
+    >>> test_elements = [1, 2, 4, 8]
+    >>> mask = np.isin(element, test_elements)
+    >>> mask
+    array([[False,  True],
+           [ True, False]])
+    >>> element[mask]
+    array([2, 4])
+
+    The indices of the matched values can be obtained with `nonzero`:
+
+    >>> np.nonzero(mask)
+    (array([0, 1]), array([1, 0]))
+
+    The test can also be inverted:
+
+    >>> mask = np.isin(element, test_elements, invert=True)
+    >>> mask
+    array([[ True, False],
+           [False,  True]])
+    >>> element[mask]
+    array([0, 6])
+
+    Because of how `array` handles sets, the following does not
+    work as expected:
+
+    >>> test_set = {1, 2, 4, 8}
+    >>> np.isin(element, test_set)
+    array([[False, False],
+           [False, False]])
+
+    Casting the set to a list gives the expected result:
+
+    >>> np.isin(element, list(test_set))
+    array([[False,  True],
+           [ True, False]])
+    """
+    element = np.asarray(element)
+    return in1d(element, test_elements, assume_unique=assume_unique,
+                invert=invert).reshape(element.shape)
+
+
+def _union1d_dispatcher(ar1, ar2):
+    return (ar1, ar2)
+
+
+@array_function_dispatch(_union1d_dispatcher)
+def union1d(ar1, ar2):
+    """
+    Find the union of two arrays.
+
+    Return the unique, sorted array of values that are in either of the two
+    input arrays.
+
+    Parameters
+    ----------
+    ar1, ar2 : array_like
+        Input arrays. They are flattened if they are not already 1D.
+
+    Returns
+    -------
+    union1d : ndarray
+        Unique, sorted union of the input arrays.
+
+    See Also
+    --------
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Examples
+    --------
+    >>> np.union1d([-1, 0, 1], [-2, 0, 2])
+    array([-2, -1,  0,  1,  2])
+
+    To find the union of more than two arrays, use functools.reduce:
+
+    >>> from functools import reduce
+    >>> reduce(np.union1d, ([1, 3, 4, 3], [3, 1, 2, 1], [6, 3, 4, 2]))
+    array([1, 2, 3, 4, 6])
+    """
+    return unique(np.concatenate((ar1, ar2), axis=None))
+
+
+def _setdiff1d_dispatcher(ar1, ar2, assume_unique=None):
+    return (ar1, ar2)
+
+
+@array_function_dispatch(_setdiff1d_dispatcher)
+def setdiff1d(ar1, ar2, assume_unique=False):
+    """
+    Find the set difference of two arrays.
+
+    Return the unique values in `ar1` that are not in `ar2`.
+
+    Parameters
+    ----------
+    ar1 : array_like
+        Input array.
+    ar2 : array_like
+        Input comparison array.
+    assume_unique : bool
+        If True, the input arrays are both assumed to be unique, which
+        can speed up the calculation.  Default is False.
+
+    Returns
+    -------
+    setdiff1d : ndarray
+        1D array of values in `ar1` that are not in `ar2`. The result
+        is sorted when `assume_unique=False`, but otherwise only sorted
+        if the input is sorted.
+
+    See Also
+    --------
+    numpy.lib.arraysetops : Module with a number of other functions for
+                            performing set operations on arrays.
+
+    Examples
+    --------
+    >>> a = np.array([1, 2, 3, 2, 4, 1])
+    >>> b = np.array([3, 4, 5, 6])
+    >>> np.setdiff1d(a, b)
+    array([1, 2])
+
+    """
+    if assume_unique:
+        ar1 = np.asarray(ar1).ravel()
+    else:
+        ar1 = unique(ar1)
+        ar2 = unique(ar2)
+    return ar1[in1d(ar1, ar2, assume_unique=True, invert=True)]
diff --git a/venv/Lib/site-packages/numpy/lib/arrayterator.py b/venv/Lib/site-packages/numpy/lib/arrayterator.py
new file mode 100644
index 000000000..b9ea21f8e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/arrayterator.py
@@ -0,0 +1,219 @@
+"""
+A buffered iterator for big arrays.
+
+This module solves the problem of iterating over a big file-based array
+without having to read it into memory. The `Arrayterator` class wraps
+an array object, and when iterated it will return sub-arrays with at most
+a user-specified number of elements.
+
+"""
+from operator import mul
+from functools import reduce
+
+__all__ = ['Arrayterator']
+
+
+class Arrayterator:
+    """
+    Buffered iterator for big arrays.
+
+    `Arrayterator` creates a buffered iterator for reading big arrays in small
+    contiguous blocks. The class is useful for objects stored in the
+    file system. It allows iteration over the object *without* reading
+    everything in memory; instead, small blocks are read and iterated over.
+
+    `Arrayterator` can be used with any object that supports multidimensional
+    slices. This includes NumPy arrays, but also variables from
+    Scientific.IO.NetCDF or pynetcdf for example.
+
+    Parameters
+    ----------
+    var : array_like
+        The object to iterate over.
+    buf_size : int, optional
+        The buffer size. If `buf_size` is supplied, the maximum amount of
+        data that will be read into memory is `buf_size` elements.
+        Default is None, which will read as many element as possible
+        into memory.
+
+    Attributes
+    ----------
+    var
+    buf_size
+    start
+    stop
+    step
+    shape
+    flat
+
+    See Also
+    --------
+    ndenumerate : Multidimensional array iterator.
+    flatiter : Flat array iterator.
+    memmap : Create a memory-map to an array stored in a binary file on disk.
+
+    Notes
+    -----
+    The algorithm works by first finding a "running dimension", along which
+    the blocks will be extracted. Given an array of dimensions
+    ``(d1, d2, ..., dn)``, e.g. if `buf_size` is smaller than ``d1``, the
+    first dimension will be used. If, on the other hand,
+    ``d1 < buf_size < d1*d2`` the second dimension will be used, and so on.
+    Blocks are extracted along this dimension, and when the last block is
+    returned the process continues from the next dimension, until all
+    elements have been read.
+
+    Examples
+    --------
+    >>> a = np.arange(3 * 4 * 5 * 6).reshape(3, 4, 5, 6)
+    >>> a_itor = np.lib.Arrayterator(a, 2)
+    >>> a_itor.shape
+    (3, 4, 5, 6)
+
+    Now we can iterate over ``a_itor``, and it will return arrays of size
+    two. Since `buf_size` was smaller than any dimension, the first
+    dimension will be iterated over first:
+
+    >>> for subarr in a_itor:
+    ...     if not subarr.all():
+    ...         print(subarr, subarr.shape) # doctest: +SKIP
+    >>> # [[[[0 1]]]] (1, 1, 1, 2)
+
+    """
+
+    def __init__(self, var, buf_size=None):
+        self.var = var
+        self.buf_size = buf_size
+
+        self.start = [0 for dim in var.shape]
+        self.stop = [dim for dim in var.shape]
+        self.step = [1 for dim in var.shape]
+
+    def __getattr__(self, attr):
+        return getattr(self.var, attr)
+
+    def __getitem__(self, index):
+        """
+        Return a new arrayterator.
+
+        """
+        # Fix index, handling ellipsis and incomplete slices.
+        if not isinstance(index, tuple):
+            index = (index,)
+        fixed = []
+        length, dims = len(index), self.ndim
+        for slice_ in index:
+            if slice_ is Ellipsis:
+                fixed.extend([slice(None)] * (dims-length+1))
+                length = len(fixed)
+            elif isinstance(slice_, int):
+                fixed.append(slice(slice_, slice_+1, 1))
+            else:
+                fixed.append(slice_)
+        index = tuple(fixed)
+        if len(index) < dims:
+            index += (slice(None),) * (dims-len(index))
+
+        # Return a new arrayterator object.
+        out = self.__class__(self.var, self.buf_size)
+        for i, (start, stop, step, slice_) in enumerate(
+                zip(self.start, self.stop, self.step, index)):
+            out.start[i] = start + (slice_.start or 0)
+            out.step[i] = step * (slice_.step or 1)
+            out.stop[i] = start + (slice_.stop or stop-start)
+            out.stop[i] = min(stop, out.stop[i])
+        return out
+
+    def __array__(self):
+        """
+        Return corresponding data.
+
+        """
+        slice_ = tuple(slice(*t) for t in zip(
+                self.start, self.stop, self.step))
+        return self.var[slice_]
+
+    @property
+    def flat(self):
+        """
+        A 1-D flat iterator for Arrayterator objects.
+
+        This iterator returns elements of the array to be iterated over in
+        `Arrayterator` one by one. It is similar to `flatiter`.
+
+        See Also
+        --------
+        Arrayterator
+        flatiter
+
+        Examples
+        --------
+        >>> a = np.arange(3 * 4 * 5 * 6).reshape(3, 4, 5, 6)
+        >>> a_itor = np.lib.Arrayterator(a, 2)
+
+        >>> for subarr in a_itor.flat:
+        ...     if not subarr:
+        ...         print(subarr, type(subarr))
+        ...
+        0 <class 'numpy.int64'>
+
+        """
+        for block in self:
+            yield from block.flat
+
+    @property
+    def shape(self):
+        """
+        The shape of the array to be iterated over.
+
+        For an example, see `Arrayterator`.
+
+        """
+        return tuple(((stop-start-1)//step+1) for start, stop, step in
+                zip(self.start, self.stop, self.step))
+
+    def __iter__(self):
+        # Skip arrays with degenerate dimensions
+        if [dim for dim in self.shape if dim <= 0]:
+            return
+
+        start = self.start[:]
+        stop = self.stop[:]
+        step = self.step[:]
+        ndims = self.var.ndim
+
+        while True:
+            count = self.buf_size or reduce(mul, self.shape)
+
+            # iterate over each dimension, looking for the
+            # running dimension (ie, the dimension along which
+            # the blocks will be built from)
+            rundim = 0
+            for i in range(ndims-1, -1, -1):
+                # if count is zero we ran out of elements to read
+                # along higher dimensions, so we read only a single position
+                if count == 0:
+                    stop[i] = start[i]+1
+                elif count <= self.shape[i]:
+                    # limit along this dimension
+                    stop[i] = start[i] + count*step[i]
+                    rundim = i
+                else:
+                    # read everything along this dimension
+                    stop[i] = self.stop[i]
+                stop[i] = min(self.stop[i], stop[i])
+                count = count//self.shape[i]
+
+            # yield a block
+            slice_ = tuple(slice(*t) for t in zip(start, stop, step))
+            yield self.var[slice_]
+
+            # Update start position, taking care of overflow to
+            # other dimensions
+            start[rundim] = stop[rundim]  # start where we stopped
+            for i in range(ndims-1, 0, -1):
+                if start[i] >= self.stop[i]:
+                    start[i] = self.start[i]
+                    start[i-1] += self.step[i-1]
+            if start[0] >= self.stop[0]:
+                return
diff --git a/venv/Lib/site-packages/numpy/lib/financial.py b/venv/Lib/site-packages/numpy/lib/financial.py
new file mode 100644
index 000000000..709a79dc0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/financial.py
@@ -0,0 +1,967 @@
+"""Some simple financial calculations
+
+patterned after spreadsheet computations.
+
+There is some complexity in each function
+so that the functions behave like ufuncs with
+broadcasting and being able to be called with scalars
+or arrays (or other sequences).
+
+Functions support the :class:`decimal.Decimal` type unless
+otherwise stated.
+"""
+import warnings
+from decimal import Decimal
+import functools
+
+import numpy as np
+from numpy.core import overrides
+
+
+_depmsg = ("numpy.{name} is deprecated and will be removed from NumPy 1.20. "
+           "Use numpy_financial.{name} instead "
+           "(https://pypi.org/project/numpy-financial/).")
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = ['fv', 'pmt', 'nper', 'ipmt', 'ppmt', 'pv', 'rate',
+           'irr', 'npv', 'mirr']
+
+_when_to_num = {'end':0, 'begin':1,
+                'e':0, 'b':1,
+                0:0, 1:1,
+                'beginning':1,
+                'start':1,
+                'finish':0}
+
+def _convert_when(when):
+    #Test to see if when has already been converted to ndarray
+    #This will happen if one function calls another, for example ppmt
+    if isinstance(when, np.ndarray):
+        return when
+    try:
+        return _when_to_num[when]
+    except (KeyError, TypeError):
+        return [_when_to_num[x] for x in when]
+
+
+def _fv_dispatcher(rate, nper, pmt, pv, when=None):
+    warnings.warn(_depmsg.format(name='fv'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, nper, pmt, pv)
+
+
+@array_function_dispatch(_fv_dispatcher)
+def fv(rate, nper, pmt, pv, when='end'):
+    """
+    Compute the future value.
+
+    .. deprecated:: 1.18
+
+       `fv` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Given:
+     * a present value, `pv`
+     * an interest `rate` compounded once per period, of which
+       there are
+     * `nper` total
+     * a (fixed) payment, `pmt`, paid either
+     * at the beginning (`when` = {'begin', 1}) or the end
+       (`when` = {'end', 0}) of each period
+
+    Return:
+       the value at the end of the `nper` periods
+
+    Parameters
+    ----------
+    rate : scalar or array_like of shape(M, )
+        Rate of interest as decimal (not per cent) per period
+    nper : scalar or array_like of shape(M, )
+        Number of compounding periods
+    pmt : scalar or array_like of shape(M, )
+        Payment
+    pv : scalar or array_like of shape(M, )
+        Present value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}, optional
+        When payments are due ('begin' (1) or 'end' (0)).
+        Defaults to {'end', 0}.
+
+    Returns
+    -------
+    out : ndarray
+        Future values.  If all input is scalar, returns a scalar float.  If
+        any input is array_like, returns future values for each input element.
+        If multiple inputs are array_like, they all must have the same shape.
+
+    Notes
+    -----
+    The future value is computed by solving the equation::
+
+     fv +
+     pv*(1+rate)**nper +
+     pmt*(1 + rate*when)/rate*((1 + rate)**nper - 1) == 0
+
+    or, when ``rate == 0``::
+
+     fv + pv + pmt * nper == 0
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] Wheeler, D. A., E. Rathke, and R. Weir (Eds.) (2009, May).
+       Open Document Format for Office Applications (OpenDocument)v1.2,
+       Part 2: Recalculated Formula (OpenFormula) Format - Annotated Version,
+       Pre-Draft 12. Organization for the Advancement of Structured Information
+       Standards (OASIS). Billerica, MA, USA. [ODT Document].
+       Available:
+       http://www.oasis-open.org/committees/documents.php?wg_abbrev=office-formula
+       OpenDocument-formula-20090508.odt
+
+
+    Examples
+    --------
+    What is the future value after 10 years of saving $100 now, with
+    an additional monthly savings of $100.  Assume the interest rate is
+    5% (annually) compounded monthly?
+
+    >>> np.fv(0.05/12, 10*12, -100, -100)
+    15692.928894335748
+
+    By convention, the negative sign represents cash flow out (i.e. money not
+    available today).  Thus, saving $100 a month at 5% annual interest leads
+    to $15,692.93 available to spend in 10 years.
+
+    If any input is array_like, returns an array of equal shape.  Let's
+    compare different interest rates from the example above.
+
+    >>> a = np.array((0.05, 0.06, 0.07))/12
+    >>> np.fv(a, 10*12, -100, -100)
+    array([ 15692.92889434,  16569.87435405,  17509.44688102]) # may vary
+
+    """
+    when = _convert_when(when)
+    (rate, nper, pmt, pv, when) = map(np.asarray, [rate, nper, pmt, pv, when])
+    temp = (1+rate)**nper
+    fact = np.where(rate == 0, nper,
+                    (1 + rate*when)*(temp - 1)/rate)
+    return -(pv*temp + pmt*fact)
+
+
+def _pmt_dispatcher(rate, nper, pv, fv=None, when=None):
+    warnings.warn(_depmsg.format(name='pmt'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, nper, pv, fv)
+
+
+@array_function_dispatch(_pmt_dispatcher)
+def pmt(rate, nper, pv, fv=0, when='end'):
+    """
+    Compute the payment against loan principal plus interest.
+
+    .. deprecated:: 1.18
+
+       `pmt` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Given:
+     * a present value, `pv` (e.g., an amount borrowed)
+     * a future value, `fv` (e.g., 0)
+     * an interest `rate` compounded once per period, of which
+       there are
+     * `nper` total
+     * and (optional) specification of whether payment is made
+       at the beginning (`when` = {'begin', 1}) or the end
+       (`when` = {'end', 0}) of each period
+
+    Return:
+       the (fixed) periodic payment.
+
+    Parameters
+    ----------
+    rate : array_like
+        Rate of interest (per period)
+    nper : array_like
+        Number of compounding periods
+    pv : array_like
+        Present value
+    fv : array_like,  optional
+        Future value (default = 0)
+    when : {{'begin', 1}, {'end', 0}}, {string, int}
+        When payments are due ('begin' (1) or 'end' (0))
+
+    Returns
+    -------
+    out : ndarray
+        Payment against loan plus interest.  If all input is scalar, returns a
+        scalar float.  If any input is array_like, returns payment for each
+        input element. If multiple inputs are array_like, they all must have
+        the same shape.
+
+    Notes
+    -----
+    The payment is computed by solving the equation::
+
+     fv +
+     pv*(1 + rate)**nper +
+     pmt*(1 + rate*when)/rate*((1 + rate)**nper - 1) == 0
+
+    or, when ``rate == 0``::
+
+      fv + pv + pmt * nper == 0
+
+    for ``pmt``.
+
+    Note that computing a monthly mortgage payment is only
+    one use for this function.  For example, pmt returns the
+    periodic deposit one must make to achieve a specified
+    future balance given an initial deposit, a fixed,
+    periodically compounded interest rate, and the total
+    number of periods.
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] Wheeler, D. A., E. Rathke, and R. Weir (Eds.) (2009, May).
+       Open Document Format for Office Applications (OpenDocument)v1.2,
+       Part 2: Recalculated Formula (OpenFormula) Format - Annotated Version,
+       Pre-Draft 12. Organization for the Advancement of Structured Information
+       Standards (OASIS). Billerica, MA, USA. [ODT Document].
+       Available:
+       http://www.oasis-open.org/committees/documents.php
+       ?wg_abbrev=office-formulaOpenDocument-formula-20090508.odt
+
+    Examples
+    --------
+    What is the monthly payment needed to pay off a $200,000 loan in 15
+    years at an annual interest rate of 7.5%?
+
+    >>> np.pmt(0.075/12, 12*15, 200000)
+    -1854.0247200054619
+
+    In order to pay-off (i.e., have a future-value of 0) the $200,000 obtained
+    today, a monthly payment of $1,854.02 would be required.  Note that this
+    example illustrates usage of `fv` having a default value of 0.
+
+    """
+    when = _convert_when(when)
+    (rate, nper, pv, fv, when) = map(np.array, [rate, nper, pv, fv, when])
+    temp = (1 + rate)**nper
+    mask = (rate == 0)
+    masked_rate = np.where(mask, 1, rate)
+    fact = np.where(mask != 0, nper,
+                    (1 + masked_rate*when)*(temp - 1)/masked_rate)
+    return -(fv + pv*temp) / fact
+
+
+def _nper_dispatcher(rate, pmt, pv, fv=None, when=None):
+    warnings.warn(_depmsg.format(name='nper'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, pmt, pv, fv)
+
+
+@array_function_dispatch(_nper_dispatcher)
+def nper(rate, pmt, pv, fv=0, when='end'):
+    """
+    Compute the number of periodic payments.
+
+    .. deprecated:: 1.18
+
+       `nper` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    :class:`decimal.Decimal` type is not supported.
+
+    Parameters
+    ----------
+    rate : array_like
+        Rate of interest (per period)
+    pmt : array_like
+        Payment
+    pv : array_like
+        Present value
+    fv : array_like, optional
+        Future value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}, optional
+        When payments are due ('begin' (1) or 'end' (0))
+
+    Notes
+    -----
+    The number of periods ``nper`` is computed by solving the equation::
+
+     fv + pv*(1+rate)**nper + pmt*(1+rate*when)/rate*((1+rate)**nper-1) = 0
+
+    but if ``rate = 0`` then::
+
+     fv + pv + pmt*nper = 0
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+
+    Examples
+    --------
+    If you only had $150/month to pay towards the loan, how long would it take
+    to pay-off a loan of $8,000 at 7% annual interest?
+
+    >>> print(np.round(np.nper(0.07/12, -150, 8000), 5))
+    64.07335
+
+    So, over 64 months would be required to pay off the loan.
+
+    The same analysis could be done with several different interest rates
+    and/or payments and/or total amounts to produce an entire table.
+
+    >>> np.nper(*(np.ogrid[0.07/12: 0.08/12: 0.01/12,
+    ...                    -150   : -99     : 50    ,
+    ...                    8000   : 9001    : 1000]))
+    array([[[ 64.07334877,  74.06368256],
+            [108.07548412, 127.99022654]],
+           [[ 66.12443902,  76.87897353],
+            [114.70165583, 137.90124779]]])
+
+    """
+    when = _convert_when(when)
+    (rate, pmt, pv, fv, when) = map(np.asarray, [rate, pmt, pv, fv, when])
+
+    use_zero_rate = False
+    with np.errstate(divide="raise"):
+        try:
+            z = pmt*(1+rate*when)/rate
+        except FloatingPointError:
+            use_zero_rate = True
+
+    if use_zero_rate:
+        return (-fv + pv) / pmt
+    else:
+        A = -(fv + pv)/(pmt+0)
+        B = np.log((-fv+z) / (pv+z))/np.log(1+rate)
+        return np.where(rate == 0, A, B)
+
+
+def _ipmt_dispatcher(rate, per, nper, pv, fv=None, when=None):
+    warnings.warn(_depmsg.format(name='ipmt'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, per, nper, pv, fv)
+
+
+@array_function_dispatch(_ipmt_dispatcher)
+def ipmt(rate, per, nper, pv, fv=0, when='end'):
+    """
+    Compute the interest portion of a payment.
+
+    .. deprecated:: 1.18
+
+       `ipmt` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Parameters
+    ----------
+    rate : scalar or array_like of shape(M, )
+        Rate of interest as decimal (not per cent) per period
+    per : scalar or array_like of shape(M, )
+        Interest paid against the loan changes during the life or the loan.
+        The `per` is the payment period to calculate the interest amount.
+    nper : scalar or array_like of shape(M, )
+        Number of compounding periods
+    pv : scalar or array_like of shape(M, )
+        Present value
+    fv : scalar or array_like of shape(M, ), optional
+        Future value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}, optional
+        When payments are due ('begin' (1) or 'end' (0)).
+        Defaults to {'end', 0}.
+
+    Returns
+    -------
+    out : ndarray
+        Interest portion of payment.  If all input is scalar, returns a scalar
+        float.  If any input is array_like, returns interest payment for each
+        input element. If multiple inputs are array_like, they all must have
+        the same shape.
+
+    See Also
+    --------
+    ppmt, pmt, pv
+
+    Notes
+    -----
+    The total payment is made up of payment against principal plus interest.
+
+    ``pmt = ppmt + ipmt``
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+
+    Examples
+    --------
+    What is the amortization schedule for a 1 year loan of $2500 at
+    8.24% interest per year compounded monthly?
+
+    >>> principal = 2500.00
+
+    The 'per' variable represents the periods of the loan.  Remember that
+    financial equations start the period count at 1!
+
+    >>> per = np.arange(1*12) + 1
+    >>> ipmt = np.ipmt(0.0824/12, per, 1*12, principal)
+    >>> ppmt = np.ppmt(0.0824/12, per, 1*12, principal)
+
+    Each element of the sum of the 'ipmt' and 'ppmt' arrays should equal
+    'pmt'.
+
+    >>> pmt = np.pmt(0.0824/12, 1*12, principal)
+    >>> np.allclose(ipmt + ppmt, pmt)
+    True
+
+    >>> fmt = '{0:2d} {1:8.2f} {2:8.2f} {3:8.2f}'
+    >>> for payment in per:
+    ...     index = payment - 1
+    ...     principal = principal + ppmt[index]
+    ...     print(fmt.format(payment, ppmt[index], ipmt[index], principal))
+     1  -200.58   -17.17  2299.42
+     2  -201.96   -15.79  2097.46
+     3  -203.35   -14.40  1894.11
+     4  -204.74   -13.01  1689.37
+     5  -206.15   -11.60  1483.22
+     6  -207.56   -10.18  1275.66
+     7  -208.99    -8.76  1066.67
+     8  -210.42    -7.32   856.25
+     9  -211.87    -5.88   644.38
+    10  -213.32    -4.42   431.05
+    11  -214.79    -2.96   216.26
+    12  -216.26    -1.49    -0.00
+
+    >>> interestpd = np.sum(ipmt)
+    >>> np.round(interestpd, 2)
+    -112.98
+
+    """
+    when = _convert_when(when)
+    rate, per, nper, pv, fv, when = np.broadcast_arrays(rate, per, nper,
+                                                        pv, fv, when)
+    total_pmt = pmt(rate, nper, pv, fv, when)
+    ipmt = _rbl(rate, per, total_pmt, pv, when)*rate
+    try:
+        ipmt = np.where(when == 1, ipmt/(1 + rate), ipmt)
+        ipmt = np.where(np.logical_and(when == 1, per == 1), 0, ipmt)
+    except IndexError:
+        pass
+    return ipmt
+
+
+def _rbl(rate, per, pmt, pv, when):
+    """
+    This function is here to simply have a different name for the 'fv'
+    function to not interfere with the 'fv' keyword argument within the 'ipmt'
+    function.  It is the 'remaining balance on loan' which might be useful as
+    its own function, but is easily calculated with the 'fv' function.
+    """
+    return fv(rate, (per - 1), pmt, pv, when)
+
+
+def _ppmt_dispatcher(rate, per, nper, pv, fv=None, when=None):
+    warnings.warn(_depmsg.format(name='ppmt'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, per, nper, pv, fv)
+
+
+@array_function_dispatch(_ppmt_dispatcher)
+def ppmt(rate, per, nper, pv, fv=0, when='end'):
+    """
+    Compute the payment against loan principal.
+
+    .. deprecated:: 1.18
+
+       `ppmt` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Parameters
+    ----------
+    rate : array_like
+        Rate of interest (per period)
+    per : array_like, int
+        Amount paid against the loan changes.  The `per` is the period of
+        interest.
+    nper : array_like
+        Number of compounding periods
+    pv : array_like
+        Present value
+    fv : array_like, optional
+        Future value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}
+        When payments are due ('begin' (1) or 'end' (0))
+
+    See Also
+    --------
+    pmt, pv, ipmt
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+
+    """
+    total = pmt(rate, nper, pv, fv, when)
+    return total - ipmt(rate, per, nper, pv, fv, when)
+
+
+def _pv_dispatcher(rate, nper, pmt, fv=None, when=None):
+    warnings.warn(_depmsg.format(name='pv'),
+                  DeprecationWarning, stacklevel=3)
+    return (rate, nper, nper, pv, fv)
+
+
+@array_function_dispatch(_pv_dispatcher)
+def pv(rate, nper, pmt, fv=0, when='end'):
+    """
+    Compute the present value.
+
+    .. deprecated:: 1.18
+
+       `pv` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Given:
+     * a future value, `fv`
+     * an interest `rate` compounded once per period, of which
+       there are
+     * `nper` total
+     * a (fixed) payment, `pmt`, paid either
+     * at the beginning (`when` = {'begin', 1}) or the end
+       (`when` = {'end', 0}) of each period
+
+    Return:
+       the value now
+
+    Parameters
+    ----------
+    rate : array_like
+        Rate of interest (per period)
+    nper : array_like
+        Number of compounding periods
+    pmt : array_like
+        Payment
+    fv : array_like, optional
+        Future value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}, optional
+        When payments are due ('begin' (1) or 'end' (0))
+
+    Returns
+    -------
+    out : ndarray, float
+        Present value of a series of payments or investments.
+
+    Notes
+    -----
+    The present value is computed by solving the equation::
+
+     fv +
+     pv*(1 + rate)**nper +
+     pmt*(1 + rate*when)/rate*((1 + rate)**nper - 1) = 0
+
+    or, when ``rate = 0``::
+
+     fv + pv + pmt * nper = 0
+
+    for `pv`, which is then returned.
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] Wheeler, D. A., E. Rathke, and R. Weir (Eds.) (2009, May).
+       Open Document Format for Office Applications (OpenDocument)v1.2,
+       Part 2: Recalculated Formula (OpenFormula) Format - Annotated Version,
+       Pre-Draft 12. Organization for the Advancement of Structured Information
+       Standards (OASIS). Billerica, MA, USA. [ODT Document].
+       Available:
+       http://www.oasis-open.org/committees/documents.php?wg_abbrev=office-formula
+       OpenDocument-formula-20090508.odt
+
+    Examples
+    --------
+    What is the present value (e.g., the initial investment)
+    of an investment that needs to total $15692.93
+    after 10 years of saving $100 every month?  Assume the
+    interest rate is 5% (annually) compounded monthly.
+
+    >>> np.pv(0.05/12, 10*12, -100, 15692.93)
+    -100.00067131625819
+
+    By convention, the negative sign represents cash flow out
+    (i.e., money not available today).  Thus, to end up with
+    $15,692.93 in 10 years saving $100 a month at 5% annual
+    interest, one's initial deposit should also be $100.
+
+    If any input is array_like, ``pv`` returns an array of equal shape.
+    Let's compare different interest rates in the example above:
+
+    >>> a = np.array((0.05, 0.04, 0.03))/12
+    >>> np.pv(a, 10*12, -100, 15692.93)
+    array([ -100.00067132,  -649.26771385, -1273.78633713]) # may vary
+
+    So, to end up with the same $15692.93 under the same $100 per month
+    "savings plan," for annual interest rates of 4% and 3%, one would
+    need initial investments of $649.27 and $1273.79, respectively.
+
+    """
+    when = _convert_when(when)
+    (rate, nper, pmt, fv, when) = map(np.asarray, [rate, nper, pmt, fv, when])
+    temp = (1+rate)**nper
+    fact = np.where(rate == 0, nper, (1+rate*when)*(temp-1)/rate)
+    return -(fv + pmt*fact)/temp
+
+# Computed with Sage
+#  (y + (r + 1)^n*x + p*((r + 1)^n - 1)*(r*w + 1)/r)/(n*(r + 1)^(n - 1)*x -
+#  p*((r + 1)^n - 1)*(r*w + 1)/r^2 + n*p*(r + 1)^(n - 1)*(r*w + 1)/r +
+#  p*((r + 1)^n - 1)*w/r)
+
+def _g_div_gp(r, n, p, x, y, w):
+    t1 = (r+1)**n
+    t2 = (r+1)**(n-1)
+    return ((y + t1*x + p*(t1 - 1)*(r*w + 1)/r) /
+                (n*t2*x - p*(t1 - 1)*(r*w + 1)/(r**2) + n*p*t2*(r*w + 1)/r +
+                 p*(t1 - 1)*w/r))
+
+
+def _rate_dispatcher(nper, pmt, pv, fv, when=None, guess=None, tol=None,
+                     maxiter=None):
+    warnings.warn(_depmsg.format(name='rate'),
+                  DeprecationWarning, stacklevel=3)
+    return (nper, pmt, pv, fv)
+
+
+# Use Newton's iteration until the change is less than 1e-6
+#  for all values or a maximum of 100 iterations is reached.
+#  Newton's rule is
+#  r_{n+1} = r_{n} - g(r_n)/g'(r_n)
+#     where
+#  g(r) is the formula
+#  g'(r) is the derivative with respect to r.
+@array_function_dispatch(_rate_dispatcher)
+def rate(nper, pmt, pv, fv, when='end', guess=None, tol=None, maxiter=100):
+    """
+    Compute the rate of interest per period.
+
+    .. deprecated:: 1.18
+
+       `rate` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Parameters
+    ----------
+    nper : array_like
+        Number of compounding periods
+    pmt : array_like
+        Payment
+    pv : array_like
+        Present value
+    fv : array_like
+        Future value
+    when : {{'begin', 1}, {'end', 0}}, {string, int}, optional
+        When payments are due ('begin' (1) or 'end' (0))
+    guess : Number, optional
+        Starting guess for solving the rate of interest, default 0.1
+    tol : Number, optional
+        Required tolerance for the solution, default 1e-6
+    maxiter : int, optional
+        Maximum iterations in finding the solution
+
+    Notes
+    -----
+    The rate of interest is computed by iteratively solving the
+    (non-linear) equation::
+
+     fv + pv*(1+rate)**nper + pmt*(1+rate*when)/rate * ((1+rate)**nper - 1) = 0
+
+    for ``rate``.
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] Wheeler, D. A., E. Rathke, and R. Weir (Eds.) (2009, May).
+       Open Document Format for Office Applications (OpenDocument)v1.2,
+       Part 2: Recalculated Formula (OpenFormula) Format - Annotated Version,
+       Pre-Draft 12. Organization for the Advancement of Structured Information
+       Standards (OASIS). Billerica, MA, USA. [ODT Document].
+       Available:
+       http://www.oasis-open.org/committees/documents.php?wg_abbrev=office-formula
+       OpenDocument-formula-20090508.odt
+
+    """
+    when = _convert_when(when)
+    default_type = Decimal if isinstance(pmt, Decimal) else float
+
+    # Handle casting defaults to Decimal if/when pmt is a Decimal and
+    # guess and/or tol are not given default values
+    if guess is None:
+        guess = default_type('0.1')
+
+    if tol is None:
+        tol = default_type('1e-6')
+
+    (nper, pmt, pv, fv, when) = map(np.asarray, [nper, pmt, pv, fv, when])
+
+    rn = guess
+    iterator = 0
+    close = False
+    while (iterator < maxiter) and not close:
+        rnp1 = rn - _g_div_gp(rn, nper, pmt, pv, fv, when)
+        diff = abs(rnp1-rn)
+        close = np.all(diff < tol)
+        iterator += 1
+        rn = rnp1
+    if not close:
+        # Return nan's in array of the same shape as rn
+        return np.nan + rn
+    else:
+        return rn
+
+
+def _irr_dispatcher(values):
+    warnings.warn(_depmsg.format(name='irr'),
+                  DeprecationWarning, stacklevel=3)
+    return (values,)
+
+
+@array_function_dispatch(_irr_dispatcher)
+def irr(values):
+    """
+    Return the Internal Rate of Return (IRR).
+
+    .. deprecated:: 1.18
+
+       `irr` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    This is the "average" periodically compounded rate of return
+    that gives a net present value of 0.0; for a more complete explanation,
+    see Notes below.
+
+    :class:`decimal.Decimal` type is not supported.
+
+    Parameters
+    ----------
+    values : array_like, shape(N,)
+        Input cash flows per time period.  By convention, net "deposits"
+        are negative and net "withdrawals" are positive.  Thus, for
+        example, at least the first element of `values`, which represents
+        the initial investment, will typically be negative.
+
+    Returns
+    -------
+    out : float
+        Internal Rate of Return for periodic input values.
+
+    Notes
+    -----
+    The IRR is perhaps best understood through an example (illustrated
+    using np.irr in the Examples section below).  Suppose one invests 100
+    units and then makes the following withdrawals at regular (fixed)
+    intervals: 39, 59, 55, 20.  Assuming the ending value is 0, one's 100
+    unit investment yields 173 units; however, due to the combination of
+    compounding and the periodic withdrawals, the "average" rate of return
+    is neither simply 0.73/4 nor (1.73)^0.25-1.  Rather, it is the solution
+    (for :math:`r`) of the equation:
+
+    .. math:: -100 + \\frac{39}{1+r} + \\frac{59}{(1+r)^2}
+     + \\frac{55}{(1+r)^3} + \\frac{20}{(1+r)^4} = 0
+
+    In general, for `values` :math:`= [v_0, v_1, ... v_M]`,
+    irr is the solution of the equation: [2]_
+
+    .. math:: \\sum_{t=0}^M{\\frac{v_t}{(1+irr)^{t}}} = 0
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] L. J. Gitman, "Principles of Managerial Finance, Brief," 3rd ed.,
+       Addison-Wesley, 2003, pg. 348.
+
+    Examples
+    --------
+    >>> round(np.irr([-100, 39, 59, 55, 20]), 5)
+    0.28095
+    >>> round(np.irr([-100, 0, 0, 74]), 5)
+    -0.0955
+    >>> round(np.irr([-100, 100, 0, -7]), 5)
+    -0.0833
+    >>> round(np.irr([-100, 100, 0, 7]), 5)
+    0.06206
+    >>> round(np.irr([-5, 10.5, 1, -8, 1]), 5)
+    0.0886
+
+    """
+    # `np.roots` call is why this function does not support Decimal type.
+    #
+    # Ultimately Decimal support needs to be added to np.roots, which has
+    # greater implications on the entire linear algebra module and how it does
+    # eigenvalue computations.
+    res = np.roots(values[::-1])
+    mask = (res.imag == 0) & (res.real > 0)
+    if not mask.any():
+        return np.nan
+    res = res[mask].real
+    # NPV(rate) = 0 can have more than one solution so we return
+    # only the solution closest to zero.
+    rate = 1/res - 1
+    rate = rate.item(np.argmin(np.abs(rate)))
+    return rate
+
+
+def _npv_dispatcher(rate, values):
+    warnings.warn(_depmsg.format(name='npv'),
+                  DeprecationWarning, stacklevel=3)
+    return (values,)
+
+
+@array_function_dispatch(_npv_dispatcher)
+def npv(rate, values):
+    """
+    Returns the NPV (Net Present Value) of a cash flow series.
+
+    .. deprecated:: 1.18
+
+       `npv` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Parameters
+    ----------
+    rate : scalar
+        The discount rate.
+    values : array_like, shape(M, )
+        The values of the time series of cash flows.  The (fixed) time
+        interval between cash flow "events" must be the same as that for
+        which `rate` is given (i.e., if `rate` is per year, then precisely
+        a year is understood to elapse between each cash flow event).  By
+        convention, investments or "deposits" are negative, income or
+        "withdrawals" are positive; `values` must begin with the initial
+        investment, thus `values[0]` will typically be negative.
+
+    Returns
+    -------
+    out : float
+        The NPV of the input cash flow series `values` at the discount
+        `rate`.
+
+    Warnings
+    --------
+    ``npv`` considers a series of cashflows starting in the present (t = 0).
+    NPV can also be defined with a series of future cashflows, paid at the
+    end, rather than the start, of each period. If future cashflows are used,
+    the first cashflow `values[0]` must be zeroed and added to the net
+    present value of the future cashflows. This is demonstrated in the
+    examples.
+
+    Notes
+    -----
+    Returns the result of: [2]_
+
+    .. math :: \\sum_{t=0}^{M-1}{\\frac{values_t}{(1+rate)^{t}}}
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    .. [2] L. J. Gitman, "Principles of Managerial Finance, Brief," 3rd ed.,
+       Addison-Wesley, 2003, pg. 346.
+
+    Examples
+    --------
+    Consider a potential project with an initial investment of $40 000 and
+    projected cashflows of $5 000, $8 000, $12 000 and $30 000 at the end of
+    each period discounted at a rate of 8% per period. To find the project's
+    net present value:
+
+    >>> rate, cashflows = 0.08, [-40_000, 5_000, 8_000, 12_000, 30_000]
+    >>> np.npv(rate, cashflows).round(5)
+    3065.22267
+
+    It may be preferable to split the projected cashflow into an initial
+    investment and expected future cashflows. In this case, the value of
+    the initial cashflow is zero and the initial investment is later added
+    to the future cashflows net present value:
+
+    >>> initial_cashflow = cashflows[0]
+    >>> cashflows[0] = 0
+    >>> np.round(np.npv(rate, cashflows) + initial_cashflow, 5)
+    3065.22267
+
+    """
+    values = np.asarray(values)
+    return (values / (1+rate)**np.arange(0, len(values))).sum(axis=0)
+
+
+def _mirr_dispatcher(values, finance_rate, reinvest_rate):
+    warnings.warn(_depmsg.format(name='mirr'),
+                  DeprecationWarning, stacklevel=3)
+    return (values,)
+
+
+@array_function_dispatch(_mirr_dispatcher)
+def mirr(values, finance_rate, reinvest_rate):
+    """
+    Modified internal rate of return.
+
+    .. deprecated:: 1.18
+
+       `mirr` is deprecated; for details, see NEP 32 [1]_.
+       Use the corresponding function in the numpy-financial library,
+       https://pypi.org/project/numpy-financial.
+
+    Parameters
+    ----------
+    values : array_like
+        Cash flows (must contain at least one positive and one negative
+        value) or nan is returned.  The first value is considered a sunk
+        cost at time zero.
+    finance_rate : scalar
+        Interest rate paid on the cash flows
+    reinvest_rate : scalar
+        Interest rate received on the cash flows upon reinvestment
+
+    Returns
+    -------
+    out : float
+        Modified internal rate of return
+
+    References
+    ----------
+    .. [1] NumPy Enhancement Proposal (NEP) 32,
+       https://numpy.org/neps/nep-0032-remove-financial-functions.html
+    """
+    values = np.asarray(values)
+    n = values.size
+
+    # Without this explicit cast the 1/(n - 1) computation below
+    # becomes a float, which causes TypeError when using Decimal
+    # values.
+    if isinstance(finance_rate, Decimal):
+        n = Decimal(n)
+
+    pos = values > 0
+    neg = values < 0
+    if not (pos.any() and neg.any()):
+        return np.nan
+    numer = np.abs(npv(reinvest_rate, values*pos))
+    denom = np.abs(npv(finance_rate, values*neg))
+    return (numer/denom)**(1/(n - 1))*(1 + reinvest_rate) - 1
diff --git a/venv/Lib/site-packages/numpy/lib/format.py b/venv/Lib/site-packages/numpy/lib/format.py
new file mode 100644
index 000000000..2afa4ac10
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/format.py
@@ -0,0 +1,902 @@
+"""
+Binary serialization
+
+NPY format
+==========
+
+A simple format for saving numpy arrays to disk with the full
+information about them.
+
+The ``.npy`` format is the standard binary file format in NumPy for
+persisting a *single* arbitrary NumPy array on disk. The format stores all
+of the shape and dtype information necessary to reconstruct the array
+correctly even on another machine with a different architecture.
+The format is designed to be as simple as possible while achieving
+its limited goals.
+
+The ``.npz`` format is the standard format for persisting *multiple* NumPy
+arrays on disk. A ``.npz`` file is a zip file containing multiple ``.npy``
+files, one for each array.
+
+Capabilities
+------------
+
+- Can represent all NumPy arrays including nested record arrays and
+  object arrays.
+
+- Represents the data in its native binary form.
+
+- Supports Fortran-contiguous arrays directly.
+
+- Stores all of the necessary information to reconstruct the array
+  including shape and dtype on a machine of a different
+  architecture.  Both little-endian and big-endian arrays are
+  supported, and a file with little-endian numbers will yield
+  a little-endian array on any machine reading the file. The
+  types are described in terms of their actual sizes. For example,
+  if a machine with a 64-bit C "long int" writes out an array with
+  "long ints", a reading machine with 32-bit C "long ints" will yield
+  an array with 64-bit integers.
+
+- Is straightforward to reverse engineer. Datasets often live longer than
+  the programs that created them. A competent developer should be
+  able to create a solution in their preferred programming language to
+  read most ``.npy`` files that he has been given without much
+  documentation.
+
+- Allows memory-mapping of the data. See `open_memmep`.
+
+- Can be read from a filelike stream object instead of an actual file.
+
+- Stores object arrays, i.e. arrays containing elements that are arbitrary
+  Python objects. Files with object arrays are not to be mmapable, but
+  can be read and written to disk.
+
+Limitations
+-----------
+
+- Arbitrary subclasses of numpy.ndarray are not completely preserved.
+  Subclasses will be accepted for writing, but only the array data will
+  be written out. A regular numpy.ndarray object will be created
+  upon reading the file.
+
+.. warning::
+
+  Due to limitations in the interpretation of structured dtypes, dtypes
+  with fields with empty names will have the names replaced by 'f0', 'f1',
+  etc. Such arrays will not round-trip through the format entirely
+  accurately. The data is intact; only the field names will differ. We are
+  working on a fix for this. This fix will not require a change in the
+  file format. The arrays with such structures can still be saved and
+  restored, and the correct dtype may be restored by using the
+  ``loadedarray.view(correct_dtype)`` method.
+
+File extensions
+---------------
+
+We recommend using the ``.npy`` and ``.npz`` extensions for files saved
+in this format. This is by no means a requirement; applications may wish
+to use these file formats but use an extension specific to the
+application. In the absence of an obvious alternative, however,
+we suggest using ``.npy`` and ``.npz``.
+
+Version numbering
+-----------------
+
+The version numbering of these formats is independent of NumPy version
+numbering. If the format is upgraded, the code in `numpy.io` will still
+be able to read and write Version 1.0 files.
+
+Format Version 1.0
+------------------
+
+The first 6 bytes are a magic string: exactly ``\\x93NUMPY``.
+
+The next 1 byte is an unsigned byte: the major version number of the file
+format, e.g. ``\\x01``.
+
+The next 1 byte is an unsigned byte: the minor version number of the file
+format, e.g. ``\\x00``. Note: the version of the file format is not tied
+to the version of the numpy package.
+
+The next 2 bytes form a little-endian unsigned short int: the length of
+the header data HEADER_LEN.
+
+The next HEADER_LEN bytes form the header data describing the array's
+format. It is an ASCII string which contains a Python literal expression
+of a dictionary. It is terminated by a newline (``\\n``) and padded with
+spaces (``\\x20``) to make the total of
+``len(magic string) + 2 + len(length) + HEADER_LEN`` be evenly divisible
+by 64 for alignment purposes.
+
+The dictionary contains three keys:
+
+    "descr" : dtype.descr
+      An object that can be passed as an argument to the `numpy.dtype`
+      constructor to create the array's dtype.
+    "fortran_order" : bool
+      Whether the array data is Fortran-contiguous or not. Since
+      Fortran-contiguous arrays are a common form of non-C-contiguity,
+      we allow them to be written directly to disk for efficiency.
+    "shape" : tuple of int
+      The shape of the array.
+
+For repeatability and readability, the dictionary keys are sorted in
+alphabetic order. This is for convenience only. A writer SHOULD implement
+this if possible. A reader MUST NOT depend on this.
+
+Following the header comes the array data. If the dtype contains Python
+objects (i.e. ``dtype.hasobject is True``), then the data is a Python
+pickle of the array. Otherwise the data is the contiguous (either C-
+or Fortran-, depending on ``fortran_order``) bytes of the array.
+Consumers can figure out the number of bytes by multiplying the number
+of elements given by the shape (noting that ``shape=()`` means there is
+1 element) by ``dtype.itemsize``.
+
+Format Version 2.0
+------------------
+
+The version 1.0 format only allowed the array header to have a total size of
+65535 bytes.  This can be exceeded by structured arrays with a large number of
+columns.  The version 2.0 format extends the header size to 4 GiB.
+`numpy.save` will automatically save in 2.0 format if the data requires it,
+else it will always use the more compatible 1.0 format.
+
+The description of the fourth element of the header therefore has become:
+"The next 4 bytes form a little-endian unsigned int: the length of the header
+data HEADER_LEN."
+
+Format Version 3.0
+------------------
+
+This version replaces the ASCII string (which in practice was latin1) with
+a utf8-encoded string, so supports structured types with any unicode field
+names.
+
+Notes
+-----
+The ``.npy`` format, including motivation for creating it and a comparison of
+alternatives, is described in the `"npy-format" NEP
+<https://www.numpy.org/neps/nep-0001-npy-format.html>`_, however details have
+evolved with time and this document is more current.
+
+"""
+import numpy
+import io
+import warnings
+from numpy.lib.utils import safe_eval
+from numpy.compat import (
+    isfileobj, os_fspath, pickle
+    )
+
+
+__all__ = []
+
+
+MAGIC_PREFIX = b'\x93NUMPY'
+MAGIC_LEN = len(MAGIC_PREFIX) + 2
+ARRAY_ALIGN = 64 # plausible values are powers of 2 between 16 and 4096
+BUFFER_SIZE = 2**18  # size of buffer for reading npz files in bytes
+
+# difference between version 1.0 and 2.0 is a 4 byte (I) header length
+# instead of 2 bytes (H) allowing storage of large structured arrays
+_header_size_info = {
+    (1, 0): ('<H', 'latin1'),
+    (2, 0): ('<I', 'latin1'),
+    (3, 0): ('<I', 'utf8'),
+}
+
+
+def _check_version(version):
+    if version not in [(1, 0), (2, 0), (3, 0), None]:
+        msg = "we only support format version (1,0), (2,0), and (3,0), not %s"
+        raise ValueError(msg % (version,))
+
+def magic(major, minor):
+    """ Return the magic string for the given file format version.
+
+    Parameters
+    ----------
+    major : int in [0, 255]
+    minor : int in [0, 255]
+
+    Returns
+    -------
+    magic : str
+
+    Raises
+    ------
+    ValueError if the version cannot be formatted.
+    """
+    if major < 0 or major > 255:
+        raise ValueError("major version must be 0 <= major < 256")
+    if minor < 0 or minor > 255:
+        raise ValueError("minor version must be 0 <= minor < 256")
+    return MAGIC_PREFIX + bytes([major, minor])
+
+def read_magic(fp):
+    """ Read the magic string to get the version of the file format.
+
+    Parameters
+    ----------
+    fp : filelike object
+
+    Returns
+    -------
+    major : int
+    minor : int
+    """
+    magic_str = _read_bytes(fp, MAGIC_LEN, "magic string")
+    if magic_str[:-2] != MAGIC_PREFIX:
+        msg = "the magic string is not correct; expected %r, got %r"
+        raise ValueError(msg % (MAGIC_PREFIX, magic_str[:-2]))
+    major, minor = magic_str[-2:]
+    return major, minor
+
+def _has_metadata(dt):
+    if dt.metadata is not None:
+        return True
+    elif dt.names is not None:
+        return any(_has_metadata(dt[k]) for k in dt.names)
+    elif dt.subdtype is not None:
+        return _has_metadata(dt.base)
+    else:
+        return False
+
+def dtype_to_descr(dtype):
+    """
+    Get a serializable descriptor from the dtype.
+
+    The .descr attribute of a dtype object cannot be round-tripped through
+    the dtype() constructor. Simple types, like dtype('float32'), have
+    a descr which looks like a record array with one field with '' as
+    a name. The dtype() constructor interprets this as a request to give
+    a default name.  Instead, we construct descriptor that can be passed to
+    dtype().
+
+    Parameters
+    ----------
+    dtype : dtype
+        The dtype of the array that will be written to disk.
+
+    Returns
+    -------
+    descr : object
+        An object that can be passed to `numpy.dtype()` in order to
+        replicate the input dtype.
+
+    """
+    if _has_metadata(dtype):
+        warnings.warn("metadata on a dtype may be saved or ignored, but will "
+                      "raise if saved when read. Use another form of storage.",
+                      UserWarning, stacklevel=2)
+    if dtype.names is not None:
+        # This is a record array. The .descr is fine.  XXX: parts of the
+        # record array with an empty name, like padding bytes, still get
+        # fiddled with. This needs to be fixed in the C implementation of
+        # dtype().
+        return dtype.descr
+    else:
+        return dtype.str
+
+def descr_to_dtype(descr):
+    '''
+    descr may be stored as dtype.descr, which is a list of
+    (name, format, [shape]) tuples where format may be a str or a tuple.
+    Offsets are not explicitly saved, rather empty fields with
+    name, format == '', '|Vn' are added as padding.
+
+    This function reverses the process, eliminating the empty padding fields.
+    '''
+    if isinstance(descr, str):
+        # No padding removal needed
+        return numpy.dtype(descr)
+    elif isinstance(descr, tuple):
+        # subtype, will always have a shape descr[1]
+        dt = descr_to_dtype(descr[0])
+        return numpy.dtype((dt, descr[1]))
+
+    titles = []
+    names = []
+    formats = []
+    offsets = []
+    offset = 0
+    for field in descr:
+        if len(field) == 2:
+            name, descr_str = field
+            dt = descr_to_dtype(descr_str)
+        else:
+            name, descr_str, shape = field
+            dt = numpy.dtype((descr_to_dtype(descr_str), shape))
+
+        # Ignore padding bytes, which will be void bytes with '' as name
+        # Once support for blank names is removed, only "if name == ''" needed)
+        is_pad = (name == '' and dt.type is numpy.void and dt.names is None)
+        if not is_pad:
+            title, name = name if isinstance(name, tuple) else (None, name)
+            titles.append(title)
+            names.append(name)
+            formats.append(dt)
+            offsets.append(offset)
+        offset += dt.itemsize
+
+    return numpy.dtype({'names': names, 'formats': formats, 'titles': titles,
+                        'offsets': offsets, 'itemsize': offset})
+
+def header_data_from_array_1_0(array):
+    """ Get the dictionary of header metadata from a numpy.ndarray.
+
+    Parameters
+    ----------
+    array : numpy.ndarray
+
+    Returns
+    -------
+    d : dict
+        This has the appropriate entries for writing its string representation
+        to the header of the file.
+    """
+    d = {'shape': array.shape}
+    if array.flags.c_contiguous:
+        d['fortran_order'] = False
+    elif array.flags.f_contiguous:
+        d['fortran_order'] = True
+    else:
+        # Totally non-contiguous data. We will have to make it C-contiguous
+        # before writing. Note that we need to test for C_CONTIGUOUS first
+        # because a 1-D array is both C_CONTIGUOUS and F_CONTIGUOUS.
+        d['fortran_order'] = False
+
+    d['descr'] = dtype_to_descr(array.dtype)
+    return d
+
+
+def _wrap_header(header, version):
+    """
+    Takes a stringified header, and attaches the prefix and padding to it
+    """
+    import struct
+    assert version is not None
+    fmt, encoding = _header_size_info[version]
+    if not isinstance(header, bytes):  # always true on python 3
+        header = header.encode(encoding)
+    hlen = len(header) + 1
+    padlen = ARRAY_ALIGN - ((MAGIC_LEN + struct.calcsize(fmt) + hlen) % ARRAY_ALIGN)
+    try:
+        header_prefix = magic(*version) + struct.pack(fmt, hlen + padlen)
+    except struct.error:
+        msg = "Header length {} too big for version={}".format(hlen, version)
+        raise ValueError(msg)
+
+    # Pad the header with spaces and a final newline such that the magic
+    # string, the header-length short and the header are aligned on a
+    # ARRAY_ALIGN byte boundary.  This supports memory mapping of dtypes
+    # aligned up to ARRAY_ALIGN on systems like Linux where mmap()
+    # offset must be page-aligned (i.e. the beginning of the file).
+    return header_prefix + header + b' '*padlen + b'\n'
+
+
+def _wrap_header_guess_version(header):
+    """
+    Like `_wrap_header`, but chooses an appropriate version given the contents
+    """
+    try:
+        return _wrap_header(header, (1, 0))
+    except ValueError:
+        pass
+
+    try:
+        ret = _wrap_header(header, (2, 0))
+    except UnicodeEncodeError:
+        pass
+    else:
+        warnings.warn("Stored array in format 2.0. It can only be"
+                      "read by NumPy >= 1.9", UserWarning, stacklevel=2)
+        return ret
+
+    header = _wrap_header(header, (3, 0))
+    warnings.warn("Stored array in format 3.0. It can only be "
+                  "read by NumPy >= 1.17", UserWarning, stacklevel=2)
+    return header
+
+
+def _write_array_header(fp, d, version=None):
+    """ Write the header for an array and returns the version used
+
+    Parameters
+    ----------
+    fp : filelike object
+    d : dict
+        This has the appropriate entries for writing its string representation
+        to the header of the file.
+    version: tuple or None
+        None means use oldest that works
+        explicit version will raise a ValueError if the format does not
+        allow saving this data.  Default: None
+    """
+    header = ["{"]
+    for key, value in sorted(d.items()):
+        # Need to use repr here, since we eval these when reading
+        header.append("'%s': %s, " % (key, repr(value)))
+    header.append("}")
+    header = "".join(header)
+    header = _filter_header(header)
+    if version is None:
+        header = _wrap_header_guess_version(header)
+    else:
+        header = _wrap_header(header, version)
+    fp.write(header)
+
+def write_array_header_1_0(fp, d):
+    """ Write the header for an array using the 1.0 format.
+
+    Parameters
+    ----------
+    fp : filelike object
+    d : dict
+        This has the appropriate entries for writing its string
+        representation to the header of the file.
+    """
+    _write_array_header(fp, d, (1, 0))
+
+
+def write_array_header_2_0(fp, d):
+    """ Write the header for an array using the 2.0 format.
+        The 2.0 format allows storing very large structured arrays.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    fp : filelike object
+    d : dict
+        This has the appropriate entries for writing its string
+        representation to the header of the file.
+    """
+    _write_array_header(fp, d, (2, 0))
+
+def read_array_header_1_0(fp):
+    """
+    Read an array header from a filelike object using the 1.0 file format
+    version.
+
+    This will leave the file object located just after the header.
+
+    Parameters
+    ----------
+    fp : filelike object
+        A file object or something with a `.read()` method like a file.
+
+    Returns
+    -------
+    shape : tuple of int
+        The shape of the array.
+    fortran_order : bool
+        The array data will be written out directly if it is either
+        C-contiguous or Fortran-contiguous. Otherwise, it will be made
+        contiguous before writing it out.
+    dtype : dtype
+        The dtype of the file's data.
+
+    Raises
+    ------
+    ValueError
+        If the data is invalid.
+
+    """
+    return _read_array_header(fp, version=(1, 0))
+
+def read_array_header_2_0(fp):
+    """
+    Read an array header from a filelike object using the 2.0 file format
+    version.
+
+    This will leave the file object located just after the header.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    fp : filelike object
+        A file object or something with a `.read()` method like a file.
+
+    Returns
+    -------
+    shape : tuple of int
+        The shape of the array.
+    fortran_order : bool
+        The array data will be written out directly if it is either
+        C-contiguous or Fortran-contiguous. Otherwise, it will be made
+        contiguous before writing it out.
+    dtype : dtype
+        The dtype of the file's data.
+
+    Raises
+    ------
+    ValueError
+        If the data is invalid.
+
+    """
+    return _read_array_header(fp, version=(2, 0))
+
+
+def _filter_header(s):
+    """Clean up 'L' in npz header ints.
+
+    Cleans up the 'L' in strings representing integers. Needed to allow npz
+    headers produced in Python2 to be read in Python3.
+
+    Parameters
+    ----------
+    s : string
+        Npy file header.
+
+    Returns
+    -------
+    header : str
+        Cleaned up header.
+
+    """
+    import tokenize
+    from io import StringIO
+
+    tokens = []
+    last_token_was_number = False
+    for token in tokenize.generate_tokens(StringIO(s).readline):
+        token_type = token[0]
+        token_string = token[1]
+        if (last_token_was_number and
+                token_type == tokenize.NAME and
+                token_string == "L"):
+            continue
+        else:
+            tokens.append(token)
+        last_token_was_number = (token_type == tokenize.NUMBER)
+    return tokenize.untokenize(tokens)
+
+
+def _read_array_header(fp, version):
+    """
+    see read_array_header_1_0
+    """
+    # Read an unsigned, little-endian short int which has the length of the
+    # header.
+    import struct
+    hinfo = _header_size_info.get(version)
+    if hinfo is None:
+        raise ValueError("Invalid version {!r}".format(version))
+    hlength_type, encoding = hinfo
+
+    hlength_str = _read_bytes(fp, struct.calcsize(hlength_type), "array header length")
+    header_length = struct.unpack(hlength_type, hlength_str)[0]
+    header = _read_bytes(fp, header_length, "array header")
+    header = header.decode(encoding)
+
+    # The header is a pretty-printed string representation of a literal
+    # Python dictionary with trailing newlines padded to a ARRAY_ALIGN byte
+    # boundary. The keys are strings.
+    #   "shape" : tuple of int
+    #   "fortran_order" : bool
+    #   "descr" : dtype.descr
+    header = _filter_header(header)
+    try:
+        d = safe_eval(header)
+    except SyntaxError as e:
+        msg = "Cannot parse header: {!r}\nException: {!r}"
+        raise ValueError(msg.format(header, e))
+    if not isinstance(d, dict):
+        msg = "Header is not a dictionary: {!r}"
+        raise ValueError(msg.format(d))
+    keys = sorted(d.keys())
+    if keys != ['descr', 'fortran_order', 'shape']:
+        msg = "Header does not contain the correct keys: {!r}"
+        raise ValueError(msg.format(keys))
+
+    # Sanity-check the values.
+    if (not isinstance(d['shape'], tuple) or
+            not numpy.all([isinstance(x, int) for x in d['shape']])):
+        msg = "shape is not valid: {!r}"
+        raise ValueError(msg.format(d['shape']))
+    if not isinstance(d['fortran_order'], bool):
+        msg = "fortran_order is not a valid bool: {!r}"
+        raise ValueError(msg.format(d['fortran_order']))
+    try:
+        dtype = descr_to_dtype(d['descr'])
+    except TypeError:
+        msg = "descr is not a valid dtype descriptor: {!r}"
+        raise ValueError(msg.format(d['descr']))
+
+    return d['shape'], d['fortran_order'], dtype
+
+def write_array(fp, array, version=None, allow_pickle=True, pickle_kwargs=None):
+    """
+    Write an array to an NPY file, including a header.
+
+    If the array is neither C-contiguous nor Fortran-contiguous AND the
+    file_like object is not a real file object, this function will have to
+    copy data in memory.
+
+    Parameters
+    ----------
+    fp : file_like object
+        An open, writable file object, or similar object with a
+        ``.write()`` method.
+    array : ndarray
+        The array to write to disk.
+    version : (int, int) or None, optional
+        The version number of the format. None means use the oldest
+        supported version that is able to store the data.  Default: None
+    allow_pickle : bool, optional
+        Whether to allow writing pickled data. Default: True
+    pickle_kwargs : dict, optional
+        Additional keyword arguments to pass to pickle.dump, excluding
+        'protocol'. These are only useful when pickling objects in object
+        arrays on Python 3 to Python 2 compatible format.
+
+    Raises
+    ------
+    ValueError
+        If the array cannot be persisted. This includes the case of
+        allow_pickle=False and array being an object array.
+    Various other errors
+        If the array contains Python objects as part of its dtype, the
+        process of pickling them may raise various errors if the objects
+        are not picklable.
+
+    """
+    _check_version(version)
+    _write_array_header(fp, header_data_from_array_1_0(array), version)
+
+    if array.itemsize == 0:
+        buffersize = 0
+    else:
+        # Set buffer size to 16 MiB to hide the Python loop overhead.
+        buffersize = max(16 * 1024 ** 2 // array.itemsize, 1)
+
+    if array.dtype.hasobject:
+        # We contain Python objects so we cannot write out the data
+        # directly.  Instead, we will pickle it out
+        if not allow_pickle:
+            raise ValueError("Object arrays cannot be saved when "
+                             "allow_pickle=False")
+        if pickle_kwargs is None:
+            pickle_kwargs = {}
+        pickle.dump(array, fp, protocol=3, **pickle_kwargs)
+    elif array.flags.f_contiguous and not array.flags.c_contiguous:
+        if isfileobj(fp):
+            array.T.tofile(fp)
+        else:
+            for chunk in numpy.nditer(
+                    array, flags=['external_loop', 'buffered', 'zerosize_ok'],
+                    buffersize=buffersize, order='F'):
+                fp.write(chunk.tobytes('C'))
+    else:
+        if isfileobj(fp):
+            array.tofile(fp)
+        else:
+            for chunk in numpy.nditer(
+                    array, flags=['external_loop', 'buffered', 'zerosize_ok'],
+                    buffersize=buffersize, order='C'):
+                fp.write(chunk.tobytes('C'))
+
+
+def read_array(fp, allow_pickle=False, pickle_kwargs=None):
+    """
+    Read an array from an NPY file.
+
+    Parameters
+    ----------
+    fp : file_like object
+        If this is not a real file object, then this may take extra memory
+        and time.
+    allow_pickle : bool, optional
+        Whether to allow writing pickled data. Default: False
+
+        .. versionchanged:: 1.16.3
+            Made default False in response to CVE-2019-6446.
+
+    pickle_kwargs : dict
+        Additional keyword arguments to pass to pickle.load. These are only
+        useful when loading object arrays saved on Python 2 when using
+        Python 3.
+
+    Returns
+    -------
+    array : ndarray
+        The array from the data on disk.
+
+    Raises
+    ------
+    ValueError
+        If the data is invalid, or allow_pickle=False and the file contains
+        an object array.
+
+    """
+    version = read_magic(fp)
+    _check_version(version)
+    shape, fortran_order, dtype = _read_array_header(fp, version)
+    if len(shape) == 0:
+        count = 1
+    else:
+        count = numpy.multiply.reduce(shape, dtype=numpy.int64)
+
+    # Now read the actual data.
+    if dtype.hasobject:
+        # The array contained Python objects. We need to unpickle the data.
+        if not allow_pickle:
+            raise ValueError("Object arrays cannot be loaded when "
+                             "allow_pickle=False")
+        if pickle_kwargs is None:
+            pickle_kwargs = {}
+        try:
+            array = pickle.load(fp, **pickle_kwargs)
+        except UnicodeError as err:
+            # Friendlier error message
+            raise UnicodeError("Unpickling a python object failed: %r\n"
+                               "You may need to pass the encoding= option "
+                               "to numpy.load" % (err,))
+    else:
+        if isfileobj(fp):
+            # We can use the fast fromfile() function.
+            array = numpy.fromfile(fp, dtype=dtype, count=count)
+        else:
+            # This is not a real file. We have to read it the
+            # memory-intensive way.
+            # crc32 module fails on reads greater than 2 ** 32 bytes,
+            # breaking large reads from gzip streams. Chunk reads to
+            # BUFFER_SIZE bytes to avoid issue and reduce memory overhead
+            # of the read. In non-chunked case count < max_read_count, so
+            # only one read is performed.
+
+            # Use np.ndarray instead of np.empty since the latter does
+            # not correctly instantiate zero-width string dtypes; see
+            # https://github.com/numpy/numpy/pull/6430
+            array = numpy.ndarray(count, dtype=dtype)
+
+            if dtype.itemsize > 0:
+                # If dtype.itemsize == 0 then there's nothing more to read
+                max_read_count = BUFFER_SIZE // min(BUFFER_SIZE, dtype.itemsize)
+
+                for i in range(0, count, max_read_count):
+                    read_count = min(max_read_count, count - i)
+                    read_size = int(read_count * dtype.itemsize)
+                    data = _read_bytes(fp, read_size, "array data")
+                    array[i:i+read_count] = numpy.frombuffer(data, dtype=dtype,
+                                                             count=read_count)
+
+        if fortran_order:
+            array.shape = shape[::-1]
+            array = array.transpose()
+        else:
+            array.shape = shape
+
+    return array
+
+
+def open_memmap(filename, mode='r+', dtype=None, shape=None,
+                fortran_order=False, version=None):
+    """
+    Open a .npy file as a memory-mapped array.
+
+    This may be used to read an existing file or create a new one.
+
+    Parameters
+    ----------
+    filename : str or path-like
+        The name of the file on disk.  This may *not* be a file-like
+        object.
+    mode : str, optional
+        The mode in which to open the file; the default is 'r+'.  In
+        addition to the standard file modes, 'c' is also accepted to mean
+        "copy on write."  See `memmap` for the available mode strings.
+    dtype : data-type, optional
+        The data type of the array if we are creating a new file in "write"
+        mode, if not, `dtype` is ignored.  The default value is None, which
+        results in a data-type of `float64`.
+    shape : tuple of int
+        The shape of the array if we are creating a new file in "write"
+        mode, in which case this parameter is required.  Otherwise, this
+        parameter is ignored and is thus optional.
+    fortran_order : bool, optional
+        Whether the array should be Fortran-contiguous (True) or
+        C-contiguous (False, the default) if we are creating a new file in
+        "write" mode.
+    version : tuple of int (major, minor) or None
+        If the mode is a "write" mode, then this is the version of the file
+        format used to create the file.  None means use the oldest
+        supported version that is able to store the data.  Default: None
+
+    Returns
+    -------
+    marray : memmap
+        The memory-mapped array.
+
+    Raises
+    ------
+    ValueError
+        If the data or the mode is invalid.
+    IOError
+        If the file is not found or cannot be opened correctly.
+
+    See Also
+    --------
+    memmap
+
+    """
+    if isfileobj(filename):
+        raise ValueError("Filename must be a string or a path-like object."
+                         "  Memmap cannot use existing file handles.")
+
+    if 'w' in mode:
+        # We are creating the file, not reading it.
+        # Check if we ought to create the file.
+        _check_version(version)
+        # Ensure that the given dtype is an authentic dtype object rather
+        # than just something that can be interpreted as a dtype object.
+        dtype = numpy.dtype(dtype)
+        if dtype.hasobject:
+            msg = "Array can't be memory-mapped: Python objects in dtype."
+            raise ValueError(msg)
+        d = dict(
+            descr=dtype_to_descr(dtype),
+            fortran_order=fortran_order,
+            shape=shape,
+        )
+        # If we got here, then it should be safe to create the file.
+        with open(os_fspath(filename), mode+'b') as fp:
+            _write_array_header(fp, d, version)
+            offset = fp.tell()
+    else:
+        # Read the header of the file first.
+        with open(os_fspath(filename), 'rb') as fp:
+            version = read_magic(fp)
+            _check_version(version)
+
+            shape, fortran_order, dtype = _read_array_header(fp, version)
+            if dtype.hasobject:
+                msg = "Array can't be memory-mapped: Python objects in dtype."
+                raise ValueError(msg)
+            offset = fp.tell()
+
+    if fortran_order:
+        order = 'F'
+    else:
+        order = 'C'
+
+    # We need to change a write-only mode to a read-write mode since we've
+    # already written data to the file.
+    if mode == 'w+':
+        mode = 'r+'
+
+    marray = numpy.memmap(filename, dtype=dtype, shape=shape, order=order,
+        mode=mode, offset=offset)
+
+    return marray
+
+
+def _read_bytes(fp, size, error_template="ran out of data"):
+    """
+    Read from file-like object until size bytes are read.
+    Raises ValueError if not EOF is encountered before size bytes are read.
+    Non-blocking objects only supported if they derive from io objects.
+
+    Required as e.g. ZipExtFile in python 2.6 can return less data than
+    requested.
+    """
+    data = bytes()
+    while True:
+        # io files (default in python3) return None or raise on
+        # would-block, python2 file will truncate, probably nothing can be
+        # done about that.  note that regular files can't be non-blocking
+        try:
+            r = fp.read(size - len(data))
+            data += r
+            if len(r) == 0 or len(data) == size:
+                break
+        except io.BlockingIOError:
+            pass
+    if len(data) != size:
+        msg = "EOF: reading %s, expected %d bytes got %d"
+        raise ValueError(msg % (error_template, size, len(data)))
+    else:
+        return data
diff --git a/venv/Lib/site-packages/numpy/lib/function_base.py b/venv/Lib/site-packages/numpy/lib/function_base.py
new file mode 100644
index 000000000..dea01d12d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/function_base.py
@@ -0,0 +1,4786 @@
+import collections.abc
+import functools
+import re
+import sys
+import warnings
+
+import numpy as np
+import numpy.core.numeric as _nx
+from numpy.core import transpose
+from numpy.core.numeric import (
+    ones, zeros, arange, concatenate, array, asarray, asanyarray, empty,
+    ndarray, around, floor, ceil, take, dot, where, intp,
+    integer, isscalar, absolute
+    )
+from numpy.core.umath import (
+    pi, add, arctan2, frompyfunc, cos, less_equal, sqrt, sin,
+    mod, exp, not_equal, subtract
+    )
+from numpy.core.fromnumeric import (
+    ravel, nonzero, partition, mean, any, sum
+    )
+from numpy.core.numerictypes import typecodes
+from numpy.core.overrides import set_module
+from numpy.core import overrides
+from numpy.core.function_base import add_newdoc
+from numpy.lib.twodim_base import diag
+from numpy.core.multiarray import (
+    _insert, add_docstring, bincount, normalize_axis_index, _monotonicity,
+    interp as compiled_interp, interp_complex as compiled_interp_complex
+    )
+from numpy.core.umath import _add_newdoc_ufunc as add_newdoc_ufunc
+
+import builtins
+
+# needed in this module for compatibility
+from numpy.lib.histograms import histogram, histogramdd
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = [
+    'select', 'piecewise', 'trim_zeros', 'copy', 'iterable', 'percentile',
+    'diff', 'gradient', 'angle', 'unwrap', 'sort_complex', 'disp', 'flip',
+    'rot90', 'extract', 'place', 'vectorize', 'asarray_chkfinite', 'average',
+    'bincount', 'digitize', 'cov', 'corrcoef',
+    'msort', 'median', 'sinc', 'hamming', 'hanning', 'bartlett',
+    'blackman', 'kaiser', 'trapz', 'i0', 'add_newdoc', 'add_docstring',
+    'meshgrid', 'delete', 'insert', 'append', 'interp', 'add_newdoc_ufunc',
+    'quantile'
+    ]
+
+
+def _rot90_dispatcher(m, k=None, axes=None):
+    return (m,)
+
+
+@array_function_dispatch(_rot90_dispatcher)
+def rot90(m, k=1, axes=(0, 1)):
+    """
+    Rotate an array by 90 degrees in the plane specified by axes.
+
+    Rotation direction is from the first towards the second axis.
+
+    Parameters
+    ----------
+    m : array_like
+        Array of two or more dimensions.
+    k : integer
+        Number of times the array is rotated by 90 degrees.
+    axes: (2,) array_like
+        The array is rotated in the plane defined by the axes.
+        Axes must be different.
+
+        .. versionadded:: 1.12.0
+
+    Returns
+    -------
+    y : ndarray
+        A rotated view of `m`.
+
+    See Also
+    --------
+    flip : Reverse the order of elements in an array along the given axis.
+    fliplr : Flip an array horizontally.
+    flipud : Flip an array vertically.
+
+    Notes
+    -----
+    rot90(m, k=1, axes=(1,0)) is the reverse of rot90(m, k=1, axes=(0,1))
+    rot90(m, k=1, axes=(1,0)) is equivalent to rot90(m, k=-1, axes=(0,1))
+
+    Examples
+    --------
+    >>> m = np.array([[1,2],[3,4]], int)
+    >>> m
+    array([[1, 2],
+           [3, 4]])
+    >>> np.rot90(m)
+    array([[2, 4],
+           [1, 3]])
+    >>> np.rot90(m, 2)
+    array([[4, 3],
+           [2, 1]])
+    >>> m = np.arange(8).reshape((2,2,2))
+    >>> np.rot90(m, 1, (1,2))
+    array([[[1, 3],
+            [0, 2]],
+           [[5, 7],
+            [4, 6]]])
+
+    """
+    axes = tuple(axes)
+    if len(axes) != 2:
+        raise ValueError("len(axes) must be 2.")
+
+    m = asanyarray(m)
+
+    if axes[0] == axes[1] or absolute(axes[0] - axes[1]) == m.ndim:
+        raise ValueError("Axes must be different.")
+
+    if (axes[0] >= m.ndim or axes[0] < -m.ndim
+        or axes[1] >= m.ndim or axes[1] < -m.ndim):
+        raise ValueError("Axes={} out of range for array of ndim={}."
+            .format(axes, m.ndim))
+
+    k %= 4
+
+    if k == 0:
+        return m[:]
+    if k == 2:
+        return flip(flip(m, axes[0]), axes[1])
+
+    axes_list = arange(0, m.ndim)
+    (axes_list[axes[0]], axes_list[axes[1]]) = (axes_list[axes[1]],
+                                                axes_list[axes[0]])
+
+    if k == 1:
+        return transpose(flip(m, axes[1]), axes_list)
+    else:
+        # k == 3
+        return flip(transpose(m, axes_list), axes[1])
+
+
+def _flip_dispatcher(m, axis=None):
+    return (m,)
+
+
+@array_function_dispatch(_flip_dispatcher)
+def flip(m, axis=None):
+    """
+    Reverse the order of elements in an array along the given axis.
+
+    The shape of the array is preserved, but the elements are reordered.
+
+    .. versionadded:: 1.12.0
+
+    Parameters
+    ----------
+    m : array_like
+        Input array.
+    axis : None or int or tuple of ints, optional
+         Axis or axes along which to flip over. The default,
+         axis=None, will flip over all of the axes of the input array.
+         If axis is negative it counts from the last to the first axis.
+
+         If axis is a tuple of ints, flipping is performed on all of the axes
+         specified in the tuple.
+
+         .. versionchanged:: 1.15.0
+            None and tuples of axes are supported
+
+    Returns
+    -------
+    out : array_like
+        A view of `m` with the entries of axis reversed.  Since a view is
+        returned, this operation is done in constant time.
+
+    See Also
+    --------
+    flipud : Flip an array vertically (axis=0).
+    fliplr : Flip an array horizontally (axis=1).
+
+    Notes
+    -----
+    flip(m, 0) is equivalent to flipud(m).
+
+    flip(m, 1) is equivalent to fliplr(m).
+
+    flip(m, n) corresponds to ``m[...,::-1,...]`` with ``::-1`` at position n.
+
+    flip(m) corresponds to ``m[::-1,::-1,...,::-1]`` with ``::-1`` at all
+    positions.
+
+    flip(m, (0, 1)) corresponds to ``m[::-1,::-1,...]`` with ``::-1`` at
+    position 0 and position 1.
+
+    Examples
+    --------
+    >>> A = np.arange(8).reshape((2,2,2))
+    >>> A
+    array([[[0, 1],
+            [2, 3]],
+           [[4, 5],
+            [6, 7]]])
+    >>> np.flip(A, 0)
+    array([[[4, 5],
+            [6, 7]],
+           [[0, 1],
+            [2, 3]]])
+    >>> np.flip(A, 1)
+    array([[[2, 3],
+            [0, 1]],
+           [[6, 7],
+            [4, 5]]])
+    >>> np.flip(A)
+    array([[[7, 6],
+            [5, 4]],
+           [[3, 2],
+            [1, 0]]])
+    >>> np.flip(A, (0, 2))
+    array([[[5, 4],
+            [7, 6]],
+           [[1, 0],
+            [3, 2]]])
+    >>> A = np.random.randn(3,4,5)
+    >>> np.all(np.flip(A,2) == A[:,:,::-1,...])
+    True
+    """
+    if not hasattr(m, 'ndim'):
+        m = asarray(m)
+    if axis is None:
+        indexer = (np.s_[::-1],) * m.ndim
+    else:
+        axis = _nx.normalize_axis_tuple(axis, m.ndim)
+        indexer = [np.s_[:]] * m.ndim
+        for ax in axis:
+            indexer[ax] = np.s_[::-1]
+        indexer = tuple(indexer)
+    return m[indexer]
+
+
+@set_module('numpy')
+def iterable(y):
+    """
+    Check whether or not an object can be iterated over.
+
+    Parameters
+    ----------
+    y : object
+      Input object.
+
+    Returns
+    -------
+    b : bool
+      Return ``True`` if the object has an iterator method or is a
+      sequence and ``False`` otherwise.
+
+
+    Examples
+    --------
+    >>> np.iterable([1, 2, 3])
+    True
+    >>> np.iterable(2)
+    False
+
+    """
+    try:
+        iter(y)
+    except TypeError:
+        return False
+    return True
+
+
+def _average_dispatcher(a, axis=None, weights=None, returned=None):
+    return (a, weights)
+
+
+@array_function_dispatch(_average_dispatcher)
+def average(a, axis=None, weights=None, returned=False):
+    """
+    Compute the weighted average along the specified axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing data to be averaged. If `a` is not an array, a
+        conversion is attempted.
+    axis : None or int or tuple of ints, optional
+        Axis or axes along which to average `a`.  The default,
+        axis=None, will average over all of the elements of the input array.
+        If axis is negative it counts from the last to the first axis.
+
+        .. versionadded:: 1.7.0
+
+        If axis is a tuple of ints, averaging is performed on all of the axes
+        specified in the tuple instead of a single axis or all the axes as
+        before.
+    weights : array_like, optional
+        An array of weights associated with the values in `a`. Each value in
+        `a` contributes to the average according to its associated weight.
+        The weights array can either be 1-D (in which case its length must be
+        the size of `a` along the given axis) or of the same shape as `a`.
+        If `weights=None`, then all data in `a` are assumed to have a
+        weight equal to one.  The 1-D calculation is::
+
+            avg = sum(a * weights) / sum(weights)
+
+        The only constraint on `weights` is that `sum(weights)` must not be 0.
+    returned : bool, optional
+        Default is `False`. If `True`, the tuple (`average`, `sum_of_weights`)
+        is returned, otherwise only the average is returned.
+        If `weights=None`, `sum_of_weights` is equivalent to the number of
+        elements over which the average is taken.
+
+    Returns
+    -------
+    retval, [sum_of_weights] : array_type or double
+        Return the average along the specified axis. When `returned` is `True`,
+        return a tuple with the average as the first element and the sum
+        of the weights as the second element. `sum_of_weights` is of the
+        same type as `retval`. The result dtype follows a genereal pattern.
+        If `weights` is None, the result dtype will be that of `a` , or ``float64``
+        if `a` is integral. Otherwise, if `weights` is not None and `a` is non-
+        integral, the result type will be the type of lowest precision capable of
+        representing values of both `a` and `weights`. If `a` happens to be
+        integral, the previous rules still applies but the result dtype will
+        at least be ``float64``.
+
+    Raises
+    ------
+    ZeroDivisionError
+        When all weights along axis are zero. See `numpy.ma.average` for a
+        version robust to this type of error.
+    TypeError
+        When the length of 1D `weights` is not the same as the shape of `a`
+        along axis.
+
+    See Also
+    --------
+    mean
+
+    ma.average : average for masked arrays -- useful if your data contains
+                 "missing" values
+    numpy.result_type : Returns the type that results from applying the
+                        numpy type promotion rules to the arguments.
+
+    Examples
+    --------
+    >>> data = np.arange(1, 5)
+    >>> data
+    array([1, 2, 3, 4])
+    >>> np.average(data)
+    2.5
+    >>> np.average(np.arange(1, 11), weights=np.arange(10, 0, -1))
+    4.0
+
+    >>> data = np.arange(6).reshape((3,2))
+    >>> data
+    array([[0, 1],
+           [2, 3],
+           [4, 5]])
+    >>> np.average(data, axis=1, weights=[1./4, 3./4])
+    array([0.75, 2.75, 4.75])
+    >>> np.average(data, weights=[1./4, 3./4])
+    Traceback (most recent call last):
+        ...
+    TypeError: Axis must be specified when shapes of a and weights differ.
+
+    >>> a = np.ones(5, dtype=np.float128)
+    >>> w = np.ones(5, dtype=np.complex64)
+    >>> avg = np.average(a, weights=w)
+    >>> print(avg.dtype)
+    complex256
+    """
+    a = np.asanyarray(a)
+
+    if weights is None:
+        avg = a.mean(axis)
+        scl = avg.dtype.type(a.size/avg.size)
+    else:
+        wgt = np.asanyarray(weights)
+
+        if issubclass(a.dtype.type, (np.integer, np.bool_)):
+            result_dtype = np.result_type(a.dtype, wgt.dtype, 'f8')
+        else:
+            result_dtype = np.result_type(a.dtype, wgt.dtype)
+
+        # Sanity checks
+        if a.shape != wgt.shape:
+            if axis is None:
+                raise TypeError(
+                    "Axis must be specified when shapes of a and weights "
+                    "differ.")
+            if wgt.ndim != 1:
+                raise TypeError(
+                    "1D weights expected when shapes of a and weights differ.")
+            if wgt.shape[0] != a.shape[axis]:
+                raise ValueError(
+                    "Length of weights not compatible with specified axis.")
+
+            # setup wgt to broadcast along axis
+            wgt = np.broadcast_to(wgt, (a.ndim-1)*(1,) + wgt.shape)
+            wgt = wgt.swapaxes(-1, axis)
+
+        scl = wgt.sum(axis=axis, dtype=result_dtype)
+        if np.any(scl == 0.0):
+            raise ZeroDivisionError(
+                "Weights sum to zero, can't be normalized")
+
+        avg = np.multiply(a, wgt, dtype=result_dtype).sum(axis)/scl
+
+    if returned:
+        if scl.shape != avg.shape:
+            scl = np.broadcast_to(scl, avg.shape).copy()
+        return avg, scl
+    else:
+        return avg
+
+
+@set_module('numpy')
+def asarray_chkfinite(a, dtype=None, order=None):
+    """Convert the input to an array, checking for NaNs or Infs.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data, in any form that can be converted to an array.  This
+        includes lists, lists of tuples, tuples, tuples of tuples, tuples
+        of lists and ndarrays.  Success requires no NaNs or Infs.
+    dtype : data-type, optional
+        By default, the data-type is inferred from the input data.
+    order : {'C', 'F'}, optional
+         Whether to use row-major (C-style) or
+         column-major (Fortran-style) memory representation.
+         Defaults to 'C'.
+
+    Returns
+    -------
+    out : ndarray
+        Array interpretation of `a`.  No copy is performed if the input
+        is already an ndarray.  If `a` is a subclass of ndarray, a base
+        class ndarray is returned.
+
+    Raises
+    ------
+    ValueError
+        Raises ValueError if `a` contains NaN (Not a Number) or Inf (Infinity).
+
+    See Also
+    --------
+    asarray : Create and array.
+    asanyarray : Similar function which passes through subclasses.
+    ascontiguousarray : Convert input to a contiguous array.
+    asfarray : Convert input to a floating point ndarray.
+    asfortranarray : Convert input to an ndarray with column-major
+                     memory order.
+    fromiter : Create an array from an iterator.
+    fromfunction : Construct an array by executing a function on grid
+                   positions.
+
+    Examples
+    --------
+    Convert a list into an array.  If all elements are finite
+    ``asarray_chkfinite`` is identical to ``asarray``.
+
+    >>> a = [1, 2]
+    >>> np.asarray_chkfinite(a, dtype=float)
+    array([1., 2.])
+
+    Raises ValueError if array_like contains Nans or Infs.
+
+    >>> a = [1, 2, np.inf]
+    >>> try:
+    ...     np.asarray_chkfinite(a)
+    ... except ValueError:
+    ...     print('ValueError')
+    ...
+    ValueError
+
+    """
+    a = asarray(a, dtype=dtype, order=order)
+    if a.dtype.char in typecodes['AllFloat'] and not np.isfinite(a).all():
+        raise ValueError(
+            "array must not contain infs or NaNs")
+    return a
+
+
+def _piecewise_dispatcher(x, condlist, funclist, *args, **kw):
+    yield x
+    # support the undocumented behavior of allowing scalars
+    if np.iterable(condlist):
+        yield from condlist
+
+
+@array_function_dispatch(_piecewise_dispatcher)
+def piecewise(x, condlist, funclist, *args, **kw):
+    """
+    Evaluate a piecewise-defined function.
+
+    Given a set of conditions and corresponding functions, evaluate each
+    function on the input data wherever its condition is true.
+
+    Parameters
+    ----------
+    x : ndarray or scalar
+        The input domain.
+    condlist : list of bool arrays or bool scalars
+        Each boolean array corresponds to a function in `funclist`.  Wherever
+        `condlist[i]` is True, `funclist[i](x)` is used as the output value.
+
+        Each boolean array in `condlist` selects a piece of `x`,
+        and should therefore be of the same shape as `x`.
+
+        The length of `condlist` must correspond to that of `funclist`.
+        If one extra function is given, i.e. if
+        ``len(funclist) == len(condlist) + 1``, then that extra function
+        is the default value, used wherever all conditions are false.
+    funclist : list of callables, f(x,*args,**kw), or scalars
+        Each function is evaluated over `x` wherever its corresponding
+        condition is True.  It should take a 1d array as input and give an 1d
+        array or a scalar value as output.  If, instead of a callable,
+        a scalar is provided then a constant function (``lambda x: scalar``) is
+        assumed.
+    args : tuple, optional
+        Any further arguments given to `piecewise` are passed to the functions
+        upon execution, i.e., if called ``piecewise(..., ..., 1, 'a')``, then
+        each function is called as ``f(x, 1, 'a')``.
+    kw : dict, optional
+        Keyword arguments used in calling `piecewise` are passed to the
+        functions upon execution, i.e., if called
+        ``piecewise(..., ..., alpha=1)``, then each function is called as
+        ``f(x, alpha=1)``.
+
+    Returns
+    -------
+    out : ndarray
+        The output is the same shape and type as x and is found by
+        calling the functions in `funclist` on the appropriate portions of `x`,
+        as defined by the boolean arrays in `condlist`.  Portions not covered
+        by any condition have a default value of 0.
+
+
+    See Also
+    --------
+    choose, select, where
+
+    Notes
+    -----
+    This is similar to choose or select, except that functions are
+    evaluated on elements of `x` that satisfy the corresponding condition from
+    `condlist`.
+
+    The result is::
+
+            |--
+            |funclist[0](x[condlist[0]])
+      out = |funclist[1](x[condlist[1]])
+            |...
+            |funclist[n2](x[condlist[n2]])
+            |--
+
+    Examples
+    --------
+    Define the sigma function, which is -1 for ``x < 0`` and +1 for ``x >= 0``.
+
+    >>> x = np.linspace(-2.5, 2.5, 6)
+    >>> np.piecewise(x, [x < 0, x >= 0], [-1, 1])
+    array([-1., -1., -1.,  1.,  1.,  1.])
+
+    Define the absolute value, which is ``-x`` for ``x <0`` and ``x`` for
+    ``x >= 0``.
+
+    >>> np.piecewise(x, [x < 0, x >= 0], [lambda x: -x, lambda x: x])
+    array([2.5,  1.5,  0.5,  0.5,  1.5,  2.5])
+
+    Apply the same function to a scalar value.
+
+    >>> y = -2
+    >>> np.piecewise(y, [y < 0, y >= 0], [lambda x: -x, lambda x: x])
+    array(2)
+
+    """
+    x = asanyarray(x)
+    n2 = len(funclist)
+
+    # undocumented: single condition is promoted to a list of one condition
+    if isscalar(condlist) or (
+            not isinstance(condlist[0], (list, ndarray)) and x.ndim != 0):
+        condlist = [condlist]
+
+    condlist = array(condlist, dtype=bool)
+    n = len(condlist)
+
+    if n == n2 - 1:  # compute the "otherwise" condition.
+        condelse = ~np.any(condlist, axis=0, keepdims=True)
+        condlist = np.concatenate([condlist, condelse], axis=0)
+        n += 1
+    elif n != n2:
+        raise ValueError(
+            "with {} condition(s), either {} or {} functions are expected"
+            .format(n, n, n+1)
+        )
+
+    y = zeros(x.shape, x.dtype)
+    for k in range(n):
+        item = funclist[k]
+        if not isinstance(item, collections.abc.Callable):
+            y[condlist[k]] = item
+        else:
+            vals = x[condlist[k]]
+            if vals.size > 0:
+                y[condlist[k]] = item(vals, *args, **kw)
+
+    return y
+
+
+def _select_dispatcher(condlist, choicelist, default=None):
+    yield from condlist
+    yield from choicelist
+
+
+@array_function_dispatch(_select_dispatcher)
+def select(condlist, choicelist, default=0):
+    """
+    Return an array drawn from elements in choicelist, depending on conditions.
+
+    Parameters
+    ----------
+    condlist : list of bool ndarrays
+        The list of conditions which determine from which array in `choicelist`
+        the output elements are taken. When multiple conditions are satisfied,
+        the first one encountered in `condlist` is used.
+    choicelist : list of ndarrays
+        The list of arrays from which the output elements are taken. It has
+        to be of the same length as `condlist`.
+    default : scalar, optional
+        The element inserted in `output` when all conditions evaluate to False.
+
+    Returns
+    -------
+    output : ndarray
+        The output at position m is the m-th element of the array in
+        `choicelist` where the m-th element of the corresponding array in
+        `condlist` is True.
+
+    See Also
+    --------
+    where : Return elements from one of two arrays depending on condition.
+    take, choose, compress, diag, diagonal
+
+    Examples
+    --------
+    >>> x = np.arange(10)
+    >>> condlist = [x<3, x>5]
+    >>> choicelist = [x, x**2]
+    >>> np.select(condlist, choicelist)
+    array([ 0,  1,  2, ..., 49, 64, 81])
+
+    """
+    # Check the size of condlist and choicelist are the same, or abort.
+    if len(condlist) != len(choicelist):
+        raise ValueError(
+            'list of cases must be same length as list of conditions')
+
+    # Now that the dtype is known, handle the deprecated select([], []) case
+    if len(condlist) == 0:
+        raise ValueError("select with an empty condition list is not possible")
+
+    choicelist = [np.asarray(choice) for choice in choicelist]
+    choicelist.append(np.asarray(default))
+
+    # need to get the result type before broadcasting for correct scalar
+    # behaviour
+    dtype = np.result_type(*choicelist)
+
+    # Convert conditions to arrays and broadcast conditions and choices
+    # as the shape is needed for the result. Doing it separately optimizes
+    # for example when all choices are scalars.
+    condlist = np.broadcast_arrays(*condlist)
+    choicelist = np.broadcast_arrays(*choicelist)
+
+    # If cond array is not an ndarray in boolean format or scalar bool, abort.
+    for i in range(len(condlist)):
+        cond = condlist[i]
+        if cond.dtype.type is not np.bool_:
+            raise TypeError(
+                'invalid entry {} in condlist: should be boolean ndarray'.format(i))
+
+    if choicelist[0].ndim == 0:
+        # This may be common, so avoid the call.
+        result_shape = condlist[0].shape
+    else:
+        result_shape = np.broadcast_arrays(condlist[0], choicelist[0])[0].shape
+
+    result = np.full(result_shape, choicelist[-1], dtype)
+
+    # Use np.copyto to burn each choicelist array onto result, using the
+    # corresponding condlist as a boolean mask. This is done in reverse
+    # order since the first choice should take precedence.
+    choicelist = choicelist[-2::-1]
+    condlist = condlist[::-1]
+    for choice, cond in zip(choicelist, condlist):
+        np.copyto(result, choice, where=cond)
+
+    return result
+
+
+def _copy_dispatcher(a, order=None, subok=None):
+    return (a,)
+
+
+@array_function_dispatch(_copy_dispatcher)
+def copy(a, order='K', subok=False):
+    """
+    Return an array copy of the given object.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    order : {'C', 'F', 'A', 'K'}, optional
+        Controls the memory layout of the copy. 'C' means C-order,
+        'F' means F-order, 'A' means 'F' if `a` is Fortran contiguous,
+        'C' otherwise. 'K' means match the layout of `a` as closely
+        as possible. (Note that this function and :meth:`ndarray.copy` are very
+        similar, but have different default values for their order=
+        arguments.)
+    subok : bool, optional
+        If True, then sub-classes will be passed-through, otherwise the
+        returned array will be forced to be a base-class array (defaults to False).
+
+        .. versionadded:: 1.19.0
+
+    Returns
+    -------
+    arr : ndarray
+        Array interpretation of `a`.
+
+    See Also
+    --------
+    ndarray.copy : Preferred method for creating an array copy
+
+    Notes
+    -----
+    This is equivalent to:
+
+    >>> np.array(a, copy=True)  #doctest: +SKIP
+
+    Examples
+    --------
+    Create an array x, with a reference y and a copy z:
+
+    >>> x = np.array([1, 2, 3])
+    >>> y = x
+    >>> z = np.copy(x)
+
+    Note that, when we modify x, y changes, but not z:
+
+    >>> x[0] = 10
+    >>> x[0] == y[0]
+    True
+    >>> x[0] == z[0]
+    False
+
+    Note that np.copy is a shallow copy and will not copy object
+    elements within arrays. This is mainly important for arrays
+    containing Python objects. The new array will contain the
+    same object which may lead to surprises if that object can
+    be modified (is mutable):
+
+    >>> a = np.array([1, 'm', [2, 3, 4]], dtype=object)
+    >>> b = np.copy(a)
+    >>> b[2][0] = 10
+    >>> a
+    array([1, 'm', list([10, 3, 4])], dtype=object)
+
+    To ensure all elements within an ``object`` array are copied,
+    use `copy.deepcopy`:
+
+    >>> import copy
+    >>> a = np.array([1, 'm', [2, 3, 4]], dtype=object)
+    >>> c = copy.deepcopy(a)
+    >>> c[2][0] = 10
+    >>> c
+    array([1, 'm', list([10, 3, 4])], dtype=object)
+    >>> a
+    array([1, 'm', list([2, 3, 4])], dtype=object)
+
+    """
+    return array(a, order=order, subok=subok, copy=True)
+
+# Basic operations
+
+
+def _gradient_dispatcher(f, *varargs, axis=None, edge_order=None):
+    yield f
+    yield from varargs
+
+
+@array_function_dispatch(_gradient_dispatcher)
+def gradient(f, *varargs, axis=None, edge_order=1):
+    """
+    Return the gradient of an N-dimensional array.
+
+    The gradient is computed using second order accurate central differences
+    in the interior points and either first or second order accurate one-sides
+    (forward or backwards) differences at the boundaries.
+    The returned gradient hence has the same shape as the input array.
+
+    Parameters
+    ----------
+    f : array_like
+        An N-dimensional array containing samples of a scalar function.
+    varargs : list of scalar or array, optional
+        Spacing between f values. Default unitary spacing for all dimensions.
+        Spacing can be specified using:
+
+        1. single scalar to specify a sample distance for all dimensions.
+        2. N scalars to specify a constant sample distance for each dimension.
+           i.e. `dx`, `dy`, `dz`, ...
+        3. N arrays to specify the coordinates of the values along each
+           dimension of F. The length of the array must match the size of
+           the corresponding dimension
+        4. Any combination of N scalars/arrays with the meaning of 2. and 3.
+
+        If `axis` is given, the number of varargs must equal the number of axes.
+        Default: 1.
+
+    edge_order : {1, 2}, optional
+        Gradient is calculated using N-th order accurate differences
+        at the boundaries. Default: 1.
+
+        .. versionadded:: 1.9.1
+
+    axis : None or int or tuple of ints, optional
+        Gradient is calculated only along the given axis or axes
+        The default (axis = None) is to calculate the gradient for all the axes
+        of the input array. axis may be negative, in which case it counts from
+        the last to the first axis.
+
+        .. versionadded:: 1.11.0
+
+    Returns
+    -------
+    gradient : ndarray or list of ndarray
+        A set of ndarrays (or a single ndarray if there is only one dimension)
+        corresponding to the derivatives of f with respect to each dimension.
+        Each derivative has the same shape as f.
+
+    Examples
+    --------
+    >>> f = np.array([1, 2, 4, 7, 11, 16], dtype=float)
+    >>> np.gradient(f)
+    array([1. , 1.5, 2.5, 3.5, 4.5, 5. ])
+    >>> np.gradient(f, 2)
+    array([0.5 ,  0.75,  1.25,  1.75,  2.25,  2.5 ])
+
+    Spacing can be also specified with an array that represents the coordinates
+    of the values F along the dimensions.
+    For instance a uniform spacing:
+
+    >>> x = np.arange(f.size)
+    >>> np.gradient(f, x)
+    array([1. ,  1.5,  2.5,  3.5,  4.5,  5. ])
+
+    Or a non uniform one:
+
+    >>> x = np.array([0., 1., 1.5, 3.5, 4., 6.], dtype=float)
+    >>> np.gradient(f, x)
+    array([1. ,  3. ,  3.5,  6.7,  6.9,  2.5])
+
+    For two dimensional arrays, the return will be two arrays ordered by
+    axis. In this example the first array stands for the gradient in
+    rows and the second one in columns direction:
+
+    >>> np.gradient(np.array([[1, 2, 6], [3, 4, 5]], dtype=float))
+    [array([[ 2.,  2., -1.],
+           [ 2.,  2., -1.]]), array([[1. , 2.5, 4. ],
+           [1. , 1. , 1. ]])]
+
+    In this example the spacing is also specified:
+    uniform for axis=0 and non uniform for axis=1
+
+    >>> dx = 2.
+    >>> y = [1., 1.5, 3.5]
+    >>> np.gradient(np.array([[1, 2, 6], [3, 4, 5]], dtype=float), dx, y)
+    [array([[ 1. ,  1. , -0.5],
+           [ 1. ,  1. , -0.5]]), array([[2. , 2. , 2. ],
+           [2. , 1.7, 0.5]])]
+
+    It is possible to specify how boundaries are treated using `edge_order`
+
+    >>> x = np.array([0, 1, 2, 3, 4])
+    >>> f = x**2
+    >>> np.gradient(f, edge_order=1)
+    array([1.,  2.,  4.,  6.,  7.])
+    >>> np.gradient(f, edge_order=2)
+    array([0., 2., 4., 6., 8.])
+
+    The `axis` keyword can be used to specify a subset of axes of which the
+    gradient is calculated
+
+    >>> np.gradient(np.array([[1, 2, 6], [3, 4, 5]], dtype=float), axis=0)
+    array([[ 2.,  2., -1.],
+           [ 2.,  2., -1.]])
+
+    Notes
+    -----
+    Assuming that :math:`f\\in C^{3}` (i.e., :math:`f` has at least 3 continuous
+    derivatives) and let :math:`h_{*}` be a non-homogeneous stepsize, we
+    minimize the "consistency error" :math:`\\eta_{i}` between the true gradient
+    and its estimate from a linear combination of the neighboring grid-points:
+
+    .. math::
+
+        \\eta_{i} = f_{i}^{\\left(1\\right)} -
+                    \\left[ \\alpha f\\left(x_{i}\\right) +
+                            \\beta f\\left(x_{i} + h_{d}\\right) +
+                            \\gamma f\\left(x_{i}-h_{s}\\right)
+                    \\right]
+
+    By substituting :math:`f(x_{i} + h_{d})` and :math:`f(x_{i} - h_{s})`
+    with their Taylor series expansion, this translates into solving
+    the following the linear system:
+
+    .. math::
+
+        \\left\\{
+            \\begin{array}{r}
+                \\alpha+\\beta+\\gamma=0 \\\\
+                \\beta h_{d}-\\gamma h_{s}=1 \\\\
+                \\beta h_{d}^{2}+\\gamma h_{s}^{2}=0
+            \\end{array}
+        \\right.
+
+    The resulting approximation of :math:`f_{i}^{(1)}` is the following:
+
+    .. math::
+
+        \\hat f_{i}^{(1)} =
+            \\frac{
+                h_{s}^{2}f\\left(x_{i} + h_{d}\\right)
+                + \\left(h_{d}^{2} - h_{s}^{2}\\right)f\\left(x_{i}\\right)
+                - h_{d}^{2}f\\left(x_{i}-h_{s}\\right)}
+                { h_{s}h_{d}\\left(h_{d} + h_{s}\\right)}
+            + \\mathcal{O}\\left(\\frac{h_{d}h_{s}^{2}
+                                + h_{s}h_{d}^{2}}{h_{d}
+                                + h_{s}}\\right)
+
+    It is worth noting that if :math:`h_{s}=h_{d}`
+    (i.e., data are evenly spaced)
+    we find the standard second order approximation:
+
+    .. math::
+
+        \\hat f_{i}^{(1)}=
+            \\frac{f\\left(x_{i+1}\\right) - f\\left(x_{i-1}\\right)}{2h}
+            + \\mathcal{O}\\left(h^{2}\\right)
+
+    With a similar procedure the forward/backward approximations used for
+    boundaries can be derived.
+
+    References
+    ----------
+    .. [1]  Quarteroni A., Sacco R., Saleri F. (2007) Numerical Mathematics
+            (Texts in Applied Mathematics). New York: Springer.
+    .. [2]  Durran D. R. (1999) Numerical Methods for Wave Equations
+            in Geophysical Fluid Dynamics. New York: Springer.
+    .. [3]  Fornberg B. (1988) Generation of Finite Difference Formulas on
+            Arbitrarily Spaced Grids,
+            Mathematics of Computation 51, no. 184 : 699-706.
+            `PDF <http://www.ams.org/journals/mcom/1988-51-184/
+            S0025-5718-1988-0935077-0/S0025-5718-1988-0935077-0.pdf>`_.
+    """
+    f = np.asanyarray(f)
+    N = f.ndim  # number of dimensions
+
+    if axis is None:
+        axes = tuple(range(N))
+    else:
+        axes = _nx.normalize_axis_tuple(axis, N)
+
+    len_axes = len(axes)
+    n = len(varargs)
+    if n == 0:
+        # no spacing argument - use 1 in all axes
+        dx = [1.0] * len_axes
+    elif n == 1 and np.ndim(varargs[0]) == 0:
+        # single scalar for all axes
+        dx = varargs * len_axes
+    elif n == len_axes:
+        # scalar or 1d array for each axis
+        dx = list(varargs)
+        for i, distances in enumerate(dx):
+            distances = np.asanyarray(distances)
+            if distances.ndim == 0:
+                continue
+            elif distances.ndim != 1:
+                raise ValueError("distances must be either scalars or 1d")
+            if len(distances) != f.shape[axes[i]]:
+                raise ValueError("when 1d, distances must match "
+                                 "the length of the corresponding dimension")
+            if np.issubdtype(distances.dtype, np.integer):
+                # Convert numpy integer types to float64 to avoid modular
+                # arithmetic in np.diff(distances).
+                distances = distances.astype(np.float64)
+            diffx = np.diff(distances)
+            # if distances are constant reduce to the scalar case
+            # since it brings a consistent speedup
+            if (diffx == diffx[0]).all():
+                diffx = diffx[0]
+            dx[i] = diffx
+    else:
+        raise TypeError("invalid number of arguments")
+
+    if edge_order > 2:
+        raise ValueError("'edge_order' greater than 2 not supported")
+
+    # use central differences on interior and one-sided differences on the
+    # endpoints. This preserves second order-accuracy over the full domain.
+
+    outvals = []
+
+    # create slice objects --- initially all are [:, :, ..., :]
+    slice1 = [slice(None)]*N
+    slice2 = [slice(None)]*N
+    slice3 = [slice(None)]*N
+    slice4 = [slice(None)]*N
+
+    otype = f.dtype
+    if otype.type is np.datetime64:
+        # the timedelta dtype with the same unit information
+        otype = np.dtype(otype.name.replace('datetime', 'timedelta'))
+        # view as timedelta to allow addition
+        f = f.view(otype)
+    elif otype.type is np.timedelta64:
+        pass
+    elif np.issubdtype(otype, np.inexact):
+        pass
+    else:
+        # All other types convert to floating point.
+        # First check if f is a numpy integer type; if so, convert f to float64
+        # to avoid modular arithmetic when computing the changes in f.
+        if np.issubdtype(otype, np.integer):
+            f = f.astype(np.float64)
+        otype = np.float64
+
+    for axis, ax_dx in zip(axes, dx):
+        if f.shape[axis] < edge_order + 1:
+            raise ValueError(
+                "Shape of array too small to calculate a numerical gradient, "
+                "at least (edge_order + 1) elements are required.")
+        # result allocation
+        out = np.empty_like(f, dtype=otype)
+
+        # spacing for the current axis
+        uniform_spacing = np.ndim(ax_dx) == 0
+
+        # Numerical differentiation: 2nd order interior
+        slice1[axis] = slice(1, -1)
+        slice2[axis] = slice(None, -2)
+        slice3[axis] = slice(1, -1)
+        slice4[axis] = slice(2, None)
+
+        if uniform_spacing:
+            out[tuple(slice1)] = (f[tuple(slice4)] - f[tuple(slice2)]) / (2. * ax_dx)
+        else:
+            dx1 = ax_dx[0:-1]
+            dx2 = ax_dx[1:]
+            a = -(dx2)/(dx1 * (dx1 + dx2))
+            b = (dx2 - dx1) / (dx1 * dx2)
+            c = dx1 / (dx2 * (dx1 + dx2))
+            # fix the shape for broadcasting
+            shape = np.ones(N, dtype=int)
+            shape[axis] = -1
+            a.shape = b.shape = c.shape = shape
+            # 1D equivalent -- out[1:-1] = a * f[:-2] + b * f[1:-1] + c * f[2:]
+            out[tuple(slice1)] = a * f[tuple(slice2)] + b * f[tuple(slice3)] + c * f[tuple(slice4)]
+
+        # Numerical differentiation: 1st order edges
+        if edge_order == 1:
+            slice1[axis] = 0
+            slice2[axis] = 1
+            slice3[axis] = 0
+            dx_0 = ax_dx if uniform_spacing else ax_dx[0]
+            # 1D equivalent -- out[0] = (f[1] - f[0]) / (x[1] - x[0])
+            out[tuple(slice1)] = (f[tuple(slice2)] - f[tuple(slice3)]) / dx_0
+
+            slice1[axis] = -1
+            slice2[axis] = -1
+            slice3[axis] = -2
+            dx_n = ax_dx if uniform_spacing else ax_dx[-1]
+            # 1D equivalent -- out[-1] = (f[-1] - f[-2]) / (x[-1] - x[-2])
+            out[tuple(slice1)] = (f[tuple(slice2)] - f[tuple(slice3)]) / dx_n
+
+        # Numerical differentiation: 2nd order edges
+        else:
+            slice1[axis] = 0
+            slice2[axis] = 0
+            slice3[axis] = 1
+            slice4[axis] = 2
+            if uniform_spacing:
+                a = -1.5 / ax_dx
+                b = 2. / ax_dx
+                c = -0.5 / ax_dx
+            else:
+                dx1 = ax_dx[0]
+                dx2 = ax_dx[1]
+                a = -(2. * dx1 + dx2)/(dx1 * (dx1 + dx2))
+                b = (dx1 + dx2) / (dx1 * dx2)
+                c = - dx1 / (dx2 * (dx1 + dx2))
+            # 1D equivalent -- out[0] = a * f[0] + b * f[1] + c * f[2]
+            out[tuple(slice1)] = a * f[tuple(slice2)] + b * f[tuple(slice3)] + c * f[tuple(slice4)]
+
+            slice1[axis] = -1
+            slice2[axis] = -3
+            slice3[axis] = -2
+            slice4[axis] = -1
+            if uniform_spacing:
+                a = 0.5 / ax_dx
+                b = -2. / ax_dx
+                c = 1.5 / ax_dx
+            else:
+                dx1 = ax_dx[-2]
+                dx2 = ax_dx[-1]
+                a = (dx2) / (dx1 * (dx1 + dx2))
+                b = - (dx2 + dx1) / (dx1 * dx2)
+                c = (2. * dx2 + dx1) / (dx2 * (dx1 + dx2))
+            # 1D equivalent -- out[-1] = a * f[-3] + b * f[-2] + c * f[-1]
+            out[tuple(slice1)] = a * f[tuple(slice2)] + b * f[tuple(slice3)] + c * f[tuple(slice4)]
+
+        outvals.append(out)
+
+        # reset the slice object in this dimension to ":"
+        slice1[axis] = slice(None)
+        slice2[axis] = slice(None)
+        slice3[axis] = slice(None)
+        slice4[axis] = slice(None)
+
+    if len_axes == 1:
+        return outvals[0]
+    else:
+        return outvals
+
+
+def _diff_dispatcher(a, n=None, axis=None, prepend=None, append=None):
+    return (a, prepend, append)
+
+
+@array_function_dispatch(_diff_dispatcher)
+def diff(a, n=1, axis=-1, prepend=np._NoValue, append=np._NoValue):
+    """
+    Calculate the n-th discrete difference along the given axis.
+
+    The first difference is given by ``out[i] = a[i+1] - a[i]`` along
+    the given axis, higher differences are calculated by using `diff`
+    recursively.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array
+    n : int, optional
+        The number of times values are differenced. If zero, the input
+        is returned as-is.
+    axis : int, optional
+        The axis along which the difference is taken, default is the
+        last axis.
+    prepend, append : array_like, optional
+        Values to prepend or append to `a` along axis prior to
+        performing the difference.  Scalar values are expanded to
+        arrays with length 1 in the direction of axis and the shape
+        of the input array in along all other axes.  Otherwise the
+        dimension and shape must match `a` except along axis.
+
+        .. versionadded:: 1.16.0
+
+    Returns
+    -------
+    diff : ndarray
+        The n-th differences. The shape of the output is the same as `a`
+        except along `axis` where the dimension is smaller by `n`. The
+        type of the output is the same as the type of the difference
+        between any two elements of `a`. This is the same as the type of
+        `a` in most cases. A notable exception is `datetime64`, which
+        results in a `timedelta64` output array.
+
+    See Also
+    --------
+    gradient, ediff1d, cumsum
+
+    Notes
+    -----
+    Type is preserved for boolean arrays, so the result will contain
+    `False` when consecutive elements are the same and `True` when they
+    differ.
+
+    For unsigned integer arrays, the results will also be unsigned. This
+    should not be surprising, as the result is consistent with
+    calculating the difference directly:
+
+    >>> u8_arr = np.array([1, 0], dtype=np.uint8)
+    >>> np.diff(u8_arr)
+    array([255], dtype=uint8)
+    >>> u8_arr[1,...] - u8_arr[0,...]
+    255
+
+    If this is not desirable, then the array should be cast to a larger
+    integer type first:
+
+    >>> i16_arr = u8_arr.astype(np.int16)
+    >>> np.diff(i16_arr)
+    array([-1], dtype=int16)
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 4, 7, 0])
+    >>> np.diff(x)
+    array([ 1,  2,  3, -7])
+    >>> np.diff(x, n=2)
+    array([  1,   1, -10])
+
+    >>> x = np.array([[1, 3, 6, 10], [0, 5, 6, 8]])
+    >>> np.diff(x)
+    array([[2, 3, 4],
+           [5, 1, 2]])
+    >>> np.diff(x, axis=0)
+    array([[-1,  2,  0, -2]])
+
+    >>> x = np.arange('1066-10-13', '1066-10-16', dtype=np.datetime64)
+    >>> np.diff(x)
+    array([1, 1], dtype='timedelta64[D]')
+
+    """
+    if n == 0:
+        return a
+    if n < 0:
+        raise ValueError(
+            "order must be non-negative but got " + repr(n))
+
+    a = asanyarray(a)
+    nd = a.ndim
+    if nd == 0:
+        raise ValueError("diff requires input that is at least one dimensional")
+    axis = normalize_axis_index(axis, nd)
+
+    combined = []
+    if prepend is not np._NoValue:
+        prepend = np.asanyarray(prepend)
+        if prepend.ndim == 0:
+            shape = list(a.shape)
+            shape[axis] = 1
+            prepend = np.broadcast_to(prepend, tuple(shape))
+        combined.append(prepend)
+
+    combined.append(a)
+
+    if append is not np._NoValue:
+        append = np.asanyarray(append)
+        if append.ndim == 0:
+            shape = list(a.shape)
+            shape[axis] = 1
+            append = np.broadcast_to(append, tuple(shape))
+        combined.append(append)
+
+    if len(combined) > 1:
+        a = np.concatenate(combined, axis)
+
+    slice1 = [slice(None)] * nd
+    slice2 = [slice(None)] * nd
+    slice1[axis] = slice(1, None)
+    slice2[axis] = slice(None, -1)
+    slice1 = tuple(slice1)
+    slice2 = tuple(slice2)
+
+    op = not_equal if a.dtype == np.bool_ else subtract
+    for _ in range(n):
+        a = op(a[slice1], a[slice2])
+
+    return a
+
+
+def _interp_dispatcher(x, xp, fp, left=None, right=None, period=None):
+    return (x, xp, fp)
+
+
+@array_function_dispatch(_interp_dispatcher)
+def interp(x, xp, fp, left=None, right=None, period=None):
+    """
+    One-dimensional linear interpolation.
+
+    Returns the one-dimensional piecewise linear interpolant to a function
+    with given discrete data points (`xp`, `fp`), evaluated at `x`.
+
+    Parameters
+    ----------
+    x : array_like
+        The x-coordinates at which to evaluate the interpolated values.
+
+    xp : 1-D sequence of floats
+        The x-coordinates of the data points, must be increasing if argument
+        `period` is not specified. Otherwise, `xp` is internally sorted after
+        normalizing the periodic boundaries with ``xp = xp % period``.
+
+    fp : 1-D sequence of float or complex
+        The y-coordinates of the data points, same length as `xp`.
+
+    left : optional float or complex corresponding to fp
+        Value to return for `x < xp[0]`, default is `fp[0]`.
+
+    right : optional float or complex corresponding to fp
+        Value to return for `x > xp[-1]`, default is `fp[-1]`.
+
+    period : None or float, optional
+        A period for the x-coordinates. This parameter allows the proper
+        interpolation of angular x-coordinates. Parameters `left` and `right`
+        are ignored if `period` is specified.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    y : float or complex (corresponding to fp) or ndarray
+        The interpolated values, same shape as `x`.
+
+    Raises
+    ------
+    ValueError
+        If `xp` and `fp` have different length
+        If `xp` or `fp` are not 1-D sequences
+        If `period == 0`
+
+    Notes
+    -----
+    The x-coordinate sequence is expected to be increasing, but this is not
+    explicitly enforced.  However, if the sequence `xp` is non-increasing,
+    interpolation results are meaningless.
+
+    Note that, since NaN is unsortable, `xp` also cannot contain NaNs.
+
+    A simple check for `xp` being strictly increasing is::
+
+        np.all(np.diff(xp) > 0)
+
+    Examples
+    --------
+    >>> xp = [1, 2, 3]
+    >>> fp = [3, 2, 0]
+    >>> np.interp(2.5, xp, fp)
+    1.0
+    >>> np.interp([0, 1, 1.5, 2.72, 3.14], xp, fp)
+    array([3.  , 3.  , 2.5 , 0.56, 0.  ])
+    >>> UNDEF = -99.0
+    >>> np.interp(3.14, xp, fp, right=UNDEF)
+    -99.0
+
+    Plot an interpolant to the sine function:
+
+    >>> x = np.linspace(0, 2*np.pi, 10)
+    >>> y = np.sin(x)
+    >>> xvals = np.linspace(0, 2*np.pi, 50)
+    >>> yinterp = np.interp(xvals, x, y)
+    >>> import matplotlib.pyplot as plt
+    >>> plt.plot(x, y, 'o')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.plot(xvals, yinterp, '-x')
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.show()
+
+    Interpolation with periodic x-coordinates:
+
+    >>> x = [-180, -170, -185, 185, -10, -5, 0, 365]
+    >>> xp = [190, -190, 350, -350]
+    >>> fp = [5, 10, 3, 4]
+    >>> np.interp(x, xp, fp, period=360)
+    array([7.5 , 5.  , 8.75, 6.25, 3.  , 3.25, 3.5 , 3.75])
+
+    Complex interpolation:
+
+    >>> x = [1.5, 4.0]
+    >>> xp = [2,3,5]
+    >>> fp = [1.0j, 0, 2+3j]
+    >>> np.interp(x, xp, fp)
+    array([0.+1.j , 1.+1.5j])
+
+    """
+
+    fp = np.asarray(fp)
+
+    if np.iscomplexobj(fp):
+        interp_func = compiled_interp_complex
+        input_dtype = np.complex128
+    else:
+        interp_func = compiled_interp
+        input_dtype = np.float64
+
+    if period is not None:
+        if period == 0:
+            raise ValueError("period must be a non-zero value")
+        period = abs(period)
+        left = None
+        right = None
+
+        x = np.asarray(x, dtype=np.float64)
+        xp = np.asarray(xp, dtype=np.float64)
+        fp = np.asarray(fp, dtype=input_dtype)
+
+        if xp.ndim != 1 or fp.ndim != 1:
+            raise ValueError("Data points must be 1-D sequences")
+        if xp.shape[0] != fp.shape[0]:
+            raise ValueError("fp and xp are not of the same length")
+        # normalizing periodic boundaries
+        x = x % period
+        xp = xp % period
+        asort_xp = np.argsort(xp)
+        xp = xp[asort_xp]
+        fp = fp[asort_xp]
+        xp = np.concatenate((xp[-1:]-period, xp, xp[0:1]+period))
+        fp = np.concatenate((fp[-1:], fp, fp[0:1]))
+
+    return interp_func(x, xp, fp, left, right)
+
+
+def _angle_dispatcher(z, deg=None):
+    return (z,)
+
+
+@array_function_dispatch(_angle_dispatcher)
+def angle(z, deg=False):
+    """
+    Return the angle of the complex argument.
+
+    Parameters
+    ----------
+    z : array_like
+        A complex number or sequence of complex numbers.
+    deg : bool, optional
+        Return angle in degrees if True, radians if False (default).
+
+    Returns
+    -------
+    angle : ndarray or scalar
+        The counterclockwise angle from the positive real axis on the complex
+        plane in the range ``(-pi, pi]``, with dtype as numpy.float64.
+
+        ..versionchanged:: 1.16.0
+            This function works on subclasses of ndarray like `ma.array`.
+
+    See Also
+    --------
+    arctan2
+    absolute
+
+    Notes
+    -----
+    Although the angle of the complex number 0 is undefined, ``numpy.angle(0)``
+    returns the value 0.
+
+    Examples
+    --------
+    >>> np.angle([1.0, 1.0j, 1+1j])               # in radians
+    array([ 0.        ,  1.57079633,  0.78539816]) # may vary
+    >>> np.angle(1+1j, deg=True)                  # in degrees
+    45.0
+
+    """
+    z = asanyarray(z)
+    if issubclass(z.dtype.type, _nx.complexfloating):
+        zimag = z.imag
+        zreal = z.real
+    else:
+        zimag = 0
+        zreal = z
+
+    a = arctan2(zimag, zreal)
+    if deg:
+        a *= 180/pi
+    return a
+
+
+def _unwrap_dispatcher(p, discont=None, axis=None):
+    return (p,)
+
+
+@array_function_dispatch(_unwrap_dispatcher)
+def unwrap(p, discont=pi, axis=-1):
+    """
+    Unwrap by changing deltas between values to 2*pi complement.
+
+    Unwrap radian phase `p` by changing absolute jumps greater than
+    `discont` to their 2*pi complement along the given axis.
+
+    Parameters
+    ----------
+    p : array_like
+        Input array.
+    discont : float, optional
+        Maximum discontinuity between values, default is ``pi``.
+    axis : int, optional
+        Axis along which unwrap will operate, default is the last axis.
+
+    Returns
+    -------
+    out : ndarray
+        Output array.
+
+    See Also
+    --------
+    rad2deg, deg2rad
+
+    Notes
+    -----
+    If the discontinuity in `p` is smaller than ``pi``, but larger than
+    `discont`, no unwrapping is done because taking the 2*pi complement
+    would only make the discontinuity larger.
+
+    Examples
+    --------
+    >>> phase = np.linspace(0, np.pi, num=5)
+    >>> phase[3:] += np.pi
+    >>> phase
+    array([ 0.        ,  0.78539816,  1.57079633,  5.49778714,  6.28318531]) # may vary
+    >>> np.unwrap(phase)
+    array([ 0.        ,  0.78539816,  1.57079633, -0.78539816,  0.        ]) # may vary
+
+    """
+    p = asarray(p)
+    nd = p.ndim
+    dd = diff(p, axis=axis)
+    slice1 = [slice(None, None)]*nd     # full slices
+    slice1[axis] = slice(1, None)
+    slice1 = tuple(slice1)
+    ddmod = mod(dd + pi, 2*pi) - pi
+    _nx.copyto(ddmod, pi, where=(ddmod == -pi) & (dd > 0))
+    ph_correct = ddmod - dd
+    _nx.copyto(ph_correct, 0, where=abs(dd) < discont)
+    up = array(p, copy=True, dtype='d')
+    up[slice1] = p[slice1] + ph_correct.cumsum(axis)
+    return up
+
+
+def _sort_complex(a):
+    return (a,)
+
+
+@array_function_dispatch(_sort_complex)
+def sort_complex(a):
+    """
+    Sort a complex array using the real part first, then the imaginary part.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array
+
+    Returns
+    -------
+    out : complex ndarray
+        Always returns a sorted complex array.
+
+    Examples
+    --------
+    >>> np.sort_complex([5, 3, 6, 2, 1])
+    array([1.+0.j, 2.+0.j, 3.+0.j, 5.+0.j, 6.+0.j])
+
+    >>> np.sort_complex([1 + 2j, 2 - 1j, 3 - 2j, 3 - 3j, 3 + 5j])
+    array([1.+2.j,  2.-1.j,  3.-3.j,  3.-2.j,  3.+5.j])
+
+    """
+    b = array(a, copy=True)
+    b.sort()
+    if not issubclass(b.dtype.type, _nx.complexfloating):
+        if b.dtype.char in 'bhBH':
+            return b.astype('F')
+        elif b.dtype.char == 'g':
+            return b.astype('G')
+        else:
+            return b.astype('D')
+    else:
+        return b
+
+
+def _trim_zeros(filt, trim=None):
+    return (filt,)
+
+
+@array_function_dispatch(_trim_zeros)
+def trim_zeros(filt, trim='fb'):
+    """
+    Trim the leading and/or trailing zeros from a 1-D array or sequence.
+
+    Parameters
+    ----------
+    filt : 1-D array or sequence
+        Input array.
+    trim : str, optional
+        A string with 'f' representing trim from front and 'b' to trim from
+        back. Default is 'fb', trim zeros from both front and back of the
+        array.
+
+    Returns
+    -------
+    trimmed : 1-D array or sequence
+        The result of trimming the input. The input data type is preserved.
+
+    Examples
+    --------
+    >>> a = np.array((0, 0, 0, 1, 2, 3, 0, 2, 1, 0))
+    >>> np.trim_zeros(a)
+    array([1, 2, 3, 0, 2, 1])
+
+    >>> np.trim_zeros(a, 'b')
+    array([0, 0, 0, ..., 0, 2, 1])
+
+    The input data type is preserved, list/tuple in means list/tuple out.
+
+    >>> np.trim_zeros([0, 1, 2, 0])
+    [1, 2]
+
+    """
+    first = 0
+    trim = trim.upper()
+    if 'F' in trim:
+        for i in filt:
+            if i != 0.:
+                break
+            else:
+                first = first + 1
+    last = len(filt)
+    if 'B' in trim:
+        for i in filt[::-1]:
+            if i != 0.:
+                break
+            else:
+                last = last - 1
+    return filt[first:last]
+
+
+def _extract_dispatcher(condition, arr):
+    return (condition, arr)
+
+
+@array_function_dispatch(_extract_dispatcher)
+def extract(condition, arr):
+    """
+    Return the elements of an array that satisfy some condition.
+
+    This is equivalent to ``np.compress(ravel(condition), ravel(arr))``.  If
+    `condition` is boolean ``np.extract`` is equivalent to ``arr[condition]``.
+
+    Note that `place` does the exact opposite of `extract`.
+
+    Parameters
+    ----------
+    condition : array_like
+        An array whose nonzero or True entries indicate the elements of `arr`
+        to extract.
+    arr : array_like
+        Input array of the same size as `condition`.
+
+    Returns
+    -------
+    extract : ndarray
+        Rank 1 array of values from `arr` where `condition` is True.
+
+    See Also
+    --------
+    take, put, copyto, compress, place
+
+    Examples
+    --------
+    >>> arr = np.arange(12).reshape((3, 4))
+    >>> arr
+    array([[ 0,  1,  2,  3],
+           [ 4,  5,  6,  7],
+           [ 8,  9, 10, 11]])
+    >>> condition = np.mod(arr, 3)==0
+    >>> condition
+    array([[ True, False, False,  True],
+           [False, False,  True, False],
+           [False,  True, False, False]])
+    >>> np.extract(condition, arr)
+    array([0, 3, 6, 9])
+
+
+    If `condition` is boolean:
+
+    >>> arr[condition]
+    array([0, 3, 6, 9])
+
+    """
+    return _nx.take(ravel(arr), nonzero(ravel(condition))[0])
+
+
+def _place_dispatcher(arr, mask, vals):
+    return (arr, mask, vals)
+
+
+@array_function_dispatch(_place_dispatcher)
+def place(arr, mask, vals):
+    """
+    Change elements of an array based on conditional and input values.
+
+    Similar to ``np.copyto(arr, vals, where=mask)``, the difference is that
+    `place` uses the first N elements of `vals`, where N is the number of
+    True values in `mask`, while `copyto` uses the elements where `mask`
+    is True.
+
+    Note that `extract` does the exact opposite of `place`.
+
+    Parameters
+    ----------
+    arr : ndarray
+        Array to put data into.
+    mask : array_like
+        Boolean mask array. Must have the same size as `a`.
+    vals : 1-D sequence
+        Values to put into `a`. Only the first N elements are used, where
+        N is the number of True values in `mask`. If `vals` is smaller
+        than N, it will be repeated, and if elements of `a` are to be masked,
+        this sequence must be non-empty.
+
+    See Also
+    --------
+    copyto, put, take, extract
+
+    Examples
+    --------
+    >>> arr = np.arange(6).reshape(2, 3)
+    >>> np.place(arr, arr>2, [44, 55])
+    >>> arr
+    array([[ 0,  1,  2],
+           [44, 55, 44]])
+
+    """
+    if not isinstance(arr, np.ndarray):
+        raise TypeError("argument 1 must be numpy.ndarray, "
+                        "not {name}".format(name=type(arr).__name__))
+
+    return _insert(arr, mask, vals)
+
+
+def disp(mesg, device=None, linefeed=True):
+    """
+    Display a message on a device.
+
+    Parameters
+    ----------
+    mesg : str
+        Message to display.
+    device : object
+        Device to write message. If None, defaults to ``sys.stdout`` which is
+        very similar to ``print``. `device` needs to have ``write()`` and
+        ``flush()`` methods.
+    linefeed : bool, optional
+        Option whether to print a line feed or not. Defaults to True.
+
+    Raises
+    ------
+    AttributeError
+        If `device` does not have a ``write()`` or ``flush()`` method.
+
+    Examples
+    --------
+    Besides ``sys.stdout``, a file-like object can also be used as it has
+    both required methods:
+
+    >>> from io import StringIO
+    >>> buf = StringIO()
+    >>> np.disp(u'"Display" in a file', device=buf)
+    >>> buf.getvalue()
+    '"Display" in a file\\n'
+
+    """
+    if device is None:
+        device = sys.stdout
+    if linefeed:
+        device.write('%s\n' % mesg)
+    else:
+        device.write('%s' % mesg)
+    device.flush()
+    return
+
+
+# See https://docs.scipy.org/doc/numpy/reference/c-api.generalized-ufuncs.html
+_DIMENSION_NAME = r'\w+'
+_CORE_DIMENSION_LIST = '(?:{0:}(?:,{0:})*)?'.format(_DIMENSION_NAME)
+_ARGUMENT = r'\({}\)'.format(_CORE_DIMENSION_LIST)
+_ARGUMENT_LIST = '{0:}(?:,{0:})*'.format(_ARGUMENT)
+_SIGNATURE = '^{0:}->{0:}$'.format(_ARGUMENT_LIST)
+
+
+def _parse_gufunc_signature(signature):
+    """
+    Parse string signatures for a generalized universal function.
+
+    Arguments
+    ---------
+    signature : string
+        Generalized universal function signature, e.g., ``(m,n),(n,p)->(m,p)``
+        for ``np.matmul``.
+
+    Returns
+    -------
+    Tuple of input and output core dimensions parsed from the signature, each
+    of the form List[Tuple[str, ...]].
+    """
+    if not re.match(_SIGNATURE, signature):
+        raise ValueError(
+            'not a valid gufunc signature: {}'.format(signature))
+    return tuple([tuple(re.findall(_DIMENSION_NAME, arg))
+                  for arg in re.findall(_ARGUMENT, arg_list)]
+                 for arg_list in signature.split('->'))
+
+
+def _update_dim_sizes(dim_sizes, arg, core_dims):
+    """
+    Incrementally check and update core dimension sizes for a single argument.
+
+    Arguments
+    ---------
+    dim_sizes : Dict[str, int]
+        Sizes of existing core dimensions. Will be updated in-place.
+    arg : ndarray
+        Argument to examine.
+    core_dims : Tuple[str, ...]
+        Core dimensions for this argument.
+    """
+    if not core_dims:
+        return
+
+    num_core_dims = len(core_dims)
+    if arg.ndim < num_core_dims:
+        raise ValueError(
+            '%d-dimensional argument does not have enough '
+            'dimensions for all core dimensions %r'
+            % (arg.ndim, core_dims))
+
+    core_shape = arg.shape[-num_core_dims:]
+    for dim, size in zip(core_dims, core_shape):
+        if dim in dim_sizes:
+            if size != dim_sizes[dim]:
+                raise ValueError(
+                    'inconsistent size for core dimension %r: %r vs %r'
+                    % (dim, size, dim_sizes[dim]))
+        else:
+            dim_sizes[dim] = size
+
+
+def _parse_input_dimensions(args, input_core_dims):
+    """
+    Parse broadcast and core dimensions for vectorize with a signature.
+
+    Arguments
+    ---------
+    args : Tuple[ndarray, ...]
+        Tuple of input arguments to examine.
+    input_core_dims : List[Tuple[str, ...]]
+        List of core dimensions corresponding to each input.
+
+    Returns
+    -------
+    broadcast_shape : Tuple[int, ...]
+        Common shape to broadcast all non-core dimensions to.
+    dim_sizes : Dict[str, int]
+        Common sizes for named core dimensions.
+    """
+    broadcast_args = []
+    dim_sizes = {}
+    for arg, core_dims in zip(args, input_core_dims):
+        _update_dim_sizes(dim_sizes, arg, core_dims)
+        ndim = arg.ndim - len(core_dims)
+        dummy_array = np.lib.stride_tricks.as_strided(0, arg.shape[:ndim])
+        broadcast_args.append(dummy_array)
+    broadcast_shape = np.lib.stride_tricks._broadcast_shape(*broadcast_args)
+    return broadcast_shape, dim_sizes
+
+
+def _calculate_shapes(broadcast_shape, dim_sizes, list_of_core_dims):
+    """Helper for calculating broadcast shapes with core dimensions."""
+    return [broadcast_shape + tuple(dim_sizes[dim] for dim in core_dims)
+            for core_dims in list_of_core_dims]
+
+
+def _create_arrays(broadcast_shape, dim_sizes, list_of_core_dims, dtypes):
+    """Helper for creating output arrays in vectorize."""
+    shapes = _calculate_shapes(broadcast_shape, dim_sizes, list_of_core_dims)
+    arrays = tuple(np.empty(shape, dtype=dtype)
+                   for shape, dtype in zip(shapes, dtypes))
+    return arrays
+
+
+@set_module('numpy')
+class vectorize:
+    """
+    vectorize(pyfunc, otypes=None, doc=None, excluded=None, cache=False,
+              signature=None)
+
+    Generalized function class.
+
+    Define a vectorized function which takes a nested sequence of objects or
+    numpy arrays as inputs and returns a single numpy array or a tuple of numpy
+    arrays. The vectorized function evaluates `pyfunc` over successive tuples
+    of the input arrays like the python map function, except it uses the
+    broadcasting rules of numpy.
+
+    The data type of the output of `vectorized` is determined by calling
+    the function with the first element of the input.  This can be avoided
+    by specifying the `otypes` argument.
+
+    Parameters
+    ----------
+    pyfunc : callable
+        A python function or method.
+    otypes : str or list of dtypes, optional
+        The output data type. It must be specified as either a string of
+        typecode characters or a list of data type specifiers. There should
+        be one data type specifier for each output.
+    doc : str, optional
+        The docstring for the function. If None, the docstring will be the
+        ``pyfunc.__doc__``.
+    excluded : set, optional
+        Set of strings or integers representing the positional or keyword
+        arguments for which the function will not be vectorized.  These will be
+        passed directly to `pyfunc` unmodified.
+
+        .. versionadded:: 1.7.0
+
+    cache : bool, optional
+       If `True`, then cache the first function call that determines the number
+       of outputs if `otypes` is not provided.
+
+        .. versionadded:: 1.7.0
+
+    signature : string, optional
+        Generalized universal function signature, e.g., ``(m,n),(n)->(m)`` for
+        vectorized matrix-vector multiplication. If provided, ``pyfunc`` will
+        be called with (and expected to return) arrays with shapes given by the
+        size of corresponding core dimensions. By default, ``pyfunc`` is
+        assumed to take scalars as input and output.
+
+        .. versionadded:: 1.12.0
+
+    Returns
+    -------
+    vectorized : callable
+        Vectorized function.
+
+    See Also
+    --------
+    frompyfunc : Takes an arbitrary Python function and returns a ufunc
+
+    Notes
+    -----
+    The `vectorize` function is provided primarily for convenience, not for
+    performance. The implementation is essentially a for loop.
+
+    If `otypes` is not specified, then a call to the function with the
+    first argument will be used to determine the number of outputs.  The
+    results of this call will be cached if `cache` is `True` to prevent
+    calling the function twice.  However, to implement the cache, the
+    original function must be wrapped which will slow down subsequent
+    calls, so only do this if your function is expensive.
+
+    The new keyword argument interface and `excluded` argument support
+    further degrades performance.
+
+    References
+    ----------
+    .. [1] NumPy Reference, section `Generalized Universal Function API
+           <https://docs.scipy.org/doc/numpy/reference/c-api.generalized-ufuncs.html>`_.
+
+    Examples
+    --------
+    >>> def myfunc(a, b):
+    ...     "Return a-b if a>b, otherwise return a+b"
+    ...     if a > b:
+    ...         return a - b
+    ...     else:
+    ...         return a + b
+
+    >>> vfunc = np.vectorize(myfunc)
+    >>> vfunc([1, 2, 3, 4], 2)
+    array([3, 4, 1, 2])
+
+    The docstring is taken from the input function to `vectorize` unless it
+    is specified:
+
+    >>> vfunc.__doc__
+    'Return a-b if a>b, otherwise return a+b'
+    >>> vfunc = np.vectorize(myfunc, doc='Vectorized `myfunc`')
+    >>> vfunc.__doc__
+    'Vectorized `myfunc`'
+
+    The output type is determined by evaluating the first element of the input,
+    unless it is specified:
+
+    >>> out = vfunc([1, 2, 3, 4], 2)
+    >>> type(out[0])
+    <class 'numpy.int64'>
+    >>> vfunc = np.vectorize(myfunc, otypes=[float])
+    >>> out = vfunc([1, 2, 3, 4], 2)
+    >>> type(out[0])
+    <class 'numpy.float64'>
+
+    The `excluded` argument can be used to prevent vectorizing over certain
+    arguments.  This can be useful for array-like arguments of a fixed length
+    such as the coefficients for a polynomial as in `polyval`:
+
+    >>> def mypolyval(p, x):
+    ...     _p = list(p)
+    ...     res = _p.pop(0)
+    ...     while _p:
+    ...         res = res*x + _p.pop(0)
+    ...     return res
+    >>> vpolyval = np.vectorize(mypolyval, excluded=['p'])
+    >>> vpolyval(p=[1, 2, 3], x=[0, 1])
+    array([3, 6])
+
+    Positional arguments may also be excluded by specifying their position:
+
+    >>> vpolyval.excluded.add(0)
+    >>> vpolyval([1, 2, 3], x=[0, 1])
+    array([3, 6])
+
+    The `signature` argument allows for vectorizing functions that act on
+    non-scalar arrays of fixed length. For example, you can use it for a
+    vectorized calculation of Pearson correlation coefficient and its p-value:
+
+    >>> import scipy.stats
+    >>> pearsonr = np.vectorize(scipy.stats.pearsonr,
+    ...                 signature='(n),(n)->(),()')
+    >>> pearsonr([[0, 1, 2, 3]], [[1, 2, 3, 4], [4, 3, 2, 1]])
+    (array([ 1., -1.]), array([ 0.,  0.]))
+
+    Or for a vectorized convolution:
+
+    >>> convolve = np.vectorize(np.convolve, signature='(n),(m)->(k)')
+    >>> convolve(np.eye(4), [1, 2, 1])
+    array([[1., 2., 1., 0., 0., 0.],
+           [0., 1., 2., 1., 0., 0.],
+           [0., 0., 1., 2., 1., 0.],
+           [0., 0., 0., 1., 2., 1.]])
+
+    """
+    def __init__(self, pyfunc, otypes=None, doc=None, excluded=None,
+                 cache=False, signature=None):
+        self.pyfunc = pyfunc
+        self.cache = cache
+        self.signature = signature
+        self._ufunc = {}    # Caching to improve default performance
+
+        if doc is None:
+            self.__doc__ = pyfunc.__doc__
+        else:
+            self.__doc__ = doc
+
+        if isinstance(otypes, str):
+            for char in otypes:
+                if char not in typecodes['All']:
+                    raise ValueError("Invalid otype specified: %s" % (char,))
+        elif iterable(otypes):
+            otypes = ''.join([_nx.dtype(x).char for x in otypes])
+        elif otypes is not None:
+            raise ValueError("Invalid otype specification")
+        self.otypes = otypes
+
+        # Excluded variable support
+        if excluded is None:
+            excluded = set()
+        self.excluded = set(excluded)
+
+        if signature is not None:
+            self._in_and_out_core_dims = _parse_gufunc_signature(signature)
+        else:
+            self._in_and_out_core_dims = None
+
+    def __call__(self, *args, **kwargs):
+        """
+        Return arrays with the results of `pyfunc` broadcast (vectorized) over
+        `args` and `kwargs` not in `excluded`.
+        """
+        excluded = self.excluded
+        if not kwargs and not excluded:
+            func = self.pyfunc
+            vargs = args
+        else:
+            # The wrapper accepts only positional arguments: we use `names` and
+            # `inds` to mutate `the_args` and `kwargs` to pass to the original
+            # function.
+            nargs = len(args)
+
+            names = [_n for _n in kwargs if _n not in excluded]
+            inds = [_i for _i in range(nargs) if _i not in excluded]
+            the_args = list(args)
+
+            def func(*vargs):
+                for _n, _i in enumerate(inds):
+                    the_args[_i] = vargs[_n]
+                kwargs.update(zip(names, vargs[len(inds):]))
+                return self.pyfunc(*the_args, **kwargs)
+
+            vargs = [args[_i] for _i in inds]
+            vargs.extend([kwargs[_n] for _n in names])
+
+        return self._vectorize_call(func=func, args=vargs)
+
+    def _get_ufunc_and_otypes(self, func, args):
+        """Return (ufunc, otypes)."""
+        # frompyfunc will fail if args is empty
+        if not args:
+            raise ValueError('args can not be empty')
+
+        if self.otypes is not None:
+            otypes = self.otypes
+
+            # self._ufunc is a dictionary whose keys are the number of
+            # arguments (i.e. len(args)) and whose values are ufuncs created
+            # by frompyfunc. len(args) can be different for different calls if
+            # self.pyfunc has parameters with default values.  We only use the
+            # cache when func is self.pyfunc, which occurs when the call uses
+            # only positional arguments and no arguments are excluded.
+
+            nin = len(args)
+            nout = len(self.otypes)
+            if func is not self.pyfunc or nin not in self._ufunc:
+                ufunc = frompyfunc(func, nin, nout)
+            else:
+                ufunc = None  # We'll get it from self._ufunc
+            if func is self.pyfunc:
+                ufunc = self._ufunc.setdefault(nin, ufunc)
+        else:
+            # Get number of outputs and output types by calling the function on
+            # the first entries of args.  We also cache the result to prevent
+            # the subsequent call when the ufunc is evaluated.
+            # Assumes that ufunc first evaluates the 0th elements in the input
+            # arrays (the input values are not checked to ensure this)
+            args = [asarray(arg) for arg in args]
+            if builtins.any(arg.size == 0 for arg in args):
+                raise ValueError('cannot call `vectorize` on size 0 inputs '
+                                 'unless `otypes` is set')
+
+            inputs = [arg.flat[0] for arg in args]
+            outputs = func(*inputs)
+
+            # Performance note: profiling indicates that -- for simple
+            # functions at least -- this wrapping can almost double the
+            # execution time.
+            # Hence we make it optional.
+            if self.cache:
+                _cache = [outputs]
+
+                def _func(*vargs):
+                    if _cache:
+                        return _cache.pop()
+                    else:
+                        return func(*vargs)
+            else:
+                _func = func
+
+            if isinstance(outputs, tuple):
+                nout = len(outputs)
+            else:
+                nout = 1
+                outputs = (outputs,)
+
+            otypes = ''.join([asarray(outputs[_k]).dtype.char
+                              for _k in range(nout)])
+
+            # Performance note: profiling indicates that creating the ufunc is
+            # not a significant cost compared with wrapping so it seems not
+            # worth trying to cache this.
+            ufunc = frompyfunc(_func, len(args), nout)
+
+        return ufunc, otypes
+
+    def _vectorize_call(self, func, args):
+        """Vectorized call to `func` over positional `args`."""
+        if self.signature is not None:
+            res = self._vectorize_call_with_signature(func, args)
+        elif not args:
+            res = func()
+        else:
+            ufunc, otypes = self._get_ufunc_and_otypes(func=func, args=args)
+
+            # Convert args to object arrays first
+            inputs = [array(a, copy=False, subok=True, dtype=object)
+                      for a in args]
+
+            outputs = ufunc(*inputs)
+
+            if ufunc.nout == 1:
+                res = array(outputs, copy=False, subok=True, dtype=otypes[0])
+            else:
+                res = tuple([array(x, copy=False, subok=True, dtype=t)
+                             for x, t in zip(outputs, otypes)])
+        return res
+
+    def _vectorize_call_with_signature(self, func, args):
+        """Vectorized call over positional arguments with a signature."""
+        input_core_dims, output_core_dims = self._in_and_out_core_dims
+
+        if len(args) != len(input_core_dims):
+            raise TypeError('wrong number of positional arguments: '
+                            'expected %r, got %r'
+                            % (len(input_core_dims), len(args)))
+        args = tuple(asanyarray(arg) for arg in args)
+
+        broadcast_shape, dim_sizes = _parse_input_dimensions(
+            args, input_core_dims)
+        input_shapes = _calculate_shapes(broadcast_shape, dim_sizes,
+                                         input_core_dims)
+        args = [np.broadcast_to(arg, shape, subok=True)
+                for arg, shape in zip(args, input_shapes)]
+
+        outputs = None
+        otypes = self.otypes
+        nout = len(output_core_dims)
+
+        for index in np.ndindex(*broadcast_shape):
+            results = func(*(arg[index] for arg in args))
+
+            n_results = len(results) if isinstance(results, tuple) else 1
+
+            if nout != n_results:
+                raise ValueError(
+                    'wrong number of outputs from pyfunc: expected %r, got %r'
+                    % (nout, n_results))
+
+            if nout == 1:
+                results = (results,)
+
+            if outputs is None:
+                for result, core_dims in zip(results, output_core_dims):
+                    _update_dim_sizes(dim_sizes, result, core_dims)
+
+                if otypes is None:
+                    otypes = [asarray(result).dtype for result in results]
+
+                outputs = _create_arrays(broadcast_shape, dim_sizes,
+                                         output_core_dims, otypes)
+
+            for output, result in zip(outputs, results):
+                output[index] = result
+
+        if outputs is None:
+            # did not call the function even once
+            if otypes is None:
+                raise ValueError('cannot call `vectorize` on size 0 inputs '
+                                 'unless `otypes` is set')
+            if builtins.any(dim not in dim_sizes
+                            for dims in output_core_dims
+                            for dim in dims):
+                raise ValueError('cannot call `vectorize` with a signature '
+                                 'including new output dimensions on size 0 '
+                                 'inputs')
+            outputs = _create_arrays(broadcast_shape, dim_sizes,
+                                     output_core_dims, otypes)
+
+        return outputs[0] if nout == 1 else outputs
+
+
+def _cov_dispatcher(m, y=None, rowvar=None, bias=None, ddof=None,
+                    fweights=None, aweights=None):
+    return (m, y, fweights, aweights)
+
+
+@array_function_dispatch(_cov_dispatcher)
+def cov(m, y=None, rowvar=True, bias=False, ddof=None, fweights=None,
+        aweights=None):
+    """
+    Estimate a covariance matrix, given data and weights.
+
+    Covariance indicates the level to which two variables vary together.
+    If we examine N-dimensional samples, :math:`X = [x_1, x_2, ... x_N]^T`,
+    then the covariance matrix element :math:`C_{ij}` is the covariance of
+    :math:`x_i` and :math:`x_j`. The element :math:`C_{ii}` is the variance
+    of :math:`x_i`.
+
+    See the notes for an outline of the algorithm.
+
+    Parameters
+    ----------
+    m : array_like
+        A 1-D or 2-D array containing multiple variables and observations.
+        Each row of `m` represents a variable, and each column a single
+        observation of all those variables. Also see `rowvar` below.
+    y : array_like, optional
+        An additional set of variables and observations. `y` has the same form
+        as that of `m`.
+    rowvar : bool, optional
+        If `rowvar` is True (default), then each row represents a
+        variable, with observations in the columns. Otherwise, the relationship
+        is transposed: each column represents a variable, while the rows
+        contain observations.
+    bias : bool, optional
+        Default normalization (False) is by ``(N - 1)``, where ``N`` is the
+        number of observations given (unbiased estimate). If `bias` is True,
+        then normalization is by ``N``. These values can be overridden by using
+        the keyword ``ddof`` in numpy versions >= 1.5.
+    ddof : int, optional
+        If not ``None`` the default value implied by `bias` is overridden.
+        Note that ``ddof=1`` will return the unbiased estimate, even if both
+        `fweights` and `aweights` are specified, and ``ddof=0`` will return
+        the simple average. See the notes for the details. The default value
+        is ``None``.
+
+        .. versionadded:: 1.5
+    fweights : array_like, int, optional
+        1-D array of integer frequency weights; the number of times each
+        observation vector should be repeated.
+
+        .. versionadded:: 1.10
+    aweights : array_like, optional
+        1-D array of observation vector weights. These relative weights are
+        typically large for observations considered "important" and smaller for
+        observations considered less "important". If ``ddof=0`` the array of
+        weights can be used to assign probabilities to observation vectors.
+
+        .. versionadded:: 1.10
+
+    Returns
+    -------
+    out : ndarray
+        The covariance matrix of the variables.
+
+    See Also
+    --------
+    corrcoef : Normalized covariance matrix
+
+    Notes
+    -----
+    Assume that the observations are in the columns of the observation
+    array `m` and let ``f = fweights`` and ``a = aweights`` for brevity. The
+    steps to compute the weighted covariance are as follows::
+
+        >>> m = np.arange(10, dtype=np.float64)
+        >>> f = np.arange(10) * 2
+        >>> a = np.arange(10) ** 2.
+        >>> ddof = 1
+        >>> w = f * a
+        >>> v1 = np.sum(w)
+        >>> v2 = np.sum(w * a)
+        >>> m -= np.sum(m * w, axis=None, keepdims=True) / v1
+        >>> cov = np.dot(m * w, m.T) * v1 / (v1**2 - ddof * v2)
+
+    Note that when ``a == 1``, the normalization factor
+    ``v1 / (v1**2 - ddof * v2)`` goes over to ``1 / (np.sum(f) - ddof)``
+    as it should.
+
+    Examples
+    --------
+    Consider two variables, :math:`x_0` and :math:`x_1`, which
+    correlate perfectly, but in opposite directions:
+
+    >>> x = np.array([[0, 2], [1, 1], [2, 0]]).T
+    >>> x
+    array([[0, 1, 2],
+           [2, 1, 0]])
+
+    Note how :math:`x_0` increases while :math:`x_1` decreases. The covariance
+    matrix shows this clearly:
+
+    >>> np.cov(x)
+    array([[ 1., -1.],
+           [-1.,  1.]])
+
+    Note that element :math:`C_{0,1}`, which shows the correlation between
+    :math:`x_0` and :math:`x_1`, is negative.
+
+    Further, note how `x` and `y` are combined:
+
+    >>> x = [-2.1, -1,  4.3]
+    >>> y = [3,  1.1,  0.12]
+    >>> X = np.stack((x, y), axis=0)
+    >>> np.cov(X)
+    array([[11.71      , -4.286     ], # may vary
+           [-4.286     ,  2.144133]])
+    >>> np.cov(x, y)
+    array([[11.71      , -4.286     ], # may vary
+           [-4.286     ,  2.144133]])
+    >>> np.cov(x)
+    array(11.71)
+
+    """
+    # Check inputs
+    if ddof is not None and ddof != int(ddof):
+        raise ValueError(
+            "ddof must be integer")
+
+    # Handles complex arrays too
+    m = np.asarray(m)
+    if m.ndim > 2:
+        raise ValueError("m has more than 2 dimensions")
+
+    if y is None:
+        dtype = np.result_type(m, np.float64)
+    else:
+        y = np.asarray(y)
+        if y.ndim > 2:
+            raise ValueError("y has more than 2 dimensions")
+        dtype = np.result_type(m, y, np.float64)
+
+    X = array(m, ndmin=2, dtype=dtype)
+    if not rowvar and X.shape[0] != 1:
+        X = X.T
+    if X.shape[0] == 0:
+        return np.array([]).reshape(0, 0)
+    if y is not None:
+        y = array(y, copy=False, ndmin=2, dtype=dtype)
+        if not rowvar and y.shape[0] != 1:
+            y = y.T
+        X = np.concatenate((X, y), axis=0)
+
+    if ddof is None:
+        if bias == 0:
+            ddof = 1
+        else:
+            ddof = 0
+
+    # Get the product of frequencies and weights
+    w = None
+    if fweights is not None:
+        fweights = np.asarray(fweights, dtype=float)
+        if not np.all(fweights == np.around(fweights)):
+            raise TypeError(
+                "fweights must be integer")
+        if fweights.ndim > 1:
+            raise RuntimeError(
+                "cannot handle multidimensional fweights")
+        if fweights.shape[0] != X.shape[1]:
+            raise RuntimeError(
+                "incompatible numbers of samples and fweights")
+        if any(fweights < 0):
+            raise ValueError(
+                "fweights cannot be negative")
+        w = fweights
+    if aweights is not None:
+        aweights = np.asarray(aweights, dtype=float)
+        if aweights.ndim > 1:
+            raise RuntimeError(
+                "cannot handle multidimensional aweights")
+        if aweights.shape[0] != X.shape[1]:
+            raise RuntimeError(
+                "incompatible numbers of samples and aweights")
+        if any(aweights < 0):
+            raise ValueError(
+                "aweights cannot be negative")
+        if w is None:
+            w = aweights
+        else:
+            w *= aweights
+
+    avg, w_sum = average(X, axis=1, weights=w, returned=True)
+    w_sum = w_sum[0]
+
+    # Determine the normalization
+    if w is None:
+        fact = X.shape[1] - ddof
+    elif ddof == 0:
+        fact = w_sum
+    elif aweights is None:
+        fact = w_sum - ddof
+    else:
+        fact = w_sum - ddof*sum(w*aweights)/w_sum
+
+    if fact <= 0:
+        warnings.warn("Degrees of freedom <= 0 for slice",
+                      RuntimeWarning, stacklevel=3)
+        fact = 0.0
+
+    X -= avg[:, None]
+    if w is None:
+        X_T = X.T
+    else:
+        X_T = (X*w).T
+    c = dot(X, X_T.conj())
+    c *= np.true_divide(1, fact)
+    return c.squeeze()
+
+
+def _corrcoef_dispatcher(x, y=None, rowvar=None, bias=None, ddof=None):
+    return (x, y)
+
+
+@array_function_dispatch(_corrcoef_dispatcher)
+def corrcoef(x, y=None, rowvar=True, bias=np._NoValue, ddof=np._NoValue):
+    """
+    Return Pearson product-moment correlation coefficients.
+
+    Please refer to the documentation for `cov` for more detail.  The
+    relationship between the correlation coefficient matrix, `R`, and the
+    covariance matrix, `C`, is
+
+    .. math:: R_{ij} = \\frac{ C_{ij} } { \\sqrt{ C_{ii} * C_{jj} } }
+
+    The values of `R` are between -1 and 1, inclusive.
+
+    Parameters
+    ----------
+    x : array_like
+        A 1-D or 2-D array containing multiple variables and observations.
+        Each row of `x` represents a variable, and each column a single
+        observation of all those variables. Also see `rowvar` below.
+    y : array_like, optional
+        An additional set of variables and observations. `y` has the same
+        shape as `x`.
+    rowvar : bool, optional
+        If `rowvar` is True (default), then each row represents a
+        variable, with observations in the columns. Otherwise, the relationship
+        is transposed: each column represents a variable, while the rows
+        contain observations.
+    bias : _NoValue, optional
+        Has no effect, do not use.
+
+        .. deprecated:: 1.10.0
+    ddof : _NoValue, optional
+        Has no effect, do not use.
+
+        .. deprecated:: 1.10.0
+
+    Returns
+    -------
+    R : ndarray
+        The correlation coefficient matrix of the variables.
+
+    See Also
+    --------
+    cov : Covariance matrix
+
+    Notes
+    -----
+    Due to floating point rounding the resulting array may not be Hermitian,
+    the diagonal elements may not be 1, and the elements may not satisfy the
+    inequality abs(a) <= 1. The real and imaginary parts are clipped to the
+    interval [-1,  1] in an attempt to improve on that situation but is not
+    much help in the complex case.
+
+    This function accepts but discards arguments `bias` and `ddof`.  This is
+    for backwards compatibility with previous versions of this function.  These
+    arguments had no effect on the return values of the function and can be
+    safely ignored in this and previous versions of numpy.
+
+    """
+    if bias is not np._NoValue or ddof is not np._NoValue:
+        # 2015-03-15, 1.10
+        warnings.warn('bias and ddof have no effect and are deprecated',
+                      DeprecationWarning, stacklevel=3)
+    c = cov(x, y, rowvar)
+    try:
+        d = diag(c)
+    except ValueError:
+        # scalar covariance
+        # nan if incorrect value (nan, inf, 0), 1 otherwise
+        return c / c
+    stddev = sqrt(d.real)
+    c /= stddev[:, None]
+    c /= stddev[None, :]
+
+    # Clip real and imaginary parts to [-1, 1].  This does not guarantee
+    # abs(a[i,j]) <= 1 for complex arrays, but is the best we can do without
+    # excessive work.
+    np.clip(c.real, -1, 1, out=c.real)
+    if np.iscomplexobj(c):
+        np.clip(c.imag, -1, 1, out=c.imag)
+
+    return c
+
+
+@set_module('numpy')
+def blackman(M):
+    """
+    Return the Blackman window.
+
+    The Blackman window is a taper formed by using the first three
+    terms of a summation of cosines. It was designed to have close to the
+    minimal leakage possible.  It is close to optimal, only slightly worse
+    than a Kaiser window.
+
+    Parameters
+    ----------
+    M : int
+        Number of points in the output window. If zero or less, an empty
+        array is returned.
+
+    Returns
+    -------
+    out : ndarray
+        The window, with the maximum value normalized to one (the value one
+        appears only if the number of samples is odd).
+
+    See Also
+    --------
+    bartlett, hamming, hanning, kaiser
+
+    Notes
+    -----
+    The Blackman window is defined as
+
+    .. math::  w(n) = 0.42 - 0.5 \\cos(2\\pi n/M) + 0.08 \\cos(4\\pi n/M)
+
+    Most references to the Blackman window come from the signal processing
+    literature, where it is used as one of many windowing functions for
+    smoothing values.  It is also known as an apodization (which means
+    "removing the foot", i.e. smoothing discontinuities at the beginning
+    and end of the sampled signal) or tapering function. It is known as a
+    "near optimal" tapering function, almost as good (by some measures)
+    as the kaiser window.
+
+    References
+    ----------
+    Blackman, R.B. and Tukey, J.W., (1958) The measurement of power spectra,
+    Dover Publications, New York.
+
+    Oppenheim, A.V., and R.W. Schafer. Discrete-Time Signal Processing.
+    Upper Saddle River, NJ: Prentice-Hall, 1999, pp. 468-471.
+
+    Examples
+    --------
+    >>> import matplotlib.pyplot as plt
+    >>> np.blackman(12)
+    array([-1.38777878e-17,   3.26064346e-02,   1.59903635e-01, # may vary
+            4.14397981e-01,   7.36045180e-01,   9.67046769e-01,
+            9.67046769e-01,   7.36045180e-01,   4.14397981e-01,
+            1.59903635e-01,   3.26064346e-02,  -1.38777878e-17])
+
+    Plot the window and the frequency response:
+
+    >>> from numpy.fft import fft, fftshift
+    >>> window = np.blackman(51)
+    >>> plt.plot(window)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Blackman window")
+    Text(0.5, 1.0, 'Blackman window')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("Sample")
+    Text(0.5, 0, 'Sample')
+    >>> plt.show()
+
+    >>> plt.figure()
+    <Figure size 640x480 with 0 Axes>
+    >>> A = fft(window, 2048) / 25.5
+    >>> mag = np.abs(fftshift(A))
+    >>> freq = np.linspace(-0.5, 0.5, len(A))
+    >>> with np.errstate(divide='ignore', invalid='ignore'):
+    ...     response = 20 * np.log10(mag)
+    ...
+    >>> response = np.clip(response, -100, 100)
+    >>> plt.plot(freq, response)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Frequency response of Blackman window")
+    Text(0.5, 1.0, 'Frequency response of Blackman window')
+    >>> plt.ylabel("Magnitude [dB]")
+    Text(0, 0.5, 'Magnitude [dB]')
+    >>> plt.xlabel("Normalized frequency [cycles per sample]")
+    Text(0.5, 0, 'Normalized frequency [cycles per sample]')
+    >>> _ = plt.axis('tight')
+    >>> plt.show()
+
+    """
+    if M < 1:
+        return array([])
+    if M == 1:
+        return ones(1, float)
+    n = arange(0, M)
+    return 0.42 - 0.5*cos(2.0*pi*n/(M-1)) + 0.08*cos(4.0*pi*n/(M-1))
+
+
+@set_module('numpy')
+def bartlett(M):
+    """
+    Return the Bartlett window.
+
+    The Bartlett window is very similar to a triangular window, except
+    that the end points are at zero.  It is often used in signal
+    processing for tapering a signal, without generating too much
+    ripple in the frequency domain.
+
+    Parameters
+    ----------
+    M : int
+        Number of points in the output window. If zero or less, an
+        empty array is returned.
+
+    Returns
+    -------
+    out : array
+        The triangular window, with the maximum value normalized to one
+        (the value one appears only if the number of samples is odd), with
+        the first and last samples equal to zero.
+
+    See Also
+    --------
+    blackman, hamming, hanning, kaiser
+
+    Notes
+    -----
+    The Bartlett window is defined as
+
+    .. math:: w(n) = \\frac{2}{M-1} \\left(
+              \\frac{M-1}{2} - \\left|n - \\frac{M-1}{2}\\right|
+              \\right)
+
+    Most references to the Bartlett window come from the signal
+    processing literature, where it is used as one of many windowing
+    functions for smoothing values.  Note that convolution with this
+    window produces linear interpolation.  It is also known as an
+    apodization (which means"removing the foot", i.e. smoothing
+    discontinuities at the beginning and end of the sampled signal) or
+    tapering function. The fourier transform of the Bartlett is the product
+    of two sinc functions.
+    Note the excellent discussion in Kanasewich.
+
+    References
+    ----------
+    .. [1] M.S. Bartlett, "Periodogram Analysis and Continuous Spectra",
+           Biometrika 37, 1-16, 1950.
+    .. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics",
+           The University of Alberta Press, 1975, pp. 109-110.
+    .. [3] A.V. Oppenheim and R.W. Schafer, "Discrete-Time Signal
+           Processing", Prentice-Hall, 1999, pp. 468-471.
+    .. [4] Wikipedia, "Window function",
+           https://en.wikipedia.org/wiki/Window_function
+    .. [5] W.H. Press,  B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
+           "Numerical Recipes", Cambridge University Press, 1986, page 429.
+
+    Examples
+    --------
+    >>> import matplotlib.pyplot as plt
+    >>> np.bartlett(12)
+    array([ 0.        ,  0.18181818,  0.36363636,  0.54545455,  0.72727273, # may vary
+            0.90909091,  0.90909091,  0.72727273,  0.54545455,  0.36363636,
+            0.18181818,  0.        ])
+
+    Plot the window and its frequency response (requires SciPy and matplotlib):
+
+    >>> from numpy.fft import fft, fftshift
+    >>> window = np.bartlett(51)
+    >>> plt.plot(window)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Bartlett window")
+    Text(0.5, 1.0, 'Bartlett window')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("Sample")
+    Text(0.5, 0, 'Sample')
+    >>> plt.show()
+
+    >>> plt.figure()
+    <Figure size 640x480 with 0 Axes>
+    >>> A = fft(window, 2048) / 25.5
+    >>> mag = np.abs(fftshift(A))
+    >>> freq = np.linspace(-0.5, 0.5, len(A))
+    >>> with np.errstate(divide='ignore', invalid='ignore'):
+    ...     response = 20 * np.log10(mag)
+    ...
+    >>> response = np.clip(response, -100, 100)
+    >>> plt.plot(freq, response)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Frequency response of Bartlett window")
+    Text(0.5, 1.0, 'Frequency response of Bartlett window')
+    >>> plt.ylabel("Magnitude [dB]")
+    Text(0, 0.5, 'Magnitude [dB]')
+    >>> plt.xlabel("Normalized frequency [cycles per sample]")
+    Text(0.5, 0, 'Normalized frequency [cycles per sample]')
+    >>> _ = plt.axis('tight')
+    >>> plt.show()
+
+    """
+    if M < 1:
+        return array([])
+    if M == 1:
+        return ones(1, float)
+    n = arange(0, M)
+    return where(less_equal(n, (M-1)/2.0), 2.0*n/(M-1), 2.0 - 2.0*n/(M-1))
+
+
+@set_module('numpy')
+def hanning(M):
+    """
+    Return the Hanning window.
+
+    The Hanning window is a taper formed by using a weighted cosine.
+
+    Parameters
+    ----------
+    M : int
+        Number of points in the output window. If zero or less, an
+        empty array is returned.
+
+    Returns
+    -------
+    out : ndarray, shape(M,)
+        The window, with the maximum value normalized to one (the value
+        one appears only if `M` is odd).
+
+    See Also
+    --------
+    bartlett, blackman, hamming, kaiser
+
+    Notes
+    -----
+    The Hanning window is defined as
+
+    .. math::  w(n) = 0.5 - 0.5cos\\left(\\frac{2\\pi{n}}{M-1}\\right)
+               \\qquad 0 \\leq n \\leq M-1
+
+    The Hanning was named for Julius von Hann, an Austrian meteorologist.
+    It is also known as the Cosine Bell. Some authors prefer that it be
+    called a Hann window, to help avoid confusion with the very similar
+    Hamming window.
+
+    Most references to the Hanning window come from the signal processing
+    literature, where it is used as one of many windowing functions for
+    smoothing values.  It is also known as an apodization (which means
+    "removing the foot", i.e. smoothing discontinuities at the beginning
+    and end of the sampled signal) or tapering function.
+
+    References
+    ----------
+    .. [1] Blackman, R.B. and Tukey, J.W., (1958) The measurement of power
+           spectra, Dover Publications, New York.
+    .. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics",
+           The University of Alberta Press, 1975, pp. 106-108.
+    .. [3] Wikipedia, "Window function",
+           https://en.wikipedia.org/wiki/Window_function
+    .. [4] W.H. Press,  B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
+           "Numerical Recipes", Cambridge University Press, 1986, page 425.
+
+    Examples
+    --------
+    >>> np.hanning(12)
+    array([0.        , 0.07937323, 0.29229249, 0.57115742, 0.82743037,
+           0.97974649, 0.97974649, 0.82743037, 0.57115742, 0.29229249,
+           0.07937323, 0.        ])
+
+    Plot the window and its frequency response:
+
+    >>> import matplotlib.pyplot as plt
+    >>> from numpy.fft import fft, fftshift
+    >>> window = np.hanning(51)
+    >>> plt.plot(window)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Hann window")
+    Text(0.5, 1.0, 'Hann window')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("Sample")
+    Text(0.5, 0, 'Sample')
+    >>> plt.show()
+
+    >>> plt.figure()
+    <Figure size 640x480 with 0 Axes>
+    >>> A = fft(window, 2048) / 25.5
+    >>> mag = np.abs(fftshift(A))
+    >>> freq = np.linspace(-0.5, 0.5, len(A))
+    >>> with np.errstate(divide='ignore', invalid='ignore'):
+    ...     response = 20 * np.log10(mag)
+    ...
+    >>> response = np.clip(response, -100, 100)
+    >>> plt.plot(freq, response)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Frequency response of the Hann window")
+    Text(0.5, 1.0, 'Frequency response of the Hann window')
+    >>> plt.ylabel("Magnitude [dB]")
+    Text(0, 0.5, 'Magnitude [dB]')
+    >>> plt.xlabel("Normalized frequency [cycles per sample]")
+    Text(0.5, 0, 'Normalized frequency [cycles per sample]')
+    >>> plt.axis('tight')
+    ...
+    >>> plt.show()
+
+    """
+    if M < 1:
+        return array([])
+    if M == 1:
+        return ones(1, float)
+    n = arange(0, M)
+    return 0.5 - 0.5*cos(2.0*pi*n/(M-1))
+
+
+@set_module('numpy')
+def hamming(M):
+    """
+    Return the Hamming window.
+
+    The Hamming window is a taper formed by using a weighted cosine.
+
+    Parameters
+    ----------
+    M : int
+        Number of points in the output window. If zero or less, an
+        empty array is returned.
+
+    Returns
+    -------
+    out : ndarray
+        The window, with the maximum value normalized to one (the value
+        one appears only if the number of samples is odd).
+
+    See Also
+    --------
+    bartlett, blackman, hanning, kaiser
+
+    Notes
+    -----
+    The Hamming window is defined as
+
+    .. math::  w(n) = 0.54 - 0.46cos\\left(\\frac{2\\pi{n}}{M-1}\\right)
+               \\qquad 0 \\leq n \\leq M-1
+
+    The Hamming was named for R. W. Hamming, an associate of J. W. Tukey
+    and is described in Blackman and Tukey. It was recommended for
+    smoothing the truncated autocovariance function in the time domain.
+    Most references to the Hamming window come from the signal processing
+    literature, where it is used as one of many windowing functions for
+    smoothing values.  It is also known as an apodization (which means
+    "removing the foot", i.e. smoothing discontinuities at the beginning
+    and end of the sampled signal) or tapering function.
+
+    References
+    ----------
+    .. [1] Blackman, R.B. and Tukey, J.W., (1958) The measurement of power
+           spectra, Dover Publications, New York.
+    .. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics", The
+           University of Alberta Press, 1975, pp. 109-110.
+    .. [3] Wikipedia, "Window function",
+           https://en.wikipedia.org/wiki/Window_function
+    .. [4] W.H. Press,  B.P. Flannery, S.A. Teukolsky, and W.T. Vetterling,
+           "Numerical Recipes", Cambridge University Press, 1986, page 425.
+
+    Examples
+    --------
+    >>> np.hamming(12)
+    array([ 0.08      ,  0.15302337,  0.34890909,  0.60546483,  0.84123594, # may vary
+            0.98136677,  0.98136677,  0.84123594,  0.60546483,  0.34890909,
+            0.15302337,  0.08      ])
+
+    Plot the window and the frequency response:
+
+    >>> import matplotlib.pyplot as plt
+    >>> from numpy.fft import fft, fftshift
+    >>> window = np.hamming(51)
+    >>> plt.plot(window)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Hamming window")
+    Text(0.5, 1.0, 'Hamming window')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("Sample")
+    Text(0.5, 0, 'Sample')
+    >>> plt.show()
+
+    >>> plt.figure()
+    <Figure size 640x480 with 0 Axes>
+    >>> A = fft(window, 2048) / 25.5
+    >>> mag = np.abs(fftshift(A))
+    >>> freq = np.linspace(-0.5, 0.5, len(A))
+    >>> response = 20 * np.log10(mag)
+    >>> response = np.clip(response, -100, 100)
+    >>> plt.plot(freq, response)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Frequency response of Hamming window")
+    Text(0.5, 1.0, 'Frequency response of Hamming window')
+    >>> plt.ylabel("Magnitude [dB]")
+    Text(0, 0.5, 'Magnitude [dB]')
+    >>> plt.xlabel("Normalized frequency [cycles per sample]")
+    Text(0.5, 0, 'Normalized frequency [cycles per sample]')
+    >>> plt.axis('tight')
+    ...
+    >>> plt.show()
+
+    """
+    if M < 1:
+        return array([])
+    if M == 1:
+        return ones(1, float)
+    n = arange(0, M)
+    return 0.54 - 0.46*cos(2.0*pi*n/(M-1))
+
+
+## Code from cephes for i0
+
+_i0A = [
+    -4.41534164647933937950E-18,
+    3.33079451882223809783E-17,
+    -2.43127984654795469359E-16,
+    1.71539128555513303061E-15,
+    -1.16853328779934516808E-14,
+    7.67618549860493561688E-14,
+    -4.85644678311192946090E-13,
+    2.95505266312963983461E-12,
+    -1.72682629144155570723E-11,
+    9.67580903537323691224E-11,
+    -5.18979560163526290666E-10,
+    2.65982372468238665035E-9,
+    -1.30002500998624804212E-8,
+    6.04699502254191894932E-8,
+    -2.67079385394061173391E-7,
+    1.11738753912010371815E-6,
+    -4.41673835845875056359E-6,
+    1.64484480707288970893E-5,
+    -5.75419501008210370398E-5,
+    1.88502885095841655729E-4,
+    -5.76375574538582365885E-4,
+    1.63947561694133579842E-3,
+    -4.32430999505057594430E-3,
+    1.05464603945949983183E-2,
+    -2.37374148058994688156E-2,
+    4.93052842396707084878E-2,
+    -9.49010970480476444210E-2,
+    1.71620901522208775349E-1,
+    -3.04682672343198398683E-1,
+    6.76795274409476084995E-1
+    ]
+
+_i0B = [
+    -7.23318048787475395456E-18,
+    -4.83050448594418207126E-18,
+    4.46562142029675999901E-17,
+    3.46122286769746109310E-17,
+    -2.82762398051658348494E-16,
+    -3.42548561967721913462E-16,
+    1.77256013305652638360E-15,
+    3.81168066935262242075E-15,
+    -9.55484669882830764870E-15,
+    -4.15056934728722208663E-14,
+    1.54008621752140982691E-14,
+    3.85277838274214270114E-13,
+    7.18012445138366623367E-13,
+    -1.79417853150680611778E-12,
+    -1.32158118404477131188E-11,
+    -3.14991652796324136454E-11,
+    1.18891471078464383424E-11,
+    4.94060238822496958910E-10,
+    3.39623202570838634515E-9,
+    2.26666899049817806459E-8,
+    2.04891858946906374183E-7,
+    2.89137052083475648297E-6,
+    6.88975834691682398426E-5,
+    3.36911647825569408990E-3,
+    8.04490411014108831608E-1
+    ]
+
+
+def _chbevl(x, vals):
+    b0 = vals[0]
+    b1 = 0.0
+
+    for i in range(1, len(vals)):
+        b2 = b1
+        b1 = b0
+        b0 = x*b1 - b2 + vals[i]
+
+    return 0.5*(b0 - b2)
+
+
+def _i0_1(x):
+    return exp(x) * _chbevl(x/2.0-2, _i0A)
+
+
+def _i0_2(x):
+    return exp(x) * _chbevl(32.0/x - 2.0, _i0B) / sqrt(x)
+
+
+def _i0_dispatcher(x):
+    return (x,)
+
+
+@array_function_dispatch(_i0_dispatcher)
+def i0(x):
+    """
+    Modified Bessel function of the first kind, order 0.
+
+    Usually denoted :math:`I_0`.  This function does broadcast, but will *not*
+    "up-cast" int dtype arguments unless accompanied by at least one float or
+    complex dtype argument (see Raises below).
+
+    Parameters
+    ----------
+    x : array_like, dtype float or complex
+        Argument of the Bessel function.
+
+    Returns
+    -------
+    out : ndarray, shape = x.shape, dtype = x.dtype
+        The modified Bessel function evaluated at each of the elements of `x`.
+
+    Raises
+    ------
+    TypeError: array cannot be safely cast to required type
+        If argument consists exclusively of int dtypes.
+
+    See Also
+    --------
+    scipy.special.i0, scipy.special.iv, scipy.special.ive
+
+    Notes
+    -----
+    The scipy implementation is recommended over this function: it is a
+    proper ufunc written in C, and more than an order of magnitude faster.
+
+    We use the algorithm published by Clenshaw [1]_ and referenced by
+    Abramowitz and Stegun [2]_, for which the function domain is
+    partitioned into the two intervals [0,8] and (8,inf), and Chebyshev
+    polynomial expansions are employed in each interval. Relative error on
+    the domain [0,30] using IEEE arithmetic is documented [3]_ as having a
+    peak of 5.8e-16 with an rms of 1.4e-16 (n = 30000).
+
+    References
+    ----------
+    .. [1] C. W. Clenshaw, "Chebyshev series for mathematical functions", in
+           *National Physical Laboratory Mathematical Tables*, vol. 5, London:
+           Her Majesty's Stationery Office, 1962.
+    .. [2] M. Abramowitz and I. A. Stegun, *Handbook of Mathematical
+           Functions*, 10th printing, New York: Dover, 1964, pp. 379.
+           http://www.math.sfu.ca/~cbm/aands/page_379.htm
+    .. [3] http://kobesearch.cpan.org/htdocs/Math-Cephes/Math/Cephes.html
+
+    Examples
+    --------
+    >>> np.i0(0.)
+    array(1.0)  # may vary
+    >>> np.i0([0., 1. + 2j])
+    array([ 1.00000000+0.j        ,  0.18785373+0.64616944j])  # may vary
+
+    """
+    x = np.asanyarray(x)
+    x = np.abs(x)
+    return piecewise(x, [x <= 8.0], [_i0_1, _i0_2])
+
+## End of cephes code for i0
+
+
+@set_module('numpy')
+def kaiser(M, beta):
+    """
+    Return the Kaiser window.
+
+    The Kaiser window is a taper formed by using a Bessel function.
+
+    Parameters
+    ----------
+    M : int
+        Number of points in the output window. If zero or less, an
+        empty array is returned.
+    beta : float
+        Shape parameter for window.
+
+    Returns
+    -------
+    out : array
+        The window, with the maximum value normalized to one (the value
+        one appears only if the number of samples is odd).
+
+    See Also
+    --------
+    bartlett, blackman, hamming, hanning
+
+    Notes
+    -----
+    The Kaiser window is defined as
+
+    .. math::  w(n) = I_0\\left( \\beta \\sqrt{1-\\frac{4n^2}{(M-1)^2}}
+               \\right)/I_0(\\beta)
+
+    with
+
+    .. math:: \\quad -\\frac{M-1}{2} \\leq n \\leq \\frac{M-1}{2},
+
+    where :math:`I_0` is the modified zeroth-order Bessel function.
+
+    The Kaiser was named for Jim Kaiser, who discovered a simple
+    approximation to the DPSS window based on Bessel functions.  The Kaiser
+    window is a very good approximation to the Digital Prolate Spheroidal
+    Sequence, or Slepian window, which is the transform which maximizes the
+    energy in the main lobe of the window relative to total energy.
+
+    The Kaiser can approximate many other windows by varying the beta
+    parameter.
+
+    ====  =======================
+    beta  Window shape
+    ====  =======================
+    0     Rectangular
+    5     Similar to a Hamming
+    6     Similar to a Hanning
+    8.6   Similar to a Blackman
+    ====  =======================
+
+    A beta value of 14 is probably a good starting point. Note that as beta
+    gets large, the window narrows, and so the number of samples needs to be
+    large enough to sample the increasingly narrow spike, otherwise NaNs will
+    get returned.
+
+    Most references to the Kaiser window come from the signal processing
+    literature, where it is used as one of many windowing functions for
+    smoothing values.  It is also known as an apodization (which means
+    "removing the foot", i.e. smoothing discontinuities at the beginning
+    and end of the sampled signal) or tapering function.
+
+    References
+    ----------
+    .. [1] J. F. Kaiser, "Digital Filters" - Ch 7 in "Systems analysis by
+           digital computer", Editors: F.F. Kuo and J.F. Kaiser, p 218-285.
+           John Wiley and Sons, New York, (1966).
+    .. [2] E.R. Kanasewich, "Time Sequence Analysis in Geophysics", The
+           University of Alberta Press, 1975, pp. 177-178.
+    .. [3] Wikipedia, "Window function",
+           https://en.wikipedia.org/wiki/Window_function
+
+    Examples
+    --------
+    >>> import matplotlib.pyplot as plt
+    >>> np.kaiser(12, 14)
+     array([7.72686684e-06, 3.46009194e-03, 4.65200189e-02, # may vary
+            2.29737120e-01, 5.99885316e-01, 9.45674898e-01,
+            9.45674898e-01, 5.99885316e-01, 2.29737120e-01,
+            4.65200189e-02, 3.46009194e-03, 7.72686684e-06])
+
+
+    Plot the window and the frequency response:
+
+    >>> from numpy.fft import fft, fftshift
+    >>> window = np.kaiser(51, 14)
+    >>> plt.plot(window)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Kaiser window")
+    Text(0.5, 1.0, 'Kaiser window')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("Sample")
+    Text(0.5, 0, 'Sample')
+    >>> plt.show()
+
+    >>> plt.figure()
+    <Figure size 640x480 with 0 Axes>
+    >>> A = fft(window, 2048) / 25.5
+    >>> mag = np.abs(fftshift(A))
+    >>> freq = np.linspace(-0.5, 0.5, len(A))
+    >>> response = 20 * np.log10(mag)
+    >>> response = np.clip(response, -100, 100)
+    >>> plt.plot(freq, response)
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Frequency response of Kaiser window")
+    Text(0.5, 1.0, 'Frequency response of Kaiser window')
+    >>> plt.ylabel("Magnitude [dB]")
+    Text(0, 0.5, 'Magnitude [dB]')
+    >>> plt.xlabel("Normalized frequency [cycles per sample]")
+    Text(0.5, 0, 'Normalized frequency [cycles per sample]')
+    >>> plt.axis('tight')
+    (-0.5, 0.5, -100.0, ...) # may vary
+    >>> plt.show()
+
+    """
+    from numpy.dual import i0
+    if M == 1:
+        return np.array([1.])
+    n = arange(0, M)
+    alpha = (M-1)/2.0
+    return i0(beta * sqrt(1-((n-alpha)/alpha)**2.0))/i0(float(beta))
+
+
+def _sinc_dispatcher(x):
+    return (x,)
+
+
+@array_function_dispatch(_sinc_dispatcher)
+def sinc(x):
+    """
+    Return the sinc function.
+
+    The sinc function is :math:`\\sin(\\pi x)/(\\pi x)`.
+
+    Parameters
+    ----------
+    x : ndarray
+        Array (possibly multi-dimensional) of values for which to to
+        calculate ``sinc(x)``.
+
+    Returns
+    -------
+    out : ndarray
+        ``sinc(x)``, which has the same shape as the input.
+
+    Notes
+    -----
+    ``sinc(0)`` is the limit value 1.
+
+    The name sinc is short for "sine cardinal" or "sinus cardinalis".
+
+    The sinc function is used in various signal processing applications,
+    including in anti-aliasing, in the construction of a Lanczos resampling
+    filter, and in interpolation.
+
+    For bandlimited interpolation of discrete-time signals, the ideal
+    interpolation kernel is proportional to the sinc function.
+
+    References
+    ----------
+    .. [1] Weisstein, Eric W. "Sinc Function." From MathWorld--A Wolfram Web
+           Resource. http://mathworld.wolfram.com/SincFunction.html
+    .. [2] Wikipedia, "Sinc function",
+           https://en.wikipedia.org/wiki/Sinc_function
+
+    Examples
+    --------
+    >>> import matplotlib.pyplot as plt
+    >>> x = np.linspace(-4, 4, 41)
+    >>> np.sinc(x)
+     array([-3.89804309e-17,  -4.92362781e-02,  -8.40918587e-02, # may vary
+            -8.90384387e-02,  -5.84680802e-02,   3.89804309e-17,
+            6.68206631e-02,   1.16434881e-01,   1.26137788e-01,
+            8.50444803e-02,  -3.89804309e-17,  -1.03943254e-01,
+            -1.89206682e-01,  -2.16236208e-01,  -1.55914881e-01,
+            3.89804309e-17,   2.33872321e-01,   5.04551152e-01,
+            7.56826729e-01,   9.35489284e-01,   1.00000000e+00,
+            9.35489284e-01,   7.56826729e-01,   5.04551152e-01,
+            2.33872321e-01,   3.89804309e-17,  -1.55914881e-01,
+           -2.16236208e-01,  -1.89206682e-01,  -1.03943254e-01,
+           -3.89804309e-17,   8.50444803e-02,   1.26137788e-01,
+            1.16434881e-01,   6.68206631e-02,   3.89804309e-17,
+            -5.84680802e-02,  -8.90384387e-02,  -8.40918587e-02,
+            -4.92362781e-02,  -3.89804309e-17])
+
+    >>> plt.plot(x, np.sinc(x))
+    [<matplotlib.lines.Line2D object at 0x...>]
+    >>> plt.title("Sinc Function")
+    Text(0.5, 1.0, 'Sinc Function')
+    >>> plt.ylabel("Amplitude")
+    Text(0, 0.5, 'Amplitude')
+    >>> plt.xlabel("X")
+    Text(0.5, 0, 'X')
+    >>> plt.show()
+
+    """
+    x = np.asanyarray(x)
+    y = pi * where(x == 0, 1.0e-20, x)
+    return sin(y)/y
+
+
+def _msort_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_msort_dispatcher)
+def msort(a):
+    """
+    Return a copy of an array sorted along the first axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Array to be sorted.
+
+    Returns
+    -------
+    sorted_array : ndarray
+        Array of the same type and shape as `a`.
+
+    See Also
+    --------
+    sort
+
+    Notes
+    -----
+    ``np.msort(a)`` is equivalent to  ``np.sort(a, axis=0)``.
+
+    """
+    b = array(a, subok=True, copy=True)
+    b.sort(0)
+    return b
+
+
+def _ureduce(a, func, **kwargs):
+    """
+    Internal Function.
+    Call `func` with `a` as first argument swapping the axes to use extended
+    axis on functions that don't support it natively.
+
+    Returns result and a.shape with axis dims set to 1.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    func : callable
+        Reduction function capable of receiving a single axis argument.
+        It is called with `a` as first argument followed by `kwargs`.
+    kwargs : keyword arguments
+        additional keyword arguments to pass to `func`.
+
+    Returns
+    -------
+    result : tuple
+        Result of func(a, **kwargs) and a.shape with axis dims set to 1
+        which can be used to reshape the result to the same shape a ufunc with
+        keepdims=True would produce.
+
+    """
+    a = np.asanyarray(a)
+    axis = kwargs.get('axis', None)
+    if axis is not None:
+        keepdim = list(a.shape)
+        nd = a.ndim
+        axis = _nx.normalize_axis_tuple(axis, nd)
+
+        for ax in axis:
+            keepdim[ax] = 1
+
+        if len(axis) == 1:
+            kwargs['axis'] = axis[0]
+        else:
+            keep = set(range(nd)) - set(axis)
+            nkeep = len(keep)
+            # swap axis that should not be reduced to front
+            for i, s in enumerate(sorted(keep)):
+                a = a.swapaxes(i, s)
+            # merge reduced axis
+            a = a.reshape(a.shape[:nkeep] + (-1,))
+            kwargs['axis'] = -1
+        keepdim = tuple(keepdim)
+    else:
+        keepdim = (1,) * a.ndim
+
+    r = func(a, **kwargs)
+    return r, keepdim
+
+
+def _median_dispatcher(
+        a, axis=None, out=None, overwrite_input=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_median_dispatcher)
+def median(a, axis=None, out=None, overwrite_input=False, keepdims=False):
+    """
+    Compute the median along the specified axis.
+
+    Returns the median of the array elements.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    axis : {int, sequence of int, None}, optional
+        Axis or axes along which the medians are computed. The default
+        is to compute the median along a flattened version of the array.
+        A sequence of axes is supported since version 1.9.0.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+       If True, then allow use of memory of input array `a` for
+       calculations. The input array will be modified by the call to
+       `median`. This will save memory when you do not need to preserve
+       the contents of the input array. Treat the input as undefined,
+       but it will probably be fully or partially sorted. Default is
+       False. If `overwrite_input` is ``True`` and `a` is not already an
+       `ndarray`, an error will be raised.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `arr`.
+
+        .. versionadded:: 1.9.0
+
+    Returns
+    -------
+    median : ndarray
+        A new array holding the result. If the input contains integers
+        or floats smaller than ``float64``, then the output data-type is
+        ``np.float64``.  Otherwise, the data-type of the output is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    mean, percentile
+
+    Notes
+    -----
+    Given a vector ``V`` of length ``N``, the median of ``V`` is the
+    middle value of a sorted copy of ``V``, ``V_sorted`` - i
+    e., ``V_sorted[(N-1)/2]``, when ``N`` is odd, and the average of the
+    two middle values of ``V_sorted`` when ``N`` is even.
+
+    Examples
+    --------
+    >>> a = np.array([[10, 7, 4], [3, 2, 1]])
+    >>> a
+    array([[10,  7,  4],
+           [ 3,  2,  1]])
+    >>> np.median(a)
+    3.5
+    >>> np.median(a, axis=0)
+    array([6.5, 4.5, 2.5])
+    >>> np.median(a, axis=1)
+    array([7.,  2.])
+    >>> m = np.median(a, axis=0)
+    >>> out = np.zeros_like(m)
+    >>> np.median(a, axis=0, out=m)
+    array([6.5,  4.5,  2.5])
+    >>> m
+    array([6.5,  4.5,  2.5])
+    >>> b = a.copy()
+    >>> np.median(b, axis=1, overwrite_input=True)
+    array([7.,  2.])
+    >>> assert not np.all(a==b)
+    >>> b = a.copy()
+    >>> np.median(b, axis=None, overwrite_input=True)
+    3.5
+    >>> assert not np.all(a==b)
+
+    """
+    r, k = _ureduce(a, func=_median, axis=axis, out=out,
+                    overwrite_input=overwrite_input)
+    if keepdims:
+        return r.reshape(k)
+    else:
+        return r
+
+
+def _median(a, axis=None, out=None, overwrite_input=False):
+    # can't be reasonably be implemented in terms of percentile as we have to
+    # call mean to not break astropy
+    a = np.asanyarray(a)
+
+    # Set the partition indexes
+    if axis is None:
+        sz = a.size
+    else:
+        sz = a.shape[axis]
+    if sz % 2 == 0:
+        szh = sz // 2
+        kth = [szh - 1, szh]
+    else:
+        kth = [(sz - 1) // 2]
+    # Check if the array contains any nan's
+    if np.issubdtype(a.dtype, np.inexact):
+        kth.append(-1)
+
+    if overwrite_input:
+        if axis is None:
+            part = a.ravel()
+            part.partition(kth)
+        else:
+            a.partition(kth, axis=axis)
+            part = a
+    else:
+        part = partition(a, kth, axis=axis)
+
+    if part.shape == ():
+        # make 0-D arrays work
+        return part.item()
+    if axis is None:
+        axis = 0
+
+    indexer = [slice(None)] * part.ndim
+    index = part.shape[axis] // 2
+    if part.shape[axis] % 2 == 1:
+        # index with slice to allow mean (below) to work
+        indexer[axis] = slice(index, index+1)
+    else:
+        indexer[axis] = slice(index-1, index+1)
+    indexer = tuple(indexer)
+
+    # Check if the array contains any nan's
+    if np.issubdtype(a.dtype, np.inexact) and sz > 0:
+        # warn and return nans like mean would
+        rout = mean(part[indexer], axis=axis, out=out)
+        return np.lib.utils._median_nancheck(part, rout, axis, out)
+    else:
+        # if there are no nans
+        # Use mean in odd and even case to coerce data type
+        # and check, use out array.
+        return mean(part[indexer], axis=axis, out=out)
+
+
+def _percentile_dispatcher(a, q, axis=None, out=None, overwrite_input=None,
+                           interpolation=None, keepdims=None):
+    return (a, q, out)
+
+
+@array_function_dispatch(_percentile_dispatcher)
+def percentile(a, q, axis=None, out=None,
+               overwrite_input=False, interpolation='linear', keepdims=False):
+    """
+    Compute the q-th percentile of the data along the specified axis.
+
+    Returns the q-th percentile(s) of the array elements.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    q : array_like of float
+        Percentile or sequence of percentiles to compute, which must be between
+        0 and 100 inclusive.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the percentiles are computed. The
+        default is to compute the percentile(s) along a flattened
+        version of the array.
+
+        .. versionchanged:: 1.9.0
+            A tuple of axes is supported
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+        If True, then allow the input array `a` to be modified by intermediate
+        calculations, to save memory. In this case, the contents of the input
+        `a` after this function completes is undefined.
+
+    interpolation : {'linear', 'lower', 'higher', 'midpoint', 'nearest'}
+        This optional parameter specifies the interpolation method to
+        use when the desired percentile lies between two data points
+        ``i < j``:
+
+        * 'linear': ``i + (j - i) * fraction``, where ``fraction``
+          is the fractional part of the index surrounded by ``i``
+          and ``j``.
+        * 'lower': ``i``.
+        * 'higher': ``j``.
+        * 'nearest': ``i`` or ``j``, whichever is nearest.
+        * 'midpoint': ``(i + j) / 2``.
+
+        .. versionadded:: 1.9.0
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left in
+        the result as dimensions with size one. With this option, the
+        result will broadcast correctly against the original array `a`.
+
+        .. versionadded:: 1.9.0
+
+    Returns
+    -------
+    percentile : scalar or ndarray
+        If `q` is a single percentile and `axis=None`, then the result
+        is a scalar. If multiple percentiles are given, first axis of
+        the result corresponds to the percentiles. The other axes are
+        the axes that remain after the reduction of `a`. If the input
+        contains integers or floats smaller than ``float64``, the output
+        data-type is ``float64``. Otherwise, the output data-type is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    mean
+    median : equivalent to ``percentile(..., 50)``
+    nanpercentile
+    quantile : equivalent to percentile, except with q in the range [0, 1].
+
+    Notes
+    -----
+    Given a vector ``V`` of length ``N``, the q-th percentile of
+    ``V`` is the value ``q/100`` of the way from the minimum to the
+    maximum in a sorted copy of ``V``. The values and distances of
+    the two nearest neighbors as well as the `interpolation` parameter
+    will determine the percentile if the normalized ranking does not
+    match the location of ``q`` exactly. This function is the same as
+    the median if ``q=50``, the same as the minimum if ``q=0`` and the
+    same as the maximum if ``q=100``.
+
+    Examples
+    --------
+    >>> a = np.array([[10, 7, 4], [3, 2, 1]])
+    >>> a
+    array([[10,  7,  4],
+           [ 3,  2,  1]])
+    >>> np.percentile(a, 50)
+    3.5
+    >>> np.percentile(a, 50, axis=0)
+    array([6.5, 4.5, 2.5])
+    >>> np.percentile(a, 50, axis=1)
+    array([7.,  2.])
+    >>> np.percentile(a, 50, axis=1, keepdims=True)
+    array([[7.],
+           [2.]])
+
+    >>> m = np.percentile(a, 50, axis=0)
+    >>> out = np.zeros_like(m)
+    >>> np.percentile(a, 50, axis=0, out=out)
+    array([6.5, 4.5, 2.5])
+    >>> m
+    array([6.5, 4.5, 2.5])
+
+    >>> b = a.copy()
+    >>> np.percentile(b, 50, axis=1, overwrite_input=True)
+    array([7.,  2.])
+    >>> assert not np.all(a == b)
+
+    The different types of interpolation can be visualized graphically:
+
+    .. plot::
+
+        import matplotlib.pyplot as plt
+
+        a = np.arange(4)
+        p = np.linspace(0, 100, 6001)
+        ax = plt.gca()
+        lines = [
+            ('linear', None),
+            ('higher', '--'),
+            ('lower', '--'),
+            ('nearest', '-.'),
+            ('midpoint', '-.'),
+        ]
+        for interpolation, style in lines:
+            ax.plot(
+                p, np.percentile(a, p, interpolation=interpolation),
+                label=interpolation, linestyle=style)
+        ax.set(
+            title='Interpolation methods for list: ' + str(a),
+            xlabel='Percentile',
+            ylabel='List item returned',
+            yticks=a)
+        ax.legend()
+        plt.show()
+
+    """
+    q = np.true_divide(q, 100)
+    q = asanyarray(q)  # undo any decay that the ufunc performed (see gh-13105)
+    if not _quantile_is_valid(q):
+        raise ValueError("Percentiles must be in the range [0, 100]")
+    return _quantile_unchecked(
+        a, q, axis, out, overwrite_input, interpolation, keepdims)
+
+
+def _quantile_dispatcher(a, q, axis=None, out=None, overwrite_input=None,
+                         interpolation=None, keepdims=None):
+    return (a, q, out)
+
+
+@array_function_dispatch(_quantile_dispatcher)
+def quantile(a, q, axis=None, out=None,
+             overwrite_input=False, interpolation='linear', keepdims=False):
+    """
+    Compute the q-th quantile of the data along the specified axis.
+
+    .. versionadded:: 1.15.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    q : array_like of float
+        Quantile or sequence of quantiles to compute, which must be between
+        0 and 1 inclusive.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the quantiles are computed. The
+        default is to compute the quantile(s) along a flattened
+        version of the array.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+        If True, then allow the input array `a` to be modified by intermediate
+        calculations, to save memory. In this case, the contents of the input
+        `a` after this function completes is undefined.
+    interpolation : {'linear', 'lower', 'higher', 'midpoint', 'nearest'}
+        This optional parameter specifies the interpolation method to
+        use when the desired quantile lies between two data points
+        ``i < j``:
+
+            * linear: ``i + (j - i) * fraction``, where ``fraction``
+              is the fractional part of the index surrounded by ``i``
+              and ``j``.
+            * lower: ``i``.
+            * higher: ``j``.
+            * nearest: ``i`` or ``j``, whichever is nearest.
+            * midpoint: ``(i + j) / 2``.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left in
+        the result as dimensions with size one. With this option, the
+        result will broadcast correctly against the original array `a`.
+
+    Returns
+    -------
+    quantile : scalar or ndarray
+        If `q` is a single quantile and `axis=None`, then the result
+        is a scalar. If multiple quantiles are given, first axis of
+        the result corresponds to the quantiles. The other axes are
+        the axes that remain after the reduction of `a`. If the input
+        contains integers or floats smaller than ``float64``, the output
+        data-type is ``float64``. Otherwise, the output data-type is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    mean
+    percentile : equivalent to quantile, but with q in the range [0, 100].
+    median : equivalent to ``quantile(..., 0.5)``
+    nanquantile
+
+    Notes
+    -----
+    Given a vector ``V`` of length ``N``, the q-th quantile of
+    ``V`` is the value ``q`` of the way from the minimum to the
+    maximum in a sorted copy of ``V``. The values and distances of
+    the two nearest neighbors as well as the `interpolation` parameter
+    will determine the quantile if the normalized ranking does not
+    match the location of ``q`` exactly. This function is the same as
+    the median if ``q=0.5``, the same as the minimum if ``q=0.0`` and the
+    same as the maximum if ``q=1.0``.
+
+    Examples
+    --------
+    >>> a = np.array([[10, 7, 4], [3, 2, 1]])
+    >>> a
+    array([[10,  7,  4],
+           [ 3,  2,  1]])
+    >>> np.quantile(a, 0.5)
+    3.5
+    >>> np.quantile(a, 0.5, axis=0)
+    array([6.5, 4.5, 2.5])
+    >>> np.quantile(a, 0.5, axis=1)
+    array([7.,  2.])
+    >>> np.quantile(a, 0.5, axis=1, keepdims=True)
+    array([[7.],
+           [2.]])
+    >>> m = np.quantile(a, 0.5, axis=0)
+    >>> out = np.zeros_like(m)
+    >>> np.quantile(a, 0.5, axis=0, out=out)
+    array([6.5, 4.5, 2.5])
+    >>> m
+    array([6.5, 4.5, 2.5])
+    >>> b = a.copy()
+    >>> np.quantile(b, 0.5, axis=1, overwrite_input=True)
+    array([7.,  2.])
+    >>> assert not np.all(a == b)
+    """
+    q = np.asanyarray(q)
+    if not _quantile_is_valid(q):
+        raise ValueError("Quantiles must be in the range [0, 1]")
+    return _quantile_unchecked(
+        a, q, axis, out, overwrite_input, interpolation, keepdims)
+
+
+def _quantile_unchecked(a, q, axis=None, out=None, overwrite_input=False,
+                        interpolation='linear', keepdims=False):
+    """Assumes that q is in [0, 1], and is an ndarray"""
+    r, k = _ureduce(a, func=_quantile_ureduce_func, q=q, axis=axis, out=out,
+                    overwrite_input=overwrite_input,
+                    interpolation=interpolation)
+    if keepdims:
+        return r.reshape(q.shape + k)
+    else:
+        return r
+
+
+def _quantile_is_valid(q):
+    # avoid expensive reductions, relevant for arrays with < O(1000) elements
+    if q.ndim == 1 and q.size < 10:
+        for i in range(q.size):
+            if q[i] < 0.0 or q[i] > 1.0:
+                return False
+    else:
+        # faster than any()
+        if np.count_nonzero(q < 0.0) or np.count_nonzero(q > 1.0):
+            return False
+    return True
+
+
+def _quantile_ureduce_func(a, q, axis=None, out=None, overwrite_input=False,
+                           interpolation='linear', keepdims=False):
+    a = asarray(a)
+    if q.ndim == 0:
+        # Do not allow 0-d arrays because following code fails for scalar
+        zerod = True
+        q = q[None]
+    else:
+        zerod = False
+
+    # prepare a for partitioning
+    if overwrite_input:
+        if axis is None:
+            ap = a.ravel()
+        else:
+            ap = a
+    else:
+        if axis is None:
+            ap = a.flatten()
+        else:
+            ap = a.copy()
+
+    if axis is None:
+        axis = 0
+
+    Nx = ap.shape[axis]
+    indices = q * (Nx - 1)
+
+    # round fractional indices according to interpolation method
+    if interpolation == 'lower':
+        indices = floor(indices).astype(intp)
+    elif interpolation == 'higher':
+        indices = ceil(indices).astype(intp)
+    elif interpolation == 'midpoint':
+        indices = 0.5 * (floor(indices) + ceil(indices))
+    elif interpolation == 'nearest':
+        indices = around(indices).astype(intp)
+    elif interpolation == 'linear':
+        pass  # keep index as fraction and interpolate
+    else:
+        raise ValueError(
+            "interpolation can only be 'linear', 'lower' 'higher', "
+            "'midpoint', or 'nearest'")
+
+    n = np.array(False, dtype=bool)  # check for nan's flag
+    if np.issubdtype(indices.dtype, np.integer):  # take the points along axis
+        # Check if the array contains any nan's
+        if np.issubdtype(a.dtype, np.inexact):
+            indices = concatenate((indices, [-1]))
+
+        ap.partition(indices, axis=axis)
+        # ensure axis with q-th is first
+        ap = np.moveaxis(ap, axis, 0)
+        axis = 0
+
+        # Check if the array contains any nan's
+        if np.issubdtype(a.dtype, np.inexact):
+            indices = indices[:-1]
+            n = np.isnan(ap[-1:, ...])
+
+        if zerod:
+            indices = indices[0]
+        r = take(ap, indices, axis=axis, out=out)
+
+    else:  # weight the points above and below the indices
+        indices_below = floor(indices).astype(intp)
+        indices_above = indices_below + 1
+        indices_above[indices_above > Nx - 1] = Nx - 1
+
+        # Check if the array contains any nan's
+        if np.issubdtype(a.dtype, np.inexact):
+            indices_above = concatenate((indices_above, [-1]))
+
+        weights_above = indices - indices_below
+        weights_below = 1 - weights_above
+
+        weights_shape = [1, ] * ap.ndim
+        weights_shape[axis] = len(indices)
+        weights_below.shape = weights_shape
+        weights_above.shape = weights_shape
+
+        ap.partition(concatenate((indices_below, indices_above)), axis=axis)
+
+        # ensure axis with q-th is first
+        ap = np.moveaxis(ap, axis, 0)
+        weights_below = np.moveaxis(weights_below, axis, 0)
+        weights_above = np.moveaxis(weights_above, axis, 0)
+        axis = 0
+
+        # Check if the array contains any nan's
+        if np.issubdtype(a.dtype, np.inexact):
+            indices_above = indices_above[:-1]
+            n = np.isnan(ap[-1:, ...])
+
+        x1 = take(ap, indices_below, axis=axis) * weights_below
+        x2 = take(ap, indices_above, axis=axis) * weights_above
+
+        # ensure axis with q-th is first
+        x1 = np.moveaxis(x1, axis, 0)
+        x2 = np.moveaxis(x2, axis, 0)
+
+        if zerod:
+            x1 = x1.squeeze(0)
+            x2 = x2.squeeze(0)
+
+        if out is not None:
+            r = add(x1, x2, out=out)
+        else:
+            r = add(x1, x2)
+
+    if np.any(n):
+        if zerod:
+            if ap.ndim == 1:
+                if out is not None:
+                    out[...] = a.dtype.type(np.nan)
+                    r = out
+                else:
+                    r = a.dtype.type(np.nan)
+            else:
+                r[..., n.squeeze(0)] = a.dtype.type(np.nan)
+        else:
+            if r.ndim == 1:
+                r[:] = a.dtype.type(np.nan)
+            else:
+                r[..., n.repeat(q.size, 0)] = a.dtype.type(np.nan)
+
+    return r
+
+
+def _trapz_dispatcher(y, x=None, dx=None, axis=None):
+    return (y, x)
+
+
+@array_function_dispatch(_trapz_dispatcher)
+def trapz(y, x=None, dx=1.0, axis=-1):
+    """
+    Integrate along the given axis using the composite trapezoidal rule.
+
+    Integrate `y` (`x`) along given axis.
+
+    Parameters
+    ----------
+    y : array_like
+        Input array to integrate.
+    x : array_like, optional
+        The sample points corresponding to the `y` values. If `x` is None,
+        the sample points are assumed to be evenly spaced `dx` apart. The
+        default is None.
+    dx : scalar, optional
+        The spacing between sample points when `x` is None. The default is 1.
+    axis : int, optional
+        The axis along which to integrate.
+
+    Returns
+    -------
+    trapz : float
+        Definite integral as approximated by trapezoidal rule.
+
+    See Also
+    --------
+    sum, cumsum
+
+    Notes
+    -----
+    Image [2]_ illustrates trapezoidal rule -- y-axis locations of points
+    will be taken from `y` array, by default x-axis distances between
+    points will be 1.0, alternatively they can be provided with `x` array
+    or with `dx` scalar.  Return value will be equal to combined area under
+    the red lines.
+
+
+    References
+    ----------
+    .. [1] Wikipedia page: https://en.wikipedia.org/wiki/Trapezoidal_rule
+
+    .. [2] Illustration image:
+           https://en.wikipedia.org/wiki/File:Composite_trapezoidal_rule_illustration.png
+
+    Examples
+    --------
+    >>> np.trapz([1,2,3])
+    4.0
+    >>> np.trapz([1,2,3], x=[4,6,8])
+    8.0
+    >>> np.trapz([1,2,3], dx=2)
+    8.0
+    >>> a = np.arange(6).reshape(2, 3)
+    >>> a
+    array([[0, 1, 2],
+           [3, 4, 5]])
+    >>> np.trapz(a, axis=0)
+    array([1.5, 2.5, 3.5])
+    >>> np.trapz(a, axis=1)
+    array([2.,  8.])
+
+    """
+    y = asanyarray(y)
+    if x is None:
+        d = dx
+    else:
+        x = asanyarray(x)
+        if x.ndim == 1:
+            d = diff(x)
+            # reshape to correct shape
+            shape = [1]*y.ndim
+            shape[axis] = d.shape[0]
+            d = d.reshape(shape)
+        else:
+            d = diff(x, axis=axis)
+    nd = y.ndim
+    slice1 = [slice(None)]*nd
+    slice2 = [slice(None)]*nd
+    slice1[axis] = slice(1, None)
+    slice2[axis] = slice(None, -1)
+    try:
+        ret = (d * (y[tuple(slice1)] + y[tuple(slice2)]) / 2.0).sum(axis)
+    except ValueError:
+        # Operations didn't work, cast to ndarray
+        d = np.asarray(d)
+        y = np.asarray(y)
+        ret = add.reduce(d * (y[tuple(slice1)]+y[tuple(slice2)])/2.0, axis)
+    return ret
+
+
+def _meshgrid_dispatcher(*xi, copy=None, sparse=None, indexing=None):
+    return xi
+
+
+# Based on scitools meshgrid
+@array_function_dispatch(_meshgrid_dispatcher)
+def meshgrid(*xi, copy=True, sparse=False, indexing='xy'):
+    """
+    Return coordinate matrices from coordinate vectors.
+
+    Make N-D coordinate arrays for vectorized evaluations of
+    N-D scalar/vector fields over N-D grids, given
+    one-dimensional coordinate arrays x1, x2,..., xn.
+
+    .. versionchanged:: 1.9
+       1-D and 0-D cases are allowed.
+
+    Parameters
+    ----------
+    x1, x2,..., xn : array_like
+        1-D arrays representing the coordinates of a grid.
+    indexing : {'xy', 'ij'}, optional
+        Cartesian ('xy', default) or matrix ('ij') indexing of output.
+        See Notes for more details.
+
+        .. versionadded:: 1.7.0
+    sparse : bool, optional
+        If True a sparse grid is returned in order to conserve memory.
+        Default is False.
+
+        .. versionadded:: 1.7.0
+    copy : bool, optional
+        If False, a view into the original arrays are returned in order to
+        conserve memory.  Default is True.  Please note that
+        ``sparse=False, copy=False`` will likely return non-contiguous
+        arrays.  Furthermore, more than one element of a broadcast array
+        may refer to a single memory location.  If you need to write to the
+        arrays, make copies first.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    X1, X2,..., XN : ndarray
+        For vectors `x1`, `x2`,..., 'xn' with lengths ``Ni=len(xi)`` ,
+        return ``(N1, N2, N3,...Nn)`` shaped arrays if indexing='ij'
+        or ``(N2, N1, N3,...Nn)`` shaped arrays if indexing='xy'
+        with the elements of `xi` repeated to fill the matrix along
+        the first dimension for `x1`, the second for `x2` and so on.
+
+    Notes
+    -----
+    This function supports both indexing conventions through the indexing
+    keyword argument.  Giving the string 'ij' returns a meshgrid with
+    matrix indexing, while 'xy' returns a meshgrid with Cartesian indexing.
+    In the 2-D case with inputs of length M and N, the outputs are of shape
+    (N, M) for 'xy' indexing and (M, N) for 'ij' indexing.  In the 3-D case
+    with inputs of length M, N and P, outputs are of shape (N, M, P) for
+    'xy' indexing and (M, N, P) for 'ij' indexing.  The difference is
+    illustrated by the following code snippet::
+
+        xv, yv = np.meshgrid(x, y, sparse=False, indexing='ij')
+        for i in range(nx):
+            for j in range(ny):
+                # treat xv[i,j], yv[i,j]
+
+        xv, yv = np.meshgrid(x, y, sparse=False, indexing='xy')
+        for i in range(nx):
+            for j in range(ny):
+                # treat xv[j,i], yv[j,i]
+
+    In the 1-D and 0-D case, the indexing and sparse keywords have no effect.
+
+    See Also
+    --------
+    index_tricks.mgrid : Construct a multi-dimensional "meshgrid"
+                     using indexing notation.
+    index_tricks.ogrid : Construct an open multi-dimensional "meshgrid"
+                     using indexing notation.
+
+    Examples
+    --------
+    >>> nx, ny = (3, 2)
+    >>> x = np.linspace(0, 1, nx)
+    >>> y = np.linspace(0, 1, ny)
+    >>> xv, yv = np.meshgrid(x, y)
+    >>> xv
+    array([[0. , 0.5, 1. ],
+           [0. , 0.5, 1. ]])
+    >>> yv
+    array([[0.,  0.,  0.],
+           [1.,  1.,  1.]])
+    >>> xv, yv = np.meshgrid(x, y, sparse=True)  # make sparse output arrays
+    >>> xv
+    array([[0. ,  0.5,  1. ]])
+    >>> yv
+    array([[0.],
+           [1.]])
+
+    `meshgrid` is very useful to evaluate functions on a grid.
+
+    >>> import matplotlib.pyplot as plt
+    >>> x = np.arange(-5, 5, 0.1)
+    >>> y = np.arange(-5, 5, 0.1)
+    >>> xx, yy = np.meshgrid(x, y, sparse=True)
+    >>> z = np.sin(xx**2 + yy**2) / (xx**2 + yy**2)
+    >>> h = plt.contourf(x,y,z)
+    >>> plt.show()
+
+    """
+    ndim = len(xi)
+
+    if indexing not in ['xy', 'ij']:
+        raise ValueError(
+            "Valid values for `indexing` are 'xy' and 'ij'.")
+
+    s0 = (1,) * ndim
+    output = [np.asanyarray(x).reshape(s0[:i] + (-1,) + s0[i + 1:])
+              for i, x in enumerate(xi)]
+
+    if indexing == 'xy' and ndim > 1:
+        # switch first and second axis
+        output[0].shape = (1, -1) + s0[2:]
+        output[1].shape = (-1, 1) + s0[2:]
+
+    if not sparse:
+        # Return the full N-D matrix (not only the 1-D vector)
+        output = np.broadcast_arrays(*output, subok=True)
+
+    if copy:
+        output = [x.copy() for x in output]
+
+    return output
+
+
+def _delete_dispatcher(arr, obj, axis=None):
+    return (arr, obj)
+
+
+@array_function_dispatch(_delete_dispatcher)
+def delete(arr, obj, axis=None):
+    """
+    Return a new array with sub-arrays along an axis deleted. For a one
+    dimensional array, this returns those entries not returned by
+    `arr[obj]`.
+
+    Parameters
+    ----------
+    arr : array_like
+        Input array.
+    obj : slice, int or array of ints
+        Indicate indices of sub-arrays to remove along the specified axis.
+
+        .. versionchanged:: 1.19.0
+            Boolean indices are now treated as a mask of elements to remove,
+            rather than being cast to the integers 0 and 1.
+
+    axis : int, optional
+        The axis along which to delete the subarray defined by `obj`.
+        If `axis` is None, `obj` is applied to the flattened array.
+
+    Returns
+    -------
+    out : ndarray
+        A copy of `arr` with the elements specified by `obj` removed. Note
+        that `delete` does not occur in-place. If `axis` is None, `out` is
+        a flattened array.
+
+    See Also
+    --------
+    insert : Insert elements into an array.
+    append : Append elements at the end of an array.
+
+    Notes
+    -----
+    Often it is preferable to use a boolean mask. For example:
+
+    >>> arr = np.arange(12) + 1
+    >>> mask = np.ones(len(arr), dtype=bool)
+    >>> mask[[0,2,4]] = False
+    >>> result = arr[mask,...]
+
+    Is equivalent to `np.delete(arr, [0,2,4], axis=0)`, but allows further
+    use of `mask`.
+
+    Examples
+    --------
+    >>> arr = np.array([[1,2,3,4], [5,6,7,8], [9,10,11,12]])
+    >>> arr
+    array([[ 1,  2,  3,  4],
+           [ 5,  6,  7,  8],
+           [ 9, 10, 11, 12]])
+    >>> np.delete(arr, 1, 0)
+    array([[ 1,  2,  3,  4],
+           [ 9, 10, 11, 12]])
+
+    >>> np.delete(arr, np.s_[::2], 1)
+    array([[ 2,  4],
+           [ 6,  8],
+           [10, 12]])
+    >>> np.delete(arr, [1,3,5], None)
+    array([ 1,  3,  5,  7,  8,  9, 10, 11, 12])
+
+    """
+    wrap = None
+    if type(arr) is not ndarray:
+        try:
+            wrap = arr.__array_wrap__
+        except AttributeError:
+            pass
+
+    arr = asarray(arr)
+    ndim = arr.ndim
+    arrorder = 'F' if arr.flags.fnc else 'C'
+    if axis is None:
+        if ndim != 1:
+            arr = arr.ravel()
+        # needed for np.matrix, which is still not 1d after being ravelled
+        ndim = arr.ndim
+        axis = ndim - 1
+    else:
+        axis = normalize_axis_index(axis, ndim)
+
+    slobj = [slice(None)]*ndim
+    N = arr.shape[axis]
+    newshape = list(arr.shape)
+
+    if isinstance(obj, slice):
+        start, stop, step = obj.indices(N)
+        xr = range(start, stop, step)
+        numtodel = len(xr)
+
+        if numtodel <= 0:
+            if wrap:
+                return wrap(arr.copy(order=arrorder))
+            else:
+                return arr.copy(order=arrorder)
+
+        # Invert if step is negative:
+        if step < 0:
+            step = -step
+            start = xr[-1]
+            stop = xr[0] + 1
+
+        newshape[axis] -= numtodel
+        new = empty(newshape, arr.dtype, arrorder)
+        # copy initial chunk
+        if start == 0:
+            pass
+        else:
+            slobj[axis] = slice(None, start)
+            new[tuple(slobj)] = arr[tuple(slobj)]
+        # copy end chunk
+        if stop == N:
+            pass
+        else:
+            slobj[axis] = slice(stop-numtodel, None)
+            slobj2 = [slice(None)]*ndim
+            slobj2[axis] = slice(stop, None)
+            new[tuple(slobj)] = arr[tuple(slobj2)]
+        # copy middle pieces
+        if step == 1:
+            pass
+        else:  # use array indexing.
+            keep = ones(stop-start, dtype=bool)
+            keep[:stop-start:step] = False
+            slobj[axis] = slice(start, stop-numtodel)
+            slobj2 = [slice(None)]*ndim
+            slobj2[axis] = slice(start, stop)
+            arr = arr[tuple(slobj2)]
+            slobj2[axis] = keep
+            new[tuple(slobj)] = arr[tuple(slobj2)]
+        if wrap:
+            return wrap(new)
+        else:
+            return new
+
+    if isinstance(obj, (int, integer)) and not isinstance(obj, bool):
+        # optimization for a single value
+        if (obj < -N or obj >= N):
+            raise IndexError(
+                "index %i is out of bounds for axis %i with "
+                "size %i" % (obj, axis, N))
+        if (obj < 0):
+            obj += N
+        newshape[axis] -= 1
+        new = empty(newshape, arr.dtype, arrorder)
+        slobj[axis] = slice(None, obj)
+        new[tuple(slobj)] = arr[tuple(slobj)]
+        slobj[axis] = slice(obj, None)
+        slobj2 = [slice(None)]*ndim
+        slobj2[axis] = slice(obj+1, None)
+        new[tuple(slobj)] = arr[tuple(slobj2)]
+    else:
+        _obj = obj
+        obj = np.asarray(obj)
+        if obj.size == 0 and not isinstance(_obj, np.ndarray):
+            obj = obj.astype(intp)
+
+        if obj.dtype == bool:
+            if obj.shape != (N,):
+                raise ValueError('boolean array argument obj to delete '
+                                 'must be one dimensional and match the axis '
+                                 'length of {}'.format(N))
+
+            # optimization, the other branch is slower
+            keep = ~obj
+        else:
+            keep = ones(N, dtype=bool)
+            keep[obj,] = False
+
+        slobj[axis] = keep
+        new = arr[tuple(slobj)]
+
+    if wrap:
+        return wrap(new)
+    else:
+        return new
+
+
+def _insert_dispatcher(arr, obj, values, axis=None):
+    return (arr, obj, values)
+
+
+@array_function_dispatch(_insert_dispatcher)
+def insert(arr, obj, values, axis=None):
+    """
+    Insert values along the given axis before the given indices.
+
+    Parameters
+    ----------
+    arr : array_like
+        Input array.
+    obj : int, slice or sequence of ints
+        Object that defines the index or indices before which `values` is
+        inserted.
+
+        .. versionadded:: 1.8.0
+
+        Support for multiple insertions when `obj` is a single scalar or a
+        sequence with one element (similar to calling insert multiple
+        times).
+    values : array_like
+        Values to insert into `arr`. If the type of `values` is different
+        from that of `arr`, `values` is converted to the type of `arr`.
+        `values` should be shaped so that ``arr[...,obj,...] = values``
+        is legal.
+    axis : int, optional
+        Axis along which to insert `values`.  If `axis` is None then `arr`
+        is flattened first.
+
+    Returns
+    -------
+    out : ndarray
+        A copy of `arr` with `values` inserted.  Note that `insert`
+        does not occur in-place: a new array is returned. If
+        `axis` is None, `out` is a flattened array.
+
+    See Also
+    --------
+    append : Append elements at the end of an array.
+    concatenate : Join a sequence of arrays along an existing axis.
+    delete : Delete elements from an array.
+
+    Notes
+    -----
+    Note that for higher dimensional inserts `obj=0` behaves very different
+    from `obj=[0]` just like `arr[:,0,:] = values` is different from
+    `arr[:,[0],:] = values`.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 1], [2, 2], [3, 3]])
+    >>> a
+    array([[1, 1],
+           [2, 2],
+           [3, 3]])
+    >>> np.insert(a, 1, 5)
+    array([1, 5, 1, ..., 2, 3, 3])
+    >>> np.insert(a, 1, 5, axis=1)
+    array([[1, 5, 1],
+           [2, 5, 2],
+           [3, 5, 3]])
+
+    Difference between sequence and scalars:
+
+    >>> np.insert(a, [1], [[1],[2],[3]], axis=1)
+    array([[1, 1, 1],
+           [2, 2, 2],
+           [3, 3, 3]])
+    >>> np.array_equal(np.insert(a, 1, [1, 2, 3], axis=1),
+    ...                np.insert(a, [1], [[1],[2],[3]], axis=1))
+    True
+
+    >>> b = a.flatten()
+    >>> b
+    array([1, 1, 2, 2, 3, 3])
+    >>> np.insert(b, [2, 2], [5, 6])
+    array([1, 1, 5, ..., 2, 3, 3])
+
+    >>> np.insert(b, slice(2, 4), [5, 6])
+    array([1, 1, 5, ..., 2, 3, 3])
+
+    >>> np.insert(b, [2, 2], [7.13, False]) # type casting
+    array([1, 1, 7, ..., 2, 3, 3])
+
+    >>> x = np.arange(8).reshape(2, 4)
+    >>> idx = (1, 3)
+    >>> np.insert(x, idx, 999, axis=1)
+    array([[  0, 999,   1,   2, 999,   3],
+           [  4, 999,   5,   6, 999,   7]])
+
+    """
+    wrap = None
+    if type(arr) is not ndarray:
+        try:
+            wrap = arr.__array_wrap__
+        except AttributeError:
+            pass
+
+    arr = asarray(arr)
+    ndim = arr.ndim
+    arrorder = 'F' if arr.flags.fnc else 'C'
+    if axis is None:
+        if ndim != 1:
+            arr = arr.ravel()
+        # needed for np.matrix, which is still not 1d after being ravelled
+        ndim = arr.ndim
+        axis = ndim - 1
+    else:
+        axis = normalize_axis_index(axis, ndim)
+    slobj = [slice(None)]*ndim
+    N = arr.shape[axis]
+    newshape = list(arr.shape)
+
+    if isinstance(obj, slice):
+        # turn it into a range object
+        indices = arange(*obj.indices(N), dtype=intp)
+    else:
+        # need to copy obj, because indices will be changed in-place
+        indices = np.array(obj)
+        if indices.dtype == bool:
+            # See also delete
+            # 2012-10-11, NumPy 1.8
+            warnings.warn(
+                "in the future insert will treat boolean arrays and "
+                "array-likes as a boolean index instead of casting it to "
+                "integer", FutureWarning, stacklevel=3)
+            indices = indices.astype(intp)
+            # Code after warning period:
+            #if obj.ndim != 1:
+            #    raise ValueError('boolean array argument obj to insert '
+            #                     'must be one dimensional')
+            #indices = np.flatnonzero(obj)
+        elif indices.ndim > 1:
+            raise ValueError(
+                "index array argument obj to insert must be one dimensional "
+                "or scalar")
+    if indices.size == 1:
+        index = indices.item()
+        if index < -N or index > N:
+            raise IndexError(
+                "index %i is out of bounds for axis %i with "
+                "size %i" % (obj, axis, N))
+        if (index < 0):
+            index += N
+
+        # There are some object array corner cases here, but we cannot avoid
+        # that:
+        values = array(values, copy=False, ndmin=arr.ndim, dtype=arr.dtype)
+        if indices.ndim == 0:
+            # broadcasting is very different here, since a[:,0,:] = ... behaves
+            # very different from a[:,[0],:] = ...! This changes values so that
+            # it works likes the second case. (here a[:,0:1,:])
+            values = np.moveaxis(values, 0, axis)
+        numnew = values.shape[axis]
+        newshape[axis] += numnew
+        new = empty(newshape, arr.dtype, arrorder)
+        slobj[axis] = slice(None, index)
+        new[tuple(slobj)] = arr[tuple(slobj)]
+        slobj[axis] = slice(index, index+numnew)
+        new[tuple(slobj)] = values
+        slobj[axis] = slice(index+numnew, None)
+        slobj2 = [slice(None)] * ndim
+        slobj2[axis] = slice(index, None)
+        new[tuple(slobj)] = arr[tuple(slobj2)]
+        if wrap:
+            return wrap(new)
+        return new
+    elif indices.size == 0 and not isinstance(obj, np.ndarray):
+        # Can safely cast the empty list to intp
+        indices = indices.astype(intp)
+
+    indices[indices < 0] += N
+
+    numnew = len(indices)
+    order = indices.argsort(kind='mergesort')   # stable sort
+    indices[order] += np.arange(numnew)
+
+    newshape[axis] += numnew
+    old_mask = ones(newshape[axis], dtype=bool)
+    old_mask[indices] = False
+
+    new = empty(newshape, arr.dtype, arrorder)
+    slobj2 = [slice(None)]*ndim
+    slobj[axis] = indices
+    slobj2[axis] = old_mask
+    new[tuple(slobj)] = values
+    new[tuple(slobj2)] = arr
+
+    if wrap:
+        return wrap(new)
+    return new
+
+
+def _append_dispatcher(arr, values, axis=None):
+    return (arr, values)
+
+
+@array_function_dispatch(_append_dispatcher)
+def append(arr, values, axis=None):
+    """
+    Append values to the end of an array.
+
+    Parameters
+    ----------
+    arr : array_like
+        Values are appended to a copy of this array.
+    values : array_like
+        These values are appended to a copy of `arr`.  It must be of the
+        correct shape (the same shape as `arr`, excluding `axis`).  If
+        `axis` is not specified, `values` can be any shape and will be
+        flattened before use.
+    axis : int, optional
+        The axis along which `values` are appended.  If `axis` is not
+        given, both `arr` and `values` are flattened before use.
+
+    Returns
+    -------
+    append : ndarray
+        A copy of `arr` with `values` appended to `axis`.  Note that
+        `append` does not occur in-place: a new array is allocated and
+        filled.  If `axis` is None, `out` is a flattened array.
+
+    See Also
+    --------
+    insert : Insert elements into an array.
+    delete : Delete elements from an array.
+
+    Examples
+    --------
+    >>> np.append([1, 2, 3], [[4, 5, 6], [7, 8, 9]])
+    array([1, 2, 3, ..., 7, 8, 9])
+
+    When `axis` is specified, `values` must have the correct shape.
+
+    >>> np.append([[1, 2, 3], [4, 5, 6]], [[7, 8, 9]], axis=0)
+    array([[1, 2, 3],
+           [4, 5, 6],
+           [7, 8, 9]])
+    >>> np.append([[1, 2, 3], [4, 5, 6]], [7, 8, 9], axis=0)
+    Traceback (most recent call last):
+        ...
+    ValueError: all the input arrays must have same number of dimensions, but
+    the array at index 0 has 2 dimension(s) and the array at index 1 has 1
+    dimension(s)
+
+    """
+    arr = asanyarray(arr)
+    if axis is None:
+        if arr.ndim != 1:
+            arr = arr.ravel()
+        values = ravel(values)
+        axis = arr.ndim-1
+    return concatenate((arr, values), axis=axis)
+
+
+def _digitize_dispatcher(x, bins, right=None):
+    return (x, bins)
+
+
+@array_function_dispatch(_digitize_dispatcher)
+def digitize(x, bins, right=False):
+    """
+    Return the indices of the bins to which each value in input array belongs.
+
+    =========  =============  ============================
+    `right`    order of bins  returned index `i` satisfies
+    =========  =============  ============================
+    ``False``  increasing     ``bins[i-1] <= x < bins[i]``
+    ``True``   increasing     ``bins[i-1] < x <= bins[i]``
+    ``False``  decreasing     ``bins[i-1] > x >= bins[i]``
+    ``True``   decreasing     ``bins[i-1] >= x > bins[i]``
+    =========  =============  ============================
+
+    If values in `x` are beyond the bounds of `bins`, 0 or ``len(bins)`` is
+    returned as appropriate.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array to be binned. Prior to NumPy 1.10.0, this array had to
+        be 1-dimensional, but can now have any shape.
+    bins : array_like
+        Array of bins. It has to be 1-dimensional and monotonic.
+    right : bool, optional
+        Indicating whether the intervals include the right or the left bin
+        edge. Default behavior is (right==False) indicating that the interval
+        does not include the right edge. The left bin end is open in this
+        case, i.e., bins[i-1] <= x < bins[i] is the default behavior for
+        monotonically increasing bins.
+
+    Returns
+    -------
+    indices : ndarray of ints
+        Output array of indices, of same shape as `x`.
+
+    Raises
+    ------
+    ValueError
+        If `bins` is not monotonic.
+    TypeError
+        If the type of the input is complex.
+
+    See Also
+    --------
+    bincount, histogram, unique, searchsorted
+
+    Notes
+    -----
+    If values in `x` are such that they fall outside the bin range,
+    attempting to index `bins` with the indices that `digitize` returns
+    will result in an IndexError.
+
+    .. versionadded:: 1.10.0
+
+    `np.digitize` is  implemented in terms of `np.searchsorted`. This means
+    that a binary search is used to bin the values, which scales much better
+    for larger number of bins than the previous linear search. It also removes
+    the requirement for the input array to be 1-dimensional.
+
+    For monotonically _increasing_ `bins`, the following are equivalent::
+
+        np.digitize(x, bins, right=True)
+        np.searchsorted(bins, x, side='left')
+
+    Note that as the order of the arguments are reversed, the side must be too.
+    The `searchsorted` call is marginally faster, as it does not do any
+    monotonicity checks. Perhaps more importantly, it supports all dtypes.
+
+    Examples
+    --------
+    >>> x = np.array([0.2, 6.4, 3.0, 1.6])
+    >>> bins = np.array([0.0, 1.0, 2.5, 4.0, 10.0])
+    >>> inds = np.digitize(x, bins)
+    >>> inds
+    array([1, 4, 3, 2])
+    >>> for n in range(x.size):
+    ...   print(bins[inds[n]-1], "<=", x[n], "<", bins[inds[n]])
+    ...
+    0.0 <= 0.2 < 1.0
+    4.0 <= 6.4 < 10.0
+    2.5 <= 3.0 < 4.0
+    1.0 <= 1.6 < 2.5
+
+    >>> x = np.array([1.2, 10.0, 12.4, 15.5, 20.])
+    >>> bins = np.array([0, 5, 10, 15, 20])
+    >>> np.digitize(x,bins,right=True)
+    array([1, 2, 3, 4, 4])
+    >>> np.digitize(x,bins,right=False)
+    array([1, 3, 3, 4, 5])
+    """
+    x = _nx.asarray(x)
+    bins = _nx.asarray(bins)
+
+    # here for compatibility, searchsorted below is happy to take this
+    if np.issubdtype(x.dtype, _nx.complexfloating):
+        raise TypeError("x may not be complex")
+
+    mono = _monotonicity(bins)
+    if mono == 0:
+        raise ValueError("bins must be monotonically increasing or decreasing")
+
+    # this is backwards because the arguments below are swapped
+    side = 'left' if right else 'right'
+    if mono == -1:
+        # reverse the bins, and invert the results
+        return len(bins) - _nx.searchsorted(bins[::-1], x, side=side)
+    else:
+        return _nx.searchsorted(bins, x, side=side)
diff --git a/venv/Lib/site-packages/numpy/lib/histograms.py b/venv/Lib/site-packages/numpy/lib/histograms.py
new file mode 100644
index 000000000..1a9b41ced
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/histograms.py
@@ -0,0 +1,1128 @@
+"""
+Histogram-related functions
+"""
+import contextlib
+import functools
+import operator
+import warnings
+
+import numpy as np
+from numpy.core import overrides
+
+__all__ = ['histogram', 'histogramdd', 'histogram_bin_edges']
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+# range is a keyword argument to many functions, so save the builtin so they can
+# use it.
+_range = range
+
+
+def _ptp(x):
+    """Peak-to-peak value of x.
+
+    This implementation avoids the problem of signed integer arrays having a
+    peak-to-peak value that cannot be represented with the array's data type.
+    This function returns an unsigned value for signed integer arrays.
+    """
+    return _unsigned_subtract(x.max(), x.min())
+
+
+def _hist_bin_sqrt(x, range):
+    """
+    Square root histogram bin estimator.
+
+    Bin width is inversely proportional to the data size. Used by many
+    programs for its simplicity.
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    return _ptp(x) / np.sqrt(x.size)
+
+
+def _hist_bin_sturges(x, range):
+    """
+    Sturges histogram bin estimator.
+
+    A very simplistic estimator based on the assumption of normality of
+    the data. This estimator has poor performance for non-normal data,
+    which becomes especially obvious for large data sets. The estimate
+    depends only on size of the data.
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    return _ptp(x) / (np.log2(x.size) + 1.0)
+
+
+def _hist_bin_rice(x, range):
+    """
+    Rice histogram bin estimator.
+
+    Another simple estimator with no normality assumption. It has better
+    performance for large data than Sturges, but tends to overestimate
+    the number of bins. The number of bins is proportional to the cube
+    root of data size (asymptotically optimal). The estimate depends
+    only on size of the data.
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    return _ptp(x) / (2.0 * x.size ** (1.0 / 3))
+
+
+def _hist_bin_scott(x, range):
+    """
+    Scott histogram bin estimator.
+
+    The binwidth is proportional to the standard deviation of the data
+    and inversely proportional to the cube root of data size
+    (asymptotically optimal).
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    return (24.0 * np.pi**0.5 / x.size)**(1.0 / 3.0) * np.std(x)
+
+
+def _hist_bin_stone(x, range):
+    """
+    Histogram bin estimator based on minimizing the estimated integrated squared error (ISE).
+
+    The number of bins is chosen by minimizing the estimated ISE against the unknown true distribution.
+    The ISE is estimated using cross-validation and can be regarded as a generalization of Scott's rule.
+    https://en.wikipedia.org/wiki/Histogram#Scott.27s_normal_reference_rule
+
+    This paper by Stone appears to be the origination of this rule.
+    http://digitalassets.lib.berkeley.edu/sdtr/ucb/text/34.pdf
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+    range : (float, float)
+        The lower and upper range of the bins.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+
+    n = x.size
+    ptp_x = _ptp(x)
+    if n <= 1 or ptp_x == 0:
+        return 0
+
+    def jhat(nbins):
+        hh = ptp_x / nbins
+        p_k = np.histogram(x, bins=nbins, range=range)[0] / n
+        return (2 - (n + 1) * p_k.dot(p_k)) / hh
+
+    nbins_upper_bound = max(100, int(np.sqrt(n)))
+    nbins = min(_range(1, nbins_upper_bound + 1), key=jhat)
+    if nbins == nbins_upper_bound:
+        warnings.warn("The number of bins estimated may be suboptimal.",
+                      RuntimeWarning, stacklevel=3)
+    return ptp_x / nbins
+
+
+def _hist_bin_doane(x, range):
+    """
+    Doane's histogram bin estimator.
+
+    Improved version of Sturges' formula which works better for
+    non-normal data. See
+    stats.stackexchange.com/questions/55134/doanes-formula-for-histogram-binning
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    if x.size > 2:
+        sg1 = np.sqrt(6.0 * (x.size - 2) / ((x.size + 1.0) * (x.size + 3)))
+        sigma = np.std(x)
+        if sigma > 0.0:
+            # These three operations add up to
+            # g1 = np.mean(((x - np.mean(x)) / sigma)**3)
+            # but use only one temp array instead of three
+            temp = x - np.mean(x)
+            np.true_divide(temp, sigma, temp)
+            np.power(temp, 3, temp)
+            g1 = np.mean(temp)
+            return _ptp(x) / (1.0 + np.log2(x.size) +
+                                    np.log2(1.0 + np.absolute(g1) / sg1))
+    return 0.0
+
+
+def _hist_bin_fd(x, range):
+    """
+    The Freedman-Diaconis histogram bin estimator.
+
+    The Freedman-Diaconis rule uses interquartile range (IQR) to
+    estimate binwidth. It is considered a variation of the Scott rule
+    with more robustness as the IQR is less affected by outliers than
+    the standard deviation. However, the IQR depends on fewer points
+    than the standard deviation, so it is less accurate, especially for
+    long tailed distributions.
+
+    If the IQR is 0, this function returns 0 for the bin width.
+    Binwidth is inversely proportional to the cube root of data size
+    (asymptotically optimal).
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+    """
+    del range  # unused
+    iqr = np.subtract(*np.percentile(x, [75, 25]))
+    return 2.0 * iqr * x.size ** (-1.0 / 3.0)
+
+
+def _hist_bin_auto(x, range):
+    """
+    Histogram bin estimator that uses the minimum width of the
+    Freedman-Diaconis and Sturges estimators if the FD bin width is non-zero.
+    If the bin width from the FD estimator is 0, the Sturges estimator is used.
+
+    The FD estimator is usually the most robust method, but its width
+    estimate tends to be too large for small `x` and bad for data with limited
+    variance. The Sturges estimator is quite good for small (<1000) datasets
+    and is the default in the R language. This method gives good off-the-shelf
+    behaviour.
+
+    .. versionchanged:: 1.15.0
+    If there is limited variance the IQR can be 0, which results in the
+    FD bin width being 0 too. This is not a valid bin width, so
+    ``np.histogram_bin_edges`` chooses 1 bin instead, which may not be optimal.
+    If the IQR is 0, it's unlikely any variance-based estimators will be of
+    use, so we revert to the Sturges estimator, which only uses the size of the
+    dataset in its calculation.
+
+    Parameters
+    ----------
+    x : array_like
+        Input data that is to be histogrammed, trimmed to range. May not
+        be empty.
+
+    Returns
+    -------
+    h : An estimate of the optimal bin width for the given data.
+
+    See Also
+    --------
+    _hist_bin_fd, _hist_bin_sturges
+    """
+    fd_bw = _hist_bin_fd(x, range)
+    sturges_bw = _hist_bin_sturges(x, range)
+    del range  # unused
+    if fd_bw:
+        return min(fd_bw, sturges_bw)
+    else:
+        # limited variance, so we return a len dependent bw estimator
+        return sturges_bw
+
+# Private dict initialized at module load time
+_hist_bin_selectors = {'stone': _hist_bin_stone,
+                       'auto': _hist_bin_auto,
+                       'doane': _hist_bin_doane,
+                       'fd': _hist_bin_fd,
+                       'rice': _hist_bin_rice,
+                       'scott': _hist_bin_scott,
+                       'sqrt': _hist_bin_sqrt,
+                       'sturges': _hist_bin_sturges}
+
+
+def _ravel_and_check_weights(a, weights):
+    """ Check a and weights have matching shapes, and ravel both """
+    a = np.asarray(a)
+
+    # Ensure that the array is a "subtractable" dtype
+    if a.dtype == np.bool_:
+        warnings.warn("Converting input from {} to {} for compatibility."
+                      .format(a.dtype, np.uint8),
+                      RuntimeWarning, stacklevel=3)
+        a = a.astype(np.uint8)
+
+    if weights is not None:
+        weights = np.asarray(weights)
+        if weights.shape != a.shape:
+            raise ValueError(
+                'weights should have the same shape as a.')
+        weights = weights.ravel()
+    a = a.ravel()
+    return a, weights
+
+
+def _get_outer_edges(a, range):
+    """
+    Determine the outer bin edges to use, from either the data or the range
+    argument
+    """
+    if range is not None:
+        first_edge, last_edge = range
+        if first_edge > last_edge:
+            raise ValueError(
+                'max must be larger than min in range parameter.')
+        if not (np.isfinite(first_edge) and np.isfinite(last_edge)):
+            raise ValueError(
+                "supplied range of [{}, {}] is not finite".format(first_edge, last_edge))
+    elif a.size == 0:
+        # handle empty arrays. Can't determine range, so use 0-1.
+        first_edge, last_edge = 0, 1
+    else:
+        first_edge, last_edge = a.min(), a.max()
+        if not (np.isfinite(first_edge) and np.isfinite(last_edge)):
+            raise ValueError(
+                "autodetected range of [{}, {}] is not finite".format(first_edge, last_edge))
+
+    # expand empty range to avoid divide by zero
+    if first_edge == last_edge:
+        first_edge = first_edge - 0.5
+        last_edge = last_edge + 0.5
+
+    return first_edge, last_edge
+
+
+def _unsigned_subtract(a, b):
+    """
+    Subtract two values where a >= b, and produce an unsigned result
+
+    This is needed when finding the difference between the upper and lower
+    bound of an int16 histogram
+    """
+    # coerce to a single type
+    signed_to_unsigned = {
+        np.byte: np.ubyte,
+        np.short: np.ushort,
+        np.intc: np.uintc,
+        np.int_: np.uint,
+        np.longlong: np.ulonglong
+    }
+    dt = np.result_type(a, b)
+    try:
+        dt = signed_to_unsigned[dt.type]
+    except KeyError:
+        return np.subtract(a, b, dtype=dt)
+    else:
+        # we know the inputs are integers, and we are deliberately casting
+        # signed to unsigned
+        return np.subtract(a, b, casting='unsafe', dtype=dt)
+
+
+def _get_bin_edges(a, bins, range, weights):
+    """
+    Computes the bins used internally by `histogram`.
+
+    Parameters
+    ==========
+    a : ndarray
+        Ravelled data array
+    bins, range
+        Forwarded arguments from `histogram`.
+    weights : ndarray, optional
+        Ravelled weights array, or None
+
+    Returns
+    =======
+    bin_edges : ndarray
+        Array of bin edges
+    uniform_bins : (Number, Number, int):
+        The upper bound, lowerbound, and number of bins, used in the optimized
+        implementation of `histogram` that works on uniform bins.
+    """
+    # parse the overloaded bins argument
+    n_equal_bins = None
+    bin_edges = None
+
+    if isinstance(bins, str):
+        bin_name = bins
+        # if `bins` is a string for an automatic method,
+        # this will replace it with the number of bins calculated
+        if bin_name not in _hist_bin_selectors:
+            raise ValueError(
+                "{!r} is not a valid estimator for `bins`".format(bin_name))
+        if weights is not None:
+            raise TypeError("Automated estimation of the number of "
+                            "bins is not supported for weighted data")
+
+        first_edge, last_edge = _get_outer_edges(a, range)
+
+        # truncate the range if needed
+        if range is not None:
+            keep = (a >= first_edge)
+            keep &= (a <= last_edge)
+            if not np.logical_and.reduce(keep):
+                a = a[keep]
+
+        if a.size == 0:
+            n_equal_bins = 1
+        else:
+            # Do not call selectors on empty arrays
+            width = _hist_bin_selectors[bin_name](a, (first_edge, last_edge))
+            if width:
+                n_equal_bins = int(np.ceil(_unsigned_subtract(last_edge, first_edge) / width))
+            else:
+                # Width can be zero for some estimators, e.g. FD when
+                # the IQR of the data is zero.
+                n_equal_bins = 1
+
+    elif np.ndim(bins) == 0:
+        try:
+            n_equal_bins = operator.index(bins)
+        except TypeError as e:
+            raise TypeError(
+                '`bins` must be an integer, a string, or an array') from e
+        if n_equal_bins < 1:
+            raise ValueError('`bins` must be positive, when an integer')
+
+        first_edge, last_edge = _get_outer_edges(a, range)
+
+    elif np.ndim(bins) == 1:
+        bin_edges = np.asarray(bins)
+        if np.any(bin_edges[:-1] > bin_edges[1:]):
+            raise ValueError(
+                '`bins` must increase monotonically, when an array')
+
+    else:
+        raise ValueError('`bins` must be 1d, when an array')
+
+    if n_equal_bins is not None:
+        # gh-10322 means that type resolution rules are dependent on array
+        # shapes. To avoid this causing problems, we pick a type now and stick
+        # with it throughout.
+        bin_type = np.result_type(first_edge, last_edge, a)
+        if np.issubdtype(bin_type, np.integer):
+            bin_type = np.result_type(bin_type, float)
+
+        # bin edges must be computed
+        bin_edges = np.linspace(
+            first_edge, last_edge, n_equal_bins + 1,
+            endpoint=True, dtype=bin_type)
+        return bin_edges, (first_edge, last_edge, n_equal_bins)
+    else:
+        return bin_edges, None
+
+
+def _search_sorted_inclusive(a, v):
+    """
+    Like `searchsorted`, but where the last item in `v` is placed on the right.
+
+    In the context of a histogram, this makes the last bin edge inclusive
+    """
+    return np.concatenate((
+        a.searchsorted(v[:-1], 'left'),
+        a.searchsorted(v[-1:], 'right')
+    ))
+
+
+def _histogram_bin_edges_dispatcher(a, bins=None, range=None, weights=None):
+    return (a, bins, weights)
+
+
+@array_function_dispatch(_histogram_bin_edges_dispatcher)
+def histogram_bin_edges(a, bins=10, range=None, weights=None):
+    r"""
+    Function to calculate only the edges of the bins used by the `histogram`
+    function.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data. The histogram is computed over the flattened array.
+    bins : int or sequence of scalars or str, optional
+        If `bins` is an int, it defines the number of equal-width
+        bins in the given range (10, by default). If `bins` is a
+        sequence, it defines the bin edges, including the rightmost
+        edge, allowing for non-uniform bin widths.
+
+        If `bins` is a string from the list below, `histogram_bin_edges` will use
+        the method chosen to calculate the optimal bin width and
+        consequently the number of bins (see `Notes` for more detail on
+        the estimators) from the data that falls within the requested
+        range. While the bin width will be optimal for the actual data
+        in the range, the number of bins will be computed to fill the
+        entire range, including the empty portions. For visualisation,
+        using the 'auto' option is suggested. Weighted data is not
+        supported for automated bin size selection.
+
+        'auto'
+            Maximum of the 'sturges' and 'fd' estimators. Provides good
+            all around performance.
+
+        'fd' (Freedman Diaconis Estimator)
+            Robust (resilient to outliers) estimator that takes into
+            account data variability and data size.
+
+        'doane'
+            An improved version of Sturges' estimator that works better
+            with non-normal datasets.
+
+        'scott'
+            Less robust estimator that that takes into account data
+            variability and data size.
+
+        'stone'
+            Estimator based on leave-one-out cross-validation estimate of
+            the integrated squared error. Can be regarded as a generalization
+            of Scott's rule.
+
+        'rice'
+            Estimator does not take variability into account, only data
+            size. Commonly overestimates number of bins required.
+
+        'sturges'
+            R's default method, only accounts for data size. Only
+            optimal for gaussian data and underestimates number of bins
+            for large non-gaussian datasets.
+
+        'sqrt'
+            Square root (of data size) estimator, used by Excel and
+            other programs for its speed and simplicity.
+
+    range : (float, float), optional
+        The lower and upper range of the bins.  If not provided, range
+        is simply ``(a.min(), a.max())``.  Values outside the range are
+        ignored. The first element of the range must be less than or
+        equal to the second. `range` affects the automatic bin
+        computation as well. While bin width is computed to be optimal
+        based on the actual data within `range`, the bin count will fill
+        the entire range including portions containing no data.
+
+    weights : array_like, optional
+        An array of weights, of the same shape as `a`.  Each value in
+        `a` only contributes its associated weight towards the bin count
+        (instead of 1). This is currently not used by any of the bin estimators,
+        but may be in the future.
+
+    Returns
+    -------
+    bin_edges : array of dtype float
+        The edges to pass into `histogram`
+
+    See Also
+    --------
+    histogram
+
+    Notes
+    -----
+    The methods to estimate the optimal number of bins are well founded
+    in literature, and are inspired by the choices R provides for
+    histogram visualisation. Note that having the number of bins
+    proportional to :math:`n^{1/3}` is asymptotically optimal, which is
+    why it appears in most estimators. These are simply plug-in methods
+    that give good starting points for number of bins. In the equations
+    below, :math:`h` is the binwidth and :math:`n_h` is the number of
+    bins. All estimators that compute bin counts are recast to bin width
+    using the `ptp` of the data. The final bin count is obtained from
+    ``np.round(np.ceil(range / h))``.
+
+    'auto' (maximum of the 'sturges' and 'fd' estimators)
+        A compromise to get a good value. For small datasets the Sturges
+        value will usually be chosen, while larger datasets will usually
+        default to FD.  Avoids the overly conservative behaviour of FD
+        and Sturges for small and large datasets respectively.
+        Switchover point is usually :math:`a.size \approx 1000`.
+
+    'fd' (Freedman Diaconis Estimator)
+        .. math:: h = 2 \frac{IQR}{n^{1/3}}
+
+        The binwidth is proportional to the interquartile range (IQR)
+        and inversely proportional to cube root of a.size. Can be too
+        conservative for small datasets, but is quite good for large
+        datasets. The IQR is very robust to outliers.
+
+    'scott'
+        .. math:: h = \sigma \sqrt[3]{\frac{24 * \sqrt{\pi}}{n}}
+
+        The binwidth is proportional to the standard deviation of the
+        data and inversely proportional to cube root of ``x.size``. Can
+        be too conservative for small datasets, but is quite good for
+        large datasets. The standard deviation is not very robust to
+        outliers. Values are very similar to the Freedman-Diaconis
+        estimator in the absence of outliers.
+
+    'rice'
+        .. math:: n_h = 2n^{1/3}
+
+        The number of bins is only proportional to cube root of
+        ``a.size``. It tends to overestimate the number of bins and it
+        does not take into account data variability.
+
+    'sturges'
+        .. math:: n_h = \log _{2}n+1
+
+        The number of bins is the base 2 log of ``a.size``.  This
+        estimator assumes normality of data and is too conservative for
+        larger, non-normal datasets. This is the default method in R's
+        ``hist`` method.
+
+    'doane'
+        .. math:: n_h = 1 + \log_{2}(n) +
+                        \log_{2}(1 + \frac{|g_1|}{\sigma_{g_1}})
+
+            g_1 = mean[(\frac{x - \mu}{\sigma})^3]
+
+            \sigma_{g_1} = \sqrt{\frac{6(n - 2)}{(n + 1)(n + 3)}}
+
+        An improved version of Sturges' formula that produces better
+        estimates for non-normal datasets. This estimator attempts to
+        account for the skew of the data.
+
+    'sqrt'
+        .. math:: n_h = \sqrt n
+
+        The simplest and fastest estimator. Only takes into account the
+        data size.
+
+    Examples
+    --------
+    >>> arr = np.array([0, 0, 0, 1, 2, 3, 3, 4, 5])
+    >>> np.histogram_bin_edges(arr, bins='auto', range=(0, 1))
+    array([0.  , 0.25, 0.5 , 0.75, 1.  ])
+    >>> np.histogram_bin_edges(arr, bins=2)
+    array([0. , 2.5, 5. ])
+
+    For consistency with histogram, an array of pre-computed bins is
+    passed through unmodified:
+
+    >>> np.histogram_bin_edges(arr, [1, 2])
+    array([1, 2])
+
+    This function allows one set of bins to be computed, and reused across
+    multiple histograms:
+
+    >>> shared_bins = np.histogram_bin_edges(arr, bins='auto')
+    >>> shared_bins
+    array([0., 1., 2., 3., 4., 5.])
+
+    >>> group_id = np.array([0, 1, 1, 0, 1, 1, 0, 1, 1])
+    >>> hist_0, _ = np.histogram(arr[group_id == 0], bins=shared_bins)
+    >>> hist_1, _ = np.histogram(arr[group_id == 1], bins=shared_bins)
+
+    >>> hist_0; hist_1
+    array([1, 1, 0, 1, 0])
+    array([2, 0, 1, 1, 2])
+
+    Which gives more easily comparable results than using separate bins for
+    each histogram:
+
+    >>> hist_0, bins_0 = np.histogram(arr[group_id == 0], bins='auto')
+    >>> hist_1, bins_1 = np.histogram(arr[group_id == 1], bins='auto')
+    >>> hist_0; hist_1
+    array([1, 1, 1])
+    array([2, 1, 1, 2])
+    >>> bins_0; bins_1
+    array([0., 1., 2., 3.])
+    array([0.  , 1.25, 2.5 , 3.75, 5.  ])
+
+    """
+    a, weights = _ravel_and_check_weights(a, weights)
+    bin_edges, _ = _get_bin_edges(a, bins, range, weights)
+    return bin_edges
+
+
+def _histogram_dispatcher(
+        a, bins=None, range=None, normed=None, weights=None, density=None):
+    return (a, bins, weights)
+
+
+@array_function_dispatch(_histogram_dispatcher)
+def histogram(a, bins=10, range=None, normed=None, weights=None,
+              density=None):
+    r"""
+    Compute the histogram of a set of data.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data. The histogram is computed over the flattened array.
+    bins : int or sequence of scalars or str, optional
+        If `bins` is an int, it defines the number of equal-width
+        bins in the given range (10, by default). If `bins` is a
+        sequence, it defines a monotonically increasing array of bin edges,
+        including the rightmost edge, allowing for non-uniform bin widths.
+
+        .. versionadded:: 1.11.0
+
+        If `bins` is a string, it defines the method used to calculate the
+        optimal bin width, as defined by `histogram_bin_edges`.
+
+    range : (float, float), optional
+        The lower and upper range of the bins.  If not provided, range
+        is simply ``(a.min(), a.max())``.  Values outside the range are
+        ignored. The first element of the range must be less than or
+        equal to the second. `range` affects the automatic bin
+        computation as well. While bin width is computed to be optimal
+        based on the actual data within `range`, the bin count will fill
+        the entire range including portions containing no data.
+    normed : bool, optional
+
+        .. deprecated:: 1.6.0
+
+        This is equivalent to the `density` argument, but produces incorrect
+        results for unequal bin widths. It should not be used.
+
+        .. versionchanged:: 1.15.0
+            DeprecationWarnings are actually emitted.
+
+    weights : array_like, optional
+        An array of weights, of the same shape as `a`.  Each value in
+        `a` only contributes its associated weight towards the bin count
+        (instead of 1). If `density` is True, the weights are
+        normalized, so that the integral of the density over the range
+        remains 1.
+    density : bool, optional
+        If ``False``, the result will contain the number of samples in
+        each bin. If ``True``, the result is the value of the
+        probability *density* function at the bin, normalized such that
+        the *integral* over the range is 1. Note that the sum of the
+        histogram values will not be equal to 1 unless bins of unity
+        width are chosen; it is not a probability *mass* function.
+
+        Overrides the ``normed`` keyword if given.
+
+    Returns
+    -------
+    hist : array
+        The values of the histogram. See `density` and `weights` for a
+        description of the possible semantics.
+    bin_edges : array of dtype float
+        Return the bin edges ``(length(hist)+1)``.
+
+
+    See Also
+    --------
+    histogramdd, bincount, searchsorted, digitize, histogram_bin_edges
+
+    Notes
+    -----
+    All but the last (righthand-most) bin is half-open.  In other words,
+    if `bins` is::
+
+      [1, 2, 3, 4]
+
+    then the first bin is ``[1, 2)`` (including 1, but excluding 2) and
+    the second ``[2, 3)``.  The last bin, however, is ``[3, 4]``, which
+    *includes* 4.
+
+
+    Examples
+    --------
+    >>> np.histogram([1, 2, 1], bins=[0, 1, 2, 3])
+    (array([0, 2, 1]), array([0, 1, 2, 3]))
+    >>> np.histogram(np.arange(4), bins=np.arange(5), density=True)
+    (array([0.25, 0.25, 0.25, 0.25]), array([0, 1, 2, 3, 4]))
+    >>> np.histogram([[1, 2, 1], [1, 0, 1]], bins=[0,1,2,3])
+    (array([1, 4, 1]), array([0, 1, 2, 3]))
+
+    >>> a = np.arange(5)
+    >>> hist, bin_edges = np.histogram(a, density=True)
+    >>> hist
+    array([0.5, 0. , 0.5, 0. , 0. , 0.5, 0. , 0.5, 0. , 0.5])
+    >>> hist.sum()
+    2.4999999999999996
+    >>> np.sum(hist * np.diff(bin_edges))
+    1.0
+
+    .. versionadded:: 1.11.0
+
+    Automated Bin Selection Methods example, using 2 peak random data
+    with 2000 points:
+
+    >>> import matplotlib.pyplot as plt
+    >>> rng = np.random.RandomState(10)  # deterministic random data
+    >>> a = np.hstack((rng.normal(size=1000),
+    ...                rng.normal(loc=5, scale=2, size=1000)))
+    >>> _ = plt.hist(a, bins='auto')  # arguments are passed to np.histogram
+    >>> plt.title("Histogram with 'auto' bins")
+    Text(0.5, 1.0, "Histogram with 'auto' bins")
+    >>> plt.show()
+
+    """
+    a, weights = _ravel_and_check_weights(a, weights)
+
+    bin_edges, uniform_bins = _get_bin_edges(a, bins, range, weights)
+
+    # Histogram is an integer or a float array depending on the weights.
+    if weights is None:
+        ntype = np.dtype(np.intp)
+    else:
+        ntype = weights.dtype
+
+    # We set a block size, as this allows us to iterate over chunks when
+    # computing histograms, to minimize memory usage.
+    BLOCK = 65536
+
+    # The fast path uses bincount, but that only works for certain types
+    # of weight
+    simple_weights = (
+        weights is None or
+        np.can_cast(weights.dtype, np.double) or
+        np.can_cast(weights.dtype, complex)
+    )
+
+    if uniform_bins is not None and simple_weights:
+        # Fast algorithm for equal bins
+        # We now convert values of a to bin indices, under the assumption of
+        # equal bin widths (which is valid here).
+        first_edge, last_edge, n_equal_bins = uniform_bins
+
+        # Initialize empty histogram
+        n = np.zeros(n_equal_bins, ntype)
+
+        # Pre-compute histogram scaling factor
+        norm = n_equal_bins / _unsigned_subtract(last_edge, first_edge)
+
+        # We iterate over blocks here for two reasons: the first is that for
+        # large arrays, it is actually faster (for example for a 10^8 array it
+        # is 2x as fast) and it results in a memory footprint 3x lower in the
+        # limit of large arrays.
+        for i in _range(0, len(a), BLOCK):
+            tmp_a = a[i:i+BLOCK]
+            if weights is None:
+                tmp_w = None
+            else:
+                tmp_w = weights[i:i + BLOCK]
+
+            # Only include values in the right range
+            keep = (tmp_a >= first_edge)
+            keep &= (tmp_a <= last_edge)
+            if not np.logical_and.reduce(keep):
+                tmp_a = tmp_a[keep]
+                if tmp_w is not None:
+                    tmp_w = tmp_w[keep]
+
+            # This cast ensures no type promotions occur below, which gh-10322
+            # make unpredictable. Getting it wrong leads to precision errors
+            # like gh-8123.
+            tmp_a = tmp_a.astype(bin_edges.dtype, copy=False)
+
+            # Compute the bin indices, and for values that lie exactly on
+            # last_edge we need to subtract one
+            f_indices = _unsigned_subtract(tmp_a, first_edge) * norm
+            indices = f_indices.astype(np.intp)
+            indices[indices == n_equal_bins] -= 1
+
+            # The index computation is not guaranteed to give exactly
+            # consistent results within ~1 ULP of the bin edges.
+            decrement = tmp_a < bin_edges[indices]
+            indices[decrement] -= 1
+            # The last bin includes the right edge. The other bins do not.
+            increment = ((tmp_a >= bin_edges[indices + 1])
+                         & (indices != n_equal_bins - 1))
+            indices[increment] += 1
+
+            # We now compute the histogram using bincount
+            if ntype.kind == 'c':
+                n.real += np.bincount(indices, weights=tmp_w.real,
+                                      minlength=n_equal_bins)
+                n.imag += np.bincount(indices, weights=tmp_w.imag,
+                                      minlength=n_equal_bins)
+            else:
+                n += np.bincount(indices, weights=tmp_w,
+                                 minlength=n_equal_bins).astype(ntype)
+    else:
+        # Compute via cumulative histogram
+        cum_n = np.zeros(bin_edges.shape, ntype)
+        if weights is None:
+            for i in _range(0, len(a), BLOCK):
+                sa = np.sort(a[i:i+BLOCK])
+                cum_n += _search_sorted_inclusive(sa, bin_edges)
+        else:
+            zero = np.zeros(1, dtype=ntype)
+            for i in _range(0, len(a), BLOCK):
+                tmp_a = a[i:i+BLOCK]
+                tmp_w = weights[i:i+BLOCK]
+                sorting_index = np.argsort(tmp_a)
+                sa = tmp_a[sorting_index]
+                sw = tmp_w[sorting_index]
+                cw = np.concatenate((zero, sw.cumsum()))
+                bin_index = _search_sorted_inclusive(sa, bin_edges)
+                cum_n += cw[bin_index]
+
+        n = np.diff(cum_n)
+
+    # density overrides the normed keyword
+    if density is not None:
+        if normed is not None:
+            # 2018-06-13, numpy 1.15.0 (this was not noisily deprecated in 1.6)
+            warnings.warn(
+                    "The normed argument is ignored when density is provided. "
+                    "In future passing both will result in an error.",
+                    DeprecationWarning, stacklevel=3)
+        normed = None
+
+    if density:
+        db = np.array(np.diff(bin_edges), float)
+        return n/db/n.sum(), bin_edges
+    elif normed:
+        # 2018-06-13, numpy 1.15.0 (this was not noisily deprecated in 1.6)
+        warnings.warn(
+                "Passing `normed=True` on non-uniform bins has always been "
+                "broken, and computes neither the probability density "
+                "function nor the probability mass function. "
+                "The result is only correct if the bins are uniform, when "
+                "density=True will produce the same result anyway. "
+                "The argument will be removed in a future version of "
+                "numpy.",
+                np.VisibleDeprecationWarning, stacklevel=3)
+
+        # this normalization is incorrect, but
+        db = np.array(np.diff(bin_edges), float)
+        return n/(n*db).sum(), bin_edges
+    else:
+        if normed is not None:
+            # 2018-06-13, numpy 1.15.0 (this was not noisily deprecated in 1.6)
+            warnings.warn(
+                    "Passing normed=False is deprecated, and has no effect. "
+                    "Consider passing the density argument instead.",
+                    DeprecationWarning, stacklevel=3)
+        return n, bin_edges
+
+
+def _histogramdd_dispatcher(sample, bins=None, range=None, normed=None,
+                            weights=None, density=None):
+    if hasattr(sample, 'shape'):  # same condition as used in histogramdd
+        yield sample
+    else:
+        yield from sample
+    with contextlib.suppress(TypeError):
+        yield from bins
+    yield weights
+
+
+@array_function_dispatch(_histogramdd_dispatcher)
+def histogramdd(sample, bins=10, range=None, normed=None, weights=None,
+                density=None):
+    """
+    Compute the multidimensional histogram of some data.
+
+    Parameters
+    ----------
+    sample : (N, D) array, or (D, N) array_like
+        The data to be histogrammed.
+
+        Note the unusual interpretation of sample when an array_like:
+
+        * When an array, each row is a coordinate in a D-dimensional space -
+          such as ``histogramdd(np.array([p1, p2, p3]))``.
+        * When an array_like, each element is the list of values for single
+          coordinate - such as ``histogramdd((X, Y, Z))``.
+
+        The first form should be preferred.
+
+    bins : sequence or int, optional
+        The bin specification:
+
+        * A sequence of arrays describing the monotonically increasing bin
+          edges along each dimension.
+        * The number of bins for each dimension (nx, ny, ... =bins)
+        * The number of bins for all dimensions (nx=ny=...=bins).
+
+    range : sequence, optional
+        A sequence of length D, each an optional (lower, upper) tuple giving
+        the outer bin edges to be used if the edges are not given explicitly in
+        `bins`.
+        An entry of None in the sequence results in the minimum and maximum
+        values being used for the corresponding dimension.
+        The default, None, is equivalent to passing a tuple of D None values.
+    density : bool, optional
+        If False, the default, returns the number of samples in each bin.
+        If True, returns the probability *density* function at the bin,
+        ``bin_count / sample_count / bin_volume``.
+    normed : bool, optional
+        An alias for the density argument that behaves identically. To avoid
+        confusion with the broken normed argument to `histogram`, `density`
+        should be preferred.
+    weights : (N,) array_like, optional
+        An array of values `w_i` weighing each sample `(x_i, y_i, z_i, ...)`.
+        Weights are normalized to 1 if normed is True. If normed is False,
+        the values of the returned histogram are equal to the sum of the
+        weights belonging to the samples falling into each bin.
+
+    Returns
+    -------
+    H : ndarray
+        The multidimensional histogram of sample x. See normed and weights
+        for the different possible semantics.
+    edges : list
+        A list of D arrays describing the bin edges for each dimension.
+
+    See Also
+    --------
+    histogram: 1-D histogram
+    histogram2d: 2-D histogram
+
+    Examples
+    --------
+    >>> r = np.random.randn(100,3)
+    >>> H, edges = np.histogramdd(r, bins = (5, 8, 4))
+    >>> H.shape, edges[0].size, edges[1].size, edges[2].size
+    ((5, 8, 4), 6, 9, 5)
+
+    """
+
+    try:
+        # Sample is an ND-array.
+        N, D = sample.shape
+    except (AttributeError, ValueError):
+        # Sample is a sequence of 1D arrays.
+        sample = np.atleast_2d(sample).T
+        N, D = sample.shape
+
+    nbin = np.empty(D, int)
+    edges = D*[None]
+    dedges = D*[None]
+    if weights is not None:
+        weights = np.asarray(weights)
+
+    try:
+        M = len(bins)
+        if M != D:
+            raise ValueError(
+                'The dimension of bins must be equal to the dimension of the '
+                ' sample x.')
+    except TypeError:
+        # bins is an integer
+        bins = D*[bins]
+
+    # normalize the range argument
+    if range is None:
+        range = (None,) * D
+    elif len(range) != D:
+        raise ValueError('range argument must have one entry per dimension')
+
+    # Create edge arrays
+    for i in _range(D):
+        if np.ndim(bins[i]) == 0:
+            if bins[i] < 1:
+                raise ValueError(
+                    '`bins[{}]` must be positive, when an integer'.format(i))
+            smin, smax = _get_outer_edges(sample[:,i], range[i])
+            try:
+                n = operator.index(bins[i])
+            
+            except TypeError as e:
+                raise TypeError(
+                	"`bins[{}]` must be an integer, when a scalar".format(i)
+                ) from e
+                
+            edges[i] = np.linspace(smin, smax, n + 1)    
+        elif np.ndim(bins[i]) == 1:
+            edges[i] = np.asarray(bins[i])
+            if np.any(edges[i][:-1] > edges[i][1:]):
+                raise ValueError(
+                    '`bins[{}]` must be monotonically increasing, when an array'
+                    .format(i))
+        else:
+            raise ValueError(
+                '`bins[{}]` must be a scalar or 1d array'.format(i))
+
+        nbin[i] = len(edges[i]) + 1  # includes an outlier on each end
+        dedges[i] = np.diff(edges[i])
+
+    # Compute the bin number each sample falls into.
+    Ncount = tuple(
+        # avoid np.digitize to work around gh-11022
+        np.searchsorted(edges[i], sample[:, i], side='right')
+        for i in _range(D)
+    )
+
+    # Using digitize, values that fall on an edge are put in the right bin.
+    # For the rightmost bin, we want values equal to the right edge to be
+    # counted in the last bin, and not as an outlier.
+    for i in _range(D):
+        # Find which points are on the rightmost edge.
+        on_edge = (sample[:, i] == edges[i][-1])
+        # Shift these points one bin to the left.
+        Ncount[i][on_edge] -= 1
+
+    # Compute the sample indices in the flattened histogram matrix.
+    # This raises an error if the array is too large.
+    xy = np.ravel_multi_index(Ncount, nbin)
+
+    # Compute the number of repetitions in xy and assign it to the
+    # flattened histmat.
+    hist = np.bincount(xy, weights, minlength=nbin.prod())
+
+    # Shape into a proper matrix
+    hist = hist.reshape(nbin)
+
+    # This preserves the (bad) behavior observed in gh-7845, for now.
+    hist = hist.astype(float, casting='safe')
+
+    # Remove outliers (indices 0 and -1 for each dimension).
+    core = D*(slice(1, -1),)
+    hist = hist[core]
+
+    # handle the aliasing normed argument
+    if normed is None:
+        if density is None:
+            density = False
+    elif density is None:
+        # an explicit normed argument was passed, alias it to the new name
+        density = normed
+    else:
+        raise TypeError("Cannot specify both 'normed' and 'density'")
+
+    if density:
+        # calculate the probability density function
+        s = hist.sum()
+        for i in _range(D):
+            shape = np.ones(D, int)
+            shape[i] = nbin[i] - 2
+            hist = hist / dedges[i].reshape(shape)
+        hist /= s
+
+    if (hist.shape != nbin - 2).any():
+        raise RuntimeError(
+            "Internal Shape Error")
+    return hist, edges
diff --git a/venv/Lib/site-packages/numpy/lib/index_tricks.py b/venv/Lib/site-packages/numpy/lib/index_tricks.py
new file mode 100644
index 000000000..d145477c3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/index_tricks.py
@@ -0,0 +1,980 @@
+import functools
+import sys
+import math
+
+import numpy.core.numeric as _nx
+from numpy.core.numeric import (
+    asarray, ScalarType, array, alltrue, cumprod, arange, ndim
+    )
+from numpy.core.numerictypes import find_common_type, issubdtype
+
+import numpy.matrixlib as matrixlib
+from .function_base import diff
+from numpy.core.multiarray import ravel_multi_index, unravel_index
+from numpy.core.overrides import set_module
+from numpy.core import overrides, linspace
+from numpy.lib.stride_tricks import as_strided
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = [
+    'ravel_multi_index', 'unravel_index', 'mgrid', 'ogrid', 'r_', 'c_',
+    's_', 'index_exp', 'ix_', 'ndenumerate', 'ndindex', 'fill_diagonal',
+    'diag_indices', 'diag_indices_from'
+    ]
+
+
+def _ix__dispatcher(*args):
+    return args
+
+
+@array_function_dispatch(_ix__dispatcher)
+def ix_(*args):
+    """
+    Construct an open mesh from multiple sequences.
+
+    This function takes N 1-D sequences and returns N outputs with N
+    dimensions each, such that the shape is 1 in all but one dimension
+    and the dimension with the non-unit shape value cycles through all
+    N dimensions.
+
+    Using `ix_` one can quickly construct index arrays that will index
+    the cross product. ``a[np.ix_([1,3],[2,5])]`` returns the array
+    ``[[a[1,2] a[1,5]], [a[3,2] a[3,5]]]``.
+
+    Parameters
+    ----------
+    args : 1-D sequences
+        Each sequence should be of integer or boolean type.
+        Boolean sequences will be interpreted as boolean masks for the
+        corresponding dimension (equivalent to passing in
+        ``np.nonzero(boolean_sequence)``).
+
+    Returns
+    -------
+    out : tuple of ndarrays
+        N arrays with N dimensions each, with N the number of input
+        sequences. Together these arrays form an open mesh.
+
+    See Also
+    --------
+    ogrid, mgrid, meshgrid
+
+    Examples
+    --------
+    >>> a = np.arange(10).reshape(2, 5)
+    >>> a
+    array([[0, 1, 2, 3, 4],
+           [5, 6, 7, 8, 9]])
+    >>> ixgrid = np.ix_([0, 1], [2, 4])
+    >>> ixgrid
+    (array([[0],
+           [1]]), array([[2, 4]]))
+    >>> ixgrid[0].shape, ixgrid[1].shape
+    ((2, 1), (1, 2))
+    >>> a[ixgrid]
+    array([[2, 4],
+           [7, 9]])
+
+    >>> ixgrid = np.ix_([True, True], [2, 4])
+    >>> a[ixgrid]
+    array([[2, 4],
+           [7, 9]])
+    >>> ixgrid = np.ix_([True, True], [False, False, True, False, True])
+    >>> a[ixgrid]
+    array([[2, 4],
+           [7, 9]])
+
+    """
+    out = []
+    nd = len(args)
+    for k, new in enumerate(args):
+        if not isinstance(new, _nx.ndarray):
+            new = asarray(new)
+            if new.size == 0:
+                # Explicitly type empty arrays to avoid float default
+                new = new.astype(_nx.intp)
+        if new.ndim != 1:
+            raise ValueError("Cross index must be 1 dimensional")
+        if issubdtype(new.dtype, _nx.bool_):
+            new, = new.nonzero()
+        new = new.reshape((1,)*k + (new.size,) + (1,)*(nd-k-1))
+        out.append(new)
+    return tuple(out)
+
+class nd_grid:
+    """
+    Construct a multi-dimensional "meshgrid".
+
+    ``grid = nd_grid()`` creates an instance which will return a mesh-grid
+    when indexed.  The dimension and number of the output arrays are equal
+    to the number of indexing dimensions.  If the step length is not a
+    complex number, then the stop is not inclusive.
+
+    However, if the step length is a **complex number** (e.g. 5j), then the
+    integer part of its magnitude is interpreted as specifying the
+    number of points to create between the start and stop values, where
+    the stop value **is inclusive**.
+
+    If instantiated with an argument of ``sparse=True``, the mesh-grid is
+    open (or not fleshed out) so that only one-dimension of each returned
+    argument is greater than 1.
+
+    Parameters
+    ----------
+    sparse : bool, optional
+        Whether the grid is sparse or not. Default is False.
+
+    Notes
+    -----
+    Two instances of `nd_grid` are made available in the NumPy namespace,
+    `mgrid` and `ogrid`, approximately defined as::
+
+        mgrid = nd_grid(sparse=False)
+        ogrid = nd_grid(sparse=True)
+
+    Users should use these pre-defined instances instead of using `nd_grid`
+    directly.
+    """
+
+    def __init__(self, sparse=False):
+        self.sparse = sparse
+
+    def __getitem__(self, key):
+        try:
+            size = []
+            typ = int
+            for k in range(len(key)):
+                step = key[k].step
+                start = key[k].start
+                if start is None:
+                    start = 0
+                if step is None:
+                    step = 1
+                if isinstance(step, complex):
+                    size.append(int(abs(step)))
+                    typ = float
+                else:
+                    size.append(
+                        int(math.ceil((key[k].stop - start)/(step*1.0))))
+                if (isinstance(step, float) or
+                        isinstance(start, float) or
+                        isinstance(key[k].stop, float)):
+                    typ = float
+            if self.sparse:
+                nn = [_nx.arange(_x, dtype=_t)
+                        for _x, _t in zip(size, (typ,)*len(size))]
+            else:
+                nn = _nx.indices(size, typ)
+            for k in range(len(size)):
+                step = key[k].step
+                start = key[k].start
+                if start is None:
+                    start = 0
+                if step is None:
+                    step = 1
+                if isinstance(step, complex):
+                    step = int(abs(step))
+                    if step != 1:
+                        step = (key[k].stop - start)/float(step-1)
+                nn[k] = (nn[k]*step+start)
+            if self.sparse:
+                slobj = [_nx.newaxis]*len(size)
+                for k in range(len(size)):
+                    slobj[k] = slice(None, None)
+                    nn[k] = nn[k][tuple(slobj)]
+                    slobj[k] = _nx.newaxis
+            return nn
+        except (IndexError, TypeError):
+            step = key.step
+            stop = key.stop
+            start = key.start
+            if start is None:
+                start = 0
+            if isinstance(step, complex):
+                step = abs(step)
+                length = int(step)
+                if step != 1:
+                    step = (key.stop-start)/float(step-1)
+                stop = key.stop + step
+                return _nx.arange(0, length, 1, float)*step + start
+            else:
+                return _nx.arange(start, stop, step)
+
+
+class MGridClass(nd_grid):
+    """
+    `nd_grid` instance which returns a dense multi-dimensional "meshgrid".
+
+    An instance of `numpy.lib.index_tricks.nd_grid` which returns an dense
+    (or fleshed out) mesh-grid when indexed, so that each returned argument
+    has the same shape.  The dimensions and number of the output arrays are
+    equal to the number of indexing dimensions.  If the step length is not a
+    complex number, then the stop is not inclusive.
+
+    However, if the step length is a **complex number** (e.g. 5j), then
+    the integer part of its magnitude is interpreted as specifying the
+    number of points to create between the start and stop values, where
+    the stop value **is inclusive**.
+
+    Returns
+    ----------
+    mesh-grid `ndarrays` all of the same dimensions
+
+    See Also
+    --------
+    numpy.lib.index_tricks.nd_grid : class of `ogrid` and `mgrid` objects
+    ogrid : like mgrid but returns open (not fleshed out) mesh grids
+    r_ : array concatenator
+
+    Examples
+    --------
+    >>> np.mgrid[0:5,0:5]
+    array([[[0, 0, 0, 0, 0],
+            [1, 1, 1, 1, 1],
+            [2, 2, 2, 2, 2],
+            [3, 3, 3, 3, 3],
+            [4, 4, 4, 4, 4]],
+           [[0, 1, 2, 3, 4],
+            [0, 1, 2, 3, 4],
+            [0, 1, 2, 3, 4],
+            [0, 1, 2, 3, 4],
+            [0, 1, 2, 3, 4]]])
+    >>> np.mgrid[-1:1:5j]
+    array([-1. , -0.5,  0. ,  0.5,  1. ])
+
+    """
+    def __init__(self):
+        super(MGridClass, self).__init__(sparse=False)
+
+mgrid = MGridClass()
+
+class OGridClass(nd_grid):
+    """
+    `nd_grid` instance which returns an open multi-dimensional "meshgrid".
+
+    An instance of `numpy.lib.index_tricks.nd_grid` which returns an open
+    (i.e. not fleshed out) mesh-grid when indexed, so that only one dimension
+    of each returned array is greater than 1.  The dimension and number of the
+    output arrays are equal to the number of indexing dimensions.  If the step
+    length is not a complex number, then the stop is not inclusive.
+
+    However, if the step length is a **complex number** (e.g. 5j), then
+    the integer part of its magnitude is interpreted as specifying the
+    number of points to create between the start and stop values, where
+    the stop value **is inclusive**.
+
+    Returns
+    -------
+    mesh-grid
+        `ndarrays` with only one dimension not equal to 1
+
+    See Also
+    --------
+    np.lib.index_tricks.nd_grid : class of `ogrid` and `mgrid` objects
+    mgrid : like `ogrid` but returns dense (or fleshed out) mesh grids
+    r_ : array concatenator
+
+    Examples
+    --------
+    >>> from numpy import ogrid
+    >>> ogrid[-1:1:5j]
+    array([-1. , -0.5,  0. ,  0.5,  1. ])
+    >>> ogrid[0:5,0:5]
+    [array([[0],
+            [1],
+            [2],
+            [3],
+            [4]]), array([[0, 1, 2, 3, 4]])]
+
+    """
+    def __init__(self):
+        super(OGridClass, self).__init__(sparse=True)
+
+ogrid = OGridClass()
+
+
+class AxisConcatenator:
+    """
+    Translates slice objects to concatenation along an axis.
+
+    For detailed documentation on usage, see `r_`.
+    """
+    # allow ma.mr_ to override this
+    concatenate = staticmethod(_nx.concatenate)
+    makemat = staticmethod(matrixlib.matrix)
+
+    def __init__(self, axis=0, matrix=False, ndmin=1, trans1d=-1):
+        self.axis = axis
+        self.matrix = matrix
+        self.trans1d = trans1d
+        self.ndmin = ndmin
+
+    def __getitem__(self, key):
+        # handle matrix builder syntax
+        if isinstance(key, str):
+            frame = sys._getframe().f_back
+            mymat = matrixlib.bmat(key, frame.f_globals, frame.f_locals)
+            return mymat
+
+        if not isinstance(key, tuple):
+            key = (key,)
+
+        # copy attributes, since they can be overridden in the first argument
+        trans1d = self.trans1d
+        ndmin = self.ndmin
+        matrix = self.matrix
+        axis = self.axis
+
+        objs = []
+        scalars = []
+        arraytypes = []
+        scalartypes = []
+
+        for k, item in enumerate(key):
+            scalar = False
+            if isinstance(item, slice):
+                step = item.step
+                start = item.start
+                stop = item.stop
+                if start is None:
+                    start = 0
+                if step is None:
+                    step = 1
+                if isinstance(step, complex):
+                    size = int(abs(step))
+                    newobj = linspace(start, stop, num=size)
+                else:
+                    newobj = _nx.arange(start, stop, step)
+                if ndmin > 1:
+                    newobj = array(newobj, copy=False, ndmin=ndmin)
+                    if trans1d != -1:
+                        newobj = newobj.swapaxes(-1, trans1d)
+            elif isinstance(item, str):
+                if k != 0:
+                    raise ValueError("special directives must be the "
+                            "first entry.")
+                if item in ('r', 'c'):
+                    matrix = True
+                    col = (item == 'c')
+                    continue
+                if ',' in item:
+                    vec = item.split(',')
+                    try:
+                        axis, ndmin = [int(x) for x in vec[:2]]
+                        if len(vec) == 3:
+                            trans1d = int(vec[2])
+                        continue
+                    except Exception as e:
+                        raise ValueError(
+                            "unknown special directive {!r}".format(item)
+                        ) from e
+                try:
+                    axis = int(item)
+                    continue
+                except (ValueError, TypeError):
+                    raise ValueError("unknown special directive")
+            elif type(item) in ScalarType:
+                newobj = array(item, ndmin=ndmin)
+                scalars.append(len(objs))
+                scalar = True
+                scalartypes.append(newobj.dtype)
+            else:
+                item_ndim = ndim(item)
+                newobj = array(item, copy=False, subok=True, ndmin=ndmin)
+                if trans1d != -1 and item_ndim < ndmin:
+                    k2 = ndmin - item_ndim
+                    k1 = trans1d
+                    if k1 < 0:
+                        k1 += k2 + 1
+                    defaxes = list(range(ndmin))
+                    axes = defaxes[:k1] + defaxes[k2:] + defaxes[k1:k2]
+                    newobj = newobj.transpose(axes)
+            objs.append(newobj)
+            if not scalar and isinstance(newobj, _nx.ndarray):
+                arraytypes.append(newobj.dtype)
+
+        # Ensure that scalars won't up-cast unless warranted
+        final_dtype = find_common_type(arraytypes, scalartypes)
+        if final_dtype is not None:
+            for k in scalars:
+                objs[k] = objs[k].astype(final_dtype)
+
+        res = self.concatenate(tuple(objs), axis=axis)
+
+        if matrix:
+            oldndim = res.ndim
+            res = self.makemat(res)
+            if oldndim == 1 and col:
+                res = res.T
+        return res
+
+    def __len__(self):
+        return 0
+
+# separate classes are used here instead of just making r_ = concatentor(0),
+# etc. because otherwise we couldn't get the doc string to come out right
+# in help(r_)
+
+class RClass(AxisConcatenator):
+    """
+    Translates slice objects to concatenation along the first axis.
+
+    This is a simple way to build up arrays quickly. There are two use cases.
+
+    1. If the index expression contains comma separated arrays, then stack
+       them along their first axis.
+    2. If the index expression contains slice notation or scalars then create
+       a 1-D array with a range indicated by the slice notation.
+
+    If slice notation is used, the syntax ``start:stop:step`` is equivalent
+    to ``np.arange(start, stop, step)`` inside of the brackets. However, if
+    ``step`` is an imaginary number (i.e. 100j) then its integer portion is
+    interpreted as a number-of-points desired and the start and stop are
+    inclusive. In other words ``start:stop:stepj`` is interpreted as
+    ``np.linspace(start, stop, step, endpoint=1)`` inside of the brackets.
+    After expansion of slice notation, all comma separated sequences are
+    concatenated together.
+
+    Optional character strings placed as the first element of the index
+    expression can be used to change the output. The strings 'r' or 'c' result
+    in matrix output. If the result is 1-D and 'r' is specified a 1 x N (row)
+    matrix is produced. If the result is 1-D and 'c' is specified, then a N x 1
+    (column) matrix is produced. If the result is 2-D then both provide the
+    same matrix result.
+
+    A string integer specifies which axis to stack multiple comma separated
+    arrays along. A string of two comma-separated integers allows indication
+    of the minimum number of dimensions to force each entry into as the
+    second integer (the axis to concatenate along is still the first integer).
+
+    A string with three comma-separated integers allows specification of the
+    axis to concatenate along, the minimum number of dimensions to force the
+    entries to, and which axis should contain the start of the arrays which
+    are less than the specified number of dimensions. In other words the third
+    integer allows you to specify where the 1's should be placed in the shape
+    of the arrays that have their shapes upgraded. By default, they are placed
+    in the front of the shape tuple. The third argument allows you to specify
+    where the start of the array should be instead. Thus, a third argument of
+    '0' would place the 1's at the end of the array shape. Negative integers
+    specify where in the new shape tuple the last dimension of upgraded arrays
+    should be placed, so the default is '-1'.
+
+    Parameters
+    ----------
+    Not a function, so takes no parameters
+
+
+    Returns
+    -------
+    A concatenated ndarray or matrix.
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    c_ : Translates slice objects to concatenation along the second axis.
+
+    Examples
+    --------
+    >>> np.r_[np.array([1,2,3]), 0, 0, np.array([4,5,6])]
+    array([1, 2, 3, ..., 4, 5, 6])
+    >>> np.r_[-1:1:6j, [0]*3, 5, 6]
+    array([-1. , -0.6, -0.2,  0.2,  0.6,  1. ,  0. ,  0. ,  0. ,  5. ,  6. ])
+
+    String integers specify the axis to concatenate along or the minimum
+    number of dimensions to force entries into.
+
+    >>> a = np.array([[0, 1, 2], [3, 4, 5]])
+    >>> np.r_['-1', a, a] # concatenate along last axis
+    array([[0, 1, 2, 0, 1, 2],
+           [3, 4, 5, 3, 4, 5]])
+    >>> np.r_['0,2', [1,2,3], [4,5,6]] # concatenate along first axis, dim>=2
+    array([[1, 2, 3],
+           [4, 5, 6]])
+
+    >>> np.r_['0,2,0', [1,2,3], [4,5,6]]
+    array([[1],
+           [2],
+           [3],
+           [4],
+           [5],
+           [6]])
+    >>> np.r_['1,2,0', [1,2,3], [4,5,6]]
+    array([[1, 4],
+           [2, 5],
+           [3, 6]])
+
+    Using 'r' or 'c' as a first string argument creates a matrix.
+
+    >>> np.r_['r',[1,2,3], [4,5,6]]
+    matrix([[1, 2, 3, 4, 5, 6]])
+
+    """
+
+    def __init__(self):
+        AxisConcatenator.__init__(self, 0)
+
+r_ = RClass()
+
+class CClass(AxisConcatenator):
+    """
+    Translates slice objects to concatenation along the second axis.
+
+    This is short-hand for ``np.r_['-1,2,0', index expression]``, which is
+    useful because of its common occurrence. In particular, arrays will be
+    stacked along their last axis after being upgraded to at least 2-D with
+    1's post-pended to the shape (column vectors made out of 1-D arrays).
+    
+    See Also
+    --------
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+    r_ : For more detailed documentation.
+
+    Examples
+    --------
+    >>> np.c_[np.array([1,2,3]), np.array([4,5,6])]
+    array([[1, 4],
+           [2, 5],
+           [3, 6]])
+    >>> np.c_[np.array([[1,2,3]]), 0, 0, np.array([[4,5,6]])]
+    array([[1, 2, 3, ..., 4, 5, 6]])
+
+    """
+
+    def __init__(self):
+        AxisConcatenator.__init__(self, -1, ndmin=2, trans1d=0)
+
+
+c_ = CClass()
+
+
+@set_module('numpy')
+class ndenumerate:
+    """
+    Multidimensional index iterator.
+
+    Return an iterator yielding pairs of array coordinates and values.
+
+    Parameters
+    ----------
+    arr : ndarray
+      Input array.
+
+    See Also
+    --------
+    ndindex, flatiter
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> for index, x in np.ndenumerate(a):
+    ...     print(index, x)
+    (0, 0) 1
+    (0, 1) 2
+    (1, 0) 3
+    (1, 1) 4
+
+    """
+
+    def __init__(self, arr):
+        self.iter = asarray(arr).flat
+
+    def __next__(self):
+        """
+        Standard iterator method, returns the index tuple and array value.
+
+        Returns
+        -------
+        coords : tuple of ints
+            The indices of the current iteration.
+        val : scalar
+            The array element of the current iteration.
+
+        """
+        return self.iter.coords, next(self.iter)
+
+    def __iter__(self):
+        return self
+
+
+@set_module('numpy')
+class ndindex:
+    """
+    An N-dimensional iterator object to index arrays.
+
+    Given the shape of an array, an `ndindex` instance iterates over
+    the N-dimensional index of the array. At each iteration a tuple
+    of indices is returned, the last dimension is iterated over first.
+
+    Parameters
+    ----------
+    `*args` : ints
+      The size of each dimension of the array.
+
+    See Also
+    --------
+    ndenumerate, flatiter
+
+    Examples
+    --------
+    >>> for index in np.ndindex(3, 2, 1):
+    ...     print(index)
+    (0, 0, 0)
+    (0, 1, 0)
+    (1, 0, 0)
+    (1, 1, 0)
+    (2, 0, 0)
+    (2, 1, 0)
+
+    """
+
+    def __init__(self, *shape):
+        if len(shape) == 1 and isinstance(shape[0], tuple):
+            shape = shape[0]
+        x = as_strided(_nx.zeros(1), shape=shape,
+                       strides=_nx.zeros_like(shape))
+        self._it = _nx.nditer(x, flags=['multi_index', 'zerosize_ok'],
+                              order='C')
+
+    def __iter__(self):
+        return self
+
+    def ndincr(self):
+        """
+        Increment the multi-dimensional index by one.
+
+        This method is for backward compatibility only: do not use.
+        """
+        next(self)
+
+    def __next__(self):
+        """
+        Standard iterator method, updates the index and returns the index
+        tuple.
+
+        Returns
+        -------
+        val : tuple of ints
+            Returns a tuple containing the indices of the current
+            iteration.
+
+        """
+        next(self._it)
+        return self._it.multi_index
+
+
+# You can do all this with slice() plus a few special objects,
+# but there's a lot to remember. This version is simpler because
+# it uses the standard array indexing syntax.
+#
+# Written by Konrad Hinsen <hinsen@cnrs-orleans.fr>
+# last revision: 1999-7-23
+#
+# Cosmetic changes by T. Oliphant 2001
+#
+#
+
+class IndexExpression:
+    """
+    A nicer way to build up index tuples for arrays.
+
+    .. note::
+       Use one of the two predefined instances `index_exp` or `s_`
+       rather than directly using `IndexExpression`.
+
+    For any index combination, including slicing and axis insertion,
+    ``a[indices]`` is the same as ``a[np.index_exp[indices]]`` for any
+    array `a`. However, ``np.index_exp[indices]`` can be used anywhere
+    in Python code and returns a tuple of slice objects that can be
+    used in the construction of complex index expressions.
+
+    Parameters
+    ----------
+    maketuple : bool
+        If True, always returns a tuple.
+
+    See Also
+    --------
+    index_exp : Predefined instance that always returns a tuple:
+       `index_exp = IndexExpression(maketuple=True)`.
+    s_ : Predefined instance without tuple conversion:
+       `s_ = IndexExpression(maketuple=False)`.
+
+    Notes
+    -----
+    You can do all this with `slice()` plus a few special objects,
+    but there's a lot to remember and this version is simpler because
+    it uses the standard array indexing syntax.
+
+    Examples
+    --------
+    >>> np.s_[2::2]
+    slice(2, None, 2)
+    >>> np.index_exp[2::2]
+    (slice(2, None, 2),)
+
+    >>> np.array([0, 1, 2, 3, 4])[np.s_[2::2]]
+    array([2, 4])
+
+    """
+
+    def __init__(self, maketuple):
+        self.maketuple = maketuple
+
+    def __getitem__(self, item):
+        if self.maketuple and not isinstance(item, tuple):
+            return (item,)
+        else:
+            return item
+
+index_exp = IndexExpression(maketuple=True)
+s_ = IndexExpression(maketuple=False)
+
+# End contribution from Konrad.
+
+
+# The following functions complement those in twodim_base, but are
+# applicable to N-dimensions.
+
+
+def _fill_diagonal_dispatcher(a, val, wrap=None):
+    return (a,)
+
+
+@array_function_dispatch(_fill_diagonal_dispatcher)
+def fill_diagonal(a, val, wrap=False):
+    """Fill the main diagonal of the given array of any dimensionality.
+
+    For an array `a` with ``a.ndim >= 2``, the diagonal is the list of
+    locations with indices ``a[i, ..., i]`` all identical. This function
+    modifies the input array in-place, it does not return a value.
+
+    Parameters
+    ----------
+    a : array, at least 2-D.
+      Array whose diagonal is to be filled, it gets modified in-place.
+
+    val : scalar
+      Value to be written on the diagonal, its type must be compatible with
+      that of the array a.
+
+    wrap : bool
+      For tall matrices in NumPy version up to 1.6.2, the
+      diagonal "wrapped" after N columns. You can have this behavior
+      with this option. This affects only tall matrices.
+
+    See also
+    --------
+    diag_indices, diag_indices_from
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    This functionality can be obtained via `diag_indices`, but internally
+    this version uses a much faster implementation that never constructs the
+    indices and uses simple slicing.
+
+    Examples
+    --------
+    >>> a = np.zeros((3, 3), int)
+    >>> np.fill_diagonal(a, 5)
+    >>> a
+    array([[5, 0, 0],
+           [0, 5, 0],
+           [0, 0, 5]])
+
+    The same function can operate on a 4-D array:
+
+    >>> a = np.zeros((3, 3, 3, 3), int)
+    >>> np.fill_diagonal(a, 4)
+
+    We only show a few blocks for clarity:
+
+    >>> a[0, 0]
+    array([[4, 0, 0],
+           [0, 0, 0],
+           [0, 0, 0]])
+    >>> a[1, 1]
+    array([[0, 0, 0],
+           [0, 4, 0],
+           [0, 0, 0]])
+    >>> a[2, 2]
+    array([[0, 0, 0],
+           [0, 0, 0],
+           [0, 0, 4]])
+
+    The wrap option affects only tall matrices:
+
+    >>> # tall matrices no wrap
+    >>> a = np.zeros((5, 3), int)
+    >>> np.fill_diagonal(a, 4)
+    >>> a
+    array([[4, 0, 0],
+           [0, 4, 0],
+           [0, 0, 4],
+           [0, 0, 0],
+           [0, 0, 0]])
+
+    >>> # tall matrices wrap
+    >>> a = np.zeros((5, 3), int)
+    >>> np.fill_diagonal(a, 4, wrap=True)
+    >>> a
+    array([[4, 0, 0],
+           [0, 4, 0],
+           [0, 0, 4],
+           [0, 0, 0],
+           [4, 0, 0]])
+
+    >>> # wide matrices
+    >>> a = np.zeros((3, 5), int)
+    >>> np.fill_diagonal(a, 4, wrap=True)
+    >>> a
+    array([[4, 0, 0, 0, 0],
+           [0, 4, 0, 0, 0],
+           [0, 0, 4, 0, 0]])
+
+    The anti-diagonal can be filled by reversing the order of elements
+    using either `numpy.flipud` or `numpy.fliplr`.
+
+    >>> a = np.zeros((3, 3), int);
+    >>> np.fill_diagonal(np.fliplr(a), [1,2,3])  # Horizontal flip
+    >>> a
+    array([[0, 0, 1],
+           [0, 2, 0],
+           [3, 0, 0]])
+    >>> np.fill_diagonal(np.flipud(a), [1,2,3])  # Vertical flip
+    >>> a
+    array([[0, 0, 3],
+           [0, 2, 0],
+           [1, 0, 0]])
+
+    Note that the order in which the diagonal is filled varies depending
+    on the flip function.
+    """
+    if a.ndim < 2:
+        raise ValueError("array must be at least 2-d")
+    end = None
+    if a.ndim == 2:
+        # Explicit, fast formula for the common case.  For 2-d arrays, we
+        # accept rectangular ones.
+        step = a.shape[1] + 1
+        #This is needed to don't have tall matrix have the diagonal wrap.
+        if not wrap:
+            end = a.shape[1] * a.shape[1]
+    else:
+        # For more than d=2, the strided formula is only valid for arrays with
+        # all dimensions equal, so we check first.
+        if not alltrue(diff(a.shape) == 0):
+            raise ValueError("All dimensions of input must be of equal length")
+        step = 1 + (cumprod(a.shape[:-1])).sum()
+
+    # Write the value out into the diagonal.
+    a.flat[:end:step] = val
+
+
+@set_module('numpy')
+def diag_indices(n, ndim=2):
+    """
+    Return the indices to access the main diagonal of an array.
+
+    This returns a tuple of indices that can be used to access the main
+    diagonal of an array `a` with ``a.ndim >= 2`` dimensions and shape
+    (n, n, ..., n). For ``a.ndim = 2`` this is the usual diagonal, for
+    ``a.ndim > 2`` this is the set of indices to access ``a[i, i, ..., i]``
+    for ``i = [0..n-1]``.
+
+    Parameters
+    ----------
+    n : int
+      The size, along each dimension, of the arrays for which the returned
+      indices can be used.
+
+    ndim : int, optional
+      The number of dimensions.
+
+    See also
+    --------
+    diag_indices_from
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    Examples
+    --------
+    Create a set of indices to access the diagonal of a (4, 4) array:
+
+    >>> di = np.diag_indices(4)
+    >>> di
+    (array([0, 1, 2, 3]), array([0, 1, 2, 3]))
+    >>> a = np.arange(16).reshape(4, 4)
+    >>> a
+    array([[ 0,  1,  2,  3],
+           [ 4,  5,  6,  7],
+           [ 8,  9, 10, 11],
+           [12, 13, 14, 15]])
+    >>> a[di] = 100
+    >>> a
+    array([[100,   1,   2,   3],
+           [  4, 100,   6,   7],
+           [  8,   9, 100,  11],
+           [ 12,  13,  14, 100]])
+
+    Now, we create indices to manipulate a 3-D array:
+
+    >>> d3 = np.diag_indices(2, 3)
+    >>> d3
+    (array([0, 1]), array([0, 1]), array([0, 1]))
+
+    And use it to set the diagonal of an array of zeros to 1:
+
+    >>> a = np.zeros((2, 2, 2), dtype=int)
+    >>> a[d3] = 1
+    >>> a
+    array([[[1, 0],
+            [0, 0]],
+           [[0, 0],
+            [0, 1]]])
+
+    """
+    idx = arange(n)
+    return (idx,) * ndim
+
+
+def _diag_indices_from(arr):
+    return (arr,)
+
+
+@array_function_dispatch(_diag_indices_from)
+def diag_indices_from(arr):
+    """
+    Return the indices to access the main diagonal of an n-dimensional array.
+
+    See `diag_indices` for full details.
+
+    Parameters
+    ----------
+    arr : array, at least 2-D
+
+    See Also
+    --------
+    diag_indices
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    """
+
+    if not arr.ndim >= 2:
+        raise ValueError("input array must be at least 2-d")
+    # For more than d=2, the strided formula is only valid for arrays with
+    # all dimensions equal, so we check first.
+    if not alltrue(diff(arr.shape) == 0):
+        raise ValueError("All dimensions of input must be of equal length")
+
+    return diag_indices(arr.shape[0], arr.ndim)
diff --git a/venv/Lib/site-packages/numpy/lib/mixins.py b/venv/Lib/site-packages/numpy/lib/mixins.py
new file mode 100644
index 000000000..50157069c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/mixins.py
@@ -0,0 +1,176 @@
+"""Mixin classes for custom array types that don't inherit from ndarray."""
+from numpy.core import umath as um
+
+
+__all__ = ['NDArrayOperatorsMixin']
+
+
+def _disables_array_ufunc(obj):
+    """True when __array_ufunc__ is set to None."""
+    try:
+        return obj.__array_ufunc__ is None
+    except AttributeError:
+        return False
+
+
+def _binary_method(ufunc, name):
+    """Implement a forward binary method with a ufunc, e.g., __add__."""
+    def func(self, other):
+        if _disables_array_ufunc(other):
+            return NotImplemented
+        return ufunc(self, other)
+    func.__name__ = '__{}__'.format(name)
+    return func
+
+
+def _reflected_binary_method(ufunc, name):
+    """Implement a reflected binary method with a ufunc, e.g., __radd__."""
+    def func(self, other):
+        if _disables_array_ufunc(other):
+            return NotImplemented
+        return ufunc(other, self)
+    func.__name__ = '__r{}__'.format(name)
+    return func
+
+
+def _inplace_binary_method(ufunc, name):
+    """Implement an in-place binary method with a ufunc, e.g., __iadd__."""
+    def func(self, other):
+        return ufunc(self, other, out=(self,))
+    func.__name__ = '__i{}__'.format(name)
+    return func
+
+
+def _numeric_methods(ufunc, name):
+    """Implement forward, reflected and inplace binary methods with a ufunc."""
+    return (_binary_method(ufunc, name),
+            _reflected_binary_method(ufunc, name),
+            _inplace_binary_method(ufunc, name))
+
+
+def _unary_method(ufunc, name):
+    """Implement a unary special method with a ufunc."""
+    def func(self):
+        return ufunc(self)
+    func.__name__ = '__{}__'.format(name)
+    return func
+
+
+class NDArrayOperatorsMixin:
+    """Mixin defining all operator special methods using __array_ufunc__.
+
+    This class implements the special methods for almost all of Python's
+    builtin operators defined in the `operator` module, including comparisons
+    (``==``, ``>``, etc.) and arithmetic (``+``, ``*``, ``-``, etc.), by
+    deferring to the ``__array_ufunc__`` method, which subclasses must
+    implement.
+
+    It is useful for writing classes that do not inherit from `numpy.ndarray`,
+    but that should support arithmetic and numpy universal functions like
+    arrays as described in `A Mechanism for Overriding Ufuncs
+    <../../neps/nep-0013-ufunc-overrides.html>`_.
+
+    As an trivial example, consider this implementation of an ``ArrayLike``
+    class that simply wraps a NumPy array and ensures that the result of any
+    arithmetic operation is also an ``ArrayLike`` object::
+
+        class ArrayLike(np.lib.mixins.NDArrayOperatorsMixin):
+            def __init__(self, value):
+                self.value = np.asarray(value)
+
+            # One might also consider adding the built-in list type to this
+            # list, to support operations like np.add(array_like, list)
+            _HANDLED_TYPES = (np.ndarray, numbers.Number)
+
+            def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+                out = kwargs.get('out', ())
+                for x in inputs + out:
+                    # Only support operations with instances of _HANDLED_TYPES.
+                    # Use ArrayLike instead of type(self) for isinstance to
+                    # allow subclasses that don't override __array_ufunc__ to
+                    # handle ArrayLike objects.
+                    if not isinstance(x, self._HANDLED_TYPES + (ArrayLike,)):
+                        return NotImplemented
+
+                # Defer to the implementation of the ufunc on unwrapped values.
+                inputs = tuple(x.value if isinstance(x, ArrayLike) else x
+                               for x in inputs)
+                if out:
+                    kwargs['out'] = tuple(
+                        x.value if isinstance(x, ArrayLike) else x
+                        for x in out)
+                result = getattr(ufunc, method)(*inputs, **kwargs)
+
+                if type(result) is tuple:
+                    # multiple return values
+                    return tuple(type(self)(x) for x in result)
+                elif method == 'at':
+                    # no return value
+                    return None
+                else:
+                    # one return value
+                    return type(self)(result)
+
+            def __repr__(self):
+                return '%s(%r)' % (type(self).__name__, self.value)
+
+    In interactions between ``ArrayLike`` objects and numbers or numpy arrays,
+    the result is always another ``ArrayLike``:
+
+        >>> x = ArrayLike([1, 2, 3])
+        >>> x - 1
+        ArrayLike(array([0, 1, 2]))
+        >>> 1 - x
+        ArrayLike(array([ 0, -1, -2]))
+        >>> np.arange(3) - x
+        ArrayLike(array([-1, -1, -1]))
+        >>> x - np.arange(3)
+        ArrayLike(array([1, 1, 1]))
+
+    Note that unlike ``numpy.ndarray``, ``ArrayLike`` does not allow operations
+    with arbitrary, unrecognized types. This ensures that interactions with
+    ArrayLike preserve a well-defined casting hierarchy.
+
+    .. versionadded:: 1.13
+    """
+    # Like np.ndarray, this mixin class implements "Option 1" from the ufunc
+    # overrides NEP.
+
+    # comparisons don't have reflected and in-place versions
+    __lt__ = _binary_method(um.less, 'lt')
+    __le__ = _binary_method(um.less_equal, 'le')
+    __eq__ = _binary_method(um.equal, 'eq')
+    __ne__ = _binary_method(um.not_equal, 'ne')
+    __gt__ = _binary_method(um.greater, 'gt')
+    __ge__ = _binary_method(um.greater_equal, 'ge')
+
+    # numeric methods
+    __add__, __radd__, __iadd__ = _numeric_methods(um.add, 'add')
+    __sub__, __rsub__, __isub__ = _numeric_methods(um.subtract, 'sub')
+    __mul__, __rmul__, __imul__ = _numeric_methods(um.multiply, 'mul')
+    __matmul__, __rmatmul__, __imatmul__ = _numeric_methods(
+        um.matmul, 'matmul')
+    # Python 3 does not use __div__, __rdiv__, or __idiv__
+    __truediv__, __rtruediv__, __itruediv__ = _numeric_methods(
+        um.true_divide, 'truediv')
+    __floordiv__, __rfloordiv__, __ifloordiv__ = _numeric_methods(
+        um.floor_divide, 'floordiv')
+    __mod__, __rmod__, __imod__ = _numeric_methods(um.remainder, 'mod')
+    __divmod__ = _binary_method(um.divmod, 'divmod')
+    __rdivmod__ = _reflected_binary_method(um.divmod, 'divmod')
+    # __idivmod__ does not exist
+    # TODO: handle the optional third argument for __pow__?
+    __pow__, __rpow__, __ipow__ = _numeric_methods(um.power, 'pow')
+    __lshift__, __rlshift__, __ilshift__ = _numeric_methods(
+        um.left_shift, 'lshift')
+    __rshift__, __rrshift__, __irshift__ = _numeric_methods(
+        um.right_shift, 'rshift')
+    __and__, __rand__, __iand__ = _numeric_methods(um.bitwise_and, 'and')
+    __xor__, __rxor__, __ixor__ = _numeric_methods(um.bitwise_xor, 'xor')
+    __or__, __ror__, __ior__ = _numeric_methods(um.bitwise_or, 'or')
+
+    # unary methods
+    __neg__ = _unary_method(um.negative, 'neg')
+    __pos__ = _unary_method(um.positive, 'pos')
+    __abs__ = _unary_method(um.absolute, 'abs')
+    __invert__ = _unary_method(um.invert, 'invert')
diff --git a/venv/Lib/site-packages/numpy/lib/nanfunctions.py b/venv/Lib/site-packages/numpy/lib/nanfunctions.py
new file mode 100644
index 000000000..003550432
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/nanfunctions.py
@@ -0,0 +1,1670 @@
+"""
+Functions that ignore NaN.
+
+Functions
+---------
+
+- `nanmin` -- minimum non-NaN value
+- `nanmax` -- maximum non-NaN value
+- `nanargmin` -- index of minimum non-NaN value
+- `nanargmax` -- index of maximum non-NaN value
+- `nansum` -- sum of non-NaN values
+- `nanprod` -- product of non-NaN values
+- `nancumsum` -- cumulative sum of non-NaN values
+- `nancumprod` -- cumulative product of non-NaN values
+- `nanmean` -- mean of non-NaN values
+- `nanvar` -- variance of non-NaN values
+- `nanstd` -- standard deviation of non-NaN values
+- `nanmedian` -- median of non-NaN values
+- `nanquantile` -- qth quantile of non-NaN values
+- `nanpercentile` -- qth percentile of non-NaN values
+
+"""
+import functools
+import warnings
+import numpy as np
+from numpy.lib import function_base
+from numpy.core import overrides
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+__all__ = [
+    'nansum', 'nanmax', 'nanmin', 'nanargmax', 'nanargmin', 'nanmean',
+    'nanmedian', 'nanpercentile', 'nanvar', 'nanstd', 'nanprod',
+    'nancumsum', 'nancumprod', 'nanquantile'
+    ]
+
+
+def _nan_mask(a, out=None):
+    """
+    Parameters
+    ----------
+    a : array-like
+        Input array with at least 1 dimension.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output and will prevent the allocation of a new array.
+
+    Returns
+    -------
+    y : bool ndarray or True
+        A bool array where ``np.nan`` positions are marked with ``False``
+        and other positions are marked with ``True``. If the type of ``a``
+        is such that it can't possibly contain ``np.nan``, returns ``True``.
+    """
+    # we assume that a is an array for this private function
+
+    if a.dtype.kind not in 'fc':
+        return True
+
+    y = np.isnan(a, out=out)
+    y = np.invert(y, out=y)
+    return y
+
+def _replace_nan(a, val):
+    """
+    If `a` is of inexact type, make a copy of `a`, replace NaNs with
+    the `val` value, and return the copy together with a boolean mask
+    marking the locations where NaNs were present. If `a` is not of
+    inexact type, do nothing and return `a` together with a mask of None.
+
+    Note that scalars will end up as array scalars, which is important
+    for using the result as the value of the out argument in some
+    operations.
+
+    Parameters
+    ----------
+    a : array-like
+        Input array.
+    val : float
+        NaN values are set to val before doing the operation.
+
+    Returns
+    -------
+    y : ndarray
+        If `a` is of inexact type, return a copy of `a` with the NaNs
+        replaced by the fill value, otherwise return `a`.
+    mask: {bool, None}
+        If `a` is of inexact type, return a boolean mask marking locations of
+        NaNs, otherwise return None.
+
+    """
+    a = np.asanyarray(a)
+
+    if a.dtype == np.object_:
+        # object arrays do not support `isnan` (gh-9009), so make a guess
+        mask = np.not_equal(a, a, dtype=bool)
+    elif issubclass(a.dtype.type, np.inexact):
+        mask = np.isnan(a)
+    else:
+        mask = None
+
+    if mask is not None:
+        a = np.array(a, subok=True, copy=True)
+        np.copyto(a, val, where=mask)
+
+    return a, mask
+
+
+def _copyto(a, val, mask):
+    """
+    Replace values in `a` with NaN where `mask` is True.  This differs from
+    copyto in that it will deal with the case where `a` is a numpy scalar.
+
+    Parameters
+    ----------
+    a : ndarray or numpy scalar
+        Array or numpy scalar some of whose values are to be replaced
+        by val.
+    val : numpy scalar
+        Value used a replacement.
+    mask : ndarray, scalar
+        Boolean array. Where True the corresponding element of `a` is
+        replaced by `val`. Broadcasts.
+
+    Returns
+    -------
+    res : ndarray, scalar
+        Array with elements replaced or scalar `val`.
+
+    """
+    if isinstance(a, np.ndarray):
+        np.copyto(a, val, where=mask, casting='unsafe')
+    else:
+        a = a.dtype.type(val)
+    return a
+
+
+def _remove_nan_1d(arr1d, overwrite_input=False):
+    """
+    Equivalent to arr1d[~arr1d.isnan()], but in a different order
+
+    Presumably faster as it incurs fewer copies
+
+    Parameters
+    ----------
+    arr1d : ndarray
+        Array to remove nans from
+    overwrite_input : bool
+        True if `arr1d` can be modified in place
+
+    Returns
+    -------
+    res : ndarray
+        Array with nan elements removed
+    overwrite_input : bool
+        True if `res` can be modified in place, given the constraint on the
+        input
+    """
+
+    c = np.isnan(arr1d)
+    s = np.nonzero(c)[0]
+    if s.size == arr1d.size:
+        warnings.warn("All-NaN slice encountered", RuntimeWarning,
+                      stacklevel=5)
+        return arr1d[:0], True
+    elif s.size == 0:
+        return arr1d, overwrite_input
+    else:
+        if not overwrite_input:
+            arr1d = arr1d.copy()
+        # select non-nans at end of array
+        enonan = arr1d[-s.size:][~c[-s.size:]]
+        # fill nans in beginning of array with non-nans of end
+        arr1d[s[:enonan.size]] = enonan
+
+        return arr1d[:-s.size], True
+
+
+def _divide_by_count(a, b, out=None):
+    """
+    Compute a/b ignoring invalid results. If `a` is an array the division
+    is done in place. If `a` is a scalar, then its type is preserved in the
+    output. If out is None, then then a is used instead so that the
+    division is in place. Note that this is only called with `a` an inexact
+    type.
+
+    Parameters
+    ----------
+    a : {ndarray, numpy scalar}
+        Numerator. Expected to be of inexact type but not checked.
+    b : {ndarray, numpy scalar}
+        Denominator.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary.
+
+    Returns
+    -------
+    ret : {ndarray, numpy scalar}
+        The return value is a/b. If `a` was an ndarray the division is done
+        in place. If `a` is a numpy scalar, the division preserves its type.
+
+    """
+    with np.errstate(invalid='ignore', divide='ignore'):
+        if isinstance(a, np.ndarray):
+            if out is None:
+                return np.divide(a, b, out=a, casting='unsafe')
+            else:
+                return np.divide(a, b, out=out, casting='unsafe')
+        else:
+            if out is None:
+                return a.dtype.type(a / b)
+            else:
+                # This is questionable, but currently a numpy scalar can
+                # be output to a zero dimensional array.
+                return np.divide(a, b, out=out, casting='unsafe')
+
+
+def _nanmin_dispatcher(a, axis=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanmin_dispatcher)
+def nanmin(a, axis=None, out=None, keepdims=np._NoValue):
+    """
+    Return minimum of an array or minimum along an axis, ignoring any NaNs.
+    When all-NaN slices are encountered a ``RuntimeWarning`` is raised and
+    Nan is returned for that slice.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose minimum is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the minimum is computed. The default is to compute
+        the minimum of the flattened array.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary. See
+        `ufuncs-output-type` for more details.
+
+        .. versionadded:: 1.8.0
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+        If the value is anything but the default, then
+        `keepdims` will be passed through to the `min` method
+        of sub-classes of `ndarray`.  If the sub-classes methods
+        does not implement `keepdims` any exceptions will be raised.
+
+        .. versionadded:: 1.8.0
+
+    Returns
+    -------
+    nanmin : ndarray
+        An array with the same shape as `a`, with the specified axis
+        removed.  If `a` is a 0-d array, or if axis is None, an ndarray
+        scalar is returned.  The same dtype as `a` is returned.
+
+    See Also
+    --------
+    nanmax :
+        The maximum value of an array along a given axis, ignoring any NaNs.
+    amin :
+        The minimum value of an array along a given axis, propagating any NaNs.
+    fmin :
+        Element-wise minimum of two arrays, ignoring any NaNs.
+    minimum :
+        Element-wise minimum of two arrays, propagating any NaNs.
+    isnan :
+        Shows which elements are Not a Number (NaN).
+    isfinite:
+        Shows which elements are neither NaN nor infinity.
+
+    amax, fmax, maximum
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+    Positive infinity is treated as a very large number and negative
+    infinity is treated as a very small (i.e. negative) number.
+
+    If the input has a integer type the function is equivalent to np.min.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, np.nan]])
+    >>> np.nanmin(a)
+    1.0
+    >>> np.nanmin(a, axis=0)
+    array([1.,  2.])
+    >>> np.nanmin(a, axis=1)
+    array([1.,  3.])
+
+    When positive infinity and negative infinity are present:
+
+    >>> np.nanmin([1, 2, np.nan, np.inf])
+    1.0
+    >>> np.nanmin([1, 2, np.nan, np.NINF])
+    -inf
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+    if type(a) is np.ndarray and a.dtype != np.object_:
+        # Fast, but not safe for subclasses of ndarray, or object arrays,
+        # which do not implement isnan (gh-9009), or fmin correctly (gh-8975)
+        res = np.fmin.reduce(a, axis=axis, out=out, **kwargs)
+        if np.isnan(res).any():
+            warnings.warn("All-NaN slice encountered", RuntimeWarning,
+                          stacklevel=3)
+    else:
+        # Slow, but safe for subclasses of ndarray
+        a, mask = _replace_nan(a, +np.inf)
+        res = np.amin(a, axis=axis, out=out, **kwargs)
+        if mask is None:
+            return res
+
+        # Check for all-NaN axis
+        mask = np.all(mask, axis=axis, **kwargs)
+        if np.any(mask):
+            res = _copyto(res, np.nan, mask)
+            warnings.warn("All-NaN axis encountered", RuntimeWarning,
+                          stacklevel=3)
+    return res
+
+
+def _nanmax_dispatcher(a, axis=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanmax_dispatcher)
+def nanmax(a, axis=None, out=None, keepdims=np._NoValue):
+    """
+    Return the maximum of an array or maximum along an axis, ignoring any
+    NaNs.  When all-NaN slices are encountered a ``RuntimeWarning`` is
+    raised and NaN is returned for that slice.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose maximum is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the maximum is computed. The default is to compute
+        the maximum of the flattened array.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary. See
+        `ufuncs-output-type` for more details.
+
+        .. versionadded:: 1.8.0
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+        If the value is anything but the default, then
+        `keepdims` will be passed through to the `max` method
+        of sub-classes of `ndarray`.  If the sub-classes methods
+        does not implement `keepdims` any exceptions will be raised.
+
+        .. versionadded:: 1.8.0
+
+    Returns
+    -------
+    nanmax : ndarray
+        An array with the same shape as `a`, with the specified axis removed.
+        If `a` is a 0-d array, or if axis is None, an ndarray scalar is
+        returned.  The same dtype as `a` is returned.
+
+    See Also
+    --------
+    nanmin :
+        The minimum value of an array along a given axis, ignoring any NaNs.
+    amax :
+        The maximum value of an array along a given axis, propagating any NaNs.
+    fmax :
+        Element-wise maximum of two arrays, ignoring any NaNs.
+    maximum :
+        Element-wise maximum of two arrays, propagating any NaNs.
+    isnan :
+        Shows which elements are Not a Number (NaN).
+    isfinite:
+        Shows which elements are neither NaN nor infinity.
+
+    amin, fmin, minimum
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+    Positive infinity is treated as a very large number and negative
+    infinity is treated as a very small (i.e. negative) number.
+
+    If the input has a integer type the function is equivalent to np.max.
+
+    Examples
+    --------
+    >>> a = np.array([[1, 2], [3, np.nan]])
+    >>> np.nanmax(a)
+    3.0
+    >>> np.nanmax(a, axis=0)
+    array([3.,  2.])
+    >>> np.nanmax(a, axis=1)
+    array([2.,  3.])
+
+    When positive infinity and negative infinity are present:
+
+    >>> np.nanmax([1, 2, np.nan, np.NINF])
+    2.0
+    >>> np.nanmax([1, 2, np.nan, np.inf])
+    inf
+
+    """
+    kwargs = {}
+    if keepdims is not np._NoValue:
+        kwargs['keepdims'] = keepdims
+    if type(a) is np.ndarray and a.dtype != np.object_:
+        # Fast, but not safe for subclasses of ndarray, or object arrays,
+        # which do not implement isnan (gh-9009), or fmax correctly (gh-8975)
+        res = np.fmax.reduce(a, axis=axis, out=out, **kwargs)
+        if np.isnan(res).any():
+            warnings.warn("All-NaN slice encountered", RuntimeWarning,
+                          stacklevel=3)
+    else:
+        # Slow, but safe for subclasses of ndarray
+        a, mask = _replace_nan(a, -np.inf)
+        res = np.amax(a, axis=axis, out=out, **kwargs)
+        if mask is None:
+            return res
+
+        # Check for all-NaN axis
+        mask = np.all(mask, axis=axis, **kwargs)
+        if np.any(mask):
+            res = _copyto(res, np.nan, mask)
+            warnings.warn("All-NaN axis encountered", RuntimeWarning,
+                          stacklevel=3)
+    return res
+
+
+def _nanargmin_dispatcher(a, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_nanargmin_dispatcher)
+def nanargmin(a, axis=None):
+    """
+    Return the indices of the minimum values in the specified axis ignoring
+    NaNs. For all-NaN slices ``ValueError`` is raised. Warning: the results
+    cannot be trusted if a slice contains only NaNs and Infs.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : int, optional
+        Axis along which to operate.  By default flattened input is used.
+
+    Returns
+    -------
+    index_array : ndarray
+        An array of indices or a single index value.
+
+    See Also
+    --------
+    argmin, nanargmax
+
+    Examples
+    --------
+    >>> a = np.array([[np.nan, 4], [2, 3]])
+    >>> np.argmin(a)
+    0
+    >>> np.nanargmin(a)
+    2
+    >>> np.nanargmin(a, axis=0)
+    array([1, 1])
+    >>> np.nanargmin(a, axis=1)
+    array([1, 0])
+
+    """
+    a, mask = _replace_nan(a, np.inf)
+    res = np.argmin(a, axis=axis)
+    if mask is not None:
+        mask = np.all(mask, axis=axis)
+        if np.any(mask):
+            raise ValueError("All-NaN slice encountered")
+    return res
+
+
+def _nanargmax_dispatcher(a, axis=None):
+    return (a,)
+
+
+@array_function_dispatch(_nanargmax_dispatcher)
+def nanargmax(a, axis=None):
+    """
+    Return the indices of the maximum values in the specified axis ignoring
+    NaNs. For all-NaN slices ``ValueError`` is raised. Warning: the
+    results cannot be trusted if a slice contains only NaNs and -Infs.
+
+
+    Parameters
+    ----------
+    a : array_like
+        Input data.
+    axis : int, optional
+        Axis along which to operate.  By default flattened input is used.
+
+    Returns
+    -------
+    index_array : ndarray
+        An array of indices or a single index value.
+
+    See Also
+    --------
+    argmax, nanargmin
+
+    Examples
+    --------
+    >>> a = np.array([[np.nan, 4], [2, 3]])
+    >>> np.argmax(a)
+    0
+    >>> np.nanargmax(a)
+    1
+    >>> np.nanargmax(a, axis=0)
+    array([1, 0])
+    >>> np.nanargmax(a, axis=1)
+    array([1, 1])
+
+    """
+    a, mask = _replace_nan(a, -np.inf)
+    res = np.argmax(a, axis=axis)
+    if mask is not None:
+        mask = np.all(mask, axis=axis)
+        if np.any(mask):
+            raise ValueError("All-NaN slice encountered")
+    return res
+
+
+def _nansum_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nansum_dispatcher)
+def nansum(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+    """
+    Return the sum of array elements over a given axis treating Not a
+    Numbers (NaNs) as zero.
+
+    In NumPy versions <= 1.9.0 Nan is returned for slices that are all-NaN or
+    empty. In later versions zero is returned.
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose sum is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the sum is computed. The default is to compute the
+        sum of the flattened array.
+    dtype : data-type, optional
+        The type of the returned array and of the accumulator in which the
+        elements are summed.  By default, the dtype of `a` is used.  An
+        exception is when `a` has an integer type with less precision than
+        the platform (u)intp. In that case, the default will be either
+        (u)int32 or (u)int64 depending on whether the platform is 32 or 64
+        bits. For inexact inputs, dtype must be inexact.
+
+        .. versionadded:: 1.8.0
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``. If provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary.  See
+        `ufuncs-output-type` for more details. The casting of NaN to integer
+        can yield unexpected results.
+
+        .. versionadded:: 1.8.0
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+
+        If the value is anything but the default, then
+        `keepdims` will be passed through to the `mean` or `sum` methods
+        of sub-classes of `ndarray`.  If the sub-classes methods
+        does not implement `keepdims` any exceptions will be raised.
+
+        .. versionadded:: 1.8.0
+
+    Returns
+    -------
+    nansum : ndarray.
+        A new array holding the result is returned unless `out` is
+        specified, in which it is returned. The result has the same
+        size as `a`, and the same shape as `a` if `axis` is not None
+        or `a` is a 1-d array.
+
+    See Also
+    --------
+    numpy.sum : Sum across array propagating NaNs.
+    isnan : Show which elements are NaN.
+    isfinite: Show which elements are not NaN or +/-inf.
+
+    Notes
+    -----
+    If both positive and negative infinity are present, the sum will be Not
+    A Number (NaN).
+
+    Examples
+    --------
+    >>> np.nansum(1)
+    1
+    >>> np.nansum([1])
+    1
+    >>> np.nansum([1, np.nan])
+    1.0
+    >>> a = np.array([[1, 1], [1, np.nan]])
+    >>> np.nansum(a)
+    3.0
+    >>> np.nansum(a, axis=0)
+    array([2.,  1.])
+    >>> np.nansum([1, np.nan, np.inf])
+    inf
+    >>> np.nansum([1, np.nan, np.NINF])
+    -inf
+    >>> from numpy.testing import suppress_warnings
+    >>> with suppress_warnings() as sup:
+    ...     sup.filter(RuntimeWarning)
+    ...     np.nansum([1, np.nan, np.inf, -np.inf]) # both +/- infinity present
+    nan
+
+    """
+    a, mask = _replace_nan(a, 0)
+    return np.sum(a, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
+
+
+def _nanprod_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanprod_dispatcher)
+def nanprod(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+    """
+    Return the product of array elements over a given axis treating Not a
+    Numbers (NaNs) as ones.
+
+    One is returned for slices that are all-NaN or empty.
+
+    .. versionadded:: 1.10.0
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose product is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the product is computed. The default is to compute
+        the product of the flattened array.
+    dtype : data-type, optional
+        The type of the returned array and of the accumulator in which the
+        elements are summed.  By default, the dtype of `a` is used.  An
+        exception is when `a` has an integer type with less precision than
+        the platform (u)intp. In that case, the default will be either
+        (u)int32 or (u)int64 depending on whether the platform is 32 or 64
+        bits. For inexact inputs, dtype must be inexact.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``. If provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary. See
+        `ufuncs-output-type` for more details. The casting of NaN to integer
+        can yield unexpected results.
+    keepdims : bool, optional
+        If True, the axes which are reduced are left in the result as
+        dimensions with size one. With this option, the result will
+        broadcast correctly against the original `arr`.
+
+    Returns
+    -------
+    nanprod : ndarray
+        A new array holding the result is returned unless `out` is
+        specified, in which case it is returned.
+
+    See Also
+    --------
+    numpy.prod : Product across array propagating NaNs.
+    isnan : Show which elements are NaN.
+
+    Examples
+    --------
+    >>> np.nanprod(1)
+    1
+    >>> np.nanprod([1])
+    1
+    >>> np.nanprod([1, np.nan])
+    1.0
+    >>> a = np.array([[1, 2], [3, np.nan]])
+    >>> np.nanprod(a)
+    6.0
+    >>> np.nanprod(a, axis=0)
+    array([3., 2.])
+
+    """
+    a, mask = _replace_nan(a, 1)
+    return np.prod(a, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
+
+
+def _nancumsum_dispatcher(a, axis=None, dtype=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nancumsum_dispatcher)
+def nancumsum(a, axis=None, dtype=None, out=None):
+    """
+    Return the cumulative sum of array elements over a given axis treating Not a
+    Numbers (NaNs) as zero.  The cumulative sum does not change when NaNs are
+    encountered and leading NaNs are replaced by zeros.
+
+    Zeros are returned for slices that are all-NaN or empty.
+
+    .. versionadded:: 1.12.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        Axis along which the cumulative sum is computed. The default
+        (None) is to compute the cumsum over the flattened array.
+    dtype : dtype, optional
+        Type of the returned array and of the accumulator in which the
+        elements are summed.  If `dtype` is not specified, it defaults
+        to the dtype of `a`, unless `a` has an integer dtype with a
+        precision less than that of the default platform integer.  In
+        that case, the default platform integer is used.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output
+        but the type will be cast if necessary. See `ufuncs-output-type` for
+        more details.
+
+    Returns
+    -------
+    nancumsum : ndarray.
+        A new array holding the result is returned unless `out` is
+        specified, in which it is returned. The result has the same
+        size as `a`, and the same shape as `a` if `axis` is not None
+        or `a` is a 1-d array.
+
+    See Also
+    --------
+    numpy.cumsum : Cumulative sum across array propagating NaNs.
+    isnan : Show which elements are NaN.
+
+    Examples
+    --------
+    >>> np.nancumsum(1)
+    array([1])
+    >>> np.nancumsum([1])
+    array([1])
+    >>> np.nancumsum([1, np.nan])
+    array([1.,  1.])
+    >>> a = np.array([[1, 2], [3, np.nan]])
+    >>> np.nancumsum(a)
+    array([1.,  3.,  6.,  6.])
+    >>> np.nancumsum(a, axis=0)
+    array([[1.,  2.],
+           [4.,  2.]])
+    >>> np.nancumsum(a, axis=1)
+    array([[1.,  3.],
+           [3.,  3.]])
+
+    """
+    a, mask = _replace_nan(a, 0)
+    return np.cumsum(a, axis=axis, dtype=dtype, out=out)
+
+
+def _nancumprod_dispatcher(a, axis=None, dtype=None, out=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nancumprod_dispatcher)
+def nancumprod(a, axis=None, dtype=None, out=None):
+    """
+    Return the cumulative product of array elements over a given axis treating Not a
+    Numbers (NaNs) as one.  The cumulative product does not change when NaNs are
+    encountered and leading NaNs are replaced by ones.
+
+    Ones are returned for slices that are all-NaN or empty.
+
+    .. versionadded:: 1.12.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int, optional
+        Axis along which the cumulative product is computed.  By default
+        the input is flattened.
+    dtype : dtype, optional
+        Type of the returned array, as well as of the accumulator in which
+        the elements are multiplied.  If *dtype* is not specified, it
+        defaults to the dtype of `a`, unless `a` has an integer dtype with
+        a precision less than that of the default platform integer.  In
+        that case, the default platform integer is used instead.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output
+        but the type of the resulting values will be cast if necessary.
+
+    Returns
+    -------
+    nancumprod : ndarray
+        A new array holding the result is returned unless `out` is
+        specified, in which case it is returned.
+
+    See Also
+    --------
+    numpy.cumprod : Cumulative product across array propagating NaNs.
+    isnan : Show which elements are NaN.
+
+    Examples
+    --------
+    >>> np.nancumprod(1)
+    array([1])
+    >>> np.nancumprod([1])
+    array([1])
+    >>> np.nancumprod([1, np.nan])
+    array([1.,  1.])
+    >>> a = np.array([[1, 2], [3, np.nan]])
+    >>> np.nancumprod(a)
+    array([1.,  2.,  6.,  6.])
+    >>> np.nancumprod(a, axis=0)
+    array([[1.,  2.],
+           [3.,  2.]])
+    >>> np.nancumprod(a, axis=1)
+    array([[1.,  2.],
+           [3.,  3.]])
+
+    """
+    a, mask = _replace_nan(a, 1)
+    return np.cumprod(a, axis=axis, dtype=dtype, out=out)
+
+
+def _nanmean_dispatcher(a, axis=None, dtype=None, out=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanmean_dispatcher)
+def nanmean(a, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+    """
+    Compute the arithmetic mean along the specified axis, ignoring NaNs.
+
+    Returns the average of the array elements.  The average is taken over
+    the flattened array by default, otherwise over the specified axis.
+    `float64` intermediate and return values are used for integer inputs.
+
+    For all-NaN slices, NaN is returned and a `RuntimeWarning` is raised.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose mean is desired. If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the means are computed. The default is to compute
+        the mean of the flattened array.
+    dtype : data-type, optional
+        Type to use in computing the mean.  For integer inputs, the default
+        is `float64`; for inexact inputs, it is the same as the input
+        dtype.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  The default
+        is ``None``; if provided, it must have the same shape as the
+        expected output, but the type will be cast if necessary. See
+        `ufuncs-output-type` for more details.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+        If the value is anything but the default, then
+        `keepdims` will be passed through to the `mean` or `sum` methods
+        of sub-classes of `ndarray`.  If the sub-classes methods
+        does not implement `keepdims` any exceptions will be raised.
+
+    Returns
+    -------
+    m : ndarray, see dtype parameter above
+        If `out=None`, returns a new array containing the mean values,
+        otherwise a reference to the output array is returned. Nan is
+        returned for slices that contain only NaNs.
+
+    See Also
+    --------
+    average : Weighted average
+    mean : Arithmetic mean taken while not ignoring NaNs
+    var, nanvar
+
+    Notes
+    -----
+    The arithmetic mean is the sum of the non-NaN elements along the axis
+    divided by the number of non-NaN elements.
+
+    Note that for floating-point input, the mean is computed using the same
+    precision the input has.  Depending on the input data, this can cause
+    the results to be inaccurate, especially for `float32`.  Specifying a
+    higher-precision accumulator using the `dtype` keyword can alleviate
+    this issue.
+
+    Examples
+    --------
+    >>> a = np.array([[1, np.nan], [3, 4]])
+    >>> np.nanmean(a)
+    2.6666666666666665
+    >>> np.nanmean(a, axis=0)
+    array([2.,  4.])
+    >>> np.nanmean(a, axis=1)
+    array([1.,  3.5]) # may vary
+
+    """
+    arr, mask = _replace_nan(a, 0)
+    if mask is None:
+        return np.mean(arr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
+
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+    if dtype is not None and not issubclass(dtype.type, np.inexact):
+        raise TypeError("If a is inexact, then dtype must be inexact")
+    if out is not None and not issubclass(out.dtype.type, np.inexact):
+        raise TypeError("If a is inexact, then out must be inexact")
+
+    cnt = np.sum(~mask, axis=axis, dtype=np.intp, keepdims=keepdims)
+    tot = np.sum(arr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
+    avg = _divide_by_count(tot, cnt, out=out)
+
+    isbad = (cnt == 0)
+    if isbad.any():
+        warnings.warn("Mean of empty slice", RuntimeWarning, stacklevel=3)
+        # NaN is the only possible bad value, so no further
+        # action is needed to handle bad results.
+    return avg
+
+
+def _nanmedian1d(arr1d, overwrite_input=False):
+    """
+    Private function for rank 1 arrays. Compute the median ignoring NaNs.
+    See nanmedian for parameter usage
+    """
+    arr1d, overwrite_input = _remove_nan_1d(arr1d,
+                                            overwrite_input=overwrite_input)
+    if arr1d.size == 0:
+        return np.nan
+
+    return np.median(arr1d, overwrite_input=overwrite_input)
+
+
+def _nanmedian(a, axis=None, out=None, overwrite_input=False):
+    """
+    Private function that doesn't support extended axis or keepdims.
+    These methods are extended to this function using _ureduce
+    See nanmedian for parameter usage
+
+    """
+    if axis is None or a.ndim == 1:
+        part = a.ravel()
+        if out is None:
+            return _nanmedian1d(part, overwrite_input)
+        else:
+            out[...] = _nanmedian1d(part, overwrite_input)
+            return out
+    else:
+        # for small medians use sort + indexing which is still faster than
+        # apply_along_axis
+        # benchmarked with shuffled (50, 50, x) containing a few NaN
+        if a.shape[axis] < 600:
+            return _nanmedian_small(a, axis, out, overwrite_input)
+        result = np.apply_along_axis(_nanmedian1d, axis, a, overwrite_input)
+        if out is not None:
+            out[...] = result
+        return result
+
+
+def _nanmedian_small(a, axis=None, out=None, overwrite_input=False):
+    """
+    sort + indexing median, faster for small medians along multiple
+    dimensions due to the high overhead of apply_along_axis
+
+    see nanmedian for parameter usage
+    """
+    a = np.ma.masked_array(a, np.isnan(a))
+    m = np.ma.median(a, axis=axis, overwrite_input=overwrite_input)
+    for i in range(np.count_nonzero(m.mask.ravel())):
+        warnings.warn("All-NaN slice encountered", RuntimeWarning,
+                      stacklevel=4)
+    if out is not None:
+        out[...] = m.filled(np.nan)
+        return out
+    return m.filled(np.nan)
+
+
+def _nanmedian_dispatcher(
+        a, axis=None, out=None, overwrite_input=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanmedian_dispatcher)
+def nanmedian(a, axis=None, out=None, overwrite_input=False, keepdims=np._NoValue):
+    """
+    Compute the median along the specified axis, while ignoring NaNs.
+
+    Returns the median of the array elements.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    axis : {int, sequence of int, None}, optional
+        Axis or axes along which the medians are computed. The default
+        is to compute the median along a flattened version of the array.
+        A sequence of axes is supported since version 1.9.0.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+       If True, then allow use of memory of input array `a` for
+       calculations. The input array will be modified by the call to
+       `median`. This will save memory when you do not need to preserve
+       the contents of the input array. Treat the input as undefined,
+       but it will probably be fully or partially sorted. Default is
+       False. If `overwrite_input` is ``True`` and `a` is not already an
+       `ndarray`, an error will be raised.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+        If this is anything but the default value it will be passed
+        through (in the special case of an empty array) to the
+        `mean` function of the underlying array.  If the array is
+        a sub-class and `mean` does not have the kwarg `keepdims` this
+        will raise a RuntimeError.
+
+    Returns
+    -------
+    median : ndarray
+        A new array holding the result. If the input contains integers
+        or floats smaller than ``float64``, then the output data-type is
+        ``np.float64``.  Otherwise, the data-type of the output is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    mean, median, percentile
+
+    Notes
+    -----
+    Given a vector ``V`` of length ``N``, the median of ``V`` is the
+    middle value of a sorted copy of ``V``, ``V_sorted`` - i.e.,
+    ``V_sorted[(N-1)/2]``, when ``N`` is odd and the average of the two
+    middle values of ``V_sorted`` when ``N`` is even.
+
+    Examples
+    --------
+    >>> a = np.array([[10.0, 7, 4], [3, 2, 1]])
+    >>> a[0, 1] = np.nan
+    >>> a
+    array([[10., nan,  4.],
+           [ 3.,  2.,  1.]])
+    >>> np.median(a)
+    nan
+    >>> np.nanmedian(a)
+    3.0
+    >>> np.nanmedian(a, axis=0)
+    array([6.5, 2. , 2.5])
+    >>> np.median(a, axis=1)
+    array([nan,  2.])
+    >>> b = a.copy()
+    >>> np.nanmedian(b, axis=1, overwrite_input=True)
+    array([7.,  2.])
+    >>> assert not np.all(a==b)
+    >>> b = a.copy()
+    >>> np.nanmedian(b, axis=None, overwrite_input=True)
+    3.0
+    >>> assert not np.all(a==b)
+
+    """
+    a = np.asanyarray(a)
+    # apply_along_axis in _nanmedian doesn't handle empty arrays well,
+    # so deal them upfront
+    if a.size == 0:
+        return np.nanmean(a, axis, out=out, keepdims=keepdims)
+
+    r, k = function_base._ureduce(a, func=_nanmedian, axis=axis, out=out,
+                                  overwrite_input=overwrite_input)
+    if keepdims and keepdims is not np._NoValue:
+        return r.reshape(k)
+    else:
+        return r
+
+
+def _nanpercentile_dispatcher(a, q, axis=None, out=None, overwrite_input=None,
+                              interpolation=None, keepdims=None):
+    return (a, q, out)
+
+
+@array_function_dispatch(_nanpercentile_dispatcher)
+def nanpercentile(a, q, axis=None, out=None, overwrite_input=False,
+                  interpolation='linear', keepdims=np._NoValue):
+    """
+    Compute the qth percentile of the data along the specified axis,
+    while ignoring nan values.
+
+    Returns the qth percentile(s) of the array elements.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array, containing
+        nan values to be ignored.
+    q : array_like of float
+        Percentile or sequence of percentiles to compute, which must be between
+        0 and 100 inclusive.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the percentiles are computed. The
+        default is to compute the percentile(s) along a flattened
+        version of the array.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+        If True, then allow the input array `a` to be modified by intermediate
+        calculations, to save memory. In this case, the contents of the input
+        `a` after this function completes is undefined.
+    interpolation : {'linear', 'lower', 'higher', 'midpoint', 'nearest'}
+        This optional parameter specifies the interpolation method to
+        use when the desired percentile lies between two data points
+        ``i < j``:
+
+        * 'linear': ``i + (j - i) * fraction``, where ``fraction``
+          is the fractional part of the index surrounded by ``i``
+          and ``j``.
+        * 'lower': ``i``.
+        * 'higher': ``j``.
+        * 'nearest': ``i`` or ``j``, whichever is nearest.
+        * 'midpoint': ``(i + j) / 2``.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left in
+        the result as dimensions with size one. With this option, the
+        result will broadcast correctly against the original array `a`.
+
+        If this is anything but the default value it will be passed
+        through (in the special case of an empty array) to the
+        `mean` function of the underlying array.  If the array is
+        a sub-class and `mean` does not have the kwarg `keepdims` this
+        will raise a RuntimeError.
+
+    Returns
+    -------
+    percentile : scalar or ndarray
+        If `q` is a single percentile and `axis=None`, then the result
+        is a scalar. If multiple percentiles are given, first axis of
+        the result corresponds to the percentiles. The other axes are
+        the axes that remain after the reduction of `a`. If the input
+        contains integers or floats smaller than ``float64``, the output
+        data-type is ``float64``. Otherwise, the output data-type is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    nanmean
+    nanmedian : equivalent to ``nanpercentile(..., 50)``
+    percentile, median, mean
+    nanquantile : equivalent to nanpercentile, but with q in the range [0, 1].
+
+    Notes
+    -----
+    Given a vector ``V`` of length ``N``, the ``q``-th percentile of
+    ``V`` is the value ``q/100`` of the way from the minimum to the
+    maximum in a sorted copy of ``V``. The values and distances of
+    the two nearest neighbors as well as the `interpolation` parameter
+    will determine the percentile if the normalized ranking does not
+    match the location of ``q`` exactly. This function is the same as
+    the median if ``q=50``, the same as the minimum if ``q=0`` and the
+    same as the maximum if ``q=100``.
+
+    Examples
+    --------
+    >>> a = np.array([[10., 7., 4.], [3., 2., 1.]])
+    >>> a[0][1] = np.nan
+    >>> a
+    array([[10.,  nan,   4.],
+          [ 3.,   2.,   1.]])
+    >>> np.percentile(a, 50)
+    nan
+    >>> np.nanpercentile(a, 50)
+    3.0
+    >>> np.nanpercentile(a, 50, axis=0)
+    array([6.5, 2. , 2.5])
+    >>> np.nanpercentile(a, 50, axis=1, keepdims=True)
+    array([[7.],
+           [2.]])
+    >>> m = np.nanpercentile(a, 50, axis=0)
+    >>> out = np.zeros_like(m)
+    >>> np.nanpercentile(a, 50, axis=0, out=out)
+    array([6.5, 2. , 2.5])
+    >>> m
+    array([6.5,  2. ,  2.5])
+
+    >>> b = a.copy()
+    >>> np.nanpercentile(b, 50, axis=1, overwrite_input=True)
+    array([7., 2.])
+    >>> assert not np.all(a==b)
+
+    """
+    a = np.asanyarray(a)
+    q = np.true_divide(q, 100.0)  # handles the asarray for us too
+    if not function_base._quantile_is_valid(q):
+        raise ValueError("Percentiles must be in the range [0, 100]")
+    return _nanquantile_unchecked(
+        a, q, axis, out, overwrite_input, interpolation, keepdims)
+
+
+def _nanquantile_dispatcher(a, q, axis=None, out=None, overwrite_input=None,
+                            interpolation=None, keepdims=None):
+    return (a, q, out)
+
+
+@array_function_dispatch(_nanquantile_dispatcher)
+def nanquantile(a, q, axis=None, out=None, overwrite_input=False,
+                interpolation='linear', keepdims=np._NoValue):
+    """
+    Compute the qth quantile of the data along the specified axis,
+    while ignoring nan values.
+    Returns the qth quantile(s) of the array elements.
+    
+    .. versionadded:: 1.15.0
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array, containing
+        nan values to be ignored
+    q : array_like of float
+        Quantile or sequence of quantiles to compute, which must be between
+        0 and 1 inclusive.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the quantiles are computed. The
+        default is to compute the quantile(s) along a flattened
+        version of the array.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output,
+        but the type (of the output) will be cast if necessary.
+    overwrite_input : bool, optional
+        If True, then allow the input array `a` to be modified by intermediate
+        calculations, to save memory. In this case, the contents of the input
+        `a` after this function completes is undefined.
+    interpolation : {'linear', 'lower', 'higher', 'midpoint', 'nearest'}
+        This optional parameter specifies the interpolation method to
+        use when the desired quantile lies between two data points
+        ``i < j``:
+
+        * linear: ``i + (j - i) * fraction``, where ``fraction``
+          is the fractional part of the index surrounded by ``i``
+          and ``j``.
+        * lower: ``i``.
+        * higher: ``j``.
+        * nearest: ``i`` or ``j``, whichever is nearest.
+        * midpoint: ``(i + j) / 2``.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left in
+        the result as dimensions with size one. With this option, the
+        result will broadcast correctly against the original array `a`.
+
+        If this is anything but the default value it will be passed
+        through (in the special case of an empty array) to the
+        `mean` function of the underlying array.  If the array is
+        a sub-class and `mean` does not have the kwarg `keepdims` this
+        will raise a RuntimeError.
+
+    Returns
+    -------
+    quantile : scalar or ndarray
+        If `q` is a single percentile and `axis=None`, then the result
+        is a scalar. If multiple quantiles are given, first axis of
+        the result corresponds to the quantiles. The other axes are
+        the axes that remain after the reduction of `a`. If the input
+        contains integers or floats smaller than ``float64``, the output
+        data-type is ``float64``. Otherwise, the output data-type is the
+        same as that of the input. If `out` is specified, that array is
+        returned instead.
+
+    See Also
+    --------
+    quantile
+    nanmean, nanmedian
+    nanmedian : equivalent to ``nanquantile(..., 0.5)``
+    nanpercentile : same as nanquantile, but with q in the range [0, 100].
+
+    Examples
+    --------
+    >>> a = np.array([[10., 7., 4.], [3., 2., 1.]])
+    >>> a[0][1] = np.nan
+    >>> a
+    array([[10.,  nan,   4.],
+          [ 3.,   2.,   1.]])
+    >>> np.quantile(a, 0.5)
+    nan
+    >>> np.nanquantile(a, 0.5)
+    3.0
+    >>> np.nanquantile(a, 0.5, axis=0)
+    array([6.5, 2. , 2.5])
+    >>> np.nanquantile(a, 0.5, axis=1, keepdims=True)
+    array([[7.],
+           [2.]])
+    >>> m = np.nanquantile(a, 0.5, axis=0)
+    >>> out = np.zeros_like(m)
+    >>> np.nanquantile(a, 0.5, axis=0, out=out)
+    array([6.5, 2. , 2.5])
+    >>> m
+    array([6.5,  2. ,  2.5])
+    >>> b = a.copy()
+    >>> np.nanquantile(b, 0.5, axis=1, overwrite_input=True)
+    array([7., 2.])
+    >>> assert not np.all(a==b)
+    """
+    a = np.asanyarray(a)
+    q = np.asanyarray(q)
+    if not function_base._quantile_is_valid(q):
+        raise ValueError("Quantiles must be in the range [0, 1]")
+    return _nanquantile_unchecked(
+        a, q, axis, out, overwrite_input, interpolation, keepdims)
+
+
+def _nanquantile_unchecked(a, q, axis=None, out=None, overwrite_input=False,
+                           interpolation='linear', keepdims=np._NoValue):
+    """Assumes that q is in [0, 1], and is an ndarray"""
+    # apply_along_axis in _nanpercentile doesn't handle empty arrays well,
+    # so deal them upfront
+    if a.size == 0:
+        return np.nanmean(a, axis, out=out, keepdims=keepdims)
+
+    r, k = function_base._ureduce(
+        a, func=_nanquantile_ureduce_func, q=q, axis=axis, out=out,
+        overwrite_input=overwrite_input, interpolation=interpolation
+    )
+    if keepdims and keepdims is not np._NoValue:
+        return r.reshape(q.shape + k)
+    else:
+        return r
+
+
+def _nanquantile_ureduce_func(a, q, axis=None, out=None, overwrite_input=False,
+                              interpolation='linear'):
+    """
+    Private function that doesn't support extended axis or keepdims.
+    These methods are extended to this function using _ureduce
+    See nanpercentile for parameter usage
+    """
+    if axis is None or a.ndim == 1:
+        part = a.ravel()
+        result = _nanquantile_1d(part, q, overwrite_input, interpolation)
+    else:
+        result = np.apply_along_axis(_nanquantile_1d, axis, a, q,
+                                     overwrite_input, interpolation)
+        # apply_along_axis fills in collapsed axis with results.
+        # Move that axis to the beginning to match percentile's
+        # convention.
+        if q.ndim != 0:
+            result = np.moveaxis(result, axis, 0)
+
+    if out is not None:
+        out[...] = result
+    return result
+
+
+def _nanquantile_1d(arr1d, q, overwrite_input=False, interpolation='linear'):
+    """
+    Private function for rank 1 arrays. Compute quantile ignoring NaNs.
+    See nanpercentile for parameter usage
+    """
+    arr1d, overwrite_input = _remove_nan_1d(arr1d,
+        overwrite_input=overwrite_input)
+    if arr1d.size == 0:
+        return np.full(q.shape, np.nan)[()]  # convert to scalar
+
+    return function_base._quantile_unchecked(
+        arr1d, q, overwrite_input=overwrite_input, interpolation=interpolation)
+
+
+def _nanvar_dispatcher(
+        a, axis=None, dtype=None, out=None, ddof=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanvar_dispatcher)
+def nanvar(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
+    """
+    Compute the variance along the specified axis, while ignoring NaNs.
+
+    Returns the variance of the array elements, a measure of the spread of
+    a distribution.  The variance is computed for the flattened array by
+    default, otherwise over the specified axis.
+
+    For all-NaN slices or slices with zero degrees of freedom, NaN is
+    returned and a `RuntimeWarning` is raised.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        Array containing numbers whose variance is desired.  If `a` is not an
+        array, a conversion is attempted.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the variance is computed.  The default is to compute
+        the variance of the flattened array.
+    dtype : data-type, optional
+        Type to use in computing the variance.  For arrays of integer type
+        the default is `float64`; for arrays of float types it is the same as
+        the array type.
+    out : ndarray, optional
+        Alternate output array in which to place the result.  It must have
+        the same shape as the expected output, but the type is cast if
+        necessary.
+    ddof : int, optional
+        "Delta Degrees of Freedom": the divisor used in the calculation is
+        ``N - ddof``, where ``N`` represents the number of non-NaN
+        elements. By default `ddof` is zero.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+
+    Returns
+    -------
+    variance : ndarray, see dtype parameter above
+        If `out` is None, return a new array containing the variance,
+        otherwise return a reference to the output array. If ddof is >= the
+        number of non-NaN elements in a slice or the slice contains only
+        NaNs, then the result for that slice is NaN.
+
+    See Also
+    --------
+    std : Standard deviation
+    mean : Average
+    var : Variance while not ignoring NaNs
+    nanstd, nanmean
+    ufuncs-output-type
+
+    Notes
+    -----
+    The variance is the average of the squared deviations from the mean,
+    i.e.,  ``var = mean(abs(x - x.mean())**2)``.
+
+    The mean is normally calculated as ``x.sum() / N``, where ``N = len(x)``.
+    If, however, `ddof` is specified, the divisor ``N - ddof`` is used
+    instead.  In standard statistical practice, ``ddof=1`` provides an
+    unbiased estimator of the variance of a hypothetical infinite
+    population.  ``ddof=0`` provides a maximum likelihood estimate of the
+    variance for normally distributed variables.
+
+    Note that for complex numbers, the absolute value is taken before
+    squaring, so that the result is always real and nonnegative.
+
+    For floating-point input, the variance is computed using the same
+    precision the input has.  Depending on the input data, this can cause
+    the results to be inaccurate, especially for `float32` (see example
+    below).  Specifying a higher-accuracy accumulator using the ``dtype``
+    keyword can alleviate this issue.
+
+    For this function to work on sub-classes of ndarray, they must define
+    `sum` with the kwarg `keepdims`
+
+    Examples
+    --------
+    >>> a = np.array([[1, np.nan], [3, 4]])
+    >>> np.nanvar(a)
+    1.5555555555555554
+    >>> np.nanvar(a, axis=0)
+    array([1.,  0.])
+    >>> np.nanvar(a, axis=1)
+    array([0.,  0.25])  # may vary
+
+    """
+    arr, mask = _replace_nan(a, 0)
+    if mask is None:
+        return np.var(arr, axis=axis, dtype=dtype, out=out, ddof=ddof,
+                      keepdims=keepdims)
+
+    if dtype is not None:
+        dtype = np.dtype(dtype)
+    if dtype is not None and not issubclass(dtype.type, np.inexact):
+        raise TypeError("If a is inexact, then dtype must be inexact")
+    if out is not None and not issubclass(out.dtype.type, np.inexact):
+        raise TypeError("If a is inexact, then out must be inexact")
+
+    # Compute mean
+    if type(arr) is np.matrix:
+        _keepdims = np._NoValue
+    else:
+        _keepdims = True
+    # we need to special case matrix for reverse compatibility
+    # in order for this to work, these sums need to be called with
+    # keepdims=True, however matrix now raises an error in this case, but
+    # the reason that it drops the keepdims kwarg is to force keepdims=True
+    # so this used to work by serendipity.
+    cnt = np.sum(~mask, axis=axis, dtype=np.intp, keepdims=_keepdims)
+    avg = np.sum(arr, axis=axis, dtype=dtype, keepdims=_keepdims)
+    avg = _divide_by_count(avg, cnt)
+
+    # Compute squared deviation from mean.
+    np.subtract(arr, avg, out=arr, casting='unsafe')
+    arr = _copyto(arr, 0, mask)
+    if issubclass(arr.dtype.type, np.complexfloating):
+        sqr = np.multiply(arr, arr.conj(), out=arr).real
+    else:
+        sqr = np.multiply(arr, arr, out=arr)
+
+    # Compute variance.
+    var = np.sum(sqr, axis=axis, dtype=dtype, out=out, keepdims=keepdims)
+    if var.ndim < cnt.ndim:
+        # Subclasses of ndarray may ignore keepdims, so check here.
+        cnt = cnt.squeeze(axis)
+    dof = cnt - ddof
+    var = _divide_by_count(var, dof)
+
+    isbad = (dof <= 0)
+    if np.any(isbad):
+        warnings.warn("Degrees of freedom <= 0 for slice.", RuntimeWarning,
+                      stacklevel=3)
+        # NaN, inf, or negative numbers are all possible bad
+        # values, so explicitly replace them with NaN.
+        var = _copyto(var, np.nan, isbad)
+    return var
+
+
+def _nanstd_dispatcher(
+        a, axis=None, dtype=None, out=None, ddof=None, keepdims=None):
+    return (a, out)
+
+
+@array_function_dispatch(_nanstd_dispatcher)
+def nanstd(a, axis=None, dtype=None, out=None, ddof=0, keepdims=np._NoValue):
+    """
+    Compute the standard deviation along the specified axis, while
+    ignoring NaNs.
+
+    Returns the standard deviation, a measure of the spread of a
+    distribution, of the non-NaN array elements. The standard deviation is
+    computed for the flattened array by default, otherwise over the
+    specified axis.
+
+    For all-NaN slices or slices with zero degrees of freedom, NaN is
+    returned and a `RuntimeWarning` is raised.
+
+    .. versionadded:: 1.8.0
+
+    Parameters
+    ----------
+    a : array_like
+        Calculate the standard deviation of the non-NaN values.
+    axis : {int, tuple of int, None}, optional
+        Axis or axes along which the standard deviation is computed. The default is
+        to compute the standard deviation of the flattened array.
+    dtype : dtype, optional
+        Type to use in computing the standard deviation. For arrays of
+        integer type the default is float64, for arrays of float types it
+        is the same as the array type.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must have
+        the same shape as the expected output but the type (of the
+        calculated values) will be cast if necessary.
+    ddof : int, optional
+        Means Delta Degrees of Freedom.  The divisor used in calculations
+        is ``N - ddof``, where ``N`` represents the number of non-NaN
+        elements.  By default `ddof` is zero.
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the original `a`.
+
+        If this value is anything but the default it is passed through
+        as-is to the relevant functions of the sub-classes.  If these
+        functions do not have a `keepdims` kwarg, a RuntimeError will
+        be raised.
+
+    Returns
+    -------
+    standard_deviation : ndarray, see dtype parameter above.
+        If `out` is None, return a new array containing the standard
+        deviation, otherwise return a reference to the output array. If
+        ddof is >= the number of non-NaN elements in a slice or the slice
+        contains only NaNs, then the result for that slice is NaN.
+
+    See Also
+    --------
+    var, mean, std
+    nanvar, nanmean
+    ufuncs-output-type
+
+    Notes
+    -----
+    The standard deviation is the square root of the average of the squared
+    deviations from the mean: ``std = sqrt(mean(abs(x - x.mean())**2))``.
+
+    The average squared deviation is normally calculated as
+    ``x.sum() / N``, where ``N = len(x)``.  If, however, `ddof` is
+    specified, the divisor ``N - ddof`` is used instead. In standard
+    statistical practice, ``ddof=1`` provides an unbiased estimator of the
+    variance of the infinite population. ``ddof=0`` provides a maximum
+    likelihood estimate of the variance for normally distributed variables.
+    The standard deviation computed in this function is the square root of
+    the estimated variance, so even with ``ddof=1``, it will not be an
+    unbiased estimate of the standard deviation per se.
+
+    Note that, for complex numbers, `std` takes the absolute value before
+    squaring, so that the result is always real and nonnegative.
+
+    For floating-point input, the *std* is computed using the same
+    precision the input has. Depending on the input data, this can cause
+    the results to be inaccurate, especially for float32 (see example
+    below).  Specifying a higher-accuracy accumulator using the `dtype`
+    keyword can alleviate this issue.
+
+    Examples
+    --------
+    >>> a = np.array([[1, np.nan], [3, 4]])
+    >>> np.nanstd(a)
+    1.247219128924647
+    >>> np.nanstd(a, axis=0)
+    array([1., 0.])
+    >>> np.nanstd(a, axis=1)
+    array([0.,  0.5]) # may vary
+
+    """
+    var = nanvar(a, axis=axis, dtype=dtype, out=out, ddof=ddof,
+                 keepdims=keepdims)
+    if isinstance(var, np.ndarray):
+        std = np.sqrt(var, out=var)
+    else:
+        std = var.dtype.type(np.sqrt(var))
+    return std
diff --git a/venv/Lib/site-packages/numpy/lib/npyio.py b/venv/Lib/site-packages/numpy/lib/npyio.py
new file mode 100644
index 000000000..f5a548433
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/npyio.py
@@ -0,0 +1,2357 @@
+import sys
+import os
+import re
+import functools
+import itertools
+import warnings
+import weakref
+import contextlib
+from operator import itemgetter, index as opindex
+from collections.abc import Mapping
+
+import numpy as np
+from . import format
+from ._datasource import DataSource
+from numpy.core import overrides
+from numpy.core.multiarray import packbits, unpackbits
+from numpy.core.overrides import set_module
+from numpy.core._internal import recursive
+from ._iotools import (
+    LineSplitter, NameValidator, StringConverter, ConverterError,
+    ConverterLockError, ConversionWarning, _is_string_like,
+    has_nested_fields, flatten_dtype, easy_dtype, _decode_line
+    )
+
+from numpy.compat import (
+    asbytes, asstr, asunicode, bytes, os_fspath, os_PathLike,
+    pickle, contextlib_nullcontext
+    )
+
+
+@set_module('numpy')
+def loads(*args, **kwargs):
+    # NumPy 1.15.0, 2017-12-10
+    warnings.warn(
+        "np.loads is deprecated, use pickle.loads instead",
+        DeprecationWarning, stacklevel=2)
+    return pickle.loads(*args, **kwargs)
+
+
+__all__ = [
+    'savetxt', 'loadtxt', 'genfromtxt', 'ndfromtxt', 'mafromtxt',
+    'recfromtxt', 'recfromcsv', 'load', 'loads', 'save', 'savez',
+    'savez_compressed', 'packbits', 'unpackbits', 'fromregex', 'DataSource'
+    ]
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+class BagObj:
+    """
+    BagObj(obj)
+
+    Convert attribute look-ups to getitems on the object passed in.
+
+    Parameters
+    ----------
+    obj : class instance
+        Object on which attribute look-up is performed.
+
+    Examples
+    --------
+    >>> from numpy.lib.npyio import BagObj as BO
+    >>> class BagDemo:
+    ...     def __getitem__(self, key): # An instance of BagObj(BagDemo)
+    ...                                 # will call this method when any
+    ...                                 # attribute look-up is required
+    ...         result = "Doesn't matter what you want, "
+    ...         return result + "you're gonna get this"
+    ...
+    >>> demo_obj = BagDemo()
+    >>> bagobj = BO(demo_obj)
+    >>> bagobj.hello_there
+    "Doesn't matter what you want, you're gonna get this"
+    >>> bagobj.I_can_be_anything
+    "Doesn't matter what you want, you're gonna get this"
+
+    """
+
+    def __init__(self, obj):
+        # Use weakref to make NpzFile objects collectable by refcount
+        self._obj = weakref.proxy(obj)
+
+    def __getattribute__(self, key):
+        try:
+            return object.__getattribute__(self, '_obj')[key]
+        except KeyError:
+            raise AttributeError(key)
+
+    def __dir__(self):
+        """
+        Enables dir(bagobj) to list the files in an NpzFile.
+
+        This also enables tab-completion in an interpreter or IPython.
+        """
+        return list(object.__getattribute__(self, '_obj').keys())
+
+
+def zipfile_factory(file, *args, **kwargs):
+    """
+    Create a ZipFile.
+
+    Allows for Zip64, and the `file` argument can accept file, str, or
+    pathlib.Path objects. `args` and `kwargs` are passed to the zipfile.ZipFile
+    constructor.
+    """
+    if not hasattr(file, 'read'):
+        file = os_fspath(file)
+    import zipfile
+    kwargs['allowZip64'] = True
+    return zipfile.ZipFile(file, *args, **kwargs)
+
+
+class NpzFile(Mapping):
+    """
+    NpzFile(fid)
+
+    A dictionary-like object with lazy-loading of files in the zipped
+    archive provided on construction.
+
+    `NpzFile` is used to load files in the NumPy ``.npz`` data archive
+    format. It assumes that files in the archive have a ``.npy`` extension,
+    other files are ignored.
+
+    The arrays and file strings are lazily loaded on either
+    getitem access using ``obj['key']`` or attribute lookup using
+    ``obj.f.key``. A list of all files (without ``.npy`` extensions) can
+    be obtained with ``obj.files`` and the ZipFile object itself using
+    ``obj.zip``.
+
+    Attributes
+    ----------
+    files : list of str
+        List of all files in the archive with a ``.npy`` extension.
+    zip : ZipFile instance
+        The ZipFile object initialized with the zipped archive.
+    f : BagObj instance
+        An object on which attribute can be performed as an alternative
+        to getitem access on the `NpzFile` instance itself.
+    allow_pickle : bool, optional
+        Allow loading pickled data. Default: False
+
+        .. versionchanged:: 1.16.3
+            Made default False in response to CVE-2019-6446.
+
+    pickle_kwargs : dict, optional
+        Additional keyword arguments to pass on to pickle.load.
+        These are only useful when loading object arrays saved on
+        Python 2 when using Python 3.
+
+    Parameters
+    ----------
+    fid : file or str
+        The zipped archive to open. This is either a file-like object
+        or a string containing the path to the archive.
+    own_fid : bool, optional
+        Whether NpzFile should close the file handle.
+        Requires that `fid` is a file-like object.
+
+    Examples
+    --------
+    >>> from tempfile import TemporaryFile
+    >>> outfile = TemporaryFile()
+    >>> x = np.arange(10)
+    >>> y = np.sin(x)
+    >>> np.savez(outfile, x=x, y=y)
+    >>> _ = outfile.seek(0)
+
+    >>> npz = np.load(outfile)
+    >>> isinstance(npz, np.lib.io.NpzFile)
+    True
+    >>> sorted(npz.files)
+    ['x', 'y']
+    >>> npz['x']  # getitem access
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+    >>> npz.f.x  # attribute lookup
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+
+    """
+
+    def __init__(self, fid, own_fid=False, allow_pickle=False,
+                 pickle_kwargs=None):
+        # Import is postponed to here since zipfile depends on gzip, an
+        # optional component of the so-called standard library.
+        _zip = zipfile_factory(fid)
+        self._files = _zip.namelist()
+        self.files = []
+        self.allow_pickle = allow_pickle
+        self.pickle_kwargs = pickle_kwargs
+        for x in self._files:
+            if x.endswith('.npy'):
+                self.files.append(x[:-4])
+            else:
+                self.files.append(x)
+        self.zip = _zip
+        self.f = BagObj(self)
+        if own_fid:
+            self.fid = fid
+        else:
+            self.fid = None
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, exc_type, exc_value, traceback):
+        self.close()
+
+    def close(self):
+        """
+        Close the file.
+
+        """
+        if self.zip is not None:
+            self.zip.close()
+            self.zip = None
+        if self.fid is not None:
+            self.fid.close()
+            self.fid = None
+        self.f = None  # break reference cycle
+
+    def __del__(self):
+        self.close()
+
+    # Implement the Mapping ABC
+    def __iter__(self):
+        return iter(self.files)
+
+    def __len__(self):
+        return len(self.files)
+
+    def __getitem__(self, key):
+        # FIXME: This seems like it will copy strings around
+        #   more than is strictly necessary.  The zipfile
+        #   will read the string and then
+        #   the format.read_array will copy the string
+        #   to another place in memory.
+        #   It would be better if the zipfile could read
+        #   (or at least uncompress) the data
+        #   directly into the array memory.
+        member = False
+        if key in self._files:
+            member = True
+        elif key in self.files:
+            member = True
+            key += '.npy'
+        if member:
+            bytes = self.zip.open(key)
+            magic = bytes.read(len(format.MAGIC_PREFIX))
+            bytes.close()
+            if magic == format.MAGIC_PREFIX:
+                bytes = self.zip.open(key)
+                return format.read_array(bytes,
+                                         allow_pickle=self.allow_pickle,
+                                         pickle_kwargs=self.pickle_kwargs)
+            else:
+                return self.zip.read(key)
+        else:
+            raise KeyError("%s is not a file in the archive" % key)
+
+
+    # deprecate the python 2 dict apis that we supported by accident in
+    # python 3. We forgot to implement itervalues() at all in earlier
+    # versions of numpy, so no need to deprecated it here.
+
+    def iteritems(self):
+        # Numpy 1.15, 2018-02-20
+        warnings.warn(
+            "NpzFile.iteritems is deprecated in python 3, to match the "
+            "removal of dict.itertems. Use .items() instead.",
+            DeprecationWarning, stacklevel=2)
+        return self.items()
+
+    def iterkeys(self):
+        # Numpy 1.15, 2018-02-20
+        warnings.warn(
+            "NpzFile.iterkeys is deprecated in python 3, to match the "
+            "removal of dict.iterkeys. Use .keys() instead.",
+            DeprecationWarning, stacklevel=2)
+        return self.keys()
+
+
+@set_module('numpy')
+def load(file, mmap_mode=None, allow_pickle=False, fix_imports=True,
+         encoding='ASCII'):
+    """
+    Load arrays or pickled objects from ``.npy``, ``.npz`` or pickled files.
+
+    .. warning:: Loading files that contain object arrays uses the ``pickle``
+                 module, which is not secure against erroneous or maliciously
+                 constructed data. Consider passing ``allow_pickle=False`` to
+                 load data that is known not to contain object arrays for the
+                 safer handling of untrusted sources.
+
+    Parameters
+    ----------
+    file : file-like object, string, or pathlib.Path
+        The file to read. File-like objects must support the
+        ``seek()`` and ``read()`` methods. Pickled files require that the
+        file-like object support the ``readline()`` method as well.
+    mmap_mode : {None, 'r+', 'r', 'w+', 'c'}, optional
+        If not None, then memory-map the file, using the given mode (see
+        `numpy.memmap` for a detailed description of the modes).  A
+        memory-mapped array is kept on disk. However, it can be accessed
+        and sliced like any ndarray.  Memory mapping is especially useful
+        for accessing small fragments of large files without reading the
+        entire file into memory.
+    allow_pickle : bool, optional
+        Allow loading pickled object arrays stored in npy files. Reasons for
+        disallowing pickles include security, as loading pickled data can
+        execute arbitrary code. If pickles are disallowed, loading object
+        arrays will fail. Default: False
+
+        .. versionchanged:: 1.16.3
+            Made default False in response to CVE-2019-6446.
+
+    fix_imports : bool, optional
+        Only useful when loading Python 2 generated pickled files on Python 3,
+        which includes npy/npz files containing object arrays. If `fix_imports`
+        is True, pickle will try to map the old Python 2 names to the new names
+        used in Python 3.
+    encoding : str, optional
+        What encoding to use when reading Python 2 strings. Only useful when
+        loading Python 2 generated pickled files in Python 3, which includes
+        npy/npz files containing object arrays. Values other than 'latin1',
+        'ASCII', and 'bytes' are not allowed, as they can corrupt numerical
+        data. Default: 'ASCII'
+
+    Returns
+    -------
+    result : array, tuple, dict, etc.
+        Data stored in the file. For ``.npz`` files, the returned instance
+        of NpzFile class must be closed to avoid leaking file descriptors.
+
+    Raises
+    ------
+    IOError
+        If the input file does not exist or cannot be read.
+    ValueError
+        The file contains an object array, but allow_pickle=False given.
+
+    See Also
+    --------
+    save, savez, savez_compressed, loadtxt
+    memmap : Create a memory-map to an array stored in a file on disk.
+    lib.format.open_memmap : Create or load a memory-mapped ``.npy`` file.
+
+    Notes
+    -----
+    - If the file contains pickle data, then whatever object is stored
+      in the pickle is returned.
+    - If the file is a ``.npy`` file, then a single array is returned.
+    - If the file is a ``.npz`` file, then a dictionary-like object is
+      returned, containing ``{filename: array}`` key-value pairs, one for
+      each file in the archive.
+    - If the file is a ``.npz`` file, the returned value supports the
+      context manager protocol in a similar fashion to the open function::
+
+        with load('foo.npz') as data:
+            a = data['a']
+
+      The underlying file descriptor is closed when exiting the 'with'
+      block.
+
+    Examples
+    --------
+    Store data to disk, and load it again:
+
+    >>> np.save('/tmp/123', np.array([[1, 2, 3], [4, 5, 6]]))
+    >>> np.load('/tmp/123.npy')
+    array([[1, 2, 3],
+           [4, 5, 6]])
+
+    Store compressed data to disk, and load it again:
+
+    >>> a=np.array([[1, 2, 3], [4, 5, 6]])
+    >>> b=np.array([1, 2])
+    >>> np.savez('/tmp/123.npz', a=a, b=b)
+    >>> data = np.load('/tmp/123.npz')
+    >>> data['a']
+    array([[1, 2, 3],
+           [4, 5, 6]])
+    >>> data['b']
+    array([1, 2])
+    >>> data.close()
+
+    Mem-map the stored array, and then access the second row
+    directly from disk:
+
+    >>> X = np.load('/tmp/123.npy', mmap_mode='r')
+    >>> X[1, :]
+    memmap([4, 5, 6])
+
+    """
+    if encoding not in ('ASCII', 'latin1', 'bytes'):
+        # The 'encoding' value for pickle also affects what encoding
+        # the serialized binary data of NumPy arrays is loaded
+        # in. Pickle does not pass on the encoding information to
+        # NumPy. The unpickling code in numpy.core.multiarray is
+        # written to assume that unicode data appearing where binary
+        # should be is in 'latin1'. 'bytes' is also safe, as is 'ASCII'.
+        #
+        # Other encoding values can corrupt binary data, and we
+        # purposefully disallow them. For the same reason, the errors=
+        # argument is not exposed, as values other than 'strict'
+        # result can similarly silently corrupt numerical data.
+        raise ValueError("encoding must be 'ASCII', 'latin1', or 'bytes'")
+
+    pickle_kwargs = dict(encoding=encoding, fix_imports=fix_imports)
+
+    with contextlib.ExitStack() as stack:
+        if hasattr(file, 'read'):
+            fid = file
+            own_fid = False
+        else:
+            fid = stack.enter_context(open(os_fspath(file), "rb"))
+            own_fid = True
+
+        # Code to distinguish from NumPy binary files and pickles.
+        _ZIP_PREFIX = b'PK\x03\x04'
+        _ZIP_SUFFIX = b'PK\x05\x06' # empty zip files start with this
+        N = len(format.MAGIC_PREFIX)
+        magic = fid.read(N)
+        # If the file size is less than N, we need to make sure not
+        # to seek past the beginning of the file
+        fid.seek(-min(N, len(magic)), 1)  # back-up
+        if magic.startswith(_ZIP_PREFIX) or magic.startswith(_ZIP_SUFFIX):
+            # zip-file (assume .npz)
+            # Potentially transfer file ownership to NpzFile
+            stack.pop_all()
+            ret = NpzFile(fid, own_fid=own_fid, allow_pickle=allow_pickle,
+                          pickle_kwargs=pickle_kwargs)
+            return ret
+        elif magic == format.MAGIC_PREFIX:
+            # .npy file
+            if mmap_mode:
+                return format.open_memmap(file, mode=mmap_mode)
+            else:
+                return format.read_array(fid, allow_pickle=allow_pickle,
+                                         pickle_kwargs=pickle_kwargs)
+        else:
+            # Try a pickle
+            if not allow_pickle:
+                raise ValueError("Cannot load file containing pickled data "
+                                 "when allow_pickle=False")
+            try:
+                return pickle.load(fid, **pickle_kwargs)
+            except Exception:
+                raise IOError(
+                    "Failed to interpret file %s as a pickle" % repr(file))
+
+
+def _save_dispatcher(file, arr, allow_pickle=None, fix_imports=None):
+    return (arr,)
+
+
+@array_function_dispatch(_save_dispatcher)
+def save(file, arr, allow_pickle=True, fix_imports=True):
+    """
+    Save an array to a binary file in NumPy ``.npy`` format.
+
+    Parameters
+    ----------
+    file : file, str, or pathlib.Path
+        File or filename to which the data is saved.  If file is a file-object,
+        then the filename is unchanged.  If file is a string or Path, a ``.npy``
+        extension will be appended to the filename if it does not already
+        have one.
+    arr : array_like
+        Array data to be saved.
+    allow_pickle : bool, optional
+        Allow saving object arrays using Python pickles. Reasons for disallowing
+        pickles include security (loading pickled data can execute arbitrary
+        code) and portability (pickled objects may not be loadable on different
+        Python installations, for example if the stored objects require libraries
+        that are not available, and not all pickled data is compatible between
+        Python 2 and Python 3).
+        Default: True
+    fix_imports : bool, optional
+        Only useful in forcing objects in object arrays on Python 3 to be
+        pickled in a Python 2 compatible way. If `fix_imports` is True, pickle
+        will try to map the new Python 3 names to the old module names used in
+        Python 2, so that the pickle data stream is readable with Python 2.
+
+    See Also
+    --------
+    savez : Save several arrays into a ``.npz`` archive
+    savetxt, load
+
+    Notes
+    -----
+    For a description of the ``.npy`` format, see :py:mod:`numpy.lib.format`.
+
+    Any data saved to the file is appended to the end of the file.
+
+    Examples
+    --------
+    >>> from tempfile import TemporaryFile
+    >>> outfile = TemporaryFile()
+
+    >>> x = np.arange(10)
+    >>> np.save(outfile, x)
+
+    >>> _ = outfile.seek(0) # Only needed here to simulate closing & reopening file
+    >>> np.load(outfile)
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+
+
+    >>> with open('test.npy', 'wb') as f:
+    ...     np.save(f, np.array([1, 2]))
+    ...     np.save(f, np.array([1, 3]))
+    >>> with open('test.npy', 'rb') as f:
+    ...     a = np.load(f)
+    ...     b = np.load(f)
+    >>> print(a, b)
+    # [1 2] [1 3]
+    """
+    if hasattr(file, 'write'):
+        file_ctx = contextlib_nullcontext(file)
+    else:
+        file = os_fspath(file)
+        if not file.endswith('.npy'):
+            file = file + '.npy'
+        file_ctx = open(file, "wb")
+
+    with file_ctx as fid:
+        arr = np.asanyarray(arr)
+        format.write_array(fid, arr, allow_pickle=allow_pickle,
+                           pickle_kwargs=dict(fix_imports=fix_imports))
+
+
+def _savez_dispatcher(file, *args, **kwds):
+    yield from args
+    yield from kwds.values()
+
+
+@array_function_dispatch(_savez_dispatcher)
+def savez(file, *args, **kwds):
+    """Save several arrays into a single file in uncompressed ``.npz`` format.
+
+    If arguments are passed in with no keywords, the corresponding variable
+    names, in the ``.npz`` file, are 'arr_0', 'arr_1', etc. If keyword
+    arguments are given, the corresponding variable names, in the ``.npz``
+    file will match the keyword names.
+
+    Parameters
+    ----------
+    file : str or file
+        Either the filename (string) or an open file (file-like object)
+        where the data will be saved. If file is a string or a Path, the
+        ``.npz`` extension will be appended to the filename if it is not
+        already there.
+    args : Arguments, optional
+        Arrays to save to the file. Since it is not possible for Python to
+        know the names of the arrays outside `savez`, the arrays will be saved
+        with names "arr_0", "arr_1", and so on. These arguments can be any
+        expression.
+    kwds : Keyword arguments, optional
+        Arrays to save to the file. Arrays will be saved in the file with the
+        keyword names.
+
+    Returns
+    -------
+    None
+
+    See Also
+    --------
+    save : Save a single array to a binary file in NumPy format.
+    savetxt : Save an array to a file as plain text.
+    savez_compressed : Save several arrays into a compressed ``.npz`` archive
+
+    Notes
+    -----
+    The ``.npz`` file format is a zipped archive of files named after the
+    variables they contain.  The archive is not compressed and each file
+    in the archive contains one variable in ``.npy`` format. For a
+    description of the ``.npy`` format, see :py:mod:`numpy.lib.format`.
+
+    When opening the saved ``.npz`` file with `load` a `NpzFile` object is
+    returned. This is a dictionary-like object which can be queried for
+    its list of arrays (with the ``.files`` attribute), and for the arrays
+    themselves.
+
+    When saving dictionaries, the dictionary keys become filenames
+    inside the ZIP archive. Therefore, keys should be valid filenames.
+    E.g., avoid keys that begin with ``/`` or contain ``.``.
+
+    Examples
+    --------
+    >>> from tempfile import TemporaryFile
+    >>> outfile = TemporaryFile()
+    >>> x = np.arange(10)
+    >>> y = np.sin(x)
+
+    Using `savez` with \\*args, the arrays are saved with default names.
+
+    >>> np.savez(outfile, x, y)
+    >>> _ = outfile.seek(0) # Only needed here to simulate closing & reopening file
+    >>> npzfile = np.load(outfile)
+    >>> npzfile.files
+    ['arr_0', 'arr_1']
+    >>> npzfile['arr_0']
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+
+    Using `savez` with \\**kwds, the arrays are saved with the keyword names.
+
+    >>> outfile = TemporaryFile()
+    >>> np.savez(outfile, x=x, y=y)
+    >>> _ = outfile.seek(0)
+    >>> npzfile = np.load(outfile)
+    >>> sorted(npzfile.files)
+    ['x', 'y']
+    >>> npzfile['x']
+    array([0, 1, 2, 3, 4, 5, 6, 7, 8, 9])
+    """
+    _savez(file, args, kwds, False)
+
+
+def _savez_compressed_dispatcher(file, *args, **kwds):
+    yield from args
+    yield from kwds.values()
+
+
+@array_function_dispatch(_savez_compressed_dispatcher)
+def savez_compressed(file, *args, **kwds):
+    """
+    Save several arrays into a single file in compressed ``.npz`` format.
+
+    If keyword arguments are given, then filenames are taken from the keywords.
+    If arguments are passed in with no keywords, then stored filenames are
+    arr_0, arr_1, etc.
+
+    Parameters
+    ----------
+    file : str or file
+        Either the filename (string) or an open file (file-like object)
+        where the data will be saved. If file is a string or a Path, the
+        ``.npz`` extension will be appended to the filename if it is not
+        already there.
+    args : Arguments, optional
+        Arrays to save to the file. Since it is not possible for Python to
+        know the names of the arrays outside `savez`, the arrays will be saved
+        with names "arr_0", "arr_1", and so on. These arguments can be any
+        expression.
+    kwds : Keyword arguments, optional
+        Arrays to save to the file. Arrays will be saved in the file with the
+        keyword names.
+
+    Returns
+    -------
+    None
+
+    See Also
+    --------
+    numpy.save : Save a single array to a binary file in NumPy format.
+    numpy.savetxt : Save an array to a file as plain text.
+    numpy.savez : Save several arrays into an uncompressed ``.npz`` file format
+    numpy.load : Load the files created by savez_compressed.
+
+    Notes
+    -----
+    The ``.npz`` file format is a zipped archive of files named after the
+    variables they contain.  The archive is compressed with
+    ``zipfile.ZIP_DEFLATED`` and each file in the archive contains one variable
+    in ``.npy`` format. For a description of the ``.npy`` format, see
+    :py:mod:`numpy.lib.format`.
+
+
+    When opening the saved ``.npz`` file with `load` a `NpzFile` object is
+    returned. This is a dictionary-like object which can be queried for
+    its list of arrays (with the ``.files`` attribute), and for the arrays
+    themselves.
+
+    Examples
+    --------
+    >>> test_array = np.random.rand(3, 2)
+    >>> test_vector = np.random.rand(4)
+    >>> np.savez_compressed('/tmp/123', a=test_array, b=test_vector)
+    >>> loaded = np.load('/tmp/123.npz')
+    >>> print(np.array_equal(test_array, loaded['a']))
+    True
+    >>> print(np.array_equal(test_vector, loaded['b']))
+    True
+
+    """
+    _savez(file, args, kwds, True)
+
+
+def _savez(file, args, kwds, compress, allow_pickle=True, pickle_kwargs=None):
+    # Import is postponed to here since zipfile depends on gzip, an optional
+    # component of the so-called standard library.
+    import zipfile
+
+    if not hasattr(file, 'write'):
+        file = os_fspath(file)
+        if not file.endswith('.npz'):
+            file = file + '.npz'
+
+    namedict = kwds
+    for i, val in enumerate(args):
+        key = 'arr_%d' % i
+        if key in namedict.keys():
+            raise ValueError(
+                "Cannot use un-named variables and keyword %s" % key)
+        namedict[key] = val
+
+    if compress:
+        compression = zipfile.ZIP_DEFLATED
+    else:
+        compression = zipfile.ZIP_STORED
+
+    zipf = zipfile_factory(file, mode="w", compression=compression)
+
+    if sys.version_info >= (3, 6):
+        # Since Python 3.6 it is possible to write directly to a ZIP file.
+        for key, val in namedict.items():
+            fname = key + '.npy'
+            val = np.asanyarray(val)
+            # always force zip64, gh-10776
+            with zipf.open(fname, 'w', force_zip64=True) as fid:
+                format.write_array(fid, val,
+                                   allow_pickle=allow_pickle,
+                                   pickle_kwargs=pickle_kwargs)
+    else:
+        # Stage arrays in a temporary file on disk, before writing to zip.
+
+        # Import deferred for startup time improvement
+        import tempfile
+        # Since target file might be big enough to exceed capacity of a global
+        # temporary directory, create temp file side-by-side with the target file.
+        file_dir, file_prefix = os.path.split(file) if _is_string_like(file) else (None, 'tmp')
+        fd, tmpfile = tempfile.mkstemp(prefix=file_prefix, dir=file_dir, suffix='-numpy.npy')
+        os.close(fd)
+        try:
+            for key, val in namedict.items():
+                fname = key + '.npy'
+                fid = open(tmpfile, 'wb')
+                try:
+                    format.write_array(fid, np.asanyarray(val),
+                                       allow_pickle=allow_pickle,
+                                       pickle_kwargs=pickle_kwargs)
+                    fid.close()
+                    fid = None
+                    zipf.write(tmpfile, arcname=fname)
+                except IOError as exc:
+                    raise IOError("Failed to write to %s: %s" % (tmpfile, exc))
+                finally:
+                    if fid:
+                        fid.close()
+        finally:
+            os.remove(tmpfile)
+
+    zipf.close()
+
+
+def _getconv(dtype):
+    """ Find the correct dtype converter. Adapted from matplotlib """
+
+    def floatconv(x):
+        x.lower()
+        if '0x' in x:
+            return float.fromhex(x)
+        return float(x)
+
+    typ = dtype.type
+    if issubclass(typ, np.bool_):
+        return lambda x: bool(int(x))
+    if issubclass(typ, np.uint64):
+        return np.uint64
+    if issubclass(typ, np.int64):
+        return np.int64
+    if issubclass(typ, np.integer):
+        return lambda x: int(float(x))
+    elif issubclass(typ, np.longdouble):
+        return np.longdouble
+    elif issubclass(typ, np.floating):
+        return floatconv
+    elif issubclass(typ, complex):
+        return lambda x: complex(asstr(x).replace('+-', '-'))
+    elif issubclass(typ, np.bytes_):
+        return asbytes
+    elif issubclass(typ, np.unicode_):
+        return asunicode
+    else:
+        return asstr
+
+# amount of lines loadtxt reads in one chunk, can be overridden for testing
+_loadtxt_chunksize = 50000
+
+
+@set_module('numpy')
+def loadtxt(fname, dtype=float, comments='#', delimiter=None,
+            converters=None, skiprows=0, usecols=None, unpack=False,
+            ndmin=0, encoding='bytes', max_rows=None):
+    r"""
+    Load data from a text file.
+
+    Each row in the text file must have the same number of values.
+
+    Parameters
+    ----------
+    fname : file, str, or pathlib.Path
+        File, filename, or generator to read.  If the filename extension is
+        ``.gz`` or ``.bz2``, the file is first decompressed. Note that
+        generators should return byte strings.
+    dtype : data-type, optional
+        Data-type of the resulting array; default: float.  If this is a
+        structured data-type, the resulting array will be 1-dimensional, and
+        each row will be interpreted as an element of the array.  In this
+        case, the number of columns used must match the number of fields in
+        the data-type.
+    comments : str or sequence of str, optional
+        The characters or list of characters used to indicate the start of a
+        comment. None implies no comments. For backwards compatibility, byte
+        strings will be decoded as 'latin1'. The default is '#'.
+    delimiter : str, optional
+        The string used to separate values. For backwards compatibility, byte
+        strings will be decoded as 'latin1'. The default is whitespace.
+    converters : dict, optional
+        A dictionary mapping column number to a function that will parse the
+        column string into the desired value.  E.g., if column 0 is a date
+        string: ``converters = {0: datestr2num}``.  Converters can also be
+        used to provide a default value for missing data (but see also
+        `genfromtxt`): ``converters = {3: lambda s: float(s.strip() or 0)}``.
+        Default: None.
+    skiprows : int, optional
+        Skip the first `skiprows` lines, including comments; default: 0.
+    usecols : int or sequence, optional
+        Which columns to read, with 0 being the first. For example,
+        ``usecols = (1,4,5)`` will extract the 2nd, 5th and 6th columns.
+        The default, None, results in all columns being read.
+
+        .. versionchanged:: 1.11.0
+            When a single column has to be read it is possible to use
+            an integer instead of a tuple. E.g ``usecols = 3`` reads the
+            fourth column the same way as ``usecols = (3,)`` would.
+    unpack : bool, optional
+        If True, the returned array is transposed, so that arguments may be
+        unpacked using ``x, y, z = loadtxt(...)``.  When used with a structured
+        data-type, arrays are returned for each field.  Default is False.
+    ndmin : int, optional
+        The returned array will have at least `ndmin` dimensions.
+        Otherwise mono-dimensional axes will be squeezed.
+        Legal values: 0 (default), 1 or 2.
+
+        .. versionadded:: 1.6.0
+    encoding : str, optional
+        Encoding used to decode the inputfile. Does not apply to input streams.
+        The special value 'bytes' enables backward compatibility workarounds
+        that ensures you receive byte arrays as results if possible and passes
+        'latin1' encoded strings to converters. Override this value to receive
+        unicode arrays and pass strings as input to converters.  If set to None
+        the system default is used. The default value is 'bytes'.
+
+        .. versionadded:: 1.14.0
+    max_rows : int, optional
+        Read `max_rows` lines of content after `skiprows` lines. The default
+        is to read all the lines.
+
+        .. versionadded:: 1.16.0
+
+    Returns
+    -------
+    out : ndarray
+        Data read from the text file.
+
+    See Also
+    --------
+    load, fromstring, fromregex
+    genfromtxt : Load data with missing values handled as specified.
+    scipy.io.loadmat : reads MATLAB data files
+
+    Notes
+    -----
+    This function aims to be a fast reader for simply formatted files.  The
+    `genfromtxt` function provides more sophisticated handling of, e.g.,
+    lines with missing values.
+
+    .. versionadded:: 1.10.0
+
+    The strings produced by the Python float.hex method can be used as
+    input for floats.
+
+    Examples
+    --------
+    >>> from io import StringIO   # StringIO behaves like a file object
+    >>> c = StringIO("0 1\n2 3")
+    >>> np.loadtxt(c)
+    array([[0., 1.],
+           [2., 3.]])
+
+    >>> d = StringIO("M 21 72\nF 35 58")
+    >>> np.loadtxt(d, dtype={'names': ('gender', 'age', 'weight'),
+    ...                      'formats': ('S1', 'i4', 'f4')})
+    array([(b'M', 21, 72.), (b'F', 35, 58.)],
+          dtype=[('gender', 'S1'), ('age', '<i4'), ('weight', '<f4')])
+
+    >>> c = StringIO("1,0,2\n3,0,4")
+    >>> x, y = np.loadtxt(c, delimiter=',', usecols=(0, 2), unpack=True)
+    >>> x
+    array([1., 3.])
+    >>> y
+    array([2., 4.])
+
+    This example shows how `converters` can be used to convert a field
+    with a trailing minus sign into a negative number.
+
+    >>> s = StringIO('10.01 31.25-\n19.22 64.31\n17.57- 63.94')
+    >>> def conv(fld):
+    ...     return -float(fld[:-1]) if fld.endswith(b'-') else float(fld)
+    ...
+    >>> np.loadtxt(s, converters={0: conv, 1: conv})
+    array([[ 10.01, -31.25],
+           [ 19.22,  64.31],
+           [-17.57,  63.94]])
+    """
+    # Type conversions for Py3 convenience
+    if comments is not None:
+        if isinstance(comments, (str, bytes)):
+            comments = [comments]
+        comments = [_decode_line(x) for x in comments]
+        # Compile regex for comments beforehand
+        comments = (re.escape(comment) for comment in comments)
+        regex_comments = re.compile('|'.join(comments))
+
+    if delimiter is not None:
+        delimiter = _decode_line(delimiter)
+
+    user_converters = converters
+
+    if encoding == 'bytes':
+        encoding = None
+        byte_converters = True
+    else:
+        byte_converters = False
+
+    if usecols is not None:
+        # Allow usecols to be a single int or a sequence of ints
+        try:
+            usecols_as_list = list(usecols)
+        except TypeError:
+            usecols_as_list = [usecols]
+        for col_idx in usecols_as_list:
+            try:
+                opindex(col_idx)
+            except TypeError as e:
+                e.args = (
+                    "usecols must be an int or a sequence of ints but "
+                    "it contains at least one element of type %s" %
+                    type(col_idx),
+                    )
+                raise
+        # Fall back to existing code
+        usecols = usecols_as_list
+
+    fown = False
+    try:
+        if isinstance(fname, os_PathLike):
+            fname = os_fspath(fname)
+        if _is_string_like(fname):
+            fh = np.lib._datasource.open(fname, 'rt', encoding=encoding)
+            fencoding = getattr(fh, 'encoding', 'latin1')
+            fh = iter(fh)
+            fown = True
+        else:
+            fh = iter(fname)
+            fencoding = getattr(fname, 'encoding', 'latin1')
+    except TypeError:
+        raise ValueError('fname must be a string, file handle, or generator')
+
+    # input may be a python2 io stream
+    if encoding is not None:
+        fencoding = encoding
+    # we must assume local encoding
+    # TODO emit portability warning?
+    elif fencoding is None:
+        import locale
+        fencoding = locale.getpreferredencoding()
+
+    # not to be confused with the flatten_dtype we import...
+    @recursive
+    def flatten_dtype_internal(self, dt):
+        """Unpack a structured data-type, and produce re-packing info."""
+        if dt.names is None:
+            # If the dtype is flattened, return.
+            # If the dtype has a shape, the dtype occurs
+            # in the list more than once.
+            shape = dt.shape
+            if len(shape) == 0:
+                return ([dt.base], None)
+            else:
+                packing = [(shape[-1], list)]
+                if len(shape) > 1:
+                    for dim in dt.shape[-2::-1]:
+                        packing = [(dim*packing[0][0], packing*dim)]
+                return ([dt.base] * int(np.prod(dt.shape)), packing)
+        else:
+            types = []
+            packing = []
+            for field in dt.names:
+                tp, bytes = dt.fields[field]
+                flat_dt, flat_packing = self(tp)
+                types.extend(flat_dt)
+                # Avoid extra nesting for subarrays
+                if tp.ndim > 0:
+                    packing.extend(flat_packing)
+                else:
+                    packing.append((len(flat_dt), flat_packing))
+            return (types, packing)
+
+    @recursive
+    def pack_items(self, items, packing):
+        """Pack items into nested lists based on re-packing info."""
+        if packing is None:
+            return items[0]
+        elif packing is tuple:
+            return tuple(items)
+        elif packing is list:
+            return list(items)
+        else:
+            start = 0
+            ret = []
+            for length, subpacking in packing:
+                ret.append(self(items[start:start+length], subpacking))
+                start += length
+            return tuple(ret)
+
+    def split_line(line):
+        """Chop off comments, strip, and split at delimiter. """
+        line = _decode_line(line, encoding=encoding)
+
+        if comments is not None:
+            line = regex_comments.split(line, maxsplit=1)[0]
+        line = line.strip('\r\n')
+        if line:
+            return line.split(delimiter)
+        else:
+            return []
+
+    def read_data(chunk_size):
+        """Parse each line, including the first.
+
+        The file read, `fh`, is a global defined above.
+
+        Parameters
+        ----------
+        chunk_size : int
+            At most `chunk_size` lines are read at a time, with iteration
+            until all lines are read.
+
+        """
+        X = []
+        line_iter = itertools.chain([first_line], fh)
+        line_iter = itertools.islice(line_iter, max_rows)
+        for i, line in enumerate(line_iter):
+            vals = split_line(line)
+            if len(vals) == 0:
+                continue
+            if usecols:
+                vals = [vals[j] for j in usecols]
+            if len(vals) != N:
+                line_num = i + skiprows + 1
+                raise ValueError("Wrong number of columns at line %d"
+                                 % line_num)
+
+            # Convert each value according to its column and store
+            items = [conv(val) for (conv, val) in zip(converters, vals)]
+
+            # Then pack it according to the dtype's nesting
+            items = pack_items(items, packing)
+            X.append(items)
+            if len(X) > chunk_size:
+                yield X
+                X = []
+        if X:
+            yield X
+
+    try:
+        # Make sure we're dealing with a proper dtype
+        dtype = np.dtype(dtype)
+        defconv = _getconv(dtype)
+
+        # Skip the first `skiprows` lines
+        for i in range(skiprows):
+            next(fh)
+
+        # Read until we find a line with some values, and use
+        # it to estimate the number of columns, N.
+        first_vals = None
+        try:
+            while not first_vals:
+                first_line = next(fh)
+                first_vals = split_line(first_line)
+        except StopIteration:
+            # End of lines reached
+            first_line = ''
+            first_vals = []
+            warnings.warn('loadtxt: Empty input file: "%s"' % fname, stacklevel=2)
+        N = len(usecols or first_vals)
+
+        dtype_types, packing = flatten_dtype_internal(dtype)
+        if len(dtype_types) > 1:
+            # We're dealing with a structured array, each field of
+            # the dtype matches a column
+            converters = [_getconv(dt) for dt in dtype_types]
+        else:
+            # All fields have the same dtype
+            converters = [defconv for i in range(N)]
+            if N > 1:
+                packing = [(N, tuple)]
+
+        # By preference, use the converters specified by the user
+        for i, conv in (user_converters or {}).items():
+            if usecols:
+                try:
+                    i = usecols.index(i)
+                except ValueError:
+                    # Unused converter specified
+                    continue
+            if byte_converters:
+                # converters may use decode to workaround numpy's old behaviour,
+                # so encode the string again before passing to the user converter
+                def tobytes_first(x, conv):
+                    if type(x) is bytes:
+                        return conv(x)
+                    return conv(x.encode("latin1"))
+                converters[i] = functools.partial(tobytes_first, conv=conv)
+            else:
+                converters[i] = conv
+
+        converters = [conv if conv is not bytes else
+                      lambda x: x.encode(fencoding) for conv in converters]
+
+        # read data in chunks and fill it into an array via resize
+        # over-allocating and shrinking the array later may be faster but is
+        # probably not relevant compared to the cost of actually reading and
+        # converting the data
+        X = None
+        for x in read_data(_loadtxt_chunksize):
+            if X is None:
+                X = np.array(x, dtype)
+            else:
+                nshape = list(X.shape)
+                pos = nshape[0]
+                nshape[0] += len(x)
+                X.resize(nshape, refcheck=False)
+                X[pos:, ...] = x
+    finally:
+        if fown:
+            fh.close()
+
+    if X is None:
+        X = np.array([], dtype)
+
+    # Multicolumn data are returned with shape (1, N, M), i.e.
+    # (1, 1, M) for a single row - remove the singleton dimension there
+    if X.ndim == 3 and X.shape[:2] == (1, 1):
+        X.shape = (1, -1)
+
+    # Verify that the array has at least dimensions `ndmin`.
+    # Check correctness of the values of `ndmin`
+    if ndmin not in [0, 1, 2]:
+        raise ValueError('Illegal value of ndmin keyword: %s' % ndmin)
+    # Tweak the size and shape of the arrays - remove extraneous dimensions
+    if X.ndim > ndmin:
+        X = np.squeeze(X)
+    # and ensure we have the minimum number of dimensions asked for
+    # - has to be in this order for the odd case ndmin=1, X.squeeze().ndim=0
+    if X.ndim < ndmin:
+        if ndmin == 1:
+            X = np.atleast_1d(X)
+        elif ndmin == 2:
+            X = np.atleast_2d(X).T
+
+    if unpack:
+        if len(dtype_types) > 1:
+            # For structured arrays, return an array for each field.
+            return [X[field] for field in dtype.names]
+        else:
+            return X.T
+    else:
+        return X
+
+
+def _savetxt_dispatcher(fname, X, fmt=None, delimiter=None, newline=None,
+                        header=None, footer=None, comments=None,
+                        encoding=None):
+    return (X,)
+
+
+@array_function_dispatch(_savetxt_dispatcher)
+def savetxt(fname, X, fmt='%.18e', delimiter=' ', newline='\n', header='',
+            footer='', comments='# ', encoding=None):
+    """
+    Save an array to a text file.
+
+    Parameters
+    ----------
+    fname : filename or file handle
+        If the filename ends in ``.gz``, the file is automatically saved in
+        compressed gzip format.  `loadtxt` understands gzipped files
+        transparently.
+    X : 1D or 2D array_like
+        Data to be saved to a text file.
+    fmt : str or sequence of strs, optional
+        A single format (%10.5f), a sequence of formats, or a
+        multi-format string, e.g. 'Iteration %d -- %10.5f', in which
+        case `delimiter` is ignored. For complex `X`, the legal options
+        for `fmt` are:
+
+        * a single specifier, `fmt='%.4e'`, resulting in numbers formatted
+          like `' (%s+%sj)' % (fmt, fmt)`
+        * a full string specifying every real and imaginary part, e.g.
+          `' %.4e %+.4ej %.4e %+.4ej %.4e %+.4ej'` for 3 columns
+        * a list of specifiers, one per column - in this case, the real
+          and imaginary part must have separate specifiers,
+          e.g. `['%.3e + %.3ej', '(%.15e%+.15ej)']` for 2 columns
+    delimiter : str, optional
+        String or character separating columns.
+    newline : str, optional
+        String or character separating lines.
+
+        .. versionadded:: 1.5.0
+    header : str, optional
+        String that will be written at the beginning of the file.
+
+        .. versionadded:: 1.7.0
+    footer : str, optional
+        String that will be written at the end of the file.
+
+        .. versionadded:: 1.7.0
+    comments : str, optional
+        String that will be prepended to the ``header`` and ``footer`` strings,
+        to mark them as comments. Default: '# ',  as expected by e.g.
+        ``numpy.loadtxt``.
+
+        .. versionadded:: 1.7.0
+    encoding : {None, str}, optional
+        Encoding used to encode the outputfile. Does not apply to output
+        streams. If the encoding is something other than 'bytes' or 'latin1'
+        you will not be able to load the file in NumPy versions < 1.14. Default
+        is 'latin1'.
+
+        .. versionadded:: 1.14.0
+
+
+    See Also
+    --------
+    save : Save an array to a binary file in NumPy ``.npy`` format
+    savez : Save several arrays into an uncompressed ``.npz`` archive
+    savez_compressed : Save several arrays into a compressed ``.npz`` archive
+
+    Notes
+    -----
+    Further explanation of the `fmt` parameter
+    (``%[flag]width[.precision]specifier``):
+
+    flags:
+        ``-`` : left justify
+
+        ``+`` : Forces to precede result with + or -.
+
+        ``0`` : Left pad the number with zeros instead of space (see width).
+
+    width:
+        Minimum number of characters to be printed. The value is not truncated
+        if it has more characters.
+
+    precision:
+        - For integer specifiers (eg. ``d,i,o,x``), the minimum number of
+          digits.
+        - For ``e, E`` and ``f`` specifiers, the number of digits to print
+          after the decimal point.
+        - For ``g`` and ``G``, the maximum number of significant digits.
+        - For ``s``, the maximum number of characters.
+
+    specifiers:
+        ``c`` : character
+
+        ``d`` or ``i`` : signed decimal integer
+
+        ``e`` or ``E`` : scientific notation with ``e`` or ``E``.
+
+        ``f`` : decimal floating point
+
+        ``g,G`` : use the shorter of ``e,E`` or ``f``
+
+        ``o`` : signed octal
+
+        ``s`` : string of characters
+
+        ``u`` : unsigned decimal integer
+
+        ``x,X`` : unsigned hexadecimal integer
+
+    This explanation of ``fmt`` is not complete, for an exhaustive
+    specification see [1]_.
+
+    References
+    ----------
+    .. [1] `Format Specification Mini-Language
+           <https://docs.python.org/library/string.html#format-specification-mini-language>`_,
+           Python Documentation.
+
+    Examples
+    --------
+    >>> x = y = z = np.arange(0.0,5.0,1.0)
+    >>> np.savetxt('test.out', x, delimiter=',')   # X is an array
+    >>> np.savetxt('test.out', (x,y,z))   # x,y,z equal sized 1D arrays
+    >>> np.savetxt('test.out', x, fmt='%1.4e')   # use exponential notation
+
+    """
+
+    # Py3 conversions first
+    if isinstance(fmt, bytes):
+        fmt = asstr(fmt)
+    delimiter = asstr(delimiter)
+
+    class WriteWrap:
+        """Convert to bytes on bytestream inputs.
+
+        """
+        def __init__(self, fh, encoding):
+            self.fh = fh
+            self.encoding = encoding
+            self.do_write = self.first_write
+
+        def close(self):
+            self.fh.close()
+
+        def write(self, v):
+            self.do_write(v)
+
+        def write_bytes(self, v):
+            if isinstance(v, bytes):
+                self.fh.write(v)
+            else:
+                self.fh.write(v.encode(self.encoding))
+
+        def write_normal(self, v):
+            self.fh.write(asunicode(v))
+
+        def first_write(self, v):
+            try:
+                self.write_normal(v)
+                self.write = self.write_normal
+            except TypeError:
+                # input is probably a bytestream
+                self.write_bytes(v)
+                self.write = self.write_bytes
+
+    own_fh = False
+    if isinstance(fname, os_PathLike):
+        fname = os_fspath(fname)
+    if _is_string_like(fname):
+        # datasource doesn't support creating a new file ...
+        open(fname, 'wt').close()
+        fh = np.lib._datasource.open(fname, 'wt', encoding=encoding)
+        own_fh = True
+    elif hasattr(fname, 'write'):
+        # wrap to handle byte output streams
+        fh = WriteWrap(fname, encoding or 'latin1')
+    else:
+        raise ValueError('fname must be a string or file handle')
+
+    try:
+        X = np.asarray(X)
+
+        # Handle 1-dimensional arrays
+        if X.ndim == 0 or X.ndim > 2:
+            raise ValueError(
+                "Expected 1D or 2D array, got %dD array instead" % X.ndim)
+        elif X.ndim == 1:
+            # Common case -- 1d array of numbers
+            if X.dtype.names is None:
+                X = np.atleast_2d(X).T
+                ncol = 1
+
+            # Complex dtype -- each field indicates a separate column
+            else:
+                ncol = len(X.dtype.names)
+        else:
+            ncol = X.shape[1]
+
+        iscomplex_X = np.iscomplexobj(X)
+        # `fmt` can be a string with multiple insertion points or a
+        # list of formats.  E.g. '%10.5f\t%10d' or ('%10.5f', '$10d')
+        if type(fmt) in (list, tuple):
+            if len(fmt) != ncol:
+                raise AttributeError('fmt has wrong shape.  %s' % str(fmt))
+            format = asstr(delimiter).join(map(asstr, fmt))
+        elif isinstance(fmt, str):
+            n_fmt_chars = fmt.count('%')
+            error = ValueError('fmt has wrong number of %% formats:  %s' % fmt)
+            if n_fmt_chars == 1:
+                if iscomplex_X:
+                    fmt = [' (%s+%sj)' % (fmt, fmt), ] * ncol
+                else:
+                    fmt = [fmt, ] * ncol
+                format = delimiter.join(fmt)
+            elif iscomplex_X and n_fmt_chars != (2 * ncol):
+                raise error
+            elif ((not iscomplex_X) and n_fmt_chars != ncol):
+                raise error
+            else:
+                format = fmt
+        else:
+            raise ValueError('invalid fmt: %r' % (fmt,))
+
+        if len(header) > 0:
+            header = header.replace('\n', '\n' + comments)
+            fh.write(comments + header + newline)
+        if iscomplex_X:
+            for row in X:
+                row2 = []
+                for number in row:
+                    row2.append(number.real)
+                    row2.append(number.imag)
+                s = format % tuple(row2) + newline
+                fh.write(s.replace('+-', '-'))
+        else:
+            for row in X:
+                try:
+                    v = format % tuple(row) + newline
+                except TypeError:
+                    raise TypeError("Mismatch between array dtype ('%s') and "
+                                    "format specifier ('%s')"
+                                    % (str(X.dtype), format))
+                fh.write(v)
+
+        if len(footer) > 0:
+            footer = footer.replace('\n', '\n' + comments)
+            fh.write(comments + footer + newline)
+    finally:
+        if own_fh:
+            fh.close()
+
+
+@set_module('numpy')
+def fromregex(file, regexp, dtype, encoding=None):
+    """
+    Construct an array from a text file, using regular expression parsing.
+
+    The returned array is always a structured array, and is constructed from
+    all matches of the regular expression in the file. Groups in the regular
+    expression are converted to fields of the structured array.
+
+    Parameters
+    ----------
+    file : str or file
+        Filename or file object to read.
+    regexp : str or regexp
+        Regular expression used to parse the file.
+        Groups in the regular expression correspond to fields in the dtype.
+    dtype : dtype or list of dtypes
+        Dtype for the structured array.
+    encoding : str, optional
+        Encoding used to decode the inputfile. Does not apply to input streams.
+
+        .. versionadded:: 1.14.0
+
+    Returns
+    -------
+    output : ndarray
+        The output array, containing the part of the content of `file` that
+        was matched by `regexp`. `output` is always a structured array.
+
+    Raises
+    ------
+    TypeError
+        When `dtype` is not a valid dtype for a structured array.
+
+    See Also
+    --------
+    fromstring, loadtxt
+
+    Notes
+    -----
+    Dtypes for structured arrays can be specified in several forms, but all
+    forms specify at least the data type and field name. For details see
+    `doc.structured_arrays`.
+
+    Examples
+    --------
+    >>> f = open('test.dat', 'w')
+    >>> _ = f.write("1312 foo\\n1534  bar\\n444   qux")
+    >>> f.close()
+
+    >>> regexp = r"(\\d+)\\s+(...)"  # match [digits, whitespace, anything]
+    >>> output = np.fromregex('test.dat', regexp,
+    ...                       [('num', np.int64), ('key', 'S3')])
+    >>> output
+    array([(1312, b'foo'), (1534, b'bar'), ( 444, b'qux')],
+          dtype=[('num', '<i8'), ('key', 'S3')])
+    >>> output['num']
+    array([1312, 1534,  444])
+
+    """
+    own_fh = False
+    if not hasattr(file, "read"):
+        file = np.lib._datasource.open(file, 'rt', encoding=encoding)
+        own_fh = True
+
+    try:
+        if not isinstance(dtype, np.dtype):
+            dtype = np.dtype(dtype)
+
+        content = file.read()
+        if isinstance(content, bytes) and isinstance(regexp, np.compat.unicode):
+            regexp = asbytes(regexp)
+        elif isinstance(content, np.compat.unicode) and isinstance(regexp, bytes):
+            regexp = asstr(regexp)
+
+        if not hasattr(regexp, 'match'):
+            regexp = re.compile(regexp)
+        seq = regexp.findall(content)
+        if seq and not isinstance(seq[0], tuple):
+            # Only one group is in the regexp.
+            # Create the new array as a single data-type and then
+            #   re-interpret as a single-field structured array.
+            newdtype = np.dtype(dtype[dtype.names[0]])
+            output = np.array(seq, dtype=newdtype)
+            output.dtype = dtype
+        else:
+            output = np.array(seq, dtype=dtype)
+
+        return output
+    finally:
+        if own_fh:
+            file.close()
+
+
+#####--------------------------------------------------------------------------
+#---- --- ASCII functions ---
+#####--------------------------------------------------------------------------
+
+
+@set_module('numpy')
+def genfromtxt(fname, dtype=float, comments='#', delimiter=None,
+               skip_header=0, skip_footer=0, converters=None,
+               missing_values=None, filling_values=None, usecols=None,
+               names=None, excludelist=None,
+               deletechars=''.join(sorted(NameValidator.defaultdeletechars)),
+               replace_space='_', autostrip=False, case_sensitive=True,
+               defaultfmt="f%i", unpack=None, usemask=False, loose=True,
+               invalid_raise=True, max_rows=None, encoding='bytes'):
+    """
+    Load data from a text file, with missing values handled as specified.
+
+    Each line past the first `skip_header` lines is split at the `delimiter`
+    character, and characters following the `comments` character are discarded.
+
+    Parameters
+    ----------
+    fname : file, str, pathlib.Path, list of str, generator
+        File, filename, list, or generator to read.  If the filename
+        extension is `.gz` or `.bz2`, the file is first decompressed. Note
+        that generators must return byte strings. The strings
+        in a list or produced by a generator are treated as lines.
+    dtype : dtype, optional
+        Data type of the resulting array.
+        If None, the dtypes will be determined by the contents of each
+        column, individually.
+    comments : str, optional
+        The character used to indicate the start of a comment.
+        All the characters occurring on a line after a comment are discarded
+    delimiter : str, int, or sequence, optional
+        The string used to separate values.  By default, any consecutive
+        whitespaces act as delimiter.  An integer or sequence of integers
+        can also be provided as width(s) of each field.
+    skiprows : int, optional
+        `skiprows` was removed in numpy 1.10. Please use `skip_header` instead.
+    skip_header : int, optional
+        The number of lines to skip at the beginning of the file.
+    skip_footer : int, optional
+        The number of lines to skip at the end of the file.
+    converters : variable, optional
+        The set of functions that convert the data of a column to a value.
+        The converters can also be used to provide a default value
+        for missing data: ``converters = {3: lambda s: float(s or 0)}``.
+    missing : variable, optional
+        `missing` was removed in numpy 1.10. Please use `missing_values`
+        instead.
+    missing_values : variable, optional
+        The set of strings corresponding to missing data.
+    filling_values : variable, optional
+        The set of values to be used as default when the data are missing.
+    usecols : sequence, optional
+        Which columns to read, with 0 being the first.  For example,
+        ``usecols = (1, 4, 5)`` will extract the 2nd, 5th and 6th columns.
+    names : {None, True, str, sequence}, optional
+        If `names` is True, the field names are read from the first line after
+        the first `skip_header` lines.  This line can optionally be proceeded
+        by a comment delimiter. If `names` is a sequence or a single-string of
+        comma-separated names, the names will be used to define the field names
+        in a structured dtype. If `names` is None, the names of the dtype
+        fields will be used, if any.
+    excludelist : sequence, optional
+        A list of names to exclude. This list is appended to the default list
+        ['return','file','print']. Excluded names are appended an underscore:
+        for example, `file` would become `file_`.
+    deletechars : str, optional
+        A string combining invalid characters that must be deleted from the
+        names.
+    defaultfmt : str, optional
+        A format used to define default field names, such as "f%i" or "f_%02i".
+    autostrip : bool, optional
+        Whether to automatically strip white spaces from the variables.
+    replace_space : char, optional
+        Character(s) used in replacement of white spaces in the variables
+        names. By default, use a '_'.
+    case_sensitive : {True, False, 'upper', 'lower'}, optional
+        If True, field names are case sensitive.
+        If False or 'upper', field names are converted to upper case.
+        If 'lower', field names are converted to lower case.
+    unpack : bool, optional
+        If True, the returned array is transposed, so that arguments may be
+        unpacked using ``x, y, z = loadtxt(...)``
+    usemask : bool, optional
+        If True, return a masked array.
+        If False, return a regular array.
+    loose : bool, optional
+        If True, do not raise errors for invalid values.
+    invalid_raise : bool, optional
+        If True, an exception is raised if an inconsistency is detected in the
+        number of columns.
+        If False, a warning is emitted and the offending lines are skipped.
+    max_rows : int,  optional
+        The maximum number of rows to read. Must not be used with skip_footer
+        at the same time.  If given, the value must be at least 1. Default is
+        to read the entire file.
+
+        .. versionadded:: 1.10.0
+    encoding : str, optional
+        Encoding used to decode the inputfile. Does not apply when `fname` is
+        a file object.  The special value 'bytes' enables backward compatibility
+        workarounds that ensure that you receive byte arrays when possible
+        and passes latin1 encoded strings to converters. Override this value to
+        receive unicode arrays and pass strings as input to converters.  If set
+        to None the system default is used. The default value is 'bytes'.
+
+        .. versionadded:: 1.14.0
+
+    Returns
+    -------
+    out : ndarray
+        Data read from the text file. If `usemask` is True, this is a
+        masked array.
+
+    See Also
+    --------
+    numpy.loadtxt : equivalent function when no data is missing.
+
+    Notes
+    -----
+    * When spaces are used as delimiters, or when no delimiter has been given
+      as input, there should not be any missing data between two fields.
+    * When the variables are named (either by a flexible dtype or with `names`),
+      there must not be any header in the file (else a ValueError
+      exception is raised).
+    * Individual values are not stripped of spaces by default.
+      When using a custom converter, make sure the function does remove spaces.
+
+    References
+    ----------
+    .. [1] NumPy User Guide, section `I/O with NumPy
+           <https://docs.scipy.org/doc/numpy/user/basics.io.genfromtxt.html>`_.
+
+    Examples
+    ---------
+    >>> from io import StringIO
+    >>> import numpy as np
+
+    Comma delimited file with mixed dtype
+
+    >>> s = StringIO(u"1,1.3,abcde")
+    >>> data = np.genfromtxt(s, dtype=[('myint','i8'),('myfloat','f8'),
+    ... ('mystring','S5')], delimiter=",")
+    >>> data
+    array((1, 1.3, b'abcde'),
+          dtype=[('myint', '<i8'), ('myfloat', '<f8'), ('mystring', 'S5')])
+
+    Using dtype = None
+
+    >>> _ = s.seek(0) # needed for StringIO example only
+    >>> data = np.genfromtxt(s, dtype=None,
+    ... names = ['myint','myfloat','mystring'], delimiter=",")
+    >>> data
+    array((1, 1.3, b'abcde'),
+          dtype=[('myint', '<i8'), ('myfloat', '<f8'), ('mystring', 'S5')])
+
+    Specifying dtype and names
+
+    >>> _ = s.seek(0)
+    >>> data = np.genfromtxt(s, dtype="i8,f8,S5",
+    ... names=['myint','myfloat','mystring'], delimiter=",")
+    >>> data
+    array((1, 1.3, b'abcde'),
+          dtype=[('myint', '<i8'), ('myfloat', '<f8'), ('mystring', 'S5')])
+
+    An example with fixed-width columns
+
+    >>> s = StringIO(u"11.3abcde")
+    >>> data = np.genfromtxt(s, dtype=None, names=['intvar','fltvar','strvar'],
+    ...     delimiter=[1,3,5])
+    >>> data
+    array((1, 1.3, b'abcde'),
+          dtype=[('intvar', '<i8'), ('fltvar', '<f8'), ('strvar', 'S5')])
+
+    An example to show comments
+
+    >>> f = StringIO('''
+    ... text,# of chars
+    ... hello world,11
+    ... numpy,5''')
+    >>> np.genfromtxt(f, dtype='S12,S12', delimiter=',')
+    array([(b'text', b''), (b'hello world', b'11'), (b'numpy', b'5')],
+      dtype=[('f0', 'S12'), ('f1', 'S12')])
+
+    """
+    if max_rows is not None:
+        if skip_footer:
+            raise ValueError(
+                    "The keywords 'skip_footer' and 'max_rows' can not be "
+                    "specified at the same time.")
+        if max_rows < 1:
+            raise ValueError("'max_rows' must be at least 1.")
+
+    if usemask:
+        from numpy.ma import MaskedArray, make_mask_descr
+    # Check the input dictionary of converters
+    user_converters = converters or {}
+    if not isinstance(user_converters, dict):
+        raise TypeError(
+            "The input argument 'converter' should be a valid dictionary "
+            "(got '%s' instead)" % type(user_converters))
+
+    if encoding == 'bytes':
+        encoding = None
+        byte_converters = True
+    else:
+        byte_converters = False
+
+    # Initialize the filehandle, the LineSplitter and the NameValidator
+    try:
+        if isinstance(fname, os_PathLike):
+            fname = os_fspath(fname)
+        if isinstance(fname, str):
+            fid = np.lib._datasource.open(fname, 'rt', encoding=encoding)
+            fid_ctx = contextlib.closing(fid)
+        else:
+            fid = fname
+            fid_ctx = contextlib_nullcontext(fid)
+        fhd = iter(fid)
+    except TypeError:
+        raise TypeError(
+            "fname must be a string, filehandle, list of strings, "
+            "or generator. Got %s instead." % type(fname))
+
+    with fid_ctx:
+        split_line = LineSplitter(delimiter=delimiter, comments=comments,
+                                  autostrip=autostrip, encoding=encoding)
+        validate_names = NameValidator(excludelist=excludelist,
+                                       deletechars=deletechars,
+                                       case_sensitive=case_sensitive,
+                                       replace_space=replace_space)
+
+        # Skip the first `skip_header` rows
+        try:
+            for i in range(skip_header):
+                next(fhd)
+
+            # Keep on until we find the first valid values
+            first_values = None
+
+            while not first_values:
+                first_line = _decode_line(next(fhd), encoding)
+                if (names is True) and (comments is not None):
+                    if comments in first_line:
+                        first_line = (
+                            ''.join(first_line.split(comments)[1:]))
+                first_values = split_line(first_line)
+        except StopIteration:
+            # return an empty array if the datafile is empty
+            first_line = ''
+            first_values = []
+            warnings.warn('genfromtxt: Empty input file: "%s"' % fname, stacklevel=2)
+
+        # Should we take the first values as names ?
+        if names is True:
+            fval = first_values[0].strip()
+            if comments is not None:
+                if fval in comments:
+                    del first_values[0]
+
+        # Check the columns to use: make sure `usecols` is a list
+        if usecols is not None:
+            try:
+                usecols = [_.strip() for _ in usecols.split(",")]
+            except AttributeError:
+                try:
+                    usecols = list(usecols)
+                except TypeError:
+                    usecols = [usecols, ]
+        nbcols = len(usecols or first_values)
+
+        # Check the names and overwrite the dtype.names if needed
+        if names is True:
+            names = validate_names([str(_.strip()) for _ in first_values])
+            first_line = ''
+        elif _is_string_like(names):
+            names = validate_names([_.strip() for _ in names.split(',')])
+        elif names:
+            names = validate_names(names)
+        # Get the dtype
+        if dtype is not None:
+            dtype = easy_dtype(dtype, defaultfmt=defaultfmt, names=names,
+                               excludelist=excludelist,
+                               deletechars=deletechars,
+                               case_sensitive=case_sensitive,
+                               replace_space=replace_space)
+        # Make sure the names is a list (for 2.5)
+        if names is not None:
+            names = list(names)
+
+        if usecols:
+            for (i, current) in enumerate(usecols):
+                # if usecols is a list of names, convert to a list of indices
+                if _is_string_like(current):
+                    usecols[i] = names.index(current)
+                elif current < 0:
+                    usecols[i] = current + len(first_values)
+            # If the dtype is not None, make sure we update it
+            if (dtype is not None) and (len(dtype) > nbcols):
+                descr = dtype.descr
+                dtype = np.dtype([descr[_] for _ in usecols])
+                names = list(dtype.names)
+            # If `names` is not None, update the names
+            elif (names is not None) and (len(names) > nbcols):
+                names = [names[_] for _ in usecols]
+        elif (names is not None) and (dtype is not None):
+            names = list(dtype.names)
+
+        # Process the missing values ...............................
+        # Rename missing_values for convenience
+        user_missing_values = missing_values or ()
+        if isinstance(user_missing_values, bytes):
+            user_missing_values = user_missing_values.decode('latin1')
+
+        # Define the list of missing_values (one column: one list)
+        missing_values = [list(['']) for _ in range(nbcols)]
+
+        # We have a dictionary: process it field by field
+        if isinstance(user_missing_values, dict):
+            # Loop on the items
+            for (key, val) in user_missing_values.items():
+                # Is the key a string ?
+                if _is_string_like(key):
+                    try:
+                        # Transform it into an integer
+                        key = names.index(key)
+                    except ValueError:
+                        # We couldn't find it: the name must have been dropped
+                        continue
+                # Redefine the key as needed if it's a column number
+                if usecols:
+                    try:
+                        key = usecols.index(key)
+                    except ValueError:
+                        pass
+                # Transform the value as a list of string
+                if isinstance(val, (list, tuple)):
+                    val = [str(_) for _ in val]
+                else:
+                    val = [str(val), ]
+                # Add the value(s) to the current list of missing
+                if key is None:
+                    # None acts as default
+                    for miss in missing_values:
+                        miss.extend(val)
+                else:
+                    missing_values[key].extend(val)
+        # We have a sequence : each item matches a column
+        elif isinstance(user_missing_values, (list, tuple)):
+            for (value, entry) in zip(user_missing_values, missing_values):
+                value = str(value)
+                if value not in entry:
+                    entry.append(value)
+        # We have a string : apply it to all entries
+        elif isinstance(user_missing_values, str):
+            user_value = user_missing_values.split(",")
+            for entry in missing_values:
+                entry.extend(user_value)
+        # We have something else: apply it to all entries
+        else:
+            for entry in missing_values:
+                entry.extend([str(user_missing_values)])
+
+        # Process the filling_values ...............................
+        # Rename the input for convenience
+        user_filling_values = filling_values
+        if user_filling_values is None:
+            user_filling_values = []
+        # Define the default
+        filling_values = [None] * nbcols
+        # We have a dictionary : update each entry individually
+        if isinstance(user_filling_values, dict):
+            for (key, val) in user_filling_values.items():
+                if _is_string_like(key):
+                    try:
+                        # Transform it into an integer
+                        key = names.index(key)
+                    except ValueError:
+                        # We couldn't find it: the name must have been dropped,
+                        continue
+                # Redefine the key if it's a column number and usecols is defined
+                if usecols:
+                    try:
+                        key = usecols.index(key)
+                    except ValueError:
+                        pass
+                # Add the value to the list
+                filling_values[key] = val
+        # We have a sequence : update on a one-to-one basis
+        elif isinstance(user_filling_values, (list, tuple)):
+            n = len(user_filling_values)
+            if (n <= nbcols):
+                filling_values[:n] = user_filling_values
+            else:
+                filling_values = user_filling_values[:nbcols]
+        # We have something else : use it for all entries
+        else:
+            filling_values = [user_filling_values] * nbcols
+
+        # Initialize the converters ................................
+        if dtype is None:
+            # Note: we can't use a [...]*nbcols, as we would have 3 times the same
+            # ... converter, instead of 3 different converters.
+            converters = [StringConverter(None, missing_values=miss, default=fill)
+                          for (miss, fill) in zip(missing_values, filling_values)]
+        else:
+            dtype_flat = flatten_dtype(dtype, flatten_base=True)
+            # Initialize the converters
+            if len(dtype_flat) > 1:
+                # Flexible type : get a converter from each dtype
+                zipit = zip(dtype_flat, missing_values, filling_values)
+                converters = [StringConverter(dt, locked=True,
+                                              missing_values=miss, default=fill)
+                              for (dt, miss, fill) in zipit]
+            else:
+                # Set to a default converter (but w/ different missing values)
+                zipit = zip(missing_values, filling_values)
+                converters = [StringConverter(dtype, locked=True,
+                                              missing_values=miss, default=fill)
+                              for (miss, fill) in zipit]
+        # Update the converters to use the user-defined ones
+        uc_update = []
+        for (j, conv) in user_converters.items():
+            # If the converter is specified by column names, use the index instead
+            if _is_string_like(j):
+                try:
+                    j = names.index(j)
+                    i = j
+                except ValueError:
+                    continue
+            elif usecols:
+                try:
+                    i = usecols.index(j)
+                except ValueError:
+                    # Unused converter specified
+                    continue
+            else:
+                i = j
+            # Find the value to test - first_line is not filtered by usecols:
+            if len(first_line):
+                testing_value = first_values[j]
+            else:
+                testing_value = None
+            if conv is bytes:
+                user_conv = asbytes
+            elif byte_converters:
+                # converters may use decode to workaround numpy's old behaviour,
+                # so encode the string again before passing to the user converter
+                def tobytes_first(x, conv):
+                    if type(x) is bytes:
+                        return conv(x)
+                    return conv(x.encode("latin1"))
+                user_conv = functools.partial(tobytes_first, conv=conv)
+            else:
+                user_conv = conv
+            converters[i].update(user_conv, locked=True,
+                                 testing_value=testing_value,
+                                 default=filling_values[i],
+                                 missing_values=missing_values[i],)
+            uc_update.append((i, user_conv))
+        # Make sure we have the corrected keys in user_converters...
+        user_converters.update(uc_update)
+
+        # Fixme: possible error as following variable never used.
+        # miss_chars = [_.missing_values for _ in converters]
+
+        # Initialize the output lists ...
+        # ... rows
+        rows = []
+        append_to_rows = rows.append
+        # ... masks
+        if usemask:
+            masks = []
+            append_to_masks = masks.append
+        # ... invalid
+        invalid = []
+        append_to_invalid = invalid.append
+
+        # Parse each line
+        for (i, line) in enumerate(itertools.chain([first_line, ], fhd)):
+            values = split_line(line)
+            nbvalues = len(values)
+            # Skip an empty line
+            if nbvalues == 0:
+                continue
+            if usecols:
+                # Select only the columns we need
+                try:
+                    values = [values[_] for _ in usecols]
+                except IndexError:
+                    append_to_invalid((i + skip_header + 1, nbvalues))
+                    continue
+            elif nbvalues != nbcols:
+                append_to_invalid((i + skip_header + 1, nbvalues))
+                continue
+            # Store the values
+            append_to_rows(tuple(values))
+            if usemask:
+                append_to_masks(tuple([v.strip() in m
+                                       for (v, m) in zip(values,
+                                                         missing_values)]))
+            if len(rows) == max_rows:
+                break
+
+    # Upgrade the converters (if needed)
+    if dtype is None:
+        for (i, converter) in enumerate(converters):
+            current_column = [itemgetter(i)(_m) for _m in rows]
+            try:
+                converter.iterupgrade(current_column)
+            except ConverterLockError:
+                errmsg = "Converter #%i is locked and cannot be upgraded: " % i
+                current_column = map(itemgetter(i), rows)
+                for (j, value) in enumerate(current_column):
+                    try:
+                        converter.upgrade(value)
+                    except (ConverterError, ValueError):
+                        errmsg += "(occurred line #%i for value '%s')"
+                        errmsg %= (j + 1 + skip_header, value)
+                        raise ConverterError(errmsg)
+
+    # Check that we don't have invalid values
+    nbinvalid = len(invalid)
+    if nbinvalid > 0:
+        nbrows = len(rows) + nbinvalid - skip_footer
+        # Construct the error message
+        template = "    Line #%%i (got %%i columns instead of %i)" % nbcols
+        if skip_footer > 0:
+            nbinvalid_skipped = len([_ for _ in invalid
+                                     if _[0] > nbrows + skip_header])
+            invalid = invalid[:nbinvalid - nbinvalid_skipped]
+            skip_footer -= nbinvalid_skipped
+#
+#            nbrows -= skip_footer
+#            errmsg = [template % (i, nb)
+#                      for (i, nb) in invalid if i < nbrows]
+#        else:
+        errmsg = [template % (i, nb)
+                  for (i, nb) in invalid]
+        if len(errmsg):
+            errmsg.insert(0, "Some errors were detected !")
+            errmsg = "\n".join(errmsg)
+            # Raise an exception ?
+            if invalid_raise:
+                raise ValueError(errmsg)
+            # Issue a warning ?
+            else:
+                warnings.warn(errmsg, ConversionWarning, stacklevel=2)
+
+    # Strip the last skip_footer data
+    if skip_footer > 0:
+        rows = rows[:-skip_footer]
+        if usemask:
+            masks = masks[:-skip_footer]
+
+    # Convert each value according to the converter:
+    # We want to modify the list in place to avoid creating a new one...
+    if loose:
+        rows = list(
+            zip(*[[conv._loose_call(_r) for _r in map(itemgetter(i), rows)]
+                  for (i, conv) in enumerate(converters)]))
+    else:
+        rows = list(
+            zip(*[[conv._strict_call(_r) for _r in map(itemgetter(i), rows)]
+                  for (i, conv) in enumerate(converters)]))
+
+    # Reset the dtype
+    data = rows
+    if dtype is None:
+        # Get the dtypes from the types of the converters
+        column_types = [conv.type for conv in converters]
+        # Find the columns with strings...
+        strcolidx = [i for (i, v) in enumerate(column_types)
+                     if v == np.unicode_]
+
+        if byte_converters and strcolidx:
+            # convert strings back to bytes for backward compatibility
+            warnings.warn(
+                "Reading unicode strings without specifying the encoding "
+                "argument is deprecated. Set the encoding, use None for the "
+                "system default.",
+                np.VisibleDeprecationWarning, stacklevel=2)
+            def encode_unicode_cols(row_tup):
+                row = list(row_tup)
+                for i in strcolidx:
+                    row[i] = row[i].encode('latin1')
+                return tuple(row)
+
+            try:
+                data = [encode_unicode_cols(r) for r in data]
+            except UnicodeEncodeError:
+                pass
+            else:
+                for i in strcolidx:
+                    column_types[i] = np.bytes_
+
+        # Update string types to be the right length
+        sized_column_types = column_types[:]
+        for i, col_type in enumerate(column_types):
+            if np.issubdtype(col_type, np.character):
+                n_chars = max(len(row[i]) for row in data)
+                sized_column_types[i] = (col_type, n_chars)
+
+        if names is None:
+            # If the dtype is uniform (before sizing strings)
+            base = {
+                c_type
+                for c, c_type in zip(converters, column_types)
+                if c._checked}
+            if len(base) == 1:
+                uniform_type, = base
+                (ddtype, mdtype) = (uniform_type, bool)
+            else:
+                ddtype = [(defaultfmt % i, dt)
+                          for (i, dt) in enumerate(sized_column_types)]
+                if usemask:
+                    mdtype = [(defaultfmt % i, bool)
+                              for (i, dt) in enumerate(sized_column_types)]
+        else:
+            ddtype = list(zip(names, sized_column_types))
+            mdtype = list(zip(names, [bool] * len(sized_column_types)))
+        output = np.array(data, dtype=ddtype)
+        if usemask:
+            outputmask = np.array(masks, dtype=mdtype)
+    else:
+        # Overwrite the initial dtype names if needed
+        if names and dtype.names is not None:
+            dtype.names = names
+        # Case 1. We have a structured type
+        if len(dtype_flat) > 1:
+            # Nested dtype, eg [('a', int), ('b', [('b0', int), ('b1', 'f4')])]
+            # First, create the array using a flattened dtype:
+            # [('a', int), ('b1', int), ('b2', float)]
+            # Then, view the array using the specified dtype.
+            if 'O' in (_.char for _ in dtype_flat):
+                if has_nested_fields(dtype):
+                    raise NotImplementedError(
+                        "Nested fields involving objects are not supported...")
+                else:
+                    output = np.array(data, dtype=dtype)
+            else:
+                rows = np.array(data, dtype=[('', _) for _ in dtype_flat])
+                output = rows.view(dtype)
+            # Now, process the rowmasks the same way
+            if usemask:
+                rowmasks = np.array(
+                    masks, dtype=np.dtype([('', bool) for t in dtype_flat]))
+                # Construct the new dtype
+                mdtype = make_mask_descr(dtype)
+                outputmask = rowmasks.view(mdtype)
+        # Case #2. We have a basic dtype
+        else:
+            # We used some user-defined converters
+            if user_converters:
+                ishomogeneous = True
+                descr = []
+                for i, ttype in enumerate([conv.type for conv in converters]):
+                    # Keep the dtype of the current converter
+                    if i in user_converters:
+                        ishomogeneous &= (ttype == dtype.type)
+                        if np.issubdtype(ttype, np.character):
+                            ttype = (ttype, max(len(row[i]) for row in data))
+                        descr.append(('', ttype))
+                    else:
+                        descr.append(('', dtype))
+                # So we changed the dtype ?
+                if not ishomogeneous:
+                    # We have more than one field
+                    if len(descr) > 1:
+                        dtype = np.dtype(descr)
+                    # We have only one field: drop the name if not needed.
+                    else:
+                        dtype = np.dtype(ttype)
+            #
+            output = np.array(data, dtype)
+            if usemask:
+                if dtype.names is not None:
+                    mdtype = [(_, bool) for _ in dtype.names]
+                else:
+                    mdtype = bool
+                outputmask = np.array(masks, dtype=mdtype)
+    # Try to take care of the missing data we missed
+    names = output.dtype.names
+    if usemask and names:
+        for (name, conv) in zip(names, converters):
+            missing_values = [conv(_) for _ in conv.missing_values
+                              if _ != '']
+            for mval in missing_values:
+                outputmask[name] |= (output[name] == mval)
+    # Construct the final array
+    if usemask:
+        output = output.view(MaskedArray)
+        output._mask = outputmask
+    if unpack:
+        return output.squeeze().T
+    return output.squeeze()
+
+
+def ndfromtxt(fname, **kwargs):
+    """
+    Load ASCII data stored in a file and return it as a single array.
+
+    .. deprecated:: 1.17
+        ndfromtxt` is a deprecated alias of `genfromtxt` which
+        overwrites the ``usemask`` argument with `False` even when
+        explicitly called as ``ndfromtxt(..., usemask=True)``.
+        Use `genfromtxt` instead.
+
+    Parameters
+    ----------
+    fname, kwargs : For a description of input parameters, see `genfromtxt`.
+
+    See Also
+    --------
+    numpy.genfromtxt : generic function.
+
+    """
+    kwargs['usemask'] = False
+    # Numpy 1.17
+    warnings.warn(
+        "np.ndfromtxt is a deprecated alias of np.genfromtxt, "
+        "prefer the latter.",
+        DeprecationWarning, stacklevel=2)
+    return genfromtxt(fname, **kwargs)
+
+
+def mafromtxt(fname, **kwargs):
+    """
+    Load ASCII data stored in a text file and return a masked array.
+
+    .. deprecated:: 1.17
+        np.mafromtxt is a deprecated alias of `genfromtxt` which
+        overwrites the ``usemask`` argument with `True` even when
+        explicitly called as ``mafromtxt(..., usemask=False)``.
+        Use `genfromtxt` instead.
+
+    Parameters
+    ----------
+    fname, kwargs : For a description of input parameters, see `genfromtxt`.
+
+    See Also
+    --------
+    numpy.genfromtxt : generic function to load ASCII data.
+
+    """
+    kwargs['usemask'] = True
+    # Numpy 1.17
+    warnings.warn(
+        "np.mafromtxt is a deprecated alias of np.genfromtxt, "
+        "prefer the latter.",
+        DeprecationWarning, stacklevel=2)
+    return genfromtxt(fname, **kwargs)
+
+
+def recfromtxt(fname, **kwargs):
+    """
+    Load ASCII data from a file and return it in a record array.
+
+    If ``usemask=False`` a standard `recarray` is returned,
+    if ``usemask=True`` a MaskedRecords array is returned.
+
+    Parameters
+    ----------
+    fname, kwargs : For a description of input parameters, see `genfromtxt`.
+
+    See Also
+    --------
+    numpy.genfromtxt : generic function
+
+    Notes
+    -----
+    By default, `dtype` is None, which means that the data-type of the output
+    array will be determined from the data.
+
+    """
+    kwargs.setdefault("dtype", None)
+    usemask = kwargs.get('usemask', False)
+    output = genfromtxt(fname, **kwargs)
+    if usemask:
+        from numpy.ma.mrecords import MaskedRecords
+        output = output.view(MaskedRecords)
+    else:
+        output = output.view(np.recarray)
+    return output
+
+
+def recfromcsv(fname, **kwargs):
+    """
+    Load ASCII data stored in a comma-separated file.
+
+    The returned array is a record array (if ``usemask=False``, see
+    `recarray`) or a masked record array (if ``usemask=True``,
+    see `ma.mrecords.MaskedRecords`).
+
+    Parameters
+    ----------
+    fname, kwargs : For a description of input parameters, see `genfromtxt`.
+
+    See Also
+    --------
+    numpy.genfromtxt : generic function to load ASCII data.
+
+    Notes
+    -----
+    By default, `dtype` is None, which means that the data-type of the output
+    array will be determined from the data.
+
+    """
+    # Set default kwargs for genfromtxt as relevant to csv import.
+    kwargs.setdefault("case_sensitive", "lower")
+    kwargs.setdefault("names", True)
+    kwargs.setdefault("delimiter", ",")
+    kwargs.setdefault("dtype", None)
+    output = genfromtxt(fname, **kwargs)
+
+    usemask = kwargs.get("usemask", False)
+    if usemask:
+        from numpy.ma.mrecords import MaskedRecords
+        output = output.view(MaskedRecords)
+    else:
+        output = output.view(np.recarray)
+    return output
diff --git a/venv/Lib/site-packages/numpy/lib/polynomial.py b/venv/Lib/site-packages/numpy/lib/polynomial.py
new file mode 100644
index 000000000..5a0fa5431
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/polynomial.py
@@ -0,0 +1,1377 @@
+"""
+Functions to operate on polynomials.
+
+"""
+__all__ = ['poly', 'roots', 'polyint', 'polyder', 'polyadd',
+           'polysub', 'polymul', 'polydiv', 'polyval', 'poly1d',
+           'polyfit', 'RankWarning']
+
+import functools
+import re
+import warnings
+import numpy.core.numeric as NX
+
+from numpy.core import (isscalar, abs, finfo, atleast_1d, hstack, dot, array,
+                        ones)
+from numpy.core import overrides
+from numpy.core.overrides import set_module
+from numpy.lib.twodim_base import diag, vander
+from numpy.lib.function_base import trim_zeros
+from numpy.lib.type_check import iscomplex, real, imag, mintypecode
+from numpy.linalg import eigvals, lstsq, inv
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+@set_module('numpy')
+class RankWarning(UserWarning):
+    """
+    Issued by `polyfit` when the Vandermonde matrix is rank deficient.
+
+    For more information, a way to suppress the warning, and an example of
+    `RankWarning` being issued, see `polyfit`.
+
+    """
+    pass
+
+
+def _poly_dispatcher(seq_of_zeros):
+    return seq_of_zeros
+
+
+@array_function_dispatch(_poly_dispatcher)
+def poly(seq_of_zeros):
+    """
+    Find the coefficients of a polynomial with the given sequence of roots.
+
+    Returns the coefficients of the polynomial whose leading coefficient
+    is one for the given sequence of zeros (multiple roots must be included
+    in the sequence as many times as their multiplicity; see Examples).
+    A square matrix (or array, which will be treated as a matrix) can also
+    be given, in which case the coefficients of the characteristic polynomial
+    of the matrix are returned.
+
+    Parameters
+    ----------
+    seq_of_zeros : array_like, shape (N,) or (N, N)
+        A sequence of polynomial roots, or a square array or matrix object.
+
+    Returns
+    -------
+    c : ndarray
+        1D array of polynomial coefficients from highest to lowest degree:
+
+        ``c[0] * x**(N) + c[1] * x**(N-1) + ... + c[N-1] * x + c[N]``
+        where c[0] always equals 1.
+
+    Raises
+    ------
+    ValueError
+        If input is the wrong shape (the input must be a 1-D or square
+        2-D array).
+
+    See Also
+    --------
+    polyval : Compute polynomial values.
+    roots : Return the roots of a polynomial.
+    polyfit : Least squares polynomial fit.
+    poly1d : A one-dimensional polynomial class.
+
+    Notes
+    -----
+    Specifying the roots of a polynomial still leaves one degree of
+    freedom, typically represented by an undetermined leading
+    coefficient. [1]_ In the case of this function, that coefficient -
+    the first one in the returned array - is always taken as one. (If
+    for some reason you have one other point, the only automatic way
+    presently to leverage that information is to use ``polyfit``.)
+
+    The characteristic polynomial, :math:`p_a(t)`, of an `n`-by-`n`
+    matrix **A** is given by
+
+        :math:`p_a(t) = \\mathrm{det}(t\\, \\mathbf{I} - \\mathbf{A})`,
+
+    where **I** is the `n`-by-`n` identity matrix. [2]_
+
+    References
+    ----------
+    .. [1] M. Sullivan and M. Sullivan, III, "Algebra and Trignometry,
+       Enhanced With Graphing Utilities," Prentice-Hall, pg. 318, 1996.
+
+    .. [2] G. Strang, "Linear Algebra and Its Applications, 2nd Edition,"
+       Academic Press, pg. 182, 1980.
+
+    Examples
+    --------
+    Given a sequence of a polynomial's zeros:
+
+    >>> np.poly((0, 0, 0)) # Multiple root example
+    array([1., 0., 0., 0.])
+
+    The line above represents z**3 + 0*z**2 + 0*z + 0.
+
+    >>> np.poly((-1./2, 0, 1./2))
+    array([ 1.  ,  0.  , -0.25,  0.  ])
+
+    The line above represents z**3 - z/4
+
+    >>> np.poly((np.random.random(1)[0], 0, np.random.random(1)[0]))
+    array([ 1.        , -0.77086955,  0.08618131,  0.        ]) # random
+
+    Given a square array object:
+
+    >>> P = np.array([[0, 1./3], [-1./2, 0]])
+    >>> np.poly(P)
+    array([1.        , 0.        , 0.16666667])
+
+    Note how in all cases the leading coefficient is always 1.
+
+    """
+    seq_of_zeros = atleast_1d(seq_of_zeros)
+    sh = seq_of_zeros.shape
+
+    if len(sh) == 2 and sh[0] == sh[1] and sh[0] != 0:
+        seq_of_zeros = eigvals(seq_of_zeros)
+    elif len(sh) == 1:
+        dt = seq_of_zeros.dtype
+        # Let object arrays slip through, e.g. for arbitrary precision
+        if dt != object:
+            seq_of_zeros = seq_of_zeros.astype(mintypecode(dt.char))
+    else:
+        raise ValueError("input must be 1d or non-empty square 2d array.")
+
+    if len(seq_of_zeros) == 0:
+        return 1.0
+    dt = seq_of_zeros.dtype
+    a = ones((1,), dtype=dt)
+    for k in range(len(seq_of_zeros)):
+        a = NX.convolve(a, array([1, -seq_of_zeros[k]], dtype=dt),
+                        mode='full')
+
+    if issubclass(a.dtype.type, NX.complexfloating):
+        # if complex roots are all complex conjugates, the roots are real.
+        roots = NX.asarray(seq_of_zeros, complex)
+        if NX.all(NX.sort(roots) == NX.sort(roots.conjugate())):
+            a = a.real.copy()
+
+    return a
+
+
+def _roots_dispatcher(p):
+    return p
+
+
+@array_function_dispatch(_roots_dispatcher)
+def roots(p):
+    """
+    Return the roots of a polynomial with coefficients given in p.
+
+    The values in the rank-1 array `p` are coefficients of a polynomial.
+    If the length of `p` is n+1 then the polynomial is described by::
+
+      p[0] * x**n + p[1] * x**(n-1) + ... + p[n-1]*x + p[n]
+
+    Parameters
+    ----------
+    p : array_like
+        Rank-1 array of polynomial coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        An array containing the roots of the polynomial.
+
+    Raises
+    ------
+    ValueError
+        When `p` cannot be converted to a rank-1 array.
+
+    See also
+    --------
+    poly : Find the coefficients of a polynomial with a given sequence
+           of roots.
+    polyval : Compute polynomial values.
+    polyfit : Least squares polynomial fit.
+    poly1d : A one-dimensional polynomial class.
+
+    Notes
+    -----
+    The algorithm relies on computing the eigenvalues of the
+    companion matrix [1]_.
+
+    References
+    ----------
+    .. [1] R. A. Horn & C. R. Johnson, *Matrix Analysis*.  Cambridge, UK:
+        Cambridge University Press, 1999, pp. 146-7.
+
+    Examples
+    --------
+    >>> coeff = [3.2, 2, 1]
+    >>> np.roots(coeff)
+    array([-0.3125+0.46351241j, -0.3125-0.46351241j])
+
+    """
+    # If input is scalar, this makes it an array
+    p = atleast_1d(p)
+    if p.ndim != 1:
+        raise ValueError("Input must be a rank-1 array.")
+
+    # find non-zero array entries
+    non_zero = NX.nonzero(NX.ravel(p))[0]
+
+    # Return an empty array if polynomial is all zeros
+    if len(non_zero) == 0:
+        return NX.array([])
+
+    # find the number of trailing zeros -- this is the number of roots at 0.
+    trailing_zeros = len(p) - non_zero[-1] - 1
+
+    # strip leading and trailing zeros
+    p = p[int(non_zero[0]):int(non_zero[-1])+1]
+
+    # casting: if incoming array isn't floating point, make it floating point.
+    if not issubclass(p.dtype.type, (NX.floating, NX.complexfloating)):
+        p = p.astype(float)
+
+    N = len(p)
+    if N > 1:
+        # build companion matrix and find its eigenvalues (the roots)
+        A = diag(NX.ones((N-2,), p.dtype), -1)
+        A[0,:] = -p[1:] / p[0]
+        roots = eigvals(A)
+    else:
+        roots = NX.array([])
+
+    # tack any zeros onto the back of the array
+    roots = hstack((roots, NX.zeros(trailing_zeros, roots.dtype)))
+    return roots
+
+
+def _polyint_dispatcher(p, m=None, k=None):
+    return (p,)
+
+
+@array_function_dispatch(_polyint_dispatcher)
+def polyint(p, m=1, k=None):
+    """
+    Return an antiderivative (indefinite integral) of a polynomial.
+
+    The returned order `m` antiderivative `P` of polynomial `p` satisfies
+    :math:`\\frac{d^m}{dx^m}P(x) = p(x)` and is defined up to `m - 1`
+    integration constants `k`. The constants determine the low-order
+    polynomial part
+
+    .. math:: \\frac{k_{m-1}}{0!} x^0 + \\ldots + \\frac{k_0}{(m-1)!}x^{m-1}
+
+    of `P` so that :math:`P^{(j)}(0) = k_{m-j-1}`.
+
+    Parameters
+    ----------
+    p : array_like or poly1d
+        Polynomial to integrate.
+        A sequence is interpreted as polynomial coefficients, see `poly1d`.
+    m : int, optional
+        Order of the antiderivative. (Default: 1)
+    k : list of `m` scalars or scalar, optional
+        Integration constants. They are given in the order of integration:
+        those corresponding to highest-order terms come first.
+
+        If ``None`` (default), all constants are assumed to be zero.
+        If `m = 1`, a single scalar can be given instead of a list.
+
+    See Also
+    --------
+    polyder : derivative of a polynomial
+    poly1d.integ : equivalent method
+
+    Examples
+    --------
+    The defining property of the antiderivative:
+
+    >>> p = np.poly1d([1,1,1])
+    >>> P = np.polyint(p)
+    >>> P
+     poly1d([ 0.33333333,  0.5       ,  1.        ,  0.        ]) # may vary
+    >>> np.polyder(P) == p
+    True
+
+    The integration constants default to zero, but can be specified:
+
+    >>> P = np.polyint(p, 3)
+    >>> P(0)
+    0.0
+    >>> np.polyder(P)(0)
+    0.0
+    >>> np.polyder(P, 2)(0)
+    0.0
+    >>> P = np.polyint(p, 3, k=[6,5,3])
+    >>> P
+    poly1d([ 0.01666667,  0.04166667,  0.16666667,  3. ,  5. ,  3. ]) # may vary
+
+    Note that 3 = 6 / 2!, and that the constants are given in the order of
+    integrations. Constant of the highest-order polynomial term comes first:
+
+    >>> np.polyder(P, 2)(0)
+    6.0
+    >>> np.polyder(P, 1)(0)
+    5.0
+    >>> P(0)
+    3.0
+
+    """
+    m = int(m)
+    if m < 0:
+        raise ValueError("Order of integral must be positive (see polyder)")
+    if k is None:
+        k = NX.zeros(m, float)
+    k = atleast_1d(k)
+    if len(k) == 1 and m > 1:
+        k = k[0]*NX.ones(m, float)
+    if len(k) < m:
+        raise ValueError(
+              "k must be a scalar or a rank-1 array of length 1 or >m.")
+
+    truepoly = isinstance(p, poly1d)
+    p = NX.asarray(p)
+    if m == 0:
+        if truepoly:
+            return poly1d(p)
+        return p
+    else:
+        # Note: this must work also with object and integer arrays
+        y = NX.concatenate((p.__truediv__(NX.arange(len(p), 0, -1)), [k[0]]))
+        val = polyint(y, m - 1, k=k[1:])
+        if truepoly:
+            return poly1d(val)
+        return val
+
+
+def _polyder_dispatcher(p, m=None):
+    return (p,)
+
+
+@array_function_dispatch(_polyder_dispatcher)
+def polyder(p, m=1):
+    """
+    Return the derivative of the specified order of a polynomial.
+
+    Parameters
+    ----------
+    p : poly1d or sequence
+        Polynomial to differentiate.
+        A sequence is interpreted as polynomial coefficients, see `poly1d`.
+    m : int, optional
+        Order of differentiation (default: 1)
+
+    Returns
+    -------
+    der : poly1d
+        A new polynomial representing the derivative.
+
+    See Also
+    --------
+    polyint : Anti-derivative of a polynomial.
+    poly1d : Class for one-dimensional polynomials.
+
+    Examples
+    --------
+    The derivative of the polynomial :math:`x^3 + x^2 + x^1 + 1` is:
+
+    >>> p = np.poly1d([1,1,1,1])
+    >>> p2 = np.polyder(p)
+    >>> p2
+    poly1d([3, 2, 1])
+
+    which evaluates to:
+
+    >>> p2(2.)
+    17.0
+
+    We can verify this, approximating the derivative with
+    ``(f(x + h) - f(x))/h``:
+
+    >>> (p(2. + 0.001) - p(2.)) / 0.001
+    17.007000999997857
+
+    The fourth-order derivative of a 3rd-order polynomial is zero:
+
+    >>> np.polyder(p, 2)
+    poly1d([6, 2])
+    >>> np.polyder(p, 3)
+    poly1d([6])
+    >>> np.polyder(p, 4)
+    poly1d([0.])
+
+    """
+    m = int(m)
+    if m < 0:
+        raise ValueError("Order of derivative must be positive (see polyint)")
+
+    truepoly = isinstance(p, poly1d)
+    p = NX.asarray(p)
+    n = len(p) - 1
+    y = p[:-1] * NX.arange(n, 0, -1)
+    if m == 0:
+        val = p
+    else:
+        val = polyder(y, m - 1)
+    if truepoly:
+        val = poly1d(val)
+    return val
+
+
+def _polyfit_dispatcher(x, y, deg, rcond=None, full=None, w=None, cov=None):
+    return (x, y, w)
+
+
+@array_function_dispatch(_polyfit_dispatcher)
+def polyfit(x, y, deg, rcond=None, full=False, w=None, cov=False):
+    """
+    Least squares polynomial fit.
+
+    Fit a polynomial ``p(x) = p[0] * x**deg + ... + p[deg]`` of degree `deg`
+    to points `(x, y)`. Returns a vector of coefficients `p` that minimises
+    the squared error in the order `deg`, `deg-1`, ... `0`.
+
+    The `Polynomial.fit <numpy.polynomial.polynomial.Polynomial.fit>` class
+    method is recommended for new code as it is more stable numerically. See
+    the documentation of the method for more information.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int
+        Degree of the fitting polynomial
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (M,), optional
+        Weights to apply to the y-coordinates of the sample points. For
+        gaussian uncertainties, use 1/sigma (not 1/sigma**2).
+    cov : bool or str, optional
+        If given and not `False`, return not just the estimate but also its
+        covariance matrix. By default, the covariance are scaled by
+        chi2/sqrt(N-dof), i.e., the weights are presumed to be unreliable
+        except in a relative sense and everything is scaled such that the
+        reduced chi2 is unity. This scaling is omitted if ``cov='unscaled'``,
+        as is relevant for the case that the weights are 1/sigma**2, with
+        sigma known to be a reliable estimate of the uncertainty.
+
+    Returns
+    -------
+    p : ndarray, shape (deg + 1,) or (deg + 1, K)
+        Polynomial coefficients, highest power first.  If `y` was 2-D, the
+        coefficients for `k`-th data set are in ``p[:,k]``.
+
+    residuals, rank, singular_values, rcond
+        Present only if `full` = True.  Residuals is sum of squared residuals
+        of the least-squares fit, the effective rank of the scaled Vandermonde
+        coefficient matrix, its singular values, and the specified value of
+        `rcond`. For more details, see `linalg.lstsq`.
+
+    V : ndarray, shape (M,M) or (M,M,K)
+        Present only if `full` = False and `cov`=True.  The covariance
+        matrix of the polynomial coefficient estimates.  The diagonal of
+        this matrix are the variance estimates for each coefficient.  If y
+        is a 2-D array, then the covariance matrix for the `k`-th data set
+        are in ``V[:,:,k]``
+
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.
+
+        The warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    polyval : Compute polynomial values.
+    linalg.lstsq : Computes a least-squares fit.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution minimizes the squared error
+
+    .. math ::
+        E = \\sum_{j=0}^k |p(x_j) - y_j|^2
+
+    in the equations::
+
+        x[0]**n * p[0] + ... + x[0] * p[n-1] + p[n] = y[0]
+        x[1]**n * p[0] + ... + x[1] * p[n-1] + p[n] = y[1]
+        ...
+        x[k]**n * p[0] + ... + x[k] * p[n-1] + p[n] = y[k]
+
+    The coefficient matrix of the coefficients `p` is a Vandermonde matrix.
+
+    `polyfit` issues a `RankWarning` when the least-squares fit is badly
+    conditioned. This implies that the best fit is not well-defined due
+    to numerical error. The results may be improved by lowering the polynomial
+    degree or by replacing `x` by `x` - `x`.mean(). The `rcond` parameter
+    can also be set to a value smaller than its default, but the resulting
+    fit may be spurious: including contributions from the small singular
+    values can add numerical noise to the result.
+
+    Note that fitting polynomial coefficients is inherently badly conditioned
+    when the degree of the polynomial is large or the interval of sample points
+    is badly centered. The quality of the fit should always be checked in these
+    cases. When polynomial fits are not satisfactory, splines may be a good
+    alternative.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+    .. [2] Wikipedia, "Polynomial interpolation",
+           https://en.wikipedia.org/wiki/Polynomial_interpolation
+
+    Examples
+    --------
+    >>> import warnings
+    >>> x = np.array([0.0, 1.0, 2.0, 3.0,  4.0,  5.0])
+    >>> y = np.array([0.0, 0.8, 0.9, 0.1, -0.8, -1.0])
+    >>> z = np.polyfit(x, y, 3)
+    >>> z
+    array([ 0.08703704, -0.81349206,  1.69312169, -0.03968254]) # may vary
+
+    It is convenient to use `poly1d` objects for dealing with polynomials:
+
+    >>> p = np.poly1d(z)
+    >>> p(0.5)
+    0.6143849206349179 # may vary
+    >>> p(3.5)
+    -0.34732142857143039 # may vary
+    >>> p(10)
+    22.579365079365115 # may vary
+
+    High-order polynomials may oscillate wildly:
+
+    >>> with warnings.catch_warnings():
+    ...     warnings.simplefilter('ignore', np.RankWarning)
+    ...     p30 = np.poly1d(np.polyfit(x, y, 30))
+    ...
+    >>> p30(4)
+    -0.80000000000000204 # may vary
+    >>> p30(5)
+    -0.99999999999999445 # may vary
+    >>> p30(4.5)
+    -0.10547061179440398 # may vary
+
+    Illustration:
+
+    >>> import matplotlib.pyplot as plt
+    >>> xp = np.linspace(-2, 6, 100)
+    >>> _ = plt.plot(x, y, '.', xp, p(xp), '-', xp, p30(xp), '--')
+    >>> plt.ylim(-2,2)
+    (-2, 2)
+    >>> plt.show()
+
+    """
+    order = int(deg) + 1
+    x = NX.asarray(x) + 0.0
+    y = NX.asarray(y) + 0.0
+
+    # check arguments.
+    if deg < 0:
+        raise ValueError("expected deg >= 0")
+    if x.ndim != 1:
+        raise TypeError("expected 1D vector for x")
+    if x.size == 0:
+        raise TypeError("expected non-empty vector for x")
+    if y.ndim < 1 or y.ndim > 2:
+        raise TypeError("expected 1D or 2D array for y")
+    if x.shape[0] != y.shape[0]:
+        raise TypeError("expected x and y to have same length")
+
+    # set rcond
+    if rcond is None:
+        rcond = len(x)*finfo(x.dtype).eps
+
+    # set up least squares equation for powers of x
+    lhs = vander(x, order)
+    rhs = y
+
+    # apply weighting
+    if w is not None:
+        w = NX.asarray(w) + 0.0
+        if w.ndim != 1:
+            raise TypeError("expected a 1-d array for weights")
+        if w.shape[0] != y.shape[0]:
+            raise TypeError("expected w and y to have the same length")
+        lhs *= w[:, NX.newaxis]
+        if rhs.ndim == 2:
+            rhs *= w[:, NX.newaxis]
+        else:
+            rhs *= w
+
+    # scale lhs to improve condition number and solve
+    scale = NX.sqrt((lhs*lhs).sum(axis=0))
+    lhs /= scale
+    c, resids, rank, s = lstsq(lhs, rhs, rcond)
+    c = (c.T/scale).T  # broadcast scale coefficients
+
+    # warn on rank reduction, which indicates an ill conditioned matrix
+    if rank != order and not full:
+        msg = "Polyfit may be poorly conditioned"
+        warnings.warn(msg, RankWarning, stacklevel=4)
+
+    if full:
+        return c, resids, rank, s, rcond
+    elif cov:
+        Vbase = inv(dot(lhs.T, lhs))
+        Vbase /= NX.outer(scale, scale)
+        if cov == "unscaled":
+            fac = 1
+        else:
+            if len(x) <= order:
+                raise ValueError("the number of data points must exceed order "
+                                 "to scale the covariance matrix")
+            # note, this used to be: fac = resids / (len(x) - order - 2.0)
+            # it was deciced that the "- 2" (originally justified by "Bayesian
+            # uncertainty analysis") is not was the user expects
+            # (see gh-11196 and gh-11197)
+            fac = resids / (len(x) - order)
+        if y.ndim == 1:
+            return c, Vbase * fac
+        else:
+            return c, Vbase[:,:, NX.newaxis] * fac
+    else:
+        return c
+
+
+def _polyval_dispatcher(p, x):
+    return (p, x)
+
+
+@array_function_dispatch(_polyval_dispatcher)
+def polyval(p, x):
+    """
+    Evaluate a polynomial at specific values.
+
+    If `p` is of length N, this function returns the value:
+
+        ``p[0]*x**(N-1) + p[1]*x**(N-2) + ... + p[N-2]*x + p[N-1]``
+
+    If `x` is a sequence, then `p(x)` is returned for each element of `x`.
+    If `x` is another polynomial then the composite polynomial `p(x(t))`
+    is returned.
+
+    Parameters
+    ----------
+    p : array_like or poly1d object
+       1D array of polynomial coefficients (including coefficients equal
+       to zero) from highest degree to the constant term, or an
+       instance of poly1d.
+    x : array_like or poly1d object
+       A number, an array of numbers, or an instance of poly1d, at
+       which to evaluate `p`.
+
+    Returns
+    -------
+    values : ndarray or poly1d
+       If `x` is a poly1d instance, the result is the composition of the two
+       polynomials, i.e., `x` is "substituted" in `p` and the simplified
+       result is returned. In addition, the type of `x` - array_like or
+       poly1d - governs the type of the output: `x` array_like => `values`
+       array_like, `x` a poly1d object => `values` is also.
+
+    See Also
+    --------
+    poly1d: A polynomial class.
+
+    Notes
+    -----
+    Horner's scheme [1]_ is used to evaluate the polynomial. Even so,
+    for polynomials of high degree the values may be inaccurate due to
+    rounding errors. Use carefully.
+
+    If `x` is a subtype of `ndarray` the return value will be of the same type.
+
+    References
+    ----------
+    .. [1] I. N. Bronshtein, K. A. Semendyayev, and K. A. Hirsch (Eng.
+       trans. Ed.), *Handbook of Mathematics*, New York, Van Nostrand
+       Reinhold Co., 1985, pg. 720.
+
+    Examples
+    --------
+    >>> np.polyval([3,0,1], 5)  # 3 * 5**2 + 0 * 5**1 + 1
+    76
+    >>> np.polyval([3,0,1], np.poly1d(5))
+    poly1d([76.])
+    >>> np.polyval(np.poly1d([3,0,1]), 5)
+    76
+    >>> np.polyval(np.poly1d([3,0,1]), np.poly1d(5))
+    poly1d([76.])
+
+    """
+    p = NX.asarray(p)
+    if isinstance(x, poly1d):
+        y = 0
+    else:
+        x = NX.asanyarray(x)
+        y = NX.zeros_like(x)
+    for i in range(len(p)):
+        y = y * x + p[i]
+    return y
+
+
+def _binary_op_dispatcher(a1, a2):
+    return (a1, a2)
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def polyadd(a1, a2):
+    """
+    Find the sum of two polynomials.
+
+    Returns the polynomial resulting from the sum of two input polynomials.
+    Each input must be either a poly1d object or a 1D sequence of polynomial
+    coefficients, from highest to lowest degree.
+
+    Parameters
+    ----------
+    a1, a2 : array_like or poly1d object
+        Input polynomials.
+
+    Returns
+    -------
+    out : ndarray or poly1d object
+        The sum of the inputs. If either input is a poly1d object, then the
+        output is also a poly1d object. Otherwise, it is a 1D array of
+        polynomial coefficients from highest to lowest degree.
+
+    See Also
+    --------
+    poly1d : A one-dimensional polynomial class.
+    poly, polyadd, polyder, polydiv, polyfit, polyint, polysub, polyval
+
+    Examples
+    --------
+    >>> np.polyadd([1, 2], [9, 5, 4])
+    array([9, 6, 6])
+
+    Using poly1d objects:
+
+    >>> p1 = np.poly1d([1, 2])
+    >>> p2 = np.poly1d([9, 5, 4])
+    >>> print(p1)
+    1 x + 2
+    >>> print(p2)
+       2
+    9 x + 5 x + 4
+    >>> print(np.polyadd(p1, p2))
+       2
+    9 x + 6 x + 6
+
+    """
+    truepoly = (isinstance(a1, poly1d) or isinstance(a2, poly1d))
+    a1 = atleast_1d(a1)
+    a2 = atleast_1d(a2)
+    diff = len(a2) - len(a1)
+    if diff == 0:
+        val = a1 + a2
+    elif diff > 0:
+        zr = NX.zeros(diff, a1.dtype)
+        val = NX.concatenate((zr, a1)) + a2
+    else:
+        zr = NX.zeros(abs(diff), a2.dtype)
+        val = a1 + NX.concatenate((zr, a2))
+    if truepoly:
+        val = poly1d(val)
+    return val
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def polysub(a1, a2):
+    """
+    Difference (subtraction) of two polynomials.
+
+    Given two polynomials `a1` and `a2`, returns ``a1 - a2``.
+    `a1` and `a2` can be either array_like sequences of the polynomials'
+    coefficients (including coefficients equal to zero), or `poly1d` objects.
+
+    Parameters
+    ----------
+    a1, a2 : array_like or poly1d
+        Minuend and subtrahend polynomials, respectively.
+
+    Returns
+    -------
+    out : ndarray or poly1d
+        Array or `poly1d` object of the difference polynomial's coefficients.
+
+    See Also
+    --------
+    polyval, polydiv, polymul, polyadd
+
+    Examples
+    --------
+    .. math:: (2 x^2 + 10 x - 2) - (3 x^2 + 10 x -4) = (-x^2 + 2)
+
+    >>> np.polysub([2, 10, -2], [3, 10, -4])
+    array([-1,  0,  2])
+
+    """
+    truepoly = (isinstance(a1, poly1d) or isinstance(a2, poly1d))
+    a1 = atleast_1d(a1)
+    a2 = atleast_1d(a2)
+    diff = len(a2) - len(a1)
+    if diff == 0:
+        val = a1 - a2
+    elif diff > 0:
+        zr = NX.zeros(diff, a1.dtype)
+        val = NX.concatenate((zr, a1)) - a2
+    else:
+        zr = NX.zeros(abs(diff), a2.dtype)
+        val = a1 - NX.concatenate((zr, a2))
+    if truepoly:
+        val = poly1d(val)
+    return val
+
+
+@array_function_dispatch(_binary_op_dispatcher)
+def polymul(a1, a2):
+    """
+    Find the product of two polynomials.
+
+    Finds the polynomial resulting from the multiplication of the two input
+    polynomials. Each input must be either a poly1d object or a 1D sequence
+    of polynomial coefficients, from highest to lowest degree.
+
+    Parameters
+    ----------
+    a1, a2 : array_like or poly1d object
+        Input polynomials.
+
+    Returns
+    -------
+    out : ndarray or poly1d object
+        The polynomial resulting from the multiplication of the inputs. If
+        either inputs is a poly1d object, then the output is also a poly1d
+        object. Otherwise, it is a 1D array of polynomial coefficients from
+        highest to lowest degree.
+
+    See Also
+    --------
+    poly1d : A one-dimensional polynomial class.
+    poly, polyadd, polyder, polydiv, polyfit, polyint, polysub, polyval
+    convolve : Array convolution. Same output as polymul, but has parameter
+               for overlap mode.
+
+    Examples
+    --------
+    >>> np.polymul([1, 2, 3], [9, 5, 1])
+    array([ 9, 23, 38, 17,  3])
+
+    Using poly1d objects:
+
+    >>> p1 = np.poly1d([1, 2, 3])
+    >>> p2 = np.poly1d([9, 5, 1])
+    >>> print(p1)
+       2
+    1 x + 2 x + 3
+    >>> print(p2)
+       2
+    9 x + 5 x + 1
+    >>> print(np.polymul(p1, p2))
+       4      3      2
+    9 x + 23 x + 38 x + 17 x + 3
+
+    """
+    truepoly = (isinstance(a1, poly1d) or isinstance(a2, poly1d))
+    a1, a2 = poly1d(a1), poly1d(a2)
+    val = NX.convolve(a1, a2)
+    if truepoly:
+        val = poly1d(val)
+    return val
+
+
+def _polydiv_dispatcher(u, v):
+    return (u, v)
+
+
+@array_function_dispatch(_polydiv_dispatcher)
+def polydiv(u, v):
+    """
+    Returns the quotient and remainder of polynomial division.
+
+    The input arrays are the coefficients (including any coefficients
+    equal to zero) of the "numerator" (dividend) and "denominator"
+    (divisor) polynomials, respectively.
+
+    Parameters
+    ----------
+    u : array_like or poly1d
+        Dividend polynomial's coefficients.
+
+    v : array_like or poly1d
+        Divisor polynomial's coefficients.
+
+    Returns
+    -------
+    q : ndarray
+        Coefficients, including those equal to zero, of the quotient.
+    r : ndarray
+        Coefficients, including those equal to zero, of the remainder.
+
+    See Also
+    --------
+    poly, polyadd, polyder, polydiv, polyfit, polyint, polymul, polysub
+    polyval
+
+    Notes
+    -----
+    Both `u` and `v` must be 0-d or 1-d (ndim = 0 or 1), but `u.ndim` need
+    not equal `v.ndim`. In other words, all four possible combinations -
+    ``u.ndim = v.ndim = 0``, ``u.ndim = v.ndim = 1``,
+    ``u.ndim = 1, v.ndim = 0``, and ``u.ndim = 0, v.ndim = 1`` - work.
+
+    Examples
+    --------
+    .. math:: \\frac{3x^2 + 5x + 2}{2x + 1} = 1.5x + 1.75, remainder 0.25
+
+    >>> x = np.array([3.0, 5.0, 2.0])
+    >>> y = np.array([2.0, 1.0])
+    >>> np.polydiv(x, y)
+    (array([1.5 , 1.75]), array([0.25]))
+
+    """
+    truepoly = (isinstance(u, poly1d) or isinstance(u, poly1d))
+    u = atleast_1d(u) + 0.0
+    v = atleast_1d(v) + 0.0
+    # w has the common type
+    w = u[0] + v[0]
+    m = len(u) - 1
+    n = len(v) - 1
+    scale = 1. / v[0]
+    q = NX.zeros((max(m - n + 1, 1),), w.dtype)
+    r = u.astype(w.dtype)
+    for k in range(0, m-n+1):
+        d = scale * r[k]
+        q[k] = d
+        r[k:k+n+1] -= d*v
+    while NX.allclose(r[0], 0, rtol=1e-14) and (r.shape[-1] > 1):
+        r = r[1:]
+    if truepoly:
+        return poly1d(q), poly1d(r)
+    return q, r
+
+_poly_mat = re.compile(r"[*][*]([0-9]*)")
+def _raise_power(astr, wrap=70):
+    n = 0
+    line1 = ''
+    line2 = ''
+    output = ' '
+    while True:
+        mat = _poly_mat.search(astr, n)
+        if mat is None:
+            break
+        span = mat.span()
+        power = mat.groups()[0]
+        partstr = astr[n:span[0]]
+        n = span[1]
+        toadd2 = partstr + ' '*(len(power)-1)
+        toadd1 = ' '*(len(partstr)-1) + power
+        if ((len(line2) + len(toadd2) > wrap) or
+                (len(line1) + len(toadd1) > wrap)):
+            output += line1 + "\n" + line2 + "\n "
+            line1 = toadd1
+            line2 = toadd2
+        else:
+            line2 += partstr + ' '*(len(power)-1)
+            line1 += ' '*(len(partstr)-1) + power
+    output += line1 + "\n" + line2
+    return output + astr[n:]
+
+
+@set_module('numpy')
+class poly1d:
+    """
+    A one-dimensional polynomial class.
+
+    A convenience class, used to encapsulate "natural" operations on
+    polynomials so that said operations may take on their customary
+    form in code (see Examples).
+
+    Parameters
+    ----------
+    c_or_r : array_like
+        The polynomial's coefficients, in decreasing powers, or if
+        the value of the second parameter is True, the polynomial's
+        roots (values where the polynomial evaluates to 0).  For example,
+        ``poly1d([1, 2, 3])`` returns an object that represents
+        :math:`x^2 + 2x + 3`, whereas ``poly1d([1, 2, 3], True)`` returns
+        one that represents :math:`(x-1)(x-2)(x-3) = x^3 - 6x^2 + 11x -6`.
+    r : bool, optional
+        If True, `c_or_r` specifies the polynomial's roots; the default
+        is False.
+    variable : str, optional
+        Changes the variable used when printing `p` from `x` to `variable`
+        (see Examples).
+
+    Examples
+    --------
+    Construct the polynomial :math:`x^2 + 2x + 3`:
+
+    >>> p = np.poly1d([1, 2, 3])
+    >>> print(np.poly1d(p))
+       2
+    1 x + 2 x + 3
+
+    Evaluate the polynomial at :math:`x = 0.5`:
+
+    >>> p(0.5)
+    4.25
+
+    Find the roots:
+
+    >>> p.r
+    array([-1.+1.41421356j, -1.-1.41421356j])
+    >>> p(p.r)
+    array([ -4.44089210e-16+0.j,  -4.44089210e-16+0.j]) # may vary
+
+    These numbers in the previous line represent (0, 0) to machine precision
+
+    Show the coefficients:
+
+    >>> p.c
+    array([1, 2, 3])
+
+    Display the order (the leading zero-coefficients are removed):
+
+    >>> p.order
+    2
+
+    Show the coefficient of the k-th power in the polynomial
+    (which is equivalent to ``p.c[-(i+1)]``):
+
+    >>> p[1]
+    2
+
+    Polynomials can be added, subtracted, multiplied, and divided
+    (returns quotient and remainder):
+
+    >>> p * p
+    poly1d([ 1,  4, 10, 12,  9])
+
+    >>> (p**3 + 4) / p
+    (poly1d([ 1.,  4., 10., 12.,  9.]), poly1d([4.]))
+
+    ``asarray(p)`` gives the coefficient array, so polynomials can be
+    used in all functions that accept arrays:
+
+    >>> p**2 # square of polynomial
+    poly1d([ 1,  4, 10, 12,  9])
+
+    >>> np.square(p) # square of individual coefficients
+    array([1, 4, 9])
+
+    The variable used in the string representation of `p` can be modified,
+    using the `variable` parameter:
+
+    >>> p = np.poly1d([1,2,3], variable='z')
+    >>> print(p)
+       2
+    1 z + 2 z + 3
+
+    Construct a polynomial from its roots:
+
+    >>> np.poly1d([1, 2], True)
+    poly1d([ 1., -3.,  2.])
+
+    This is the same polynomial as obtained by:
+
+    >>> np.poly1d([1, -1]) * np.poly1d([1, -2])
+    poly1d([ 1, -3,  2])
+
+    """
+    __hash__ = None
+
+    @property
+    def coeffs(self):
+        """ The polynomial coefficients """
+        return self._coeffs
+
+    @coeffs.setter
+    def coeffs(self, value):
+        # allowing this makes p.coeffs *= 2 legal
+        if value is not self._coeffs:
+            raise AttributeError("Cannot set attribute")
+
+    @property
+    def variable(self):
+        """ The name of the polynomial variable """
+        return self._variable
+
+    # calculated attributes
+    @property
+    def order(self):
+        """ The order or degree of the polynomial """
+        return len(self._coeffs) - 1
+
+    @property
+    def roots(self):
+        """ The roots of the polynomial, where self(x) == 0 """
+        return roots(self._coeffs)
+
+    # our internal _coeffs property need to be backed by __dict__['coeffs'] for
+    # scipy to work correctly.
+    @property
+    def _coeffs(self):
+        return self.__dict__['coeffs']
+    @_coeffs.setter
+    def _coeffs(self, coeffs):
+        self.__dict__['coeffs'] = coeffs
+
+    # alias attributes
+    r = roots
+    c = coef = coefficients = coeffs
+    o = order
+
+    def __init__(self, c_or_r, r=False, variable=None):
+        if isinstance(c_or_r, poly1d):
+            self._variable = c_or_r._variable
+            self._coeffs = c_or_r._coeffs
+
+            if set(c_or_r.__dict__) - set(self.__dict__):
+                msg = ("In the future extra properties will not be copied "
+                       "across when constructing one poly1d from another")
+                warnings.warn(msg, FutureWarning, stacklevel=2)
+                self.__dict__.update(c_or_r.__dict__)
+
+            if variable is not None:
+                self._variable = variable
+            return
+        if r:
+            c_or_r = poly(c_or_r)
+        c_or_r = atleast_1d(c_or_r)
+        if c_or_r.ndim > 1:
+            raise ValueError("Polynomial must be 1d only.")
+        c_or_r = trim_zeros(c_or_r, trim='f')
+        if len(c_or_r) == 0:
+            c_or_r = NX.array([0.])
+        self._coeffs = c_or_r
+        if variable is None:
+            variable = 'x'
+        self._variable = variable
+
+    def __array__(self, t=None):
+        if t:
+            return NX.asarray(self.coeffs, t)
+        else:
+            return NX.asarray(self.coeffs)
+
+    def __repr__(self):
+        vals = repr(self.coeffs)
+        vals = vals[6:-1]
+        return "poly1d(%s)" % vals
+
+    def __len__(self):
+        return self.order
+
+    def __str__(self):
+        thestr = "0"
+        var = self.variable
+
+        # Remove leading zeros
+        coeffs = self.coeffs[NX.logical_or.accumulate(self.coeffs != 0)]
+        N = len(coeffs)-1
+
+        def fmt_float(q):
+            s = '%.4g' % q
+            if s.endswith('.0000'):
+                s = s[:-5]
+            return s
+
+        for k in range(len(coeffs)):
+            if not iscomplex(coeffs[k]):
+                coefstr = fmt_float(real(coeffs[k]))
+            elif real(coeffs[k]) == 0:
+                coefstr = '%sj' % fmt_float(imag(coeffs[k]))
+            else:
+                coefstr = '(%s + %sj)' % (fmt_float(real(coeffs[k])),
+                                          fmt_float(imag(coeffs[k])))
+
+            power = (N-k)
+            if power == 0:
+                if coefstr != '0':
+                    newstr = '%s' % (coefstr,)
+                else:
+                    if k == 0:
+                        newstr = '0'
+                    else:
+                        newstr = ''
+            elif power == 1:
+                if coefstr == '0':
+                    newstr = ''
+                elif coefstr == 'b':
+                    newstr = var
+                else:
+                    newstr = '%s %s' % (coefstr, var)
+            else:
+                if coefstr == '0':
+                    newstr = ''
+                elif coefstr == 'b':
+                    newstr = '%s**%d' % (var, power,)
+                else:
+                    newstr = '%s %s**%d' % (coefstr, var, power)
+
+            if k > 0:
+                if newstr != '':
+                    if newstr.startswith('-'):
+                        thestr = "%s - %s" % (thestr, newstr[1:])
+                    else:
+                        thestr = "%s + %s" % (thestr, newstr)
+            else:
+                thestr = newstr
+        return _raise_power(thestr)
+
+    def __call__(self, val):
+        return polyval(self.coeffs, val)
+
+    def __neg__(self):
+        return poly1d(-self.coeffs)
+
+    def __pos__(self):
+        return self
+
+    def __mul__(self, other):
+        if isscalar(other):
+            return poly1d(self.coeffs * other)
+        else:
+            other = poly1d(other)
+            return poly1d(polymul(self.coeffs, other.coeffs))
+
+    def __rmul__(self, other):
+        if isscalar(other):
+            return poly1d(other * self.coeffs)
+        else:
+            other = poly1d(other)
+            return poly1d(polymul(self.coeffs, other.coeffs))
+
+    def __add__(self, other):
+        other = poly1d(other)
+        return poly1d(polyadd(self.coeffs, other.coeffs))
+
+    def __radd__(self, other):
+        other = poly1d(other)
+        return poly1d(polyadd(self.coeffs, other.coeffs))
+
+    def __pow__(self, val):
+        if not isscalar(val) or int(val) != val or val < 0:
+            raise ValueError("Power to non-negative integers only.")
+        res = [1]
+        for _ in range(val):
+            res = polymul(self.coeffs, res)
+        return poly1d(res)
+
+    def __sub__(self, other):
+        other = poly1d(other)
+        return poly1d(polysub(self.coeffs, other.coeffs))
+
+    def __rsub__(self, other):
+        other = poly1d(other)
+        return poly1d(polysub(other.coeffs, self.coeffs))
+
+    def __div__(self, other):
+        if isscalar(other):
+            return poly1d(self.coeffs/other)
+        else:
+            other = poly1d(other)
+            return polydiv(self, other)
+
+    __truediv__ = __div__
+
+    def __rdiv__(self, other):
+        if isscalar(other):
+            return poly1d(other/self.coeffs)
+        else:
+            other = poly1d(other)
+            return polydiv(other, self)
+
+    __rtruediv__ = __rdiv__
+
+    def __eq__(self, other):
+        if not isinstance(other, poly1d):
+            return NotImplemented
+        if self.coeffs.shape != other.coeffs.shape:
+            return False
+        return (self.coeffs == other.coeffs).all()
+
+    def __ne__(self, other):
+        if not isinstance(other, poly1d):
+            return NotImplemented
+        return not self.__eq__(other)
+
+
+    def __getitem__(self, val):
+        ind = self.order - val
+        if val > self.order:
+            return 0
+        if val < 0:
+            return 0
+        return self.coeffs[ind]
+
+    def __setitem__(self, key, val):
+        ind = self.order - key
+        if key < 0:
+            raise ValueError("Does not support negative powers.")
+        if key > self.order:
+            zr = NX.zeros(key-self.order, self.coeffs.dtype)
+            self._coeffs = NX.concatenate((zr, self.coeffs))
+            ind = 0
+        self._coeffs[ind] = val
+        return
+
+    def __iter__(self):
+        return iter(self.coeffs)
+
+    def integ(self, m=1, k=0):
+        """
+        Return an antiderivative (indefinite integral) of this polynomial.
+
+        Refer to `polyint` for full documentation.
+
+        See Also
+        --------
+        polyint : equivalent function
+
+        """
+        return poly1d(polyint(self.coeffs, m=m, k=k))
+
+    def deriv(self, m=1):
+        """
+        Return a derivative of this polynomial.
+
+        Refer to `polyder` for full documentation.
+
+        See Also
+        --------
+        polyder : equivalent function
+
+        """
+        return poly1d(polyder(self.coeffs, m=m))
+
+# Stuff to do on module import
+
+warnings.simplefilter('always', RankWarning)
diff --git a/venv/Lib/site-packages/numpy/lib/recfunctions.py b/venv/Lib/site-packages/numpy/lib/recfunctions.py
new file mode 100644
index 000000000..a11d5f2c7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/recfunctions.py
@@ -0,0 +1,1594 @@
+"""
+Collection of utilities to manipulate structured arrays.
+
+Most of these functions were initially implemented by John Hunter for
+matplotlib.  They have been rewritten and extended for convenience.
+
+"""
+import itertools
+import numpy as np
+import numpy.ma as ma
+from numpy import ndarray, recarray
+from numpy.ma import MaskedArray
+from numpy.ma.mrecords import MaskedRecords
+from numpy.core.overrides import array_function_dispatch
+from numpy.lib._iotools import _is_string_like
+from numpy.testing import suppress_warnings
+
+_check_fill_value = np.ma.core._check_fill_value
+
+
+__all__ = [
+    'append_fields', 'apply_along_fields', 'assign_fields_by_name',
+    'drop_fields', 'find_duplicates', 'flatten_descr',
+    'get_fieldstructure', 'get_names', 'get_names_flat',
+    'join_by', 'merge_arrays', 'rec_append_fields',
+    'rec_drop_fields', 'rec_join', 'recursive_fill_fields',
+    'rename_fields', 'repack_fields', 'require_fields',
+    'stack_arrays', 'structured_to_unstructured', 'unstructured_to_structured',
+    ]
+
+
+def _recursive_fill_fields_dispatcher(input, output):
+    return (input, output)
+
+
+@array_function_dispatch(_recursive_fill_fields_dispatcher)
+def recursive_fill_fields(input, output):
+    """
+    Fills fields from output with fields from input,
+    with support for nested structures.
+
+    Parameters
+    ----------
+    input : ndarray
+        Input array.
+    output : ndarray
+        Output array.
+
+    Notes
+    -----
+    * `output` should be at least the same size as `input`
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> a = np.array([(1, 10.), (2, 20.)], dtype=[('A', np.int64), ('B', np.float64)])
+    >>> b = np.zeros((3,), dtype=a.dtype)
+    >>> rfn.recursive_fill_fields(a, b)
+    array([(1, 10.), (2, 20.), (0,  0.)], dtype=[('A', '<i8'), ('B', '<f8')])
+
+    """
+    newdtype = output.dtype
+    for field in newdtype.names:
+        try:
+            current = input[field]
+        except ValueError:
+            continue
+        if current.dtype.names is not None:
+            recursive_fill_fields(current, output[field])
+        else:
+            output[field][:len(current)] = current
+    return output
+
+
+def _get_fieldspec(dtype):
+    """
+    Produce a list of name/dtype pairs corresponding to the dtype fields
+
+    Similar to dtype.descr, but the second item of each tuple is a dtype, not a
+    string. As a result, this handles subarray dtypes
+
+    Can be passed to the dtype constructor to reconstruct the dtype, noting that
+    this (deliberately) discards field offsets.
+
+    Examples
+    --------
+    >>> dt = np.dtype([(('a', 'A'), np.int64), ('b', np.double, 3)])
+    >>> dt.descr
+    [(('a', 'A'), '<i8'), ('b', '<f8', (3,))]
+    >>> _get_fieldspec(dt)
+    [(('a', 'A'), dtype('int64')), ('b', dtype(('<f8', (3,))))]
+
+    """
+    if dtype.names is None:
+        # .descr returns a nameless field, so we should too
+        return [('', dtype)]
+    else:
+        fields = ((name, dtype.fields[name]) for name in dtype.names)
+        # keep any titles, if present
+        return [
+            (name if len(f) == 2 else (f[2], name), f[0])
+            for name, f in fields
+        ]
+
+
+def get_names(adtype):
+    """
+    Returns the field names of the input datatype as a tuple.
+
+    Parameters
+    ----------
+    adtype : dtype
+        Input datatype
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> rfn.get_names(np.empty((1,), dtype=int))
+    Traceback (most recent call last):
+        ...
+    AttributeError: 'numpy.ndarray' object has no attribute 'names'
+
+    >>> rfn.get_names(np.empty((1,), dtype=[('A',int), ('B', float)]))
+    Traceback (most recent call last):
+        ...
+    AttributeError: 'numpy.ndarray' object has no attribute 'names'
+    >>> adtype = np.dtype([('a', int), ('b', [('ba', int), ('bb', int)])])
+    >>> rfn.get_names(adtype)
+    ('a', ('b', ('ba', 'bb')))
+    """
+    listnames = []
+    names = adtype.names
+    for name in names:
+        current = adtype[name]
+        if current.names is not None:
+            listnames.append((name, tuple(get_names(current))))
+        else:
+            listnames.append(name)
+    return tuple(listnames)
+
+
+def get_names_flat(adtype):
+    """
+    Returns the field names of the input datatype as a tuple. Nested structure
+    are flattened beforehand.
+
+    Parameters
+    ----------
+    adtype : dtype
+        Input datatype
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> rfn.get_names_flat(np.empty((1,), dtype=int)) is None
+    Traceback (most recent call last):
+        ...
+    AttributeError: 'numpy.ndarray' object has no attribute 'names'
+    >>> rfn.get_names_flat(np.empty((1,), dtype=[('A',int), ('B', float)]))
+    Traceback (most recent call last):
+        ...
+    AttributeError: 'numpy.ndarray' object has no attribute 'names'
+    >>> adtype = np.dtype([('a', int), ('b', [('ba', int), ('bb', int)])])
+    >>> rfn.get_names_flat(adtype)
+    ('a', 'b', 'ba', 'bb')
+    """
+    listnames = []
+    names = adtype.names
+    for name in names:
+        listnames.append(name)
+        current = adtype[name]
+        if current.names is not None:
+            listnames.extend(get_names_flat(current))
+    return tuple(listnames)
+
+
+def flatten_descr(ndtype):
+    """
+    Flatten a structured data-type description.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> ndtype = np.dtype([('a', '<i4'), ('b', [('ba', '<f8'), ('bb', '<i4')])])
+    >>> rfn.flatten_descr(ndtype)
+    (('a', dtype('int32')), ('ba', dtype('float64')), ('bb', dtype('int32')))
+
+    """
+    names = ndtype.names
+    if names is None:
+        return (('', ndtype),)
+    else:
+        descr = []
+        for field in names:
+            (typ, _) = ndtype.fields[field]
+            if typ.names is not None:
+                descr.extend(flatten_descr(typ))
+            else:
+                descr.append((field, typ))
+        return tuple(descr)
+
+
+def _zip_dtype(seqarrays, flatten=False):
+    newdtype = []
+    if flatten:
+        for a in seqarrays:
+            newdtype.extend(flatten_descr(a.dtype))
+    else:
+        for a in seqarrays:
+            current = a.dtype
+            if current.names is not None and len(current.names) == 1:
+                # special case - dtypes of 1 field are flattened
+                newdtype.extend(_get_fieldspec(current))
+            else:
+                newdtype.append(('', current))
+    return np.dtype(newdtype)
+
+
+def _zip_descr(seqarrays, flatten=False):
+    """
+    Combine the dtype description of a series of arrays.
+
+    Parameters
+    ----------
+    seqarrays : sequence of arrays
+        Sequence of arrays
+    flatten : {boolean}, optional
+        Whether to collapse nested descriptions.
+    """
+    return _zip_dtype(seqarrays, flatten=flatten).descr
+
+
+def get_fieldstructure(adtype, lastname=None, parents=None,):
+    """
+    Returns a dictionary with fields indexing lists of their parent fields.
+
+    This function is used to simplify access to fields nested in other fields.
+
+    Parameters
+    ----------
+    adtype : np.dtype
+        Input datatype
+    lastname : optional
+        Last processed field name (used internally during recursion).
+    parents : dictionary
+        Dictionary of parent fields (used interbally during recursion).
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> ndtype =  np.dtype([('A', int),
+    ...                     ('B', [('BA', int),
+    ...                            ('BB', [('BBA', int), ('BBB', int)])])])
+    >>> rfn.get_fieldstructure(ndtype)
+    ... # XXX: possible regression, order of BBA and BBB is swapped
+    {'A': [], 'B': [], 'BA': ['B'], 'BB': ['B'], 'BBA': ['B', 'BB'], 'BBB': ['B', 'BB']}
+
+    """
+    if parents is None:
+        parents = {}
+    names = adtype.names
+    for name in names:
+        current = adtype[name]
+        if current.names is not None:
+            if lastname:
+                parents[name] = [lastname, ]
+            else:
+                parents[name] = []
+            parents.update(get_fieldstructure(current, name, parents))
+        else:
+            lastparent = [_ for _ in (parents.get(lastname, []) or [])]
+            if lastparent:
+                lastparent.append(lastname)
+            elif lastname:
+                lastparent = [lastname, ]
+            parents[name] = lastparent or []
+    return parents
+
+
+def _izip_fields_flat(iterable):
+    """
+    Returns an iterator of concatenated fields from a sequence of arrays,
+    collapsing any nested structure.
+
+    """
+    for element in iterable:
+        if isinstance(element, np.void):
+            yield from _izip_fields_flat(tuple(element))
+        else:
+            yield element
+
+
+def _izip_fields(iterable):
+    """
+    Returns an iterator of concatenated fields from a sequence of arrays.
+
+    """
+    for element in iterable:
+        if (hasattr(element, '__iter__') and
+                not isinstance(element, str)):
+            yield from _izip_fields(element)
+        elif isinstance(element, np.void) and len(tuple(element)) == 1:
+            # this statement is the same from the previous expression
+            yield from _izip_fields(element)
+        else:
+            yield element
+
+
+def _izip_records(seqarrays, fill_value=None, flatten=True):
+    """
+    Returns an iterator of concatenated items from a sequence of arrays.
+
+    Parameters
+    ----------
+    seqarrays : sequence of arrays
+        Sequence of arrays.
+    fill_value : {None, integer}
+        Value used to pad shorter iterables.
+    flatten : {True, False},
+        Whether to
+    """
+
+    # Should we flatten the items, or just use a nested approach
+    if flatten:
+        zipfunc = _izip_fields_flat
+    else:
+        zipfunc = _izip_fields
+
+    for tup in itertools.zip_longest(*seqarrays, fillvalue=fill_value):
+        yield tuple(zipfunc(tup))
+
+
+def _fix_output(output, usemask=True, asrecarray=False):
+    """
+    Private function: return a recarray, a ndarray, a MaskedArray
+    or a MaskedRecords depending on the input parameters
+    """
+    if not isinstance(output, MaskedArray):
+        usemask = False
+    if usemask:
+        if asrecarray:
+            output = output.view(MaskedRecords)
+    else:
+        output = ma.filled(output)
+        if asrecarray:
+            output = output.view(recarray)
+    return output
+
+
+def _fix_defaults(output, defaults=None):
+    """
+    Update the fill_value and masked data of `output`
+    from the default given in a dictionary defaults.
+    """
+    names = output.dtype.names
+    (data, mask, fill_value) = (output.data, output.mask, output.fill_value)
+    for (k, v) in (defaults or {}).items():
+        if k in names:
+            fill_value[k] = v
+            data[k][mask[k]] = v
+    return output
+
+
+def _merge_arrays_dispatcher(seqarrays, fill_value=None, flatten=None,
+                             usemask=None, asrecarray=None):
+    return seqarrays
+
+
+@array_function_dispatch(_merge_arrays_dispatcher)
+def merge_arrays(seqarrays, fill_value=-1, flatten=False,
+                 usemask=False, asrecarray=False):
+    """
+    Merge arrays field by field.
+
+    Parameters
+    ----------
+    seqarrays : sequence of ndarrays
+        Sequence of arrays
+    fill_value : {float}, optional
+        Filling value used to pad missing data on the shorter arrays.
+    flatten : {False, True}, optional
+        Whether to collapse nested fields.
+    usemask : {False, True}, optional
+        Whether to return a masked array or not.
+    asrecarray : {False, True}, optional
+        Whether to return a recarray (MaskedRecords) or not.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> rfn.merge_arrays((np.array([1, 2]), np.array([10., 20., 30.])))
+    array([( 1, 10.), ( 2, 20.), (-1, 30.)],
+          dtype=[('f0', '<i8'), ('f1', '<f8')])
+
+    >>> rfn.merge_arrays((np.array([1, 2], dtype=np.int64),
+    ...         np.array([10., 20., 30.])), usemask=False)
+     array([(1, 10.0), (2, 20.0), (-1, 30.0)],
+             dtype=[('f0', '<i8'), ('f1', '<f8')])
+    >>> rfn.merge_arrays((np.array([1, 2]).view([('a', np.int64)]),
+    ...               np.array([10., 20., 30.])),
+    ...              usemask=False, asrecarray=True)
+    rec.array([( 1, 10.), ( 2, 20.), (-1, 30.)],
+              dtype=[('a', '<i8'), ('f1', '<f8')])
+
+    Notes
+    -----
+    * Without a mask, the missing value will be filled with something,
+      depending on what its corresponding type:
+
+      * ``-1``      for integers
+      * ``-1.0``    for floating point numbers
+      * ``'-'``     for characters
+      * ``'-1'``    for strings
+      * ``True``    for boolean values
+    * XXX: I just obtained these values empirically
+    """
+    # Only one item in the input sequence ?
+    if (len(seqarrays) == 1):
+        seqarrays = np.asanyarray(seqarrays[0])
+    # Do we have a single ndarray as input ?
+    if isinstance(seqarrays, (ndarray, np.void)):
+        seqdtype = seqarrays.dtype
+        # Make sure we have named fields
+        if seqdtype.names is None:
+            seqdtype = np.dtype([('', seqdtype)])
+        if not flatten or _zip_dtype((seqarrays,), flatten=True) == seqdtype:
+            # Minimal processing needed: just make sure everything's a-ok
+            seqarrays = seqarrays.ravel()
+            # Find what type of array we must return
+            if usemask:
+                if asrecarray:
+                    seqtype = MaskedRecords
+                else:
+                    seqtype = MaskedArray
+            elif asrecarray:
+                seqtype = recarray
+            else:
+                seqtype = ndarray
+            return seqarrays.view(dtype=seqdtype, type=seqtype)
+        else:
+            seqarrays = (seqarrays,)
+    else:
+        # Make sure we have arrays in the input sequence
+        seqarrays = [np.asanyarray(_m) for _m in seqarrays]
+    # Find the sizes of the inputs and their maximum
+    sizes = tuple(a.size for a in seqarrays)
+    maxlength = max(sizes)
+    # Get the dtype of the output (flattening if needed)
+    newdtype = _zip_dtype(seqarrays, flatten=flatten)
+    # Initialize the sequences for data and mask
+    seqdata = []
+    seqmask = []
+    # If we expect some kind of MaskedArray, make a special loop.
+    if usemask:
+        for (a, n) in zip(seqarrays, sizes):
+            nbmissing = (maxlength - n)
+            # Get the data and mask
+            data = a.ravel().__array__()
+            mask = ma.getmaskarray(a).ravel()
+            # Get the filling value (if needed)
+            if nbmissing:
+                fval = _check_fill_value(fill_value, a.dtype)
+                if isinstance(fval, (ndarray, np.void)):
+                    if len(fval.dtype) == 1:
+                        fval = fval.item()[0]
+                        fmsk = True
+                    else:
+                        fval = np.array(fval, dtype=a.dtype, ndmin=1)
+                        fmsk = np.ones((1,), dtype=mask.dtype)
+            else:
+                fval = None
+                fmsk = True
+            # Store an iterator padding the input to the expected length
+            seqdata.append(itertools.chain(data, [fval] * nbmissing))
+            seqmask.append(itertools.chain(mask, [fmsk] * nbmissing))
+        # Create an iterator for the data
+        data = tuple(_izip_records(seqdata, flatten=flatten))
+        output = ma.array(np.fromiter(data, dtype=newdtype, count=maxlength),
+                          mask=list(_izip_records(seqmask, flatten=flatten)))
+        if asrecarray:
+            output = output.view(MaskedRecords)
+    else:
+        # Same as before, without the mask we don't need...
+        for (a, n) in zip(seqarrays, sizes):
+            nbmissing = (maxlength - n)
+            data = a.ravel().__array__()
+            if nbmissing:
+                fval = _check_fill_value(fill_value, a.dtype)
+                if isinstance(fval, (ndarray, np.void)):
+                    if len(fval.dtype) == 1:
+                        fval = fval.item()[0]
+                    else:
+                        fval = np.array(fval, dtype=a.dtype, ndmin=1)
+            else:
+                fval = None
+            seqdata.append(itertools.chain(data, [fval] * nbmissing))
+        output = np.fromiter(tuple(_izip_records(seqdata, flatten=flatten)),
+                             dtype=newdtype, count=maxlength)
+        if asrecarray:
+            output = output.view(recarray)
+    # And we're done...
+    return output
+
+
+def _drop_fields_dispatcher(base, drop_names, usemask=None, asrecarray=None):
+    return (base,)
+
+
+@array_function_dispatch(_drop_fields_dispatcher)
+def drop_fields(base, drop_names, usemask=True, asrecarray=False):
+    """
+    Return a new array with fields in `drop_names` dropped.
+
+    Nested fields are supported.
+
+    ..versionchanged: 1.18.0
+        `drop_fields` returns an array with 0 fields if all fields are dropped,
+        rather than returning ``None`` as it did previously.
+
+    Parameters
+    ----------
+    base : array
+        Input array
+    drop_names : string or sequence
+        String or sequence of strings corresponding to the names of the
+        fields to drop.
+    usemask : {False, True}, optional
+        Whether to return a masked array or not.
+    asrecarray : string or sequence, optional
+        Whether to return a recarray or a mrecarray (`asrecarray=True`) or
+        a plain ndarray or masked array with flexible dtype. The default
+        is False.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> a = np.array([(1, (2, 3.0)), (4, (5, 6.0))],
+    ...   dtype=[('a', np.int64), ('b', [('ba', np.double), ('bb', np.int64)])])
+    >>> rfn.drop_fields(a, 'a')
+    array([((2., 3),), ((5., 6),)],
+          dtype=[('b', [('ba', '<f8'), ('bb', '<i8')])])
+    >>> rfn.drop_fields(a, 'ba')
+    array([(1, (3,)), (4, (6,))], dtype=[('a', '<i8'), ('b', [('bb', '<i8')])])
+    >>> rfn.drop_fields(a, ['ba', 'bb'])
+    array([(1,), (4,)], dtype=[('a', '<i8')])
+    """
+    if _is_string_like(drop_names):
+        drop_names = [drop_names]
+    else:
+        drop_names = set(drop_names)
+
+    def _drop_descr(ndtype, drop_names):
+        names = ndtype.names
+        newdtype = []
+        for name in names:
+            current = ndtype[name]
+            if name in drop_names:
+                continue
+            if current.names is not None:
+                descr = _drop_descr(current, drop_names)
+                if descr:
+                    newdtype.append((name, descr))
+            else:
+                newdtype.append((name, current))
+        return newdtype
+
+    newdtype = _drop_descr(base.dtype, drop_names)
+
+    output = np.empty(base.shape, dtype=newdtype)
+    output = recursive_fill_fields(base, output)
+    return _fix_output(output, usemask=usemask, asrecarray=asrecarray)
+
+
+def _keep_fields(base, keep_names, usemask=True, asrecarray=False):
+    """
+    Return a new array keeping only the fields in `keep_names`,
+    and preserving the order of those fields.
+
+    Parameters
+    ----------
+    base : array
+        Input array
+    keep_names : string or sequence
+        String or sequence of strings corresponding to the names of the
+        fields to keep. Order of the names will be preserved.
+    usemask : {False, True}, optional
+        Whether to return a masked array or not.
+    asrecarray : string or sequence, optional
+        Whether to return a recarray or a mrecarray (`asrecarray=True`) or
+        a plain ndarray or masked array with flexible dtype. The default
+        is False.
+    """
+    newdtype = [(n, base.dtype[n]) for n in keep_names]
+    output = np.empty(base.shape, dtype=newdtype)
+    output = recursive_fill_fields(base, output)
+    return _fix_output(output, usemask=usemask, asrecarray=asrecarray)
+
+
+def _rec_drop_fields_dispatcher(base, drop_names):
+    return (base,)
+
+
+@array_function_dispatch(_rec_drop_fields_dispatcher)
+def rec_drop_fields(base, drop_names):
+    """
+    Returns a new numpy.recarray with fields in `drop_names` dropped.
+    """
+    return drop_fields(base, drop_names, usemask=False, asrecarray=True)
+
+
+def _rename_fields_dispatcher(base, namemapper):
+    return (base,)
+
+
+@array_function_dispatch(_rename_fields_dispatcher)
+def rename_fields(base, namemapper):
+    """
+    Rename the fields from a flexible-datatype ndarray or recarray.
+
+    Nested fields are supported.
+
+    Parameters
+    ----------
+    base : ndarray
+        Input array whose fields must be modified.
+    namemapper : dictionary
+        Dictionary mapping old field names to their new version.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> a = np.array([(1, (2, [3.0, 30.])), (4, (5, [6.0, 60.]))],
+    ...   dtype=[('a', int),('b', [('ba', float), ('bb', (float, 2))])])
+    >>> rfn.rename_fields(a, {'a':'A', 'bb':'BB'})
+    array([(1, (2., [ 3., 30.])), (4, (5., [ 6., 60.]))],
+          dtype=[('A', '<i8'), ('b', [('ba', '<f8'), ('BB', '<f8', (2,))])])
+
+    """
+    def _recursive_rename_fields(ndtype, namemapper):
+        newdtype = []
+        for name in ndtype.names:
+            newname = namemapper.get(name, name)
+            current = ndtype[name]
+            if current.names is not None:
+                newdtype.append(
+                    (newname, _recursive_rename_fields(current, namemapper))
+                    )
+            else:
+                newdtype.append((newname, current))
+        return newdtype
+    newdtype = _recursive_rename_fields(base.dtype, namemapper)
+    return base.view(newdtype)
+
+
+def _append_fields_dispatcher(base, names, data, dtypes=None,
+                              fill_value=None, usemask=None, asrecarray=None):
+    yield base
+    yield from data
+
+
+@array_function_dispatch(_append_fields_dispatcher)
+def append_fields(base, names, data, dtypes=None,
+                  fill_value=-1, usemask=True, asrecarray=False):
+    """
+    Add new fields to an existing array.
+
+    The names of the fields are given with the `names` arguments,
+    the corresponding values with the `data` arguments.
+    If a single field is appended, `names`, `data` and `dtypes` do not have
+    to be lists but just values.
+
+    Parameters
+    ----------
+    base : array
+        Input array to extend.
+    names : string, sequence
+        String or sequence of strings corresponding to the names
+        of the new fields.
+    data : array or sequence of arrays
+        Array or sequence of arrays storing the fields to add to the base.
+    dtypes : sequence of datatypes, optional
+        Datatype or sequence of datatypes.
+        If None, the datatypes are estimated from the `data`.
+    fill_value : {float}, optional
+        Filling value used to pad missing data on the shorter arrays.
+    usemask : {False, True}, optional
+        Whether to return a masked array or not.
+    asrecarray : {False, True}, optional
+        Whether to return a recarray (MaskedRecords) or not.
+
+    """
+    # Check the names
+    if isinstance(names, (tuple, list)):
+        if len(names) != len(data):
+            msg = "The number of arrays does not match the number of names"
+            raise ValueError(msg)
+    elif isinstance(names, str):
+        names = [names, ]
+        data = [data, ]
+    #
+    if dtypes is None:
+        data = [np.array(a, copy=False, subok=True) for a in data]
+        data = [a.view([(name, a.dtype)]) for (name, a) in zip(names, data)]
+    else:
+        if not isinstance(dtypes, (tuple, list)):
+            dtypes = [dtypes, ]
+        if len(data) != len(dtypes):
+            if len(dtypes) == 1:
+                dtypes = dtypes * len(data)
+            else:
+                msg = "The dtypes argument must be None, a dtype, or a list."
+                raise ValueError(msg)
+        data = [np.array(a, copy=False, subok=True, dtype=d).view([(n, d)])
+                for (a, n, d) in zip(data, names, dtypes)]
+    #
+    base = merge_arrays(base, usemask=usemask, fill_value=fill_value)
+    if len(data) > 1:
+        data = merge_arrays(data, flatten=True, usemask=usemask,
+                            fill_value=fill_value)
+    else:
+        data = data.pop()
+    #
+    output = ma.masked_all(
+        max(len(base), len(data)),
+        dtype=_get_fieldspec(base.dtype) + _get_fieldspec(data.dtype))
+    output = recursive_fill_fields(base, output)
+    output = recursive_fill_fields(data, output)
+    #
+    return _fix_output(output, usemask=usemask, asrecarray=asrecarray)
+
+
+def _rec_append_fields_dispatcher(base, names, data, dtypes=None):
+    yield base
+    yield from data
+
+
+@array_function_dispatch(_rec_append_fields_dispatcher)
+def rec_append_fields(base, names, data, dtypes=None):
+    """
+    Add new fields to an existing array.
+
+    The names of the fields are given with the `names` arguments,
+    the corresponding values with the `data` arguments.
+    If a single field is appended, `names`, `data` and `dtypes` do not have
+    to be lists but just values.
+
+    Parameters
+    ----------
+    base : array
+        Input array to extend.
+    names : string, sequence
+        String or sequence of strings corresponding to the names
+        of the new fields.
+    data : array or sequence of arrays
+        Array or sequence of arrays storing the fields to add to the base.
+    dtypes : sequence of datatypes, optional
+        Datatype or sequence of datatypes.
+        If None, the datatypes are estimated from the `data`.
+
+    See Also
+    --------
+    append_fields
+
+    Returns
+    -------
+    appended_array : np.recarray
+    """
+    return append_fields(base, names, data=data, dtypes=dtypes,
+                         asrecarray=True, usemask=False)
+
+
+def _repack_fields_dispatcher(a, align=None, recurse=None):
+    return (a,)
+
+
+@array_function_dispatch(_repack_fields_dispatcher)
+def repack_fields(a, align=False, recurse=False):
+    """
+    Re-pack the fields of a structured array or dtype in memory.
+
+    The memory layout of structured datatypes allows fields at arbitrary
+    byte offsets. This means the fields can be separated by padding bytes,
+    their offsets can be non-monotonically increasing, and they can overlap.
+
+    This method removes any overlaps and reorders the fields in memory so they
+    have increasing byte offsets, and adds or removes padding bytes depending
+    on the `align` option, which behaves like the `align` option to `np.dtype`.
+
+    If `align=False`, this method produces a "packed" memory layout in which
+    each field starts at the byte the previous field ended, and any padding
+    bytes are removed.
+
+    If `align=True`, this methods produces an "aligned" memory layout in which
+    each field's offset is a multiple of its alignment, and the total itemsize
+    is a multiple of the largest alignment, by adding padding bytes as needed.
+
+    Parameters
+    ----------
+    a : ndarray or dtype
+       array or dtype for which to repack the fields.
+    align : boolean
+       If true, use an "aligned" memory layout, otherwise use a "packed" layout.
+    recurse : boolean
+       If True, also repack nested structures.
+
+    Returns
+    -------
+    repacked : ndarray or dtype
+       Copy of `a` with fields repacked, or `a` itself if no repacking was
+       needed.
+
+    Examples
+    --------
+
+    >>> from numpy.lib import recfunctions as rfn
+    >>> def print_offsets(d):
+    ...     print("offsets:", [d.fields[name][1] for name in d.names])
+    ...     print("itemsize:", d.itemsize)
+    ...
+    >>> dt = np.dtype('u1, <i8, <f8', align=True)
+    >>> dt
+    dtype({'names':['f0','f1','f2'], 'formats':['u1','<i8','<f8'], 'offsets':[0,8,16], 'itemsize':24}, align=True)
+    >>> print_offsets(dt)
+    offsets: [0, 8, 16]
+    itemsize: 24
+    >>> packed_dt = rfn.repack_fields(dt)
+    >>> packed_dt
+    dtype([('f0', 'u1'), ('f1', '<i8'), ('f2', '<f8')])
+    >>> print_offsets(packed_dt)
+    offsets: [0, 1, 9]
+    itemsize: 17
+
+    """
+    if not isinstance(a, np.dtype):
+        dt = repack_fields(a.dtype, align=align, recurse=recurse)
+        return a.astype(dt, copy=False)
+
+    if a.names is None:
+        return a
+
+    fieldinfo = []
+    for name in a.names:
+        tup = a.fields[name]
+        if recurse:
+            fmt = repack_fields(tup[0], align=align, recurse=True)
+        else:
+            fmt = tup[0]
+
+        if len(tup) == 3:
+            name = (tup[2], name)
+
+        fieldinfo.append((name, fmt))
+
+    dt = np.dtype(fieldinfo, align=align)
+    return np.dtype((a.type, dt))
+
+def _get_fields_and_offsets(dt, offset=0):
+    """
+    Returns a flat list of (dtype, count, offset) tuples of all the
+    scalar fields in the dtype "dt", including nested fields, in left
+    to right order.
+    """
+
+    # counts up elements in subarrays, including nested subarrays, and returns
+    # base dtype and count
+    def count_elem(dt):
+        count = 1
+        while dt.shape != ():
+            for size in dt.shape:
+                count *= size
+            dt = dt.base
+        return dt, count
+
+    fields = []
+    for name in dt.names:
+        field = dt.fields[name]
+        f_dt, f_offset = field[0], field[1]
+        f_dt, n = count_elem(f_dt)
+
+        if f_dt.names is None:
+            fields.append((np.dtype((f_dt, (n,))), n, f_offset + offset))
+        else:
+            subfields = _get_fields_and_offsets(f_dt, f_offset + offset)
+            size = f_dt.itemsize
+
+            for i in range(n):
+                if i == 0:
+                    # optimization: avoid list comprehension if no subarray
+                    fields.extend(subfields)
+                else:
+                    fields.extend([(d, c, o + i*size) for d, c, o in subfields])
+    return fields
+
+
+def _structured_to_unstructured_dispatcher(arr, dtype=None, copy=None,
+                                           casting=None):
+    return (arr,)
+
+@array_function_dispatch(_structured_to_unstructured_dispatcher)
+def structured_to_unstructured(arr, dtype=None, copy=False, casting='unsafe'):
+    """
+    Converts and n-D structured array into an (n+1)-D unstructured array.
+
+    The new array will have a new last dimension equal in size to the
+    number of field-elements of the input array. If not supplied, the output
+    datatype is determined from the numpy type promotion rules applied to all
+    the field datatypes.
+
+    Nested fields, as well as each element of any subarray fields, all count
+    as a single field-elements.
+
+    Parameters
+    ----------
+    arr : ndarray
+       Structured array or dtype to convert. Cannot contain object datatype.
+    dtype : dtype, optional
+       The dtype of the output unstructured array.
+    copy : bool, optional
+        See copy argument to `ndarray.astype`. If true, always return a copy.
+        If false, and `dtype` requirements are satisfied, a view is returned.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        See casting argument of `ndarray.astype`. Controls what kind of data
+        casting may occur.
+
+    Returns
+    -------
+    unstructured : ndarray
+       Unstructured array with one more dimension.
+
+    Examples
+    --------
+
+    >>> from numpy.lib import recfunctions as rfn
+    >>> a = np.zeros(4, dtype=[('a', 'i4'), ('b', 'f4,u2'), ('c', 'f4', 2)])
+    >>> a
+    array([(0, (0., 0), [0., 0.]), (0, (0., 0), [0., 0.]),
+           (0, (0., 0), [0., 0.]), (0, (0., 0), [0., 0.])],
+          dtype=[('a', '<i4'), ('b', [('f0', '<f4'), ('f1', '<u2')]), ('c', '<f4', (2,))])
+    >>> rfn.structured_to_unstructured(a)
+    array([[0., 0., 0., 0., 0.],
+           [0., 0., 0., 0., 0.],
+           [0., 0., 0., 0., 0.],
+           [0., 0., 0., 0., 0.]])
+
+    >>> b = np.array([(1, 2, 5), (4, 5, 7), (7, 8 ,11), (10, 11, 12)],
+    ...              dtype=[('x', 'i4'), ('y', 'f4'), ('z', 'f8')])
+    >>> np.mean(rfn.structured_to_unstructured(b[['x', 'z']]), axis=-1)
+    array([ 3. ,  5.5,  9. , 11. ])
+
+    """
+    if arr.dtype.names is None:
+        raise ValueError('arr must be a structured array')
+
+    fields = _get_fields_and_offsets(arr.dtype)
+    n_fields = len(fields)
+    if n_fields == 0 and dtype is None:
+        raise ValueError("arr has no fields. Unable to guess dtype")
+    elif n_fields == 0:
+        # too many bugs elsewhere for this to work now
+        raise NotImplementedError("arr with no fields is not supported")
+
+    dts, counts, offsets = zip(*fields)
+    names = ['f{}'.format(n) for n in range(n_fields)]
+
+    if dtype is None:
+        out_dtype = np.result_type(*[dt.base for dt in dts])
+    else:
+        out_dtype = dtype
+
+    # Use a series of views and casts to convert to an unstructured array:
+
+    # first view using flattened fields (doesn't work for object arrays)
+    # Note: dts may include a shape for subarrays
+    flattened_fields = np.dtype({'names': names,
+                                 'formats': dts,
+                                 'offsets': offsets,
+                                 'itemsize': arr.dtype.itemsize})
+    with suppress_warnings() as sup:  # until 1.16 (gh-12447)
+        sup.filter(FutureWarning, "Numpy has detected")
+        arr = arr.view(flattened_fields)
+
+    # next cast to a packed format with all fields converted to new dtype
+    packed_fields = np.dtype({'names': names,
+                              'formats': [(out_dtype, dt.shape) for dt in dts]})
+    arr = arr.astype(packed_fields, copy=copy, casting=casting)
+
+    # finally is it safe to view the packed fields as the unstructured type
+    return arr.view((out_dtype, (sum(counts),)))
+
+
+def _unstructured_to_structured_dispatcher(arr, dtype=None, names=None,
+                                           align=None, copy=None, casting=None):
+    return (arr,)
+
+@array_function_dispatch(_unstructured_to_structured_dispatcher)
+def unstructured_to_structured(arr, dtype=None, names=None, align=False,
+                               copy=False, casting='unsafe'):
+    """
+    Converts and n-D unstructured array into an (n-1)-D structured array.
+
+    The last dimension of the input array is converted into a structure, with
+    number of field-elements equal to the size of the last dimension of the
+    input array. By default all output fields have the input array's dtype, but
+    an output structured dtype with an equal number of fields-elements can be
+    supplied instead.
+
+    Nested fields, as well as each element of any subarray fields, all count
+    towards the number of field-elements.
+
+    Parameters
+    ----------
+    arr : ndarray
+       Unstructured array or dtype to convert.
+    dtype : dtype, optional
+       The structured dtype of the output array
+    names : list of strings, optional
+       If dtype is not supplied, this specifies the field names for the output
+       dtype, in order. The field dtypes will be the same as the input array.
+    align : boolean, optional
+       Whether to create an aligned memory layout.
+    copy : bool, optional
+        See copy argument to `ndarray.astype`. If true, always return a copy.
+        If false, and `dtype` requirements are satisfied, a view is returned.
+    casting : {'no', 'equiv', 'safe', 'same_kind', 'unsafe'}, optional
+        See casting argument of `ndarray.astype`. Controls what kind of data
+        casting may occur.
+
+    Returns
+    -------
+    structured : ndarray
+       Structured array with fewer dimensions.
+
+    Examples
+    --------
+
+    >>> from numpy.lib import recfunctions as rfn
+    >>> dt = np.dtype([('a', 'i4'), ('b', 'f4,u2'), ('c', 'f4', 2)])
+    >>> a = np.arange(20).reshape((4,5))
+    >>> a
+    array([[ 0,  1,  2,  3,  4],
+           [ 5,  6,  7,  8,  9],
+           [10, 11, 12, 13, 14],
+           [15, 16, 17, 18, 19]])
+    >>> rfn.unstructured_to_structured(a, dt)
+    array([( 0, ( 1.,  2), [ 3.,  4.]), ( 5, ( 6.,  7), [ 8.,  9.]),
+           (10, (11., 12), [13., 14.]), (15, (16., 17), [18., 19.])],
+          dtype=[('a', '<i4'), ('b', [('f0', '<f4'), ('f1', '<u2')]), ('c', '<f4', (2,))])
+
+    """
+    if arr.shape == ():
+        raise ValueError('arr must have at least one dimension')
+    n_elem = arr.shape[-1]
+    if n_elem == 0:
+        # too many bugs elsewhere for this to work now
+        raise NotImplementedError("last axis with size 0 is not supported")
+
+    if dtype is None:
+        if names is None:
+            names = ['f{}'.format(n) for n in range(n_elem)]
+        out_dtype = np.dtype([(n, arr.dtype) for n in names], align=align)
+        fields = _get_fields_and_offsets(out_dtype)
+        dts, counts, offsets = zip(*fields)
+    else:
+        if names is not None:
+            raise ValueError("don't supply both dtype and names")
+        # sanity check of the input dtype
+        fields = _get_fields_and_offsets(dtype)
+        if len(fields) == 0:
+            dts, counts, offsets = [], [], []
+        else:
+            dts, counts, offsets = zip(*fields)
+
+        if n_elem != sum(counts):
+            raise ValueError('The length of the last dimension of arr must '
+                             'be equal to the number of fields in dtype')
+        out_dtype = dtype
+        if align and not out_dtype.isalignedstruct:
+            raise ValueError("align was True but dtype is not aligned")
+
+    names = ['f{}'.format(n) for n in range(len(fields))]
+
+    # Use a series of views and casts to convert to a structured array:
+
+    # first view as a packed structured array of one dtype
+    packed_fields = np.dtype({'names': names,
+                              'formats': [(arr.dtype, dt.shape) for dt in dts]})
+    arr = np.ascontiguousarray(arr).view(packed_fields)
+
+    # next cast to an unpacked but flattened format with varied dtypes
+    flattened_fields = np.dtype({'names': names,
+                                 'formats': dts,
+                                 'offsets': offsets,
+                                 'itemsize': out_dtype.itemsize})
+    arr = arr.astype(flattened_fields, copy=copy, casting=casting)
+
+    # finally view as the final nested dtype and remove the last axis
+    return arr.view(out_dtype)[..., 0]
+
+def _apply_along_fields_dispatcher(func, arr):
+    return (arr,)
+
+@array_function_dispatch(_apply_along_fields_dispatcher)
+def apply_along_fields(func, arr):
+    """
+    Apply function 'func' as a reduction across fields of a structured array.
+
+    This is similar to `apply_along_axis`, but treats the fields of a
+    structured array as an extra axis. The fields are all first cast to a
+    common type following the type-promotion rules from `numpy.result_type`
+    applied to the field's dtypes.
+
+    Parameters
+    ----------
+    func : function
+       Function to apply on the "field" dimension. This function must
+       support an `axis` argument, like np.mean, np.sum, etc.
+    arr : ndarray
+       Structured array for which to apply func.
+
+    Returns
+    -------
+    out : ndarray
+       Result of the recution operation
+
+    Examples
+    --------
+
+    >>> from numpy.lib import recfunctions as rfn
+    >>> b = np.array([(1, 2, 5), (4, 5, 7), (7, 8 ,11), (10, 11, 12)],
+    ...              dtype=[('x', 'i4'), ('y', 'f4'), ('z', 'f8')])
+    >>> rfn.apply_along_fields(np.mean, b)
+    array([ 2.66666667,  5.33333333,  8.66666667, 11.        ])
+    >>> rfn.apply_along_fields(np.mean, b[['x', 'z']])
+    array([ 3. ,  5.5,  9. , 11. ])
+
+    """
+    if arr.dtype.names is None:
+        raise ValueError('arr must be a structured array')
+
+    uarr = structured_to_unstructured(arr)
+    return func(uarr, axis=-1)
+    # works and avoids axis requirement, but very, very slow:
+    #return np.apply_along_axis(func, -1, uarr)
+
+def _assign_fields_by_name_dispatcher(dst, src, zero_unassigned=None):
+    return dst, src
+
+@array_function_dispatch(_assign_fields_by_name_dispatcher)
+def assign_fields_by_name(dst, src, zero_unassigned=True):
+    """
+    Assigns values from one structured array to another by field name.
+
+    Normally in numpy >= 1.14, assignment of one structured array to another
+    copies fields "by position", meaning that the first field from the src is
+    copied to the first field of the dst, and so on, regardless of field name.
+
+    This function instead copies "by field name", such that fields in the dst
+    are assigned from the identically named field in the src. This applies
+    recursively for nested structures. This is how structure assignment worked
+    in numpy >= 1.6 to <= 1.13.
+
+    Parameters
+    ----------
+    dst : ndarray
+    src : ndarray
+        The source and destination arrays during assignment.
+    zero_unassigned : bool, optional
+        If True, fields in the dst for which there was no matching
+        field in the src are filled with the value 0 (zero). This
+        was the behavior of numpy <= 1.13. If False, those fields
+        are not modified.
+    """
+
+    if dst.dtype.names is None:
+        dst[...] = src
+        return
+
+    for name in dst.dtype.names:
+        if name not in src.dtype.names:
+            if zero_unassigned:
+                dst[name] = 0
+        else:
+            assign_fields_by_name(dst[name], src[name],
+                                  zero_unassigned)
+
+def _require_fields_dispatcher(array, required_dtype):
+    return (array,)
+
+@array_function_dispatch(_require_fields_dispatcher)
+def require_fields(array, required_dtype):
+    """
+    Casts a structured array to a new dtype using assignment by field-name.
+
+    This function assigns from the old to the new array by name, so the
+    value of a field in the output array is the value of the field with the
+    same name in the source array. This has the effect of creating a new
+    ndarray containing only the fields "required" by the required_dtype.
+
+    If a field name in the required_dtype does not exist in the
+    input array, that field is created and set to 0 in the output array.
+
+    Parameters
+    ----------
+    a : ndarray
+       array to cast
+    required_dtype : dtype
+       datatype for output array
+
+    Returns
+    -------
+    out : ndarray
+        array with the new dtype, with field values copied from the fields in
+        the input array with the same name
+
+    Examples
+    --------
+
+    >>> from numpy.lib import recfunctions as rfn
+    >>> a = np.ones(4, dtype=[('a', 'i4'), ('b', 'f8'), ('c', 'u1')])
+    >>> rfn.require_fields(a, [('b', 'f4'), ('c', 'u1')])
+    array([(1., 1), (1., 1), (1., 1), (1., 1)],
+      dtype=[('b', '<f4'), ('c', 'u1')])
+    >>> rfn.require_fields(a, [('b', 'f4'), ('newf', 'u1')])
+    array([(1., 0), (1., 0), (1., 0), (1., 0)],
+      dtype=[('b', '<f4'), ('newf', 'u1')])
+
+    """
+    out = np.empty(array.shape, dtype=required_dtype)
+    assign_fields_by_name(out, array)
+    return out
+
+
+def _stack_arrays_dispatcher(arrays, defaults=None, usemask=None,
+                             asrecarray=None, autoconvert=None):
+    return arrays
+
+
+@array_function_dispatch(_stack_arrays_dispatcher)
+def stack_arrays(arrays, defaults=None, usemask=True, asrecarray=False,
+                 autoconvert=False):
+    """
+    Superposes arrays fields by fields
+
+    Parameters
+    ----------
+    arrays : array or sequence
+        Sequence of input arrays.
+    defaults : dictionary, optional
+        Dictionary mapping field names to the corresponding default values.
+    usemask : {True, False}, optional
+        Whether to return a MaskedArray (or MaskedRecords is
+        `asrecarray==True`) or a ndarray.
+    asrecarray : {False, True}, optional
+        Whether to return a recarray (or MaskedRecords if `usemask==True`)
+        or just a flexible-type ndarray.
+    autoconvert : {False, True}, optional
+        Whether automatically cast the type of the field to the maximum.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> x = np.array([1, 2,])
+    >>> rfn.stack_arrays(x) is x
+    True
+    >>> z = np.array([('A', 1), ('B', 2)], dtype=[('A', '|S3'), ('B', float)])
+    >>> zz = np.array([('a', 10., 100.), ('b', 20., 200.), ('c', 30., 300.)],
+    ...   dtype=[('A', '|S3'), ('B', np.double), ('C', np.double)])
+    >>> test = rfn.stack_arrays((z,zz))
+    >>> test
+    masked_array(data=[(b'A', 1.0, --), (b'B', 2.0, --), (b'a', 10.0, 100.0),
+                       (b'b', 20.0, 200.0), (b'c', 30.0, 300.0)],
+                 mask=[(False, False,  True), (False, False,  True),
+                       (False, False, False), (False, False, False),
+                       (False, False, False)],
+           fill_value=(b'N/A', 1.e+20, 1.e+20),
+                dtype=[('A', 'S3'), ('B', '<f8'), ('C', '<f8')])
+
+    """
+    if isinstance(arrays, ndarray):
+        return arrays
+    elif len(arrays) == 1:
+        return arrays[0]
+    seqarrays = [np.asanyarray(a).ravel() for a in arrays]
+    nrecords = [len(a) for a in seqarrays]
+    ndtype = [a.dtype for a in seqarrays]
+    fldnames = [d.names for d in ndtype]
+    #
+    dtype_l = ndtype[0]
+    newdescr = _get_fieldspec(dtype_l)
+    names = [n for n, d in newdescr]
+    for dtype_n in ndtype[1:]:
+        for fname, fdtype in _get_fieldspec(dtype_n):
+            if fname not in names:
+                newdescr.append((fname, fdtype))
+                names.append(fname)
+            else:
+                nameidx = names.index(fname)
+                _, cdtype = newdescr[nameidx]
+                if autoconvert:
+                    newdescr[nameidx] = (fname, max(fdtype, cdtype))
+                elif fdtype != cdtype:
+                    raise TypeError("Incompatible type '%s' <> '%s'" %
+                                    (cdtype, fdtype))
+    # Only one field: use concatenate
+    if len(newdescr) == 1:
+        output = ma.concatenate(seqarrays)
+    else:
+        #
+        output = ma.masked_all((np.sum(nrecords),), newdescr)
+        offset = np.cumsum(np.r_[0, nrecords])
+        seen = []
+        for (a, n, i, j) in zip(seqarrays, fldnames, offset[:-1], offset[1:]):
+            names = a.dtype.names
+            if names is None:
+                output['f%i' % len(seen)][i:j] = a
+            else:
+                for name in n:
+                    output[name][i:j] = a[name]
+                    if name not in seen:
+                        seen.append(name)
+    #
+    return _fix_output(_fix_defaults(output, defaults),
+                       usemask=usemask, asrecarray=asrecarray)
+
+
+def _find_duplicates_dispatcher(
+        a, key=None, ignoremask=None, return_index=None):
+    return (a,)
+
+
+@array_function_dispatch(_find_duplicates_dispatcher)
+def find_duplicates(a, key=None, ignoremask=True, return_index=False):
+    """
+    Find the duplicates in a structured array along a given key
+
+    Parameters
+    ----------
+    a : array-like
+        Input array
+    key : {string, None}, optional
+        Name of the fields along which to check the duplicates.
+        If None, the search is performed by records
+    ignoremask : {True, False}, optional
+        Whether masked data should be discarded or considered as duplicates.
+    return_index : {False, True}, optional
+        Whether to return the indices of the duplicated values.
+
+    Examples
+    --------
+    >>> from numpy.lib import recfunctions as rfn
+    >>> ndtype = [('a', int)]
+    >>> a = np.ma.array([1, 1, 1, 2, 2, 3, 3],
+    ...         mask=[0, 0, 1, 0, 0, 0, 1]).view(ndtype)
+    >>> rfn.find_duplicates(a, ignoremask=True, return_index=True)
+    (masked_array(data=[(1,), (1,), (2,), (2,)],
+                 mask=[(False,), (False,), (False,), (False,)],
+           fill_value=(999999,),
+                dtype=[('a', '<i8')]), array([0, 1, 3, 4]))
+    """
+    a = np.asanyarray(a).ravel()
+    # Get a dictionary of fields
+    fields = get_fieldstructure(a.dtype)
+    # Get the sorting data (by selecting the corresponding field)
+    base = a
+    if key:
+        for f in fields[key]:
+            base = base[f]
+        base = base[key]
+    # Get the sorting indices and the sorted data
+    sortidx = base.argsort()
+    sortedbase = base[sortidx]
+    sorteddata = sortedbase.filled()
+    # Compare the sorting data
+    flag = (sorteddata[:-1] == sorteddata[1:])
+    # If masked data must be ignored, set the flag to false where needed
+    if ignoremask:
+        sortedmask = sortedbase.recordmask
+        flag[sortedmask[1:]] = False
+    flag = np.concatenate(([False], flag))
+    # We need to take the point on the left as well (else we're missing it)
+    flag[:-1] = flag[:-1] + flag[1:]
+    duplicates = a[sortidx][flag]
+    if return_index:
+        return (duplicates, sortidx[flag])
+    else:
+        return duplicates
+
+
+def _join_by_dispatcher(
+        key, r1, r2, jointype=None, r1postfix=None, r2postfix=None,
+        defaults=None, usemask=None, asrecarray=None):
+    return (r1, r2)
+
+
+@array_function_dispatch(_join_by_dispatcher)
+def join_by(key, r1, r2, jointype='inner', r1postfix='1', r2postfix='2',
+            defaults=None, usemask=True, asrecarray=False):
+    """
+    Join arrays `r1` and `r2` on key `key`.
+
+    The key should be either a string or a sequence of string corresponding
+    to the fields used to join the array.  An exception is raised if the
+    `key` field cannot be found in the two input arrays.  Neither `r1` nor
+    `r2` should have any duplicates along `key`: the presence of duplicates
+    will make the output quite unreliable. Note that duplicates are not
+    looked for by the algorithm.
+
+    Parameters
+    ----------
+    key : {string, sequence}
+        A string or a sequence of strings corresponding to the fields used
+        for comparison.
+    r1, r2 : arrays
+        Structured arrays.
+    jointype : {'inner', 'outer', 'leftouter'}, optional
+        If 'inner', returns the elements common to both r1 and r2.
+        If 'outer', returns the common elements as well as the elements of
+        r1 not in r2 and the elements of not in r2.
+        If 'leftouter', returns the common elements and the elements of r1
+        not in r2.
+    r1postfix : string, optional
+        String appended to the names of the fields of r1 that are present
+        in r2 but absent of the key.
+    r2postfix : string, optional
+        String appended to the names of the fields of r2 that are present
+        in r1 but absent of the key.
+    defaults : {dictionary}, optional
+        Dictionary mapping field names to the corresponding default values.
+    usemask : {True, False}, optional
+        Whether to return a MaskedArray (or MaskedRecords is
+        `asrecarray==True`) or a ndarray.
+    asrecarray : {False, True}, optional
+        Whether to return a recarray (or MaskedRecords if `usemask==True`)
+        or just a flexible-type ndarray.
+
+    Notes
+    -----
+    * The output is sorted along the key.
+    * A temporary array is formed by dropping the fields not in the key for
+      the two arrays and concatenating the result. This array is then
+      sorted, and the common entries selected. The output is constructed by
+      filling the fields with the selected entries. Matching is not
+      preserved if there are some duplicates...
+
+    """
+    # Check jointype
+    if jointype not in ('inner', 'outer', 'leftouter'):
+        raise ValueError(
+                "The 'jointype' argument should be in 'inner', "
+                "'outer' or 'leftouter' (got '%s' instead)" % jointype
+                )
+    # If we have a single key, put it in a tuple
+    if isinstance(key, str):
+        key = (key,)
+
+    # Check the keys
+    if len(set(key)) != len(key):
+        dup = next(x for n,x in enumerate(key) if x in key[n+1:])
+        raise ValueError("duplicate join key %r" % dup)
+    for name in key:
+        if name not in r1.dtype.names:
+            raise ValueError('r1 does not have key field %r' % name)
+        if name not in r2.dtype.names:
+            raise ValueError('r2 does not have key field %r' % name)
+
+    # Make sure we work with ravelled arrays
+    r1 = r1.ravel()
+    r2 = r2.ravel()
+    # Fixme: nb2 below is never used. Commenting out for pyflakes.
+    # (nb1, nb2) = (len(r1), len(r2))
+    nb1 = len(r1)
+    (r1names, r2names) = (r1.dtype.names, r2.dtype.names)
+
+    # Check the names for collision
+    collisions = (set(r1names) & set(r2names)) - set(key)
+    if collisions and not (r1postfix or r2postfix):
+        msg = "r1 and r2 contain common names, r1postfix and r2postfix "
+        msg += "can't both be empty"
+        raise ValueError(msg)
+
+    # Make temporary arrays of just the keys
+    #  (use order of keys in `r1` for back-compatibility)
+    key1 = [ n for n in r1names if n in key ]
+    r1k = _keep_fields(r1, key1)
+    r2k = _keep_fields(r2, key1)
+
+    # Concatenate the two arrays for comparison
+    aux = ma.concatenate((r1k, r2k))
+    idx_sort = aux.argsort(order=key)
+    aux = aux[idx_sort]
+    #
+    # Get the common keys
+    flag_in = ma.concatenate(([False], aux[1:] == aux[:-1]))
+    flag_in[:-1] = flag_in[1:] + flag_in[:-1]
+    idx_in = idx_sort[flag_in]
+    idx_1 = idx_in[(idx_in < nb1)]
+    idx_2 = idx_in[(idx_in >= nb1)] - nb1
+    (r1cmn, r2cmn) = (len(idx_1), len(idx_2))
+    if jointype == 'inner':
+        (r1spc, r2spc) = (0, 0)
+    elif jointype == 'outer':
+        idx_out = idx_sort[~flag_in]
+        idx_1 = np.concatenate((idx_1, idx_out[(idx_out < nb1)]))
+        idx_2 = np.concatenate((idx_2, idx_out[(idx_out >= nb1)] - nb1))
+        (r1spc, r2spc) = (len(idx_1) - r1cmn, len(idx_2) - r2cmn)
+    elif jointype == 'leftouter':
+        idx_out = idx_sort[~flag_in]
+        idx_1 = np.concatenate((idx_1, idx_out[(idx_out < nb1)]))
+        (r1spc, r2spc) = (len(idx_1) - r1cmn, 0)
+    # Select the entries from each input
+    (s1, s2) = (r1[idx_1], r2[idx_2])
+    #
+    # Build the new description of the output array .......
+    # Start with the key fields
+    ndtype = _get_fieldspec(r1k.dtype)
+
+    # Add the fields from r1
+    for fname, fdtype in _get_fieldspec(r1.dtype):
+        if fname not in key:
+            ndtype.append((fname, fdtype))
+
+    # Add the fields from r2
+    for fname, fdtype in _get_fieldspec(r2.dtype):
+        # Have we seen the current name already ?
+        # we need to rebuild this list every time
+        names = list(name for name, dtype in ndtype)
+        try:
+            nameidx = names.index(fname)
+        except ValueError:
+            #... we haven't: just add the description to the current list
+            ndtype.append((fname, fdtype))
+        else:
+            # collision
+            _, cdtype = ndtype[nameidx]
+            if fname in key:
+                # The current field is part of the key: take the largest dtype
+                ndtype[nameidx] = (fname, max(fdtype, cdtype))
+            else:
+                # The current field is not part of the key: add the suffixes,
+                # and place the new field adjacent to the old one
+                ndtype[nameidx:nameidx + 1] = [
+                    (fname + r1postfix, cdtype),
+                    (fname + r2postfix, fdtype)
+                ]
+    # Rebuild a dtype from the new fields
+    ndtype = np.dtype(ndtype)
+    # Find the largest nb of common fields :
+    # r1cmn and r2cmn should be equal, but...
+    cmn = max(r1cmn, r2cmn)
+    # Construct an empty array
+    output = ma.masked_all((cmn + r1spc + r2spc,), dtype=ndtype)
+    names = output.dtype.names
+    for f in r1names:
+        selected = s1[f]
+        if f not in names or (f in r2names and not r2postfix and f not in key):
+            f += r1postfix
+        current = output[f]
+        current[:r1cmn] = selected[:r1cmn]
+        if jointype in ('outer', 'leftouter'):
+            current[cmn:cmn + r1spc] = selected[r1cmn:]
+    for f in r2names:
+        selected = s2[f]
+        if f not in names or (f in r1names and not r1postfix and f not in key):
+            f += r2postfix
+        current = output[f]
+        current[:r2cmn] = selected[:r2cmn]
+        if (jointype == 'outer') and r2spc:
+            current[-r2spc:] = selected[r2cmn:]
+    # Sort and finalize the output
+    output.sort(order=key)
+    kwargs = dict(usemask=usemask, asrecarray=asrecarray)
+    return _fix_output(_fix_defaults(output, defaults), **kwargs)
+
+
+def _rec_join_dispatcher(
+        key, r1, r2, jointype=None, r1postfix=None, r2postfix=None,
+        defaults=None):
+    return (r1, r2)
+
+
+@array_function_dispatch(_rec_join_dispatcher)
+def rec_join(key, r1, r2, jointype='inner', r1postfix='1', r2postfix='2',
+             defaults=None):
+    """
+    Join arrays `r1` and `r2` on keys.
+    Alternative to join_by, that always returns a np.recarray.
+
+    See Also
+    --------
+    join_by : equivalent function
+    """
+    kwargs = dict(jointype=jointype, r1postfix=r1postfix, r2postfix=r2postfix,
+                  defaults=defaults, usemask=False, asrecarray=True)
+    return join_by(key, r1, r2, **kwargs)
diff --git a/venv/Lib/site-packages/numpy/lib/scimath.py b/venv/Lib/site-packages/numpy/lib/scimath.py
new file mode 100644
index 000000000..555a3d5a8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/scimath.py
@@ -0,0 +1,601 @@
+"""
+Wrapper functions to more user-friendly calling of certain math functions
+whose output data-type is different than the input data-type in certain
+domains of the input.
+
+For example, for functions like `log` with branch cuts, the versions in this
+module provide the mathematically valid answers in the complex plane::
+
+  >>> import math
+  >>> from numpy.lib import scimath
+  >>> scimath.log(-math.exp(1)) == (1+1j*math.pi)
+  True
+
+Similarly, `sqrt`, other base logarithms, `power` and trig functions are
+correctly handled.  See their respective docstrings for specific examples.
+
+"""
+import numpy.core.numeric as nx
+import numpy.core.numerictypes as nt
+from numpy.core.numeric import asarray, any
+from numpy.core.overrides import array_function_dispatch
+from numpy.lib.type_check import isreal
+
+
+__all__ = [
+    'sqrt', 'log', 'log2', 'logn', 'log10', 'power', 'arccos', 'arcsin',
+    'arctanh'
+    ]
+
+
+_ln2 = nx.log(2.0)
+
+
+def _tocomplex(arr):
+    """Convert its input `arr` to a complex array.
+
+    The input is returned as a complex array of the smallest type that will fit
+    the original data: types like single, byte, short, etc. become csingle,
+    while others become cdouble.
+
+    A copy of the input is always made.
+
+    Parameters
+    ----------
+    arr : array
+
+    Returns
+    -------
+    array
+        An array with the same input data as the input but in complex form.
+
+    Examples
+    --------
+
+    First, consider an input of type short:
+
+    >>> a = np.array([1,2,3],np.short)
+
+    >>> ac = np.lib.scimath._tocomplex(a); ac
+    array([1.+0.j, 2.+0.j, 3.+0.j], dtype=complex64)
+
+    >>> ac.dtype
+    dtype('complex64')
+
+    If the input is of type double, the output is correspondingly of the
+    complex double type as well:
+
+    >>> b = np.array([1,2,3],np.double)
+
+    >>> bc = np.lib.scimath._tocomplex(b); bc
+    array([1.+0.j, 2.+0.j, 3.+0.j])
+
+    >>> bc.dtype
+    dtype('complex128')
+
+    Note that even if the input was complex to begin with, a copy is still
+    made, since the astype() method always copies:
+
+    >>> c = np.array([1,2,3],np.csingle)
+
+    >>> cc = np.lib.scimath._tocomplex(c); cc
+    array([1.+0.j,  2.+0.j,  3.+0.j], dtype=complex64)
+
+    >>> c *= 2; c
+    array([2.+0.j,  4.+0.j,  6.+0.j], dtype=complex64)
+
+    >>> cc
+    array([1.+0.j,  2.+0.j,  3.+0.j], dtype=complex64)
+    """
+    if issubclass(arr.dtype.type, (nt.single, nt.byte, nt.short, nt.ubyte,
+                                   nt.ushort, nt.csingle)):
+        return arr.astype(nt.csingle)
+    else:
+        return arr.astype(nt.cdouble)
+
+
+def _fix_real_lt_zero(x):
+    """Convert `x` to complex if it has real, negative components.
+
+    Otherwise, output is just the array version of the input (via asarray).
+
+    Parameters
+    ----------
+    x : array_like
+
+    Returns
+    -------
+    array
+
+    Examples
+    --------
+    >>> np.lib.scimath._fix_real_lt_zero([1,2])
+    array([1, 2])
+
+    >>> np.lib.scimath._fix_real_lt_zero([-1,2])
+    array([-1.+0.j,  2.+0.j])
+
+    """
+    x = asarray(x)
+    if any(isreal(x) & (x < 0)):
+        x = _tocomplex(x)
+    return x
+
+
+def _fix_int_lt_zero(x):
+    """Convert `x` to double if it has real, negative components.
+
+    Otherwise, output is just the array version of the input (via asarray).
+
+    Parameters
+    ----------
+    x : array_like
+
+    Returns
+    -------
+    array
+
+    Examples
+    --------
+    >>> np.lib.scimath._fix_int_lt_zero([1,2])
+    array([1, 2])
+
+    >>> np.lib.scimath._fix_int_lt_zero([-1,2])
+    array([-1.,  2.])
+    """
+    x = asarray(x)
+    if any(isreal(x) & (x < 0)):
+        x = x * 1.0
+    return x
+
+
+def _fix_real_abs_gt_1(x):
+    """Convert `x` to complex if it has real components x_i with abs(x_i)>1.
+
+    Otherwise, output is just the array version of the input (via asarray).
+
+    Parameters
+    ----------
+    x : array_like
+
+    Returns
+    -------
+    array
+
+    Examples
+    --------
+    >>> np.lib.scimath._fix_real_abs_gt_1([0,1])
+    array([0, 1])
+
+    >>> np.lib.scimath._fix_real_abs_gt_1([0,2])
+    array([0.+0.j, 2.+0.j])
+    """
+    x = asarray(x)
+    if any(isreal(x) & (abs(x) > 1)):
+        x = _tocomplex(x)
+    return x
+
+
+def _unary_dispatcher(x):
+    return (x,)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def sqrt(x):
+    """
+    Compute the square root of x.
+
+    For negative input elements, a complex value is returned
+    (unlike `numpy.sqrt` which returns NaN).
+
+    Parameters
+    ----------
+    x : array_like
+       The input value(s).
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The square root of `x`. If `x` was a scalar, so is `out`,
+       otherwise an array is returned.
+
+    See Also
+    --------
+    numpy.sqrt
+
+    Examples
+    --------
+    For real, non-negative inputs this works just like `numpy.sqrt`:
+
+    >>> np.lib.scimath.sqrt(1)
+    1.0
+    >>> np.lib.scimath.sqrt([1, 4])
+    array([1.,  2.])
+
+    But it automatically handles negative inputs:
+
+    >>> np.lib.scimath.sqrt(-1)
+    1j
+    >>> np.lib.scimath.sqrt([-1,4])
+    array([0.+1.j, 2.+0.j])
+
+    """
+    x = _fix_real_lt_zero(x)
+    return nx.sqrt(x)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def log(x):
+    """
+    Compute the natural logarithm of `x`.
+
+    Return the "principal value" (for a description of this, see `numpy.log`)
+    of :math:`log_e(x)`. For real `x > 0`, this is a real number (``log(0)``
+    returns ``-inf`` and ``log(np.inf)`` returns ``inf``). Otherwise, the
+    complex principle value is returned.
+
+    Parameters
+    ----------
+    x : array_like
+       The value(s) whose log is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The log of the `x` value(s). If `x` was a scalar, so is `out`,
+       otherwise an array is returned.
+
+    See Also
+    --------
+    numpy.log
+
+    Notes
+    -----
+    For a log() that returns ``NAN`` when real `x < 0`, use `numpy.log`
+    (note, however, that otherwise `numpy.log` and this `log` are identical,
+    i.e., both return ``-inf`` for `x = 0`, ``inf`` for `x = inf`, and,
+    notably, the complex principle value if ``x.imag != 0``).
+
+    Examples
+    --------
+    >>> np.emath.log(np.exp(1))
+    1.0
+
+    Negative arguments are handled "correctly" (recall that
+    ``exp(log(x)) == x`` does *not* hold for real ``x < 0``):
+
+    >>> np.emath.log(-np.exp(1)) == (1 + np.pi * 1j)
+    True
+
+    """
+    x = _fix_real_lt_zero(x)
+    return nx.log(x)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def log10(x):
+    """
+    Compute the logarithm base 10 of `x`.
+
+    Return the "principal value" (for a description of this, see
+    `numpy.log10`) of :math:`log_{10}(x)`. For real `x > 0`, this
+    is a real number (``log10(0)`` returns ``-inf`` and ``log10(np.inf)``
+    returns ``inf``). Otherwise, the complex principle value is returned.
+
+    Parameters
+    ----------
+    x : array_like or scalar
+       The value(s) whose log base 10 is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The log base 10 of the `x` value(s). If `x` was a scalar, so is `out`,
+       otherwise an array object is returned.
+
+    See Also
+    --------
+    numpy.log10
+
+    Notes
+    -----
+    For a log10() that returns ``NAN`` when real `x < 0`, use `numpy.log10`
+    (note, however, that otherwise `numpy.log10` and this `log10` are
+    identical, i.e., both return ``-inf`` for `x = 0`, ``inf`` for `x = inf`,
+    and, notably, the complex principle value if ``x.imag != 0``).
+
+    Examples
+    --------
+
+    (We set the printing precision so the example can be auto-tested)
+
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.emath.log10(10**1)
+    1.0
+
+    >>> np.emath.log10([-10**1, -10**2, 10**2])
+    array([1.+1.3644j, 2.+1.3644j, 2.+0.j    ])
+
+    """
+    x = _fix_real_lt_zero(x)
+    return nx.log10(x)
+
+
+def _logn_dispatcher(n, x):
+    return (n, x,)
+
+
+@array_function_dispatch(_logn_dispatcher)
+def logn(n, x):
+    """
+    Take log base n of x.
+
+    If `x` contains negative inputs, the answer is computed and returned in the
+    complex domain.
+
+    Parameters
+    ----------
+    n : array_like
+       The integer base(s) in which the log is taken.
+    x : array_like
+       The value(s) whose log base `n` is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The log base `n` of the `x` value(s). If `x` was a scalar, so is
+       `out`, otherwise an array is returned.
+
+    Examples
+    --------
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.lib.scimath.logn(2, [4, 8])
+    array([2., 3.])
+    >>> np.lib.scimath.logn(2, [-4, -8, 8])
+    array([2.+4.5324j, 3.+4.5324j, 3.+0.j    ])
+
+    """
+    x = _fix_real_lt_zero(x)
+    n = _fix_real_lt_zero(n)
+    return nx.log(x)/nx.log(n)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def log2(x):
+    """
+    Compute the logarithm base 2 of `x`.
+
+    Return the "principal value" (for a description of this, see
+    `numpy.log2`) of :math:`log_2(x)`. For real `x > 0`, this is
+    a real number (``log2(0)`` returns ``-inf`` and ``log2(np.inf)`` returns
+    ``inf``). Otherwise, the complex principle value is returned.
+
+    Parameters
+    ----------
+    x : array_like
+       The value(s) whose log base 2 is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The log base 2 of the `x` value(s). If `x` was a scalar, so is `out`,
+       otherwise an array is returned.
+
+    See Also
+    --------
+    numpy.log2
+
+    Notes
+    -----
+    For a log2() that returns ``NAN`` when real `x < 0`, use `numpy.log2`
+    (note, however, that otherwise `numpy.log2` and this `log2` are
+    identical, i.e., both return ``-inf`` for `x = 0`, ``inf`` for `x = inf`,
+    and, notably, the complex principle value if ``x.imag != 0``).
+
+    Examples
+    --------
+    We set the printing precision so the example can be auto-tested:
+
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.emath.log2(8)
+    3.0
+    >>> np.emath.log2([-4, -8, 8])
+    array([2.+4.5324j, 3.+4.5324j, 3.+0.j    ])
+
+    """
+    x = _fix_real_lt_zero(x)
+    return nx.log2(x)
+
+
+def _power_dispatcher(x, p):
+    return (x, p)
+
+
+@array_function_dispatch(_power_dispatcher)
+def power(x, p):
+    """
+    Return x to the power p, (x**p).
+
+    If `x` contains negative values, the output is converted to the
+    complex domain.
+
+    Parameters
+    ----------
+    x : array_like
+        The input value(s).
+    p : array_like of ints
+        The power(s) to which `x` is raised. If `x` contains multiple values,
+        `p` has to either be a scalar, or contain the same number of values
+        as `x`. In the latter case, the result is
+        ``x[0]**p[0], x[1]**p[1], ...``.
+
+    Returns
+    -------
+    out : ndarray or scalar
+        The result of ``x**p``. If `x` and `p` are scalars, so is `out`,
+        otherwise an array is returned.
+
+    See Also
+    --------
+    numpy.power
+
+    Examples
+    --------
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.lib.scimath.power([2, 4], 2)
+    array([ 4, 16])
+    >>> np.lib.scimath.power([2, 4], -2)
+    array([0.25  ,  0.0625])
+    >>> np.lib.scimath.power([-2, 4], 2)
+    array([ 4.-0.j, 16.+0.j])
+
+    """
+    x = _fix_real_lt_zero(x)
+    p = _fix_int_lt_zero(p)
+    return nx.power(x, p)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def arccos(x):
+    """
+    Compute the inverse cosine of x.
+
+    Return the "principal value" (for a description of this, see
+    `numpy.arccos`) of the inverse cosine of `x`. For real `x` such that
+    `abs(x) <= 1`, this is a real number in the closed interval
+    :math:`[0, \\pi]`.  Otherwise, the complex principle value is returned.
+
+    Parameters
+    ----------
+    x : array_like or scalar
+       The value(s) whose arccos is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The inverse cosine(s) of the `x` value(s). If `x` was a scalar, so
+       is `out`, otherwise an array object is returned.
+
+    See Also
+    --------
+    numpy.arccos
+
+    Notes
+    -----
+    For an arccos() that returns ``NAN`` when real `x` is not in the
+    interval ``[-1,1]``, use `numpy.arccos`.
+
+    Examples
+    --------
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.emath.arccos(1) # a scalar is returned
+    0.0
+
+    >>> np.emath.arccos([1,2])
+    array([0.-0.j   , 0.-1.317j])
+
+    """
+    x = _fix_real_abs_gt_1(x)
+    return nx.arccos(x)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def arcsin(x):
+    """
+    Compute the inverse sine of x.
+
+    Return the "principal value" (for a description of this, see
+    `numpy.arcsin`) of the inverse sine of `x`. For real `x` such that
+    `abs(x) <= 1`, this is a real number in the closed interval
+    :math:`[-\\pi/2, \\pi/2]`.  Otherwise, the complex principle value is
+    returned.
+
+    Parameters
+    ----------
+    x : array_like or scalar
+       The value(s) whose arcsin is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The inverse sine(s) of the `x` value(s). If `x` was a scalar, so
+       is `out`, otherwise an array object is returned.
+
+    See Also
+    --------
+    numpy.arcsin
+
+    Notes
+    -----
+    For an arcsin() that returns ``NAN`` when real `x` is not in the
+    interval ``[-1,1]``, use `numpy.arcsin`.
+
+    Examples
+    --------
+    >>> np.set_printoptions(precision=4)
+
+    >>> np.emath.arcsin(0)
+    0.0
+
+    >>> np.emath.arcsin([0,1])
+    array([0.    , 1.5708])
+
+    """
+    x = _fix_real_abs_gt_1(x)
+    return nx.arcsin(x)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def arctanh(x):
+    """
+    Compute the inverse hyperbolic tangent of `x`.
+
+    Return the "principal value" (for a description of this, see
+    `numpy.arctanh`) of `arctanh(x)`. For real `x` such that
+    `abs(x) < 1`, this is a real number.  If `abs(x) > 1`, or if `x` is
+    complex, the result is complex. Finally, `x = 1` returns``inf`` and
+    `x=-1` returns ``-inf``.
+
+    Parameters
+    ----------
+    x : array_like
+       The value(s) whose arctanh is (are) required.
+
+    Returns
+    -------
+    out : ndarray or scalar
+       The inverse hyperbolic tangent(s) of the `x` value(s). If `x` was
+       a scalar so is `out`, otherwise an array is returned.
+
+
+    See Also
+    --------
+    numpy.arctanh
+
+    Notes
+    -----
+    For an arctanh() that returns ``NAN`` when real `x` is not in the
+    interval ``(-1,1)``, use `numpy.arctanh` (this latter, however, does
+    return +/-inf for `x = +/-1`).
+
+    Examples
+    --------
+    >>> np.set_printoptions(precision=4)
+
+    >>> from numpy.testing import suppress_warnings
+    >>> with suppress_warnings() as sup:
+    ...     sup.filter(RuntimeWarning)
+    ...     np.emath.arctanh(np.eye(2))
+    array([[inf,  0.],
+           [ 0., inf]])
+    >>> np.emath.arctanh([1j])
+    array([0.+0.7854j])
+
+    """
+    x = _fix_real_abs_gt_1(x)
+    return nx.arctanh(x)
diff --git a/venv/Lib/site-packages/numpy/lib/setup.py b/venv/Lib/site-packages/numpy/lib/setup.py
new file mode 100644
index 000000000..b3f441f38
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/setup.py
@@ -0,0 +1,11 @@
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+
+    config = Configuration('lib', parent_package, top_path)
+    config.add_subpackage('tests')
+    config.add_data_dir('tests/data')
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/lib/shape_base.py b/venv/Lib/site-packages/numpy/lib/shape_base.py
new file mode 100644
index 000000000..78703555e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/shape_base.py
@@ -0,0 +1,1260 @@
+import functools
+
+import numpy.core.numeric as _nx
+from numpy.core.numeric import (
+    asarray, zeros, outer, concatenate, array, asanyarray
+    )
+from numpy.core.fromnumeric import reshape, transpose
+from numpy.core.multiarray import normalize_axis_index
+from numpy.core import overrides
+from numpy.core import vstack, atleast_3d
+from numpy.core.numeric import normalize_axis_tuple
+from numpy.core.shape_base import _arrays_for_stack_dispatcher
+from numpy.lib.index_tricks import ndindex
+from numpy.matrixlib.defmatrix import matrix  # this raises all the right alarm bells
+
+
+__all__ = [
+    'column_stack', 'row_stack', 'dstack', 'array_split', 'split',
+    'hsplit', 'vsplit', 'dsplit', 'apply_over_axes', 'expand_dims',
+    'apply_along_axis', 'kron', 'tile', 'get_array_wrap', 'take_along_axis',
+    'put_along_axis'
+    ]
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+def _make_along_axis_idx(arr_shape, indices, axis):
+    # compute dimensions to iterate over
+    if not _nx.issubdtype(indices.dtype, _nx.integer):
+        raise IndexError('`indices` must be an integer array')
+    if len(arr_shape) != indices.ndim:
+        raise ValueError(
+            "`indices` and `arr` must have the same number of dimensions")
+    shape_ones = (1,) * indices.ndim
+    dest_dims = list(range(axis)) + [None] + list(range(axis+1, indices.ndim))
+
+    # build a fancy index, consisting of orthogonal aranges, with the
+    # requested index inserted at the right location
+    fancy_index = []
+    for dim, n in zip(dest_dims, arr_shape):
+        if dim is None:
+            fancy_index.append(indices)
+        else:
+            ind_shape = shape_ones[:dim] + (-1,) + shape_ones[dim+1:]
+            fancy_index.append(_nx.arange(n).reshape(ind_shape))
+
+    return tuple(fancy_index)
+
+
+def _take_along_axis_dispatcher(arr, indices, axis):
+    return (arr, indices)
+
+
+@array_function_dispatch(_take_along_axis_dispatcher)
+def take_along_axis(arr, indices, axis):
+    """
+    Take values from the input array by matching 1d index and data slices.
+
+    This iterates over matching 1d slices oriented along the specified axis in
+    the index and data arrays, and uses the former to look up values in the
+    latter. These slices can be different lengths.
+
+    Functions returning an index along an axis, like `argsort` and
+    `argpartition`, produce suitable indices for this function.
+
+    .. versionadded:: 1.15.0
+
+    Parameters
+    ----------
+    arr: ndarray (Ni..., M, Nk...)
+        Source array
+    indices: ndarray (Ni..., J, Nk...)
+        Indices to take along each 1d slice of `arr`. This must match the
+        dimension of arr, but dimensions Ni and Nj only need to broadcast
+        against `arr`.
+    axis: int
+        The axis to take 1d slices along. If axis is None, the input array is
+        treated as if it had first been flattened to 1d, for consistency with
+        `sort` and `argsort`.
+
+    Returns
+    -------
+    out: ndarray (Ni..., J, Nk...)
+        The indexed result.
+
+    Notes
+    -----
+    This is equivalent to (but faster than) the following use of `ndindex` and
+    `s_`, which sets each of ``ii`` and ``kk`` to a tuple of indices::
+
+        Ni, M, Nk = a.shape[:axis], a.shape[axis], a.shape[axis+1:]
+        J = indices.shape[axis]  # Need not equal M
+        out = np.empty(Ni + (J,) + Nk)
+
+        for ii in ndindex(Ni):
+            for kk in ndindex(Nk):
+                a_1d       = a      [ii + s_[:,] + kk]
+                indices_1d = indices[ii + s_[:,] + kk]
+                out_1d     = out    [ii + s_[:,] + kk]
+                for j in range(J):
+                    out_1d[j] = a_1d[indices_1d[j]]
+
+    Equivalently, eliminating the inner loop, the last two lines would be::
+
+                out_1d[:] = a_1d[indices_1d]
+
+    See Also
+    --------
+    take : Take along an axis, using the same indices for every 1d slice
+    put_along_axis :
+        Put values into the destination array by matching 1d index and data slices
+
+    Examples
+    --------
+
+    For this sample array
+
+    >>> a = np.array([[10, 30, 20], [60, 40, 50]])
+
+    We can sort either by using sort directly, or argsort and this function
+
+    >>> np.sort(a, axis=1)
+    array([[10, 20, 30],
+           [40, 50, 60]])
+    >>> ai = np.argsort(a, axis=1); ai
+    array([[0, 2, 1],
+           [1, 2, 0]])
+    >>> np.take_along_axis(a, ai, axis=1)
+    array([[10, 20, 30],
+           [40, 50, 60]])
+
+    The same works for max and min, if you expand the dimensions:
+
+    >>> np.expand_dims(np.max(a, axis=1), axis=1)
+    array([[30],
+           [60]])
+    >>> ai = np.expand_dims(np.argmax(a, axis=1), axis=1)
+    >>> ai
+    array([[1],
+           [0]])
+    >>> np.take_along_axis(a, ai, axis=1)
+    array([[30],
+           [60]])
+
+    If we want to get the max and min at the same time, we can stack the
+    indices first
+
+    >>> ai_min = np.expand_dims(np.argmin(a, axis=1), axis=1)
+    >>> ai_max = np.expand_dims(np.argmax(a, axis=1), axis=1)
+    >>> ai = np.concatenate([ai_min, ai_max], axis=1)
+    >>> ai
+    array([[0, 1],
+           [1, 0]])
+    >>> np.take_along_axis(a, ai, axis=1)
+    array([[10, 30],
+           [40, 60]])
+    """
+    # normalize inputs
+    if axis is None:
+        arr = arr.flat
+        arr_shape = (len(arr),)  # flatiter has no .shape
+        axis = 0
+    else:
+        axis = normalize_axis_index(axis, arr.ndim)
+        arr_shape = arr.shape
+
+    # use the fancy index
+    return arr[_make_along_axis_idx(arr_shape, indices, axis)]
+
+
+def _put_along_axis_dispatcher(arr, indices, values, axis):
+    return (arr, indices, values)
+
+
+@array_function_dispatch(_put_along_axis_dispatcher)
+def put_along_axis(arr, indices, values, axis):
+    """
+    Put values into the destination array by matching 1d index and data slices.
+
+    This iterates over matching 1d slices oriented along the specified axis in
+    the index and data arrays, and uses the former to place values into the
+    latter. These slices can be different lengths.
+
+    Functions returning an index along an axis, like `argsort` and
+    `argpartition`, produce suitable indices for this function.
+
+    .. versionadded:: 1.15.0
+
+    Parameters
+    ----------
+    arr: ndarray (Ni..., M, Nk...)
+        Destination array.
+    indices: ndarray (Ni..., J, Nk...)
+        Indices to change along each 1d slice of `arr`. This must match the
+        dimension of arr, but dimensions in Ni and Nj may be 1 to broadcast
+        against `arr`.
+    values: array_like (Ni..., J, Nk...)
+        values to insert at those indices. Its shape and dimension are
+        broadcast to match that of `indices`.
+    axis: int
+        The axis to take 1d slices along. If axis is None, the destination
+        array is treated as if a flattened 1d view had been created of it.
+
+    Notes
+    -----
+    This is equivalent to (but faster than) the following use of `ndindex` and
+    `s_`, which sets each of ``ii`` and ``kk`` to a tuple of indices::
+
+        Ni, M, Nk = a.shape[:axis], a.shape[axis], a.shape[axis+1:]
+        J = indices.shape[axis]  # Need not equal M
+
+        for ii in ndindex(Ni):
+            for kk in ndindex(Nk):
+                a_1d       = a      [ii + s_[:,] + kk]
+                indices_1d = indices[ii + s_[:,] + kk]
+                values_1d  = values [ii + s_[:,] + kk]
+                for j in range(J):
+                    a_1d[indices_1d[j]] = values_1d[j]
+
+    Equivalently, eliminating the inner loop, the last two lines would be::
+
+                a_1d[indices_1d] = values_1d
+
+    See Also
+    --------
+    take_along_axis :
+        Take values from the input array by matching 1d index and data slices
+
+    Examples
+    --------
+
+    For this sample array
+
+    >>> a = np.array([[10, 30, 20], [60, 40, 50]])
+
+    We can replace the maximum values with:
+
+    >>> ai = np.expand_dims(np.argmax(a, axis=1), axis=1)
+    >>> ai
+    array([[1],
+           [0]])
+    >>> np.put_along_axis(a, ai, 99, axis=1)
+    >>> a
+    array([[10, 99, 20],
+           [99, 40, 50]])
+
+    """
+    # normalize inputs
+    if axis is None:
+        arr = arr.flat
+        axis = 0
+        arr_shape = (len(arr),)  # flatiter has no .shape
+    else:
+        axis = normalize_axis_index(axis, arr.ndim)
+        arr_shape = arr.shape
+
+    # use the fancy index
+    arr[_make_along_axis_idx(arr_shape, indices, axis)] = values
+
+
+def _apply_along_axis_dispatcher(func1d, axis, arr, *args, **kwargs):
+    return (arr,)
+
+
+@array_function_dispatch(_apply_along_axis_dispatcher)
+def apply_along_axis(func1d, axis, arr, *args, **kwargs):
+    """
+    Apply a function to 1-D slices along the given axis.
+
+    Execute `func1d(a, *args, **kwargs)` where `func1d` operates on 1-D arrays
+    and `a` is a 1-D slice of `arr` along `axis`.
+
+    This is equivalent to (but faster than) the following use of `ndindex` and
+    `s_`, which sets each of ``ii``, ``jj``, and ``kk`` to a tuple of indices::
+
+        Ni, Nk = a.shape[:axis], a.shape[axis+1:]
+        for ii in ndindex(Ni):
+            for kk in ndindex(Nk):
+                f = func1d(arr[ii + s_[:,] + kk])
+                Nj = f.shape
+                for jj in ndindex(Nj):
+                    out[ii + jj + kk] = f[jj]
+
+    Equivalently, eliminating the inner loop, this can be expressed as::
+
+        Ni, Nk = a.shape[:axis], a.shape[axis+1:]
+        for ii in ndindex(Ni):
+            for kk in ndindex(Nk):
+                out[ii + s_[...,] + kk] = func1d(arr[ii + s_[:,] + kk])
+
+    Parameters
+    ----------
+    func1d : function (M,) -> (Nj...)
+        This function should accept 1-D arrays. It is applied to 1-D
+        slices of `arr` along the specified axis.
+    axis : integer
+        Axis along which `arr` is sliced.
+    arr : ndarray (Ni..., M, Nk...)
+        Input array.
+    args : any
+        Additional arguments to `func1d`.
+    kwargs : any
+        Additional named arguments to `func1d`.
+
+        .. versionadded:: 1.9.0
+
+
+    Returns
+    -------
+    out : ndarray  (Ni..., Nj..., Nk...)
+        The output array. The shape of `out` is identical to the shape of
+        `arr`, except along the `axis` dimension. This axis is removed, and
+        replaced with new dimensions equal to the shape of the return value
+        of `func1d`. So if `func1d` returns a scalar `out` will have one
+        fewer dimensions than `arr`.
+
+    See Also
+    --------
+    apply_over_axes : Apply a function repeatedly over multiple axes.
+
+    Examples
+    --------
+    >>> def my_func(a):
+    ...     \"\"\"Average first and last element of a 1-D array\"\"\"
+    ...     return (a[0] + a[-1]) * 0.5
+    >>> b = np.array([[1,2,3], [4,5,6], [7,8,9]])
+    >>> np.apply_along_axis(my_func, 0, b)
+    array([4., 5., 6.])
+    >>> np.apply_along_axis(my_func, 1, b)
+    array([2.,  5.,  8.])
+
+    For a function that returns a 1D array, the number of dimensions in
+    `outarr` is the same as `arr`.
+
+    >>> b = np.array([[8,1,7], [4,3,9], [5,2,6]])
+    >>> np.apply_along_axis(sorted, 1, b)
+    array([[1, 7, 8],
+           [3, 4, 9],
+           [2, 5, 6]])
+
+    For a function that returns a higher dimensional array, those dimensions
+    are inserted in place of the `axis` dimension.
+
+    >>> b = np.array([[1,2,3], [4,5,6], [7,8,9]])
+    >>> np.apply_along_axis(np.diag, -1, b)
+    array([[[1, 0, 0],
+            [0, 2, 0],
+            [0, 0, 3]],
+           [[4, 0, 0],
+            [0, 5, 0],
+            [0, 0, 6]],
+           [[7, 0, 0],
+            [0, 8, 0],
+            [0, 0, 9]]])
+    """
+    # handle negative axes
+    arr = asanyarray(arr)
+    nd = arr.ndim
+    axis = normalize_axis_index(axis, nd)
+
+    # arr, with the iteration axis at the end
+    in_dims = list(range(nd))
+    inarr_view = transpose(arr, in_dims[:axis] + in_dims[axis+1:] + [axis])
+
+    # compute indices for the iteration axes, and append a trailing ellipsis to
+    # prevent 0d arrays decaying to scalars, which fixes gh-8642
+    inds = ndindex(inarr_view.shape[:-1])
+    inds = (ind + (Ellipsis,) for ind in inds)
+
+    # invoke the function on the first item
+    try:
+        ind0 = next(inds)
+    except StopIteration as e:
+        raise ValueError(
+            'Cannot apply_along_axis when any iteration dimensions are 0'
+        ) from None
+    res = asanyarray(func1d(inarr_view[ind0], *args, **kwargs))
+
+    # build a buffer for storing evaluations of func1d.
+    # remove the requested axis, and add the new ones on the end.
+    # laid out so that each write is contiguous.
+    # for a tuple index inds, buff[inds] = func1d(inarr_view[inds])
+    buff = zeros(inarr_view.shape[:-1] + res.shape, res.dtype)
+
+    # permutation of axes such that out = buff.transpose(buff_permute)
+    buff_dims = list(range(buff.ndim))
+    buff_permute = (
+        buff_dims[0 : axis] +
+        buff_dims[buff.ndim-res.ndim : buff.ndim] +
+        buff_dims[axis : buff.ndim-res.ndim]
+    )
+
+    # matrices have a nasty __array_prepare__ and __array_wrap__
+    if not isinstance(res, matrix):
+        buff = res.__array_prepare__(buff)
+
+    # save the first result, then compute and save all remaining results
+    buff[ind0] = res
+    for ind in inds:
+        buff[ind] = asanyarray(func1d(inarr_view[ind], *args, **kwargs))
+
+    if not isinstance(res, matrix):
+        # wrap the array, to preserve subclasses
+        buff = res.__array_wrap__(buff)
+
+        # finally, rotate the inserted axes back to where they belong
+        return transpose(buff, buff_permute)
+
+    else:
+        # matrices have to be transposed first, because they collapse dimensions!
+        out_arr = transpose(buff, buff_permute)
+        return res.__array_wrap__(out_arr)
+
+
+def _apply_over_axes_dispatcher(func, a, axes):
+    return (a,)
+
+
+@array_function_dispatch(_apply_over_axes_dispatcher)
+def apply_over_axes(func, a, axes):
+    """
+    Apply a function repeatedly over multiple axes.
+
+    `func` is called as `res = func(a, axis)`, where `axis` is the first
+    element of `axes`.  The result `res` of the function call must have
+    either the same dimensions as `a` or one less dimension.  If `res`
+    has one less dimension than `a`, a dimension is inserted before
+    `axis`.  The call to `func` is then repeated for each axis in `axes`,
+    with `res` as the first argument.
+
+    Parameters
+    ----------
+    func : function
+        This function must take two arguments, `func(a, axis)`.
+    a : array_like
+        Input array.
+    axes : array_like
+        Axes over which `func` is applied; the elements must be integers.
+
+    Returns
+    -------
+    apply_over_axis : ndarray
+        The output array.  The number of dimensions is the same as `a`,
+        but the shape can be different.  This depends on whether `func`
+        changes the shape of its output with respect to its input.
+
+    See Also
+    --------
+    apply_along_axis :
+        Apply a function to 1-D slices of an array along the given axis.
+
+    Notes
+    ------
+    This function is equivalent to tuple axis arguments to reorderable ufuncs
+    with keepdims=True. Tuple axis arguments to ufuncs have been available since
+    version 1.7.0.
+
+    Examples
+    --------
+    >>> a = np.arange(24).reshape(2,3,4)
+    >>> a
+    array([[[ 0,  1,  2,  3],
+            [ 4,  5,  6,  7],
+            [ 8,  9, 10, 11]],
+           [[12, 13, 14, 15],
+            [16, 17, 18, 19],
+            [20, 21, 22, 23]]])
+
+    Sum over axes 0 and 2. The result has same number of dimensions
+    as the original array:
+
+    >>> np.apply_over_axes(np.sum, a, [0,2])
+    array([[[ 60],
+            [ 92],
+            [124]]])
+
+    Tuple axis arguments to ufuncs are equivalent:
+
+    >>> np.sum(a, axis=(0,2), keepdims=True)
+    array([[[ 60],
+            [ 92],
+            [124]]])
+
+    """
+    val = asarray(a)
+    N = a.ndim
+    if array(axes).ndim == 0:
+        axes = (axes,)
+    for axis in axes:
+        if axis < 0:
+            axis = N + axis
+        args = (val, axis)
+        res = func(*args)
+        if res.ndim == val.ndim:
+            val = res
+        else:
+            res = expand_dims(res, axis)
+            if res.ndim == val.ndim:
+                val = res
+            else:
+                raise ValueError("function is not returning "
+                                 "an array of the correct shape")
+    return val
+
+
+def _expand_dims_dispatcher(a, axis):
+    return (a,)
+
+
+@array_function_dispatch(_expand_dims_dispatcher)
+def expand_dims(a, axis):
+    """
+    Expand the shape of an array.
+
+    Insert a new axis that will appear at the `axis` position in the expanded
+    array shape.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    axis : int or tuple of ints
+        Position in the expanded axes where the new axis (or axes) is placed.
+
+        .. deprecated:: 1.13.0
+            Passing an axis where ``axis > a.ndim`` will be treated as
+            ``axis == a.ndim``, and passing ``axis < -a.ndim - 1`` will
+            be treated as ``axis == 0``. This behavior is deprecated.
+
+        .. versionchanged:: 1.18.0
+            A tuple of axes is now supported.  Out of range axes as
+            described above are now forbidden and raise an `AxisError`.
+
+    Returns
+    -------
+    result : ndarray
+        View of `a` with the number of dimensions increased.
+
+    See Also
+    --------
+    squeeze : The inverse operation, removing singleton dimensions
+    reshape : Insert, remove, and combine dimensions, and resize existing ones
+    doc.indexing, atleast_1d, atleast_2d, atleast_3d
+
+    Examples
+    --------
+    >>> x = np.array([1, 2])
+    >>> x.shape
+    (2,)
+
+    The following is equivalent to ``x[np.newaxis, :]`` or ``x[np.newaxis]``:
+
+    >>> y = np.expand_dims(x, axis=0)
+    >>> y
+    array([[1, 2]])
+    >>> y.shape
+    (1, 2)
+
+    The following is equivalent to ``x[:, np.newaxis]``:
+
+    >>> y = np.expand_dims(x, axis=1)
+    >>> y
+    array([[1],
+           [2]])
+    >>> y.shape
+    (2, 1)
+
+    ``axis`` may also be a tuple:
+
+    >>> y = np.expand_dims(x, axis=(0, 1))
+    >>> y
+    array([[[1, 2]]])
+
+    >>> y = np.expand_dims(x, axis=(2, 0))
+    >>> y
+    array([[[1],
+            [2]]])
+
+    Note that some examples may use ``None`` instead of ``np.newaxis``.  These
+    are the same objects:
+
+    >>> np.newaxis is None
+    True
+
+    """
+    if isinstance(a, matrix):
+        a = asarray(a)
+    else:
+        a = asanyarray(a)
+
+    if type(axis) not in (tuple, list):
+        axis = (axis,)
+
+    out_ndim = len(axis) + a.ndim
+    axis = normalize_axis_tuple(axis, out_ndim)
+
+    shape_it = iter(a.shape)
+    shape = [1 if ax in axis else next(shape_it) for ax in range(out_ndim)]
+
+    return a.reshape(shape)
+
+
+row_stack = vstack
+
+
+def _column_stack_dispatcher(tup):
+    return _arrays_for_stack_dispatcher(tup)
+
+
+@array_function_dispatch(_column_stack_dispatcher)
+def column_stack(tup):
+    """
+    Stack 1-D arrays as columns into a 2-D array.
+
+    Take a sequence of 1-D arrays and stack them as columns
+    to make a single 2-D array. 2-D arrays are stacked as-is,
+    just like with `hstack`.  1-D arrays are turned into 2-D columns
+    first.
+
+    Parameters
+    ----------
+    tup : sequence of 1-D or 2-D arrays.
+        Arrays to stack. All of them must have the same first dimension.
+
+    Returns
+    -------
+    stacked : 2-D array
+        The array formed by stacking the given arrays.
+
+    See Also
+    --------
+    stack, hstack, vstack, concatenate
+
+    Examples
+    --------
+    >>> a = np.array((1,2,3))
+    >>> b = np.array((2,3,4))
+    >>> np.column_stack((a,b))
+    array([[1, 2],
+           [2, 3],
+           [3, 4]])
+
+    """
+    if not overrides.ARRAY_FUNCTION_ENABLED:
+        # raise warning if necessary
+        _arrays_for_stack_dispatcher(tup, stacklevel=2)
+
+    arrays = []
+    for v in tup:
+        arr = array(v, copy=False, subok=True)
+        if arr.ndim < 2:
+            arr = array(arr, copy=False, subok=True, ndmin=2).T
+        arrays.append(arr)
+    return _nx.concatenate(arrays, 1)
+
+
+def _dstack_dispatcher(tup):
+    return _arrays_for_stack_dispatcher(tup)
+
+
+@array_function_dispatch(_dstack_dispatcher)
+def dstack(tup):
+    """
+    Stack arrays in sequence depth wise (along third axis).
+
+    This is equivalent to concatenation along the third axis after 2-D arrays
+    of shape `(M,N)` have been reshaped to `(M,N,1)` and 1-D arrays of shape
+    `(N,)` have been reshaped to `(1,N,1)`. Rebuilds arrays divided by
+    `dsplit`.
+
+    This function makes most sense for arrays with up to 3 dimensions. For
+    instance, for pixel-data with a height (first axis), width (second axis),
+    and r/g/b channels (third axis). The functions `concatenate`, `stack` and
+    `block` provide more general stacking and concatenation operations.
+
+    Parameters
+    ----------
+    tup : sequence of arrays
+        The arrays must have the same shape along all but the third axis.
+        1-D or 2-D arrays must have the same shape.
+
+    Returns
+    -------
+    stacked : ndarray
+        The array formed by stacking the given arrays, will be at least 3-D.
+
+    See Also
+    --------
+    concatenate : Join a sequence of arrays along an existing axis.
+    stack : Join a sequence of arrays along a new axis.
+    block : Assemble an nd-array from nested lists of blocks.
+    vstack : Stack arrays in sequence vertically (row wise).
+    hstack : Stack arrays in sequence horizontally (column wise).
+    column_stack : Stack 1-D arrays as columns into a 2-D array.
+    dsplit : Split array along third axis.
+
+    Examples
+    --------
+    >>> a = np.array((1,2,3))
+    >>> b = np.array((2,3,4))
+    >>> np.dstack((a,b))
+    array([[[1, 2],
+            [2, 3],
+            [3, 4]]])
+
+    >>> a = np.array([[1],[2],[3]])
+    >>> b = np.array([[2],[3],[4]])
+    >>> np.dstack((a,b))
+    array([[[1, 2]],
+           [[2, 3]],
+           [[3, 4]]])
+
+    """
+    if not overrides.ARRAY_FUNCTION_ENABLED:
+        # raise warning if necessary
+        _arrays_for_stack_dispatcher(tup, stacklevel=2)
+
+    arrs = atleast_3d(*tup)
+    if not isinstance(arrs, list):
+        arrs = [arrs]
+    return _nx.concatenate(arrs, 2)
+
+
+def _replace_zero_by_x_arrays(sub_arys):
+    for i in range(len(sub_arys)):
+        if _nx.ndim(sub_arys[i]) == 0:
+            sub_arys[i] = _nx.empty(0, dtype=sub_arys[i].dtype)
+        elif _nx.sometrue(_nx.equal(_nx.shape(sub_arys[i]), 0)):
+            sub_arys[i] = _nx.empty(0, dtype=sub_arys[i].dtype)
+    return sub_arys
+
+
+def _array_split_dispatcher(ary, indices_or_sections, axis=None):
+    return (ary, indices_or_sections)
+
+
+@array_function_dispatch(_array_split_dispatcher)
+def array_split(ary, indices_or_sections, axis=0):
+    """
+    Split an array into multiple sub-arrays.
+
+    Please refer to the ``split`` documentation.  The only difference
+    between these functions is that ``array_split`` allows
+    `indices_or_sections` to be an integer that does *not* equally
+    divide the axis. For an array of length l that should be split
+    into n sections, it returns l % n sub-arrays of size l//n + 1
+    and the rest of size l//n.
+
+    See Also
+    --------
+    split : Split array into multiple sub-arrays of equal size.
+
+    Examples
+    --------
+    >>> x = np.arange(8.0)
+    >>> np.array_split(x, 3)
+        [array([0.,  1.,  2.]), array([3.,  4.,  5.]), array([6.,  7.])]
+
+    >>> x = np.arange(7.0)
+    >>> np.array_split(x, 3)
+        [array([0.,  1.,  2.]), array([3.,  4.]), array([5.,  6.])]
+
+    """
+    try:
+        Ntotal = ary.shape[axis]
+    except AttributeError:
+        Ntotal = len(ary)
+    try:
+        # handle array case.
+        Nsections = len(indices_or_sections) + 1
+        div_points = [0] + list(indices_or_sections) + [Ntotal]
+    except TypeError:
+        # indices_or_sections is a scalar, not an array.
+        Nsections = int(indices_or_sections)
+        if Nsections <= 0:
+            raise ValueError('number sections must be larger than 0.')
+        Neach_section, extras = divmod(Ntotal, Nsections)
+        section_sizes = ([0] +
+                         extras * [Neach_section+1] +
+                         (Nsections-extras) * [Neach_section])
+        div_points = _nx.array(section_sizes, dtype=_nx.intp).cumsum()
+
+    sub_arys = []
+    sary = _nx.swapaxes(ary, axis, 0)
+    for i in range(Nsections):
+        st = div_points[i]
+        end = div_points[i + 1]
+        sub_arys.append(_nx.swapaxes(sary[st:end], axis, 0))
+
+    return sub_arys
+
+
+def _split_dispatcher(ary, indices_or_sections, axis=None):
+    return (ary, indices_or_sections)
+
+
+@array_function_dispatch(_split_dispatcher)
+def split(ary, indices_or_sections, axis=0):
+    """
+    Split an array into multiple sub-arrays as views into `ary`.
+
+    Parameters
+    ----------
+    ary : ndarray
+        Array to be divided into sub-arrays.
+    indices_or_sections : int or 1-D array
+        If `indices_or_sections` is an integer, N, the array will be divided
+        into N equal arrays along `axis`.  If such a split is not possible,
+        an error is raised.
+
+        If `indices_or_sections` is a 1-D array of sorted integers, the entries
+        indicate where along `axis` the array is split.  For example,
+        ``[2, 3]`` would, for ``axis=0``, result in
+
+          - ary[:2]
+          - ary[2:3]
+          - ary[3:]
+
+        If an index exceeds the dimension of the array along `axis`,
+        an empty sub-array is returned correspondingly.
+    axis : int, optional
+        The axis along which to split, default is 0.
+
+    Returns
+    -------
+    sub-arrays : list of ndarrays
+        A list of sub-arrays as views into `ary`.
+
+    Raises
+    ------
+    ValueError
+        If `indices_or_sections` is given as an integer, but
+        a split does not result in equal division.
+
+    See Also
+    --------
+    array_split : Split an array into multiple sub-arrays of equal or
+                  near-equal size.  Does not raise an exception if
+                  an equal division cannot be made.
+    hsplit : Split array into multiple sub-arrays horizontally (column-wise).
+    vsplit : Split array into multiple sub-arrays vertically (row wise).
+    dsplit : Split array into multiple sub-arrays along the 3rd axis (depth).
+    concatenate : Join a sequence of arrays along an existing axis.
+    stack : Join a sequence of arrays along a new axis.
+    hstack : Stack arrays in sequence horizontally (column wise).
+    vstack : Stack arrays in sequence vertically (row wise).
+    dstack : Stack arrays in sequence depth wise (along third dimension).
+
+    Examples
+    --------
+    >>> x = np.arange(9.0)
+    >>> np.split(x, 3)
+    [array([0.,  1.,  2.]), array([3.,  4.,  5.]), array([6.,  7.,  8.])]
+
+    >>> x = np.arange(8.0)
+    >>> np.split(x, [3, 5, 6, 10])
+    [array([0.,  1.,  2.]),
+     array([3.,  4.]),
+     array([5.]),
+     array([6.,  7.]),
+     array([], dtype=float64)]
+
+    """
+    try:
+        len(indices_or_sections)
+    except TypeError:
+        sections = indices_or_sections
+        N = ary.shape[axis]
+        if N % sections:
+            raise ValueError(
+                'array split does not result in an equal division')
+    return array_split(ary, indices_or_sections, axis)
+
+
+def _hvdsplit_dispatcher(ary, indices_or_sections):
+    return (ary, indices_or_sections)
+
+
+@array_function_dispatch(_hvdsplit_dispatcher)
+def hsplit(ary, indices_or_sections):
+    """
+    Split an array into multiple sub-arrays horizontally (column-wise).
+
+    Please refer to the `split` documentation.  `hsplit` is equivalent
+    to `split` with ``axis=1``, the array is always split along the second
+    axis regardless of the array dimension.
+
+    See Also
+    --------
+    split : Split an array into multiple sub-arrays of equal size.
+
+    Examples
+    --------
+    >>> x = np.arange(16.0).reshape(4, 4)
+    >>> x
+    array([[ 0.,   1.,   2.,   3.],
+           [ 4.,   5.,   6.,   7.],
+           [ 8.,   9.,  10.,  11.],
+           [12.,  13.,  14.,  15.]])
+    >>> np.hsplit(x, 2)
+    [array([[  0.,   1.],
+           [  4.,   5.],
+           [  8.,   9.],
+           [12.,  13.]]),
+     array([[  2.,   3.],
+           [  6.,   7.],
+           [10.,  11.],
+           [14.,  15.]])]
+    >>> np.hsplit(x, np.array([3, 6]))
+    [array([[ 0.,   1.,   2.],
+           [ 4.,   5.,   6.],
+           [ 8.,   9.,  10.],
+           [12.,  13.,  14.]]),
+     array([[ 3.],
+           [ 7.],
+           [11.],
+           [15.]]),
+     array([], shape=(4, 0), dtype=float64)]
+
+    With a higher dimensional array the split is still along the second axis.
+
+    >>> x = np.arange(8.0).reshape(2, 2, 2)
+    >>> x
+    array([[[0.,  1.],
+            [2.,  3.]],
+           [[4.,  5.],
+            [6.,  7.]]])
+    >>> np.hsplit(x, 2)
+    [array([[[0.,  1.]],
+           [[4.,  5.]]]),
+     array([[[2.,  3.]],
+           [[6.,  7.]]])]
+
+    """
+    if _nx.ndim(ary) == 0:
+        raise ValueError('hsplit only works on arrays of 1 or more dimensions')
+    if ary.ndim > 1:
+        return split(ary, indices_or_sections, 1)
+    else:
+        return split(ary, indices_or_sections, 0)
+
+
+@array_function_dispatch(_hvdsplit_dispatcher)
+def vsplit(ary, indices_or_sections):
+    """
+    Split an array into multiple sub-arrays vertically (row-wise).
+
+    Please refer to the ``split`` documentation.  ``vsplit`` is equivalent
+    to ``split`` with `axis=0` (default), the array is always split along the
+    first axis regardless of the array dimension.
+
+    See Also
+    --------
+    split : Split an array into multiple sub-arrays of equal size.
+
+    Examples
+    --------
+    >>> x = np.arange(16.0).reshape(4, 4)
+    >>> x
+    array([[ 0.,   1.,   2.,   3.],
+           [ 4.,   5.,   6.,   7.],
+           [ 8.,   9.,  10.,  11.],
+           [12.,  13.,  14.,  15.]])
+    >>> np.vsplit(x, 2)
+    [array([[0., 1., 2., 3.],
+           [4., 5., 6., 7.]]), array([[ 8.,  9., 10., 11.],
+           [12., 13., 14., 15.]])]
+    >>> np.vsplit(x, np.array([3, 6]))
+    [array([[ 0.,  1.,  2.,  3.],
+           [ 4.,  5.,  6.,  7.],
+           [ 8.,  9., 10., 11.]]), array([[12., 13., 14., 15.]]), array([], shape=(0, 4), dtype=float64)]
+
+    With a higher dimensional array the split is still along the first axis.
+
+    >>> x = np.arange(8.0).reshape(2, 2, 2)
+    >>> x
+    array([[[0.,  1.],
+            [2.,  3.]],
+           [[4.,  5.],
+            [6.,  7.]]])
+    >>> np.vsplit(x, 2)
+    [array([[[0., 1.],
+            [2., 3.]]]), array([[[4., 5.],
+            [6., 7.]]])]
+
+    """
+    if _nx.ndim(ary) < 2:
+        raise ValueError('vsplit only works on arrays of 2 or more dimensions')
+    return split(ary, indices_or_sections, 0)
+
+
+@array_function_dispatch(_hvdsplit_dispatcher)
+def dsplit(ary, indices_or_sections):
+    """
+    Split array into multiple sub-arrays along the 3rd axis (depth).
+
+    Please refer to the `split` documentation.  `dsplit` is equivalent
+    to `split` with ``axis=2``, the array is always split along the third
+    axis provided the array dimension is greater than or equal to 3.
+
+    See Also
+    --------
+    split : Split an array into multiple sub-arrays of equal size.
+
+    Examples
+    --------
+    >>> x = np.arange(16.0).reshape(2, 2, 4)
+    >>> x
+    array([[[ 0.,   1.,   2.,   3.],
+            [ 4.,   5.,   6.,   7.]],
+           [[ 8.,   9.,  10.,  11.],
+            [12.,  13.,  14.,  15.]]])
+    >>> np.dsplit(x, 2)
+    [array([[[ 0.,  1.],
+            [ 4.,  5.]],
+           [[ 8.,  9.],
+            [12., 13.]]]), array([[[ 2.,  3.],
+            [ 6.,  7.]],
+           [[10., 11.],
+            [14., 15.]]])]
+    >>> np.dsplit(x, np.array([3, 6]))
+    [array([[[ 0.,   1.,   2.],
+            [ 4.,   5.,   6.]],
+           [[ 8.,   9.,  10.],
+            [12.,  13.,  14.]]]),
+     array([[[ 3.],
+            [ 7.]],
+           [[11.],
+            [15.]]]),
+    array([], shape=(2, 2, 0), dtype=float64)]
+    """
+    if _nx.ndim(ary) < 3:
+        raise ValueError('dsplit only works on arrays of 3 or more dimensions')
+    return split(ary, indices_or_sections, 2)
+
+def get_array_prepare(*args):
+    """Find the wrapper for the array with the highest priority.
+
+    In case of ties, leftmost wins. If no wrapper is found, return None
+    """
+    wrappers = sorted((getattr(x, '__array_priority__', 0), -i,
+                 x.__array_prepare__) for i, x in enumerate(args)
+                                   if hasattr(x, '__array_prepare__'))
+    if wrappers:
+        return wrappers[-1][-1]
+    return None
+
+def get_array_wrap(*args):
+    """Find the wrapper for the array with the highest priority.
+
+    In case of ties, leftmost wins. If no wrapper is found, return None
+    """
+    wrappers = sorted((getattr(x, '__array_priority__', 0), -i,
+                 x.__array_wrap__) for i, x in enumerate(args)
+                                   if hasattr(x, '__array_wrap__'))
+    if wrappers:
+        return wrappers[-1][-1]
+    return None
+
+
+def _kron_dispatcher(a, b):
+    return (a, b)
+
+
+@array_function_dispatch(_kron_dispatcher)
+def kron(a, b):
+    """
+    Kronecker product of two arrays.
+
+    Computes the Kronecker product, a composite array made of blocks of the
+    second array scaled by the first.
+
+    Parameters
+    ----------
+    a, b : array_like
+
+    Returns
+    -------
+    out : ndarray
+
+    See Also
+    --------
+    outer : The outer product
+
+    Notes
+    -----
+    The function assumes that the number of dimensions of `a` and `b`
+    are the same, if necessary prepending the smallest with ones.
+    If `a.shape = (r0,r1,..,rN)` and `b.shape = (s0,s1,...,sN)`,
+    the Kronecker product has shape `(r0*s0, r1*s1, ..., rN*SN)`.
+    The elements are products of elements from `a` and `b`, organized
+    explicitly by::
+
+        kron(a,b)[k0,k1,...,kN] = a[i0,i1,...,iN] * b[j0,j1,...,jN]
+
+    where::
+
+        kt = it * st + jt,  t = 0,...,N
+
+    In the common 2-D case (N=1), the block structure can be visualized::
+
+        [[ a[0,0]*b,   a[0,1]*b,  ... , a[0,-1]*b  ],
+         [  ...                              ...   ],
+         [ a[-1,0]*b,  a[-1,1]*b, ... , a[-1,-1]*b ]]
+
+
+    Examples
+    --------
+    >>> np.kron([1,10,100], [5,6,7])
+    array([  5,   6,   7, ..., 500, 600, 700])
+    >>> np.kron([5,6,7], [1,10,100])
+    array([  5,  50, 500, ...,   7,  70, 700])
+
+    >>> np.kron(np.eye(2), np.ones((2,2)))
+    array([[1.,  1.,  0.,  0.],
+           [1.,  1.,  0.,  0.],
+           [0.,  0.,  1.,  1.],
+           [0.,  0.,  1.,  1.]])
+
+    >>> a = np.arange(100).reshape((2,5,2,5))
+    >>> b = np.arange(24).reshape((2,3,4))
+    >>> c = np.kron(a,b)
+    >>> c.shape
+    (2, 10, 6, 20)
+    >>> I = (1,3,0,2)
+    >>> J = (0,2,1)
+    >>> J1 = (0,) + J             # extend to ndim=4
+    >>> S1 = (1,) + b.shape
+    >>> K = tuple(np.array(I) * np.array(S1) + np.array(J1))
+    >>> c[K] == a[I]*b[J]
+    True
+
+    """
+    b = asanyarray(b)
+    a = array(a, copy=False, subok=True, ndmin=b.ndim)
+    ndb, nda = b.ndim, a.ndim
+    if (nda == 0 or ndb == 0):
+        return _nx.multiply(a, b)
+    as_ = a.shape
+    bs = b.shape
+    if not a.flags.contiguous:
+        a = reshape(a, as_)
+    if not b.flags.contiguous:
+        b = reshape(b, bs)
+    nd = ndb
+    if (ndb != nda):
+        if (ndb > nda):
+            as_ = (1,)*(ndb-nda) + as_
+        else:
+            bs = (1,)*(nda-ndb) + bs
+            nd = nda
+    result = outer(a, b).reshape(as_+bs)
+    axis = nd-1
+    for _ in range(nd):
+        result = concatenate(result, axis=axis)
+    wrapper = get_array_prepare(a, b)
+    if wrapper is not None:
+        result = wrapper(result)
+    wrapper = get_array_wrap(a, b)
+    if wrapper is not None:
+        result = wrapper(result)
+    return result
+
+
+def _tile_dispatcher(A, reps):
+    return (A, reps)
+
+
+@array_function_dispatch(_tile_dispatcher)
+def tile(A, reps):
+    """
+    Construct an array by repeating A the number of times given by reps.
+
+    If `reps` has length ``d``, the result will have dimension of
+    ``max(d, A.ndim)``.
+
+    If ``A.ndim < d``, `A` is promoted to be d-dimensional by prepending new
+    axes. So a shape (3,) array is promoted to (1, 3) for 2-D replication,
+    or shape (1, 1, 3) for 3-D replication. If this is not the desired
+    behavior, promote `A` to d-dimensions manually before calling this
+    function.
+
+    If ``A.ndim > d``, `reps` is promoted to `A`.ndim by pre-pending 1's to it.
+    Thus for an `A` of shape (2, 3, 4, 5), a `reps` of (2, 2) is treated as
+    (1, 1, 2, 2).
+
+    Note : Although tile may be used for broadcasting, it is strongly
+    recommended to use numpy's broadcasting operations and functions.
+
+    Parameters
+    ----------
+    A : array_like
+        The input array.
+    reps : array_like
+        The number of repetitions of `A` along each axis.
+
+    Returns
+    -------
+    c : ndarray
+        The tiled output array.
+
+    See Also
+    --------
+    repeat : Repeat elements of an array.
+    broadcast_to : Broadcast an array to a new shape
+
+    Examples
+    --------
+    >>> a = np.array([0, 1, 2])
+    >>> np.tile(a, 2)
+    array([0, 1, 2, 0, 1, 2])
+    >>> np.tile(a, (2, 2))
+    array([[0, 1, 2, 0, 1, 2],
+           [0, 1, 2, 0, 1, 2]])
+    >>> np.tile(a, (2, 1, 2))
+    array([[[0, 1, 2, 0, 1, 2]],
+           [[0, 1, 2, 0, 1, 2]]])
+
+    >>> b = np.array([[1, 2], [3, 4]])
+    >>> np.tile(b, 2)
+    array([[1, 2, 1, 2],
+           [3, 4, 3, 4]])
+    >>> np.tile(b, (2, 1))
+    array([[1, 2],
+           [3, 4],
+           [1, 2],
+           [3, 4]])
+
+    >>> c = np.array([1,2,3,4])
+    >>> np.tile(c,(4,1))
+    array([[1, 2, 3, 4],
+           [1, 2, 3, 4],
+           [1, 2, 3, 4],
+           [1, 2, 3, 4]])
+    """
+    try:
+        tup = tuple(reps)
+    except TypeError:
+        tup = (reps,)
+    d = len(tup)
+    if all(x == 1 for x in tup) and isinstance(A, _nx.ndarray):
+        # Fixes the problem that the function does not make a copy if A is a
+        # numpy array and the repetitions are 1 in all dimensions
+        return _nx.array(A, copy=True, subok=True, ndmin=d)
+    else:
+        # Note that no copy of zero-sized arrays is made. However since they
+        # have no data there is no risk of an inadvertent overwrite.
+        c = _nx.array(A, copy=False, subok=True, ndmin=d)
+    if (d < c.ndim):
+        tup = (1,)*(c.ndim-d) + tup
+    shape_out = tuple(s*t for s, t in zip(c.shape, tup))
+    n = c.size
+    if n > 0:
+        for dim_in, nrep in zip(c.shape, tup):
+            if nrep != 1:
+                c = c.reshape(-1, n).repeat(nrep, 0)
+            n //= dim_in
+    return c.reshape(shape_out)
diff --git a/venv/Lib/site-packages/numpy/lib/stride_tricks.py b/venv/Lib/site-packages/numpy/lib/stride_tricks.py
new file mode 100644
index 000000000..502235bdf
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/stride_tricks.py
@@ -0,0 +1,265 @@
+"""
+Utilities that manipulate strides to achieve desirable effects.
+
+An explanation of strides can be found in the "ndarray.rst" file in the
+NumPy reference guide.
+
+"""
+import numpy as np
+from numpy.core.overrides import array_function_dispatch
+
+__all__ = ['broadcast_to', 'broadcast_arrays']
+
+
+class DummyArray:
+    """Dummy object that just exists to hang __array_interface__ dictionaries
+    and possibly keep alive a reference to a base array.
+    """
+
+    def __init__(self, interface, base=None):
+        self.__array_interface__ = interface
+        self.base = base
+
+
+def _maybe_view_as_subclass(original_array, new_array):
+    if type(original_array) is not type(new_array):
+        # if input was an ndarray subclass and subclasses were OK,
+        # then view the result as that subclass.
+        new_array = new_array.view(type=type(original_array))
+        # Since we have done something akin to a view from original_array, we
+        # should let the subclass finalize (if it has it implemented, i.e., is
+        # not None).
+        if new_array.__array_finalize__:
+            new_array.__array_finalize__(original_array)
+    return new_array
+
+
+def as_strided(x, shape=None, strides=None, subok=False, writeable=True):
+    """
+    Create a view into the array with the given shape and strides.
+
+    .. warning:: This function has to be used with extreme care, see notes.
+
+    Parameters
+    ----------
+    x : ndarray
+        Array to create a new.
+    shape : sequence of int, optional
+        The shape of the new array. Defaults to ``x.shape``.
+    strides : sequence of int, optional
+        The strides of the new array. Defaults to ``x.strides``.
+    subok : bool, optional
+        .. versionadded:: 1.10
+
+        If True, subclasses are preserved.
+    writeable : bool, optional
+        .. versionadded:: 1.12
+
+        If set to False, the returned array will always be readonly.
+        Otherwise it will be writable if the original array was. It
+        is advisable to set this to False if possible (see Notes).
+
+    Returns
+    -------
+    view : ndarray
+
+    See also
+    --------
+    broadcast_to: broadcast an array to a given shape.
+    reshape : reshape an array.
+
+    Notes
+    -----
+    ``as_strided`` creates a view into the array given the exact strides
+    and shape. This means it manipulates the internal data structure of
+    ndarray and, if done incorrectly, the array elements can point to
+    invalid memory and can corrupt results or crash your program.
+    It is advisable to always use the original ``x.strides`` when
+    calculating new strides to avoid reliance on a contiguous memory
+    layout.
+
+    Furthermore, arrays created with this function often contain self
+    overlapping memory, so that two elements are identical.
+    Vectorized write operations on such arrays will typically be
+    unpredictable. They may even give different results for small, large,
+    or transposed arrays.
+    Since writing to these arrays has to be tested and done with great
+    care, you may want to use ``writeable=False`` to avoid accidental write
+    operations.
+
+    For these reasons it is advisable to avoid ``as_strided`` when
+    possible.
+    """
+    # first convert input to array, possibly keeping subclass
+    x = np.array(x, copy=False, subok=subok)
+    interface = dict(x.__array_interface__)
+    if shape is not None:
+        interface['shape'] = tuple(shape)
+    if strides is not None:
+        interface['strides'] = tuple(strides)
+
+    array = np.asarray(DummyArray(interface, base=x))
+    # The route via `__interface__` does not preserve structured
+    # dtypes. Since dtype should remain unchanged, we set it explicitly.
+    array.dtype = x.dtype
+
+    view = _maybe_view_as_subclass(x, array)
+
+    if view.flags.writeable and not writeable:
+        view.flags.writeable = False
+
+    return view
+
+
+def _broadcast_to(array, shape, subok, readonly):
+    shape = tuple(shape) if np.iterable(shape) else (shape,)
+    array = np.array(array, copy=False, subok=subok)
+    if not shape and array.shape:
+        raise ValueError('cannot broadcast a non-scalar to a scalar array')
+    if any(size < 0 for size in shape):
+        raise ValueError('all elements of broadcast shape must be non-'
+                         'negative')
+    extras = []
+    it = np.nditer(
+        (array,), flags=['multi_index', 'refs_ok', 'zerosize_ok'] + extras,
+        op_flags=['readonly'], itershape=shape, order='C')
+    with it:
+        # never really has writebackifcopy semantics
+        broadcast = it.itviews[0]
+    result = _maybe_view_as_subclass(array, broadcast)
+    # In a future version this will go away
+    if not readonly and array.flags._writeable_no_warn:
+        result.flags.writeable = True
+        result.flags._warn_on_write = True
+    return result
+
+
+def _broadcast_to_dispatcher(array, shape, subok=None):
+    return (array,)
+
+
+@array_function_dispatch(_broadcast_to_dispatcher, module='numpy')
+def broadcast_to(array, shape, subok=False):
+    """Broadcast an array to a new shape.
+
+    Parameters
+    ----------
+    array : array_like
+        The array to broadcast.
+    shape : tuple
+        The shape of the desired array.
+    subok : bool, optional
+        If True, then sub-classes will be passed-through, otherwise
+        the returned array will be forced to be a base-class array (default).
+
+    Returns
+    -------
+    broadcast : array
+        A readonly view on the original array with the given shape. It is
+        typically not contiguous. Furthermore, more than one element of a
+        broadcasted array may refer to a single memory location.
+
+    Raises
+    ------
+    ValueError
+        If the array is not compatible with the new shape according to NumPy's
+        broadcasting rules.
+
+    Notes
+    -----
+    .. versionadded:: 1.10.0
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3])
+    >>> np.broadcast_to(x, (3, 3))
+    array([[1, 2, 3],
+           [1, 2, 3],
+           [1, 2, 3]])
+    """
+    return _broadcast_to(array, shape, subok=subok, readonly=True)
+
+
+def _broadcast_shape(*args):
+    """Returns the shape of the arrays that would result from broadcasting the
+    supplied arrays against each other.
+    """
+    # use the old-iterator because np.nditer does not handle size 0 arrays
+    # consistently
+    b = np.broadcast(*args[:32])
+    # unfortunately, it cannot handle 32 or more arguments directly
+    for pos in range(32, len(args), 31):
+        # ironically, np.broadcast does not properly handle np.broadcast
+        # objects (it treats them as scalars)
+        # use broadcasting to avoid allocating the full array
+        b = broadcast_to(0, b.shape)
+        b = np.broadcast(b, *args[pos:(pos + 31)])
+    return b.shape
+
+
+def _broadcast_arrays_dispatcher(*args, subok=None):
+    return args
+
+
+@array_function_dispatch(_broadcast_arrays_dispatcher, module='numpy')
+def broadcast_arrays(*args, subok=False):
+    """
+    Broadcast any number of arrays against each other.
+
+    Parameters
+    ----------
+    `*args` : array_likes
+        The arrays to broadcast.
+
+    subok : bool, optional
+        If True, then sub-classes will be passed-through, otherwise
+        the returned arrays will be forced to be a base-class array (default).
+
+    Returns
+    -------
+    broadcasted : list of arrays
+        These arrays are views on the original arrays.  They are typically
+        not contiguous.  Furthermore, more than one element of a
+        broadcasted array may refer to a single memory location. If you need
+        to write to the arrays, make copies first. While you can set the
+        ``writable`` flag True, writing to a single output value may end up
+        changing more than one location in the output array.
+
+        .. deprecated:: 1.17
+            The output is currently marked so that if written to, a deprecation
+            warning will be emitted. A future version will set the
+            ``writable`` flag False so writing to it will raise an error.
+
+    Examples
+    --------
+    >>> x = np.array([[1,2,3]])
+    >>> y = np.array([[4],[5]])
+    >>> np.broadcast_arrays(x, y)
+    [array([[1, 2, 3],
+           [1, 2, 3]]), array([[4, 4, 4],
+           [5, 5, 5]])]
+
+    Here is a useful idiom for getting contiguous copies instead of
+    non-contiguous views.
+
+    >>> [np.array(a) for a in np.broadcast_arrays(x, y)]
+    [array([[1, 2, 3],
+           [1, 2, 3]]), array([[4, 4, 4],
+           [5, 5, 5]])]
+
+    """
+    # nditer is not used here to avoid the limit of 32 arrays.
+    # Otherwise, something like the following one-liner would suffice:
+    # return np.nditer(args, flags=['multi_index', 'zerosize_ok'],
+    #                  order='C').itviews
+
+    args = [np.array(_m, copy=False, subok=subok) for _m in args]
+
+    shape = _broadcast_shape(*args)
+
+    if all(array.shape == shape for array in args):
+        # Common case where nothing needs to be broadcasted.
+        return args
+
+    return [_broadcast_to(array, shape, subok=subok, readonly=False)
+            for array in args]
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__init__.py b/venv/Lib/site-packages/numpy/lib/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..2584c6929
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__datasource.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__datasource.cpython-36.pyc
new file mode 100644
index 000000000..c4c5b416a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__datasource.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__iotools.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__iotools.cpython-36.pyc
new file mode 100644
index 000000000..2f1c9ea9e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__iotools.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__version.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__version.cpython-36.pyc
new file mode 100644
index 000000000..3bd17878e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test__version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraypad.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraypad.cpython-36.pyc
new file mode 100644
index 000000000..a44c43d26
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraypad.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraysetops.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraysetops.cpython-36.pyc
new file mode 100644
index 000000000..53743444c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arraysetops.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arrayterator.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arrayterator.cpython-36.pyc
new file mode 100644
index 000000000..114a1675e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_arrayterator.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_financial.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_financial.cpython-36.pyc
new file mode 100644
index 000000000..c4abf40f6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_financial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_format.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_format.cpython-36.pyc
new file mode 100644
index 000000000..458e0d236
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_format.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_function_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_function_base.cpython-36.pyc
new file mode 100644
index 000000000..a3aaab8bf
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_function_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_histograms.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_histograms.cpython-36.pyc
new file mode 100644
index 000000000..ccfd7b48b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_histograms.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_index_tricks.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_index_tricks.cpython-36.pyc
new file mode 100644
index 000000000..212590130
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_index_tricks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_io.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_io.cpython-36.pyc
new file mode 100644
index 000000000..bc8cc0285
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_io.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_mixins.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_mixins.cpython-36.pyc
new file mode 100644
index 000000000..99fd74bb1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_mixins.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_nanfunctions.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_nanfunctions.cpython-36.pyc
new file mode 100644
index 000000000..affa1c1f6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_nanfunctions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_packbits.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_packbits.cpython-36.pyc
new file mode 100644
index 000000000..23d344c8d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_packbits.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_polynomial.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_polynomial.cpython-36.pyc
new file mode 100644
index 000000000..40d604e81
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_polynomial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_recfunctions.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_recfunctions.cpython-36.pyc
new file mode 100644
index 000000000..60a42637d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_recfunctions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..66af8b257
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_shape_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_shape_base.cpython-36.pyc
new file mode 100644
index 000000000..cfb96d12b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_shape_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_stride_tricks.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_stride_tricks.cpython-36.pyc
new file mode 100644
index 000000000..5d0582e55
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_stride_tricks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_twodim_base.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_twodim_base.cpython-36.pyc
new file mode 100644
index 000000000..870514c46
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_twodim_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_type_check.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_type_check.cpython-36.pyc
new file mode 100644
index 000000000..01cdd87b0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_type_check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_ufunclike.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_ufunclike.cpython-36.pyc
new file mode 100644
index 000000000..6b52cac23
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_ufunclike.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_utils.cpython-36.pyc
new file mode 100644
index 000000000..32378f24c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/__pycache__/test_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npy b/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npy
new file mode 100644
index 000000000..12936c92d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npy differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npz b/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npz
new file mode 100644
index 000000000..68a3b53a1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/py2-objarr.npz differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npy b/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npy
new file mode 100644
index 000000000..6776074b4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npy differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npz b/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npz
new file mode 100644
index 000000000..05eac0b76
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/py3-objarr.npz differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/python3.npy b/venv/Lib/site-packages/numpy/lib/tests/data/python3.npy
new file mode 100644
index 000000000..7c6997dd6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/python3.npy differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/data/win64python2.npy b/venv/Lib/site-packages/numpy/lib/tests/data/win64python2.npy
new file mode 100644
index 000000000..d9bc36af7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/lib/tests/data/win64python2.npy differ
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test__datasource.py b/venv/Lib/site-packages/numpy/lib/tests/test__datasource.py
new file mode 100644
index 000000000..1ed7815d9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test__datasource.py
@@ -0,0 +1,350 @@
+import os
+import pytest
+from tempfile import mkdtemp, mkstemp, NamedTemporaryFile
+from shutil import rmtree
+
+import numpy.lib._datasource as datasource
+from numpy.testing import assert_, assert_equal, assert_raises
+
+import urllib.request as urllib_request
+from urllib.parse import urlparse
+from urllib.error import URLError
+
+
+def urlopen_stub(url, data=None):
+    '''Stub to replace urlopen for testing.'''
+    if url == valid_httpurl():
+        tmpfile = NamedTemporaryFile(prefix='urltmp_')
+        return tmpfile
+    else:
+        raise URLError('Name or service not known')
+
+# setup and teardown
+old_urlopen = None
+
+
+def setup_module():
+    global old_urlopen
+
+    old_urlopen = urllib_request.urlopen
+    urllib_request.urlopen = urlopen_stub
+
+
+def teardown_module():
+    urllib_request.urlopen = old_urlopen
+
+# A valid website for more robust testing
+http_path = 'http://www.google.com/'
+http_file = 'index.html'
+
+http_fakepath = 'http://fake.abc.web/site/'
+http_fakefile = 'fake.txt'
+
+malicious_files = ['/etc/shadow', '../../shadow',
+                   '..\\system.dat', 'c:\\windows\\system.dat']
+
+magic_line = b'three is the magic number'
+
+
+# Utility functions used by many tests
+def valid_textfile(filedir):
+    # Generate and return a valid temporary file.
+    fd, path = mkstemp(suffix='.txt', prefix='dstmp_', dir=filedir, text=True)
+    os.close(fd)
+    return path
+
+
+def invalid_textfile(filedir):
+    # Generate and return an invalid filename.
+    fd, path = mkstemp(suffix='.txt', prefix='dstmp_', dir=filedir)
+    os.close(fd)
+    os.remove(path)
+    return path
+
+
+def valid_httpurl():
+    return http_path+http_file
+
+
+def invalid_httpurl():
+    return http_fakepath+http_fakefile
+
+
+def valid_baseurl():
+    return http_path
+
+
+def invalid_baseurl():
+    return http_fakepath
+
+
+def valid_httpfile():
+    return http_file
+
+
+def invalid_httpfile():
+    return http_fakefile
+
+
+class TestDataSourceOpen:
+    def setup(self):
+        self.tmpdir = mkdtemp()
+        self.ds = datasource.DataSource(self.tmpdir)
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+        del self.ds
+
+    def test_ValidHTTP(self):
+        fh = self.ds.open(valid_httpurl())
+        assert_(fh)
+        fh.close()
+
+    def test_InvalidHTTP(self):
+        url = invalid_httpurl()
+        assert_raises(IOError, self.ds.open, url)
+        try:
+            self.ds.open(url)
+        except IOError as e:
+            # Regression test for bug fixed in r4342.
+            assert_(e.errno is None)
+
+    def test_InvalidHTTPCacheURLError(self):
+        assert_raises(URLError, self.ds._cache, invalid_httpurl())
+
+    def test_ValidFile(self):
+        local_file = valid_textfile(self.tmpdir)
+        fh = self.ds.open(local_file)
+        assert_(fh)
+        fh.close()
+
+    def test_InvalidFile(self):
+        invalid_file = invalid_textfile(self.tmpdir)
+        assert_raises(IOError, self.ds.open, invalid_file)
+
+    def test_ValidGzipFile(self):
+        try:
+            import gzip
+        except ImportError:
+            # We don't have the gzip capabilities to test.
+            pytest.skip()
+        # Test datasource's internal file_opener for Gzip files.
+        filepath = os.path.join(self.tmpdir, 'foobar.txt.gz')
+        fp = gzip.open(filepath, 'w')
+        fp.write(magic_line)
+        fp.close()
+        fp = self.ds.open(filepath)
+        result = fp.readline()
+        fp.close()
+        assert_equal(magic_line, result)
+
+    def test_ValidBz2File(self):
+        try:
+            import bz2
+        except ImportError:
+            # We don't have the bz2 capabilities to test.
+            pytest.skip()
+        # Test datasource's internal file_opener for BZip2 files.
+        filepath = os.path.join(self.tmpdir, 'foobar.txt.bz2')
+        fp = bz2.BZ2File(filepath, 'w')
+        fp.write(magic_line)
+        fp.close()
+        fp = self.ds.open(filepath)
+        result = fp.readline()
+        fp.close()
+        assert_equal(magic_line, result)
+
+
+class TestDataSourceExists:
+    def setup(self):
+        self.tmpdir = mkdtemp()
+        self.ds = datasource.DataSource(self.tmpdir)
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+        del self.ds
+
+    def test_ValidHTTP(self):
+        assert_(self.ds.exists(valid_httpurl()))
+
+    def test_InvalidHTTP(self):
+        assert_equal(self.ds.exists(invalid_httpurl()), False)
+
+    def test_ValidFile(self):
+        # Test valid file in destpath
+        tmpfile = valid_textfile(self.tmpdir)
+        assert_(self.ds.exists(tmpfile))
+        # Test valid local file not in destpath
+        localdir = mkdtemp()
+        tmpfile = valid_textfile(localdir)
+        assert_(self.ds.exists(tmpfile))
+        rmtree(localdir)
+
+    def test_InvalidFile(self):
+        tmpfile = invalid_textfile(self.tmpdir)
+        assert_equal(self.ds.exists(tmpfile), False)
+
+
+class TestDataSourceAbspath:
+    def setup(self):
+        self.tmpdir = os.path.abspath(mkdtemp())
+        self.ds = datasource.DataSource(self.tmpdir)
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+        del self.ds
+
+    def test_ValidHTTP(self):
+        scheme, netloc, upath, pms, qry, frg = urlparse(valid_httpurl())
+        local_path = os.path.join(self.tmpdir, netloc,
+                                  upath.strip(os.sep).strip('/'))
+        assert_equal(local_path, self.ds.abspath(valid_httpurl()))
+
+    def test_ValidFile(self):
+        tmpfile = valid_textfile(self.tmpdir)
+        tmpfilename = os.path.split(tmpfile)[-1]
+        # Test with filename only
+        assert_equal(tmpfile, self.ds.abspath(tmpfilename))
+        # Test filename with complete path
+        assert_equal(tmpfile, self.ds.abspath(tmpfile))
+
+    def test_InvalidHTTP(self):
+        scheme, netloc, upath, pms, qry, frg = urlparse(invalid_httpurl())
+        invalidhttp = os.path.join(self.tmpdir, netloc,
+                                   upath.strip(os.sep).strip('/'))
+        assert_(invalidhttp != self.ds.abspath(valid_httpurl()))
+
+    def test_InvalidFile(self):
+        invalidfile = valid_textfile(self.tmpdir)
+        tmpfile = valid_textfile(self.tmpdir)
+        tmpfilename = os.path.split(tmpfile)[-1]
+        # Test with filename only
+        assert_(invalidfile != self.ds.abspath(tmpfilename))
+        # Test filename with complete path
+        assert_(invalidfile != self.ds.abspath(tmpfile))
+
+    def test_sandboxing(self):
+        tmpfile = valid_textfile(self.tmpdir)
+        tmpfilename = os.path.split(tmpfile)[-1]
+
+        tmp_path = lambda x: os.path.abspath(self.ds.abspath(x))
+
+        assert_(tmp_path(valid_httpurl()).startswith(self.tmpdir))
+        assert_(tmp_path(invalid_httpurl()).startswith(self.tmpdir))
+        assert_(tmp_path(tmpfile).startswith(self.tmpdir))
+        assert_(tmp_path(tmpfilename).startswith(self.tmpdir))
+        for fn in malicious_files:
+            assert_(tmp_path(http_path+fn).startswith(self.tmpdir))
+            assert_(tmp_path(fn).startswith(self.tmpdir))
+
+    def test_windows_os_sep(self):
+        orig_os_sep = os.sep
+        try:
+            os.sep = '\\'
+            self.test_ValidHTTP()
+            self.test_ValidFile()
+            self.test_InvalidHTTP()
+            self.test_InvalidFile()
+            self.test_sandboxing()
+        finally:
+            os.sep = orig_os_sep
+
+
+class TestRepositoryAbspath:
+    def setup(self):
+        self.tmpdir = os.path.abspath(mkdtemp())
+        self.repos = datasource.Repository(valid_baseurl(), self.tmpdir)
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+        del self.repos
+
+    def test_ValidHTTP(self):
+        scheme, netloc, upath, pms, qry, frg = urlparse(valid_httpurl())
+        local_path = os.path.join(self.repos._destpath, netloc,
+                                  upath.strip(os.sep).strip('/'))
+        filepath = self.repos.abspath(valid_httpfile())
+        assert_equal(local_path, filepath)
+
+    def test_sandboxing(self):
+        tmp_path = lambda x: os.path.abspath(self.repos.abspath(x))
+        assert_(tmp_path(valid_httpfile()).startswith(self.tmpdir))
+        for fn in malicious_files:
+            assert_(tmp_path(http_path+fn).startswith(self.tmpdir))
+            assert_(tmp_path(fn).startswith(self.tmpdir))
+
+    def test_windows_os_sep(self):
+        orig_os_sep = os.sep
+        try:
+            os.sep = '\\'
+            self.test_ValidHTTP()
+            self.test_sandboxing()
+        finally:
+            os.sep = orig_os_sep
+
+
+class TestRepositoryExists:
+    def setup(self):
+        self.tmpdir = mkdtemp()
+        self.repos = datasource.Repository(valid_baseurl(), self.tmpdir)
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+        del self.repos
+
+    def test_ValidFile(self):
+        # Create local temp file
+        tmpfile = valid_textfile(self.tmpdir)
+        assert_(self.repos.exists(tmpfile))
+
+    def test_InvalidFile(self):
+        tmpfile = invalid_textfile(self.tmpdir)
+        assert_equal(self.repos.exists(tmpfile), False)
+
+    def test_RemoveHTTPFile(self):
+        assert_(self.repos.exists(valid_httpurl()))
+
+    def test_CachedHTTPFile(self):
+        localfile = valid_httpurl()
+        # Create a locally cached temp file with an URL based
+        # directory structure.  This is similar to what Repository.open
+        # would do.
+        scheme, netloc, upath, pms, qry, frg = urlparse(localfile)
+        local_path = os.path.join(self.repos._destpath, netloc)
+        os.mkdir(local_path, 0o0700)
+        tmpfile = valid_textfile(local_path)
+        assert_(self.repos.exists(tmpfile))
+
+
+class TestOpenFunc:
+    def setup(self):
+        self.tmpdir = mkdtemp()
+
+    def teardown(self):
+        rmtree(self.tmpdir)
+
+    def test_DataSourceOpen(self):
+        local_file = valid_textfile(self.tmpdir)
+        # Test case where destpath is passed in
+        fp = datasource.open(local_file, destpath=self.tmpdir)
+        assert_(fp)
+        fp.close()
+        # Test case where default destpath is used
+        fp = datasource.open(local_file)
+        assert_(fp)
+        fp.close()
+
+def test_del_attr_handling():
+    # DataSource __del__ can be called
+    # even if __init__ fails when the
+    # Exception object is caught by the
+    # caller as happens in refguide_check
+    # is_deprecated() function
+
+    ds = datasource.DataSource()
+    # simulate failed __init__ by removing key attribute
+    # produced within __init__ and expected by __del__
+    del ds._istmpdest
+    # should not raise an AttributeError if __del__
+    # gracefully handles failed __init__:
+    ds.__del__()
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test__iotools.py b/venv/Lib/site-packages/numpy/lib/tests/test__iotools.py
new file mode 100644
index 000000000..a5b787025
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test__iotools.py
@@ -0,0 +1,353 @@
+import time
+from datetime import date
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_allclose, assert_raises,
+    )
+from numpy.lib._iotools import (
+    LineSplitter, NameValidator, StringConverter,
+    has_nested_fields, easy_dtype, flatten_dtype
+    )
+
+
+class TestLineSplitter:
+    "Tests the LineSplitter class."
+
+    def test_no_delimiter(self):
+        "Test LineSplitter w/o delimiter"
+        strg = " 1 2 3 4  5 # test"
+        test = LineSplitter()(strg)
+        assert_equal(test, ['1', '2', '3', '4', '5'])
+        test = LineSplitter('')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '5'])
+
+    def test_space_delimiter(self):
+        "Test space delimiter"
+        strg = " 1 2 3 4  5 # test"
+        test = LineSplitter(' ')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '', '5'])
+        test = LineSplitter('  ')(strg)
+        assert_equal(test, ['1 2 3 4', '5'])
+
+    def test_tab_delimiter(self):
+        "Test tab delimiter"
+        strg = " 1\t 2\t 3\t 4\t 5  6"
+        test = LineSplitter('\t')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '5  6'])
+        strg = " 1  2\t 3  4\t 5  6"
+        test = LineSplitter('\t')(strg)
+        assert_equal(test, ['1  2', '3  4', '5  6'])
+
+    def test_other_delimiter(self):
+        "Test LineSplitter on delimiter"
+        strg = "1,2,3,4,,5"
+        test = LineSplitter(',')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '', '5'])
+        #
+        strg = " 1,2,3,4,,5 # test"
+        test = LineSplitter(',')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '', '5'])
+
+        # gh-11028 bytes comment/delimiters should get encoded
+        strg = b" 1,2,3,4,,5 % test"
+        test = LineSplitter(delimiter=b',', comments=b'%')(strg)
+        assert_equal(test, ['1', '2', '3', '4', '', '5'])
+
+    def test_constant_fixed_width(self):
+        "Test LineSplitter w/ fixed-width fields"
+        strg = "  1  2  3  4     5   # test"
+        test = LineSplitter(3)(strg)
+        assert_equal(test, ['1', '2', '3', '4', '', '5', ''])
+        #
+        strg = "  1     3  4  5  6# test"
+        test = LineSplitter(20)(strg)
+        assert_equal(test, ['1     3  4  5  6'])
+        #
+        strg = "  1     3  4  5  6# test"
+        test = LineSplitter(30)(strg)
+        assert_equal(test, ['1     3  4  5  6'])
+
+    def test_variable_fixed_width(self):
+        strg = "  1     3  4  5  6# test"
+        test = LineSplitter((3, 6, 6, 3))(strg)
+        assert_equal(test, ['1', '3', '4  5', '6'])
+        #
+        strg = "  1     3  4  5  6# test"
+        test = LineSplitter((6, 6, 9))(strg)
+        assert_equal(test, ['1', '3  4', '5  6'])
+
+# -----------------------------------------------------------------------------
+
+
+class TestNameValidator:
+
+    def test_case_sensitivity(self):
+        "Test case sensitivity"
+        names = ['A', 'a', 'b', 'c']
+        test = NameValidator().validate(names)
+        assert_equal(test, ['A', 'a', 'b', 'c'])
+        test = NameValidator(case_sensitive=False).validate(names)
+        assert_equal(test, ['A', 'A_1', 'B', 'C'])
+        test = NameValidator(case_sensitive='upper').validate(names)
+        assert_equal(test, ['A', 'A_1', 'B', 'C'])
+        test = NameValidator(case_sensitive='lower').validate(names)
+        assert_equal(test, ['a', 'a_1', 'b', 'c'])
+
+        # check exceptions
+        assert_raises(ValueError, NameValidator, case_sensitive='foobar')
+
+    def test_excludelist(self):
+        "Test excludelist"
+        names = ['dates', 'data', 'Other Data', 'mask']
+        validator = NameValidator(excludelist=['dates', 'data', 'mask'])
+        test = validator.validate(names)
+        assert_equal(test, ['dates_', 'data_', 'Other_Data', 'mask_'])
+
+    def test_missing_names(self):
+        "Test validate missing names"
+        namelist = ('a', 'b', 'c')
+        validator = NameValidator()
+        assert_equal(validator(namelist), ['a', 'b', 'c'])
+        namelist = ('', 'b', 'c')
+        assert_equal(validator(namelist), ['f0', 'b', 'c'])
+        namelist = ('a', 'b', '')
+        assert_equal(validator(namelist), ['a', 'b', 'f0'])
+        namelist = ('', 'f0', '')
+        assert_equal(validator(namelist), ['f1', 'f0', 'f2'])
+
+    def test_validate_nb_names(self):
+        "Test validate nb names"
+        namelist = ('a', 'b', 'c')
+        validator = NameValidator()
+        assert_equal(validator(namelist, nbfields=1), ('a',))
+        assert_equal(validator(namelist, nbfields=5, defaultfmt="g%i"),
+                     ['a', 'b', 'c', 'g0', 'g1'])
+
+    def test_validate_wo_names(self):
+        "Test validate no names"
+        namelist = None
+        validator = NameValidator()
+        assert_(validator(namelist) is None)
+        assert_equal(validator(namelist, nbfields=3), ['f0', 'f1', 'f2'])
+
+# -----------------------------------------------------------------------------
+
+
+def _bytes_to_date(s):
+    return date(*time.strptime(s, "%Y-%m-%d")[:3])
+
+
+class TestStringConverter:
+    "Test StringConverter"
+
+    def test_creation(self):
+        "Test creation of a StringConverter"
+        converter = StringConverter(int, -99999)
+        assert_equal(converter._status, 1)
+        assert_equal(converter.default, -99999)
+
+    def test_upgrade(self):
+        "Tests the upgrade method."
+
+        converter = StringConverter()
+        assert_equal(converter._status, 0)
+
+        # test int
+        assert_equal(converter.upgrade('0'), 0)
+        assert_equal(converter._status, 1)
+
+        # On systems where long defaults to 32-bit, the statuses will be
+        # offset by one, so we check for this here.
+        import numpy.core.numeric as nx
+        status_offset = int(nx.dtype(nx.int_).itemsize < nx.dtype(nx.int64).itemsize)
+
+        # test int > 2**32
+        assert_equal(converter.upgrade('17179869184'), 17179869184)
+        assert_equal(converter._status, 1 + status_offset)
+
+        # test float
+        assert_allclose(converter.upgrade('0.'), 0.0)
+        assert_equal(converter._status, 2 + status_offset)
+
+        # test complex
+        assert_equal(converter.upgrade('0j'), complex('0j'))
+        assert_equal(converter._status, 3 + status_offset)
+
+        # test str
+        # note that the longdouble type has been skipped, so the
+        # _status increases by 2. Everything should succeed with
+        # unicode conversion (8).
+        for s in ['a', b'a']:
+            res = converter.upgrade(s)
+            assert_(type(res) is str)
+            assert_equal(res, 'a')
+            assert_equal(converter._status, 8 + status_offset)
+
+    def test_missing(self):
+        "Tests the use of missing values."
+        converter = StringConverter(missing_values=('missing',
+                                                    'missed'))
+        converter.upgrade('0')
+        assert_equal(converter('0'), 0)
+        assert_equal(converter(''), converter.default)
+        assert_equal(converter('missing'), converter.default)
+        assert_equal(converter('missed'), converter.default)
+        try:
+            converter('miss')
+        except ValueError:
+            pass
+
+    def test_upgrademapper(self):
+        "Tests updatemapper"
+        dateparser = _bytes_to_date
+        _original_mapper = StringConverter._mapper[:]
+        try:
+            StringConverter.upgrade_mapper(dateparser, date(2000, 1, 1))
+            convert = StringConverter(dateparser, date(2000, 1, 1))
+            test = convert('2001-01-01')
+            assert_equal(test, date(2001, 1, 1))
+            test = convert('2009-01-01')
+            assert_equal(test, date(2009, 1, 1))
+            test = convert('')
+            assert_equal(test, date(2000, 1, 1))
+        finally:
+            StringConverter._mapper = _original_mapper
+
+    def test_string_to_object(self):
+        "Make sure that string-to-object functions are properly recognized"
+        old_mapper = StringConverter._mapper[:]  # copy of list
+        conv = StringConverter(_bytes_to_date)
+        assert_equal(conv._mapper, old_mapper)
+        assert_(hasattr(conv, 'default'))
+
+    def test_keep_default(self):
+        "Make sure we don't lose an explicit default"
+        converter = StringConverter(None, missing_values='',
+                                    default=-999)
+        converter.upgrade('3.14159265')
+        assert_equal(converter.default, -999)
+        assert_equal(converter.type, np.dtype(float))
+        #
+        converter = StringConverter(
+            None, missing_values='', default=0)
+        converter.upgrade('3.14159265')
+        assert_equal(converter.default, 0)
+        assert_equal(converter.type, np.dtype(float))
+
+    def test_keep_default_zero(self):
+        "Check that we don't lose a default of 0"
+        converter = StringConverter(int, default=0,
+                                    missing_values="N/A")
+        assert_equal(converter.default, 0)
+
+    def test_keep_missing_values(self):
+        "Check that we're not losing missing values"
+        converter = StringConverter(int, default=0,
+                                    missing_values="N/A")
+        assert_equal(
+            converter.missing_values, {'', 'N/A'})
+
+    def test_int64_dtype(self):
+        "Check that int64 integer types can be specified"
+        converter = StringConverter(np.int64, default=0)
+        val = "-9223372036854775807"
+        assert_(converter(val) == -9223372036854775807)
+        val = "9223372036854775807"
+        assert_(converter(val) == 9223372036854775807)
+
+    def test_uint64_dtype(self):
+        "Check that uint64 integer types can be specified"
+        converter = StringConverter(np.uint64, default=0)
+        val = "9223372043271415339"
+        assert_(converter(val) == 9223372043271415339)
+
+
+class TestMiscFunctions:
+
+    def test_has_nested_dtype(self):
+        "Test has_nested_dtype"
+        ndtype = np.dtype(float)
+        assert_equal(has_nested_fields(ndtype), False)
+        ndtype = np.dtype([('A', '|S3'), ('B', float)])
+        assert_equal(has_nested_fields(ndtype), False)
+        ndtype = np.dtype([('A', int), ('B', [('BA', float), ('BB', '|S1')])])
+        assert_equal(has_nested_fields(ndtype), True)
+
+    def test_easy_dtype(self):
+        "Test ndtype on dtypes"
+        # Simple case
+        ndtype = float
+        assert_equal(easy_dtype(ndtype), np.dtype(float))
+        # As string w/o names
+        ndtype = "i4, f8"
+        assert_equal(easy_dtype(ndtype),
+                     np.dtype([('f0', "i4"), ('f1', "f8")]))
+        # As string w/o names but different default format
+        assert_equal(easy_dtype(ndtype, defaultfmt="field_%03i"),
+                     np.dtype([('field_000', "i4"), ('field_001', "f8")]))
+        # As string w/ names
+        ndtype = "i4, f8"
+        assert_equal(easy_dtype(ndtype, names="a, b"),
+                     np.dtype([('a', "i4"), ('b', "f8")]))
+        # As string w/ names (too many)
+        ndtype = "i4, f8"
+        assert_equal(easy_dtype(ndtype, names="a, b, c"),
+                     np.dtype([('a', "i4"), ('b', "f8")]))
+        # As string w/ names (not enough)
+        ndtype = "i4, f8"
+        assert_equal(easy_dtype(ndtype, names=", b"),
+                     np.dtype([('f0', "i4"), ('b', "f8")]))
+        # ... (with different default format)
+        assert_equal(easy_dtype(ndtype, names="a", defaultfmt="f%02i"),
+                     np.dtype([('a', "i4"), ('f00', "f8")]))
+        # As list of tuples w/o names
+        ndtype = [('A', int), ('B', float)]
+        assert_equal(easy_dtype(ndtype), np.dtype([('A', int), ('B', float)]))
+        # As list of tuples w/ names
+        assert_equal(easy_dtype(ndtype, names="a,b"),
+                     np.dtype([('a', int), ('b', float)]))
+        # As list of tuples w/ not enough names
+        assert_equal(easy_dtype(ndtype, names="a"),
+                     np.dtype([('a', int), ('f0', float)]))
+        # As list of tuples w/ too many names
+        assert_equal(easy_dtype(ndtype, names="a,b,c"),
+                     np.dtype([('a', int), ('b', float)]))
+        # As list of types w/o names
+        ndtype = (int, float, float)
+        assert_equal(easy_dtype(ndtype),
+                     np.dtype([('f0', int), ('f1', float), ('f2', float)]))
+        # As list of types w names
+        ndtype = (int, float, float)
+        assert_equal(easy_dtype(ndtype, names="a, b, c"),
+                     np.dtype([('a', int), ('b', float), ('c', float)]))
+        # As simple dtype w/ names
+        ndtype = np.dtype(float)
+        assert_equal(easy_dtype(ndtype, names="a, b, c"),
+                     np.dtype([(_, float) for _ in ('a', 'b', 'c')]))
+        # As simple dtype w/o names (but multiple fields)
+        ndtype = np.dtype(float)
+        assert_equal(
+            easy_dtype(ndtype, names=['', '', ''], defaultfmt="f%02i"),
+            np.dtype([(_, float) for _ in ('f00', 'f01', 'f02')]))
+
+    def test_flatten_dtype(self):
+        "Testing flatten_dtype"
+        # Standard dtype
+        dt = np.dtype([("a", "f8"), ("b", "f8")])
+        dt_flat = flatten_dtype(dt)
+        assert_equal(dt_flat, [float, float])
+        # Recursive dtype
+        dt = np.dtype([("a", [("aa", '|S1'), ("ab", '|S2')]), ("b", int)])
+        dt_flat = flatten_dtype(dt)
+        assert_equal(dt_flat, [np.dtype('|S1'), np.dtype('|S2'), int])
+        # dtype with shaped fields
+        dt = np.dtype([("a", (float, 2)), ("b", (int, 3))])
+        dt_flat = flatten_dtype(dt)
+        assert_equal(dt_flat, [float, int])
+        dt_flat = flatten_dtype(dt, True)
+        assert_equal(dt_flat, [float] * 2 + [int] * 3)
+        # dtype w/ titles
+        dt = np.dtype([(("a", "A"), "f8"), (("b", "B"), "f8")])
+        dt_flat = flatten_dtype(dt)
+        assert_equal(dt_flat, [float, float])
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test__version.py b/venv/Lib/site-packages/numpy/lib/tests/test__version.py
new file mode 100644
index 000000000..182504631
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test__version.py
@@ -0,0 +1,64 @@
+"""Tests for the NumpyVersion class.
+
+"""
+from numpy.testing import assert_, assert_raises
+from numpy.lib import NumpyVersion
+
+
+def test_main_versions():
+    assert_(NumpyVersion('1.8.0') == '1.8.0')
+    for ver in ['1.9.0', '2.0.0', '1.8.1']:
+        assert_(NumpyVersion('1.8.0') < ver)
+
+    for ver in ['1.7.0', '1.7.1', '0.9.9']:
+        assert_(NumpyVersion('1.8.0') > ver)
+
+
+def test_version_1_point_10():
+    # regression test for gh-2998.
+    assert_(NumpyVersion('1.9.0') < '1.10.0')
+    assert_(NumpyVersion('1.11.0') < '1.11.1')
+    assert_(NumpyVersion('1.11.0') == '1.11.0')
+    assert_(NumpyVersion('1.99.11') < '1.99.12')
+
+
+def test_alpha_beta_rc():
+    assert_(NumpyVersion('1.8.0rc1') == '1.8.0rc1')
+    for ver in ['1.8.0', '1.8.0rc2']:
+        assert_(NumpyVersion('1.8.0rc1') < ver)
+
+    for ver in ['1.8.0a2', '1.8.0b3', '1.7.2rc4']:
+        assert_(NumpyVersion('1.8.0rc1') > ver)
+
+    assert_(NumpyVersion('1.8.0b1') > '1.8.0a2')
+
+
+def test_dev_version():
+    assert_(NumpyVersion('1.9.0.dev-Unknown') < '1.9.0')
+    for ver in ['1.9.0', '1.9.0a1', '1.9.0b2', '1.9.0b2.dev-ffffffff']:
+        assert_(NumpyVersion('1.9.0.dev-f16acvda') < ver)
+
+    assert_(NumpyVersion('1.9.0.dev-f16acvda') == '1.9.0.dev-11111111')
+
+
+def test_dev_a_b_rc_mixed():
+    assert_(NumpyVersion('1.9.0a2.dev-f16acvda') == '1.9.0a2.dev-11111111')
+    assert_(NumpyVersion('1.9.0a2.dev-6acvda54') < '1.9.0a2')
+
+
+def test_dev0_version():
+    assert_(NumpyVersion('1.9.0.dev0+Unknown') < '1.9.0')
+    for ver in ['1.9.0', '1.9.0a1', '1.9.0b2', '1.9.0b2.dev0+ffffffff']:
+        assert_(NumpyVersion('1.9.0.dev0+f16acvda') < ver)
+
+    assert_(NumpyVersion('1.9.0.dev0+f16acvda') == '1.9.0.dev0+11111111')
+
+
+def test_dev0_a_b_rc_mixed():
+    assert_(NumpyVersion('1.9.0a2.dev0+f16acvda') == '1.9.0a2.dev0+11111111')
+    assert_(NumpyVersion('1.9.0a2.dev0+6acvda54') < '1.9.0a2')
+
+
+def test_raises():
+    for ver in ['1.9', '1,9.0', '1.7.x']:
+        assert_raises(ValueError, NumpyVersion, ver)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_arraypad.py b/venv/Lib/site-packages/numpy/lib/tests/test_arraypad.py
new file mode 100644
index 000000000..75db5928b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_arraypad.py
@@ -0,0 +1,1364 @@
+"""Tests for the array padding functions.
+
+"""
+import pytest
+
+import numpy as np
+from numpy.testing import assert_array_equal, assert_allclose, assert_equal
+from numpy.lib.arraypad import _as_pairs
+
+
+_numeric_dtypes = (
+    np.sctypes["uint"]
+    + np.sctypes["int"]
+    + np.sctypes["float"]
+    + np.sctypes["complex"]
+)
+_all_modes = {
+    'constant': {'constant_values': 0},
+    'edge': {},
+    'linear_ramp': {'end_values': 0},
+    'maximum': {'stat_length': None},
+    'mean': {'stat_length': None},
+    'median': {'stat_length': None},
+    'minimum': {'stat_length': None},
+    'reflect': {'reflect_type': 'even'},
+    'symmetric': {'reflect_type': 'even'},
+    'wrap': {},
+    'empty': {}
+}
+
+
+class TestAsPairs:
+    def test_single_value(self):
+        """Test casting for a single value."""
+        expected = np.array([[3, 3]] * 10)
+        for x in (3, [3], [[3]]):
+            result = _as_pairs(x, 10)
+            assert_equal(result, expected)
+        # Test with dtype=object
+        obj = object()
+        assert_equal(
+            _as_pairs(obj, 10),
+            np.array([[obj, obj]] * 10)
+        )
+
+    def test_two_values(self):
+        """Test proper casting for two different values."""
+        # Broadcasting in the first dimension with numbers
+        expected = np.array([[3, 4]] * 10)
+        for x in ([3, 4], [[3, 4]]):
+            result = _as_pairs(x, 10)
+            assert_equal(result, expected)
+        # and with dtype=object
+        obj = object()
+        assert_equal(
+            _as_pairs(["a", obj], 10),
+            np.array([["a", obj]] * 10)
+        )
+
+        # Broadcasting in the second / last dimension with numbers
+        assert_equal(
+            _as_pairs([[3], [4]], 2),
+            np.array([[3, 3], [4, 4]])
+        )
+        # and with dtype=object
+        assert_equal(
+            _as_pairs([["a"], [obj]], 2),
+            np.array([["a", "a"], [obj, obj]])
+        )
+
+    def test_with_none(self):
+        expected = ((None, None), (None, None), (None, None))
+        assert_equal(
+            _as_pairs(None, 3, as_index=False),
+            expected
+        )
+        assert_equal(
+            _as_pairs(None, 3, as_index=True),
+            expected
+        )
+
+    def test_pass_through(self):
+        """Test if `x` already matching desired output are passed through."""
+        expected = np.arange(12).reshape((6, 2))
+        assert_equal(
+            _as_pairs(expected, 6),
+            expected
+        )
+
+    def test_as_index(self):
+        """Test results if `as_index=True`."""
+        assert_equal(
+            _as_pairs([2.6, 3.3], 10, as_index=True),
+            np.array([[3, 3]] * 10, dtype=np.intp)
+        )
+        assert_equal(
+            _as_pairs([2.6, 4.49], 10, as_index=True),
+            np.array([[3, 4]] * 10, dtype=np.intp)
+        )
+        for x in (-3, [-3], [[-3]], [-3, 4], [3, -4], [[-3, 4]], [[4, -3]],
+                  [[1, 2]] * 9 + [[1, -2]]):
+            with pytest.raises(ValueError, match="negative values"):
+                _as_pairs(x, 10, as_index=True)
+
+    def test_exceptions(self):
+        """Ensure faulty usage is discovered."""
+        with pytest.raises(ValueError, match="more dimensions than allowed"):
+            _as_pairs([[[3]]], 10)
+        with pytest.raises(ValueError, match="could not be broadcast"):
+            _as_pairs([[1, 2], [3, 4]], 3)
+        with pytest.raises(ValueError, match="could not be broadcast"):
+            _as_pairs(np.ones((2, 3)), 3)
+
+
+class TestConditionalShortcuts:
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_zero_padding_shortcuts(self, mode):
+        test = np.arange(120).reshape(4, 5, 6)
+        pad_amt = [(0, 0) for _ in test.shape]
+        assert_array_equal(test, np.pad(test, pad_amt, mode=mode))
+
+    @pytest.mark.parametrize("mode", ['maximum', 'mean', 'median', 'minimum',])
+    def test_shallow_statistic_range(self, mode):
+        test = np.arange(120).reshape(4, 5, 6)
+        pad_amt = [(1, 1) for _ in test.shape]
+        assert_array_equal(np.pad(test, pad_amt, mode='edge'),
+                           np.pad(test, pad_amt, mode=mode, stat_length=1))
+
+    @pytest.mark.parametrize("mode", ['maximum', 'mean', 'median', 'minimum',])
+    def test_clip_statistic_range(self, mode):
+        test = np.arange(30).reshape(5, 6)
+        pad_amt = [(3, 3) for _ in test.shape]
+        assert_array_equal(np.pad(test, pad_amt, mode=mode),
+                           np.pad(test, pad_amt, mode=mode, stat_length=30))
+
+
+class TestStatistic:
+    def test_check_mean_stat_length(self):
+        a = np.arange(100).astype('f')
+        a = np.pad(a, ((25, 20), ), 'mean', stat_length=((2, 3), ))
+        b = np.array(
+            [0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5,
+             0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5, 0.5,
+             0.5, 0.5, 0.5, 0.5, 0.5,
+
+             0., 1., 2., 3., 4., 5., 6., 7., 8., 9.,
+             10., 11., 12., 13., 14., 15., 16., 17., 18., 19.,
+             20., 21., 22., 23., 24., 25., 26., 27., 28., 29.,
+             30., 31., 32., 33., 34., 35., 36., 37., 38., 39.,
+             40., 41., 42., 43., 44., 45., 46., 47., 48., 49.,
+             50., 51., 52., 53., 54., 55., 56., 57., 58., 59.,
+             60., 61., 62., 63., 64., 65., 66., 67., 68., 69.,
+             70., 71., 72., 73., 74., 75., 76., 77., 78., 79.,
+             80., 81., 82., 83., 84., 85., 86., 87., 88., 89.,
+             90., 91., 92., 93., 94., 95., 96., 97., 98., 99.,
+
+             98., 98., 98., 98., 98., 98., 98., 98., 98., 98.,
+             98., 98., 98., 98., 98., 98., 98., 98., 98., 98.
+             ])
+        assert_array_equal(a, b)
+
+    def test_check_maximum_1(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'maximum')
+        b = np.array(
+            [99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
+             99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
+             99, 99, 99, 99, 99,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             99, 99, 99, 99, 99, 99, 99, 99, 99, 99,
+             99, 99, 99, 99, 99, 99, 99, 99, 99, 99]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_maximum_2(self):
+        a = np.arange(100) + 1
+        a = np.pad(a, (25, 20), 'maximum')
+        b = np.array(
+            [100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
+             100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
+             100, 100, 100, 100, 100,
+
+             1, 2, 3, 4, 5, 6, 7, 8, 9, 10,
+             11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+             21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
+             31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
+             41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
+             51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
+             61, 62, 63, 64, 65, 66, 67, 68, 69, 70,
+             71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
+             81, 82, 83, 84, 85, 86, 87, 88, 89, 90,
+             91, 92, 93, 94, 95, 96, 97, 98, 99, 100,
+
+             100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
+             100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_maximum_stat_length(self):
+        a = np.arange(100) + 1
+        a = np.pad(a, (25, 20), 'maximum', stat_length=10)
+        b = np.array(
+            [10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+             10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+             10, 10, 10, 10, 10,
+
+              1,  2,  3,  4,  5,  6,  7,  8,  9, 10,
+             11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+             21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
+             31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
+             41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
+             51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
+             61, 62, 63, 64, 65, 66, 67, 68, 69, 70,
+             71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
+             81, 82, 83, 84, 85, 86, 87, 88, 89, 90,
+             91, 92, 93, 94, 95, 96, 97, 98, 99, 100,
+
+             100, 100, 100, 100, 100, 100, 100, 100, 100, 100,
+             100, 100, 100, 100, 100, 100, 100, 100, 100, 100]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_minimum_1(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'minimum')
+        b = np.array(
+            [0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+             0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+             0, 0, 0, 0, 0,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
+             0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_minimum_2(self):
+        a = np.arange(100) + 2
+        a = np.pad(a, (25, 20), 'minimum')
+        b = np.array(
+            [2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+             2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+             2, 2, 2, 2, 2,
+
+             2, 3, 4, 5, 6, 7, 8, 9, 10, 11,
+             12, 13, 14, 15, 16, 17, 18, 19, 20, 21,
+             22, 23, 24, 25, 26, 27, 28, 29, 30, 31,
+             32, 33, 34, 35, 36, 37, 38, 39, 40, 41,
+             42, 43, 44, 45, 46, 47, 48, 49, 50, 51,
+             52, 53, 54, 55, 56, 57, 58, 59, 60, 61,
+             62, 63, 64, 65, 66, 67, 68, 69, 70, 71,
+             72, 73, 74, 75, 76, 77, 78, 79, 80, 81,
+             82, 83, 84, 85, 86, 87, 88, 89, 90, 91,
+             92, 93, 94, 95, 96, 97, 98, 99, 100, 101,
+
+             2, 2, 2, 2, 2, 2, 2, 2, 2, 2,
+             2, 2, 2, 2, 2, 2, 2, 2, 2, 2]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_minimum_stat_length(self):
+        a = np.arange(100) + 1
+        a = np.pad(a, (25, 20), 'minimum', stat_length=10)
+        b = np.array(
+            [ 1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
+              1,  1,  1,  1,  1,  1,  1,  1,  1,  1,
+              1,  1,  1,  1,  1,
+
+              1,  2,  3,  4,  5,  6,  7,  8,  9, 10,
+             11, 12, 13, 14, 15, 16, 17, 18, 19, 20,
+             21, 22, 23, 24, 25, 26, 27, 28, 29, 30,
+             31, 32, 33, 34, 35, 36, 37, 38, 39, 40,
+             41, 42, 43, 44, 45, 46, 47, 48, 49, 50,
+             51, 52, 53, 54, 55, 56, 57, 58, 59, 60,
+             61, 62, 63, 64, 65, 66, 67, 68, 69, 70,
+             71, 72, 73, 74, 75, 76, 77, 78, 79, 80,
+             81, 82, 83, 84, 85, 86, 87, 88, 89, 90,
+             91, 92, 93, 94, 95, 96, 97, 98, 99, 100,
+
+             91, 91, 91, 91, 91, 91, 91, 91, 91, 91,
+             91, 91, 91, 91, 91, 91, 91, 91, 91, 91]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_median(self):
+        a = np.arange(100).astype('f')
+        a = np.pad(a, (25, 20), 'median')
+        b = np.array(
+            [49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5,
+
+             0., 1., 2., 3., 4., 5., 6., 7., 8., 9.,
+             10., 11., 12., 13., 14., 15., 16., 17., 18., 19.,
+             20., 21., 22., 23., 24., 25., 26., 27., 28., 29.,
+             30., 31., 32., 33., 34., 35., 36., 37., 38., 39.,
+             40., 41., 42., 43., 44., 45., 46., 47., 48., 49.,
+             50., 51., 52., 53., 54., 55., 56., 57., 58., 59.,
+             60., 61., 62., 63., 64., 65., 66., 67., 68., 69.,
+             70., 71., 72., 73., 74., 75., 76., 77., 78., 79.,
+             80., 81., 82., 83., 84., 85., 86., 87., 88., 89.,
+             90., 91., 92., 93., 94., 95., 96., 97., 98., 99.,
+
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_median_01(self):
+        a = np.array([[3, 1, 4], [4, 5, 9], [9, 8, 2]])
+        a = np.pad(a, 1, 'median')
+        b = np.array(
+            [[4, 4, 5, 4, 4],
+
+             [3, 3, 1, 4, 3],
+             [5, 4, 5, 9, 5],
+             [8, 9, 8, 2, 8],
+
+             [4, 4, 5, 4, 4]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_median_02(self):
+        a = np.array([[3, 1, 4], [4, 5, 9], [9, 8, 2]])
+        a = np.pad(a.T, 1, 'median').T
+        b = np.array(
+            [[5, 4, 5, 4, 5],
+
+             [3, 3, 1, 4, 3],
+             [5, 4, 5, 9, 5],
+             [8, 9, 8, 2, 8],
+
+             [5, 4, 5, 4, 5]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_median_stat_length(self):
+        a = np.arange(100).astype('f')
+        a[1] = 2.
+        a[97] = 96.
+        a = np.pad(a, (25, 20), 'median', stat_length=(3, 5))
+        b = np.array(
+            [ 2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,
+              2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,  2.,
+              2.,  2.,  2.,  2.,  2.,
+
+              0.,  2.,  2.,  3.,  4.,  5.,  6.,  7.,  8.,  9.,
+             10., 11., 12., 13., 14., 15., 16., 17., 18., 19.,
+             20., 21., 22., 23., 24., 25., 26., 27., 28., 29.,
+             30., 31., 32., 33., 34., 35., 36., 37., 38., 39.,
+             40., 41., 42., 43., 44., 45., 46., 47., 48., 49.,
+             50., 51., 52., 53., 54., 55., 56., 57., 58., 59.,
+             60., 61., 62., 63., 64., 65., 66., 67., 68., 69.,
+             70., 71., 72., 73., 74., 75., 76., 77., 78., 79.,
+             80., 81., 82., 83., 84., 85., 86., 87., 88., 89.,
+             90., 91., 92., 93., 94., 95., 96., 96., 98., 99.,
+
+             96., 96., 96., 96., 96., 96., 96., 96., 96., 96.,
+             96., 96., 96., 96., 96., 96., 96., 96., 96., 96.]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_mean_shape_one(self):
+        a = [[4, 5, 6]]
+        a = np.pad(a, (5, 7), 'mean', stat_length=2)
+        b = np.array(
+            [[4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6],
+             [4, 4, 4, 4, 4, 4, 5, 6, 6, 6, 6, 6, 6, 6, 6]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_mean_2(self):
+        a = np.arange(100).astype('f')
+        a = np.pad(a, (25, 20), 'mean')
+        b = np.array(
+            [49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5,
+
+             0., 1., 2., 3., 4., 5., 6., 7., 8., 9.,
+             10., 11., 12., 13., 14., 15., 16., 17., 18., 19.,
+             20., 21., 22., 23., 24., 25., 26., 27., 28., 29.,
+             30., 31., 32., 33., 34., 35., 36., 37., 38., 39.,
+             40., 41., 42., 43., 44., 45., 46., 47., 48., 49.,
+             50., 51., 52., 53., 54., 55., 56., 57., 58., 59.,
+             60., 61., 62., 63., 64., 65., 66., 67., 68., 69.,
+             70., 71., 72., 73., 74., 75., 76., 77., 78., 79.,
+             80., 81., 82., 83., 84., 85., 86., 87., 88., 89.,
+             90., 91., 92., 93., 94., 95., 96., 97., 98., 99.,
+
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5,
+             49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5, 49.5]
+            )
+        assert_array_equal(a, b)
+
+    @pytest.mark.parametrize("mode", [
+        "mean",
+        "median",
+        "minimum",
+        "maximum"
+    ])
+    def test_same_prepend_append(self, mode):
+        """ Test that appended and prepended values are equal """
+        # This test is constructed to trigger floating point rounding errors in
+        # a way that caused gh-11216 for mode=='mean'
+        a = np.array([-1, 2, -1]) + np.array([0, 1e-12, 0], dtype=np.float64)
+        a = np.pad(a, (1, 1), mode)
+        assert_equal(a[0], a[-1])
+
+    @pytest.mark.parametrize("mode", ["mean", "median", "minimum", "maximum"])
+    @pytest.mark.parametrize(
+        "stat_length", [-2, (-2,), (3, -1), ((5, 2), (-2, 3)), ((-4,), (2,))]
+    )
+    def test_check_negative_stat_length(self, mode, stat_length):
+        arr = np.arange(30).reshape((6, 5))
+        match = "index can't contain negative values"
+        with pytest.raises(ValueError, match=match):
+            np.pad(arr, 2, mode, stat_length=stat_length)
+
+    def test_simple_stat_length(self):
+        a = np.arange(30)
+        a = np.reshape(a, (6, 5))
+        a = np.pad(a, ((2, 3), (3, 2)), mode='mean', stat_length=(3,))
+        b = np.array(
+            [[6, 6, 6, 5, 6, 7, 8, 9, 8, 8],
+             [6, 6, 6, 5, 6, 7, 8, 9, 8, 8],
+
+             [1, 1, 1, 0, 1, 2, 3, 4, 3, 3],
+             [6, 6, 6, 5, 6, 7, 8, 9, 8, 8],
+             [11, 11, 11, 10, 11, 12, 13, 14, 13, 13],
+             [16, 16, 16, 15, 16, 17, 18, 19, 18, 18],
+             [21, 21, 21, 20, 21, 22, 23, 24, 23, 23],
+             [26, 26, 26, 25, 26, 27, 28, 29, 28, 28],
+
+             [21, 21, 21, 20, 21, 22, 23, 24, 23, 23],
+             [21, 21, 21, 20, 21, 22, 23, 24, 23, 23],
+             [21, 21, 21, 20, 21, 22, 23, 24, 23, 23]]
+            )
+        assert_array_equal(a, b)
+
+    @pytest.mark.filterwarnings("ignore:Mean of empty slice:RuntimeWarning")
+    @pytest.mark.filterwarnings(
+        "ignore:invalid value encountered in (true_divide|double_scalars):"
+        "RuntimeWarning"
+    )
+    @pytest.mark.parametrize("mode", ["mean", "median"])
+    def test_zero_stat_length_valid(self, mode):
+        arr = np.pad([1., 2.], (1, 2), mode, stat_length=0)
+        expected = np.array([np.nan, 1., 2., np.nan, np.nan])
+        assert_equal(arr, expected)
+
+    @pytest.mark.parametrize("mode", ["minimum", "maximum"])
+    def test_zero_stat_length_invalid(self, mode):
+        match = "stat_length of 0 yields no value for padding"
+        with pytest.raises(ValueError, match=match):
+            np.pad([1., 2.], 0, mode, stat_length=0)
+        with pytest.raises(ValueError, match=match):
+            np.pad([1., 2.], 0, mode, stat_length=(1, 0))
+        with pytest.raises(ValueError, match=match):
+            np.pad([1., 2.], 1, mode, stat_length=0)
+        with pytest.raises(ValueError, match=match):
+            np.pad([1., 2.], 1, mode, stat_length=(1, 0))
+
+
+class TestConstant:
+    def test_check_constant(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'constant', constant_values=(10, 20))
+        b = np.array(
+            [10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+             10, 10, 10, 10, 10, 10, 10, 10, 10, 10,
+             10, 10, 10, 10, 10,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             20, 20, 20, 20, 20, 20, 20, 20, 20, 20,
+             20, 20, 20, 20, 20, 20, 20, 20, 20, 20]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_constant_zeros(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'constant')
+        b = np.array(
+            [ 0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
+              0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
+              0,  0,  0,  0,  0,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+              0,  0,  0,  0,  0,  0,  0,  0,  0,  0,
+              0,  0,  0,  0,  0,  0,  0,  0,  0,  0]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_constant_float(self):
+        # If input array is int, but constant_values are float, the dtype of
+        # the array to be padded is kept
+        arr = np.arange(30).reshape(5, 6)
+        test = np.pad(arr, (1, 2), mode='constant',
+                   constant_values=1.1)
+        expected = np.array(
+            [[ 1,  1,  1,  1,  1,  1,  1,  1,  1],
+
+             [ 1,  0,  1,  2,  3,  4,  5,  1,  1],
+             [ 1,  6,  7,  8,  9, 10, 11,  1,  1],
+             [ 1, 12, 13, 14, 15, 16, 17,  1,  1],
+             [ 1, 18, 19, 20, 21, 22, 23,  1,  1],
+             [ 1, 24, 25, 26, 27, 28, 29,  1,  1],
+
+             [ 1,  1,  1,  1,  1,  1,  1,  1,  1],
+             [ 1,  1,  1,  1,  1,  1,  1,  1,  1]]
+            )
+        assert_allclose(test, expected)
+
+    def test_check_constant_float2(self):
+        # If input array is float, and constant_values are float, the dtype of
+        # the array to be padded is kept - here retaining the float constants
+        arr = np.arange(30).reshape(5, 6)
+        arr_float = arr.astype(np.float64)
+        test = np.pad(arr_float, ((1, 2), (1, 2)), mode='constant',
+                   constant_values=1.1)
+        expected = np.array(
+            [[  1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1],
+
+             [  1.1,   0. ,   1. ,   2. ,   3. ,   4. ,   5. ,   1.1,   1.1],
+             [  1.1,   6. ,   7. ,   8. ,   9. ,  10. ,  11. ,   1.1,   1.1],
+             [  1.1,  12. ,  13. ,  14. ,  15. ,  16. ,  17. ,   1.1,   1.1],
+             [  1.1,  18. ,  19. ,  20. ,  21. ,  22. ,  23. ,   1.1,   1.1],
+             [  1.1,  24. ,  25. ,  26. ,  27. ,  28. ,  29. ,   1.1,   1.1],
+
+             [  1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1],
+             [  1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1,   1.1]]
+            )
+        assert_allclose(test, expected)
+
+    def test_check_constant_float3(self):
+        a = np.arange(100, dtype=float)
+        a = np.pad(a, (25, 20), 'constant', constant_values=(-1.1, -1.2))
+        b = np.array(
+            [-1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1,
+             -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1, -1.1,
+             -1.1, -1.1, -1.1, -1.1, -1.1,
+
+             0,  1,  2,  3,  4,  5,  6,  7,  8,  9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2,
+             -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2, -1.2]
+            )
+        assert_allclose(a, b)
+
+    def test_check_constant_odd_pad_amount(self):
+        arr = np.arange(30).reshape(5, 6)
+        test = np.pad(arr, ((1,), (2,)), mode='constant',
+                   constant_values=3)
+        expected = np.array(
+            [[ 3,  3,  3,  3,  3,  3,  3,  3,  3,  3],
+
+             [ 3,  3,  0,  1,  2,  3,  4,  5,  3,  3],
+             [ 3,  3,  6,  7,  8,  9, 10, 11,  3,  3],
+             [ 3,  3, 12, 13, 14, 15, 16, 17,  3,  3],
+             [ 3,  3, 18, 19, 20, 21, 22, 23,  3,  3],
+             [ 3,  3, 24, 25, 26, 27, 28, 29,  3,  3],
+
+             [ 3,  3,  3,  3,  3,  3,  3,  3,  3,  3]]
+            )
+        assert_allclose(test, expected)
+
+    def test_check_constant_pad_2d(self):
+        arr = np.arange(4).reshape(2, 2)
+        test = np.lib.pad(arr, ((1, 2), (1, 3)), mode='constant',
+                          constant_values=((1, 2), (3, 4)))
+        expected = np.array(
+            [[3, 1, 1, 4, 4, 4],
+             [3, 0, 1, 4, 4, 4],
+             [3, 2, 3, 4, 4, 4],
+             [3, 2, 2, 4, 4, 4],
+             [3, 2, 2, 4, 4, 4]]
+        )
+        assert_allclose(test, expected)
+
+    def test_check_large_integers(self):
+        uint64_max = 2 ** 64 - 1
+        arr = np.full(5, uint64_max, dtype=np.uint64)
+        test = np.pad(arr, 1, mode="constant", constant_values=arr.min())
+        expected = np.full(7, uint64_max, dtype=np.uint64)
+        assert_array_equal(test, expected)
+
+        int64_max = 2 ** 63 - 1
+        arr = np.full(5, int64_max, dtype=np.int64)
+        test = np.pad(arr, 1, mode="constant", constant_values=arr.min())
+        expected = np.full(7, int64_max, dtype=np.int64)
+        assert_array_equal(test, expected)
+
+    def test_check_object_array(self):
+        arr = np.empty(1, dtype=object)
+        obj_a = object()
+        arr[0] = obj_a
+        obj_b = object()
+        obj_c = object()
+        arr = np.pad(arr, pad_width=1, mode='constant',
+                     constant_values=(obj_b, obj_c))
+
+        expected = np.empty((3,), dtype=object)
+        expected[0] = obj_b
+        expected[1] = obj_a
+        expected[2] = obj_c
+
+        assert_array_equal(arr, expected)
+
+    def test_pad_empty_dimension(self):
+        arr = np.zeros((3, 0, 2))
+        result = np.pad(arr, [(0,), (2,), (1,)], mode="constant")
+        assert result.shape == (3, 4, 4)
+
+
+class TestLinearRamp:
+    def test_check_simple(self):
+        a = np.arange(100).astype('f')
+        a = np.pad(a, (25, 20), 'linear_ramp', end_values=(4, 5))
+        b = np.array(
+            [4.00, 3.84, 3.68, 3.52, 3.36, 3.20, 3.04, 2.88, 2.72, 2.56,
+             2.40, 2.24, 2.08, 1.92, 1.76, 1.60, 1.44, 1.28, 1.12, 0.96,
+             0.80, 0.64, 0.48, 0.32, 0.16,
+
+             0.00, 1.00, 2.00, 3.00, 4.00, 5.00, 6.00, 7.00, 8.00, 9.00,
+             10.0, 11.0, 12.0, 13.0, 14.0, 15.0, 16.0, 17.0, 18.0, 19.0,
+             20.0, 21.0, 22.0, 23.0, 24.0, 25.0, 26.0, 27.0, 28.0, 29.0,
+             30.0, 31.0, 32.0, 33.0, 34.0, 35.0, 36.0, 37.0, 38.0, 39.0,
+             40.0, 41.0, 42.0, 43.0, 44.0, 45.0, 46.0, 47.0, 48.0, 49.0,
+             50.0, 51.0, 52.0, 53.0, 54.0, 55.0, 56.0, 57.0, 58.0, 59.0,
+             60.0, 61.0, 62.0, 63.0, 64.0, 65.0, 66.0, 67.0, 68.0, 69.0,
+             70.0, 71.0, 72.0, 73.0, 74.0, 75.0, 76.0, 77.0, 78.0, 79.0,
+             80.0, 81.0, 82.0, 83.0, 84.0, 85.0, 86.0, 87.0, 88.0, 89.0,
+             90.0, 91.0, 92.0, 93.0, 94.0, 95.0, 96.0, 97.0, 98.0, 99.0,
+
+             94.3, 89.6, 84.9, 80.2, 75.5, 70.8, 66.1, 61.4, 56.7, 52.0,
+             47.3, 42.6, 37.9, 33.2, 28.5, 23.8, 19.1, 14.4, 9.7, 5.]
+            )
+        assert_allclose(a, b, rtol=1e-5, atol=1e-5)
+
+    def test_check_2d(self):
+        arr = np.arange(20).reshape(4, 5).astype(np.float64)
+        test = np.pad(arr, (2, 2), mode='linear_ramp', end_values=(0, 0))
+        expected = np.array(
+            [[0.,   0.,   0.,   0.,   0.,   0.,   0.,    0.,   0.],
+             [0.,   0.,   0.,  0.5,   1.,  1.5,   2.,    1.,   0.],
+             [0.,   0.,   0.,   1.,   2.,   3.,   4.,    2.,   0.],
+             [0.,  2.5,   5.,   6.,   7.,   8.,   9.,   4.5,   0.],
+             [0.,   5.,  10.,  11.,  12.,  13.,  14.,    7.,   0.],
+             [0.,  7.5,  15.,  16.,  17.,  18.,  19.,   9.5,   0.],
+             [0., 3.75,  7.5,   8.,  8.5,   9.,  9.5,  4.75,   0.],
+             [0.,   0.,   0.,   0.,   0.,   0.,   0.,    0.,   0.]])
+        assert_allclose(test, expected)
+
+    @pytest.mark.xfail(exceptions=(AssertionError,))
+    def test_object_array(self):
+        from fractions import Fraction
+        arr = np.array([Fraction(1, 2), Fraction(-1, 2)])
+        actual = np.pad(arr, (2, 3), mode='linear_ramp', end_values=0)
+
+        # deliberately chosen to have a non-power-of-2 denominator such that
+        # rounding to floats causes a failure.
+        expected = np.array([
+            Fraction( 0, 12),
+            Fraction( 3, 12),
+            Fraction( 6, 12),
+            Fraction(-6, 12),
+            Fraction(-4, 12),
+            Fraction(-2, 12),
+            Fraction(-0, 12),
+        ])
+        assert_equal(actual, expected)
+
+    def test_end_values(self):
+        """Ensure that end values are exact."""
+        a = np.pad(np.ones(10).reshape(2, 5), (223, 123), mode="linear_ramp")
+        assert_equal(a[:, 0], 0.)
+        assert_equal(a[:, -1], 0.)
+        assert_equal(a[0, :], 0.)
+        assert_equal(a[-1, :], 0.)
+
+    @pytest.mark.parametrize("dtype", _numeric_dtypes)
+    def test_negative_difference(self, dtype):
+        """
+        Check correct behavior of unsigned dtypes if there is a negative
+        difference between the edge to pad and `end_values`. Check both cases
+        to be independent of implementation. Test behavior for all other dtypes
+        in case dtype casting interferes with complex dtypes. See gh-14191.
+        """
+        x = np.array([3], dtype=dtype)
+        result = np.pad(x, 3, mode="linear_ramp", end_values=0)
+        expected = np.array([0, 1, 2, 3, 2, 1, 0], dtype=dtype)
+        assert_equal(result, expected)
+
+        x = np.array([0], dtype=dtype)
+        result = np.pad(x, 3, mode="linear_ramp", end_values=3)
+        expected = np.array([3, 2, 1, 0, 1, 2, 3], dtype=dtype)
+        assert_equal(result, expected)
+
+
+class TestReflect:
+    def test_check_simple(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'reflect')
+        b = np.array(
+            [25, 24, 23, 22, 21, 20, 19, 18, 17, 16,
+             15, 14, 13, 12, 11, 10, 9, 8, 7, 6,
+             5, 4, 3, 2, 1,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             98, 97, 96, 95, 94, 93, 92, 91, 90, 89,
+             88, 87, 86, 85, 84, 83, 82, 81, 80, 79]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_odd_method(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'reflect', reflect_type='odd')
+        b = np.array(
+            [-25, -24, -23, -22, -21, -20, -19, -18, -17, -16,
+             -15, -14, -13, -12, -11, -10, -9, -8, -7, -6,
+             -5, -4, -3, -2, -1,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             100, 101, 102, 103, 104, 105, 106, 107, 108, 109,
+             110, 111, 112, 113, 114, 115, 116, 117, 118, 119]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_large_pad(self):
+        a = [[4, 5, 6], [6, 7, 8]]
+        a = np.pad(a, (5, 7), 'reflect')
+        b = np.array(
+            [[7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7, 8, 7, 6, 7],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_shape(self):
+        a = [[4, 5, 6]]
+        a = np.pad(a, (5, 7), 'reflect')
+        b = np.array(
+            [[5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5],
+             [5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5, 6, 5, 4, 5]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_01(self):
+        a = np.pad([1, 2, 3], 2, 'reflect')
+        b = np.array([3, 2, 1, 2, 3, 2, 1])
+        assert_array_equal(a, b)
+
+    def test_check_02(self):
+        a = np.pad([1, 2, 3], 3, 'reflect')
+        b = np.array([2, 3, 2, 1, 2, 3, 2, 1, 2])
+        assert_array_equal(a, b)
+
+    def test_check_03(self):
+        a = np.pad([1, 2, 3], 4, 'reflect')
+        b = np.array([1, 2, 3, 2, 1, 2, 3, 2, 1, 2, 3])
+        assert_array_equal(a, b)
+
+
+class TestEmptyArray:
+    """Check how padding behaves on arrays with an empty dimension."""
+
+    @pytest.mark.parametrize(
+        # Keep parametrization ordered, otherwise pytest-xdist might believe
+        # that different tests were collected during parallelization
+        "mode", sorted(_all_modes.keys() - {"constant", "empty"})
+    )
+    def test_pad_empty_dimension(self, mode):
+        match = ("can't extend empty axis 0 using modes other than 'constant' "
+                 "or 'empty'")
+        with pytest.raises(ValueError, match=match):
+            np.pad([], 4, mode=mode)
+        with pytest.raises(ValueError, match=match):
+            np.pad(np.ndarray(0), 4, mode=mode)
+        with pytest.raises(ValueError, match=match):
+            np.pad(np.zeros((0, 3)), ((1,), (0,)), mode=mode)
+
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_pad_non_empty_dimension(self, mode):
+        result = np.pad(np.ones((2, 0, 2)), ((3,), (0,), (1,)), mode=mode)
+        assert result.shape == (8, 0, 4)
+
+
+class TestSymmetric:
+    def test_check_simple(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'symmetric')
+        b = np.array(
+            [24, 23, 22, 21, 20, 19, 18, 17, 16, 15,
+             14, 13, 12, 11, 10, 9, 8, 7, 6, 5,
+             4, 3, 2, 1, 0,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             99, 98, 97, 96, 95, 94, 93, 92, 91, 90,
+             89, 88, 87, 86, 85, 84, 83, 82, 81, 80]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_odd_method(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'symmetric', reflect_type='odd')
+        b = np.array(
+            [-24, -23, -22, -21, -20, -19, -18, -17, -16, -15,
+             -14, -13, -12, -11, -10, -9, -8, -7, -6, -5,
+             -4, -3, -2, -1, 0,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             99, 100, 101, 102, 103, 104, 105, 106, 107, 108,
+             109, 110, 111, 112, 113, 114, 115, 116, 117, 118]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_large_pad(self):
+        a = [[4, 5, 6], [6, 7, 8]]
+        a = np.pad(a, (5, 7), 'symmetric')
+        b = np.array(
+            [[5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+             [7, 8, 8, 7, 6, 6, 7, 8, 8, 7, 6, 6, 7, 8, 8],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6]]
+            )
+
+        assert_array_equal(a, b)
+
+    def test_check_large_pad_odd(self):
+        a = [[4, 5, 6], [6, 7, 8]]
+        a = np.pad(a, (5, 7), 'symmetric', reflect_type='odd')
+        b = np.array(
+            [[-3, -2, -2, -1,  0,  0,  1,  2,  2,  3,  4,  4,  5,  6,  6],
+             [-3, -2, -2, -1,  0,  0,  1,  2,  2,  3,  4,  4,  5,  6,  6],
+             [-1,  0,  0,  1,  2,  2,  3,  4,  4,  5,  6,  6,  7,  8,  8],
+             [-1,  0,  0,  1,  2,  2,  3,  4,  4,  5,  6,  6,  7,  8,  8],
+             [ 1,  2,  2,  3,  4,  4,  5,  6,  6,  7,  8,  8,  9, 10, 10],
+
+             [ 1,  2,  2,  3,  4,  4,  5,  6,  6,  7,  8,  8,  9, 10, 10],
+             [ 3,  4,  4,  5,  6,  6,  7,  8,  8,  9, 10, 10, 11, 12, 12],
+
+             [ 3,  4,  4,  5,  6,  6,  7,  8,  8,  9, 10, 10, 11, 12, 12],
+             [ 5,  6,  6,  7,  8,  8,  9, 10, 10, 11, 12, 12, 13, 14, 14],
+             [ 5,  6,  6,  7,  8,  8,  9, 10, 10, 11, 12, 12, 13, 14, 14],
+             [ 7,  8,  8,  9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16],
+             [ 7,  8,  8,  9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16],
+             [ 9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 18, 18],
+             [ 9, 10, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 18, 18]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_shape(self):
+        a = [[4, 5, 6]]
+        a = np.pad(a, (5, 7), 'symmetric')
+        b = np.array(
+            [[5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6],
+             [5, 6, 6, 5, 4, 4, 5, 6, 6, 5, 4, 4, 5, 6, 6]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_01(self):
+        a = np.pad([1, 2, 3], 2, 'symmetric')
+        b = np.array([2, 1, 1, 2, 3, 3, 2])
+        assert_array_equal(a, b)
+
+    def test_check_02(self):
+        a = np.pad([1, 2, 3], 3, 'symmetric')
+        b = np.array([3, 2, 1, 1, 2, 3, 3, 2, 1])
+        assert_array_equal(a, b)
+
+    def test_check_03(self):
+        a = np.pad([1, 2, 3], 6, 'symmetric')
+        b = np.array([1, 2, 3, 3, 2, 1, 1, 2, 3, 3, 2, 1, 1, 2, 3])
+        assert_array_equal(a, b)
+
+
+class TestWrap:
+    def test_check_simple(self):
+        a = np.arange(100)
+        a = np.pad(a, (25, 20), 'wrap')
+        b = np.array(
+            [75, 76, 77, 78, 79, 80, 81, 82, 83, 84,
+             85, 86, 87, 88, 89, 90, 91, 92, 93, 94,
+             95, 96, 97, 98, 99,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19,
+             20, 21, 22, 23, 24, 25, 26, 27, 28, 29,
+             30, 31, 32, 33, 34, 35, 36, 37, 38, 39,
+             40, 41, 42, 43, 44, 45, 46, 47, 48, 49,
+             50, 51, 52, 53, 54, 55, 56, 57, 58, 59,
+             60, 61, 62, 63, 64, 65, 66, 67, 68, 69,
+             70, 71, 72, 73, 74, 75, 76, 77, 78, 79,
+             80, 81, 82, 83, 84, 85, 86, 87, 88, 89,
+             90, 91, 92, 93, 94, 95, 96, 97, 98, 99,
+
+             0, 1, 2, 3, 4, 5, 6, 7, 8, 9,
+             10, 11, 12, 13, 14, 15, 16, 17, 18, 19]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_large_pad(self):
+        a = np.arange(12)
+        a = np.reshape(a, (3, 4))
+        a = np.pad(a, (10, 12), 'wrap')
+        b = np.array(
+            [[10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11],
+             [2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2, 3, 0, 1, 2,
+              3, 0, 1, 2, 3, 0, 1, 2, 3],
+             [6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6, 7, 4, 5, 6,
+              7, 4, 5, 6, 7, 4, 5, 6, 7],
+             [10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10, 11, 8, 9, 10,
+              11, 8, 9, 10, 11, 8, 9, 10, 11]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_01(self):
+        a = np.pad([1, 2, 3], 3, 'wrap')
+        b = np.array([1, 2, 3, 1, 2, 3, 1, 2, 3])
+        assert_array_equal(a, b)
+
+    def test_check_02(self):
+        a = np.pad([1, 2, 3], 4, 'wrap')
+        b = np.array([3, 1, 2, 3, 1, 2, 3, 1, 2, 3, 1])
+        assert_array_equal(a, b)
+
+    def test_pad_with_zero(self):
+        a = np.ones((3, 5))
+        b = np.pad(a, (0, 5), mode="wrap")
+        assert_array_equal(a, b[:-5, :-5])
+
+    def test_repeated_wrapping(self):
+        """
+        Check wrapping on each side individually if the wrapped area is longer
+        than the original array.
+        """
+        a = np.arange(5)
+        b = np.pad(a, (12, 0), mode="wrap")
+        assert_array_equal(np.r_[a, a, a, a][3:], b)
+
+        a = np.arange(5)
+        b = np.pad(a, (0, 12), mode="wrap")
+        assert_array_equal(np.r_[a, a, a, a][:-3], b)
+
+
+class TestEdge:
+    def test_check_simple(self):
+        a = np.arange(12)
+        a = np.reshape(a, (4, 3))
+        a = np.pad(a, ((2, 3), (3, 2)), 'edge')
+        b = np.array(
+            [[0, 0, 0, 0, 1, 2, 2, 2],
+             [0, 0, 0, 0, 1, 2, 2, 2],
+
+             [0, 0, 0, 0, 1, 2, 2, 2],
+             [3, 3, 3, 3, 4, 5, 5, 5],
+             [6, 6, 6, 6, 7, 8, 8, 8],
+             [9, 9, 9, 9, 10, 11, 11, 11],
+
+             [9, 9, 9, 9, 10, 11, 11, 11],
+             [9, 9, 9, 9, 10, 11, 11, 11],
+             [9, 9, 9, 9, 10, 11, 11, 11]]
+            )
+        assert_array_equal(a, b)
+
+    def test_check_width_shape_1_2(self):
+        # Check a pad_width of the form ((1, 2),).
+        # Regression test for issue gh-7808.
+        a = np.array([1, 2, 3])
+        padded = np.pad(a, ((1, 2),), 'edge')
+        expected = np.array([1, 1, 2, 3, 3, 3])
+        assert_array_equal(padded, expected)
+
+        a = np.array([[1, 2, 3], [4, 5, 6]])
+        padded = np.pad(a, ((1, 2),), 'edge')
+        expected = np.pad(a, ((1, 2), (1, 2)), 'edge')
+        assert_array_equal(padded, expected)
+
+        a = np.arange(24).reshape(2, 3, 4)
+        padded = np.pad(a, ((1, 2),), 'edge')
+        expected = np.pad(a, ((1, 2), (1, 2), (1, 2)), 'edge')
+        assert_array_equal(padded, expected)
+
+
+class TestEmpty:
+    def test_simple(self):
+        arr = np.arange(24).reshape(4, 6)
+        result = np.pad(arr, [(2, 3), (3, 1)], mode="empty")
+        assert result.shape == (9, 10)
+        assert_equal(arr, result[2:-3, 3:-1])
+
+    def test_pad_empty_dimension(self):
+        arr = np.zeros((3, 0, 2))
+        result = np.pad(arr, [(0,), (2,), (1,)], mode="empty")
+        assert result.shape == (3, 4, 4)
+
+
+def test_legacy_vector_functionality():
+    def _padwithtens(vector, pad_width, iaxis, kwargs):
+        vector[:pad_width[0]] = 10
+        vector[-pad_width[1]:] = 10
+
+    a = np.arange(6).reshape(2, 3)
+    a = np.pad(a, 2, _padwithtens)
+    b = np.array(
+        [[10, 10, 10, 10, 10, 10, 10],
+         [10, 10, 10, 10, 10, 10, 10],
+
+         [10, 10,  0,  1,  2, 10, 10],
+         [10, 10,  3,  4,  5, 10, 10],
+
+         [10, 10, 10, 10, 10, 10, 10],
+         [10, 10, 10, 10, 10, 10, 10]]
+        )
+    assert_array_equal(a, b)
+
+
+def test_unicode_mode():
+    a = np.pad([1], 2, mode=u'constant')
+    b = np.array([0, 0, 1, 0, 0])
+    assert_array_equal(a, b)
+
+
+@pytest.mark.parametrize("mode", ["edge", "symmetric", "reflect", "wrap"])
+def test_object_input(mode):
+    # Regression test for issue gh-11395.
+    a = np.full((4, 3), fill_value=None)
+    pad_amt = ((2, 3), (3, 2))
+    b = np.full((9, 8), fill_value=None)
+    assert_array_equal(np.pad(a, pad_amt, mode=mode), b)
+
+
+class TestPadWidth:
+    @pytest.mark.parametrize("pad_width", [
+        (4, 5, 6, 7),
+        ((1,), (2,), (3,)),
+        ((1, 2), (3, 4), (5, 6)),
+        ((3, 4, 5), (0, 1, 2)),
+    ])
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_misshaped_pad_width(self, pad_width, mode):
+        arr = np.arange(30).reshape((6, 5))
+        match = "operands could not be broadcast together"
+        with pytest.raises(ValueError, match=match):
+            np.pad(arr, pad_width, mode)
+
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_misshaped_pad_width_2(self, mode):
+        arr = np.arange(30).reshape((6, 5))
+        match = ("input operand has more dimensions than allowed by the axis "
+                 "remapping")
+        with pytest.raises(ValueError, match=match):
+            np.pad(arr, (((3,), (4,), (5,)), ((0,), (1,), (2,))), mode)
+
+    @pytest.mark.parametrize(
+        "pad_width", [-2, (-2,), (3, -1), ((5, 2), (-2, 3)), ((-4,), (2,))])
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_negative_pad_width(self, pad_width, mode):
+        arr = np.arange(30).reshape((6, 5))
+        match = "index can't contain negative values"
+        with pytest.raises(ValueError, match=match):
+            np.pad(arr, pad_width, mode)
+
+    @pytest.mark.parametrize("pad_width, dtype", [
+        ("3", None),
+        ("word", None),
+        (None, None),
+        (object(), None),
+        (3.4, None),
+        (((2, 3, 4), (3, 2)), object),
+        (complex(1, -1), None),
+        (((-2.1, 3), (3, 2)), None),
+    ])
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_bad_type(self, pad_width, dtype, mode):
+        arr = np.arange(30).reshape((6, 5))
+        match = "`pad_width` must be of integral type."
+        if dtype is not None:
+            # avoid DeprecationWarning when not specifying dtype
+            with pytest.raises(TypeError, match=match):
+                np.pad(arr, np.array(pad_width, dtype=dtype), mode)
+        else:
+            with pytest.raises(TypeError, match=match):
+                np.pad(arr, pad_width, mode)
+            with pytest.raises(TypeError, match=match):
+                np.pad(arr, np.array(pad_width), mode)
+
+    def test_pad_width_as_ndarray(self):
+        a = np.arange(12)
+        a = np.reshape(a, (4, 3))
+        a = np.pad(a, np.array(((2, 3), (3, 2))), 'edge')
+        b = np.array(
+            [[0,  0,  0,    0,  1,  2,    2,  2],
+             [0,  0,  0,    0,  1,  2,    2,  2],
+
+             [0,  0,  0,    0,  1,  2,    2,  2],
+             [3,  3,  3,    3,  4,  5,    5,  5],
+             [6,  6,  6,    6,  7,  8,    8,  8],
+             [9,  9,  9,    9, 10, 11,   11, 11],
+
+             [9,  9,  9,    9, 10, 11,   11, 11],
+             [9,  9,  9,    9, 10, 11,   11, 11],
+             [9,  9,  9,    9, 10, 11,   11, 11]]
+            )
+        assert_array_equal(a, b)
+
+    @pytest.mark.parametrize("pad_width", [0, (0, 0), ((0, 0), (0, 0))])
+    @pytest.mark.parametrize("mode", _all_modes.keys())
+    def test_zero_pad_width(self, pad_width, mode):
+        arr = np.arange(30).reshape(6, 5)
+        assert_array_equal(arr, np.pad(arr, pad_width, mode=mode))
+
+
+@pytest.mark.parametrize("mode", _all_modes.keys())
+def test_kwargs(mode):
+    """Test behavior of pad's kwargs for the given mode."""
+    allowed = _all_modes[mode]
+    not_allowed = {}
+    for kwargs in _all_modes.values():
+        if kwargs != allowed:
+            not_allowed.update(kwargs)
+    # Test if allowed keyword arguments pass
+    np.pad([1, 2, 3], 1, mode, **allowed)
+    # Test if prohibited keyword arguments of other modes raise an error
+    for key, value in not_allowed.items():
+        match = "unsupported keyword arguments for mode '{}'".format(mode)
+        with pytest.raises(ValueError, match=match):
+            np.pad([1, 2, 3], 1, mode, **{key: value})
+
+
+def test_constant_zero_default():
+    arr = np.array([1, 1])
+    assert_array_equal(np.pad(arr, 2), [0, 0, 1, 1, 0, 0])
+
+
+@pytest.mark.parametrize("mode", [1, "const", object(), None, True, False])
+def test_unsupported_mode(mode):
+    match= "mode '{}' is not supported".format(mode)
+    with pytest.raises(ValueError, match=match):
+        np.pad([1, 2, 3], 4, mode=mode)
+
+
+@pytest.mark.parametrize("mode", _all_modes.keys())
+def test_non_contiguous_array(mode):
+    arr = np.arange(24).reshape(4, 6)[::2, ::2]
+    result = np.pad(arr, (2, 3), mode)
+    assert result.shape == (7, 8)
+    assert_equal(result[2:-3, 2:-3], arr)
+
+
+@pytest.mark.parametrize("mode", _all_modes.keys())
+def test_memory_layout_persistence(mode):
+    """Test if C and F order is preserved for all pad modes."""
+    x = np.ones((5, 10), order='C')
+    assert np.pad(x, 5, mode).flags["C_CONTIGUOUS"]
+    x = np.ones((5, 10), order='F')
+    assert np.pad(x, 5, mode).flags["F_CONTIGUOUS"]
+
+
+@pytest.mark.parametrize("dtype", _numeric_dtypes)
+@pytest.mark.parametrize("mode", _all_modes.keys())
+def test_dtype_persistence(dtype, mode):
+    arr = np.zeros((3, 2, 1), dtype=dtype)
+    result = np.pad(arr, 1, mode=mode)
+    assert result.dtype == dtype
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_arraysetops.py b/venv/Lib/site-packages/numpy/lib/tests/test_arraysetops.py
new file mode 100644
index 000000000..81ba789e3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_arraysetops.py
@@ -0,0 +1,673 @@
+"""Test functions for 1D array set operations.
+
+"""
+import numpy as np
+
+from numpy.testing import (assert_array_equal, assert_equal,
+                           assert_raises, assert_raises_regex)
+from numpy.lib.arraysetops import (
+    ediff1d, intersect1d, setxor1d, union1d, setdiff1d, unique, in1d, isin
+    )
+import pytest
+
+
+class TestSetOps:
+
+    def test_intersect1d(self):
+        # unique inputs
+        a = np.array([5, 7, 1, 2])
+        b = np.array([2, 4, 3, 1, 5])
+
+        ec = np.array([1, 2, 5])
+        c = intersect1d(a, b, assume_unique=True)
+        assert_array_equal(c, ec)
+
+        # non-unique inputs
+        a = np.array([5, 5, 7, 1, 2])
+        b = np.array([2, 1, 4, 3, 3, 1, 5])
+
+        ed = np.array([1, 2, 5])
+        c = intersect1d(a, b)
+        assert_array_equal(c, ed)
+        assert_array_equal([], intersect1d([], []))
+
+    def test_intersect1d_array_like(self):
+        # See gh-11772
+        class Test:
+            def __array__(self):
+                return np.arange(3)
+
+        a = Test()
+        res = intersect1d(a, a)
+        assert_array_equal(res, a)
+        res = intersect1d([1, 2, 3], [1, 2, 3])
+        assert_array_equal(res, [1, 2, 3])
+
+    def test_intersect1d_indices(self):
+        # unique inputs
+        a = np.array([1, 2, 3, 4])
+        b = np.array([2, 1, 4, 6])
+        c, i1, i2 = intersect1d(a, b, assume_unique=True, return_indices=True)
+        ee = np.array([1, 2, 4])
+        assert_array_equal(c, ee)
+        assert_array_equal(a[i1], ee)
+        assert_array_equal(b[i2], ee)
+
+        # non-unique inputs
+        a = np.array([1, 2, 2, 3, 4, 3, 2])
+        b = np.array([1, 8, 4, 2, 2, 3, 2, 3])
+        c, i1, i2 = intersect1d(a, b, return_indices=True)
+        ef = np.array([1, 2, 3, 4])
+        assert_array_equal(c, ef)
+        assert_array_equal(a[i1], ef)
+        assert_array_equal(b[i2], ef)
+
+        # non1d, unique inputs
+        a = np.array([[2, 4, 5, 6], [7, 8, 1, 15]])
+        b = np.array([[3, 2, 7, 6], [10, 12, 8, 9]])
+        c, i1, i2 = intersect1d(a, b, assume_unique=True, return_indices=True)
+        ui1 = np.unravel_index(i1, a.shape)
+        ui2 = np.unravel_index(i2, b.shape)
+        ea = np.array([2, 6, 7, 8])
+        assert_array_equal(ea, a[ui1])
+        assert_array_equal(ea, b[ui2])
+
+        # non1d, not assumed to be uniqueinputs
+        a = np.array([[2, 4, 5, 6, 6], [4, 7, 8, 7, 2]])
+        b = np.array([[3, 2, 7, 7], [10, 12, 8, 7]])
+        c, i1, i2 = intersect1d(a, b, return_indices=True)
+        ui1 = np.unravel_index(i1, a.shape)
+        ui2 = np.unravel_index(i2, b.shape)
+        ea = np.array([2, 7, 8])
+        assert_array_equal(ea, a[ui1])
+        assert_array_equal(ea, b[ui2])
+
+    def test_setxor1d(self):
+        a = np.array([5, 7, 1, 2])
+        b = np.array([2, 4, 3, 1, 5])
+
+        ec = np.array([3, 4, 7])
+        c = setxor1d(a, b)
+        assert_array_equal(c, ec)
+
+        a = np.array([1, 2, 3])
+        b = np.array([6, 5, 4])
+
+        ec = np.array([1, 2, 3, 4, 5, 6])
+        c = setxor1d(a, b)
+        assert_array_equal(c, ec)
+
+        a = np.array([1, 8, 2, 3])
+        b = np.array([6, 5, 4, 8])
+
+        ec = np.array([1, 2, 3, 4, 5, 6])
+        c = setxor1d(a, b)
+        assert_array_equal(c, ec)
+
+        assert_array_equal([], setxor1d([], []))
+
+    def test_ediff1d(self):
+        zero_elem = np.array([])
+        one_elem = np.array([1])
+        two_elem = np.array([1, 2])
+
+        assert_array_equal([], ediff1d(zero_elem))
+        assert_array_equal([0], ediff1d(zero_elem, to_begin=0))
+        assert_array_equal([0], ediff1d(zero_elem, to_end=0))
+        assert_array_equal([-1, 0], ediff1d(zero_elem, to_begin=-1, to_end=0))
+        assert_array_equal([], ediff1d(one_elem))
+        assert_array_equal([1], ediff1d(two_elem))
+        assert_array_equal([7, 1, 9], ediff1d(two_elem, to_begin=7, to_end=9))
+        assert_array_equal([5, 6, 1, 7, 8],
+                           ediff1d(two_elem, to_begin=[5, 6], to_end=[7, 8]))
+        assert_array_equal([1, 9], ediff1d(two_elem, to_end=9))
+        assert_array_equal([1, 7, 8], ediff1d(two_elem, to_end=[7, 8]))
+        assert_array_equal([7, 1], ediff1d(two_elem, to_begin=7))
+        assert_array_equal([5, 6, 1], ediff1d(two_elem, to_begin=[5, 6]))
+
+    @pytest.mark.parametrize("ary, prepend, append", [
+        # should fail because trying to cast
+        # np.nan standard floating point value
+        # into an integer array:
+        (np.array([1, 2, 3], dtype=np.int64),
+         None,
+         np.nan),
+        # should fail because attempting
+        # to downcast to int type:
+        (np.array([1, 2, 3], dtype=np.int64),
+         np.array([5, 7, 2], dtype=np.float32),
+         None),
+        # should fail because attempting to cast
+        # two special floating point values
+        # to integers (on both sides of ary):
+        (np.array([1., 3., 9.], dtype=np.int8),
+         np.nan,
+         np.nan),
+         ])
+    def test_ediff1d_forbidden_type_casts(self, ary, prepend, append):
+        # verify resolution of gh-11490
+
+        # specifically, raise an appropriate
+        # Exception when attempting to append or
+        # prepend with an incompatible type
+        msg = 'must be compatible'
+        with assert_raises_regex(TypeError, msg):
+            ediff1d(ary=ary,
+                    to_end=append,
+                    to_begin=prepend)
+
+    @pytest.mark.parametrize(
+        "ary,prepend,append,expected",
+        [
+         (np.array([1, 2, 3], dtype=np.int16),
+          2**16,  # will be cast to int16 under same kind rule.
+          2**16 + 4,
+          np.array([0, 1, 1, 4], dtype=np.int16)),
+         (np.array([1, 2, 3], dtype=np.float32),
+          np.array([5], dtype=np.float64),
+          None,
+          np.array([5, 1, 1], dtype=np.float32)),
+         (np.array([1, 2, 3], dtype=np.int32),
+          0,
+          0,
+          np.array([0, 1, 1, 0], dtype=np.int32)),
+         (np.array([1, 2, 3], dtype=np.int64),
+          3,
+          -9,
+          np.array([3, 1, 1, -9], dtype=np.int64)),
+        ]
+    )
+    def test_ediff1d_scalar_handling(self,
+                                     ary,
+                                     prepend,
+                                     append,
+                                     expected):
+        # maintain backwards-compatibility
+        # of scalar prepend / append behavior
+        # in ediff1d following fix for gh-11490
+        actual = np.ediff1d(ary=ary,
+                            to_end=append,
+                            to_begin=prepend)
+        assert_equal(actual, expected)
+        assert actual.dtype == expected.dtype
+
+    def test_isin(self):
+        # the tests for in1d cover most of isin's behavior
+        # if in1d is removed, would need to change those tests to test
+        # isin instead.
+        def _isin_slow(a, b):
+            b = np.asarray(b).flatten().tolist()
+            return a in b
+        isin_slow = np.vectorize(_isin_slow, otypes=[bool], excluded={1})
+
+        def assert_isin_equal(a, b):
+            x = isin(a, b)
+            y = isin_slow(a, b)
+            assert_array_equal(x, y)
+
+        # multidimensional arrays in both arguments
+        a = np.arange(24).reshape([2, 3, 4])
+        b = np.array([[10, 20, 30], [0, 1, 3], [11, 22, 33]])
+        assert_isin_equal(a, b)
+
+        # array-likes as both arguments
+        c = [(9, 8), (7, 6)]
+        d = (9, 7)
+        assert_isin_equal(c, d)
+
+        # zero-d array:
+        f = np.array(3)
+        assert_isin_equal(f, b)
+        assert_isin_equal(a, f)
+        assert_isin_equal(f, f)
+
+        # scalar:
+        assert_isin_equal(5, b)
+        assert_isin_equal(a, 6)
+        assert_isin_equal(5, 6)
+
+        # empty array-like:
+        x = []
+        assert_isin_equal(x, b)
+        assert_isin_equal(a, x)
+        assert_isin_equal(x, x)
+
+    def test_in1d(self):
+        # we use two different sizes for the b array here to test the
+        # two different paths in in1d().
+        for mult in (1, 10):
+            # One check without np.array to make sure lists are handled correct
+            a = [5, 7, 1, 2]
+            b = [2, 4, 3, 1, 5] * mult
+            ec = np.array([True, False, True, True])
+            c = in1d(a, b, assume_unique=True)
+            assert_array_equal(c, ec)
+
+            a[0] = 8
+            ec = np.array([False, False, True, True])
+            c = in1d(a, b, assume_unique=True)
+            assert_array_equal(c, ec)
+
+            a[0], a[3] = 4, 8
+            ec = np.array([True, False, True, False])
+            c = in1d(a, b, assume_unique=True)
+            assert_array_equal(c, ec)
+
+            a = np.array([5, 4, 5, 3, 4, 4, 3, 4, 3, 5, 2, 1, 5, 5])
+            b = [2, 3, 4] * mult
+            ec = [False, True, False, True, True, True, True, True, True,
+                  False, True, False, False, False]
+            c = in1d(a, b)
+            assert_array_equal(c, ec)
+
+            b = b + [5, 5, 4] * mult
+            ec = [True, True, True, True, True, True, True, True, True, True,
+                  True, False, True, True]
+            c = in1d(a, b)
+            assert_array_equal(c, ec)
+
+            a = np.array([5, 7, 1, 2])
+            b = np.array([2, 4, 3, 1, 5] * mult)
+            ec = np.array([True, False, True, True])
+            c = in1d(a, b)
+            assert_array_equal(c, ec)
+
+            a = np.array([5, 7, 1, 1, 2])
+            b = np.array([2, 4, 3, 3, 1, 5] * mult)
+            ec = np.array([True, False, True, True, True])
+            c = in1d(a, b)
+            assert_array_equal(c, ec)
+
+            a = np.array([5, 5])
+            b = np.array([2, 2] * mult)
+            ec = np.array([False, False])
+            c = in1d(a, b)
+            assert_array_equal(c, ec)
+
+        a = np.array([5])
+        b = np.array([2])
+        ec = np.array([False])
+        c = in1d(a, b)
+        assert_array_equal(c, ec)
+
+        assert_array_equal(in1d([], []), [])
+
+    def test_in1d_char_array(self):
+        a = np.array(['a', 'b', 'c', 'd', 'e', 'c', 'e', 'b'])
+        b = np.array(['a', 'c'])
+
+        ec = np.array([True, False, True, False, False, True, False, False])
+        c = in1d(a, b)
+
+        assert_array_equal(c, ec)
+
+    def test_in1d_invert(self):
+        "Test in1d's invert parameter"
+        # We use two different sizes for the b array here to test the
+        # two different paths in in1d().
+        for mult in (1, 10):
+            a = np.array([5, 4, 5, 3, 4, 4, 3, 4, 3, 5, 2, 1, 5, 5])
+            b = [2, 3, 4] * mult
+            assert_array_equal(np.invert(in1d(a, b)), in1d(a, b, invert=True))
+
+    def test_in1d_ravel(self):
+        # Test that in1d ravels its input arrays. This is not documented
+        # behavior however. The test is to ensure consistentency.
+        a = np.arange(6).reshape(2, 3)
+        b = np.arange(3, 9).reshape(3, 2)
+        long_b = np.arange(3, 63).reshape(30, 2)
+        ec = np.array([False, False, False, True, True, True])
+
+        assert_array_equal(in1d(a, b, assume_unique=True), ec)
+        assert_array_equal(in1d(a, b, assume_unique=False), ec)
+        assert_array_equal(in1d(a, long_b, assume_unique=True), ec)
+        assert_array_equal(in1d(a, long_b, assume_unique=False), ec)
+
+    def test_in1d_first_array_is_object(self):
+        ar1 = [None]
+        ar2 = np.array([1]*10)
+        expected = np.array([False])
+        result = np.in1d(ar1, ar2)
+        assert_array_equal(result, expected)
+
+    def test_in1d_second_array_is_object(self):
+        ar1 = 1
+        ar2 = np.array([None]*10)
+        expected = np.array([False])
+        result = np.in1d(ar1, ar2)
+        assert_array_equal(result, expected)
+
+    def test_in1d_both_arrays_are_object(self):
+        ar1 = [None]
+        ar2 = np.array([None]*10)
+        expected = np.array([True])
+        result = np.in1d(ar1, ar2)
+        assert_array_equal(result, expected)
+
+    def test_in1d_both_arrays_have_structured_dtype(self):
+        # Test arrays of a structured data type containing an integer field
+        # and a field of dtype `object` allowing for arbitrary Python objects
+        dt = np.dtype([('field1', int), ('field2', object)])
+        ar1 = np.array([(1, None)], dtype=dt)
+        ar2 = np.array([(1, None)]*10, dtype=dt)
+        expected = np.array([True])
+        result = np.in1d(ar1, ar2)
+        assert_array_equal(result, expected)
+
+    def test_union1d(self):
+        a = np.array([5, 4, 7, 1, 2])
+        b = np.array([2, 4, 3, 3, 2, 1, 5])
+
+        ec = np.array([1, 2, 3, 4, 5, 7])
+        c = union1d(a, b)
+        assert_array_equal(c, ec)
+
+        # Tests gh-10340, arguments to union1d should be
+        # flattened if they are not already 1D
+        x = np.array([[0, 1, 2], [3, 4, 5]])
+        y = np.array([0, 1, 2, 3, 4])
+        ez = np.array([0, 1, 2, 3, 4, 5])
+        z = union1d(x, y)
+        assert_array_equal(z, ez)
+
+        assert_array_equal([], union1d([], []))
+
+    def test_setdiff1d(self):
+        a = np.array([6, 5, 4, 7, 1, 2, 7, 4])
+        b = np.array([2, 4, 3, 3, 2, 1, 5])
+
+        ec = np.array([6, 7])
+        c = setdiff1d(a, b)
+        assert_array_equal(c, ec)
+
+        a = np.arange(21)
+        b = np.arange(19)
+        ec = np.array([19, 20])
+        c = setdiff1d(a, b)
+        assert_array_equal(c, ec)
+
+        assert_array_equal([], setdiff1d([], []))
+        a = np.array((), np.uint32)
+        assert_equal(setdiff1d(a, []).dtype, np.uint32)
+
+    def test_setdiff1d_unique(self):
+        a = np.array([3, 2, 1])
+        b = np.array([7, 5, 2])
+        expected = np.array([3, 1])
+        actual = setdiff1d(a, b, assume_unique=True)
+        assert_equal(actual, expected)
+
+    def test_setdiff1d_char_array(self):
+        a = np.array(['a', 'b', 'c'])
+        b = np.array(['a', 'b', 's'])
+        assert_array_equal(setdiff1d(a, b), np.array(['c']))
+
+    def test_manyways(self):
+        a = np.array([5, 7, 1, 2, 8])
+        b = np.array([9, 8, 2, 4, 3, 1, 5])
+
+        c1 = setxor1d(a, b)
+        aux1 = intersect1d(a, b)
+        aux2 = union1d(a, b)
+        c2 = setdiff1d(aux2, aux1)
+        assert_array_equal(c1, c2)
+
+
+class TestUnique:
+
+    def test_unique_1d(self):
+
+        def check_all(a, b, i1, i2, c, dt):
+            base_msg = 'check {0} failed for type {1}'
+
+            msg = base_msg.format('values', dt)
+            v = unique(a)
+            assert_array_equal(v, b, msg)
+
+            msg = base_msg.format('return_index', dt)
+            v, j = unique(a, True, False, False)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j, i1, msg)
+
+            msg = base_msg.format('return_inverse', dt)
+            v, j = unique(a, False, True, False)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j, i2, msg)
+
+            msg = base_msg.format('return_counts', dt)
+            v, j = unique(a, False, False, True)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j, c, msg)
+
+            msg = base_msg.format('return_index and return_inverse', dt)
+            v, j1, j2 = unique(a, True, True, False)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j1, i1, msg)
+            assert_array_equal(j2, i2, msg)
+
+            msg = base_msg.format('return_index and return_counts', dt)
+            v, j1, j2 = unique(a, True, False, True)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j1, i1, msg)
+            assert_array_equal(j2, c, msg)
+
+            msg = base_msg.format('return_inverse and return_counts', dt)
+            v, j1, j2 = unique(a, False, True, True)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j1, i2, msg)
+            assert_array_equal(j2, c, msg)
+
+            msg = base_msg.format(('return_index, return_inverse '
+                                   'and return_counts'), dt)
+            v, j1, j2, j3 = unique(a, True, True, True)
+            assert_array_equal(v, b, msg)
+            assert_array_equal(j1, i1, msg)
+            assert_array_equal(j2, i2, msg)
+            assert_array_equal(j3, c, msg)
+
+        a = [5, 7, 1, 2, 1, 5, 7]*10
+        b = [1, 2, 5, 7]
+        i1 = [2, 3, 0, 1]
+        i2 = [2, 3, 0, 1, 0, 2, 3]*10
+        c = np.multiply([2, 1, 2, 2], 10)
+
+        # test for numeric arrays
+        types = []
+        types.extend(np.typecodes['AllInteger'])
+        types.extend(np.typecodes['AllFloat'])
+        types.append('datetime64[D]')
+        types.append('timedelta64[D]')
+        for dt in types:
+            aa = np.array(a, dt)
+            bb = np.array(b, dt)
+            check_all(aa, bb, i1, i2, c, dt)
+
+        # test for object arrays
+        dt = 'O'
+        aa = np.empty(len(a), dt)
+        aa[:] = a
+        bb = np.empty(len(b), dt)
+        bb[:] = b
+        check_all(aa, bb, i1, i2, c, dt)
+
+        # test for structured arrays
+        dt = [('', 'i'), ('', 'i')]
+        aa = np.array(list(zip(a, a)), dt)
+        bb = np.array(list(zip(b, b)), dt)
+        check_all(aa, bb, i1, i2, c, dt)
+
+        # test for ticket #2799
+        aa = [1. + 0.j, 1 - 1.j, 1]
+        assert_array_equal(np.unique(aa), [1. - 1.j, 1. + 0.j])
+
+        # test for ticket #4785
+        a = [(1, 2), (1, 2), (2, 3)]
+        unq = [1, 2, 3]
+        inv = [0, 1, 0, 1, 1, 2]
+        a1 = unique(a)
+        assert_array_equal(a1, unq)
+        a2, a2_inv = unique(a, return_inverse=True)
+        assert_array_equal(a2, unq)
+        assert_array_equal(a2_inv, inv)
+
+        # test for chararrays with return_inverse (gh-5099)
+        a = np.chararray(5)
+        a[...] = ''
+        a2, a2_inv = np.unique(a, return_inverse=True)
+        assert_array_equal(a2_inv, np.zeros(5))
+
+        # test for ticket #9137
+        a = []
+        a1_idx = np.unique(a, return_index=True)[1]
+        a2_inv = np.unique(a, return_inverse=True)[1]
+        a3_idx, a3_inv = np.unique(a, return_index=True,
+                                   return_inverse=True)[1:]
+        assert_equal(a1_idx.dtype, np.intp)
+        assert_equal(a2_inv.dtype, np.intp)
+        assert_equal(a3_idx.dtype, np.intp)
+        assert_equal(a3_inv.dtype, np.intp)
+
+    def test_unique_axis_errors(self):
+        assert_raises(TypeError, self._run_axis_tests, object)
+        assert_raises(TypeError, self._run_axis_tests,
+                      [('a', int), ('b', object)])
+
+        assert_raises(np.AxisError, unique, np.arange(10), axis=2)
+        assert_raises(np.AxisError, unique, np.arange(10), axis=-2)
+
+    def test_unique_axis_list(self):
+        msg = "Unique failed on list of lists"
+        inp = [[0, 1, 0], [0, 1, 0]]
+        inp_arr = np.asarray(inp)
+        assert_array_equal(unique(inp, axis=0), unique(inp_arr, axis=0), msg)
+        assert_array_equal(unique(inp, axis=1), unique(inp_arr, axis=1), msg)
+
+    def test_unique_axis(self):
+        types = []
+        types.extend(np.typecodes['AllInteger'])
+        types.extend(np.typecodes['AllFloat'])
+        types.append('datetime64[D]')
+        types.append('timedelta64[D]')
+        types.append([('a', int), ('b', int)])
+        types.append([('a', int), ('b', float)])
+
+        for dtype in types:
+            self._run_axis_tests(dtype)
+
+        msg = 'Non-bitwise-equal booleans test failed'
+        data = np.arange(10, dtype=np.uint8).reshape(-1, 2).view(bool)
+        result = np.array([[False, True], [True, True]], dtype=bool)
+        assert_array_equal(unique(data, axis=0), result, msg)
+
+        msg = 'Negative zero equality test failed'
+        data = np.array([[-0.0, 0.0], [0.0, -0.0], [-0.0, 0.0], [0.0, -0.0]])
+        result = np.array([[-0.0, 0.0]])
+        assert_array_equal(unique(data, axis=0), result, msg)
+
+    @pytest.mark.parametrize("axis", [0, -1])
+    def test_unique_1d_with_axis(self, axis):
+        x = np.array([4, 3, 2, 3, 2, 1, 2, 2])
+        uniq = unique(x, axis=axis)
+        assert_array_equal(uniq, [1, 2, 3, 4])
+
+    def test_unique_axis_zeros(self):
+        # issue 15559
+        single_zero = np.empty(shape=(2, 0), dtype=np.int8)
+        uniq, idx, inv, cnt = unique(single_zero, axis=0, return_index=True,
+                                     return_inverse=True, return_counts=True)
+
+        # there's 1 element of shape (0,) along axis 0
+        assert_equal(uniq.dtype, single_zero.dtype)
+        assert_array_equal(uniq, np.empty(shape=(1, 0)))
+        assert_array_equal(idx, np.array([0]))
+        assert_array_equal(inv, np.array([0, 0]))
+        assert_array_equal(cnt, np.array([2]))
+
+        # there's 0 elements of shape (2,) along axis 1
+        uniq, idx, inv, cnt = unique(single_zero, axis=1, return_index=True,
+                                     return_inverse=True, return_counts=True)
+
+        assert_equal(uniq.dtype, single_zero.dtype)
+        assert_array_equal(uniq, np.empty(shape=(2, 0)))
+        assert_array_equal(idx, np.array([]))
+        assert_array_equal(inv, np.array([]))
+        assert_array_equal(cnt, np.array([]))
+
+        # test a "complicated" shape
+        shape = (0, 2, 0, 3, 0, 4, 0)
+        multiple_zeros = np.empty(shape=shape)
+        for axis in range(len(shape)):
+            expected_shape = list(shape)
+            if shape[axis] == 0:
+                expected_shape[axis] = 0
+            else:
+                expected_shape[axis] = 1
+
+            assert_array_equal(unique(multiple_zeros, axis=axis),
+                               np.empty(shape=expected_shape))
+
+    def test_unique_masked(self):
+        # issue 8664
+        x = np.array([64, 0, 1, 2, 3, 63, 63, 0, 0, 0, 1, 2, 0, 63, 0],
+                     dtype='uint8')
+        y = np.ma.masked_equal(x, 0)
+
+        v = np.unique(y)
+        v2, i, c = np.unique(y, return_index=True, return_counts=True)
+
+        msg = 'Unique returned different results when asked for index'
+        assert_array_equal(v.data, v2.data, msg)
+        assert_array_equal(v.mask, v2.mask, msg)
+
+    def test_unique_sort_order_with_axis(self):
+        # These tests fail if sorting along axis is done by treating subarrays
+        # as unsigned byte strings.  See gh-10495.
+        fmt = "sort order incorrect for integer type '%s'"
+        for dt in 'bhilq':
+            a = np.array([[-1], [0]], dt)
+            b = np.unique(a, axis=0)
+            assert_array_equal(a, b, fmt % dt)
+
+    def _run_axis_tests(self, dtype):
+        data = np.array([[0, 1, 0, 0],
+                         [1, 0, 0, 0],
+                         [0, 1, 0, 0],
+                         [1, 0, 0, 0]]).astype(dtype)
+
+        msg = 'Unique with 1d array and axis=0 failed'
+        result = np.array([0, 1])
+        assert_array_equal(unique(data), result.astype(dtype), msg)
+
+        msg = 'Unique with 2d array and axis=0 failed'
+        result = np.array([[0, 1, 0, 0], [1, 0, 0, 0]])
+        assert_array_equal(unique(data, axis=0), result.astype(dtype), msg)
+
+        msg = 'Unique with 2d array and axis=1 failed'
+        result = np.array([[0, 0, 1], [0, 1, 0], [0, 0, 1], [0, 1, 0]])
+        assert_array_equal(unique(data, axis=1), result.astype(dtype), msg)
+
+        msg = 'Unique with 3d array and axis=2 failed'
+        data3d = np.array([[[1, 1],
+                            [1, 0]],
+                           [[0, 1],
+                            [0, 0]]]).astype(dtype)
+        result = np.take(data3d, [1, 0], axis=2)
+        assert_array_equal(unique(data3d, axis=2), result, msg)
+
+        uniq, idx, inv, cnt = unique(data, axis=0, return_index=True,
+                                     return_inverse=True, return_counts=True)
+        msg = "Unique's return_index=True failed with axis=0"
+        assert_array_equal(data[idx], uniq, msg)
+        msg = "Unique's return_inverse=True failed with axis=0"
+        assert_array_equal(uniq[inv], data)
+        msg = "Unique's return_counts=True failed with axis=0"
+        assert_array_equal(cnt, np.array([2, 2]), msg)
+
+        uniq, idx, inv, cnt = unique(data, axis=1, return_index=True,
+                                     return_inverse=True, return_counts=True)
+        msg = "Unique's return_index=True failed with axis=1"
+        assert_array_equal(data[:, idx], uniq)
+        msg = "Unique's return_inverse=True failed with axis=1"
+        assert_array_equal(uniq[:, inv], data)
+        msg = "Unique's return_counts=True failed with axis=1"
+        assert_array_equal(cnt, np.array([2, 1, 1]), msg)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_arrayterator.py b/venv/Lib/site-packages/numpy/lib/tests/test_arrayterator.py
new file mode 100644
index 000000000..c00ed13d7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_arrayterator.py
@@ -0,0 +1,46 @@
+from operator import mul
+from functools import reduce
+
+import numpy as np
+from numpy.random import randint
+from numpy.lib import Arrayterator
+from numpy.testing import assert_
+
+
+def test():
+    np.random.seed(np.arange(10))
+
+    # Create a random array
+    ndims = randint(5)+1
+    shape = tuple(randint(10)+1 for dim in range(ndims))
+    els = reduce(mul, shape)
+    a = np.arange(els)
+    a.shape = shape
+
+    buf_size = randint(2*els)
+    b = Arrayterator(a, buf_size)
+
+    # Check that each block has at most ``buf_size`` elements
+    for block in b:
+        assert_(len(block.flat) <= (buf_size or els))
+
+    # Check that all elements are iterated correctly
+    assert_(list(b.flat) == list(a.flat))
+
+    # Slice arrayterator
+    start = [randint(dim) for dim in shape]
+    stop = [randint(dim)+1 for dim in shape]
+    step = [randint(dim)+1 for dim in shape]
+    slice_ = tuple(slice(*t) for t in zip(start, stop, step))
+    c = b[slice_]
+    d = a[slice_]
+
+    # Check that each block has at most ``buf_size`` elements
+    for block in c:
+        assert_(len(block.flat) <= (buf_size or els))
+
+    # Check that the arrayterator is sliced correctly
+    assert_(np.all(c.__array__() == d))
+
+    # Check that all elements are iterated correctly
+    assert_(list(c.flat) == list(d.flat))
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_financial.py b/venv/Lib/site-packages/numpy/lib/tests/test_financial.py
new file mode 100644
index 000000000..26e79bc06
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_financial.py
@@ -0,0 +1,380 @@
+import warnings
+from decimal import Decimal
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_almost_equal, assert_allclose, assert_equal, assert_raises
+    )
+
+
+def filter_deprecation(func):
+    def newfunc(*args, **kwargs):
+        with warnings.catch_warnings(record=True) as ws:
+            warnings.filterwarnings('always', category=DeprecationWarning)
+            func(*args, **kwargs)
+            assert_(all(w.category is DeprecationWarning for w in ws))
+    return newfunc
+
+
+class TestFinancial:
+    @filter_deprecation
+    def test_npv_irr_congruence(self):
+        # IRR is defined as the rate required for the present value of a
+        # a series of cashflows to be zero i.e. NPV(IRR(x), x) = 0
+        cashflows = np.array([-40000, 5000, 8000, 12000, 30000])
+        assert_allclose(np.npv(np.irr(cashflows), cashflows), 0, atol=1e-10, rtol=0)
+
+    @filter_deprecation
+    def test_rate(self):
+        assert_almost_equal(
+            np.rate(10, 0, -3500, 10000),
+            0.1107, 4)
+
+    @filter_deprecation
+    def test_rate_decimal(self):
+        rate = np.rate(Decimal('10'), Decimal('0'), Decimal('-3500'), Decimal('10000'))
+        assert_equal(Decimal('0.1106908537142689284704528100'), rate)
+
+    @filter_deprecation
+    def test_irr(self):
+        v = [-150000, 15000, 25000, 35000, 45000, 60000]
+        assert_almost_equal(np.irr(v), 0.0524, 2)
+        v = [-100, 0, 0, 74]
+        assert_almost_equal(np.irr(v), -0.0955, 2)
+        v = [-100, 39, 59, 55, 20]
+        assert_almost_equal(np.irr(v), 0.28095, 2)
+        v = [-100, 100, 0, -7]
+        assert_almost_equal(np.irr(v), -0.0833, 2)
+        v = [-100, 100, 0, 7]
+        assert_almost_equal(np.irr(v), 0.06206, 2)
+        v = [-5, 10.5, 1, -8, 1]
+        assert_almost_equal(np.irr(v), 0.0886, 2)
+
+        # Test that if there is no solution then np.irr returns nan
+        # Fixes gh-6744
+        v = [-1, -2, -3]
+        assert_equal(np.irr(v), np.nan)
+
+    @filter_deprecation
+    def test_pv(self):
+        assert_almost_equal(np.pv(0.07, 20, 12000, 0), -127128.17, 2)
+
+    @filter_deprecation
+    def test_pv_decimal(self):
+        assert_equal(np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0')),
+                     Decimal('-127128.1709461939327295222005'))
+
+    @filter_deprecation
+    def test_fv(self):
+        assert_equal(np.fv(0.075, 20, -2000, 0, 0), 86609.362673042924)
+
+    @filter_deprecation
+    def test_fv_decimal(self):
+        assert_equal(np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), 0, 0),
+                     Decimal('86609.36267304300040536731624'))
+
+    @filter_deprecation
+    def test_pmt(self):
+        res = np.pmt(0.08 / 12, 5 * 12, 15000)
+        tgt = -304.145914
+        assert_allclose(res, tgt)
+        # Test the edge case where rate == 0.0
+        res = np.pmt(0.0, 5 * 12, 15000)
+        tgt = -250.0
+        assert_allclose(res, tgt)
+        # Test the case where we use broadcast and
+        # the arguments passed in are arrays.
+        res = np.pmt([[0.0, 0.8], [0.3, 0.8]], [12, 3], [2000, 20000])
+        tgt = np.array([[-166.66667, -19311.258], [-626.90814, -19311.258]])
+        assert_allclose(res, tgt)
+
+    @filter_deprecation
+    def test_pmt_decimal(self):
+        res = np.pmt(Decimal('0.08') / Decimal('12'), 5 * 12, 15000)
+        tgt = Decimal('-304.1459143262052370338701494')
+        assert_equal(res, tgt)
+        # Test the edge case where rate == 0.0
+        res = np.pmt(Decimal('0'), Decimal('60'), Decimal('15000'))
+        tgt = -250
+        assert_equal(res, tgt)
+        # Test the case where we use broadcast and
+        # the arguments passed in are arrays.
+        res = np.pmt([[Decimal('0'), Decimal('0.8')], [Decimal('0.3'), Decimal('0.8')]],
+                     [Decimal('12'), Decimal('3')], [Decimal('2000'), Decimal('20000')])
+        tgt = np.array([[Decimal('-166.6666666666666666666666667'), Decimal('-19311.25827814569536423841060')],
+                        [Decimal('-626.9081401700757748402586600'), Decimal('-19311.25827814569536423841060')]])
+
+        # Cannot use the `assert_allclose` because it uses isfinite under the covers
+        # which does not support the Decimal type
+        # See issue: https://github.com/numpy/numpy/issues/9954
+        assert_equal(res[0][0], tgt[0][0])
+        assert_equal(res[0][1], tgt[0][1])
+        assert_equal(res[1][0], tgt[1][0])
+        assert_equal(res[1][1], tgt[1][1])
+
+    @filter_deprecation
+    def test_ppmt(self):
+        assert_equal(np.round(np.ppmt(0.1 / 12, 1, 60, 55000), 2), -710.25)
+
+    @filter_deprecation
+    def test_ppmt_decimal(self):
+        assert_equal(np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000')),
+                     Decimal('-710.2541257864217612489830917'))
+
+    # Two tests showing how Decimal is actually getting at a more exact result
+    # .23 / 12 does not come out nicely as a float but does as a decimal
+    @filter_deprecation
+    def test_ppmt_special_rate(self):
+        assert_equal(np.round(np.ppmt(0.23 / 12, 1, 60, 10000000000), 8), -90238044.232277036)
+
+    @filter_deprecation
+    def test_ppmt_special_rate_decimal(self):
+        # When rounded out to 8 decimal places like the float based test, this should not equal the same value
+        # as the float, substituted for the decimal
+        def raise_error_because_not_equal():
+            assert_equal(
+                round(np.ppmt(Decimal('0.23') / Decimal('12'), 1, 60, Decimal('10000000000')), 8),
+                Decimal('-90238044.232277036'))
+
+        assert_raises(AssertionError, raise_error_because_not_equal)
+        assert_equal(np.ppmt(Decimal('0.23') / Decimal('12'), 1, 60, Decimal('10000000000')),
+                     Decimal('-90238044.2322778884413969909'))
+
+    @filter_deprecation
+    def test_ipmt(self):
+        assert_almost_equal(np.round(np.ipmt(0.1 / 12, 1, 24, 2000), 2), -16.67)
+
+    @filter_deprecation
+    def test_ipmt_decimal(self):
+        result = np.ipmt(Decimal('0.1') / Decimal('12'), 1, 24, 2000)
+        assert_equal(result.flat[0], Decimal('-16.66666666666666666666666667'))
+
+    @filter_deprecation
+    def test_nper(self):
+        assert_almost_equal(np.nper(0.075, -2000, 0, 100000.),
+                            21.54, 2)
+
+    @filter_deprecation
+    def test_nper2(self):
+        assert_almost_equal(np.nper(0.0, -2000, 0, 100000.),
+                            50.0, 1)
+
+    @filter_deprecation
+    def test_npv(self):
+        assert_almost_equal(
+            np.npv(0.05, [-15000, 1500, 2500, 3500, 4500, 6000]),
+            122.89, 2)
+
+    @filter_deprecation
+    def test_npv_decimal(self):
+        assert_equal(
+            np.npv(Decimal('0.05'), [-15000, 1500, 2500, 3500, 4500, 6000]),
+            Decimal('122.894854950942692161628715'))
+
+    @filter_deprecation
+    def test_mirr(self):
+        val = [-4500, -800, 800, 800, 600, 600, 800, 800, 700, 3000]
+        assert_almost_equal(np.mirr(val, 0.08, 0.055), 0.0666, 4)
+
+        val = [-120000, 39000, 30000, 21000, 37000, 46000]
+        assert_almost_equal(np.mirr(val, 0.10, 0.12), 0.126094, 6)
+
+        val = [100, 200, -50, 300, -200]
+        assert_almost_equal(np.mirr(val, 0.05, 0.06), 0.3428, 4)
+
+        val = [39000, 30000, 21000, 37000, 46000]
+        assert_(np.isnan(np.mirr(val, 0.10, 0.12)))
+
+    @filter_deprecation
+    def test_mirr_decimal(self):
+        val = [Decimal('-4500'), Decimal('-800'), Decimal('800'), Decimal('800'),
+               Decimal('600'), Decimal('600'), Decimal('800'), Decimal('800'),
+               Decimal('700'), Decimal('3000')]
+        assert_equal(np.mirr(val, Decimal('0.08'), Decimal('0.055')),
+                     Decimal('0.066597175031553548874239618'))
+
+        val = [Decimal('-120000'), Decimal('39000'), Decimal('30000'),
+               Decimal('21000'), Decimal('37000'), Decimal('46000')]
+        assert_equal(np.mirr(val, Decimal('0.10'), Decimal('0.12')), Decimal('0.126094130365905145828421880'))
+
+        val = [Decimal('100'), Decimal('200'), Decimal('-50'),
+               Decimal('300'), Decimal('-200')]
+        assert_equal(np.mirr(val, Decimal('0.05'), Decimal('0.06')), Decimal('0.342823387842176663647819868'))
+
+        val = [Decimal('39000'), Decimal('30000'), Decimal('21000'), Decimal('37000'), Decimal('46000')]
+        assert_(np.isnan(np.mirr(val, Decimal('0.10'), Decimal('0.12'))))
+
+    @filter_deprecation
+    def test_when(self):
+        # begin
+        assert_equal(np.rate(10, 20, -3500, 10000, 1),
+                     np.rate(10, 20, -3500, 10000, 'begin'))
+        # end
+        assert_equal(np.rate(10, 20, -3500, 10000),
+                     np.rate(10, 20, -3500, 10000, 'end'))
+        assert_equal(np.rate(10, 20, -3500, 10000, 0),
+                     np.rate(10, 20, -3500, 10000, 'end'))
+
+        # begin
+        assert_equal(np.pv(0.07, 20, 12000, 0, 1),
+                     np.pv(0.07, 20, 12000, 0, 'begin'))
+        # end
+        assert_equal(np.pv(0.07, 20, 12000, 0),
+                     np.pv(0.07, 20, 12000, 0, 'end'))
+        assert_equal(np.pv(0.07, 20, 12000, 0, 0),
+                     np.pv(0.07, 20, 12000, 0, 'end'))
+
+        # begin
+        assert_equal(np.fv(0.075, 20, -2000, 0, 1),
+                     np.fv(0.075, 20, -2000, 0, 'begin'))
+        # end
+        assert_equal(np.fv(0.075, 20, -2000, 0),
+                     np.fv(0.075, 20, -2000, 0, 'end'))
+        assert_equal(np.fv(0.075, 20, -2000, 0, 0),
+                     np.fv(0.075, 20, -2000, 0, 'end'))
+
+        # begin
+        assert_equal(np.pmt(0.08 / 12, 5 * 12, 15000., 0, 1),
+                     np.pmt(0.08 / 12, 5 * 12, 15000., 0, 'begin'))
+        # end
+        assert_equal(np.pmt(0.08 / 12, 5 * 12, 15000., 0),
+                     np.pmt(0.08 / 12, 5 * 12, 15000., 0, 'end'))
+        assert_equal(np.pmt(0.08 / 12, 5 * 12, 15000., 0, 0),
+                     np.pmt(0.08 / 12, 5 * 12, 15000., 0, 'end'))
+
+        # begin
+        assert_equal(np.ppmt(0.1 / 12, 1, 60, 55000, 0, 1),
+                     np.ppmt(0.1 / 12, 1, 60, 55000, 0, 'begin'))
+        # end
+        assert_equal(np.ppmt(0.1 / 12, 1, 60, 55000, 0),
+                     np.ppmt(0.1 / 12, 1, 60, 55000, 0, 'end'))
+        assert_equal(np.ppmt(0.1 / 12, 1, 60, 55000, 0, 0),
+                     np.ppmt(0.1 / 12, 1, 60, 55000, 0, 'end'))
+
+        # begin
+        assert_equal(np.ipmt(0.1 / 12, 1, 24, 2000, 0, 1),
+                     np.ipmt(0.1 / 12, 1, 24, 2000, 0, 'begin'))
+        # end
+        assert_equal(np.ipmt(0.1 / 12, 1, 24, 2000, 0),
+                     np.ipmt(0.1 / 12, 1, 24, 2000, 0, 'end'))
+        assert_equal(np.ipmt(0.1 / 12, 1, 24, 2000, 0, 0),
+                     np.ipmt(0.1 / 12, 1, 24, 2000, 0, 'end'))
+
+        # begin
+        assert_equal(np.nper(0.075, -2000, 0, 100000., 1),
+                     np.nper(0.075, -2000, 0, 100000., 'begin'))
+        # end
+        assert_equal(np.nper(0.075, -2000, 0, 100000.),
+                     np.nper(0.075, -2000, 0, 100000., 'end'))
+        assert_equal(np.nper(0.075, -2000, 0, 100000., 0),
+                     np.nper(0.075, -2000, 0, 100000., 'end'))
+
+    @filter_deprecation
+    def test_decimal_with_when(self):
+        """Test that decimals are still supported if the when argument is passed"""
+        # begin
+        assert_equal(np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000'), Decimal('1')),
+                     np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000'), 'begin'))
+        # end
+        assert_equal(np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000')),
+                     np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000'), 'end'))
+        assert_equal(np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000'), Decimal('0')),
+                     np.rate(Decimal('10'), Decimal('20'), Decimal('-3500'), Decimal('10000'), 'end'))
+
+        # begin
+        assert_equal(np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0'), Decimal('1')),
+                     np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0'), 'begin'))
+        # end
+        assert_equal(np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0')),
+                     np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0'), 'end'))
+        assert_equal(np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0'), Decimal('0')),
+                     np.pv(Decimal('0.07'), Decimal('20'), Decimal('12000'), Decimal('0'), 'end'))
+
+        # begin
+        assert_equal(np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0'), Decimal('1')),
+                     np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0'), 'begin'))
+        # end
+        assert_equal(np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0')),
+                     np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0'), 'end'))
+        assert_equal(np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0'), Decimal('0')),
+                     np.fv(Decimal('0.075'), Decimal('20'), Decimal('-2000'), Decimal('0'), 'end'))
+
+        # begin
+        assert_equal(np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0'), Decimal('1')),
+                     np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0'), 'begin'))
+        # end
+        assert_equal(np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0')),
+                     np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0'), 'end'))
+        assert_equal(np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0'), Decimal('0')),
+                     np.pmt(Decimal('0.08') / Decimal('12'), Decimal('5') * Decimal('12'), Decimal('15000.'),
+                            Decimal('0'), 'end'))
+
+        # begin
+        assert_equal(np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0'), Decimal('1')),
+                     np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0'), 'begin'))
+        # end
+        assert_equal(np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0')),
+                     np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0'), 'end'))
+        assert_equal(np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0'), Decimal('0')),
+                     np.ppmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('60'), Decimal('55000'),
+                             Decimal('0'), 'end'))
+
+        # begin
+        assert_equal(np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0'), Decimal('1')).flat[0],
+                     np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0'), 'begin').flat[0])
+        # end
+        assert_equal(np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0')).flat[0],
+                     np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0'), 'end').flat[0])
+        assert_equal(np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0'), Decimal('0')).flat[0],
+                     np.ipmt(Decimal('0.1') / Decimal('12'), Decimal('1'), Decimal('24'), Decimal('2000'),
+                             Decimal('0'), 'end').flat[0])
+
+    @filter_deprecation
+    def test_broadcast(self):
+        assert_almost_equal(np.nper(0.075, -2000, 0, 100000., [0, 1]),
+                            [21.5449442, 20.76156441], 4)
+
+        assert_almost_equal(np.ipmt(0.1 / 12, list(range(5)), 24, 2000),
+                            [-17.29165168, -16.66666667, -16.03647345,
+                             -15.40102862, -14.76028842], 4)
+
+        assert_almost_equal(np.ppmt(0.1 / 12, list(range(5)), 24, 2000),
+                            [-74.998201, -75.62318601, -76.25337923,
+                             -76.88882405, -77.52956425], 4)
+
+        assert_almost_equal(np.ppmt(0.1 / 12, list(range(5)), 24, 2000, 0,
+                                    [0, 0, 1, 'end', 'begin']),
+                            [-74.998201, -75.62318601, -75.62318601,
+                             -76.88882405, -76.88882405], 4)
+
+    @filter_deprecation
+    def test_broadcast_decimal(self):
+        # Use almost equal because precision is tested in the explicit tests, this test is to ensure
+        # broadcast with Decimal is not broken.
+        assert_almost_equal(np.ipmt(Decimal('0.1') / Decimal('12'), list(range(5)), Decimal('24'), Decimal('2000')),
+                            [Decimal('-17.29165168'), Decimal('-16.66666667'), Decimal('-16.03647345'),
+                             Decimal('-15.40102862'), Decimal('-14.76028842')], 4)
+
+        assert_almost_equal(np.ppmt(Decimal('0.1') / Decimal('12'), list(range(5)), Decimal('24'), Decimal('2000')),
+                            [Decimal('-74.998201'), Decimal('-75.62318601'), Decimal('-76.25337923'),
+                             Decimal('-76.88882405'), Decimal('-77.52956425')], 4)
+
+        assert_almost_equal(np.ppmt(Decimal('0.1') / Decimal('12'), list(range(5)), Decimal('24'), Decimal('2000'),
+                                    Decimal('0'), [Decimal('0'), Decimal('0'), Decimal('1'), 'end', 'begin']),
+                            [Decimal('-74.998201'), Decimal('-75.62318601'), Decimal('-75.62318601'),
+                             Decimal('-76.88882405'), Decimal('-76.88882405')], 4)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_format.py b/venv/Lib/site-packages/numpy/lib/tests/test_format.py
new file mode 100644
index 000000000..2dbaeb8cb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_format.py
@@ -0,0 +1,982 @@
+# doctest
+r''' Test the .npy file format.
+
+Set up:
+
+    >>> import sys
+    >>> from io import BytesIO
+    >>> from numpy.lib import format
+    >>>
+    >>> scalars = [
+    ...     np.uint8,
+    ...     np.int8,
+    ...     np.uint16,
+    ...     np.int16,
+    ...     np.uint32,
+    ...     np.int32,
+    ...     np.uint64,
+    ...     np.int64,
+    ...     np.float32,
+    ...     np.float64,
+    ...     np.complex64,
+    ...     np.complex128,
+    ...     object,
+    ... ]
+    >>>
+    >>> basic_arrays = []
+    >>>
+    >>> for scalar in scalars:
+    ...     for endian in '<>':
+    ...         dtype = np.dtype(scalar).newbyteorder(endian)
+    ...         basic = np.arange(15).astype(dtype)
+    ...         basic_arrays.extend([
+    ...             np.array([], dtype=dtype),
+    ...             np.array(10, dtype=dtype),
+    ...             basic,
+    ...             basic.reshape((3,5)),
+    ...             basic.reshape((3,5)).T,
+    ...             basic.reshape((3,5))[::-1,::2],
+    ...         ])
+    ...
+    >>>
+    >>> Pdescr = [
+    ...     ('x', 'i4', (2,)),
+    ...     ('y', 'f8', (2, 2)),
+    ...     ('z', 'u1')]
+    >>>
+    >>>
+    >>> PbufferT = [
+    ...     ([3,2], [[6.,4.],[6.,4.]], 8),
+    ...     ([4,3], [[7.,5.],[7.,5.]], 9),
+    ...     ]
+    >>>
+    >>>
+    >>> Ndescr = [
+    ...     ('x', 'i4', (2,)),
+    ...     ('Info', [
+    ...         ('value', 'c16'),
+    ...         ('y2', 'f8'),
+    ...         ('Info2', [
+    ...             ('name', 'S2'),
+    ...             ('value', 'c16', (2,)),
+    ...             ('y3', 'f8', (2,)),
+    ...             ('z3', 'u4', (2,))]),
+    ...         ('name', 'S2'),
+    ...         ('z2', 'b1')]),
+    ...     ('color', 'S2'),
+    ...     ('info', [
+    ...         ('Name', 'U8'),
+    ...         ('Value', 'c16')]),
+    ...     ('y', 'f8', (2, 2)),
+    ...     ('z', 'u1')]
+    >>>
+    >>>
+    >>> NbufferT = [
+    ...     ([3,2], (6j, 6., ('nn', [6j,4j], [6.,4.], [1,2]), 'NN', True), 'cc', ('NN', 6j), [[6.,4.],[6.,4.]], 8),
+    ...     ([4,3], (7j, 7., ('oo', [7j,5j], [7.,5.], [2,1]), 'OO', False), 'dd', ('OO', 7j), [[7.,5.],[7.,5.]], 9),
+    ...     ]
+    >>>
+    >>>
+    >>> record_arrays = [
+    ...     np.array(PbufferT, dtype=np.dtype(Pdescr).newbyteorder('<')),
+    ...     np.array(NbufferT, dtype=np.dtype(Ndescr).newbyteorder('<')),
+    ...     np.array(PbufferT, dtype=np.dtype(Pdescr).newbyteorder('>')),
+    ...     np.array(NbufferT, dtype=np.dtype(Ndescr).newbyteorder('>')),
+    ... ]
+
+Test the magic string writing.
+
+    >>> format.magic(1, 0)
+    '\x93NUMPY\x01\x00'
+    >>> format.magic(0, 0)
+    '\x93NUMPY\x00\x00'
+    >>> format.magic(255, 255)
+    '\x93NUMPY\xff\xff'
+    >>> format.magic(2, 5)
+    '\x93NUMPY\x02\x05'
+
+Test the magic string reading.
+
+    >>> format.read_magic(BytesIO(format.magic(1, 0)))
+    (1, 0)
+    >>> format.read_magic(BytesIO(format.magic(0, 0)))
+    (0, 0)
+    >>> format.read_magic(BytesIO(format.magic(255, 255)))
+    (255, 255)
+    >>> format.read_magic(BytesIO(format.magic(2, 5)))
+    (2, 5)
+
+Test the header writing.
+
+    >>> for arr in basic_arrays + record_arrays:
+    ...     f = BytesIO()
+    ...     format.write_array_header_1_0(f, arr)   # XXX: arr is not a dict, items gets called on it
+    ...     print(repr(f.getvalue()))
+    ...
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '|u1', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '|u1', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '|u1', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '|i1', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '|i1', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '|i1', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<u2', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<u2', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<u2', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<u2', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<u2', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<u2', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>u2', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>u2', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>u2', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>u2', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>u2', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>u2', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<i2', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<i2', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<i2', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<i2', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<i2', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<i2', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>i2', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>i2', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>i2', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>i2', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>i2', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>i2', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<u4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<u4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<u4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<u4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<u4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<u4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>u4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>u4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>u4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>u4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>u4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>u4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<i4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<i4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<i4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<i4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<i4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<i4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>i4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>i4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>i4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>i4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>i4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>i4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<u8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<u8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<u8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<u8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<u8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<u8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>u8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>u8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>u8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>u8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>u8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>u8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<i8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<i8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<i8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<i8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<i8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<i8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>i8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>i8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>i8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>i8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>i8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>i8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<f4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<f4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<f4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<f4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<f4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<f4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>f4', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>f4', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>f4', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>f4', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>f4', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>f4', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<f8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<f8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<f8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<f8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<f8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<f8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>f8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>f8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>f8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>f8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>f8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>f8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<c8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '<c8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '<c8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '<c8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '<c8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '<c8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '>c8', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': '>c8', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': '>c8', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': '>c8', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': '>c8', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': '>c8', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': '<c16', 'fortran_order': False, 'shape': (0,)}             \n"
+    "F\x00{'descr': '<c16', 'fortran_order': False, 'shape': ()}               \n"
+    "F\x00{'descr': '<c16', 'fortran_order': False, 'shape': (15,)}            \n"
+    "F\x00{'descr': '<c16', 'fortran_order': False, 'shape': (3, 5)}           \n"
+    "F\x00{'descr': '<c16', 'fortran_order': True, 'shape': (5, 3)}            \n"
+    "F\x00{'descr': '<c16', 'fortran_order': False, 'shape': (3, 3)}           \n"
+    "F\x00{'descr': '>c16', 'fortran_order': False, 'shape': (0,)}             \n"
+    "F\x00{'descr': '>c16', 'fortran_order': False, 'shape': ()}               \n"
+    "F\x00{'descr': '>c16', 'fortran_order': False, 'shape': (15,)}            \n"
+    "F\x00{'descr': '>c16', 'fortran_order': False, 'shape': (3, 5)}           \n"
+    "F\x00{'descr': '>c16', 'fortran_order': True, 'shape': (5, 3)}            \n"
+    "F\x00{'descr': '>c16', 'fortran_order': False, 'shape': (3, 3)}           \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': 'O', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (0,)}              \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': ()}                \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (15,)}             \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (3, 5)}            \n"
+    "F\x00{'descr': 'O', 'fortran_order': True, 'shape': (5, 3)}             \n"
+    "F\x00{'descr': 'O', 'fortran_order': False, 'shape': (3, 3)}            \n"
+    "v\x00{'descr': [('x', '<i4', (2,)), ('y', '<f8', (2, 2)), ('z', '|u1')],\n 'fortran_order': False,\n 'shape': (2,)}         \n"
+    "\x16\x02{'descr': [('x', '<i4', (2,)),\n           ('Info',\n            [('value', '<c16'),\n             ('y2', '<f8'),\n             ('Info2',\n              [('name', '|S2'),\n               ('value', '<c16', (2,)),\n               ('y3', '<f8', (2,)),\n               ('z3', '<u4', (2,))]),\n             ('name', '|S2'),\n             ('z2', '|b1')]),\n           ('color', '|S2'),\n           ('info', [('Name', '<U8'), ('Value', '<c16')]),\n           ('y', '<f8', (2, 2)),\n           ('z', '|u1')],\n 'fortran_order': False,\n 'shape': (2,)}      \n"
+    "v\x00{'descr': [('x', '>i4', (2,)), ('y', '>f8', (2, 2)), ('z', '|u1')],\n 'fortran_order': False,\n 'shape': (2,)}         \n"
+    "\x16\x02{'descr': [('x', '>i4', (2,)),\n           ('Info',\n            [('value', '>c16'),\n             ('y2', '>f8'),\n             ('Info2',\n              [('name', '|S2'),\n               ('value', '>c16', (2,)),\n               ('y3', '>f8', (2,)),\n               ('z3', '>u4', (2,))]),\n             ('name', '|S2'),\n             ('z2', '|b1')]),\n           ('color', '|S2'),\n           ('info', [('Name', '>U8'), ('Value', '>c16')]),\n           ('y', '>f8', (2, 2)),\n           ('z', '|u1')],\n 'fortran_order': False,\n 'shape': (2,)}      \n"
+'''
+import sys
+import os
+import shutil
+import tempfile
+import warnings
+import pytest
+from io import BytesIO
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_array_equal, assert_raises, assert_raises_regex,
+    assert_warns
+    )
+from numpy.lib import format
+
+
+tempdir = None
+
+# Module-level setup.
+
+
+def setup_module():
+    global tempdir
+    tempdir = tempfile.mkdtemp()
+
+
+def teardown_module():
+    global tempdir
+    if tempdir is not None and os.path.isdir(tempdir):
+        shutil.rmtree(tempdir)
+        tempdir = None
+
+
+# Generate some basic arrays to test with.
+scalars = [
+    np.uint8,
+    np.int8,
+    np.uint16,
+    np.int16,
+    np.uint32,
+    np.int32,
+    np.uint64,
+    np.int64,
+    np.float32,
+    np.float64,
+    np.complex64,
+    np.complex128,
+    object,
+]
+basic_arrays = []
+for scalar in scalars:
+    for endian in '<>':
+        dtype = np.dtype(scalar).newbyteorder(endian)
+        basic = np.arange(1500).astype(dtype)
+        basic_arrays.extend([
+            # Empty
+            np.array([], dtype=dtype),
+            # Rank-0
+            np.array(10, dtype=dtype),
+            # 1-D
+            basic,
+            # 2-D C-contiguous
+            basic.reshape((30, 50)),
+            # 2-D F-contiguous
+            basic.reshape((30, 50)).T,
+            # 2-D non-contiguous
+            basic.reshape((30, 50))[::-1, ::2],
+        ])
+
+# More complicated record arrays.
+# This is the structure of the table used for plain objects:
+#
+# +-+-+-+
+# |x|y|z|
+# +-+-+-+
+
+# Structure of a plain array description:
+Pdescr = [
+    ('x', 'i4', (2,)),
+    ('y', 'f8', (2, 2)),
+    ('z', 'u1')]
+
+# A plain list of tuples with values for testing:
+PbufferT = [
+    # x     y                  z
+    ([3, 2], [[6., 4.], [6., 4.]], 8),
+    ([4, 3], [[7., 5.], [7., 5.]], 9),
+    ]
+
+
+# This is the structure of the table used for nested objects (DON'T PANIC!):
+#
+# +-+---------------------------------+-----+----------+-+-+
+# |x|Info                             |color|info      |y|z|
+# | +-----+--+----------------+----+--+     +----+-----+ | |
+# | |value|y2|Info2           |name|z2|     |Name|Value| | |
+# | |     |  +----+-----+--+--+    |  |     |    |     | | |
+# | |     |  |name|value|y3|z3|    |  |     |    |     | | |
+# +-+-----+--+----+-----+--+--+----+--+-----+----+-----+-+-+
+#
+
+# The corresponding nested array description:
+Ndescr = [
+    ('x', 'i4', (2,)),
+    ('Info', [
+        ('value', 'c16'),
+        ('y2', 'f8'),
+        ('Info2', [
+            ('name', 'S2'),
+            ('value', 'c16', (2,)),
+            ('y3', 'f8', (2,)),
+            ('z3', 'u4', (2,))]),
+        ('name', 'S2'),
+        ('z2', 'b1')]),
+    ('color', 'S2'),
+    ('info', [
+        ('Name', 'U8'),
+        ('Value', 'c16')]),
+    ('y', 'f8', (2, 2)),
+    ('z', 'u1')]
+
+NbufferT = [
+    # x     Info                                                color info        y                  z
+    #       value y2 Info2                            name z2         Name Value
+    #                name   value    y3       z3
+    ([3, 2], (6j, 6., ('nn', [6j, 4j], [6., 4.], [1, 2]), 'NN', True),
+     'cc', ('NN', 6j), [[6., 4.], [6., 4.]], 8),
+    ([4, 3], (7j, 7., ('oo', [7j, 5j], [7., 5.], [2, 1]), 'OO', False),
+     'dd', ('OO', 7j), [[7., 5.], [7., 5.]], 9),
+    ]
+
+record_arrays = [
+    np.array(PbufferT, dtype=np.dtype(Pdescr).newbyteorder('<')),
+    np.array(NbufferT, dtype=np.dtype(Ndescr).newbyteorder('<')),
+    np.array(PbufferT, dtype=np.dtype(Pdescr).newbyteorder('>')),
+    np.array(NbufferT, dtype=np.dtype(Ndescr).newbyteorder('>')),
+    np.zeros(1, dtype=[('c', ('<f8', (5,)), (2,))])
+]
+
+
+#BytesIO that reads a random number of bytes at a time
+class BytesIOSRandomSize(BytesIO):
+    def read(self, size=None):
+        import random
+        size = random.randint(1, size)
+        return super(BytesIOSRandomSize, self).read(size)
+
+
+def roundtrip(arr):
+    f = BytesIO()
+    format.write_array(f, arr)
+    f2 = BytesIO(f.getvalue())
+    arr2 = format.read_array(f2, allow_pickle=True)
+    return arr2
+
+
+def roundtrip_randsize(arr):
+    f = BytesIO()
+    format.write_array(f, arr)
+    f2 = BytesIOSRandomSize(f.getvalue())
+    arr2 = format.read_array(f2)
+    return arr2
+
+
+def roundtrip_truncated(arr):
+    f = BytesIO()
+    format.write_array(f, arr)
+    #BytesIO is one byte short
+    f2 = BytesIO(f.getvalue()[0:-1])
+    arr2 = format.read_array(f2)
+    return arr2
+
+
+def assert_equal_(o1, o2):
+    assert_(o1 == o2)
+
+
+def test_roundtrip():
+    for arr in basic_arrays + record_arrays:
+        arr2 = roundtrip(arr)
+        assert_array_equal(arr, arr2)
+
+
+def test_roundtrip_randsize():
+    for arr in basic_arrays + record_arrays:
+        if arr.dtype != object:
+            arr2 = roundtrip_randsize(arr)
+            assert_array_equal(arr, arr2)
+
+
+def test_roundtrip_truncated():
+    for arr in basic_arrays:
+        if arr.dtype != object:
+            assert_raises(ValueError, roundtrip_truncated, arr)
+
+
+def test_long_str():
+    # check items larger than internal buffer size, gh-4027
+    long_str_arr = np.ones(1, dtype=np.dtype((str, format.BUFFER_SIZE + 1)))
+    long_str_arr2 = roundtrip(long_str_arr)
+    assert_array_equal(long_str_arr, long_str_arr2)
+
+
+@pytest.mark.slow
+def test_memmap_roundtrip():
+    # Fixme: used to crash on windows
+    if not (sys.platform == 'win32' or sys.platform == 'cygwin'):
+        for arr in basic_arrays + record_arrays:
+            if arr.dtype.hasobject:
+                # Skip these since they can't be mmap'ed.
+                continue
+            # Write it out normally and through mmap.
+            nfn = os.path.join(tempdir, 'normal.npy')
+            mfn = os.path.join(tempdir, 'memmap.npy')
+            fp = open(nfn, 'wb')
+            try:
+                format.write_array(fp, arr)
+            finally:
+                fp.close()
+
+            fortran_order = (
+                arr.flags.f_contiguous and not arr.flags.c_contiguous)
+            ma = format.open_memmap(mfn, mode='w+', dtype=arr.dtype,
+                                    shape=arr.shape, fortran_order=fortran_order)
+            ma[...] = arr
+            del ma
+
+            # Check that both of these files' contents are the same.
+            fp = open(nfn, 'rb')
+            normal_bytes = fp.read()
+            fp.close()
+            fp = open(mfn, 'rb')
+            memmap_bytes = fp.read()
+            fp.close()
+            assert_equal_(normal_bytes, memmap_bytes)
+
+            # Check that reading the file using memmap works.
+            ma = format.open_memmap(nfn, mode='r')
+            del ma
+
+
+def test_compressed_roundtrip():
+    arr = np.random.rand(200, 200)
+    npz_file = os.path.join(tempdir, 'compressed.npz')
+    np.savez_compressed(npz_file, arr=arr)
+    arr1 = np.load(npz_file)['arr']
+    assert_array_equal(arr, arr1)
+
+
+# aligned
+dt1 = np.dtype('i1, i4, i1', align=True)
+# non-aligned, explicit offsets
+dt2 = np.dtype({'names': ['a', 'b'], 'formats': ['i4', 'i4'],
+                'offsets': [1, 6]})
+# nested struct-in-struct
+dt3 = np.dtype({'names': ['c', 'd'], 'formats': ['i4', dt2]})
+# field with '' name
+dt4 = np.dtype({'names': ['a', '', 'b'], 'formats': ['i4']*3})
+# titles
+dt5 = np.dtype({'names': ['a', 'b'], 'formats': ['i4', 'i4'],
+                'offsets': [1, 6], 'titles': ['aa', 'bb']})
+# empty
+dt6 = np.dtype({'names': [], 'formats': [], 'itemsize': 8})
+
+@pytest.mark.parametrize("dt", [dt1, dt2, dt3, dt4, dt5, dt6])
+def test_load_padded_dtype(dt):
+    arr = np.zeros(3, dt)
+    for i in range(3):
+        arr[i] = i + 5
+    npz_file = os.path.join(tempdir, 'aligned.npz')
+    np.savez(npz_file, arr=arr)
+    arr1 = np.load(npz_file)['arr']
+    assert_array_equal(arr, arr1)
+
+
+def test_python2_python3_interoperability():
+    fname = 'win64python2.npy'
+    path = os.path.join(os.path.dirname(__file__), 'data', fname)
+    data = np.load(path)
+    assert_array_equal(data, np.ones(2))
+
+def test_pickle_python2_python3():
+    # Test that loading object arrays saved on Python 2 works both on
+    # Python 2 and Python 3 and vice versa
+    data_dir = os.path.join(os.path.dirname(__file__), 'data')
+
+    expected = np.array([None, range, u'\u512a\u826f',
+                         b'\xe4\xb8\x8d\xe8\x89\xaf'],
+                        dtype=object)
+
+    for fname in ['py2-objarr.npy', 'py2-objarr.npz',
+                  'py3-objarr.npy', 'py3-objarr.npz']:
+        path = os.path.join(data_dir, fname)
+
+        for encoding in ['bytes', 'latin1']:
+            data_f = np.load(path, allow_pickle=True, encoding=encoding)
+            if fname.endswith('.npz'):
+                data = data_f['x']
+                data_f.close()
+            else:
+                data = data_f
+
+            if encoding == 'latin1' and fname.startswith('py2'):
+                assert_(isinstance(data[3], str))
+                assert_array_equal(data[:-1], expected[:-1])
+                # mojibake occurs
+                assert_array_equal(data[-1].encode(encoding), expected[-1])
+            else:
+                assert_(isinstance(data[3], bytes))
+                assert_array_equal(data, expected)
+
+        if fname.startswith('py2'):
+            if fname.endswith('.npz'):
+                data = np.load(path, allow_pickle=True)
+                assert_raises(UnicodeError, data.__getitem__, 'x')
+                data.close()
+                data = np.load(path, allow_pickle=True, fix_imports=False,
+                               encoding='latin1')
+                assert_raises(ImportError, data.__getitem__, 'x')
+                data.close()
+            else:
+                assert_raises(UnicodeError, np.load, path,
+                              allow_pickle=True)
+                assert_raises(ImportError, np.load, path,
+                              allow_pickle=True, fix_imports=False,
+                              encoding='latin1')
+
+
+def test_pickle_disallow():
+    data_dir = os.path.join(os.path.dirname(__file__), 'data')
+
+    path = os.path.join(data_dir, 'py2-objarr.npy')
+    assert_raises(ValueError, np.load, path,
+                  allow_pickle=False, encoding='latin1')
+
+    path = os.path.join(data_dir, 'py2-objarr.npz')
+    f = np.load(path, allow_pickle=False, encoding='latin1')
+    assert_raises(ValueError, f.__getitem__, 'x')
+
+    path = os.path.join(tempdir, 'pickle-disabled.npy')
+    assert_raises(ValueError, np.save, path, np.array([None], dtype=object),
+                  allow_pickle=False)
+
+@pytest.mark.parametrize('dt', [
+    np.dtype(np.dtype([('a', np.int8),
+                       ('b', np.int16),
+                       ('c', np.int32),
+                      ], align=True),
+             (3,)),
+    np.dtype([('x', np.dtype({'names':['a','b'],
+                              'formats':['i1','i1'],
+                              'offsets':[0,4],
+                              'itemsize':8,
+                             },
+                    (3,)),
+               (4,),
+             )]),
+    np.dtype([('x',
+                   ('<f8', (5,)),
+                   (2,),
+               )]),
+    np.dtype([('x', np.dtype((
+        np.dtype((
+            np.dtype({'names':['a','b'],
+                      'formats':['i1','i1'],
+                      'offsets':[0,4],
+                      'itemsize':8}),
+            (3,)
+            )),
+        (4,)
+        )))
+        ]),
+    np.dtype([
+        ('a', np.dtype((
+            np.dtype((
+                np.dtype((
+                    np.dtype([
+                        ('a', int),
+                        ('b', np.dtype({'names':['a','b'],
+                                        'formats':['i1','i1'],
+                                        'offsets':[0,4],
+                                        'itemsize':8})),
+                    ]),
+                    (3,),
+                )),
+                (4,),
+            )),
+            (5,),
+        )))
+        ]),
+    ])
+
+def test_descr_to_dtype(dt):
+    dt1 = format.descr_to_dtype(dt.descr)
+    assert_equal_(dt1, dt)
+    arr1 = np.zeros(3, dt)
+    arr2 = roundtrip(arr1)
+    assert_array_equal(arr1, arr2)
+
+def test_version_2_0():
+    f = BytesIO()
+    # requires more than 2 byte for header
+    dt = [(("%d" % i) * 100, float) for i in range(500)]
+    d = np.ones(1000, dtype=dt)
+
+    format.write_array(f, d, version=(2, 0))
+    with warnings.catch_warnings(record=True) as w:
+        warnings.filterwarnings('always', '', UserWarning)
+        format.write_array(f, d)
+        assert_(w[0].category is UserWarning)
+
+    # check alignment of data portion
+    f.seek(0)
+    header = f.readline()
+    assert_(len(header) % format.ARRAY_ALIGN == 0)
+
+    f.seek(0)
+    n = format.read_array(f)
+    assert_array_equal(d, n)
+
+    # 1.0 requested but data cannot be saved this way
+    assert_raises(ValueError, format.write_array, f, d, (1, 0))
+
+
+@pytest.mark.slow
+def test_version_2_0_memmap():
+    # requires more than 2 byte for header
+    dt = [(("%d" % i) * 100, float) for i in range(500)]
+    d = np.ones(1000, dtype=dt)
+    tf = tempfile.mktemp('', 'mmap', dir=tempdir)
+
+    # 1.0 requested but data cannot be saved this way
+    assert_raises(ValueError, format.open_memmap, tf, mode='w+', dtype=d.dtype,
+                            shape=d.shape, version=(1, 0))
+
+    ma = format.open_memmap(tf, mode='w+', dtype=d.dtype,
+                            shape=d.shape, version=(2, 0))
+    ma[...] = d
+    del ma
+
+    with warnings.catch_warnings(record=True) as w:
+        warnings.filterwarnings('always', '', UserWarning)
+        ma = format.open_memmap(tf, mode='w+', dtype=d.dtype,
+                                shape=d.shape, version=None)
+        assert_(w[0].category is UserWarning)
+        ma[...] = d
+        del ma
+
+    ma = format.open_memmap(tf, mode='r')
+    assert_array_equal(ma, d)
+
+
+def test_write_version():
+    f = BytesIO()
+    arr = np.arange(1)
+    # These should pass.
+    format.write_array(f, arr, version=(1, 0))
+    format.write_array(f, arr)
+
+    format.write_array(f, arr, version=None)
+    format.write_array(f, arr)
+
+    format.write_array(f, arr, version=(2, 0))
+    format.write_array(f, arr)
+
+    # These should all fail.
+    bad_versions = [
+        (1, 1),
+        (0, 0),
+        (0, 1),
+        (2, 2),
+        (255, 255),
+    ]
+    for version in bad_versions:
+        with assert_raises_regex(ValueError,
+                                 'we only support format version.*'):
+            format.write_array(f, arr, version=version)
+
+
+bad_version_magic = [
+    b'\x93NUMPY\x01\x01',
+    b'\x93NUMPY\x00\x00',
+    b'\x93NUMPY\x00\x01',
+    b'\x93NUMPY\x02\x00',
+    b'\x93NUMPY\x02\x02',
+    b'\x93NUMPY\xff\xff',
+]
+malformed_magic = [
+    b'\x92NUMPY\x01\x00',
+    b'\x00NUMPY\x01\x00',
+    b'\x93numpy\x01\x00',
+    b'\x93MATLB\x01\x00',
+    b'\x93NUMPY\x01',
+    b'\x93NUMPY',
+    b'',
+]
+
+def test_read_magic():
+    s1 = BytesIO()
+    s2 = BytesIO()
+
+    arr = np.ones((3, 6), dtype=float)
+
+    format.write_array(s1, arr, version=(1, 0))
+    format.write_array(s2, arr, version=(2, 0))
+
+    s1.seek(0)
+    s2.seek(0)
+
+    version1 = format.read_magic(s1)
+    version2 = format.read_magic(s2)
+
+    assert_(version1 == (1, 0))
+    assert_(version2 == (2, 0))
+
+    assert_(s1.tell() == format.MAGIC_LEN)
+    assert_(s2.tell() == format.MAGIC_LEN)
+
+def test_read_magic_bad_magic():
+    for magic in malformed_magic:
+        f = BytesIO(magic)
+        assert_raises(ValueError, format.read_array, f)
+
+
+def test_read_version_1_0_bad_magic():
+    for magic in bad_version_magic + malformed_magic:
+        f = BytesIO(magic)
+        assert_raises(ValueError, format.read_array, f)
+
+
+def test_bad_magic_args():
+    assert_raises(ValueError, format.magic, -1, 1)
+    assert_raises(ValueError, format.magic, 256, 1)
+    assert_raises(ValueError, format.magic, 1, -1)
+    assert_raises(ValueError, format.magic, 1, 256)
+
+
+def test_large_header():
+    s = BytesIO()
+    d = {'a': 1, 'b': 2}
+    format.write_array_header_1_0(s, d)
+
+    s = BytesIO()
+    d = {'a': 1, 'b': 2, 'c': 'x'*256*256}
+    assert_raises(ValueError, format.write_array_header_1_0, s, d)
+
+
+def test_read_array_header_1_0():
+    s = BytesIO()
+
+    arr = np.ones((3, 6), dtype=float)
+    format.write_array(s, arr, version=(1, 0))
+
+    s.seek(format.MAGIC_LEN)
+    shape, fortran, dtype = format.read_array_header_1_0(s)
+
+    assert_(s.tell() % format.ARRAY_ALIGN == 0)
+    assert_((shape, fortran, dtype) == ((3, 6), False, float))
+
+
+def test_read_array_header_2_0():
+    s = BytesIO()
+
+    arr = np.ones((3, 6), dtype=float)
+    format.write_array(s, arr, version=(2, 0))
+
+    s.seek(format.MAGIC_LEN)
+    shape, fortran, dtype = format.read_array_header_2_0(s)
+
+    assert_(s.tell() % format.ARRAY_ALIGN == 0)
+    assert_((shape, fortran, dtype) == ((3, 6), False, float))
+
+
+def test_bad_header():
+    # header of length less than 2 should fail
+    s = BytesIO()
+    assert_raises(ValueError, format.read_array_header_1_0, s)
+    s = BytesIO(b'1')
+    assert_raises(ValueError, format.read_array_header_1_0, s)
+
+    # header shorter than indicated size should fail
+    s = BytesIO(b'\x01\x00')
+    assert_raises(ValueError, format.read_array_header_1_0, s)
+
+    # headers without the exact keys required should fail
+    d = {"shape": (1, 2),
+         "descr": "x"}
+    s = BytesIO()
+    format.write_array_header_1_0(s, d)
+    assert_raises(ValueError, format.read_array_header_1_0, s)
+
+    d = {"shape": (1, 2),
+         "fortran_order": False,
+         "descr": "x",
+         "extrakey": -1}
+    s = BytesIO()
+    format.write_array_header_1_0(s, d)
+    assert_raises(ValueError, format.read_array_header_1_0, s)
+
+
+def test_large_file_support():
+    if (sys.platform == 'win32' or sys.platform == 'cygwin'):
+        pytest.skip("Unknown if Windows has sparse filesystems")
+    # try creating a large sparse file
+    tf_name = os.path.join(tempdir, 'sparse_file')
+    try:
+        # seek past end would work too, but linux truncate somewhat
+        # increases the chances that we have a sparse filesystem and can
+        # avoid actually writing 5GB
+        import subprocess as sp
+        sp.check_call(["truncate", "-s", "5368709120", tf_name])
+    except Exception:
+        pytest.skip("Could not create 5GB large file")
+    # write a small array to the end
+    with open(tf_name, "wb") as f:
+        f.seek(5368709120)
+        d = np.arange(5)
+        np.save(f, d)
+    # read it back
+    with open(tf_name, "rb") as f:
+        f.seek(5368709120)
+        r = np.load(f)
+    assert_array_equal(r, d)
+
+
+@pytest.mark.skipif(np.dtype(np.intp).itemsize < 8,
+                    reason="test requires 64-bit system")
+@pytest.mark.slow
+def test_large_archive():
+    # Regression test for product of saving arrays with dimensions of array
+    # having a product that doesn't fit in int32.  See gh-7598 for details.
+    try:
+        a = np.empty((2**30, 2), dtype=np.uint8)
+    except MemoryError:
+        pytest.skip("Could not create large file")
+
+    fname = os.path.join(tempdir, "large_archive")
+
+    with open(fname, "wb") as f:
+        np.savez(f, arr=a)
+
+    with open(fname, "rb") as f:
+        new_a = np.load(f)["arr"]
+
+    assert_(a.shape == new_a.shape)
+
+
+def test_empty_npz():
+    # Test for gh-9989
+    fname = os.path.join(tempdir, "nothing.npz")
+    np.savez(fname)
+    np.load(fname)
+
+
+def test_unicode_field_names():
+    # gh-7391
+    arr = np.array([
+        (1, 3),
+        (1, 2),
+        (1, 3),
+        (1, 2)
+    ], dtype=[
+        ('int', int),
+        (u'\N{CJK UNIFIED IDEOGRAPH-6574}\N{CJK UNIFIED IDEOGRAPH-5F62}', int)
+    ])
+    fname = os.path.join(tempdir, "unicode.npy")
+    with open(fname, 'wb') as f:
+        format.write_array(f, arr, version=(3, 0))
+    with open(fname, 'rb') as f:
+        arr2 = format.read_array(f)
+    assert_array_equal(arr, arr2)
+
+    # notifies the user that 3.0 is selected
+    with open(fname, 'wb') as f:
+        with assert_warns(UserWarning):
+            format.write_array(f, arr, version=None)
+
+
+@pytest.mark.parametrize('dt, fail', [
+    (np.dtype({'names': ['a', 'b'], 'formats':  [float, np.dtype('S3',
+                 metadata={'some': 'stuff'})]}), True),
+    (np.dtype(int, metadata={'some': 'stuff'}), False),
+    (np.dtype([('subarray', (int, (2,)))], metadata={'some': 'stuff'}), False),
+    # recursive: metadata on the field of a dtype
+    (np.dtype({'names': ['a', 'b'], 'formats': [
+        float, np.dtype({'names': ['c'], 'formats': [np.dtype(int, metadata={})]})
+    ]}), False)
+    ])
+def test_metadata_dtype(dt, fail):
+    # gh-14142
+    arr = np.ones(10, dtype=dt)
+    buf = BytesIO()
+    with assert_warns(UserWarning):
+        np.save(buf, arr)
+    buf.seek(0)
+    if fail:
+        with assert_raises(ValueError):
+            np.load(buf)
+    else:
+        arr2 = np.load(buf)
+        # BUG: assert_array_equal does not check metadata
+        from numpy.lib.format import _has_metadata
+        assert_array_equal(arr, arr2)
+        assert _has_metadata(arr.dtype)
+        assert not _has_metadata(arr2.dtype)
+
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_function_base.py b/venv/Lib/site-packages/numpy/lib/tests/test_function_base.py
new file mode 100644
index 000000000..b26da29c6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_function_base.py
@@ -0,0 +1,3392 @@
+import operator
+import warnings
+import sys
+import decimal
+from fractions import Fraction
+import math
+import pytest
+
+import numpy as np
+from numpy import ma
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_almost_equal,
+    assert_array_almost_equal, assert_raises, assert_allclose, IS_PYPY,
+    assert_warns, assert_raises_regex, suppress_warnings, HAS_REFCOUNT,
+    )
+import numpy.lib.function_base as nfb
+from numpy.random import rand
+from numpy.lib import (
+    add_newdoc_ufunc, angle, average, bartlett, blackman, corrcoef, cov,
+    delete, diff, digitize, extract, flipud, gradient, hamming, hanning,
+    i0, insert, interp, kaiser, meshgrid, msort, piecewise, place, rot90,
+    select, setxor1d, sinc, trapz, trim_zeros, unwrap, unique, vectorize
+    )
+
+
+def get_mat(n):
+    data = np.arange(n)
+    data = np.add.outer(data, data)
+    return data
+
+
+def _make_complex(real, imag):
+    """
+    Like real + 1j * imag, but behaves as expected when imag contains non-finite
+    values
+    """
+    ret = np.zeros(np.broadcast(real, imag).shape, np.complex_)
+    ret.real = real
+    ret.imag = imag
+    return ret
+
+
+class TestRot90:
+    def test_basic(self):
+        assert_raises(ValueError, rot90, np.ones(4))
+        assert_raises(ValueError, rot90, np.ones((2,2,2)), axes=(0,1,2))
+        assert_raises(ValueError, rot90, np.ones((2,2)), axes=(0,2))
+        assert_raises(ValueError, rot90, np.ones((2,2)), axes=(1,1))
+        assert_raises(ValueError, rot90, np.ones((2,2,2)), axes=(-2,1))
+
+        a = [[0, 1, 2],
+             [3, 4, 5]]
+        b1 = [[2, 5],
+              [1, 4],
+              [0, 3]]
+        b2 = [[5, 4, 3],
+              [2, 1, 0]]
+        b3 = [[3, 0],
+              [4, 1],
+              [5, 2]]
+        b4 = [[0, 1, 2],
+              [3, 4, 5]]
+
+        for k in range(-3, 13, 4):
+            assert_equal(rot90(a, k=k), b1)
+        for k in range(-2, 13, 4):
+            assert_equal(rot90(a, k=k), b2)
+        for k in range(-1, 13, 4):
+            assert_equal(rot90(a, k=k), b3)
+        for k in range(0, 13, 4):
+            assert_equal(rot90(a, k=k), b4)
+
+        assert_equal(rot90(rot90(a, axes=(0,1)), axes=(1,0)), a)
+        assert_equal(rot90(a, k=1, axes=(1,0)), rot90(a, k=-1, axes=(0,1)))
+
+    def test_axes(self):
+        a = np.ones((50, 40, 3))
+        assert_equal(rot90(a).shape, (40, 50, 3))
+        assert_equal(rot90(a, axes=(0,2)), rot90(a, axes=(0,-1)))
+        assert_equal(rot90(a, axes=(1,2)), rot90(a, axes=(-2,-1)))
+
+    def test_rotation_axes(self):
+        a = np.arange(8).reshape((2,2,2))
+
+        a_rot90_01 = [[[2, 3],
+                       [6, 7]],
+                      [[0, 1],
+                       [4, 5]]]
+        a_rot90_12 = [[[1, 3],
+                       [0, 2]],
+                      [[5, 7],
+                       [4, 6]]]
+        a_rot90_20 = [[[4, 0],
+                       [6, 2]],
+                      [[5, 1],
+                       [7, 3]]]
+        a_rot90_10 = [[[4, 5],
+                       [0, 1]],
+                      [[6, 7],
+                       [2, 3]]]
+
+        assert_equal(rot90(a, axes=(0, 1)), a_rot90_01)
+        assert_equal(rot90(a, axes=(1, 0)), a_rot90_10)
+        assert_equal(rot90(a, axes=(1, 2)), a_rot90_12)
+
+        for k in range(1,5):
+            assert_equal(rot90(a, k=k, axes=(2, 0)),
+                         rot90(a_rot90_20, k=k-1, axes=(2, 0)))
+
+
+class TestFlip:
+
+    def test_axes(self):
+        assert_raises(np.AxisError, np.flip, np.ones(4), axis=1)
+        assert_raises(np.AxisError, np.flip, np.ones((4, 4)), axis=2)
+        assert_raises(np.AxisError, np.flip, np.ones((4, 4)), axis=-3)
+        assert_raises(np.AxisError, np.flip, np.ones((4, 4)), axis=(0, 3))
+
+    def test_basic_lr(self):
+        a = get_mat(4)
+        b = a[:, ::-1]
+        assert_equal(np.flip(a, 1), b)
+        a = [[0, 1, 2],
+             [3, 4, 5]]
+        b = [[2, 1, 0],
+             [5, 4, 3]]
+        assert_equal(np.flip(a, 1), b)
+
+    def test_basic_ud(self):
+        a = get_mat(4)
+        b = a[::-1, :]
+        assert_equal(np.flip(a, 0), b)
+        a = [[0, 1, 2],
+             [3, 4, 5]]
+        b = [[3, 4, 5],
+             [0, 1, 2]]
+        assert_equal(np.flip(a, 0), b)
+
+    def test_3d_swap_axis0(self):
+        a = np.array([[[0, 1],
+                       [2, 3]],
+                      [[4, 5],
+                       [6, 7]]])
+
+        b = np.array([[[4, 5],
+                       [6, 7]],
+                      [[0, 1],
+                       [2, 3]]])
+
+        assert_equal(np.flip(a, 0), b)
+
+    def test_3d_swap_axis1(self):
+        a = np.array([[[0, 1],
+                       [2, 3]],
+                      [[4, 5],
+                       [6, 7]]])
+
+        b = np.array([[[2, 3],
+                       [0, 1]],
+                      [[6, 7],
+                       [4, 5]]])
+
+        assert_equal(np.flip(a, 1), b)
+
+    def test_3d_swap_axis2(self):
+        a = np.array([[[0, 1],
+                       [2, 3]],
+                      [[4, 5],
+                       [6, 7]]])
+
+        b = np.array([[[1, 0],
+                       [3, 2]],
+                      [[5, 4],
+                       [7, 6]]])
+
+        assert_equal(np.flip(a, 2), b)
+
+    def test_4d(self):
+        a = np.arange(2 * 3 * 4 * 5).reshape(2, 3, 4, 5)
+        for i in range(a.ndim):
+            assert_equal(np.flip(a, i),
+                         np.flipud(a.swapaxes(0, i)).swapaxes(i, 0))
+
+    def test_default_axis(self):
+        a = np.array([[1, 2, 3],
+                      [4, 5, 6]])
+        b = np.array([[6, 5, 4],
+                      [3, 2, 1]])
+        assert_equal(np.flip(a), b)
+
+    def test_multiple_axes(self):
+        a = np.array([[[0, 1],
+                       [2, 3]],
+                      [[4, 5],
+                       [6, 7]]])
+
+        assert_equal(np.flip(a, axis=()), a)
+
+        b = np.array([[[5, 4],
+                       [7, 6]],
+                      [[1, 0],
+                       [3, 2]]])
+
+        assert_equal(np.flip(a, axis=(0, 2)), b)
+
+        c = np.array([[[3, 2],
+                       [1, 0]],
+                      [[7, 6],
+                       [5, 4]]])
+
+        assert_equal(np.flip(a, axis=(1, 2)), c)
+
+
+class TestAny:
+
+    def test_basic(self):
+        y1 = [0, 0, 1, 0]
+        y2 = [0, 0, 0, 0]
+        y3 = [1, 0, 1, 0]
+        assert_(np.any(y1))
+        assert_(np.any(y3))
+        assert_(not np.any(y2))
+
+    def test_nd(self):
+        y1 = [[0, 0, 0], [0, 1, 0], [1, 1, 0]]
+        assert_(np.any(y1))
+        assert_array_equal(np.sometrue(y1, axis=0), [1, 1, 0])
+        assert_array_equal(np.sometrue(y1, axis=1), [0, 1, 1])
+
+
+class TestAll:
+
+    def test_basic(self):
+        y1 = [0, 1, 1, 0]
+        y2 = [0, 0, 0, 0]
+        y3 = [1, 1, 1, 1]
+        assert_(not np.all(y1))
+        assert_(np.all(y3))
+        assert_(not np.all(y2))
+        assert_(np.all(~np.array(y2)))
+
+    def test_nd(self):
+        y1 = [[0, 0, 1], [0, 1, 1], [1, 1, 1]]
+        assert_(not np.all(y1))
+        assert_array_equal(np.alltrue(y1, axis=0), [0, 0, 1])
+        assert_array_equal(np.alltrue(y1, axis=1), [0, 0, 1])
+
+
+class TestCopy:
+
+    def test_basic(self):
+        a = np.array([[1, 2], [3, 4]])
+        a_copy = np.copy(a)
+        assert_array_equal(a, a_copy)
+        a_copy[0, 0] = 10
+        assert_equal(a[0, 0], 1)
+        assert_equal(a_copy[0, 0], 10)
+
+    def test_order(self):
+        # It turns out that people rely on np.copy() preserving order by
+        # default; changing this broke scikit-learn:
+        # github.com/scikit-learn/scikit-learn/commit/7842748cf777412c506a8c0ed28090711d3a3783  # noqa
+        a = np.array([[1, 2], [3, 4]])
+        assert_(a.flags.c_contiguous)
+        assert_(not a.flags.f_contiguous)
+        a_fort = np.array([[1, 2], [3, 4]], order="F")
+        assert_(not a_fort.flags.c_contiguous)
+        assert_(a_fort.flags.f_contiguous)
+        a_copy = np.copy(a)
+        assert_(a_copy.flags.c_contiguous)
+        assert_(not a_copy.flags.f_contiguous)
+        a_fort_copy = np.copy(a_fort)
+        assert_(not a_fort_copy.flags.c_contiguous)
+        assert_(a_fort_copy.flags.f_contiguous)
+
+    def test_subok(self):
+        mx = ma.ones(5)
+        assert_(not ma.isMaskedArray(np.copy(mx, subok=False)))
+        assert_(ma.isMaskedArray(np.copy(mx, subok=True)))
+        # Default behavior
+        assert_(not ma.isMaskedArray(np.copy(mx)))
+
+
+class TestAverage:
+
+    def test_basic(self):
+        y1 = np.array([1, 2, 3])
+        assert_(average(y1, axis=0) == 2.)
+        y2 = np.array([1., 2., 3.])
+        assert_(average(y2, axis=0) == 2.)
+        y3 = [0., 0., 0.]
+        assert_(average(y3, axis=0) == 0.)
+
+        y4 = np.ones((4, 4))
+        y4[0, 1] = 0
+        y4[1, 0] = 2
+        assert_almost_equal(y4.mean(0), average(y4, 0))
+        assert_almost_equal(y4.mean(1), average(y4, 1))
+
+        y5 = rand(5, 5)
+        assert_almost_equal(y5.mean(0), average(y5, 0))
+        assert_almost_equal(y5.mean(1), average(y5, 1))
+
+    def test_weights(self):
+        y = np.arange(10)
+        w = np.arange(10)
+        actual = average(y, weights=w)
+        desired = (np.arange(10) ** 2).sum() * 1. / np.arange(10).sum()
+        assert_almost_equal(actual, desired)
+
+        y1 = np.array([[1, 2, 3], [4, 5, 6]])
+        w0 = [1, 2]
+        actual = average(y1, weights=w0, axis=0)
+        desired = np.array([3., 4., 5.])
+        assert_almost_equal(actual, desired)
+
+        w1 = [0, 0, 1]
+        actual = average(y1, weights=w1, axis=1)
+        desired = np.array([3., 6.])
+        assert_almost_equal(actual, desired)
+
+        # This should raise an error. Can we test for that ?
+        # assert_equal(average(y1, weights=w1), 9./2.)
+
+        # 2D Case
+        w2 = [[0, 0, 1], [0, 0, 2]]
+        desired = np.array([3., 6.])
+        assert_array_equal(average(y1, weights=w2, axis=1), desired)
+        assert_equal(average(y1, weights=w2), 5.)
+
+        y3 = rand(5).astype(np.float32)
+        w3 = rand(5).astype(np.float64)
+
+        assert_(np.average(y3, weights=w3).dtype == np.result_type(y3, w3))
+
+    def test_returned(self):
+        y = np.array([[1, 2, 3], [4, 5, 6]])
+
+        # No weights
+        avg, scl = average(y, returned=True)
+        assert_equal(scl, 6.)
+
+        avg, scl = average(y, 0, returned=True)
+        assert_array_equal(scl, np.array([2., 2., 2.]))
+
+        avg, scl = average(y, 1, returned=True)
+        assert_array_equal(scl, np.array([3., 3.]))
+
+        # With weights
+        w0 = [1, 2]
+        avg, scl = average(y, weights=w0, axis=0, returned=True)
+        assert_array_equal(scl, np.array([3., 3., 3.]))
+
+        w1 = [1, 2, 3]
+        avg, scl = average(y, weights=w1, axis=1, returned=True)
+        assert_array_equal(scl, np.array([6., 6.]))
+
+        w2 = [[0, 0, 1], [1, 2, 3]]
+        avg, scl = average(y, weights=w2, axis=1, returned=True)
+        assert_array_equal(scl, np.array([1., 6.]))
+
+    def test_subclasses(self):
+        class subclass(np.ndarray):
+            pass
+        a = np.array([[1,2],[3,4]]).view(subclass)
+        w = np.array([[1,2],[3,4]]).view(subclass)
+
+        assert_equal(type(np.average(a)), subclass)
+        assert_equal(type(np.average(a, weights=w)), subclass)
+
+    def test_upcasting(self):
+        typs = [('i4', 'i4', 'f8'), ('i4', 'f4', 'f8'), ('f4', 'i4', 'f8'),
+                 ('f4', 'f4', 'f4'), ('f4', 'f8', 'f8')]
+        for at, wt, rt in typs:
+            a = np.array([[1,2],[3,4]], dtype=at)
+            w = np.array([[1,2],[3,4]], dtype=wt)
+            assert_equal(np.average(a, weights=w).dtype, np.dtype(rt))
+
+    def test_object_dtype(self):
+        a = np.array([decimal.Decimal(x) for x in range(10)])
+        w = np.array([decimal.Decimal(1) for _ in range(10)])
+        w /= w.sum()
+        assert_almost_equal(a.mean(0), average(a, weights=w))
+
+class TestSelect:
+    choices = [np.array([1, 2, 3]),
+               np.array([4, 5, 6]),
+               np.array([7, 8, 9])]
+    conditions = [np.array([False, False, False]),
+                  np.array([False, True, False]),
+                  np.array([False, False, True])]
+
+    def _select(self, cond, values, default=0):
+        output = []
+        for m in range(len(cond)):
+            output += [V[m] for V, C in zip(values, cond) if C[m]] or [default]
+        return output
+
+    def test_basic(self):
+        choices = self.choices
+        conditions = self.conditions
+        assert_array_equal(select(conditions, choices, default=15),
+                           self._select(conditions, choices, default=15))
+
+        assert_equal(len(choices), 3)
+        assert_equal(len(conditions), 3)
+
+    def test_broadcasting(self):
+        conditions = [np.array(True), np.array([False, True, False])]
+        choices = [1, np.arange(12).reshape(4, 3)]
+        assert_array_equal(select(conditions, choices), np.ones((4, 3)))
+        # default can broadcast too:
+        assert_equal(select([True], [0], default=[0]).shape, (1,))
+
+    def test_return_dtype(self):
+        assert_equal(select(self.conditions, self.choices, 1j).dtype,
+                     np.complex_)
+        # But the conditions need to be stronger then the scalar default
+        # if it is scalar.
+        choices = [choice.astype(np.int8) for choice in self.choices]
+        assert_equal(select(self.conditions, choices).dtype, np.int8)
+
+        d = np.array([1, 2, 3, np.nan, 5, 7])
+        m = np.isnan(d)
+        assert_equal(select([m], [d]), [0, 0, 0, np.nan, 0, 0])
+
+    def test_deprecated_empty(self):
+        assert_raises(ValueError, select, [], [], 3j)
+        assert_raises(ValueError, select, [], [])
+
+    def test_non_bool_deprecation(self):
+        choices = self.choices
+        conditions = self.conditions[:]
+        conditions[0] = conditions[0].astype(np.int_)
+        assert_raises(TypeError, select, conditions, choices)
+        conditions[0] = conditions[0].astype(np.uint8)
+        assert_raises(TypeError, select, conditions, choices)
+        assert_raises(TypeError, select, conditions, choices)
+
+    def test_many_arguments(self):
+        # This used to be limited by NPY_MAXARGS == 32
+        conditions = [np.array([False])] * 100
+        choices = [np.array([1])] * 100
+        select(conditions, choices)
+
+
+class TestInsert:
+
+    def test_basic(self):
+        a = [1, 2, 3]
+        assert_equal(insert(a, 0, 1), [1, 1, 2, 3])
+        assert_equal(insert(a, 3, 1), [1, 2, 3, 1])
+        assert_equal(insert(a, [1, 1, 1], [1, 2, 3]), [1, 1, 2, 3, 2, 3])
+        assert_equal(insert(a, 1, [1, 2, 3]), [1, 1, 2, 3, 2, 3])
+        assert_equal(insert(a, [1, -1, 3], 9), [1, 9, 2, 9, 3, 9])
+        assert_equal(insert(a, slice(-1, None, -1), 9), [9, 1, 9, 2, 9, 3])
+        assert_equal(insert(a, [-1, 1, 3], [7, 8, 9]), [1, 8, 2, 7, 3, 9])
+        b = np.array([0, 1], dtype=np.float64)
+        assert_equal(insert(b, 0, b[0]), [0., 0., 1.])
+        assert_equal(insert(b, [], []), b)
+        # Bools will be treated differently in the future:
+        # assert_equal(insert(a, np.array([True]*4), 9), [9, 1, 9, 2, 9, 3, 9])
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', FutureWarning)
+            assert_equal(
+                insert(a, np.array([True] * 4), 9), [1, 9, 9, 9, 9, 2, 3])
+            assert_(w[0].category is FutureWarning)
+
+    def test_multidim(self):
+        a = [[1, 1, 1]]
+        r = [[2, 2, 2],
+             [1, 1, 1]]
+        assert_equal(insert(a, 0, [1]), [1, 1, 1, 1])
+        assert_equal(insert(a, 0, [2, 2, 2], axis=0), r)
+        assert_equal(insert(a, 0, 2, axis=0), r)
+        assert_equal(insert(a, 2, 2, axis=1), [[1, 1, 2, 1]])
+
+        a = np.array([[1, 1], [2, 2], [3, 3]])
+        b = np.arange(1, 4).repeat(3).reshape(3, 3)
+        c = np.concatenate(
+            (a[:, 0:1], np.arange(1, 4).repeat(3).reshape(3, 3).T,
+             a[:, 1:2]), axis=1)
+        assert_equal(insert(a, [1], [[1], [2], [3]], axis=1), b)
+        assert_equal(insert(a, [1], [1, 2, 3], axis=1), c)
+        # scalars behave differently, in this case exactly opposite:
+        assert_equal(insert(a, 1, [1, 2, 3], axis=1), b)
+        assert_equal(insert(a, 1, [[1], [2], [3]], axis=1), c)
+
+        a = np.arange(4).reshape(2, 2)
+        assert_equal(insert(a[:, :1], 1, a[:, 1], axis=1), a)
+        assert_equal(insert(a[:1,:], 1, a[1,:], axis=0), a)
+
+        # negative axis value
+        a = np.arange(24).reshape((2, 3, 4))
+        assert_equal(insert(a, 1, a[:,:, 3], axis=-1),
+                     insert(a, 1, a[:,:, 3], axis=2))
+        assert_equal(insert(a, 1, a[:, 2,:], axis=-2),
+                     insert(a, 1, a[:, 2,:], axis=1))
+
+        # invalid axis value
+        assert_raises(np.AxisError, insert, a, 1, a[:, 2, :], axis=3)
+        assert_raises(np.AxisError, insert, a, 1, a[:, 2, :], axis=-4)
+
+        # negative axis value
+        a = np.arange(24).reshape((2, 3, 4))
+        assert_equal(insert(a, 1, a[:, :, 3], axis=-1),
+                     insert(a, 1, a[:, :, 3], axis=2))
+        assert_equal(insert(a, 1, a[:, 2, :], axis=-2),
+                     insert(a, 1, a[:, 2, :], axis=1))
+
+    def test_0d(self):
+        a = np.array(1)
+        with pytest.raises(np.AxisError):
+            insert(a, [], 2, axis=0)
+        with pytest.raises(TypeError):
+            insert(a, [], 2, axis="nonsense")
+
+    def test_subclass(self):
+        class SubClass(np.ndarray):
+            pass
+        a = np.arange(10).view(SubClass)
+        assert_(isinstance(np.insert(a, 0, [0]), SubClass))
+        assert_(isinstance(np.insert(a, [], []), SubClass))
+        assert_(isinstance(np.insert(a, [0, 1], [1, 2]), SubClass))
+        assert_(isinstance(np.insert(a, slice(1, 2), [1, 2]), SubClass))
+        assert_(isinstance(np.insert(a, slice(1, -2, -1), []), SubClass))
+        # This is an error in the future:
+        a = np.array(1).view(SubClass)
+        assert_(isinstance(np.insert(a, 0, [0]), SubClass))
+
+    def test_index_array_copied(self):
+        x = np.array([1, 1, 1])
+        np.insert([0, 1, 2], x, [3, 4, 5])
+        assert_equal(x, np.array([1, 1, 1]))
+
+    def test_structured_array(self):
+        a = np.array([(1, 'a'), (2, 'b'), (3, 'c')],
+                     dtype=[('foo', 'i'), ('bar', 'a1')])
+        val = (4, 'd')
+        b = np.insert(a, 0, val)
+        assert_array_equal(b[0], np.array(val, dtype=b.dtype))
+        val = [(4, 'd')] * 2
+        b = np.insert(a, [0, 2], val)
+        assert_array_equal(b[[0, 3]], np.array(val, dtype=b.dtype))
+
+    def test_index_floats(self):
+        with pytest.raises(IndexError):
+            np.insert([0, 1, 2], np.array([1.0, 2.0]), [10, 20])
+        with pytest.raises(IndexError):
+            np.insert([0, 1, 2], np.array([], dtype=float), [])
+
+
+class TestAmax:
+
+    def test_basic(self):
+        a = [3, 4, 5, 10, -3, -5, 6.0]
+        assert_equal(np.amax(a), 10.0)
+        b = [[3, 6.0, 9.0],
+             [4, 10.0, 5.0],
+             [8, 3.0, 2.0]]
+        assert_equal(np.amax(b, axis=0), [8.0, 10.0, 9.0])
+        assert_equal(np.amax(b, axis=1), [9.0, 10.0, 8.0])
+
+
+class TestAmin:
+
+    def test_basic(self):
+        a = [3, 4, 5, 10, -3, -5, 6.0]
+        assert_equal(np.amin(a), -5.0)
+        b = [[3, 6.0, 9.0],
+             [4, 10.0, 5.0],
+             [8, 3.0, 2.0]]
+        assert_equal(np.amin(b, axis=0), [3.0, 3.0, 2.0])
+        assert_equal(np.amin(b, axis=1), [3.0, 4.0, 2.0])
+
+
+class TestPtp:
+
+    def test_basic(self):
+        a = np.array([3, 4, 5, 10, -3, -5, 6.0])
+        assert_equal(a.ptp(axis=0), 15.0)
+        b = np.array([[3, 6.0, 9.0],
+                      [4, 10.0, 5.0],
+                      [8, 3.0, 2.0]])
+        assert_equal(b.ptp(axis=0), [5.0, 7.0, 7.0])
+        assert_equal(b.ptp(axis=-1), [6.0, 6.0, 6.0])
+
+        assert_equal(b.ptp(axis=0, keepdims=True), [[5.0, 7.0, 7.0]])
+        assert_equal(b.ptp(axis=(0,1), keepdims=True), [[8.0]])
+
+
+class TestCumsum:
+
+    def test_basic(self):
+        ba = [1, 2, 10, 11, 6, 5, 4]
+        ba2 = [[1, 2, 3, 4], [5, 6, 7, 9], [10, 3, 4, 5]]
+        for ctype in [np.int8, np.uint8, np.int16, np.uint16, np.int32,
+                      np.uint32, np.float32, np.float64, np.complex64,
+                      np.complex128]:
+            a = np.array(ba, ctype)
+            a2 = np.array(ba2, ctype)
+
+            tgt = np.array([1, 3, 13, 24, 30, 35, 39], ctype)
+            assert_array_equal(np.cumsum(a, axis=0), tgt)
+
+            tgt = np.array(
+                [[1, 2, 3, 4], [6, 8, 10, 13], [16, 11, 14, 18]], ctype)
+            assert_array_equal(np.cumsum(a2, axis=0), tgt)
+
+            tgt = np.array(
+                [[1, 3, 6, 10], [5, 11, 18, 27], [10, 13, 17, 22]], ctype)
+            assert_array_equal(np.cumsum(a2, axis=1), tgt)
+
+
+class TestProd:
+
+    def test_basic(self):
+        ba = [1, 2, 10, 11, 6, 5, 4]
+        ba2 = [[1, 2, 3, 4], [5, 6, 7, 9], [10, 3, 4, 5]]
+        for ctype in [np.int16, np.uint16, np.int32, np.uint32,
+                      np.float32, np.float64, np.complex64, np.complex128]:
+            a = np.array(ba, ctype)
+            a2 = np.array(ba2, ctype)
+            if ctype in ['1', 'b']:
+                assert_raises(ArithmeticError, np.prod, a)
+                assert_raises(ArithmeticError, np.prod, a2, 1)
+            else:
+                assert_equal(a.prod(axis=0), 26400)
+                assert_array_equal(a2.prod(axis=0),
+                                   np.array([50, 36, 84, 180], ctype))
+                assert_array_equal(a2.prod(axis=-1),
+                                   np.array([24, 1890, 600], ctype))
+
+
+class TestCumprod:
+
+    def test_basic(self):
+        ba = [1, 2, 10, 11, 6, 5, 4]
+        ba2 = [[1, 2, 3, 4], [5, 6, 7, 9], [10, 3, 4, 5]]
+        for ctype in [np.int16, np.uint16, np.int32, np.uint32,
+                      np.float32, np.float64, np.complex64, np.complex128]:
+            a = np.array(ba, ctype)
+            a2 = np.array(ba2, ctype)
+            if ctype in ['1', 'b']:
+                assert_raises(ArithmeticError, np.cumprod, a)
+                assert_raises(ArithmeticError, np.cumprod, a2, 1)
+                assert_raises(ArithmeticError, np.cumprod, a)
+            else:
+                assert_array_equal(np.cumprod(a, axis=-1),
+                                   np.array([1, 2, 20, 220,
+                                             1320, 6600, 26400], ctype))
+                assert_array_equal(np.cumprod(a2, axis=0),
+                                   np.array([[1, 2, 3, 4],
+                                             [5, 12, 21, 36],
+                                             [50, 36, 84, 180]], ctype))
+                assert_array_equal(np.cumprod(a2, axis=-1),
+                                   np.array([[1, 2, 6, 24],
+                                             [5, 30, 210, 1890],
+                                             [10, 30, 120, 600]], ctype))
+
+
+class TestDiff:
+
+    def test_basic(self):
+        x = [1, 4, 6, 7, 12]
+        out = np.array([3, 2, 1, 5])
+        out2 = np.array([-1, -1, 4])
+        out3 = np.array([0, 5])
+        assert_array_equal(diff(x), out)
+        assert_array_equal(diff(x, n=2), out2)
+        assert_array_equal(diff(x, n=3), out3)
+
+        x = [1.1, 2.2, 3.0, -0.2, -0.1]
+        out = np.array([1.1, 0.8, -3.2, 0.1])
+        assert_almost_equal(diff(x), out)
+
+        x = [True, True, False, False]
+        out = np.array([False, True, False])
+        out2 = np.array([True, True])
+        assert_array_equal(diff(x), out)
+        assert_array_equal(diff(x, n=2), out2)
+
+    def test_axis(self):
+        x = np.zeros((10, 20, 30))
+        x[:, 1::2, :] = 1
+        exp = np.ones((10, 19, 30))
+        exp[:, 1::2, :] = -1
+        assert_array_equal(diff(x), np.zeros((10, 20, 29)))
+        assert_array_equal(diff(x, axis=-1), np.zeros((10, 20, 29)))
+        assert_array_equal(diff(x, axis=0), np.zeros((9, 20, 30)))
+        assert_array_equal(diff(x, axis=1), exp)
+        assert_array_equal(diff(x, axis=-2), exp)
+        assert_raises(np.AxisError, diff, x, axis=3)
+        assert_raises(np.AxisError, diff, x, axis=-4)
+
+        x = np.array(1.11111111111, np.float64)
+        assert_raises(ValueError, diff, x)
+
+    def test_nd(self):
+        x = 20 * rand(10, 20, 30)
+        out1 = x[:, :, 1:] - x[:, :, :-1]
+        out2 = out1[:, :, 1:] - out1[:, :, :-1]
+        out3 = x[1:, :, :] - x[:-1, :, :]
+        out4 = out3[1:, :, :] - out3[:-1, :, :]
+        assert_array_equal(diff(x), out1)
+        assert_array_equal(diff(x, n=2), out2)
+        assert_array_equal(diff(x, axis=0), out3)
+        assert_array_equal(diff(x, n=2, axis=0), out4)
+
+    def test_n(self):
+        x = list(range(3))
+        assert_raises(ValueError, diff, x, n=-1)
+        output = [diff(x, n=n) for n in range(1, 5)]
+        expected = [[1, 1], [0], [], []]
+        assert_(diff(x, n=0) is x)
+        for n, (expected, out) in enumerate(zip(expected, output), start=1):
+            assert_(type(out) is np.ndarray)
+            assert_array_equal(out, expected)
+            assert_equal(out.dtype, np.int_)
+            assert_equal(len(out), max(0, len(x) - n))
+
+    def test_times(self):
+        x = np.arange('1066-10-13', '1066-10-16', dtype=np.datetime64)
+        expected = [
+            np.array([1, 1], dtype='timedelta64[D]'),
+            np.array([0], dtype='timedelta64[D]'),
+        ]
+        expected.extend([np.array([], dtype='timedelta64[D]')] * 3)
+        for n, exp in enumerate(expected, start=1):
+            out = diff(x, n=n)
+            assert_array_equal(out, exp)
+            assert_equal(out.dtype, exp.dtype)
+
+    def test_subclass(self):
+        x = ma.array([[1, 2], [3, 4], [5, 6], [7, 8], [9, 10]],
+                     mask=[[False, False], [True, False],
+                           [False, True], [True, True], [False, False]])
+        out = diff(x)
+        assert_array_equal(out.data, [[1], [1], [1], [1], [1]])
+        assert_array_equal(out.mask, [[False], [True],
+                                      [True], [True], [False]])
+        assert_(type(out) is type(x))
+
+        out3 = diff(x, n=3)
+        assert_array_equal(out3.data, [[], [], [], [], []])
+        assert_array_equal(out3.mask, [[], [], [], [], []])
+        assert_(type(out3) is type(x))
+
+    def test_prepend(self):
+        x = np.arange(5) + 1
+        assert_array_equal(diff(x, prepend=0), np.ones(5))
+        assert_array_equal(diff(x, prepend=[0]), np.ones(5))
+        assert_array_equal(np.cumsum(np.diff(x, prepend=0)), x)
+        assert_array_equal(diff(x, prepend=[-1, 0]), np.ones(6))
+
+        x = np.arange(4).reshape(2, 2)
+        result = np.diff(x, axis=1, prepend=0)
+        expected = [[0, 1], [2, 1]]
+        assert_array_equal(result, expected)
+        result = np.diff(x, axis=1, prepend=[[0], [0]])
+        assert_array_equal(result, expected)
+
+        result = np.diff(x, axis=0, prepend=0)
+        expected = [[0, 1], [2, 2]]
+        assert_array_equal(result, expected)
+        result = np.diff(x, axis=0, prepend=[[0, 0]])
+        assert_array_equal(result, expected)
+
+        assert_raises(ValueError, np.diff, x, prepend=np.zeros((3,3)))
+
+        assert_raises(np.AxisError, diff, x, prepend=0, axis=3)
+
+    def test_append(self):
+        x = np.arange(5)
+        result = diff(x, append=0)
+        expected = [1, 1, 1, 1, -4]
+        assert_array_equal(result, expected)
+        result = diff(x, append=[0])
+        assert_array_equal(result, expected)
+        result = diff(x, append=[0, 2])
+        expected = expected + [2]
+        assert_array_equal(result, expected)
+
+        x = np.arange(4).reshape(2, 2)
+        result = np.diff(x, axis=1, append=0)
+        expected = [[1, -1], [1, -3]]
+        assert_array_equal(result, expected)
+        result = np.diff(x, axis=1, append=[[0], [0]])
+        assert_array_equal(result, expected)
+
+        result = np.diff(x, axis=0, append=0)
+        expected = [[2, 2], [-2, -3]]
+        assert_array_equal(result, expected)
+        result = np.diff(x, axis=0, append=[[0, 0]])
+        assert_array_equal(result, expected)
+
+        assert_raises(ValueError, np.diff, x, append=np.zeros((3,3)))
+
+        assert_raises(np.AxisError, diff, x, append=0, axis=3)
+
+
+class TestDelete:
+
+    def setup(self):
+        self.a = np.arange(5)
+        self.nd_a = np.arange(5).repeat(2).reshape(1, 5, 2)
+
+    def _check_inverse_of_slicing(self, indices):
+        a_del = delete(self.a, indices)
+        nd_a_del = delete(self.nd_a, indices, axis=1)
+        msg = 'Delete failed for obj: %r' % indices
+        assert_array_equal(setxor1d(a_del, self.a[indices, ]), self.a,
+                           err_msg=msg)
+        xor = setxor1d(nd_a_del[0,:, 0], self.nd_a[0, indices, 0])
+        assert_array_equal(xor, self.nd_a[0,:, 0], err_msg=msg)
+
+    def test_slices(self):
+        lims = [-6, -2, 0, 1, 2, 4, 5]
+        steps = [-3, -1, 1, 3]
+        for start in lims:
+            for stop in lims:
+                for step in steps:
+                    s = slice(start, stop, step)
+                    self._check_inverse_of_slicing(s)
+
+    def test_fancy(self):
+        self._check_inverse_of_slicing(np.array([[0, 1], [2, 1]]))
+        with pytest.raises(IndexError):
+            delete(self.a, [100])
+        with pytest.raises(IndexError):
+            delete(self.a, [-100])
+
+        self._check_inverse_of_slicing([0, -1, 2, 2])
+
+        self._check_inverse_of_slicing([True, False, False, True, False])
+
+        # not legal, indexing with these would change the dimension
+        with pytest.raises(ValueError):
+            delete(self.a, True)
+        with pytest.raises(ValueError):
+            delete(self.a, False)
+
+        # not enough items
+        with pytest.raises(ValueError):
+            delete(self.a, [False]*4)
+
+    def test_single(self):
+        self._check_inverse_of_slicing(0)
+        self._check_inverse_of_slicing(-4)
+
+    def test_0d(self):
+        a = np.array(1)
+        with pytest.raises(np.AxisError):
+            delete(a, [], axis=0)
+        with pytest.raises(TypeError):
+            delete(a, [], axis="nonsense")
+
+    def test_subclass(self):
+        class SubClass(np.ndarray):
+            pass
+        a = self.a.view(SubClass)
+        assert_(isinstance(delete(a, 0), SubClass))
+        assert_(isinstance(delete(a, []), SubClass))
+        assert_(isinstance(delete(a, [0, 1]), SubClass))
+        assert_(isinstance(delete(a, slice(1, 2)), SubClass))
+        assert_(isinstance(delete(a, slice(1, -2)), SubClass))
+
+    def test_array_order_preserve(self):
+        # See gh-7113
+        k = np.arange(10).reshape(2, 5, order='F')
+        m = delete(k, slice(60, None), axis=1)
+
+        # 'k' is Fortran ordered, and 'm' should have the
+        # same ordering as 'k' and NOT become C ordered
+        assert_equal(m.flags.c_contiguous, k.flags.c_contiguous)
+        assert_equal(m.flags.f_contiguous, k.flags.f_contiguous)
+
+    def test_index_floats(self):
+        with pytest.raises(IndexError):
+            np.delete([0, 1, 2], np.array([1.0, 2.0]))
+        with pytest.raises(IndexError):
+            np.delete([0, 1, 2], np.array([], dtype=float))
+
+
+class TestGradient:
+
+    def test_basic(self):
+        v = [[1, 1], [3, 4]]
+        x = np.array(v)
+        dx = [np.array([[2., 3.], [2., 3.]]),
+              np.array([[0., 0.], [1., 1.]])]
+        assert_array_equal(gradient(x), dx)
+        assert_array_equal(gradient(v), dx)
+
+    def test_args(self):
+        dx = np.cumsum(np.ones(5))
+        dx_uneven = [1., 2., 5., 9., 11.]
+        f_2d = np.arange(25).reshape(5, 5)
+
+        # distances must be scalars or have size equal to gradient[axis]
+        gradient(np.arange(5), 3.)
+        gradient(np.arange(5), np.array(3.))
+        gradient(np.arange(5), dx)
+        # dy is set equal to dx because scalar
+        gradient(f_2d, 1.5)
+        gradient(f_2d, np.array(1.5))
+
+        gradient(f_2d, dx_uneven, dx_uneven)
+        # mix between even and uneven spaces and
+        # mix between scalar and vector
+        gradient(f_2d, dx, 2)
+
+        # 2D but axis specified
+        gradient(f_2d, dx, axis=1)
+
+        # 2d coordinate arguments are not yet allowed
+        assert_raises_regex(ValueError, '.*scalars or 1d',
+            gradient, f_2d, np.stack([dx]*2, axis=-1), 1)
+
+    def test_badargs(self):
+        f_2d = np.arange(25).reshape(5, 5)
+        x = np.cumsum(np.ones(5))
+
+        # wrong sizes
+        assert_raises(ValueError, gradient, f_2d, x, np.ones(2))
+        assert_raises(ValueError, gradient, f_2d, 1, np.ones(2))
+        assert_raises(ValueError, gradient, f_2d, np.ones(2), np.ones(2))
+        # wrong number of arguments
+        assert_raises(TypeError, gradient, f_2d, x)
+        assert_raises(TypeError, gradient, f_2d, x, axis=(0,1))
+        assert_raises(TypeError, gradient, f_2d, x, x, x)
+        assert_raises(TypeError, gradient, f_2d, 1, 1, 1)
+        assert_raises(TypeError, gradient, f_2d, x, x, axis=1)
+        assert_raises(TypeError, gradient, f_2d, 1, 1, axis=1)
+
+    def test_datetime64(self):
+        # Make sure gradient() can handle special types like datetime64
+        x = np.array(
+            ['1910-08-16', '1910-08-11', '1910-08-10', '1910-08-12',
+             '1910-10-12', '1910-12-12', '1912-12-12'],
+            dtype='datetime64[D]')
+        dx = np.array(
+            [-5, -3, 0, 31, 61, 396, 731],
+            dtype='timedelta64[D]')
+        assert_array_equal(gradient(x), dx)
+        assert_(dx.dtype == np.dtype('timedelta64[D]'))
+
+    def test_masked(self):
+        # Make sure that gradient supports subclasses like masked arrays
+        x = np.ma.array([[1, 1], [3, 4]],
+                        mask=[[False, False], [False, False]])
+        out = gradient(x)[0]
+        assert_equal(type(out), type(x))
+        # And make sure that the output and input don't have aliased mask
+        # arrays
+        assert_(x._mask is not out._mask)
+        # Also check that edge_order=2 doesn't alter the original mask
+        x2 = np.ma.arange(5)
+        x2[2] = np.ma.masked
+        np.gradient(x2, edge_order=2)
+        assert_array_equal(x2.mask, [False, False, True, False, False])
+
+    def test_second_order_accurate(self):
+        # Testing that the relative numerical error is less that 3% for
+        # this example problem. This corresponds to second order
+        # accurate finite differences for all interior and boundary
+        # points.
+        x = np.linspace(0, 1, 10)
+        dx = x[1] - x[0]
+        y = 2 * x ** 3 + 4 * x ** 2 + 2 * x
+        analytical = 6 * x ** 2 + 8 * x + 2
+        num_error = np.abs((np.gradient(y, dx, edge_order=2) / analytical) - 1)
+        assert_(np.all(num_error < 0.03) == True)
+
+        # test with unevenly spaced
+        np.random.seed(0)
+        x = np.sort(np.random.random(10))
+        y = 2 * x ** 3 + 4 * x ** 2 + 2 * x
+        analytical = 6 * x ** 2 + 8 * x + 2
+        num_error = np.abs((np.gradient(y, x, edge_order=2) / analytical) - 1)
+        assert_(np.all(num_error < 0.03) == True)
+
+    def test_spacing(self):
+        f = np.array([0, 2., 3., 4., 5., 5.])
+        f = np.tile(f, (6,1)) + f.reshape(-1, 1)
+        x_uneven = np.array([0., 0.5, 1., 3., 5., 7.])
+        x_even = np.arange(6.)
+
+        fdx_even_ord1 = np.tile([2., 1.5, 1., 1., 0.5, 0.], (6,1))
+        fdx_even_ord2 = np.tile([2.5, 1.5, 1., 1., 0.5, -0.5], (6,1))
+        fdx_uneven_ord1 = np.tile([4., 3., 1.7, 0.5, 0.25, 0.], (6,1))
+        fdx_uneven_ord2 = np.tile([5., 3., 1.7, 0.5, 0.25, -0.25], (6,1))
+
+        # evenly spaced
+        for edge_order, exp_res in [(1, fdx_even_ord1), (2, fdx_even_ord2)]:
+            res1 = gradient(f, 1., axis=(0,1), edge_order=edge_order)
+            res2 = gradient(f, x_even, x_even,
+                            axis=(0,1), edge_order=edge_order)
+            res3 = gradient(f, x_even, x_even,
+                            axis=None, edge_order=edge_order)
+            assert_array_equal(res1, res2)
+            assert_array_equal(res2, res3)
+            assert_almost_equal(res1[0], exp_res.T)
+            assert_almost_equal(res1[1], exp_res)
+
+            res1 = gradient(f, 1., axis=0, edge_order=edge_order)
+            res2 = gradient(f, x_even, axis=0, edge_order=edge_order)
+            assert_(res1.shape == res2.shape)
+            assert_almost_equal(res2, exp_res.T)
+
+            res1 = gradient(f, 1., axis=1, edge_order=edge_order)
+            res2 = gradient(f, x_even, axis=1, edge_order=edge_order)
+            assert_(res1.shape == res2.shape)
+            assert_array_equal(res2, exp_res)
+
+        # unevenly spaced
+        for edge_order, exp_res in [(1, fdx_uneven_ord1), (2, fdx_uneven_ord2)]:
+            res1 = gradient(f, x_uneven, x_uneven,
+                            axis=(0,1), edge_order=edge_order)
+            res2 = gradient(f, x_uneven, x_uneven,
+                            axis=None, edge_order=edge_order)
+            assert_array_equal(res1, res2)
+            assert_almost_equal(res1[0], exp_res.T)
+            assert_almost_equal(res1[1], exp_res)
+
+            res1 = gradient(f, x_uneven, axis=0, edge_order=edge_order)
+            assert_almost_equal(res1, exp_res.T)
+
+            res1 = gradient(f, x_uneven, axis=1, edge_order=edge_order)
+            assert_almost_equal(res1, exp_res)
+
+        # mixed
+        res1 = gradient(f, x_even, x_uneven, axis=(0,1), edge_order=1)
+        res2 = gradient(f, x_uneven, x_even, axis=(1,0), edge_order=1)
+        assert_array_equal(res1[0], res2[1])
+        assert_array_equal(res1[1], res2[0])
+        assert_almost_equal(res1[0], fdx_even_ord1.T)
+        assert_almost_equal(res1[1], fdx_uneven_ord1)
+
+        res1 = gradient(f, x_even, x_uneven, axis=(0,1), edge_order=2)
+        res2 = gradient(f, x_uneven, x_even, axis=(1,0), edge_order=2)
+        assert_array_equal(res1[0], res2[1])
+        assert_array_equal(res1[1], res2[0])
+        assert_almost_equal(res1[0], fdx_even_ord2.T)
+        assert_almost_equal(res1[1], fdx_uneven_ord2)
+
+    def test_specific_axes(self):
+        # Testing that gradient can work on a given axis only
+        v = [[1, 1], [3, 4]]
+        x = np.array(v)
+        dx = [np.array([[2., 3.], [2., 3.]]),
+              np.array([[0., 0.], [1., 1.]])]
+        assert_array_equal(gradient(x, axis=0), dx[0])
+        assert_array_equal(gradient(x, axis=1), dx[1])
+        assert_array_equal(gradient(x, axis=-1), dx[1])
+        assert_array_equal(gradient(x, axis=(1, 0)), [dx[1], dx[0]])
+
+        # test axis=None which means all axes
+        assert_almost_equal(gradient(x, axis=None), [dx[0], dx[1]])
+        # and is the same as no axis keyword given
+        assert_almost_equal(gradient(x, axis=None), gradient(x))
+
+        # test vararg order
+        assert_array_equal(gradient(x, 2, 3, axis=(1, 0)),
+                           [dx[1]/2.0, dx[0]/3.0])
+        # test maximal number of varargs
+        assert_raises(TypeError, gradient, x, 1, 2, axis=1)
+
+        assert_raises(np.AxisError, gradient, x, axis=3)
+        assert_raises(np.AxisError, gradient, x, axis=-3)
+        # assert_raises(TypeError, gradient, x, axis=[1,])
+
+    def test_timedelta64(self):
+        # Make sure gradient() can handle special types like timedelta64
+        x = np.array(
+            [-5, -3, 10, 12, 61, 321, 300],
+            dtype='timedelta64[D]')
+        dx = np.array(
+            [2, 7, 7, 25, 154, 119, -21],
+            dtype='timedelta64[D]')
+        assert_array_equal(gradient(x), dx)
+        assert_(dx.dtype == np.dtype('timedelta64[D]'))
+
+    def test_inexact_dtypes(self):
+        for dt in [np.float16, np.float32, np.float64]:
+            # dtypes should not be promoted in a different way to what diff does
+            x = np.array([1, 2, 3], dtype=dt)
+            assert_equal(gradient(x).dtype, np.diff(x).dtype)
+
+    def test_values(self):
+        # needs at least 2 points for edge_order ==1
+        gradient(np.arange(2), edge_order=1)
+        # needs at least 3 points for edge_order ==1
+        gradient(np.arange(3), edge_order=2)
+
+        assert_raises(ValueError, gradient, np.arange(0), edge_order=1)
+        assert_raises(ValueError, gradient, np.arange(0), edge_order=2)
+        assert_raises(ValueError, gradient, np.arange(1), edge_order=1)
+        assert_raises(ValueError, gradient, np.arange(1), edge_order=2)
+        assert_raises(ValueError, gradient, np.arange(2), edge_order=2)
+
+    @pytest.mark.parametrize('f_dtype', [np.uint8, np.uint16,
+                                         np.uint32, np.uint64])
+    def test_f_decreasing_unsigned_int(self, f_dtype):
+        f = np.array([5, 4, 3, 2, 1], dtype=f_dtype)
+        g = gradient(f)
+        assert_array_equal(g, [-1]*len(f))
+
+    @pytest.mark.parametrize('f_dtype', [np.int8, np.int16,
+                                         np.int32, np.int64])
+    def test_f_signed_int_big_jump(self, f_dtype):
+        maxint = np.iinfo(f_dtype).max
+        x = np.array([1, 3])
+        f = np.array([-1, maxint], dtype=f_dtype)
+        dfdx = gradient(f, x)
+        assert_array_equal(dfdx, [(maxint + 1) // 2]*2)
+
+    @pytest.mark.parametrize('x_dtype', [np.uint8, np.uint16,
+                                         np.uint32, np.uint64])
+    def test_x_decreasing_unsigned(self, x_dtype):
+        x = np.array([3, 2, 1], dtype=x_dtype)
+        f = np.array([0, 2, 4])
+        dfdx = gradient(f, x)
+        assert_array_equal(dfdx, [-2]*len(x))
+
+    @pytest.mark.parametrize('x_dtype', [np.int8, np.int16,
+                                         np.int32, np.int64])
+    def test_x_signed_int_big_jump(self, x_dtype):
+        minint = np.iinfo(x_dtype).min
+        maxint = np.iinfo(x_dtype).max
+        x = np.array([-1, maxint], dtype=x_dtype)
+        f = np.array([minint // 2, 0])
+        dfdx = gradient(f, x)
+        assert_array_equal(dfdx, [0.5, 0.5])
+
+
+class TestAngle:
+
+    def test_basic(self):
+        x = [1 + 3j, np.sqrt(2) / 2.0 + 1j * np.sqrt(2) / 2,
+             1, 1j, -1, -1j, 1 - 3j, -1 + 3j]
+        y = angle(x)
+        yo = [
+            np.arctan(3.0 / 1.0),
+            np.arctan(1.0), 0, np.pi / 2, np.pi, -np.pi / 2.0,
+            -np.arctan(3.0 / 1.0), np.pi - np.arctan(3.0 / 1.0)]
+        z = angle(x, deg=True)
+        zo = np.array(yo) * 180 / np.pi
+        assert_array_almost_equal(y, yo, 11)
+        assert_array_almost_equal(z, zo, 11)
+
+    def test_subclass(self):
+        x = np.ma.array([1 + 3j, 1, np.sqrt(2)/2 * (1 + 1j)])
+        x[1] = np.ma.masked
+        expected = np.ma.array([np.arctan(3.0 / 1.0), 0, np.arctan(1.0)])
+        expected[1] = np.ma.masked
+        actual = angle(x)
+        assert_equal(type(actual), type(expected))
+        assert_equal(actual.mask, expected.mask)
+        assert_equal(actual, expected)
+
+
+class TestTrimZeros:
+
+    """
+    Only testing for integer splits.
+
+    """
+
+    def test_basic(self):
+        a = np.array([0, 0, 1, 2, 3, 4, 0])
+        res = trim_zeros(a)
+        assert_array_equal(res, np.array([1, 2, 3, 4]))
+
+    def test_leading_skip(self):
+        a = np.array([0, 0, 1, 0, 2, 3, 4, 0])
+        res = trim_zeros(a)
+        assert_array_equal(res, np.array([1, 0, 2, 3, 4]))
+
+    def test_trailing_skip(self):
+        a = np.array([0, 0, 1, 0, 2, 3, 0, 4, 0])
+        res = trim_zeros(a)
+        assert_array_equal(res, np.array([1, 0, 2, 3, 0, 4]))
+
+
+class TestExtins:
+
+    def test_basic(self):
+        a = np.array([1, 3, 2, 1, 2, 3, 3])
+        b = extract(a > 1, a)
+        assert_array_equal(b, [3, 2, 2, 3, 3])
+
+    def test_place(self):
+        # Make sure that non-np.ndarray objects
+        # raise an error instead of doing nothing
+        assert_raises(TypeError, place, [1, 2, 3], [True, False], [0, 1])
+
+        a = np.array([1, 4, 3, 2, 5, 8, 7])
+        place(a, [0, 1, 0, 1, 0, 1, 0], [2, 4, 6])
+        assert_array_equal(a, [1, 2, 3, 4, 5, 6, 7])
+
+        place(a, np.zeros(7), [])
+        assert_array_equal(a, np.arange(1, 8))
+
+        place(a, [1, 0, 1, 0, 1, 0, 1], [8, 9])
+        assert_array_equal(a, [8, 2, 9, 4, 8, 6, 9])
+        assert_raises_regex(ValueError, "Cannot insert from an empty array",
+                            lambda: place(a, [0, 0, 0, 0, 0, 1, 0], []))
+
+        # See Issue #6974
+        a = np.array(['12', '34'])
+        place(a, [0, 1], '9')
+        assert_array_equal(a, ['12', '9'])
+
+    def test_both(self):
+        a = rand(10)
+        mask = a > 0.5
+        ac = a.copy()
+        c = extract(mask, a)
+        place(a, mask, 0)
+        place(a, mask, c)
+        assert_array_equal(a, ac)
+
+
+# _foo1 and _foo2 are used in some tests in TestVectorize.
+
+def _foo1(x, y=1.0):
+    return y*math.floor(x)
+
+
+def _foo2(x, y=1.0, z=0.0):
+    return y*math.floor(x) + z
+
+
+class TestVectorize:
+
+    def test_simple(self):
+        def addsubtract(a, b):
+            if a > b:
+                return a - b
+            else:
+                return a + b
+
+        f = vectorize(addsubtract)
+        r = f([0, 3, 6, 9], [1, 3, 5, 7])
+        assert_array_equal(r, [1, 6, 1, 2])
+
+    def test_scalar(self):
+        def addsubtract(a, b):
+            if a > b:
+                return a - b
+            else:
+                return a + b
+
+        f = vectorize(addsubtract)
+        r = f([0, 3, 6, 9], 5)
+        assert_array_equal(r, [5, 8, 1, 4])
+
+    def test_large(self):
+        x = np.linspace(-3, 2, 10000)
+        f = vectorize(lambda x: x)
+        y = f(x)
+        assert_array_equal(y, x)
+
+    def test_ufunc(self):
+        f = vectorize(math.cos)
+        args = np.array([0, 0.5 * np.pi, np.pi, 1.5 * np.pi, 2 * np.pi])
+        r1 = f(args)
+        r2 = np.cos(args)
+        assert_array_almost_equal(r1, r2)
+
+    def test_keywords(self):
+
+        def foo(a, b=1):
+            return a + b
+
+        f = vectorize(foo)
+        args = np.array([1, 2, 3])
+        r1 = f(args)
+        r2 = np.array([2, 3, 4])
+        assert_array_equal(r1, r2)
+        r1 = f(args, 2)
+        r2 = np.array([3, 4, 5])
+        assert_array_equal(r1, r2)
+
+    def test_keywords_with_otypes_order1(self):
+        # gh-1620: The second call of f would crash with
+        # `ValueError: invalid number of arguments`.
+        f = vectorize(_foo1, otypes=[float])
+        # We're testing the caching of ufuncs by vectorize, so the order
+        # of these function calls is an important part of the test.
+        r1 = f(np.arange(3.0), 1.0)
+        r2 = f(np.arange(3.0))
+        assert_array_equal(r1, r2)
+
+    def test_keywords_with_otypes_order2(self):
+        # gh-1620: The second call of f would crash with
+        # `ValueError: non-broadcastable output operand with shape ()
+        # doesn't match the broadcast shape (3,)`.
+        f = vectorize(_foo1, otypes=[float])
+        # We're testing the caching of ufuncs by vectorize, so the order
+        # of these function calls is an important part of the test.
+        r1 = f(np.arange(3.0))
+        r2 = f(np.arange(3.0), 1.0)
+        assert_array_equal(r1, r2)
+
+    def test_keywords_with_otypes_order3(self):
+        # gh-1620: The third call of f would crash with
+        # `ValueError: invalid number of arguments`.
+        f = vectorize(_foo1, otypes=[float])
+        # We're testing the caching of ufuncs by vectorize, so the order
+        # of these function calls is an important part of the test.
+        r1 = f(np.arange(3.0))
+        r2 = f(np.arange(3.0), y=1.0)
+        r3 = f(np.arange(3.0))
+        assert_array_equal(r1, r2)
+        assert_array_equal(r1, r3)
+
+    def test_keywords_with_otypes_several_kwd_args1(self):
+        # gh-1620 Make sure different uses of keyword arguments
+        # don't break the vectorized function.
+        f = vectorize(_foo2, otypes=[float])
+        # We're testing the caching of ufuncs by vectorize, so the order
+        # of these function calls is an important part of the test.
+        r1 = f(10.4, z=100)
+        r2 = f(10.4, y=-1)
+        r3 = f(10.4)
+        assert_equal(r1, _foo2(10.4, z=100))
+        assert_equal(r2, _foo2(10.4, y=-1))
+        assert_equal(r3, _foo2(10.4))
+
+    def test_keywords_with_otypes_several_kwd_args2(self):
+        # gh-1620 Make sure different uses of keyword arguments
+        # don't break the vectorized function.
+        f = vectorize(_foo2, otypes=[float])
+        # We're testing the caching of ufuncs by vectorize, so the order
+        # of these function calls is an important part of the test.
+        r1 = f(z=100, x=10.4, y=-1)
+        r2 = f(1, 2, 3)
+        assert_equal(r1, _foo2(z=100, x=10.4, y=-1))
+        assert_equal(r2, _foo2(1, 2, 3))
+
+    def test_keywords_no_func_code(self):
+        # This needs to test a function that has keywords but
+        # no func_code attribute, since otherwise vectorize will
+        # inspect the func_code.
+        import random
+        try:
+            vectorize(random.randrange)  # Should succeed
+        except Exception:
+            raise AssertionError()
+
+    def test_keywords2_ticket_2100(self):
+        # Test kwarg support: enhancement ticket 2100
+
+        def foo(a, b=1):
+            return a + b
+
+        f = vectorize(foo)
+        args = np.array([1, 2, 3])
+        r1 = f(a=args)
+        r2 = np.array([2, 3, 4])
+        assert_array_equal(r1, r2)
+        r1 = f(b=1, a=args)
+        assert_array_equal(r1, r2)
+        r1 = f(args, b=2)
+        r2 = np.array([3, 4, 5])
+        assert_array_equal(r1, r2)
+
+    def test_keywords3_ticket_2100(self):
+        # Test excluded with mixed positional and kwargs: ticket 2100
+        def mypolyval(x, p):
+            _p = list(p)
+            res = _p.pop(0)
+            while _p:
+                res = res * x + _p.pop(0)
+            return res
+
+        vpolyval = np.vectorize(mypolyval, excluded=['p', 1])
+        ans = [3, 6]
+        assert_array_equal(ans, vpolyval(x=[0, 1], p=[1, 2, 3]))
+        assert_array_equal(ans, vpolyval([0, 1], p=[1, 2, 3]))
+        assert_array_equal(ans, vpolyval([0, 1], [1, 2, 3]))
+
+    def test_keywords4_ticket_2100(self):
+        # Test vectorizing function with no positional args.
+        @vectorize
+        def f(**kw):
+            res = 1.0
+            for _k in kw:
+                res *= kw[_k]
+            return res
+
+        assert_array_equal(f(a=[1, 2], b=[3, 4]), [3, 8])
+
+    def test_keywords5_ticket_2100(self):
+        # Test vectorizing function with no kwargs args.
+        @vectorize
+        def f(*v):
+            return np.prod(v)
+
+        assert_array_equal(f([1, 2], [3, 4]), [3, 8])
+
+    def test_coverage1_ticket_2100(self):
+        def foo():
+            return 1
+
+        f = vectorize(foo)
+        assert_array_equal(f(), 1)
+
+    def test_assigning_docstring(self):
+        def foo(x):
+            """Original documentation"""
+            return x
+
+        f = vectorize(foo)
+        assert_equal(f.__doc__, foo.__doc__)
+
+        doc = "Provided documentation"
+        f = vectorize(foo, doc=doc)
+        assert_equal(f.__doc__, doc)
+
+    def test_UnboundMethod_ticket_1156(self):
+        # Regression test for issue 1156
+        class Foo:
+            b = 2
+
+            def bar(self, a):
+                return a ** self.b
+
+        assert_array_equal(vectorize(Foo().bar)(np.arange(9)),
+                           np.arange(9) ** 2)
+        assert_array_equal(vectorize(Foo.bar)(Foo(), np.arange(9)),
+                           np.arange(9) ** 2)
+
+    def test_execution_order_ticket_1487(self):
+        # Regression test for dependence on execution order: issue 1487
+        f1 = vectorize(lambda x: x)
+        res1a = f1(np.arange(3))
+        res1b = f1(np.arange(0.1, 3))
+        f2 = vectorize(lambda x: x)
+        res2b = f2(np.arange(0.1, 3))
+        res2a = f2(np.arange(3))
+        assert_equal(res1a, res2a)
+        assert_equal(res1b, res2b)
+
+    def test_string_ticket_1892(self):
+        # Test vectorization over strings: issue 1892.
+        f = np.vectorize(lambda x: x)
+        s = '0123456789' * 10
+        assert_equal(s, f(s))
+
+    def test_cache(self):
+        # Ensure that vectorized func called exactly once per argument.
+        _calls = [0]
+
+        @vectorize
+        def f(x):
+            _calls[0] += 1
+            return x ** 2
+
+        f.cache = True
+        x = np.arange(5)
+        assert_array_equal(f(x), x * x)
+        assert_equal(_calls[0], len(x))
+
+    def test_otypes(self):
+        f = np.vectorize(lambda x: x)
+        f.otypes = 'i'
+        x = np.arange(5)
+        assert_array_equal(f(x), x)
+
+    def test_parse_gufunc_signature(self):
+        assert_equal(nfb._parse_gufunc_signature('(x)->()'), ([('x',)], [()]))
+        assert_equal(nfb._parse_gufunc_signature('(x,y)->()'),
+                     ([('x', 'y')], [()]))
+        assert_equal(nfb._parse_gufunc_signature('(x),(y)->()'),
+                     ([('x',), ('y',)], [()]))
+        assert_equal(nfb._parse_gufunc_signature('(x)->(y)'),
+                     ([('x',)], [('y',)]))
+        assert_equal(nfb._parse_gufunc_signature('(x)->(y),()'),
+                     ([('x',)], [('y',), ()]))
+        assert_equal(nfb._parse_gufunc_signature('(),(a,b,c),(d)->(d,e)'),
+                     ([(), ('a', 'b', 'c'), ('d',)], [('d', 'e')]))
+        with assert_raises(ValueError):
+            nfb._parse_gufunc_signature('(x)(y)->()')
+        with assert_raises(ValueError):
+            nfb._parse_gufunc_signature('(x),(y)->')
+        with assert_raises(ValueError):
+            nfb._parse_gufunc_signature('((x))->(x)')
+
+    def test_signature_simple(self):
+        def addsubtract(a, b):
+            if a > b:
+                return a - b
+            else:
+                return a + b
+
+        f = vectorize(addsubtract, signature='(),()->()')
+        r = f([0, 3, 6, 9], [1, 3, 5, 7])
+        assert_array_equal(r, [1, 6, 1, 2])
+
+    def test_signature_mean_last(self):
+        def mean(a):
+            return a.mean()
+
+        f = vectorize(mean, signature='(n)->()')
+        r = f([[1, 3], [2, 4]])
+        assert_array_equal(r, [2, 3])
+
+    def test_signature_center(self):
+        def center(a):
+            return a - a.mean()
+
+        f = vectorize(center, signature='(n)->(n)')
+        r = f([[1, 3], [2, 4]])
+        assert_array_equal(r, [[-1, 1], [-1, 1]])
+
+    def test_signature_two_outputs(self):
+        f = vectorize(lambda x: (x, x), signature='()->(),()')
+        r = f([1, 2, 3])
+        assert_(isinstance(r, tuple) and len(r) == 2)
+        assert_array_equal(r[0], [1, 2, 3])
+        assert_array_equal(r[1], [1, 2, 3])
+
+    def test_signature_outer(self):
+        f = vectorize(np.outer, signature='(a),(b)->(a,b)')
+        r = f([1, 2], [1, 2, 3])
+        assert_array_equal(r, [[1, 2, 3], [2, 4, 6]])
+
+        r = f([[[1, 2]]], [1, 2, 3])
+        assert_array_equal(r, [[[[1, 2, 3], [2, 4, 6]]]])
+
+        r = f([[1, 0], [2, 0]], [1, 2, 3])
+        assert_array_equal(r, [[[1, 2, 3], [0, 0, 0]],
+                               [[2, 4, 6], [0, 0, 0]]])
+
+        r = f([1, 2], [[1, 2, 3], [0, 0, 0]])
+        assert_array_equal(r, [[[1, 2, 3], [2, 4, 6]],
+                               [[0, 0, 0], [0, 0, 0]]])
+
+    def test_signature_computed_size(self):
+        f = vectorize(lambda x: x[:-1], signature='(n)->(m)')
+        r = f([1, 2, 3])
+        assert_array_equal(r, [1, 2])
+
+        r = f([[1, 2, 3], [2, 3, 4]])
+        assert_array_equal(r, [[1, 2], [2, 3]])
+
+    def test_signature_excluded(self):
+
+        def foo(a, b=1):
+            return a + b
+
+        f = vectorize(foo, signature='()->()', excluded={'b'})
+        assert_array_equal(f([1, 2, 3]), [2, 3, 4])
+        assert_array_equal(f([1, 2, 3], b=0), [1, 2, 3])
+
+    def test_signature_otypes(self):
+        f = vectorize(lambda x: x, signature='(n)->(n)', otypes=['float64'])
+        r = f([1, 2, 3])
+        assert_equal(r.dtype, np.dtype('float64'))
+        assert_array_equal(r, [1, 2, 3])
+
+    def test_signature_invalid_inputs(self):
+        f = vectorize(operator.add, signature='(n),(n)->(n)')
+        with assert_raises_regex(TypeError, 'wrong number of positional'):
+            f([1, 2])
+        with assert_raises_regex(
+                ValueError, 'does not have enough dimensions'):
+            f(1, 2)
+        with assert_raises_regex(
+                ValueError, 'inconsistent size for core dimension'):
+            f([1, 2], [1, 2, 3])
+
+        f = vectorize(operator.add, signature='()->()')
+        with assert_raises_regex(TypeError, 'wrong number of positional'):
+            f(1, 2)
+
+    def test_signature_invalid_outputs(self):
+
+        f = vectorize(lambda x: x[:-1], signature='(n)->(n)')
+        with assert_raises_regex(
+                ValueError, 'inconsistent size for core dimension'):
+            f([1, 2, 3])
+
+        f = vectorize(lambda x: x, signature='()->(),()')
+        with assert_raises_regex(ValueError, 'wrong number of outputs'):
+            f(1)
+
+        f = vectorize(lambda x: (x, x), signature='()->()')
+        with assert_raises_regex(ValueError, 'wrong number of outputs'):
+            f([1, 2])
+
+    def test_size_zero_output(self):
+        # see issue 5868
+        f = np.vectorize(lambda x: x)
+        x = np.zeros([0, 5], dtype=int)
+        with assert_raises_regex(ValueError, 'otypes'):
+            f(x)
+
+        f.otypes = 'i'
+        assert_array_equal(f(x), x)
+
+        f = np.vectorize(lambda x: x, signature='()->()')
+        with assert_raises_regex(ValueError, 'otypes'):
+            f(x)
+
+        f = np.vectorize(lambda x: x, signature='()->()', otypes='i')
+        assert_array_equal(f(x), x)
+
+        f = np.vectorize(lambda x: x, signature='(n)->(n)', otypes='i')
+        assert_array_equal(f(x), x)
+
+        f = np.vectorize(lambda x: x, signature='(n)->(n)')
+        assert_array_equal(f(x.T), x.T)
+
+        f = np.vectorize(lambda x: [x], signature='()->(n)', otypes='i')
+        with assert_raises_regex(ValueError, 'new output dimensions'):
+            f(x)
+
+
+class TestLeaks:
+    class A:
+        iters = 20
+
+        def bound(self, *args):
+            return 0
+
+        @staticmethod
+        def unbound(*args):
+            return 0
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    @pytest.mark.parametrize('name, incr', [
+            ('bound', A.iters),
+            ('unbound', 0),
+            ])
+    def test_frompyfunc_leaks(self, name, incr):
+        # exposed in gh-11867 as np.vectorized, but the problem stems from
+        # frompyfunc.
+        # class.attribute = np.frompyfunc(<method>) creates a
+        # reference cycle if <method> is a bound class method. It requires a
+        # gc collection cycle to break the cycle (on CPython 3)
+        import gc
+        A_func = getattr(self.A, name)
+        gc.disable()
+        try:
+            refcount = sys.getrefcount(A_func)
+            for i in range(self.A.iters):
+                a = self.A()
+                a.f = np.frompyfunc(getattr(a, name), 1, 1)
+                out = a.f(np.arange(10))
+            a = None
+            # A.func is part of a reference cycle if incr is non-zero
+            assert_equal(sys.getrefcount(A_func), refcount + incr)
+            for i in range(5):
+                gc.collect()
+            assert_equal(sys.getrefcount(A_func), refcount)
+        finally:
+            gc.enable()
+
+class TestDigitize:
+
+    def test_forward(self):
+        x = np.arange(-6, 5)
+        bins = np.arange(-5, 5)
+        assert_array_equal(digitize(x, bins), np.arange(11))
+
+    def test_reverse(self):
+        x = np.arange(5, -6, -1)
+        bins = np.arange(5, -5, -1)
+        assert_array_equal(digitize(x, bins), np.arange(11))
+
+    def test_random(self):
+        x = rand(10)
+        bin = np.linspace(x.min(), x.max(), 10)
+        assert_(np.all(digitize(x, bin) != 0))
+
+    def test_right_basic(self):
+        x = [1, 5, 4, 10, 8, 11, 0]
+        bins = [1, 5, 10]
+        default_answer = [1, 2, 1, 3, 2, 3, 0]
+        assert_array_equal(digitize(x, bins), default_answer)
+        right_answer = [0, 1, 1, 2, 2, 3, 0]
+        assert_array_equal(digitize(x, bins, True), right_answer)
+
+    def test_right_open(self):
+        x = np.arange(-6, 5)
+        bins = np.arange(-6, 4)
+        assert_array_equal(digitize(x, bins, True), np.arange(11))
+
+    def test_right_open_reverse(self):
+        x = np.arange(5, -6, -1)
+        bins = np.arange(4, -6, -1)
+        assert_array_equal(digitize(x, bins, True), np.arange(11))
+
+    def test_right_open_random(self):
+        x = rand(10)
+        bins = np.linspace(x.min(), x.max(), 10)
+        assert_(np.all(digitize(x, bins, True) != 10))
+
+    def test_monotonic(self):
+        x = [-1, 0, 1, 2]
+        bins = [0, 0, 1]
+        assert_array_equal(digitize(x, bins, False), [0, 2, 3, 3])
+        assert_array_equal(digitize(x, bins, True), [0, 0, 2, 3])
+        bins = [1, 1, 0]
+        assert_array_equal(digitize(x, bins, False), [3, 2, 0, 0])
+        assert_array_equal(digitize(x, bins, True), [3, 3, 2, 0])
+        bins = [1, 1, 1, 1]
+        assert_array_equal(digitize(x, bins, False), [0, 0, 4, 4])
+        assert_array_equal(digitize(x, bins, True), [0, 0, 0, 4])
+        bins = [0, 0, 1, 0]
+        assert_raises(ValueError, digitize, x, bins)
+        bins = [1, 1, 0, 1]
+        assert_raises(ValueError, digitize, x, bins)
+
+    def test_casting_error(self):
+        x = [1, 2, 3 + 1.j]
+        bins = [1, 2, 3]
+        assert_raises(TypeError, digitize, x, bins)
+        x, bins = bins, x
+        assert_raises(TypeError, digitize, x, bins)
+
+    def test_return_type(self):
+        # Functions returning indices should always return base ndarrays
+        class A(np.ndarray):
+            pass
+        a = np.arange(5).view(A)
+        b = np.arange(1, 3).view(A)
+        assert_(not isinstance(digitize(b, a, False), A))
+        assert_(not isinstance(digitize(b, a, True), A))
+
+    def test_large_integers_increasing(self):
+        # gh-11022
+        x = 2**54  # loses precision in a float
+        assert_equal(np.digitize(x, [x - 1, x + 1]), 1)
+
+    @pytest.mark.xfail(
+        reason="gh-11022: np.core.multiarray._monoticity loses precision")
+    def test_large_integers_decreasing(self):
+        # gh-11022
+        x = 2**54  # loses precision in a float
+        assert_equal(np.digitize(x, [x + 1, x - 1]), 1)
+
+
+class TestUnwrap:
+
+    def test_simple(self):
+        # check that unwrap removes jumps greater that 2*pi
+        assert_array_equal(unwrap([1, 1 + 2 * np.pi]), [1, 1])
+        # check that unwrap maintains continuity
+        assert_(np.all(diff(unwrap(rand(10) * 100)) < np.pi))
+
+
+class TestFilterwindows:
+
+    def test_hanning(self):
+        # check symmetry
+        w = hanning(10)
+        assert_array_almost_equal(w, flipud(w), 7)
+        # check known value
+        assert_almost_equal(np.sum(w, axis=0), 4.500, 4)
+
+    def test_hamming(self):
+        # check symmetry
+        w = hamming(10)
+        assert_array_almost_equal(w, flipud(w), 7)
+        # check known value
+        assert_almost_equal(np.sum(w, axis=0), 4.9400, 4)
+
+    def test_bartlett(self):
+        # check symmetry
+        w = bartlett(10)
+        assert_array_almost_equal(w, flipud(w), 7)
+        # check known value
+        assert_almost_equal(np.sum(w, axis=0), 4.4444, 4)
+
+    def test_blackman(self):
+        # check symmetry
+        w = blackman(10)
+        assert_array_almost_equal(w, flipud(w), 7)
+        # check known value
+        assert_almost_equal(np.sum(w, axis=0), 3.7800, 4)
+
+
+class TestTrapz:
+
+    def test_simple(self):
+        x = np.arange(-10, 10, .1)
+        r = trapz(np.exp(-.5 * x ** 2) / np.sqrt(2 * np.pi), dx=0.1)
+        # check integral of normal equals 1
+        assert_almost_equal(r, 1, 7)
+
+    def test_ndim(self):
+        x = np.linspace(0, 1, 3)
+        y = np.linspace(0, 2, 8)
+        z = np.linspace(0, 3, 13)
+
+        wx = np.ones_like(x) * (x[1] - x[0])
+        wx[0] /= 2
+        wx[-1] /= 2
+        wy = np.ones_like(y) * (y[1] - y[0])
+        wy[0] /= 2
+        wy[-1] /= 2
+        wz = np.ones_like(z) * (z[1] - z[0])
+        wz[0] /= 2
+        wz[-1] /= 2
+
+        q = x[:, None, None] + y[None,:, None] + z[None, None,:]
+
+        qx = (q * wx[:, None, None]).sum(axis=0)
+        qy = (q * wy[None, :, None]).sum(axis=1)
+        qz = (q * wz[None, None, :]).sum(axis=2)
+
+        # n-d `x`
+        r = trapz(q, x=x[:, None, None], axis=0)
+        assert_almost_equal(r, qx)
+        r = trapz(q, x=y[None,:, None], axis=1)
+        assert_almost_equal(r, qy)
+        r = trapz(q, x=z[None, None,:], axis=2)
+        assert_almost_equal(r, qz)
+
+        # 1-d `x`
+        r = trapz(q, x=x, axis=0)
+        assert_almost_equal(r, qx)
+        r = trapz(q, x=y, axis=1)
+        assert_almost_equal(r, qy)
+        r = trapz(q, x=z, axis=2)
+        assert_almost_equal(r, qz)
+
+    def test_masked(self):
+        # Testing that masked arrays behave as if the function is 0 where
+        # masked
+        x = np.arange(5)
+        y = x * x
+        mask = x == 2
+        ym = np.ma.array(y, mask=mask)
+        r = 13.0  # sum(0.5 * (0 + 1) * 1.0 + 0.5 * (9 + 16))
+        assert_almost_equal(trapz(ym, x), r)
+
+        xm = np.ma.array(x, mask=mask)
+        assert_almost_equal(trapz(ym, xm), r)
+
+        xm = np.ma.array(x, mask=mask)
+        assert_almost_equal(trapz(y, xm), r)
+
+
+class TestSinc:
+
+    def test_simple(self):
+        assert_(sinc(0) == 1)
+        w = sinc(np.linspace(-1, 1, 100))
+        # check symmetry
+        assert_array_almost_equal(w, flipud(w), 7)
+
+    def test_array_like(self):
+        x = [0, 0.5]
+        y1 = sinc(np.array(x))
+        y2 = sinc(list(x))
+        y3 = sinc(tuple(x))
+        assert_array_equal(y1, y2)
+        assert_array_equal(y1, y3)
+
+
+class TestUnique:
+
+    def test_simple(self):
+        x = np.array([4, 3, 2, 1, 1, 2, 3, 4, 0])
+        assert_(np.all(unique(x) == [0, 1, 2, 3, 4]))
+        assert_(unique(np.array([1, 1, 1, 1, 1])) == np.array([1]))
+        x = ['widget', 'ham', 'foo', 'bar', 'foo', 'ham']
+        assert_(np.all(unique(x) == ['bar', 'foo', 'ham', 'widget']))
+        x = np.array([5 + 6j, 1 + 1j, 1 + 10j, 10, 5 + 6j])
+        assert_(np.all(unique(x) == [1 + 1j, 1 + 10j, 5 + 6j, 10]))
+
+
+class TestCheckFinite:
+
+    def test_simple(self):
+        a = [1, 2, 3]
+        b = [1, 2, np.inf]
+        c = [1, 2, np.nan]
+        np.lib.asarray_chkfinite(a)
+        assert_raises(ValueError, np.lib.asarray_chkfinite, b)
+        assert_raises(ValueError, np.lib.asarray_chkfinite, c)
+
+    def test_dtype_order(self):
+        # Regression test for missing dtype and order arguments
+        a = [1, 2, 3]
+        a = np.lib.asarray_chkfinite(a, order='F', dtype=np.float64)
+        assert_(a.dtype == np.float64)
+
+
+class TestCorrCoef:
+    A = np.array(
+        [[0.15391142, 0.18045767, 0.14197213],
+         [0.70461506, 0.96474128, 0.27906989],
+         [0.9297531, 0.32296769, 0.19267156]])
+    B = np.array(
+        [[0.10377691, 0.5417086, 0.49807457],
+         [0.82872117, 0.77801674, 0.39226705],
+         [0.9314666, 0.66800209, 0.03538394]])
+    res1 = np.array(
+        [[1., 0.9379533, -0.04931983],
+         [0.9379533, 1., 0.30007991],
+         [-0.04931983, 0.30007991, 1.]])
+    res2 = np.array(
+        [[1., 0.9379533, -0.04931983, 0.30151751, 0.66318558, 0.51532523],
+         [0.9379533, 1., 0.30007991, -0.04781421, 0.88157256, 0.78052386],
+         [-0.04931983, 0.30007991, 1., -0.96717111, 0.71483595, 0.83053601],
+         [0.30151751, -0.04781421, -0.96717111, 1., -0.51366032, -0.66173113],
+         [0.66318558, 0.88157256, 0.71483595, -0.51366032, 1., 0.98317823],
+         [0.51532523, 0.78052386, 0.83053601, -0.66173113, 0.98317823, 1.]])
+
+    def test_non_array(self):
+        assert_almost_equal(np.corrcoef([0, 1, 0], [1, 0, 1]),
+                            [[1., -1.], [-1.,  1.]])
+
+    def test_simple(self):
+        tgt1 = corrcoef(self.A)
+        assert_almost_equal(tgt1, self.res1)
+        assert_(np.all(np.abs(tgt1) <= 1.0))
+
+        tgt2 = corrcoef(self.A, self.B)
+        assert_almost_equal(tgt2, self.res2)
+        assert_(np.all(np.abs(tgt2) <= 1.0))
+
+    def test_ddof(self):
+        # ddof raises DeprecationWarning
+        with suppress_warnings() as sup:
+            warnings.simplefilter("always")
+            assert_warns(DeprecationWarning, corrcoef, self.A, ddof=-1)
+            sup.filter(DeprecationWarning)
+            # ddof has no or negligible effect on the function
+            assert_almost_equal(corrcoef(self.A, ddof=-1), self.res1)
+            assert_almost_equal(corrcoef(self.A, self.B, ddof=-1), self.res2)
+            assert_almost_equal(corrcoef(self.A, ddof=3), self.res1)
+            assert_almost_equal(corrcoef(self.A, self.B, ddof=3), self.res2)
+
+    def test_bias(self):
+        # bias raises DeprecationWarning
+        with suppress_warnings() as sup:
+            warnings.simplefilter("always")
+            assert_warns(DeprecationWarning, corrcoef, self.A, self.B, 1, 0)
+            assert_warns(DeprecationWarning, corrcoef, self.A, bias=0)
+            sup.filter(DeprecationWarning)
+            # bias has no or negligible effect on the function
+            assert_almost_equal(corrcoef(self.A, bias=1), self.res1)
+
+    def test_complex(self):
+        x = np.array([[1, 2, 3], [1j, 2j, 3j]])
+        res = corrcoef(x)
+        tgt = np.array([[1., -1.j], [1.j, 1.]])
+        assert_allclose(res, tgt)
+        assert_(np.all(np.abs(res) <= 1.0))
+
+    def test_xy(self):
+        x = np.array([[1, 2, 3]])
+        y = np.array([[1j, 2j, 3j]])
+        assert_allclose(np.corrcoef(x, y), np.array([[1., -1.j], [1.j, 1.]]))
+
+    def test_empty(self):
+        with warnings.catch_warnings(record=True):
+            warnings.simplefilter('always', RuntimeWarning)
+            assert_array_equal(corrcoef(np.array([])), np.nan)
+            assert_array_equal(corrcoef(np.array([]).reshape(0, 2)),
+                               np.array([]).reshape(0, 0))
+            assert_array_equal(corrcoef(np.array([]).reshape(2, 0)),
+                               np.array([[np.nan, np.nan], [np.nan, np.nan]]))
+
+    def test_extreme(self):
+        x = [[1e-100, 1e100], [1e100, 1e-100]]
+        with np.errstate(all='raise'):
+            c = corrcoef(x)
+        assert_array_almost_equal(c, np.array([[1., -1.], [-1., 1.]]))
+        assert_(np.all(np.abs(c) <= 1.0))
+
+
+class TestCov:
+    x1 = np.array([[0, 2], [1, 1], [2, 0]]).T
+    res1 = np.array([[1., -1.], [-1., 1.]])
+    x2 = np.array([0.0, 1.0, 2.0], ndmin=2)
+    frequencies = np.array([1, 4, 1])
+    x2_repeats = np.array([[0.0], [1.0], [1.0], [1.0], [1.0], [2.0]]).T
+    res2 = np.array([[0.4, -0.4], [-0.4, 0.4]])
+    unit_frequencies = np.ones(3, dtype=np.int_)
+    weights = np.array([1.0, 4.0, 1.0])
+    res3 = np.array([[2. / 3., -2. / 3.], [-2. / 3., 2. / 3.]])
+    unit_weights = np.ones(3)
+    x3 = np.array([0.3942, 0.5969, 0.7730, 0.9918, 0.7964])
+
+    def test_basic(self):
+        assert_allclose(cov(self.x1), self.res1)
+
+    def test_complex(self):
+        x = np.array([[1, 2, 3], [1j, 2j, 3j]])
+        res = np.array([[1., -1.j], [1.j, 1.]])
+        assert_allclose(cov(x), res)
+        assert_allclose(cov(x, aweights=np.ones(3)), res)
+
+    def test_xy(self):
+        x = np.array([[1, 2, 3]])
+        y = np.array([[1j, 2j, 3j]])
+        assert_allclose(cov(x, y), np.array([[1., -1.j], [1.j, 1.]]))
+
+    def test_empty(self):
+        with warnings.catch_warnings(record=True):
+            warnings.simplefilter('always', RuntimeWarning)
+            assert_array_equal(cov(np.array([])), np.nan)
+            assert_array_equal(cov(np.array([]).reshape(0, 2)),
+                               np.array([]).reshape(0, 0))
+            assert_array_equal(cov(np.array([]).reshape(2, 0)),
+                               np.array([[np.nan, np.nan], [np.nan, np.nan]]))
+
+    def test_wrong_ddof(self):
+        with warnings.catch_warnings(record=True):
+            warnings.simplefilter('always', RuntimeWarning)
+            assert_array_equal(cov(self.x1, ddof=5),
+                               np.array([[np.inf, -np.inf],
+                                         [-np.inf, np.inf]]))
+
+    def test_1D_rowvar(self):
+        assert_allclose(cov(self.x3), cov(self.x3, rowvar=False))
+        y = np.array([0.0780, 0.3107, 0.2111, 0.0334, 0.8501])
+        assert_allclose(cov(self.x3, y), cov(self.x3, y, rowvar=False))
+
+    def test_1D_variance(self):
+        assert_allclose(cov(self.x3, ddof=1), np.var(self.x3, ddof=1))
+
+    def test_fweights(self):
+        assert_allclose(cov(self.x2, fweights=self.frequencies),
+                        cov(self.x2_repeats))
+        assert_allclose(cov(self.x1, fweights=self.frequencies),
+                        self.res2)
+        assert_allclose(cov(self.x1, fweights=self.unit_frequencies),
+                        self.res1)
+        nonint = self.frequencies + 0.5
+        assert_raises(TypeError, cov, self.x1, fweights=nonint)
+        f = np.ones((2, 3), dtype=np.int_)
+        assert_raises(RuntimeError, cov, self.x1, fweights=f)
+        f = np.ones(2, dtype=np.int_)
+        assert_raises(RuntimeError, cov, self.x1, fweights=f)
+        f = -1 * np.ones(3, dtype=np.int_)
+        assert_raises(ValueError, cov, self.x1, fweights=f)
+
+    def test_aweights(self):
+        assert_allclose(cov(self.x1, aweights=self.weights), self.res3)
+        assert_allclose(cov(self.x1, aweights=3.0 * self.weights),
+                        cov(self.x1, aweights=self.weights))
+        assert_allclose(cov(self.x1, aweights=self.unit_weights), self.res1)
+        w = np.ones((2, 3))
+        assert_raises(RuntimeError, cov, self.x1, aweights=w)
+        w = np.ones(2)
+        assert_raises(RuntimeError, cov, self.x1, aweights=w)
+        w = -1.0 * np.ones(3)
+        assert_raises(ValueError, cov, self.x1, aweights=w)
+
+    def test_unit_fweights_and_aweights(self):
+        assert_allclose(cov(self.x2, fweights=self.frequencies,
+                            aweights=self.unit_weights),
+                        cov(self.x2_repeats))
+        assert_allclose(cov(self.x1, fweights=self.frequencies,
+                            aweights=self.unit_weights),
+                        self.res2)
+        assert_allclose(cov(self.x1, fweights=self.unit_frequencies,
+                            aweights=self.unit_weights),
+                        self.res1)
+        assert_allclose(cov(self.x1, fweights=self.unit_frequencies,
+                            aweights=self.weights),
+                        self.res3)
+        assert_allclose(cov(self.x1, fweights=self.unit_frequencies,
+                            aweights=3.0 * self.weights),
+                        cov(self.x1, aweights=self.weights))
+        assert_allclose(cov(self.x1, fweights=self.unit_frequencies,
+                            aweights=self.unit_weights),
+                        self.res1)
+
+
+class Test_I0:
+
+    def test_simple(self):
+        assert_almost_equal(
+            i0(0.5),
+            np.array(1.0634833707413234))
+
+        A = np.array([0.49842636, 0.6969809, 0.22011976, 0.0155549])
+        expected = np.array([1.06307822, 1.12518299, 1.01214991, 1.00006049])
+        assert_almost_equal(i0(A), expected)
+        assert_almost_equal(i0(-A), expected)
+
+        B = np.array([[0.827002, 0.99959078],
+                      [0.89694769, 0.39298162],
+                      [0.37954418, 0.05206293],
+                      [0.36465447, 0.72446427],
+                      [0.48164949, 0.50324519]])
+        assert_almost_equal(
+            i0(B),
+            np.array([[1.17843223, 1.26583466],
+                      [1.21147086, 1.03898290],
+                      [1.03633899, 1.00067775],
+                      [1.03352052, 1.13557954],
+                      [1.05884290, 1.06432317]]))
+        # Regression test for gh-11205
+        i0_0 = np.i0([0.])
+        assert_equal(i0_0.shape, (1,))
+        assert_array_equal(np.i0([0.]), np.array([1.]))
+
+    def test_non_array(self):
+        a = np.arange(4)
+
+        class array_like:
+            __array_interface__ = a.__array_interface__
+
+            def __array_wrap__(self, arr):
+                return self
+
+        # E.g. pandas series survive ufunc calls through array-wrap:
+        assert isinstance(np.abs(array_like()), array_like)
+        exp = np.i0(a)
+        res = np.i0(array_like())
+
+        assert_array_equal(exp, res)
+
+
+class TestKaiser:
+
+    def test_simple(self):
+        assert_(np.isfinite(kaiser(1, 1.0)))
+        assert_almost_equal(kaiser(0, 1.0),
+                            np.array([]))
+        assert_almost_equal(kaiser(2, 1.0),
+                            np.array([0.78984831, 0.78984831]))
+        assert_almost_equal(kaiser(5, 1.0),
+                            np.array([0.78984831, 0.94503323, 1.,
+                                      0.94503323, 0.78984831]))
+        assert_almost_equal(kaiser(5, 1.56789),
+                            np.array([0.58285404, 0.88409679, 1.,
+                                      0.88409679, 0.58285404]))
+
+    def test_int_beta(self):
+        kaiser(3, 4)
+
+
+class TestMsort:
+
+    def test_simple(self):
+        A = np.array([[0.44567325, 0.79115165, 0.54900530],
+                      [0.36844147, 0.37325583, 0.96098397],
+                      [0.64864341, 0.52929049, 0.39172155]])
+        assert_almost_equal(
+            msort(A),
+            np.array([[0.36844147, 0.37325583, 0.39172155],
+                      [0.44567325, 0.52929049, 0.54900530],
+                      [0.64864341, 0.79115165, 0.96098397]]))
+
+
+class TestMeshgrid:
+
+    def test_simple(self):
+        [X, Y] = meshgrid([1, 2, 3], [4, 5, 6, 7])
+        assert_array_equal(X, np.array([[1, 2, 3],
+                                        [1, 2, 3],
+                                        [1, 2, 3],
+                                        [1, 2, 3]]))
+        assert_array_equal(Y, np.array([[4, 4, 4],
+                                        [5, 5, 5],
+                                        [6, 6, 6],
+                                        [7, 7, 7]]))
+
+    def test_single_input(self):
+        [X] = meshgrid([1, 2, 3, 4])
+        assert_array_equal(X, np.array([1, 2, 3, 4]))
+
+    def test_no_input(self):
+        args = []
+        assert_array_equal([], meshgrid(*args))
+        assert_array_equal([], meshgrid(*args, copy=False))
+
+    def test_indexing(self):
+        x = [1, 2, 3]
+        y = [4, 5, 6, 7]
+        [X, Y] = meshgrid(x, y, indexing='ij')
+        assert_array_equal(X, np.array([[1, 1, 1, 1],
+                                        [2, 2, 2, 2],
+                                        [3, 3, 3, 3]]))
+        assert_array_equal(Y, np.array([[4, 5, 6, 7],
+                                        [4, 5, 6, 7],
+                                        [4, 5, 6, 7]]))
+
+        # Test expected shapes:
+        z = [8, 9]
+        assert_(meshgrid(x, y)[0].shape == (4, 3))
+        assert_(meshgrid(x, y, indexing='ij')[0].shape == (3, 4))
+        assert_(meshgrid(x, y, z)[0].shape == (4, 3, 2))
+        assert_(meshgrid(x, y, z, indexing='ij')[0].shape == (3, 4, 2))
+
+        assert_raises(ValueError, meshgrid, x, y, indexing='notvalid')
+
+    def test_sparse(self):
+        [X, Y] = meshgrid([1, 2, 3], [4, 5, 6, 7], sparse=True)
+        assert_array_equal(X, np.array([[1, 2, 3]]))
+        assert_array_equal(Y, np.array([[4], [5], [6], [7]]))
+
+    def test_invalid_arguments(self):
+        # Test that meshgrid complains about invalid arguments
+        # Regression test for issue #4755:
+        # https://github.com/numpy/numpy/issues/4755
+        assert_raises(TypeError, meshgrid,
+                      [1, 2, 3], [4, 5, 6, 7], indices='ij')
+
+    def test_return_type(self):
+        # Test for appropriate dtype in returned arrays.
+        # Regression test for issue #5297
+        # https://github.com/numpy/numpy/issues/5297
+        x = np.arange(0, 10, dtype=np.float32)
+        y = np.arange(10, 20, dtype=np.float64)
+
+        X, Y = np.meshgrid(x,y)
+
+        assert_(X.dtype == x.dtype)
+        assert_(Y.dtype == y.dtype)
+
+        # copy
+        X, Y = np.meshgrid(x,y, copy=True)
+
+        assert_(X.dtype == x.dtype)
+        assert_(Y.dtype == y.dtype)
+
+        # sparse
+        X, Y = np.meshgrid(x,y, sparse=True)
+
+        assert_(X.dtype == x.dtype)
+        assert_(Y.dtype == y.dtype)
+
+    def test_writeback(self):
+        # Issue 8561
+        X = np.array([1.1, 2.2])
+        Y = np.array([3.3, 4.4])
+        x, y = np.meshgrid(X, Y, sparse=False, copy=True)
+
+        x[0, :] = 0
+        assert_equal(x[0, :], 0)
+        assert_equal(x[1, :], X)
+
+
+class TestPiecewise:
+
+    def test_simple(self):
+        # Condition is single bool list
+        x = piecewise([0, 0], [True, False], [1])
+        assert_array_equal(x, [1, 0])
+
+        # List of conditions: single bool list
+        x = piecewise([0, 0], [[True, False]], [1])
+        assert_array_equal(x, [1, 0])
+
+        # Conditions is single bool array
+        x = piecewise([0, 0], np.array([True, False]), [1])
+        assert_array_equal(x, [1, 0])
+
+        # Condition is single int array
+        x = piecewise([0, 0], np.array([1, 0]), [1])
+        assert_array_equal(x, [1, 0])
+
+        # List of conditions: int array
+        x = piecewise([0, 0], [np.array([1, 0])], [1])
+        assert_array_equal(x, [1, 0])
+
+        x = piecewise([0, 0], [[False, True]], [lambda x:-1])
+        assert_array_equal(x, [0, -1])
+
+        assert_raises_regex(ValueError, '1 or 2 functions are expected',
+            piecewise, [0, 0], [[False, True]], [])
+        assert_raises_regex(ValueError, '1 or 2 functions are expected',
+            piecewise, [0, 0], [[False, True]], [1, 2, 3])
+
+    def test_two_conditions(self):
+        x = piecewise([1, 2], [[True, False], [False, True]], [3, 4])
+        assert_array_equal(x, [3, 4])
+
+    def test_scalar_domains_three_conditions(self):
+        x = piecewise(3, [True, False, False], [4, 2, 0])
+        assert_equal(x, 4)
+
+    def test_default(self):
+        # No value specified for x[1], should be 0
+        x = piecewise([1, 2], [True, False], [2])
+        assert_array_equal(x, [2, 0])
+
+        # Should set x[1] to 3
+        x = piecewise([1, 2], [True, False], [2, 3])
+        assert_array_equal(x, [2, 3])
+
+    def test_0d(self):
+        x = np.array(3)
+        y = piecewise(x, x > 3, [4, 0])
+        assert_(y.ndim == 0)
+        assert_(y == 0)
+
+        x = 5
+        y = piecewise(x, [True, False], [1, 0])
+        assert_(y.ndim == 0)
+        assert_(y == 1)
+
+        # With 3 ranges (It was failing, before)
+        y = piecewise(x, [False, False, True], [1, 2, 3])
+        assert_array_equal(y, 3)
+
+    def test_0d_comparison(self):
+        x = 3
+        y = piecewise(x, [x <= 3, x > 3], [4, 0])  # Should succeed.
+        assert_equal(y, 4)
+
+        # With 3 ranges (It was failing, before)
+        x = 4
+        y = piecewise(x, [x <= 3, (x > 3) * (x <= 5), x > 5], [1, 2, 3])
+        assert_array_equal(y, 2)
+
+        assert_raises_regex(ValueError, '2 or 3 functions are expected',
+            piecewise, x, [x <= 3, x > 3], [1])
+        assert_raises_regex(ValueError, '2 or 3 functions are expected',
+            piecewise, x, [x <= 3, x > 3], [1, 1, 1, 1])
+
+    def test_0d_0d_condition(self):
+        x = np.array(3)
+        c = np.array(x > 3)
+        y = piecewise(x, [c], [1, 2])
+        assert_equal(y, 2)
+
+    def test_multidimensional_extrafunc(self):
+        x = np.array([[-2.5, -1.5, -0.5],
+                      [0.5, 1.5, 2.5]])
+        y = piecewise(x, [x < 0, x >= 2], [-1, 1, 3])
+        assert_array_equal(y, np.array([[-1., -1., -1.],
+                                        [3., 3., 1.]]))
+
+
+class TestBincount:
+
+    def test_simple(self):
+        y = np.bincount(np.arange(4))
+        assert_array_equal(y, np.ones(4))
+
+    def test_simple2(self):
+        y = np.bincount(np.array([1, 5, 2, 4, 1]))
+        assert_array_equal(y, np.array([0, 2, 1, 0, 1, 1]))
+
+    def test_simple_weight(self):
+        x = np.arange(4)
+        w = np.array([0.2, 0.3, 0.5, 0.1])
+        y = np.bincount(x, w)
+        assert_array_equal(y, w)
+
+    def test_simple_weight2(self):
+        x = np.array([1, 2, 4, 5, 2])
+        w = np.array([0.2, 0.3, 0.5, 0.1, 0.2])
+        y = np.bincount(x, w)
+        assert_array_equal(y, np.array([0, 0.2, 0.5, 0, 0.5, 0.1]))
+
+    def test_with_minlength(self):
+        x = np.array([0, 1, 0, 1, 1])
+        y = np.bincount(x, minlength=3)
+        assert_array_equal(y, np.array([2, 3, 0]))
+        x = []
+        y = np.bincount(x, minlength=0)
+        assert_array_equal(y, np.array([]))
+
+    def test_with_minlength_smaller_than_maxvalue(self):
+        x = np.array([0, 1, 1, 2, 2, 3, 3])
+        y = np.bincount(x, minlength=2)
+        assert_array_equal(y, np.array([1, 2, 2, 2]))
+        y = np.bincount(x, minlength=0)
+        assert_array_equal(y, np.array([1, 2, 2, 2]))
+
+    def test_with_minlength_and_weights(self):
+        x = np.array([1, 2, 4, 5, 2])
+        w = np.array([0.2, 0.3, 0.5, 0.1, 0.2])
+        y = np.bincount(x, w, 8)
+        assert_array_equal(y, np.array([0, 0.2, 0.5, 0, 0.5, 0.1, 0, 0]))
+
+    def test_empty(self):
+        x = np.array([], dtype=int)
+        y = np.bincount(x)
+        assert_array_equal(x, y)
+
+    def test_empty_with_minlength(self):
+        x = np.array([], dtype=int)
+        y = np.bincount(x, minlength=5)
+        assert_array_equal(y, np.zeros(5, dtype=int))
+
+    def test_with_incorrect_minlength(self):
+        x = np.array([], dtype=int)
+        assert_raises_regex(TypeError,
+                            "'str' object cannot be interpreted",
+                            lambda: np.bincount(x, minlength="foobar"))
+        assert_raises_regex(ValueError,
+                            "must not be negative",
+                            lambda: np.bincount(x, minlength=-1))
+
+        x = np.arange(5)
+        assert_raises_regex(TypeError,
+                            "'str' object cannot be interpreted",
+                            lambda: np.bincount(x, minlength="foobar"))
+        assert_raises_regex(ValueError,
+                            "must not be negative",
+                            lambda: np.bincount(x, minlength=-1))
+
+    @pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+    def test_dtype_reference_leaks(self):
+        # gh-6805
+        intp_refcount = sys.getrefcount(np.dtype(np.intp))
+        double_refcount = sys.getrefcount(np.dtype(np.double))
+
+        for j in range(10):
+            np.bincount([1, 2, 3])
+        assert_equal(sys.getrefcount(np.dtype(np.intp)), intp_refcount)
+        assert_equal(sys.getrefcount(np.dtype(np.double)), double_refcount)
+
+        for j in range(10):
+            np.bincount([1, 2, 3], [4, 5, 6])
+        assert_equal(sys.getrefcount(np.dtype(np.intp)), intp_refcount)
+        assert_equal(sys.getrefcount(np.dtype(np.double)), double_refcount)
+
+    @pytest.mark.parametrize("vals", [[[2, 2]], 2])
+    def test_error_not_1d(self, vals):
+        # Test that values has to be 1-D (both as array and nested list)
+        vals_arr = np.asarray(vals)
+        with assert_raises(ValueError):
+            np.bincount(vals_arr)
+        with assert_raises(ValueError):
+            np.bincount(vals)
+
+
+class TestInterp:
+
+    def test_exceptions(self):
+        assert_raises(ValueError, interp, 0, [], [])
+        assert_raises(ValueError, interp, 0, [0], [1, 2])
+        assert_raises(ValueError, interp, 0, [0, 1], [1, 2], period=0)
+        assert_raises(ValueError, interp, 0, [], [], period=360)
+        assert_raises(ValueError, interp, 0, [0], [1, 2], period=360)
+
+    def test_basic(self):
+        x = np.linspace(0, 1, 5)
+        y = np.linspace(0, 1, 5)
+        x0 = np.linspace(0, 1, 50)
+        assert_almost_equal(np.interp(x0, x, y), x0)
+
+    def test_right_left_behavior(self):
+        # Needs range of sizes to test different code paths.
+        # size ==1 is special cased, 1 < size < 5 is linear search, and
+        # size >= 5 goes through local search and possibly binary search.
+        for size in range(1, 10):
+            xp = np.arange(size, dtype=np.double)
+            yp = np.ones(size, dtype=np.double)
+            incpts = np.array([-1, 0, size - 1, size], dtype=np.double)
+            decpts = incpts[::-1]
+
+            incres = interp(incpts, xp, yp)
+            decres = interp(decpts, xp, yp)
+            inctgt = np.array([1, 1, 1, 1], dtype=float)
+            dectgt = inctgt[::-1]
+            assert_equal(incres, inctgt)
+            assert_equal(decres, dectgt)
+
+            incres = interp(incpts, xp, yp, left=0)
+            decres = interp(decpts, xp, yp, left=0)
+            inctgt = np.array([0, 1, 1, 1], dtype=float)
+            dectgt = inctgt[::-1]
+            assert_equal(incres, inctgt)
+            assert_equal(decres, dectgt)
+
+            incres = interp(incpts, xp, yp, right=2)
+            decres = interp(decpts, xp, yp, right=2)
+            inctgt = np.array([1, 1, 1, 2], dtype=float)
+            dectgt = inctgt[::-1]
+            assert_equal(incres, inctgt)
+            assert_equal(decres, dectgt)
+
+            incres = interp(incpts, xp, yp, left=0, right=2)
+            decres = interp(decpts, xp, yp, left=0, right=2)
+            inctgt = np.array([0, 1, 1, 2], dtype=float)
+            dectgt = inctgt[::-1]
+            assert_equal(incres, inctgt)
+            assert_equal(decres, dectgt)
+
+    def test_scalar_interpolation_point(self):
+        x = np.linspace(0, 1, 5)
+        y = np.linspace(0, 1, 5)
+        x0 = 0
+        assert_almost_equal(np.interp(x0, x, y), x0)
+        x0 = .3
+        assert_almost_equal(np.interp(x0, x, y), x0)
+        x0 = np.float32(.3)
+        assert_almost_equal(np.interp(x0, x, y), x0)
+        x0 = np.float64(.3)
+        assert_almost_equal(np.interp(x0, x, y), x0)
+        x0 = np.nan
+        assert_almost_equal(np.interp(x0, x, y), x0)
+
+    def test_non_finite_behavior_exact_x(self):
+        x = [1, 2, 2.5, 3, 4]
+        xp = [1, 2, 3, 4]
+        fp = [1, 2, np.inf, 4]
+        assert_almost_equal(np.interp(x, xp, fp), [1, 2, np.inf, np.inf, 4])
+        fp = [1, 2, np.nan, 4]
+        assert_almost_equal(np.interp(x, xp, fp), [1, 2, np.nan, np.nan, 4])
+
+    @pytest.fixture(params=[
+        lambda x: np.float_(x),
+        lambda x: _make_complex(x, 0),
+        lambda x: _make_complex(0, x),
+        lambda x: _make_complex(x, np.multiply(x, -2))
+    ], ids=[
+        'real',
+        'complex-real',
+        'complex-imag',
+        'complex-both'
+    ])
+    def sc(self, request):
+        """ scale function used by the below tests """
+        return request.param
+
+    def test_non_finite_any_nan(self, sc):
+        """ test that nans are propagated """
+        assert_equal(np.interp(0.5, [np.nan,      1], sc([     0,     10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [     0, np.nan], sc([     0,     10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [     0,      1], sc([np.nan,     10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [     0,      1], sc([     0, np.nan])), sc(np.nan))
+
+    def test_non_finite_inf(self, sc):
+        """ Test that interp between opposite infs gives nan """
+        assert_equal(np.interp(0.5, [-np.inf, +np.inf], sc([      0,      10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0,       1], sc([-np.inf, +np.inf])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0,       1], sc([+np.inf, -np.inf])), sc(np.nan))
+
+        # unless the y values are equal
+        assert_equal(np.interp(0.5, [-np.inf, +np.inf], sc([     10,      10])), sc(10))
+
+    def test_non_finite_half_inf_xf(self, sc):
+        """ Test that interp where both axes have a bound at inf gives nan """
+        assert_equal(np.interp(0.5, [-np.inf,       1], sc([-np.inf,      10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [-np.inf,       1], sc([+np.inf,      10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [-np.inf,       1], sc([      0, -np.inf])), sc(np.nan))
+        assert_equal(np.interp(0.5, [-np.inf,       1], sc([      0, +np.inf])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0, +np.inf], sc([-np.inf,      10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0, +np.inf], sc([+np.inf,      10])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0, +np.inf], sc([      0, -np.inf])), sc(np.nan))
+        assert_equal(np.interp(0.5, [      0, +np.inf], sc([      0, +np.inf])), sc(np.nan))
+
+    def test_non_finite_half_inf_x(self, sc):
+        """ Test interp where the x axis has a bound at inf """
+        assert_equal(np.interp(0.5, [-np.inf, -np.inf], sc([0, 10])), sc(10))
+        assert_equal(np.interp(0.5, [-np.inf, 1      ], sc([0, 10])), sc(10))
+        assert_equal(np.interp(0.5, [      0, +np.inf], sc([0, 10])), sc(0))
+        assert_equal(np.interp(0.5, [+np.inf, +np.inf], sc([0, 10])), sc(0))
+
+    def test_non_finite_half_inf_f(self, sc):
+        """ Test interp where the f axis has a bound at inf """
+        assert_equal(np.interp(0.5, [0, 1], sc([      0, -np.inf])), sc(-np.inf))
+        assert_equal(np.interp(0.5, [0, 1], sc([      0, +np.inf])), sc(+np.inf))
+        assert_equal(np.interp(0.5, [0, 1], sc([-np.inf,      10])), sc(-np.inf))
+        assert_equal(np.interp(0.5, [0, 1], sc([+np.inf,      10])), sc(+np.inf))
+        assert_equal(np.interp(0.5, [0, 1], sc([-np.inf, -np.inf])), sc(-np.inf))
+        assert_equal(np.interp(0.5, [0, 1], sc([+np.inf, +np.inf])), sc(+np.inf))
+
+    def test_complex_interp(self):
+        # test complex interpolation
+        x = np.linspace(0, 1, 5)
+        y = np.linspace(0, 1, 5) + (1 + np.linspace(0, 1, 5))*1.0j
+        x0 = 0.3
+        y0 = x0 + (1+x0)*1.0j
+        assert_almost_equal(np.interp(x0, x, y), y0)
+        # test complex left and right
+        x0 = -1
+        left = 2 + 3.0j
+        assert_almost_equal(np.interp(x0, x, y, left=left), left)
+        x0 = 2.0
+        right = 2 + 3.0j
+        assert_almost_equal(np.interp(x0, x, y, right=right), right)
+        # test complex non finite
+        x = [1, 2, 2.5, 3, 4]
+        xp = [1, 2, 3, 4]
+        fp = [1, 2+1j, np.inf, 4]
+        y = [1, 2+1j, np.inf+0.5j, np.inf, 4]
+        assert_almost_equal(np.interp(x, xp, fp), y)
+        # test complex periodic
+        x = [-180, -170, -185, 185, -10, -5, 0, 365]
+        xp = [190, -190, 350, -350]
+        fp = [5+1.0j, 10+2j, 3+3j, 4+4j]
+        y = [7.5+1.5j, 5.+1.0j, 8.75+1.75j, 6.25+1.25j, 3.+3j, 3.25+3.25j,
+             3.5+3.5j, 3.75+3.75j]
+        assert_almost_equal(np.interp(x, xp, fp, period=360), y)
+
+    def test_zero_dimensional_interpolation_point(self):
+        x = np.linspace(0, 1, 5)
+        y = np.linspace(0, 1, 5)
+        x0 = np.array(.3)
+        assert_almost_equal(np.interp(x0, x, y), x0)
+
+        xp = np.array([0, 2, 4])
+        fp = np.array([1, -1, 1])
+
+        actual = np.interp(np.array(1), xp, fp)
+        assert_equal(actual, 0)
+        assert_(isinstance(actual, np.float64))
+
+        actual = np.interp(np.array(4.5), xp, fp, period=4)
+        assert_equal(actual, 0.5)
+        assert_(isinstance(actual, np.float64))
+
+    def test_if_len_x_is_small(self):
+        xp = np.arange(0, 10, 0.0001)
+        fp = np.sin(xp)
+        assert_almost_equal(np.interp(np.pi, xp, fp), 0.0)
+
+    def test_period(self):
+        x = [-180, -170, -185, 185, -10, -5, 0, 365]
+        xp = [190, -190, 350, -350]
+        fp = [5, 10, 3, 4]
+        y = [7.5, 5., 8.75, 6.25, 3., 3.25, 3.5, 3.75]
+        assert_almost_equal(np.interp(x, xp, fp, period=360), y)
+        x = np.array(x, order='F').reshape(2, -1)
+        y = np.array(y, order='C').reshape(2, -1)
+        assert_almost_equal(np.interp(x, xp, fp, period=360), y)
+
+
+def compare_results(res, desired):
+    for i in range(len(desired)):
+        assert_array_equal(res[i], desired[i])
+
+
+class TestPercentile:
+
+    def test_basic(self):
+        x = np.arange(8) * 0.5
+        assert_equal(np.percentile(x, 0), 0.)
+        assert_equal(np.percentile(x, 100), 3.5)
+        assert_equal(np.percentile(x, 50), 1.75)
+        x[1] = np.nan
+        assert_equal(np.percentile(x, 0), np.nan)
+        assert_equal(np.percentile(x, 0, interpolation='nearest'), np.nan)
+
+    def test_fraction(self):
+        x = [Fraction(i, 2) for i in range(8)]
+
+        p = np.percentile(x, Fraction(0))
+        assert_equal(p, Fraction(0))
+        assert_equal(type(p), Fraction)
+
+        p = np.percentile(x, Fraction(100))
+        assert_equal(p, Fraction(7, 2))
+        assert_equal(type(p), Fraction)
+
+        p = np.percentile(x, Fraction(50))
+        assert_equal(p, Fraction(7, 4))
+        assert_equal(type(p), Fraction)
+
+    def test_api(self):
+        d = np.ones(5)
+        np.percentile(d, 5, None, None, False)
+        np.percentile(d, 5, None, None, False, 'linear')
+        o = np.ones((1,))
+        np.percentile(d, 5, None, o, False, 'linear')
+
+    def test_2D(self):
+        x = np.array([[1, 1, 1],
+                      [1, 1, 1],
+                      [4, 4, 3],
+                      [1, 1, 1],
+                      [1, 1, 1]])
+        assert_array_equal(np.percentile(x, 50, axis=0), [1, 1, 1])
+
+    def test_linear(self):
+
+        # Test defaults
+        assert_equal(np.percentile(range(10), 50), 4.5)
+
+        # explicitly specify interpolation_method 'linear' (the default)
+        assert_equal(np.percentile(range(10), 50,
+                                   interpolation='linear'), 4.5)
+
+    def test_lower_higher(self):
+
+        # interpolation_method 'lower'/'higher'
+        assert_equal(np.percentile(range(10), 50,
+                                   interpolation='lower'), 4)
+        assert_equal(np.percentile(range(10), 50,
+                                   interpolation='higher'), 5)
+
+    def test_midpoint(self):
+        assert_equal(np.percentile(range(10), 51,
+                                   interpolation='midpoint'), 4.5)
+        assert_equal(np.percentile(range(11), 51,
+                                   interpolation='midpoint'), 5.5)
+        assert_equal(np.percentile(range(11), 50,
+                                   interpolation='midpoint'), 5)
+
+    def test_nearest(self):
+        assert_equal(np.percentile(range(10), 51,
+                                   interpolation='nearest'), 5)
+        assert_equal(np.percentile(range(10), 49,
+                                   interpolation='nearest'), 4)
+
+    def test_sequence(self):
+        x = np.arange(8) * 0.5
+        assert_equal(np.percentile(x, [0, 100, 50]), [0, 3.5, 1.75])
+
+    def test_axis(self):
+        x = np.arange(12).reshape(3, 4)
+
+        assert_equal(np.percentile(x, (25, 50, 100)), [2.75, 5.5, 11.0])
+
+        r0 = [[2, 3, 4, 5], [4, 5, 6, 7], [8, 9, 10, 11]]
+        assert_equal(np.percentile(x, (25, 50, 100), axis=0), r0)
+
+        r1 = [[0.75, 1.5, 3], [4.75, 5.5, 7], [8.75, 9.5, 11]]
+        assert_equal(np.percentile(x, (25, 50, 100), axis=1), np.array(r1).T)
+
+        # ensure qth axis is always first as with np.array(old_percentile(..))
+        x = np.arange(3 * 4 * 5 * 6).reshape(3, 4, 5, 6)
+        assert_equal(np.percentile(x, (25, 50)).shape, (2,))
+        assert_equal(np.percentile(x, (25, 50, 75)).shape, (3,))
+        assert_equal(np.percentile(x, (25, 50), axis=0).shape, (2, 4, 5, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=1).shape, (2, 3, 5, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=2).shape, (2, 3, 4, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=3).shape, (2, 3, 4, 5))
+        assert_equal(
+            np.percentile(x, (25, 50, 75), axis=1).shape, (3, 3, 5, 6))
+        assert_equal(np.percentile(x, (25, 50),
+                                   interpolation="higher").shape, (2,))
+        assert_equal(np.percentile(x, (25, 50, 75),
+                                   interpolation="higher").shape, (3,))
+        assert_equal(np.percentile(x, (25, 50), axis=0,
+                                   interpolation="higher").shape, (2, 4, 5, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=1,
+                                   interpolation="higher").shape, (2, 3, 5, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=2,
+                                   interpolation="higher").shape, (2, 3, 4, 6))
+        assert_equal(np.percentile(x, (25, 50), axis=3,
+                                   interpolation="higher").shape, (2, 3, 4, 5))
+        assert_equal(np.percentile(x, (25, 50, 75), axis=1,
+                                   interpolation="higher").shape, (3, 3, 5, 6))
+
+    def test_scalar_q(self):
+        # test for no empty dimensions for compatibility with old percentile
+        x = np.arange(12).reshape(3, 4)
+        assert_equal(np.percentile(x, 50), 5.5)
+        assert_(np.isscalar(np.percentile(x, 50)))
+        r0 = np.array([4.,  5.,  6.,  7.])
+        assert_equal(np.percentile(x, 50, axis=0), r0)
+        assert_equal(np.percentile(x, 50, axis=0).shape, r0.shape)
+        r1 = np.array([1.5,  5.5,  9.5])
+        assert_almost_equal(np.percentile(x, 50, axis=1), r1)
+        assert_equal(np.percentile(x, 50, axis=1).shape, r1.shape)
+
+        out = np.empty(1)
+        assert_equal(np.percentile(x, 50, out=out), 5.5)
+        assert_equal(out, 5.5)
+        out = np.empty(4)
+        assert_equal(np.percentile(x, 50, axis=0, out=out), r0)
+        assert_equal(out, r0)
+        out = np.empty(3)
+        assert_equal(np.percentile(x, 50, axis=1, out=out), r1)
+        assert_equal(out, r1)
+
+        # test for no empty dimensions for compatibility with old percentile
+        x = np.arange(12).reshape(3, 4)
+        assert_equal(np.percentile(x, 50, interpolation='lower'), 5.)
+        assert_(np.isscalar(np.percentile(x, 50)))
+        r0 = np.array([4.,  5.,  6.,  7.])
+        c0 = np.percentile(x, 50, interpolation='lower', axis=0)
+        assert_equal(c0, r0)
+        assert_equal(c0.shape, r0.shape)
+        r1 = np.array([1.,  5.,  9.])
+        c1 = np.percentile(x, 50, interpolation='lower', axis=1)
+        assert_almost_equal(c1, r1)
+        assert_equal(c1.shape, r1.shape)
+
+        out = np.empty((), dtype=x.dtype)
+        c = np.percentile(x, 50, interpolation='lower', out=out)
+        assert_equal(c, 5)
+        assert_equal(out, 5)
+        out = np.empty(4, dtype=x.dtype)
+        c = np.percentile(x, 50, interpolation='lower', axis=0, out=out)
+        assert_equal(c, r0)
+        assert_equal(out, r0)
+        out = np.empty(3, dtype=x.dtype)
+        c = np.percentile(x, 50, interpolation='lower', axis=1, out=out)
+        assert_equal(c, r1)
+        assert_equal(out, r1)
+
+    def test_exception(self):
+        assert_raises(ValueError, np.percentile, [1, 2], 56,
+                      interpolation='foobar')
+        assert_raises(ValueError, np.percentile, [1], 101)
+        assert_raises(ValueError, np.percentile, [1], -1)
+        assert_raises(ValueError, np.percentile, [1], list(range(50)) + [101])
+        assert_raises(ValueError, np.percentile, [1], list(range(50)) + [-0.1])
+
+    def test_percentile_list(self):
+        assert_equal(np.percentile([1, 2, 3], 0), 1)
+
+    def test_percentile_out(self):
+        x = np.array([1, 2, 3])
+        y = np.zeros((3,))
+        p = (1, 2, 3)
+        np.percentile(x, p, out=y)
+        assert_equal(y, np.percentile(x, p))
+
+        x = np.array([[1, 2, 3],
+                      [4, 5, 6]])
+
+        y = np.zeros((3, 3))
+        np.percentile(x, p, axis=0, out=y)
+        assert_equal(y, np.percentile(x, p, axis=0))
+
+        y = np.zeros((3, 2))
+        np.percentile(x, p, axis=1, out=y)
+        assert_equal(y, np.percentile(x, p, axis=1))
+
+        x = np.arange(12).reshape(3, 4)
+        # q.dim > 1, float
+        r0 = np.array([[2.,  3.,  4., 5.], [4., 5., 6., 7.]])
+        out = np.empty((2, 4))
+        assert_equal(np.percentile(x, (25, 50), axis=0, out=out), r0)
+        assert_equal(out, r0)
+        r1 = np.array([[0.75,  4.75,  8.75], [1.5,  5.5,  9.5]])
+        out = np.empty((2, 3))
+        assert_equal(np.percentile(x, (25, 50), axis=1, out=out), r1)
+        assert_equal(out, r1)
+
+        # q.dim > 1, int
+        r0 = np.array([[0,  1,  2, 3], [4, 5, 6, 7]])
+        out = np.empty((2, 4), dtype=x.dtype)
+        c = np.percentile(x, (25, 50), interpolation='lower', axis=0, out=out)
+        assert_equal(c, r0)
+        assert_equal(out, r0)
+        r1 = np.array([[0,  4,  8], [1,  5,  9]])
+        out = np.empty((2, 3), dtype=x.dtype)
+        c = np.percentile(x, (25, 50), interpolation='lower', axis=1, out=out)
+        assert_equal(c, r1)
+        assert_equal(out, r1)
+
+    def test_percentile_empty_dim(self):
+        # empty dims are preserved
+        d = np.arange(11 * 2).reshape(11, 1, 2, 1)
+        assert_array_equal(np.percentile(d, 50, axis=0).shape, (1, 2, 1))
+        assert_array_equal(np.percentile(d, 50, axis=1).shape, (11, 2, 1))
+        assert_array_equal(np.percentile(d, 50, axis=2).shape, (11, 1, 1))
+        assert_array_equal(np.percentile(d, 50, axis=3).shape, (11, 1, 2))
+        assert_array_equal(np.percentile(d, 50, axis=-1).shape, (11, 1, 2))
+        assert_array_equal(np.percentile(d, 50, axis=-2).shape, (11, 1, 1))
+        assert_array_equal(np.percentile(d, 50, axis=-3).shape, (11, 2, 1))
+        assert_array_equal(np.percentile(d, 50, axis=-4).shape, (1, 2, 1))
+
+        assert_array_equal(np.percentile(d, 50, axis=2,
+                                         interpolation='midpoint').shape,
+                           (11, 1, 1))
+        assert_array_equal(np.percentile(d, 50, axis=-2,
+                                         interpolation='midpoint').shape,
+                           (11, 1, 1))
+
+        assert_array_equal(np.array(np.percentile(d, [10, 50], axis=0)).shape,
+                           (2, 1, 2, 1))
+        assert_array_equal(np.array(np.percentile(d, [10, 50], axis=1)).shape,
+                           (2, 11, 2, 1))
+        assert_array_equal(np.array(np.percentile(d, [10, 50], axis=2)).shape,
+                           (2, 11, 1, 1))
+        assert_array_equal(np.array(np.percentile(d, [10, 50], axis=3)).shape,
+                           (2, 11, 1, 2))
+
+    def test_percentile_no_overwrite(self):
+        a = np.array([2, 3, 4, 1])
+        np.percentile(a, [50], overwrite_input=False)
+        assert_equal(a, np.array([2, 3, 4, 1]))
+
+        a = np.array([2, 3, 4, 1])
+        np.percentile(a, [50])
+        assert_equal(a, np.array([2, 3, 4, 1]))
+
+    def test_no_p_overwrite(self):
+        p = np.linspace(0., 100., num=5)
+        np.percentile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, np.linspace(0., 100., num=5))
+        p = np.linspace(0., 100., num=5).tolist()
+        np.percentile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, np.linspace(0., 100., num=5).tolist())
+
+    def test_percentile_overwrite(self):
+        a = np.array([2, 3, 4, 1])
+        b = np.percentile(a, [50], overwrite_input=True)
+        assert_equal(b, np.array([2.5]))
+
+        b = np.percentile([2, 3, 4, 1], [50], overwrite_input=True)
+        assert_equal(b, np.array([2.5]))
+
+    def test_extended_axis(self):
+        o = np.random.normal(size=(71, 23))
+        x = np.dstack([o] * 10)
+        assert_equal(np.percentile(x, 30, axis=(0, 1)), np.percentile(o, 30))
+        x = np.moveaxis(x, -1, 0)
+        assert_equal(np.percentile(x, 30, axis=(-2, -1)), np.percentile(o, 30))
+        x = x.swapaxes(0, 1).copy()
+        assert_equal(np.percentile(x, 30, axis=(0, -1)), np.percentile(o, 30))
+        x = x.swapaxes(0, 1).copy()
+
+        assert_equal(np.percentile(x, [25, 60], axis=(0, 1, 2)),
+                     np.percentile(x, [25, 60], axis=None))
+        assert_equal(np.percentile(x, [25, 60], axis=(0,)),
+                     np.percentile(x, [25, 60], axis=0))
+
+        d = np.arange(3 * 5 * 7 * 11).reshape((3, 5, 7, 11))
+        np.random.shuffle(d.ravel())
+        assert_equal(np.percentile(d, 25,  axis=(0, 1, 2))[0],
+                     np.percentile(d[:,:,:, 0].flatten(), 25))
+        assert_equal(np.percentile(d, [10, 90], axis=(0, 1, 3))[:, 1],
+                     np.percentile(d[:,:, 1,:].flatten(), [10, 90]))
+        assert_equal(np.percentile(d, 25, axis=(3, 1, -4))[2],
+                     np.percentile(d[:,:, 2,:].flatten(), 25))
+        assert_equal(np.percentile(d, 25, axis=(3, 1, 2))[2],
+                     np.percentile(d[2,:,:,:].flatten(), 25))
+        assert_equal(np.percentile(d, 25, axis=(3, 2))[2, 1],
+                     np.percentile(d[2, 1,:,:].flatten(), 25))
+        assert_equal(np.percentile(d, 25, axis=(1, -2))[2, 1],
+                     np.percentile(d[2,:,:, 1].flatten(), 25))
+        assert_equal(np.percentile(d, 25, axis=(1, 3))[2, 2],
+                     np.percentile(d[2,:, 2,:].flatten(), 25))
+
+    def test_extended_axis_invalid(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_raises(np.AxisError, np.percentile, d, axis=-5, q=25)
+        assert_raises(np.AxisError, np.percentile, d, axis=(0, -5), q=25)
+        assert_raises(np.AxisError, np.percentile, d, axis=4, q=25)
+        assert_raises(np.AxisError, np.percentile, d, axis=(0, 4), q=25)
+        # each of these refers to the same axis twice
+        assert_raises(ValueError, np.percentile, d, axis=(1, 1), q=25)
+        assert_raises(ValueError, np.percentile, d, axis=(-1, -1), q=25)
+        assert_raises(ValueError, np.percentile, d, axis=(3, -1), q=25)
+
+    def test_keepdims(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_equal(np.percentile(d, 7, axis=None, keepdims=True).shape,
+                     (1, 1, 1, 1))
+        assert_equal(np.percentile(d, 7, axis=(0, 1), keepdims=True).shape,
+                     (1, 1, 7, 11))
+        assert_equal(np.percentile(d, 7, axis=(0, 3), keepdims=True).shape,
+                     (1, 5, 7, 1))
+        assert_equal(np.percentile(d, 7, axis=(1,), keepdims=True).shape,
+                     (3, 1, 7, 11))
+        assert_equal(np.percentile(d, 7, (0, 1, 2, 3), keepdims=True).shape,
+                     (1, 1, 1, 1))
+        assert_equal(np.percentile(d, 7, axis=(0, 1, 3), keepdims=True).shape,
+                     (1, 1, 7, 1))
+
+        assert_equal(np.percentile(d, [1, 7], axis=(0, 1, 3),
+                                   keepdims=True).shape, (2, 1, 1, 7, 1))
+        assert_equal(np.percentile(d, [1, 7], axis=(0, 3),
+                                   keepdims=True).shape, (2, 1, 5, 7, 1))
+
+    def test_out(self):
+        o = np.zeros((4,))
+        d = np.ones((3, 4))
+        assert_equal(np.percentile(d, 0, 0, out=o), o)
+        assert_equal(np.percentile(d, 0, 0, interpolation='nearest', out=o), o)
+        o = np.zeros((3,))
+        assert_equal(np.percentile(d, 1, 1, out=o), o)
+        assert_equal(np.percentile(d, 1, 1, interpolation='nearest', out=o), o)
+
+        o = np.zeros(())
+        assert_equal(np.percentile(d, 2, out=o), o)
+        assert_equal(np.percentile(d, 2, interpolation='nearest', out=o), o)
+
+    def test_out_nan(self):
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            o = np.zeros((4,))
+            d = np.ones((3, 4))
+            d[2, 1] = np.nan
+            assert_equal(np.percentile(d, 0, 0, out=o), o)
+            assert_equal(
+                np.percentile(d, 0, 0, interpolation='nearest', out=o), o)
+            o = np.zeros((3,))
+            assert_equal(np.percentile(d, 1, 1, out=o), o)
+            assert_equal(
+                np.percentile(d, 1, 1, interpolation='nearest', out=o), o)
+            o = np.zeros(())
+            assert_equal(np.percentile(d, 1, out=o), o)
+            assert_equal(
+                np.percentile(d, 1, interpolation='nearest', out=o), o)
+
+    def test_nan_behavior(self):
+        a = np.arange(24, dtype=float)
+        a[2] = np.nan
+        assert_equal(np.percentile(a, 0.3), np.nan)
+        assert_equal(np.percentile(a, 0.3, axis=0), np.nan)
+        assert_equal(np.percentile(a, [0.3, 0.6], axis=0),
+                     np.array([np.nan] * 2))
+
+        a = np.arange(24, dtype=float).reshape(2, 3, 4)
+        a[1, 2, 3] = np.nan
+        a[1, 1, 2] = np.nan
+
+        # no axis
+        assert_equal(np.percentile(a, 0.3), np.nan)
+        assert_equal(np.percentile(a, 0.3).ndim, 0)
+
+        # axis0 zerod
+        b = np.percentile(np.arange(24, dtype=float).reshape(2, 3, 4), 0.3, 0)
+        b[2, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.percentile(a, 0.3, 0), b)
+
+        # axis0 not zerod
+        b = np.percentile(np.arange(24, dtype=float).reshape(2, 3, 4),
+                          [0.3, 0.6], 0)
+        b[:, 2, 3] = np.nan
+        b[:, 1, 2] = np.nan
+        assert_equal(np.percentile(a, [0.3, 0.6], 0), b)
+
+        # axis1 zerod
+        b = np.percentile(np.arange(24, dtype=float).reshape(2, 3, 4), 0.3, 1)
+        b[1, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.percentile(a, 0.3, 1), b)
+        # axis1 not zerod
+        b = np.percentile(
+            np.arange(24, dtype=float).reshape(2, 3, 4), [0.3, 0.6], 1)
+        b[:, 1, 3] = np.nan
+        b[:, 1, 2] = np.nan
+        assert_equal(np.percentile(a, [0.3, 0.6], 1), b)
+
+        # axis02 zerod
+        b = np.percentile(
+            np.arange(24, dtype=float).reshape(2, 3, 4), 0.3, (0, 2))
+        b[1] = np.nan
+        b[2] = np.nan
+        assert_equal(np.percentile(a, 0.3, (0, 2)), b)
+        # axis02 not zerod
+        b = np.percentile(np.arange(24, dtype=float).reshape(2, 3, 4),
+                          [0.3, 0.6], (0, 2))
+        b[:, 1] = np.nan
+        b[:, 2] = np.nan
+        assert_equal(np.percentile(a, [0.3, 0.6], (0, 2)), b)
+        # axis02 not zerod with nearest interpolation
+        b = np.percentile(np.arange(24, dtype=float).reshape(2, 3, 4),
+                          [0.3, 0.6], (0, 2), interpolation='nearest')
+        b[:, 1] = np.nan
+        b[:, 2] = np.nan
+        assert_equal(np.percentile(
+            a, [0.3, 0.6], (0, 2), interpolation='nearest'), b)
+
+
+class TestQuantile:
+    # most of this is already tested by TestPercentile
+
+    def test_basic(self):
+        x = np.arange(8) * 0.5
+        assert_equal(np.quantile(x, 0), 0.)
+        assert_equal(np.quantile(x, 1), 3.5)
+        assert_equal(np.quantile(x, 0.5), 1.75)
+
+    def test_correct_quantile_value(self):
+        a = np.array([True])
+        tf_quant = np.quantile(True, False)
+        assert_equal(tf_quant, a[0])
+        assert_equal(type(tf_quant), a.dtype)
+        a = np.array([False, True, True])
+        quant_res = np.quantile(a, a)
+        assert_array_equal(quant_res, a)
+        assert_equal(a.dtype, quant_res.dtype)
+
+    def test_fraction(self):
+        # fractional input, integral quantile
+        x = [Fraction(i, 2) for i in range(8)]
+
+        q = np.quantile(x, 0)
+        assert_equal(q, 0)
+        assert_equal(type(q), Fraction)
+
+        q = np.quantile(x, 1)
+        assert_equal(q, Fraction(7, 2))
+        assert_equal(type(q), Fraction)
+
+        q = np.quantile(x, Fraction(1, 2))
+        assert_equal(q, Fraction(7, 4))
+        assert_equal(type(q), Fraction)
+
+        # repeat with integral input but fractional quantile
+        x = np.arange(8)
+        assert_equal(np.quantile(x, Fraction(1, 2)), Fraction(7, 2))
+
+    def test_no_p_overwrite(self):
+        # this is worth retesting, because quantile does not make a copy
+        p0 = np.array([0, 0.75, 0.25, 0.5, 1.0])
+        p = p0.copy()
+        np.quantile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, p0)
+
+        p0 = p0.tolist()
+        p = p.tolist()
+        np.quantile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, p0)
+
+
+class TestMedian:
+
+    def test_basic(self):
+        a0 = np.array(1)
+        a1 = np.arange(2)
+        a2 = np.arange(6).reshape(2, 3)
+        assert_equal(np.median(a0), 1)
+        assert_allclose(np.median(a1), 0.5)
+        assert_allclose(np.median(a2), 2.5)
+        assert_allclose(np.median(a2, axis=0), [1.5,  2.5,  3.5])
+        assert_equal(np.median(a2, axis=1), [1, 4])
+        assert_allclose(np.median(a2, axis=None), 2.5)
+
+        a = np.array([0.0444502, 0.0463301, 0.141249, 0.0606775])
+        assert_almost_equal((a[1] + a[3]) / 2., np.median(a))
+        a = np.array([0.0463301, 0.0444502, 0.141249])
+        assert_equal(a[0], np.median(a))
+        a = np.array([0.0444502, 0.141249, 0.0463301])
+        assert_equal(a[-1], np.median(a))
+        # check array scalar result
+        assert_equal(np.median(a).ndim, 0)
+        a[1] = np.nan
+        assert_equal(np.median(a).ndim, 0)
+
+    def test_axis_keyword(self):
+        a3 = np.array([[2, 3],
+                       [0, 1],
+                       [6, 7],
+                       [4, 5]])
+        for a in [a3, np.random.randint(0, 100, size=(2, 3, 4))]:
+            orig = a.copy()
+            np.median(a, axis=None)
+            for ax in range(a.ndim):
+                np.median(a, axis=ax)
+            assert_array_equal(a, orig)
+
+        assert_allclose(np.median(a3, axis=0), [3,  4])
+        assert_allclose(np.median(a3.T, axis=1), [3,  4])
+        assert_allclose(np.median(a3), 3.5)
+        assert_allclose(np.median(a3, axis=None), 3.5)
+        assert_allclose(np.median(a3.T), 3.5)
+
+    def test_overwrite_keyword(self):
+        a3 = np.array([[2, 3],
+                       [0, 1],
+                       [6, 7],
+                       [4, 5]])
+        a0 = np.array(1)
+        a1 = np.arange(2)
+        a2 = np.arange(6).reshape(2, 3)
+        assert_allclose(np.median(a0.copy(), overwrite_input=True), 1)
+        assert_allclose(np.median(a1.copy(), overwrite_input=True), 0.5)
+        assert_allclose(np.median(a2.copy(), overwrite_input=True), 2.5)
+        assert_allclose(np.median(a2.copy(), overwrite_input=True, axis=0),
+                        [1.5,  2.5,  3.5])
+        assert_allclose(
+            np.median(a2.copy(), overwrite_input=True, axis=1), [1, 4])
+        assert_allclose(
+            np.median(a2.copy(), overwrite_input=True, axis=None), 2.5)
+        assert_allclose(
+            np.median(a3.copy(), overwrite_input=True, axis=0), [3,  4])
+        assert_allclose(np.median(a3.T.copy(), overwrite_input=True, axis=1),
+                        [3,  4])
+
+        a4 = np.arange(3 * 4 * 5, dtype=np.float32).reshape((3, 4, 5))
+        np.random.shuffle(a4.ravel())
+        assert_allclose(np.median(a4, axis=None),
+                        np.median(a4.copy(), axis=None, overwrite_input=True))
+        assert_allclose(np.median(a4, axis=0),
+                        np.median(a4.copy(), axis=0, overwrite_input=True))
+        assert_allclose(np.median(a4, axis=1),
+                        np.median(a4.copy(), axis=1, overwrite_input=True))
+        assert_allclose(np.median(a4, axis=2),
+                        np.median(a4.copy(), axis=2, overwrite_input=True))
+
+    def test_array_like(self):
+        x = [1, 2, 3]
+        assert_almost_equal(np.median(x), 2)
+        x2 = [x]
+        assert_almost_equal(np.median(x2), 2)
+        assert_allclose(np.median(x2, axis=0), x)
+
+    def test_subclass(self):
+        # gh-3846
+        class MySubClass(np.ndarray):
+
+            def __new__(cls, input_array, info=None):
+                obj = np.asarray(input_array).view(cls)
+                obj.info = info
+                return obj
+
+            def mean(self, axis=None, dtype=None, out=None):
+                return -7
+
+        a = MySubClass([1, 2, 3])
+        assert_equal(np.median(a), -7)
+
+    def test_out(self):
+        o = np.zeros((4,))
+        d = np.ones((3, 4))
+        assert_equal(np.median(d, 0, out=o), o)
+        o = np.zeros((3,))
+        assert_equal(np.median(d, 1, out=o), o)
+        o = np.zeros(())
+        assert_equal(np.median(d, out=o), o)
+
+    def test_out_nan(self):
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            o = np.zeros((4,))
+            d = np.ones((3, 4))
+            d[2, 1] = np.nan
+            assert_equal(np.median(d, 0, out=o), o)
+            o = np.zeros((3,))
+            assert_equal(np.median(d, 1, out=o), o)
+            o = np.zeros(())
+            assert_equal(np.median(d, out=o), o)
+
+    def test_nan_behavior(self):
+        a = np.arange(24, dtype=float)
+        a[2] = np.nan
+        assert_equal(np.median(a), np.nan)
+        assert_equal(np.median(a, axis=0), np.nan)
+
+        a = np.arange(24, dtype=float).reshape(2, 3, 4)
+        a[1, 2, 3] = np.nan
+        a[1, 1, 2] = np.nan
+
+        # no axis
+        assert_equal(np.median(a), np.nan)
+        assert_equal(np.median(a).ndim, 0)
+
+        # axis0
+        b = np.median(np.arange(24, dtype=float).reshape(2, 3, 4), 0)
+        b[2, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.median(a, 0), b)
+
+        # axis1
+        b = np.median(np.arange(24, dtype=float).reshape(2, 3, 4), 1)
+        b[1, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.median(a, 1), b)
+
+        # axis02
+        b = np.median(np.arange(24, dtype=float).reshape(2, 3, 4), (0, 2))
+        b[1] = np.nan
+        b[2] = np.nan
+        assert_equal(np.median(a, (0, 2)), b)
+
+    def test_empty(self):
+        # mean(empty array) emits two warnings: empty slice and divide by 0
+        a = np.array([], dtype=float)
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_equal(np.median(a), np.nan)
+            assert_(w[0].category is RuntimeWarning)
+            assert_equal(len(w), 2)
+
+        # multiple dimensions
+        a = np.array([], dtype=float, ndmin=3)
+        # no axis
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_equal(np.median(a), np.nan)
+            assert_(w[0].category is RuntimeWarning)
+
+        # axis 0 and 1
+        b = np.array([], dtype=float, ndmin=2)
+        assert_equal(np.median(a, axis=0), b)
+        assert_equal(np.median(a, axis=1), b)
+
+        # axis 2
+        b = np.array(np.nan, dtype=float, ndmin=2)
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_equal(np.median(a, axis=2), b)
+            assert_(w[0].category is RuntimeWarning)
+
+    def test_object(self):
+        o = np.arange(7.)
+        assert_(type(np.median(o.astype(object))), float)
+        o[2] = np.nan
+        assert_(type(np.median(o.astype(object))), float)
+
+    def test_extended_axis(self):
+        o = np.random.normal(size=(71, 23))
+        x = np.dstack([o] * 10)
+        assert_equal(np.median(x, axis=(0, 1)), np.median(o))
+        x = np.moveaxis(x, -1, 0)
+        assert_equal(np.median(x, axis=(-2, -1)), np.median(o))
+        x = x.swapaxes(0, 1).copy()
+        assert_equal(np.median(x, axis=(0, -1)), np.median(o))
+
+        assert_equal(np.median(x, axis=(0, 1, 2)), np.median(x, axis=None))
+        assert_equal(np.median(x, axis=(0, )), np.median(x, axis=0))
+        assert_equal(np.median(x, axis=(-1, )), np.median(x, axis=-1))
+
+        d = np.arange(3 * 5 * 7 * 11).reshape((3, 5, 7, 11))
+        np.random.shuffle(d.ravel())
+        assert_equal(np.median(d, axis=(0, 1, 2))[0],
+                     np.median(d[:,:,:, 0].flatten()))
+        assert_equal(np.median(d, axis=(0, 1, 3))[1],
+                     np.median(d[:,:, 1,:].flatten()))
+        assert_equal(np.median(d, axis=(3, 1, -4))[2],
+                     np.median(d[:,:, 2,:].flatten()))
+        assert_equal(np.median(d, axis=(3, 1, 2))[2],
+                     np.median(d[2,:,:,:].flatten()))
+        assert_equal(np.median(d, axis=(3, 2))[2, 1],
+                     np.median(d[2, 1,:,:].flatten()))
+        assert_equal(np.median(d, axis=(1, -2))[2, 1],
+                     np.median(d[2,:,:, 1].flatten()))
+        assert_equal(np.median(d, axis=(1, 3))[2, 2],
+                     np.median(d[2,:, 2,:].flatten()))
+
+    def test_extended_axis_invalid(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_raises(np.AxisError, np.median, d, axis=-5)
+        assert_raises(np.AxisError, np.median, d, axis=(0, -5))
+        assert_raises(np.AxisError, np.median, d, axis=4)
+        assert_raises(np.AxisError, np.median, d, axis=(0, 4))
+        assert_raises(ValueError, np.median, d, axis=(1, 1))
+
+    def test_keepdims(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_equal(np.median(d, axis=None, keepdims=True).shape,
+                     (1, 1, 1, 1))
+        assert_equal(np.median(d, axis=(0, 1), keepdims=True).shape,
+                     (1, 1, 7, 11))
+        assert_equal(np.median(d, axis=(0, 3), keepdims=True).shape,
+                     (1, 5, 7, 1))
+        assert_equal(np.median(d, axis=(1,), keepdims=True).shape,
+                     (3, 1, 7, 11))
+        assert_equal(np.median(d, axis=(0, 1, 2, 3), keepdims=True).shape,
+                     (1, 1, 1, 1))
+        assert_equal(np.median(d, axis=(0, 1, 3), keepdims=True).shape,
+                     (1, 1, 7, 1))
+
+
+class TestAdd_newdoc_ufunc:
+
+    def test_ufunc_arg(self):
+        assert_raises(TypeError, add_newdoc_ufunc, 2, "blah")
+        assert_raises(ValueError, add_newdoc_ufunc, np.add, "blah")
+
+    def test_string_arg(self):
+        assert_raises(TypeError, add_newdoc_ufunc, np.add, 3)
+
+
+class TestAdd_newdoc:
+
+    @pytest.mark.skipif(sys.flags.optimize == 2, reason="Python running -OO")
+    @pytest.mark.xfail(IS_PYPY, reason="PyPy does not modify tp_doc")
+    def test_add_doc(self):
+        # test np.add_newdoc
+        tgt = "Current flat index into the array."
+        assert_equal(np.core.flatiter.index.__doc__[:len(tgt)], tgt)
+        assert_(len(np.core.ufunc.identity.__doc__) > 300)
+        assert_(len(np.lib.index_tricks.mgrid.__doc__) > 300)
+
+class TestSortComplex:
+
+    @pytest.mark.parametrize("type_in, type_out", [
+        ('l', 'D'),
+        ('h', 'F'),
+        ('H', 'F'),
+        ('b', 'F'),
+        ('B', 'F'),
+        ('g', 'G'),
+        ])
+    def test_sort_real(self, type_in, type_out):
+        # sort_complex() type casting for real input types
+        a = np.array([5, 3, 6, 2, 1], dtype=type_in)
+        actual = np.sort_complex(a)
+        expected = np.sort(a).astype(type_out)
+        assert_equal(actual, expected)
+        assert_equal(actual.dtype, expected.dtype)
+
+    def test_sort_complex(self):
+        # sort_complex() handling of complex input
+        a = np.array([2 + 3j, 1 - 2j, 1 - 3j, 2 + 1j], dtype='D')
+        expected = np.array([1 - 3j, 1 - 2j, 2 + 1j, 2 + 3j], dtype='D')
+        actual = np.sort_complex(a)
+        assert_equal(actual, expected)
+        assert_equal(actual.dtype, expected.dtype)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_histograms.py b/venv/Lib/site-packages/numpy/lib/tests/test_histograms.py
new file mode 100644
index 000000000..fc16b7396
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_histograms.py
@@ -0,0 +1,838 @@
+import numpy as np
+
+from numpy.lib.histograms import histogram, histogramdd, histogram_bin_edges
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_almost_equal,
+    assert_array_almost_equal, assert_raises, assert_allclose,
+    assert_array_max_ulp, assert_raises_regex, suppress_warnings,
+    )
+import pytest
+
+
+class TestHistogram:
+
+    def setup(self):
+        pass
+
+    def teardown(self):
+        pass
+
+    def test_simple(self):
+        n = 100
+        v = np.random.rand(n)
+        (a, b) = histogram(v)
+        # check if the sum of the bins equals the number of samples
+        assert_equal(np.sum(a, axis=0), n)
+        # check that the bin counts are evenly spaced when the data is from
+        # a linear function
+        (a, b) = histogram(np.linspace(0, 10, 100))
+        assert_array_equal(a, 10)
+
+    def test_one_bin(self):
+        # Ticket 632
+        hist, edges = histogram([1, 2, 3, 4], [1, 2])
+        assert_array_equal(hist, [2, ])
+        assert_array_equal(edges, [1, 2])
+        assert_raises(ValueError, histogram, [1, 2], bins=0)
+        h, e = histogram([1, 2], bins=1)
+        assert_equal(h, np.array([2]))
+        assert_allclose(e, np.array([1., 2.]))
+
+    def test_normed(self):
+        sup = suppress_warnings()
+        with sup:
+            rec = sup.record(np.VisibleDeprecationWarning, '.*normed.*')
+            # Check that the integral of the density equals 1.
+            n = 100
+            v = np.random.rand(n)
+            a, b = histogram(v, normed=True)
+            area = np.sum(a * np.diff(b))
+            assert_almost_equal(area, 1)
+            assert_equal(len(rec), 1)
+
+        sup = suppress_warnings()
+        with sup:
+            rec = sup.record(np.VisibleDeprecationWarning, '.*normed.*')
+            # Check with non-constant bin widths (buggy but backwards
+            # compatible)
+            v = np.arange(10)
+            bins = [0, 1, 5, 9, 10]
+            a, b = histogram(v, bins, normed=True)
+            area = np.sum(a * np.diff(b))
+            assert_almost_equal(area, 1)
+            assert_equal(len(rec), 1)
+
+    def test_density(self):
+        # Check that the integral of the density equals 1.
+        n = 100
+        v = np.random.rand(n)
+        a, b = histogram(v, density=True)
+        area = np.sum(a * np.diff(b))
+        assert_almost_equal(area, 1)
+
+        # Check with non-constant bin widths
+        v = np.arange(10)
+        bins = [0, 1, 3, 6, 10]
+        a, b = histogram(v, bins, density=True)
+        assert_array_equal(a, .1)
+        assert_equal(np.sum(a * np.diff(b)), 1)
+
+        # Test that passing False works too
+        a, b = histogram(v, bins, density=False)
+        assert_array_equal(a, [1, 2, 3, 4])
+
+        # Variable bin widths are especially useful to deal with
+        # infinities.
+        v = np.arange(10)
+        bins = [0, 1, 3, 6, np.inf]
+        a, b = histogram(v, bins, density=True)
+        assert_array_equal(a, [.1, .1, .1, 0.])
+
+        # Taken from a bug report from N. Becker on the numpy-discussion
+        # mailing list Aug. 6, 2010.
+        counts, dmy = np.histogram(
+            [1, 2, 3, 4], [0.5, 1.5, np.inf], density=True)
+        assert_equal(counts, [.25, 0])
+
+    def test_outliers(self):
+        # Check that outliers are not tallied
+        a = np.arange(10) + .5
+
+        # Lower outliers
+        h, b = histogram(a, range=[0, 9])
+        assert_equal(h.sum(), 9)
+
+        # Upper outliers
+        h, b = histogram(a, range=[1, 10])
+        assert_equal(h.sum(), 9)
+
+        # Normalization
+        h, b = histogram(a, range=[1, 9], density=True)
+        assert_almost_equal((h * np.diff(b)).sum(), 1, decimal=15)
+
+        # Weights
+        w = np.arange(10) + .5
+        h, b = histogram(a, range=[1, 9], weights=w, density=True)
+        assert_equal((h * np.diff(b)).sum(), 1)
+
+        h, b = histogram(a, bins=8, range=[1, 9], weights=w)
+        assert_equal(h, w[1:-1])
+
+    def test_arr_weights_mismatch(self):
+        a = np.arange(10) + .5
+        w = np.arange(11) + .5
+        with assert_raises_regex(ValueError, "same shape as"):
+            h, b = histogram(a, range=[1, 9], weights=w, density=True)
+
+
+    def test_type(self):
+        # Check the type of the returned histogram
+        a = np.arange(10) + .5
+        h, b = histogram(a)
+        assert_(np.issubdtype(h.dtype, np.integer))
+
+        h, b = histogram(a, density=True)
+        assert_(np.issubdtype(h.dtype, np.floating))
+
+        h, b = histogram(a, weights=np.ones(10, int))
+        assert_(np.issubdtype(h.dtype, np.integer))
+
+        h, b = histogram(a, weights=np.ones(10, float))
+        assert_(np.issubdtype(h.dtype, np.floating))
+
+    def test_f32_rounding(self):
+        # gh-4799, check that the rounding of the edges works with float32
+        x = np.array([276.318359, -69.593948, 21.329449], dtype=np.float32)
+        y = np.array([5005.689453, 4481.327637, 6010.369629], dtype=np.float32)
+        counts_hist, xedges, yedges = np.histogram2d(x, y, bins=100)
+        assert_equal(counts_hist.sum(), 3.)
+
+    def test_bool_conversion(self):
+        # gh-12107
+        # Reference integer histogram
+        a = np.array([1, 1, 0], dtype=np.uint8)
+        int_hist, int_edges = np.histogram(a)
+
+        # Should raise an warning on booleans
+        # Ensure that the histograms are equivalent, need to suppress
+        # the warnings to get the actual outputs
+        with suppress_warnings() as sup:
+            rec = sup.record(RuntimeWarning, 'Converting input from .*')
+            hist, edges = np.histogram([True, True, False])
+            # A warning should be issued
+            assert_equal(len(rec), 1)
+            assert_array_equal(hist, int_hist)
+            assert_array_equal(edges, int_edges)
+
+    def test_weights(self):
+        v = np.random.rand(100)
+        w = np.ones(100) * 5
+        a, b = histogram(v)
+        na, nb = histogram(v, density=True)
+        wa, wb = histogram(v, weights=w)
+        nwa, nwb = histogram(v, weights=w, density=True)
+        assert_array_almost_equal(a * 5, wa)
+        assert_array_almost_equal(na, nwa)
+
+        # Check weights are properly applied.
+        v = np.linspace(0, 10, 10)
+        w = np.concatenate((np.zeros(5), np.ones(5)))
+        wa, wb = histogram(v, bins=np.arange(11), weights=w)
+        assert_array_almost_equal(wa, w)
+
+        # Check with integer weights
+        wa, wb = histogram([1, 2, 2, 4], bins=4, weights=[4, 3, 2, 1])
+        assert_array_equal(wa, [4, 5, 0, 1])
+        wa, wb = histogram(
+            [1, 2, 2, 4], bins=4, weights=[4, 3, 2, 1], density=True)
+        assert_array_almost_equal(wa, np.array([4, 5, 0, 1]) / 10. / 3. * 4)
+
+        # Check weights with non-uniform bin widths
+        a, b = histogram(
+            np.arange(9), [0, 1, 3, 6, 10],
+            weights=[2, 1, 1, 1, 1, 1, 1, 1, 1], density=True)
+        assert_almost_equal(a, [.2, .1, .1, .075])
+
+    def test_exotic_weights(self):
+
+        # Test the use of weights that are not integer or floats, but e.g.
+        # complex numbers or object types.
+
+        # Complex weights
+        values = np.array([1.3, 2.5, 2.3])
+        weights = np.array([1, -1, 2]) + 1j * np.array([2, 1, 2])
+
+        # Check with custom bins
+        wa, wb = histogram(values, bins=[0, 2, 3], weights=weights)
+        assert_array_almost_equal(wa, np.array([1, 1]) + 1j * np.array([2, 3]))
+
+        # Check with even bins
+        wa, wb = histogram(values, bins=2, range=[1, 3], weights=weights)
+        assert_array_almost_equal(wa, np.array([1, 1]) + 1j * np.array([2, 3]))
+
+        # Decimal weights
+        from decimal import Decimal
+        values = np.array([1.3, 2.5, 2.3])
+        weights = np.array([Decimal(1), Decimal(2), Decimal(3)])
+
+        # Check with custom bins
+        wa, wb = histogram(values, bins=[0, 2, 3], weights=weights)
+        assert_array_almost_equal(wa, [Decimal(1), Decimal(5)])
+
+        # Check with even bins
+        wa, wb = histogram(values, bins=2, range=[1, 3], weights=weights)
+        assert_array_almost_equal(wa, [Decimal(1), Decimal(5)])
+
+    def test_no_side_effects(self):
+        # This is a regression test that ensures that values passed to
+        # ``histogram`` are unchanged.
+        values = np.array([1.3, 2.5, 2.3])
+        np.histogram(values, range=[-10, 10], bins=100)
+        assert_array_almost_equal(values, [1.3, 2.5, 2.3])
+
+    def test_empty(self):
+        a, b = histogram([], bins=([0, 1]))
+        assert_array_equal(a, np.array([0]))
+        assert_array_equal(b, np.array([0, 1]))
+
+    def test_error_binnum_type (self):
+        # Tests if right Error is raised if bins argument is float
+        vals = np.linspace(0.0, 1.0, num=100)
+        histogram(vals, 5)
+        assert_raises(TypeError, histogram, vals, 2.4)
+
+    def test_finite_range(self):
+        # Normal ranges should be fine
+        vals = np.linspace(0.0, 1.0, num=100)
+        histogram(vals, range=[0.25,0.75])
+        assert_raises(ValueError, histogram, vals, range=[np.nan,0.75])
+        assert_raises(ValueError, histogram, vals, range=[0.25,np.inf])
+
+    def test_invalid_range(self):
+        # start of range must be < end of range
+        vals = np.linspace(0.0, 1.0, num=100)
+        with assert_raises_regex(ValueError, "max must be larger than"):
+            np.histogram(vals, range=[0.1, 0.01])
+
+    def test_bin_edge_cases(self):
+        # Ensure that floating-point computations correctly place edge cases.
+        arr = np.array([337, 404, 739, 806, 1007, 1811, 2012])
+        hist, edges = np.histogram(arr, bins=8296, range=(2, 2280))
+        mask = hist > 0
+        left_edges = edges[:-1][mask]
+        right_edges = edges[1:][mask]
+        for x, left, right in zip(arr, left_edges, right_edges):
+            assert_(x >= left)
+            assert_(x < right)
+
+    def test_last_bin_inclusive_range(self):
+        arr = np.array([0.,  0.,  0.,  1.,  2.,  3.,  3.,  4.,  5.])
+        hist, edges = np.histogram(arr, bins=30, range=(-0.5, 5))
+        assert_equal(hist[-1], 1)
+
+    def test_bin_array_dims(self):
+        # gracefully handle bins object > 1 dimension
+        vals = np.linspace(0.0, 1.0, num=100)
+        bins = np.array([[0, 0.5], [0.6, 1.0]])
+        with assert_raises_regex(ValueError, "must be 1d"):
+            np.histogram(vals, bins=bins)
+
+    def test_unsigned_monotonicity_check(self):
+        # Ensures ValueError is raised if bins not increasing monotonically
+        # when bins contain unsigned values (see #9222)
+        arr = np.array([2])
+        bins = np.array([1, 3, 1], dtype='uint64')
+        with assert_raises(ValueError):
+            hist, edges = np.histogram(arr, bins=bins)
+
+    def test_object_array_of_0d(self):
+        # gh-7864
+        assert_raises(ValueError,
+            histogram, [np.array(0.4) for i in range(10)] + [-np.inf])
+        assert_raises(ValueError,
+            histogram, [np.array(0.4) for i in range(10)] + [np.inf])
+
+        # these should not crash
+        np.histogram([np.array(0.5) for i in range(10)] + [.500000000000001])
+        np.histogram([np.array(0.5) for i in range(10)] + [.5])
+
+    def test_some_nan_values(self):
+        # gh-7503
+        one_nan = np.array([0, 1, np.nan])
+        all_nan = np.array([np.nan, np.nan])
+
+        # the internal comparisons with NaN give warnings
+        sup = suppress_warnings()
+        sup.filter(RuntimeWarning)
+        with sup:
+            # can't infer range with nan
+            assert_raises(ValueError, histogram, one_nan, bins='auto')
+            assert_raises(ValueError, histogram, all_nan, bins='auto')
+
+            # explicit range solves the problem
+            h, b = histogram(one_nan, bins='auto', range=(0, 1))
+            assert_equal(h.sum(), 2)  # nan is not counted
+            h, b = histogram(all_nan, bins='auto', range=(0, 1))
+            assert_equal(h.sum(), 0)  # nan is not counted
+
+            # as does an explicit set of bins
+            h, b = histogram(one_nan, bins=[0, 1])
+            assert_equal(h.sum(), 2)  # nan is not counted
+            h, b = histogram(all_nan, bins=[0, 1])
+            assert_equal(h.sum(), 0)  # nan is not counted
+
+    def test_datetime(self):
+        begin = np.datetime64('2000-01-01', 'D')
+        offsets = np.array([0, 0, 1, 1, 2, 3, 5, 10, 20])
+        bins = np.array([0, 2, 7, 20])
+        dates = begin + offsets
+        date_bins = begin + bins
+
+        td = np.dtype('timedelta64[D]')
+
+        # Results should be the same for integer offsets or datetime values.
+        # For now, only explicit bins are supported, since linspace does not
+        # work on datetimes or timedeltas
+        d_count, d_edge = histogram(dates, bins=date_bins)
+        t_count, t_edge = histogram(offsets.astype(td), bins=bins.astype(td))
+        i_count, i_edge = histogram(offsets, bins=bins)
+
+        assert_equal(d_count, i_count)
+        assert_equal(t_count, i_count)
+
+        assert_equal((d_edge - begin).astype(int), i_edge)
+        assert_equal(t_edge.astype(int), i_edge)
+
+        assert_equal(d_edge.dtype, dates.dtype)
+        assert_equal(t_edge.dtype, td)
+
+    def do_signed_overflow_bounds(self, dtype):
+        exponent = 8 * np.dtype(dtype).itemsize - 1
+        arr = np.array([-2**exponent + 4, 2**exponent - 4], dtype=dtype)
+        hist, e = histogram(arr, bins=2)
+        assert_equal(e, [-2**exponent + 4, 0, 2**exponent - 4])
+        assert_equal(hist, [1, 1])
+
+    def test_signed_overflow_bounds(self):
+        self.do_signed_overflow_bounds(np.byte)
+        self.do_signed_overflow_bounds(np.short)
+        self.do_signed_overflow_bounds(np.intc)
+        self.do_signed_overflow_bounds(np.int_)
+        self.do_signed_overflow_bounds(np.longlong)
+
+    def do_precision_lower_bound(self, float_small, float_large):
+        eps = np.finfo(float_large).eps
+
+        arr = np.array([1.0], float_small)
+        range = np.array([1.0 + eps, 2.0], float_large)
+
+        # test is looking for behavior when the bounds change between dtypes
+        if range.astype(float_small)[0] != 1:
+            return
+
+        # previously crashed
+        count, x_loc = np.histogram(arr, bins=1, range=range)
+        assert_equal(count, [1])
+
+        # gh-10322 means that the type comes from arr - this may change
+        assert_equal(x_loc.dtype, float_small)
+
+    def do_precision_upper_bound(self, float_small, float_large):
+        eps = np.finfo(float_large).eps
+
+        arr = np.array([1.0], float_small)
+        range = np.array([0.0, 1.0 - eps], float_large)
+
+        # test is looking for behavior when the bounds change between dtypes
+        if range.astype(float_small)[-1] != 1:
+            return
+
+        # previously crashed
+        count, x_loc = np.histogram(arr, bins=1, range=range)
+        assert_equal(count, [1])
+
+        # gh-10322 means that the type comes from arr - this may change
+        assert_equal(x_loc.dtype, float_small)
+
+    def do_precision(self, float_small, float_large):
+        self.do_precision_lower_bound(float_small, float_large)
+        self.do_precision_upper_bound(float_small, float_large)
+
+    def test_precision(self):
+        # not looping results in a useful stack trace upon failure
+        self.do_precision(np.half, np.single)
+        self.do_precision(np.half, np.double)
+        self.do_precision(np.half, np.longdouble)
+        self.do_precision(np.single, np.double)
+        self.do_precision(np.single, np.longdouble)
+        self.do_precision(np.double, np.longdouble)
+
+    def test_histogram_bin_edges(self):
+        hist, e = histogram([1, 2, 3, 4], [1, 2])
+        edges = histogram_bin_edges([1, 2, 3, 4], [1, 2])
+        assert_array_equal(edges, e)
+
+        arr = np.array([0.,  0.,  0.,  1.,  2.,  3.,  3.,  4.,  5.])
+        hist, e = histogram(arr, bins=30, range=(-0.5, 5))
+        edges = histogram_bin_edges(arr, bins=30, range=(-0.5, 5))
+        assert_array_equal(edges, e)
+
+        hist, e = histogram(arr, bins='auto', range=(0, 1))
+        edges = histogram_bin_edges(arr, bins='auto', range=(0, 1))
+        assert_array_equal(edges, e)
+
+
+class TestHistogramOptimBinNums:
+    """
+    Provide test coverage when using provided estimators for optimal number of
+    bins
+    """
+
+    def test_empty(self):
+        estimator_list = ['fd', 'scott', 'rice', 'sturges',
+                          'doane', 'sqrt', 'auto', 'stone']
+        # check it can deal with empty data
+        for estimator in estimator_list:
+            a, b = histogram([], bins=estimator)
+            assert_array_equal(a, np.array([0]))
+            assert_array_equal(b, np.array([0, 1]))
+
+    def test_simple(self):
+        """
+        Straightforward testing with a mixture of linspace data (for
+        consistency). All test values have been precomputed and the values
+        shouldn't change
+        """
+        # Some basic sanity checking, with some fixed data.
+        # Checking for the correct number of bins
+        basic_test = {50:   {'fd': 4,  'scott': 4,  'rice': 8,  'sturges': 7,
+                             'doane': 8, 'sqrt': 8, 'auto': 7, 'stone': 2},
+                      500:  {'fd': 8,  'scott': 8,  'rice': 16, 'sturges': 10,
+                             'doane': 12, 'sqrt': 23, 'auto': 10, 'stone': 9},
+                      5000: {'fd': 17, 'scott': 17, 'rice': 35, 'sturges': 14,
+                             'doane': 17, 'sqrt': 71, 'auto': 17, 'stone': 20}}
+
+        for testlen, expectedResults in basic_test.items():
+            # Create some sort of non uniform data to test with
+            # (2 peak uniform mixture)
+            x1 = np.linspace(-10, -1, testlen // 5 * 2)
+            x2 = np.linspace(1, 10, testlen // 5 * 3)
+            x = np.concatenate((x1, x2))
+            for estimator, numbins in expectedResults.items():
+                a, b = np.histogram(x, estimator)
+                assert_equal(len(a), numbins, err_msg="For the {0} estimator "
+                             "with datasize of {1}".format(estimator, testlen))
+
+    def test_small(self):
+        """
+        Smaller datasets have the potential to cause issues with the data
+        adaptive methods, especially the FD method. All bin numbers have been
+        precalculated.
+        """
+        small_dat = {1: {'fd': 1, 'scott': 1, 'rice': 1, 'sturges': 1,
+                         'doane': 1, 'sqrt': 1, 'stone': 1},
+                     2: {'fd': 2, 'scott': 1, 'rice': 3, 'sturges': 2,
+                         'doane': 1, 'sqrt': 2, 'stone': 1},
+                     3: {'fd': 2, 'scott': 2, 'rice': 3, 'sturges': 3,
+                         'doane': 3, 'sqrt': 2, 'stone': 1}}
+
+        for testlen, expectedResults in small_dat.items():
+            testdat = np.arange(testlen)
+            for estimator, expbins in expectedResults.items():
+                a, b = np.histogram(testdat, estimator)
+                assert_equal(len(a), expbins, err_msg="For the {0} estimator "
+                             "with datasize of {1}".format(estimator, testlen))
+
+    def test_incorrect_methods(self):
+        """
+        Check a Value Error is thrown when an unknown string is passed in
+        """
+        check_list = ['mad', 'freeman', 'histograms', 'IQR']
+        for estimator in check_list:
+            assert_raises(ValueError, histogram, [1, 2, 3], estimator)
+
+    def test_novariance(self):
+        """
+        Check that methods handle no variance in data
+        Primarily for Scott and FD as the SD and IQR are both 0 in this case
+        """
+        novar_dataset = np.ones(100)
+        novar_resultdict = {'fd': 1, 'scott': 1, 'rice': 1, 'sturges': 1,
+                            'doane': 1, 'sqrt': 1, 'auto': 1, 'stone': 1}
+
+        for estimator, numbins in novar_resultdict.items():
+            a, b = np.histogram(novar_dataset, estimator)
+            assert_equal(len(a), numbins, err_msg="{0} estimator, "
+                         "No Variance test".format(estimator))
+
+    def test_limited_variance(self):
+        """
+        Check when IQR is 0, but variance exists, we return the sturges value
+        and not the fd value.
+        """
+        lim_var_data = np.ones(1000)
+        lim_var_data[:3] = 0
+        lim_var_data[-4:] = 100
+
+        edges_auto = histogram_bin_edges(lim_var_data, 'auto')
+        assert_equal(edges_auto, np.linspace(0, 100, 12))
+
+        edges_fd = histogram_bin_edges(lim_var_data, 'fd')
+        assert_equal(edges_fd, np.array([0, 100]))
+
+        edges_sturges = histogram_bin_edges(lim_var_data, 'sturges')
+        assert_equal(edges_sturges, np.linspace(0, 100, 12))
+
+    def test_outlier(self):
+        """
+        Check the FD, Scott and Doane with outliers.
+
+        The FD estimates a smaller binwidth since it's less affected by
+        outliers. Since the range is so (artificially) large, this means more
+        bins, most of which will be empty, but the data of interest usually is
+        unaffected. The Scott estimator is more affected and returns fewer bins,
+        despite most of the variance being in one area of the data. The Doane
+        estimator lies somewhere between the other two.
+        """
+        xcenter = np.linspace(-10, 10, 50)
+        outlier_dataset = np.hstack((np.linspace(-110, -100, 5), xcenter))
+
+        outlier_resultdict = {'fd': 21, 'scott': 5, 'doane': 11, 'stone': 6}
+
+        for estimator, numbins in outlier_resultdict.items():
+            a, b = np.histogram(outlier_dataset, estimator)
+            assert_equal(len(a), numbins)
+
+    def test_scott_vs_stone(self):
+        """Verify that Scott's rule and Stone's rule converges for normally distributed data"""
+
+        def nbins_ratio(seed, size):
+            rng = np.random.RandomState(seed)
+            x = rng.normal(loc=0, scale=2, size=size)
+            a, b = len(np.histogram(x, 'stone')[0]), len(np.histogram(x, 'scott')[0])
+            return a / (a + b)
+
+        ll = [[nbins_ratio(seed, size) for size in np.geomspace(start=10, stop=100, num=4).round().astype(int)]
+              for seed in range(10)]
+
+        # the average difference between the two methods decreases as the dataset size increases.
+        avg = abs(np.mean(ll, axis=0) - 0.5)
+        assert_almost_equal(avg, [0.15, 0.09, 0.08, 0.03], decimal=2)
+
+    def test_simple_range(self):
+        """
+        Straightforward testing with a mixture of linspace data (for
+        consistency). Adding in a 3rd mixture that will then be
+        completely ignored. All test values have been precomputed and
+        the shouldn't change.
+        """
+        # some basic sanity checking, with some fixed data.
+        # Checking for the correct number of bins
+        basic_test = {
+                      50:   {'fd': 8,  'scott': 8,  'rice': 15,
+                             'sturges': 14, 'auto': 14, 'stone': 8},
+                      500:  {'fd': 15, 'scott': 16, 'rice': 32,
+                             'sturges': 20, 'auto': 20, 'stone': 80},
+                      5000: {'fd': 33, 'scott': 33, 'rice': 69,
+                             'sturges': 27, 'auto': 33, 'stone': 80}
+                     }
+
+        for testlen, expectedResults in basic_test.items():
+            # create some sort of non uniform data to test with
+            # (3 peak uniform mixture)
+            x1 = np.linspace(-10, -1, testlen // 5 * 2)
+            x2 = np.linspace(1, 10, testlen // 5 * 3)
+            x3 = np.linspace(-100, -50, testlen)
+            x = np.hstack((x1, x2, x3))
+            for estimator, numbins in expectedResults.items():
+                a, b = np.histogram(x, estimator, range = (-20, 20))
+                msg = "For the {0} estimator".format(estimator)
+                msg += " with datasize of {0}".format(testlen)
+                assert_equal(len(a), numbins, err_msg=msg)
+
+    @pytest.mark.parametrize("bins", ['auto', 'fd', 'doane', 'scott',
+                                      'stone', 'rice', 'sturges'])
+    def test_signed_integer_data(self, bins):
+        # Regression test for gh-14379.
+        a = np.array([-2, 0, 127], dtype=np.int8)
+        hist, edges = np.histogram(a, bins=bins)
+        hist32, edges32 = np.histogram(a.astype(np.int32), bins=bins)
+        assert_array_equal(hist, hist32)
+        assert_array_equal(edges, edges32)
+
+    def test_simple_weighted(self):
+        """
+        Check that weighted data raises a TypeError
+        """
+        estimator_list = ['fd', 'scott', 'rice', 'sturges', 'auto']
+        for estimator in estimator_list:
+            assert_raises(TypeError, histogram, [1, 2, 3],
+                          estimator, weights=[1, 2, 3])
+
+
+class TestHistogramdd:
+
+    def test_simple(self):
+        x = np.array([[-.5, .5, 1.5], [-.5, 1.5, 2.5], [-.5, 2.5, .5],
+                      [.5,  .5, 1.5], [.5,  1.5, 2.5], [.5,  2.5, 2.5]])
+        H, edges = histogramdd(x, (2, 3, 3),
+                               range=[[-1, 1], [0, 3], [0, 3]])
+        answer = np.array([[[0, 1, 0], [0, 0, 1], [1, 0, 0]],
+                           [[0, 1, 0], [0, 0, 1], [0, 0, 1]]])
+        assert_array_equal(H, answer)
+
+        # Check normalization
+        ed = [[-2, 0, 2], [0, 1, 2, 3], [0, 1, 2, 3]]
+        H, edges = histogramdd(x, bins=ed, density=True)
+        assert_(np.all(H == answer / 12.))
+
+        # Check that H has the correct shape.
+        H, edges = histogramdd(x, (2, 3, 4),
+                               range=[[-1, 1], [0, 3], [0, 4]],
+                               density=True)
+        answer = np.array([[[0, 1, 0, 0], [0, 0, 1, 0], [1, 0, 0, 0]],
+                           [[0, 1, 0, 0], [0, 0, 1, 0], [0, 0, 1, 0]]])
+        assert_array_almost_equal(H, answer / 6., 4)
+        # Check that a sequence of arrays is accepted and H has the correct
+        # shape.
+        z = [np.squeeze(y) for y in np.split(x, 3, axis=1)]
+        H, edges = histogramdd(
+            z, bins=(4, 3, 2), range=[[-2, 2], [0, 3], [0, 2]])
+        answer = np.array([[[0, 0], [0, 0], [0, 0]],
+                           [[0, 1], [0, 0], [1, 0]],
+                           [[0, 1], [0, 0], [0, 0]],
+                           [[0, 0], [0, 0], [0, 0]]])
+        assert_array_equal(H, answer)
+
+        Z = np.zeros((5, 5, 5))
+        Z[list(range(5)), list(range(5)), list(range(5))] = 1.
+        H, edges = histogramdd([np.arange(5), np.arange(5), np.arange(5)], 5)
+        assert_array_equal(H, Z)
+
+    def test_shape_3d(self):
+        # All possible permutations for bins of different lengths in 3D.
+        bins = ((5, 4, 6), (6, 4, 5), (5, 6, 4), (4, 6, 5), (6, 5, 4),
+                (4, 5, 6))
+        r = np.random.rand(10, 3)
+        for b in bins:
+            H, edges = histogramdd(r, b)
+            assert_(H.shape == b)
+
+    def test_shape_4d(self):
+        # All possible permutations for bins of different lengths in 4D.
+        bins = ((7, 4, 5, 6), (4, 5, 7, 6), (5, 6, 4, 7), (7, 6, 5, 4),
+                (5, 7, 6, 4), (4, 6, 7, 5), (6, 5, 7, 4), (7, 5, 4, 6),
+                (7, 4, 6, 5), (6, 4, 7, 5), (6, 7, 5, 4), (4, 6, 5, 7),
+                (4, 7, 5, 6), (5, 4, 6, 7), (5, 7, 4, 6), (6, 7, 4, 5),
+                (6, 5, 4, 7), (4, 7, 6, 5), (4, 5, 6, 7), (7, 6, 4, 5),
+                (5, 4, 7, 6), (5, 6, 7, 4), (6, 4, 5, 7), (7, 5, 6, 4))
+
+        r = np.random.rand(10, 4)
+        for b in bins:
+            H, edges = histogramdd(r, b)
+            assert_(H.shape == b)
+
+    def test_weights(self):
+        v = np.random.rand(100, 2)
+        hist, edges = histogramdd(v)
+        n_hist, edges = histogramdd(v, density=True)
+        w_hist, edges = histogramdd(v, weights=np.ones(100))
+        assert_array_equal(w_hist, hist)
+        w_hist, edges = histogramdd(v, weights=np.ones(100) * 2, density=True)
+        assert_array_equal(w_hist, n_hist)
+        w_hist, edges = histogramdd(v, weights=np.ones(100, int) * 2)
+        assert_array_equal(w_hist, 2 * hist)
+
+    def test_identical_samples(self):
+        x = np.zeros((10, 2), int)
+        hist, edges = histogramdd(x, bins=2)
+        assert_array_equal(edges[0], np.array([-0.5, 0., 0.5]))
+
+    def test_empty(self):
+        a, b = histogramdd([[], []], bins=([0, 1], [0, 1]))
+        assert_array_max_ulp(a, np.array([[0.]]))
+        a, b = np.histogramdd([[], [], []], bins=2)
+        assert_array_max_ulp(a, np.zeros((2, 2, 2)))
+
+    def test_bins_errors(self):
+        # There are two ways to specify bins. Check for the right errors
+        # when mixing those.
+        x = np.arange(8).reshape(2, 4)
+        assert_raises(ValueError, np.histogramdd, x, bins=[-1, 2, 4, 5])
+        assert_raises(ValueError, np.histogramdd, x, bins=[1, 0.99, 1, 1])
+        assert_raises(
+            ValueError, np.histogramdd, x, bins=[1, 1, 1, [1, 2, 3, -3]])
+        assert_(np.histogramdd(x, bins=[1, 1, 1, [1, 2, 3, 4]]))
+
+    def test_inf_edges(self):
+        # Test using +/-inf bin edges works. See #1788.
+        with np.errstate(invalid='ignore'):
+            x = np.arange(6).reshape(3, 2)
+            expected = np.array([[1, 0], [0, 1], [0, 1]])
+            h, e = np.histogramdd(x, bins=[3, [-np.inf, 2, 10]])
+            assert_allclose(h, expected)
+            h, e = np.histogramdd(x, bins=[3, np.array([-1, 2, np.inf])])
+            assert_allclose(h, expected)
+            h, e = np.histogramdd(x, bins=[3, [-np.inf, 3, np.inf]])
+            assert_allclose(h, expected)
+
+    def test_rightmost_binedge(self):
+        # Test event very close to rightmost binedge. See Github issue #4266
+        x = [0.9999999995]
+        bins = [[0., 0.5, 1.0]]
+        hist, _ = histogramdd(x, bins=bins)
+        assert_(hist[0] == 0.0)
+        assert_(hist[1] == 1.)
+        x = [1.0]
+        bins = [[0., 0.5, 1.0]]
+        hist, _ = histogramdd(x, bins=bins)
+        assert_(hist[0] == 0.0)
+        assert_(hist[1] == 1.)
+        x = [1.0000000001]
+        bins = [[0., 0.5, 1.0]]
+        hist, _ = histogramdd(x, bins=bins)
+        assert_(hist[0] == 0.0)
+        assert_(hist[1] == 0.0)
+        x = [1.0001]
+        bins = [[0., 0.5, 1.0]]
+        hist, _ = histogramdd(x, bins=bins)
+        assert_(hist[0] == 0.0)
+        assert_(hist[1] == 0.0)
+
+    def test_finite_range(self):
+        vals = np.random.random((100, 3))
+        histogramdd(vals, range=[[0.0, 1.0], [0.25, 0.75], [0.25, 0.5]])
+        assert_raises(ValueError, histogramdd, vals,
+                      range=[[0.0, 1.0], [0.25, 0.75], [0.25, np.inf]])
+        assert_raises(ValueError, histogramdd, vals,
+                      range=[[0.0, 1.0], [np.nan, 0.75], [0.25, 0.5]])
+
+    def test_equal_edges(self):
+        """ Test that adjacent entries in an edge array can be equal """
+        x = np.array([0, 1, 2])
+        y = np.array([0, 1, 2])
+        x_edges = np.array([0, 2, 2])
+        y_edges = 1
+        hist, edges = histogramdd((x, y), bins=(x_edges, y_edges))
+
+        hist_expected = np.array([
+            [2.],
+            [1.],  # x == 2 falls in the final bin
+        ])
+        assert_equal(hist, hist_expected)
+
+    def test_edge_dtype(self):
+        """ Test that if an edge array is input, its type is preserved """
+        x = np.array([0, 10, 20])
+        y = x / 10
+        x_edges = np.array([0, 5, 15, 20])
+        y_edges = x_edges / 10
+        hist, edges = histogramdd((x, y), bins=(x_edges, y_edges))
+
+        assert_equal(edges[0].dtype, x_edges.dtype)
+        assert_equal(edges[1].dtype, y_edges.dtype)
+
+    def test_large_integers(self):
+        big = 2**60  # Too large to represent with a full precision float
+
+        x = np.array([0], np.int64)
+        x_edges = np.array([-1, +1], np.int64)
+        y = big + x
+        y_edges = big + x_edges
+
+        hist, edges = histogramdd((x, y), bins=(x_edges, y_edges))
+
+        assert_equal(hist[0, 0], 1)
+
+    def test_density_non_uniform_2d(self):
+        # Defines the following grid:
+        #
+        #    0 2     8
+        #   0+-+-----+
+        #    + |     +
+        #    + |     +
+        #   6+-+-----+
+        #   8+-+-----+
+        x_edges = np.array([0, 2, 8])
+        y_edges = np.array([0, 6, 8])
+        relative_areas = np.array([
+            [3, 9],
+            [1, 3]])
+
+        # ensure the number of points in each region is proportional to its area
+        x = np.array([1] + [1]*3 + [7]*3 + [7]*9)
+        y = np.array([7] + [1]*3 + [7]*3 + [1]*9)
+
+        # sanity check that the above worked as intended
+        hist, edges = histogramdd((y, x), bins=(y_edges, x_edges))
+        assert_equal(hist, relative_areas)
+
+        # resulting histogram should be uniform, since counts and areas are proportional
+        hist, edges = histogramdd((y, x), bins=(y_edges, x_edges), density=True)
+        assert_equal(hist, 1 / (8*8))
+
+    def test_density_non_uniform_1d(self):
+        # compare to histogram to show the results are the same
+        v = np.arange(10)
+        bins = np.array([0, 1, 3, 6, 10])
+        hist, edges = histogram(v, bins, density=True)
+        hist_dd, edges_dd = histogramdd((v,), (bins,), density=True)
+        assert_equal(hist, hist_dd)
+        assert_equal(edges, edges_dd[0])
+
+    def test_density_via_normed(self):
+        # normed should simply alias to density argument
+        v = np.arange(10)
+        bins = np.array([0, 1, 3, 6, 10])
+        hist, edges = histogram(v, bins, density=True)
+        hist_dd, edges_dd = histogramdd((v,), (bins,), normed=True)
+        assert_equal(hist, hist_dd)
+        assert_equal(edges, edges_dd[0])
+
+    def test_density_normed_redundancy(self):
+        v = np.arange(10)
+        bins = np.array([0, 1, 3, 6, 10])
+        with assert_raises_regex(TypeError, "Cannot specify both"):
+            hist_dd, edges_dd = histogramdd((v,), (bins,),
+                                            density=True,
+                                            normed=True)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_index_tricks.py b/venv/Lib/site-packages/numpy/lib/tests/test_index_tricks.py
new file mode 100644
index 000000000..905165a99
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_index_tricks.py
@@ -0,0 +1,498 @@
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_almost_equal,
+    assert_array_almost_equal, assert_raises, assert_raises_regex,
+    assert_warns
+    )
+from numpy.lib.index_tricks import (
+    mgrid, ogrid, ndenumerate, fill_diagonal, diag_indices, diag_indices_from,
+    index_exp, ndindex, r_, s_, ix_
+    )
+
+
+class TestRavelUnravelIndex:
+    def test_basic(self):
+        assert_equal(np.unravel_index(2, (2, 2)), (1, 0))
+
+        # test backwards compatibility with older dims
+        # keyword argument; see Issue #10586
+        with assert_warns(DeprecationWarning):
+            # we should achieve the correct result
+            # AND raise the appropriate warning
+            # when using older "dims" kw argument
+            assert_equal(np.unravel_index(indices=2,
+                                          dims=(2, 2)),
+                                          (1, 0))
+
+        # test that new shape argument works properly
+        assert_equal(np.unravel_index(indices=2,
+                                      shape=(2, 2)),
+                                      (1, 0))
+
+        # test that an invalid second keyword argument
+        # is properly handled
+        with assert_raises(TypeError):
+            np.unravel_index(indices=2, hape=(2, 2))
+
+        with assert_raises(TypeError):
+            np.unravel_index(2, hape=(2, 2))
+
+        with assert_raises(TypeError):
+            np.unravel_index(254, ims=(17, 94))
+
+        assert_equal(np.ravel_multi_index((1, 0), (2, 2)), 2)
+        assert_equal(np.unravel_index(254, (17, 94)), (2, 66))
+        assert_equal(np.ravel_multi_index((2, 66), (17, 94)), 254)
+        assert_raises(ValueError, np.unravel_index, -1, (2, 2))
+        assert_raises(TypeError, np.unravel_index, 0.5, (2, 2))
+        assert_raises(ValueError, np.unravel_index, 4, (2, 2))
+        assert_raises(ValueError, np.ravel_multi_index, (-3, 1), (2, 2))
+        assert_raises(ValueError, np.ravel_multi_index, (2, 1), (2, 2))
+        assert_raises(ValueError, np.ravel_multi_index, (0, -3), (2, 2))
+        assert_raises(ValueError, np.ravel_multi_index, (0, 2), (2, 2))
+        assert_raises(TypeError, np.ravel_multi_index, (0.1, 0.), (2, 2))
+
+        assert_equal(np.unravel_index((2*3 + 1)*6 + 4, (4, 3, 6)), [2, 1, 4])
+        assert_equal(
+            np.ravel_multi_index([2, 1, 4], (4, 3, 6)), (2*3 + 1)*6 + 4)
+
+        arr = np.array([[3, 6, 6], [4, 5, 1]])
+        assert_equal(np.ravel_multi_index(arr, (7, 6)), [22, 41, 37])
+        assert_equal(
+            np.ravel_multi_index(arr, (7, 6), order='F'), [31, 41, 13])
+        assert_equal(
+            np.ravel_multi_index(arr, (4, 6), mode='clip'), [22, 23, 19])
+        assert_equal(np.ravel_multi_index(arr, (4, 4), mode=('clip', 'wrap')),
+                     [12, 13, 13])
+        assert_equal(np.ravel_multi_index((3, 1, 4, 1), (6, 7, 8, 9)), 1621)
+
+        assert_equal(np.unravel_index(np.array([22, 41, 37]), (7, 6)),
+                     [[3, 6, 6], [4, 5, 1]])
+        assert_equal(
+            np.unravel_index(np.array([31, 41, 13]), (7, 6), order='F'),
+            [[3, 6, 6], [4, 5, 1]])
+        assert_equal(np.unravel_index(1621, (6, 7, 8, 9)), [3, 1, 4, 1])
+
+    def test_empty_indices(self):
+        msg1 = 'indices must be integral: the provided empty sequence was'
+        msg2 = 'only int indices permitted'
+        assert_raises_regex(TypeError, msg1, np.unravel_index, [], (10, 3, 5))
+        assert_raises_regex(TypeError, msg1, np.unravel_index, (), (10, 3, 5))
+        assert_raises_regex(TypeError, msg2, np.unravel_index, np.array([]),
+                            (10, 3, 5))
+        assert_equal(np.unravel_index(np.array([],dtype=int), (10, 3, 5)),
+                     [[], [], []])
+        assert_raises_regex(TypeError, msg1, np.ravel_multi_index, ([], []),
+                            (10, 3))
+        assert_raises_regex(TypeError, msg1, np.ravel_multi_index, ([], ['abc']),
+                            (10, 3))
+        assert_raises_regex(TypeError, msg2, np.ravel_multi_index,
+                    (np.array([]), np.array([])), (5, 3))
+        assert_equal(np.ravel_multi_index(
+                (np.array([], dtype=int), np.array([], dtype=int)), (5, 3)), [])
+        assert_equal(np.ravel_multi_index(np.array([[], []], dtype=int),
+                     (5, 3)), [])
+
+    def test_big_indices(self):
+        # ravel_multi_index for big indices (issue #7546)
+        if np.intp == np.int64:
+            arr = ([1, 29], [3, 5], [3, 117], [19, 2],
+                   [2379, 1284], [2, 2], [0, 1])
+            assert_equal(
+                np.ravel_multi_index(arr, (41, 7, 120, 36, 2706, 8, 6)),
+                [5627771580, 117259570957])
+
+        # test unravel_index for big indices (issue #9538)
+        assert_raises(ValueError, np.unravel_index, 1, (2**32-1, 2**31+1))
+
+        # test overflow checking for too big array (issue #7546)
+        dummy_arr = ([0],[0])
+        half_max = np.iinfo(np.intp).max // 2
+        assert_equal(
+            np.ravel_multi_index(dummy_arr, (half_max, 2)), [0])
+        assert_raises(ValueError,
+            np.ravel_multi_index, dummy_arr, (half_max+1, 2))
+        assert_equal(
+            np.ravel_multi_index(dummy_arr, (half_max, 2), order='F'), [0])
+        assert_raises(ValueError,
+            np.ravel_multi_index, dummy_arr, (half_max+1, 2), order='F')
+
+    def test_dtypes(self):
+        # Test with different data types
+        for dtype in [np.int16, np.uint16, np.int32,
+                      np.uint32, np.int64, np.uint64]:
+            coords = np.array(
+                [[1, 0, 1, 2, 3, 4], [1, 6, 1, 3, 2, 0]], dtype=dtype)
+            shape = (5, 8)
+            uncoords = 8*coords[0]+coords[1]
+            assert_equal(np.ravel_multi_index(coords, shape), uncoords)
+            assert_equal(coords, np.unravel_index(uncoords, shape))
+            uncoords = coords[0]+5*coords[1]
+            assert_equal(
+                np.ravel_multi_index(coords, shape, order='F'), uncoords)
+            assert_equal(coords, np.unravel_index(uncoords, shape, order='F'))
+
+            coords = np.array(
+                [[1, 0, 1, 2, 3, 4], [1, 6, 1, 3, 2, 0], [1, 3, 1, 0, 9, 5]],
+                dtype=dtype)
+            shape = (5, 8, 10)
+            uncoords = 10*(8*coords[0]+coords[1])+coords[2]
+            assert_equal(np.ravel_multi_index(coords, shape), uncoords)
+            assert_equal(coords, np.unravel_index(uncoords, shape))
+            uncoords = coords[0]+5*(coords[1]+8*coords[2])
+            assert_equal(
+                np.ravel_multi_index(coords, shape, order='F'), uncoords)
+            assert_equal(coords, np.unravel_index(uncoords, shape, order='F'))
+
+    def test_clipmodes(self):
+        # Test clipmodes
+        assert_equal(
+            np.ravel_multi_index([5, 1, -1, 2], (4, 3, 7, 12), mode='wrap'),
+            np.ravel_multi_index([1, 1, 6, 2], (4, 3, 7, 12)))
+        assert_equal(np.ravel_multi_index([5, 1, -1, 2], (4, 3, 7, 12),
+                                          mode=(
+                                              'wrap', 'raise', 'clip', 'raise')),
+                     np.ravel_multi_index([1, 1, 0, 2], (4, 3, 7, 12)))
+        assert_raises(
+            ValueError, np.ravel_multi_index, [5, 1, -1, 2], (4, 3, 7, 12))
+
+    def test_writeability(self):
+        # See gh-7269
+        x, y = np.unravel_index([1, 2, 3], (4, 5))
+        assert_(x.flags.writeable)
+        assert_(y.flags.writeable)
+
+    def test_0d(self):
+        # gh-580
+        x = np.unravel_index(0, ())
+        assert_equal(x, ())
+
+        assert_raises_regex(ValueError, "0d array", np.unravel_index, [0], ())
+        assert_raises_regex(
+            ValueError, "out of bounds", np.unravel_index, [1], ())
+
+    @pytest.mark.parametrize("mode", ["clip", "wrap", "raise"])
+    def test_empty_array_ravel(self, mode):
+        res = np.ravel_multi_index(
+                    np.zeros((3, 0), dtype=np.intp), (2, 1, 0), mode=mode)
+        assert(res.shape == (0,))
+
+        with assert_raises(ValueError):
+            np.ravel_multi_index(
+                    np.zeros((3, 1), dtype=np.intp), (2, 1, 0), mode=mode)
+
+    def test_empty_array_unravel(self):
+        res = np.unravel_index(np.zeros(0, dtype=np.intp), (2, 1, 0))
+        # res is a tuple of three empty arrays
+        assert(len(res) == 3)
+        assert(all(a.shape == (0,) for a in res))
+
+        with assert_raises(ValueError):
+            np.unravel_index([1], (2, 1, 0))
+
+class TestGrid:
+    def test_basic(self):
+        a = mgrid[-1:1:10j]
+        b = mgrid[-1:1:0.1]
+        assert_(a.shape == (10,))
+        assert_(b.shape == (20,))
+        assert_(a[0] == -1)
+        assert_almost_equal(a[-1], 1)
+        assert_(b[0] == -1)
+        assert_almost_equal(b[1]-b[0], 0.1, 11)
+        assert_almost_equal(b[-1], b[0]+19*0.1, 11)
+        assert_almost_equal(a[1]-a[0], 2.0/9.0, 11)
+
+    def test_linspace_equivalence(self):
+        y, st = np.linspace(2, 10, retstep=True)
+        assert_almost_equal(st, 8/49.0)
+        assert_array_almost_equal(y, mgrid[2:10:50j], 13)
+
+    def test_nd(self):
+        c = mgrid[-1:1:10j, -2:2:10j]
+        d = mgrid[-1:1:0.1, -2:2:0.2]
+        assert_(c.shape == (2, 10, 10))
+        assert_(d.shape == (2, 20, 20))
+        assert_array_equal(c[0][0, :], -np.ones(10, 'd'))
+        assert_array_equal(c[1][:, 0], -2*np.ones(10, 'd'))
+        assert_array_almost_equal(c[0][-1, :], np.ones(10, 'd'), 11)
+        assert_array_almost_equal(c[1][:, -1], 2*np.ones(10, 'd'), 11)
+        assert_array_almost_equal(d[0, 1, :] - d[0, 0, :],
+                                  0.1*np.ones(20, 'd'), 11)
+        assert_array_almost_equal(d[1, :, 1] - d[1, :, 0],
+                                  0.2*np.ones(20, 'd'), 11)
+
+    def test_sparse(self):
+        grid_full   = mgrid[-1:1:10j, -2:2:10j]
+        grid_sparse = ogrid[-1:1:10j, -2:2:10j]
+
+        # sparse grids can be made dense by broadcasting
+        grid_broadcast = np.broadcast_arrays(*grid_sparse)
+        for f, b in zip(grid_full, grid_broadcast):
+            assert_equal(f, b)
+
+    @pytest.mark.parametrize("start, stop, step, expected", [
+        (None, 10, 10j, (200, 10)),
+        (-10, 20, None, (1800, 30)),
+        ])
+    def test_mgrid_size_none_handling(self, start, stop, step, expected):
+        # regression test None value handling for
+        # start and step values used by mgrid;
+        # internally, this aims to cover previously
+        # unexplored code paths in nd_grid()
+        grid = mgrid[start:stop:step, start:stop:step]
+        # need a smaller grid to explore one of the
+        # untested code paths
+        grid_small = mgrid[start:stop:step]
+        assert_equal(grid.size, expected[0])
+        assert_equal(grid_small.size, expected[1])
+
+
+class TestConcatenator:
+    def test_1d(self):
+        assert_array_equal(r_[1, 2, 3, 4, 5, 6], np.array([1, 2, 3, 4, 5, 6]))
+        b = np.ones(5)
+        c = r_[b, 0, 0, b]
+        assert_array_equal(c, [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1])
+
+    def test_mixed_type(self):
+        g = r_[10.1, 1:10]
+        assert_(g.dtype == 'f8')
+
+    def test_more_mixed_type(self):
+        g = r_[-10.1, np.array([1]), np.array([2, 3, 4]), 10.0]
+        assert_(g.dtype == 'f8')
+
+    def test_complex_step(self):
+        # Regression test for #12262
+        g = r_[0:36:100j]
+        assert_(g.shape == (100,))
+
+    def test_2d(self):
+        b = np.random.rand(5, 5)
+        c = np.random.rand(5, 5)
+        d = r_['1', b, c]  # append columns
+        assert_(d.shape == (5, 10))
+        assert_array_equal(d[:, :5], b)
+        assert_array_equal(d[:, 5:], c)
+        d = r_[b, c]
+        assert_(d.shape == (10, 5))
+        assert_array_equal(d[:5, :], b)
+        assert_array_equal(d[5:, :], c)
+
+    def test_0d(self):
+        assert_equal(r_[0, np.array(1), 2], [0, 1, 2])
+        assert_equal(r_[[0, 1, 2], np.array(3)], [0, 1, 2, 3])
+        assert_equal(r_[np.array(0), [1, 2, 3]], [0, 1, 2, 3])
+
+
+class TestNdenumerate:
+    def test_basic(self):
+        a = np.array([[1, 2], [3, 4]])
+        assert_equal(list(ndenumerate(a)),
+                     [((0, 0), 1), ((0, 1), 2), ((1, 0), 3), ((1, 1), 4)])
+
+
+class TestIndexExpression:
+    def test_regression_1(self):
+        # ticket #1196
+        a = np.arange(2)
+        assert_equal(a[:-1], a[s_[:-1]])
+        assert_equal(a[:-1], a[index_exp[:-1]])
+
+    def test_simple_1(self):
+        a = np.random.rand(4, 5, 6)
+
+        assert_equal(a[:, :3, [1, 2]], a[index_exp[:, :3, [1, 2]]])
+        assert_equal(a[:, :3, [1, 2]], a[s_[:, :3, [1, 2]]])
+
+
+class TestIx_:
+    def test_regression_1(self):
+        # Test empty untyped inputs create outputs of indexing type, gh-5804
+        a, = np.ix_(range(0))
+        assert_equal(a.dtype, np.intp)
+
+        a, = np.ix_([])
+        assert_equal(a.dtype, np.intp)
+
+        # but if the type is specified, don't change it
+        a, = np.ix_(np.array([], dtype=np.float32))
+        assert_equal(a.dtype, np.float32)
+
+    def test_shape_and_dtype(self):
+        sizes = (4, 5, 3, 2)
+        # Test both lists and arrays
+        for func in (range, np.arange):
+            arrays = np.ix_(*[func(sz) for sz in sizes])
+            for k, (a, sz) in enumerate(zip(arrays, sizes)):
+                assert_equal(a.shape[k], sz)
+                assert_(all(sh == 1 for j, sh in enumerate(a.shape) if j != k))
+                assert_(np.issubdtype(a.dtype, np.integer))
+
+    def test_bool(self):
+        bool_a = [True, False, True, True]
+        int_a, = np.nonzero(bool_a)
+        assert_equal(np.ix_(bool_a)[0], int_a)
+
+    def test_1d_only(self):
+        idx2d = [[1, 2, 3], [4, 5, 6]]
+        assert_raises(ValueError, np.ix_, idx2d)
+
+    def test_repeated_input(self):
+        length_of_vector = 5
+        x = np.arange(length_of_vector)
+        out = ix_(x, x)
+        assert_equal(out[0].shape, (length_of_vector, 1))
+        assert_equal(out[1].shape, (1, length_of_vector))
+        # check that input shape is not modified
+        assert_equal(x.shape, (length_of_vector,))
+
+
+def test_c_():
+    a = np.c_[np.array([[1, 2, 3]]), 0, 0, np.array([[4, 5, 6]])]
+    assert_equal(a, [[1, 2, 3, 0, 0, 4, 5, 6]])
+
+
+class TestFillDiagonal:
+    def test_basic(self):
+        a = np.zeros((3, 3), int)
+        fill_diagonal(a, 5)
+        assert_array_equal(
+            a, np.array([[5, 0, 0],
+                         [0, 5, 0],
+                         [0, 0, 5]])
+            )
+
+    def test_tall_matrix(self):
+        a = np.zeros((10, 3), int)
+        fill_diagonal(a, 5)
+        assert_array_equal(
+            a, np.array([[5, 0, 0],
+                         [0, 5, 0],
+                         [0, 0, 5],
+                         [0, 0, 0],
+                         [0, 0, 0],
+                         [0, 0, 0],
+                         [0, 0, 0],
+                         [0, 0, 0],
+                         [0, 0, 0],
+                         [0, 0, 0]])
+            )
+
+    def test_tall_matrix_wrap(self):
+        a = np.zeros((10, 3), int)
+        fill_diagonal(a, 5, True)
+        assert_array_equal(
+            a, np.array([[5, 0, 0],
+                         [0, 5, 0],
+                         [0, 0, 5],
+                         [0, 0, 0],
+                         [5, 0, 0],
+                         [0, 5, 0],
+                         [0, 0, 5],
+                         [0, 0, 0],
+                         [5, 0, 0],
+                         [0, 5, 0]])
+            )
+
+    def test_wide_matrix(self):
+        a = np.zeros((3, 10), int)
+        fill_diagonal(a, 5)
+        assert_array_equal(
+            a, np.array([[5, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+                         [0, 5, 0, 0, 0, 0, 0, 0, 0, 0],
+                         [0, 0, 5, 0, 0, 0, 0, 0, 0, 0]])
+            )
+
+    def test_operate_4d_array(self):
+        a = np.zeros((3, 3, 3, 3), int)
+        fill_diagonal(a, 4)
+        i = np.array([0, 1, 2])
+        assert_equal(np.where(a != 0), (i, i, i, i))
+
+    def test_low_dim_handling(self):
+        # raise error with low dimensionality
+        a = np.zeros(3, int)
+        with assert_raises_regex(ValueError, "at least 2-d"):
+            fill_diagonal(a, 5)
+
+    def test_hetero_shape_handling(self):
+        # raise error with high dimensionality and
+        # shape mismatch
+        a = np.zeros((3,3,7,3), int)
+        with assert_raises_regex(ValueError, "equal length"):
+            fill_diagonal(a, 2)
+
+
+def test_diag_indices():
+    di = diag_indices(4)
+    a = np.array([[1, 2, 3, 4],
+                  [5, 6, 7, 8],
+                  [9, 10, 11, 12],
+                  [13, 14, 15, 16]])
+    a[di] = 100
+    assert_array_equal(
+        a, np.array([[100, 2, 3, 4],
+                     [5, 100, 7, 8],
+                     [9, 10, 100, 12],
+                     [13, 14, 15, 100]])
+        )
+
+    # Now, we create indices to manipulate a 3-d array:
+    d3 = diag_indices(2, 3)
+
+    # And use it to set the diagonal of a zeros array to 1:
+    a = np.zeros((2, 2, 2), int)
+    a[d3] = 1
+    assert_array_equal(
+        a, np.array([[[1, 0],
+                      [0, 0]],
+                     [[0, 0],
+                      [0, 1]]])
+        )
+
+
+class TestDiagIndicesFrom:
+
+    def test_diag_indices_from(self):
+        x = np.random.random((4, 4))
+        r, c = diag_indices_from(x)
+        assert_array_equal(r, np.arange(4))
+        assert_array_equal(c, np.arange(4))
+
+    def test_error_small_input(self):
+        x = np.ones(7)
+        with assert_raises_regex(ValueError, "at least 2-d"):
+            diag_indices_from(x)
+
+    def test_error_shape_mismatch(self):
+        x = np.zeros((3, 3, 2, 3), int)
+        with assert_raises_regex(ValueError, "equal length"):
+            diag_indices_from(x)
+
+
+def test_ndindex():
+    x = list(ndindex(1, 2, 3))
+    expected = [ix for ix, e in ndenumerate(np.zeros((1, 2, 3)))]
+    assert_array_equal(x, expected)
+
+    x = list(ndindex((1, 2, 3)))
+    assert_array_equal(x, expected)
+
+    # Test use of scalars and tuples
+    x = list(ndindex((3,)))
+    assert_array_equal(x, list(ndindex(3)))
+
+    # Make sure size argument is optional
+    x = list(ndindex())
+    assert_equal(x, [()])
+
+    x = list(ndindex(()))
+    assert_equal(x, [()])
+
+    # Make sure 0-sized ndindex works correctly
+    x = list(ndindex(*[0]))
+    assert_equal(x, [])
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_io.py b/venv/Lib/site-packages/numpy/lib/tests/test_io.py
new file mode 100644
index 000000000..7714b3167
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_io.py
@@ -0,0 +1,2614 @@
+import sys
+import gc
+import gzip
+import os
+import threading
+import time
+import warnings
+import io
+import re
+import pytest
+from pathlib import Path
+from tempfile import NamedTemporaryFile
+from io import BytesIO, StringIO
+from datetime import datetime
+import locale
+from multiprocessing import Process, Value
+from ctypes import c_bool
+
+import numpy as np
+import numpy.ma as ma
+from numpy.lib._iotools import ConverterError, ConversionWarning
+from numpy.compat import asbytes, bytes
+from numpy.ma.testutils import assert_equal
+from numpy.testing import (
+    assert_warns, assert_, assert_raises_regex, assert_raises,
+    assert_allclose, assert_array_equal, temppath, tempdir, IS_PYPY,
+    HAS_REFCOUNT, suppress_warnings, assert_no_gc_cycles, assert_no_warnings
+    )
+from numpy.testing._private.utils import requires_memory
+
+
+class TextIO(BytesIO):
+    """Helper IO class.
+
+    Writes encode strings to bytes if needed, reads return bytes.
+    This makes it easier to emulate files opened in binary mode
+    without needing to explicitly convert strings to bytes in
+    setting up the test data.
+
+    """
+    def __init__(self, s=""):
+        BytesIO.__init__(self, asbytes(s))
+
+    def write(self, s):
+        BytesIO.write(self, asbytes(s))
+
+    def writelines(self, lines):
+        BytesIO.writelines(self, [asbytes(s) for s in lines])
+
+
+IS_64BIT = sys.maxsize > 2**32
+try:
+    import bz2
+    HAS_BZ2 = True
+except ImportError:
+    HAS_BZ2 = False
+try:
+    import lzma
+    HAS_LZMA = True
+except ImportError:
+    HAS_LZMA = False
+
+
+def strptime(s, fmt=None):
+    """
+    This function is available in the datetime module only from Python >=
+    2.5.
+
+    """
+    if type(s) == bytes:
+        s = s.decode("latin1")
+    return datetime(*time.strptime(s, fmt)[:3])
+
+
+class RoundtripTest:
+    def roundtrip(self, save_func, *args, **kwargs):
+        """
+        save_func : callable
+            Function used to save arrays to file.
+        file_on_disk : bool
+            If true, store the file on disk, instead of in a
+            string buffer.
+        save_kwds : dict
+            Parameters passed to `save_func`.
+        load_kwds : dict
+            Parameters passed to `numpy.load`.
+        args : tuple of arrays
+            Arrays stored to file.
+
+        """
+        save_kwds = kwargs.get('save_kwds', {})
+        load_kwds = kwargs.get('load_kwds', {"allow_pickle": True})
+        file_on_disk = kwargs.get('file_on_disk', False)
+
+        if file_on_disk:
+            target_file = NamedTemporaryFile(delete=False)
+            load_file = target_file.name
+        else:
+            target_file = BytesIO()
+            load_file = target_file
+
+        try:
+            arr = args
+
+            save_func(target_file, *arr, **save_kwds)
+            target_file.flush()
+            target_file.seek(0)
+
+            if sys.platform == 'win32' and not isinstance(target_file, BytesIO):
+                target_file.close()
+
+            arr_reloaded = np.load(load_file, **load_kwds)
+
+            self.arr = arr
+            self.arr_reloaded = arr_reloaded
+        finally:
+            if not isinstance(target_file, BytesIO):
+                target_file.close()
+                # holds an open file descriptor so it can't be deleted on win
+                if 'arr_reloaded' in locals():
+                    if not isinstance(arr_reloaded, np.lib.npyio.NpzFile):
+                        os.remove(target_file.name)
+
+    def check_roundtrips(self, a):
+        self.roundtrip(a)
+        self.roundtrip(a, file_on_disk=True)
+        self.roundtrip(np.asfortranarray(a))
+        self.roundtrip(np.asfortranarray(a), file_on_disk=True)
+        if a.shape[0] > 1:
+            # neither C nor Fortran contiguous for 2D arrays or more
+            self.roundtrip(np.asfortranarray(a)[1:])
+            self.roundtrip(np.asfortranarray(a)[1:], file_on_disk=True)
+
+    def test_array(self):
+        a = np.array([], float)
+        self.check_roundtrips(a)
+
+        a = np.array([[1, 2], [3, 4]], float)
+        self.check_roundtrips(a)
+
+        a = np.array([[1, 2], [3, 4]], int)
+        self.check_roundtrips(a)
+
+        a = np.array([[1 + 5j, 2 + 6j], [3 + 7j, 4 + 8j]], dtype=np.csingle)
+        self.check_roundtrips(a)
+
+        a = np.array([[1 + 5j, 2 + 6j], [3 + 7j, 4 + 8j]], dtype=np.cdouble)
+        self.check_roundtrips(a)
+
+    def test_array_object(self):
+        a = np.array([], object)
+        self.check_roundtrips(a)
+
+        a = np.array([[1, 2], [3, 4]], object)
+        self.check_roundtrips(a)
+
+    def test_1D(self):
+        a = np.array([1, 2, 3, 4], int)
+        self.roundtrip(a)
+
+    @pytest.mark.skipif(sys.platform == 'win32', reason="Fails on Win32")
+    def test_mmap(self):
+        a = np.array([[1, 2.5], [4, 7.3]])
+        self.roundtrip(a, file_on_disk=True, load_kwds={'mmap_mode': 'r'})
+
+        a = np.asfortranarray([[1, 2.5], [4, 7.3]])
+        self.roundtrip(a, file_on_disk=True, load_kwds={'mmap_mode': 'r'})
+
+    def test_record(self):
+        a = np.array([(1, 2), (3, 4)], dtype=[('x', 'i4'), ('y', 'i4')])
+        self.check_roundtrips(a)
+
+    @pytest.mark.slow
+    def test_format_2_0(self):
+        dt = [(("%d" % i) * 100, float) for i in range(500)]
+        a = np.ones(1000, dtype=dt)
+        with warnings.catch_warnings(record=True):
+            warnings.filterwarnings('always', '', UserWarning)
+            self.check_roundtrips(a)
+
+
+class TestSaveLoad(RoundtripTest):
+    def roundtrip(self, *args, **kwargs):
+        RoundtripTest.roundtrip(self, np.save, *args, **kwargs)
+        assert_equal(self.arr[0], self.arr_reloaded)
+        assert_equal(self.arr[0].dtype, self.arr_reloaded.dtype)
+        assert_equal(self.arr[0].flags.fnc, self.arr_reloaded.flags.fnc)
+
+
+class TestSavezLoad(RoundtripTest):
+    def roundtrip(self, *args, **kwargs):
+        RoundtripTest.roundtrip(self, np.savez, *args, **kwargs)
+        try:
+            for n, arr in enumerate(self.arr):
+                reloaded = self.arr_reloaded['arr_%d' % n]
+                assert_equal(arr, reloaded)
+                assert_equal(arr.dtype, reloaded.dtype)
+                assert_equal(arr.flags.fnc, reloaded.flags.fnc)
+        finally:
+            # delete tempfile, must be done here on windows
+            if self.arr_reloaded.fid:
+                self.arr_reloaded.fid.close()
+                os.remove(self.arr_reloaded.fid.name)
+
+    @pytest.mark.skipif(not IS_64BIT, reason="Needs 64bit platform")
+    @pytest.mark.slow
+    def test_big_arrays(self):
+        L = (1 << 31) + 100000
+        a = np.empty(L, dtype=np.uint8)
+        with temppath(prefix="numpy_test_big_arrays_", suffix=".npz") as tmp:
+            np.savez(tmp, a=a)
+            del a
+            npfile = np.load(tmp)
+            a = npfile['a']  # Should succeed
+            npfile.close()
+            del a  # Avoid pyflakes unused variable warning.
+
+    def test_multiple_arrays(self):
+        a = np.array([[1, 2], [3, 4]], float)
+        b = np.array([[1 + 2j, 2 + 7j], [3 - 6j, 4 + 12j]], complex)
+        self.roundtrip(a, b)
+
+    def test_named_arrays(self):
+        a = np.array([[1, 2], [3, 4]], float)
+        b = np.array([[1 + 2j, 2 + 7j], [3 - 6j, 4 + 12j]], complex)
+        c = BytesIO()
+        np.savez(c, file_a=a, file_b=b)
+        c.seek(0)
+        l = np.load(c)
+        assert_equal(a, l['file_a'])
+        assert_equal(b, l['file_b'])
+
+    def test_BagObj(self):
+        a = np.array([[1, 2], [3, 4]], float)
+        b = np.array([[1 + 2j, 2 + 7j], [3 - 6j, 4 + 12j]], complex)
+        c = BytesIO()
+        np.savez(c, file_a=a, file_b=b)
+        c.seek(0)
+        l = np.load(c)
+        assert_equal(sorted(dir(l.f)), ['file_a','file_b'])
+        assert_equal(a, l.f.file_a)
+        assert_equal(b, l.f.file_b)
+
+    def test_savez_filename_clashes(self):
+        # Test that issue #852 is fixed
+        # and savez functions in multithreaded environment
+
+        def writer(error_list):
+            with temppath(suffix='.npz') as tmp:
+                arr = np.random.randn(500, 500)
+                try:
+                    np.savez(tmp, arr=arr)
+                except OSError as err:
+                    error_list.append(err)
+
+        errors = []
+        threads = [threading.Thread(target=writer, args=(errors,))
+                   for j in range(3)]
+        for t in threads:
+            t.start()
+        for t in threads:
+            t.join()
+
+        if errors:
+            raise AssertionError(errors)
+
+    def test_not_closing_opened_fid(self):
+        # Test that issue #2178 is fixed:
+        # verify could seek on 'loaded' file
+        with temppath(suffix='.npz') as tmp:
+            with open(tmp, 'wb') as fp:
+                np.savez(fp, data='LOVELY LOAD')
+            with open(tmp, 'rb', 10000) as fp:
+                fp.seek(0)
+                assert_(not fp.closed)
+                np.load(fp)['data']
+                # fp must not get closed by .load
+                assert_(not fp.closed)
+                fp.seek(0)
+                assert_(not fp.closed)
+
+    @pytest.mark.slow_pypy
+    def test_closing_fid(self):
+        # Test that issue #1517 (too many opened files) remains closed
+        # It might be a "weak" test since failed to get triggered on
+        # e.g. Debian sid of 2012 Jul 05 but was reported to
+        # trigger the failure on Ubuntu 10.04:
+        # http://projects.scipy.org/numpy/ticket/1517#comment:2
+        with temppath(suffix='.npz') as tmp:
+            np.savez(tmp, data='LOVELY LOAD')
+            # We need to check if the garbage collector can properly close
+            # numpy npz file returned by np.load when their reference count
+            # goes to zero.  Python 3 running in debug mode raises a
+            # ResourceWarning when file closing is left to the garbage
+            # collector, so we catch the warnings.
+            with suppress_warnings() as sup:
+                sup.filter(ResourceWarning)  # TODO: specify exact message
+                for i in range(1, 1025):
+                    try:
+                        np.load(tmp)["data"]
+                    except Exception as e:
+                        msg = "Failed to load data from a file: %s" % e
+                        raise AssertionError(msg)
+                    finally:
+                        if IS_PYPY:
+                            gc.collect()
+
+    def test_closing_zipfile_after_load(self):
+        # Check that zipfile owns file and can close it.  This needs to
+        # pass a file name to load for the test. On windows failure will
+        # cause a second error will be raised when the attempt to remove
+        # the open file is made.
+        prefix = 'numpy_test_closing_zipfile_after_load_'
+        with temppath(suffix='.npz', prefix=prefix) as tmp:
+            np.savez(tmp, lab='place holder')
+            data = np.load(tmp)
+            fp = data.zip.fp
+            data.close()
+            assert_(fp.closed)
+
+
+class TestSaveTxt:
+    def test_array(self):
+        a = np.array([[1, 2], [3, 4]], float)
+        fmt = "%.18e"
+        c = BytesIO()
+        np.savetxt(c, a, fmt=fmt)
+        c.seek(0)
+        assert_equal(c.readlines(),
+                     [asbytes((fmt + ' ' + fmt + '\n') % (1, 2)),
+                      asbytes((fmt + ' ' + fmt + '\n') % (3, 4))])
+
+        a = np.array([[1, 2], [3, 4]], int)
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%d')
+        c.seek(0)
+        assert_equal(c.readlines(), [b'1 2\n', b'3 4\n'])
+
+    def test_1D(self):
+        a = np.array([1, 2, 3, 4], int)
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%d')
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(lines, [b'1\n', b'2\n', b'3\n', b'4\n'])
+
+    def test_0D_3D(self):
+        c = BytesIO()
+        assert_raises(ValueError, np.savetxt, c, np.array(1))
+        assert_raises(ValueError, np.savetxt, c, np.array([[[1], [2]]]))
+
+    def test_structured(self):
+        a = np.array([(1, 2), (3, 4)], dtype=[('x', 'i4'), ('y', 'i4')])
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%d')
+        c.seek(0)
+        assert_equal(c.readlines(), [b'1 2\n', b'3 4\n'])
+
+    def test_structured_padded(self):
+        # gh-13297
+        a = np.array([(1, 2, 3),(4, 5, 6)], dtype=[
+            ('foo', 'i4'), ('bar', 'i4'), ('baz', 'i4')
+        ])
+        c = BytesIO()
+        np.savetxt(c, a[['foo', 'baz']], fmt='%d')
+        c.seek(0)
+        assert_equal(c.readlines(), [b'1 3\n', b'4 6\n'])
+
+    def test_multifield_view(self):
+        a = np.ones(1, dtype=[('x', 'i4'), ('y', 'i4'), ('z', 'f4')])
+        v = a[['x', 'z']]
+        with temppath(suffix='.npy') as path:
+            path = Path(path)
+            np.save(path, v)
+            data = np.load(path)
+            assert_array_equal(data, v)
+
+    def test_delimiter(self):
+        a = np.array([[1., 2.], [3., 4.]])
+        c = BytesIO()
+        np.savetxt(c, a, delimiter=',', fmt='%d')
+        c.seek(0)
+        assert_equal(c.readlines(), [b'1,2\n', b'3,4\n'])
+
+    def test_format(self):
+        a = np.array([(1, 2), (3, 4)])
+        c = BytesIO()
+        # Sequence of formats
+        np.savetxt(c, a, fmt=['%02d', '%3.1f'])
+        c.seek(0)
+        assert_equal(c.readlines(), [b'01 2.0\n', b'03 4.0\n'])
+
+        # A single multiformat string
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%02d : %3.1f')
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(lines, [b'01 : 2.0\n', b'03 : 4.0\n'])
+
+        # Specify delimiter, should be overridden
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%02d : %3.1f', delimiter=',')
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(lines, [b'01 : 2.0\n', b'03 : 4.0\n'])
+
+        # Bad fmt, should raise a ValueError
+        c = BytesIO()
+        assert_raises(ValueError, np.savetxt, c, a, fmt=99)
+
+    def test_header_footer(self):
+        # Test the functionality of the header and footer keyword argument.
+
+        c = BytesIO()
+        a = np.array([(1, 2), (3, 4)], dtype=int)
+        test_header_footer = 'Test header / footer'
+        # Test the header keyword argument
+        np.savetxt(c, a, fmt='%1d', header=test_header_footer)
+        c.seek(0)
+        assert_equal(c.read(),
+                     asbytes('# ' + test_header_footer + '\n1 2\n3 4\n'))
+        # Test the footer keyword argument
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%1d', footer=test_header_footer)
+        c.seek(0)
+        assert_equal(c.read(),
+                     asbytes('1 2\n3 4\n# ' + test_header_footer + '\n'))
+        # Test the commentstr keyword argument used on the header
+        c = BytesIO()
+        commentstr = '% '
+        np.savetxt(c, a, fmt='%1d',
+                   header=test_header_footer, comments=commentstr)
+        c.seek(0)
+        assert_equal(c.read(),
+                     asbytes(commentstr + test_header_footer + '\n' + '1 2\n3 4\n'))
+        # Test the commentstr keyword argument used on the footer
+        c = BytesIO()
+        commentstr = '% '
+        np.savetxt(c, a, fmt='%1d',
+                   footer=test_header_footer, comments=commentstr)
+        c.seek(0)
+        assert_equal(c.read(),
+                     asbytes('1 2\n3 4\n' + commentstr + test_header_footer + '\n'))
+
+    def test_file_roundtrip(self):
+        with temppath() as name:
+            a = np.array([(1, 2), (3, 4)])
+            np.savetxt(name, a)
+            b = np.loadtxt(name)
+            assert_array_equal(a, b)
+
+    def test_complex_arrays(self):
+        ncols = 2
+        nrows = 2
+        a = np.zeros((ncols, nrows), dtype=np.complex128)
+        re = np.pi
+        im = np.e
+        a[:] = re + 1.0j * im
+
+        # One format only
+        c = BytesIO()
+        np.savetxt(c, a, fmt=' %+.3e')
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(
+            lines,
+            [b' ( +3.142e+00+ +2.718e+00j)  ( +3.142e+00+ +2.718e+00j)\n',
+             b' ( +3.142e+00+ +2.718e+00j)  ( +3.142e+00+ +2.718e+00j)\n'])
+
+        # One format for each real and imaginary part
+        c = BytesIO()
+        np.savetxt(c, a, fmt='  %+.3e' * 2 * ncols)
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(
+            lines,
+            [b'  +3.142e+00  +2.718e+00  +3.142e+00  +2.718e+00\n',
+             b'  +3.142e+00  +2.718e+00  +3.142e+00  +2.718e+00\n'])
+
+        # One format for each complex number
+        c = BytesIO()
+        np.savetxt(c, a, fmt=['(%.3e%+.3ej)'] * ncols)
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(
+            lines,
+            [b'(3.142e+00+2.718e+00j) (3.142e+00+2.718e+00j)\n',
+             b'(3.142e+00+2.718e+00j) (3.142e+00+2.718e+00j)\n'])
+
+    def test_complex_negative_exponent(self):
+        # Previous to 1.15, some formats generated x+-yj, gh 7895
+        ncols = 2
+        nrows = 2
+        a = np.zeros((ncols, nrows), dtype=np.complex128)
+        re = np.pi
+        im = np.e
+        a[:] = re - 1.0j * im
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%.3e')
+        c.seek(0)
+        lines = c.readlines()
+        assert_equal(
+            lines,
+            [b' (3.142e+00-2.718e+00j)  (3.142e+00-2.718e+00j)\n',
+             b' (3.142e+00-2.718e+00j)  (3.142e+00-2.718e+00j)\n'])
+
+
+    def test_custom_writer(self):
+
+        class CustomWriter(list):
+            def write(self, text):
+                self.extend(text.split(b'\n'))
+
+        w = CustomWriter()
+        a = np.array([(1, 2), (3, 4)])
+        np.savetxt(w, a)
+        b = np.loadtxt(w)
+        assert_array_equal(a, b)
+
+    def test_unicode(self):
+        utf8 = b'\xcf\x96'.decode('UTF-8')
+        a = np.array([utf8], dtype=np.unicode_)
+        with tempdir() as tmpdir:
+            # set encoding as on windows it may not be unicode even on py3
+            np.savetxt(os.path.join(tmpdir, 'test.csv'), a, fmt=['%s'],
+                       encoding='UTF-8')
+
+    def test_unicode_roundtrip(self):
+        utf8 = b'\xcf\x96'.decode('UTF-8')
+        a = np.array([utf8], dtype=np.unicode_)
+        # our gz wrapper support encoding
+        suffixes = ['', '.gz']
+        if HAS_BZ2:
+            suffixes.append('.bz2')
+        if HAS_LZMA:
+            suffixes.extend(['.xz', '.lzma'])
+        with tempdir() as tmpdir:
+            for suffix in suffixes:
+                np.savetxt(os.path.join(tmpdir, 'test.csv' + suffix), a,
+                           fmt=['%s'], encoding='UTF-16-LE')
+                b = np.loadtxt(os.path.join(tmpdir, 'test.csv' + suffix),
+                               encoding='UTF-16-LE', dtype=np.unicode_)
+                assert_array_equal(a, b)
+
+    def test_unicode_bytestream(self):
+        utf8 = b'\xcf\x96'.decode('UTF-8')
+        a = np.array([utf8], dtype=np.unicode_)
+        s = BytesIO()
+        np.savetxt(s, a, fmt=['%s'], encoding='UTF-8')
+        s.seek(0)
+        assert_equal(s.read().decode('UTF-8'), utf8 + '\n')
+
+    def test_unicode_stringstream(self):
+        utf8 = b'\xcf\x96'.decode('UTF-8')
+        a = np.array([utf8], dtype=np.unicode_)
+        s = StringIO()
+        np.savetxt(s, a, fmt=['%s'], encoding='UTF-8')
+        s.seek(0)
+        assert_equal(s.read(), utf8 + '\n')
+
+    @pytest.mark.parametrize("fmt", [u"%f", b"%f"])
+    @pytest.mark.parametrize("iotype", [StringIO, BytesIO])
+    def test_unicode_and_bytes_fmt(self, fmt, iotype):
+        # string type of fmt should not matter, see also gh-4053
+        a = np.array([1.])
+        s = iotype()
+        np.savetxt(s, a, fmt=fmt)
+        s.seek(0)
+        if iotype is StringIO:
+            assert_equal(s.read(), u"%f\n" % 1.)
+        else:
+            assert_equal(s.read(), b"%f\n" % 1.)
+
+    @pytest.mark.skipif(sys.platform=='win32', reason="files>4GB may not work")
+    @pytest.mark.slow
+    @requires_memory(free_bytes=7e9)
+    def test_large_zip(self):
+        def check_large_zip(memoryerror_raised):
+            memoryerror_raised.value = False
+            try:
+                # The test takes at least 6GB of memory, writes a file larger
+                # than 4GB
+                test_data = np.asarray([np.random.rand(
+                                        np.random.randint(50,100),4)
+                                        for i in range(800000)], dtype=object)
+                with tempdir() as tmpdir:
+                    np.savez(os.path.join(tmpdir, 'test.npz'),
+                             test_data=test_data)
+            except MemoryError:
+                memoryerror_raised.value = True
+                raise
+        # run in a subprocess to ensure memory is released on PyPy, see gh-15775
+        # Use an object in shared memory to re-raise the MemoryError exception
+        # in our process if needed, see gh-16889
+        memoryerror_raised = Value(c_bool)
+        p = Process(target=check_large_zip, args=(memoryerror_raised,))
+        p.start()
+        p.join()
+        if memoryerror_raised.value:
+            raise MemoryError("Child process raised a MemoryError exception")
+        assert p.exitcode == 0
+
+class LoadTxtBase:
+    def check_compressed(self, fopen, suffixes):
+        # Test that we can load data from a compressed file
+        wanted = np.arange(6).reshape((2, 3))
+        linesep = ('\n', '\r\n', '\r')
+        for sep in linesep:
+            data = '0 1 2' + sep + '3 4 5'
+            for suffix in suffixes:
+                with temppath(suffix=suffix) as name:
+                    with fopen(name, mode='wt', encoding='UTF-32-LE') as f:
+                        f.write(data)
+                    res = self.loadfunc(name, encoding='UTF-32-LE')
+                    assert_array_equal(res, wanted)
+                    with fopen(name, "rt",  encoding='UTF-32-LE') as f:
+                        res = self.loadfunc(f)
+                    assert_array_equal(res, wanted)
+
+    def test_compressed_gzip(self):
+        self.check_compressed(gzip.open, ('.gz',))
+
+    @pytest.mark.skipif(not HAS_BZ2, reason="Needs bz2")
+    def test_compressed_bz2(self):
+        self.check_compressed(bz2.open, ('.bz2',))
+
+    @pytest.mark.skipif(not HAS_LZMA, reason="Needs lzma")
+    def test_compressed_lzma(self):
+        self.check_compressed(lzma.open, ('.xz', '.lzma'))
+
+    def test_encoding(self):
+        with temppath() as path:
+            with open(path, "wb") as f:
+                f.write('0.\n1.\n2.'.encode("UTF-16"))
+            x = self.loadfunc(path, encoding="UTF-16")
+            assert_array_equal(x, [0., 1., 2.])
+
+    def test_stringload(self):
+        # umlaute
+        nonascii = b'\xc3\xb6\xc3\xbc\xc3\xb6'.decode("UTF-8")
+        with temppath() as path:
+            with open(path, "wb") as f:
+                f.write(nonascii.encode("UTF-16"))
+            x = self.loadfunc(path, encoding="UTF-16", dtype=np.unicode_)
+            assert_array_equal(x, nonascii)
+
+    def test_binary_decode(self):
+        utf16 = b'\xff\xfeh\x04 \x00i\x04 \x00j\x04'
+        v = self.loadfunc(BytesIO(utf16), dtype=np.unicode_, encoding='UTF-16')
+        assert_array_equal(v, np.array(utf16.decode('UTF-16').split()))
+
+    def test_converters_decode(self):
+        # test converters that decode strings
+        c = TextIO()
+        c.write(b'\xcf\x96')
+        c.seek(0)
+        x = self.loadfunc(c, dtype=np.unicode_,
+                          converters={0: lambda x: x.decode('UTF-8')})
+        a = np.array([b'\xcf\x96'.decode('UTF-8')])
+        assert_array_equal(x, a)
+
+    def test_converters_nodecode(self):
+        # test native string converters enabled by setting an encoding
+        utf8 = b'\xcf\x96'.decode('UTF-8')
+        with temppath() as path:
+            with io.open(path, 'wt', encoding='UTF-8') as f:
+                f.write(utf8)
+            x = self.loadfunc(path, dtype=np.unicode_,
+                              converters={0: lambda x: x + 't'},
+                              encoding='UTF-8')
+            a = np.array([utf8 + 't'])
+            assert_array_equal(x, a)
+
+
+class TestLoadTxt(LoadTxtBase):
+    loadfunc = staticmethod(np.loadtxt)
+
+    def setup(self):
+        # lower chunksize for testing
+        self.orig_chunk = np.lib.npyio._loadtxt_chunksize
+        np.lib.npyio._loadtxt_chunksize = 1
+    def teardown(self):
+        np.lib.npyio._loadtxt_chunksize = self.orig_chunk
+
+    def test_record(self):
+        c = TextIO()
+        c.write('1 2\n3 4')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=[('x', np.int32), ('y', np.int32)])
+        a = np.array([(1, 2), (3, 4)], dtype=[('x', 'i4'), ('y', 'i4')])
+        assert_array_equal(x, a)
+
+        d = TextIO()
+        d.write('M 64.0 75.0\nF 25.0 60.0')
+        d.seek(0)
+        mydescriptor = {'names': ('gender', 'age', 'weight'),
+                        'formats': ('S1', 'i4', 'f4')}
+        b = np.array([('M', 64.0, 75.0),
+                      ('F', 25.0, 60.0)], dtype=mydescriptor)
+        y = np.loadtxt(d, dtype=mydescriptor)
+        assert_array_equal(y, b)
+
+    def test_array(self):
+        c = TextIO()
+        c.write('1 2\n3 4')
+
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int)
+        a = np.array([[1, 2], [3, 4]], int)
+        assert_array_equal(x, a)
+
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float)
+        a = np.array([[1, 2], [3, 4]], float)
+        assert_array_equal(x, a)
+
+    def test_1D(self):
+        c = TextIO()
+        c.write('1\n2\n3\n4\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int)
+        a = np.array([1, 2, 3, 4], int)
+        assert_array_equal(x, a)
+
+        c = TextIO()
+        c.write('1,2,3,4\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',')
+        a = np.array([1, 2, 3, 4], int)
+        assert_array_equal(x, a)
+
+    def test_missing(self):
+        c = TextIO()
+        c.write('1,2,3,,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       converters={3: lambda s: int(s or - 999)})
+        a = np.array([1, 2, 3, -999, 5], int)
+        assert_array_equal(x, a)
+
+    def test_converters_with_usecols(self):
+        c = TextIO()
+        c.write('1,2,3,,5\n6,7,8,9,10\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       converters={3: lambda s: int(s or - 999)},
+                       usecols=(1, 3,))
+        a = np.array([[2, -999], [7, 9]], int)
+        assert_array_equal(x, a)
+
+    def test_comments_unicode(self):
+        c = TextIO()
+        c.write('# comment\n1,2,3,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       comments=u'#')
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+    def test_comments_byte(self):
+        c = TextIO()
+        c.write('# comment\n1,2,3,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       comments=b'#')
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+    def test_comments_multiple(self):
+        c = TextIO()
+        c.write('# comment\n1,2,3\n@ comment2\n4,5,6 // comment3')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       comments=['#', '@', '//'])
+        a = np.array([[1, 2, 3], [4, 5, 6]], int)
+        assert_array_equal(x, a)
+
+    def test_comments_multi_chars(self):
+        c = TextIO()
+        c.write('/* comment\n1,2,3,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       comments='/*')
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+        # Check that '/*' is not transformed to ['/', '*']
+        c = TextIO()
+        c.write('*/ comment\n1,2,3,5\n')
+        c.seek(0)
+        assert_raises(ValueError, np.loadtxt, c, dtype=int, delimiter=',',
+                      comments='/*')
+
+    def test_skiprows(self):
+        c = TextIO()
+        c.write('comment\n1,2,3,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       skiprows=1)
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+        c = TextIO()
+        c.write('# comment\n1,2,3,5\n')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       skiprows=1)
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+    def test_usecols(self):
+        a = np.array([[1, 2], [3, 4]], float)
+        c = BytesIO()
+        np.savetxt(c, a)
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float, usecols=(1,))
+        assert_array_equal(x, a[:, 1])
+
+        a = np.array([[1, 2, 3], [3, 4, 5]], float)
+        c = BytesIO()
+        np.savetxt(c, a)
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float, usecols=(1, 2))
+        assert_array_equal(x, a[:, 1:])
+
+        # Testing with arrays instead of tuples.
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float, usecols=np.array([1, 2]))
+        assert_array_equal(x, a[:, 1:])
+
+        # Testing with an integer instead of a sequence
+        for int_type in [int, np.int8, np.int16,
+                         np.int32, np.int64, np.uint8, np.uint16,
+                         np.uint32, np.uint64]:
+            to_read = int_type(1)
+            c.seek(0)
+            x = np.loadtxt(c, dtype=float, usecols=to_read)
+            assert_array_equal(x, a[:, 1])
+
+        # Testing with some crazy custom integer type
+        class CrazyInt:
+            def __index__(self):
+                return 1
+
+        crazy_int = CrazyInt()
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float, usecols=crazy_int)
+        assert_array_equal(x, a[:, 1])
+
+        c.seek(0)
+        x = np.loadtxt(c, dtype=float, usecols=(crazy_int,))
+        assert_array_equal(x, a[:, 1])
+
+        # Checking with dtypes defined converters.
+        data = '''JOE 70.1 25.3
+                BOB 60.5 27.9
+                '''
+        c = TextIO(data)
+        names = ['stid', 'temp']
+        dtypes = ['S4', 'f8']
+        arr = np.loadtxt(c, usecols=(0, 2), dtype=list(zip(names, dtypes)))
+        assert_equal(arr['stid'], [b"JOE", b"BOB"])
+        assert_equal(arr['temp'], [25.3, 27.9])
+
+        # Testing non-ints in usecols
+        c.seek(0)
+        bogus_idx = 1.5
+        assert_raises_regex(
+            TypeError,
+            '^usecols must be.*%s' % type(bogus_idx),
+            np.loadtxt, c, usecols=bogus_idx
+            )
+
+        assert_raises_regex(
+            TypeError,
+            '^usecols must be.*%s' % type(bogus_idx),
+            np.loadtxt, c, usecols=[0, bogus_idx, 0]
+            )
+
+    def test_fancy_dtype(self):
+        c = TextIO()
+        c.write('1,2,3.0\n4,5,6.0\n')
+        c.seek(0)
+        dt = np.dtype([('x', int), ('y', [('t', int), ('s', float)])])
+        x = np.loadtxt(c, dtype=dt, delimiter=',')
+        a = np.array([(1, (2, 3.0)), (4, (5, 6.0))], dt)
+        assert_array_equal(x, a)
+
+    def test_shaped_dtype(self):
+        c = TextIO("aaaa  1.0  8.0  1 2 3 4 5 6")
+        dt = np.dtype([('name', 'S4'), ('x', float), ('y', float),
+                       ('block', int, (2, 3))])
+        x = np.loadtxt(c, dtype=dt)
+        a = np.array([('aaaa', 1.0, 8.0, [[1, 2, 3], [4, 5, 6]])],
+                     dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_3d_shaped_dtype(self):
+        c = TextIO("aaaa  1.0  8.0  1 2 3 4 5 6 7 8 9 10 11 12")
+        dt = np.dtype([('name', 'S4'), ('x', float), ('y', float),
+                       ('block', int, (2, 2, 3))])
+        x = np.loadtxt(c, dtype=dt)
+        a = np.array([('aaaa', 1.0, 8.0,
+                       [[[1, 2, 3], [4, 5, 6]], [[7, 8, 9], [10, 11, 12]]])],
+                     dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_str_dtype(self):
+        # see gh-8033
+        c = ["str1", "str2"]
+
+        for dt in (str, np.bytes_):
+            a = np.array(["str1", "str2"], dtype=dt)
+            x = np.loadtxt(c, dtype=dt)
+            assert_array_equal(x, a)
+
+    def test_empty_file(self):
+        with suppress_warnings() as sup:
+            sup.filter(message="loadtxt: Empty input file:")
+            c = TextIO()
+            x = np.loadtxt(c)
+            assert_equal(x.shape, (0,))
+            x = np.loadtxt(c, dtype=np.int64)
+            assert_equal(x.shape, (0,))
+            assert_(x.dtype == np.int64)
+
+    def test_unused_converter(self):
+        c = TextIO()
+        c.writelines(['1 21\n', '3 42\n'])
+        c.seek(0)
+        data = np.loadtxt(c, usecols=(1,),
+                          converters={0: lambda s: int(s, 16)})
+        assert_array_equal(data, [21, 42])
+
+        c.seek(0)
+        data = np.loadtxt(c, usecols=(1,),
+                          converters={1: lambda s: int(s, 16)})
+        assert_array_equal(data, [33, 66])
+
+    def test_dtype_with_object(self):
+        # Test using an explicit dtype with an object
+        data = """ 1; 2001-01-01
+                   2; 2002-01-31 """
+        ndtype = [('idx', int), ('code', object)]
+        func = lambda s: strptime(s.strip(), "%Y-%m-%d")
+        converters = {1: func}
+        test = np.loadtxt(TextIO(data), delimiter=";", dtype=ndtype,
+                          converters=converters)
+        control = np.array(
+            [(1, datetime(2001, 1, 1)), (2, datetime(2002, 1, 31))],
+            dtype=ndtype)
+        assert_equal(test, control)
+
+    def test_uint64_type(self):
+        tgt = (9223372043271415339, 9223372043271415853)
+        c = TextIO()
+        c.write("%s %s" % tgt)
+        c.seek(0)
+        res = np.loadtxt(c, dtype=np.uint64)
+        assert_equal(res, tgt)
+
+    def test_int64_type(self):
+        tgt = (-9223372036854775807, 9223372036854775807)
+        c = TextIO()
+        c.write("%s %s" % tgt)
+        c.seek(0)
+        res = np.loadtxt(c, dtype=np.int64)
+        assert_equal(res, tgt)
+
+    def test_from_float_hex(self):
+        # IEEE doubles and floats only, otherwise the float32
+        # conversion may fail.
+        tgt = np.logspace(-10, 10, 5).astype(np.float32)
+        tgt = np.hstack((tgt, -tgt)).astype(float)
+        inp = '\n'.join(map(float.hex, tgt))
+        c = TextIO()
+        c.write(inp)
+        for dt in [float, np.float32]:
+            c.seek(0)
+            res = np.loadtxt(c, dtype=dt)
+            assert_equal(res, tgt, err_msg="%s" % dt)
+
+    def test_from_complex(self):
+        tgt = (complex(1, 1), complex(1, -1))
+        c = TextIO()
+        c.write("%s %s" % tgt)
+        c.seek(0)
+        res = np.loadtxt(c, dtype=complex)
+        assert_equal(res, tgt)
+
+    def test_complex_misformatted(self):
+        # test for backward compatibility
+        # some complex formats used to generate x+-yj
+        a = np.zeros((2, 2), dtype=np.complex128)
+        re = np.pi
+        im = np.e
+        a[:] = re - 1.0j * im
+        c = BytesIO()
+        np.savetxt(c, a, fmt='%.16e')
+        c.seek(0)
+        txt = c.read()
+        c.seek(0)
+        # misformat the sign on the imaginary part, gh 7895
+        txt_bad = txt.replace(b'e+00-', b'e00+-')
+        assert_(txt_bad != txt)
+        c.write(txt_bad)
+        c.seek(0)
+        res = np.loadtxt(c, dtype=complex)
+        assert_equal(res, a)
+
+    def test_universal_newline(self):
+        with temppath() as name:
+            with open(name, 'w') as f:
+                f.write('1 21\r3 42\r')
+            data = np.loadtxt(name)
+        assert_array_equal(data, [[1, 21], [3, 42]])
+
+    def test_empty_field_after_tab(self):
+        c = TextIO()
+        c.write('1 \t2 \t3\tstart \n4\t5\t6\t  \n7\t8\t9.5\t')
+        c.seek(0)
+        dt = {'names': ('x', 'y', 'z', 'comment'),
+              'formats': ('<i4', '<i4', '<f4', '|S8')}
+        x = np.loadtxt(c, dtype=dt, delimiter='\t')
+        a = np.array([b'start ', b'  ', b''])
+        assert_array_equal(x['comment'], a)
+
+    def test_structure_unpack(self):
+        txt = TextIO("M 21 72\nF 35 58")
+        dt = {'names': ('a', 'b', 'c'), 'formats': ('|S1', '<i4', '<f4')}
+        a, b, c = np.loadtxt(txt, dtype=dt, unpack=True)
+        assert_(a.dtype.str == '|S1')
+        assert_(b.dtype.str == '<i4')
+        assert_(c.dtype.str == '<f4')
+        assert_array_equal(a, np.array([b'M', b'F']))
+        assert_array_equal(b, np.array([21, 35]))
+        assert_array_equal(c, np.array([72.,  58.]))
+
+    def test_ndmin_keyword(self):
+        c = TextIO()
+        c.write('1,2,3\n4,5,6')
+        c.seek(0)
+        assert_raises(ValueError, np.loadtxt, c, ndmin=3)
+        c.seek(0)
+        assert_raises(ValueError, np.loadtxt, c, ndmin=1.5)
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',', ndmin=1)
+        a = np.array([[1, 2, 3], [4, 5, 6]])
+        assert_array_equal(x, a)
+
+        d = TextIO()
+        d.write('0,1,2')
+        d.seek(0)
+        x = np.loadtxt(d, dtype=int, delimiter=',', ndmin=2)
+        assert_(x.shape == (1, 3))
+        d.seek(0)
+        x = np.loadtxt(d, dtype=int, delimiter=',', ndmin=1)
+        assert_(x.shape == (3,))
+        d.seek(0)
+        x = np.loadtxt(d, dtype=int, delimiter=',', ndmin=0)
+        assert_(x.shape == (3,))
+
+        e = TextIO()
+        e.write('0\n1\n2')
+        e.seek(0)
+        x = np.loadtxt(e, dtype=int, delimiter=',', ndmin=2)
+        assert_(x.shape == (3, 1))
+        e.seek(0)
+        x = np.loadtxt(e, dtype=int, delimiter=',', ndmin=1)
+        assert_(x.shape == (3,))
+        e.seek(0)
+        x = np.loadtxt(e, dtype=int, delimiter=',', ndmin=0)
+        assert_(x.shape == (3,))
+
+        # Test ndmin kw with empty file.
+        with suppress_warnings() as sup:
+            sup.filter(message="loadtxt: Empty input file:")
+            f = TextIO()
+            assert_(np.loadtxt(f, ndmin=2).shape == (0, 1,))
+            assert_(np.loadtxt(f, ndmin=1).shape == (0,))
+
+    def test_generator_source(self):
+        def count():
+            for i in range(10):
+                yield "%d" % i
+
+        res = np.loadtxt(count())
+        assert_array_equal(res, np.arange(10))
+
+    def test_bad_line(self):
+        c = TextIO()
+        c.write('1 2 3\n4 5 6\n2 3')
+        c.seek(0)
+
+        # Check for exception and that exception contains line number
+        assert_raises_regex(ValueError, "3", np.loadtxt, c)
+
+    def test_none_as_string(self):
+        # gh-5155, None should work as string when format demands it
+        c = TextIO()
+        c.write('100,foo,200\n300,None,400')
+        c.seek(0)
+        dt = np.dtype([('x', int), ('a', 'S10'), ('y', int)])
+        np.loadtxt(c, delimiter=',', dtype=dt, comments=None)  # Should succeed
+
+    @pytest.mark.skipif(locale.getpreferredencoding() == 'ANSI_X3.4-1968',
+                        reason="Wrong preferred encoding")
+    def test_binary_load(self):
+        butf8 = b"5,6,7,\xc3\x95scarscar\n\r15,2,3,hello\n\r"\
+                b"20,2,3,\xc3\x95scar\n\r"
+        sutf8 = butf8.decode("UTF-8").replace("\r", "").splitlines()
+        with temppath() as path:
+            with open(path, "wb") as f:
+                f.write(butf8)
+            with open(path, "rb") as f:
+                x = np.loadtxt(f, encoding="UTF-8", dtype=np.unicode_)
+            assert_array_equal(x, sutf8)
+            # test broken latin1 conversion people now rely on
+            with open(path, "rb") as f:
+                x = np.loadtxt(f, encoding="UTF-8", dtype="S")
+            x = [b'5,6,7,\xc3\x95scarscar', b'15,2,3,hello', b'20,2,3,\xc3\x95scar']
+            assert_array_equal(x, np.array(x, dtype="S"))
+
+    def test_max_rows(self):
+        c = TextIO()
+        c.write('1,2,3,5\n4,5,7,8\n2,1,4,5')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       max_rows=1)
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+    def test_max_rows_with_skiprows(self):
+        c = TextIO()
+        c.write('comments\n1,2,3,5\n4,5,7,8\n2,1,4,5')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       skiprows=1, max_rows=1)
+        a = np.array([1, 2, 3, 5], int)
+        assert_array_equal(x, a)
+
+        c = TextIO()
+        c.write('comment\n1,2,3,5\n4,5,7,8\n2,1,4,5')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       skiprows=1, max_rows=2)
+        a = np.array([[1, 2, 3, 5], [4, 5, 7, 8]], int)
+        assert_array_equal(x, a)
+
+    def test_max_rows_with_read_continuation(self):
+        c = TextIO()
+        c.write('1,2,3,5\n4,5,7,8\n2,1,4,5')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       max_rows=2)
+        a = np.array([[1, 2, 3, 5], [4, 5, 7, 8]], int)
+        assert_array_equal(x, a)
+        # test continuation
+        x = np.loadtxt(c, dtype=int, delimiter=',')
+        a = np.array([2,1,4,5], int)
+        assert_array_equal(x, a)
+
+    def test_max_rows_larger(self):
+        #test max_rows > num rows
+        c = TextIO()
+        c.write('comment\n1,2,3,5\n4,5,7,8\n2,1,4,5')
+        c.seek(0)
+        x = np.loadtxt(c, dtype=int, delimiter=',',
+                       skiprows=1, max_rows=6)
+        a = np.array([[1, 2, 3, 5], [4, 5, 7, 8], [2, 1, 4, 5]], int)
+        assert_array_equal(x, a)
+
+class Testfromregex:
+    def test_record(self):
+        c = TextIO()
+        c.write('1.312 foo\n1.534 bar\n4.444 qux')
+        c.seek(0)
+
+        dt = [('num', np.float64), ('val', 'S3')]
+        x = np.fromregex(c, r"([0-9.]+)\s+(...)", dt)
+        a = np.array([(1.312, 'foo'), (1.534, 'bar'), (4.444, 'qux')],
+                     dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_record_2(self):
+        c = TextIO()
+        c.write('1312 foo\n1534 bar\n4444 qux')
+        c.seek(0)
+
+        dt = [('num', np.int32), ('val', 'S3')]
+        x = np.fromregex(c, r"(\d+)\s+(...)", dt)
+        a = np.array([(1312, 'foo'), (1534, 'bar'), (4444, 'qux')],
+                     dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_record_3(self):
+        c = TextIO()
+        c.write('1312 foo\n1534 bar\n4444 qux')
+        c.seek(0)
+
+        dt = [('num', np.float64)]
+        x = np.fromregex(c, r"(\d+)\s+...", dt)
+        a = np.array([(1312,), (1534,), (4444,)], dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_record_unicode(self):
+        utf8 = b'\xcf\x96'
+        with temppath() as path:
+            with open(path, 'wb') as f:
+                f.write(b'1.312 foo' + utf8 + b' \n1.534 bar\n4.444 qux')
+
+            dt = [('num', np.float64), ('val', 'U4')]
+            x = np.fromregex(path, r"(?u)([0-9.]+)\s+(\w+)", dt, encoding='UTF-8')
+            a = np.array([(1.312, 'foo' + utf8.decode('UTF-8')), (1.534, 'bar'),
+                           (4.444, 'qux')], dtype=dt)
+            assert_array_equal(x, a)
+
+            regexp = re.compile(r"([0-9.]+)\s+(\w+)", re.UNICODE)
+            x = np.fromregex(path, regexp, dt, encoding='UTF-8')
+            assert_array_equal(x, a)
+
+    def test_compiled_bytes(self):
+        regexp = re.compile(b'(\\d)')
+        c = BytesIO(b'123')
+        dt = [('num', np.float64)]
+        a = np.array([1, 2, 3], dtype=dt)
+        x = np.fromregex(c, regexp, dt)
+        assert_array_equal(x, a)
+
+#####--------------------------------------------------------------------------
+
+
+class TestFromTxt(LoadTxtBase):
+    loadfunc = staticmethod(np.genfromtxt)
+
+    def test_record(self):
+        # Test w/ explicit dtype
+        data = TextIO('1 2\n3 4')
+        test = np.genfromtxt(data, dtype=[('x', np.int32), ('y', np.int32)])
+        control = np.array([(1, 2), (3, 4)], dtype=[('x', 'i4'), ('y', 'i4')])
+        assert_equal(test, control)
+        #
+        data = TextIO('M 64.0 75.0\nF 25.0 60.0')
+        descriptor = {'names': ('gender', 'age', 'weight'),
+                      'formats': ('S1', 'i4', 'f4')}
+        control = np.array([('M', 64.0, 75.0), ('F', 25.0, 60.0)],
+                           dtype=descriptor)
+        test = np.genfromtxt(data, dtype=descriptor)
+        assert_equal(test, control)
+
+    def test_array(self):
+        # Test outputting a standard ndarray
+        data = TextIO('1 2\n3 4')
+        control = np.array([[1, 2], [3, 4]], dtype=int)
+        test = np.genfromtxt(data, dtype=int)
+        assert_array_equal(test, control)
+        #
+        data.seek(0)
+        control = np.array([[1, 2], [3, 4]], dtype=float)
+        test = np.loadtxt(data, dtype=float)
+        assert_array_equal(test, control)
+
+    def test_1D(self):
+        # Test squeezing to 1D
+        control = np.array([1, 2, 3, 4], int)
+        #
+        data = TextIO('1\n2\n3\n4\n')
+        test = np.genfromtxt(data, dtype=int)
+        assert_array_equal(test, control)
+        #
+        data = TextIO('1,2,3,4\n')
+        test = np.genfromtxt(data, dtype=int, delimiter=',')
+        assert_array_equal(test, control)
+
+    def test_comments(self):
+        # Test the stripping of comments
+        control = np.array([1, 2, 3, 5], int)
+        # Comment on its own line
+        data = TextIO('# comment\n1,2,3,5\n')
+        test = np.genfromtxt(data, dtype=int, delimiter=',', comments='#')
+        assert_equal(test, control)
+        # Comment at the end of a line
+        data = TextIO('1,2,3,5# comment\n')
+        test = np.genfromtxt(data, dtype=int, delimiter=',', comments='#')
+        assert_equal(test, control)
+
+    def test_skiprows(self):
+        # Test row skipping
+        control = np.array([1, 2, 3, 5], int)
+        kwargs = dict(dtype=int, delimiter=',')
+        #
+        data = TextIO('comment\n1,2,3,5\n')
+        test = np.genfromtxt(data, skip_header=1, **kwargs)
+        assert_equal(test, control)
+        #
+        data = TextIO('# comment\n1,2,3,5\n')
+        test = np.loadtxt(data, skiprows=1, **kwargs)
+        assert_equal(test, control)
+
+    def test_skip_footer(self):
+        data = ["# %i" % i for i in range(1, 6)]
+        data.append("A, B, C")
+        data.extend(["%i,%3.1f,%03s" % (i, i, i) for i in range(51)])
+        data[-1] = "99,99"
+        kwargs = dict(delimiter=",", names=True, skip_header=5, skip_footer=10)
+        test = np.genfromtxt(TextIO("\n".join(data)), **kwargs)
+        ctrl = np.array([("%f" % i, "%f" % i, "%f" % i) for i in range(41)],
+                        dtype=[(_, float) for _ in "ABC"])
+        assert_equal(test, ctrl)
+
+    def test_skip_footer_with_invalid(self):
+        with suppress_warnings() as sup:
+            sup.filter(ConversionWarning)
+            basestr = '1 1\n2 2\n3 3\n4 4\n5  \n6  \n7  \n'
+            # Footer too small to get rid of all invalid values
+            assert_raises(ValueError, np.genfromtxt,
+                          TextIO(basestr), skip_footer=1)
+    #        except ValueError:
+    #            pass
+            a = np.genfromtxt(
+                TextIO(basestr), skip_footer=1, invalid_raise=False)
+            assert_equal(a, np.array([[1., 1.], [2., 2.], [3., 3.], [4., 4.]]))
+            #
+            a = np.genfromtxt(TextIO(basestr), skip_footer=3)
+            assert_equal(a, np.array([[1., 1.], [2., 2.], [3., 3.], [4., 4.]]))
+            #
+            basestr = '1 1\n2  \n3 3\n4 4\n5  \n6 6\n7 7\n'
+            a = np.genfromtxt(
+                TextIO(basestr), skip_footer=1, invalid_raise=False)
+            assert_equal(a, np.array([[1., 1.], [3., 3.], [4., 4.], [6., 6.]]))
+            a = np.genfromtxt(
+                TextIO(basestr), skip_footer=3, invalid_raise=False)
+            assert_equal(a, np.array([[1., 1.], [3., 3.], [4., 4.]]))
+
+    def test_header(self):
+        # Test retrieving a header
+        data = TextIO('gender age weight\nM 64.0 75.0\nF 25.0 60.0')
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, dtype=None, names=True)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        control = {'gender': np.array([b'M', b'F']),
+                   'age': np.array([64.0, 25.0]),
+                   'weight': np.array([75.0, 60.0])}
+        assert_equal(test['gender'], control['gender'])
+        assert_equal(test['age'], control['age'])
+        assert_equal(test['weight'], control['weight'])
+
+    def test_auto_dtype(self):
+        # Test the automatic definition of the output dtype
+        data = TextIO('A 64 75.0 3+4j True\nBCD 25 60.0 5+6j False')
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, dtype=None)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        control = [np.array([b'A', b'BCD']),
+                   np.array([64, 25]),
+                   np.array([75.0, 60.0]),
+                   np.array([3 + 4j, 5 + 6j]),
+                   np.array([True, False]), ]
+        assert_equal(test.dtype.names, ['f0', 'f1', 'f2', 'f3', 'f4'])
+        for (i, ctrl) in enumerate(control):
+            assert_equal(test['f%i' % i], ctrl)
+
+    def test_auto_dtype_uniform(self):
+        # Tests whether the output dtype can be uniformized
+        data = TextIO('1 2 3 4\n5 6 7 8\n')
+        test = np.genfromtxt(data, dtype=None)
+        control = np.array([[1, 2, 3, 4], [5, 6, 7, 8]])
+        assert_equal(test, control)
+
+    def test_fancy_dtype(self):
+        # Check that a nested dtype isn't MIA
+        data = TextIO('1,2,3.0\n4,5,6.0\n')
+        fancydtype = np.dtype([('x', int), ('y', [('t', int), ('s', float)])])
+        test = np.genfromtxt(data, dtype=fancydtype, delimiter=',')
+        control = np.array([(1, (2, 3.0)), (4, (5, 6.0))], dtype=fancydtype)
+        assert_equal(test, control)
+
+    def test_names_overwrite(self):
+        # Test overwriting the names of the dtype
+        descriptor = {'names': ('g', 'a', 'w'),
+                      'formats': ('S1', 'i4', 'f4')}
+        data = TextIO(b'M 64.0 75.0\nF 25.0 60.0')
+        names = ('gender', 'age', 'weight')
+        test = np.genfromtxt(data, dtype=descriptor, names=names)
+        descriptor['names'] = names
+        control = np.array([('M', 64.0, 75.0),
+                            ('F', 25.0, 60.0)], dtype=descriptor)
+        assert_equal(test, control)
+
+    def test_commented_header(self):
+        # Check that names can be retrieved even if the line is commented out.
+        data = TextIO("""
+#gender age weight
+M   21  72.100000
+F   35  58.330000
+M   33  21.99
+        """)
+        # The # is part of the first name and should be deleted automatically.
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, names=True, dtype=None)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        ctrl = np.array([('M', 21, 72.1), ('F', 35, 58.33), ('M', 33, 21.99)],
+                        dtype=[('gender', '|S1'), ('age', int), ('weight', float)])
+        assert_equal(test, ctrl)
+        # Ditto, but we should get rid of the first element
+        data = TextIO(b"""
+# gender age weight
+M   21  72.100000
+F   35  58.330000
+M   33  21.99
+        """)
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, names=True, dtype=None)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        assert_equal(test, ctrl)
+
+    def test_names_and_comments_none(self):
+        # Tests case when names is true but comments is None (gh-10780)
+        data = TextIO('col1 col2\n 1 2\n 3 4')
+        test = np.genfromtxt(data, dtype=(int, int), comments=None, names=True)
+        control = np.array([(1, 2), (3, 4)], dtype=[('col1', int), ('col2', int)])
+        assert_equal(test, control)
+
+    def test_file_is_closed_on_error(self):
+        # gh-13200
+        with tempdir() as tmpdir:
+            fpath = os.path.join(tmpdir, "test.csv")
+            with open(fpath, "wb") as f:
+                f.write(u'\N{GREEK PI SYMBOL}'.encode('utf8'))
+
+            # ResourceWarnings are emitted from a destructor, so won't be
+            # detected by regular propagation to errors.
+            with assert_no_warnings():
+                with pytest.raises(UnicodeDecodeError):
+                    np.genfromtxt(fpath, encoding="ascii")
+
+    def test_autonames_and_usecols(self):
+        # Tests names and usecols
+        data = TextIO('A B C D\n aaaa 121 45 9.1')
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, usecols=('A', 'C', 'D'),
+                                names=True, dtype=None)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        control = np.array(('aaaa', 45, 9.1),
+                           dtype=[('A', '|S4'), ('C', int), ('D', float)])
+        assert_equal(test, control)
+
+    def test_converters_with_usecols(self):
+        # Test the combination user-defined converters and usecol
+        data = TextIO('1,2,3,,5\n6,7,8,9,10\n')
+        test = np.genfromtxt(data, dtype=int, delimiter=',',
+                            converters={3: lambda s: int(s or - 999)},
+                            usecols=(1, 3,))
+        control = np.array([[2, -999], [7, 9]], int)
+        assert_equal(test, control)
+
+    def test_converters_with_usecols_and_names(self):
+        # Tests names and usecols
+        data = TextIO('A B C D\n aaaa 121 45 9.1')
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(data, usecols=('A', 'C', 'D'), names=True,
+                                dtype=None,
+                                converters={'C': lambda s: 2 * int(s)})
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        control = np.array(('aaaa', 90, 9.1),
+                           dtype=[('A', '|S4'), ('C', int), ('D', float)])
+        assert_equal(test, control)
+
+    def test_converters_cornercases(self):
+        # Test the conversion to datetime.
+        converter = {
+            'date': lambda s: strptime(s, '%Y-%m-%d %H:%M:%SZ')}
+        data = TextIO('2009-02-03 12:00:00Z, 72214.0')
+        test = np.genfromtxt(data, delimiter=',', dtype=None,
+                            names=['date', 'stid'], converters=converter)
+        control = np.array((datetime(2009, 2, 3), 72214.),
+                           dtype=[('date', np.object_), ('stid', float)])
+        assert_equal(test, control)
+
+    def test_converters_cornercases2(self):
+        # Test the conversion to datetime64.
+        converter = {
+            'date': lambda s: np.datetime64(strptime(s, '%Y-%m-%d %H:%M:%SZ'))}
+        data = TextIO('2009-02-03 12:00:00Z, 72214.0')
+        test = np.genfromtxt(data, delimiter=',', dtype=None,
+                            names=['date', 'stid'], converters=converter)
+        control = np.array((datetime(2009, 2, 3), 72214.),
+                           dtype=[('date', 'datetime64[us]'), ('stid', float)])
+        assert_equal(test, control)
+
+    def test_unused_converter(self):
+        # Test whether unused converters are forgotten
+        data = TextIO("1 21\n  3 42\n")
+        test = np.genfromtxt(data, usecols=(1,),
+                            converters={0: lambda s: int(s, 16)})
+        assert_equal(test, [21, 42])
+        #
+        data.seek(0)
+        test = np.genfromtxt(data, usecols=(1,),
+                            converters={1: lambda s: int(s, 16)})
+        assert_equal(test, [33, 66])
+
+    def test_invalid_converter(self):
+        strip_rand = lambda x: float((b'r' in x.lower() and x.split()[-1]) or
+                                     (b'r' not in x.lower() and x.strip() or 0.0))
+        strip_per = lambda x: float((b'%' in x.lower() and x.split()[0]) or
+                                    (b'%' not in x.lower() and x.strip() or 0.0))
+        s = TextIO("D01N01,10/1/2003 ,1 %,R 75,400,600\r\n"
+                   "L24U05,12/5/2003, 2 %,1,300, 150.5\r\n"
+                   "D02N03,10/10/2004,R 1,,7,145.55")
+        kwargs = dict(
+            converters={2: strip_per, 3: strip_rand}, delimiter=",",
+            dtype=None)
+        assert_raises(ConverterError, np.genfromtxt, s, **kwargs)
+
+    def test_tricky_converter_bug1666(self):
+        # Test some corner cases
+        s = TextIO('q1,2\nq3,4')
+        cnv = lambda s: float(s[1:])
+        test = np.genfromtxt(s, delimiter=',', converters={0: cnv})
+        control = np.array([[1., 2.], [3., 4.]])
+        assert_equal(test, control)
+
+    def test_dtype_with_converters(self):
+        dstr = "2009; 23; 46"
+        test = np.genfromtxt(TextIO(dstr,),
+                            delimiter=";", dtype=float, converters={0: bytes})
+        control = np.array([('2009', 23., 46)],
+                           dtype=[('f0', '|S4'), ('f1', float), ('f2', float)])
+        assert_equal(test, control)
+        test = np.genfromtxt(TextIO(dstr,),
+                            delimiter=";", dtype=float, converters={0: float})
+        control = np.array([2009., 23., 46],)
+        assert_equal(test, control)
+
+    def test_dtype_with_converters_and_usecols(self):
+        dstr = "1,5,-1,1:1\n2,8,-1,1:n\n3,3,-2,m:n\n"
+        dmap = {'1:1':0, '1:n':1, 'm:1':2, 'm:n':3}
+        dtyp = [('e1','i4'),('e2','i4'),('e3','i2'),('n', 'i1')]
+        conv = {0: int, 1: int, 2: int, 3: lambda r: dmap[r.decode()]}
+        test = np.recfromcsv(TextIO(dstr,), dtype=dtyp, delimiter=',',
+                             names=None, converters=conv)
+        control = np.rec.array([(1,5,-1,0), (2,8,-1,1), (3,3,-2,3)], dtype=dtyp)
+        assert_equal(test, control)
+        dtyp = [('e1','i4'),('e2','i4'),('n', 'i1')]
+        test = np.recfromcsv(TextIO(dstr,), dtype=dtyp, delimiter=',',
+                             usecols=(0,1,3), names=None, converters=conv)
+        control = np.rec.array([(1,5,0), (2,8,1), (3,3,3)], dtype=dtyp)
+        assert_equal(test, control)
+
+    def test_dtype_with_object(self):
+        # Test using an explicit dtype with an object
+        data = """ 1; 2001-01-01
+                   2; 2002-01-31 """
+        ndtype = [('idx', int), ('code', object)]
+        func = lambda s: strptime(s.strip(), "%Y-%m-%d")
+        converters = {1: func}
+        test = np.genfromtxt(TextIO(data), delimiter=";", dtype=ndtype,
+                             converters=converters)
+        control = np.array(
+            [(1, datetime(2001, 1, 1)), (2, datetime(2002, 1, 31))],
+            dtype=ndtype)
+        assert_equal(test, control)
+
+        ndtype = [('nest', [('idx', int), ('code', object)])]
+        with assert_raises_regex(NotImplementedError,
+                                 'Nested fields.* not supported.*'):
+            test = np.genfromtxt(TextIO(data), delimiter=";",
+                                 dtype=ndtype, converters=converters)
+
+        # nested but empty fields also aren't supported
+        ndtype = [('idx', int), ('code', object), ('nest', [])]
+        with assert_raises_regex(NotImplementedError,
+                                 'Nested fields.* not supported.*'):
+            test = np.genfromtxt(TextIO(data), delimiter=";",
+                                 dtype=ndtype, converters=converters)
+
+    def test_dtype_with_object_no_converter(self):
+        # Object without a converter uses bytes:
+        parsed = np.genfromtxt(TextIO("1"), dtype=object)
+        assert parsed[()] == b"1"
+        parsed = np.genfromtxt(TextIO("string"), dtype=object)
+        assert parsed[()] == b"string"
+
+    def test_userconverters_with_explicit_dtype(self):
+        # Test user_converters w/ explicit (standard) dtype
+        data = TextIO('skip,skip,2001-01-01,1.0,skip')
+        test = np.genfromtxt(data, delimiter=",", names=None, dtype=float,
+                             usecols=(2, 3), converters={2: bytes})
+        control = np.array([('2001-01-01', 1.)],
+                           dtype=[('', '|S10'), ('', float)])
+        assert_equal(test, control)
+
+    def test_utf8_userconverters_with_explicit_dtype(self):
+        utf8 = b'\xcf\x96'
+        with temppath() as path:
+            with open(path, 'wb') as f:
+                f.write(b'skip,skip,2001-01-01' + utf8 + b',1.0,skip')
+            test = np.genfromtxt(path, delimiter=",", names=None, dtype=float,
+                                 usecols=(2, 3), converters={2: np.compat.unicode},
+                                 encoding='UTF-8')
+        control = np.array([('2001-01-01' + utf8.decode('UTF-8'), 1.)],
+                           dtype=[('', '|U11'), ('', float)])
+        assert_equal(test, control)
+
+    def test_spacedelimiter(self):
+        # Test space delimiter
+        data = TextIO("1  2  3  4   5\n6  7  8  9  10")
+        test = np.genfromtxt(data)
+        control = np.array([[1., 2., 3., 4., 5.],
+                            [6., 7., 8., 9., 10.]])
+        assert_equal(test, control)
+
+    def test_integer_delimiter(self):
+        # Test using an integer for delimiter
+        data = "  1  2  3\n  4  5 67\n890123  4"
+        test = np.genfromtxt(TextIO(data), delimiter=3)
+        control = np.array([[1, 2, 3], [4, 5, 67], [890, 123, 4]])
+        assert_equal(test, control)
+
+    def test_missing(self):
+        data = TextIO('1,2,3,,5\n')
+        test = np.genfromtxt(data, dtype=int, delimiter=',',
+                            converters={3: lambda s: int(s or - 999)})
+        control = np.array([1, 2, 3, -999, 5], int)
+        assert_equal(test, control)
+
+    def test_missing_with_tabs(self):
+        # Test w/ a delimiter tab
+        txt = "1\t2\t3\n\t2\t\n1\t\t3"
+        test = np.genfromtxt(TextIO(txt), delimiter="\t",
+                             usemask=True,)
+        ctrl_d = np.array([(1, 2, 3), (np.nan, 2, np.nan), (1, np.nan, 3)],)
+        ctrl_m = np.array([(0, 0, 0), (1, 0, 1), (0, 1, 0)], dtype=bool)
+        assert_equal(test.data, ctrl_d)
+        assert_equal(test.mask, ctrl_m)
+
+    def test_usecols(self):
+        # Test the selection of columns
+        # Select 1 column
+        control = np.array([[1, 2], [3, 4]], float)
+        data = TextIO()
+        np.savetxt(data, control)
+        data.seek(0)
+        test = np.genfromtxt(data, dtype=float, usecols=(1,))
+        assert_equal(test, control[:, 1])
+        #
+        control = np.array([[1, 2, 3], [3, 4, 5]], float)
+        data = TextIO()
+        np.savetxt(data, control)
+        data.seek(0)
+        test = np.genfromtxt(data, dtype=float, usecols=(1, 2))
+        assert_equal(test, control[:, 1:])
+        # Testing with arrays instead of tuples.
+        data.seek(0)
+        test = np.genfromtxt(data, dtype=float, usecols=np.array([1, 2]))
+        assert_equal(test, control[:, 1:])
+
+    def test_usecols_as_css(self):
+        # Test giving usecols with a comma-separated string
+        data = "1 2 3\n4 5 6"
+        test = np.genfromtxt(TextIO(data),
+                             names="a, b, c", usecols="a, c")
+        ctrl = np.array([(1, 3), (4, 6)], dtype=[(_, float) for _ in "ac"])
+        assert_equal(test, ctrl)
+
+    def test_usecols_with_structured_dtype(self):
+        # Test usecols with an explicit structured dtype
+        data = TextIO("JOE 70.1 25.3\nBOB 60.5 27.9")
+        names = ['stid', 'temp']
+        dtypes = ['S4', 'f8']
+        test = np.genfromtxt(
+            data, usecols=(0, 2), dtype=list(zip(names, dtypes)))
+        assert_equal(test['stid'], [b"JOE", b"BOB"])
+        assert_equal(test['temp'], [25.3, 27.9])
+
+    def test_usecols_with_integer(self):
+        # Test usecols with an integer
+        test = np.genfromtxt(TextIO(b"1 2 3\n4 5 6"), usecols=0)
+        assert_equal(test, np.array([1., 4.]))
+
+    def test_usecols_with_named_columns(self):
+        # Test usecols with named columns
+        ctrl = np.array([(1, 3), (4, 6)], dtype=[('a', float), ('c', float)])
+        data = "1 2 3\n4 5 6"
+        kwargs = dict(names="a, b, c")
+        test = np.genfromtxt(TextIO(data), usecols=(0, -1), **kwargs)
+        assert_equal(test, ctrl)
+        test = np.genfromtxt(TextIO(data),
+                             usecols=('a', 'c'), **kwargs)
+        assert_equal(test, ctrl)
+
+    def test_empty_file(self):
+        # Test that an empty file raises the proper warning.
+        with suppress_warnings() as sup:
+            sup.filter(message="genfromtxt: Empty input file:")
+            data = TextIO()
+            test = np.genfromtxt(data)
+            assert_equal(test, np.array([]))
+
+            # when skip_header > 0
+            test = np.genfromtxt(data, skip_header=1)
+            assert_equal(test, np.array([]))
+
+    def test_fancy_dtype_alt(self):
+        # Check that a nested dtype isn't MIA
+        data = TextIO('1,2,3.0\n4,5,6.0\n')
+        fancydtype = np.dtype([('x', int), ('y', [('t', int), ('s', float)])])
+        test = np.genfromtxt(data, dtype=fancydtype, delimiter=',', usemask=True)
+        control = ma.array([(1, (2, 3.0)), (4, (5, 6.0))], dtype=fancydtype)
+        assert_equal(test, control)
+
+    def test_shaped_dtype(self):
+        c = TextIO("aaaa  1.0  8.0  1 2 3 4 5 6")
+        dt = np.dtype([('name', 'S4'), ('x', float), ('y', float),
+                       ('block', int, (2, 3))])
+        x = np.genfromtxt(c, dtype=dt)
+        a = np.array([('aaaa', 1.0, 8.0, [[1, 2, 3], [4, 5, 6]])],
+                     dtype=dt)
+        assert_array_equal(x, a)
+
+    def test_withmissing(self):
+        data = TextIO('A,B\n0,1\n2,N/A')
+        kwargs = dict(delimiter=",", missing_values="N/A", names=True)
+        test = np.genfromtxt(data, dtype=None, usemask=True, **kwargs)
+        control = ma.array([(0, 1), (2, -1)],
+                           mask=[(False, False), (False, True)],
+                           dtype=[('A', int), ('B', int)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        #
+        data.seek(0)
+        test = np.genfromtxt(data, usemask=True, **kwargs)
+        control = ma.array([(0, 1), (2, -1)],
+                           mask=[(False, False), (False, True)],
+                           dtype=[('A', float), ('B', float)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+    def test_user_missing_values(self):
+        data = "A, B, C\n0, 0., 0j\n1, N/A, 1j\n-9, 2.2, N/A\n3, -99, 3j"
+        basekwargs = dict(dtype=None, delimiter=",", names=True,)
+        mdtype = [('A', int), ('B', float), ('C', complex)]
+        #
+        test = np.genfromtxt(TextIO(data), missing_values="N/A",
+                            **basekwargs)
+        control = ma.array([(0, 0.0, 0j), (1, -999, 1j),
+                            (-9, 2.2, -999j), (3, -99, 3j)],
+                           mask=[(0, 0, 0), (0, 1, 0), (0, 0, 1), (0, 0, 0)],
+                           dtype=mdtype)
+        assert_equal(test, control)
+        #
+        basekwargs['dtype'] = mdtype
+        test = np.genfromtxt(TextIO(data),
+                            missing_values={0: -9, 1: -99, 2: -999j}, usemask=True, **basekwargs)
+        control = ma.array([(0, 0.0, 0j), (1, -999, 1j),
+                            (-9, 2.2, -999j), (3, -99, 3j)],
+                           mask=[(0, 0, 0), (0, 1, 0), (1, 0, 1), (0, 1, 0)],
+                           dtype=mdtype)
+        assert_equal(test, control)
+        #
+        test = np.genfromtxt(TextIO(data),
+                            missing_values={0: -9, 'B': -99, 'C': -999j},
+                            usemask=True,
+                            **basekwargs)
+        control = ma.array([(0, 0.0, 0j), (1, -999, 1j),
+                            (-9, 2.2, -999j), (3, -99, 3j)],
+                           mask=[(0, 0, 0), (0, 1, 0), (1, 0, 1), (0, 1, 0)],
+                           dtype=mdtype)
+        assert_equal(test, control)
+
+    def test_user_filling_values(self):
+        # Test with missing and filling values
+        ctrl = np.array([(0, 3), (4, -999)], dtype=[('a', int), ('b', int)])
+        data = "N/A, 2, 3\n4, ,???"
+        kwargs = dict(delimiter=",",
+                      dtype=int,
+                      names="a,b,c",
+                      missing_values={0: "N/A", 'b': " ", 2: "???"},
+                      filling_values={0: 0, 'b': 0, 2: -999})
+        test = np.genfromtxt(TextIO(data), **kwargs)
+        ctrl = np.array([(0, 2, 3), (4, 0, -999)],
+                        dtype=[(_, int) for _ in "abc"])
+        assert_equal(test, ctrl)
+        #
+        test = np.genfromtxt(TextIO(data), usecols=(0, -1), **kwargs)
+        ctrl = np.array([(0, 3), (4, -999)], dtype=[(_, int) for _ in "ac"])
+        assert_equal(test, ctrl)
+
+        data2 = "1,2,*,4\n5,*,7,8\n"
+        test = np.genfromtxt(TextIO(data2), delimiter=',', dtype=int,
+                             missing_values="*", filling_values=0)
+        ctrl = np.array([[1, 2, 0, 4], [5, 0, 7, 8]])
+        assert_equal(test, ctrl)
+        test = np.genfromtxt(TextIO(data2), delimiter=',', dtype=int,
+                             missing_values="*", filling_values=-1)
+        ctrl = np.array([[1, 2, -1, 4], [5, -1, 7, 8]])
+        assert_equal(test, ctrl)
+
+    def test_withmissing_float(self):
+        data = TextIO('A,B\n0,1.5\n2,-999.00')
+        test = np.genfromtxt(data, dtype=None, delimiter=',',
+                            missing_values='-999.0', names=True, usemask=True)
+        control = ma.array([(0, 1.5), (2, -1.)],
+                           mask=[(False, False), (False, True)],
+                           dtype=[('A', int), ('B', float)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+    def test_with_masked_column_uniform(self):
+        # Test masked column
+        data = TextIO('1 2 3\n4 5 6\n')
+        test = np.genfromtxt(data, dtype=None,
+                             missing_values='2,5', usemask=True)
+        control = ma.array([[1, 2, 3], [4, 5, 6]], mask=[[0, 1, 0], [0, 1, 0]])
+        assert_equal(test, control)
+
+    def test_with_masked_column_various(self):
+        # Test masked column
+        data = TextIO('True 2 3\nFalse 5 6\n')
+        test = np.genfromtxt(data, dtype=None,
+                             missing_values='2,5', usemask=True)
+        control = ma.array([(1, 2, 3), (0, 5, 6)],
+                           mask=[(0, 1, 0), (0, 1, 0)],
+                           dtype=[('f0', bool), ('f1', bool), ('f2', int)])
+        assert_equal(test, control)
+
+    def test_invalid_raise(self):
+        # Test invalid raise
+        data = ["1, 1, 1, 1, 1"] * 50
+        for i in range(5):
+            data[10 * i] = "2, 2, 2, 2 2"
+        data.insert(0, "a, b, c, d, e")
+        mdata = TextIO("\n".join(data))
+        #
+        kwargs = dict(delimiter=",", dtype=None, names=True)
+        # XXX: is there a better way to get the return value of the
+        # callable in assert_warns ?
+        ret = {}
+
+        def f(_ret={}):
+            _ret['mtest'] = np.genfromtxt(mdata, invalid_raise=False, **kwargs)
+        assert_warns(ConversionWarning, f, _ret=ret)
+        mtest = ret['mtest']
+        assert_equal(len(mtest), 45)
+        assert_equal(mtest, np.ones(45, dtype=[(_, int) for _ in 'abcde']))
+        #
+        mdata.seek(0)
+        assert_raises(ValueError, np.genfromtxt, mdata,
+                      delimiter=",", names=True)
+
+    def test_invalid_raise_with_usecols(self):
+        # Test invalid_raise with usecols
+        data = ["1, 1, 1, 1, 1"] * 50
+        for i in range(5):
+            data[10 * i] = "2, 2, 2, 2 2"
+        data.insert(0, "a, b, c, d, e")
+        mdata = TextIO("\n".join(data))
+        kwargs = dict(delimiter=",", dtype=None, names=True,
+                      invalid_raise=False)
+        # XXX: is there a better way to get the return value of the
+        # callable in assert_warns ?
+        ret = {}
+
+        def f(_ret={}):
+            _ret['mtest'] = np.genfromtxt(mdata, usecols=(0, 4), **kwargs)
+        assert_warns(ConversionWarning, f, _ret=ret)
+        mtest = ret['mtest']
+        assert_equal(len(mtest), 45)
+        assert_equal(mtest, np.ones(45, dtype=[(_, int) for _ in 'ae']))
+        #
+        mdata.seek(0)
+        mtest = np.genfromtxt(mdata, usecols=(0, 1), **kwargs)
+        assert_equal(len(mtest), 50)
+        control = np.ones(50, dtype=[(_, int) for _ in 'ab'])
+        control[[10 * _ for _ in range(5)]] = (2, 2)
+        assert_equal(mtest, control)
+
+    def test_inconsistent_dtype(self):
+        # Test inconsistent dtype
+        data = ["1, 1, 1, 1, -1.1"] * 50
+        mdata = TextIO("\n".join(data))
+
+        converters = {4: lambda x: "(%s)" % x.decode()}
+        kwargs = dict(delimiter=",", converters=converters,
+                      dtype=[(_, int) for _ in 'abcde'],)
+        assert_raises(ValueError, np.genfromtxt, mdata, **kwargs)
+
+    def test_default_field_format(self):
+        # Test default format
+        data = "0, 1, 2.3\n4, 5, 6.7"
+        mtest = np.genfromtxt(TextIO(data),
+                             delimiter=",", dtype=None, defaultfmt="f%02i")
+        ctrl = np.array([(0, 1, 2.3), (4, 5, 6.7)],
+                        dtype=[("f00", int), ("f01", int), ("f02", float)])
+        assert_equal(mtest, ctrl)
+
+    def test_single_dtype_wo_names(self):
+        # Test single dtype w/o names
+        data = "0, 1, 2.3\n4, 5, 6.7"
+        mtest = np.genfromtxt(TextIO(data),
+                             delimiter=",", dtype=float, defaultfmt="f%02i")
+        ctrl = np.array([[0., 1., 2.3], [4., 5., 6.7]], dtype=float)
+        assert_equal(mtest, ctrl)
+
+    def test_single_dtype_w_explicit_names(self):
+        # Test single dtype w explicit names
+        data = "0, 1, 2.3\n4, 5, 6.7"
+        mtest = np.genfromtxt(TextIO(data),
+                             delimiter=",", dtype=float, names="a, b, c")
+        ctrl = np.array([(0., 1., 2.3), (4., 5., 6.7)],
+                        dtype=[(_, float) for _ in "abc"])
+        assert_equal(mtest, ctrl)
+
+    def test_single_dtype_w_implicit_names(self):
+        # Test single dtype w implicit names
+        data = "a, b, c\n0, 1, 2.3\n4, 5, 6.7"
+        mtest = np.genfromtxt(TextIO(data),
+                             delimiter=",", dtype=float, names=True)
+        ctrl = np.array([(0., 1., 2.3), (4., 5., 6.7)],
+                        dtype=[(_, float) for _ in "abc"])
+        assert_equal(mtest, ctrl)
+
+    def test_easy_structured_dtype(self):
+        # Test easy structured dtype
+        data = "0, 1, 2.3\n4, 5, 6.7"
+        mtest = np.genfromtxt(TextIO(data), delimiter=",",
+                             dtype=(int, float, float), defaultfmt="f_%02i")
+        ctrl = np.array([(0, 1., 2.3), (4, 5., 6.7)],
+                        dtype=[("f_00", int), ("f_01", float), ("f_02", float)])
+        assert_equal(mtest, ctrl)
+
+    def test_autostrip(self):
+        # Test autostrip
+        data = "01/01/2003  , 1.3,   abcde"
+        kwargs = dict(delimiter=",", dtype=None)
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            mtest = np.genfromtxt(TextIO(data), **kwargs)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        ctrl = np.array([('01/01/2003  ', 1.3, '   abcde')],
+                        dtype=[('f0', '|S12'), ('f1', float), ('f2', '|S8')])
+        assert_equal(mtest, ctrl)
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            mtest = np.genfromtxt(TextIO(data), autostrip=True, **kwargs)
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        ctrl = np.array([('01/01/2003', 1.3, 'abcde')],
+                        dtype=[('f0', '|S10'), ('f1', float), ('f2', '|S5')])
+        assert_equal(mtest, ctrl)
+
+    def test_replace_space(self):
+        # Test the 'replace_space' option
+        txt = "A.A, B (B), C:C\n1, 2, 3.14"
+        # Test default: replace ' ' by '_' and delete non-alphanum chars
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=None)
+        ctrl_dtype = [("AA", int), ("B_B", int), ("CC", float)]
+        ctrl = np.array((1, 2, 3.14), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+        # Test: no replace, no delete
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=None,
+                             replace_space='', deletechars='')
+        ctrl_dtype = [("A.A", int), ("B (B)", int), ("C:C", float)]
+        ctrl = np.array((1, 2, 3.14), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+        # Test: no delete (spaces are replaced by _)
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=None,
+                             deletechars='')
+        ctrl_dtype = [("A.A", int), ("B_(B)", int), ("C:C", float)]
+        ctrl = np.array((1, 2, 3.14), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+
+    def test_replace_space_known_dtype(self):
+        # Test the 'replace_space' (and related) options when dtype != None
+        txt = "A.A, B (B), C:C\n1, 2, 3"
+        # Test default: replace ' ' by '_' and delete non-alphanum chars
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=int)
+        ctrl_dtype = [("AA", int), ("B_B", int), ("CC", int)]
+        ctrl = np.array((1, 2, 3), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+        # Test: no replace, no delete
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=int,
+                             replace_space='', deletechars='')
+        ctrl_dtype = [("A.A", int), ("B (B)", int), ("C:C", int)]
+        ctrl = np.array((1, 2, 3), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+        # Test: no delete (spaces are replaced by _)
+        test = np.genfromtxt(TextIO(txt),
+                             delimiter=",", names=True, dtype=int,
+                             deletechars='')
+        ctrl_dtype = [("A.A", int), ("B_(B)", int), ("C:C", int)]
+        ctrl = np.array((1, 2, 3), dtype=ctrl_dtype)
+        assert_equal(test, ctrl)
+
+    def test_incomplete_names(self):
+        # Test w/ incomplete names
+        data = "A,,C\n0,1,2\n3,4,5"
+        kwargs = dict(delimiter=",", names=True)
+        # w/ dtype=None
+        ctrl = np.array([(0, 1, 2), (3, 4, 5)],
+                        dtype=[(_, int) for _ in ('A', 'f0', 'C')])
+        test = np.genfromtxt(TextIO(data), dtype=None, **kwargs)
+        assert_equal(test, ctrl)
+        # w/ default dtype
+        ctrl = np.array([(0, 1, 2), (3, 4, 5)],
+                        dtype=[(_, float) for _ in ('A', 'f0', 'C')])
+        test = np.genfromtxt(TextIO(data), **kwargs)
+
+    def test_names_auto_completion(self):
+        # Make sure that names are properly completed
+        data = "1 2 3\n 4 5 6"
+        test = np.genfromtxt(TextIO(data),
+                             dtype=(int, float, int), names="a")
+        ctrl = np.array([(1, 2, 3), (4, 5, 6)],
+                        dtype=[('a', int), ('f0', float), ('f1', int)])
+        assert_equal(test, ctrl)
+
+    def test_names_with_usecols_bug1636(self):
+        # Make sure we pick up the right names w/ usecols
+        data = "A,B,C,D,E\n0,1,2,3,4\n0,1,2,3,4\n0,1,2,3,4"
+        ctrl_names = ("A", "C", "E")
+        test = np.genfromtxt(TextIO(data),
+                             dtype=(int, int, int), delimiter=",",
+                             usecols=(0, 2, 4), names=True)
+        assert_equal(test.dtype.names, ctrl_names)
+        #
+        test = np.genfromtxt(TextIO(data),
+                             dtype=(int, int, int), delimiter=",",
+                             usecols=("A", "C", "E"), names=True)
+        assert_equal(test.dtype.names, ctrl_names)
+        #
+        test = np.genfromtxt(TextIO(data),
+                             dtype=int, delimiter=",",
+                             usecols=("A", "C", "E"), names=True)
+        assert_equal(test.dtype.names, ctrl_names)
+
+    def test_fixed_width_names(self):
+        # Test fix-width w/ names
+        data = "    A    B   C\n    0    1 2.3\n   45   67   9."
+        kwargs = dict(delimiter=(5, 5, 4), names=True, dtype=None)
+        ctrl = np.array([(0, 1, 2.3), (45, 67, 9.)],
+                        dtype=[('A', int), ('B', int), ('C', float)])
+        test = np.genfromtxt(TextIO(data), **kwargs)
+        assert_equal(test, ctrl)
+        #
+        kwargs = dict(delimiter=5, names=True, dtype=None)
+        ctrl = np.array([(0, 1, 2.3), (45, 67, 9.)],
+                        dtype=[('A', int), ('B', int), ('C', float)])
+        test = np.genfromtxt(TextIO(data), **kwargs)
+        assert_equal(test, ctrl)
+
+    def test_filling_values(self):
+        # Test missing values
+        data = b"1, 2, 3\n1, , 5\n0, 6, \n"
+        kwargs = dict(delimiter=",", dtype=None, filling_values=-999)
+        ctrl = np.array([[1, 2, 3], [1, -999, 5], [0, 6, -999]], dtype=int)
+        test = np.genfromtxt(TextIO(data), **kwargs)
+        assert_equal(test, ctrl)
+
+    def test_comments_is_none(self):
+        # Github issue 329 (None was previously being converted to 'None').
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(TextIO("test1,testNonetherestofthedata"),
+                                 dtype=None, comments=None, delimiter=',')
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        assert_equal(test[1], b'testNonetherestofthedata')
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(TextIO("test1, testNonetherestofthedata"),
+                                 dtype=None, comments=None, delimiter=',')
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        assert_equal(test[1], b' testNonetherestofthedata')
+
+    def test_latin1(self):
+        latin1 = b'\xf6\xfc\xf6'
+        norm = b"norm1,norm2,norm3\n"
+        enc = b"test1,testNonethe" + latin1 + b",test3\n"
+        s = norm + enc + norm
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(TextIO(s),
+                                 dtype=None, comments=None, delimiter=',')
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        assert_equal(test[1, 0], b"test1")
+        assert_equal(test[1, 1], b"testNonethe" + latin1)
+        assert_equal(test[1, 2], b"test3")
+        test = np.genfromtxt(TextIO(s),
+                             dtype=None, comments=None, delimiter=',',
+                             encoding='latin1')
+        assert_equal(test[1, 0], u"test1")
+        assert_equal(test[1, 1], u"testNonethe" + latin1.decode('latin1'))
+        assert_equal(test[1, 2], u"test3")
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(TextIO(b"0,testNonethe" + latin1),
+                                 dtype=None, comments=None, delimiter=',')
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        assert_equal(test['f0'], 0)
+        assert_equal(test['f1'], b"testNonethe" + latin1)
+
+    def test_binary_decode_autodtype(self):
+        utf16 = b'\xff\xfeh\x04 \x00i\x04 \x00j\x04'
+        v = self.loadfunc(BytesIO(utf16), dtype=None, encoding='UTF-16')
+        assert_array_equal(v, np.array(utf16.decode('UTF-16').split()))
+
+    def test_utf8_byte_encoding(self):
+        utf8 = b"\xcf\x96"
+        norm = b"norm1,norm2,norm3\n"
+        enc = b"test1,testNonethe" + utf8 + b",test3\n"
+        s = norm + enc + norm
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', np.VisibleDeprecationWarning)
+            test = np.genfromtxt(TextIO(s),
+                                 dtype=None, comments=None, delimiter=',')
+            assert_(w[0].category is np.VisibleDeprecationWarning)
+        ctl = np.array([
+                 [b'norm1', b'norm2', b'norm3'],
+                 [b'test1', b'testNonethe' + utf8, b'test3'],
+                 [b'norm1', b'norm2', b'norm3']])
+        assert_array_equal(test, ctl)
+
+    def test_utf8_file(self):
+        utf8 = b"\xcf\x96"
+        with temppath() as path:
+            with open(path, "wb") as f:
+                f.write((b"test1,testNonethe" + utf8 + b",test3\n") * 2)
+            test = np.genfromtxt(path, dtype=None, comments=None,
+                                 delimiter=',', encoding="UTF-8")
+            ctl = np.array([
+                     ["test1", "testNonethe" + utf8.decode("UTF-8"), "test3"],
+                     ["test1", "testNonethe" + utf8.decode("UTF-8"), "test3"]],
+                     dtype=np.unicode_)
+            assert_array_equal(test, ctl)
+
+            # test a mixed dtype
+            with open(path, "wb") as f:
+                f.write(b"0,testNonethe" + utf8)
+            test = np.genfromtxt(path, dtype=None, comments=None,
+                                 delimiter=',', encoding="UTF-8")
+            assert_equal(test['f0'], 0)
+            assert_equal(test['f1'], "testNonethe" + utf8.decode("UTF-8"))
+
+    def test_utf8_file_nodtype_unicode(self):
+        # bytes encoding with non-latin1 -> unicode upcast
+        utf8 = u'\u03d6'
+        latin1 = u'\xf6\xfc\xf6'
+
+        # skip test if cannot encode utf8 test string with preferred
+        # encoding. The preferred encoding is assumed to be the default
+        # encoding of io.open. Will need to change this for PyTest, maybe
+        # using pytest.mark.xfail(raises=***).
+        try:
+            encoding = locale.getpreferredencoding()
+            utf8.encode(encoding)
+        except (UnicodeError, ImportError):
+            pytest.skip('Skipping test_utf8_file_nodtype_unicode, '
+                        'unable to encode utf8 in preferred encoding')
+
+        with temppath() as path:
+            with io.open(path, "wt") as f:
+                f.write(u"norm1,norm2,norm3\n")
+                f.write(u"norm1," + latin1 + u",norm3\n")
+                f.write(u"test1,testNonethe" + utf8 + u",test3\n")
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings('always', '',
+                                        np.VisibleDeprecationWarning)
+                test = np.genfromtxt(path, dtype=None, comments=None,
+                                     delimiter=',')
+                # Check for warning when encoding not specified.
+                assert_(w[0].category is np.VisibleDeprecationWarning)
+            ctl = np.array([
+                     ["norm1", "norm2", "norm3"],
+                     ["norm1", latin1, "norm3"],
+                     ["test1", "testNonethe" + utf8, "test3"]],
+                     dtype=np.unicode_)
+            assert_array_equal(test, ctl)
+
+    def test_recfromtxt(self):
+        #
+        data = TextIO('A,B\n0,1\n2,3')
+        kwargs = dict(delimiter=",", missing_values="N/A", names=True)
+        test = np.recfromtxt(data, **kwargs)
+        control = np.array([(0, 1), (2, 3)],
+                           dtype=[('A', int), ('B', int)])
+        assert_(isinstance(test, np.recarray))
+        assert_equal(test, control)
+        #
+        data = TextIO('A,B\n0,1\n2,N/A')
+        test = np.recfromtxt(data, dtype=None, usemask=True, **kwargs)
+        control = ma.array([(0, 1), (2, -1)],
+                           mask=[(False, False), (False, True)],
+                           dtype=[('A', int), ('B', int)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        assert_equal(test.A, [0, 2])
+
+    def test_recfromcsv(self):
+        #
+        data = TextIO('A,B\n0,1\n2,3')
+        kwargs = dict(missing_values="N/A", names=True, case_sensitive=True)
+        test = np.recfromcsv(data, dtype=None, **kwargs)
+        control = np.array([(0, 1), (2, 3)],
+                           dtype=[('A', int), ('B', int)])
+        assert_(isinstance(test, np.recarray))
+        assert_equal(test, control)
+        #
+        data = TextIO('A,B\n0,1\n2,N/A')
+        test = np.recfromcsv(data, dtype=None, usemask=True, **kwargs)
+        control = ma.array([(0, 1), (2, -1)],
+                           mask=[(False, False), (False, True)],
+                           dtype=[('A', int), ('B', int)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        assert_equal(test.A, [0, 2])
+        #
+        data = TextIO('A,B\n0,1\n2,3')
+        test = np.recfromcsv(data, missing_values='N/A',)
+        control = np.array([(0, 1), (2, 3)],
+                           dtype=[('a', int), ('b', int)])
+        assert_(isinstance(test, np.recarray))
+        assert_equal(test, control)
+        #
+        data = TextIO('A,B\n0,1\n2,3')
+        dtype = [('a', int), ('b', float)]
+        test = np.recfromcsv(data, missing_values='N/A', dtype=dtype)
+        control = np.array([(0, 1), (2, 3)],
+                           dtype=dtype)
+        assert_(isinstance(test, np.recarray))
+        assert_equal(test, control)
+
+        #gh-10394
+        data = TextIO('color\n"red"\n"blue"')
+        test = np.recfromcsv(data, converters={0: lambda x: x.strip(b'\"')})
+        control = np.array([('red',), ('blue',)], dtype=[('color', (bytes, 4))])
+        assert_equal(test.dtype, control.dtype)
+        assert_equal(test, control)
+
+    def test_max_rows(self):
+        # Test the `max_rows` keyword argument.
+        data = '1 2\n3 4\n5 6\n7 8\n9 10\n'
+        txt = TextIO(data)
+        a1 = np.genfromtxt(txt, max_rows=3)
+        a2 = np.genfromtxt(txt)
+        assert_equal(a1, [[1, 2], [3, 4], [5, 6]])
+        assert_equal(a2, [[7, 8], [9, 10]])
+
+        # max_rows must be at least 1.
+        assert_raises(ValueError, np.genfromtxt, TextIO(data), max_rows=0)
+
+        # An input with several invalid rows.
+        data = '1 1\n2 2\n0 \n3 3\n4 4\n5  \n6  \n7  \n'
+
+        test = np.genfromtxt(TextIO(data), max_rows=2)
+        control = np.array([[1., 1.], [2., 2.]])
+        assert_equal(test, control)
+
+        # Test keywords conflict
+        assert_raises(ValueError, np.genfromtxt, TextIO(data), skip_footer=1,
+                      max_rows=4)
+
+        # Test with invalid value
+        assert_raises(ValueError, np.genfromtxt, TextIO(data), max_rows=4)
+
+        # Test with invalid not raise
+        with suppress_warnings() as sup:
+            sup.filter(ConversionWarning)
+
+            test = np.genfromtxt(TextIO(data), max_rows=4, invalid_raise=False)
+            control = np.array([[1., 1.], [2., 2.], [3., 3.], [4., 4.]])
+            assert_equal(test, control)
+
+            test = np.genfromtxt(TextIO(data), max_rows=5, invalid_raise=False)
+            control = np.array([[1., 1.], [2., 2.], [3., 3.], [4., 4.]])
+            assert_equal(test, control)
+
+        # Structured array with field names.
+        data = 'a b\n#c d\n1 1\n2 2\n#0 \n3 3\n4 4\n5  5\n'
+
+        # Test with header, names and comments
+        txt = TextIO(data)
+        test = np.genfromtxt(txt, skip_header=1, max_rows=3, names=True)
+        control = np.array([(1.0, 1.0), (2.0, 2.0), (3.0, 3.0)],
+                      dtype=[('c', '<f8'), ('d', '<f8')])
+        assert_equal(test, control)
+        # To continue reading the same "file", don't use skip_header or
+        # names, and use the previously determined dtype.
+        test = np.genfromtxt(txt, max_rows=None, dtype=test.dtype)
+        control = np.array([(4.0, 4.0), (5.0, 5.0)],
+                      dtype=[('c', '<f8'), ('d', '<f8')])
+        assert_equal(test, control)
+
+    def test_gft_using_filename(self):
+        # Test that we can load data from a filename as well as a file
+        # object
+        tgt = np.arange(6).reshape((2, 3))
+        linesep = ('\n', '\r\n', '\r')
+
+        for sep in linesep:
+            data = '0 1 2' + sep + '3 4 5'
+            with temppath() as name:
+                with open(name, 'w') as f:
+                    f.write(data)
+                res = np.genfromtxt(name)
+            assert_array_equal(res, tgt)
+
+    def test_gft_from_gzip(self):
+        # Test that we can load data from a gzipped file
+        wanted = np.arange(6).reshape((2, 3))
+        linesep = ('\n', '\r\n', '\r')
+
+        for sep in linesep:
+            data = '0 1 2' + sep + '3 4 5'
+            s = BytesIO()
+            with gzip.GzipFile(fileobj=s, mode='w') as g:
+                g.write(asbytes(data))
+
+            with temppath(suffix='.gz2') as name:
+                with open(name, 'w') as f:
+                    f.write(data)
+                assert_array_equal(np.genfromtxt(name), wanted)
+
+    def test_gft_using_generator(self):
+        # gft doesn't work with unicode.
+        def count():
+            for i in range(10):
+                yield asbytes("%d" % i)
+
+        res = np.genfromtxt(count())
+        assert_array_equal(res, np.arange(10))
+
+    def test_auto_dtype_largeint(self):
+        # Regression test for numpy/numpy#5635 whereby large integers could
+        # cause OverflowErrors.
+
+        # Test the automatic definition of the output dtype
+        #
+        # 2**66 = 73786976294838206464 => should convert to float
+        # 2**34 = 17179869184 => should convert to int64
+        # 2**10 = 1024 => should convert to int (int32 on 32-bit systems,
+        #                 int64 on 64-bit systems)
+
+        data = TextIO('73786976294838206464 17179869184 1024')
+
+        test = np.genfromtxt(data, dtype=None)
+
+        assert_equal(test.dtype.names, ['f0', 'f1', 'f2'])
+
+        assert_(test.dtype['f0'] == float)
+        assert_(test.dtype['f1'] == np.int64)
+        assert_(test.dtype['f2'] == np.int_)
+
+        assert_allclose(test['f0'], 73786976294838206464.)
+        assert_equal(test['f1'], 17179869184)
+        assert_equal(test['f2'], 1024)
+
+
+class TestPathUsage:
+    # Test that pathlib.Path can be used
+    def test_loadtxt(self):
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            a = np.array([[1.1, 2], [3, 4]])
+            np.savetxt(path, a)
+            x = np.loadtxt(path)
+            assert_array_equal(x, a)
+
+    def test_save_load(self):
+        # Test that pathlib.Path instances can be used with save.
+        with temppath(suffix='.npy') as path:
+            path = Path(path)
+            a = np.array([[1, 2], [3, 4]], int)
+            np.save(path, a)
+            data = np.load(path)
+            assert_array_equal(data, a)
+
+    def test_save_load_memmap(self):
+        # Test that pathlib.Path instances can be loaded mem-mapped.
+        with temppath(suffix='.npy') as path:
+            path = Path(path)
+            a = np.array([[1, 2], [3, 4]], int)
+            np.save(path, a)
+            data = np.load(path, mmap_mode='r')
+            assert_array_equal(data, a)
+            # close the mem-mapped file
+            del data
+
+    def test_save_load_memmap_readwrite(self):
+        # Test that pathlib.Path instances can be written mem-mapped.
+        with temppath(suffix='.npy') as path:
+            path = Path(path)
+            a = np.array([[1, 2], [3, 4]], int)
+            np.save(path, a)
+            b = np.load(path, mmap_mode='r+')
+            a[0][0] = 5
+            b[0][0] = 5
+            del b  # closes the file
+            data = np.load(path)
+            assert_array_equal(data, a)
+
+    def test_savez_load(self):
+        # Test that pathlib.Path instances can be used with savez.
+        with temppath(suffix='.npz') as path:
+            path = Path(path)
+            np.savez(path, lab='place holder')
+            with np.load(path) as data:
+                assert_array_equal(data['lab'], 'place holder')
+
+    def test_savez_compressed_load(self):
+        # Test that pathlib.Path instances can be used with savez.
+        with temppath(suffix='.npz') as path:
+            path = Path(path)
+            np.savez_compressed(path, lab='place holder')
+            data = np.load(path)
+            assert_array_equal(data['lab'], 'place holder')
+            data.close()
+
+    def test_genfromtxt(self):
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            a = np.array([(1, 2), (3, 4)])
+            np.savetxt(path, a)
+            data = np.genfromtxt(path)
+            assert_array_equal(a, data)
+
+    def test_ndfromtxt(self):
+        # Test outputting a standard ndarray
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            with path.open('w') as f:
+                f.write(u'1 2\n3 4')
+
+            control = np.array([[1, 2], [3, 4]], dtype=int)
+            test = np.genfromtxt(path, dtype=int)
+            assert_array_equal(test, control)
+
+    def test_mafromtxt(self):
+        # From `test_fancy_dtype_alt` above
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            with path.open('w') as f:
+                f.write(u'1,2,3.0\n4,5,6.0\n')
+
+            test = np.genfromtxt(path, delimiter=',', usemask=True)
+            control = ma.array([(1.0, 2.0, 3.0), (4.0, 5.0, 6.0)])
+            assert_equal(test, control)
+
+    def test_recfromtxt(self):
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            with path.open('w') as f:
+                f.write(u'A,B\n0,1\n2,3')
+
+            kwargs = dict(delimiter=",", missing_values="N/A", names=True)
+            test = np.recfromtxt(path, **kwargs)
+            control = np.array([(0, 1), (2, 3)],
+                               dtype=[('A', int), ('B', int)])
+            assert_(isinstance(test, np.recarray))
+            assert_equal(test, control)
+
+    def test_recfromcsv(self):
+        with temppath(suffix='.txt') as path:
+            path = Path(path)
+            with path.open('w') as f:
+                f.write(u'A,B\n0,1\n2,3')
+
+            kwargs = dict(missing_values="N/A", names=True, case_sensitive=True)
+            test = np.recfromcsv(path, dtype=None, **kwargs)
+            control = np.array([(0, 1), (2, 3)],
+                               dtype=[('A', int), ('B', int)])
+            assert_(isinstance(test, np.recarray))
+            assert_equal(test, control)
+
+
+def test_gzip_load():
+    a = np.random.random((5, 5))
+
+    s = BytesIO()
+    f = gzip.GzipFile(fileobj=s, mode="w")
+
+    np.save(f, a)
+    f.close()
+    s.seek(0)
+
+    f = gzip.GzipFile(fileobj=s, mode="r")
+    assert_array_equal(np.load(f), a)
+
+
+# These next two classes encode the minimal API needed to save()/load() arrays.
+# The `test_ducktyping` ensures they work correctly
+class JustWriter:
+    def __init__(self, base):
+        self.base = base
+
+    def write(self, s):
+        return self.base.write(s)
+
+    def flush(self):
+        return self.base.flush()
+
+class JustReader:
+    def __init__(self, base):
+        self.base = base
+
+    def read(self, n):
+        return self.base.read(n)
+
+    def seek(self, off, whence=0):
+        return self.base.seek(off, whence)
+
+
+def test_ducktyping():
+    a = np.random.random((5, 5))
+
+    s = BytesIO()
+    f = JustWriter(s)
+
+    np.save(f, a)
+    f.flush()
+    s.seek(0)
+
+    f = JustReader(s)
+    assert_array_equal(np.load(f), a)
+
+
+
+def test_gzip_loadtxt():
+    # Thanks to another windows brokenness, we can't use
+    # NamedTemporaryFile: a file created from this function cannot be
+    # reopened by another open call. So we first put the gzipped string
+    # of the test reference array, write it to a securely opened file,
+    # which is then read from by the loadtxt function
+    s = BytesIO()
+    g = gzip.GzipFile(fileobj=s, mode='w')
+    g.write(b'1 2 3\n')
+    g.close()
+
+    s.seek(0)
+    with temppath(suffix='.gz') as name:
+        with open(name, 'wb') as f:
+            f.write(s.read())
+        res = np.loadtxt(name)
+    s.close()
+
+    assert_array_equal(res, [1, 2, 3])
+
+
+def test_gzip_loadtxt_from_string():
+    s = BytesIO()
+    f = gzip.GzipFile(fileobj=s, mode="w")
+    f.write(b'1 2 3\n')
+    f.close()
+    s.seek(0)
+
+    f = gzip.GzipFile(fileobj=s, mode="r")
+    assert_array_equal(np.loadtxt(f), [1, 2, 3])
+
+
+def test_npzfile_dict():
+    s = BytesIO()
+    x = np.zeros((3, 3))
+    y = np.zeros((3, 3))
+
+    np.savez(s, x=x, y=y)
+    s.seek(0)
+
+    z = np.load(s)
+
+    assert_('x' in z)
+    assert_('y' in z)
+    assert_('x' in z.keys())
+    assert_('y' in z.keys())
+
+    for f, a in z.items():
+        assert_(f in ['x', 'y'])
+        assert_equal(a.shape, (3, 3))
+
+    assert_(len(z.items()) == 2)
+
+    for f in z:
+        assert_(f in ['x', 'y'])
+
+    assert_('x' in z.keys())
+
+
+@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+def test_load_refcount():
+    # Check that objects returned by np.load are directly freed based on
+    # their refcount, rather than needing the gc to collect them.
+
+    f = BytesIO()
+    np.savez(f, [1, 2, 3])
+    f.seek(0)
+
+    with assert_no_gc_cycles():
+        np.load(f)
+
+    f.seek(0)
+    dt = [("a", 'u1', 2), ("b", 'u1', 2)]
+    with assert_no_gc_cycles():
+        x = np.loadtxt(TextIO("0 1 2 3"), dtype=dt)
+        assert_equal(x, np.array([((0, 1), (2, 3))], dtype=dt))
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_mixins.py b/venv/Lib/site-packages/numpy/lib/tests/test_mixins.py
new file mode 100644
index 000000000..632058763
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_mixins.py
@@ -0,0 +1,216 @@
+import numbers
+import operator
+
+import numpy as np
+from numpy.testing import assert_, assert_equal, assert_raises
+
+
+# NOTE: This class should be kept as an exact copy of the example from the
+# docstring for NDArrayOperatorsMixin.
+
+class ArrayLike(np.lib.mixins.NDArrayOperatorsMixin):
+    def __init__(self, value):
+        self.value = np.asarray(value)
+
+    # One might also consider adding the built-in list type to this
+    # list, to support operations like np.add(array_like, list)
+    _HANDLED_TYPES = (np.ndarray, numbers.Number)
+
+    def __array_ufunc__(self, ufunc, method, *inputs, **kwargs):
+        out = kwargs.get('out', ())
+        for x in inputs + out:
+            # Only support operations with instances of _HANDLED_TYPES.
+            # Use ArrayLike instead of type(self) for isinstance to
+            # allow subclasses that don't override __array_ufunc__ to
+            # handle ArrayLike objects.
+            if not isinstance(x, self._HANDLED_TYPES + (ArrayLike,)):
+                return NotImplemented
+
+        # Defer to the implementation of the ufunc on unwrapped values.
+        inputs = tuple(x.value if isinstance(x, ArrayLike) else x
+                       for x in inputs)
+        if out:
+            kwargs['out'] = tuple(
+                x.value if isinstance(x, ArrayLike) else x
+                for x in out)
+        result = getattr(ufunc, method)(*inputs, **kwargs)
+
+        if type(result) is tuple:
+            # multiple return values
+            return tuple(type(self)(x) for x in result)
+        elif method == 'at':
+            # no return value
+            return None
+        else:
+            # one return value
+            return type(self)(result)
+
+    def __repr__(self):
+        return '%s(%r)' % (type(self).__name__, self.value)
+
+
+def wrap_array_like(result):
+    if type(result) is tuple:
+        return tuple(ArrayLike(r) for r in result)
+    else:
+        return ArrayLike(result)
+
+
+def _assert_equal_type_and_value(result, expected, err_msg=None):
+    assert_equal(type(result), type(expected), err_msg=err_msg)
+    if isinstance(result, tuple):
+        assert_equal(len(result), len(expected), err_msg=err_msg)
+        for result_item, expected_item in zip(result, expected):
+            _assert_equal_type_and_value(result_item, expected_item, err_msg)
+    else:
+        assert_equal(result.value, expected.value, err_msg=err_msg)
+        assert_equal(getattr(result.value, 'dtype', None),
+                     getattr(expected.value, 'dtype', None), err_msg=err_msg)
+
+
+_ALL_BINARY_OPERATORS = [
+    operator.lt,
+    operator.le,
+    operator.eq,
+    operator.ne,
+    operator.gt,
+    operator.ge,
+    operator.add,
+    operator.sub,
+    operator.mul,
+    operator.truediv,
+    operator.floordiv,
+    operator.mod,
+    divmod,
+    pow,
+    operator.lshift,
+    operator.rshift,
+    operator.and_,
+    operator.xor,
+    operator.or_,
+]
+
+
+class TestNDArrayOperatorsMixin:
+
+    def test_array_like_add(self):
+
+        def check(result):
+            _assert_equal_type_and_value(result, ArrayLike(0))
+
+        check(ArrayLike(0) + 0)
+        check(0 + ArrayLike(0))
+
+        check(ArrayLike(0) + np.array(0))
+        check(np.array(0) + ArrayLike(0))
+
+        check(ArrayLike(np.array(0)) + 0)
+        check(0 + ArrayLike(np.array(0)))
+
+        check(ArrayLike(np.array(0)) + np.array(0))
+        check(np.array(0) + ArrayLike(np.array(0)))
+
+    def test_inplace(self):
+        array_like = ArrayLike(np.array([0]))
+        array_like += 1
+        _assert_equal_type_and_value(array_like, ArrayLike(np.array([1])))
+
+        array = np.array([0])
+        array += ArrayLike(1)
+        _assert_equal_type_and_value(array, ArrayLike(np.array([1])))
+
+    def test_opt_out(self):
+
+        class OptOut:
+            """Object that opts out of __array_ufunc__."""
+            __array_ufunc__ = None
+
+            def __add__(self, other):
+                return self
+
+            def __radd__(self, other):
+                return self
+
+        array_like = ArrayLike(1)
+        opt_out = OptOut()
+
+        # supported operations
+        assert_(array_like + opt_out is opt_out)
+        assert_(opt_out + array_like is opt_out)
+
+        # not supported
+        with assert_raises(TypeError):
+            # don't use the Python default, array_like = array_like + opt_out
+            array_like += opt_out
+        with assert_raises(TypeError):
+            array_like - opt_out
+        with assert_raises(TypeError):
+            opt_out - array_like
+
+    def test_subclass(self):
+
+        class SubArrayLike(ArrayLike):
+            """Should take precedence over ArrayLike."""
+
+        x = ArrayLike(0)
+        y = SubArrayLike(1)
+        _assert_equal_type_and_value(x + y, y)
+        _assert_equal_type_and_value(y + x, y)
+
+    def test_object(self):
+        x = ArrayLike(0)
+        obj = object()
+        with assert_raises(TypeError):
+            x + obj
+        with assert_raises(TypeError):
+            obj + x
+        with assert_raises(TypeError):
+            x += obj
+
+    def test_unary_methods(self):
+        array = np.array([-1, 0, 1, 2])
+        array_like = ArrayLike(array)
+        for op in [operator.neg,
+                   operator.pos,
+                   abs,
+                   operator.invert]:
+            _assert_equal_type_and_value(op(array_like), ArrayLike(op(array)))
+
+    def test_forward_binary_methods(self):
+        array = np.array([-1, 0, 1, 2])
+        array_like = ArrayLike(array)
+        for op in _ALL_BINARY_OPERATORS:
+            expected = wrap_array_like(op(array, 1))
+            actual = op(array_like, 1)
+            err_msg = 'failed for operator {}'.format(op)
+            _assert_equal_type_and_value(expected, actual, err_msg=err_msg)
+
+    def test_reflected_binary_methods(self):
+        for op in _ALL_BINARY_OPERATORS:
+            expected = wrap_array_like(op(2, 1))
+            actual = op(2, ArrayLike(1))
+            err_msg = 'failed for operator {}'.format(op)
+            _assert_equal_type_and_value(expected, actual, err_msg=err_msg)
+
+    def test_matmul(self):
+        array = np.array([1, 2], dtype=np.float64)
+        array_like = ArrayLike(array)
+        expected = ArrayLike(np.float64(5))
+        _assert_equal_type_and_value(expected, np.matmul(array_like, array))
+        _assert_equal_type_and_value(
+            expected, operator.matmul(array_like, array))
+        _assert_equal_type_and_value(
+            expected, operator.matmul(array, array_like))
+
+    def test_ufunc_at(self):
+        array = ArrayLike(np.array([1, 2, 3, 4]))
+        assert_(np.negative.at(array, np.array([0, 1])) is None)
+        _assert_equal_type_and_value(array, ArrayLike([-1, -2, 3, 4]))
+
+    def test_ufunc_two_outputs(self):
+        mantissa, exponent = np.frexp(2 ** -3)
+        expected = (ArrayLike(mantissa), ArrayLike(exponent))
+        _assert_equal_type_and_value(
+            np.frexp(ArrayLike(2 ** -3)), expected)
+        _assert_equal_type_and_value(
+            np.frexp(ArrayLike(np.array(2 ** -3))), expected)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_nanfunctions.py b/venv/Lib/site-packages/numpy/lib/tests/test_nanfunctions.py
new file mode 100644
index 000000000..db563e30c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_nanfunctions.py
@@ -0,0 +1,980 @@
+import warnings
+import pytest
+
+import numpy as np
+from numpy.lib.nanfunctions import _nan_mask, _replace_nan
+from numpy.testing import (
+    assert_, assert_equal, assert_almost_equal, assert_no_warnings,
+    assert_raises, assert_array_equal, suppress_warnings
+    )
+
+
+# Test data
+_ndat = np.array([[0.6244, np.nan, 0.2692, 0.0116, np.nan, 0.1170],
+                  [0.5351, -0.9403, np.nan, 0.2100, 0.4759, 0.2833],
+                  [np.nan, np.nan, np.nan, 0.1042, np.nan, -0.5954],
+                  [0.1610, np.nan, np.nan, 0.1859, 0.3146, np.nan]])
+
+
+# Rows of _ndat with nans removed
+_rdat = [np.array([0.6244, 0.2692, 0.0116, 0.1170]),
+         np.array([0.5351, -0.9403, 0.2100, 0.4759, 0.2833]),
+         np.array([0.1042, -0.5954]),
+         np.array([0.1610, 0.1859, 0.3146])]
+
+# Rows of _ndat with nans converted to ones
+_ndat_ones = np.array([[0.6244, 1.0, 0.2692, 0.0116, 1.0, 0.1170],
+                       [0.5351, -0.9403, 1.0, 0.2100, 0.4759, 0.2833],
+                       [1.0, 1.0, 1.0, 0.1042, 1.0, -0.5954],
+                       [0.1610, 1.0, 1.0, 0.1859, 0.3146, 1.0]])
+
+# Rows of _ndat with nans converted to zeros
+_ndat_zeros = np.array([[0.6244, 0.0, 0.2692, 0.0116, 0.0, 0.1170],
+                        [0.5351, -0.9403, 0.0, 0.2100, 0.4759, 0.2833],
+                        [0.0, 0.0, 0.0, 0.1042, 0.0, -0.5954],
+                        [0.1610, 0.0, 0.0, 0.1859, 0.3146, 0.0]])
+
+
+class TestNanFunctions_MinMax:
+
+    nanfuncs = [np.nanmin, np.nanmax]
+    stdfuncs = [np.min, np.max]
+
+    def test_mutation(self):
+        # Check that passed array is not modified.
+        ndat = _ndat.copy()
+        for f in self.nanfuncs:
+            f(ndat)
+            assert_equal(ndat, _ndat)
+
+    def test_keepdims(self):
+        mat = np.eye(3)
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for axis in [None, 0, 1]:
+                tgt = rf(mat, axis=axis, keepdims=True)
+                res = nf(mat, axis=axis, keepdims=True)
+                assert_(res.ndim == tgt.ndim)
+
+    def test_out(self):
+        mat = np.eye(3)
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            resout = np.zeros(3)
+            tgt = rf(mat, axis=1)
+            res = nf(mat, axis=1, out=resout)
+            assert_almost_equal(res, resout)
+            assert_almost_equal(res, tgt)
+
+    def test_dtype_from_input(self):
+        codes = 'efdgFDG'
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for c in codes:
+                mat = np.eye(3, dtype=c)
+                tgt = rf(mat, axis=1).dtype.type
+                res = nf(mat, axis=1).dtype.type
+                assert_(res is tgt)
+                # scalar case
+                tgt = rf(mat, axis=None).dtype.type
+                res = nf(mat, axis=None).dtype.type
+                assert_(res is tgt)
+
+    def test_result_values(self):
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            tgt = [rf(d) for d in _rdat]
+            res = nf(_ndat, axis=1)
+            assert_almost_equal(res, tgt)
+
+    def test_allnans(self):
+        mat = np.array([np.nan]*9).reshape(3, 3)
+        for f in self.nanfuncs:
+            for axis in [None, 0, 1]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_(np.isnan(f(mat, axis=axis)).all())
+                    assert_(len(w) == 1, 'no warning raised')
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+            # Check scalars
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_(np.isnan(f(np.nan)))
+                assert_(len(w) == 1, 'no warning raised')
+                assert_(issubclass(w[0].category, RuntimeWarning))
+
+    def test_masked(self):
+        mat = np.ma.fix_invalid(_ndat)
+        msk = mat._mask.copy()
+        for f in [np.nanmin]:
+            res = f(mat, axis=1)
+            tgt = f(_ndat, axis=1)
+            assert_equal(res, tgt)
+            assert_equal(mat._mask, msk)
+            assert_(not np.isinf(mat).any())
+
+    def test_scalar(self):
+        for f in self.nanfuncs:
+            assert_(f(0.) == 0.)
+
+    def test_subclass(self):
+        class MyNDArray(np.ndarray):
+            pass
+
+        # Check that it works and that type and
+        # shape are preserved
+        mine = np.eye(3).view(MyNDArray)
+        for f in self.nanfuncs:
+            res = f(mine, axis=0)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == (3,))
+            res = f(mine, axis=1)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == (3,))
+            res = f(mine)
+            assert_(res.shape == ())
+
+        # check that rows of nan are dealt with for subclasses (#4628)
+        mine[1] = np.nan
+        for f in self.nanfuncs:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                res = f(mine, axis=0)
+                assert_(isinstance(res, MyNDArray))
+                assert_(not np.any(np.isnan(res)))
+                assert_(len(w) == 0)
+
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                res = f(mine, axis=1)
+                assert_(isinstance(res, MyNDArray))
+                assert_(np.isnan(res[1]) and not np.isnan(res[0])
+                        and not np.isnan(res[2]))
+                assert_(len(w) == 1, 'no warning raised')
+                assert_(issubclass(w[0].category, RuntimeWarning))
+
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                res = f(mine)
+                assert_(res.shape == ())
+                assert_(res != np.nan)
+                assert_(len(w) == 0)
+
+    def test_object_array(self):
+        arr = np.array([[1.0, 2.0], [np.nan, 4.0], [np.nan, np.nan]], dtype=object)
+        assert_equal(np.nanmin(arr), 1.0)
+        assert_equal(np.nanmin(arr, axis=0), [1.0, 2.0])
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter('always')
+            # assert_equal does not work on object arrays of nan
+            assert_equal(list(np.nanmin(arr, axis=1)), [1.0, 4.0, np.nan])
+            assert_(len(w) == 1, 'no warning raised')
+            assert_(issubclass(w[0].category, RuntimeWarning))
+
+
+class TestNanFunctions_ArgminArgmax:
+
+    nanfuncs = [np.nanargmin, np.nanargmax]
+
+    def test_mutation(self):
+        # Check that passed array is not modified.
+        ndat = _ndat.copy()
+        for f in self.nanfuncs:
+            f(ndat)
+            assert_equal(ndat, _ndat)
+
+    def test_result_values(self):
+        for f, fcmp in zip(self.nanfuncs, [np.greater, np.less]):
+            for row in _ndat:
+                with suppress_warnings() as sup:
+                    sup.filter(RuntimeWarning, "invalid value encountered in")
+                    ind = f(row)
+                    val = row[ind]
+                    # comparing with NaN is tricky as the result
+                    # is always false except for NaN != NaN
+                    assert_(not np.isnan(val))
+                    assert_(not fcmp(val, row).any())
+                    assert_(not np.equal(val, row[:ind]).any())
+
+    def test_allnans(self):
+        mat = np.array([np.nan]*9).reshape(3, 3)
+        for f in self.nanfuncs:
+            for axis in [None, 0, 1]:
+                assert_raises(ValueError, f, mat, axis=axis)
+            assert_raises(ValueError, f, np.nan)
+
+    def test_empty(self):
+        mat = np.zeros((0, 3))
+        for f in self.nanfuncs:
+            for axis in [0, None]:
+                assert_raises(ValueError, f, mat, axis=axis)
+            for axis in [1]:
+                res = f(mat, axis=axis)
+                assert_equal(res, np.zeros(0))
+
+    def test_scalar(self):
+        for f in self.nanfuncs:
+            assert_(f(0.) == 0.)
+
+    def test_subclass(self):
+        class MyNDArray(np.ndarray):
+            pass
+
+        # Check that it works and that type and
+        # shape are preserved
+        mine = np.eye(3).view(MyNDArray)
+        for f in self.nanfuncs:
+            res = f(mine, axis=0)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == (3,))
+            res = f(mine, axis=1)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == (3,))
+            res = f(mine)
+            assert_(res.shape == ())
+
+
+class TestNanFunctions_IntTypes:
+
+    int_types = (np.int8, np.int16, np.int32, np.int64, np.uint8,
+                 np.uint16, np.uint32, np.uint64)
+
+    mat = np.array([127, 39, 93, 87, 46])
+
+    def integer_arrays(self):
+        for dtype in self.int_types:
+            yield self.mat.astype(dtype)
+
+    def test_nanmin(self):
+        tgt = np.min(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanmin(mat), tgt)
+
+    def test_nanmax(self):
+        tgt = np.max(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanmax(mat), tgt)
+
+    def test_nanargmin(self):
+        tgt = np.argmin(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanargmin(mat), tgt)
+
+    def test_nanargmax(self):
+        tgt = np.argmax(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanargmax(mat), tgt)
+
+    def test_nansum(self):
+        tgt = np.sum(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nansum(mat), tgt)
+
+    def test_nanprod(self):
+        tgt = np.prod(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanprod(mat), tgt)
+
+    def test_nancumsum(self):
+        tgt = np.cumsum(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nancumsum(mat), tgt)
+
+    def test_nancumprod(self):
+        tgt = np.cumprod(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nancumprod(mat), tgt)
+
+    def test_nanmean(self):
+        tgt = np.mean(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanmean(mat), tgt)
+
+    def test_nanvar(self):
+        tgt = np.var(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanvar(mat), tgt)
+
+        tgt = np.var(mat, ddof=1)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanvar(mat, ddof=1), tgt)
+
+    def test_nanstd(self):
+        tgt = np.std(self.mat)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanstd(mat), tgt)
+
+        tgt = np.std(self.mat, ddof=1)
+        for mat in self.integer_arrays():
+            assert_equal(np.nanstd(mat, ddof=1), tgt)
+
+
+class SharedNanFunctionsTestsMixin:
+    def test_mutation(self):
+        # Check that passed array is not modified.
+        ndat = _ndat.copy()
+        for f in self.nanfuncs:
+            f(ndat)
+            assert_equal(ndat, _ndat)
+
+    def test_keepdims(self):
+        mat = np.eye(3)
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for axis in [None, 0, 1]:
+                tgt = rf(mat, axis=axis, keepdims=True)
+                res = nf(mat, axis=axis, keepdims=True)
+                assert_(res.ndim == tgt.ndim)
+
+    def test_out(self):
+        mat = np.eye(3)
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            resout = np.zeros(3)
+            tgt = rf(mat, axis=1)
+            res = nf(mat, axis=1, out=resout)
+            assert_almost_equal(res, resout)
+            assert_almost_equal(res, tgt)
+
+    def test_dtype_from_dtype(self):
+        mat = np.eye(3)
+        codes = 'efdgFDG'
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for c in codes:
+                with suppress_warnings() as sup:
+                    if nf in {np.nanstd, np.nanvar} and c in 'FDG':
+                        # Giving the warning is a small bug, see gh-8000
+                        sup.filter(np.ComplexWarning)
+                    tgt = rf(mat, dtype=np.dtype(c), axis=1).dtype.type
+                    res = nf(mat, dtype=np.dtype(c), axis=1).dtype.type
+                    assert_(res is tgt)
+                    # scalar case
+                    tgt = rf(mat, dtype=np.dtype(c), axis=None).dtype.type
+                    res = nf(mat, dtype=np.dtype(c), axis=None).dtype.type
+                    assert_(res is tgt)
+
+    def test_dtype_from_char(self):
+        mat = np.eye(3)
+        codes = 'efdgFDG'
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for c in codes:
+                with suppress_warnings() as sup:
+                    if nf in {np.nanstd, np.nanvar} and c in 'FDG':
+                        # Giving the warning is a small bug, see gh-8000
+                        sup.filter(np.ComplexWarning)
+                    tgt = rf(mat, dtype=c, axis=1).dtype.type
+                    res = nf(mat, dtype=c, axis=1).dtype.type
+                    assert_(res is tgt)
+                    # scalar case
+                    tgt = rf(mat, dtype=c, axis=None).dtype.type
+                    res = nf(mat, dtype=c, axis=None).dtype.type
+                    assert_(res is tgt)
+
+    def test_dtype_from_input(self):
+        codes = 'efdgFDG'
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            for c in codes:
+                mat = np.eye(3, dtype=c)
+                tgt = rf(mat, axis=1).dtype.type
+                res = nf(mat, axis=1).dtype.type
+                assert_(res is tgt, "res %s, tgt %s" % (res, tgt))
+                # scalar case
+                tgt = rf(mat, axis=None).dtype.type
+                res = nf(mat, axis=None).dtype.type
+                assert_(res is tgt)
+
+    def test_result_values(self):
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            tgt = [rf(d) for d in _rdat]
+            res = nf(_ndat, axis=1)
+            assert_almost_equal(res, tgt)
+
+    def test_scalar(self):
+        for f in self.nanfuncs:
+            assert_(f(0.) == 0.)
+
+    def test_subclass(self):
+        class MyNDArray(np.ndarray):
+            pass
+
+        # Check that it works and that type and
+        # shape are preserved
+        array = np.eye(3)
+        mine = array.view(MyNDArray)
+        for f in self.nanfuncs:
+            expected_shape = f(array, axis=0).shape
+            res = f(mine, axis=0)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == expected_shape)
+            expected_shape = f(array, axis=1).shape
+            res = f(mine, axis=1)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == expected_shape)
+            expected_shape = f(array).shape
+            res = f(mine)
+            assert_(isinstance(res, MyNDArray))
+            assert_(res.shape == expected_shape)
+
+
+class TestNanFunctions_SumProd(SharedNanFunctionsTestsMixin):
+
+    nanfuncs = [np.nansum, np.nanprod]
+    stdfuncs = [np.sum, np.prod]
+
+    def test_allnans(self):
+        # Check for FutureWarning
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter('always')
+            res = np.nansum([np.nan]*3, axis=None)
+            assert_(res == 0, 'result is not 0')
+            assert_(len(w) == 0, 'warning raised')
+            # Check scalar
+            res = np.nansum(np.nan)
+            assert_(res == 0, 'result is not 0')
+            assert_(len(w) == 0, 'warning raised')
+            # Check there is no warning for not all-nan
+            np.nansum([0]*3, axis=None)
+            assert_(len(w) == 0, 'unwanted warning raised')
+
+    def test_empty(self):
+        for f, tgt_value in zip([np.nansum, np.nanprod], [0, 1]):
+            mat = np.zeros((0, 3))
+            tgt = [tgt_value]*3
+            res = f(mat, axis=0)
+            assert_equal(res, tgt)
+            tgt = []
+            res = f(mat, axis=1)
+            assert_equal(res, tgt)
+            tgt = tgt_value
+            res = f(mat, axis=None)
+            assert_equal(res, tgt)
+
+
+class TestNanFunctions_CumSumProd(SharedNanFunctionsTestsMixin):
+
+    nanfuncs = [np.nancumsum, np.nancumprod]
+    stdfuncs = [np.cumsum, np.cumprod]
+
+    def test_allnans(self):
+        for f, tgt_value in zip(self.nanfuncs, [0, 1]):
+            # Unlike other nan-functions, sum/prod/cumsum/cumprod don't warn on all nan input
+            with assert_no_warnings():
+                res = f([np.nan]*3, axis=None)
+                tgt = tgt_value*np.ones((3))
+                assert_(np.array_equal(res, tgt), 'result is not %s * np.ones((3))' % (tgt_value))
+                # Check scalar
+                res = f(np.nan)
+                tgt = tgt_value*np.ones((1))
+                assert_(np.array_equal(res, tgt), 'result is not %s * np.ones((1))' % (tgt_value))
+                # Check there is no warning for not all-nan
+                f([0]*3, axis=None)
+
+    def test_empty(self):
+        for f, tgt_value in zip(self.nanfuncs, [0, 1]):
+            mat = np.zeros((0, 3))
+            tgt = tgt_value*np.ones((0, 3))
+            res = f(mat, axis=0)
+            assert_equal(res, tgt)
+            tgt = mat
+            res = f(mat, axis=1)
+            assert_equal(res, tgt)
+            tgt = np.zeros((0))
+            res = f(mat, axis=None)
+            assert_equal(res, tgt)
+
+    def test_keepdims(self):
+        for f, g in zip(self.nanfuncs, self.stdfuncs):
+            mat = np.eye(3)
+            for axis in [None, 0, 1]:
+                tgt = f(mat, axis=axis, out=None)
+                res = g(mat, axis=axis, out=None)
+                assert_(res.ndim == tgt.ndim)
+
+        for f in self.nanfuncs:
+            d = np.ones((3, 5, 7, 11))
+            # Randomly set some elements to NaN:
+            rs = np.random.RandomState(0)
+            d[rs.rand(*d.shape) < 0.5] = np.nan
+            res = f(d, axis=None)
+            assert_equal(res.shape, (1155,))
+            for axis in np.arange(4):
+                res = f(d, axis=axis)
+                assert_equal(res.shape, (3, 5, 7, 11))
+
+    def test_result_values(self):
+        for axis in (-2, -1, 0, 1, None):
+            tgt = np.cumprod(_ndat_ones, axis=axis)
+            res = np.nancumprod(_ndat, axis=axis)
+            assert_almost_equal(res, tgt)
+            tgt = np.cumsum(_ndat_zeros,axis=axis)
+            res = np.nancumsum(_ndat, axis=axis)
+            assert_almost_equal(res, tgt)
+
+    def test_out(self):
+        mat = np.eye(3)
+        for nf, rf in zip(self.nanfuncs, self.stdfuncs):
+            resout = np.eye(3)
+            for axis in (-2, -1, 0, 1):
+                tgt = rf(mat, axis=axis)
+                res = nf(mat, axis=axis, out=resout)
+                assert_almost_equal(res, resout)
+                assert_almost_equal(res, tgt)
+
+
+class TestNanFunctions_MeanVarStd(SharedNanFunctionsTestsMixin):
+
+    nanfuncs = [np.nanmean, np.nanvar, np.nanstd]
+    stdfuncs = [np.mean, np.var, np.std]
+
+    def test_dtype_error(self):
+        for f in self.nanfuncs:
+            for dtype in [np.bool_, np.int_, np.object_]:
+                assert_raises(TypeError, f, _ndat, axis=1, dtype=dtype)
+
+    def test_out_dtype_error(self):
+        for f in self.nanfuncs:
+            for dtype in [np.bool_, np.int_, np.object_]:
+                out = np.empty(_ndat.shape[0], dtype=dtype)
+                assert_raises(TypeError, f, _ndat, axis=1, out=out)
+
+    def test_ddof(self):
+        nanfuncs = [np.nanvar, np.nanstd]
+        stdfuncs = [np.var, np.std]
+        for nf, rf in zip(nanfuncs, stdfuncs):
+            for ddof in [0, 1]:
+                tgt = [rf(d, ddof=ddof) for d in _rdat]
+                res = nf(_ndat, axis=1, ddof=ddof)
+                assert_almost_equal(res, tgt)
+
+    def test_ddof_too_big(self):
+        nanfuncs = [np.nanvar, np.nanstd]
+        stdfuncs = [np.var, np.std]
+        dsize = [len(d) for d in _rdat]
+        for nf, rf in zip(nanfuncs, stdfuncs):
+            for ddof in range(5):
+                with suppress_warnings() as sup:
+                    sup.record(RuntimeWarning)
+                    sup.filter(np.ComplexWarning)
+                    tgt = [ddof >= d for d in dsize]
+                    res = nf(_ndat, axis=1, ddof=ddof)
+                    assert_equal(np.isnan(res), tgt)
+                    if any(tgt):
+                        assert_(len(sup.log) == 1)
+                    else:
+                        assert_(len(sup.log) == 0)
+
+    def test_allnans(self):
+        mat = np.array([np.nan]*9).reshape(3, 3)
+        for f in self.nanfuncs:
+            for axis in [None, 0, 1]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_(np.isnan(f(mat, axis=axis)).all())
+                    assert_(len(w) == 1)
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+                    # Check scalar
+                    assert_(np.isnan(f(np.nan)))
+                    assert_(len(w) == 2)
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+
+    def test_empty(self):
+        mat = np.zeros((0, 3))
+        for f in self.nanfuncs:
+            for axis in [0, None]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_(np.isnan(f(mat, axis=axis)).all())
+                    assert_(len(w) == 1)
+                    assert_(issubclass(w[0].category, RuntimeWarning))
+            for axis in [1]:
+                with warnings.catch_warnings(record=True) as w:
+                    warnings.simplefilter('always')
+                    assert_equal(f(mat, axis=axis), np.zeros([]))
+                    assert_(len(w) == 0)
+
+
+class TestNanFunctions_Median:
+
+    def test_mutation(self):
+        # Check that passed array is not modified.
+        ndat = _ndat.copy()
+        np.nanmedian(ndat)
+        assert_equal(ndat, _ndat)
+
+    def test_keepdims(self):
+        mat = np.eye(3)
+        for axis in [None, 0, 1]:
+            tgt = np.median(mat, axis=axis, out=None, overwrite_input=False)
+            res = np.nanmedian(mat, axis=axis, out=None, overwrite_input=False)
+            assert_(res.ndim == tgt.ndim)
+
+        d = np.ones((3, 5, 7, 11))
+        # Randomly set some elements to NaN:
+        w = np.random.random((4, 200)) * np.array(d.shape)[:, None]
+        w = w.astype(np.intp)
+        d[tuple(w)] = np.nan
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning)
+            res = np.nanmedian(d, axis=None, keepdims=True)
+            assert_equal(res.shape, (1, 1, 1, 1))
+            res = np.nanmedian(d, axis=(0, 1), keepdims=True)
+            assert_equal(res.shape, (1, 1, 7, 11))
+            res = np.nanmedian(d, axis=(0, 3), keepdims=True)
+            assert_equal(res.shape, (1, 5, 7, 1))
+            res = np.nanmedian(d, axis=(1,), keepdims=True)
+            assert_equal(res.shape, (3, 1, 7, 11))
+            res = np.nanmedian(d, axis=(0, 1, 2, 3), keepdims=True)
+            assert_equal(res.shape, (1, 1, 1, 1))
+            res = np.nanmedian(d, axis=(0, 1, 3), keepdims=True)
+            assert_equal(res.shape, (1, 1, 7, 1))
+
+    def test_out(self):
+        mat = np.random.rand(3, 3)
+        nan_mat = np.insert(mat, [0, 2], np.nan, axis=1)
+        resout = np.zeros(3)
+        tgt = np.median(mat, axis=1)
+        res = np.nanmedian(nan_mat, axis=1, out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+        # 0-d output:
+        resout = np.zeros(())
+        tgt = np.median(mat, axis=None)
+        res = np.nanmedian(nan_mat, axis=None, out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+        res = np.nanmedian(nan_mat, axis=(0, 1), out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+
+    def test_small_large(self):
+        # test the small and large code paths, current cutoff 400 elements
+        for s in [5, 20, 51, 200, 1000]:
+            d = np.random.randn(4, s)
+            # Randomly set some elements to NaN:
+            w = np.random.randint(0, d.size, size=d.size // 5)
+            d.ravel()[w] = np.nan
+            d[:,0] = 1.  # ensure at least one good value
+            # use normal median without nans to compare
+            tgt = []
+            for x in d:
+                nonan = np.compress(~np.isnan(x), x)
+                tgt.append(np.median(nonan, overwrite_input=True))
+
+            assert_array_equal(np.nanmedian(d, axis=-1), tgt)
+
+    def test_result_values(self):
+            tgt = [np.median(d) for d in _rdat]
+            res = np.nanmedian(_ndat, axis=1)
+            assert_almost_equal(res, tgt)
+
+    def test_allnans(self):
+        mat = np.array([np.nan]*9).reshape(3, 3)
+        for axis in [None, 0, 1]:
+            with suppress_warnings() as sup:
+                sup.record(RuntimeWarning)
+
+                assert_(np.isnan(np.nanmedian(mat, axis=axis)).all())
+                if axis is None:
+                    assert_(len(sup.log) == 1)
+                else:
+                    assert_(len(sup.log) == 3)
+                # Check scalar
+                assert_(np.isnan(np.nanmedian(np.nan)))
+                if axis is None:
+                    assert_(len(sup.log) == 2)
+                else:
+                    assert_(len(sup.log) == 4)
+
+    def test_empty(self):
+        mat = np.zeros((0, 3))
+        for axis in [0, None]:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_(np.isnan(np.nanmedian(mat, axis=axis)).all())
+                assert_(len(w) == 1)
+                assert_(issubclass(w[0].category, RuntimeWarning))
+        for axis in [1]:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_equal(np.nanmedian(mat, axis=axis), np.zeros([]))
+                assert_(len(w) == 0)
+
+    def test_scalar(self):
+        assert_(np.nanmedian(0.) == 0.)
+
+    def test_extended_axis_invalid(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_raises(np.AxisError, np.nanmedian, d, axis=-5)
+        assert_raises(np.AxisError, np.nanmedian, d, axis=(0, -5))
+        assert_raises(np.AxisError, np.nanmedian, d, axis=4)
+        assert_raises(np.AxisError, np.nanmedian, d, axis=(0, 4))
+        assert_raises(ValueError, np.nanmedian, d, axis=(1, 1))
+
+    def test_float_special(self):
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning)
+            for inf in [np.inf, -np.inf]:
+                a = np.array([[inf,  np.nan], [np.nan, np.nan]])
+                assert_equal(np.nanmedian(a, axis=0), [inf,  np.nan])
+                assert_equal(np.nanmedian(a, axis=1), [inf,  np.nan])
+                assert_equal(np.nanmedian(a), inf)
+
+                # minimum fill value check
+                a = np.array([[np.nan, np.nan, inf],
+                             [np.nan, np.nan, inf]])
+                assert_equal(np.nanmedian(a), inf)
+                assert_equal(np.nanmedian(a, axis=0), [np.nan, np.nan, inf])
+                assert_equal(np.nanmedian(a, axis=1), inf)
+
+                # no mask path
+                a = np.array([[inf, inf], [inf, inf]])
+                assert_equal(np.nanmedian(a, axis=1), inf)
+
+                a = np.array([[inf, 7, -inf, -9],
+                              [-10, np.nan, np.nan, 5],
+                              [4, np.nan, np.nan, inf]],
+                              dtype=np.float32)
+                if inf > 0:
+                    assert_equal(np.nanmedian(a, axis=0), [4., 7., -inf, 5.])
+                    assert_equal(np.nanmedian(a), 4.5)
+                else:
+                    assert_equal(np.nanmedian(a, axis=0), [-10., 7., -inf, -9.])
+                    assert_equal(np.nanmedian(a), -2.5)
+                assert_equal(np.nanmedian(a, axis=-1), [-1., -2.5, inf])
+
+                for i in range(0, 10):
+                    for j in range(1, 10):
+                        a = np.array([([np.nan] * i) + ([inf] * j)] * 2)
+                        assert_equal(np.nanmedian(a), inf)
+                        assert_equal(np.nanmedian(a, axis=1), inf)
+                        assert_equal(np.nanmedian(a, axis=0),
+                                     ([np.nan] * i) + [inf] * j)
+
+                        a = np.array([([np.nan] * i) + ([-inf] * j)] * 2)
+                        assert_equal(np.nanmedian(a), -inf)
+                        assert_equal(np.nanmedian(a, axis=1), -inf)
+                        assert_equal(np.nanmedian(a, axis=0),
+                                     ([np.nan] * i) + [-inf] * j)
+
+
+class TestNanFunctions_Percentile:
+
+    def test_mutation(self):
+        # Check that passed array is not modified.
+        ndat = _ndat.copy()
+        np.nanpercentile(ndat, 30)
+        assert_equal(ndat, _ndat)
+
+    def test_keepdims(self):
+        mat = np.eye(3)
+        for axis in [None, 0, 1]:
+            tgt = np.percentile(mat, 70, axis=axis, out=None,
+                                overwrite_input=False)
+            res = np.nanpercentile(mat, 70, axis=axis, out=None,
+                                   overwrite_input=False)
+            assert_(res.ndim == tgt.ndim)
+
+        d = np.ones((3, 5, 7, 11))
+        # Randomly set some elements to NaN:
+        w = np.random.random((4, 200)) * np.array(d.shape)[:, None]
+        w = w.astype(np.intp)
+        d[tuple(w)] = np.nan
+        with suppress_warnings() as sup:
+            sup.filter(RuntimeWarning)
+            res = np.nanpercentile(d, 90, axis=None, keepdims=True)
+            assert_equal(res.shape, (1, 1, 1, 1))
+            res = np.nanpercentile(d, 90, axis=(0, 1), keepdims=True)
+            assert_equal(res.shape, (1, 1, 7, 11))
+            res = np.nanpercentile(d, 90, axis=(0, 3), keepdims=True)
+            assert_equal(res.shape, (1, 5, 7, 1))
+            res = np.nanpercentile(d, 90, axis=(1,), keepdims=True)
+            assert_equal(res.shape, (3, 1, 7, 11))
+            res = np.nanpercentile(d, 90, axis=(0, 1, 2, 3), keepdims=True)
+            assert_equal(res.shape, (1, 1, 1, 1))
+            res = np.nanpercentile(d, 90, axis=(0, 1, 3), keepdims=True)
+            assert_equal(res.shape, (1, 1, 7, 1))
+
+    def test_out(self):
+        mat = np.random.rand(3, 3)
+        nan_mat = np.insert(mat, [0, 2], np.nan, axis=1)
+        resout = np.zeros(3)
+        tgt = np.percentile(mat, 42, axis=1)
+        res = np.nanpercentile(nan_mat, 42, axis=1, out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+        # 0-d output:
+        resout = np.zeros(())
+        tgt = np.percentile(mat, 42, axis=None)
+        res = np.nanpercentile(nan_mat, 42, axis=None, out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+        res = np.nanpercentile(nan_mat, 42, axis=(0, 1), out=resout)
+        assert_almost_equal(res, resout)
+        assert_almost_equal(res, tgt)
+
+    def test_result_values(self):
+        tgt = [np.percentile(d, 28) for d in _rdat]
+        res = np.nanpercentile(_ndat, 28, axis=1)
+        assert_almost_equal(res, tgt)
+        # Transpose the array to fit the output convention of numpy.percentile
+        tgt = np.transpose([np.percentile(d, (28, 98)) for d in _rdat])
+        res = np.nanpercentile(_ndat, (28, 98), axis=1)
+        assert_almost_equal(res, tgt)
+
+    def test_allnans(self):
+        mat = np.array([np.nan]*9).reshape(3, 3)
+        for axis in [None, 0, 1]:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_(np.isnan(np.nanpercentile(mat, 60, axis=axis)).all())
+                if axis is None:
+                    assert_(len(w) == 1)
+                else:
+                    assert_(len(w) == 3)
+                assert_(issubclass(w[0].category, RuntimeWarning))
+                # Check scalar
+                assert_(np.isnan(np.nanpercentile(np.nan, 60)))
+                if axis is None:
+                    assert_(len(w) == 2)
+                else:
+                    assert_(len(w) == 4)
+                assert_(issubclass(w[0].category, RuntimeWarning))
+
+    def test_empty(self):
+        mat = np.zeros((0, 3))
+        for axis in [0, None]:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_(np.isnan(np.nanpercentile(mat, 40, axis=axis)).all())
+                assert_(len(w) == 1)
+                assert_(issubclass(w[0].category, RuntimeWarning))
+        for axis in [1]:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.simplefilter('always')
+                assert_equal(np.nanpercentile(mat, 40, axis=axis), np.zeros([]))
+                assert_(len(w) == 0)
+
+    def test_scalar(self):
+        assert_equal(np.nanpercentile(0., 100), 0.)
+        a = np.arange(6)
+        r = np.nanpercentile(a, 50, axis=0)
+        assert_equal(r, 2.5)
+        assert_(np.isscalar(r))
+
+    def test_extended_axis_invalid(self):
+        d = np.ones((3, 5, 7, 11))
+        assert_raises(np.AxisError, np.nanpercentile, d, q=5, axis=-5)
+        assert_raises(np.AxisError, np.nanpercentile, d, q=5, axis=(0, -5))
+        assert_raises(np.AxisError, np.nanpercentile, d, q=5, axis=4)
+        assert_raises(np.AxisError, np.nanpercentile, d, q=5, axis=(0, 4))
+        assert_raises(ValueError, np.nanpercentile, d, q=5, axis=(1, 1))
+
+    def test_multiple_percentiles(self):
+        perc = [50, 100]
+        mat = np.ones((4, 3))
+        nan_mat = np.nan * mat
+        # For checking consistency in higher dimensional case
+        large_mat = np.ones((3, 4, 5))
+        large_mat[:, 0:2:4, :] = 0
+        large_mat[:, :, 3:] *= 2
+        for axis in [None, 0, 1]:
+            for keepdim in [False, True]:
+                with suppress_warnings() as sup:
+                    sup.filter(RuntimeWarning, "All-NaN slice encountered")
+                    val = np.percentile(mat, perc, axis=axis, keepdims=keepdim)
+                    nan_val = np.nanpercentile(nan_mat, perc, axis=axis,
+                                               keepdims=keepdim)
+                    assert_equal(nan_val.shape, val.shape)
+
+                    val = np.percentile(large_mat, perc, axis=axis,
+                                        keepdims=keepdim)
+                    nan_val = np.nanpercentile(large_mat, perc, axis=axis,
+                                               keepdims=keepdim)
+                    assert_equal(nan_val, val)
+
+        megamat = np.ones((3, 4, 5, 6))
+        assert_equal(np.nanpercentile(megamat, perc, axis=(1, 2)).shape, (2, 3, 6))
+
+
+class TestNanFunctions_Quantile:
+    # most of this is already tested by TestPercentile
+
+    def test_regression(self):
+        ar = np.arange(24).reshape(2, 3, 4).astype(float)
+        ar[0][1] = np.nan
+
+        assert_equal(np.nanquantile(ar, q=0.5), np.nanpercentile(ar, q=50))
+        assert_equal(np.nanquantile(ar, q=0.5, axis=0),
+                     np.nanpercentile(ar, q=50, axis=0))
+        assert_equal(np.nanquantile(ar, q=0.5, axis=1),
+                     np.nanpercentile(ar, q=50, axis=1))
+        assert_equal(np.nanquantile(ar, q=[0.5], axis=1),
+                     np.nanpercentile(ar, q=[50], axis=1))
+        assert_equal(np.nanquantile(ar, q=[0.25, 0.5, 0.75], axis=1),
+                     np.nanpercentile(ar, q=[25, 50, 75], axis=1))
+
+    def test_basic(self):
+        x = np.arange(8) * 0.5
+        assert_equal(np.nanquantile(x, 0), 0.)
+        assert_equal(np.nanquantile(x, 1), 3.5)
+        assert_equal(np.nanquantile(x, 0.5), 1.75)
+
+    def test_no_p_overwrite(self):
+        # this is worth retesting, because quantile does not make a copy
+        p0 = np.array([0, 0.75, 0.25, 0.5, 1.0])
+        p = p0.copy()
+        np.nanquantile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, p0)
+
+        p0 = p0.tolist()
+        p = p.tolist()
+        np.nanquantile(np.arange(100.), p, interpolation="midpoint")
+        assert_array_equal(p, p0)
+
+@pytest.mark.parametrize("arr, expected", [
+    # array of floats with some nans
+    (np.array([np.nan, 5.0, np.nan, np.inf]),
+     np.array([False, True, False, True])),
+    # int64 array that can't possibly have nans
+    (np.array([1, 5, 7, 9], dtype=np.int64),
+     True),
+    # bool array that can't possibly have nans
+    (np.array([False, True, False, True]),
+     True),
+    # 2-D complex array with nans
+    (np.array([[np.nan, 5.0],
+               [np.nan, np.inf]], dtype=np.complex64),
+     np.array([[False, True],
+               [False, True]])),
+    ])
+def test__nan_mask(arr, expected):
+    for out in [None, np.empty(arr.shape, dtype=np.bool_)]:
+        actual = _nan_mask(arr, out=out)
+        assert_equal(actual, expected)
+        # the above won't distinguish between True proper
+        # and an array of True values; we want True proper
+        # for types that can't possibly contain NaN
+        if type(expected) is not np.ndarray:
+            assert actual is True
+
+
+def test__replace_nan():
+    """ Test that _replace_nan returns the original array if there are no
+    NaNs, not a copy.
+    """
+    for dtype in [np.bool, np.int32, np.int64]:
+        arr = np.array([0, 1], dtype=dtype)
+        result, mask = _replace_nan(arr, 0)
+        assert mask is None
+        # do not make a copy if there are no nans
+        assert result is arr
+
+    for dtype in [np.float32, np.float64]:
+        arr = np.array([0, 1], dtype=dtype)
+        result, mask = _replace_nan(arr, 2)
+        assert (mask == False).all()
+        # mask is not None, so we make a copy
+        assert result is not arr
+        assert_equal(result, arr)
+
+        arr_nan = np.array([0, 1, np.nan], dtype=dtype)
+        result_nan, mask_nan = _replace_nan(arr_nan, 2)
+        assert_equal(mask_nan, np.array([False, False, True]))
+        assert result_nan is not arr_nan
+        assert_equal(result_nan, np.array([0, 1, 2]))
+        assert np.isnan(arr_nan[-1])
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_packbits.py b/venv/Lib/site-packages/numpy/lib/tests/test_packbits.py
new file mode 100644
index 000000000..5b07f41c6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_packbits.py
@@ -0,0 +1,376 @@
+import numpy as np
+from numpy.testing import assert_array_equal, assert_equal, assert_raises
+import pytest
+from itertools import chain
+
+def test_packbits():
+    # Copied from the docstring.
+    a = [[[1, 0, 1], [0, 1, 0]],
+         [[1, 1, 0], [0, 0, 1]]]
+    for dt in '?bBhHiIlLqQ':
+        arr = np.array(a, dtype=dt)
+        b = np.packbits(arr, axis=-1)
+        assert_equal(b.dtype, np.uint8)
+        assert_array_equal(b, np.array([[[160], [64]], [[192], [32]]]))
+
+    assert_raises(TypeError, np.packbits, np.array(a, dtype=float))
+
+
+def test_packbits_empty():
+    shapes = [
+        (0,), (10, 20, 0), (10, 0, 20), (0, 10, 20), (20, 0, 0), (0, 20, 0),
+        (0, 0, 20), (0, 0, 0),
+    ]
+    for dt in '?bBhHiIlLqQ':
+        for shape in shapes:
+            a = np.empty(shape, dtype=dt)
+            b = np.packbits(a)
+            assert_equal(b.dtype, np.uint8)
+            assert_equal(b.shape, (0,))
+
+
+def test_packbits_empty_with_axis():
+    # Original shapes and lists of packed shapes for different axes.
+    shapes = [
+        ((0,), [(0,)]),
+        ((10, 20, 0), [(2, 20, 0), (10, 3, 0), (10, 20, 0)]),
+        ((10, 0, 20), [(2, 0, 20), (10, 0, 20), (10, 0, 3)]),
+        ((0, 10, 20), [(0, 10, 20), (0, 2, 20), (0, 10, 3)]),
+        ((20, 0, 0), [(3, 0, 0), (20, 0, 0), (20, 0, 0)]),
+        ((0, 20, 0), [(0, 20, 0), (0, 3, 0), (0, 20, 0)]),
+        ((0, 0, 20), [(0, 0, 20), (0, 0, 20), (0, 0, 3)]),
+        ((0, 0, 0), [(0, 0, 0), (0, 0, 0), (0, 0, 0)]),
+    ]
+    for dt in '?bBhHiIlLqQ':
+        for in_shape, out_shapes in shapes:
+            for ax, out_shape in enumerate(out_shapes):
+                a = np.empty(in_shape, dtype=dt)
+                b = np.packbits(a, axis=ax)
+                assert_equal(b.dtype, np.uint8)
+                assert_equal(b.shape, out_shape)
+
+@pytest.mark.parametrize('bitorder', ('little', 'big'))
+def test_packbits_large(bitorder):
+    # test data large enough for 16 byte vectorization
+    a = np.array([1, 1, 0, 1, 1, 1, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0,
+                  0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 1,
+                  1, 1, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0,
+                  1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 1, 1, 1,
+                  1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1,
+                  1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1,
+                  1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 1,
+                  0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1,
+                  1, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1, 0,
+                  1, 1, 0, 0, 0, 0, 1, 1, 1, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1,
+                  1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0,
+                  0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1,
+                  1, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0,
+                  1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0,
+                  1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0])
+    a = a.repeat(3)
+    for dtype in '?bBhHiIlLqQ':
+        arr = np.array(a, dtype=dtype)
+        b = np.packbits(arr, axis=None, bitorder=bitorder)
+        assert_equal(b.dtype, np.uint8)
+        r = [252, 127, 192, 3, 254, 7, 252, 0, 7, 31, 240, 0, 28, 1, 255, 252,
+             113, 248, 3, 255, 192, 28, 15, 192, 28, 126, 0, 224, 127, 255,
+             227, 142, 7, 31, 142, 63, 28, 126, 56, 227, 240, 0, 227, 128, 63,
+             224, 14, 56, 252, 112, 56, 255, 241, 248, 3, 240, 56, 224, 112,
+             63, 255, 255, 199, 224, 14, 0, 31, 143, 192, 3, 255, 199, 0, 1,
+             255, 224, 1, 255, 252, 126, 63, 0, 1, 192, 252, 14, 63, 0, 15,
+             199, 252, 113, 255, 3, 128, 56, 252, 14, 7, 0, 113, 255, 255, 142, 56, 227,
+             129, 248, 227, 129, 199, 31, 128]
+        if bitorder == 'big':
+            assert_array_equal(b, r)
+        # equal for size being multiple of 8
+        assert_array_equal(np.unpackbits(b, bitorder=bitorder)[:-4], a)
+
+        # check last byte of different remainders (16 byte vectorization)
+        b = [np.packbits(arr[:-i], axis=None)[-1] for i in range(1, 16)]
+        assert_array_equal(b, [128, 128, 128, 31, 30, 28, 24, 16, 0, 0, 0, 199,
+                               198, 196, 192])
+
+
+        arr = arr.reshape(36, 25)
+        b = np.packbits(arr, axis=0)
+        assert_equal(b.dtype, np.uint8)
+        assert_array_equal(b, [[190, 186, 178, 178, 150, 215, 87, 83, 83, 195,
+                                199, 206, 204, 204, 140, 140, 136, 136, 8, 40, 105,
+                                107, 75, 74, 88],
+                               [72, 216, 248, 241, 227, 195, 202, 90, 90, 83,
+                                83, 119, 127, 109, 73, 64, 208, 244, 189, 45,
+                                41, 104, 122, 90, 18],
+                               [113, 120, 248, 216, 152, 24, 60, 52, 182, 150,
+                                150, 150, 146, 210, 210, 246, 255, 255, 223,
+                                151, 21, 17, 17, 131, 163],
+                               [214, 210, 210, 64, 68, 5, 5, 1, 72, 88, 92,
+                                92, 78, 110, 39, 181, 149, 220, 222, 218, 218,
+                                202, 234, 170, 168],
+                               [0, 128, 128, 192, 80, 112, 48, 160, 160, 224,
+                                240, 208, 144, 128, 160, 224, 240, 208, 144,
+                                144, 176, 240, 224, 192, 128]])
+
+        b = np.packbits(arr, axis=1)
+        assert_equal(b.dtype, np.uint8)
+        assert_array_equal(b, [[252, 127, 192,   0],
+                               [  7, 252,  15, 128],
+                               [240,   0,  28,   0],
+                               [255, 128,   0, 128],
+                               [192,  31, 255, 128],
+                               [142,  63,   0,   0],
+                               [255, 240,   7,   0],
+                               [  7, 224,  14,   0],
+                               [126,   0, 224,   0],
+                               [255, 255, 199,   0],
+                               [ 56,  28, 126,   0],
+                               [113, 248, 227, 128],
+                               [227, 142,  63,   0],
+                               [  0,  28, 112,   0],
+                               [ 15, 248,   3, 128],
+                               [ 28, 126,  56,   0],
+                               [ 56, 255, 241, 128],
+                               [240,   7, 224,   0],
+                               [227, 129, 192, 128],
+                               [255, 255, 254,   0],
+                               [126,   0, 224,   0],
+                               [  3, 241, 248,   0],
+                               [  0, 255, 241, 128],
+                               [128,   0, 255, 128],
+                               [224,   1, 255, 128],
+                               [248, 252, 126,   0],
+                               [  0,   7,   3, 128],
+                               [224, 113, 248,   0],
+                               [  0, 252, 127, 128],
+                               [142,  63, 224,   0],
+                               [224,  14,  63,   0],
+                               [  7,   3, 128,   0],
+                               [113, 255, 255, 128],
+                               [ 28, 113, 199,   0],
+                               [  7, 227, 142,   0],
+                               [ 14,  56, 252,   0]])
+
+        arr = arr.T.copy()
+        b = np.packbits(arr, axis=0)
+        assert_equal(b.dtype, np.uint8)
+        assert_array_equal(b, [[252, 7, 240, 255, 192, 142, 255, 7, 126, 255,
+                                56, 113, 227, 0, 15, 28, 56, 240, 227, 255,
+                                126, 3, 0, 128, 224, 248, 0, 224, 0, 142, 224,
+                                7, 113, 28, 7, 14],
+                                [127, 252, 0, 128, 31, 63, 240, 224, 0, 255,
+                                 28, 248, 142, 28, 248, 126, 255, 7, 129, 255,
+                                 0, 241, 255, 0, 1, 252, 7, 113, 252, 63, 14,
+                                 3, 255, 113, 227, 56],
+                                [192, 15, 28, 0, 255, 0, 7, 14, 224, 199, 126,
+                                 227, 63, 112, 3, 56, 241, 224, 192, 254, 224,
+                                 248, 241, 255, 255, 126, 3, 248, 127, 224, 63,
+                                 128, 255, 199, 142, 252],
+                                [0, 128, 0, 128, 128, 0, 0, 0, 0, 0, 0, 128, 0,
+                                 0, 128, 0, 128, 0, 128, 0, 0, 0, 128, 128,
+                                 128, 0, 128, 0, 128, 0, 0, 0, 128, 0, 0, 0]])
+
+        b = np.packbits(arr, axis=1)
+        assert_equal(b.dtype, np.uint8)
+        assert_array_equal(b, [[190,  72, 113, 214,   0],
+                               [186, 216, 120, 210, 128],
+                               [178, 248, 248, 210, 128],
+                               [178, 241, 216,  64, 192],
+                               [150, 227, 152,  68,  80],
+                               [215, 195,  24,   5, 112],
+                               [ 87, 202,  60,   5,  48],
+                               [ 83,  90,  52,   1, 160],
+                               [ 83,  90, 182,  72, 160],
+                               [195,  83, 150,  88, 224],
+                               [199,  83, 150,  92, 240],
+                               [206, 119, 150,  92, 208],
+                               [204, 127, 146,  78, 144],
+                               [204, 109, 210, 110, 128],
+                               [140,  73, 210,  39, 160],
+                               [140,  64, 246, 181, 224],
+                               [136, 208, 255, 149, 240],
+                               [136, 244, 255, 220, 208],
+                               [  8, 189, 223, 222, 144],
+                               [ 40,  45, 151, 218, 144],
+                               [105,  41,  21, 218, 176],
+                               [107, 104,  17, 202, 240],
+                               [ 75, 122,  17, 234, 224],
+                               [ 74,  90, 131, 170, 192],
+                               [ 88,  18, 163, 168, 128]])
+
+
+    # result is the same if input is multiplied with a nonzero value
+    for dtype in 'bBhHiIlLqQ':
+        arr = np.array(a, dtype=dtype)
+        rnd = np.random.randint(low=np.iinfo(dtype).min,
+                                high=np.iinfo(dtype).max, size=arr.size,
+                                dtype=dtype)
+        rnd[rnd == 0] = 1
+        arr *= rnd.astype(dtype)
+        b = np.packbits(arr, axis=-1)
+        assert_array_equal(np.unpackbits(b)[:-4], a)
+
+    assert_raises(TypeError, np.packbits, np.array(a, dtype=float))
+
+
+def test_packbits_very_large():
+    # test some with a larger arrays gh-8637
+    # code is covered earlier but larger array makes crash on bug more likely
+    for s in range(950, 1050):
+        for dt in '?bBhHiIlLqQ':
+            x = np.ones((200, s), dtype=bool)
+            np.packbits(x, axis=1)
+
+
+def test_unpackbits():
+    # Copied from the docstring.
+    a = np.array([[2], [7], [23]], dtype=np.uint8)
+    b = np.unpackbits(a, axis=1)
+    assert_equal(b.dtype, np.uint8)
+    assert_array_equal(b, np.array([[0, 0, 0, 0, 0, 0, 1, 0],
+                                    [0, 0, 0, 0, 0, 1, 1, 1],
+                                    [0, 0, 0, 1, 0, 1, 1, 1]]))
+
+def test_pack_unpack_order():
+    a = np.array([[2], [7], [23]], dtype=np.uint8)
+    b = np.unpackbits(a, axis=1)
+    assert_equal(b.dtype, np.uint8)
+    b_little = np.unpackbits(a, axis=1, bitorder='little')
+    b_big = np.unpackbits(a, axis=1, bitorder='big')
+    assert_array_equal(b, b_big)
+    assert_array_equal(a, np.packbits(b_little, axis=1, bitorder='little'))
+    assert_array_equal(b[:,::-1], b_little)
+    assert_array_equal(a, np.packbits(b_big, axis=1, bitorder='big'))
+    assert_raises(ValueError, np.unpackbits, a, bitorder='r')
+    assert_raises(TypeError, np.unpackbits, a, bitorder=10)
+
+
+
+def test_unpackbits_empty():
+    a = np.empty((0,), dtype=np.uint8)
+    b = np.unpackbits(a)
+    assert_equal(b.dtype, np.uint8)
+    assert_array_equal(b, np.empty((0,)))
+
+
+def test_unpackbits_empty_with_axis():
+    # Lists of packed shapes for different axes and unpacked shapes.
+    shapes = [
+        ([(0,)], (0,)),
+        ([(2, 24, 0), (16, 3, 0), (16, 24, 0)], (16, 24, 0)),
+        ([(2, 0, 24), (16, 0, 24), (16, 0, 3)], (16, 0, 24)),
+        ([(0, 16, 24), (0, 2, 24), (0, 16, 3)], (0, 16, 24)),
+        ([(3, 0, 0), (24, 0, 0), (24, 0, 0)], (24, 0, 0)),
+        ([(0, 24, 0), (0, 3, 0), (0, 24, 0)], (0, 24, 0)),
+        ([(0, 0, 24), (0, 0, 24), (0, 0, 3)], (0, 0, 24)),
+        ([(0, 0, 0), (0, 0, 0), (0, 0, 0)], (0, 0, 0)),
+    ]
+    for in_shapes, out_shape in shapes:
+        for ax, in_shape in enumerate(in_shapes):
+            a = np.empty(in_shape, dtype=np.uint8)
+            b = np.unpackbits(a, axis=ax)
+            assert_equal(b.dtype, np.uint8)
+            assert_equal(b.shape, out_shape)
+
+
+def test_unpackbits_large():
+    # test all possible numbers via comparison to already tested packbits
+    d = np.arange(277, dtype=np.uint8)
+    assert_array_equal(np.packbits(np.unpackbits(d)), d)
+    assert_array_equal(np.packbits(np.unpackbits(d[::2])), d[::2])
+    d = np.tile(d, (3, 1))
+    assert_array_equal(np.packbits(np.unpackbits(d, axis=1), axis=1), d)
+    d = d.T.copy()
+    assert_array_equal(np.packbits(np.unpackbits(d, axis=0), axis=0), d)
+
+
+class TestCount():
+    x = np.array([
+        [1, 0, 1, 0, 0, 1, 0],
+        [0, 1, 1, 1, 0, 0, 0],
+        [0, 0, 1, 0, 0, 1, 1],
+        [1, 1, 0, 0, 0, 1, 1],
+        [1, 0, 1, 0, 1, 0, 1],
+        [0, 0, 1, 1, 1, 0, 0],
+        [0, 1, 0, 1, 0, 1, 0],
+    ], dtype=np.uint8)
+    padded1 = np.zeros(57, dtype=np.uint8)
+    padded1[:49] = x.ravel()
+    padded1b = np.zeros(57, dtype=np.uint8)
+    padded1b[:49] = x[::-1].copy().ravel()
+    padded2 = np.zeros((9, 9), dtype=np.uint8)
+    padded2[:7, :7] = x
+
+    @pytest.mark.parametrize('bitorder', ('little', 'big'))
+    @pytest.mark.parametrize('count', chain(range(58), range(-1, -57, -1)))
+    def test_roundtrip(self, bitorder, count):
+        if count < 0:
+            # one extra zero of padding
+            cutoff = count - 1
+        else:
+            cutoff = count
+        # test complete invertibility of packbits and unpackbits with count
+        packed = np.packbits(self.x, bitorder=bitorder)
+        unpacked = np.unpackbits(packed, count=count, bitorder=bitorder)
+        assert_equal(unpacked.dtype, np.uint8)
+        assert_array_equal(unpacked, self.padded1[:cutoff])
+
+    @pytest.mark.parametrize('kwargs', [
+                    {}, {'count': None},
+                    ])
+    def test_count(self, kwargs):
+        packed = np.packbits(self.x)
+        unpacked = np.unpackbits(packed, **kwargs)
+        assert_equal(unpacked.dtype, np.uint8)
+        assert_array_equal(unpacked, self.padded1[:-1])
+
+    @pytest.mark.parametrize('bitorder', ('little', 'big'))
+    # delta==-1 when count<0 because one extra zero of padding
+    @pytest.mark.parametrize('count', chain(range(8), range(-1, -9, -1)))
+    def test_roundtrip_axis(self, bitorder, count):
+        if count < 0:
+            # one extra zero of padding
+            cutoff = count - 1
+        else:
+            cutoff = count
+        packed0 = np.packbits(self.x, axis=0, bitorder=bitorder)
+        unpacked0 = np.unpackbits(packed0, axis=0, count=count,
+                                  bitorder=bitorder)
+        assert_equal(unpacked0.dtype, np.uint8)
+        assert_array_equal(unpacked0, self.padded2[:cutoff, :self.x.shape[1]])
+
+        packed1 = np.packbits(self.x, axis=1, bitorder=bitorder)
+        unpacked1 = np.unpackbits(packed1, axis=1, count=count,
+                                  bitorder=bitorder)
+        assert_equal(unpacked1.dtype, np.uint8)
+        assert_array_equal(unpacked1, self.padded2[:self.x.shape[0], :cutoff])
+
+    @pytest.mark.parametrize('kwargs', [
+                    {}, {'count': None},
+                    {'bitorder' : 'little'},
+                    {'bitorder': 'little', 'count': None},
+                    {'bitorder' : 'big'},
+                    {'bitorder': 'big', 'count': None},
+                    ])
+    def test_axis_count(self, kwargs):
+        packed0 = np.packbits(self.x, axis=0)
+        unpacked0 = np.unpackbits(packed0, axis=0, **kwargs)
+        assert_equal(unpacked0.dtype, np.uint8)
+        if kwargs.get('bitorder', 'big') == 'big':
+            assert_array_equal(unpacked0, self.padded2[:-1, :self.x.shape[1]])
+        else:
+            assert_array_equal(unpacked0[::-1, :], self.padded2[:-1, :self.x.shape[1]])
+
+        packed1 = np.packbits(self.x, axis=1)
+        unpacked1 = np.unpackbits(packed1, axis=1, **kwargs)
+        assert_equal(unpacked1.dtype, np.uint8)
+        if kwargs.get('bitorder', 'big') == 'big':
+            assert_array_equal(unpacked1, self.padded2[:self.x.shape[0], :-1])
+        else:
+            assert_array_equal(unpacked1[:, ::-1], self.padded2[:self.x.shape[0], :-1])
+
+    def test_bad_count(self):
+        packed0 = np.packbits(self.x, axis=0)
+        assert_raises(ValueError, np.unpackbits, packed0, axis=0, count=-9)
+        packed1 = np.packbits(self.x, axis=1)
+        assert_raises(ValueError, np.unpackbits, packed1, axis=1, count=-9)
+        packed = np.packbits(self.x)
+        assert_raises(ValueError, np.unpackbits, packed, count=-57)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_polynomial.py b/venv/Lib/site-packages/numpy/lib/tests/test_polynomial.py
new file mode 100644
index 000000000..cd0b90dc4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_polynomial.py
@@ -0,0 +1,259 @@
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_almost_equal,
+    assert_array_almost_equal, assert_raises, assert_allclose
+    )
+
+
+class TestPolynomial:
+    def test_poly1d_str_and_repr(self):
+        p = np.poly1d([1., 2, 3])
+        assert_equal(repr(p), 'poly1d([1., 2., 3.])')
+        assert_equal(str(p),
+                     '   2\n'
+                     '1 x + 2 x + 3')
+
+        q = np.poly1d([3., 2, 1])
+        assert_equal(repr(q), 'poly1d([3., 2., 1.])')
+        assert_equal(str(q),
+                     '   2\n'
+                     '3 x + 2 x + 1')
+
+        r = np.poly1d([1.89999 + 2j, -3j, -5.12345678, 2 + 1j])
+        assert_equal(str(r),
+                     '            3      2\n'
+                     '(1.9 + 2j) x - 3j x - 5.123 x + (2 + 1j)')
+
+        assert_equal(str(np.poly1d([-3, -2, -1])),
+                     '    2\n'
+                     '-3 x - 2 x - 1')
+
+    def test_poly1d_resolution(self):
+        p = np.poly1d([1., 2, 3])
+        q = np.poly1d([3., 2, 1])
+        assert_equal(p(0), 3.0)
+        assert_equal(p(5), 38.0)
+        assert_equal(q(0), 1.0)
+        assert_equal(q(5), 86.0)
+
+    def test_poly1d_math(self):
+        # here we use some simple coeffs to make calculations easier
+        p = np.poly1d([1., 2, 4])
+        q = np.poly1d([4., 2, 1])
+        assert_equal(p/q, (np.poly1d([0.25]), np.poly1d([1.5, 3.75])))
+        assert_equal(p.integ(), np.poly1d([1/3, 1., 4., 0.]))
+        assert_equal(p.integ(1), np.poly1d([1/3, 1., 4., 0.]))
+
+        p = np.poly1d([1., 2, 3])
+        q = np.poly1d([3., 2, 1])
+        assert_equal(p * q, np.poly1d([3., 8., 14., 8., 3.]))
+        assert_equal(p + q, np.poly1d([4., 4., 4.]))
+        assert_equal(p - q, np.poly1d([-2., 0., 2.]))
+        assert_equal(p ** 4, np.poly1d([1., 8., 36., 104., 214., 312., 324., 216., 81.]))
+        assert_equal(p(q), np.poly1d([9., 12., 16., 8., 6.]))
+        assert_equal(q(p), np.poly1d([3., 12., 32., 40., 34.]))
+        assert_equal(p.deriv(), np.poly1d([2., 2.]))
+        assert_equal(p.deriv(2), np.poly1d([2.]))
+        assert_equal(np.polydiv(np.poly1d([1, 0, -1]), np.poly1d([1, 1])),
+                     (np.poly1d([1., -1.]), np.poly1d([0.])))
+
+    def test_poly1d_misc(self):
+        p = np.poly1d([1., 2, 3])
+        assert_equal(np.asarray(p), np.array([1., 2., 3.]))
+        assert_equal(len(p), 2)
+        assert_equal((p[0], p[1], p[2], p[3]), (3.0, 2.0, 1.0, 0))
+
+    def test_poly1d_variable_arg(self):
+        q = np.poly1d([1., 2, 3], variable='y')
+        assert_equal(str(q),
+                     '   2\n'
+                     '1 y + 2 y + 3')
+        q = np.poly1d([1., 2, 3], variable='lambda')
+        assert_equal(str(q),
+                     '        2\n'
+                     '1 lambda + 2 lambda + 3')
+
+    def test_poly(self):
+        assert_array_almost_equal(np.poly([3, -np.sqrt(2), np.sqrt(2)]),
+                                  [1, -3, -2, 6])
+
+        # From matlab docs
+        A = [[1, 2, 3], [4, 5, 6], [7, 8, 0]]
+        assert_array_almost_equal(np.poly(A), [1, -6, -72, -27])
+
+        # Should produce real output for perfect conjugates
+        assert_(np.isrealobj(np.poly([+1.082j, +2.613j, -2.613j, -1.082j])))
+        assert_(np.isrealobj(np.poly([0+1j, -0+-1j, 1+2j,
+                                      1-2j, 1.+3.5j, 1-3.5j])))
+        assert_(np.isrealobj(np.poly([1j, -1j, 1+2j, 1-2j, 1+3j, 1-3.j])))
+        assert_(np.isrealobj(np.poly([1j, -1j, 1+2j, 1-2j])))
+        assert_(np.isrealobj(np.poly([1j, -1j, 2j, -2j])))
+        assert_(np.isrealobj(np.poly([1j, -1j])))
+        assert_(np.isrealobj(np.poly([1, -1])))
+
+        assert_(np.iscomplexobj(np.poly([1j, -1.0000001j])))
+
+        np.random.seed(42)
+        a = np.random.randn(100) + 1j*np.random.randn(100)
+        assert_(np.isrealobj(np.poly(np.concatenate((a, np.conjugate(a))))))
+
+    def test_roots(self):
+        assert_array_equal(np.roots([1, 0, 0]), [0, 0])
+
+    def test_str_leading_zeros(self):
+        p = np.poly1d([4, 3, 2, 1])
+        p[3] = 0
+        assert_equal(str(p),
+                     "   2\n"
+                     "3 x + 2 x + 1")
+
+        p = np.poly1d([1, 2])
+        p[0] = 0
+        p[1] = 0
+        assert_equal(str(p), " \n0")
+
+    def test_polyfit(self):
+        c = np.array([3., 2., 1.])
+        x = np.linspace(0, 2, 7)
+        y = np.polyval(c, x)
+        err = [1, -1, 1, -1, 1, -1, 1]
+        weights = np.arange(8, 1, -1)**2/7.0
+
+        # Check exception when too few points for variance estimate. Note that
+        # the estimate requires the number of data points to exceed
+        # degree + 1
+        assert_raises(ValueError, np.polyfit,
+                      [1], [1], deg=0, cov=True)
+
+        # check 1D case
+        m, cov = np.polyfit(x, y+err, 2, cov=True)
+        est = [3.8571, 0.2857, 1.619]
+        assert_almost_equal(est, m, decimal=4)
+        val0 = [[ 1.4694, -2.9388,  0.8163],
+                [-2.9388,  6.3673, -2.1224],
+                [ 0.8163, -2.1224,  1.161 ]]
+        assert_almost_equal(val0, cov, decimal=4)
+
+        m2, cov2 = np.polyfit(x, y+err, 2, w=weights, cov=True)
+        assert_almost_equal([4.8927, -1.0177, 1.7768], m2, decimal=4)
+        val = [[ 4.3964, -5.0052,  0.4878],
+               [-5.0052,  6.8067, -0.9089],
+               [ 0.4878, -0.9089,  0.3337]]
+        assert_almost_equal(val, cov2, decimal=4)
+
+        m3, cov3 = np.polyfit(x, y+err, 2, w=weights, cov="unscaled")
+        assert_almost_equal([4.8927, -1.0177, 1.7768], m3, decimal=4)
+        val = [[ 0.1473, -0.1677,  0.0163],
+               [-0.1677,  0.228 , -0.0304],
+               [ 0.0163, -0.0304,  0.0112]]
+        assert_almost_equal(val, cov3, decimal=4)
+
+        # check 2D (n,1) case
+        y = y[:, np.newaxis]
+        c = c[:, np.newaxis]
+        assert_almost_equal(c, np.polyfit(x, y, 2))
+        # check 2D (n,2) case
+        yy = np.concatenate((y, y), axis=1)
+        cc = np.concatenate((c, c), axis=1)
+        assert_almost_equal(cc, np.polyfit(x, yy, 2))
+
+        m, cov = np.polyfit(x, yy + np.array(err)[:, np.newaxis], 2, cov=True)
+        assert_almost_equal(est, m[:, 0], decimal=4)
+        assert_almost_equal(est, m[:, 1], decimal=4)
+        assert_almost_equal(val0, cov[:, :, 0], decimal=4)
+        assert_almost_equal(val0, cov[:, :, 1], decimal=4)
+
+        # check order 1 (deg=0) case, were the analytic results are simple
+        np.random.seed(123)
+        y = np.random.normal(size=(4, 10000))
+        mean, cov = np.polyfit(np.zeros(y.shape[0]), y, deg=0, cov=True)
+        # Should get sigma_mean = sigma/sqrt(N) = 1./sqrt(4) = 0.5.
+        assert_allclose(mean.std(), 0.5, atol=0.01)
+        assert_allclose(np.sqrt(cov.mean()), 0.5, atol=0.01)
+        # Without scaling, since reduced chi2 is 1, the result should be the same.
+        mean, cov = np.polyfit(np.zeros(y.shape[0]), y, w=np.ones(y.shape[0]),
+                               deg=0, cov="unscaled")
+        assert_allclose(mean.std(), 0.5, atol=0.01)
+        assert_almost_equal(np.sqrt(cov.mean()), 0.5)
+        # If we estimate our errors wrong, no change with scaling:
+        w = np.full(y.shape[0], 1./0.5)
+        mean, cov = np.polyfit(np.zeros(y.shape[0]), y, w=w, deg=0, cov=True)
+        assert_allclose(mean.std(), 0.5, atol=0.01)
+        assert_allclose(np.sqrt(cov.mean()), 0.5, atol=0.01)
+        # But if we do not scale, our estimate for the error in the mean will
+        # differ.
+        mean, cov = np.polyfit(np.zeros(y.shape[0]), y, w=w, deg=0, cov="unscaled")
+        assert_allclose(mean.std(), 0.5, atol=0.01)
+        assert_almost_equal(np.sqrt(cov.mean()), 0.25)
+
+    def test_objects(self):
+        from decimal import Decimal
+        p = np.poly1d([Decimal('4.0'), Decimal('3.0'), Decimal('2.0')])
+        p2 = p * Decimal('1.333333333333333')
+        assert_(p2[1] == Decimal("3.9999999999999990"))
+        p2 = p.deriv()
+        assert_(p2[1] == Decimal('8.0'))
+        p2 = p.integ()
+        assert_(p2[3] == Decimal("1.333333333333333333333333333"))
+        assert_(p2[2] == Decimal('1.5'))
+        assert_(np.issubdtype(p2.coeffs.dtype, np.object_))
+        p = np.poly([Decimal(1), Decimal(2)])
+        assert_equal(np.poly([Decimal(1), Decimal(2)]),
+                     [1, Decimal(-3), Decimal(2)])
+
+    def test_complex(self):
+        p = np.poly1d([3j, 2j, 1j])
+        p2 = p.integ()
+        assert_((p2.coeffs == [1j, 1j, 1j, 0]).all())
+        p2 = p.deriv()
+        assert_((p2.coeffs == [6j, 2j]).all())
+
+    def test_integ_coeffs(self):
+        p = np.poly1d([3, 2, 1])
+        p2 = p.integ(3, k=[9, 7, 6])
+        assert_(
+            (p2.coeffs == [1/4./5., 1/3./4., 1/2./3., 9/1./2., 7, 6]).all())
+
+    def test_zero_dims(self):
+        try:
+            np.poly(np.zeros((0, 0)))
+        except ValueError:
+            pass
+
+    def test_poly_int_overflow(self):
+        """
+        Regression test for gh-5096.
+        """
+        v = np.arange(1, 21)
+        assert_almost_equal(np.poly(v), np.poly(np.diag(v)))
+
+    def test_poly_eq(self):
+        p = np.poly1d([1, 2, 3])
+        p2 = np.poly1d([1, 2, 4])
+        assert_equal(p == None, False)
+        assert_equal(p != None, True)
+        assert_equal(p == p, True)
+        assert_equal(p == p2, False)
+        assert_equal(p != p2, True)
+
+    def test_polydiv(self):
+        b = np.poly1d([2, 6, 6, 1])
+        a = np.poly1d([-1j, (1+2j), -(2+1j), 1])
+        q, r = np.polydiv(b, a)
+        assert_equal(q.coeffs.dtype, np.complex128)
+        assert_equal(r.coeffs.dtype, np.complex128)
+        assert_equal(q*a + r, b)
+
+    def test_poly_coeffs_mutable(self):
+        """ Coefficients should be modifiable """
+        p = np.poly1d([1, 2, 3])
+
+        p.coeffs += 1
+        assert_equal(p.coeffs, [2, 3, 4])
+
+        p.coeffs[2] += 10
+        assert_equal(p.coeffs, [2, 3, 14])
+
+        # this never used to be allowed - let's not add features to deprecated
+        # APIs
+        assert_raises(AttributeError, setattr, p, 'coeffs', np.array(1))
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_recfunctions.py b/venv/Lib/site-packages/numpy/lib/tests/test_recfunctions.py
new file mode 100644
index 000000000..2f3c14df3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_recfunctions.py
@@ -0,0 +1,979 @@
+import pytest
+
+import numpy as np
+import numpy.ma as ma
+from numpy.ma.mrecords import MaskedRecords
+from numpy.ma.testutils import assert_equal
+from numpy.testing import assert_, assert_raises
+from numpy.lib.recfunctions import (
+    drop_fields, rename_fields, get_fieldstructure, recursive_fill_fields,
+    find_duplicates, merge_arrays, append_fields, stack_arrays, join_by,
+    repack_fields, unstructured_to_structured, structured_to_unstructured,
+    apply_along_fields, require_fields, assign_fields_by_name)
+get_fieldspec = np.lib.recfunctions._get_fieldspec
+get_names = np.lib.recfunctions.get_names
+get_names_flat = np.lib.recfunctions.get_names_flat
+zip_descr = np.lib.recfunctions._zip_descr
+zip_dtype = np.lib.recfunctions._zip_dtype
+
+
+class TestRecFunctions:
+    # Misc tests
+
+    def setup(self):
+        x = np.array([1, 2, ])
+        y = np.array([10, 20, 30])
+        z = np.array([('A', 1.), ('B', 2.)],
+                     dtype=[('A', '|S3'), ('B', float)])
+        w = np.array([(1, (2, 3.0)), (4, (5, 6.0))],
+                     dtype=[('a', int), ('b', [('ba', float), ('bb', int)])])
+        self.data = (w, x, y, z)
+
+    def test_zip_descr(self):
+        # Test zip_descr
+        (w, x, y, z) = self.data
+
+        # Std array
+        test = zip_descr((x, x), flatten=True)
+        assert_equal(test,
+                     np.dtype([('', int), ('', int)]))
+        test = zip_descr((x, x), flatten=False)
+        assert_equal(test,
+                     np.dtype([('', int), ('', int)]))
+
+        # Std & flexible-dtype
+        test = zip_descr((x, z), flatten=True)
+        assert_equal(test,
+                     np.dtype([('', int), ('A', '|S3'), ('B', float)]))
+        test = zip_descr((x, z), flatten=False)
+        assert_equal(test,
+                     np.dtype([('', int),
+                               ('', [('A', '|S3'), ('B', float)])]))
+
+        # Standard & nested dtype
+        test = zip_descr((x, w), flatten=True)
+        assert_equal(test,
+                     np.dtype([('', int),
+                               ('a', int),
+                               ('ba', float), ('bb', int)]))
+        test = zip_descr((x, w), flatten=False)
+        assert_equal(test,
+                     np.dtype([('', int),
+                               ('', [('a', int),
+                                     ('b', [('ba', float), ('bb', int)])])]))
+
+    def test_drop_fields(self):
+        # Test drop_fields
+        a = np.array([(1, (2, 3.0)), (4, (5, 6.0))],
+                     dtype=[('a', int), ('b', [('ba', float), ('bb', int)])])
+
+        # A basic field
+        test = drop_fields(a, 'a')
+        control = np.array([((2, 3.0),), ((5, 6.0),)],
+                           dtype=[('b', [('ba', float), ('bb', int)])])
+        assert_equal(test, control)
+
+        # Another basic field (but nesting two fields)
+        test = drop_fields(a, 'b')
+        control = np.array([(1,), (4,)], dtype=[('a', int)])
+        assert_equal(test, control)
+
+        # A nested sub-field
+        test = drop_fields(a, ['ba', ])
+        control = np.array([(1, (3.0,)), (4, (6.0,))],
+                           dtype=[('a', int), ('b', [('bb', int)])])
+        assert_equal(test, control)
+
+        # All the nested sub-field from a field: zap that field
+        test = drop_fields(a, ['ba', 'bb'])
+        control = np.array([(1,), (4,)], dtype=[('a', int)])
+        assert_equal(test, control)
+
+        # dropping all fields results in an array with no fields
+        test = drop_fields(a, ['a', 'b'])
+        control = np.array([(), ()], dtype=[])
+        assert_equal(test, control)
+
+    def test_rename_fields(self):
+        # Test rename fields
+        a = np.array([(1, (2, [3.0, 30.])), (4, (5, [6.0, 60.]))],
+                     dtype=[('a', int),
+                            ('b', [('ba', float), ('bb', (float, 2))])])
+        test = rename_fields(a, {'a': 'A', 'bb': 'BB'})
+        newdtype = [('A', int), ('b', [('ba', float), ('BB', (float, 2))])]
+        control = a.view(newdtype)
+        assert_equal(test.dtype, newdtype)
+        assert_equal(test, control)
+
+    def test_get_names(self):
+        # Test get_names
+        ndtype = np.dtype([('A', '|S3'), ('B', float)])
+        test = get_names(ndtype)
+        assert_equal(test, ('A', 'B'))
+
+        ndtype = np.dtype([('a', int), ('b', [('ba', float), ('bb', int)])])
+        test = get_names(ndtype)
+        assert_equal(test, ('a', ('b', ('ba', 'bb'))))
+
+        ndtype = np.dtype([('a', int), ('b', [])])
+        test = get_names(ndtype)
+        assert_equal(test, ('a', ('b', ())))
+
+        ndtype = np.dtype([])
+        test = get_names(ndtype)
+        assert_equal(test, ())
+
+    def test_get_names_flat(self):
+        # Test get_names_flat
+        ndtype = np.dtype([('A', '|S3'), ('B', float)])
+        test = get_names_flat(ndtype)
+        assert_equal(test, ('A', 'B'))
+
+        ndtype = np.dtype([('a', int), ('b', [('ba', float), ('bb', int)])])
+        test = get_names_flat(ndtype)
+        assert_equal(test, ('a', 'b', 'ba', 'bb'))
+
+        ndtype = np.dtype([('a', int), ('b', [])])
+        test = get_names_flat(ndtype)
+        assert_equal(test, ('a', 'b'))
+
+        ndtype = np.dtype([])
+        test = get_names_flat(ndtype)
+        assert_equal(test, ())
+
+    def test_get_fieldstructure(self):
+        # Test get_fieldstructure
+
+        # No nested fields
+        ndtype = np.dtype([('A', '|S3'), ('B', float)])
+        test = get_fieldstructure(ndtype)
+        assert_equal(test, {'A': [], 'B': []})
+
+        # One 1-nested field
+        ndtype = np.dtype([('A', int), ('B', [('BA', float), ('BB', '|S1')])])
+        test = get_fieldstructure(ndtype)
+        assert_equal(test, {'A': [], 'B': [], 'BA': ['B', ], 'BB': ['B']})
+
+        # One 2-nested fields
+        ndtype = np.dtype([('A', int),
+                           ('B', [('BA', int),
+                                  ('BB', [('BBA', int), ('BBB', int)])])])
+        test = get_fieldstructure(ndtype)
+        control = {'A': [], 'B': [], 'BA': ['B'], 'BB': ['B'],
+                   'BBA': ['B', 'BB'], 'BBB': ['B', 'BB']}
+        assert_equal(test, control)
+
+        # 0 fields
+        ndtype = np.dtype([])
+        test = get_fieldstructure(ndtype)
+        assert_equal(test, {})
+
+    def test_find_duplicates(self):
+        # Test find_duplicates
+        a = ma.array([(2, (2., 'B')), (1, (2., 'B')), (2, (2., 'B')),
+                      (1, (1., 'B')), (2, (2., 'B')), (2, (2., 'C'))],
+                     mask=[(0, (0, 0)), (0, (0, 0)), (0, (0, 0)),
+                           (0, (0, 0)), (1, (0, 0)), (0, (1, 0))],
+                     dtype=[('A', int), ('B', [('BA', float), ('BB', '|S1')])])
+
+        test = find_duplicates(a, ignoremask=False, return_index=True)
+        control = [0, 2]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+        test = find_duplicates(a, key='A', return_index=True)
+        control = [0, 1, 2, 3, 5]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+        test = find_duplicates(a, key='B', return_index=True)
+        control = [0, 1, 2, 4]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+        test = find_duplicates(a, key='BA', return_index=True)
+        control = [0, 1, 2, 4]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+        test = find_duplicates(a, key='BB', return_index=True)
+        control = [0, 1, 2, 3, 4]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+    def test_find_duplicates_ignoremask(self):
+        # Test the ignoremask option of find_duplicates
+        ndtype = [('a', int)]
+        a = ma.array([1, 1, 1, 2, 2, 3, 3],
+                     mask=[0, 0, 1, 0, 0, 0, 1]).view(ndtype)
+        test = find_duplicates(a, ignoremask=True, return_index=True)
+        control = [0, 1, 3, 4]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+        test = find_duplicates(a, ignoremask=False, return_index=True)
+        control = [0, 1, 2, 3, 4, 6]
+        assert_equal(sorted(test[-1]), control)
+        assert_equal(test[0], a[test[-1]])
+
+    def test_repack_fields(self):
+        dt = np.dtype('u1,f4,i8', align=True)
+        a = np.zeros(2, dtype=dt)
+
+        assert_equal(repack_fields(dt), np.dtype('u1,f4,i8'))
+        assert_equal(repack_fields(a).itemsize, 13)
+        assert_equal(repack_fields(repack_fields(dt), align=True), dt)
+
+        # make sure type is preserved
+        dt = np.dtype((np.record, dt))
+        assert_(repack_fields(dt).type is np.record)
+
+    def test_structured_to_unstructured(self):
+        a = np.zeros(4, dtype=[('a', 'i4'), ('b', 'f4,u2'), ('c', 'f4', 2)])
+        out = structured_to_unstructured(a)
+        assert_equal(out, np.zeros((4,5), dtype='f8'))
+
+        b = np.array([(1, 2, 5), (4, 5, 7), (7, 8 ,11), (10, 11, 12)],
+                     dtype=[('x', 'i4'), ('y', 'f4'), ('z', 'f8')])
+        out = np.mean(structured_to_unstructured(b[['x', 'z']]), axis=-1)
+        assert_equal(out, np.array([ 3. ,  5.5,  9. , 11. ]))
+        out = np.mean(structured_to_unstructured(b[['x']]), axis=-1)
+        assert_equal(out, np.array([ 1. ,  4. ,  7. , 10. ]))
+
+        c = np.arange(20).reshape((4,5))
+        out = unstructured_to_structured(c, a.dtype)
+        want = np.array([( 0, ( 1.,  2), [ 3.,  4.]),
+                         ( 5, ( 6.,  7), [ 8.,  9.]),
+                         (10, (11., 12), [13., 14.]),
+                         (15, (16., 17), [18., 19.])],
+                     dtype=[('a', 'i4'),
+                            ('b', [('f0', 'f4'), ('f1', 'u2')]),
+                            ('c', 'f4', (2,))])
+        assert_equal(out, want)
+
+        d = np.array([(1, 2, 5), (4, 5, 7), (7, 8 ,11), (10, 11, 12)],
+                     dtype=[('x', 'i4'), ('y', 'f4'), ('z', 'f8')])
+        assert_equal(apply_along_fields(np.mean, d),
+                     np.array([ 8.0/3,  16.0/3,  26.0/3, 11. ]))
+        assert_equal(apply_along_fields(np.mean, d[['x', 'z']]),
+                     np.array([ 3. ,  5.5,  9. , 11. ]))
+
+        # check that for uniform field dtypes we get a view, not a copy:
+        d = np.array([(1, 2, 5), (4, 5, 7), (7, 8 ,11), (10, 11, 12)],
+                     dtype=[('x', 'i4'), ('y', 'i4'), ('z', 'i4')])
+        dd = structured_to_unstructured(d)
+        ddd = unstructured_to_structured(dd, d.dtype)
+        assert_(dd.base is d)
+        assert_(ddd.base is d)
+
+        # including uniform fields with subarrays unpacked
+        d = np.array([(1, [2,  3], [[ 4,  5], [ 6,  7]]),
+                      (8, [9, 10], [[11, 12], [13, 14]])],
+                     dtype=[('x0', 'i4'), ('x1', ('i4', 2)),
+                            ('x2', ('i4', (2, 2)))])
+        dd = structured_to_unstructured(d)
+        ddd = unstructured_to_structured(dd, d.dtype)
+        assert_(dd.base is d)
+        assert_(ddd.base is d)
+
+        # test that nested fields with identical names don't break anything
+        point = np.dtype([('x', int), ('y', int)])
+        triangle = np.dtype([('a', point), ('b', point), ('c', point)])
+        arr = np.zeros(10, triangle)
+        res = structured_to_unstructured(arr, dtype=int)
+        assert_equal(res, np.zeros((10, 6), dtype=int))
+
+
+        # test nested combinations of subarrays and structured arrays, gh-13333
+        def subarray(dt, shape):
+            return np.dtype((dt, shape))
+
+        def structured(*dts):
+            return np.dtype([('x{}'.format(i), dt) for i, dt in enumerate(dts)])
+
+        def inspect(dt, dtype=None):
+            arr = np.zeros((), dt)
+            ret = structured_to_unstructured(arr, dtype=dtype)
+            backarr = unstructured_to_structured(ret, dt)
+            return ret.shape, ret.dtype, backarr.dtype
+
+        dt = structured(subarray(structured(np.int32, np.int32), 3))
+        assert_equal(inspect(dt), ((6,), np.int32, dt))
+
+        dt = structured(subarray(subarray(np.int32, 2), 2))
+        assert_equal(inspect(dt), ((4,), np.int32, dt))
+
+        dt = structured(np.int32)
+        assert_equal(inspect(dt), ((1,), np.int32, dt))
+
+        dt = structured(np.int32, subarray(subarray(np.int32, 2), 2))
+        assert_equal(inspect(dt), ((5,), np.int32, dt))
+
+        dt = structured()
+        assert_raises(ValueError, structured_to_unstructured, np.zeros(3, dt))
+
+        # these currently don't work, but we may make it work in the future
+        assert_raises(NotImplementedError, structured_to_unstructured,
+                                           np.zeros(3, dt), dtype=np.int32)
+        assert_raises(NotImplementedError, unstructured_to_structured,
+                                           np.zeros((3,0), dtype=np.int32))
+
+    def test_field_assignment_by_name(self):
+        a = np.ones(2, dtype=[('a', 'i4'), ('b', 'f8'), ('c', 'u1')])
+        newdt = [('b', 'f4'), ('c', 'u1')]
+
+        assert_equal(require_fields(a, newdt), np.ones(2, newdt))
+
+        b = np.array([(1,2), (3,4)], dtype=newdt)
+        assign_fields_by_name(a, b, zero_unassigned=False)
+        assert_equal(a, np.array([(1,1,2),(1,3,4)], dtype=a.dtype))
+        assign_fields_by_name(a, b)
+        assert_equal(a, np.array([(0,1,2),(0,3,4)], dtype=a.dtype))
+
+        # test nested fields
+        a = np.ones(2, dtype=[('a', [('b', 'f8'), ('c', 'u1')])])
+        newdt = [('a', [('c', 'u1')])]
+        assert_equal(require_fields(a, newdt), np.ones(2, newdt))
+        b = np.array([((2,),), ((3,),)], dtype=newdt)
+        assign_fields_by_name(a, b, zero_unassigned=False)
+        assert_equal(a, np.array([((1,2),), ((1,3),)], dtype=a.dtype))
+        assign_fields_by_name(a, b)
+        assert_equal(a, np.array([((0,2),), ((0,3),)], dtype=a.dtype))
+
+        # test unstructured code path for 0d arrays
+        a, b = np.array(3), np.array(0)
+        assign_fields_by_name(b, a)
+        assert_equal(b[()], 3)
+
+
+class TestRecursiveFillFields:
+    # Test recursive_fill_fields.
+    def test_simple_flexible(self):
+        # Test recursive_fill_fields on flexible-array
+        a = np.array([(1, 10.), (2, 20.)], dtype=[('A', int), ('B', float)])
+        b = np.zeros((3,), dtype=a.dtype)
+        test = recursive_fill_fields(a, b)
+        control = np.array([(1, 10.), (2, 20.), (0, 0.)],
+                           dtype=[('A', int), ('B', float)])
+        assert_equal(test, control)
+
+    def test_masked_flexible(self):
+        # Test recursive_fill_fields on masked flexible-array
+        a = ma.array([(1, 10.), (2, 20.)], mask=[(0, 1), (1, 0)],
+                     dtype=[('A', int), ('B', float)])
+        b = ma.zeros((3,), dtype=a.dtype)
+        test = recursive_fill_fields(a, b)
+        control = ma.array([(1, 10.), (2, 20.), (0, 0.)],
+                           mask=[(0, 1), (1, 0), (0, 0)],
+                           dtype=[('A', int), ('B', float)])
+        assert_equal(test, control)
+
+
+class TestMergeArrays:
+    # Test merge_arrays
+
+    def setup(self):
+        x = np.array([1, 2, ])
+        y = np.array([10, 20, 30])
+        z = np.array(
+            [('A', 1.), ('B', 2.)], dtype=[('A', '|S3'), ('B', float)])
+        w = np.array(
+            [(1, (2, 3.0, ())), (4, (5, 6.0, ()))],
+            dtype=[('a', int), ('b', [('ba', float), ('bb', int), ('bc', [])])])
+        self.data = (w, x, y, z)
+
+    def test_solo(self):
+        # Test merge_arrays on a single array.
+        (_, x, _, z) = self.data
+
+        test = merge_arrays(x)
+        control = np.array([(1,), (2,)], dtype=[('f0', int)])
+        assert_equal(test, control)
+        test = merge_arrays((x,))
+        assert_equal(test, control)
+
+        test = merge_arrays(z, flatten=False)
+        assert_equal(test, z)
+        test = merge_arrays(z, flatten=True)
+        assert_equal(test, z)
+
+    def test_solo_w_flatten(self):
+        # Test merge_arrays on a single array w & w/o flattening
+        w = self.data[0]
+        test = merge_arrays(w, flatten=False)
+        assert_equal(test, w)
+
+        test = merge_arrays(w, flatten=True)
+        control = np.array([(1, 2, 3.0), (4, 5, 6.0)],
+                           dtype=[('a', int), ('ba', float), ('bb', int)])
+        assert_equal(test, control)
+
+    def test_standard(self):
+        # Test standard & standard
+        # Test merge arrays
+        (_, x, y, _) = self.data
+        test = merge_arrays((x, y), usemask=False)
+        control = np.array([(1, 10), (2, 20), (-1, 30)],
+                           dtype=[('f0', int), ('f1', int)])
+        assert_equal(test, control)
+
+        test = merge_arrays((x, y), usemask=True)
+        control = ma.array([(1, 10), (2, 20), (-1, 30)],
+                           mask=[(0, 0), (0, 0), (1, 0)],
+                           dtype=[('f0', int), ('f1', int)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+    def test_flatten(self):
+        # Test standard & flexible
+        (_, x, _, z) = self.data
+        test = merge_arrays((x, z), flatten=True)
+        control = np.array([(1, 'A', 1.), (2, 'B', 2.)],
+                           dtype=[('f0', int), ('A', '|S3'), ('B', float)])
+        assert_equal(test, control)
+
+        test = merge_arrays((x, z), flatten=False)
+        control = np.array([(1, ('A', 1.)), (2, ('B', 2.))],
+                           dtype=[('f0', int),
+                                  ('f1', [('A', '|S3'), ('B', float)])])
+        assert_equal(test, control)
+
+    def test_flatten_wflexible(self):
+        # Test flatten standard & nested
+        (w, x, _, _) = self.data
+        test = merge_arrays((x, w), flatten=True)
+        control = np.array([(1, 1, 2, 3.0), (2, 4, 5, 6.0)],
+                           dtype=[('f0', int),
+                                  ('a', int), ('ba', float), ('bb', int)])
+        assert_equal(test, control)
+
+        test = merge_arrays((x, w), flatten=False)
+        controldtype = [('f0', int),
+                                ('f1', [('a', int),
+                                        ('b', [('ba', float), ('bb', int), ('bc', [])])])]
+        control = np.array([(1., (1, (2, 3.0, ()))), (2, (4, (5, 6.0, ())))],
+                           dtype=controldtype)
+        assert_equal(test, control)
+
+    def test_wmasked_arrays(self):
+        # Test merge_arrays masked arrays
+        (_, x, _, _) = self.data
+        mx = ma.array([1, 2, 3], mask=[1, 0, 0])
+        test = merge_arrays((x, mx), usemask=True)
+        control = ma.array([(1, 1), (2, 2), (-1, 3)],
+                           mask=[(0, 1), (0, 0), (1, 0)],
+                           dtype=[('f0', int), ('f1', int)])
+        assert_equal(test, control)
+        test = merge_arrays((x, mx), usemask=True, asrecarray=True)
+        assert_equal(test, control)
+        assert_(isinstance(test, MaskedRecords))
+
+    def test_w_singlefield(self):
+        # Test single field
+        test = merge_arrays((np.array([1, 2]).view([('a', int)]),
+                             np.array([10., 20., 30.])),)
+        control = ma.array([(1, 10.), (2, 20.), (-1, 30.)],
+                           mask=[(0, 0), (0, 0), (1, 0)],
+                           dtype=[('a', int), ('f1', float)])
+        assert_equal(test, control)
+
+    def test_w_shorter_flex(self):
+        # Test merge_arrays w/ a shorter flexndarray.
+        z = self.data[-1]
+
+        # Fixme, this test looks incomplete and broken
+        #test = merge_arrays((z, np.array([10, 20, 30]).view([('C', int)])))
+        #control = np.array([('A', 1., 10), ('B', 2., 20), ('-1', -1, 20)],
+        #                   dtype=[('A', '|S3'), ('B', float), ('C', int)])
+        #assert_equal(test, control)
+
+        # Hack to avoid pyflakes warnings about unused variables
+        merge_arrays((z, np.array([10, 20, 30]).view([('C', int)])))
+        np.array([('A', 1., 10), ('B', 2., 20), ('-1', -1, 20)],
+                 dtype=[('A', '|S3'), ('B', float), ('C', int)])
+
+    def test_singlerecord(self):
+        (_, x, y, z) = self.data
+        test = merge_arrays((x[0], y[0], z[0]), usemask=False)
+        control = np.array([(1, 10, ('A', 1))],
+                           dtype=[('f0', int),
+                                  ('f1', int),
+                                  ('f2', [('A', '|S3'), ('B', float)])])
+        assert_equal(test, control)
+
+
+class TestAppendFields:
+    # Test append_fields
+
+    def setup(self):
+        x = np.array([1, 2, ])
+        y = np.array([10, 20, 30])
+        z = np.array(
+            [('A', 1.), ('B', 2.)], dtype=[('A', '|S3'), ('B', float)])
+        w = np.array([(1, (2, 3.0)), (4, (5, 6.0))],
+                     dtype=[('a', int), ('b', [('ba', float), ('bb', int)])])
+        self.data = (w, x, y, z)
+
+    def test_append_single(self):
+        # Test simple case
+        (_, x, _, _) = self.data
+        test = append_fields(x, 'A', data=[10, 20, 30])
+        control = ma.array([(1, 10), (2, 20), (-1, 30)],
+                           mask=[(0, 0), (0, 0), (1, 0)],
+                           dtype=[('f0', int), ('A', int)],)
+        assert_equal(test, control)
+
+    def test_append_double(self):
+        # Test simple case
+        (_, x, _, _) = self.data
+        test = append_fields(x, ('A', 'B'), data=[[10, 20, 30], [100, 200]])
+        control = ma.array([(1, 10, 100), (2, 20, 200), (-1, 30, -1)],
+                           mask=[(0, 0, 0), (0, 0, 0), (1, 0, 1)],
+                           dtype=[('f0', int), ('A', int), ('B', int)],)
+        assert_equal(test, control)
+
+    def test_append_on_flex(self):
+        # Test append_fields on flexible type arrays
+        z = self.data[-1]
+        test = append_fields(z, 'C', data=[10, 20, 30])
+        control = ma.array([('A', 1., 10), ('B', 2., 20), (-1, -1., 30)],
+                           mask=[(0, 0, 0), (0, 0, 0), (1, 1, 0)],
+                           dtype=[('A', '|S3'), ('B', float), ('C', int)],)
+        assert_equal(test, control)
+
+    def test_append_on_nested(self):
+        # Test append_fields on nested fields
+        w = self.data[0]
+        test = append_fields(w, 'C', data=[10, 20, 30])
+        control = ma.array([(1, (2, 3.0), 10),
+                            (4, (5, 6.0), 20),
+                            (-1, (-1, -1.), 30)],
+                           mask=[(
+                               0, (0, 0), 0), (0, (0, 0), 0), (1, (1, 1), 0)],
+                           dtype=[('a', int),
+                                  ('b', [('ba', float), ('bb', int)]),
+                                  ('C', int)],)
+        assert_equal(test, control)
+
+
+class TestStackArrays:
+    # Test stack_arrays
+    def setup(self):
+        x = np.array([1, 2, ])
+        y = np.array([10, 20, 30])
+        z = np.array(
+            [('A', 1.), ('B', 2.)], dtype=[('A', '|S3'), ('B', float)])
+        w = np.array([(1, (2, 3.0)), (4, (5, 6.0))],
+                     dtype=[('a', int), ('b', [('ba', float), ('bb', int)])])
+        self.data = (w, x, y, z)
+
+    def test_solo(self):
+        # Test stack_arrays on single arrays
+        (_, x, _, _) = self.data
+        test = stack_arrays((x,))
+        assert_equal(test, x)
+        assert_(test is x)
+
+        test = stack_arrays(x)
+        assert_equal(test, x)
+        assert_(test is x)
+
+    def test_unnamed_fields(self):
+        # Tests combinations of arrays w/o named fields
+        (_, x, y, _) = self.data
+
+        test = stack_arrays((x, x), usemask=False)
+        control = np.array([1, 2, 1, 2])
+        assert_equal(test, control)
+
+        test = stack_arrays((x, y), usemask=False)
+        control = np.array([1, 2, 10, 20, 30])
+        assert_equal(test, control)
+
+        test = stack_arrays((y, x), usemask=False)
+        control = np.array([10, 20, 30, 1, 2])
+        assert_equal(test, control)
+
+    def test_unnamed_and_named_fields(self):
+        # Test combination of arrays w/ & w/o named fields
+        (_, x, _, z) = self.data
+
+        test = stack_arrays((x, z))
+        control = ma.array([(1, -1, -1), (2, -1, -1),
+                            (-1, 'A', 1), (-1, 'B', 2)],
+                           mask=[(0, 1, 1), (0, 1, 1),
+                                 (1, 0, 0), (1, 0, 0)],
+                           dtype=[('f0', int), ('A', '|S3'), ('B', float)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+        test = stack_arrays((z, x))
+        control = ma.array([('A', 1, -1), ('B', 2, -1),
+                            (-1, -1, 1), (-1, -1, 2), ],
+                           mask=[(0, 0, 1), (0, 0, 1),
+                                 (1, 1, 0), (1, 1, 0)],
+                           dtype=[('A', '|S3'), ('B', float), ('f2', int)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+        test = stack_arrays((z, z, x))
+        control = ma.array([('A', 1, -1), ('B', 2, -1),
+                            ('A', 1, -1), ('B', 2, -1),
+                            (-1, -1, 1), (-1, -1, 2), ],
+                           mask=[(0, 0, 1), (0, 0, 1),
+                                 (0, 0, 1), (0, 0, 1),
+                                 (1, 1, 0), (1, 1, 0)],
+                           dtype=[('A', '|S3'), ('B', float), ('f2', int)])
+        assert_equal(test, control)
+
+    def test_matching_named_fields(self):
+        # Test combination of arrays w/ matching field names
+        (_, x, _, z) = self.data
+        zz = np.array([('a', 10., 100.), ('b', 20., 200.), ('c', 30., 300.)],
+                      dtype=[('A', '|S3'), ('B', float), ('C', float)])
+        test = stack_arrays((z, zz))
+        control = ma.array([('A', 1, -1), ('B', 2, -1),
+                            (
+                                'a', 10., 100.), ('b', 20., 200.), ('c', 30., 300.)],
+                           dtype=[('A', '|S3'), ('B', float), ('C', float)],
+                           mask=[(0, 0, 1), (0, 0, 1),
+                                 (0, 0, 0), (0, 0, 0), (0, 0, 0)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+        test = stack_arrays((z, zz, x))
+        ndtype = [('A', '|S3'), ('B', float), ('C', float), ('f3', int)]
+        control = ma.array([('A', 1, -1, -1), ('B', 2, -1, -1),
+                            ('a', 10., 100., -1), ('b', 20., 200., -1),
+                            ('c', 30., 300., -1),
+                            (-1, -1, -1, 1), (-1, -1, -1, 2)],
+                           dtype=ndtype,
+                           mask=[(0, 0, 1, 1), (0, 0, 1, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (1, 1, 1, 0), (1, 1, 1, 0)])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+    def test_defaults(self):
+        # Test defaults: no exception raised if keys of defaults are not fields.
+        (_, _, _, z) = self.data
+        zz = np.array([('a', 10., 100.), ('b', 20., 200.), ('c', 30., 300.)],
+                      dtype=[('A', '|S3'), ('B', float), ('C', float)])
+        defaults = {'A': '???', 'B': -999., 'C': -9999., 'D': -99999.}
+        test = stack_arrays((z, zz), defaults=defaults)
+        control = ma.array([('A', 1, -9999.), ('B', 2, -9999.),
+                            (
+                                'a', 10., 100.), ('b', 20., 200.), ('c', 30., 300.)],
+                           dtype=[('A', '|S3'), ('B', float), ('C', float)],
+                           mask=[(0, 0, 1), (0, 0, 1),
+                                 (0, 0, 0), (0, 0, 0), (0, 0, 0)])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+    def test_autoconversion(self):
+        # Tests autoconversion
+        adtype = [('A', int), ('B', bool), ('C', float)]
+        a = ma.array([(1, 2, 3)], mask=[(0, 1, 0)], dtype=adtype)
+        bdtype = [('A', int), ('B', float), ('C', float)]
+        b = ma.array([(4, 5, 6)], dtype=bdtype)
+        control = ma.array([(1, 2, 3), (4, 5, 6)], mask=[(0, 1, 0), (0, 0, 0)],
+                           dtype=bdtype)
+        test = stack_arrays((a, b), autoconvert=True)
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        with assert_raises(TypeError):
+            stack_arrays((a, b), autoconvert=False)
+
+    def test_checktitles(self):
+        # Test using titles in the field names
+        adtype = [(('a', 'A'), int), (('b', 'B'), bool), (('c', 'C'), float)]
+        a = ma.array([(1, 2, 3)], mask=[(0, 1, 0)], dtype=adtype)
+        bdtype = [(('a', 'A'), int), (('b', 'B'), bool), (('c', 'C'), float)]
+        b = ma.array([(4, 5, 6)], dtype=bdtype)
+        test = stack_arrays((a, b))
+        control = ma.array([(1, 2, 3), (4, 5, 6)], mask=[(0, 1, 0), (0, 0, 0)],
+                           dtype=bdtype)
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+
+    def test_subdtype(self):
+        z = np.array([
+            ('A', 1), ('B', 2)
+        ], dtype=[('A', '|S3'), ('B', float, (1,))])
+        zz = np.array([
+            ('a', [10.], 100.), ('b', [20.], 200.), ('c', [30.], 300.)
+        ], dtype=[('A', '|S3'), ('B', float, (1,)), ('C', float)])
+
+        res = stack_arrays((z, zz))
+        expected = ma.array(
+            data=[
+                (b'A', [1.0], 0),
+                (b'B', [2.0], 0),
+                (b'a', [10.0], 100.0),
+                (b'b', [20.0], 200.0),
+                (b'c', [30.0], 300.0)],
+            mask=[
+                (False, [False],  True),
+                (False, [False],  True),
+                (False, [False], False),
+                (False, [False], False),
+                (False, [False], False)
+            ],
+            dtype=zz.dtype
+        )
+        assert_equal(res.dtype, expected.dtype)
+        assert_equal(res, expected)
+        assert_equal(res.mask, expected.mask)
+
+
+class TestJoinBy:
+    def setup(self):
+        self.a = np.array(list(zip(np.arange(10), np.arange(50, 60),
+                                   np.arange(100, 110))),
+                          dtype=[('a', int), ('b', int), ('c', int)])
+        self.b = np.array(list(zip(np.arange(5, 15), np.arange(65, 75),
+                                   np.arange(100, 110))),
+                          dtype=[('a', int), ('b', int), ('d', int)])
+
+    def test_inner_join(self):
+        # Basic test of join_by
+        a, b = self.a, self.b
+
+        test = join_by('a', a, b, jointype='inner')
+        control = np.array([(5, 55, 65, 105, 100), (6, 56, 66, 106, 101),
+                            (7, 57, 67, 107, 102), (8, 58, 68, 108, 103),
+                            (9, 59, 69, 109, 104)],
+                           dtype=[('a', int), ('b1', int), ('b2', int),
+                                  ('c', int), ('d', int)])
+        assert_equal(test, control)
+
+    def test_join(self):
+        a, b = self.a, self.b
+
+        # Fixme, this test is broken
+        #test = join_by(('a', 'b'), a, b)
+        #control = np.array([(5, 55, 105, 100), (6, 56, 106, 101),
+        #                    (7, 57, 107, 102), (8, 58, 108, 103),
+        #                    (9, 59, 109, 104)],
+        #                   dtype=[('a', int), ('b', int),
+        #                          ('c', int), ('d', int)])
+        #assert_equal(test, control)
+
+        # Hack to avoid pyflakes unused variable warnings
+        join_by(('a', 'b'), a, b)
+        np.array([(5, 55, 105, 100), (6, 56, 106, 101),
+                  (7, 57, 107, 102), (8, 58, 108, 103),
+                  (9, 59, 109, 104)],
+                  dtype=[('a', int), ('b', int),
+                         ('c', int), ('d', int)])
+
+    def test_join_subdtype(self):
+        # tests the bug in https://stackoverflow.com/q/44769632/102441
+        foo = np.array([(1,)],
+                       dtype=[('key', int)])
+        bar = np.array([(1, np.array([1,2,3]))],
+                       dtype=[('key', int), ('value', 'uint16', 3)])
+        res = join_by('key', foo, bar)
+        assert_equal(res, bar.view(ma.MaskedArray))
+
+    def test_outer_join(self):
+        a, b = self.a, self.b
+
+        test = join_by(('a', 'b'), a, b, 'outer')
+        control = ma.array([(0, 50, 100, -1), (1, 51, 101, -1),
+                            (2, 52, 102, -1), (3, 53, 103, -1),
+                            (4, 54, 104, -1), (5, 55, 105, -1),
+                            (5, 65, -1, 100), (6, 56, 106, -1),
+                            (6, 66, -1, 101), (7, 57, 107, -1),
+                            (7, 67, -1, 102), (8, 58, 108, -1),
+                            (8, 68, -1, 103), (9, 59, 109, -1),
+                            (9, 69, -1, 104), (10, 70, -1, 105),
+                            (11, 71, -1, 106), (12, 72, -1, 107),
+                            (13, 73, -1, 108), (14, 74, -1, 109)],
+                           mask=[(0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 1, 0), (0, 0, 0, 1),
+                                 (0, 0, 1, 0), (0, 0, 0, 1),
+                                 (0, 0, 1, 0), (0, 0, 0, 1),
+                                 (0, 0, 1, 0), (0, 0, 0, 1),
+                                 (0, 0, 1, 0), (0, 0, 1, 0),
+                                 (0, 0, 1, 0), (0, 0, 1, 0),
+                                 (0, 0, 1, 0), (0, 0, 1, 0)],
+                           dtype=[('a', int), ('b', int),
+                                  ('c', int), ('d', int)])
+        assert_equal(test, control)
+
+    def test_leftouter_join(self):
+        a, b = self.a, self.b
+
+        test = join_by(('a', 'b'), a, b, 'leftouter')
+        control = ma.array([(0, 50, 100, -1), (1, 51, 101, -1),
+                            (2, 52, 102, -1), (3, 53, 103, -1),
+                            (4, 54, 104, -1), (5, 55, 105, -1),
+                            (6, 56, 106, -1), (7, 57, 107, -1),
+                            (8, 58, 108, -1), (9, 59, 109, -1)],
+                           mask=[(0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1),
+                                 (0, 0, 0, 1), (0, 0, 0, 1)],
+                           dtype=[('a', int), ('b', int), ('c', int), ('d', int)])
+        assert_equal(test, control)
+
+    def test_different_field_order(self):
+        # gh-8940
+        a = np.zeros(3, dtype=[('a', 'i4'), ('b', 'f4'), ('c', 'u1')])
+        b = np.ones(3, dtype=[('c', 'u1'), ('b', 'f4'), ('a', 'i4')])
+        # this should not give a FutureWarning:
+        j = join_by(['c', 'b'], a, b, jointype='inner', usemask=False)
+        assert_equal(j.dtype.names, ['b', 'c', 'a1', 'a2'])
+
+    def test_duplicate_keys(self):
+        a = np.zeros(3, dtype=[('a', 'i4'), ('b', 'f4'), ('c', 'u1')])
+        b = np.ones(3, dtype=[('c', 'u1'), ('b', 'f4'), ('a', 'i4')])
+        assert_raises(ValueError, join_by, ['a', 'b', 'b'], a, b)
+
+    @pytest.mark.xfail(reason="See comment at gh-9343")
+    def test_same_name_different_dtypes_key(self):
+        a_dtype = np.dtype([('key', 'S5'), ('value', '<f4')])
+        b_dtype = np.dtype([('key', 'S10'), ('value', '<f4')])
+        expected_dtype = np.dtype([
+            ('key', 'S10'), ('value1', '<f4'), ('value2', '<f4')])
+
+        a = np.array([('Sarah',  8.0), ('John', 6.0)], dtype=a_dtype)
+        b = np.array([('Sarah', 10.0), ('John', 7.0)], dtype=b_dtype)
+        res = join_by('key', a, b)
+
+        assert_equal(res.dtype, expected_dtype)
+
+    def test_same_name_different_dtypes(self):
+        # gh-9338
+        a_dtype = np.dtype([('key', 'S10'), ('value', '<f4')])
+        b_dtype = np.dtype([('key', 'S10'), ('value', '<f8')])
+        expected_dtype = np.dtype([
+            ('key', '|S10'), ('value1', '<f4'), ('value2', '<f8')])
+
+        a = np.array([('Sarah',  8.0), ('John', 6.0)], dtype=a_dtype)
+        b = np.array([('Sarah', 10.0), ('John', 7.0)], dtype=b_dtype)
+        res = join_by('key', a, b)
+
+        assert_equal(res.dtype, expected_dtype)
+
+    def test_subarray_key(self):
+        a_dtype = np.dtype([('pos', int, 3), ('f', '<f4')])
+        a = np.array([([1, 1, 1], np.pi), ([1, 2, 3], 0.0)], dtype=a_dtype)
+
+        b_dtype = np.dtype([('pos', int, 3), ('g', '<f4')])
+        b = np.array([([1, 1, 1], 3), ([3, 2, 1], 0.0)], dtype=b_dtype)
+
+        expected_dtype = np.dtype([('pos', int, 3), ('f', '<f4'), ('g', '<f4')])
+        expected = np.array([([1, 1, 1], np.pi, 3)], dtype=expected_dtype)
+
+        res = join_by('pos', a, b)
+        assert_equal(res.dtype, expected_dtype)
+        assert_equal(res, expected)
+
+    def test_padded_dtype(self):
+        dt = np.dtype('i1,f4', align=True)
+        dt.names = ('k', 'v')
+        assert_(len(dt.descr), 3)  # padding field is inserted
+
+        a = np.array([(1, 3), (3, 2)], dt)
+        b = np.array([(1, 1), (2, 2)], dt)
+        res = join_by('k', a, b)
+
+        # no padding fields remain
+        expected_dtype = np.dtype([
+            ('k', 'i1'), ('v1', 'f4'), ('v2', 'f4')
+        ])
+
+        assert_equal(res.dtype, expected_dtype)
+
+
+class TestJoinBy2:
+    @classmethod
+    def setup(cls):
+        cls.a = np.array(list(zip(np.arange(10), np.arange(50, 60),
+                                  np.arange(100, 110))),
+                         dtype=[('a', int), ('b', int), ('c', int)])
+        cls.b = np.array(list(zip(np.arange(10), np.arange(65, 75),
+                                  np.arange(100, 110))),
+                         dtype=[('a', int), ('b', int), ('d', int)])
+
+    def test_no_r1postfix(self):
+        # Basic test of join_by no_r1postfix
+        a, b = self.a, self.b
+
+        test = join_by(
+            'a', a, b, r1postfix='', r2postfix='2', jointype='inner')
+        control = np.array([(0, 50, 65, 100, 100), (1, 51, 66, 101, 101),
+                            (2, 52, 67, 102, 102), (3, 53, 68, 103, 103),
+                            (4, 54, 69, 104, 104), (5, 55, 70, 105, 105),
+                            (6, 56, 71, 106, 106), (7, 57, 72, 107, 107),
+                            (8, 58, 73, 108, 108), (9, 59, 74, 109, 109)],
+                           dtype=[('a', int), ('b', int), ('b2', int),
+                                  ('c', int), ('d', int)])
+        assert_equal(test, control)
+
+    def test_no_postfix(self):
+        assert_raises(ValueError, join_by, 'a', self.a, self.b,
+                      r1postfix='', r2postfix='')
+
+    def test_no_r2postfix(self):
+        # Basic test of join_by no_r2postfix
+        a, b = self.a, self.b
+
+        test = join_by(
+            'a', a, b, r1postfix='1', r2postfix='', jointype='inner')
+        control = np.array([(0, 50, 65, 100, 100), (1, 51, 66, 101, 101),
+                            (2, 52, 67, 102, 102), (3, 53, 68, 103, 103),
+                            (4, 54, 69, 104, 104), (5, 55, 70, 105, 105),
+                            (6, 56, 71, 106, 106), (7, 57, 72, 107, 107),
+                            (8, 58, 73, 108, 108), (9, 59, 74, 109, 109)],
+                           dtype=[('a', int), ('b1', int), ('b', int),
+                                  ('c', int), ('d', int)])
+        assert_equal(test, control)
+
+    def test_two_keys_two_vars(self):
+        a = np.array(list(zip(np.tile([10, 11], 5), np.repeat(np.arange(5), 2),
+                              np.arange(50, 60), np.arange(10, 20))),
+                     dtype=[('k', int), ('a', int), ('b', int), ('c', int)])
+
+        b = np.array(list(zip(np.tile([10, 11], 5), np.repeat(np.arange(5), 2),
+                              np.arange(65, 75), np.arange(0, 10))),
+                     dtype=[('k', int), ('a', int), ('b', int), ('c', int)])
+
+        control = np.array([(10, 0, 50, 65, 10, 0), (11, 0, 51, 66, 11, 1),
+                            (10, 1, 52, 67, 12, 2), (11, 1, 53, 68, 13, 3),
+                            (10, 2, 54, 69, 14, 4), (11, 2, 55, 70, 15, 5),
+                            (10, 3, 56, 71, 16, 6), (11, 3, 57, 72, 17, 7),
+                            (10, 4, 58, 73, 18, 8), (11, 4, 59, 74, 19, 9)],
+                           dtype=[('k', int), ('a', int), ('b1', int),
+                                  ('b2', int), ('c1', int), ('c2', int)])
+        test = join_by(
+            ['a', 'k'], a, b, r1postfix='1', r2postfix='2', jointype='inner')
+        assert_equal(test.dtype, control.dtype)
+        assert_equal(test, control)
+
+class TestAppendFieldsObj:
+    """
+    Test append_fields with arrays containing objects
+    """
+    # https://github.com/numpy/numpy/issues/2346
+
+    def setup(self):
+        from datetime import date
+        self.data = dict(obj=date(2000, 1, 1))
+
+    def test_append_to_objects(self):
+        "Test append_fields when the base array contains objects"
+        obj = self.data['obj']
+        x = np.array([(obj, 1.), (obj, 2.)],
+                      dtype=[('A', object), ('B', float)])
+        y = np.array([10, 20], dtype=int)
+        test = append_fields(x, 'C', data=y, usemask=False)
+        control = np.array([(obj, 1.0, 10), (obj, 2.0, 20)],
+                           dtype=[('A', object), ('B', float), ('C', int)])
+        assert_equal(test, control)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_regression.py b/venv/Lib/site-packages/numpy/lib/tests/test_regression.py
new file mode 100644
index 000000000..55df2a675
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_regression.py
@@ -0,0 +1,247 @@
+import os
+
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_array_almost_equal,
+    assert_raises, _assert_valid_refcount,
+    )
+
+
+class TestRegression:
+    def test_poly1d(self):
+        # Ticket #28
+        assert_equal(np.poly1d([1]) - np.poly1d([1, 0]),
+                     np.poly1d([-1, 1]))
+
+    def test_cov_parameters(self):
+        # Ticket #91
+        x = np.random.random((3, 3))
+        y = x.copy()
+        np.cov(x, rowvar=True)
+        np.cov(y, rowvar=False)
+        assert_array_equal(x, y)
+
+    def test_mem_digitize(self):
+        # Ticket #95
+        for i in range(100):
+            np.digitize([1, 2, 3, 4], [1, 3])
+            np.digitize([0, 1, 2, 3, 4], [1, 3])
+
+    def test_unique_zero_sized(self):
+        # Ticket #205
+        assert_array_equal([], np.unique(np.array([])))
+
+    def test_mem_vectorise(self):
+        # Ticket #325
+        vt = np.vectorize(lambda *args: args)
+        vt(np.zeros((1, 2, 1)), np.zeros((2, 1, 1)), np.zeros((1, 1, 2)))
+        vt(np.zeros((1, 2, 1)), np.zeros((2, 1, 1)), np.zeros((1,
+           1, 2)), np.zeros((2, 2)))
+
+    def test_mgrid_single_element(self):
+        # Ticket #339
+        assert_array_equal(np.mgrid[0:0:1j], [0])
+        assert_array_equal(np.mgrid[0:0], [])
+
+    def test_refcount_vectorize(self):
+        # Ticket #378
+        def p(x, y):
+            return 123
+        v = np.vectorize(p)
+        _assert_valid_refcount(v)
+
+    def test_poly1d_nan_roots(self):
+        # Ticket #396
+        p = np.poly1d([np.nan, np.nan, 1], r=False)
+        assert_raises(np.linalg.LinAlgError, getattr, p, "r")
+
+    def test_mem_polymul(self):
+        # Ticket #448
+        np.polymul([], [1.])
+
+    def test_mem_string_concat(self):
+        # Ticket #469
+        x = np.array([])
+        np.append(x, 'asdasd\tasdasd')
+
+    def test_poly_div(self):
+        # Ticket #553
+        u = np.poly1d([1, 2, 3])
+        v = np.poly1d([1, 2, 3, 4, 5])
+        q, r = np.polydiv(u, v)
+        assert_equal(q*v + r, u)
+
+    def test_poly_eq(self):
+        # Ticket #554
+        x = np.poly1d([1, 2, 3])
+        y = np.poly1d([3, 4])
+        assert_(x != y)
+        assert_(x == x)
+
+    def test_polyfit_build(self):
+        # Ticket #628
+        ref = [-1.06123820e-06, 5.70886914e-04, -1.13822012e-01,
+               9.95368241e+00, -3.14526520e+02]
+        x = [90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103,
+             104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115,
+             116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 129,
+             130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141,
+             146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157,
+             158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169,
+             170, 171, 172, 173, 174, 175, 176]
+        y = [9.0, 3.0, 7.0, 4.0, 4.0, 8.0, 6.0, 11.0, 9.0, 8.0, 11.0, 5.0,
+             6.0, 5.0, 9.0, 8.0, 6.0, 10.0, 6.0, 10.0, 7.0, 6.0, 6.0, 6.0,
+             13.0, 4.0, 9.0, 11.0, 4.0, 5.0, 8.0, 5.0, 7.0, 7.0, 6.0, 12.0,
+             7.0, 7.0, 9.0, 4.0, 12.0, 6.0, 6.0, 4.0, 3.0, 9.0, 8.0, 8.0,
+             6.0, 7.0, 9.0, 10.0, 6.0, 8.0, 4.0, 7.0, 7.0, 10.0, 8.0, 8.0,
+             6.0, 3.0, 8.0, 4.0, 5.0, 7.0, 8.0, 6.0, 6.0, 4.0, 12.0, 9.0,
+             8.0, 8.0, 8.0, 6.0, 7.0, 4.0, 4.0, 5.0, 7.0]
+        tested = np.polyfit(x, y, 4)
+        assert_array_almost_equal(ref, tested)
+
+    def test_polydiv_type(self):
+        # Make polydiv work for complex types
+        msg = "Wrong type, should be complex"
+        x = np.ones(3, dtype=complex)
+        q, r = np.polydiv(x, x)
+        assert_(q.dtype == complex, msg)
+        msg = "Wrong type, should be float"
+        x = np.ones(3, dtype=int)
+        q, r = np.polydiv(x, x)
+        assert_(q.dtype == float, msg)
+
+    def test_histogramdd_too_many_bins(self):
+        # Ticket 928.
+        assert_raises(ValueError, np.histogramdd, np.ones((1, 10)), bins=2**10)
+
+    def test_polyint_type(self):
+        # Ticket #944
+        msg = "Wrong type, should be complex"
+        x = np.ones(3, dtype=complex)
+        assert_(np.polyint(x).dtype == complex, msg)
+        msg = "Wrong type, should be float"
+        x = np.ones(3, dtype=int)
+        assert_(np.polyint(x).dtype == float, msg)
+
+    def test_ndenumerate_crash(self):
+        # Ticket 1140
+        # Shouldn't crash:
+        list(np.ndenumerate(np.array([[]])))
+
+    def test_asfarray_none(self):
+        # Test for changeset r5065
+        assert_array_equal(np.array([np.nan]), np.asfarray([None]))
+
+    def test_large_fancy_indexing(self):
+        # Large enough to fail on 64-bit.
+        nbits = np.dtype(np.intp).itemsize * 8
+        thesize = int((2**nbits)**(1.0/5.0)+1)
+
+        def dp():
+            n = 3
+            a = np.ones((n,)*5)
+            i = np.random.randint(0, n, size=thesize)
+            a[np.ix_(i, i, i, i, i)] = 0
+
+        def dp2():
+            n = 3
+            a = np.ones((n,)*5)
+            i = np.random.randint(0, n, size=thesize)
+            a[np.ix_(i, i, i, i, i)]
+
+        assert_raises(ValueError, dp)
+        assert_raises(ValueError, dp2)
+
+    def test_void_coercion(self):
+        dt = np.dtype([('a', 'f4'), ('b', 'i4')])
+        x = np.zeros((1,), dt)
+        assert_(np.r_[x, x].dtype == dt)
+
+    def test_who_with_0dim_array(self):
+        # ticket #1243
+        import os
+        import sys
+
+        oldstdout = sys.stdout
+        sys.stdout = open(os.devnull, 'w')
+        try:
+            try:
+                np.who({'foo': np.array(1)})
+            except Exception:
+                raise AssertionError("ticket #1243")
+        finally:
+            sys.stdout.close()
+            sys.stdout = oldstdout
+
+    def test_include_dirs(self):
+        # As a sanity check, just test that get_include
+        # includes something reasonable.  Somewhat
+        # related to ticket #1405.
+        include_dirs = [np.get_include()]
+        for path in include_dirs:
+            assert_(isinstance(path, str))
+            assert_(path != '')
+
+    def test_polyder_return_type(self):
+        # Ticket #1249
+        assert_(isinstance(np.polyder(np.poly1d([1]), 0), np.poly1d))
+        assert_(isinstance(np.polyder([1], 0), np.ndarray))
+        assert_(isinstance(np.polyder(np.poly1d([1]), 1), np.poly1d))
+        assert_(isinstance(np.polyder([1], 1), np.ndarray))
+
+    def test_append_fields_dtype_list(self):
+        # Ticket #1676
+        from numpy.lib.recfunctions import append_fields
+
+        base = np.array([1, 2, 3], dtype=np.int32)
+        names = ['a', 'b', 'c']
+        data = np.eye(3).astype(np.int32)
+        dlist = [np.float64, np.int32, np.int32]
+        try:
+            append_fields(base, names, data, dlist)
+        except Exception:
+            raise AssertionError()
+
+    def test_loadtxt_fields_subarrays(self):
+        # For ticket #1936
+        from io import StringIO
+
+        dt = [("a", 'u1', 2), ("b", 'u1', 2)]
+        x = np.loadtxt(StringIO("0 1 2 3"), dtype=dt)
+        assert_equal(x, np.array([((0, 1), (2, 3))], dtype=dt))
+
+        dt = [("a", [("a", 'u1', (1, 3)), ("b", 'u1')])]
+        x = np.loadtxt(StringIO("0 1 2 3"), dtype=dt)
+        assert_equal(x, np.array([(((0, 1, 2), 3),)], dtype=dt))
+
+        dt = [("a", 'u1', (2, 2))]
+        x = np.loadtxt(StringIO("0 1 2 3"), dtype=dt)
+        assert_equal(x, np.array([(((0, 1), (2, 3)),)], dtype=dt))
+
+        dt = [("a", 'u1', (2, 3, 2))]
+        x = np.loadtxt(StringIO("0 1 2 3 4 5 6 7 8 9 10 11"), dtype=dt)
+        data = [((((0, 1), (2, 3), (4, 5)), ((6, 7), (8, 9), (10, 11))),)]
+        assert_equal(x, np.array(data, dtype=dt))
+
+    def test_nansum_with_boolean(self):
+        # gh-2978
+        a = np.zeros(2, dtype=bool)
+        try:
+            np.nansum(a)
+        except Exception:
+            raise AssertionError()
+
+    def test_py3_compat(self):
+        # gh-2561
+        # Test if the oldstyle class test is bypassed in python3
+        class C():
+            """Old-style class in python2, normal class in python3"""
+            pass
+
+        out = open(os.devnull, 'w')
+        try:
+            np.info(C(), output=out)
+        except AttributeError:
+            raise AssertionError()
+        finally:
+            out.close()
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_shape_base.py b/venv/Lib/site-packages/numpy/lib/tests/test_shape_base.py
new file mode 100644
index 000000000..fb7ba7874
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_shape_base.py
@@ -0,0 +1,717 @@
+import numpy as np
+import functools
+import sys
+import pytest
+
+from numpy.lib.shape_base import (
+    apply_along_axis, apply_over_axes, array_split, split, hsplit, dsplit,
+    vsplit, dstack, column_stack, kron, tile, expand_dims, take_along_axis,
+    put_along_axis
+    )
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_raises, assert_warns
+    )
+
+
+IS_64BIT = sys.maxsize > 2**32
+
+
+def _add_keepdims(func):
+    """ hack in keepdims behavior into a function taking an axis """
+    @functools.wraps(func)
+    def wrapped(a, axis, **kwargs):
+        res = func(a, axis=axis, **kwargs)
+        if axis is None:
+            axis = 0  # res is now a scalar, so we can insert this anywhere
+        return np.expand_dims(res, axis=axis)
+    return wrapped
+
+
+class TestTakeAlongAxis:
+    def test_argequivalent(self):
+        """ Test it translates from arg<func> to <func> """
+        from numpy.random import rand
+        a = rand(3, 4, 5)
+
+        funcs = [
+            (np.sort, np.argsort, dict()),
+            (_add_keepdims(np.min), _add_keepdims(np.argmin), dict()),
+            (_add_keepdims(np.max), _add_keepdims(np.argmax), dict()),
+            (np.partition, np.argpartition, dict(kth=2)),
+        ]
+
+        for func, argfunc, kwargs in funcs:
+            for axis in list(range(a.ndim)) + [None]:
+                a_func = func(a, axis=axis, **kwargs)
+                ai_func = argfunc(a, axis=axis, **kwargs)
+                assert_equal(a_func, take_along_axis(a, ai_func, axis=axis))
+
+    def test_invalid(self):
+        """ Test it errors when indices has too few dimensions """
+        a = np.ones((10, 10))
+        ai = np.ones((10, 2), dtype=np.intp)
+
+        # sanity check
+        take_along_axis(a, ai, axis=1)
+
+        # not enough indices
+        assert_raises(ValueError, take_along_axis, a, np.array(1), axis=1)
+        # bool arrays not allowed
+        assert_raises(IndexError, take_along_axis, a, ai.astype(bool), axis=1)
+        # float arrays not allowed
+        assert_raises(IndexError, take_along_axis, a, ai.astype(float), axis=1)
+        # invalid axis
+        assert_raises(np.AxisError, take_along_axis, a, ai, axis=10)
+
+    def test_empty(self):
+        """ Test everything is ok with empty results, even with inserted dims """
+        a  = np.ones((3, 4, 5))
+        ai = np.ones((3, 0, 5), dtype=np.intp)
+
+        actual = take_along_axis(a, ai, axis=1)
+        assert_equal(actual.shape, ai.shape)
+
+    def test_broadcast(self):
+        """ Test that non-indexing dimensions are broadcast in both directions """
+        a  = np.ones((3, 4, 1))
+        ai = np.ones((1, 2, 5), dtype=np.intp)
+        actual = take_along_axis(a, ai, axis=1)
+        assert_equal(actual.shape, (3, 2, 5))
+
+
+class TestPutAlongAxis:
+    def test_replace_max(self):
+        a_base = np.array([[10, 30, 20], [60, 40, 50]])
+
+        for axis in list(range(a_base.ndim)) + [None]:
+            # we mutate this in the loop
+            a = a_base.copy()
+
+            # replace the max with a small value
+            i_max = _add_keepdims(np.argmax)(a, axis=axis)
+            put_along_axis(a, i_max, -99, axis=axis)
+
+            # find the new minimum, which should max
+            i_min = _add_keepdims(np.argmin)(a, axis=axis)
+
+            assert_equal(i_min, i_max)
+
+    def test_broadcast(self):
+        """ Test that non-indexing dimensions are broadcast in both directions """
+        a  = np.ones((3, 4, 1))
+        ai = np.arange(10, dtype=np.intp).reshape((1, 2, 5)) % 4
+        put_along_axis(a, ai, 20, axis=1)
+        assert_equal(take_along_axis(a, ai, axis=1), 20)
+
+
+class TestApplyAlongAxis:
+    def test_simple(self):
+        a = np.ones((20, 10), 'd')
+        assert_array_equal(
+            apply_along_axis(len, 0, a), len(a)*np.ones(a.shape[1]))
+
+    def test_simple101(self):
+        a = np.ones((10, 101), 'd')
+        assert_array_equal(
+            apply_along_axis(len, 0, a), len(a)*np.ones(a.shape[1]))
+
+    def test_3d(self):
+        a = np.arange(27).reshape((3, 3, 3))
+        assert_array_equal(apply_along_axis(np.sum, 0, a),
+                           [[27, 30, 33], [36, 39, 42], [45, 48, 51]])
+
+    def test_preserve_subclass(self):
+        def double(row):
+            return row * 2
+
+        class MyNDArray(np.ndarray):
+            pass
+
+        m = np.array([[0, 1], [2, 3]]).view(MyNDArray)
+        expected = np.array([[0, 2], [4, 6]]).view(MyNDArray)
+
+        result = apply_along_axis(double, 0, m)
+        assert_(isinstance(result, MyNDArray))
+        assert_array_equal(result, expected)
+
+        result = apply_along_axis(double, 1, m)
+        assert_(isinstance(result, MyNDArray))
+        assert_array_equal(result, expected)
+
+    def test_subclass(self):
+        class MinimalSubclass(np.ndarray):
+            data = 1
+
+        def minimal_function(array):
+            return array.data
+
+        a = np.zeros((6, 3)).view(MinimalSubclass)
+
+        assert_array_equal(
+            apply_along_axis(minimal_function, 0, a), np.array([1, 1, 1])
+        )
+
+    def test_scalar_array(self, cls=np.ndarray):
+        a = np.ones((6, 3)).view(cls)
+        res = apply_along_axis(np.sum, 0, a)
+        assert_(isinstance(res, cls))
+        assert_array_equal(res, np.array([6, 6, 6]).view(cls))
+
+    def test_0d_array(self, cls=np.ndarray):
+        def sum_to_0d(x):
+            """ Sum x, returning a 0d array of the same class """
+            assert_equal(x.ndim, 1)
+            return np.squeeze(np.sum(x, keepdims=True))
+        a = np.ones((6, 3)).view(cls)
+        res = apply_along_axis(sum_to_0d, 0, a)
+        assert_(isinstance(res, cls))
+        assert_array_equal(res, np.array([6, 6, 6]).view(cls))
+
+        res = apply_along_axis(sum_to_0d, 1, a)
+        assert_(isinstance(res, cls))
+        assert_array_equal(res, np.array([3, 3, 3, 3, 3, 3]).view(cls))
+
+    def test_axis_insertion(self, cls=np.ndarray):
+        def f1to2(x):
+            """produces an asymmetric non-square matrix from x"""
+            assert_equal(x.ndim, 1)
+            return (x[::-1] * x[1:,None]).view(cls)
+
+        a2d = np.arange(6*3).reshape((6, 3))
+
+        # 2d insertion along first axis
+        actual = apply_along_axis(f1to2, 0, a2d)
+        expected = np.stack([
+            f1to2(a2d[:,i]) for i in range(a2d.shape[1])
+        ], axis=-1).view(cls)
+        assert_equal(type(actual), type(expected))
+        assert_equal(actual, expected)
+
+        # 2d insertion along last axis
+        actual = apply_along_axis(f1to2, 1, a2d)
+        expected = np.stack([
+            f1to2(a2d[i,:]) for i in range(a2d.shape[0])
+        ], axis=0).view(cls)
+        assert_equal(type(actual), type(expected))
+        assert_equal(actual, expected)
+
+        # 3d insertion along middle axis
+        a3d = np.arange(6*5*3).reshape((6, 5, 3))
+
+        actual = apply_along_axis(f1to2, 1, a3d)
+        expected = np.stack([
+            np.stack([
+                f1to2(a3d[i,:,j]) for i in range(a3d.shape[0])
+            ], axis=0)
+            for j in range(a3d.shape[2])
+        ], axis=-1).view(cls)
+        assert_equal(type(actual), type(expected))
+        assert_equal(actual, expected)
+
+    def test_subclass_preservation(self):
+        class MinimalSubclass(np.ndarray):
+            pass
+        self.test_scalar_array(MinimalSubclass)
+        self.test_0d_array(MinimalSubclass)
+        self.test_axis_insertion(MinimalSubclass)
+
+    def test_axis_insertion_ma(self):
+        def f1to2(x):
+            """produces an asymmetric non-square matrix from x"""
+            assert_equal(x.ndim, 1)
+            res = x[::-1] * x[1:,None]
+            return np.ma.masked_where(res%5==0, res)
+        a = np.arange(6*3).reshape((6, 3))
+        res = apply_along_axis(f1to2, 0, a)
+        assert_(isinstance(res, np.ma.masked_array))
+        assert_equal(res.ndim, 3)
+        assert_array_equal(res[:,:,0].mask, f1to2(a[:,0]).mask)
+        assert_array_equal(res[:,:,1].mask, f1to2(a[:,1]).mask)
+        assert_array_equal(res[:,:,2].mask, f1to2(a[:,2]).mask)
+
+    def test_tuple_func1d(self):
+        def sample_1d(x):
+            return x[1], x[0]
+        res = np.apply_along_axis(sample_1d, 1, np.array([[1, 2], [3, 4]]))
+        assert_array_equal(res, np.array([[2, 1], [4, 3]]))
+
+    def test_empty(self):
+        # can't apply_along_axis when there's no chance to call the function
+        def never_call(x):
+            assert_(False) # should never be reached
+
+        a = np.empty((0, 0))
+        assert_raises(ValueError, np.apply_along_axis, never_call, 0, a)
+        assert_raises(ValueError, np.apply_along_axis, never_call, 1, a)
+
+        # but it's sometimes ok with some non-zero dimensions
+        def empty_to_1(x):
+            assert_(len(x) == 0)
+            return 1
+
+        a = np.empty((10, 0))
+        actual = np.apply_along_axis(empty_to_1, 1, a)
+        assert_equal(actual, np.ones(10))
+        assert_raises(ValueError, np.apply_along_axis, empty_to_1, 0, a)
+
+    def test_with_iterable_object(self):
+        # from issue 5248
+        d = np.array([
+            [{1, 11}, {2, 22}, {3, 33}],
+            [{4, 44}, {5, 55}, {6, 66}]
+        ])
+        actual = np.apply_along_axis(lambda a: set.union(*a), 0, d)
+        expected = np.array([{1, 11, 4, 44}, {2, 22, 5, 55}, {3, 33, 6, 66}])
+
+        assert_equal(actual, expected)
+
+        # issue 8642 - assert_equal doesn't detect this!
+        for i in np.ndindex(actual.shape):
+            assert_equal(type(actual[i]), type(expected[i]))
+
+
+class TestApplyOverAxes:
+    def test_simple(self):
+        a = np.arange(24).reshape(2, 3, 4)
+        aoa_a = apply_over_axes(np.sum, a, [0, 2])
+        assert_array_equal(aoa_a, np.array([[[60], [92], [124]]]))
+
+
+class TestExpandDims:
+    def test_functionality(self):
+        s = (2, 3, 4, 5)
+        a = np.empty(s)
+        for axis in range(-5, 4):
+            b = expand_dims(a, axis)
+            assert_(b.shape[axis] == 1)
+            assert_(np.squeeze(b).shape == s)
+
+    def test_axis_tuple(self):
+        a = np.empty((3, 3, 3))
+        assert np.expand_dims(a, axis=(0, 1, 2)).shape == (1, 1, 1, 3, 3, 3)
+        assert np.expand_dims(a, axis=(0, -1, -2)).shape == (1, 3, 3, 3, 1, 1)
+        assert np.expand_dims(a, axis=(0, 3, 5)).shape == (1, 3, 3, 1, 3, 1)
+        assert np.expand_dims(a, axis=(0, -3, -5)).shape == (1, 1, 3, 1, 3, 3)
+
+    def test_axis_out_of_range(self):
+        s = (2, 3, 4, 5)
+        a = np.empty(s)
+        assert_raises(np.AxisError, expand_dims, a, -6)
+        assert_raises(np.AxisError, expand_dims, a, 5)
+
+        a = np.empty((3, 3, 3))
+        assert_raises(np.AxisError, expand_dims, a, (0, -6))
+        assert_raises(np.AxisError, expand_dims, a, (0, 5))
+
+    def test_repeated_axis(self):
+        a = np.empty((3, 3, 3))
+        assert_raises(ValueError, expand_dims, a, axis=(1, 1))
+
+    def test_subclasses(self):
+        a = np.arange(10).reshape((2, 5))
+        a = np.ma.array(a, mask=a%3 == 0)
+
+        expanded = np.expand_dims(a, axis=1)
+        assert_(isinstance(expanded, np.ma.MaskedArray))
+        assert_equal(expanded.shape, (2, 1, 5))
+        assert_equal(expanded.mask.shape, (2, 1, 5))
+
+
+class TestArraySplit:
+    def test_integer_0_split(self):
+        a = np.arange(10)
+        assert_raises(ValueError, array_split, a, 0)
+
+    def test_integer_split(self):
+        a = np.arange(10)
+        res = array_split(a, 1)
+        desired = [np.arange(10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 2)
+        desired = [np.arange(5), np.arange(5, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 3)
+        desired = [np.arange(4), np.arange(4, 7), np.arange(7, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 4)
+        desired = [np.arange(3), np.arange(3, 6), np.arange(6, 8),
+                   np.arange(8, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 5)
+        desired = [np.arange(2), np.arange(2, 4), np.arange(4, 6),
+                   np.arange(6, 8), np.arange(8, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 6)
+        desired = [np.arange(2), np.arange(2, 4), np.arange(4, 6),
+                   np.arange(6, 8), np.arange(8, 9), np.arange(9, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 7)
+        desired = [np.arange(2), np.arange(2, 4), np.arange(4, 6),
+                   np.arange(6, 7), np.arange(7, 8), np.arange(8, 9),
+                   np.arange(9, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 8)
+        desired = [np.arange(2), np.arange(2, 4), np.arange(4, 5),
+                   np.arange(5, 6), np.arange(6, 7), np.arange(7, 8),
+                   np.arange(8, 9), np.arange(9, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 9)
+        desired = [np.arange(2), np.arange(2, 3), np.arange(3, 4),
+                   np.arange(4, 5), np.arange(5, 6), np.arange(6, 7),
+                   np.arange(7, 8), np.arange(8, 9), np.arange(9, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 10)
+        desired = [np.arange(1), np.arange(1, 2), np.arange(2, 3),
+                   np.arange(3, 4), np.arange(4, 5), np.arange(5, 6),
+                   np.arange(6, 7), np.arange(7, 8), np.arange(8, 9),
+                   np.arange(9, 10)]
+        compare_results(res, desired)
+
+        res = array_split(a, 11)
+        desired = [np.arange(1), np.arange(1, 2), np.arange(2, 3),
+                   np.arange(3, 4), np.arange(4, 5), np.arange(5, 6),
+                   np.arange(6, 7), np.arange(7, 8), np.arange(8, 9),
+                   np.arange(9, 10), np.array([])]
+        compare_results(res, desired)
+
+    def test_integer_split_2D_rows(self):
+        a = np.array([np.arange(10), np.arange(10)])
+        res = array_split(a, 3, axis=0)
+        tgt = [np.array([np.arange(10)]), np.array([np.arange(10)]),
+                   np.zeros((0, 10))]
+        compare_results(res, tgt)
+        assert_(a.dtype.type is res[-1].dtype.type)
+
+        # Same thing for manual splits:
+        res = array_split(a, [0, 1, 2], axis=0)
+        tgt = [np.zeros((0, 10)), np.array([np.arange(10)]),
+               np.array([np.arange(10)])]
+        compare_results(res, tgt)
+        assert_(a.dtype.type is res[-1].dtype.type)
+
+    def test_integer_split_2D_cols(self):
+        a = np.array([np.arange(10), np.arange(10)])
+        res = array_split(a, 3, axis=-1)
+        desired = [np.array([np.arange(4), np.arange(4)]),
+                   np.array([np.arange(4, 7), np.arange(4, 7)]),
+                   np.array([np.arange(7, 10), np.arange(7, 10)])]
+        compare_results(res, desired)
+
+    def test_integer_split_2D_default(self):
+        """ This will fail if we change default axis
+        """
+        a = np.array([np.arange(10), np.arange(10)])
+        res = array_split(a, 3)
+        tgt = [np.array([np.arange(10)]), np.array([np.arange(10)]),
+                   np.zeros((0, 10))]
+        compare_results(res, tgt)
+        assert_(a.dtype.type is res[-1].dtype.type)
+        # perhaps should check higher dimensions
+
+    @pytest.mark.skipif(not IS_64BIT, reason="Needs 64bit platform")
+    def test_integer_split_2D_rows_greater_max_int32(self):
+        a = np.broadcast_to([0], (1 << 32, 2))
+        res = array_split(a, 4)
+        chunk = np.broadcast_to([0], (1 << 30, 2))
+        tgt = [chunk] * 4
+        for i in range(len(tgt)):
+            assert_equal(res[i].shape, tgt[i].shape)
+
+    def test_index_split_simple(self):
+        a = np.arange(10)
+        indices = [1, 5, 7]
+        res = array_split(a, indices, axis=-1)
+        desired = [np.arange(0, 1), np.arange(1, 5), np.arange(5, 7),
+                   np.arange(7, 10)]
+        compare_results(res, desired)
+
+    def test_index_split_low_bound(self):
+        a = np.arange(10)
+        indices = [0, 5, 7]
+        res = array_split(a, indices, axis=-1)
+        desired = [np.array([]), np.arange(0, 5), np.arange(5, 7),
+                   np.arange(7, 10)]
+        compare_results(res, desired)
+
+    def test_index_split_high_bound(self):
+        a = np.arange(10)
+        indices = [0, 5, 7, 10, 12]
+        res = array_split(a, indices, axis=-1)
+        desired = [np.array([]), np.arange(0, 5), np.arange(5, 7),
+                   np.arange(7, 10), np.array([]), np.array([])]
+        compare_results(res, desired)
+
+
+class TestSplit:
+    # The split function is essentially the same as array_split,
+    # except that it test if splitting will result in an
+    # equal split.  Only test for this case.
+
+    def test_equal_split(self):
+        a = np.arange(10)
+        res = split(a, 2)
+        desired = [np.arange(5), np.arange(5, 10)]
+        compare_results(res, desired)
+
+    def test_unequal_split(self):
+        a = np.arange(10)
+        assert_raises(ValueError, split, a, 3)
+
+
+class TestColumnStack:
+    def test_non_iterable(self):
+        assert_raises(TypeError, column_stack, 1)
+
+    def test_1D_arrays(self):
+        # example from docstring
+        a = np.array((1, 2, 3))
+        b = np.array((2, 3, 4))
+        expected = np.array([[1, 2],
+                             [2, 3],
+                             [3, 4]])
+        actual = np.column_stack((a, b))
+        assert_equal(actual, expected)
+
+    def test_2D_arrays(self):
+        # same as hstack 2D docstring example
+        a = np.array([[1], [2], [3]])
+        b = np.array([[2], [3], [4]])
+        expected = np.array([[1, 2],
+                             [2, 3],
+                             [3, 4]])
+        actual = np.column_stack((a, b))
+        assert_equal(actual, expected)
+
+    def test_generator(self):
+        with assert_warns(FutureWarning):
+            column_stack((np.arange(3) for _ in range(2)))
+
+
+class TestDstack:
+    def test_non_iterable(self):
+        assert_raises(TypeError, dstack, 1)
+
+    def test_0D_array(self):
+        a = np.array(1)
+        b = np.array(2)
+        res = dstack([a, b])
+        desired = np.array([[[1, 2]]])
+        assert_array_equal(res, desired)
+
+    def test_1D_array(self):
+        a = np.array([1])
+        b = np.array([2])
+        res = dstack([a, b])
+        desired = np.array([[[1, 2]]])
+        assert_array_equal(res, desired)
+
+    def test_2D_array(self):
+        a = np.array([[1], [2]])
+        b = np.array([[1], [2]])
+        res = dstack([a, b])
+        desired = np.array([[[1, 1]], [[2, 2, ]]])
+        assert_array_equal(res, desired)
+
+    def test_2D_array2(self):
+        a = np.array([1, 2])
+        b = np.array([1, 2])
+        res = dstack([a, b])
+        desired = np.array([[[1, 1], [2, 2]]])
+        assert_array_equal(res, desired)
+
+    def test_generator(self):
+        with assert_warns(FutureWarning):
+            dstack((np.arange(3) for _ in range(2)))
+
+
+# array_split has more comprehensive test of splitting.
+# only do simple test on hsplit, vsplit, and dsplit
+class TestHsplit:
+    """Only testing for integer splits.
+
+    """
+    def test_non_iterable(self):
+        assert_raises(ValueError, hsplit, 1, 1)
+
+    def test_0D_array(self):
+        a = np.array(1)
+        try:
+            hsplit(a, 2)
+            assert_(0)
+        except ValueError:
+            pass
+
+    def test_1D_array(self):
+        a = np.array([1, 2, 3, 4])
+        res = hsplit(a, 2)
+        desired = [np.array([1, 2]), np.array([3, 4])]
+        compare_results(res, desired)
+
+    def test_2D_array(self):
+        a = np.array([[1, 2, 3, 4],
+                  [1, 2, 3, 4]])
+        res = hsplit(a, 2)
+        desired = [np.array([[1, 2], [1, 2]]), np.array([[3, 4], [3, 4]])]
+        compare_results(res, desired)
+
+
+class TestVsplit:
+    """Only testing for integer splits.
+
+    """
+    def test_non_iterable(self):
+        assert_raises(ValueError, vsplit, 1, 1)
+
+    def test_0D_array(self):
+        a = np.array(1)
+        assert_raises(ValueError, vsplit, a, 2)
+
+    def test_1D_array(self):
+        a = np.array([1, 2, 3, 4])
+        try:
+            vsplit(a, 2)
+            assert_(0)
+        except ValueError:
+            pass
+
+    def test_2D_array(self):
+        a = np.array([[1, 2, 3, 4],
+                  [1, 2, 3, 4]])
+        res = vsplit(a, 2)
+        desired = [np.array([[1, 2, 3, 4]]), np.array([[1, 2, 3, 4]])]
+        compare_results(res, desired)
+
+
+class TestDsplit:
+    # Only testing for integer splits.
+    def test_non_iterable(self):
+        assert_raises(ValueError, dsplit, 1, 1)
+
+    def test_0D_array(self):
+        a = np.array(1)
+        assert_raises(ValueError, dsplit, a, 2)
+
+    def test_1D_array(self):
+        a = np.array([1, 2, 3, 4])
+        assert_raises(ValueError, dsplit, a, 2)
+
+    def test_2D_array(self):
+        a = np.array([[1, 2, 3, 4],
+                  [1, 2, 3, 4]])
+        try:
+            dsplit(a, 2)
+            assert_(0)
+        except ValueError:
+            pass
+
+    def test_3D_array(self):
+        a = np.array([[[1, 2, 3, 4],
+                   [1, 2, 3, 4]],
+                  [[1, 2, 3, 4],
+                   [1, 2, 3, 4]]])
+        res = dsplit(a, 2)
+        desired = [np.array([[[1, 2], [1, 2]], [[1, 2], [1, 2]]]),
+                   np.array([[[3, 4], [3, 4]], [[3, 4], [3, 4]]])]
+        compare_results(res, desired)
+
+
+class TestSqueeze:
+    def test_basic(self):
+        from numpy.random import rand
+
+        a = rand(20, 10, 10, 1, 1)
+        b = rand(20, 1, 10, 1, 20)
+        c = rand(1, 1, 20, 10)
+        assert_array_equal(np.squeeze(a), np.reshape(a, (20, 10, 10)))
+        assert_array_equal(np.squeeze(b), np.reshape(b, (20, 10, 20)))
+        assert_array_equal(np.squeeze(c), np.reshape(c, (20, 10)))
+
+        # Squeezing to 0-dim should still give an ndarray
+        a = [[[1.5]]]
+        res = np.squeeze(a)
+        assert_equal(res, 1.5)
+        assert_equal(res.ndim, 0)
+        assert_equal(type(res), np.ndarray)
+
+
+class TestKron:
+    def test_return_type(self):
+        class myarray(np.ndarray):
+            __array_priority__ = 0.0
+
+        a = np.ones([2, 2])
+        ma = myarray(a.shape, a.dtype, a.data)
+        assert_equal(type(kron(a, a)), np.ndarray)
+        assert_equal(type(kron(ma, ma)), myarray)
+        assert_equal(type(kron(a, ma)), np.ndarray)
+        assert_equal(type(kron(ma, a)), myarray)
+
+
+class TestTile:
+    def test_basic(self):
+        a = np.array([0, 1, 2])
+        b = [[1, 2], [3, 4]]
+        assert_equal(tile(a, 2), [0, 1, 2, 0, 1, 2])
+        assert_equal(tile(a, (2, 2)), [[0, 1, 2, 0, 1, 2], [0, 1, 2, 0, 1, 2]])
+        assert_equal(tile(a, (1, 2)), [[0, 1, 2, 0, 1, 2]])
+        assert_equal(tile(b, 2), [[1, 2, 1, 2], [3, 4, 3, 4]])
+        assert_equal(tile(b, (2, 1)), [[1, 2], [3, 4], [1, 2], [3, 4]])
+        assert_equal(tile(b, (2, 2)), [[1, 2, 1, 2], [3, 4, 3, 4],
+                                       [1, 2, 1, 2], [3, 4, 3, 4]])
+
+    def test_tile_one_repetition_on_array_gh4679(self):
+        a = np.arange(5)
+        b = tile(a, 1)
+        b += 2
+        assert_equal(a, np.arange(5))
+
+    def test_empty(self):
+        a = np.array([[[]]])
+        b = np.array([[], []])
+        c = tile(b, 2).shape
+        d = tile(a, (3, 2, 5)).shape
+        assert_equal(c, (2, 0))
+        assert_equal(d, (3, 2, 0))
+
+    def test_kroncompare(self):
+        from numpy.random import randint
+
+        reps = [(2,), (1, 2), (2, 1), (2, 2), (2, 3, 2), (3, 2)]
+        shape = [(3,), (2, 3), (3, 4, 3), (3, 2, 3), (4, 3, 2, 4), (2, 2)]
+        for s in shape:
+            b = randint(0, 10, size=s)
+            for r in reps:
+                a = np.ones(r, b.dtype)
+                large = tile(b, r)
+                klarge = kron(a, b)
+                assert_equal(large, klarge)
+
+
+class TestMayShareMemory:
+    def test_basic(self):
+        d = np.ones((50, 60))
+        d2 = np.ones((30, 60, 6))
+        assert_(np.may_share_memory(d, d))
+        assert_(np.may_share_memory(d, d[::-1]))
+        assert_(np.may_share_memory(d, d[::2]))
+        assert_(np.may_share_memory(d, d[1:, ::-1]))
+
+        assert_(not np.may_share_memory(d[::-1], d2))
+        assert_(not np.may_share_memory(d[::2], d2))
+        assert_(not np.may_share_memory(d[1:, ::-1], d2))
+        assert_(np.may_share_memory(d2[1:, ::-1], d2))
+
+
+# Utility
+def compare_results(res, desired):
+    for i in range(len(desired)):
+        assert_array_equal(res[i], desired[i])
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_stride_tricks.py b/venv/Lib/site-packages/numpy/lib/tests/test_stride_tricks.py
new file mode 100644
index 000000000..9d95eb9d0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_stride_tricks.py
@@ -0,0 +1,479 @@
+import numpy as np
+from numpy.core._rational_tests import rational
+from numpy.testing import (
+    assert_equal, assert_array_equal, assert_raises, assert_,
+    assert_raises_regex, assert_warns,
+    )
+from numpy.lib.stride_tricks import (
+    as_strided, broadcast_arrays, _broadcast_shape, broadcast_to
+    )
+
+def assert_shapes_correct(input_shapes, expected_shape):
+    # Broadcast a list of arrays with the given input shapes and check the
+    # common output shape.
+
+    inarrays = [np.zeros(s) for s in input_shapes]
+    outarrays = broadcast_arrays(*inarrays)
+    outshapes = [a.shape for a in outarrays]
+    expected = [expected_shape] * len(inarrays)
+    assert_equal(outshapes, expected)
+
+
+def assert_incompatible_shapes_raise(input_shapes):
+    # Broadcast a list of arrays with the given (incompatible) input shapes
+    # and check that they raise a ValueError.
+
+    inarrays = [np.zeros(s) for s in input_shapes]
+    assert_raises(ValueError, broadcast_arrays, *inarrays)
+
+
+def assert_same_as_ufunc(shape0, shape1, transposed=False, flipped=False):
+    # Broadcast two shapes against each other and check that the data layout
+    # is the same as if a ufunc did the broadcasting.
+
+    x0 = np.zeros(shape0, dtype=int)
+    # Note that multiply.reduce's identity element is 1.0, so when shape1==(),
+    # this gives the desired n==1.
+    n = int(np.multiply.reduce(shape1))
+    x1 = np.arange(n).reshape(shape1)
+    if transposed:
+        x0 = x0.T
+        x1 = x1.T
+    if flipped:
+        x0 = x0[::-1]
+        x1 = x1[::-1]
+    # Use the add ufunc to do the broadcasting. Since we're adding 0s to x1, the
+    # result should be exactly the same as the broadcasted view of x1.
+    y = x0 + x1
+    b0, b1 = broadcast_arrays(x0, x1)
+    assert_array_equal(y, b1)
+
+
+def test_same():
+    x = np.arange(10)
+    y = np.arange(10)
+    bx, by = broadcast_arrays(x, y)
+    assert_array_equal(x, bx)
+    assert_array_equal(y, by)
+
+def test_broadcast_kwargs():
+    # ensure that a TypeError is appropriately raised when
+    # np.broadcast_arrays() is called with any keyword
+    # argument other than 'subok'
+    x = np.arange(10)
+    y = np.arange(10)
+
+    with assert_raises_regex(TypeError, 'got an unexpected keyword'):
+        broadcast_arrays(x, y, dtype='float64')
+
+
+def test_one_off():
+    x = np.array([[1, 2, 3]])
+    y = np.array([[1], [2], [3]])
+    bx, by = broadcast_arrays(x, y)
+    bx0 = np.array([[1, 2, 3], [1, 2, 3], [1, 2, 3]])
+    by0 = bx0.T
+    assert_array_equal(bx0, bx)
+    assert_array_equal(by0, by)
+
+
+def test_same_input_shapes():
+    # Check that the final shape is just the input shape.
+
+    data = [
+        (),
+        (1,),
+        (3,),
+        (0, 1),
+        (0, 3),
+        (1, 0),
+        (3, 0),
+        (1, 3),
+        (3, 1),
+        (3, 3),
+    ]
+    for shape in data:
+        input_shapes = [shape]
+        # Single input.
+        assert_shapes_correct(input_shapes, shape)
+        # Double input.
+        input_shapes2 = [shape, shape]
+        assert_shapes_correct(input_shapes2, shape)
+        # Triple input.
+        input_shapes3 = [shape, shape, shape]
+        assert_shapes_correct(input_shapes3, shape)
+
+
+def test_two_compatible_by_ones_input_shapes():
+    # Check that two different input shapes of the same length, but some have
+    # ones, broadcast to the correct shape.
+
+    data = [
+        [[(1,), (3,)], (3,)],
+        [[(1, 3), (3, 3)], (3, 3)],
+        [[(3, 1), (3, 3)], (3, 3)],
+        [[(1, 3), (3, 1)], (3, 3)],
+        [[(1, 1), (3, 3)], (3, 3)],
+        [[(1, 1), (1, 3)], (1, 3)],
+        [[(1, 1), (3, 1)], (3, 1)],
+        [[(1, 0), (0, 0)], (0, 0)],
+        [[(0, 1), (0, 0)], (0, 0)],
+        [[(1, 0), (0, 1)], (0, 0)],
+        [[(1, 1), (0, 0)], (0, 0)],
+        [[(1, 1), (1, 0)], (1, 0)],
+        [[(1, 1), (0, 1)], (0, 1)],
+    ]
+    for input_shapes, expected_shape in data:
+        assert_shapes_correct(input_shapes, expected_shape)
+        # Reverse the input shapes since broadcasting should be symmetric.
+        assert_shapes_correct(input_shapes[::-1], expected_shape)
+
+
+def test_two_compatible_by_prepending_ones_input_shapes():
+    # Check that two different input shapes (of different lengths) broadcast
+    # to the correct shape.
+
+    data = [
+        [[(), (3,)], (3,)],
+        [[(3,), (3, 3)], (3, 3)],
+        [[(3,), (3, 1)], (3, 3)],
+        [[(1,), (3, 3)], (3, 3)],
+        [[(), (3, 3)], (3, 3)],
+        [[(1, 1), (3,)], (1, 3)],
+        [[(1,), (3, 1)], (3, 1)],
+        [[(1,), (1, 3)], (1, 3)],
+        [[(), (1, 3)], (1, 3)],
+        [[(), (3, 1)], (3, 1)],
+        [[(), (0,)], (0,)],
+        [[(0,), (0, 0)], (0, 0)],
+        [[(0,), (0, 1)], (0, 0)],
+        [[(1,), (0, 0)], (0, 0)],
+        [[(), (0, 0)], (0, 0)],
+        [[(1, 1), (0,)], (1, 0)],
+        [[(1,), (0, 1)], (0, 1)],
+        [[(1,), (1, 0)], (1, 0)],
+        [[(), (1, 0)], (1, 0)],
+        [[(), (0, 1)], (0, 1)],
+    ]
+    for input_shapes, expected_shape in data:
+        assert_shapes_correct(input_shapes, expected_shape)
+        # Reverse the input shapes since broadcasting should be symmetric.
+        assert_shapes_correct(input_shapes[::-1], expected_shape)
+
+
+def test_incompatible_shapes_raise_valueerror():
+    # Check that a ValueError is raised for incompatible shapes.
+
+    data = [
+        [(3,), (4,)],
+        [(2, 3), (2,)],
+        [(3,), (3,), (4,)],
+        [(1, 3, 4), (2, 3, 3)],
+    ]
+    for input_shapes in data:
+        assert_incompatible_shapes_raise(input_shapes)
+        # Reverse the input shapes since broadcasting should be symmetric.
+        assert_incompatible_shapes_raise(input_shapes[::-1])
+
+
+def test_same_as_ufunc():
+    # Check that the data layout is the same as if a ufunc did the operation.
+
+    data = [
+        [[(1,), (3,)], (3,)],
+        [[(1, 3), (3, 3)], (3, 3)],
+        [[(3, 1), (3, 3)], (3, 3)],
+        [[(1, 3), (3, 1)], (3, 3)],
+        [[(1, 1), (3, 3)], (3, 3)],
+        [[(1, 1), (1, 3)], (1, 3)],
+        [[(1, 1), (3, 1)], (3, 1)],
+        [[(1, 0), (0, 0)], (0, 0)],
+        [[(0, 1), (0, 0)], (0, 0)],
+        [[(1, 0), (0, 1)], (0, 0)],
+        [[(1, 1), (0, 0)], (0, 0)],
+        [[(1, 1), (1, 0)], (1, 0)],
+        [[(1, 1), (0, 1)], (0, 1)],
+        [[(), (3,)], (3,)],
+        [[(3,), (3, 3)], (3, 3)],
+        [[(3,), (3, 1)], (3, 3)],
+        [[(1,), (3, 3)], (3, 3)],
+        [[(), (3, 3)], (3, 3)],
+        [[(1, 1), (3,)], (1, 3)],
+        [[(1,), (3, 1)], (3, 1)],
+        [[(1,), (1, 3)], (1, 3)],
+        [[(), (1, 3)], (1, 3)],
+        [[(), (3, 1)], (3, 1)],
+        [[(), (0,)], (0,)],
+        [[(0,), (0, 0)], (0, 0)],
+        [[(0,), (0, 1)], (0, 0)],
+        [[(1,), (0, 0)], (0, 0)],
+        [[(), (0, 0)], (0, 0)],
+        [[(1, 1), (0,)], (1, 0)],
+        [[(1,), (0, 1)], (0, 1)],
+        [[(1,), (1, 0)], (1, 0)],
+        [[(), (1, 0)], (1, 0)],
+        [[(), (0, 1)], (0, 1)],
+    ]
+    for input_shapes, expected_shape in data:
+        assert_same_as_ufunc(input_shapes[0], input_shapes[1],
+                             "Shapes: %s %s" % (input_shapes[0], input_shapes[1]))
+        # Reverse the input shapes since broadcasting should be symmetric.
+        assert_same_as_ufunc(input_shapes[1], input_shapes[0])
+        # Try them transposed, too.
+        assert_same_as_ufunc(input_shapes[0], input_shapes[1], True)
+        # ... and flipped for non-rank-0 inputs in order to test negative
+        # strides.
+        if () not in input_shapes:
+            assert_same_as_ufunc(input_shapes[0], input_shapes[1], False, True)
+            assert_same_as_ufunc(input_shapes[0], input_shapes[1], True, True)
+
+
+def test_broadcast_to_succeeds():
+    data = [
+        [np.array(0), (0,), np.array(0)],
+        [np.array(0), (1,), np.zeros(1)],
+        [np.array(0), (3,), np.zeros(3)],
+        [np.ones(1), (1,), np.ones(1)],
+        [np.ones(1), (2,), np.ones(2)],
+        [np.ones(1), (1, 2, 3), np.ones((1, 2, 3))],
+        [np.arange(3), (3,), np.arange(3)],
+        [np.arange(3), (1, 3), np.arange(3).reshape(1, -1)],
+        [np.arange(3), (2, 3), np.array([[0, 1, 2], [0, 1, 2]])],
+        # test if shape is not a tuple
+        [np.ones(0), 0, np.ones(0)],
+        [np.ones(1), 1, np.ones(1)],
+        [np.ones(1), 2, np.ones(2)],
+        # these cases with size 0 are strange, but they reproduce the behavior
+        # of broadcasting with ufuncs (see test_same_as_ufunc above)
+        [np.ones(1), (0,), np.ones(0)],
+        [np.ones((1, 2)), (0, 2), np.ones((0, 2))],
+        [np.ones((2, 1)), (2, 0), np.ones((2, 0))],
+    ]
+    for input_array, shape, expected in data:
+        actual = broadcast_to(input_array, shape)
+        assert_array_equal(expected, actual)
+
+
+def test_broadcast_to_raises():
+    data = [
+        [(0,), ()],
+        [(1,), ()],
+        [(3,), ()],
+        [(3,), (1,)],
+        [(3,), (2,)],
+        [(3,), (4,)],
+        [(1, 2), (2, 1)],
+        [(1, 1), (1,)],
+        [(1,), -1],
+        [(1,), (-1,)],
+        [(1, 2), (-1, 2)],
+    ]
+    for orig_shape, target_shape in data:
+        arr = np.zeros(orig_shape)
+        assert_raises(ValueError, lambda: broadcast_to(arr, target_shape))
+
+
+def test_broadcast_shape():
+    # broadcast_shape is already exercized indirectly by broadcast_arrays
+    assert_equal(_broadcast_shape(), ())
+    assert_equal(_broadcast_shape([1, 2]), (2,))
+    assert_equal(_broadcast_shape(np.ones((1, 1))), (1, 1))
+    assert_equal(_broadcast_shape(np.ones((1, 1)), np.ones((3, 4))), (3, 4))
+    assert_equal(_broadcast_shape(*([np.ones((1, 2))] * 32)), (1, 2))
+    assert_equal(_broadcast_shape(*([np.ones((1, 2))] * 100)), (1, 2))
+
+    # regression tests for gh-5862
+    assert_equal(_broadcast_shape(*([np.ones(2)] * 32 + [1])), (2,))
+    bad_args = [np.ones(2)] * 32 + [np.ones(3)] * 32
+    assert_raises(ValueError, lambda: _broadcast_shape(*bad_args))
+
+
+def test_as_strided():
+    a = np.array([None])
+    a_view = as_strided(a)
+    expected = np.array([None])
+    assert_array_equal(a_view, np.array([None]))
+
+    a = np.array([1, 2, 3, 4])
+    a_view = as_strided(a, shape=(2,), strides=(2 * a.itemsize,))
+    expected = np.array([1, 3])
+    assert_array_equal(a_view, expected)
+
+    a = np.array([1, 2, 3, 4])
+    a_view = as_strided(a, shape=(3, 4), strides=(0, 1 * a.itemsize))
+    expected = np.array([[1, 2, 3, 4], [1, 2, 3, 4], [1, 2, 3, 4]])
+    assert_array_equal(a_view, expected)
+
+    # Regression test for gh-5081
+    dt = np.dtype([('num', 'i4'), ('obj', 'O')])
+    a = np.empty((4,), dtype=dt)
+    a['num'] = np.arange(1, 5)
+    a_view = as_strided(a, shape=(3, 4), strides=(0, a.itemsize))
+    expected_num = [[1, 2, 3, 4]] * 3
+    expected_obj = [[None]*4]*3
+    assert_equal(a_view.dtype, dt)
+    assert_array_equal(expected_num, a_view['num'])
+    assert_array_equal(expected_obj, a_view['obj'])
+
+    # Make sure that void types without fields are kept unchanged
+    a = np.empty((4,), dtype='V4')
+    a_view = as_strided(a, shape=(3, 4), strides=(0, a.itemsize))
+    assert_equal(a.dtype, a_view.dtype)
+
+    # Make sure that the only type that could fail is properly handled
+    dt = np.dtype({'names': [''], 'formats': ['V4']})
+    a = np.empty((4,), dtype=dt)
+    a_view = as_strided(a, shape=(3, 4), strides=(0, a.itemsize))
+    assert_equal(a.dtype, a_view.dtype)
+
+    # Custom dtypes should not be lost (gh-9161)
+    r = [rational(i) for i in range(4)]
+    a = np.array(r, dtype=rational)
+    a_view = as_strided(a, shape=(3, 4), strides=(0, a.itemsize))
+    assert_equal(a.dtype, a_view.dtype)
+    assert_array_equal([r] * 3, a_view)
+
+def as_strided_writeable():
+    arr = np.ones(10)
+    view = as_strided(arr, writeable=False)
+    assert_(not view.flags.writeable)
+
+    # Check that writeable also is fine:
+    view = as_strided(arr, writeable=True)
+    assert_(view.flags.writeable)
+    view[...] = 3
+    assert_array_equal(arr, np.full_like(arr, 3))
+
+    # Test that things do not break down for readonly:
+    arr.flags.writeable = False
+    view = as_strided(arr, writeable=False)
+    view = as_strided(arr, writeable=True)
+    assert_(not view.flags.writeable)
+
+
+class VerySimpleSubClass(np.ndarray):
+    def __new__(cls, *args, **kwargs):
+        return np.array(*args, subok=True, **kwargs).view(cls)
+
+
+class SimpleSubClass(VerySimpleSubClass):
+    def __new__(cls, *args, **kwargs):
+        self = np.array(*args, subok=True, **kwargs).view(cls)
+        self.info = 'simple'
+        return self
+
+    def __array_finalize__(self, obj):
+        self.info = getattr(obj, 'info', '') + ' finalized'
+
+
+def test_subclasses():
+    # test that subclass is preserved only if subok=True
+    a = VerySimpleSubClass([1, 2, 3, 4])
+    assert_(type(a) is VerySimpleSubClass)
+    a_view = as_strided(a, shape=(2,), strides=(2 * a.itemsize,))
+    assert_(type(a_view) is np.ndarray)
+    a_view = as_strided(a, shape=(2,), strides=(2 * a.itemsize,), subok=True)
+    assert_(type(a_view) is VerySimpleSubClass)
+    # test that if a subclass has __array_finalize__, it is used
+    a = SimpleSubClass([1, 2, 3, 4])
+    a_view = as_strided(a, shape=(2,), strides=(2 * a.itemsize,), subok=True)
+    assert_(type(a_view) is SimpleSubClass)
+    assert_(a_view.info == 'simple finalized')
+
+    # similar tests for broadcast_arrays
+    b = np.arange(len(a)).reshape(-1, 1)
+    a_view, b_view = broadcast_arrays(a, b)
+    assert_(type(a_view) is np.ndarray)
+    assert_(type(b_view) is np.ndarray)
+    assert_(a_view.shape == b_view.shape)
+    a_view, b_view = broadcast_arrays(a, b, subok=True)
+    assert_(type(a_view) is SimpleSubClass)
+    assert_(a_view.info == 'simple finalized')
+    assert_(type(b_view) is np.ndarray)
+    assert_(a_view.shape == b_view.shape)
+
+    # and for broadcast_to
+    shape = (2, 4)
+    a_view = broadcast_to(a, shape)
+    assert_(type(a_view) is np.ndarray)
+    assert_(a_view.shape == shape)
+    a_view = broadcast_to(a, shape, subok=True)
+    assert_(type(a_view) is SimpleSubClass)
+    assert_(a_view.info == 'simple finalized')
+    assert_(a_view.shape == shape)
+
+
+def test_writeable():
+    # broadcast_to should return a readonly array
+    original = np.array([1, 2, 3])
+    result = broadcast_to(original, (2, 3))
+    assert_equal(result.flags.writeable, False)
+    assert_raises(ValueError, result.__setitem__, slice(None), 0)
+
+    # but the result of broadcast_arrays needs to be writeable, to
+    # preserve backwards compatibility
+    for is_broadcast, results in [(False, broadcast_arrays(original,)),
+                                  (True, broadcast_arrays(0, original))]:
+        for result in results:
+            # This will change to False in a future version
+            if is_broadcast:
+                with assert_warns(FutureWarning):
+                    assert_equal(result.flags.writeable, True)
+                with assert_warns(DeprecationWarning):
+                    result[:] = 0
+                # Warning not emitted, writing to the array resets it
+                assert_equal(result.flags.writeable, True)
+            else:
+                # No warning:
+                assert_equal(result.flags.writeable, True)
+
+    for results in [broadcast_arrays(original),
+                    broadcast_arrays(0, original)]:
+        for result in results:
+            # resets the warn_on_write DeprecationWarning
+            result.flags.writeable = True
+            # check: no warning emitted
+            assert_equal(result.flags.writeable, True)
+            result[:] = 0
+            
+    # keep readonly input readonly
+    original.flags.writeable = False
+    _, result = broadcast_arrays(0, original)
+    assert_equal(result.flags.writeable, False)
+
+    # regression test for GH6491
+    shape = (2,)
+    strides = [0]
+    tricky_array = as_strided(np.array(0), shape, strides)
+    other = np.zeros((1,))
+    first, second = broadcast_arrays(tricky_array, other)
+    assert_(first.shape == second.shape)
+
+
+def test_writeable_memoryview():
+    # The result of broadcast_arrays exports as a non-writeable memoryview
+    # because otherwise there is no good way to opt in to the new behaviour
+    # (i.e. you would need to set writeable to False explicitly).
+    # See gh-13929.
+    original = np.array([1, 2, 3])
+
+    for is_broadcast, results in [(False, broadcast_arrays(original,)),
+                                  (True, broadcast_arrays(0, original))]:
+        for result in results:
+            # This will change to False in a future version
+            if is_broadcast:
+                # memoryview(result, writable=True) will give warning but cannot
+                # be tested using the python API.
+                assert memoryview(result).readonly
+            else:
+                assert not memoryview(result).readonly
+
+
+def test_reference_types():
+    input_array = np.array('a', dtype=object)
+    expected = np.array(['a'] * 3, dtype=object)
+    actual = broadcast_to(input_array, (3,))
+    assert_array_equal(expected, actual)
+
+    actual, _ = broadcast_arrays(input_array, np.ones(3))
+    assert_array_equal(expected, actual)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_twodim_base.py b/venv/Lib/site-packages/numpy/lib/tests/test_twodim_base.py
new file mode 100644
index 000000000..cce683bfe
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_twodim_base.py
@@ -0,0 +1,532 @@
+"""Test functions for matrix module
+
+"""
+from numpy.testing import (
+    assert_equal, assert_array_equal, assert_array_max_ulp,
+    assert_array_almost_equal, assert_raises, assert_
+    )
+
+from numpy import (
+    arange, add, fliplr, flipud, zeros, ones, eye, array, diag, histogram2d,
+    tri, mask_indices, triu_indices, triu_indices_from, tril_indices,
+    tril_indices_from, vander,
+    )
+
+import numpy as np
+
+
+from numpy.core.tests.test_overrides import requires_array_function
+
+
+def get_mat(n):
+    data = arange(n)
+    data = add.outer(data, data)
+    return data
+
+
+class TestEye:
+    def test_basic(self):
+        assert_equal(eye(4),
+                     array([[1, 0, 0, 0],
+                            [0, 1, 0, 0],
+                            [0, 0, 1, 0],
+                            [0, 0, 0, 1]]))
+
+        assert_equal(eye(4, dtype='f'),
+                     array([[1, 0, 0, 0],
+                            [0, 1, 0, 0],
+                            [0, 0, 1, 0],
+                            [0, 0, 0, 1]], 'f'))
+
+        assert_equal(eye(3) == 1,
+                     eye(3, dtype=bool))
+
+    def test_diag(self):
+        assert_equal(eye(4, k=1),
+                     array([[0, 1, 0, 0],
+                            [0, 0, 1, 0],
+                            [0, 0, 0, 1],
+                            [0, 0, 0, 0]]))
+
+        assert_equal(eye(4, k=-1),
+                     array([[0, 0, 0, 0],
+                            [1, 0, 0, 0],
+                            [0, 1, 0, 0],
+                            [0, 0, 1, 0]]))
+
+    def test_2d(self):
+        assert_equal(eye(4, 3),
+                     array([[1, 0, 0],
+                            [0, 1, 0],
+                            [0, 0, 1],
+                            [0, 0, 0]]))
+
+        assert_equal(eye(3, 4),
+                     array([[1, 0, 0, 0],
+                            [0, 1, 0, 0],
+                            [0, 0, 1, 0]]))
+
+    def test_diag2d(self):
+        assert_equal(eye(3, 4, k=2),
+                     array([[0, 0, 1, 0],
+                            [0, 0, 0, 1],
+                            [0, 0, 0, 0]]))
+
+        assert_equal(eye(4, 3, k=-2),
+                     array([[0, 0, 0],
+                            [0, 0, 0],
+                            [1, 0, 0],
+                            [0, 1, 0]]))
+
+    def test_eye_bounds(self):
+        assert_equal(eye(2, 2, 1), [[0, 1], [0, 0]])
+        assert_equal(eye(2, 2, -1), [[0, 0], [1, 0]])
+        assert_equal(eye(2, 2, 2), [[0, 0], [0, 0]])
+        assert_equal(eye(2, 2, -2), [[0, 0], [0, 0]])
+        assert_equal(eye(3, 2, 2), [[0, 0], [0, 0], [0, 0]])
+        assert_equal(eye(3, 2, 1), [[0, 1], [0, 0], [0, 0]])
+        assert_equal(eye(3, 2, -1), [[0, 0], [1, 0], [0, 1]])
+        assert_equal(eye(3, 2, -2), [[0, 0], [0, 0], [1, 0]])
+        assert_equal(eye(3, 2, -3), [[0, 0], [0, 0], [0, 0]])
+
+    def test_strings(self):
+        assert_equal(eye(2, 2, dtype='S3'),
+                     [[b'1', b''], [b'', b'1']])
+
+    def test_bool(self):
+        assert_equal(eye(2, 2, dtype=bool), [[True, False], [False, True]])
+
+    def test_order(self):
+        mat_c = eye(4, 3, k=-1)
+        mat_f = eye(4, 3, k=-1, order='F')
+        assert_equal(mat_c, mat_f)
+        assert mat_c.flags.c_contiguous
+        assert not mat_c.flags.f_contiguous
+        assert not mat_f.flags.c_contiguous
+        assert mat_f.flags.f_contiguous
+
+
+class TestDiag:
+    def test_vector(self):
+        vals = (100 * arange(5)).astype('l')
+        b = zeros((5, 5))
+        for k in range(5):
+            b[k, k] = vals[k]
+        assert_equal(diag(vals), b)
+        b = zeros((7, 7))
+        c = b.copy()
+        for k in range(5):
+            b[k, k + 2] = vals[k]
+            c[k + 2, k] = vals[k]
+        assert_equal(diag(vals, k=2), b)
+        assert_equal(diag(vals, k=-2), c)
+
+    def test_matrix(self, vals=None):
+        if vals is None:
+            vals = (100 * get_mat(5) + 1).astype('l')
+        b = zeros((5,))
+        for k in range(5):
+            b[k] = vals[k, k]
+        assert_equal(diag(vals), b)
+        b = b * 0
+        for k in range(3):
+            b[k] = vals[k, k + 2]
+        assert_equal(diag(vals, 2), b[:3])
+        for k in range(3):
+            b[k] = vals[k + 2, k]
+        assert_equal(diag(vals, -2), b[:3])
+
+    def test_fortran_order(self):
+        vals = array((100 * get_mat(5) + 1), order='F', dtype='l')
+        self.test_matrix(vals)
+
+    def test_diag_bounds(self):
+        A = [[1, 2], [3, 4], [5, 6]]
+        assert_equal(diag(A, k=2), [])
+        assert_equal(diag(A, k=1), [2])
+        assert_equal(diag(A, k=0), [1, 4])
+        assert_equal(diag(A, k=-1), [3, 6])
+        assert_equal(diag(A, k=-2), [5])
+        assert_equal(diag(A, k=-3), [])
+
+    def test_failure(self):
+        assert_raises(ValueError, diag, [[[1]]])
+
+
+class TestFliplr:
+    def test_basic(self):
+        assert_raises(ValueError, fliplr, ones(4))
+        a = get_mat(4)
+        b = a[:, ::-1]
+        assert_equal(fliplr(a), b)
+        a = [[0, 1, 2],
+             [3, 4, 5]]
+        b = [[2, 1, 0],
+             [5, 4, 3]]
+        assert_equal(fliplr(a), b)
+
+
+class TestFlipud:
+    def test_basic(self):
+        a = get_mat(4)
+        b = a[::-1, :]
+        assert_equal(flipud(a), b)
+        a = [[0, 1, 2],
+             [3, 4, 5]]
+        b = [[3, 4, 5],
+             [0, 1, 2]]
+        assert_equal(flipud(a), b)
+
+
+class TestHistogram2d:
+    def test_simple(self):
+        x = array(
+            [0.41702200, 0.72032449, 1.1437481e-4, 0.302332573, 0.146755891])
+        y = array(
+            [0.09233859, 0.18626021, 0.34556073, 0.39676747, 0.53881673])
+        xedges = np.linspace(0, 1, 10)
+        yedges = np.linspace(0, 1, 10)
+        H = histogram2d(x, y, (xedges, yedges))[0]
+        answer = array(
+            [[0, 0, 0, 1, 0, 0, 0, 0, 0],
+             [0, 0, 0, 0, 0, 0, 1, 0, 0],
+             [0, 0, 0, 0, 0, 0, 0, 0, 0],
+             [1, 0, 1, 0, 0, 0, 0, 0, 0],
+             [0, 1, 0, 0, 0, 0, 0, 0, 0],
+             [0, 0, 0, 0, 0, 0, 0, 0, 0],
+             [0, 0, 0, 0, 0, 0, 0, 0, 0],
+             [0, 0, 0, 0, 0, 0, 0, 0, 0],
+             [0, 0, 0, 0, 0, 0, 0, 0, 0]])
+        assert_array_equal(H.T, answer)
+        H = histogram2d(x, y, xedges)[0]
+        assert_array_equal(H.T, answer)
+        H, xedges, yedges = histogram2d(list(range(10)), list(range(10)))
+        assert_array_equal(H, eye(10, 10))
+        assert_array_equal(xedges, np.linspace(0, 9, 11))
+        assert_array_equal(yedges, np.linspace(0, 9, 11))
+
+    def test_asym(self):
+        x = array([1, 1, 2, 3, 4, 4, 4, 5])
+        y = array([1, 3, 2, 0, 1, 2, 3, 4])
+        H, xed, yed = histogram2d(
+            x, y, (6, 5), range=[[0, 6], [0, 5]], density=True)
+        answer = array(
+            [[0., 0, 0, 0, 0],
+             [0, 1, 0, 1, 0],
+             [0, 0, 1, 0, 0],
+             [1, 0, 0, 0, 0],
+             [0, 1, 1, 1, 0],
+             [0, 0, 0, 0, 1]])
+        assert_array_almost_equal(H, answer/8., 3)
+        assert_array_equal(xed, np.linspace(0, 6, 7))
+        assert_array_equal(yed, np.linspace(0, 5, 6))
+
+    def test_density(self):
+        x = array([1, 2, 3, 1, 2, 3, 1, 2, 3])
+        y = array([1, 1, 1, 2, 2, 2, 3, 3, 3])
+        H, xed, yed = histogram2d(
+            x, y, [[1, 2, 3, 5], [1, 2, 3, 5]], density=True)
+        answer = array([[1, 1, .5],
+                        [1, 1, .5],
+                        [.5, .5, .25]])/9.
+        assert_array_almost_equal(H, answer, 3)
+
+    def test_all_outliers(self):
+        r = np.random.rand(100) + 1. + 1e6  # histogramdd rounds by decimal=6
+        H, xed, yed = histogram2d(r, r, (4, 5), range=([0, 1], [0, 1]))
+        assert_array_equal(H, 0)
+
+    def test_empty(self):
+        a, edge1, edge2 = histogram2d([], [], bins=([0, 1], [0, 1]))
+        assert_array_max_ulp(a, array([[0.]]))
+
+        a, edge1, edge2 = histogram2d([], [], bins=4)
+        assert_array_max_ulp(a, np.zeros((4, 4)))
+
+    def test_binparameter_combination(self):
+        x = array(
+            [0, 0.09207008, 0.64575234, 0.12875982, 0.47390599,
+             0.59944483, 1])
+        y = array(
+            [0, 0.14344267, 0.48988575, 0.30558665, 0.44700682,
+             0.15886423, 1])
+        edges = (0, 0.1, 0.2, 0.3, 0.4, 0.5, 0.6, 0.7, 0.8, 0.9, 1)
+        H, xe, ye = histogram2d(x, y, (edges, 4))
+        answer = array(
+            [[2., 0., 0., 0.],
+             [0., 1., 0., 0.],
+             [0., 0., 0., 0.],
+             [0., 0., 0., 0.],
+             [0., 1., 0., 0.],
+             [1., 0., 0., 0.],
+             [0., 1., 0., 0.],
+             [0., 0., 0., 0.],
+             [0., 0., 0., 0.],
+             [0., 0., 0., 1.]])
+        assert_array_equal(H, answer)
+        assert_array_equal(ye, array([0., 0.25, 0.5, 0.75, 1]))
+        H, xe, ye = histogram2d(x, y, (4, edges))
+        answer = array(
+            [[1., 1., 0., 1., 0., 0., 0., 0., 0., 0.],
+             [0., 0., 0., 0., 1., 0., 0., 0., 0., 0.],
+             [0., 1., 0., 0., 1., 0., 0., 0., 0., 0.],
+             [0., 0., 0., 0., 0., 0., 0., 0., 0., 1.]])
+        assert_array_equal(H, answer)
+        assert_array_equal(xe, array([0., 0.25, 0.5, 0.75, 1]))
+
+    @requires_array_function
+    def test_dispatch(self):
+        class ShouldDispatch:
+            def __array_function__(self, function, types, args, kwargs):
+                return types, args, kwargs
+
+        xy = [1, 2]
+        s_d = ShouldDispatch()
+        r = histogram2d(s_d, xy)
+        # Cannot use assert_equal since that dispatches...
+        assert_(r == ((ShouldDispatch,), (s_d, xy), {}))
+        r = histogram2d(xy, s_d)
+        assert_(r == ((ShouldDispatch,), (xy, s_d), {}))
+        r = histogram2d(xy, xy, bins=s_d)
+        assert_(r, ((ShouldDispatch,), (xy, xy), dict(bins=s_d)))
+        r = histogram2d(xy, xy, bins=[s_d, 5])
+        assert_(r, ((ShouldDispatch,), (xy, xy), dict(bins=[s_d, 5])))
+        assert_raises(Exception, histogram2d, xy, xy, bins=[s_d])
+        r = histogram2d(xy, xy, weights=s_d)
+        assert_(r, ((ShouldDispatch,), (xy, xy), dict(weights=s_d)))
+
+
+class TestTri:
+    def test_dtype(self):
+        out = array([[1, 0, 0],
+                     [1, 1, 0],
+                     [1, 1, 1]])
+        assert_array_equal(tri(3), out)
+        assert_array_equal(tri(3, dtype=bool), out.astype(bool))
+
+
+def test_tril_triu_ndim2():
+    for dtype in np.typecodes['AllFloat'] + np.typecodes['AllInteger']:
+        a = np.ones((2, 2), dtype=dtype)
+        b = np.tril(a)
+        c = np.triu(a)
+        assert_array_equal(b, [[1, 0], [1, 1]])
+        assert_array_equal(c, b.T)
+        # should return the same dtype as the original array
+        assert_equal(b.dtype, a.dtype)
+        assert_equal(c.dtype, a.dtype)
+
+
+def test_tril_triu_ndim3():
+    for dtype in np.typecodes['AllFloat'] + np.typecodes['AllInteger']:
+        a = np.array([
+            [[1, 1], [1, 1]],
+            [[1, 1], [1, 0]],
+            [[1, 1], [0, 0]],
+            ], dtype=dtype)
+        a_tril_desired = np.array([
+            [[1, 0], [1, 1]],
+            [[1, 0], [1, 0]],
+            [[1, 0], [0, 0]],
+            ], dtype=dtype)
+        a_triu_desired = np.array([
+            [[1, 1], [0, 1]],
+            [[1, 1], [0, 0]],
+            [[1, 1], [0, 0]],
+            ], dtype=dtype)
+        a_triu_observed = np.triu(a)
+        a_tril_observed = np.tril(a)
+        assert_array_equal(a_triu_observed, a_triu_desired)
+        assert_array_equal(a_tril_observed, a_tril_desired)
+        assert_equal(a_triu_observed.dtype, a.dtype)
+        assert_equal(a_tril_observed.dtype, a.dtype)
+
+
+def test_tril_triu_with_inf():
+    # Issue 4859
+    arr = np.array([[1, 1, np.inf],
+                    [1, 1, 1],
+                    [np.inf, 1, 1]])
+    out_tril = np.array([[1, 0, 0],
+                         [1, 1, 0],
+                         [np.inf, 1, 1]])
+    out_triu = out_tril.T
+    assert_array_equal(np.triu(arr), out_triu)
+    assert_array_equal(np.tril(arr), out_tril)
+
+
+def test_tril_triu_dtype():
+    # Issue 4916
+    # tril and triu should return the same dtype as input
+    for c in np.typecodes['All']:
+        if c == 'V':
+            continue
+        arr = np.zeros((3, 3), dtype=c)
+        assert_equal(np.triu(arr).dtype, arr.dtype)
+        assert_equal(np.tril(arr).dtype, arr.dtype)
+
+    # check special cases
+    arr = np.array([['2001-01-01T12:00', '2002-02-03T13:56'],
+                    ['2004-01-01T12:00', '2003-01-03T13:45']],
+                   dtype='datetime64')
+    assert_equal(np.triu(arr).dtype, arr.dtype)
+    assert_equal(np.tril(arr).dtype, arr.dtype)
+
+    arr = np.zeros((3,3), dtype='f4,f4')
+    assert_equal(np.triu(arr).dtype, arr.dtype)
+    assert_equal(np.tril(arr).dtype, arr.dtype)
+
+
+def test_mask_indices():
+    # simple test without offset
+    iu = mask_indices(3, np.triu)
+    a = np.arange(9).reshape(3, 3)
+    assert_array_equal(a[iu], array([0, 1, 2, 4, 5, 8]))
+    # Now with an offset
+    iu1 = mask_indices(3, np.triu, 1)
+    assert_array_equal(a[iu1], array([1, 2, 5]))
+
+
+def test_tril_indices():
+    # indices without and with offset
+    il1 = tril_indices(4)
+    il2 = tril_indices(4, k=2)
+    il3 = tril_indices(4, m=5)
+    il4 = tril_indices(4, k=2, m=5)
+
+    a = np.array([[1, 2, 3, 4],
+                  [5, 6, 7, 8],
+                  [9, 10, 11, 12],
+                  [13, 14, 15, 16]])
+    b = np.arange(1, 21).reshape(4, 5)
+
+    # indexing:
+    assert_array_equal(a[il1],
+                       array([1, 5, 6, 9, 10, 11, 13, 14, 15, 16]))
+    assert_array_equal(b[il3],
+                       array([1, 6, 7, 11, 12, 13, 16, 17, 18, 19]))
+
+    # And for assigning values:
+    a[il1] = -1
+    assert_array_equal(a,
+                       array([[-1, 2, 3, 4],
+                              [-1, -1, 7, 8],
+                              [-1, -1, -1, 12],
+                              [-1, -1, -1, -1]]))
+    b[il3] = -1
+    assert_array_equal(b,
+                       array([[-1, 2, 3, 4, 5],
+                              [-1, -1, 8, 9, 10],
+                              [-1, -1, -1, 14, 15],
+                              [-1, -1, -1, -1, 20]]))
+    # These cover almost the whole array (two diagonals right of the main one):
+    a[il2] = -10
+    assert_array_equal(a,
+                       array([[-10, -10, -10, 4],
+                              [-10, -10, -10, -10],
+                              [-10, -10, -10, -10],
+                              [-10, -10, -10, -10]]))
+    b[il4] = -10
+    assert_array_equal(b,
+                       array([[-10, -10, -10, 4, 5],
+                              [-10, -10, -10, -10, 10],
+                              [-10, -10, -10, -10, -10],
+                              [-10, -10, -10, -10, -10]]))
+
+
+class TestTriuIndices:
+    def test_triu_indices(self):
+        iu1 = triu_indices(4)
+        iu2 = triu_indices(4, k=2)
+        iu3 = triu_indices(4, m=5)
+        iu4 = triu_indices(4, k=2, m=5)
+
+        a = np.array([[1, 2, 3, 4],
+                      [5, 6, 7, 8],
+                      [9, 10, 11, 12],
+                      [13, 14, 15, 16]])
+        b = np.arange(1, 21).reshape(4, 5)
+
+        # Both for indexing:
+        assert_array_equal(a[iu1],
+                           array([1, 2, 3, 4, 6, 7, 8, 11, 12, 16]))
+        assert_array_equal(b[iu3],
+                           array([1, 2, 3, 4, 5, 7, 8, 9,
+                                  10, 13, 14, 15, 19, 20]))
+
+        # And for assigning values:
+        a[iu1] = -1
+        assert_array_equal(a,
+                           array([[-1, -1, -1, -1],
+                                  [5, -1, -1, -1],
+                                  [9, 10, -1, -1],
+                                  [13, 14, 15, -1]]))
+        b[iu3] = -1
+        assert_array_equal(b,
+                           array([[-1, -1, -1, -1, -1],
+                                  [6, -1, -1, -1, -1],
+                                  [11, 12, -1, -1, -1],
+                                  [16, 17, 18, -1, -1]]))
+
+        # These cover almost the whole array (two diagonals right of the
+        # main one):
+        a[iu2] = -10
+        assert_array_equal(a,
+                           array([[-1, -1, -10, -10],
+                                  [5, -1, -1, -10],
+                                  [9, 10, -1, -1],
+                                  [13, 14, 15, -1]]))
+        b[iu4] = -10
+        assert_array_equal(b,
+                           array([[-1, -1, -10, -10, -10],
+                                  [6, -1, -1, -10, -10],
+                                  [11, 12, -1, -1, -10],
+                                  [16, 17, 18, -1, -1]]))
+
+
+class TestTrilIndicesFrom:
+    def test_exceptions(self):
+        assert_raises(ValueError, tril_indices_from, np.ones((2,)))
+        assert_raises(ValueError, tril_indices_from, np.ones((2, 2, 2)))
+        # assert_raises(ValueError, tril_indices_from, np.ones((2, 3)))
+
+
+class TestTriuIndicesFrom:
+    def test_exceptions(self):
+        assert_raises(ValueError, triu_indices_from, np.ones((2,)))
+        assert_raises(ValueError, triu_indices_from, np.ones((2, 2, 2)))
+        # assert_raises(ValueError, triu_indices_from, np.ones((2, 3)))
+
+
+class TestVander:
+    def test_basic(self):
+        c = np.array([0, 1, -2, 3])
+        v = vander(c)
+        powers = np.array([[0, 0, 0, 0, 1],
+                           [1, 1, 1, 1, 1],
+                           [16, -8, 4, -2, 1],
+                           [81, 27, 9, 3, 1]])
+        # Check default value of N:
+        assert_array_equal(v, powers[:, 1:])
+        # Check a range of N values, including 0 and 5 (greater than default)
+        m = powers.shape[1]
+        for n in range(6):
+            v = vander(c, N=n)
+            assert_array_equal(v, powers[:, m-n:m])
+
+    def test_dtypes(self):
+        c = array([11, -12, 13], dtype=np.int8)
+        v = vander(c)
+        expected = np.array([[121, 11, 1],
+                             [144, -12, 1],
+                             [169, 13, 1]])
+        assert_array_equal(v, expected)
+
+        c = array([1.0+1j, 1.0-1j])
+        v = vander(c, N=3)
+        expected = np.array([[2j, 1+1j, 1],
+                             [-2j, 1-1j, 1]])
+        # The data is floating point, but the values are small integers,
+        # so assert_array_equal *should* be safe here (rather than, say,
+        # assert_array_almost_equal).
+        assert_array_equal(v, expected)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_type_check.py b/venv/Lib/site-packages/numpy/lib/tests/test_type_check.py
new file mode 100644
index 000000000..3f4ca6309
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_type_check.py
@@ -0,0 +1,478 @@
+import numpy as np
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_raises
+    )
+from numpy.lib.type_check import (
+    common_type, mintypecode, isreal, iscomplex, isposinf, isneginf,
+    nan_to_num, isrealobj, iscomplexobj, asfarray, real_if_close
+    )
+
+
+def assert_all(x):
+    assert_(np.all(x), x)
+
+
+class TestCommonType:
+    def test_basic(self):
+        ai32 = np.array([[1, 2], [3, 4]], dtype=np.int32)
+        af16 = np.array([[1, 2], [3, 4]], dtype=np.float16)
+        af32 = np.array([[1, 2], [3, 4]], dtype=np.float32)
+        af64 = np.array([[1, 2], [3, 4]], dtype=np.float64)
+        acs = np.array([[1+5j, 2+6j], [3+7j, 4+8j]], dtype=np.csingle)
+        acd = np.array([[1+5j, 2+6j], [3+7j, 4+8j]], dtype=np.cdouble)
+        assert_(common_type(ai32) == np.float64)
+        assert_(common_type(af16) == np.float16)
+        assert_(common_type(af32) == np.float32)
+        assert_(common_type(af64) == np.float64)
+        assert_(common_type(acs) == np.csingle)
+        assert_(common_type(acd) == np.cdouble)
+
+
+class TestMintypecode:
+
+    def test_default_1(self):
+        for itype in '1bcsuwil':
+            assert_equal(mintypecode(itype), 'd')
+        assert_equal(mintypecode('f'), 'f')
+        assert_equal(mintypecode('d'), 'd')
+        assert_equal(mintypecode('F'), 'F')
+        assert_equal(mintypecode('D'), 'D')
+
+    def test_default_2(self):
+        for itype in '1bcsuwil':
+            assert_equal(mintypecode(itype+'f'), 'f')
+            assert_equal(mintypecode(itype+'d'), 'd')
+            assert_equal(mintypecode(itype+'F'), 'F')
+            assert_equal(mintypecode(itype+'D'), 'D')
+        assert_equal(mintypecode('ff'), 'f')
+        assert_equal(mintypecode('fd'), 'd')
+        assert_equal(mintypecode('fF'), 'F')
+        assert_equal(mintypecode('fD'), 'D')
+        assert_equal(mintypecode('df'), 'd')
+        assert_equal(mintypecode('dd'), 'd')
+        #assert_equal(mintypecode('dF',savespace=1),'F')
+        assert_equal(mintypecode('dF'), 'D')
+        assert_equal(mintypecode('dD'), 'D')
+        assert_equal(mintypecode('Ff'), 'F')
+        #assert_equal(mintypecode('Fd',savespace=1),'F')
+        assert_equal(mintypecode('Fd'), 'D')
+        assert_equal(mintypecode('FF'), 'F')
+        assert_equal(mintypecode('FD'), 'D')
+        assert_equal(mintypecode('Df'), 'D')
+        assert_equal(mintypecode('Dd'), 'D')
+        assert_equal(mintypecode('DF'), 'D')
+        assert_equal(mintypecode('DD'), 'D')
+
+    def test_default_3(self):
+        assert_equal(mintypecode('fdF'), 'D')
+        #assert_equal(mintypecode('fdF',savespace=1),'F')
+        assert_equal(mintypecode('fdD'), 'D')
+        assert_equal(mintypecode('fFD'), 'D')
+        assert_equal(mintypecode('dFD'), 'D')
+
+        assert_equal(mintypecode('ifd'), 'd')
+        assert_equal(mintypecode('ifF'), 'F')
+        assert_equal(mintypecode('ifD'), 'D')
+        assert_equal(mintypecode('idF'), 'D')
+        #assert_equal(mintypecode('idF',savespace=1),'F')
+        assert_equal(mintypecode('idD'), 'D')
+
+
+class TestIsscalar:
+
+    def test_basic(self):
+        assert_(np.isscalar(3))
+        assert_(not np.isscalar([3]))
+        assert_(not np.isscalar((3,)))
+        assert_(np.isscalar(3j))
+        assert_(np.isscalar(4.0))
+
+
+class TestReal:
+
+    def test_real(self):
+        y = np.random.rand(10,)
+        assert_array_equal(y, np.real(y))
+
+        y = np.array(1)
+        out = np.real(y)
+        assert_array_equal(y, out)
+        assert_(isinstance(out, np.ndarray))
+
+        y = 1
+        out = np.real(y)
+        assert_equal(y, out)
+        assert_(not isinstance(out, np.ndarray))
+
+    def test_cmplx(self):
+        y = np.random.rand(10,)+1j*np.random.rand(10,)
+        assert_array_equal(y.real, np.real(y))
+
+        y = np.array(1 + 1j)
+        out = np.real(y)
+        assert_array_equal(y.real, out)
+        assert_(isinstance(out, np.ndarray))
+
+        y = 1 + 1j
+        out = np.real(y)
+        assert_equal(1.0, out)
+        assert_(not isinstance(out, np.ndarray))
+
+
+class TestImag:
+
+    def test_real(self):
+        y = np.random.rand(10,)
+        assert_array_equal(0, np.imag(y))
+
+        y = np.array(1)
+        out = np.imag(y)
+        assert_array_equal(0, out)
+        assert_(isinstance(out, np.ndarray))
+
+        y = 1
+        out = np.imag(y)
+        assert_equal(0, out)
+        assert_(not isinstance(out, np.ndarray))
+
+    def test_cmplx(self):
+        y = np.random.rand(10,)+1j*np.random.rand(10,)
+        assert_array_equal(y.imag, np.imag(y))
+
+        y = np.array(1 + 1j)
+        out = np.imag(y)
+        assert_array_equal(y.imag, out)
+        assert_(isinstance(out, np.ndarray))
+
+        y = 1 + 1j
+        out = np.imag(y)
+        assert_equal(1.0, out)
+        assert_(not isinstance(out, np.ndarray))
+
+
+class TestIscomplex:
+
+    def test_fail(self):
+        z = np.array([-1, 0, 1])
+        res = iscomplex(z)
+        assert_(not np.sometrue(res, axis=0))
+
+    def test_pass(self):
+        z = np.array([-1j, 1, 0])
+        res = iscomplex(z)
+        assert_array_equal(res, [1, 0, 0])
+
+
+class TestIsreal:
+
+    def test_pass(self):
+        z = np.array([-1, 0, 1j])
+        res = isreal(z)
+        assert_array_equal(res, [1, 1, 0])
+
+    def test_fail(self):
+        z = np.array([-1j, 1, 0])
+        res = isreal(z)
+        assert_array_equal(res, [0, 1, 1])
+
+
+class TestIscomplexobj:
+
+    def test_basic(self):
+        z = np.array([-1, 0, 1])
+        assert_(not iscomplexobj(z))
+        z = np.array([-1j, 0, -1])
+        assert_(iscomplexobj(z))
+
+    def test_scalar(self):
+        assert_(not iscomplexobj(1.0))
+        assert_(iscomplexobj(1+0j))
+
+    def test_list(self):
+        assert_(iscomplexobj([3, 1+0j, True]))
+        assert_(not iscomplexobj([3, 1, True]))
+
+    def test_duck(self):
+        class DummyComplexArray:
+            @property
+            def dtype(self):
+                return np.dtype(complex)
+        dummy = DummyComplexArray()
+        assert_(iscomplexobj(dummy))
+
+    def test_pandas_duck(self):
+        # This tests a custom np.dtype duck-typed class, such as used by pandas
+        # (pandas.core.dtypes)
+        class PdComplex(np.complex128):
+            pass
+        class PdDtype:
+            name = 'category'
+            names = None
+            type = PdComplex
+            kind = 'c'
+            str = '<c16'
+            base = np.dtype('complex128')
+        class DummyPd:
+            @property
+            def dtype(self):
+                return PdDtype
+        dummy = DummyPd()
+        assert_(iscomplexobj(dummy))
+
+    def test_custom_dtype_duck(self):
+        class MyArray(list):
+            @property
+            def dtype(self):
+                return complex
+
+        a = MyArray([1+0j, 2+0j, 3+0j])
+        assert_(iscomplexobj(a))
+
+
+class TestIsrealobj:
+    def test_basic(self):
+        z = np.array([-1, 0, 1])
+        assert_(isrealobj(z))
+        z = np.array([-1j, 0, -1])
+        assert_(not isrealobj(z))
+
+
+class TestIsnan:
+
+    def test_goodvalues(self):
+        z = np.array((-1., 0., 1.))
+        res = np.isnan(z) == 0
+        assert_all(np.all(res, axis=0))
+
+    def test_posinf(self):
+        with np.errstate(divide='ignore'):
+            assert_all(np.isnan(np.array((1.,))/0.) == 0)
+
+    def test_neginf(self):
+        with np.errstate(divide='ignore'):
+            assert_all(np.isnan(np.array((-1.,))/0.) == 0)
+
+    def test_ind(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isnan(np.array((0.,))/0.) == 1)
+
+    def test_integer(self):
+        assert_all(np.isnan(1) == 0)
+
+    def test_complex(self):
+        assert_all(np.isnan(1+1j) == 0)
+
+    def test_complex1(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isnan(np.array(0+0j)/0.) == 1)
+
+
+class TestIsfinite:
+    # Fixme, wrong place, isfinite now ufunc
+
+    def test_goodvalues(self):
+        z = np.array((-1., 0., 1.))
+        res = np.isfinite(z) == 1
+        assert_all(np.all(res, axis=0))
+
+    def test_posinf(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isfinite(np.array((1.,))/0.) == 0)
+
+    def test_neginf(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isfinite(np.array((-1.,))/0.) == 0)
+
+    def test_ind(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isfinite(np.array((0.,))/0.) == 0)
+
+    def test_integer(self):
+        assert_all(np.isfinite(1) == 1)
+
+    def test_complex(self):
+        assert_all(np.isfinite(1+1j) == 1)
+
+    def test_complex1(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isfinite(np.array(1+1j)/0.) == 0)
+
+
+class TestIsinf:
+    # Fixme, wrong place, isinf now ufunc
+
+    def test_goodvalues(self):
+        z = np.array((-1., 0., 1.))
+        res = np.isinf(z) == 0
+        assert_all(np.all(res, axis=0))
+
+    def test_posinf(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isinf(np.array((1.,))/0.) == 1)
+
+    def test_posinf_scalar(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isinf(np.array(1.,)/0.) == 1)
+
+    def test_neginf(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isinf(np.array((-1.,))/0.) == 1)
+
+    def test_neginf_scalar(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isinf(np.array(-1.)/0.) == 1)
+
+    def test_ind(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_all(np.isinf(np.array((0.,))/0.) == 0)
+
+
+class TestIsposinf:
+
+    def test_generic(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = isposinf(np.array((-1., 0, 1))/0.)
+        assert_(vals[0] == 0)
+        assert_(vals[1] == 0)
+        assert_(vals[2] == 1)
+
+
+class TestIsneginf:
+
+    def test_generic(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = isneginf(np.array((-1., 0, 1))/0.)
+        assert_(vals[0] == 1)
+        assert_(vals[1] == 0)
+        assert_(vals[2] == 0)
+
+
+class TestNanToNum:
+
+    def test_generic(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = nan_to_num(np.array((-1., 0, 1))/0.)
+        assert_all(vals[0] < -1e10) and assert_all(np.isfinite(vals[0]))
+        assert_(vals[1] == 0)
+        assert_all(vals[2] > 1e10) and assert_all(np.isfinite(vals[2]))
+        assert_equal(type(vals), np.ndarray)
+        
+        # perform the same tests but with nan, posinf and neginf keywords
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = nan_to_num(np.array((-1., 0, 1))/0., 
+                              nan=10, posinf=20, neginf=30)
+        assert_equal(vals, [30, 10, 20])
+        assert_all(np.isfinite(vals[[0, 2]]))
+        assert_equal(type(vals), np.ndarray)
+
+        # perform the same test but in-place
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = np.array((-1., 0, 1))/0.
+        result = nan_to_num(vals, copy=False)
+
+        assert_(result is vals)
+        assert_all(vals[0] < -1e10) and assert_all(np.isfinite(vals[0]))
+        assert_(vals[1] == 0)
+        assert_all(vals[2] > 1e10) and assert_all(np.isfinite(vals[2]))
+        assert_equal(type(vals), np.ndarray)
+        
+        # perform the same test but in-place
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = np.array((-1., 0, 1))/0.
+        result = nan_to_num(vals, copy=False, nan=10, posinf=20, neginf=30)
+
+        assert_(result is vals)
+        assert_equal(vals, [30, 10, 20])
+        assert_all(np.isfinite(vals[[0, 2]]))
+        assert_equal(type(vals), np.ndarray)
+
+    def test_array(self):
+        vals = nan_to_num([1])
+        assert_array_equal(vals, np.array([1], int))
+        assert_equal(type(vals), np.ndarray)
+        vals = nan_to_num([1], nan=10, posinf=20, neginf=30)
+        assert_array_equal(vals, np.array([1], int))
+        assert_equal(type(vals), np.ndarray)
+
+    def test_integer(self):
+        vals = nan_to_num(1)
+        assert_all(vals == 1)
+        assert_equal(type(vals), np.int_)
+        vals = nan_to_num(1, nan=10, posinf=20, neginf=30)
+        assert_all(vals == 1)
+        assert_equal(type(vals), np.int_)
+
+    def test_float(self):
+        vals = nan_to_num(1.0)
+        assert_all(vals == 1.0)
+        assert_equal(type(vals), np.float_)
+        vals = nan_to_num(1.1, nan=10, posinf=20, neginf=30)
+        assert_all(vals == 1.1)
+        assert_equal(type(vals), np.float_)
+
+    def test_complex_good(self):
+        vals = nan_to_num(1+1j)
+        assert_all(vals == 1+1j)
+        assert_equal(type(vals), np.complex_)
+        vals = nan_to_num(1+1j, nan=10, posinf=20, neginf=30)
+        assert_all(vals == 1+1j)
+        assert_equal(type(vals), np.complex_)
+
+    def test_complex_bad(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            v = 1 + 1j
+            v += np.array(0+1.j)/0.
+        vals = nan_to_num(v)
+        # !! This is actually (unexpectedly) zero
+        assert_all(np.isfinite(vals))
+        assert_equal(type(vals), np.complex_)
+
+    def test_complex_bad2(self):
+        with np.errstate(divide='ignore', invalid='ignore'):
+            v = 1 + 1j
+            v += np.array(-1+1.j)/0.
+        vals = nan_to_num(v)
+        assert_all(np.isfinite(vals))
+        assert_equal(type(vals), np.complex_)
+        # Fixme
+        #assert_all(vals.imag > 1e10)  and assert_all(np.isfinite(vals))
+        # !! This is actually (unexpectedly) positive
+        # !! inf.  Comment out for now, and see if it
+        # !! changes
+        #assert_all(vals.real < -1e10) and assert_all(np.isfinite(vals))
+    
+    def test_do_not_rewrite_previous_keyword(self):
+        # This is done to test that when, for instance, nan=np.inf then these 
+        # values are not rewritten by posinf keyword to the posinf value.
+        with np.errstate(divide='ignore', invalid='ignore'):
+            vals = nan_to_num(np.array((-1., 0, 1))/0., nan=np.inf, posinf=999)
+        assert_all(np.isfinite(vals[[0, 2]]))
+        assert_all(vals[0] < -1e10)
+        assert_equal(vals[[1, 2]], [np.inf, 999])
+        assert_equal(type(vals), np.ndarray)
+
+
+class TestRealIfClose:
+
+    def test_basic(self):
+        a = np.random.rand(10)
+        b = real_if_close(a+1e-15j)
+        assert_all(isrealobj(b))
+        assert_array_equal(a, b)
+        b = real_if_close(a+1e-7j)
+        assert_all(iscomplexobj(b))
+        b = real_if_close(a+1e-7j, tol=1e-6)
+        assert_all(isrealobj(b))
+
+
+class TestArrayConversion:
+
+    def test_asfarray(self):
+        a = asfarray(np.array([1, 2, 3]))
+        assert_equal(a.__class__, np.ndarray)
+        assert_(np.issubdtype(a.dtype, np.floating))
+
+        # previously this would infer dtypes from arrays, unlike every single
+        # other numpy function
+        assert_raises(TypeError,
+            asfarray, np.array([1, 2, 3]), dtype=np.array(1.0))
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_ufunclike.py b/venv/Lib/site-packages/numpy/lib/tests/test_ufunclike.py
new file mode 100644
index 000000000..c280b6969
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_ufunclike.py
@@ -0,0 +1,104 @@
+import numpy as np
+import numpy.core as nx
+import numpy.lib.ufunclike as ufl
+from numpy.testing import (
+    assert_, assert_equal, assert_array_equal, assert_warns, assert_raises
+)
+
+
+class TestUfunclike:
+
+    def test_isposinf(self):
+        a = nx.array([nx.inf, -nx.inf, nx.nan, 0.0, 3.0, -3.0])
+        out = nx.zeros(a.shape, bool)
+        tgt = nx.array([True, False, False, False, False, False])
+
+        res = ufl.isposinf(a)
+        assert_equal(res, tgt)
+        res = ufl.isposinf(a, out)
+        assert_equal(res, tgt)
+        assert_equal(out, tgt)
+
+        a = a.astype(np.complex_)
+        with assert_raises(TypeError):
+            ufl.isposinf(a)
+
+    def test_isneginf(self):
+        a = nx.array([nx.inf, -nx.inf, nx.nan, 0.0, 3.0, -3.0])
+        out = nx.zeros(a.shape, bool)
+        tgt = nx.array([False, True, False, False, False, False])
+
+        res = ufl.isneginf(a)
+        assert_equal(res, tgt)
+        res = ufl.isneginf(a, out)
+        assert_equal(res, tgt)
+        assert_equal(out, tgt)
+
+        a = a.astype(np.complex_)
+        with assert_raises(TypeError):
+            ufl.isneginf(a)
+
+    def test_fix(self):
+        a = nx.array([[1.0, 1.1, 1.5, 1.8], [-1.0, -1.1, -1.5, -1.8]])
+        out = nx.zeros(a.shape, float)
+        tgt = nx.array([[1., 1., 1., 1.], [-1., -1., -1., -1.]])
+
+        res = ufl.fix(a)
+        assert_equal(res, tgt)
+        res = ufl.fix(a, out)
+        assert_equal(res, tgt)
+        assert_equal(out, tgt)
+        assert_equal(ufl.fix(3.14), 3)
+
+    def test_fix_with_subclass(self):
+        class MyArray(nx.ndarray):
+            def __new__(cls, data, metadata=None):
+                res = nx.array(data, copy=True).view(cls)
+                res.metadata = metadata
+                return res
+
+            def __array_wrap__(self, obj, context=None):
+                if isinstance(obj, MyArray):
+                    obj.metadata = self.metadata
+                return obj
+
+            def __array_finalize__(self, obj):
+                self.metadata = getattr(obj, 'metadata', None)
+                return self
+
+        a = nx.array([1.1, -1.1])
+        m = MyArray(a, metadata='foo')
+        f = ufl.fix(m)
+        assert_array_equal(f, nx.array([1, -1]))
+        assert_(isinstance(f, MyArray))
+        assert_equal(f.metadata, 'foo')
+
+        # check 0d arrays don't decay to scalars
+        m0d = m[0,...]
+        m0d.metadata = 'bar'
+        f0d = ufl.fix(m0d)
+        assert_(isinstance(f0d, MyArray))
+        assert_equal(f0d.metadata, 'bar')
+
+    def test_deprecated(self):
+        # NumPy 1.13.0, 2017-04-26
+        assert_warns(DeprecationWarning, ufl.fix, [1, 2], y=nx.empty(2))
+        assert_warns(DeprecationWarning, ufl.isposinf, [1, 2], y=nx.empty(2))
+        assert_warns(DeprecationWarning, ufl.isneginf, [1, 2], y=nx.empty(2))
+
+    def test_scalar(self):
+        x = np.inf
+        actual = np.isposinf(x)
+        expected = np.True_
+        assert_equal(actual, expected)
+        assert_equal(type(actual), type(expected))
+
+        x = -3.4
+        actual = np.fix(x)
+        expected = np.float64(-3.0)
+        assert_equal(actual, expected)
+        assert_equal(type(actual), type(expected))
+
+        out = np.array(0.0)
+        actual = np.fix(x, out=out)
+        assert_(actual is out)
diff --git a/venv/Lib/site-packages/numpy/lib/tests/test_utils.py b/venv/Lib/site-packages/numpy/lib/tests/test_utils.py
new file mode 100644
index 000000000..261cfef5d
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/tests/test_utils.py
@@ -0,0 +1,142 @@
+import inspect
+import sys
+import pytest
+
+from numpy.core import arange
+from numpy.testing import assert_, assert_equal, assert_raises_regex
+from numpy.lib import deprecate
+import numpy.lib.utils as utils
+
+from io import StringIO
+
+
+@pytest.mark.skipif(sys.flags.optimize == 2, reason="Python running -OO")
+def test_lookfor():
+    out = StringIO()
+    utils.lookfor('eigenvalue', module='numpy', output=out,
+                  import_modules=False)
+    out = out.getvalue()
+    assert_('numpy.linalg.eig' in out)
+
+
+@deprecate
+def old_func(self, x):
+    return x
+
+
+@deprecate(message="Rather use new_func2")
+def old_func2(self, x):
+    return x
+
+
+def old_func3(self, x):
+    return x
+new_func3 = deprecate(old_func3, old_name="old_func3", new_name="new_func3")
+
+
+def old_func4(self, x):
+    """Summary.
+
+    Further info.
+    """
+    return x
+new_func4 = deprecate(old_func4)
+
+
+def old_func5(self, x):
+    """Summary.
+
+        Bizarre indentation.
+    """
+    return x
+new_func5 = deprecate(old_func5, message="This function is\ndeprecated.")
+
+
+def old_func6(self, x):
+    """
+    Also in PEP-257.
+    """
+    return x
+new_func6 = deprecate(old_func6)
+
+
+def test_deprecate_decorator():
+    assert_('deprecated' in old_func.__doc__)
+
+
+def test_deprecate_decorator_message():
+    assert_('Rather use new_func2' in old_func2.__doc__)
+
+
+def test_deprecate_fn():
+    assert_('old_func3' in new_func3.__doc__)
+    assert_('new_func3' in new_func3.__doc__)
+
+
+@pytest.mark.skipif(sys.flags.optimize == 2, reason="-OO discards docstrings")
+@pytest.mark.parametrize('old_func, new_func', [
+    (old_func4, new_func4),
+    (old_func5, new_func5),
+    (old_func6, new_func6),
+])
+def test_deprecate_help_indentation(old_func, new_func):
+    _compare_docs(old_func, new_func)
+    # Ensure we don't mess up the indentation
+    for knd, func in (('old', old_func), ('new', new_func)):
+        for li, line in enumerate(func.__doc__.split('\n')):
+            if li == 0:
+                assert line.startswith('    ') or not line.startswith(' '), knd
+            elif line:
+                assert line.startswith('    '), knd
+
+
+def _compare_docs(old_func, new_func):
+    old_doc = inspect.getdoc(old_func)
+    new_doc = inspect.getdoc(new_func)
+    index = new_doc.index('\n\n') + 2
+    assert_equal(new_doc[index:], old_doc)
+
+
+@pytest.mark.skipif(sys.flags.optimize == 2, reason="-OO discards docstrings")
+def test_deprecate_preserve_whitespace():
+    assert_('\n        Bizarre' in new_func5.__doc__)
+
+
+def test_safe_eval_nameconstant():
+    # Test if safe_eval supports Python 3.4 _ast.NameConstant
+    utils.safe_eval('None')
+
+
+class TestByteBounds:
+
+    def test_byte_bounds(self):
+        # pointer difference matches size * itemsize
+        # due to contiguity
+        a = arange(12).reshape(3, 4)
+        low, high = utils.byte_bounds(a)
+        assert_equal(high - low, a.size * a.itemsize)
+
+    def test_unusual_order_positive_stride(self):
+        a = arange(12).reshape(3, 4)
+        b = a.T
+        low, high = utils.byte_bounds(b)
+        assert_equal(high - low, b.size * b.itemsize)
+
+    def test_unusual_order_negative_stride(self):
+        a = arange(12).reshape(3, 4)
+        b = a.T[::-1]
+        low, high = utils.byte_bounds(b)
+        assert_equal(high - low, b.size * b.itemsize)
+
+    def test_strided(self):
+        a = arange(12)
+        b = a[::2]
+        low, high = utils.byte_bounds(b)
+        # the largest pointer address is lost (even numbers only in the
+        # stride), and compensate addresses for striding by 2
+        assert_equal(high - low, b.size * 2 * b.itemsize - b.itemsize)
+
+
+def test_assert_raises_regex_context_manager():
+    with assert_raises_regex(ValueError, 'no deprecation warning'):
+        raise ValueError('no deprecation warning')
diff --git a/venv/Lib/site-packages/numpy/lib/twodim_base.py b/venv/Lib/site-packages/numpy/lib/twodim_base.py
new file mode 100644
index 000000000..afc0f7423
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/twodim_base.py
@@ -0,0 +1,1015 @@
+""" Basic functions for manipulating 2d arrays
+
+"""
+import functools
+
+from numpy.core.numeric import (
+    asanyarray, arange, zeros, greater_equal, multiply, ones,
+    asarray, where, int8, int16, int32, int64, empty, promote_types, diagonal,
+    nonzero
+    )
+from numpy.core.overrides import set_module
+from numpy.core import overrides
+from numpy.core import iinfo
+
+
+__all__ = [
+    'diag', 'diagflat', 'eye', 'fliplr', 'flipud', 'tri', 'triu',
+    'tril', 'vander', 'histogram2d', 'mask_indices', 'tril_indices',
+    'tril_indices_from', 'triu_indices', 'triu_indices_from', ]
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+i1 = iinfo(int8)
+i2 = iinfo(int16)
+i4 = iinfo(int32)
+
+
+def _min_int(low, high):
+    """ get small int that fits the range """
+    if high <= i1.max and low >= i1.min:
+        return int8
+    if high <= i2.max and low >= i2.min:
+        return int16
+    if high <= i4.max and low >= i4.min:
+        return int32
+    return int64
+
+
+def _flip_dispatcher(m):
+    return (m,)
+
+
+@array_function_dispatch(_flip_dispatcher)
+def fliplr(m):
+    """
+    Flip array in the left/right direction.
+
+    Flip the entries in each row in the left/right direction.
+    Columns are preserved, but appear in a different order than before.
+
+    Parameters
+    ----------
+    m : array_like
+        Input array, must be at least 2-D.
+
+    Returns
+    -------
+    f : ndarray
+        A view of `m` with the columns reversed.  Since a view
+        is returned, this operation is :math:`\\mathcal O(1)`.
+
+    See Also
+    --------
+    flipud : Flip array in the up/down direction.
+    rot90 : Rotate array counterclockwise.
+
+    Notes
+    -----
+    Equivalent to m[:,::-1]. Requires the array to be at least 2-D.
+
+    Examples
+    --------
+    >>> A = np.diag([1.,2.,3.])
+    >>> A
+    array([[1.,  0.,  0.],
+           [0.,  2.,  0.],
+           [0.,  0.,  3.]])
+    >>> np.fliplr(A)
+    array([[0.,  0.,  1.],
+           [0.,  2.,  0.],
+           [3.,  0.,  0.]])
+
+    >>> A = np.random.randn(2,3,5)
+    >>> np.all(np.fliplr(A) == A[:,::-1,...])
+    True
+
+    """
+    m = asanyarray(m)
+    if m.ndim < 2:
+        raise ValueError("Input must be >= 2-d.")
+    return m[:, ::-1]
+
+
+@array_function_dispatch(_flip_dispatcher)
+def flipud(m):
+    """
+    Flip array in the up/down direction.
+
+    Flip the entries in each column in the up/down direction.
+    Rows are preserved, but appear in a different order than before.
+
+    Parameters
+    ----------
+    m : array_like
+        Input array.
+
+    Returns
+    -------
+    out : array_like
+        A view of `m` with the rows reversed.  Since a view is
+        returned, this operation is :math:`\\mathcal O(1)`.
+
+    See Also
+    --------
+    fliplr : Flip array in the left/right direction.
+    rot90 : Rotate array counterclockwise.
+
+    Notes
+    -----
+    Equivalent to ``m[::-1,...]``.
+    Does not require the array to be two-dimensional.
+
+    Examples
+    --------
+    >>> A = np.diag([1.0, 2, 3])
+    >>> A
+    array([[1.,  0.,  0.],
+           [0.,  2.,  0.],
+           [0.,  0.,  3.]])
+    >>> np.flipud(A)
+    array([[0.,  0.,  3.],
+           [0.,  2.,  0.],
+           [1.,  0.,  0.]])
+
+    >>> A = np.random.randn(2,3,5)
+    >>> np.all(np.flipud(A) == A[::-1,...])
+    True
+
+    >>> np.flipud([1,2])
+    array([2, 1])
+
+    """
+    m = asanyarray(m)
+    if m.ndim < 1:
+        raise ValueError("Input must be >= 1-d.")
+    return m[::-1, ...]
+
+
+@set_module('numpy')
+def eye(N, M=None, k=0, dtype=float, order='C'):
+    """
+    Return a 2-D array with ones on the diagonal and zeros elsewhere.
+
+    Parameters
+    ----------
+    N : int
+      Number of rows in the output.
+    M : int, optional
+      Number of columns in the output. If None, defaults to `N`.
+    k : int, optional
+      Index of the diagonal: 0 (the default) refers to the main diagonal,
+      a positive value refers to an upper diagonal, and a negative value
+      to a lower diagonal.
+    dtype : data-type, optional
+      Data-type of the returned array.
+    order : {'C', 'F'}, optional
+        Whether the output should be stored in row-major (C-style) or
+        column-major (Fortran-style) order in memory.
+
+        .. versionadded:: 1.14.0
+
+    Returns
+    -------
+    I : ndarray of shape (N,M)
+      An array where all elements are equal to zero, except for the `k`-th
+      diagonal, whose values are equal to one.
+
+    See Also
+    --------
+    identity : (almost) equivalent function
+    diag : diagonal 2-D array from a 1-D array specified by the user.
+
+    Examples
+    --------
+    >>> np.eye(2, dtype=int)
+    array([[1, 0],
+           [0, 1]])
+    >>> np.eye(3, k=1)
+    array([[0.,  1.,  0.],
+           [0.,  0.,  1.],
+           [0.,  0.,  0.]])
+
+    """
+    if M is None:
+        M = N
+    m = zeros((N, M), dtype=dtype, order=order)
+    if k >= M:
+        return m
+    if k >= 0:
+        i = k
+    else:
+        i = (-k) * M
+    m[:M-k].flat[i::M+1] = 1
+    return m
+
+
+def _diag_dispatcher(v, k=None):
+    return (v,)
+
+
+@array_function_dispatch(_diag_dispatcher)
+def diag(v, k=0):
+    """
+    Extract a diagonal or construct a diagonal array.
+
+    See the more detailed documentation for ``numpy.diagonal`` if you use this
+    function to extract a diagonal and wish to write to the resulting array;
+    whether it returns a copy or a view depends on what version of numpy you
+    are using.
+
+    Parameters
+    ----------
+    v : array_like
+        If `v` is a 2-D array, return a copy of its `k`-th diagonal.
+        If `v` is a 1-D array, return a 2-D array with `v` on the `k`-th
+        diagonal.
+    k : int, optional
+        Diagonal in question. The default is 0. Use `k>0` for diagonals
+        above the main diagonal, and `k<0` for diagonals below the main
+        diagonal.
+
+    Returns
+    -------
+    out : ndarray
+        The extracted diagonal or constructed diagonal array.
+
+    See Also
+    --------
+    diagonal : Return specified diagonals.
+    diagflat : Create a 2-D array with the flattened input as a diagonal.
+    trace : Sum along diagonals.
+    triu : Upper triangle of an array.
+    tril : Lower triangle of an array.
+
+    Examples
+    --------
+    >>> x = np.arange(9).reshape((3,3))
+    >>> x
+    array([[0, 1, 2],
+           [3, 4, 5],
+           [6, 7, 8]])
+
+    >>> np.diag(x)
+    array([0, 4, 8])
+    >>> np.diag(x, k=1)
+    array([1, 5])
+    >>> np.diag(x, k=-1)
+    array([3, 7])
+
+    >>> np.diag(np.diag(x))
+    array([[0, 0, 0],
+           [0, 4, 0],
+           [0, 0, 8]])
+
+    """
+    v = asanyarray(v)
+    s = v.shape
+    if len(s) == 1:
+        n = s[0]+abs(k)
+        res = zeros((n, n), v.dtype)
+        if k >= 0:
+            i = k
+        else:
+            i = (-k) * n
+        res[:n-k].flat[i::n+1] = v
+        return res
+    elif len(s) == 2:
+        return diagonal(v, k)
+    else:
+        raise ValueError("Input must be 1- or 2-d.")
+
+
+@array_function_dispatch(_diag_dispatcher)
+def diagflat(v, k=0):
+    """
+    Create a two-dimensional array with the flattened input as a diagonal.
+
+    Parameters
+    ----------
+    v : array_like
+        Input data, which is flattened and set as the `k`-th
+        diagonal of the output.
+    k : int, optional
+        Diagonal to set; 0, the default, corresponds to the "main" diagonal,
+        a positive (negative) `k` giving the number of the diagonal above
+        (below) the main.
+
+    Returns
+    -------
+    out : ndarray
+        The 2-D output array.
+
+    See Also
+    --------
+    diag : MATLAB work-alike for 1-D and 2-D arrays.
+    diagonal : Return specified diagonals.
+    trace : Sum along diagonals.
+
+    Examples
+    --------
+    >>> np.diagflat([[1,2], [3,4]])
+    array([[1, 0, 0, 0],
+           [0, 2, 0, 0],
+           [0, 0, 3, 0],
+           [0, 0, 0, 4]])
+
+    >>> np.diagflat([1,2], 1)
+    array([[0, 1, 0],
+           [0, 0, 2],
+           [0, 0, 0]])
+
+    """
+    try:
+        wrap = v.__array_wrap__
+    except AttributeError:
+        wrap = None
+    v = asarray(v).ravel()
+    s = len(v)
+    n = s + abs(k)
+    res = zeros((n, n), v.dtype)
+    if (k >= 0):
+        i = arange(0, n-k)
+        fi = i+k+i*n
+    else:
+        i = arange(0, n+k)
+        fi = i+(i-k)*n
+    res.flat[fi] = v
+    if not wrap:
+        return res
+    return wrap(res)
+
+
+@set_module('numpy')
+def tri(N, M=None, k=0, dtype=float):
+    """
+    An array with ones at and below the given diagonal and zeros elsewhere.
+
+    Parameters
+    ----------
+    N : int
+        Number of rows in the array.
+    M : int, optional
+        Number of columns in the array.
+        By default, `M` is taken equal to `N`.
+    k : int, optional
+        The sub-diagonal at and below which the array is filled.
+        `k` = 0 is the main diagonal, while `k` < 0 is below it,
+        and `k` > 0 is above.  The default is 0.
+    dtype : dtype, optional
+        Data type of the returned array.  The default is float.
+
+    Returns
+    -------
+    tri : ndarray of shape (N, M)
+        Array with its lower triangle filled with ones and zero elsewhere;
+        in other words ``T[i,j] == 1`` for ``j <= i + k``, 0 otherwise.
+
+    Examples
+    --------
+    >>> np.tri(3, 5, 2, dtype=int)
+    array([[1, 1, 1, 0, 0],
+           [1, 1, 1, 1, 0],
+           [1, 1, 1, 1, 1]])
+
+    >>> np.tri(3, 5, -1)
+    array([[0.,  0.,  0.,  0.,  0.],
+           [1.,  0.,  0.,  0.,  0.],
+           [1.,  1.,  0.,  0.,  0.]])
+
+    """
+    if M is None:
+        M = N
+
+    m = greater_equal.outer(arange(N, dtype=_min_int(0, N)),
+                            arange(-k, M-k, dtype=_min_int(-k, M - k)))
+
+    # Avoid making a copy if the requested type is already bool
+    m = m.astype(dtype, copy=False)
+
+    return m
+
+
+def _trilu_dispatcher(m, k=None):
+    return (m,)
+
+
+@array_function_dispatch(_trilu_dispatcher)
+def tril(m, k=0):
+    """
+    Lower triangle of an array.
+
+    Return a copy of an array with elements above the `k`-th diagonal zeroed.
+
+    Parameters
+    ----------
+    m : array_like, shape (M, N)
+        Input array.
+    k : int, optional
+        Diagonal above which to zero elements.  `k = 0` (the default) is the
+        main diagonal, `k < 0` is below it and `k > 0` is above.
+
+    Returns
+    -------
+    tril : ndarray, shape (M, N)
+        Lower triangle of `m`, of same shape and data-type as `m`.
+
+    See Also
+    --------
+    triu : same thing, only for the upper triangle
+
+    Examples
+    --------
+    >>> np.tril([[1,2,3],[4,5,6],[7,8,9],[10,11,12]], -1)
+    array([[ 0,  0,  0],
+           [ 4,  0,  0],
+           [ 7,  8,  0],
+           [10, 11, 12]])
+
+    """
+    m = asanyarray(m)
+    mask = tri(*m.shape[-2:], k=k, dtype=bool)
+
+    return where(mask, m, zeros(1, m.dtype))
+
+
+@array_function_dispatch(_trilu_dispatcher)
+def triu(m, k=0):
+    """
+    Upper triangle of an array.
+
+    Return a copy of a matrix with the elements below the `k`-th diagonal
+    zeroed.
+
+    Please refer to the documentation for `tril` for further details.
+
+    See Also
+    --------
+    tril : lower triangle of an array
+
+    Examples
+    --------
+    >>> np.triu([[1,2,3],[4,5,6],[7,8,9],[10,11,12]], -1)
+    array([[ 1,  2,  3],
+           [ 4,  5,  6],
+           [ 0,  8,  9],
+           [ 0,  0, 12]])
+
+    """
+    m = asanyarray(m)
+    mask = tri(*m.shape[-2:], k=k-1, dtype=bool)
+
+    return where(mask, zeros(1, m.dtype), m)
+
+
+def _vander_dispatcher(x, N=None, increasing=None):
+    return (x,)
+
+
+# Originally borrowed from John Hunter and matplotlib
+@array_function_dispatch(_vander_dispatcher)
+def vander(x, N=None, increasing=False):
+    """
+    Generate a Vandermonde matrix.
+
+    The columns of the output matrix are powers of the input vector. The
+    order of the powers is determined by the `increasing` boolean argument.
+    Specifically, when `increasing` is False, the `i`-th output column is
+    the input vector raised element-wise to the power of ``N - i - 1``. Such
+    a matrix with a geometric progression in each row is named for Alexandre-
+    Theophile Vandermonde.
+
+    Parameters
+    ----------
+    x : array_like
+        1-D input array.
+    N : int, optional
+        Number of columns in the output.  If `N` is not specified, a square
+        array is returned (``N = len(x)``).
+    increasing : bool, optional
+        Order of the powers of the columns.  If True, the powers increase
+        from left to right, if False (the default) they are reversed.
+
+        .. versionadded:: 1.9.0
+
+    Returns
+    -------
+    out : ndarray
+        Vandermonde matrix.  If `increasing` is False, the first column is
+        ``x^(N-1)``, the second ``x^(N-2)`` and so forth. If `increasing` is
+        True, the columns are ``x^0, x^1, ..., x^(N-1)``.
+
+    See Also
+    --------
+    polynomial.polynomial.polyvander
+
+    Examples
+    --------
+    >>> x = np.array([1, 2, 3, 5])
+    >>> N = 3
+    >>> np.vander(x, N)
+    array([[ 1,  1,  1],
+           [ 4,  2,  1],
+           [ 9,  3,  1],
+           [25,  5,  1]])
+
+    >>> np.column_stack([x**(N-1-i) for i in range(N)])
+    array([[ 1,  1,  1],
+           [ 4,  2,  1],
+           [ 9,  3,  1],
+           [25,  5,  1]])
+
+    >>> x = np.array([1, 2, 3, 5])
+    >>> np.vander(x)
+    array([[  1,   1,   1,   1],
+           [  8,   4,   2,   1],
+           [ 27,   9,   3,   1],
+           [125,  25,   5,   1]])
+    >>> np.vander(x, increasing=True)
+    array([[  1,   1,   1,   1],
+           [  1,   2,   4,   8],
+           [  1,   3,   9,  27],
+           [  1,   5,  25, 125]])
+
+    The determinant of a square Vandermonde matrix is the product
+    of the differences between the values of the input vector:
+
+    >>> np.linalg.det(np.vander(x))
+    48.000000000000043 # may vary
+    >>> (5-3)*(5-2)*(5-1)*(3-2)*(3-1)*(2-1)
+    48
+
+    """
+    x = asarray(x)
+    if x.ndim != 1:
+        raise ValueError("x must be a one-dimensional array or sequence.")
+    if N is None:
+        N = len(x)
+
+    v = empty((len(x), N), dtype=promote_types(x.dtype, int))
+    tmp = v[:, ::-1] if not increasing else v
+
+    if N > 0:
+        tmp[:, 0] = 1
+    if N > 1:
+        tmp[:, 1:] = x[:, None]
+        multiply.accumulate(tmp[:, 1:], out=tmp[:, 1:], axis=1)
+
+    return v
+
+
+def _histogram2d_dispatcher(x, y, bins=None, range=None, normed=None,
+                            weights=None, density=None):
+    yield x
+    yield y
+
+    # This terrible logic is adapted from the checks in histogram2d
+    try:
+        N = len(bins)
+    except TypeError:
+        N = 1
+    if N == 2:
+        yield from bins  # bins=[x, y]
+    else:
+        yield bins
+
+    yield weights
+
+
+@array_function_dispatch(_histogram2d_dispatcher)
+def histogram2d(x, y, bins=10, range=None, normed=None, weights=None,
+                density=None):
+    """
+    Compute the bi-dimensional histogram of two data samples.
+
+    Parameters
+    ----------
+    x : array_like, shape (N,)
+        An array containing the x coordinates of the points to be
+        histogrammed.
+    y : array_like, shape (N,)
+        An array containing the y coordinates of the points to be
+        histogrammed.
+    bins : int or array_like or [int, int] or [array, array], optional
+        The bin specification:
+
+          * If int, the number of bins for the two dimensions (nx=ny=bins).
+          * If array_like, the bin edges for the two dimensions
+            (x_edges=y_edges=bins).
+          * If [int, int], the number of bins in each dimension
+            (nx, ny = bins).
+          * If [array, array], the bin edges in each dimension
+            (x_edges, y_edges = bins).
+          * A combination [int, array] or [array, int], where int
+            is the number of bins and array is the bin edges.
+
+    range : array_like, shape(2,2), optional
+        The leftmost and rightmost edges of the bins along each dimension
+        (if not specified explicitly in the `bins` parameters):
+        ``[[xmin, xmax], [ymin, ymax]]``. All values outside of this range
+        will be considered outliers and not tallied in the histogram.
+    density : bool, optional
+        If False, the default, returns the number of samples in each bin.
+        If True, returns the probability *density* function at the bin,
+        ``bin_count / sample_count / bin_area``.
+    normed : bool, optional
+        An alias for the density argument that behaves identically. To avoid
+        confusion with the broken normed argument to `histogram`, `density`
+        should be preferred.
+    weights : array_like, shape(N,), optional
+        An array of values ``w_i`` weighing each sample ``(x_i, y_i)``.
+        Weights are normalized to 1 if `normed` is True. If `normed` is
+        False, the values of the returned histogram are equal to the sum of
+        the weights belonging to the samples falling into each bin.
+
+    Returns
+    -------
+    H : ndarray, shape(nx, ny)
+        The bi-dimensional histogram of samples `x` and `y`. Values in `x`
+        are histogrammed along the first dimension and values in `y` are
+        histogrammed along the second dimension.
+    xedges : ndarray, shape(nx+1,)
+        The bin edges along the first dimension.
+    yedges : ndarray, shape(ny+1,)
+        The bin edges along the second dimension.
+
+    See Also
+    --------
+    histogram : 1D histogram
+    histogramdd : Multidimensional histogram
+
+    Notes
+    -----
+    When `normed` is True, then the returned histogram is the sample
+    density, defined such that the sum over bins of the product
+    ``bin_value * bin_area`` is 1.
+
+    Please note that the histogram does not follow the Cartesian convention
+    where `x` values are on the abscissa and `y` values on the ordinate
+    axis.  Rather, `x` is histogrammed along the first dimension of the
+    array (vertical), and `y` along the second dimension of the array
+    (horizontal).  This ensures compatibility with `histogramdd`.
+
+    Examples
+    --------
+    >>> from matplotlib.image import NonUniformImage
+    >>> import matplotlib.pyplot as plt
+
+    Construct a 2-D histogram with variable bin width. First define the bin
+    edges:
+
+    >>> xedges = [0, 1, 3, 5]
+    >>> yedges = [0, 2, 3, 4, 6]
+
+    Next we create a histogram H with random bin content:
+
+    >>> x = np.random.normal(2, 1, 100)
+    >>> y = np.random.normal(1, 1, 100)
+    >>> H, xedges, yedges = np.histogram2d(x, y, bins=(xedges, yedges))
+    >>> H = H.T  # Let each row list bins with common y range.
+
+    :func:`imshow <matplotlib.pyplot.imshow>` can only display square bins:
+
+    >>> fig = plt.figure(figsize=(7, 3))
+    >>> ax = fig.add_subplot(131, title='imshow: square bins')
+    >>> plt.imshow(H, interpolation='nearest', origin='lower',
+    ...         extent=[xedges[0], xedges[-1], yedges[0], yedges[-1]])
+    <matplotlib.image.AxesImage object at 0x...>
+
+    :func:`pcolormesh <matplotlib.pyplot.pcolormesh>` can display actual edges:
+
+    >>> ax = fig.add_subplot(132, title='pcolormesh: actual edges',
+    ...         aspect='equal')
+    >>> X, Y = np.meshgrid(xedges, yedges)
+    >>> ax.pcolormesh(X, Y, H)
+    <matplotlib.collections.QuadMesh object at 0x...>
+
+    :class:`NonUniformImage <matplotlib.image.NonUniformImage>` can be used to
+    display actual bin edges with interpolation:
+
+    >>> ax = fig.add_subplot(133, title='NonUniformImage: interpolated',
+    ...         aspect='equal', xlim=xedges[[0, -1]], ylim=yedges[[0, -1]])
+    >>> im = NonUniformImage(ax, interpolation='bilinear')
+    >>> xcenters = (xedges[:-1] + xedges[1:]) / 2
+    >>> ycenters = (yedges[:-1] + yedges[1:]) / 2
+    >>> im.set_data(xcenters, ycenters, H)
+    >>> ax.images.append(im)
+    >>> plt.show()
+
+    """
+    from numpy import histogramdd
+
+    try:
+        N = len(bins)
+    except TypeError:
+        N = 1
+
+    if N != 1 and N != 2:
+        xedges = yedges = asarray(bins)
+        bins = [xedges, yedges]
+    hist, edges = histogramdd([x, y], bins, range, normed, weights, density)
+    return hist, edges[0], edges[1]
+
+
+@set_module('numpy')
+def mask_indices(n, mask_func, k=0):
+    """
+    Return the indices to access (n, n) arrays, given a masking function.
+
+    Assume `mask_func` is a function that, for a square array a of size
+    ``(n, n)`` with a possible offset argument `k`, when called as
+    ``mask_func(a, k)`` returns a new array with zeros in certain locations
+    (functions like `triu` or `tril` do precisely this). Then this function
+    returns the indices where the non-zero values would be located.
+
+    Parameters
+    ----------
+    n : int
+        The returned indices will be valid to access arrays of shape (n, n).
+    mask_func : callable
+        A function whose call signature is similar to that of `triu`, `tril`.
+        That is, ``mask_func(x, k)`` returns a boolean array, shaped like `x`.
+        `k` is an optional argument to the function.
+    k : scalar
+        An optional argument which is passed through to `mask_func`. Functions
+        like `triu`, `tril` take a second argument that is interpreted as an
+        offset.
+
+    Returns
+    -------
+    indices : tuple of arrays.
+        The `n` arrays of indices corresponding to the locations where
+        ``mask_func(np.ones((n, n)), k)`` is True.
+
+    See Also
+    --------
+    triu, tril, triu_indices, tril_indices
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    Examples
+    --------
+    These are the indices that would allow you to access the upper triangular
+    part of any 3x3 array:
+
+    >>> iu = np.mask_indices(3, np.triu)
+
+    For example, if `a` is a 3x3 array:
+
+    >>> a = np.arange(9).reshape(3, 3)
+    >>> a
+    array([[0, 1, 2],
+           [3, 4, 5],
+           [6, 7, 8]])
+    >>> a[iu]
+    array([0, 1, 2, 4, 5, 8])
+
+    An offset can be passed also to the masking function.  This gets us the
+    indices starting on the first diagonal right of the main one:
+
+    >>> iu1 = np.mask_indices(3, np.triu, 1)
+
+    with which we now extract only three elements:
+
+    >>> a[iu1]
+    array([1, 2, 5])
+
+    """
+    m = ones((n, n), int)
+    a = mask_func(m, k)
+    return nonzero(a != 0)
+
+
+@set_module('numpy')
+def tril_indices(n, k=0, m=None):
+    """
+    Return the indices for the lower-triangle of an (n, m) array.
+
+    Parameters
+    ----------
+    n : int
+        The row dimension of the arrays for which the returned
+        indices will be valid.
+    k : int, optional
+        Diagonal offset (see `tril` for details).
+    m : int, optional
+        .. versionadded:: 1.9.0
+
+        The column dimension of the arrays for which the returned
+        arrays will be valid.
+        By default `m` is taken equal to `n`.
+
+
+    Returns
+    -------
+    inds : tuple of arrays
+        The indices for the triangle. The returned tuple contains two arrays,
+        each with the indices along one dimension of the array.
+
+    See also
+    --------
+    triu_indices : similar function, for upper-triangular.
+    mask_indices : generic function accepting an arbitrary mask function.
+    tril, triu
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    Examples
+    --------
+    Compute two different sets of indices to access 4x4 arrays, one for the
+    lower triangular part starting at the main diagonal, and one starting two
+    diagonals further right:
+
+    >>> il1 = np.tril_indices(4)
+    >>> il2 = np.tril_indices(4, 2)
+
+    Here is how they can be used with a sample array:
+
+    >>> a = np.arange(16).reshape(4, 4)
+    >>> a
+    array([[ 0,  1,  2,  3],
+           [ 4,  5,  6,  7],
+           [ 8,  9, 10, 11],
+           [12, 13, 14, 15]])
+
+    Both for indexing:
+
+    >>> a[il1]
+    array([ 0,  4,  5, ..., 13, 14, 15])
+
+    And for assigning values:
+
+    >>> a[il1] = -1
+    >>> a
+    array([[-1,  1,  2,  3],
+           [-1, -1,  6,  7],
+           [-1, -1, -1, 11],
+           [-1, -1, -1, -1]])
+
+    These cover almost the whole array (two diagonals right of the main one):
+
+    >>> a[il2] = -10
+    >>> a
+    array([[-10, -10, -10,   3],
+           [-10, -10, -10, -10],
+           [-10, -10, -10, -10],
+           [-10, -10, -10, -10]])
+
+    """
+    return nonzero(tri(n, m, k=k, dtype=bool))
+
+
+def _trilu_indices_form_dispatcher(arr, k=None):
+    return (arr,)
+
+
+@array_function_dispatch(_trilu_indices_form_dispatcher)
+def tril_indices_from(arr, k=0):
+    """
+    Return the indices for the lower-triangle of arr.
+
+    See `tril_indices` for full details.
+
+    Parameters
+    ----------
+    arr : array_like
+        The indices will be valid for square arrays whose dimensions are
+        the same as arr.
+    k : int, optional
+        Diagonal offset (see `tril` for details).
+
+    See Also
+    --------
+    tril_indices, tril
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    """
+    if arr.ndim != 2:
+        raise ValueError("input array must be 2-d")
+    return tril_indices(arr.shape[-2], k=k, m=arr.shape[-1])
+
+
+@set_module('numpy')
+def triu_indices(n, k=0, m=None):
+    """
+    Return the indices for the upper-triangle of an (n, m) array.
+
+    Parameters
+    ----------
+    n : int
+        The size of the arrays for which the returned indices will
+        be valid.
+    k : int, optional
+        Diagonal offset (see `triu` for details).
+    m : int, optional
+        .. versionadded:: 1.9.0
+
+        The column dimension of the arrays for which the returned
+        arrays will be valid.
+        By default `m` is taken equal to `n`.
+
+
+    Returns
+    -------
+    inds : tuple, shape(2) of ndarrays, shape(`n`)
+        The indices for the triangle. The returned tuple contains two arrays,
+        each with the indices along one dimension of the array.  Can be used
+        to slice a ndarray of shape(`n`, `n`).
+
+    See also
+    --------
+    tril_indices : similar function, for lower-triangular.
+    mask_indices : generic function accepting an arbitrary mask function.
+    triu, tril
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    Examples
+    --------
+    Compute two different sets of indices to access 4x4 arrays, one for the
+    upper triangular part starting at the main diagonal, and one starting two
+    diagonals further right:
+
+    >>> iu1 = np.triu_indices(4)
+    >>> iu2 = np.triu_indices(4, 2)
+
+    Here is how they can be used with a sample array:
+
+    >>> a = np.arange(16).reshape(4, 4)
+    >>> a
+    array([[ 0,  1,  2,  3],
+           [ 4,  5,  6,  7],
+           [ 8,  9, 10, 11],
+           [12, 13, 14, 15]])
+
+    Both for indexing:
+
+    >>> a[iu1]
+    array([ 0,  1,  2, ..., 10, 11, 15])
+
+    And for assigning values:
+
+    >>> a[iu1] = -1
+    >>> a
+    array([[-1, -1, -1, -1],
+           [ 4, -1, -1, -1],
+           [ 8,  9, -1, -1],
+           [12, 13, 14, -1]])
+
+    These cover only a small part of the whole array (two diagonals right
+    of the main one):
+
+    >>> a[iu2] = -10
+    >>> a
+    array([[ -1,  -1, -10, -10],
+           [  4,  -1,  -1, -10],
+           [  8,   9,  -1,  -1],
+           [ 12,  13,  14,  -1]])
+
+    """
+    return nonzero(~tri(n, m, k=k-1, dtype=bool))
+
+
+@array_function_dispatch(_trilu_indices_form_dispatcher)
+def triu_indices_from(arr, k=0):
+    """
+    Return the indices for the upper-triangle of arr.
+
+    See `triu_indices` for full details.
+
+    Parameters
+    ----------
+    arr : ndarray, shape(N, N)
+        The indices will be valid for square arrays.
+    k : int, optional
+        Diagonal offset (see `triu` for details).
+
+    Returns
+    -------
+    triu_indices_from : tuple, shape(2) of ndarray, shape(N)
+        Indices for the upper-triangle of `arr`.
+
+    See Also
+    --------
+    triu_indices, triu
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    """
+    if arr.ndim != 2:
+        raise ValueError("input array must be 2-d")
+    return triu_indices(arr.shape[-2], k=k, m=arr.shape[-1])
diff --git a/venv/Lib/site-packages/numpy/lib/type_check.py b/venv/Lib/site-packages/numpy/lib/type_check.py
new file mode 100644
index 000000000..2a2982ab3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/type_check.py
@@ -0,0 +1,732 @@
+"""Automatically adapted for numpy Sep 19, 2005 by convertcode.py
+
+"""
+import functools
+import warnings
+
+__all__ = ['iscomplexobj', 'isrealobj', 'imag', 'iscomplex',
+           'isreal', 'nan_to_num', 'real', 'real_if_close',
+           'typename', 'asfarray', 'mintypecode', 'asscalar',
+           'common_type']
+
+import numpy.core.numeric as _nx
+from numpy.core.numeric import asarray, asanyarray, isnan, zeros
+from numpy.core.overrides import set_module
+from numpy.core import overrides
+from .ufunclike import isneginf, isposinf
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy')
+
+
+_typecodes_by_elsize = 'GDFgdfQqLlIiHhBb?'
+
+
+@set_module('numpy')
+def mintypecode(typechars, typeset='GDFgdf', default='d'):
+    """
+    Return the character for the minimum-size type to which given types can
+    be safely cast.
+
+    The returned type character must represent the smallest size dtype such
+    that an array of the returned type can handle the data from an array of
+    all types in `typechars` (or if `typechars` is an array, then its
+    dtype.char).
+
+    Parameters
+    ----------
+    typechars : list of str or array_like
+        If a list of strings, each string should represent a dtype.
+        If array_like, the character representation of the array dtype is used.
+    typeset : str or list of str, optional
+        The set of characters that the returned character is chosen from.
+        The default set is 'GDFgdf'.
+    default : str, optional
+        The default character, this is returned if none of the characters in
+        `typechars` matches a character in `typeset`.
+
+    Returns
+    -------
+    typechar : str
+        The character representing the minimum-size type that was found.
+
+    See Also
+    --------
+    dtype, sctype2char, maximum_sctype
+
+    Examples
+    --------
+    >>> np.mintypecode(['d', 'f', 'S'])
+    'd'
+    >>> x = np.array([1.1, 2-3.j])
+    >>> np.mintypecode(x)
+    'D'
+
+    >>> np.mintypecode('abceh', default='G')
+    'G'
+
+    """
+    typecodes = ((isinstance(t, str) and t) or asarray(t).dtype.char
+                 for t in typechars)
+    intersection = set(t for t in typecodes if t in typeset)
+    if not intersection:
+        return default
+    if 'F' in intersection and 'd' in intersection:
+        return 'D'
+    return min(intersection, key=_typecodes_by_elsize.index)
+
+
+def _asfarray_dispatcher(a, dtype=None):
+    return (a,)
+
+
+@array_function_dispatch(_asfarray_dispatcher)
+def asfarray(a, dtype=_nx.float_):
+    """
+    Return an array converted to a float type.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array.
+    dtype : str or dtype object, optional
+        Float type code to coerce input array `a`.  If `dtype` is one of the
+        'int' dtypes, it is replaced with float64.
+
+    Returns
+    -------
+    out : ndarray
+        The input `a` as a float ndarray.
+
+    Examples
+    --------
+    >>> np.asfarray([2, 3])
+    array([2.,  3.])
+    >>> np.asfarray([2, 3], dtype='float')
+    array([2.,  3.])
+    >>> np.asfarray([2, 3], dtype='int8')
+    array([2.,  3.])
+
+    """
+    if not _nx.issubdtype(dtype, _nx.inexact):
+        dtype = _nx.float_
+    return asarray(a, dtype=dtype)
+
+
+def _real_dispatcher(val):
+    return (val,)
+
+
+@array_function_dispatch(_real_dispatcher)
+def real(val):
+    """
+    Return the real part of the complex argument.
+
+    Parameters
+    ----------
+    val : array_like
+        Input array.
+
+    Returns
+    -------
+    out : ndarray or scalar
+        The real component of the complex argument. If `val` is real, the type
+        of `val` is used for the output.  If `val` has complex elements, the
+        returned type is float.
+
+    See Also
+    --------
+    real_if_close, imag, angle
+
+    Examples
+    --------
+    >>> a = np.array([1+2j, 3+4j, 5+6j])
+    >>> a.real
+    array([1.,  3.,  5.])
+    >>> a.real = 9
+    >>> a
+    array([9.+2.j,  9.+4.j,  9.+6.j])
+    >>> a.real = np.array([9, 8, 7])
+    >>> a
+    array([9.+2.j,  8.+4.j,  7.+6.j])
+    >>> np.real(1 + 1j)
+    1.0
+
+    """
+    try:
+        return val.real
+    except AttributeError:
+        return asanyarray(val).real
+
+
+def _imag_dispatcher(val):
+    return (val,)
+
+
+@array_function_dispatch(_imag_dispatcher)
+def imag(val):
+    """
+    Return the imaginary part of the complex argument.
+
+    Parameters
+    ----------
+    val : array_like
+        Input array.
+
+    Returns
+    -------
+    out : ndarray or scalar
+        The imaginary component of the complex argument. If `val` is real,
+        the type of `val` is used for the output.  If `val` has complex
+        elements, the returned type is float.
+
+    See Also
+    --------
+    real, angle, real_if_close
+
+    Examples
+    --------
+    >>> a = np.array([1+2j, 3+4j, 5+6j])
+    >>> a.imag
+    array([2.,  4.,  6.])
+    >>> a.imag = np.array([8, 10, 12])
+    >>> a
+    array([1. +8.j,  3.+10.j,  5.+12.j])
+    >>> np.imag(1 + 1j)
+    1.0
+
+    """
+    try:
+        return val.imag
+    except AttributeError:
+        return asanyarray(val).imag
+
+
+def _is_type_dispatcher(x):
+    return (x,)
+
+
+@array_function_dispatch(_is_type_dispatcher)
+def iscomplex(x):
+    """
+    Returns a bool array, where True if input element is complex.
+
+    What is tested is whether the input has a non-zero imaginary part, not if
+    the input type is complex.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array.
+
+    Returns
+    -------
+    out : ndarray of bools
+        Output array.
+
+    See Also
+    --------
+    isreal
+    iscomplexobj : Return True if x is a complex type or an array of complex
+                   numbers.
+
+    Examples
+    --------
+    >>> np.iscomplex([1+1j, 1+0j, 4.5, 3, 2, 2j])
+    array([ True, False, False, False, False,  True])
+
+    """
+    ax = asanyarray(x)
+    if issubclass(ax.dtype.type, _nx.complexfloating):
+        return ax.imag != 0
+    res = zeros(ax.shape, bool)
+    return res[()]   # convert to scalar if needed
+
+
+@array_function_dispatch(_is_type_dispatcher)
+def isreal(x):
+    """
+    Returns a bool array, where True if input element is real.
+
+    If element has complex type with zero complex part, the return value
+    for that element is True.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array.
+
+    Returns
+    -------
+    out : ndarray, bool
+        Boolean array of same shape as `x`.
+
+    See Also
+    --------
+    iscomplex
+    isrealobj : Return True if x is not a complex type.
+
+    Examples
+    --------
+    >>> np.isreal([1+1j, 1+0j, 4.5, 3, 2, 2j])
+    array([False,  True,  True,  True,  True, False])
+
+    """
+    return imag(x) == 0
+
+
+@array_function_dispatch(_is_type_dispatcher)
+def iscomplexobj(x):
+    """
+    Check for a complex type or an array of complex numbers.
+
+    The type of the input is checked, not the value. Even if the input
+    has an imaginary part equal to zero, `iscomplexobj` evaluates to True.
+
+    Parameters
+    ----------
+    x : any
+        The input can be of any type and shape.
+
+    Returns
+    -------
+    iscomplexobj : bool
+        The return value, True if `x` is of a complex type or has at least
+        one complex element.
+
+    See Also
+    --------
+    isrealobj, iscomplex
+
+    Examples
+    --------
+    >>> np.iscomplexobj(1)
+    False
+    >>> np.iscomplexobj(1+0j)
+    True
+    >>> np.iscomplexobj([3, 1+0j, True])
+    True
+
+    """
+    try:
+        dtype = x.dtype
+        type_ = dtype.type
+    except AttributeError:
+        type_ = asarray(x).dtype.type
+    return issubclass(type_, _nx.complexfloating)
+
+
+@array_function_dispatch(_is_type_dispatcher)
+def isrealobj(x):
+    """
+    Return True if x is a not complex type or an array of complex numbers.
+
+    The type of the input is checked, not the value. So even if the input
+    has an imaginary part equal to zero, `isrealobj` evaluates to False
+    if the data type is complex.
+
+    Parameters
+    ----------
+    x : any
+        The input can be of any type and shape.
+
+    Returns
+    -------
+    y : bool
+        The return value, False if `x` is of a complex type.
+
+    See Also
+    --------
+    iscomplexobj, isreal
+
+    Examples
+    --------
+    >>> np.isrealobj(1)
+    True
+    >>> np.isrealobj(1+0j)
+    False
+    >>> np.isrealobj([3, 1+0j, True])
+    False
+
+    """
+    return not iscomplexobj(x)
+
+#-----------------------------------------------------------------------------
+
+def _getmaxmin(t):
+    from numpy.core import getlimits
+    f = getlimits.finfo(t)
+    return f.max, f.min
+
+
+def _nan_to_num_dispatcher(x, copy=None, nan=None, posinf=None, neginf=None):
+    return (x,)
+
+
+@array_function_dispatch(_nan_to_num_dispatcher)
+def nan_to_num(x, copy=True, nan=0.0, posinf=None, neginf=None):
+    """
+    Replace NaN with zero and infinity with large finite numbers (default
+    behaviour) or with the numbers defined by the user using the `nan`, 
+    `posinf` and/or `neginf` keywords.
+
+    If `x` is inexact, NaN is replaced by zero or by the user defined value in
+    `nan` keyword, infinity is replaced by the largest finite floating point 
+    values representable by ``x.dtype`` or by the user defined value in 
+    `posinf` keyword and -infinity is replaced by the most negative finite 
+    floating point values representable by ``x.dtype`` or by the user defined 
+    value in `neginf` keyword.
+
+    For complex dtypes, the above is applied to each of the real and
+    imaginary components of `x` separately.
+
+    If `x` is not inexact, then no replacements are made.
+
+    Parameters
+    ----------
+    x : scalar or array_like
+        Input data.
+    copy : bool, optional
+        Whether to create a copy of `x` (True) or to replace values
+        in-place (False). The in-place operation only occurs if
+        casting to an array does not require a copy.
+        Default is True.
+        
+        .. versionadded:: 1.13
+    nan : int, float, optional
+        Value to be used to fill NaN values. If no value is passed 
+        then NaN values will be replaced with 0.0.
+        
+        .. versionadded:: 1.17
+    posinf : int, float, optional
+        Value to be used to fill positive infinity values. If no value is 
+        passed then positive infinity values will be replaced with a very
+        large number.
+        
+        .. versionadded:: 1.17
+    neginf : int, float, optional
+        Value to be used to fill negative infinity values. If no value is 
+        passed then negative infinity values will be replaced with a very
+        small (or negative) number.
+        
+        .. versionadded:: 1.17
+
+        
+
+    Returns
+    -------
+    out : ndarray
+        `x`, with the non-finite values replaced. If `copy` is False, this may
+        be `x` itself.
+
+    See Also
+    --------
+    isinf : Shows which elements are positive or negative infinity.
+    isneginf : Shows which elements are negative infinity.
+    isposinf : Shows which elements are positive infinity.
+    isnan : Shows which elements are Not a Number (NaN).
+    isfinite : Shows which elements are finite (not NaN, not infinity)
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754). This means that Not a Number is not equivalent to infinity.
+
+    Examples
+    --------
+    >>> np.nan_to_num(np.inf)
+    1.7976931348623157e+308
+    >>> np.nan_to_num(-np.inf)
+    -1.7976931348623157e+308
+    >>> np.nan_to_num(np.nan)
+    0.0
+    >>> x = np.array([np.inf, -np.inf, np.nan, -128, 128])
+    >>> np.nan_to_num(x)
+    array([ 1.79769313e+308, -1.79769313e+308,  0.00000000e+000, # may vary
+           -1.28000000e+002,  1.28000000e+002])
+    >>> np.nan_to_num(x, nan=-9999, posinf=33333333, neginf=33333333)
+    array([ 3.3333333e+07,  3.3333333e+07, -9.9990000e+03, 
+           -1.2800000e+02,  1.2800000e+02])
+    >>> y = np.array([complex(np.inf, np.nan), np.nan, complex(np.nan, np.inf)])
+    array([  1.79769313e+308,  -1.79769313e+308,   0.00000000e+000, # may vary
+         -1.28000000e+002,   1.28000000e+002])
+    >>> np.nan_to_num(y)
+    array([  1.79769313e+308 +0.00000000e+000j, # may vary
+             0.00000000e+000 +0.00000000e+000j,
+             0.00000000e+000 +1.79769313e+308j])
+    >>> np.nan_to_num(y, nan=111111, posinf=222222)
+    array([222222.+111111.j, 111111.     +0.j, 111111.+222222.j])
+    """
+    x = _nx.array(x, subok=True, copy=copy)
+    xtype = x.dtype.type
+
+    isscalar = (x.ndim == 0)
+
+    if not issubclass(xtype, _nx.inexact):
+        return x[()] if isscalar else x
+
+    iscomplex = issubclass(xtype, _nx.complexfloating)
+
+    dest = (x.real, x.imag) if iscomplex else (x,)
+    maxf, minf = _getmaxmin(x.real.dtype)
+    if posinf is not None:
+        maxf = posinf
+    if neginf is not None:
+        minf = neginf
+    for d in dest:
+        idx_nan = isnan(d)
+        idx_posinf = isposinf(d)
+        idx_neginf = isneginf(d)
+        _nx.copyto(d, nan, where=idx_nan)
+        _nx.copyto(d, maxf, where=idx_posinf)
+        _nx.copyto(d, minf, where=idx_neginf)
+    return x[()] if isscalar else x
+
+#-----------------------------------------------------------------------------
+
+def _real_if_close_dispatcher(a, tol=None):
+    return (a,)
+
+
+@array_function_dispatch(_real_if_close_dispatcher)
+def real_if_close(a, tol=100):
+    """
+    If input is complex with all imaginary parts close to zero, return 
+    real parts.
+
+    "Close to zero" is defined as `tol` * (machine epsilon of the type for
+    `a`).
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    tol : float
+        Tolerance in machine epsilons for the complex part of the elements
+        in the array.
+
+    Returns
+    -------
+    out : ndarray
+        If `a` is real, the type of `a` is used for the output.  If `a`
+        has complex elements, the returned type is float.
+
+    See Also
+    --------
+    real, imag, angle
+
+    Notes
+    -----
+    Machine epsilon varies from machine to machine and between data types
+    but Python floats on most platforms have a machine epsilon equal to
+    2.2204460492503131e-16.  You can use 'np.finfo(float).eps' to print
+    out the machine epsilon for floats.
+
+    Examples
+    --------
+    >>> np.finfo(float).eps
+    2.2204460492503131e-16 # may vary
+
+    >>> np.real_if_close([2.1 + 4e-14j, 5.2 + 3e-15j], tol=1000)
+    array([2.1, 5.2])
+    >>> np.real_if_close([2.1 + 4e-13j, 5.2 + 3e-15j], tol=1000)
+    array([2.1+4.e-13j, 5.2 + 3e-15j])
+
+    """
+    a = asanyarray(a)
+    if not issubclass(a.dtype.type, _nx.complexfloating):
+        return a
+    if tol > 1:
+        from numpy.core import getlimits
+        f = getlimits.finfo(a.dtype.type)
+        tol = f.eps * tol
+    if _nx.all(_nx.absolute(a.imag) < tol):
+        a = a.real
+    return a
+
+
+def _asscalar_dispatcher(a):
+    # 2018-10-10, 1.16
+    warnings.warn('np.asscalar(a) is deprecated since NumPy v1.16, use '
+                  'a.item() instead', DeprecationWarning, stacklevel=3)
+    return (a,)
+
+
+@array_function_dispatch(_asscalar_dispatcher)
+def asscalar(a):
+    """
+    Convert an array of size 1 to its scalar equivalent.
+
+    .. deprecated:: 1.16
+
+        Deprecated, use `numpy.ndarray.item()` instead.
+
+    Parameters
+    ----------
+    a : ndarray
+        Input array of size 1.
+
+    Returns
+    -------
+    out : scalar
+        Scalar representation of `a`. The output data type is the same type
+        returned by the input's `item` method.
+
+    Examples
+    --------
+    >>> np.asscalar(np.array([24]))
+    24
+    """
+    return a.item()
+
+#-----------------------------------------------------------------------------
+
+_namefromtype = {'S1': 'character',
+                 '?': 'bool',
+                 'b': 'signed char',
+                 'B': 'unsigned char',
+                 'h': 'short',
+                 'H': 'unsigned short',
+                 'i': 'integer',
+                 'I': 'unsigned integer',
+                 'l': 'long integer',
+                 'L': 'unsigned long integer',
+                 'q': 'long long integer',
+                 'Q': 'unsigned long long integer',
+                 'f': 'single precision',
+                 'd': 'double precision',
+                 'g': 'long precision',
+                 'F': 'complex single precision',
+                 'D': 'complex double precision',
+                 'G': 'complex long double precision',
+                 'S': 'string',
+                 'U': 'unicode',
+                 'V': 'void',
+                 'O': 'object'
+                 }
+
+@set_module('numpy')
+def typename(char):
+    """
+    Return a description for the given data type code.
+
+    Parameters
+    ----------
+    char : str
+        Data type code.
+
+    Returns
+    -------
+    out : str
+        Description of the input data type code.
+
+    See Also
+    --------
+    dtype, typecodes
+
+    Examples
+    --------
+    >>> typechars = ['S1', '?', 'B', 'D', 'G', 'F', 'I', 'H', 'L', 'O', 'Q',
+    ...              'S', 'U', 'V', 'b', 'd', 'g', 'f', 'i', 'h', 'l', 'q']
+    >>> for typechar in typechars:
+    ...     print(typechar, ' : ', np.typename(typechar))
+    ...
+    S1  :  character
+    ?  :  bool
+    B  :  unsigned char
+    D  :  complex double precision
+    G  :  complex long double precision
+    F  :  complex single precision
+    I  :  unsigned integer
+    H  :  unsigned short
+    L  :  unsigned long integer
+    O  :  object
+    Q  :  unsigned long long integer
+    S  :  string
+    U  :  unicode
+    V  :  void
+    b  :  signed char
+    d  :  double precision
+    g  :  long precision
+    f  :  single precision
+    i  :  integer
+    h  :  short
+    l  :  long integer
+    q  :  long long integer
+
+    """
+    return _namefromtype[char]
+
+#-----------------------------------------------------------------------------
+
+#determine the "minimum common type" for a group of arrays.
+array_type = [[_nx.half, _nx.single, _nx.double, _nx.longdouble],
+              [None, _nx.csingle, _nx.cdouble, _nx.clongdouble]]
+array_precision = {_nx.half: 0,
+                   _nx.single: 1,
+                   _nx.double: 2,
+                   _nx.longdouble: 3,
+                   _nx.csingle: 1,
+                   _nx.cdouble: 2,
+                   _nx.clongdouble: 3}
+
+
+def _common_type_dispatcher(*arrays):
+    return arrays
+
+
+@array_function_dispatch(_common_type_dispatcher)
+def common_type(*arrays):
+    """
+    Return a scalar type which is common to the input arrays.
+
+    The return type will always be an inexact (i.e. floating point) scalar
+    type, even if all the arrays are integer arrays. If one of the inputs is
+    an integer array, the minimum precision type that is returned is a
+    64-bit floating point dtype.
+
+    All input arrays except int64 and uint64 can be safely cast to the
+    returned dtype without loss of information.
+
+    Parameters
+    ----------
+    array1, array2, ... : ndarrays
+        Input arrays.
+
+    Returns
+    -------
+    out : data type code
+        Data type code.
+
+    See Also
+    --------
+    dtype, mintypecode
+
+    Examples
+    --------
+    >>> np.common_type(np.arange(2, dtype=np.float32))
+    <class 'numpy.float32'>
+    >>> np.common_type(np.arange(2, dtype=np.float32), np.arange(2))
+    <class 'numpy.float64'>
+    >>> np.common_type(np.arange(4), np.array([45, 6.j]), np.array([45.0]))
+    <class 'numpy.complex128'>
+
+    """
+    is_complex = False
+    precision = 0
+    for a in arrays:
+        t = a.dtype.type
+        if iscomplexobj(a):
+            is_complex = True
+        if issubclass(t, _nx.integer):
+            p = 2  # array_precision[_nx.double]
+        else:
+            p = array_precision.get(t, None)
+            if p is None:
+                raise TypeError("can't get common type for non-numeric array")
+        precision = max(precision, p)
+    if is_complex:
+        return array_type[1][precision]
+    else:
+        return array_type[0][precision]
diff --git a/venv/Lib/site-packages/numpy/lib/ufunclike.py b/venv/Lib/site-packages/numpy/lib/ufunclike.py
new file mode 100644
index 000000000..1f26a1845
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/ufunclike.py
@@ -0,0 +1,266 @@
+"""
+Module of functions that are like ufuncs in acting on arrays and optionally
+storing results in an output array.
+
+"""
+__all__ = ['fix', 'isneginf', 'isposinf']
+
+import numpy.core.numeric as nx
+from numpy.core.overrides import (
+    array_function_dispatch, ARRAY_FUNCTION_ENABLED,
+)
+import warnings
+import functools
+
+
+def _deprecate_out_named_y(f):
+    """
+    Allow the out argument to be passed as the name `y` (deprecated)
+
+    In future, this decorator should be removed.
+    """
+    @functools.wraps(f)
+    def func(x, out=None, **kwargs):
+        if 'y' in kwargs:
+            if 'out' in kwargs:
+                raise TypeError(
+                    "{} got multiple values for argument 'out'/'y'"
+                    .format(f.__name__)
+                )
+            out = kwargs.pop('y')
+            # NumPy 1.13.0, 2017-04-26
+            warnings.warn(
+                "The name of the out argument to {} has changed from `y` to "
+                "`out`, to match other ufuncs.".format(f.__name__),
+                DeprecationWarning, stacklevel=3)
+        return f(x, out=out, **kwargs)
+
+    return func
+
+
+def _fix_out_named_y(f):
+    """
+    Allow the out argument to be passed as the name `y` (deprecated)
+
+    This decorator should only be used if _deprecate_out_named_y is used on
+    a corresponding dispatcher function.
+    """
+    @functools.wraps(f)
+    def func(x, out=None, **kwargs):
+        if 'y' in kwargs:
+            # we already did error checking in _deprecate_out_named_y
+            out = kwargs.pop('y')
+        return f(x, out=out, **kwargs)
+
+    return func
+
+
+def _fix_and_maybe_deprecate_out_named_y(f):
+    """
+    Use the appropriate decorator, depending upon if dispatching is being used.
+    """
+    if ARRAY_FUNCTION_ENABLED:
+        return _fix_out_named_y(f)
+    else:
+        return _deprecate_out_named_y(f)
+
+
+@_deprecate_out_named_y
+def _dispatcher(x, out=None):
+    return (x, out)
+
+
+@array_function_dispatch(_dispatcher, verify=False, module='numpy')
+@_fix_and_maybe_deprecate_out_named_y
+def fix(x, out=None):
+    """
+    Round to nearest integer towards zero.
+
+    Round an array of floats element-wise to nearest integer towards zero.
+    The rounded values are returned as floats.
+
+    Parameters
+    ----------
+    x : array_like
+        An array of floats to be rounded
+    out : ndarray, optional
+        A location into which the result is stored. If provided, it must have
+        a shape that the input broadcasts to. If not provided or None, a
+        freshly-allocated array is returned.
+
+    Returns
+    -------
+    out : ndarray of floats
+        A float array with the same dimensions as the input.
+        If second argument is not supplied then a float array is returned
+        with the rounded values.
+
+        If a second argument is supplied the result is stored there.
+        The return value `out` is then a reference to that array.
+
+    See Also
+    --------
+    trunc, floor, ceil
+    around : Round to given number of decimals
+
+    Examples
+    --------
+    >>> np.fix(3.14)
+    3.0
+    >>> np.fix(3)
+    3.0
+    >>> np.fix([2.1, 2.9, -2.1, -2.9])
+    array([ 2.,  2., -2., -2.])
+
+    """
+    # promote back to an array if flattened
+    res = nx.asanyarray(nx.ceil(x, out=out))
+    res = nx.floor(x, out=res, where=nx.greater_equal(x, 0))
+
+    # when no out argument is passed and no subclasses are involved, flatten
+    # scalars
+    if out is None and type(res) is nx.ndarray:
+        res = res[()]
+    return res
+
+
+@array_function_dispatch(_dispatcher, verify=False, module='numpy')
+@_fix_and_maybe_deprecate_out_named_y
+def isposinf(x, out=None):
+    """
+    Test element-wise for positive infinity, return result as bool array.
+
+    Parameters
+    ----------
+    x : array_like
+        The input array.
+    out : array_like, optional
+        A location into which the result is stored. If provided, it must have a
+        shape that the input broadcasts to. If not provided or None, a
+        freshly-allocated boolean array is returned.
+
+    Returns
+    -------
+    out : ndarray
+        A boolean array with the same dimensions as the input.
+        If second argument is not supplied then a boolean array is returned
+        with values True where the corresponding element of the input is
+        positive infinity and values False where the element of the input is
+        not positive infinity.
+
+        If a second argument is supplied the result is stored there. If the
+        type of that array is a numeric type the result is represented as zeros
+        and ones, if the type is boolean then as False and True.
+        The return value `out` is then a reference to that array.
+
+    See Also
+    --------
+    isinf, isneginf, isfinite, isnan
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754).
+
+    Errors result if the second argument is also supplied when x is a scalar
+    input, if first and second arguments have different shapes, or if the
+    first argument has complex values
+
+    Examples
+    --------
+    >>> np.isposinf(np.PINF)
+    True
+    >>> np.isposinf(np.inf)
+    True
+    >>> np.isposinf(np.NINF)
+    False
+    >>> np.isposinf([-np.inf, 0., np.inf])
+    array([False, False,  True])
+
+    >>> x = np.array([-np.inf, 0., np.inf])
+    >>> y = np.array([2, 2, 2])
+    >>> np.isposinf(x, y)
+    array([0, 0, 1])
+    >>> y
+    array([0, 0, 1])
+
+    """
+    is_inf = nx.isinf(x)
+    try:
+        signbit = ~nx.signbit(x)
+    except TypeError as e:
+        raise TypeError('This operation is not supported for complex values '
+                        'because it would be ambiguous.') from e
+    else:
+        return nx.logical_and(is_inf, signbit, out)
+
+
+@array_function_dispatch(_dispatcher, verify=False, module='numpy')
+@_fix_and_maybe_deprecate_out_named_y
+def isneginf(x, out=None):
+    """
+    Test element-wise for negative infinity, return result as bool array.
+
+    Parameters
+    ----------
+    x : array_like
+        The input array.
+    out : array_like, optional
+        A location into which the result is stored. If provided, it must have a
+        shape that the input broadcasts to. If not provided or None, a
+        freshly-allocated boolean array is returned.
+
+    Returns
+    -------
+    out : ndarray
+        A boolean array with the same dimensions as the input.
+        If second argument is not supplied then a numpy boolean array is
+        returned with values True where the corresponding element of the
+        input is negative infinity and values False where the element of
+        the input is not negative infinity.
+
+        If a second argument is supplied the result is stored there. If the
+        type of that array is a numeric type the result is represented as
+        zeros and ones, if the type is boolean then as False and True. The
+        return value `out` is then a reference to that array.
+
+    See Also
+    --------
+    isinf, isposinf, isnan, isfinite
+
+    Notes
+    -----
+    NumPy uses the IEEE Standard for Binary Floating-Point for Arithmetic
+    (IEEE 754).
+
+    Errors result if the second argument is also supplied when x is a scalar
+    input, if first and second arguments have different shapes, or if the
+    first argument has complex values.
+
+    Examples
+    --------
+    >>> np.isneginf(np.NINF)
+    True
+    >>> np.isneginf(np.inf)
+    False
+    >>> np.isneginf(np.PINF)
+    False
+    >>> np.isneginf([-np.inf, 0., np.inf])
+    array([ True, False, False])
+
+    >>> x = np.array([-np.inf, 0., np.inf])
+    >>> y = np.array([2, 2, 2])
+    >>> np.isneginf(x, y)
+    array([1, 0, 0])
+    >>> y
+    array([1, 0, 0])
+
+    """
+    is_inf = nx.isinf(x)
+    try:
+        signbit = nx.signbit(x)
+    except TypeError as e:
+        raise TypeError('This operation is not supported for complex values '
+                        'because it would be ambiguous.') from e
+    else:
+        return nx.logical_and(is_inf, signbit, out)
diff --git a/venv/Lib/site-packages/numpy/lib/user_array.py b/venv/Lib/site-packages/numpy/lib/user_array.py
new file mode 100644
index 000000000..0e96b477e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/user_array.py
@@ -0,0 +1,286 @@
+"""
+Standard container-class for easy multiple-inheritance.
+
+Try to inherit from the ndarray instead of using this class as this is not
+complete.
+
+"""
+from numpy.core import (
+    array, asarray, absolute, add, subtract, multiply, divide,
+    remainder, power, left_shift, right_shift, bitwise_and, bitwise_or,
+    bitwise_xor, invert, less, less_equal, not_equal, equal, greater,
+    greater_equal, shape, reshape, arange, sin, sqrt, transpose
+)
+
+
+class container:
+    """
+    container(data, dtype=None, copy=True)
+
+    Standard container-class for easy multiple-inheritance.
+
+    Methods
+    -------
+    copy
+    tostring
+    byteswap
+    astype
+
+    """
+    def __init__(self, data, dtype=None, copy=True):
+        self.array = array(data, dtype, copy=copy)
+
+    def __repr__(self):
+        if self.ndim > 0:
+            return self.__class__.__name__ + repr(self.array)[len("array"):]
+        else:
+            return self.__class__.__name__ + "(" + repr(self.array) + ")"
+
+    def __array__(self, t=None):
+        if t:
+            return self.array.astype(t)
+        return self.array
+
+    # Array as sequence
+    def __len__(self):
+        return len(self.array)
+
+    def __getitem__(self, index):
+        return self._rc(self.array[index])
+
+    def __setitem__(self, index, value):
+        self.array[index] = asarray(value, self.dtype)
+
+    def __abs__(self):
+        return self._rc(absolute(self.array))
+
+    def __neg__(self):
+        return self._rc(-self.array)
+
+    def __add__(self, other):
+        return self._rc(self.array + asarray(other))
+
+    __radd__ = __add__
+
+    def __iadd__(self, other):
+        add(self.array, other, self.array)
+        return self
+
+    def __sub__(self, other):
+        return self._rc(self.array - asarray(other))
+
+    def __rsub__(self, other):
+        return self._rc(asarray(other) - self.array)
+
+    def __isub__(self, other):
+        subtract(self.array, other, self.array)
+        return self
+
+    def __mul__(self, other):
+        return self._rc(multiply(self.array, asarray(other)))
+
+    __rmul__ = __mul__
+
+    def __imul__(self, other):
+        multiply(self.array, other, self.array)
+        return self
+
+    def __div__(self, other):
+        return self._rc(divide(self.array, asarray(other)))
+
+    def __rdiv__(self, other):
+        return self._rc(divide(asarray(other), self.array))
+
+    def __idiv__(self, other):
+        divide(self.array, other, self.array)
+        return self
+
+    def __mod__(self, other):
+        return self._rc(remainder(self.array, other))
+
+    def __rmod__(self, other):
+        return self._rc(remainder(other, self.array))
+
+    def __imod__(self, other):
+        remainder(self.array, other, self.array)
+        return self
+
+    def __divmod__(self, other):
+        return (self._rc(divide(self.array, other)),
+                self._rc(remainder(self.array, other)))
+
+    def __rdivmod__(self, other):
+        return (self._rc(divide(other, self.array)),
+                self._rc(remainder(other, self.array)))
+
+    def __pow__(self, other):
+        return self._rc(power(self.array, asarray(other)))
+
+    def __rpow__(self, other):
+        return self._rc(power(asarray(other), self.array))
+
+    def __ipow__(self, other):
+        power(self.array, other, self.array)
+        return self
+
+    def __lshift__(self, other):
+        return self._rc(left_shift(self.array, other))
+
+    def __rshift__(self, other):
+        return self._rc(right_shift(self.array, other))
+
+    def __rlshift__(self, other):
+        return self._rc(left_shift(other, self.array))
+
+    def __rrshift__(self, other):
+        return self._rc(right_shift(other, self.array))
+
+    def __ilshift__(self, other):
+        left_shift(self.array, other, self.array)
+        return self
+
+    def __irshift__(self, other):
+        right_shift(self.array, other, self.array)
+        return self
+
+    def __and__(self, other):
+        return self._rc(bitwise_and(self.array, other))
+
+    def __rand__(self, other):
+        return self._rc(bitwise_and(other, self.array))
+
+    def __iand__(self, other):
+        bitwise_and(self.array, other, self.array)
+        return self
+
+    def __xor__(self, other):
+        return self._rc(bitwise_xor(self.array, other))
+
+    def __rxor__(self, other):
+        return self._rc(bitwise_xor(other, self.array))
+
+    def __ixor__(self, other):
+        bitwise_xor(self.array, other, self.array)
+        return self
+
+    def __or__(self, other):
+        return self._rc(bitwise_or(self.array, other))
+
+    def __ror__(self, other):
+        return self._rc(bitwise_or(other, self.array))
+
+    def __ior__(self, other):
+        bitwise_or(self.array, other, self.array)
+        return self
+
+    def __pos__(self):
+        return self._rc(self.array)
+
+    def __invert__(self):
+        return self._rc(invert(self.array))
+
+    def _scalarfunc(self, func):
+        if self.ndim == 0:
+            return func(self[0])
+        else:
+            raise TypeError(
+                "only rank-0 arrays can be converted to Python scalars.")
+
+    def __complex__(self):
+        return self._scalarfunc(complex)
+
+    def __float__(self):
+        return self._scalarfunc(float)
+
+    def __int__(self):
+        return self._scalarfunc(int)
+
+    def __hex__(self):
+        return self._scalarfunc(hex)
+
+    def __oct__(self):
+        return self._scalarfunc(oct)
+
+    def __lt__(self, other):
+        return self._rc(less(self.array, other))
+
+    def __le__(self, other):
+        return self._rc(less_equal(self.array, other))
+
+    def __eq__(self, other):
+        return self._rc(equal(self.array, other))
+
+    def __ne__(self, other):
+        return self._rc(not_equal(self.array, other))
+
+    def __gt__(self, other):
+        return self._rc(greater(self.array, other))
+
+    def __ge__(self, other):
+        return self._rc(greater_equal(self.array, other))
+
+    def copy(self):
+        ""
+        return self._rc(self.array.copy())
+
+    def tostring(self):
+        ""
+        return self.array.tostring()
+
+    def tobytes(self):
+        ""
+        return self.array.tobytes()
+
+    def byteswap(self):
+        ""
+        return self._rc(self.array.byteswap())
+
+    def astype(self, typecode):
+        ""
+        return self._rc(self.array.astype(typecode))
+
+    def _rc(self, a):
+        if len(shape(a)) == 0:
+            return a
+        else:
+            return self.__class__(a)
+
+    def __array_wrap__(self, *args):
+        return self.__class__(args[0])
+
+    def __setattr__(self, attr, value):
+        if attr == 'array':
+            object.__setattr__(self, attr, value)
+            return
+        try:
+            self.array.__setattr__(attr, value)
+        except AttributeError:
+            object.__setattr__(self, attr, value)
+
+    # Only called after other approaches fail.
+    def __getattr__(self, attr):
+        if (attr == 'array'):
+            return object.__getattribute__(self, attr)
+        return self.array.__getattribute__(attr)
+
+#############################################################
+# Test of class container
+#############################################################
+if __name__ == '__main__':
+    temp = reshape(arange(10000), (100, 100))
+
+    ua = container(temp)
+    # new object created begin test
+    print(dir(ua))
+    print(shape(ua), ua.shape)  # I have changed Numeric.py
+
+    ua_small = ua[:3, :5]
+    print(ua_small)
+    # this did not change ua[0,0], which is not normal behavior
+    ua_small[0, 0] = 10
+    print(ua_small[0, 0], ua[0, 0])
+    print(sin(ua_small) / 3. * 6. + sqrt(ua_small ** 2))
+    print(less(ua_small, 103), type(less(ua_small, 103)))
+    print(type(ua_small * reshape(arange(15), shape(ua_small))))
+    print(reshape(ua_small, (5, 3)))
+    print(transpose(ua_small))
diff --git a/venv/Lib/site-packages/numpy/lib/utils.py b/venv/Lib/site-packages/numpy/lib/utils.py
new file mode 100644
index 000000000..ba8616aa3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/lib/utils.py
@@ -0,0 +1,1048 @@
+import os
+import sys
+import textwrap
+import types
+import re
+import warnings
+
+from numpy.core.numerictypes import issubclass_, issubsctype, issubdtype
+from numpy.core.overrides import set_module
+from numpy.core import ndarray, ufunc, asarray
+import numpy as np
+
+# getargspec and formatargspec were removed in Python 3.6
+from numpy.compat import getargspec, formatargspec
+
+__all__ = [
+    'issubclass_', 'issubsctype', 'issubdtype', 'deprecate',
+    'deprecate_with_doc', 'get_include', 'info', 'source', 'who',
+    'lookfor', 'byte_bounds', 'safe_eval'
+    ]
+
+def get_include():
+    """
+    Return the directory that contains the NumPy \\*.h header files.
+
+    Extension modules that need to compile against NumPy should use this
+    function to locate the appropriate include directory.
+
+    Notes
+    -----
+    When using ``distutils``, for example in ``setup.py``.
+    ::
+
+        import numpy as np
+        ...
+        Extension('extension_name', ...
+                include_dirs=[np.get_include()])
+        ...
+
+    """
+    import numpy
+    if numpy.show_config is None:
+        # running from numpy source directory
+        d = os.path.join(os.path.dirname(numpy.__file__), 'core', 'include')
+    else:
+        # using installed numpy core headers
+        import numpy.core as core
+        d = os.path.join(os.path.dirname(core.__file__), 'include')
+    return d
+
+
+def _set_function_name(func, name):
+    func.__name__ = name
+    return func
+
+
+class _Deprecate:
+    """
+    Decorator class to deprecate old functions.
+
+    Refer to `deprecate` for details.
+
+    See Also
+    --------
+    deprecate
+
+    """
+
+    def __init__(self, old_name=None, new_name=None, message=None):
+        self.old_name = old_name
+        self.new_name = new_name
+        self.message = message
+
+    def __call__(self, func, *args, **kwargs):
+        """
+        Decorator call.  Refer to ``decorate``.
+
+        """
+        old_name = self.old_name
+        new_name = self.new_name
+        message = self.message
+
+        if old_name is None:
+            try:
+                old_name = func.__name__
+            except AttributeError:
+                old_name = func.__name__
+        if new_name is None:
+            depdoc = "`%s` is deprecated!" % old_name
+        else:
+            depdoc = "`%s` is deprecated, use `%s` instead!" % \
+                     (old_name, new_name)
+
+        if message is not None:
+            depdoc += "\n" + message
+
+        def newfunc(*args,**kwds):
+            """`arrayrange` is deprecated, use `arange` instead!"""
+            warnings.warn(depdoc, DeprecationWarning, stacklevel=2)
+            return func(*args, **kwds)
+
+        newfunc = _set_function_name(newfunc, old_name)
+        doc = func.__doc__
+        if doc is None:
+            doc = depdoc
+        else:
+            lines = doc.expandtabs().split('\n')
+            indent = _get_indent(lines[1:])
+            if lines[0].lstrip():
+                # Indent the original first line to let inspect.cleandoc()
+                # dedent the docstring despite the deprecation notice.
+                doc = indent * ' ' + doc
+            else:
+                # Remove the same leading blank lines as cleandoc() would.
+                skip = len(lines[0]) + 1
+                for line in lines[1:]:
+                    if len(line) > indent:
+                        break
+                    skip += len(line) + 1
+                doc = doc[skip:]
+            depdoc = textwrap.indent(depdoc, ' ' * indent)
+            doc = '\n\n'.join([depdoc, doc])
+        newfunc.__doc__ = doc
+        try:
+            d = func.__dict__
+        except AttributeError:
+            pass
+        else:
+            newfunc.__dict__.update(d)
+        return newfunc
+
+
+def _get_indent(lines):
+    """
+    Determines the leading whitespace that could be removed from all the lines.
+    """
+    indent = sys.maxsize
+    for line in lines:
+        content = len(line.lstrip())
+        if content:
+            indent = min(indent, len(line) - content)
+    if indent == sys.maxsize:
+        indent = 0
+    return indent
+
+
+def deprecate(*args, **kwargs):
+    """
+    Issues a DeprecationWarning, adds warning to `old_name`'s
+    docstring, rebinds ``old_name.__name__`` and returns the new
+    function object.
+
+    This function may also be used as a decorator.
+
+    Parameters
+    ----------
+    func : function
+        The function to be deprecated.
+    old_name : str, optional
+        The name of the function to be deprecated. Default is None, in
+        which case the name of `func` is used.
+    new_name : str, optional
+        The new name for the function. Default is None, in which case the
+        deprecation message is that `old_name` is deprecated. If given, the
+        deprecation message is that `old_name` is deprecated and `new_name`
+        should be used instead.
+    message : str, optional
+        Additional explanation of the deprecation.  Displayed in the
+        docstring after the warning.
+
+    Returns
+    -------
+    old_func : function
+        The deprecated function.
+
+    Examples
+    --------
+    Note that ``olduint`` returns a value after printing Deprecation
+    Warning:
+
+    >>> olduint = np.deprecate(np.uint)
+    DeprecationWarning: `uint64` is deprecated! # may vary
+    >>> olduint(6)
+    6
+
+    """
+    # Deprecate may be run as a function or as a decorator
+    # If run as a function, we initialise the decorator class
+    # and execute its __call__ method.
+
+    if args:
+        fn = args[0]
+        args = args[1:]
+
+        return _Deprecate(*args, **kwargs)(fn)
+    else:
+        return _Deprecate(*args, **kwargs)
+
+deprecate_with_doc = lambda msg: _Deprecate(message=msg)
+
+
+#--------------------------------------------
+# Determine if two arrays can share memory
+#--------------------------------------------
+
+def byte_bounds(a):
+    """
+    Returns pointers to the end-points of an array.
+
+    Parameters
+    ----------
+    a : ndarray
+        Input array. It must conform to the Python-side of the array
+        interface.
+
+    Returns
+    -------
+    (low, high) : tuple of 2 integers
+        The first integer is the first byte of the array, the second
+        integer is just past the last byte of the array.  If `a` is not
+        contiguous it will not use every byte between the (`low`, `high`)
+        values.
+
+    Examples
+    --------
+    >>> I = np.eye(2, dtype='f'); I.dtype
+    dtype('float32')
+    >>> low, high = np.byte_bounds(I)
+    >>> high - low == I.size*I.itemsize
+    True
+    >>> I = np.eye(2); I.dtype
+    dtype('float64')
+    >>> low, high = np.byte_bounds(I)
+    >>> high - low == I.size*I.itemsize
+    True
+
+    """
+    ai = a.__array_interface__
+    a_data = ai['data'][0]
+    astrides = ai['strides']
+    ashape = ai['shape']
+    bytes_a = asarray(a).dtype.itemsize
+
+    a_low = a_high = a_data
+    if astrides is None:
+        # contiguous case
+        a_high += a.size * bytes_a
+    else:
+        for shape, stride in zip(ashape, astrides):
+            if stride < 0:
+                a_low += (shape-1)*stride
+            else:
+                a_high += (shape-1)*stride
+        a_high += bytes_a
+    return a_low, a_high
+
+
+#-----------------------------------------------------------------------------
+# Function for output and information on the variables used.
+#-----------------------------------------------------------------------------
+
+
+def who(vardict=None):
+    """
+    Print the NumPy arrays in the given dictionary.
+
+    If there is no dictionary passed in or `vardict` is None then returns
+    NumPy arrays in the globals() dictionary (all NumPy arrays in the
+    namespace).
+
+    Parameters
+    ----------
+    vardict : dict, optional
+        A dictionary possibly containing ndarrays.  Default is globals().
+
+    Returns
+    -------
+    out : None
+        Returns 'None'.
+
+    Notes
+    -----
+    Prints out the name, shape, bytes and type of all of the ndarrays
+    present in `vardict`.
+
+    Examples
+    --------
+    >>> a = np.arange(10)
+    >>> b = np.ones(20)
+    >>> np.who()
+    Name            Shape            Bytes            Type
+    ===========================================================
+    a               10               80               int64
+    b               20               160              float64
+    Upper bound on total bytes  =       240
+
+    >>> d = {'x': np.arange(2.0), 'y': np.arange(3.0), 'txt': 'Some str',
+    ... 'idx':5}
+    >>> np.who(d)
+    Name            Shape            Bytes            Type
+    ===========================================================
+    x               2                16               float64
+    y               3                24               float64
+    Upper bound on total bytes  =       40
+
+    """
+    if vardict is None:
+        frame = sys._getframe().f_back
+        vardict = frame.f_globals
+    sta = []
+    cache = {}
+    for name in vardict.keys():
+        if isinstance(vardict[name], ndarray):
+            var = vardict[name]
+            idv = id(var)
+            if idv in cache.keys():
+                namestr = name + " (%s)" % cache[idv]
+                original = 0
+            else:
+                cache[idv] = name
+                namestr = name
+                original = 1
+            shapestr = " x ".join(map(str, var.shape))
+            bytestr = str(var.nbytes)
+            sta.append([namestr, shapestr, bytestr, var.dtype.name,
+                        original])
+
+    maxname = 0
+    maxshape = 0
+    maxbyte = 0
+    totalbytes = 0
+    for k in range(len(sta)):
+        val = sta[k]
+        if maxname < len(val[0]):
+            maxname = len(val[0])
+        if maxshape < len(val[1]):
+            maxshape = len(val[1])
+        if maxbyte < len(val[2]):
+            maxbyte = len(val[2])
+        if val[4]:
+            totalbytes += int(val[2])
+
+    if len(sta) > 0:
+        sp1 = max(10, maxname)
+        sp2 = max(10, maxshape)
+        sp3 = max(10, maxbyte)
+        prval = "Name %s Shape %s Bytes %s Type" % (sp1*' ', sp2*' ', sp3*' ')
+        print(prval + "\n" + "="*(len(prval)+5) + "\n")
+
+    for k in range(len(sta)):
+        val = sta[k]
+        print("%s %s %s %s %s %s %s" % (val[0], ' '*(sp1-len(val[0])+4),
+                                        val[1], ' '*(sp2-len(val[1])+5),
+                                        val[2], ' '*(sp3-len(val[2])+5),
+                                        val[3]))
+    print("\nUpper bound on total bytes  =       %d" % totalbytes)
+    return
+
+#-----------------------------------------------------------------------------
+
+
+# NOTE:  pydoc defines a help function which works similarly to this
+#  except it uses a pager to take over the screen.
+
+# combine name and arguments and split to multiple lines of width
+# characters.  End lines on a comma and begin argument list indented with
+# the rest of the arguments.
+def _split_line(name, arguments, width):
+    firstwidth = len(name)
+    k = firstwidth
+    newstr = name
+    sepstr = ", "
+    arglist = arguments.split(sepstr)
+    for argument in arglist:
+        if k == firstwidth:
+            addstr = ""
+        else:
+            addstr = sepstr
+        k = k + len(argument) + len(addstr)
+        if k > width:
+            k = firstwidth + 1 + len(argument)
+            newstr = newstr + ",\n" + " "*(firstwidth+2) + argument
+        else:
+            newstr = newstr + addstr + argument
+    return newstr
+
+_namedict = None
+_dictlist = None
+
+# Traverse all module directories underneath globals
+# to see if something is defined
+def _makenamedict(module='numpy'):
+    module = __import__(module, globals(), locals(), [])
+    thedict = {module.__name__:module.__dict__}
+    dictlist = [module.__name__]
+    totraverse = [module.__dict__]
+    while True:
+        if len(totraverse) == 0:
+            break
+        thisdict = totraverse.pop(0)
+        for x in thisdict.keys():
+            if isinstance(thisdict[x], types.ModuleType):
+                modname = thisdict[x].__name__
+                if modname not in dictlist:
+                    moddict = thisdict[x].__dict__
+                    dictlist.append(modname)
+                    totraverse.append(moddict)
+                    thedict[modname] = moddict
+    return thedict, dictlist
+
+
+def _info(obj, output=sys.stdout):
+    """Provide information about ndarray obj.
+
+    Parameters
+    ----------
+    obj : ndarray
+        Must be ndarray, not checked.
+    output
+        Where printed output goes.
+
+    Notes
+    -----
+    Copied over from the numarray module prior to its removal.
+    Adapted somewhat as only numpy is an option now.
+
+    Called by info.
+
+    """
+    extra = ""
+    tic = ""
+    bp = lambda x: x
+    cls = getattr(obj, '__class__', type(obj))
+    nm = getattr(cls, '__name__', cls)
+    strides = obj.strides
+    endian = obj.dtype.byteorder
+
+    print("class: ", nm, file=output)
+    print("shape: ", obj.shape, file=output)
+    print("strides: ", strides, file=output)
+    print("itemsize: ", obj.itemsize, file=output)
+    print("aligned: ", bp(obj.flags.aligned), file=output)
+    print("contiguous: ", bp(obj.flags.contiguous), file=output)
+    print("fortran: ", obj.flags.fortran, file=output)
+    print(
+        "data pointer: %s%s" % (hex(obj.ctypes._as_parameter_.value), extra),
+        file=output
+        )
+    print("byteorder: ", end=' ', file=output)
+    if endian in ['|', '=']:
+        print("%s%s%s" % (tic, sys.byteorder, tic), file=output)
+        byteswap = False
+    elif endian == '>':
+        print("%sbig%s" % (tic, tic), file=output)
+        byteswap = sys.byteorder != "big"
+    else:
+        print("%slittle%s" % (tic, tic), file=output)
+        byteswap = sys.byteorder != "little"
+    print("byteswap: ", bp(byteswap), file=output)
+    print("type: %s" % obj.dtype, file=output)
+
+
+@set_module('numpy')
+def info(object=None, maxwidth=76, output=sys.stdout, toplevel='numpy'):
+    """
+    Get help information for a function, class, or module.
+
+    Parameters
+    ----------
+    object : object or str, optional
+        Input object or name to get information about. If `object` is a
+        numpy object, its docstring is given. If it is a string, available
+        modules are searched for matching objects.  If None, information
+        about `info` itself is returned.
+    maxwidth : int, optional
+        Printing width.
+    output : file like object, optional
+        File like object that the output is written to, default is
+        ``stdout``.  The object has to be opened in 'w' or 'a' mode.
+    toplevel : str, optional
+        Start search at this level.
+
+    See Also
+    --------
+    source, lookfor
+
+    Notes
+    -----
+    When used interactively with an object, ``np.info(obj)`` is equivalent
+    to ``help(obj)`` on the Python prompt or ``obj?`` on the IPython
+    prompt.
+
+    Examples
+    --------
+    >>> np.info(np.polyval) # doctest: +SKIP
+       polyval(p, x)
+         Evaluate the polynomial p at x.
+         ...
+
+    When using a string for `object` it is possible to get multiple results.
+
+    >>> np.info('fft') # doctest: +SKIP
+         *** Found in numpy ***
+    Core FFT routines
+    ...
+         *** Found in numpy.fft ***
+     fft(a, n=None, axis=-1)
+    ...
+         *** Repeat reference found in numpy.fft.fftpack ***
+         *** Total of 3 references found. ***
+
+    """
+    global _namedict, _dictlist
+    # Local import to speed up numpy's import time.
+    import pydoc
+    import inspect
+
+    if (hasattr(object, '_ppimport_importer') or
+           hasattr(object, '_ppimport_module')):
+        object = object._ppimport_module
+    elif hasattr(object, '_ppimport_attr'):
+        object = object._ppimport_attr
+
+    if object is None:
+        info(info)
+    elif isinstance(object, ndarray):
+        _info(object, output=output)
+    elif isinstance(object, str):
+        if _namedict is None:
+            _namedict, _dictlist = _makenamedict(toplevel)
+        numfound = 0
+        objlist = []
+        for namestr in _dictlist:
+            try:
+                obj = _namedict[namestr][object]
+                if id(obj) in objlist:
+                    print("\n     "
+                          "*** Repeat reference found in %s *** " % namestr,
+                          file=output
+                          )
+                else:
+                    objlist.append(id(obj))
+                    print("     *** Found in %s ***" % namestr, file=output)
+                    info(obj)
+                    print("-"*maxwidth, file=output)
+                numfound += 1
+            except KeyError:
+                pass
+        if numfound == 0:
+            print("Help for %s not found." % object, file=output)
+        else:
+            print("\n     "
+                  "*** Total of %d references found. ***" % numfound,
+                  file=output
+                  )
+
+    elif inspect.isfunction(object):
+        name = object.__name__
+        arguments = formatargspec(*getargspec(object))
+
+        if len(name+arguments) > maxwidth:
+            argstr = _split_line(name, arguments, maxwidth)
+        else:
+            argstr = name + arguments
+
+        print(" " + argstr + "\n", file=output)
+        print(inspect.getdoc(object), file=output)
+
+    elif inspect.isclass(object):
+        name = object.__name__
+        arguments = "()"
+        try:
+            if hasattr(object, '__init__'):
+                arguments = formatargspec(
+                        *getargspec(object.__init__.__func__)
+                        )
+                arglist = arguments.split(', ')
+                if len(arglist) > 1:
+                    arglist[1] = "("+arglist[1]
+                    arguments = ", ".join(arglist[1:])
+        except Exception:
+            pass
+
+        if len(name+arguments) > maxwidth:
+            argstr = _split_line(name, arguments, maxwidth)
+        else:
+            argstr = name + arguments
+
+        print(" " + argstr + "\n", file=output)
+        doc1 = inspect.getdoc(object)
+        if doc1 is None:
+            if hasattr(object, '__init__'):
+                print(inspect.getdoc(object.__init__), file=output)
+        else:
+            print(inspect.getdoc(object), file=output)
+
+        methods = pydoc.allmethods(object)
+        if methods != []:
+            print("\n\nMethods:\n", file=output)
+            for meth in methods:
+                if meth[0] == '_':
+                    continue
+                thisobj = getattr(object, meth, None)
+                if thisobj is not None:
+                    methstr, other = pydoc.splitdoc(
+                            inspect.getdoc(thisobj) or "None"
+                            )
+                print("  %s  --  %s" % (meth, methstr), file=output)
+
+    elif inspect.ismethod(object):
+        name = object.__name__
+        arguments = formatargspec(
+                *getargspec(object.__func__)
+                )
+        arglist = arguments.split(', ')
+        if len(arglist) > 1:
+            arglist[1] = "("+arglist[1]
+            arguments = ", ".join(arglist[1:])
+        else:
+            arguments = "()"
+
+        if len(name+arguments) > maxwidth:
+            argstr = _split_line(name, arguments, maxwidth)
+        else:
+            argstr = name + arguments
+
+        print(" " + argstr + "\n", file=output)
+        print(inspect.getdoc(object), file=output)
+
+    elif hasattr(object, '__doc__'):
+        print(inspect.getdoc(object), file=output)
+
+
+@set_module('numpy')
+def source(object, output=sys.stdout):
+    """
+    Print or write to a file the source code for a NumPy object.
+
+    The source code is only returned for objects written in Python. Many
+    functions and classes are defined in C and will therefore not return
+    useful information.
+
+    Parameters
+    ----------
+    object : numpy object
+        Input object. This can be any object (function, class, module,
+        ...).
+    output : file object, optional
+        If `output` not supplied then source code is printed to screen
+        (sys.stdout).  File object must be created with either write 'w' or
+        append 'a' modes.
+
+    See Also
+    --------
+    lookfor, info
+
+    Examples
+    --------
+    >>> np.source(np.interp)                        #doctest: +SKIP
+    In file: /usr/lib/python2.6/dist-packages/numpy/lib/function_base.py
+    def interp(x, xp, fp, left=None, right=None):
+        \"\"\".... (full docstring printed)\"\"\"
+        if isinstance(x, (float, int, number)):
+            return compiled_interp([x], xp, fp, left, right).item()
+        else:
+            return compiled_interp(x, xp, fp, left, right)
+
+    The source code is only returned for objects written in Python.
+
+    >>> np.source(np.array)                         #doctest: +SKIP
+    Not available for this object.
+
+    """
+    # Local import to speed up numpy's import time.
+    import inspect
+    try:
+        print("In file: %s\n" % inspect.getsourcefile(object), file=output)
+        print(inspect.getsource(object), file=output)
+    except Exception:
+        print("Not available for this object.", file=output)
+
+
+# Cache for lookfor: {id(module): {name: (docstring, kind, index), ...}...}
+# where kind: "func", "class", "module", "object"
+# and index: index in breadth-first namespace traversal
+_lookfor_caches = {}
+
+# regexp whose match indicates that the string may contain a function
+# signature
+_function_signature_re = re.compile(r"[a-z0-9_]+\(.*[,=].*\)", re.I)
+
+
+@set_module('numpy')
+def lookfor(what, module=None, import_modules=True, regenerate=False,
+            output=None):
+    """
+    Do a keyword search on docstrings.
+
+    A list of objects that matched the search is displayed,
+    sorted by relevance. All given keywords need to be found in the
+    docstring for it to be returned as a result, but the order does
+    not matter.
+
+    Parameters
+    ----------
+    what : str
+        String containing words to look for.
+    module : str or list, optional
+        Name of module(s) whose docstrings to go through.
+    import_modules : bool, optional
+        Whether to import sub-modules in packages. Default is True.
+    regenerate : bool, optional
+        Whether to re-generate the docstring cache. Default is False.
+    output : file-like, optional
+        File-like object to write the output to. If omitted, use a pager.
+
+    See Also
+    --------
+    source, info
+
+    Notes
+    -----
+    Relevance is determined only roughly, by checking if the keywords occur
+    in the function name, at the start of a docstring, etc.
+
+    Examples
+    --------
+    >>> np.lookfor('binary representation') # doctest: +SKIP
+    Search results for 'binary representation'
+    ------------------------------------------
+    numpy.binary_repr
+        Return the binary representation of the input number as a string.
+    numpy.core.setup_common.long_double_representation
+        Given a binary dump as given by GNU od -b, look for long double
+    numpy.base_repr
+        Return a string representation of a number in the given base system.
+    ...
+
+    """
+    import pydoc
+
+    # Cache
+    cache = _lookfor_generate_cache(module, import_modules, regenerate)
+
+    # Search
+    # XXX: maybe using a real stemming search engine would be better?
+    found = []
+    whats = str(what).lower().split()
+    if not whats:
+        return
+
+    for name, (docstring, kind, index) in cache.items():
+        if kind in ('module', 'object'):
+            # don't show modules or objects
+            continue
+        doc = docstring.lower()
+        if all(w in doc for w in whats):
+            found.append(name)
+
+    # Relevance sort
+    # XXX: this is full Harrison-Stetson heuristics now,
+    # XXX: it probably could be improved
+
+    kind_relevance = {'func': 1000, 'class': 1000,
+                      'module': -1000, 'object': -1000}
+
+    def relevance(name, docstr, kind, index):
+        r = 0
+        # do the keywords occur within the start of the docstring?
+        first_doc = "\n".join(docstr.lower().strip().split("\n")[:3])
+        r += sum([200 for w in whats if w in first_doc])
+        # do the keywords occur in the function name?
+        r += sum([30 for w in whats if w in name])
+        # is the full name long?
+        r += -len(name) * 5
+        # is the object of bad type?
+        r += kind_relevance.get(kind, -1000)
+        # is the object deep in namespace hierarchy?
+        r += -name.count('.') * 10
+        r += max(-index / 100, -100)
+        return r
+
+    def relevance_value(a):
+        return relevance(a, *cache[a])
+    found.sort(key=relevance_value)
+
+    # Pretty-print
+    s = "Search results for '%s'" % (' '.join(whats))
+    help_text = [s, "-"*len(s)]
+    for name in found[::-1]:
+        doc, kind, ix = cache[name]
+
+        doclines = [line.strip() for line in doc.strip().split("\n")
+                    if line.strip()]
+
+        # find a suitable short description
+        try:
+            first_doc = doclines[0].strip()
+            if _function_signature_re.search(first_doc):
+                first_doc = doclines[1].strip()
+        except IndexError:
+            first_doc = ""
+        help_text.append("%s\n    %s" % (name, first_doc))
+
+    if not found:
+        help_text.append("Nothing found.")
+
+    # Output
+    if output is not None:
+        output.write("\n".join(help_text))
+    elif len(help_text) > 10:
+        pager = pydoc.getpager()
+        pager("\n".join(help_text))
+    else:
+        print("\n".join(help_text))
+
+def _lookfor_generate_cache(module, import_modules, regenerate):
+    """
+    Generate docstring cache for given module.
+
+    Parameters
+    ----------
+    module : str, None, module
+        Module for which to generate docstring cache
+    import_modules : bool
+        Whether to import sub-modules in packages.
+    regenerate : bool
+        Re-generate the docstring cache
+
+    Returns
+    -------
+    cache : dict {obj_full_name: (docstring, kind, index), ...}
+        Docstring cache for the module, either cached one (regenerate=False)
+        or newly generated.
+
+    """
+    # Local import to speed up numpy's import time.
+    import inspect
+
+    from io import StringIO
+
+    if module is None:
+        module = "numpy"
+
+    if isinstance(module, str):
+        try:
+            __import__(module)
+        except ImportError:
+            return {}
+        module = sys.modules[module]
+    elif isinstance(module, list) or isinstance(module, tuple):
+        cache = {}
+        for mod in module:
+            cache.update(_lookfor_generate_cache(mod, import_modules,
+                                                 regenerate))
+        return cache
+
+    if id(module) in _lookfor_caches and not regenerate:
+        return _lookfor_caches[id(module)]
+
+    # walk items and collect docstrings
+    cache = {}
+    _lookfor_caches[id(module)] = cache
+    seen = {}
+    index = 0
+    stack = [(module.__name__, module)]
+    while stack:
+        name, item = stack.pop(0)
+        if id(item) in seen:
+            continue
+        seen[id(item)] = True
+
+        index += 1
+        kind = "object"
+
+        if inspect.ismodule(item):
+            kind = "module"
+            try:
+                _all = item.__all__
+            except AttributeError:
+                _all = None
+
+            # import sub-packages
+            if import_modules and hasattr(item, '__path__'):
+                for pth in item.__path__:
+                    for mod_path in os.listdir(pth):
+                        this_py = os.path.join(pth, mod_path)
+                        init_py = os.path.join(pth, mod_path, '__init__.py')
+                        if (os.path.isfile(this_py) and
+                                mod_path.endswith('.py')):
+                            to_import = mod_path[:-3]
+                        elif os.path.isfile(init_py):
+                            to_import = mod_path
+                        else:
+                            continue
+                        if to_import == '__init__':
+                            continue
+
+                        try:
+                            old_stdout = sys.stdout
+                            old_stderr = sys.stderr
+                            try:
+                                sys.stdout = StringIO()
+                                sys.stderr = StringIO()
+                                __import__("%s.%s" % (name, to_import))
+                            finally:
+                                sys.stdout = old_stdout
+                                sys.stderr = old_stderr
+                        # Catch SystemExit, too
+                        except BaseException:
+                            continue
+
+            for n, v in _getmembers(item):
+                try:
+                    item_name = getattr(v, '__name__', "%s.%s" % (name, n))
+                    mod_name = getattr(v, '__module__', None)
+                except NameError:
+                    # ref. SWIG's global cvars
+                    #    NameError: Unknown C global variable
+                    item_name = "%s.%s" % (name, n)
+                    mod_name = None
+                if '.' not in item_name and mod_name:
+                    item_name = "%s.%s" % (mod_name, item_name)
+
+                if not item_name.startswith(name + '.'):
+                    # don't crawl "foreign" objects
+                    if isinstance(v, ufunc):
+                        # ... unless they are ufuncs
+                        pass
+                    else:
+                        continue
+                elif not (inspect.ismodule(v) or _all is None or n in _all):
+                    continue
+                stack.append(("%s.%s" % (name, n), v))
+        elif inspect.isclass(item):
+            kind = "class"
+            for n, v in _getmembers(item):
+                stack.append(("%s.%s" % (name, n), v))
+        elif hasattr(item, "__call__"):
+            kind = "func"
+
+        try:
+            doc = inspect.getdoc(item)
+        except NameError:
+            # ref SWIG's NameError: Unknown C global variable
+            doc = None
+        if doc is not None:
+            cache[name] = (doc, kind, index)
+
+    return cache
+
+def _getmembers(item):
+    import inspect
+    try:
+        members = inspect.getmembers(item)
+    except Exception:
+        members = [(x, getattr(item, x)) for x in dir(item)
+                   if hasattr(item, x)]
+    return members
+
+
+def safe_eval(source):
+    """
+    Protected string evaluation.
+
+    Evaluate a string containing a Python literal expression without
+    allowing the execution of arbitrary non-literal code.
+
+    Parameters
+    ----------
+    source : str
+        The string to evaluate.
+
+    Returns
+    -------
+    obj : object
+       The result of evaluating `source`.
+
+    Raises
+    ------
+    SyntaxError
+        If the code has invalid Python syntax, or if it contains
+        non-literal code.
+
+    Examples
+    --------
+    >>> np.safe_eval('1')
+    1
+    >>> np.safe_eval('[1, 2, 3]')
+    [1, 2, 3]
+    >>> np.safe_eval('{"foo": ("bar", 10.0)}')
+    {'foo': ('bar', 10.0)}
+
+    >>> np.safe_eval('import os')
+    Traceback (most recent call last):
+      ...
+    SyntaxError: invalid syntax
+
+    >>> np.safe_eval('open("/home/user/.ssh/id_dsa").read()')
+    Traceback (most recent call last):
+      ...
+    ValueError: malformed node or string: <_ast.Call object at 0x...>
+
+    """
+    # Local import to speed up numpy's import time.
+    import ast
+    return ast.literal_eval(source)
+
+
+def _median_nancheck(data, result, axis, out):
+    """
+    Utility function to check median result from data for NaN values at the end
+    and return NaN in that case. Input result can also be a MaskedArray.
+
+    Parameters
+    ----------
+    data : array
+        Input data to median function
+    result : Array or MaskedArray
+        Result of median function
+    axis : {int, sequence of int, None}, optional
+        Axis or axes along which the median was computed.
+    out : ndarray, optional
+        Output array in which to place the result.
+    Returns
+    -------
+    median : scalar or ndarray
+        Median or NaN in axes which contained NaN in the input.
+    """
+    if data.size == 0:
+        return result
+    data = np.moveaxis(data, axis, -1)
+    n = np.isnan(data[..., -1])
+    # masked NaN values are ok
+    if np.ma.isMaskedArray(n):
+        n = n.filled(False)
+    if result.ndim == 0:
+        if n == True:
+            if out is not None:
+                out[...] = data.dtype.type(np.nan)
+                result = out
+            else:
+                result = data.dtype.type(np.nan)
+    elif np.count_nonzero(n.ravel()) > 0:
+        result[n] = np.nan
+    return result
+
+#-----------------------------------------------------------------------------
diff --git a/venv/Lib/site-packages/numpy/linalg/__init__.py b/venv/Lib/site-packages/numpy/linalg/__init__.py
new file mode 100644
index 000000000..3a53ac6ec
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/__init__.py
@@ -0,0 +1,77 @@
+"""
+``numpy.linalg``
+================
+
+The NumPy linear algebra functions rely on BLAS and LAPACK to provide efficient
+low level implementations of standard linear algebra algorithms. Those
+libraries may be provided by NumPy itself using C versions of a subset of their
+reference implementations but, when possible, highly optimized libraries that
+take advantage of specialized processor functionality are preferred. Examples
+of such libraries are OpenBLAS, MKL (TM), and ATLAS. Because those libraries
+are multithreaded and processor dependent, environmental variables and external
+packages such as threadpoolctl may be needed to control the number of threads
+or specify the processor architecture.
+
+- OpenBLAS: https://www.openblas.net/
+- threadpoolctl: https://github.com/joblib/threadpoolctl
+
+Please note that the most-used linear algebra functions in NumPy are present in
+the main ``numpy`` namespace rather than in ``numpy.linalg``.  There are:
+``dot``, ``vdot``, ``inner``, ``outer``, ``matmul``, ``tensordot``, ``einsum``,
+``einsum_path`` and ``kron``.
+
+Functions present in numpy.linalg are listed below.
+
+
+Matrix and vector products
+--------------------------
+
+   multi_dot
+   matrix_power
+
+Decompositions
+--------------
+
+   cholesky
+   qr
+   svd
+
+Matrix eigenvalues
+------------------
+
+   eig
+   eigh
+   eigvals
+   eigvalsh
+
+Norms and other numbers
+-----------------------
+
+   norm
+   cond
+   det
+   matrix_rank
+   slogdet
+
+Solving equations and inverting matrices
+----------------------------------------
+
+   solve
+   tensorsolve
+   lstsq
+   inv
+   pinv
+   tensorinv
+
+Exceptions
+----------
+
+   LinAlgError
+
+"""
+# To get sub-modules
+from .linalg import *
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/linalg/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..09bf52375
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/__pycache__/linalg.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/__pycache__/linalg.cpython-36.pyc
new file mode 100644
index 000000000..b9460748f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/__pycache__/linalg.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..a4c6cc980
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/_umath_linalg.cp36-win32.pyd b/venv/Lib/site-packages/numpy/linalg/_umath_linalg.cp36-win32.pyd
new file mode 100644
index 000000000..4d15576e3
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/_umath_linalg.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/linalg/lapack_lite.cp36-win32.pyd b/venv/Lib/site-packages/numpy/linalg/lapack_lite.cp36-win32.pyd
new file mode 100644
index 000000000..697b00d5b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/lapack_lite.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/linalg/linalg.py b/venv/Lib/site-packages/numpy/linalg/linalg.py
new file mode 100644
index 000000000..5ee326f3c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/linalg.py
@@ -0,0 +1,2814 @@
+"""Lite version of scipy.linalg.
+
+Notes
+-----
+This module is a lite version of the linalg.py module in SciPy which
+contains high-level Python interface to the LAPACK library.  The lite
+version only accesses the following LAPACK functions: dgesv, zgesv,
+dgeev, zgeev, dgesdd, zgesdd, dgelsd, zgelsd, dsyevd, zheevd, dgetrf,
+zgetrf, dpotrf, zpotrf, dgeqrf, zgeqrf, zungqr, dorgqr.
+"""
+
+__all__ = ['matrix_power', 'solve', 'tensorsolve', 'tensorinv', 'inv',
+           'cholesky', 'eigvals', 'eigvalsh', 'pinv', 'slogdet', 'det',
+           'svd', 'eig', 'eigh', 'lstsq', 'norm', 'qr', 'cond', 'matrix_rank',
+           'LinAlgError', 'multi_dot']
+
+import functools
+import operator
+import warnings
+
+from numpy.core import (
+    array, asarray, zeros, empty, empty_like, intc, single, double,
+    csingle, cdouble, inexact, complexfloating, newaxis, all, Inf, dot,
+    add, multiply, sqrt, fastCopyAndTranspose, sum, isfinite,
+    finfo, errstate, geterrobj, moveaxis, amin, amax, product, abs,
+    atleast_2d, intp, asanyarray, object_, matmul,
+    swapaxes, divide, count_nonzero, isnan, sign, argsort, sort
+)
+from numpy.core.multiarray import normalize_axis_index
+from numpy.core.overrides import set_module
+from numpy.core import overrides
+from numpy.lib.twodim_base import triu, eye
+from numpy.linalg import lapack_lite, _umath_linalg
+
+
+array_function_dispatch = functools.partial(
+    overrides.array_function_dispatch, module='numpy.linalg')
+
+
+fortran_int = intc
+
+
+@set_module('numpy.linalg')
+class LinAlgError(Exception):
+    """
+    Generic Python-exception-derived object raised by linalg functions.
+
+    General purpose exception class, derived from Python's exception.Exception
+    class, programmatically raised in linalg functions when a Linear
+    Algebra-related condition would prevent further correct execution of the
+    function.
+
+    Parameters
+    ----------
+    None
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+    >>> LA.inv(np.zeros((2,2)))
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+      File "...linalg.py", line 350,
+        in inv return wrap(solve(a, identity(a.shape[0], dtype=a.dtype)))
+      File "...linalg.py", line 249,
+        in solve
+        raise LinAlgError('Singular matrix')
+    numpy.linalg.LinAlgError: Singular matrix
+
+    """
+
+
+def _determine_error_states():
+    errobj = geterrobj()
+    bufsize = errobj[0]
+
+    with errstate(invalid='call', over='ignore',
+                  divide='ignore', under='ignore'):
+        invalid_call_errmask = geterrobj()[1]
+
+    return [bufsize, invalid_call_errmask, None]
+
+# Dealing with errors in _umath_linalg
+_linalg_error_extobj = _determine_error_states()
+del _determine_error_states
+
+def _raise_linalgerror_singular(err, flag):
+    raise LinAlgError("Singular matrix")
+
+def _raise_linalgerror_nonposdef(err, flag):
+    raise LinAlgError("Matrix is not positive definite")
+
+def _raise_linalgerror_eigenvalues_nonconvergence(err, flag):
+    raise LinAlgError("Eigenvalues did not converge")
+
+def _raise_linalgerror_svd_nonconvergence(err, flag):
+    raise LinAlgError("SVD did not converge")
+
+def _raise_linalgerror_lstsq(err, flag):
+    raise LinAlgError("SVD did not converge in Linear Least Squares")
+
+def get_linalg_error_extobj(callback):
+    extobj = list(_linalg_error_extobj)  # make a copy
+    extobj[2] = callback
+    return extobj
+
+def _makearray(a):
+    new = asarray(a)
+    wrap = getattr(a, "__array_prepare__", new.__array_wrap__)
+    return new, wrap
+
+def isComplexType(t):
+    return issubclass(t, complexfloating)
+
+_real_types_map = {single : single,
+                   double : double,
+                   csingle : single,
+                   cdouble : double}
+
+_complex_types_map = {single : csingle,
+                      double : cdouble,
+                      csingle : csingle,
+                      cdouble : cdouble}
+
+def _realType(t, default=double):
+    return _real_types_map.get(t, default)
+
+def _complexType(t, default=cdouble):
+    return _complex_types_map.get(t, default)
+
+def _linalgRealType(t):
+    """Cast the type t to either double or cdouble."""
+    return double
+
+def _commonType(*arrays):
+    # in lite version, use higher precision (always double or cdouble)
+    result_type = single
+    is_complex = False
+    for a in arrays:
+        if issubclass(a.dtype.type, inexact):
+            if isComplexType(a.dtype.type):
+                is_complex = True
+            rt = _realType(a.dtype.type, default=None)
+            if rt is None:
+                # unsupported inexact scalar
+                raise TypeError("array type %s is unsupported in linalg" %
+                        (a.dtype.name,))
+        else:
+            rt = double
+        if rt is double:
+            result_type = double
+    if is_complex:
+        t = cdouble
+        result_type = _complex_types_map[result_type]
+    else:
+        t = double
+    return t, result_type
+
+
+# _fastCopyAndTranpose assumes the input is 2D (as all the calls in here are).
+
+_fastCT = fastCopyAndTranspose
+
+def _to_native_byte_order(*arrays):
+    ret = []
+    for arr in arrays:
+        if arr.dtype.byteorder not in ('=', '|'):
+            ret.append(asarray(arr, dtype=arr.dtype.newbyteorder('=')))
+        else:
+            ret.append(arr)
+    if len(ret) == 1:
+        return ret[0]
+    else:
+        return ret
+
+def _fastCopyAndTranspose(type, *arrays):
+    cast_arrays = ()
+    for a in arrays:
+        if a.dtype.type is type:
+            cast_arrays = cast_arrays + (_fastCT(a),)
+        else:
+            cast_arrays = cast_arrays + (_fastCT(a.astype(type)),)
+    if len(cast_arrays) == 1:
+        return cast_arrays[0]
+    else:
+        return cast_arrays
+
+def _assert_2d(*arrays):
+    for a in arrays:
+        if a.ndim != 2:
+            raise LinAlgError('%d-dimensional array given. Array must be '
+                    'two-dimensional' % a.ndim)
+
+def _assert_stacked_2d(*arrays):
+    for a in arrays:
+        if a.ndim < 2:
+            raise LinAlgError('%d-dimensional array given. Array must be '
+                    'at least two-dimensional' % a.ndim)
+
+def _assert_stacked_square(*arrays):
+    for a in arrays:
+        m, n = a.shape[-2:]
+        if m != n:
+            raise LinAlgError('Last 2 dimensions of the array must be square')
+
+def _assert_finite(*arrays):
+    for a in arrays:
+        if not isfinite(a).all():
+            raise LinAlgError("Array must not contain infs or NaNs")
+
+def _is_empty_2d(arr):
+    # check size first for efficiency
+    return arr.size == 0 and product(arr.shape[-2:]) == 0
+
+
+def transpose(a):
+    """
+    Transpose each matrix in a stack of matrices.
+
+    Unlike np.transpose, this only swaps the last two axes, rather than all of
+    them
+
+    Parameters
+    ----------
+    a : (...,M,N) array_like
+
+    Returns
+    -------
+    aT : (...,N,M) ndarray
+    """
+    return swapaxes(a, -1, -2)
+
+# Linear equations
+
+def _tensorsolve_dispatcher(a, b, axes=None):
+    return (a, b)
+
+
+@array_function_dispatch(_tensorsolve_dispatcher)
+def tensorsolve(a, b, axes=None):
+    """
+    Solve the tensor equation ``a x = b`` for x.
+
+    It is assumed that all indices of `x` are summed over in the product,
+    together with the rightmost indices of `a`, as is done in, for example,
+    ``tensordot(a, x, axes=b.ndim)``.
+
+    Parameters
+    ----------
+    a : array_like
+        Coefficient tensor, of shape ``b.shape + Q``. `Q`, a tuple, equals
+        the shape of that sub-tensor of `a` consisting of the appropriate
+        number of its rightmost indices, and must be such that
+        ``prod(Q) == prod(b.shape)`` (in which sense `a` is said to be
+        'square').
+    b : array_like
+        Right-hand tensor, which can be of any shape.
+    axes : tuple of ints, optional
+        Axes in `a` to reorder to the right, before inversion.
+        If None (default), no reordering is done.
+
+    Returns
+    -------
+    x : ndarray, shape Q
+
+    Raises
+    ------
+    LinAlgError
+        If `a` is singular or not 'square' (in the above sense).
+
+    See Also
+    --------
+    numpy.tensordot, tensorinv, numpy.einsum
+
+    Examples
+    --------
+    >>> a = np.eye(2*3*4)
+    >>> a.shape = (2*3, 4, 2, 3, 4)
+    >>> b = np.random.randn(2*3, 4)
+    >>> x = np.linalg.tensorsolve(a, b)
+    >>> x.shape
+    (2, 3, 4)
+    >>> np.allclose(np.tensordot(a, x, axes=3), b)
+    True
+
+    """
+    a, wrap = _makearray(a)
+    b = asarray(b)
+    an = a.ndim
+
+    if axes is not None:
+        allaxes = list(range(0, an))
+        for k in axes:
+            allaxes.remove(k)
+            allaxes.insert(an, k)
+        a = a.transpose(allaxes)
+
+    oldshape = a.shape[-(an-b.ndim):]
+    prod = 1
+    for k in oldshape:
+        prod *= k
+
+    a = a.reshape(-1, prod)
+    b = b.ravel()
+    res = wrap(solve(a, b))
+    res.shape = oldshape
+    return res
+
+
+def _solve_dispatcher(a, b):
+    return (a, b)
+
+
+@array_function_dispatch(_solve_dispatcher)
+def solve(a, b):
+    """
+    Solve a linear matrix equation, or system of linear scalar equations.
+
+    Computes the "exact" solution, `x`, of the well-determined, i.e., full
+    rank, linear matrix equation `ax = b`.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Coefficient matrix.
+    b : {(..., M,), (..., M, K)}, array_like
+        Ordinate or "dependent variable" values.
+
+    Returns
+    -------
+    x : {(..., M,), (..., M, K)} ndarray
+        Solution to the system a x = b.  Returned shape is identical to `b`.
+
+    Raises
+    ------
+    LinAlgError
+        If `a` is singular or not square.
+
+    See Also
+    --------
+    scipy.linalg.solve : Similar function in SciPy.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    The solutions are computed using LAPACK routine ``_gesv``.
+
+    `a` must be square and of full-rank, i.e., all rows (or, equivalently,
+    columns) must be linearly independent; if either is not true, use
+    `lstsq` for the least-squares best "solution" of the
+    system/equation.
+
+    References
+    ----------
+    .. [1] G. Strang, *Linear Algebra and Its Applications*, 2nd Ed., Orlando,
+           FL, Academic Press, Inc., 1980, pg. 22.
+
+    Examples
+    --------
+    Solve the system of equations ``3 * x0 + x1 = 9`` and ``x0 + 2 * x1 = 8``:
+
+    >>> a = np.array([[3,1], [1,2]])
+    >>> b = np.array([9,8])
+    >>> x = np.linalg.solve(a, b)
+    >>> x
+    array([2.,  3.])
+
+    Check that the solution is correct:
+
+    >>> np.allclose(np.dot(a, x), b)
+    True
+
+    """
+    a, _ = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    b, wrap = _makearray(b)
+    t, result_t = _commonType(a, b)
+
+    # We use the b = (..., M,) logic, only if the number of extra dimensions
+    # match exactly
+    if b.ndim == a.ndim - 1:
+        gufunc = _umath_linalg.solve1
+    else:
+        gufunc = _umath_linalg.solve
+
+    signature = 'DD->D' if isComplexType(t) else 'dd->d'
+    extobj = get_linalg_error_extobj(_raise_linalgerror_singular)
+    r = gufunc(a, b, signature=signature, extobj=extobj)
+
+    return wrap(r.astype(result_t, copy=False))
+
+
+def _tensorinv_dispatcher(a, ind=None):
+    return (a,)
+
+
+@array_function_dispatch(_tensorinv_dispatcher)
+def tensorinv(a, ind=2):
+    """
+    Compute the 'inverse' of an N-dimensional array.
+
+    The result is an inverse for `a` relative to the tensordot operation
+    ``tensordot(a, b, ind)``, i. e., up to floating-point accuracy,
+    ``tensordot(tensorinv(a), a, ind)`` is the "identity" tensor for the
+    tensordot operation.
+
+    Parameters
+    ----------
+    a : array_like
+        Tensor to 'invert'. Its shape must be 'square', i. e.,
+        ``prod(a.shape[:ind]) == prod(a.shape[ind:])``.
+    ind : int, optional
+        Number of first indices that are involved in the inverse sum.
+        Must be a positive integer, default is 2.
+
+    Returns
+    -------
+    b : ndarray
+        `a`'s tensordot inverse, shape ``a.shape[ind:] + a.shape[:ind]``.
+
+    Raises
+    ------
+    LinAlgError
+        If `a` is singular or not 'square' (in the above sense).
+
+    See Also
+    --------
+    numpy.tensordot, tensorsolve
+
+    Examples
+    --------
+    >>> a = np.eye(4*6)
+    >>> a.shape = (4, 6, 8, 3)
+    >>> ainv = np.linalg.tensorinv(a, ind=2)
+    >>> ainv.shape
+    (8, 3, 4, 6)
+    >>> b = np.random.randn(4, 6)
+    >>> np.allclose(np.tensordot(ainv, b), np.linalg.tensorsolve(a, b))
+    True
+
+    >>> a = np.eye(4*6)
+    >>> a.shape = (24, 8, 3)
+    >>> ainv = np.linalg.tensorinv(a, ind=1)
+    >>> ainv.shape
+    (8, 3, 24)
+    >>> b = np.random.randn(24)
+    >>> np.allclose(np.tensordot(ainv, b, 1), np.linalg.tensorsolve(a, b))
+    True
+
+    """
+    a = asarray(a)
+    oldshape = a.shape
+    prod = 1
+    if ind > 0:
+        invshape = oldshape[ind:] + oldshape[:ind]
+        for k in oldshape[ind:]:
+            prod *= k
+    else:
+        raise ValueError("Invalid ind argument.")
+    a = a.reshape(prod, -1)
+    ia = inv(a)
+    return ia.reshape(*invshape)
+
+
+# Matrix inversion
+
+def _unary_dispatcher(a):
+    return (a,)
+
+
+@array_function_dispatch(_unary_dispatcher)
+def inv(a):
+    """
+    Compute the (multiplicative) inverse of a matrix.
+
+    Given a square matrix `a`, return the matrix `ainv` satisfying
+    ``dot(a, ainv) = dot(ainv, a) = eye(a.shape[0])``.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Matrix to be inverted.
+
+    Returns
+    -------
+    ainv : (..., M, M) ndarray or matrix
+        (Multiplicative) inverse of the matrix `a`.
+
+    Raises
+    ------
+    LinAlgError
+        If `a` is not square or inversion fails.
+
+    See Also
+    --------
+    scipy.linalg.inv : Similar function in SciPy.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    Examples
+    --------
+    >>> from numpy.linalg import inv
+    >>> a = np.array([[1., 2.], [3., 4.]])
+    >>> ainv = inv(a)
+    >>> np.allclose(np.dot(a, ainv), np.eye(2))
+    True
+    >>> np.allclose(np.dot(ainv, a), np.eye(2))
+    True
+
+    If a is a matrix object, then the return value is a matrix as well:
+
+    >>> ainv = inv(np.matrix(a))
+    >>> ainv
+    matrix([[-2. ,  1. ],
+            [ 1.5, -0.5]])
+
+    Inverses of several matrices can be computed at once:
+
+    >>> a = np.array([[[1., 2.], [3., 4.]], [[1, 3], [3, 5]]])
+    >>> inv(a)
+    array([[[-2.  ,  1.  ],
+            [ 1.5 , -0.5 ]],
+           [[-1.25,  0.75],
+            [ 0.75, -0.25]]])
+
+    """
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+
+    signature = 'D->D' if isComplexType(t) else 'd->d'
+    extobj = get_linalg_error_extobj(_raise_linalgerror_singular)
+    ainv = _umath_linalg.inv(a, signature=signature, extobj=extobj)
+    return wrap(ainv.astype(result_t, copy=False))
+
+
+def _matrix_power_dispatcher(a, n):
+    return (a,)
+
+
+@array_function_dispatch(_matrix_power_dispatcher)
+def matrix_power(a, n):
+    """
+    Raise a square matrix to the (integer) power `n`.
+
+    For positive integers `n`, the power is computed by repeated matrix
+    squarings and matrix multiplications. If ``n == 0``, the identity matrix
+    of the same shape as M is returned. If ``n < 0``, the inverse
+    is computed and then raised to the ``abs(n)``.
+
+    .. note:: Stacks of object matrices are not currently supported.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Matrix to be "powered".
+    n : int
+        The exponent can be any integer or long integer, positive,
+        negative, or zero.
+
+    Returns
+    -------
+    a**n : (..., M, M) ndarray or matrix object
+        The return value is the same shape and type as `M`;
+        if the exponent is positive or zero then the type of the
+        elements is the same as those of `M`. If the exponent is
+        negative the elements are floating-point.
+
+    Raises
+    ------
+    LinAlgError
+        For matrices that are not square or that (for negative powers) cannot
+        be inverted numerically.
+
+    Examples
+    --------
+    >>> from numpy.linalg import matrix_power
+    >>> i = np.array([[0, 1], [-1, 0]]) # matrix equiv. of the imaginary unit
+    >>> matrix_power(i, 3) # should = -i
+    array([[ 0, -1],
+           [ 1,  0]])
+    >>> matrix_power(i, 0)
+    array([[1, 0],
+           [0, 1]])
+    >>> matrix_power(i, -3) # should = 1/(-i) = i, but w/ f.p. elements
+    array([[ 0.,  1.],
+           [-1.,  0.]])
+
+    Somewhat more sophisticated example
+
+    >>> q = np.zeros((4, 4))
+    >>> q[0:2, 0:2] = -i
+    >>> q[2:4, 2:4] = i
+    >>> q # one of the three quaternion units not equal to 1
+    array([[ 0., -1.,  0.,  0.],
+           [ 1.,  0.,  0.,  0.],
+           [ 0.,  0.,  0.,  1.],
+           [ 0.,  0., -1.,  0.]])
+    >>> matrix_power(q, 2) # = -np.eye(4)
+    array([[-1.,  0.,  0.,  0.],
+           [ 0., -1.,  0.,  0.],
+           [ 0.,  0., -1.,  0.],
+           [ 0.,  0.,  0., -1.]])
+
+    """
+    a = asanyarray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+
+    try:
+        n = operator.index(n)
+    except TypeError as e:
+        raise TypeError("exponent must be an integer") from e
+
+    # Fall back on dot for object arrays. Object arrays are not supported by
+    # the current implementation of matmul using einsum
+    if a.dtype != object:
+        fmatmul = matmul
+    elif a.ndim == 2:
+        fmatmul = dot
+    else:
+        raise NotImplementedError(
+            "matrix_power not supported for stacks of object arrays")
+
+    if n == 0:
+        a = empty_like(a)
+        a[...] = eye(a.shape[-2], dtype=a.dtype)
+        return a
+
+    elif n < 0:
+        a = inv(a)
+        n = abs(n)
+
+    # short-cuts.
+    if n == 1:
+        return a
+
+    elif n == 2:
+        return fmatmul(a, a)
+
+    elif n == 3:
+        return fmatmul(fmatmul(a, a), a)
+
+    # Use binary decomposition to reduce the number of matrix multiplications.
+    # Here, we iterate over the bits of n, from LSB to MSB, raise `a` to
+    # increasing powers of 2, and multiply into the result as needed.
+    z = result = None
+    while n > 0:
+        z = a if z is None else fmatmul(z, z)
+        n, bit = divmod(n, 2)
+        if bit:
+            result = z if result is None else fmatmul(result, z)
+
+    return result
+
+
+# Cholesky decomposition
+
+
+@array_function_dispatch(_unary_dispatcher)
+def cholesky(a):
+    """
+    Cholesky decomposition.
+
+    Return the Cholesky decomposition, `L * L.H`, of the square matrix `a`,
+    where `L` is lower-triangular and .H is the conjugate transpose operator
+    (which is the ordinary transpose if `a` is real-valued).  `a` must be
+    Hermitian (symmetric if real-valued) and positive-definite. No
+    checking is performed to verify whether `a` is Hermitian or not.
+    In addition, only the lower-triangular and diagonal elements of `a`
+    are used. Only `L` is actually returned.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Hermitian (symmetric if all elements are real), positive-definite
+        input matrix.
+
+    Returns
+    -------
+    L : (..., M, M) array_like
+        Upper or lower-triangular Cholesky factor of `a`.  Returns a
+        matrix object if `a` is a matrix object.
+
+    Raises
+    ------
+    LinAlgError
+       If the decomposition fails, for example, if `a` is not
+       positive-definite.
+
+    See Also
+    --------
+    scipy.linalg.cholesky : Similar function in SciPy.
+    scipy.linalg.cholesky_banded : Cholesky decompose a banded Hermitian
+                                   positive-definite matrix.
+    scipy.linalg.cho_factor : Cholesky decomposition of a matrix, to use in
+                              `scipy.linalg.cho_solve`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    The Cholesky decomposition is often used as a fast way of solving
+
+    .. math:: A \\mathbf{x} = \\mathbf{b}
+
+    (when `A` is both Hermitian/symmetric and positive-definite).
+
+    First, we solve for :math:`\\mathbf{y}` in
+
+    .. math:: L \\mathbf{y} = \\mathbf{b},
+
+    and then for :math:`\\mathbf{x}` in
+
+    .. math:: L.H \\mathbf{x} = \\mathbf{y}.
+
+    Examples
+    --------
+    >>> A = np.array([[1,-2j],[2j,5]])
+    >>> A
+    array([[ 1.+0.j, -0.-2.j],
+           [ 0.+2.j,  5.+0.j]])
+    >>> L = np.linalg.cholesky(A)
+    >>> L
+    array([[1.+0.j, 0.+0.j],
+           [0.+2.j, 1.+0.j]])
+    >>> np.dot(L, L.T.conj()) # verify that L * L.H = A
+    array([[1.+0.j, 0.-2.j],
+           [0.+2.j, 5.+0.j]])
+    >>> A = [[1,-2j],[2j,5]] # what happens if A is only array_like?
+    >>> np.linalg.cholesky(A) # an ndarray object is returned
+    array([[1.+0.j, 0.+0.j],
+           [0.+2.j, 1.+0.j]])
+    >>> # But a matrix object is returned if A is a matrix object
+    >>> np.linalg.cholesky(np.matrix(A))
+    matrix([[ 1.+0.j,  0.+0.j],
+            [ 0.+2.j,  1.+0.j]])
+
+    """
+    extobj = get_linalg_error_extobj(_raise_linalgerror_nonposdef)
+    gufunc = _umath_linalg.cholesky_lo
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+    signature = 'D->D' if isComplexType(t) else 'd->d'
+    r = gufunc(a, signature=signature, extobj=extobj)
+    return wrap(r.astype(result_t, copy=False))
+
+
+# QR decomposition
+
+def _qr_dispatcher(a, mode=None):
+    return (a,)
+
+
+@array_function_dispatch(_qr_dispatcher)
+def qr(a, mode='reduced'):
+    """
+    Compute the qr factorization of a matrix.
+
+    Factor the matrix `a` as *qr*, where `q` is orthonormal and `r` is
+    upper-triangular.
+
+    Parameters
+    ----------
+    a : array_like, shape (M, N)
+        Matrix to be factored.
+    mode : {'reduced', 'complete', 'r', 'raw'}, optional
+        If K = min(M, N), then
+
+        * 'reduced'  : returns q, r with dimensions (M, K), (K, N) (default)
+        * 'complete' : returns q, r with dimensions (M, M), (M, N)
+        * 'r'        : returns r only with dimensions (K, N)
+        * 'raw'      : returns h, tau with dimensions (N, M), (K,)
+
+        The options 'reduced', 'complete, and 'raw' are new in numpy 1.8,
+        see the notes for more information. The default is 'reduced', and to
+        maintain backward compatibility with earlier versions of numpy both
+        it and the old default 'full' can be omitted. Note that array h
+        returned in 'raw' mode is transposed for calling Fortran. The
+        'economic' mode is deprecated.  The modes 'full' and 'economic' may
+        be passed using only the first letter for backwards compatibility,
+        but all others must be spelled out. See the Notes for more
+        explanation.
+
+
+    Returns
+    -------
+    q : ndarray of float or complex, optional
+        A matrix with orthonormal columns. When mode = 'complete' the
+        result is an orthogonal/unitary matrix depending on whether or not
+        a is real/complex. The determinant may be either +/- 1 in that
+        case.
+    r : ndarray of float or complex, optional
+        The upper-triangular matrix.
+    (h, tau) : ndarrays of np.double or np.cdouble, optional
+        The array h contains the Householder reflectors that generate q
+        along with r. The tau array contains scaling factors for the
+        reflectors. In the deprecated  'economic' mode only h is returned.
+
+    Raises
+    ------
+    LinAlgError
+        If factoring fails.
+
+    See Also
+    --------
+    scipy.linalg.qr : Similar function in SciPy.
+    scipy.linalg.rq : Compute RQ decomposition of a matrix.
+
+    Notes
+    -----
+    This is an interface to the LAPACK routines ``dgeqrf``, ``zgeqrf``,
+    ``dorgqr``, and ``zungqr``.
+
+    For more information on the qr factorization, see for example:
+    https://en.wikipedia.org/wiki/QR_factorization
+
+    Subclasses of `ndarray` are preserved except for the 'raw' mode. So if
+    `a` is of type `matrix`, all the return values will be matrices too.
+
+    New 'reduced', 'complete', and 'raw' options for mode were added in
+    NumPy 1.8.0 and the old option 'full' was made an alias of 'reduced'.  In
+    addition the options 'full' and 'economic' were deprecated.  Because
+    'full' was the previous default and 'reduced' is the new default,
+    backward compatibility can be maintained by letting `mode` default.
+    The 'raw' option was added so that LAPACK routines that can multiply
+    arrays by q using the Householder reflectors can be used. Note that in
+    this case the returned arrays are of type np.double or np.cdouble and
+    the h array is transposed to be FORTRAN compatible.  No routines using
+    the 'raw' return are currently exposed by numpy, but some are available
+    in lapack_lite and just await the necessary work.
+
+    Examples
+    --------
+    >>> a = np.random.randn(9, 6)
+    >>> q, r = np.linalg.qr(a)
+    >>> np.allclose(a, np.dot(q, r))  # a does equal qr
+    True
+    >>> r2 = np.linalg.qr(a, mode='r')
+    >>> np.allclose(r, r2)  # mode='r' returns the same r as mode='full'
+    True
+
+    Example illustrating a common use of `qr`: solving of least squares
+    problems
+
+    What are the least-squares-best `m` and `y0` in ``y = y0 + mx`` for
+    the following data: {(0,1), (1,0), (1,2), (2,1)}. (Graph the points
+    and you'll see that it should be y0 = 0, m = 1.)  The answer is provided
+    by solving the over-determined matrix equation ``Ax = b``, where::
+
+      A = array([[0, 1], [1, 1], [1, 1], [2, 1]])
+      x = array([[y0], [m]])
+      b = array([[1], [0], [2], [1]])
+
+    If A = qr such that q is orthonormal (which is always possible via
+    Gram-Schmidt), then ``x = inv(r) * (q.T) * b``.  (In numpy practice,
+    however, we simply use `lstsq`.)
+
+    >>> A = np.array([[0, 1], [1, 1], [1, 1], [2, 1]])
+    >>> A
+    array([[0, 1],
+           [1, 1],
+           [1, 1],
+           [2, 1]])
+    >>> b = np.array([1, 0, 2, 1])
+    >>> q, r = np.linalg.qr(A)
+    >>> p = np.dot(q.T, b)
+    >>> np.dot(np.linalg.inv(r), p)
+    array([  1.1e-16,   1.0e+00])
+
+    """
+    if mode not in ('reduced', 'complete', 'r', 'raw'):
+        if mode in ('f', 'full'):
+            # 2013-04-01, 1.8
+            msg = "".join((
+                    "The 'full' option is deprecated in favor of 'reduced'.\n",
+                    "For backward compatibility let mode default."))
+            warnings.warn(msg, DeprecationWarning, stacklevel=3)
+            mode = 'reduced'
+        elif mode in ('e', 'economic'):
+            # 2013-04-01, 1.8
+            msg = "The 'economic' option is deprecated."
+            warnings.warn(msg, DeprecationWarning, stacklevel=3)
+            mode = 'economic'
+        else:
+            raise ValueError("Unrecognized mode '%s'" % mode)
+
+    a, wrap = _makearray(a)
+    _assert_2d(a)
+    m, n = a.shape
+    t, result_t = _commonType(a)
+    a = _fastCopyAndTranspose(t, a)
+    a = _to_native_byte_order(a)
+    mn = min(m, n)
+    tau = zeros((mn,), t)
+
+    if isComplexType(t):
+        lapack_routine = lapack_lite.zgeqrf
+        routine_name = 'zgeqrf'
+    else:
+        lapack_routine = lapack_lite.dgeqrf
+        routine_name = 'dgeqrf'
+
+    # calculate optimal size of work data 'work'
+    lwork = 1
+    work = zeros((lwork,), t)
+    results = lapack_routine(m, n, a, max(1, m), tau, work, -1, 0)
+    if results['info'] != 0:
+        raise LinAlgError('%s returns %d' % (routine_name, results['info']))
+
+    # do qr decomposition
+    lwork = max(1, n, int(abs(work[0])))
+    work = zeros((lwork,), t)
+    results = lapack_routine(m, n, a, max(1, m), tau, work, lwork, 0)
+    if results['info'] != 0:
+        raise LinAlgError('%s returns %d' % (routine_name, results['info']))
+
+    # handle modes that don't return q
+    if mode == 'r':
+        r = _fastCopyAndTranspose(result_t, a[:, :mn])
+        return wrap(triu(r))
+
+    if mode == 'raw':
+        return a, tau
+
+    if mode == 'economic':
+        if t != result_t :
+            a = a.astype(result_t, copy=False)
+        return wrap(a.T)
+
+    #  generate q from a
+    if mode == 'complete' and m > n:
+        mc = m
+        q = empty((m, m), t)
+    else:
+        mc = mn
+        q = empty((n, m), t)
+    q[:n] = a
+
+    if isComplexType(t):
+        lapack_routine = lapack_lite.zungqr
+        routine_name = 'zungqr'
+    else:
+        lapack_routine = lapack_lite.dorgqr
+        routine_name = 'dorgqr'
+
+    # determine optimal lwork
+    lwork = 1
+    work = zeros((lwork,), t)
+    results = lapack_routine(m, mc, mn, q, max(1, m), tau, work, -1, 0)
+    if results['info'] != 0:
+        raise LinAlgError('%s returns %d' % (routine_name, results['info']))
+
+    # compute q
+    lwork = max(1, n, int(abs(work[0])))
+    work = zeros((lwork,), t)
+    results = lapack_routine(m, mc, mn, q, max(1, m), tau, work, lwork, 0)
+    if results['info'] != 0:
+        raise LinAlgError('%s returns %d' % (routine_name, results['info']))
+
+    q = _fastCopyAndTranspose(result_t, q[:mc])
+    r = _fastCopyAndTranspose(result_t, a[:, :mc])
+
+    return wrap(q), wrap(triu(r))
+
+
+# Eigenvalues
+
+
+@array_function_dispatch(_unary_dispatcher)
+def eigvals(a):
+    """
+    Compute the eigenvalues of a general matrix.
+
+    Main difference between `eigvals` and `eig`: the eigenvectors aren't
+    returned.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        A complex- or real-valued matrix whose eigenvalues will be computed.
+
+    Returns
+    -------
+    w : (..., M,) ndarray
+        The eigenvalues, each repeated according to its multiplicity.
+        They are not necessarily ordered, nor are they necessarily
+        real for real matrices.
+
+    Raises
+    ------
+    LinAlgError
+        If the eigenvalue computation does not converge.
+
+    See Also
+    --------
+    eig : eigenvalues and right eigenvectors of general arrays
+    eigvalsh : eigenvalues of real symmetric or complex Hermitian
+               (conjugate symmetric) arrays.
+    eigh : eigenvalues and eigenvectors of real symmetric or complex
+           Hermitian (conjugate symmetric) arrays.
+    scipy.linalg.eigvals : Similar function in SciPy.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    This is implemented using the ``_geev`` LAPACK routines which compute
+    the eigenvalues and eigenvectors of general square arrays.
+
+    Examples
+    --------
+    Illustration, using the fact that the eigenvalues of a diagonal matrix
+    are its diagonal elements, that multiplying a matrix on the left
+    by an orthogonal matrix, `Q`, and on the right by `Q.T` (the transpose
+    of `Q`), preserves the eigenvalues of the "middle" matrix.  In other words,
+    if `Q` is orthogonal, then ``Q * A * Q.T`` has the same eigenvalues as
+    ``A``:
+
+    >>> from numpy import linalg as LA
+    >>> x = np.random.random()
+    >>> Q = np.array([[np.cos(x), -np.sin(x)], [np.sin(x), np.cos(x)]])
+    >>> LA.norm(Q[0, :]), LA.norm(Q[1, :]), np.dot(Q[0, :],Q[1, :])
+    (1.0, 1.0, 0.0)
+
+    Now multiply a diagonal matrix by ``Q`` on one side and by ``Q.T`` on the other:
+
+    >>> D = np.diag((-1,1))
+    >>> LA.eigvals(D)
+    array([-1.,  1.])
+    >>> A = np.dot(Q, D)
+    >>> A = np.dot(A, Q.T)
+    >>> LA.eigvals(A)
+    array([ 1., -1.]) # random
+
+    """
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    _assert_finite(a)
+    t, result_t = _commonType(a)
+
+    extobj = get_linalg_error_extobj(
+        _raise_linalgerror_eigenvalues_nonconvergence)
+    signature = 'D->D' if isComplexType(t) else 'd->D'
+    w = _umath_linalg.eigvals(a, signature=signature, extobj=extobj)
+
+    if not isComplexType(t):
+        if all(w.imag == 0):
+            w = w.real
+            result_t = _realType(result_t)
+        else:
+            result_t = _complexType(result_t)
+
+    return w.astype(result_t, copy=False)
+
+
+def _eigvalsh_dispatcher(a, UPLO=None):
+    return (a,)
+
+
+@array_function_dispatch(_eigvalsh_dispatcher)
+def eigvalsh(a, UPLO='L'):
+    """
+    Compute the eigenvalues of a complex Hermitian or real symmetric matrix.
+
+    Main difference from eigh: the eigenvectors are not computed.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        A complex- or real-valued matrix whose eigenvalues are to be
+        computed.
+    UPLO : {'L', 'U'}, optional
+        Specifies whether the calculation is done with the lower triangular
+        part of `a` ('L', default) or the upper triangular part ('U').
+        Irrespective of this value only the real parts of the diagonal will
+        be considered in the computation to preserve the notion of a Hermitian
+        matrix. It therefore follows that the imaginary part of the diagonal
+        will always be treated as zero.
+
+    Returns
+    -------
+    w : (..., M,) ndarray
+        The eigenvalues in ascending order, each repeated according to
+        its multiplicity.
+
+    Raises
+    ------
+    LinAlgError
+        If the eigenvalue computation does not converge.
+
+    See Also
+    --------
+    eigh : eigenvalues and eigenvectors of real symmetric or complex Hermitian
+           (conjugate symmetric) arrays.
+    eigvals : eigenvalues of general real or complex arrays.
+    eig : eigenvalues and right eigenvectors of general real or complex
+          arrays.
+    scipy.linalg.eigvalsh : Similar function in SciPy.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    The eigenvalues are computed using LAPACK routines ``_syevd``, ``_heevd``.
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+    >>> a = np.array([[1, -2j], [2j, 5]])
+    >>> LA.eigvalsh(a)
+    array([ 0.17157288,  5.82842712]) # may vary
+
+    >>> # demonstrate the treatment of the imaginary part of the diagonal
+    >>> a = np.array([[5+2j, 9-2j], [0+2j, 2-1j]])
+    >>> a
+    array([[5.+2.j, 9.-2.j],
+           [0.+2.j, 2.-1.j]])
+    >>> # with UPLO='L' this is numerically equivalent to using LA.eigvals()
+    >>> # with:
+    >>> b = np.array([[5.+0.j, 0.-2.j], [0.+2.j, 2.-0.j]])
+    >>> b
+    array([[5.+0.j, 0.-2.j],
+           [0.+2.j, 2.+0.j]])
+    >>> wa = LA.eigvalsh(a)
+    >>> wb = LA.eigvals(b)
+    >>> wa; wb
+    array([1., 6.])
+    array([6.+0.j, 1.+0.j])
+
+    """
+    UPLO = UPLO.upper()
+    if UPLO not in ('L', 'U'):
+        raise ValueError("UPLO argument must be 'L' or 'U'")
+
+    extobj = get_linalg_error_extobj(
+        _raise_linalgerror_eigenvalues_nonconvergence)
+    if UPLO == 'L':
+        gufunc = _umath_linalg.eigvalsh_lo
+    else:
+        gufunc = _umath_linalg.eigvalsh_up
+
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+    signature = 'D->d' if isComplexType(t) else 'd->d'
+    w = gufunc(a, signature=signature, extobj=extobj)
+    return w.astype(_realType(result_t), copy=False)
+
+def _convertarray(a):
+    t, result_t = _commonType(a)
+    a = _fastCT(a.astype(t))
+    return a, t, result_t
+
+
+# Eigenvectors
+
+
+@array_function_dispatch(_unary_dispatcher)
+def eig(a):
+    """
+    Compute the eigenvalues and right eigenvectors of a square array.
+
+    Parameters
+    ----------
+    a : (..., M, M) array
+        Matrices for which the eigenvalues and right eigenvectors will
+        be computed
+
+    Returns
+    -------
+    w : (..., M) array
+        The eigenvalues, each repeated according to its multiplicity.
+        The eigenvalues are not necessarily ordered. The resulting
+        array will be of complex type, unless the imaginary part is
+        zero in which case it will be cast to a real type. When `a`
+        is real the resulting eigenvalues will be real (0 imaginary
+        part) or occur in conjugate pairs
+
+    v : (..., M, M) array
+        The normalized (unit "length") eigenvectors, such that the
+        column ``v[:,i]`` is the eigenvector corresponding to the
+        eigenvalue ``w[i]``.
+
+    Raises
+    ------
+    LinAlgError
+        If the eigenvalue computation does not converge.
+
+    See Also
+    --------
+    eigvals : eigenvalues of a non-symmetric array.
+    eigh : eigenvalues and eigenvectors of a real symmetric or complex
+           Hermitian (conjugate symmetric) array.
+    eigvalsh : eigenvalues of a real symmetric or complex Hermitian
+               (conjugate symmetric) array.
+    scipy.linalg.eig : Similar function in SciPy that also solves the
+                       generalized eigenvalue problem.
+    scipy.linalg.schur : Best choice for unitary and other non-Hermitian
+                         normal matrices.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    This is implemented using the ``_geev`` LAPACK routines which compute
+    the eigenvalues and eigenvectors of general square arrays.
+
+    The number `w` is an eigenvalue of `a` if there exists a vector
+    `v` such that ``a @ v = w * v``. Thus, the arrays `a`, `w`, and
+    `v` satisfy the equations ``a @ v[:,i] = w[i] * v[:,i]``
+    for :math:`i \\in \\{0,...,M-1\\}`.
+
+    The array `v` of eigenvectors may not be of maximum rank, that is, some
+    of the columns may be linearly dependent, although round-off error may
+    obscure that fact. If the eigenvalues are all different, then theoretically
+    the eigenvectors are linearly independent and `a` can be diagonalized by
+    a similarity transformation using `v`, i.e, ``inv(v) @ a @ v`` is diagonal.
+
+    For non-Hermitian normal matrices the SciPy function `scipy.linalg.schur`
+    is preferred because the matrix `v` is guaranteed to be unitary, which is
+    not the case when using `eig`. The Schur factorization produces an
+    upper triangular matrix rather than a diagonal matrix, but for normal
+    matrices only the diagonal of the upper triangular matrix is needed, the
+    rest is roundoff error.
+
+    Finally, it is emphasized that `v` consists of the *right* (as in
+    right-hand side) eigenvectors of `a`.  A vector `y` satisfying
+    ``y.T @ a = z * y.T`` for some number `z` is called a *left*
+    eigenvector of `a`, and, in general, the left and right eigenvectors
+    of a matrix are not necessarily the (perhaps conjugate) transposes
+    of each other.
+
+    References
+    ----------
+    G. Strang, *Linear Algebra and Its Applications*, 2nd Ed., Orlando, FL,
+    Academic Press, Inc., 1980, Various pp.
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+
+    (Almost) trivial example with real e-values and e-vectors.
+
+    >>> w, v = LA.eig(np.diag((1, 2, 3)))
+    >>> w; v
+    array([1., 2., 3.])
+    array([[1., 0., 0.],
+           [0., 1., 0.],
+           [0., 0., 1.]])
+
+    Real matrix possessing complex e-values and e-vectors; note that the
+    e-values are complex conjugates of each other.
+
+    >>> w, v = LA.eig(np.array([[1, -1], [1, 1]]))
+    >>> w; v
+    array([1.+1.j, 1.-1.j])
+    array([[0.70710678+0.j        , 0.70710678-0.j        ],
+           [0.        -0.70710678j, 0.        +0.70710678j]])
+
+    Complex-valued matrix with real e-values (but complex-valued e-vectors);
+    note that ``a.conj().T == a``, i.e., `a` is Hermitian.
+
+    >>> a = np.array([[1, 1j], [-1j, 1]])
+    >>> w, v = LA.eig(a)
+    >>> w; v
+    array([2.+0.j, 0.+0.j])
+    array([[ 0.        +0.70710678j,  0.70710678+0.j        ], # may vary
+           [ 0.70710678+0.j        , -0.        +0.70710678j]])
+
+    Be careful about round-off error!
+
+    >>> a = np.array([[1 + 1e-9, 0], [0, 1 - 1e-9]])
+    >>> # Theor. e-values are 1 +/- 1e-9
+    >>> w, v = LA.eig(a)
+    >>> w; v
+    array([1., 1.])
+    array([[1., 0.],
+           [0., 1.]])
+
+    """
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    _assert_finite(a)
+    t, result_t = _commonType(a)
+
+    extobj = get_linalg_error_extobj(
+        _raise_linalgerror_eigenvalues_nonconvergence)
+    signature = 'D->DD' if isComplexType(t) else 'd->DD'
+    w, vt = _umath_linalg.eig(a, signature=signature, extobj=extobj)
+
+    if not isComplexType(t) and all(w.imag == 0.0):
+        w = w.real
+        vt = vt.real
+        result_t = _realType(result_t)
+    else:
+        result_t = _complexType(result_t)
+
+    vt = vt.astype(result_t, copy=False)
+    return w.astype(result_t, copy=False), wrap(vt)
+
+
+@array_function_dispatch(_eigvalsh_dispatcher)
+def eigh(a, UPLO='L'):
+    """
+    Return the eigenvalues and eigenvectors of a complex Hermitian
+    (conjugate symmetric) or a real symmetric matrix.
+
+    Returns two objects, a 1-D array containing the eigenvalues of `a`, and
+    a 2-D square array or matrix (depending on the input type) of the
+    corresponding eigenvectors (in columns).
+
+    Parameters
+    ----------
+    a : (..., M, M) array
+        Hermitian or real symmetric matrices whose eigenvalues and
+        eigenvectors are to be computed.
+    UPLO : {'L', 'U'}, optional
+        Specifies whether the calculation is done with the lower triangular
+        part of `a` ('L', default) or the upper triangular part ('U').
+        Irrespective of this value only the real parts of the diagonal will
+        be considered in the computation to preserve the notion of a Hermitian
+        matrix. It therefore follows that the imaginary part of the diagonal
+        will always be treated as zero.
+
+    Returns
+    -------
+    w : (..., M) ndarray
+        The eigenvalues in ascending order, each repeated according to
+        its multiplicity.
+    v : {(..., M, M) ndarray, (..., M, M) matrix}
+        The column ``v[:, i]`` is the normalized eigenvector corresponding
+        to the eigenvalue ``w[i]``.  Will return a matrix object if `a` is
+        a matrix object.
+
+    Raises
+    ------
+    LinAlgError
+        If the eigenvalue computation does not converge.
+
+    See Also
+    --------
+    eigvalsh : eigenvalues of real symmetric or complex Hermitian
+               (conjugate symmetric) arrays.
+    eig : eigenvalues and right eigenvectors for non-symmetric arrays.
+    eigvals : eigenvalues of non-symmetric arrays.
+    scipy.linalg.eigh : Similar function in SciPy (but also solves the
+                        generalized eigenvalue problem).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    The eigenvalues/eigenvectors are computed using LAPACK routines ``_syevd``,
+    ``_heevd``.
+
+    The eigenvalues of real symmetric or complex Hermitian matrices are
+    always real. [1]_ The array `v` of (column) eigenvectors is unitary
+    and `a`, `w`, and `v` satisfy the equations
+    ``dot(a, v[:, i]) = w[i] * v[:, i]``.
+
+    References
+    ----------
+    .. [1] G. Strang, *Linear Algebra and Its Applications*, 2nd Ed., Orlando,
+           FL, Academic Press, Inc., 1980, pg. 222.
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+    >>> a = np.array([[1, -2j], [2j, 5]])
+    >>> a
+    array([[ 1.+0.j, -0.-2.j],
+           [ 0.+2.j,  5.+0.j]])
+    >>> w, v = LA.eigh(a)
+    >>> w; v
+    array([0.17157288, 5.82842712])
+    array([[-0.92387953+0.j        , -0.38268343+0.j        ], # may vary
+           [ 0.        +0.38268343j,  0.        -0.92387953j]])
+
+    >>> np.dot(a, v[:, 0]) - w[0] * v[:, 0] # verify 1st e-val/vec pair
+    array([5.55111512e-17+0.0000000e+00j, 0.00000000e+00+1.2490009e-16j])
+    >>> np.dot(a, v[:, 1]) - w[1] * v[:, 1] # verify 2nd e-val/vec pair
+    array([0.+0.j, 0.+0.j])
+
+    >>> A = np.matrix(a) # what happens if input is a matrix object
+    >>> A
+    matrix([[ 1.+0.j, -0.-2.j],
+            [ 0.+2.j,  5.+0.j]])
+    >>> w, v = LA.eigh(A)
+    >>> w; v
+    array([0.17157288, 5.82842712])
+    matrix([[-0.92387953+0.j        , -0.38268343+0.j        ], # may vary
+            [ 0.        +0.38268343j,  0.        -0.92387953j]])
+
+    >>> # demonstrate the treatment of the imaginary part of the diagonal
+    >>> a = np.array([[5+2j, 9-2j], [0+2j, 2-1j]])
+    >>> a
+    array([[5.+2.j, 9.-2.j],
+           [0.+2.j, 2.-1.j]])
+    >>> # with UPLO='L' this is numerically equivalent to using LA.eig() with:
+    >>> b = np.array([[5.+0.j, 0.-2.j], [0.+2.j, 2.-0.j]])
+    >>> b
+    array([[5.+0.j, 0.-2.j],
+           [0.+2.j, 2.+0.j]])
+    >>> wa, va = LA.eigh(a)
+    >>> wb, vb = LA.eig(b)
+    >>> wa; wb
+    array([1., 6.])
+    array([6.+0.j, 1.+0.j])
+    >>> va; vb
+    array([[-0.4472136 +0.j        , -0.89442719+0.j        ], # may vary
+           [ 0.        +0.89442719j,  0.        -0.4472136j ]])
+    array([[ 0.89442719+0.j       , -0.        +0.4472136j],
+           [-0.        +0.4472136j,  0.89442719+0.j       ]])
+    """
+    UPLO = UPLO.upper()
+    if UPLO not in ('L', 'U'):
+        raise ValueError("UPLO argument must be 'L' or 'U'")
+
+    a, wrap = _makearray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+
+    extobj = get_linalg_error_extobj(
+        _raise_linalgerror_eigenvalues_nonconvergence)
+    if UPLO == 'L':
+        gufunc = _umath_linalg.eigh_lo
+    else:
+        gufunc = _umath_linalg.eigh_up
+
+    signature = 'D->dD' if isComplexType(t) else 'd->dd'
+    w, vt = gufunc(a, signature=signature, extobj=extobj)
+    w = w.astype(_realType(result_t), copy=False)
+    vt = vt.astype(result_t, copy=False)
+    return w, wrap(vt)
+
+
+# Singular value decomposition
+
+def _svd_dispatcher(a, full_matrices=None, compute_uv=None, hermitian=None):
+    return (a,)
+
+
+@array_function_dispatch(_svd_dispatcher)
+def svd(a, full_matrices=True, compute_uv=True, hermitian=False):
+    """
+    Singular Value Decomposition.
+
+    When `a` is a 2D array, it is factorized as ``u @ np.diag(s) @ vh
+    = (u * s) @ vh``, where `u` and `vh` are 2D unitary arrays and `s` is a 1D
+    array of `a`'s singular values. When `a` is higher-dimensional, SVD is
+    applied in stacked mode as explained below.
+
+    Parameters
+    ----------
+    a : (..., M, N) array_like
+        A real or complex array with ``a.ndim >= 2``.
+    full_matrices : bool, optional
+        If True (default), `u` and `vh` have the shapes ``(..., M, M)`` and
+        ``(..., N, N)``, respectively.  Otherwise, the shapes are
+        ``(..., M, K)`` and ``(..., K, N)``, respectively, where
+        ``K = min(M, N)``.
+    compute_uv : bool, optional
+        Whether or not to compute `u` and `vh` in addition to `s`.  True
+        by default.
+    hermitian : bool, optional
+        If True, `a` is assumed to be Hermitian (symmetric if real-valued),
+        enabling a more efficient method for finding singular values.
+        Defaults to False.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    u : { (..., M, M), (..., M, K) } array
+        Unitary array(s). The first ``a.ndim - 2`` dimensions have the same
+        size as those of the input `a`. The size of the last two dimensions
+        depends on the value of `full_matrices`. Only returned when
+        `compute_uv` is True.
+    s : (..., K) array
+        Vector(s) with the singular values, within each vector sorted in
+        descending order. The first ``a.ndim - 2`` dimensions have the same
+        size as those of the input `a`.
+    vh : { (..., N, N), (..., K, N) } array
+        Unitary array(s). The first ``a.ndim - 2`` dimensions have the same
+        size as those of the input `a`. The size of the last two dimensions
+        depends on the value of `full_matrices`. Only returned when
+        `compute_uv` is True.
+
+    Raises
+    ------
+    LinAlgError
+        If SVD computation does not converge.
+
+    See Also
+    --------
+    scipy.linalg.svd : Similar function in SciPy.
+    scipy.linalg.svdvals : Compute singular values of a matrix.
+
+    Notes
+    -----
+
+    .. versionchanged:: 1.8.0
+       Broadcasting rules apply, see the `numpy.linalg` documentation for
+       details.
+
+    The decomposition is performed using LAPACK routine ``_gesdd``.
+
+    SVD is usually described for the factorization of a 2D matrix :math:`A`.
+    The higher-dimensional case will be discussed below. In the 2D case, SVD is
+    written as :math:`A = U S V^H`, where :math:`A = a`, :math:`U= u`,
+    :math:`S= \\mathtt{np.diag}(s)` and :math:`V^H = vh`. The 1D array `s`
+    contains the singular values of `a` and `u` and `vh` are unitary. The rows
+    of `vh` are the eigenvectors of :math:`A^H A` and the columns of `u` are
+    the eigenvectors of :math:`A A^H`. In both cases the corresponding
+    (possibly non-zero) eigenvalues are given by ``s**2``.
+
+    If `a` has more than two dimensions, then broadcasting rules apply, as
+    explained in :ref:`routines.linalg-broadcasting`. This means that SVD is
+    working in "stacked" mode: it iterates over all indices of the first
+    ``a.ndim - 2`` dimensions and for each combination SVD is applied to the
+    last two indices. The matrix `a` can be reconstructed from the
+    decomposition with either ``(u * s[..., None, :]) @ vh`` or
+    ``u @ (s[..., None] * vh)``. (The ``@`` operator can be replaced by the
+    function ``np.matmul`` for python versions below 3.5.)
+
+    If `a` is a ``matrix`` object (as opposed to an ``ndarray``), then so are
+    all the return values.
+
+    Examples
+    --------
+    >>> a = np.random.randn(9, 6) + 1j*np.random.randn(9, 6)
+    >>> b = np.random.randn(2, 7, 8, 3) + 1j*np.random.randn(2, 7, 8, 3)
+
+    Reconstruction based on full SVD, 2D case:
+
+    >>> u, s, vh = np.linalg.svd(a, full_matrices=True)
+    >>> u.shape, s.shape, vh.shape
+    ((9, 9), (6,), (6, 6))
+    >>> np.allclose(a, np.dot(u[:, :6] * s, vh))
+    True
+    >>> smat = np.zeros((9, 6), dtype=complex)
+    >>> smat[:6, :6] = np.diag(s)
+    >>> np.allclose(a, np.dot(u, np.dot(smat, vh)))
+    True
+
+    Reconstruction based on reduced SVD, 2D case:
+
+    >>> u, s, vh = np.linalg.svd(a, full_matrices=False)
+    >>> u.shape, s.shape, vh.shape
+    ((9, 6), (6,), (6, 6))
+    >>> np.allclose(a, np.dot(u * s, vh))
+    True
+    >>> smat = np.diag(s)
+    >>> np.allclose(a, np.dot(u, np.dot(smat, vh)))
+    True
+
+    Reconstruction based on full SVD, 4D case:
+
+    >>> u, s, vh = np.linalg.svd(b, full_matrices=True)
+    >>> u.shape, s.shape, vh.shape
+    ((2, 7, 8, 8), (2, 7, 3), (2, 7, 3, 3))
+    >>> np.allclose(b, np.matmul(u[..., :3] * s[..., None, :], vh))
+    True
+    >>> np.allclose(b, np.matmul(u[..., :3], s[..., None] * vh))
+    True
+
+    Reconstruction based on reduced SVD, 4D case:
+
+    >>> u, s, vh = np.linalg.svd(b, full_matrices=False)
+    >>> u.shape, s.shape, vh.shape
+    ((2, 7, 8, 3), (2, 7, 3), (2, 7, 3, 3))
+    >>> np.allclose(b, np.matmul(u * s[..., None, :], vh))
+    True
+    >>> np.allclose(b, np.matmul(u, s[..., None] * vh))
+    True
+
+    """
+    import numpy as _nx
+    a, wrap = _makearray(a)
+
+    if hermitian:
+        # note: lapack svd returns eigenvalues with s ** 2 sorted descending,
+        # but eig returns s sorted ascending, so we re-order the eigenvalues
+        # and related arrays to have the correct order
+        if compute_uv:
+            s, u = eigh(a)
+            sgn = sign(s)
+            s = abs(s)
+            sidx = argsort(s)[..., ::-1]
+            sgn = _nx.take_along_axis(sgn, sidx, axis=-1)
+            s = _nx.take_along_axis(s, sidx, axis=-1)
+            u = _nx.take_along_axis(u, sidx[..., None, :], axis=-1)
+            # singular values are unsigned, move the sign into v
+            vt = transpose(u * sgn[..., None, :]).conjugate()
+            return wrap(u), s, wrap(vt)
+        else:
+            s = eigvalsh(a)
+            s = s[..., ::-1]
+            s = abs(s)
+            return sort(s)[..., ::-1]
+
+    _assert_stacked_2d(a)
+    t, result_t = _commonType(a)
+
+    extobj = get_linalg_error_extobj(_raise_linalgerror_svd_nonconvergence)
+
+    m, n = a.shape[-2:]
+    if compute_uv:
+        if full_matrices:
+            if m < n:
+                gufunc = _umath_linalg.svd_m_f
+            else:
+                gufunc = _umath_linalg.svd_n_f
+        else:
+            if m < n:
+                gufunc = _umath_linalg.svd_m_s
+            else:
+                gufunc = _umath_linalg.svd_n_s
+
+        signature = 'D->DdD' if isComplexType(t) else 'd->ddd'
+        u, s, vh = gufunc(a, signature=signature, extobj=extobj)
+        u = u.astype(result_t, copy=False)
+        s = s.astype(_realType(result_t), copy=False)
+        vh = vh.astype(result_t, copy=False)
+        return wrap(u), s, wrap(vh)
+    else:
+        if m < n:
+            gufunc = _umath_linalg.svd_m
+        else:
+            gufunc = _umath_linalg.svd_n
+
+        signature = 'D->d' if isComplexType(t) else 'd->d'
+        s = gufunc(a, signature=signature, extobj=extobj)
+        s = s.astype(_realType(result_t), copy=False)
+        return s
+
+
+def _cond_dispatcher(x, p=None):
+    return (x,)
+
+
+@array_function_dispatch(_cond_dispatcher)
+def cond(x, p=None):
+    """
+    Compute the condition number of a matrix.
+
+    This function is capable of returning the condition number using
+    one of seven different norms, depending on the value of `p` (see
+    Parameters below).
+
+    Parameters
+    ----------
+    x : (..., M, N) array_like
+        The matrix whose condition number is sought.
+    p : {None, 1, -1, 2, -2, inf, -inf, 'fro'}, optional
+        Order of the norm:
+
+        =====  ============================
+        p      norm for matrices
+        =====  ============================
+        None   2-norm, computed directly using the ``SVD``
+        'fro'  Frobenius norm
+        inf    max(sum(abs(x), axis=1))
+        -inf   min(sum(abs(x), axis=1))
+        1      max(sum(abs(x), axis=0))
+        -1     min(sum(abs(x), axis=0))
+        2      2-norm (largest sing. value)
+        -2     smallest singular value
+        =====  ============================
+
+        inf means the numpy.inf object, and the Frobenius norm is
+        the root-of-sum-of-squares norm.
+
+    Returns
+    -------
+    c : {float, inf}
+        The condition number of the matrix. May be infinite.
+
+    See Also
+    --------
+    numpy.linalg.norm
+
+    Notes
+    -----
+    The condition number of `x` is defined as the norm of `x` times the
+    norm of the inverse of `x` [1]_; the norm can be the usual L2-norm
+    (root-of-sum-of-squares) or one of a number of other matrix norms.
+
+    References
+    ----------
+    .. [1] G. Strang, *Linear Algebra and Its Applications*, Orlando, FL,
+           Academic Press, Inc., 1980, pg. 285.
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+    >>> a = np.array([[1, 0, -1], [0, 1, 0], [1, 0, 1]])
+    >>> a
+    array([[ 1,  0, -1],
+           [ 0,  1,  0],
+           [ 1,  0,  1]])
+    >>> LA.cond(a)
+    1.4142135623730951
+    >>> LA.cond(a, 'fro')
+    3.1622776601683795
+    >>> LA.cond(a, np.inf)
+    2.0
+    >>> LA.cond(a, -np.inf)
+    1.0
+    >>> LA.cond(a, 1)
+    2.0
+    >>> LA.cond(a, -1)
+    1.0
+    >>> LA.cond(a, 2)
+    1.4142135623730951
+    >>> LA.cond(a, -2)
+    0.70710678118654746 # may vary
+    >>> min(LA.svd(a, compute_uv=False))*min(LA.svd(LA.inv(a), compute_uv=False))
+    0.70710678118654746 # may vary
+
+    """
+    x = asarray(x)  # in case we have a matrix
+    if _is_empty_2d(x):
+        raise LinAlgError("cond is not defined on empty arrays")
+    if p is None or p == 2 or p == -2:
+        s = svd(x, compute_uv=False)
+        with errstate(all='ignore'):
+            if p == -2:
+                r = s[..., -1] / s[..., 0]
+            else:
+                r = s[..., 0] / s[..., -1]
+    else:
+        # Call inv(x) ignoring errors. The result array will
+        # contain nans in the entries where inversion failed.
+        _assert_stacked_2d(x)
+        _assert_stacked_square(x)
+        t, result_t = _commonType(x)
+        signature = 'D->D' if isComplexType(t) else 'd->d'
+        with errstate(all='ignore'):
+            invx = _umath_linalg.inv(x, signature=signature)
+            r = norm(x, p, axis=(-2, -1)) * norm(invx, p, axis=(-2, -1))
+        r = r.astype(result_t, copy=False)
+
+    # Convert nans to infs unless the original array had nan entries
+    r = asarray(r)
+    nan_mask = isnan(r)
+    if nan_mask.any():
+        nan_mask &= ~isnan(x).any(axis=(-2, -1))
+        if r.ndim > 0:
+            r[nan_mask] = Inf
+        elif nan_mask:
+            r[()] = Inf
+
+    # Convention is to return scalars instead of 0d arrays
+    if r.ndim == 0:
+        r = r[()]
+
+    return r
+
+
+def _matrix_rank_dispatcher(M, tol=None, hermitian=None):
+    return (M,)
+
+
+@array_function_dispatch(_matrix_rank_dispatcher)
+def matrix_rank(M, tol=None, hermitian=False):
+    """
+    Return matrix rank of array using SVD method
+
+    Rank of the array is the number of singular values of the array that are
+    greater than `tol`.
+
+    .. versionchanged:: 1.14
+       Can now operate on stacks of matrices
+
+    Parameters
+    ----------
+    M : {(M,), (..., M, N)} array_like
+        Input vector or stack of matrices.
+    tol : (...) array_like, float, optional
+        Threshold below which SVD values are considered zero. If `tol` is
+        None, and ``S`` is an array with singular values for `M`, and
+        ``eps`` is the epsilon value for datatype of ``S``, then `tol` is
+        set to ``S.max() * max(M.shape) * eps``.
+
+        .. versionchanged:: 1.14
+           Broadcasted against the stack of matrices
+    hermitian : bool, optional
+        If True, `M` is assumed to be Hermitian (symmetric if real-valued),
+        enabling a more efficient method for finding singular values.
+        Defaults to False.
+
+        .. versionadded:: 1.14
+
+    Returns
+    -------
+    rank : (...) array_like
+        Rank of M.
+
+    Notes
+    -----
+    The default threshold to detect rank deficiency is a test on the magnitude
+    of the singular values of `M`.  By default, we identify singular values less
+    than ``S.max() * max(M.shape) * eps`` as indicating rank deficiency (with
+    the symbols defined above). This is the algorithm MATLAB uses [1].  It also
+    appears in *Numerical recipes* in the discussion of SVD solutions for linear
+    least squares [2].
+
+    This default threshold is designed to detect rank deficiency accounting for
+    the numerical errors of the SVD computation.  Imagine that there is a column
+    in `M` that is an exact (in floating point) linear combination of other
+    columns in `M`. Computing the SVD on `M` will not produce a singular value
+    exactly equal to 0 in general: any difference of the smallest SVD value from
+    0 will be caused by numerical imprecision in the calculation of the SVD.
+    Our threshold for small SVD values takes this numerical imprecision into
+    account, and the default threshold will detect such numerical rank
+    deficiency.  The threshold may declare a matrix `M` rank deficient even if
+    the linear combination of some columns of `M` is not exactly equal to
+    another column of `M` but only numerically very close to another column of
+    `M`.
+
+    We chose our default threshold because it is in wide use.  Other thresholds
+    are possible.  For example, elsewhere in the 2007 edition of *Numerical
+    recipes* there is an alternative threshold of ``S.max() *
+    np.finfo(M.dtype).eps / 2. * np.sqrt(m + n + 1.)``. The authors describe
+    this threshold as being based on "expected roundoff error" (p 71).
+
+    The thresholds above deal with floating point roundoff error in the
+    calculation of the SVD.  However, you may have more information about the
+    sources of error in `M` that would make you consider other tolerance values
+    to detect *effective* rank deficiency.  The most useful measure of the
+    tolerance depends on the operations you intend to use on your matrix.  For
+    example, if your data come from uncertain measurements with uncertainties
+    greater than floating point epsilon, choosing a tolerance near that
+    uncertainty may be preferable.  The tolerance may be absolute if the
+    uncertainties are absolute rather than relative.
+
+    References
+    ----------
+    .. [1] MATLAB reference documention, "Rank"
+           https://www.mathworks.com/help/techdoc/ref/rank.html
+    .. [2] W. H. Press, S. A. Teukolsky, W. T. Vetterling and B. P. Flannery,
+           "Numerical Recipes (3rd edition)", Cambridge University Press, 2007,
+           page 795.
+
+    Examples
+    --------
+    >>> from numpy.linalg import matrix_rank
+    >>> matrix_rank(np.eye(4)) # Full rank matrix
+    4
+    >>> I=np.eye(4); I[-1,-1] = 0. # rank deficient matrix
+    >>> matrix_rank(I)
+    3
+    >>> matrix_rank(np.ones((4,))) # 1 dimension - rank 1 unless all 0
+    1
+    >>> matrix_rank(np.zeros((4,)))
+    0
+    """
+    M = asarray(M)
+    if M.ndim < 2:
+        return int(not all(M==0))
+    S = svd(M, compute_uv=False, hermitian=hermitian)
+    if tol is None:
+        tol = S.max(axis=-1, keepdims=True) * max(M.shape[-2:]) * finfo(S.dtype).eps
+    else:
+        tol = asarray(tol)[..., newaxis]
+    return count_nonzero(S > tol, axis=-1)
+
+
+# Generalized inverse
+
+def _pinv_dispatcher(a, rcond=None, hermitian=None):
+    return (a,)
+
+
+@array_function_dispatch(_pinv_dispatcher)
+def pinv(a, rcond=1e-15, hermitian=False):
+    """
+    Compute the (Moore-Penrose) pseudo-inverse of a matrix.
+
+    Calculate the generalized inverse of a matrix using its
+    singular-value decomposition (SVD) and including all
+    *large* singular values.
+
+    .. versionchanged:: 1.14
+       Can now operate on stacks of matrices
+
+    Parameters
+    ----------
+    a : (..., M, N) array_like
+        Matrix or stack of matrices to be pseudo-inverted.
+    rcond : (...) array_like of float
+        Cutoff for small singular values.
+        Singular values less than or equal to
+        ``rcond * largest_singular_value`` are set to zero.
+        Broadcasts against the stack of matrices.
+    hermitian : bool, optional
+        If True, `a` is assumed to be Hermitian (symmetric if real-valued),
+        enabling a more efficient method for finding singular values.
+        Defaults to False.
+
+        .. versionadded:: 1.17.0
+
+    Returns
+    -------
+    B : (..., N, M) ndarray
+        The pseudo-inverse of `a`. If `a` is a `matrix` instance, then so
+        is `B`.
+
+    Raises
+    ------
+    LinAlgError
+        If the SVD computation does not converge.
+
+    See Also
+    --------
+    scipy.linalg.pinv : Similar function in SciPy.
+    scipy.linalg.pinv2 : Similar function in SciPy (SVD-based).
+    scipy.linalg.pinvh : Compute the (Moore-Penrose) pseudo-inverse of a
+                         Hermitian matrix.
+
+    Notes
+    -----
+    The pseudo-inverse of a matrix A, denoted :math:`A^+`, is
+    defined as: "the matrix that 'solves' [the least-squares problem]
+    :math:`Ax = b`," i.e., if :math:`\\bar{x}` is said solution, then
+    :math:`A^+` is that matrix such that :math:`\\bar{x} = A^+b`.
+
+    It can be shown that if :math:`Q_1 \\Sigma Q_2^T = A` is the singular
+    value decomposition of A, then
+    :math:`A^+ = Q_2 \\Sigma^+ Q_1^T`, where :math:`Q_{1,2}` are
+    orthogonal matrices, :math:`\\Sigma` is a diagonal matrix consisting
+    of A's so-called singular values, (followed, typically, by
+    zeros), and then :math:`\\Sigma^+` is simply the diagonal matrix
+    consisting of the reciprocals of A's singular values
+    (again, followed by zeros). [1]_
+
+    References
+    ----------
+    .. [1] G. Strang, *Linear Algebra and Its Applications*, 2nd Ed., Orlando,
+           FL, Academic Press, Inc., 1980, pp. 139-142.
+
+    Examples
+    --------
+    The following example checks that ``a * a+ * a == a`` and
+    ``a+ * a * a+ == a+``:
+
+    >>> a = np.random.randn(9, 6)
+    >>> B = np.linalg.pinv(a)
+    >>> np.allclose(a, np.dot(a, np.dot(B, a)))
+    True
+    >>> np.allclose(B, np.dot(B, np.dot(a, B)))
+    True
+
+    """
+    a, wrap = _makearray(a)
+    rcond = asarray(rcond)
+    if _is_empty_2d(a):
+        m, n = a.shape[-2:]
+        res = empty(a.shape[:-2] + (n, m), dtype=a.dtype)
+        return wrap(res)
+    a = a.conjugate()
+    u, s, vt = svd(a, full_matrices=False, hermitian=hermitian)
+
+    # discard small singular values
+    cutoff = rcond[..., newaxis] * amax(s, axis=-1, keepdims=True)
+    large = s > cutoff
+    s = divide(1, s, where=large, out=s)
+    s[~large] = 0
+
+    res = matmul(transpose(vt), multiply(s[..., newaxis], transpose(u)))
+    return wrap(res)
+
+
+# Determinant
+
+
+@array_function_dispatch(_unary_dispatcher)
+def slogdet(a):
+    """
+    Compute the sign and (natural) logarithm of the determinant of an array.
+
+    If an array has a very small or very large determinant, then a call to
+    `det` may overflow or underflow. This routine is more robust against such
+    issues, because it computes the logarithm of the determinant rather than
+    the determinant itself.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Input array, has to be a square 2-D array.
+
+    Returns
+    -------
+    sign : (...) array_like
+        A number representing the sign of the determinant. For a real matrix,
+        this is 1, 0, or -1. For a complex matrix, this is a complex number
+        with absolute value 1 (i.e., it is on the unit circle), or else 0.
+    logdet : (...) array_like
+        The natural log of the absolute value of the determinant.
+
+    If the determinant is zero, then `sign` will be 0 and `logdet` will be
+    -Inf. In all cases, the determinant is equal to ``sign * np.exp(logdet)``.
+
+    See Also
+    --------
+    det
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    .. versionadded:: 1.6.0
+
+    The determinant is computed via LU factorization using the LAPACK
+    routine ``z/dgetrf``.
+
+
+    Examples
+    --------
+    The determinant of a 2-D array ``[[a, b], [c, d]]`` is ``ad - bc``:
+
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> (sign, logdet) = np.linalg.slogdet(a)
+    >>> (sign, logdet)
+    (-1, 0.69314718055994529) # may vary
+    >>> sign * np.exp(logdet)
+    -2.0
+
+    Computing log-determinants for a stack of matrices:
+
+    >>> a = np.array([ [[1, 2], [3, 4]], [[1, 2], [2, 1]], [[1, 3], [3, 1]] ])
+    >>> a.shape
+    (3, 2, 2)
+    >>> sign, logdet = np.linalg.slogdet(a)
+    >>> (sign, logdet)
+    (array([-1., -1., -1.]), array([ 0.69314718,  1.09861229,  2.07944154]))
+    >>> sign * np.exp(logdet)
+    array([-2., -3., -8.])
+
+    This routine succeeds where ordinary `det` does not:
+
+    >>> np.linalg.det(np.eye(500) * 0.1)
+    0.0
+    >>> np.linalg.slogdet(np.eye(500) * 0.1)
+    (1, -1151.2925464970228)
+
+    """
+    a = asarray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+    real_t = _realType(result_t)
+    signature = 'D->Dd' if isComplexType(t) else 'd->dd'
+    sign, logdet = _umath_linalg.slogdet(a, signature=signature)
+    sign = sign.astype(result_t, copy=False)
+    logdet = logdet.astype(real_t, copy=False)
+    return sign, logdet
+
+
+@array_function_dispatch(_unary_dispatcher)
+def det(a):
+    """
+    Compute the determinant of an array.
+
+    Parameters
+    ----------
+    a : (..., M, M) array_like
+        Input array to compute determinants for.
+
+    Returns
+    -------
+    det : (...) array_like
+        Determinant of `a`.
+
+    See Also
+    --------
+    slogdet : Another way to represent the determinant, more suitable
+      for large matrices where underflow/overflow may occur.
+    scipy.linalg.det : Similar function in SciPy.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.8.0
+
+    Broadcasting rules apply, see the `numpy.linalg` documentation for
+    details.
+
+    The determinant is computed via LU factorization using the LAPACK
+    routine ``z/dgetrf``.
+
+    Examples
+    --------
+    The determinant of a 2-D array [[a, b], [c, d]] is ad - bc:
+
+    >>> a = np.array([[1, 2], [3, 4]])
+    >>> np.linalg.det(a)
+    -2.0 # may vary
+
+    Computing determinants for a stack of matrices:
+
+    >>> a = np.array([ [[1, 2], [3, 4]], [[1, 2], [2, 1]], [[1, 3], [3, 1]] ])
+    >>> a.shape
+    (3, 2, 2)
+    >>> np.linalg.det(a)
+    array([-2., -3., -8.])
+
+    """
+    a = asarray(a)
+    _assert_stacked_2d(a)
+    _assert_stacked_square(a)
+    t, result_t = _commonType(a)
+    signature = 'D->D' if isComplexType(t) else 'd->d'
+    r = _umath_linalg.det(a, signature=signature)
+    r = r.astype(result_t, copy=False)
+    return r
+
+
+# Linear Least Squares
+
+def _lstsq_dispatcher(a, b, rcond=None):
+    return (a, b)
+
+
+@array_function_dispatch(_lstsq_dispatcher)
+def lstsq(a, b, rcond="warn"):
+    r"""
+    Return the least-squares solution to a linear matrix equation.
+
+    Computes the vector x that approximatively solves the equation
+    ``a @ x = b``. The equation may be under-, well-, or over-determined
+    (i.e., the number of linearly independent rows of `a` can be less than,
+    equal to, or greater than its number of linearly independent columns).
+    If `a` is square and of full rank, then `x` (but for round-off error)
+    is the "exact" solution of the equation. Else, `x` minimizes the
+    Euclidean 2-norm :math:`|| b - a x ||`.
+
+    Parameters
+    ----------
+    a : (M, N) array_like
+        "Coefficient" matrix.
+    b : {(M,), (M, K)} array_like
+        Ordinate or "dependent variable" values. If `b` is two-dimensional,
+        the least-squares solution is calculated for each of the `K` columns
+        of `b`.
+    rcond : float, optional
+        Cut-off ratio for small singular values of `a`.
+        For the purposes of rank determination, singular values are treated
+        as zero if they are smaller than `rcond` times the largest singular
+        value of `a`.
+
+        .. versionchanged:: 1.14.0
+           If not set, a FutureWarning is given. The previous default
+           of ``-1`` will use the machine precision as `rcond` parameter,
+           the new default will use the machine precision times `max(M, N)`.
+           To silence the warning and use the new default, use ``rcond=None``,
+           to keep using the old behavior, use ``rcond=-1``.
+
+    Returns
+    -------
+    x : {(N,), (N, K)} ndarray
+        Least-squares solution. If `b` is two-dimensional,
+        the solutions are in the `K` columns of `x`.
+    residuals : {(1,), (K,), (0,)} ndarray
+        Sums of residuals; squared Euclidean 2-norm for each column in
+        ``b - a*x``.
+        If the rank of `a` is < N or M <= N, this is an empty array.
+        If `b` is 1-dimensional, this is a (1,) shape array.
+        Otherwise the shape is (K,).
+    rank : int
+        Rank of matrix `a`.
+    s : (min(M, N),) ndarray
+        Singular values of `a`.
+
+    Raises
+    ------
+    LinAlgError
+        If computation does not converge.
+
+    See Also
+    --------
+    scipy.linalg.lstsq : Similar function in SciPy.
+
+    Notes
+    -----
+    If `b` is a matrix, then all array results are returned as matrices.
+
+    Examples
+    --------
+    Fit a line, ``y = mx + c``, through some noisy data-points:
+
+    >>> x = np.array([0, 1, 2, 3])
+    >>> y = np.array([-1, 0.2, 0.9, 2.1])
+
+    By examining the coefficients, we see that the line should have a
+    gradient of roughly 1 and cut the y-axis at, more or less, -1.
+
+    We can rewrite the line equation as ``y = Ap``, where ``A = [[x 1]]``
+    and ``p = [[m], [c]]``.  Now use `lstsq` to solve for `p`:
+
+    >>> A = np.vstack([x, np.ones(len(x))]).T
+    >>> A
+    array([[ 0.,  1.],
+           [ 1.,  1.],
+           [ 2.,  1.],
+           [ 3.,  1.]])
+
+    >>> m, c = np.linalg.lstsq(A, y, rcond=None)[0]
+    >>> m, c
+    (1.0 -0.95) # may vary
+
+    Plot the data along with the fitted line:
+
+    >>> import matplotlib.pyplot as plt
+    >>> _ = plt.plot(x, y, 'o', label='Original data', markersize=10)
+    >>> _ = plt.plot(x, m*x + c, 'r', label='Fitted line')
+    >>> _ = plt.legend()
+    >>> plt.show()
+
+    """
+    a, _ = _makearray(a)
+    b, wrap = _makearray(b)
+    is_1d = b.ndim == 1
+    if is_1d:
+        b = b[:, newaxis]
+    _assert_2d(a, b)
+    m, n = a.shape[-2:]
+    m2, n_rhs = b.shape[-2:]
+    if m != m2:
+        raise LinAlgError('Incompatible dimensions')
+
+    t, result_t = _commonType(a, b)
+    # FIXME: real_t is unused
+    real_t = _linalgRealType(t)
+    result_real_t = _realType(result_t)
+
+    # Determine default rcond value
+    if rcond == "warn":
+        # 2017-08-19, 1.14.0
+        warnings.warn("`rcond` parameter will change to the default of "
+                      "machine precision times ``max(M, N)`` where M and N "
+                      "are the input matrix dimensions.\n"
+                      "To use the future default and silence this warning "
+                      "we advise to pass `rcond=None`, to keep using the old, "
+                      "explicitly pass `rcond=-1`.",
+                      FutureWarning, stacklevel=3)
+        rcond = -1
+    if rcond is None:
+        rcond = finfo(t).eps * max(n, m)
+
+    if m <= n:
+        gufunc = _umath_linalg.lstsq_m
+    else:
+        gufunc = _umath_linalg.lstsq_n
+
+    signature = 'DDd->Ddid' if isComplexType(t) else 'ddd->ddid'
+    extobj = get_linalg_error_extobj(_raise_linalgerror_lstsq)
+    if n_rhs == 0:
+        # lapack can't handle n_rhs = 0 - so allocate the array one larger in that axis
+        b = zeros(b.shape[:-2] + (m, n_rhs + 1), dtype=b.dtype)
+    x, resids, rank, s = gufunc(a, b, rcond, signature=signature, extobj=extobj)
+    if m == 0:
+        x[...] = 0
+    if n_rhs == 0:
+        # remove the item we added
+        x = x[..., :n_rhs]
+        resids = resids[..., :n_rhs]
+
+    # remove the axis we added
+    if is_1d:
+        x = x.squeeze(axis=-1)
+        # we probably should squeeze resids too, but we can't
+        # without breaking compatibility.
+
+    # as documented
+    if rank != n or m <= n:
+        resids = array([], result_real_t)
+
+    # coerce output arrays
+    s = s.astype(result_real_t, copy=False)
+    resids = resids.astype(result_real_t, copy=False)
+    x = x.astype(result_t, copy=True)  # Copying lets the memory in r_parts be freed
+    return wrap(x), wrap(resids), rank, s
+
+
+def _multi_svd_norm(x, row_axis, col_axis, op):
+    """Compute a function of the singular values of the 2-D matrices in `x`.
+
+    This is a private utility function used by `numpy.linalg.norm()`.
+
+    Parameters
+    ----------
+    x : ndarray
+    row_axis, col_axis : int
+        The axes of `x` that hold the 2-D matrices.
+    op : callable
+        This should be either numpy.amin or `numpy.amax` or `numpy.sum`.
+
+    Returns
+    -------
+    result : float or ndarray
+        If `x` is 2-D, the return values is a float.
+        Otherwise, it is an array with ``x.ndim - 2`` dimensions.
+        The return values are either the minimum or maximum or sum of the
+        singular values of the matrices, depending on whether `op`
+        is `numpy.amin` or `numpy.amax` or `numpy.sum`.
+
+    """
+    y = moveaxis(x, (row_axis, col_axis), (-2, -1))
+    result = op(svd(y, compute_uv=False), axis=-1)
+    return result
+
+
+def _norm_dispatcher(x, ord=None, axis=None, keepdims=None):
+    return (x,)
+
+
+@array_function_dispatch(_norm_dispatcher)
+def norm(x, ord=None, axis=None, keepdims=False):
+    """
+    Matrix or vector norm.
+
+    This function is able to return one of eight different matrix norms,
+    or one of an infinite number of vector norms (described below), depending
+    on the value of the ``ord`` parameter.
+
+    Parameters
+    ----------
+    x : array_like
+        Input array.  If `axis` is None, `x` must be 1-D or 2-D, unless `ord`
+        is None. If both `axis` and `ord` are None, the 2-norm of
+        ``x.ravel`` will be returned.
+    ord : {non-zero int, inf, -inf, 'fro', 'nuc'}, optional
+        Order of the norm (see table under ``Notes``). inf means numpy's
+        `inf` object. The default is None.
+    axis : {None, int, 2-tuple of ints}, optional.
+        If `axis` is an integer, it specifies the axis of `x` along which to
+        compute the vector norms.  If `axis` is a 2-tuple, it specifies the
+        axes that hold 2-D matrices, and the matrix norms of these matrices
+        are computed.  If `axis` is None then either a vector norm (when `x`
+        is 1-D) or a matrix norm (when `x` is 2-D) is returned. The default
+        is None.
+
+        .. versionadded:: 1.8.0
+
+    keepdims : bool, optional
+        If this is set to True, the axes which are normed over are left in the
+        result as dimensions with size one.  With this option the result will
+        broadcast correctly against the original `x`.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    n : float or ndarray
+        Norm of the matrix or vector(s).
+
+    See Also
+    --------
+    scipy.linalg.norm : Similar function in SciPy.
+
+    Notes
+    -----
+    For values of ``ord < 1``, the result is, strictly speaking, not a
+    mathematical 'norm', but it may still be useful for various numerical
+    purposes.
+
+    The following norms can be calculated:
+
+    =====  ============================  ==========================
+    ord    norm for matrices             norm for vectors
+    =====  ============================  ==========================
+    None   Frobenius norm                2-norm
+    'fro'  Frobenius norm                --
+    'nuc'  nuclear norm                  --
+    inf    max(sum(abs(x), axis=1))      max(abs(x))
+    -inf   min(sum(abs(x), axis=1))      min(abs(x))
+    0      --                            sum(x != 0)
+    1      max(sum(abs(x), axis=0))      as below
+    -1     min(sum(abs(x), axis=0))      as below
+    2      2-norm (largest sing. value)  as below
+    -2     smallest singular value       as below
+    other  --                            sum(abs(x)**ord)**(1./ord)
+    =====  ============================  ==========================
+
+    The Frobenius norm is given by [1]_:
+
+        :math:`||A||_F = [\\sum_{i,j} abs(a_{i,j})^2]^{1/2}`
+
+    The nuclear norm is the sum of the singular values.
+
+    Both the Frobenius and nuclear norm orders are only defined for
+    matrices and raise a ValueError when ``x.ndim != 2``.
+
+    References
+    ----------
+    .. [1] G. H. Golub and C. F. Van Loan, *Matrix Computations*,
+           Baltimore, MD, Johns Hopkins University Press, 1985, pg. 15
+
+    Examples
+    --------
+    >>> from numpy import linalg as LA
+    >>> a = np.arange(9) - 4
+    >>> a
+    array([-4, -3, -2, ...,  2,  3,  4])
+    >>> b = a.reshape((3, 3))
+    >>> b
+    array([[-4, -3, -2],
+           [-1,  0,  1],
+           [ 2,  3,  4]])
+
+    >>> LA.norm(a)
+    7.745966692414834
+    >>> LA.norm(b)
+    7.745966692414834
+    >>> LA.norm(b, 'fro')
+    7.745966692414834
+    >>> LA.norm(a, np.inf)
+    4.0
+    >>> LA.norm(b, np.inf)
+    9.0
+    >>> LA.norm(a, -np.inf)
+    0.0
+    >>> LA.norm(b, -np.inf)
+    2.0
+
+    >>> LA.norm(a, 1)
+    20.0
+    >>> LA.norm(b, 1)
+    7.0
+    >>> LA.norm(a, -1)
+    -4.6566128774142013e-010
+    >>> LA.norm(b, -1)
+    6.0
+    >>> LA.norm(a, 2)
+    7.745966692414834
+    >>> LA.norm(b, 2)
+    7.3484692283495345
+
+    >>> LA.norm(a, -2)
+    0.0
+    >>> LA.norm(b, -2)
+    1.8570331885190563e-016 # may vary
+    >>> LA.norm(a, 3)
+    5.8480354764257312 # may vary
+    >>> LA.norm(a, -3)
+    0.0
+
+    Using the `axis` argument to compute vector norms:
+
+    >>> c = np.array([[ 1, 2, 3],
+    ...               [-1, 1, 4]])
+    >>> LA.norm(c, axis=0)
+    array([ 1.41421356,  2.23606798,  5.        ])
+    >>> LA.norm(c, axis=1)
+    array([ 3.74165739,  4.24264069])
+    >>> LA.norm(c, ord=1, axis=1)
+    array([ 6.,  6.])
+
+    Using the `axis` argument to compute matrix norms:
+
+    >>> m = np.arange(8).reshape(2,2,2)
+    >>> LA.norm(m, axis=(1,2))
+    array([  3.74165739,  11.22497216])
+    >>> LA.norm(m[0, :, :]), LA.norm(m[1, :, :])
+    (3.7416573867739413, 11.224972160321824)
+
+    """
+    x = asarray(x)
+
+    if not issubclass(x.dtype.type, (inexact, object_)):
+        x = x.astype(float)
+
+    # Immediately handle some default, simple, fast, and common cases.
+    if axis is None:
+        ndim = x.ndim
+        if ((ord is None) or
+            (ord in ('f', 'fro') and ndim == 2) or
+            (ord == 2 and ndim == 1)):
+
+            x = x.ravel(order='K')
+            if isComplexType(x.dtype.type):
+                sqnorm = dot(x.real, x.real) + dot(x.imag, x.imag)
+            else:
+                sqnorm = dot(x, x)
+            ret = sqrt(sqnorm)
+            if keepdims:
+                ret = ret.reshape(ndim*[1])
+            return ret
+
+    # Normalize the `axis` argument to a tuple.
+    nd = x.ndim
+    if axis is None:
+        axis = tuple(range(nd))
+    elif not isinstance(axis, tuple):
+        try:
+            axis = int(axis)
+        except Exception as e:
+            raise TypeError("'axis' must be None, an integer or a tuple of integers") from e
+        axis = (axis,)
+
+    if len(axis) == 1:
+        if ord == Inf:
+            return abs(x).max(axis=axis, keepdims=keepdims)
+        elif ord == -Inf:
+            return abs(x).min(axis=axis, keepdims=keepdims)
+        elif ord == 0:
+            # Zero norm
+            return (x != 0).astype(x.real.dtype).sum(axis=axis, keepdims=keepdims)
+        elif ord == 1:
+            # special case for speedup
+            return add.reduce(abs(x), axis=axis, keepdims=keepdims)
+        elif ord is None or ord == 2:
+            # special case for speedup
+            s = (x.conj() * x).real
+            return sqrt(add.reduce(s, axis=axis, keepdims=keepdims))
+        # None of the str-type keywords for ord ('fro', 'nuc') 
+        # are valid for vectors
+        elif isinstance(ord, str):
+            raise ValueError(f"Invalid norm order '{ord}' for vectors")
+        else:
+            absx = abs(x)
+            absx **= ord
+            ret = add.reduce(absx, axis=axis, keepdims=keepdims)
+            ret **= (1 / ord)
+            return ret
+    elif len(axis) == 2:
+        row_axis, col_axis = axis
+        row_axis = normalize_axis_index(row_axis, nd)
+        col_axis = normalize_axis_index(col_axis, nd)
+        if row_axis == col_axis:
+            raise ValueError('Duplicate axes given.')
+        if ord == 2:
+            ret =  _multi_svd_norm(x, row_axis, col_axis, amax)
+        elif ord == -2:
+            ret = _multi_svd_norm(x, row_axis, col_axis, amin)
+        elif ord == 1:
+            if col_axis > row_axis:
+                col_axis -= 1
+            ret = add.reduce(abs(x), axis=row_axis).max(axis=col_axis)
+        elif ord == Inf:
+            if row_axis > col_axis:
+                row_axis -= 1
+            ret = add.reduce(abs(x), axis=col_axis).max(axis=row_axis)
+        elif ord == -1:
+            if col_axis > row_axis:
+                col_axis -= 1
+            ret = add.reduce(abs(x), axis=row_axis).min(axis=col_axis)
+        elif ord == -Inf:
+            if row_axis > col_axis:
+                row_axis -= 1
+            ret = add.reduce(abs(x), axis=col_axis).min(axis=row_axis)
+        elif ord in [None, 'fro', 'f']:
+            ret = sqrt(add.reduce((x.conj() * x).real, axis=axis))
+        elif ord == 'nuc':
+            ret = _multi_svd_norm(x, row_axis, col_axis, sum)
+        else:
+            raise ValueError("Invalid norm order for matrices.")
+        if keepdims:
+            ret_shape = list(x.shape)
+            ret_shape[axis[0]] = 1
+            ret_shape[axis[1]] = 1
+            ret = ret.reshape(ret_shape)
+        return ret
+    else:
+        raise ValueError("Improper number of dimensions to norm.")
+
+
+# multi_dot
+
+def _multidot_dispatcher(arrays, *, out=None):
+    yield from arrays
+    yield out
+
+
+@array_function_dispatch(_multidot_dispatcher)
+def multi_dot(arrays, *, out=None):
+    """
+    Compute the dot product of two or more arrays in a single function call,
+    while automatically selecting the fastest evaluation order.
+
+    `multi_dot` chains `numpy.dot` and uses optimal parenthesization
+    of the matrices [1]_ [2]_. Depending on the shapes of the matrices,
+    this can speed up the multiplication a lot.
+
+    If the first argument is 1-D it is treated as a row vector.
+    If the last argument is 1-D it is treated as a column vector.
+    The other arguments must be 2-D.
+
+    Think of `multi_dot` as::
+
+        def multi_dot(arrays): return functools.reduce(np.dot, arrays)
+
+
+    Parameters
+    ----------
+    arrays : sequence of array_like
+        If the first argument is 1-D it is treated as row vector.
+        If the last argument is 1-D it is treated as column vector.
+        The other arguments must be 2-D.
+    out : ndarray, optional
+        Output argument. This must have the exact kind that would be returned
+        if it was not used. In particular, it must have the right type, must be
+        C-contiguous, and its dtype must be the dtype that would be returned
+        for `dot(a, b)`. This is a performance feature. Therefore, if these
+        conditions are not met, an exception is raised, instead of attempting
+        to be flexible.
+
+        .. versionadded:: 1.19.0
+
+    Returns
+    -------
+    output : ndarray
+        Returns the dot product of the supplied arrays.
+
+    See Also
+    --------
+    dot : dot multiplication with two arguments.
+
+    References
+    ----------
+
+    .. [1] Cormen, "Introduction to Algorithms", Chapter 15.2, p. 370-378
+    .. [2] https://en.wikipedia.org/wiki/Matrix_chain_multiplication
+
+    Examples
+    --------
+    `multi_dot` allows you to write::
+
+    >>> from numpy.linalg import multi_dot
+    >>> # Prepare some data
+    >>> A = np.random.random((10000, 100))
+    >>> B = np.random.random((100, 1000))
+    >>> C = np.random.random((1000, 5))
+    >>> D = np.random.random((5, 333))
+    >>> # the actual dot multiplication
+    >>> _ = multi_dot([A, B, C, D])
+
+    instead of::
+
+    >>> _ = np.dot(np.dot(np.dot(A, B), C), D)
+    >>> # or
+    >>> _ = A.dot(B).dot(C).dot(D)
+
+    Notes
+    -----
+    The cost for a matrix multiplication can be calculated with the
+    following function::
+
+        def cost(A, B):
+            return A.shape[0] * A.shape[1] * B.shape[1]
+
+    Assume we have three matrices
+    :math:`A_{10x100}, B_{100x5}, C_{5x50}`.
+
+    The costs for the two different parenthesizations are as follows::
+
+        cost((AB)C) = 10*100*5 + 10*5*50   = 5000 + 2500   = 7500
+        cost(A(BC)) = 10*100*50 + 100*5*50 = 50000 + 25000 = 75000
+
+    """
+    n = len(arrays)
+    # optimization only makes sense for len(arrays) > 2
+    if n < 2:
+        raise ValueError("Expecting at least two arrays.")
+    elif n == 2:
+        return dot(arrays[0], arrays[1], out=out)
+
+    arrays = [asanyarray(a) for a in arrays]
+
+    # save original ndim to reshape the result array into the proper form later
+    ndim_first, ndim_last = arrays[0].ndim, arrays[-1].ndim
+    # Explicitly convert vectors to 2D arrays to keep the logic of the internal
+    # _multi_dot_* functions as simple as possible.
+    if arrays[0].ndim == 1:
+        arrays[0] = atleast_2d(arrays[0])
+    if arrays[-1].ndim == 1:
+        arrays[-1] = atleast_2d(arrays[-1]).T
+    _assert_2d(*arrays)
+
+    # _multi_dot_three is much faster than _multi_dot_matrix_chain_order
+    if n == 3:
+        result = _multi_dot_three(arrays[0], arrays[1], arrays[2], out=out)
+    else:
+        order = _multi_dot_matrix_chain_order(arrays)
+        result = _multi_dot(arrays, order, 0, n - 1, out=out)
+
+    # return proper shape
+    if ndim_first == 1 and ndim_last == 1:
+        return result[0, 0]  # scalar
+    elif ndim_first == 1 or ndim_last == 1:
+        return result.ravel()  # 1-D
+    else:
+        return result
+
+
+def _multi_dot_three(A, B, C, out=None):
+    """
+    Find the best order for three arrays and do the multiplication.
+
+    For three arguments `_multi_dot_three` is approximately 15 times faster
+    than `_multi_dot_matrix_chain_order`
+
+    """
+    a0, a1b0 = A.shape
+    b1c0, c1 = C.shape
+    # cost1 = cost((AB)C) = a0*a1b0*b1c0 + a0*b1c0*c1
+    cost1 = a0 * b1c0 * (a1b0 + c1)
+    # cost2 = cost(A(BC)) = a1b0*b1c0*c1 + a0*a1b0*c1
+    cost2 = a1b0 * c1 * (a0 + b1c0)
+
+    if cost1 < cost2:
+        return dot(dot(A, B), C, out=out)
+    else:
+        return dot(A, dot(B, C), out=out)
+
+
+def _multi_dot_matrix_chain_order(arrays, return_costs=False):
+    """
+    Return a np.array that encodes the optimal order of mutiplications.
+
+    The optimal order array is then used by `_multi_dot()` to do the
+    multiplication.
+
+    Also return the cost matrix if `return_costs` is `True`
+
+    The implementation CLOSELY follows Cormen, "Introduction to Algorithms",
+    Chapter 15.2, p. 370-378.  Note that Cormen uses 1-based indices.
+
+        cost[i, j] = min([
+            cost[prefix] + cost[suffix] + cost_mult(prefix, suffix)
+            for k in range(i, j)])
+
+    """
+    n = len(arrays)
+    # p stores the dimensions of the matrices
+    # Example for p: A_{10x100}, B_{100x5}, C_{5x50} --> p = [10, 100, 5, 50]
+    p = [a.shape[0] for a in arrays] + [arrays[-1].shape[1]]
+    # m is a matrix of costs of the subproblems
+    # m[i,j]: min number of scalar multiplications needed to compute A_{i..j}
+    m = zeros((n, n), dtype=double)
+    # s is the actual ordering
+    # s[i, j] is the value of k at which we split the product A_i..A_j
+    s = empty((n, n), dtype=intp)
+
+    for l in range(1, n):
+        for i in range(n - l):
+            j = i + l
+            m[i, j] = Inf
+            for k in range(i, j):
+                q = m[i, k] + m[k+1, j] + p[i]*p[k+1]*p[j+1]
+                if q < m[i, j]:
+                    m[i, j] = q
+                    s[i, j] = k  # Note that Cormen uses 1-based index
+
+    return (s, m) if return_costs else s
+
+
+def _multi_dot(arrays, order, i, j, out=None):
+    """Actually do the multiplication with the given order."""
+    if i == j:
+        # the initial call with non-None out should never get here
+        assert out is None
+
+        return arrays[i]
+    else:
+        return dot(_multi_dot(arrays, order, i, order[i, j]),
+                   _multi_dot(arrays, order, order[i, j] + 1, j),
+                   out=out)
diff --git a/venv/Lib/site-packages/numpy/linalg/setup.py b/venv/Lib/site-packages/numpy/linalg/setup.py
new file mode 100644
index 000000000..57fdd502b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/setup.py
@@ -0,0 +1,81 @@
+import os
+import sys
+
+def configuration(parent_package='', top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    from numpy.distutils.system_info import get_info, system_info
+    config = Configuration('linalg', parent_package, top_path)
+
+    config.add_subpackage('tests')
+
+    # Configure lapack_lite
+
+    src_dir = 'lapack_lite'
+    lapack_lite_src = [
+        os.path.join(src_dir, 'python_xerbla.c'),
+        os.path.join(src_dir, 'f2c_z_lapack.c'),
+        os.path.join(src_dir, 'f2c_c_lapack.c'),
+        os.path.join(src_dir, 'f2c_d_lapack.c'),
+        os.path.join(src_dir, 'f2c_s_lapack.c'),
+        os.path.join(src_dir, 'f2c_lapack.c'),
+        os.path.join(src_dir, 'f2c_blas.c'),
+        os.path.join(src_dir, 'f2c_config.c'),
+        os.path.join(src_dir, 'f2c.c'),
+    ]
+    all_sources = config.paths(lapack_lite_src)
+
+    if os.environ.get('NPY_USE_BLAS_ILP64', "0") != "0":
+        lapack_info = get_info('lapack_ilp64_opt', 2)
+    else:
+        lapack_info = get_info('lapack_opt', 0)  # and {}
+
+    use_lapack_lite = not lapack_info
+
+    if use_lapack_lite:
+        # This makes numpy.distutils write the fact that lapack_lite
+        # is being used to numpy.__config__
+        class numpy_linalg_lapack_lite(system_info):
+            def calc_info(self):
+                info = {'language': 'c'}
+                if sys.maxsize > 2**32:
+                    # Build lapack-lite in 64-bit integer mode.
+                    # The suffix is arbitrary (lapack_lite symbols follow it),
+                    # but use the "64_" convention here.
+                    info['define_macros'] = [
+                        ('HAVE_BLAS_ILP64', None),
+                        ('BLAS_SYMBOL_SUFFIX', '64_')
+                    ]
+                self.set_info(**info)
+
+        lapack_info = numpy_linalg_lapack_lite().get_info(2)
+
+    def get_lapack_lite_sources(ext, build_dir):
+        if use_lapack_lite:
+            print("### Warning:  Using unoptimized lapack ###")
+            return all_sources
+        else:
+            if sys.platform == 'win32':
+                print("### Warning:  python_xerbla.c is disabled ###")
+                return []
+            return [all_sources[0]]
+
+    config.add_extension(
+        'lapack_lite',
+        sources=['lapack_litemodule.c', get_lapack_lite_sources],
+        depends=['lapack_lite/f2c.h'],
+        extra_info=lapack_info,
+    )
+
+    # umath_linalg module
+    config.add_extension(
+        '_umath_linalg',
+        sources=['umath_linalg.c.src', get_lapack_lite_sources],
+        depends=['lapack_lite/f2c.h'],
+        extra_info=lapack_info,
+        libraries=['npymath'],
+    )
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__init__.py b/venv/Lib/site-packages/numpy/linalg/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..926eccfae
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_build.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_build.cpython-36.pyc
new file mode 100644
index 000000000..f078ead60
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_build.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_deprecations.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_deprecations.cpython-36.pyc
new file mode 100644
index 000000000..ca42f6e43
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_deprecations.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_linalg.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_linalg.cpython-36.pyc
new file mode 100644
index 000000000..278b3b805
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_linalg.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..77d664d40
Binary files /dev/null and b/venv/Lib/site-packages/numpy/linalg/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/test_build.py b/venv/Lib/site-packages/numpy/linalg/tests/test_build.py
new file mode 100644
index 000000000..cbf3089bc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/tests/test_build.py
@@ -0,0 +1,53 @@
+from subprocess import PIPE, Popen
+import sys
+import re
+import pytest
+
+from numpy.linalg import lapack_lite
+from numpy.testing import assert_
+
+
+class FindDependenciesLdd:
+
+    def __init__(self):
+        self.cmd = ['ldd']
+
+        try:
+            p = Popen(self.cmd, stdout=PIPE, stderr=PIPE)
+            stdout, stderr = p.communicate()
+        except OSError:
+            raise RuntimeError("command %s cannot be run" % self.cmd)
+
+    def get_dependencies(self, lfile):
+        p = Popen(self.cmd + [lfile], stdout=PIPE, stderr=PIPE)
+        stdout, stderr = p.communicate()
+        if not (p.returncode == 0):
+            raise RuntimeError("failed dependencies check for %s" % lfile)
+
+        return stdout
+
+    def grep_dependencies(self, lfile, deps):
+        stdout = self.get_dependencies(lfile)
+
+        rdeps = dict([(dep, re.compile(dep)) for dep in deps])
+        founds = []
+        for l in stdout.splitlines():
+            for k, v in rdeps.items():
+                if v.search(l):
+                    founds.append(k)
+
+        return founds
+
+
+class TestF77Mismatch:
+
+    @pytest.mark.skipif(not(sys.platform[:5] == 'linux'),
+                        reason="no fortran compiler on non-Linux platform")
+    def test_lapack(self):
+        f = FindDependenciesLdd()
+        deps = f.grep_dependencies(lapack_lite.__file__,
+                                   [b'libg2c', b'libgfortran'])
+        assert_(len(deps) <= 1,
+                         """Both g77 and gfortran runtimes linked in lapack_lite ! This is likely to
+cause random crashes and wrong results. See numpy INSTALL.txt for more
+information.""")
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/test_deprecations.py b/venv/Lib/site-packages/numpy/linalg/tests/test_deprecations.py
new file mode 100644
index 000000000..cd4c10832
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/tests/test_deprecations.py
@@ -0,0 +1,20 @@
+"""Test deprecation and future warnings.
+
+"""
+import numpy as np
+from numpy.testing import assert_warns
+
+
+def test_qr_mode_full_future_warning():
+    """Check mode='full' FutureWarning.
+
+    In numpy 1.8 the mode options 'full' and 'economic' in linalg.qr were
+    deprecated. The release date will probably be sometime in the summer
+    of 2013.
+
+    """
+    a = np.eye(2)
+    assert_warns(DeprecationWarning, np.linalg.qr, a, mode='full')
+    assert_warns(DeprecationWarning, np.linalg.qr, a, mode='f')
+    assert_warns(DeprecationWarning, np.linalg.qr, a, mode='economic')
+    assert_warns(DeprecationWarning, np.linalg.qr, a, mode='e')
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/test_linalg.py b/venv/Lib/site-packages/numpy/linalg/tests/test_linalg.py
new file mode 100644
index 000000000..3f3bf9f70
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/tests/test_linalg.py
@@ -0,0 +1,2089 @@
+""" Test functions for linalg module
+
+"""
+import os
+import sys
+import itertools
+import traceback
+import textwrap
+import subprocess
+import pytest
+
+import numpy as np
+from numpy import array, single, double, csingle, cdouble, dot, identity, matmul
+from numpy import multiply, atleast_2d, inf, asarray
+from numpy import linalg
+from numpy.linalg import matrix_power, norm, matrix_rank, multi_dot, LinAlgError
+from numpy.linalg.linalg import _multi_dot_matrix_chain_order
+from numpy.testing import (
+    assert_, assert_equal, assert_raises, assert_array_equal,
+    assert_almost_equal, assert_allclose, suppress_warnings,
+    assert_raises_regex, HAS_LAPACK64,
+    )
+from numpy.testing._private.utils import requires_memory
+
+
+def consistent_subclass(out, in_):
+    # For ndarray subclass input, our output should have the same subclass
+    # (non-ndarray input gets converted to ndarray).
+    return type(out) is (type(in_) if isinstance(in_, np.ndarray)
+                         else np.ndarray)
+
+
+old_assert_almost_equal = assert_almost_equal
+
+
+def assert_almost_equal(a, b, single_decimal=6, double_decimal=12, **kw):
+    if asarray(a).dtype.type in (single, csingle):
+        decimal = single_decimal
+    else:
+        decimal = double_decimal
+    old_assert_almost_equal(a, b, decimal=decimal, **kw)
+
+
+def get_real_dtype(dtype):
+    return {single: single, double: double,
+            csingle: single, cdouble: double}[dtype]
+
+
+def get_complex_dtype(dtype):
+    return {single: csingle, double: cdouble,
+            csingle: csingle, cdouble: cdouble}[dtype]
+
+
+def get_rtol(dtype):
+    # Choose a safe rtol
+    if dtype in (single, csingle):
+        return 1e-5
+    else:
+        return 1e-11
+
+
+# used to categorize tests
+all_tags = {
+  'square', 'nonsquare', 'hermitian',  # mutually exclusive
+  'generalized', 'size-0', 'strided' # optional additions
+}
+
+
+class LinalgCase:
+    def __init__(self, name, a, b, tags=set()):
+        """
+        A bundle of arguments to be passed to a test case, with an identifying
+        name, the operands a and b, and a set of tags to filter the tests
+        """
+        assert_(isinstance(name, str))
+        self.name = name
+        self.a = a
+        self.b = b
+        self.tags = frozenset(tags)  # prevent shared tags
+
+    def check(self, do):
+        """
+        Run the function `do` on this test case, expanding arguments
+        """
+        do(self.a, self.b, tags=self.tags)
+
+    def __repr__(self):
+        return "<LinalgCase: %s>" % (self.name,)
+
+
+def apply_tag(tag, cases):
+    """
+    Add the given tag (a string) to each of the cases (a list of LinalgCase
+    objects)
+    """
+    assert tag in all_tags, "Invalid tag"
+    for case in cases:
+        case.tags = case.tags | {tag}
+    return cases
+
+
+#
+# Base test cases
+#
+
+np.random.seed(1234)
+
+CASES = []
+
+# square test cases
+CASES += apply_tag('square', [
+    LinalgCase("single",
+               array([[1., 2.], [3., 4.]], dtype=single),
+               array([2., 1.], dtype=single)),
+    LinalgCase("double",
+               array([[1., 2.], [3., 4.]], dtype=double),
+               array([2., 1.], dtype=double)),
+    LinalgCase("double_2",
+               array([[1., 2.], [3., 4.]], dtype=double),
+               array([[2., 1., 4.], [3., 4., 6.]], dtype=double)),
+    LinalgCase("csingle",
+               array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=csingle),
+               array([2. + 1j, 1. + 2j], dtype=csingle)),
+    LinalgCase("cdouble",
+               array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=cdouble),
+               array([2. + 1j, 1. + 2j], dtype=cdouble)),
+    LinalgCase("cdouble_2",
+               array([[1. + 2j, 2 + 3j], [3 + 4j, 4 + 5j]], dtype=cdouble),
+               array([[2. + 1j, 1. + 2j, 1 + 3j], [1 - 2j, 1 - 3j, 1 - 6j]], dtype=cdouble)),
+    LinalgCase("0x0",
+               np.empty((0, 0), dtype=double),
+               np.empty((0,), dtype=double),
+               tags={'size-0'}),
+    LinalgCase("8x8",
+               np.random.rand(8, 8),
+               np.random.rand(8)),
+    LinalgCase("1x1",
+               np.random.rand(1, 1),
+               np.random.rand(1)),
+    LinalgCase("nonarray",
+               [[1, 2], [3, 4]],
+               [2, 1]),
+])
+
+# non-square test-cases
+CASES += apply_tag('nonsquare', [
+    LinalgCase("single_nsq_1",
+               array([[1., 2., 3.], [3., 4., 6.]], dtype=single),
+               array([2., 1.], dtype=single)),
+    LinalgCase("single_nsq_2",
+               array([[1., 2.], [3., 4.], [5., 6.]], dtype=single),
+               array([2., 1., 3.], dtype=single)),
+    LinalgCase("double_nsq_1",
+               array([[1., 2., 3.], [3., 4., 6.]], dtype=double),
+               array([2., 1.], dtype=double)),
+    LinalgCase("double_nsq_2",
+               array([[1., 2.], [3., 4.], [5., 6.]], dtype=double),
+               array([2., 1., 3.], dtype=double)),
+    LinalgCase("csingle_nsq_1",
+               array(
+                   [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=csingle),
+               array([2. + 1j, 1. + 2j], dtype=csingle)),
+    LinalgCase("csingle_nsq_2",
+               array(
+                   [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=csingle),
+               array([2. + 1j, 1. + 2j, 3. - 3j], dtype=csingle)),
+    LinalgCase("cdouble_nsq_1",
+               array(
+                   [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=cdouble),
+               array([2. + 1j, 1. + 2j], dtype=cdouble)),
+    LinalgCase("cdouble_nsq_2",
+               array(
+                   [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=cdouble),
+               array([2. + 1j, 1. + 2j, 3. - 3j], dtype=cdouble)),
+    LinalgCase("cdouble_nsq_1_2",
+               array(
+                   [[1. + 1j, 2. + 2j, 3. - 3j], [3. - 5j, 4. + 9j, 6. + 2j]], dtype=cdouble),
+               array([[2. + 1j, 1. + 2j], [1 - 1j, 2 - 2j]], dtype=cdouble)),
+    LinalgCase("cdouble_nsq_2_2",
+               array(
+                   [[1. + 1j, 2. + 2j], [3. - 3j, 4. - 9j], [5. - 4j, 6. + 8j]], dtype=cdouble),
+               array([[2. + 1j, 1. + 2j], [1 - 1j, 2 - 2j], [1 - 1j, 2 - 2j]], dtype=cdouble)),
+    LinalgCase("8x11",
+               np.random.rand(8, 11),
+               np.random.rand(8)),
+    LinalgCase("1x5",
+               np.random.rand(1, 5),
+               np.random.rand(1)),
+    LinalgCase("5x1",
+               np.random.rand(5, 1),
+               np.random.rand(5)),
+    LinalgCase("0x4",
+               np.random.rand(0, 4),
+               np.random.rand(0),
+               tags={'size-0'}),
+    LinalgCase("4x0",
+               np.random.rand(4, 0),
+               np.random.rand(4),
+               tags={'size-0'}),
+])
+
+# hermitian test-cases
+CASES += apply_tag('hermitian', [
+    LinalgCase("hsingle",
+               array([[1., 2.], [2., 1.]], dtype=single),
+               None),
+    LinalgCase("hdouble",
+               array([[1., 2.], [2., 1.]], dtype=double),
+               None),
+    LinalgCase("hcsingle",
+               array([[1., 2 + 3j], [2 - 3j, 1]], dtype=csingle),
+               None),
+    LinalgCase("hcdouble",
+               array([[1., 2 + 3j], [2 - 3j, 1]], dtype=cdouble),
+               None),
+    LinalgCase("hempty",
+               np.empty((0, 0), dtype=double),
+               None,
+               tags={'size-0'}),
+    LinalgCase("hnonarray",
+               [[1, 2], [2, 1]],
+               None),
+    LinalgCase("matrix_b_only",
+               array([[1., 2.], [2., 1.]]),
+               None),
+    LinalgCase("hmatrix_1x1",
+               np.random.rand(1, 1),
+               None),
+])
+
+
+#
+# Gufunc test cases
+#
+def _make_generalized_cases():
+    new_cases = []
+
+    for case in CASES:
+        if not isinstance(case.a, np.ndarray):
+            continue
+
+        a = np.array([case.a, 2 * case.a, 3 * case.a])
+        if case.b is None:
+            b = None
+        else:
+            b = np.array([case.b, 7 * case.b, 6 * case.b])
+        new_case = LinalgCase(case.name + "_tile3", a, b,
+                              tags=case.tags | {'generalized'})
+        new_cases.append(new_case)
+
+        a = np.array([case.a] * 2 * 3).reshape((3, 2) + case.a.shape)
+        if case.b is None:
+            b = None
+        else:
+            b = np.array([case.b] * 2 * 3).reshape((3, 2) + case.b.shape)
+        new_case = LinalgCase(case.name + "_tile213", a, b,
+                              tags=case.tags | {'generalized'})
+        new_cases.append(new_case)
+
+    return new_cases
+
+
+CASES += _make_generalized_cases()
+
+
+#
+# Generate stride combination variations of the above
+#
+def _stride_comb_iter(x):
+    """
+    Generate cartesian product of strides for all axes
+    """
+
+    if not isinstance(x, np.ndarray):
+        yield x, "nop"
+        return
+
+    stride_set = [(1,)] * x.ndim
+    stride_set[-1] = (1, 3, -4)
+    if x.ndim > 1:
+        stride_set[-2] = (1, 3, -4)
+    if x.ndim > 2:
+        stride_set[-3] = (1, -4)
+
+    for repeats in itertools.product(*tuple(stride_set)):
+        new_shape = [abs(a * b) for a, b in zip(x.shape, repeats)]
+        slices = tuple([slice(None, None, repeat) for repeat in repeats])
+
+        # new array with different strides, but same data
+        xi = np.empty(new_shape, dtype=x.dtype)
+        xi.view(np.uint32).fill(0xdeadbeef)
+        xi = xi[slices]
+        xi[...] = x
+        xi = xi.view(x.__class__)
+        assert_(np.all(xi == x))
+        yield xi, "stride_" + "_".join(["%+d" % j for j in repeats])
+
+        # generate also zero strides if possible
+        if x.ndim >= 1 and x.shape[-1] == 1:
+            s = list(x.strides)
+            s[-1] = 0
+            xi = np.lib.stride_tricks.as_strided(x, strides=s)
+            yield xi, "stride_xxx_0"
+        if x.ndim >= 2 and x.shape[-2] == 1:
+            s = list(x.strides)
+            s[-2] = 0
+            xi = np.lib.stride_tricks.as_strided(x, strides=s)
+            yield xi, "stride_xxx_0_x"
+        if x.ndim >= 2 and x.shape[:-2] == (1, 1):
+            s = list(x.strides)
+            s[-1] = 0
+            s[-2] = 0
+            xi = np.lib.stride_tricks.as_strided(x, strides=s)
+            yield xi, "stride_xxx_0_0"
+
+
+def _make_strided_cases():
+    new_cases = []
+    for case in CASES:
+        for a, a_label in _stride_comb_iter(case.a):
+            for b, b_label in _stride_comb_iter(case.b):
+                new_case = LinalgCase(case.name + "_" + a_label + "_" + b_label, a, b,
+                                      tags=case.tags | {'strided'})
+                new_cases.append(new_case)
+    return new_cases
+
+
+CASES += _make_strided_cases()
+
+
+#
+# Test different routines against the above cases
+#
+class LinalgTestCase:
+    TEST_CASES = CASES
+
+    def check_cases(self, require=set(), exclude=set()):
+        """
+        Run func on each of the cases with all of the tags in require, and none
+        of the tags in exclude
+        """
+        for case in self.TEST_CASES:
+            # filter by require and exclude
+            if case.tags & require != require:
+                continue
+            if case.tags & exclude:
+                continue
+
+            try:
+                case.check(self.do)
+            except Exception:
+                msg = "In test case: %r\n\n" % case
+                msg += traceback.format_exc()
+                raise AssertionError(msg)
+
+
+class LinalgSquareTestCase(LinalgTestCase):
+
+    def test_sq_cases(self):
+        self.check_cases(require={'square'},
+                         exclude={'generalized', 'size-0'})
+
+    def test_empty_sq_cases(self):
+        self.check_cases(require={'square', 'size-0'},
+                         exclude={'generalized'})
+
+
+class LinalgNonsquareTestCase(LinalgTestCase):
+
+    def test_nonsq_cases(self):
+        self.check_cases(require={'nonsquare'},
+                         exclude={'generalized', 'size-0'})
+
+    def test_empty_nonsq_cases(self):
+        self.check_cases(require={'nonsquare', 'size-0'},
+                         exclude={'generalized'})
+
+
+class HermitianTestCase(LinalgTestCase):
+
+    def test_herm_cases(self):
+        self.check_cases(require={'hermitian'},
+                         exclude={'generalized', 'size-0'})
+
+    def test_empty_herm_cases(self):
+        self.check_cases(require={'hermitian', 'size-0'},
+                         exclude={'generalized'})
+
+
+class LinalgGeneralizedSquareTestCase(LinalgTestCase):
+
+    @pytest.mark.slow
+    def test_generalized_sq_cases(self):
+        self.check_cases(require={'generalized', 'square'},
+                         exclude={'size-0'})
+
+    @pytest.mark.slow
+    def test_generalized_empty_sq_cases(self):
+        self.check_cases(require={'generalized', 'square', 'size-0'})
+
+
+class LinalgGeneralizedNonsquareTestCase(LinalgTestCase):
+
+    @pytest.mark.slow
+    def test_generalized_nonsq_cases(self):
+        self.check_cases(require={'generalized', 'nonsquare'},
+                         exclude={'size-0'})
+
+    @pytest.mark.slow
+    def test_generalized_empty_nonsq_cases(self):
+        self.check_cases(require={'generalized', 'nonsquare', 'size-0'})
+
+
+class HermitianGeneralizedTestCase(LinalgTestCase):
+
+    @pytest.mark.slow
+    def test_generalized_herm_cases(self):
+        self.check_cases(require={'generalized', 'hermitian'},
+                         exclude={'size-0'})
+
+    @pytest.mark.slow
+    def test_generalized_empty_herm_cases(self):
+        self.check_cases(require={'generalized', 'hermitian', 'size-0'},
+                         exclude={'none'})
+
+
+def dot_generalized(a, b):
+    a = asarray(a)
+    if a.ndim >= 3:
+        if a.ndim == b.ndim:
+            # matrix x matrix
+            new_shape = a.shape[:-1] + b.shape[-1:]
+        elif a.ndim == b.ndim + 1:
+            # matrix x vector
+            new_shape = a.shape[:-1]
+        else:
+            raise ValueError("Not implemented...")
+        r = np.empty(new_shape, dtype=np.common_type(a, b))
+        for c in itertools.product(*map(range, a.shape[:-2])):
+            r[c] = dot(a[c], b[c])
+        return r
+    else:
+        return dot(a, b)
+
+
+def identity_like_generalized(a):
+    a = asarray(a)
+    if a.ndim >= 3:
+        r = np.empty(a.shape, dtype=a.dtype)
+        r[...] = identity(a.shape[-2])
+        return r
+    else:
+        return identity(a.shape[0])
+
+
+class SolveCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+    # kept apart from TestSolve for use for testing with matrices.
+    def do(self, a, b, tags):
+        x = linalg.solve(a, b)
+        assert_almost_equal(b, dot_generalized(a, x))
+        assert_(consistent_subclass(x, b))
+
+
+class TestSolve(SolveCases):
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        assert_equal(linalg.solve(x, x).dtype, dtype)
+
+    def test_0_size(self):
+        class ArraySubclass(np.ndarray):
+            pass
+        # Test system of 0x0 matrices
+        a = np.arange(8).reshape(2, 2, 2)
+        b = np.arange(6).reshape(1, 2, 3).view(ArraySubclass)
+
+        expected = linalg.solve(a, b)[:, 0:0, :]
+        result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0, :])
+        assert_array_equal(result, expected)
+        assert_(isinstance(result, ArraySubclass))
+
+        # Test errors for non-square and only b's dimension being 0
+        assert_raises(linalg.LinAlgError, linalg.solve, a[:, 0:0, 0:1], b)
+        assert_raises(ValueError, linalg.solve, a, b[:, 0:0, :])
+
+        # Test broadcasting error
+        b = np.arange(6).reshape(1, 3, 2)  # broadcasting error
+        assert_raises(ValueError, linalg.solve, a, b)
+        assert_raises(ValueError, linalg.solve, a[0:0], b[0:0])
+
+        # Test zero "single equations" with 0x0 matrices.
+        b = np.arange(2).reshape(1, 2).view(ArraySubclass)
+        expected = linalg.solve(a, b)[:, 0:0]
+        result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0])
+        assert_array_equal(result, expected)
+        assert_(isinstance(result, ArraySubclass))
+
+        b = np.arange(3).reshape(1, 3)
+        assert_raises(ValueError, linalg.solve, a, b)
+        assert_raises(ValueError, linalg.solve, a[0:0], b[0:0])
+        assert_raises(ValueError, linalg.solve, a[:, 0:0, 0:0], b)
+
+    def test_0_size_k(self):
+        # test zero multiple equation (K=0) case.
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.arange(4).reshape(1, 2, 2)
+        b = np.arange(6).reshape(3, 2, 1).view(ArraySubclass)
+
+        expected = linalg.solve(a, b)[:, :, 0:0]
+        result = linalg.solve(a, b[:, :, 0:0])
+        assert_array_equal(result, expected)
+        assert_(isinstance(result, ArraySubclass))
+
+        # test both zero.
+        expected = linalg.solve(a, b)[:, 0:0, 0:0]
+        result = linalg.solve(a[:, 0:0, 0:0], b[:, 0:0, 0:0])
+        assert_array_equal(result, expected)
+        assert_(isinstance(result, ArraySubclass))
+
+
+class InvCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+
+    def do(self, a, b, tags):
+        a_inv = linalg.inv(a)
+        assert_almost_equal(dot_generalized(a, a_inv),
+                            identity_like_generalized(a))
+        assert_(consistent_subclass(a_inv, a))
+
+
+class TestInv(InvCases):
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        assert_equal(linalg.inv(x).dtype, dtype)
+
+    def test_0_size(self):
+        # Check that all kinds of 0-sized arrays work
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res = linalg.inv(a)
+        assert_(res.dtype.type is np.float64)
+        assert_equal(a.shape, res.shape)
+        assert_(isinstance(res, ArraySubclass))
+
+        a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)
+        res = linalg.inv(a)
+        assert_(res.dtype.type is np.complex64)
+        assert_equal(a.shape, res.shape)
+        assert_(isinstance(res, ArraySubclass))
+
+
+class EigvalsCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+
+    def do(self, a, b, tags):
+        ev = linalg.eigvals(a)
+        evalues, evectors = linalg.eig(a)
+        assert_almost_equal(ev, evalues)
+
+
+class TestEigvals(EigvalsCases):
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        assert_equal(linalg.eigvals(x).dtype, dtype)
+        x = np.array([[1, 0.5], [-1, 1]], dtype=dtype)
+        assert_equal(linalg.eigvals(x).dtype, get_complex_dtype(dtype))
+
+    def test_0_size(self):
+        # Check that all kinds of 0-sized arrays work
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res = linalg.eigvals(a)
+        assert_(res.dtype.type is np.float64)
+        assert_equal((0, 1), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(res, np.ndarray))
+
+        a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)
+        res = linalg.eigvals(a)
+        assert_(res.dtype.type is np.complex64)
+        assert_equal((0,), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(res, np.ndarray))
+
+
+class EigCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+
+    def do(self, a, b, tags):
+        evalues, evectors = linalg.eig(a)
+        assert_allclose(dot_generalized(a, evectors),
+                        np.asarray(evectors) * np.asarray(evalues)[..., None, :],
+                        rtol=get_rtol(evalues.dtype))
+        assert_(consistent_subclass(evectors, a))
+
+
+class TestEig(EigCases):
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        w, v = np.linalg.eig(x)
+        assert_equal(w.dtype, dtype)
+        assert_equal(v.dtype, dtype)
+
+        x = np.array([[1, 0.5], [-1, 1]], dtype=dtype)
+        w, v = np.linalg.eig(x)
+        assert_equal(w.dtype, get_complex_dtype(dtype))
+        assert_equal(v.dtype, get_complex_dtype(dtype))
+
+    def test_0_size(self):
+        # Check that all kinds of 0-sized arrays work
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res, res_v = linalg.eig(a)
+        assert_(res_v.dtype.type is np.float64)
+        assert_(res.dtype.type is np.float64)
+        assert_equal(a.shape, res_v.shape)
+        assert_equal((0, 1), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(a, np.ndarray))
+
+        a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)
+        res, res_v = linalg.eig(a)
+        assert_(res_v.dtype.type is np.complex64)
+        assert_(res.dtype.type is np.complex64)
+        assert_equal(a.shape, res_v.shape)
+        assert_equal((0,), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(a, np.ndarray))
+
+
+class SVDBaseTests:
+    hermitian = False
+
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        u, s, vh = linalg.svd(x)
+        assert_equal(u.dtype, dtype)
+        assert_equal(s.dtype, get_real_dtype(dtype))
+        assert_equal(vh.dtype, dtype)
+        s = linalg.svd(x, compute_uv=False, hermitian=self.hermitian)
+        assert_equal(s.dtype, get_real_dtype(dtype))
+
+
+class SVDCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+
+    def do(self, a, b, tags):
+        u, s, vt = linalg.svd(a, False)
+        assert_allclose(a, dot_generalized(np.asarray(u) * np.asarray(s)[..., None, :],
+                                           np.asarray(vt)),
+                        rtol=get_rtol(u.dtype))
+        assert_(consistent_subclass(u, a))
+        assert_(consistent_subclass(vt, a))
+
+
+class TestSVD(SVDCases, SVDBaseTests):
+    def test_empty_identity(self):
+        """ Empty input should put an identity matrix in u or vh """
+        x = np.empty((4, 0))
+        u, s, vh = linalg.svd(x, compute_uv=True, hermitian=self.hermitian)
+        assert_equal(u.shape, (4, 4))
+        assert_equal(vh.shape, (0, 0))
+        assert_equal(u, np.eye(4))
+
+        x = np.empty((0, 4))
+        u, s, vh = linalg.svd(x, compute_uv=True, hermitian=self.hermitian)
+        assert_equal(u.shape, (0, 0))
+        assert_equal(vh.shape, (4, 4))
+        assert_equal(vh, np.eye(4))
+
+
+class SVDHermitianCases(HermitianTestCase, HermitianGeneralizedTestCase):
+
+    def do(self, a, b, tags):
+        u, s, vt = linalg.svd(a, False, hermitian=True)
+        assert_allclose(a, dot_generalized(np.asarray(u) * np.asarray(s)[..., None, :],
+                                           np.asarray(vt)),
+                        rtol=get_rtol(u.dtype))
+        def hermitian(mat):
+            axes = list(range(mat.ndim))
+            axes[-1], axes[-2] = axes[-2], axes[-1]
+            return np.conj(np.transpose(mat, axes=axes))
+        
+        assert_almost_equal(np.matmul(u, hermitian(u)), np.broadcast_to(np.eye(u.shape[-1]), u.shape))
+        assert_almost_equal(np.matmul(vt, hermitian(vt)), np.broadcast_to(np.eye(vt.shape[-1]), vt.shape))
+        assert_equal(np.sort(s)[..., ::-1], s)
+        assert_(consistent_subclass(u, a))
+        assert_(consistent_subclass(vt, a))
+
+
+class TestSVDHermitian(SVDHermitianCases, SVDBaseTests):
+    hermitian = True
+
+
+class CondCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+    # cond(x, p) for p in (None, 2, -2)
+
+    def do(self, a, b, tags):
+        c = asarray(a)  # a might be a matrix
+        if 'size-0' in tags:
+            assert_raises(LinAlgError, linalg.cond, c)
+            return
+
+        # +-2 norms
+        s = linalg.svd(c, compute_uv=False)
+        assert_almost_equal(
+            linalg.cond(a), s[..., 0] / s[..., -1],
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, 2), s[..., 0] / s[..., -1],
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, -2), s[..., -1] / s[..., 0],
+            single_decimal=5, double_decimal=11)
+
+        # Other norms
+        cinv = np.linalg.inv(c)
+        assert_almost_equal(
+            linalg.cond(a, 1),
+            abs(c).sum(-2).max(-1) * abs(cinv).sum(-2).max(-1),
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, -1),
+            abs(c).sum(-2).min(-1) * abs(cinv).sum(-2).min(-1),
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, np.inf),
+            abs(c).sum(-1).max(-1) * abs(cinv).sum(-1).max(-1),
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, -np.inf),
+            abs(c).sum(-1).min(-1) * abs(cinv).sum(-1).min(-1),
+            single_decimal=5, double_decimal=11)
+        assert_almost_equal(
+            linalg.cond(a, 'fro'),
+            np.sqrt((abs(c)**2).sum(-1).sum(-1)
+                    * (abs(cinv)**2).sum(-1).sum(-1)),
+            single_decimal=5, double_decimal=11)
+
+
+class TestCond(CondCases):
+    def test_basic_nonsvd(self):
+        # Smoketest the non-svd norms
+        A = array([[1., 0, 1], [0, -2., 0], [0, 0, 3.]])
+        assert_almost_equal(linalg.cond(A, inf), 4)
+        assert_almost_equal(linalg.cond(A, -inf), 2/3)
+        assert_almost_equal(linalg.cond(A, 1), 4)
+        assert_almost_equal(linalg.cond(A, -1), 0.5)
+        assert_almost_equal(linalg.cond(A, 'fro'), np.sqrt(265 / 12))
+
+    def test_singular(self):
+        # Singular matrices have infinite condition number for
+        # positive norms, and negative norms shouldn't raise
+        # exceptions
+        As = [np.zeros((2, 2)), np.ones((2, 2))]
+        p_pos = [None, 1, 2, 'fro']
+        p_neg = [-1, -2]
+        for A, p in itertools.product(As, p_pos):
+            # Inversion may not hit exact infinity, so just check the
+            # number is large
+            assert_(linalg.cond(A, p) > 1e15)
+        for A, p in itertools.product(As, p_neg):
+            linalg.cond(A, p)
+
+    def test_nan(self):
+        # nans should be passed through, not converted to infs
+        ps = [None, 1, -1, 2, -2, 'fro']
+        p_pos = [None, 1, 2, 'fro']
+
+        A = np.ones((2, 2))
+        A[0,1] = np.nan
+        for p in ps:
+            c = linalg.cond(A, p)
+            assert_(isinstance(c, np.float_))
+            assert_(np.isnan(c))
+
+        A = np.ones((3, 2, 2))
+        A[1,0,1] = np.nan
+        for p in ps:
+            c = linalg.cond(A, p)
+            assert_(np.isnan(c[1]))
+            if p in p_pos:
+                assert_(c[0] > 1e15)
+                assert_(c[2] > 1e15)
+            else:
+                assert_(not np.isnan(c[0]))
+                assert_(not np.isnan(c[2]))
+
+    def test_stacked_singular(self):
+        # Check behavior when only some of the stacked matrices are
+        # singular
+        np.random.seed(1234)
+        A = np.random.rand(2, 2, 2, 2)
+        A[0,0] = 0
+        A[1,1] = 0
+
+        for p in (None, 1, 2, 'fro', -1, -2):
+            c = linalg.cond(A, p)
+            assert_equal(c[0,0], np.inf)
+            assert_equal(c[1,1], np.inf)
+            assert_(np.isfinite(c[0,1]))
+            assert_(np.isfinite(c[1,0]))
+
+
+class PinvCases(LinalgSquareTestCase,
+                LinalgNonsquareTestCase,
+                LinalgGeneralizedSquareTestCase,
+                LinalgGeneralizedNonsquareTestCase):
+
+    def do(self, a, b, tags):
+        a_ginv = linalg.pinv(a)
+        # `a @ a_ginv == I` does not hold if a is singular
+        dot = dot_generalized
+        assert_almost_equal(dot(dot(a, a_ginv), a), a, single_decimal=5, double_decimal=11)
+        assert_(consistent_subclass(a_ginv, a))
+
+
+class TestPinv(PinvCases):
+    pass
+
+
+class PinvHermitianCases(HermitianTestCase, HermitianGeneralizedTestCase):
+
+    def do(self, a, b, tags):
+        a_ginv = linalg.pinv(a, hermitian=True)
+        # `a @ a_ginv == I` does not hold if a is singular
+        dot = dot_generalized
+        assert_almost_equal(dot(dot(a, a_ginv), a), a, single_decimal=5, double_decimal=11)
+        assert_(consistent_subclass(a_ginv, a))
+
+
+class TestPinvHermitian(PinvHermitianCases):
+    pass
+
+
+class DetCases(LinalgSquareTestCase, LinalgGeneralizedSquareTestCase):
+
+    def do(self, a, b, tags):
+        d = linalg.det(a)
+        (s, ld) = linalg.slogdet(a)
+        if asarray(a).dtype.type in (single, double):
+            ad = asarray(a).astype(double)
+        else:
+            ad = asarray(a).astype(cdouble)
+        ev = linalg.eigvals(ad)
+        assert_almost_equal(d, multiply.reduce(ev, axis=-1))
+        assert_almost_equal(s * np.exp(ld), multiply.reduce(ev, axis=-1))
+
+        s = np.atleast_1d(s)
+        ld = np.atleast_1d(ld)
+        m = (s != 0)
+        assert_almost_equal(np.abs(s[m]), 1)
+        assert_equal(ld[~m], -inf)
+
+
+class TestDet(DetCases):
+    def test_zero(self):
+        assert_equal(linalg.det([[0.0]]), 0.0)
+        assert_equal(type(linalg.det([[0.0]])), double)
+        assert_equal(linalg.det([[0.0j]]), 0.0)
+        assert_equal(type(linalg.det([[0.0j]])), cdouble)
+
+        assert_equal(linalg.slogdet([[0.0]]), (0.0, -inf))
+        assert_equal(type(linalg.slogdet([[0.0]])[0]), double)
+        assert_equal(type(linalg.slogdet([[0.0]])[1]), double)
+        assert_equal(linalg.slogdet([[0.0j]]), (0.0j, -inf))
+        assert_equal(type(linalg.slogdet([[0.0j]])[0]), cdouble)
+        assert_equal(type(linalg.slogdet([[0.0j]])[1]), double)
+
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        assert_equal(np.linalg.det(x).dtype, dtype)
+        ph, s = np.linalg.slogdet(x)
+        assert_equal(s.dtype, get_real_dtype(dtype))
+        assert_equal(ph.dtype, dtype)
+
+    def test_0_size(self):
+        a = np.zeros((0, 0), dtype=np.complex64)
+        res = linalg.det(a)
+        assert_equal(res, 1.)
+        assert_(res.dtype.type is np.complex64)
+        res = linalg.slogdet(a)
+        assert_equal(res, (1, 0))
+        assert_(res[0].dtype.type is np.complex64)
+        assert_(res[1].dtype.type is np.float32)
+
+        a = np.zeros((0, 0), dtype=np.float64)
+        res = linalg.det(a)
+        assert_equal(res, 1.)
+        assert_(res.dtype.type is np.float64)
+        res = linalg.slogdet(a)
+        assert_equal(res, (1, 0))
+        assert_(res[0].dtype.type is np.float64)
+        assert_(res[1].dtype.type is np.float64)
+
+
+class LstsqCases(LinalgSquareTestCase, LinalgNonsquareTestCase):
+
+    def do(self, a, b, tags):
+        arr = np.asarray(a)
+        m, n = arr.shape
+        u, s, vt = linalg.svd(a, False)
+        x, residuals, rank, sv = linalg.lstsq(a, b, rcond=-1)
+        if m == 0:
+            assert_((x == 0).all())
+        if m <= n:
+            assert_almost_equal(b, dot(a, x))
+            assert_equal(rank, m)
+        else:
+            assert_equal(rank, n)
+        assert_almost_equal(sv, sv.__array_wrap__(s))
+        if rank == n and m > n:
+            expect_resids = (
+                np.asarray(abs(np.dot(a, x) - b)) ** 2).sum(axis=0)
+            expect_resids = np.asarray(expect_resids)
+            if np.asarray(b).ndim == 1:
+                expect_resids.shape = (1,)
+                assert_equal(residuals.shape, expect_resids.shape)
+        else:
+            expect_resids = np.array([]).view(type(x))
+        assert_almost_equal(residuals, expect_resids)
+        assert_(np.issubdtype(residuals.dtype, np.floating))
+        assert_(consistent_subclass(x, b))
+        assert_(consistent_subclass(residuals, b))
+
+
+class TestLstsq(LstsqCases):
+    def test_future_rcond(self):
+        a = np.array([[0., 1.,  0.,  1.,  2.,  0.],
+                      [0., 2.,  0.,  0.,  1.,  0.],
+                      [1., 0.,  1.,  0.,  0.,  4.],
+                      [0., 0.,  0.,  2.,  3.,  0.]]).T
+
+        b = np.array([1, 0, 0, 0, 0, 0])
+        with suppress_warnings() as sup:
+            w = sup.record(FutureWarning, "`rcond` parameter will change")
+            x, residuals, rank, s = linalg.lstsq(a, b)
+            assert_(rank == 4)
+            x, residuals, rank, s = linalg.lstsq(a, b, rcond=-1)
+            assert_(rank == 4)
+            x, residuals, rank, s = linalg.lstsq(a, b, rcond=None)
+            assert_(rank == 3)
+            # Warning should be raised exactly once (first command)
+            assert_(len(w) == 1)
+
+    @pytest.mark.parametrize(["m", "n", "n_rhs"], [
+        (4, 2, 2),
+        (0, 4, 1),
+        (0, 4, 2),
+        (4, 0, 1),
+        (4, 0, 2),
+        (4, 2, 0),
+        (0, 0, 0)
+    ])
+    def test_empty_a_b(self, m, n, n_rhs):
+        a = np.arange(m * n).reshape(m, n)
+        b = np.ones((m, n_rhs))
+        x, residuals, rank, s = linalg.lstsq(a, b, rcond=None)
+        if m == 0:
+            assert_((x == 0).all())
+        assert_equal(x.shape, (n, n_rhs))
+        assert_equal(residuals.shape, ((n_rhs,) if m > n else (0,)))
+        if m > n and n_rhs > 0:
+            # residuals are exactly the squared norms of b's columns
+            r = b - np.dot(a, x)
+            assert_almost_equal(residuals, (r * r).sum(axis=-2))
+        assert_equal(rank, min(m, n))
+        assert_equal(s.shape, (min(m, n),))
+
+    def test_incompatible_dims(self):
+        # use modified version of docstring example
+        x = np.array([0, 1, 2, 3])
+        y = np.array([-1, 0.2, 0.9, 2.1, 3.3])
+        A = np.vstack([x, np.ones(len(x))]).T
+        with assert_raises_regex(LinAlgError, "Incompatible dimensions"):
+            linalg.lstsq(A, y, rcond=None)
+
+
+@pytest.mark.parametrize('dt', [np.dtype(c) for c in '?bBhHiIqQefdgFDGO']) 
+class TestMatrixPower:
+
+    rshft_0 = np.eye(4)
+    rshft_1 = rshft_0[[3, 0, 1, 2]]
+    rshft_2 = rshft_0[[2, 3, 0, 1]]
+    rshft_3 = rshft_0[[1, 2, 3, 0]]
+    rshft_all = [rshft_0, rshft_1, rshft_2, rshft_3]
+    noninv = array([[1, 0], [0, 0]])
+    stacked = np.block([[[rshft_0]]]*2)
+    #FIXME the 'e' dtype might work in future
+    dtnoinv = [object, np.dtype('e'), np.dtype('g'), np.dtype('G')]
+
+    def test_large_power(self, dt):
+        rshft = self.rshft_1.astype(dt)
+        assert_equal(
+            matrix_power(rshft, 2**100 + 2**10 + 2**5 + 0), self.rshft_0)
+        assert_equal(
+            matrix_power(rshft, 2**100 + 2**10 + 2**5 + 1), self.rshft_1)
+        assert_equal(
+            matrix_power(rshft, 2**100 + 2**10 + 2**5 + 2), self.rshft_2)
+        assert_equal(
+            matrix_power(rshft, 2**100 + 2**10 + 2**5 + 3), self.rshft_3)
+
+    def test_power_is_zero(self, dt):
+        def tz(M):
+            mz = matrix_power(M, 0)
+            assert_equal(mz, identity_like_generalized(M))
+            assert_equal(mz.dtype, M.dtype)
+        
+        for mat in self.rshft_all:
+            tz(mat.astype(dt))
+            if dt != object:
+                tz(self.stacked.astype(dt))
+
+    def test_power_is_one(self, dt):
+        def tz(mat):
+            mz = matrix_power(mat, 1)
+            assert_equal(mz, mat)
+            assert_equal(mz.dtype, mat.dtype)
+
+        for mat in self.rshft_all:
+            tz(mat.astype(dt))
+            if dt != object:
+                tz(self.stacked.astype(dt))
+
+    def test_power_is_two(self, dt):
+        def tz(mat):
+            mz = matrix_power(mat, 2)
+            mmul = matmul if mat.dtype != object else dot
+            assert_equal(mz, mmul(mat, mat))
+            assert_equal(mz.dtype, mat.dtype)
+
+        for mat in self.rshft_all:
+            tz(mat.astype(dt))
+            if dt != object:
+                tz(self.stacked.astype(dt))
+
+    def test_power_is_minus_one(self, dt):
+        def tz(mat):
+            invmat = matrix_power(mat, -1)
+            mmul = matmul if mat.dtype != object else dot
+            assert_almost_equal(
+                mmul(invmat, mat), identity_like_generalized(mat))
+
+        for mat in self.rshft_all:
+            if dt not in self.dtnoinv:
+                tz(mat.astype(dt))
+
+    def test_exceptions_bad_power(self, dt):
+        mat = self.rshft_0.astype(dt)
+        assert_raises(TypeError, matrix_power, mat, 1.5)
+        assert_raises(TypeError, matrix_power, mat, [1])
+
+    def test_exceptions_non_square(self, dt):
+        assert_raises(LinAlgError, matrix_power, np.array([1], dt), 1)
+        assert_raises(LinAlgError, matrix_power, np.array([[1], [2]], dt), 1)
+        assert_raises(LinAlgError, matrix_power, np.ones((4, 3, 2), dt), 1)
+
+    def test_exceptions_not_invertible(self, dt):
+        if dt in self.dtnoinv:
+            return
+        mat = self.noninv.astype(dt)
+        assert_raises(LinAlgError, matrix_power, mat, -1)
+
+
+
+class TestEigvalshCases(HermitianTestCase, HermitianGeneralizedTestCase):
+
+    def do(self, a, b, tags):
+        # note that eigenvalue arrays returned by eig must be sorted since
+        # their order isn't guaranteed.
+        ev = linalg.eigvalsh(a, 'L')
+        evalues, evectors = linalg.eig(a)
+        evalues.sort(axis=-1)
+        assert_allclose(ev, evalues, rtol=get_rtol(ev.dtype))
+
+        ev2 = linalg.eigvalsh(a, 'U')
+        assert_allclose(ev2, evalues, rtol=get_rtol(ev.dtype))
+
+
+class TestEigvalsh:
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        w = np.linalg.eigvalsh(x)
+        assert_equal(w.dtype, get_real_dtype(dtype))
+
+    def test_invalid(self):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=np.float32)
+        assert_raises(ValueError, np.linalg.eigvalsh, x, UPLO="lrong")
+        assert_raises(ValueError, np.linalg.eigvalsh, x, "lower")
+        assert_raises(ValueError, np.linalg.eigvalsh, x, "upper")
+
+    def test_UPLO(self):
+        Klo = np.array([[0, 0], [1, 0]], dtype=np.double)
+        Kup = np.array([[0, 1], [0, 0]], dtype=np.double)
+        tgt = np.array([-1, 1], dtype=np.double)
+        rtol = get_rtol(np.double)
+
+        # Check default is 'L'
+        w = np.linalg.eigvalsh(Klo)
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'L'
+        w = np.linalg.eigvalsh(Klo, UPLO='L')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'l'
+        w = np.linalg.eigvalsh(Klo, UPLO='l')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'U'
+        w = np.linalg.eigvalsh(Kup, UPLO='U')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'u'
+        w = np.linalg.eigvalsh(Kup, UPLO='u')
+        assert_allclose(w, tgt, rtol=rtol)
+
+    def test_0_size(self):
+        # Check that all kinds of 0-sized arrays work
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res = linalg.eigvalsh(a)
+        assert_(res.dtype.type is np.float64)
+        assert_equal((0, 1), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(res, np.ndarray))
+
+        a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)
+        res = linalg.eigvalsh(a)
+        assert_(res.dtype.type is np.float32)
+        assert_equal((0,), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(res, np.ndarray))
+
+
+class TestEighCases(HermitianTestCase, HermitianGeneralizedTestCase):
+
+    def do(self, a, b, tags):
+        # note that eigenvalue arrays returned by eig must be sorted since
+        # their order isn't guaranteed.
+        ev, evc = linalg.eigh(a)
+        evalues, evectors = linalg.eig(a)
+        evalues.sort(axis=-1)
+        assert_almost_equal(ev, evalues)
+
+        assert_allclose(dot_generalized(a, evc),
+                        np.asarray(ev)[..., None, :] * np.asarray(evc),
+                        rtol=get_rtol(ev.dtype))
+
+        ev2, evc2 = linalg.eigh(a, 'U')
+        assert_almost_equal(ev2, evalues)
+
+        assert_allclose(dot_generalized(a, evc2),
+                        np.asarray(ev2)[..., None, :] * np.asarray(evc2),
+                        rtol=get_rtol(ev.dtype), err_msg=repr(a))
+
+
+class TestEigh:
+    @pytest.mark.parametrize('dtype', [single, double, csingle, cdouble])
+    def test_types(self, dtype):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=dtype)
+        w, v = np.linalg.eigh(x)
+        assert_equal(w.dtype, get_real_dtype(dtype))
+        assert_equal(v.dtype, dtype)
+
+    def test_invalid(self):
+        x = np.array([[1, 0.5], [0.5, 1]], dtype=np.float32)
+        assert_raises(ValueError, np.linalg.eigh, x, UPLO="lrong")
+        assert_raises(ValueError, np.linalg.eigh, x, "lower")
+        assert_raises(ValueError, np.linalg.eigh, x, "upper")
+
+    def test_UPLO(self):
+        Klo = np.array([[0, 0], [1, 0]], dtype=np.double)
+        Kup = np.array([[0, 1], [0, 0]], dtype=np.double)
+        tgt = np.array([-1, 1], dtype=np.double)
+        rtol = get_rtol(np.double)
+
+        # Check default is 'L'
+        w, v = np.linalg.eigh(Klo)
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'L'
+        w, v = np.linalg.eigh(Klo, UPLO='L')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'l'
+        w, v = np.linalg.eigh(Klo, UPLO='l')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'U'
+        w, v = np.linalg.eigh(Kup, UPLO='U')
+        assert_allclose(w, tgt, rtol=rtol)
+        # Check 'u'
+        w, v = np.linalg.eigh(Kup, UPLO='u')
+        assert_allclose(w, tgt, rtol=rtol)
+
+    def test_0_size(self):
+        # Check that all kinds of 0-sized arrays work
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res, res_v = linalg.eigh(a)
+        assert_(res_v.dtype.type is np.float64)
+        assert_(res.dtype.type is np.float64)
+        assert_equal(a.shape, res_v.shape)
+        assert_equal((0, 1), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(a, np.ndarray))
+
+        a = np.zeros((0, 0), dtype=np.complex64).view(ArraySubclass)
+        res, res_v = linalg.eigh(a)
+        assert_(res_v.dtype.type is np.complex64)
+        assert_(res.dtype.type is np.float32)
+        assert_equal(a.shape, res_v.shape)
+        assert_equal((0,), res.shape)
+        # This is just for documentation, it might make sense to change:
+        assert_(isinstance(a, np.ndarray))
+
+
+class _TestNormBase:
+    dt = None
+    dec = None
+
+
+class _TestNormGeneral(_TestNormBase):
+
+    def test_empty(self):
+        assert_equal(norm([]), 0.0)
+        assert_equal(norm(array([], dtype=self.dt)), 0.0)
+        assert_equal(norm(atleast_2d(array([], dtype=self.dt))), 0.0)
+
+    def test_vector_return_type(self):
+        a = np.array([1, 0, 1])
+
+        exact_types = np.typecodes['AllInteger']
+        inexact_types = np.typecodes['AllFloat']
+
+        all_types = exact_types + inexact_types
+
+        for each_inexact_types in all_types:
+            at = a.astype(each_inexact_types)
+
+            an = norm(at, -np.inf)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 0.0)
+
+            with suppress_warnings() as sup:
+                sup.filter(RuntimeWarning, "divide by zero encountered")
+                an = norm(at, -1)
+                assert_(issubclass(an.dtype.type, np.floating))
+                assert_almost_equal(an, 0.0)
+
+            an = norm(at, 0)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2)
+
+            an = norm(at, 1)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2.0)
+
+            an = norm(at, 2)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, an.dtype.type(2.0)**an.dtype.type(1.0/2.0))
+
+            an = norm(at, 4)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, an.dtype.type(2.0)**an.dtype.type(1.0/4.0))
+
+            an = norm(at, np.inf)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 1.0)
+
+    def test_vector(self):
+        a = [1, 2, 3, 4]
+        b = [-1, -2, -3, -4]
+        c = [-1, 2, -3, 4]
+
+        def _test(v):
+            np.testing.assert_almost_equal(norm(v), 30 ** 0.5,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, inf), 4.0,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, -inf), 1.0,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, 1), 10.0,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, -1), 12.0 / 25,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, 2), 30 ** 0.5,
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, -2), ((205. / 144) ** -0.5),
+                                           decimal=self.dec)
+            np.testing.assert_almost_equal(norm(v, 0), 4,
+                                           decimal=self.dec)
+
+        for v in (a, b, c,):
+            _test(v)
+
+        for v in (array(a, dtype=self.dt), array(b, dtype=self.dt),
+                  array(c, dtype=self.dt)):
+            _test(v)
+
+    def test_axis(self):
+        # Vector norms.
+        # Compare the use of `axis` with computing the norm of each row
+        # or column separately.
+        A = array([[1, 2, 3], [4, 5, 6]], dtype=self.dt)
+        for order in [None, -1, 0, 1, 2, 3, np.Inf, -np.Inf]:
+            expected0 = [norm(A[:, k], ord=order) for k in range(A.shape[1])]
+            assert_almost_equal(norm(A, ord=order, axis=0), expected0)
+            expected1 = [norm(A[k, :], ord=order) for k in range(A.shape[0])]
+            assert_almost_equal(norm(A, ord=order, axis=1), expected1)
+
+        # Matrix norms.
+        B = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)
+        nd = B.ndim
+        for order in [None, -2, 2, -1, 1, np.Inf, -np.Inf, 'fro']:
+            for axis in itertools.combinations(range(-nd, nd), 2):
+                row_axis, col_axis = axis
+                if row_axis < 0:
+                    row_axis += nd
+                if col_axis < 0:
+                    col_axis += nd
+                if row_axis == col_axis:
+                    assert_raises(ValueError, norm, B, ord=order, axis=axis)
+                else:
+                    n = norm(B, ord=order, axis=axis)
+
+                    # The logic using k_index only works for nd = 3.
+                    # This has to be changed if nd is increased.
+                    k_index = nd - (row_axis + col_axis)
+                    if row_axis < col_axis:
+                        expected = [norm(B[:].take(k, axis=k_index), ord=order)
+                                    for k in range(B.shape[k_index])]
+                    else:
+                        expected = [norm(B[:].take(k, axis=k_index).T, ord=order)
+                                    for k in range(B.shape[k_index])]
+                    assert_almost_equal(n, expected)
+
+    def test_keepdims(self):
+        A = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)
+
+        allclose_err = 'order {0}, axis = {1}'
+        shape_err = 'Shape mismatch found {0}, expected {1}, order={2}, axis={3}'
+
+        # check the order=None, axis=None case
+        expected = norm(A, ord=None, axis=None)
+        found = norm(A, ord=None, axis=None, keepdims=True)
+        assert_allclose(np.squeeze(found), expected,
+                        err_msg=allclose_err.format(None, None))
+        expected_shape = (1, 1, 1)
+        assert_(found.shape == expected_shape,
+                shape_err.format(found.shape, expected_shape, None, None))
+
+        # Vector norms.
+        for order in [None, -1, 0, 1, 2, 3, np.Inf, -np.Inf]:
+            for k in range(A.ndim):
+                expected = norm(A, ord=order, axis=k)
+                found = norm(A, ord=order, axis=k, keepdims=True)
+                assert_allclose(np.squeeze(found), expected,
+                                err_msg=allclose_err.format(order, k))
+                expected_shape = list(A.shape)
+                expected_shape[k] = 1
+                expected_shape = tuple(expected_shape)
+                assert_(found.shape == expected_shape,
+                        shape_err.format(found.shape, expected_shape, order, k))
+
+        # Matrix norms.
+        for order in [None, -2, 2, -1, 1, np.Inf, -np.Inf, 'fro', 'nuc']:
+            for k in itertools.permutations(range(A.ndim), 2):
+                expected = norm(A, ord=order, axis=k)
+                found = norm(A, ord=order, axis=k, keepdims=True)
+                assert_allclose(np.squeeze(found), expected,
+                                err_msg=allclose_err.format(order, k))
+                expected_shape = list(A.shape)
+                expected_shape[k[0]] = 1
+                expected_shape[k[1]] = 1
+                expected_shape = tuple(expected_shape)
+                assert_(found.shape == expected_shape,
+                        shape_err.format(found.shape, expected_shape, order, k))
+
+
+class _TestNorm2D(_TestNormBase):
+    # Define the part for 2d arrays separately, so we can subclass this
+    # and run the tests using np.matrix in matrixlib.tests.test_matrix_linalg.
+    array = np.array
+
+    def test_matrix_empty(self):
+        assert_equal(norm(self.array([[]], dtype=self.dt)), 0.0)
+
+    def test_matrix_return_type(self):
+        a = self.array([[1, 0, 1], [0, 1, 1]])
+
+        exact_types = np.typecodes['AllInteger']
+
+        # float32, complex64, float64, complex128 types are the only types
+        # allowed by `linalg`, which performs the matrix operations used
+        # within `norm`.
+        inexact_types = 'fdFD'
+
+        all_types = exact_types + inexact_types
+
+        for each_inexact_types in all_types:
+            at = a.astype(each_inexact_types)
+
+            an = norm(at, -np.inf)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2.0)
+
+            with suppress_warnings() as sup:
+                sup.filter(RuntimeWarning, "divide by zero encountered")
+                an = norm(at, -1)
+                assert_(issubclass(an.dtype.type, np.floating))
+                assert_almost_equal(an, 1.0)
+
+            an = norm(at, 1)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2.0)
+
+            an = norm(at, 2)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 3.0**(1.0/2.0))
+
+            an = norm(at, -2)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 1.0)
+
+            an = norm(at, np.inf)
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2.0)
+
+            an = norm(at, 'fro')
+            assert_(issubclass(an.dtype.type, np.floating))
+            assert_almost_equal(an, 2.0)
+
+            an = norm(at, 'nuc')
+            assert_(issubclass(an.dtype.type, np.floating))
+            # Lower bar needed to support low precision floats.
+            # They end up being off by 1 in the 7th place.
+            np.testing.assert_almost_equal(an, 2.7320508075688772, decimal=6)
+
+    def test_matrix_2x2(self):
+        A = self.array([[1, 3], [5, 7]], dtype=self.dt)
+        assert_almost_equal(norm(A), 84 ** 0.5)
+        assert_almost_equal(norm(A, 'fro'), 84 ** 0.5)
+        assert_almost_equal(norm(A, 'nuc'), 10.0)
+        assert_almost_equal(norm(A, inf), 12.0)
+        assert_almost_equal(norm(A, -inf), 4.0)
+        assert_almost_equal(norm(A, 1), 10.0)
+        assert_almost_equal(norm(A, -1), 6.0)
+        assert_almost_equal(norm(A, 2), 9.1231056256176615)
+        assert_almost_equal(norm(A, -2), 0.87689437438234041)
+
+        assert_raises(ValueError, norm, A, 'nofro')
+        assert_raises(ValueError, norm, A, -3)
+        assert_raises(ValueError, norm, A, 0)
+
+    def test_matrix_3x3(self):
+        # This test has been added because the 2x2 example
+        # happened to have equal nuclear norm and induced 1-norm.
+        # The 1/10 scaling factor accommodates the absolute tolerance
+        # used in assert_almost_equal.
+        A = (1 / 10) * \
+            self.array([[1, 2, 3], [6, 0, 5], [3, 2, 1]], dtype=self.dt)
+        assert_almost_equal(norm(A), (1 / 10) * 89 ** 0.5)
+        assert_almost_equal(norm(A, 'fro'), (1 / 10) * 89 ** 0.5)
+        assert_almost_equal(norm(A, 'nuc'), 1.3366836911774836)
+        assert_almost_equal(norm(A, inf), 1.1)
+        assert_almost_equal(norm(A, -inf), 0.6)
+        assert_almost_equal(norm(A, 1), 1.0)
+        assert_almost_equal(norm(A, -1), 0.4)
+        assert_almost_equal(norm(A, 2), 0.88722940323461277)
+        assert_almost_equal(norm(A, -2), 0.19456584790481812)
+
+    def test_bad_args(self):
+        # Check that bad arguments raise the appropriate exceptions.
+
+        A = self.array([[1, 2, 3], [4, 5, 6]], dtype=self.dt)
+        B = np.arange(1, 25, dtype=self.dt).reshape(2, 3, 4)
+
+        # Using `axis=<integer>` or passing in a 1-D array implies vector
+        # norms are being computed, so also using `ord='fro'`
+        # or `ord='nuc'` or any other string raises a ValueError.
+        assert_raises(ValueError, norm, A, 'fro', 0)
+        assert_raises(ValueError, norm, A, 'nuc', 0)
+        assert_raises(ValueError, norm, [3, 4], 'fro', None)
+        assert_raises(ValueError, norm, [3, 4], 'nuc', None)
+        assert_raises(ValueError, norm, [3, 4], 'test', None)
+
+        # Similarly, norm should raise an exception when ord is any finite
+        # number other than 1, 2, -1 or -2 when computing matrix norms.
+        for order in [0, 3]:
+            assert_raises(ValueError, norm, A, order, None)
+            assert_raises(ValueError, norm, A, order, (0, 1))
+            assert_raises(ValueError, norm, B, order, (1, 2))
+
+        # Invalid axis
+        assert_raises(np.AxisError, norm, B, None, 3)
+        assert_raises(np.AxisError, norm, B, None, (2, 3))
+        assert_raises(ValueError, norm, B, None, (0, 1, 2))
+
+
+class _TestNorm(_TestNorm2D, _TestNormGeneral):
+    pass
+
+
+class TestNorm_NonSystematic:
+
+    def test_longdouble_norm(self):
+        # Non-regression test: p-norm of longdouble would previously raise
+        # UnboundLocalError.
+        x = np.arange(10, dtype=np.longdouble)
+        old_assert_almost_equal(norm(x, ord=3), 12.65, decimal=2)
+
+    def test_intmin(self):
+        # Non-regression test: p-norm of signed integer would previously do
+        # float cast and abs in the wrong order.
+        x = np.array([-2 ** 31], dtype=np.int32)
+        old_assert_almost_equal(norm(x, ord=3), 2 ** 31, decimal=5)
+
+    def test_complex_high_ord(self):
+        # gh-4156
+        d = np.empty((2,), dtype=np.clongdouble)
+        d[0] = 6 + 7j
+        d[1] = -6 + 7j
+        res = 11.615898132184
+        old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=10)
+        d = d.astype(np.complex128)
+        old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=9)
+        d = d.astype(np.complex64)
+        old_assert_almost_equal(np.linalg.norm(d, ord=3), res, decimal=5)
+
+
+# Separate definitions so we can use them for matrix tests.
+class _TestNormDoubleBase(_TestNormBase):
+    dt = np.double
+    dec = 12
+
+
+class _TestNormSingleBase(_TestNormBase):
+    dt = np.float32
+    dec = 6
+
+
+class _TestNormInt64Base(_TestNormBase):
+    dt = np.int64
+    dec = 12
+
+
+class TestNormDouble(_TestNorm, _TestNormDoubleBase):
+    pass
+
+
+class TestNormSingle(_TestNorm, _TestNormSingleBase):
+    pass
+
+
+class TestNormInt64(_TestNorm, _TestNormInt64Base):
+    pass
+
+
+class TestMatrixRank:
+
+    def test_matrix_rank(self):
+        # Full rank matrix
+        assert_equal(4, matrix_rank(np.eye(4)))
+        # rank deficient matrix
+        I = np.eye(4)
+        I[-1, -1] = 0.
+        assert_equal(matrix_rank(I), 3)
+        # All zeros - zero rank
+        assert_equal(matrix_rank(np.zeros((4, 4))), 0)
+        # 1 dimension - rank 1 unless all 0
+        assert_equal(matrix_rank([1, 0, 0, 0]), 1)
+        assert_equal(matrix_rank(np.zeros((4,))), 0)
+        # accepts array-like
+        assert_equal(matrix_rank([1]), 1)
+        # greater than 2 dimensions treated as stacked matrices
+        ms = np.array([I, np.eye(4), np.zeros((4,4))])
+        assert_equal(matrix_rank(ms), np.array([3, 4, 0]))
+        # works on scalar
+        assert_equal(matrix_rank(1), 1)
+
+    def test_symmetric_rank(self):
+        assert_equal(4, matrix_rank(np.eye(4), hermitian=True))
+        assert_equal(1, matrix_rank(np.ones((4, 4)), hermitian=True))
+        assert_equal(0, matrix_rank(np.zeros((4, 4)), hermitian=True))
+        # rank deficient matrix
+        I = np.eye(4)
+        I[-1, -1] = 0.
+        assert_equal(3, matrix_rank(I, hermitian=True))
+        # manually supplied tolerance
+        I[-1, -1] = 1e-8
+        assert_equal(4, matrix_rank(I, hermitian=True, tol=0.99e-8))
+        assert_equal(3, matrix_rank(I, hermitian=True, tol=1.01e-8))
+
+
+def test_reduced_rank():
+    # Test matrices with reduced rank
+    rng = np.random.RandomState(20120714)
+    for i in range(100):
+        # Make a rank deficient matrix
+        X = rng.normal(size=(40, 10))
+        X[:, 0] = X[:, 1] + X[:, 2]
+        # Assert that matrix_rank detected deficiency
+        assert_equal(matrix_rank(X), 9)
+        X[:, 3] = X[:, 4] + X[:, 5]
+        assert_equal(matrix_rank(X), 8)
+
+
+class TestQR:
+    # Define the array class here, so run this on matrices elsewhere.
+    array = np.array
+
+    def check_qr(self, a):
+        # This test expects the argument `a` to be an ndarray or
+        # a subclass of an ndarray of inexact type.
+        a_type = type(a)
+        a_dtype = a.dtype
+        m, n = a.shape
+        k = min(m, n)
+
+        # mode == 'complete'
+        q, r = linalg.qr(a, mode='complete')
+        assert_(q.dtype == a_dtype)
+        assert_(r.dtype == a_dtype)
+        assert_(isinstance(q, a_type))
+        assert_(isinstance(r, a_type))
+        assert_(q.shape == (m, m))
+        assert_(r.shape == (m, n))
+        assert_almost_equal(dot(q, r), a)
+        assert_almost_equal(dot(q.T.conj(), q), np.eye(m))
+        assert_almost_equal(np.triu(r), r)
+
+        # mode == 'reduced'
+        q1, r1 = linalg.qr(a, mode='reduced')
+        assert_(q1.dtype == a_dtype)
+        assert_(r1.dtype == a_dtype)
+        assert_(isinstance(q1, a_type))
+        assert_(isinstance(r1, a_type))
+        assert_(q1.shape == (m, k))
+        assert_(r1.shape == (k, n))
+        assert_almost_equal(dot(q1, r1), a)
+        assert_almost_equal(dot(q1.T.conj(), q1), np.eye(k))
+        assert_almost_equal(np.triu(r1), r1)
+
+        # mode == 'r'
+        r2 = linalg.qr(a, mode='r')
+        assert_(r2.dtype == a_dtype)
+        assert_(isinstance(r2, a_type))
+        assert_almost_equal(r2, r1)
+
+
+    @pytest.mark.parametrize(["m", "n"], [
+        (3, 0),
+        (0, 3),
+        (0, 0)
+    ])
+    def test_qr_empty(self, m, n):
+        k = min(m, n)
+        a = np.empty((m, n))
+
+        self.check_qr(a)
+
+        h, tau = np.linalg.qr(a, mode='raw')
+        assert_equal(h.dtype, np.double)
+        assert_equal(tau.dtype, np.double)
+        assert_equal(h.shape, (n, m))
+        assert_equal(tau.shape, (k,))
+
+    def test_mode_raw(self):
+        # The factorization is not unique and varies between libraries,
+        # so it is not possible to check against known values. Functional
+        # testing is a possibility, but awaits the exposure of more
+        # of the functions in lapack_lite. Consequently, this test is
+        # very limited in scope. Note that the results are in FORTRAN
+        # order, hence the h arrays are transposed.
+        a = self.array([[1, 2], [3, 4], [5, 6]], dtype=np.double)
+
+        # Test double
+        h, tau = linalg.qr(a, mode='raw')
+        assert_(h.dtype == np.double)
+        assert_(tau.dtype == np.double)
+        assert_(h.shape == (2, 3))
+        assert_(tau.shape == (2,))
+
+        h, tau = linalg.qr(a.T, mode='raw')
+        assert_(h.dtype == np.double)
+        assert_(tau.dtype == np.double)
+        assert_(h.shape == (3, 2))
+        assert_(tau.shape == (2,))
+
+    def test_mode_all_but_economic(self):
+        a = self.array([[1, 2], [3, 4]])
+        b = self.array([[1, 2], [3, 4], [5, 6]])
+        for dt in "fd":
+            m1 = a.astype(dt)
+            m2 = b.astype(dt)
+            self.check_qr(m1)
+            self.check_qr(m2)
+            self.check_qr(m2.T)
+
+        for dt in "fd":
+            m1 = 1 + 1j * a.astype(dt)
+            m2 = 1 + 1j * b.astype(dt)
+            self.check_qr(m1)
+            self.check_qr(m2)
+            self.check_qr(m2.T)
+
+
+class TestCholesky:
+    # TODO: are there no other tests for cholesky?
+
+    def test_basic_property(self):
+        # Check A = L L^H
+        shapes = [(1, 1), (2, 2), (3, 3), (50, 50), (3, 10, 10)]
+        dtypes = (np.float32, np.float64, np.complex64, np.complex128)
+
+        for shape, dtype in itertools.product(shapes, dtypes):
+            np.random.seed(1)
+            a = np.random.randn(*shape)
+            if np.issubdtype(dtype, np.complexfloating):
+                a = a + 1j*np.random.randn(*shape)
+
+            t = list(range(len(shape)))
+            t[-2:] = -1, -2
+
+            a = np.matmul(a.transpose(t).conj(), a)
+            a = np.asarray(a, dtype=dtype)
+
+            c = np.linalg.cholesky(a)
+
+            b = np.matmul(c, c.transpose(t).conj())
+            assert_allclose(b, a,
+                            err_msg="{} {}\n{}\n{}".format(shape, dtype, a, c),
+                            atol=500 * a.shape[0] * np.finfo(dtype).eps)
+
+    def test_0_size(self):
+        class ArraySubclass(np.ndarray):
+            pass
+        a = np.zeros((0, 1, 1), dtype=np.int_).view(ArraySubclass)
+        res = linalg.cholesky(a)
+        assert_equal(a.shape, res.shape)
+        assert_(res.dtype.type is np.float64)
+        # for documentation purpose:
+        assert_(isinstance(res, np.ndarray))
+
+        a = np.zeros((1, 0, 0), dtype=np.complex64).view(ArraySubclass)
+        res = linalg.cholesky(a)
+        assert_equal(a.shape, res.shape)
+        assert_(res.dtype.type is np.complex64)
+        assert_(isinstance(res, np.ndarray))
+
+
+def test_byteorder_check():
+    # Byte order check should pass for native order
+    if sys.byteorder == 'little':
+        native = '<'
+    else:
+        native = '>'
+
+    for dtt in (np.float32, np.float64):
+        arr = np.eye(4, dtype=dtt)
+        n_arr = arr.newbyteorder(native)
+        sw_arr = arr.newbyteorder('S').byteswap()
+        assert_equal(arr.dtype.byteorder, '=')
+        for routine in (linalg.inv, linalg.det, linalg.pinv):
+            # Normal call
+            res = routine(arr)
+            # Native but not '='
+            assert_array_equal(res, routine(n_arr))
+            # Swapped
+            assert_array_equal(res, routine(sw_arr))
+
+
+def test_generalized_raise_multiloop():
+    # It should raise an error even if the error doesn't occur in the
+    # last iteration of the ufunc inner loop
+
+    invertible = np.array([[1, 2], [3, 4]])
+    non_invertible = np.array([[1, 1], [1, 1]])
+
+    x = np.zeros([4, 4, 2, 2])[1::2]
+    x[...] = invertible
+    x[0, 0] = non_invertible
+
+    assert_raises(np.linalg.LinAlgError, np.linalg.inv, x)
+
+
+def test_xerbla_override():
+    # Check that our xerbla has been successfully linked in. If it is not,
+    # the default xerbla routine is called, which prints a message to stdout
+    # and may, or may not, abort the process depending on the LAPACK package.
+
+    XERBLA_OK = 255
+
+    try:
+        pid = os.fork()
+    except (OSError, AttributeError):
+        # fork failed, or not running on POSIX
+        pytest.skip("Not POSIX or fork failed.")
+
+    if pid == 0:
+        # child; close i/o file handles
+        os.close(1)
+        os.close(0)
+        # Avoid producing core files.
+        import resource
+        resource.setrlimit(resource.RLIMIT_CORE, (0, 0))
+        # These calls may abort.
+        try:
+            np.linalg.lapack_lite.xerbla()
+        except ValueError:
+            pass
+        except Exception:
+            os._exit(os.EX_CONFIG)
+
+        try:
+            a = np.array([[1.]])
+            np.linalg.lapack_lite.dorgqr(
+                1, 1, 1, a,
+                0,  # <- invalid value
+                a, a, 0, 0)
+        except ValueError as e:
+            if "DORGQR parameter number 5" in str(e):
+                # success, reuse error code to mark success as
+                # FORTRAN STOP returns as success.
+                os._exit(XERBLA_OK)
+
+        # Did not abort, but our xerbla was not linked in.
+        os._exit(os.EX_CONFIG)
+    else:
+        # parent
+        pid, status = os.wait()
+        if os.WEXITSTATUS(status) != XERBLA_OK:
+            pytest.skip('Numpy xerbla not linked in.')
+
+
+@pytest.mark.slow
+def test_sdot_bug_8577():
+    # Regression test that loading certain other libraries does not
+    # result to wrong results in float32 linear algebra.
+    #
+    # There's a bug gh-8577 on OSX that can trigger this, and perhaps
+    # there are also other situations in which it occurs.
+    #
+    # Do the check in a separate process.
+
+    bad_libs = ['PyQt5.QtWidgets', 'IPython']
+
+    template = textwrap.dedent("""
+    import sys
+    {before}
+    try:
+        import {bad_lib}
+    except ImportError:
+        sys.exit(0)
+    {after}
+    x = np.ones(2, dtype=np.float32)
+    sys.exit(0 if np.allclose(x.dot(x), 2.0) else 1)
+    """)
+
+    for bad_lib in bad_libs:
+        code = template.format(before="import numpy as np", after="",
+                               bad_lib=bad_lib)
+        subprocess.check_call([sys.executable, "-c", code])
+
+        # Swapped import order
+        code = template.format(after="import numpy as np", before="",
+                               bad_lib=bad_lib)
+        subprocess.check_call([sys.executable, "-c", code])
+
+
+class TestMultiDot:
+
+    def test_basic_function_with_three_arguments(self):
+        # multi_dot with three arguments uses a fast hand coded algorithm to
+        # determine the optimal order. Therefore test it separately.
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+
+        assert_almost_equal(multi_dot([A, B, C]), A.dot(B).dot(C))
+        assert_almost_equal(multi_dot([A, B, C]), np.dot(A, np.dot(B, C)))
+
+    def test_basic_function_with_two_arguments(self):
+        # separate code path with two arguments
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+
+        assert_almost_equal(multi_dot([A, B]), A.dot(B))
+        assert_almost_equal(multi_dot([A, B]), np.dot(A, B))
+
+    def test_basic_function_with_dynamic_programing_optimization(self):
+        # multi_dot with four or more arguments uses the dynamic programing
+        # optimization and therefore deserve a separate
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+        D = np.random.random((2, 1))
+        assert_almost_equal(multi_dot([A, B, C, D]), A.dot(B).dot(C).dot(D))
+
+    def test_vector_as_first_argument(self):
+        # The first argument can be 1-D
+        A1d = np.random.random(2)  # 1-D
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+        D = np.random.random((2, 2))
+
+        # the result should be 1-D
+        assert_equal(multi_dot([A1d, B, C, D]).shape, (2,))
+
+    def test_vector_as_last_argument(self):
+        # The last argument can be 1-D
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+        D1d = np.random.random(2)  # 1-D
+
+        # the result should be 1-D
+        assert_equal(multi_dot([A, B, C, D1d]).shape, (6,))
+
+    def test_vector_as_first_and_last_argument(self):
+        # The first and last arguments can be 1-D
+        A1d = np.random.random(2)  # 1-D
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+        D1d = np.random.random(2)  # 1-D
+
+        # the result should be a scalar
+        assert_equal(multi_dot([A1d, B, C, D1d]).shape, ())
+
+    def test_three_arguments_and_out(self):
+        # multi_dot with three arguments uses a fast hand coded algorithm to
+        # determine the optimal order. Therefore test it separately.
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+
+        out = np.zeros((6, 2))
+        ret = multi_dot([A, B, C], out=out)
+        assert out is ret
+        assert_almost_equal(out, A.dot(B).dot(C))
+        assert_almost_equal(out, np.dot(A, np.dot(B, C)))
+
+    def test_two_arguments_and_out(self):
+        # separate code path with two arguments
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        out = np.zeros((6, 6))
+        ret = multi_dot([A, B], out=out)
+        assert out is ret
+        assert_almost_equal(out, A.dot(B))
+        assert_almost_equal(out, np.dot(A, B))
+
+    def test_dynamic_programing_optimization_and_out(self):
+        # multi_dot with four or more arguments uses the dynamic programing
+        # optimization and therefore deserve a separate test
+        A = np.random.random((6, 2))
+        B = np.random.random((2, 6))
+        C = np.random.random((6, 2))
+        D = np.random.random((2, 1))
+        out = np.zeros((6, 1))
+        ret = multi_dot([A, B, C, D], out=out)
+        assert out is ret
+        assert_almost_equal(out, A.dot(B).dot(C).dot(D))
+
+    def test_dynamic_programming_logic(self):
+        # Test for the dynamic programming part
+        # This test is directly taken from Cormen page 376.
+        arrays = [np.random.random((30, 35)),
+                  np.random.random((35, 15)),
+                  np.random.random((15, 5)),
+                  np.random.random((5, 10)),
+                  np.random.random((10, 20)),
+                  np.random.random((20, 25))]
+        m_expected = np.array([[0., 15750., 7875., 9375., 11875., 15125.],
+                               [0.,     0., 2625., 4375.,  7125., 10500.],
+                               [0.,     0.,    0.,  750.,  2500.,  5375.],
+                               [0.,     0.,    0.,    0.,  1000.,  3500.],
+                               [0.,     0.,    0.,    0.,     0.,  5000.],
+                               [0.,     0.,    0.,    0.,     0.,     0.]])
+        s_expected = np.array([[0,  1,  1,  3,  3,  3],
+                               [0,  0,  2,  3,  3,  3],
+                               [0,  0,  0,  3,  3,  3],
+                               [0,  0,  0,  0,  4,  5],
+                               [0,  0,  0,  0,  0,  5],
+                               [0,  0,  0,  0,  0,  0]], dtype=int)
+        s_expected -= 1  # Cormen uses 1-based index, python does not.
+
+        s, m = _multi_dot_matrix_chain_order(arrays, return_costs=True)
+
+        # Only the upper triangular part (without the diagonal) is interesting.
+        assert_almost_equal(np.triu(s[:-1, 1:]),
+                            np.triu(s_expected[:-1, 1:]))
+        assert_almost_equal(np.triu(m), np.triu(m_expected))
+
+    def test_too_few_input_arrays(self):
+        assert_raises(ValueError, multi_dot, [])
+        assert_raises(ValueError, multi_dot, [np.random.random((3, 3))])
+
+
+class TestTensorinv:
+
+    @pytest.mark.parametrize("arr, ind", [
+        (np.ones((4, 6, 8, 2)), 2),
+        (np.ones((3, 3, 2)), 1),
+        ])
+    def test_non_square_handling(self, arr, ind):
+        with assert_raises(LinAlgError):
+            linalg.tensorinv(arr, ind=ind)
+
+    @pytest.mark.parametrize("shape, ind", [
+        # examples from docstring
+        ((4, 6, 8, 3), 2),
+        ((24, 8, 3), 1),
+        ])
+    def test_tensorinv_shape(self, shape, ind):
+        a = np.eye(24)
+        a.shape = shape
+        ainv = linalg.tensorinv(a=a, ind=ind)
+        expected = a.shape[ind:] + a.shape[:ind]
+        actual = ainv.shape
+        assert_equal(actual, expected)
+
+    @pytest.mark.parametrize("ind", [
+        0, -2,
+        ])
+    def test_tensorinv_ind_limit(self, ind):
+        a = np.eye(24)
+        a.shape = (4, 6, 8, 3)
+        with assert_raises(ValueError):
+            linalg.tensorinv(a=a, ind=ind)
+
+    def test_tensorinv_result(self):
+        # mimic a docstring example
+        a = np.eye(24)
+        a.shape = (24, 8, 3)
+        ainv = linalg.tensorinv(a, ind=1)
+        b = np.ones(24)
+        assert_allclose(np.tensordot(ainv, b, 1), np.linalg.tensorsolve(a, b))
+
+
+def test_unsupported_commontype():
+    # linalg gracefully handles unsupported type
+    arr = np.array([[1, -2], [2, 5]], dtype='float16')
+    with assert_raises_regex(TypeError, "unsupported in linalg"):
+        linalg.cholesky(arr)
+
+
+@pytest.mark.slow
+@pytest.mark.xfail(not HAS_LAPACK64, run=False,
+                   reason="Numpy not compiled with 64-bit BLAS/LAPACK")
+@requires_memory(free_bytes=16e9)
+def test_blas64_dot():
+    n = 2**32
+    a = np.zeros([1, n], dtype=np.float32)
+    b = np.ones([1, 1], dtype=np.float32)
+    a[0,-1] = 1
+    c = np.dot(b, a)
+    assert_equal(c[0,-1], 1)
+
+
+@pytest.mark.xfail(not HAS_LAPACK64,
+                   reason="Numpy not compiled with 64-bit BLAS/LAPACK")
+def test_blas64_geqrf_lwork_smoketest():
+    # Smoke test LAPACK geqrf lwork call with 64-bit integers
+    dtype = np.float64
+    lapack_routine = np.linalg.lapack_lite.dgeqrf
+
+    m = 2**32 + 1
+    n = 2**32 + 1
+    lda = m
+
+    # Dummy arrays, not referenced by the lapack routine, so don't
+    # need to be of the right size
+    a = np.zeros([1, 1], dtype=dtype)
+    work = np.zeros([1], dtype=dtype)
+    tau = np.zeros([1], dtype=dtype)
+
+    # Size query
+    results = lapack_routine(m, n, a, lda, tau, work, -1, 0)
+    assert_equal(results['info'], 0)
+    assert_equal(results['m'], m)
+    assert_equal(results['n'], m)
+
+    # Should result to an integer of a reasonable size
+    lwork = int(work.item())
+    assert_(2**32 < lwork < 2**42)
diff --git a/venv/Lib/site-packages/numpy/linalg/tests/test_regression.py b/venv/Lib/site-packages/numpy/linalg/tests/test_regression.py
new file mode 100644
index 000000000..7ed932bc9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/linalg/tests/test_regression.py
@@ -0,0 +1,148 @@
+""" Test functions for linalg module
+"""
+import warnings
+
+import numpy as np
+from numpy import linalg, arange, float64, array, dot, transpose
+from numpy.testing import (
+    assert_, assert_raises, assert_equal, assert_array_equal,
+    assert_array_almost_equal, assert_array_less
+)
+
+
+class TestRegression:
+
+    def test_eig_build(self):
+        # Ticket #652
+        rva = array([1.03221168e+02 + 0.j,
+                     -1.91843603e+01 + 0.j,
+                     -6.04004526e-01 + 15.84422474j,
+                     -6.04004526e-01 - 15.84422474j,
+                     -1.13692929e+01 + 0.j,
+                     -6.57612485e-01 + 10.41755503j,
+                     -6.57612485e-01 - 10.41755503j,
+                     1.82126812e+01 + 0.j,
+                     1.06011014e+01 + 0.j,
+                     7.80732773e+00 + 0.j,
+                     -7.65390898e-01 + 0.j,
+                     1.51971555e-15 + 0.j,
+                     -1.51308713e-15 + 0.j])
+        a = arange(13 * 13, dtype=float64)
+        a.shape = (13, 13)
+        a = a % 17
+        va, ve = linalg.eig(a)
+        va.sort()
+        rva.sort()
+        assert_array_almost_equal(va, rva)
+
+    def test_eigh_build(self):
+        # Ticket 662.
+        rvals = [68.60568999, 89.57756725, 106.67185574]
+
+        cov = array([[77.70273908,   3.51489954,  15.64602427],
+                     [3.51489954,  88.97013878,  -1.07431931],
+                     [15.64602427,  -1.07431931,  98.18223512]])
+
+        vals, vecs = linalg.eigh(cov)
+        assert_array_almost_equal(vals, rvals)
+
+    def test_svd_build(self):
+        # Ticket 627.
+        a = array([[0., 1.], [1., 1.], [2., 1.], [3., 1.]])
+        m, n = a.shape
+        u, s, vh = linalg.svd(a)
+
+        b = dot(transpose(u[:, n:]), a)
+
+        assert_array_almost_equal(b, np.zeros((2, 2)))
+
+    def test_norm_vector_badarg(self):
+        # Regression for #786: Frobenius norm for vectors raises
+        # ValueError.
+        assert_raises(ValueError, linalg.norm, array([1., 2., 3.]), 'fro')
+
+    def test_lapack_endian(self):
+        # For bug #1482
+        a = array([[5.7998084,  -2.1825367],
+                   [-2.1825367,   9.85910595]], dtype='>f8')
+        b = array(a, dtype='<f8')
+
+        ap = linalg.cholesky(a)
+        bp = linalg.cholesky(b)
+        assert_array_equal(ap, bp)
+
+    def test_large_svd_32bit(self):
+        # See gh-4442, 64bit would require very large/slow matrices.
+        x = np.eye(1000, 66)
+        np.linalg.svd(x)
+
+    def test_svd_no_uv(self):
+        # gh-4733
+        for shape in (3, 4), (4, 4), (4, 3):
+            for t in float, complex:
+                a = np.ones(shape, dtype=t)
+                w = linalg.svd(a, compute_uv=False)
+                c = np.count_nonzero(np.absolute(w) > 0.5)
+                assert_equal(c, 1)
+                assert_equal(np.linalg.matrix_rank(a), 1)
+                assert_array_less(1, np.linalg.norm(a, ord=2))
+
+    def test_norm_object_array(self):
+        # gh-7575
+        testvector = np.array([np.array([0, 1]), 0, 0], dtype=object)
+
+        norm = linalg.norm(testvector)
+        assert_array_equal(norm, [0, 1])
+        assert_(norm.dtype == np.dtype('float64'))
+
+        norm = linalg.norm(testvector, ord=1)
+        assert_array_equal(norm, [0, 1])
+        assert_(norm.dtype != np.dtype('float64'))
+
+        norm = linalg.norm(testvector, ord=2)
+        assert_array_equal(norm, [0, 1])
+        assert_(norm.dtype == np.dtype('float64'))
+
+        assert_raises(ValueError, linalg.norm, testvector, ord='fro')
+        assert_raises(ValueError, linalg.norm, testvector, ord='nuc')
+        assert_raises(ValueError, linalg.norm, testvector, ord=np.inf)
+        assert_raises(ValueError, linalg.norm, testvector, ord=-np.inf)
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", DeprecationWarning)
+            assert_raises((AttributeError, DeprecationWarning),
+                              linalg.norm, testvector, ord=0)
+        assert_raises(ValueError, linalg.norm, testvector, ord=-1)
+        assert_raises(ValueError, linalg.norm, testvector, ord=-2)
+
+        testmatrix = np.array([[np.array([0, 1]), 0, 0],
+                               [0,                0, 0]], dtype=object)
+
+        norm = linalg.norm(testmatrix)
+        assert_array_equal(norm, [0, 1])
+        assert_(norm.dtype == np.dtype('float64'))
+
+        norm = linalg.norm(testmatrix, ord='fro')
+        assert_array_equal(norm, [0, 1])
+        assert_(norm.dtype == np.dtype('float64'))
+
+        assert_raises(TypeError, linalg.norm, testmatrix, ord='nuc')
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=np.inf)
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=-np.inf)
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=0)
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=1)
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=-1)
+        assert_raises(TypeError, linalg.norm, testmatrix, ord=2)
+        assert_raises(TypeError, linalg.norm, testmatrix, ord=-2)
+        assert_raises(ValueError, linalg.norm, testmatrix, ord=3)
+
+    def test_lstsq_complex_larger_rhs(self):
+        # gh-9891
+        size = 20
+        n_rhs = 70
+        G = np.random.randn(size, size) + 1j * np.random.randn(size, size)
+        u = np.random.randn(size, n_rhs) + 1j * np.random.randn(size, n_rhs)
+        b = G.dot(u)
+        # This should work without segmentation fault.
+        u_lstsq, res, rank, sv = linalg.lstsq(G, b, rcond=None)
+        # check results just in case
+        assert_array_almost_equal(u_lstsq, u)
diff --git a/venv/Lib/site-packages/numpy/ma/__init__.py b/venv/Lib/site-packages/numpy/ma/__init__.py
new file mode 100644
index 000000000..870cc4ef2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/__init__.py
@@ -0,0 +1,54 @@
+"""
+=============
+Masked Arrays
+=============
+
+Arrays sometimes contain invalid or missing data.  When doing operations
+on such arrays, we wish to suppress invalid values, which is the purpose masked
+arrays fulfill (an example of typical use is given below).
+
+For example, examine the following array:
+
+>>> x = np.array([2, 1, 3, np.nan, 5, 2, 3, np.nan])
+
+When we try to calculate the mean of the data, the result is undetermined:
+
+>>> np.mean(x)
+nan
+
+The mean is calculated using roughly ``np.sum(x)/len(x)``, but since
+any number added to ``NaN`` [1]_ produces ``NaN``, this doesn't work.  Enter
+masked arrays:
+
+>>> m = np.ma.masked_array(x, np.isnan(x))
+>>> m
+masked_array(data = [2.0 1.0 3.0 -- 5.0 2.0 3.0 --],
+      mask = [False False False  True False False False  True],
+      fill_value=1e+20)
+
+Here, we construct a masked array that suppress all ``NaN`` values.  We
+may now proceed to calculate the mean of the other values:
+
+>>> np.mean(m)
+2.6666666666666665
+
+.. [1] Not-a-Number, a floating point value that is the result of an
+       invalid operation.
+
+.. moduleauthor:: Pierre Gerard-Marchant
+.. moduleauthor:: Jarrod Millman
+
+"""
+from . import core
+from .core import *
+
+from . import extras
+from .extras import *
+
+__all__ = ['core', 'extras']
+__all__ += core.__all__
+__all__ += extras.__all__
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4dc71d7ed
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/bench.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/bench.cpython-36.pyc
new file mode 100644
index 000000000..c3b0b3503
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/bench.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/core.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/core.cpython-36.pyc
new file mode 100644
index 000000000..4ec10baaf
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/extras.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/extras.cpython-36.pyc
new file mode 100644
index 000000000..0a012a59d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/extras.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/mrecords.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/mrecords.cpython-36.pyc
new file mode 100644
index 000000000..3e46bf642
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/mrecords.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..d05d38d84
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/testutils.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/testutils.cpython-36.pyc
new file mode 100644
index 000000000..2ad2e4a45
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/testutils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/__pycache__/timer_comparison.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/__pycache__/timer_comparison.cpython-36.pyc
new file mode 100644
index 000000000..4ef3d4c91
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/__pycache__/timer_comparison.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/bench.py b/venv/Lib/site-packages/numpy/ma/bench.py
new file mode 100644
index 000000000..83cc6aea7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/bench.py
@@ -0,0 +1,131 @@
+#!/usr/bin/env python3
+# -*- coding: utf-8 -*-
+
+import timeit
+import numpy
+
+
+###############################################################################
+#                               Global variables                              #
+###############################################################################
+
+
+# Small arrays
+xs = numpy.random.uniform(-1, 1, 6).reshape(2, 3)
+ys = numpy.random.uniform(-1, 1, 6).reshape(2, 3)
+zs = xs + 1j * ys
+m1 = [[True, False, False], [False, False, True]]
+m2 = [[True, False, True], [False, False, True]]
+nmxs = numpy.ma.array(xs, mask=m1)
+nmys = numpy.ma.array(ys, mask=m2)
+nmzs = numpy.ma.array(zs, mask=m1)
+
+# Big arrays
+xl = numpy.random.uniform(-1, 1, 100*100).reshape(100, 100)
+yl = numpy.random.uniform(-1, 1, 100*100).reshape(100, 100)
+zl = xl + 1j * yl
+maskx = xl > 0.8
+masky = yl < -0.8
+nmxl = numpy.ma.array(xl, mask=maskx)
+nmyl = numpy.ma.array(yl, mask=masky)
+nmzl = numpy.ma.array(zl, mask=maskx)
+
+
+###############################################################################
+#                                 Functions                                   #
+###############################################################################
+
+
+def timer(s, v='', nloop=500, nrep=3):
+    units = ["s", "ms", "µs", "ns"]
+    scaling = [1, 1e3, 1e6, 1e9]
+    print("%s : %-50s : " % (v, s), end=' ')
+    varnames = ["%ss,nm%ss,%sl,nm%sl" % tuple(x*4) for x in 'xyz']
+    setup = 'from __main__ import numpy, ma, %s' % ','.join(varnames)
+    Timer = timeit.Timer(stmt=s, setup=setup)
+    best = min(Timer.repeat(nrep, nloop)) / nloop
+    if best > 0.0:
+        order = min(-int(numpy.floor(numpy.log10(best)) // 3), 3)
+    else:
+        order = 3
+    print("%d loops, best of %d: %.*g %s per loop" % (nloop, nrep,
+                                                      3,
+                                                      best * scaling[order],
+                                                      units[order]))
+
+
+def compare_functions_1v(func, nloop=500,
+                       xs=xs, nmxs=nmxs, xl=xl, nmxl=nmxl):
+    funcname = func.__name__
+    print("-"*50)
+    print("%s on small arrays" % funcname)
+    module, data = "numpy.ma", "nmxs"
+    timer("%(module)s.%(funcname)s(%(data)s)" % locals(), v="%11s" % module, nloop=nloop)
+
+    print("%s on large arrays" % funcname)
+    module, data = "numpy.ma", "nmxl"
+    timer("%(module)s.%(funcname)s(%(data)s)" % locals(), v="%11s" % module, nloop=nloop)
+    return
+
+def compare_methods(methodname, args, vars='x', nloop=500, test=True,
+                    xs=xs, nmxs=nmxs, xl=xl, nmxl=nmxl):
+    print("-"*50)
+    print("%s on small arrays" % methodname)
+    data, ver = "nm%ss" % vars, 'numpy.ma'
+    timer("%(data)s.%(methodname)s(%(args)s)" % locals(), v=ver, nloop=nloop)
+
+    print("%s on large arrays" % methodname)
+    data, ver = "nm%sl" % vars, 'numpy.ma'
+    timer("%(data)s.%(methodname)s(%(args)s)" % locals(), v=ver, nloop=nloop)
+    return
+
+def compare_functions_2v(func, nloop=500, test=True,
+                       xs=xs, nmxs=nmxs,
+                       ys=ys, nmys=nmys,
+                       xl=xl, nmxl=nmxl,
+                       yl=yl, nmyl=nmyl):
+    funcname = func.__name__
+    print("-"*50)
+    print("%s on small arrays" % funcname)
+    module, data = "numpy.ma", "nmxs,nmys"
+    timer("%(module)s.%(funcname)s(%(data)s)" % locals(), v="%11s" % module, nloop=nloop)
+
+    print("%s on large arrays" % funcname)
+    module, data = "numpy.ma", "nmxl,nmyl"
+    timer("%(module)s.%(funcname)s(%(data)s)" % locals(), v="%11s" % module, nloop=nloop)
+    return
+
+
+if __name__ == '__main__':
+    compare_functions_1v(numpy.sin)
+    compare_functions_1v(numpy.log)
+    compare_functions_1v(numpy.sqrt)
+
+    compare_functions_2v(numpy.multiply)
+    compare_functions_2v(numpy.divide)
+    compare_functions_2v(numpy.power)
+
+    compare_methods('ravel', '', nloop=1000)
+    compare_methods('conjugate', '', 'z', nloop=1000)
+    compare_methods('transpose', '', nloop=1000)
+    compare_methods('compressed', '', nloop=1000)
+    compare_methods('__getitem__', '0', nloop=1000)
+    compare_methods('__getitem__', '(0,0)', nloop=1000)
+    compare_methods('__getitem__', '[0,-1]', nloop=1000)
+    compare_methods('__setitem__', '0, 17', nloop=1000, test=False)
+    compare_methods('__setitem__', '(0,0), 17', nloop=1000, test=False)
+
+    print("-"*50)
+    print("__setitem__ on small arrays")
+    timer('nmxs.__setitem__((-1,0),numpy.ma.masked)', 'numpy.ma   ', nloop=10000)
+
+    print("-"*50)
+    print("__setitem__ on large arrays")
+    timer('nmxl.__setitem__((-1,0),numpy.ma.masked)', 'numpy.ma   ', nloop=10000)
+
+    print("-"*50)
+    print("where on small arrays")
+    timer('numpy.ma.where(nmxs>2,nmxs,nmys)', 'numpy.ma   ', nloop=1000)
+    print("-"*50)
+    print("where on large arrays")
+    timer('numpy.ma.where(nmxl>2,nmxl,nmyl)', 'numpy.ma   ', nloop=100)
diff --git a/venv/Lib/site-packages/numpy/ma/core.py b/venv/Lib/site-packages/numpy/ma/core.py
new file mode 100644
index 000000000..8d612b8ed
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/core.py
@@ -0,0 +1,8182 @@
+"""
+numpy.ma : a package to handle missing or invalid values.
+
+This package was initially written for numarray by Paul F. Dubois
+at Lawrence Livermore National Laboratory.
+In 2006, the package was completely rewritten by Pierre Gerard-Marchant
+(University of Georgia) to make the MaskedArray class a subclass of ndarray,
+and to improve support of structured arrays.
+
+
+Copyright 1999, 2000, 2001 Regents of the University of California.
+Released for unlimited redistribution.
+
+* Adapted for numpy_core 2005 by Travis Oliphant and (mainly) Paul Dubois.
+* Subclassing of the base `ndarray` 2006 by Pierre Gerard-Marchant
+  (pgmdevlist_AT_gmail_DOT_com)
+* Improvements suggested by Reggie Dugard (reggie_AT_merfinllc_DOT_com)
+
+.. moduleauthor:: Pierre Gerard-Marchant
+
+"""
+# pylint: disable-msg=E1002
+import builtins
+import operator
+import warnings
+import textwrap
+import re
+from functools import reduce
+
+import numpy as np
+import numpy.core.umath as umath
+import numpy.core.numerictypes as ntypes
+from numpy import ndarray, amax, amin, iscomplexobj, bool_, _NoValue
+from numpy import array as narray
+from numpy.lib.function_base import angle
+from numpy.compat import (
+    getargspec, formatargspec, long, unicode, bytes
+    )
+from numpy import expand_dims
+from numpy.core.numeric import normalize_axis_tuple
+from numpy.core._internal import recursive
+from numpy.compat import pickle
+
+
+__all__ = [
+    'MAError', 'MaskError', 'MaskType', 'MaskedArray', 'abs', 'absolute',
+    'add', 'all', 'allclose', 'allequal', 'alltrue', 'amax', 'amin',
+    'angle', 'anom', 'anomalies', 'any', 'append', 'arange', 'arccos',
+    'arccosh', 'arcsin', 'arcsinh', 'arctan', 'arctan2', 'arctanh',
+    'argmax', 'argmin', 'argsort', 'around', 'array', 'asanyarray',
+    'asarray', 'bitwise_and', 'bitwise_or', 'bitwise_xor', 'bool_', 'ceil',
+    'choose', 'clip', 'common_fill_value', 'compress', 'compressed',
+    'concatenate', 'conjugate', 'convolve', 'copy', 'correlate', 'cos', 'cosh',
+    'count', 'cumprod', 'cumsum', 'default_fill_value', 'diag', 'diagonal',
+    'diff', 'divide', 'empty', 'empty_like', 'equal', 'exp',
+    'expand_dims', 'fabs', 'filled', 'fix_invalid', 'flatten_mask',
+    'flatten_structured_array', 'floor', 'floor_divide', 'fmod',
+    'frombuffer', 'fromflex', 'fromfunction', 'getdata', 'getmask',
+    'getmaskarray', 'greater', 'greater_equal', 'harden_mask', 'hypot',
+    'identity', 'ids', 'indices', 'inner', 'innerproduct', 'isMA',
+    'isMaskedArray', 'is_mask', 'is_masked', 'isarray', 'left_shift',
+    'less', 'less_equal', 'log', 'log10', 'log2',
+    'logical_and', 'logical_not', 'logical_or', 'logical_xor', 'make_mask',
+    'make_mask_descr', 'make_mask_none', 'mask_or', 'masked',
+    'masked_array', 'masked_equal', 'masked_greater',
+    'masked_greater_equal', 'masked_inside', 'masked_invalid',
+    'masked_less', 'masked_less_equal', 'masked_not_equal',
+    'masked_object', 'masked_outside', 'masked_print_option',
+    'masked_singleton', 'masked_values', 'masked_where', 'max', 'maximum',
+    'maximum_fill_value', 'mean', 'min', 'minimum', 'minimum_fill_value',
+    'mod', 'multiply', 'mvoid', 'ndim', 'negative', 'nomask', 'nonzero',
+    'not_equal', 'ones', 'outer', 'outerproduct', 'power', 'prod',
+    'product', 'ptp', 'put', 'putmask', 'ravel', 'remainder',
+    'repeat', 'reshape', 'resize', 'right_shift', 'round', 'round_',
+    'set_fill_value', 'shape', 'sin', 'sinh', 'size', 'soften_mask',
+    'sometrue', 'sort', 'sqrt', 'squeeze', 'std', 'subtract', 'sum',
+    'swapaxes', 'take', 'tan', 'tanh', 'trace', 'transpose', 'true_divide',
+    'var', 'where', 'zeros',
+    ]
+
+MaskType = np.bool_
+nomask = MaskType(0)
+
+class MaskedArrayFutureWarning(FutureWarning):
+    pass
+
+def _deprecate_argsort_axis(arr):
+    """
+    Adjust the axis passed to argsort, warning if necessary
+
+    Parameters
+    ----------
+    arr
+        The array which argsort was called on
+
+    np.ma.argsort has a long-term bug where the default of the axis argument
+    is wrong (gh-8701), which now must be kept for backwards compatibility.
+    Thankfully, this only makes a difference when arrays are 2- or more-
+    dimensional, so we only need a warning then.
+    """
+    if arr.ndim <= 1:
+        # no warning needed - but switch to -1 anyway, to avoid surprising
+        # subclasses, which are more likely to implement scalar axes.
+        return -1
+    else:
+        # 2017-04-11, Numpy 1.13.0, gh-8701: warn on axis default
+        warnings.warn(
+            "In the future the default for argsort will be axis=-1, not the "
+            "current None, to match its documentation and np.argsort. "
+            "Explicitly pass -1 or None to silence this warning.",
+            MaskedArrayFutureWarning, stacklevel=3)
+        return None
+
+
+def doc_note(initialdoc, note):
+    """
+    Adds a Notes section to an existing docstring.
+
+    """
+    if initialdoc is None:
+        return
+    if note is None:
+        return initialdoc
+
+    notesplit = re.split(r'\n\s*?Notes\n\s*?-----', initialdoc)
+
+    notedoc = """\
+Notes
+    -----
+    %s""" % note
+
+    if len(notesplit) > 1:
+        notedoc = '\n\n    ' + notedoc + '\n'
+
+    return ''.join(notesplit[:1] + [notedoc] + notesplit[1:])
+
+
+def get_object_signature(obj):
+    """
+    Get the signature from obj
+
+    """
+    try:
+        sig = formatargspec(*getargspec(obj))
+    except TypeError:
+        sig = ''
+    return sig
+
+
+###############################################################################
+#                              Exceptions                                     #
+###############################################################################
+
+
+class MAError(Exception):
+    """
+    Class for masked array related errors.
+
+    """
+    pass
+
+
+class MaskError(MAError):
+    """
+    Class for mask related errors.
+
+    """
+    pass
+
+
+###############################################################################
+#                           Filling options                                   #
+###############################################################################
+
+
+# b: boolean - c: complex - f: floats - i: integer - O: object - S: string
+default_filler = {'b': True,
+                  'c': 1.e20 + 0.0j,
+                  'f': 1.e20,
+                  'i': 999999,
+                  'O': '?',
+                  'S': b'N/A',
+                  'u': 999999,
+                  'V': b'???',
+                  'U': u'N/A'
+                  }
+
+# Add datetime64 and timedelta64 types
+for v in ["Y", "M", "W", "D", "h", "m", "s", "ms", "us", "ns", "ps",
+          "fs", "as"]:
+    default_filler["M8[" + v + "]"] = np.datetime64("NaT", v)
+    default_filler["m8[" + v + "]"] = np.timedelta64("NaT", v)
+
+float_types_list = [np.half, np.single, np.double, np.longdouble,
+                    np.csingle, np.cdouble, np.clongdouble]
+max_filler = ntypes._minvals
+max_filler.update([(k, -np.inf) for k in float_types_list[:4]])
+max_filler.update([(k, complex(-np.inf, -np.inf)) for k in float_types_list[-3:]])
+
+min_filler = ntypes._maxvals
+min_filler.update([(k,  +np.inf) for k in float_types_list[:4]])
+min_filler.update([(k, complex(+np.inf, +np.inf)) for k in float_types_list[-3:]])
+
+del float_types_list
+
+def _recursive_fill_value(dtype, f):
+    """
+    Recursively produce a fill value for `dtype`, calling f on scalar dtypes
+    """
+    if dtype.names is not None:
+        vals = tuple(_recursive_fill_value(dtype[name], f) for name in dtype.names)
+        return np.array(vals, dtype=dtype)[()]  # decay to void scalar from 0d
+    elif dtype.subdtype:
+        subtype, shape = dtype.subdtype
+        subval = _recursive_fill_value(subtype, f)
+        return np.full(shape, subval)
+    else:
+        return f(dtype)
+
+
+def _get_dtype_of(obj):
+    """ Convert the argument for *_fill_value into a dtype """
+    if isinstance(obj, np.dtype):
+        return obj
+    elif hasattr(obj, 'dtype'):
+        return obj.dtype
+    else:
+        return np.asanyarray(obj).dtype
+
+
+def default_fill_value(obj):
+    """
+    Return the default fill value for the argument object.
+
+    The default filling value depends on the datatype of the input
+    array or the type of the input scalar:
+
+       ========  ========
+       datatype  default
+       ========  ========
+       bool      True
+       int       999999
+       float     1.e20
+       complex   1.e20+0j
+       object    '?'
+       string    'N/A'
+       ========  ========
+
+    For structured types, a structured scalar is returned, with each field the
+    default fill value for its type.
+
+    For subarray types, the fill value is an array of the same size containing
+    the default scalar fill value.
+
+    Parameters
+    ----------
+    obj : ndarray, dtype or scalar
+        The array data-type or scalar for which the default fill value
+        is returned.
+
+    Returns
+    -------
+    fill_value : scalar
+        The default fill value.
+
+    Examples
+    --------
+    >>> np.ma.default_fill_value(1)
+    999999
+    >>> np.ma.default_fill_value(np.array([1.1, 2., np.pi]))
+    1e+20
+    >>> np.ma.default_fill_value(np.dtype(complex))
+    (1e+20+0j)
+
+    """
+    def _scalar_fill_value(dtype):
+        if dtype.kind in 'Mm':
+            return default_filler.get(dtype.str[1:], '?')
+        else:
+            return default_filler.get(dtype.kind, '?')
+
+    dtype = _get_dtype_of(obj)
+    return _recursive_fill_value(dtype, _scalar_fill_value)
+
+
+def _extremum_fill_value(obj, extremum, extremum_name):
+
+    def _scalar_fill_value(dtype):
+        try:
+            return extremum[dtype]
+        except KeyError as e:
+            raise TypeError(
+                f"Unsuitable type {dtype} for calculating {extremum_name}."
+            ) from None
+
+    dtype = _get_dtype_of(obj)
+    return _recursive_fill_value(dtype, _scalar_fill_value)
+
+
+def minimum_fill_value(obj):
+    """
+    Return the maximum value that can be represented by the dtype of an object.
+
+    This function is useful for calculating a fill value suitable for
+    taking the minimum of an array with a given dtype.
+
+    Parameters
+    ----------
+    obj : ndarray, dtype or scalar
+        An object that can be queried for it's numeric type.
+
+    Returns
+    -------
+    val : scalar
+        The maximum representable value.
+
+    Raises
+    ------
+    TypeError
+        If `obj` isn't a suitable numeric type.
+
+    See Also
+    --------
+    maximum_fill_value : The inverse function.
+    set_fill_value : Set the filling value of a masked array.
+    MaskedArray.fill_value : Return current fill value.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.int8()
+    >>> ma.minimum_fill_value(a)
+    127
+    >>> a = np.int32()
+    >>> ma.minimum_fill_value(a)
+    2147483647
+
+    An array of numeric data can also be passed.
+
+    >>> a = np.array([1, 2, 3], dtype=np.int8)
+    >>> ma.minimum_fill_value(a)
+    127
+    >>> a = np.array([1, 2, 3], dtype=np.float32)
+    >>> ma.minimum_fill_value(a)
+    inf
+
+    """
+    return _extremum_fill_value(obj, min_filler, "minimum")
+
+
+def maximum_fill_value(obj):
+    """
+    Return the minimum value that can be represented by the dtype of an object.
+
+    This function is useful for calculating a fill value suitable for
+    taking the maximum of an array with a given dtype.
+
+    Parameters
+    ----------
+    obj : ndarray, dtype or scalar
+        An object that can be queried for it's numeric type.
+
+    Returns
+    -------
+    val : scalar
+        The minimum representable value.
+
+    Raises
+    ------
+    TypeError
+        If `obj` isn't a suitable numeric type.
+
+    See Also
+    --------
+    minimum_fill_value : The inverse function.
+    set_fill_value : Set the filling value of a masked array.
+    MaskedArray.fill_value : Return current fill value.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.int8()
+    >>> ma.maximum_fill_value(a)
+    -128
+    >>> a = np.int32()
+    >>> ma.maximum_fill_value(a)
+    -2147483648
+
+    An array of numeric data can also be passed.
+
+    >>> a = np.array([1, 2, 3], dtype=np.int8)
+    >>> ma.maximum_fill_value(a)
+    -128
+    >>> a = np.array([1, 2, 3], dtype=np.float32)
+    >>> ma.maximum_fill_value(a)
+    -inf
+
+    """
+    return _extremum_fill_value(obj, max_filler, "maximum")
+
+
+def _recursive_set_fill_value(fillvalue, dt):
+    """
+    Create a fill value for a structured dtype.
+
+    Parameters
+    ----------
+    fillvalue: scalar or array_like
+        Scalar or array representing the fill value. If it is of shorter
+        length than the number of fields in dt, it will be resized.
+    dt: dtype
+        The structured dtype for which to create the fill value.
+
+    Returns
+    -------
+    val: tuple
+        A tuple of values corresponding to the structured fill value.
+
+    """
+    fillvalue = np.resize(fillvalue, len(dt.names))
+    output_value = []
+    for (fval, name) in zip(fillvalue, dt.names):
+        cdtype = dt[name]
+        if cdtype.subdtype:
+            cdtype = cdtype.subdtype[0]
+
+        if cdtype.names is not None:
+            output_value.append(tuple(_recursive_set_fill_value(fval, cdtype)))
+        else:
+            output_value.append(np.array(fval, dtype=cdtype).item())
+    return tuple(output_value)
+
+
+def _check_fill_value(fill_value, ndtype):
+    """
+    Private function validating the given `fill_value` for the given dtype.
+
+    If fill_value is None, it is set to the default corresponding to the dtype.
+
+    If fill_value is not None, its value is forced to the given dtype.
+
+    The result is always a 0d array.
+
+    """
+    ndtype = np.dtype(ndtype)
+    if fill_value is None:
+        fill_value = default_fill_value(ndtype)
+    elif ndtype.names is not None:
+        if isinstance(fill_value, (ndarray, np.void)):
+            try:
+                fill_value = np.array(fill_value, copy=False, dtype=ndtype)
+            except ValueError:
+                err_msg = "Unable to transform %s to dtype %s"
+                raise ValueError(err_msg % (fill_value, ndtype))
+        else:
+            fill_value = np.asarray(fill_value, dtype=object)
+            fill_value = np.array(_recursive_set_fill_value(fill_value, ndtype),
+                                  dtype=ndtype)
+    else:
+        if isinstance(fill_value, str) and (ndtype.char not in 'OSVU'):
+            # Note this check doesn't work if fill_value is not a scalar
+            err_msg = "Cannot set fill value of string with array of dtype %s"
+            raise TypeError(err_msg % ndtype)
+        else:
+            # In case we want to convert 1e20 to int.
+            # Also in case of converting string arrays.
+            try:
+                fill_value = np.array(fill_value, copy=False, dtype=ndtype)
+            except (OverflowError, ValueError):
+                # Raise TypeError instead of OverflowError or ValueError.
+                # OverflowError is seldom used, and the real problem here is
+                # that the passed fill_value is not compatible with the ndtype.
+                err_msg = "Cannot convert fill_value %s to dtype %s"
+                raise TypeError(err_msg % (fill_value, ndtype))
+    return np.array(fill_value)
+
+
+def set_fill_value(a, fill_value):
+    """
+    Set the filling value of a, if a is a masked array.
+
+    This function changes the fill value of the masked array `a` in place.
+    If `a` is not a masked array, the function returns silently, without
+    doing anything.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array.
+    fill_value : dtype
+        Filling value. A consistency test is performed to make sure
+        the value is compatible with the dtype of `a`.
+
+    Returns
+    -------
+    None
+        Nothing returned by this function.
+
+    See Also
+    --------
+    maximum_fill_value : Return the default fill value for a dtype.
+    MaskedArray.fill_value : Return current fill value.
+    MaskedArray.set_fill_value : Equivalent method.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(5)
+    >>> a
+    array([0, 1, 2, 3, 4])
+    >>> a = ma.masked_where(a < 3, a)
+    >>> a
+    masked_array(data=[--, --, --, 3, 4],
+                 mask=[ True,  True,  True, False, False],
+           fill_value=999999)
+    >>> ma.set_fill_value(a, -999)
+    >>> a
+    masked_array(data=[--, --, --, 3, 4],
+                 mask=[ True,  True,  True, False, False],
+           fill_value=-999)
+
+    Nothing happens if `a` is not a masked array.
+
+    >>> a = list(range(5))
+    >>> a
+    [0, 1, 2, 3, 4]
+    >>> ma.set_fill_value(a, 100)
+    >>> a
+    [0, 1, 2, 3, 4]
+    >>> a = np.arange(5)
+    >>> a
+    array([0, 1, 2, 3, 4])
+    >>> ma.set_fill_value(a, 100)
+    >>> a
+    array([0, 1, 2, 3, 4])
+
+    """
+    if isinstance(a, MaskedArray):
+        a.set_fill_value(fill_value)
+    return
+
+
+def get_fill_value(a):
+    """
+    Return the filling value of a, if any.  Otherwise, returns the
+    default filling value for that type.
+
+    """
+    if isinstance(a, MaskedArray):
+        result = a.fill_value
+    else:
+        result = default_fill_value(a)
+    return result
+
+
+def common_fill_value(a, b):
+    """
+    Return the common filling value of two masked arrays, if any.
+
+    If ``a.fill_value == b.fill_value``, return the fill value,
+    otherwise return None.
+
+    Parameters
+    ----------
+    a, b : MaskedArray
+        The masked arrays for which to compare fill values.
+
+    Returns
+    -------
+    fill_value : scalar or None
+        The common fill value, or None.
+
+    Examples
+    --------
+    >>> x = np.ma.array([0, 1.], fill_value=3)
+    >>> y = np.ma.array([0, 1.], fill_value=3)
+    >>> np.ma.common_fill_value(x, y)
+    3.0
+
+    """
+    t1 = get_fill_value(a)
+    t2 = get_fill_value(b)
+    if t1 == t2:
+        return t1
+    return None
+
+
+def filled(a, fill_value=None):
+    """
+    Return input as an array with masked data replaced by a fill value.
+
+    If `a` is not a `MaskedArray`, `a` itself is returned.
+    If `a` is a `MaskedArray` and `fill_value` is None, `fill_value` is set to
+    ``a.fill_value``.
+
+    Parameters
+    ----------
+    a : MaskedArray or array_like
+        An input object.
+    fill_value : array_like, optional.
+        Can be scalar or non-scalar. If non-scalar, the
+        resulting filled array should be broadcastable
+        over input array. Default is None.
+
+    Returns
+    -------
+    a : ndarray
+        The filled array.
+
+    See Also
+    --------
+    compressed
+
+    Examples
+    --------
+    >>> x = np.ma.array(np.arange(9).reshape(3, 3), mask=[[1, 0, 0],
+    ...                                                   [1, 0, 0],
+    ...                                                   [0, 0, 0]])
+    >>> x.filled()
+    array([[999999,      1,      2],
+           [999999,      4,      5],
+           [     6,      7,      8]])
+    >>> x.filled(fill_value=333)
+    array([[333,   1,   2],
+           [333,   4,   5],
+           [  6,   7,   8]])
+    >>> x.filled(fill_value=np.arange(3))
+    array([[0, 1, 2],
+           [0, 4, 5],
+           [6, 7, 8]])
+
+    """
+    if hasattr(a, 'filled'):
+        return a.filled(fill_value)
+
+    elif isinstance(a, ndarray):
+        # Should we check for contiguity ? and a.flags['CONTIGUOUS']:
+        return a
+    elif isinstance(a, dict):
+        return np.array(a, 'O')
+    else:
+        return np.array(a)
+
+
+def get_masked_subclass(*arrays):
+    """
+    Return the youngest subclass of MaskedArray from a list of (masked) arrays.
+
+    In case of siblings, the first listed takes over.
+
+    """
+    if len(arrays) == 1:
+        arr = arrays[0]
+        if isinstance(arr, MaskedArray):
+            rcls = type(arr)
+        else:
+            rcls = MaskedArray
+    else:
+        arrcls = [type(a) for a in arrays]
+        rcls = arrcls[0]
+        if not issubclass(rcls, MaskedArray):
+            rcls = MaskedArray
+        for cls in arrcls[1:]:
+            if issubclass(cls, rcls):
+                rcls = cls
+    # Don't return MaskedConstant as result: revert to MaskedArray
+    if rcls.__name__ == 'MaskedConstant':
+        return MaskedArray
+    return rcls
+
+
+def getdata(a, subok=True):
+    """
+    Return the data of a masked array as an ndarray.
+
+    Return the data of `a` (if any) as an ndarray if `a` is a ``MaskedArray``,
+    else return `a` as a ndarray or subclass (depending on `subok`) if not.
+
+    Parameters
+    ----------
+    a : array_like
+        Input ``MaskedArray``, alternatively a ndarray or a subclass thereof.
+    subok : bool
+        Whether to force the output to be a `pure` ndarray (False) or to
+        return a subclass of ndarray if appropriate (True, default).
+
+    See Also
+    --------
+    getmask : Return the mask of a masked array, or nomask.
+    getmaskarray : Return the mask of a masked array, or full array of False.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.masked_equal([[1,2],[3,4]], 2)
+    >>> a
+    masked_array(
+      data=[[1, --],
+            [3, 4]],
+      mask=[[False,  True],
+            [False, False]],
+      fill_value=2)
+    >>> ma.getdata(a)
+    array([[1, 2],
+           [3, 4]])
+
+    Equivalently use the ``MaskedArray`` `data` attribute.
+
+    >>> a.data
+    array([[1, 2],
+           [3, 4]])
+
+    """
+    try:
+        data = a._data
+    except AttributeError:
+        data = np.array(a, copy=False, subok=subok)
+    if not subok:
+        return data.view(ndarray)
+    return data
+
+
+get_data = getdata
+
+
+def fix_invalid(a, mask=nomask, copy=True, fill_value=None):
+    """
+    Return input with invalid data masked and replaced by a fill value.
+
+    Invalid data means values of `nan`, `inf`, etc.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array, a (subclass of) ndarray.
+    mask : sequence, optional
+        Mask. Must be convertible to an array of booleans with the same
+        shape as `data`. True indicates a masked (i.e. invalid) data.
+    copy : bool, optional
+        Whether to use a copy of `a` (True) or to fix `a` in place (False).
+        Default is True.
+    fill_value : scalar, optional
+        Value used for fixing invalid data. Default is None, in which case
+        the ``a.fill_value`` is used.
+
+    Returns
+    -------
+    b : MaskedArray
+        The input array with invalid entries fixed.
+
+    Notes
+    -----
+    A copy is performed by default.
+
+    Examples
+    --------
+    >>> x = np.ma.array([1., -1, np.nan, np.inf], mask=[1] + [0]*3)
+    >>> x
+    masked_array(data=[--, -1.0, nan, inf],
+                 mask=[ True, False, False, False],
+           fill_value=1e+20)
+    >>> np.ma.fix_invalid(x)
+    masked_array(data=[--, -1.0, --, --],
+                 mask=[ True, False,  True,  True],
+           fill_value=1e+20)
+
+    >>> fixed = np.ma.fix_invalid(x)
+    >>> fixed.data
+    array([ 1.e+00, -1.e+00,  1.e+20,  1.e+20])
+    >>> x.data
+    array([ 1., -1., nan, inf])
+
+    """
+    a = masked_array(a, copy=copy, mask=mask, subok=True)
+    invalid = np.logical_not(np.isfinite(a._data))
+    if not invalid.any():
+        return a
+    a._mask |= invalid
+    if fill_value is None:
+        fill_value = a.fill_value
+    a._data[invalid] = fill_value
+    return a
+
+def is_string_or_list_of_strings(val):
+    return (isinstance(val, str) or
+            (isinstance(val, list) and val and
+             builtins.all(isinstance(s, str) for s in val)))
+
+###############################################################################
+#                                  Ufuncs                                     #
+###############################################################################
+
+
+ufunc_domain = {}
+ufunc_fills = {}
+
+
+class _DomainCheckInterval:
+    """
+    Define a valid interval, so that :
+
+    ``domain_check_interval(a,b)(x) == True`` where
+    ``x < a`` or ``x > b``.
+
+    """
+
+    def __init__(self, a, b):
+        "domain_check_interval(a,b)(x) = true where x < a or y > b"
+        if a > b:
+            (a, b) = (b, a)
+        self.a = a
+        self.b = b
+
+    def __call__(self, x):
+        "Execute the call behavior."
+        # nans at masked positions cause RuntimeWarnings, even though
+        # they are masked. To avoid this we suppress warnings.
+        with np.errstate(invalid='ignore'):
+            return umath.logical_or(umath.greater(x, self.b),
+                                    umath.less(x, self.a))
+
+
+class _DomainTan:
+    """
+    Define a valid interval for the `tan` function, so that:
+
+    ``domain_tan(eps) = True`` where ``abs(cos(x)) < eps``
+
+    """
+
+    def __init__(self, eps):
+        "domain_tan(eps) = true where abs(cos(x)) < eps)"
+        self.eps = eps
+
+    def __call__(self, x):
+        "Executes the call behavior."
+        with np.errstate(invalid='ignore'):
+            return umath.less(umath.absolute(umath.cos(x)), self.eps)
+
+
+class _DomainSafeDivide:
+    """
+    Define a domain for safe division.
+
+    """
+
+    def __init__(self, tolerance=None):
+        self.tolerance = tolerance
+
+    def __call__(self, a, b):
+        # Delay the selection of the tolerance to here in order to reduce numpy
+        # import times. The calculation of these parameters is a substantial
+        # component of numpy's import time.
+        if self.tolerance is None:
+            self.tolerance = np.finfo(float).tiny
+        # don't call ma ufuncs from __array_wrap__ which would fail for scalars
+        a, b = np.asarray(a), np.asarray(b)
+        with np.errstate(invalid='ignore'):
+            return umath.absolute(a) * self.tolerance >= umath.absolute(b)
+
+
+class _DomainGreater:
+    """
+    DomainGreater(v)(x) is True where x <= v.
+
+    """
+
+    def __init__(self, critical_value):
+        "DomainGreater(v)(x) = true where x <= v"
+        self.critical_value = critical_value
+
+    def __call__(self, x):
+        "Executes the call behavior."
+        with np.errstate(invalid='ignore'):
+            return umath.less_equal(x, self.critical_value)
+
+
+class _DomainGreaterEqual:
+    """
+    DomainGreaterEqual(v)(x) is True where x < v.
+
+    """
+
+    def __init__(self, critical_value):
+        "DomainGreaterEqual(v)(x) = true where x < v"
+        self.critical_value = critical_value
+
+    def __call__(self, x):
+        "Executes the call behavior."
+        with np.errstate(invalid='ignore'):
+            return umath.less(x, self.critical_value)
+
+
+class _MaskedUFunc:
+    def __init__(self, ufunc):
+        self.f = ufunc
+        self.__doc__ = ufunc.__doc__
+        self.__name__ = ufunc.__name__
+
+    def __str__(self):
+        return f"Masked version of {self.f}"
+
+
+class _MaskedUnaryOperation(_MaskedUFunc):
+    """
+    Defines masked version of unary operations, where invalid values are
+    pre-masked.
+
+    Parameters
+    ----------
+    mufunc : callable
+        The function for which to define a masked version. Made available
+        as ``_MaskedUnaryOperation.f``.
+    fill : scalar, optional
+        Filling value, default is 0.
+    domain : class instance
+        Domain for the function. Should be one of the ``_Domain*``
+        classes. Default is None.
+
+    """
+
+    def __init__(self, mufunc, fill=0, domain=None):
+        super(_MaskedUnaryOperation, self).__init__(mufunc)
+        self.fill = fill
+        self.domain = domain
+        ufunc_domain[mufunc] = domain
+        ufunc_fills[mufunc] = fill
+
+    def __call__(self, a, *args, **kwargs):
+        """
+        Execute the call behavior.
+
+        """
+        d = getdata(a)
+        # Deal with domain
+        if self.domain is not None:
+            # Case 1.1. : Domained function
+            # nans at masked positions cause RuntimeWarnings, even though
+            # they are masked. To avoid this we suppress warnings.
+            with np.errstate(divide='ignore', invalid='ignore'):
+                result = self.f(d, *args, **kwargs)
+            # Make a mask
+            m = ~umath.isfinite(result)
+            m |= self.domain(d)
+            m |= getmask(a)
+        else:
+            # Case 1.2. : Function without a domain
+            # Get the result and the mask
+            with np.errstate(divide='ignore', invalid='ignore'):
+                result = self.f(d, *args, **kwargs)
+            m = getmask(a)
+
+        if not result.ndim:
+            # Case 2.1. : The result is scalarscalar
+            if m:
+                return masked
+            return result
+
+        if m is not nomask:
+            # Case 2.2. The result is an array
+            # We need to fill the invalid data back w/ the input Now,
+            # that's plain silly: in C, we would just skip the element and
+            # keep the original, but we do have to do it that way in Python
+
+            # In case result has a lower dtype than the inputs (as in
+            # equal)
+            try:
+                np.copyto(result, d, where=m)
+            except TypeError:
+                pass
+        # Transform to
+        masked_result = result.view(get_masked_subclass(a))
+        masked_result._mask = m
+        masked_result._update_from(a)
+        return masked_result
+
+
+class _MaskedBinaryOperation(_MaskedUFunc):
+    """
+    Define masked version of binary operations, where invalid
+    values are pre-masked.
+
+    Parameters
+    ----------
+    mbfunc : function
+        The function for which to define a masked version. Made available
+        as ``_MaskedBinaryOperation.f``.
+    domain : class instance
+        Default domain for the function. Should be one of the ``_Domain*``
+        classes. Default is None.
+    fillx : scalar, optional
+        Filling value for the first argument, default is 0.
+    filly : scalar, optional
+        Filling value for the second argument, default is 0.
+
+    """
+
+    def __init__(self, mbfunc, fillx=0, filly=0):
+        """
+        abfunc(fillx, filly) must be defined.
+
+        abfunc(x, filly) = x for all x to enable reduce.
+
+        """
+        super(_MaskedBinaryOperation, self).__init__(mbfunc)
+        self.fillx = fillx
+        self.filly = filly
+        ufunc_domain[mbfunc] = None
+        ufunc_fills[mbfunc] = (fillx, filly)
+
+    def __call__(self, a, b, *args, **kwargs):
+        """
+        Execute the call behavior.
+
+        """
+        # Get the data, as ndarray
+        (da, db) = (getdata(a), getdata(b))
+        # Get the result
+        with np.errstate():
+            np.seterr(divide='ignore', invalid='ignore')
+            result = self.f(da, db, *args, **kwargs)
+        # Get the mask for the result
+        (ma, mb) = (getmask(a), getmask(b))
+        if ma is nomask:
+            if mb is nomask:
+                m = nomask
+            else:
+                m = umath.logical_or(getmaskarray(a), mb)
+        elif mb is nomask:
+            m = umath.logical_or(ma, getmaskarray(b))
+        else:
+            m = umath.logical_or(ma, mb)
+
+        # Case 1. : scalar
+        if not result.ndim:
+            if m:
+                return masked
+            return result
+
+        # Case 2. : array
+        # Revert result to da where masked
+        if m is not nomask and m.any():
+            # any errors, just abort; impossible to guarantee masked values
+            try:
+                np.copyto(result, da, casting='unsafe', where=m)
+            except Exception:
+                pass
+
+        # Transforms to a (subclass of) MaskedArray
+        masked_result = result.view(get_masked_subclass(a, b))
+        masked_result._mask = m
+        if isinstance(a, MaskedArray):
+            masked_result._update_from(a)
+        elif isinstance(b, MaskedArray):
+            masked_result._update_from(b)
+        return masked_result
+
+    def reduce(self, target, axis=0, dtype=None):
+        """
+        Reduce `target` along the given `axis`.
+
+        """
+        tclass = get_masked_subclass(target)
+        m = getmask(target)
+        t = filled(target, self.filly)
+        if t.shape == ():
+            t = t.reshape(1)
+            if m is not nomask:
+                m = make_mask(m, copy=True)
+                m.shape = (1,)
+
+        if m is nomask:
+            tr = self.f.reduce(t, axis)
+            mr = nomask
+        else:
+            tr = self.f.reduce(t, axis, dtype=dtype or t.dtype)
+            mr = umath.logical_and.reduce(m, axis)
+
+        if not tr.shape:
+            if mr:
+                return masked
+            else:
+                return tr
+        masked_tr = tr.view(tclass)
+        masked_tr._mask = mr
+        return masked_tr
+
+    def outer(self, a, b):
+        """
+        Return the function applied to the outer product of a and b.
+
+        """
+        (da, db) = (getdata(a), getdata(b))
+        d = self.f.outer(da, db)
+        ma = getmask(a)
+        mb = getmask(b)
+        if ma is nomask and mb is nomask:
+            m = nomask
+        else:
+            ma = getmaskarray(a)
+            mb = getmaskarray(b)
+            m = umath.logical_or.outer(ma, mb)
+        if (not m.ndim) and m:
+            return masked
+        if m is not nomask:
+            np.copyto(d, da, where=m)
+        if not d.shape:
+            return d
+        masked_d = d.view(get_masked_subclass(a, b))
+        masked_d._mask = m
+        return masked_d
+
+    def accumulate(self, target, axis=0):
+        """Accumulate `target` along `axis` after filling with y fill
+        value.
+
+        """
+        tclass = get_masked_subclass(target)
+        t = filled(target, self.filly)
+        result = self.f.accumulate(t, axis)
+        masked_result = result.view(tclass)
+        return masked_result
+
+
+
+class _DomainedBinaryOperation(_MaskedUFunc):
+    """
+    Define binary operations that have a domain, like divide.
+
+    They have no reduce, outer or accumulate.
+
+    Parameters
+    ----------
+    mbfunc : function
+        The function for which to define a masked version. Made available
+        as ``_DomainedBinaryOperation.f``.
+    domain : class instance
+        Default domain for the function. Should be one of the ``_Domain*``
+        classes.
+    fillx : scalar, optional
+        Filling value for the first argument, default is 0.
+    filly : scalar, optional
+        Filling value for the second argument, default is 0.
+
+    """
+
+    def __init__(self, dbfunc, domain, fillx=0, filly=0):
+        """abfunc(fillx, filly) must be defined.
+           abfunc(x, filly) = x for all x to enable reduce.
+        """
+        super(_DomainedBinaryOperation, self).__init__(dbfunc)
+        self.domain = domain
+        self.fillx = fillx
+        self.filly = filly
+        ufunc_domain[dbfunc] = domain
+        ufunc_fills[dbfunc] = (fillx, filly)
+
+    def __call__(self, a, b, *args, **kwargs):
+        "Execute the call behavior."
+        # Get the data
+        (da, db) = (getdata(a), getdata(b))
+        # Get the result
+        with np.errstate(divide='ignore', invalid='ignore'):
+            result = self.f(da, db, *args, **kwargs)
+        # Get the mask as a combination of the source masks and invalid
+        m = ~umath.isfinite(result)
+        m |= getmask(a)
+        m |= getmask(b)
+        # Apply the domain
+        domain = ufunc_domain.get(self.f, None)
+        if domain is not None:
+            m |= domain(da, db)
+        # Take care of the scalar case first
+        if not m.ndim:
+            if m:
+                return masked
+            else:
+                return result
+        # When the mask is True, put back da if possible
+        # any errors, just abort; impossible to guarantee masked values
+        try:
+            np.copyto(result, 0, casting='unsafe', where=m)
+            # avoid using "*" since this may be overlaid
+            masked_da = umath.multiply(m, da)
+            # only add back if it can be cast safely
+            if np.can_cast(masked_da.dtype, result.dtype, casting='safe'):
+                result += masked_da
+        except Exception:
+            pass
+
+        # Transforms to a (subclass of) MaskedArray
+        masked_result = result.view(get_masked_subclass(a, b))
+        masked_result._mask = m
+        if isinstance(a, MaskedArray):
+            masked_result._update_from(a)
+        elif isinstance(b, MaskedArray):
+            masked_result._update_from(b)
+        return masked_result
+
+
+# Unary ufuncs
+exp = _MaskedUnaryOperation(umath.exp)
+conjugate = _MaskedUnaryOperation(umath.conjugate)
+sin = _MaskedUnaryOperation(umath.sin)
+cos = _MaskedUnaryOperation(umath.cos)
+arctan = _MaskedUnaryOperation(umath.arctan)
+arcsinh = _MaskedUnaryOperation(umath.arcsinh)
+sinh = _MaskedUnaryOperation(umath.sinh)
+cosh = _MaskedUnaryOperation(umath.cosh)
+tanh = _MaskedUnaryOperation(umath.tanh)
+abs = absolute = _MaskedUnaryOperation(umath.absolute)
+angle = _MaskedUnaryOperation(angle)  # from numpy.lib.function_base
+fabs = _MaskedUnaryOperation(umath.fabs)
+negative = _MaskedUnaryOperation(umath.negative)
+floor = _MaskedUnaryOperation(umath.floor)
+ceil = _MaskedUnaryOperation(umath.ceil)
+around = _MaskedUnaryOperation(np.round_)
+logical_not = _MaskedUnaryOperation(umath.logical_not)
+
+# Domained unary ufuncs
+sqrt = _MaskedUnaryOperation(umath.sqrt, 0.0,
+                             _DomainGreaterEqual(0.0))
+log = _MaskedUnaryOperation(umath.log, 1.0,
+                            _DomainGreater(0.0))
+log2 = _MaskedUnaryOperation(umath.log2, 1.0,
+                             _DomainGreater(0.0))
+log10 = _MaskedUnaryOperation(umath.log10, 1.0,
+                              _DomainGreater(0.0))
+tan = _MaskedUnaryOperation(umath.tan, 0.0,
+                            _DomainTan(1e-35))
+arcsin = _MaskedUnaryOperation(umath.arcsin, 0.0,
+                               _DomainCheckInterval(-1.0, 1.0))
+arccos = _MaskedUnaryOperation(umath.arccos, 0.0,
+                               _DomainCheckInterval(-1.0, 1.0))
+arccosh = _MaskedUnaryOperation(umath.arccosh, 1.0,
+                                _DomainGreaterEqual(1.0))
+arctanh = _MaskedUnaryOperation(umath.arctanh, 0.0,
+                                _DomainCheckInterval(-1.0 + 1e-15, 1.0 - 1e-15))
+
+# Binary ufuncs
+add = _MaskedBinaryOperation(umath.add)
+subtract = _MaskedBinaryOperation(umath.subtract)
+multiply = _MaskedBinaryOperation(umath.multiply, 1, 1)
+arctan2 = _MaskedBinaryOperation(umath.arctan2, 0.0, 1.0)
+equal = _MaskedBinaryOperation(umath.equal)
+equal.reduce = None
+not_equal = _MaskedBinaryOperation(umath.not_equal)
+not_equal.reduce = None
+less_equal = _MaskedBinaryOperation(umath.less_equal)
+less_equal.reduce = None
+greater_equal = _MaskedBinaryOperation(umath.greater_equal)
+greater_equal.reduce = None
+less = _MaskedBinaryOperation(umath.less)
+less.reduce = None
+greater = _MaskedBinaryOperation(umath.greater)
+greater.reduce = None
+logical_and = _MaskedBinaryOperation(umath.logical_and)
+alltrue = _MaskedBinaryOperation(umath.logical_and, 1, 1).reduce
+logical_or = _MaskedBinaryOperation(umath.logical_or)
+sometrue = logical_or.reduce
+logical_xor = _MaskedBinaryOperation(umath.logical_xor)
+bitwise_and = _MaskedBinaryOperation(umath.bitwise_and)
+bitwise_or = _MaskedBinaryOperation(umath.bitwise_or)
+bitwise_xor = _MaskedBinaryOperation(umath.bitwise_xor)
+hypot = _MaskedBinaryOperation(umath.hypot)
+
+# Domained binary ufuncs
+divide = _DomainedBinaryOperation(umath.divide, _DomainSafeDivide(), 0, 1)
+true_divide = _DomainedBinaryOperation(umath.true_divide,
+                                       _DomainSafeDivide(), 0, 1)
+floor_divide = _DomainedBinaryOperation(umath.floor_divide,
+                                        _DomainSafeDivide(), 0, 1)
+remainder = _DomainedBinaryOperation(umath.remainder,
+                                     _DomainSafeDivide(), 0, 1)
+fmod = _DomainedBinaryOperation(umath.fmod, _DomainSafeDivide(), 0, 1)
+mod = _DomainedBinaryOperation(umath.mod, _DomainSafeDivide(), 0, 1)
+
+
+###############################################################################
+#                        Mask creation functions                              #
+###############################################################################
+
+
+def _replace_dtype_fields_recursive(dtype, primitive_dtype):
+    "Private function allowing recursion in _replace_dtype_fields."
+    _recurse = _replace_dtype_fields_recursive
+
+    # Do we have some name fields ?
+    if dtype.names is not None:
+        descr = []
+        for name in dtype.names:
+            field = dtype.fields[name]
+            if len(field) == 3:
+                # Prepend the title to the name
+                name = (field[-1], name)
+            descr.append((name, _recurse(field[0], primitive_dtype)))
+        new_dtype = np.dtype(descr)
+
+    # Is this some kind of composite a la (float,2)
+    elif dtype.subdtype:
+        descr = list(dtype.subdtype)
+        descr[0] = _recurse(dtype.subdtype[0], primitive_dtype)
+        new_dtype = np.dtype(tuple(descr))
+
+    # this is a primitive type, so do a direct replacement
+    else:
+        new_dtype = primitive_dtype
+
+    # preserve identity of dtypes
+    if new_dtype == dtype:
+        new_dtype = dtype
+
+    return new_dtype
+
+
+def _replace_dtype_fields(dtype, primitive_dtype):
+    """
+    Construct a dtype description list from a given dtype.
+
+    Returns a new dtype object, with all fields and subtypes in the given type
+    recursively replaced with `primitive_dtype`.
+
+    Arguments are coerced to dtypes first.
+    """
+    dtype = np.dtype(dtype)
+    primitive_dtype = np.dtype(primitive_dtype)
+    return _replace_dtype_fields_recursive(dtype, primitive_dtype)
+
+
+def make_mask_descr(ndtype):
+    """
+    Construct a dtype description list from a given dtype.
+
+    Returns a new dtype object, with the type of all fields in `ndtype` to a
+    boolean type. Field names are not altered.
+
+    Parameters
+    ----------
+    ndtype : dtype
+        The dtype to convert.
+
+    Returns
+    -------
+    result : dtype
+        A dtype that looks like `ndtype`, the type of all fields is boolean.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> dtype = np.dtype({'names':['foo', 'bar'],
+    ...                   'formats':[np.float32, np.int64]})
+    >>> dtype
+    dtype([('foo', '<f4'), ('bar', '<i8')])
+    >>> ma.make_mask_descr(dtype)
+    dtype([('foo', '|b1'), ('bar', '|b1')])
+    >>> ma.make_mask_descr(np.float32)
+    dtype('bool')
+
+    """
+    return _replace_dtype_fields(ndtype, MaskType)
+
+
+def getmask(a):
+    """
+    Return the mask of a masked array, or nomask.
+
+    Return the mask of `a` as an ndarray if `a` is a `MaskedArray` and the
+    mask is not `nomask`, else return `nomask`. To guarantee a full array
+    of booleans of the same shape as a, use `getmaskarray`.
+
+    Parameters
+    ----------
+    a : array_like
+        Input `MaskedArray` for which the mask is required.
+
+    See Also
+    --------
+    getdata : Return the data of a masked array as an ndarray.
+    getmaskarray : Return the mask of a masked array, or full array of False.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.masked_equal([[1,2],[3,4]], 2)
+    >>> a
+    masked_array(
+      data=[[1, --],
+            [3, 4]],
+      mask=[[False,  True],
+            [False, False]],
+      fill_value=2)
+    >>> ma.getmask(a)
+    array([[False,  True],
+           [False, False]])
+
+    Equivalently use the `MaskedArray` `mask` attribute.
+
+    >>> a.mask
+    array([[False,  True],
+           [False, False]])
+
+    Result when mask == `nomask`
+
+    >>> b = ma.masked_array([[1,2],[3,4]])
+    >>> b
+    masked_array(
+      data=[[1, 2],
+            [3, 4]],
+      mask=False,
+      fill_value=999999)
+    >>> ma.nomask
+    False
+    >>> ma.getmask(b) == ma.nomask
+    True
+    >>> b.mask == ma.nomask
+    True
+
+    """
+    return getattr(a, '_mask', nomask)
+
+
+get_mask = getmask
+
+
+def getmaskarray(arr):
+    """
+    Return the mask of a masked array, or full boolean array of False.
+
+    Return the mask of `arr` as an ndarray if `arr` is a `MaskedArray` and
+    the mask is not `nomask`, else return a full boolean array of False of
+    the same shape as `arr`.
+
+    Parameters
+    ----------
+    arr : array_like
+        Input `MaskedArray` for which the mask is required.
+
+    See Also
+    --------
+    getmask : Return the mask of a masked array, or nomask.
+    getdata : Return the data of a masked array as an ndarray.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.masked_equal([[1,2],[3,4]], 2)
+    >>> a
+    masked_array(
+      data=[[1, --],
+            [3, 4]],
+      mask=[[False,  True],
+            [False, False]],
+      fill_value=2)
+    >>> ma.getmaskarray(a)
+    array([[False,  True],
+           [False, False]])
+
+    Result when mask == ``nomask``
+
+    >>> b = ma.masked_array([[1,2],[3,4]])
+    >>> b
+    masked_array(
+      data=[[1, 2],
+            [3, 4]],
+      mask=False,
+      fill_value=999999)
+    >>> ma.getmaskarray(b)
+    array([[False, False],
+           [False, False]])
+
+    """
+    mask = getmask(arr)
+    if mask is nomask:
+        mask = make_mask_none(np.shape(arr), getattr(arr, 'dtype', None))
+    return mask
+
+
+def is_mask(m):
+    """
+    Return True if m is a valid, standard mask.
+
+    This function does not check the contents of the input, only that the
+    type is MaskType. In particular, this function returns False if the
+    mask has a flexible dtype.
+
+    Parameters
+    ----------
+    m : array_like
+        Array to test.
+
+    Returns
+    -------
+    result : bool
+        True if `m.dtype.type` is MaskType, False otherwise.
+
+    See Also
+    --------
+    isMaskedArray : Test whether input is an instance of MaskedArray.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> m = ma.masked_equal([0, 1, 0, 2, 3], 0)
+    >>> m
+    masked_array(data=[--, 1, --, 2, 3],
+                 mask=[ True, False,  True, False, False],
+           fill_value=0)
+    >>> ma.is_mask(m)
+    False
+    >>> ma.is_mask(m.mask)
+    True
+
+    Input must be an ndarray (or have similar attributes)
+    for it to be considered a valid mask.
+
+    >>> m = [False, True, False]
+    >>> ma.is_mask(m)
+    False
+    >>> m = np.array([False, True, False])
+    >>> m
+    array([False,  True, False])
+    >>> ma.is_mask(m)
+    True
+
+    Arrays with complex dtypes don't return True.
+
+    >>> dtype = np.dtype({'names':['monty', 'pithon'],
+    ...                   'formats':[bool, bool]})
+    >>> dtype
+    dtype([('monty', '|b1'), ('pithon', '|b1')])
+    >>> m = np.array([(True, False), (False, True), (True, False)],
+    ...              dtype=dtype)
+    >>> m
+    array([( True, False), (False,  True), ( True, False)],
+          dtype=[('monty', '?'), ('pithon', '?')])
+    >>> ma.is_mask(m)
+    False
+
+    """
+    try:
+        return m.dtype.type is MaskType
+    except AttributeError:
+        return False
+
+
+def _shrink_mask(m):
+    """
+    Shrink a mask to nomask if possible
+    """
+    if m.dtype.names is None and not m.any():
+        return nomask
+    else:
+        return m
+
+
+def make_mask(m, copy=False, shrink=True, dtype=MaskType):
+    """
+    Create a boolean mask from an array.
+
+    Return `m` as a boolean mask, creating a copy if necessary or requested.
+    The function can accept any sequence that is convertible to integers,
+    or ``nomask``.  Does not require that contents must be 0s and 1s, values
+    of 0 are interpreted as False, everything else as True.
+
+    Parameters
+    ----------
+    m : array_like
+        Potential mask.
+    copy : bool, optional
+        Whether to return a copy of `m` (True) or `m` itself (False).
+    shrink : bool, optional
+        Whether to shrink `m` to ``nomask`` if all its values are False.
+    dtype : dtype, optional
+        Data-type of the output mask. By default, the output mask has a
+        dtype of MaskType (bool). If the dtype is flexible, each field has
+        a boolean dtype. This is ignored when `m` is ``nomask``, in which
+        case ``nomask`` is always returned.
+
+    Returns
+    -------
+    result : ndarray
+        A boolean mask derived from `m`.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> m = [True, False, True, True]
+    >>> ma.make_mask(m)
+    array([ True, False,  True,  True])
+    >>> m = [1, 0, 1, 1]
+    >>> ma.make_mask(m)
+    array([ True, False,  True,  True])
+    >>> m = [1, 0, 2, -3]
+    >>> ma.make_mask(m)
+    array([ True, False,  True,  True])
+
+    Effect of the `shrink` parameter.
+
+    >>> m = np.zeros(4)
+    >>> m
+    array([0., 0., 0., 0.])
+    >>> ma.make_mask(m)
+    False
+    >>> ma.make_mask(m, shrink=False)
+    array([False, False, False, False])
+
+    Using a flexible `dtype`.
+
+    >>> m = [1, 0, 1, 1]
+    >>> n = [0, 1, 0, 0]
+    >>> arr = []
+    >>> for man, mouse in zip(m, n):
+    ...     arr.append((man, mouse))
+    >>> arr
+    [(1, 0), (0, 1), (1, 0), (1, 0)]
+    >>> dtype = np.dtype({'names':['man', 'mouse'],
+    ...                   'formats':[np.int64, np.int64]})
+    >>> arr = np.array(arr, dtype=dtype)
+    >>> arr
+    array([(1, 0), (0, 1), (1, 0), (1, 0)],
+          dtype=[('man', '<i8'), ('mouse', '<i8')])
+    >>> ma.make_mask(arr, dtype=dtype)
+    array([(True, False), (False, True), (True, False), (True, False)],
+          dtype=[('man', '|b1'), ('mouse', '|b1')])
+
+    """
+    if m is nomask:
+        return nomask
+
+    # Make sure the input dtype is valid.
+    dtype = make_mask_descr(dtype)
+
+    # legacy boolean special case: "existence of fields implies true"
+    if isinstance(m, ndarray) and m.dtype.fields and dtype == np.bool_:
+        return np.ones(m.shape, dtype=dtype)
+
+    # Fill the mask in case there are missing data; turn it into an ndarray.
+    result = np.array(filled(m, True), copy=copy, dtype=dtype, subok=True)
+    # Bas les masques !
+    if shrink:
+        result = _shrink_mask(result)
+    return result
+
+
+def make_mask_none(newshape, dtype=None):
+    """
+    Return a boolean mask of the given shape, filled with False.
+
+    This function returns a boolean ndarray with all entries False, that can
+    be used in common mask manipulations. If a complex dtype is specified, the
+    type of each field is converted to a boolean type.
+
+    Parameters
+    ----------
+    newshape : tuple
+        A tuple indicating the shape of the mask.
+    dtype : {None, dtype}, optional
+        If None, use a MaskType instance. Otherwise, use a new datatype with
+        the same fields as `dtype`, converted to boolean types.
+
+    Returns
+    -------
+    result : ndarray
+        An ndarray of appropriate shape and dtype, filled with False.
+
+    See Also
+    --------
+    make_mask : Create a boolean mask from an array.
+    make_mask_descr : Construct a dtype description list from a given dtype.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> ma.make_mask_none((3,))
+    array([False, False, False])
+
+    Defining a more complex dtype.
+
+    >>> dtype = np.dtype({'names':['foo', 'bar'],
+    ...                   'formats':[np.float32, np.int64]})
+    >>> dtype
+    dtype([('foo', '<f4'), ('bar', '<i8')])
+    >>> ma.make_mask_none((3,), dtype=dtype)
+    array([(False, False), (False, False), (False, False)],
+          dtype=[('foo', '|b1'), ('bar', '|b1')])
+
+    """
+    if dtype is None:
+        result = np.zeros(newshape, dtype=MaskType)
+    else:
+        result = np.zeros(newshape, dtype=make_mask_descr(dtype))
+    return result
+
+
+def mask_or(m1, m2, copy=False, shrink=True):
+    """
+    Combine two masks with the ``logical_or`` operator.
+
+    The result may be a view on `m1` or `m2` if the other is `nomask`
+    (i.e. False).
+
+    Parameters
+    ----------
+    m1, m2 : array_like
+        Input masks.
+    copy : bool, optional
+        If copy is False and one of the inputs is `nomask`, return a view
+        of the other input mask. Defaults to False.
+    shrink : bool, optional
+        Whether to shrink the output to `nomask` if all its values are
+        False. Defaults to True.
+
+    Returns
+    -------
+    mask : output mask
+        The result masks values that are masked in either `m1` or `m2`.
+
+    Raises
+    ------
+    ValueError
+        If `m1` and `m2` have different flexible dtypes.
+
+    Examples
+    --------
+    >>> m1 = np.ma.make_mask([0, 1, 1, 0])
+    >>> m2 = np.ma.make_mask([1, 0, 0, 0])
+    >>> np.ma.mask_or(m1, m2)
+    array([ True,  True,  True, False])
+
+    """
+
+    @recursive
+    def _recursive_mask_or(self, m1, m2, newmask):
+        names = m1.dtype.names
+        for name in names:
+            current1 = m1[name]
+            if current1.dtype.names is not None:
+                self(current1, m2[name], newmask[name])
+            else:
+                umath.logical_or(current1, m2[name], newmask[name])
+        return
+
+    if (m1 is nomask) or (m1 is False):
+        dtype = getattr(m2, 'dtype', MaskType)
+        return make_mask(m2, copy=copy, shrink=shrink, dtype=dtype)
+    if (m2 is nomask) or (m2 is False):
+        dtype = getattr(m1, 'dtype', MaskType)
+        return make_mask(m1, copy=copy, shrink=shrink, dtype=dtype)
+    if m1 is m2 and is_mask(m1):
+        return m1
+    (dtype1, dtype2) = (getattr(m1, 'dtype', None), getattr(m2, 'dtype', None))
+    if dtype1 != dtype2:
+        raise ValueError("Incompatible dtypes '%s'<>'%s'" % (dtype1, dtype2))
+    if dtype1.names is not None:
+        # Allocate an output mask array with the properly broadcast shape.
+        newmask = np.empty(np.broadcast(m1, m2).shape, dtype1)
+        _recursive_mask_or(m1, m2, newmask)
+        return newmask
+    return make_mask(umath.logical_or(m1, m2), copy=copy, shrink=shrink)
+
+
+def flatten_mask(mask):
+    """
+    Returns a completely flattened version of the mask, where nested fields
+    are collapsed.
+
+    Parameters
+    ----------
+    mask : array_like
+        Input array, which will be interpreted as booleans.
+
+    Returns
+    -------
+    flattened_mask : ndarray of bools
+        The flattened input.
+
+    Examples
+    --------
+    >>> mask = np.array([0, 0, 1])
+    >>> np.ma.flatten_mask(mask)
+    array([False, False,  True])
+
+    >>> mask = np.array([(0, 0), (0, 1)], dtype=[('a', bool), ('b', bool)])
+    >>> np.ma.flatten_mask(mask)
+    array([False, False, False,  True])
+
+    >>> mdtype = [('a', bool), ('b', [('ba', bool), ('bb', bool)])]
+    >>> mask = np.array([(0, (0, 0)), (0, (0, 1))], dtype=mdtype)
+    >>> np.ma.flatten_mask(mask)
+    array([False, False, False, False, False,  True])
+
+    """
+
+    def _flatmask(mask):
+        "Flatten the mask and returns a (maybe nested) sequence of booleans."
+        mnames = mask.dtype.names
+        if mnames is not None:
+            return [flatten_mask(mask[name]) for name in mnames]
+        else:
+            return mask
+
+    def _flatsequence(sequence):
+        "Generates a flattened version of the sequence."
+        try:
+            for element in sequence:
+                if hasattr(element, '__iter__'):
+                    yield from _flatsequence(element)
+                else:
+                    yield element
+        except TypeError:
+            yield sequence
+
+    mask = np.asarray(mask)
+    flattened = _flatsequence(_flatmask(mask))
+    return np.array([_ for _ in flattened], dtype=bool)
+
+
+def _check_mask_axis(mask, axis, keepdims=np._NoValue):
+    "Check whether there are masked values along the given axis"
+    kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+    if mask is not nomask:
+        return mask.all(axis=axis, **kwargs)
+    return nomask
+
+
+###############################################################################
+#                             Masking functions                               #
+###############################################################################
+
+def masked_where(condition, a, copy=True):
+    """
+    Mask an array where a condition is met.
+
+    Return `a` as an array masked where `condition` is True.
+    Any masked values of `a` or `condition` are also masked in the output.
+
+    Parameters
+    ----------
+    condition : array_like
+        Masking condition.  When `condition` tests floating point values for
+        equality, consider using ``masked_values`` instead.
+    a : array_like
+        Array to mask.
+    copy : bool
+        If True (default) make a copy of `a` in the result.  If False modify
+        `a` in place and return a view.
+
+    Returns
+    -------
+    result : MaskedArray
+        The result of masking `a` where `condition` is True.
+
+    See Also
+    --------
+    masked_values : Mask using floating point equality.
+    masked_equal : Mask where equal to a given value.
+    masked_not_equal : Mask where `not` equal to a given value.
+    masked_less_equal : Mask where less than or equal to a given value.
+    masked_greater_equal : Mask where greater than or equal to a given value.
+    masked_less : Mask where less than a given value.
+    masked_greater : Mask where greater than a given value.
+    masked_inside : Mask inside a given interval.
+    masked_outside : Mask outside a given interval.
+    masked_invalid : Mask invalid values (NaNs or infs).
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_where(a <= 2, a)
+    masked_array(data=[--, --, --, 3],
+                 mask=[ True,  True,  True, False],
+           fill_value=999999)
+
+    Mask array `b` conditional on `a`.
+
+    >>> b = ['a', 'b', 'c', 'd']
+    >>> ma.masked_where(a == 2, b)
+    masked_array(data=['a', 'b', --, 'd'],
+                 mask=[False, False,  True, False],
+           fill_value='N/A',
+                dtype='<U1')
+
+    Effect of the `copy` argument.
+
+    >>> c = ma.masked_where(a <= 2, a)
+    >>> c
+    masked_array(data=[--, --, --, 3],
+                 mask=[ True,  True,  True, False],
+           fill_value=999999)
+    >>> c[0] = 99
+    >>> c
+    masked_array(data=[99, --, --, 3],
+                 mask=[False,  True,  True, False],
+           fill_value=999999)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> c = ma.masked_where(a <= 2, a, copy=False)
+    >>> c[0] = 99
+    >>> c
+    masked_array(data=[99, --, --, 3],
+                 mask=[False,  True,  True, False],
+           fill_value=999999)
+    >>> a
+    array([99,  1,  2,  3])
+
+    When `condition` or `a` contain masked values.
+
+    >>> a = np.arange(4)
+    >>> a = ma.masked_where(a == 2, a)
+    >>> a
+    masked_array(data=[0, 1, --, 3],
+                 mask=[False, False,  True, False],
+           fill_value=999999)
+    >>> b = np.arange(4)
+    >>> b = ma.masked_where(b == 0, b)
+    >>> b
+    masked_array(data=[--, 1, 2, 3],
+                 mask=[ True, False, False, False],
+           fill_value=999999)
+    >>> ma.masked_where(a == 3, b)
+    masked_array(data=[--, 1, --, --],
+                 mask=[ True, False,  True,  True],
+           fill_value=999999)
+
+    """
+    # Make sure that condition is a valid standard-type mask.
+    cond = make_mask(condition, shrink=False)
+    a = np.array(a, copy=copy, subok=True)
+
+    (cshape, ashape) = (cond.shape, a.shape)
+    if cshape and cshape != ashape:
+        raise IndexError("Inconsistent shape between the condition and the input"
+                         " (got %s and %s)" % (cshape, ashape))
+    if hasattr(a, '_mask'):
+        cond = mask_or(cond, a._mask)
+        cls = type(a)
+    else:
+        cls = MaskedArray
+    result = a.view(cls)
+    # Assign to *.mask so that structured masks are handled correctly.
+    result.mask = _shrink_mask(cond)
+    return result
+
+
+def masked_greater(x, value, copy=True):
+    """
+    Mask an array where greater than a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x > value).
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_greater(a, 2)
+    masked_array(data=[0, 1, 2, --],
+                 mask=[False, False, False,  True],
+           fill_value=999999)
+
+    """
+    return masked_where(greater(x, value), x, copy=copy)
+
+
+def masked_greater_equal(x, value, copy=True):
+    """
+    Mask an array where greater than or equal to a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x >= value).
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_greater_equal(a, 2)
+    masked_array(data=[0, 1, --, --],
+                 mask=[False, False,  True,  True],
+           fill_value=999999)
+
+    """
+    return masked_where(greater_equal(x, value), x, copy=copy)
+
+
+def masked_less(x, value, copy=True):
+    """
+    Mask an array where less than a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x < value).
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_less(a, 2)
+    masked_array(data=[--, --, 2, 3],
+                 mask=[ True,  True, False, False],
+           fill_value=999999)
+
+    """
+    return masked_where(less(x, value), x, copy=copy)
+
+
+def masked_less_equal(x, value, copy=True):
+    """
+    Mask an array where less than or equal to a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x <= value).
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_less_equal(a, 2)
+    masked_array(data=[--, --, --, 3],
+                 mask=[ True,  True,  True, False],
+           fill_value=999999)
+
+    """
+    return masked_where(less_equal(x, value), x, copy=copy)
+
+
+def masked_not_equal(x, value, copy=True):
+    """
+    Mask an array where `not` equal to a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x != value).
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_not_equal(a, 2)
+    masked_array(data=[--, --, 2, --],
+                 mask=[ True,  True, False,  True],
+           fill_value=999999)
+
+    """
+    return masked_where(not_equal(x, value), x, copy=copy)
+
+
+def masked_equal(x, value, copy=True):
+    """
+    Mask an array where equal to a given value.
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = (x == value).  For floating point arrays,
+    consider using ``masked_values(x, value)``.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+    masked_values : Mask using floating point equality.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(4)
+    >>> a
+    array([0, 1, 2, 3])
+    >>> ma.masked_equal(a, 2)
+    masked_array(data=[0, 1, --, 3],
+                 mask=[False, False,  True, False],
+           fill_value=2)
+
+    """
+    output = masked_where(equal(x, value), x, copy=copy)
+    output.fill_value = value
+    return output
+
+
+def masked_inside(x, v1, v2, copy=True):
+    """
+    Mask an array inside a given interval.
+
+    Shortcut to ``masked_where``, where `condition` is True for `x` inside
+    the interval [v1,v2] (v1 <= x <= v2).  The boundaries `v1` and `v2`
+    can be given in either order.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Notes
+    -----
+    The array `x` is prefilled with its filling value.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> x = [0.31, 1.2, 0.01, 0.2, -0.4, -1.1]
+    >>> ma.masked_inside(x, -0.3, 0.3)
+    masked_array(data=[0.31, 1.2, --, --, -0.4, -1.1],
+                 mask=[False, False,  True,  True, False, False],
+           fill_value=1e+20)
+
+    The order of `v1` and `v2` doesn't matter.
+
+    >>> ma.masked_inside(x, 0.3, -0.3)
+    masked_array(data=[0.31, 1.2, --, --, -0.4, -1.1],
+                 mask=[False, False,  True,  True, False, False],
+           fill_value=1e+20)
+
+    """
+    if v2 < v1:
+        (v1, v2) = (v2, v1)
+    xf = filled(x)
+    condition = (xf >= v1) & (xf <= v2)
+    return masked_where(condition, x, copy=copy)
+
+
+def masked_outside(x, v1, v2, copy=True):
+    """
+    Mask an array outside a given interval.
+
+    Shortcut to ``masked_where``, where `condition` is True for `x` outside
+    the interval [v1,v2] (x < v1)|(x > v2).
+    The boundaries `v1` and `v2` can be given in either order.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Notes
+    -----
+    The array `x` is prefilled with its filling value.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> x = [0.31, 1.2, 0.01, 0.2, -0.4, -1.1]
+    >>> ma.masked_outside(x, -0.3, 0.3)
+    masked_array(data=[--, --, 0.01, 0.2, --, --],
+                 mask=[ True,  True, False, False,  True,  True],
+           fill_value=1e+20)
+
+    The order of `v1` and `v2` doesn't matter.
+
+    >>> ma.masked_outside(x, 0.3, -0.3)
+    masked_array(data=[--, --, 0.01, 0.2, --, --],
+                 mask=[ True,  True, False, False,  True,  True],
+           fill_value=1e+20)
+
+    """
+    if v2 < v1:
+        (v1, v2) = (v2, v1)
+    xf = filled(x)
+    condition = (xf < v1) | (xf > v2)
+    return masked_where(condition, x, copy=copy)
+
+
+def masked_object(x, value, copy=True, shrink=True):
+    """
+    Mask the array `x` where the data are exactly equal to value.
+
+    This function is similar to `masked_values`, but only suitable
+    for object arrays: for floating point, use `masked_values` instead.
+
+    Parameters
+    ----------
+    x : array_like
+        Array to mask
+    value : object
+        Comparison value
+    copy : {True, False}, optional
+        Whether to return a copy of `x`.
+    shrink : {True, False}, optional
+        Whether to collapse a mask full of False to nomask
+
+    Returns
+    -------
+    result : MaskedArray
+        The result of masking `x` where equal to `value`.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+    masked_equal : Mask where equal to a given value (integers).
+    masked_values : Mask using floating point equality.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> food = np.array(['green_eggs', 'ham'], dtype=object)
+    >>> # don't eat spoiled food
+    >>> eat = ma.masked_object(food, 'green_eggs')
+    >>> eat
+    masked_array(data=[--, 'ham'],
+                 mask=[ True, False],
+           fill_value='green_eggs',
+                dtype=object)
+    >>> # plain ol` ham is boring
+    >>> fresh_food = np.array(['cheese', 'ham', 'pineapple'], dtype=object)
+    >>> eat = ma.masked_object(fresh_food, 'green_eggs')
+    >>> eat
+    masked_array(data=['cheese', 'ham', 'pineapple'],
+                 mask=False,
+           fill_value='green_eggs',
+                dtype=object)
+
+    Note that `mask` is set to ``nomask`` if possible.
+
+    >>> eat
+    masked_array(data=['cheese', 'ham', 'pineapple'],
+                 mask=False,
+           fill_value='green_eggs',
+                dtype=object)
+
+    """
+    if isMaskedArray(x):
+        condition = umath.equal(x._data, value)
+        mask = x._mask
+    else:
+        condition = umath.equal(np.asarray(x), value)
+        mask = nomask
+    mask = mask_or(mask, make_mask(condition, shrink=shrink))
+    return masked_array(x, mask=mask, copy=copy, fill_value=value)
+
+
+def masked_values(x, value, rtol=1e-5, atol=1e-8, copy=True, shrink=True):
+    """
+    Mask using floating point equality.
+
+    Return a MaskedArray, masked where the data in array `x` are approximately
+    equal to `value`, determined using `isclose`. The default tolerances for
+    `masked_values` are the same as those for `isclose`.
+
+    For integer types, exact equality is used, in the same way as
+    `masked_equal`.
+
+    The fill_value is set to `value` and the mask is set to ``nomask`` if
+    possible.
+
+    Parameters
+    ----------
+    x : array_like
+        Array to mask.
+    value : float
+        Masking value.
+    rtol, atol : float, optional
+        Tolerance parameters passed on to `isclose`
+    copy : bool, optional
+        Whether to return a copy of `x`.
+    shrink : bool, optional
+        Whether to collapse a mask full of False to ``nomask``.
+
+    Returns
+    -------
+    result : MaskedArray
+        The result of masking `x` where approximately equal to `value`.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+    masked_equal : Mask where equal to a given value (integers).
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> x = np.array([1, 1.1, 2, 1.1, 3])
+    >>> ma.masked_values(x, 1.1)
+    masked_array(data=[1.0, --, 2.0, --, 3.0],
+                 mask=[False,  True, False,  True, False],
+           fill_value=1.1)
+
+    Note that `mask` is set to ``nomask`` if possible.
+
+    >>> ma.masked_values(x, 1.5)
+    masked_array(data=[1. , 1.1, 2. , 1.1, 3. ],
+                 mask=False,
+           fill_value=1.5)
+
+    For integers, the fill value will be different in general to the
+    result of ``masked_equal``.
+
+    >>> x = np.arange(5)
+    >>> x
+    array([0, 1, 2, 3, 4])
+    >>> ma.masked_values(x, 2)
+    masked_array(data=[0, 1, --, 3, 4],
+                 mask=[False, False,  True, False, False],
+           fill_value=2)
+    >>> ma.masked_equal(x, 2)
+    masked_array(data=[0, 1, --, 3, 4],
+                 mask=[False, False,  True, False, False],
+           fill_value=2)
+
+    """
+    xnew = filled(x, value)
+    if np.issubdtype(xnew.dtype, np.floating):
+        mask = np.isclose(xnew, value, atol=atol, rtol=rtol)
+    else:
+        mask = umath.equal(xnew, value)
+    ret = masked_array(xnew, mask=mask, copy=copy, fill_value=value)
+    if shrink:
+        ret.shrink_mask()
+    return ret
+
+
+def masked_invalid(a, copy=True):
+    """
+    Mask an array where invalid values occur (NaNs or infs).
+
+    This function is a shortcut to ``masked_where``, with
+    `condition` = ~(np.isfinite(a)). Any pre-existing mask is conserved.
+    Only applies to arrays with a dtype where NaNs or infs make sense
+    (i.e. floating point types), but accepts any array_like object.
+
+    See Also
+    --------
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(5, dtype=float)
+    >>> a[2] = np.NaN
+    >>> a[3] = np.PINF
+    >>> a
+    array([ 0.,  1., nan, inf,  4.])
+    >>> ma.masked_invalid(a)
+    masked_array(data=[0.0, 1.0, --, --, 4.0],
+                 mask=[False, False,  True,  True, False],
+           fill_value=1e+20)
+
+    """
+    a = np.array(a, copy=copy, subok=True)
+    mask = getattr(a, '_mask', None)
+    if mask is not None:
+        condition = ~(np.isfinite(getdata(a)))
+        if mask is not nomask:
+            condition |= mask
+        cls = type(a)
+    else:
+        condition = ~(np.isfinite(a))
+        cls = MaskedArray
+    result = a.view(cls)
+    result._mask = condition
+    return result
+
+
+###############################################################################
+#                            Printing options                                 #
+###############################################################################
+
+
+class _MaskedPrintOption:
+    """
+    Handle the string used to represent missing data in a masked array.
+
+    """
+
+    def __init__(self, display):
+        """
+        Create the masked_print_option object.
+
+        """
+        self._display = display
+        self._enabled = True
+
+    def display(self):
+        """
+        Display the string to print for masked values.
+
+        """
+        return self._display
+
+    def set_display(self, s):
+        """
+        Set the string to print for masked values.
+
+        """
+        self._display = s
+
+    def enabled(self):
+        """
+        Is the use of the display value enabled?
+
+        """
+        return self._enabled
+
+    def enable(self, shrink=1):
+        """
+        Set the enabling shrink to `shrink`.
+
+        """
+        self._enabled = shrink
+
+    def __str__(self):
+        return str(self._display)
+
+    __repr__ = __str__
+
+# if you single index into a masked location you get this object.
+masked_print_option = _MaskedPrintOption('--')
+
+
+def _recursive_printoption(result, mask, printopt):
+    """
+    Puts printoptions in result where mask is True.
+
+    Private function allowing for recursion
+
+    """
+    names = result.dtype.names
+    if names is not None:
+        for name in names:
+            curdata = result[name]
+            curmask = mask[name]
+            _recursive_printoption(curdata, curmask, printopt)
+    else:
+        np.copyto(result, printopt, where=mask)
+    return
+
+# For better or worse, these end in a newline
+_legacy_print_templates = dict(
+    long_std=textwrap.dedent("""\
+        masked_%(name)s(data =
+         %(data)s,
+        %(nlen)s        mask =
+         %(mask)s,
+        %(nlen)s  fill_value = %(fill)s)
+        """),
+    long_flx=textwrap.dedent("""\
+        masked_%(name)s(data =
+         %(data)s,
+        %(nlen)s        mask =
+         %(mask)s,
+        %(nlen)s  fill_value = %(fill)s,
+        %(nlen)s       dtype = %(dtype)s)
+        """),
+    short_std=textwrap.dedent("""\
+        masked_%(name)s(data = %(data)s,
+        %(nlen)s        mask = %(mask)s,
+        %(nlen)s  fill_value = %(fill)s)
+        """),
+    short_flx=textwrap.dedent("""\
+        masked_%(name)s(data = %(data)s,
+        %(nlen)s        mask = %(mask)s,
+        %(nlen)s  fill_value = %(fill)s,
+        %(nlen)s       dtype = %(dtype)s)
+        """)
+)
+
+###############################################################################
+#                          MaskedArray class                                  #
+###############################################################################
+
+
+def _recursive_filled(a, mask, fill_value):
+    """
+    Recursively fill `a` with `fill_value`.
+
+    """
+    names = a.dtype.names
+    for name in names:
+        current = a[name]
+        if current.dtype.names is not None:
+            _recursive_filled(current, mask[name], fill_value[name])
+        else:
+            np.copyto(current, fill_value[name], where=mask[name])
+
+
+def flatten_structured_array(a):
+    """
+    Flatten a structured array.
+
+    The data type of the output is chosen such that it can represent all of the
+    (nested) fields.
+
+    Parameters
+    ----------
+    a : structured array
+
+    Returns
+    -------
+    output : masked array or ndarray
+        A flattened masked array if the input is a masked array, otherwise a
+        standard ndarray.
+
+    Examples
+    --------
+    >>> ndtype = [('a', int), ('b', float)]
+    >>> a = np.array([(1, 1), (2, 2)], dtype=ndtype)
+    >>> np.ma.flatten_structured_array(a)
+    array([[1., 1.],
+           [2., 2.]])
+
+    """
+
+    def flatten_sequence(iterable):
+        """
+        Flattens a compound of nested iterables.
+
+        """
+        for elm in iter(iterable):
+            if hasattr(elm, '__iter__'):
+                yield from flatten_sequence(elm)
+            else:
+                yield elm
+
+    a = np.asanyarray(a)
+    inishape = a.shape
+    a = a.ravel()
+    if isinstance(a, MaskedArray):
+        out = np.array([tuple(flatten_sequence(d.item())) for d in a._data])
+        out = out.view(MaskedArray)
+        out._mask = np.array([tuple(flatten_sequence(d.item()))
+                              for d in getmaskarray(a)])
+    else:
+        out = np.array([tuple(flatten_sequence(d.item())) for d in a])
+    if len(inishape) > 1:
+        newshape = list(out.shape)
+        newshape[0] = inishape
+        out.shape = tuple(flatten_sequence(newshape))
+    return out
+
+
+def _arraymethod(funcname, onmask=True):
+    """
+    Return a class method wrapper around a basic array method.
+
+    Creates a class method which returns a masked array, where the new
+    ``_data`` array is the output of the corresponding basic method called
+    on the original ``_data``.
+
+    If `onmask` is True, the new mask is the output of the method called
+    on the initial mask. Otherwise, the new mask is just a reference
+    to the initial mask.
+
+    Parameters
+    ----------
+    funcname : str
+        Name of the function to apply on data.
+    onmask : bool
+        Whether the mask must be processed also (True) or left
+        alone (False). Default is True. Make available as `_onmask`
+        attribute.
+
+    Returns
+    -------
+    method : instancemethod
+        Class method wrapper of the specified basic array method.
+
+    """
+    def wrapped_method(self, *args, **params):
+        result = getattr(self._data, funcname)(*args, **params)
+        result = result.view(type(self))
+        result._update_from(self)
+        mask = self._mask
+        if not onmask:
+            result.__setmask__(mask)
+        elif mask is not nomask:
+            # __setmask__ makes a copy, which we don't want
+            result._mask = getattr(mask, funcname)(*args, **params)
+        return result
+    methdoc = getattr(ndarray, funcname, None) or getattr(np, funcname, None)
+    if methdoc is not None:
+        wrapped_method.__doc__ = methdoc.__doc__
+    wrapped_method.__name__ = funcname
+    return wrapped_method
+
+
+class MaskedIterator:
+    """
+    Flat iterator object to iterate over masked arrays.
+
+    A `MaskedIterator` iterator is returned by ``x.flat`` for any masked array
+    `x`. It allows iterating over the array as if it were a 1-D array,
+    either in a for-loop or by calling its `next` method.
+
+    Iteration is done in C-contiguous style, with the last index varying the
+    fastest. The iterator can also be indexed using basic slicing or
+    advanced indexing.
+
+    See Also
+    --------
+    MaskedArray.flat : Return a flat iterator over an array.
+    MaskedArray.flatten : Returns a flattened copy of an array.
+
+    Notes
+    -----
+    `MaskedIterator` is not exported by the `ma` module. Instead of
+    instantiating a `MaskedIterator` directly, use `MaskedArray.flat`.
+
+    Examples
+    --------
+    >>> x = np.ma.array(arange(6).reshape(2, 3))
+    >>> fl = x.flat
+    >>> type(fl)
+    <class 'numpy.ma.core.MaskedIterator'>
+    >>> for item in fl:
+    ...     print(item)
+    ...
+    0
+    1
+    2
+    3
+    4
+    5
+
+    Extracting more than a single element b indexing the `MaskedIterator`
+    returns a masked array:
+
+    >>> fl[2:4]
+    masked_array(data = [2 3],
+                 mask = False,
+           fill_value = 999999)
+
+    """
+
+    def __init__(self, ma):
+        self.ma = ma
+        self.dataiter = ma._data.flat
+
+        if ma._mask is nomask:
+            self.maskiter = None
+        else:
+            self.maskiter = ma._mask.flat
+
+    def __iter__(self):
+        return self
+
+    def __getitem__(self, indx):
+        result = self.dataiter.__getitem__(indx).view(type(self.ma))
+        if self.maskiter is not None:
+            _mask = self.maskiter.__getitem__(indx)
+            if isinstance(_mask, ndarray):
+                # set shape to match that of data; this is needed for matrices
+                _mask.shape = result.shape
+                result._mask = _mask
+            elif isinstance(_mask, np.void):
+                return mvoid(result, mask=_mask, hardmask=self.ma._hardmask)
+            elif _mask:  # Just a scalar, masked
+                return masked
+        return result
+
+    # This won't work if ravel makes a copy
+    def __setitem__(self, index, value):
+        self.dataiter[index] = getdata(value)
+        if self.maskiter is not None:
+            self.maskiter[index] = getmaskarray(value)
+
+    def __next__(self):
+        """
+        Return the next value, or raise StopIteration.
+
+        Examples
+        --------
+        >>> x = np.ma.array([3, 2], mask=[0, 1])
+        >>> fl = x.flat
+        >>> next(fl)
+        3
+        >>> next(fl)
+        masked
+        >>> next(fl)
+        Traceback (most recent call last):
+          ...
+        StopIteration
+
+        """
+        d = next(self.dataiter)
+        if self.maskiter is not None:
+            m = next(self.maskiter)
+            if isinstance(m, np.void):
+                return mvoid(d, mask=m, hardmask=self.ma._hardmask)
+            elif m:  # Just a scalar, masked
+                return masked
+        return d
+
+
+class MaskedArray(ndarray):
+    """
+    An array class with possibly masked values.
+
+    Masked values of True exclude the corresponding element from any
+    computation.
+
+    Construction::
+
+      x = MaskedArray(data, mask=nomask, dtype=None, copy=False, subok=True,
+                      ndmin=0, fill_value=None, keep_mask=True, hard_mask=None,
+                      shrink=True, order=None)
+
+    Parameters
+    ----------
+    data : array_like
+        Input data.
+    mask : sequence, optional
+        Mask. Must be convertible to an array of booleans with the same
+        shape as `data`. True indicates a masked (i.e. invalid) data.
+    dtype : dtype, optional
+        Data type of the output.
+        If `dtype` is None, the type of the data argument (``data.dtype``)
+        is used. If `dtype` is not None and different from ``data.dtype``,
+        a copy is performed.
+    copy : bool, optional
+        Whether to copy the input data (True), or to use a reference instead.
+        Default is False.
+    subok : bool, optional
+        Whether to return a subclass of `MaskedArray` if possible (True) or a
+        plain `MaskedArray`. Default is True.
+    ndmin : int, optional
+        Minimum number of dimensions. Default is 0.
+    fill_value : scalar, optional
+        Value used to fill in the masked values when necessary.
+        If None, a default based on the data-type is used.
+    keep_mask : bool, optional
+        Whether to combine `mask` with the mask of the input data, if any
+        (True), or to use only `mask` for the output (False). Default is True.
+    hard_mask : bool, optional
+        Whether to use a hard mask or not. With a hard mask, masked values
+        cannot be unmasked. Default is False.
+    shrink : bool, optional
+        Whether to force compression of an empty mask. Default is True.
+    order : {'C', 'F', 'A'}, optional
+        Specify the order of the array.  If order is 'C', then the array
+        will be in C-contiguous order (last-index varies the fastest).
+        If order is 'F', then the returned array will be in
+        Fortran-contiguous order (first-index varies the fastest).
+        If order is 'A' (default), then the returned array may be
+        in any order (either C-, Fortran-contiguous, or even discontiguous),
+        unless a copy is required, in which case it will be C-contiguous.
+
+    Examples
+    --------
+
+    The ``mask`` can be initialized with an array of boolean values
+    with the same shape as ``data``.
+
+    >>> data = np.arange(6).reshape((2, 3))
+    >>> np.ma.MaskedArray(data, mask=[[False, True, False],
+    ...                               [False, False, True]])
+    masked_array(
+      data=[[0, --, 2],
+            [3, 4, --]],
+      mask=[[False,  True, False],
+            [False, False,  True]],
+      fill_value=999999)
+
+    Alternatively, the ``mask`` can be initialized to homogeneous boolean
+    array with the same shape as ``data`` by passing in a scalar
+    boolean value:
+
+    >>> np.ma.MaskedArray(data, mask=False)
+    masked_array(
+      data=[[0, 1, 2],
+            [3, 4, 5]],
+      mask=[[False, False, False],
+            [False, False, False]],
+      fill_value=999999)
+
+    >>> np.ma.MaskedArray(data, mask=True)
+    masked_array(
+      data=[[--, --, --],
+            [--, --, --]],
+      mask=[[ True,  True,  True],
+            [ True,  True,  True]],
+      fill_value=999999,
+      dtype=int64)
+
+    .. note::
+        The recommended practice for initializing ``mask`` with a scalar
+        boolean value is to use ``True``/``False`` rather than
+        ``np.True_``/``np.False_``. The reason is :attr:`nomask`
+        is represented internally as ``np.False_``.
+
+        >>> np.False_ is np.ma.nomask
+        True
+
+    """
+
+    __array_priority__ = 15
+    _defaultmask = nomask
+    _defaulthardmask = False
+    _baseclass = ndarray
+
+    # Maximum number of elements per axis used when printing an array. The
+    # 1d case is handled separately because we need more values in this case.
+    _print_width = 100
+    _print_width_1d = 1500
+
+    def __new__(cls, data=None, mask=nomask, dtype=None, copy=False,
+                subok=True, ndmin=0, fill_value=None, keep_mask=True,
+                hard_mask=None, shrink=True, order=None, **options):
+        """
+        Create a new masked array from scratch.
+
+        Notes
+        -----
+        A masked array can also be created by taking a .view(MaskedArray).
+
+        """
+        # Process data.
+        _data = np.array(data, dtype=dtype, copy=copy,
+                         order=order, subok=True, ndmin=ndmin)
+        _baseclass = getattr(data, '_baseclass', type(_data))
+        # Check that we're not erasing the mask.
+        if isinstance(data, MaskedArray) and (data.shape != _data.shape):
+            copy = True
+
+        # Here, we copy the _view_, so that we can attach new properties to it
+        # we must never do .view(MaskedConstant), as that would create a new
+        # instance of np.ma.masked, which make identity comparison fail
+        if isinstance(data, cls) and subok and not isinstance(data, MaskedConstant):
+            _data = ndarray.view(_data, type(data))
+        else:
+            _data = ndarray.view(_data, cls)
+        # Backwards compatibility w/ numpy.core.ma.
+        if hasattr(data, '_mask') and not isinstance(data, ndarray):
+            _data._mask = data._mask
+            # FIXME _sharedmask is never used.
+            _sharedmask = True
+        # Process mask.
+        # Type of the mask
+        mdtype = make_mask_descr(_data.dtype)
+
+        if mask is nomask:
+            # Case 1. : no mask in input.
+            # Erase the current mask ?
+            if not keep_mask:
+                # With a reduced version
+                if shrink:
+                    _data._mask = nomask
+                # With full version
+                else:
+                    _data._mask = np.zeros(_data.shape, dtype=mdtype)
+            # Check whether we missed something
+            elif isinstance(data, (tuple, list)):
+                try:
+                    # If data is a sequence of masked array
+                    mask = np.array([getmaskarray(np.asanyarray(m, dtype=mdtype))
+                                                    for m in data], dtype=mdtype)
+                except ValueError:
+                    # If data is nested
+                    mask = nomask
+                # Force shrinking of the mask if needed (and possible)
+                if (mdtype == MaskType) and mask.any():
+                    _data._mask = mask
+                    _data._sharedmask = False
+            else:
+                _data._sharedmask = not copy
+                if copy:
+                    _data._mask = _data._mask.copy()
+                    # Reset the shape of the original mask
+                    if getmask(data) is not nomask:
+                        data._mask.shape = data.shape
+        else:
+            # Case 2. : With a mask in input.
+            # If mask is boolean, create an array of True or False
+            if mask is True and mdtype == MaskType:
+                mask = np.ones(_data.shape, dtype=mdtype)
+            elif mask is False and mdtype == MaskType:
+                mask = np.zeros(_data.shape, dtype=mdtype)
+            else:
+                # Read the mask with the current mdtype
+                try:
+                    mask = np.array(mask, copy=copy, dtype=mdtype)
+                # Or assume it's a sequence of bool/int
+                except TypeError:
+                    mask = np.array([tuple([m] * len(mdtype)) for m in mask],
+                                    dtype=mdtype)
+            # Make sure the mask and the data have the same shape
+            if mask.shape != _data.shape:
+                (nd, nm) = (_data.size, mask.size)
+                if nm == 1:
+                    mask = np.resize(mask, _data.shape)
+                elif nm == nd:
+                    mask = np.reshape(mask, _data.shape)
+                else:
+                    msg = "Mask and data not compatible: data size is %i, " + \
+                          "mask size is %i."
+                    raise MaskError(msg % (nd, nm))
+                copy = True
+            # Set the mask to the new value
+            if _data._mask is nomask:
+                _data._mask = mask
+                _data._sharedmask = not copy
+            else:
+                if not keep_mask:
+                    _data._mask = mask
+                    _data._sharedmask = not copy
+                else:
+                    if _data.dtype.names is not None:
+                        def _recursive_or(a, b):
+                            "do a|=b on each field of a, recursively"
+                            for name in a.dtype.names:
+                                (af, bf) = (a[name], b[name])
+                                if af.dtype.names is not None:
+                                    _recursive_or(af, bf)
+                                else:
+                                    af |= bf
+
+                        _recursive_or(_data._mask, mask)
+                    else:
+                        _data._mask = np.logical_or(mask, _data._mask)
+                    _data._sharedmask = False
+        # Update fill_value.
+        if fill_value is None:
+            fill_value = getattr(data, '_fill_value', None)
+        # But don't run the check unless we have something to check.
+        if fill_value is not None:
+            _data._fill_value = _check_fill_value(fill_value, _data.dtype)
+        # Process extra options ..
+        if hard_mask is None:
+            _data._hardmask = getattr(data, '_hardmask', False)
+        else:
+            _data._hardmask = hard_mask
+        _data._baseclass = _baseclass
+        return _data
+
+
+    def _update_from(self, obj):
+        """
+        Copies some attributes of obj to self.
+
+        """
+        if isinstance(obj, ndarray):
+            _baseclass = type(obj)
+        else:
+            _baseclass = ndarray
+        # We need to copy the _basedict to avoid backward propagation
+        _optinfo = {}
+        _optinfo.update(getattr(obj, '_optinfo', {}))
+        _optinfo.update(getattr(obj, '_basedict', {}))
+        if not isinstance(obj, MaskedArray):
+            _optinfo.update(getattr(obj, '__dict__', {}))
+        _dict = dict(_fill_value=getattr(obj, '_fill_value', None),
+                     _hardmask=getattr(obj, '_hardmask', False),
+                     _sharedmask=getattr(obj, '_sharedmask', False),
+                     _isfield=getattr(obj, '_isfield', False),
+                     _baseclass=getattr(obj, '_baseclass', _baseclass),
+                     _optinfo=_optinfo,
+                     _basedict=_optinfo)
+        self.__dict__.update(_dict)
+        self.__dict__.update(_optinfo)
+        return
+
+    def __array_finalize__(self, obj):
+        """
+        Finalizes the masked array.
+
+        """
+        # Get main attributes.
+        self._update_from(obj)
+
+        # We have to decide how to initialize self.mask, based on
+        # obj.mask. This is very difficult.  There might be some
+        # correspondence between the elements in the array we are being
+        # created from (= obj) and us. Or there might not. This method can
+        # be called in all kinds of places for all kinds of reasons -- could
+        # be empty_like, could be slicing, could be a ufunc, could be a view.
+        # The numpy subclassing interface simply doesn't give us any way
+        # to know, which means that at best this method will be based on
+        # guesswork and heuristics. To make things worse, there isn't even any
+        # clear consensus about what the desired behavior is. For instance,
+        # most users think that np.empty_like(marr) -- which goes via this
+        # method -- should return a masked array with an empty mask (see
+        # gh-3404 and linked discussions), but others disagree, and they have
+        # existing code which depends on empty_like returning an array that
+        # matches the input mask.
+        #
+        # Historically our algorithm was: if the template object mask had the
+        # same *number of elements* as us, then we used *it's mask object
+        # itself* as our mask, so that writes to us would also write to the
+        # original array. This is horribly broken in multiple ways.
+        #
+        # Now what we do instead is, if the template object mask has the same
+        # number of elements as us, and we do not have the same base pointer
+        # as the template object (b/c views like arr[...] should keep the same
+        # mask), then we make a copy of the template object mask and use
+        # that. This is also horribly broken but somewhat less so. Maybe.
+        if isinstance(obj, ndarray):
+            # XX: This looks like a bug -- shouldn't it check self.dtype
+            # instead?
+            if obj.dtype.names is not None:
+                _mask = getmaskarray(obj)
+            else:
+                _mask = getmask(obj)
+
+            # If self and obj point to exactly the same data, then probably
+            # self is a simple view of obj (e.g., self = obj[...]), so they
+            # should share the same mask. (This isn't 100% reliable, e.g. self
+            # could be the first row of obj, or have strange strides, but as a
+            # heuristic it's not bad.) In all other cases, we make a copy of
+            # the mask, so that future modifications to 'self' do not end up
+            # side-effecting 'obj' as well.
+            if (_mask is not nomask and obj.__array_interface__["data"][0]
+                    != self.__array_interface__["data"][0]):
+                # We should make a copy. But we could get here via astype,
+                # in which case the mask might need a new dtype as well
+                # (e.g., changing to or from a structured dtype), and the
+                # order could have changed. So, change the mask type if
+                # needed and use astype instead of copy.
+                if self.dtype == obj.dtype:
+                    _mask_dtype = _mask.dtype
+                else:
+                    _mask_dtype = make_mask_descr(self.dtype)
+
+                if self.flags.c_contiguous:
+                    order = "C"
+                elif self.flags.f_contiguous:
+                    order = "F"
+                else:
+                    order = "K"
+
+                _mask = _mask.astype(_mask_dtype, order)
+            else:
+                # Take a view so shape changes, etc., do not propagate back.
+                _mask = _mask.view()
+        else:
+            _mask = nomask
+
+        self._mask = _mask
+        # Finalize the mask
+        if self._mask is not nomask:
+            try:
+                self._mask.shape = self.shape
+            except ValueError:
+                self._mask = nomask
+            except (TypeError, AttributeError):
+                # When _mask.shape is not writable (because it's a void)
+                pass
+
+        # Finalize the fill_value
+        if self._fill_value is not None:
+            self._fill_value = _check_fill_value(self._fill_value, self.dtype)
+        elif self.dtype.names is not None:
+            # Finalize the default fill_value for structured arrays
+            self._fill_value = _check_fill_value(None, self.dtype)
+
+    def __array_wrap__(self, obj, context=None):
+        """
+        Special hook for ufuncs.
+
+        Wraps the numpy array and sets the mask according to context.
+
+        """
+        if obj is self:  # for in-place operations
+            result = obj
+        else:
+            result = obj.view(type(self))
+            result._update_from(self)
+
+        if context is not None:
+            result._mask = result._mask.copy()
+            func, args, out_i = context
+            # args sometimes contains outputs (gh-10459), which we don't want
+            input_args = args[:func.nin]
+            m = reduce(mask_or, [getmaskarray(arg) for arg in input_args])
+            # Get the domain mask
+            domain = ufunc_domain.get(func, None)
+            if domain is not None:
+                # Take the domain, and make sure it's a ndarray
+                with np.errstate(divide='ignore', invalid='ignore'):
+                    d = filled(domain(*input_args), True)
+
+                if d.any():
+                    # Fill the result where the domain is wrong
+                    try:
+                        # Binary domain: take the last value
+                        fill_value = ufunc_fills[func][-1]
+                    except TypeError:
+                        # Unary domain: just use this one
+                        fill_value = ufunc_fills[func]
+                    except KeyError:
+                        # Domain not recognized, use fill_value instead
+                        fill_value = self.fill_value
+
+                    np.copyto(result, fill_value, where=d)
+
+                    # Update the mask
+                    if m is nomask:
+                        m = d
+                    else:
+                        # Don't modify inplace, we risk back-propagation
+                        m = (m | d)
+
+            # Make sure the mask has the proper size
+            if result is not self and result.shape == () and m:
+                return masked
+            else:
+                result._mask = m
+                result._sharedmask = False
+
+        return result
+
+    def view(self, dtype=None, type=None, fill_value=None):
+        """
+        Return a view of the MaskedArray data.
+
+        Parameters
+        ----------
+        dtype : data-type or ndarray sub-class, optional
+            Data-type descriptor of the returned view, e.g., float32 or int16.
+            The default, None, results in the view having the same data-type
+            as `a`. As with ``ndarray.view``, dtype can also be specified as
+            an ndarray sub-class, which then specifies the type of the
+            returned object (this is equivalent to setting the ``type``
+            parameter).
+        type : Python type, optional
+            Type of the returned view, either ndarray or a subclass.  The
+            default None results in type preservation.
+        fill_value : scalar, optional
+            The value to use for invalid entries (None by default).
+            If None, then this argument is inferred from the passed `dtype`, or
+            in its absence the original array, as discussed in the notes below.
+
+        See Also
+        --------
+        numpy.ndarray.view : Equivalent method on ndarray object.
+
+        Notes
+        -----
+
+        ``a.view()`` is used two different ways:
+
+        ``a.view(some_dtype)`` or ``a.view(dtype=some_dtype)`` constructs a view
+        of the array's memory with a different data-type.  This can cause a
+        reinterpretation of the bytes of memory.
+
+        ``a.view(ndarray_subclass)`` or ``a.view(type=ndarray_subclass)`` just
+        returns an instance of `ndarray_subclass` that looks at the same array
+        (same shape, dtype, etc.)  This does not cause a reinterpretation of the
+        memory.
+
+        If `fill_value` is not specified, but `dtype` is specified (and is not
+        an ndarray sub-class), the `fill_value` of the MaskedArray will be
+        reset. If neither `fill_value` nor `dtype` are specified (or if
+        `dtype` is an ndarray sub-class), then the fill value is preserved.
+        Finally, if `fill_value` is specified, but `dtype` is not, the fill
+        value is set to the specified value.
+
+        For ``a.view(some_dtype)``, if ``some_dtype`` has a different number of
+        bytes per entry than the previous dtype (for example, converting a
+        regular array to a structured array), then the behavior of the view
+        cannot be predicted just from the superficial appearance of ``a`` (shown
+        by ``print(a)``). It also depends on exactly how ``a`` is stored in
+        memory. Therefore if ``a`` is C-ordered versus fortran-ordered, versus
+        defined as a slice or transpose, etc., the view may give different
+        results.
+        """
+
+        if dtype is None:
+            if type is None:
+                output = ndarray.view(self)
+            else:
+                output = ndarray.view(self, type)
+        elif type is None:
+            try:
+                if issubclass(dtype, ndarray):
+                    output = ndarray.view(self, dtype)
+                    dtype = None
+                else:
+                    output = ndarray.view(self, dtype)
+            except TypeError:
+                output = ndarray.view(self, dtype)
+        else:
+            output = ndarray.view(self, dtype, type)
+
+        # also make the mask be a view (so attr changes to the view's
+        # mask do no affect original object's mask)
+        # (especially important to avoid affecting np.masked singleton)
+        if getmask(output) is not nomask:
+            output._mask = output._mask.view()
+
+        # Make sure to reset the _fill_value if needed
+        if getattr(output, '_fill_value', None) is not None:
+            if fill_value is None:
+                if dtype is None:
+                    pass  # leave _fill_value as is
+                else:
+                    output._fill_value = None
+            else:
+                output.fill_value = fill_value
+        return output
+
+    def __getitem__(self, indx):
+        """
+        x.__getitem__(y) <==> x[y]
+
+        Return the item described by i, as a masked array.
+
+        """
+        # We could directly use ndarray.__getitem__ on self.
+        # But then we would have to modify __array_finalize__ to prevent the
+        # mask of being reshaped if it hasn't been set up properly yet
+        # So it's easier to stick to the current version
+        dout = self.data[indx]
+        _mask = self._mask
+
+        def _is_scalar(m):
+            return not isinstance(m, np.ndarray)
+
+        def _scalar_heuristic(arr, elem):
+            """
+            Return whether `elem` is a scalar result of indexing `arr`, or None
+            if undecidable without promoting nomask to a full mask
+            """
+            # obviously a scalar
+            if not isinstance(elem, np.ndarray):
+                return True
+
+            # object array scalar indexing can return anything
+            elif arr.dtype.type is np.object_:
+                if arr.dtype is not elem.dtype:
+                    # elem is an array, but dtypes do not match, so must be
+                    # an element
+                    return True
+
+            # well-behaved subclass that only returns 0d arrays when
+            # expected - this is not a scalar
+            elif type(arr).__getitem__ == ndarray.__getitem__:
+                return False
+
+            return None
+
+        if _mask is not nomask:
+            # _mask cannot be a subclass, so it tells us whether we should
+            # expect a scalar. It also cannot be of dtype object.
+            mout = _mask[indx]
+            scalar_expected = _is_scalar(mout)
+
+        else:
+            # attempt to apply the heuristic to avoid constructing a full mask
+            mout = nomask
+            scalar_expected = _scalar_heuristic(self.data, dout)
+            if scalar_expected is None:
+                # heuristics have failed
+                # construct a full array, so we can be certain. This is costly.
+                # we could also fall back on ndarray.__getitem__(self.data, indx)
+                scalar_expected = _is_scalar(getmaskarray(self)[indx])
+
+        # Did we extract a single item?
+        if scalar_expected:
+            # A record
+            if isinstance(dout, np.void):
+                # We should always re-cast to mvoid, otherwise users can
+                # change masks on rows that already have masked values, but not
+                # on rows that have no masked values, which is inconsistent.
+                return mvoid(dout, mask=mout, hardmask=self._hardmask)
+
+            # special case introduced in gh-5962
+            elif (self.dtype.type is np.object_ and
+                  isinstance(dout, np.ndarray) and
+                  dout is not masked):
+                # If masked, turn into a MaskedArray, with everything masked.
+                if mout:
+                    return MaskedArray(dout, mask=True)
+                else:
+                    return dout
+
+            # Just a scalar
+            else:
+                if mout:
+                    return masked
+                else:
+                    return dout
+        else:
+            # Force dout to MA
+            dout = dout.view(type(self))
+            # Inherit attributes from self
+            dout._update_from(self)
+            # Check the fill_value
+            if is_string_or_list_of_strings(indx):
+                if self._fill_value is not None:
+                    dout._fill_value = self._fill_value[indx]
+
+                    # Something like gh-15895 has happened if this check fails.
+                    # _fill_value should always be an ndarray.
+                    if not isinstance(dout._fill_value, np.ndarray):
+                        raise RuntimeError('Internal NumPy error.')
+                    # If we're indexing a multidimensional field in a
+                    # structured array (such as dtype("(2,)i2,(2,)i1")),
+                    # dimensionality goes up (M[field].ndim == M.ndim +
+                    # M.dtype[field].ndim).  That's fine for
+                    # M[field] but problematic for M[field].fill_value
+                    # which should have shape () to avoid breaking several
+                    # methods. There is no great way out, so set to
+                    # first element. See issue #6723.
+                    if dout._fill_value.ndim > 0:
+                        if not (dout._fill_value ==
+                                dout._fill_value.flat[0]).all():
+                            warnings.warn(
+                                "Upon accessing multidimensional field "
+                                f"{indx!s}, need to keep dimensionality "
+                                "of fill_value at 0. Discarding "
+                                "heterogeneous fill_value and setting "
+                                f"all to {dout._fill_value[0]!s}.",
+                                stacklevel=2)
+                        # Need to use `.flat[0:1].squeeze(...)` instead of just
+                        # `.flat[0]` to ensure the result is a 0d array and not
+                        # a scalar.
+                        dout._fill_value = dout._fill_value.flat[0:1].squeeze(axis=0)
+                dout._isfield = True
+            # Update the mask if needed
+            if mout is not nomask:
+                # set shape to match that of data; this is needed for matrices
+                dout._mask = reshape(mout, dout.shape)
+                dout._sharedmask = True
+                # Note: Don't try to check for m.any(), that'll take too long
+        return dout
+
+    def __setitem__(self, indx, value):
+        """
+        x.__setitem__(i, y) <==> x[i]=y
+
+        Set item described by index. If value is masked, masks those
+        locations.
+
+        """
+        if self is masked:
+            raise MaskError('Cannot alter the masked element.')
+        _data = self._data
+        _mask = self._mask
+        if isinstance(indx, str):
+            _data[indx] = value
+            if _mask is nomask:
+                self._mask = _mask = make_mask_none(self.shape, self.dtype)
+            _mask[indx] = getmask(value)
+            return
+
+        _dtype = _data.dtype
+
+        if value is masked:
+            # The mask wasn't set: create a full version.
+            if _mask is nomask:
+                _mask = self._mask = make_mask_none(self.shape, _dtype)
+            # Now, set the mask to its value.
+            if _dtype.names is not None:
+                _mask[indx] = tuple([True] * len(_dtype.names))
+            else:
+                _mask[indx] = True
+            return
+
+        # Get the _data part of the new value
+        dval = getattr(value, '_data', value)
+        # Get the _mask part of the new value
+        mval = getmask(value)
+        if _dtype.names is not None and mval is nomask:
+            mval = tuple([False] * len(_dtype.names))
+        if _mask is nomask:
+            # Set the data, then the mask
+            _data[indx] = dval
+            if mval is not nomask:
+                _mask = self._mask = make_mask_none(self.shape, _dtype)
+                _mask[indx] = mval
+        elif not self._hardmask:
+            # Set the data, then the mask
+            _data[indx] = dval
+            _mask[indx] = mval
+        elif hasattr(indx, 'dtype') and (indx.dtype == MaskType):
+            indx = indx * umath.logical_not(_mask)
+            _data[indx] = dval
+        else:
+            if _dtype.names is not None:
+                err_msg = "Flexible 'hard' masks are not yet supported."
+                raise NotImplementedError(err_msg)
+            mindx = mask_or(_mask[indx], mval, copy=True)
+            dindx = self._data[indx]
+            if dindx.size > 1:
+                np.copyto(dindx, dval, where=~mindx)
+            elif mindx is nomask:
+                dindx = dval
+            _data[indx] = dindx
+            _mask[indx] = mindx
+        return
+
+    # Define so that we can overwrite the setter.
+    @property
+    def dtype(self):
+        return super(MaskedArray, self).dtype
+
+    @dtype.setter
+    def dtype(self, dtype):
+        super(MaskedArray, type(self)).dtype.__set__(self, dtype)
+        if self._mask is not nomask:
+            self._mask = self._mask.view(make_mask_descr(dtype), ndarray)
+            # Try to reset the shape of the mask (if we don't have a void).
+            # This raises a ValueError if the dtype change won't work.
+            try:
+                self._mask.shape = self.shape
+            except (AttributeError, TypeError):
+                pass
+
+    @property
+    def shape(self):
+        return super(MaskedArray, self).shape
+
+    @shape.setter
+    def shape(self, shape):
+        super(MaskedArray, type(self)).shape.__set__(self, shape)
+        # Cannot use self._mask, since it may not (yet) exist when a
+        # masked matrix sets the shape.
+        if getmask(self) is not nomask:
+            self._mask.shape = self.shape
+
+    def __setmask__(self, mask, copy=False):
+        """
+        Set the mask.
+
+        """
+        idtype = self.dtype
+        current_mask = self._mask
+        if mask is masked:
+            mask = True
+
+        if current_mask is nomask:
+            # Make sure the mask is set
+            # Just don't do anything if there's nothing to do.
+            if mask is nomask:
+                return
+            current_mask = self._mask = make_mask_none(self.shape, idtype)
+
+        if idtype.names is None:
+            # No named fields.
+            # Hardmask: don't unmask the data
+            if self._hardmask:
+                current_mask |= mask
+            # Softmask: set everything to False
+            # If it's obviously a compatible scalar, use a quick update
+            # method.
+            elif isinstance(mask, (int, float, np.bool_, np.number)):
+                current_mask[...] = mask
+            # Otherwise fall back to the slower, general purpose way.
+            else:
+                current_mask.flat = mask
+        else:
+            # Named fields w/
+            mdtype = current_mask.dtype
+            mask = np.array(mask, copy=False)
+            # Mask is a singleton
+            if not mask.ndim:
+                # It's a boolean : make a record
+                if mask.dtype.kind == 'b':
+                    mask = np.array(tuple([mask.item()] * len(mdtype)),
+                                    dtype=mdtype)
+                # It's a record: make sure the dtype is correct
+                else:
+                    mask = mask.astype(mdtype)
+            # Mask is a sequence
+            else:
+                # Make sure the new mask is a ndarray with the proper dtype
+                try:
+                    mask = np.array(mask, copy=copy, dtype=mdtype)
+                # Or assume it's a sequence of bool/int
+                except TypeError:
+                    mask = np.array([tuple([m] * len(mdtype)) for m in mask],
+                                    dtype=mdtype)
+            # Hardmask: don't unmask the data
+            if self._hardmask:
+                for n in idtype.names:
+                    current_mask[n] |= mask[n]
+            # Softmask: set everything to False
+            # If it's obviously a compatible scalar, use a quick update
+            # method.
+            elif isinstance(mask, (int, float, np.bool_, np.number)):
+                current_mask[...] = mask
+            # Otherwise fall back to the slower, general purpose way.
+            else:
+                current_mask.flat = mask
+        # Reshape if needed
+        if current_mask.shape:
+            current_mask.shape = self.shape
+        return
+
+    _set_mask = __setmask__
+
+    @property
+    def mask(self):
+        """ Current mask. """
+
+        # We could try to force a reshape, but that wouldn't work in some
+        # cases.
+        # Return a view so that the dtype and shape cannot be changed in place
+        # This still preserves nomask by identity
+        return self._mask.view()
+
+    @mask.setter
+    def mask(self, value):
+        self.__setmask__(value)
+
+    @property
+    def recordmask(self):
+        """
+        Get or set the mask of the array if it has no named fields. For
+        structured arrays, returns a ndarray of booleans where entries are
+        ``True`` if **all** the fields are masked, ``False`` otherwise:
+
+        >>> x = np.ma.array([(1, 1), (2, 2), (3, 3), (4, 4), (5, 5)],
+        ...         mask=[(0, 0), (1, 0), (1, 1), (0, 1), (0, 0)],
+        ...        dtype=[('a', int), ('b', int)])
+        >>> x.recordmask
+        array([False, False,  True, False, False])
+        """
+
+        _mask = self._mask.view(ndarray)
+        if _mask.dtype.names is None:
+            return _mask
+        return np.all(flatten_structured_array(_mask), axis=-1)
+
+    @recordmask.setter
+    def recordmask(self, mask):
+        raise NotImplementedError("Coming soon: setting the mask per records!")
+
+    def harden_mask(self):
+        """
+        Force the mask to hard.
+
+        Whether the mask of a masked array is hard or soft is determined by
+        its `hardmask` property. `harden_mask` sets `hardmask` to True.
+
+        See Also
+        --------
+        hardmask
+
+        """
+        self._hardmask = True
+        return self
+
+    def soften_mask(self):
+        """
+        Force the mask to soft.
+
+        Whether the mask of a masked array is hard or soft is determined by
+        its `hardmask` property. `soften_mask` sets `hardmask` to False.
+
+        See Also
+        --------
+        hardmask
+
+        """
+        self._hardmask = False
+        return self
+
+    @property
+    def hardmask(self):
+        """ Hardness of the mask """
+        return self._hardmask
+
+    def unshare_mask(self):
+        """
+        Copy the mask and set the sharedmask flag to False.
+
+        Whether the mask is shared between masked arrays can be seen from
+        the `sharedmask` property. `unshare_mask` ensures the mask is not shared.
+        A copy of the mask is only made if it was shared.
+
+        See Also
+        --------
+        sharedmask
+
+        """
+        if self._sharedmask:
+            self._mask = self._mask.copy()
+            self._sharedmask = False
+        return self
+
+    @property
+    def sharedmask(self):
+        """ Share status of the mask (read-only). """
+        return self._sharedmask
+
+    def shrink_mask(self):
+        """
+        Reduce a mask to nomask when possible.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        None
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2 ], [3, 4]], mask=[0]*4)
+        >>> x.mask
+        array([[False, False],
+               [False, False]])
+        >>> x.shrink_mask()
+        masked_array(
+          data=[[1, 2],
+                [3, 4]],
+          mask=False,
+          fill_value=999999)
+        >>> x.mask
+        False
+
+        """
+        self._mask = _shrink_mask(self._mask)
+        return self
+
+    @property
+    def baseclass(self):
+        """ Class of the underlying data (read-only). """
+        return self._baseclass
+
+    def _get_data(self):
+        """
+        Returns the underlying data, as a view of the masked array.
+
+        If the underlying data is a subclass of :class:`numpy.ndarray`, it is
+        returned as such.
+
+        >>> x = np.ma.array(np.matrix([[1, 2], [3, 4]]), mask=[[0, 1], [1, 0]])
+        >>> x.data
+        matrix([[1, 2],
+                [3, 4]])
+
+        The type of the data can be accessed through the :attr:`baseclass`
+        attribute.
+        """
+        return ndarray.view(self, self._baseclass)
+
+    _data = property(fget=_get_data)
+    data = property(fget=_get_data)
+
+    @property
+    def flat(self):
+        """ Return a flat iterator, or set a flattened version of self to value. """
+        return MaskedIterator(self)
+
+    @flat.setter
+    def flat(self, value):
+        y = self.ravel()
+        y[:] = value
+
+    @property
+    def fill_value(self):
+        """
+        The filling value of the masked array is a scalar. When setting, None
+        will set to a default based on the data type.
+
+        Examples
+        --------
+        >>> for dt in [np.int32, np.int64, np.float64, np.complex128]:
+        ...     np.ma.array([0, 1], dtype=dt).get_fill_value()
+        ...
+        999999
+        999999
+        1e+20
+        (1e+20+0j)
+
+        >>> x = np.ma.array([0, 1.], fill_value=-np.inf)
+        >>> x.fill_value
+        -inf
+        >>> x.fill_value = np.pi
+        >>> x.fill_value
+        3.1415926535897931 # may vary
+
+        Reset to default:
+
+        >>> x.fill_value = None
+        >>> x.fill_value
+        1e+20
+
+        """
+        if self._fill_value is None:
+            self._fill_value = _check_fill_value(None, self.dtype)
+
+        # Temporary workaround to account for the fact that str and bytes
+        # scalars cannot be indexed with (), whereas all other numpy
+        # scalars can. See issues #7259 and #7267.
+        # The if-block can be removed after #7267 has been fixed.
+        if isinstance(self._fill_value, ndarray):
+            return self._fill_value[()]
+        return self._fill_value
+
+    @fill_value.setter
+    def fill_value(self, value=None):
+        target = _check_fill_value(value, self.dtype)
+        if not target.ndim == 0:
+            # 2019-11-12, 1.18.0
+            warnings.warn(
+                "Non-scalar arrays for the fill value are deprecated. Use "
+                "arrays with scalar values instead. The filled function "
+                "still supports any array as `fill_value`.",
+                DeprecationWarning, stacklevel=2)
+
+        _fill_value = self._fill_value
+        if _fill_value is None:
+            # Create the attribute if it was undefined
+            self._fill_value = target
+        else:
+            # Don't overwrite the attribute, just fill it (for propagation)
+            _fill_value[()] = target
+
+    # kept for compatibility
+    get_fill_value = fill_value.fget
+    set_fill_value = fill_value.fset
+
+    def filled(self, fill_value=None):
+        """
+        Return a copy of self, with masked values filled with a given value.
+        **However**, if there are no masked values to fill, self will be
+        returned instead as an ndarray.
+
+        Parameters
+        ----------
+        fill_value : array_like, optional
+            The value to use for invalid entries. Can be scalar or non-scalar.
+            If non-scalar, the resulting ndarray must be broadcastable over
+            input array. Default is None, in which case, the `fill_value`
+            attribute of the array is used instead.
+
+        Returns
+        -------
+        filled_array : ndarray
+            A copy of ``self`` with invalid entries replaced by *fill_value*
+            (be it the function argument or the attribute of ``self``), or
+            ``self`` itself as an ndarray if there are no invalid entries to
+            be replaced.
+
+        Notes
+        -----
+        The result is **not** a MaskedArray!
+
+        Examples
+        --------
+        >>> x = np.ma.array([1,2,3,4,5], mask=[0,0,1,0,1], fill_value=-999)
+        >>> x.filled()
+        array([   1,    2, -999,    4, -999])
+        >>> x.filled(fill_value=1000)
+        array([   1,    2, 1000,    4, 1000])
+        >>> type(x.filled())
+        <class 'numpy.ndarray'>
+
+        Subclassing is preserved. This means that if, e.g., the data part of
+        the masked array is a recarray, `filled` returns a recarray:
+
+        >>> x = np.array([(-1, 2), (-3, 4)], dtype='i8,i8').view(np.recarray)
+        >>> m = np.ma.array(x, mask=[(True, False), (False, True)])
+        >>> m.filled()
+        rec.array([(999999,      2), (    -3, 999999)],
+                  dtype=[('f0', '<i8'), ('f1', '<i8')])
+        """
+        m = self._mask
+        if m is nomask:
+            return self._data
+
+        if fill_value is None:
+            fill_value = self.fill_value
+        else:
+            fill_value = _check_fill_value(fill_value, self.dtype)
+
+        if self is masked_singleton:
+            return np.asanyarray(fill_value)
+
+        if m.dtype.names is not None:
+            result = self._data.copy('K')
+            _recursive_filled(result, self._mask, fill_value)
+        elif not m.any():
+            return self._data
+        else:
+            result = self._data.copy('K')
+            try:
+                np.copyto(result, fill_value, where=m)
+            except (TypeError, AttributeError):
+                fill_value = narray(fill_value, dtype=object)
+                d = result.astype(object)
+                result = np.choose(m, (d, fill_value))
+            except IndexError:
+                # ok, if scalar
+                if self._data.shape:
+                    raise
+                elif m:
+                    result = np.array(fill_value, dtype=self.dtype)
+                else:
+                    result = self._data
+        return result
+
+    def compressed(self):
+        """
+        Return all the non-masked data as a 1-D array.
+
+        Returns
+        -------
+        data : ndarray
+            A new `ndarray` holding the non-masked data is returned.
+
+        Notes
+        -----
+        The result is **not** a MaskedArray!
+
+        Examples
+        --------
+        >>> x = np.ma.array(np.arange(5), mask=[0]*2 + [1]*3)
+        >>> x.compressed()
+        array([0, 1])
+        >>> type(x.compressed())
+        <class 'numpy.ndarray'>
+
+        """
+        data = ndarray.ravel(self._data)
+        if self._mask is not nomask:
+            data = data.compress(np.logical_not(ndarray.ravel(self._mask)))
+        return data
+
+    def compress(self, condition, axis=None, out=None):
+        """
+        Return `a` where condition is ``True``.
+
+        If condition is a `MaskedArray`, missing values are considered
+        as ``False``.
+
+        Parameters
+        ----------
+        condition : var
+            Boolean 1-d array selecting which entries to return. If len(condition)
+            is less than the size of a along the axis, then output is truncated
+            to length of condition array.
+        axis : {None, int}, optional
+            Axis along which the operation must be performed.
+        out : {None, ndarray}, optional
+            Alternative output array in which to place the result. It must have
+            the same shape as the expected output but the type will be cast if
+            necessary.
+
+        Returns
+        -------
+        result : MaskedArray
+            A :class:`MaskedArray` object.
+
+        Notes
+        -----
+        Please note the difference with :meth:`compressed` !
+        The output of :meth:`compress` has a mask, the output of
+        :meth:`compressed` does not.
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3],[4,5,6],[7,8,9]], mask=[0] + [1,0]*4)
+        >>> x
+        masked_array(
+          data=[[1, --, 3],
+                [--, 5, --],
+                [7, --, 9]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+        >>> x.compress([1, 0, 1])
+        masked_array(data=[1, 3],
+                     mask=[False, False],
+               fill_value=999999)
+
+        >>> x.compress([1, 0, 1], axis=1)
+        masked_array(
+          data=[[1, 3],
+                [--, --],
+                [7, 9]],
+          mask=[[False, False],
+                [ True,  True],
+                [False, False]],
+          fill_value=999999)
+
+        """
+        # Get the basic components
+        (_data, _mask) = (self._data, self._mask)
+
+        # Force the condition to a regular ndarray and forget the missing
+        # values.
+        condition = np.array(condition, copy=False, subok=False)
+
+        _new = _data.compress(condition, axis=axis, out=out).view(type(self))
+        _new._update_from(self)
+        if _mask is not nomask:
+            _new._mask = _mask.compress(condition, axis=axis)
+        return _new
+
+    def _insert_masked_print(self):
+        """
+        Replace masked values with masked_print_option, casting all innermost
+        dtypes to object.
+        """
+        if masked_print_option.enabled():
+            mask = self._mask
+            if mask is nomask:
+                res = self._data
+            else:
+                # convert to object array to make filled work
+                data = self._data
+                # For big arrays, to avoid a costly conversion to the
+                # object dtype, extract the corners before the conversion.
+                print_width = (self._print_width if self.ndim > 1
+                               else self._print_width_1d)
+                for axis in range(self.ndim):
+                    if data.shape[axis] > print_width:
+                        ind = print_width // 2
+                        arr = np.split(data, (ind, -ind), axis=axis)
+                        data = np.concatenate((arr[0], arr[2]), axis=axis)
+                        arr = np.split(mask, (ind, -ind), axis=axis)
+                        mask = np.concatenate((arr[0], arr[2]), axis=axis)
+
+                rdtype = _replace_dtype_fields(self.dtype, "O")
+                res = data.astype(rdtype)
+                _recursive_printoption(res, mask, masked_print_option)
+        else:
+            res = self.filled(self.fill_value)
+        return res
+
+    def __str__(self):
+        return str(self._insert_masked_print())
+
+    def __repr__(self):
+        """
+        Literal string representation.
+
+        """
+        if self._baseclass is np.ndarray:
+            name = 'array'
+        else:
+            name = self._baseclass.__name__
+
+
+        # 2016-11-19: Demoted to legacy format
+        if np.get_printoptions()['legacy'] == '1.13':
+            is_long = self.ndim > 1
+            parameters = dict(
+                name=name,
+                nlen=" " * len(name),
+                data=str(self),
+                mask=str(self._mask),
+                fill=str(self.fill_value),
+                dtype=str(self.dtype)
+            )
+            is_structured = bool(self.dtype.names)
+            key = '{}_{}'.format(
+                'long' if is_long else 'short',
+                'flx' if is_structured else 'std'
+            )
+            return _legacy_print_templates[key] % parameters
+
+        prefix = f"masked_{name}("
+
+        dtype_needed = (
+            not np.core.arrayprint.dtype_is_implied(self.dtype) or
+            np.all(self.mask) or
+            self.size == 0
+        )
+
+        # determine which keyword args need to be shown
+        keys = ['data', 'mask', 'fill_value']
+        if dtype_needed:
+            keys.append('dtype')
+
+        # array has only one row (non-column)
+        is_one_row = builtins.all(dim == 1 for dim in self.shape[:-1])
+
+        # choose what to indent each keyword with
+        min_indent = 2
+        if is_one_row:
+            # first key on the same line as the type, remaining keys
+            # aligned by equals
+            indents = {}
+            indents[keys[0]] = prefix
+            for k in keys[1:]:
+                n = builtins.max(min_indent, len(prefix + keys[0]) - len(k))
+                indents[k] = ' ' * n
+            prefix = ''  # absorbed into the first indent
+        else:
+            # each key on its own line, indented by two spaces
+            indents = {k: ' ' * min_indent for k in keys}
+            prefix = prefix + '\n'  # first key on the next line
+
+        # format the field values
+        reprs = {}
+        reprs['data'] = np.array2string(
+            self._insert_masked_print(),
+            separator=", ",
+            prefix=indents['data'] + 'data=',
+            suffix=',')
+        reprs['mask'] = np.array2string(
+            self._mask,
+            separator=", ",
+            prefix=indents['mask'] + 'mask=',
+            suffix=',')
+        reprs['fill_value'] = repr(self.fill_value)
+        if dtype_needed:
+            reprs['dtype'] = np.core.arrayprint.dtype_short_repr(self.dtype)
+
+        # join keys with values and indentations
+        result = ',\n'.join(
+            '{}{}={}'.format(indents[k], k, reprs[k])
+            for k in keys
+        )
+        return prefix + result + ')'
+
+    def _delegate_binop(self, other):
+        # This emulates the logic in
+        #     private/binop_override.h:forward_binop_should_defer
+        if isinstance(other, type(self)):
+            return False
+        array_ufunc = getattr(other, "__array_ufunc__", False)
+        if array_ufunc is False:
+            other_priority = getattr(other, "__array_priority__", -1000000)
+            return self.__array_priority__ < other_priority
+        else:
+            # If array_ufunc is not None, it will be called inside the ufunc;
+            # None explicitly tells us to not call the ufunc, i.e., defer.
+            return array_ufunc is None
+
+    def _comparison(self, other, compare):
+        """Compare self with other using operator.eq or operator.ne.
+
+        When either of the elements is masked, the result is masked as well,
+        but the underlying boolean data are still set, with self and other
+        considered equal if both are masked, and unequal otherwise.
+
+        For structured arrays, all fields are combined, with masked values
+        ignored. The result is masked if all fields were masked, with self
+        and other considered equal only if both were fully masked.
+        """
+        omask = getmask(other)
+        smask = self.mask
+        mask = mask_or(smask, omask, copy=True)
+
+        odata = getdata(other)
+        if mask.dtype.names is not None:
+            # For possibly masked structured arrays we need to be careful,
+            # since the standard structured array comparison will use all
+            # fields, masked or not. To avoid masked fields influencing the
+            # outcome, we set all masked fields in self to other, so they'll
+            # count as equal.  To prepare, we ensure we have the right shape.
+            broadcast_shape = np.broadcast(self, odata).shape
+            sbroadcast = np.broadcast_to(self, broadcast_shape, subok=True)
+            sbroadcast._mask = mask
+            sdata = sbroadcast.filled(odata)
+            # Now take care of the mask; the merged mask should have an item
+            # masked if all fields were masked (in one and/or other).
+            mask = (mask == np.ones((), mask.dtype))
+
+        else:
+            # For regular arrays, just use the data as they come.
+            sdata = self.data
+
+        check = compare(sdata, odata)
+
+        if isinstance(check, (np.bool_, bool)):
+            return masked if mask else check
+
+        if mask is not nomask:
+            # Adjust elements that were masked, which should be treated
+            # as equal if masked in both, unequal if masked in one.
+            # Note that this works automatically for structured arrays too.
+            check = np.where(mask, compare(smask, omask), check)
+            if mask.shape != check.shape:
+                # Guarantee consistency of the shape, making a copy since the
+                # the mask may need to get written to later.
+                mask = np.broadcast_to(mask, check.shape).copy()
+
+        check = check.view(type(self))
+        check._update_from(self)
+        check._mask = mask
+
+        # Cast fill value to bool_ if needed. If it cannot be cast, the
+        # default boolean fill value is used.
+        if check._fill_value is not None:
+            try:
+                fill = _check_fill_value(check._fill_value, np.bool_)
+            except (TypeError, ValueError):
+                fill = _check_fill_value(None, np.bool_)
+            check._fill_value = fill
+
+        return check
+
+    def __eq__(self, other):
+        """Check whether other equals self elementwise.
+
+        When either of the elements is masked, the result is masked as well,
+        but the underlying boolean data are still set, with self and other
+        considered equal if both are masked, and unequal otherwise.
+
+        For structured arrays, all fields are combined, with masked values
+        ignored. The result is masked if all fields were masked, with self
+        and other considered equal only if both were fully masked.
+        """
+        return self._comparison(other, operator.eq)
+
+    def __ne__(self, other):
+        """Check whether other does not equal self elementwise.
+
+        When either of the elements is masked, the result is masked as well,
+        but the underlying boolean data are still set, with self and other
+        considered equal if both are masked, and unequal otherwise.
+
+        For structured arrays, all fields are combined, with masked values
+        ignored. The result is masked if all fields were masked, with self
+        and other considered equal only if both were fully masked.
+        """
+        return self._comparison(other, operator.ne)
+
+    def __add__(self, other):
+        """
+        Add self to other, and return a new masked array.
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return add(self, other)
+
+    def __radd__(self, other):
+        """
+        Add other to self, and return a new masked array.
+
+        """
+        # In analogy with __rsub__ and __rdiv__, use original order:
+        # we get here from `other + self`.
+        return add(other, self)
+
+    def __sub__(self, other):
+        """
+        Subtract other from self, and return a new masked array.
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return subtract(self, other)
+
+    def __rsub__(self, other):
+        """
+        Subtract self from other, and return a new masked array.
+
+        """
+        return subtract(other, self)
+
+    def __mul__(self, other):
+        "Multiply self by other, and return a new masked array."
+        if self._delegate_binop(other):
+            return NotImplemented
+        return multiply(self, other)
+
+    def __rmul__(self, other):
+        """
+        Multiply other by self, and return a new masked array.
+
+        """
+        # In analogy with __rsub__ and __rdiv__, use original order:
+        # we get here from `other * self`.
+        return multiply(other, self)
+
+    def __div__(self, other):
+        """
+        Divide other into self, and return a new masked array.
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return divide(self, other)
+
+    def __truediv__(self, other):
+        """
+        Divide other into self, and return a new masked array.
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return true_divide(self, other)
+
+    def __rtruediv__(self, other):
+        """
+        Divide self into other, and return a new masked array.
+
+        """
+        return true_divide(other, self)
+
+    def __floordiv__(self, other):
+        """
+        Divide other into self, and return a new masked array.
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return floor_divide(self, other)
+
+    def __rfloordiv__(self, other):
+        """
+        Divide self into other, and return a new masked array.
+
+        """
+        return floor_divide(other, self)
+
+    def __pow__(self, other):
+        """
+        Raise self to the power other, masking the potential NaNs/Infs
+
+        """
+        if self._delegate_binop(other):
+            return NotImplemented
+        return power(self, other)
+
+    def __rpow__(self, other):
+        """
+        Raise other to the power self, masking the potential NaNs/Infs
+
+        """
+        return power(other, self)
+
+    def __iadd__(self, other):
+        """
+        Add other to self in-place.
+
+        """
+        m = getmask(other)
+        if self._mask is nomask:
+            if m is not nomask and m.any():
+                self._mask = make_mask_none(self.shape, self.dtype)
+                self._mask += m
+        else:
+            if m is not nomask:
+                self._mask += m
+        self._data.__iadd__(np.where(self._mask, self.dtype.type(0),
+                                     getdata(other)))
+        return self
+
+    def __isub__(self, other):
+        """
+        Subtract other from self in-place.
+
+        """
+        m = getmask(other)
+        if self._mask is nomask:
+            if m is not nomask and m.any():
+                self._mask = make_mask_none(self.shape, self.dtype)
+                self._mask += m
+        elif m is not nomask:
+            self._mask += m
+        self._data.__isub__(np.where(self._mask, self.dtype.type(0),
+                                     getdata(other)))
+        return self
+
+    def __imul__(self, other):
+        """
+        Multiply self by other in-place.
+
+        """
+        m = getmask(other)
+        if self._mask is nomask:
+            if m is not nomask and m.any():
+                self._mask = make_mask_none(self.shape, self.dtype)
+                self._mask += m
+        elif m is not nomask:
+            self._mask += m
+        self._data.__imul__(np.where(self._mask, self.dtype.type(1),
+                                     getdata(other)))
+        return self
+
+    def __idiv__(self, other):
+        """
+        Divide self by other in-place.
+
+        """
+        other_data = getdata(other)
+        dom_mask = _DomainSafeDivide().__call__(self._data, other_data)
+        other_mask = getmask(other)
+        new_mask = mask_or(other_mask, dom_mask)
+        # The following 3 lines control the domain filling
+        if dom_mask.any():
+            (_, fval) = ufunc_fills[np.divide]
+            other_data = np.where(dom_mask, fval, other_data)
+        self._mask |= new_mask
+        self._data.__idiv__(np.where(self._mask, self.dtype.type(1),
+                                     other_data))
+        return self
+
+    def __ifloordiv__(self, other):
+        """
+        Floor divide self by other in-place.
+
+        """
+        other_data = getdata(other)
+        dom_mask = _DomainSafeDivide().__call__(self._data, other_data)
+        other_mask = getmask(other)
+        new_mask = mask_or(other_mask, dom_mask)
+        # The following 3 lines control the domain filling
+        if dom_mask.any():
+            (_, fval) = ufunc_fills[np.floor_divide]
+            other_data = np.where(dom_mask, fval, other_data)
+        self._mask |= new_mask
+        self._data.__ifloordiv__(np.where(self._mask, self.dtype.type(1),
+                                          other_data))
+        return self
+
+    def __itruediv__(self, other):
+        """
+        True divide self by other in-place.
+
+        """
+        other_data = getdata(other)
+        dom_mask = _DomainSafeDivide().__call__(self._data, other_data)
+        other_mask = getmask(other)
+        new_mask = mask_or(other_mask, dom_mask)
+        # The following 3 lines control the domain filling
+        if dom_mask.any():
+            (_, fval) = ufunc_fills[np.true_divide]
+            other_data = np.where(dom_mask, fval, other_data)
+        self._mask |= new_mask
+        self._data.__itruediv__(np.where(self._mask, self.dtype.type(1),
+                                         other_data))
+        return self
+
+    def __ipow__(self, other):
+        """
+        Raise self to the power other, in place.
+
+        """
+        other_data = getdata(other)
+        other_mask = getmask(other)
+        with np.errstate(divide='ignore', invalid='ignore'):
+            self._data.__ipow__(np.where(self._mask, self.dtype.type(1),
+                                         other_data))
+        invalid = np.logical_not(np.isfinite(self._data))
+        if invalid.any():
+            if self._mask is not nomask:
+                self._mask |= invalid
+            else:
+                self._mask = invalid
+            np.copyto(self._data, self.fill_value, where=invalid)
+        new_mask = mask_or(other_mask, invalid)
+        self._mask = mask_or(self._mask, new_mask)
+        return self
+
+    def __float__(self):
+        """
+        Convert to float.
+
+        """
+        if self.size > 1:
+            raise TypeError("Only length-1 arrays can be converted "
+                            "to Python scalars")
+        elif self._mask:
+            warnings.warn("Warning: converting a masked element to nan.", stacklevel=2)
+            return np.nan
+        return float(self.item())
+
+    def __int__(self):
+        """
+        Convert to int.
+
+        """
+        if self.size > 1:
+            raise TypeError("Only length-1 arrays can be converted "
+                            "to Python scalars")
+        elif self._mask:
+            raise MaskError('Cannot convert masked element to a Python int.')
+        return int(self.item())
+
+    @property
+    def imag(self):
+        """
+        The imaginary part of the masked array.
+
+        This property is a view on the imaginary part of this `MaskedArray`.
+
+        See Also
+        --------
+        real
+
+        Examples
+        --------
+        >>> x = np.ma.array([1+1.j, -2j, 3.45+1.6j], mask=[False, True, False])
+        >>> x.imag
+        masked_array(data=[1.0, --, 1.6],
+                     mask=[False,  True, False],
+               fill_value=1e+20)
+
+        """
+        result = self._data.imag.view(type(self))
+        result.__setmask__(self._mask)
+        return result
+
+    # kept for compatibility
+    get_imag = imag.fget
+
+    @property
+    def real(self):
+        """
+        The real part of the masked array.
+
+        This property is a view on the real part of this `MaskedArray`.
+
+        See Also
+        --------
+        imag
+
+        Examples
+        --------
+        >>> x = np.ma.array([1+1.j, -2j, 3.45+1.6j], mask=[False, True, False])
+        >>> x.real
+        masked_array(data=[1.0, --, 3.45],
+                     mask=[False,  True, False],
+               fill_value=1e+20)
+
+        """
+        result = self._data.real.view(type(self))
+        result.__setmask__(self._mask)
+        return result
+
+    # kept for compatibility
+    get_real = real.fget
+
+    def count(self, axis=None, keepdims=np._NoValue):
+        """
+        Count the non-masked elements of the array along the given axis.
+
+        Parameters
+        ----------
+        axis : None or int or tuple of ints, optional
+            Axis or axes along which the count is performed.
+            The default, None, performs the count over all
+            the dimensions of the input array. `axis` may be negative, in
+            which case it counts from the last to the first axis.
+
+            .. versionadded:: 1.10.0
+
+            If this is a tuple of ints, the count is performed on multiple
+            axes, instead of a single axis or all the axes as before.
+        keepdims : bool, optional
+            If this is set to True, the axes which are reduced are left
+            in the result as dimensions with size one. With this option,
+            the result will broadcast correctly against the array.
+
+        Returns
+        -------
+        result : ndarray or scalar
+            An array with the same shape as the input array, with the specified
+            axis removed. If the array is a 0-d array, or if `axis` is None, a
+            scalar is returned.
+
+        See Also
+        --------
+        count_masked : Count masked elements in array or along a given axis.
+
+        Examples
+        --------
+        >>> import numpy.ma as ma
+        >>> a = ma.arange(6).reshape((2, 3))
+        >>> a[1, :] = ma.masked
+        >>> a
+        masked_array(
+          data=[[0, 1, 2],
+                [--, --, --]],
+          mask=[[False, False, False],
+                [ True,  True,  True]],
+          fill_value=999999)
+        >>> a.count()
+        3
+
+        When the `axis` keyword is specified an array of appropriate size is
+        returned.
+
+        >>> a.count(axis=0)
+        array([1, 1, 1])
+        >>> a.count(axis=1)
+        array([3, 0])
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        m = self._mask
+        # special case for matrices (we assume no other subclasses modify
+        # their dimensions)
+        if isinstance(self.data, np.matrix):
+            if m is nomask:
+                m = np.zeros(self.shape, dtype=np.bool_)
+            m = m.view(type(self.data))
+
+        if m is nomask:
+            # compare to _count_reduce_items in _methods.py
+
+            if self.shape == ():
+                if axis not in (None, 0):
+                    raise np.AxisError(axis=axis, ndim=self.ndim)
+                return 1
+            elif axis is None:
+                if kwargs.get('keepdims', False):
+                    return np.array(self.size, dtype=np.intp, ndmin=self.ndim)
+                return self.size
+
+            axes = normalize_axis_tuple(axis, self.ndim)
+            items = 1
+            for ax in axes:
+                items *= self.shape[ax]
+
+            if kwargs.get('keepdims', False):
+                out_dims = list(self.shape)
+                for a in axes:
+                    out_dims[a] = 1
+            else:
+                out_dims = [d for n, d in enumerate(self.shape)
+                            if n not in axes]
+            # make sure to return a 0-d array if axis is supplied
+            return np.full(out_dims, items, dtype=np.intp)
+
+        # take care of the masked singleton
+        if self is masked:
+            return 0
+
+        return (~m).sum(axis=axis, dtype=np.intp, **kwargs)
+
+    def ravel(self, order='C'):
+        """
+        Returns a 1D version of self, as a view.
+
+        Parameters
+        ----------
+        order : {'C', 'F', 'A', 'K'}, optional
+            The elements of `a` are read using this index order. 'C' means to
+            index the elements in C-like order, with the last axis index
+            changing fastest, back to the first axis index changing slowest.
+            'F' means to index the elements in Fortran-like index order, with
+            the first index changing fastest, and the last index changing
+            slowest. Note that the 'C' and 'F' options take no account of the
+            memory layout of the underlying array, and only refer to the order
+            of axis indexing.  'A' means to read the elements in Fortran-like
+            index order if `m` is Fortran *contiguous* in memory, C-like order
+            otherwise.  'K' means to read the elements in the order they occur
+            in memory, except for reversing the data when strides are negative.
+            By default, 'C' index order is used.
+
+        Returns
+        -------
+        MaskedArray
+            Output view is of shape ``(self.size,)`` (or
+            ``(np.ma.product(self.shape),)``).
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3],[4,5,6],[7,8,9]], mask=[0] + [1,0]*4)
+        >>> x
+        masked_array(
+          data=[[1, --, 3],
+                [--, 5, --],
+                [7, --, 9]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+        >>> x.ravel()
+        masked_array(data=[1, --, 3, --, 5, --, 7, --, 9],
+                     mask=[False,  True, False,  True, False,  True, False,  True,
+                           False],
+               fill_value=999999)
+
+        """
+        r = ndarray.ravel(self._data, order=order).view(type(self))
+        r._update_from(self)
+        if self._mask is not nomask:
+            r._mask = ndarray.ravel(self._mask, order=order).reshape(r.shape)
+        else:
+            r._mask = nomask
+        return r
+
+
+    def reshape(self, *s, **kwargs):
+        """
+        Give a new shape to the array without changing its data.
+
+        Returns a masked array containing the same data, but with a new shape.
+        The result is a view on the original array; if this is not possible, a
+        ValueError is raised.
+
+        Parameters
+        ----------
+        shape : int or tuple of ints
+            The new shape should be compatible with the original shape. If an
+            integer is supplied, then the result will be a 1-D array of that
+            length.
+        order : {'C', 'F'}, optional
+            Determines whether the array data should be viewed as in C
+            (row-major) or FORTRAN (column-major) order.
+
+        Returns
+        -------
+        reshaped_array : array
+            A new view on the array.
+
+        See Also
+        --------
+        reshape : Equivalent function in the masked array module.
+        numpy.ndarray.reshape : Equivalent method on ndarray object.
+        numpy.reshape : Equivalent function in the NumPy module.
+
+        Notes
+        -----
+        The reshaping operation cannot guarantee that a copy will not be made,
+        to modify the shape in place, use ``a.shape = s``
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2],[3,4]], mask=[1,0,0,1])
+        >>> x
+        masked_array(
+          data=[[--, 2],
+                [3, --]],
+          mask=[[ True, False],
+                [False,  True]],
+          fill_value=999999)
+        >>> x = x.reshape((4,1))
+        >>> x
+        masked_array(
+          data=[[--],
+                [2],
+                [3],
+                [--]],
+          mask=[[ True],
+                [False],
+                [False],
+                [ True]],
+          fill_value=999999)
+
+        """
+        kwargs.update(order=kwargs.get('order', 'C'))
+        result = self._data.reshape(*s, **kwargs).view(type(self))
+        result._update_from(self)
+        mask = self._mask
+        if mask is not nomask:
+            result._mask = mask.reshape(*s, **kwargs)
+        return result
+
+    def resize(self, newshape, refcheck=True, order=False):
+        """
+        .. warning::
+
+            This method does nothing, except raise a ValueError exception. A
+            masked array does not own its data and therefore cannot safely be
+            resized in place. Use the `numpy.ma.resize` function instead.
+
+        This method is difficult to implement safely and may be deprecated in
+        future releases of NumPy.
+
+        """
+        # Note : the 'order' keyword looks broken, let's just drop it
+        errmsg = "A masked array does not own its data "\
+                 "and therefore cannot be resized.\n" \
+                 "Use the numpy.ma.resize function instead."
+        raise ValueError(errmsg)
+
+    def put(self, indices, values, mode='raise'):
+        """
+        Set storage-indexed locations to corresponding values.
+
+        Sets self._data.flat[n] = values[n] for each n in indices.
+        If `values` is shorter than `indices` then it will repeat.
+        If `values` has some masked values, the initial mask is updated
+        in consequence, else the corresponding values are unmasked.
+
+        Parameters
+        ----------
+        indices : 1-D array_like
+            Target indices, interpreted as integers.
+        values : array_like
+            Values to place in self._data copy at target indices.
+        mode : {'raise', 'wrap', 'clip'}, optional
+            Specifies how out-of-bounds indices will behave.
+            'raise' : raise an error.
+            'wrap' : wrap around.
+            'clip' : clip to the range.
+
+        Notes
+        -----
+        `values` can be a scalar or length 1 array.
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3],[4,5,6],[7,8,9]], mask=[0] + [1,0]*4)
+        >>> x
+        masked_array(
+          data=[[1, --, 3],
+                [--, 5, --],
+                [7, --, 9]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+        >>> x.put([0,4,8],[10,20,30])
+        >>> x
+        masked_array(
+          data=[[10, --, 3],
+                [--, 20, --],
+                [7, --, 30]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+
+        >>> x.put(4,999)
+        >>> x
+        masked_array(
+          data=[[10, --, 3],
+                [--, 999, --],
+                [7, --, 30]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+
+        """
+        # Hard mask: Get rid of the values/indices that fall on masked data
+        if self._hardmask and self._mask is not nomask:
+            mask = self._mask[indices]
+            indices = narray(indices, copy=False)
+            values = narray(values, copy=False, subok=True)
+            values.resize(indices.shape)
+            indices = indices[~mask]
+            values = values[~mask]
+
+        self._data.put(indices, values, mode=mode)
+
+        # short circuit if neither self nor values are masked
+        if self._mask is nomask and getmask(values) is nomask:
+            return
+
+        m = getmaskarray(self)
+
+        if getmask(values) is nomask:
+            m.put(indices, False, mode=mode)
+        else:
+            m.put(indices, values._mask, mode=mode)
+        m = make_mask(m, copy=False, shrink=True)
+        self._mask = m
+        return
+
+    def ids(self):
+        """
+        Return the addresses of the data and mask areas.
+
+        Parameters
+        ----------
+        None
+
+        Examples
+        --------
+        >>> x = np.ma.array([1, 2, 3], mask=[0, 1, 1])
+        >>> x.ids()
+        (166670640, 166659832) # may vary
+
+        If the array has no mask, the address of `nomask` is returned. This address
+        is typically not close to the data in memory:
+
+        >>> x = np.ma.array([1, 2, 3])
+        >>> x.ids()
+        (166691080, 3083169284) # may vary
+
+        """
+        if self._mask is nomask:
+            return (self.ctypes.data, id(nomask))
+        return (self.ctypes.data, self._mask.ctypes.data)
+
+    def iscontiguous(self):
+        """
+        Return a boolean indicating whether the data is contiguous.
+
+        Parameters
+        ----------
+        None
+
+        Examples
+        --------
+        >>> x = np.ma.array([1, 2, 3])
+        >>> x.iscontiguous()
+        True
+
+        `iscontiguous` returns one of the flags of the masked array:
+
+        >>> x.flags
+          C_CONTIGUOUS : True
+          F_CONTIGUOUS : True
+          OWNDATA : False
+          WRITEABLE : True
+          ALIGNED : True
+          WRITEBACKIFCOPY : False
+          UPDATEIFCOPY : False
+
+        """
+        return self.flags['CONTIGUOUS']
+
+    def all(self, axis=None, out=None, keepdims=np._NoValue):
+        """
+        Returns True if all elements evaluate to True.
+
+        The output array is masked where all the values along the given axis
+        are masked: if the output would have been a scalar and that all the
+        values are masked, then the output is `masked`.
+
+        Refer to `numpy.all` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.all : corresponding function for ndarrays
+        numpy.all : equivalent function
+
+        Examples
+        --------
+        >>> np.ma.array([1,2,3]).all()
+        True
+        >>> a = np.ma.array([1,2,3], mask=True)
+        >>> (a.all() is np.ma.masked)
+        True
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        mask = _check_mask_axis(self._mask, axis, **kwargs)
+        if out is None:
+            d = self.filled(True).all(axis=axis, **kwargs).view(type(self))
+            if d.ndim:
+                d.__setmask__(mask)
+            elif mask:
+                return masked
+            return d
+        self.filled(True).all(axis=axis, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            if out.ndim or mask:
+                out.__setmask__(mask)
+        return out
+
+    def any(self, axis=None, out=None, keepdims=np._NoValue):
+        """
+        Returns True if any of the elements of `a` evaluate to True.
+
+        Masked values are considered as False during computation.
+
+        Refer to `numpy.any` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.any : corresponding function for ndarrays
+        numpy.any : equivalent function
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        mask = _check_mask_axis(self._mask, axis, **kwargs)
+        if out is None:
+            d = self.filled(False).any(axis=axis, **kwargs).view(type(self))
+            if d.ndim:
+                d.__setmask__(mask)
+            elif mask:
+                d = masked
+            return d
+        self.filled(False).any(axis=axis, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            if out.ndim or mask:
+                out.__setmask__(mask)
+        return out
+
+    def nonzero(self):
+        """
+        Return the indices of unmasked elements that are not zero.
+
+        Returns a tuple of arrays, one for each dimension, containing the
+        indices of the non-zero elements in that dimension. The corresponding
+        non-zero values can be obtained with::
+
+            a[a.nonzero()]
+
+        To group the indices by element, rather than dimension, use
+        instead::
+
+            np.transpose(a.nonzero())
+
+        The result of this is always a 2d array, with a row for each non-zero
+        element.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        tuple_of_arrays : tuple
+            Indices of elements that are non-zero.
+
+        See Also
+        --------
+        numpy.nonzero :
+            Function operating on ndarrays.
+        flatnonzero :
+            Return indices that are non-zero in the flattened version of the input
+            array.
+        numpy.ndarray.nonzero :
+            Equivalent ndarray method.
+        count_nonzero :
+            Counts the number of non-zero elements in the input array.
+
+        Examples
+        --------
+        >>> import numpy.ma as ma
+        >>> x = ma.array(np.eye(3))
+        >>> x
+        masked_array(
+          data=[[1., 0., 0.],
+                [0., 1., 0.],
+                [0., 0., 1.]],
+          mask=False,
+          fill_value=1e+20)
+        >>> x.nonzero()
+        (array([0, 1, 2]), array([0, 1, 2]))
+
+        Masked elements are ignored.
+
+        >>> x[1, 1] = ma.masked
+        >>> x
+        masked_array(
+          data=[[1.0, 0.0, 0.0],
+                [0.0, --, 0.0],
+                [0.0, 0.0, 1.0]],
+          mask=[[False, False, False],
+                [False,  True, False],
+                [False, False, False]],
+          fill_value=1e+20)
+        >>> x.nonzero()
+        (array([0, 2]), array([0, 2]))
+
+        Indices can also be grouped by element.
+
+        >>> np.transpose(x.nonzero())
+        array([[0, 0],
+               [2, 2]])
+
+        A common use for ``nonzero`` is to find the indices of an array, where
+        a condition is True.  Given an array `a`, the condition `a` > 3 is a
+        boolean array and since False is interpreted as 0, ma.nonzero(a > 3)
+        yields the indices of the `a` where the condition is true.
+
+        >>> a = ma.array([[1,2,3],[4,5,6],[7,8,9]])
+        >>> a > 3
+        masked_array(
+          data=[[False, False, False],
+                [ True,  True,  True],
+                [ True,  True,  True]],
+          mask=False,
+          fill_value=True)
+        >>> ma.nonzero(a > 3)
+        (array([1, 1, 1, 2, 2, 2]), array([0, 1, 2, 0, 1, 2]))
+
+        The ``nonzero`` method of the condition array can also be called.
+
+        >>> (a > 3).nonzero()
+        (array([1, 1, 1, 2, 2, 2]), array([0, 1, 2, 0, 1, 2]))
+
+        """
+        return narray(self.filled(0), copy=False).nonzero()
+
+    def trace(self, offset=0, axis1=0, axis2=1, dtype=None, out=None):
+        """
+        (this docstring should be overwritten)
+        """
+        #!!!: implement out + test!
+        m = self._mask
+        if m is nomask:
+            result = super(MaskedArray, self).trace(offset=offset, axis1=axis1,
+                                                    axis2=axis2, out=out)
+            return result.astype(dtype)
+        else:
+            D = self.diagonal(offset=offset, axis1=axis1, axis2=axis2)
+            return D.astype(dtype).filled(0).sum(axis=-1, out=out)
+    trace.__doc__ = ndarray.trace.__doc__
+
+    def dot(self, b, out=None, strict=False):
+        """
+        a.dot(b, out=None)
+
+        Masked dot product of two arrays. Note that `out` and `strict` are
+        located in different positions than in `ma.dot`. In order to
+        maintain compatibility with the functional version, it is
+        recommended that the optional arguments be treated as keyword only.
+        At some point that may be mandatory.
+
+        .. versionadded:: 1.10.0
+
+        Parameters
+        ----------
+        b : masked_array_like
+            Inputs array.
+        out : masked_array, optional
+            Output argument. This must have the exact kind that would be
+            returned if it was not used. In particular, it must have the
+            right type, must be C-contiguous, and its dtype must be the
+            dtype that would be returned for `ma.dot(a,b)`. This is a
+            performance feature. Therefore, if these conditions are not
+            met, an exception is raised, instead of attempting to be
+            flexible.
+        strict : bool, optional
+            Whether masked data are propagated (True) or set to 0 (False)
+            for the computation. Default is False.  Propagating the mask
+            means that if a masked value appears in a row or column, the
+            whole row or column is considered masked.
+
+            .. versionadded:: 1.10.2
+
+        See Also
+        --------
+        numpy.ma.dot : equivalent function
+
+        """
+        return dot(self, b, out=out, strict=strict)
+
+    def sum(self, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+        """
+        Return the sum of the array elements over the given axis.
+
+        Masked elements are set to 0 internally.
+
+        Refer to `numpy.sum` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.sum : corresponding function for ndarrays
+        numpy.sum : equivalent function
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3],[4,5,6],[7,8,9]], mask=[0] + [1,0]*4)
+        >>> x
+        masked_array(
+          data=[[1, --, 3],
+                [--, 5, --],
+                [7, --, 9]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+        >>> x.sum()
+        25
+        >>> x.sum(axis=1)
+        masked_array(data=[4, 5, 16],
+                     mask=[False, False, False],
+               fill_value=999999)
+        >>> x.sum(axis=0)
+        masked_array(data=[8, 5, 12],
+                     mask=[False, False, False],
+               fill_value=999999)
+        >>> print(type(x.sum(axis=0, dtype=np.int64)[0]))
+        <class 'numpy.int64'>
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        _mask = self._mask
+        newmask = _check_mask_axis(_mask, axis, **kwargs)
+        # No explicit output
+        if out is None:
+            result = self.filled(0).sum(axis, dtype=dtype, **kwargs)
+            rndim = getattr(result, 'ndim', 0)
+            if rndim:
+                result = result.view(type(self))
+                result.__setmask__(newmask)
+            elif newmask:
+                result = masked
+            return result
+        # Explicit output
+        result = self.filled(0).sum(axis, dtype=dtype, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            outmask = getmask(out)
+            if outmask is nomask:
+                outmask = out._mask = make_mask_none(out.shape)
+            outmask.flat = newmask
+        return out
+
+    def cumsum(self, axis=None, dtype=None, out=None):
+        """
+        Return the cumulative sum of the array elements over the given axis.
+
+        Masked values are set to 0 internally during the computation.
+        However, their position is saved, and the result will be masked at
+        the same locations.
+
+        Refer to `numpy.cumsum` for full documentation.
+
+        Notes
+        -----
+        The mask is lost if `out` is not a valid :class:`MaskedArray` !
+
+        Arithmetic is modular when using integer types, and no error is
+        raised on overflow.
+
+        See Also
+        --------
+        numpy.ndarray.cumsum : corresponding function for ndarrays
+        numpy.cumsum : equivalent function
+
+        Examples
+        --------
+        >>> marr = np.ma.array(np.arange(10), mask=[0,0,0,1,1,1,0,0,0,0])
+        >>> marr.cumsum()
+        masked_array(data=[0, 1, 3, --, --, --, 9, 16, 24, 33],
+                     mask=[False, False, False,  True,  True,  True, False, False,
+                           False, False],
+               fill_value=999999)
+
+        """
+        result = self.filled(0).cumsum(axis=axis, dtype=dtype, out=out)
+        if out is not None:
+            if isinstance(out, MaskedArray):
+                out.__setmask__(self.mask)
+            return out
+        result = result.view(type(self))
+        result.__setmask__(self._mask)
+        return result
+
+    def prod(self, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+        """
+        Return the product of the array elements over the given axis.
+
+        Masked elements are set to 1 internally for computation.
+
+        Refer to `numpy.prod` for full documentation.
+
+        Notes
+        -----
+        Arithmetic is modular when using integer types, and no error is raised
+        on overflow.
+
+        See Also
+        --------
+        numpy.ndarray.prod : corresponding function for ndarrays
+        numpy.prod : equivalent function
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        _mask = self._mask
+        newmask = _check_mask_axis(_mask, axis, **kwargs)
+        # No explicit output
+        if out is None:
+            result = self.filled(1).prod(axis, dtype=dtype, **kwargs)
+            rndim = getattr(result, 'ndim', 0)
+            if rndim:
+                result = result.view(type(self))
+                result.__setmask__(newmask)
+            elif newmask:
+                result = masked
+            return result
+        # Explicit output
+        result = self.filled(1).prod(axis, dtype=dtype, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            outmask = getmask(out)
+            if outmask is nomask:
+                outmask = out._mask = make_mask_none(out.shape)
+            outmask.flat = newmask
+        return out
+    product = prod
+
+    def cumprod(self, axis=None, dtype=None, out=None):
+        """
+        Return the cumulative product of the array elements over the given axis.
+
+        Masked values are set to 1 internally during the computation.
+        However, their position is saved, and the result will be masked at
+        the same locations.
+
+        Refer to `numpy.cumprod` for full documentation.
+
+        Notes
+        -----
+        The mask is lost if `out` is not a valid MaskedArray !
+
+        Arithmetic is modular when using integer types, and no error is
+        raised on overflow.
+
+        See Also
+        --------
+        numpy.ndarray.cumprod : corresponding function for ndarrays
+        numpy.cumprod : equivalent function
+        """
+        result = self.filled(1).cumprod(axis=axis, dtype=dtype, out=out)
+        if out is not None:
+            if isinstance(out, MaskedArray):
+                out.__setmask__(self._mask)
+            return out
+        result = result.view(type(self))
+        result.__setmask__(self._mask)
+        return result
+
+    def mean(self, axis=None, dtype=None, out=None, keepdims=np._NoValue):
+        """
+        Returns the average of the array elements along given axis.
+
+        Masked entries are ignored, and result elements which are not
+        finite will be masked.
+
+        Refer to `numpy.mean` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.mean : corresponding function for ndarrays
+        numpy.mean : Equivalent function
+        numpy.ma.average: Weighted average.
+
+        Examples
+        --------
+        >>> a = np.ma.array([1,2,3], mask=[False, False, True])
+        >>> a
+        masked_array(data=[1, 2, --],
+                     mask=[False, False,  True],
+               fill_value=999999)
+        >>> a.mean()
+        1.5
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        if self._mask is nomask:
+            result = super(MaskedArray, self).mean(axis=axis,
+                                                   dtype=dtype, **kwargs)[()]
+        else:
+            dsum = self.sum(axis=axis, dtype=dtype, **kwargs)
+            cnt = self.count(axis=axis, **kwargs)
+            if cnt.shape == () and (cnt == 0):
+                result = masked
+            else:
+                result = dsum * 1. / cnt
+        if out is not None:
+            out.flat = result
+            if isinstance(out, MaskedArray):
+                outmask = getmask(out)
+                if outmask is nomask:
+                    outmask = out._mask = make_mask_none(out.shape)
+                outmask.flat = getmask(result)
+            return out
+        return result
+
+    def anom(self, axis=None, dtype=None):
+        """
+        Compute the anomalies (deviations from the arithmetic mean)
+        along the given axis.
+
+        Returns an array of anomalies, with the same shape as the input and
+        where the arithmetic mean is computed along the given axis.
+
+        Parameters
+        ----------
+        axis : int, optional
+            Axis over which the anomalies are taken.
+            The default is to use the mean of the flattened array as reference.
+        dtype : dtype, optional
+            Type to use in computing the variance. For arrays of integer type
+             the default is float32; for arrays of float types it is the same as
+             the array type.
+
+        See Also
+        --------
+        mean : Compute the mean of the array.
+
+        Examples
+        --------
+        >>> a = np.ma.array([1,2,3])
+        >>> a.anom()
+        masked_array(data=[-1.,  0.,  1.],
+                     mask=False,
+               fill_value=1e+20)
+
+        """
+        m = self.mean(axis, dtype)
+        if m is masked:
+            return m
+
+        if not axis:
+            return self - m
+        else:
+            return self - expand_dims(m, axis)
+
+    def var(self, axis=None, dtype=None, out=None, ddof=0,
+            keepdims=np._NoValue):
+        """
+        Returns the variance of the array elements along given axis.
+
+        Masked entries are ignored, and result elements which are not
+        finite will be masked.
+
+        Refer to `numpy.var` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.var : corresponding function for ndarrays
+        numpy.var : Equivalent function
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        # Easy case: nomask, business as usual
+        if self._mask is nomask:
+            ret = super(MaskedArray, self).var(axis=axis, dtype=dtype, out=out,
+                                               ddof=ddof, **kwargs)[()]
+            if out is not None:
+                if isinstance(out, MaskedArray):
+                    out.__setmask__(nomask)
+                return out
+            return ret
+
+        # Some data are masked, yay!
+        cnt = self.count(axis=axis, **kwargs) - ddof
+        danom = self - self.mean(axis, dtype, keepdims=True)
+        if iscomplexobj(self):
+            danom = umath.absolute(danom) ** 2
+        else:
+            danom *= danom
+        dvar = divide(danom.sum(axis, **kwargs), cnt).view(type(self))
+        # Apply the mask if it's not a scalar
+        if dvar.ndim:
+            dvar._mask = mask_or(self._mask.all(axis, **kwargs), (cnt <= 0))
+            dvar._update_from(self)
+        elif getmask(dvar):
+            # Make sure that masked is returned when the scalar is masked.
+            dvar = masked
+            if out is not None:
+                if isinstance(out, MaskedArray):
+                    out.flat = 0
+                    out.__setmask__(True)
+                elif out.dtype.kind in 'biu':
+                    errmsg = "Masked data information would be lost in one or "\
+                             "more location."
+                    raise MaskError(errmsg)
+                else:
+                    out.flat = np.nan
+                return out
+        # In case with have an explicit output
+        if out is not None:
+            # Set the data
+            out.flat = dvar
+            # Set the mask if needed
+            if isinstance(out, MaskedArray):
+                out.__setmask__(dvar.mask)
+            return out
+        return dvar
+    var.__doc__ = np.var.__doc__
+
+    def std(self, axis=None, dtype=None, out=None, ddof=0,
+            keepdims=np._NoValue):
+        """
+        Returns the standard deviation of the array elements along given axis.
+
+        Masked entries are ignored.
+
+        Refer to `numpy.std` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.std : corresponding function for ndarrays
+        numpy.std : Equivalent function
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        dvar = self.var(axis, dtype, out, ddof, **kwargs)
+        if dvar is not masked:
+            if out is not None:
+                np.power(out, 0.5, out=out, casting='unsafe')
+                return out
+            dvar = sqrt(dvar)
+        return dvar
+
+    def round(self, decimals=0, out=None):
+        """
+        Return each element rounded to the given number of decimals.
+
+        Refer to `numpy.around` for full documentation.
+
+        See Also
+        --------
+        numpy.ndarray.around : corresponding function for ndarrays
+        numpy.around : equivalent function
+        """
+        result = self._data.round(decimals=decimals, out=out).view(type(self))
+        if result.ndim > 0:
+            result._mask = self._mask
+            result._update_from(self)
+        elif self._mask:
+            # Return masked when the scalar is masked
+            result = masked
+        # No explicit output: we're done
+        if out is None:
+            return result
+        if isinstance(out, MaskedArray):
+            out.__setmask__(self._mask)
+        return out
+
+    def argsort(self, axis=np._NoValue, kind=None, order=None,
+                endwith=True, fill_value=None):
+        """
+        Return an ndarray of indices that sort the array along the
+        specified axis.  Masked values are filled beforehand to
+        `fill_value`.
+
+        Parameters
+        ----------
+        axis : int, optional
+            Axis along which to sort. If None, the default, the flattened array
+            is used.
+
+            ..  versionchanged:: 1.13.0
+                Previously, the default was documented to be -1, but that was
+                in error. At some future date, the default will change to -1, as
+                originally intended.
+                Until then, the axis should be given explicitly when
+                ``arr.ndim > 1``, to avoid a FutureWarning.
+        kind : {'quicksort', 'mergesort', 'heapsort', 'stable'}, optional
+            The sorting algorithm used.
+        order : list, optional
+            When `a` is an array with fields defined, this argument specifies
+            which fields to compare first, second, etc.  Not all fields need be
+            specified.
+        endwith : {True, False}, optional
+            Whether missing values (if any) should be treated as the largest values
+            (True) or the smallest values (False)
+            When the array contains unmasked values at the same extremes of the
+            datatype, the ordering of these values and the masked values is
+            undefined.
+        fill_value : {var}, optional
+            Value used internally for the masked values.
+            If ``fill_value`` is not None, it supersedes ``endwith``.
+
+        Returns
+        -------
+        index_array : ndarray, int
+            Array of indices that sort `a` along the specified axis.
+            In other words, ``a[index_array]`` yields a sorted `a`.
+
+        See Also
+        --------
+        MaskedArray.sort : Describes sorting algorithms used.
+        lexsort : Indirect stable sort with multiple keys.
+        numpy.ndarray.sort : Inplace sort.
+
+        Notes
+        -----
+        See `sort` for notes on the different sorting algorithms.
+
+        Examples
+        --------
+        >>> a = np.ma.array([3,2,1], mask=[False, False, True])
+        >>> a
+        masked_array(data=[3, 2, --],
+                     mask=[False, False,  True],
+               fill_value=999999)
+        >>> a.argsort()
+        array([1, 0, 2])
+
+        """
+
+        # 2017-04-11, Numpy 1.13.0, gh-8701: warn on axis default
+        if axis is np._NoValue:
+            axis = _deprecate_argsort_axis(self)
+
+        if fill_value is None:
+            if endwith:
+                # nan > inf
+                if np.issubdtype(self.dtype, np.floating):
+                    fill_value = np.nan
+                else:
+                    fill_value = minimum_fill_value(self)
+            else:
+                fill_value = maximum_fill_value(self)
+
+        filled = self.filled(fill_value)
+        return filled.argsort(axis=axis, kind=kind, order=order)
+
+    def argmin(self, axis=None, fill_value=None, out=None):
+        """
+        Return array of indices to the minimum values along the given axis.
+
+        Parameters
+        ----------
+        axis : {None, integer}
+            If None, the index is into the flattened array, otherwise along
+            the specified axis
+        fill_value : {var}, optional
+            Value used to fill in the masked values.  If None, the output of
+            minimum_fill_value(self._data) is used instead.
+        out : {None, array}, optional
+            Array into which the result can be placed. Its type is preserved
+            and it must be of the right shape to hold the output.
+
+        Returns
+        -------
+        ndarray or scalar
+            If multi-dimension input, returns a new ndarray of indices to the
+            minimum values along the given axis.  Otherwise, returns a scalar
+            of index to the minimum values along the given axis.
+
+        Examples
+        --------
+        >>> x = np.ma.array(np.arange(4), mask=[1,1,0,0])
+        >>> x.shape = (2,2)
+        >>> x
+        masked_array(
+          data=[[--, --],
+                [2, 3]],
+          mask=[[ True,  True],
+                [False, False]],
+          fill_value=999999)
+        >>> x.argmin(axis=0, fill_value=-1)
+        array([0, 0])
+        >>> x.argmin(axis=0, fill_value=9)
+        array([1, 1])
+
+        """
+        if fill_value is None:
+            fill_value = minimum_fill_value(self)
+        d = self.filled(fill_value).view(ndarray)
+        return d.argmin(axis, out=out)
+
+    def argmax(self, axis=None, fill_value=None, out=None):
+        """
+        Returns array of indices of the maximum values along the given axis.
+        Masked values are treated as if they had the value fill_value.
+
+        Parameters
+        ----------
+        axis : {None, integer}
+            If None, the index is into the flattened array, otherwise along
+            the specified axis
+        fill_value : {var}, optional
+            Value used to fill in the masked values.  If None, the output of
+            maximum_fill_value(self._data) is used instead.
+        out : {None, array}, optional
+            Array into which the result can be placed. Its type is preserved
+            and it must be of the right shape to hold the output.
+
+        Returns
+        -------
+        index_array : {integer_array}
+
+        Examples
+        --------
+        >>> a = np.arange(6).reshape(2,3)
+        >>> a.argmax()
+        5
+        >>> a.argmax(0)
+        array([1, 1, 1])
+        >>> a.argmax(1)
+        array([2, 2])
+
+        """
+        if fill_value is None:
+            fill_value = maximum_fill_value(self._data)
+        d = self.filled(fill_value).view(ndarray)
+        return d.argmax(axis, out=out)
+
+    def sort(self, axis=-1, kind=None, order=None,
+             endwith=True, fill_value=None):
+        """
+        Sort the array, in-place
+
+        Parameters
+        ----------
+        a : array_like
+            Array to be sorted.
+        axis : int, optional
+            Axis along which to sort. If None, the array is flattened before
+            sorting. The default is -1, which sorts along the last axis.
+        kind : {'quicksort', 'mergesort', 'heapsort', 'stable'}, optional
+            The sorting algorithm used.
+        order : list, optional
+            When `a` is a structured array, this argument specifies which fields
+            to compare first, second, and so on.  This list does not need to
+            include all of the fields.
+        endwith : {True, False}, optional
+            Whether missing values (if any) should be treated as the largest values
+            (True) or the smallest values (False)
+            When the array contains unmasked values sorting at the same extremes of the
+            datatype, the ordering of these values and the masked values is
+            undefined.
+        fill_value : {var}, optional
+            Value used internally for the masked values.
+            If ``fill_value`` is not None, it supersedes ``endwith``.
+
+        Returns
+        -------
+        sorted_array : ndarray
+            Array of the same type and shape as `a`.
+
+        See Also
+        --------
+        numpy.ndarray.sort : Method to sort an array in-place.
+        argsort : Indirect sort.
+        lexsort : Indirect stable sort on multiple keys.
+        searchsorted : Find elements in a sorted array.
+
+        Notes
+        -----
+        See ``sort`` for notes on the different sorting algorithms.
+
+        Examples
+        --------
+        >>> a = np.ma.array([1, 2, 5, 4, 3],mask=[0, 1, 0, 1, 0])
+        >>> # Default
+        >>> a.sort()
+        >>> a
+        masked_array(data=[1, 3, 5, --, --],
+                     mask=[False, False, False,  True,  True],
+               fill_value=999999)
+
+        >>> a = np.ma.array([1, 2, 5, 4, 3],mask=[0, 1, 0, 1, 0])
+        >>> # Put missing values in the front
+        >>> a.sort(endwith=False)
+        >>> a
+        masked_array(data=[--, --, 1, 3, 5],
+                     mask=[ True,  True, False, False, False],
+               fill_value=999999)
+
+        >>> a = np.ma.array([1, 2, 5, 4, 3],mask=[0, 1, 0, 1, 0])
+        >>> # fill_value takes over endwith
+        >>> a.sort(endwith=False, fill_value=3)
+        >>> a
+        masked_array(data=[1, --, --, 3, 5],
+                     mask=[False,  True,  True, False, False],
+               fill_value=999999)
+
+        """
+        if self._mask is nomask:
+            ndarray.sort(self, axis=axis, kind=kind, order=order)
+            return
+
+        if self is masked:
+            return
+
+        sidx = self.argsort(axis=axis, kind=kind, order=order,
+                            fill_value=fill_value, endwith=endwith)
+
+        self[...] = np.take_along_axis(self, sidx, axis=axis)
+
+    def min(self, axis=None, out=None, fill_value=None, keepdims=np._NoValue):
+        """
+        Return the minimum along a given axis.
+
+        Parameters
+        ----------
+        axis : {None, int}, optional
+            Axis along which to operate.  By default, ``axis`` is None and the
+            flattened input is used.
+        out : array_like, optional
+            Alternative output array in which to place the result.  Must be of
+            the same shape and buffer length as the expected output.
+        fill_value : {var}, optional
+            Value used to fill in the masked values.
+            If None, use the output of `minimum_fill_value`.
+        keepdims : bool, optional
+            If this is set to True, the axes which are reduced are left
+            in the result as dimensions with size one. With this option,
+            the result will broadcast correctly against the array.
+
+        Returns
+        -------
+        amin : array_like
+            New array holding the result.
+            If ``out`` was specified, ``out`` is returned.
+
+        See Also
+        --------
+        minimum_fill_value
+            Returns the minimum filling value for a given datatype.
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        _mask = self._mask
+        newmask = _check_mask_axis(_mask, axis, **kwargs)
+        if fill_value is None:
+            fill_value = minimum_fill_value(self)
+        # No explicit output
+        if out is None:
+            result = self.filled(fill_value).min(
+                axis=axis, out=out, **kwargs).view(type(self))
+            if result.ndim:
+                # Set the mask
+                result.__setmask__(newmask)
+                # Get rid of Infs
+                if newmask.ndim:
+                    np.copyto(result, result.fill_value, where=newmask)
+            elif newmask:
+                result = masked
+            return result
+        # Explicit output
+        result = self.filled(fill_value).min(axis=axis, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            outmask = getmask(out)
+            if outmask is nomask:
+                outmask = out._mask = make_mask_none(out.shape)
+            outmask.flat = newmask
+        else:
+            if out.dtype.kind in 'biu':
+                errmsg = "Masked data information would be lost in one or more"\
+                         " location."
+                raise MaskError(errmsg)
+            np.copyto(out, np.nan, where=newmask)
+        return out
+
+    # unique to masked arrays
+    def mini(self, axis=None):
+        """
+        Return the array minimum along the specified axis.
+
+        .. deprecated:: 1.13.0
+           This function is identical to both:
+
+            * ``self.min(keepdims=True, axis=axis).squeeze(axis=axis)``
+            * ``np.ma.minimum.reduce(self, axis=axis)``
+
+           Typically though, ``self.min(axis=axis)`` is sufficient.
+
+        Parameters
+        ----------
+        axis : int, optional
+            The axis along which to find the minima. Default is None, in which case
+            the minimum value in the whole array is returned.
+
+        Returns
+        -------
+        min : scalar or MaskedArray
+            If `axis` is None, the result is a scalar. Otherwise, if `axis` is
+            given and the array is at least 2-D, the result is a masked array with
+            dimension one smaller than the array on which `mini` is called.
+
+        Examples
+        --------
+        >>> x = np.ma.array(np.arange(6), mask=[0 ,1, 0, 0, 0 ,1]).reshape(3, 2)
+        >>> x
+        masked_array(
+          data=[[0, --],
+                [2, 3],
+                [4, --]],
+          mask=[[False,  True],
+                [False, False],
+                [False,  True]],
+          fill_value=999999)
+        >>> x.mini()
+        masked_array(data=0,
+                     mask=False,
+               fill_value=999999)
+        >>> x.mini(axis=0)
+        masked_array(data=[0, 3],
+                     mask=[False, False],
+               fill_value=999999)
+        >>> x.mini(axis=1)
+        masked_array(data=[0, 2, 4],
+                     mask=[False, False, False],
+               fill_value=999999)
+
+        There is a small difference between `mini` and `min`:
+
+        >>> x[:,1].mini(axis=0)
+        masked_array(data=3,
+                     mask=False,
+               fill_value=999999)
+        >>> x[:,1].min(axis=0)
+        3
+        """
+
+        # 2016-04-13, 1.13.0, gh-8764
+        warnings.warn(
+            "`mini` is deprecated; use the `min` method or "
+            "`np.ma.minimum.reduce instead.",
+            DeprecationWarning, stacklevel=2)
+        return minimum.reduce(self, axis)
+
+    def max(self, axis=None, out=None, fill_value=None, keepdims=np._NoValue):
+        """
+        Return the maximum along a given axis.
+
+        Parameters
+        ----------
+        axis : {None, int}, optional
+            Axis along which to operate.  By default, ``axis`` is None and the
+            flattened input is used.
+        out : array_like, optional
+            Alternative output array in which to place the result.  Must
+            be of the same shape and buffer length as the expected output.
+        fill_value : {var}, optional
+            Value used to fill in the masked values.
+            If None, use the output of maximum_fill_value().
+        keepdims : bool, optional
+            If this is set to True, the axes which are reduced are left
+            in the result as dimensions with size one. With this option,
+            the result will broadcast correctly against the array.
+
+        Returns
+        -------
+        amax : array_like
+            New array holding the result.
+            If ``out`` was specified, ``out`` is returned.
+
+        See Also
+        --------
+        maximum_fill_value
+            Returns the maximum filling value for a given datatype.
+
+        """
+        kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+        _mask = self._mask
+        newmask = _check_mask_axis(_mask, axis, **kwargs)
+        if fill_value is None:
+            fill_value = maximum_fill_value(self)
+        # No explicit output
+        if out is None:
+            result = self.filled(fill_value).max(
+                axis=axis, out=out, **kwargs).view(type(self))
+            if result.ndim:
+                # Set the mask
+                result.__setmask__(newmask)
+                # Get rid of Infs
+                if newmask.ndim:
+                    np.copyto(result, result.fill_value, where=newmask)
+            elif newmask:
+                result = masked
+            return result
+        # Explicit output
+        result = self.filled(fill_value).max(axis=axis, out=out, **kwargs)
+        if isinstance(out, MaskedArray):
+            outmask = getmask(out)
+            if outmask is nomask:
+                outmask = out._mask = make_mask_none(out.shape)
+            outmask.flat = newmask
+        else:
+
+            if out.dtype.kind in 'biu':
+                errmsg = "Masked data information would be lost in one or more"\
+                         " location."
+                raise MaskError(errmsg)
+            np.copyto(out, np.nan, where=newmask)
+        return out
+
+    def ptp(self, axis=None, out=None, fill_value=None, keepdims=False):
+        """
+        Return (maximum - minimum) along the given dimension
+        (i.e. peak-to-peak value).
+
+        .. warning::
+            `ptp` preserves the data type of the array. This means the
+            return value for an input of signed integers with n bits
+            (e.g. `np.int8`, `np.int16`, etc) is also a signed integer
+            with n bits.  In that case, peak-to-peak values greater than
+            ``2**(n-1)-1`` will be returned as negative values. An example
+            with a work-around is shown below.
+
+        Parameters
+        ----------
+        axis : {None, int}, optional
+            Axis along which to find the peaks.  If None (default) the
+            flattened array is used.
+        out : {None, array_like}, optional
+            Alternative output array in which to place the result. It must
+            have the same shape and buffer length as the expected output
+            but the type will be cast if necessary.
+        fill_value : {var}, optional
+            Value used to fill in the masked values.
+        keepdims : bool, optional
+            If this is set to True, the axes which are reduced are left
+            in the result as dimensions with size one. With this option,
+            the result will broadcast correctly against the array.
+
+        Returns
+        -------
+        ptp : ndarray.
+            A new array holding the result, unless ``out`` was
+            specified, in which case a reference to ``out`` is returned.
+
+        Examples
+        --------
+        >>> x = np.ma.MaskedArray([[4, 9, 2, 10],
+        ...                        [6, 9, 7, 12]])
+
+        >>> x.ptp(axis=1)
+        masked_array(data=[8, 6],
+                     mask=False,
+               fill_value=999999)
+
+        >>> x.ptp(axis=0)
+        masked_array(data=[2, 0, 5, 2],
+                     mask=False,
+               fill_value=999999)
+
+        >>> x.ptp()
+        10
+
+        This example shows that a negative value can be returned when
+        the input is an array of signed integers.
+
+        >>> y = np.ma.MaskedArray([[1, 127],
+        ...                        [0, 127],
+        ...                        [-1, 127],
+        ...                        [-2, 127]], dtype=np.int8)
+        >>> y.ptp(axis=1)
+        masked_array(data=[ 126,  127, -128, -127],
+                     mask=False,
+               fill_value=999999,
+                    dtype=int8)
+
+        A work-around is to use the `view()` method to view the result as
+        unsigned integers with the same bit width:
+
+        >>> y.ptp(axis=1).view(np.uint8)
+        masked_array(data=[126, 127, 128, 129],
+                     mask=False,
+               fill_value=999999,
+                    dtype=uint8)
+        """
+        if out is None:
+            result = self.max(axis=axis, fill_value=fill_value,
+                              keepdims=keepdims)
+            result -= self.min(axis=axis, fill_value=fill_value,
+                               keepdims=keepdims)
+            return result
+        out.flat = self.max(axis=axis, out=out, fill_value=fill_value,
+                            keepdims=keepdims)
+        min_value = self.min(axis=axis, fill_value=fill_value,
+                             keepdims=keepdims)
+        np.subtract(out, min_value, out=out, casting='unsafe')
+        return out
+
+    def partition(self, *args, **kwargs):
+        warnings.warn("Warning: 'partition' will ignore the 'mask' "
+                      f"of the {self.__class__.__name__}.",
+                      stacklevel=2)
+        return super(MaskedArray, self).partition(*args, **kwargs)
+
+    def argpartition(self, *args, **kwargs):
+        warnings.warn("Warning: 'argpartition' will ignore the 'mask' "
+                      f"of the {self.__class__.__name__}.",
+                      stacklevel=2)
+        return super(MaskedArray, self).argpartition(*args, **kwargs)
+
+    def take(self, indices, axis=None, out=None, mode='raise'):
+        """
+        """
+        (_data, _mask) = (self._data, self._mask)
+        cls = type(self)
+        # Make sure the indices are not masked
+        maskindices = getmask(indices)
+        if maskindices is not nomask:
+            indices = indices.filled(0)
+        # Get the data, promoting scalars to 0d arrays with [...] so that
+        # .view works correctly
+        if out is None:
+            out = _data.take(indices, axis=axis, mode=mode)[...].view(cls)
+        else:
+            np.take(_data, indices, axis=axis, mode=mode, out=out)
+        # Get the mask
+        if isinstance(out, MaskedArray):
+            if _mask is nomask:
+                outmask = maskindices
+            else:
+                outmask = _mask.take(indices, axis=axis, mode=mode)
+                outmask |= maskindices
+            out.__setmask__(outmask)
+        # demote 0d arrays back to scalars, for consistency with ndarray.take
+        return out[()]
+
+    # Array methods
+    copy = _arraymethod('copy')
+    diagonal = _arraymethod('diagonal')
+    flatten = _arraymethod('flatten')
+    repeat = _arraymethod('repeat')
+    squeeze = _arraymethod('squeeze')
+    swapaxes = _arraymethod('swapaxes')
+    T = property(fget=lambda self: self.transpose())
+    transpose = _arraymethod('transpose')
+
+    def tolist(self, fill_value=None):
+        """
+        Return the data portion of the masked array as a hierarchical Python list.
+
+        Data items are converted to the nearest compatible Python type.
+        Masked values are converted to `fill_value`. If `fill_value` is None,
+        the corresponding entries in the output list will be ``None``.
+
+        Parameters
+        ----------
+        fill_value : scalar, optional
+            The value to use for invalid entries. Default is None.
+
+        Returns
+        -------
+        result : list
+            The Python list representation of the masked array.
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3], [4,5,6], [7,8,9]], mask=[0] + [1,0]*4)
+        >>> x.tolist()
+        [[1, None, 3], [None, 5, None], [7, None, 9]]
+        >>> x.tolist(-999)
+        [[1, -999, 3], [-999, 5, -999], [7, -999, 9]]
+
+        """
+        _mask = self._mask
+        # No mask ? Just return .data.tolist ?
+        if _mask is nomask:
+            return self._data.tolist()
+        # Explicit fill_value: fill the array and get the list
+        if fill_value is not None:
+            return self.filled(fill_value).tolist()
+        # Structured array.
+        names = self.dtype.names
+        if names:
+            result = self._data.astype([(_, object) for _ in names])
+            for n in names:
+                result[n][_mask[n]] = None
+            return result.tolist()
+        # Standard arrays.
+        if _mask is nomask:
+            return [None]
+        # Set temps to save time when dealing w/ marrays.
+        inishape = self.shape
+        result = np.array(self._data.ravel(), dtype=object)
+        result[_mask.ravel()] = None
+        result.shape = inishape
+        return result.tolist()
+
+    def tostring(self, fill_value=None, order='C'):
+        r"""
+        A compatibility alias for `tobytes`, with exactly the same behavior.
+
+        Despite its name, it returns `bytes` not `str`\ s.
+
+        .. deprecated:: 1.19.0
+        """
+        # 2020-03-30, Numpy 1.19.0
+        warnings.warn(
+            "tostring() is deprecated. Use tobytes() instead.",
+            DeprecationWarning, stacklevel=2)
+
+        return self.tobytes(fill_value, order=order)
+
+    def tobytes(self, fill_value=None, order='C'):
+        """
+        Return the array data as a string containing the raw bytes in the array.
+
+        The array is filled with a fill value before the string conversion.
+
+        .. versionadded:: 1.9.0
+
+        Parameters
+        ----------
+        fill_value : scalar, optional
+            Value used to fill in the masked values. Default is None, in which
+            case `MaskedArray.fill_value` is used.
+        order : {'C','F','A'}, optional
+            Order of the data item in the copy. Default is 'C'.
+
+            - 'C'   -- C order (row major).
+            - 'F'   -- Fortran order (column major).
+            - 'A'   -- Any, current order of array.
+            - None  -- Same as 'A'.
+
+        See Also
+        --------
+        numpy.ndarray.tobytes
+        tolist, tofile
+
+        Notes
+        -----
+        As for `ndarray.tobytes`, information about the shape, dtype, etc.,
+        but also about `fill_value`, will be lost.
+
+        Examples
+        --------
+        >>> x = np.ma.array(np.array([[1, 2], [3, 4]]), mask=[[0, 1], [1, 0]])
+        >>> x.tobytes()
+        b'\\x01\\x00\\x00\\x00\\x00\\x00\\x00\\x00?B\\x0f\\x00\\x00\\x00\\x00\\x00?B\\x0f\\x00\\x00\\x00\\x00\\x00\\x04\\x00\\x00\\x00\\x00\\x00\\x00\\x00'
+
+        """
+        return self.filled(fill_value).tobytes(order=order)
+
+    def tofile(self, fid, sep="", format="%s"):
+        """
+        Save a masked array to a file in binary format.
+
+        .. warning::
+          This function is not implemented yet.
+
+        Raises
+        ------
+        NotImplementedError
+            When `tofile` is called.
+
+        """
+        raise NotImplementedError("MaskedArray.tofile() not implemented yet.")
+
+    def toflex(self):
+        """
+        Transforms a masked array into a flexible-type array.
+
+        The flexible type array that is returned will have two fields:
+
+        * the ``_data`` field stores the ``_data`` part of the array.
+        * the ``_mask`` field stores the ``_mask`` part of the array.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        record : ndarray
+            A new flexible-type `ndarray` with two fields: the first element
+            containing a value, the second element containing the corresponding
+            mask boolean. The returned record shape matches self.shape.
+
+        Notes
+        -----
+        A side-effect of transforming a masked array into a flexible `ndarray` is
+        that meta information (``fill_value``, ...) will be lost.
+
+        Examples
+        --------
+        >>> x = np.ma.array([[1,2,3],[4,5,6],[7,8,9]], mask=[0] + [1,0]*4)
+        >>> x
+        masked_array(
+          data=[[1, --, 3],
+                [--, 5, --],
+                [7, --, 9]],
+          mask=[[False,  True, False],
+                [ True, False,  True],
+                [False,  True, False]],
+          fill_value=999999)
+        >>> x.toflex()
+        array([[(1, False), (2,  True), (3, False)],
+               [(4,  True), (5, False), (6,  True)],
+               [(7, False), (8,  True), (9, False)]],
+              dtype=[('_data', '<i8'), ('_mask', '?')])
+
+        """
+        # Get the basic dtype.
+        ddtype = self.dtype
+        # Make sure we have a mask
+        _mask = self._mask
+        if _mask is None:
+            _mask = make_mask_none(self.shape, ddtype)
+        # And get its dtype
+        mdtype = self._mask.dtype
+
+        record = np.ndarray(shape=self.shape,
+                            dtype=[('_data', ddtype), ('_mask', mdtype)])
+        record['_data'] = self._data
+        record['_mask'] = self._mask
+        return record
+    torecords = toflex
+
+    # Pickling
+    def __getstate__(self):
+        """Return the internal state of the masked array, for pickling
+        purposes.
+
+        """
+        cf = 'CF'[self.flags.fnc]
+        data_state = super(MaskedArray, self).__reduce__()[2]
+        return data_state + (getmaskarray(self).tobytes(cf), self._fill_value)
+
+    def __setstate__(self, state):
+        """Restore the internal state of the masked array, for
+        pickling purposes.  ``state`` is typically the output of the
+        ``__getstate__`` output, and is a 5-tuple:
+
+        - class name
+        - a tuple giving the shape of the data
+        - a typecode for the data
+        - a binary string for the data
+        - a binary string for the mask.
+
+        """
+        (_, shp, typ, isf, raw, msk, flv) = state
+        super(MaskedArray, self).__setstate__((shp, typ, isf, raw))
+        self._mask.__setstate__((shp, make_mask_descr(typ), isf, msk))
+        self.fill_value = flv
+
+    def __reduce__(self):
+        """Return a 3-tuple for pickling a MaskedArray.
+
+        """
+        return (_mareconstruct,
+                (self.__class__, self._baseclass, (0,), 'b',),
+                self.__getstate__())
+
+    def __deepcopy__(self, memo=None):
+        from copy import deepcopy
+        copied = MaskedArray.__new__(type(self), self, copy=True)
+        if memo is None:
+            memo = {}
+        memo[id(self)] = copied
+        for (k, v) in self.__dict__.items():
+            copied.__dict__[k] = deepcopy(v, memo)
+        return copied
+
+
+def _mareconstruct(subtype, baseclass, baseshape, basetype,):
+    """Internal function that builds a new MaskedArray from the
+    information stored in a pickle.
+
+    """
+    _data = ndarray.__new__(baseclass, baseshape, basetype)
+    _mask = ndarray.__new__(ndarray, baseshape, make_mask_descr(basetype))
+    return subtype.__new__(subtype, _data, mask=_mask, dtype=basetype,)
+
+
+class mvoid(MaskedArray):
+    """
+    Fake a 'void' object to use for masked array with structured dtypes.
+    """
+
+    def __new__(self, data, mask=nomask, dtype=None, fill_value=None,
+                hardmask=False, copy=False, subok=True):
+        _data = np.array(data, copy=copy, subok=subok, dtype=dtype)
+        _data = _data.view(self)
+        _data._hardmask = hardmask
+        if mask is not nomask:
+            if isinstance(mask, np.void):
+                _data._mask = mask
+            else:
+                try:
+                    # Mask is already a 0D array
+                    _data._mask = np.void(mask)
+                except TypeError:
+                    # Transform the mask to a void
+                    mdtype = make_mask_descr(dtype)
+                    _data._mask = np.array(mask, dtype=mdtype)[()]
+        if fill_value is not None:
+            _data.fill_value = fill_value
+        return _data
+
+    @property
+    def _data(self):
+        # Make sure that the _data part is a np.void
+        return super(mvoid, self)._data[()]
+
+    def __getitem__(self, indx):
+        """
+        Get the index.
+
+        """
+        m = self._mask
+        if isinstance(m[indx], ndarray):
+            # Can happen when indx is a multi-dimensional field:
+            # A = ma.masked_array(data=[([0,1],)], mask=[([True,
+            #                     False],)], dtype=[("A", ">i2", (2,))])
+            # x = A[0]; y = x["A"]; then y.mask["A"].size==2
+            # and we can not say masked/unmasked.
+            # The result is no longer mvoid!
+            # See also issue #6724.
+            return masked_array(
+                data=self._data[indx], mask=m[indx],
+                fill_value=self._fill_value[indx],
+                hard_mask=self._hardmask)
+        if m is not nomask and m[indx]:
+            return masked
+        return self._data[indx]
+
+    def __setitem__(self, indx, value):
+        self._data[indx] = value
+        if self._hardmask:
+            self._mask[indx] |= getattr(value, "_mask", False)
+        else:
+            self._mask[indx] = getattr(value, "_mask", False)
+
+    def __str__(self):
+        m = self._mask
+        if m is nomask:
+            return str(self._data)
+
+        rdtype = _replace_dtype_fields(self._data.dtype, "O")
+        data_arr = super(mvoid, self)._data
+        res = data_arr.astype(rdtype)
+        _recursive_printoption(res, self._mask, masked_print_option)
+        return str(res)
+
+    __repr__ = __str__
+
+    def __iter__(self):
+        "Defines an iterator for mvoid"
+        (_data, _mask) = (self._data, self._mask)
+        if _mask is nomask:
+            yield from _data
+        else:
+            for (d, m) in zip(_data, _mask):
+                if m:
+                    yield masked
+                else:
+                    yield d
+
+    def __len__(self):
+        return self._data.__len__()
+
+    def filled(self, fill_value=None):
+        """
+        Return a copy with masked fields filled with a given value.
+
+        Parameters
+        ----------
+        fill_value : array_like, optional
+            The value to use for invalid entries. Can be scalar or
+            non-scalar. If latter is the case, the filled array should
+            be broadcastable over input array. Default is None, in
+            which case the `fill_value` attribute is used instead.
+
+        Returns
+        -------
+        filled_void
+            A `np.void` object
+
+        See Also
+        --------
+        MaskedArray.filled
+
+        """
+        return asarray(self).filled(fill_value)[()]
+
+    def tolist(self):
+        """
+    Transforms the mvoid object into a tuple.
+
+    Masked fields are replaced by None.
+
+    Returns
+    -------
+    returned_tuple
+        Tuple of fields
+        """
+        _mask = self._mask
+        if _mask is nomask:
+            return self._data.tolist()
+        result = []
+        for (d, m) in zip(self._data, self._mask):
+            if m:
+                result.append(None)
+            else:
+                # .item() makes sure we return a standard Python object
+                result.append(d.item())
+        return tuple(result)
+
+
+##############################################################################
+#                                Shortcuts                                   #
+##############################################################################
+
+
+def isMaskedArray(x):
+    """
+    Test whether input is an instance of MaskedArray.
+
+    This function returns True if `x` is an instance of MaskedArray
+    and returns False otherwise.  Any object is accepted as input.
+
+    Parameters
+    ----------
+    x : object
+        Object to test.
+
+    Returns
+    -------
+    result : bool
+        True if `x` is a MaskedArray.
+
+    See Also
+    --------
+    isMA : Alias to isMaskedArray.
+    isarray : Alias to isMaskedArray.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.eye(3, 3)
+    >>> a
+    array([[ 1.,  0.,  0.],
+           [ 0.,  1.,  0.],
+           [ 0.,  0.,  1.]])
+    >>> m = ma.masked_values(a, 0)
+    >>> m
+    masked_array(
+      data=[[1.0, --, --],
+            [--, 1.0, --],
+            [--, --, 1.0]],
+      mask=[[False,  True,  True],
+            [ True, False,  True],
+            [ True,  True, False]],
+      fill_value=0.0)
+    >>> ma.isMaskedArray(a)
+    False
+    >>> ma.isMaskedArray(m)
+    True
+    >>> ma.isMaskedArray([0, 1, 2])
+    False
+
+    """
+    return isinstance(x, MaskedArray)
+
+
+isarray = isMaskedArray
+isMA = isMaskedArray  # backward compatibility
+
+
+class MaskedConstant(MaskedArray):
+    # the lone np.ma.masked instance
+    __singleton = None
+
+    @classmethod
+    def __has_singleton(cls):
+        # second case ensures `cls.__singleton` is not just a view on the
+        # superclass singleton
+        return cls.__singleton is not None and type(cls.__singleton) is cls
+
+    def __new__(cls):
+        if not cls.__has_singleton():
+            # We define the masked singleton as a float for higher precedence.
+            # Note that it can be tricky sometimes w/ type comparison
+            data = np.array(0.)
+            mask = np.array(True)
+
+            # prevent any modifications
+            data.flags.writeable = False
+            mask.flags.writeable = False
+
+            # don't fall back on MaskedArray.__new__(MaskedConstant), since
+            # that might confuse it - this way, the construction is entirely
+            # within our control
+            cls.__singleton = MaskedArray(data, mask=mask).view(cls)
+
+        return cls.__singleton
+
+    def __array_finalize__(self, obj):
+        if not self.__has_singleton():
+            # this handles the `.view` in __new__, which we want to copy across
+            # properties normally
+            return super(MaskedConstant, self).__array_finalize__(obj)
+        elif self is self.__singleton:
+            # not clear how this can happen, play it safe
+            pass
+        else:
+            # everywhere else, we want to downcast to MaskedArray, to prevent a
+            # duplicate maskedconstant.
+            self.__class__ = MaskedArray
+            MaskedArray.__array_finalize__(self, obj)
+
+    def __array_prepare__(self, obj, context=None):
+        return self.view(MaskedArray).__array_prepare__(obj, context)
+
+    def __array_wrap__(self, obj, context=None):
+        return self.view(MaskedArray).__array_wrap__(obj, context)
+
+    def __str__(self):
+        return str(masked_print_option._display)
+
+    def __repr__(self):
+        if self is MaskedConstant.__singleton:
+            return 'masked'
+        else:
+            # it's a subclass, or something is wrong, make it obvious
+            return object.__repr__(self)
+
+    def __format__(self, format_spec):
+        # Replace ndarray.__format__ with the default, which supports no format characters.
+        # Supporting format characters is unwise here, because we do not know what type
+        # the user was expecting - better to not guess.
+        try:
+            return object.__format__(self, format_spec)
+        except TypeError:
+            # 2020-03-23, NumPy 1.19.0
+            warnings.warn(
+                "Format strings passed to MaskedConstant are ignored, but in future may "
+                "error or produce different behavior",
+                FutureWarning, stacklevel=2
+            )
+            return object.__format__(self, "")
+
+    def __reduce__(self):
+        """Override of MaskedArray's __reduce__.
+        """
+        return (self.__class__, ())
+
+    # inplace operations have no effect. We have to override them to avoid
+    # trying to modify the readonly data and mask arrays
+    def __iop__(self, other):
+        return self
+    __iadd__ = \
+    __isub__ = \
+    __imul__ = \
+    __ifloordiv__ = \
+    __itruediv__ = \
+    __ipow__ = \
+        __iop__
+    del __iop__  # don't leave this around
+
+    def copy(self, *args, **kwargs):
+        """ Copy is a no-op on the maskedconstant, as it is a scalar """
+        # maskedconstant is a scalar, so copy doesn't need to copy. There's
+        # precedent for this with `np.bool_` scalars.
+        return self
+
+    def __copy__(self):
+        return self
+
+    def __deepcopy__(self, memo):
+        return self
+
+    def __setattr__(self, attr, value):
+        if not self.__has_singleton():
+            # allow the singleton to be initialized
+            return super(MaskedConstant, self).__setattr__(attr, value)
+        elif self is self.__singleton:
+            raise AttributeError(
+                f"attributes of {self!r} are not writeable")
+        else:
+            # duplicate instance - we can end up here from __array_finalize__,
+            # where we set the __class__ attribute
+            return super(MaskedConstant, self).__setattr__(attr, value)
+
+
+masked = masked_singleton = MaskedConstant()
+masked_array = MaskedArray
+
+
+def array(data, dtype=None, copy=False, order=None,
+          mask=nomask, fill_value=None, keep_mask=True,
+          hard_mask=False, shrink=True, subok=True, ndmin=0):
+    """
+    Shortcut to MaskedArray.
+
+    The options are in a different order for convenience and backwards
+    compatibility.
+
+    """
+    return MaskedArray(data, mask=mask, dtype=dtype, copy=copy,
+                       subok=subok, keep_mask=keep_mask,
+                       hard_mask=hard_mask, fill_value=fill_value,
+                       ndmin=ndmin, shrink=shrink, order=order)
+array.__doc__ = masked_array.__doc__
+
+
+def is_masked(x):
+    """
+    Determine whether input has masked values.
+
+    Accepts any object as input, but always returns False unless the
+    input is a MaskedArray containing masked values.
+
+    Parameters
+    ----------
+    x : array_like
+        Array to check for masked values.
+
+    Returns
+    -------
+    result : bool
+        True if `x` is a MaskedArray with masked values, False otherwise.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> x = ma.masked_equal([0, 1, 0, 2, 3], 0)
+    >>> x
+    masked_array(data=[--, 1, --, 2, 3],
+                 mask=[ True, False,  True, False, False],
+           fill_value=0)
+    >>> ma.is_masked(x)
+    True
+    >>> x = ma.masked_equal([0, 1, 0, 2, 3], 42)
+    >>> x
+    masked_array(data=[0, 1, 0, 2, 3],
+                 mask=False,
+           fill_value=42)
+    >>> ma.is_masked(x)
+    False
+
+    Always returns False if `x` isn't a MaskedArray.
+
+    >>> x = [False, True, False]
+    >>> ma.is_masked(x)
+    False
+    >>> x = 'a string'
+    >>> ma.is_masked(x)
+    False
+
+    """
+    m = getmask(x)
+    if m is nomask:
+        return False
+    elif m.any():
+        return True
+    return False
+
+
+##############################################################################
+#                             Extrema functions                              #
+##############################################################################
+
+
+class _extrema_operation(_MaskedUFunc):
+    """
+    Generic class for maximum/minimum functions.
+
+    .. note::
+      This is the base class for `_maximum_operation` and
+      `_minimum_operation`.
+
+    """
+    def __init__(self, ufunc, compare, fill_value):
+        super(_extrema_operation, self).__init__(ufunc)
+        self.compare = compare
+        self.fill_value_func = fill_value
+
+    def __call__(self, a, b=None):
+        "Executes the call behavior."
+        if b is None:
+            # 2016-04-13, 1.13.0
+            warnings.warn(
+                f"Single-argument form of np.ma.{self.__name__} is deprecated. Use "
+                f"np.ma.{self.__name__}.reduce instead.",
+                DeprecationWarning, stacklevel=2)
+            return self.reduce(a)
+        return where(self.compare(a, b), a, b)
+
+    def reduce(self, target, axis=np._NoValue):
+        "Reduce target along the given axis."
+        target = narray(target, copy=False, subok=True)
+        m = getmask(target)
+
+        if axis is np._NoValue and target.ndim > 1:
+            # 2017-05-06, Numpy 1.13.0: warn on axis default
+            warnings.warn(
+                f"In the future the default for ma.{self.__name__}.reduce will be axis=0, "
+                f"not the current None, to match np.{self.__name__}.reduce. "
+                "Explicitly pass 0 or None to silence this warning.",
+                MaskedArrayFutureWarning, stacklevel=2)
+            axis = None
+
+        if axis is not np._NoValue:
+            kwargs = dict(axis=axis)
+        else:
+            kwargs = dict()
+
+        if m is nomask:
+            t = self.f.reduce(target, **kwargs)
+        else:
+            target = target.filled(
+                self.fill_value_func(target)).view(type(target))
+            t = self.f.reduce(target, **kwargs)
+            m = umath.logical_and.reduce(m, **kwargs)
+            if hasattr(t, '_mask'):
+                t._mask = m
+            elif m:
+                t = masked
+        return t
+
+    def outer(self, a, b):
+        "Return the function applied to the outer product of a and b."
+        ma = getmask(a)
+        mb = getmask(b)
+        if ma is nomask and mb is nomask:
+            m = nomask
+        else:
+            ma = getmaskarray(a)
+            mb = getmaskarray(b)
+            m = logical_or.outer(ma, mb)
+        result = self.f.outer(filled(a), filled(b))
+        if not isinstance(result, MaskedArray):
+            result = result.view(MaskedArray)
+        result._mask = m
+        return result
+
+def min(obj, axis=None, out=None, fill_value=None, keepdims=np._NoValue):
+    kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+    try:
+        return obj.min(axis=axis, fill_value=fill_value, out=out, **kwargs)
+    except (AttributeError, TypeError):
+        # If obj doesn't have a min method, or if the method doesn't accept a
+        # fill_value argument
+        return asanyarray(obj).min(axis=axis, fill_value=fill_value,
+                                   out=out, **kwargs)
+min.__doc__ = MaskedArray.min.__doc__
+
+def max(obj, axis=None, out=None, fill_value=None, keepdims=np._NoValue):
+    kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+
+    try:
+        return obj.max(axis=axis, fill_value=fill_value, out=out, **kwargs)
+    except (AttributeError, TypeError):
+        # If obj doesn't have a max method, or if the method doesn't accept a
+        # fill_value argument
+        return asanyarray(obj).max(axis=axis, fill_value=fill_value,
+                                   out=out, **kwargs)
+max.__doc__ = MaskedArray.max.__doc__
+
+
+def ptp(obj, axis=None, out=None, fill_value=None, keepdims=np._NoValue):
+    kwargs = {} if keepdims is np._NoValue else {'keepdims': keepdims}
+    try:
+        return obj.ptp(axis, out=out, fill_value=fill_value, **kwargs)
+    except (AttributeError, TypeError):
+        # If obj doesn't have a ptp method or if the method doesn't accept
+        # a fill_value argument
+        return asanyarray(obj).ptp(axis=axis, fill_value=fill_value,
+                                   out=out, **kwargs)
+ptp.__doc__ = MaskedArray.ptp.__doc__
+
+
+##############################################################################
+#           Definition of functions from the corresponding methods           #
+##############################################################################
+
+
+class _frommethod:
+    """
+    Define functions from existing MaskedArray methods.
+
+    Parameters
+    ----------
+    methodname : str
+        Name of the method to transform.
+
+    """
+
+    def __init__(self, methodname, reversed=False):
+        self.__name__ = methodname
+        self.__doc__ = self.getdoc()
+        self.reversed = reversed
+
+    def getdoc(self):
+        "Return the doc of the function (from the doc of the method)."
+        meth = getattr(MaskedArray, self.__name__, None) or\
+            getattr(np, self.__name__, None)
+        signature = self.__name__ + get_object_signature(meth)
+        if meth is not None:
+            doc = """    %s\n%s""" % (
+                signature, getattr(meth, '__doc__', None))
+            return doc
+
+    def __call__(self, a, *args, **params):
+        if self.reversed:
+            args = list(args)
+            a, args[0] = args[0], a
+
+        marr = asanyarray(a)
+        method_name = self.__name__
+        method = getattr(type(marr), method_name, None)
+        if method is None:
+            # use the corresponding np function
+            method = getattr(np, method_name)
+
+        return method(marr, *args, **params)
+
+
+all = _frommethod('all')
+anomalies = anom = _frommethod('anom')
+any = _frommethod('any')
+compress = _frommethod('compress', reversed=True)
+cumprod = _frommethod('cumprod')
+cumsum = _frommethod('cumsum')
+copy = _frommethod('copy')
+diagonal = _frommethod('diagonal')
+harden_mask = _frommethod('harden_mask')
+ids = _frommethod('ids')
+maximum = _extrema_operation(umath.maximum, greater, maximum_fill_value)
+mean = _frommethod('mean')
+minimum = _extrema_operation(umath.minimum, less, minimum_fill_value)
+nonzero = _frommethod('nonzero')
+prod = _frommethod('prod')
+product = _frommethod('prod')
+ravel = _frommethod('ravel')
+repeat = _frommethod('repeat')
+shrink_mask = _frommethod('shrink_mask')
+soften_mask = _frommethod('soften_mask')
+std = _frommethod('std')
+sum = _frommethod('sum')
+swapaxes = _frommethod('swapaxes')
+#take = _frommethod('take')
+trace = _frommethod('trace')
+var = _frommethod('var')
+
+count = _frommethod('count')
+
+def take(a, indices, axis=None, out=None, mode='raise'):
+    """
+    """
+    a = masked_array(a)
+    return a.take(indices, axis=axis, out=out, mode=mode)
+
+
+def power(a, b, third=None):
+    """
+    Returns element-wise base array raised to power from second array.
+
+    This is the masked array version of `numpy.power`. For details see
+    `numpy.power`.
+
+    See Also
+    --------
+    numpy.power
+
+    Notes
+    -----
+    The *out* argument to `numpy.power` is not supported, `third` has to be
+    None.
+
+    """
+    if third is not None:
+        raise MaskError("3-argument power not supported.")
+    # Get the masks
+    ma = getmask(a)
+    mb = getmask(b)
+    m = mask_or(ma, mb)
+    # Get the rawdata
+    fa = getdata(a)
+    fb = getdata(b)
+    # Get the type of the result (so that we preserve subclasses)
+    if isinstance(a, MaskedArray):
+        basetype = type(a)
+    else:
+        basetype = MaskedArray
+    # Get the result and view it as a (subclass of) MaskedArray
+    with np.errstate(divide='ignore', invalid='ignore'):
+        result = np.where(m, fa, umath.power(fa, fb)).view(basetype)
+    result._update_from(a)
+    # Find where we're in trouble w/ NaNs and Infs
+    invalid = np.logical_not(np.isfinite(result.view(ndarray)))
+    # Add the initial mask
+    if m is not nomask:
+        if not result.ndim:
+            return masked
+        result._mask = np.logical_or(m, invalid)
+    # Fix the invalid parts
+    if invalid.any():
+        if not result.ndim:
+            return masked
+        elif result._mask is nomask:
+            result._mask = invalid
+        result._data[invalid] = result.fill_value
+    return result
+
+argmin = _frommethod('argmin')
+argmax = _frommethod('argmax')
+
+def argsort(a, axis=np._NoValue, kind=None, order=None, endwith=True, fill_value=None):
+    "Function version of the eponymous method."
+    a = np.asanyarray(a)
+
+    # 2017-04-11, Numpy 1.13.0, gh-8701: warn on axis default
+    if axis is np._NoValue:
+        axis = _deprecate_argsort_axis(a)
+
+    if isinstance(a, MaskedArray):
+        return a.argsort(axis=axis, kind=kind, order=order,
+                         endwith=endwith, fill_value=fill_value)
+    else:
+        return a.argsort(axis=axis, kind=kind, order=order)
+argsort.__doc__ = MaskedArray.argsort.__doc__
+
+def sort(a, axis=-1, kind=None, order=None, endwith=True, fill_value=None):
+    """
+    Return a sorted copy of the masked array.
+
+    Equivalent to creating a copy of the array
+    and applying the  MaskedArray ``sort()`` method.
+
+    Refer to ``MaskedArray.sort`` for the full documentation
+
+    See Also
+    --------
+    MaskedArray.sort : equivalent method
+    """
+    a = np.array(a, copy=True, subok=True)
+    if axis is None:
+        a = a.flatten()
+        axis = 0
+
+    if isinstance(a, MaskedArray):
+        a.sort(axis=axis, kind=kind, order=order,
+               endwith=endwith, fill_value=fill_value)
+    else:
+        a.sort(axis=axis, kind=kind, order=order)
+    return a
+
+
+def compressed(x):
+    """
+    Return all the non-masked data as a 1-D array.
+
+    This function is equivalent to calling the "compressed" method of a
+    `MaskedArray`, see `MaskedArray.compressed` for details.
+
+    See Also
+    --------
+    MaskedArray.compressed
+        Equivalent method.
+
+    """
+    return asanyarray(x).compressed()
+
+
+def concatenate(arrays, axis=0):
+    """
+    Concatenate a sequence of arrays along the given axis.
+
+    Parameters
+    ----------
+    arrays : sequence of array_like
+        The arrays must have the same shape, except in the dimension
+        corresponding to `axis` (the first, by default).
+    axis : int, optional
+        The axis along which the arrays will be joined. Default is 0.
+
+    Returns
+    -------
+    result : MaskedArray
+        The concatenated array with any masked entries preserved.
+
+    See Also
+    --------
+    numpy.concatenate : Equivalent function in the top-level NumPy module.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.arange(3)
+    >>> a[1] = ma.masked
+    >>> b = ma.arange(2, 5)
+    >>> a
+    masked_array(data=[0, --, 2],
+                 mask=[False,  True, False],
+           fill_value=999999)
+    >>> b
+    masked_array(data=[2, 3, 4],
+                 mask=False,
+           fill_value=999999)
+    >>> ma.concatenate([a, b])
+    masked_array(data=[0, --, 2, 2, 3, 4],
+                 mask=[False,  True, False, False, False, False],
+           fill_value=999999)
+
+    """
+    d = np.concatenate([getdata(a) for a in arrays], axis)
+    rcls = get_masked_subclass(*arrays)
+    data = d.view(rcls)
+    # Check whether one of the arrays has a non-empty mask.
+    for x in arrays:
+        if getmask(x) is not nomask:
+            break
+    else:
+        return data
+    # OK, so we have to concatenate the masks
+    dm = np.concatenate([getmaskarray(a) for a in arrays], axis)
+    dm = dm.reshape(d.shape)
+
+    # If we decide to keep a '_shrinkmask' option, we want to check that
+    # all of them are True, and then check for dm.any()
+    data._mask = _shrink_mask(dm)
+    return data
+
+
+def diag(v, k=0):
+    """
+    Extract a diagonal or construct a diagonal array.
+
+    This function is the equivalent of `numpy.diag` that takes masked
+    values into account, see `numpy.diag` for details.
+
+    See Also
+    --------
+    numpy.diag : Equivalent function for ndarrays.
+
+    """
+    output = np.diag(v, k).view(MaskedArray)
+    if getmask(v) is not nomask:
+        output._mask = np.diag(v._mask, k)
+    return output
+
+
+def left_shift(a, n):
+    """
+    Shift the bits of an integer to the left.
+
+    This is the masked array version of `numpy.left_shift`, for details
+    see that function.
+
+    See Also
+    --------
+    numpy.left_shift
+
+    """
+    m = getmask(a)
+    if m is nomask:
+        d = umath.left_shift(filled(a), n)
+        return masked_array(d)
+    else:
+        d = umath.left_shift(filled(a, 0), n)
+        return masked_array(d, mask=m)
+
+
+def right_shift(a, n):
+    """
+    Shift the bits of an integer to the right.
+
+    This is the masked array version of `numpy.right_shift`, for details
+    see that function.
+
+    See Also
+    --------
+    numpy.right_shift
+
+    """
+    m = getmask(a)
+    if m is nomask:
+        d = umath.right_shift(filled(a), n)
+        return masked_array(d)
+    else:
+        d = umath.right_shift(filled(a, 0), n)
+        return masked_array(d, mask=m)
+
+
+def put(a, indices, values, mode='raise'):
+    """
+    Set storage-indexed locations to corresponding values.
+
+    This function is equivalent to `MaskedArray.put`, see that method
+    for details.
+
+    See Also
+    --------
+    MaskedArray.put
+
+    """
+    # We can't use 'frommethod', the order of arguments is different
+    try:
+        return a.put(indices, values, mode=mode)
+    except AttributeError:
+        return narray(a, copy=False).put(indices, values, mode=mode)
+
+
+def putmask(a, mask, values):  # , mode='raise'):
+    """
+    Changes elements of an array based on conditional and input values.
+
+    This is the masked array version of `numpy.putmask`, for details see
+    `numpy.putmask`.
+
+    See Also
+    --------
+    numpy.putmask
+
+    Notes
+    -----
+    Using a masked array as `values` will **not** transform a `ndarray` into
+    a `MaskedArray`.
+
+    """
+    # We can't use 'frommethod', the order of arguments is different
+    if not isinstance(a, MaskedArray):
+        a = a.view(MaskedArray)
+    (valdata, valmask) = (getdata(values), getmask(values))
+    if getmask(a) is nomask:
+        if valmask is not nomask:
+            a._sharedmask = True
+            a._mask = make_mask_none(a.shape, a.dtype)
+            np.copyto(a._mask, valmask, where=mask)
+    elif a._hardmask:
+        if valmask is not nomask:
+            m = a._mask.copy()
+            np.copyto(m, valmask, where=mask)
+            a.mask |= m
+    else:
+        if valmask is nomask:
+            valmask = getmaskarray(values)
+        np.copyto(a._mask, valmask, where=mask)
+    np.copyto(a._data, valdata, where=mask)
+    return
+
+
+def transpose(a, axes=None):
+    """
+    Permute the dimensions of an array.
+
+    This function is exactly equivalent to `numpy.transpose`.
+
+    See Also
+    --------
+    numpy.transpose : Equivalent function in top-level NumPy module.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> x = ma.arange(4).reshape((2,2))
+    >>> x[1, 1] = ma.masked
+    >>> x
+    masked_array(
+      data=[[0, 1],
+            [2, --]],
+      mask=[[False, False],
+            [False,  True]],
+      fill_value=999999)
+
+    >>> ma.transpose(x)
+    masked_array(
+      data=[[0, 2],
+            [1, --]],
+      mask=[[False, False],
+            [False,  True]],
+      fill_value=999999)
+    """
+    # We can't use 'frommethod', as 'transpose' doesn't take keywords
+    try:
+        return a.transpose(axes)
+    except AttributeError:
+        return narray(a, copy=False).transpose(axes).view(MaskedArray)
+
+
+def reshape(a, new_shape, order='C'):
+    """
+    Returns an array containing the same data with a new shape.
+
+    Refer to `MaskedArray.reshape` for full documentation.
+
+    See Also
+    --------
+    MaskedArray.reshape : equivalent function
+
+    """
+    # We can't use 'frommethod', it whine about some parameters. Dmmit.
+    try:
+        return a.reshape(new_shape, order=order)
+    except AttributeError:
+        _tmp = narray(a, copy=False).reshape(new_shape, order=order)
+        return _tmp.view(MaskedArray)
+
+
+def resize(x, new_shape):
+    """
+    Return a new masked array with the specified size and shape.
+
+    This is the masked equivalent of the `numpy.resize` function. The new
+    array is filled with repeated copies of `x` (in the order that the
+    data are stored in memory). If `x` is masked, the new array will be
+    masked, and the new mask will be a repetition of the old one.
+
+    See Also
+    --------
+    numpy.resize : Equivalent function in the top level NumPy module.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.array([[1, 2] ,[3, 4]])
+    >>> a[0, 1] = ma.masked
+    >>> a
+    masked_array(
+      data=[[1, --],
+            [3, 4]],
+      mask=[[False,  True],
+            [False, False]],
+      fill_value=999999)
+    >>> np.resize(a, (3, 3))
+    masked_array(
+      data=[[1, 2, 3],
+            [4, 1, 2],
+            [3, 4, 1]],
+      mask=False,
+      fill_value=999999)
+    >>> ma.resize(a, (3, 3))
+    masked_array(
+      data=[[1, --, 3],
+            [4, 1, --],
+            [3, 4, 1]],
+      mask=[[False,  True, False],
+            [False, False,  True],
+            [False, False, False]],
+      fill_value=999999)
+
+    A MaskedArray is always returned, regardless of the input type.
+
+    >>> a = np.array([[1, 2] ,[3, 4]])
+    >>> ma.resize(a, (3, 3))
+    masked_array(
+      data=[[1, 2, 3],
+            [4, 1, 2],
+            [3, 4, 1]],
+      mask=False,
+      fill_value=999999)
+
+    """
+    # We can't use _frommethods here, as N.resize is notoriously whiny.
+    m = getmask(x)
+    if m is not nomask:
+        m = np.resize(m, new_shape)
+    result = np.resize(x, new_shape).view(get_masked_subclass(x))
+    if result.ndim:
+        result._mask = m
+    return result
+
+
+def ndim(obj):
+    """
+    maskedarray version of the numpy function.
+
+    """
+    return np.ndim(getdata(obj))
+
+ndim.__doc__ = np.ndim.__doc__
+
+
+def shape(obj):
+    "maskedarray version of the numpy function."
+    return np.shape(getdata(obj))
+shape.__doc__ = np.shape.__doc__
+
+
+def size(obj, axis=None):
+    "maskedarray version of the numpy function."
+    return np.size(getdata(obj), axis)
+size.__doc__ = np.size.__doc__
+
+
+##############################################################################
+#                            Extra functions                                 #
+##############################################################################
+
+
+def where(condition, x=_NoValue, y=_NoValue):
+    """
+    Return a masked array with elements from `x` or `y`, depending on condition.
+
+    .. note::
+        When only `condition` is provided, this function is identical to
+        `nonzero`. The rest of this documentation covers only the case where
+        all three arguments are provided.
+
+    Parameters
+    ----------
+    condition : array_like, bool
+        Where True, yield `x`, otherwise yield `y`.
+    x, y : array_like, optional
+        Values from which to choose. `x`, `y` and `condition` need to be
+        broadcastable to some shape.
+
+    Returns
+    -------
+    out : MaskedArray
+        An masked array with `masked` elements where the condition is masked,
+        elements from `x` where `condition` is True, and elements from `y`
+        elsewhere.
+
+    See Also
+    --------
+    numpy.where : Equivalent function in the top-level NumPy module.
+    nonzero : The function that is called when x and y are omitted
+
+    Examples
+    --------
+    >>> x = np.ma.array(np.arange(9.).reshape(3, 3), mask=[[0, 1, 0],
+    ...                                                    [1, 0, 1],
+    ...                                                    [0, 1, 0]])
+    >>> x
+    masked_array(
+      data=[[0.0, --, 2.0],
+            [--, 4.0, --],
+            [6.0, --, 8.0]],
+      mask=[[False,  True, False],
+            [ True, False,  True],
+            [False,  True, False]],
+      fill_value=1e+20)
+    >>> np.ma.where(x > 5, x, -3.1416)
+    masked_array(
+      data=[[-3.1416, --, -3.1416],
+            [--, -3.1416, --],
+            [6.0, --, 8.0]],
+      mask=[[False,  True, False],
+            [ True, False,  True],
+            [False,  True, False]],
+      fill_value=1e+20)
+
+    """
+
+    # handle the single-argument case
+    missing = (x is _NoValue, y is _NoValue).count(True)
+    if missing == 1:
+        raise ValueError("Must provide both 'x' and 'y' or neither.")
+    if missing == 2:
+        return nonzero(condition)
+
+    # we only care if the condition is true - false or masked pick y
+    cf = filled(condition, False)
+    xd = getdata(x)
+    yd = getdata(y)
+
+    # we need the full arrays here for correct final dimensions
+    cm = getmaskarray(condition)
+    xm = getmaskarray(x)
+    ym = getmaskarray(y)
+
+    # deal with the fact that masked.dtype == float64, but we don't actually
+    # want to treat it as that.
+    if x is masked and y is not masked:
+        xd = np.zeros((), dtype=yd.dtype)
+        xm = np.ones((),  dtype=ym.dtype)
+    elif y is masked and x is not masked:
+        yd = np.zeros((), dtype=xd.dtype)
+        ym = np.ones((),  dtype=xm.dtype)
+
+    data = np.where(cf, xd, yd)
+    mask = np.where(cf, xm, ym)
+    mask = np.where(cm, np.ones((), dtype=mask.dtype), mask)
+
+    # collapse the mask, for backwards compatibility
+    mask = _shrink_mask(mask)
+
+    return masked_array(data, mask=mask)
+
+
+def choose(indices, choices, out=None, mode='raise'):
+    """
+    Use an index array to construct a new array from a set of choices.
+
+    Given an array of integers and a set of n choice arrays, this method
+    will create a new array that merges each of the choice arrays.  Where a
+    value in `a` is i, the new array will have the value that choices[i]
+    contains in the same place.
+
+    Parameters
+    ----------
+    a : ndarray of ints
+        This array must contain integers in ``[0, n-1]``, where n is the
+        number of choices.
+    choices : sequence of arrays
+        Choice arrays. The index array and all of the choices should be
+        broadcastable to the same shape.
+    out : array, optional
+        If provided, the result will be inserted into this array. It should
+        be of the appropriate shape and `dtype`.
+    mode : {'raise', 'wrap', 'clip'}, optional
+        Specifies how out-of-bounds indices will behave.
+
+        * 'raise' : raise an error
+        * 'wrap' : wrap around
+        * 'clip' : clip to the range
+
+    Returns
+    -------
+    merged_array : array
+
+    See Also
+    --------
+    choose : equivalent function
+
+    Examples
+    --------
+    >>> choice = np.array([[1,1,1], [2,2,2], [3,3,3]])
+    >>> a = np.array([2, 1, 0])
+    >>> np.ma.choose(a, choice)
+    masked_array(data=[3, 2, 1],
+                 mask=False,
+           fill_value=999999)
+
+    """
+    def fmask(x):
+        "Returns the filled array, or True if masked."
+        if x is masked:
+            return True
+        return filled(x)
+
+    def nmask(x):
+        "Returns the mask, True if ``masked``, False if ``nomask``."
+        if x is masked:
+            return True
+        return getmask(x)
+    # Get the indices.
+    c = filled(indices, 0)
+    # Get the masks.
+    masks = [nmask(x) for x in choices]
+    data = [fmask(x) for x in choices]
+    # Construct the mask
+    outputmask = np.choose(c, masks, mode=mode)
+    outputmask = make_mask(mask_or(outputmask, getmask(indices)),
+                           copy=False, shrink=True)
+    # Get the choices.
+    d = np.choose(c, data, mode=mode, out=out).view(MaskedArray)
+    if out is not None:
+        if isinstance(out, MaskedArray):
+            out.__setmask__(outputmask)
+        return out
+    d.__setmask__(outputmask)
+    return d
+
+
+def round_(a, decimals=0, out=None):
+    """
+    Return a copy of a, rounded to 'decimals' places.
+
+    When 'decimals' is negative, it specifies the number of positions
+    to the left of the decimal point.  The real and imaginary parts of
+    complex numbers are rounded separately. Nothing is done if the
+    array is not of float type and 'decimals' is greater than or equal
+    to 0.
+
+    Parameters
+    ----------
+    decimals : int
+        Number of decimals to round to. May be negative.
+    out : array_like
+        Existing array to use for output.
+        If not given, returns a default copy of a.
+
+    Notes
+    -----
+    If out is given and does not have a mask attribute, the mask of a
+    is lost!
+
+    """
+    if out is None:
+        return np.round_(a, decimals, out)
+    else:
+        np.round_(getdata(a), decimals, out)
+        if hasattr(out, '_mask'):
+            out._mask = getmask(a)
+        return out
+round = round_
+
+
+# Needed by dot, so move here from extras.py. It will still be exported
+# from extras.py for compatibility.
+def mask_rowcols(a, axis=None):
+    """
+    Mask rows and/or columns of a 2D array that contain masked values.
+
+    Mask whole rows and/or columns of a 2D array that contain
+    masked values.  The masking behavior is selected using the
+    `axis` parameter.
+
+      - If `axis` is None, rows *and* columns are masked.
+      - If `axis` is 0, only rows are masked.
+      - If `axis` is 1 or -1, only columns are masked.
+
+    Parameters
+    ----------
+    a : array_like, MaskedArray
+        The array to mask.  If not a MaskedArray instance (or if no array
+        elements are masked).  The result is a MaskedArray with `mask` set
+        to `nomask` (False). Must be a 2D array.
+    axis : int, optional
+        Axis along which to perform the operation. If None, applies to a
+        flattened version of the array.
+
+    Returns
+    -------
+    a : MaskedArray
+        A modified version of the input array, masked depending on the value
+        of the `axis` parameter.
+
+    Raises
+    ------
+    NotImplementedError
+        If input array `a` is not 2D.
+
+    See Also
+    --------
+    mask_rows : Mask rows of a 2D array that contain masked values.
+    mask_cols : Mask cols of a 2D array that contain masked values.
+    masked_where : Mask where a condition is met.
+
+    Notes
+    -----
+    The input array's mask is modified by this function.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.zeros((3, 3), dtype=int)
+    >>> a[1, 1] = 1
+    >>> a
+    array([[0, 0, 0],
+           [0, 1, 0],
+           [0, 0, 0]])
+    >>> a = ma.masked_equal(a, 1)
+    >>> a
+    masked_array(
+      data=[[0, 0, 0],
+            [0, --, 0],
+            [0, 0, 0]],
+      mask=[[False, False, False],
+            [False,  True, False],
+            [False, False, False]],
+      fill_value=1)
+    >>> ma.mask_rowcols(a)
+    masked_array(
+      data=[[0, --, 0],
+            [--, --, --],
+            [0, --, 0]],
+      mask=[[False,  True, False],
+            [ True,  True,  True],
+            [False,  True, False]],
+      fill_value=1)
+
+    """
+    a = array(a, subok=False)
+    if a.ndim != 2:
+        raise NotImplementedError("mask_rowcols works for 2D arrays only.")
+    m = getmask(a)
+    # Nothing is masked: return a
+    if m is nomask or not m.any():
+        return a
+    maskedval = m.nonzero()
+    a._mask = a._mask.copy()
+    if not axis:
+        a[np.unique(maskedval[0])] = masked
+    if axis in [None, 1, -1]:
+        a[:, np.unique(maskedval[1])] = masked
+    return a
+
+
+# Include masked dot here to avoid import problems in getting it from
+# extras.py. Note that it is not included in __all__, but rather exported
+# from extras in order to avoid backward compatibility problems.
+def dot(a, b, strict=False, out=None):
+    """
+    Return the dot product of two arrays.
+
+    This function is the equivalent of `numpy.dot` that takes masked values
+    into account. Note that `strict` and `out` are in different position
+    than in the method version. In order to maintain compatibility with the
+    corresponding method, it is recommended that the optional arguments be
+    treated as keyword only.  At some point that may be mandatory.
+
+    .. note::
+      Works only with 2-D arrays at the moment.
+
+
+    Parameters
+    ----------
+    a, b : masked_array_like
+        Inputs arrays.
+    strict : bool, optional
+        Whether masked data are propagated (True) or set to 0 (False) for
+        the computation. Default is False.  Propagating the mask means that
+        if a masked value appears in a row or column, the whole row or
+        column is considered masked.
+    out : masked_array, optional
+        Output argument. This must have the exact kind that would be returned
+        if it was not used. In particular, it must have the right type, must be
+        C-contiguous, and its dtype must be the dtype that would be returned
+        for `dot(a,b)`. This is a performance feature. Therefore, if these
+        conditions are not met, an exception is raised, instead of attempting
+        to be flexible.
+
+        .. versionadded:: 1.10.2
+
+    See Also
+    --------
+    numpy.dot : Equivalent function for ndarrays.
+
+    Examples
+    --------
+    >>> a = np.ma.array([[1, 2, 3], [4, 5, 6]], mask=[[1, 0, 0], [0, 0, 0]])
+    >>> b = np.ma.array([[1, 2], [3, 4], [5, 6]], mask=[[1, 0], [0, 0], [0, 0]])
+    >>> np.ma.dot(a, b)
+    masked_array(
+      data=[[21, 26],
+            [45, 64]],
+      mask=[[False, False],
+            [False, False]],
+      fill_value=999999)
+    >>> np.ma.dot(a, b, strict=True)
+    masked_array(
+      data=[[--, --],
+            [--, 64]],
+      mask=[[ True,  True],
+            [ True, False]],
+      fill_value=999999)
+
+    """
+    # !!!: Works only with 2D arrays. There should be a way to get it to run
+    # with higher dimension
+    if strict and (a.ndim == 2) and (b.ndim == 2):
+        a = mask_rowcols(a, 0)
+        b = mask_rowcols(b, 1)
+    am = ~getmaskarray(a)
+    bm = ~getmaskarray(b)
+
+    if out is None:
+        d = np.dot(filled(a, 0), filled(b, 0))
+        m = ~np.dot(am, bm)
+        if d.ndim == 0:
+            d = np.asarray(d)
+        r = d.view(get_masked_subclass(a, b))
+        r.__setmask__(m)
+        return r
+    else:
+        d = np.dot(filled(a, 0), filled(b, 0), out._data)
+        if out.mask.shape != d.shape:
+            out._mask = np.empty(d.shape, MaskType)
+        np.dot(am, bm, out._mask)
+        np.logical_not(out._mask, out._mask)
+        return out
+
+
+def inner(a, b):
+    """
+    Returns the inner product of a and b for arrays of floating point types.
+
+    Like the generic NumPy equivalent the product sum is over the last dimension
+    of a and b. The first argument is not conjugated.
+
+    """
+    fa = filled(a, 0)
+    fb = filled(b, 0)
+    if fa.ndim == 0:
+        fa.shape = (1,)
+    if fb.ndim == 0:
+        fb.shape = (1,)
+    return np.inner(fa, fb).view(MaskedArray)
+inner.__doc__ = doc_note(np.inner.__doc__,
+                         "Masked values are replaced by 0.")
+innerproduct = inner
+
+
+def outer(a, b):
+    "maskedarray version of the numpy function."
+    fa = filled(a, 0).ravel()
+    fb = filled(b, 0).ravel()
+    d = np.outer(fa, fb)
+    ma = getmask(a)
+    mb = getmask(b)
+    if ma is nomask and mb is nomask:
+        return masked_array(d)
+    ma = getmaskarray(a)
+    mb = getmaskarray(b)
+    m = make_mask(1 - np.outer(1 - ma, 1 - mb), copy=False)
+    return masked_array(d, mask=m)
+outer.__doc__ = doc_note(np.outer.__doc__,
+                         "Masked values are replaced by 0.")
+outerproduct = outer
+
+
+def _convolve_or_correlate(f, a, v, mode, propagate_mask):
+    """
+    Helper function for ma.correlate and ma.convolve
+    """
+    if propagate_mask:
+        # results which are contributed to by either item in any pair being invalid
+        mask = (
+            f(getmaskarray(a), np.ones(np.shape(v), dtype=bool), mode=mode)
+          | f(np.ones(np.shape(a), dtype=bool), getmaskarray(v), mode=mode)
+        )
+        data = f(getdata(a), getdata(v), mode=mode)
+    else:
+        # results which are not contributed to by any pair of valid elements
+        mask = ~f(~getmaskarray(a), ~getmaskarray(v))
+        data = f(filled(a, 0), filled(v, 0), mode=mode)
+
+    return masked_array(data, mask=mask)
+
+
+def correlate(a, v, mode='valid', propagate_mask=True):
+    """
+    Cross-correlation of two 1-dimensional sequences.
+
+    Parameters
+    ----------
+    a, v : array_like
+        Input sequences.
+    mode : {'valid', 'same', 'full'}, optional
+        Refer to the `np.convolve` docstring.  Note that the default
+        is 'valid', unlike `convolve`, which uses 'full'.
+    propagate_mask : bool
+        If True, then a result element is masked if any masked element contributes towards it.
+        If False, then a result element is only masked if no non-masked element
+        contribute towards it
+
+    Returns
+    -------
+    out : MaskedArray
+        Discrete cross-correlation of `a` and `v`.
+
+    See Also
+    --------
+    numpy.correlate : Equivalent function in the top-level NumPy module.
+    """
+    return _convolve_or_correlate(np.correlate, a, v, mode, propagate_mask)
+
+
+def convolve(a, v, mode='full', propagate_mask=True):
+    """
+    Returns the discrete, linear convolution of two one-dimensional sequences.
+
+    Parameters
+    ----------
+    a, v : array_like
+        Input sequences.
+    mode : {'valid', 'same', 'full'}, optional
+        Refer to the `np.convolve` docstring.
+    propagate_mask : bool
+        If True, then if any masked element is included in the sum for a result
+        element, then the result is masked.
+        If False, then the result element is only masked if no non-masked cells
+        contribute towards it
+
+    Returns
+    -------
+    out : MaskedArray
+        Discrete, linear convolution of `a` and `v`.
+
+    See Also
+    --------
+    numpy.convolve : Equivalent function in the top-level NumPy module.
+    """
+    return _convolve_or_correlate(np.convolve, a, v, mode, propagate_mask)
+
+
+def allequal(a, b, fill_value=True):
+    """
+    Return True if all entries of a and b are equal, using
+    fill_value as a truth value where either or both are masked.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Input arrays to compare.
+    fill_value : bool, optional
+        Whether masked values in a or b are considered equal (True) or not
+        (False).
+
+    Returns
+    -------
+    y : bool
+        Returns True if the two arrays are equal within the given
+        tolerance, False otherwise. If either array contains NaN,
+        then False is returned.
+
+    See Also
+    --------
+    all, any
+    numpy.ma.allclose
+
+    Examples
+    --------
+    >>> a = np.ma.array([1e10, 1e-7, 42.0], mask=[0, 0, 1])
+    >>> a
+    masked_array(data=[10000000000.0, 1e-07, --],
+                 mask=[False, False,  True],
+           fill_value=1e+20)
+
+    >>> b = np.array([1e10, 1e-7, -42.0])
+    >>> b
+    array([  1.00000000e+10,   1.00000000e-07,  -4.20000000e+01])
+    >>> np.ma.allequal(a, b, fill_value=False)
+    False
+    >>> np.ma.allequal(a, b)
+    True
+
+    """
+    m = mask_or(getmask(a), getmask(b))
+    if m is nomask:
+        x = getdata(a)
+        y = getdata(b)
+        d = umath.equal(x, y)
+        return d.all()
+    elif fill_value:
+        x = getdata(a)
+        y = getdata(b)
+        d = umath.equal(x, y)
+        dm = array(d, mask=m, copy=False)
+        return dm.filled(True).all(None)
+    else:
+        return False
+
+
+def allclose(a, b, masked_equal=True, rtol=1e-5, atol=1e-8):
+    """
+    Returns True if two arrays are element-wise equal within a tolerance.
+
+    This function is equivalent to `allclose` except that masked values
+    are treated as equal (default) or unequal, depending on the `masked_equal`
+    argument.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Input arrays to compare.
+    masked_equal : bool, optional
+        Whether masked values in `a` and `b` are considered equal (True) or not
+        (False). They are considered equal by default.
+    rtol : float, optional
+        Relative tolerance. The relative difference is equal to ``rtol * b``.
+        Default is 1e-5.
+    atol : float, optional
+        Absolute tolerance. The absolute difference is equal to `atol`.
+        Default is 1e-8.
+
+    Returns
+    -------
+    y : bool
+        Returns True if the two arrays are equal within the given
+        tolerance, False otherwise. If either array contains NaN, then
+        False is returned.
+
+    See Also
+    --------
+    all, any
+    numpy.allclose : the non-masked `allclose`.
+
+    Notes
+    -----
+    If the following equation is element-wise True, then `allclose` returns
+    True::
+
+      absolute(`a` - `b`) <= (`atol` + `rtol` * absolute(`b`))
+
+    Return True if all elements of `a` and `b` are equal subject to
+    given tolerances.
+
+    Examples
+    --------
+    >>> a = np.ma.array([1e10, 1e-7, 42.0], mask=[0, 0, 1])
+    >>> a
+    masked_array(data=[10000000000.0, 1e-07, --],
+                 mask=[False, False,  True],
+           fill_value=1e+20)
+    >>> b = np.ma.array([1e10, 1e-8, -42.0], mask=[0, 0, 1])
+    >>> np.ma.allclose(a, b)
+    False
+
+    >>> a = np.ma.array([1e10, 1e-8, 42.0], mask=[0, 0, 1])
+    >>> b = np.ma.array([1.00001e10, 1e-9, -42.0], mask=[0, 0, 1])
+    >>> np.ma.allclose(a, b)
+    True
+    >>> np.ma.allclose(a, b, masked_equal=False)
+    False
+
+    Masked values are not compared directly.
+
+    >>> a = np.ma.array([1e10, 1e-8, 42.0], mask=[0, 0, 1])
+    >>> b = np.ma.array([1.00001e10, 1e-9, 42.0], mask=[0, 0, 1])
+    >>> np.ma.allclose(a, b)
+    True
+    >>> np.ma.allclose(a, b, masked_equal=False)
+    False
+
+    """
+    x = masked_array(a, copy=False)
+    y = masked_array(b, copy=False)
+
+    # make sure y is an inexact type to avoid abs(MIN_INT); will cause
+    # casting of x later.
+    dtype = np.result_type(y, 1.)
+    if y.dtype != dtype:
+        y = masked_array(y, dtype=dtype, copy=False)
+
+    m = mask_or(getmask(x), getmask(y))
+    xinf = np.isinf(masked_array(x, copy=False, mask=m)).filled(False)
+    # If we have some infs, they should fall at the same place.
+    if not np.all(xinf == filled(np.isinf(y), False)):
+        return False
+    # No infs at all
+    if not np.any(xinf):
+        d = filled(less_equal(absolute(x - y), atol + rtol * absolute(y)),
+                   masked_equal)
+        return np.all(d)
+
+    if not np.all(filled(x[xinf] == y[xinf], masked_equal)):
+        return False
+    x = x[~xinf]
+    y = y[~xinf]
+
+    d = filled(less_equal(absolute(x - y), atol + rtol * absolute(y)),
+               masked_equal)
+
+    return np.all(d)
+
+
+def asarray(a, dtype=None, order=None):
+    """
+    Convert the input to a masked array of the given data-type.
+
+    No copy is performed if the input is already an `ndarray`. If `a` is
+    a subclass of `MaskedArray`, a base class `MaskedArray` is returned.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data, in any form that can be converted to a masked array. This
+        includes lists, lists of tuples, tuples, tuples of tuples, tuples
+        of lists, ndarrays and masked arrays.
+    dtype : dtype, optional
+        By default, the data-type is inferred from the input data.
+    order : {'C', 'F'}, optional
+        Whether to use row-major ('C') or column-major ('FORTRAN') memory
+        representation.  Default is 'C'.
+
+    Returns
+    -------
+    out : MaskedArray
+        Masked array interpretation of `a`.
+
+    See Also
+    --------
+    asanyarray : Similar to `asarray`, but conserves subclasses.
+
+    Examples
+    --------
+    >>> x = np.arange(10.).reshape(2, 5)
+    >>> x
+    array([[0., 1., 2., 3., 4.],
+           [5., 6., 7., 8., 9.]])
+    >>> np.ma.asarray(x)
+    masked_array(
+      data=[[0., 1., 2., 3., 4.],
+            [5., 6., 7., 8., 9.]],
+      mask=False,
+      fill_value=1e+20)
+    >>> type(np.ma.asarray(x))
+    <class 'numpy.ma.core.MaskedArray'>
+
+    """
+    order = order or 'C'
+    return masked_array(a, dtype=dtype, copy=False, keep_mask=True,
+                        subok=False, order=order)
+
+
+def asanyarray(a, dtype=None):
+    """
+    Convert the input to a masked array, conserving subclasses.
+
+    If `a` is a subclass of `MaskedArray`, its class is conserved.
+    No copy is performed if the input is already an `ndarray`.
+
+    Parameters
+    ----------
+    a : array_like
+        Input data, in any form that can be converted to an array.
+    dtype : dtype, optional
+        By default, the data-type is inferred from the input data.
+    order : {'C', 'F'}, optional
+        Whether to use row-major ('C') or column-major ('FORTRAN') memory
+        representation.  Default is 'C'.
+
+    Returns
+    -------
+    out : MaskedArray
+        MaskedArray interpretation of `a`.
+
+    See Also
+    --------
+    asarray : Similar to `asanyarray`, but does not conserve subclass.
+
+    Examples
+    --------
+    >>> x = np.arange(10.).reshape(2, 5)
+    >>> x
+    array([[0., 1., 2., 3., 4.],
+           [5., 6., 7., 8., 9.]])
+    >>> np.ma.asanyarray(x)
+    masked_array(
+      data=[[0., 1., 2., 3., 4.],
+            [5., 6., 7., 8., 9.]],
+      mask=False,
+      fill_value=1e+20)
+    >>> type(np.ma.asanyarray(x))
+    <class 'numpy.ma.core.MaskedArray'>
+
+    """
+    # workaround for #8666, to preserve identity. Ideally the bottom line
+    # would handle this for us.
+    if isinstance(a, MaskedArray) and (dtype is None or dtype == a.dtype):
+        return a
+    return masked_array(a, dtype=dtype, copy=False, keep_mask=True, subok=True)
+
+
+##############################################################################
+#                               Pickling                                     #
+##############################################################################
+
+def _pickle_warn(method):
+    # NumPy 1.15.0, 2017-12-10
+    warnings.warn(
+        f"np.ma.{method} is deprecated, use pickle.{method} instead",
+        DeprecationWarning, stacklevel=3)
+
+
+def fromfile(file, dtype=float, count=-1, sep=''):
+    raise NotImplementedError(
+        "fromfile() not yet implemented for a MaskedArray.")
+
+
+def fromflex(fxarray):
+    """
+    Build a masked array from a suitable flexible-type array.
+
+    The input array has to have a data-type with ``_data`` and ``_mask``
+    fields. This type of array is output by `MaskedArray.toflex`.
+
+    Parameters
+    ----------
+    fxarray : ndarray
+        The structured input array, containing ``_data`` and ``_mask``
+        fields. If present, other fields are discarded.
+
+    Returns
+    -------
+    result : MaskedArray
+        The constructed masked array.
+
+    See Also
+    --------
+    MaskedArray.toflex : Build a flexible-type array from a masked array.
+
+    Examples
+    --------
+    >>> x = np.ma.array(np.arange(9).reshape(3, 3), mask=[0] + [1, 0] * 4)
+    >>> rec = x.toflex()
+    >>> rec
+    array([[(0, False), (1,  True), (2, False)],
+           [(3,  True), (4, False), (5,  True)],
+           [(6, False), (7,  True), (8, False)]],
+          dtype=[('_data', '<i8'), ('_mask', '?')])
+    >>> x2 = np.ma.fromflex(rec)
+    >>> x2
+    masked_array(
+      data=[[0, --, 2],
+            [--, 4, --],
+            [6, --, 8]],
+      mask=[[False,  True, False],
+            [ True, False,  True],
+            [False,  True, False]],
+      fill_value=999999)
+
+    Extra fields can be present in the structured array but are discarded:
+
+    >>> dt = [('_data', '<i4'), ('_mask', '|b1'), ('field3', '<f4')]
+    >>> rec2 = np.zeros((2, 2), dtype=dt)
+    >>> rec2
+    array([[(0, False, 0.), (0, False, 0.)],
+           [(0, False, 0.), (0, False, 0.)]],
+          dtype=[('_data', '<i4'), ('_mask', '?'), ('field3', '<f4')])
+    >>> y = np.ma.fromflex(rec2)
+    >>> y
+    masked_array(
+      data=[[0, 0],
+            [0, 0]],
+      mask=[[False, False],
+            [False, False]],
+      fill_value=999999,
+      dtype=int32)
+
+    """
+    return masked_array(fxarray['_data'], mask=fxarray['_mask'])
+
+
+class _convert2ma:
+
+    """
+    Convert functions from numpy to numpy.ma.
+
+    Parameters
+    ----------
+        _methodname : string
+            Name of the method to transform.
+
+    """
+    __doc__ = None
+
+    def __init__(self, funcname, params=None):
+        self._func = getattr(np, funcname)
+        self.__doc__ = self.getdoc()
+        self._extras = params or {}
+
+    def getdoc(self):
+        "Return the doc of the function (from the doc of the method)."
+        doc = getattr(self._func, '__doc__', None)
+        sig = get_object_signature(self._func)
+        if doc:
+            # Add the signature of the function at the beginning of the doc
+            if sig:
+                sig = "%s%s\n" % (self._func.__name__, sig)
+            doc = sig + doc
+        return doc
+
+    def __call__(self, *args, **params):
+        # Find the common parameters to the call and the definition
+        _extras = self._extras
+        common_params = set(params).intersection(_extras)
+        # Drop the common parameters from the call
+        for p in common_params:
+            _extras[p] = params.pop(p)
+        # Get the result
+        result = self._func.__call__(*args, **params).view(MaskedArray)
+        if "fill_value" in common_params:
+            result.fill_value = _extras.get("fill_value", None)
+        if "hardmask" in common_params:
+            result._hardmask = bool(_extras.get("hard_mask", False))
+        return result
+
+arange = _convert2ma('arange', params=dict(fill_value=None, hardmask=False))
+clip = np.clip
+diff = np.diff
+empty = _convert2ma('empty', params=dict(fill_value=None, hardmask=False))
+empty_like = _convert2ma('empty_like')
+frombuffer = _convert2ma('frombuffer')
+fromfunction = _convert2ma('fromfunction')
+identity = _convert2ma(
+    'identity', params=dict(fill_value=None, hardmask=False))
+indices = np.indices
+ones = _convert2ma('ones', params=dict(fill_value=None, hardmask=False))
+ones_like = np.ones_like
+squeeze = np.squeeze
+zeros = _convert2ma('zeros', params=dict(fill_value=None, hardmask=False))
+zeros_like = np.zeros_like
+
+
+def append(a, b, axis=None):
+    """Append values to the end of an array.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    a : array_like
+        Values are appended to a copy of this array.
+    b : array_like
+        These values are appended to a copy of `a`.  It must be of the
+        correct shape (the same shape as `a`, excluding `axis`).  If `axis`
+        is not specified, `b` can be any shape and will be flattened
+        before use.
+    axis : int, optional
+        The axis along which `v` are appended.  If `axis` is not given,
+        both `a` and `b` are flattened before use.
+
+    Returns
+    -------
+    append : MaskedArray
+        A copy of `a` with `b` appended to `axis`.  Note that `append`
+        does not occur in-place: a new array is allocated and filled.  If
+        `axis` is None, the result is a flattened array.
+
+    See Also
+    --------
+    numpy.append : Equivalent function in the top-level NumPy module.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = ma.masked_values([1, 2, 3], 2)
+    >>> b = ma.masked_values([[4, 5, 6], [7, 8, 9]], 7)
+    >>> ma.append(a, b)
+    masked_array(data=[1, --, 3, 4, 5, 6, --, 8, 9],
+                 mask=[False,  True, False, False, False, False,  True, False,
+                       False],
+           fill_value=999999)
+    """
+    return concatenate([a, b], axis)
diff --git a/venv/Lib/site-packages/numpy/ma/extras.py b/venv/Lib/site-packages/numpy/ma/extras.py
new file mode 100644
index 000000000..f86ebf551
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/extras.py
@@ -0,0 +1,1928 @@
+"""
+Masked arrays add-ons.
+
+A collection of utilities for `numpy.ma`.
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+:version: $Id: extras.py 3473 2007-10-29 15:18:13Z jarrod.millman $
+
+"""
+__all__ = [
+    'apply_along_axis', 'apply_over_axes', 'atleast_1d', 'atleast_2d',
+    'atleast_3d', 'average', 'clump_masked', 'clump_unmasked',
+    'column_stack', 'compress_cols', 'compress_nd', 'compress_rowcols',
+    'compress_rows', 'count_masked', 'corrcoef', 'cov', 'diagflat', 'dot',
+    'dstack', 'ediff1d', 'flatnotmasked_contiguous', 'flatnotmasked_edges',
+    'hsplit', 'hstack', 'isin', 'in1d', 'intersect1d', 'mask_cols', 'mask_rowcols',
+    'mask_rows', 'masked_all', 'masked_all_like', 'median', 'mr_',
+    'notmasked_contiguous', 'notmasked_edges', 'polyfit', 'row_stack',
+    'setdiff1d', 'setxor1d', 'stack', 'unique', 'union1d', 'vander', 'vstack',
+    ]
+
+import itertools
+import warnings
+
+from . import core as ma
+from .core import (
+    MaskedArray, MAError, add, array, asarray, concatenate, filled, count,
+    getmask, getmaskarray, make_mask_descr, masked, masked_array, mask_or,
+    nomask, ones, sort, zeros, getdata, get_masked_subclass, dot,
+    mask_rowcols
+    )
+
+import numpy as np
+from numpy import ndarray, array as nxarray
+import numpy.core.umath as umath
+from numpy.core.multiarray import normalize_axis_index
+from numpy.core.numeric import normalize_axis_tuple
+from numpy.lib.function_base import _ureduce
+from numpy.lib.index_tricks import AxisConcatenator
+
+
+def issequence(seq):
+    """
+    Is seq a sequence (ndarray, list or tuple)?
+
+    """
+    return isinstance(seq, (ndarray, tuple, list))
+
+
+def count_masked(arr, axis=None):
+    """
+    Count the number of masked elements along the given axis.
+
+    Parameters
+    ----------
+    arr : array_like
+        An array with (possibly) masked elements.
+    axis : int, optional
+        Axis along which to count. If None (default), a flattened
+        version of the array is used.
+
+    Returns
+    -------
+    count : int, ndarray
+        The total number of masked elements (axis=None) or the number
+        of masked elements along each slice of the given axis.
+
+    See Also
+    --------
+    MaskedArray.count : Count non-masked elements.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.arange(9).reshape((3,3))
+    >>> a = ma.array(a)
+    >>> a[1, 0] = ma.masked
+    >>> a[1, 2] = ma.masked
+    >>> a[2, 1] = ma.masked
+    >>> a
+    masked_array(
+      data=[[0, 1, 2],
+            [--, 4, --],
+            [6, --, 8]],
+      mask=[[False, False, False],
+            [ True, False,  True],
+            [False,  True, False]],
+      fill_value=999999)
+    >>> ma.count_masked(a)
+    3
+
+    When the `axis` keyword is used an array is returned.
+
+    >>> ma.count_masked(a, axis=0)
+    array([1, 1, 1])
+    >>> ma.count_masked(a, axis=1)
+    array([0, 2, 1])
+
+    """
+    m = getmaskarray(arr)
+    return m.sum(axis)
+
+
+def masked_all(shape, dtype=float):
+    """
+    Empty masked array with all elements masked.
+
+    Return an empty masked array of the given shape and dtype, where all the
+    data are masked.
+
+    Parameters
+    ----------
+    shape : tuple
+        Shape of the required MaskedArray.
+    dtype : dtype, optional
+        Data type of the output.
+
+    Returns
+    -------
+    a : MaskedArray
+        A masked array with all data masked.
+
+    See Also
+    --------
+    masked_all_like : Empty masked array modelled on an existing array.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> ma.masked_all((3, 3))
+    masked_array(
+      data=[[--, --, --],
+            [--, --, --],
+            [--, --, --]],
+      mask=[[ True,  True,  True],
+            [ True,  True,  True],
+            [ True,  True,  True]],
+      fill_value=1e+20,
+      dtype=float64)
+
+    The `dtype` parameter defines the underlying data type.
+
+    >>> a = ma.masked_all((3, 3))
+    >>> a.dtype
+    dtype('float64')
+    >>> a = ma.masked_all((3, 3), dtype=np.int32)
+    >>> a.dtype
+    dtype('int32')
+
+    """
+    a = masked_array(np.empty(shape, dtype),
+                     mask=np.ones(shape, make_mask_descr(dtype)))
+    return a
+
+
+def masked_all_like(arr):
+    """
+    Empty masked array with the properties of an existing array.
+
+    Return an empty masked array of the same shape and dtype as
+    the array `arr`, where all the data are masked.
+
+    Parameters
+    ----------
+    arr : ndarray
+        An array describing the shape and dtype of the required MaskedArray.
+
+    Returns
+    -------
+    a : MaskedArray
+        A masked array with all data masked.
+
+    Raises
+    ------
+    AttributeError
+        If `arr` doesn't have a shape attribute (i.e. not an ndarray)
+
+    See Also
+    --------
+    masked_all : Empty masked array with all elements masked.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> arr = np.zeros((2, 3), dtype=np.float32)
+    >>> arr
+    array([[0., 0., 0.],
+           [0., 0., 0.]], dtype=float32)
+    >>> ma.masked_all_like(arr)
+    masked_array(
+      data=[[--, --, --],
+            [--, --, --]],
+      mask=[[ True,  True,  True],
+            [ True,  True,  True]],
+      fill_value=1e+20,
+      dtype=float32)
+
+    The dtype of the masked array matches the dtype of `arr`.
+
+    >>> arr.dtype
+    dtype('float32')
+    >>> ma.masked_all_like(arr).dtype
+    dtype('float32')
+
+    """
+    a = np.empty_like(arr).view(MaskedArray)
+    a._mask = np.ones(a.shape, dtype=make_mask_descr(a.dtype))
+    return a
+
+
+#####--------------------------------------------------------------------------
+#---- --- Standard functions ---
+#####--------------------------------------------------------------------------
+class _fromnxfunction:
+    """
+    Defines a wrapper to adapt NumPy functions to masked arrays.
+
+
+    An instance of `_fromnxfunction` can be called with the same parameters
+    as the wrapped NumPy function. The docstring of `newfunc` is adapted from
+    the wrapped function as well, see `getdoc`.
+
+    This class should not be used directly. Instead, one of its extensions that
+    provides support for a specific type of input should be used.
+
+    Parameters
+    ----------
+    funcname : str
+        The name of the function to be adapted. The function should be
+        in the NumPy namespace (i.e. ``np.funcname``).
+
+    """
+
+    def __init__(self, funcname):
+        self.__name__ = funcname
+        self.__doc__ = self.getdoc()
+
+    def getdoc(self):
+        """
+        Retrieve the docstring and signature from the function.
+
+        The ``__doc__`` attribute of the function is used as the docstring for
+        the new masked array version of the function. A note on application
+        of the function to the mask is appended.
+
+        .. warning::
+          If the function docstring already contained a Notes section, the
+          new docstring will have two Notes sections instead of appending a note
+          to the existing section.
+
+        Parameters
+        ----------
+        None
+
+        """
+        npfunc = getattr(np, self.__name__, None)
+        doc = getattr(npfunc, '__doc__', None)
+        if doc:
+            sig = self.__name__ + ma.get_object_signature(npfunc)
+            locdoc = "Notes\n-----\nThe function is applied to both the _data"\
+                     " and the _mask, if any."
+            return '\n'.join((sig, doc, locdoc))
+        return
+
+    def __call__(self, *args, **params):
+        pass
+
+
+class _fromnxfunction_single(_fromnxfunction):
+    """
+    A version of `_fromnxfunction` that is called with a single array
+    argument followed by auxiliary args that are passed verbatim for
+    both the data and mask calls.
+    """
+    def __call__(self, x, *args, **params):
+        func = getattr(np, self.__name__)
+        if isinstance(x, ndarray):
+            _d = func(x.__array__(), *args, **params)
+            _m = func(getmaskarray(x), *args, **params)
+            return masked_array(_d, mask=_m)
+        else:
+            _d = func(np.asarray(x), *args, **params)
+            _m = func(getmaskarray(x), *args, **params)
+            return masked_array(_d, mask=_m)
+
+
+class _fromnxfunction_seq(_fromnxfunction):
+    """
+    A version of `_fromnxfunction` that is called with a single sequence
+    of arrays followed by auxiliary args that are passed verbatim for
+    both the data and mask calls.
+    """
+    def __call__(self, x, *args, **params):
+        func = getattr(np, self.__name__)
+        _d = func(tuple([np.asarray(a) for a in x]), *args, **params)
+        _m = func(tuple([getmaskarray(a) for a in x]), *args, **params)
+        return masked_array(_d, mask=_m)
+
+
+class _fromnxfunction_args(_fromnxfunction):
+    """
+    A version of `_fromnxfunction` that is called with multiple array
+    arguments. The first non-array-like input marks the beginning of the
+    arguments that are passed verbatim for both the data and mask calls.
+    Array arguments are processed independently and the results are
+    returned in a list. If only one array is found, the return value is
+    just the processed array instead of a list.
+    """
+    def __call__(self, *args, **params):
+        func = getattr(np, self.__name__)
+        arrays = []
+        args = list(args)
+        while len(args) > 0 and issequence(args[0]):
+            arrays.append(args.pop(0))
+        res = []
+        for x in arrays:
+            _d = func(np.asarray(x), *args, **params)
+            _m = func(getmaskarray(x), *args, **params)
+            res.append(masked_array(_d, mask=_m))
+        if len(arrays) == 1:
+            return res[0]
+        return res
+
+
+class _fromnxfunction_allargs(_fromnxfunction):
+    """
+    A version of `_fromnxfunction` that is called with multiple array
+    arguments. Similar to `_fromnxfunction_args` except that all args
+    are converted to arrays even if they are not so already. This makes
+    it possible to process scalars as 1-D arrays. Only keyword arguments
+    are passed through verbatim for the data and mask calls. Arrays
+    arguments are processed independently and the results are returned
+    in a list. If only one arg is present, the return value is just the
+    processed array instead of a list.
+    """
+    def __call__(self, *args, **params):
+        func = getattr(np, self.__name__)
+        res = []
+        for x in args:
+            _d = func(np.asarray(x), **params)
+            _m = func(getmaskarray(x), **params)
+            res.append(masked_array(_d, mask=_m))
+        if len(args) == 1:
+            return res[0]
+        return res
+
+
+atleast_1d = _fromnxfunction_allargs('atleast_1d')
+atleast_2d = _fromnxfunction_allargs('atleast_2d')
+atleast_3d = _fromnxfunction_allargs('atleast_3d')
+
+vstack = row_stack = _fromnxfunction_seq('vstack')
+hstack = _fromnxfunction_seq('hstack')
+column_stack = _fromnxfunction_seq('column_stack')
+dstack = _fromnxfunction_seq('dstack')
+stack = _fromnxfunction_seq('stack')
+
+hsplit = _fromnxfunction_single('hsplit')
+
+diagflat = _fromnxfunction_single('diagflat')
+
+
+#####--------------------------------------------------------------------------
+#----
+#####--------------------------------------------------------------------------
+def flatten_inplace(seq):
+    """Flatten a sequence in place."""
+    k = 0
+    while (k != len(seq)):
+        while hasattr(seq[k], '__iter__'):
+            seq[k:(k + 1)] = seq[k]
+        k += 1
+    return seq
+
+
+def apply_along_axis(func1d, axis, arr, *args, **kwargs):
+    """
+    (This docstring should be overwritten)
+    """
+    arr = array(arr, copy=False, subok=True)
+    nd = arr.ndim
+    axis = normalize_axis_index(axis, nd)
+    ind = [0] * (nd - 1)
+    i = np.zeros(nd, 'O')
+    indlist = list(range(nd))
+    indlist.remove(axis)
+    i[axis] = slice(None, None)
+    outshape = np.asarray(arr.shape).take(indlist)
+    i.put(indlist, ind)
+    res = func1d(arr[tuple(i.tolist())], *args, **kwargs)
+    #  if res is a number, then we have a smaller output array
+    asscalar = np.isscalar(res)
+    if not asscalar:
+        try:
+            len(res)
+        except TypeError:
+            asscalar = True
+    # Note: we shouldn't set the dtype of the output from the first result
+    # so we force the type to object, and build a list of dtypes.  We'll
+    # just take the largest, to avoid some downcasting
+    dtypes = []
+    if asscalar:
+        dtypes.append(np.asarray(res).dtype)
+        outarr = zeros(outshape, object)
+        outarr[tuple(ind)] = res
+        Ntot = np.product(outshape)
+        k = 1
+        while k < Ntot:
+            # increment the index
+            ind[-1] += 1
+            n = -1
+            while (ind[n] >= outshape[n]) and (n > (1 - nd)):
+                ind[n - 1] += 1
+                ind[n] = 0
+                n -= 1
+            i.put(indlist, ind)
+            res = func1d(arr[tuple(i.tolist())], *args, **kwargs)
+            outarr[tuple(ind)] = res
+            dtypes.append(asarray(res).dtype)
+            k += 1
+    else:
+        res = array(res, copy=False, subok=True)
+        j = i.copy()
+        j[axis] = ([slice(None, None)] * res.ndim)
+        j.put(indlist, ind)
+        Ntot = np.product(outshape)
+        holdshape = outshape
+        outshape = list(arr.shape)
+        outshape[axis] = res.shape
+        dtypes.append(asarray(res).dtype)
+        outshape = flatten_inplace(outshape)
+        outarr = zeros(outshape, object)
+        outarr[tuple(flatten_inplace(j.tolist()))] = res
+        k = 1
+        while k < Ntot:
+            # increment the index
+            ind[-1] += 1
+            n = -1
+            while (ind[n] >= holdshape[n]) and (n > (1 - nd)):
+                ind[n - 1] += 1
+                ind[n] = 0
+                n -= 1
+            i.put(indlist, ind)
+            j.put(indlist, ind)
+            res = func1d(arr[tuple(i.tolist())], *args, **kwargs)
+            outarr[tuple(flatten_inplace(j.tolist()))] = res
+            dtypes.append(asarray(res).dtype)
+            k += 1
+    max_dtypes = np.dtype(np.asarray(dtypes).max())
+    if not hasattr(arr, '_mask'):
+        result = np.asarray(outarr, dtype=max_dtypes)
+    else:
+        result = asarray(outarr, dtype=max_dtypes)
+        result.fill_value = ma.default_fill_value(result)
+    return result
+apply_along_axis.__doc__ = np.apply_along_axis.__doc__
+
+
+def apply_over_axes(func, a, axes):
+    """
+    (This docstring will be overwritten)
+    """
+    val = asarray(a)
+    N = a.ndim
+    if array(axes).ndim == 0:
+        axes = (axes,)
+    for axis in axes:
+        if axis < 0:
+            axis = N + axis
+        args = (val, axis)
+        res = func(*args)
+        if res.ndim == val.ndim:
+            val = res
+        else:
+            res = ma.expand_dims(res, axis)
+            if res.ndim == val.ndim:
+                val = res
+            else:
+                raise ValueError("function is not returning "
+                        "an array of the correct shape")
+    return val
+
+if apply_over_axes.__doc__ is not None:
+    apply_over_axes.__doc__ = np.apply_over_axes.__doc__[
+        :np.apply_over_axes.__doc__.find('Notes')].rstrip() + \
+    """
+
+    Examples
+    --------
+    >>> a = np.ma.arange(24).reshape(2,3,4)
+    >>> a[:,0,1] = np.ma.masked
+    >>> a[:,1,:] = np.ma.masked
+    >>> a
+    masked_array(
+      data=[[[0, --, 2, 3],
+             [--, --, --, --],
+             [8, 9, 10, 11]],
+            [[12, --, 14, 15],
+             [--, --, --, --],
+             [20, 21, 22, 23]]],
+      mask=[[[False,  True, False, False],
+             [ True,  True,  True,  True],
+             [False, False, False, False]],
+            [[False,  True, False, False],
+             [ True,  True,  True,  True],
+             [False, False, False, False]]],
+      fill_value=999999)
+    >>> np.ma.apply_over_axes(np.ma.sum, a, [0,2])
+    masked_array(
+      data=[[[46],
+             [--],
+             [124]]],
+      mask=[[[False],
+             [ True],
+             [False]]],
+      fill_value=999999)
+
+    Tuple axis arguments to ufuncs are equivalent:
+
+    >>> np.ma.sum(a, axis=(0,2)).reshape((1,-1,1))
+    masked_array(
+      data=[[[46],
+             [--],
+             [124]]],
+      mask=[[[False],
+             [ True],
+             [False]]],
+      fill_value=999999)
+    """
+
+
+def average(a, axis=None, weights=None, returned=False):
+    """
+    Return the weighted average of array over the given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        Data to be averaged.
+        Masked entries are not taken into account in the computation.
+    axis : int, optional
+        Axis along which to average `a`. If None, averaging is done over
+        the flattened array.
+    weights : array_like, optional
+        The importance that each element has in the computation of the average.
+        The weights array can either be 1-D (in which case its length must be
+        the size of `a` along the given axis) or of the same shape as `a`.
+        If ``weights=None``, then all data in `a` are assumed to have a
+        weight equal to one.  The 1-D calculation is::
+
+            avg = sum(a * weights) / sum(weights)
+
+        The only constraint on `weights` is that `sum(weights)` must not be 0.
+    returned : bool, optional
+        Flag indicating whether a tuple ``(result, sum of weights)``
+        should be returned as output (True), or just the result (False).
+        Default is False.
+
+    Returns
+    -------
+    average, [sum_of_weights] : (tuple of) scalar or MaskedArray
+        The average along the specified axis. When returned is `True`,
+        return a tuple with the average as the first element and the sum
+        of the weights as the second element. The return type is `np.float64`
+        if `a` is of integer type and floats smaller than `float64`, or the
+        input data-type, otherwise. If returned, `sum_of_weights` is always
+        `float64`.
+
+    Examples
+    --------
+    >>> a = np.ma.array([1., 2., 3., 4.], mask=[False, False, True, True])
+    >>> np.ma.average(a, weights=[3, 1, 0, 0])
+    1.25
+
+    >>> x = np.ma.arange(6.).reshape(3, 2)
+    >>> x
+    masked_array(
+      data=[[0., 1.],
+            [2., 3.],
+            [4., 5.]],
+      mask=False,
+      fill_value=1e+20)
+    >>> avg, sumweights = np.ma.average(x, axis=0, weights=[1, 2, 3],
+    ...                                 returned=True)
+    >>> avg
+    masked_array(data=[2.6666666666666665, 3.6666666666666665],
+                 mask=[False, False],
+           fill_value=1e+20)
+
+    """
+    a = asarray(a)
+    m = getmask(a)
+
+    # inspired by 'average' in numpy/lib/function_base.py
+
+    if weights is None:
+        avg = a.mean(axis)
+        scl = avg.dtype.type(a.count(axis))
+    else:
+        wgt = np.asanyarray(weights)
+
+        if issubclass(a.dtype.type, (np.integer, np.bool_)):
+            result_dtype = np.result_type(a.dtype, wgt.dtype, 'f8')
+        else:
+            result_dtype = np.result_type(a.dtype, wgt.dtype)
+
+        # Sanity checks
+        if a.shape != wgt.shape:
+            if axis is None:
+                raise TypeError(
+                    "Axis must be specified when shapes of a and weights "
+                    "differ.")
+            if wgt.ndim != 1:
+                raise TypeError(
+                    "1D weights expected when shapes of a and weights differ.")
+            if wgt.shape[0] != a.shape[axis]:
+                raise ValueError(
+                    "Length of weights not compatible with specified axis.")
+
+            # setup wgt to broadcast along axis
+            wgt = np.broadcast_to(wgt, (a.ndim-1)*(1,) + wgt.shape)
+            wgt = wgt.swapaxes(-1, axis)
+
+        if m is not nomask:
+            wgt = wgt*(~a.mask)
+
+        scl = wgt.sum(axis=axis, dtype=result_dtype)
+        avg = np.multiply(a, wgt, dtype=result_dtype).sum(axis)/scl
+
+    if returned:
+        if scl.shape != avg.shape:
+            scl = np.broadcast_to(scl, avg.shape).copy()
+        return avg, scl
+    else:
+        return avg
+
+
+def median(a, axis=None, out=None, overwrite_input=False, keepdims=False):
+    """
+    Compute the median along the specified axis.
+
+    Returns the median of the array elements.
+
+    Parameters
+    ----------
+    a : array_like
+        Input array or object that can be converted to an array.
+    axis : int, optional
+        Axis along which the medians are computed. The default (None) is
+        to compute the median along a flattened version of the array.
+    out : ndarray, optional
+        Alternative output array in which to place the result. It must
+        have the same shape and buffer length as the expected output
+        but the type will be cast if necessary.
+    overwrite_input : bool, optional
+        If True, then allow use of memory of input array (a) for
+        calculations. The input array will be modified by the call to
+        median. This will save memory when you do not need to preserve
+        the contents of the input array. Treat the input as undefined,
+        but it will probably be fully or partially sorted. Default is
+        False. Note that, if `overwrite_input` is True, and the input
+        is not already an `ndarray`, an error will be raised.
+    keepdims : bool, optional
+        If this is set to True, the axes which are reduced are left
+        in the result as dimensions with size one. With this option,
+        the result will broadcast correctly against the input array.
+
+        .. versionadded:: 1.10.0
+
+    Returns
+    -------
+    median : ndarray
+        A new array holding the result is returned unless out is
+        specified, in which case a reference to out is returned.
+        Return data-type is `float64` for integers and floats smaller than
+        `float64`, or the input data-type, otherwise.
+
+    See Also
+    --------
+    mean
+
+    Notes
+    -----
+    Given a vector ``V`` with ``N`` non masked values, the median of ``V``
+    is the middle value of a sorted copy of ``V`` (``Vs``) - i.e.
+    ``Vs[(N-1)/2]``, when ``N`` is odd, or ``{Vs[N/2 - 1] + Vs[N/2]}/2``
+    when ``N`` is even.
+
+    Examples
+    --------
+    >>> x = np.ma.array(np.arange(8), mask=[0]*4 + [1]*4)
+    >>> np.ma.median(x)
+    1.5
+
+    >>> x = np.ma.array(np.arange(10).reshape(2, 5), mask=[0]*6 + [1]*4)
+    >>> np.ma.median(x)
+    2.5
+    >>> np.ma.median(x, axis=-1, overwrite_input=True)
+    masked_array(data=[2.0, 5.0],
+                 mask=[False, False],
+           fill_value=1e+20)
+
+    """
+    if not hasattr(a, 'mask'):
+        m = np.median(getdata(a, subok=True), axis=axis,
+                      out=out, overwrite_input=overwrite_input,
+                      keepdims=keepdims)
+        if isinstance(m, np.ndarray) and 1 <= m.ndim:
+            return masked_array(m, copy=False)
+        else:
+            return m
+
+    r, k = _ureduce(a, func=_median, axis=axis, out=out,
+                    overwrite_input=overwrite_input)
+    if keepdims:
+        return r.reshape(k)
+    else:
+        return r
+
+def _median(a, axis=None, out=None, overwrite_input=False):
+    # when an unmasked NaN is present return it, so we need to sort the NaN
+    # values behind the mask
+    if np.issubdtype(a.dtype, np.inexact):
+        fill_value = np.inf
+    else:
+        fill_value = None
+    if overwrite_input:
+        if axis is None:
+            asorted = a.ravel()
+            asorted.sort(fill_value=fill_value)
+        else:
+            a.sort(axis=axis, fill_value=fill_value)
+            asorted = a
+    else:
+        asorted = sort(a, axis=axis, fill_value=fill_value)
+
+    if axis is None:
+        axis = 0
+    else:
+        axis = normalize_axis_index(axis, asorted.ndim)
+
+    if asorted.shape[axis] == 0:
+        # for empty axis integer indices fail so use slicing to get same result
+        # as median (which is mean of empty slice = nan)
+        indexer = [slice(None)] * asorted.ndim
+        indexer[axis] = slice(0, 0)
+        indexer = tuple(indexer)
+        return np.ma.mean(asorted[indexer], axis=axis, out=out)
+
+    if asorted.ndim == 1:
+        counts = count(asorted)
+        idx, odd = divmod(count(asorted), 2)
+        mid = asorted[idx + odd - 1:idx + 1]
+        if np.issubdtype(asorted.dtype, np.inexact) and asorted.size > 0:
+            # avoid inf / x = masked
+            s = mid.sum(out=out)
+            if not odd:
+                s = np.true_divide(s, 2., casting='safe', out=out)
+            s = np.lib.utils._median_nancheck(asorted, s, axis, out)
+        else:
+            s = mid.mean(out=out)
+
+        # if result is masked either the input contained enough
+        # minimum_fill_value so that it would be the median or all values
+        # masked
+        if np.ma.is_masked(s) and not np.all(asorted.mask):
+            return np.ma.minimum_fill_value(asorted)
+        return s
+
+    counts = count(asorted, axis=axis, keepdims=True)
+    h = counts // 2
+
+    # duplicate high if odd number of elements so mean does nothing
+    odd = counts % 2 == 1
+    l = np.where(odd, h, h-1)
+
+    lh = np.concatenate([l,h], axis=axis)
+
+    # get low and high median
+    low_high = np.take_along_axis(asorted, lh, axis=axis)
+
+    def replace_masked(s):
+        # Replace masked entries with minimum_full_value unless it all values
+        # are masked. This is required as the sort order of values equal or
+        # larger than the fill value is undefined and a valid value placed
+        # elsewhere, e.g. [4, --, inf].
+        if np.ma.is_masked(s):
+            rep = (~np.all(asorted.mask, axis=axis, keepdims=True)) & s.mask
+            s.data[rep] = np.ma.minimum_fill_value(asorted)
+            s.mask[rep] = False
+
+    replace_masked(low_high)
+
+    if np.issubdtype(asorted.dtype, np.inexact):
+        # avoid inf / x = masked
+        s = np.ma.sum(low_high, axis=axis, out=out)
+        np.true_divide(s.data, 2., casting='unsafe', out=s.data)
+
+        s = np.lib.utils._median_nancheck(asorted, s, axis, out)
+    else:
+        s = np.ma.mean(low_high, axis=axis, out=out)
+
+    return s
+
+
+def compress_nd(x, axis=None):
+    """Suppress slices from multiple dimensions which contain masked values.
+
+    Parameters
+    ----------
+    x : array_like, MaskedArray
+        The array to operate on. If not a MaskedArray instance (or if no array
+        elements are masked), `x` is interpreted as a MaskedArray with `mask`
+        set to `nomask`.
+    axis : tuple of ints or int, optional
+        Which dimensions to suppress slices from can be configured with this
+        parameter.
+        - If axis is a tuple of ints, those are the axes to suppress slices from.
+        - If axis is an int, then that is the only axis to suppress slices from.
+        - If axis is None, all axis are selected.
+
+    Returns
+    -------
+    compress_array : ndarray
+        The compressed array.
+    """
+    x = asarray(x)
+    m = getmask(x)
+    # Set axis to tuple of ints
+    if axis is None:
+        axis = tuple(range(x.ndim))
+    else:
+        axis = normalize_axis_tuple(axis, x.ndim)
+
+    # Nothing is masked: return x
+    if m is nomask or not m.any():
+        return x._data
+    # All is masked: return empty
+    if m.all():
+        return nxarray([])
+    # Filter elements through boolean indexing
+    data = x._data
+    for ax in axis:
+        axes = tuple(list(range(ax)) + list(range(ax + 1, x.ndim)))
+        data = data[(slice(None),)*ax + (~m.any(axis=axes),)]
+    return data
+
+def compress_rowcols(x, axis=None):
+    """
+    Suppress the rows and/or columns of a 2-D array that contain
+    masked values.
+
+    The suppression behavior is selected with the `axis` parameter.
+
+    - If axis is None, both rows and columns are suppressed.
+    - If axis is 0, only rows are suppressed.
+    - If axis is 1 or -1, only columns are suppressed.
+
+    Parameters
+    ----------
+    x : array_like, MaskedArray
+        The array to operate on.  If not a MaskedArray instance (or if no array
+        elements are masked), `x` is interpreted as a MaskedArray with
+        `mask` set to `nomask`. Must be a 2D array.
+    axis : int, optional
+        Axis along which to perform the operation. Default is None.
+
+    Returns
+    -------
+    compressed_array : ndarray
+        The compressed array.
+
+    Examples
+    --------
+    >>> x = np.ma.array(np.arange(9).reshape(3, 3), mask=[[1, 0, 0],
+    ...                                                   [1, 0, 0],
+    ...                                                   [0, 0, 0]])
+    >>> x
+    masked_array(
+      data=[[--, 1, 2],
+            [--, 4, 5],
+            [6, 7, 8]],
+      mask=[[ True, False, False],
+            [ True, False, False],
+            [False, False, False]],
+      fill_value=999999)
+
+    >>> np.ma.compress_rowcols(x)
+    array([[7, 8]])
+    >>> np.ma.compress_rowcols(x, 0)
+    array([[6, 7, 8]])
+    >>> np.ma.compress_rowcols(x, 1)
+    array([[1, 2],
+           [4, 5],
+           [7, 8]])
+
+    """
+    if asarray(x).ndim != 2:
+        raise NotImplementedError("compress_rowcols works for 2D arrays only.")
+    return compress_nd(x, axis=axis)
+
+
+def compress_rows(a):
+    """
+    Suppress whole rows of a 2-D array that contain masked values.
+
+    This is equivalent to ``np.ma.compress_rowcols(a, 0)``, see
+    `extras.compress_rowcols` for details.
+
+    See Also
+    --------
+    extras.compress_rowcols
+
+    """
+    a = asarray(a)
+    if a.ndim != 2:
+        raise NotImplementedError("compress_rows works for 2D arrays only.")
+    return compress_rowcols(a, 0)
+
+def compress_cols(a):
+    """
+    Suppress whole columns of a 2-D array that contain masked values.
+
+    This is equivalent to ``np.ma.compress_rowcols(a, 1)``, see
+    `extras.compress_rowcols` for details.
+
+    See Also
+    --------
+    extras.compress_rowcols
+
+    """
+    a = asarray(a)
+    if a.ndim != 2:
+        raise NotImplementedError("compress_cols works for 2D arrays only.")
+    return compress_rowcols(a, 1)
+
+def mask_rows(a, axis=np._NoValue):
+    """
+    Mask rows of a 2D array that contain masked values.
+
+    This function is a shortcut to ``mask_rowcols`` with `axis` equal to 0.
+
+    See Also
+    --------
+    mask_rowcols : Mask rows and/or columns of a 2D array.
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.zeros((3, 3), dtype=int)
+    >>> a[1, 1] = 1
+    >>> a
+    array([[0, 0, 0],
+           [0, 1, 0],
+           [0, 0, 0]])
+    >>> a = ma.masked_equal(a, 1)
+    >>> a
+    masked_array(
+      data=[[0, 0, 0],
+            [0, --, 0],
+            [0, 0, 0]],
+      mask=[[False, False, False],
+            [False,  True, False],
+            [False, False, False]],
+      fill_value=1)
+
+    >>> ma.mask_rows(a)
+    masked_array(
+      data=[[0, 0, 0],
+            [--, --, --],
+            [0, 0, 0]],
+      mask=[[False, False, False],
+            [ True,  True,  True],
+            [False, False, False]],
+      fill_value=1)
+
+    """
+    if axis is not np._NoValue:
+        # remove the axis argument when this deprecation expires
+        # NumPy 1.18.0, 2019-11-28
+        warnings.warn(
+            "The axis argument has always been ignored, in future passing it "
+            "will raise TypeError", DeprecationWarning, stacklevel=2)
+    return mask_rowcols(a, 0)
+
+def mask_cols(a, axis=np._NoValue):
+    """
+    Mask columns of a 2D array that contain masked values.
+
+    This function is a shortcut to ``mask_rowcols`` with `axis` equal to 1.
+
+    See Also
+    --------
+    mask_rowcols : Mask rows and/or columns of a 2D array.
+    masked_where : Mask where a condition is met.
+
+    Examples
+    --------
+    >>> import numpy.ma as ma
+    >>> a = np.zeros((3, 3), dtype=int)
+    >>> a[1, 1] = 1
+    >>> a
+    array([[0, 0, 0],
+           [0, 1, 0],
+           [0, 0, 0]])
+    >>> a = ma.masked_equal(a, 1)
+    >>> a
+    masked_array(
+      data=[[0, 0, 0],
+            [0, --, 0],
+            [0, 0, 0]],
+      mask=[[False, False, False],
+            [False,  True, False],
+            [False, False, False]],
+      fill_value=1)
+    >>> ma.mask_cols(a)
+    masked_array(
+      data=[[0, --, 0],
+            [0, --, 0],
+            [0, --, 0]],
+      mask=[[False,  True, False],
+            [False,  True, False],
+            [False,  True, False]],
+      fill_value=1)
+
+    """
+    if axis is not np._NoValue:
+        # remove the axis argument when this deprecation expires
+        # NumPy 1.18.0, 2019-11-28
+        warnings.warn(
+            "The axis argument has always been ignored, in future passing it "
+            "will raise TypeError", DeprecationWarning, stacklevel=2)
+    return mask_rowcols(a, 1)
+
+
+#####--------------------------------------------------------------------------
+#---- --- arraysetops ---
+#####--------------------------------------------------------------------------
+
+def ediff1d(arr, to_end=None, to_begin=None):
+    """
+    Compute the differences between consecutive elements of an array.
+
+    This function is the equivalent of `numpy.ediff1d` that takes masked
+    values into account, see `numpy.ediff1d` for details.
+
+    See Also
+    --------
+    numpy.ediff1d : Equivalent function for ndarrays.
+
+    """
+    arr = ma.asanyarray(arr).flat
+    ed = arr[1:] - arr[:-1]
+    arrays = [ed]
+    #
+    if to_begin is not None:
+        arrays.insert(0, to_begin)
+    if to_end is not None:
+        arrays.append(to_end)
+    #
+    if len(arrays) != 1:
+        # We'll save ourselves a copy of a potentially large array in the common
+        # case where neither to_begin or to_end was given.
+        ed = hstack(arrays)
+    #
+    return ed
+
+
+def unique(ar1, return_index=False, return_inverse=False):
+    """
+    Finds the unique elements of an array.
+
+    Masked values are considered the same element (masked). The output array
+    is always a masked array. See `numpy.unique` for more details.
+
+    See Also
+    --------
+    numpy.unique : Equivalent function for ndarrays.
+
+    """
+    output = np.unique(ar1,
+                       return_index=return_index,
+                       return_inverse=return_inverse)
+    if isinstance(output, tuple):
+        output = list(output)
+        output[0] = output[0].view(MaskedArray)
+        output = tuple(output)
+    else:
+        output = output.view(MaskedArray)
+    return output
+
+
+def intersect1d(ar1, ar2, assume_unique=False):
+    """
+    Returns the unique elements common to both arrays.
+
+    Masked values are considered equal one to the other.
+    The output is always a masked array.
+
+    See `numpy.intersect1d` for more details.
+
+    See Also
+    --------
+    numpy.intersect1d : Equivalent function for ndarrays.
+
+    Examples
+    --------
+    >>> x = np.ma.array([1, 3, 3, 3], mask=[0, 0, 0, 1])
+    >>> y = np.ma.array([3, 1, 1, 1], mask=[0, 0, 0, 1])
+    >>> np.ma.intersect1d(x, y)
+    masked_array(data=[1, 3, --],
+                 mask=[False, False,  True],
+           fill_value=999999)
+
+    """
+    if assume_unique:
+        aux = ma.concatenate((ar1, ar2))
+    else:
+        # Might be faster than unique( intersect1d( ar1, ar2 ) )?
+        aux = ma.concatenate((unique(ar1), unique(ar2)))
+    aux.sort()
+    return aux[:-1][aux[1:] == aux[:-1]]
+
+
+def setxor1d(ar1, ar2, assume_unique=False):
+    """
+    Set exclusive-or of 1-D arrays with unique elements.
+
+    The output is always a masked array. See `numpy.setxor1d` for more details.
+
+    See Also
+    --------
+    numpy.setxor1d : Equivalent function for ndarrays.
+
+    """
+    if not assume_unique:
+        ar1 = unique(ar1)
+        ar2 = unique(ar2)
+
+    aux = ma.concatenate((ar1, ar2))
+    if aux.size == 0:
+        return aux
+    aux.sort()
+    auxf = aux.filled()
+#    flag = ediff1d( aux, to_end = 1, to_begin = 1 ) == 0
+    flag = ma.concatenate(([True], (auxf[1:] != auxf[:-1]), [True]))
+#    flag2 = ediff1d( flag ) == 0
+    flag2 = (flag[1:] == flag[:-1])
+    return aux[flag2]
+
+
+def in1d(ar1, ar2, assume_unique=False, invert=False):
+    """
+    Test whether each element of an array is also present in a second
+    array.
+
+    The output is always a masked array. See `numpy.in1d` for more details.
+
+    We recommend using :func:`isin` instead of `in1d` for new code.
+
+    See Also
+    --------
+    isin       : Version of this function that preserves the shape of ar1.
+    numpy.in1d : Equivalent function for ndarrays.
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    """
+    if not assume_unique:
+        ar1, rev_idx = unique(ar1, return_inverse=True)
+        ar2 = unique(ar2)
+
+    ar = ma.concatenate((ar1, ar2))
+    # We need this to be a stable sort, so always use 'mergesort'
+    # here. The values from the first array should always come before
+    # the values from the second array.
+    order = ar.argsort(kind='mergesort')
+    sar = ar[order]
+    if invert:
+        bool_ar = (sar[1:] != sar[:-1])
+    else:
+        bool_ar = (sar[1:] == sar[:-1])
+    flag = ma.concatenate((bool_ar, [invert]))
+    indx = order.argsort(kind='mergesort')[:len(ar1)]
+
+    if assume_unique:
+        return flag[indx]
+    else:
+        return flag[indx][rev_idx]
+
+
+def isin(element, test_elements, assume_unique=False, invert=False):
+    """
+    Calculates `element in test_elements`, broadcasting over
+    `element` only.
+
+    The output is always a masked array of the same shape as `element`.
+    See `numpy.isin` for more details.
+
+    See Also
+    --------
+    in1d       : Flattened version of this function.
+    numpy.isin : Equivalent function for ndarrays.
+
+    Notes
+    -----
+    .. versionadded:: 1.13.0
+
+    """
+    element = ma.asarray(element)
+    return in1d(element, test_elements, assume_unique=assume_unique,
+                invert=invert).reshape(element.shape)
+
+
+def union1d(ar1, ar2):
+    """
+    Union of two arrays.
+
+    The output is always a masked array. See `numpy.union1d` for more details.
+
+    See also
+    --------
+    numpy.union1d : Equivalent function for ndarrays.
+
+    """
+    return unique(ma.concatenate((ar1, ar2), axis=None))
+
+
+def setdiff1d(ar1, ar2, assume_unique=False):
+    """
+    Set difference of 1D arrays with unique elements.
+
+    The output is always a masked array. See `numpy.setdiff1d` for more
+    details.
+
+    See Also
+    --------
+    numpy.setdiff1d : Equivalent function for ndarrays.
+
+    Examples
+    --------
+    >>> x = np.ma.array([1, 2, 3, 4], mask=[0, 1, 0, 1])
+    >>> np.ma.setdiff1d(x, [1, 2])
+    masked_array(data=[3, --],
+                 mask=[False,  True],
+           fill_value=999999)
+
+    """
+    if assume_unique:
+        ar1 = ma.asarray(ar1).ravel()
+    else:
+        ar1 = unique(ar1)
+        ar2 = unique(ar2)
+    return ar1[in1d(ar1, ar2, assume_unique=True, invert=True)]
+
+
+###############################################################################
+#                                Covariance                                   #
+###############################################################################
+
+
+def _covhelper(x, y=None, rowvar=True, allow_masked=True):
+    """
+    Private function for the computation of covariance and correlation
+    coefficients.
+
+    """
+    x = ma.array(x, ndmin=2, copy=True, dtype=float)
+    xmask = ma.getmaskarray(x)
+    # Quick exit if we can't process masked data
+    if not allow_masked and xmask.any():
+        raise ValueError("Cannot process masked data.")
+    #
+    if x.shape[0] == 1:
+        rowvar = True
+    # Make sure that rowvar is either 0 or 1
+    rowvar = int(bool(rowvar))
+    axis = 1 - rowvar
+    if rowvar:
+        tup = (slice(None), None)
+    else:
+        tup = (None, slice(None))
+    #
+    if y is None:
+        xnotmask = np.logical_not(xmask).astype(int)
+    else:
+        y = array(y, copy=False, ndmin=2, dtype=float)
+        ymask = ma.getmaskarray(y)
+        if not allow_masked and ymask.any():
+            raise ValueError("Cannot process masked data.")
+        if xmask.any() or ymask.any():
+            if y.shape == x.shape:
+                # Define some common mask
+                common_mask = np.logical_or(xmask, ymask)
+                if common_mask is not nomask:
+                    xmask = x._mask = y._mask = ymask = common_mask
+                    x._sharedmask = False
+                    y._sharedmask = False
+        x = ma.concatenate((x, y), axis)
+        xnotmask = np.logical_not(np.concatenate((xmask, ymask), axis)).astype(int)
+    x -= x.mean(axis=rowvar)[tup]
+    return (x, xnotmask, rowvar)
+
+
+def cov(x, y=None, rowvar=True, bias=False, allow_masked=True, ddof=None):
+    """
+    Estimate the covariance matrix.
+
+    Except for the handling of missing data this function does the same as
+    `numpy.cov`. For more details and examples, see `numpy.cov`.
+
+    By default, masked values are recognized as such. If `x` and `y` have the
+    same shape, a common mask is allocated: if ``x[i,j]`` is masked, then
+    ``y[i,j]`` will also be masked.
+    Setting `allow_masked` to False will raise an exception if values are
+    missing in either of the input arrays.
+
+    Parameters
+    ----------
+    x : array_like
+        A 1-D or 2-D array containing multiple variables and observations.
+        Each row of `x` represents a variable, and each column a single
+        observation of all those variables. Also see `rowvar` below.
+    y : array_like, optional
+        An additional set of variables and observations. `y` has the same
+        form as `x`.
+    rowvar : bool, optional
+        If `rowvar` is True (default), then each row represents a
+        variable, with observations in the columns. Otherwise, the relationship
+        is transposed: each column represents a variable, while the rows
+        contain observations.
+    bias : bool, optional
+        Default normalization (False) is by ``(N-1)``, where ``N`` is the
+        number of observations given (unbiased estimate). If `bias` is True,
+        then normalization is by ``N``. This keyword can be overridden by
+        the keyword ``ddof`` in numpy versions >= 1.5.
+    allow_masked : bool, optional
+        If True, masked values are propagated pair-wise: if a value is masked
+        in `x`, the corresponding value is masked in `y`.
+        If False, raises a `ValueError` exception when some values are missing.
+    ddof : {None, int}, optional
+        If not ``None`` normalization is by ``(N - ddof)``, where ``N`` is
+        the number of observations; this overrides the value implied by
+        ``bias``. The default value is ``None``.
+
+        .. versionadded:: 1.5
+
+    Raises
+    ------
+    ValueError
+        Raised if some values are missing and `allow_masked` is False.
+
+    See Also
+    --------
+    numpy.cov
+
+    """
+    # Check inputs
+    if ddof is not None and ddof != int(ddof):
+        raise ValueError("ddof must be an integer")
+    # Set up ddof
+    if ddof is None:
+        if bias:
+            ddof = 0
+        else:
+            ddof = 1
+
+    (x, xnotmask, rowvar) = _covhelper(x, y, rowvar, allow_masked)
+    if not rowvar:
+        fact = np.dot(xnotmask.T, xnotmask) * 1. - ddof
+        result = (dot(x.T, x.conj(), strict=False) / fact).squeeze()
+    else:
+        fact = np.dot(xnotmask, xnotmask.T) * 1. - ddof
+        result = (dot(x, x.T.conj(), strict=False) / fact).squeeze()
+    return result
+
+
+def corrcoef(x, y=None, rowvar=True, bias=np._NoValue, allow_masked=True,
+             ddof=np._NoValue):
+    """
+    Return Pearson product-moment correlation coefficients.
+
+    Except for the handling of missing data this function does the same as
+    `numpy.corrcoef`. For more details and examples, see `numpy.corrcoef`.
+
+    Parameters
+    ----------
+    x : array_like
+        A 1-D or 2-D array containing multiple variables and observations.
+        Each row of `x` represents a variable, and each column a single
+        observation of all those variables. Also see `rowvar` below.
+    y : array_like, optional
+        An additional set of variables and observations. `y` has the same
+        shape as `x`.
+    rowvar : bool, optional
+        If `rowvar` is True (default), then each row represents a
+        variable, with observations in the columns. Otherwise, the relationship
+        is transposed: each column represents a variable, while the rows
+        contain observations.
+    bias : _NoValue, optional
+        Has no effect, do not use.
+
+        .. deprecated:: 1.10.0
+    allow_masked : bool, optional
+        If True, masked values are propagated pair-wise: if a value is masked
+        in `x`, the corresponding value is masked in `y`.
+        If False, raises an exception.  Because `bias` is deprecated, this
+        argument needs to be treated as keyword only to avoid a warning.
+    ddof : _NoValue, optional
+        Has no effect, do not use.
+
+        .. deprecated:: 1.10.0
+
+    See Also
+    --------
+    numpy.corrcoef : Equivalent function in top-level NumPy module.
+    cov : Estimate the covariance matrix.
+
+    Notes
+    -----
+    This function accepts but discards arguments `bias` and `ddof`.  This is
+    for backwards compatibility with previous versions of this function.  These
+    arguments had no effect on the return values of the function and can be
+    safely ignored in this and previous versions of numpy.
+    """
+    msg = 'bias and ddof have no effect and are deprecated'
+    if bias is not np._NoValue or ddof is not np._NoValue:
+        # 2015-03-15, 1.10
+        warnings.warn(msg, DeprecationWarning, stacklevel=2)
+    # Get the data
+    (x, xnotmask, rowvar) = _covhelper(x, y, rowvar, allow_masked)
+    # Compute the covariance matrix
+    if not rowvar:
+        fact = np.dot(xnotmask.T, xnotmask) * 1.
+        c = (dot(x.T, x.conj(), strict=False) / fact).squeeze()
+    else:
+        fact = np.dot(xnotmask, xnotmask.T) * 1.
+        c = (dot(x, x.T.conj(), strict=False) / fact).squeeze()
+    # Check whether we have a scalar
+    try:
+        diag = ma.diagonal(c)
+    except ValueError:
+        return 1
+    #
+    if xnotmask.all():
+        _denom = ma.sqrt(ma.multiply.outer(diag, diag))
+    else:
+        _denom = diagflat(diag)
+        _denom._sharedmask = False  # We know return is always a copy
+        n = x.shape[1 - rowvar]
+        if rowvar:
+            for i in range(n - 1):
+                for j in range(i + 1, n):
+                    _x = mask_cols(vstack((x[i], x[j]))).var(axis=1)
+                    _denom[i, j] = _denom[j, i] = ma.sqrt(ma.multiply.reduce(_x))
+        else:
+            for i in range(n - 1):
+                for j in range(i + 1, n):
+                    _x = mask_cols(
+                            vstack((x[:, i], x[:, j]))).var(axis=1)
+                    _denom[i, j] = _denom[j, i] = ma.sqrt(ma.multiply.reduce(_x))
+    return c / _denom
+
+#####--------------------------------------------------------------------------
+#---- --- Concatenation helpers ---
+#####--------------------------------------------------------------------------
+
+class MAxisConcatenator(AxisConcatenator):
+    """
+    Translate slice objects to concatenation along an axis.
+
+    For documentation on usage, see `mr_class`.
+
+    See Also
+    --------
+    mr_class
+
+    """
+    concatenate = staticmethod(concatenate)
+
+    @classmethod
+    def makemat(cls, arr):
+        # There used to be a view as np.matrix here, but we may eventually
+        # deprecate that class. In preparation, we use the unmasked version
+        # to construct the matrix (with copy=False for backwards compatibility
+        # with the .view)
+        data = super(MAxisConcatenator, cls).makemat(arr.data, copy=False)
+        return array(data, mask=arr.mask)
+
+    def __getitem__(self, key):
+        # matrix builder syntax, like 'a, b; c, d'
+        if isinstance(key, str):
+            raise MAError("Unavailable for masked array.")
+
+        return super(MAxisConcatenator, self).__getitem__(key)
+
+
+class mr_class(MAxisConcatenator):
+    """
+    Translate slice objects to concatenation along the first axis.
+
+    This is the masked array version of `lib.index_tricks.RClass`.
+
+    See Also
+    --------
+    lib.index_tricks.RClass
+
+    Examples
+    --------
+    >>> np.ma.mr_[np.ma.array([1,2,3]), 0, 0, np.ma.array([4,5,6])]
+    masked_array(data=[1, 2, 3, ..., 4, 5, 6],
+                 mask=False,
+           fill_value=999999)
+
+    """
+    def __init__(self):
+        MAxisConcatenator.__init__(self, 0)
+
+mr_ = mr_class()
+
+#####--------------------------------------------------------------------------
+#---- Find unmasked data ---
+#####--------------------------------------------------------------------------
+
+def flatnotmasked_edges(a):
+    """
+    Find the indices of the first and last unmasked values.
+
+    Expects a 1-D `MaskedArray`, returns None if all values are masked.
+
+    Parameters
+    ----------
+    a : array_like
+        Input 1-D `MaskedArray`
+
+    Returns
+    -------
+    edges : ndarray or None
+        The indices of first and last non-masked value in the array.
+        Returns None if all values are masked.
+
+    See Also
+    --------
+    flatnotmasked_contiguous, notmasked_contiguous, notmasked_edges
+    clump_masked, clump_unmasked
+
+    Notes
+    -----
+    Only accepts 1-D arrays.
+
+    Examples
+    --------
+    >>> a = np.ma.arange(10)
+    >>> np.ma.flatnotmasked_edges(a)
+    array([0, 9])
+
+    >>> mask = (a < 3) | (a > 8) | (a == 5)
+    >>> a[mask] = np.ma.masked
+    >>> np.array(a[~a.mask])
+    array([3, 4, 6, 7, 8])
+
+    >>> np.ma.flatnotmasked_edges(a)
+    array([3, 8])
+
+    >>> a[:] = np.ma.masked
+    >>> print(np.ma.flatnotmasked_edges(a))
+    None
+
+    """
+    m = getmask(a)
+    if m is nomask or not np.any(m):
+        return np.array([0, a.size - 1])
+    unmasked = np.flatnonzero(~m)
+    if len(unmasked) > 0:
+        return unmasked[[0, -1]]
+    else:
+        return None
+
+
+def notmasked_edges(a, axis=None):
+    """
+    Find the indices of the first and last unmasked values along an axis.
+
+    If all values are masked, return None.  Otherwise, return a list
+    of two tuples, corresponding to the indices of the first and last
+    unmasked values respectively.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array.
+    axis : int, optional
+        Axis along which to perform the operation.
+        If None (default), applies to a flattened version of the array.
+
+    Returns
+    -------
+    edges : ndarray or list
+        An array of start and end indexes if there are any masked data in
+        the array. If there are no masked data in the array, `edges` is a
+        list of the first and last index.
+
+    See Also
+    --------
+    flatnotmasked_contiguous, flatnotmasked_edges, notmasked_contiguous
+    clump_masked, clump_unmasked
+
+    Examples
+    --------
+    >>> a = np.arange(9).reshape((3, 3))
+    >>> m = np.zeros_like(a)
+    >>> m[1:, 1:] = 1
+
+    >>> am = np.ma.array(a, mask=m)
+    >>> np.array(am[~am.mask])
+    array([0, 1, 2, 3, 6])
+
+    >>> np.ma.notmasked_edges(am)
+    array([0, 6])
+
+    """
+    a = asarray(a)
+    if axis is None or a.ndim == 1:
+        return flatnotmasked_edges(a)
+    m = getmaskarray(a)
+    idx = array(np.indices(a.shape), mask=np.asarray([m] * a.ndim))
+    return [tuple([idx[i].min(axis).compressed() for i in range(a.ndim)]),
+            tuple([idx[i].max(axis).compressed() for i in range(a.ndim)]), ]
+
+
+def flatnotmasked_contiguous(a):
+    """
+    Find contiguous unmasked data in a masked array along the given axis.
+
+    Parameters
+    ----------
+    a : narray
+        The input array.
+
+    Returns
+    -------
+    slice_list : list
+        A sorted sequence of `slice` objects (start index, end index).
+
+        ..versionchanged:: 1.15.0
+            Now returns an empty list instead of None for a fully masked array
+
+    See Also
+    --------
+    flatnotmasked_edges, notmasked_contiguous, notmasked_edges
+    clump_masked, clump_unmasked
+
+    Notes
+    -----
+    Only accepts 2-D arrays at most.
+
+    Examples
+    --------
+    >>> a = np.ma.arange(10)
+    >>> np.ma.flatnotmasked_contiguous(a)
+    [slice(0, 10, None)]
+
+    >>> mask = (a < 3) | (a > 8) | (a == 5)
+    >>> a[mask] = np.ma.masked
+    >>> np.array(a[~a.mask])
+    array([3, 4, 6, 7, 8])
+
+    >>> np.ma.flatnotmasked_contiguous(a)
+    [slice(3, 5, None), slice(6, 9, None)]
+    >>> a[:] = np.ma.masked
+    >>> np.ma.flatnotmasked_contiguous(a)
+    []
+
+    """
+    m = getmask(a)
+    if m is nomask:
+        return [slice(0, a.size)]
+    i = 0
+    result = []
+    for (k, g) in itertools.groupby(m.ravel()):
+        n = len(list(g))
+        if not k:
+            result.append(slice(i, i + n))
+        i += n
+    return result
+
+def notmasked_contiguous(a, axis=None):
+    """
+    Find contiguous unmasked data in a masked array along the given axis.
+
+    Parameters
+    ----------
+    a : array_like
+        The input array.
+    axis : int, optional
+        Axis along which to perform the operation.
+        If None (default), applies to a flattened version of the array, and this
+        is the same as `flatnotmasked_contiguous`.
+
+    Returns
+    -------
+    endpoints : list
+        A list of slices (start and end indexes) of unmasked indexes
+        in the array.
+
+        If the input is 2d and axis is specified, the result is a list of lists.
+
+    See Also
+    --------
+    flatnotmasked_edges, flatnotmasked_contiguous, notmasked_edges
+    clump_masked, clump_unmasked
+
+    Notes
+    -----
+    Only accepts 2-D arrays at most.
+
+    Examples
+    --------
+    >>> a = np.arange(12).reshape((3, 4))
+    >>> mask = np.zeros_like(a)
+    >>> mask[1:, :-1] = 1; mask[0, 1] = 1; mask[-1, 0] = 0
+    >>> ma = np.ma.array(a, mask=mask)
+    >>> ma
+    masked_array(
+      data=[[0, --, 2, 3],
+            [--, --, --, 7],
+            [8, --, --, 11]],
+      mask=[[False,  True, False, False],
+            [ True,  True,  True, False],
+            [False,  True,  True, False]],
+      fill_value=999999)
+    >>> np.array(ma[~ma.mask])
+    array([ 0,  2,  3,  7, 8, 11])
+
+    >>> np.ma.notmasked_contiguous(ma)
+    [slice(0, 1, None), slice(2, 4, None), slice(7, 9, None), slice(11, 12, None)]
+
+    >>> np.ma.notmasked_contiguous(ma, axis=0)
+    [[slice(0, 1, None), slice(2, 3, None)], [], [slice(0, 1, None)], [slice(0, 3, None)]]
+
+    >>> np.ma.notmasked_contiguous(ma, axis=1)
+    [[slice(0, 1, None), slice(2, 4, None)], [slice(3, 4, None)], [slice(0, 1, None), slice(3, 4, None)]]
+
+    """
+    a = asarray(a)
+    nd = a.ndim
+    if nd > 2:
+        raise NotImplementedError("Currently limited to atmost 2D array.")
+    if axis is None or nd == 1:
+        return flatnotmasked_contiguous(a)
+    #
+    result = []
+    #
+    other = (axis + 1) % 2
+    idx = [0, 0]
+    idx[axis] = slice(None, None)
+    #
+    for i in range(a.shape[other]):
+        idx[other] = i
+        result.append(flatnotmasked_contiguous(a[tuple(idx)]))
+    return result
+
+
+def _ezclump(mask):
+    """
+    Finds the clumps (groups of data with the same values) for a 1D bool array.
+
+    Returns a series of slices.
+    """
+    if mask.ndim > 1:
+        mask = mask.ravel()
+    idx = (mask[1:] ^ mask[:-1]).nonzero()
+    idx = idx[0] + 1
+
+    if mask[0]:
+        if len(idx) == 0:
+            return [slice(0, mask.size)]
+
+        r = [slice(0, idx[0])]
+        r.extend((slice(left, right)
+                  for left, right in zip(idx[1:-1:2], idx[2::2])))
+    else:
+        if len(idx) == 0:
+            return []
+
+        r = [slice(left, right) for left, right in zip(idx[:-1:2], idx[1::2])]
+
+    if mask[-1]:
+        r.append(slice(idx[-1], mask.size))
+    return r
+
+
+def clump_unmasked(a):
+    """
+    Return list of slices corresponding to the unmasked clumps of a 1-D array.
+    (A "clump" is defined as a contiguous region of the array).
+
+    Parameters
+    ----------
+    a : ndarray
+        A one-dimensional masked array.
+
+    Returns
+    -------
+    slices : list of slice
+        The list of slices, one for each continuous region of unmasked
+        elements in `a`.
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    See Also
+    --------
+    flatnotmasked_edges, flatnotmasked_contiguous, notmasked_edges
+    notmasked_contiguous, clump_masked
+
+    Examples
+    --------
+    >>> a = np.ma.masked_array(np.arange(10))
+    >>> a[[0, 1, 2, 6, 8, 9]] = np.ma.masked
+    >>> np.ma.clump_unmasked(a)
+    [slice(3, 6, None), slice(7, 8, None)]
+
+    """
+    mask = getattr(a, '_mask', nomask)
+    if mask is nomask:
+        return [slice(0, a.size)]
+    return _ezclump(~mask)
+
+
+def clump_masked(a):
+    """
+    Returns a list of slices corresponding to the masked clumps of a 1-D array.
+    (A "clump" is defined as a contiguous region of the array).
+
+    Parameters
+    ----------
+    a : ndarray
+        A one-dimensional masked array.
+
+    Returns
+    -------
+    slices : list of slice
+        The list of slices, one for each continuous region of masked elements
+        in `a`.
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    See Also
+    --------
+    flatnotmasked_edges, flatnotmasked_contiguous, notmasked_edges
+    notmasked_contiguous, clump_unmasked
+
+    Examples
+    --------
+    >>> a = np.ma.masked_array(np.arange(10))
+    >>> a[[0, 1, 2, 6, 8, 9]] = np.ma.masked
+    >>> np.ma.clump_masked(a)
+    [slice(0, 3, None), slice(6, 7, None), slice(8, 10, None)]
+
+    """
+    mask = ma.getmask(a)
+    if mask is nomask:
+        return []
+    return _ezclump(mask)
+
+
+###############################################################################
+#                              Polynomial fit                                 #
+###############################################################################
+
+
+def vander(x, n=None):
+    """
+    Masked values in the input array result in rows of zeros.
+
+    """
+    _vander = np.vander(x, n)
+    m = getmask(x)
+    if m is not nomask:
+        _vander[m] = 0
+    return _vander
+
+vander.__doc__ = ma.doc_note(np.vander.__doc__, vander.__doc__)
+
+
+def polyfit(x, y, deg, rcond=None, full=False, w=None, cov=False):
+    """
+    Any masked values in x is propagated in y, and vice-versa.
+
+    """
+    x = asarray(x)
+    y = asarray(y)
+
+    m = getmask(x)
+    if y.ndim == 1:
+        m = mask_or(m, getmask(y))
+    elif y.ndim == 2:
+        my = getmask(mask_rows(y))
+        if my is not nomask:
+            m = mask_or(m, my[:, 0])
+    else:
+        raise TypeError("Expected a 1D or 2D array for y!")
+
+    if w is not None:
+        w = asarray(w)
+        if w.ndim != 1:
+            raise TypeError("expected a 1-d array for weights")
+        if w.shape[0] != y.shape[0]:
+            raise TypeError("expected w and y to have the same length")
+        m = mask_or(m, getmask(w))
+
+    if m is not nomask:
+        not_m = ~m
+        if w is not None:
+            w = w[not_m]
+        return np.polyfit(x[not_m], y[not_m], deg, rcond, full, w, cov)
+    else:
+        return np.polyfit(x, y, deg, rcond, full, w, cov)
+
+polyfit.__doc__ = ma.doc_note(np.polyfit.__doc__, polyfit.__doc__)
diff --git a/venv/Lib/site-packages/numpy/ma/mrecords.py b/venv/Lib/site-packages/numpy/ma/mrecords.py
new file mode 100644
index 000000000..cd93a9a14
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/mrecords.py
@@ -0,0 +1,770 @@
+""":mod:`numpy.ma..mrecords`
+
+Defines the equivalent of :class:`numpy.recarrays` for masked arrays,
+where fields can be accessed as attributes.
+Note that :class:`numpy.ma.MaskedArray` already supports structured datatypes
+and the masking of individual fields.
+
+.. moduleauthor:: Pierre Gerard-Marchant
+
+"""
+#  We should make sure that no field is called '_mask','mask','_fieldmask',
+#  or whatever restricted keywords.  An idea would be to no bother in the
+#  first place, and then rename the invalid fields with a trailing
+#  underscore. Maybe we could just overload the parser function ?
+
+import warnings
+
+import numpy as np
+from numpy import (
+        bool_, dtype, ndarray, recarray, array as narray
+        )
+from numpy.core.records import (
+        fromarrays as recfromarrays, fromrecords as recfromrecords
+        )
+
+_byteorderconv = np.core.records._byteorderconv
+
+import numpy.ma as ma
+from numpy.ma import (
+        MAError, MaskedArray, masked, nomask, masked_array, getdata,
+        getmaskarray, filled
+        )
+
+_check_fill_value = ma.core._check_fill_value
+
+
+__all__ = [
+    'MaskedRecords', 'mrecarray', 'fromarrays', 'fromrecords',
+    'fromtextfile', 'addfield',
+    ]
+
+reserved_fields = ['_data', '_mask', '_fieldmask', 'dtype']
+
+
+def _checknames(descr, names=None):
+    """
+    Checks that field names ``descr`` are not reserved keywords.
+
+    If this is the case, a default 'f%i' is substituted.  If the argument
+    `names` is not None, updates the field names to valid names.
+
+    """
+    ndescr = len(descr)
+    default_names = ['f%i' % i for i in range(ndescr)]
+    if names is None:
+        new_names = default_names
+    else:
+        if isinstance(names, (tuple, list)):
+            new_names = names
+        elif isinstance(names, str):
+            new_names = names.split(',')
+        else:
+            raise NameError("illegal input names %s" % repr(names))
+        nnames = len(new_names)
+        if nnames < ndescr:
+            new_names += default_names[nnames:]
+    ndescr = []
+    for (n, d, t) in zip(new_names, default_names, descr.descr):
+        if n in reserved_fields:
+            if t[0] in reserved_fields:
+                ndescr.append((d, t[1]))
+            else:
+                ndescr.append(t)
+        else:
+            ndescr.append((n, t[1]))
+    return np.dtype(ndescr)
+
+
+def _get_fieldmask(self):
+    mdescr = [(n, '|b1') for n in self.dtype.names]
+    fdmask = np.empty(self.shape, dtype=mdescr)
+    fdmask.flat = tuple([False] * len(mdescr))
+    return fdmask
+
+
+class MaskedRecords(MaskedArray):
+    """
+
+    Attributes
+    ----------
+    _data : recarray
+        Underlying data, as a record array.
+    _mask : boolean array
+        Mask of the records. A record is masked when all its fields are
+        masked.
+    _fieldmask : boolean recarray
+        Record array of booleans, setting the mask of each individual field
+        of each record.
+    _fill_value : record
+        Filling values for each field.
+
+    """
+
+    def __new__(cls, shape, dtype=None, buf=None, offset=0, strides=None,
+                formats=None, names=None, titles=None,
+                byteorder=None, aligned=False,
+                mask=nomask, hard_mask=False, fill_value=None, keep_mask=True,
+                copy=False,
+                **options):
+
+        self = recarray.__new__(cls, shape, dtype=dtype, buf=buf, offset=offset,
+                                strides=strides, formats=formats, names=names,
+                                titles=titles, byteorder=byteorder,
+                                aligned=aligned,)
+
+        mdtype = ma.make_mask_descr(self.dtype)
+        if mask is nomask or not np.size(mask):
+            if not keep_mask:
+                self._mask = tuple([False] * len(mdtype))
+        else:
+            mask = np.array(mask, copy=copy)
+            if mask.shape != self.shape:
+                (nd, nm) = (self.size, mask.size)
+                if nm == 1:
+                    mask = np.resize(mask, self.shape)
+                elif nm == nd:
+                    mask = np.reshape(mask, self.shape)
+                else:
+                    msg = "Mask and data not compatible: data size is %i, " + \
+                          "mask size is %i."
+                    raise MAError(msg % (nd, nm))
+                copy = True
+            if not keep_mask:
+                self.__setmask__(mask)
+                self._sharedmask = True
+            else:
+                if mask.dtype == mdtype:
+                    _mask = mask
+                else:
+                    _mask = np.array([tuple([m] * len(mdtype)) for m in mask],
+                                     dtype=mdtype)
+                self._mask = _mask
+        return self
+
+    def __array_finalize__(self, obj):
+        # Make sure we have a _fieldmask by default
+        _mask = getattr(obj, '_mask', None)
+        if _mask is None:
+            objmask = getattr(obj, '_mask', nomask)
+            _dtype = ndarray.__getattribute__(self, 'dtype')
+            if objmask is nomask:
+                _mask = ma.make_mask_none(self.shape, dtype=_dtype)
+            else:
+                mdescr = ma.make_mask_descr(_dtype)
+                _mask = narray([tuple([m] * len(mdescr)) for m in objmask],
+                               dtype=mdescr).view(recarray)
+        # Update some of the attributes
+        _dict = self.__dict__
+        _dict.update(_mask=_mask)
+        self._update_from(obj)
+        if _dict['_baseclass'] == ndarray:
+            _dict['_baseclass'] = recarray
+        return
+
+    @property
+    def _data(self):
+        """
+        Returns the data as a recarray.
+
+        """
+        return ndarray.view(self, recarray)
+
+    @property
+    def _fieldmask(self):
+        """
+        Alias to mask.
+
+        """
+        return self._mask
+
+    def __len__(self):
+        """
+        Returns the length
+
+        """
+        # We have more than one record
+        if self.ndim:
+            return len(self._data)
+        # We have only one record: return the nb of fields
+        return len(self.dtype)
+
+    def __getattribute__(self, attr):
+        try:
+            return object.__getattribute__(self, attr)
+        except AttributeError:
+            # attr must be a fieldname
+            pass
+        fielddict = ndarray.__getattribute__(self, 'dtype').fields
+        try:
+            res = fielddict[attr][:2]
+        except (TypeError, KeyError):
+            raise AttributeError("record array has no attribute %s" % attr)
+        # So far, so good
+        _localdict = ndarray.__getattribute__(self, '__dict__')
+        _data = ndarray.view(self, _localdict['_baseclass'])
+        obj = _data.getfield(*res)
+        if obj.dtype.names is not None:
+            raise NotImplementedError("MaskedRecords is currently limited to"
+                                      "simple records.")
+        # Get some special attributes
+        # Reset the object's mask
+        hasmasked = False
+        _mask = _localdict.get('_mask', None)
+        if _mask is not None:
+            try:
+                _mask = _mask[attr]
+            except IndexError:
+                # Couldn't find a mask: use the default (nomask)
+                pass
+            tp_len = len(_mask.dtype)
+            hasmasked = _mask.view((bool, ((tp_len,) if tp_len else ()))).any()
+        if (obj.shape or hasmasked):
+            obj = obj.view(MaskedArray)
+            obj._baseclass = ndarray
+            obj._isfield = True
+            obj._mask = _mask
+            # Reset the field values
+            _fill_value = _localdict.get('_fill_value', None)
+            if _fill_value is not None:
+                try:
+                    obj._fill_value = _fill_value[attr]
+                except ValueError:
+                    obj._fill_value = None
+        else:
+            obj = obj.item()
+        return obj
+
+    def __setattr__(self, attr, val):
+        """
+        Sets the attribute attr to the value val.
+
+        """
+        # Should we call __setmask__ first ?
+        if attr in ['mask', 'fieldmask']:
+            self.__setmask__(val)
+            return
+        # Create a shortcut (so that we don't have to call getattr all the time)
+        _localdict = object.__getattribute__(self, '__dict__')
+        # Check whether we're creating a new field
+        newattr = attr not in _localdict
+        try:
+            # Is attr a generic attribute ?
+            ret = object.__setattr__(self, attr, val)
+        except Exception:
+            # Not a generic attribute: exit if it's not a valid field
+            fielddict = ndarray.__getattribute__(self, 'dtype').fields or {}
+            optinfo = ndarray.__getattribute__(self, '_optinfo') or {}
+            if not (attr in fielddict or attr in optinfo):
+                raise
+        else:
+            # Get the list of names
+            fielddict = ndarray.__getattribute__(self, 'dtype').fields or {}
+            # Check the attribute
+            if attr not in fielddict:
+                return ret
+            if newattr:
+                # We just added this one or this setattr worked on an
+                # internal attribute.
+                try:
+                    object.__delattr__(self, attr)
+                except Exception:
+                    return ret
+        # Let's try to set the field
+        try:
+            res = fielddict[attr][:2]
+        except (TypeError, KeyError):
+            raise AttributeError("record array has no attribute %s" % attr)
+
+        if val is masked:
+            _fill_value = _localdict['_fill_value']
+            if _fill_value is not None:
+                dval = _localdict['_fill_value'][attr]
+            else:
+                dval = val
+            mval = True
+        else:
+            dval = filled(val)
+            mval = getmaskarray(val)
+        obj = ndarray.__getattribute__(self, '_data').setfield(dval, *res)
+        _localdict['_mask'].__setitem__(attr, mval)
+        return obj
+
+    def __getitem__(self, indx):
+        """
+        Returns all the fields sharing the same fieldname base.
+
+        The fieldname base is either `_data` or `_mask`.
+
+        """
+        _localdict = self.__dict__
+        _mask = ndarray.__getattribute__(self, '_mask')
+        _data = ndarray.view(self, _localdict['_baseclass'])
+        # We want a field
+        if isinstance(indx, str):
+            # Make sure _sharedmask is True to propagate back to _fieldmask
+            # Don't use _set_mask, there are some copies being made that
+            # break propagation Don't force the mask to nomask, that wreaks
+            # easy masking
+            obj = _data[indx].view(MaskedArray)
+            obj._mask = _mask[indx]
+            obj._sharedmask = True
+            fval = _localdict['_fill_value']
+            if fval is not None:
+                obj._fill_value = fval[indx]
+            # Force to masked if the mask is True
+            if not obj.ndim and obj._mask:
+                return masked
+            return obj
+        # We want some elements.
+        # First, the data.
+        obj = np.array(_data[indx], copy=False).view(mrecarray)
+        obj._mask = np.array(_mask[indx], copy=False).view(recarray)
+        return obj
+
+    def __setitem__(self, indx, value):
+        """
+        Sets the given record to value.
+
+        """
+        MaskedArray.__setitem__(self, indx, value)
+        if isinstance(indx, str):
+            self._mask[indx] = ma.getmaskarray(value)
+
+    def __str__(self):
+        """
+        Calculates the string representation.
+
+        """
+        if self.size > 1:
+            mstr = ["(%s)" % ",".join([str(i) for i in s])
+                    for s in zip(*[getattr(self, f) for f in self.dtype.names])]
+            return "[%s]" % ", ".join(mstr)
+        else:
+            mstr = ["%s" % ",".join([str(i) for i in s])
+                    for s in zip([getattr(self, f) for f in self.dtype.names])]
+            return "(%s)" % ", ".join(mstr)
+
+    def __repr__(self):
+        """
+        Calculates the repr representation.
+
+        """
+        _names = self.dtype.names
+        fmt = "%%%is : %%s" % (max([len(n) for n in _names]) + 4,)
+        reprstr = [fmt % (f, getattr(self, f)) for f in self.dtype.names]
+        reprstr.insert(0, 'masked_records(')
+        reprstr.extend([fmt % ('    fill_value', self.fill_value),
+                         '              )'])
+        return str("\n".join(reprstr))
+
+    def view(self, dtype=None, type=None):
+        """
+        Returns a view of the mrecarray.
+
+        """
+        # OK, basic copy-paste from MaskedArray.view.
+        if dtype is None:
+            if type is None:
+                output = ndarray.view(self)
+            else:
+                output = ndarray.view(self, type)
+        # Here again.
+        elif type is None:
+            try:
+                if issubclass(dtype, ndarray):
+                    output = ndarray.view(self, dtype)
+                    dtype = None
+                else:
+                    output = ndarray.view(self, dtype)
+            # OK, there's the change
+            except TypeError:
+                dtype = np.dtype(dtype)
+                # we need to revert to MaskedArray, but keeping the possibility
+                # of subclasses (eg, TimeSeriesRecords), so we'll force a type
+                # set to the first parent
+                if dtype.fields is None:
+                    basetype = self.__class__.__bases__[0]
+                    output = self.__array__().view(dtype, basetype)
+                    output._update_from(self)
+                else:
+                    output = ndarray.view(self, dtype)
+                output._fill_value = None
+        else:
+            output = ndarray.view(self, dtype, type)
+        # Update the mask, just like in MaskedArray.view
+        if (getattr(output, '_mask', nomask) is not nomask):
+            mdtype = ma.make_mask_descr(output.dtype)
+            output._mask = self._mask.view(mdtype, ndarray)
+            output._mask.shape = output.shape
+        return output
+
+    def harden_mask(self):
+        """
+        Forces the mask to hard.
+
+        """
+        self._hardmask = True
+
+    def soften_mask(self):
+        """
+        Forces the mask to soft
+
+        """
+        self._hardmask = False
+
+    def copy(self):
+        """
+        Returns a copy of the masked record.
+
+        """
+        copied = self._data.copy().view(type(self))
+        copied._mask = self._mask.copy()
+        return copied
+
+    def tolist(self, fill_value=None):
+        """
+        Return the data portion of the array as a list.
+
+        Data items are converted to the nearest compatible Python type.
+        Masked values are converted to fill_value. If fill_value is None,
+        the corresponding entries in the output list will be ``None``.
+
+        """
+        if fill_value is not None:
+            return self.filled(fill_value).tolist()
+        result = narray(self.filled().tolist(), dtype=object)
+        mask = narray(self._mask.tolist())
+        result[mask] = None
+        return result.tolist()
+
+    def __getstate__(self):
+        """Return the internal state of the masked array.
+
+        This is for pickling.
+
+        """
+        state = (1,
+                 self.shape,
+                 self.dtype,
+                 self.flags.fnc,
+                 self._data.tobytes(),
+                 self._mask.tobytes(),
+                 self._fill_value,
+                 )
+        return state
+
+    def __setstate__(self, state):
+        """
+        Restore the internal state of the masked array.
+
+        This is for pickling.  ``state`` is typically the output of the
+        ``__getstate__`` output, and is a 5-tuple:
+
+        - class name
+        - a tuple giving the shape of the data
+        - a typecode for the data
+        - a binary string for the data
+        - a binary string for the mask.
+
+        """
+        (ver, shp, typ, isf, raw, msk, flv) = state
+        ndarray.__setstate__(self, (shp, typ, isf, raw))
+        mdtype = dtype([(k, bool_) for (k, _) in self.dtype.descr])
+        self.__dict__['_mask'].__setstate__((shp, mdtype, isf, msk))
+        self.fill_value = flv
+
+    def __reduce__(self):
+        """
+        Return a 3-tuple for pickling a MaskedArray.
+
+        """
+        return (_mrreconstruct,
+                (self.__class__, self._baseclass, (0,), 'b',),
+                self.__getstate__())
+
+def _mrreconstruct(subtype, baseclass, baseshape, basetype,):
+    """
+    Build a new MaskedArray from the information stored in a pickle.
+
+    """
+    _data = ndarray.__new__(baseclass, baseshape, basetype).view(subtype)
+    _mask = ndarray.__new__(ndarray, baseshape, 'b1')
+    return subtype.__new__(subtype, _data, mask=_mask, dtype=basetype,)
+
+mrecarray = MaskedRecords
+
+
+###############################################################################
+#                             Constructors                                    #
+###############################################################################
+
+
+def fromarrays(arraylist, dtype=None, shape=None, formats=None,
+               names=None, titles=None, aligned=False, byteorder=None,
+               fill_value=None):
+    """
+    Creates a mrecarray from a (flat) list of masked arrays.
+
+    Parameters
+    ----------
+    arraylist : sequence
+        A list of (masked) arrays. Each element of the sequence is first converted
+        to a masked array if needed. If a 2D array is passed as argument, it is
+        processed line by line
+    dtype : {None, dtype}, optional
+        Data type descriptor.
+    shape : {None, integer}, optional
+        Number of records. If None, shape is defined from the shape of the
+        first array in the list.
+    formats : {None, sequence}, optional
+        Sequence of formats for each individual field. If None, the formats will
+        be autodetected by inspecting the fields and selecting the highest dtype
+        possible.
+    names : {None, sequence}, optional
+        Sequence of the names of each field.
+    fill_value : {None, sequence}, optional
+        Sequence of data to be used as filling values.
+
+    Notes
+    -----
+    Lists of tuples should be preferred over lists of lists for faster processing.
+
+    """
+    datalist = [getdata(x) for x in arraylist]
+    masklist = [np.atleast_1d(getmaskarray(x)) for x in arraylist]
+    _array = recfromarrays(datalist,
+                           dtype=dtype, shape=shape, formats=formats,
+                           names=names, titles=titles, aligned=aligned,
+                           byteorder=byteorder).view(mrecarray)
+    _array._mask.flat = list(zip(*masklist))
+    if fill_value is not None:
+        _array.fill_value = fill_value
+    return _array
+
+
+def fromrecords(reclist, dtype=None, shape=None, formats=None, names=None,
+                titles=None, aligned=False, byteorder=None,
+                fill_value=None, mask=nomask):
+    """
+    Creates a MaskedRecords from a list of records.
+
+    Parameters
+    ----------
+    reclist : sequence
+        A list of records. Each element of the sequence is first converted
+        to a masked array if needed. If a 2D array is passed as argument, it is
+        processed line by line
+    dtype : {None, dtype}, optional
+        Data type descriptor.
+    shape : {None,int}, optional
+        Number of records. If None, ``shape`` is defined from the shape of the
+        first array in the list.
+    formats : {None, sequence}, optional
+        Sequence of formats for each individual field. If None, the formats will
+        be autodetected by inspecting the fields and selecting the highest dtype
+        possible.
+    names : {None, sequence}, optional
+        Sequence of the names of each field.
+    fill_value : {None, sequence}, optional
+        Sequence of data to be used as filling values.
+    mask : {nomask, sequence}, optional.
+        External mask to apply on the data.
+
+    Notes
+    -----
+    Lists of tuples should be preferred over lists of lists for faster processing.
+
+    """
+    # Grab the initial _fieldmask, if needed:
+    _mask = getattr(reclist, '_mask', None)
+    # Get the list of records.
+    if isinstance(reclist, ndarray):
+        # Make sure we don't have some hidden mask
+        if isinstance(reclist, MaskedArray):
+            reclist = reclist.filled().view(ndarray)
+        # Grab the initial dtype, just in case
+        if dtype is None:
+            dtype = reclist.dtype
+        reclist = reclist.tolist()
+    mrec = recfromrecords(reclist, dtype=dtype, shape=shape, formats=formats,
+                          names=names, titles=titles,
+                          aligned=aligned, byteorder=byteorder).view(mrecarray)
+    # Set the fill_value if needed
+    if fill_value is not None:
+        mrec.fill_value = fill_value
+    # Now, let's deal w/ the mask
+    if mask is not nomask:
+        mask = np.array(mask, copy=False)
+        maskrecordlength = len(mask.dtype)
+        if maskrecordlength:
+            mrec._mask.flat = mask
+        elif mask.ndim == 2:
+            mrec._mask.flat = [tuple(m) for m in mask]
+        else:
+            mrec.__setmask__(mask)
+    if _mask is not None:
+        mrec._mask[:] = _mask
+    return mrec
+
+
+def _guessvartypes(arr):
+    """
+    Tries to guess the dtypes of the str_ ndarray `arr`.
+
+    Guesses by testing element-wise conversion. Returns a list of dtypes.
+    The array is first converted to ndarray. If the array is 2D, the test
+    is performed on the first line. An exception is raised if the file is
+    3D or more.
+
+    """
+    vartypes = []
+    arr = np.asarray(arr)
+    if arr.ndim == 2:
+        arr = arr[0]
+    elif arr.ndim > 2:
+        raise ValueError("The array should be 2D at most!")
+    # Start the conversion loop.
+    for f in arr:
+        try:
+            int(f)
+        except (ValueError, TypeError):
+            try:
+                float(f)
+            except (ValueError, TypeError):
+                try:
+                    complex(f)
+                except (ValueError, TypeError):
+                    vartypes.append(arr.dtype)
+                else:
+                    vartypes.append(np.dtype(complex))
+            else:
+                vartypes.append(np.dtype(float))
+        else:
+            vartypes.append(np.dtype(int))
+    return vartypes
+
+
+def openfile(fname):
+    """
+    Opens the file handle of file `fname`.
+
+    """
+    # A file handle
+    if hasattr(fname, 'readline'):
+        return fname
+    # Try to open the file and guess its type
+    try:
+        f = open(fname)
+    except IOError:
+        raise IOError("No such file: '%s'" % fname)
+    if f.readline()[:2] != "\\x":
+        f.seek(0, 0)
+        return f
+    f.close()
+    raise NotImplementedError("Wow, binary file")
+
+
+def fromtextfile(fname, delimitor=None, commentchar='#', missingchar='',
+                 varnames=None, vartypes=None):
+    """
+    Creates a mrecarray from data stored in the file `filename`.
+
+    Parameters
+    ----------
+    fname : {file name/handle}
+        Handle of an opened file.
+    delimitor : {None, string}, optional
+        Alphanumeric character used to separate columns in the file.
+        If None, any (group of) white spacestring(s) will be used.
+    commentchar : {'#', string}, optional
+        Alphanumeric character used to mark the start of a comment.
+    missingchar : {'', string}, optional
+        String indicating missing data, and used to create the masks.
+    varnames : {None, sequence}, optional
+        Sequence of the variable names. If None, a list will be created from
+        the first non empty line of the file.
+    vartypes : {None, sequence}, optional
+        Sequence of the variables dtypes. If None, it will be estimated from
+        the first non-commented line.
+
+
+    Ultra simple: the varnames are in the header, one line"""
+    # Try to open the file.
+    ftext = openfile(fname)
+
+    # Get the first non-empty line as the varnames
+    while True:
+        line = ftext.readline()
+        firstline = line[:line.find(commentchar)].strip()
+        _varnames = firstline.split(delimitor)
+        if len(_varnames) > 1:
+            break
+    if varnames is None:
+        varnames = _varnames
+
+    # Get the data.
+    _variables = masked_array([line.strip().split(delimitor) for line in ftext
+                               if line[0] != commentchar and len(line) > 1])
+    (_, nfields) = _variables.shape
+    ftext.close()
+
+    # Try to guess the dtype.
+    if vartypes is None:
+        vartypes = _guessvartypes(_variables[0])
+    else:
+        vartypes = [np.dtype(v) for v in vartypes]
+        if len(vartypes) != nfields:
+            msg = "Attempting to %i dtypes for %i fields!"
+            msg += " Reverting to default."
+            warnings.warn(msg % (len(vartypes), nfields), stacklevel=2)
+            vartypes = _guessvartypes(_variables[0])
+
+    # Construct the descriptor.
+    mdescr = [(n, f) for (n, f) in zip(varnames, vartypes)]
+    mfillv = [ma.default_fill_value(f) for f in vartypes]
+
+    # Get the data and the mask.
+    # We just need a list of masked_arrays. It's easier to create it like that:
+    _mask = (_variables.T == missingchar)
+    _datalist = [masked_array(a, mask=m, dtype=t, fill_value=f)
+                 for (a, m, t, f) in zip(_variables.T, _mask, vartypes, mfillv)]
+
+    return fromarrays(_datalist, dtype=mdescr)
+
+
+def addfield(mrecord, newfield, newfieldname=None):
+    """Adds a new field to the masked record array
+
+    Uses `newfield` as data and `newfieldname` as name. If `newfieldname`
+    is None, the new field name is set to 'fi', where `i` is the number of
+    existing fields.
+
+    """
+    _data = mrecord._data
+    _mask = mrecord._mask
+    if newfieldname is None or newfieldname in reserved_fields:
+        newfieldname = 'f%i' % len(_data.dtype)
+    newfield = ma.array(newfield)
+    # Get the new data.
+    # Create a new empty recarray
+    newdtype = np.dtype(_data.dtype.descr + [(newfieldname, newfield.dtype)])
+    newdata = recarray(_data.shape, newdtype)
+    # Add the existing field
+    [newdata.setfield(_data.getfield(*f), *f)
+         for f in _data.dtype.fields.values()]
+    # Add the new field
+    newdata.setfield(newfield._data, *newdata.dtype.fields[newfieldname])
+    newdata = newdata.view(MaskedRecords)
+    # Get the new mask
+    # Create a new empty recarray
+    newmdtype = np.dtype([(n, bool_) for n in newdtype.names])
+    newmask = recarray(_data.shape, newmdtype)
+    # Add the old masks
+    [newmask.setfield(_mask.getfield(*f), *f)
+         for f in _mask.dtype.fields.values()]
+    # Add the mask of the new field
+    newmask.setfield(getmaskarray(newfield),
+                     *newmask.dtype.fields[newfieldname])
+    newdata._mask = newmask
+    return newdata
diff --git a/venv/Lib/site-packages/numpy/ma/setup.py b/venv/Lib/site-packages/numpy/ma/setup.py
new file mode 100644
index 000000000..d3f34c874
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/setup.py
@@ -0,0 +1,11 @@
+#!/usr/bin/env python3
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('ma', parent_package, top_path)
+    config.add_subpackage('tests')
+    return config
+
+if __name__ == "__main__":
+    from numpy.distutils.core import setup
+    config = configuration(top_path='').todict()
+    setup(**config)
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__init__.py b/venv/Lib/site-packages/numpy/ma/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..598450a03
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_core.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_core.cpython-36.pyc
new file mode 100644
index 000000000..862ad1279
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_deprecations.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_deprecations.cpython-36.pyc
new file mode 100644
index 000000000..e9c4b90ae
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_deprecations.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_extras.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_extras.cpython-36.pyc
new file mode 100644
index 000000000..4090c4612
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_extras.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_mrecords.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_mrecords.cpython-36.pyc
new file mode 100644
index 000000000..dc8787e28
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_mrecords.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_old_ma.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_old_ma.cpython-36.pyc
new file mode 100644
index 000000000..af854fe5f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_old_ma.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..b845e7126
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_subclassing.cpython-36.pyc b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_subclassing.cpython-36.pyc
new file mode 100644
index 000000000..3d6b991e9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/ma/tests/__pycache__/test_subclassing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_core.py b/venv/Lib/site-packages/numpy/ma/tests/test_core.py
new file mode 100644
index 000000000..6f34144bb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_core.py
@@ -0,0 +1,5285 @@
+# pylint: disable-msg=W0400,W0511,W0611,W0612,W0614,R0201,E1102
+"""Tests suite for MaskedArray & subclassing.
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+"""
+__author__ = "Pierre GF Gerard-Marchant"
+
+import sys
+import warnings
+import operator
+import itertools
+import textwrap
+import pytest
+
+from functools import reduce
+
+
+import numpy as np
+import numpy.ma.core
+import numpy.core.fromnumeric as fromnumeric
+import numpy.core.umath as umath
+from numpy.testing import (
+    assert_raises, assert_warns, suppress_warnings
+    )
+from numpy import ndarray
+from numpy.compat import asbytes
+from numpy.ma.testutils import (
+    assert_, assert_array_equal, assert_equal, assert_almost_equal,
+    assert_equal_records, fail_if_equal, assert_not_equal,
+    assert_mask_equal
+    )
+from numpy.ma.core import (
+    MAError, MaskError, MaskType, MaskedArray, abs, absolute, add, all,
+    allclose, allequal, alltrue, angle, anom, arange, arccos, arccosh, arctan2,
+    arcsin, arctan, argsort, array, asarray, choose, concatenate,
+    conjugate, cos, cosh, count, default_fill_value, diag, divide, empty,
+    empty_like, equal, exp, flatten_mask, filled, fix_invalid,
+    flatten_structured_array, fromflex, getmask, getmaskarray, greater,
+    greater_equal, identity, inner, isMaskedArray, less, less_equal, log,
+    log10, make_mask, make_mask_descr, mask_or, masked, masked_array,
+    masked_equal, masked_greater, masked_greater_equal, masked_inside,
+    masked_less, masked_less_equal, masked_not_equal, masked_outside,
+    masked_print_option, masked_values, masked_where, max, maximum,
+    maximum_fill_value, min, minimum, minimum_fill_value, mod, multiply,
+    mvoid, nomask, not_equal, ones, outer, power, product, put, putmask,
+    ravel, repeat, reshape, resize, shape, sin, sinh, sometrue, sort, sqrt,
+    subtract, sum, take, tan, tanh, transpose, where, zeros,
+    )
+from numpy.compat import pickle
+
+pi = np.pi
+
+
+suppress_copy_mask_on_assignment = suppress_warnings()
+suppress_copy_mask_on_assignment.filter(
+    numpy.ma.core.MaskedArrayFutureWarning,
+    "setting an item on a masked array which has a shared mask will not copy")
+
+
+# For parametrized numeric testing
+num_dts = [np.dtype(dt_) for dt_ in '?bhilqBHILQefdgFD']
+num_ids = [dt_.char for dt_ in num_dts]
+
+
+class TestMaskedArray:
+    # Base test class for MaskedArrays.
+
+    def setup(self):
+        # Base data definition.
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        a10 = 10.
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = masked_array(x, mask=m1)
+        ym = masked_array(y, mask=m2)
+        z = np.array([-.5, 0., .5, .8])
+        zm = masked_array(z, mask=[0, 1, 0, 0])
+        xf = np.where(m1, 1e+20, x)
+        xm.set_fill_value(1e+20)
+        self.d = (x, y, a10, m1, m2, xm, ym, z, zm, xf)
+
+    def test_basicattributes(self):
+        # Tests some basic array attributes.
+        a = array([1, 3, 2])
+        b = array([1, 3, 2], mask=[1, 0, 1])
+        assert_equal(a.ndim, 1)
+        assert_equal(b.ndim, 1)
+        assert_equal(a.size, 3)
+        assert_equal(b.size, 3)
+        assert_equal(a.shape, (3,))
+        assert_equal(b.shape, (3,))
+
+    def test_basic0d(self):
+        # Checks masking a scalar
+        x = masked_array(0)
+        assert_equal(str(x), '0')
+        x = masked_array(0, mask=True)
+        assert_equal(str(x), str(masked_print_option))
+        x = masked_array(0, mask=False)
+        assert_equal(str(x), '0')
+        x = array(0, mask=1)
+        assert_(x.filled().dtype is x._data.dtype)
+
+    def test_basic1d(self):
+        # Test of basic array creation and properties in 1 dimension.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        assert_(not isMaskedArray(x))
+        assert_(isMaskedArray(xm))
+        assert_((xm - ym).filled(0).any())
+        fail_if_equal(xm.mask.astype(int), ym.mask.astype(int))
+        s = x.shape
+        assert_equal(np.shape(xm), s)
+        assert_equal(xm.shape, s)
+        assert_equal(xm.dtype, x.dtype)
+        assert_equal(zm.dtype, z.dtype)
+        assert_equal(xm.size, reduce(lambda x, y:x * y, s))
+        assert_equal(count(xm), len(m1) - reduce(lambda x, y:x + y, m1))
+        assert_array_equal(xm, xf)
+        assert_array_equal(filled(xm, 1.e20), xf)
+        assert_array_equal(x, xm)
+
+    def test_basic2d(self):
+        # Test of basic array creation and properties in 2 dimensions.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        for s in [(4, 3), (6, 2)]:
+            x.shape = s
+            y.shape = s
+            xm.shape = s
+            ym.shape = s
+            xf.shape = s
+
+            assert_(not isMaskedArray(x))
+            assert_(isMaskedArray(xm))
+            assert_equal(shape(xm), s)
+            assert_equal(xm.shape, s)
+            assert_equal(xm.size, reduce(lambda x, y:x * y, s))
+            assert_equal(count(xm), len(m1) - reduce(lambda x, y:x + y, m1))
+            assert_equal(xm, xf)
+            assert_equal(filled(xm, 1.e20), xf)
+            assert_equal(x, xm)
+
+    def test_concatenate_basic(self):
+        # Tests concatenations.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        # basic concatenation
+        assert_equal(np.concatenate((x, y)), concatenate((xm, ym)))
+        assert_equal(np.concatenate((x, y)), concatenate((x, y)))
+        assert_equal(np.concatenate((x, y)), concatenate((xm, y)))
+        assert_equal(np.concatenate((x, y, x)), concatenate((x, ym, x)))
+
+    def test_concatenate_alongaxis(self):
+        # Tests concatenations.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        # Concatenation along an axis
+        s = (3, 4)
+        x.shape = y.shape = xm.shape = ym.shape = s
+        assert_equal(xm.mask, np.reshape(m1, s))
+        assert_equal(ym.mask, np.reshape(m2, s))
+        xmym = concatenate((xm, ym), 1)
+        assert_equal(np.concatenate((x, y), 1), xmym)
+        assert_equal(np.concatenate((xm.mask, ym.mask), 1), xmym._mask)
+
+        x = zeros(2)
+        y = array(ones(2), mask=[False, True])
+        z = concatenate((x, y))
+        assert_array_equal(z, [0, 0, 1, 1])
+        assert_array_equal(z.mask, [False, False, False, True])
+        z = concatenate((y, x))
+        assert_array_equal(z, [1, 1, 0, 0])
+        assert_array_equal(z.mask, [False, True, False, False])
+
+    def test_concatenate_flexible(self):
+        # Tests the concatenation on flexible arrays.
+        data = masked_array(list(zip(np.random.rand(10),
+                                     np.arange(10))),
+                            dtype=[('a', float), ('b', int)])
+
+        test = concatenate([data[:5], data[5:]])
+        assert_equal_records(test, data)
+
+    def test_creation_ndmin(self):
+        # Check the use of ndmin
+        x = array([1, 2, 3], mask=[1, 0, 0], ndmin=2)
+        assert_equal(x.shape, (1, 3))
+        assert_equal(x._data, [[1, 2, 3]])
+        assert_equal(x._mask, [[1, 0, 0]])
+
+    def test_creation_ndmin_from_maskedarray(self):
+        # Make sure we're not losing the original mask w/ ndmin
+        x = array([1, 2, 3])
+        x[-1] = masked
+        xx = array(x, ndmin=2, dtype=float)
+        assert_equal(x.shape, x._mask.shape)
+        assert_equal(xx.shape, xx._mask.shape)
+
+    def test_creation_maskcreation(self):
+        # Tests how masks are initialized at the creation of Maskedarrays.
+        data = arange(24, dtype=float)
+        data[[3, 6, 15]] = masked
+        dma_1 = MaskedArray(data)
+        assert_equal(dma_1.mask, data.mask)
+        dma_2 = MaskedArray(dma_1)
+        assert_equal(dma_2.mask, dma_1.mask)
+        dma_3 = MaskedArray(dma_1, mask=[1, 0, 0, 0] * 6)
+        fail_if_equal(dma_3.mask, dma_1.mask)
+
+        x = array([1, 2, 3], mask=True)
+        assert_equal(x._mask, [True, True, True])
+        x = array([1, 2, 3], mask=False)
+        assert_equal(x._mask, [False, False, False])
+        y = array([1, 2, 3], mask=x._mask, copy=False)
+        assert_(np.may_share_memory(x.mask, y.mask))
+        y = array([1, 2, 3], mask=x._mask, copy=True)
+        assert_(not np.may_share_memory(x.mask, y.mask))
+
+    def test_creation_with_list_of_maskedarrays(self):
+        # Tests creating a masked array from a list of masked arrays.
+        x = array(np.arange(5), mask=[1, 0, 0, 0, 0])
+        data = array((x, x[::-1]))
+        assert_equal(data, [[0, 1, 2, 3, 4], [4, 3, 2, 1, 0]])
+        assert_equal(data._mask, [[1, 0, 0, 0, 0], [0, 0, 0, 0, 1]])
+
+        x.mask = nomask
+        data = array((x, x[::-1]))
+        assert_equal(data, [[0, 1, 2, 3, 4], [4, 3, 2, 1, 0]])
+        assert_(data.mask is nomask)
+
+    def test_creation_from_ndarray_with_padding(self):
+        x = np.array([('A', 0)], dtype={'names':['f0','f1'],
+                                        'formats':['S4','i8'],
+                                        'offsets':[0,8]})
+        array(x)  # used to fail due to 'V' padding field in x.dtype.descr
+
+    def test_asarray(self):
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        xm.fill_value = -9999
+        xm._hardmask = True
+        xmm = asarray(xm)
+        assert_equal(xmm._data, xm._data)
+        assert_equal(xmm._mask, xm._mask)
+        assert_equal(xmm.fill_value, xm.fill_value)
+        assert_equal(xmm._hardmask, xm._hardmask)
+
+    def test_asarray_default_order(self):
+        # See Issue #6646
+        m = np.eye(3).T
+        assert_(not m.flags.c_contiguous)
+
+        new_m = asarray(m)
+        assert_(new_m.flags.c_contiguous)
+
+    def test_asarray_enforce_order(self):
+        # See Issue #6646
+        m = np.eye(3).T
+        assert_(not m.flags.c_contiguous)
+
+        new_m = asarray(m, order='C')
+        assert_(new_m.flags.c_contiguous)
+
+    def test_fix_invalid(self):
+        # Checks fix_invalid.
+        with np.errstate(invalid='ignore'):
+            data = masked_array([np.nan, 0., 1.], mask=[0, 0, 1])
+            data_fixed = fix_invalid(data)
+            assert_equal(data_fixed._data, [data.fill_value, 0., 1.])
+            assert_equal(data_fixed._mask, [1., 0., 1.])
+
+    def test_maskedelement(self):
+        # Test of masked element
+        x = arange(6)
+        x[1] = masked
+        assert_(str(masked) == '--')
+        assert_(x[1] is masked)
+        assert_equal(filled(x[1], 0), 0)
+
+    def test_set_element_as_object(self):
+        # Tests setting elements with object
+        a = empty(1, dtype=object)
+        x = (1, 2, 3, 4, 5)
+        a[0] = x
+        assert_equal(a[0], x)
+        assert_(a[0] is x)
+
+        import datetime
+        dt = datetime.datetime.now()
+        a[0] = dt
+        assert_(a[0] is dt)
+
+    def test_indexing(self):
+        # Tests conversions and indexing
+        x1 = np.array([1, 2, 4, 3])
+        x2 = array(x1, mask=[1, 0, 0, 0])
+        x3 = array(x1, mask=[0, 1, 0, 1])
+        x4 = array(x1)
+        # test conversion to strings
+        str(x2)  # raises?
+        repr(x2)  # raises?
+        assert_equal(np.sort(x1), sort(x2, endwith=False))
+        # tests of indexing
+        assert_(type(x2[1]) is type(x1[1]))
+        assert_(x1[1] == x2[1])
+        assert_(x2[0] is masked)
+        assert_equal(x1[2], x2[2])
+        assert_equal(x1[2:5], x2[2:5])
+        assert_equal(x1[:], x2[:])
+        assert_equal(x1[1:], x3[1:])
+        x1[2] = 9
+        x2[2] = 9
+        assert_equal(x1, x2)
+        x1[1:3] = 99
+        x2[1:3] = 99
+        assert_equal(x1, x2)
+        x2[1] = masked
+        assert_equal(x1, x2)
+        x2[1:3] = masked
+        assert_equal(x1, x2)
+        x2[:] = x1
+        x2[1] = masked
+        assert_(allequal(getmask(x2), array([0, 1, 0, 0])))
+        x3[:] = masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        assert_(allequal(getmask(x3), array([0, 1, 1, 0])))
+        x4[:] = masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        assert_(allequal(getmask(x4), array([0, 1, 1, 0])))
+        assert_(allequal(x4, array([1, 2, 3, 4])))
+        x1 = np.arange(5) * 1.0
+        x2 = masked_values(x1, 3.0)
+        assert_equal(x1, x2)
+        assert_(allequal(array([0, 0, 0, 1, 0], MaskType), x2.mask))
+        assert_equal(3.0, x2.fill_value)
+        x1 = array([1, 'hello', 2, 3], object)
+        x2 = np.array([1, 'hello', 2, 3], object)
+        s1 = x1[1]
+        s2 = x2[1]
+        assert_equal(type(s2), str)
+        assert_equal(type(s1), str)
+        assert_equal(s1, s2)
+        assert_(x1[1:1].shape == (0,))
+
+    @suppress_copy_mask_on_assignment
+    def test_copy(self):
+        # Tests of some subtle points of copying and sizing.
+        n = [0, 0, 1, 0, 0]
+        m = make_mask(n)
+        m2 = make_mask(m)
+        assert_(m is m2)
+        m3 = make_mask(m, copy=True)
+        assert_(m is not m3)
+
+        x1 = np.arange(5)
+        y1 = array(x1, mask=m)
+        assert_equal(y1._data.__array_interface__, x1.__array_interface__)
+        assert_(allequal(x1, y1.data))
+        assert_equal(y1._mask.__array_interface__, m.__array_interface__)
+
+        y1a = array(y1)
+        # Default for masked array is not to copy; see gh-10318.
+        assert_(y1a._data.__array_interface__ ==
+                        y1._data.__array_interface__)
+        assert_(y1a._mask.__array_interface__ ==
+                        y1._mask.__array_interface__)
+
+        y2 = array(x1, mask=m3)
+        assert_(y2._data.__array_interface__ == x1.__array_interface__)
+        assert_(y2._mask.__array_interface__ == m3.__array_interface__)
+        assert_(y2[2] is masked)
+        y2[2] = 9
+        assert_(y2[2] is not masked)
+        assert_(y2._mask.__array_interface__ == m3.__array_interface__)
+        assert_(allequal(y2.mask, 0))
+
+        y2a = array(x1, mask=m, copy=1)
+        assert_(y2a._data.__array_interface__ != x1.__array_interface__)
+        #assert_( y2a._mask is not m)
+        assert_(y2a._mask.__array_interface__ != m.__array_interface__)
+        assert_(y2a[2] is masked)
+        y2a[2] = 9
+        assert_(y2a[2] is not masked)
+        #assert_( y2a._mask is not m)
+        assert_(y2a._mask.__array_interface__ != m.__array_interface__)
+        assert_(allequal(y2a.mask, 0))
+
+        y3 = array(x1 * 1.0, mask=m)
+        assert_(filled(y3).dtype is (x1 * 1.0).dtype)
+
+        x4 = arange(4)
+        x4[2] = masked
+        y4 = resize(x4, (8,))
+        assert_equal(concatenate([x4, x4]), y4)
+        assert_equal(getmask(y4), [0, 0, 1, 0, 0, 0, 1, 0])
+        y5 = repeat(x4, (2, 2, 2, 2), axis=0)
+        assert_equal(y5, [0, 0, 1, 1, 2, 2, 3, 3])
+        y6 = repeat(x4, 2, axis=0)
+        assert_equal(y5, y6)
+        y7 = x4.repeat((2, 2, 2, 2), axis=0)
+        assert_equal(y5, y7)
+        y8 = x4.repeat(2, 0)
+        assert_equal(y5, y8)
+
+        y9 = x4.copy()
+        assert_equal(y9._data, x4._data)
+        assert_equal(y9._mask, x4._mask)
+
+        x = masked_array([1, 2, 3], mask=[0, 1, 0])
+        # Copy is False by default
+        y = masked_array(x)
+        assert_equal(y._data.ctypes.data, x._data.ctypes.data)
+        assert_equal(y._mask.ctypes.data, x._mask.ctypes.data)
+        y = masked_array(x, copy=True)
+        assert_not_equal(y._data.ctypes.data, x._data.ctypes.data)
+        assert_not_equal(y._mask.ctypes.data, x._mask.ctypes.data)
+
+    def test_copy_0d(self):
+        # gh-9430
+        x = np.ma.array(43, mask=True)
+        xc = x.copy()
+        assert_equal(xc.mask, True)
+
+    def test_copy_on_python_builtins(self):
+        # Tests copy works on python builtins (issue#8019)
+        assert_(isMaskedArray(np.ma.copy([1,2,3])))
+        assert_(isMaskedArray(np.ma.copy((1,2,3))))
+
+    def test_copy_immutable(self):
+        # Tests that the copy method is immutable, GitHub issue #5247
+        a = np.ma.array([1, 2, 3])
+        b = np.ma.array([4, 5, 6])
+        a_copy_method = a.copy
+        b.copy
+        assert_equal(a_copy_method(), [1, 2, 3])
+
+    def test_deepcopy(self):
+        from copy import deepcopy
+        a = array([0, 1, 2], mask=[False, True, False])
+        copied = deepcopy(a)
+        assert_equal(copied.mask, a.mask)
+        assert_not_equal(id(a._mask), id(copied._mask))
+
+        copied[1] = 1
+        assert_equal(copied.mask, [0, 0, 0])
+        assert_equal(a.mask, [0, 1, 0])
+
+        copied = deepcopy(a)
+        assert_equal(copied.mask, a.mask)
+        copied.mask[1] = False
+        assert_equal(copied.mask, [0, 0, 0])
+        assert_equal(a.mask, [0, 1, 0])
+
+    def test_format(self):
+        a = array([0, 1, 2], mask=[False, True, False])
+        assert_equal(format(a), "[0 -- 2]")
+        assert_equal(format(masked), "--")
+        assert_equal(format(masked, ""), "--")
+
+        # Postponed from PR #15410, perhaps address in the future.
+        # assert_equal(format(masked, " >5"), "   --")
+        # assert_equal(format(masked, " <5"), "--   ")
+
+        # Expect a FutureWarning for using format_spec with MaskedElement
+        with assert_warns(FutureWarning):
+            with_format_string = format(masked, " >5")
+        assert_equal(with_format_string, "--")
+
+    def test_str_repr(self):
+        a = array([0, 1, 2], mask=[False, True, False])
+        assert_equal(str(a), '[0 -- 2]')
+        assert_equal(
+            repr(a),
+            textwrap.dedent('''\
+            masked_array(data=[0, --, 2],
+                         mask=[False,  True, False],
+                   fill_value=999999)''')
+        )
+
+        # arrays with a continuation
+        a = np.ma.arange(2000)
+        a[1:50] = np.ma.masked
+        assert_equal(
+            repr(a),
+            textwrap.dedent('''\
+            masked_array(data=[0, --, --, ..., 1997, 1998, 1999],
+                         mask=[False,  True,  True, ..., False, False, False],
+                   fill_value=999999)''')
+        )
+
+        # line-wrapped 1d arrays are correctly aligned
+        a = np.ma.arange(20)
+        assert_equal(
+            repr(a),
+            textwrap.dedent('''\
+            masked_array(data=[ 0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13,
+                               14, 15, 16, 17, 18, 19],
+                         mask=False,
+                   fill_value=999999)''')
+        )
+
+        # 2d arrays cause wrapping
+        a = array([[1, 2, 3], [4, 5, 6]], dtype=np.int8)
+        a[1,1] = np.ma.masked
+        assert_equal(
+            repr(a),
+            textwrap.dedent('''\
+            masked_array(
+              data=[[1, 2, 3],
+                    [4, --, 6]],
+              mask=[[False, False, False],
+                    [False,  True, False]],
+              fill_value=999999,
+              dtype=int8)''')
+        )
+
+        # but not it they're a row vector
+        assert_equal(
+            repr(a[:1]),
+            textwrap.dedent('''\
+            masked_array(data=[[1, 2, 3]],
+                         mask=[[False, False, False]],
+                   fill_value=999999,
+                        dtype=int8)''')
+        )
+
+        # dtype=int is implied, so not shown
+        assert_equal(
+            repr(a.astype(int)),
+            textwrap.dedent('''\
+            masked_array(
+              data=[[1, 2, 3],
+                    [4, --, 6]],
+              mask=[[False, False, False],
+                    [False,  True, False]],
+              fill_value=999999)''')
+        )
+
+    def test_str_repr_legacy(self):
+        oldopts = np.get_printoptions()
+        np.set_printoptions(legacy='1.13')
+        try:
+            a = array([0, 1, 2], mask=[False, True, False])
+            assert_equal(str(a), '[0 -- 2]')
+            assert_equal(repr(a), 'masked_array(data = [0 -- 2],\n'
+                                  '             mask = [False  True False],\n'
+                                  '       fill_value = 999999)\n')
+
+            a = np.ma.arange(2000)
+            a[1:50] = np.ma.masked
+            assert_equal(
+                repr(a),
+                'masked_array(data = [0 -- -- ..., 1997 1998 1999],\n'
+                '             mask = [False  True  True ..., False False False],\n'
+                '       fill_value = 999999)\n'
+            )
+        finally:
+            np.set_printoptions(**oldopts)
+
+    def test_0d_unicode(self):
+        u = u'caf\xe9'
+        utype = type(u)
+
+        arr_nomask = np.ma.array(u)
+        arr_masked = np.ma.array(u, mask=True)
+
+        assert_equal(utype(arr_nomask), u)
+        assert_equal(utype(arr_masked), u'--')
+
+    def test_pickling(self):
+        # Tests pickling
+        for dtype in (int, float, str, object):
+            a = arange(10).astype(dtype)
+            a.fill_value = 999
+
+            masks = ([0, 0, 0, 1, 0, 1, 0, 1, 0, 1],  # partially masked
+                     True,                            # Fully masked
+                     False)                           # Fully unmasked
+
+            for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+                for mask in masks:
+                    a.mask = mask
+                    a_pickled = pickle.loads(pickle.dumps(a, protocol=proto))
+                    assert_equal(a_pickled._mask, a._mask)
+                    assert_equal(a_pickled._data, a._data)
+                    if dtype in (object, int):
+                        assert_equal(a_pickled.fill_value, 999)
+                    else:
+                        assert_equal(a_pickled.fill_value, dtype(999))
+                    assert_array_equal(a_pickled.mask, mask)
+
+    def test_pickling_subbaseclass(self):
+        # Test pickling w/ a subclass of ndarray
+        x = np.array([(1.0, 2), (3.0, 4)],
+                     dtype=[('x', float), ('y', int)]).view(np.recarray)
+        a = masked_array(x, mask=[(True, False), (False, True)])
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            a_pickled = pickle.loads(pickle.dumps(a, protocol=proto))
+            assert_equal(a_pickled._mask, a._mask)
+            assert_equal(a_pickled, a)
+            assert_(isinstance(a_pickled._data, np.recarray))
+
+    def test_pickling_maskedconstant(self):
+        # Test pickling MaskedConstant
+        mc = np.ma.masked
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            mc_pickled = pickle.loads(pickle.dumps(mc, protocol=proto))
+            assert_equal(mc_pickled._baseclass, mc._baseclass)
+            assert_equal(mc_pickled._mask, mc._mask)
+            assert_equal(mc_pickled._data, mc._data)
+
+    def test_pickling_wstructured(self):
+        # Tests pickling w/ structured array
+        a = array([(1, 1.), (2, 2.)], mask=[(0, 0), (0, 1)],
+                  dtype=[('a', int), ('b', float)])
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            a_pickled = pickle.loads(pickle.dumps(a, protocol=proto))
+            assert_equal(a_pickled._mask, a._mask)
+            assert_equal(a_pickled, a)
+
+    def test_pickling_keepalignment(self):
+        # Tests pickling w/ F_CONTIGUOUS arrays
+        a = arange(10)
+        a.shape = (-1, 2)
+        b = a.T
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            test = pickle.loads(pickle.dumps(b, protocol=proto))
+            assert_equal(test, b)
+
+    def test_single_element_subscript(self):
+        # Tests single element subscripts of Maskedarrays.
+        a = array([1, 3, 2])
+        b = array([1, 3, 2], mask=[1, 0, 1])
+        assert_equal(a[0].shape, ())
+        assert_equal(b[0].shape, ())
+        assert_equal(b[1].shape, ())
+
+    def test_topython(self):
+        # Tests some communication issues with Python.
+        assert_equal(1, int(array(1)))
+        assert_equal(1.0, float(array(1)))
+        assert_equal(1, int(array([[[1]]])))
+        assert_equal(1.0, float(array([[1]])))
+        assert_raises(TypeError, float, array([1, 1]))
+
+        with suppress_warnings() as sup:
+            sup.filter(UserWarning, 'Warning: converting a masked element')
+            assert_(np.isnan(float(array([1], mask=[1]))))
+
+            a = array([1, 2, 3], mask=[1, 0, 0])
+            assert_raises(TypeError, lambda: float(a))
+            assert_equal(float(a[-1]), 3.)
+            assert_(np.isnan(float(a[0])))
+        assert_raises(TypeError, int, a)
+        assert_equal(int(a[-1]), 3)
+        assert_raises(MAError, lambda:int(a[0]))
+
+    def test_oddfeatures_1(self):
+        # Test of other odd features
+        x = arange(20)
+        x = x.reshape(4, 5)
+        x.flat[5] = 12
+        assert_(x[1, 0] == 12)
+        z = x + 10j * x
+        assert_equal(z.real, x)
+        assert_equal(z.imag, 10 * x)
+        assert_equal((z * conjugate(z)).real, 101 * x * x)
+        z.imag[...] = 0.0
+
+        x = arange(10)
+        x[3] = masked
+        assert_(str(x[3]) == str(masked))
+        c = x >= 8
+        assert_(count(where(c, masked, masked)) == 0)
+        assert_(shape(where(c, masked, masked)) == c.shape)
+
+        z = masked_where(c, x)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is not masked)
+        assert_(z[7] is not masked)
+        assert_(z[8] is masked)
+        assert_(z[9] is masked)
+        assert_equal(x, z)
+
+    def test_oddfeatures_2(self):
+        # Tests some more features.
+        x = array([1., 2., 3., 4., 5.])
+        c = array([1, 1, 1, 0, 0])
+        x[2] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        c[0] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        assert_(z[0] is masked)
+        assert_(z[1] is not masked)
+        assert_(z[2] is masked)
+
+    @suppress_copy_mask_on_assignment
+    def test_oddfeatures_3(self):
+        # Tests some generic features
+        atest = array([10], mask=True)
+        btest = array([20])
+        idx = atest.mask
+        atest[idx] = btest[idx]
+        assert_equal(atest, [20])
+
+    def test_filled_with_object_dtype(self):
+        a = np.ma.masked_all(1, dtype='O')
+        assert_equal(a.filled('x')[0], 'x')
+
+    def test_filled_with_flexible_dtype(self):
+        # Test filled w/ flexible dtype
+        flexi = array([(1, 1, 1)],
+                      dtype=[('i', int), ('s', '|S8'), ('f', float)])
+        flexi[0] = masked
+        assert_equal(flexi.filled(),
+                     np.array([(default_fill_value(0),
+                                default_fill_value('0'),
+                                default_fill_value(0.),)], dtype=flexi.dtype))
+        flexi[0] = masked
+        assert_equal(flexi.filled(1),
+                     np.array([(1, '1', 1.)], dtype=flexi.dtype))
+
+    def test_filled_with_mvoid(self):
+        # Test filled w/ mvoid
+        ndtype = [('a', int), ('b', float)]
+        a = mvoid((1, 2.), mask=[(0, 1)], dtype=ndtype)
+        # Filled using default
+        test = a.filled()
+        assert_equal(tuple(test), (1, default_fill_value(1.)))
+        # Explicit fill_value
+        test = a.filled((-1, -1))
+        assert_equal(tuple(test), (1, -1))
+        # Using predefined filling values
+        a.fill_value = (-999, -999)
+        assert_equal(tuple(a.filled()), (1, -999))
+
+    def test_filled_with_nested_dtype(self):
+        # Test filled w/ nested dtype
+        ndtype = [('A', int), ('B', [('BA', int), ('BB', int)])]
+        a = array([(1, (1, 1)), (2, (2, 2))],
+                  mask=[(0, (1, 0)), (0, (0, 1))], dtype=ndtype)
+        test = a.filled(0)
+        control = np.array([(1, (0, 1)), (2, (2, 0))], dtype=ndtype)
+        assert_equal(test, control)
+
+        test = a['B'].filled(0)
+        control = np.array([(0, 1), (2, 0)], dtype=a['B'].dtype)
+        assert_equal(test, control)
+
+        # test if mask gets set correctly (see #6760)
+        Z = numpy.ma.zeros(2, numpy.dtype([("A", "(2,2)i1,(2,2)i1", (2,2))]))
+        assert_equal(Z.data.dtype, numpy.dtype([('A', [('f0', 'i1', (2, 2)),
+                                          ('f1', 'i1', (2, 2))], (2, 2))]))
+        assert_equal(Z.mask.dtype, numpy.dtype([('A', [('f0', '?', (2, 2)),
+                                          ('f1', '?', (2, 2))], (2, 2))]))
+
+    def test_filled_with_f_order(self):
+        # Test filled w/ F-contiguous array
+        a = array(np.array([(0, 1, 2), (4, 5, 6)], order='F'),
+                  mask=np.array([(0, 0, 1), (1, 0, 0)], order='F'),
+                  order='F')  # this is currently ignored
+        assert_(a.flags['F_CONTIGUOUS'])
+        assert_(a.filled(0).flags['F_CONTIGUOUS'])
+
+    def test_optinfo_propagation(self):
+        # Checks that _optinfo dictionary isn't back-propagated
+        x = array([1, 2, 3, ], dtype=float)
+        x._optinfo['info'] = '???'
+        y = x.copy()
+        assert_equal(y._optinfo['info'], '???')
+        y._optinfo['info'] = '!!!'
+        assert_equal(x._optinfo['info'], '???')
+
+    def test_optinfo_forward_propagation(self):
+        a = array([1,2,2,4])
+        a._optinfo["key"] = "value"
+        assert_equal(a._optinfo["key"], (a == 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a != 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a > 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a >= 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a <= 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a + 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a - 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a * 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], (a / 2)._optinfo["key"])
+        assert_equal(a._optinfo["key"], a[:2]._optinfo["key"])
+        assert_equal(a._optinfo["key"], a[[0,0,2]]._optinfo["key"])
+        assert_equal(a._optinfo["key"], np.exp(a)._optinfo["key"])
+        assert_equal(a._optinfo["key"], np.abs(a)._optinfo["key"])
+        assert_equal(a._optinfo["key"], array(a, copy=True)._optinfo["key"])
+        assert_equal(a._optinfo["key"], np.zeros_like(a)._optinfo["key"])
+
+    def test_fancy_printoptions(self):
+        # Test printing a masked array w/ fancy dtype.
+        fancydtype = np.dtype([('x', int), ('y', [('t', int), ('s', float)])])
+        test = array([(1, (2, 3.0)), (4, (5, 6.0))],
+                     mask=[(1, (0, 1)), (0, (1, 0))],
+                     dtype=fancydtype)
+        control = "[(--, (2, --)) (4, (--, 6.0))]"
+        assert_equal(str(test), control)
+
+        # Test 0-d array with multi-dimensional dtype
+        t_2d0 = masked_array(data = (0, [[0.0, 0.0, 0.0],
+                                        [0.0, 0.0, 0.0]],
+                                    0.0),
+                             mask = (False, [[True, False, True],
+                                             [False, False, True]],
+                                     False),
+                             dtype = "int, (2,3)float, float")
+        control = "(0, [[--, 0.0, --], [0.0, 0.0, --]], 0.0)"
+        assert_equal(str(t_2d0), control)
+
+    def test_flatten_structured_array(self):
+        # Test flatten_structured_array on arrays
+        # On ndarray
+        ndtype = [('a', int), ('b', float)]
+        a = np.array([(1, 1), (2, 2)], dtype=ndtype)
+        test = flatten_structured_array(a)
+        control = np.array([[1., 1.], [2., 2.]], dtype=float)
+        assert_equal(test, control)
+        assert_equal(test.dtype, control.dtype)
+        # On masked_array
+        a = array([(1, 1), (2, 2)], mask=[(0, 1), (1, 0)], dtype=ndtype)
+        test = flatten_structured_array(a)
+        control = array([[1., 1.], [2., 2.]],
+                        mask=[[0, 1], [1, 0]], dtype=float)
+        assert_equal(test, control)
+        assert_equal(test.dtype, control.dtype)
+        assert_equal(test.mask, control.mask)
+        # On masked array with nested structure
+        ndtype = [('a', int), ('b', [('ba', int), ('bb', float)])]
+        a = array([(1, (1, 1.1)), (2, (2, 2.2))],
+                  mask=[(0, (1, 0)), (1, (0, 1))], dtype=ndtype)
+        test = flatten_structured_array(a)
+        control = array([[1., 1., 1.1], [2., 2., 2.2]],
+                        mask=[[0, 1, 0], [1, 0, 1]], dtype=float)
+        assert_equal(test, control)
+        assert_equal(test.dtype, control.dtype)
+        assert_equal(test.mask, control.mask)
+        # Keeping the initial shape
+        ndtype = [('a', int), ('b', float)]
+        a = np.array([[(1, 1), ], [(2, 2), ]], dtype=ndtype)
+        test = flatten_structured_array(a)
+        control = np.array([[[1., 1.], ], [[2., 2.], ]], dtype=float)
+        assert_equal(test, control)
+        assert_equal(test.dtype, control.dtype)
+
+    def test_void0d(self):
+        # Test creating a mvoid object
+        ndtype = [('a', int), ('b', int)]
+        a = np.array([(1, 2,)], dtype=ndtype)[0]
+        f = mvoid(a)
+        assert_(isinstance(f, mvoid))
+
+        a = masked_array([(1, 2)], mask=[(1, 0)], dtype=ndtype)[0]
+        assert_(isinstance(a, mvoid))
+
+        a = masked_array([(1, 2), (1, 2)], mask=[(1, 0), (0, 0)], dtype=ndtype)
+        f = mvoid(a._data[0], a._mask[0])
+        assert_(isinstance(f, mvoid))
+
+    def test_mvoid_getitem(self):
+        # Test mvoid.__getitem__
+        ndtype = [('a', int), ('b', int)]
+        a = masked_array([(1, 2,), (3, 4)], mask=[(0, 0), (1, 0)],
+                         dtype=ndtype)
+        # w/o mask
+        f = a[0]
+        assert_(isinstance(f, mvoid))
+        assert_equal((f[0], f['a']), (1, 1))
+        assert_equal(f['b'], 2)
+        # w/ mask
+        f = a[1]
+        assert_(isinstance(f, mvoid))
+        assert_(f[0] is masked)
+        assert_(f['a'] is masked)
+        assert_equal(f[1], 4)
+
+        # exotic dtype
+        A = masked_array(data=[([0,1],)],
+                         mask=[([True, False],)],
+                         dtype=[("A", ">i2", (2,))])
+        assert_equal(A[0]["A"], A["A"][0])
+        assert_equal(A[0]["A"], masked_array(data=[0, 1],
+                         mask=[True, False], dtype=">i2"))
+
+    def test_mvoid_iter(self):
+        # Test iteration on __getitem__
+        ndtype = [('a', int), ('b', int)]
+        a = masked_array([(1, 2,), (3, 4)], mask=[(0, 0), (1, 0)],
+                         dtype=ndtype)
+        # w/o mask
+        assert_equal(list(a[0]), [1, 2])
+        # w/ mask
+        assert_equal(list(a[1]), [masked, 4])
+
+    def test_mvoid_print(self):
+        # Test printing a mvoid
+        mx = array([(1, 1), (2, 2)], dtype=[('a', int), ('b', int)])
+        assert_equal(str(mx[0]), "(1, 1)")
+        mx['b'][0] = masked
+        ini_display = masked_print_option._display
+        masked_print_option.set_display("-X-")
+        try:
+            assert_equal(str(mx[0]), "(1, -X-)")
+            assert_equal(repr(mx[0]), "(1, -X-)")
+        finally:
+            masked_print_option.set_display(ini_display)
+
+        # also check if there are object datatypes (see gh-7493)
+        mx = array([(1,), (2,)], dtype=[('a', 'O')])
+        assert_equal(str(mx[0]), "(1,)")
+
+    def test_mvoid_multidim_print(self):
+
+        # regression test for gh-6019
+        t_ma = masked_array(data = [([1, 2, 3],)],
+                            mask = [([False, True, False],)],
+                            fill_value = ([999999, 999999, 999999],),
+                            dtype = [('a', '<i4', (3,))])
+        assert_(str(t_ma[0]) == "([1, --, 3],)")
+        assert_(repr(t_ma[0]) == "([1, --, 3],)")
+
+        # additional tests with structured arrays
+
+        t_2d = masked_array(data = [([[1, 2], [3,4]],)],
+                            mask = [([[False, True], [True, False]],)],
+                            dtype = [('a', '<i4', (2,2))])
+        assert_(str(t_2d[0]) == "([[1, --], [--, 4]],)")
+        assert_(repr(t_2d[0]) == "([[1, --], [--, 4]],)")
+
+        t_0d = masked_array(data = [(1,2)],
+                            mask = [(True,False)],
+                            dtype = [('a', '<i4'), ('b', '<i4')])
+        assert_(str(t_0d[0]) == "(--, 2)")
+        assert_(repr(t_0d[0]) == "(--, 2)")
+
+        t_2d = masked_array(data = [([[1, 2], [3,4]], 1)],
+                            mask = [([[False, True], [True, False]], False)],
+                            dtype = [('a', '<i4', (2,2)), ('b', float)])
+        assert_(str(t_2d[0]) == "([[1, --], [--, 4]], 1.0)")
+        assert_(repr(t_2d[0]) == "([[1, --], [--, 4]], 1.0)")
+
+        t_ne = masked_array(data=[(1, (1, 1))],
+                            mask=[(True, (True, False))],
+                            dtype = [('a', '<i4'), ('b', 'i4,i4')])
+        assert_(str(t_ne[0]) == "(--, (--, 1))")
+        assert_(repr(t_ne[0]) == "(--, (--, 1))")
+
+    def test_object_with_array(self):
+        mx1 = masked_array([1.], mask=[True])
+        mx2 = masked_array([1., 2.])
+        mx = masked_array([mx1, mx2], mask=[False, True], dtype=object)
+        assert_(mx[0] is mx1)
+        assert_(mx[1] is not mx2)
+        assert_(np.all(mx[1].data == mx2.data))
+        assert_(np.all(mx[1].mask))
+        # check that we return a view.
+        mx[1].data[0] = 0.
+        assert_(mx2[0] == 0.)
+
+
+class TestMaskedArrayArithmetic:
+    # Base test class for MaskedArrays.
+
+    def setup(self):
+        # Base data definition.
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        a10 = 10.
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = masked_array(x, mask=m1)
+        ym = masked_array(y, mask=m2)
+        z = np.array([-.5, 0., .5, .8])
+        zm = masked_array(z, mask=[0, 1, 0, 0])
+        xf = np.where(m1, 1e+20, x)
+        xm.set_fill_value(1e+20)
+        self.d = (x, y, a10, m1, m2, xm, ym, z, zm, xf)
+        self.err_status = np.geterr()
+        np.seterr(divide='ignore', invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.err_status)
+
+    def test_basic_arithmetic(self):
+        # Test of basic arithmetic.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        a2d = array([[1, 2], [0, 4]])
+        a2dm = masked_array(a2d, [[0, 0], [1, 0]])
+        assert_equal(a2d * a2d, a2d * a2dm)
+        assert_equal(a2d + a2d, a2d + a2dm)
+        assert_equal(a2d - a2d, a2d - a2dm)
+        for s in [(12,), (4, 3), (2, 6)]:
+            x = x.reshape(s)
+            y = y.reshape(s)
+            xm = xm.reshape(s)
+            ym = ym.reshape(s)
+            xf = xf.reshape(s)
+            assert_equal(-x, -xm)
+            assert_equal(x + y, xm + ym)
+            assert_equal(x - y, xm - ym)
+            assert_equal(x * y, xm * ym)
+            assert_equal(x / y, xm / ym)
+            assert_equal(a10 + y, a10 + ym)
+            assert_equal(a10 - y, a10 - ym)
+            assert_equal(a10 * y, a10 * ym)
+            assert_equal(a10 / y, a10 / ym)
+            assert_equal(x + a10, xm + a10)
+            assert_equal(x - a10, xm - a10)
+            assert_equal(x * a10, xm * a10)
+            assert_equal(x / a10, xm / a10)
+            assert_equal(x ** 2, xm ** 2)
+            assert_equal(abs(x) ** 2.5, abs(xm) ** 2.5)
+            assert_equal(x ** y, xm ** ym)
+            assert_equal(np.add(x, y), add(xm, ym))
+            assert_equal(np.subtract(x, y), subtract(xm, ym))
+            assert_equal(np.multiply(x, y), multiply(xm, ym))
+            assert_equal(np.divide(x, y), divide(xm, ym))
+
+    def test_divide_on_different_shapes(self):
+        x = arange(6, dtype=float)
+        x.shape = (2, 3)
+        y = arange(3, dtype=float)
+
+        z = x / y
+        assert_equal(z, [[-1., 1., 1.], [-1., 4., 2.5]])
+        assert_equal(z.mask, [[1, 0, 0], [1, 0, 0]])
+
+        z = x / y[None,:]
+        assert_equal(z, [[-1., 1., 1.], [-1., 4., 2.5]])
+        assert_equal(z.mask, [[1, 0, 0], [1, 0, 0]])
+
+        y = arange(2, dtype=float)
+        z = x / y[:, None]
+        assert_equal(z, [[-1., -1., -1.], [3., 4., 5.]])
+        assert_equal(z.mask, [[1, 1, 1], [0, 0, 0]])
+
+    def test_mixed_arithmetic(self):
+        # Tests mixed arithmetics.
+        na = np.array([1])
+        ma = array([1])
+        assert_(isinstance(na + ma, MaskedArray))
+        assert_(isinstance(ma + na, MaskedArray))
+
+    def test_limits_arithmetic(self):
+        tiny = np.finfo(float).tiny
+        a = array([tiny, 1. / tiny, 0.])
+        assert_equal(getmaskarray(a / 2), [0, 0, 0])
+        assert_equal(getmaskarray(2 / a), [1, 0, 1])
+
+    def test_masked_singleton_arithmetic(self):
+        # Tests some scalar arithmetics on MaskedArrays.
+        # Masked singleton should remain masked no matter what
+        xm = array(0, mask=1)
+        assert_((1 / array(0)).mask)
+        assert_((1 + xm).mask)
+        assert_((-xm).mask)
+        assert_(maximum(xm, xm).mask)
+        assert_(minimum(xm, xm).mask)
+
+    def test_masked_singleton_equality(self):
+        # Tests (in)equality on masked singleton
+        a = array([1, 2, 3], mask=[1, 1, 0])
+        assert_((a[0] == 0) is masked)
+        assert_((a[0] != 0) is masked)
+        assert_equal((a[-1] == 0), False)
+        assert_equal((a[-1] != 0), True)
+
+    def test_arithmetic_with_masked_singleton(self):
+        # Checks that there's no collapsing to masked
+        x = masked_array([1, 2])
+        y = x * masked
+        assert_equal(y.shape, x.shape)
+        assert_equal(y._mask, [True, True])
+        y = x[0] * masked
+        assert_(y is masked)
+        y = x + masked
+        assert_equal(y.shape, x.shape)
+        assert_equal(y._mask, [True, True])
+
+    def test_arithmetic_with_masked_singleton_on_1d_singleton(self):
+        # Check that we're not losing the shape of a singleton
+        x = masked_array([1, ])
+        y = x + masked
+        assert_equal(y.shape, x.shape)
+        assert_equal(y.mask, [True, ])
+
+    def test_scalar_arithmetic(self):
+        x = array(0, mask=0)
+        assert_equal(x.filled().ctypes.data, x.ctypes.data)
+        # Make sure we don't lose the shape in some circumstances
+        xm = array((0, 0)) / 0.
+        assert_equal(xm.shape, (2,))
+        assert_equal(xm.mask, [1, 1])
+
+    def test_basic_ufuncs(self):
+        # Test various functions such as sin, cos.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        assert_equal(np.cos(x), cos(xm))
+        assert_equal(np.cosh(x), cosh(xm))
+        assert_equal(np.sin(x), sin(xm))
+        assert_equal(np.sinh(x), sinh(xm))
+        assert_equal(np.tan(x), tan(xm))
+        assert_equal(np.tanh(x), tanh(xm))
+        assert_equal(np.sqrt(abs(x)), sqrt(xm))
+        assert_equal(np.log(abs(x)), log(xm))
+        assert_equal(np.log10(abs(x)), log10(xm))
+        assert_equal(np.exp(x), exp(xm))
+        assert_equal(np.arcsin(z), arcsin(zm))
+        assert_equal(np.arccos(z), arccos(zm))
+        assert_equal(np.arctan(z), arctan(zm))
+        assert_equal(np.arctan2(x, y), arctan2(xm, ym))
+        assert_equal(np.absolute(x), absolute(xm))
+        assert_equal(np.angle(x + 1j*y), angle(xm + 1j*ym))
+        assert_equal(np.angle(x + 1j*y, deg=True), angle(xm + 1j*ym, deg=True))
+        assert_equal(np.equal(x, y), equal(xm, ym))
+        assert_equal(np.not_equal(x, y), not_equal(xm, ym))
+        assert_equal(np.less(x, y), less(xm, ym))
+        assert_equal(np.greater(x, y), greater(xm, ym))
+        assert_equal(np.less_equal(x, y), less_equal(xm, ym))
+        assert_equal(np.greater_equal(x, y), greater_equal(xm, ym))
+        assert_equal(np.conjugate(x), conjugate(xm))
+
+    def test_count_func(self):
+        # Tests count
+        assert_equal(1, count(1))
+        assert_equal(0, array(1, mask=[1]))
+
+        ott = array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        res = count(ott)
+        assert_(res.dtype.type is np.intp)
+        assert_equal(3, res)
+
+        ott = ott.reshape((2, 2))
+        res = count(ott)
+        assert_(res.dtype.type is np.intp)
+        assert_equal(3, res)
+        res = count(ott, 0)
+        assert_(isinstance(res, ndarray))
+        assert_equal([1, 2], res)
+        assert_(getmask(res) is nomask)
+
+        ott = array([0., 1., 2., 3.])
+        res = count(ott, 0)
+        assert_(isinstance(res, ndarray))
+        assert_(res.dtype.type is np.intp)
+        assert_raises(np.AxisError, ott.count, axis=1)
+
+    def test_count_on_python_builtins(self):
+        # Tests count works on python builtins (issue#8019)
+        assert_equal(3, count([1,2,3]))
+        assert_equal(2, count((1,2)))
+
+    def test_minmax_func(self):
+        # Tests minimum and maximum.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        # max doesn't work if shaped
+        xr = np.ravel(x)
+        xmr = ravel(xm)
+        # following are true because of careful selection of data
+        assert_equal(max(xr), maximum.reduce(xmr))
+        assert_equal(min(xr), minimum.reduce(xmr))
+
+        assert_equal(minimum([1, 2, 3], [4, 0, 9]), [1, 0, 3])
+        assert_equal(maximum([1, 2, 3], [4, 0, 9]), [4, 2, 9])
+        x = arange(5)
+        y = arange(5) - 2
+        x[3] = masked
+        y[0] = masked
+        assert_equal(minimum(x, y), where(less(x, y), x, y))
+        assert_equal(maximum(x, y), where(greater(x, y), x, y))
+        assert_(minimum.reduce(x) == 0)
+        assert_(maximum.reduce(x) == 4)
+
+        x = arange(4).reshape(2, 2)
+        x[-1, -1] = masked
+        assert_equal(maximum.reduce(x, axis=None), 2)
+
+    def test_minimummaximum_func(self):
+        a = np.ones((2, 2))
+        aminimum = minimum(a, a)
+        assert_(isinstance(aminimum, MaskedArray))
+        assert_equal(aminimum, np.minimum(a, a))
+
+        aminimum = minimum.outer(a, a)
+        assert_(isinstance(aminimum, MaskedArray))
+        assert_equal(aminimum, np.minimum.outer(a, a))
+
+        amaximum = maximum(a, a)
+        assert_(isinstance(amaximum, MaskedArray))
+        assert_equal(amaximum, np.maximum(a, a))
+
+        amaximum = maximum.outer(a, a)
+        assert_(isinstance(amaximum, MaskedArray))
+        assert_equal(amaximum, np.maximum.outer(a, a))
+
+    def test_minmax_reduce(self):
+        # Test np.min/maximum.reduce on array w/ full False mask
+        a = array([1, 2, 3], mask=[False, False, False])
+        b = np.maximum.reduce(a)
+        assert_equal(b, 3)
+
+    def test_minmax_funcs_with_output(self):
+        # Tests the min/max functions with explicit outputs
+        mask = np.random.rand(12).round()
+        xm = array(np.random.uniform(0, 10, 12), mask=mask)
+        xm.shape = (3, 4)
+        for funcname in ('min', 'max'):
+            # Initialize
+            npfunc = getattr(np, funcname)
+            mafunc = getattr(numpy.ma.core, funcname)
+            # Use the np version
+            nout = np.empty((4,), dtype=int)
+            try:
+                result = npfunc(xm, axis=0, out=nout)
+            except MaskError:
+                pass
+            nout = np.empty((4,), dtype=float)
+            result = npfunc(xm, axis=0, out=nout)
+            assert_(result is nout)
+            # Use the ma version
+            nout.fill(-999)
+            result = mafunc(xm, axis=0, out=nout)
+            assert_(result is nout)
+
+    def test_minmax_methods(self):
+        # Additional tests on max/min
+        (_, _, _, _, _, xm, _, _, _, _) = self.d
+        xm.shape = (xm.size,)
+        assert_equal(xm.max(), 10)
+        assert_(xm[0].max() is masked)
+        assert_(xm[0].max(0) is masked)
+        assert_(xm[0].max(-1) is masked)
+        assert_equal(xm.min(), -10.)
+        assert_(xm[0].min() is masked)
+        assert_(xm[0].min(0) is masked)
+        assert_(xm[0].min(-1) is masked)
+        assert_equal(xm.ptp(), 20.)
+        assert_(xm[0].ptp() is masked)
+        assert_(xm[0].ptp(0) is masked)
+        assert_(xm[0].ptp(-1) is masked)
+
+        x = array([1, 2, 3], mask=True)
+        assert_(x.min() is masked)
+        assert_(x.max() is masked)
+        assert_(x.ptp() is masked)
+
+    def test_minmax_dtypes(self):
+        # Additional tests on max/min for non-standard float and complex dtypes
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        a10 = 10.
+        an10 = -10.0
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        xm = masked_array(x, mask=m1)
+        xm.set_fill_value(1e+20)
+        float_dtypes = [np.half, np.single, np.double,
+                        np.longdouble, np.cfloat, np.cdouble, np.clongdouble]
+        for float_dtype in float_dtypes:
+            assert_equal(masked_array(x, mask=m1, dtype=float_dtype).max(),
+                         float_dtype(a10))
+            assert_equal(masked_array(x, mask=m1, dtype=float_dtype).min(),
+                         float_dtype(an10))
+
+        assert_equal(xm.min(), an10)
+        assert_equal(xm.max(), a10)
+
+        # Non-complex type only test
+        for float_dtype in float_dtypes[:4]:
+            assert_equal(masked_array(x, mask=m1, dtype=float_dtype).max(),
+                         float_dtype(a10))
+            assert_equal(masked_array(x, mask=m1, dtype=float_dtype).min(),
+                         float_dtype(an10))
+
+        # Complex types only test
+        for float_dtype in float_dtypes[-3:]:
+            ym = masked_array([1e20+1j, 1e20-2j, 1e20-1j], mask=[0, 1, 0],
+                          dtype=float_dtype)
+            assert_equal(ym.min(), float_dtype(1e20-1j))
+            assert_equal(ym.max(), float_dtype(1e20+1j))
+
+            zm = masked_array([np.inf+2j, np.inf+3j, -np.inf-1j], mask=[0, 1, 0],
+                              dtype=float_dtype)
+            assert_equal(zm.min(), float_dtype(-np.inf-1j))
+            assert_equal(zm.max(), float_dtype(np.inf+2j))
+            
+            cmax = np.inf - 1j * np.finfo(np.float64).max
+            assert masked_array([-cmax, 0], mask=[0, 1]).max() == -cmax
+            assert masked_array([cmax, 0], mask=[0, 1]).min() == cmax
+
+    def test_addsumprod(self):
+        # Tests add, sum, product.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        assert_equal(np.add.reduce(x), add.reduce(x))
+        assert_equal(np.add.accumulate(x), add.accumulate(x))
+        assert_equal(4, sum(array(4), axis=0))
+        assert_equal(4, sum(array(4), axis=0))
+        assert_equal(np.sum(x, axis=0), sum(x, axis=0))
+        assert_equal(np.sum(filled(xm, 0), axis=0), sum(xm, axis=0))
+        assert_equal(np.sum(x, 0), sum(x, 0))
+        assert_equal(np.product(x, axis=0), product(x, axis=0))
+        assert_equal(np.product(x, 0), product(x, 0))
+        assert_equal(np.product(filled(xm, 1), axis=0), product(xm, axis=0))
+        s = (3, 4)
+        x.shape = y.shape = xm.shape = ym.shape = s
+        if len(s) > 1:
+            assert_equal(np.concatenate((x, y), 1), concatenate((xm, ym), 1))
+            assert_equal(np.add.reduce(x, 1), add.reduce(x, 1))
+            assert_equal(np.sum(x, 1), sum(x, 1))
+            assert_equal(np.product(x, 1), product(x, 1))
+
+    def test_binops_d2D(self):
+        # Test binary operations on 2D data
+        a = array([[1.], [2.], [3.]], mask=[[False], [True], [True]])
+        b = array([[2., 3.], [4., 5.], [6., 7.]])
+
+        test = a * b
+        control = array([[2., 3.], [2., 2.], [3., 3.]],
+                        mask=[[0, 0], [1, 1], [1, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        test = b * a
+        control = array([[2., 3.], [4., 5.], [6., 7.]],
+                        mask=[[0, 0], [1, 1], [1, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        a = array([[1.], [2.], [3.]])
+        b = array([[2., 3.], [4., 5.], [6., 7.]],
+                  mask=[[0, 0], [0, 0], [0, 1]])
+        test = a * b
+        control = array([[2, 3], [8, 10], [18, 3]],
+                        mask=[[0, 0], [0, 0], [0, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        test = b * a
+        control = array([[2, 3], [8, 10], [18, 7]],
+                        mask=[[0, 0], [0, 0], [0, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+    def test_domained_binops_d2D(self):
+        # Test domained binary operations on 2D data
+        a = array([[1.], [2.], [3.]], mask=[[False], [True], [True]])
+        b = array([[2., 3.], [4., 5.], [6., 7.]])
+
+        test = a / b
+        control = array([[1. / 2., 1. / 3.], [2., 2.], [3., 3.]],
+                        mask=[[0, 0], [1, 1], [1, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        test = b / a
+        control = array([[2. / 1., 3. / 1.], [4., 5.], [6., 7.]],
+                        mask=[[0, 0], [1, 1], [1, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        a = array([[1.], [2.], [3.]])
+        b = array([[2., 3.], [4., 5.], [6., 7.]],
+                  mask=[[0, 0], [0, 0], [0, 1]])
+        test = a / b
+        control = array([[1. / 2, 1. / 3], [2. / 4, 2. / 5], [3. / 6, 3]],
+                        mask=[[0, 0], [0, 0], [0, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+        test = b / a
+        control = array([[2 / 1., 3 / 1.], [4 / 2., 5 / 2.], [6 / 3., 7]],
+                        mask=[[0, 0], [0, 0], [0, 1]])
+        assert_equal(test, control)
+        assert_equal(test.data, control.data)
+        assert_equal(test.mask, control.mask)
+
+    def test_noshrinking(self):
+        # Check that we don't shrink a mask when not wanted
+        # Binary operations
+        a = masked_array([1., 2., 3.], mask=[False, False, False],
+                         shrink=False)
+        b = a + 1
+        assert_equal(b.mask, [0, 0, 0])
+        # In place binary operation
+        a += 1
+        assert_equal(a.mask, [0, 0, 0])
+        # Domained binary operation
+        b = a / 1.
+        assert_equal(b.mask, [0, 0, 0])
+        # In place binary operation
+        a /= 1.
+        assert_equal(a.mask, [0, 0, 0])
+
+    def test_ufunc_nomask(self):
+        # check the case ufuncs should set the mask to false
+        m = np.ma.array([1])
+        # check we don't get array([False], dtype=bool)
+        assert_equal(np.true_divide(m, 5).mask.shape, ())
+
+    def test_noshink_on_creation(self):
+        # Check that the mask is not shrunk on array creation when not wanted
+        a = np.ma.masked_values([1., 2.5, 3.1], 1.5, shrink=False)
+        assert_equal(a.mask, [0, 0, 0])
+
+    def test_mod(self):
+        # Tests mod
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf) = self.d
+        assert_equal(mod(x, y), mod(xm, ym))
+        test = mod(ym, xm)
+        assert_equal(test, np.mod(ym, xm))
+        assert_equal(test.mask, mask_or(xm.mask, ym.mask))
+        test = mod(xm, ym)
+        assert_equal(test, np.mod(xm, ym))
+        assert_equal(test.mask, mask_or(mask_or(xm.mask, ym.mask), (ym == 0)))
+
+    def test_TakeTransposeInnerOuter(self):
+        # Test of take, transpose, inner, outer products
+        x = arange(24)
+        y = np.arange(24)
+        x[5:6] = masked
+        x = x.reshape(2, 3, 4)
+        y = y.reshape(2, 3, 4)
+        assert_equal(np.transpose(y, (2, 0, 1)), transpose(x, (2, 0, 1)))
+        assert_equal(np.take(y, (2, 0, 1), 1), take(x, (2, 0, 1), 1))
+        assert_equal(np.inner(filled(x, 0), filled(y, 0)),
+                     inner(x, y))
+        assert_equal(np.outer(filled(x, 0), filled(y, 0)),
+                     outer(x, y))
+        y = array(['abc', 1, 'def', 2, 3], object)
+        y[2] = masked
+        t = take(y, [0, 3, 4])
+        assert_(t[0] == 'abc')
+        assert_(t[1] == 2)
+        assert_(t[2] == 3)
+
+    def test_imag_real(self):
+        # Check complex
+        xx = array([1 + 10j, 20 + 2j], mask=[1, 0])
+        assert_equal(xx.imag, [10, 2])
+        assert_equal(xx.imag.filled(), [1e+20, 2])
+        assert_equal(xx.imag.dtype, xx._data.imag.dtype)
+        assert_equal(xx.real, [1, 20])
+        assert_equal(xx.real.filled(), [1e+20, 20])
+        assert_equal(xx.real.dtype, xx._data.real.dtype)
+
+    def test_methods_with_output(self):
+        xm = array(np.random.uniform(0, 10, 12)).reshape(3, 4)
+        xm[:, 0] = xm[0] = xm[-1, -1] = masked
+
+        funclist = ('sum', 'prod', 'var', 'std', 'max', 'min', 'ptp', 'mean',)
+
+        for funcname in funclist:
+            npfunc = getattr(np, funcname)
+            xmmeth = getattr(xm, funcname)
+            # A ndarray as explicit input
+            output = np.empty(4, dtype=float)
+            output.fill(-9999)
+            result = npfunc(xm, axis=0, out=output)
+            # ... the result should be the given output
+            assert_(result is output)
+            assert_equal(result, xmmeth(axis=0, out=output))
+
+            output = empty(4, dtype=int)
+            result = xmmeth(axis=0, out=output)
+            assert_(result is output)
+            assert_(output[0] is masked)
+
+    def test_eq_on_structured(self):
+        # Test the equality of structured arrays
+        ndtype = [('A', int), ('B', int)]
+        a = array([(1, 1), (2, 2)], mask=[(0, 1), (0, 0)], dtype=ndtype)
+
+        test = (a == a)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        test = (a == a[0])
+        assert_equal(test.data, [True, False])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        b = array([(1, 1), (2, 2)], mask=[(1, 0), (0, 0)], dtype=ndtype)
+        test = (a == b)
+        assert_equal(test.data, [False, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (a[0] == b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        b = array([(1, 1), (2, 2)], mask=[(0, 1), (1, 0)], dtype=ndtype)
+        test = (a == b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        # complicated dtype, 2-dimensional array.
+        ndtype = [('A', int), ('B', [('BA', int), ('BB', int)])]
+        a = array([[(1, (1, 1)), (2, (2, 2))],
+                   [(3, (3, 3)), (4, (4, 4))]],
+                  mask=[[(0, (1, 0)), (0, (0, 1))],
+                        [(1, (0, 0)), (1, (1, 1))]], dtype=ndtype)
+        test = (a[0, 0] == a)
+        assert_equal(test.data, [[True, False], [False, False]])
+        assert_equal(test.mask, [[False, False], [False, True]])
+        assert_(test.fill_value == True)
+
+    def test_ne_on_structured(self):
+        # Test the equality of structured arrays
+        ndtype = [('A', int), ('B', int)]
+        a = array([(1, 1), (2, 2)], mask=[(0, 1), (0, 0)], dtype=ndtype)
+
+        test = (a != a)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        test = (a != a[0])
+        assert_equal(test.data, [False, True])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        b = array([(1, 1), (2, 2)], mask=[(1, 0), (0, 0)], dtype=ndtype)
+        test = (a != b)
+        assert_equal(test.data, [True, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (a[0] != b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        b = array([(1, 1), (2, 2)], mask=[(0, 1), (1, 0)], dtype=ndtype)
+        test = (a != b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [False, False])
+        assert_(test.fill_value == True)
+
+        # complicated dtype, 2-dimensional array.
+        ndtype = [('A', int), ('B', [('BA', int), ('BB', int)])]
+        a = array([[(1, (1, 1)), (2, (2, 2))],
+                   [(3, (3, 3)), (4, (4, 4))]],
+                  mask=[[(0, (1, 0)), (0, (0, 1))],
+                        [(1, (0, 0)), (1, (1, 1))]], dtype=ndtype)
+        test = (a[0, 0] != a)
+        assert_equal(test.data, [[False, True], [True, True]])
+        assert_equal(test.mask, [[False, False], [False, True]])
+        assert_(test.fill_value == True)
+
+    def test_eq_ne_structured_extra(self):
+        # ensure simple examples are symmetric and make sense.
+        # from https://github.com/numpy/numpy/pull/8590#discussion_r101126465
+        dt = np.dtype('i4,i4')
+        for m1 in (mvoid((1, 2), mask=(0, 0), dtype=dt),
+                   mvoid((1, 2), mask=(0, 1), dtype=dt),
+                   mvoid((1, 2), mask=(1, 0), dtype=dt),
+                   mvoid((1, 2), mask=(1, 1), dtype=dt)):
+            ma1 = m1.view(MaskedArray)
+            r1 = ma1.view('2i4')
+            for m2 in (np.array((1, 1), dtype=dt),
+                       mvoid((1, 1), dtype=dt),
+                       mvoid((1, 0), mask=(0, 1), dtype=dt),
+                       mvoid((3, 2), mask=(0, 1), dtype=dt)):
+                ma2 = m2.view(MaskedArray)
+                r2 = ma2.view('2i4')
+                eq_expected = (r1 == r2).all()
+                assert_equal(m1 == m2, eq_expected)
+                assert_equal(m2 == m1, eq_expected)
+                assert_equal(ma1 == m2, eq_expected)
+                assert_equal(m1 == ma2, eq_expected)
+                assert_equal(ma1 == ma2, eq_expected)
+                # Also check it is the same if we do it element by element.
+                el_by_el = [m1[name] == m2[name] for name in dt.names]
+                assert_equal(array(el_by_el, dtype=bool).all(), eq_expected)
+                ne_expected = (r1 != r2).any()
+                assert_equal(m1 != m2, ne_expected)
+                assert_equal(m2 != m1, ne_expected)
+                assert_equal(ma1 != m2, ne_expected)
+                assert_equal(m1 != ma2, ne_expected)
+                assert_equal(ma1 != ma2, ne_expected)
+                el_by_el = [m1[name] != m2[name] for name in dt.names]
+                assert_equal(array(el_by_el, dtype=bool).any(), ne_expected)
+
+    @pytest.mark.parametrize('dt', ['S', 'U'])
+    @pytest.mark.parametrize('fill', [None, 'A'])
+    def test_eq_for_strings(self, dt, fill):
+        # Test the equality of structured arrays
+        a = array(['a', 'b'], dtype=dt, mask=[0, 1], fill_value=fill)
+
+        test = (a == a)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        test = (a == a[0])
+        assert_equal(test.data, [True, False])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        b = array(['a', 'b'], dtype=dt, mask=[1, 0], fill_value=fill)
+        test = (a == b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, True])
+        assert_(test.fill_value == True)
+
+        test = (a[0] == b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (b == a[0])
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+    @pytest.mark.parametrize('dt', ['S', 'U'])
+    @pytest.mark.parametrize('fill', [None, 'A'])
+    def test_ne_for_strings(self, dt, fill):
+        # Test the equality of structured arrays
+        a = array(['a', 'b'], dtype=dt, mask=[0, 1], fill_value=fill)
+
+        test = (a != a)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        test = (a != a[0])
+        assert_equal(test.data, [False, True])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        b = array(['a', 'b'], dtype=dt, mask=[1, 0], fill_value=fill)
+        test = (a != b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, True])
+        assert_(test.fill_value == True)
+
+        test = (a[0] != b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (b != a[0])
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+    @pytest.mark.parametrize('dt1', num_dts, ids=num_ids)
+    @pytest.mark.parametrize('dt2', num_dts, ids=num_ids)
+    @pytest.mark.parametrize('fill', [None, 1])
+    def test_eq_for_numeric(self, dt1, dt2, fill):
+        # Test the equality of structured arrays
+        a = array([0, 1], dtype=dt1, mask=[0, 1], fill_value=fill)
+
+        test = (a == a)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        test = (a == a[0])
+        assert_equal(test.data, [True, False])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        b = array([0, 1], dtype=dt2, mask=[1, 0], fill_value=fill)
+        test = (a == b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, True])
+        assert_(test.fill_value == True)
+
+        test = (a[0] == b)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (b == a[0])
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+    @pytest.mark.parametrize('dt1', num_dts, ids=num_ids)
+    @pytest.mark.parametrize('dt2', num_dts, ids=num_ids)
+    @pytest.mark.parametrize('fill', [None, 1])
+    def test_ne_for_numeric(self, dt1, dt2, fill):
+        # Test the equality of structured arrays
+        a = array([0, 1], dtype=dt1, mask=[0, 1], fill_value=fill)
+
+        test = (a != a)
+        assert_equal(test.data, [False, False])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        test = (a != a[0])
+        assert_equal(test.data, [False, True])
+        assert_equal(test.mask, [False, True])
+        assert_(test.fill_value == True)
+
+        b = array([0, 1], dtype=dt2, mask=[1, 0], fill_value=fill)
+        test = (a != b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, True])
+        assert_(test.fill_value == True)
+
+        test = (a[0] != b)
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+        test = (b != a[0])
+        assert_equal(test.data, [True, True])
+        assert_equal(test.mask, [True, False])
+        assert_(test.fill_value == True)
+
+    def test_eq_with_None(self):
+        # Really, comparisons with None should not be done, but check them
+        # anyway. Note that pep8 will flag these tests.
+        # Deprecation is in place for arrays, and when it happens this
+        # test will fail (and have to be changed accordingly).
+
+        # With partial mask
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning, "Comparison to `None`")
+            a = array([None, 1], mask=[0, 1])
+            assert_equal(a == None, array([True, False], mask=[0, 1]))
+            assert_equal(a.data == None, [True, False])
+            assert_equal(a != None, array([False, True], mask=[0, 1]))
+            # With nomask
+            a = array([None, 1], mask=False)
+            assert_equal(a == None, [True, False])
+            assert_equal(a != None, [False, True])
+            # With complete mask
+            a = array([None, 2], mask=True)
+            assert_equal(a == None, array([False, True], mask=True))
+            assert_equal(a != None, array([True, False], mask=True))
+            # Fully masked, even comparison to None should return "masked"
+            a = masked
+            assert_equal(a == None, masked)
+
+    def test_eq_with_scalar(self):
+        a = array(1)
+        assert_equal(a == 1, True)
+        assert_equal(a == 0, False)
+        assert_equal(a != 1, False)
+        assert_equal(a != 0, True)
+        b = array(1, mask=True)
+        assert_equal(b == 0, masked)
+        assert_equal(b == 1, masked)
+        assert_equal(b != 0, masked)
+        assert_equal(b != 1, masked)
+
+    def test_eq_different_dimensions(self):
+        m1 = array([1, 1], mask=[0, 1])
+        # test comparison with both masked and regular arrays.
+        for m2 in (array([[0, 1], [1, 2]]),
+                   np.array([[0, 1], [1, 2]])):
+            test = (m1 == m2)
+            assert_equal(test.data, [[False, False],
+                                     [True, False]])
+            assert_equal(test.mask, [[False, True],
+                                     [False, True]])
+
+    def test_numpyarithmetics(self):
+        # Check that the mask is not back-propagated when using numpy functions
+        a = masked_array([-1, 0, 1, 2, 3], mask=[0, 0, 0, 0, 1])
+        control = masked_array([np.nan, np.nan, 0, np.log(2), -1],
+                               mask=[1, 1, 0, 0, 1])
+
+        test = log(a)
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        assert_equal(a.mask, [0, 0, 0, 0, 1])
+
+        test = np.log(a)
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        assert_equal(a.mask, [0, 0, 0, 0, 1])
+
+
+class TestMaskedArrayAttributes:
+
+    def test_keepmask(self):
+        # Tests the keep mask flag
+        x = masked_array([1, 2, 3], mask=[1, 0, 0])
+        mx = masked_array(x)
+        assert_equal(mx.mask, x.mask)
+        mx = masked_array(x, mask=[0, 1, 0], keep_mask=False)
+        assert_equal(mx.mask, [0, 1, 0])
+        mx = masked_array(x, mask=[0, 1, 0], keep_mask=True)
+        assert_equal(mx.mask, [1, 1, 0])
+        # We default to true
+        mx = masked_array(x, mask=[0, 1, 0])
+        assert_equal(mx.mask, [1, 1, 0])
+
+    def test_hardmask(self):
+        # Test hard_mask
+        d = arange(5)
+        n = [0, 0, 0, 1, 1]
+        m = make_mask(n)
+        xh = array(d, mask=m, hard_mask=True)
+        # We need to copy, to avoid updating d in xh !
+        xs = array(d, mask=m, hard_mask=False, copy=True)
+        xh[[1, 4]] = [10, 40]
+        xs[[1, 4]] = [10, 40]
+        assert_equal(xh._data, [0, 10, 2, 3, 4])
+        assert_equal(xs._data, [0, 10, 2, 3, 40])
+        assert_equal(xs.mask, [0, 0, 0, 1, 0])
+        assert_(xh._hardmask)
+        assert_(not xs._hardmask)
+        xh[1:4] = [10, 20, 30]
+        xs[1:4] = [10, 20, 30]
+        assert_equal(xh._data, [0, 10, 20, 3, 4])
+        assert_equal(xs._data, [0, 10, 20, 30, 40])
+        assert_equal(xs.mask, nomask)
+        xh[0] = masked
+        xs[0] = masked
+        assert_equal(xh.mask, [1, 0, 0, 1, 1])
+        assert_equal(xs.mask, [1, 0, 0, 0, 0])
+        xh[:] = 1
+        xs[:] = 1
+        assert_equal(xh._data, [0, 1, 1, 3, 4])
+        assert_equal(xs._data, [1, 1, 1, 1, 1])
+        assert_equal(xh.mask, [1, 0, 0, 1, 1])
+        assert_equal(xs.mask, nomask)
+        # Switch to soft mask
+        xh.soften_mask()
+        xh[:] = arange(5)
+        assert_equal(xh._data, [0, 1, 2, 3, 4])
+        assert_equal(xh.mask, nomask)
+        # Switch back to hard mask
+        xh.harden_mask()
+        xh[xh < 3] = masked
+        assert_equal(xh._data, [0, 1, 2, 3, 4])
+        assert_equal(xh._mask, [1, 1, 1, 0, 0])
+        xh[filled(xh > 1, False)] = 5
+        assert_equal(xh._data, [0, 1, 2, 5, 5])
+        assert_equal(xh._mask, [1, 1, 1, 0, 0])
+
+        xh = array([[1, 2], [3, 4]], mask=[[1, 0], [0, 0]], hard_mask=True)
+        xh[0] = 0
+        assert_equal(xh._data, [[1, 0], [3, 4]])
+        assert_equal(xh._mask, [[1, 0], [0, 0]])
+        xh[-1, -1] = 5
+        assert_equal(xh._data, [[1, 0], [3, 5]])
+        assert_equal(xh._mask, [[1, 0], [0, 0]])
+        xh[filled(xh < 5, False)] = 2
+        assert_equal(xh._data, [[1, 2], [2, 5]])
+        assert_equal(xh._mask, [[1, 0], [0, 0]])
+
+    def test_hardmask_again(self):
+        # Another test of hardmask
+        d = arange(5)
+        n = [0, 0, 0, 1, 1]
+        m = make_mask(n)
+        xh = array(d, mask=m, hard_mask=True)
+        xh[4:5] = 999
+        xh[0:1] = 999
+        assert_equal(xh._data, [999, 1, 2, 3, 4])
+
+    def test_hardmask_oncemore_yay(self):
+        # OK, yet another test of hardmask
+        # Make sure that harden_mask/soften_mask//unshare_mask returns self
+        a = array([1, 2, 3], mask=[1, 0, 0])
+        b = a.harden_mask()
+        assert_equal(a, b)
+        b[0] = 0
+        assert_equal(a, b)
+        assert_equal(b, array([1, 2, 3], mask=[1, 0, 0]))
+        a = b.soften_mask()
+        a[0] = 0
+        assert_equal(a, b)
+        assert_equal(b, array([0, 2, 3], mask=[0, 0, 0]))
+
+    def test_smallmask(self):
+        # Checks the behaviour of _smallmask
+        a = arange(10)
+        a[1] = masked
+        a[1] = 1
+        assert_equal(a._mask, nomask)
+        a = arange(10)
+        a._smallmask = False
+        a[1] = masked
+        a[1] = 1
+        assert_equal(a._mask, zeros(10))
+
+    def test_shrink_mask(self):
+        # Tests .shrink_mask()
+        a = array([1, 2, 3], mask=[0, 0, 0])
+        b = a.shrink_mask()
+        assert_equal(a, b)
+        assert_equal(a.mask, nomask)
+
+        # Mask cannot be shrunk on structured types, so is a no-op
+        a = np.ma.array([(1, 2.0)], [('a', int), ('b', float)])
+        b = a.copy()
+        a.shrink_mask()
+        assert_equal(a.mask, b.mask)
+
+    def test_flat(self):
+        # Test that flat can return all types of items [#4585, #4615]
+        # test 2-D record array
+        # ... on structured array w/ masked records
+        x = array([[(1, 1.1, 'one'), (2, 2.2, 'two'), (3, 3.3, 'thr')],
+                   [(4, 4.4, 'fou'), (5, 5.5, 'fiv'), (6, 6.6, 'six')]],
+                  dtype=[('a', int), ('b', float), ('c', '|S8')])
+        x['a'][0, 1] = masked
+        x['b'][1, 0] = masked
+        x['c'][0, 2] = masked
+        x[-1, -1] = masked
+        xflat = x.flat
+        assert_equal(xflat[0], x[0, 0])
+        assert_equal(xflat[1], x[0, 1])
+        assert_equal(xflat[2], x[0, 2])
+        assert_equal(xflat[:3], x[0])
+        assert_equal(xflat[3], x[1, 0])
+        assert_equal(xflat[4], x[1, 1])
+        assert_equal(xflat[5], x[1, 2])
+        assert_equal(xflat[3:], x[1])
+        assert_equal(xflat[-1], x[-1, -1])
+        i = 0
+        j = 0
+        for xf in xflat:
+            assert_equal(xf, x[j, i])
+            i += 1
+            if i >= x.shape[-1]:
+                i = 0
+                j += 1
+
+    def test_assign_dtype(self):
+        # check that the mask's dtype is updated when dtype is changed
+        a = np.zeros(4, dtype='f4,i4')
+
+        m = np.ma.array(a)
+        m.dtype = np.dtype('f4')
+        repr(m)  # raises?
+        assert_equal(m.dtype, np.dtype('f4'))
+
+        # check that dtype changes that change shape of mask too much
+        # are not allowed
+        def assign():
+            m = np.ma.array(a)
+            m.dtype = np.dtype('f8')
+        assert_raises(ValueError, assign)
+
+        b = a.view(dtype='f4', type=np.ma.MaskedArray)  # raises?
+        assert_equal(b.dtype, np.dtype('f4'))
+
+        # check that nomask is preserved
+        a = np.zeros(4, dtype='f4')
+        m = np.ma.array(a)
+        m.dtype = np.dtype('f4,i4')
+        assert_equal(m.dtype, np.dtype('f4,i4'))
+        assert_equal(m._mask, np.ma.nomask)
+
+
+class TestFillingValues:
+
+    def test_check_on_scalar(self):
+        # Test _check_fill_value set to valid and invalid values
+        _check_fill_value = np.ma.core._check_fill_value
+
+        fval = _check_fill_value(0, int)
+        assert_equal(fval, 0)
+        fval = _check_fill_value(None, int)
+        assert_equal(fval, default_fill_value(0))
+
+        fval = _check_fill_value(0, "|S3")
+        assert_equal(fval, b"0")
+        fval = _check_fill_value(None, "|S3")
+        assert_equal(fval, default_fill_value(b"camelot!"))
+        assert_raises(TypeError, _check_fill_value, 1e+20, int)
+        assert_raises(TypeError, _check_fill_value, 'stuff', int)
+
+    def test_check_on_fields(self):
+        # Tests _check_fill_value with records
+        _check_fill_value = np.ma.core._check_fill_value
+        ndtype = [('a', int), ('b', float), ('c', "|S3")]
+        # A check on a list should return a single record
+        fval = _check_fill_value([-999, -12345678.9, "???"], ndtype)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), [-999, -12345678.9, b"???"])
+        # A check on None should output the defaults
+        fval = _check_fill_value(None, ndtype)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), [default_fill_value(0),
+                                   default_fill_value(0.),
+                                   asbytes(default_fill_value("0"))])
+        #.....Using a structured type as fill_value should work
+        fill_val = np.array((-999, -12345678.9, "???"), dtype=ndtype)
+        fval = _check_fill_value(fill_val, ndtype)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), [-999, -12345678.9, b"???"])
+
+        #.....Using a flexible type w/ a different type shouldn't matter
+        # BEHAVIOR in 1.5 and earlier, and 1.13 and later: match structured
+        # types by position
+        fill_val = np.array((-999, -12345678.9, "???"),
+                            dtype=[("A", int), ("B", float), ("C", "|S3")])
+        fval = _check_fill_value(fill_val, ndtype)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), [-999, -12345678.9, b"???"])
+
+        #.....Using an object-array shouldn't matter either
+        fill_val = np.ndarray(shape=(1,), dtype=object)
+        fill_val[0] = (-999, -12345678.9, b"???")
+        fval = _check_fill_value(fill_val, object)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), [-999, -12345678.9, b"???"])
+        # NOTE: This test was never run properly as "fill_value" rather than
+        # "fill_val" was assigned.  Written properly, it fails.
+        #fill_val = np.array((-999, -12345678.9, "???"))
+        #fval = _check_fill_value(fill_val, ndtype)
+        #assert_(isinstance(fval, ndarray))
+        #assert_equal(fval.item(), [-999, -12345678.9, b"???"])
+        #.....One-field-only flexible type should work as well
+        ndtype = [("a", int)]
+        fval = _check_fill_value(-999999999, ndtype)
+        assert_(isinstance(fval, ndarray))
+        assert_equal(fval.item(), (-999999999,))
+
+    def test_fillvalue_conversion(self):
+        # Tests the behavior of fill_value during conversion
+        # We had a tailored comment to make sure special attributes are
+        # properly dealt with
+        a = array([b'3', b'4', b'5'])
+        a._optinfo.update({'comment':"updated!"})
+
+        b = array(a, dtype=int)
+        assert_equal(b._data, [3, 4, 5])
+        assert_equal(b.fill_value, default_fill_value(0))
+
+        b = array(a, dtype=float)
+        assert_equal(b._data, [3, 4, 5])
+        assert_equal(b.fill_value, default_fill_value(0.))
+
+        b = a.astype(int)
+        assert_equal(b._data, [3, 4, 5])
+        assert_equal(b.fill_value, default_fill_value(0))
+        assert_equal(b._optinfo['comment'], "updated!")
+
+        b = a.astype([('a', '|S3')])
+        assert_equal(b['a']._data, a._data)
+        assert_equal(b['a'].fill_value, a.fill_value)
+
+    def test_default_fill_value(self):
+        # check all calling conventions
+        f1 = default_fill_value(1.)
+        f2 = default_fill_value(np.array(1.))
+        f3 = default_fill_value(np.array(1.).dtype)
+        assert_equal(f1, f2)
+        assert_equal(f1, f3)
+
+    def test_default_fill_value_structured(self):
+        fields = array([(1, 1, 1)],
+                      dtype=[('i', int), ('s', '|S8'), ('f', float)])
+
+        f1 = default_fill_value(fields)
+        f2 = default_fill_value(fields.dtype)
+        expected = np.array((default_fill_value(0),
+                             default_fill_value('0'),
+                             default_fill_value(0.)), dtype=fields.dtype)
+        assert_equal(f1, expected)
+        assert_equal(f2, expected)
+
+    def test_default_fill_value_void(self):
+        dt = np.dtype([('v', 'V7')])
+        f = default_fill_value(dt)
+        assert_equal(f['v'], np.array(default_fill_value(dt['v']), dt['v']))
+
+    def test_fillvalue(self):
+        # Yet more fun with the fill_value
+        data = masked_array([1, 2, 3], fill_value=-999)
+        series = data[[0, 2, 1]]
+        assert_equal(series._fill_value, data._fill_value)
+
+        mtype = [('f', float), ('s', '|S3')]
+        x = array([(1, 'a'), (2, 'b'), (pi, 'pi')], dtype=mtype)
+        x.fill_value = 999
+        assert_equal(x.fill_value.item(), [999., b'999'])
+        assert_equal(x['f'].fill_value, 999)
+        assert_equal(x['s'].fill_value, b'999')
+
+        x.fill_value = (9, '???')
+        assert_equal(x.fill_value.item(), (9, b'???'))
+        assert_equal(x['f'].fill_value, 9)
+        assert_equal(x['s'].fill_value, b'???')
+
+        x = array([1, 2, 3.1])
+        x.fill_value = 999
+        assert_equal(np.asarray(x.fill_value).dtype, float)
+        assert_equal(x.fill_value, 999.)
+        assert_equal(x._fill_value, np.array(999.))
+
+    def test_subarray_fillvalue(self):
+        # gh-10483   test multi-field index fill value
+        fields = array([(1, 1, 1)],
+                      dtype=[('i', int), ('s', '|S8'), ('f', float)])
+        with suppress_warnings() as sup:
+            sup.filter(FutureWarning, "Numpy has detected")
+            subfields = fields[['i', 'f']]
+            assert_equal(tuple(subfields.fill_value), (999999, 1.e+20))
+            # test comparison does not raise:
+            subfields[1:] == subfields[:-1]
+
+    def test_fillvalue_exotic_dtype(self):
+        # Tests yet more exotic flexible dtypes
+        _check_fill_value = np.ma.core._check_fill_value
+        ndtype = [('i', int), ('s', '|S8'), ('f', float)]
+        control = np.array((default_fill_value(0),
+                            default_fill_value('0'),
+                            default_fill_value(0.),),
+                           dtype=ndtype)
+        assert_equal(_check_fill_value(None, ndtype), control)
+        # The shape shouldn't matter
+        ndtype = [('f0', float, (2, 2))]
+        control = np.array((default_fill_value(0.),),
+                           dtype=[('f0', float)]).astype(ndtype)
+        assert_equal(_check_fill_value(None, ndtype), control)
+        control = np.array((0,), dtype=[('f0', float)]).astype(ndtype)
+        assert_equal(_check_fill_value(0, ndtype), control)
+
+        ndtype = np.dtype("int, (2,3)float, float")
+        control = np.array((default_fill_value(0),
+                            default_fill_value(0.),
+                            default_fill_value(0.),),
+                           dtype="int, float, float").astype(ndtype)
+        test = _check_fill_value(None, ndtype)
+        assert_equal(test, control)
+        control = np.array((0, 0, 0), dtype="int, float, float").astype(ndtype)
+        assert_equal(_check_fill_value(0, ndtype), control)
+        # but when indexing, fill value should become scalar not tuple
+        # See issue #6723
+        M = masked_array(control)
+        assert_equal(M["f1"].fill_value.ndim, 0)
+
+    def test_fillvalue_datetime_timedelta(self):
+        # Test default fillvalue for datetime64 and timedelta64 types.
+        # See issue #4476, this would return '?' which would cause errors
+        # elsewhere
+
+        for timecode in ("as", "fs", "ps", "ns", "us", "ms", "s", "m",
+                         "h", "D", "W", "M", "Y"):
+            control = numpy.datetime64("NaT", timecode)
+            test = default_fill_value(numpy.dtype("<M8[" + timecode + "]"))
+            np.testing.assert_equal(test, control)
+
+            control = numpy.timedelta64("NaT", timecode)
+            test = default_fill_value(numpy.dtype("<m8[" + timecode + "]"))
+            np.testing.assert_equal(test, control)
+
+    def test_extremum_fill_value(self):
+        # Tests extremum fill values for flexible type.
+        a = array([(1, (2, 3)), (4, (5, 6))],
+                  dtype=[('A', int), ('B', [('BA', int), ('BB', int)])])
+        test = a.fill_value
+        assert_equal(test.dtype, a.dtype)
+        assert_equal(test['A'], default_fill_value(a['A']))
+        assert_equal(test['B']['BA'], default_fill_value(a['B']['BA']))
+        assert_equal(test['B']['BB'], default_fill_value(a['B']['BB']))
+
+        test = minimum_fill_value(a)
+        assert_equal(test.dtype, a.dtype)
+        assert_equal(test[0], minimum_fill_value(a['A']))
+        assert_equal(test[1][0], minimum_fill_value(a['B']['BA']))
+        assert_equal(test[1][1], minimum_fill_value(a['B']['BB']))
+        assert_equal(test[1], minimum_fill_value(a['B']))
+
+        test = maximum_fill_value(a)
+        assert_equal(test.dtype, a.dtype)
+        assert_equal(test[0], maximum_fill_value(a['A']))
+        assert_equal(test[1][0], maximum_fill_value(a['B']['BA']))
+        assert_equal(test[1][1], maximum_fill_value(a['B']['BB']))
+        assert_equal(test[1], maximum_fill_value(a['B']))
+
+    def test_extremum_fill_value_subdtype(self):
+        a = array(([2, 3, 4],), dtype=[('value', np.int8, 3)])
+
+        test = minimum_fill_value(a)
+        assert_equal(test.dtype, a.dtype)
+        assert_equal(test[0], np.full(3, minimum_fill_value(a['value'])))
+
+        test = maximum_fill_value(a)
+        assert_equal(test.dtype, a.dtype)
+        assert_equal(test[0], np.full(3, maximum_fill_value(a['value'])))
+
+    def test_fillvalue_individual_fields(self):
+        # Test setting fill_value on individual fields
+        ndtype = [('a', int), ('b', int)]
+        # Explicit fill_value
+        a = array(list(zip([1, 2, 3], [4, 5, 6])),
+                  fill_value=(-999, -999), dtype=ndtype)
+        aa = a['a']
+        aa.set_fill_value(10)
+        assert_equal(aa._fill_value, np.array(10))
+        assert_equal(tuple(a.fill_value), (10, -999))
+        a.fill_value['b'] = -10
+        assert_equal(tuple(a.fill_value), (10, -10))
+        # Implicit fill_value
+        t = array(list(zip([1, 2, 3], [4, 5, 6])), dtype=ndtype)
+        tt = t['a']
+        tt.set_fill_value(10)
+        assert_equal(tt._fill_value, np.array(10))
+        assert_equal(tuple(t.fill_value), (10, default_fill_value(0)))
+
+    def test_fillvalue_implicit_structured_array(self):
+        # Check that fill_value is always defined for structured arrays
+        ndtype = ('b', float)
+        adtype = ('a', float)
+        a = array([(1.,), (2.,)], mask=[(False,), (False,)],
+                  fill_value=(np.nan,), dtype=np.dtype([adtype]))
+        b = empty(a.shape, dtype=[adtype, ndtype])
+        b['a'] = a['a']
+        b['a'].set_fill_value(a['a'].fill_value)
+        f = b._fill_value[()]
+        assert_(np.isnan(f[0]))
+        assert_equal(f[-1], default_fill_value(1.))
+
+    def test_fillvalue_as_arguments(self):
+        # Test adding a fill_value parameter to empty/ones/zeros
+        a = empty(3, fill_value=999.)
+        assert_equal(a.fill_value, 999.)
+
+        a = ones(3, fill_value=999., dtype=float)
+        assert_equal(a.fill_value, 999.)
+
+        a = zeros(3, fill_value=0., dtype=complex)
+        assert_equal(a.fill_value, 0.)
+
+        a = identity(3, fill_value=0., dtype=complex)
+        assert_equal(a.fill_value, 0.)
+
+    def test_shape_argument(self):
+        # Test that shape can be provides as an argument
+        # GH issue 6106
+        a = empty(shape=(3, ))
+        assert_equal(a.shape, (3, ))
+
+        a = ones(shape=(3, ), dtype=float)
+        assert_equal(a.shape, (3, ))
+
+        a = zeros(shape=(3, ), dtype=complex)
+        assert_equal(a.shape, (3, ))
+
+    def test_fillvalue_in_view(self):
+        # Test the behavior of fill_value in view
+
+        # Create initial masked array
+        x = array([1, 2, 3], fill_value=1, dtype=np.int64)
+
+        # Check that fill_value is preserved by default
+        y = x.view()
+        assert_(y.fill_value == 1)
+
+        # Check that fill_value is preserved if dtype is specified and the
+        # dtype is an ndarray sub-class and has a _fill_value attribute
+        y = x.view(MaskedArray)
+        assert_(y.fill_value == 1)
+
+        # Check that fill_value is preserved if type is specified and the
+        # dtype is an ndarray sub-class and has a _fill_value attribute (by
+        # default, the first argument is dtype, not type)
+        y = x.view(type=MaskedArray)
+        assert_(y.fill_value == 1)
+
+        # Check that code does not crash if passed an ndarray sub-class that
+        # does not have a _fill_value attribute
+        y = x.view(np.ndarray)
+        y = x.view(type=np.ndarray)
+
+        # Check that fill_value can be overridden with view
+        y = x.view(MaskedArray, fill_value=2)
+        assert_(y.fill_value == 2)
+
+        # Check that fill_value can be overridden with view (using type=)
+        y = x.view(type=MaskedArray, fill_value=2)
+        assert_(y.fill_value == 2)
+
+        # Check that fill_value gets reset if passed a dtype but not a
+        # fill_value. This is because even though in some cases one can safely
+        # cast the fill_value, e.g. if taking an int64 view of an int32 array,
+        # in other cases, this cannot be done (e.g. int32 view of an int64
+        # array with a large fill_value).
+        y = x.view(dtype=np.int32)
+        assert_(y.fill_value == 999999)
+
+    def test_fillvalue_bytes_or_str(self):
+        # Test whether fill values work as expected for structured dtypes
+        # containing bytes or str.  See issue #7259.
+        a = empty(shape=(3, ), dtype="(2)3S,(2)3U")
+        assert_equal(a["f0"].fill_value, default_fill_value(b"spam"))
+        assert_equal(a["f1"].fill_value, default_fill_value("eggs"))
+
+
+class TestUfuncs:
+    # Test class for the application of ufuncs on MaskedArrays.
+
+    def setup(self):
+        # Base data definition.
+        self.d = (array([1.0, 0, -1, pi / 2] * 2, mask=[0, 1] + [0] * 6),
+                  array([1.0, 0, -1, pi / 2] * 2, mask=[1, 0] + [0] * 6),)
+        self.err_status = np.geterr()
+        np.seterr(divide='ignore', invalid='ignore')
+
+    def teardown(self):
+        np.seterr(**self.err_status)
+
+    def test_testUfuncRegression(self):
+        # Tests new ufuncs on MaskedArrays.
+        for f in ['sqrt', 'log', 'log10', 'exp', 'conjugate',
+                  'sin', 'cos', 'tan',
+                  'arcsin', 'arccos', 'arctan',
+                  'sinh', 'cosh', 'tanh',
+                  'arcsinh',
+                  'arccosh',
+                  'arctanh',
+                  'absolute', 'fabs', 'negative',
+                  'floor', 'ceil',
+                  'logical_not',
+                  'add', 'subtract', 'multiply',
+                  'divide', 'true_divide', 'floor_divide',
+                  'remainder', 'fmod', 'hypot', 'arctan2',
+                  'equal', 'not_equal', 'less_equal', 'greater_equal',
+                  'less', 'greater',
+                  'logical_and', 'logical_or', 'logical_xor',
+                  ]:
+            try:
+                uf = getattr(umath, f)
+            except AttributeError:
+                uf = getattr(fromnumeric, f)
+            mf = getattr(numpy.ma.core, f)
+            args = self.d[:uf.nin]
+            ur = uf(*args)
+            mr = mf(*args)
+            assert_equal(ur.filled(0), mr.filled(0), f)
+            assert_mask_equal(ur.mask, mr.mask, err_msg=f)
+
+    def test_reduce(self):
+        # Tests reduce on MaskedArrays.
+        a = self.d[0]
+        assert_(not alltrue(a, axis=0))
+        assert_(sometrue(a, axis=0))
+        assert_equal(sum(a[:3], axis=0), 0)
+        assert_equal(product(a, axis=0), 0)
+        assert_equal(add.reduce(a), pi)
+
+    def test_minmax(self):
+        # Tests extrema on MaskedArrays.
+        a = arange(1, 13).reshape(3, 4)
+        amask = masked_where(a < 5, a)
+        assert_equal(amask.max(), a.max())
+        assert_equal(amask.min(), 5)
+        assert_equal(amask.max(0), a.max(0))
+        assert_equal(amask.min(0), [5, 6, 7, 8])
+        assert_(amask.max(1)[0].mask)
+        assert_(amask.min(1)[0].mask)
+
+    def test_ndarray_mask(self):
+        # Check that the mask of the result is a ndarray (not a MaskedArray...)
+        a = masked_array([-1, 0, 1, 2, 3], mask=[0, 0, 0, 0, 1])
+        test = np.sqrt(a)
+        control = masked_array([-1, 0, 1, np.sqrt(2), -1],
+                               mask=[1, 0, 0, 0, 1])
+        assert_equal(test, control)
+        assert_equal(test.mask, control.mask)
+        assert_(not isinstance(test.mask, MaskedArray))
+
+    def test_treatment_of_NotImplemented(self):
+        # Check that NotImplemented is returned at appropriate places
+
+        a = masked_array([1., 2.], mask=[1, 0])
+        assert_raises(TypeError, operator.mul, a, "abc")
+        assert_raises(TypeError, operator.truediv, a, "abc")
+
+        class MyClass:
+            __array_priority__ = a.__array_priority__ + 1
+
+            def __mul__(self, other):
+                return "My mul"
+
+            def __rmul__(self, other):
+                return "My rmul"
+
+        me = MyClass()
+        assert_(me * a == "My mul")
+        assert_(a * me == "My rmul")
+
+        # and that __array_priority__ is respected
+        class MyClass2:
+            __array_priority__ = 100
+
+            def __mul__(self, other):
+                return "Me2mul"
+
+            def __rmul__(self, other):
+                return "Me2rmul"
+
+            def __rdiv__(self, other):
+                return "Me2rdiv"
+
+            __rtruediv__ = __rdiv__
+
+        me_too = MyClass2()
+        assert_(a.__mul__(me_too) is NotImplemented)
+        assert_(all(multiply.outer(a, me_too) == "Me2rmul"))
+        assert_(a.__truediv__(me_too) is NotImplemented)
+        assert_(me_too * a == "Me2mul")
+        assert_(a * me_too == "Me2rmul")
+        assert_(a / me_too == "Me2rdiv")
+
+    def test_no_masked_nan_warnings(self):
+        # check that a nan in masked position does not
+        # cause ufunc warnings
+
+        m = np.ma.array([0.5, np.nan], mask=[0,1])
+
+        with warnings.catch_warnings():
+            warnings.filterwarnings("error")
+
+            # test unary and binary ufuncs
+            exp(m)
+            add(m, 1)
+            m > 0
+
+            # test different unary domains
+            sqrt(m)
+            log(m)
+            tan(m)
+            arcsin(m)
+            arccos(m)
+            arccosh(m)
+
+            # test binary domains
+            divide(m, 2)
+
+            # also check that allclose uses ma ufuncs, to avoid warning
+            allclose(m, 0.5)
+
+class TestMaskedArrayInPlaceArithmetics:
+    # Test MaskedArray Arithmetics
+
+    def setup(self):
+        x = arange(10)
+        y = arange(10)
+        xm = arange(10)
+        xm[2] = masked
+        self.intdata = (x, y, xm)
+        self.floatdata = (x.astype(float), y.astype(float), xm.astype(float))
+        self.othertypes = np.typecodes['AllInteger'] + np.typecodes['AllFloat']
+        self.othertypes = [np.dtype(_).type for _ in self.othertypes]
+        self.uint8data = (
+            x.astype(np.uint8),
+            y.astype(np.uint8),
+            xm.astype(np.uint8)
+        )
+
+    def test_inplace_addition_scalar(self):
+        # Test of inplace additions
+        (x, y, xm) = self.intdata
+        xm[2] = masked
+        x += 1
+        assert_equal(x, y + 1)
+        xm += 1
+        assert_equal(xm, y + 1)
+
+        (x, _, xm) = self.floatdata
+        id1 = x.data.ctypes.data
+        x += 1.
+        assert_(id1 == x.data.ctypes.data)
+        assert_equal(x, y + 1.)
+
+    def test_inplace_addition_array(self):
+        # Test of inplace additions
+        (x, y, xm) = self.intdata
+        m = xm.mask
+        a = arange(10, dtype=np.int16)
+        a[-1] = masked
+        x += a
+        xm += a
+        assert_equal(x, y + a)
+        assert_equal(xm, y + a)
+        assert_equal(xm.mask, mask_or(m, a.mask))
+
+    def test_inplace_subtraction_scalar(self):
+        # Test of inplace subtractions
+        (x, y, xm) = self.intdata
+        x -= 1
+        assert_equal(x, y - 1)
+        xm -= 1
+        assert_equal(xm, y - 1)
+
+    def test_inplace_subtraction_array(self):
+        # Test of inplace subtractions
+        (x, y, xm) = self.floatdata
+        m = xm.mask
+        a = arange(10, dtype=float)
+        a[-1] = masked
+        x -= a
+        xm -= a
+        assert_equal(x, y - a)
+        assert_equal(xm, y - a)
+        assert_equal(xm.mask, mask_or(m, a.mask))
+
+    def test_inplace_multiplication_scalar(self):
+        # Test of inplace multiplication
+        (x, y, xm) = self.floatdata
+        x *= 2.0
+        assert_equal(x, y * 2)
+        xm *= 2.0
+        assert_equal(xm, y * 2)
+
+    def test_inplace_multiplication_array(self):
+        # Test of inplace multiplication
+        (x, y, xm) = self.floatdata
+        m = xm.mask
+        a = arange(10, dtype=float)
+        a[-1] = masked
+        x *= a
+        xm *= a
+        assert_equal(x, y * a)
+        assert_equal(xm, y * a)
+        assert_equal(xm.mask, mask_or(m, a.mask))
+
+    def test_inplace_division_scalar_int(self):
+        # Test of inplace division
+        (x, y, xm) = self.intdata
+        x = arange(10) * 2
+        xm = arange(10) * 2
+        xm[2] = masked
+        x //= 2
+        assert_equal(x, y)
+        xm //= 2
+        assert_equal(xm, y)
+
+    def test_inplace_division_scalar_float(self):
+        # Test of inplace division
+        (x, y, xm) = self.floatdata
+        x /= 2.0
+        assert_equal(x, y / 2.0)
+        xm /= arange(10)
+        assert_equal(xm, ones((10,)))
+
+    def test_inplace_division_array_float(self):
+        # Test of inplace division
+        (x, y, xm) = self.floatdata
+        m = xm.mask
+        a = arange(10, dtype=float)
+        a[-1] = masked
+        x /= a
+        xm /= a
+        assert_equal(x, y / a)
+        assert_equal(xm, y / a)
+        assert_equal(xm.mask, mask_or(mask_or(m, a.mask), (a == 0)))
+
+    def test_inplace_division_misc(self):
+
+        x = [1., 1., 1., -2., pi / 2., 4., 5., -10., 10., 1., 2., 3.]
+        y = [5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.]
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = masked_array(x, mask=m1)
+        ym = masked_array(y, mask=m2)
+
+        z = xm / ym
+        assert_equal(z._mask, [1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1])
+        assert_equal(z._data,
+                     [1., 1., 1., -1., -pi / 2., 4., 5., 1., 1., 1., 2., 3.])
+
+        xm = xm.copy()
+        xm /= ym
+        assert_equal(xm._mask, [1, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1])
+        assert_equal(z._data,
+                     [1., 1., 1., -1., -pi / 2., 4., 5., 1., 1., 1., 2., 3.])
+
+    def test_datafriendly_add(self):
+        # Test keeping data w/ (inplace) addition
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        # Test add w/ scalar
+        xx = x + 1
+        assert_equal(xx.data, [2, 3, 3])
+        assert_equal(xx.mask, [0, 0, 1])
+        # Test iadd w/ scalar
+        x += 1
+        assert_equal(x.data, [2, 3, 3])
+        assert_equal(x.mask, [0, 0, 1])
+        # Test add w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x + array([1, 2, 3], mask=[1, 0, 0])
+        assert_equal(xx.data, [1, 4, 3])
+        assert_equal(xx.mask, [1, 0, 1])
+        # Test iadd w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        x += array([1, 2, 3], mask=[1, 0, 0])
+        assert_equal(x.data, [1, 4, 3])
+        assert_equal(x.mask, [1, 0, 1])
+
+    def test_datafriendly_sub(self):
+        # Test keeping data w/ (inplace) subtraction
+        # Test sub w/ scalar
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x - 1
+        assert_equal(xx.data, [0, 1, 3])
+        assert_equal(xx.mask, [0, 0, 1])
+        # Test isub w/ scalar
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        x -= 1
+        assert_equal(x.data, [0, 1, 3])
+        assert_equal(x.mask, [0, 0, 1])
+        # Test sub w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x - array([1, 2, 3], mask=[1, 0, 0])
+        assert_equal(xx.data, [1, 0, 3])
+        assert_equal(xx.mask, [1, 0, 1])
+        # Test isub w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        x -= array([1, 2, 3], mask=[1, 0, 0])
+        assert_equal(x.data, [1, 0, 3])
+        assert_equal(x.mask, [1, 0, 1])
+
+    def test_datafriendly_mul(self):
+        # Test keeping data w/ (inplace) multiplication
+        # Test mul w/ scalar
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x * 2
+        assert_equal(xx.data, [2, 4, 3])
+        assert_equal(xx.mask, [0, 0, 1])
+        # Test imul w/ scalar
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        x *= 2
+        assert_equal(x.data, [2, 4, 3])
+        assert_equal(x.mask, [0, 0, 1])
+        # Test mul w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x * array([10, 20, 30], mask=[1, 0, 0])
+        assert_equal(xx.data, [1, 40, 3])
+        assert_equal(xx.mask, [1, 0, 1])
+        # Test imul w/ array
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        x *= array([10, 20, 30], mask=[1, 0, 0])
+        assert_equal(x.data, [1, 40, 3])
+        assert_equal(x.mask, [1, 0, 1])
+
+    def test_datafriendly_div(self):
+        # Test keeping data w/ (inplace) division
+        # Test div on scalar
+        x = array([1, 2, 3], mask=[0, 0, 1])
+        xx = x / 2.
+        assert_equal(xx.data, [1 / 2., 2 / 2., 3])
+        assert_equal(xx.mask, [0, 0, 1])
+        # Test idiv on scalar
+        x = array([1., 2., 3.], mask=[0, 0, 1])
+        x /= 2.
+        assert_equal(x.data, [1 / 2., 2 / 2., 3])
+        assert_equal(x.mask, [0, 0, 1])
+        # Test div on array
+        x = array([1., 2., 3.], mask=[0, 0, 1])
+        xx = x / array([10., 20., 30.], mask=[1, 0, 0])
+        assert_equal(xx.data, [1., 2. / 20., 3.])
+        assert_equal(xx.mask, [1, 0, 1])
+        # Test idiv on array
+        x = array([1., 2., 3.], mask=[0, 0, 1])
+        x /= array([10., 20., 30.], mask=[1, 0, 0])
+        assert_equal(x.data, [1., 2 / 20., 3.])
+        assert_equal(x.mask, [1, 0, 1])
+
+    def test_datafriendly_pow(self):
+        # Test keeping data w/ (inplace) power
+        # Test pow on scalar
+        x = array([1., 2., 3.], mask=[0, 0, 1])
+        xx = x ** 2.5
+        assert_equal(xx.data, [1., 2. ** 2.5, 3.])
+        assert_equal(xx.mask, [0, 0, 1])
+        # Test ipow on scalar
+        x **= 2.5
+        assert_equal(x.data, [1., 2. ** 2.5, 3])
+        assert_equal(x.mask, [0, 0, 1])
+
+    def test_datafriendly_add_arrays(self):
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 0])
+        a += b
+        assert_equal(a, [[2, 2], [4, 4]])
+        if a.mask is not nomask:
+            assert_equal(a.mask, [[0, 0], [0, 0]])
+
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 1])
+        a += b
+        assert_equal(a, [[2, 2], [4, 4]])
+        assert_equal(a.mask, [[0, 1], [0, 1]])
+
+    def test_datafriendly_sub_arrays(self):
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 0])
+        a -= b
+        assert_equal(a, [[0, 0], [2, 2]])
+        if a.mask is not nomask:
+            assert_equal(a.mask, [[0, 0], [0, 0]])
+
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 1])
+        a -= b
+        assert_equal(a, [[0, 0], [2, 2]])
+        assert_equal(a.mask, [[0, 1], [0, 1]])
+
+    def test_datafriendly_mul_arrays(self):
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 0])
+        a *= b
+        assert_equal(a, [[1, 1], [3, 3]])
+        if a.mask is not nomask:
+            assert_equal(a.mask, [[0, 0], [0, 0]])
+
+        a = array([[1, 1], [3, 3]])
+        b = array([1, 1], mask=[0, 1])
+        a *= b
+        assert_equal(a, [[1, 1], [3, 3]])
+        assert_equal(a.mask, [[0, 1], [0, 1]])
+
+    def test_inplace_addition_scalar_type(self):
+        # Test of inplace additions
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                xm[2] = masked
+                x += t(1)
+                assert_equal(x, y + t(1))
+                xm += t(1)
+                assert_equal(xm, y + t(1))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_addition_array_type(self):
+        # Test of inplace additions
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                m = xm.mask
+                a = arange(10, dtype=t)
+                a[-1] = masked
+                x += a
+                xm += a
+                assert_equal(x, y + a)
+                assert_equal(xm, y + a)
+                assert_equal(xm.mask, mask_or(m, a.mask))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_subtraction_scalar_type(self):
+        # Test of inplace subtractions
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                x -= t(1)
+                assert_equal(x, y - t(1))
+                xm -= t(1)
+                assert_equal(xm, y - t(1))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_subtraction_array_type(self):
+        # Test of inplace subtractions
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                m = xm.mask
+                a = arange(10, dtype=t)
+                a[-1] = masked
+                x -= a
+                xm -= a
+                assert_equal(x, y - a)
+                assert_equal(xm, y - a)
+                assert_equal(xm.mask, mask_or(m, a.mask))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_multiplication_scalar_type(self):
+        # Test of inplace multiplication
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                x *= t(2)
+                assert_equal(x, y * t(2))
+                xm *= t(2)
+                assert_equal(xm, y * t(2))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_multiplication_array_type(self):
+        # Test of inplace multiplication
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                m = xm.mask
+                a = arange(10, dtype=t)
+                a[-1] = masked
+                x *= a
+                xm *= a
+                assert_equal(x, y * a)
+                assert_equal(xm, y * a)
+                assert_equal(xm.mask, mask_or(m, a.mask))
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_floor_division_scalar_type(self):
+        # Test of inplace division
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                x = arange(10, dtype=t) * t(2)
+                xm = arange(10, dtype=t) * t(2)
+                xm[2] = masked
+                x //= t(2)
+                xm //= t(2)
+                assert_equal(x, y)
+                assert_equal(xm, y)
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_floor_division_array_type(self):
+        # Test of inplace division
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                m = xm.mask
+                a = arange(10, dtype=t)
+                a[-1] = masked
+                x //= a
+                xm //= a
+                assert_equal(x, y // a)
+                assert_equal(xm, y // a)
+                assert_equal(
+                    xm.mask,
+                    mask_or(mask_or(m, a.mask), (a == t(0)))
+                )
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+    def test_inplace_division_scalar_type(self):
+        # Test of inplace division
+        for t in self.othertypes:
+            with suppress_warnings() as sup:
+                sup.record(UserWarning)
+
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                x = arange(10, dtype=t) * t(2)
+                xm = arange(10, dtype=t) * t(2)
+                xm[2] = masked
+
+                # May get a DeprecationWarning or a TypeError.
+                #
+                # This is a consequence of the fact that this is true divide
+                # and will require casting to float for calculation and
+                # casting back to the original type. This will only be raised
+                # with integers. Whether it is an error or warning is only
+                # dependent on how stringent the casting rules are.
+                #
+                # Will handle the same way.
+                try:
+                    x /= t(2)
+                    assert_equal(x, y)
+                except (DeprecationWarning, TypeError) as e:
+                    warnings.warn(str(e), stacklevel=1)
+                try:
+                    xm /= t(2)
+                    assert_equal(xm, y)
+                except (DeprecationWarning, TypeError) as e:
+                    warnings.warn(str(e), stacklevel=1)
+
+                if issubclass(t, np.integer):
+                    assert_equal(len(sup.log), 2, "Failed on type=%s." % t)
+                else:
+                    assert_equal(len(sup.log), 0, "Failed on type=%s." % t)
+
+    def test_inplace_division_array_type(self):
+        # Test of inplace division
+        for t in self.othertypes:
+            with suppress_warnings() as sup:
+                sup.record(UserWarning)
+                (x, y, xm) = (_.astype(t) for _ in self.uint8data)
+                m = xm.mask
+                a = arange(10, dtype=t)
+                a[-1] = masked
+
+                # May get a DeprecationWarning or a TypeError.
+                #
+                # This is a consequence of the fact that this is true divide
+                # and will require casting to float for calculation and
+                # casting back to the original type. This will only be raised
+                # with integers. Whether it is an error or warning is only
+                # dependent on how stringent the casting rules are.
+                #
+                # Will handle the same way.
+                try:
+                    x /= a
+                    assert_equal(x, y / a)
+                except (DeprecationWarning, TypeError) as e:
+                    warnings.warn(str(e), stacklevel=1)
+                try:
+                    xm /= a
+                    assert_equal(xm, y / a)
+                    assert_equal(
+                        xm.mask,
+                        mask_or(mask_or(m, a.mask), (a == t(0)))
+                    )
+                except (DeprecationWarning, TypeError) as e:
+                    warnings.warn(str(e), stacklevel=1)
+
+                if issubclass(t, np.integer):
+                    assert_equal(len(sup.log), 2, "Failed on type=%s." % t)
+                else:
+                    assert_equal(len(sup.log), 0, "Failed on type=%s." % t)
+
+    def test_inplace_pow_type(self):
+        # Test keeping data w/ (inplace) power
+        for t in self.othertypes:
+            with warnings.catch_warnings(record=True) as w:
+                warnings.filterwarnings("always")
+                # Test pow on scalar
+                x = array([1, 2, 3], mask=[0, 0, 1], dtype=t)
+                xx = x ** t(2)
+                xx_r = array([1, 2 ** 2, 3], mask=[0, 0, 1], dtype=t)
+                assert_equal(xx.data, xx_r.data)
+                assert_equal(xx.mask, xx_r.mask)
+                # Test ipow on scalar
+                x **= t(2)
+                assert_equal(x.data, xx_r.data)
+                assert_equal(x.mask, xx_r.mask)
+
+                assert_equal(len(w), 0, "Failed on type=%s." % t)
+
+
+class TestMaskedArrayMethods:
+    # Test class for miscellaneous MaskedArrays methods.
+    def setup(self):
+        # Base data definition.
+        x = np.array([8.375, 7.545, 8.828, 8.5, 1.757, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479,
+                      7.189, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993])
+        X = x.reshape(6, 6)
+        XX = x.reshape(3, 2, 2, 3)
+
+        m = np.array([0, 1, 0, 1, 0, 0,
+                     1, 0, 1, 1, 0, 1,
+                     0, 0, 0, 1, 0, 1,
+                     0, 0, 0, 1, 1, 1,
+                     1, 0, 0, 1, 0, 0,
+                     0, 0, 1, 0, 1, 0])
+        mx = array(data=x, mask=m)
+        mX = array(data=X, mask=m.reshape(X.shape))
+        mXX = array(data=XX, mask=m.reshape(XX.shape))
+
+        m2 = np.array([1, 1, 0, 1, 0, 0,
+                      1, 1, 1, 1, 0, 1,
+                      0, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 1, 0,
+                      0, 0, 1, 0, 1, 1])
+        m2x = array(data=x, mask=m2)
+        m2X = array(data=X, mask=m2.reshape(X.shape))
+        m2XX = array(data=XX, mask=m2.reshape(XX.shape))
+        self.d = (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX)
+
+    def test_generic_methods(self):
+        # Tests some MaskedArray methods.
+        a = array([1, 3, 2])
+        assert_equal(a.any(), a._data.any())
+        assert_equal(a.all(), a._data.all())
+        assert_equal(a.argmax(), a._data.argmax())
+        assert_equal(a.argmin(), a._data.argmin())
+        assert_equal(a.choose(0, 1, 2, 3, 4), a._data.choose(0, 1, 2, 3, 4))
+        assert_equal(a.compress([1, 0, 1]), a._data.compress([1, 0, 1]))
+        assert_equal(a.conj(), a._data.conj())
+        assert_equal(a.conjugate(), a._data.conjugate())
+
+        m = array([[1, 2], [3, 4]])
+        assert_equal(m.diagonal(), m._data.diagonal())
+        assert_equal(a.sum(), a._data.sum())
+        assert_equal(a.take([1, 2]), a._data.take([1, 2]))
+        assert_equal(m.transpose(), m._data.transpose())
+
+    def test_allclose(self):
+        # Tests allclose on arrays
+        a = np.random.rand(10)
+        b = a + np.random.rand(10) * 1e-8
+        assert_(allclose(a, b))
+        # Test allclose w/ infs
+        a[0] = np.inf
+        assert_(not allclose(a, b))
+        b[0] = np.inf
+        assert_(allclose(a, b))
+        # Test allclose w/ masked
+        a = masked_array(a)
+        a[-1] = masked
+        assert_(allclose(a, b, masked_equal=True))
+        assert_(not allclose(a, b, masked_equal=False))
+        # Test comparison w/ scalar
+        a *= 1e-8
+        a[0] = 0
+        assert_(allclose(a, 0, masked_equal=True))
+
+        # Test that the function works for MIN_INT integer typed arrays
+        a = masked_array([np.iinfo(np.int_).min], dtype=np.int_)
+        assert_(allclose(a, a))
+
+    def test_allany(self):
+        # Checks the any/all methods/functions.
+        x = np.array([[0.13, 0.26, 0.90],
+                      [0.28, 0.33, 0.63],
+                      [0.31, 0.87, 0.70]])
+        m = np.array([[True, False, False],
+                      [False, False, False],
+                      [True, True, False]], dtype=np.bool_)
+        mx = masked_array(x, mask=m)
+        mxbig = (mx > 0.5)
+        mxsmall = (mx < 0.5)
+
+        assert_(not mxbig.all())
+        assert_(mxbig.any())
+        assert_equal(mxbig.all(0), [False, False, True])
+        assert_equal(mxbig.all(1), [False, False, True])
+        assert_equal(mxbig.any(0), [False, False, True])
+        assert_equal(mxbig.any(1), [True, True, True])
+
+        assert_(not mxsmall.all())
+        assert_(mxsmall.any())
+        assert_equal(mxsmall.all(0), [True, True, False])
+        assert_equal(mxsmall.all(1), [False, False, False])
+        assert_equal(mxsmall.any(0), [True, True, False])
+        assert_equal(mxsmall.any(1), [True, True, False])
+
+    def test_allany_oddities(self):
+        # Some fun with all and any
+        store = empty((), dtype=bool)
+        full = array([1, 2, 3], mask=True)
+
+        assert_(full.all() is masked)
+        full.all(out=store)
+        assert_(store)
+        assert_(store._mask, True)
+        assert_(store is not masked)
+
+        store = empty((), dtype=bool)
+        assert_(full.any() is masked)
+        full.any(out=store)
+        assert_(not store)
+        assert_(store._mask, True)
+        assert_(store is not masked)
+
+    def test_argmax_argmin(self):
+        # Tests argmin & argmax on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+
+        assert_equal(mx.argmin(), 35)
+        assert_equal(mX.argmin(), 35)
+        assert_equal(m2x.argmin(), 4)
+        assert_equal(m2X.argmin(), 4)
+        assert_equal(mx.argmax(), 28)
+        assert_equal(mX.argmax(), 28)
+        assert_equal(m2x.argmax(), 31)
+        assert_equal(m2X.argmax(), 31)
+
+        assert_equal(mX.argmin(0), [2, 2, 2, 5, 0, 5])
+        assert_equal(m2X.argmin(0), [2, 2, 4, 5, 0, 4])
+        assert_equal(mX.argmax(0), [0, 5, 0, 5, 4, 0])
+        assert_equal(m2X.argmax(0), [5, 5, 0, 5, 1, 0])
+
+        assert_equal(mX.argmin(1), [4, 1, 0, 0, 5, 5, ])
+        assert_equal(m2X.argmin(1), [4, 4, 0, 0, 5, 3])
+        assert_equal(mX.argmax(1), [2, 4, 1, 1, 4, 1])
+        assert_equal(m2X.argmax(1), [2, 4, 1, 1, 1, 1])
+
+    def test_clip(self):
+        # Tests clip on MaskedArrays.
+        x = np.array([8.375, 7.545, 8.828, 8.5, 1.757, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479,
+                      7.189, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993])
+        m = np.array([0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0])
+        mx = array(x, mask=m)
+        clipped = mx.clip(2, 8)
+        assert_equal(clipped.mask, mx.mask)
+        assert_equal(clipped._data, x.clip(2, 8))
+        assert_equal(clipped._data, mx._data.clip(2, 8))
+
+    def test_clip_out(self):
+        # gh-14140
+        a = np.arange(10)
+        m = np.ma.MaskedArray(a, mask=[0, 1] * 5)
+        m.clip(0, 5, out=m)
+        assert_equal(m.mask, [0, 1] * 5)
+
+    def test_compress(self):
+        # test compress
+        a = masked_array([1., 2., 3., 4., 5.], fill_value=9999)
+        condition = (a > 1.5) & (a < 3.5)
+        assert_equal(a.compress(condition), [2., 3.])
+
+        a[[2, 3]] = masked
+        b = a.compress(condition)
+        assert_equal(b._data, [2., 3.])
+        assert_equal(b._mask, [0, 1])
+        assert_equal(b.fill_value, 9999)
+        assert_equal(b, a[condition])
+
+        condition = (a < 4.)
+        b = a.compress(condition)
+        assert_equal(b._data, [1., 2., 3.])
+        assert_equal(b._mask, [0, 0, 1])
+        assert_equal(b.fill_value, 9999)
+        assert_equal(b, a[condition])
+
+        a = masked_array([[10, 20, 30], [40, 50, 60]],
+                         mask=[[0, 0, 1], [1, 0, 0]])
+        b = a.compress(a.ravel() >= 22)
+        assert_equal(b._data, [30, 40, 50, 60])
+        assert_equal(b._mask, [1, 1, 0, 0])
+
+        x = np.array([3, 1, 2])
+        b = a.compress(x >= 2, axis=1)
+        assert_equal(b._data, [[10, 30], [40, 60]])
+        assert_equal(b._mask, [[0, 1], [1, 0]])
+
+    def test_compressed(self):
+        # Tests compressed
+        a = array([1, 2, 3, 4], mask=[0, 0, 0, 0])
+        b = a.compressed()
+        assert_equal(b, a)
+        a[0] = masked
+        b = a.compressed()
+        assert_equal(b, [2, 3, 4])
+
+    def test_empty(self):
+        # Tests empty/like
+        datatype = [('a', int), ('b', float), ('c', '|S8')]
+        a = masked_array([(1, 1.1, '1.1'), (2, 2.2, '2.2'), (3, 3.3, '3.3')],
+                         dtype=datatype)
+        assert_equal(len(a.fill_value.item()), len(datatype))
+
+        b = empty_like(a)
+        assert_equal(b.shape, a.shape)
+        assert_equal(b.fill_value, a.fill_value)
+
+        b = empty(len(a), dtype=datatype)
+        assert_equal(b.shape, a.shape)
+        assert_equal(b.fill_value, a.fill_value)
+
+        # check empty_like mask handling
+        a = masked_array([1, 2, 3], mask=[False, True, False])
+        b = empty_like(a)
+        assert_(not np.may_share_memory(a.mask, b.mask))
+        b = a.view(masked_array)
+        assert_(np.may_share_memory(a.mask, b.mask))
+
+    @suppress_copy_mask_on_assignment
+    def test_put(self):
+        # Tests put.
+        d = arange(5)
+        n = [0, 0, 0, 1, 1]
+        m = make_mask(n)
+        x = array(d, mask=m)
+        assert_(x[3] is masked)
+        assert_(x[4] is masked)
+        x[[1, 4]] = [10, 40]
+        assert_(x[3] is masked)
+        assert_(x[4] is not masked)
+        assert_equal(x, [0, 10, 2, -1, 40])
+
+        x = masked_array(arange(10), mask=[1, 0, 0, 0, 0] * 2)
+        i = [0, 2, 4, 6]
+        x.put(i, [6, 4, 2, 0])
+        assert_equal(x, asarray([6, 1, 4, 3, 2, 5, 0, 7, 8, 9, ]))
+        assert_equal(x.mask, [0, 0, 0, 0, 0, 1, 0, 0, 0, 0])
+        x.put(i, masked_array([0, 2, 4, 6], [1, 0, 1, 0]))
+        assert_array_equal(x, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ])
+        assert_equal(x.mask, [1, 0, 0, 0, 1, 1, 0, 0, 0, 0])
+
+        x = masked_array(arange(10), mask=[1, 0, 0, 0, 0] * 2)
+        put(x, i, [6, 4, 2, 0])
+        assert_equal(x, asarray([6, 1, 4, 3, 2, 5, 0, 7, 8, 9, ]))
+        assert_equal(x.mask, [0, 0, 0, 0, 0, 1, 0, 0, 0, 0])
+        put(x, i, masked_array([0, 2, 4, 6], [1, 0, 1, 0]))
+        assert_array_equal(x, [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, ])
+        assert_equal(x.mask, [1, 0, 0, 0, 1, 1, 0, 0, 0, 0])
+
+    def test_put_nomask(self):
+        # GitHub issue 6425
+        x = zeros(10)
+        z = array([3., -1.], mask=[False, True])
+
+        x.put([1, 2], z)
+        assert_(x[0] is not masked)
+        assert_equal(x[0], 0)
+        assert_(x[1] is not masked)
+        assert_equal(x[1], 3)
+        assert_(x[2] is masked)
+        assert_(x[3] is not masked)
+        assert_equal(x[3], 0)
+
+    def test_put_hardmask(self):
+        # Tests put on hardmask
+        d = arange(5)
+        n = [0, 0, 0, 1, 1]
+        m = make_mask(n)
+        xh = array(d + 1, mask=m, hard_mask=True, copy=True)
+        xh.put([4, 2, 0, 1, 3], [1, 2, 3, 4, 5])
+        assert_equal(xh._data, [3, 4, 2, 4, 5])
+
+    def test_putmask(self):
+        x = arange(6) + 1
+        mx = array(x, mask=[0, 0, 0, 1, 1, 1])
+        mask = [0, 0, 1, 0, 0, 1]
+        # w/o mask, w/o masked values
+        xx = x.copy()
+        putmask(xx, mask, 99)
+        assert_equal(xx, [1, 2, 99, 4, 5, 99])
+        # w/ mask, w/o masked values
+        mxx = mx.copy()
+        putmask(mxx, mask, 99)
+        assert_equal(mxx._data, [1, 2, 99, 4, 5, 99])
+        assert_equal(mxx._mask, [0, 0, 0, 1, 1, 0])
+        # w/o mask, w/ masked values
+        values = array([10, 20, 30, 40, 50, 60], mask=[1, 1, 1, 0, 0, 0])
+        xx = x.copy()
+        putmask(xx, mask, values)
+        assert_equal(xx._data, [1, 2, 30, 4, 5, 60])
+        assert_equal(xx._mask, [0, 0, 1, 0, 0, 0])
+        # w/ mask, w/ masked values
+        mxx = mx.copy()
+        putmask(mxx, mask, values)
+        assert_equal(mxx._data, [1, 2, 30, 4, 5, 60])
+        assert_equal(mxx._mask, [0, 0, 1, 1, 1, 0])
+        # w/ mask, w/ masked values + hardmask
+        mxx = mx.copy()
+        mxx.harden_mask()
+        putmask(mxx, mask, values)
+        assert_equal(mxx, [1, 2, 30, 4, 5, 60])
+
+    def test_ravel(self):
+        # Tests ravel
+        a = array([[1, 2, 3, 4, 5]], mask=[[0, 1, 0, 0, 0]])
+        aravel = a.ravel()
+        assert_equal(aravel._mask.shape, aravel.shape)
+        a = array([0, 0], mask=[1, 1])
+        aravel = a.ravel()
+        assert_equal(aravel._mask.shape, a.shape)
+        # Checks that small_mask is preserved
+        a = array([1, 2, 3, 4], mask=[0, 0, 0, 0], shrink=False)
+        assert_equal(a.ravel()._mask, [0, 0, 0, 0])
+        # Test that the fill_value is preserved
+        a.fill_value = -99
+        a.shape = (2, 2)
+        ar = a.ravel()
+        assert_equal(ar._mask, [0, 0, 0, 0])
+        assert_equal(ar._data, [1, 2, 3, 4])
+        assert_equal(ar.fill_value, -99)
+        # Test index ordering
+        assert_equal(a.ravel(order='C'), [1, 2, 3, 4])
+        assert_equal(a.ravel(order='F'), [1, 3, 2, 4])
+
+    def test_reshape(self):
+        # Tests reshape
+        x = arange(4)
+        x[0] = masked
+        y = x.reshape(2, 2)
+        assert_equal(y.shape, (2, 2,))
+        assert_equal(y._mask.shape, (2, 2,))
+        assert_equal(x.shape, (4,))
+        assert_equal(x._mask.shape, (4,))
+
+    def test_sort(self):
+        # Test sort
+        x = array([1, 4, 2, 3], mask=[0, 1, 0, 0], dtype=np.uint8)
+
+        sortedx = sort(x)
+        assert_equal(sortedx._data, [1, 2, 3, 4])
+        assert_equal(sortedx._mask, [0, 0, 0, 1])
+
+        sortedx = sort(x, endwith=False)
+        assert_equal(sortedx._data, [4, 1, 2, 3])
+        assert_equal(sortedx._mask, [1, 0, 0, 0])
+
+        x.sort()
+        assert_equal(x._data, [1, 2, 3, 4])
+        assert_equal(x._mask, [0, 0, 0, 1])
+
+        x = array([1, 4, 2, 3], mask=[0, 1, 0, 0], dtype=np.uint8)
+        x.sort(endwith=False)
+        assert_equal(x._data, [4, 1, 2, 3])
+        assert_equal(x._mask, [1, 0, 0, 0])
+
+        x = [1, 4, 2, 3]
+        sortedx = sort(x)
+        assert_(not isinstance(sorted, MaskedArray))
+
+        x = array([0, 1, -1, -2, 2], mask=nomask, dtype=np.int8)
+        sortedx = sort(x, endwith=False)
+        assert_equal(sortedx._data, [-2, -1, 0, 1, 2])
+        x = array([0, 1, -1, -2, 2], mask=[0, 1, 0, 0, 1], dtype=np.int8)
+        sortedx = sort(x, endwith=False)
+        assert_equal(sortedx._data, [1, 2, -2, -1, 0])
+        assert_equal(sortedx._mask, [1, 1, 0, 0, 0])
+
+    def test_stable_sort(self):
+        x = array([1, 2, 3, 1, 2, 3], dtype=np.uint8)
+        expected = array([0, 3, 1, 4, 2, 5])
+        computed = argsort(x, kind='stable')
+        assert_equal(computed, expected)
+
+    def test_argsort_matches_sort(self):
+        x = array([1, 4, 2, 3], mask=[0, 1, 0, 0], dtype=np.uint8)
+
+        for kwargs in [dict(),
+                       dict(endwith=True),
+                       dict(endwith=False),
+                       dict(fill_value=2),
+                       dict(fill_value=2, endwith=True),
+                       dict(fill_value=2, endwith=False)]:
+            sortedx = sort(x, **kwargs)
+            argsortedx = x[argsort(x, **kwargs)]
+            assert_equal(sortedx._data, argsortedx._data)
+            assert_equal(sortedx._mask, argsortedx._mask)
+
+    def test_sort_2d(self):
+        # Check sort of 2D array.
+        # 2D array w/o mask
+        a = masked_array([[8, 4, 1], [2, 0, 9]])
+        a.sort(0)
+        assert_equal(a, [[2, 0, 1], [8, 4, 9]])
+        a = masked_array([[8, 4, 1], [2, 0, 9]])
+        a.sort(1)
+        assert_equal(a, [[1, 4, 8], [0, 2, 9]])
+        # 2D array w/mask
+        a = masked_array([[8, 4, 1], [2, 0, 9]], mask=[[1, 0, 0], [0, 0, 1]])
+        a.sort(0)
+        assert_equal(a, [[2, 0, 1], [8, 4, 9]])
+        assert_equal(a._mask, [[0, 0, 0], [1, 0, 1]])
+        a = masked_array([[8, 4, 1], [2, 0, 9]], mask=[[1, 0, 0], [0, 0, 1]])
+        a.sort(1)
+        assert_equal(a, [[1, 4, 8], [0, 2, 9]])
+        assert_equal(a._mask, [[0, 0, 1], [0, 0, 1]])
+        # 3D
+        a = masked_array([[[7, 8, 9], [4, 5, 6], [1, 2, 3]],
+                          [[1, 2, 3], [7, 8, 9], [4, 5, 6]],
+                          [[7, 8, 9], [1, 2, 3], [4, 5, 6]],
+                          [[4, 5, 6], [1, 2, 3], [7, 8, 9]]])
+        a[a % 4 == 0] = masked
+        am = a.copy()
+        an = a.filled(99)
+        am.sort(0)
+        an.sort(0)
+        assert_equal(am, an)
+        am = a.copy()
+        an = a.filled(99)
+        am.sort(1)
+        an.sort(1)
+        assert_equal(am, an)
+        am = a.copy()
+        an = a.filled(99)
+        am.sort(2)
+        an.sort(2)
+        assert_equal(am, an)
+
+    def test_sort_flexible(self):
+        # Test sort on structured dtype.
+        a = array(
+            data=[(3, 3), (3, 2), (2, 2), (2, 1), (1, 0), (1, 1), (1, 2)],
+            mask=[(0, 0), (0, 1), (0, 0), (0, 0), (1, 0), (0, 0), (0, 0)],
+            dtype=[('A', int), ('B', int)])
+        mask_last = array(
+            data=[(1, 1), (1, 2), (2, 1), (2, 2), (3, 3), (3, 2), (1, 0)],
+            mask=[(0, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 1), (1, 0)],
+            dtype=[('A', int), ('B', int)])
+        mask_first = array(
+            data=[(1, 0), (1, 1), (1, 2), (2, 1), (2, 2), (3, 2), (3, 3)],
+            mask=[(1, 0), (0, 0), (0, 0), (0, 0), (0, 0), (0, 1), (0, 0)],
+            dtype=[('A', int), ('B', int)])
+
+        test = sort(a)
+        assert_equal(test, mask_last)
+        assert_equal(test.mask, mask_last.mask)
+
+        test = sort(a, endwith=False)
+        assert_equal(test, mask_first)
+        assert_equal(test.mask, mask_first.mask)
+
+        # Test sort on dtype with subarray (gh-8069)
+        # Just check that the sort does not error, structured array subarrays
+        # are treated as byte strings and that leads to differing behavior
+        # depending on endianess and `endwith`.
+        dt = np.dtype([('v', int, 2)])
+        a = a.view(dt)
+        test = sort(a)
+        test = sort(a, endwith=False)
+
+    def test_argsort(self):
+        # Test argsort
+        a = array([1, 5, 2, 4, 3], mask=[1, 0, 0, 1, 0])
+        assert_equal(np.argsort(a), argsort(a))
+
+    def test_squeeze(self):
+        # Check squeeze
+        data = masked_array([[1, 2, 3]])
+        assert_equal(data.squeeze(), [1, 2, 3])
+        data = masked_array([[1, 2, 3]], mask=[[1, 1, 1]])
+        assert_equal(data.squeeze(), [1, 2, 3])
+        assert_equal(data.squeeze()._mask, [1, 1, 1])
+
+        # normal ndarrays return a view
+        arr = np.array([[1]])
+        arr_sq = arr.squeeze()
+        assert_equal(arr_sq, 1)
+        arr_sq[...] = 2
+        assert_equal(arr[0,0], 2)
+
+        # so maskedarrays should too
+        m_arr = masked_array([[1]], mask=True)
+        m_arr_sq = m_arr.squeeze()
+        assert_(m_arr_sq is not np.ma.masked)
+        assert_equal(m_arr_sq.mask, True)
+        m_arr_sq[...] = 2
+        assert_equal(m_arr[0,0], 2)
+
+    def test_swapaxes(self):
+        # Tests swapaxes on MaskedArrays.
+        x = np.array([8.375, 7.545, 8.828, 8.5, 1.757, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479,
+                      7.189, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993])
+        m = np.array([0, 1, 0, 1, 0, 0,
+                      1, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 0, 1,
+                      0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 0, 0,
+                      0, 0, 1, 0, 1, 0])
+        mX = array(x, mask=m).reshape(6, 6)
+        mXX = mX.reshape(3, 2, 2, 3)
+
+        mXswapped = mX.swapaxes(0, 1)
+        assert_equal(mXswapped[-1], mX[:, -1])
+
+        mXXswapped = mXX.swapaxes(0, 2)
+        assert_equal(mXXswapped.shape, (2, 2, 3, 3))
+
+    def test_take(self):
+        # Tests take
+        x = masked_array([10, 20, 30, 40], [0, 1, 0, 1])
+        assert_equal(x.take([0, 0, 3]), masked_array([10, 10, 40], [0, 0, 1]))
+        assert_equal(x.take([0, 0, 3]), x[[0, 0, 3]])
+        assert_equal(x.take([[0, 1], [0, 1]]),
+                     masked_array([[10, 20], [10, 20]], [[0, 1], [0, 1]]))
+
+        # assert_equal crashes when passed np.ma.mask
+        assert_(x[1] is np.ma.masked)
+        assert_(x.take(1) is np.ma.masked)
+
+        x = array([[10, 20, 30], [40, 50, 60]], mask=[[0, 0, 1], [1, 0, 0, ]])
+        assert_equal(x.take([0, 2], axis=1),
+                     array([[10, 30], [40, 60]], mask=[[0, 1], [1, 0]]))
+        assert_equal(take(x, [0, 2], axis=1),
+                     array([[10, 30], [40, 60]], mask=[[0, 1], [1, 0]]))
+
+    def test_take_masked_indices(self):
+        # Test take w/ masked indices
+        a = np.array((40, 18, 37, 9, 22))
+        indices = np.arange(3)[None,:] + np.arange(5)[:, None]
+        mindices = array(indices, mask=(indices >= len(a)))
+        # No mask
+        test = take(a, mindices, mode='clip')
+        ctrl = array([[40, 18, 37],
+                      [18, 37, 9],
+                      [37, 9, 22],
+                      [9, 22, 22],
+                      [22, 22, 22]])
+        assert_equal(test, ctrl)
+        # Masked indices
+        test = take(a, mindices)
+        ctrl = array([[40, 18, 37],
+                      [18, 37, 9],
+                      [37, 9, 22],
+                      [9, 22, 40],
+                      [22, 40, 40]])
+        ctrl[3, 2] = ctrl[4, 1] = ctrl[4, 2] = masked
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, ctrl.mask)
+        # Masked input + masked indices
+        a = array((40, 18, 37, 9, 22), mask=(0, 1, 0, 0, 0))
+        test = take(a, mindices)
+        ctrl[0, 1] = ctrl[1, 0] = masked
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, ctrl.mask)
+
+    def test_tolist(self):
+        # Tests to list
+        # ... on 1D
+        x = array(np.arange(12))
+        x[[1, -2]] = masked
+        xlist = x.tolist()
+        assert_(xlist[1] is None)
+        assert_(xlist[-2] is None)
+        # ... on 2D
+        x.shape = (3, 4)
+        xlist = x.tolist()
+        ctrl = [[0, None, 2, 3], [4, 5, 6, 7], [8, 9, None, 11]]
+        assert_equal(xlist[0], [0, None, 2, 3])
+        assert_equal(xlist[1], [4, 5, 6, 7])
+        assert_equal(xlist[2], [8, 9, None, 11])
+        assert_equal(xlist, ctrl)
+        # ... on structured array w/ masked records
+        x = array(list(zip([1, 2, 3],
+                           [1.1, 2.2, 3.3],
+                           ['one', 'two', 'thr'])),
+                  dtype=[('a', int), ('b', float), ('c', '|S8')])
+        x[-1] = masked
+        assert_equal(x.tolist(),
+                     [(1, 1.1, b'one'),
+                      (2, 2.2, b'two'),
+                      (None, None, None)])
+        # ... on structured array w/ masked fields
+        a = array([(1, 2,), (3, 4)], mask=[(0, 1), (0, 0)],
+                  dtype=[('a', int), ('b', int)])
+        test = a.tolist()
+        assert_equal(test, [[1, None], [3, 4]])
+        # ... on mvoid
+        a = a[0]
+        test = a.tolist()
+        assert_equal(test, [1, None])
+
+    def test_tolist_specialcase(self):
+        # Test mvoid.tolist: make sure we return a standard Python object
+        a = array([(0, 1), (2, 3)], dtype=[('a', int), ('b', int)])
+        # w/o mask: each entry is a np.void whose elements are standard Python
+        for entry in a:
+            for item in entry.tolist():
+                assert_(not isinstance(item, np.generic))
+        # w/ mask: each entry is a ma.void whose elements should be
+        # standard Python
+        a.mask[0] = (0, 1)
+        for entry in a:
+            for item in entry.tolist():
+                assert_(not isinstance(item, np.generic))
+
+    def test_toflex(self):
+        # Test the conversion to records
+        data = arange(10)
+        record = data.toflex()
+        assert_equal(record['_data'], data._data)
+        assert_equal(record['_mask'], data._mask)
+
+        data[[0, 1, 2, -1]] = masked
+        record = data.toflex()
+        assert_equal(record['_data'], data._data)
+        assert_equal(record['_mask'], data._mask)
+
+        ndtype = [('i', int), ('s', '|S3'), ('f', float)]
+        data = array([(i, s, f) for (i, s, f) in zip(np.arange(10),
+                                                     'ABCDEFGHIJKLM',
+                                                     np.random.rand(10))],
+                     dtype=ndtype)
+        data[[0, 1, 2, -1]] = masked
+        record = data.toflex()
+        assert_equal(record['_data'], data._data)
+        assert_equal(record['_mask'], data._mask)
+
+        ndtype = np.dtype("int, (2,3)float, float")
+        data = array([(i, f, ff) for (i, f, ff) in zip(np.arange(10),
+                                                       np.random.rand(10),
+                                                       np.random.rand(10))],
+                     dtype=ndtype)
+        data[[0, 1, 2, -1]] = masked
+        record = data.toflex()
+        assert_equal_records(record['_data'], data._data)
+        assert_equal_records(record['_mask'], data._mask)
+
+    def test_fromflex(self):
+        # Test the reconstruction of a masked_array from a record
+        a = array([1, 2, 3])
+        test = fromflex(a.toflex())
+        assert_equal(test, a)
+        assert_equal(test.mask, a.mask)
+
+        a = array([1, 2, 3], mask=[0, 0, 1])
+        test = fromflex(a.toflex())
+        assert_equal(test, a)
+        assert_equal(test.mask, a.mask)
+
+        a = array([(1, 1.), (2, 2.), (3, 3.)], mask=[(1, 0), (0, 0), (0, 1)],
+                  dtype=[('A', int), ('B', float)])
+        test = fromflex(a.toflex())
+        assert_equal(test, a)
+        assert_equal(test.data, a.data)
+
+    def test_arraymethod(self):
+        # Test a _arraymethod w/ n argument
+        marray = masked_array([[1, 2, 3, 4, 5]], mask=[0, 0, 1, 0, 0])
+        control = masked_array([[1], [2], [3], [4], [5]],
+                               mask=[0, 0, 1, 0, 0])
+        assert_equal(marray.T, control)
+        assert_equal(marray.transpose(), control)
+
+        assert_equal(MaskedArray.cumsum(marray.T, 0), control.cumsum(0))
+
+    def test_arraymethod_0d(self):
+        # gh-9430
+        x = np.ma.array(42, mask=True)
+        assert_equal(x.T.mask, x.mask)
+        assert_equal(x.T.data, x.data)
+
+    def test_transpose_view(self):
+        x = np.ma.array([[1, 2, 3], [4, 5, 6]])
+        x[0,1] = np.ma.masked
+        xt = x.T
+
+        xt[1,0] = 10
+        xt[0,1] = np.ma.masked
+
+        assert_equal(x.data, xt.T.data)
+        assert_equal(x.mask, xt.T.mask)
+
+    def test_diagonal_view(self):
+        x = np.ma.zeros((3,3))
+        x[0,0] = 10
+        x[1,1] = np.ma.masked
+        x[2,2] = 20
+        xd = x.diagonal()
+        x[1,1] = 15
+        assert_equal(xd.mask, x.diagonal().mask)
+        assert_equal(xd.data, x.diagonal().data)
+
+
+class TestMaskedArrayMathMethods:
+
+    def setup(self):
+        # Base data definition.
+        x = np.array([8.375, 7.545, 8.828, 8.5, 1.757, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479,
+                      7.189, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993])
+        X = x.reshape(6, 6)
+        XX = x.reshape(3, 2, 2, 3)
+
+        m = np.array([0, 1, 0, 1, 0, 0,
+                     1, 0, 1, 1, 0, 1,
+                     0, 0, 0, 1, 0, 1,
+                     0, 0, 0, 1, 1, 1,
+                     1, 0, 0, 1, 0, 0,
+                     0, 0, 1, 0, 1, 0])
+        mx = array(data=x, mask=m)
+        mX = array(data=X, mask=m.reshape(X.shape))
+        mXX = array(data=XX, mask=m.reshape(XX.shape))
+
+        m2 = np.array([1, 1, 0, 1, 0, 0,
+                      1, 1, 1, 1, 0, 1,
+                      0, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 1, 0,
+                      0, 0, 1, 0, 1, 1])
+        m2x = array(data=x, mask=m2)
+        m2X = array(data=X, mask=m2.reshape(X.shape))
+        m2XX = array(data=XX, mask=m2.reshape(XX.shape))
+        self.d = (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX)
+
+    def test_cumsumprod(self):
+        # Tests cumsum & cumprod on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        mXcp = mX.cumsum(0)
+        assert_equal(mXcp._data, mX.filled(0).cumsum(0))
+        mXcp = mX.cumsum(1)
+        assert_equal(mXcp._data, mX.filled(0).cumsum(1))
+
+        mXcp = mX.cumprod(0)
+        assert_equal(mXcp._data, mX.filled(1).cumprod(0))
+        mXcp = mX.cumprod(1)
+        assert_equal(mXcp._data, mX.filled(1).cumprod(1))
+
+    def test_cumsumprod_with_output(self):
+        # Tests cumsum/cumprod w/ output
+        xm = array(np.random.uniform(0, 10, 12)).reshape(3, 4)
+        xm[:, 0] = xm[0] = xm[-1, -1] = masked
+
+        for funcname in ('cumsum', 'cumprod'):
+            npfunc = getattr(np, funcname)
+            xmmeth = getattr(xm, funcname)
+
+            # A ndarray as explicit input
+            output = np.empty((3, 4), dtype=float)
+            output.fill(-9999)
+            result = npfunc(xm, axis=0, out=output)
+            # ... the result should be the given output
+            assert_(result is output)
+            assert_equal(result, xmmeth(axis=0, out=output))
+
+            output = empty((3, 4), dtype=int)
+            result = xmmeth(axis=0, out=output)
+            assert_(result is output)
+
+    def test_ptp(self):
+        # Tests ptp on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        (n, m) = X.shape
+        assert_equal(mx.ptp(), mx.compressed().ptp())
+        rows = np.zeros(n, float)
+        cols = np.zeros(m, float)
+        for k in range(m):
+            cols[k] = mX[:, k].compressed().ptp()
+        for k in range(n):
+            rows[k] = mX[k].compressed().ptp()
+        assert_equal(mX.ptp(0), cols)
+        assert_equal(mX.ptp(1), rows)
+
+    def test_add_object(self):
+        x = masked_array(['a', 'b'], mask=[1, 0], dtype=object)
+        y = x + 'x'
+        assert_equal(y[1], 'bx')
+        assert_(y.mask[0])
+
+    def test_sum_object(self):
+        # Test sum on object dtype
+        a = masked_array([1, 2, 3], mask=[1, 0, 0], dtype=object)
+        assert_equal(a.sum(), 5)
+        a = masked_array([[1, 2, 3], [4, 5, 6]], dtype=object)
+        assert_equal(a.sum(axis=0), [5, 7, 9])
+
+    def test_prod_object(self):
+        # Test prod on object dtype
+        a = masked_array([1, 2, 3], mask=[1, 0, 0], dtype=object)
+        assert_equal(a.prod(), 2 * 3)
+        a = masked_array([[1, 2, 3], [4, 5, 6]], dtype=object)
+        assert_equal(a.prod(axis=0), [4, 10, 18])
+
+    def test_meananom_object(self):
+        # Test mean/anom on object dtype
+        a = masked_array([1, 2, 3], dtype=object)
+        assert_equal(a.mean(), 2)
+        assert_equal(a.anom(), [-1, 0, 1])
+
+    def test_trace(self):
+        # Tests trace on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        mXdiag = mX.diagonal()
+        assert_equal(mX.trace(), mX.diagonal().compressed().sum())
+        assert_almost_equal(mX.trace(),
+                            X.trace() - sum(mXdiag.mask * X.diagonal(),
+                                            axis=0))
+        assert_equal(np.trace(mX), mX.trace())
+
+        # gh-5560
+        arr = np.arange(2*4*4).reshape(2,4,4)
+        m_arr = np.ma.masked_array(arr, False)
+        assert_equal(arr.trace(axis1=1, axis2=2), m_arr.trace(axis1=1, axis2=2))
+
+    def test_dot(self):
+        # Tests dot on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        fx = mx.filled(0)
+        r = mx.dot(mx)
+        assert_almost_equal(r.filled(0), fx.dot(fx))
+        assert_(r.mask is nomask)
+
+        fX = mX.filled(0)
+        r = mX.dot(mX)
+        assert_almost_equal(r.filled(0), fX.dot(fX))
+        assert_(r.mask[1,3])
+        r1 = empty_like(r)
+        mX.dot(mX, out=r1)
+        assert_almost_equal(r, r1)
+
+        mYY = mXX.swapaxes(-1, -2)
+        fXX, fYY = mXX.filled(0), mYY.filled(0)
+        r = mXX.dot(mYY)
+        assert_almost_equal(r.filled(0), fXX.dot(fYY))
+        r1 = empty_like(r)
+        mXX.dot(mYY, out=r1)
+        assert_almost_equal(r, r1)
+
+    def test_dot_shape_mismatch(self):
+        # regression test
+        x = masked_array([[1,2],[3,4]], mask=[[0,1],[0,0]])
+        y = masked_array([[1,2],[3,4]], mask=[[0,1],[0,0]])
+        z = masked_array([[0,1],[3,3]])
+        x.dot(y, out=z)
+        assert_almost_equal(z.filled(0), [[1, 0], [15, 16]])
+        assert_almost_equal(z.mask, [[0, 1], [0, 0]])
+
+    def test_varmean_nomask(self):
+        # gh-5769
+        foo = array([1,2,3,4], dtype='f8')
+        bar = array([1,2,3,4], dtype='f8')
+        assert_equal(type(foo.mean()), np.float64)
+        assert_equal(type(foo.var()), np.float64)
+        assert((foo.mean() == bar.mean()) is np.bool_(True))
+
+        # check array type is preserved and out works
+        foo = array(np.arange(16).reshape((4,4)), dtype='f8')
+        bar = empty(4, dtype='f4')
+        assert_equal(type(foo.mean(axis=1)), MaskedArray)
+        assert_equal(type(foo.var(axis=1)), MaskedArray)
+        assert_(foo.mean(axis=1, out=bar) is bar)
+        assert_(foo.var(axis=1, out=bar) is bar)
+
+    def test_varstd(self):
+        # Tests var & std on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        assert_almost_equal(mX.var(axis=None), mX.compressed().var())
+        assert_almost_equal(mX.std(axis=None), mX.compressed().std())
+        assert_almost_equal(mX.std(axis=None, ddof=1),
+                            mX.compressed().std(ddof=1))
+        assert_almost_equal(mX.var(axis=None, ddof=1),
+                            mX.compressed().var(ddof=1))
+        assert_equal(mXX.var(axis=3).shape, XX.var(axis=3).shape)
+        assert_equal(mX.var().shape, X.var().shape)
+        (mXvar0, mXvar1) = (mX.var(axis=0), mX.var(axis=1))
+        assert_almost_equal(mX.var(axis=None, ddof=2),
+                            mX.compressed().var(ddof=2))
+        assert_almost_equal(mX.std(axis=None, ddof=2),
+                            mX.compressed().std(ddof=2))
+        for k in range(6):
+            assert_almost_equal(mXvar1[k], mX[k].compressed().var())
+            assert_almost_equal(mXvar0[k], mX[:, k].compressed().var())
+            assert_almost_equal(np.sqrt(mXvar0[k]),
+                                mX[:, k].compressed().std())
+
+    @pytest.mark.skipif(sys.platform=='win32' and sys.version_info < (3, 6),
+                        reason='Fails on Python < 3.6 on Windows, gh-9671')
+    @suppress_copy_mask_on_assignment
+    def test_varstd_specialcases(self):
+        # Test a special case for var
+        nout = np.array(-1, dtype=float)
+        mout = array(-1, dtype=float)
+
+        x = array(arange(10), mask=True)
+        for methodname in ('var', 'std'):
+            method = getattr(x, methodname)
+            assert_(method() is masked)
+            assert_(method(0) is masked)
+            assert_(method(-1) is masked)
+            # Using a masked array as explicit output
+            method(out=mout)
+            assert_(mout is not masked)
+            assert_equal(mout.mask, True)
+            # Using a ndarray as explicit output
+            method(out=nout)
+            assert_(np.isnan(nout))
+
+        x = array(arange(10), mask=True)
+        x[-1] = 9
+        for methodname in ('var', 'std'):
+            method = getattr(x, methodname)
+            assert_(method(ddof=1) is masked)
+            assert_(method(0, ddof=1) is masked)
+            assert_(method(-1, ddof=1) is masked)
+            # Using a masked array as explicit output
+            method(out=mout, ddof=1)
+            assert_(mout is not masked)
+            assert_equal(mout.mask, True)
+            # Using a ndarray as explicit output
+            method(out=nout, ddof=1)
+            assert_(np.isnan(nout))
+
+    def test_varstd_ddof(self):
+        a = array([[1, 1, 0], [1, 1, 0]], mask=[[0, 0, 1], [0, 0, 1]])
+        test = a.std(axis=0, ddof=0)
+        assert_equal(test.filled(0), [0, 0, 0])
+        assert_equal(test.mask, [0, 0, 1])
+        test = a.std(axis=0, ddof=1)
+        assert_equal(test.filled(0), [0, 0, 0])
+        assert_equal(test.mask, [0, 0, 1])
+        test = a.std(axis=0, ddof=2)
+        assert_equal(test.filled(0), [0, 0, 0])
+        assert_equal(test.mask, [1, 1, 1])
+
+    def test_diag(self):
+        # Test diag
+        x = arange(9).reshape((3, 3))
+        x[1, 1] = masked
+        out = np.diag(x)
+        assert_equal(out, [0, 4, 8])
+        out = diag(x)
+        assert_equal(out, [0, 4, 8])
+        assert_equal(out.mask, [0, 1, 0])
+        out = diag(out)
+        control = array([[0, 0, 0], [0, 4, 0], [0, 0, 8]],
+                        mask=[[0, 0, 0], [0, 1, 0], [0, 0, 0]])
+        assert_equal(out, control)
+
+    def test_axis_methods_nomask(self):
+        # Test the combination nomask & methods w/ axis
+        a = array([[1, 2, 3], [4, 5, 6]])
+
+        assert_equal(a.sum(0), [5, 7, 9])
+        assert_equal(a.sum(-1), [6, 15])
+        assert_equal(a.sum(1), [6, 15])
+
+        assert_equal(a.prod(0), [4, 10, 18])
+        assert_equal(a.prod(-1), [6, 120])
+        assert_equal(a.prod(1), [6, 120])
+
+        assert_equal(a.min(0), [1, 2, 3])
+        assert_equal(a.min(-1), [1, 4])
+        assert_equal(a.min(1), [1, 4])
+
+        assert_equal(a.max(0), [4, 5, 6])
+        assert_equal(a.max(-1), [3, 6])
+        assert_equal(a.max(1), [3, 6])
+
+
+class TestMaskedArrayMathMethodsComplex:
+    # Test class for miscellaneous MaskedArrays methods.
+    def setup(self):
+        # Base data definition.
+        x = np.array([8.375j, 7.545j, 8.828j, 8.5j, 1.757j, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479j,
+                      7.189j, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993j])
+        X = x.reshape(6, 6)
+        XX = x.reshape(3, 2, 2, 3)
+
+        m = np.array([0, 1, 0, 1, 0, 0,
+                     1, 0, 1, 1, 0, 1,
+                     0, 0, 0, 1, 0, 1,
+                     0, 0, 0, 1, 1, 1,
+                     1, 0, 0, 1, 0, 0,
+                     0, 0, 1, 0, 1, 0])
+        mx = array(data=x, mask=m)
+        mX = array(data=X, mask=m.reshape(X.shape))
+        mXX = array(data=XX, mask=m.reshape(XX.shape))
+
+        m2 = np.array([1, 1, 0, 1, 0, 0,
+                      1, 1, 1, 1, 0, 1,
+                      0, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 1, 0,
+                      0, 0, 1, 0, 1, 1])
+        m2x = array(data=x, mask=m2)
+        m2X = array(data=X, mask=m2.reshape(X.shape))
+        m2XX = array(data=XX, mask=m2.reshape(XX.shape))
+        self.d = (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX)
+
+    def test_varstd(self):
+        # Tests var & std on MaskedArrays.
+        (x, X, XX, m, mx, mX, mXX, m2x, m2X, m2XX) = self.d
+        assert_almost_equal(mX.var(axis=None), mX.compressed().var())
+        assert_almost_equal(mX.std(axis=None), mX.compressed().std())
+        assert_equal(mXX.var(axis=3).shape, XX.var(axis=3).shape)
+        assert_equal(mX.var().shape, X.var().shape)
+        (mXvar0, mXvar1) = (mX.var(axis=0), mX.var(axis=1))
+        assert_almost_equal(mX.var(axis=None, ddof=2),
+                            mX.compressed().var(ddof=2))
+        assert_almost_equal(mX.std(axis=None, ddof=2),
+                            mX.compressed().std(ddof=2))
+        for k in range(6):
+            assert_almost_equal(mXvar1[k], mX[k].compressed().var())
+            assert_almost_equal(mXvar0[k], mX[:, k].compressed().var())
+            assert_almost_equal(np.sqrt(mXvar0[k]),
+                                mX[:, k].compressed().std())
+
+
+class TestMaskedArrayFunctions:
+    # Test class for miscellaneous functions.
+
+    def setup(self):
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = masked_array(x, mask=m1)
+        ym = masked_array(y, mask=m2)
+        xm.set_fill_value(1e+20)
+        self.info = (xm, ym)
+
+    def test_masked_where_bool(self):
+        x = [1, 2]
+        y = masked_where(False, x)
+        assert_equal(y, [1, 2])
+        assert_equal(y[1], 2)
+
+    def test_masked_equal_wlist(self):
+        x = [1, 2, 3]
+        mx = masked_equal(x, 3)
+        assert_equal(mx, x)
+        assert_equal(mx._mask, [0, 0, 1])
+        mx = masked_not_equal(x, 3)
+        assert_equal(mx, x)
+        assert_equal(mx._mask, [1, 1, 0])
+
+    def test_masked_equal_fill_value(self):
+        x = [1, 2, 3]
+        mx = masked_equal(x, 3)
+        assert_equal(mx._mask, [0, 0, 1])
+        assert_equal(mx.fill_value, 3)
+
+    def test_masked_where_condition(self):
+        # Tests masking functions.
+        x = array([1., 2., 3., 4., 5.])
+        x[2] = masked
+        assert_equal(masked_where(greater(x, 2), x), masked_greater(x, 2))
+        assert_equal(masked_where(greater_equal(x, 2), x),
+                     masked_greater_equal(x, 2))
+        assert_equal(masked_where(less(x, 2), x), masked_less(x, 2))
+        assert_equal(masked_where(less_equal(x, 2), x),
+                     masked_less_equal(x, 2))
+        assert_equal(masked_where(not_equal(x, 2), x), masked_not_equal(x, 2))
+        assert_equal(masked_where(equal(x, 2), x), masked_equal(x, 2))
+        assert_equal(masked_where(not_equal(x, 2), x), masked_not_equal(x, 2))
+        assert_equal(masked_where([1, 1, 0, 0, 0], [1, 2, 3, 4, 5]),
+                     [99, 99, 3, 4, 5])
+
+    def test_masked_where_oddities(self):
+        # Tests some generic features.
+        atest = ones((10, 10, 10), dtype=float)
+        btest = zeros(atest.shape, MaskType)
+        ctest = masked_where(btest, atest)
+        assert_equal(atest, ctest)
+
+    def test_masked_where_shape_constraint(self):
+        a = arange(10)
+        with assert_raises(IndexError):
+            masked_equal(1, a)
+        test = masked_equal(a, 1)
+        assert_equal(test.mask, [0, 1, 0, 0, 0, 0, 0, 0, 0, 0])
+
+    def test_masked_where_structured(self):
+        # test that masked_where on a structured array sets a structured
+        # mask (see issue #2972)
+        a = np.zeros(10, dtype=[("A", "<f2"), ("B", "<f4")])
+        am = np.ma.masked_where(a["A"] < 5, a)
+        assert_equal(am.mask.dtype.names, am.dtype.names)
+        assert_equal(am["A"],
+                    np.ma.masked_array(np.zeros(10), np.ones(10)))
+
+    def test_masked_where_mismatch(self):
+        # gh-4520
+        x = np.arange(10)
+        y = np.arange(5)
+        assert_raises(IndexError, np.ma.masked_where, y > 6, x)
+
+    def test_masked_otherfunctions(self):
+        assert_equal(masked_inside(list(range(5)), 1, 3),
+                     [0, 199, 199, 199, 4])
+        assert_equal(masked_outside(list(range(5)), 1, 3), [199, 1, 2, 3, 199])
+        assert_equal(masked_inside(array(list(range(5)),
+                                         mask=[1, 0, 0, 0, 0]), 1, 3).mask,
+                     [1, 1, 1, 1, 0])
+        assert_equal(masked_outside(array(list(range(5)),
+                                          mask=[0, 1, 0, 0, 0]), 1, 3).mask,
+                     [1, 1, 0, 0, 1])
+        assert_equal(masked_equal(array(list(range(5)),
+                                        mask=[1, 0, 0, 0, 0]), 2).mask,
+                     [1, 0, 1, 0, 0])
+        assert_equal(masked_not_equal(array([2, 2, 1, 2, 1],
+                                            mask=[1, 0, 0, 0, 0]), 2).mask,
+                     [1, 0, 1, 0, 1])
+
+    def test_round(self):
+        a = array([1.23456, 2.34567, 3.45678, 4.56789, 5.67890],
+                  mask=[0, 1, 0, 0, 0])
+        assert_equal(a.round(), [1., 2., 3., 5., 6.])
+        assert_equal(a.round(1), [1.2, 2.3, 3.5, 4.6, 5.7])
+        assert_equal(a.round(3), [1.235, 2.346, 3.457, 4.568, 5.679])
+        b = empty_like(a)
+        a.round(out=b)
+        assert_equal(b, [1., 2., 3., 5., 6.])
+
+        x = array([1., 2., 3., 4., 5.])
+        c = array([1, 1, 1, 0, 0])
+        x[2] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        c[0] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        assert_(z[0] is masked)
+        assert_(z[1] is not masked)
+        assert_(z[2] is masked)
+
+    def test_round_with_output(self):
+        # Testing round with an explicit output
+
+        xm = array(np.random.uniform(0, 10, 12)).reshape(3, 4)
+        xm[:, 0] = xm[0] = xm[-1, -1] = masked
+
+        # A ndarray as explicit input
+        output = np.empty((3, 4), dtype=float)
+        output.fill(-9999)
+        result = np.round(xm, decimals=2, out=output)
+        # ... the result should be the given output
+        assert_(result is output)
+        assert_equal(result, xm.round(decimals=2, out=output))
+
+        output = empty((3, 4), dtype=float)
+        result = xm.round(decimals=2, out=output)
+        assert_(result is output)
+
+    def test_round_with_scalar(self):
+        # Testing round with scalar/zero dimension input
+        # GH issue 2244
+        a = array(1.1, mask=[False])
+        assert_equal(a.round(), 1)
+
+        a = array(1.1, mask=[True])
+        assert_(a.round() is masked)
+
+        a = array(1.1, mask=[False])
+        output = np.empty(1, dtype=float)
+        output.fill(-9999)
+        a.round(out=output)
+        assert_equal(output, 1)
+
+        a = array(1.1, mask=[False])
+        output = array(-9999., mask=[True])
+        a.round(out=output)
+        assert_equal(output[()], 1)
+
+        a = array(1.1, mask=[True])
+        output = array(-9999., mask=[False])
+        a.round(out=output)
+        assert_(output[()] is masked)
+
+    def test_identity(self):
+        a = identity(5)
+        assert_(isinstance(a, MaskedArray))
+        assert_equal(a, np.identity(5))
+
+    def test_power(self):
+        x = -1.1
+        assert_almost_equal(power(x, 2.), 1.21)
+        assert_(power(x, masked) is masked)
+        x = array([-1.1, -1.1, 1.1, 1.1, 0.])
+        b = array([0.5, 2., 0.5, 2., -1.], mask=[0, 0, 0, 0, 1])
+        y = power(x, b)
+        assert_almost_equal(y, [0, 1.21, 1.04880884817, 1.21, 0.])
+        assert_equal(y._mask, [1, 0, 0, 0, 1])
+        b.mask = nomask
+        y = power(x, b)
+        assert_equal(y._mask, [1, 0, 0, 0, 1])
+        z = x ** b
+        assert_equal(z._mask, y._mask)
+        assert_almost_equal(z, y)
+        assert_almost_equal(z._data, y._data)
+        x **= b
+        assert_equal(x._mask, y._mask)
+        assert_almost_equal(x, y)
+        assert_almost_equal(x._data, y._data)
+
+    def test_power_with_broadcasting(self):
+        # Test power w/ broadcasting
+        a2 = np.array([[1., 2., 3.], [4., 5., 6.]])
+        a2m = array(a2, mask=[[1, 0, 0], [0, 0, 1]])
+        b1 = np.array([2, 4, 3])
+        b2 = np.array([b1, b1])
+        b2m = array(b2, mask=[[0, 1, 0], [0, 1, 0]])
+
+        ctrl = array([[1 ** 2, 2 ** 4, 3 ** 3], [4 ** 2, 5 ** 4, 6 ** 3]],
+                     mask=[[1, 1, 0], [0, 1, 1]])
+        # No broadcasting, base & exp w/ mask
+        test = a2m ** b2m
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, ctrl.mask)
+        # No broadcasting, base w/ mask, exp w/o mask
+        test = a2m ** b2
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, a2m.mask)
+        # No broadcasting, base w/o mask, exp w/ mask
+        test = a2 ** b2m
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, b2m.mask)
+
+        ctrl = array([[2 ** 2, 4 ** 4, 3 ** 3], [2 ** 2, 4 ** 4, 3 ** 3]],
+                     mask=[[0, 1, 0], [0, 1, 0]])
+        test = b1 ** b2m
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, ctrl.mask)
+        test = b2m ** b1
+        assert_equal(test, ctrl)
+        assert_equal(test.mask, ctrl.mask)
+
+    def test_where(self):
+        # Test the where function
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = masked_array(x, mask=m1)
+        ym = masked_array(y, mask=m2)
+        xm.set_fill_value(1e+20)
+
+        d = where(xm > 2, xm, -9)
+        assert_equal(d, [-9., -9., -9., -9., -9., 4.,
+                         -9., -9., 10., -9., -9., 3.])
+        assert_equal(d._mask, xm._mask)
+        d = where(xm > 2, -9, ym)
+        assert_equal(d, [5., 0., 3., 2., -1., -9.,
+                         -9., -10., -9., 1., 0., -9.])
+        assert_equal(d._mask, [1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0])
+        d = where(xm > 2, xm, masked)
+        assert_equal(d, [-9., -9., -9., -9., -9., 4.,
+                         -9., -9., 10., -9., -9., 3.])
+        tmp = xm._mask.copy()
+        tmp[(xm <= 2).filled(True)] = True
+        assert_equal(d._mask, tmp)
+
+        ixm = xm.astype(int)
+        d = where(ixm > 2, ixm, masked)
+        assert_equal(d, [-9, -9, -9, -9, -9, 4, -9, -9, 10, -9, -9, 3])
+        assert_equal(d.dtype, ixm.dtype)
+
+    def test_where_object(self):
+        a = np.array(None)
+        b = masked_array(None)
+        r = b.copy()
+        assert_equal(np.ma.where(True, a, a), r)
+        assert_equal(np.ma.where(True, b, b), r)
+
+    def test_where_with_masked_choice(self):
+        x = arange(10)
+        x[3] = masked
+        c = x >= 8
+        # Set False to masked
+        z = where(c, x, masked)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is masked)
+        assert_(z[7] is masked)
+        assert_(z[8] is not masked)
+        assert_(z[9] is not masked)
+        assert_equal(x, z)
+        # Set True to masked
+        z = where(c, masked, x)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is not masked)
+        assert_(z[7] is not masked)
+        assert_(z[8] is masked)
+        assert_(z[9] is masked)
+
+    def test_where_with_masked_condition(self):
+        x = array([1., 2., 3., 4., 5.])
+        c = array([1, 1, 1, 0, 0])
+        x[2] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        c[0] = masked
+        z = where(c, x, -x)
+        assert_equal(z, [1., 2., 0., -4., -5])
+        assert_(z[0] is masked)
+        assert_(z[1] is not masked)
+        assert_(z[2] is masked)
+
+        x = arange(1, 6)
+        x[-1] = masked
+        y = arange(1, 6) * 10
+        y[2] = masked
+        c = array([1, 1, 1, 0, 0], mask=[1, 0, 0, 0, 0])
+        cm = c.filled(1)
+        z = where(c, x, y)
+        zm = where(cm, x, y)
+        assert_equal(z, zm)
+        assert_(getmask(zm) is nomask)
+        assert_equal(zm, [1, 2, 3, 40, 50])
+        z = where(c, masked, 1)
+        assert_equal(z, [99, 99, 99, 1, 1])
+        z = where(c, 1, masked)
+        assert_equal(z, [99, 1, 1, 99, 99])
+
+    def test_where_type(self):
+        # Test the type conservation with where
+        x = np.arange(4, dtype=np.int32)
+        y = np.arange(4, dtype=np.float32) * 2.2
+        test = where(x > 1.5, y, x).dtype
+        control = np.find_common_type([np.int32, np.float32], [])
+        assert_equal(test, control)
+
+    def test_where_broadcast(self):
+        # Issue 8599
+        x = np.arange(9).reshape(3, 3)
+        y = np.zeros(3)
+        core = np.where([1, 0, 1], x, y)
+        ma = where([1, 0, 1], x, y)
+
+        assert_equal(core, ma)
+        assert_equal(core.dtype, ma.dtype)
+
+    def test_where_structured(self):
+        # Issue 8600
+        dt = np.dtype([('a', int), ('b', int)])
+        x = np.array([(1, 2), (3, 4), (5, 6)], dtype=dt)
+        y = np.array((10, 20), dtype=dt)
+        core = np.where([0, 1, 1], x, y)
+        ma = np.where([0, 1, 1], x, y)
+
+        assert_equal(core, ma)
+        assert_equal(core.dtype, ma.dtype)
+
+    def test_where_structured_masked(self):
+        dt = np.dtype([('a', int), ('b', int)])
+        x = np.array([(1, 2), (3, 4), (5, 6)], dtype=dt)
+
+        ma = where([0, 1, 1], x, masked)
+        expected = masked_where([1, 0, 0], x)
+
+        assert_equal(ma.dtype, expected.dtype)
+        assert_equal(ma, expected)
+        assert_equal(ma.mask, expected.mask)
+
+    def test_choose(self):
+        # Test choose
+        choices = [[0, 1, 2, 3], [10, 11, 12, 13],
+                   [20, 21, 22, 23], [30, 31, 32, 33]]
+        chosen = choose([2, 3, 1, 0], choices)
+        assert_equal(chosen, array([20, 31, 12, 3]))
+        chosen = choose([2, 4, 1, 0], choices, mode='clip')
+        assert_equal(chosen, array([20, 31, 12, 3]))
+        chosen = choose([2, 4, 1, 0], choices, mode='wrap')
+        assert_equal(chosen, array([20, 1, 12, 3]))
+        # Check with some masked indices
+        indices_ = array([2, 4, 1, 0], mask=[1, 0, 0, 1])
+        chosen = choose(indices_, choices, mode='wrap')
+        assert_equal(chosen, array([99, 1, 12, 99]))
+        assert_equal(chosen.mask, [1, 0, 0, 1])
+        # Check with some masked choices
+        choices = array(choices, mask=[[0, 0, 0, 1], [1, 1, 0, 1],
+                                       [1, 0, 0, 0], [0, 0, 0, 0]])
+        indices_ = [2, 3, 1, 0]
+        chosen = choose(indices_, choices, mode='wrap')
+        assert_equal(chosen, array([20, 31, 12, 3]))
+        assert_equal(chosen.mask, [1, 0, 0, 1])
+
+    def test_choose_with_out(self):
+        # Test choose with an explicit out keyword
+        choices = [[0, 1, 2, 3], [10, 11, 12, 13],
+                   [20, 21, 22, 23], [30, 31, 32, 33]]
+        store = empty(4, dtype=int)
+        chosen = choose([2, 3, 1, 0], choices, out=store)
+        assert_equal(store, array([20, 31, 12, 3]))
+        assert_(store is chosen)
+        # Check with some masked indices + out
+        store = empty(4, dtype=int)
+        indices_ = array([2, 3, 1, 0], mask=[1, 0, 0, 1])
+        chosen = choose(indices_, choices, mode='wrap', out=store)
+        assert_equal(store, array([99, 31, 12, 99]))
+        assert_equal(store.mask, [1, 0, 0, 1])
+        # Check with some masked choices + out ina ndarray !
+        choices = array(choices, mask=[[0, 0, 0, 1], [1, 1, 0, 1],
+                                       [1, 0, 0, 0], [0, 0, 0, 0]])
+        indices_ = [2, 3, 1, 0]
+        store = empty(4, dtype=int).view(ndarray)
+        chosen = choose(indices_, choices, mode='wrap', out=store)
+        assert_equal(store, array([999999, 31, 12, 999999]))
+
+    def test_reshape(self):
+        a = arange(10)
+        a[0] = masked
+        # Try the default
+        b = a.reshape((5, 2))
+        assert_equal(b.shape, (5, 2))
+        assert_(b.flags['C'])
+        # Try w/ arguments as list instead of tuple
+        b = a.reshape(5, 2)
+        assert_equal(b.shape, (5, 2))
+        assert_(b.flags['C'])
+        # Try w/ order
+        b = a.reshape((5, 2), order='F')
+        assert_equal(b.shape, (5, 2))
+        assert_(b.flags['F'])
+        # Try w/ order
+        b = a.reshape(5, 2, order='F')
+        assert_equal(b.shape, (5, 2))
+        assert_(b.flags['F'])
+
+        c = np.reshape(a, (2, 5))
+        assert_(isinstance(c, MaskedArray))
+        assert_equal(c.shape, (2, 5))
+        assert_(c[0, 0] is masked)
+        assert_(c.flags['C'])
+
+    def test_make_mask_descr(self):
+        # Flexible
+        ntype = [('a', float), ('b', float)]
+        test = make_mask_descr(ntype)
+        assert_equal(test, [('a', bool), ('b', bool)])
+        assert_(test is make_mask_descr(test))
+
+        # Standard w/ shape
+        ntype = (float, 2)
+        test = make_mask_descr(ntype)
+        assert_equal(test, (bool, 2))
+        assert_(test is make_mask_descr(test))
+
+        # Standard standard
+        ntype = float
+        test = make_mask_descr(ntype)
+        assert_equal(test, np.dtype(bool))
+        assert_(test is make_mask_descr(test))
+
+        # Nested
+        ntype = [('a', float), ('b', [('ba', float), ('bb', float)])]
+        test = make_mask_descr(ntype)
+        control = np.dtype([('a', 'b1'), ('b', [('ba', 'b1'), ('bb', 'b1')])])
+        assert_equal(test, control)
+        assert_(test is make_mask_descr(test))
+
+        # Named+ shape
+        ntype = [('a', (float, 2))]
+        test = make_mask_descr(ntype)
+        assert_equal(test, np.dtype([('a', (bool, 2))]))
+        assert_(test is make_mask_descr(test))
+
+        # 2 names
+        ntype = [(('A', 'a'), float)]
+        test = make_mask_descr(ntype)
+        assert_equal(test, np.dtype([(('A', 'a'), bool)]))
+        assert_(test is make_mask_descr(test))
+
+        # nested boolean types should preserve identity
+        base_type = np.dtype([('a', int, 3)])
+        base_mtype = make_mask_descr(base_type)
+        sub_type = np.dtype([('a', int), ('b', base_mtype)])
+        test = make_mask_descr(sub_type)
+        assert_equal(test, np.dtype([('a', bool), ('b', [('a', bool, 3)])]))
+        assert_(test.fields['b'][0] is base_mtype)
+
+    def test_make_mask(self):
+        # Test make_mask
+        # w/ a list as an input
+        mask = [0, 1]
+        test = make_mask(mask)
+        assert_equal(test.dtype, MaskType)
+        assert_equal(test, [0, 1])
+        # w/ a ndarray as an input
+        mask = np.array([0, 1], dtype=bool)
+        test = make_mask(mask)
+        assert_equal(test.dtype, MaskType)
+        assert_equal(test, [0, 1])
+        # w/ a flexible-type ndarray as an input - use default
+        mdtype = [('a', bool), ('b', bool)]
+        mask = np.array([(0, 0), (0, 1)], dtype=mdtype)
+        test = make_mask(mask)
+        assert_equal(test.dtype, MaskType)
+        assert_equal(test, [1, 1])
+        # w/ a flexible-type ndarray as an input - use input dtype
+        mdtype = [('a', bool), ('b', bool)]
+        mask = np.array([(0, 0), (0, 1)], dtype=mdtype)
+        test = make_mask(mask, dtype=mask.dtype)
+        assert_equal(test.dtype, mdtype)
+        assert_equal(test, mask)
+        # w/ a flexible-type ndarray as an input - use input dtype
+        mdtype = [('a', float), ('b', float)]
+        bdtype = [('a', bool), ('b', bool)]
+        mask = np.array([(0, 0), (0, 1)], dtype=mdtype)
+        test = make_mask(mask, dtype=mask.dtype)
+        assert_equal(test.dtype, bdtype)
+        assert_equal(test, np.array([(0, 0), (0, 1)], dtype=bdtype))
+        # Ensure this also works for void
+        mask = np.array((False, True), dtype='?,?')[()]
+        assert_(isinstance(mask, np.void))
+        test = make_mask(mask, dtype=mask.dtype)
+        assert_equal(test, mask)
+        assert_(test is not mask)
+        mask = np.array((0, 1), dtype='i4,i4')[()]
+        test2 = make_mask(mask, dtype=mask.dtype)
+        assert_equal(test2, test)
+        # test that nomask is returned when m is nomask.
+        bools = [True, False]
+        dtypes = [MaskType, float]
+        msgformat = 'copy=%s, shrink=%s, dtype=%s'
+        for cpy, shr, dt in itertools.product(bools, bools, dtypes):
+            res = make_mask(nomask, copy=cpy, shrink=shr, dtype=dt)
+            assert_(res is nomask, msgformat % (cpy, shr, dt))
+
+    def test_mask_or(self):
+        # Initialize
+        mtype = [('a', bool), ('b', bool)]
+        mask = np.array([(0, 0), (0, 1), (1, 0), (0, 0)], dtype=mtype)
+        # Test using nomask as input
+        test = mask_or(mask, nomask)
+        assert_equal(test, mask)
+        test = mask_or(nomask, mask)
+        assert_equal(test, mask)
+        # Using False as input
+        test = mask_or(mask, False)
+        assert_equal(test, mask)
+        # Using another array w / the same dtype
+        other = np.array([(0, 1), (0, 1), (0, 1), (0, 1)], dtype=mtype)
+        test = mask_or(mask, other)
+        control = np.array([(0, 1), (0, 1), (1, 1), (0, 1)], dtype=mtype)
+        assert_equal(test, control)
+        # Using another array w / a different dtype
+        othertype = [('A', bool), ('B', bool)]
+        other = np.array([(0, 1), (0, 1), (0, 1), (0, 1)], dtype=othertype)
+        try:
+            test = mask_or(mask, other)
+        except ValueError:
+            pass
+        # Using nested arrays
+        dtype = [('a', bool), ('b', [('ba', bool), ('bb', bool)])]
+        amask = np.array([(0, (1, 0)), (0, (1, 0))], dtype=dtype)
+        bmask = np.array([(1, (0, 1)), (0, (0, 0))], dtype=dtype)
+        cntrl = np.array([(1, (1, 1)), (0, (1, 0))], dtype=dtype)
+        assert_equal(mask_or(amask, bmask), cntrl)
+
+    def test_flatten_mask(self):
+        # Tests flatten mask
+        # Standard dtype
+        mask = np.array([0, 0, 1], dtype=bool)
+        assert_equal(flatten_mask(mask), mask)
+        # Flexible dtype
+        mask = np.array([(0, 0), (0, 1)], dtype=[('a', bool), ('b', bool)])
+        test = flatten_mask(mask)
+        control = np.array([0, 0, 0, 1], dtype=bool)
+        assert_equal(test, control)
+
+        mdtype = [('a', bool), ('b', [('ba', bool), ('bb', bool)])]
+        data = [(0, (0, 0)), (0, (0, 1))]
+        mask = np.array(data, dtype=mdtype)
+        test = flatten_mask(mask)
+        control = np.array([0, 0, 0, 0, 0, 1], dtype=bool)
+        assert_equal(test, control)
+
+    def test_on_ndarray(self):
+        # Test functions on ndarrays
+        a = np.array([1, 2, 3, 4])
+        m = array(a, mask=False)
+        test = anom(a)
+        assert_equal(test, m.anom())
+        test = reshape(a, (2, 2))
+        assert_equal(test, m.reshape(2, 2))
+
+    def test_compress(self):
+        # Test compress function on ndarray and masked array
+        # Address Github #2495.
+        arr = np.arange(8)
+        arr.shape = 4, 2
+        cond = np.array([True, False, True, True])
+        control = arr[[0, 2, 3]]
+        test = np.ma.compress(cond, arr, axis=0)
+        assert_equal(test, control)
+        marr = np.ma.array(arr)
+        test = np.ma.compress(cond, marr, axis=0)
+        assert_equal(test, control)
+
+    def test_compressed(self):
+        # Test ma.compressed function.
+        # Address gh-4026
+        a = np.ma.array([1, 2])
+        test = np.ma.compressed(a)
+        assert_(type(test) is np.ndarray)
+
+        # Test case when input data is ndarray subclass
+        class A(np.ndarray):
+            pass
+
+        a = np.ma.array(A(shape=0))
+        test = np.ma.compressed(a)
+        assert_(type(test) is A)
+
+        # Test that compress flattens
+        test = np.ma.compressed([[1],[2]])
+        assert_equal(test.ndim, 1)
+        test = np.ma.compressed([[[[[1]]]]])
+        assert_equal(test.ndim, 1)
+
+        # Test case when input is MaskedArray subclass
+        class M(MaskedArray):
+            pass
+
+        test = np.ma.compressed(M(shape=(0,1,2)))
+        assert_equal(test.ndim, 1)
+
+        # with .compressed() overridden
+        class M(MaskedArray):
+            def compressed(self):
+                return 42
+
+        test = np.ma.compressed(M(shape=(0,1,2)))
+        assert_equal(test, 42)
+
+    def test_convolve(self):
+        a = masked_equal(np.arange(5), 2)
+        b = np.array([1, 1])
+        test = np.ma.convolve(a, b)
+        assert_equal(test, masked_equal([0, 1, -1, -1, 7, 4], -1))
+
+        test = np.ma.convolve(a, b, propagate_mask=False)
+        assert_equal(test, masked_equal([0, 1, 1, 3, 7, 4], -1))
+
+        test = np.ma.convolve([1, 1], [1, 1, 1])
+        assert_equal(test, masked_equal([1, 2, 2, 1], -1))
+
+        a = [1, 1]
+        b = masked_equal([1, -1, -1, 1], -1)
+        test = np.ma.convolve(a, b, propagate_mask=False)
+        assert_equal(test, masked_equal([1, 1, -1, 1, 1], -1))
+        test = np.ma.convolve(a, b, propagate_mask=True)
+        assert_equal(test, masked_equal([-1, -1, -1, -1, -1], -1))
+
+
+class TestMaskedFields:
+
+    def setup(self):
+        ilist = [1, 2, 3, 4, 5]
+        flist = [1.1, 2.2, 3.3, 4.4, 5.5]
+        slist = ['one', 'two', 'three', 'four', 'five']
+        ddtype = [('a', int), ('b', float), ('c', '|S8')]
+        mdtype = [('a', bool), ('b', bool), ('c', bool)]
+        mask = [0, 1, 0, 0, 1]
+        base = array(list(zip(ilist, flist, slist)), mask=mask, dtype=ddtype)
+        self.data = dict(base=base, mask=mask, ddtype=ddtype, mdtype=mdtype)
+
+    def test_set_records_masks(self):
+        base = self.data['base']
+        mdtype = self.data['mdtype']
+        # Set w/ nomask or masked
+        base.mask = nomask
+        assert_equal_records(base._mask, np.zeros(base.shape, dtype=mdtype))
+        base.mask = masked
+        assert_equal_records(base._mask, np.ones(base.shape, dtype=mdtype))
+        # Set w/ simple boolean
+        base.mask = False
+        assert_equal_records(base._mask, np.zeros(base.shape, dtype=mdtype))
+        base.mask = True
+        assert_equal_records(base._mask, np.ones(base.shape, dtype=mdtype))
+        # Set w/ list
+        base.mask = [0, 0, 0, 1, 1]
+        assert_equal_records(base._mask,
+                             np.array([(x, x, x) for x in [0, 0, 0, 1, 1]],
+                                      dtype=mdtype))
+
+    def test_set_record_element(self):
+        # Check setting an element of a record)
+        base = self.data['base']
+        (base_a, base_b, base_c) = (base['a'], base['b'], base['c'])
+        base[0] = (pi, pi, 'pi')
+
+        assert_equal(base_a.dtype, int)
+        assert_equal(base_a._data, [3, 2, 3, 4, 5])
+
+        assert_equal(base_b.dtype, float)
+        assert_equal(base_b._data, [pi, 2.2, 3.3, 4.4, 5.5])
+
+        assert_equal(base_c.dtype, '|S8')
+        assert_equal(base_c._data,
+                     [b'pi', b'two', b'three', b'four', b'five'])
+
+    def test_set_record_slice(self):
+        base = self.data['base']
+        (base_a, base_b, base_c) = (base['a'], base['b'], base['c'])
+        base[:3] = (pi, pi, 'pi')
+
+        assert_equal(base_a.dtype, int)
+        assert_equal(base_a._data, [3, 3, 3, 4, 5])
+
+        assert_equal(base_b.dtype, float)
+        assert_equal(base_b._data, [pi, pi, pi, 4.4, 5.5])
+
+        assert_equal(base_c.dtype, '|S8')
+        assert_equal(base_c._data,
+                     [b'pi', b'pi', b'pi', b'four', b'five'])
+
+    def test_mask_element(self):
+        "Check record access"
+        base = self.data['base']
+        base[0] = masked
+
+        for n in ('a', 'b', 'c'):
+            assert_equal(base[n].mask, [1, 1, 0, 0, 1])
+            assert_equal(base[n]._data, base._data[n])
+
+    def test_getmaskarray(self):
+        # Test getmaskarray on flexible dtype
+        ndtype = [('a', int), ('b', float)]
+        test = empty(3, dtype=ndtype)
+        assert_equal(getmaskarray(test),
+                     np.array([(0, 0), (0, 0), (0, 0)],
+                              dtype=[('a', '|b1'), ('b', '|b1')]))
+        test[:] = masked
+        assert_equal(getmaskarray(test),
+                     np.array([(1, 1), (1, 1), (1, 1)],
+                              dtype=[('a', '|b1'), ('b', '|b1')]))
+
+    def test_view(self):
+        # Test view w/ flexible dtype
+        iterator = list(zip(np.arange(10), np.random.rand(10)))
+        data = np.array(iterator)
+        a = array(iterator, dtype=[('a', float), ('b', float)])
+        a.mask[0] = (1, 0)
+        controlmask = np.array([1] + 19 * [0], dtype=bool)
+        # Transform globally to simple dtype
+        test = a.view(float)
+        assert_equal(test, data.ravel())
+        assert_equal(test.mask, controlmask)
+        # Transform globally to dty
+        test = a.view((float, 2))
+        assert_equal(test, data)
+        assert_equal(test.mask, controlmask.reshape(-1, 2))
+
+    def test_getitem(self):
+        ndtype = [('a', float), ('b', float)]
+        a = array(list(zip(np.random.rand(10), np.arange(10))), dtype=ndtype)
+        a.mask = np.array(list(zip([0, 0, 0, 0, 0, 0, 0, 0, 1, 1],
+                                   [1, 0, 0, 0, 0, 0, 0, 0, 1, 0])),
+                          dtype=[('a', bool), ('b', bool)])
+
+        def _test_index(i):
+            assert_equal(type(a[i]), mvoid)
+            assert_equal_records(a[i]._data, a._data[i])
+            assert_equal_records(a[i]._mask, a._mask[i])
+
+            assert_equal(type(a[i, ...]), MaskedArray)
+            assert_equal_records(a[i,...]._data, a._data[i,...])
+            assert_equal_records(a[i,...]._mask, a._mask[i,...])
+
+        _test_index(1)   # No mask
+        _test_index(0)   # One element masked
+        _test_index(-2)  # All element masked
+
+    def test_setitem(self):
+        # Issue 4866: check that one can set individual items in [record][col]
+        # and [col][record] order
+        ndtype = np.dtype([('a', float), ('b', int)])
+        ma = np.ma.MaskedArray([(1.0, 1), (2.0, 2)], dtype=ndtype)
+        ma['a'][1] = 3.0
+        assert_equal(ma['a'], np.array([1.0, 3.0]))
+        ma[1]['a'] = 4.0
+        assert_equal(ma['a'], np.array([1.0, 4.0]))
+        # Issue 2403
+        mdtype = np.dtype([('a', bool), ('b', bool)])
+        # soft mask
+        control = np.array([(False, True), (True, True)], dtype=mdtype)
+        a = np.ma.masked_all((2,), dtype=ndtype)
+        a['a'][0] = 2
+        assert_equal(a.mask, control)
+        a = np.ma.masked_all((2,), dtype=ndtype)
+        a[0]['a'] = 2
+        assert_equal(a.mask, control)
+        # hard mask
+        control = np.array([(True, True), (True, True)], dtype=mdtype)
+        a = np.ma.masked_all((2,), dtype=ndtype)
+        a.harden_mask()
+        a['a'][0] = 2
+        assert_equal(a.mask, control)
+        a = np.ma.masked_all((2,), dtype=ndtype)
+        a.harden_mask()
+        a[0]['a'] = 2
+        assert_equal(a.mask, control)
+
+    def test_setitem_scalar(self):
+        # 8510
+        mask_0d = np.ma.masked_array(1, mask=True)
+        arr = np.ma.arange(3)
+        arr[0] = mask_0d
+        assert_array_equal(arr.mask, [True, False, False])
+
+    def test_element_len(self):
+        # check that len() works for mvoid (Github issue #576)
+        for rec in self.data['base']:
+            assert_equal(len(rec), len(self.data['ddtype']))
+
+
+class TestMaskedObjectArray:
+
+    def test_getitem(self):
+        arr = np.ma.array([None, None])
+        for dt in [float, object]:
+            a0 = np.eye(2).astype(dt)
+            a1 = np.eye(3).astype(dt)
+            arr[0] = a0
+            arr[1] = a1
+
+            assert_(arr[0] is a0)
+            assert_(arr[1] is a1)
+            assert_(isinstance(arr[0,...], MaskedArray))
+            assert_(isinstance(arr[1,...], MaskedArray))
+            assert_(arr[0,...][()] is a0)
+            assert_(arr[1,...][()] is a1)
+
+            arr[0] = np.ma.masked
+
+            assert_(arr[1] is a1)
+            assert_(isinstance(arr[0,...], MaskedArray))
+            assert_(isinstance(arr[1,...], MaskedArray))
+            assert_equal(arr[0,...].mask, True)
+            assert_(arr[1,...][()] is a1)
+
+            # gh-5962 - object arrays of arrays do something special
+            assert_equal(arr[0].data, a0)
+            assert_equal(arr[0].mask, True)
+            assert_equal(arr[0,...][()].data, a0)
+            assert_equal(arr[0,...][()].mask, True)
+
+    def test_nested_ma(self):
+
+        arr = np.ma.array([None, None])
+        # set the first object to be an unmasked masked constant. A little fiddly
+        arr[0,...] = np.array([np.ma.masked], object)[0,...]
+
+        # check the above line did what we were aiming for
+        assert_(arr.data[0] is np.ma.masked)
+
+        # test that getitem returned the value by identity
+        assert_(arr[0] is np.ma.masked)
+
+        # now mask the masked value!
+        arr[0] = np.ma.masked
+        assert_(arr[0] is np.ma.masked)
+
+
+class TestMaskedView:
+
+    def setup(self):
+        iterator = list(zip(np.arange(10), np.random.rand(10)))
+        data = np.array(iterator)
+        a = array(iterator, dtype=[('a', float), ('b', float)])
+        a.mask[0] = (1, 0)
+        controlmask = np.array([1] + 19 * [0], dtype=bool)
+        self.data = (data, a, controlmask)
+
+    def test_view_to_nothing(self):
+        (data, a, controlmask) = self.data
+        test = a.view()
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test._data, a._data)
+        assert_equal(test._mask, a._mask)
+
+    def test_view_to_type(self):
+        (data, a, controlmask) = self.data
+        test = a.view(np.ndarray)
+        assert_(not isinstance(test, MaskedArray))
+        assert_equal(test, a._data)
+        assert_equal_records(test, data.view(a.dtype).squeeze())
+
+    def test_view_to_simple_dtype(self):
+        (data, a, controlmask) = self.data
+        # View globally
+        test = a.view(float)
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, data.ravel())
+        assert_equal(test.mask, controlmask)
+
+    def test_view_to_flexible_dtype(self):
+        (data, a, controlmask) = self.data
+
+        test = a.view([('A', float), ('B', float)])
+        assert_equal(test.mask.dtype.names, ('A', 'B'))
+        assert_equal(test['A'], a['a'])
+        assert_equal(test['B'], a['b'])
+
+        test = a[0].view([('A', float), ('B', float)])
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test.mask.dtype.names, ('A', 'B'))
+        assert_equal(test['A'], a['a'][0])
+        assert_equal(test['B'], a['b'][0])
+
+        test = a[-1].view([('A', float), ('B', float)])
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test.dtype.names, ('A', 'B'))
+        assert_equal(test['A'], a['a'][-1])
+        assert_equal(test['B'], a['b'][-1])
+
+    def test_view_to_subdtype(self):
+        (data, a, controlmask) = self.data
+        # View globally
+        test = a.view((float, 2))
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, data)
+        assert_equal(test.mask, controlmask.reshape(-1, 2))
+        # View on 1 masked element
+        test = a[0].view((float, 2))
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, data[0])
+        assert_equal(test.mask, (1, 0))
+        # View on 1 unmasked element
+        test = a[-1].view((float, 2))
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, data[-1])
+
+    def test_view_to_dtype_and_type(self):
+        (data, a, controlmask) = self.data
+
+        test = a.view((float, 2), np.recarray)
+        assert_equal(test, data)
+        assert_(isinstance(test, np.recarray))
+        assert_(not isinstance(test, MaskedArray))
+
+
+class TestOptionalArgs:
+    def test_ndarrayfuncs(self):
+        # test axis arg behaves the same as ndarray (including multiple axes)
+
+        d = np.arange(24.0).reshape((2,3,4))
+        m = np.zeros(24, dtype=bool).reshape((2,3,4))
+        # mask out last element of last dimension
+        m[:,:,-1] = True
+        a = np.ma.array(d, mask=m)
+
+        def testaxis(f, a, d):
+            numpy_f = numpy.__getattribute__(f)
+            ma_f = np.ma.__getattribute__(f)
+
+            # test axis arg
+            assert_equal(ma_f(a, axis=1)[...,:-1], numpy_f(d[...,:-1], axis=1))
+            assert_equal(ma_f(a, axis=(0,1))[...,:-1],
+                         numpy_f(d[...,:-1], axis=(0,1)))
+
+        def testkeepdims(f, a, d):
+            numpy_f = numpy.__getattribute__(f)
+            ma_f = np.ma.__getattribute__(f)
+
+            # test keepdims arg
+            assert_equal(ma_f(a, keepdims=True).shape,
+                         numpy_f(d, keepdims=True).shape)
+            assert_equal(ma_f(a, keepdims=False).shape,
+                         numpy_f(d, keepdims=False).shape)
+
+            # test both at once
+            assert_equal(ma_f(a, axis=1, keepdims=True)[...,:-1],
+                         numpy_f(d[...,:-1], axis=1, keepdims=True))
+            assert_equal(ma_f(a, axis=(0,1), keepdims=True)[...,:-1],
+                         numpy_f(d[...,:-1], axis=(0,1), keepdims=True))
+
+        for f in ['sum', 'prod', 'mean', 'var', 'std']:
+            testaxis(f, a, d)
+            testkeepdims(f, a, d)
+
+        for f in ['min', 'max']:
+            testaxis(f, a, d)
+
+        d = (np.arange(24).reshape((2,3,4))%2 == 0)
+        a = np.ma.array(d, mask=m)
+        for f in ['all', 'any']:
+            testaxis(f, a, d)
+            testkeepdims(f, a, d)
+
+    def test_count(self):
+        # test np.ma.count specially
+
+        d = np.arange(24.0).reshape((2,3,4))
+        m = np.zeros(24, dtype=bool).reshape((2,3,4))
+        m[:,0,:] = True
+        a = np.ma.array(d, mask=m)
+
+        assert_equal(count(a), 16)
+        assert_equal(count(a, axis=1), 2*ones((2,4)))
+        assert_equal(count(a, axis=(0,1)), 4*ones((4,)))
+        assert_equal(count(a, keepdims=True), 16*ones((1,1,1)))
+        assert_equal(count(a, axis=1, keepdims=True), 2*ones((2,1,4)))
+        assert_equal(count(a, axis=(0,1), keepdims=True), 4*ones((1,1,4)))
+        assert_equal(count(a, axis=-2), 2*ones((2,4)))
+        assert_raises(ValueError, count, a, axis=(1,1))
+        assert_raises(np.AxisError, count, a, axis=3)
+
+        # check the 'nomask' path
+        a = np.ma.array(d, mask=nomask)
+
+        assert_equal(count(a), 24)
+        assert_equal(count(a, axis=1), 3*ones((2,4)))
+        assert_equal(count(a, axis=(0,1)), 6*ones((4,)))
+        assert_equal(count(a, keepdims=True), 24*ones((1,1,1)))
+        assert_equal(np.ndim(count(a, keepdims=True)), 3)
+        assert_equal(count(a, axis=1, keepdims=True), 3*ones((2,1,4)))
+        assert_equal(count(a, axis=(0,1), keepdims=True), 6*ones((1,1,4)))
+        assert_equal(count(a, axis=-2), 3*ones((2,4)))
+        assert_raises(ValueError, count, a, axis=(1,1))
+        assert_raises(np.AxisError, count, a, axis=3)
+
+        # check the 'masked' singleton
+        assert_equal(count(np.ma.masked), 0)
+
+        # check 0-d arrays do not allow axis > 0
+        assert_raises(np.AxisError, count, np.ma.array(1), axis=1)
+
+
+class TestMaskedConstant:
+    def _do_add_test(self, add):
+        # sanity check
+        assert_(add(np.ma.masked, 1) is np.ma.masked)
+
+        # now try with a vector
+        vector = np.array([1, 2, 3])
+        result = add(np.ma.masked, vector)
+
+        # lots of things could go wrong here
+        assert_(result is not np.ma.masked)
+        assert_(not isinstance(result, np.ma.core.MaskedConstant))
+        assert_equal(result.shape, vector.shape)
+        assert_equal(np.ma.getmask(result), np.ones(vector.shape, dtype=bool))
+
+    def test_ufunc(self):
+        self._do_add_test(np.add)
+
+    def test_operator(self):
+        self._do_add_test(lambda a, b: a + b)
+
+    def test_ctor(self):
+        m = np.ma.array(np.ma.masked)
+
+        # most importantly, we do not want to create a new MaskedConstant
+        # instance
+        assert_(not isinstance(m, np.ma.core.MaskedConstant))
+        assert_(m is not np.ma.masked)
+
+    def test_repr(self):
+        # copies should not exist, but if they do, it should be obvious that
+        # something is wrong
+        assert_equal(repr(np.ma.masked), 'masked')
+
+        # create a new instance in a weird way
+        masked2 = np.ma.MaskedArray.__new__(np.ma.core.MaskedConstant)
+        assert_not_equal(repr(masked2), 'masked')
+
+    def test_pickle(self):
+        from io import BytesIO
+
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            with BytesIO() as f:
+                pickle.dump(np.ma.masked, f, protocol=proto)
+                f.seek(0)
+                res = pickle.load(f)
+            assert_(res is np.ma.masked)
+
+    def test_copy(self):
+        # gh-9328
+        # copy is a no-op, like it is with np.True_
+        assert_equal(
+            np.ma.masked.copy() is np.ma.masked,
+            np.True_.copy() is np.True_)
+
+    def test__copy(self):
+        import copy
+        assert_(
+            copy.copy(np.ma.masked) is np.ma.masked)
+
+    def test_deepcopy(self):
+        import copy
+        assert_(
+            copy.deepcopy(np.ma.masked) is np.ma.masked)
+
+    def test_immutable(self):
+        orig = np.ma.masked
+        assert_raises(np.ma.core.MaskError, operator.setitem, orig, (), 1)
+        assert_raises(ValueError,operator.setitem, orig.data, (), 1)
+        assert_raises(ValueError, operator.setitem, orig.mask, (), False)
+
+        view = np.ma.masked.view(np.ma.MaskedArray)
+        assert_raises(ValueError, operator.setitem, view, (), 1)
+        assert_raises(ValueError, operator.setitem, view.data, (), 1)
+        assert_raises(ValueError, operator.setitem, view.mask, (), False)
+
+    def test_coercion_int(self):
+        a_i = np.zeros((), int)
+        assert_raises(MaskError, operator.setitem, a_i, (), np.ma.masked)
+        assert_raises(MaskError, int, np.ma.masked)
+
+    def test_coercion_float(self):
+        a_f = np.zeros((), float)
+        assert_warns(UserWarning, operator.setitem, a_f, (), np.ma.masked)
+        assert_(np.isnan(a_f[()]))
+
+    @pytest.mark.xfail(reason="See gh-9750")
+    def test_coercion_unicode(self):
+        a_u = np.zeros((), 'U10')
+        a_u[()] = np.ma.masked
+        assert_equal(a_u[()], u'--')
+
+    @pytest.mark.xfail(reason="See gh-9750")
+    def test_coercion_bytes(self):
+        a_b = np.zeros((), 'S10')
+        a_b[()] = np.ma.masked
+        assert_equal(a_b[()], b'--')
+
+    def test_subclass(self):
+        # https://github.com/astropy/astropy/issues/6645
+        class Sub(type(np.ma.masked)): pass
+
+        a = Sub()
+        assert_(a is Sub())
+        assert_(a is not np.ma.masked)
+        assert_not_equal(repr(a), 'masked')
+
+    def test_attributes_readonly(self):
+        assert_raises(AttributeError, setattr, np.ma.masked, 'shape', (1,))
+        assert_raises(AttributeError, setattr, np.ma.masked, 'dtype', np.int64)
+
+
+class TestMaskedWhereAliases:
+
+    # TODO: Test masked_object, masked_equal, ...
+
+    def test_masked_values(self):
+        res = masked_values(np.array([-32768.0]), np.int16(-32768))
+        assert_equal(res.mask, [True])
+
+        res = masked_values(np.inf, np.inf)
+        assert_equal(res.mask, True)
+
+        res = np.ma.masked_values(np.inf, -np.inf)
+        assert_equal(res.mask, False)
+
+        res = np.ma.masked_values([1, 2, 3, 4], 5, shrink=True)
+        assert_(res.mask is np.ma.nomask)
+
+        res = np.ma.masked_values([1, 2, 3, 4], 5, shrink=False)
+        assert_equal(res.mask, [False] * 4)
+
+
+def test_masked_array():
+    a = np.ma.array([0, 1, 2, 3], mask=[0, 0, 1, 0])
+    assert_equal(np.argwhere(a), [[1], [3]])
+
+def test_append_masked_array():
+    a = np.ma.masked_equal([1,2,3], value=2)
+    b = np.ma.masked_equal([4,3,2], value=2)
+
+    result = np.ma.append(a, b)
+    expected_data = [1, 2, 3, 4, 3, 2]
+    expected_mask = [False, True, False, False, False, True]
+    assert_array_equal(result.data, expected_data)
+    assert_array_equal(result.mask, expected_mask)
+
+    a = np.ma.masked_all((2,2))
+    b = np.ma.ones((3,1))
+
+    result = np.ma.append(a, b)
+    expected_data = [1] * 3
+    expected_mask = [True] * 4 + [False] * 3
+    assert_array_equal(result.data[-3], expected_data)
+    assert_array_equal(result.mask, expected_mask)
+
+    result = np.ma.append(a, b, axis=None)
+    assert_array_equal(result.data[-3], expected_data)
+    assert_array_equal(result.mask, expected_mask)
+
+
+def test_append_masked_array_along_axis():
+    a = np.ma.masked_equal([1,2,3], value=2)
+    b = np.ma.masked_values([[4, 5, 6], [7, 8, 9]], 7)
+
+    # When `axis` is specified, `values` must have the correct shape.
+    assert_raises(ValueError, np.ma.append, a, b, axis=0)
+
+    result = np.ma.append(a[np.newaxis,:], b, axis=0)
+    expected = np.ma.arange(1, 10)
+    expected[[1, 6]] = np.ma.masked
+    expected = expected.reshape((3,3))
+    assert_array_equal(result.data, expected.data)
+    assert_array_equal(result.mask, expected.mask)
+
+
+def test_default_fill_value_complex():
+    # regression test for Python 3, where 'unicode' was not defined
+    assert_(default_fill_value(1 + 1j) == 1.e20 + 0.0j)
+
+
+def test_ufunc_with_output():
+    # check that giving an output argument always returns that output.
+    # Regression test for gh-8416.
+    x = array([1., 2., 3.], mask=[0, 0, 1])
+    y = np.add(x, 1., out=x)
+    assert_(y is x)
+
+
+def test_ufunc_with_out_varied():
+    """ Test that masked arrays are immune to gh-10459 """
+    # the mask of the output should not affect the result, however it is passed
+    a        = array([ 1,  2,  3], mask=[1, 0, 0])
+    b        = array([10, 20, 30], mask=[1, 0, 0])
+    out      = array([ 0,  0,  0], mask=[0, 0, 1])
+    expected = array([11, 22, 33], mask=[1, 0, 0])
+
+    out_pos = out.copy()
+    res_pos = np.add(a, b, out_pos)
+
+    out_kw = out.copy()
+    res_kw = np.add(a, b, out=out_kw)
+
+    out_tup = out.copy()
+    res_tup = np.add(a, b, out=(out_tup,))
+
+    assert_equal(res_kw.mask,  expected.mask)
+    assert_equal(res_kw.data,  expected.data)
+    assert_equal(res_tup.mask, expected.mask)
+    assert_equal(res_tup.data, expected.data)
+    assert_equal(res_pos.mask, expected.mask)
+    assert_equal(res_pos.data, expected.data)
+
+
+def test_astype_mask_ordering():
+    descr = [('v', int, 3), ('x', [('y', float)])]
+    x = array([
+        [([1, 2, 3], (1.0,)),  ([1, 2, 3], (2.0,))],
+        [([1, 2, 3], (3.0,)),  ([1, 2, 3], (4.0,))]], dtype=descr)
+    x[0]['v'][0] = np.ma.masked
+
+    x_a = x.astype(descr)
+    assert x_a.dtype.names == np.dtype(descr).names
+    assert x_a.mask.dtype.names == np.dtype(descr).names
+    assert_equal(x, x_a)
+
+    assert_(x is x.astype(x.dtype, copy=False))
+    assert_equal(type(x.astype(x.dtype, subok=False)), np.ndarray)
+
+    x_f = x.astype(x.dtype, order='F')
+    assert_(x_f.flags.f_contiguous)
+    assert_(x_f.mask.flags.f_contiguous)
+
+    # Also test the same indirectly, via np.array
+    x_a2 = np.array(x, dtype=descr, subok=True)
+    assert x_a2.dtype.names == np.dtype(descr).names
+    assert x_a2.mask.dtype.names == np.dtype(descr).names
+    assert_equal(x, x_a2)
+
+    assert_(x is np.array(x, dtype=descr, copy=False, subok=True))
+
+    x_f2 = np.array(x, dtype=x.dtype, order='F', subok=True)
+    assert_(x_f2.flags.f_contiguous)
+    assert_(x_f2.mask.flags.f_contiguous)
+
+
+@pytest.mark.parametrize('dt1', num_dts, ids=num_ids)
+@pytest.mark.parametrize('dt2', num_dts, ids=num_ids)
+@pytest.mark.filterwarnings('ignore::numpy.ComplexWarning')
+def test_astype_basic(dt1, dt2):
+    # See gh-12070
+    src = np.ma.array(ones(3, dt1), fill_value=1)
+    dst = src.astype(dt2)
+
+    assert_(src.fill_value == 1)
+    assert_(src.dtype == dt1)
+    assert_(src.fill_value.dtype == dt1)
+
+    assert_(dst.fill_value == 1)
+    assert_(dst.dtype == dt2)
+    assert_(dst.fill_value.dtype == dt2)
+
+    assert_equal(src, dst)
+
+
+def test_fieldless_void():
+    dt = np.dtype([])  # a void dtype with no fields
+    x = np.empty(4, dt)
+
+    # these arrays contain no values, so there's little to test - but this
+    # shouldn't crash
+    mx = np.ma.array(x)
+    assert_equal(mx.dtype, x.dtype)
+    assert_equal(mx.shape, x.shape)
+
+    mx = np.ma.array(x, mask=x)
+    assert_equal(mx.dtype, x.dtype)
+    assert_equal(mx.shape, x.shape)
+
+
+def test_mask_shape_assignment_does_not_break_masked():
+    a = np.ma.masked
+    b = np.ma.array(1, mask=a.mask)
+    b.shape = (1,)
+    assert_equal(a.mask.shape, ())
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_deprecations.py b/venv/Lib/site-packages/numpy/ma/tests/test_deprecations.py
new file mode 100644
index 000000000..14f697375
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_deprecations.py
@@ -0,0 +1,68 @@
+"""Test deprecation and future warnings.
+
+"""
+import numpy as np
+from numpy.testing import assert_warns
+from numpy.ma.testutils import assert_equal
+from numpy.ma.core import MaskedArrayFutureWarning
+
+class TestArgsort:
+    """ gh-8701 """
+    def _test_base(self, argsort, cls):
+        arr_0d = np.array(1).view(cls)
+        argsort(arr_0d)
+
+        arr_1d = np.array([1, 2, 3]).view(cls)
+        argsort(arr_1d)
+
+        # argsort has a bad default for >1d arrays
+        arr_2d = np.array([[1, 2], [3, 4]]).view(cls)
+        result = assert_warns(
+            np.ma.core.MaskedArrayFutureWarning, argsort, arr_2d)
+        assert_equal(result, argsort(arr_2d, axis=None))
+
+        # should be no warnings for explicitly specifying it
+        argsort(arr_2d, axis=None)
+        argsort(arr_2d, axis=-1)
+
+    def test_function_ndarray(self):
+        return self._test_base(np.ma.argsort, np.ndarray)
+
+    def test_function_maskedarray(self):
+        return self._test_base(np.ma.argsort, np.ma.MaskedArray)
+
+    def test_method(self):
+        return self._test_base(np.ma.MaskedArray.argsort, np.ma.MaskedArray)
+
+
+class TestMinimumMaximum:
+    def test_minimum(self):
+        assert_warns(DeprecationWarning, np.ma.minimum, np.ma.array([1, 2]))
+
+    def test_maximum(self):
+        assert_warns(DeprecationWarning, np.ma.maximum, np.ma.array([1, 2]))
+
+    def test_axis_default(self):
+        # NumPy 1.13, 2017-05-06
+
+        data1d = np.ma.arange(6)
+        data2d = data1d.reshape(2, 3)
+
+        ma_min = np.ma.minimum.reduce
+        ma_max = np.ma.maximum.reduce
+
+        # check that the default axis is still None, but warns on 2d arrays
+        result = assert_warns(MaskedArrayFutureWarning, ma_max, data2d)
+        assert_equal(result, ma_max(data2d, axis=None))
+
+        result = assert_warns(MaskedArrayFutureWarning, ma_min, data2d)
+        assert_equal(result, ma_min(data2d, axis=None))
+
+        # no warnings on 1d, as both new and old defaults are equivalent
+        result = ma_min(data1d)
+        assert_equal(result, ma_min(data1d, axis=None))
+        assert_equal(result, ma_min(data1d, axis=0))
+
+        result = ma_max(data1d)
+        assert_equal(result, ma_max(data1d, axis=None))
+        assert_equal(result, ma_max(data1d, axis=0))
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_extras.py b/venv/Lib/site-packages/numpy/ma/tests/test_extras.py
new file mode 100644
index 000000000..d237829cb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_extras.py
@@ -0,0 +1,1688 @@
+# pylint: disable-msg=W0611, W0612, W0511
+"""Tests suite for MaskedArray.
+Adapted from the original test_ma by Pierre Gerard-Marchant
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+:version: $Id: test_extras.py 3473 2007-10-29 15:18:13Z jarrod.millman $
+
+"""
+import warnings
+import itertools
+import pytest
+
+import numpy as np
+from numpy.testing import (
+    assert_warns, suppress_warnings
+    )
+from numpy.ma.testutils import (
+    assert_, assert_array_equal, assert_equal, assert_almost_equal
+    )
+from numpy.ma.core import (
+    array, arange, masked, MaskedArray, masked_array, getmaskarray, shape,
+    nomask, ones, zeros, count
+    )
+from numpy.ma.extras import (
+    atleast_1d, atleast_2d, atleast_3d, mr_, dot, polyfit, cov, corrcoef,
+    median, average, unique, setxor1d, setdiff1d, union1d, intersect1d, in1d,
+    ediff1d, apply_over_axes, apply_along_axis, compress_nd, compress_rowcols,
+    mask_rowcols, clump_masked, clump_unmasked, flatnotmasked_contiguous,
+    notmasked_contiguous, notmasked_edges, masked_all, masked_all_like, isin,
+    diagflat, stack, vstack
+    )
+
+
+class TestGeneric:
+    #
+    def test_masked_all(self):
+        # Tests masked_all
+        # Standard dtype
+        test = masked_all((2,), dtype=float)
+        control = array([1, 1], mask=[1, 1], dtype=float)
+        assert_equal(test, control)
+        # Flexible dtype
+        dt = np.dtype({'names': ['a', 'b'], 'formats': ['f', 'f']})
+        test = masked_all((2,), dtype=dt)
+        control = array([(0, 0), (0, 0)], mask=[(1, 1), (1, 1)], dtype=dt)
+        assert_equal(test, control)
+        test = masked_all((2, 2), dtype=dt)
+        control = array([[(0, 0), (0, 0)], [(0, 0), (0, 0)]],
+                        mask=[[(1, 1), (1, 1)], [(1, 1), (1, 1)]],
+                        dtype=dt)
+        assert_equal(test, control)
+        # Nested dtype
+        dt = np.dtype([('a', 'f'), ('b', [('ba', 'f'), ('bb', 'f')])])
+        test = masked_all((2,), dtype=dt)
+        control = array([(1, (1, 1)), (1, (1, 1))],
+                        mask=[(1, (1, 1)), (1, (1, 1))], dtype=dt)
+        assert_equal(test, control)
+        test = masked_all((2,), dtype=dt)
+        control = array([(1, (1, 1)), (1, (1, 1))],
+                        mask=[(1, (1, 1)), (1, (1, 1))], dtype=dt)
+        assert_equal(test, control)
+        test = masked_all((1, 1), dtype=dt)
+        control = array([[(1, (1, 1))]], mask=[[(1, (1, 1))]], dtype=dt)
+        assert_equal(test, control)
+
+    def test_masked_all_with_object_nested(self):
+        # Test masked_all works with nested array with dtype of an 'object'
+        # refers to issue #15895
+        my_dtype = np.dtype([('b', ([('c', object)], (1,)))])
+        masked_arr = np.ma.masked_all((1,), my_dtype)
+
+        assert_equal(type(masked_arr['b']), np.ma.core.MaskedArray)
+        assert_equal(type(masked_arr['b']['c']), np.ma.core.MaskedArray)
+        assert_equal(len(masked_arr['b']['c']), 1)
+        assert_equal(masked_arr['b']['c'].shape, (1, 1))
+        assert_equal(masked_arr['b']['c']._fill_value.shape, ())
+    
+    def test_masked_all_with_object(self):
+        # same as above except that the array is not nested
+        my_dtype = np.dtype([('b', (object, (1,)))])
+        masked_arr = np.ma.masked_all((1,), my_dtype)
+
+        assert_equal(type(masked_arr['b']), np.ma.core.MaskedArray)
+        assert_equal(len(masked_arr['b']), 1)
+        assert_equal(masked_arr['b'].shape, (1, 1))
+        assert_equal(masked_arr['b']._fill_value.shape, ())
+
+    def test_masked_all_like(self):
+        # Tests masked_all
+        # Standard dtype
+        base = array([1, 2], dtype=float)
+        test = masked_all_like(base)
+        control = array([1, 1], mask=[1, 1], dtype=float)
+        assert_equal(test, control)
+        # Flexible dtype
+        dt = np.dtype({'names': ['a', 'b'], 'formats': ['f', 'f']})
+        base = array([(0, 0), (0, 0)], mask=[(1, 1), (1, 1)], dtype=dt)
+        test = masked_all_like(base)
+        control = array([(10, 10), (10, 10)], mask=[(1, 1), (1, 1)], dtype=dt)
+        assert_equal(test, control)
+        # Nested dtype
+        dt = np.dtype([('a', 'f'), ('b', [('ba', 'f'), ('bb', 'f')])])
+        control = array([(1, (1, 1)), (1, (1, 1))],
+                        mask=[(1, (1, 1)), (1, (1, 1))], dtype=dt)
+        test = masked_all_like(control)
+        assert_equal(test, control)
+
+    def check_clump(self, f):
+        for i in range(1, 7):
+            for j in range(2**i):
+                k = np.arange(i, dtype=int)
+                ja = np.full(i, j, dtype=int)
+                a = masked_array(2**k)
+                a.mask = (ja & (2**k)) != 0
+                s = 0
+                for sl in f(a):
+                    s += a.data[sl].sum()
+                if f == clump_unmasked:
+                    assert_equal(a.compressed().sum(), s)
+                else:
+                    a.mask = ~a.mask
+                    assert_equal(a.compressed().sum(), s)
+
+    def test_clump_masked(self):
+        # Test clump_masked
+        a = masked_array(np.arange(10))
+        a[[0, 1, 2, 6, 8, 9]] = masked
+        #
+        test = clump_masked(a)
+        control = [slice(0, 3), slice(6, 7), slice(8, 10)]
+        assert_equal(test, control)
+
+        self.check_clump(clump_masked)
+
+    def test_clump_unmasked(self):
+        # Test clump_unmasked
+        a = masked_array(np.arange(10))
+        a[[0, 1, 2, 6, 8, 9]] = masked
+        test = clump_unmasked(a)
+        control = [slice(3, 6), slice(7, 8), ]
+        assert_equal(test, control)
+
+        self.check_clump(clump_unmasked)
+
+    def test_flatnotmasked_contiguous(self):
+        # Test flatnotmasked_contiguous
+        a = arange(10)
+        # No mask
+        test = flatnotmasked_contiguous(a)
+        assert_equal(test, [slice(0, a.size)])
+        # mask of all false
+        a.mask = np.zeros(10, dtype=bool)
+        assert_equal(test, [slice(0, a.size)])
+        # Some mask
+        a[(a < 3) | (a > 8) | (a == 5)] = masked
+        test = flatnotmasked_contiguous(a)
+        assert_equal(test, [slice(3, 5), slice(6, 9)])
+        #
+        a[:] = masked
+        test = flatnotmasked_contiguous(a)
+        assert_equal(test, [])
+
+
+class TestAverage:
+    # Several tests of average. Why so many ? Good point...
+    def test_testAverage1(self):
+        # Test of average.
+        ott = array([0., 1., 2., 3.], mask=[True, False, False, False])
+        assert_equal(2.0, average(ott, axis=0))
+        assert_equal(2.0, average(ott, weights=[1., 1., 2., 1.]))
+        result, wts = average(ott, weights=[1., 1., 2., 1.], returned=True)
+        assert_equal(2.0, result)
+        assert_(wts == 4.0)
+        ott[:] = masked
+        assert_equal(average(ott, axis=0).mask, [True])
+        ott = array([0., 1., 2., 3.], mask=[True, False, False, False])
+        ott = ott.reshape(2, 2)
+        ott[:, 1] = masked
+        assert_equal(average(ott, axis=0), [2.0, 0.0])
+        assert_equal(average(ott, axis=1).mask[0], [True])
+        assert_equal([2., 0.], average(ott, axis=0))
+        result, wts = average(ott, axis=0, returned=True)
+        assert_equal(wts, [1., 0.])
+
+    def test_testAverage2(self):
+        # More tests of average.
+        w1 = [0, 1, 1, 1, 1, 0]
+        w2 = [[0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 0, 1]]
+        x = arange(6, dtype=np.float_)
+        assert_equal(average(x, axis=0), 2.5)
+        assert_equal(average(x, axis=0, weights=w1), 2.5)
+        y = array([arange(6, dtype=np.float_), 2.0 * arange(6)])
+        assert_equal(average(y, None), np.add.reduce(np.arange(6)) * 3. / 12.)
+        assert_equal(average(y, axis=0), np.arange(6) * 3. / 2.)
+        assert_equal(average(y, axis=1),
+                     [average(x, axis=0), average(x, axis=0) * 2.0])
+        assert_equal(average(y, None, weights=w2), 20. / 6.)
+        assert_equal(average(y, axis=0, weights=w2),
+                     [0., 1., 2., 3., 4., 10.])
+        assert_equal(average(y, axis=1),
+                     [average(x, axis=0), average(x, axis=0) * 2.0])
+        m1 = zeros(6)
+        m2 = [0, 0, 1, 1, 0, 0]
+        m3 = [[0, 0, 1, 1, 0, 0], [0, 1, 1, 1, 1, 0]]
+        m4 = ones(6)
+        m5 = [0, 1, 1, 1, 1, 1]
+        assert_equal(average(masked_array(x, m1), axis=0), 2.5)
+        assert_equal(average(masked_array(x, m2), axis=0), 2.5)
+        assert_equal(average(masked_array(x, m4), axis=0).mask, [True])
+        assert_equal(average(masked_array(x, m5), axis=0), 0.0)
+        assert_equal(count(average(masked_array(x, m4), axis=0)), 0)
+        z = masked_array(y, m3)
+        assert_equal(average(z, None), 20. / 6.)
+        assert_equal(average(z, axis=0), [0., 1., 99., 99., 4.0, 7.5])
+        assert_equal(average(z, axis=1), [2.5, 5.0])
+        assert_equal(average(z, axis=0, weights=w2),
+                     [0., 1., 99., 99., 4.0, 10.0])
+
+    def test_testAverage3(self):
+        # Yet more tests of average!
+        a = arange(6)
+        b = arange(6) * 3
+        r1, w1 = average([[a, b], [b, a]], axis=1, returned=True)
+        assert_equal(shape(r1), shape(w1))
+        assert_equal(r1.shape, w1.shape)
+        r2, w2 = average(ones((2, 2, 3)), axis=0, weights=[3, 1], returned=True)
+        assert_equal(shape(w2), shape(r2))
+        r2, w2 = average(ones((2, 2, 3)), returned=True)
+        assert_equal(shape(w2), shape(r2))
+        r2, w2 = average(ones((2, 2, 3)), weights=ones((2, 2, 3)), returned=True)
+        assert_equal(shape(w2), shape(r2))
+        a2d = array([[1, 2], [0, 4]], float)
+        a2dm = masked_array(a2d, [[False, False], [True, False]])
+        a2da = average(a2d, axis=0)
+        assert_equal(a2da, [0.5, 3.0])
+        a2dma = average(a2dm, axis=0)
+        assert_equal(a2dma, [1.0, 3.0])
+        a2dma = average(a2dm, axis=None)
+        assert_equal(a2dma, 7. / 3.)
+        a2dma = average(a2dm, axis=1)
+        assert_equal(a2dma, [1.5, 4.0])
+
+    def test_onintegers_with_mask(self):
+        # Test average on integers with mask
+        a = average(array([1, 2]))
+        assert_equal(a, 1.5)
+        a = average(array([1, 2, 3, 4], mask=[False, False, True, True]))
+        assert_equal(a, 1.5)
+
+    def test_complex(self):
+        # Test with complex data.
+        # (Regression test for https://github.com/numpy/numpy/issues/2684)
+        mask = np.array([[0, 0, 0, 1, 0],
+                         [0, 1, 0, 0, 0]], dtype=bool)
+        a = masked_array([[0, 1+2j, 3+4j, 5+6j, 7+8j],
+                          [9j, 0+1j, 2+3j, 4+5j, 7+7j]],
+                         mask=mask)
+
+        av = average(a)
+        expected = np.average(a.compressed())
+        assert_almost_equal(av.real, expected.real)
+        assert_almost_equal(av.imag, expected.imag)
+
+        av0 = average(a, axis=0)
+        expected0 = average(a.real, axis=0) + average(a.imag, axis=0)*1j
+        assert_almost_equal(av0.real, expected0.real)
+        assert_almost_equal(av0.imag, expected0.imag)
+
+        av1 = average(a, axis=1)
+        expected1 = average(a.real, axis=1) + average(a.imag, axis=1)*1j
+        assert_almost_equal(av1.real, expected1.real)
+        assert_almost_equal(av1.imag, expected1.imag)
+
+        # Test with the 'weights' argument.
+        wts = np.array([[0.5, 1.0, 2.0, 1.0, 0.5],
+                        [1.0, 1.0, 1.0, 1.0, 1.0]])
+        wav = average(a, weights=wts)
+        expected = np.average(a.compressed(), weights=wts[~mask])
+        assert_almost_equal(wav.real, expected.real)
+        assert_almost_equal(wav.imag, expected.imag)
+
+        wav0 = average(a, weights=wts, axis=0)
+        expected0 = (average(a.real, weights=wts, axis=0) +
+                     average(a.imag, weights=wts, axis=0)*1j)
+        assert_almost_equal(wav0.real, expected0.real)
+        assert_almost_equal(wav0.imag, expected0.imag)
+
+        wav1 = average(a, weights=wts, axis=1)
+        expected1 = (average(a.real, weights=wts, axis=1) +
+                     average(a.imag, weights=wts, axis=1)*1j)
+        assert_almost_equal(wav1.real, expected1.real)
+        assert_almost_equal(wav1.imag, expected1.imag)
+
+
+class TestConcatenator:
+    # Tests for mr_, the equivalent of r_ for masked arrays.
+
+    def test_1d(self):
+        # Tests mr_ on 1D arrays.
+        assert_array_equal(mr_[1, 2, 3, 4, 5, 6], array([1, 2, 3, 4, 5, 6]))
+        b = ones(5)
+        m = [1, 0, 0, 0, 0]
+        d = masked_array(b, mask=m)
+        c = mr_[d, 0, 0, d]
+        assert_(isinstance(c, MaskedArray))
+        assert_array_equal(c, [1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1])
+        assert_array_equal(c.mask, mr_[m, 0, 0, m])
+
+    def test_2d(self):
+        # Tests mr_ on 2D arrays.
+        a_1 = np.random.rand(5, 5)
+        a_2 = np.random.rand(5, 5)
+        m_1 = np.round_(np.random.rand(5, 5), 0)
+        m_2 = np.round_(np.random.rand(5, 5), 0)
+        b_1 = masked_array(a_1, mask=m_1)
+        b_2 = masked_array(a_2, mask=m_2)
+        # append columns
+        d = mr_['1', b_1, b_2]
+        assert_(d.shape == (5, 10))
+        assert_array_equal(d[:, :5], b_1)
+        assert_array_equal(d[:, 5:], b_2)
+        assert_array_equal(d.mask, np.r_['1', m_1, m_2])
+        d = mr_[b_1, b_2]
+        assert_(d.shape == (10, 5))
+        assert_array_equal(d[:5,:], b_1)
+        assert_array_equal(d[5:,:], b_2)
+        assert_array_equal(d.mask, np.r_[m_1, m_2])
+
+    def test_masked_constant(self):
+        actual = mr_[np.ma.masked, 1]
+        assert_equal(actual.mask, [True, False])
+        assert_equal(actual.data[1], 1)
+
+        actual = mr_[[1, 2], np.ma.masked]
+        assert_equal(actual.mask, [False, False, True])
+        assert_equal(actual.data[:2], [1, 2])
+
+
+class TestNotMasked:
+    # Tests notmasked_edges and notmasked_contiguous.
+
+    def test_edges(self):
+        # Tests unmasked_edges
+        data = masked_array(np.arange(25).reshape(5, 5),
+                            mask=[[0, 0, 1, 0, 0],
+                                  [0, 0, 0, 1, 1],
+                                  [1, 1, 0, 0, 0],
+                                  [0, 0, 0, 0, 0],
+                                  [1, 1, 1, 0, 0]],)
+        test = notmasked_edges(data, None)
+        assert_equal(test, [0, 24])
+        test = notmasked_edges(data, 0)
+        assert_equal(test[0], [(0, 0, 1, 0, 0), (0, 1, 2, 3, 4)])
+        assert_equal(test[1], [(3, 3, 3, 4, 4), (0, 1, 2, 3, 4)])
+        test = notmasked_edges(data, 1)
+        assert_equal(test[0], [(0, 1, 2, 3, 4), (0, 0, 2, 0, 3)])
+        assert_equal(test[1], [(0, 1, 2, 3, 4), (4, 2, 4, 4, 4)])
+        #
+        test = notmasked_edges(data.data, None)
+        assert_equal(test, [0, 24])
+        test = notmasked_edges(data.data, 0)
+        assert_equal(test[0], [(0, 0, 0, 0, 0), (0, 1, 2, 3, 4)])
+        assert_equal(test[1], [(4, 4, 4, 4, 4), (0, 1, 2, 3, 4)])
+        test = notmasked_edges(data.data, -1)
+        assert_equal(test[0], [(0, 1, 2, 3, 4), (0, 0, 0, 0, 0)])
+        assert_equal(test[1], [(0, 1, 2, 3, 4), (4, 4, 4, 4, 4)])
+        #
+        data[-2] = masked
+        test = notmasked_edges(data, 0)
+        assert_equal(test[0], [(0, 0, 1, 0, 0), (0, 1, 2, 3, 4)])
+        assert_equal(test[1], [(1, 1, 2, 4, 4), (0, 1, 2, 3, 4)])
+        test = notmasked_edges(data, -1)
+        assert_equal(test[0], [(0, 1, 2, 4), (0, 0, 2, 3)])
+        assert_equal(test[1], [(0, 1, 2, 4), (4, 2, 4, 4)])
+
+    def test_contiguous(self):
+        # Tests notmasked_contiguous
+        a = masked_array(np.arange(24).reshape(3, 8),
+                         mask=[[0, 0, 0, 0, 1, 1, 1, 1],
+                               [1, 1, 1, 1, 1, 1, 1, 1],
+                               [0, 0, 0, 0, 0, 0, 1, 0]])
+        tmp = notmasked_contiguous(a, None)
+        assert_equal(tmp, [
+            slice(0, 4, None),
+            slice(16, 22, None),
+            slice(23, 24, None)
+        ])
+
+        tmp = notmasked_contiguous(a, 0)
+        assert_equal(tmp, [
+            [slice(0, 1, None), slice(2, 3, None)],
+            [slice(0, 1, None), slice(2, 3, None)],
+            [slice(0, 1, None), slice(2, 3, None)],
+            [slice(0, 1, None), slice(2, 3, None)],
+            [slice(2, 3, None)],
+            [slice(2, 3, None)],
+            [],
+            [slice(2, 3, None)]
+        ])
+        #
+        tmp = notmasked_contiguous(a, 1)
+        assert_equal(tmp, [
+            [slice(0, 4, None)],
+            [],
+            [slice(0, 6, None), slice(7, 8, None)]
+        ])
+
+
+class TestCompressFunctions:
+
+    def test_compress_nd(self):
+        # Tests compress_nd
+        x = np.array(list(range(3*4*5))).reshape(3, 4, 5)
+        m = np.zeros((3,4,5)).astype(bool)
+        m[1,1,1] = True
+        x = array(x, mask=m)
+
+        # axis=None
+        a = compress_nd(x)
+        assert_equal(a, [[[ 0,  2,  3,  4],
+                          [10, 12, 13, 14],
+                          [15, 17, 18, 19]],
+                         [[40, 42, 43, 44],
+                          [50, 52, 53, 54],
+                          [55, 57, 58, 59]]])
+
+        # axis=0
+        a = compress_nd(x, 0)
+        assert_equal(a, [[[ 0,  1,  2,  3,  4],
+                          [ 5,  6,  7,  8,  9],
+                          [10, 11, 12, 13, 14],
+                          [15, 16, 17, 18, 19]],
+                         [[40, 41, 42, 43, 44],
+                          [45, 46, 47, 48, 49],
+                          [50, 51, 52, 53, 54],
+                          [55, 56, 57, 58, 59]]])
+
+        # axis=1
+        a = compress_nd(x, 1)
+        assert_equal(a, [[[ 0,  1,  2,  3,  4],
+                          [10, 11, 12, 13, 14],
+                          [15, 16, 17, 18, 19]],
+                         [[20, 21, 22, 23, 24],
+                          [30, 31, 32, 33, 34],
+                          [35, 36, 37, 38, 39]],
+                         [[40, 41, 42, 43, 44],
+                          [50, 51, 52, 53, 54],
+                          [55, 56, 57, 58, 59]]])
+
+        a2 = compress_nd(x, (1,))
+        a3 = compress_nd(x, -2)
+        a4 = compress_nd(x, (-2,))
+        assert_equal(a, a2)
+        assert_equal(a, a3)
+        assert_equal(a, a4)
+
+        # axis=2
+        a = compress_nd(x, 2)
+        assert_equal(a, [[[ 0, 2,  3,  4],
+                          [ 5, 7,  8,  9],
+                          [10, 12, 13, 14],
+                          [15, 17, 18, 19]],
+                         [[20, 22, 23, 24],
+                          [25, 27, 28, 29],
+                          [30, 32, 33, 34],
+                          [35, 37, 38, 39]],
+                         [[40, 42, 43, 44],
+                          [45, 47, 48, 49],
+                          [50, 52, 53, 54],
+                          [55, 57, 58, 59]]])
+
+        a2 = compress_nd(x, (2,))
+        a3 = compress_nd(x, -1)
+        a4 = compress_nd(x, (-1,))
+        assert_equal(a, a2)
+        assert_equal(a, a3)
+        assert_equal(a, a4)
+
+        # axis=(0, 1)
+        a = compress_nd(x, (0, 1))
+        assert_equal(a, [[[ 0,  1,  2,  3,  4],
+                          [10, 11, 12, 13, 14],
+                          [15, 16, 17, 18, 19]],
+                         [[40, 41, 42, 43, 44],
+                          [50, 51, 52, 53, 54],
+                          [55, 56, 57, 58, 59]]])
+        a2 = compress_nd(x, (0, -2))
+        assert_equal(a, a2)
+
+        # axis=(1, 2)
+        a = compress_nd(x, (1, 2))
+        assert_equal(a, [[[ 0,  2,  3,  4],
+                          [10, 12, 13, 14],
+                          [15, 17, 18, 19]],
+                         [[20, 22, 23, 24],
+                          [30, 32, 33, 34],
+                          [35, 37, 38, 39]],
+                         [[40, 42, 43, 44],
+                          [50, 52, 53, 54],
+                          [55, 57, 58, 59]]])
+
+        a2 = compress_nd(x, (-2, 2))
+        a3 = compress_nd(x, (1, -1))
+        a4 = compress_nd(x, (-2, -1))
+        assert_equal(a, a2)
+        assert_equal(a, a3)
+        assert_equal(a, a4)
+
+        # axis=(0, 2)
+        a = compress_nd(x, (0, 2))
+        assert_equal(a, [[[ 0,  2,  3,  4],
+                          [ 5,  7,  8,  9],
+                          [10, 12, 13, 14],
+                          [15, 17, 18, 19]],
+                         [[40, 42, 43, 44],
+                          [45, 47, 48, 49],
+                          [50, 52, 53, 54],
+                          [55, 57, 58, 59]]])
+
+        a2 = compress_nd(x, (0, -1))
+        assert_equal(a, a2)
+
+    def test_compress_rowcols(self):
+        # Tests compress_rowcols
+        x = array(np.arange(9).reshape(3, 3),
+                  mask=[[1, 0, 0], [0, 0, 0], [0, 0, 0]])
+        assert_equal(compress_rowcols(x), [[4, 5], [7, 8]])
+        assert_equal(compress_rowcols(x, 0), [[3, 4, 5], [6, 7, 8]])
+        assert_equal(compress_rowcols(x, 1), [[1, 2], [4, 5], [7, 8]])
+        x = array(x._data, mask=[[0, 0, 0], [0, 1, 0], [0, 0, 0]])
+        assert_equal(compress_rowcols(x), [[0, 2], [6, 8]])
+        assert_equal(compress_rowcols(x, 0), [[0, 1, 2], [6, 7, 8]])
+        assert_equal(compress_rowcols(x, 1), [[0, 2], [3, 5], [6, 8]])
+        x = array(x._data, mask=[[1, 0, 0], [0, 1, 0], [0, 0, 0]])
+        assert_equal(compress_rowcols(x), [[8]])
+        assert_equal(compress_rowcols(x, 0), [[6, 7, 8]])
+        assert_equal(compress_rowcols(x, 1,), [[2], [5], [8]])
+        x = array(x._data, mask=[[1, 0, 0], [0, 1, 0], [0, 0, 1]])
+        assert_equal(compress_rowcols(x).size, 0)
+        assert_equal(compress_rowcols(x, 0).size, 0)
+        assert_equal(compress_rowcols(x, 1).size, 0)
+
+    def test_mask_rowcols(self):
+        # Tests mask_rowcols.
+        x = array(np.arange(9).reshape(3, 3),
+                  mask=[[1, 0, 0], [0, 0, 0], [0, 0, 0]])
+        assert_equal(mask_rowcols(x).mask,
+                     [[1, 1, 1], [1, 0, 0], [1, 0, 0]])
+        assert_equal(mask_rowcols(x, 0).mask,
+                     [[1, 1, 1], [0, 0, 0], [0, 0, 0]])
+        assert_equal(mask_rowcols(x, 1).mask,
+                     [[1, 0, 0], [1, 0, 0], [1, 0, 0]])
+        x = array(x._data, mask=[[0, 0, 0], [0, 1, 0], [0, 0, 0]])
+        assert_equal(mask_rowcols(x).mask,
+                     [[0, 1, 0], [1, 1, 1], [0, 1, 0]])
+        assert_equal(mask_rowcols(x, 0).mask,
+                     [[0, 0, 0], [1, 1, 1], [0, 0, 0]])
+        assert_equal(mask_rowcols(x, 1).mask,
+                     [[0, 1, 0], [0, 1, 0], [0, 1, 0]])
+        x = array(x._data, mask=[[1, 0, 0], [0, 1, 0], [0, 0, 0]])
+        assert_equal(mask_rowcols(x).mask,
+                     [[1, 1, 1], [1, 1, 1], [1, 1, 0]])
+        assert_equal(mask_rowcols(x, 0).mask,
+                     [[1, 1, 1], [1, 1, 1], [0, 0, 0]])
+        assert_equal(mask_rowcols(x, 1,).mask,
+                     [[1, 1, 0], [1, 1, 0], [1, 1, 0]])
+        x = array(x._data, mask=[[1, 0, 0], [0, 1, 0], [0, 0, 1]])
+        assert_(mask_rowcols(x).all() is masked)
+        assert_(mask_rowcols(x, 0).all() is masked)
+        assert_(mask_rowcols(x, 1).all() is masked)
+        assert_(mask_rowcols(x).mask.all())
+        assert_(mask_rowcols(x, 0).mask.all())
+        assert_(mask_rowcols(x, 1).mask.all())
+
+    @pytest.mark.parametrize("axis", [None, 0, 1])
+    @pytest.mark.parametrize(["func", "rowcols_axis"],
+                             [(np.ma.mask_rows, 0), (np.ma.mask_cols, 1)])
+    def test_mask_row_cols_axis_deprecation(self, axis, func, rowcols_axis):
+        # Test deprecation of the axis argument to `mask_rows` and `mask_cols`
+        x = array(np.arange(9).reshape(3, 3),
+                  mask=[[1, 0, 0], [0, 0, 0], [0, 0, 0]])
+
+        with assert_warns(DeprecationWarning):
+            res = func(x, axis=axis)
+            assert_equal(res, mask_rowcols(x, rowcols_axis))
+
+    def test_dot(self):
+        # Tests dot product
+        n = np.arange(1, 7)
+        #
+        m = [1, 0, 0, 0, 0, 0]
+        a = masked_array(n, mask=m).reshape(2, 3)
+        b = masked_array(n, mask=m).reshape(3, 2)
+        c = dot(a, b, strict=True)
+        assert_equal(c.mask, [[1, 1], [1, 0]])
+        c = dot(b, a, strict=True)
+        assert_equal(c.mask, [[1, 1, 1], [1, 0, 0], [1, 0, 0]])
+        c = dot(a, b, strict=False)
+        assert_equal(c, np.dot(a.filled(0), b.filled(0)))
+        c = dot(b, a, strict=False)
+        assert_equal(c, np.dot(b.filled(0), a.filled(0)))
+        #
+        m = [0, 0, 0, 0, 0, 1]
+        a = masked_array(n, mask=m).reshape(2, 3)
+        b = masked_array(n, mask=m).reshape(3, 2)
+        c = dot(a, b, strict=True)
+        assert_equal(c.mask, [[0, 1], [1, 1]])
+        c = dot(b, a, strict=True)
+        assert_equal(c.mask, [[0, 0, 1], [0, 0, 1], [1, 1, 1]])
+        c = dot(a, b, strict=False)
+        assert_equal(c, np.dot(a.filled(0), b.filled(0)))
+        assert_equal(c, dot(a, b))
+        c = dot(b, a, strict=False)
+        assert_equal(c, np.dot(b.filled(0), a.filled(0)))
+        #
+        m = [0, 0, 0, 0, 0, 0]
+        a = masked_array(n, mask=m).reshape(2, 3)
+        b = masked_array(n, mask=m).reshape(3, 2)
+        c = dot(a, b)
+        assert_equal(c.mask, nomask)
+        c = dot(b, a)
+        assert_equal(c.mask, nomask)
+        #
+        a = masked_array(n, mask=[1, 0, 0, 0, 0, 0]).reshape(2, 3)
+        b = masked_array(n, mask=[0, 0, 0, 0, 0, 0]).reshape(3, 2)
+        c = dot(a, b, strict=True)
+        assert_equal(c.mask, [[1, 1], [0, 0]])
+        c = dot(a, b, strict=False)
+        assert_equal(c, np.dot(a.filled(0), b.filled(0)))
+        c = dot(b, a, strict=True)
+        assert_equal(c.mask, [[1, 0, 0], [1, 0, 0], [1, 0, 0]])
+        c = dot(b, a, strict=False)
+        assert_equal(c, np.dot(b.filled(0), a.filled(0)))
+        #
+        a = masked_array(n, mask=[0, 0, 0, 0, 0, 1]).reshape(2, 3)
+        b = masked_array(n, mask=[0, 0, 0, 0, 0, 0]).reshape(3, 2)
+        c = dot(a, b, strict=True)
+        assert_equal(c.mask, [[0, 0], [1, 1]])
+        c = dot(a, b)
+        assert_equal(c, np.dot(a.filled(0), b.filled(0)))
+        c = dot(b, a, strict=True)
+        assert_equal(c.mask, [[0, 0, 1], [0, 0, 1], [0, 0, 1]])
+        c = dot(b, a, strict=False)
+        assert_equal(c, np.dot(b.filled(0), a.filled(0)))
+        #
+        a = masked_array(n, mask=[0, 0, 0, 0, 0, 1]).reshape(2, 3)
+        b = masked_array(n, mask=[0, 0, 1, 0, 0, 0]).reshape(3, 2)
+        c = dot(a, b, strict=True)
+        assert_equal(c.mask, [[1, 0], [1, 1]])
+        c = dot(a, b, strict=False)
+        assert_equal(c, np.dot(a.filled(0), b.filled(0)))
+        c = dot(b, a, strict=True)
+        assert_equal(c.mask, [[0, 0, 1], [1, 1, 1], [0, 0, 1]])
+        c = dot(b, a, strict=False)
+        assert_equal(c, np.dot(b.filled(0), a.filled(0)))
+
+    def test_dot_returns_maskedarray(self):
+        # See gh-6611
+        a = np.eye(3)
+        b = array(a)
+        assert_(type(dot(a, a)) is MaskedArray)
+        assert_(type(dot(a, b)) is MaskedArray)
+        assert_(type(dot(b, a)) is MaskedArray)
+        assert_(type(dot(b, b)) is MaskedArray)
+
+    def test_dot_out(self):
+        a = array(np.eye(3))
+        out = array(np.zeros((3, 3)))
+        res = dot(a, a, out=out)
+        assert_(res is out)
+        assert_equal(a, res)
+
+
+class TestApplyAlongAxis:
+    # Tests 2D functions
+    def test_3d(self):
+        a = arange(12.).reshape(2, 2, 3)
+
+        def myfunc(b):
+            return b[1]
+
+        xa = apply_along_axis(myfunc, 2, a)
+        assert_equal(xa, [[1, 4], [7, 10]])
+
+    # Tests kwargs functions
+    def test_3d_kwargs(self):
+        a = arange(12).reshape(2, 2, 3)
+
+        def myfunc(b, offset=0):
+            return b[1+offset]
+
+        xa = apply_along_axis(myfunc, 2, a, offset=1)
+        assert_equal(xa, [[2, 5], [8, 11]])
+
+
+class TestApplyOverAxes:
+    # Tests apply_over_axes
+    def test_basic(self):
+        a = arange(24).reshape(2, 3, 4)
+        test = apply_over_axes(np.sum, a, [0, 2])
+        ctrl = np.array([[[60], [92], [124]]])
+        assert_equal(test, ctrl)
+        a[(a % 2).astype(bool)] = masked
+        test = apply_over_axes(np.sum, a, [0, 2])
+        ctrl = np.array([[[28], [44], [60]]])
+        assert_equal(test, ctrl)
+
+
+class TestMedian:
+    def test_pytype(self):
+        r = np.ma.median([[np.inf, np.inf], [np.inf, np.inf]], axis=-1)
+        assert_equal(r, np.inf)
+
+    def test_inf(self):
+        # test that even which computes handles inf / x = masked
+        r = np.ma.median(np.ma.masked_array([[np.inf, np.inf],
+                                             [np.inf, np.inf]]), axis=-1)
+        assert_equal(r, np.inf)
+        r = np.ma.median(np.ma.masked_array([[np.inf, np.inf],
+                                             [np.inf, np.inf]]), axis=None)
+        assert_equal(r, np.inf)
+        # all masked
+        r = np.ma.median(np.ma.masked_array([[np.inf, np.inf],
+                                             [np.inf, np.inf]], mask=True),
+                         axis=-1)
+        assert_equal(r.mask, True)
+        r = np.ma.median(np.ma.masked_array([[np.inf, np.inf],
+                                             [np.inf, np.inf]], mask=True),
+                         axis=None)
+        assert_equal(r.mask, True)
+
+    def test_non_masked(self):
+        x = np.arange(9)
+        assert_equal(np.ma.median(x), 4.)
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        x = range(8)
+        assert_equal(np.ma.median(x), 3.5)
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        x = 5
+        assert_equal(np.ma.median(x), 5.)
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        # integer
+        x = np.arange(9 * 8).reshape(9, 8)
+        assert_equal(np.ma.median(x, axis=0), np.median(x, axis=0))
+        assert_equal(np.ma.median(x, axis=1), np.median(x, axis=1))
+        assert_(np.ma.median(x, axis=1) is not MaskedArray)
+        # float
+        x = np.arange(9 * 8.).reshape(9, 8)
+        assert_equal(np.ma.median(x, axis=0), np.median(x, axis=0))
+        assert_equal(np.ma.median(x, axis=1), np.median(x, axis=1))
+        assert_(np.ma.median(x, axis=1) is not MaskedArray)
+
+    def test_docstring_examples(self):
+        "test the examples given in the docstring of ma.median"
+        x = array(np.arange(8), mask=[0]*4 + [1]*4)
+        assert_equal(np.ma.median(x), 1.5)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        x = array(np.arange(10).reshape(2, 5), mask=[0]*6 + [1]*4)
+        assert_equal(np.ma.median(x), 2.5)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        ma_x = np.ma.median(x, axis=-1, overwrite_input=True)
+        assert_equal(ma_x, [2., 5.])
+        assert_equal(ma_x.shape, (2,), "shape mismatch")
+        assert_(type(ma_x) is MaskedArray)
+
+    def test_axis_argument_errors(self):
+        msg = "mask = %s, ndim = %s, axis = %s, overwrite_input = %s"
+        for ndmin in range(5):
+            for mask in [False, True]:
+                x = array(1, ndmin=ndmin, mask=mask)
+
+                # Valid axis values should not raise exception
+                args = itertools.product(range(-ndmin, ndmin), [False, True])
+                for axis, over in args:
+                    try:
+                        np.ma.median(x, axis=axis, overwrite_input=over)
+                    except Exception:
+                        raise AssertionError(msg % (mask, ndmin, axis, over))
+
+                # Invalid axis values should raise exception
+                args = itertools.product([-(ndmin + 1), ndmin], [False, True])
+                for axis, over in args:
+                    try:
+                        np.ma.median(x, axis=axis, overwrite_input=over)
+                    except np.AxisError:
+                        pass
+                    else:
+                        raise AssertionError(msg % (mask, ndmin, axis, over))
+
+    def test_masked_0d(self):
+        # Check values
+        x = array(1, mask=False)
+        assert_equal(np.ma.median(x), 1)
+        x = array(1, mask=True)
+        assert_equal(np.ma.median(x), np.ma.masked)
+
+    def test_masked_1d(self):
+        x = array(np.arange(5), mask=True)
+        assert_equal(np.ma.median(x), np.ma.masked)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is np.ma.core.MaskedConstant)
+        x = array(np.arange(5), mask=False)
+        assert_equal(np.ma.median(x), 2.)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        x = array(np.arange(5), mask=[0,1,0,0,0])
+        assert_equal(np.ma.median(x), 2.5)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        x = array(np.arange(5), mask=[0,1,1,1,1])
+        assert_equal(np.ma.median(x), 0.)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        # integer
+        x = array(np.arange(5), mask=[0,1,1,0,0])
+        assert_equal(np.ma.median(x), 3.)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        # float
+        x = array(np.arange(5.), mask=[0,1,1,0,0])
+        assert_equal(np.ma.median(x), 3.)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        # integer
+        x = array(np.arange(6), mask=[0,1,1,1,1,0])
+        assert_equal(np.ma.median(x), 2.5)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        # float
+        x = array(np.arange(6.), mask=[0,1,1,1,1,0])
+        assert_equal(np.ma.median(x), 2.5)
+        assert_equal(np.ma.median(x).shape, (), "shape mismatch")
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+
+    def test_1d_shape_consistency(self):
+        assert_equal(np.ma.median(array([1,2,3],mask=[0,0,0])).shape,
+                     np.ma.median(array([1,2,3],mask=[0,1,0])).shape )
+
+    def test_2d(self):
+        # Tests median w/ 2D
+        (n, p) = (101, 30)
+        x = masked_array(np.linspace(-1., 1., n),)
+        x[:10] = x[-10:] = masked
+        z = masked_array(np.empty((n, p), dtype=float))
+        z[:, 0] = x[:]
+        idx = np.arange(len(x))
+        for i in range(1, p):
+            np.random.shuffle(idx)
+            z[:, i] = x[idx]
+        assert_equal(median(z[:, 0]), 0)
+        assert_equal(median(z), 0)
+        assert_equal(median(z, axis=0), np.zeros(p))
+        assert_equal(median(z.T, axis=1), np.zeros(p))
+
+    def test_2d_waxis(self):
+        # Tests median w/ 2D arrays and different axis.
+        x = masked_array(np.arange(30).reshape(10, 3))
+        x[:3] = x[-3:] = masked
+        assert_equal(median(x), 14.5)
+        assert_(type(np.ma.median(x)) is not MaskedArray)
+        assert_equal(median(x, axis=0), [13.5, 14.5, 15.5])
+        assert_(type(np.ma.median(x, axis=0)) is MaskedArray)
+        assert_equal(median(x, axis=1), [0, 0, 0, 10, 13, 16, 19, 0, 0, 0])
+        assert_(type(np.ma.median(x, axis=1)) is MaskedArray)
+        assert_equal(median(x, axis=1).mask, [1, 1, 1, 0, 0, 0, 0, 1, 1, 1])
+
+    def test_3d(self):
+        # Tests median w/ 3D
+        x = np.ma.arange(24).reshape(3, 4, 2)
+        x[x % 3 == 0] = masked
+        assert_equal(median(x, 0), [[12, 9], [6, 15], [12, 9], [18, 15]])
+        x.shape = (4, 3, 2)
+        assert_equal(median(x, 0), [[99, 10], [11, 99], [13, 14]])
+        x = np.ma.arange(24).reshape(4, 3, 2)
+        x[x % 5 == 0] = masked
+        assert_equal(median(x, 0), [[12, 10], [8, 9], [16, 17]])
+
+    def test_neg_axis(self):
+        x = masked_array(np.arange(30).reshape(10, 3))
+        x[:3] = x[-3:] = masked
+        assert_equal(median(x, axis=-1), median(x, axis=1))
+
+    def test_out_1d(self):
+        # integer float even odd
+        for v in (30, 30., 31, 31.):
+            x = masked_array(np.arange(v))
+            x[:3] = x[-3:] = masked
+            out = masked_array(np.ones(()))
+            r = median(x, out=out)
+            if v == 30:
+                assert_equal(out, 14.5)
+            else:
+                assert_equal(out, 15.)
+            assert_(r is out)
+            assert_(type(r) is MaskedArray)
+
+    def test_out(self):
+        # integer float even odd
+        for v in (40, 40., 30, 30.):
+            x = masked_array(np.arange(v).reshape(10, -1))
+            x[:3] = x[-3:] = masked
+            out = masked_array(np.ones(10))
+            r = median(x, axis=1, out=out)
+            if v == 30:
+                e = masked_array([0.]*3 + [10, 13, 16, 19] + [0.]*3,
+                                 mask=[True] * 3 + [False] * 4 + [True] * 3)
+            else:
+                e = masked_array([0.]*3 + [13.5, 17.5, 21.5, 25.5] + [0.]*3,
+                                 mask=[True]*3 + [False]*4 + [True]*3)
+            assert_equal(r, e)
+            assert_(r is out)
+            assert_(type(r) is MaskedArray)
+
+    def test_single_non_masked_value_on_axis(self):
+        data = [[1., 0.],
+                [0., 3.],
+                [0., 0.]]
+        masked_arr = np.ma.masked_equal(data, 0)
+        expected = [1., 3.]
+        assert_array_equal(np.ma.median(masked_arr, axis=0),
+                           expected)
+
+    def test_nan(self):
+        for mask in (False, np.zeros(6, dtype=bool)):
+            dm = np.ma.array([[1, np.nan, 3], [1, 2, 3]])
+            dm.mask = mask
+
+            # scalar result
+            r = np.ma.median(dm, axis=None)
+            assert_(np.isscalar(r))
+            assert_array_equal(r, np.nan)
+            r = np.ma.median(dm.ravel(), axis=0)
+            assert_(np.isscalar(r))
+            assert_array_equal(r, np.nan)
+
+            r = np.ma.median(dm, axis=0)
+            assert_equal(type(r), MaskedArray)
+            assert_array_equal(r, [1, np.nan, 3])
+            r = np.ma.median(dm, axis=1)
+            assert_equal(type(r), MaskedArray)
+            assert_array_equal(r, [np.nan, 2])
+            r = np.ma.median(dm, axis=-1)
+            assert_equal(type(r), MaskedArray)
+            assert_array_equal(r, [np.nan, 2])
+
+        dm = np.ma.array([[1, np.nan, 3], [1, 2, 3]])
+        dm[:, 2] = np.ma.masked
+        assert_array_equal(np.ma.median(dm, axis=None), np.nan)
+        assert_array_equal(np.ma.median(dm, axis=0), [1, np.nan, 3])
+        assert_array_equal(np.ma.median(dm, axis=1), [np.nan, 1.5])
+
+    def test_out_nan(self):
+        o = np.ma.masked_array(np.zeros((4,)))
+        d = np.ma.masked_array(np.ones((3, 4)))
+        d[2, 1] = np.nan
+        d[2, 2] = np.ma.masked
+        assert_equal(np.ma.median(d, 0, out=o), o)
+        o = np.ma.masked_array(np.zeros((3,)))
+        assert_equal(np.ma.median(d, 1, out=o), o)
+        o = np.ma.masked_array(np.zeros(()))
+        assert_equal(np.ma.median(d, out=o), o)
+
+    def test_nan_behavior(self):
+        a = np.ma.masked_array(np.arange(24, dtype=float))
+        a[::3] = np.ma.masked
+        a[2] = np.nan
+        assert_array_equal(np.ma.median(a), np.nan)
+        assert_array_equal(np.ma.median(a, axis=0), np.nan)
+
+        a = np.ma.masked_array(np.arange(24, dtype=float).reshape(2, 3, 4))
+        a.mask = np.arange(a.size) % 2 == 1
+        aorig = a.copy()
+        a[1, 2, 3] = np.nan
+        a[1, 1, 2] = np.nan
+
+        # no axis
+        assert_array_equal(np.ma.median(a), np.nan)
+        assert_(np.isscalar(np.ma.median(a)))
+
+        # axis0
+        b = np.ma.median(aorig, axis=0)
+        b[2, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.ma.median(a, 0), b)
+
+        # axis1
+        b = np.ma.median(aorig, axis=1)
+        b[1, 3] = np.nan
+        b[1, 2] = np.nan
+        assert_equal(np.ma.median(a, 1), b)
+
+        # axis02
+        b = np.ma.median(aorig, axis=(0, 2))
+        b[1] = np.nan
+        b[2] = np.nan
+        assert_equal(np.ma.median(a, (0, 2)), b)
+
+    def test_ambigous_fill(self):
+        # 255 is max value, used as filler for sort
+        a = np.array([[3, 3, 255], [3, 3, 255]], dtype=np.uint8)
+        a = np.ma.masked_array(a, mask=a == 3)
+        assert_array_equal(np.ma.median(a, axis=1), 255)
+        assert_array_equal(np.ma.median(a, axis=1).mask, False)
+        assert_array_equal(np.ma.median(a, axis=0), a[0])
+        assert_array_equal(np.ma.median(a), 255)
+
+    def test_special(self):
+        for inf in [np.inf, -np.inf]:
+            a = np.array([[inf,  np.nan], [np.nan, np.nan]])
+            a = np.ma.masked_array(a, mask=np.isnan(a))
+            assert_equal(np.ma.median(a, axis=0), [inf,  np.nan])
+            assert_equal(np.ma.median(a, axis=1), [inf,  np.nan])
+            assert_equal(np.ma.median(a), inf)
+
+            a = np.array([[np.nan, np.nan, inf], [np.nan, np.nan, inf]])
+            a = np.ma.masked_array(a, mask=np.isnan(a))
+            assert_array_equal(np.ma.median(a, axis=1), inf)
+            assert_array_equal(np.ma.median(a, axis=1).mask, False)
+            assert_array_equal(np.ma.median(a, axis=0), a[0])
+            assert_array_equal(np.ma.median(a), inf)
+
+            # no mask
+            a = np.array([[inf, inf], [inf, inf]])
+            assert_equal(np.ma.median(a), inf)
+            assert_equal(np.ma.median(a, axis=0), inf)
+            assert_equal(np.ma.median(a, axis=1), inf)
+
+            a = np.array([[inf, 7, -inf, -9],
+                          [-10, np.nan, np.nan, 5],
+                          [4, np.nan, np.nan, inf]],
+                          dtype=np.float32)
+            a = np.ma.masked_array(a, mask=np.isnan(a))
+            if inf > 0:
+                assert_equal(np.ma.median(a, axis=0), [4., 7., -inf, 5.])
+                assert_equal(np.ma.median(a), 4.5)
+            else:
+                assert_equal(np.ma.median(a, axis=0), [-10., 7., -inf, -9.])
+                assert_equal(np.ma.median(a), -2.5)
+            assert_equal(np.ma.median(a, axis=1), [-1., -2.5, inf])
+
+            for i in range(0, 10):
+                for j in range(1, 10):
+                    a = np.array([([np.nan] * i) + ([inf] * j)] * 2)
+                    a = np.ma.masked_array(a, mask=np.isnan(a))
+                    assert_equal(np.ma.median(a), inf)
+                    assert_equal(np.ma.median(a, axis=1), inf)
+                    assert_equal(np.ma.median(a, axis=0),
+                                 ([np.nan] * i) + [inf] * j)
+
+    def test_empty(self):
+        # empty arrays
+        a = np.ma.masked_array(np.array([], dtype=float))
+        with suppress_warnings() as w:
+            w.record(RuntimeWarning)
+            assert_array_equal(np.ma.median(a), np.nan)
+            assert_(w.log[0].category is RuntimeWarning)
+
+        # multiple dimensions
+        a = np.ma.masked_array(np.array([], dtype=float, ndmin=3))
+        # no axis
+        with suppress_warnings() as w:
+            w.record(RuntimeWarning)
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_array_equal(np.ma.median(a), np.nan)
+            assert_(w.log[0].category is RuntimeWarning)
+
+        # axis 0 and 1
+        b = np.ma.masked_array(np.array([], dtype=float, ndmin=2))
+        assert_equal(np.ma.median(a, axis=0), b)
+        assert_equal(np.ma.median(a, axis=1), b)
+
+        # axis 2
+        b = np.ma.masked_array(np.array(np.nan, dtype=float, ndmin=2))
+        with warnings.catch_warnings(record=True) as w:
+            warnings.filterwarnings('always', '', RuntimeWarning)
+            assert_equal(np.ma.median(a, axis=2), b)
+            assert_(w[0].category is RuntimeWarning)
+
+    def test_object(self):
+        o = np.ma.masked_array(np.arange(7.))
+        assert_(type(np.ma.median(o.astype(object))), float)
+        o[2] = np.nan
+        assert_(type(np.ma.median(o.astype(object))), float)
+
+
+class TestCov:
+
+    def setup(self):
+        self.data = array(np.random.rand(12))
+
+    def test_1d_without_missing(self):
+        # Test cov on 1D variable w/o missing values
+        x = self.data
+        assert_almost_equal(np.cov(x), cov(x))
+        assert_almost_equal(np.cov(x, rowvar=False), cov(x, rowvar=False))
+        assert_almost_equal(np.cov(x, rowvar=False, bias=True),
+                            cov(x, rowvar=False, bias=True))
+
+    def test_2d_without_missing(self):
+        # Test cov on 1 2D variable w/o missing values
+        x = self.data.reshape(3, 4)
+        assert_almost_equal(np.cov(x), cov(x))
+        assert_almost_equal(np.cov(x, rowvar=False), cov(x, rowvar=False))
+        assert_almost_equal(np.cov(x, rowvar=False, bias=True),
+                            cov(x, rowvar=False, bias=True))
+
+    def test_1d_with_missing(self):
+        # Test cov 1 1D variable w/missing values
+        x = self.data
+        x[-1] = masked
+        x -= x.mean()
+        nx = x.compressed()
+        assert_almost_equal(np.cov(nx), cov(x))
+        assert_almost_equal(np.cov(nx, rowvar=False), cov(x, rowvar=False))
+        assert_almost_equal(np.cov(nx, rowvar=False, bias=True),
+                            cov(x, rowvar=False, bias=True))
+        #
+        try:
+            cov(x, allow_masked=False)
+        except ValueError:
+            pass
+        #
+        # 2 1D variables w/ missing values
+        nx = x[1:-1]
+        assert_almost_equal(np.cov(nx, nx[::-1]), cov(x, x[::-1]))
+        assert_almost_equal(np.cov(nx, nx[::-1], rowvar=False),
+                            cov(x, x[::-1], rowvar=False))
+        assert_almost_equal(np.cov(nx, nx[::-1], rowvar=False, bias=True),
+                            cov(x, x[::-1], rowvar=False, bias=True))
+
+    def test_2d_with_missing(self):
+        # Test cov on 2D variable w/ missing value
+        x = self.data
+        x[-1] = masked
+        x = x.reshape(3, 4)
+        valid = np.logical_not(getmaskarray(x)).astype(int)
+        frac = np.dot(valid, valid.T)
+        xf = (x - x.mean(1)[:, None]).filled(0)
+        assert_almost_equal(cov(x),
+                            np.cov(xf) * (x.shape[1] - 1) / (frac - 1.))
+        assert_almost_equal(cov(x, bias=True),
+                            np.cov(xf, bias=True) * x.shape[1] / frac)
+        frac = np.dot(valid.T, valid)
+        xf = (x - x.mean(0)).filled(0)
+        assert_almost_equal(cov(x, rowvar=False),
+                            (np.cov(xf, rowvar=False) *
+                             (x.shape[0] - 1) / (frac - 1.)))
+        assert_almost_equal(cov(x, rowvar=False, bias=True),
+                            (np.cov(xf, rowvar=False, bias=True) *
+                             x.shape[0] / frac))
+
+
+class TestCorrcoef:
+
+    def setup(self):
+        self.data = array(np.random.rand(12))
+        self.data2 = array(np.random.rand(12))
+
+    def test_ddof(self):
+        # ddof raises DeprecationWarning
+        x, y = self.data, self.data2
+        expected = np.corrcoef(x)
+        expected2 = np.corrcoef(x, y)
+        with suppress_warnings() as sup:
+            warnings.simplefilter("always")
+            assert_warns(DeprecationWarning, corrcoef, x, ddof=-1)
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            # ddof has no or negligible effect on the function
+            assert_almost_equal(np.corrcoef(x, ddof=0), corrcoef(x, ddof=0))
+            assert_almost_equal(corrcoef(x, ddof=-1), expected)
+            assert_almost_equal(corrcoef(x, y, ddof=-1), expected2)
+            assert_almost_equal(corrcoef(x, ddof=3), expected)
+            assert_almost_equal(corrcoef(x, y, ddof=3), expected2)
+
+    def test_bias(self):
+        x, y = self.data, self.data2
+        expected = np.corrcoef(x)
+        # bias raises DeprecationWarning
+        with suppress_warnings() as sup:
+            warnings.simplefilter("always")
+            assert_warns(DeprecationWarning, corrcoef, x, y, True, False)
+            assert_warns(DeprecationWarning, corrcoef, x, y, True, True)
+            assert_warns(DeprecationWarning, corrcoef, x, bias=False)
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            # bias has no or negligible effect on the function
+            assert_almost_equal(corrcoef(x, bias=1), expected)
+
+    def test_1d_without_missing(self):
+        # Test cov on 1D variable w/o missing values
+        x = self.data
+        assert_almost_equal(np.corrcoef(x), corrcoef(x))
+        assert_almost_equal(np.corrcoef(x, rowvar=False),
+                            corrcoef(x, rowvar=False))
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            assert_almost_equal(np.corrcoef(x, rowvar=False, bias=True),
+                                corrcoef(x, rowvar=False, bias=True))
+
+    def test_2d_without_missing(self):
+        # Test corrcoef on 1 2D variable w/o missing values
+        x = self.data.reshape(3, 4)
+        assert_almost_equal(np.corrcoef(x), corrcoef(x))
+        assert_almost_equal(np.corrcoef(x, rowvar=False),
+                            corrcoef(x, rowvar=False))
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            assert_almost_equal(np.corrcoef(x, rowvar=False, bias=True),
+                                corrcoef(x, rowvar=False, bias=True))
+
+    def test_1d_with_missing(self):
+        # Test corrcoef 1 1D variable w/missing values
+        x = self.data
+        x[-1] = masked
+        x -= x.mean()
+        nx = x.compressed()
+        assert_almost_equal(np.corrcoef(nx), corrcoef(x))
+        assert_almost_equal(np.corrcoef(nx, rowvar=False),
+                            corrcoef(x, rowvar=False))
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            assert_almost_equal(np.corrcoef(nx, rowvar=False, bias=True),
+                                corrcoef(x, rowvar=False, bias=True))
+        try:
+            corrcoef(x, allow_masked=False)
+        except ValueError:
+            pass
+        # 2 1D variables w/ missing values
+        nx = x[1:-1]
+        assert_almost_equal(np.corrcoef(nx, nx[::-1]), corrcoef(x, x[::-1]))
+        assert_almost_equal(np.corrcoef(nx, nx[::-1], rowvar=False),
+                            corrcoef(x, x[::-1], rowvar=False))
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            # ddof and bias have no or negligible effect on the function
+            assert_almost_equal(np.corrcoef(nx, nx[::-1]),
+                                corrcoef(x, x[::-1], bias=1))
+            assert_almost_equal(np.corrcoef(nx, nx[::-1]),
+                                corrcoef(x, x[::-1], ddof=2))
+
+    def test_2d_with_missing(self):
+        # Test corrcoef on 2D variable w/ missing value
+        x = self.data
+        x[-1] = masked
+        x = x.reshape(3, 4)
+
+        test = corrcoef(x)
+        control = np.corrcoef(x)
+        assert_almost_equal(test[:-1, :-1], control[:-1, :-1])
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            # ddof and bias have no or negligible effect on the function
+            assert_almost_equal(corrcoef(x, ddof=-2)[:-1, :-1],
+                                control[:-1, :-1])
+            assert_almost_equal(corrcoef(x, ddof=3)[:-1, :-1],
+                                control[:-1, :-1])
+            assert_almost_equal(corrcoef(x, bias=1)[:-1, :-1],
+                                control[:-1, :-1])
+
+
+class TestPolynomial:
+    #
+    def test_polyfit(self):
+        # Tests polyfit
+        # On ndarrays
+        x = np.random.rand(10)
+        y = np.random.rand(20).reshape(-1, 2)
+        assert_almost_equal(polyfit(x, y, 3), np.polyfit(x, y, 3))
+        # ON 1D maskedarrays
+        x = x.view(MaskedArray)
+        x[0] = masked
+        y = y.view(MaskedArray)
+        y[0, 0] = y[-1, -1] = masked
+        #
+        (C, R, K, S, D) = polyfit(x, y[:, 0], 3, full=True)
+        (c, r, k, s, d) = np.polyfit(x[1:], y[1:, 0].compressed(), 3,
+                                     full=True)
+        for (a, a_) in zip((C, R, K, S, D), (c, r, k, s, d)):
+            assert_almost_equal(a, a_)
+        #
+        (C, R, K, S, D) = polyfit(x, y[:, -1], 3, full=True)
+        (c, r, k, s, d) = np.polyfit(x[1:-1], y[1:-1, -1], 3, full=True)
+        for (a, a_) in zip((C, R, K, S, D), (c, r, k, s, d)):
+            assert_almost_equal(a, a_)
+        #
+        (C, R, K, S, D) = polyfit(x, y, 3, full=True)
+        (c, r, k, s, d) = np.polyfit(x[1:-1], y[1:-1,:], 3, full=True)
+        for (a, a_) in zip((C, R, K, S, D), (c, r, k, s, d)):
+            assert_almost_equal(a, a_)
+        #
+        w = np.random.rand(10) + 1
+        wo = w.copy()
+        xs = x[1:-1]
+        ys = y[1:-1]
+        ws = w[1:-1]
+        (C, R, K, S, D) = polyfit(x, y, 3, full=True, w=w)
+        (c, r, k, s, d) = np.polyfit(xs, ys, 3, full=True, w=ws)
+        assert_equal(w, wo)
+        for (a, a_) in zip((C, R, K, S, D), (c, r, k, s, d)):
+            assert_almost_equal(a, a_)
+
+    def test_polyfit_with_masked_NaNs(self):
+        x = np.random.rand(10)
+        y = np.random.rand(20).reshape(-1, 2)
+
+        x[0] = np.nan
+        y[-1,-1] = np.nan
+        x = x.view(MaskedArray)
+        y = y.view(MaskedArray)
+        x[0] = masked
+        y[-1,-1] = masked
+
+        (C, R, K, S, D) = polyfit(x, y, 3, full=True)
+        (c, r, k, s, d) = np.polyfit(x[1:-1], y[1:-1,:], 3, full=True)
+        for (a, a_) in zip((C, R, K, S, D), (c, r, k, s, d)):
+            assert_almost_equal(a, a_)
+
+
+class TestArraySetOps:
+
+    def test_unique_onlist(self):
+        # Test unique on list
+        data = [1, 1, 1, 2, 2, 3]
+        test = unique(data, return_index=True, return_inverse=True)
+        assert_(isinstance(test[0], MaskedArray))
+        assert_equal(test[0], masked_array([1, 2, 3], mask=[0, 0, 0]))
+        assert_equal(test[1], [0, 3, 5])
+        assert_equal(test[2], [0, 0, 0, 1, 1, 2])
+
+    def test_unique_onmaskedarray(self):
+        # Test unique on masked data w/use_mask=True
+        data = masked_array([1, 1, 1, 2, 2, 3], mask=[0, 0, 1, 0, 1, 0])
+        test = unique(data, return_index=True, return_inverse=True)
+        assert_equal(test[0], masked_array([1, 2, 3, -1], mask=[0, 0, 0, 1]))
+        assert_equal(test[1], [0, 3, 5, 2])
+        assert_equal(test[2], [0, 0, 3, 1, 3, 2])
+        #
+        data.fill_value = 3
+        data = masked_array(data=[1, 1, 1, 2, 2, 3],
+                            mask=[0, 0, 1, 0, 1, 0], fill_value=3)
+        test = unique(data, return_index=True, return_inverse=True)
+        assert_equal(test[0], masked_array([1, 2, 3, -1], mask=[0, 0, 0, 1]))
+        assert_equal(test[1], [0, 3, 5, 2])
+        assert_equal(test[2], [0, 0, 3, 1, 3, 2])
+
+    def test_unique_allmasked(self):
+        # Test all masked
+        data = masked_array([1, 1, 1], mask=True)
+        test = unique(data, return_index=True, return_inverse=True)
+        assert_equal(test[0], masked_array([1, ], mask=[True]))
+        assert_equal(test[1], [0])
+        assert_equal(test[2], [0, 0, 0])
+        #
+        # Test masked
+        data = masked
+        test = unique(data, return_index=True, return_inverse=True)
+        assert_equal(test[0], masked_array(masked))
+        assert_equal(test[1], [0])
+        assert_equal(test[2], [0])
+
+    def test_ediff1d(self):
+        # Tests mediff1d
+        x = masked_array(np.arange(5), mask=[1, 0, 0, 0, 1])
+        control = array([1, 1, 1, 4], mask=[1, 0, 0, 1])
+        test = ediff1d(x)
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+
+    def test_ediff1d_tobegin(self):
+        # Test ediff1d w/ to_begin
+        x = masked_array(np.arange(5), mask=[1, 0, 0, 0, 1])
+        test = ediff1d(x, to_begin=masked)
+        control = array([0, 1, 1, 1, 4], mask=[1, 1, 0, 0, 1])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+        #
+        test = ediff1d(x, to_begin=[1, 2, 3])
+        control = array([1, 2, 3, 1, 1, 1, 4], mask=[0, 0, 0, 1, 0, 0, 1])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+
+    def test_ediff1d_toend(self):
+        # Test ediff1d w/ to_end
+        x = masked_array(np.arange(5), mask=[1, 0, 0, 0, 1])
+        test = ediff1d(x, to_end=masked)
+        control = array([1, 1, 1, 4, 0], mask=[1, 0, 0, 1, 1])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+        #
+        test = ediff1d(x, to_end=[1, 2, 3])
+        control = array([1, 1, 1, 4, 1, 2, 3], mask=[1, 0, 0, 1, 0, 0, 0])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+
+    def test_ediff1d_tobegin_toend(self):
+        # Test ediff1d w/ to_begin and to_end
+        x = masked_array(np.arange(5), mask=[1, 0, 0, 0, 1])
+        test = ediff1d(x, to_end=masked, to_begin=masked)
+        control = array([0, 1, 1, 1, 4, 0], mask=[1, 1, 0, 0, 1, 1])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+        #
+        test = ediff1d(x, to_end=[1, 2, 3], to_begin=masked)
+        control = array([0, 1, 1, 1, 4, 1, 2, 3],
+                        mask=[1, 1, 0, 0, 1, 0, 0, 0])
+        assert_equal(test, control)
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+
+    def test_ediff1d_ndarray(self):
+        # Test ediff1d w/ a ndarray
+        x = np.arange(5)
+        test = ediff1d(x)
+        control = array([1, 1, 1, 1], mask=[0, 0, 0, 0])
+        assert_equal(test, control)
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+        #
+        test = ediff1d(x, to_end=masked, to_begin=masked)
+        control = array([0, 1, 1, 1, 1, 0], mask=[1, 0, 0, 0, 0, 1])
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test.filled(0), control.filled(0))
+        assert_equal(test.mask, control.mask)
+
+    def test_intersect1d(self):
+        # Test intersect1d
+        x = array([1, 3, 3, 3], mask=[0, 0, 0, 1])
+        y = array([3, 1, 1, 1], mask=[0, 0, 0, 1])
+        test = intersect1d(x, y)
+        control = array([1, 3, -1], mask=[0, 0, 1])
+        assert_equal(test, control)
+
+    def test_setxor1d(self):
+        # Test setxor1d
+        a = array([1, 2, 5, 7, -1], mask=[0, 0, 0, 0, 1])
+        b = array([1, 2, 3, 4, 5, -1], mask=[0, 0, 0, 0, 0, 1])
+        test = setxor1d(a, b)
+        assert_equal(test, array([3, 4, 7]))
+        #
+        a = array([1, 2, 5, 7, -1], mask=[0, 0, 0, 0, 1])
+        b = [1, 2, 3, 4, 5]
+        test = setxor1d(a, b)
+        assert_equal(test, array([3, 4, 7, -1], mask=[0, 0, 0, 1]))
+        #
+        a = array([1, 2, 3])
+        b = array([6, 5, 4])
+        test = setxor1d(a, b)
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, [1, 2, 3, 4, 5, 6])
+        #
+        a = array([1, 8, 2, 3], mask=[0, 1, 0, 0])
+        b = array([6, 5, 4, 8], mask=[0, 0, 0, 1])
+        test = setxor1d(a, b)
+        assert_(isinstance(test, MaskedArray))
+        assert_equal(test, [1, 2, 3, 4, 5, 6])
+        #
+        assert_array_equal([], setxor1d([], []))
+
+    def test_isin(self):
+        # the tests for in1d cover most of isin's behavior
+        # if in1d is removed, would need to change those tests to test
+        # isin instead.
+        a = np.arange(24).reshape([2, 3, 4])
+        mask = np.zeros([2, 3, 4])
+        mask[1, 2, 0] = 1
+        a = array(a, mask=mask)
+        b = array(data=[0, 10, 20, 30,  1,  3, 11, 22, 33],
+                  mask=[0,  1,  0,  1,  0,  1,  0,  1,  0])
+        ec = zeros((2, 3, 4), dtype=bool)
+        ec[0, 0, 0] = True
+        ec[0, 0, 1] = True
+        ec[0, 2, 3] = True
+        c = isin(a, b)
+        assert_(isinstance(c, MaskedArray))
+        assert_array_equal(c, ec)
+        #compare results of np.isin to ma.isin
+        d = np.isin(a, b[~b.mask]) & ~a.mask
+        assert_array_equal(c, d)
+
+    def test_in1d(self):
+        # Test in1d
+        a = array([1, 2, 5, 7, -1], mask=[0, 0, 0, 0, 1])
+        b = array([1, 2, 3, 4, 5, -1], mask=[0, 0, 0, 0, 0, 1])
+        test = in1d(a, b)
+        assert_equal(test, [True, True, True, False, True])
+        #
+        a = array([5, 5, 2, 1, -1], mask=[0, 0, 0, 0, 1])
+        b = array([1, 5, -1], mask=[0, 0, 1])
+        test = in1d(a, b)
+        assert_equal(test, [True, True, False, True, True])
+        #
+        assert_array_equal([], in1d([], []))
+
+    def test_in1d_invert(self):
+        # Test in1d's invert parameter
+        a = array([1, 2, 5, 7, -1], mask=[0, 0, 0, 0, 1])
+        b = array([1, 2, 3, 4, 5, -1], mask=[0, 0, 0, 0, 0, 1])
+        assert_equal(np.invert(in1d(a, b)), in1d(a, b, invert=True))
+
+        a = array([5, 5, 2, 1, -1], mask=[0, 0, 0, 0, 1])
+        b = array([1, 5, -1], mask=[0, 0, 1])
+        assert_equal(np.invert(in1d(a, b)), in1d(a, b, invert=True))
+
+        assert_array_equal([], in1d([], [], invert=True))
+
+    def test_union1d(self):
+        # Test union1d
+        a = array([1, 2, 5, 7, 5, -1], mask=[0, 0, 0, 0, 0, 1])
+        b = array([1, 2, 3, 4, 5, -1], mask=[0, 0, 0, 0, 0, 1])
+        test = union1d(a, b)
+        control = array([1, 2, 3, 4, 5, 7, -1], mask=[0, 0, 0, 0, 0, 0, 1])
+        assert_equal(test, control)
+
+        # Tests gh-10340, arguments to union1d should be
+        # flattened if they are not already 1D
+        x = array([[0, 1, 2], [3, 4, 5]], mask=[[0, 0, 0], [0, 0, 1]])
+        y = array([0, 1, 2, 3, 4], mask=[0, 0, 0, 0, 1])
+        ez = array([0, 1, 2, 3, 4, 5], mask=[0, 0, 0, 0, 0, 1])
+        z = union1d(x, y)
+        assert_equal(z, ez)
+        #
+        assert_array_equal([], union1d([], []))
+
+    def test_setdiff1d(self):
+        # Test setdiff1d
+        a = array([6, 5, 4, 7, 7, 1, 2, 1], mask=[0, 0, 0, 0, 0, 0, 0, 1])
+        b = array([2, 4, 3, 3, 2, 1, 5])
+        test = setdiff1d(a, b)
+        assert_equal(test, array([6, 7, -1], mask=[0, 0, 1]))
+        #
+        a = arange(10)
+        b = arange(8)
+        assert_equal(setdiff1d(a, b), array([8, 9]))
+        a = array([], np.uint32, mask=[])
+        assert_equal(setdiff1d(a, []).dtype, np.uint32)
+
+    def test_setdiff1d_char_array(self):
+        # Test setdiff1d_charray
+        a = np.array(['a', 'b', 'c'])
+        b = np.array(['a', 'b', 's'])
+        assert_array_equal(setdiff1d(a, b), np.array(['c']))
+
+
+class TestShapeBase:
+
+    def test_atleast_2d(self):
+        # Test atleast_2d
+        a = masked_array([0, 1, 2], mask=[0, 1, 0])
+        b = atleast_2d(a)
+        assert_equal(b.shape, (1, 3))
+        assert_equal(b.mask.shape, b.data.shape)
+        assert_equal(a.shape, (3,))
+        assert_equal(a.mask.shape, a.data.shape)
+        assert_equal(b.mask.shape, b.data.shape)
+
+    def test_shape_scalar(self):
+        # the atleast and diagflat function should work with scalars
+        # GitHub issue #3367
+        # Additionally, the atleast functions should accept multiple scalars
+        # correctly
+        b = atleast_1d(1.0)
+        assert_equal(b.shape, (1,))
+        assert_equal(b.mask.shape, b.shape)
+        assert_equal(b.data.shape, b.shape)
+
+        b = atleast_1d(1.0, 2.0)
+        for a in b:
+            assert_equal(a.shape, (1,))
+            assert_equal(a.mask.shape, a.shape)
+            assert_equal(a.data.shape, a.shape)
+
+        b = atleast_2d(1.0)
+        assert_equal(b.shape, (1, 1))
+        assert_equal(b.mask.shape, b.shape)
+        assert_equal(b.data.shape, b.shape)
+
+        b = atleast_2d(1.0, 2.0)
+        for a in b:
+            assert_equal(a.shape, (1, 1))
+            assert_equal(a.mask.shape, a.shape)
+            assert_equal(a.data.shape, a.shape)
+
+        b = atleast_3d(1.0)
+        assert_equal(b.shape, (1, 1, 1))
+        assert_equal(b.mask.shape, b.shape)
+        assert_equal(b.data.shape, b.shape)
+
+        b = atleast_3d(1.0, 2.0)
+        for a in b:
+            assert_equal(a.shape, (1, 1, 1))
+            assert_equal(a.mask.shape, a.shape)
+            assert_equal(a.data.shape, a.shape)
+
+
+        b = diagflat(1.0)
+        assert_equal(b.shape, (1, 1))
+        assert_equal(b.mask.shape, b.data.shape)
+
+
+class TestStack:
+
+    def test_stack_1d(self):
+        a = masked_array([0, 1, 2], mask=[0, 1, 0])
+        b = masked_array([9, 8, 7], mask=[1, 0, 0])
+
+        c = stack([a, b], axis=0)
+        assert_equal(c.shape, (2, 3))
+        assert_array_equal(a.mask, c[0].mask)
+        assert_array_equal(b.mask, c[1].mask)
+
+        d = vstack([a, b])
+        assert_array_equal(c.data, d.data)
+        assert_array_equal(c.mask, d.mask)
+
+        c = stack([a, b], axis=1)
+        assert_equal(c.shape, (3, 2))
+        assert_array_equal(a.mask, c[:, 0].mask)
+        assert_array_equal(b.mask, c[:, 1].mask)
+
+    def test_stack_masks(self):
+        a = masked_array([0, 1, 2], mask=True)
+        b = masked_array([9, 8, 7], mask=False)
+
+        c = stack([a, b], axis=0)
+        assert_equal(c.shape, (2, 3))
+        assert_array_equal(a.mask, c[0].mask)
+        assert_array_equal(b.mask, c[1].mask)
+
+        d = vstack([a, b])
+        assert_array_equal(c.data, d.data)
+        assert_array_equal(c.mask, d.mask)
+
+        c = stack([a, b], axis=1)
+        assert_equal(c.shape, (3, 2))
+        assert_array_equal(a.mask, c[:, 0].mask)
+        assert_array_equal(b.mask, c[:, 1].mask)
+
+    def test_stack_nd(self):
+        # 2D
+        shp = (3, 2)
+        d1 = np.random.randint(0, 10, shp)
+        d2 = np.random.randint(0, 10, shp)
+        m1 = np.random.randint(0, 2, shp).astype(bool)
+        m2 = np.random.randint(0, 2, shp).astype(bool)
+        a1 = masked_array(d1, mask=m1)
+        a2 = masked_array(d2, mask=m2)
+
+        c = stack([a1, a2], axis=0)
+        c_shp = (2,) + shp
+        assert_equal(c.shape, c_shp)
+        assert_array_equal(a1.mask, c[0].mask)
+        assert_array_equal(a2.mask, c[1].mask)
+
+        c = stack([a1, a2], axis=-1)
+        c_shp = shp + (2,)
+        assert_equal(c.shape, c_shp)
+        assert_array_equal(a1.mask, c[..., 0].mask)
+        assert_array_equal(a2.mask, c[..., 1].mask)
+
+        # 4D
+        shp = (3, 2, 4, 5,)
+        d1 = np.random.randint(0, 10, shp)
+        d2 = np.random.randint(0, 10, shp)
+        m1 = np.random.randint(0, 2, shp).astype(bool)
+        m2 = np.random.randint(0, 2, shp).astype(bool)
+        a1 = masked_array(d1, mask=m1)
+        a2 = masked_array(d2, mask=m2)
+
+        c = stack([a1, a2], axis=0)
+        c_shp = (2,) + shp
+        assert_equal(c.shape, c_shp)
+        assert_array_equal(a1.mask, c[0].mask)
+        assert_array_equal(a2.mask, c[1].mask)
+
+        c = stack([a1, a2], axis=-1)
+        c_shp = shp + (2,)
+        assert_equal(c.shape, c_shp)
+        assert_array_equal(a1.mask, c[..., 0].mask)
+        assert_array_equal(a2.mask, c[..., 1].mask)
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_mrecords.py b/venv/Lib/site-packages/numpy/ma/tests/test_mrecords.py
new file mode 100644
index 000000000..c2f859273
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_mrecords.py
@@ -0,0 +1,493 @@
+# pylint: disable-msg=W0611, W0612, W0511,R0201
+"""Tests suite for mrecords.
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+
+"""
+import numpy as np
+import numpy.ma as ma
+from numpy import recarray
+from numpy.ma import masked, nomask
+from numpy.testing import temppath
+from numpy.core.records import (
+    fromrecords as recfromrecords, fromarrays as recfromarrays
+    )
+from numpy.ma.mrecords import (
+    MaskedRecords, mrecarray, fromarrays, fromtextfile, fromrecords,
+    addfield
+    )
+from numpy.ma.testutils import (
+    assert_, assert_equal,
+    assert_equal_records,
+    )
+from numpy.compat import pickle
+
+
+class TestMRecords:
+
+    ilist = [1, 2, 3, 4, 5]
+    flist = [1.1, 2.2, 3.3, 4.4, 5.5]
+    slist = [b'one', b'two', b'three', b'four', b'five']
+    ddtype = [('a', int), ('b', float), ('c', '|S8')]
+    mask = [0, 1, 0, 0, 1]
+    base = ma.array(list(zip(ilist, flist, slist)), mask=mask, dtype=ddtype)
+
+    def test_byview(self):
+        # Test creation by view
+        base = self.base
+        mbase = base.view(mrecarray)
+        assert_equal(mbase.recordmask, base.recordmask)
+        assert_equal_records(mbase._mask, base._mask)
+        assert_(isinstance(mbase._data, recarray))
+        assert_equal_records(mbase._data, base._data.view(recarray))
+        for field in ('a', 'b', 'c'):
+            assert_equal(base[field], mbase[field])
+        assert_equal_records(mbase.view(mrecarray), mbase)
+
+    def test_get(self):
+        # Tests fields retrieval
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        # As fields..........
+        for field in ('a', 'b', 'c'):
+            assert_equal(getattr(mbase, field), mbase[field])
+            assert_equal(base[field], mbase[field])
+        # as elements .......
+        mbase_first = mbase[0]
+        assert_(isinstance(mbase_first, mrecarray))
+        assert_equal(mbase_first.dtype, mbase.dtype)
+        assert_equal(mbase_first.tolist(), (1, 1.1, b'one'))
+        # Used to be mask, now it's recordmask
+        assert_equal(mbase_first.recordmask, nomask)
+        assert_equal(mbase_first._mask.item(), (False, False, False))
+        assert_equal(mbase_first['a'], mbase['a'][0])
+        mbase_last = mbase[-1]
+        assert_(isinstance(mbase_last, mrecarray))
+        assert_equal(mbase_last.dtype, mbase.dtype)
+        assert_equal(mbase_last.tolist(), (None, None, None))
+        # Used to be mask, now it's recordmask
+        assert_equal(mbase_last.recordmask, True)
+        assert_equal(mbase_last._mask.item(), (True, True, True))
+        assert_equal(mbase_last['a'], mbase['a'][-1])
+        assert_((mbase_last['a'] is masked))
+        # as slice ..........
+        mbase_sl = mbase[:2]
+        assert_(isinstance(mbase_sl, mrecarray))
+        assert_equal(mbase_sl.dtype, mbase.dtype)
+        # Used to be mask, now it's recordmask
+        assert_equal(mbase_sl.recordmask, [0, 1])
+        assert_equal_records(mbase_sl.mask,
+                             np.array([(False, False, False),
+                                       (True, True, True)],
+                                      dtype=mbase._mask.dtype))
+        assert_equal_records(mbase_sl, base[:2].view(mrecarray))
+        for field in ('a', 'b', 'c'):
+            assert_equal(getattr(mbase_sl, field), base[:2][field])
+
+    def test_set_fields(self):
+        # Tests setting fields.
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        mbase = mbase.copy()
+        mbase.fill_value = (999999, 1e20, 'N/A')
+        # Change the data, the mask should be conserved
+        mbase.a._data[:] = 5
+        assert_equal(mbase['a']._data, [5, 5, 5, 5, 5])
+        assert_equal(mbase['a']._mask, [0, 1, 0, 0, 1])
+        # Change the elements, and the mask will follow
+        mbase.a = 1
+        assert_equal(mbase['a']._data, [1]*5)
+        assert_equal(ma.getmaskarray(mbase['a']), [0]*5)
+        # Use to be _mask, now it's recordmask
+        assert_equal(mbase.recordmask, [False]*5)
+        assert_equal(mbase._mask.tolist(),
+                     np.array([(0, 0, 0),
+                               (0, 1, 1),
+                               (0, 0, 0),
+                               (0, 0, 0),
+                               (0, 1, 1)],
+                              dtype=bool))
+        # Set a field to mask ........................
+        mbase.c = masked
+        # Use to be mask, and now it's still mask !
+        assert_equal(mbase.c.mask, [1]*5)
+        assert_equal(mbase.c.recordmask, [1]*5)
+        assert_equal(ma.getmaskarray(mbase['c']), [1]*5)
+        assert_equal(ma.getdata(mbase['c']), [b'N/A']*5)
+        assert_equal(mbase._mask.tolist(),
+                     np.array([(0, 0, 1),
+                               (0, 1, 1),
+                               (0, 0, 1),
+                               (0, 0, 1),
+                               (0, 1, 1)],
+                              dtype=bool))
+        # Set fields by slices .......................
+        mbase = base.view(mrecarray).copy()
+        mbase.a[3:] = 5
+        assert_equal(mbase.a, [1, 2, 3, 5, 5])
+        assert_equal(mbase.a._mask, [0, 1, 0, 0, 0])
+        mbase.b[3:] = masked
+        assert_equal(mbase.b, base['b'])
+        assert_equal(mbase.b._mask, [0, 1, 0, 1, 1])
+        # Set fields globally..........................
+        ndtype = [('alpha', '|S1'), ('num', int)]
+        data = ma.array([('a', 1), ('b', 2), ('c', 3)], dtype=ndtype)
+        rdata = data.view(MaskedRecords)
+        val = ma.array([10, 20, 30], mask=[1, 0, 0])
+
+        rdata['num'] = val
+        assert_equal(rdata.num, val)
+        assert_equal(rdata.num.mask, [1, 0, 0])
+
+    def test_set_fields_mask(self):
+        # Tests setting the mask of a field.
+        base = self.base.copy()
+        # This one has already a mask....
+        mbase = base.view(mrecarray)
+        mbase['a'][-2] = masked
+        assert_equal(mbase.a, [1, 2, 3, 4, 5])
+        assert_equal(mbase.a._mask, [0, 1, 0, 1, 1])
+        # This one has not yet
+        mbase = fromarrays([np.arange(5), np.random.rand(5)],
+                           dtype=[('a', int), ('b', float)])
+        mbase['a'][-2] = masked
+        assert_equal(mbase.a, [0, 1, 2, 3, 4])
+        assert_equal(mbase.a._mask, [0, 0, 0, 1, 0])
+
+    def test_set_mask(self):
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        # Set the mask to True .......................
+        mbase.mask = masked
+        assert_equal(ma.getmaskarray(mbase['b']), [1]*5)
+        assert_equal(mbase['a']._mask, mbase['b']._mask)
+        assert_equal(mbase['a']._mask, mbase['c']._mask)
+        assert_equal(mbase._mask.tolist(),
+                     np.array([(1, 1, 1)]*5, dtype=bool))
+        # Delete the mask ............................
+        mbase.mask = nomask
+        assert_equal(ma.getmaskarray(mbase['c']), [0]*5)
+        assert_equal(mbase._mask.tolist(),
+                     np.array([(0, 0, 0)]*5, dtype=bool))
+
+    def test_set_mask_fromarray(self):
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        # Sets the mask w/ an array
+        mbase.mask = [1, 0, 0, 0, 1]
+        assert_equal(mbase.a.mask, [1, 0, 0, 0, 1])
+        assert_equal(mbase.b.mask, [1, 0, 0, 0, 1])
+        assert_equal(mbase.c.mask, [1, 0, 0, 0, 1])
+        # Yay, once more !
+        mbase.mask = [0, 0, 0, 0, 1]
+        assert_equal(mbase.a.mask, [0, 0, 0, 0, 1])
+        assert_equal(mbase.b.mask, [0, 0, 0, 0, 1])
+        assert_equal(mbase.c.mask, [0, 0, 0, 0, 1])
+
+    def test_set_mask_fromfields(self):
+        mbase = self.base.copy().view(mrecarray)
+
+        nmask = np.array(
+            [(0, 1, 0), (0, 1, 0), (1, 0, 1), (1, 0, 1), (0, 0, 0)],
+            dtype=[('a', bool), ('b', bool), ('c', bool)])
+        mbase.mask = nmask
+        assert_equal(mbase.a.mask, [0, 0, 1, 1, 0])
+        assert_equal(mbase.b.mask, [1, 1, 0, 0, 0])
+        assert_equal(mbase.c.mask, [0, 0, 1, 1, 0])
+        # Reinitialize and redo
+        mbase.mask = False
+        mbase.fieldmask = nmask
+        assert_equal(mbase.a.mask, [0, 0, 1, 1, 0])
+        assert_equal(mbase.b.mask, [1, 1, 0, 0, 0])
+        assert_equal(mbase.c.mask, [0, 0, 1, 1, 0])
+
+    def test_set_elements(self):
+        base = self.base.copy()
+        # Set an element to mask .....................
+        mbase = base.view(mrecarray).copy()
+        mbase[-2] = masked
+        assert_equal(
+            mbase._mask.tolist(),
+            np.array([(0, 0, 0), (1, 1, 1), (0, 0, 0), (1, 1, 1), (1, 1, 1)],
+                     dtype=bool))
+        # Used to be mask, now it's recordmask!
+        assert_equal(mbase.recordmask, [0, 1, 0, 1, 1])
+        # Set slices .................................
+        mbase = base.view(mrecarray).copy()
+        mbase[:2] = (5, 5, 5)
+        assert_equal(mbase.a._data, [5, 5, 3, 4, 5])
+        assert_equal(mbase.a._mask, [0, 0, 0, 0, 1])
+        assert_equal(mbase.b._data, [5., 5., 3.3, 4.4, 5.5])
+        assert_equal(mbase.b._mask, [0, 0, 0, 0, 1])
+        assert_equal(mbase.c._data,
+                     [b'5', b'5', b'three', b'four', b'five'])
+        assert_equal(mbase.b._mask, [0, 0, 0, 0, 1])
+
+        mbase = base.view(mrecarray).copy()
+        mbase[:2] = masked
+        assert_equal(mbase.a._data, [1, 2, 3, 4, 5])
+        assert_equal(mbase.a._mask, [1, 1, 0, 0, 1])
+        assert_equal(mbase.b._data, [1.1, 2.2, 3.3, 4.4, 5.5])
+        assert_equal(mbase.b._mask, [1, 1, 0, 0, 1])
+        assert_equal(mbase.c._data,
+                     [b'one', b'two', b'three', b'four', b'five'])
+        assert_equal(mbase.b._mask, [1, 1, 0, 0, 1])
+
+    def test_setslices_hardmask(self):
+        # Tests setting slices w/ hardmask.
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        mbase.harden_mask()
+        try:
+            mbase[-2:] = (5, 5, 5)
+            assert_equal(mbase.a._data, [1, 2, 3, 5, 5])
+            assert_equal(mbase.b._data, [1.1, 2.2, 3.3, 5, 5.5])
+            assert_equal(mbase.c._data,
+                         [b'one', b'two', b'three', b'5', b'five'])
+            assert_equal(mbase.a._mask, [0, 1, 0, 0, 1])
+            assert_equal(mbase.b._mask, mbase.a._mask)
+            assert_equal(mbase.b._mask, mbase.c._mask)
+        except NotImplementedError:
+            # OK, not implemented yet...
+            pass
+        except AssertionError:
+            raise
+        else:
+            raise Exception("Flexible hard masks should be supported !")
+        # Not using a tuple should crash
+        try:
+            mbase[-2:] = 3
+        except (NotImplementedError, TypeError):
+            pass
+        else:
+            raise TypeError("Should have expected a readable buffer object!")
+
+    def test_hardmask(self):
+        # Test hardmask
+        base = self.base.copy()
+        mbase = base.view(mrecarray)
+        mbase.harden_mask()
+        assert_(mbase._hardmask)
+        mbase.mask = nomask
+        assert_equal_records(mbase._mask, base._mask)
+        mbase.soften_mask()
+        assert_(not mbase._hardmask)
+        mbase.mask = nomask
+        # So, the mask of a field is no longer set to nomask...
+        assert_equal_records(mbase._mask,
+                             ma.make_mask_none(base.shape, base.dtype))
+        assert_(ma.make_mask(mbase['b']._mask) is nomask)
+        assert_equal(mbase['a']._mask, mbase['b']._mask)
+
+    def test_pickling(self):
+        # Test pickling
+        base = self.base.copy()
+        mrec = base.view(mrecarray)
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            _ = pickle.dumps(mrec, protocol=proto)
+            mrec_ = pickle.loads(_)
+            assert_equal(mrec_.dtype, mrec.dtype)
+            assert_equal_records(mrec_._data, mrec._data)
+            assert_equal(mrec_._mask, mrec._mask)
+            assert_equal_records(mrec_._mask, mrec._mask)
+
+    def test_filled(self):
+        # Test filling the array
+        _a = ma.array([1, 2, 3], mask=[0, 0, 1], dtype=int)
+        _b = ma.array([1.1, 2.2, 3.3], mask=[0, 0, 1], dtype=float)
+        _c = ma.array(['one', 'two', 'three'], mask=[0, 0, 1], dtype='|S8')
+        ddtype = [('a', int), ('b', float), ('c', '|S8')]
+        mrec = fromarrays([_a, _b, _c], dtype=ddtype,
+                          fill_value=(99999, 99999., 'N/A'))
+        mrecfilled = mrec.filled()
+        assert_equal(mrecfilled['a'], np.array((1, 2, 99999), dtype=int))
+        assert_equal(mrecfilled['b'], np.array((1.1, 2.2, 99999.),
+                                               dtype=float))
+        assert_equal(mrecfilled['c'], np.array(('one', 'two', 'N/A'),
+                                               dtype='|S8'))
+
+    def test_tolist(self):
+        # Test tolist.
+        _a = ma.array([1, 2, 3], mask=[0, 0, 1], dtype=int)
+        _b = ma.array([1.1, 2.2, 3.3], mask=[0, 0, 1], dtype=float)
+        _c = ma.array(['one', 'two', 'three'], mask=[1, 0, 0], dtype='|S8')
+        ddtype = [('a', int), ('b', float), ('c', '|S8')]
+        mrec = fromarrays([_a, _b, _c], dtype=ddtype,
+                          fill_value=(99999, 99999., 'N/A'))
+
+        assert_equal(mrec.tolist(),
+                     [(1, 1.1, None), (2, 2.2, b'two'),
+                      (None, None, b'three')])
+
+    def test_withnames(self):
+        # Test the creation w/ format and names
+        x = mrecarray(1, formats=float, names='base')
+        x[0]['base'] = 10
+        assert_equal(x['base'][0], 10)
+
+    def test_exotic_formats(self):
+        # Test that 'exotic' formats are processed properly
+        easy = mrecarray(1, dtype=[('i', int), ('s', '|S8'), ('f', float)])
+        easy[0] = masked
+        assert_equal(easy.filled(1).item(), (1, b'1', 1.))
+
+        solo = mrecarray(1, dtype=[('f0', '<f8', (2, 2))])
+        solo[0] = masked
+        assert_equal(solo.filled(1).item(),
+                     np.array((1,), dtype=solo.dtype).item())
+
+        mult = mrecarray(2, dtype="i4, (2,3)float, float")
+        mult[0] = masked
+        mult[1] = (1, 1, 1)
+        mult.filled(0)
+        assert_equal_records(mult.filled(0),
+                             np.array([(0, 0, 0), (1, 1, 1)],
+                                      dtype=mult.dtype))
+
+
+class TestView:
+
+    def setup(self):
+        (a, b) = (np.arange(10), np.random.rand(10))
+        ndtype = [('a', float), ('b', float)]
+        arr = np.array(list(zip(a, b)), dtype=ndtype)
+
+        mrec = fromarrays([a, b], dtype=ndtype, fill_value=(-9., -99.))
+        mrec.mask[3] = (False, True)
+        self.data = (mrec, a, b, arr)
+
+    def test_view_by_itself(self):
+        (mrec, a, b, arr) = self.data
+        test = mrec.view()
+        assert_(isinstance(test, MaskedRecords))
+        assert_equal_records(test, mrec)
+        assert_equal_records(test._mask, mrec._mask)
+
+    def test_view_simple_dtype(self):
+        (mrec, a, b, arr) = self.data
+        ntype = (float, 2)
+        test = mrec.view(ntype)
+        assert_(isinstance(test, ma.MaskedArray))
+        assert_equal(test, np.array(list(zip(a, b)), dtype=float))
+        assert_(test[3, 1] is ma.masked)
+
+    def test_view_flexible_type(self):
+        (mrec, a, b, arr) = self.data
+        alttype = [('A', float), ('B', float)]
+        test = mrec.view(alttype)
+        assert_(isinstance(test, MaskedRecords))
+        assert_equal_records(test, arr.view(alttype))
+        assert_(test['B'][3] is masked)
+        assert_equal(test.dtype, np.dtype(alttype))
+        assert_(test._fill_value is None)
+
+
+##############################################################################
+class TestMRecordsImport:
+
+    _a = ma.array([1, 2, 3], mask=[0, 0, 1], dtype=int)
+    _b = ma.array([1.1, 2.2, 3.3], mask=[0, 0, 1], dtype=float)
+    _c = ma.array([b'one', b'two', b'three'],
+                  mask=[0, 0, 1], dtype='|S8')
+    ddtype = [('a', int), ('b', float), ('c', '|S8')]
+    mrec = fromarrays([_a, _b, _c], dtype=ddtype,
+                      fill_value=(b'99999', b'99999.',
+                                  b'N/A'))
+    nrec = recfromarrays((_a._data, _b._data, _c._data), dtype=ddtype)
+    data = (mrec, nrec, ddtype)
+
+    def test_fromarrays(self):
+        _a = ma.array([1, 2, 3], mask=[0, 0, 1], dtype=int)
+        _b = ma.array([1.1, 2.2, 3.3], mask=[0, 0, 1], dtype=float)
+        _c = ma.array(['one', 'two', 'three'], mask=[0, 0, 1], dtype='|S8')
+        (mrec, nrec, _) = self.data
+        for (f, l) in zip(('a', 'b', 'c'), (_a, _b, _c)):
+            assert_equal(getattr(mrec, f)._mask, l._mask)
+        # One record only
+        _x = ma.array([1, 1.1, 'one'], mask=[1, 0, 0],)
+        assert_equal_records(fromarrays(_x, dtype=mrec.dtype), mrec[0])
+
+    def test_fromrecords(self):
+        # Test construction from records.
+        (mrec, nrec, ddtype) = self.data
+        #......
+        palist = [(1, 'abc', 3.7000002861022949, 0),
+                  (2, 'xy', 6.6999998092651367, 1),
+                  (0, ' ', 0.40000000596046448, 0)]
+        pa = recfromrecords(palist, names='c1, c2, c3, c4')
+        mpa = fromrecords(palist, names='c1, c2, c3, c4')
+        assert_equal_records(pa, mpa)
+        #.....
+        _mrec = fromrecords(nrec)
+        assert_equal(_mrec.dtype, mrec.dtype)
+        for field in _mrec.dtype.names:
+            assert_equal(getattr(_mrec, field), getattr(mrec._data, field))
+
+        _mrec = fromrecords(nrec.tolist(), names='c1,c2,c3')
+        assert_equal(_mrec.dtype, [('c1', int), ('c2', float), ('c3', '|S5')])
+        for (f, n) in zip(('c1', 'c2', 'c3'), ('a', 'b', 'c')):
+            assert_equal(getattr(_mrec, f), getattr(mrec._data, n))
+
+        _mrec = fromrecords(mrec)
+        assert_equal(_mrec.dtype, mrec.dtype)
+        assert_equal_records(_mrec._data, mrec.filled())
+        assert_equal_records(_mrec._mask, mrec._mask)
+
+    def test_fromrecords_wmask(self):
+        # Tests construction from records w/ mask.
+        (mrec, nrec, ddtype) = self.data
+
+        _mrec = fromrecords(nrec.tolist(), dtype=ddtype, mask=[0, 1, 0,])
+        assert_equal_records(_mrec._data, mrec._data)
+        assert_equal(_mrec._mask.tolist(), [(0, 0, 0), (1, 1, 1), (0, 0, 0)])
+
+        _mrec = fromrecords(nrec.tolist(), dtype=ddtype, mask=True)
+        assert_equal_records(_mrec._data, mrec._data)
+        assert_equal(_mrec._mask.tolist(), [(1, 1, 1), (1, 1, 1), (1, 1, 1)])
+
+        _mrec = fromrecords(nrec.tolist(), dtype=ddtype, mask=mrec._mask)
+        assert_equal_records(_mrec._data, mrec._data)
+        assert_equal(_mrec._mask.tolist(), mrec._mask.tolist())
+
+        _mrec = fromrecords(nrec.tolist(), dtype=ddtype,
+                            mask=mrec._mask.tolist())
+        assert_equal_records(_mrec._data, mrec._data)
+        assert_equal(_mrec._mask.tolist(), mrec._mask.tolist())
+
+    def test_fromtextfile(self):
+        # Tests reading from a text file.
+        fcontent = (
+"""#
+'One (S)','Two (I)','Three (F)','Four (M)','Five (-)','Six (C)'
+'strings',1,1.0,'mixed column',,1
+'with embedded "double quotes"',2,2.0,1.0,,1
+'strings',3,3.0E5,3,,1
+'strings',4,-1e-10,,,1
+""")
+        with temppath() as path:
+            with open(path, 'w') as f:
+                f.write(fcontent)
+            mrectxt = fromtextfile(path, delimitor=',', varnames='ABCDEFG')
+        assert_(isinstance(mrectxt, MaskedRecords))
+        assert_equal(mrectxt.F, [1, 1, 1, 1])
+        assert_equal(mrectxt.E._mask, [1, 1, 1, 1])
+        assert_equal(mrectxt.C, [1, 2, 3.e+5, -1e-10])
+
+    def test_addfield(self):
+        # Tests addfield
+        (mrec, nrec, ddtype) = self.data
+        (d, m) = ([100, 200, 300], [1, 0, 0])
+        mrec = addfield(mrec, ma.array(d, mask=m))
+        assert_equal(mrec.f3, d)
+        assert_equal(mrec.f3._mask, m)
+
+
+def test_record_array_with_object_field():
+    # Trac #1839
+    y = ma.masked_array(
+        [(1, '2'), (3, '4')],
+        mask=[(0, 0), (0, 1)],
+        dtype=[('a', int), ('b', object)])
+    # getting an item used to fail
+    y[1]
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_old_ma.py b/venv/Lib/site-packages/numpy/ma/tests/test_old_ma.py
new file mode 100644
index 000000000..96c7e3609
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_old_ma.py
@@ -0,0 +1,858 @@
+from functools import reduce
+
+import numpy as np
+import numpy.core.umath as umath
+import numpy.core.fromnumeric as fromnumeric
+from numpy.testing import (
+    assert_, assert_raises, assert_equal,
+    )
+from numpy.ma import (
+    MaskType, MaskedArray, absolute, add, all, allclose, allequal, alltrue,
+    arange, arccos, arcsin, arctan, arctan2, array, average, choose,
+    concatenate, conjugate, cos, cosh, count, divide, equal, exp, filled,
+    getmask, greater, greater_equal, inner, isMaskedArray, less,
+    less_equal, log, log10, make_mask, masked, masked_array, masked_equal,
+    masked_greater, masked_greater_equal, masked_inside, masked_less,
+    masked_less_equal, masked_not_equal, masked_outside,
+    masked_print_option, masked_values, masked_where, maximum, minimum,
+    multiply, nomask, nonzero, not_equal, ones, outer, product, put, ravel,
+    repeat, resize, shape, sin, sinh, sometrue, sort, sqrt, subtract, sum,
+    take, tan, tanh, transpose, where, zeros,
+    )
+from numpy.compat import pickle
+
+pi = np.pi
+
+
+def eq(v, w, msg=''):
+    result = allclose(v, w)
+    if not result:
+        print("Not eq:%s\n%s\n----%s" % (msg, str(v), str(w)))
+    return result
+
+
+class TestMa:
+
+    def setup(self):
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        a10 = 10.
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = array(x, mask=m1)
+        ym = array(y, mask=m2)
+        z = np.array([-.5, 0., .5, .8])
+        zm = array(z, mask=[0, 1, 0, 0])
+        xf = np.where(m1, 1e+20, x)
+        s = x.shape
+        xm.set_fill_value(1e+20)
+        self.d = (x, y, a10, m1, m2, xm, ym, z, zm, xf, s)
+
+    def test_testBasic1d(self):
+        # Test of basic array creation and properties in 1 dimension.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        assert_(not isMaskedArray(x))
+        assert_(isMaskedArray(xm))
+        assert_equal(shape(xm), s)
+        assert_equal(xm.shape, s)
+        assert_equal(xm.dtype, x.dtype)
+        assert_equal(xm.size, reduce(lambda x, y:x * y, s))
+        assert_equal(count(xm), len(m1) - reduce(lambda x, y:x + y, m1))
+        assert_(eq(xm, xf))
+        assert_(eq(filled(xm, 1.e20), xf))
+        assert_(eq(x, xm))
+
+    def test_testBasic2d(self):
+        # Test of basic array creation and properties in 2 dimensions.
+        for s in [(4, 3), (6, 2)]:
+            (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+            x.shape = s
+            y.shape = s
+            xm.shape = s
+            ym.shape = s
+            xf.shape = s
+
+            assert_(not isMaskedArray(x))
+            assert_(isMaskedArray(xm))
+            assert_equal(shape(xm), s)
+            assert_equal(xm.shape, s)
+            assert_equal(xm.size, reduce(lambda x, y:x * y, s))
+            assert_equal(count(xm),
+                             len(m1) - reduce(lambda x, y:x + y, m1))
+            assert_(eq(xm, xf))
+            assert_(eq(filled(xm, 1.e20), xf))
+            assert_(eq(x, xm))
+            self.setup()
+
+    def test_testArithmetic(self):
+        # Test of basic arithmetic.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        a2d = array([[1, 2], [0, 4]])
+        a2dm = masked_array(a2d, [[0, 0], [1, 0]])
+        assert_(eq(a2d * a2d, a2d * a2dm))
+        assert_(eq(a2d + a2d, a2d + a2dm))
+        assert_(eq(a2d - a2d, a2d - a2dm))
+        for s in [(12,), (4, 3), (2, 6)]:
+            x = x.reshape(s)
+            y = y.reshape(s)
+            xm = xm.reshape(s)
+            ym = ym.reshape(s)
+            xf = xf.reshape(s)
+            assert_(eq(-x, -xm))
+            assert_(eq(x + y, xm + ym))
+            assert_(eq(x - y, xm - ym))
+            assert_(eq(x * y, xm * ym))
+            with np.errstate(divide='ignore', invalid='ignore'):
+                assert_(eq(x / y, xm / ym))
+            assert_(eq(a10 + y, a10 + ym))
+            assert_(eq(a10 - y, a10 - ym))
+            assert_(eq(a10 * y, a10 * ym))
+            with np.errstate(divide='ignore', invalid='ignore'):
+                assert_(eq(a10 / y, a10 / ym))
+            assert_(eq(x + a10, xm + a10))
+            assert_(eq(x - a10, xm - a10))
+            assert_(eq(x * a10, xm * a10))
+            assert_(eq(x / a10, xm / a10))
+            assert_(eq(x ** 2, xm ** 2))
+            assert_(eq(abs(x) ** 2.5, abs(xm) ** 2.5))
+            assert_(eq(x ** y, xm ** ym))
+            assert_(eq(np.add(x, y), add(xm, ym)))
+            assert_(eq(np.subtract(x, y), subtract(xm, ym)))
+            assert_(eq(np.multiply(x, y), multiply(xm, ym)))
+            with np.errstate(divide='ignore', invalid='ignore'):
+                assert_(eq(np.divide(x, y), divide(xm, ym)))
+
+    def test_testMixedArithmetic(self):
+        na = np.array([1])
+        ma = array([1])
+        assert_(isinstance(na + ma, MaskedArray))
+        assert_(isinstance(ma + na, MaskedArray))
+
+    def test_testUfuncs1(self):
+        # Test various functions such as sin, cos.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        assert_(eq(np.cos(x), cos(xm)))
+        assert_(eq(np.cosh(x), cosh(xm)))
+        assert_(eq(np.sin(x), sin(xm)))
+        assert_(eq(np.sinh(x), sinh(xm)))
+        assert_(eq(np.tan(x), tan(xm)))
+        assert_(eq(np.tanh(x), tanh(xm)))
+        with np.errstate(divide='ignore', invalid='ignore'):
+            assert_(eq(np.sqrt(abs(x)), sqrt(xm)))
+            assert_(eq(np.log(abs(x)), log(xm)))
+            assert_(eq(np.log10(abs(x)), log10(xm)))
+        assert_(eq(np.exp(x), exp(xm)))
+        assert_(eq(np.arcsin(z), arcsin(zm)))
+        assert_(eq(np.arccos(z), arccos(zm)))
+        assert_(eq(np.arctan(z), arctan(zm)))
+        assert_(eq(np.arctan2(x, y), arctan2(xm, ym)))
+        assert_(eq(np.absolute(x), absolute(xm)))
+        assert_(eq(np.equal(x, y), equal(xm, ym)))
+        assert_(eq(np.not_equal(x, y), not_equal(xm, ym)))
+        assert_(eq(np.less(x, y), less(xm, ym)))
+        assert_(eq(np.greater(x, y), greater(xm, ym)))
+        assert_(eq(np.less_equal(x, y), less_equal(xm, ym)))
+        assert_(eq(np.greater_equal(x, y), greater_equal(xm, ym)))
+        assert_(eq(np.conjugate(x), conjugate(xm)))
+        assert_(eq(np.concatenate((x, y)), concatenate((xm, ym))))
+        assert_(eq(np.concatenate((x, y)), concatenate((x, y))))
+        assert_(eq(np.concatenate((x, y)), concatenate((xm, y))))
+        assert_(eq(np.concatenate((x, y, x)), concatenate((x, ym, x))))
+
+    def test_xtestCount(self):
+        # Test count
+        ott = array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        assert_(count(ott).dtype.type is np.intp)
+        assert_equal(3, count(ott))
+        assert_equal(1, count(1))
+        assert_(eq(0, array(1, mask=[1])))
+        ott = ott.reshape((2, 2))
+        assert_(count(ott).dtype.type is np.intp)
+        assert_(isinstance(count(ott, 0), np.ndarray))
+        assert_(count(ott).dtype.type is np.intp)
+        assert_(eq(3, count(ott)))
+        assert_(getmask(count(ott, 0)) is nomask)
+        assert_(eq([1, 2], count(ott, 0)))
+
+    def test_testMinMax(self):
+        # Test minimum and maximum.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        xr = np.ravel(x)  # max doesn't work if shaped
+        xmr = ravel(xm)
+
+        # true because of careful selection of data
+        assert_(eq(max(xr), maximum.reduce(xmr)))
+        assert_(eq(min(xr), minimum.reduce(xmr)))
+
+    def test_testAddSumProd(self):
+        # Test add, sum, product.
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        assert_(eq(np.add.reduce(x), add.reduce(x)))
+        assert_(eq(np.add.accumulate(x), add.accumulate(x)))
+        assert_(eq(4, sum(array(4), axis=0)))
+        assert_(eq(4, sum(array(4), axis=0)))
+        assert_(eq(np.sum(x, axis=0), sum(x, axis=0)))
+        assert_(eq(np.sum(filled(xm, 0), axis=0), sum(xm, axis=0)))
+        assert_(eq(np.sum(x, 0), sum(x, 0)))
+        assert_(eq(np.product(x, axis=0), product(x, axis=0)))
+        assert_(eq(np.product(x, 0), product(x, 0)))
+        assert_(eq(np.product(filled(xm, 1), axis=0),
+                           product(xm, axis=0)))
+        if len(s) > 1:
+            assert_(eq(np.concatenate((x, y), 1),
+                               concatenate((xm, ym), 1)))
+            assert_(eq(np.add.reduce(x, 1), add.reduce(x, 1)))
+            assert_(eq(np.sum(x, 1), sum(x, 1)))
+            assert_(eq(np.product(x, 1), product(x, 1)))
+
+    def test_testCI(self):
+        # Test of conversions and indexing
+        x1 = np.array([1, 2, 4, 3])
+        x2 = array(x1, mask=[1, 0, 0, 0])
+        x3 = array(x1, mask=[0, 1, 0, 1])
+        x4 = array(x1)
+        # test conversion to strings
+        str(x2)  # raises?
+        repr(x2)  # raises?
+        assert_(eq(np.sort(x1), sort(x2, fill_value=0)))
+        # tests of indexing
+        assert_(type(x2[1]) is type(x1[1]))
+        assert_(x1[1] == x2[1])
+        assert_(x2[0] is masked)
+        assert_(eq(x1[2], x2[2]))
+        assert_(eq(x1[2:5], x2[2:5]))
+        assert_(eq(x1[:], x2[:]))
+        assert_(eq(x1[1:], x3[1:]))
+        x1[2] = 9
+        x2[2] = 9
+        assert_(eq(x1, x2))
+        x1[1:3] = 99
+        x2[1:3] = 99
+        assert_(eq(x1, x2))
+        x2[1] = masked
+        assert_(eq(x1, x2))
+        x2[1:3] = masked
+        assert_(eq(x1, x2))
+        x2[:] = x1
+        x2[1] = masked
+        assert_(allequal(getmask(x2), array([0, 1, 0, 0])))
+        x3[:] = masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        assert_(allequal(getmask(x3), array([0, 1, 1, 0])))
+        x4[:] = masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        assert_(allequal(getmask(x4), array([0, 1, 1, 0])))
+        assert_(allequal(x4, array([1, 2, 3, 4])))
+        x1 = np.arange(5) * 1.0
+        x2 = masked_values(x1, 3.0)
+        assert_(eq(x1, x2))
+        assert_(allequal(array([0, 0, 0, 1, 0], MaskType), x2.mask))
+        assert_(eq(3.0, x2.fill_value))
+        x1 = array([1, 'hello', 2, 3], object)
+        x2 = np.array([1, 'hello', 2, 3], object)
+        s1 = x1[1]
+        s2 = x2[1]
+        assert_equal(type(s2), str)
+        assert_equal(type(s1), str)
+        assert_equal(s1, s2)
+        assert_(x1[1:1].shape == (0,))
+
+    def test_testCopySize(self):
+        # Tests of some subtle points of copying and sizing.
+        n = [0, 0, 1, 0, 0]
+        m = make_mask(n)
+        m2 = make_mask(m)
+        assert_(m is m2)
+        m3 = make_mask(m, copy=True)
+        assert_(m is not m3)
+
+        x1 = np.arange(5)
+        y1 = array(x1, mask=m)
+        assert_(y1._data is not x1)
+        assert_(allequal(x1, y1._data))
+        assert_(y1._mask is m)
+
+        y1a = array(y1, copy=0)
+        # For copy=False, one might expect that the array would just
+        # passed on, i.e., that it would be "is" instead of "==".
+        # See gh-4043 for discussion.
+        assert_(y1a._mask.__array_interface__ ==
+                y1._mask.__array_interface__)
+
+        y2 = array(x1, mask=m3, copy=0)
+        assert_(y2._mask is m3)
+        assert_(y2[2] is masked)
+        y2[2] = 9
+        assert_(y2[2] is not masked)
+        assert_(y2._mask is m3)
+        assert_(allequal(y2.mask, 0))
+
+        y2a = array(x1, mask=m, copy=1)
+        assert_(y2a._mask is not m)
+        assert_(y2a[2] is masked)
+        y2a[2] = 9
+        assert_(y2a[2] is not masked)
+        assert_(y2a._mask is not m)
+        assert_(allequal(y2a.mask, 0))
+
+        y3 = array(x1 * 1.0, mask=m)
+        assert_(filled(y3).dtype is (x1 * 1.0).dtype)
+
+        x4 = arange(4)
+        x4[2] = masked
+        y4 = resize(x4, (8,))
+        assert_(eq(concatenate([x4, x4]), y4))
+        assert_(eq(getmask(y4), [0, 0, 1, 0, 0, 0, 1, 0]))
+        y5 = repeat(x4, (2, 2, 2, 2), axis=0)
+        assert_(eq(y5, [0, 0, 1, 1, 2, 2, 3, 3]))
+        y6 = repeat(x4, 2, axis=0)
+        assert_(eq(y5, y6))
+
+    def test_testPut(self):
+        # Test of put
+        d = arange(5)
+        n = [0, 0, 0, 1, 1]
+        m = make_mask(n)
+        m2 = m.copy()
+        x = array(d, mask=m)
+        assert_(x[3] is masked)
+        assert_(x[4] is masked)
+        x[[1, 4]] = [10, 40]
+        assert_(x._mask is m)
+        assert_(x[3] is masked)
+        assert_(x[4] is not masked)
+        assert_(eq(x, [0, 10, 2, -1, 40]))
+
+        x = array(d, mask=m2, copy=True)
+        x.put([0, 1, 2], [-1, 100, 200])
+        assert_(x._mask is not m2)
+        assert_(x[3] is masked)
+        assert_(x[4] is masked)
+        assert_(eq(x, [-1, 100, 200, 0, 0]))
+
+    def test_testPut2(self):
+        # Test of put
+        d = arange(5)
+        x = array(d, mask=[0, 0, 0, 0, 0])
+        z = array([10, 40], mask=[1, 0])
+        assert_(x[2] is not masked)
+        assert_(x[3] is not masked)
+        x[2:4] = z
+        assert_(x[2] is masked)
+        assert_(x[3] is not masked)
+        assert_(eq(x, [0, 1, 10, 40, 4]))
+
+        d = arange(5)
+        x = array(d, mask=[0, 0, 0, 0, 0])
+        y = x[2:4]
+        z = array([10, 40], mask=[1, 0])
+        assert_(x[2] is not masked)
+        assert_(x[3] is not masked)
+        y[:] = z
+        assert_(y[0] is masked)
+        assert_(y[1] is not masked)
+        assert_(eq(y, [10, 40]))
+        assert_(x[2] is masked)
+        assert_(x[3] is not masked)
+        assert_(eq(x, [0, 1, 10, 40, 4]))
+
+    def test_testMaPut(self):
+        (x, y, a10, m1, m2, xm, ym, z, zm, xf, s) = self.d
+        m = [1, 0, 0, 0, 0, 0, 1, 0, 0, 1, 0, 1]
+        i = np.nonzero(m)[0]
+        put(ym, i, zm)
+        assert_(all(take(ym, i, axis=0) == zm))
+
+    def test_testOddFeatures(self):
+        # Test of other odd features
+        x = arange(20)
+        x = x.reshape(4, 5)
+        x.flat[5] = 12
+        assert_(x[1, 0] == 12)
+        z = x + 10j * x
+        assert_(eq(z.real, x))
+        assert_(eq(z.imag, 10 * x))
+        assert_(eq((z * conjugate(z)).real, 101 * x * x))
+        z.imag[...] = 0.0
+
+        x = arange(10)
+        x[3] = masked
+        assert_(str(x[3]) == str(masked))
+        c = x >= 8
+        assert_(count(where(c, masked, masked)) == 0)
+        assert_(shape(where(c, masked, masked)) == c.shape)
+        z = where(c, x, masked)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is masked)
+        assert_(z[7] is masked)
+        assert_(z[8] is not masked)
+        assert_(z[9] is not masked)
+        assert_(eq(x, z))
+        z = where(c, masked, x)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is not masked)
+        assert_(z[7] is not masked)
+        assert_(z[8] is masked)
+        assert_(z[9] is masked)
+        z = masked_where(c, x)
+        assert_(z.dtype is x.dtype)
+        assert_(z[3] is masked)
+        assert_(z[4] is not masked)
+        assert_(z[7] is not masked)
+        assert_(z[8] is masked)
+        assert_(z[9] is masked)
+        assert_(eq(x, z))
+        x = array([1., 2., 3., 4., 5.])
+        c = array([1, 1, 1, 0, 0])
+        x[2] = masked
+        z = where(c, x, -x)
+        assert_(eq(z, [1., 2., 0., -4., -5]))
+        c[0] = masked
+        z = where(c, x, -x)
+        assert_(eq(z, [1., 2., 0., -4., -5]))
+        assert_(z[0] is masked)
+        assert_(z[1] is not masked)
+        assert_(z[2] is masked)
+        assert_(eq(masked_where(greater(x, 2), x), masked_greater(x, 2)))
+        assert_(eq(masked_where(greater_equal(x, 2), x),
+                   masked_greater_equal(x, 2)))
+        assert_(eq(masked_where(less(x, 2), x), masked_less(x, 2)))
+        assert_(eq(masked_where(less_equal(x, 2), x), masked_less_equal(x, 2)))
+        assert_(eq(masked_where(not_equal(x, 2), x), masked_not_equal(x, 2)))
+        assert_(eq(masked_where(equal(x, 2), x), masked_equal(x, 2)))
+        assert_(eq(masked_where(not_equal(x, 2), x), masked_not_equal(x, 2)))
+        assert_(eq(masked_inside(list(range(5)), 1, 3), [0, 199, 199, 199, 4]))
+        assert_(eq(masked_outside(list(range(5)), 1, 3), [199, 1, 2, 3, 199]))
+        assert_(eq(masked_inside(array(list(range(5)),
+                                       mask=[1, 0, 0, 0, 0]), 1, 3).mask,
+                   [1, 1, 1, 1, 0]))
+        assert_(eq(masked_outside(array(list(range(5)),
+                                        mask=[0, 1, 0, 0, 0]), 1, 3).mask,
+                   [1, 1, 0, 0, 1]))
+        assert_(eq(masked_equal(array(list(range(5)),
+                                      mask=[1, 0, 0, 0, 0]), 2).mask,
+                   [1, 0, 1, 0, 0]))
+        assert_(eq(masked_not_equal(array([2, 2, 1, 2, 1],
+                                          mask=[1, 0, 0, 0, 0]), 2).mask,
+                   [1, 0, 1, 0, 1]))
+        assert_(eq(masked_where([1, 1, 0, 0, 0], [1, 2, 3, 4, 5]),
+                   [99, 99, 3, 4, 5]))
+        atest = ones((10, 10, 10), dtype=np.float32)
+        btest = zeros(atest.shape, MaskType)
+        ctest = masked_where(btest, atest)
+        assert_(eq(atest, ctest))
+        z = choose(c, (-x, x))
+        assert_(eq(z, [1., 2., 0., -4., -5]))
+        assert_(z[0] is masked)
+        assert_(z[1] is not masked)
+        assert_(z[2] is masked)
+        x = arange(6)
+        x[5] = masked
+        y = arange(6) * 10
+        y[2] = masked
+        c = array([1, 1, 1, 0, 0, 0], mask=[1, 0, 0, 0, 0, 0])
+        cm = c.filled(1)
+        z = where(c, x, y)
+        zm = where(cm, x, y)
+        assert_(eq(z, zm))
+        assert_(getmask(zm) is nomask)
+        assert_(eq(zm, [0, 1, 2, 30, 40, 50]))
+        z = where(c, masked, 1)
+        assert_(eq(z, [99, 99, 99, 1, 1, 1]))
+        z = where(c, 1, masked)
+        assert_(eq(z, [99, 1, 1, 99, 99, 99]))
+
+    def test_testMinMax2(self):
+        # Test of minimum, maximum.
+        assert_(eq(minimum([1, 2, 3], [4, 0, 9]), [1, 0, 3]))
+        assert_(eq(maximum([1, 2, 3], [4, 0, 9]), [4, 2, 9]))
+        x = arange(5)
+        y = arange(5) - 2
+        x[3] = masked
+        y[0] = masked
+        assert_(eq(minimum(x, y), where(less(x, y), x, y)))
+        assert_(eq(maximum(x, y), where(greater(x, y), x, y)))
+        assert_(minimum.reduce(x) == 0)
+        assert_(maximum.reduce(x) == 4)
+
+    def test_testTakeTransposeInnerOuter(self):
+        # Test of take, transpose, inner, outer products
+        x = arange(24)
+        y = np.arange(24)
+        x[5:6] = masked
+        x = x.reshape(2, 3, 4)
+        y = y.reshape(2, 3, 4)
+        assert_(eq(np.transpose(y, (2, 0, 1)), transpose(x, (2, 0, 1))))
+        assert_(eq(np.take(y, (2, 0, 1), 1), take(x, (2, 0, 1), 1)))
+        assert_(eq(np.inner(filled(x, 0), filled(y, 0)),
+                   inner(x, y)))
+        assert_(eq(np.outer(filled(x, 0), filled(y, 0)),
+                   outer(x, y)))
+        y = array(['abc', 1, 'def', 2, 3], object)
+        y[2] = masked
+        t = take(y, [0, 3, 4])
+        assert_(t[0] == 'abc')
+        assert_(t[1] == 2)
+        assert_(t[2] == 3)
+
+    def test_testInplace(self):
+        # Test of inplace operations and rich comparisons
+        y = arange(10)
+
+        x = arange(10)
+        xm = arange(10)
+        xm[2] = masked
+        x += 1
+        assert_(eq(x, y + 1))
+        xm += 1
+        assert_(eq(x, y + 1))
+
+        x = arange(10)
+        xm = arange(10)
+        xm[2] = masked
+        x -= 1
+        assert_(eq(x, y - 1))
+        xm -= 1
+        assert_(eq(xm, y - 1))
+
+        x = arange(10) * 1.0
+        xm = arange(10) * 1.0
+        xm[2] = masked
+        x *= 2.0
+        assert_(eq(x, y * 2))
+        xm *= 2.0
+        assert_(eq(xm, y * 2))
+
+        x = arange(10) * 2
+        xm = arange(10)
+        xm[2] = masked
+        x //= 2
+        assert_(eq(x, y))
+        xm //= 2
+        assert_(eq(x, y))
+
+        x = arange(10) * 1.0
+        xm = arange(10) * 1.0
+        xm[2] = masked
+        x /= 2.0
+        assert_(eq(x, y / 2.0))
+        xm /= arange(10)
+        assert_(eq(xm, ones((10,))))
+
+        x = arange(10).astype(np.float32)
+        xm = arange(10)
+        xm[2] = masked
+        x += 1.
+        assert_(eq(x, y + 1.))
+
+    def test_testPickle(self):
+        # Test of pickling
+        x = arange(12)
+        x[4:10:2] = masked
+        x = x.reshape(4, 3)
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            s = pickle.dumps(x, protocol=proto)
+            y = pickle.loads(s)
+            assert_(eq(x, y))
+
+    def test_testMasked(self):
+        # Test of masked element
+        xx = arange(6)
+        xx[1] = masked
+        assert_(str(masked) == '--')
+        assert_(xx[1] is masked)
+        assert_equal(filled(xx[1], 0), 0)
+
+    def test_testAverage1(self):
+        # Test of average.
+        ott = array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        assert_(eq(2.0, average(ott, axis=0)))
+        assert_(eq(2.0, average(ott, weights=[1., 1., 2., 1.])))
+        result, wts = average(ott, weights=[1., 1., 2., 1.], returned=True)
+        assert_(eq(2.0, result))
+        assert_(wts == 4.0)
+        ott[:] = masked
+        assert_(average(ott, axis=0) is masked)
+        ott = array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        ott = ott.reshape(2, 2)
+        ott[:, 1] = masked
+        assert_(eq(average(ott, axis=0), [2.0, 0.0]))
+        assert_(average(ott, axis=1)[0] is masked)
+        assert_(eq([2., 0.], average(ott, axis=0)))
+        result, wts = average(ott, axis=0, returned=True)
+        assert_(eq(wts, [1., 0.]))
+
+    def test_testAverage2(self):
+        # More tests of average.
+        w1 = [0, 1, 1, 1, 1, 0]
+        w2 = [[0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 0, 1]]
+        x = arange(6)
+        assert_(allclose(average(x, axis=0), 2.5))
+        assert_(allclose(average(x, axis=0, weights=w1), 2.5))
+        y = array([arange(6), 2.0 * arange(6)])
+        assert_(allclose(average(y, None),
+                                 np.add.reduce(np.arange(6)) * 3. / 12.))
+        assert_(allclose(average(y, axis=0), np.arange(6) * 3. / 2.))
+        assert_(allclose(average(y, axis=1),
+                                 [average(x, axis=0), average(x, axis=0)*2.0]))
+        assert_(allclose(average(y, None, weights=w2), 20. / 6.))
+        assert_(allclose(average(y, axis=0, weights=w2),
+                                 [0., 1., 2., 3., 4., 10.]))
+        assert_(allclose(average(y, axis=1),
+                                 [average(x, axis=0), average(x, axis=0)*2.0]))
+        m1 = zeros(6)
+        m2 = [0, 0, 1, 1, 0, 0]
+        m3 = [[0, 0, 1, 1, 0, 0], [0, 1, 1, 1, 1, 0]]
+        m4 = ones(6)
+        m5 = [0, 1, 1, 1, 1, 1]
+        assert_(allclose(average(masked_array(x, m1), axis=0), 2.5))
+        assert_(allclose(average(masked_array(x, m2), axis=0), 2.5))
+        assert_(average(masked_array(x, m4), axis=0) is masked)
+        assert_equal(average(masked_array(x, m5), axis=0), 0.0)
+        assert_equal(count(average(masked_array(x, m4), axis=0)), 0)
+        z = masked_array(y, m3)
+        assert_(allclose(average(z, None), 20. / 6.))
+        assert_(allclose(average(z, axis=0),
+                                 [0., 1., 99., 99., 4.0, 7.5]))
+        assert_(allclose(average(z, axis=1), [2.5, 5.0]))
+        assert_(allclose(average(z, axis=0, weights=w2),
+                                 [0., 1., 99., 99., 4.0, 10.0]))
+
+        a = arange(6)
+        b = arange(6) * 3
+        r1, w1 = average([[a, b], [b, a]], axis=1, returned=True)
+        assert_equal(shape(r1), shape(w1))
+        assert_equal(r1.shape, w1.shape)
+        r2, w2 = average(ones((2, 2, 3)), axis=0, weights=[3, 1], returned=True)
+        assert_equal(shape(w2), shape(r2))
+        r2, w2 = average(ones((2, 2, 3)), returned=True)
+        assert_equal(shape(w2), shape(r2))
+        r2, w2 = average(ones((2, 2, 3)), weights=ones((2, 2, 3)), returned=True)
+        assert_(shape(w2) == shape(r2))
+        a2d = array([[1, 2], [0, 4]], float)
+        a2dm = masked_array(a2d, [[0, 0], [1, 0]])
+        a2da = average(a2d, axis=0)
+        assert_(eq(a2da, [0.5, 3.0]))
+        a2dma = average(a2dm, axis=0)
+        assert_(eq(a2dma, [1.0, 3.0]))
+        a2dma = average(a2dm, axis=None)
+        assert_(eq(a2dma, 7. / 3.))
+        a2dma = average(a2dm, axis=1)
+        assert_(eq(a2dma, [1.5, 4.0]))
+
+    def test_testToPython(self):
+        assert_equal(1, int(array(1)))
+        assert_equal(1.0, float(array(1)))
+        assert_equal(1, int(array([[[1]]])))
+        assert_equal(1.0, float(array([[1]])))
+        assert_raises(TypeError, float, array([1, 1]))
+        assert_raises(ValueError, bool, array([0, 1]))
+        assert_raises(ValueError, bool, array([0, 0], mask=[0, 1]))
+
+    def test_testScalarArithmetic(self):
+        xm = array(0, mask=1)
+        #TODO FIXME: Find out what the following raises a warning in r8247
+        with np.errstate(divide='ignore'):
+            assert_((1 / array(0)).mask)
+        assert_((1 + xm).mask)
+        assert_((-xm).mask)
+        assert_((-xm).mask)
+        assert_(maximum(xm, xm).mask)
+        assert_(minimum(xm, xm).mask)
+        assert_(xm.filled().dtype is xm._data.dtype)
+        x = array(0, mask=0)
+        assert_(x.filled() == x._data)
+        assert_equal(str(xm), str(masked_print_option))
+
+    def test_testArrayMethods(self):
+        a = array([1, 3, 2])
+        assert_(eq(a.any(), a._data.any()))
+        assert_(eq(a.all(), a._data.all()))
+        assert_(eq(a.argmax(), a._data.argmax()))
+        assert_(eq(a.argmin(), a._data.argmin()))
+        assert_(eq(a.choose(0, 1, 2, 3, 4),
+                           a._data.choose(0, 1, 2, 3, 4)))
+        assert_(eq(a.compress([1, 0, 1]), a._data.compress([1, 0, 1])))
+        assert_(eq(a.conj(), a._data.conj()))
+        assert_(eq(a.conjugate(), a._data.conjugate()))
+        m = array([[1, 2], [3, 4]])
+        assert_(eq(m.diagonal(), m._data.diagonal()))
+        assert_(eq(a.sum(), a._data.sum()))
+        assert_(eq(a.take([1, 2]), a._data.take([1, 2])))
+        assert_(eq(m.transpose(), m._data.transpose()))
+
+    def test_testArrayAttributes(self):
+        a = array([1, 3, 2])
+        assert_equal(a.ndim, 1)
+
+    def test_testAPI(self):
+        assert_(not [m for m in dir(np.ndarray)
+                     if m not in dir(MaskedArray) and
+                     not m.startswith('_')])
+
+    def test_testSingleElementSubscript(self):
+        a = array([1, 3, 2])
+        b = array([1, 3, 2], mask=[1, 0, 1])
+        assert_equal(a[0].shape, ())
+        assert_equal(b[0].shape, ())
+        assert_equal(b[1].shape, ())
+
+
+class TestUfuncs:
+    def setup(self):
+        self.d = (array([1.0, 0, -1, pi / 2] * 2, mask=[0, 1] + [0] * 6),
+                  array([1.0, 0, -1, pi / 2] * 2, mask=[1, 0] + [0] * 6),)
+
+    def test_testUfuncRegression(self):
+        f_invalid_ignore = [
+            'sqrt', 'arctanh', 'arcsin', 'arccos',
+            'arccosh', 'arctanh', 'log', 'log10', 'divide',
+            'true_divide', 'floor_divide', 'remainder', 'fmod']
+        for f in ['sqrt', 'log', 'log10', 'exp', 'conjugate',
+                  'sin', 'cos', 'tan',
+                  'arcsin', 'arccos', 'arctan',
+                  'sinh', 'cosh', 'tanh',
+                  'arcsinh',
+                  'arccosh',
+                  'arctanh',
+                  'absolute', 'fabs', 'negative',
+                  'floor', 'ceil',
+                  'logical_not',
+                  'add', 'subtract', 'multiply',
+                  'divide', 'true_divide', 'floor_divide',
+                  'remainder', 'fmod', 'hypot', 'arctan2',
+                  'equal', 'not_equal', 'less_equal', 'greater_equal',
+                  'less', 'greater',
+                  'logical_and', 'logical_or', 'logical_xor']:
+            try:
+                uf = getattr(umath, f)
+            except AttributeError:
+                uf = getattr(fromnumeric, f)
+            mf = getattr(np.ma, f)
+            args = self.d[:uf.nin]
+            with np.errstate():
+                if f in f_invalid_ignore:
+                    np.seterr(invalid='ignore')
+                if f in ['arctanh', 'log', 'log10']:
+                    np.seterr(divide='ignore')
+                ur = uf(*args)
+                mr = mf(*args)
+            assert_(eq(ur.filled(0), mr.filled(0), f))
+            assert_(eqmask(ur.mask, mr.mask))
+
+    def test_reduce(self):
+        a = self.d[0]
+        assert_(not alltrue(a, axis=0))
+        assert_(sometrue(a, axis=0))
+        assert_equal(sum(a[:3], axis=0), 0)
+        assert_equal(product(a, axis=0), 0)
+
+    def test_minmax(self):
+        a = arange(1, 13).reshape(3, 4)
+        amask = masked_where(a < 5, a)
+        assert_equal(amask.max(), a.max())
+        assert_equal(amask.min(), 5)
+        assert_((amask.max(0) == a.max(0)).all())
+        assert_((amask.min(0) == [5, 6, 7, 8]).all())
+        assert_(amask.max(1)[0].mask)
+        assert_(amask.min(1)[0].mask)
+
+    def test_nonzero(self):
+        for t in "?bhilqpBHILQPfdgFDGO":
+            x = array([1, 0, 2, 0], mask=[0, 0, 1, 1])
+            assert_(eq(nonzero(x), [0]))
+
+
+class TestArrayMethods:
+
+    def setup(self):
+        x = np.array([8.375, 7.545, 8.828, 8.5, 1.757, 5.928,
+                      8.43, 7.78, 9.865, 5.878, 8.979, 4.732,
+                      3.012, 6.022, 5.095, 3.116, 5.238, 3.957,
+                      6.04, 9.63, 7.712, 3.382, 4.489, 6.479,
+                      7.189, 9.645, 5.395, 4.961, 9.894, 2.893,
+                      7.357, 9.828, 6.272, 3.758, 6.693, 0.993])
+        X = x.reshape(6, 6)
+        XX = x.reshape(3, 2, 2, 3)
+
+        m = np.array([0, 1, 0, 1, 0, 0,
+                      1, 0, 1, 1, 0, 1,
+                      0, 0, 0, 1, 0, 1,
+                      0, 0, 0, 1, 1, 1,
+                      1, 0, 0, 1, 0, 0,
+                      0, 0, 1, 0, 1, 0])
+        mx = array(data=x, mask=m)
+        mX = array(data=X, mask=m.reshape(X.shape))
+        mXX = array(data=XX, mask=m.reshape(XX.shape))
+
+        self.d = (x, X, XX, m, mx, mX, mXX)
+
+    def test_trace(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        mXdiag = mX.diagonal()
+        assert_equal(mX.trace(), mX.diagonal().compressed().sum())
+        assert_(eq(mX.trace(),
+                           X.trace() - sum(mXdiag.mask * X.diagonal(),
+                                           axis=0)))
+
+    def test_clip(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        clipped = mx.clip(2, 8)
+        assert_(eq(clipped.mask, mx.mask))
+        assert_(eq(clipped._data, x.clip(2, 8)))
+        assert_(eq(clipped._data, mx._data.clip(2, 8)))
+
+    def test_ptp(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        (n, m) = X.shape
+        assert_equal(mx.ptp(), mx.compressed().ptp())
+        rows = np.zeros(n, np.float_)
+        cols = np.zeros(m, np.float_)
+        for k in range(m):
+            cols[k] = mX[:, k].compressed().ptp()
+        for k in range(n):
+            rows[k] = mX[k].compressed().ptp()
+        assert_(eq(mX.ptp(0), cols))
+        assert_(eq(mX.ptp(1), rows))
+
+    def test_swapaxes(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        mXswapped = mX.swapaxes(0, 1)
+        assert_(eq(mXswapped[-1], mX[:, -1]))
+        mXXswapped = mXX.swapaxes(0, 2)
+        assert_equal(mXXswapped.shape, (2, 2, 3, 3))
+
+    def test_cumprod(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        mXcp = mX.cumprod(0)
+        assert_(eq(mXcp._data, mX.filled(1).cumprod(0)))
+        mXcp = mX.cumprod(1)
+        assert_(eq(mXcp._data, mX.filled(1).cumprod(1)))
+
+    def test_cumsum(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        mXcp = mX.cumsum(0)
+        assert_(eq(mXcp._data, mX.filled(0).cumsum(0)))
+        mXcp = mX.cumsum(1)
+        assert_(eq(mXcp._data, mX.filled(0).cumsum(1)))
+
+    def test_varstd(self):
+        (x, X, XX, m, mx, mX, mXX,) = self.d
+        assert_(eq(mX.var(axis=None), mX.compressed().var()))
+        assert_(eq(mX.std(axis=None), mX.compressed().std()))
+        assert_(eq(mXX.var(axis=3).shape, XX.var(axis=3).shape))
+        assert_(eq(mX.var().shape, X.var().shape))
+        (mXvar0, mXvar1) = (mX.var(axis=0), mX.var(axis=1))
+        for k in range(6):
+            assert_(eq(mXvar1[k], mX[k].compressed().var()))
+            assert_(eq(mXvar0[k], mX[:, k].compressed().var()))
+            assert_(eq(np.sqrt(mXvar0[k]),
+                               mX[:, k].compressed().std()))
+
+
+def eqmask(m1, m2):
+    if m1 is nomask:
+        return m2 is nomask
+    if m2 is nomask:
+        return m1 is nomask
+    return (m1 == m2).all()
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_regression.py b/venv/Lib/site-packages/numpy/ma/tests/test_regression.py
new file mode 100644
index 000000000..7e76eb054
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_regression.py
@@ -0,0 +1,91 @@
+import numpy as np
+from numpy.testing import (
+    assert_, assert_array_equal, assert_allclose, suppress_warnings
+    )
+
+
+class TestRegression:
+    def test_masked_array_create(self):
+        # Ticket #17
+        x = np.ma.masked_array([0, 1, 2, 3, 0, 4, 5, 6],
+                               mask=[0, 0, 0, 1, 1, 1, 0, 0])
+        assert_array_equal(np.ma.nonzero(x), [[1, 2, 6, 7]])
+
+    def test_masked_array(self):
+        # Ticket #61
+        np.ma.array(1, mask=[1])
+
+    def test_mem_masked_where(self):
+        # Ticket #62
+        from numpy.ma import masked_where, MaskType
+        a = np.zeros((1, 1))
+        b = np.zeros(a.shape, MaskType)
+        c = masked_where(b, a)
+        a-c
+
+    def test_masked_array_multiply(self):
+        # Ticket #254
+        a = np.ma.zeros((4, 1))
+        a[2, 0] = np.ma.masked
+        b = np.zeros((4, 2))
+        a*b
+        b*a
+
+    def test_masked_array_repeat(self):
+        # Ticket #271
+        np.ma.array([1], mask=False).repeat(10)
+
+    def test_masked_array_repr_unicode(self):
+        # Ticket #1256
+        repr(np.ma.array(u"Unicode"))
+
+    def test_atleast_2d(self):
+        # Ticket #1559
+        a = np.ma.masked_array([0.0, 1.2, 3.5], mask=[False, True, False])
+        b = np.atleast_2d(a)
+        assert_(a.mask.ndim == 1)
+        assert_(b.mask.ndim == 2)
+
+    def test_set_fill_value_unicode_py3(self):
+        # Ticket #2733
+        a = np.ma.masked_array(['a', 'b', 'c'], mask=[1, 0, 0])
+        a.fill_value = 'X'
+        assert_(a.fill_value == 'X')
+
+    def test_var_sets_maskedarray_scalar(self):
+        # Issue gh-2757
+        a = np.ma.array(np.arange(5), mask=True)
+        mout = np.ma.array(-1, dtype=float)
+        a.var(out=mout)
+        assert_(mout._data == 0)
+
+    def test_ddof_corrcoef(self):
+        # See gh-3336
+        x = np.ma.masked_equal([1, 2, 3, 4, 5], 4)
+        y = np.array([2, 2.5, 3.1, 3, 5])
+        # this test can be removed after deprecation.
+        with suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "bias and ddof have no effect")
+            r0 = np.ma.corrcoef(x, y, ddof=0)
+            r1 = np.ma.corrcoef(x, y, ddof=1)
+            # ddof should not have an effect (it gets cancelled out)
+            assert_allclose(r0.data, r1.data)
+
+    def test_mask_not_backmangled(self):
+        # See gh-10314.  Test case taken from gh-3140.
+        a = np.ma.MaskedArray([1., 2.], mask=[False, False])
+        assert_(a.mask.shape == (2,))
+        b = np.tile(a, (2, 1))
+        # Check that the above no longer changes a.shape to (1, 2)
+        assert_(a.mask.shape == (2,))
+        assert_(b.shape == (2, 2))
+        assert_(b.mask.shape == (2, 2))
+
+    def test_empty_list_on_structured(self):
+        # See gh-12464. Indexing with empty list should give empty result.
+        ma = np.ma.MaskedArray([(1, 1.), (2, 2.), (3, 3.)], dtype='i4,f4')
+        assert_array_equal(ma[[]], ma[:0])
+
+    def test_masked_array_tobytes_fortran(self):
+        ma = np.ma.arange(4).reshape((2,2))
+        assert_array_equal(ma.tobytes(order='F'), ma.T.tobytes())
diff --git a/venv/Lib/site-packages/numpy/ma/tests/test_subclassing.py b/venv/Lib/site-packages/numpy/ma/tests/test_subclassing.py
new file mode 100644
index 000000000..caa746740
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/tests/test_subclassing.py
@@ -0,0 +1,347 @@
+# pylint: disable-msg=W0611, W0612, W0511,R0201
+"""Tests suite for MaskedArray & subclassing.
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+:version: $Id: test_subclassing.py 3473 2007-10-29 15:18:13Z jarrod.millman $
+
+"""
+import numpy as np
+from numpy.testing import assert_, assert_raises
+from numpy.ma.testutils import assert_equal
+from numpy.ma.core import (
+    array, arange, masked, MaskedArray, masked_array, log, add, hypot,
+    divide, asarray, asanyarray, nomask
+    )
+# from numpy.ma.core import (
+
+def assert_startswith(a, b):
+    # produces a better error message than assert_(a.startswith(b))
+    assert_equal(a[:len(b)], b)
+
+class SubArray(np.ndarray):
+    # Defines a generic np.ndarray subclass, that stores some metadata
+    # in the  dictionary `info`.
+    def __new__(cls,arr,info={}):
+        x = np.asanyarray(arr).view(cls)
+        x.info = info.copy()
+        return x
+
+    def __array_finalize__(self, obj):
+        if callable(getattr(super(SubArray, self),
+                            '__array_finalize__', None)):
+            super(SubArray, self).__array_finalize__(obj)
+        self.info = getattr(obj, 'info', {}).copy()
+        return
+
+    def __add__(self, other):
+        result = super(SubArray, self).__add__(other)
+        result.info['added'] = result.info.get('added', 0) + 1
+        return result
+
+    def __iadd__(self, other):
+        result = super(SubArray, self).__iadd__(other)
+        result.info['iadded'] = result.info.get('iadded', 0) + 1
+        return result
+
+
+subarray = SubArray
+
+
+class SubMaskedArray(MaskedArray):
+    """Pure subclass of MaskedArray, keeping some info on subclass."""
+    def __new__(cls, info=None, **kwargs):
+        obj = super(SubMaskedArray, cls).__new__(cls, **kwargs)
+        obj._optinfo['info'] = info
+        return obj
+
+
+class MSubArray(SubArray, MaskedArray):
+
+    def __new__(cls, data, info={}, mask=nomask):
+        subarr = SubArray(data, info)
+        _data = MaskedArray.__new__(cls, data=subarr, mask=mask)
+        _data.info = subarr.info
+        return _data
+
+    @property
+    def _series(self):
+        _view = self.view(MaskedArray)
+        _view._sharedmask = False
+        return _view
+
+msubarray = MSubArray
+
+
+# Also a subclass that overrides __str__, __repr__ and __setitem__, disallowing
+# setting to non-class values (and thus np.ma.core.masked_print_option)
+# and overrides __array_wrap__, updating the info dict, to check that this
+# doesn't get destroyed by MaskedArray._update_from.  But this one also needs
+# its own iterator...
+class CSAIterator:
+    """
+    Flat iterator object that uses its own setter/getter
+    (works around ndarray.flat not propagating subclass setters/getters
+    see https://github.com/numpy/numpy/issues/4564)
+    roughly following MaskedIterator
+    """
+    def __init__(self, a):
+        self._original = a
+        self._dataiter = a.view(np.ndarray).flat
+
+    def __iter__(self):
+        return self
+
+    def __getitem__(self, indx):
+        out = self._dataiter.__getitem__(indx)
+        if not isinstance(out, np.ndarray):
+            out = out.__array__()
+        out = out.view(type(self._original))
+        return out
+
+    def __setitem__(self, index, value):
+        self._dataiter[index] = self._original._validate_input(value)
+
+    def __next__(self):
+        return next(self._dataiter).__array__().view(type(self._original))
+
+
+class ComplicatedSubArray(SubArray):
+
+    def __str__(self):
+        return 'myprefix {0} mypostfix'.format(self.view(SubArray))
+
+    def __repr__(self):
+        # Return a repr that does not start with 'name('
+        return '<{0} {1}>'.format(self.__class__.__name__, self)
+
+    def _validate_input(self, value):
+        if not isinstance(value, ComplicatedSubArray):
+            raise ValueError("Can only set to MySubArray values")
+        return value
+
+    def __setitem__(self, item, value):
+        # validation ensures direct assignment with ndarray or
+        # masked_print_option will fail
+        super(ComplicatedSubArray, self).__setitem__(
+            item, self._validate_input(value))
+
+    def __getitem__(self, item):
+        # ensure getter returns our own class also for scalars
+        value = super(ComplicatedSubArray, self).__getitem__(item)
+        if not isinstance(value, np.ndarray):  # scalar
+            value = value.__array__().view(ComplicatedSubArray)
+        return value
+
+    @property
+    def flat(self):
+        return CSAIterator(self)
+
+    @flat.setter
+    def flat(self, value):
+        y = self.ravel()
+        y[:] = value
+
+    def __array_wrap__(self, obj, context=None):
+        obj = super(ComplicatedSubArray, self).__array_wrap__(obj, context)
+        if context is not None and context[0] is np.multiply:
+            obj.info['multiplied'] = obj.info.get('multiplied', 0) + 1
+
+        return obj
+
+
+class TestSubclassing:
+    # Test suite for masked subclasses of ndarray.
+
+    def setup(self):
+        x = np.arange(5, dtype='float')
+        mx = msubarray(x, mask=[0, 1, 0, 0, 0])
+        self.data = (x, mx)
+
+    def test_data_subclassing(self):
+        # Tests whether the subclass is kept.
+        x = np.arange(5)
+        m = [0, 0, 1, 0, 0]
+        xsub = SubArray(x)
+        xmsub = masked_array(xsub, mask=m)
+        assert_(isinstance(xmsub, MaskedArray))
+        assert_equal(xmsub._data, xsub)
+        assert_(isinstance(xmsub._data, SubArray))
+
+    def test_maskedarray_subclassing(self):
+        # Tests subclassing MaskedArray
+        (x, mx) = self.data
+        assert_(isinstance(mx._data, subarray))
+
+    def test_masked_unary_operations(self):
+        # Tests masked_unary_operation
+        (x, mx) = self.data
+        with np.errstate(divide='ignore'):
+            assert_(isinstance(log(mx), msubarray))
+            assert_equal(log(x), np.log(x))
+
+    def test_masked_binary_operations(self):
+        # Tests masked_binary_operation
+        (x, mx) = self.data
+        # Result should be a msubarray
+        assert_(isinstance(add(mx, mx), msubarray))
+        assert_(isinstance(add(mx, x), msubarray))
+        # Result should work
+        assert_equal(add(mx, x), mx+x)
+        assert_(isinstance(add(mx, mx)._data, subarray))
+        assert_(isinstance(add.outer(mx, mx), msubarray))
+        assert_(isinstance(hypot(mx, mx), msubarray))
+        assert_(isinstance(hypot(mx, x), msubarray))
+
+    def test_masked_binary_operations2(self):
+        # Tests domained_masked_binary_operation
+        (x, mx) = self.data
+        xmx = masked_array(mx.data.__array__(), mask=mx.mask)
+        assert_(isinstance(divide(mx, mx), msubarray))
+        assert_(isinstance(divide(mx, x), msubarray))
+        assert_equal(divide(mx, mx), divide(xmx, xmx))
+
+    def test_attributepropagation(self):
+        x = array(arange(5), mask=[0]+[1]*4)
+        my = masked_array(subarray(x))
+        ym = msubarray(x)
+        #
+        z = (my+1)
+        assert_(isinstance(z, MaskedArray))
+        assert_(not isinstance(z, MSubArray))
+        assert_(isinstance(z._data, SubArray))
+        assert_equal(z._data.info, {})
+        #
+        z = (ym+1)
+        assert_(isinstance(z, MaskedArray))
+        assert_(isinstance(z, MSubArray))
+        assert_(isinstance(z._data, SubArray))
+        assert_(z._data.info['added'] > 0)
+        # Test that inplace methods from data get used (gh-4617)
+        ym += 1
+        assert_(isinstance(ym, MaskedArray))
+        assert_(isinstance(ym, MSubArray))
+        assert_(isinstance(ym._data, SubArray))
+        assert_(ym._data.info['iadded'] > 0)
+        #
+        ym._set_mask([1, 0, 0, 0, 1])
+        assert_equal(ym._mask, [1, 0, 0, 0, 1])
+        ym._series._set_mask([0, 0, 0, 0, 1])
+        assert_equal(ym._mask, [0, 0, 0, 0, 1])
+        #
+        xsub = subarray(x, info={'name':'x'})
+        mxsub = masked_array(xsub)
+        assert_(hasattr(mxsub, 'info'))
+        assert_equal(mxsub.info, xsub.info)
+
+    def test_subclasspreservation(self):
+        # Checks that masked_array(...,subok=True) preserves the class.
+        x = np.arange(5)
+        m = [0, 0, 1, 0, 0]
+        xinfo = [(i, j) for (i, j) in zip(x, m)]
+        xsub = MSubArray(x, mask=m, info={'xsub':xinfo})
+        #
+        mxsub = masked_array(xsub, subok=False)
+        assert_(not isinstance(mxsub, MSubArray))
+        assert_(isinstance(mxsub, MaskedArray))
+        assert_equal(mxsub._mask, m)
+        #
+        mxsub = asarray(xsub)
+        assert_(not isinstance(mxsub, MSubArray))
+        assert_(isinstance(mxsub, MaskedArray))
+        assert_equal(mxsub._mask, m)
+        #
+        mxsub = masked_array(xsub, subok=True)
+        assert_(isinstance(mxsub, MSubArray))
+        assert_equal(mxsub.info, xsub.info)
+        assert_equal(mxsub._mask, xsub._mask)
+        #
+        mxsub = asanyarray(xsub)
+        assert_(isinstance(mxsub, MSubArray))
+        assert_equal(mxsub.info, xsub.info)
+        assert_equal(mxsub._mask, m)
+
+    def test_subclass_items(self):
+        """test that getter and setter go via baseclass"""
+        x = np.arange(5)
+        xcsub = ComplicatedSubArray(x)
+        mxcsub = masked_array(xcsub, mask=[True, False, True, False, False])
+        # getter should  return a ComplicatedSubArray, even for single item
+        # first check we wrote ComplicatedSubArray correctly
+        assert_(isinstance(xcsub[1], ComplicatedSubArray))
+        assert_(isinstance(xcsub[1,...], ComplicatedSubArray))
+        assert_(isinstance(xcsub[1:4], ComplicatedSubArray))
+
+        # now that it propagates inside the MaskedArray
+        assert_(isinstance(mxcsub[1], ComplicatedSubArray))
+        assert_(isinstance(mxcsub[1,...].data, ComplicatedSubArray))
+        assert_(mxcsub[0] is masked)
+        assert_(isinstance(mxcsub[0,...].data, ComplicatedSubArray))
+        assert_(isinstance(mxcsub[1:4].data, ComplicatedSubArray))
+
+        # also for flattened version (which goes via MaskedIterator)
+        assert_(isinstance(mxcsub.flat[1].data, ComplicatedSubArray))
+        assert_(mxcsub.flat[0] is masked)
+        assert_(isinstance(mxcsub.flat[1:4].base, ComplicatedSubArray))
+
+        # setter should only work with ComplicatedSubArray input
+        # first check we wrote ComplicatedSubArray correctly
+        assert_raises(ValueError, xcsub.__setitem__, 1, x[4])
+        # now that it propagates inside the MaskedArray
+        assert_raises(ValueError, mxcsub.__setitem__, 1, x[4])
+        assert_raises(ValueError, mxcsub.__setitem__, slice(1, 4), x[1:4])
+        mxcsub[1] = xcsub[4]
+        mxcsub[1:4] = xcsub[1:4]
+        # also for flattened version (which goes via MaskedIterator)
+        assert_raises(ValueError, mxcsub.flat.__setitem__, 1, x[4])
+        assert_raises(ValueError, mxcsub.flat.__setitem__, slice(1, 4), x[1:4])
+        mxcsub.flat[1] = xcsub[4]
+        mxcsub.flat[1:4] = xcsub[1:4]
+
+    def test_subclass_nomask_items(self):
+        x = np.arange(5)
+        xcsub = ComplicatedSubArray(x)
+        mxcsub_nomask = masked_array(xcsub)
+
+        assert_(isinstance(mxcsub_nomask[1,...].data, ComplicatedSubArray))
+        assert_(isinstance(mxcsub_nomask[0,...].data, ComplicatedSubArray))
+
+        assert_(isinstance(mxcsub_nomask[1], ComplicatedSubArray))
+        assert_(isinstance(mxcsub_nomask[0], ComplicatedSubArray))
+
+    def test_subclass_repr(self):
+        """test that repr uses the name of the subclass
+        and 'array' for np.ndarray"""
+        x = np.arange(5)
+        mx = masked_array(x, mask=[True, False, True, False, False])
+        assert_startswith(repr(mx), 'masked_array')
+        xsub = SubArray(x)
+        mxsub = masked_array(xsub, mask=[True, False, True, False, False])
+        assert_startswith(repr(mxsub),
+            'masked_{0}(data=[--, 1, --, 3, 4]'.format(SubArray.__name__))
+
+    def test_subclass_str(self):
+        """test str with subclass that has overridden str, setitem"""
+        # first without override
+        x = np.arange(5)
+        xsub = SubArray(x)
+        mxsub = masked_array(xsub, mask=[True, False, True, False, False])
+        assert_equal(str(mxsub), '[-- 1 -- 3 4]')
+
+        xcsub = ComplicatedSubArray(x)
+        assert_raises(ValueError, xcsub.__setitem__, 0,
+                      np.ma.core.masked_print_option)
+        mxcsub = masked_array(xcsub, mask=[True, False, True, False, False])
+        assert_equal(str(mxcsub), 'myprefix [-- 1 -- 3 4] mypostfix')
+
+    def test_pure_subclass_info_preservation(self):
+        # Test that ufuncs and methods conserve extra information consistently;
+        # see gh-7122.
+        arr1 = SubMaskedArray('test', data=[1,2,3,4,5,6])
+        arr2 = SubMaskedArray(data=[0,1,2,3,4,5])
+        diff1 = np.subtract(arr1, arr2)
+        assert_('info' in diff1._optinfo)
+        assert_(diff1._optinfo['info'] == 'test')
+        diff2 = arr1 - arr2
+        assert_('info' in diff2._optinfo)
+        assert_(diff2._optinfo['info'] == 'test')
diff --git a/venv/Lib/site-packages/numpy/ma/testutils.py b/venv/Lib/site-packages/numpy/ma/testutils.py
new file mode 100644
index 000000000..51ab03948
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/testutils.py
@@ -0,0 +1,288 @@
+"""Miscellaneous functions for testing masked arrays and subclasses
+
+:author: Pierre Gerard-Marchant
+:contact: pierregm_at_uga_dot_edu
+:version: $Id: testutils.py 3529 2007-11-13 08:01:14Z jarrod.millman $
+
+"""
+import operator
+
+import numpy as np
+from numpy import ndarray, float_
+import numpy.core.umath as umath
+import numpy.testing
+from numpy.testing import (
+    assert_, assert_allclose, assert_array_almost_equal_nulp,
+    assert_raises, build_err_msg
+    )
+from .core import mask_or, getmask, masked_array, nomask, masked, filled
+
+__all__masked = [
+    'almost', 'approx', 'assert_almost_equal', 'assert_array_almost_equal',
+    'assert_array_approx_equal', 'assert_array_compare',
+    'assert_array_equal', 'assert_array_less', 'assert_close',
+    'assert_equal', 'assert_equal_records', 'assert_mask_equal',
+    'assert_not_equal', 'fail_if_array_equal',
+    ]
+
+# Include some normal test functions to avoid breaking other projects who
+# have mistakenly included them from this file. SciPy is one. That is
+# unfortunate, as some of these functions are not intended to work with
+# masked arrays. But there was no way to tell before.
+from unittest import TestCase
+__some__from_testing = [
+    'TestCase', 'assert_', 'assert_allclose', 'assert_array_almost_equal_nulp',
+    'assert_raises'
+    ]
+
+__all__ = __all__masked + __some__from_testing
+
+
+def approx(a, b, fill_value=True, rtol=1e-5, atol=1e-8):
+    """
+    Returns true if all components of a and b are equal to given tolerances.
+
+    If fill_value is True, masked values considered equal. Otherwise,
+    masked values are considered unequal.  The relative error rtol should
+    be positive and << 1.0 The absolute error atol comes into play for
+    those elements of b that are very small or zero; it says how small a
+    must be also.
+
+    """
+    m = mask_or(getmask(a), getmask(b))
+    d1 = filled(a)
+    d2 = filled(b)
+    if d1.dtype.char == "O" or d2.dtype.char == "O":
+        return np.equal(d1, d2).ravel()
+    x = filled(masked_array(d1, copy=False, mask=m), fill_value).astype(float_)
+    y = filled(masked_array(d2, copy=False, mask=m), 1).astype(float_)
+    d = np.less_equal(umath.absolute(x - y), atol + rtol * umath.absolute(y))
+    return d.ravel()
+
+
+def almost(a, b, decimal=6, fill_value=True):
+    """
+    Returns True if a and b are equal up to decimal places.
+
+    If fill_value is True, masked values considered equal. Otherwise,
+    masked values are considered unequal.
+
+    """
+    m = mask_or(getmask(a), getmask(b))
+    d1 = filled(a)
+    d2 = filled(b)
+    if d1.dtype.char == "O" or d2.dtype.char == "O":
+        return np.equal(d1, d2).ravel()
+    x = filled(masked_array(d1, copy=False, mask=m), fill_value).astype(float_)
+    y = filled(masked_array(d2, copy=False, mask=m), 1).astype(float_)
+    d = np.around(np.abs(x - y), decimal) <= 10.0 ** (-decimal)
+    return d.ravel()
+
+
+def _assert_equal_on_sequences(actual, desired, err_msg=''):
+    """
+    Asserts the equality of two non-array sequences.
+
+    """
+    assert_equal(len(actual), len(desired), err_msg)
+    for k in range(len(desired)):
+        assert_equal(actual[k], desired[k], 'item=%r\n%s' % (k, err_msg))
+    return
+
+
+def assert_equal_records(a, b):
+    """
+    Asserts that two records are equal.
+
+    Pretty crude for now.
+
+    """
+    assert_equal(a.dtype, b.dtype)
+    for f in a.dtype.names:
+        (af, bf) = (operator.getitem(a, f), operator.getitem(b, f))
+        if not (af is masked) and not (bf is masked):
+            assert_equal(operator.getitem(a, f), operator.getitem(b, f))
+    return
+
+
+def assert_equal(actual, desired, err_msg=''):
+    """
+    Asserts that two items are equal.
+
+    """
+    # Case #1: dictionary .....
+    if isinstance(desired, dict):
+        if not isinstance(actual, dict):
+            raise AssertionError(repr(type(actual)))
+        assert_equal(len(actual), len(desired), err_msg)
+        for k, i in desired.items():
+            if k not in actual:
+                raise AssertionError("%s not in %s" % (k, actual))
+            assert_equal(actual[k], desired[k], 'key=%r\n%s' % (k, err_msg))
+        return
+    # Case #2: lists .....
+    if isinstance(desired, (list, tuple)) and isinstance(actual, (list, tuple)):
+        return _assert_equal_on_sequences(actual, desired, err_msg='')
+    if not (isinstance(actual, ndarray) or isinstance(desired, ndarray)):
+        msg = build_err_msg([actual, desired], err_msg,)
+        if not desired == actual:
+            raise AssertionError(msg)
+        return
+    # Case #4. arrays or equivalent
+    if ((actual is masked) and not (desired is masked)) or \
+            ((desired is masked) and not (actual is masked)):
+        msg = build_err_msg([actual, desired],
+                            err_msg, header='', names=('x', 'y'))
+        raise ValueError(msg)
+    actual = np.array(actual, copy=False, subok=True)
+    desired = np.array(desired, copy=False, subok=True)
+    (actual_dtype, desired_dtype) = (actual.dtype, desired.dtype)
+    if actual_dtype.char == "S" and desired_dtype.char == "S":
+        return _assert_equal_on_sequences(actual.tolist(),
+                                          desired.tolist(),
+                                          err_msg='')
+    return assert_array_equal(actual, desired, err_msg)
+
+
+def fail_if_equal(actual, desired, err_msg='',):
+    """
+    Raises an assertion error if two items are equal.
+
+    """
+    if isinstance(desired, dict):
+        if not isinstance(actual, dict):
+            raise AssertionError(repr(type(actual)))
+        fail_if_equal(len(actual), len(desired), err_msg)
+        for k, i in desired.items():
+            if k not in actual:
+                raise AssertionError(repr(k))
+            fail_if_equal(actual[k], desired[k], 'key=%r\n%s' % (k, err_msg))
+        return
+    if isinstance(desired, (list, tuple)) and isinstance(actual, (list, tuple)):
+        fail_if_equal(len(actual), len(desired), err_msg)
+        for k in range(len(desired)):
+            fail_if_equal(actual[k], desired[k], 'item=%r\n%s' % (k, err_msg))
+        return
+    if isinstance(actual, np.ndarray) or isinstance(desired, np.ndarray):
+        return fail_if_array_equal(actual, desired, err_msg)
+    msg = build_err_msg([actual, desired], err_msg)
+    if not desired != actual:
+        raise AssertionError(msg)
+
+
+assert_not_equal = fail_if_equal
+
+
+def assert_almost_equal(actual, desired, decimal=7, err_msg='', verbose=True):
+    """
+    Asserts that two items are almost equal.
+
+    The test is equivalent to abs(desired-actual) < 0.5 * 10**(-decimal).
+
+    """
+    if isinstance(actual, np.ndarray) or isinstance(desired, np.ndarray):
+        return assert_array_almost_equal(actual, desired, decimal=decimal,
+                                         err_msg=err_msg, verbose=verbose)
+    msg = build_err_msg([actual, desired],
+                        err_msg=err_msg, verbose=verbose)
+    if not round(abs(desired - actual), decimal) == 0:
+        raise AssertionError(msg)
+
+
+assert_close = assert_almost_equal
+
+
+def assert_array_compare(comparison, x, y, err_msg='', verbose=True, header='',
+                         fill_value=True):
+    """
+    Asserts that comparison between two masked arrays is satisfied.
+
+    The comparison is elementwise.
+
+    """
+    # Allocate a common mask and refill
+    m = mask_or(getmask(x), getmask(y))
+    x = masked_array(x, copy=False, mask=m, keep_mask=False, subok=False)
+    y = masked_array(y, copy=False, mask=m, keep_mask=False, subok=False)
+    if ((x is masked) and not (y is masked)) or \
+            ((y is masked) and not (x is masked)):
+        msg = build_err_msg([x, y], err_msg=err_msg, verbose=verbose,
+                            header=header, names=('x', 'y'))
+        raise ValueError(msg)
+    # OK, now run the basic tests on filled versions
+    return np.testing.assert_array_compare(comparison,
+                                           x.filled(fill_value),
+                                           y.filled(fill_value),
+                                           err_msg=err_msg,
+                                           verbose=verbose, header=header)
+
+
+def assert_array_equal(x, y, err_msg='', verbose=True):
+    """
+    Checks the elementwise equality of two masked arrays.
+
+    """
+    assert_array_compare(operator.__eq__, x, y,
+                         err_msg=err_msg, verbose=verbose,
+                         header='Arrays are not equal')
+
+
+def fail_if_array_equal(x, y, err_msg='', verbose=True):
+    """
+    Raises an assertion error if two masked arrays are not equal elementwise.
+
+    """
+    def compare(x, y):
+        return (not np.alltrue(approx(x, y)))
+    assert_array_compare(compare, x, y, err_msg=err_msg, verbose=verbose,
+                         header='Arrays are not equal')
+
+
+def assert_array_approx_equal(x, y, decimal=6, err_msg='', verbose=True):
+    """
+    Checks the equality of two masked arrays, up to given number odecimals.
+
+    The equality is checked elementwise.
+
+    """
+    def compare(x, y):
+        "Returns the result of the loose comparison between x and y)."
+        return approx(x, y, rtol=10. ** -decimal)
+    assert_array_compare(compare, x, y, err_msg=err_msg, verbose=verbose,
+                         header='Arrays are not almost equal')
+
+
+def assert_array_almost_equal(x, y, decimal=6, err_msg='', verbose=True):
+    """
+    Checks the equality of two masked arrays, up to given number odecimals.
+
+    The equality is checked elementwise.
+
+    """
+    def compare(x, y):
+        "Returns the result of the loose comparison between x and y)."
+        return almost(x, y, decimal)
+    assert_array_compare(compare, x, y, err_msg=err_msg, verbose=verbose,
+                         header='Arrays are not almost equal')
+
+
+def assert_array_less(x, y, err_msg='', verbose=True):
+    """
+    Checks that x is smaller than y elementwise.
+
+    """
+    assert_array_compare(operator.__lt__, x, y,
+                         err_msg=err_msg, verbose=verbose,
+                         header='Arrays are not less-ordered')
+
+
+def assert_mask_equal(m1, m2, err_msg=''):
+    """
+    Asserts the equality of two masks.
+
+    """
+    if m1 is nomask:
+        assert_(m2 is nomask)
+    if m2 is nomask:
+        assert_(m1 is nomask)
+    assert_array_equal(m1, m2, err_msg=err_msg)
diff --git a/venv/Lib/site-packages/numpy/ma/timer_comparison.py b/venv/Lib/site-packages/numpy/ma/timer_comparison.py
new file mode 100644
index 000000000..83bd7852e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/ma/timer_comparison.py
@@ -0,0 +1,437 @@
+import timeit
+from functools import reduce
+
+import numpy as np
+from numpy import float_
+import numpy.core.fromnumeric as fromnumeric
+
+from numpy.testing import build_err_msg
+
+# Fixme: this does not look right.
+np.seterr(all='ignore')
+
+pi = np.pi
+
+
+class ModuleTester:
+    def __init__(self, module):
+        self.module = module
+        self.allequal = module.allequal
+        self.arange = module.arange
+        self.array = module.array
+        self.concatenate = module.concatenate
+        self.count = module.count
+        self.equal = module.equal
+        self.filled = module.filled
+        self.getmask = module.getmask
+        self.getmaskarray = module.getmaskarray
+        self.id = id
+        self.inner = module.inner
+        self.make_mask = module.make_mask
+        self.masked = module.masked
+        self.masked_array = module.masked_array
+        self.masked_values = module.masked_values
+        self.mask_or = module.mask_or
+        self.nomask = module.nomask
+        self.ones = module.ones
+        self.outer = module.outer
+        self.repeat = module.repeat
+        self.resize = module.resize
+        self.sort = module.sort
+        self.take = module.take
+        self.transpose = module.transpose
+        self.zeros = module.zeros
+        self.MaskType = module.MaskType
+        try:
+            self.umath = module.umath
+        except AttributeError:
+            self.umath = module.core.umath
+        self.testnames = []
+
+    def assert_array_compare(self, comparison, x, y, err_msg='', header='',
+                         fill_value=True):
+        """
+        Assert that a comparison of two masked arrays is satisfied elementwise.
+
+        """
+        xf = self.filled(x)
+        yf = self.filled(y)
+        m = self.mask_or(self.getmask(x), self.getmask(y))
+
+        x = self.filled(self.masked_array(xf, mask=m), fill_value)
+        y = self.filled(self.masked_array(yf, mask=m), fill_value)
+        if (x.dtype.char != "O"):
+            x = x.astype(float_)
+            if isinstance(x, np.ndarray) and x.size > 1:
+                x[np.isnan(x)] = 0
+            elif np.isnan(x):
+                x = 0
+        if (y.dtype.char != "O"):
+            y = y.astype(float_)
+            if isinstance(y, np.ndarray) and y.size > 1:
+                y[np.isnan(y)] = 0
+            elif np.isnan(y):
+                y = 0
+        try:
+            cond = (x.shape == () or y.shape == ()) or x.shape == y.shape
+            if not cond:
+                msg = build_err_msg([x, y],
+                                    err_msg
+                                    + '\n(shapes %s, %s mismatch)' % (x.shape,
+                                                                      y.shape),
+                                    header=header,
+                                    names=('x', 'y'))
+                assert cond, msg
+            val = comparison(x, y)
+            if m is not self.nomask and fill_value:
+                val = self.masked_array(val, mask=m)
+            if isinstance(val, bool):
+                cond = val
+                reduced = [0]
+            else:
+                reduced = val.ravel()
+                cond = reduced.all()
+                reduced = reduced.tolist()
+            if not cond:
+                match = 100-100.0*reduced.count(1)/len(reduced)
+                msg = build_err_msg([x, y],
+                                    err_msg
+                                    + '\n(mismatch %s%%)' % (match,),
+                                    header=header,
+                                    names=('x', 'y'))
+                assert cond, msg
+        except ValueError:
+            msg = build_err_msg([x, y], err_msg, header=header, names=('x', 'y'))
+            raise ValueError(msg)
+
+    def assert_array_equal(self, x, y, err_msg=''):
+        """
+        Checks the elementwise equality of two masked arrays.
+
+        """
+        self.assert_array_compare(self.equal, x, y, err_msg=err_msg,
+                                  header='Arrays are not equal')
+
+    def test_0(self):
+        """
+        Tests creation
+
+        """
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        m = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        xm = self.masked_array(x, mask=m)
+        xm[0]
+
+    def test_1(self):
+        """
+        Tests creation
+
+        """
+        x = np.array([1., 1., 1., -2., pi/2.0, 4., 5., -10., 10., 1., 2., 3.])
+        y = np.array([5., 0., 3., 2., -1., -4., 0., -10., 10., 1., 0., 3.])
+        m1 = [1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
+        m2 = [0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 0, 1]
+        xm = self.masked_array(x, mask=m1)
+        ym = self.masked_array(y, mask=m2)
+        xf = np.where(m1, 1.e+20, x)
+        xm.set_fill_value(1.e+20)
+
+        assert((xm-ym).filled(0).any())
+        s = x.shape
+        assert(xm.size == reduce(lambda x, y:x*y, s))
+        assert(self.count(xm) == len(m1) - reduce(lambda x, y:x+y, m1))
+
+        for s in [(4, 3), (6, 2)]:
+            x.shape = s
+            y.shape = s
+            xm.shape = s
+            ym.shape = s
+            xf.shape = s
+            assert(self.count(xm) == len(m1) - reduce(lambda x, y:x+y, m1))
+
+    def test_2(self):
+        """
+        Tests conversions and indexing.
+
+        """
+        x1 = np.array([1, 2, 4, 3])
+        x2 = self.array(x1, mask=[1, 0, 0, 0])
+        x3 = self.array(x1, mask=[0, 1, 0, 1])
+        x4 = self.array(x1)
+        # test conversion to strings, no errors
+        str(x2)
+        repr(x2)
+        # tests of indexing
+        assert type(x2[1]) is type(x1[1])
+        assert x1[1] == x2[1]
+        x1[2] = 9
+        x2[2] = 9
+        self.assert_array_equal(x1, x2)
+        x1[1:3] = 99
+        x2[1:3] = 99
+        x2[1] = self.masked
+        x2[1:3] = self.masked
+        x2[:] = x1
+        x2[1] = self.masked
+        x3[:] = self.masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        x4[:] = self.masked_array([1, 2, 3, 4], [0, 1, 1, 0])
+        x1 = np.arange(5)*1.0
+        x2 = self.masked_values(x1, 3.0)
+        x1 = self.array([1, 'hello', 2, 3], object)
+        x2 = np.array([1, 'hello', 2, 3], object)
+        # check that no error occurs.
+        x1[1]
+        x2[1]
+        assert x1[1:1].shape == (0,)
+        # Tests copy-size
+        n = [0, 0, 1, 0, 0]
+        m = self.make_mask(n)
+        m2 = self.make_mask(m)
+        assert(m is m2)
+        m3 = self.make_mask(m, copy=1)
+        assert(m is not m3)
+
+    def test_3(self):
+        """
+        Tests resize/repeat
+
+        """
+        x4 = self.arange(4)
+        x4[2] = self.masked
+        y4 = self.resize(x4, (8,))
+        assert self.allequal(self.concatenate([x4, x4]), y4)
+        assert self.allequal(self.getmask(y4), [0, 0, 1, 0, 0, 0, 1, 0])
+        y5 = self.repeat(x4, (2, 2, 2, 2), axis=0)
+        self.assert_array_equal(y5, [0, 0, 1, 1, 2, 2, 3, 3])
+        y6 = self.repeat(x4, 2, axis=0)
+        assert self.allequal(y5, y6)
+        y7 = x4.repeat((2, 2, 2, 2), axis=0)
+        assert self.allequal(y5, y7)
+        y8 = x4.repeat(2, 0)
+        assert self.allequal(y5, y8)
+
+    def test_4(self):
+        """
+        Test of take, transpose, inner, outer products.
+
+        """
+        x = self.arange(24)
+        y = np.arange(24)
+        x[5:6] = self.masked
+        x = x.reshape(2, 3, 4)
+        y = y.reshape(2, 3, 4)
+        assert self.allequal(np.transpose(y, (2, 0, 1)), self.transpose(x, (2, 0, 1)))
+        assert self.allequal(np.take(y, (2, 0, 1), 1), self.take(x, (2, 0, 1), 1))
+        assert self.allequal(np.inner(self.filled(x, 0), self.filled(y, 0)),
+                            self.inner(x, y))
+        assert self.allequal(np.outer(self.filled(x, 0), self.filled(y, 0)),
+                            self.outer(x, y))
+        y = self.array(['abc', 1, 'def', 2, 3], object)
+        y[2] = self.masked
+        t = self.take(y, [0, 3, 4])
+        assert t[0] == 'abc'
+        assert t[1] == 2
+        assert t[2] == 3
+
+    def test_5(self):
+        """
+        Tests inplace w/ scalar
+
+        """
+        x = self.arange(10)
+        y = self.arange(10)
+        xm = self.arange(10)
+        xm[2] = self.masked
+        x += 1
+        assert self.allequal(x, y+1)
+        xm += 1
+        assert self.allequal(xm, y+1)
+
+        x = self.arange(10)
+        xm = self.arange(10)
+        xm[2] = self.masked
+        x -= 1
+        assert self.allequal(x, y-1)
+        xm -= 1
+        assert self.allequal(xm, y-1)
+
+        x = self.arange(10)*1.0
+        xm = self.arange(10)*1.0
+        xm[2] = self.masked
+        x *= 2.0
+        assert self.allequal(x, y*2)
+        xm *= 2.0
+        assert self.allequal(xm, y*2)
+
+        x = self.arange(10)*2
+        xm = self.arange(10)*2
+        xm[2] = self.masked
+        x /= 2
+        assert self.allequal(x, y)
+        xm /= 2
+        assert self.allequal(xm, y)
+
+        x = self.arange(10)*1.0
+        xm = self.arange(10)*1.0
+        xm[2] = self.masked
+        x /= 2.0
+        assert self.allequal(x, y/2.0)
+        xm /= self.arange(10)
+        self.assert_array_equal(xm, self.ones((10,)))
+
+        x = self.arange(10).astype(float_)
+        xm = self.arange(10)
+        xm[2] = self.masked
+        x += 1.
+        assert self.allequal(x, y + 1.)
+
+    def test_6(self):
+        """
+        Tests inplace w/ array
+
+        """
+        x = self.arange(10, dtype=float_)
+        y = self.arange(10)
+        xm = self.arange(10, dtype=float_)
+        xm[2] = self.masked
+        m = xm.mask
+        a = self.arange(10, dtype=float_)
+        a[-1] = self.masked
+        x += a
+        xm += a
+        assert self.allequal(x, y+a)
+        assert self.allequal(xm, y+a)
+        assert self.allequal(xm.mask, self.mask_or(m, a.mask))
+
+        x = self.arange(10, dtype=float_)
+        xm = self.arange(10, dtype=float_)
+        xm[2] = self.masked
+        m = xm.mask
+        a = self.arange(10, dtype=float_)
+        a[-1] = self.masked
+        x -= a
+        xm -= a
+        assert self.allequal(x, y-a)
+        assert self.allequal(xm, y-a)
+        assert self.allequal(xm.mask, self.mask_or(m, a.mask))
+
+        x = self.arange(10, dtype=float_)
+        xm = self.arange(10, dtype=float_)
+        xm[2] = self.masked
+        m = xm.mask
+        a = self.arange(10, dtype=float_)
+        a[-1] = self.masked
+        x *= a
+        xm *= a
+        assert self.allequal(x, y*a)
+        assert self.allequal(xm, y*a)
+        assert self.allequal(xm.mask, self.mask_or(m, a.mask))
+
+        x = self.arange(10, dtype=float_)
+        xm = self.arange(10, dtype=float_)
+        xm[2] = self.masked
+        m = xm.mask
+        a = self.arange(10, dtype=float_)
+        a[-1] = self.masked
+        x /= a
+        xm /= a
+
+    def test_7(self):
+        "Tests ufunc"
+        d = (self.array([1.0, 0, -1, pi/2]*2, mask=[0, 1]+[0]*6),
+             self.array([1.0, 0, -1, pi/2]*2, mask=[1, 0]+[0]*6),)
+        for f in ['sqrt', 'log', 'log10', 'exp', 'conjugate',
+#                  'sin', 'cos', 'tan',
+#                  'arcsin', 'arccos', 'arctan',
+#                  'sinh', 'cosh', 'tanh',
+#                  'arcsinh',
+#                  'arccosh',
+#                  'arctanh',
+#                  'absolute', 'fabs', 'negative',
+#                  # 'nonzero', 'around',
+#                  'floor', 'ceil',
+#                  # 'sometrue', 'alltrue',
+#                  'logical_not',
+#                  'add', 'subtract', 'multiply',
+#                  'divide', 'true_divide', 'floor_divide',
+#                  'remainder', 'fmod', 'hypot', 'arctan2',
+#                  'equal', 'not_equal', 'less_equal', 'greater_equal',
+#                  'less', 'greater',
+#                  'logical_and', 'logical_or', 'logical_xor',
+                  ]:
+            try:
+                uf = getattr(self.umath, f)
+            except AttributeError:
+                uf = getattr(fromnumeric, f)
+            mf = getattr(self.module, f)
+            args = d[:uf.nin]
+            ur = uf(*args)
+            mr = mf(*args)
+            self.assert_array_equal(ur.filled(0), mr.filled(0), f)
+            self.assert_array_equal(ur._mask, mr._mask)
+
+    def test_99(self):
+        # test average
+        ott = self.array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        self.assert_array_equal(2.0, self.average(ott, axis=0))
+        self.assert_array_equal(2.0, self.average(ott, weights=[1., 1., 2., 1.]))
+        result, wts = self.average(ott, weights=[1., 1., 2., 1.], returned=1)
+        self.assert_array_equal(2.0, result)
+        assert(wts == 4.0)
+        ott[:] = self.masked
+        assert(self.average(ott, axis=0) is self.masked)
+        ott = self.array([0., 1., 2., 3.], mask=[1, 0, 0, 0])
+        ott = ott.reshape(2, 2)
+        ott[:, 1] = self.masked
+        self.assert_array_equal(self.average(ott, axis=0), [2.0, 0.0])
+        assert(self.average(ott, axis=1)[0] is self.masked)
+        self.assert_array_equal([2., 0.], self.average(ott, axis=0))
+        result, wts = self.average(ott, axis=0, returned=1)
+        self.assert_array_equal(wts, [1., 0.])
+        w1 = [0, 1, 1, 1, 1, 0]
+        w2 = [[0, 1, 1, 1, 1, 0], [1, 0, 0, 0, 0, 1]]
+        x = self.arange(6)
+        self.assert_array_equal(self.average(x, axis=0), 2.5)
+        self.assert_array_equal(self.average(x, axis=0, weights=w1), 2.5)
+        y = self.array([self.arange(6), 2.0*self.arange(6)])
+        self.assert_array_equal(self.average(y, None), np.add.reduce(np.arange(6))*3./12.)
+        self.assert_array_equal(self.average(y, axis=0), np.arange(6) * 3./2.)
+        self.assert_array_equal(self.average(y, axis=1), [self.average(x, axis=0), self.average(x, axis=0) * 2.0])
+        self.assert_array_equal(self.average(y, None, weights=w2), 20./6.)
+        self.assert_array_equal(self.average(y, axis=0, weights=w2), [0., 1., 2., 3., 4., 10.])
+        self.assert_array_equal(self.average(y, axis=1), [self.average(x, axis=0), self.average(x, axis=0) * 2.0])
+        m1 = self.zeros(6)
+        m2 = [0, 0, 1, 1, 0, 0]
+        m3 = [[0, 0, 1, 1, 0, 0], [0, 1, 1, 1, 1, 0]]
+        m4 = self.ones(6)
+        m5 = [0, 1, 1, 1, 1, 1]
+        self.assert_array_equal(self.average(self.masked_array(x, m1), axis=0), 2.5)
+        self.assert_array_equal(self.average(self.masked_array(x, m2), axis=0), 2.5)
+        self.assert_array_equal(self.average(self.masked_array(x, m5), axis=0), 0.0)
+        self.assert_array_equal(self.count(self.average(self.masked_array(x, m4), axis=0)), 0)
+        z = self.masked_array(y, m3)
+        self.assert_array_equal(self.average(z, None), 20./6.)
+        self.assert_array_equal(self.average(z, axis=0), [0., 1., 99., 99., 4.0, 7.5])
+        self.assert_array_equal(self.average(z, axis=1), [2.5, 5.0])
+        self.assert_array_equal(self.average(z, axis=0, weights=w2), [0., 1., 99., 99., 4.0, 10.0])
+
+    def test_A(self):
+        x = self.arange(24)
+        x[5:6] = self.masked
+        x = x.reshape(2, 3, 4)
+
+
+if __name__ == '__main__':
+    setup_base = ("from __main__ import ModuleTester \n"
+                  "import numpy\n"
+                  "tester = ModuleTester(module)\n")
+    setup_cur = "import numpy.ma.core as module\n" + setup_base
+    (nrepeat, nloop) = (10, 10)
+
+    for i in range(1, 8):
+        func = 'tester.test_%i()' % i
+        cur = timeit.Timer(func, setup_cur).repeat(nrepeat, nloop*10)
+        cur = np.sort(cur)
+        print("#%i" % i + 50*'.')
+        print(eval("ModuleTester.test_%i.__doc__" % i))
+        print("core_current : %.3f - %.3f" % (cur[0], cur[1]))
diff --git a/venv/Lib/site-packages/numpy/matlib.py b/venv/Lib/site-packages/numpy/matlib.py
new file mode 100644
index 000000000..bd6b63289
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matlib.py
@@ -0,0 +1,376 @@
+import warnings
+
+# 2018-05-29, PendingDeprecationWarning added to matrix.__new__
+# 2020-01-23, numpy 1.19.0 PendingDeprecatonWarning
+warnings.warn("Importing from numpy.matlib is deprecated since 1.19.0. "
+              "The matrix subclass is not the recommended way to represent "
+              "matrices or deal with linear algebra (see "
+              "https://docs.scipy.org/doc/numpy/user/numpy-for-matlab-users.html). "
+              "Please adjust your code to use regular ndarray. ",
+              PendingDeprecationWarning, stacklevel=2)
+
+import numpy as np
+from numpy.matrixlib.defmatrix import matrix, asmatrix
+# Matlib.py contains all functions in the numpy namespace with a few
+# replacements. See doc/source/reference/routines.matlib.rst for details.
+# Need * as we're copying the numpy namespace.
+from numpy import *  # noqa: F403
+
+__version__ = np.__version__
+
+__all__ = np.__all__[:] # copy numpy namespace
+__all__ += ['rand', 'randn', 'repmat']
+
+def empty(shape, dtype=None, order='C'):
+    """Return a new matrix of given shape and type, without initializing entries.
+
+    Parameters
+    ----------
+    shape : int or tuple of int
+        Shape of the empty matrix.
+    dtype : data-type, optional
+        Desired output data-type.
+    order : {'C', 'F'}, optional
+        Whether to store multi-dimensional data in row-major
+        (C-style) or column-major (Fortran-style) order in
+        memory.
+
+    See Also
+    --------
+    empty_like, zeros
+
+    Notes
+    -----
+    `empty`, unlike `zeros`, does not set the matrix values to zero,
+    and may therefore be marginally faster.  On the other hand, it requires
+    the user to manually set all the values in the array, and should be
+    used with caution.
+
+    Examples
+    --------
+    >>> import numpy.matlib
+    >>> np.matlib.empty((2, 2))    # filled with random data
+    matrix([[  6.76425276e-320,   9.79033856e-307], # random
+            [  7.39337286e-309,   3.22135945e-309]])
+    >>> np.matlib.empty((2, 2), dtype=int)
+    matrix([[ 6600475,        0], # random
+            [ 6586976, 22740995]])
+
+    """
+    return ndarray.__new__(matrix, shape, dtype, order=order)
+
+def ones(shape, dtype=None, order='C'):
+    """
+    Matrix of ones.
+
+    Return a matrix of given shape and type, filled with ones.
+
+    Parameters
+    ----------
+    shape : {sequence of ints, int}
+        Shape of the matrix
+    dtype : data-type, optional
+        The desired data-type for the matrix, default is np.float64.
+    order : {'C', 'F'}, optional
+        Whether to store matrix in C- or Fortran-contiguous order,
+        default is 'C'.
+
+    Returns
+    -------
+    out : matrix
+        Matrix of ones of given shape, dtype, and order.
+
+    See Also
+    --------
+    ones : Array of ones.
+    matlib.zeros : Zero matrix.
+
+    Notes
+    -----
+    If `shape` has length one i.e. ``(N,)``, or is a scalar ``N``,
+    `out` becomes a single row matrix of shape ``(1,N)``.
+
+    Examples
+    --------
+    >>> np.matlib.ones((2,3))
+    matrix([[1.,  1.,  1.],
+            [1.,  1.,  1.]])
+
+    >>> np.matlib.ones(2)
+    matrix([[1.,  1.]])
+
+    """
+    a = ndarray.__new__(matrix, shape, dtype, order=order)
+    a.fill(1)
+    return a
+
+def zeros(shape, dtype=None, order='C'):
+    """
+    Return a matrix of given shape and type, filled with zeros.
+
+    Parameters
+    ----------
+    shape : int or sequence of ints
+        Shape of the matrix
+    dtype : data-type, optional
+        The desired data-type for the matrix, default is float.
+    order : {'C', 'F'}, optional
+        Whether to store the result in C- or Fortran-contiguous order,
+        default is 'C'.
+
+    Returns
+    -------
+    out : matrix
+        Zero matrix of given shape, dtype, and order.
+
+    See Also
+    --------
+    numpy.zeros : Equivalent array function.
+    matlib.ones : Return a matrix of ones.
+
+    Notes
+    -----
+    If `shape` has length one i.e. ``(N,)``, or is a scalar ``N``,
+    `out` becomes a single row matrix of shape ``(1,N)``.
+
+    Examples
+    --------
+    >>> import numpy.matlib
+    >>> np.matlib.zeros((2, 3))
+    matrix([[0.,  0.,  0.],
+            [0.,  0.,  0.]])
+
+    >>> np.matlib.zeros(2)
+    matrix([[0.,  0.]])
+
+    """
+    a = ndarray.__new__(matrix, shape, dtype, order=order)
+    a.fill(0)
+    return a
+
+def identity(n,dtype=None):
+    """
+    Returns the square identity matrix of given size.
+
+    Parameters
+    ----------
+    n : int
+        Size of the returned identity matrix.
+    dtype : data-type, optional
+        Data-type of the output. Defaults to ``float``.
+
+    Returns
+    -------
+    out : matrix
+        `n` x `n` matrix with its main diagonal set to one,
+        and all other elements zero.
+
+    See Also
+    --------
+    numpy.identity : Equivalent array function.
+    matlib.eye : More general matrix identity function.
+
+    Examples
+    --------
+    >>> import numpy.matlib
+    >>> np.matlib.identity(3, dtype=int)
+    matrix([[1, 0, 0],
+            [0, 1, 0],
+            [0, 0, 1]])
+
+    """
+    a = array([1]+n*[0], dtype=dtype)
+    b = empty((n, n), dtype=dtype)
+    b.flat = a
+    return b
+
+def eye(n,M=None, k=0, dtype=float, order='C'):
+    """
+    Return a matrix with ones on the diagonal and zeros elsewhere.
+
+    Parameters
+    ----------
+    n : int
+        Number of rows in the output.
+    M : int, optional
+        Number of columns in the output, defaults to `n`.
+    k : int, optional
+        Index of the diagonal: 0 refers to the main diagonal,
+        a positive value refers to an upper diagonal,
+        and a negative value to a lower diagonal.
+    dtype : dtype, optional
+        Data-type of the returned matrix.
+    order : {'C', 'F'}, optional
+        Whether the output should be stored in row-major (C-style) or
+        column-major (Fortran-style) order in memory.
+
+        .. versionadded:: 1.14.0
+
+    Returns
+    -------
+    I : matrix
+        A `n` x `M` matrix where all elements are equal to zero,
+        except for the `k`-th diagonal, whose values are equal to one.
+
+    See Also
+    --------
+    numpy.eye : Equivalent array function.
+    identity : Square identity matrix.
+
+    Examples
+    --------
+    >>> import numpy.matlib
+    >>> np.matlib.eye(3, k=1, dtype=float)
+    matrix([[0.,  1.,  0.],
+            [0.,  0.,  1.],
+            [0.,  0.,  0.]])
+
+    """
+    return asmatrix(np.eye(n, M=M, k=k, dtype=dtype, order=order))
+
+def rand(*args):
+    """
+    Return a matrix of random values with given shape.
+
+    Create a matrix of the given shape and propagate it with
+    random samples from a uniform distribution over ``[0, 1)``.
+
+    Parameters
+    ----------
+    \\*args : Arguments
+        Shape of the output.
+        If given as N integers, each integer specifies the size of one
+        dimension.
+        If given as a tuple, this tuple gives the complete shape.
+
+    Returns
+    -------
+    out : ndarray
+        The matrix of random values with shape given by `\\*args`.
+
+    See Also
+    --------
+    randn, numpy.random.RandomState.rand
+
+    Examples
+    --------
+    >>> np.random.seed(123)
+    >>> import numpy.matlib
+    >>> np.matlib.rand(2, 3)
+    matrix([[0.69646919, 0.28613933, 0.22685145],
+            [0.55131477, 0.71946897, 0.42310646]])
+    >>> np.matlib.rand((2, 3))
+    matrix([[0.9807642 , 0.68482974, 0.4809319 ],
+            [0.39211752, 0.34317802, 0.72904971]])
+
+    If the first argument is a tuple, other arguments are ignored:
+
+    >>> np.matlib.rand((2, 3), 4)
+    matrix([[0.43857224, 0.0596779 , 0.39804426],
+            [0.73799541, 0.18249173, 0.17545176]])
+
+    """
+    if isinstance(args[0], tuple):
+        args = args[0]
+    return asmatrix(np.random.rand(*args))
+
+def randn(*args):
+    """
+    Return a random matrix with data from the "standard normal" distribution.
+
+    `randn` generates a matrix filled with random floats sampled from a
+    univariate "normal" (Gaussian) distribution of mean 0 and variance 1.
+
+    Parameters
+    ----------
+    \\*args : Arguments
+        Shape of the output.
+        If given as N integers, each integer specifies the size of one
+        dimension. If given as a tuple, this tuple gives the complete shape.
+
+    Returns
+    -------
+    Z : matrix of floats
+        A matrix of floating-point samples drawn from the standard normal
+        distribution.
+
+    See Also
+    --------
+    rand, numpy.random.RandomState.randn
+
+    Notes
+    -----
+    For random samples from :math:`N(\\mu, \\sigma^2)`, use:
+
+    ``sigma * np.matlib.randn(...) + mu``
+
+    Examples
+    --------
+    >>> np.random.seed(123)
+    >>> import numpy.matlib
+    >>> np.matlib.randn(1)
+    matrix([[-1.0856306]])
+    >>> np.matlib.randn(1, 2, 3)
+    matrix([[ 0.99734545,  0.2829785 , -1.50629471],
+            [-0.57860025,  1.65143654, -2.42667924]])
+
+    Two-by-four matrix of samples from :math:`N(3, 6.25)`:
+
+    >>> 2.5 * np.matlib.randn((2, 4)) + 3
+    matrix([[1.92771843, 6.16484065, 0.83314899, 1.30278462],
+            [2.76322758, 6.72847407, 1.40274501, 1.8900451 ]])
+
+    """
+    if isinstance(args[0], tuple):
+        args = args[0]
+    return asmatrix(np.random.randn(*args))
+
+def repmat(a, m, n):
+    """
+    Repeat a 0-D to 2-D array or matrix MxN times.
+
+    Parameters
+    ----------
+    a : array_like
+        The array or matrix to be repeated.
+    m, n : int
+        The number of times `a` is repeated along the first and second axes.
+
+    Returns
+    -------
+    out : ndarray
+        The result of repeating `a`.
+
+    Examples
+    --------
+    >>> import numpy.matlib
+    >>> a0 = np.array(1)
+    >>> np.matlib.repmat(a0, 2, 3)
+    array([[1, 1, 1],
+           [1, 1, 1]])
+
+    >>> a1 = np.arange(4)
+    >>> np.matlib.repmat(a1, 2, 2)
+    array([[0, 1, 2, 3, 0, 1, 2, 3],
+           [0, 1, 2, 3, 0, 1, 2, 3]])
+
+    >>> a2 = np.asmatrix(np.arange(6).reshape(2, 3))
+    >>> np.matlib.repmat(a2, 2, 3)
+    matrix([[0, 1, 2, 0, 1, 2, 0, 1, 2],
+            [3, 4, 5, 3, 4, 5, 3, 4, 5],
+            [0, 1, 2, 0, 1, 2, 0, 1, 2],
+            [3, 4, 5, 3, 4, 5, 3, 4, 5]])
+
+    """
+    a = asanyarray(a)
+    ndim = a.ndim
+    if ndim == 0:
+        origrows, origcols = (1, 1)
+    elif ndim == 1:
+        origrows, origcols = (1, a.shape[0])
+    else:
+        origrows, origcols = a.shape
+    rows = origrows * m
+    cols = origcols * n
+    c = a.reshape(1, a.size).repeat(m, 0).reshape(rows, origcols).repeat(n, 0)
+    return c.reshape(rows, cols)
diff --git a/venv/Lib/site-packages/numpy/matrixlib/__init__.py b/venv/Lib/site-packages/numpy/matrixlib/__init__.py
new file mode 100644
index 000000000..54154d11f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/__init__.py
@@ -0,0 +1,10 @@
+"""Sub-package containing the matrix class and related functions.
+
+"""
+from .defmatrix import *
+
+__all__ = defmatrix.__all__
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/matrixlib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..2482ac5eb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/__pycache__/defmatrix.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/defmatrix.cpython-36.pyc
new file mode 100644
index 000000000..8fcc9d466
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/defmatrix.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..492f03a74
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/defmatrix.py b/venv/Lib/site-packages/numpy/matrixlib/defmatrix.py
new file mode 100644
index 000000000..a13ff23f4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/defmatrix.py
@@ -0,0 +1,1113 @@
+__all__ = ['matrix', 'bmat', 'mat', 'asmatrix']
+
+import sys
+import warnings
+import ast
+import numpy.core.numeric as N
+from numpy.core.numeric import concatenate, isscalar
+from numpy.core.overrides import set_module
+# While not in __all__, matrix_power used to be defined here, so we import
+# it for backward compatibility.
+from numpy.linalg import matrix_power
+
+
+def _convert_from_string(data):
+    for char in '[]':
+        data = data.replace(char, '')
+
+    rows = data.split(';')
+    newdata = []
+    count = 0
+    for row in rows:
+        trow = row.split(',')
+        newrow = []
+        for col in trow:
+            temp = col.split()
+            newrow.extend(map(ast.literal_eval, temp))
+        if count == 0:
+            Ncols = len(newrow)
+        elif len(newrow) != Ncols:
+            raise ValueError("Rows not the same size.")
+        count += 1
+        newdata.append(newrow)
+    return newdata
+
+
+@set_module('numpy')
+def asmatrix(data, dtype=None):
+    """
+    Interpret the input as a matrix.
+
+    Unlike `matrix`, `asmatrix` does not make a copy if the input is already
+    a matrix or an ndarray.  Equivalent to ``matrix(data, copy=False)``.
+
+    Parameters
+    ----------
+    data : array_like
+        Input data.
+    dtype : data-type
+       Data-type of the output matrix.
+
+    Returns
+    -------
+    mat : matrix
+        `data` interpreted as a matrix.
+
+    Examples
+    --------
+    >>> x = np.array([[1, 2], [3, 4]])
+
+    >>> m = np.asmatrix(x)
+
+    >>> x[0,0] = 5
+
+    >>> m
+    matrix([[5, 2],
+            [3, 4]])
+
+    """
+    return matrix(data, dtype=dtype, copy=False)
+
+
+@set_module('numpy')
+class matrix(N.ndarray):
+    """
+    matrix(data, dtype=None, copy=True)
+
+    .. note:: It is no longer recommended to use this class, even for linear
+              algebra. Instead use regular arrays. The class may be removed
+              in the future.
+
+    Returns a matrix from an array-like object, or from a string of data.
+    A matrix is a specialized 2-D array that retains its 2-D nature
+    through operations.  It has certain special operators, such as ``*``
+    (matrix multiplication) and ``**`` (matrix power).
+
+    Parameters
+    ----------
+    data : array_like or string
+       If `data` is a string, it is interpreted as a matrix with commas
+       or spaces separating columns, and semicolons separating rows.
+    dtype : data-type
+       Data-type of the output matrix.
+    copy : bool
+       If `data` is already an `ndarray`, then this flag determines
+       whether the data is copied (the default), or whether a view is
+       constructed.
+
+    See Also
+    --------
+    array
+
+    Examples
+    --------
+    >>> a = np.matrix('1 2; 3 4')
+    >>> a
+    matrix([[1, 2],
+            [3, 4]])
+
+    >>> np.matrix([[1, 2], [3, 4]])
+    matrix([[1, 2],
+            [3, 4]])
+
+    """
+    __array_priority__ = 10.0
+    def __new__(subtype, data, dtype=None, copy=True):
+        warnings.warn('the matrix subclass is not the recommended way to '
+                      'represent matrices or deal with linear algebra (see '
+                      'https://docs.scipy.org/doc/numpy/user/'
+                      'numpy-for-matlab-users.html). '
+                      'Please adjust your code to use regular ndarray.',
+                      PendingDeprecationWarning, stacklevel=2)
+        if isinstance(data, matrix):
+            dtype2 = data.dtype
+            if (dtype is None):
+                dtype = dtype2
+            if (dtype2 == dtype) and (not copy):
+                return data
+            return data.astype(dtype)
+
+        if isinstance(data, N.ndarray):
+            if dtype is None:
+                intype = data.dtype
+            else:
+                intype = N.dtype(dtype)
+            new = data.view(subtype)
+            if intype != data.dtype:
+                return new.astype(intype)
+            if copy: return new.copy()
+            else: return new
+
+        if isinstance(data, str):
+            data = _convert_from_string(data)
+
+        # now convert data to an array
+        arr = N.array(data, dtype=dtype, copy=copy)
+        ndim = arr.ndim
+        shape = arr.shape
+        if (ndim > 2):
+            raise ValueError("matrix must be 2-dimensional")
+        elif ndim == 0:
+            shape = (1, 1)
+        elif ndim == 1:
+            shape = (1, shape[0])
+
+        order = 'C'
+        if (ndim == 2) and arr.flags.fortran:
+            order = 'F'
+
+        if not (order or arr.flags.contiguous):
+            arr = arr.copy()
+
+        ret = N.ndarray.__new__(subtype, shape, arr.dtype,
+                                buffer=arr,
+                                order=order)
+        return ret
+
+    def __array_finalize__(self, obj):
+        self._getitem = False
+        if (isinstance(obj, matrix) and obj._getitem): return
+        ndim = self.ndim
+        if (ndim == 2):
+            return
+        if (ndim > 2):
+            newshape = tuple([x for x in self.shape if x > 1])
+            ndim = len(newshape)
+            if ndim == 2:
+                self.shape = newshape
+                return
+            elif (ndim > 2):
+                raise ValueError("shape too large to be a matrix.")
+        else:
+            newshape = self.shape
+        if ndim == 0:
+            self.shape = (1, 1)
+        elif ndim == 1:
+            self.shape = (1, newshape[0])
+        return
+
+    def __getitem__(self, index):
+        self._getitem = True
+
+        try:
+            out = N.ndarray.__getitem__(self, index)
+        finally:
+            self._getitem = False
+
+        if not isinstance(out, N.ndarray):
+            return out
+
+        if out.ndim == 0:
+            return out[()]
+        if out.ndim == 1:
+            sh = out.shape[0]
+            # Determine when we should have a column array
+            try:
+                n = len(index)
+            except Exception:
+                n = 0
+            if n > 1 and isscalar(index[1]):
+                out.shape = (sh, 1)
+            else:
+                out.shape = (1, sh)
+        return out
+
+    def __mul__(self, other):
+        if isinstance(other, (N.ndarray, list, tuple)) :
+            # This promotes 1-D vectors to row vectors
+            return N.dot(self, asmatrix(other))
+        if isscalar(other) or not hasattr(other, '__rmul__') :
+            return N.dot(self, other)
+        return NotImplemented
+
+    def __rmul__(self, other):
+        return N.dot(other, self)
+
+    def __imul__(self, other):
+        self[:] = self * other
+        return self
+
+    def __pow__(self, other):
+        return matrix_power(self, other)
+
+    def __ipow__(self, other):
+        self[:] = self ** other
+        return self
+
+    def __rpow__(self, other):
+        return NotImplemented
+
+    def _align(self, axis):
+        """A convenience function for operations that need to preserve axis
+        orientation.
+        """
+        if axis is None:
+            return self[0, 0]
+        elif axis==0:
+            return self
+        elif axis==1:
+            return self.transpose()
+        else:
+            raise ValueError("unsupported axis")
+
+    def _collapse(self, axis):
+        """A convenience function for operations that want to collapse
+        to a scalar like _align, but are using keepdims=True
+        """
+        if axis is None:
+            return self[0, 0]
+        else:
+            return self
+
+    # Necessary because base-class tolist expects dimension
+    #  reduction by x[0]
+    def tolist(self):
+        """
+        Return the matrix as a (possibly nested) list.
+
+        See `ndarray.tolist` for full documentation.
+
+        See Also
+        --------
+        ndarray.tolist
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.tolist()
+        [[0, 1, 2, 3], [4, 5, 6, 7], [8, 9, 10, 11]]
+
+        """
+        return self.__array__().tolist()
+
+    # To preserve orientation of result...
+    def sum(self, axis=None, dtype=None, out=None):
+        """
+        Returns the sum of the matrix elements, along the given axis.
+
+        Refer to `numpy.sum` for full documentation.
+
+        See Also
+        --------
+        numpy.sum
+
+        Notes
+        -----
+        This is the same as `ndarray.sum`, except that where an `ndarray` would
+        be returned, a `matrix` object is returned instead.
+
+        Examples
+        --------
+        >>> x = np.matrix([[1, 2], [4, 3]])
+        >>> x.sum()
+        10
+        >>> x.sum(axis=1)
+        matrix([[3],
+                [7]])
+        >>> x.sum(axis=1, dtype='float')
+        matrix([[3.],
+                [7.]])
+        >>> out = np.zeros((2, 1), dtype='float')
+        >>> x.sum(axis=1, dtype='float', out=np.asmatrix(out))
+        matrix([[3.],
+                [7.]])
+
+        """
+        return N.ndarray.sum(self, axis, dtype, out, keepdims=True)._collapse(axis)
+
+
+    # To update docstring from array to matrix...
+    def squeeze(self, axis=None):
+        """
+        Return a possibly reshaped matrix.
+
+        Refer to `numpy.squeeze` for more documentation.
+
+        Parameters
+        ----------
+        axis : None or int or tuple of ints, optional
+            Selects a subset of the single-dimensional entries in the shape.
+            If an axis is selected with shape entry greater than one,
+            an error is raised.
+
+        Returns
+        -------
+        squeezed : matrix
+            The matrix, but as a (1, N) matrix if it had shape (N, 1).
+
+        See Also
+        --------
+        numpy.squeeze : related function
+
+        Notes
+        -----
+        If `m` has a single column then that column is returned
+        as the single row of a matrix.  Otherwise `m` is returned.
+        The returned matrix is always either `m` itself or a view into `m`.
+        Supplying an axis keyword argument will not affect the returned matrix
+        but it may cause an error to be raised.
+
+        Examples
+        --------
+        >>> c = np.matrix([[1], [2]])
+        >>> c
+        matrix([[1],
+                [2]])
+        >>> c.squeeze()
+        matrix([[1, 2]])
+        >>> r = c.T
+        >>> r
+        matrix([[1, 2]])
+        >>> r.squeeze()
+        matrix([[1, 2]])
+        >>> m = np.matrix([[1, 2], [3, 4]])
+        >>> m.squeeze()
+        matrix([[1, 2],
+                [3, 4]])
+
+        """
+        return N.ndarray.squeeze(self, axis=axis)
+
+
+    # To update docstring from array to matrix...
+    def flatten(self, order='C'):
+        """
+        Return a flattened copy of the matrix.
+
+        All `N` elements of the matrix are placed into a single row.
+
+        Parameters
+        ----------
+        order : {'C', 'F', 'A', 'K'}, optional
+            'C' means to flatten in row-major (C-style) order. 'F' means to
+            flatten in column-major (Fortran-style) order. 'A' means to
+            flatten in column-major order if `m` is Fortran *contiguous* in
+            memory, row-major order otherwise. 'K' means to flatten `m` in
+            the order the elements occur in memory. The default is 'C'.
+
+        Returns
+        -------
+        y : matrix
+            A copy of the matrix, flattened to a `(1, N)` matrix where `N`
+            is the number of elements in the original matrix.
+
+        See Also
+        --------
+        ravel : Return a flattened array.
+        flat : A 1-D flat iterator over the matrix.
+
+        Examples
+        --------
+        >>> m = np.matrix([[1,2], [3,4]])
+        >>> m.flatten()
+        matrix([[1, 2, 3, 4]])
+        >>> m.flatten('F')
+        matrix([[1, 3, 2, 4]])
+
+        """
+        return N.ndarray.flatten(self, order=order)
+
+    def mean(self, axis=None, dtype=None, out=None):
+        """
+        Returns the average of the matrix elements along the given axis.
+
+        Refer to `numpy.mean` for full documentation.
+
+        See Also
+        --------
+        numpy.mean
+
+        Notes
+        -----
+        Same as `ndarray.mean` except that, where that returns an `ndarray`,
+        this returns a `matrix` object.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3, 4)))
+        >>> x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.mean()
+        5.5
+        >>> x.mean(0)
+        matrix([[4., 5., 6., 7.]])
+        >>> x.mean(1)
+        matrix([[ 1.5],
+                [ 5.5],
+                [ 9.5]])
+
+        """
+        return N.ndarray.mean(self, axis, dtype, out, keepdims=True)._collapse(axis)
+
+    def std(self, axis=None, dtype=None, out=None, ddof=0):
+        """
+        Return the standard deviation of the array elements along the given axis.
+
+        Refer to `numpy.std` for full documentation.
+
+        See Also
+        --------
+        numpy.std
+
+        Notes
+        -----
+        This is the same as `ndarray.std`, except that where an `ndarray` would
+        be returned, a `matrix` object is returned instead.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3, 4)))
+        >>> x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.std()
+        3.4520525295346629 # may vary
+        >>> x.std(0)
+        matrix([[ 3.26598632,  3.26598632,  3.26598632,  3.26598632]]) # may vary
+        >>> x.std(1)
+        matrix([[ 1.11803399],
+                [ 1.11803399],
+                [ 1.11803399]])
+
+        """
+        return N.ndarray.std(self, axis, dtype, out, ddof, keepdims=True)._collapse(axis)
+
+    def var(self, axis=None, dtype=None, out=None, ddof=0):
+        """
+        Returns the variance of the matrix elements, along the given axis.
+
+        Refer to `numpy.var` for full documentation.
+
+        See Also
+        --------
+        numpy.var
+
+        Notes
+        -----
+        This is the same as `ndarray.var`, except that where an `ndarray` would
+        be returned, a `matrix` object is returned instead.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3, 4)))
+        >>> x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.var()
+        11.916666666666666
+        >>> x.var(0)
+        matrix([[ 10.66666667,  10.66666667,  10.66666667,  10.66666667]]) # may vary
+        >>> x.var(1)
+        matrix([[1.25],
+                [1.25],
+                [1.25]])
+
+        """
+        return N.ndarray.var(self, axis, dtype, out, ddof, keepdims=True)._collapse(axis)
+
+    def prod(self, axis=None, dtype=None, out=None):
+        """
+        Return the product of the array elements over the given axis.
+
+        Refer to `prod` for full documentation.
+
+        See Also
+        --------
+        prod, ndarray.prod
+
+        Notes
+        -----
+        Same as `ndarray.prod`, except, where that returns an `ndarray`, this
+        returns a `matrix` object instead.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.prod()
+        0
+        >>> x.prod(0)
+        matrix([[  0,  45, 120, 231]])
+        >>> x.prod(1)
+        matrix([[   0],
+                [ 840],
+                [7920]])
+
+        """
+        return N.ndarray.prod(self, axis, dtype, out, keepdims=True)._collapse(axis)
+
+    def any(self, axis=None, out=None):
+        """
+        Test whether any array element along a given axis evaluates to True.
+
+        Refer to `numpy.any` for full documentation.
+
+        Parameters
+        ----------
+        axis : int, optional
+            Axis along which logical OR is performed
+        out : ndarray, optional
+            Output to existing array instead of creating new one, must have
+            same shape as expected output
+
+        Returns
+        -------
+            any : bool, ndarray
+                Returns a single bool if `axis` is ``None``; otherwise,
+                returns `ndarray`
+
+        """
+        return N.ndarray.any(self, axis, out, keepdims=True)._collapse(axis)
+
+    def all(self, axis=None, out=None):
+        """
+        Test whether all matrix elements along a given axis evaluate to True.
+
+        Parameters
+        ----------
+        See `numpy.all` for complete descriptions
+
+        See Also
+        --------
+        numpy.all
+
+        Notes
+        -----
+        This is the same as `ndarray.all`, but it returns a `matrix` object.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> y = x[0]; y
+        matrix([[0, 1, 2, 3]])
+        >>> (x == y)
+        matrix([[ True,  True,  True,  True],
+                [False, False, False, False],
+                [False, False, False, False]])
+        >>> (x == y).all()
+        False
+        >>> (x == y).all(0)
+        matrix([[False, False, False, False]])
+        >>> (x == y).all(1)
+        matrix([[ True],
+                [False],
+                [False]])
+
+        """
+        return N.ndarray.all(self, axis, out, keepdims=True)._collapse(axis)
+
+    def max(self, axis=None, out=None):
+        """
+        Return the maximum value along an axis.
+
+        Parameters
+        ----------
+        See `amax` for complete descriptions
+
+        See Also
+        --------
+        amax, ndarray.max
+
+        Notes
+        -----
+        This is the same as `ndarray.max`, but returns a `matrix` object
+        where `ndarray.max` would return an ndarray.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.max()
+        11
+        >>> x.max(0)
+        matrix([[ 8,  9, 10, 11]])
+        >>> x.max(1)
+        matrix([[ 3],
+                [ 7],
+                [11]])
+
+        """
+        return N.ndarray.max(self, axis, out, keepdims=True)._collapse(axis)
+
+    def argmax(self, axis=None, out=None):
+        """
+        Indexes of the maximum values along an axis.
+
+        Return the indexes of the first occurrences of the maximum values
+        along the specified axis.  If axis is None, the index is for the
+        flattened matrix.
+
+        Parameters
+        ----------
+        See `numpy.argmax` for complete descriptions
+
+        See Also
+        --------
+        numpy.argmax
+
+        Notes
+        -----
+        This is the same as `ndarray.argmax`, but returns a `matrix` object
+        where `ndarray.argmax` would return an `ndarray`.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.argmax()
+        11
+        >>> x.argmax(0)
+        matrix([[2, 2, 2, 2]])
+        >>> x.argmax(1)
+        matrix([[3],
+                [3],
+                [3]])
+
+        """
+        return N.ndarray.argmax(self, axis, out)._align(axis)
+
+    def min(self, axis=None, out=None):
+        """
+        Return the minimum value along an axis.
+
+        Parameters
+        ----------
+        See `amin` for complete descriptions.
+
+        See Also
+        --------
+        amin, ndarray.min
+
+        Notes
+        -----
+        This is the same as `ndarray.min`, but returns a `matrix` object
+        where `ndarray.min` would return an ndarray.
+
+        Examples
+        --------
+        >>> x = -np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[  0,  -1,  -2,  -3],
+                [ -4,  -5,  -6,  -7],
+                [ -8,  -9, -10, -11]])
+        >>> x.min()
+        -11
+        >>> x.min(0)
+        matrix([[ -8,  -9, -10, -11]])
+        >>> x.min(1)
+        matrix([[ -3],
+                [ -7],
+                [-11]])
+
+        """
+        return N.ndarray.min(self, axis, out, keepdims=True)._collapse(axis)
+
+    def argmin(self, axis=None, out=None):
+        """
+        Indexes of the minimum values along an axis.
+
+        Return the indexes of the first occurrences of the minimum values
+        along the specified axis.  If axis is None, the index is for the
+        flattened matrix.
+
+        Parameters
+        ----------
+        See `numpy.argmin` for complete descriptions.
+
+        See Also
+        --------
+        numpy.argmin
+
+        Notes
+        -----
+        This is the same as `ndarray.argmin`, but returns a `matrix` object
+        where `ndarray.argmin` would return an `ndarray`.
+
+        Examples
+        --------
+        >>> x = -np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[  0,  -1,  -2,  -3],
+                [ -4,  -5,  -6,  -7],
+                [ -8,  -9, -10, -11]])
+        >>> x.argmin()
+        11
+        >>> x.argmin(0)
+        matrix([[2, 2, 2, 2]])
+        >>> x.argmin(1)
+        matrix([[3],
+                [3],
+                [3]])
+
+        """
+        return N.ndarray.argmin(self, axis, out)._align(axis)
+
+    def ptp(self, axis=None, out=None):
+        """
+        Peak-to-peak (maximum - minimum) value along the given axis.
+
+        Refer to `numpy.ptp` for full documentation.
+
+        See Also
+        --------
+        numpy.ptp
+
+        Notes
+        -----
+        Same as `ndarray.ptp`, except, where that would return an `ndarray` object,
+        this returns a `matrix` object.
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.ptp()
+        11
+        >>> x.ptp(0)
+        matrix([[8, 8, 8, 8]])
+        >>> x.ptp(1)
+        matrix([[3],
+                [3],
+                [3]])
+
+        """
+        return N.ndarray.ptp(self, axis, out)._align(axis)
+
+    @property
+    def I(self):
+        """
+        Returns the (multiplicative) inverse of invertible `self`.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        ret : matrix object
+            If `self` is non-singular, `ret` is such that ``ret * self`` ==
+            ``self * ret`` == ``np.matrix(np.eye(self[0,:].size))`` all return
+            ``True``.
+
+        Raises
+        ------
+        numpy.linalg.LinAlgError: Singular matrix
+            If `self` is singular.
+
+        See Also
+        --------
+        linalg.inv
+
+        Examples
+        --------
+        >>> m = np.matrix('[1, 2; 3, 4]'); m
+        matrix([[1, 2],
+                [3, 4]])
+        >>> m.getI()
+        matrix([[-2. ,  1. ],
+                [ 1.5, -0.5]])
+        >>> m.getI() * m
+        matrix([[ 1.,  0.], # may vary
+                [ 0.,  1.]])
+
+        """
+        M, N = self.shape
+        if M == N:
+            from numpy.dual import inv as func
+        else:
+            from numpy.dual import pinv as func
+        return asmatrix(func(self))
+
+    @property
+    def A(self):
+        """
+        Return `self` as an `ndarray` object.
+
+        Equivalent to ``np.asarray(self)``.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        ret : ndarray
+            `self` as an `ndarray`
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.getA()
+        array([[ 0,  1,  2,  3],
+               [ 4,  5,  6,  7],
+               [ 8,  9, 10, 11]])
+
+        """
+        return self.__array__()
+
+    @property
+    def A1(self):
+        """
+        Return `self` as a flattened `ndarray`.
+
+        Equivalent to ``np.asarray(x).ravel()``
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        ret : ndarray
+            `self`, 1-D, as an `ndarray`
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4))); x
+        matrix([[ 0,  1,  2,  3],
+                [ 4,  5,  6,  7],
+                [ 8,  9, 10, 11]])
+        >>> x.getA1()
+        array([ 0,  1,  2, ...,  9, 10, 11])
+
+
+        """
+        return self.__array__().ravel()
+
+
+    def ravel(self, order='C'):
+        """
+        Return a flattened matrix.
+
+        Refer to `numpy.ravel` for more documentation.
+
+        Parameters
+        ----------
+        order : {'C', 'F', 'A', 'K'}, optional
+            The elements of `m` are read using this index order. 'C' means to
+            index the elements in C-like order, with the last axis index
+            changing fastest, back to the first axis index changing slowest.
+            'F' means to index the elements in Fortran-like index order, with
+            the first index changing fastest, and the last index changing
+            slowest. Note that the 'C' and 'F' options take no account of the
+            memory layout of the underlying array, and only refer to the order
+            of axis indexing.  'A' means to read the elements in Fortran-like
+            index order if `m` is Fortran *contiguous* in memory, C-like order
+            otherwise.  'K' means to read the elements in the order they occur
+            in memory, except for reversing the data when strides are negative.
+            By default, 'C' index order is used.
+
+        Returns
+        -------
+        ret : matrix
+            Return the matrix flattened to shape `(1, N)` where `N`
+            is the number of elements in the original matrix.
+            A copy is made only if necessary.
+
+        See Also
+        --------
+        matrix.flatten : returns a similar output matrix but always a copy
+        matrix.flat : a flat iterator on the array.
+        numpy.ravel : related function which returns an ndarray
+
+        """
+        return N.ndarray.ravel(self, order=order)
+
+    @property
+    def T(self):
+        """
+        Returns the transpose of the matrix.
+
+        Does *not* conjugate!  For the complex conjugate transpose, use ``.H``.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        ret : matrix object
+            The (non-conjugated) transpose of the matrix.
+
+        See Also
+        --------
+        transpose, getH
+
+        Examples
+        --------
+        >>> m = np.matrix('[1, 2; 3, 4]')
+        >>> m
+        matrix([[1, 2],
+                [3, 4]])
+        >>> m.getT()
+        matrix([[1, 3],
+                [2, 4]])
+
+        """
+        return self.transpose()
+
+    @property
+    def H(self):
+        """
+        Returns the (complex) conjugate transpose of `self`.
+
+        Equivalent to ``np.transpose(self)`` if `self` is real-valued.
+
+        Parameters
+        ----------
+        None
+
+        Returns
+        -------
+        ret : matrix object
+            complex conjugate transpose of `self`
+
+        Examples
+        --------
+        >>> x = np.matrix(np.arange(12).reshape((3,4)))
+        >>> z = x - 1j*x; z
+        matrix([[  0. +0.j,   1. -1.j,   2. -2.j,   3. -3.j],
+                [  4. -4.j,   5. -5.j,   6. -6.j,   7. -7.j],
+                [  8. -8.j,   9. -9.j,  10.-10.j,  11.-11.j]])
+        >>> z.getH()
+        matrix([[ 0. -0.j,  4. +4.j,  8. +8.j],
+                [ 1. +1.j,  5. +5.j,  9. +9.j],
+                [ 2. +2.j,  6. +6.j, 10.+10.j],
+                [ 3. +3.j,  7. +7.j, 11.+11.j]])
+
+        """
+        if issubclass(self.dtype.type, N.complexfloating):
+            return self.transpose().conjugate()
+        else:
+            return self.transpose()
+
+    # kept for compatibility
+    getT = T.fget
+    getA = A.fget
+    getA1 = A1.fget
+    getH = H.fget
+    getI = I.fget
+
+def _from_string(str, gdict, ldict):
+    rows = str.split(';')
+    rowtup = []
+    for row in rows:
+        trow = row.split(',')
+        newrow = []
+        for x in trow:
+            newrow.extend(x.split())
+        trow = newrow
+        coltup = []
+        for col in trow:
+            col = col.strip()
+            try:
+                thismat = ldict[col]
+            except KeyError:
+                try:
+                    thismat = gdict[col]
+                except KeyError as e:
+                    raise NameError(f"name {col!r} is not defined") from None
+
+            coltup.append(thismat)
+        rowtup.append(concatenate(coltup, axis=-1))
+    return concatenate(rowtup, axis=0)
+
+
+@set_module('numpy')
+def bmat(obj, ldict=None, gdict=None):
+    """
+    Build a matrix object from a string, nested sequence, or array.
+
+    Parameters
+    ----------
+    obj : str or array_like
+        Input data. If a string, variables in the current scope may be
+        referenced by name.
+    ldict : dict, optional
+        A dictionary that replaces local operands in current frame.
+        Ignored if `obj` is not a string or `gdict` is None.
+    gdict : dict, optional
+        A dictionary that replaces global operands in current frame.
+        Ignored if `obj` is not a string.
+
+    Returns
+    -------
+    out : matrix
+        Returns a matrix object, which is a specialized 2-D array.
+
+    See Also
+    --------
+    block :
+        A generalization of this function for N-d arrays, that returns normal
+        ndarrays.
+
+    Examples
+    --------
+    >>> A = np.mat('1 1; 1 1')
+    >>> B = np.mat('2 2; 2 2')
+    >>> C = np.mat('3 4; 5 6')
+    >>> D = np.mat('7 8; 9 0')
+
+    All the following expressions construct the same block matrix:
+
+    >>> np.bmat([[A, B], [C, D]])
+    matrix([[1, 1, 2, 2],
+            [1, 1, 2, 2],
+            [3, 4, 7, 8],
+            [5, 6, 9, 0]])
+    >>> np.bmat(np.r_[np.c_[A, B], np.c_[C, D]])
+    matrix([[1, 1, 2, 2],
+            [1, 1, 2, 2],
+            [3, 4, 7, 8],
+            [5, 6, 9, 0]])
+    >>> np.bmat('A,B; C,D')
+    matrix([[1, 1, 2, 2],
+            [1, 1, 2, 2],
+            [3, 4, 7, 8],
+            [5, 6, 9, 0]])
+
+    """
+    if isinstance(obj, str):
+        if gdict is None:
+            # get previous frame
+            frame = sys._getframe().f_back
+            glob_dict = frame.f_globals
+            loc_dict = frame.f_locals
+        else:
+            glob_dict = gdict
+            loc_dict = ldict
+
+        return matrix(_from_string(obj, glob_dict, loc_dict))
+
+    if isinstance(obj, (tuple, list)):
+        # [[A,B],[C,D]]
+        arr_rows = []
+        for row in obj:
+            if isinstance(row, N.ndarray):  # not 2-d
+                return matrix(concatenate(obj, axis=-1))
+            else:
+                arr_rows.append(concatenate(row, axis=-1))
+        return matrix(concatenate(arr_rows, axis=0))
+    if isinstance(obj, N.ndarray):
+        return matrix(obj)
+
+mat = asmatrix
diff --git a/venv/Lib/site-packages/numpy/matrixlib/setup.py b/venv/Lib/site-packages/numpy/matrixlib/setup.py
new file mode 100644
index 000000000..19b3bb2de
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/setup.py
@@ -0,0 +1,11 @@
+#!/usr/bin/env python3
+def configuration(parent_package='', top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('matrixlib', parent_package, top_path)
+    config.add_subpackage('tests')
+    return config
+
+if __name__ == "__main__":
+    from numpy.distutils.core import setup
+    config = configuration(top_path='').todict()
+    setup(**config)
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__init__.py b/venv/Lib/site-packages/numpy/matrixlib/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..c30b7ed46
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_defmatrix.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_defmatrix.cpython-36.pyc
new file mode 100644
index 000000000..3433d7735
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_defmatrix.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_interaction.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_interaction.cpython-36.pyc
new file mode 100644
index 000000000..cd1a933c2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_interaction.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_masked_matrix.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_masked_matrix.cpython-36.pyc
new file mode 100644
index 000000000..9fb9091c7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_masked_matrix.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_matrix_linalg.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_matrix_linalg.cpython-36.pyc
new file mode 100644
index 000000000..2d0b73be7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_matrix_linalg.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_multiarray.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_multiarray.cpython-36.pyc
new file mode 100644
index 000000000..2a8a4cb70
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_multiarray.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_numeric.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_numeric.cpython-36.pyc
new file mode 100644
index 000000000..2c40d965a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_numeric.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..a854ae370
Binary files /dev/null and b/venv/Lib/site-packages/numpy/matrixlib/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_defmatrix.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_defmatrix.py
new file mode 100644
index 000000000..4cb5f3a37
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_defmatrix.py
@@ -0,0 +1,453 @@
+import collections.abc
+
+import numpy as np
+from numpy import matrix, asmatrix, bmat
+from numpy.testing import (
+    assert_, assert_equal, assert_almost_equal, assert_array_equal,
+    assert_array_almost_equal, assert_raises
+    )
+from numpy.linalg import matrix_power
+from numpy.matrixlib import mat
+
+class TestCtor:
+    def test_basic(self):
+        A = np.array([[1, 2], [3, 4]])
+        mA = matrix(A)
+        assert_(np.all(mA.A == A))
+
+        B = bmat("A,A;A,A")
+        C = bmat([[A, A], [A, A]])
+        D = np.array([[1, 2, 1, 2],
+                      [3, 4, 3, 4],
+                      [1, 2, 1, 2],
+                      [3, 4, 3, 4]])
+        assert_(np.all(B.A == D))
+        assert_(np.all(C.A == D))
+
+        E = np.array([[5, 6], [7, 8]])
+        AEresult = matrix([[1, 2, 5, 6], [3, 4, 7, 8]])
+        assert_(np.all(bmat([A, E]) == AEresult))
+
+        vec = np.arange(5)
+        mvec = matrix(vec)
+        assert_(mvec.shape == (1, 5))
+
+    def test_exceptions(self):
+        # Check for ValueError when called with invalid string data.
+        assert_raises(ValueError, matrix, "invalid")
+
+    def test_bmat_nondefault_str(self):
+        A = np.array([[1, 2], [3, 4]])
+        B = np.array([[5, 6], [7, 8]])
+        Aresult = np.array([[1, 2, 1, 2],
+                            [3, 4, 3, 4],
+                            [1, 2, 1, 2],
+                            [3, 4, 3, 4]])
+        mixresult = np.array([[1, 2, 5, 6],
+                              [3, 4, 7, 8],
+                              [5, 6, 1, 2],
+                              [7, 8, 3, 4]])
+        assert_(np.all(bmat("A,A;A,A") == Aresult))
+        assert_(np.all(bmat("A,A;A,A", ldict={'A':B}) == Aresult))
+        assert_raises(TypeError, bmat, "A,A;A,A", gdict={'A':B})
+        assert_(
+            np.all(bmat("A,A;A,A", ldict={'A':A}, gdict={'A':B}) == Aresult))
+        b2 = bmat("A,B;C,D", ldict={'A':A,'B':B}, gdict={'C':B,'D':A})
+        assert_(np.all(b2 == mixresult))
+
+
+class TestProperties:
+    def test_sum(self):
+        """Test whether matrix.sum(axis=1) preserves orientation.
+        Fails in NumPy <= 0.9.6.2127.
+        """
+        M = matrix([[1, 2, 0, 0],
+                   [3, 4, 0, 0],
+                   [1, 2, 1, 2],
+                   [3, 4, 3, 4]])
+        sum0 = matrix([8, 12, 4, 6])
+        sum1 = matrix([3, 7, 6, 14]).T
+        sumall = 30
+        assert_array_equal(sum0, M.sum(axis=0))
+        assert_array_equal(sum1, M.sum(axis=1))
+        assert_equal(sumall, M.sum())
+
+        assert_array_equal(sum0, np.sum(M, axis=0))
+        assert_array_equal(sum1, np.sum(M, axis=1))
+        assert_equal(sumall, np.sum(M))
+
+    def test_prod(self):
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(x.prod(), 720)
+        assert_equal(x.prod(0), matrix([[4, 10, 18]]))
+        assert_equal(x.prod(1), matrix([[6], [120]]))
+
+        assert_equal(np.prod(x), 720)
+        assert_equal(np.prod(x, axis=0), matrix([[4, 10, 18]]))
+        assert_equal(np.prod(x, axis=1), matrix([[6], [120]]))
+
+        y = matrix([0, 1, 3])
+        assert_(y.prod() == 0)
+
+    def test_max(self):
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(x.max(), 6)
+        assert_equal(x.max(0), matrix([[4, 5, 6]]))
+        assert_equal(x.max(1), matrix([[3], [6]]))
+
+        assert_equal(np.max(x), 6)
+        assert_equal(np.max(x, axis=0), matrix([[4, 5, 6]]))
+        assert_equal(np.max(x, axis=1), matrix([[3], [6]]))
+
+    def test_min(self):
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(x.min(), 1)
+        assert_equal(x.min(0), matrix([[1, 2, 3]]))
+        assert_equal(x.min(1), matrix([[1], [4]]))
+
+        assert_equal(np.min(x), 1)
+        assert_equal(np.min(x, axis=0), matrix([[1, 2, 3]]))
+        assert_equal(np.min(x, axis=1), matrix([[1], [4]]))
+
+    def test_ptp(self):
+        x = np.arange(4).reshape((2, 2))
+        assert_(x.ptp() == 3)
+        assert_(np.all(x.ptp(0) == np.array([2, 2])))
+        assert_(np.all(x.ptp(1) == np.array([1, 1])))
+
+    def test_var(self):
+        x = np.arange(9).reshape((3, 3))
+        mx = x.view(np.matrix)
+        assert_equal(x.var(ddof=0), mx.var(ddof=0))
+        assert_equal(x.var(ddof=1), mx.var(ddof=1))
+
+    def test_basic(self):
+        import numpy.linalg as linalg
+
+        A = np.array([[1., 2.],
+                      [3., 4.]])
+        mA = matrix(A)
+        assert_(np.allclose(linalg.inv(A), mA.I))
+        assert_(np.all(np.array(np.transpose(A) == mA.T)))
+        assert_(np.all(np.array(np.transpose(A) == mA.H)))
+        assert_(np.all(A == mA.A))
+
+        B = A + 2j*A
+        mB = matrix(B)
+        assert_(np.allclose(linalg.inv(B), mB.I))
+        assert_(np.all(np.array(np.transpose(B) == mB.T)))
+        assert_(np.all(np.array(np.transpose(B).conj() == mB.H)))
+
+    def test_pinv(self):
+        x = matrix(np.arange(6).reshape(2, 3))
+        xpinv = matrix([[-0.77777778,  0.27777778],
+                        [-0.11111111,  0.11111111],
+                        [ 0.55555556, -0.05555556]])
+        assert_almost_equal(x.I, xpinv)
+
+    def test_comparisons(self):
+        A = np.arange(100).reshape(10, 10)
+        mA = matrix(A)
+        mB = matrix(A) + 0.1
+        assert_(np.all(mB == A+0.1))
+        assert_(np.all(mB == matrix(A+0.1)))
+        assert_(not np.any(mB == matrix(A-0.1)))
+        assert_(np.all(mA < mB))
+        assert_(np.all(mA <= mB))
+        assert_(np.all(mA <= mA))
+        assert_(not np.any(mA < mA))
+
+        assert_(not np.any(mB < mA))
+        assert_(np.all(mB >= mA))
+        assert_(np.all(mB >= mB))
+        assert_(not np.any(mB > mB))
+
+        assert_(np.all(mA == mA))
+        assert_(not np.any(mA == mB))
+        assert_(np.all(mB != mA))
+
+        assert_(not np.all(abs(mA) > 0))
+        assert_(np.all(abs(mB > 0)))
+
+    def test_asmatrix(self):
+        A = np.arange(100).reshape(10, 10)
+        mA = asmatrix(A)
+        A[0, 0] = -10
+        assert_(A[0, 0] == mA[0, 0])
+
+    def test_noaxis(self):
+        A = matrix([[1, 0], [0, 1]])
+        assert_(A.sum() == matrix(2))
+        assert_(A.mean() == matrix(0.5))
+
+    def test_repr(self):
+        A = matrix([[1, 0], [0, 1]])
+        assert_(repr(A) == "matrix([[1, 0],\n        [0, 1]])")
+
+    def test_make_bool_matrix_from_str(self):
+        A = matrix('True; True; False')
+        B = matrix([[True], [True], [False]])
+        assert_array_equal(A, B)
+
+class TestCasting:
+    def test_basic(self):
+        A = np.arange(100).reshape(10, 10)
+        mA = matrix(A)
+
+        mB = mA.copy()
+        O = np.ones((10, 10), np.float64) * 0.1
+        mB = mB + O
+        assert_(mB.dtype.type == np.float64)
+        assert_(np.all(mA != mB))
+        assert_(np.all(mB == mA+0.1))
+
+        mC = mA.copy()
+        O = np.ones((10, 10), np.complex128)
+        mC = mC * O
+        assert_(mC.dtype.type == np.complex128)
+        assert_(np.all(mA != mB))
+
+
+class TestAlgebra:
+    def test_basic(self):
+        import numpy.linalg as linalg
+
+        A = np.array([[1., 2.], [3., 4.]])
+        mA = matrix(A)
+
+        B = np.identity(2)
+        for i in range(6):
+            assert_(np.allclose((mA ** i).A, B))
+            B = np.dot(B, A)
+
+        Ainv = linalg.inv(A)
+        B = np.identity(2)
+        for i in range(6):
+            assert_(np.allclose((mA ** -i).A, B))
+            B = np.dot(B, Ainv)
+
+        assert_(np.allclose((mA * mA).A, np.dot(A, A)))
+        assert_(np.allclose((mA + mA).A, (A + A)))
+        assert_(np.allclose((3*mA).A, (3*A)))
+
+        mA2 = matrix(A)
+        mA2 *= 3
+        assert_(np.allclose(mA2.A, 3*A))
+
+    def test_pow(self):
+        """Test raising a matrix to an integer power works as expected."""
+        m = matrix("1. 2.; 3. 4.")
+        m2 = m.copy()
+        m2 **= 2
+        mi = m.copy()
+        mi **= -1
+        m4 = m2.copy()
+        m4 **= 2
+        assert_array_almost_equal(m2, m**2)
+        assert_array_almost_equal(m4, np.dot(m2, m2))
+        assert_array_almost_equal(np.dot(mi, m), np.eye(2))
+
+    def test_scalar_type_pow(self):
+        m = matrix([[1, 2], [3, 4]])
+        for scalar_t in [np.int8, np.uint8]:
+            two = scalar_t(2)
+            assert_array_almost_equal(m ** 2, m ** two)
+
+    def test_notimplemented(self):
+        '''Check that 'not implemented' operations produce a failure.'''
+        A = matrix([[1., 2.],
+                    [3., 4.]])
+
+        # __rpow__
+        with assert_raises(TypeError):
+            1.0**A
+
+        # __mul__ with something not a list, ndarray, tuple, or scalar
+        with assert_raises(TypeError):
+            A*object()
+
+
+class TestMatrixReturn:
+    def test_instance_methods(self):
+        a = matrix([1.0], dtype='f8')
+        methodargs = {
+            'astype': ('intc',),
+            'clip': (0.0, 1.0),
+            'compress': ([1],),
+            'repeat': (1,),
+            'reshape': (1,),
+            'swapaxes': (0, 0),
+            'dot': np.array([1.0]),
+            }
+        excluded_methods = [
+            'argmin', 'choose', 'dump', 'dumps', 'fill', 'getfield',
+            'getA', 'getA1', 'item', 'nonzero', 'put', 'putmask', 'resize',
+            'searchsorted', 'setflags', 'setfield', 'sort',
+            'partition', 'argpartition',
+            'take', 'tofile', 'tolist', 'tostring', 'tobytes', 'all', 'any',
+            'sum', 'argmax', 'argmin', 'min', 'max', 'mean', 'var', 'ptp',
+            'prod', 'std', 'ctypes', 'itemset',
+            ]
+        for attrib in dir(a):
+            if attrib.startswith('_') or attrib in excluded_methods:
+                continue
+            f = getattr(a, attrib)
+            if isinstance(f, collections.abc.Callable):
+                # reset contents of a
+                a.astype('f8')
+                a.fill(1.0)
+                if attrib in methodargs:
+                    args = methodargs[attrib]
+                else:
+                    args = ()
+                b = f(*args)
+                assert_(type(b) is matrix, "%s" % attrib)
+        assert_(type(a.real) is matrix)
+        assert_(type(a.imag) is matrix)
+        c, d = matrix([0.0]).nonzero()
+        assert_(type(c) is np.ndarray)
+        assert_(type(d) is np.ndarray)
+
+
+class TestIndexing:
+    def test_basic(self):
+        x = asmatrix(np.zeros((3, 2), float))
+        y = np.zeros((3, 1), float)
+        y[:, 0] = [0.8, 0.2, 0.3]
+        x[:, 1] = y > 0.5
+        assert_equal(x, [[0, 1], [0, 0], [0, 0]])
+
+
+class TestNewScalarIndexing:
+    a = matrix([[1, 2], [3, 4]])
+
+    def test_dimesions(self):
+        a = self.a
+        x = a[0]
+        assert_equal(x.ndim, 2)
+
+    def test_array_from_matrix_list(self):
+        a = self.a
+        x = np.array([a, a])
+        assert_equal(x.shape, [2, 2, 2])
+
+    def test_array_to_list(self):
+        a = self.a
+        assert_equal(a.tolist(), [[1, 2], [3, 4]])
+
+    def test_fancy_indexing(self):
+        a = self.a
+        x = a[1, [0, 1, 0]]
+        assert_(isinstance(x, matrix))
+        assert_equal(x, matrix([[3,  4,  3]]))
+        x = a[[1, 0]]
+        assert_(isinstance(x, matrix))
+        assert_equal(x, matrix([[3,  4], [1, 2]]))
+        x = a[[[1], [0]], [[1, 0], [0, 1]]]
+        assert_(isinstance(x, matrix))
+        assert_equal(x, matrix([[4,  3], [1,  2]]))
+
+    def test_matrix_element(self):
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(x[0][0], matrix([[1, 2, 3]]))
+        assert_equal(x[0][0].shape, (1, 3))
+        assert_equal(x[0].shape, (1, 3))
+        assert_equal(x[:, 0].shape, (2, 1))
+
+        x = matrix(0)
+        assert_equal(x[0, 0], 0)
+        assert_equal(x[0], 0)
+        assert_equal(x[:, 0].shape, x.shape)
+
+    def test_scalar_indexing(self):
+        x = asmatrix(np.zeros((3, 2), float))
+        assert_equal(x[0, 0], x[0][0])
+
+    def test_row_column_indexing(self):
+        x = asmatrix(np.eye(2))
+        assert_array_equal(x[0,:], [[1, 0]])
+        assert_array_equal(x[1,:], [[0, 1]])
+        assert_array_equal(x[:, 0], [[1], [0]])
+        assert_array_equal(x[:, 1], [[0], [1]])
+
+    def test_boolean_indexing(self):
+        A = np.arange(6)
+        A.shape = (3, 2)
+        x = asmatrix(A)
+        assert_array_equal(x[:, np.array([True, False])], x[:, 0])
+        assert_array_equal(x[np.array([True, False, False]),:], x[0,:])
+
+    def test_list_indexing(self):
+        A = np.arange(6)
+        A.shape = (3, 2)
+        x = asmatrix(A)
+        assert_array_equal(x[:, [1, 0]], x[:, ::-1])
+        assert_array_equal(x[[2, 1, 0],:], x[::-1,:])
+
+
+class TestPower:
+    def test_returntype(self):
+        a = np.array([[0, 1], [0, 0]])
+        assert_(type(matrix_power(a, 2)) is np.ndarray)
+        a = mat(a)
+        assert_(type(matrix_power(a, 2)) is matrix)
+
+    def test_list(self):
+        assert_array_equal(matrix_power([[0, 1], [0, 0]], 2), [[0, 0], [0, 0]])
+
+
+class TestShape:
+
+    a = np.array([[1], [2]])
+    m = matrix([[1], [2]])
+
+    def test_shape(self):
+        assert_equal(self.a.shape, (2, 1))
+        assert_equal(self.m.shape, (2, 1))
+
+    def test_numpy_ravel(self):
+        assert_equal(np.ravel(self.a).shape, (2,))
+        assert_equal(np.ravel(self.m).shape, (2,))
+
+    def test_member_ravel(self):
+        assert_equal(self.a.ravel().shape, (2,))
+        assert_equal(self.m.ravel().shape, (1, 2))
+
+    def test_member_flatten(self):
+        assert_equal(self.a.flatten().shape, (2,))
+        assert_equal(self.m.flatten().shape, (1, 2))
+
+    def test_numpy_ravel_order(self):
+        x = np.array([[1, 2, 3], [4, 5, 6]])
+        assert_equal(np.ravel(x), [1, 2, 3, 4, 5, 6])
+        assert_equal(np.ravel(x, order='F'), [1, 4, 2, 5, 3, 6])
+        assert_equal(np.ravel(x.T), [1, 4, 2, 5, 3, 6])
+        assert_equal(np.ravel(x.T, order='A'), [1, 2, 3, 4, 5, 6])
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(np.ravel(x), [1, 2, 3, 4, 5, 6])
+        assert_equal(np.ravel(x, order='F'), [1, 4, 2, 5, 3, 6])
+        assert_equal(np.ravel(x.T), [1, 4, 2, 5, 3, 6])
+        assert_equal(np.ravel(x.T, order='A'), [1, 2, 3, 4, 5, 6])
+
+    def test_matrix_ravel_order(self):
+        x = matrix([[1, 2, 3], [4, 5, 6]])
+        assert_equal(x.ravel(), [[1, 2, 3, 4, 5, 6]])
+        assert_equal(x.ravel(order='F'), [[1, 4, 2, 5, 3, 6]])
+        assert_equal(x.T.ravel(), [[1, 4, 2, 5, 3, 6]])
+        assert_equal(x.T.ravel(order='A'), [[1, 2, 3, 4, 5, 6]])
+
+    def test_array_memory_sharing(self):
+        assert_(np.may_share_memory(self.a, self.a.ravel()))
+        assert_(not np.may_share_memory(self.a, self.a.flatten()))
+
+    def test_matrix_memory_sharing(self):
+        assert_(np.may_share_memory(self.m, self.m.ravel()))
+        assert_(not np.may_share_memory(self.m, self.m.flatten()))
+
+    def test_expand_dims_matrix(self):
+        # matrices are always 2d - so expand_dims only makes sense when the
+        # type is changed away from matrix.
+        a = np.arange(10).reshape((2, 5)).view(np.matrix)
+        expanded = np.expand_dims(a, axis=1)
+        assert_equal(expanded.ndim, 3)
+        assert_(not isinstance(expanded, np.matrix))
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_interaction.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_interaction.py
new file mode 100644
index 000000000..5154bd621
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_interaction.py
@@ -0,0 +1,354 @@
+"""Tests of interaction of matrix with other parts of numpy.
+
+Note that tests with MaskedArray and linalg are done in separate files.
+"""
+import pytest
+
+import textwrap
+import warnings
+
+import numpy as np
+from numpy.testing import (assert_, assert_equal, assert_raises,
+                           assert_raises_regex, assert_array_equal,
+                           assert_almost_equal, assert_array_almost_equal)
+
+
+def test_fancy_indexing():
+    # The matrix class messes with the shape. While this is always
+    # weird (getitem is not used, it does not have setitem nor knows
+    # about fancy indexing), this tests gh-3110
+    # 2018-04-29: moved here from core.tests.test_index.
+    m = np.matrix([[1, 2], [3, 4]])
+
+    assert_(isinstance(m[[0, 1, 0], :], np.matrix))
+
+    # gh-3110. Note the transpose currently because matrices do *not*
+    # support dimension fixing for fancy indexing correctly.
+    x = np.asmatrix(np.arange(50).reshape(5, 10))
+    assert_equal(x[:2, np.array(-1)], x[:2, -1].T)
+
+
+def test_polynomial_mapdomain():
+    # test that polynomial preserved matrix subtype.
+    # 2018-04-29: moved here from polynomial.tests.polyutils.
+    dom1 = [0, 4]
+    dom2 = [1, 3]
+    x = np.matrix([dom1, dom1])
+    res = np.polynomial.polyutils.mapdomain(x, dom1, dom2)
+    assert_(isinstance(res, np.matrix))
+
+
+def test_sort_matrix_none():
+    # 2018-04-29: moved here from core.tests.test_multiarray
+    a = np.matrix([[2, 1, 0]])
+    actual = np.sort(a, axis=None)
+    expected = np.matrix([[0, 1, 2]])
+    assert_equal(actual, expected)
+    assert_(type(expected) is np.matrix)
+
+
+def test_partition_matrix_none():
+    # gh-4301
+    # 2018-04-29: moved here from core.tests.test_multiarray
+    a = np.matrix([[2, 1, 0]])
+    actual = np.partition(a, 1, axis=None)
+    expected = np.matrix([[0, 1, 2]])
+    assert_equal(actual, expected)
+    assert_(type(expected) is np.matrix)
+
+
+def test_dot_scalar_and_matrix_of_objects():
+    # Ticket #2469
+    # 2018-04-29: moved here from core.tests.test_multiarray
+    arr = np.matrix([1, 2], dtype=object)
+    desired = np.matrix([[3, 6]], dtype=object)
+    assert_equal(np.dot(arr, 3), desired)
+    assert_equal(np.dot(3, arr), desired)
+
+
+def test_inner_scalar_and_matrix():
+    # 2018-04-29: moved here from core.tests.test_multiarray
+    for dt in np.typecodes['AllInteger'] + np.typecodes['AllFloat'] + '?':
+        sca = np.array(3, dtype=dt)[()]
+        arr = np.matrix([[1, 2], [3, 4]], dtype=dt)
+        desired = np.matrix([[3, 6], [9, 12]], dtype=dt)
+        assert_equal(np.inner(arr, sca), desired)
+        assert_equal(np.inner(sca, arr), desired)
+
+
+def test_inner_scalar_and_matrix_of_objects():
+    # Ticket #4482
+    # 2018-04-29: moved here from core.tests.test_multiarray
+    arr = np.matrix([1, 2], dtype=object)
+    desired = np.matrix([[3, 6]], dtype=object)
+    assert_equal(np.inner(arr, 3), desired)
+    assert_equal(np.inner(3, arr), desired)
+
+
+def test_iter_allocate_output_subtype():
+    # Make sure that the subtype with priority wins
+    # 2018-04-29: moved here from core.tests.test_nditer, given the
+    # matrix specific shape test.
+
+    # matrix vs ndarray
+    a = np.matrix([[1, 2], [3, 4]])
+    b = np.arange(4).reshape(2, 2).T
+    i = np.nditer([a, b, None], [],
+                  [['readonly'], ['readonly'], ['writeonly', 'allocate']])
+    assert_(type(i.operands[2]) is np.matrix)
+    assert_(type(i.operands[2]) is not np.ndarray)
+    assert_equal(i.operands[2].shape, (2, 2))
+
+    # matrix always wants things to be 2D
+    b = np.arange(4).reshape(1, 2, 2)
+    assert_raises(RuntimeError, np.nditer, [a, b, None], [],
+                  [['readonly'], ['readonly'], ['writeonly', 'allocate']])
+    # but if subtypes are disabled, the result can still work
+    i = np.nditer([a, b, None], [],
+                  [['readonly'], ['readonly'],
+                   ['writeonly', 'allocate', 'no_subtype']])
+    assert_(type(i.operands[2]) is np.ndarray)
+    assert_(type(i.operands[2]) is not np.matrix)
+    assert_equal(i.operands[2].shape, (1, 2, 2))
+
+
+def like_function():
+    # 2018-04-29: moved here from core.tests.test_numeric
+    a = np.matrix([[1, 2], [3, 4]])
+    for like_function in np.zeros_like, np.ones_like, np.empty_like:
+        b = like_function(a)
+        assert_(type(b) is np.matrix)
+
+        c = like_function(a, subok=False)
+        assert_(type(c) is not np.matrix)
+
+
+def test_array_astype():
+    # 2018-04-29: copied here from core.tests.test_api
+    # subok=True passes through a matrix
+    a = np.matrix([[0, 1, 2], [3, 4, 5]], dtype='f4')
+    b = a.astype('f4', subok=True, copy=False)
+    assert_(a is b)
+
+    # subok=True is default, and creates a subtype on a cast
+    b = a.astype('i4', copy=False)
+    assert_equal(a, b)
+    assert_equal(type(b), np.matrix)
+
+    # subok=False never returns a matrix
+    b = a.astype('f4', subok=False, copy=False)
+    assert_equal(a, b)
+    assert_(not (a is b))
+    assert_(type(b) is not np.matrix)
+
+
+def test_stack():
+    # 2018-04-29: copied here from core.tests.test_shape_base
+    # check np.matrix cannot be stacked
+    m = np.matrix([[1, 2], [3, 4]])
+    assert_raises_regex(ValueError, 'shape too large to be a matrix',
+                        np.stack, [m, m])
+
+
+def test_object_scalar_multiply():
+    # Tickets #2469 and #4482
+    # 2018-04-29: moved here from core.tests.test_ufunc
+    arr = np.matrix([1, 2], dtype=object)
+    desired = np.matrix([[3, 6]], dtype=object)
+    assert_equal(np.multiply(arr, 3), desired)
+    assert_equal(np.multiply(3, arr), desired)
+
+
+def test_nanfunctions_matrices():
+    # Check that it works and that type and
+    # shape are preserved
+    # 2018-04-29: moved here from core.tests.test_nanfunctions
+    mat = np.matrix(np.eye(3))
+    for f in [np.nanmin, np.nanmax]:
+        res = f(mat, axis=0)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (1, 3))
+        res = f(mat, axis=1)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (3, 1))
+        res = f(mat)
+        assert_(np.isscalar(res))
+    # check that rows of nan are dealt with for subclasses (#4628)
+    mat[1] = np.nan
+    for f in [np.nanmin, np.nanmax]:
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter('always')
+            res = f(mat, axis=0)
+            assert_(isinstance(res, np.matrix))
+            assert_(not np.any(np.isnan(res)))
+            assert_(len(w) == 0)
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter('always')
+            res = f(mat, axis=1)
+            assert_(isinstance(res, np.matrix))
+            assert_(np.isnan(res[1, 0]) and not np.isnan(res[0, 0])
+                    and not np.isnan(res[2, 0]))
+            assert_(len(w) == 1, 'no warning raised')
+            assert_(issubclass(w[0].category, RuntimeWarning))
+
+        with warnings.catch_warnings(record=True) as w:
+            warnings.simplefilter('always')
+            res = f(mat)
+            assert_(np.isscalar(res))
+            assert_(res != np.nan)
+            assert_(len(w) == 0)
+
+
+def test_nanfunctions_matrices_general():
+    # Check that it works and that type and
+    # shape are preserved
+    # 2018-04-29: moved here from core.tests.test_nanfunctions
+    mat = np.matrix(np.eye(3))
+    for f in (np.nanargmin, np.nanargmax, np.nansum, np.nanprod,
+              np.nanmean, np.nanvar, np.nanstd):
+        res = f(mat, axis=0)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (1, 3))
+        res = f(mat, axis=1)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (3, 1))
+        res = f(mat)
+        assert_(np.isscalar(res))
+
+    for f in np.nancumsum, np.nancumprod:
+        res = f(mat, axis=0)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (3, 3))
+        res = f(mat, axis=1)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (3, 3))
+        res = f(mat)
+        assert_(isinstance(res, np.matrix))
+        assert_(res.shape == (1, 3*3))
+
+
+def test_average_matrix():
+    # 2018-04-29: moved here from core.tests.test_function_base.
+    y = np.matrix(np.random.rand(5, 5))
+    assert_array_equal(y.mean(0), np.average(y, 0))
+
+    a = np.matrix([[1, 2], [3, 4]])
+    w = np.matrix([[1, 2], [3, 4]])
+
+    r = np.average(a, axis=0, weights=w)
+    assert_equal(type(r), np.matrix)
+    assert_equal(r, [[2.5, 10.0/3]])
+
+
+def test_trapz_matrix():
+    # Test to make sure matrices give the same answer as ndarrays
+    # 2018-04-29: moved here from core.tests.test_function_base.
+    x = np.linspace(0, 5)
+    y = x * x
+    r = np.trapz(y, x)
+    mx = np.matrix(x)
+    my = np.matrix(y)
+    mr = np.trapz(my, mx)
+    assert_almost_equal(mr, r)
+
+
+def test_ediff1d_matrix():
+    # 2018-04-29: moved here from core.tests.test_arraysetops.
+    assert(isinstance(np.ediff1d(np.matrix(1)), np.matrix))
+    assert(isinstance(np.ediff1d(np.matrix(1), to_begin=1), np.matrix))
+
+
+def test_apply_along_axis_matrix():
+    # this test is particularly malicious because matrix
+    # refuses to become 1d
+    # 2018-04-29: moved here from core.tests.test_shape_base.
+    def double(row):
+        return row * 2
+
+    m = np.matrix([[0, 1], [2, 3]])
+    expected = np.matrix([[0, 2], [4, 6]])
+
+    result = np.apply_along_axis(double, 0, m)
+    assert_(isinstance(result, np.matrix))
+    assert_array_equal(result, expected)
+
+    result = np.apply_along_axis(double, 1, m)
+    assert_(isinstance(result, np.matrix))
+    assert_array_equal(result, expected)
+
+
+def test_kron_matrix():
+    # 2018-04-29: moved here from core.tests.test_shape_base.
+    a = np.ones([2, 2])
+    m = np.asmatrix(a)
+    assert_equal(type(np.kron(a, a)), np.ndarray)
+    assert_equal(type(np.kron(m, m)), np.matrix)
+    assert_equal(type(np.kron(a, m)), np.matrix)
+    assert_equal(type(np.kron(m, a)), np.matrix)
+
+
+class TestConcatenatorMatrix:
+    # 2018-04-29: moved here from core.tests.test_index_tricks.
+    def test_matrix(self):
+        a = [1, 2]
+        b = [3, 4]
+
+        ab_r = np.r_['r', a, b]
+        ab_c = np.r_['c', a, b]
+
+        assert_equal(type(ab_r), np.matrix)
+        assert_equal(type(ab_c), np.matrix)
+
+        assert_equal(np.array(ab_r), [[1, 2, 3, 4]])
+        assert_equal(np.array(ab_c), [[1], [2], [3], [4]])
+
+        assert_raises(ValueError, lambda: np.r_['rc', a, b])
+
+    def test_matrix_scalar(self):
+        r = np.r_['r', [1, 2], 3]
+        assert_equal(type(r), np.matrix)
+        assert_equal(np.array(r), [[1, 2, 3]])
+
+    def test_matrix_builder(self):
+        a = np.array([1])
+        b = np.array([2])
+        c = np.array([3])
+        d = np.array([4])
+        actual = np.r_['a, b; c, d']
+        expected = np.bmat([[a, b], [c, d]])
+
+        assert_equal(actual, expected)
+        assert_equal(type(actual), type(expected))
+
+
+def test_array_equal_error_message_matrix():
+    # 2018-04-29: moved here from testing.tests.test_utils.
+    with pytest.raises(AssertionError) as exc_info:
+        assert_equal(np.array([1, 2]), np.matrix([1, 2]))
+    msg = str(exc_info.value)
+    msg_reference = textwrap.dedent("""\
+
+    Arrays are not equal
+
+    (shapes (2,), (1, 2) mismatch)
+     x: array([1, 2])
+     y: matrix([[1, 2]])""")
+    assert_equal(msg, msg_reference)
+
+
+def test_array_almost_equal_matrix():
+    # Matrix slicing keeps things 2-D, while array does not necessarily.
+    # See gh-8452.
+    # 2018-04-29: moved here from testing.tests.test_utils.
+    m1 = np.matrix([[1., 2.]])
+    m2 = np.matrix([[1., np.nan]])
+    m3 = np.matrix([[1., -np.inf]])
+    m4 = np.matrix([[np.nan, np.inf]])
+    m5 = np.matrix([[1., 2.], [np.nan, np.inf]])
+    for assert_func in assert_array_almost_equal, assert_almost_equal:
+        for m in m1, m2, m3, m4, m5:
+            assert_func(m, m)
+            a = np.array(m)
+            assert_func(a, m)
+            assert_func(m, a)
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_masked_matrix.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_masked_matrix.py
new file mode 100644
index 000000000..45424ecf0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_masked_matrix.py
@@ -0,0 +1,229 @@
+import numpy as np
+from numpy.ma.testutils import (assert_, assert_equal, assert_raises,
+                                assert_array_equal)
+from numpy.ma.core import (masked_array, masked_values, masked, allequal,
+                           MaskType, getmask, MaskedArray, nomask,
+                           log, add, hypot, divide)
+from numpy.ma.extras import mr_
+from numpy.compat import pickle
+
+
+class MMatrix(MaskedArray, np.matrix,):
+
+    def __new__(cls, data, mask=nomask):
+        mat = np.matrix(data)
+        _data = MaskedArray.__new__(cls, data=mat, mask=mask)
+        return _data
+
+    def __array_finalize__(self, obj):
+        np.matrix.__array_finalize__(self, obj)
+        MaskedArray.__array_finalize__(self, obj)
+        return
+
+    @property
+    def _series(self):
+        _view = self.view(MaskedArray)
+        _view._sharedmask = False
+        return _view
+
+
+class TestMaskedMatrix:
+    def test_matrix_indexing(self):
+        # Tests conversions and indexing
+        x1 = np.matrix([[1, 2, 3], [4, 3, 2]])
+        x2 = masked_array(x1, mask=[[1, 0, 0], [0, 1, 0]])
+        x3 = masked_array(x1, mask=[[0, 1, 0], [1, 0, 0]])
+        x4 = masked_array(x1)
+        # test conversion to strings
+        str(x2)  # raises?
+        repr(x2)  # raises?
+        # tests of indexing
+        assert_(type(x2[1, 0]) is type(x1[1, 0]))
+        assert_(x1[1, 0] == x2[1, 0])
+        assert_(x2[1, 1] is masked)
+        assert_equal(x1[0, 2], x2[0, 2])
+        assert_equal(x1[0, 1:], x2[0, 1:])
+        assert_equal(x1[:, 2], x2[:, 2])
+        assert_equal(x1[:], x2[:])
+        assert_equal(x1[1:], x3[1:])
+        x1[0, 2] = 9
+        x2[0, 2] = 9
+        assert_equal(x1, x2)
+        x1[0, 1:] = 99
+        x2[0, 1:] = 99
+        assert_equal(x1, x2)
+        x2[0, 1] = masked
+        assert_equal(x1, x2)
+        x2[0, 1:] = masked
+        assert_equal(x1, x2)
+        x2[0, :] = x1[0, :]
+        x2[0, 1] = masked
+        assert_(allequal(getmask(x2), np.array([[0, 1, 0], [0, 1, 0]])))
+        x3[1, :] = masked_array([1, 2, 3], [1, 1, 0])
+        assert_(allequal(getmask(x3)[1], masked_array([1, 1, 0])))
+        assert_(allequal(getmask(x3[1]), masked_array([1, 1, 0])))
+        x4[1, :] = masked_array([1, 2, 3], [1, 1, 0])
+        assert_(allequal(getmask(x4[1]), masked_array([1, 1, 0])))
+        assert_(allequal(x4[1], masked_array([1, 2, 3])))
+        x1 = np.matrix(np.arange(5) * 1.0)
+        x2 = masked_values(x1, 3.0)
+        assert_equal(x1, x2)
+        assert_(allequal(masked_array([0, 0, 0, 1, 0], dtype=MaskType),
+                         x2.mask))
+        assert_equal(3.0, x2.fill_value)
+
+    def test_pickling_subbaseclass(self):
+        # Test pickling w/ a subclass of ndarray
+        a = masked_array(np.matrix(list(range(10))), mask=[1, 0, 1, 0, 0] * 2)
+        for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+            a_pickled = pickle.loads(pickle.dumps(a, protocol=proto))
+            assert_equal(a_pickled._mask, a._mask)
+            assert_equal(a_pickled, a)
+            assert_(isinstance(a_pickled._data, np.matrix))
+
+    def test_count_mean_with_matrix(self):
+        m = masked_array(np.matrix([[1, 2], [3, 4]]), mask=np.zeros((2, 2)))
+
+        assert_equal(m.count(axis=0).shape, (1, 2))
+        assert_equal(m.count(axis=1).shape, (2, 1))
+
+        # Make sure broadcasting inside mean and var work
+        assert_equal(m.mean(axis=0), [[2., 3.]])
+        assert_equal(m.mean(axis=1), [[1.5], [3.5]])
+
+    def test_flat(self):
+        # Test that flat can return items even for matrices [#4585, #4615]
+        # test simple access
+        test = masked_array(np.matrix([[1, 2, 3]]), mask=[0, 0, 1])
+        assert_equal(test.flat[1], 2)
+        assert_equal(test.flat[2], masked)
+        assert_(np.all(test.flat[0:2] == test[0, 0:2]))
+        # Test flat on masked_matrices
+        test = masked_array(np.matrix([[1, 2, 3]]), mask=[0, 0, 1])
+        test.flat = masked_array([3, 2, 1], mask=[1, 0, 0])
+        control = masked_array(np.matrix([[3, 2, 1]]), mask=[1, 0, 0])
+        assert_equal(test, control)
+        # Test setting
+        test = masked_array(np.matrix([[1, 2, 3]]), mask=[0, 0, 1])
+        testflat = test.flat
+        testflat[:] = testflat[[2, 1, 0]]
+        assert_equal(test, control)
+        testflat[0] = 9
+        # test that matrices keep the correct shape (#4615)
+        a = masked_array(np.matrix(np.eye(2)), mask=0)
+        b = a.flat
+        b01 = b[:2]
+        assert_equal(b01.data, np.array([[1., 0.]]))
+        assert_equal(b01.mask, np.array([[False, False]]))
+
+    def test_allany_onmatrices(self):
+        x = np.array([[0.13, 0.26, 0.90],
+                      [0.28, 0.33, 0.63],
+                      [0.31, 0.87, 0.70]])
+        X = np.matrix(x)
+        m = np.array([[True, False, False],
+                      [False, False, False],
+                      [True, True, False]], dtype=np.bool_)
+        mX = masked_array(X, mask=m)
+        mXbig = (mX > 0.5)
+        mXsmall = (mX < 0.5)
+
+        assert_(not mXbig.all())
+        assert_(mXbig.any())
+        assert_equal(mXbig.all(0), np.matrix([False, False, True]))
+        assert_equal(mXbig.all(1), np.matrix([False, False, True]).T)
+        assert_equal(mXbig.any(0), np.matrix([False, False, True]))
+        assert_equal(mXbig.any(1), np.matrix([True, True, True]).T)
+
+        assert_(not mXsmall.all())
+        assert_(mXsmall.any())
+        assert_equal(mXsmall.all(0), np.matrix([True, True, False]))
+        assert_equal(mXsmall.all(1), np.matrix([False, False, False]).T)
+        assert_equal(mXsmall.any(0), np.matrix([True, True, False]))
+        assert_equal(mXsmall.any(1), np.matrix([True, True, False]).T)
+
+    def test_compressed(self):
+        a = masked_array(np.matrix([1, 2, 3, 4]), mask=[0, 0, 0, 0])
+        b = a.compressed()
+        assert_equal(b, a)
+        assert_(isinstance(b, np.matrix))
+        a[0, 0] = masked
+        b = a.compressed()
+        assert_equal(b, [[2, 3, 4]])
+
+    def test_ravel(self):
+        a = masked_array(np.matrix([1, 2, 3, 4, 5]), mask=[[0, 1, 0, 0, 0]])
+        aravel = a.ravel()
+        assert_equal(aravel.shape, (1, 5))
+        assert_equal(aravel._mask.shape, a.shape)
+
+    def test_view(self):
+        # Test view w/ flexible dtype
+        iterator = list(zip(np.arange(10), np.random.rand(10)))
+        data = np.array(iterator)
+        a = masked_array(iterator, dtype=[('a', float), ('b', float)])
+        a.mask[0] = (1, 0)
+        test = a.view((float, 2), np.matrix)
+        assert_equal(test, data)
+        assert_(isinstance(test, np.matrix))
+        assert_(not isinstance(test, MaskedArray))
+
+
+class TestSubclassing:
+    # Test suite for masked subclasses of ndarray.
+
+    def setup(self):
+        x = np.arange(5, dtype='float')
+        mx = MMatrix(x, mask=[0, 1, 0, 0, 0])
+        self.data = (x, mx)
+
+    def test_maskedarray_subclassing(self):
+        # Tests subclassing MaskedArray
+        (x, mx) = self.data
+        assert_(isinstance(mx._data, np.matrix))
+
+    def test_masked_unary_operations(self):
+        # Tests masked_unary_operation
+        (x, mx) = self.data
+        with np.errstate(divide='ignore'):
+            assert_(isinstance(log(mx), MMatrix))
+            assert_equal(log(x), np.log(x))
+
+    def test_masked_binary_operations(self):
+        # Tests masked_binary_operation
+        (x, mx) = self.data
+        # Result should be a MMatrix
+        assert_(isinstance(add(mx, mx), MMatrix))
+        assert_(isinstance(add(mx, x), MMatrix))
+        # Result should work
+        assert_equal(add(mx, x), mx+x)
+        assert_(isinstance(add(mx, mx)._data, np.matrix))
+        assert_(isinstance(add.outer(mx, mx), MMatrix))
+        assert_(isinstance(hypot(mx, mx), MMatrix))
+        assert_(isinstance(hypot(mx, x), MMatrix))
+
+    def test_masked_binary_operations2(self):
+        # Tests domained_masked_binary_operation
+        (x, mx) = self.data
+        xmx = masked_array(mx.data.__array__(), mask=mx.mask)
+        assert_(isinstance(divide(mx, mx), MMatrix))
+        assert_(isinstance(divide(mx, x), MMatrix))
+        assert_equal(divide(mx, mx), divide(xmx, xmx))
+
+class TestConcatenator:
+    # Tests for mr_, the equivalent of r_ for masked arrays.
+
+    def test_matrix_builder(self):
+        assert_raises(np.ma.MAError, lambda: mr_['1, 2; 3, 4'])
+
+    def test_matrix(self):
+        # Test consistency with unmasked version.  If we ever deprecate
+        # matrix, this test should either still pass, or both actual and
+        # expected should fail to be build.
+        actual = mr_['r', 1, 2, 3]
+        expected = np.ma.array(np.r_['r', 1, 2, 3])
+        assert_array_equal(actual, expected)
+
+        # outer type is masked array, inner type is matrix
+        assert_equal(type(actual), type(expected))
+        assert_equal(type(actual.data), type(expected.data))
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_matrix_linalg.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_matrix_linalg.py
new file mode 100644
index 000000000..106c2e382
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_matrix_linalg.py
@@ -0,0 +1,93 @@
+""" Test functions for linalg module using the matrix class."""
+import numpy as np
+
+from numpy.linalg.tests.test_linalg import (
+    LinalgCase, apply_tag, TestQR as _TestQR, LinalgTestCase,
+    _TestNorm2D, _TestNormDoubleBase, _TestNormSingleBase, _TestNormInt64Base,
+    SolveCases, InvCases, EigvalsCases, EigCases, SVDCases, CondCases,
+    PinvCases, DetCases, LstsqCases)
+
+
+CASES = []
+
+# square test cases
+CASES += apply_tag('square', [
+    LinalgCase("0x0_matrix",
+               np.empty((0, 0), dtype=np.double).view(np.matrix),
+               np.empty((0, 1), dtype=np.double).view(np.matrix),
+               tags={'size-0'}),
+    LinalgCase("matrix_b_only",
+               np.array([[1., 2.], [3., 4.]]),
+               np.matrix([2., 1.]).T),
+    LinalgCase("matrix_a_and_b",
+               np.matrix([[1., 2.], [3., 4.]]),
+               np.matrix([2., 1.]).T),
+])
+
+# hermitian test-cases
+CASES += apply_tag('hermitian', [
+    LinalgCase("hmatrix_a_and_b",
+               np.matrix([[1., 2.], [2., 1.]]),
+               None),
+])
+# No need to make generalized or strided cases for matrices.
+
+
+class MatrixTestCase(LinalgTestCase):
+    TEST_CASES = CASES
+
+
+class TestSolveMatrix(SolveCases, MatrixTestCase):
+    pass
+
+
+class TestInvMatrix(InvCases, MatrixTestCase):
+    pass
+
+
+class TestEigvalsMatrix(EigvalsCases, MatrixTestCase):
+    pass
+
+
+class TestEigMatrix(EigCases, MatrixTestCase):
+    pass
+
+
+class TestSVDMatrix(SVDCases, MatrixTestCase):
+    pass
+
+
+class TestCondMatrix(CondCases, MatrixTestCase):
+    pass
+
+
+class TestPinvMatrix(PinvCases, MatrixTestCase):
+    pass
+
+
+class TestDetMatrix(DetCases, MatrixTestCase):
+    pass
+
+
+class TestLstsqMatrix(LstsqCases, MatrixTestCase):
+    pass
+
+
+class _TestNorm2DMatrix(_TestNorm2D):
+    array = np.matrix
+
+
+class TestNormDoubleMatrix(_TestNorm2DMatrix, _TestNormDoubleBase):
+    pass
+
+
+class TestNormSingleMatrix(_TestNorm2DMatrix, _TestNormSingleBase):
+    pass
+
+
+class TestNormInt64Matrix(_TestNorm2DMatrix, _TestNormInt64Base):
+    pass
+
+
+class TestQRMatrix(_TestQR):
+    array = np.matrix
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_multiarray.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_multiarray.py
new file mode 100644
index 000000000..638d0d153
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_multiarray.py
@@ -0,0 +1,16 @@
+import numpy as np
+from numpy.testing import assert_, assert_equal, assert_array_equal
+
+class TestView:
+    def test_type(self):
+        x = np.array([1, 2, 3])
+        assert_(isinstance(x.view(np.matrix), np.matrix))
+
+    def test_keywords(self):
+        x = np.array([(1, 2)], dtype=[('a', np.int8), ('b', np.int8)])
+        # We must be specific about the endianness here:
+        y = x.view(dtype='<i2', type=np.matrix)
+        assert_array_equal(y, [[513]])
+
+        assert_(isinstance(y, np.matrix))
+        assert_equal(y.dtype, np.dtype('<i2'))
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_numeric.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_numeric.py
new file mode 100644
index 000000000..a772bb388
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_numeric.py
@@ -0,0 +1,17 @@
+import numpy as np
+from numpy.testing import assert_equal
+
+class TestDot:
+    def test_matscalar(self):
+        b1 = np.matrix(np.ones((3, 3), dtype=complex))
+        assert_equal(b1*1.0, b1)
+
+
+def test_diagonal():
+    b1 = np.matrix([[1,2],[3,4]])
+    diag_b1 = np.matrix([[1, 4]])
+    array_b1 = np.array([1, 4])
+
+    assert_equal(b1.diagonal(), diag_b1)
+    assert_equal(np.diagonal(b1), array_b1)
+    assert_equal(np.diag(b1), array_b1)
diff --git a/venv/Lib/site-packages/numpy/matrixlib/tests/test_regression.py b/venv/Lib/site-packages/numpy/matrixlib/tests/test_regression.py
new file mode 100644
index 000000000..a54d44020
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/matrixlib/tests/test_regression.py
@@ -0,0 +1,31 @@
+import numpy as np
+from numpy.testing import assert_, assert_equal, assert_raises
+
+
+class TestRegression:
+    def test_kron_matrix(self):
+        # Ticket #71
+        x = np.matrix('[1 0; 1 0]')
+        assert_equal(type(np.kron(x, x)), type(x))
+
+    def test_matrix_properties(self):
+        # Ticket #125
+        a = np.matrix([1.0], dtype=float)
+        assert_(type(a.real) is np.matrix)
+        assert_(type(a.imag) is np.matrix)
+        c, d = np.matrix([0.0]).nonzero()
+        assert_(type(c) is np.ndarray)
+        assert_(type(d) is np.ndarray)
+
+    def test_matrix_multiply_by_1d_vector(self):
+        # Ticket #473
+        def mul():
+            np.mat(np.eye(2))*np.ones(2)
+
+        assert_raises(ValueError, mul)
+
+    def test_matrix_std_argmax(self):
+        # Ticket #83
+        x = np.asmatrix(np.random.uniform(0, 1, (3, 3)))
+        assert_equal(x.std().shape, ())
+        assert_equal(x.argmax().shape, ())
diff --git a/venv/Lib/site-packages/numpy/polynomial/__init__.py b/venv/Lib/site-packages/numpy/polynomial/__init__.py
new file mode 100644
index 000000000..4ff2df57e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/__init__.py
@@ -0,0 +1,25 @@
+"""
+A sub-package for efficiently dealing with polynomials.
+
+Within the documentation for this sub-package, a "finite power series,"
+i.e., a polynomial (also referred to simply as a "series") is represented
+by a 1-D numpy array of the polynomial's coefficients, ordered from lowest
+order term to highest.  For example, array([1,2,3]) represents
+``P_0 + 2*P_1 + 3*P_2``, where P_n is the n-th order basis polynomial
+applicable to the specific module in question, e.g., `polynomial` (which
+"wraps" the "standard" basis) or `chebyshev`.  For optimal performance,
+all operations on polynomials, including evaluation at an argument, are
+implemented as operations on the coefficients.  Additional (module-specific)
+information can be found in the docstring for the module of interest.
+
+"""
+from .polynomial import Polynomial
+from .chebyshev import Chebyshev
+from .legendre import Legendre
+from .hermite import Hermite
+from .hermite_e import HermiteE
+from .laguerre import Laguerre
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..63d2fb663
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/_polybase.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/_polybase.cpython-36.pyc
new file mode 100644
index 000000000..bbbe391b1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/_polybase.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/chebyshev.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/chebyshev.cpython-36.pyc
new file mode 100644
index 000000000..2f4994303
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/chebyshev.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite.cpython-36.pyc
new file mode 100644
index 000000000..56fdd0390
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite_e.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite_e.cpython-36.pyc
new file mode 100644
index 000000000..38c7b40c5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/hermite_e.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/laguerre.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/laguerre.cpython-36.pyc
new file mode 100644
index 000000000..05a9e63e0
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/laguerre.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/legendre.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/legendre.cpython-36.pyc
new file mode 100644
index 000000000..07ad8b704
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/legendre.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/polynomial.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/polynomial.cpython-36.pyc
new file mode 100644
index 000000000..dde4f7dda
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/polynomial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/polyutils.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/polyutils.cpython-36.pyc
new file mode 100644
index 000000000..2ec2016d7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/polyutils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..614e6fe3a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/_polybase.py b/venv/Lib/site-packages/numpy/polynomial/_polybase.py
new file mode 100644
index 000000000..53efbb90f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/_polybase.py
@@ -0,0 +1,1041 @@
+"""
+Abstract base class for the various polynomial Classes.
+
+The ABCPolyBase class provides the methods needed to implement the common API
+for the various polynomial classes. It operates as a mixin, but uses the
+abc module from the stdlib, hence it is only available for Python >= 2.6.
+
+"""
+import abc
+import numbers
+
+import numpy as np
+from . import polyutils as pu
+
+__all__ = ['ABCPolyBase']
+
+class ABCPolyBase(abc.ABC):
+    """An abstract base class for immutable series classes.
+
+    ABCPolyBase provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' along with the
+    methods listed below.
+
+    .. versionadded:: 1.9.0
+
+    Parameters
+    ----------
+    coef : array_like
+        Series coefficients in order of increasing degree, i.e.,
+        ``(1, 2, 3)`` gives ``1*P_0(x) + 2*P_1(x) + 3*P_2(x)``, where
+        ``P_i`` is the basis polynomials of degree ``i``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is the derived class domain.
+    window : (2,) array_like, optional
+        Window, see domain for its use. The default value is the
+        derived class window.
+
+    Attributes
+    ----------
+    coef : (N,) ndarray
+        Series coefficients in order of increasing degree.
+    domain : (2,) ndarray
+        Domain that is mapped to window.
+    window : (2,) ndarray
+        Window that domain is mapped to.
+
+    Class Attributes
+    ----------------
+    maxpower : int
+        Maximum power allowed, i.e., the largest number ``n`` such that
+        ``p(x)**n`` is allowed. This is to limit runaway polynomial size.
+    domain : (2,) ndarray
+        Default domain of the class.
+    window : (2,) ndarray
+        Default window of the class.
+
+    """
+
+    # Not hashable
+    __hash__ = None
+
+    # Opt out of numpy ufuncs and Python ops with ndarray subclasses.
+    __array_ufunc__ = None
+
+    # Limit runaway size. T_n^m has degree n*m
+    maxpower = 100
+
+    @property
+    @abc.abstractmethod
+    def domain(self):
+        pass
+
+    @property
+    @abc.abstractmethod
+    def window(self):
+        pass
+
+    @property
+    @abc.abstractmethod
+    def nickname(self):
+        pass
+
+    @property
+    @abc.abstractmethod
+    def basis_name(self):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _add(c1, c2):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _sub(c1, c2):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _mul(c1, c2):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _div(c1, c2):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _pow(c, pow, maxpower=None):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _val(x, c):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _int(c, m, k, lbnd, scl):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _der(c, m, scl):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _fit(x, y, deg, rcond, full):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _line(off, scl):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _roots(c):
+        pass
+
+    @staticmethod
+    @abc.abstractmethod
+    def _fromroots(r):
+        pass
+
+    def has_samecoef(self, other):
+        """Check if coefficients match.
+
+        .. versionadded:: 1.6.0
+
+        Parameters
+        ----------
+        other : class instance
+            The other class must have the ``coef`` attribute.
+
+        Returns
+        -------
+        bool : boolean
+            True if the coefficients are the same, False otherwise.
+
+        """
+        if len(self.coef) != len(other.coef):
+            return False
+        elif not np.all(self.coef == other.coef):
+            return False
+        else:
+            return True
+
+    def has_samedomain(self, other):
+        """Check if domains match.
+
+        .. versionadded:: 1.6.0
+
+        Parameters
+        ----------
+        other : class instance
+            The other class must have the ``domain`` attribute.
+
+        Returns
+        -------
+        bool : boolean
+            True if the domains are the same, False otherwise.
+
+        """
+        return np.all(self.domain == other.domain)
+
+    def has_samewindow(self, other):
+        """Check if windows match.
+
+        .. versionadded:: 1.6.0
+
+        Parameters
+        ----------
+        other : class instance
+            The other class must have the ``window`` attribute.
+
+        Returns
+        -------
+        bool : boolean
+            True if the windows are the same, False otherwise.
+
+        """
+        return np.all(self.window == other.window)
+
+    def has_sametype(self, other):
+        """Check if types match.
+
+        .. versionadded:: 1.7.0
+
+        Parameters
+        ----------
+        other : object
+            Class instance.
+
+        Returns
+        -------
+        bool : boolean
+            True if other is same class as self
+
+        """
+        return isinstance(other, self.__class__)
+
+    def _get_coefficients(self, other):
+        """Interpret other as polynomial coefficients.
+
+        The `other` argument is checked to see if it is of the same
+        class as self with identical domain and window. If so,
+        return its coefficients, otherwise return `other`.
+
+        .. versionadded:: 1.9.0
+
+        Parameters
+        ----------
+        other : anything
+            Object to be checked.
+
+        Returns
+        -------
+        coef
+            The coefficients of`other` if it is a compatible instance,
+            of ABCPolyBase, otherwise `other`.
+
+        Raises
+        ------
+        TypeError
+            When `other` is an incompatible instance of ABCPolyBase.
+
+        """
+        if isinstance(other, ABCPolyBase):
+            if not isinstance(other, self.__class__):
+                raise TypeError("Polynomial types differ")
+            elif not np.all(self.domain == other.domain):
+                raise TypeError("Domains differ")
+            elif not np.all(self.window == other.window):
+                raise TypeError("Windows differ")
+            return other.coef
+        return other
+
+    def __init__(self, coef, domain=None, window=None):
+        [coef] = pu.as_series([coef], trim=False)
+        self.coef = coef
+
+        if domain is not None:
+            [domain] = pu.as_series([domain], trim=False)
+            if len(domain) != 2:
+                raise ValueError("Domain has wrong number of elements.")
+            self.domain = domain
+
+        if window is not None:
+            [window] = pu.as_series([window], trim=False)
+            if len(window) != 2:
+                raise ValueError("Window has wrong number of elements.")
+            self.window = window
+
+    def __repr__(self):
+        coef = repr(self.coef)[6:-1]
+        domain = repr(self.domain)[6:-1]
+        window = repr(self.window)[6:-1]
+        name = self.__class__.__name__
+        return f"{name}({coef}, domain={domain}, window={window})"
+
+    def __str__(self):
+        coef = str(self.coef)
+        name = self.nickname
+        return f"{name}({coef})"
+
+    @classmethod
+    def _repr_latex_term(cls, i, arg_str, needs_parens):
+        if cls.basis_name is None:
+            raise NotImplementedError(
+                "Subclasses must define either a basis name, or override "
+                "_repr_latex_term(i, arg_str, needs_parens)")
+        # since we always add parens, we don't care if the expression needs them
+        return f"{{{cls.basis_name}}}_{{{i}}}({arg_str})"
+
+    @staticmethod
+    def _repr_latex_scalar(x):
+        # TODO: we're stuck with disabling math formatting until we handle
+        # exponents in this function
+        return r'\text{{{}}}'.format(x)
+
+    def _repr_latex_(self):
+        # get the scaled argument string to the basis functions
+        off, scale = self.mapparms()
+        if off == 0 and scale == 1:
+            term = 'x'
+            needs_parens = False
+        elif scale == 1:
+            term = f"{self._repr_latex_scalar(off)} + x"
+            needs_parens = True
+        elif off == 0:
+            term = f"{self._repr_latex_scalar(scale)}x"
+            needs_parens = True
+        else:
+            term = (
+                f"{self._repr_latex_scalar(off)} + "
+                f"{self._repr_latex_scalar(scale)}x"
+            )
+            needs_parens = True
+
+        mute = r"\color{{LightGray}}{{{}}}".format
+
+        parts = []
+        for i, c in enumerate(self.coef):
+            # prevent duplication of + and - signs
+            if i == 0:
+                coef_str = f"{self._repr_latex_scalar(c)}"
+            elif not isinstance(c, numbers.Real):
+                coef_str = f" + ({self._repr_latex_scalar(c)})"
+            elif not np.signbit(c):
+                coef_str = f" + {self._repr_latex_scalar(c)}"
+            else:
+                coef_str = f" - {self._repr_latex_scalar(-c)}"
+
+            # produce the string for the term
+            term_str = self._repr_latex_term(i, term, needs_parens)
+            if term_str == '1':
+                part = coef_str
+            else:
+                part = rf"{coef_str}\,{term_str}"
+
+            if c == 0:
+                part = mute(part)
+
+            parts.append(part)
+
+        if parts:
+            body = ''.join(parts)
+        else:
+            # in case somehow there are no coefficients at all
+            body = '0'
+
+        return rf"$x \mapsto {body}$"
+
+
+
+    # Pickle and copy
+
+    def __getstate__(self):
+        ret = self.__dict__.copy()
+        ret['coef'] = self.coef.copy()
+        ret['domain'] = self.domain.copy()
+        ret['window'] = self.window.copy()
+        return ret
+
+    def __setstate__(self, dict):
+        self.__dict__ = dict
+
+    # Call
+
+    def __call__(self, arg):
+        off, scl = pu.mapparms(self.domain, self.window)
+        arg = off + scl*arg
+        return self._val(arg, self.coef)
+
+    def __iter__(self):
+        return iter(self.coef)
+
+    def __len__(self):
+        return len(self.coef)
+
+    # Numeric properties.
+
+    def __neg__(self):
+        return self.__class__(-self.coef, self.domain, self.window)
+
+    def __pos__(self):
+        return self
+
+    def __add__(self, other):
+        othercoef = self._get_coefficients(other)
+        try:
+            coef = self._add(self.coef, othercoef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __sub__(self, other):
+        othercoef = self._get_coefficients(other)
+        try:
+            coef = self._sub(self.coef, othercoef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __mul__(self, other):
+        othercoef = self._get_coefficients(other)
+        try:
+            coef = self._mul(self.coef, othercoef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __truediv__(self, other):
+        # there is no true divide if the rhs is not a Number, although it
+        # could return the first n elements of an infinite series.
+        # It is hard to see where n would come from, though.
+        if not isinstance(other, numbers.Number) or isinstance(other, bool):
+            raise TypeError(
+                f"unsupported types for true division: "
+                f"'{type(self)}', '{type(other)}'"
+            )
+        return self.__floordiv__(other)
+
+    def __floordiv__(self, other):
+        res = self.__divmod__(other)
+        if res is NotImplemented:
+            return res
+        return res[0]
+
+    def __mod__(self, other):
+        res = self.__divmod__(other)
+        if res is NotImplemented:
+            return res
+        return res[1]
+
+    def __divmod__(self, other):
+        othercoef = self._get_coefficients(other)
+        try:
+            quo, rem = self._div(self.coef, othercoef)
+        except ZeroDivisionError as e:
+            raise e
+        except Exception:
+            return NotImplemented
+        quo = self.__class__(quo, self.domain, self.window)
+        rem = self.__class__(rem, self.domain, self.window)
+        return quo, rem
+
+    def __pow__(self, other):
+        coef = self._pow(self.coef, other, maxpower=self.maxpower)
+        res = self.__class__(coef, self.domain, self.window)
+        return res
+
+    def __radd__(self, other):
+        try:
+            coef = self._add(other, self.coef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __rsub__(self, other):
+        try:
+            coef = self._sub(other, self.coef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __rmul__(self, other):
+        try:
+            coef = self._mul(other, self.coef)
+        except Exception:
+            return NotImplemented
+        return self.__class__(coef, self.domain, self.window)
+
+    def __rdiv__(self, other):
+        # set to __floordiv__ /.
+        return self.__rfloordiv__(other)
+
+    def __rtruediv__(self, other):
+        # An instance of ABCPolyBase is not considered a
+        # Number.
+        return NotImplemented
+
+    def __rfloordiv__(self, other):
+        res = self.__rdivmod__(other)
+        if res is NotImplemented:
+            return res
+        return res[0]
+
+    def __rmod__(self, other):
+        res = self.__rdivmod__(other)
+        if res is NotImplemented:
+            return res
+        return res[1]
+
+    def __rdivmod__(self, other):
+        try:
+            quo, rem = self._div(other, self.coef)
+        except ZeroDivisionError as e:
+            raise e
+        except Exception:
+            return NotImplemented
+        quo = self.__class__(quo, self.domain, self.window)
+        rem = self.__class__(rem, self.domain, self.window)
+        return quo, rem
+
+    def __eq__(self, other):
+        res = (isinstance(other, self.__class__) and
+               np.all(self.domain == other.domain) and
+               np.all(self.window == other.window) and
+               (self.coef.shape == other.coef.shape) and
+               np.all(self.coef == other.coef))
+        return res
+
+    def __ne__(self, other):
+        return not self.__eq__(other)
+
+    #
+    # Extra methods.
+    #
+
+    def copy(self):
+        """Return a copy.
+
+        Returns
+        -------
+        new_series : series
+            Copy of self.
+
+        """
+        return self.__class__(self.coef, self.domain, self.window)
+
+    def degree(self):
+        """The degree of the series.
+
+        .. versionadded:: 1.5.0
+
+        Returns
+        -------
+        degree : int
+            Degree of the series, one less than the number of coefficients.
+
+        """
+        return len(self) - 1
+
+    def cutdeg(self, deg):
+        """Truncate series to the given degree.
+
+        Reduce the degree of the series to `deg` by discarding the
+        high order terms. If `deg` is greater than the current degree a
+        copy of the current series is returned. This can be useful in least
+        squares where the coefficients of the high degree terms may be very
+        small.
+
+        .. versionadded:: 1.5.0
+
+        Parameters
+        ----------
+        deg : non-negative int
+            The series is reduced to degree `deg` by discarding the high
+            order terms. The value of `deg` must be a non-negative integer.
+
+        Returns
+        -------
+        new_series : series
+            New instance of series with reduced degree.
+
+        """
+        return self.truncate(deg + 1)
+
+    def trim(self, tol=0):
+        """Remove trailing coefficients
+
+        Remove trailing coefficients until a coefficient is reached whose
+        absolute value greater than `tol` or the beginning of the series is
+        reached. If all the coefficients would be removed the series is set
+        to ``[0]``. A new series instance is returned with the new
+        coefficients.  The current instance remains unchanged.
+
+        Parameters
+        ----------
+        tol : non-negative number.
+            All trailing coefficients less than `tol` will be removed.
+
+        Returns
+        -------
+        new_series : series
+            Contains the new set of coefficients.
+
+        """
+        coef = pu.trimcoef(self.coef, tol)
+        return self.__class__(coef, self.domain, self.window)
+
+    def truncate(self, size):
+        """Truncate series to length `size`.
+
+        Reduce the series to length `size` by discarding the high
+        degree terms. The value of `size` must be a positive integer. This
+        can be useful in least squares where the coefficients of the
+        high degree terms may be very small.
+
+        Parameters
+        ----------
+        size : positive int
+            The series is reduced to length `size` by discarding the high
+            degree terms. The value of `size` must be a positive integer.
+
+        Returns
+        -------
+        new_series : series
+            New instance of series with truncated coefficients.
+
+        """
+        isize = int(size)
+        if isize != size or isize < 1:
+            raise ValueError("size must be a positive integer")
+        if isize >= len(self.coef):
+            coef = self.coef
+        else:
+            coef = self.coef[:isize]
+        return self.__class__(coef, self.domain, self.window)
+
+    def convert(self, domain=None, kind=None, window=None):
+        """Convert series to a different kind and/or domain and/or window.
+
+        Parameters
+        ----------
+        domain : array_like, optional
+            The domain of the converted series. If the value is None,
+            the default domain of `kind` is used.
+        kind : class, optional
+            The polynomial series type class to which the current instance
+            should be converted. If kind is None, then the class of the
+            current instance is used.
+        window : array_like, optional
+            The window of the converted series. If the value is None,
+            the default window of `kind` is used.
+
+        Returns
+        -------
+        new_series : series
+            The returned class can be of different type than the current
+            instance and/or have a different domain and/or different
+            window.
+
+        Notes
+        -----
+        Conversion between domains and class types can result in
+        numerically ill defined series.
+
+        Examples
+        --------
+
+        """
+        if kind is None:
+            kind = self.__class__
+        if domain is None:
+            domain = kind.domain
+        if window is None:
+            window = kind.window
+        return self(kind.identity(domain, window=window))
+
+    def mapparms(self):
+        """Return the mapping parameters.
+
+        The returned values define a linear map ``off + scl*x`` that is
+        applied to the input arguments before the series is evaluated. The
+        map depends on the ``domain`` and ``window``; if the current
+        ``domain`` is equal to the ``window`` the resulting map is the
+        identity.  If the coefficients of the series instance are to be
+        used by themselves outside this class, then the linear function
+        must be substituted for the ``x`` in the standard representation of
+        the base polynomials.
+
+        Returns
+        -------
+        off, scl : float or complex
+            The mapping function is defined by ``off + scl*x``.
+
+        Notes
+        -----
+        If the current domain is the interval ``[l1, r1]`` and the window
+        is ``[l2, r2]``, then the linear mapping function ``L`` is
+        defined by the equations::
+
+            L(l1) = l2
+            L(r1) = r2
+
+        """
+        return pu.mapparms(self.domain, self.window)
+
+    def integ(self, m=1, k=[], lbnd=None):
+        """Integrate.
+
+        Return a series instance that is the definite integral of the
+        current series.
+
+        Parameters
+        ----------
+        m : non-negative int
+            The number of integrations to perform.
+        k : array_like
+            Integration constants. The first constant is applied to the
+            first integration, the second to the second, and so on. The
+            list of values must less than or equal to `m` in length and any
+            missing values are set to zero.
+        lbnd : Scalar
+            The lower bound of the definite integral.
+
+        Returns
+        -------
+        new_series : series
+            A new series representing the integral. The domain is the same
+            as the domain of the integrated series.
+
+        """
+        off, scl = self.mapparms()
+        if lbnd is None:
+            lbnd = 0
+        else:
+            lbnd = off + scl*lbnd
+        coef = self._int(self.coef, m, k, lbnd, 1./scl)
+        return self.__class__(coef, self.domain, self.window)
+
+    def deriv(self, m=1):
+        """Differentiate.
+
+        Return a series instance of that is the derivative of the current
+        series.
+
+        Parameters
+        ----------
+        m : non-negative int
+            Find the derivative of order `m`.
+
+        Returns
+        -------
+        new_series : series
+            A new series representing the derivative. The domain is the same
+            as the domain of the differentiated series.
+
+        """
+        off, scl = self.mapparms()
+        coef = self._der(self.coef, m, scl)
+        return self.__class__(coef, self.domain, self.window)
+
+    def roots(self):
+        """Return the roots of the series polynomial.
+
+        Compute the roots for the series. Note that the accuracy of the
+        roots decrease the further outside the domain they lie.
+
+        Returns
+        -------
+        roots : ndarray
+            Array containing the roots of the series.
+
+        """
+        roots = self._roots(self.coef)
+        return pu.mapdomain(roots, self.window, self.domain)
+
+    def linspace(self, n=100, domain=None):
+        """Return x, y values at equally spaced points in domain.
+
+        Returns the x, y values at `n` linearly spaced points across the
+        domain.  Here y is the value of the polynomial at the points x. By
+        default the domain is the same as that of the series instance.
+        This method is intended mostly as a plotting aid.
+
+        .. versionadded:: 1.5.0
+
+        Parameters
+        ----------
+        n : int, optional
+            Number of point pairs to return. The default value is 100.
+        domain : {None, array_like}, optional
+            If not None, the specified domain is used instead of that of
+            the calling instance. It should be of the form ``[beg,end]``.
+            The default is None which case the class domain is used.
+
+        Returns
+        -------
+        x, y : ndarray
+            x is equal to linspace(self.domain[0], self.domain[1], n) and
+            y is the series evaluated at element of x.
+
+        """
+        if domain is None:
+            domain = self.domain
+        x = np.linspace(domain[0], domain[1], n)
+        y = self(x)
+        return x, y
+
+    @classmethod
+    def fit(cls, x, y, deg, domain=None, rcond=None, full=False, w=None,
+        window=None):
+        """Least squares fit to data.
+
+        Return a series instance that is the least squares fit to the data
+        `y` sampled at `x`. The domain of the returned instance can be
+        specified and this will often result in a superior fit with less
+        chance of ill conditioning.
+
+        Parameters
+        ----------
+        x : array_like, shape (M,)
+            x-coordinates of the M sample points ``(x[i], y[i])``.
+        y : array_like, shape (M,) or (M, K)
+            y-coordinates of the sample points. Several data sets of sample
+            points sharing the same x-coordinates can be fitted at once by
+            passing in a 2D-array that contains one dataset per column.
+        deg : int or 1-D array_like
+            Degree(s) of the fitting polynomials. If `deg` is a single integer
+            all terms up to and including the `deg`'th term are included in the
+            fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+            degrees of the terms to include may be used instead.
+        domain : {None, [beg, end], []}, optional
+            Domain to use for the returned series. If ``None``,
+            then a minimal domain that covers the points `x` is chosen.  If
+            ``[]`` the class domain is used. The default value was the
+            class domain in NumPy 1.4 and ``None`` in later versions.
+            The ``[]`` option was added in numpy 1.5.0.
+        rcond : float, optional
+            Relative condition number of the fit. Singular values smaller
+            than this relative to the largest singular value will be
+            ignored. The default value is len(x)*eps, where eps is the
+            relative precision of the float type, about 2e-16 in most
+            cases.
+        full : bool, optional
+            Switch determining nature of return value. When it is False
+            (the default) just the coefficients are returned, when True
+            diagnostic information from the singular value decomposition is
+            also returned.
+        w : array_like, shape (M,), optional
+            Weights. If not None the contribution of each point
+            ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+            weights are chosen so that the errors of the products
+            ``w[i]*y[i]`` all have the same variance.  The default value is
+            None.
+
+            .. versionadded:: 1.5.0
+        window : {[beg, end]}, optional
+            Window to use for the returned series. The default
+            value is the default class domain
+
+            .. versionadded:: 1.6.0
+
+        Returns
+        -------
+        new_series : series
+            A series that represents the least squares fit to the data and
+            has the domain and window specified in the call. If the
+            coefficients for the unscaled and unshifted basis polynomials are
+            of interest, do ``new_series.convert().coef``.
+
+        [resid, rank, sv, rcond] : list
+            These values are only returned if `full` = True
+
+            resid -- sum of squared residuals of the least squares fit
+            rank -- the numerical rank of the scaled Vandermonde matrix
+            sv -- singular values of the scaled Vandermonde matrix
+            rcond -- value of `rcond`.
+
+            For more details, see `linalg.lstsq`.
+
+        """
+        if domain is None:
+            domain = pu.getdomain(x)
+        elif type(domain) is list and len(domain) == 0:
+            domain = cls.domain
+
+        if window is None:
+            window = cls.window
+
+        xnew = pu.mapdomain(x, domain, window)
+        res = cls._fit(xnew, y, deg, w=w, rcond=rcond, full=full)
+        if full:
+            [coef, status] = res
+            return cls(coef, domain=domain, window=window), status
+        else:
+            coef = res
+            return cls(coef, domain=domain, window=window)
+
+    @classmethod
+    def fromroots(cls, roots, domain=[], window=None):
+        """Return series instance that has the specified roots.
+
+        Returns a series representing the product
+        ``(x - r[0])*(x - r[1])*...*(x - r[n-1])``, where ``r`` is a
+        list of roots.
+
+        Parameters
+        ----------
+        roots : array_like
+            List of roots.
+        domain : {[], None, array_like}, optional
+            Domain for the resulting series. If None the domain is the
+            interval from the smallest root to the largest. If [] the
+            domain is the class domain. The default is [].
+        window : {None, array_like}, optional
+            Window for the returned series. If None the class window is
+            used. The default is None.
+
+        Returns
+        -------
+        new_series : series
+            Series with the specified roots.
+
+        """
+        [roots] = pu.as_series([roots], trim=False)
+        if domain is None:
+            domain = pu.getdomain(roots)
+        elif type(domain) is list and len(domain) == 0:
+            domain = cls.domain
+
+        if window is None:
+            window = cls.window
+
+        deg = len(roots)
+        off, scl = pu.mapparms(domain, window)
+        rnew = off + scl*roots
+        coef = cls._fromroots(rnew) / scl**deg
+        return cls(coef, domain=domain, window=window)
+
+    @classmethod
+    def identity(cls, domain=None, window=None):
+        """Identity function.
+
+        If ``p`` is the returned series, then ``p(x) == x`` for all
+        values of x.
+
+        Parameters
+        ----------
+        domain : {None, array_like}, optional
+            If given, the array must be of the form ``[beg, end]``, where
+            ``beg`` and ``end`` are the endpoints of the domain. If None is
+            given then the class domain is used. The default is None.
+        window : {None, array_like}, optional
+            If given, the resulting array must be if the form
+            ``[beg, end]``, where ``beg`` and ``end`` are the endpoints of
+            the window. If None is given then the class window is used. The
+            default is None.
+
+        Returns
+        -------
+        new_series : series
+             Series of representing the identity.
+
+        """
+        if domain is None:
+            domain = cls.domain
+        if window is None:
+            window = cls.window
+        off, scl = pu.mapparms(window, domain)
+        coef = cls._line(off, scl)
+        return cls(coef, domain, window)
+
+    @classmethod
+    def basis(cls, deg, domain=None, window=None):
+        """Series basis polynomial of degree `deg`.
+
+        Returns the series representing the basis polynomial of degree `deg`.
+
+        .. versionadded:: 1.7.0
+
+        Parameters
+        ----------
+        deg : int
+            Degree of the basis polynomial for the series. Must be >= 0.
+        domain : {None, array_like}, optional
+            If given, the array must be of the form ``[beg, end]``, where
+            ``beg`` and ``end`` are the endpoints of the domain. If None is
+            given then the class domain is used. The default is None.
+        window : {None, array_like}, optional
+            If given, the resulting array must be if the form
+            ``[beg, end]``, where ``beg`` and ``end`` are the endpoints of
+            the window. If None is given then the class window is used. The
+            default is None.
+
+        Returns
+        -------
+        new_series : series
+            A series with the coefficient of the `deg` term set to one and
+            all others zero.
+
+        """
+        if domain is None:
+            domain = cls.domain
+        if window is None:
+            window = cls.window
+        ideg = int(deg)
+
+        if ideg != deg or ideg < 0:
+            raise ValueError("deg must be non-negative integer")
+        return cls([0]*ideg + [1], domain, window)
+
+    @classmethod
+    def cast(cls, series, domain=None, window=None):
+        """Convert series to series of this class.
+
+        The `series` is expected to be an instance of some polynomial
+        series of one of the types supported by by the numpy.polynomial
+        module, but could be some other class that supports the convert
+        method.
+
+        .. versionadded:: 1.7.0
+
+        Parameters
+        ----------
+        series : series
+            The series instance to be converted.
+        domain : {None, array_like}, optional
+            If given, the array must be of the form ``[beg, end]``, where
+            ``beg`` and ``end`` are the endpoints of the domain. If None is
+            given then the class domain is used. The default is None.
+        window : {None, array_like}, optional
+            If given, the resulting array must be if the form
+            ``[beg, end]``, where ``beg`` and ``end`` are the endpoints of
+            the window. If None is given then the class window is used. The
+            default is None.
+
+        Returns
+        -------
+        new_series : series
+            A series of the same kind as the calling class and equal to
+            `series` when evaluated.
+
+        See Also
+        --------
+        convert : similar instance method
+
+        """
+        if domain is None:
+            domain = cls.domain
+        if window is None:
+            window = cls.window
+        return series.convert(domain, cls, window)
diff --git a/venv/Lib/site-packages/numpy/polynomial/chebyshev.py b/venv/Lib/site-packages/numpy/polynomial/chebyshev.py
new file mode 100644
index 000000000..4ddb0c688
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/chebyshev.py
@@ -0,0 +1,2064 @@
+"""
+====================================================
+Chebyshev Series (:mod:`numpy.polynomial.chebyshev`)
+====================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with Chebyshev series, including a `Chebyshev` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with such polynomials is in the
+docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+
+.. autosummary::
+   :toctree: generated/
+
+   Chebyshev
+
+
+Constants
+---------
+
+.. autosummary::
+   :toctree: generated/
+
+   chebdomain
+   chebzero
+   chebone
+   chebx
+
+Arithmetic
+----------
+
+.. autosummary::
+   :toctree: generated/
+
+   chebadd
+   chebsub
+   chebmulx
+   chebmul
+   chebdiv
+   chebpow
+   chebval
+   chebval2d
+   chebval3d
+   chebgrid2d
+   chebgrid3d
+
+Calculus
+--------
+
+.. autosummary::
+   :toctree: generated/
+
+   chebder
+   chebint
+
+Misc Functions
+--------------
+
+.. autosummary::
+   :toctree: generated/
+
+   chebfromroots
+   chebroots
+   chebvander
+   chebvander2d
+   chebvander3d
+   chebgauss
+   chebweight
+   chebcompanion
+   chebfit
+   chebpts1
+   chebpts2
+   chebtrim
+   chebline
+   cheb2poly
+   poly2cheb
+   chebinterpolate
+
+See also
+--------
+`numpy.polynomial`
+
+Notes
+-----
+The implementations of multiplication, division, integration, and
+differentiation use the algebraic identities [1]_:
+
+.. math ::
+    T_n(x) = \\frac{z^n + z^{-n}}{2} \\\\
+    z\\frac{dx}{dz} = \\frac{z - z^{-1}}{2}.
+
+where
+
+.. math :: x = \\frac{z + z^{-1}}{2}.
+
+These identities allow a Chebyshev series to be expressed as a finite,
+symmetric Laurent series.  In this module, this sort of Laurent series
+is referred to as a "z-series."
+
+References
+----------
+.. [1] A. T. Benjamin, et al., "Combinatorial Trigonometry with Chebyshev
+  Polynomials," *Journal of Statistical Planning and Inference 14*, 2008
+  (preprint: https://www.math.hmc.edu/~benjamin/papers/CombTrig.pdf, pg. 4)
+
+"""
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+__all__ = [
+    'chebzero', 'chebone', 'chebx', 'chebdomain', 'chebline', 'chebadd',
+    'chebsub', 'chebmulx', 'chebmul', 'chebdiv', 'chebpow', 'chebval',
+    'chebder', 'chebint', 'cheb2poly', 'poly2cheb', 'chebfromroots',
+    'chebvander', 'chebfit', 'chebtrim', 'chebroots', 'chebpts1',
+    'chebpts2', 'Chebyshev', 'chebval2d', 'chebval3d', 'chebgrid2d',
+    'chebgrid3d', 'chebvander2d', 'chebvander3d', 'chebcompanion',
+    'chebgauss', 'chebweight', 'chebinterpolate']
+
+chebtrim = pu.trimcoef
+
+#
+# A collection of functions for manipulating z-series. These are private
+# functions and do minimal error checking.
+#
+
+def _cseries_to_zseries(c):
+    """Covert Chebyshev series to z-series.
+
+    Covert a Chebyshev series to the equivalent z-series. The result is
+    never an empty array. The dtype of the return is the same as that of
+    the input. No checks are run on the arguments as this routine is for
+    internal use.
+
+    Parameters
+    ----------
+    c : 1-D ndarray
+        Chebyshev coefficients, ordered from low to high
+
+    Returns
+    -------
+    zs : 1-D ndarray
+        Odd length symmetric z-series, ordered from  low to high.
+
+    """
+    n = c.size
+    zs = np.zeros(2*n-1, dtype=c.dtype)
+    zs[n-1:] = c/2
+    return zs + zs[::-1]
+
+
+def _zseries_to_cseries(zs):
+    """Covert z-series to a Chebyshev series.
+
+    Covert a z series to the equivalent Chebyshev series. The result is
+    never an empty array. The dtype of the return is the same as that of
+    the input. No checks are run on the arguments as this routine is for
+    internal use.
+
+    Parameters
+    ----------
+    zs : 1-D ndarray
+        Odd length symmetric z-series, ordered from  low to high.
+
+    Returns
+    -------
+    c : 1-D ndarray
+        Chebyshev coefficients, ordered from  low to high.
+
+    """
+    n = (zs.size + 1)//2
+    c = zs[n-1:].copy()
+    c[1:n] *= 2
+    return c
+
+
+def _zseries_mul(z1, z2):
+    """Multiply two z-series.
+
+    Multiply two z-series to produce a z-series.
+
+    Parameters
+    ----------
+    z1, z2 : 1-D ndarray
+        The arrays must be 1-D but this is not checked.
+
+    Returns
+    -------
+    product : 1-D ndarray
+        The product z-series.
+
+    Notes
+    -----
+    This is simply convolution. If symmetric/anti-symmetric z-series are
+    denoted by S/A then the following rules apply:
+
+    S*S, A*A -> S
+    S*A, A*S -> A
+
+    """
+    return np.convolve(z1, z2)
+
+
+def _zseries_div(z1, z2):
+    """Divide the first z-series by the second.
+
+    Divide `z1` by `z2` and return the quotient and remainder as z-series.
+    Warning: this implementation only applies when both z1 and z2 have the
+    same symmetry, which is sufficient for present purposes.
+
+    Parameters
+    ----------
+    z1, z2 : 1-D ndarray
+        The arrays must be 1-D and have the same symmetry, but this is not
+        checked.
+
+    Returns
+    -------
+
+    (quotient, remainder) : 1-D ndarrays
+        Quotient and remainder as z-series.
+
+    Notes
+    -----
+    This is not the same as polynomial division on account of the desired form
+    of the remainder. If symmetric/anti-symmetric z-series are denoted by S/A
+    then the following rules apply:
+
+    S/S -> S,S
+    A/A -> S,A
+
+    The restriction to types of the same symmetry could be fixed but seems like
+    unneeded generality. There is no natural form for the remainder in the case
+    where there is no symmetry.
+
+    """
+    z1 = z1.copy()
+    z2 = z2.copy()
+    lc1 = len(z1)
+    lc2 = len(z2)
+    if lc2 == 1:
+        z1 /= z2
+        return z1, z1[:1]*0
+    elif lc1 < lc2:
+        return z1[:1]*0, z1
+    else:
+        dlen = lc1 - lc2
+        scl = z2[0]
+        z2 /= scl
+        quo = np.empty(dlen + 1, dtype=z1.dtype)
+        i = 0
+        j = dlen
+        while i < j:
+            r = z1[i]
+            quo[i] = z1[i]
+            quo[dlen - i] = r
+            tmp = r*z2
+            z1[i:i+lc2] -= tmp
+            z1[j:j+lc2] -= tmp
+            i += 1
+            j -= 1
+        r = z1[i]
+        quo[i] = r
+        tmp = r*z2
+        z1[i:i+lc2] -= tmp
+        quo /= scl
+        rem = z1[i+1:i-1+lc2].copy()
+        return quo, rem
+
+
+def _zseries_der(zs):
+    """Differentiate a z-series.
+
+    The derivative is with respect to x, not z. This is achieved using the
+    chain rule and the value of dx/dz given in the module notes.
+
+    Parameters
+    ----------
+    zs : z-series
+        The z-series to differentiate.
+
+    Returns
+    -------
+    derivative : z-series
+        The derivative
+
+    Notes
+    -----
+    The zseries for x (ns) has been multiplied by two in order to avoid
+    using floats that are incompatible with Decimal and likely other
+    specialized scalar types. This scaling has been compensated by
+    multiplying the value of zs by two also so that the two cancels in the
+    division.
+
+    """
+    n = len(zs)//2
+    ns = np.array([-1, 0, 1], dtype=zs.dtype)
+    zs *= np.arange(-n, n+1)*2
+    d, r = _zseries_div(zs, ns)
+    return d
+
+
+def _zseries_int(zs):
+    """Integrate a z-series.
+
+    The integral is with respect to x, not z. This is achieved by a change
+    of variable using dx/dz given in the module notes.
+
+    Parameters
+    ----------
+    zs : z-series
+        The z-series to integrate
+
+    Returns
+    -------
+    integral : z-series
+        The indefinite integral
+
+    Notes
+    -----
+    The zseries for x (ns) has been multiplied by two in order to avoid
+    using floats that are incompatible with Decimal and likely other
+    specialized scalar types. This scaling has been compensated by
+    dividing the resulting zs by two.
+
+    """
+    n = 1 + len(zs)//2
+    ns = np.array([-1, 0, 1], dtype=zs.dtype)
+    zs = _zseries_mul(zs, ns)
+    div = np.arange(-n, n+1)*2
+    zs[:n] /= div[:n]
+    zs[n+1:] /= div[n+1:]
+    zs[n] = 0
+    return zs
+
+#
+# Chebyshev series functions
+#
+
+
+def poly2cheb(pol):
+    """
+    Convert a polynomial to a Chebyshev series.
+
+    Convert an array representing the coefficients of a polynomial (relative
+    to the "standard" basis) ordered from lowest degree to highest, to an
+    array of the coefficients of the equivalent Chebyshev series, ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    pol : array_like
+        1-D array containing the polynomial coefficients
+
+    Returns
+    -------
+    c : ndarray
+        1-D array containing the coefficients of the equivalent Chebyshev
+        series.
+
+    See Also
+    --------
+    cheb2poly
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy import polynomial as P
+    >>> p = P.Polynomial(range(4))
+    >>> p
+    Polynomial([0., 1., 2., 3.], domain=[-1,  1], window=[-1,  1])
+    >>> c = p.convert(kind=P.Chebyshev)
+    >>> c
+    Chebyshev([1.  , 3.25, 1.  , 0.75], domain=[-1.,  1.], window=[-1.,  1.])
+    >>> P.chebyshev.poly2cheb(range(4))
+    array([1.  , 3.25, 1.  , 0.75])
+
+    """
+    [pol] = pu.as_series([pol])
+    deg = len(pol) - 1
+    res = 0
+    for i in range(deg, -1, -1):
+        res = chebadd(chebmulx(res), pol[i])
+    return res
+
+
+def cheb2poly(c):
+    """
+    Convert a Chebyshev series to a polynomial.
+
+    Convert an array representing the coefficients of a Chebyshev series,
+    ordered from lowest degree to highest, to an array of the coefficients
+    of the equivalent polynomial (relative to the "standard" basis) ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array containing the Chebyshev series coefficients, ordered
+        from lowest order term to highest.
+
+    Returns
+    -------
+    pol : ndarray
+        1-D array containing the coefficients of the equivalent polynomial
+        (relative to the "standard" basis) ordered from lowest order term
+        to highest.
+
+    See Also
+    --------
+    poly2cheb
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy import polynomial as P
+    >>> c = P.Chebyshev(range(4))
+    >>> c
+    Chebyshev([0., 1., 2., 3.], domain=[-1,  1], window=[-1,  1])
+    >>> p = c.convert(kind=P.Polynomial)
+    >>> p
+    Polynomial([-2., -8.,  4., 12.], domain=[-1.,  1.], window=[-1.,  1.])
+    >>> P.chebyshev.cheb2poly(range(4))
+    array([-2.,  -8.,   4.,  12.])
+
+    """
+    from .polynomial import polyadd, polysub, polymulx
+
+    [c] = pu.as_series([c])
+    n = len(c)
+    if n < 3:
+        return c
+    else:
+        c0 = c[-2]
+        c1 = c[-1]
+        # i is the current degree of c1
+        for i in range(n - 1, 1, -1):
+            tmp = c0
+            c0 = polysub(c[i - 2], c1)
+            c1 = polyadd(tmp, polymulx(c1)*2)
+        return polyadd(c0, polymulx(c1))
+
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Chebyshev default domain.
+chebdomain = np.array([-1, 1])
+
+# Chebyshev coefficients representing zero.
+chebzero = np.array([0])
+
+# Chebyshev coefficients representing one.
+chebone = np.array([1])
+
+# Chebyshev coefficients representing the identity x.
+chebx = np.array([0, 1])
+
+
+def chebline(off, scl):
+    """
+    Chebyshev series whose graph is a straight line.
+
+
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The specified line is given by ``off + scl*x``.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the Chebyshev series for
+        ``off + scl*x``.
+
+    See Also
+    --------
+    polyline
+
+    Examples
+    --------
+    >>> import numpy.polynomial.chebyshev as C
+    >>> C.chebline(3,2)
+    array([3, 2])
+    >>> C.chebval(-3, C.chebline(3,2)) # should be -3
+    -3.0
+
+    """
+    if scl != 0:
+        return np.array([off, scl])
+    else:
+        return np.array([off])
+
+
+def chebfromroots(roots):
+    """
+    Generate a Chebyshev series with given roots.
+
+    The function returns the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    in Chebyshev form, where the `r_n` are the roots specified in `roots`.
+    If a zero has multiplicity n, then it must appear in `roots` n times.
+    For instance, if 2 is a root of multiplicity three and 3 is a root of
+    multiplicity 2, then `roots` looks something like [2, 2, 2, 3, 3]. The
+    roots can appear in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * T_1(x) + ... +  c_n * T_n(x)
+
+    The coefficient of the last term is not generally 1 for monic
+    polynomials in Chebyshev form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of coefficients.  If all roots are real then `out` is a
+        real array, if some of the roots are complex, then `out` is complex
+        even if all the coefficients in the result are real (see Examples
+        below).
+
+    See Also
+    --------
+    polyfromroots, legfromroots, lagfromroots, hermfromroots, hermefromroots
+
+    Examples
+    --------
+    >>> import numpy.polynomial.chebyshev as C
+    >>> C.chebfromroots((-1,0,1)) # x^3 - x relative to the standard basis
+    array([ 0.  , -0.25,  0.  ,  0.25])
+    >>> j = complex(0,1)
+    >>> C.chebfromroots((-j,j)) # x^2 + 1 relative to the standard basis
+    array([1.5+0.j, 0. +0.j, 0.5+0.j])
+
+    """
+    return pu._fromroots(chebline, chebmul, roots)
+
+
+def chebadd(c1, c2):
+    """
+    Add one Chebyshev series to another.
+
+    Returns the sum of two Chebyshev series `c1` + `c2`.  The arguments
+    are sequences of coefficients ordered from lowest order term to
+    highest, i.e., [1,2,3] represents the series ``T_0 + 2*T_1 + 3*T_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Chebyshev series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the Chebyshev series of their sum.
+
+    See Also
+    --------
+    chebsub, chebmulx, chebmul, chebdiv, chebpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the sum of two Chebyshev series
+    is a Chebyshev series (without having to "reproject" the result onto
+    the basis set) so addition, just like that of "standard" polynomials,
+    is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> C.chebadd(c1,c2)
+    array([4., 4., 4.])
+
+    """
+    return pu._add(c1, c2)
+
+
+def chebsub(c1, c2):
+    """
+    Subtract one Chebyshev series from another.
+
+    Returns the difference of two Chebyshev series `c1` - `c2`.  The
+    sequences of coefficients are from lowest order term to highest, i.e.,
+    [1,2,3] represents the series ``T_0 + 2*T_1 + 3*T_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Chebyshev series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Chebyshev series coefficients representing their difference.
+
+    See Also
+    --------
+    chebadd, chebmulx, chebmul, chebdiv, chebpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the difference of two Chebyshev
+    series is a Chebyshev series (without having to "reproject" the result
+    onto the basis set) so subtraction, just like that of "standard"
+    polynomials, is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> C.chebsub(c1,c2)
+    array([-2.,  0.,  2.])
+    >>> C.chebsub(c2,c1) # -C.chebsub(c1,c2)
+    array([ 2.,  0., -2.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def chebmulx(c):
+    """Multiply a Chebyshev series by x.
+
+    Multiply the polynomial `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Chebyshev series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.5.0
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> C.chebmulx([1,2,3])
+    array([1. , 2.5, 1. , 1.5])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]*0
+    prd[1] = c[0]
+    if len(c) > 1:
+        tmp = c[1:]/2
+        prd[2:] = tmp
+        prd[0:-2] += tmp
+    return prd
+
+
+def chebmul(c1, c2):
+    """
+    Multiply one Chebyshev series by another.
+
+    Returns the product of two Chebyshev series `c1` * `c2`.  The arguments
+    are sequences of coefficients, from lowest order "term" to highest,
+    e.g., [1,2,3] represents the series ``T_0 + 2*T_1 + 3*T_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Chebyshev series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Chebyshev series coefficients representing their product.
+
+    See Also
+    --------
+    chebadd, chebsub, chebmulx, chebdiv, chebpow
+
+    Notes
+    -----
+    In general, the (polynomial) product of two C-series results in terms
+    that are not in the Chebyshev polynomial basis set.  Thus, to express
+    the product as a C-series, it is typically necessary to "reproject"
+    the product onto said basis set, which typically produces
+    "unintuitive live" (but correct) results; see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> C.chebmul(c1,c2) # multiplication requires "reprojection"
+    array([  6.5,  12. ,  12. ,   4. ,   1.5])
+
+    """
+    # c1, c2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+    z1 = _cseries_to_zseries(c1)
+    z2 = _cseries_to_zseries(c2)
+    prd = _zseries_mul(z1, z2)
+    ret = _zseries_to_cseries(prd)
+    return pu.trimseq(ret)
+
+
+def chebdiv(c1, c2):
+    """
+    Divide one Chebyshev series by another.
+
+    Returns the quotient-with-remainder of two Chebyshev series
+    `c1` / `c2`.  The arguments are sequences of coefficients from lowest
+    order "term" to highest, e.g., [1,2,3] represents the series
+    ``T_0 + 2*T_1 + 3*T_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Chebyshev series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    [quo, rem] : ndarrays
+        Of Chebyshev series coefficients representing the quotient and
+        remainder.
+
+    See Also
+    --------
+    chebadd, chebsub, chemulx, chebmul, chebpow
+
+    Notes
+    -----
+    In general, the (polynomial) division of one C-series by another
+    results in quotient and remainder terms that are not in the Chebyshev
+    polynomial basis set.  Thus, to express these results as C-series, it
+    is typically necessary to "reproject" the results onto said basis
+    set, which typically produces "unintuitive" (but correct) results;
+    see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> C.chebdiv(c1,c2) # quotient "intuitive," remainder not
+    (array([3.]), array([-8., -4.]))
+    >>> c2 = (0,1,2,3)
+    >>> C.chebdiv(c2,c1) # neither "intuitive"
+    (array([0., 2.]), array([-2., -4.]))
+
+    """
+    # c1, c2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+    if c2[-1] == 0:
+        raise ZeroDivisionError()
+
+    # note: this is more efficient than `pu._div(chebmul, c1, c2)`
+    lc1 = len(c1)
+    lc2 = len(c2)
+    if lc1 < lc2:
+        return c1[:1]*0, c1
+    elif lc2 == 1:
+        return c1/c2[-1], c1[:1]*0
+    else:
+        z1 = _cseries_to_zseries(c1)
+        z2 = _cseries_to_zseries(c2)
+        quo, rem = _zseries_div(z1, z2)
+        quo = pu.trimseq(_zseries_to_cseries(quo))
+        rem = pu.trimseq(_zseries_to_cseries(rem))
+        return quo, rem
+
+
+def chebpow(c, pow, maxpower=16):
+    """Raise a Chebyshev series to a power.
+
+    Returns the Chebyshev series `c` raised to the power `pow`. The
+    argument `c` is a sequence of coefficients ordered from low to high.
+    i.e., [1,2,3] is the series  ``T_0 + 2*T_1 + 3*T_2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Chebyshev series coefficients ordered from low to
+        high.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Chebyshev series of power.
+
+    See Also
+    --------
+    chebadd, chebsub, chebmulx, chebmul, chebdiv
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> C.chebpow([1, 2, 3, 4], 2)
+    array([15.5, 22. , 16. , ..., 12.5, 12. ,  8. ])
+
+    """
+    # note: this is more efficient than `pu._pow(chebmul, c1, c2)`, as it
+    # avoids converting between z and c series repeatedly
+
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    power = int(pow)
+    if power != pow or power < 0:
+        raise ValueError("Power must be a non-negative integer.")
+    elif maxpower is not None and power > maxpower:
+        raise ValueError("Power is too large")
+    elif power == 0:
+        return np.array([1], dtype=c.dtype)
+    elif power == 1:
+        return c
+    else:
+        # This can be made more efficient by using powers of two
+        # in the usual way.
+        zs = _cseries_to_zseries(c)
+        prd = zs
+        for i in range(2, power + 1):
+            prd = np.convolve(prd, zs)
+        return _zseries_to_cseries(prd)
+
+
+def chebder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a Chebyshev series.
+
+    Returns the Chebyshev series coefficients `c` differentiated `m` times
+    along `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable). The argument
+    `c` is an array of coefficients from low to high degree along each
+    axis, e.g., [1,2,3] represents the series ``1*T_0 + 2*T_1 + 3*T_2``
+    while [[1,2],[1,2]] represents ``1*T_0(x)*T_0(y) + 1*T_1(x)*T_0(y) +
+    2*T_0(x)*T_1(y) + 2*T_1(x)*T_1(y)`` if axis=0 is ``x`` and axis=1 is
+    ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Chebyshev series coefficients. If c is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change of
+        variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Chebyshev series of the derivative.
+
+    See Also
+    --------
+    chebint
+
+    Notes
+    -----
+    In general, the result of differentiating a C-series needs to be
+    "reprojected" onto the C-series basis set. Thus, typically, the
+    result of this function is "unintuitive," albeit correct; see Examples
+    section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c = (1,2,3,4)
+    >>> C.chebder(c)
+    array([14., 12., 24.])
+    >>> C.chebder(c,3)
+    array([96.])
+    >>> C.chebder(c,scl=-1)
+    array([-14., -12., -24.])
+    >>> C.chebder(c,2,-1)
+    array([12.,  96.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=c.dtype)
+            for j in range(n, 2, -1):
+                der[j - 1] = (2*j)*c[j]
+                c[j - 2] += (j*c[j])/(j - 2)
+            if n > 1:
+                der[1] = 4*c[2]
+            der[0] = c[1]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def chebint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a Chebyshev series.
+
+    Returns the Chebyshev series coefficients `c` integrated `m` times from
+    `lbnd` along `axis`. At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.)  The argument `c` is an array of
+    coefficients from low to high degree along each axis, e.g., [1,2,3]
+    represents the series ``T_0 + 2*T_1 + 3*T_2`` while [[1,2],[1,2]]
+    represents ``1*T_0(x)*T_0(y) + 1*T_1(x)*T_0(y) + 2*T_0(x)*T_1(y) +
+    2*T_1(x)*T_1(y)`` if axis=0 is ``x`` and axis=1 is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Chebyshev series coefficients. If c is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at zero
+        is the first value in the list, the value of the second integral
+        at zero is the second value, etc.  If ``k == []`` (the default),
+        all constants are set to zero.  If ``m == 1``, a single scalar can
+        be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        C-series coefficients of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 1``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    chebder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.
+    Why is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`.  Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a`- perhaps not what one would have first thought.
+
+    Also note that, in general, the result of integrating a C-series needs
+    to be "reprojected" onto the C-series basis set.  Thus, typically,
+    the result of this function is "unintuitive," albeit correct; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import chebyshev as C
+    >>> c = (1,2,3)
+    >>> C.chebint(c)
+    array([ 0.5, -0.5,  0.5,  0.5])
+    >>> C.chebint(c,3)
+    array([ 0.03125   , -0.1875    ,  0.04166667, -0.05208333,  0.01041667, # may vary
+        0.00625   ])
+    >>> C.chebint(c, k=3)
+    array([ 3.5, -0.5,  0.5,  0.5])
+    >>> C.chebint(c,lbnd=-2)
+    array([ 8.5, -0.5,  0.5,  0.5])
+    >>> C.chebint(c,scl=-2)
+    array([-1.,  1., -1., -1.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    k = list(k) + [0]*(cnt - len(k))
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=c.dtype)
+            tmp[0] = c[0]*0
+            tmp[1] = c[0]
+            if n > 1:
+                tmp[2] = c[1]/4
+            for j in range(2, n):
+                tmp[j + 1] = c[j]/(2*(j + 1))
+                tmp[j - 1] -= c[j]/(2*(j - 1))
+            tmp[0] += k[i] - chebval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def chebval(x, c, tensor=True):
+    """
+    Evaluate a Chebyshev series at points x.
+
+    If `c` is of length `n + 1`, this function returns the value:
+
+    .. math:: p(x) = c_0 * T_0(x) + c_1 * T_1(x) + ... + c_n * T_n(x)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, algebra_like
+        The shape of the return value is described above.
+
+    See Also
+    --------
+    chebval2d, chebgrid2d, chebval3d, chebgrid3d
+
+    Notes
+    -----
+    The evaluation uses Clenshaw recursion, aka synthetic division.
+
+    Examples
+    --------
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    if len(c) == 1:
+        c0 = c[0]
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]
+        c1 = c[1]
+    else:
+        x2 = 2*x
+        c0 = c[-2]
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            c0 = c[-i] - c1
+            c1 = tmp + c1*x2
+    return c0 + c1*x
+
+
+def chebval2d(x, y, c):
+    """
+    Evaluate a 2-D Chebyshev series at points (x, y).
+
+    This function returns the values:
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * T_i(x) * T_j(y)
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` is a 1-D array a one is implicitly appended to its shape to make
+    it 2-D. The shape of the result will be c.shape[2:] + x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and if it isn't an ndarray it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in ``c[i,j]``. If `c` has
+        dimension greater than 2 the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional Chebyshev series at points formed
+        from pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    chebval, chebgrid2d, chebval3d, chebgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(chebval, c, x, y)
+
+
+def chebgrid2d(x, y, c):
+    """
+    Evaluate a 2-D Chebyshev series on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * T_i(a) * T_j(b),
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape + y.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j is contained in `c[i,j]`. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional Chebyshev series at points in the
+        Cartesian product of `x` and `y`.
+
+    See Also
+    --------
+    chebval, chebval2d, chebval3d, chebgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(chebval, c, x, y)
+
+
+def chebval3d(x, y, z, c):
+    """
+    Evaluate a 3-D Chebyshev series at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * T_i(x) * T_j(y) * T_k(z)
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimensional polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    chebval, chebval2d, chebgrid2d, chebgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(chebval, c, x, y, z)
+
+
+def chebgrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D Chebyshev series on the Cartesian product of x, y, and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * T_i(a) * T_j(b) * T_k(c)
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    chebval, chebval2d, chebgrid2d, chebval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(chebval, c, x, y, z)
+
+
+def chebvander(x, deg):
+    """Pseudo-Vandermonde matrix of given degree.
+
+    Returns the pseudo-Vandermonde matrix of degree `deg` and sample points
+    `x`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = T_i(x),
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the degree of the Chebyshev polynomial.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    matrix ``V = chebvander(x, n)``, then ``np.dot(V, c)`` and
+    ``chebval(x, c)`` are the same up to roundoff.  This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of Chebyshev series of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray
+        The pseudo Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where The last index is the degree of the
+        corresponding Chebyshev polynomial.  The dtype will be the same as
+        the converted `x`.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    # Use forward recursion to generate the entries.
+    v[0] = x*0 + 1
+    if ideg > 0:
+        x2 = 2*x
+        v[1] = x
+        for i in range(2, ideg + 1):
+            v[i] = v[i-1]*x2 - v[i-2]
+    return np.moveaxis(v, 0, -1)
+
+
+def chebvander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = T_i(x) * T_j(y),
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the degrees of
+    the Chebyshev polynomials.
+
+    If ``V = chebvander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``chebval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D Chebyshev
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    chebvander, chebvander3d, chebval2d, chebval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((chebvander, chebvander), (x, y), deg)
+
+
+def chebvander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = T_i(x)*T_j(y)*T_k(z),
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the degrees of the Chebyshev polynomials.
+
+    If ``V = chebvander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and ``np.dot(V, c.flat)`` and ``chebval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D Chebyshev
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    chebvander, chebvander3d, chebval2d, chebval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((chebvander, chebvander, chebvander), (x, y, z), deg)
+
+
+def chebfit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least squares fit of Chebyshev series to data.
+
+    Return the coefficients of a Chebyshev series of degree `deg` that is the
+    least squares fit to the data values `y` given at points `x`. If `y` is
+    1-D the returned coefficients will also be 1-D. If `y` is 2-D multiple
+    fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * T_1(x) + ... + c_n * T_n(x),
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer,
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+        .. versionadded:: 1.5.0
+
+    Returns
+    -------
+    coef : ndarray, shape (M,) or (M, K)
+        Chebyshev coefficients ordered from low to high. If `y` was 2-D,
+        the coefficients for the data in column k  of `y` are in column
+        `k`.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.  The
+        warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    polyfit, legfit, lagfit, hermfit, hermefit
+    chebval : Evaluates a Chebyshev series.
+    chebvander : Vandermonde matrix of Chebyshev series.
+    chebweight : Chebyshev weight function.
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the Chebyshev series `p` that
+    minimizes the sum of the weighted squared errors
+
+    .. math:: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where :math:`w_j` are the weights. This problem is solved by setting up
+    as the (typically) overdetermined matrix equation
+
+    .. math:: V(x) * c = w * y,
+
+    where `V` is the weighted pseudo Vandermonde matrix of `x`, `c` are the
+    coefficients to be solved for, `w` are the weights, and `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected, then a `RankWarning` will be issued. This means that the
+    coefficient values may be poorly determined. Using a lower order fit
+    will usually get rid of the warning.  The `rcond` parameter can also be
+    set to a value smaller than its default, but the resulting fit may be
+    spurious and have large contributions from roundoff error.
+
+    Fits using Chebyshev series are usually better conditioned than fits
+    using power series, but much can depend on the distribution of the
+    sample points and the smoothness of the data. If the quality of the fit
+    is inadequate splines may be a good alternative.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+
+    Examples
+    --------
+
+    """
+    return pu._fit(chebvander, x, y, deg, rcond, full, w)
+
+
+def chebcompanion(c):
+    """Return the scaled companion matrix of c.
+
+    The basis polynomials are scaled so that the companion matrix is
+    symmetric when `c` is a Chebyshev basis polynomial. This provides
+    better eigenvalue estimates than the unscaled case and for basis
+    polynomials the eigenvalues are guaranteed to be real if
+    `numpy.linalg.eigvalsh` is used to obtain them.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Chebyshev series coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Scaled companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[-c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    scl = np.array([1.] + [np.sqrt(.5)]*(n-1))
+    top = mat.reshape(-1)[1::n+1]
+    bot = mat.reshape(-1)[n::n+1]
+    top[0] = np.sqrt(.5)
+    top[1:] = 1/2
+    bot[...] = top
+    mat[:, -1] -= (c[:-1]/c[-1])*(scl/scl[-1])*.5
+    return mat
+
+
+def chebroots(c):
+    """
+    Compute the roots of a Chebyshev series.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * T_i(x).
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the series. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    polyroots, legroots, lagroots, hermroots, hermeroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the series for such
+    values. Roots with multiplicity greater than 1 will also show larger
+    errors as the value of the series near such points is relatively
+    insensitive to errors in the roots. Isolated roots near the origin can
+    be improved by a few iterations of Newton's method.
+
+    The Chebyshev series basis polynomials aren't powers of `x` so the
+    results of this function may seem unintuitive.
+
+    Examples
+    --------
+    >>> import numpy.polynomial.chebyshev as cheb
+    >>> cheb.chebroots((-1, 1,-1, 1)) # T3 - T2 + T1 - T0 has real roots
+    array([ -5.00000000e-01,   2.60860684e-17,   1.00000000e+00]) # may vary
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([-c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = chebcompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+def chebinterpolate(func, deg, args=()):
+    """Interpolate a function at the Chebyshev points of the first kind.
+
+    Returns the Chebyshev series that interpolates `func` at the Chebyshev
+    points of the first kind in the interval [-1, 1]. The interpolating
+    series tends to a minmax approximation to `func` with increasing `deg`
+    if the function is continuous in the interval.
+
+    .. versionadded:: 1.14.0
+
+    Parameters
+    ----------
+    func : function
+        The function to be approximated. It must be a function of a single
+        variable of the form ``f(x, a, b, c...)``, where ``a, b, c...`` are
+        extra arguments passed in the `args` parameter.
+    deg : int
+        Degree of the interpolating polynomial
+    args : tuple, optional
+        Extra arguments to be used in the function call. Default is no extra
+        arguments.
+
+    Returns
+    -------
+    coef : ndarray, shape (deg + 1,)
+        Chebyshev coefficients of the interpolating series ordered from low to
+        high.
+
+    Examples
+    --------
+    >>> import numpy.polynomial.chebyshev as C
+    >>> C.chebfromfunction(lambda x: np.tanh(x) + 0.5, 8)
+    array([  5.00000000e-01,   8.11675684e-01,  -9.86864911e-17,
+            -5.42457905e-02,  -2.71387850e-16,   4.51658839e-03,
+             2.46716228e-17,  -3.79694221e-04,  -3.26899002e-16])
+
+    Notes
+    -----
+
+    The Chebyshev polynomials used in the interpolation are orthogonal when
+    sampled at the Chebyshev points of the first kind. If it is desired to
+    constrain some of the coefficients they can simply be set to the desired
+    value after the interpolation, no new interpolation or fit is needed. This
+    is especially useful if it is known apriori that some of coefficients are
+    zero. For instance, if the function is even then the coefficients of the
+    terms of odd degree in the result can be set to zero.
+
+    """
+    deg = np.asarray(deg)
+
+    # check arguments.
+    if deg.ndim > 0 or deg.dtype.kind not in 'iu' or deg.size == 0:
+        raise TypeError("deg must be an int")
+    if deg < 0:
+        raise ValueError("expected deg >= 0")
+
+    order = deg + 1
+    xcheb = chebpts1(order)
+    yfunc = func(xcheb, *args)
+    m = chebvander(xcheb, deg)
+    c = np.dot(m.T, yfunc)
+    c[0] /= order
+    c[1:] /= 0.5*order
+
+    return c
+
+
+def chebgauss(deg):
+    """
+    Gauss-Chebyshev quadrature.
+
+    Computes the sample points and weights for Gauss-Chebyshev quadrature.
+    These sample points and weights will correctly integrate polynomials of
+    degree :math:`2*deg - 1` or less over the interval :math:`[-1, 1]` with
+    the weight function :math:`f(x) = 1/\\sqrt{1 - x^2}`.
+
+    Parameters
+    ----------
+    deg : int
+        Number of sample points and weights. It must be >= 1.
+
+    Returns
+    -------
+    x : ndarray
+        1-D ndarray containing the sample points.
+    y : ndarray
+        1-D ndarray containing the weights.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    The results have only been tested up to degree 100, higher degrees may
+    be problematic. For Gauss-Chebyshev there are closed form solutions for
+    the sample points and weights. If n = `deg`, then
+
+    .. math:: x_i = \\cos(\\pi (2 i - 1) / (2 n))
+
+    .. math:: w_i = \\pi / n
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg <= 0:
+        raise ValueError("deg must be a positive integer")
+
+    x = np.cos(np.pi * np.arange(1, 2*ideg, 2) / (2.0*ideg))
+    w = np.ones(ideg)*(np.pi/ideg)
+
+    return x, w
+
+
+def chebweight(x):
+    """
+    The weight function of the Chebyshev polynomials.
+
+    The weight function is :math:`1/\\sqrt{1 - x^2}` and the interval of
+    integration is :math:`[-1, 1]`. The Chebyshev polynomials are
+    orthogonal, but not normalized, with respect to this weight function.
+
+    Parameters
+    ----------
+    x : array_like
+       Values at which the weight function will be computed.
+
+    Returns
+    -------
+    w : ndarray
+       The weight function at `x`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    w = 1./(np.sqrt(1. + x) * np.sqrt(1. - x))
+    return w
+
+
+def chebpts1(npts):
+    """
+    Chebyshev points of the first kind.
+
+    The Chebyshev points of the first kind are the points ``cos(x)``,
+    where ``x = [pi*(k + .5)/npts for k in range(npts)]``.
+
+    Parameters
+    ----------
+    npts : int
+        Number of sample points desired.
+
+    Returns
+    -------
+    pts : ndarray
+        The Chebyshev points of the first kind.
+
+    See Also
+    --------
+    chebpts2
+
+    Notes
+    -----
+
+    .. versionadded:: 1.5.0
+
+    """
+    _npts = int(npts)
+    if _npts != npts:
+        raise ValueError("npts must be integer")
+    if _npts < 1:
+        raise ValueError("npts must be >= 1")
+
+    x = np.linspace(-np.pi, 0, _npts, endpoint=False) + np.pi/(2*_npts)
+    return np.cos(x)
+
+
+def chebpts2(npts):
+    """
+    Chebyshev points of the second kind.
+
+    The Chebyshev points of the second kind are the points ``cos(x)``,
+    where ``x = [pi*k/(npts - 1) for k in range(npts)]``.
+
+    Parameters
+    ----------
+    npts : int
+        Number of sample points desired.
+
+    Returns
+    -------
+    pts : ndarray
+        The Chebyshev points of the second kind.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.5.0
+
+    """
+    _npts = int(npts)
+    if _npts != npts:
+        raise ValueError("npts must be integer")
+    if _npts < 2:
+        raise ValueError("npts must be >= 2")
+
+    x = np.linspace(-np.pi, 0, _npts)
+    return np.cos(x)
+
+
+#
+# Chebyshev series class
+#
+
+class Chebyshev(ABCPolyBase):
+    """A Chebyshev series class.
+
+    The Chebyshev class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    methods listed below.
+
+    Parameters
+    ----------
+    coef : array_like
+        Chebyshev coefficients in order of increasing degree, i.e.,
+        ``(1, 2, 3)`` gives ``1*T_0(x) + 2*T_1(x) + 3*T_2(x)``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [-1, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [-1, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(chebadd)
+    _sub = staticmethod(chebsub)
+    _mul = staticmethod(chebmul)
+    _div = staticmethod(chebdiv)
+    _pow = staticmethod(chebpow)
+    _val = staticmethod(chebval)
+    _int = staticmethod(chebint)
+    _der = staticmethod(chebder)
+    _fit = staticmethod(chebfit)
+    _line = staticmethod(chebline)
+    _roots = staticmethod(chebroots)
+    _fromroots = staticmethod(chebfromroots)
+
+    @classmethod
+    def interpolate(cls, func, deg, domain=None, args=()):
+        """Interpolate a function at the Chebyshev points of the first kind.
+
+        Returns the series that interpolates `func` at the Chebyshev points of
+        the first kind scaled and shifted to the `domain`. The resulting series
+        tends to a minmax approximation of `func` when the function is
+        continuous in the domain.
+
+        .. versionadded:: 1.14.0
+
+        Parameters
+        ----------
+        func : function
+            The function to be interpolated. It must be a function of a single
+            variable of the form ``f(x, a, b, c...)``, where ``a, b, c...`` are
+            extra arguments passed in the `args` parameter.
+        deg : int
+            Degree of the interpolating polynomial.
+        domain : {None, [beg, end]}, optional
+            Domain over which `func` is interpolated. The default is None, in
+            which case the domain is [-1, 1].
+        args : tuple, optional
+            Extra arguments to be used in the function call. Default is no
+            extra arguments.
+
+        Returns
+        -------
+        polynomial : Chebyshev instance
+            Interpolating Chebyshev instance.
+
+        Notes
+        -----
+        See `numpy.polynomial.chebfromfunction` for more details.
+
+        """
+        if domain is None:
+            domain = cls.domain
+        xfunc = lambda x: func(pu.mapdomain(x, cls.window, domain), *args)
+        coef = chebinterpolate(xfunc, deg)
+        return cls(coef, domain=domain)
+
+    # Virtual properties
+    nickname = 'cheb'
+    domain = np.array(chebdomain)
+    window = np.array(chebdomain)
+    basis_name = 'T'
diff --git a/venv/Lib/site-packages/numpy/polynomial/hermite.py b/venv/Lib/site-packages/numpy/polynomial/hermite.py
new file mode 100644
index 000000000..487d8dfdb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/hermite.py
@@ -0,0 +1,1681 @@
+"""
+==============================================================
+Hermite Series, "Physicists" (:mod:`numpy.polynomial.hermite`)
+==============================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with Hermite series, including a `Hermite` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with such polynomials is in the
+docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+.. autosummary::
+   :toctree: generated/
+
+   Hermite
+
+Constants
+---------
+.. autosummary::
+   :toctree: generated/
+
+   hermdomain
+   hermzero
+   hermone
+   hermx
+
+Arithmetic
+----------
+.. autosummary::
+   :toctree: generated/
+
+   hermadd
+   hermsub
+   hermmulx
+   hermmul
+   hermdiv
+   hermpow
+   hermval
+   hermval2d
+   hermval3d
+   hermgrid2d
+   hermgrid3d
+
+Calculus
+--------
+.. autosummary::
+   :toctree: generated/
+
+   hermder
+   hermint
+
+Misc Functions
+--------------
+.. autosummary::
+   :toctree: generated/
+
+   hermfromroots
+   hermroots
+   hermvander
+   hermvander2d
+   hermvander3d
+   hermgauss
+   hermweight
+   hermcompanion
+   hermfit
+   hermtrim
+   hermline
+   herm2poly
+   poly2herm
+
+See also
+--------
+`numpy.polynomial`
+
+"""
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+__all__ = [
+    'hermzero', 'hermone', 'hermx', 'hermdomain', 'hermline', 'hermadd',
+    'hermsub', 'hermmulx', 'hermmul', 'hermdiv', 'hermpow', 'hermval',
+    'hermder', 'hermint', 'herm2poly', 'poly2herm', 'hermfromroots',
+    'hermvander', 'hermfit', 'hermtrim', 'hermroots', 'Hermite',
+    'hermval2d', 'hermval3d', 'hermgrid2d', 'hermgrid3d', 'hermvander2d',
+    'hermvander3d', 'hermcompanion', 'hermgauss', 'hermweight']
+
+hermtrim = pu.trimcoef
+
+
+def poly2herm(pol):
+    """
+    poly2herm(pol)
+
+    Convert a polynomial to a Hermite series.
+
+    Convert an array representing the coefficients of a polynomial (relative
+    to the "standard" basis) ordered from lowest degree to highest, to an
+    array of the coefficients of the equivalent Hermite series, ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    pol : array_like
+        1-D array containing the polynomial coefficients
+
+    Returns
+    -------
+    c : ndarray
+        1-D array containing the coefficients of the equivalent Hermite
+        series.
+
+    See Also
+    --------
+    herm2poly
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import poly2herm
+    >>> poly2herm(np.arange(4))
+    array([1.   ,  2.75 ,  0.5  ,  0.375])
+
+    """
+    [pol] = pu.as_series([pol])
+    deg = len(pol) - 1
+    res = 0
+    for i in range(deg, -1, -1):
+        res = hermadd(hermmulx(res), pol[i])
+    return res
+
+
+def herm2poly(c):
+    """
+    Convert a Hermite series to a polynomial.
+
+    Convert an array representing the coefficients of a Hermite series,
+    ordered from lowest degree to highest, to an array of the coefficients
+    of the equivalent polynomial (relative to the "standard" basis) ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array containing the Hermite series coefficients, ordered
+        from lowest order term to highest.
+
+    Returns
+    -------
+    pol : ndarray
+        1-D array containing the coefficients of the equivalent polynomial
+        (relative to the "standard" basis) ordered from lowest order term
+        to highest.
+
+    See Also
+    --------
+    poly2herm
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import herm2poly
+    >>> herm2poly([ 1.   ,  2.75 ,  0.5  ,  0.375])
+    array([0., 1., 2., 3.])
+
+    """
+    from .polynomial import polyadd, polysub, polymulx
+
+    [c] = pu.as_series([c])
+    n = len(c)
+    if n == 1:
+        return c
+    if n == 2:
+        c[1] *= 2
+        return c
+    else:
+        c0 = c[-2]
+        c1 = c[-1]
+        # i is the current degree of c1
+        for i in range(n - 1, 1, -1):
+            tmp = c0
+            c0 = polysub(c[i - 2], c1*(2*(i - 1)))
+            c1 = polyadd(tmp, polymulx(c1)*2)
+        return polyadd(c0, polymulx(c1)*2)
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Hermite
+hermdomain = np.array([-1, 1])
+
+# Hermite coefficients representing zero.
+hermzero = np.array([0])
+
+# Hermite coefficients representing one.
+hermone = np.array([1])
+
+# Hermite coefficients representing the identity x.
+hermx = np.array([0, 1/2])
+
+
+def hermline(off, scl):
+    """
+    Hermite series whose graph is a straight line.
+
+
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The specified line is given by ``off + scl*x``.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the Hermite series for
+        ``off + scl*x``.
+
+    See Also
+    --------
+    polyline, chebline
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermline, hermval
+    >>> hermval(0,hermline(3, 2))
+    3.0
+    >>> hermval(1,hermline(3, 2))
+    5.0
+
+    """
+    if scl != 0:
+        return np.array([off, scl/2])
+    else:
+        return np.array([off])
+
+
+def hermfromroots(roots):
+    """
+    Generate a Hermite series with given roots.
+
+    The function returns the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    in Hermite form, where the `r_n` are the roots specified in `roots`.
+    If a zero has multiplicity n, then it must appear in `roots` n times.
+    For instance, if 2 is a root of multiplicity three and 3 is a root of
+    multiplicity 2, then `roots` looks something like [2, 2, 2, 3, 3]. The
+    roots can appear in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * H_1(x) + ... +  c_n * H_n(x)
+
+    The coefficient of the last term is not generally 1 for monic
+    polynomials in Hermite form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of coefficients.  If all roots are real then `out` is a
+        real array, if some of the roots are complex, then `out` is complex
+        even if all the coefficients in the result are real (see Examples
+        below).
+
+    See Also
+    --------
+    polyfromroots, legfromroots, lagfromroots, chebfromroots, hermefromroots
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermfromroots, hermval
+    >>> coef = hermfromroots((-1, 0, 1))
+    >>> hermval((-1, 0, 1), coef)
+    array([0.,  0.,  0.])
+    >>> coef = hermfromroots((-1j, 1j))
+    >>> hermval((-1j, 1j), coef)
+    array([0.+0.j, 0.+0.j])
+
+    """
+    return pu._fromroots(hermline, hermmul, roots)
+
+
+def hermadd(c1, c2):
+    """
+    Add one Hermite series to another.
+
+    Returns the sum of two Hermite series `c1` + `c2`.  The arguments
+    are sequences of coefficients ordered from lowest order term to
+    highest, i.e., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the Hermite series of their sum.
+
+    See Also
+    --------
+    hermsub, hermmulx, hermmul, hermdiv, hermpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the sum of two Hermite series
+    is a Hermite series (without having to "reproject" the result onto
+    the basis set) so addition, just like that of "standard" polynomials,
+    is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermadd
+    >>> hermadd([1, 2, 3], [1, 2, 3, 4])
+    array([2., 4., 6., 4.])
+
+    """
+    return pu._add(c1, c2)
+
+
+def hermsub(c1, c2):
+    """
+    Subtract one Hermite series from another.
+
+    Returns the difference of two Hermite series `c1` - `c2`.  The
+    sequences of coefficients are from lowest order term to highest, i.e.,
+    [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Hermite series coefficients representing their difference.
+
+    See Also
+    --------
+    hermadd, hermmulx, hermmul, hermdiv, hermpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the difference of two Hermite
+    series is a Hermite series (without having to "reproject" the result
+    onto the basis set) so subtraction, just like that of "standard"
+    polynomials, is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermsub
+    >>> hermsub([1, 2, 3, 4], [1, 2, 3])
+    array([0.,  0.,  0.,  4.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def hermmulx(c):
+    """Multiply a Hermite series by x.
+
+    Multiply the Hermite series `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    See Also
+    --------
+    hermadd, hermsub, hermmul, hermdiv, hermpow
+
+    Notes
+    -----
+    The multiplication uses the recursion relationship for Hermite
+    polynomials in the form
+
+    .. math::
+
+    xP_i(x) = (P_{i + 1}(x)/2 + i*P_{i - 1}(x))
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermmulx
+    >>> hermmulx([1, 2, 3])
+    array([2. , 6.5, 1. , 1.5])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]*0
+    prd[1] = c[0]/2
+    for i in range(1, len(c)):
+        prd[i + 1] = c[i]/2
+        prd[i - 1] += c[i]*i
+    return prd
+
+
+def hermmul(c1, c2):
+    """
+    Multiply one Hermite series by another.
+
+    Returns the product of two Hermite series `c1` * `c2`.  The arguments
+    are sequences of coefficients, from lowest order "term" to highest,
+    e.g., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Hermite series coefficients representing their product.
+
+    See Also
+    --------
+    hermadd, hermsub, hermmulx, hermdiv, hermpow
+
+    Notes
+    -----
+    In general, the (polynomial) product of two C-series results in terms
+    that are not in the Hermite polynomial basis set.  Thus, to express
+    the product as a Hermite series, it is necessary to "reproject" the
+    product onto said basis set, which may produce "unintuitive" (but
+    correct) results; see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermmul
+    >>> hermmul([1, 2, 3], [0, 1, 2])
+    array([52.,  29.,  52.,   7.,   6.])
+
+    """
+    # s1, s2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+
+    if len(c1) > len(c2):
+        c = c2
+        xs = c1
+    else:
+        c = c1
+        xs = c2
+
+    if len(c) == 1:
+        c0 = c[0]*xs
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]*xs
+        c1 = c[1]*xs
+    else:
+        nd = len(c)
+        c0 = c[-2]*xs
+        c1 = c[-1]*xs
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = hermsub(c[-i]*xs, c1*(2*(nd - 1)))
+            c1 = hermadd(tmp, hermmulx(c1)*2)
+    return hermadd(c0, hermmulx(c1)*2)
+
+
+def hermdiv(c1, c2):
+    """
+    Divide one Hermite series by another.
+
+    Returns the quotient-with-remainder of two Hermite series
+    `c1` / `c2`.  The arguments are sequences of coefficients from lowest
+    order "term" to highest, e.g., [1,2,3] represents the series
+    ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    [quo, rem] : ndarrays
+        Of Hermite series coefficients representing the quotient and
+        remainder.
+
+    See Also
+    --------
+    hermadd, hermsub, hermmulx, hermmul, hermpow
+
+    Notes
+    -----
+    In general, the (polynomial) division of one Hermite series by another
+    results in quotient and remainder terms that are not in the Hermite
+    polynomial basis set.  Thus, to express these results as a Hermite
+    series, it is necessary to "reproject" the results onto the Hermite
+    basis set, which may produce "unintuitive" (but correct) results; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermdiv
+    >>> hermdiv([ 52.,  29.,  52.,   7.,   6.], [0, 1, 2])
+    (array([1., 2., 3.]), array([0.]))
+    >>> hermdiv([ 54.,  31.,  52.,   7.,   6.], [0, 1, 2])
+    (array([1., 2., 3.]), array([2., 2.]))
+    >>> hermdiv([ 53.,  30.,  52.,   7.,   6.], [0, 1, 2])
+    (array([1., 2., 3.]), array([1., 1.]))
+
+    """
+    return pu._div(hermmul, c1, c2)
+
+
+def hermpow(c, pow, maxpower=16):
+    """Raise a Hermite series to a power.
+
+    Returns the Hermite series `c` raised to the power `pow`. The
+    argument `c` is a sequence of coefficients ordered from low to high.
+    i.e., [1,2,3] is the series  ``P_0 + 2*P_1 + 3*P_2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Hermite series coefficients ordered from low to
+        high.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Hermite series of power.
+
+    See Also
+    --------
+    hermadd, hermsub, hermmulx, hermmul, hermdiv
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermpow
+    >>> hermpow([1, 2, 3], 2)
+    array([81.,  52.,  82.,  12.,   9.])
+
+    """
+    return pu._pow(hermmul, c, pow, maxpower)
+
+
+def hermder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a Hermite series.
+
+    Returns the Hermite series coefficients `c` differentiated `m` times
+    along `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable). The argument
+    `c` is an array of coefficients from low to high degree along each
+    axis, e.g., [1,2,3] represents the series ``1*H_0 + 2*H_1 + 3*H_2``
+    while [[1,2],[1,2]] represents ``1*H_0(x)*H_0(y) + 1*H_1(x)*H_0(y) +
+    2*H_0(x)*H_1(y) + 2*H_1(x)*H_1(y)`` if axis=0 is ``x`` and axis=1 is
+    ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Hermite series coefficients. If `c` is multidimensional the
+        different axis correspond to different variables with the degree in
+        each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change of
+        variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Hermite series of the derivative.
+
+    See Also
+    --------
+    hermint
+
+    Notes
+    -----
+    In general, the result of differentiating a Hermite series does not
+    resemble the same operation on a power series. Thus the result of this
+    function may be "unintuitive," albeit correct; see Examples section
+    below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermder
+    >>> hermder([ 1. ,  0.5,  0.5,  0.5])
+    array([1., 2., 3.])
+    >>> hermder([-0.5,  1./2.,  1./8.,  1./12.,  1./16.], m=2)
+    array([1., 2., 3.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=c.dtype)
+            for j in range(n, 0, -1):
+                der[j - 1] = (2*j)*c[j]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def hermint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a Hermite series.
+
+    Returns the Hermite series coefficients `c` integrated `m` times from
+    `lbnd` along `axis`. At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.)  The argument `c` is an array of
+    coefficients from low to high degree along each axis, e.g., [1,2,3]
+    represents the series ``H_0 + 2*H_1 + 3*H_2`` while [[1,2],[1,2]]
+    represents ``1*H_0(x)*H_0(y) + 1*H_1(x)*H_0(y) + 2*H_0(x)*H_1(y) +
+    2*H_1(x)*H_1(y)`` if axis=0 is ``x`` and axis=1 is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Hermite series coefficients. If c is multidimensional the
+        different axis correspond to different variables with the degree in
+        each axis given by the corresponding index.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at
+        ``lbnd`` is the first value in the list, the value of the second
+        integral at ``lbnd`` is the second value, etc.  If ``k == []`` (the
+        default), all constants are set to zero.  If ``m == 1``, a single
+        scalar can be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        Hermite series coefficients of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 0``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    hermder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.
+    Why is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`.  Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a` - perhaps not what one would have first thought.
+
+    Also note that, in general, the result of integrating a C-series needs
+    to be "reprojected" onto the C-series basis set.  Thus, typically,
+    the result of this function is "unintuitive," albeit correct; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermint
+    >>> hermint([1,2,3]) # integrate once, value 0 at 0.
+    array([1. , 0.5, 0.5, 0.5])
+    >>> hermint([1,2,3], m=2) # integrate twice, value & deriv 0 at 0
+    array([-0.5       ,  0.5       ,  0.125     ,  0.08333333,  0.0625    ]) # may vary
+    >>> hermint([1,2,3], k=1) # integrate once, value 1 at 0.
+    array([2. , 0.5, 0.5, 0.5])
+    >>> hermint([1,2,3], lbnd=-1) # integrate once, value 0 at -1
+    array([-2. ,  0.5,  0.5,  0.5])
+    >>> hermint([1,2,3], m=2, k=[1,2], lbnd=-1)
+    array([ 1.66666667, -0.5       ,  0.125     ,  0.08333333,  0.0625    ]) # may vary
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    k = list(k) + [0]*(cnt - len(k))
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=c.dtype)
+            tmp[0] = c[0]*0
+            tmp[1] = c[0]/2
+            for j in range(1, n):
+                tmp[j + 1] = c[j]/(2*(j + 1))
+            tmp[0] += k[i] - hermval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def hermval(x, c, tensor=True):
+    """
+    Evaluate an Hermite series at points x.
+
+    If `c` is of length `n + 1`, this function returns the value:
+
+    .. math:: p(x) = c_0 * H_0(x) + c_1 * H_1(x) + ... + c_n * H_n(x)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, algebra_like
+        The shape of the return value is described above.
+
+    See Also
+    --------
+    hermval2d, hermgrid2d, hermval3d, hermgrid3d
+
+    Notes
+    -----
+    The evaluation uses Clenshaw recursion, aka synthetic division.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermval
+    >>> coef = [1,2,3]
+    >>> hermval(1, coef)
+    11.0
+    >>> hermval([[1,2],[3,4]], coef)
+    array([[ 11.,   51.],
+           [115.,  203.]])
+
+    """
+    c = np.array(c, ndmin=1, copy=False)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    x2 = x*2
+    if len(c) == 1:
+        c0 = c[0]
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]
+        c1 = c[1]
+    else:
+        nd = len(c)
+        c0 = c[-2]
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = c[-i] - c1*(2*(nd - 1))
+            c1 = tmp + c1*x2
+    return c0 + c1*x2
+
+
+def hermval2d(x, y, c):
+    """
+    Evaluate a 2-D Hermite series at points (x, y).
+
+    This function returns the values:
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * H_i(x) * H_j(y)
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` is a 1-D array a one is implicitly appended to its shape to make
+    it 2-D. The shape of the result will be c.shape[2:] + x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and if it isn't an ndarray it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in ``c[i,j]``. If `c` has
+        dimension greater than two the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points formed with
+        pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    hermval, hermgrid2d, hermval3d, hermgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(hermval, c, x, y)
+
+
+def hermgrid2d(x, y, c):
+    """
+    Evaluate a 2-D Hermite series on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * H_i(a) * H_j(b)
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    hermval, hermval2d, hermval3d, hermgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(hermval, c, x, y)
+
+
+def hermval3d(x, y, z, c):
+    """
+    Evaluate a 3-D Hermite series at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * H_i(x) * H_j(y) * H_k(z)
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimensional polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    hermval, hermval2d, hermgrid2d, hermgrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(hermval, c, x, y, z)
+
+
+def hermgrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D Hermite series on the Cartesian product of x, y, and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * H_i(a) * H_j(b) * H_k(c)
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    hermval, hermval2d, hermgrid2d, hermval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(hermval, c, x, y, z)
+
+
+def hermvander(x, deg):
+    """Pseudo-Vandermonde matrix of given degree.
+
+    Returns the pseudo-Vandermonde matrix of degree `deg` and sample points
+    `x`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = H_i(x),
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the degree of the Hermite polynomial.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    array ``V = hermvander(x, n)``, then ``np.dot(V, c)`` and
+    ``hermval(x, c)`` are the same up to roundoff. This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of Hermite series of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray
+        The pseudo-Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where The last index is the degree of the
+        corresponding Hermite polynomial.  The dtype will be the same as
+        the converted `x`.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermvander
+    >>> x = np.array([-1, 0, 1])
+    >>> hermvander(x, 3)
+    array([[ 1., -2.,  2.,  4.],
+           [ 1.,  0., -2., -0.],
+           [ 1.,  2.,  2., -4.]])
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    v[0] = x*0 + 1
+    if ideg > 0:
+        x2 = x*2
+        v[1] = x2
+        for i in range(2, ideg + 1):
+            v[i] = (v[i-1]*x2 - v[i-2]*(2*(i - 1)))
+    return np.moveaxis(v, 0, -1)
+
+
+def hermvander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = H_i(x) * H_j(y),
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the degrees of
+    the Hermite polynomials.
+
+    If ``V = hermvander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``hermval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D Hermite
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    hermvander, hermvander3d, hermval2d, hermval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((hermvander, hermvander), (x, y), deg)
+
+
+def hermvander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = H_i(x)*H_j(y)*H_k(z),
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the degrees of the Hermite polynomials.
+
+    If ``V = hermvander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and  ``np.dot(V, c.flat)`` and ``hermval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D Hermite
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    hermvander, hermvander3d, hermval2d, hermval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((hermvander, hermvander, hermvander), (x, y, z), deg)
+
+
+def hermfit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least squares fit of Hermite series to data.
+
+    Return the coefficients of a Hermite series of degree `deg` that is the
+    least squares fit to the data values `y` given at points `x`. If `y` is
+    1-D the returned coefficients will also be 1-D. If `y` is 2-D multiple
+    fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * H_1(x) + ... + c_n * H_n(x),
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+    Returns
+    -------
+    coef : ndarray, shape (M,) or (M, K)
+        Hermite coefficients ordered from low to high. If `y` was 2-D,
+        the coefficients for the data in column k  of `y` are in column
+        `k`.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.  The
+        warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    chebfit, legfit, lagfit, polyfit, hermefit
+    hermval : Evaluates a Hermite series.
+    hermvander : Vandermonde matrix of Hermite series.
+    hermweight : Hermite weight function
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the Hermite series `p` that
+    minimizes the sum of the weighted squared errors
+
+    .. math:: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where the :math:`w_j` are the weights. This problem is solved by
+    setting up the (typically) overdetermined matrix equation
+
+    .. math:: V(x) * c = w * y,
+
+    where `V` is the weighted pseudo Vandermonde matrix of `x`, `c` are the
+    coefficients to be solved for, `w` are the weights, `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected, then a `RankWarning` will be issued. This means that the
+    coefficient values may be poorly determined. Using a lower order fit
+    will usually get rid of the warning.  The `rcond` parameter can also be
+    set to a value smaller than its default, but the resulting fit may be
+    spurious and have large contributions from roundoff error.
+
+    Fits using Hermite series are probably most useful when the data can be
+    approximated by ``sqrt(w(x)) * p(x)``, where `w(x)` is the Hermite
+    weight. In that case the weight ``sqrt(w(x[i]))`` should be used
+    together with data values ``y[i]/sqrt(w(x[i]))``. The weight function is
+    available as `hermweight`.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermfit, hermval
+    >>> x = np.linspace(-10, 10)
+    >>> err = np.random.randn(len(x))/10
+    >>> y = hermval(x, [1, 2, 3]) + err
+    >>> hermfit(x, y, 2)
+    array([1.0218, 1.9986, 2.9999]) # may vary
+
+    """
+    return pu._fit(hermvander, x, y, deg, rcond, full, w)
+
+
+def hermcompanion(c):
+    """Return the scaled companion matrix of c.
+
+    The basis polynomials are scaled so that the companion matrix is
+    symmetric when `c` is an Hermite basis polynomial. This provides
+    better eigenvalue estimates than the unscaled case and for basis
+    polynomials the eigenvalues are guaranteed to be real if
+    `numpy.linalg.eigvalsh` is used to obtain them.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Hermite series coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Scaled companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[-.5*c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    scl = np.hstack((1., 1./np.sqrt(2.*np.arange(n - 1, 0, -1))))
+    scl = np.multiply.accumulate(scl)[::-1]
+    top = mat.reshape(-1)[1::n+1]
+    bot = mat.reshape(-1)[n::n+1]
+    top[...] = np.sqrt(.5*np.arange(1, n))
+    bot[...] = top
+    mat[:, -1] -= scl*c[:-1]/(2.0*c[-1])
+    return mat
+
+
+def hermroots(c):
+    """
+    Compute the roots of a Hermite series.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * H_i(x).
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the series. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    polyroots, legroots, lagroots, chebroots, hermeroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the series for such
+    values. Roots with multiplicity greater than 1 will also show larger
+    errors as the value of the series near such points is relatively
+    insensitive to errors in the roots. Isolated roots near the origin can
+    be improved by a few iterations of Newton's method.
+
+    The Hermite series basis polynomials aren't powers of `x` so the
+    results of this function may seem unintuitive.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite import hermroots, hermfromroots
+    >>> coef = hermfromroots([-1, 0, 1])
+    >>> coef
+    array([0.   ,  0.25 ,  0.   ,  0.125])
+    >>> hermroots(coef)
+    array([-1.00000000e+00, -1.38777878e-17,  1.00000000e+00])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) <= 1:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([-.5*c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = hermcompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+def _normed_hermite_n(x, n):
+    """
+    Evaluate a normalized Hermite polynomial.
+
+    Compute the value of the normalized Hermite polynomial of degree ``n``
+    at the points ``x``.
+
+
+    Parameters
+    ----------
+    x : ndarray of double.
+        Points at which to evaluate the function
+    n : int
+        Degree of the normalized Hermite function to be evaluated.
+
+    Returns
+    -------
+    values : ndarray
+        The shape of the return value is described above.
+
+    Notes
+    -----
+    .. versionadded:: 1.10.0
+
+    This function is needed for finding the Gauss points and integration
+    weights for high degrees. The values of the standard Hermite functions
+    overflow when n >= 207.
+
+    """
+    if n == 0:
+        return np.full(x.shape, 1/np.sqrt(np.sqrt(np.pi)))
+
+    c0 = 0.
+    c1 = 1./np.sqrt(np.sqrt(np.pi))
+    nd = float(n)
+    for i in range(n - 1):
+        tmp = c0
+        c0 = -c1*np.sqrt((nd - 1.)/nd)
+        c1 = tmp + c1*x*np.sqrt(2./nd)
+        nd = nd - 1.0
+    return c0 + c1*x*np.sqrt(2)
+
+
+def hermgauss(deg):
+    """
+    Gauss-Hermite quadrature.
+
+    Computes the sample points and weights for Gauss-Hermite quadrature.
+    These sample points and weights will correctly integrate polynomials of
+    degree :math:`2*deg - 1` or less over the interval :math:`[-\\inf, \\inf]`
+    with the weight function :math:`f(x) = \\exp(-x^2)`.
+
+    Parameters
+    ----------
+    deg : int
+        Number of sample points and weights. It must be >= 1.
+
+    Returns
+    -------
+    x : ndarray
+        1-D ndarray containing the sample points.
+    y : ndarray
+        1-D ndarray containing the weights.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    The results have only been tested up to degree 100, higher degrees may
+    be problematic. The weights are determined by using the fact that
+
+    .. math:: w_k = c / (H'_n(x_k) * H_{n-1}(x_k))
+
+    where :math:`c` is a constant independent of :math:`k` and :math:`x_k`
+    is the k'th root of :math:`H_n`, and then scaling the results to get
+    the right value when integrating 1.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg <= 0:
+        raise ValueError("deg must be a positive integer")
+
+    # first approximation of roots. We use the fact that the companion
+    # matrix is symmetric in this case in order to obtain better zeros.
+    c = np.array([0]*deg + [1], dtype=np.float64)
+    m = hermcompanion(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = _normed_hermite_n(x, ideg)
+    df = _normed_hermite_n(x, ideg - 1) * np.sqrt(2*ideg)
+    x -= dy/df
+
+    # compute the weights. We scale the factor to avoid possible numerical
+    # overflow.
+    fm = _normed_hermite_n(x, ideg - 1)
+    fm /= np.abs(fm).max()
+    w = 1/(fm * fm)
+
+    # for Hermite we can also symmetrize
+    w = (w + w[::-1])/2
+    x = (x - x[::-1])/2
+
+    # scale w to get the right value
+    w *= np.sqrt(np.pi) / w.sum()
+
+    return x, w
+
+
+def hermweight(x):
+    """
+    Weight function of the Hermite polynomials.
+
+    The weight function is :math:`\\exp(-x^2)` and the interval of
+    integration is :math:`[-\\inf, \\inf]`. the Hermite polynomials are
+    orthogonal, but not normalized, with respect to this weight function.
+
+    Parameters
+    ----------
+    x : array_like
+       Values at which the weight function will be computed.
+
+    Returns
+    -------
+    w : ndarray
+       The weight function at `x`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    w = np.exp(-x**2)
+    return w
+
+
+#
+# Hermite series class
+#
+
+class Hermite(ABCPolyBase):
+    """An Hermite series class.
+
+    The Hermite class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    attributes and methods listed in the `ABCPolyBase` documentation.
+
+    Parameters
+    ----------
+    coef : array_like
+        Hermite coefficients in order of increasing degree, i.e,
+        ``(1, 2, 3)`` gives ``1*H_0(x) + 2*H_1(X) + 3*H_2(x)``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [-1, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [-1, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(hermadd)
+    _sub = staticmethod(hermsub)
+    _mul = staticmethod(hermmul)
+    _div = staticmethod(hermdiv)
+    _pow = staticmethod(hermpow)
+    _val = staticmethod(hermval)
+    _int = staticmethod(hermint)
+    _der = staticmethod(hermder)
+    _fit = staticmethod(hermfit)
+    _line = staticmethod(hermline)
+    _roots = staticmethod(hermroots)
+    _fromroots = staticmethod(hermfromroots)
+
+    # Virtual properties
+    nickname = 'herm'
+    domain = np.array(hermdomain)
+    window = np.array(hermdomain)
+    basis_name = 'H'
diff --git a/venv/Lib/site-packages/numpy/polynomial/hermite_e.py b/venv/Lib/site-packages/numpy/polynomial/hermite_e.py
new file mode 100644
index 000000000..cbec15184
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/hermite_e.py
@@ -0,0 +1,1675 @@
+"""
+===================================================================
+HermiteE Series, "Probabilists" (:mod:`numpy.polynomial.hermite_e`)
+===================================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with Hermite_e series, including a `HermiteE` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with such polynomials is in the
+docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+.. autosummary::
+   :toctree: generated/
+
+   HermiteE
+
+Constants
+---------
+.. autosummary::
+   :toctree: generated/
+
+   hermedomain
+   hermezero
+   hermeone
+   hermex
+
+Arithmetic
+----------
+.. autosummary::
+   :toctree: generated/
+
+   hermeadd
+   hermesub
+   hermemulx
+   hermemul
+   hermediv
+   hermepow
+   hermeval
+   hermeval2d
+   hermeval3d
+   hermegrid2d
+   hermegrid3d
+
+Calculus
+--------
+.. autosummary::
+   :toctree: generated/
+
+   hermeder
+   hermeint
+
+Misc Functions
+--------------
+.. autosummary::
+   :toctree: generated/
+
+   hermefromroots
+   hermeroots
+   hermevander
+   hermevander2d
+   hermevander3d
+   hermegauss
+   hermeweight
+   hermecompanion
+   hermefit
+   hermetrim
+   hermeline
+   herme2poly
+   poly2herme
+
+See also
+--------
+`numpy.polynomial`
+
+"""
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+__all__ = [
+    'hermezero', 'hermeone', 'hermex', 'hermedomain', 'hermeline',
+    'hermeadd', 'hermesub', 'hermemulx', 'hermemul', 'hermediv',
+    'hermepow', 'hermeval', 'hermeder', 'hermeint', 'herme2poly',
+    'poly2herme', 'hermefromroots', 'hermevander', 'hermefit', 'hermetrim',
+    'hermeroots', 'HermiteE', 'hermeval2d', 'hermeval3d', 'hermegrid2d',
+    'hermegrid3d', 'hermevander2d', 'hermevander3d', 'hermecompanion',
+    'hermegauss', 'hermeweight']
+
+hermetrim = pu.trimcoef
+
+
+def poly2herme(pol):
+    """
+    poly2herme(pol)
+
+    Convert a polynomial to a Hermite series.
+
+    Convert an array representing the coefficients of a polynomial (relative
+    to the "standard" basis) ordered from lowest degree to highest, to an
+    array of the coefficients of the equivalent Hermite series, ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    pol : array_like
+        1-D array containing the polynomial coefficients
+
+    Returns
+    -------
+    c : ndarray
+        1-D array containing the coefficients of the equivalent Hermite
+        series.
+
+    See Also
+    --------
+    herme2poly
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import poly2herme
+    >>> poly2herme(np.arange(4))
+    array([  2.,  10.,   2.,   3.])
+
+    """
+    [pol] = pu.as_series([pol])
+    deg = len(pol) - 1
+    res = 0
+    for i in range(deg, -1, -1):
+        res = hermeadd(hermemulx(res), pol[i])
+    return res
+
+
+def herme2poly(c):
+    """
+    Convert a Hermite series to a polynomial.
+
+    Convert an array representing the coefficients of a Hermite series,
+    ordered from lowest degree to highest, to an array of the coefficients
+    of the equivalent polynomial (relative to the "standard" basis) ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array containing the Hermite series coefficients, ordered
+        from lowest order term to highest.
+
+    Returns
+    -------
+    pol : ndarray
+        1-D array containing the coefficients of the equivalent polynomial
+        (relative to the "standard" basis) ordered from lowest order term
+        to highest.
+
+    See Also
+    --------
+    poly2herme
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import herme2poly
+    >>> herme2poly([  2.,  10.,   2.,   3.])
+    array([0.,  1.,  2.,  3.])
+
+    """
+    from .polynomial import polyadd, polysub, polymulx
+
+    [c] = pu.as_series([c])
+    n = len(c)
+    if n == 1:
+        return c
+    if n == 2:
+        return c
+    else:
+        c0 = c[-2]
+        c1 = c[-1]
+        # i is the current degree of c1
+        for i in range(n - 1, 1, -1):
+            tmp = c0
+            c0 = polysub(c[i - 2], c1*(i - 1))
+            c1 = polyadd(tmp, polymulx(c1))
+        return polyadd(c0, polymulx(c1))
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Hermite
+hermedomain = np.array([-1, 1])
+
+# Hermite coefficients representing zero.
+hermezero = np.array([0])
+
+# Hermite coefficients representing one.
+hermeone = np.array([1])
+
+# Hermite coefficients representing the identity x.
+hermex = np.array([0, 1])
+
+
+def hermeline(off, scl):
+    """
+    Hermite series whose graph is a straight line.
+
+
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The specified line is given by ``off + scl*x``.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the Hermite series for
+        ``off + scl*x``.
+
+    See Also
+    --------
+    polyline, chebline
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeline
+    >>> from numpy.polynomial.hermite_e import hermeline, hermeval
+    >>> hermeval(0,hermeline(3, 2))
+    3.0
+    >>> hermeval(1,hermeline(3, 2))
+    5.0
+
+    """
+    if scl != 0:
+        return np.array([off, scl])
+    else:
+        return np.array([off])
+
+
+def hermefromroots(roots):
+    """
+    Generate a HermiteE series with given roots.
+
+    The function returns the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    in HermiteE form, where the `r_n` are the roots specified in `roots`.
+    If a zero has multiplicity n, then it must appear in `roots` n times.
+    For instance, if 2 is a root of multiplicity three and 3 is a root of
+    multiplicity 2, then `roots` looks something like [2, 2, 2, 3, 3]. The
+    roots can appear in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * He_1(x) + ... +  c_n * He_n(x)
+
+    The coefficient of the last term is not generally 1 for monic
+    polynomials in HermiteE form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of coefficients.  If all roots are real then `out` is a
+        real array, if some of the roots are complex, then `out` is complex
+        even if all the coefficients in the result are real (see Examples
+        below).
+
+    See Also
+    --------
+    polyfromroots, legfromroots, lagfromroots, hermfromroots, chebfromroots
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermefromroots, hermeval
+    >>> coef = hermefromroots((-1, 0, 1))
+    >>> hermeval((-1, 0, 1), coef)
+    array([0., 0., 0.])
+    >>> coef = hermefromroots((-1j, 1j))
+    >>> hermeval((-1j, 1j), coef)
+    array([0.+0.j, 0.+0.j])
+
+    """
+    return pu._fromroots(hermeline, hermemul, roots)
+
+
+def hermeadd(c1, c2):
+    """
+    Add one Hermite series to another.
+
+    Returns the sum of two Hermite series `c1` + `c2`.  The arguments
+    are sequences of coefficients ordered from lowest order term to
+    highest, i.e., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the Hermite series of their sum.
+
+    See Also
+    --------
+    hermesub, hermemulx, hermemul, hermediv, hermepow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the sum of two Hermite series
+    is a Hermite series (without having to "reproject" the result onto
+    the basis set) so addition, just like that of "standard" polynomials,
+    is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeadd
+    >>> hermeadd([1, 2, 3], [1, 2, 3, 4])
+    array([2.,  4.,  6.,  4.])
+
+    """
+    return pu._add(c1, c2)
+
+
+def hermesub(c1, c2):
+    """
+    Subtract one Hermite series from another.
+
+    Returns the difference of two Hermite series `c1` - `c2`.  The
+    sequences of coefficients are from lowest order term to highest, i.e.,
+    [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Hermite series coefficients representing their difference.
+
+    See Also
+    --------
+    hermeadd, hermemulx, hermemul, hermediv, hermepow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the difference of two Hermite
+    series is a Hermite series (without having to "reproject" the result
+    onto the basis set) so subtraction, just like that of "standard"
+    polynomials, is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermesub
+    >>> hermesub([1, 2, 3, 4], [1, 2, 3])
+    array([0., 0., 0., 4.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def hermemulx(c):
+    """Multiply a Hermite series by x.
+
+    Multiply the Hermite series `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    Notes
+    -----
+    The multiplication uses the recursion relationship for Hermite
+    polynomials in the form
+
+    .. math::
+
+    xP_i(x) = (P_{i + 1}(x) + iP_{i - 1}(x)))
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermemulx
+    >>> hermemulx([1, 2, 3])
+    array([2.,  7.,  2.,  3.])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]*0
+    prd[1] = c[0]
+    for i in range(1, len(c)):
+        prd[i + 1] = c[i]
+        prd[i - 1] += c[i]*i
+    return prd
+
+
+def hermemul(c1, c2):
+    """
+    Multiply one Hermite series by another.
+
+    Returns the product of two Hermite series `c1` * `c2`.  The arguments
+    are sequences of coefficients, from lowest order "term" to highest,
+    e.g., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Hermite series coefficients representing their product.
+
+    See Also
+    --------
+    hermeadd, hermesub, hermemulx, hermediv, hermepow
+
+    Notes
+    -----
+    In general, the (polynomial) product of two C-series results in terms
+    that are not in the Hermite polynomial basis set.  Thus, to express
+    the product as a Hermite series, it is necessary to "reproject" the
+    product onto said basis set, which may produce "unintuitive" (but
+    correct) results; see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermemul
+    >>> hermemul([1, 2, 3], [0, 1, 2])
+    array([14.,  15.,  28.,   7.,   6.])
+
+    """
+    # s1, s2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+
+    if len(c1) > len(c2):
+        c = c2
+        xs = c1
+    else:
+        c = c1
+        xs = c2
+
+    if len(c) == 1:
+        c0 = c[0]*xs
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]*xs
+        c1 = c[1]*xs
+    else:
+        nd = len(c)
+        c0 = c[-2]*xs
+        c1 = c[-1]*xs
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = hermesub(c[-i]*xs, c1*(nd - 1))
+            c1 = hermeadd(tmp, hermemulx(c1))
+    return hermeadd(c0, hermemulx(c1))
+
+
+def hermediv(c1, c2):
+    """
+    Divide one Hermite series by another.
+
+    Returns the quotient-with-remainder of two Hermite series
+    `c1` / `c2`.  The arguments are sequences of coefficients from lowest
+    order "term" to highest, e.g., [1,2,3] represents the series
+    ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Hermite series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    [quo, rem] : ndarrays
+        Of Hermite series coefficients representing the quotient and
+        remainder.
+
+    See Also
+    --------
+    hermeadd, hermesub, hermemulx, hermemul, hermepow
+
+    Notes
+    -----
+    In general, the (polynomial) division of one Hermite series by another
+    results in quotient and remainder terms that are not in the Hermite
+    polynomial basis set.  Thus, to express these results as a Hermite
+    series, it is necessary to "reproject" the results onto the Hermite
+    basis set, which may produce "unintuitive" (but correct) results; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermediv
+    >>> hermediv([ 14.,  15.,  28.,   7.,   6.], [0, 1, 2])
+    (array([1., 2., 3.]), array([0.]))
+    >>> hermediv([ 15.,  17.,  28.,   7.,   6.], [0, 1, 2])
+    (array([1., 2., 3.]), array([1., 2.]))
+
+    """
+    return pu._div(hermemul, c1, c2)
+
+
+def hermepow(c, pow, maxpower=16):
+    """Raise a Hermite series to a power.
+
+    Returns the Hermite series `c` raised to the power `pow`. The
+    argument `c` is a sequence of coefficients ordered from low to high.
+    i.e., [1,2,3] is the series  ``P_0 + 2*P_1 + 3*P_2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Hermite series coefficients ordered from low to
+        high.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Hermite series of power.
+
+    See Also
+    --------
+    hermeadd, hermesub, hermemulx, hermemul, hermediv
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermepow
+    >>> hermepow([1, 2, 3], 2)
+    array([23.,  28.,  46.,  12.,   9.])
+
+    """
+    return pu._pow(hermemul, c, pow, maxpower)
+
+
+def hermeder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a Hermite_e series.
+
+    Returns the series coefficients `c` differentiated `m` times along
+    `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable). The argument
+    `c` is an array of coefficients from low to high degree along each
+    axis, e.g., [1,2,3] represents the series ``1*He_0 + 2*He_1 + 3*He_2``
+    while [[1,2],[1,2]] represents ``1*He_0(x)*He_0(y) + 1*He_1(x)*He_0(y)
+    + 2*He_0(x)*He_1(y) + 2*He_1(x)*He_1(y)`` if axis=0 is ``x`` and axis=1
+    is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Hermite_e series coefficients. If `c` is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change of
+        variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Hermite series of the derivative.
+
+    See Also
+    --------
+    hermeint
+
+    Notes
+    -----
+    In general, the result of differentiating a Hermite series does not
+    resemble the same operation on a power series. Thus the result of this
+    function may be "unintuitive," albeit correct; see Examples section
+    below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeder
+    >>> hermeder([ 1.,  1.,  1.,  1.])
+    array([1.,  2.,  3.])
+    >>> hermeder([-0.25,  1.,  1./2.,  1./3.,  1./4 ], m=2)
+    array([1.,  2.,  3.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        return c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=c.dtype)
+            for j in range(n, 0, -1):
+                der[j - 1] = j*c[j]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def hermeint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a Hermite_e series.
+
+    Returns the Hermite_e series coefficients `c` integrated `m` times from
+    `lbnd` along `axis`. At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.)  The argument `c` is an array of
+    coefficients from low to high degree along each axis, e.g., [1,2,3]
+    represents the series ``H_0 + 2*H_1 + 3*H_2`` while [[1,2],[1,2]]
+    represents ``1*H_0(x)*H_0(y) + 1*H_1(x)*H_0(y) + 2*H_0(x)*H_1(y) +
+    2*H_1(x)*H_1(y)`` if axis=0 is ``x`` and axis=1 is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Hermite_e series coefficients. If c is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at
+        ``lbnd`` is the first value in the list, the value of the second
+        integral at ``lbnd`` is the second value, etc.  If ``k == []`` (the
+        default), all constants are set to zero.  If ``m == 1``, a single
+        scalar can be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        Hermite_e series coefficients of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 0``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    hermeder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.
+    Why is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`.  Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a` - perhaps not what one would have first thought.
+
+    Also note that, in general, the result of integrating a C-series needs
+    to be "reprojected" onto the C-series basis set.  Thus, typically,
+    the result of this function is "unintuitive," albeit correct; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeint
+    >>> hermeint([1, 2, 3]) # integrate once, value 0 at 0.
+    array([1., 1., 1., 1.])
+    >>> hermeint([1, 2, 3], m=2) # integrate twice, value & deriv 0 at 0
+    array([-0.25      ,  1.        ,  0.5       ,  0.33333333,  0.25      ]) # may vary
+    >>> hermeint([1, 2, 3], k=1) # integrate once, value 1 at 0.
+    array([2., 1., 1., 1.])
+    >>> hermeint([1, 2, 3], lbnd=-1) # integrate once, value 0 at -1
+    array([-1.,  1.,  1.,  1.])
+    >>> hermeint([1, 2, 3], m=2, k=[1, 2], lbnd=-1)
+    array([ 1.83333333,  0.        ,  0.5       ,  0.33333333,  0.25      ]) # may vary
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    k = list(k) + [0]*(cnt - len(k))
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=c.dtype)
+            tmp[0] = c[0]*0
+            tmp[1] = c[0]
+            for j in range(1, n):
+                tmp[j + 1] = c[j]/(j + 1)
+            tmp[0] += k[i] - hermeval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def hermeval(x, c, tensor=True):
+    """
+    Evaluate an HermiteE series at points x.
+
+    If `c` is of length `n + 1`, this function returns the value:
+
+    .. math:: p(x) = c_0 * He_0(x) + c_1 * He_1(x) + ... + c_n * He_n(x)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, algebra_like
+        The shape of the return value is described above.
+
+    See Also
+    --------
+    hermeval2d, hermegrid2d, hermeval3d, hermegrid3d
+
+    Notes
+    -----
+    The evaluation uses Clenshaw recursion, aka synthetic division.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeval
+    >>> coef = [1,2,3]
+    >>> hermeval(1, coef)
+    3.0
+    >>> hermeval([[1,2],[3,4]], coef)
+    array([[ 3., 14.],
+           [31., 54.]])
+
+    """
+    c = np.array(c, ndmin=1, copy=False)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    if len(c) == 1:
+        c0 = c[0]
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]
+        c1 = c[1]
+    else:
+        nd = len(c)
+        c0 = c[-2]
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = c[-i] - c1*(nd - 1)
+            c1 = tmp + c1*x
+    return c0 + c1*x
+
+
+def hermeval2d(x, y, c):
+    """
+    Evaluate a 2-D HermiteE series at points (x, y).
+
+    This function returns the values:
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * He_i(x) * He_j(y)
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` is a 1-D array a one is implicitly appended to its shape to make
+    it 2-D. The shape of the result will be c.shape[2:] + x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and if it isn't an ndarray it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in ``c[i,j]``. If `c` has
+        dimension greater than two the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points formed with
+        pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    hermeval, hermegrid2d, hermeval3d, hermegrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(hermeval, c, x, y)
+
+
+def hermegrid2d(x, y, c):
+    """
+    Evaluate a 2-D HermiteE series on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * H_i(a) * H_j(b)
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    hermeval, hermeval2d, hermeval3d, hermegrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(hermeval, c, x, y)
+
+
+def hermeval3d(x, y, z, c):
+    """
+    Evaluate a 3-D Hermite_e series at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * He_i(x) * He_j(y) * He_k(z)
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimensional polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    hermeval, hermeval2d, hermegrid2d, hermegrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(hermeval, c, x, y, z)
+
+
+def hermegrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D HermiteE series on the Cartesian product of x, y, and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * He_i(a) * He_j(b) * He_k(c)
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    hermeval, hermeval2d, hermegrid2d, hermeval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(hermeval, c, x, y, z)
+
+
+def hermevander(x, deg):
+    """Pseudo-Vandermonde matrix of given degree.
+
+    Returns the pseudo-Vandermonde matrix of degree `deg` and sample points
+    `x`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = He_i(x),
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the degree of the HermiteE polynomial.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    array ``V = hermevander(x, n)``, then ``np.dot(V, c)`` and
+    ``hermeval(x, c)`` are the same up to roundoff. This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of HermiteE series of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray
+        The pseudo-Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where The last index is the degree of the
+        corresponding HermiteE polynomial.  The dtype will be the same as
+        the converted `x`.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermevander
+    >>> x = np.array([-1, 0, 1])
+    >>> hermevander(x, 3)
+    array([[ 1., -1.,  0.,  2.],
+           [ 1.,  0., -1., -0.],
+           [ 1.,  1.,  0., -2.]])
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    v[0] = x*0 + 1
+    if ideg > 0:
+        v[1] = x
+        for i in range(2, ideg + 1):
+            v[i] = (v[i-1]*x - v[i-2]*(i - 1))
+    return np.moveaxis(v, 0, -1)
+
+
+def hermevander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = He_i(x) * He_j(y),
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the degrees of
+    the HermiteE polynomials.
+
+    If ``V = hermevander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``hermeval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D HermiteE
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    hermevander, hermevander3d, hermeval2d, hermeval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((hermevander, hermevander), (x, y), deg)
+
+
+def hermevander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then Hehe pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = He_i(x)*He_j(y)*He_k(z),
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the degrees of the HermiteE polynomials.
+
+    If ``V = hermevander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and  ``np.dot(V, c.flat)`` and ``hermeval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D HermiteE
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    hermevander, hermevander3d, hermeval2d, hermeval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((hermevander, hermevander, hermevander), (x, y, z), deg)
+
+
+def hermefit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least squares fit of Hermite series to data.
+
+    Return the coefficients of a HermiteE series of degree `deg` that is
+    the least squares fit to the data values `y` given at points `x`. If
+    `y` is 1-D the returned coefficients will also be 1-D. If `y` is 2-D
+    multiple fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * He_1(x) + ... + c_n * He_n(x),
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+    Returns
+    -------
+    coef : ndarray, shape (M,) or (M, K)
+        Hermite coefficients ordered from low to high. If `y` was 2-D,
+        the coefficients for the data in column k  of `y` are in column
+        `k`.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.  The
+        warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    chebfit, legfit, polyfit, hermfit, polyfit
+    hermeval : Evaluates a Hermite series.
+    hermevander : pseudo Vandermonde matrix of Hermite series.
+    hermeweight : HermiteE weight function.
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the HermiteE series `p` that
+    minimizes the sum of the weighted squared errors
+
+    .. math:: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where the :math:`w_j` are the weights. This problem is solved by
+    setting up the (typically) overdetermined matrix equation
+
+    .. math:: V(x) * c = w * y,
+
+    where `V` is the pseudo Vandermonde matrix of `x`, the elements of `c`
+    are the coefficients to be solved for, and the elements of `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected, then a `RankWarning` will be issued. This means that the
+    coefficient values may be poorly determined. Using a lower order fit
+    will usually get rid of the warning.  The `rcond` parameter can also be
+    set to a value smaller than its default, but the resulting fit may be
+    spurious and have large contributions from roundoff error.
+
+    Fits using HermiteE series are probably most useful when the data can
+    be approximated by ``sqrt(w(x)) * p(x)``, where `w(x)` is the HermiteE
+    weight. In that case the weight ``sqrt(w(x[i]))`` should be used
+    together with data values ``y[i]/sqrt(w(x[i]))``. The weight function is
+    available as `hermeweight`.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermefit, hermeval
+    >>> x = np.linspace(-10, 10)
+    >>> np.random.seed(123)
+    >>> err = np.random.randn(len(x))/10
+    >>> y = hermeval(x, [1, 2, 3]) + err
+    >>> hermefit(x, y, 2)
+    array([ 1.01690445,  1.99951418,  2.99948696]) # may vary
+
+    """
+    return pu._fit(hermevander, x, y, deg, rcond, full, w)
+
+
+def hermecompanion(c):
+    """
+    Return the scaled companion matrix of c.
+
+    The basis polynomials are scaled so that the companion matrix is
+    symmetric when `c` is an HermiteE basis polynomial. This provides
+    better eigenvalue estimates than the unscaled case and for basis
+    polynomials the eigenvalues are guaranteed to be real if
+    `numpy.linalg.eigvalsh` is used to obtain them.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of HermiteE series coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Scaled companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[-c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    scl = np.hstack((1., 1./np.sqrt(np.arange(n - 1, 0, -1))))
+    scl = np.multiply.accumulate(scl)[::-1]
+    top = mat.reshape(-1)[1::n+1]
+    bot = mat.reshape(-1)[n::n+1]
+    top[...] = np.sqrt(np.arange(1, n))
+    bot[...] = top
+    mat[:, -1] -= scl*c[:-1]/c[-1]
+    return mat
+
+
+def hermeroots(c):
+    """
+    Compute the roots of a HermiteE series.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * He_i(x).
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the series. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    polyroots, legroots, lagroots, hermroots, chebroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the series for such
+    values. Roots with multiplicity greater than 1 will also show larger
+    errors as the value of the series near such points is relatively
+    insensitive to errors in the roots. Isolated roots near the origin can
+    be improved by a few iterations of Newton's method.
+
+    The HermiteE series basis polynomials aren't powers of `x` so the
+    results of this function may seem unintuitive.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.hermite_e import hermeroots, hermefromroots
+    >>> coef = hermefromroots([-1, 0, 1])
+    >>> coef
+    array([0., 2., 0., 1.])
+    >>> hermeroots(coef)
+    array([-1.,  0.,  1.]) # may vary
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) <= 1:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([-c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = hermecompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+def _normed_hermite_e_n(x, n):
+    """
+    Evaluate a normalized HermiteE polynomial.
+
+    Compute the value of the normalized HermiteE polynomial of degree ``n``
+    at the points ``x``.
+
+
+    Parameters
+    ----------
+    x : ndarray of double.
+        Points at which to evaluate the function
+    n : int
+        Degree of the normalized HermiteE function to be evaluated.
+
+    Returns
+    -------
+    values : ndarray
+        The shape of the return value is described above.
+
+    Notes
+    -----
+    .. versionadded:: 1.10.0
+
+    This function is needed for finding the Gauss points and integration
+    weights for high degrees. The values of the standard HermiteE functions
+    overflow when n >= 207.
+
+    """
+    if n == 0:
+        return np.full(x.shape, 1/np.sqrt(np.sqrt(2*np.pi)))
+
+    c0 = 0.
+    c1 = 1./np.sqrt(np.sqrt(2*np.pi))
+    nd = float(n)
+    for i in range(n - 1):
+        tmp = c0
+        c0 = -c1*np.sqrt((nd - 1.)/nd)
+        c1 = tmp + c1*x*np.sqrt(1./nd)
+        nd = nd - 1.0
+    return c0 + c1*x
+
+
+def hermegauss(deg):
+    """
+    Gauss-HermiteE quadrature.
+
+    Computes the sample points and weights for Gauss-HermiteE quadrature.
+    These sample points and weights will correctly integrate polynomials of
+    degree :math:`2*deg - 1` or less over the interval :math:`[-\\inf, \\inf]`
+    with the weight function :math:`f(x) = \\exp(-x^2/2)`.
+
+    Parameters
+    ----------
+    deg : int
+        Number of sample points and weights. It must be >= 1.
+
+    Returns
+    -------
+    x : ndarray
+        1-D ndarray containing the sample points.
+    y : ndarray
+        1-D ndarray containing the weights.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    The results have only been tested up to degree 100, higher degrees may
+    be problematic. The weights are determined by using the fact that
+
+    .. math:: w_k = c / (He'_n(x_k) * He_{n-1}(x_k))
+
+    where :math:`c` is a constant independent of :math:`k` and :math:`x_k`
+    is the k'th root of :math:`He_n`, and then scaling the results to get
+    the right value when integrating 1.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg <= 0:
+        raise ValueError("deg must be a positive integer")
+
+    # first approximation of roots. We use the fact that the companion
+    # matrix is symmetric in this case in order to obtain better zeros.
+    c = np.array([0]*deg + [1])
+    m = hermecompanion(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = _normed_hermite_e_n(x, ideg)
+    df = _normed_hermite_e_n(x, ideg - 1) * np.sqrt(ideg)
+    x -= dy/df
+
+    # compute the weights. We scale the factor to avoid possible numerical
+    # overflow.
+    fm = _normed_hermite_e_n(x, ideg - 1)
+    fm /= np.abs(fm).max()
+    w = 1/(fm * fm)
+
+    # for Hermite_e we can also symmetrize
+    w = (w + w[::-1])/2
+    x = (x - x[::-1])/2
+
+    # scale w to get the right value
+    w *= np.sqrt(2*np.pi) / w.sum()
+
+    return x, w
+
+
+def hermeweight(x):
+    """Weight function of the Hermite_e polynomials.
+
+    The weight function is :math:`\\exp(-x^2/2)` and the interval of
+    integration is :math:`[-\\inf, \\inf]`. the HermiteE polynomials are
+    orthogonal, but not normalized, with respect to this weight function.
+
+    Parameters
+    ----------
+    x : array_like
+       Values at which the weight function will be computed.
+
+    Returns
+    -------
+    w : ndarray
+       The weight function at `x`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    w = np.exp(-.5*x**2)
+    return w
+
+
+#
+# HermiteE series class
+#
+
+class HermiteE(ABCPolyBase):
+    """An HermiteE series class.
+
+    The HermiteE class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    attributes and methods listed in the `ABCPolyBase` documentation.
+
+    Parameters
+    ----------
+    coef : array_like
+        HermiteE coefficients in order of increasing degree, i.e,
+        ``(1, 2, 3)`` gives ``1*He_0(x) + 2*He_1(X) + 3*He_2(x)``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [-1, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [-1, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(hermeadd)
+    _sub = staticmethod(hermesub)
+    _mul = staticmethod(hermemul)
+    _div = staticmethod(hermediv)
+    _pow = staticmethod(hermepow)
+    _val = staticmethod(hermeval)
+    _int = staticmethod(hermeint)
+    _der = staticmethod(hermeder)
+    _fit = staticmethod(hermefit)
+    _line = staticmethod(hermeline)
+    _roots = staticmethod(hermeroots)
+    _fromroots = staticmethod(hermefromroots)
+
+    # Virtual properties
+    nickname = 'herme'
+    domain = np.array(hermedomain)
+    window = np.array(hermedomain)
+    basis_name = 'He'
diff --git a/venv/Lib/site-packages/numpy/polynomial/laguerre.py b/venv/Lib/site-packages/numpy/polynomial/laguerre.py
new file mode 100644
index 000000000..5b66d943e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/laguerre.py
@@ -0,0 +1,1632 @@
+"""
+==================================================
+Laguerre Series (:mod:`numpy.polynomial.laguerre`)
+==================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with Laguerre series, including a `Laguerre` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with such polynomials is in the
+docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+.. autosummary::
+   :toctree: generated/
+
+   Laguerre
+
+Constants
+---------
+.. autosummary::
+   :toctree: generated/
+
+   lagdomain
+   lagzero
+   lagone
+   lagx
+
+Arithmetic
+----------
+.. autosummary::
+   :toctree: generated/
+
+   lagadd
+   lagsub
+   lagmulx
+   lagmul
+   lagdiv
+   lagpow
+   lagval
+   lagval2d
+   lagval3d
+   laggrid2d
+   laggrid3d
+
+Calculus
+--------
+.. autosummary::
+   :toctree: generated/
+
+   lagder
+   lagint
+
+Misc Functions
+--------------
+.. autosummary::
+   :toctree: generated/
+
+   lagfromroots
+   lagroots
+   lagvander
+   lagvander2d
+   lagvander3d
+   laggauss
+   lagweight
+   lagcompanion
+   lagfit
+   lagtrim
+   lagline
+   lag2poly
+   poly2lag
+
+See also
+--------
+`numpy.polynomial`
+
+"""
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+__all__ = [
+    'lagzero', 'lagone', 'lagx', 'lagdomain', 'lagline', 'lagadd',
+    'lagsub', 'lagmulx', 'lagmul', 'lagdiv', 'lagpow', 'lagval', 'lagder',
+    'lagint', 'lag2poly', 'poly2lag', 'lagfromroots', 'lagvander',
+    'lagfit', 'lagtrim', 'lagroots', 'Laguerre', 'lagval2d', 'lagval3d',
+    'laggrid2d', 'laggrid3d', 'lagvander2d', 'lagvander3d', 'lagcompanion',
+    'laggauss', 'lagweight']
+
+lagtrim = pu.trimcoef
+
+
+def poly2lag(pol):
+    """
+    poly2lag(pol)
+
+    Convert a polynomial to a Laguerre series.
+
+    Convert an array representing the coefficients of a polynomial (relative
+    to the "standard" basis) ordered from lowest degree to highest, to an
+    array of the coefficients of the equivalent Laguerre series, ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    pol : array_like
+        1-D array containing the polynomial coefficients
+
+    Returns
+    -------
+    c : ndarray
+        1-D array containing the coefficients of the equivalent Laguerre
+        series.
+
+    See Also
+    --------
+    lag2poly
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import poly2lag
+    >>> poly2lag(np.arange(4))
+    array([ 23., -63.,  58., -18.])
+
+    """
+    [pol] = pu.as_series([pol])
+    deg = len(pol) - 1
+    res = 0
+    for i in range(deg, -1, -1):
+        res = lagadd(lagmulx(res), pol[i])
+    return res
+
+
+def lag2poly(c):
+    """
+    Convert a Laguerre series to a polynomial.
+
+    Convert an array representing the coefficients of a Laguerre series,
+    ordered from lowest degree to highest, to an array of the coefficients
+    of the equivalent polynomial (relative to the "standard" basis) ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array containing the Laguerre series coefficients, ordered
+        from lowest order term to highest.
+
+    Returns
+    -------
+    pol : ndarray
+        1-D array containing the coefficients of the equivalent polynomial
+        (relative to the "standard" basis) ordered from lowest order term
+        to highest.
+
+    See Also
+    --------
+    poly2lag
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lag2poly
+    >>> lag2poly([ 23., -63.,  58., -18.])
+    array([0., 1., 2., 3.])
+
+    """
+    from .polynomial import polyadd, polysub, polymulx
+
+    [c] = pu.as_series([c])
+    n = len(c)
+    if n == 1:
+        return c
+    else:
+        c0 = c[-2]
+        c1 = c[-1]
+        # i is the current degree of c1
+        for i in range(n - 1, 1, -1):
+            tmp = c0
+            c0 = polysub(c[i - 2], (c1*(i - 1))/i)
+            c1 = polyadd(tmp, polysub((2*i - 1)*c1, polymulx(c1))/i)
+        return polyadd(c0, polysub(c1, polymulx(c1)))
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Laguerre
+lagdomain = np.array([0, 1])
+
+# Laguerre coefficients representing zero.
+lagzero = np.array([0])
+
+# Laguerre coefficients representing one.
+lagone = np.array([1])
+
+# Laguerre coefficients representing the identity x.
+lagx = np.array([1, -1])
+
+
+def lagline(off, scl):
+    """
+    Laguerre series whose graph is a straight line.
+
+
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The specified line is given by ``off + scl*x``.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the Laguerre series for
+        ``off + scl*x``.
+
+    See Also
+    --------
+    polyline, chebline
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagline, lagval
+    >>> lagval(0,lagline(3, 2))
+    3.0
+    >>> lagval(1,lagline(3, 2))
+    5.0
+
+    """
+    if scl != 0:
+        return np.array([off + scl, -scl])
+    else:
+        return np.array([off])
+
+
+def lagfromroots(roots):
+    """
+    Generate a Laguerre series with given roots.
+
+    The function returns the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    in Laguerre form, where the `r_n` are the roots specified in `roots`.
+    If a zero has multiplicity n, then it must appear in `roots` n times.
+    For instance, if 2 is a root of multiplicity three and 3 is a root of
+    multiplicity 2, then `roots` looks something like [2, 2, 2, 3, 3]. The
+    roots can appear in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * L_1(x) + ... +  c_n * L_n(x)
+
+    The coefficient of the last term is not generally 1 for monic
+    polynomials in Laguerre form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of coefficients.  If all roots are real then `out` is a
+        real array, if some of the roots are complex, then `out` is complex
+        even if all the coefficients in the result are real (see Examples
+        below).
+
+    See Also
+    --------
+    polyfromroots, legfromroots, chebfromroots, hermfromroots, hermefromroots
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagfromroots, lagval
+    >>> coef = lagfromroots((-1, 0, 1))
+    >>> lagval((-1, 0, 1), coef)
+    array([0.,  0.,  0.])
+    >>> coef = lagfromroots((-1j, 1j))
+    >>> lagval((-1j, 1j), coef)
+    array([0.+0.j, 0.+0.j])
+
+    """
+    return pu._fromroots(lagline, lagmul, roots)
+
+
+def lagadd(c1, c2):
+    """
+    Add one Laguerre series to another.
+
+    Returns the sum of two Laguerre series `c1` + `c2`.  The arguments
+    are sequences of coefficients ordered from lowest order term to
+    highest, i.e., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Laguerre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the Laguerre series of their sum.
+
+    See Also
+    --------
+    lagsub, lagmulx, lagmul, lagdiv, lagpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the sum of two Laguerre series
+    is a Laguerre series (without having to "reproject" the result onto
+    the basis set) so addition, just like that of "standard" polynomials,
+    is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagadd
+    >>> lagadd([1, 2, 3], [1, 2, 3, 4])
+    array([2.,  4.,  6.,  4.])
+
+
+    """
+    return pu._add(c1, c2)
+
+
+def lagsub(c1, c2):
+    """
+    Subtract one Laguerre series from another.
+
+    Returns the difference of two Laguerre series `c1` - `c2`.  The
+    sequences of coefficients are from lowest order term to highest, i.e.,
+    [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Laguerre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Laguerre series coefficients representing their difference.
+
+    See Also
+    --------
+    lagadd, lagmulx, lagmul, lagdiv, lagpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the difference of two Laguerre
+    series is a Laguerre series (without having to "reproject" the result
+    onto the basis set) so subtraction, just like that of "standard"
+    polynomials, is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagsub
+    >>> lagsub([1, 2, 3, 4], [1, 2, 3])
+    array([0.,  0.,  0.,  4.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def lagmulx(c):
+    """Multiply a Laguerre series by x.
+
+    Multiply the Laguerre series `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Laguerre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    See Also
+    --------
+    lagadd, lagsub, lagmul, lagdiv, lagpow
+
+    Notes
+    -----
+    The multiplication uses the recursion relationship for Laguerre
+    polynomials in the form
+
+    .. math::
+
+    xP_i(x) = (-(i + 1)*P_{i + 1}(x) + (2i + 1)P_{i}(x) - iP_{i - 1}(x))
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagmulx
+    >>> lagmulx([1, 2, 3])
+    array([-1.,  -1.,  11.,  -9.])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]
+    prd[1] = -c[0]
+    for i in range(1, len(c)):
+        prd[i + 1] = -c[i]*(i + 1)
+        prd[i] += c[i]*(2*i + 1)
+        prd[i - 1] -= c[i]*i
+    return prd
+
+
+def lagmul(c1, c2):
+    """
+    Multiply one Laguerre series by another.
+
+    Returns the product of two Laguerre series `c1` * `c2`.  The arguments
+    are sequences of coefficients, from lowest order "term" to highest,
+    e.g., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Laguerre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Laguerre series coefficients representing their product.
+
+    See Also
+    --------
+    lagadd, lagsub, lagmulx, lagdiv, lagpow
+
+    Notes
+    -----
+    In general, the (polynomial) product of two C-series results in terms
+    that are not in the Laguerre polynomial basis set.  Thus, to express
+    the product as a Laguerre series, it is necessary to "reproject" the
+    product onto said basis set, which may produce "unintuitive" (but
+    correct) results; see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagmul
+    >>> lagmul([1, 2, 3], [0, 1, 2])
+    array([  8., -13.,  38., -51.,  36.])
+
+    """
+    # s1, s2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+
+    if len(c1) > len(c2):
+        c = c2
+        xs = c1
+    else:
+        c = c1
+        xs = c2
+
+    if len(c) == 1:
+        c0 = c[0]*xs
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]*xs
+        c1 = c[1]*xs
+    else:
+        nd = len(c)
+        c0 = c[-2]*xs
+        c1 = c[-1]*xs
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = lagsub(c[-i]*xs, (c1*(nd - 1))/nd)
+            c1 = lagadd(tmp, lagsub((2*nd - 1)*c1, lagmulx(c1))/nd)
+    return lagadd(c0, lagsub(c1, lagmulx(c1)))
+
+
+def lagdiv(c1, c2):
+    """
+    Divide one Laguerre series by another.
+
+    Returns the quotient-with-remainder of two Laguerre series
+    `c1` / `c2`.  The arguments are sequences of coefficients from lowest
+    order "term" to highest, e.g., [1,2,3] represents the series
+    ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Laguerre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    [quo, rem] : ndarrays
+        Of Laguerre series coefficients representing the quotient and
+        remainder.
+
+    See Also
+    --------
+    lagadd, lagsub, lagmulx, lagmul, lagpow
+
+    Notes
+    -----
+    In general, the (polynomial) division of one Laguerre series by another
+    results in quotient and remainder terms that are not in the Laguerre
+    polynomial basis set.  Thus, to express these results as a Laguerre
+    series, it is necessary to "reproject" the results onto the Laguerre
+    basis set, which may produce "unintuitive" (but correct) results; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagdiv
+    >>> lagdiv([  8., -13.,  38., -51.,  36.], [0, 1, 2])
+    (array([1., 2., 3.]), array([0.]))
+    >>> lagdiv([  9., -12.,  38., -51.,  36.], [0, 1, 2])
+    (array([1., 2., 3.]), array([1., 1.]))
+
+    """
+    return pu._div(lagmul, c1, c2)
+
+
+def lagpow(c, pow, maxpower=16):
+    """Raise a Laguerre series to a power.
+
+    Returns the Laguerre series `c` raised to the power `pow`. The
+    argument `c` is a sequence of coefficients ordered from low to high.
+    i.e., [1,2,3] is the series  ``P_0 + 2*P_1 + 3*P_2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Laguerre series coefficients ordered from low to
+        high.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Laguerre series of power.
+
+    See Also
+    --------
+    lagadd, lagsub, lagmulx, lagmul, lagdiv
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagpow
+    >>> lagpow([1, 2, 3], 2)
+    array([ 14., -16.,  56., -72.,  54.])
+
+    """
+    return pu._pow(lagmul, c, pow, maxpower)
+
+
+def lagder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a Laguerre series.
+
+    Returns the Laguerre series coefficients `c` differentiated `m` times
+    along `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable). The argument
+    `c` is an array of coefficients from low to high degree along each
+    axis, e.g., [1,2,3] represents the series ``1*L_0 + 2*L_1 + 3*L_2``
+    while [[1,2],[1,2]] represents ``1*L_0(x)*L_0(y) + 1*L_1(x)*L_0(y) +
+    2*L_0(x)*L_1(y) + 2*L_1(x)*L_1(y)`` if axis=0 is ``x`` and axis=1 is
+    ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Laguerre series coefficients. If `c` is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change of
+        variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Laguerre series of the derivative.
+
+    See Also
+    --------
+    lagint
+
+    Notes
+    -----
+    In general, the result of differentiating a Laguerre series does not
+    resemble the same operation on a power series. Thus the result of this
+    function may be "unintuitive," albeit correct; see Examples section
+    below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagder
+    >>> lagder([ 1.,  1.,  1., -3.])
+    array([1.,  2.,  3.])
+    >>> lagder([ 1.,  0.,  0., -4.,  3.], m=2)
+    array([1.,  2.,  3.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=c.dtype)
+            for j in range(n, 1, -1):
+                der[j - 1] = -c[j]
+                c[j - 1] += c[j]
+            der[0] = -c[1]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def lagint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a Laguerre series.
+
+    Returns the Laguerre series coefficients `c` integrated `m` times from
+    `lbnd` along `axis`. At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.)  The argument `c` is an array of
+    coefficients from low to high degree along each axis, e.g., [1,2,3]
+    represents the series ``L_0 + 2*L_1 + 3*L_2`` while [[1,2],[1,2]]
+    represents ``1*L_0(x)*L_0(y) + 1*L_1(x)*L_0(y) + 2*L_0(x)*L_1(y) +
+    2*L_1(x)*L_1(y)`` if axis=0 is ``x`` and axis=1 is ``y``.
+
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Laguerre series coefficients. If `c` is multidimensional
+        the different axis correspond to different variables with the
+        degree in each axis given by the corresponding index.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at
+        ``lbnd`` is the first value in the list, the value of the second
+        integral at ``lbnd`` is the second value, etc.  If ``k == []`` (the
+        default), all constants are set to zero.  If ``m == 1``, a single
+        scalar can be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        Laguerre series coefficients of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 0``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    lagder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.
+    Why is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`.  Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a` - perhaps not what one would have first thought.
+
+    Also note that, in general, the result of integrating a C-series needs
+    to be "reprojected" onto the C-series basis set.  Thus, typically,
+    the result of this function is "unintuitive," albeit correct; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagint
+    >>> lagint([1,2,3])
+    array([ 1.,  1.,  1., -3.])
+    >>> lagint([1,2,3], m=2)
+    array([ 1.,  0.,  0., -4.,  3.])
+    >>> lagint([1,2,3], k=1)
+    array([ 2.,  1.,  1., -3.])
+    >>> lagint([1,2,3], lbnd=-1)
+    array([11.5,  1. ,  1. , -3. ])
+    >>> lagint([1,2], m=2, k=[1,2], lbnd=-1)
+    array([ 11.16666667,  -5.        ,  -3.        ,   2.        ]) # may vary
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    k = list(k) + [0]*(cnt - len(k))
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=c.dtype)
+            tmp[0] = c[0]
+            tmp[1] = -c[0]
+            for j in range(1, n):
+                tmp[j] += c[j]
+                tmp[j + 1] = -c[j]
+            tmp[0] += k[i] - lagval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def lagval(x, c, tensor=True):
+    """
+    Evaluate a Laguerre series at points x.
+
+    If `c` is of length `n + 1`, this function returns the value:
+
+    .. math:: p(x) = c_0 * L_0(x) + c_1 * L_1(x) + ... + c_n * L_n(x)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, algebra_like
+        The shape of the return value is described above.
+
+    See Also
+    --------
+    lagval2d, laggrid2d, lagval3d, laggrid3d
+
+    Notes
+    -----
+    The evaluation uses Clenshaw recursion, aka synthetic division.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagval
+    >>> coef = [1,2,3]
+    >>> lagval(1, coef)
+    -0.5
+    >>> lagval([[1,2],[3,4]], coef)
+    array([[-0.5, -4. ],
+           [-4.5, -2. ]])
+
+    """
+    c = np.array(c, ndmin=1, copy=False)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    if len(c) == 1:
+        c0 = c[0]
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]
+        c1 = c[1]
+    else:
+        nd = len(c)
+        c0 = c[-2]
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = c[-i] - (c1*(nd - 1))/nd
+            c1 = tmp + (c1*((2*nd - 1) - x))/nd
+    return c0 + c1*(1 - x)
+
+
+def lagval2d(x, y, c):
+    """
+    Evaluate a 2-D Laguerre series at points (x, y).
+
+    This function returns the values:
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * L_i(x) * L_j(y)
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` is a 1-D array a one is implicitly appended to its shape to make
+    it 2-D. The shape of the result will be c.shape[2:] + x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and if it isn't an ndarray it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in ``c[i,j]``. If `c` has
+        dimension greater than two the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points formed with
+        pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    lagval, laggrid2d, lagval3d, laggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(lagval, c, x, y)
+
+
+def laggrid2d(x, y, c):
+    """
+    Evaluate a 2-D Laguerre series on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * L_i(a) * L_j(b)
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape + y.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j is contained in `c[i,j]`. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional Chebyshev series at points in the
+        Cartesian product of `x` and `y`.
+
+    See Also
+    --------
+    lagval, lagval2d, lagval3d, laggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(lagval, c, x, y)
+
+
+def lagval3d(x, y, z, c):
+    """
+    Evaluate a 3-D Laguerre series at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * L_i(x) * L_j(y) * L_k(z)
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimension polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    lagval, lagval2d, laggrid2d, laggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(lagval, c, x, y, z)
+
+
+def laggrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D Laguerre series on the Cartesian product of x, y, and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * L_i(a) * L_j(b) * L_k(c)
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    lagval, lagval2d, laggrid2d, lagval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(lagval, c, x, y, z)
+
+
+def lagvander(x, deg):
+    """Pseudo-Vandermonde matrix of given degree.
+
+    Returns the pseudo-Vandermonde matrix of degree `deg` and sample points
+    `x`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = L_i(x)
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the degree of the Laguerre polynomial.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    array ``V = lagvander(x, n)``, then ``np.dot(V, c)`` and
+    ``lagval(x, c)`` are the same up to roundoff. This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of Laguerre series of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray
+        The pseudo-Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where The last index is the degree of the
+        corresponding Laguerre polynomial.  The dtype will be the same as
+        the converted `x`.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagvander
+    >>> x = np.array([0, 1, 2])
+    >>> lagvander(x, 3)
+    array([[ 1.        ,  1.        ,  1.        ,  1.        ],
+           [ 1.        ,  0.        , -0.5       , -0.66666667],
+           [ 1.        , -1.        , -1.        , -0.33333333]])
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    v[0] = x*0 + 1
+    if ideg > 0:
+        v[1] = 1 - x
+        for i in range(2, ideg + 1):
+            v[i] = (v[i-1]*(2*i - 1 - x) - v[i-2]*(i - 1))/i
+    return np.moveaxis(v, 0, -1)
+
+
+def lagvander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = L_i(x) * L_j(y),
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the degrees of
+    the Laguerre polynomials.
+
+    If ``V = lagvander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``lagval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D Laguerre
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    lagvander, lagvander3d, lagval2d, lagval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((lagvander, lagvander), (x, y), deg)
+
+
+def lagvander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = L_i(x)*L_j(y)*L_k(z),
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the degrees of the Laguerre polynomials.
+
+    If ``V = lagvander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and  ``np.dot(V, c.flat)`` and ``lagval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D Laguerre
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    lagvander, lagvander3d, lagval2d, lagval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((lagvander, lagvander, lagvander), (x, y, z), deg)
+
+
+def lagfit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least squares fit of Laguerre series to data.
+
+    Return the coefficients of a Laguerre series of degree `deg` that is the
+    least squares fit to the data values `y` given at points `x`. If `y` is
+    1-D the returned coefficients will also be 1-D. If `y` is 2-D multiple
+    fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * L_1(x) + ... + c_n * L_n(x),
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+    Returns
+    -------
+    coef : ndarray, shape (M,) or (M, K)
+        Laguerre coefficients ordered from low to high. If `y` was 2-D,
+        the coefficients for the data in column k  of `y` are in column
+        `k`.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.  The
+        warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    chebfit, legfit, polyfit, hermfit, hermefit
+    lagval : Evaluates a Laguerre series.
+    lagvander : pseudo Vandermonde matrix of Laguerre series.
+    lagweight : Laguerre weight function.
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the Laguerre series `p` that
+    minimizes the sum of the weighted squared errors
+
+    .. math:: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where the :math:`w_j` are the weights. This problem is solved by
+    setting up as the (typically) overdetermined matrix equation
+
+    .. math:: V(x) * c = w * y,
+
+    where `V` is the weighted pseudo Vandermonde matrix of `x`, `c` are the
+    coefficients to be solved for, `w` are the weights, and `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected, then a `RankWarning` will be issued. This means that the
+    coefficient values may be poorly determined. Using a lower order fit
+    will usually get rid of the warning.  The `rcond` parameter can also be
+    set to a value smaller than its default, but the resulting fit may be
+    spurious and have large contributions from roundoff error.
+
+    Fits using Laguerre series are probably most useful when the data can
+    be approximated by ``sqrt(w(x)) * p(x)``, where `w(x)` is the Laguerre
+    weight. In that case the weight ``sqrt(w(x[i]))`` should be used
+    together with data values ``y[i]/sqrt(w(x[i]))``. The weight function is
+    available as `lagweight`.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagfit, lagval
+    >>> x = np.linspace(0, 10)
+    >>> err = np.random.randn(len(x))/10
+    >>> y = lagval(x, [1, 2, 3]) + err
+    >>> lagfit(x, y, 2)
+    array([ 0.96971004,  2.00193749,  3.00288744]) # may vary
+
+    """
+    return pu._fit(lagvander, x, y, deg, rcond, full, w)
+
+
+def lagcompanion(c):
+    """
+    Return the companion matrix of c.
+
+    The usual companion matrix of the Laguerre polynomials is already
+    symmetric when `c` is a basis Laguerre polynomial, so no scaling is
+    applied.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Laguerre series coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[1 + c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    top = mat.reshape(-1)[1::n+1]
+    mid = mat.reshape(-1)[0::n+1]
+    bot = mat.reshape(-1)[n::n+1]
+    top[...] = -np.arange(1, n)
+    mid[...] = 2.*np.arange(n) + 1.
+    bot[...] = top
+    mat[:, -1] += (c[:-1]/c[-1])*n
+    return mat
+
+
+def lagroots(c):
+    """
+    Compute the roots of a Laguerre series.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * L_i(x).
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the series. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    polyroots, legroots, chebroots, hermroots, hermeroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the series for such
+    values. Roots with multiplicity greater than 1 will also show larger
+    errors as the value of the series near such points is relatively
+    insensitive to errors in the roots. Isolated roots near the origin can
+    be improved by a few iterations of Newton's method.
+
+    The Laguerre series basis polynomials aren't powers of `x` so the
+    results of this function may seem unintuitive.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.laguerre import lagroots, lagfromroots
+    >>> coef = lagfromroots([0, 1, 2])
+    >>> coef
+    array([  2.,  -8.,  12.,  -6.])
+    >>> lagroots(coef)
+    array([-4.4408921e-16,  1.0000000e+00,  2.0000000e+00])
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) <= 1:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([1 + c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = lagcompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+def laggauss(deg):
+    """
+    Gauss-Laguerre quadrature.
+
+    Computes the sample points and weights for Gauss-Laguerre quadrature.
+    These sample points and weights will correctly integrate polynomials of
+    degree :math:`2*deg - 1` or less over the interval :math:`[0, \\inf]`
+    with the weight function :math:`f(x) = \\exp(-x)`.
+
+    Parameters
+    ----------
+    deg : int
+        Number of sample points and weights. It must be >= 1.
+
+    Returns
+    -------
+    x : ndarray
+        1-D ndarray containing the sample points.
+    y : ndarray
+        1-D ndarray containing the weights.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    The results have only been tested up to degree 100 higher degrees may
+    be problematic. The weights are determined by using the fact that
+
+    .. math:: w_k = c / (L'_n(x_k) * L_{n-1}(x_k))
+
+    where :math:`c` is a constant independent of :math:`k` and :math:`x_k`
+    is the k'th root of :math:`L_n`, and then scaling the results to get
+    the right value when integrating 1.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg <= 0:
+        raise ValueError("deg must be a positive integer")
+
+    # first approximation of roots. We use the fact that the companion
+    # matrix is symmetric in this case in order to obtain better zeros.
+    c = np.array([0]*deg + [1])
+    m = lagcompanion(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = lagval(x, c)
+    df = lagval(x, lagder(c))
+    x -= dy/df
+
+    # compute the weights. We scale the factor to avoid possible numerical
+    # overflow.
+    fm = lagval(x, c[1:])
+    fm /= np.abs(fm).max()
+    df /= np.abs(df).max()
+    w = 1/(fm * df)
+
+    # scale w to get the right value, 1 in this case
+    w /= w.sum()
+
+    return x, w
+
+
+def lagweight(x):
+    """Weight function of the Laguerre polynomials.
+
+    The weight function is :math:`exp(-x)` and the interval of integration
+    is :math:`[0, \\inf]`. The Laguerre polynomials are orthogonal, but not
+    normalized, with respect to this weight function.
+
+    Parameters
+    ----------
+    x : array_like
+       Values at which the weight function will be computed.
+
+    Returns
+    -------
+    w : ndarray
+       The weight function at `x`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    w = np.exp(-x)
+    return w
+
+#
+# Laguerre series class
+#
+
+class Laguerre(ABCPolyBase):
+    """A Laguerre series class.
+
+    The Laguerre class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    attributes and methods listed in the `ABCPolyBase` documentation.
+
+    Parameters
+    ----------
+    coef : array_like
+        Laguerre coefficients in order of increasing degree, i.e,
+        ``(1, 2, 3)`` gives ``1*L_0(x) + 2*L_1(X) + 3*L_2(x)``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [0, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [0, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(lagadd)
+    _sub = staticmethod(lagsub)
+    _mul = staticmethod(lagmul)
+    _div = staticmethod(lagdiv)
+    _pow = staticmethod(lagpow)
+    _val = staticmethod(lagval)
+    _int = staticmethod(lagint)
+    _der = staticmethod(lagder)
+    _fit = staticmethod(lagfit)
+    _line = staticmethod(lagline)
+    _roots = staticmethod(lagroots)
+    _fromroots = staticmethod(lagfromroots)
+
+    # Virtual properties
+    nickname = 'lag'
+    domain = np.array(lagdomain)
+    window = np.array(lagdomain)
+    basis_name = 'L'
diff --git a/venv/Lib/site-packages/numpy/polynomial/legendre.py b/venv/Lib/site-packages/numpy/polynomial/legendre.py
new file mode 100644
index 000000000..47e47a7b6
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/legendre.py
@@ -0,0 +1,1648 @@
+"""
+==================================================
+Legendre Series (:mod:`numpy.polynomial.legendre`)
+==================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with Legendre series, including a `Legendre` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with such polynomials is in the
+docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+.. autosummary::
+   :toctree: generated/
+
+    Legendre
+
+Constants
+---------
+
+.. autosummary::
+   :toctree: generated/
+
+   legdomain
+   legzero
+   legone
+   legx
+
+Arithmetic
+----------
+
+.. autosummary::
+   :toctree: generated/
+
+   legadd
+   legsub
+   legmulx
+   legmul
+   legdiv
+   legpow
+   legval
+   legval2d
+   legval3d
+   leggrid2d
+   leggrid3d
+
+Calculus
+--------
+
+.. autosummary::
+   :toctree: generated/
+
+   legder
+   legint
+
+Misc Functions
+--------------
+
+.. autosummary::
+   :toctree: generated/
+
+   legfromroots
+   legroots
+   legvander
+   legvander2d
+   legvander3d
+   leggauss
+   legweight
+   legcompanion
+   legfit
+   legtrim
+   legline
+   leg2poly
+   poly2leg
+
+See also
+--------
+numpy.polynomial
+
+"""
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+__all__ = [
+    'legzero', 'legone', 'legx', 'legdomain', 'legline', 'legadd',
+    'legsub', 'legmulx', 'legmul', 'legdiv', 'legpow', 'legval', 'legder',
+    'legint', 'leg2poly', 'poly2leg', 'legfromroots', 'legvander',
+    'legfit', 'legtrim', 'legroots', 'Legendre', 'legval2d', 'legval3d',
+    'leggrid2d', 'leggrid3d', 'legvander2d', 'legvander3d', 'legcompanion',
+    'leggauss', 'legweight']
+
+legtrim = pu.trimcoef
+
+
+def poly2leg(pol):
+    """
+    Convert a polynomial to a Legendre series.
+
+    Convert an array representing the coefficients of a polynomial (relative
+    to the "standard" basis) ordered from lowest degree to highest, to an
+    array of the coefficients of the equivalent Legendre series, ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    pol : array_like
+        1-D array containing the polynomial coefficients
+
+    Returns
+    -------
+    c : ndarray
+        1-D array containing the coefficients of the equivalent Legendre
+        series.
+
+    See Also
+    --------
+    leg2poly
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy import polynomial as P
+    >>> p = P.Polynomial(np.arange(4))
+    >>> p
+    Polynomial([0.,  1.,  2.,  3.], domain=[-1,  1], window=[-1,  1])
+    >>> c = P.Legendre(P.legendre.poly2leg(p.coef))
+    >>> c
+    Legendre([ 1.  ,  3.25,  1.  ,  0.75], domain=[-1,  1], window=[-1,  1]) # may vary
+
+    """
+    [pol] = pu.as_series([pol])
+    deg = len(pol) - 1
+    res = 0
+    for i in range(deg, -1, -1):
+        res = legadd(legmulx(res), pol[i])
+    return res
+
+
+def leg2poly(c):
+    """
+    Convert a Legendre series to a polynomial.
+
+    Convert an array representing the coefficients of a Legendre series,
+    ordered from lowest degree to highest, to an array of the coefficients
+    of the equivalent polynomial (relative to the "standard" basis) ordered
+    from lowest to highest degree.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array containing the Legendre series coefficients, ordered
+        from lowest order term to highest.
+
+    Returns
+    -------
+    pol : ndarray
+        1-D array containing the coefficients of the equivalent polynomial
+        (relative to the "standard" basis) ordered from lowest order term
+        to highest.
+
+    See Also
+    --------
+    poly2leg
+
+    Notes
+    -----
+    The easy way to do conversions between polynomial basis sets
+    is to use the convert method of a class instance.
+
+    Examples
+    --------
+    >>> from numpy import polynomial as P
+    >>> c = P.Legendre(range(4))
+    >>> c
+    Legendre([0., 1., 2., 3.], domain=[-1,  1], window=[-1,  1])
+    >>> p = c.convert(kind=P.Polynomial)
+    >>> p
+    Polynomial([-1. , -3.5,  3. ,  7.5], domain=[-1.,  1.], window=[-1.,  1.])
+    >>> P.leg2poly(range(4))
+    array([-1. , -3.5,  3. ,  7.5])
+
+
+    """
+    from .polynomial import polyadd, polysub, polymulx
+
+    [c] = pu.as_series([c])
+    n = len(c)
+    if n < 3:
+        return c
+    else:
+        c0 = c[-2]
+        c1 = c[-1]
+        # i is the current degree of c1
+        for i in range(n - 1, 1, -1):
+            tmp = c0
+            c0 = polysub(c[i - 2], (c1*(i - 1))/i)
+            c1 = polyadd(tmp, (polymulx(c1)*(2*i - 1))/i)
+        return polyadd(c0, polymulx(c1))
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Legendre
+legdomain = np.array([-1, 1])
+
+# Legendre coefficients representing zero.
+legzero = np.array([0])
+
+# Legendre coefficients representing one.
+legone = np.array([1])
+
+# Legendre coefficients representing the identity x.
+legx = np.array([0, 1])
+
+
+def legline(off, scl):
+    """
+    Legendre series whose graph is a straight line.
+
+
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The specified line is given by ``off + scl*x``.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the Legendre series for
+        ``off + scl*x``.
+
+    See Also
+    --------
+    polyline, chebline
+
+    Examples
+    --------
+    >>> import numpy.polynomial.legendre as L
+    >>> L.legline(3,2)
+    array([3, 2])
+    >>> L.legval(-3, L.legline(3,2)) # should be -3
+    -3.0
+
+    """
+    if scl != 0:
+        return np.array([off, scl])
+    else:
+        return np.array([off])
+
+
+def legfromroots(roots):
+    """
+    Generate a Legendre series with given roots.
+
+    The function returns the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    in Legendre form, where the `r_n` are the roots specified in `roots`.
+    If a zero has multiplicity n, then it must appear in `roots` n times.
+    For instance, if 2 is a root of multiplicity three and 3 is a root of
+    multiplicity 2, then `roots` looks something like [2, 2, 2, 3, 3]. The
+    roots can appear in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * L_1(x) + ... +  c_n * L_n(x)
+
+    The coefficient of the last term is not generally 1 for monic
+    polynomials in Legendre form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of coefficients.  If all roots are real then `out` is a
+        real array, if some of the roots are complex, then `out` is complex
+        even if all the coefficients in the result are real (see Examples
+        below).
+
+    See Also
+    --------
+    polyfromroots, chebfromroots, lagfromroots, hermfromroots, hermefromroots
+
+    Examples
+    --------
+    >>> import numpy.polynomial.legendre as L
+    >>> L.legfromroots((-1,0,1)) # x^3 - x relative to the standard basis
+    array([ 0. , -0.4,  0. ,  0.4])
+    >>> j = complex(0,1)
+    >>> L.legfromroots((-j,j)) # x^2 + 1 relative to the standard basis
+    array([ 1.33333333+0.j,  0.00000000+0.j,  0.66666667+0.j]) # may vary
+
+    """
+    return pu._fromroots(legline, legmul, roots)
+
+
+def legadd(c1, c2):
+    """
+    Add one Legendre series to another.
+
+    Returns the sum of two Legendre series `c1` + `c2`.  The arguments
+    are sequences of coefficients ordered from lowest order term to
+    highest, i.e., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Legendre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the Legendre series of their sum.
+
+    See Also
+    --------
+    legsub, legmulx, legmul, legdiv, legpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the sum of two Legendre series
+    is a Legendre series (without having to "reproject" the result onto
+    the basis set) so addition, just like that of "standard" polynomials,
+    is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> L.legadd(c1,c2)
+    array([4.,  4.,  4.])
+
+    """
+    return pu._add(c1, c2)
+
+
+def legsub(c1, c2):
+    """
+    Subtract one Legendre series from another.
+
+    Returns the difference of two Legendre series `c1` - `c2`.  The
+    sequences of coefficients are from lowest order term to highest, i.e.,
+    [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Legendre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Legendre series coefficients representing their difference.
+
+    See Also
+    --------
+    legadd, legmulx, legmul, legdiv, legpow
+
+    Notes
+    -----
+    Unlike multiplication, division, etc., the difference of two Legendre
+    series is a Legendre series (without having to "reproject" the result
+    onto the basis set) so subtraction, just like that of "standard"
+    polynomials, is simply "component-wise."
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> L.legsub(c1,c2)
+    array([-2.,  0.,  2.])
+    >>> L.legsub(c2,c1) # -C.legsub(c1,c2)
+    array([ 2.,  0., -2.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def legmulx(c):
+    """Multiply a Legendre series by x.
+
+    Multiply the Legendre series `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Legendre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    See Also
+    --------
+    legadd, legmul, legmul, legdiv, legpow
+
+    Notes
+    -----
+    The multiplication uses the recursion relationship for Legendre
+    polynomials in the form
+
+    .. math::
+
+      xP_i(x) = ((i + 1)*P_{i + 1}(x) + i*P_{i - 1}(x))/(2i + 1)
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> L.legmulx([1,2,3])
+    array([ 0.66666667, 2.2, 1.33333333, 1.8]) # may vary
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]*0
+    prd[1] = c[0]
+    for i in range(1, len(c)):
+        j = i + 1
+        k = i - 1
+        s = i + j
+        prd[j] = (c[i]*j)/s
+        prd[k] += (c[i]*i)/s
+    return prd
+
+
+def legmul(c1, c2):
+    """
+    Multiply one Legendre series by another.
+
+    Returns the product of two Legendre series `c1` * `c2`.  The arguments
+    are sequences of coefficients, from lowest order "term" to highest,
+    e.g., [1,2,3] represents the series ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Legendre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of Legendre series coefficients representing their product.
+
+    See Also
+    --------
+    legadd, legsub, legmulx, legdiv, legpow
+
+    Notes
+    -----
+    In general, the (polynomial) product of two C-series results in terms
+    that are not in the Legendre polynomial basis set.  Thus, to express
+    the product as a Legendre series, it is necessary to "reproject" the
+    product onto said basis set, which may produce "unintuitive" (but
+    correct) results; see Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2)
+    >>> L.legmul(c1,c2) # multiplication requires "reprojection"
+    array([  4.33333333,  10.4       ,  11.66666667,   3.6       ]) # may vary
+
+    """
+    # s1, s2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+
+    if len(c1) > len(c2):
+        c = c2
+        xs = c1
+    else:
+        c = c1
+        xs = c2
+
+    if len(c) == 1:
+        c0 = c[0]*xs
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]*xs
+        c1 = c[1]*xs
+    else:
+        nd = len(c)
+        c0 = c[-2]*xs
+        c1 = c[-1]*xs
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = legsub(c[-i]*xs, (c1*(nd - 1))/nd)
+            c1 = legadd(tmp, (legmulx(c1)*(2*nd - 1))/nd)
+    return legadd(c0, legmulx(c1))
+
+
+def legdiv(c1, c2):
+    """
+    Divide one Legendre series by another.
+
+    Returns the quotient-with-remainder of two Legendre series
+    `c1` / `c2`.  The arguments are sequences of coefficients from lowest
+    order "term" to highest, e.g., [1,2,3] represents the series
+    ``P_0 + 2*P_1 + 3*P_2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of Legendre series coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    quo, rem : ndarrays
+        Of Legendre series coefficients representing the quotient and
+        remainder.
+
+    See Also
+    --------
+    legadd, legsub, legmulx, legmul, legpow
+
+    Notes
+    -----
+    In general, the (polynomial) division of one Legendre series by another
+    results in quotient and remainder terms that are not in the Legendre
+    polynomial basis set.  Thus, to express these results as a Legendre
+    series, it is necessary to "reproject" the results onto the Legendre
+    basis set, which may produce "unintuitive" (but correct) results; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> L.legdiv(c1,c2) # quotient "intuitive," remainder not
+    (array([3.]), array([-8., -4.]))
+    >>> c2 = (0,1,2,3)
+    >>> L.legdiv(c2,c1) # neither "intuitive"
+    (array([-0.07407407,  1.66666667]), array([-1.03703704, -2.51851852])) # may vary
+
+    """
+    return pu._div(legmul, c1, c2)
+
+
+def legpow(c, pow, maxpower=16):
+    """Raise a Legendre series to a power.
+
+    Returns the Legendre series `c` raised to the power `pow`. The
+    argument `c` is a sequence of coefficients ordered from low to high.
+    i.e., [1,2,3] is the series  ``P_0 + 2*P_1 + 3*P_2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Legendre series coefficients ordered from low to
+        high.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Legendre series of power.
+
+    See Also
+    --------
+    legadd, legsub, legmulx, legmul, legdiv
+
+    Examples
+    --------
+
+    """
+    return pu._pow(legmul, c, pow, maxpower)
+
+
+def legder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a Legendre series.
+
+    Returns the Legendre series coefficients `c` differentiated `m` times
+    along `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable). The argument
+    `c` is an array of coefficients from low to high degree along each
+    axis, e.g., [1,2,3] represents the series ``1*L_0 + 2*L_1 + 3*L_2``
+    while [[1,2],[1,2]] represents ``1*L_0(x)*L_0(y) + 1*L_1(x)*L_0(y) +
+    2*L_0(x)*L_1(y) + 2*L_1(x)*L_1(y)`` if axis=0 is ``x`` and axis=1 is
+    ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Legendre series coefficients. If c is multidimensional the
+        different axis correspond to different variables with the degree in
+        each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change of
+        variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Legendre series of the derivative.
+
+    See Also
+    --------
+    legint
+
+    Notes
+    -----
+    In general, the result of differentiating a Legendre series does not
+    resemble the same operation on a power series. Thus the result of this
+    function may be "unintuitive," albeit correct; see Examples section
+    below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c = (1,2,3,4)
+    >>> L.legder(c)
+    array([  6.,   9.,  20.])
+    >>> L.legder(c, 3)
+    array([60.])
+    >>> L.legder(c, scl=-1)
+    array([ -6.,  -9., -20.])
+    >>> L.legder(c, 2,-1)
+    array([  9.,  60.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=c.dtype)
+            for j in range(n, 2, -1):
+                der[j - 1] = (2*j - 1)*c[j]
+                c[j - 2] += c[j]
+            if n > 1:
+                der[1] = 3*c[2]
+            der[0] = c[1]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def legint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a Legendre series.
+
+    Returns the Legendre series coefficients `c` integrated `m` times from
+    `lbnd` along `axis`. At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.)  The argument `c` is an array of
+    coefficients from low to high degree along each axis, e.g., [1,2,3]
+    represents the series ``L_0 + 2*L_1 + 3*L_2`` while [[1,2],[1,2]]
+    represents ``1*L_0(x)*L_0(y) + 1*L_1(x)*L_0(y) + 2*L_0(x)*L_1(y) +
+    2*L_1(x)*L_1(y)`` if axis=0 is ``x`` and axis=1 is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of Legendre series coefficients. If c is multidimensional the
+        different axis correspond to different variables with the degree in
+        each axis given by the corresponding index.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at
+        ``lbnd`` is the first value in the list, the value of the second
+        integral at ``lbnd`` is the second value, etc.  If ``k == []`` (the
+        default), all constants are set to zero.  If ``m == 1``, a single
+        scalar can be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        Legendre series coefficient array of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 0``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    legder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.
+    Why is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`.  Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a` - perhaps not what one would have first thought.
+
+    Also note that, in general, the result of integrating a C-series needs
+    to be "reprojected" onto the C-series basis set.  Thus, typically,
+    the result of this function is "unintuitive," albeit correct; see
+    Examples section below.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import legendre as L
+    >>> c = (1,2,3)
+    >>> L.legint(c)
+    array([ 0.33333333,  0.4       ,  0.66666667,  0.6       ]) # may vary
+    >>> L.legint(c, 3)
+    array([  1.66666667e-02,  -1.78571429e-02,   4.76190476e-02, # may vary
+             -1.73472348e-18,   1.90476190e-02,   9.52380952e-03])
+    >>> L.legint(c, k=3)
+     array([ 3.33333333,  0.4       ,  0.66666667,  0.6       ]) # may vary
+    >>> L.legint(c, lbnd=-2)
+    array([ 7.33333333,  0.4       ,  0.66666667,  0.6       ]) # may vary
+    >>> L.legint(c, scl=2)
+    array([ 0.66666667,  0.8       ,  1.33333333,  1.2       ]) # may vary
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    k = list(k) + [0]*(cnt - len(k))
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=c.dtype)
+            tmp[0] = c[0]*0
+            tmp[1] = c[0]
+            if n > 1:
+                tmp[2] = c[1]/3
+            for j in range(2, n):
+                t = c[j]/(2*j + 1)
+                tmp[j + 1] = t
+                tmp[j - 1] -= t
+            tmp[0] += k[i] - legval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def legval(x, c, tensor=True):
+    """
+    Evaluate a Legendre series at points x.
+
+    If `c` is of length `n + 1`, this function returns the value:
+
+    .. math:: p(x) = c_0 * L_0(x) + c_1 * L_1(x) + ... + c_n * L_n(x)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, algebra_like
+        The shape of the return value is described above.
+
+    See Also
+    --------
+    legval2d, leggrid2d, legval3d, leggrid3d
+
+    Notes
+    -----
+    The evaluation uses Clenshaw recursion, aka synthetic division.
+
+    Examples
+    --------
+
+    """
+    c = np.array(c, ndmin=1, copy=False)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        c = c.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    if len(c) == 1:
+        c0 = c[0]
+        c1 = 0
+    elif len(c) == 2:
+        c0 = c[0]
+        c1 = c[1]
+    else:
+        nd = len(c)
+        c0 = c[-2]
+        c1 = c[-1]
+        for i in range(3, len(c) + 1):
+            tmp = c0
+            nd = nd - 1
+            c0 = c[-i] - (c1*(nd - 1))/nd
+            c1 = tmp + (c1*x*(2*nd - 1))/nd
+    return c0 + c1*x
+
+
+def legval2d(x, y, c):
+    """
+    Evaluate a 2-D Legendre series at points (x, y).
+
+    This function returns the values:
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * L_i(x) * L_j(y)
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` is a 1-D array a one is implicitly appended to its shape to make
+    it 2-D. The shape of the result will be c.shape[2:] + x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and if it isn't an ndarray it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in ``c[i,j]``. If `c` has
+        dimension greater than two the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional Legendre series at points formed
+        from pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    legval, leggrid2d, legval3d, leggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(legval, c, x, y)
+
+
+def leggrid2d(x, y, c):
+    """
+    Evaluate a 2-D Legendre series on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * L_i(a) * L_j(b)
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape + y.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j is contained in `c[i,j]`. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional Chebyshev series at points in the
+        Cartesian product of `x` and `y`.
+
+    See Also
+    --------
+    legval, legval2d, legval3d, leggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(legval, c, x, y)
+
+
+def legval3d(x, y, z, c):
+    """
+    Evaluate a 3-D Legendre series at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * L_i(x) * L_j(y) * L_k(z)
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimensional polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    legval, legval2d, leggrid2d, leggrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(legval, c, x, y, z)
+
+
+def leggrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D Legendre series on the Cartesian product of x, y, and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * L_i(a) * L_j(b) * L_k(c)
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    legval, legval2d, leggrid2d, legval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(legval, c, x, y, z)
+
+
+def legvander(x, deg):
+    """Pseudo-Vandermonde matrix of given degree.
+
+    Returns the pseudo-Vandermonde matrix of degree `deg` and sample points
+    `x`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = L_i(x)
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the degree of the Legendre polynomial.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    array ``V = legvander(x, n)``, then ``np.dot(V, c)`` and
+    ``legval(x, c)`` are the same up to roundoff. This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of Legendre series of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray
+        The pseudo-Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where The last index is the degree of the
+        corresponding Legendre polynomial.  The dtype will be the same as
+        the converted `x`.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    # Use forward recursion to generate the entries. This is not as accurate
+    # as reverse recursion in this application but it is more efficient.
+    v[0] = x*0 + 1
+    if ideg > 0:
+        v[1] = x
+        for i in range(2, ideg + 1):
+            v[i] = (v[i-1]*x*(2*i - 1) - v[i-2]*(i - 1))/i
+    return np.moveaxis(v, 0, -1)
+
+
+def legvander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = L_i(x) * L_j(y),
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the degrees of
+    the Legendre polynomials.
+
+    If ``V = legvander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``legval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D Legendre
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    legvander, legvander3d, legval2d, legval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((legvander, legvander), (x, y), deg)
+
+
+def legvander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = L_i(x)*L_j(y)*L_k(z),
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the degrees of the Legendre polynomials.
+
+    If ``V = legvander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and ``np.dot(V, c.flat)`` and ``legval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D Legendre
+    series of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg[1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    legvander, legvander3d, legval2d, legval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((legvander, legvander, legvander), (x, y, z), deg)
+
+
+def legfit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least squares fit of Legendre series to data.
+
+    Return the coefficients of a Legendre series of degree `deg` that is the
+    least squares fit to the data values `y` given at points `x`. If `y` is
+    1-D the returned coefficients will also be 1-D. If `y` is 2-D multiple
+    fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * L_1(x) + ... + c_n * L_n(x),
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (M,)
+        x-coordinates of the M sample points ``(x[i], y[i])``.
+    y : array_like, shape (M,) or (M, K)
+        y-coordinates of the sample points. Several data sets of sample
+        points sharing the same x-coordinates can be fitted at once by
+        passing in a 2D-array that contains one dataset per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit. Singular values smaller than
+        this relative to the largest singular value will be ignored. The
+        default value is len(x)*eps, where eps is the relative precision of
+        the float type, about 2e-16 in most cases.
+    full : bool, optional
+        Switch determining nature of return value. When it is False (the
+        default) just the coefficients are returned, when True diagnostic
+        information from the singular value decomposition is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+        .. versionadded:: 1.5.0
+
+    Returns
+    -------
+    coef : ndarray, shape (M,) or (M, K)
+        Legendre coefficients ordered from low to high. If `y` was
+        2-D, the coefficients for the data in column k of `y` are in
+        column `k`. If `deg` is specified as a list, coefficients for
+        terms not included in the fit are set equal to zero in the
+        returned `coef`.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Warns
+    -----
+    RankWarning
+        The rank of the coefficient matrix in the least-squares fit is
+        deficient. The warning is only raised if `full` = False.  The
+        warnings can be turned off by
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    chebfit, polyfit, lagfit, hermfit, hermefit
+    legval : Evaluates a Legendre series.
+    legvander : Vandermonde matrix of Legendre series.
+    legweight : Legendre weight function (= 1).
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the Legendre series `p` that
+    minimizes the sum of the weighted squared errors
+
+    .. math:: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where :math:`w_j` are the weights. This problem is solved by setting up
+    as the (typically) overdetermined matrix equation
+
+    .. math:: V(x) * c = w * y,
+
+    where `V` is the weighted pseudo Vandermonde matrix of `x`, `c` are the
+    coefficients to be solved for, `w` are the weights, and `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected, then a `RankWarning` will be issued. This means that the
+    coefficient values may be poorly determined. Using a lower order fit
+    will usually get rid of the warning.  The `rcond` parameter can also be
+    set to a value smaller than its default, but the resulting fit may be
+    spurious and have large contributions from roundoff error.
+
+    Fits using Legendre series are usually better conditioned than fits
+    using power series, but much can depend on the distribution of the
+    sample points and the smoothness of the data. If the quality of the fit
+    is inadequate splines may be a good alternative.
+
+    References
+    ----------
+    .. [1] Wikipedia, "Curve fitting",
+           https://en.wikipedia.org/wiki/Curve_fitting
+
+    Examples
+    --------
+
+    """
+    return pu._fit(legvander, x, y, deg, rcond, full, w)
+
+
+def legcompanion(c):
+    """Return the scaled companion matrix of c.
+
+    The basis polynomials are scaled so that the companion matrix is
+    symmetric when `c` is an Legendre basis polynomial. This provides
+    better eigenvalue estimates than the unscaled case and for basis
+    polynomials the eigenvalues are guaranteed to be real if
+    `numpy.linalg.eigvalsh` is used to obtain them.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of Legendre series coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Scaled companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[-c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    scl = 1./np.sqrt(2*np.arange(n) + 1)
+    top = mat.reshape(-1)[1::n+1]
+    bot = mat.reshape(-1)[n::n+1]
+    top[...] = np.arange(1, n)*scl[:n-1]*scl[1:n]
+    bot[...] = top
+    mat[:, -1] -= (c[:-1]/c[-1])*(scl/scl[-1])*(n/(2*n - 1))
+    return mat
+
+
+def legroots(c):
+    """
+    Compute the roots of a Legendre series.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * L_i(x).
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the series. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    polyroots, chebroots, lagroots, hermroots, hermeroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the series for such values.
+    Roots with multiplicity greater than 1 will also show larger errors as
+    the value of the series near such points is relatively insensitive to
+    errors in the roots. Isolated roots near the origin can be improved by
+    a few iterations of Newton's method.
+
+    The Legendre series basis polynomials aren't powers of ``x`` so the
+    results of this function may seem unintuitive.
+
+    Examples
+    --------
+    >>> import numpy.polynomial.legendre as leg
+    >>> leg.legroots((1, 2, 3, 4)) # 4L_3 + 3L_2 + 2L_1 + 1L_0, all real roots
+    array([-0.85099543, -0.11407192,  0.51506735]) # may vary
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([-c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = legcompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+def leggauss(deg):
+    """
+    Gauss-Legendre quadrature.
+
+    Computes the sample points and weights for Gauss-Legendre quadrature.
+    These sample points and weights will correctly integrate polynomials of
+    degree :math:`2*deg - 1` or less over the interval :math:`[-1, 1]` with
+    the weight function :math:`f(x) = 1`.
+
+    Parameters
+    ----------
+    deg : int
+        Number of sample points and weights. It must be >= 1.
+
+    Returns
+    -------
+    x : ndarray
+        1-D ndarray containing the sample points.
+    y : ndarray
+        1-D ndarray containing the weights.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    The results have only been tested up to degree 100, higher degrees may
+    be problematic. The weights are determined by using the fact that
+
+    .. math:: w_k = c / (L'_n(x_k) * L_{n-1}(x_k))
+
+    where :math:`c` is a constant independent of :math:`k` and :math:`x_k`
+    is the k'th root of :math:`L_n`, and then scaling the results to get
+    the right value when integrating 1.
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg <= 0:
+        raise ValueError("deg must be a positive integer")
+
+    # first approximation of roots. We use the fact that the companion
+    # matrix is symmetric in this case in order to obtain better zeros.
+    c = np.array([0]*deg + [1])
+    m = legcompanion(c)
+    x = la.eigvalsh(m)
+
+    # improve roots by one application of Newton
+    dy = legval(x, c)
+    df = legval(x, legder(c))
+    x -= dy/df
+
+    # compute the weights. We scale the factor to avoid possible numerical
+    # overflow.
+    fm = legval(x, c[1:])
+    fm /= np.abs(fm).max()
+    df /= np.abs(df).max()
+    w = 1/(fm * df)
+
+    # for Legendre we can also symmetrize
+    w = (w + w[::-1])/2
+    x = (x - x[::-1])/2
+
+    # scale w to get the right value
+    w *= 2. / w.sum()
+
+    return x, w
+
+
+def legweight(x):
+    """
+    Weight function of the Legendre polynomials.
+
+    The weight function is :math:`1` and the interval of integration is
+    :math:`[-1, 1]`. The Legendre polynomials are orthogonal, but not
+    normalized, with respect to this weight function.
+
+    Parameters
+    ----------
+    x : array_like
+       Values at which the weight function will be computed.
+
+    Returns
+    -------
+    w : ndarray
+       The weight function at `x`.
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    w = x*0.0 + 1.0
+    return w
+
+#
+# Legendre series class
+#
+
+class Legendre(ABCPolyBase):
+    """A Legendre series class.
+
+    The Legendre class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    attributes and methods listed in the `ABCPolyBase` documentation.
+
+    Parameters
+    ----------
+    coef : array_like
+        Legendre coefficients in order of increasing degree, i.e.,
+        ``(1, 2, 3)`` gives ``1*P_0(x) + 2*P_1(x) + 3*P_2(x)``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [-1, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [-1, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(legadd)
+    _sub = staticmethod(legsub)
+    _mul = staticmethod(legmul)
+    _div = staticmethod(legdiv)
+    _pow = staticmethod(legpow)
+    _val = staticmethod(legval)
+    _int = staticmethod(legint)
+    _der = staticmethod(legder)
+    _fit = staticmethod(legfit)
+    _line = staticmethod(legline)
+    _roots = staticmethod(legroots)
+    _fromroots = staticmethod(legfromroots)
+
+    # Virtual properties
+    nickname = 'leg'
+    domain = np.array(legdomain)
+    window = np.array(legdomain)
+    basis_name = 'P'
diff --git a/venv/Lib/site-packages/numpy/polynomial/polynomial.py b/venv/Lib/site-packages/numpy/polynomial/polynomial.py
new file mode 100644
index 000000000..2fb032db3
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/polynomial.py
@@ -0,0 +1,1507 @@
+"""
+=================================================
+Power Series (:mod:`numpy.polynomial.polynomial`)
+=================================================
+
+This module provides a number of objects (mostly functions) useful for
+dealing with polynomials, including a `Polynomial` class that
+encapsulates the usual arithmetic operations.  (General information
+on how this module represents and works with polynomial objects is in
+the docstring for its "parent" sub-package, `numpy.polynomial`).
+
+Classes
+-------
+.. autosummary::
+   :toctree: generated/
+
+   Polynomial
+
+Constants
+---------
+.. autosummary::
+   :toctree: generated/
+
+   polydomain
+   polyzero
+   polyone
+   polyx
+
+Arithmetic
+----------
+.. autosummary::
+   :toctree: generated/
+
+   polyadd
+   polysub
+   polymulx
+   polymul
+   polydiv
+   polypow
+   polyval
+   polyval2d
+   polyval3d
+   polygrid2d
+   polygrid3d
+
+Calculus
+--------
+.. autosummary::
+   :toctree: generated/
+
+   polyder
+   polyint
+
+Misc Functions
+--------------
+.. autosummary::
+   :toctree: generated/
+
+   polyfromroots
+   polyroots
+   polyvalfromroots
+   polyvander
+   polyvander2d
+   polyvander3d
+   polycompanion
+   polyfit
+   polytrim
+   polyline
+
+See Also
+--------
+`numpy.polynomial`
+
+"""
+__all__ = [
+    'polyzero', 'polyone', 'polyx', 'polydomain', 'polyline', 'polyadd',
+    'polysub', 'polymulx', 'polymul', 'polydiv', 'polypow', 'polyval',
+    'polyvalfromroots', 'polyder', 'polyint', 'polyfromroots', 'polyvander',
+    'polyfit', 'polytrim', 'polyroots', 'Polynomial', 'polyval2d', 'polyval3d',
+    'polygrid2d', 'polygrid3d', 'polyvander2d', 'polyvander3d']
+
+import numpy as np
+import numpy.linalg as la
+from numpy.core.multiarray import normalize_axis_index
+
+from . import polyutils as pu
+from ._polybase import ABCPolyBase
+
+polytrim = pu.trimcoef
+
+#
+# These are constant arrays are of integer type so as to be compatible
+# with the widest range of other types, such as Decimal.
+#
+
+# Polynomial default domain.
+polydomain = np.array([-1, 1])
+
+# Polynomial coefficients representing zero.
+polyzero = np.array([0])
+
+# Polynomial coefficients representing one.
+polyone = np.array([1])
+
+# Polynomial coefficients representing the identity x.
+polyx = np.array([0, 1])
+
+#
+# Polynomial series functions
+#
+
+
+def polyline(off, scl):
+    """
+    Returns an array representing a linear polynomial.
+
+    Parameters
+    ----------
+    off, scl : scalars
+        The "y-intercept" and "slope" of the line, respectively.
+
+    Returns
+    -------
+    y : ndarray
+        This module's representation of the linear polynomial ``off +
+        scl*x``.
+
+    See Also
+    --------
+    chebline
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> P.polyline(1,-1)
+    array([ 1, -1])
+    >>> P.polyval(1, P.polyline(1,-1)) # should be 0
+    0.0
+
+    """
+    if scl != 0:
+        return np.array([off, scl])
+    else:
+        return np.array([off])
+
+
+def polyfromroots(roots):
+    """
+    Generate a monic polynomial with given roots.
+
+    Return the coefficients of the polynomial
+
+    .. math:: p(x) = (x - r_0) * (x - r_1) * ... * (x - r_n),
+
+    where the `r_n` are the roots specified in `roots`.  If a zero has
+    multiplicity n, then it must appear in `roots` n times. For instance,
+    if 2 is a root of multiplicity three and 3 is a root of multiplicity 2,
+    then `roots` looks something like [2, 2, 2, 3, 3]. The roots can appear
+    in any order.
+
+    If the returned coefficients are `c`, then
+
+    .. math:: p(x) = c_0 + c_1 * x + ... +  x^n
+
+    The coefficient of the last term is 1 for monic polynomials in this
+    form.
+
+    Parameters
+    ----------
+    roots : array_like
+        Sequence containing the roots.
+
+    Returns
+    -------
+    out : ndarray
+        1-D array of the polynomial's coefficients If all the roots are
+        real, then `out` is also real, otherwise it is complex.  (see
+        Examples below).
+
+    See Also
+    --------
+    chebfromroots, legfromroots, lagfromroots, hermfromroots
+    hermefromroots
+
+    Notes
+    -----
+    The coefficients are determined by multiplying together linear factors
+    of the form `(x - r_i)`, i.e.
+
+    .. math:: p(x) = (x - r_0) (x - r_1) ... (x - r_n)
+
+    where ``n == len(roots) - 1``; note that this implies that `1` is always
+    returned for :math:`a_n`.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> P.polyfromroots((-1,0,1)) # x(x - 1)(x + 1) = x^3 - x
+    array([ 0., -1.,  0.,  1.])
+    >>> j = complex(0,1)
+    >>> P.polyfromroots((-j,j)) # complex returned, though values are real
+    array([1.+0.j,  0.+0.j,  1.+0.j])
+
+    """
+    return pu._fromroots(polyline, polymul, roots)
+
+
+def polyadd(c1, c2):
+    """
+    Add one polynomial to another.
+
+    Returns the sum of two polynomials `c1` + `c2`.  The arguments are
+    sequences of coefficients from lowest order term to highest, i.e.,
+    [1,2,3] represents the polynomial ``1 + 2*x + 3*x**2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of polynomial coefficients ordered from low to high.
+
+    Returns
+    -------
+    out : ndarray
+        The coefficient array representing their sum.
+
+    See Also
+    --------
+    polysub, polymulx, polymul, polydiv, polypow
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> sum = P.polyadd(c1,c2); sum
+    array([4.,  4.,  4.])
+    >>> P.polyval(2, sum) # 4 + 4(2) + 4(2**2)
+    28.0
+
+    """
+    return pu._add(c1, c2)
+
+
+def polysub(c1, c2):
+    """
+    Subtract one polynomial from another.
+
+    Returns the difference of two polynomials `c1` - `c2`.  The arguments
+    are sequences of coefficients from lowest order term to highest, i.e.,
+    [1,2,3] represents the polynomial ``1 + 2*x + 3*x**2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of polynomial coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Of coefficients representing their difference.
+
+    See Also
+    --------
+    polyadd, polymulx, polymul, polydiv, polypow
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> P.polysub(c1,c2)
+    array([-2.,  0.,  2.])
+    >>> P.polysub(c2,c1) # -P.polysub(c1,c2)
+    array([ 2.,  0., -2.])
+
+    """
+    return pu._sub(c1, c2)
+
+
+def polymulx(c):
+    """Multiply a polynomial by x.
+
+    Multiply the polynomial `c` by x, where x is the independent
+    variable.
+
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of polynomial coefficients ordered from low to
+        high.
+
+    Returns
+    -------
+    out : ndarray
+        Array representing the result of the multiplication.
+
+    See Also
+    --------
+    polyadd, polysub, polymul, polydiv, polypow
+
+    Notes
+    -----
+
+    .. versionadded:: 1.5.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    # The zero series needs special treatment
+    if len(c) == 1 and c[0] == 0:
+        return c
+
+    prd = np.empty(len(c) + 1, dtype=c.dtype)
+    prd[0] = c[0]*0
+    prd[1:] = c
+    return prd
+
+
+def polymul(c1, c2):
+    """
+    Multiply one polynomial by another.
+
+    Returns the product of two polynomials `c1` * `c2`.  The arguments are
+    sequences of coefficients, from lowest order term to highest, e.g.,
+    [1,2,3] represents the polynomial ``1 + 2*x + 3*x**2.``
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of coefficients representing a polynomial, relative to the
+        "standard" basis, and ordered from lowest order term to highest.
+
+    Returns
+    -------
+    out : ndarray
+        Of the coefficients of their product.
+
+    See Also
+    --------
+    polyadd, polysub, polymulx, polydiv, polypow
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> P.polymul(c1,c2)
+    array([  3.,   8.,  14.,   8.,   3.])
+
+    """
+    # c1, c2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+    ret = np.convolve(c1, c2)
+    return pu.trimseq(ret)
+
+
+def polydiv(c1, c2):
+    """
+    Divide one polynomial by another.
+
+    Returns the quotient-with-remainder of two polynomials `c1` / `c2`.
+    The arguments are sequences of coefficients, from lowest order term
+    to highest, e.g., [1,2,3] represents ``1 + 2*x + 3*x**2``.
+
+    Parameters
+    ----------
+    c1, c2 : array_like
+        1-D arrays of polynomial coefficients ordered from low to high.
+
+    Returns
+    -------
+    [quo, rem] : ndarrays
+        Of coefficient series representing the quotient and remainder.
+
+    See Also
+    --------
+    polyadd, polysub, polymulx, polymul, polypow
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c1 = (1,2,3)
+    >>> c2 = (3,2,1)
+    >>> P.polydiv(c1,c2)
+    (array([3.]), array([-8., -4.]))
+    >>> P.polydiv(c2,c1)
+    (array([ 0.33333333]), array([ 2.66666667,  1.33333333])) # may vary
+
+    """
+    # c1, c2 are trimmed copies
+    [c1, c2] = pu.as_series([c1, c2])
+    if c2[-1] == 0:
+        raise ZeroDivisionError()
+
+    # note: this is more efficient than `pu._div(polymul, c1, c2)`
+    lc1 = len(c1)
+    lc2 = len(c2)
+    if lc1 < lc2:
+        return c1[:1]*0, c1
+    elif lc2 == 1:
+        return c1/c2[-1], c1[:1]*0
+    else:
+        dlen = lc1 - lc2
+        scl = c2[-1]
+        c2 = c2[:-1]/scl
+        i = dlen
+        j = lc1 - 1
+        while i >= 0:
+            c1[i:j] -= c2*c1[j]
+            i -= 1
+            j -= 1
+        return c1[j+1:]/scl, pu.trimseq(c1[:j+1])
+
+
+def polypow(c, pow, maxpower=None):
+    """Raise a polynomial to a power.
+
+    Returns the polynomial `c` raised to the power `pow`. The argument
+    `c` is a sequence of coefficients ordered from low to high. i.e.,
+    [1,2,3] is the series  ``1 + 2*x + 3*x**2.``
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of array of series coefficients ordered from low to
+        high degree.
+    pow : integer
+        Power to which the series will be raised
+    maxpower : integer, optional
+        Maximum power allowed. This is mainly to limit growth of the series
+        to unmanageable size. Default is 16
+
+    Returns
+    -------
+    coef : ndarray
+        Power series of power.
+
+    See Also
+    --------
+    polyadd, polysub, polymulx, polymul, polydiv
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> P.polypow([1,2,3], 2)
+    array([ 1., 4., 10., 12., 9.])
+
+    """
+    # note: this is more efficient than `pu._pow(polymul, c1, c2)`, as it
+    # avoids calling `as_series` repeatedly
+    return pu._pow(np.convolve, c, pow, maxpower)
+
+
+def polyder(c, m=1, scl=1, axis=0):
+    """
+    Differentiate a polynomial.
+
+    Returns the polynomial coefficients `c` differentiated `m` times along
+    `axis`.  At each iteration the result is multiplied by `scl` (the
+    scaling factor is for use in a linear change of variable).  The
+    argument `c` is an array of coefficients from low to high degree along
+    each axis, e.g., [1,2,3] represents the polynomial ``1 + 2*x + 3*x**2``
+    while [[1,2],[1,2]] represents ``1 + 1*x + 2*y + 2*x*y`` if axis=0 is
+    ``x`` and axis=1 is ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        Array of polynomial coefficients. If c is multidimensional the
+        different axis correspond to different variables with the degree
+        in each axis given by the corresponding index.
+    m : int, optional
+        Number of derivatives taken, must be non-negative. (Default: 1)
+    scl : scalar, optional
+        Each differentiation is multiplied by `scl`.  The end result is
+        multiplication by ``scl**m``.  This is for use in a linear change
+        of variable. (Default: 1)
+    axis : int, optional
+        Axis over which the derivative is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    der : ndarray
+        Polynomial coefficients of the derivative.
+
+    See Also
+    --------
+    polyint
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c = (1,2,3,4) # 1 + 2x + 3x**2 + 4x**3
+    >>> P.polyder(c) # (d/dx)(c) = 2 + 6x + 12x**2
+    array([  2.,   6.,  12.])
+    >>> P.polyder(c,3) # (d**3/dx**3)(c) = 24
+    array([24.])
+    >>> P.polyder(c,scl=-1) # (d/d(-x))(c) = -2 - 6x - 12x**2
+    array([ -2.,  -6., -12.])
+    >>> P.polyder(c,2,-1) # (d**2/d(-x)**2)(c) = 6 + 24x
+    array([  6.,  24.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        # astype fails with NA
+        c = c + 0.0
+    cdt = c.dtype
+    cnt = pu._deprecate_as_int(m, "the order of derivation")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of derivation must be non-negative")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    c = np.moveaxis(c, iaxis, 0)
+    n = len(c)
+    if cnt >= n:
+        c = c[:1]*0
+    else:
+        for i in range(cnt):
+            n = n - 1
+            c *= scl
+            der = np.empty((n,) + c.shape[1:], dtype=cdt)
+            for j in range(n, 0, -1):
+                der[j - 1] = j*c[j]
+            c = der
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def polyint(c, m=1, k=[], lbnd=0, scl=1, axis=0):
+    """
+    Integrate a polynomial.
+
+    Returns the polynomial coefficients `c` integrated `m` times from
+    `lbnd` along `axis`.  At each iteration the resulting series is
+    **multiplied** by `scl` and an integration constant, `k`, is added.
+    The scaling factor is for use in a linear change of variable.  ("Buyer
+    beware": note that, depending on what one is doing, one may want `scl`
+    to be the reciprocal of what one might expect; for more information,
+    see the Notes section below.) The argument `c` is an array of
+    coefficients, from low to high degree along each axis, e.g., [1,2,3]
+    represents the polynomial ``1 + 2*x + 3*x**2`` while [[1,2],[1,2]]
+    represents ``1 + 1*x + 2*y + 2*x*y`` if axis=0 is ``x`` and axis=1 is
+    ``y``.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of polynomial coefficients, ordered from low to high.
+    m : int, optional
+        Order of integration, must be positive. (Default: 1)
+    k : {[], list, scalar}, optional
+        Integration constant(s).  The value of the first integral at zero
+        is the first value in the list, the value of the second integral
+        at zero is the second value, etc.  If ``k == []`` (the default),
+        all constants are set to zero.  If ``m == 1``, a single scalar can
+        be given instead of a list.
+    lbnd : scalar, optional
+        The lower bound of the integral. (Default: 0)
+    scl : scalar, optional
+        Following each integration the result is *multiplied* by `scl`
+        before the integration constant is added. (Default: 1)
+    axis : int, optional
+        Axis over which the integral is taken. (Default: 0).
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    S : ndarray
+        Coefficient array of the integral.
+
+    Raises
+    ------
+    ValueError
+        If ``m < 1``, ``len(k) > m``, ``np.ndim(lbnd) != 0``, or
+        ``np.ndim(scl) != 0``.
+
+    See Also
+    --------
+    polyder
+
+    Notes
+    -----
+    Note that the result of each integration is *multiplied* by `scl`.  Why
+    is this important to note?  Say one is making a linear change of
+    variable :math:`u = ax + b` in an integral relative to `x`. Then
+    :math:`dx = du/a`, so one will need to set `scl` equal to
+    :math:`1/a` - perhaps not what one would have first thought.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polynomial as P
+    >>> c = (1,2,3)
+    >>> P.polyint(c) # should return array([0, 1, 1, 1])
+    array([0.,  1.,  1.,  1.])
+    >>> P.polyint(c,3) # should return array([0, 0, 0, 1/6, 1/12, 1/20])
+     array([ 0.        ,  0.        ,  0.        ,  0.16666667,  0.08333333, # may vary
+             0.05      ])
+    >>> P.polyint(c,k=3) # should return array([3, 1, 1, 1])
+    array([3.,  1.,  1.,  1.])
+    >>> P.polyint(c,lbnd=-2) # should return array([6, 1, 1, 1])
+    array([6.,  1.,  1.,  1.])
+    >>> P.polyint(c,scl=-2) # should return array([0, -2, -2, -2])
+    array([ 0., -2., -2., -2.])
+
+    """
+    c = np.array(c, ndmin=1, copy=True)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        # astype doesn't preserve mask attribute.
+        c = c + 0.0
+    cdt = c.dtype
+    if not np.iterable(k):
+        k = [k]
+    cnt = pu._deprecate_as_int(m, "the order of integration")
+    iaxis = pu._deprecate_as_int(axis, "the axis")
+    if cnt < 0:
+        raise ValueError("The order of integration must be non-negative")
+    if len(k) > cnt:
+        raise ValueError("Too many integration constants")
+    if np.ndim(lbnd) != 0:
+        raise ValueError("lbnd must be a scalar.")
+    if np.ndim(scl) != 0:
+        raise ValueError("scl must be a scalar.")
+    iaxis = normalize_axis_index(iaxis, c.ndim)
+
+    if cnt == 0:
+        return c
+
+    k = list(k) + [0]*(cnt - len(k))
+    c = np.moveaxis(c, iaxis, 0)
+    for i in range(cnt):
+        n = len(c)
+        c *= scl
+        if n == 1 and np.all(c[0] == 0):
+            c[0] += k[i]
+        else:
+            tmp = np.empty((n + 1,) + c.shape[1:], dtype=cdt)
+            tmp[0] = c[0]*0
+            tmp[1] = c[0]
+            for j in range(1, n):
+                tmp[j + 1] = c[j]/(j + 1)
+            tmp[0] += k[i] - polyval(lbnd, tmp)
+            c = tmp
+    c = np.moveaxis(c, 0, iaxis)
+    return c
+
+
+def polyval(x, c, tensor=True):
+    """
+    Evaluate a polynomial at points x.
+
+    If `c` is of length `n + 1`, this function returns the value
+
+    .. math:: p(x) = c_0 + c_1 * x + ... + c_n * x^n
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `c`.
+
+    If `c` is a 1-D array, then `p(x)` will have the same shape as `x`.  If
+    `c` is multidimensional, then the shape of the result depends on the
+    value of `tensor`. If `tensor` is true the shape will be c.shape[1:] +
+    x.shape. If `tensor` is false the shape will be c.shape[1:]. Note that
+    scalars have shape (,).
+
+    Trailing zeros in the coefficients will be used in the evaluation, so
+    they should be avoided if efficiency is a concern.
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `c`.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree n are contained in c[n]. If `c` is multidimensional the
+        remaining indices enumerate multiple polynomials. In the two
+        dimensional case the coefficients may be thought of as stored in
+        the columns of `c`.
+    tensor : boolean, optional
+        If True, the shape of the coefficient array is extended with ones
+        on the right, one for each dimension of `x`. Scalars have dimension 0
+        for this action. The result is that every column of coefficients in
+        `c` is evaluated for every element of `x`. If False, `x` is broadcast
+        over the columns of `c` for the evaluation.  This keyword is useful
+        when `c` is multidimensional. The default value is True.
+
+        .. versionadded:: 1.7.0
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The shape of the returned array is described above.
+
+    See Also
+    --------
+    polyval2d, polygrid2d, polyval3d, polygrid3d
+
+    Notes
+    -----
+    The evaluation uses Horner's method.
+
+    Examples
+    --------
+    >>> from numpy.polynomial.polynomial import polyval
+    >>> polyval(1, [1,2,3])
+    6.0
+    >>> a = np.arange(4).reshape(2,2)
+    >>> a
+    array([[0, 1],
+           [2, 3]])
+    >>> polyval(a, [1,2,3])
+    array([[ 1.,   6.],
+           [17.,  34.]])
+    >>> coef = np.arange(4).reshape(2,2) # multidimensional coefficients
+    >>> coef
+    array([[0, 1],
+           [2, 3]])
+    >>> polyval([1,2], coef, tensor=True)
+    array([[2.,  4.],
+           [4.,  7.]])
+    >>> polyval([1,2], coef, tensor=False)
+    array([2.,  7.])
+
+    """
+    c = np.array(c, ndmin=1, copy=False)
+    if c.dtype.char in '?bBhHiIlLqQpP':
+        # astype fails with NA
+        c = c + 0.0
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray) and tensor:
+        c = c.reshape(c.shape + (1,)*x.ndim)
+
+    c0 = c[-1] + x*0
+    for i in range(2, len(c) + 1):
+        c0 = c[-i] + c0*x
+    return c0
+
+
+def polyvalfromroots(x, r, tensor=True):
+    """
+    Evaluate a polynomial specified by its roots at points x.
+
+    If `r` is of length `N`, this function returns the value
+
+    .. math:: p(x) = \\prod_{n=1}^{N} (x - r_n)
+
+    The parameter `x` is converted to an array only if it is a tuple or a
+    list, otherwise it is treated as a scalar. In either case, either `x`
+    or its elements must support multiplication and addition both with
+    themselves and with the elements of `r`.
+
+    If `r` is a 1-D array, then `p(x)` will have the same shape as `x`.  If `r`
+    is multidimensional, then the shape of the result depends on the value of
+    `tensor`. If `tensor is ``True`` the shape will be r.shape[1:] + x.shape;
+    that is, each polynomial is evaluated at every value of `x`. If `tensor` is
+    ``False``, the shape will be r.shape[1:]; that is, each polynomial is
+    evaluated only for the corresponding broadcast value of `x`. Note that
+    scalars have shape (,).
+
+    .. versionadded:: 1.12
+
+    Parameters
+    ----------
+    x : array_like, compatible object
+        If `x` is a list or tuple, it is converted to an ndarray, otherwise
+        it is left unchanged and treated as a scalar. In either case, `x`
+        or its elements must support addition and multiplication with
+        with themselves and with the elements of `r`.
+    r : array_like
+        Array of roots. If `r` is multidimensional the first index is the
+        root index, while the remaining indices enumerate multiple
+        polynomials. For instance, in the two dimensional case the roots
+        of each polynomial may be thought of as stored in the columns of `r`.
+    tensor : boolean, optional
+        If True, the shape of the roots array is extended with ones on the
+        right, one for each dimension of `x`. Scalars have dimension 0 for this
+        action. The result is that every column of coefficients in `r` is
+        evaluated for every element of `x`. If False, `x` is broadcast over the
+        columns of `r` for the evaluation.  This keyword is useful when `r` is
+        multidimensional. The default value is True.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The shape of the returned array is described above.
+
+    See Also
+    --------
+    polyroots, polyfromroots, polyval
+
+    Examples
+    --------
+    >>> from numpy.polynomial.polynomial import polyvalfromroots
+    >>> polyvalfromroots(1, [1,2,3])
+    0.0
+    >>> a = np.arange(4).reshape(2,2)
+    >>> a
+    array([[0, 1],
+           [2, 3]])
+    >>> polyvalfromroots(a, [-1, 0, 1])
+    array([[-0.,   0.],
+           [ 6.,  24.]])
+    >>> r = np.arange(-2, 2).reshape(2,2) # multidimensional coefficients
+    >>> r # each column of r defines one polynomial
+    array([[-2, -1],
+           [ 0,  1]])
+    >>> b = [-2, 1]
+    >>> polyvalfromroots(b, r, tensor=True)
+    array([[-0.,  3.],
+           [ 3., 0.]])
+    >>> polyvalfromroots(b, r, tensor=False)
+    array([-0.,  0.])
+    """
+    r = np.array(r, ndmin=1, copy=False)
+    if r.dtype.char in '?bBhHiIlLqQpP':
+        r = r.astype(np.double)
+    if isinstance(x, (tuple, list)):
+        x = np.asarray(x)
+    if isinstance(x, np.ndarray):
+        if tensor:
+            r = r.reshape(r.shape + (1,)*x.ndim)
+        elif x.ndim >= r.ndim:
+            raise ValueError("x.ndim must be < r.ndim when tensor == False")
+    return np.prod(x - r, axis=0)
+
+
+def polyval2d(x, y, c):
+    """
+    Evaluate a 2-D polynomial at points (x, y).
+
+    This function returns the value
+
+    .. math:: p(x,y) = \\sum_{i,j} c_{i,j} * x^i * y^j
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars and they
+    must have the same shape after conversion. In either case, either `x`
+    and `y` or their elements must support multiplication and addition both
+    with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points `(x, y)`,
+        where `x` and `y` must have the same shape. If `x` or `y` is a list
+        or tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term
+        of multi-degree i,j is contained in `c[i,j]`. If `c` has
+        dimension greater than two the remaining indices enumerate multiple
+        sets of coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points formed with
+        pairs of corresponding values from `x` and `y`.
+
+    See Also
+    --------
+    polyval, polygrid2d, polyval3d, polygrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(polyval, c, x, y)
+
+
+def polygrid2d(x, y, c):
+    """
+    Evaluate a 2-D polynomial on the Cartesian product of x and y.
+
+    This function returns the values:
+
+    .. math:: p(a,b) = \\sum_{i,j} c_{i,j} * a^i * b^j
+
+    where the points `(a, b)` consist of all pairs formed by taking
+    `a` from `x` and `b` from `y`. The resulting points form a grid with
+    `x` in the first dimension and `y` in the second.
+
+    The parameters `x` and `y` are converted to arrays only if they are
+    tuples or a lists, otherwise they are treated as a scalars. In either
+    case, either `x` and `y` or their elements must support multiplication
+    and addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than two dimensions, ones are implicitly appended to
+    its shape to make it 2-D. The shape of the result will be c.shape[2:] +
+    x.shape + y.shape.
+
+    Parameters
+    ----------
+    x, y : array_like, compatible objects
+        The two dimensional series is evaluated at the points in the
+        Cartesian product of `x` and `y`.  If `x` or `y` is a list or
+        tuple, it is first converted to an ndarray, otherwise it is left
+        unchanged and, if it isn't an ndarray, it is treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    polyval, polyval2d, polyval3d, polygrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(polyval, c, x, y)
+
+
+def polyval3d(x, y, z, c):
+    """
+    Evaluate a 3-D polynomial at points (x, y, z).
+
+    This function returns the values:
+
+    .. math:: p(x,y,z) = \\sum_{i,j,k} c_{i,j,k} * x^i * y^j * z^k
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if
+    they are tuples or a lists, otherwise they are treated as a scalars and
+    they must have the same shape after conversion. In either case, either
+    `x`, `y`, and `z` or their elements must support multiplication and
+    addition both with themselves and with the elements of `c`.
+
+    If `c` has fewer than 3 dimensions, ones are implicitly appended to its
+    shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible object
+        The three dimensional series is evaluated at the points
+        `(x, y, z)`, where `x`, `y`, and `z` must have the same shape.  If
+        any of `x`, `y`, or `z` is a list or tuple, it is first converted
+        to an ndarray, otherwise it is left unchanged and if it isn't an
+        ndarray it is  treated as a scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficient of the term of
+        multi-degree i,j,k is contained in ``c[i,j,k]``. If `c` has dimension
+        greater than 3 the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the multidimensional polynomial on points formed with
+        triples of corresponding values from `x`, `y`, and `z`.
+
+    See Also
+    --------
+    polyval, polyval2d, polygrid2d, polygrid3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._valnd(polyval, c, x, y, z)
+
+
+def polygrid3d(x, y, z, c):
+    """
+    Evaluate a 3-D polynomial on the Cartesian product of x, y and z.
+
+    This function returns the values:
+
+    .. math:: p(a,b,c) = \\sum_{i,j,k} c_{i,j,k} * a^i * b^j * c^k
+
+    where the points `(a, b, c)` consist of all triples formed by taking
+    `a` from `x`, `b` from `y`, and `c` from `z`. The resulting points form
+    a grid with `x` in the first dimension, `y` in the second, and `z` in
+    the third.
+
+    The parameters `x`, `y`, and `z` are converted to arrays only if they
+    are tuples or a lists, otherwise they are treated as a scalars. In
+    either case, either `x`, `y`, and `z` or their elements must support
+    multiplication and addition both with themselves and with the elements
+    of `c`.
+
+    If `c` has fewer than three dimensions, ones are implicitly appended to
+    its shape to make it 3-D. The shape of the result will be c.shape[3:] +
+    x.shape + y.shape + z.shape.
+
+    Parameters
+    ----------
+    x, y, z : array_like, compatible objects
+        The three dimensional series is evaluated at the points in the
+        Cartesian product of `x`, `y`, and `z`.  If `x`,`y`, or `z` is a
+        list or tuple, it is first converted to an ndarray, otherwise it is
+        left unchanged and, if it isn't an ndarray, it is treated as a
+        scalar.
+    c : array_like
+        Array of coefficients ordered so that the coefficients for terms of
+        degree i,j are contained in ``c[i,j]``. If `c` has dimension
+        greater than two the remaining indices enumerate multiple sets of
+        coefficients.
+
+    Returns
+    -------
+    values : ndarray, compatible object
+        The values of the two dimensional polynomial at points in the Cartesian
+        product of `x` and `y`.
+
+    See Also
+    --------
+    polyval, polyval2d, polygrid2d, polyval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._gridnd(polyval, c, x, y, z)
+
+
+def polyvander(x, deg):
+    """Vandermonde matrix of given degree.
+
+    Returns the Vandermonde matrix of degree `deg` and sample points
+    `x`. The Vandermonde matrix is defined by
+
+    .. math:: V[..., i] = x^i,
+
+    where `0 <= i <= deg`. The leading indices of `V` index the elements of
+    `x` and the last index is the power of `x`.
+
+    If `c` is a 1-D array of coefficients of length `n + 1` and `V` is the
+    matrix ``V = polyvander(x, n)``, then ``np.dot(V, c)`` and
+    ``polyval(x, c)`` are the same up to roundoff. This equivalence is
+    useful both for least squares fitting and for the evaluation of a large
+    number of polynomials of the same degree and sample points.
+
+    Parameters
+    ----------
+    x : array_like
+        Array of points. The dtype is converted to float64 or complex128
+        depending on whether any of the elements are complex. If `x` is
+        scalar it is converted to a 1-D array.
+    deg : int
+        Degree of the resulting matrix.
+
+    Returns
+    -------
+    vander : ndarray.
+        The Vandermonde matrix. The shape of the returned matrix is
+        ``x.shape + (deg + 1,)``, where the last index is the power of `x`.
+        The dtype will be the same as the converted `x`.
+
+    See Also
+    --------
+    polyvander2d, polyvander3d
+
+    """
+    ideg = pu._deprecate_as_int(deg, "deg")
+    if ideg < 0:
+        raise ValueError("deg must be non-negative")
+
+    x = np.array(x, copy=False, ndmin=1) + 0.0
+    dims = (ideg + 1,) + x.shape
+    dtyp = x.dtype
+    v = np.empty(dims, dtype=dtyp)
+    v[0] = x*0 + 1
+    if ideg > 0:
+        v[1] = x
+        for i in range(2, ideg + 1):
+            v[i] = v[i-1]*x
+    return np.moveaxis(v, 0, -1)
+
+
+def polyvander2d(x, y, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y)`. The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (deg[1] + 1)*i + j] = x^i * y^j,
+
+    where `0 <= i <= deg[0]` and `0 <= j <= deg[1]`. The leading indices of
+    `V` index the points `(x, y)` and the last index encodes the powers of
+    `x` and `y`.
+
+    If ``V = polyvander2d(x, y, [xdeg, ydeg])``, then the columns of `V`
+    correspond to the elements of a 2-D coefficient array `c` of shape
+    (xdeg + 1, ydeg + 1) in the order
+
+    .. math:: c_{00}, c_{01}, c_{02} ... , c_{10}, c_{11}, c_{12} ...
+
+    and ``np.dot(V, c.flat)`` and ``polyval2d(x, y, c)`` will be the same
+    up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 2-D polynomials
+    of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg].
+
+    Returns
+    -------
+    vander2d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg([1]+1)`.  The dtype will be the same
+        as the converted `x` and `y`.
+
+    See Also
+    --------
+    polyvander, polyvander3d, polyval2d, polyval3d
+
+    """
+    return pu._vander_nd_flat((polyvander, polyvander), (x, y), deg)
+
+
+def polyvander3d(x, y, z, deg):
+    """Pseudo-Vandermonde matrix of given degrees.
+
+    Returns the pseudo-Vandermonde matrix of degrees `deg` and sample
+    points `(x, y, z)`. If `l, m, n` are the given degrees in `x, y, z`,
+    then The pseudo-Vandermonde matrix is defined by
+
+    .. math:: V[..., (m+1)(n+1)i + (n+1)j + k] = x^i * y^j * z^k,
+
+    where `0 <= i <= l`, `0 <= j <= m`, and `0 <= j <= n`.  The leading
+    indices of `V` index the points `(x, y, z)` and the last index encodes
+    the powers of `x`, `y`, and `z`.
+
+    If ``V = polyvander3d(x, y, z, [xdeg, ydeg, zdeg])``, then the columns
+    of `V` correspond to the elements of a 3-D coefficient array `c` of
+    shape (xdeg + 1, ydeg + 1, zdeg + 1) in the order
+
+    .. math:: c_{000}, c_{001}, c_{002},... , c_{010}, c_{011}, c_{012},...
+
+    and  ``np.dot(V, c.flat)`` and ``polyval3d(x, y, z, c)`` will be the
+    same up to roundoff. This equivalence is useful both for least squares
+    fitting and for the evaluation of a large number of 3-D polynomials
+    of the same degrees and sample points.
+
+    Parameters
+    ----------
+    x, y, z : array_like
+        Arrays of point coordinates, all of the same shape. The dtypes will
+        be converted to either float64 or complex128 depending on whether
+        any of the elements are complex. Scalars are converted to 1-D
+        arrays.
+    deg : list of ints
+        List of maximum degrees of the form [x_deg, y_deg, z_deg].
+
+    Returns
+    -------
+    vander3d : ndarray
+        The shape of the returned matrix is ``x.shape + (order,)``, where
+        :math:`order = (deg[0]+1)*(deg([1]+1)*(deg[2]+1)`.  The dtype will
+        be the same as the converted `x`, `y`, and `z`.
+
+    See Also
+    --------
+    polyvander, polyvander3d, polyval2d, polyval3d
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    return pu._vander_nd_flat((polyvander, polyvander, polyvander), (x, y, z), deg)
+
+
+def polyfit(x, y, deg, rcond=None, full=False, w=None):
+    """
+    Least-squares fit of a polynomial to data.
+
+    Return the coefficients of a polynomial of degree `deg` that is the
+    least squares fit to the data values `y` given at points `x`. If `y` is
+    1-D the returned coefficients will also be 1-D. If `y` is 2-D multiple
+    fits are done, one for each column of `y`, and the resulting
+    coefficients are stored in the corresponding columns of a 2-D return.
+    The fitted polynomial(s) are in the form
+
+    .. math::  p(x) = c_0 + c_1 * x + ... + c_n * x^n,
+
+    where `n` is `deg`.
+
+    Parameters
+    ----------
+    x : array_like, shape (`M`,)
+        x-coordinates of the `M` sample (data) points ``(x[i], y[i])``.
+    y : array_like, shape (`M`,) or (`M`, `K`)
+        y-coordinates of the sample points.  Several sets of sample points
+        sharing the same x-coordinates can be (independently) fit with one
+        call to `polyfit` by passing in for `y` a 2-D array that contains
+        one data set per column.
+    deg : int or 1-D array_like
+        Degree(s) of the fitting polynomials. If `deg` is a single integer
+        all terms up to and including the `deg`'th term are included in the
+        fit. For NumPy versions >= 1.11.0 a list of integers specifying the
+        degrees of the terms to include may be used instead.
+    rcond : float, optional
+        Relative condition number of the fit.  Singular values smaller
+        than `rcond`, relative to the largest singular value, will be
+        ignored.  The default value is ``len(x)*eps``, where `eps` is the
+        relative precision of the platform's float type, about 2e-16 in
+        most cases.
+    full : bool, optional
+        Switch determining the nature of the return value.  When ``False``
+        (the default) just the coefficients are returned; when ``True``,
+        diagnostic information from the singular value decomposition (used
+        to solve the fit's matrix equation) is also returned.
+    w : array_like, shape (`M`,), optional
+        Weights. If not None, the contribution of each point
+        ``(x[i],y[i])`` to the fit is weighted by `w[i]`. Ideally the
+        weights are chosen so that the errors of the products ``w[i]*y[i]``
+        all have the same variance.  The default value is None.
+
+        .. versionadded:: 1.5.0
+
+    Returns
+    -------
+    coef : ndarray, shape (`deg` + 1,) or (`deg` + 1, `K`)
+        Polynomial coefficients ordered from low to high.  If `y` was 2-D,
+        the coefficients in column `k` of `coef` represent the polynomial
+        fit to the data in `y`'s `k`-th column.
+
+    [residuals, rank, singular_values, rcond] : list
+        These values are only returned if `full` = True
+
+        resid -- sum of squared residuals of the least squares fit
+        rank -- the numerical rank of the scaled Vandermonde matrix
+        sv -- singular values of the scaled Vandermonde matrix
+        rcond -- value of `rcond`.
+
+        For more details, see `linalg.lstsq`.
+
+    Raises
+    ------
+    RankWarning
+        Raised if the matrix in the least-squares fit is rank deficient.
+        The warning is only raised if `full` == False.  The warnings can
+        be turned off by:
+
+        >>> import warnings
+        >>> warnings.simplefilter('ignore', np.RankWarning)
+
+    See Also
+    --------
+    chebfit, legfit, lagfit, hermfit, hermefit
+    polyval : Evaluates a polynomial.
+    polyvander : Vandermonde matrix for powers.
+    linalg.lstsq : Computes a least-squares fit from the matrix.
+    scipy.interpolate.UnivariateSpline : Computes spline fits.
+
+    Notes
+    -----
+    The solution is the coefficients of the polynomial `p` that minimizes
+    the sum of the weighted squared errors
+
+    .. math :: E = \\sum_j w_j^2 * |y_j - p(x_j)|^2,
+
+    where the :math:`w_j` are the weights. This problem is solved by
+    setting up the (typically) over-determined matrix equation:
+
+    .. math :: V(x) * c = w * y,
+
+    where `V` is the weighted pseudo Vandermonde matrix of `x`, `c` are the
+    coefficients to be solved for, `w` are the weights, and `y` are the
+    observed values.  This equation is then solved using the singular value
+    decomposition of `V`.
+
+    If some of the singular values of `V` are so small that they are
+    neglected (and `full` == ``False``), a `RankWarning` will be raised.
+    This means that the coefficient values may be poorly determined.
+    Fitting to a lower order polynomial will usually get rid of the warning
+    (but may not be what you want, of course; if you have independent
+    reason(s) for choosing the degree which isn't working, you may have to:
+    a) reconsider those reasons, and/or b) reconsider the quality of your
+    data).  The `rcond` parameter can also be set to a value smaller than
+    its default, but the resulting fit may be spurious and have large
+    contributions from roundoff error.
+
+    Polynomial fits using double precision tend to "fail" at about
+    (polynomial) degree 20. Fits using Chebyshev or Legendre series are
+    generally better conditioned, but much can still depend on the
+    distribution of the sample points and the smoothness of the data.  If
+    the quality of the fit is inadequate, splines may be a good
+    alternative.
+
+    Examples
+    --------
+    >>> np.random.seed(123)
+    >>> from numpy.polynomial import polynomial as P
+    >>> x = np.linspace(-1,1,51) # x "data": [-1, -0.96, ..., 0.96, 1]
+    >>> y = x**3 - x + np.random.randn(len(x)) # x^3 - x + N(0,1) "noise"
+    >>> c, stats = P.polyfit(x,y,3,full=True)
+    >>> np.random.seed(123)
+    >>> c # c[0], c[2] should be approx. 0, c[1] approx. -1, c[3] approx. 1
+    array([ 0.01909725, -1.30598256, -0.00577963,  1.02644286]) # may vary
+    >>> stats # note the large SSR, explaining the rather poor results
+     [array([ 38.06116253]), 4, array([ 1.38446749,  1.32119158,  0.50443316, # may vary
+              0.28853036]), 1.1324274851176597e-014]
+
+    Same thing without the added noise
+
+    >>> y = x**3 - x
+    >>> c, stats = P.polyfit(x,y,3,full=True)
+    >>> c # c[0], c[2] should be "very close to 0", c[1] ~= -1, c[3] ~= 1
+    array([-6.36925336e-18, -1.00000000e+00, -4.08053781e-16,  1.00000000e+00])
+    >>> stats # note the minuscule SSR
+    [array([  7.46346754e-31]), 4, array([ 1.38446749,  1.32119158, # may vary
+               0.50443316,  0.28853036]), 1.1324274851176597e-014]
+
+    """
+    return pu._fit(polyvander, x, y, deg, rcond, full, w)
+
+
+def polycompanion(c):
+    """
+    Return the companion matrix of c.
+
+    The companion matrix for power series cannot be made symmetric by
+    scaling the basis, so this function differs from those for the
+    orthogonal polynomials.
+
+    Parameters
+    ----------
+    c : array_like
+        1-D array of polynomial coefficients ordered from low to high
+        degree.
+
+    Returns
+    -------
+    mat : ndarray
+        Companion matrix of dimensions (deg, deg).
+
+    Notes
+    -----
+
+    .. versionadded:: 1.7.0
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        raise ValueError('Series must have maximum degree of at least 1.')
+    if len(c) == 2:
+        return np.array([[-c[0]/c[1]]])
+
+    n = len(c) - 1
+    mat = np.zeros((n, n), dtype=c.dtype)
+    bot = mat.reshape(-1)[n::n+1]
+    bot[...] = 1
+    mat[:, -1] -= c[:-1]/c[-1]
+    return mat
+
+
+def polyroots(c):
+    """
+    Compute the roots of a polynomial.
+
+    Return the roots (a.k.a. "zeros") of the polynomial
+
+    .. math:: p(x) = \\sum_i c[i] * x^i.
+
+    Parameters
+    ----------
+    c : 1-D array_like
+        1-D array of polynomial coefficients.
+
+    Returns
+    -------
+    out : ndarray
+        Array of the roots of the polynomial. If all the roots are real,
+        then `out` is also real, otherwise it is complex.
+
+    See Also
+    --------
+    chebroots
+
+    Notes
+    -----
+    The root estimates are obtained as the eigenvalues of the companion
+    matrix, Roots far from the origin of the complex plane may have large
+    errors due to the numerical instability of the power series for such
+    values. Roots with multiplicity greater than 1 will also show larger
+    errors as the value of the series near such points is relatively
+    insensitive to errors in the roots. Isolated roots near the origin can
+    be improved by a few iterations of Newton's method.
+
+    Examples
+    --------
+    >>> import numpy.polynomial.polynomial as poly
+    >>> poly.polyroots(poly.polyfromroots((-1,0,1)))
+    array([-1.,  0.,  1.])
+    >>> poly.polyroots(poly.polyfromroots((-1,0,1))).dtype
+    dtype('float64')
+    >>> j = complex(0,1)
+    >>> poly.polyroots(poly.polyfromroots((-j,0,j)))
+    array([  0.00000000e+00+0.j,   0.00000000e+00+1.j,   2.77555756e-17-1.j]) # may vary
+
+    """
+    # c is a trimmed copy
+    [c] = pu.as_series([c])
+    if len(c) < 2:
+        return np.array([], dtype=c.dtype)
+    if len(c) == 2:
+        return np.array([-c[0]/c[1]])
+
+    # rotated companion matrix reduces error
+    m = polycompanion(c)[::-1,::-1]
+    r = la.eigvals(m)
+    r.sort()
+    return r
+
+
+#
+# polynomial class
+#
+
+class Polynomial(ABCPolyBase):
+    """A power series class.
+
+    The Polynomial class provides the standard Python numerical methods
+    '+', '-', '*', '//', '%', 'divmod', '**', and '()' as well as the
+    attributes and methods listed in the `ABCPolyBase` documentation.
+
+    Parameters
+    ----------
+    coef : array_like
+        Polynomial coefficients in order of increasing degree, i.e.,
+        ``(1, 2, 3)`` give ``1 + 2*x + 3*x**2``.
+    domain : (2,) array_like, optional
+        Domain to use. The interval ``[domain[0], domain[1]]`` is mapped
+        to the interval ``[window[0], window[1]]`` by shifting and scaling.
+        The default value is [-1, 1].
+    window : (2,) array_like, optional
+        Window, see `domain` for its use. The default value is [-1, 1].
+
+        .. versionadded:: 1.6.0
+
+    """
+    # Virtual Functions
+    _add = staticmethod(polyadd)
+    _sub = staticmethod(polysub)
+    _mul = staticmethod(polymul)
+    _div = staticmethod(polydiv)
+    _pow = staticmethod(polypow)
+    _val = staticmethod(polyval)
+    _int = staticmethod(polyint)
+    _der = staticmethod(polyder)
+    _fit = staticmethod(polyfit)
+    _line = staticmethod(polyline)
+    _roots = staticmethod(polyroots)
+    _fromroots = staticmethod(polyfromroots)
+
+    # Virtual properties
+    nickname = 'poly'
+    domain = np.array(polydomain)
+    window = np.array(polydomain)
+    basis_name = None
+
+    @staticmethod
+    def _repr_latex_term(i, arg_str, needs_parens):
+        if needs_parens:
+            arg_str = rf"\left({arg_str}\right)"
+        if i == 0:
+            return '1'
+        elif i == 1:
+            return arg_str
+        else:
+            return f"{arg_str}^{{{i}}}"
diff --git a/venv/Lib/site-packages/numpy/polynomial/polyutils.py b/venv/Lib/site-packages/numpy/polynomial/polyutils.py
new file mode 100644
index 000000000..b1cf07e8a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/polyutils.py
@@ -0,0 +1,796 @@
+"""
+Utility classes and functions for the polynomial modules.
+
+This module provides: error and warning objects; a polynomial base class;
+and some routines used in both the `polynomial` and `chebyshev` modules.
+
+Error objects
+-------------
+
+.. autosummary::
+   :toctree: generated/
+
+   PolyError            base class for this sub-package's errors.
+   PolyDomainError      raised when domains are mismatched.
+
+Warning objects
+---------------
+
+.. autosummary::
+   :toctree: generated/
+
+   RankWarning  raised in least-squares fit for rank-deficient matrix.
+
+Base class
+----------
+
+.. autosummary::
+   :toctree: generated/
+
+   PolyBase Obsolete base class for the polynomial classes. Do not use.
+
+Functions
+---------
+
+.. autosummary::
+   :toctree: generated/
+
+   as_series    convert list of array_likes into 1-D arrays of common type.
+   trimseq      remove trailing zeros.
+   trimcoef     remove small trailing coefficients.
+   getdomain    return the domain appropriate for a given set of abscissae.
+   mapdomain    maps points between domains.
+   mapparms     parameters of the linear map between domains.
+
+"""
+import operator
+import functools
+import warnings
+
+import numpy as np
+
+__all__ = [
+    'RankWarning', 'PolyError', 'PolyDomainError', 'as_series', 'trimseq',
+    'trimcoef', 'getdomain', 'mapdomain', 'mapparms', 'PolyBase']
+
+#
+# Warnings and Exceptions
+#
+
+class RankWarning(UserWarning):
+    """Issued by chebfit when the design matrix is rank deficient."""
+    pass
+
+class PolyError(Exception):
+    """Base class for errors in this module."""
+    pass
+
+class PolyDomainError(PolyError):
+    """Issued by the generic Poly class when two domains don't match.
+
+    This is raised when an binary operation is passed Poly objects with
+    different domains.
+
+    """
+    pass
+
+#
+# Base class for all polynomial types
+#
+
+class PolyBase:
+    """
+    Base class for all polynomial types.
+
+    Deprecated in numpy 1.9.0, use the abstract
+    ABCPolyBase class instead. Note that the latter
+    requires a number of virtual functions to be
+    implemented.
+
+    """
+    pass
+
+#
+# Helper functions to convert inputs to 1-D arrays
+#
+def trimseq(seq):
+    """Remove small Poly series coefficients.
+
+    Parameters
+    ----------
+    seq : sequence
+        Sequence of Poly series coefficients. This routine fails for
+        empty sequences.
+
+    Returns
+    -------
+    series : sequence
+        Subsequence with trailing zeros removed. If the resulting sequence
+        would be empty, return the first element. The returned sequence may
+        or may not be a view.
+
+    Notes
+    -----
+    Do not lose the type info if the sequence contains unknown objects.
+
+    """
+    if len(seq) == 0:
+        return seq
+    else:
+        for i in range(len(seq) - 1, -1, -1):
+            if seq[i] != 0:
+                break
+        return seq[:i+1]
+
+
+def as_series(alist, trim=True):
+    """
+    Return argument as a list of 1-d arrays.
+
+    The returned list contains array(s) of dtype double, complex double, or
+    object.  A 1-d argument of shape ``(N,)`` is parsed into ``N`` arrays of
+    size one; a 2-d argument of shape ``(M,N)`` is parsed into ``M`` arrays
+    of size ``N`` (i.e., is "parsed by row"); and a higher dimensional array
+    raises a Value Error if it is not first reshaped into either a 1-d or 2-d
+    array.
+
+    Parameters
+    ----------
+    alist : array_like
+        A 1- or 2-d array_like
+    trim : boolean, optional
+        When True, trailing zeros are removed from the inputs.
+        When False, the inputs are passed through intact.
+
+    Returns
+    -------
+    [a1, a2,...] : list of 1-D arrays
+        A copy of the input data as a list of 1-d arrays.
+
+    Raises
+    ------
+    ValueError
+        Raised when `as_series` cannot convert its input to 1-d arrays, or at
+        least one of the resulting arrays is empty.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polyutils as pu
+    >>> a = np.arange(4)
+    >>> pu.as_series(a)
+    [array([0.]), array([1.]), array([2.]), array([3.])]
+    >>> b = np.arange(6).reshape((2,3))
+    >>> pu.as_series(b)
+    [array([0., 1., 2.]), array([3., 4., 5.])]
+
+    >>> pu.as_series((1, np.arange(3), np.arange(2, dtype=np.float16)))
+    [array([1.]), array([0., 1., 2.]), array([0., 1.])]
+
+    >>> pu.as_series([2, [1.1, 0.]])
+    [array([2.]), array([1.1])]
+
+    >>> pu.as_series([2, [1.1, 0.]], trim=False)
+    [array([2.]), array([1.1, 0. ])]
+
+    """
+    arrays = [np.array(a, ndmin=1, copy=False) for a in alist]
+    if min([a.size for a in arrays]) == 0:
+        raise ValueError("Coefficient array is empty")
+    if any([a.ndim != 1 for a in arrays]):
+        raise ValueError("Coefficient array is not 1-d")
+    if trim:
+        arrays = [trimseq(a) for a in arrays]
+
+    if any([a.dtype == np.dtype(object) for a in arrays]):
+        ret = []
+        for a in arrays:
+            if a.dtype != np.dtype(object):
+                tmp = np.empty(len(a), dtype=np.dtype(object))
+                tmp[:] = a[:]
+                ret.append(tmp)
+            else:
+                ret.append(a.copy())
+    else:
+        try:
+            dtype = np.common_type(*arrays)
+        except Exception as e:
+            raise ValueError("Coefficient arrays have no common type") from e
+        ret = [np.array(a, copy=True, dtype=dtype) for a in arrays]
+    return ret
+
+
+def trimcoef(c, tol=0):
+    """
+    Remove "small" "trailing" coefficients from a polynomial.
+
+    "Small" means "small in absolute value" and is controlled by the
+    parameter `tol`; "trailing" means highest order coefficient(s), e.g., in
+    ``[0, 1, 1, 0, 0]`` (which represents ``0 + x + x**2 + 0*x**3 + 0*x**4``)
+    both the 3-rd and 4-th order coefficients would be "trimmed."
+
+    Parameters
+    ----------
+    c : array_like
+        1-d array of coefficients, ordered from lowest order to highest.
+    tol : number, optional
+        Trailing (i.e., highest order) elements with absolute value less
+        than or equal to `tol` (default value is zero) are removed.
+
+    Returns
+    -------
+    trimmed : ndarray
+        1-d array with trailing zeros removed.  If the resulting series
+        would be empty, a series containing a single zero is returned.
+
+    Raises
+    ------
+    ValueError
+        If `tol` < 0
+
+    See Also
+    --------
+    trimseq
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polyutils as pu
+    >>> pu.trimcoef((0,0,3,0,5,0,0))
+    array([0.,  0.,  3.,  0.,  5.])
+    >>> pu.trimcoef((0,0,1e-3,0,1e-5,0,0),1e-3) # item == tol is trimmed
+    array([0.])
+    >>> i = complex(0,1) # works for complex
+    >>> pu.trimcoef((3e-4,1e-3*(1-i),5e-4,2e-5*(1+i)), 1e-3)
+    array([0.0003+0.j   , 0.001 -0.001j])
+
+    """
+    if tol < 0:
+        raise ValueError("tol must be non-negative")
+
+    [c] = as_series([c])
+    [ind] = np.nonzero(np.abs(c) > tol)
+    if len(ind) == 0:
+        return c[:1]*0
+    else:
+        return c[:ind[-1] + 1].copy()
+
+def getdomain(x):
+    """
+    Return a domain suitable for given abscissae.
+
+    Find a domain suitable for a polynomial or Chebyshev series
+    defined at the values supplied.
+
+    Parameters
+    ----------
+    x : array_like
+        1-d array of abscissae whose domain will be determined.
+
+    Returns
+    -------
+    domain : ndarray
+        1-d array containing two values.  If the inputs are complex, then
+        the two returned points are the lower left and upper right corners
+        of the smallest rectangle (aligned with the axes) in the complex
+        plane containing the points `x`. If the inputs are real, then the
+        two points are the ends of the smallest interval containing the
+        points `x`.
+
+    See Also
+    --------
+    mapparms, mapdomain
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polyutils as pu
+    >>> points = np.arange(4)**2 - 5; points
+    array([-5, -4, -1,  4])
+    >>> pu.getdomain(points)
+    array([-5.,  4.])
+    >>> c = np.exp(complex(0,1)*np.pi*np.arange(12)/6) # unit circle
+    >>> pu.getdomain(c)
+    array([-1.-1.j,  1.+1.j])
+
+    """
+    [x] = as_series([x], trim=False)
+    if x.dtype.char in np.typecodes['Complex']:
+        rmin, rmax = x.real.min(), x.real.max()
+        imin, imax = x.imag.min(), x.imag.max()
+        return np.array((complex(rmin, imin), complex(rmax, imax)))
+    else:
+        return np.array((x.min(), x.max()))
+
+def mapparms(old, new):
+    """
+    Linear map parameters between domains.
+
+    Return the parameters of the linear map ``offset + scale*x`` that maps
+    `old` to `new` such that ``old[i] -> new[i]``, ``i = 0, 1``.
+
+    Parameters
+    ----------
+    old, new : array_like
+        Domains. Each domain must (successfully) convert to a 1-d array
+        containing precisely two values.
+
+    Returns
+    -------
+    offset, scale : scalars
+        The map ``L(x) = offset + scale*x`` maps the first domain to the
+        second.
+
+    See Also
+    --------
+    getdomain, mapdomain
+
+    Notes
+    -----
+    Also works for complex numbers, and thus can be used to calculate the
+    parameters required to map any line in the complex plane to any other
+    line therein.
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polyutils as pu
+    >>> pu.mapparms((-1,1),(-1,1))
+    (0.0, 1.0)
+    >>> pu.mapparms((1,-1),(-1,1))
+    (-0.0, -1.0)
+    >>> i = complex(0,1)
+    >>> pu.mapparms((-i,-1),(1,i))
+    ((1+1j), (1-0j))
+
+    """
+    oldlen = old[1] - old[0]
+    newlen = new[1] - new[0]
+    off = (old[1]*new[0] - old[0]*new[1])/oldlen
+    scl = newlen/oldlen
+    return off, scl
+
+def mapdomain(x, old, new):
+    """
+    Apply linear map to input points.
+
+    The linear map ``offset + scale*x`` that maps the domain `old` to
+    the domain `new` is applied to the points `x`.
+
+    Parameters
+    ----------
+    x : array_like
+        Points to be mapped. If `x` is a subtype of ndarray the subtype
+        will be preserved.
+    old, new : array_like
+        The two domains that determine the map.  Each must (successfully)
+        convert to 1-d arrays containing precisely two values.
+
+    Returns
+    -------
+    x_out : ndarray
+        Array of points of the same shape as `x`, after application of the
+        linear map between the two domains.
+
+    See Also
+    --------
+    getdomain, mapparms
+
+    Notes
+    -----
+    Effectively, this implements:
+
+    .. math ::
+        x\\_out = new[0] + m(x - old[0])
+
+    where
+
+    .. math ::
+        m = \\frac{new[1]-new[0]}{old[1]-old[0]}
+
+    Examples
+    --------
+    >>> from numpy.polynomial import polyutils as pu
+    >>> old_domain = (-1,1)
+    >>> new_domain = (0,2*np.pi)
+    >>> x = np.linspace(-1,1,6); x
+    array([-1. , -0.6, -0.2,  0.2,  0.6,  1. ])
+    >>> x_out = pu.mapdomain(x, old_domain, new_domain); x_out
+    array([ 0.        ,  1.25663706,  2.51327412,  3.76991118,  5.02654825, # may vary
+            6.28318531])
+    >>> x - pu.mapdomain(x_out, new_domain, old_domain)
+    array([0., 0., 0., 0., 0., 0.])
+
+    Also works for complex numbers (and thus can be used to map any line in
+    the complex plane to any other line therein).
+
+    >>> i = complex(0,1)
+    >>> old = (-1 - i, 1 + i)
+    >>> new = (-1 + i, 1 - i)
+    >>> z = np.linspace(old[0], old[1], 6); z
+    array([-1. -1.j , -0.6-0.6j, -0.2-0.2j,  0.2+0.2j,  0.6+0.6j,  1. +1.j ])
+    >>> new_z = pu.mapdomain(z, old, new); new_z
+    array([-1.0+1.j , -0.6+0.6j, -0.2+0.2j,  0.2-0.2j,  0.6-0.6j,  1.0-1.j ]) # may vary
+
+    """
+    x = np.asanyarray(x)
+    off, scl = mapparms(old, new)
+    return off + scl*x
+
+
+def _nth_slice(i, ndim):
+    sl = [np.newaxis] * ndim
+    sl[i] = slice(None)
+    return tuple(sl)
+
+
+def _vander_nd(vander_fs, points, degrees):
+    r"""
+    A generalization of the Vandermonde matrix for N dimensions
+
+    The result is built by combining the results of 1d Vandermonde matrices,
+
+    .. math::
+        W[i_0, \ldots, i_M, j_0, \ldots, j_N] = \prod_{k=0}^N{V_k(x_k)[i_0, \ldots, i_M, j_k]}
+
+    where
+
+    .. math::
+        N &= \texttt{len(points)} = \texttt{len(degrees)} = \texttt{len(vander\_fs)} \\
+        M &= \texttt{points[k].ndim} \\
+        V_k &= \texttt{vander\_fs[k]} \\
+        x_k &= \texttt{points[k]} \\
+        0 \le j_k &\le \texttt{degrees[k]}
+
+    Expanding the one-dimensional :math:`V_k` functions gives:
+
+    .. math::
+        W[i_0, \ldots, i_M, j_0, \ldots, j_N] = \prod_{k=0}^N{B_{k, j_k}(x_k[i_0, \ldots, i_M])}
+
+    where :math:`B_{k,m}` is the m'th basis of the polynomial construction used along
+    dimension :math:`k`. For a regular polynomial, :math:`B_{k, m}(x) = P_m(x) = x^m`.
+
+    Parameters
+    ----------
+    vander_fs : Sequence[function(array_like, int) -> ndarray]
+        The 1d vander function to use for each axis, such as ``polyvander``
+    points : Sequence[array_like]
+        Arrays of point coordinates, all of the same shape. The dtypes
+        will be converted to either float64 or complex128 depending on
+        whether any of the elements are complex. Scalars are converted to
+        1-D arrays.
+        This must be the same length as `vander_fs`.
+    degrees : Sequence[int]
+        The maximum degree (inclusive) to use for each axis.
+        This must be the same length as `vander_fs`.
+
+    Returns
+    -------
+    vander_nd : ndarray
+        An array of shape ``points[0].shape + tuple(d + 1 for d in degrees)``.
+    """
+    n_dims = len(vander_fs)
+    if n_dims != len(points):
+        raise ValueError(
+            f"Expected {n_dims} dimensions of sample points, got {len(points)}")
+    if n_dims != len(degrees):
+        raise ValueError(
+            f"Expected {n_dims} dimensions of degrees, got {len(degrees)}")
+    if n_dims == 0:
+        raise ValueError("Unable to guess a dtype or shape when no points are given")
+
+    # convert to the same shape and type
+    points = tuple(np.array(tuple(points), copy=False) + 0.0)
+
+    # produce the vandermonde matrix for each dimension, placing the last
+    # axis of each in an independent trailing axis of the output
+    vander_arrays = (
+        vander_fs[i](points[i], degrees[i])[(...,) + _nth_slice(i, n_dims)]
+        for i in range(n_dims)
+    )
+
+    # we checked this wasn't empty already, so no `initial` needed
+    return functools.reduce(operator.mul, vander_arrays)
+
+
+def _vander_nd_flat(vander_fs, points, degrees):
+    """
+    Like `_vander_nd`, but flattens the last ``len(degrees)`` axes into a single axis
+
+    Used to implement the public ``<type>vander<n>d`` functions.
+    """
+    v = _vander_nd(vander_fs, points, degrees)
+    return v.reshape(v.shape[:-len(degrees)] + (-1,))
+
+
+def _fromroots(line_f, mul_f, roots):
+    """
+    Helper function used to implement the ``<type>fromroots`` functions.
+
+    Parameters
+    ----------
+    line_f : function(float, float) -> ndarray
+        The ``<type>line`` function, such as ``polyline``
+    mul_f : function(array_like, array_like) -> ndarray
+        The ``<type>mul`` function, such as ``polymul``
+    roots :
+        See the ``<type>fromroots`` functions for more detail
+    """
+    if len(roots) == 0:
+        return np.ones(1)
+    else:
+        [roots] = as_series([roots], trim=False)
+        roots.sort()
+        p = [line_f(-r, 1) for r in roots]
+        n = len(p)
+        while n > 1:
+            m, r = divmod(n, 2)
+            tmp = [mul_f(p[i], p[i+m]) for i in range(m)]
+            if r:
+                tmp[0] = mul_f(tmp[0], p[-1])
+            p = tmp
+            n = m
+        return p[0]
+
+
+def _valnd(val_f, c, *args):
+    """
+    Helper function used to implement the ``<type>val<n>d`` functions.
+
+    Parameters
+    ----------
+    val_f : function(array_like, array_like, tensor: bool) -> array_like
+        The ``<type>val`` function, such as ``polyval``
+    c, args :
+        See the ``<type>val<n>d`` functions for more detail
+    """
+    args = [np.asanyarray(a) for a in args]
+    shape0 = args[0].shape
+    if not all((a.shape == shape0 for a in args[1:])):
+        if len(args) == 3:
+            raise ValueError('x, y, z are incompatible')
+        elif len(args) == 2:
+            raise ValueError('x, y are incompatible')
+        else:
+            raise ValueError('ordinates are incompatible')
+    it = iter(args)
+    x0 = next(it)
+
+    # use tensor on only the first
+    c = val_f(x0, c)
+    for xi in it:
+        c = val_f(xi, c, tensor=False)
+    return c
+
+
+def _gridnd(val_f, c, *args):
+    """
+    Helper function used to implement the ``<type>grid<n>d`` functions.
+
+    Parameters
+    ----------
+    val_f : function(array_like, array_like, tensor: bool) -> array_like
+        The ``<type>val`` function, such as ``polyval``
+    c, args :
+        See the ``<type>grid<n>d`` functions for more detail
+    """
+    for xi in args:
+        c = val_f(xi, c)
+    return c
+
+
+def _div(mul_f, c1, c2):
+    """
+    Helper function used to implement the ``<type>div`` functions.
+
+    Implementation uses repeated subtraction of c2 multiplied by the nth basis.
+    For some polynomial types, a more efficient approach may be possible.
+
+    Parameters
+    ----------
+    mul_f : function(array_like, array_like) -> array_like
+        The ``<type>mul`` function, such as ``polymul``
+    c1, c2 :
+        See the ``<type>div`` functions for more detail
+    """
+    # c1, c2 are trimmed copies
+    [c1, c2] = as_series([c1, c2])
+    if c2[-1] == 0:
+        raise ZeroDivisionError()
+
+    lc1 = len(c1)
+    lc2 = len(c2)
+    if lc1 < lc2:
+        return c1[:1]*0, c1
+    elif lc2 == 1:
+        return c1/c2[-1], c1[:1]*0
+    else:
+        quo = np.empty(lc1 - lc2 + 1, dtype=c1.dtype)
+        rem = c1
+        for i in range(lc1 - lc2, - 1, -1):
+            p = mul_f([0]*i + [1], c2)
+            q = rem[-1]/p[-1]
+            rem = rem[:-1] - q*p[:-1]
+            quo[i] = q
+        return quo, trimseq(rem)
+
+
+def _add(c1, c2):
+    """ Helper function used to implement the ``<type>add`` functions. """
+    # c1, c2 are trimmed copies
+    [c1, c2] = as_series([c1, c2])
+    if len(c1) > len(c2):
+        c1[:c2.size] += c2
+        ret = c1
+    else:
+        c2[:c1.size] += c1
+        ret = c2
+    return trimseq(ret)
+
+
+def _sub(c1, c2):
+    """ Helper function used to implement the ``<type>sub`` functions. """
+    # c1, c2 are trimmed copies
+    [c1, c2] = as_series([c1, c2])
+    if len(c1) > len(c2):
+        c1[:c2.size] -= c2
+        ret = c1
+    else:
+        c2 = -c2
+        c2[:c1.size] += c1
+        ret = c2
+    return trimseq(ret)
+
+
+def _fit(vander_f, x, y, deg, rcond=None, full=False, w=None):
+    """
+    Helper function used to implement the ``<type>fit`` functions.
+
+    Parameters
+    ----------
+    vander_f : function(array_like, int) -> ndarray
+        The 1d vander function, such as ``polyvander``
+    c1, c2 :
+        See the ``<type>fit`` functions for more detail
+    """
+    x = np.asarray(x) + 0.0
+    y = np.asarray(y) + 0.0
+    deg = np.asarray(deg)
+
+    # check arguments.
+    if deg.ndim > 1 or deg.dtype.kind not in 'iu' or deg.size == 0:
+        raise TypeError("deg must be an int or non-empty 1-D array of int")
+    if deg.min() < 0:
+        raise ValueError("expected deg >= 0")
+    if x.ndim != 1:
+        raise TypeError("expected 1D vector for x")
+    if x.size == 0:
+        raise TypeError("expected non-empty vector for x")
+    if y.ndim < 1 or y.ndim > 2:
+        raise TypeError("expected 1D or 2D array for y")
+    if len(x) != len(y):
+        raise TypeError("expected x and y to have same length")
+
+    if deg.ndim == 0:
+        lmax = deg
+        order = lmax + 1
+        van = vander_f(x, lmax)
+    else:
+        deg = np.sort(deg)
+        lmax = deg[-1]
+        order = len(deg)
+        van = vander_f(x, lmax)[:, deg]
+
+    # set up the least squares matrices in transposed form
+    lhs = van.T
+    rhs = y.T
+    if w is not None:
+        w = np.asarray(w) + 0.0
+        if w.ndim != 1:
+            raise TypeError("expected 1D vector for w")
+        if len(x) != len(w):
+            raise TypeError("expected x and w to have same length")
+        # apply weights. Don't use inplace operations as they
+        # can cause problems with NA.
+        lhs = lhs * w
+        rhs = rhs * w
+
+    # set rcond
+    if rcond is None:
+        rcond = len(x)*np.finfo(x.dtype).eps
+
+    # Determine the norms of the design matrix columns.
+    if issubclass(lhs.dtype.type, np.complexfloating):
+        scl = np.sqrt((np.square(lhs.real) + np.square(lhs.imag)).sum(1))
+    else:
+        scl = np.sqrt(np.square(lhs).sum(1))
+    scl[scl == 0] = 1
+
+    # Solve the least squares problem.
+    c, resids, rank, s = np.linalg.lstsq(lhs.T/scl, rhs.T, rcond)
+    c = (c.T/scl).T
+
+    # Expand c to include non-fitted coefficients which are set to zero
+    if deg.ndim > 0:
+        if c.ndim == 2:
+            cc = np.zeros((lmax+1, c.shape[1]), dtype=c.dtype)
+        else:
+            cc = np.zeros(lmax+1, dtype=c.dtype)
+        cc[deg] = c
+        c = cc
+
+    # warn on rank reduction
+    if rank != order and not full:
+        msg = "The fit may be poorly conditioned"
+        warnings.warn(msg, RankWarning, stacklevel=2)
+
+    if full:
+        return c, [resids, rank, s, rcond]
+    else:
+        return c
+
+
+def _pow(mul_f, c, pow, maxpower):
+    """
+    Helper function used to implement the ``<type>pow`` functions.
+
+    Parameters
+    ----------
+    vander_f : function(array_like, int) -> ndarray
+        The 1d vander function, such as ``polyvander``
+    pow, maxpower :
+        See the ``<type>pow`` functions for more detail
+    mul_f : function(array_like, array_like) -> ndarray
+        The ``<type>mul`` function, such as ``polymul``
+    """
+    # c is a trimmed copy
+    [c] = as_series([c])
+    power = int(pow)
+    if power != pow or power < 0:
+        raise ValueError("Power must be a non-negative integer.")
+    elif maxpower is not None and power > maxpower:
+        raise ValueError("Power is too large")
+    elif power == 0:
+        return np.array([1], dtype=c.dtype)
+    elif power == 1:
+        return c
+    else:
+        # This can be made more efficient by using powers of two
+        # in the usual way.
+        prd = c
+        for i in range(2, power + 1):
+            prd = mul_f(prd, c)
+        return prd
+
+
+def _deprecate_as_int(x, desc):
+    """
+    Like `operator.index`, but emits a deprecation warning when passed a float
+
+    Parameters
+    ----------
+    x : int-like, or float with integral value
+        Value to interpret as an integer
+    desc : str
+        description to include in any error message
+
+    Raises
+    ------
+    TypeError : if x is a non-integral float or non-numeric
+    DeprecationWarning : if x is an integral float
+    """
+    try:
+        return operator.index(x)
+    except TypeError as e:
+        # Numpy 1.17.0, 2019-03-11
+        try:
+            ix = int(x)
+        except TypeError:
+            pass
+        else:
+            if ix == x:
+                warnings.warn(
+                    f"In future, this will raise TypeError, as {desc} will "
+                    "need to be an integer not just an integral float.",
+                    DeprecationWarning,
+                    stacklevel=3
+                )
+                return ix
+
+        raise TypeError(f"{desc} must be an integer") from e
diff --git a/venv/Lib/site-packages/numpy/polynomial/setup.py b/venv/Lib/site-packages/numpy/polynomial/setup.py
new file mode 100644
index 000000000..641464518
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/setup.py
@@ -0,0 +1,9 @@
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('polynomial', parent_package, top_path)
+    config.add_subpackage('tests')
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__init__.py b/venv/Lib/site-packages/numpy/polynomial/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..ccb590e04
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_chebyshev.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_chebyshev.cpython-36.pyc
new file mode 100644
index 000000000..eef57c368
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_chebyshev.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_classes.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_classes.cpython-36.pyc
new file mode 100644
index 000000000..a05461dc1
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_classes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite.cpython-36.pyc
new file mode 100644
index 000000000..b0232a0d5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite_e.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite_e.cpython-36.pyc
new file mode 100644
index 000000000..2bfeb385f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_hermite_e.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_laguerre.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_laguerre.cpython-36.pyc
new file mode 100644
index 000000000..afbe0d71a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_laguerre.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_legendre.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_legendre.cpython-36.pyc
new file mode 100644
index 000000000..83aa080a6
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_legendre.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polynomial.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polynomial.cpython-36.pyc
new file mode 100644
index 000000000..30145df78
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polynomial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polyutils.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polyutils.cpython-36.pyc
new file mode 100644
index 000000000..5f9be9845
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_polyutils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_printing.cpython-36.pyc b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_printing.cpython-36.pyc
new file mode 100644
index 000000000..b9af59a99
Binary files /dev/null and b/venv/Lib/site-packages/numpy/polynomial/tests/__pycache__/test_printing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_chebyshev.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_chebyshev.py
new file mode 100644
index 000000000..2f54bebfd
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_chebyshev.py
@@ -0,0 +1,619 @@
+"""Tests for chebyshev module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.chebyshev as cheb
+from numpy.polynomial.polynomial import polyval
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+
+def trim(x):
+    return cheb.chebtrim(x, tol=1e-6)
+
+T0 = [1]
+T1 = [0, 1]
+T2 = [-1, 0, 2]
+T3 = [0, -3, 0, 4]
+T4 = [1, 0, -8, 0, 8]
+T5 = [0, 5, 0, -20, 0, 16]
+T6 = [-1, 0, 18, 0, -48, 0, 32]
+T7 = [0, -7, 0, 56, 0, -112, 0, 64]
+T8 = [1, 0, -32, 0, 160, 0, -256, 0, 128]
+T9 = [0, 9, 0, -120, 0, 432, 0, -576, 0, 256]
+
+Tlist = [T0, T1, T2, T3, T4, T5, T6, T7, T8, T9]
+
+
+class TestPrivate:
+
+    def test__cseries_to_zseries(self):
+        for i in range(5):
+            inp = np.array([2] + [1]*i, np.double)
+            tgt = np.array([.5]*i + [2] + [.5]*i, np.double)
+            res = cheb._cseries_to_zseries(inp)
+            assert_equal(res, tgt)
+
+    def test__zseries_to_cseries(self):
+        for i in range(5):
+            inp = np.array([.5]*i + [2] + [.5]*i, np.double)
+            tgt = np.array([2] + [1]*i, np.double)
+            res = cheb._zseries_to_cseries(inp)
+            assert_equal(res, tgt)
+
+
+class TestConstants:
+
+    def test_chebdomain(self):
+        assert_equal(cheb.chebdomain, [-1, 1])
+
+    def test_chebzero(self):
+        assert_equal(cheb.chebzero, [0])
+
+    def test_chebone(self):
+        assert_equal(cheb.chebone, [1])
+
+    def test_chebx(self):
+        assert_equal(cheb.chebx, [0, 1])
+
+
+class TestArithmetic:
+
+    def test_chebadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = cheb.chebadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_chebsub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = cheb.chebsub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_chebmulx(self):
+        assert_equal(cheb.chebmulx([0]), [0])
+        assert_equal(cheb.chebmulx([1]), [0, 1])
+        for i in range(1, 5):
+            ser = [0]*i + [1]
+            tgt = [0]*(i - 1) + [.5, 0, .5]
+            assert_equal(cheb.chebmulx(ser), tgt)
+
+    def test_chebmul(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(i + j + 1)
+                tgt[i + j] += .5
+                tgt[abs(i - j)] += .5
+                res = cheb.chebmul([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_chebdiv(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1]
+                cj = [0]*j + [1]
+                tgt = cheb.chebadd(ci, cj)
+                quo, rem = cheb.chebdiv(tgt, ci)
+                res = cheb.chebadd(cheb.chebmul(quo, ci), rem)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_chebpow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(cheb.chebmul, [c]*j, np.array([1]))
+                res = cheb.chebpow(c, j)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([2.5, 2., 1.5])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = polyval(x, [1., 2., 3.])
+
+    def test_chebval(self):
+        #check empty input
+        assert_equal(cheb.chebval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [polyval(x, c) for c in Tlist]
+        for i in range(10):
+            msg = f"At i={i}"
+            tgt = y[i]
+            res = cheb.chebval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt, err_msg=msg)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(cheb.chebval(x, [1]).shape, dims)
+            assert_equal(cheb.chebval(x, [1, 0]).shape, dims)
+            assert_equal(cheb.chebval(x, [1, 0, 0]).shape, dims)
+
+    def test_chebval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, cheb.chebval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = cheb.chebval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = cheb.chebval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_chebval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, cheb.chebval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = cheb.chebval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = cheb.chebval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_chebgrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = cheb.chebgrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = cheb.chebgrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_chebgrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = cheb.chebgrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = cheb.chebgrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_chebint(self):
+        # check exceptions
+        assert_raises(TypeError, cheb.chebint, [0], .5)
+        assert_raises(ValueError, cheb.chebint, [0], -1)
+        assert_raises(ValueError, cheb.chebint, [0], 1, [0, 0])
+        assert_raises(ValueError, cheb.chebint, [0], lbnd=[0])
+        assert_raises(ValueError, cheb.chebint, [0], scl=[0])
+        assert_raises(TypeError, cheb.chebint, [0], axis=.5)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = cheb.chebint([0], m=i, k=k)
+            assert_almost_equal(res, [0, 1])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            chebpol = cheb.poly2cheb(pol)
+            chebint = cheb.chebint(chebpol, m=1, k=[i])
+            res = cheb.cheb2poly(chebint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            chebpol = cheb.poly2cheb(pol)
+            chebint = cheb.chebint(chebpol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(cheb.chebval(-1, chebint), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            chebpol = cheb.poly2cheb(pol)
+            chebint = cheb.chebint(chebpol, m=1, k=[i], scl=2)
+            res = cheb.cheb2poly(chebint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = cheb.chebint(tgt, m=1)
+                res = cheb.chebint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = cheb.chebint(tgt, m=1, k=[k])
+                res = cheb.chebint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = cheb.chebint(tgt, m=1, k=[k], lbnd=-1)
+                res = cheb.chebint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = cheb.chebint(tgt, m=1, k=[k], scl=2)
+                res = cheb.chebint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_chebint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([cheb.chebint(c) for c in c2d.T]).T
+        res = cheb.chebint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([cheb.chebint(c) for c in c2d])
+        res = cheb.chebint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([cheb.chebint(c, k=3) for c in c2d])
+        res = cheb.chebint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_chebder(self):
+        # check exceptions
+        assert_raises(TypeError, cheb.chebder, [0], .5)
+        assert_raises(ValueError, cheb.chebder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = cheb.chebder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = cheb.chebder(cheb.chebint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = cheb.chebder(cheb.chebint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_chebder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([cheb.chebder(c) for c in c2d.T]).T
+        res = cheb.chebder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([cheb.chebder(c) for c in c2d])
+        res = cheb.chebder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_chebvander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = cheb.chebvander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], cheb.chebval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = cheb.chebvander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], cheb.chebval(x, coef))
+
+    def test_chebvander2d(self):
+        # also tests chebval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = cheb.chebvander2d(x1, x2, [1, 2])
+        tgt = cheb.chebval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = cheb.chebvander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_chebvander3d(self):
+        # also tests chebval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = cheb.chebvander3d(x1, x2, x3, [1, 2, 3])
+        tgt = cheb.chebval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = cheb.chebvander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestFitting:
+
+    def test_chebfit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        def f2(x):
+            return x**4 + x**2 + 1
+
+        # Test exceptions
+        assert_raises(ValueError, cheb.chebfit, [1], [1], -1)
+        assert_raises(TypeError, cheb.chebfit, [[1]], [1], 0)
+        assert_raises(TypeError, cheb.chebfit, [], [1], 0)
+        assert_raises(TypeError, cheb.chebfit, [1], [[[1]]], 0)
+        assert_raises(TypeError, cheb.chebfit, [1, 2], [1], 0)
+        assert_raises(TypeError, cheb.chebfit, [1], [1, 2], 0)
+        assert_raises(TypeError, cheb.chebfit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, cheb.chebfit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, cheb.chebfit, [1], [1], [-1,])
+        assert_raises(ValueError, cheb.chebfit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, cheb.chebfit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = cheb.chebfit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(cheb.chebval(x, coef3), y)
+        coef3 = cheb.chebfit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(cheb.chebval(x, coef3), y)
+        #
+        coef4 = cheb.chebfit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(cheb.chebval(x, coef4), y)
+        coef4 = cheb.chebfit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(cheb.chebval(x, coef4), y)
+        # check things still work if deg is not in strict increasing
+        coef4 = cheb.chebfit(x, y, [2, 3, 4, 1, 0])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(cheb.chebval(x, coef4), y)
+        #
+        coef2d = cheb.chebfit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = cheb.chebfit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        y[0::2] = 0
+        wcoef3 = cheb.chebfit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = cheb.chebfit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = cheb.chebfit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = cheb.chebfit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(cheb.chebfit(x, x, 1), [0, 1])
+        assert_almost_equal(cheb.chebfit(x, x, [0, 1]), [0, 1])
+        # test fitting only even polynomials
+        x = np.linspace(-1, 1)
+        y = f2(x)
+        coef1 = cheb.chebfit(x, y, 4)
+        assert_almost_equal(cheb.chebval(x, coef1), y)
+        coef2 = cheb.chebfit(x, y, [0, 2, 4])
+        assert_almost_equal(cheb.chebval(x, coef2), y)
+        assert_almost_equal(coef1, coef2)
+
+
+class TestInterpolate:
+
+    def f(self, x):
+        return x * (x - 1) * (x - 2)
+
+    def test_raises(self):
+        assert_raises(ValueError, cheb.chebinterpolate, self.f, -1)
+        assert_raises(TypeError, cheb.chebinterpolate, self.f, 10.)
+
+    def test_dimensions(self):
+        for deg in range(1, 5):
+            assert_(cheb.chebinterpolate(self.f, deg).shape == (deg + 1,))
+
+    def test_approximation(self):
+
+        def powx(x, p):
+            return x**p
+
+        x = np.linspace(-1, 1, 10)
+        for deg in range(0, 10):
+            for p in range(0, deg + 1):
+                c = cheb.chebinterpolate(powx, deg, (p,))
+                assert_almost_equal(cheb.chebval(x, c), powx(x, p), decimal=12)
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, cheb.chebcompanion, [])
+        assert_raises(ValueError, cheb.chebcompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(cheb.chebcompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(cheb.chebcompanion([1, 2])[0, 0] == -.5)
+
+
+class TestGauss:
+
+    def test_100(self):
+        x, w = cheb.chebgauss(100)
+
+        # test orthogonality. Note that the results need to be normalized,
+        # otherwise the huge values that can arise from fast growing
+        # functions like Laguerre can be very confusing.
+        v = cheb.chebvander(x, 99)
+        vv = np.dot(v.T * w, v)
+        vd = 1/np.sqrt(vv.diagonal())
+        vv = vd[:, None] * vv * vd
+        assert_almost_equal(vv, np.eye(100))
+
+        # check that the integral of 1 is correct
+        tgt = np.pi
+        assert_almost_equal(w.sum(), tgt)
+
+
+class TestMisc:
+
+    def test_chebfromroots(self):
+        res = cheb.chebfromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            tgt = [0]*i + [1]
+            res = cheb.chebfromroots(roots)*2**(i-1)
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_chebroots(self):
+        assert_almost_equal(cheb.chebroots([1]), [])
+        assert_almost_equal(cheb.chebroots([1, 2]), [-.5])
+        for i in range(2, 5):
+            tgt = np.linspace(-1, 1, i)
+            res = cheb.chebroots(cheb.chebfromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_chebtrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, cheb.chebtrim, coef, -1)
+
+        # Test results
+        assert_equal(cheb.chebtrim(coef), coef[:-1])
+        assert_equal(cheb.chebtrim(coef, 1), coef[:-3])
+        assert_equal(cheb.chebtrim(coef, 2), [0])
+
+    def test_chebline(self):
+        assert_equal(cheb.chebline(3, 4), [3, 4])
+
+    def test_cheb2poly(self):
+        for i in range(10):
+            assert_almost_equal(cheb.cheb2poly([0]*i + [1]), Tlist[i])
+
+    def test_poly2cheb(self):
+        for i in range(10):
+            assert_almost_equal(cheb.poly2cheb(Tlist[i]), [0]*i + [1])
+
+    def test_weight(self):
+        x = np.linspace(-1, 1, 11)[1:-1]
+        tgt = 1./(np.sqrt(1 + x) * np.sqrt(1 - x))
+        res = cheb.chebweight(x)
+        assert_almost_equal(res, tgt)
+
+    def test_chebpts1(self):
+        #test exceptions
+        assert_raises(ValueError, cheb.chebpts1, 1.5)
+        assert_raises(ValueError, cheb.chebpts1, 0)
+
+        #test points
+        tgt = [0]
+        assert_almost_equal(cheb.chebpts1(1), tgt)
+        tgt = [-0.70710678118654746, 0.70710678118654746]
+        assert_almost_equal(cheb.chebpts1(2), tgt)
+        tgt = [-0.86602540378443871, 0, 0.86602540378443871]
+        assert_almost_equal(cheb.chebpts1(3), tgt)
+        tgt = [-0.9238795325, -0.3826834323, 0.3826834323, 0.9238795325]
+        assert_almost_equal(cheb.chebpts1(4), tgt)
+
+    def test_chebpts2(self):
+        #test exceptions
+        assert_raises(ValueError, cheb.chebpts2, 1.5)
+        assert_raises(ValueError, cheb.chebpts2, 1)
+
+        #test points
+        tgt = [-1, 1]
+        assert_almost_equal(cheb.chebpts2(2), tgt)
+        tgt = [-1, 0, 1]
+        assert_almost_equal(cheb.chebpts2(3), tgt)
+        tgt = [-1, -0.5, .5, 1]
+        assert_almost_equal(cheb.chebpts2(4), tgt)
+        tgt = [-1.0, -0.707106781187, 0, 0.707106781187, 1.0]
+        assert_almost_equal(cheb.chebpts2(5), tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_classes.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_classes.py
new file mode 100644
index 000000000..8e71a1945
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_classes.py
@@ -0,0 +1,600 @@
+"""Test inter-conversion of different polynomial classes.
+
+This tests the convert and cast methods of all the polynomial classes.
+
+"""
+import operator as op
+from numbers import Number
+
+import pytest
+import numpy as np
+from numpy.polynomial import (
+    Polynomial, Legendre, Chebyshev, Laguerre, Hermite, HermiteE)
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+from numpy.polynomial.polyutils import RankWarning
+
+#
+# fixtures
+#
+
+classes = (
+    Polynomial, Legendre, Chebyshev, Laguerre,
+    Hermite, HermiteE
+    )
+classids = tuple(cls.__name__ for cls in classes)
+
+@pytest.fixture(params=classes, ids=classids)
+def Poly(request):
+    return request.param
+
+#
+# helper functions
+#
+random = np.random.random
+
+
+def assert_poly_almost_equal(p1, p2, msg=""):
+    try:
+        assert_(np.all(p1.domain == p2.domain))
+        assert_(np.all(p1.window == p2.window))
+        assert_almost_equal(p1.coef, p2.coef)
+    except AssertionError:
+        msg = f"Result: {p1}\nTarget: {p2}"
+        raise AssertionError(msg)
+
+
+#
+# Test conversion methods that depend on combinations of two classes.
+#
+
+Poly1 = Poly
+Poly2 = Poly
+
+
+def test_conversion(Poly1, Poly2):
+    x = np.linspace(0, 1, 10)
+    coef = random((3,))
+
+    d1 = Poly1.domain + random((2,))*.25
+    w1 = Poly1.window + random((2,))*.25
+    p1 = Poly1(coef, domain=d1, window=w1)
+
+    d2 = Poly2.domain + random((2,))*.25
+    w2 = Poly2.window + random((2,))*.25
+    p2 = p1.convert(kind=Poly2, domain=d2, window=w2)
+
+    assert_almost_equal(p2.domain, d2)
+    assert_almost_equal(p2.window, w2)
+    assert_almost_equal(p2(x), p1(x))
+
+
+def test_cast(Poly1, Poly2):
+    x = np.linspace(0, 1, 10)
+    coef = random((3,))
+
+    d1 = Poly1.domain + random((2,))*.25
+    w1 = Poly1.window + random((2,))*.25
+    p1 = Poly1(coef, domain=d1, window=w1)
+
+    d2 = Poly2.domain + random((2,))*.25
+    w2 = Poly2.window + random((2,))*.25
+    p2 = Poly2.cast(p1, domain=d2, window=w2)
+
+    assert_almost_equal(p2.domain, d2)
+    assert_almost_equal(p2.window, w2)
+    assert_almost_equal(p2(x), p1(x))
+
+
+#
+# test methods that depend on one class
+#
+
+
+def test_identity(Poly):
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    x = np.linspace(d[0], d[1], 11)
+    p = Poly.identity(domain=d, window=w)
+    assert_equal(p.domain, d)
+    assert_equal(p.window, w)
+    assert_almost_equal(p(x), x)
+
+
+def test_basis(Poly):
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    p = Poly.basis(5, domain=d, window=w)
+    assert_equal(p.domain, d)
+    assert_equal(p.window, w)
+    assert_equal(p.coef, [0]*5 + [1])
+
+
+def test_fromroots(Poly):
+    # check that requested roots are zeros of a polynomial
+    # of correct degree, domain, and window.
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    r = random((5,))
+    p1 = Poly.fromroots(r, domain=d, window=w)
+    assert_equal(p1.degree(), len(r))
+    assert_equal(p1.domain, d)
+    assert_equal(p1.window, w)
+    assert_almost_equal(p1(r), 0)
+
+    # check that polynomial is monic
+    pdom = Polynomial.domain
+    pwin = Polynomial.window
+    p2 = Polynomial.cast(p1, domain=pdom, window=pwin)
+    assert_almost_equal(p2.coef[-1], 1)
+
+
+def test_bad_conditioned_fit(Poly):
+
+    x = [0., 0., 1.]
+    y = [1., 2., 3.]
+
+    # check RankWarning is raised
+    with pytest.warns(RankWarning) as record:
+        Poly.fit(x, y, 2)
+    assert record[0].message.args[0] == "The fit may be poorly conditioned"
+
+
+def test_fit(Poly):
+
+    def f(x):
+        return x*(x - 1)*(x - 2)
+    x = np.linspace(0, 3)
+    y = f(x)
+
+    # check default value of domain and window
+    p = Poly.fit(x, y, 3)
+    assert_almost_equal(p.domain, [0, 3])
+    assert_almost_equal(p(x), y)
+    assert_equal(p.degree(), 3)
+
+    # check with given domains and window
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    p = Poly.fit(x, y, 3, domain=d, window=w)
+    assert_almost_equal(p(x), y)
+    assert_almost_equal(p.domain, d)
+    assert_almost_equal(p.window, w)
+    p = Poly.fit(x, y, [0, 1, 2, 3], domain=d, window=w)
+    assert_almost_equal(p(x), y)
+    assert_almost_equal(p.domain, d)
+    assert_almost_equal(p.window, w)
+
+    # check with class domain default
+    p = Poly.fit(x, y, 3, [])
+    assert_equal(p.domain, Poly.domain)
+    assert_equal(p.window, Poly.window)
+    p = Poly.fit(x, y, [0, 1, 2, 3], [])
+    assert_equal(p.domain, Poly.domain)
+    assert_equal(p.window, Poly.window)
+
+    # check that fit accepts weights.
+    w = np.zeros_like(x)
+    z = y + random(y.shape)*.25
+    w[::2] = 1
+    p1 = Poly.fit(x[::2], z[::2], 3)
+    p2 = Poly.fit(x, z, 3, w=w)
+    p3 = Poly.fit(x, z, [0, 1, 2, 3], w=w)
+    assert_almost_equal(p1(x), p2(x))
+    assert_almost_equal(p2(x), p3(x))
+
+
+def test_equal(Poly):
+    p1 = Poly([1, 2, 3], domain=[0, 1], window=[2, 3])
+    p2 = Poly([1, 1, 1], domain=[0, 1], window=[2, 3])
+    p3 = Poly([1, 2, 3], domain=[1, 2], window=[2, 3])
+    p4 = Poly([1, 2, 3], domain=[0, 1], window=[1, 2])
+    assert_(p1 == p1)
+    assert_(not p1 == p2)
+    assert_(not p1 == p3)
+    assert_(not p1 == p4)
+
+
+def test_not_equal(Poly):
+    p1 = Poly([1, 2, 3], domain=[0, 1], window=[2, 3])
+    p2 = Poly([1, 1, 1], domain=[0, 1], window=[2, 3])
+    p3 = Poly([1, 2, 3], domain=[1, 2], window=[2, 3])
+    p4 = Poly([1, 2, 3], domain=[0, 1], window=[1, 2])
+    assert_(not p1 != p1)
+    assert_(p1 != p2)
+    assert_(p1 != p3)
+    assert_(p1 != p4)
+
+
+def test_add(Poly):
+    # This checks commutation, not numerical correctness
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = p1 + p2
+    assert_poly_almost_equal(p2 + p1, p3)
+    assert_poly_almost_equal(p1 + c2, p3)
+    assert_poly_almost_equal(c2 + p1, p3)
+    assert_poly_almost_equal(p1 + tuple(c2), p3)
+    assert_poly_almost_equal(tuple(c2) + p1, p3)
+    assert_poly_almost_equal(p1 + np.array(c2), p3)
+    assert_poly_almost_equal(np.array(c2) + p1, p3)
+    assert_raises(TypeError, op.add, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(TypeError, op.add, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, op.add, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, op.add, p1, Polynomial([0]))
+
+
+def test_sub(Poly):
+    # This checks commutation, not numerical correctness
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = p1 - p2
+    assert_poly_almost_equal(p2 - p1, -p3)
+    assert_poly_almost_equal(p1 - c2, p3)
+    assert_poly_almost_equal(c2 - p1, -p3)
+    assert_poly_almost_equal(p1 - tuple(c2), p3)
+    assert_poly_almost_equal(tuple(c2) - p1, -p3)
+    assert_poly_almost_equal(p1 - np.array(c2), p3)
+    assert_poly_almost_equal(np.array(c2) - p1, -p3)
+    assert_raises(TypeError, op.sub, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(TypeError, op.sub, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, op.sub, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, op.sub, p1, Polynomial([0]))
+
+
+def test_mul(Poly):
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = p1 * p2
+    assert_poly_almost_equal(p2 * p1, p3)
+    assert_poly_almost_equal(p1 * c2, p3)
+    assert_poly_almost_equal(c2 * p1, p3)
+    assert_poly_almost_equal(p1 * tuple(c2), p3)
+    assert_poly_almost_equal(tuple(c2) * p1, p3)
+    assert_poly_almost_equal(p1 * np.array(c2), p3)
+    assert_poly_almost_equal(np.array(c2) * p1, p3)
+    assert_poly_almost_equal(p1 * 2, p1 * Poly([2]))
+    assert_poly_almost_equal(2 * p1, p1 * Poly([2]))
+    assert_raises(TypeError, op.mul, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(TypeError, op.mul, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, op.mul, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, op.mul, p1, Polynomial([0]))
+
+
+def test_floordiv(Poly):
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    c3 = list(random((2,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = Poly(c3)
+    p4 = p1 * p2 + p3
+    c4 = list(p4.coef)
+    assert_poly_almost_equal(p4 // p2, p1)
+    assert_poly_almost_equal(p4 // c2, p1)
+    assert_poly_almost_equal(c4 // p2, p1)
+    assert_poly_almost_equal(p4 // tuple(c2), p1)
+    assert_poly_almost_equal(tuple(c4) // p2, p1)
+    assert_poly_almost_equal(p4 // np.array(c2), p1)
+    assert_poly_almost_equal(np.array(c4) // p2, p1)
+    assert_poly_almost_equal(2 // p2, Poly([0]))
+    assert_poly_almost_equal(p2 // 2, 0.5*p2)
+    assert_raises(
+        TypeError, op.floordiv, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(
+        TypeError, op.floordiv, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, op.floordiv, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, op.floordiv, p1, Polynomial([0]))
+
+
+def test_truediv(Poly):
+    # true division is valid only if the denominator is a Number and
+    # not a python bool.
+    p1 = Poly([1,2,3])
+    p2 = p1 * 5
+
+    for stype in np.ScalarType:
+        if not issubclass(stype, Number) or issubclass(stype, bool):
+            continue
+        s = stype(5)
+        assert_poly_almost_equal(op.truediv(p2, s), p1)
+        assert_raises(TypeError, op.truediv, s, p2)
+    for stype in (int, float):
+        s = stype(5)
+        assert_poly_almost_equal(op.truediv(p2, s), p1)
+        assert_raises(TypeError, op.truediv, s, p2)
+    for stype in [complex]:
+        s = stype(5, 0)
+        assert_poly_almost_equal(op.truediv(p2, s), p1)
+        assert_raises(TypeError, op.truediv, s, p2)
+    for s in [tuple(), list(), dict(), bool(), np.array([1])]:
+        assert_raises(TypeError, op.truediv, p2, s)
+        assert_raises(TypeError, op.truediv, s, p2)
+    for ptype in classes:
+        assert_raises(TypeError, op.truediv, p2, ptype(1))
+
+
+def test_mod(Poly):
+    # This checks commutation, not numerical correctness
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    c3 = list(random((2,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = Poly(c3)
+    p4 = p1 * p2 + p3
+    c4 = list(p4.coef)
+    assert_poly_almost_equal(p4 % p2, p3)
+    assert_poly_almost_equal(p4 % c2, p3)
+    assert_poly_almost_equal(c4 % p2, p3)
+    assert_poly_almost_equal(p4 % tuple(c2), p3)
+    assert_poly_almost_equal(tuple(c4) % p2, p3)
+    assert_poly_almost_equal(p4 % np.array(c2), p3)
+    assert_poly_almost_equal(np.array(c4) % p2, p3)
+    assert_poly_almost_equal(2 % p2, Poly([2]))
+    assert_poly_almost_equal(p2 % 2, Poly([0]))
+    assert_raises(TypeError, op.mod, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(TypeError, op.mod, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, op.mod, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, op.mod, p1, Polynomial([0]))
+
+
+def test_divmod(Poly):
+    # This checks commutation, not numerical correctness
+    c1 = list(random((4,)) + .5)
+    c2 = list(random((3,)) + .5)
+    c3 = list(random((2,)) + .5)
+    p1 = Poly(c1)
+    p2 = Poly(c2)
+    p3 = Poly(c3)
+    p4 = p1 * p2 + p3
+    c4 = list(p4.coef)
+    quo, rem = divmod(p4, p2)
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(p4, c2)
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(c4, p2)
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(p4, tuple(c2))
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(tuple(c4), p2)
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(p4, np.array(c2))
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(np.array(c4), p2)
+    assert_poly_almost_equal(quo, p1)
+    assert_poly_almost_equal(rem, p3)
+    quo, rem = divmod(p2, 2)
+    assert_poly_almost_equal(quo, 0.5*p2)
+    assert_poly_almost_equal(rem, Poly([0]))
+    quo, rem = divmod(2, p2)
+    assert_poly_almost_equal(quo, Poly([0]))
+    assert_poly_almost_equal(rem, Poly([2]))
+    assert_raises(TypeError, divmod, p1, Poly([0], domain=Poly.domain + 1))
+    assert_raises(TypeError, divmod, p1, Poly([0], window=Poly.window + 1))
+    if Poly is Polynomial:
+        assert_raises(TypeError, divmod, p1, Chebyshev([0]))
+    else:
+        assert_raises(TypeError, divmod, p1, Polynomial([0]))
+
+
+def test_roots(Poly):
+    d = Poly.domain * 1.25 + .25
+    w = Poly.window
+    tgt = np.linspace(d[0], d[1], 5)
+    res = np.sort(Poly.fromroots(tgt, domain=d, window=w).roots())
+    assert_almost_equal(res, tgt)
+    # default domain and window
+    res = np.sort(Poly.fromroots(tgt).roots())
+    assert_almost_equal(res, tgt)
+
+
+def test_degree(Poly):
+    p = Poly.basis(5)
+    assert_equal(p.degree(), 5)
+
+
+def test_copy(Poly):
+    p1 = Poly.basis(5)
+    p2 = p1.copy()
+    assert_(p1 == p2)
+    assert_(p1 is not p2)
+    assert_(p1.coef is not p2.coef)
+    assert_(p1.domain is not p2.domain)
+    assert_(p1.window is not p2.window)
+
+
+def test_integ(Poly):
+    P = Polynomial
+    # Check defaults
+    p0 = Poly.cast(P([1*2, 2*3, 3*4]))
+    p1 = P.cast(p0.integ())
+    p2 = P.cast(p0.integ(2))
+    assert_poly_almost_equal(p1, P([0, 2, 3, 4]))
+    assert_poly_almost_equal(p2, P([0, 0, 1, 1, 1]))
+    # Check with k
+    p0 = Poly.cast(P([1*2, 2*3, 3*4]))
+    p1 = P.cast(p0.integ(k=1))
+    p2 = P.cast(p0.integ(2, k=[1, 1]))
+    assert_poly_almost_equal(p1, P([1, 2, 3, 4]))
+    assert_poly_almost_equal(p2, P([1, 1, 1, 1, 1]))
+    # Check with lbnd
+    p0 = Poly.cast(P([1*2, 2*3, 3*4]))
+    p1 = P.cast(p0.integ(lbnd=1))
+    p2 = P.cast(p0.integ(2, lbnd=1))
+    assert_poly_almost_equal(p1, P([-9, 2, 3, 4]))
+    assert_poly_almost_equal(p2, P([6, -9, 1, 1, 1]))
+    # Check scaling
+    d = 2*Poly.domain
+    p0 = Poly.cast(P([1*2, 2*3, 3*4]), domain=d)
+    p1 = P.cast(p0.integ())
+    p2 = P.cast(p0.integ(2))
+    assert_poly_almost_equal(p1, P([0, 2, 3, 4]))
+    assert_poly_almost_equal(p2, P([0, 0, 1, 1, 1]))
+
+
+def test_deriv(Poly):
+    # Check that the derivative is the inverse of integration. It is
+    # assumes that the integration has been checked elsewhere.
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    p1 = Poly([1, 2, 3], domain=d, window=w)
+    p2 = p1.integ(2, k=[1, 2])
+    p3 = p1.integ(1, k=[1])
+    assert_almost_equal(p2.deriv(1).coef, p3.coef)
+    assert_almost_equal(p2.deriv(2).coef, p1.coef)
+    # default domain and window
+    p1 = Poly([1, 2, 3])
+    p2 = p1.integ(2, k=[1, 2])
+    p3 = p1.integ(1, k=[1])
+    assert_almost_equal(p2.deriv(1).coef, p3.coef)
+    assert_almost_equal(p2.deriv(2).coef, p1.coef)
+
+
+def test_linspace(Poly):
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    p = Poly([1, 2, 3], domain=d, window=w)
+    # check default domain
+    xtgt = np.linspace(d[0], d[1], 20)
+    ytgt = p(xtgt)
+    xres, yres = p.linspace(20)
+    assert_almost_equal(xres, xtgt)
+    assert_almost_equal(yres, ytgt)
+    # check specified domain
+    xtgt = np.linspace(0, 2, 20)
+    ytgt = p(xtgt)
+    xres, yres = p.linspace(20, domain=[0, 2])
+    assert_almost_equal(xres, xtgt)
+    assert_almost_equal(yres, ytgt)
+
+
+def test_pow(Poly):
+    d = Poly.domain + random((2,))*.25
+    w = Poly.window + random((2,))*.25
+    tgt = Poly([1], domain=d, window=w)
+    tst = Poly([1, 2, 3], domain=d, window=w)
+    for i in range(5):
+        assert_poly_almost_equal(tst**i, tgt)
+        tgt = tgt * tst
+    # default domain and window
+    tgt = Poly([1])
+    tst = Poly([1, 2, 3])
+    for i in range(5):
+        assert_poly_almost_equal(tst**i, tgt)
+        tgt = tgt * tst
+    # check error for invalid powers
+    assert_raises(ValueError, op.pow, tgt, 1.5)
+    assert_raises(ValueError, op.pow, tgt, -1)
+
+
+def test_call(Poly):
+    P = Polynomial
+    d = Poly.domain
+    x = np.linspace(d[0], d[1], 11)
+
+    # Check defaults
+    p = Poly.cast(P([1, 2, 3]))
+    tgt = 1 + x*(2 + 3*x)
+    res = p(x)
+    assert_almost_equal(res, tgt)
+
+
+def test_cutdeg(Poly):
+    p = Poly([1, 2, 3])
+    assert_raises(ValueError, p.cutdeg, .5)
+    assert_raises(ValueError, p.cutdeg, -1)
+    assert_equal(len(p.cutdeg(3)), 3)
+    assert_equal(len(p.cutdeg(2)), 3)
+    assert_equal(len(p.cutdeg(1)), 2)
+    assert_equal(len(p.cutdeg(0)), 1)
+
+
+def test_truncate(Poly):
+    p = Poly([1, 2, 3])
+    assert_raises(ValueError, p.truncate, .5)
+    assert_raises(ValueError, p.truncate, 0)
+    assert_equal(len(p.truncate(4)), 3)
+    assert_equal(len(p.truncate(3)), 3)
+    assert_equal(len(p.truncate(2)), 2)
+    assert_equal(len(p.truncate(1)), 1)
+
+
+def test_trim(Poly):
+    c = [1, 1e-6, 1e-12, 0]
+    p = Poly(c)
+    assert_equal(p.trim().coef, c[:3])
+    assert_equal(p.trim(1e-10).coef, c[:2])
+    assert_equal(p.trim(1e-5).coef, c[:1])
+
+
+def test_mapparms(Poly):
+    # check with defaults. Should be identity.
+    d = Poly.domain
+    w = Poly.window
+    p = Poly([1], domain=d, window=w)
+    assert_almost_equal([0, 1], p.mapparms())
+    #
+    w = 2*d + 1
+    p = Poly([1], domain=d, window=w)
+    assert_almost_equal([1, 2], p.mapparms())
+
+
+def test_ufunc_override(Poly):
+    p = Poly([1, 2, 3])
+    x = np.ones(3)
+    assert_raises(TypeError, np.add, p, x)
+    assert_raises(TypeError, np.add, x, p)
+
+
+#
+# Test class method that only exists for some classes
+#
+
+
+class TestInterpolate:
+
+    def f(self, x):
+        return x * (x - 1) * (x - 2)
+
+    def test_raises(self):
+        assert_raises(ValueError, Chebyshev.interpolate, self.f, -1)
+        assert_raises(TypeError, Chebyshev.interpolate, self.f, 10.)
+
+    def test_dimensions(self):
+        for deg in range(1, 5):
+            assert_(Chebyshev.interpolate(self.f, deg).degree() == deg)
+
+    def test_approximation(self):
+
+        def powx(x, p):
+            return x**p
+
+        x = np.linspace(0, 2, 10)
+        for deg in range(0, 10):
+            for t in range(0, deg + 1):
+                p = Chebyshev.interpolate(powx, deg, domain=[0, 2], args=(t,))
+                assert_almost_equal(p(x), powx(x, t), decimal=12)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite.py
new file mode 100644
index 000000000..53ee0844e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite.py
@@ -0,0 +1,555 @@
+"""Tests for hermite module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.hermite as herm
+from numpy.polynomial.polynomial import polyval
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+H0 = np.array([1])
+H1 = np.array([0, 2])
+H2 = np.array([-2, 0, 4])
+H3 = np.array([0, -12, 0, 8])
+H4 = np.array([12, 0, -48, 0, 16])
+H5 = np.array([0, 120, 0, -160, 0, 32])
+H6 = np.array([-120, 0, 720, 0, -480, 0, 64])
+H7 = np.array([0, -1680, 0, 3360, 0, -1344, 0, 128])
+H8 = np.array([1680, 0, -13440, 0, 13440, 0, -3584, 0, 256])
+H9 = np.array([0, 30240, 0, -80640, 0, 48384, 0, -9216, 0, 512])
+
+Hlist = [H0, H1, H2, H3, H4, H5, H6, H7, H8, H9]
+
+
+def trim(x):
+    return herm.hermtrim(x, tol=1e-6)
+
+
+class TestConstants:
+
+    def test_hermdomain(self):
+        assert_equal(herm.hermdomain, [-1, 1])
+
+    def test_hermzero(self):
+        assert_equal(herm.hermzero, [0])
+
+    def test_hermone(self):
+        assert_equal(herm.hermone, [1])
+
+    def test_hermx(self):
+        assert_equal(herm.hermx, [0, .5])
+
+
+class TestArithmetic:
+    x = np.linspace(-3, 3, 100)
+
+    def test_hermadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = herm.hermadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermsub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = herm.hermsub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermmulx(self):
+        assert_equal(herm.hermmulx([0]), [0])
+        assert_equal(herm.hermmulx([1]), [0, .5])
+        for i in range(1, 5):
+            ser = [0]*i + [1]
+            tgt = [0]*(i - 1) + [i, 0, .5]
+            assert_equal(herm.hermmulx(ser), tgt)
+
+    def test_hermmul(self):
+        # check values of result
+        for i in range(5):
+            pol1 = [0]*i + [1]
+            val1 = herm.hermval(self.x, pol1)
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                pol2 = [0]*j + [1]
+                val2 = herm.hermval(self.x, pol2)
+                pol3 = herm.hermmul(pol1, pol2)
+                val3 = herm.hermval(self.x, pol3)
+                assert_(len(pol3) == i + j + 1, msg)
+                assert_almost_equal(val3, val1*val2, err_msg=msg)
+
+    def test_hermdiv(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1]
+                cj = [0]*j + [1]
+                tgt = herm.hermadd(ci, cj)
+                quo, rem = herm.hermdiv(tgt, ci)
+                res = herm.hermadd(herm.hermmul(quo, ci), rem)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermpow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(herm.hermmul, [c]*j, np.array([1]))
+                res = herm.hermpow(c, j) 
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([2.5, 1., .75])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = polyval(x, [1., 2., 3.])
+
+    def test_hermval(self):
+        #check empty input
+        assert_equal(herm.hermval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [polyval(x, c) for c in Hlist]
+        for i in range(10):
+            msg = f"At i={i}"
+            tgt = y[i]
+            res = herm.hermval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt, err_msg=msg)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(herm.hermval(x, [1]).shape, dims)
+            assert_equal(herm.hermval(x, [1, 0]).shape, dims)
+            assert_equal(herm.hermval(x, [1, 0, 0]).shape, dims)
+
+    def test_hermval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, herm.hermval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = herm.hermval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herm.hermval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_hermval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, herm.hermval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = herm.hermval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herm.hermval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_hermgrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = herm.hermgrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herm.hermgrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_hermgrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = herm.hermgrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herm.hermgrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_hermint(self):
+        # check exceptions
+        assert_raises(TypeError, herm.hermint, [0], .5)
+        assert_raises(ValueError, herm.hermint, [0], -1)
+        assert_raises(ValueError, herm.hermint, [0], 1, [0, 0])
+        assert_raises(ValueError, herm.hermint, [0], lbnd=[0])
+        assert_raises(ValueError, herm.hermint, [0], scl=[0])
+        assert_raises(TypeError, herm.hermint, [0], axis=.5)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = herm.hermint([0], m=i, k=k)
+            assert_almost_equal(res, [0, .5])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            hermpol = herm.poly2herm(pol)
+            hermint = herm.hermint(hermpol, m=1, k=[i])
+            res = herm.herm2poly(hermint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            hermpol = herm.poly2herm(pol)
+            hermint = herm.hermint(hermpol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(herm.hermval(-1, hermint), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            hermpol = herm.poly2herm(pol)
+            hermint = herm.hermint(hermpol, m=1, k=[i], scl=2)
+            res = herm.herm2poly(hermint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herm.hermint(tgt, m=1)
+                res = herm.hermint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herm.hermint(tgt, m=1, k=[k])
+                res = herm.hermint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herm.hermint(tgt, m=1, k=[k], lbnd=-1)
+                res = herm.hermint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herm.hermint(tgt, m=1, k=[k], scl=2)
+                res = herm.hermint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([herm.hermint(c) for c in c2d.T]).T
+        res = herm.hermint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herm.hermint(c) for c in c2d])
+        res = herm.hermint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herm.hermint(c, k=3) for c in c2d])
+        res = herm.hermint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_hermder(self):
+        # check exceptions
+        assert_raises(TypeError, herm.hermder, [0], .5)
+        assert_raises(ValueError, herm.hermder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = herm.hermder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = herm.hermder(herm.hermint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = herm.hermder(herm.hermint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([herm.hermder(c) for c in c2d.T]).T
+        res = herm.hermder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herm.hermder(c) for c in c2d])
+        res = herm.hermder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_hermvander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = herm.hermvander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], herm.hermval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = herm.hermvander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], herm.hermval(x, coef))
+
+    def test_hermvander2d(self):
+        # also tests hermval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = herm.hermvander2d(x1, x2, [1, 2])
+        tgt = herm.hermval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = herm.hermvander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_hermvander3d(self):
+        # also tests hermval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = herm.hermvander3d(x1, x2, x3, [1, 2, 3])
+        tgt = herm.hermval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = herm.hermvander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestFitting:
+
+    def test_hermfit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        def f2(x):
+            return x**4 + x**2 + 1
+
+        # Test exceptions
+        assert_raises(ValueError, herm.hermfit, [1], [1], -1)
+        assert_raises(TypeError, herm.hermfit, [[1]], [1], 0)
+        assert_raises(TypeError, herm.hermfit, [], [1], 0)
+        assert_raises(TypeError, herm.hermfit, [1], [[[1]]], 0)
+        assert_raises(TypeError, herm.hermfit, [1, 2], [1], 0)
+        assert_raises(TypeError, herm.hermfit, [1], [1, 2], 0)
+        assert_raises(TypeError, herm.hermfit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, herm.hermfit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, herm.hermfit, [1], [1], [-1,])
+        assert_raises(ValueError, herm.hermfit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, herm.hermfit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = herm.hermfit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(herm.hermval(x, coef3), y)
+        coef3 = herm.hermfit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(herm.hermval(x, coef3), y)
+        #
+        coef4 = herm.hermfit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herm.hermval(x, coef4), y)
+        coef4 = herm.hermfit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herm.hermval(x, coef4), y)
+        # check things still work if deg is not in strict increasing
+        coef4 = herm.hermfit(x, y, [2, 3, 4, 1, 0])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herm.hermval(x, coef4), y)
+        #
+        coef2d = herm.hermfit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = herm.hermfit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        y[0::2] = 0
+        wcoef3 = herm.hermfit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = herm.hermfit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = herm.hermfit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = herm.hermfit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(herm.hermfit(x, x, 1), [0, .5])
+        assert_almost_equal(herm.hermfit(x, x, [0, 1]), [0, .5])
+        # test fitting only even Legendre polynomials
+        x = np.linspace(-1, 1)
+        y = f2(x)
+        coef1 = herm.hermfit(x, y, 4)
+        assert_almost_equal(herm.hermval(x, coef1), y)
+        coef2 = herm.hermfit(x, y, [0, 2, 4])
+        assert_almost_equal(herm.hermval(x, coef2), y)
+        assert_almost_equal(coef1, coef2)
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, herm.hermcompanion, [])
+        assert_raises(ValueError, herm.hermcompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(herm.hermcompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(herm.hermcompanion([1, 2])[0, 0] == -.25)
+
+
+class TestGauss:
+
+    def test_100(self):
+        x, w = herm.hermgauss(100)
+
+        # test orthogonality. Note that the results need to be normalized,
+        # otherwise the huge values that can arise from fast growing
+        # functions like Laguerre can be very confusing.
+        v = herm.hermvander(x, 99)
+        vv = np.dot(v.T * w, v)
+        vd = 1/np.sqrt(vv.diagonal())
+        vv = vd[:, None] * vv * vd
+        assert_almost_equal(vv, np.eye(100))
+
+        # check that the integral of 1 is correct
+        tgt = np.sqrt(np.pi)
+        assert_almost_equal(w.sum(), tgt)
+
+
+class TestMisc:
+
+    def test_hermfromroots(self):
+        res = herm.hermfromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            pol = herm.hermfromroots(roots)
+            res = herm.hermval(roots, pol)
+            tgt = 0
+            assert_(len(pol) == i + 1)
+            assert_almost_equal(herm.herm2poly(pol)[-1], 1)
+            assert_almost_equal(res, tgt)
+
+    def test_hermroots(self):
+        assert_almost_equal(herm.hermroots([1]), [])
+        assert_almost_equal(herm.hermroots([1, 1]), [-.5])
+        for i in range(2, 5):
+            tgt = np.linspace(-1, 1, i)
+            res = herm.hermroots(herm.hermfromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermtrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, herm.hermtrim, coef, -1)
+
+        # Test results
+        assert_equal(herm.hermtrim(coef), coef[:-1])
+        assert_equal(herm.hermtrim(coef, 1), coef[:-3])
+        assert_equal(herm.hermtrim(coef, 2), [0])
+
+    def test_hermline(self):
+        assert_equal(herm.hermline(3, 4), [3, 2])
+
+    def test_herm2poly(self):
+        for i in range(10):
+            assert_almost_equal(herm.herm2poly([0]*i + [1]), Hlist[i])
+
+    def test_poly2herm(self):
+        for i in range(10):
+            assert_almost_equal(herm.poly2herm(Hlist[i]), [0]*i + [1])
+
+    def test_weight(self):
+        x = np.linspace(-5, 5, 11)
+        tgt = np.exp(-x**2)
+        res = herm.hermweight(x)
+        assert_almost_equal(res, tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite_e.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite_e.py
new file mode 100644
index 000000000..2d262a330
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_hermite_e.py
@@ -0,0 +1,556 @@
+"""Tests for hermite_e module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.hermite_e as herme
+from numpy.polynomial.polynomial import polyval
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+He0 = np.array([1])
+He1 = np.array([0, 1])
+He2 = np.array([-1, 0, 1])
+He3 = np.array([0, -3, 0, 1])
+He4 = np.array([3, 0, -6, 0, 1])
+He5 = np.array([0, 15, 0, -10, 0, 1])
+He6 = np.array([-15, 0, 45, 0, -15, 0, 1])
+He7 = np.array([0, -105, 0, 105, 0, -21, 0, 1])
+He8 = np.array([105, 0, -420, 0, 210, 0, -28, 0, 1])
+He9 = np.array([0, 945, 0, -1260, 0, 378, 0, -36, 0, 1])
+
+Helist = [He0, He1, He2, He3, He4, He5, He6, He7, He8, He9]
+
+
+def trim(x):
+    return herme.hermetrim(x, tol=1e-6)
+
+
+class TestConstants:
+
+    def test_hermedomain(self):
+        assert_equal(herme.hermedomain, [-1, 1])
+
+    def test_hermezero(self):
+        assert_equal(herme.hermezero, [0])
+
+    def test_hermeone(self):
+        assert_equal(herme.hermeone, [1])
+
+    def test_hermex(self):
+        assert_equal(herme.hermex, [0, 1])
+
+
+class TestArithmetic:
+    x = np.linspace(-3, 3, 100)
+
+    def test_hermeadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = herme.hermeadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermesub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = herme.hermesub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermemulx(self):
+        assert_equal(herme.hermemulx([0]), [0])
+        assert_equal(herme.hermemulx([1]), [0, 1])
+        for i in range(1, 5):
+            ser = [0]*i + [1]
+            tgt = [0]*(i - 1) + [i, 0, 1]
+            assert_equal(herme.hermemulx(ser), tgt)
+
+    def test_hermemul(self):
+        # check values of result
+        for i in range(5):
+            pol1 = [0]*i + [1]
+            val1 = herme.hermeval(self.x, pol1)
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                pol2 = [0]*j + [1]
+                val2 = herme.hermeval(self.x, pol2)
+                pol3 = herme.hermemul(pol1, pol2)
+                val3 = herme.hermeval(self.x, pol3)
+                assert_(len(pol3) == i + j + 1, msg)
+                assert_almost_equal(val3, val1*val2, err_msg=msg)
+
+    def test_hermediv(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1]
+                cj = [0]*j + [1]
+                tgt = herme.hermeadd(ci, cj)
+                quo, rem = herme.hermediv(tgt, ci)
+                res = herme.hermeadd(herme.hermemul(quo, ci), rem)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_hermepow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(herme.hermemul, [c]*j, np.array([1]))
+                res = herme.hermepow(c, j)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([4., 2., 3.])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = polyval(x, [1., 2., 3.])
+
+    def test_hermeval(self):
+        #check empty input
+        assert_equal(herme.hermeval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [polyval(x, c) for c in Helist]
+        for i in range(10):
+            msg = f"At i={i}"
+            tgt = y[i]
+            res = herme.hermeval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt, err_msg=msg)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(herme.hermeval(x, [1]).shape, dims)
+            assert_equal(herme.hermeval(x, [1, 0]).shape, dims)
+            assert_equal(herme.hermeval(x, [1, 0, 0]).shape, dims)
+
+    def test_hermeval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, herme.hermeval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = herme.hermeval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herme.hermeval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_hermeval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, herme.hermeval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = herme.hermeval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herme.hermeval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_hermegrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = herme.hermegrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herme.hermegrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_hermegrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = herme.hermegrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = herme.hermegrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_hermeint(self):
+        # check exceptions
+        assert_raises(TypeError, herme.hermeint, [0], .5)
+        assert_raises(ValueError, herme.hermeint, [0], -1)
+        assert_raises(ValueError, herme.hermeint, [0], 1, [0, 0])
+        assert_raises(ValueError, herme.hermeint, [0], lbnd=[0])
+        assert_raises(ValueError, herme.hermeint, [0], scl=[0])
+        assert_raises(TypeError, herme.hermeint, [0], axis=.5)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = herme.hermeint([0], m=i, k=k)
+            assert_almost_equal(res, [0, 1])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            hermepol = herme.poly2herme(pol)
+            hermeint = herme.hermeint(hermepol, m=1, k=[i])
+            res = herme.herme2poly(hermeint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            hermepol = herme.poly2herme(pol)
+            hermeint = herme.hermeint(hermepol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(herme.hermeval(-1, hermeint), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            hermepol = herme.poly2herme(pol)
+            hermeint = herme.hermeint(hermepol, m=1, k=[i], scl=2)
+            res = herme.herme2poly(hermeint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herme.hermeint(tgt, m=1)
+                res = herme.hermeint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herme.hermeint(tgt, m=1, k=[k])
+                res = herme.hermeint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herme.hermeint(tgt, m=1, k=[k], lbnd=-1)
+                res = herme.hermeint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = herme.hermeint(tgt, m=1, k=[k], scl=2)
+                res = herme.hermeint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermeint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([herme.hermeint(c) for c in c2d.T]).T
+        res = herme.hermeint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herme.hermeint(c) for c in c2d])
+        res = herme.hermeint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herme.hermeint(c, k=3) for c in c2d])
+        res = herme.hermeint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_hermeder(self):
+        # check exceptions
+        assert_raises(TypeError, herme.hermeder, [0], .5)
+        assert_raises(ValueError, herme.hermeder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = herme.hermeder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = herme.hermeder(herme.hermeint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = herme.hermeder(
+                    herme.hermeint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermeder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([herme.hermeder(c) for c in c2d.T]).T
+        res = herme.hermeder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([herme.hermeder(c) for c in c2d])
+        res = herme.hermeder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_hermevander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = herme.hermevander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], herme.hermeval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = herme.hermevander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], herme.hermeval(x, coef))
+
+    def test_hermevander2d(self):
+        # also tests hermeval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = herme.hermevander2d(x1, x2, [1, 2])
+        tgt = herme.hermeval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = herme.hermevander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_hermevander3d(self):
+        # also tests hermeval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = herme.hermevander3d(x1, x2, x3, [1, 2, 3])
+        tgt = herme.hermeval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = herme.hermevander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestFitting:
+
+    def test_hermefit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        def f2(x):
+            return x**4 + x**2 + 1
+
+        # Test exceptions
+        assert_raises(ValueError, herme.hermefit, [1], [1], -1)
+        assert_raises(TypeError, herme.hermefit, [[1]], [1], 0)
+        assert_raises(TypeError, herme.hermefit, [], [1], 0)
+        assert_raises(TypeError, herme.hermefit, [1], [[[1]]], 0)
+        assert_raises(TypeError, herme.hermefit, [1, 2], [1], 0)
+        assert_raises(TypeError, herme.hermefit, [1], [1, 2], 0)
+        assert_raises(TypeError, herme.hermefit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, herme.hermefit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, herme.hermefit, [1], [1], [-1,])
+        assert_raises(ValueError, herme.hermefit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, herme.hermefit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = herme.hermefit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(herme.hermeval(x, coef3), y)
+        coef3 = herme.hermefit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(herme.hermeval(x, coef3), y)
+        #
+        coef4 = herme.hermefit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herme.hermeval(x, coef4), y)
+        coef4 = herme.hermefit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herme.hermeval(x, coef4), y)
+        # check things still work if deg is not in strict increasing
+        coef4 = herme.hermefit(x, y, [2, 3, 4, 1, 0])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(herme.hermeval(x, coef4), y)
+        #
+        coef2d = herme.hermefit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = herme.hermefit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        y[0::2] = 0
+        wcoef3 = herme.hermefit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = herme.hermefit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = herme.hermefit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = herme.hermefit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(herme.hermefit(x, x, 1), [0, 1])
+        assert_almost_equal(herme.hermefit(x, x, [0, 1]), [0, 1])
+        # test fitting only even Legendre polynomials
+        x = np.linspace(-1, 1)
+        y = f2(x)
+        coef1 = herme.hermefit(x, y, 4)
+        assert_almost_equal(herme.hermeval(x, coef1), y)
+        coef2 = herme.hermefit(x, y, [0, 2, 4])
+        assert_almost_equal(herme.hermeval(x, coef2), y)
+        assert_almost_equal(coef1, coef2)
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, herme.hermecompanion, [])
+        assert_raises(ValueError, herme.hermecompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(herme.hermecompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(herme.hermecompanion([1, 2])[0, 0] == -.5)
+
+
+class TestGauss:
+
+    def test_100(self):
+        x, w = herme.hermegauss(100)
+
+        # test orthogonality. Note that the results need to be normalized,
+        # otherwise the huge values that can arise from fast growing
+        # functions like Laguerre can be very confusing.
+        v = herme.hermevander(x, 99)
+        vv = np.dot(v.T * w, v)
+        vd = 1/np.sqrt(vv.diagonal())
+        vv = vd[:, None] * vv * vd
+        assert_almost_equal(vv, np.eye(100))
+
+        # check that the integral of 1 is correct
+        tgt = np.sqrt(2*np.pi)
+        assert_almost_equal(w.sum(), tgt)
+
+
+class TestMisc:
+
+    def test_hermefromroots(self):
+        res = herme.hermefromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            pol = herme.hermefromroots(roots)
+            res = herme.hermeval(roots, pol)
+            tgt = 0
+            assert_(len(pol) == i + 1)
+            assert_almost_equal(herme.herme2poly(pol)[-1], 1)
+            assert_almost_equal(res, tgt)
+
+    def test_hermeroots(self):
+        assert_almost_equal(herme.hermeroots([1]), [])
+        assert_almost_equal(herme.hermeroots([1, 1]), [-1])
+        for i in range(2, 5):
+            tgt = np.linspace(-1, 1, i)
+            res = herme.hermeroots(herme.hermefromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_hermetrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, herme.hermetrim, coef, -1)
+
+        # Test results
+        assert_equal(herme.hermetrim(coef), coef[:-1])
+        assert_equal(herme.hermetrim(coef, 1), coef[:-3])
+        assert_equal(herme.hermetrim(coef, 2), [0])
+
+    def test_hermeline(self):
+        assert_equal(herme.hermeline(3, 4), [3, 4])
+
+    def test_herme2poly(self):
+        for i in range(10):
+            assert_almost_equal(herme.herme2poly([0]*i + [1]), Helist[i])
+
+    def test_poly2herme(self):
+        for i in range(10):
+            assert_almost_equal(herme.poly2herme(Helist[i]), [0]*i + [1])
+
+    def test_weight(self):
+        x = np.linspace(-5, 5, 11)
+        tgt = np.exp(-.5*x**2)
+        res = herme.hermeweight(x)
+        assert_almost_equal(res, tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_laguerre.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_laguerre.py
new file mode 100644
index 000000000..227ef3c55
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_laguerre.py
@@ -0,0 +1,537 @@
+"""Tests for laguerre module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.laguerre as lag
+from numpy.polynomial.polynomial import polyval
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+L0 = np.array([1])/1
+L1 = np.array([1, -1])/1
+L2 = np.array([2, -4, 1])/2
+L3 = np.array([6, -18, 9, -1])/6
+L4 = np.array([24, -96, 72, -16, 1])/24
+L5 = np.array([120, -600, 600, -200, 25, -1])/120
+L6 = np.array([720, -4320, 5400, -2400, 450, -36, 1])/720
+
+Llist = [L0, L1, L2, L3, L4, L5, L6]
+
+
+def trim(x):
+    return lag.lagtrim(x, tol=1e-6)
+
+
+class TestConstants:
+
+    def test_lagdomain(self):
+        assert_equal(lag.lagdomain, [0, 1])
+
+    def test_lagzero(self):
+        assert_equal(lag.lagzero, [0])
+
+    def test_lagone(self):
+        assert_equal(lag.lagone, [1])
+
+    def test_lagx(self):
+        assert_equal(lag.lagx, [1, -1])
+
+
+class TestArithmetic:
+    x = np.linspace(-3, 3, 100)
+
+    def test_lagadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = lag.lagadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_lagsub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = lag.lagsub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_lagmulx(self):
+        assert_equal(lag.lagmulx([0]), [0])
+        assert_equal(lag.lagmulx([1]), [1, -1])
+        for i in range(1, 5):
+            ser = [0]*i + [1]
+            tgt = [0]*(i - 1) + [-i, 2*i + 1, -(i + 1)]
+            assert_almost_equal(lag.lagmulx(ser), tgt)
+
+    def test_lagmul(self):
+        # check values of result
+        for i in range(5):
+            pol1 = [0]*i + [1]
+            val1 = lag.lagval(self.x, pol1)
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                pol2 = [0]*j + [1]
+                val2 = lag.lagval(self.x, pol2)
+                pol3 = lag.lagmul(pol1, pol2)
+                val3 = lag.lagval(self.x, pol3)
+                assert_(len(pol3) == i + j + 1, msg)
+                assert_almost_equal(val3, val1*val2, err_msg=msg)
+
+    def test_lagdiv(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1]
+                cj = [0]*j + [1]
+                tgt = lag.lagadd(ci, cj)
+                quo, rem = lag.lagdiv(tgt, ci)
+                res = lag.lagadd(lag.lagmul(quo, ci), rem)
+                assert_almost_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_lagpow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(lag.lagmul, [c]*j, np.array([1]))
+                res = lag.lagpow(c, j) 
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([9., -14., 6.])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = polyval(x, [1., 2., 3.])
+
+    def test_lagval(self):
+        #check empty input
+        assert_equal(lag.lagval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [polyval(x, c) for c in Llist]
+        for i in range(7):
+            msg = f"At i={i}"
+            tgt = y[i]
+            res = lag.lagval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt, err_msg=msg)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(lag.lagval(x, [1]).shape, dims)
+            assert_equal(lag.lagval(x, [1, 0]).shape, dims)
+            assert_equal(lag.lagval(x, [1, 0, 0]).shape, dims)
+
+    def test_lagval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, lag.lagval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = lag.lagval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = lag.lagval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_lagval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, lag.lagval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = lag.lagval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = lag.lagval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_laggrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = lag.laggrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = lag.laggrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_laggrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = lag.laggrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = lag.laggrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_lagint(self):
+        # check exceptions
+        assert_raises(TypeError, lag.lagint, [0], .5)
+        assert_raises(ValueError, lag.lagint, [0], -1)
+        assert_raises(ValueError, lag.lagint, [0], 1, [0, 0])
+        assert_raises(ValueError, lag.lagint, [0], lbnd=[0])
+        assert_raises(ValueError, lag.lagint, [0], scl=[0])
+        assert_raises(TypeError, lag.lagint, [0], axis=.5)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = lag.lagint([0], m=i, k=k)
+            assert_almost_equal(res, [1, -1])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            lagpol = lag.poly2lag(pol)
+            lagint = lag.lagint(lagpol, m=1, k=[i])
+            res = lag.lag2poly(lagint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            lagpol = lag.poly2lag(pol)
+            lagint = lag.lagint(lagpol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(lag.lagval(-1, lagint), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            lagpol = lag.poly2lag(pol)
+            lagint = lag.lagint(lagpol, m=1, k=[i], scl=2)
+            res = lag.lag2poly(lagint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = lag.lagint(tgt, m=1)
+                res = lag.lagint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = lag.lagint(tgt, m=1, k=[k])
+                res = lag.lagint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = lag.lagint(tgt, m=1, k=[k], lbnd=-1)
+                res = lag.lagint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = lag.lagint(tgt, m=1, k=[k], scl=2)
+                res = lag.lagint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_lagint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([lag.lagint(c) for c in c2d.T]).T
+        res = lag.lagint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([lag.lagint(c) for c in c2d])
+        res = lag.lagint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([lag.lagint(c, k=3) for c in c2d])
+        res = lag.lagint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_lagder(self):
+        # check exceptions
+        assert_raises(TypeError, lag.lagder, [0], .5)
+        assert_raises(ValueError, lag.lagder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = lag.lagder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = lag.lagder(lag.lagint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = lag.lagder(lag.lagint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_lagder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([lag.lagder(c) for c in c2d.T]).T
+        res = lag.lagder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([lag.lagder(c) for c in c2d])
+        res = lag.lagder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_lagvander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = lag.lagvander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], lag.lagval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = lag.lagvander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], lag.lagval(x, coef))
+
+    def test_lagvander2d(self):
+        # also tests lagval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = lag.lagvander2d(x1, x2, [1, 2])
+        tgt = lag.lagval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = lag.lagvander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_lagvander3d(self):
+        # also tests lagval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = lag.lagvander3d(x1, x2, x3, [1, 2, 3])
+        tgt = lag.lagval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = lag.lagvander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestFitting:
+
+    def test_lagfit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        # Test exceptions
+        assert_raises(ValueError, lag.lagfit, [1], [1], -1)
+        assert_raises(TypeError, lag.lagfit, [[1]], [1], 0)
+        assert_raises(TypeError, lag.lagfit, [], [1], 0)
+        assert_raises(TypeError, lag.lagfit, [1], [[[1]]], 0)
+        assert_raises(TypeError, lag.lagfit, [1, 2], [1], 0)
+        assert_raises(TypeError, lag.lagfit, [1], [1, 2], 0)
+        assert_raises(TypeError, lag.lagfit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, lag.lagfit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, lag.lagfit, [1], [1], [-1,])
+        assert_raises(ValueError, lag.lagfit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, lag.lagfit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = lag.lagfit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(lag.lagval(x, coef3), y)
+        coef3 = lag.lagfit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(lag.lagval(x, coef3), y)
+        #
+        coef4 = lag.lagfit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(lag.lagval(x, coef4), y)
+        coef4 = lag.lagfit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(lag.lagval(x, coef4), y)
+        #
+        coef2d = lag.lagfit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = lag.lagfit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        y[0::2] = 0
+        wcoef3 = lag.lagfit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = lag.lagfit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = lag.lagfit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = lag.lagfit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(lag.lagfit(x, x, 1), [1, -1])
+        assert_almost_equal(lag.lagfit(x, x, [0, 1]), [1, -1])
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, lag.lagcompanion, [])
+        assert_raises(ValueError, lag.lagcompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(lag.lagcompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(lag.lagcompanion([1, 2])[0, 0] == 1.5)
+
+
+class TestGauss:
+
+    def test_100(self):
+        x, w = lag.laggauss(100)
+
+        # test orthogonality. Note that the results need to be normalized,
+        # otherwise the huge values that can arise from fast growing
+        # functions like Laguerre can be very confusing.
+        v = lag.lagvander(x, 99)
+        vv = np.dot(v.T * w, v)
+        vd = 1/np.sqrt(vv.diagonal())
+        vv = vd[:, None] * vv * vd
+        assert_almost_equal(vv, np.eye(100))
+
+        # check that the integral of 1 is correct
+        tgt = 1.0
+        assert_almost_equal(w.sum(), tgt)
+
+
+class TestMisc:
+
+    def test_lagfromroots(self):
+        res = lag.lagfromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            pol = lag.lagfromroots(roots)
+            res = lag.lagval(roots, pol)
+            tgt = 0
+            assert_(len(pol) == i + 1)
+            assert_almost_equal(lag.lag2poly(pol)[-1], 1)
+            assert_almost_equal(res, tgt)
+
+    def test_lagroots(self):
+        assert_almost_equal(lag.lagroots([1]), [])
+        assert_almost_equal(lag.lagroots([0, 1]), [1])
+        for i in range(2, 5):
+            tgt = np.linspace(0, 3, i)
+            res = lag.lagroots(lag.lagfromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_lagtrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, lag.lagtrim, coef, -1)
+
+        # Test results
+        assert_equal(lag.lagtrim(coef), coef[:-1])
+        assert_equal(lag.lagtrim(coef, 1), coef[:-3])
+        assert_equal(lag.lagtrim(coef, 2), [0])
+
+    def test_lagline(self):
+        assert_equal(lag.lagline(3, 4), [7, -4])
+
+    def test_lag2poly(self):
+        for i in range(7):
+            assert_almost_equal(lag.lag2poly([0]*i + [1]), Llist[i])
+
+    def test_poly2lag(self):
+        for i in range(7):
+            assert_almost_equal(lag.poly2lag(Llist[i]), [0]*i + [1])
+
+    def test_weight(self):
+        x = np.linspace(0, 10, 11)
+        tgt = np.exp(-x)
+        res = lag.lagweight(x)
+        assert_almost_equal(res, tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_legendre.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_legendre.py
new file mode 100644
index 000000000..a2a212c24
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_legendre.py
@@ -0,0 +1,556 @@
+"""Tests for legendre module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.legendre as leg
+from numpy.polynomial.polynomial import polyval
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+L0 = np.array([1])
+L1 = np.array([0, 1])
+L2 = np.array([-1, 0, 3])/2
+L3 = np.array([0, -3, 0, 5])/2
+L4 = np.array([3, 0, -30, 0, 35])/8
+L5 = np.array([0, 15, 0, -70, 0, 63])/8
+L6 = np.array([-5, 0, 105, 0, -315, 0, 231])/16
+L7 = np.array([0, -35, 0, 315, 0, -693, 0, 429])/16
+L8 = np.array([35, 0, -1260, 0, 6930, 0, -12012, 0, 6435])/128
+L9 = np.array([0, 315, 0, -4620, 0, 18018, 0, -25740, 0, 12155])/128
+
+Llist = [L0, L1, L2, L3, L4, L5, L6, L7, L8, L9]
+
+
+def trim(x):
+    return leg.legtrim(x, tol=1e-6)
+
+
+class TestConstants:
+
+    def test_legdomain(self):
+        assert_equal(leg.legdomain, [-1, 1])
+
+    def test_legzero(self):
+        assert_equal(leg.legzero, [0])
+
+    def test_legone(self):
+        assert_equal(leg.legone, [1])
+
+    def test_legx(self):
+        assert_equal(leg.legx, [0, 1])
+
+
+class TestArithmetic:
+    x = np.linspace(-1, 1, 100)
+
+    def test_legadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = leg.legadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_legsub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = leg.legsub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_legmulx(self):
+        assert_equal(leg.legmulx([0]), [0])
+        assert_equal(leg.legmulx([1]), [0, 1])
+        for i in range(1, 5):
+            tmp = 2*i + 1
+            ser = [0]*i + [1]
+            tgt = [0]*(i - 1) + [i/tmp, 0, (i + 1)/tmp]
+            assert_equal(leg.legmulx(ser), tgt)
+
+    def test_legmul(self):
+        # check values of result
+        for i in range(5):
+            pol1 = [0]*i + [1]
+            val1 = leg.legval(self.x, pol1)
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                pol2 = [0]*j + [1]
+                val2 = leg.legval(self.x, pol2)
+                pol3 = leg.legmul(pol1, pol2)
+                val3 = leg.legval(self.x, pol3)
+                assert_(len(pol3) == i + j + 1, msg)
+                assert_almost_equal(val3, val1*val2, err_msg=msg)
+
+    def test_legdiv(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1]
+                cj = [0]*j + [1]
+                tgt = leg.legadd(ci, cj)
+                quo, rem = leg.legdiv(tgt, ci)
+                res = leg.legadd(leg.legmul(quo, ci), rem)
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_legpow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(leg.legmul, [c]*j, np.array([1]))
+                res = leg.legpow(c, j) 
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([2., 2., 2.])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = polyval(x, [1., 2., 3.])
+
+    def test_legval(self):
+        #check empty input
+        assert_equal(leg.legval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [polyval(x, c) for c in Llist]
+        for i in range(10):
+            msg = f"At i={i}"
+            tgt = y[i]
+            res = leg.legval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt, err_msg=msg)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(leg.legval(x, [1]).shape, dims)
+            assert_equal(leg.legval(x, [1, 0]).shape, dims)
+            assert_equal(leg.legval(x, [1, 0, 0]).shape, dims)
+
+    def test_legval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, leg.legval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = leg.legval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = leg.legval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_legval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises(ValueError, leg.legval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = leg.legval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = leg.legval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_leggrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = leg.leggrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = leg.leggrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_leggrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = leg.leggrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = leg.leggrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_legint(self):
+        # check exceptions
+        assert_raises(TypeError, leg.legint, [0], .5)
+        assert_raises(ValueError, leg.legint, [0], -1)
+        assert_raises(ValueError, leg.legint, [0], 1, [0, 0])
+        assert_raises(ValueError, leg.legint, [0], lbnd=[0])
+        assert_raises(ValueError, leg.legint, [0], scl=[0])
+        assert_raises(TypeError, leg.legint, [0], axis=.5)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = leg.legint([0], m=i, k=k)
+            assert_almost_equal(res, [0, 1])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            legpol = leg.poly2leg(pol)
+            legint = leg.legint(legpol, m=1, k=[i])
+            res = leg.leg2poly(legint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            legpol = leg.poly2leg(pol)
+            legint = leg.legint(legpol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(leg.legval(-1, legint), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            legpol = leg.poly2leg(pol)
+            legint = leg.legint(legpol, m=1, k=[i], scl=2)
+            res = leg.leg2poly(legint)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = leg.legint(tgt, m=1)
+                res = leg.legint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = leg.legint(tgt, m=1, k=[k])
+                res = leg.legint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = leg.legint(tgt, m=1, k=[k], lbnd=-1)
+                res = leg.legint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = leg.legint(tgt, m=1, k=[k], scl=2)
+                res = leg.legint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_legint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([leg.legint(c) for c in c2d.T]).T
+        res = leg.legint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([leg.legint(c) for c in c2d])
+        res = leg.legint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([leg.legint(c, k=3) for c in c2d])
+        res = leg.legint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_legder(self):
+        # check exceptions
+        assert_raises(TypeError, leg.legder, [0], .5)
+        assert_raises(ValueError, leg.legder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = leg.legder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = leg.legder(leg.legint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = leg.legder(leg.legint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_legder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([leg.legder(c) for c in c2d.T]).T
+        res = leg.legder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([leg.legder(c) for c in c2d])
+        res = leg.legder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_legvander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = leg.legvander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], leg.legval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = leg.legvander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], leg.legval(x, coef))
+
+    def test_legvander2d(self):
+        # also tests polyval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = leg.legvander2d(x1, x2, [1, 2])
+        tgt = leg.legval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = leg.legvander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_legvander3d(self):
+        # also tests polyval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = leg.legvander3d(x1, x2, x3, [1, 2, 3])
+        tgt = leg.legval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = leg.legvander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestFitting:
+
+    def test_legfit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        def f2(x):
+            return x**4 + x**2 + 1
+
+        # Test exceptions
+        assert_raises(ValueError, leg.legfit, [1], [1], -1)
+        assert_raises(TypeError, leg.legfit, [[1]], [1], 0)
+        assert_raises(TypeError, leg.legfit, [], [1], 0)
+        assert_raises(TypeError, leg.legfit, [1], [[[1]]], 0)
+        assert_raises(TypeError, leg.legfit, [1, 2], [1], 0)
+        assert_raises(TypeError, leg.legfit, [1], [1, 2], 0)
+        assert_raises(TypeError, leg.legfit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, leg.legfit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, leg.legfit, [1], [1], [-1,])
+        assert_raises(ValueError, leg.legfit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, leg.legfit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = leg.legfit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(leg.legval(x, coef3), y)
+        coef3 = leg.legfit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(leg.legval(x, coef3), y)
+        #
+        coef4 = leg.legfit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(leg.legval(x, coef4), y)
+        coef4 = leg.legfit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(leg.legval(x, coef4), y)
+        # check things still work if deg is not in strict increasing
+        coef4 = leg.legfit(x, y, [2, 3, 4, 1, 0])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(leg.legval(x, coef4), y)
+        #
+        coef2d = leg.legfit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = leg.legfit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        y[0::2] = 0
+        wcoef3 = leg.legfit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = leg.legfit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = leg.legfit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = leg.legfit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(leg.legfit(x, x, 1), [0, 1])
+        assert_almost_equal(leg.legfit(x, x, [0, 1]), [0, 1])
+        # test fitting only even Legendre polynomials
+        x = np.linspace(-1, 1)
+        y = f2(x)
+        coef1 = leg.legfit(x, y, 4)
+        assert_almost_equal(leg.legval(x, coef1), y)
+        coef2 = leg.legfit(x, y, [0, 2, 4])
+        assert_almost_equal(leg.legval(x, coef2), y)
+        assert_almost_equal(coef1, coef2)
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, leg.legcompanion, [])
+        assert_raises(ValueError, leg.legcompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(leg.legcompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(leg.legcompanion([1, 2])[0, 0] == -.5)
+
+
+class TestGauss:
+
+    def test_100(self):
+        x, w = leg.leggauss(100)
+
+        # test orthogonality. Note that the results need to be normalized,
+        # otherwise the huge values that can arise from fast growing
+        # functions like Laguerre can be very confusing.
+        v = leg.legvander(x, 99)
+        vv = np.dot(v.T * w, v)
+        vd = 1/np.sqrt(vv.diagonal())
+        vv = vd[:, None] * vv * vd
+        assert_almost_equal(vv, np.eye(100))
+
+        # check that the integral of 1 is correct
+        tgt = 2.0
+        assert_almost_equal(w.sum(), tgt)
+
+
+class TestMisc:
+
+    def test_legfromroots(self):
+        res = leg.legfromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            pol = leg.legfromroots(roots)
+            res = leg.legval(roots, pol)
+            tgt = 0
+            assert_(len(pol) == i + 1)
+            assert_almost_equal(leg.leg2poly(pol)[-1], 1)
+            assert_almost_equal(res, tgt)
+
+    def test_legroots(self):
+        assert_almost_equal(leg.legroots([1]), [])
+        assert_almost_equal(leg.legroots([1, 2]), [-.5])
+        for i in range(2, 5):
+            tgt = np.linspace(-1, 1, i)
+            res = leg.legroots(leg.legfromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_legtrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, leg.legtrim, coef, -1)
+
+        # Test results
+        assert_equal(leg.legtrim(coef), coef[:-1])
+        assert_equal(leg.legtrim(coef, 1), coef[:-3])
+        assert_equal(leg.legtrim(coef, 2), [0])
+
+    def test_legline(self):
+        assert_equal(leg.legline(3, 4), [3, 4])
+
+    def test_leg2poly(self):
+        for i in range(10):
+            assert_almost_equal(leg.leg2poly([0]*i + [1]), Llist[i])
+
+    def test_poly2leg(self):
+        for i in range(10):
+            assert_almost_equal(leg.poly2leg(Llist[i]), [0]*i + [1])
+
+    def test_weight(self):
+        x = np.linspace(-1, 1, 11)
+        tgt = 1.
+        res = leg.legweight(x)
+        assert_almost_equal(res, tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_polynomial.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_polynomial.py
new file mode 100644
index 000000000..5fd1a82a2
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_polynomial.py
@@ -0,0 +1,593 @@
+"""Tests for polynomial module.
+
+"""
+from functools import reduce
+
+import numpy as np
+import numpy.polynomial.polynomial as poly
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    assert_warns, assert_array_equal, assert_raises_regex)
+
+
+def trim(x):
+    return poly.polytrim(x, tol=1e-6)
+
+T0 = [1]
+T1 = [0, 1]
+T2 = [-1, 0, 2]
+T3 = [0, -3, 0, 4]
+T4 = [1, 0, -8, 0, 8]
+T5 = [0, 5, 0, -20, 0, 16]
+T6 = [-1, 0, 18, 0, -48, 0, 32]
+T7 = [0, -7, 0, 56, 0, -112, 0, 64]
+T8 = [1, 0, -32, 0, 160, 0, -256, 0, 128]
+T9 = [0, 9, 0, -120, 0, 432, 0, -576, 0, 256]
+
+Tlist = [T0, T1, T2, T3, T4, T5, T6, T7, T8, T9]
+
+
+class TestConstants:
+
+    def test_polydomain(self):
+        assert_equal(poly.polydomain, [-1, 1])
+
+    def test_polyzero(self):
+        assert_equal(poly.polyzero, [0])
+
+    def test_polyone(self):
+        assert_equal(poly.polyone, [1])
+
+    def test_polyx(self):
+        assert_equal(poly.polyx, [0, 1])
+
+
+class TestArithmetic:
+
+    def test_polyadd(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] += 1
+                res = poly.polyadd([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_polysub(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(max(i, j) + 1)
+                tgt[i] += 1
+                tgt[j] -= 1
+                res = poly.polysub([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_polymulx(self):
+        assert_equal(poly.polymulx([0]), [0])
+        assert_equal(poly.polymulx([1]), [0, 1])
+        for i in range(1, 5):
+            ser = [0]*i + [1]
+            tgt = [0]*(i + 1) + [1]
+            assert_equal(poly.polymulx(ser), tgt)
+
+    def test_polymul(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                tgt = np.zeros(i + j + 1)
+                tgt[i + j] += 1
+                res = poly.polymul([0]*i + [1], [0]*j + [1])
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+    def test_polydiv(self):
+        # check zero division
+        assert_raises(ZeroDivisionError, poly.polydiv, [1], [0])
+
+        # check scalar division
+        quo, rem = poly.polydiv([2], [2])
+        assert_equal((quo, rem), (1, 0))
+        quo, rem = poly.polydiv([2, 2], [2])
+        assert_equal((quo, rem), ((1, 1), 0))
+
+        # check rest.
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                ci = [0]*i + [1, 2]
+                cj = [0]*j + [1, 2]
+                tgt = poly.polyadd(ci, cj)
+                quo, rem = poly.polydiv(tgt, ci)
+                res = poly.polyadd(poly.polymul(quo, ci), rem)
+                assert_equal(res, tgt, err_msg=msg)
+
+    def test_polypow(self):
+        for i in range(5):
+            for j in range(5):
+                msg = f"At i={i}, j={j}"
+                c = np.arange(i + 1)
+                tgt = reduce(poly.polymul, [c]*j, np.array([1]))
+                res = poly.polypow(c, j) 
+                assert_equal(trim(res), trim(tgt), err_msg=msg)
+
+
+class TestEvaluation:
+    # coefficients of 1 + 2*x + 3*x**2
+    c1d = np.array([1., 2., 3.])
+    c2d = np.einsum('i,j->ij', c1d, c1d)
+    c3d = np.einsum('i,j,k->ijk', c1d, c1d, c1d)
+
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+    y = poly.polyval(x, [1., 2., 3.])
+
+    def test_polyval(self):
+        #check empty input
+        assert_equal(poly.polyval([], [1]).size, 0)
+
+        #check normal input)
+        x = np.linspace(-1, 1)
+        y = [x**i for i in range(5)]
+        for i in range(5):
+            tgt = y[i]
+            res = poly.polyval(x, [0]*i + [1])
+            assert_almost_equal(res, tgt)
+        tgt = x*(x**2 - 1)
+        res = poly.polyval(x, [0, -1, 0, 1])
+        assert_almost_equal(res, tgt)
+
+        #check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(poly.polyval(x, [1]).shape, dims)
+            assert_equal(poly.polyval(x, [1, 0]).shape, dims)
+            assert_equal(poly.polyval(x, [1, 0, 0]).shape, dims)
+
+        #check masked arrays are processed correctly
+        mask = [False, True, False]
+        mx = np.ma.array([1, 2, 3], mask=mask)
+        res = np.polyval([7, 5, 3], mx)
+        assert_array_equal(res.mask, mask)
+
+        #check subtypes of ndarray are preserved
+        class C(np.ndarray):
+            pass
+
+        cx = np.array([1, 2, 3]).view(C)
+        assert_equal(type(np.polyval([2, 3, 4], cx)), C)
+
+    def test_polyvalfromroots(self):
+        # check exception for broadcasting x values over root array with
+        # too few dimensions
+        assert_raises(ValueError, poly.polyvalfromroots,
+                      [1], [1], tensor=False)
+
+        # check empty input
+        assert_equal(poly.polyvalfromroots([], [1]).size, 0)
+        assert_(poly.polyvalfromroots([], [1]).shape == (0,))
+
+        # check empty input + multidimensional roots
+        assert_equal(poly.polyvalfromroots([], [[1] * 5]).size, 0)
+        assert_(poly.polyvalfromroots([], [[1] * 5]).shape == (5, 0))
+
+        # check scalar input
+        assert_equal(poly.polyvalfromroots(1, 1), 0)
+        assert_(poly.polyvalfromroots(1, np.ones((3, 3))).shape == (3,))
+
+        # check normal input)
+        x = np.linspace(-1, 1)
+        y = [x**i for i in range(5)]
+        for i in range(1, 5):
+            tgt = y[i]
+            res = poly.polyvalfromroots(x, [0]*i)
+            assert_almost_equal(res, tgt)
+        tgt = x*(x - 1)*(x + 1)
+        res = poly.polyvalfromroots(x, [-1, 0, 1])
+        assert_almost_equal(res, tgt)
+
+        # check that shape is preserved
+        for i in range(3):
+            dims = [2]*i
+            x = np.zeros(dims)
+            assert_equal(poly.polyvalfromroots(x, [1]).shape, dims)
+            assert_equal(poly.polyvalfromroots(x, [1, 0]).shape, dims)
+            assert_equal(poly.polyvalfromroots(x, [1, 0, 0]).shape, dims)
+
+        # check compatibility with factorization
+        ptest = [15, 2, -16, -2, 1]
+        r = poly.polyroots(ptest)
+        x = np.linspace(-1, 1)
+        assert_almost_equal(poly.polyval(x, ptest),
+                            poly.polyvalfromroots(x, r))
+
+        # check multidimensional arrays of roots and values
+        # check tensor=False
+        rshape = (3, 5)
+        x = np.arange(-3, 2)
+        r = np.random.randint(-5, 5, size=rshape)
+        res = poly.polyvalfromroots(x, r, tensor=False)
+        tgt = np.empty(r.shape[1:])
+        for ii in range(tgt.size):
+            tgt[ii] = poly.polyvalfromroots(x[ii], r[:, ii])
+        assert_equal(res, tgt)
+
+        # check tensor=True
+        x = np.vstack([x, 2*x])
+        res = poly.polyvalfromroots(x, r, tensor=True)
+        tgt = np.empty(r.shape[1:] + x.shape)
+        for ii in range(r.shape[1]):
+            for jj in range(x.shape[0]):
+                tgt[ii, jj, :] = poly.polyvalfromroots(x[jj], r[:, ii])
+        assert_equal(res, tgt)
+
+    def test_polyval2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises_regex(ValueError, 'incompatible',
+                            poly.polyval2d, x1, x2[:2], self.c2d)
+
+        #test values
+        tgt = y1*y2
+        res = poly.polyval2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = poly.polyval2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3))
+
+    def test_polyval3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test exceptions
+        assert_raises_regex(ValueError, 'incompatible',
+                      poly.polyval3d, x1, x2, x3[:2], self.c3d)
+
+        #test values
+        tgt = y1*y2*y3
+        res = poly.polyval3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = poly.polyval3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3))
+
+    def test_polygrid2d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j->ij', y1, y2)
+        res = poly.polygrid2d(x1, x2, self.c2d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = poly.polygrid2d(z, z, self.c2d)
+        assert_(res.shape == (2, 3)*2)
+
+    def test_polygrid3d(self):
+        x1, x2, x3 = self.x
+        y1, y2, y3 = self.y
+
+        #test values
+        tgt = np.einsum('i,j,k->ijk', y1, y2, y3)
+        res = poly.polygrid3d(x1, x2, x3, self.c3d)
+        assert_almost_equal(res, tgt)
+
+        #test shape
+        z = np.ones((2, 3))
+        res = poly.polygrid3d(z, z, z, self.c3d)
+        assert_(res.shape == (2, 3)*3)
+
+
+class TestIntegral:
+
+    def test_polyint(self):
+        # check exceptions
+        assert_raises(TypeError, poly.polyint, [0], .5)
+        assert_raises(ValueError, poly.polyint, [0], -1)
+        assert_raises(ValueError, poly.polyint, [0], 1, [0, 0])
+        assert_raises(ValueError, poly.polyint, [0], lbnd=[0])
+        assert_raises(ValueError, poly.polyint, [0], scl=[0])
+        assert_raises(TypeError, poly.polyint, [0], axis=.5)
+        with assert_warns(DeprecationWarning):
+            poly.polyint([1, 1], 1.)
+
+        # test integration of zero polynomial
+        for i in range(2, 5):
+            k = [0]*(i - 2) + [1]
+            res = poly.polyint([0], m=i, k=k)
+            assert_almost_equal(res, [0, 1])
+
+        # check single integration with integration constant
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [1/scl]
+            res = poly.polyint(pol, m=1, k=[i])
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check single integration with integration constant and lbnd
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            res = poly.polyint(pol, m=1, k=[i], lbnd=-1)
+            assert_almost_equal(poly.polyval(-1, res), i)
+
+        # check single integration with integration constant and scaling
+        for i in range(5):
+            scl = i + 1
+            pol = [0]*i + [1]
+            tgt = [i] + [0]*i + [2/scl]
+            res = poly.polyint(pol, m=1, k=[i], scl=2)
+            assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with default k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = poly.polyint(tgt, m=1)
+                res = poly.polyint(pol, m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with defined k
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = poly.polyint(tgt, m=1, k=[k])
+                res = poly.polyint(pol, m=j, k=list(range(j)))
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with lbnd
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = poly.polyint(tgt, m=1, k=[k], lbnd=-1)
+                res = poly.polyint(pol, m=j, k=list(range(j)), lbnd=-1)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check multiple integrations with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                pol = [0]*i + [1]
+                tgt = pol[:]
+                for k in range(j):
+                    tgt = poly.polyint(tgt, m=1, k=[k], scl=2)
+                res = poly.polyint(pol, m=j, k=list(range(j)), scl=2)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_polyint_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([poly.polyint(c) for c in c2d.T]).T
+        res = poly.polyint(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([poly.polyint(c) for c in c2d])
+        res = poly.polyint(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([poly.polyint(c, k=3) for c in c2d])
+        res = poly.polyint(c2d, k=3, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestDerivative:
+
+    def test_polyder(self):
+        # check exceptions
+        assert_raises(TypeError, poly.polyder, [0], .5)
+        assert_raises(ValueError, poly.polyder, [0], -1)
+
+        # check that zeroth derivative does nothing
+        for i in range(5):
+            tgt = [0]*i + [1]
+            res = poly.polyder(tgt, m=0)
+            assert_equal(trim(res), trim(tgt))
+
+        # check that derivation is the inverse of integration
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = poly.polyder(poly.polyint(tgt, m=j), m=j)
+                assert_almost_equal(trim(res), trim(tgt))
+
+        # check derivation with scaling
+        for i in range(5):
+            for j in range(2, 5):
+                tgt = [0]*i + [1]
+                res = poly.polyder(poly.polyint(tgt, m=j, scl=2), m=j, scl=.5)
+                assert_almost_equal(trim(res), trim(tgt))
+
+    def test_polyder_axis(self):
+        # check that axis keyword works
+        c2d = np.random.random((3, 4))
+
+        tgt = np.vstack([poly.polyder(c) for c in c2d.T]).T
+        res = poly.polyder(c2d, axis=0)
+        assert_almost_equal(res, tgt)
+
+        tgt = np.vstack([poly.polyder(c) for c in c2d])
+        res = poly.polyder(c2d, axis=1)
+        assert_almost_equal(res, tgt)
+
+
+class TestVander:
+    # some random values in [-1, 1)
+    x = np.random.random((3, 5))*2 - 1
+
+    def test_polyvander(self):
+        # check for 1d x
+        x = np.arange(3)
+        v = poly.polyvander(x, 3)
+        assert_(v.shape == (3, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], poly.polyval(x, coef))
+
+        # check for 2d x
+        x = np.array([[1, 2], [3, 4], [5, 6]])
+        v = poly.polyvander(x, 3)
+        assert_(v.shape == (3, 2, 4))
+        for i in range(4):
+            coef = [0]*i + [1]
+            assert_almost_equal(v[..., i], poly.polyval(x, coef))
+
+    def test_polyvander2d(self):
+        # also tests polyval2d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3))
+        van = poly.polyvander2d(x1, x2, [1, 2])
+        tgt = poly.polyval2d(x1, x2, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = poly.polyvander2d([x1], [x2], [1, 2])
+        assert_(van.shape == (1, 5, 6))
+
+    def test_polyvander3d(self):
+        # also tests polyval3d for non-square coefficient array
+        x1, x2, x3 = self.x
+        c = np.random.random((2, 3, 4))
+        van = poly.polyvander3d(x1, x2, x3, [1, 2, 3])
+        tgt = poly.polyval3d(x1, x2, x3, c)
+        res = np.dot(van, c.flat)
+        assert_almost_equal(res, tgt)
+
+        # check shape
+        van = poly.polyvander3d([x1], [x2], [x3], [1, 2, 3])
+        assert_(van.shape == (1, 5, 24))
+
+
+class TestCompanion:
+
+    def test_raises(self):
+        assert_raises(ValueError, poly.polycompanion, [])
+        assert_raises(ValueError, poly.polycompanion, [1])
+
+    def test_dimensions(self):
+        for i in range(1, 5):
+            coef = [0]*i + [1]
+            assert_(poly.polycompanion(coef).shape == (i, i))
+
+    def test_linear_root(self):
+        assert_(poly.polycompanion([1, 2])[0, 0] == -.5)
+
+
+class TestMisc:
+
+    def test_polyfromroots(self):
+        res = poly.polyfromroots([])
+        assert_almost_equal(trim(res), [1])
+        for i in range(1, 5):
+            roots = np.cos(np.linspace(-np.pi, 0, 2*i + 1)[1::2])
+            tgt = Tlist[i]
+            res = poly.polyfromroots(roots)*2**(i-1)
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_polyroots(self):
+        assert_almost_equal(poly.polyroots([1]), [])
+        assert_almost_equal(poly.polyroots([1, 2]), [-.5])
+        for i in range(2, 5):
+            tgt = np.linspace(-1, 1, i)
+            res = poly.polyroots(poly.polyfromroots(tgt))
+            assert_almost_equal(trim(res), trim(tgt))
+
+    def test_polyfit(self):
+        def f(x):
+            return x*(x - 1)*(x - 2)
+
+        def f2(x):
+            return x**4 + x**2 + 1
+
+        # Test exceptions
+        assert_raises(ValueError, poly.polyfit, [1], [1], -1)
+        assert_raises(TypeError, poly.polyfit, [[1]], [1], 0)
+        assert_raises(TypeError, poly.polyfit, [], [1], 0)
+        assert_raises(TypeError, poly.polyfit, [1], [[[1]]], 0)
+        assert_raises(TypeError, poly.polyfit, [1, 2], [1], 0)
+        assert_raises(TypeError, poly.polyfit, [1], [1, 2], 0)
+        assert_raises(TypeError, poly.polyfit, [1], [1], 0, w=[[1]])
+        assert_raises(TypeError, poly.polyfit, [1], [1], 0, w=[1, 1])
+        assert_raises(ValueError, poly.polyfit, [1], [1], [-1,])
+        assert_raises(ValueError, poly.polyfit, [1], [1], [2, -1, 6])
+        assert_raises(TypeError, poly.polyfit, [1], [1], [])
+
+        # Test fit
+        x = np.linspace(0, 2)
+        y = f(x)
+        #
+        coef3 = poly.polyfit(x, y, 3)
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(poly.polyval(x, coef3), y)
+        coef3 = poly.polyfit(x, y, [0, 1, 2, 3])
+        assert_equal(len(coef3), 4)
+        assert_almost_equal(poly.polyval(x, coef3), y)
+        #
+        coef4 = poly.polyfit(x, y, 4)
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(poly.polyval(x, coef4), y)
+        coef4 = poly.polyfit(x, y, [0, 1, 2, 3, 4])
+        assert_equal(len(coef4), 5)
+        assert_almost_equal(poly.polyval(x, coef4), y)
+        #
+        coef2d = poly.polyfit(x, np.array([y, y]).T, 3)
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        coef2d = poly.polyfit(x, np.array([y, y]).T, [0, 1, 2, 3])
+        assert_almost_equal(coef2d, np.array([coef3, coef3]).T)
+        # test weighting
+        w = np.zeros_like(x)
+        yw = y.copy()
+        w[1::2] = 1
+        yw[0::2] = 0
+        wcoef3 = poly.polyfit(x, yw, 3, w=w)
+        assert_almost_equal(wcoef3, coef3)
+        wcoef3 = poly.polyfit(x, yw, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef3, coef3)
+        #
+        wcoef2d = poly.polyfit(x, np.array([yw, yw]).T, 3, w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        wcoef2d = poly.polyfit(x, np.array([yw, yw]).T, [0, 1, 2, 3], w=w)
+        assert_almost_equal(wcoef2d, np.array([coef3, coef3]).T)
+        # test scaling with complex values x points whose square
+        # is zero when summed.
+        x = [1, 1j, -1, -1j]
+        assert_almost_equal(poly.polyfit(x, x, 1), [0, 1])
+        assert_almost_equal(poly.polyfit(x, x, [0, 1]), [0, 1])
+        # test fitting only even Polyendre polynomials
+        x = np.linspace(-1, 1)
+        y = f2(x)
+        coef1 = poly.polyfit(x, y, 4)
+        assert_almost_equal(poly.polyval(x, coef1), y)
+        coef2 = poly.polyfit(x, y, [0, 2, 4])
+        assert_almost_equal(poly.polyval(x, coef2), y)
+        assert_almost_equal(coef1, coef2)
+
+    def test_polytrim(self):
+        coef = [2, -1, 1, 0]
+
+        # Test exceptions
+        assert_raises(ValueError, poly.polytrim, coef, -1)
+
+        # Test results
+        assert_equal(poly.polytrim(coef), coef[:-1])
+        assert_equal(poly.polytrim(coef, 1), coef[:-3])
+        assert_equal(poly.polytrim(coef, 2), [0])
+
+    def test_polyline(self):
+        assert_equal(poly.polyline(3, 4), [3, 4])
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_polyutils.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_polyutils.py
new file mode 100644
index 000000000..1b27f53b5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_polyutils.py
@@ -0,0 +1,106 @@
+"""Tests for polyutils module.
+
+"""
+import numpy as np
+import numpy.polynomial.polyutils as pu
+from numpy.testing import (
+    assert_almost_equal, assert_raises, assert_equal, assert_,
+    )
+
+
+class TestMisc:
+
+    def test_trimseq(self):
+        for i in range(5):
+            tgt = [1]
+            res = pu.trimseq([1] + [0]*5)
+            assert_equal(res, tgt)
+
+    def test_as_series(self):
+        # check exceptions
+        assert_raises(ValueError, pu.as_series, [[]])
+        assert_raises(ValueError, pu.as_series, [[[1, 2]]])
+        assert_raises(ValueError, pu.as_series, [[1], ['a']])
+        # check common types
+        types = ['i', 'd', 'O']
+        for i in range(len(types)):
+            for j in range(i):
+                ci = np.ones(1, types[i])
+                cj = np.ones(1, types[j])
+                [resi, resj] = pu.as_series([ci, cj])
+                assert_(resi.dtype.char == resj.dtype.char)
+                assert_(resj.dtype.char == types[i])
+
+    def test_trimcoef(self):
+        coef = [2, -1, 1, 0]
+        # Test exceptions
+        assert_raises(ValueError, pu.trimcoef, coef, -1)
+        # Test results
+        assert_equal(pu.trimcoef(coef), coef[:-1])
+        assert_equal(pu.trimcoef(coef, 1), coef[:-3])
+        assert_equal(pu.trimcoef(coef, 2), [0])
+
+
+class TestDomain:
+
+    def test_getdomain(self):
+        # test for real values
+        x = [1, 10, 3, -1]
+        tgt = [-1, 10]
+        res = pu.getdomain(x)
+        assert_almost_equal(res, tgt)
+
+        # test for complex values
+        x = [1 + 1j, 1 - 1j, 0, 2]
+        tgt = [-1j, 2 + 1j]
+        res = pu.getdomain(x)
+        assert_almost_equal(res, tgt)
+
+    def test_mapdomain(self):
+        # test for real values
+        dom1 = [0, 4]
+        dom2 = [1, 3]
+        tgt = dom2
+        res = pu.mapdomain(dom1, dom1, dom2)
+        assert_almost_equal(res, tgt)
+
+        # test for complex values
+        dom1 = [0 - 1j, 2 + 1j]
+        dom2 = [-2, 2]
+        tgt = dom2
+        x = dom1
+        res = pu.mapdomain(x, dom1, dom2)
+        assert_almost_equal(res, tgt)
+
+        # test for multidimensional arrays
+        dom1 = [0, 4]
+        dom2 = [1, 3]
+        tgt = np.array([dom2, dom2])
+        x = np.array([dom1, dom1])
+        res = pu.mapdomain(x, dom1, dom2)
+        assert_almost_equal(res, tgt)
+
+        # test that subtypes are preserved.
+        class MyNDArray(np.ndarray):
+            pass
+
+        dom1 = [0, 4]
+        dom2 = [1, 3]
+        x = np.array([dom1, dom1]).view(MyNDArray)
+        res = pu.mapdomain(x, dom1, dom2)
+        assert_(isinstance(res, MyNDArray))
+
+    def test_mapparms(self):
+        # test for real values
+        dom1 = [0, 4]
+        dom2 = [1, 3]
+        tgt = [1, .5]
+        res = pu. mapparms(dom1, dom2)
+        assert_almost_equal(res, tgt)
+
+        # test for complex values
+        dom1 = [0 - 1j, 2 + 1j]
+        dom2 = [-2, 2]
+        tgt = [-1 + 1j, 1 - 1j]
+        res = pu.mapparms(dom1, dom2)
+        assert_almost_equal(res, tgt)
diff --git a/venv/Lib/site-packages/numpy/polynomial/tests/test_printing.py b/venv/Lib/site-packages/numpy/polynomial/tests/test_printing.py
new file mode 100644
index 000000000..bbd5502af
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/polynomial/tests/test_printing.py
@@ -0,0 +1,115 @@
+import numpy.polynomial as poly
+from numpy.testing import assert_equal
+
+
+class TestStr:
+    def test_polynomial_str(self):
+        res = str(poly.Polynomial([0, 1]))
+        tgt = 'poly([0. 1.])'
+        assert_equal(res, tgt)
+
+    def test_chebyshev_str(self):
+        res = str(poly.Chebyshev([0, 1]))
+        tgt = 'cheb([0. 1.])'
+        assert_equal(res, tgt)
+
+    def test_legendre_str(self):
+        res = str(poly.Legendre([0, 1]))
+        tgt = 'leg([0. 1.])'
+        assert_equal(res, tgt)
+
+    def test_hermite_str(self):
+        res = str(poly.Hermite([0, 1]))
+        tgt = 'herm([0. 1.])'
+        assert_equal(res, tgt)
+
+    def test_hermiteE_str(self):
+        res = str(poly.HermiteE([0, 1]))
+        tgt = 'herme([0. 1.])'
+        assert_equal(res, tgt)
+
+    def test_laguerre_str(self):
+        res = str(poly.Laguerre([0, 1]))
+        tgt = 'lag([0. 1.])'
+        assert_equal(res, tgt)
+
+
+class TestRepr:
+    def test_polynomial_str(self):
+        res = repr(poly.Polynomial([0, 1]))
+        tgt = 'Polynomial([0., 1.], domain=[-1,  1], window=[-1,  1])'
+        assert_equal(res, tgt)
+
+    def test_chebyshev_str(self):
+        res = repr(poly.Chebyshev([0, 1]))
+        tgt = 'Chebyshev([0., 1.], domain=[-1,  1], window=[-1,  1])'
+        assert_equal(res, tgt)
+
+    def test_legendre_repr(self):
+        res = repr(poly.Legendre([0, 1]))
+        tgt = 'Legendre([0., 1.], domain=[-1,  1], window=[-1,  1])'
+        assert_equal(res, tgt)
+
+    def test_hermite_repr(self):
+        res = repr(poly.Hermite([0, 1]))
+        tgt = 'Hermite([0., 1.], domain=[-1,  1], window=[-1,  1])'
+        assert_equal(res, tgt)
+
+    def test_hermiteE_repr(self):
+        res = repr(poly.HermiteE([0, 1]))
+        tgt = 'HermiteE([0., 1.], domain=[-1,  1], window=[-1,  1])'
+        assert_equal(res, tgt)
+
+    def test_laguerre_repr(self):
+        res = repr(poly.Laguerre([0, 1]))
+        tgt = 'Laguerre([0., 1.], domain=[0, 1], window=[0, 1])'
+        assert_equal(res, tgt)
+
+
+class TestLatexRepr:
+    """Test the latex repr used by Jupyter"""
+
+    def as_latex(self, obj):
+        # right now we ignore the formatting of scalars in our tests, since
+        # it makes them too verbose. Ideally, the formatting of scalars will
+        # be fixed such that tests below continue to pass
+        obj._repr_latex_scalar = lambda x: str(x)
+        try:
+            return obj._repr_latex_()
+        finally:
+            del obj._repr_latex_scalar
+
+    def test_simple_polynomial(self):
+        # default input
+        p = poly.Polynomial([1, 2, 3])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0 + 2.0\,x + 3.0\,x^{2}$')
+
+        # translated input
+        p = poly.Polynomial([1, 2, 3], domain=[-2, 0])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0 + 2.0\,\left(1.0 + x\right) + 3.0\,\left(1.0 + x\right)^{2}$')
+
+        # scaled input
+        p = poly.Polynomial([1, 2, 3], domain=[-0.5, 0.5])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0 + 2.0\,\left(2.0x\right) + 3.0\,\left(2.0x\right)^{2}$')
+
+        # affine input
+        p = poly.Polynomial([1, 2, 3], domain=[-1, 0])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0 + 2.0\,\left(1.0 + 2.0x\right) + 3.0\,\left(1.0 + 2.0x\right)^{2}$')
+
+    def test_basis_func(self):
+        p = poly.Chebyshev([1, 2, 3])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0\,{T}_{0}(x) + 2.0\,{T}_{1}(x) + 3.0\,{T}_{2}(x)$')
+        # affine input - check no surplus parens are added
+        p = poly.Chebyshev([1, 2, 3], domain=[-1, 0])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0\,{T}_{0}(1.0 + 2.0x) + 2.0\,{T}_{1}(1.0 + 2.0x) + 3.0\,{T}_{2}(1.0 + 2.0x)$')
+
+    def test_multichar_basis_func(self):
+        p = poly.HermiteE([1, 2, 3])
+        assert_equal(self.as_latex(p),
+            r'$x \mapsto 1.0\,{He}_{0}(x) + 2.0\,{He}_{1}(x) + 3.0\,{He}_{2}(x)$')
diff --git a/venv/Lib/site-packages/numpy/random/__init__.pxd b/venv/Lib/site-packages/numpy/random/__init__.pxd
new file mode 100644
index 000000000..1f9057296
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/__init__.pxd
@@ -0,0 +1,14 @@
+cimport numpy as np
+from libc.stdint cimport uint32_t, uint64_t
+
+cdef extern from "numpy/random/bitgen.h":
+    struct bitgen:
+        void *state
+        uint64_t (*next_uint64)(void *st) nogil
+        uint32_t (*next_uint32)(void *st) nogil
+        double (*next_double)(void *st) nogil
+        uint64_t (*next_raw)(void *st) nogil
+
+    ctypedef bitgen bitgen_t
+
+from numpy.random.bit_generator cimport BitGenerator, SeedSequence
diff --git a/venv/Lib/site-packages/numpy/random/__init__.py b/venv/Lib/site-packages/numpy/random/__init__.py
new file mode 100644
index 000000000..7efa5c07f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/__init__.py
@@ -0,0 +1,213 @@
+"""
+========================
+Random Number Generation
+========================
+
+Use ``default_rng()`` to create a `Generator` and call its methods.
+
+=============== =========================================================
+Generator
+--------------- ---------------------------------------------------------
+Generator       Class implementing all of the random number distributions
+default_rng     Default constructor for ``Generator``
+=============== =========================================================
+
+============================================= ===
+BitGenerator Streams that work with Generator
+--------------------------------------------- ---
+MT19937
+PCG64
+Philox
+SFC64
+============================================= ===
+
+============================================= ===
+Getting entropy to initialize a BitGenerator
+--------------------------------------------- ---
+SeedSequence
+============================================= ===
+
+
+Legacy
+------
+
+For backwards compatibility with previous versions of numpy before 1.17, the
+various aliases to the global `RandomState` methods are left alone and do not
+use the new `Generator` API.
+
+==================== =========================================================
+Utility functions
+-------------------- ---------------------------------------------------------
+random               Uniformly distributed floats over ``[0, 1)``
+bytes                Uniformly distributed random bytes.
+permutation          Randomly permute a sequence / generate a random sequence.
+shuffle              Randomly permute a sequence in place.
+choice               Random sample from 1-D array.
+==================== =========================================================
+
+==================== =========================================================
+Compatibility
+functions - removed
+in the new API
+-------------------- ---------------------------------------------------------
+rand                 Uniformly distributed values.
+randn                Normally distributed values.
+ranf                 Uniformly distributed floating point numbers.
+random_integers      Uniformly distributed integers in a given range.
+                     (deprecated, use ``integers(..., closed=True)`` instead)
+random_sample        Alias for `random_sample`
+randint              Uniformly distributed integers in a given range
+seed                 Seed the legacy random number generator.
+==================== =========================================================
+
+==================== =========================================================
+Univariate
+distributions
+-------------------- ---------------------------------------------------------
+beta                 Beta distribution over ``[0, 1]``.
+binomial             Binomial distribution.
+chisquare            :math:`\\chi^2` distribution.
+exponential          Exponential distribution.
+f                    F (Fisher-Snedecor) distribution.
+gamma                Gamma distribution.
+geometric            Geometric distribution.
+gumbel               Gumbel distribution.
+hypergeometric       Hypergeometric distribution.
+laplace              Laplace distribution.
+logistic             Logistic distribution.
+lognormal            Log-normal distribution.
+logseries            Logarithmic series distribution.
+negative_binomial    Negative binomial distribution.
+noncentral_chisquare Non-central chi-square distribution.
+noncentral_f         Non-central F distribution.
+normal               Normal / Gaussian distribution.
+pareto               Pareto distribution.
+poisson              Poisson distribution.
+power                Power distribution.
+rayleigh             Rayleigh distribution.
+triangular           Triangular distribution.
+uniform              Uniform distribution.
+vonmises             Von Mises circular distribution.
+wald                 Wald (inverse Gaussian) distribution.
+weibull              Weibull distribution.
+zipf                 Zipf's distribution over ranked data.
+==================== =========================================================
+
+==================== ==========================================================
+Multivariate
+distributions
+-------------------- ----------------------------------------------------------
+dirichlet            Multivariate generalization of Beta distribution.
+multinomial          Multivariate generalization of the binomial distribution.
+multivariate_normal  Multivariate generalization of the normal distribution.
+==================== ==========================================================
+
+==================== =========================================================
+Standard
+distributions
+-------------------- ---------------------------------------------------------
+standard_cauchy      Standard Cauchy-Lorentz distribution.
+standard_exponential Standard exponential distribution.
+standard_gamma       Standard Gamma distribution.
+standard_normal      Standard normal distribution.
+standard_t           Standard Student's t-distribution.
+==================== =========================================================
+
+==================== =========================================================
+Internal functions
+-------------------- ---------------------------------------------------------
+get_state            Get tuple representing internal state of generator.
+set_state            Set state of generator.
+==================== =========================================================
+
+
+"""
+__all__ = [
+    'beta',
+    'binomial',
+    'bytes',
+    'chisquare',
+    'choice',
+    'dirichlet',
+    'exponential',
+    'f',
+    'gamma',
+    'geometric',
+    'get_state',
+    'gumbel',
+    'hypergeometric',
+    'laplace',
+    'logistic',
+    'lognormal',
+    'logseries',
+    'multinomial',
+    'multivariate_normal',
+    'negative_binomial',
+    'noncentral_chisquare',
+    'noncentral_f',
+    'normal',
+    'pareto',
+    'permutation',
+    'poisson',
+    'power',
+    'rand',
+    'randint',
+    'randn',
+    'random',
+    'random_integers',
+    'random_sample',
+    'ranf',
+    'rayleigh',
+    'sample',
+    'seed',
+    'set_state',
+    'shuffle',
+    'standard_cauchy',
+    'standard_exponential',
+    'standard_gamma',
+    'standard_normal',
+    'standard_t',
+    'triangular',
+    'uniform',
+    'vonmises',
+    'wald',
+    'weibull',
+    'zipf',
+]
+
+# add these for module-freeze analysis (like PyInstaller)
+from . import _pickle
+from . import _common
+from . import _bounded_integers
+
+from ._generator import Generator, default_rng
+from .bit_generator import SeedSequence, BitGenerator
+from ._mt19937 import MT19937
+from ._pcg64 import PCG64
+from ._philox import Philox
+from ._sfc64 import SFC64
+from .mtrand import *
+
+__all__ += ['Generator', 'RandomState', 'SeedSequence', 'MT19937',
+            'Philox', 'PCG64', 'SFC64', 'default_rng', 'BitGenerator']
+
+
+def __RandomState_ctor():
+    """Return a RandomState instance.
+
+    This function exists solely to assist (un)pickling.
+
+    Note that the state of the RandomState returned here is irrelevant, as this
+    function's entire purpose is to return a newly allocated RandomState whose
+    state pickle can set.  Consequently the RandomState returned by this function
+    is a freshly allocated copy with a seed=0.
+
+    See https://github.com/numpy/numpy/issues/4763 for a detailed discussion
+
+    """
+    return RandomState(seed=0)
+
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/random/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..97516921f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/__pycache__/_pickle.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/__pycache__/_pickle.cpython-36.pyc
new file mode 100644
index 000000000..bd85187b3
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/__pycache__/_pickle.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..234a9823e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_bounded_integers.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_bounded_integers.cp36-win32.pyd
new file mode 100644
index 000000000..90d3a758b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_bounded_integers.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_bounded_integers.pxd b/venv/Lib/site-packages/numpy/random/_bounded_integers.pxd
new file mode 100644
index 000000000..7e41463a9
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_bounded_integers.pxd
@@ -0,0 +1,29 @@
+from libc.stdint cimport (uint8_t, uint16_t, uint32_t, uint64_t,
+                          int8_t, int16_t, int32_t, int64_t, intptr_t)
+import numpy as np
+cimport numpy as np
+ctypedef np.npy_bool bool_t
+
+from numpy.random cimport bitgen_t
+
+cdef inline uint64_t _gen_mask(uint64_t max_val) nogil:
+    """Mask generator for use in bounded random numbers"""
+    # Smallest bit mask >= max
+    cdef uint64_t mask = max_val
+    mask |= mask >> 1
+    mask |= mask >> 2
+    mask |= mask >> 4
+    mask |= mask >> 8
+    mask |= mask >> 16
+    mask |= mask >> 32
+    return mask
+
+cdef object _rand_uint64(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_uint32(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_uint16(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_uint8(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_bool(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_int64(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_int32(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_int16(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
+cdef object _rand_int8(object low, object high, object size, bint use_masked, bint closed, bitgen_t *state, object lock)
diff --git a/venv/Lib/site-packages/numpy/random/_common.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_common.cp36-win32.pyd
new file mode 100644
index 000000000..393eea8d2
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_common.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_common.pxd b/venv/Lib/site-packages/numpy/random/_common.pxd
new file mode 100644
index 000000000..4f404b7a1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_common.pxd
@@ -0,0 +1,106 @@
+#cython: language_level=3
+
+from libc.stdint cimport uint32_t, uint64_t, int32_t, int64_t
+
+import numpy as np
+cimport numpy as np
+
+from numpy.random cimport bitgen_t
+
+cdef double POISSON_LAM_MAX
+cdef double LEGACY_POISSON_LAM_MAX
+cdef uint64_t MAXSIZE
+
+cdef enum ConstraintType:
+    CONS_NONE
+    CONS_NON_NEGATIVE
+    CONS_POSITIVE
+    CONS_POSITIVE_NOT_NAN
+    CONS_BOUNDED_0_1
+    CONS_BOUNDED_0_1_NOTNAN
+    CONS_BOUNDED_GT_0_1
+    CONS_GT_1
+    CONS_GTE_1
+    CONS_POISSON
+    LEGACY_CONS_POISSON
+
+ctypedef ConstraintType constraint_type
+
+cdef object benchmark(bitgen_t *bitgen, object lock, Py_ssize_t cnt, object method)
+cdef object random_raw(bitgen_t *bitgen, object lock, object size, object output)
+cdef object prepare_cffi(bitgen_t *bitgen)
+cdef object prepare_ctypes(bitgen_t *bitgen)
+cdef int check_constraint(double val, object name, constraint_type cons) except -1
+cdef int check_array_constraint(np.ndarray val, object name, constraint_type cons) except -1
+
+cdef extern from "include/aligned_malloc.h":
+    cdef void *PyArray_realloc_aligned(void *p, size_t n)
+    cdef void *PyArray_malloc_aligned(size_t n)
+    cdef void *PyArray_calloc_aligned(size_t n, size_t s)
+    cdef void PyArray_free_aligned(void *p)
+
+ctypedef double (*random_double_fill)(bitgen_t *state, np.npy_intp count, double* out) nogil
+ctypedef double (*random_double_0)(void *state) nogil
+ctypedef double (*random_double_1)(void *state, double a) nogil
+ctypedef double (*random_double_2)(void *state, double a, double b) nogil
+ctypedef double (*random_double_3)(void *state, double a, double b, double c) nogil
+
+ctypedef double (*random_float_fill)(bitgen_t *state, np.npy_intp count, float* out) nogil
+ctypedef float (*random_float_0)(bitgen_t *state) nogil
+ctypedef float (*random_float_1)(bitgen_t *state, float a) nogil
+
+ctypedef int64_t (*random_uint_0)(void *state) nogil
+ctypedef int64_t (*random_uint_d)(void *state, double a) nogil
+ctypedef int64_t (*random_uint_dd)(void *state, double a, double b) nogil
+ctypedef int64_t (*random_uint_di)(void *state, double a, uint64_t b) nogil
+ctypedef int64_t (*random_uint_i)(void *state, int64_t a) nogil
+ctypedef int64_t (*random_uint_iii)(void *state, int64_t a, int64_t b, int64_t c) nogil
+
+ctypedef uint32_t (*random_uint_0_32)(bitgen_t *state) nogil
+ctypedef uint32_t (*random_uint_1_i_32)(bitgen_t *state, uint32_t a) nogil
+
+ctypedef int32_t (*random_int_2_i_32)(bitgen_t *state, int32_t a, int32_t b) nogil
+ctypedef int64_t (*random_int_2_i)(bitgen_t *state, int64_t a, int64_t b) nogil
+
+cdef double kahan_sum(double *darr, np.npy_intp n)
+
+cdef inline double uint64_to_double(uint64_t rnd) nogil:
+    return (rnd >> 11) * (1.0 / 9007199254740992.0)
+
+cdef object double_fill(void *func, bitgen_t *state, object size, object lock, object out)
+
+cdef object float_fill(void *func, bitgen_t *state, object size, object lock, object out)
+
+cdef object float_fill_from_double(void *func, bitgen_t *state, object size, object lock, object out)
+
+cdef object wrap_int(object val, object bits)
+
+cdef np.ndarray int_to_array(object value, object name, object bits, object uint_size)
+
+cdef validate_output_shape(iter_shape, np.ndarray output)
+
+cdef object cont(void *func, void *state, object size, object lock, int narg,
+                 object a, object a_name, constraint_type a_constraint,
+                 object b, object b_name, constraint_type b_constraint,
+                 object c, object c_name, constraint_type c_constraint,
+                 object out)
+
+cdef object disc(void *func, void *state, object size, object lock,
+                 int narg_double, int narg_int64,
+                 object a, object a_name, constraint_type a_constraint,
+                 object b, object b_name, constraint_type b_constraint,
+                 object c, object c_name, constraint_type c_constraint)
+
+cdef object cont_f(void *func, bitgen_t *state, object size, object lock,
+                   object a, object a_name, constraint_type a_constraint,
+                   object out)
+
+cdef object cont_broadcast_3(void *func, void *state, object size, object lock,
+                             np.ndarray a_arr, object a_name, constraint_type a_constraint,
+                             np.ndarray b_arr, object b_name, constraint_type b_constraint,
+                             np.ndarray c_arr, object c_name, constraint_type c_constraint)
+
+cdef object discrete_broadcast_iii(void *func, void *state, object size, object lock,
+                                   np.ndarray a_arr, object a_name, constraint_type a_constraint,
+                                   np.ndarray b_arr, object b_name, constraint_type b_constraint,
+                                   np.ndarray c_arr, object c_name, constraint_type c_constraint)
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/extending.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/extending.cpython-36.pyc
new file mode 100644
index 000000000..1a78a9502
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/extending.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/parse.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/parse.cpython-36.pyc
new file mode 100644
index 000000000..ff72e3294
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_examples/cffi/__pycache__/parse.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cffi/extending.py b/venv/Lib/site-packages/numpy/random/_examples/cffi/extending.py
new file mode 100644
index 000000000..8440d400e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/cffi/extending.py
@@ -0,0 +1,40 @@
+"""
+Use cffi to access any of the underlying C functions from distributions.h
+"""
+import os
+import numpy as np
+import cffi
+from .parse import parse_distributions_h
+ffi = cffi.FFI()
+
+inc_dir = os.path.join(np.get_include(), 'numpy')
+
+# Basic numpy types
+ffi.cdef('''
+    typedef intptr_t npy_intp;
+    typedef unsigned char npy_bool;
+
+''')
+
+parse_distributions_h(ffi, inc_dir)
+
+lib = ffi.dlopen(np.random._generator.__file__)
+
+# Compare the distributions.h random_standard_normal_fill to
+# Generator.standard_random
+bit_gen = np.random.PCG64()
+rng = np.random.Generator(bit_gen)
+state = bit_gen.state
+
+interface = rng.bit_generator.cffi
+n = 100
+vals_cffi = ffi.new('double[%d]' % n)
+lib.random_standard_normal_fill(interface.bit_generator, n, vals_cffi)
+
+# reset the state
+bit_gen.state = state
+
+vals = rng.standard_normal(n)
+
+for i in range(n):
+    assert vals[i] == vals_cffi[i]
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cffi/parse.py b/venv/Lib/site-packages/numpy/random/_examples/cffi/parse.py
new file mode 100644
index 000000000..73d8646c7
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/cffi/parse.py
@@ -0,0 +1,46 @@
+import os
+
+
+def parse_distributions_h(ffi, inc_dir):
+    """
+    Parse distributions.h located in inc_dir for CFFI, filling in the ffi.cdef
+
+    Read the function declarations without the "#define ..." macros that will
+    be filled in when loading the library.
+    """
+
+    with open(os.path.join(inc_dir, 'random', 'bitgen.h')) as fid:
+        s = []
+        for line in fid:
+            # massage the include file
+            if line.strip().startswith('#'):
+                continue
+            s.append(line)
+        ffi.cdef('\n'.join(s))
+            
+    with open(os.path.join(inc_dir, 'random', 'distributions.h')) as fid:
+        s = []
+        in_skip = 0
+        for line in fid:
+            # massage the include file
+            if line.strip().startswith('#'):
+                continue
+    
+            # skip any inlined function definition
+            # which starts with 'static NPY_INLINE xxx(...) {'
+            # and ends with a closing '}'
+            if line.strip().startswith('static NPY_INLINE'):
+                in_skip += line.count('{')
+                continue
+            elif in_skip > 0:
+                in_skip += line.count('{')
+                in_skip -= line.count('}')
+                continue
+    
+            # replace defines with their value or remove them
+            line = line.replace('DECLDIR', '')
+            line = line.replace('NPY_INLINE', '')
+            line = line.replace('RAND_INT_TYPE', 'int64_t')
+            s.append(line)
+        ffi.cdef('\n'.join(s))
+
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cython/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/_examples/cython/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..07d54d18f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_examples/cython/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cython/extending.pyx b/venv/Lib/site-packages/numpy/random/_examples/cython/extending.pyx
new file mode 100644
index 000000000..3a7f81aa0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/cython/extending.pyx
@@ -0,0 +1,78 @@
+#!/usr/bin/env python3
+#cython: language_level=3
+
+from libc.stdint cimport uint32_t
+from cpython.pycapsule cimport PyCapsule_IsValid, PyCapsule_GetPointer
+
+import numpy as np
+cimport numpy as np
+cimport cython
+
+from numpy.random cimport bitgen_t
+from numpy.random import PCG64
+
+np.import_array()
+
+
+@cython.boundscheck(False)
+@cython.wraparound(False)
+def uniform_mean(Py_ssize_t n):
+    cdef Py_ssize_t i
+    cdef bitgen_t *rng
+    cdef const char *capsule_name = "BitGenerator"
+    cdef double[::1] random_values
+    cdef np.ndarray randoms
+
+    x = PCG64()
+    capsule = x.capsule
+    if not PyCapsule_IsValid(capsule, capsule_name):
+        raise ValueError("Invalid pointer to anon_func_state")
+    rng = <bitgen_t *> PyCapsule_GetPointer(capsule, capsule_name)
+    random_values = np.empty(n)
+    # Best practice is to acquire the lock whenever generating random values.
+    # This prevents other threads from modifying the state. Acquiring the lock
+    # is only necessary if if the GIL is also released, as in this example.
+    with x.lock, nogil:
+        for i in range(n):
+            random_values[i] = rng.next_double(rng.state)
+    randoms = np.asarray(random_values)
+    return randoms.mean()
+
+
+# This function is declared nogil so it can be used without the GIL below
+cdef uint32_t bounded_uint(uint32_t lb, uint32_t ub, bitgen_t *rng) nogil:
+    cdef uint32_t mask, delta, val
+    mask = delta = ub - lb
+    mask |= mask >> 1
+    mask |= mask >> 2
+    mask |= mask >> 4
+    mask |= mask >> 8
+    mask |= mask >> 16
+
+    val = rng.next_uint32(rng.state) & mask
+    while val > delta:
+        val = rng.next_uint32(rng.state) & mask
+
+    return lb + val
+
+
+@cython.boundscheck(False)
+@cython.wraparound(False)
+def bounded_uints(uint32_t lb, uint32_t ub, Py_ssize_t n):
+    cdef Py_ssize_t i
+    cdef bitgen_t *rng
+    cdef uint32_t[::1] out
+    cdef const char *capsule_name = "BitGenerator"
+
+    x = PCG64()
+    out = np.empty(n, dtype=np.uint32)
+    capsule = x.capsule
+
+    if not PyCapsule_IsValid(capsule, capsule_name):
+        raise ValueError("Invalid pointer to anon_func_state")
+    rng = <bitgen_t *>PyCapsule_GetPointer(capsule, capsule_name)
+
+    with x.lock, nogil:
+        for i in range(n):
+            out[i] = bounded_uint(lb, ub, rng)
+    return np.asarray(out)
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cython/extending_distributions.pyx b/venv/Lib/site-packages/numpy/random/_examples/cython/extending_distributions.pyx
new file mode 100644
index 000000000..d908e92d0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/cython/extending_distributions.pyx
@@ -0,0 +1,117 @@
+#!/usr/bin/env python3
+#cython: language_level=3
+"""
+This file shows how the to use a BitGenerator to create a distribution.
+"""
+import numpy as np
+cimport numpy as np
+cimport cython
+from cpython.pycapsule cimport PyCapsule_IsValid, PyCapsule_GetPointer
+from libc.stdint cimport uint16_t, uint64_t
+from numpy.random cimport bitgen_t
+from numpy.random import PCG64
+from numpy.random.c_distributions cimport (
+      random_standard_uniform_fill, random_standard_uniform_fill_f)
+
+
+@cython.boundscheck(False)
+@cython.wraparound(False)
+def uniforms(Py_ssize_t n):
+    """
+    Create an array of `n` uniformly distributed doubles.
+    A 'real' distribution would want to process the values into
+    some non-uniform distribution
+    """
+    cdef Py_ssize_t i
+    cdef bitgen_t *rng
+    cdef const char *capsule_name = "BitGenerator"
+    cdef double[::1] random_values
+
+    x = PCG64()
+    capsule = x.capsule
+    # Optional check that the capsule if from a BitGenerator
+    if not PyCapsule_IsValid(capsule, capsule_name):
+        raise ValueError("Invalid pointer to anon_func_state")
+    # Cast the pointer
+    rng = <bitgen_t *> PyCapsule_GetPointer(capsule, capsule_name)
+    random_values = np.empty(n, dtype='float64')
+    with x.lock, nogil:
+        for i in range(n):
+            # Call the function
+            random_values[i] = rng.next_double(rng.state)
+    randoms = np.asarray(random_values)
+
+    return randoms
+
+# cython example 2
+@cython.boundscheck(False)
+@cython.wraparound(False)
+def uint10_uniforms(Py_ssize_t n):
+    """Uniform 10 bit integers stored as 16-bit unsigned integers"""
+    cdef Py_ssize_t i
+    cdef bitgen_t *rng
+    cdef const char *capsule_name = "BitGenerator"
+    cdef uint16_t[::1] random_values
+    cdef int bits_remaining
+    cdef int width = 10
+    cdef uint64_t buff, mask = 0x3FF
+
+    x = PCG64()
+    capsule = x.capsule
+    if not PyCapsule_IsValid(capsule, capsule_name):
+        raise ValueError("Invalid pointer to anon_func_state")
+    rng = <bitgen_t *> PyCapsule_GetPointer(capsule, capsule_name)
+    random_values = np.empty(n, dtype='uint16')
+    # Best practice is to release GIL and acquire the lock
+    bits_remaining = 0
+    with x.lock, nogil:
+        for i in range(n):
+            if bits_remaining < width:
+                buff = rng.next_uint64(rng.state)
+            random_values[i] = buff & mask
+            buff >>= width
+
+    randoms = np.asarray(random_values)
+    return randoms
+
+# cython example 3
+def uniforms_ex(bit_generator, Py_ssize_t n, dtype=np.float64):
+    """
+    Create an array of `n` uniformly distributed doubles via a "fill" function.
+
+    A 'real' distribution would want to process the values into
+    some non-uniform distribution
+
+    Parameters
+    ----------
+    bit_generator: BitGenerator instance
+    n: int
+        Output vector length
+    dtype: {str, dtype}, optional
+        Desired dtype, either 'd' (or 'float64') or 'f' (or 'float32'). The
+        default dtype value is 'd'
+    """
+    cdef Py_ssize_t i
+    cdef bitgen_t *rng
+    cdef const char *capsule_name = "BitGenerator"
+    cdef np.ndarray randoms
+
+    capsule = bit_generator.capsule
+    # Optional check that the capsule if from a BitGenerator
+    if not PyCapsule_IsValid(capsule, capsule_name):
+        raise ValueError("Invalid pointer to anon_func_state")
+    # Cast the pointer
+    rng = <bitgen_t *> PyCapsule_GetPointer(capsule, capsule_name)
+
+    _dtype = np.dtype(dtype)
+    randoms = np.empty(n, dtype=_dtype)
+    if _dtype == np.float32:
+        with bit_generator.lock:
+            random_standard_uniform_fill_f(rng, n, <float*>np.PyArray_DATA(randoms))
+    elif _dtype == np.float64:
+        with bit_generator.lock:
+            random_standard_uniform_fill(rng, n, <double*>np.PyArray_DATA(randoms))
+    else:
+        raise TypeError('Unsupported dtype %r for random' % _dtype)
+    return randoms
+
diff --git a/venv/Lib/site-packages/numpy/random/_examples/cython/setup.py b/venv/Lib/site-packages/numpy/random/_examples/cython/setup.py
new file mode 100644
index 000000000..42425c2c1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/cython/setup.py
@@ -0,0 +1,41 @@
+#!/usr/bin/env python3
+"""
+Build the Cython demonstrations of low-level access to NumPy random
+
+Usage: python setup.py build_ext -i
+"""
+
+import numpy as np
+from distutils.core import setup
+from Cython.Build import cythonize
+from setuptools.extension import Extension
+from os.path import join, dirname
+
+path = dirname(__file__)
+src_dir = join(dirname(path), '..', 'src')
+defs = [('NPY_NO_DEPRECATED_API', 0)]
+inc_path = np.get_include()
+# not so nice. We need the random/lib library from numpy
+lib_path = join(np.get_include(), '..', '..', 'random', 'lib')
+
+extending = Extension("extending",
+                      sources=[join(path, 'extending.pyx')],
+                      include_dirs=[
+                            np.get_include(),
+                            join(path, '..', '..')
+                        ],
+                      define_macros=defs,
+                      )
+distributions = Extension("extending_distributions",
+                          sources=[join(path, 'extending_distributions.pyx')],
+                          include_dirs=[inc_path],
+                          library_dirs=[lib_path],
+                          libraries=['npyrandom'],
+                          define_macros=defs,
+                         )
+
+extensions = [extending, distributions]
+
+setup(
+    ext_modules=cythonize(extensions)
+)
diff --git a/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending.cpython-36.pyc
new file mode 100644
index 000000000..f423c5c09
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending_distributions.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending_distributions.cpython-36.pyc
new file mode 100644
index 000000000..bddc06a0d
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_examples/numba/__pycache__/extending_distributions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/_examples/numba/extending.py b/venv/Lib/site-packages/numpy/random/_examples/numba/extending.py
new file mode 100644
index 000000000..0d240596b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/numba/extending.py
@@ -0,0 +1,84 @@
+import numpy as np
+import numba as nb
+
+from numpy.random import PCG64
+from timeit import timeit
+
+bit_gen = PCG64()
+next_d = bit_gen.cffi.next_double
+state_addr = bit_gen.cffi.state_address
+
+def normals(n, state):
+    out = np.empty(n)
+    for i in range((n + 1) // 2):
+        x1 = 2.0 * next_d(state) - 1.0
+        x2 = 2.0 * next_d(state) - 1.0
+        r2 = x1 * x1 + x2 * x2
+        while r2 >= 1.0 or r2 == 0.0:
+            x1 = 2.0 * next_d(state) - 1.0
+            x2 = 2.0 * next_d(state) - 1.0
+            r2 = x1 * x1 + x2 * x2
+        f = np.sqrt(-2.0 * np.log(r2) / r2)
+        out[2 * i] = f * x1
+        if 2 * i + 1 < n:
+            out[2 * i + 1] = f * x2
+    return out
+
+# Compile using Numba
+normalsj = nb.jit(normals, nopython=True)
+# Must use state address not state with numba
+n = 10000
+
+def numbacall():
+    return normalsj(n, state_addr)
+
+rg = np.random.Generator(PCG64())
+
+def numpycall():
+    return rg.normal(size=n)
+
+# Check that the functions work
+r1 = numbacall()
+r2 = numpycall()
+assert r1.shape == (n,)
+assert r1.shape == r2.shape
+
+t1 = timeit(numbacall, number=1000)
+print('{:.2f} secs for {} PCG64 (Numba/PCG64) gaussian randoms'.format(t1, n))
+t2 = timeit(numpycall, number=1000)
+print('{:.2f} secs for {} PCG64 (NumPy/PCG64) gaussian randoms'.format(t2, n))
+
+# example 2
+
+next_u32 = bit_gen.ctypes.next_uint32
+ctypes_state = bit_gen.ctypes.state
+
+@nb.jit(nopython=True)
+def bounded_uint(lb, ub, state):
+    mask = delta = ub - lb
+    mask |= mask >> 1
+    mask |= mask >> 2
+    mask |= mask >> 4
+    mask |= mask >> 8
+    mask |= mask >> 16
+
+    val = next_u32(state) & mask
+    while val > delta:
+        val = next_u32(state) & mask
+
+    return lb + val
+
+
+print(bounded_uint(323, 2394691, ctypes_state.value))
+
+
+@nb.jit(nopython=True)
+def bounded_uints(lb, ub, n, state):
+    out = np.empty(n, dtype=np.uint32)
+    for i in range(n):
+        out[i] = bounded_uint(lb, ub, state)
+
+
+bounded_uints(323, 2394691, 10000000, ctypes_state.value)
+
+
diff --git a/venv/Lib/site-packages/numpy/random/_examples/numba/extending_distributions.py b/venv/Lib/site-packages/numpy/random/_examples/numba/extending_distributions.py
new file mode 100644
index 000000000..7cf8bf0b0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_examples/numba/extending_distributions.py
@@ -0,0 +1,67 @@
+r"""
+Building the required library in this example requires a source distribution
+of NumPy or clone of the NumPy git repository since distributions.c is not
+included in binary distributions.
+
+On *nix, execute in numpy/random/src/distributions
+
+export ${PYTHON_VERSION}=3.8 # Python version
+export PYTHON_INCLUDE=#path to Python's include folder, usually \
+    ${PYTHON_HOME}/include/python${PYTHON_VERSION}m
+export NUMPY_INCLUDE=#path to numpy's include folder, usually \
+    ${PYTHON_HOME}/lib/python${PYTHON_VERSION}/site-packages/numpy/core/include
+gcc -shared -o libdistributions.so -fPIC distributions.c \
+    -I${NUMPY_INCLUDE} -I${PYTHON_INCLUDE}
+mv libdistributions.so ../../_examples/numba/
+
+On Windows
+
+rem PYTHON_HOME and PYTHON_VERSION are setup dependent, this is an example
+set PYTHON_HOME=c:\Anaconda
+set PYTHON_VERSION=38
+cl.exe /LD .\distributions.c -DDLL_EXPORT \
+    -I%PYTHON_HOME%\lib\site-packages\numpy\core\include \
+    -I%PYTHON_HOME%\include %PYTHON_HOME%\libs\python%PYTHON_VERSION%.lib
+move distributions.dll ../../_examples/numba/
+"""
+import os
+
+import numba as nb
+import numpy as np
+from cffi import FFI
+
+from numpy.random import PCG64
+
+ffi = FFI()
+if os.path.exists('./distributions.dll'):
+    lib = ffi.dlopen('./distributions.dll')
+elif os.path.exists('./libdistributions.so'):
+    lib = ffi.dlopen('./libdistributions.so')
+else:
+    raise RuntimeError('Required DLL/so file was not found.')
+
+ffi.cdef("""
+double random_standard_normal(void *bitgen_state);
+""")
+x = PCG64()
+xffi = x.cffi
+bit_generator = xffi.bit_generator
+
+random_standard_normal = lib.random_standard_normal
+
+
+def normals(n, bit_generator):
+    out = np.empty(n)
+    for i in range(n):
+        out[i] = random_standard_normal(bit_generator)
+    return out
+
+
+normalsj = nb.jit(normals, nopython=True)
+
+# Numba requires a memory address for void *
+# Can also get address from x.ctypes.bit_generator.value
+bit_generator_address = int(ffi.cast('uintptr_t', bit_generator))
+
+norm = normalsj(1000, bit_generator_address)
+print(norm[:12])
diff --git a/venv/Lib/site-packages/numpy/random/_generator.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_generator.cp36-win32.pyd
new file mode 100644
index 000000000..a2c13afda
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_generator.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_mt19937.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_mt19937.cp36-win32.pyd
new file mode 100644
index 000000000..241623dd5
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_mt19937.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_pcg64.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_pcg64.cp36-win32.pyd
new file mode 100644
index 000000000..c56365e9a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_pcg64.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_philox.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_philox.cp36-win32.pyd
new file mode 100644
index 000000000..47da7df71
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_philox.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/_pickle.py b/venv/Lib/site-packages/numpy/random/_pickle.py
new file mode 100644
index 000000000..29ff69644
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/_pickle.py
@@ -0,0 +1,82 @@
+from .mtrand import RandomState
+from ._philox import Philox
+from ._pcg64 import PCG64
+from ._sfc64 import SFC64
+
+from ._generator import Generator
+from ._mt19937 import MT19937
+
+BitGenerators = {'MT19937': MT19937,
+                 'PCG64': PCG64,
+                 'Philox': Philox,
+                 'SFC64': SFC64,
+                 }
+
+
+def __generator_ctor(bit_generator_name='MT19937'):
+    """
+    Pickling helper function that returns a Generator object
+
+    Parameters
+    ----------
+    bit_generator_name: str
+        String containing the core BitGenerator
+
+    Returns
+    -------
+    rg: Generator
+        Generator using the named core BitGenerator
+    """
+    if bit_generator_name in BitGenerators:
+        bit_generator = BitGenerators[bit_generator_name]
+    else:
+        raise ValueError(str(bit_generator_name) + ' is not a known '
+                                                   'BitGenerator module.')
+
+    return Generator(bit_generator())
+
+
+def __bit_generator_ctor(bit_generator_name='MT19937'):
+    """
+    Pickling helper function that returns a bit generator object
+
+    Parameters
+    ----------
+    bit_generator_name: str
+        String containing the name of the BitGenerator
+
+    Returns
+    -------
+    bit_generator: BitGenerator
+        BitGenerator instance
+    """
+    if bit_generator_name in BitGenerators:
+        bit_generator = BitGenerators[bit_generator_name]
+    else:
+        raise ValueError(str(bit_generator_name) + ' is not a known '
+                                                   'BitGenerator module.')
+
+    return bit_generator()
+
+
+def __randomstate_ctor(bit_generator_name='MT19937'):
+    """
+    Pickling helper function that returns a legacy RandomState-like object
+
+    Parameters
+    ----------
+    bit_generator_name: str
+        String containing the core BitGenerator
+
+    Returns
+    -------
+    rs: RandomState
+        Legacy RandomState using the named core BitGenerator
+    """
+    if bit_generator_name in BitGenerators:
+        bit_generator = BitGenerators[bit_generator_name]
+    else:
+        raise ValueError(str(bit_generator_name) + ' is not a known '
+                                                   'BitGenerator module.')
+
+    return RandomState(bit_generator())
diff --git a/venv/Lib/site-packages/numpy/random/_sfc64.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/_sfc64.cp36-win32.pyd
new file mode 100644
index 000000000..9c85cfeca
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/_sfc64.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/bit_generator.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/bit_generator.cp36-win32.pyd
new file mode 100644
index 000000000..244aedf78
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/bit_generator.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/bit_generator.pxd b/venv/Lib/site-packages/numpy/random/bit_generator.pxd
new file mode 100644
index 000000000..bd5e47a20
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/bit_generator.pxd
@@ -0,0 +1,35 @@
+cimport numpy as np
+from libc.stdint cimport uint32_t, uint64_t
+
+cdef extern from "numpy/random/bitgen.h":
+    struct bitgen:
+        void *state
+        uint64_t (*next_uint64)(void *st) nogil
+        uint32_t (*next_uint32)(void *st) nogil
+        double (*next_double)(void *st) nogil
+        uint64_t (*next_raw)(void *st) nogil
+
+    ctypedef bitgen bitgen_t
+
+cdef class BitGenerator():
+    cdef readonly object _seed_seq
+    cdef readonly object lock
+    cdef bitgen_t _bitgen
+    cdef readonly object _ctypes
+    cdef readonly object _cffi
+    cdef readonly object capsule
+
+
+cdef class SeedSequence():
+    cdef readonly object entropy
+    cdef readonly tuple spawn_key
+    cdef readonly uint32_t pool_size
+    cdef readonly object pool
+    cdef readonly uint32_t n_children_spawned
+
+    cdef mix_entropy(self, np.ndarray[np.npy_uint32, ndim=1] mixer,
+                     np.ndarray[np.npy_uint32, ndim=1] entropy_array)
+    cdef get_assembled_entropy(self)
+
+cdef class SeedlessSequence():
+    pass
diff --git a/venv/Lib/site-packages/numpy/random/c_distributions.pxd b/venv/Lib/site-packages/numpy/random/c_distributions.pxd
new file mode 100644
index 000000000..6f905edc1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/c_distributions.pxd
@@ -0,0 +1,114 @@
+#!python
+#cython: wraparound=False, nonecheck=False, boundscheck=False, cdivision=True, language_level=3
+from numpy cimport npy_intp
+
+from libc.stdint cimport (uint64_t, int32_t, int64_t)
+from numpy.random cimport bitgen_t
+
+cdef extern from "numpy/random/distributions.h":
+
+    struct s_binomial_t:
+        int has_binomial
+        double psave
+        int64_t nsave
+        double r
+        double q
+        double fm
+        int64_t m
+        double p1
+        double xm
+        double xl
+        double xr
+        double c
+        double laml
+        double lamr
+        double p2
+        double p3
+        double p4
+
+    ctypedef s_binomial_t binomial_t
+
+    double random_standard_uniform(bitgen_t *bitgen_state) nogil
+    void random_standard_uniform_fill(bitgen_t* bitgen_state, npy_intp cnt, double *out) nogil
+    double random_standard_exponential(bitgen_t *bitgen_state) nogil
+    double random_standard_exponential_f(bitgen_t *bitgen_state) nogil
+    void random_standard_exponential_fill(bitgen_t *bitgen_state, npy_intp cnt, double *out) nogil
+    void random_standard_exponential_fill_f(bitgen_t *bitgen_state, npy_intp cnt, double *out) nogil
+    void random_standard_exponential_inv_fill(bitgen_t *bitgen_state, npy_intp cnt, double *out) nogil
+    void random_standard_exponential_inv_fill_f(bitgen_t *bitgen_state, npy_intp cnt, double *out) nogil
+    double random_standard_normal(bitgen_t* bitgen_state) nogil
+    void random_standard_normal_fill(bitgen_t *bitgen_state, npy_intp count, double *out) nogil
+    void random_standard_normal_fill_f(bitgen_t *bitgen_state, npy_intp count, float *out) nogil
+    double random_standard_gamma(bitgen_t *bitgen_state, double shape) nogil
+
+    float random_standard_uniform_f(bitgen_t *bitgen_state) nogil
+    void random_standard_uniform_fill_f(bitgen_t* bitgen_state, npy_intp cnt, float *out) nogil
+    float random_standard_normal_f(bitgen_t* bitgen_state) nogil
+    float random_standard_gamma_f(bitgen_t *bitgen_state, float shape) nogil
+
+    int64_t random_positive_int64(bitgen_t *bitgen_state) nogil
+    int32_t random_positive_int32(bitgen_t *bitgen_state) nogil
+    int64_t random_positive_int(bitgen_t *bitgen_state) nogil
+    uint64_t random_uint(bitgen_t *bitgen_state) nogil
+
+    double random_normal(bitgen_t *bitgen_state, double loc, double scale) nogil
+
+    double random_gamma(bitgen_t *bitgen_state, double shape, double scale) nogil
+    float random_gamma_f(bitgen_t *bitgen_state, float shape, float scale) nogil
+
+    double random_exponential(bitgen_t *bitgen_state, double scale) nogil
+    double random_uniform(bitgen_t *bitgen_state, double lower, double range) nogil
+    double random_beta(bitgen_t *bitgen_state, double a, double b) nogil
+    double random_chisquare(bitgen_t *bitgen_state, double df) nogil
+    double random_f(bitgen_t *bitgen_state, double dfnum, double dfden) nogil
+    double random_standard_cauchy(bitgen_t *bitgen_state) nogil
+    double random_pareto(bitgen_t *bitgen_state, double a) nogil
+    double random_weibull(bitgen_t *bitgen_state, double a) nogil
+    double random_power(bitgen_t *bitgen_state, double a) nogil
+    double random_laplace(bitgen_t *bitgen_state, double loc, double scale) nogil
+    double random_gumbel(bitgen_t *bitgen_state, double loc, double scale) nogil
+    double random_logistic(bitgen_t *bitgen_state, double loc, double scale) nogil
+    double random_lognormal(bitgen_t *bitgen_state, double mean, double sigma) nogil
+    double random_rayleigh(bitgen_t *bitgen_state, double mode) nogil
+    double random_standard_t(bitgen_t *bitgen_state, double df) nogil
+    double random_noncentral_chisquare(bitgen_t *bitgen_state, double df,
+                                       double nonc) nogil
+    double random_noncentral_f(bitgen_t *bitgen_state, double dfnum,
+                               double dfden, double nonc) nogil
+    double random_wald(bitgen_t *bitgen_state, double mean, double scale) nogil
+    double random_vonmises(bitgen_t *bitgen_state, double mu, double kappa) nogil
+    double random_triangular(bitgen_t *bitgen_state, double left, double mode,
+                             double right) nogil
+
+    int64_t random_poisson(bitgen_t *bitgen_state, double lam) nogil
+    int64_t random_negative_binomial(bitgen_t *bitgen_state, double n, double p) nogil
+    int64_t random_binomial(bitgen_t *bitgen_state, double p, int64_t n, binomial_t *binomial) nogil
+    int64_t random_logseries(bitgen_t *bitgen_state, double p) nogil
+    int64_t random_geometric_search(bitgen_t *bitgen_state, double p) nogil
+    int64_t random_geometric_inversion(bitgen_t *bitgen_state, double p) nogil
+    int64_t random_geometric(bitgen_t *bitgen_state, double p) nogil
+    int64_t random_zipf(bitgen_t *bitgen_state, double a) nogil
+    int64_t random_hypergeometric(bitgen_t *bitgen_state, int64_t good, int64_t bad,
+                                    int64_t sample) nogil
+
+    uint64_t random_interval(bitgen_t *bitgen_state, uint64_t max) nogil
+
+    # Generate random uint64 numbers in closed interval [off, off + rng].
+    uint64_t random_bounded_uint64(bitgen_t *bitgen_state,
+                                   uint64_t off, uint64_t rng,
+                                   uint64_t mask, bint use_masked) nogil
+
+    void random_multinomial(bitgen_t *bitgen_state, int64_t n, int64_t *mnix,
+                            double *pix, npy_intp d, binomial_t *binomial) nogil
+
+    int random_multivariate_hypergeometric_count(bitgen_t *bitgen_state,
+                          int64_t total,
+                          size_t num_colors, int64_t *colors,
+                          int64_t nsample,
+                          size_t num_variates, int64_t *variates) nogil
+    void random_multivariate_hypergeometric_marginals(bitgen_t *bitgen_state,
+                               int64_t total,
+                               size_t num_colors, int64_t *colors,
+                               int64_t nsample,
+                               size_t num_variates, int64_t *variates) nogil
+
diff --git a/venv/Lib/site-packages/numpy/random/lib/npyrandom.lib b/venv/Lib/site-packages/numpy/random/lib/npyrandom.lib
new file mode 100644
index 000000000..19662b536
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/lib/npyrandom.lib differ
diff --git a/venv/Lib/site-packages/numpy/random/mtrand.cp36-win32.pyd b/venv/Lib/site-packages/numpy/random/mtrand.cp36-win32.pyd
new file mode 100644
index 000000000..ded328733
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/mtrand.cp36-win32.pyd differ
diff --git a/venv/Lib/site-packages/numpy/random/setup.py b/venv/Lib/site-packages/numpy/random/setup.py
new file mode 100644
index 000000000..88ddb1268
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/setup.py
@@ -0,0 +1,146 @@
+import os
+import platform
+import sys
+from os.path import join
+
+from numpy.distutils.system_info import platform_bits
+
+is_msvc = (platform.platform().startswith('Windows') and
+           platform.python_compiler().startswith('MS'))
+
+
+def configuration(parent_package='', top_path=None):
+    from numpy.distutils.misc_util import Configuration, get_mathlibs
+    config = Configuration('random', parent_package, top_path)
+
+    def generate_libraries(ext, build_dir):
+        config_cmd = config.get_config_cmd()
+        libs = get_mathlibs()
+        if sys.platform == 'win32':
+            libs.extend(['Advapi32', 'Kernel32'])
+        ext.libraries.extend(libs)
+        return None
+
+    # enable unix large file support on 32 bit systems
+    # (64 bit off_t, lseek -> lseek64 etc.)
+    if sys.platform[:3] == "aix":
+        defs = [('_LARGE_FILES', None)]
+    else:
+        defs = [('_FILE_OFFSET_BITS', '64'),
+                ('_LARGEFILE_SOURCE', '1'),
+                ('_LARGEFILE64_SOURCE', '1')]
+
+    defs.append(('NPY_NO_DEPRECATED_API', 0))
+    config.add_subpackage('tests')
+    config.add_data_dir('tests/data')
+    config.add_data_dir('_examples')
+
+    EXTRA_LINK_ARGS = []
+    EXTRA_LIBRARIES = ['npyrandom']
+    if os.name != 'nt':
+        # Math lib
+        EXTRA_LIBRARIES.append('m')
+    # Some bit generators exclude GCC inlining
+    EXTRA_COMPILE_ARGS = ['-U__GNUC_GNU_INLINE__']
+
+    if is_msvc and platform_bits == 32:
+        # 32-bit windows requires explicit sse2 option
+        EXTRA_COMPILE_ARGS += ['/arch:SSE2']
+    elif not is_msvc:
+        # Some bit generators require c99
+        EXTRA_COMPILE_ARGS += ['-std=c99']
+
+    # Use legacy integer variable sizes
+    LEGACY_DEFS = [('NP_RANDOM_LEGACY', '1')]
+    PCG64_DEFS = []
+    # One can force emulated 128-bit arithmetic if one wants.
+    #PCG64_DEFS += [('PCG_FORCE_EMULATED_128BIT_MATH', '1')]
+    depends = ['__init__.pxd', 'c_distributions.pxd', 'bit_generator.pxd']
+
+    # npyrandom - a library like npymath
+    npyrandom_sources = [
+        'src/distributions/logfactorial.c',
+        'src/distributions/distributions.c',
+        'src/distributions/random_mvhg_count.c',
+        'src/distributions/random_mvhg_marginals.c',
+        'src/distributions/random_hypergeometric.c',
+    ]
+    config.add_installed_library('npyrandom',
+        sources=npyrandom_sources,
+        install_dir='lib',
+        build_info={
+            'include_dirs' : [],  # empty list required for creating npyrandom.h
+            'extra_compiler_args' : (['/GL-'] if is_msvc else []),
+        })
+
+    for gen in ['mt19937']:
+        # gen.pyx, src/gen/gen.c, src/gen/gen-jump.c
+        config.add_extension(f'_{gen}',
+                             sources=[f'_{gen}.c',
+                                      f'src/{gen}/{gen}.c',
+                                      f'src/{gen}/{gen}-jump.c'],
+                             include_dirs=['.', 'src', join('src', gen)],
+                             libraries=EXTRA_LIBRARIES,
+                             extra_compile_args=EXTRA_COMPILE_ARGS,
+                             extra_link_args=EXTRA_LINK_ARGS,
+                             depends=depends + [f'_{gen}.pyx'],
+                             define_macros=defs,
+                             )
+    for gen in ['philox', 'pcg64', 'sfc64']:
+        # gen.pyx, src/gen/gen.c
+        _defs = defs + PCG64_DEFS if gen == 'pcg64' else defs
+        config.add_extension(f'_{gen}',
+                             sources=[f'_{gen}.c',
+                                      f'src/{gen}/{gen}.c'],
+                             include_dirs=['.', 'src', join('src', gen)],
+                             libraries=EXTRA_LIBRARIES,
+                             extra_compile_args=EXTRA_COMPILE_ARGS,
+                             extra_link_args=EXTRA_LINK_ARGS,
+                             depends=depends + [f'_{gen}.pyx',
+                                   'bit_generator.pyx', 'bit_generator.pxd'],
+                             define_macros=_defs,
+                             )
+    for gen in ['_common', 'bit_generator']:
+        # gen.pyx
+        config.add_extension(gen,
+                             sources=[f'{gen}.c'],
+                             libraries=EXTRA_LIBRARIES,
+                             extra_compile_args=EXTRA_COMPILE_ARGS,
+                             extra_link_args=EXTRA_LINK_ARGS,
+                             include_dirs=['.', 'src'],
+                             depends=depends + [f'{gen}.pyx', f'{gen}.pxd',],
+                             define_macros=defs,
+                             )
+        config.add_data_files(f'{gen}.pxd')
+    for gen in ['_generator', '_bounded_integers']:
+        # gen.pyx, src/distributions/distributions.c
+        config.add_extension(gen,
+                             sources=[f'{gen}.c'],
+                             libraries=EXTRA_LIBRARIES,
+                             extra_compile_args=EXTRA_COMPILE_ARGS,
+                             include_dirs=['.', 'src'],
+                             extra_link_args=EXTRA_LINK_ARGS,
+                             depends=depends + [f'{gen}.pyx'],
+                             define_macros=defs,
+                             )
+    config.add_data_files('_bounded_integers.pxd')
+    config.add_extension('mtrand',
+                         sources=['mtrand.c',
+                                  'src/legacy/legacy-distributions.c',
+                                  'src/distributions/distributions.c',
+                                 ],
+                         include_dirs=['.', 'src', 'src/legacy'],
+                         libraries=['m'] if os.name != 'nt' else [],
+                         extra_compile_args=EXTRA_COMPILE_ARGS,
+                         extra_link_args=EXTRA_LINK_ARGS,
+                         depends=depends + ['mtrand.pyx'],
+                         define_macros=defs + LEGACY_DEFS,
+                         )
+    config.add_data_files(*depends)
+    return config
+
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+
+    setup(configuration=configuration)
diff --git a/venv/Lib/site-packages/numpy/random/tests/__init__.py b/venv/Lib/site-packages/numpy/random/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..5a8deb323
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_direct.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_direct.cpython-36.pyc
new file mode 100644
index 000000000..60eab5dea
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_direct.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_extending.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_extending.cpython-36.pyc
new file mode 100644
index 000000000..15a3974cb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_extending.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937.cpython-36.pyc
new file mode 100644
index 000000000..0626b4349
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937_regressions.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937_regressions.cpython-36.pyc
new file mode 100644
index 000000000..2fa02ce2b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_generator_mt19937_regressions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_random.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_random.cpython-36.pyc
new file mode 100644
index 000000000..37f43803c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_random.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate.cpython-36.pyc
new file mode 100644
index 000000000..51e0f0c59
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate_regression.cpython-36.pyc
new file mode 100644
index 000000000..0c366aa3e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_randomstate_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_regression.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_regression.cpython-36.pyc
new file mode 100644
index 000000000..380f6b531
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_regression.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_seed_sequence.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_seed_sequence.cpython-36.pyc
new file mode 100644
index 000000000..465cf3c32
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_seed_sequence.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_smoke.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_smoke.cpython-36.pyc
new file mode 100644
index 000000000..fda76110a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/__pycache__/test_smoke.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/__init__.py b/venv/Lib/site-packages/numpy/random/tests/data/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/random/tests/data/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..a714a492a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/random/tests/data/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-1.csv b/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-1.csv
new file mode 100644
index 000000000..b97bfa66f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-1.csv
@@ -0,0 +1,1001 @@
+seed, 0xdeadbeaf
+0, 0xc816921f
+1, 0xb3623c6d
+2, 0x5fa391bb
+3, 0x40178d9
+4, 0x7dcc9811
+5, 0x548eb8e6
+6, 0x92ba3125
+7, 0x65fde68d
+8, 0x2f81ec95
+9, 0xbd94f7a2
+10, 0xdc4d9bcc
+11, 0xa672bf13
+12, 0xb41113e
+13, 0xec7e0066
+14, 0x50239372
+15, 0xd9d66b1d
+16, 0xab72a161
+17, 0xddc2e29f
+18, 0x7ea29ab4
+19, 0x80d141ba
+20, 0xb1c7edf1
+21, 0x44d29203
+22, 0xe224d98
+23, 0x5b3e9d26
+24, 0x14fd567c
+25, 0x27d98c96
+26, 0x838779fc
+27, 0x92a138a
+28, 0x5d08965b
+29, 0x531e0ad6
+30, 0x984ee8f4
+31, 0x1ed78539
+32, 0x32bd6d8d
+33, 0xc37c8516
+34, 0x9aef5c6b
+35, 0x3aacd139
+36, 0xd96ed154
+37, 0x489cd1ed
+38, 0x2cba4b3b
+39, 0x76c6ae72
+40, 0x2dae02b9
+41, 0x52ac5fd6
+42, 0xc2b5e265
+43, 0x630e6a28
+44, 0x3f560d5d
+45, 0x9315bdf3
+46, 0xf1055aba
+47, 0x840e42c6
+48, 0xf2099c6b
+49, 0x15ff7696
+50, 0x7948d146
+51, 0x97342961
+52, 0x7a7a21c
+53, 0xc66f4fb1
+54, 0x23c4103e
+55, 0xd7321f98
+56, 0xeb7efb75
+57, 0xe02490b5
+58, 0x2aa02de
+59, 0x8bee0bf7
+60, 0xfc2da059
+61, 0xae835034
+62, 0x678f2075
+63, 0x6d03094b
+64, 0x56455e05
+65, 0x18b32373
+66, 0x8ff0356b
+67, 0x1fe442fb
+68, 0x3f1ab6c3
+69, 0xb6fd21b
+70, 0xfc310eb2
+71, 0xb19e9a4d
+72, 0x17ddee72
+73, 0xfd534251
+74, 0x9e500564
+75, 0x9013a036
+76, 0xcf08f118
+77, 0x6b6d5969
+78, 0x3ccf1977
+79, 0x7cc11497
+80, 0x651c6ac9
+81, 0x4d6b104b
+82, 0x9a28314e
+83, 0x14c237be
+84, 0x9cfc8d52
+85, 0x2947fad5
+86, 0xd71eff49
+87, 0x5188730e
+88, 0x4b894614
+89, 0xf4fa2a34
+90, 0x42f7cc69
+91, 0x4089c9e8
+92, 0xbf0bbfe4
+93, 0x3cea65c
+94, 0xc6221207
+95, 0x1bb71a8f
+96, 0x54843fe7
+97, 0xbc59de4c
+98, 0x79c6ee64
+99, 0x14e57a26
+100, 0x68d88fe
+101, 0x2b86ef64
+102, 0x8ffff3c1
+103, 0x5bdd573f
+104, 0x85671813
+105, 0xefe32ca2
+106, 0x105ded1e
+107, 0x90ca2769
+108, 0xb33963ac
+109, 0x363fbbc3
+110, 0x3b3763ae
+111, 0x1d50ab88
+112, 0xc9ec01eb
+113, 0xc8bbeada
+114, 0x5d704692
+115, 0x5fd9e40
+116, 0xe61c125
+117, 0x2fe05792
+118, 0xda8afb72
+119, 0x4cbaa653
+120, 0xdd2243df
+121, 0x896fd3f5
+122, 0x5bc23db
+123, 0xa1c4e807
+124, 0x57d1a24d
+125, 0x66503ddc
+126, 0xcf7c0838
+127, 0x19e034fc
+128, 0x66807450
+129, 0xfc219b3b
+130, 0xe8a843e7
+131, 0x9ce61f08
+132, 0x92b950d6
+133, 0xce955ec4
+134, 0xda0d1f0d
+135, 0x960c6250
+136, 0x39552432
+137, 0xde845e84
+138, 0xff3b4b11
+139, 0x5d918e6f
+140, 0xbb930df2
+141, 0x7cfb0993
+142, 0x5400e1e9
+143, 0x3bfa0954
+144, 0x7e2605fb
+145, 0x11941591
+146, 0x887e6994
+147, 0xdc8bed45
+148, 0x45b3fb50
+149, 0xfbdf8358
+150, 0x41507468
+151, 0x34c87166
+152, 0x17f64d77
+153, 0x3bbaf4f8
+154, 0x4f26f37e
+155, 0x4a56ebf2
+156, 0x81100f1
+157, 0x96d94eae
+158, 0xca88fda5
+159, 0x2eef3a60
+160, 0x952afbd3
+161, 0x2bec88c7
+162, 0x52335c4b
+163, 0x8296db8e
+164, 0x4da7d00a
+165, 0xc00ac899
+166, 0xadff8c72
+167, 0xbecf26cf
+168, 0x8835c83c
+169, 0x1d13c804
+170, 0xaa940ddc
+171, 0x68222cfe
+172, 0x4569c0e1
+173, 0x29077976
+174, 0x32d4a5af
+175, 0xd31fcdef
+176, 0xdc60682b
+177, 0x7c95c368
+178, 0x75a70213
+179, 0x43021751
+180, 0x5e52e0a6
+181, 0xf7e190b5
+182, 0xee3e4bb
+183, 0x2fe3b150
+184, 0xcf419c07
+185, 0x478a4570
+186, 0xe5c3ea50
+187, 0x417f30a8
+188, 0xf0cfdaa0
+189, 0xd1f7f738
+190, 0x2c70fc23
+191, 0x54fc89f9
+192, 0x444dcf01
+193, 0xec2a002d
+194, 0xef0c3a88
+195, 0xde21be9
+196, 0x88ab3296
+197, 0x3028897c
+198, 0x264b200b
+199, 0xd8ae0706
+200, 0x9eef901a
+201, 0xbd1b96e0
+202, 0xea71366c
+203, 0x1465b694
+204, 0x5a794650
+205, 0x83df52d4
+206, 0x8262413d
+207, 0x5bc148c0
+208, 0xe0ecd80c
+209, 0x40649571
+210, 0xb4d2ee5f
+211, 0xedfd7d09
+212, 0xa082e25f
+213, 0xc62992d1
+214, 0xbc7e65ee
+215, 0x5499cf8a
+216, 0xac28f775
+217, 0x649840fb
+218, 0xd4c54805
+219, 0x1d166ba6
+220, 0xbeb1171f
+221, 0x45b66703
+222, 0x78c03349
+223, 0x38d2a6ff
+224, 0x935cae8b
+225, 0x1d07dc3f
+226, 0x6c1ed365
+227, 0x579fc585
+228, 0x1320c0ec
+229, 0x632757eb
+230, 0xd265a397
+231, 0x70e9b6c2
+232, 0xc81e322c
+233, 0xa27153cf
+234, 0x2118ba19
+235, 0x514ec400
+236, 0x2bd0ecd6
+237, 0xc3e7dae3
+238, 0xfa39355e
+239, 0x48f23cc1
+240, 0xbcf75948
+241, 0x53ccc70c
+242, 0x75346423
+243, 0x951181e0
+244, 0x348e90df
+245, 0x14365d7f
+246, 0xfbc95d7a
+247, 0xdc98a9e6
+248, 0xed202df7
+249, 0xa59ec913
+250, 0x6b6e9ae2
+251, 0x1697f265
+252, 0x15d322d0
+253, 0xa2e7ee0a
+254, 0x88860b7e
+255, 0x455d8b9d
+256, 0x2f5c59cb
+257, 0xac49c9f1
+258, 0xa6a6a039
+259, 0xc057f56b
+260, 0xf1ff1208
+261, 0x5eb8dc9d
+262, 0xe6702509
+263, 0xe238b0ed
+264, 0x5ae32e3d
+265, 0xa88ebbdf
+266, 0xef885ae7
+267, 0xafa6d49b
+268, 0xc94499e0
+269, 0x1a196325
+270, 0x88938da3
+271, 0x14f4345
+272, 0xd8e33637
+273, 0xa3551bd5
+274, 0x73fe35c7
+275, 0x9561e94b
+276, 0xd673bf68
+277, 0x16134872
+278, 0x68c42f9f
+279, 0xdf7574c8
+280, 0x8809bab9
+281, 0x1432cf69
+282, 0xafb66bf1
+283, 0xc184aa7b
+284, 0xedbf2007
+285, 0xbd420ce1
+286, 0x761033a0
+287, 0xff7e351f
+288, 0xd6c3780e
+289, 0x5844416f
+290, 0xc6c0ee1c
+291, 0xd2e147db
+292, 0x92ac601a
+293, 0x393e846b
+294, 0x18196cca
+295, 0x54a22be
+296, 0x32bab1c4
+297, 0x60365183
+298, 0x64fa342
+299, 0xca24a493
+300, 0xd8cc8b83
+301, 0x3faf102b
+302, 0x6e09bb58
+303, 0x812f0ea
+304, 0x592c95d8
+305, 0xe45ea4c5
+306, 0x23aebf83
+307, 0xbd9691d4
+308, 0xf47b4baa
+309, 0x4ac7b487
+310, 0xcce18803
+311, 0x3377556e
+312, 0x3ff8e6b6
+313, 0x99d22063
+314, 0x23250bec
+315, 0x4e1f9861
+316, 0x8554249b
+317, 0x8635c2fc
+318, 0xe8426e8a
+319, 0x966c29d8
+320, 0x270b6082
+321, 0x3180a8a1
+322, 0xe7e1668b
+323, 0x7f868dc
+324, 0xcf4c17cf
+325, 0xe31de4d1
+326, 0xc8c8aff4
+327, 0xae8db704
+328, 0x3c928cc2
+329, 0xe12cd48
+330, 0xb33ecd04
+331, 0xb93d7cbe
+332, 0x49c69d6a
+333, 0x7d3bce64
+334, 0x86bc219
+335, 0x8408233b
+336, 0x44dc7479
+337, 0xdf80d538
+338, 0xf3db02c3
+339, 0xbbbd31d7
+340, 0x121281f
+341, 0x7521e9a3
+342, 0x8859675a
+343, 0x75aa6502
+344, 0x430ed15b
+345, 0xecf0a28d
+346, 0x659774fd
+347, 0xd58a2311
+348, 0x512389a9
+349, 0xff65e1ff
+350, 0xb6ddf222
+351, 0xe3458895
+352, 0x8b13cd6e
+353, 0xd4a22870
+354, 0xe604c50c
+355, 0x27f54f26
+356, 0x8f7f422f
+357, 0x9735b4cf
+358, 0x414072b0
+359, 0x76a1c6d5
+360, 0xa2208c06
+361, 0x83cd0f61
+362, 0x6c4f7ead
+363, 0x6553cf76
+364, 0xeffcf44
+365, 0x7f434a3f
+366, 0x9dc364bd
+367, 0x3cdf52ed
+368, 0xad597594
+369, 0x9c3e211b
+370, 0x6c04a33f
+371, 0x885dafa6
+372, 0xbbdaca71
+373, 0x7ae5dd5c
+374, 0x37675644
+375, 0x251853c6
+376, 0x130b086b
+377, 0x143fa54b
+378, 0x54cdc282
+379, 0x9faff5b3
+380, 0x502a5c8b
+381, 0xd9524550
+382, 0xae221aa6
+383, 0x55cf759b
+384, 0x24782da4
+385, 0xd715d815
+386, 0x250ea09a
+387, 0x4e0744ac
+388, 0x11e15814
+389, 0xabe5f9df
+390, 0xc8146350
+391, 0xfba67d9b
+392, 0x2b82e42f
+393, 0xd4ea96fc
+394, 0x5ffc179e
+395, 0x1598bafe
+396, 0x7fb6d662
+397, 0x1a12a0db
+398, 0x450cee4a
+399, 0x85f8e12
+400, 0xce71b594
+401, 0xd4bb1d19
+402, 0x968f379d
+403, 0x54cc1d52
+404, 0x467e6066
+405, 0x7da5f9a9
+406, 0x70977034
+407, 0x49e65c4b
+408, 0xd08570d1
+409, 0x7acdf60b
+410, 0xdffa038b
+411, 0x9ce14e4c
+412, 0x107cbbf8
+413, 0xdd746ca0
+414, 0xc6370a46
+415, 0xe7f83312
+416, 0x373fa9ce
+417, 0xd822a2c6
+418, 0x1d4efea6
+419, 0xc53dcadb
+420, 0x9b4e898f
+421, 0x71daa6bf
+422, 0x7a0bc78b
+423, 0xd7b86f50
+424, 0x1b8b3286
+425, 0xcf9425dd
+426, 0xd5263220
+427, 0x4ea0b647
+428, 0xc767fe64
+429, 0xcfc5e67
+430, 0xcc6a2942
+431, 0xa51eff00
+432, 0x76092e1b
+433, 0xf606e80f
+434, 0x824b5e20
+435, 0xebb55e14
+436, 0x783d96a6
+437, 0x10696512
+438, 0x17ee510a
+439, 0x3ab70a1f
+440, 0xcce6b210
+441, 0x8f72f0fb
+442, 0xf0610b41
+443, 0x83d01fb5
+444, 0x6b3de36
+445, 0xe4c2e84f
+446, 0x9c43bb15
+447, 0xddf2905
+448, 0x7dd63556
+449, 0x3662ca09
+450, 0xfb81f35b
+451, 0xc2c8a72a
+452, 0x8e93c37
+453, 0xa93da2d4
+454, 0xa03af8f1
+455, 0x8d75159a
+456, 0x15f010b0
+457, 0xa296ab06
+458, 0xe55962ba
+459, 0xeae700a9
+460, 0xe388964a
+461, 0x917f2bec
+462, 0x1c203fea
+463, 0x792a01ba
+464, 0xa93a80ac
+465, 0x9eb8a197
+466, 0x56c0bc73
+467, 0xb8f05799
+468, 0xf429a8c8
+469, 0xb92cee42
+470, 0xf8864ec
+471, 0x62f2518a
+472, 0x3a7bfa3e
+473, 0x12e56e6d
+474, 0xd7a18313
+475, 0x41fa3899
+476, 0xa09c4956
+477, 0xebcfd94a
+478, 0xc485f90b
+479, 0x4391ce40
+480, 0x742a3333
+481, 0xc932f9e5
+482, 0x75c6c263
+483, 0x80937f0
+484, 0xcf21833c
+485, 0x16027520
+486, 0xd42e669f
+487, 0xb0f01fb7
+488, 0xb35896f1
+489, 0x763737a9
+490, 0x1bb20209
+491, 0x3551f189
+492, 0x56bc2602
+493, 0xb6eacf4
+494, 0x42ec4d11
+495, 0x245cc68
+496, 0xc27ac43b
+497, 0x9d903466
+498, 0xce3f0c05
+499, 0xb708c31c
+500, 0xc0fd37eb
+501, 0x95938b2c
+502, 0xf20175a7
+503, 0x4a86ee9b
+504, 0xbe039a58
+505, 0xd41cabe7
+506, 0x83bc99ba
+507, 0x761d60e1
+508, 0x7737cc2e
+509, 0x2b82fc4b
+510, 0x375aa401
+511, 0xfe9597a0
+512, 0x5543806a
+513, 0x44f31238
+514, 0x7df31538
+515, 0x74cfa770
+516, 0x8755d881
+517, 0x1fde665a
+518, 0xda8bf315
+519, 0x973d8e95
+520, 0x72205228
+521, 0x8fe59717
+522, 0x7bb90b34
+523, 0xef6ed945
+524, 0x16fd4a38
+525, 0x5db44de1
+526, 0xf09f93b3
+527, 0xe84824cc
+528, 0x945bb50e
+529, 0xd0be4aa5
+530, 0x47c277c2
+531, 0xd3800c28
+532, 0xac1c33ec
+533, 0xd3dacce
+534, 0x811c8387
+535, 0x6761b36
+536, 0x70d3882f
+537, 0xd6e62e3a
+538, 0xea25daa2
+539, 0xb07f39d1
+540, 0x391d89d7
+541, 0x84b6fb5e
+542, 0x3dda3fca
+543, 0x229e80a4
+544, 0x3d94a4b7
+545, 0x5d3d576a
+546, 0xad7818a0
+547, 0xce23b03a
+548, 0x7aa2079c
+549, 0x9a6be555
+550, 0x83f3b34a
+551, 0x1848f9d9
+552, 0xd8fefc1c
+553, 0x48e6ce48
+554, 0x52e55750
+555, 0xf41a71cf
+556, 0xba08e259
+557, 0xfaf06a15
+558, 0xeaaac0fb
+559, 0x34f90098
+560, 0xb1dfffbb
+561, 0x718daec2
+562, 0xab4dda21
+563, 0xd27cc1ee
+564, 0x4aafbc4c
+565, 0x356dfb4f
+566, 0x83fcdfd6
+567, 0x8f0bcde0
+568, 0x4363f844
+569, 0xadc0f4d5
+570, 0x3bde994e
+571, 0x3884d452
+572, 0x21876b4a
+573, 0x9c985398
+574, 0xca55a226
+575, 0x3a88c583
+576, 0x916dc33c
+577, 0x8f67d1d7
+578, 0x3b26a667
+579, 0xe4ddeb4b
+580, 0x1a9d8c33
+581, 0x81c9b74f
+582, 0x9ed1e9df
+583, 0x6e61aecf
+584, 0x95e95a5d
+585, 0x68864ff5
+586, 0xb8fa5b9
+587, 0x72b1b3de
+588, 0x5e18a86b
+589, 0xd7f2337d
+590, 0xd70e0925
+591, 0xb573a4c1
+592, 0xc77b3f8a
+593, 0x389b20de
+594, 0x16cf6afb
+595, 0xa39bd275
+596, 0xf491cf01
+597, 0x6f88a802
+598, 0x8510af05
+599, 0xe7cd549a
+600, 0x8603179a
+601, 0xef43f191
+602, 0xf9b64c60
+603, 0xb00254a7
+604, 0xd7c06a2d
+605, 0x17e9380b
+606, 0x529e727b
+607, 0xaaa8fe0a
+608, 0xfb64ff4c
+609, 0xcd75af26
+610, 0xfb717c87
+611, 0xa0789899
+612, 0x10391ec9
+613, 0x7e9b40b3
+614, 0x18536554
+615, 0x728c05f7
+616, 0x787dca98
+617, 0xad948d1
+618, 0x44c18def
+619, 0x3303f2ec
+620, 0xa15acb5
+621, 0xb58d38f4
+622, 0xfe041ef8
+623, 0xd151a956
+624, 0x7b9168e8
+625, 0x5ebeca06
+626, 0x90fe95df
+627, 0xf76875aa
+628, 0xb2e0d664
+629, 0x2e3253b7
+630, 0x68e34469
+631, 0x1f0c2d89
+632, 0x13a34ac2
+633, 0x5ffeb841
+634, 0xe381e91c
+635, 0xb8549a92
+636, 0x3f35cf1
+637, 0xda0f9dcb
+638, 0xdd9828a6
+639, 0xe1428f29
+640, 0xf4db80b5
+641, 0xdac30af5
+642, 0x1af1dd17
+643, 0x9a540254
+644, 0xcab68a38
+645, 0x33560361
+646, 0x2fbf3886
+647, 0xbc785923
+648, 0xe081cd10
+649, 0x8e473356
+650, 0xd102c357
+651, 0xeea4fe48
+652, 0x248d3453
+653, 0x1da79ac
+654, 0x815a65ff
+655, 0x27693e76
+656, 0xb7d5af40
+657, 0x6d245d30
+658, 0x9e06fa8f
+659, 0xb0570dcb
+660, 0x469f0005
+661, 0x3e0ca132
+662, 0xd89bbf3
+663, 0xd61ccd47
+664, 0x6383878
+665, 0x62b5956
+666, 0x4dc83675
+667, 0x93fd8492
+668, 0x5a0091f5
+669, 0xc9f9bc3
+670, 0xa26e7778
+671, 0xeabf2d01
+672, 0xe612dc06
+673, 0x85d89ff9
+674, 0xd1763179
+675, 0xcb88947b
+676, 0x9e8757a5
+677, 0xe100e85c
+678, 0x904166eb
+679, 0x4996243d
+680, 0x4038e1cb
+681, 0x2be2c63d
+682, 0x77017e81
+683, 0x3b1f556b
+684, 0x1c785c77
+685, 0x6869b8bd
+686, 0xe1217ed4
+687, 0x4012ab2f
+688, 0xc06c0d8e
+689, 0x2122eb68
+690, 0xad1783fd
+691, 0x5f0c80e3
+692, 0x828f7efa
+693, 0x29328399
+694, 0xeadf1087
+695, 0x85dc0037
+696, 0x9691ef26
+697, 0xc0947a53
+698, 0x2a178d2a
+699, 0x2a2c7e8f
+700, 0x90378380
+701, 0xaad8d326
+702, 0x9cf1c3c8
+703, 0x84eccd44
+704, 0x79e61808
+705, 0x8b3f454e
+706, 0x209e6e1
+707, 0x51f88378
+708, 0xc210226f
+709, 0xd982adb5
+710, 0x55d44a31
+711, 0x9817d443
+712, 0xa328c626
+713, 0x13455966
+714, 0xb8f681d3
+715, 0x2a3c713b
+716, 0xc186959b
+717, 0x814a74b0
+718, 0xed7bc90
+719, 0xa88d3d6d
+720, 0x88a9f561
+721, 0x73aa1c0a
+722, 0xdfeff404
+723, 0xec037e4b
+724, 0xa5c209f0
+725, 0xb3a223b4
+726, 0x24ce3709
+727, 0x3184c790
+728, 0xa1398c62
+729, 0x2f92034e
+730, 0xbb37a79a
+731, 0x605287b4
+732, 0x8faa772c
+733, 0x6ce56c1d
+734, 0xc035fb4c
+735, 0x7cf5b316
+736, 0x6502645
+737, 0xa283d810
+738, 0x778bc2f1
+739, 0xfdf99313
+740, 0x1f513265
+741, 0xbd3837e2
+742, 0x9b84a9a
+743, 0x2139ce91
+744, 0x61a8e890
+745, 0xf9ff12db
+746, 0xb43d2ea7
+747, 0x88532e61
+748, 0x175a6655
+749, 0x7a6c4f72
+750, 0x6dafc1b7
+751, 0x449b1459
+752, 0x514f654f
+753, 0x9a6731e2
+754, 0x8632da43
+755, 0xc81b0422
+756, 0x81fe9005
+757, 0x15b79618
+758, 0xb5fa629f
+759, 0x987a474f
+760, 0x1c74f54e
+761, 0xf9743232
+762, 0xec4b55f
+763, 0x87d761e5
+764, 0xd1ad78b7
+765, 0x453d9350
+766, 0xc7a7d85
+767, 0xb2576ff5
+768, 0xcdde49b7
+769, 0x8e1f763e
+770, 0x1338583e
+771, 0xfd65b9dc
+772, 0x4f19c4f4
+773, 0x3a52d73d
+774, 0xd3509c4c
+775, 0xda24fe31
+776, 0xe2de56ba
+777, 0x2db5e540
+778, 0x23172734
+779, 0x4db572f
+780, 0xeb941718
+781, 0x84c2649a
+782, 0x3b1e5b6a
+783, 0x4c9c61b9
+784, 0x3bccd11
+785, 0xb4d7b78e
+786, 0x48580ae5
+787, 0xd273ab68
+788, 0x25c11615
+789, 0x470b53f6
+790, 0x329c2068
+791, 0x1693721b
+792, 0xf8c9aacf
+793, 0x4c3d5693
+794, 0xd778284e
+795, 0xae1cb24f
+796, 0x3c11d1b3
+797, 0xddd2b0c0
+798, 0x90269fa7
+799, 0x5666e0a2
+800, 0xf9f195a4
+801, 0x61d78eb2
+802, 0xada5a7c0
+803, 0xaa272fbe
+804, 0xba3bae2f
+805, 0xd0b70fc2
+806, 0x529f32b
+807, 0xda7a3e21
+808, 0x9a776a20
+809, 0xb21f9635
+810, 0xb3acc14e
+811, 0xac55f56
+812, 0x29dccf41
+813, 0x32dabdb3
+814, 0xaa032f58
+815, 0xfa406af4
+816, 0xce3c415d
+817, 0xb44fb4d9
+818, 0x32248d1c
+819, 0x680c6440
+820, 0xae2337b
+821, 0x294cb597
+822, 0x5bca48fe
+823, 0xaef19f40
+824, 0xad60406
+825, 0x4781f090
+826, 0xfd691ffc
+827, 0xb6568268
+828, 0xa56c72cb
+829, 0xf8a9e0fc
+830, 0x9af4fd02
+831, 0x2cd30932
+832, 0x776cefd7
+833, 0xe31f476e
+834, 0x6d94a437
+835, 0xb3cab598
+836, 0xf582d13f
+837, 0x3bf8759d
+838, 0xc3777dc
+839, 0x5e425ea8
+840, 0x1c7ff4ed
+841, 0x1c2e97d1
+842, 0xc062d2b4
+843, 0x46dc80e0
+844, 0xbcdb47e6
+845, 0x32282fe0
+846, 0xaba89063
+847, 0x5e94e9bb
+848, 0x3e667f78
+849, 0xea6eb21a
+850, 0xe56e54e8
+851, 0xa0383510
+852, 0x6768fe2b
+853, 0xb53ac3e0
+854, 0x779569a0
+855, 0xeca83c6a
+856, 0x24db4d2d
+857, 0x4585f696
+858, 0xf84748b2
+859, 0xf6a4dd5b
+860, 0x31fb524d
+861, 0x67ab39fe
+862, 0x5882a899
+863, 0x9a05fcf6
+864, 0x712b5674
+865, 0xe8c6958f
+866, 0x4b448bb3
+867, 0x530b9abf
+868, 0xb491f491
+869, 0x98352c62
+870, 0x2d0a50e3
+871, 0xeb4384da
+872, 0x36246f07
+873, 0xcbc5c1a
+874, 0xae24031d
+875, 0x44d11ed6
+876, 0xf07f1608
+877, 0xf296aadd
+878, 0x3bcfe3be
+879, 0x8fa1e7df
+880, 0xfd317a6e
+881, 0xe4975c44
+882, 0x15205892
+883, 0xa762d4df
+884, 0xf1167365
+885, 0x6811cc00
+886, 0x8315f23
+887, 0xe045b4b1
+888, 0xa8496414
+889, 0xbed313ae
+890, 0xcdae3ddb
+891, 0xa9c22c9
+892, 0x275fab1a
+893, 0xedd65fa
+894, 0x4c188229
+895, 0x63a83e58
+896, 0x18aa9207
+897, 0xa41f2e78
+898, 0xd9f63653
+899, 0xbe2be73b
+900, 0xa3364d39
+901, 0x896d5428
+902, 0xc737539e
+903, 0x745a78c6
+904, 0xf0b2b042
+905, 0x510773b4
+906, 0x92ad8e37
+907, 0x27f2f8c4
+908, 0x23704cc8
+909, 0x3d95a77f
+910, 0xf08587a4
+911, 0xbd696a25
+912, 0x948924f3
+913, 0x8cddb634
+914, 0xcd2a4910
+915, 0x8e0e300e
+916, 0x83815a9b
+917, 0x67383510
+918, 0x3c18f0d0
+919, 0xc7a7bccc
+920, 0x7cc2d3a2
+921, 0x52eb2eeb
+922, 0xe4a257e5
+923, 0xec76160e
+924, 0x63f9ad68
+925, 0x36d0bbbf
+926, 0x957bc4e4
+927, 0xc9ed90ff
+928, 0x4cb6059d
+929, 0x2f86eca1
+930, 0x3e3665a3
+931, 0x9b7eb6f4
+932, 0x492e7e18
+933, 0xa098aa51
+934, 0x7eb568b2
+935, 0x3fd639ba
+936, 0x7bebcf1
+937, 0x99c844ad
+938, 0x43cb5ec7
+939, 0x8dfbbef5
+940, 0x5be413ff
+941, 0xd93b976d
+942, 0xc1c7a86d
+943, 0x1f0e93d0
+944, 0x498204a2
+945, 0xe8fe832a
+946, 0x2236bd7
+947, 0x89953769
+948, 0x2acc3491
+949, 0x2c4f22c6
+950, 0xd7996277
+951, 0x3bcdc349
+952, 0xfc286630
+953, 0x5f8909fd
+954, 0x242677c0
+955, 0x4cb34104
+956, 0xa6ff8100
+957, 0x39ea47ec
+958, 0x9bd54140
+959, 0x7502ffe8
+960, 0x7ebef8ae
+961, 0x1ed8abe4
+962, 0xfaba8450
+963, 0xc197b65f
+964, 0x19431455
+965, 0xe229c176
+966, 0xeb2967da
+967, 0xe0c5dc05
+968, 0xa84e3227
+969, 0x10dd9e0f
+970, 0xbdb70b02
+971, 0xce24808a
+972, 0x423edab8
+973, 0x194caf71
+974, 0x144f150d
+975, 0xf811c2d2
+976, 0xc224ee85
+977, 0x2b217a5b
+978, 0xf78a5a79
+979, 0x6554a4b1
+980, 0x769582df
+981, 0xf4b2cf93
+982, 0x89648483
+983, 0xb3283a3e
+984, 0x82b895db
+985, 0x79388ef0
+986, 0x54bc42a6
+987, 0xc4dd39d9
+988, 0x45b33b7d
+989, 0x8703b2c1
+990, 0x1cc94806
+991, 0xe0f43e49
+992, 0xcaa7b6bc
+993, 0x4f88e9af
+994, 0x1477cce5
+995, 0x347dd115
+996, 0x36e335fa
+997, 0xb93c9a31
+998, 0xaac3a175
+999, 0x68a19647
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-2.csv b/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-2.csv
new file mode 100644
index 000000000..cdb8e4794
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/mt19937-testset-2.csv
@@ -0,0 +1,1001 @@
+seed, 0x0
+0, 0x7ab4ea94
+1, 0x9b561119
+2, 0x4957d02e
+3, 0x7dd3fdc2
+4, 0x5affe54
+5, 0x5a01741c
+6, 0x8b9e8c1f
+7, 0xda5bf11a
+8, 0x509226
+9, 0x64e2ea17
+10, 0x82c6dab5
+11, 0xe4302515
+12, 0x8198b873
+13, 0xc3ec9a82
+14, 0x829dff28
+15, 0x5278e44f
+16, 0x994a7d2c
+17, 0xf1c89398
+18, 0xaf2fddec
+19, 0x22abc6ee
+20, 0x963dbd43
+21, 0xc29edffb
+22, 0x41c1ce07
+23, 0x9c90034d
+24, 0x1f17a796
+25, 0x3833caa8
+26, 0xb8795528
+27, 0xebc595a2
+28, 0xf8f5b5dd
+29, 0xc2881f72
+30, 0x18e5d3f0
+31, 0x9b19ac7a
+32, 0xb9992436
+33, 0xc00052b3
+34, 0xb63f4475
+35, 0x962642d9
+36, 0x63506c10
+37, 0x2be6b127
+38, 0x569bdbc6
+39, 0x7f185e01
+40, 0xebb55f53
+41, 0x1c30198c
+42, 0x7c8d75c6
+43, 0xd3f2186b
+44, 0xaca5b9b1
+45, 0xbc49ff45
+46, 0xc4a802af
+47, 0x2cecd86f
+48, 0x8e0da529
+49, 0x1f22b00e
+50, 0x4559ea80
+51, 0x60f587d8
+52, 0x7c7460e9
+53, 0x67be0a4a
+54, 0x987a0183
+55, 0x7bd30f1
+56, 0xab18c4ac
+57, 0xffdbfb64
+58, 0x9ea917f9
+59, 0x1239dab7
+60, 0x38efabeb
+61, 0x5da91888
+62, 0x8f49ed62
+63, 0x83f60b1e
+64, 0x5950a3fc
+65, 0xd8911104
+66, 0x19e8859e
+67, 0x1a4d89ec
+68, 0x968ca180
+69, 0x9e1b6da3
+70, 0x3d99c2c
+71, 0x55f76289
+72, 0x8fa28b9e
+73, 0x9fe01d33
+74, 0xdade4e38
+75, 0x1ea04290
+76, 0xa7263313
+77, 0xaafc762e
+78, 0x460476d6
+79, 0x31226e12
+80, 0x451d3f05
+81, 0xd0d2764b
+82, 0xd06e1ab3
+83, 0x1394e3f4
+84, 0x2fc04ea3
+85, 0x5b8401c
+86, 0xebd6c929
+87, 0xe881687c
+88, 0x94bdd66a
+89, 0xabf85983
+90, 0x223ad12d
+91, 0x2aaeeaa3
+92, 0x1f704934
+93, 0x2db2efb6
+94, 0xf49b8dfb
+95, 0x5bdbbb9d
+96, 0xba0cd0db
+97, 0x4ec4674e
+98, 0xad0129e
+99, 0x7a66129b
+100, 0x50d12c5e
+101, 0x85b1d335
+102, 0x3efda58a
+103, 0xecd886fb
+104, 0x8ecadd3d
+105, 0x60ebac0f
+106, 0x5e10fe79
+107, 0xa84f7e5d
+108, 0x43931288
+109, 0xfacf448
+110, 0x4ee01997
+111, 0xcdc0a651
+112, 0x33c87037
+113, 0x8b50fc03
+114, 0xf52aad34
+115, 0xda6cd856
+116, 0x7585bea0
+117, 0xe947c762
+118, 0x4ddff5d8
+119, 0xe0e79b3b
+120, 0xb804cf09
+121, 0x84765c44
+122, 0x3ff666b4
+123, 0xe31621ad
+124, 0x816f2236
+125, 0x228176bc
+126, 0xfdc14904
+127, 0x635f5077
+128, 0x6981a817
+129, 0xfd9a0300
+130, 0xd3fa8a24
+131, 0xd67c1a77
+132, 0x903fe97a
+133, 0xf7c4a4d5
+134, 0x109f2058
+135, 0x48ab87fe
+136, 0xfd6f1928
+137, 0x707e9452
+138, 0xf327db9e
+139, 0x7b80d76d
+140, 0xfb6ba193
+141, 0x454a1ad0
+142, 0xe20b51e
+143, 0xb774d085
+144, 0x6b1ed574
+145, 0xb1e77de4
+146, 0xe2a83b37
+147, 0x33d3176f
+148, 0x2f0ca0fc
+149, 0x17f51e2
+150, 0x7c1fbf55
+151, 0xf09e9cd0
+152, 0xe3d9bacd
+153, 0x4244db0a
+154, 0x876c09fc
+155, 0x9db4fc2f
+156, 0xd3771d60
+157, 0x25fc6a75
+158, 0xb309915c
+159, 0xc50ee027
+160, 0xaa5b7b38
+161, 0x4c650ded
+162, 0x1acb2879
+163, 0x50db5887
+164, 0x90054847
+165, 0xfef23e5b
+166, 0x2dd7b7d5
+167, 0x990b8c2e
+168, 0x6001a601
+169, 0xb5d314c4
+170, 0xfbfb7bf9
+171, 0x1aba997d
+172, 0x814e7304
+173, 0x989d956a
+174, 0x86d5a29c
+175, 0x70a9fa08
+176, 0xc4ccba87
+177, 0x7e9cb366
+178, 0xee18eb0a
+179, 0x44f5be58
+180, 0x91d4af2d
+181, 0x5ab6e593
+182, 0x9fd6bb4d
+183, 0x85894ce
+184, 0x728a2401
+185, 0xf006f6d4
+186, 0xd782741e
+187, 0x842cd5bd
+188, 0xfb5883aa
+189, 0x7e5a471
+190, 0x83ff6965
+191, 0xc9675c6b
+192, 0xb6ced3c7
+193, 0x3de6425b
+194, 0x25e14db4
+195, 0x69ca3dec
+196, 0x81342d13
+197, 0xd7cd8417
+198, 0x88d15e69
+199, 0xefba17c9
+200, 0x43d595e6
+201, 0x89d4cf25
+202, 0x7cae9b9b
+203, 0x2242c621
+204, 0x27fc3598
+205, 0x467b1d84
+206, 0xe84d4622
+207, 0xa26bf980
+208, 0x80411010
+209, 0xe2c2bfea
+210, 0xbc6ca25a
+211, 0x3ddb592a
+212, 0xdd46eb9e
+213, 0xdfe8f657
+214, 0x2cedc974
+215, 0xf0dc546b
+216, 0xd46be68f
+217, 0x26d8a5aa
+218, 0x76e96ba3
+219, 0x7d5b5353
+220, 0xf532237c
+221, 0x6478b79
+222, 0x9b81a5e5
+223, 0x5fc68e5c
+224, 0x68436e70
+225, 0x2a0043f9
+226, 0x108d523c
+227, 0x7a4c32a3
+228, 0x9c84c742
+229, 0x6f813dae
+230, 0xfcc5bbcc
+231, 0x215b6f3a
+232, 0x84cb321d
+233, 0x7913a248
+234, 0xb1e6b585
+235, 0x49376b31
+236, 0x1dc896b0
+237, 0x347051ad
+238, 0x5524c042
+239, 0xda0eef9d
+240, 0xf2e73342
+241, 0xbeee2f9d
+242, 0x7c702874
+243, 0x9eb3bd34
+244, 0x97b09700
+245, 0xcdbab1d4
+246, 0x4a2f6ed1
+247, 0x2047bda5
+248, 0x3ecc7005
+249, 0x8d0d5e67
+250, 0x40876fb5
+251, 0xb5fd2187
+252, 0xe915d8af
+253, 0x9a2351c7
+254, 0xccc658ae
+255, 0xebb1eddc
+256, 0xc4a83671
+257, 0xffb2548f
+258, 0xe4fe387a
+259, 0x477aaab4
+260, 0x8475a4e4
+261, 0xf8823e46
+262, 0xe4130f71
+263, 0xbdb54482
+264, 0x98fe0462
+265, 0xf36b27b8
+266, 0xed7733da
+267, 0x5f428afc
+268, 0x43a3a21a
+269, 0xf8370b55
+270, 0xfade1de1
+271, 0xd9a038ea
+272, 0x3c69af23
+273, 0x24df7dd0
+274, 0xf66d9353
+275, 0x71d811be
+276, 0xcc4d024b
+277, 0xb8c30bf0
+278, 0x4198509d
+279, 0x8b37ba36
+280, 0xa41ae29a
+281, 0x8cf7799e
+282, 0x5cd0136a
+283, 0xa11324ef
+284, 0x2f8b6d4b
+285, 0x3657cf17
+286, 0x35b6873f
+287, 0xee6e5bd7
+288, 0xbeeaa98
+289, 0x9ad3c581
+290, 0xe2376c3f
+291, 0x738027cc
+292, 0x536ac839
+293, 0xf066227
+294, 0x6c9cb0f9
+295, 0x84082ae6
+296, 0xab38ae9d
+297, 0x493eade9
+298, 0xcb630b3a
+299, 0x64d44250
+300, 0xe5efb557
+301, 0xea2424d9
+302, 0x11a690ba
+303, 0x30a48ae4
+304, 0x58987e53
+305, 0x94ec6076
+306, 0x5d3308fa
+307, 0xf1635ebb
+308, 0x56a5ab90
+309, 0x2b2f2ee4
+310, 0x6f9e6483
+311, 0x8b93e327
+312, 0xa7ce140b
+313, 0x4c8aa42
+314, 0x7657bb3f
+315, 0xf250fd75
+316, 0x1edfcb0f
+317, 0xdb42ace3
+318, 0xf8147e16
+319, 0xd1992bd
+320, 0x64bb14d1
+321, 0x423e724d
+322, 0x7b172f7c
+323, 0x17171696
+324, 0x4acaf83b
+325, 0x7a83527e
+326, 0xfc980c60
+327, 0xc8b56bb
+328, 0x2453f77f
+329, 0x85ad1bf9
+330, 0x62a85dfe
+331, 0x48238c4d
+332, 0xbb3ec1eb
+333, 0x4c1c039c
+334, 0x1f37f571
+335, 0x98aecb63
+336, 0xc3b3ddd6
+337, 0xd22dad4
+338, 0xe49671a3
+339, 0xe3baf945
+340, 0xb9e21680
+341, 0xda562856
+342, 0xe8b88ce4
+343, 0x86f88de2
+344, 0x986faf76
+345, 0x6f0025c3
+346, 0x3fe21234
+347, 0xd8d3f729
+348, 0xc2d11c6f
+349, 0xd4f9e8f
+350, 0xf61a0aa
+351, 0xc48bb313
+352, 0xe944e940
+353, 0xf1801b2e
+354, 0x253590be
+355, 0x981f069d
+356, 0x891454d8
+357, 0xa4f824ad
+358, 0x6dd2cc48
+359, 0x3018827e
+360, 0x3fb329e6
+361, 0x65276517
+362, 0x8d2c0dd2
+363, 0xc965b48e
+364, 0x85d14d90
+365, 0x5a51623c
+366, 0xa9573d6a
+367, 0x82d00edf
+368, 0x5ed7ce07
+369, 0x1d946abc
+370, 0x24fa567b
+371, 0x83ef5ecc
+372, 0x9001724a
+373, 0xc4fe48f3
+374, 0x1e07c25c
+375, 0xf4d5e65e
+376, 0xb734f6e9
+377, 0x327a2df8
+378, 0x766d59b7
+379, 0x625e6b61
+380, 0xe82f32d7
+381, 0x1566c638
+382, 0x2e815871
+383, 0x606514aa
+384, 0x36b7386e
+385, 0xcaa8ce08
+386, 0xb453fe9c
+387, 0x48574e23
+388, 0x71f0da06
+389, 0xa8a79463
+390, 0x6b590210
+391, 0x86e989db
+392, 0x42899f4f
+393, 0x7a654ef9
+394, 0x4c4fe932
+395, 0x77b2fd10
+396, 0xb6b4565c
+397, 0xa2e537a3
+398, 0xef5a3dca
+399, 0x41235ea8
+400, 0x95c90541
+401, 0x50ad32c4
+402, 0xc1b8e0a4
+403, 0x498e9aab
+404, 0xffc965f1
+405, 0x72633485
+406, 0x3a731aef
+407, 0x7cfddd0b
+408, 0xb04d4129
+409, 0x184fc28e
+410, 0x424369b0
+411, 0xf9ae13a1
+412, 0xaf357c8d
+413, 0x7a19228e
+414, 0xb46de2a8
+415, 0xeff2ac76
+416, 0xa6c9357b
+417, 0x614f19c1
+418, 0x8ee1a53f
+419, 0xbe1257b1
+420, 0xf72651fe
+421, 0xd347c298
+422, 0x96dd2f23
+423, 0x5bb1d63e
+424, 0x32e10887
+425, 0x36a144da
+426, 0x9d70e791
+427, 0x5e535a25
+428, 0x214253da
+429, 0x2e43dd40
+430, 0xfc0413f4
+431, 0x1f5ea409
+432, 0x1754c126
+433, 0xcdbeebbe
+434, 0x1fb44a14
+435, 0xaec7926
+436, 0xb9d9a1e
+437, 0x9e4a6577
+438, 0x8b1f04c5
+439, 0x19854e8a
+440, 0x531080cd
+441, 0xc0cbd73
+442, 0x20399d77
+443, 0x7d8e9ed5
+444, 0x66177598
+445, 0x4d18a5c2
+446, 0xe08ebf58
+447, 0xb1f9c87b
+448, 0x66bedb10
+449, 0x26670d21
+450, 0x7a7892da
+451, 0x69b69d86
+452, 0xd04f1d1c
+453, 0xaf469625
+454, 0x7946b813
+455, 0x1ee596bd
+456, 0x7f365d85
+457, 0x795b662b
+458, 0x194ad02d
+459, 0x5a9649b5
+460, 0x6085e278
+461, 0x2cf54550
+462, 0x9c77ea0b
+463, 0x3c6ff8b
+464, 0x2141cd34
+465, 0xb90bc671
+466, 0x35037c4b
+467, 0xd04c0d76
+468, 0xc75bff8
+469, 0x8f52003b
+470, 0xfad3d031
+471, 0x667024bc
+472, 0xcb04ea36
+473, 0x3e03d587
+474, 0x2644d3a0
+475, 0xa8fe99ba
+476, 0x2b9a55fc
+477, 0x45c4d44a
+478, 0xd059881
+479, 0xe07fcd20
+480, 0x4e22046c
+481, 0x7c2cbf81
+482, 0xbf7f23de
+483, 0x69d924c3
+484, 0xe53cd01
+485, 0x3879017c
+486, 0xa590e558
+487, 0x263bc076
+488, 0x245465b1
+489, 0x449212c6
+490, 0x249dcb29
+491, 0x703d42d7
+492, 0x140eb9ec
+493, 0xc86c5741
+494, 0x7992aa5b
+495, 0xb8b76a91
+496, 0x771dac3d
+497, 0x4ecd81e3
+498, 0xe5ac30b3
+499, 0xf4d7a5a6
+500, 0xac24b97
+501, 0x63494d78
+502, 0x627ffa89
+503, 0xfa4f330
+504, 0x8098a1aa
+505, 0xcc0c61dc
+506, 0x34749fa0
+507, 0x7f217822
+508, 0x418d6f15
+509, 0xa4b6e51e
+510, 0x1036de68
+511, 0x1436986e
+512, 0x44df961d
+513, 0x368e4651
+514, 0x6a9e5d8c
+515, 0x27d1597e
+516, 0xa1926c62
+517, 0x8d1f2b55
+518, 0x5797eb42
+519, 0xa90f9e81
+520, 0x57547b10
+521, 0xdbbcca8e
+522, 0x9edd2d86
+523, 0xbb0a7527
+524, 0x7662380c
+525, 0xe7c98590
+526, 0x950fbf3f
+527, 0xdc2b76b3
+528, 0x8a945102
+529, 0x3f0a1a85
+530, 0xeb215834
+531, 0xc59f2802
+532, 0xe2a4610
+533, 0x8b5a8665
+534, 0x8b2d9933
+535, 0x40a4f0bc
+536, 0xaab5bc67
+537, 0x1442a69e
+538, 0xdf531193
+539, 0x698d3db4
+540, 0x2d40324e
+541, 0x1a25feb2
+542, 0xe8cc898f
+543, 0xf12e98f5
+544, 0xc03ad34c
+545, 0xf62fceff
+546, 0xdd827e1e
+547, 0x7d8ccb3b
+548, 0xab2d6bc1
+549, 0xc323a124
+550, 0x8184a19a
+551, 0xc3c4e934
+552, 0x5487424d
+553, 0xd6a81a44
+554, 0x90a8689d
+555, 0xe69c4c67
+556, 0xbdae02dd
+557, 0x72a18a79
+558, 0x2a88e907
+559, 0x31cf4b5d
+560, 0xb157772f
+561, 0x206ba601
+562, 0x18529232
+563, 0x7dac90d8
+564, 0x3a5f8a09
+565, 0x9f4b64a3
+566, 0xae373af9
+567, 0x1d79447c
+568, 0x2a23684b
+569, 0x41fb7ba4
+570, 0x55e4bb9e
+571, 0xd7619d3e
+572, 0xc04e4dd8
+573, 0x8418d516
+574, 0x2b2ca585
+575, 0xfa8eedf
+576, 0x5bafd977
+577, 0x31974fb0
+578, 0x9eb6697b
+579, 0xc8be22f5
+580, 0x173b126a
+581, 0x8809becf
+582, 0x3e41efe1
+583, 0x3d6cbbb8
+584, 0x278c81d8
+585, 0xa6f08434
+586, 0xa0e6601d
+587, 0x2fccd88d
+588, 0x3cbc8beb
+589, 0x5f65d864
+590, 0xa1ff8ddf
+591, 0x609dcb7c
+592, 0x4a4e1663
+593, 0xeae5531
+594, 0x962a7c85
+595, 0x1e110607
+596, 0x8c5db5d0
+597, 0xc7f2337e
+598, 0xc94fcc9c
+599, 0xe7f62629
+600, 0x6c9aa9f8
+601, 0x2e27fe0e
+602, 0x4d0dae12
+603, 0x9eecf588
+604, 0x977ba3f2
+605, 0xed0a51af
+606, 0x3f3ec633
+607, 0xc174b2ec
+608, 0x590be8a9
+609, 0x4f630d18
+610, 0xf579e989
+611, 0xe2a55584
+612, 0xee11edcd
+613, 0x150a4833
+614, 0xc0a0535c
+615, 0xb5e00993
+616, 0xb6435700
+617, 0xa98dbff
+618, 0x315716af
+619, 0x94395776
+620, 0x6cbd48d9
+621, 0xab17f8fc
+622, 0xa794ffb7
+623, 0x6b55e231
+624, 0x89ff5783
+625, 0x431dcb26
+626, 0x270f9bf8
+627, 0x2af1b8d0
+628, 0x881745ed
+629, 0x17e1be4e
+630, 0x132a0ec4
+631, 0x5712df17
+632, 0x2dfb3334
+633, 0xf5a35519
+634, 0xcafbdac6
+635, 0x73b6189d
+636, 0x10107cac
+637, 0x18c1045e
+638, 0xbc19bbad
+639, 0x8b4f05ac
+640, 0x5830d038
+641, 0x468cd98a
+642, 0x5b83a201
+643, 0xf0ccdd9c
+644, 0xcb20c4bd
+645, 0x1ff186c9
+646, 0xcdddb47f
+647, 0x5c65ce6
+648, 0xb748c580
+649, 0x23b6f262
+650, 0xe2ba8e5c
+651, 0x9a164a03
+652, 0x62d3322e
+653, 0x918d8b43
+654, 0x45c8b49d
+655, 0xce172c6e
+656, 0x23febc6
+657, 0x84fdc5b7
+658, 0xe7d1fd82
+659, 0xf0ddf3a6
+660, 0x87050436
+661, 0x13d46375
+662, 0x5b191c78
+663, 0x2cbd99c0
+664, 0x7686c7f
+665, 0xcff56c84
+666, 0x7f9b4486
+667, 0xefc997fe
+668, 0x984d4588
+669, 0xfa44f36a
+670, 0x7a5276c1
+671, 0xcfde6176
+672, 0xcacf7b1d
+673, 0xcffae9a7
+674, 0xe98848d5
+675, 0xd4346001
+676, 0xa2196cac
+677, 0x217f07dc
+678, 0x42d5bef
+679, 0x6f2e8838
+680, 0x4677a24
+681, 0x4ad9cd54
+682, 0x43df42af
+683, 0x2dde417
+684, 0xaef5acb1
+685, 0xf377f4b3
+686, 0x7d870d40
+687, 0xe53df1c2
+688, 0xaeb5be50
+689, 0x7c92eac0
+690, 0x4f00838c
+691, 0x91e05e84
+692, 0x23856c80
+693, 0xc4266fa6
+694, 0x912fddb
+695, 0x34d42d22
+696, 0x6c02ffa
+697, 0xe47d093
+698, 0x183c55b3
+699, 0xc161d142
+700, 0x3d43ff5f
+701, 0xc944a36
+702, 0x27bb9fc6
+703, 0x75c91080
+704, 0x2460d0dc
+705, 0xd2174558
+706, 0x68062dbf
+707, 0x778e5c6e
+708, 0xa4dc9a
+709, 0x7a191e69
+710, 0xc084b2ba
+711, 0xbb391d2
+712, 0x88849be
+713, 0x69c02714
+714, 0x69d4a389
+715, 0x8f51854d
+716, 0xaf10bb82
+717, 0x4d5d1c77
+718, 0x53b53109
+719, 0xa0a92aa0
+720, 0x83ecb757
+721, 0x5325752a
+722, 0x114e466e
+723, 0x4b3f2780
+724, 0xa7a6a39c
+725, 0x5e723357
+726, 0xa6b8be9b
+727, 0x157c32ff
+728, 0x8b898012
+729, 0xd7ff2b1e
+730, 0x69cd8444
+731, 0x6ad8030c
+732, 0xa08a49ec
+733, 0xfbc055d3
+734, 0xedf17e46
+735, 0xc9526200
+736, 0x3849b88a
+737, 0x2746860b
+738, 0xae13d0c1
+739, 0x4f15154f
+740, 0xd65c3975
+741, 0x6a377278
+742, 0x54d501f7
+743, 0x81a054ea
+744, 0x143592ba
+745, 0x97714ad6
+746, 0x4f9926d9
+747, 0x4f7ac56d
+748, 0xe87ca939
+749, 0x58b76f6f
+750, 0x60901ad8
+751, 0x3e401bb6
+752, 0xa058468e
+753, 0xc0bb14f6
+754, 0x2cb8f02a
+755, 0x7c2cf756
+756, 0x34c31de5
+757, 0x9b243e83
+758, 0xa5c85ab4
+759, 0x2741e3b3
+760, 0x1249000e
+761, 0x3fc4e72b
+762, 0xa3e038a2
+763, 0x952dd92c
+764, 0x2b821966
+765, 0xfa81b365
+766, 0x530919b9
+767, 0x4486d66f
+768, 0xccf4f3c1
+769, 0xa8bddd1d
+770, 0xcc295eb9
+771, 0xfccbe42f
+772, 0x38bacd8d
+773, 0x2261854f
+774, 0x56068c62
+775, 0x9bdaeb8
+776, 0x555fa5b6
+777, 0x20fe615e
+778, 0x49fb23d3
+779, 0xd093bad6
+780, 0x54919e86
+781, 0x7373eb24
+782, 0xfbaa7a98
+783, 0x5f62fb39
+784, 0xe03bc9ec
+785, 0xa5074d41
+786, 0xa1cefb1
+787, 0x13912d74
+788, 0xf6421b8
+789, 0xfcb48812
+790, 0x8f1db50b
+791, 0xc1654b87
+792, 0x948b43c2
+793, 0xf503ef77
+794, 0x117d891d
+795, 0x5493ffa
+796, 0x171313b1
+797, 0xa4b62e1e
+798, 0x77454ea6
+799, 0xbea0aff0
+800, 0x13c36389
+801, 0xe3b60bac
+802, 0xa176bed3
+803, 0x2863d428
+804, 0xe2314f46
+805, 0xa85cd3d4
+806, 0x7866e57
+807, 0x8f03f5bc
+808, 0x239ae
+809, 0x46f279fb
+810, 0xcca00559
+811, 0xaa07a104
+812, 0x89123d08
+813, 0x2e6856ba
+814, 0x43a9780d
+815, 0x676cff25
+816, 0x6744b87d
+817, 0xee260d4f
+818, 0xb98d8b77
+819, 0x9b0ca455
+820, 0x659f6fe
+821, 0x28d20d1c
+822, 0x601f2657
+823, 0xdec3073e
+824, 0x61263863
+825, 0x1a13435a
+826, 0x27497d1e
+827, 0x17a8458e
+828, 0xdddc407d
+829, 0x4bb2e8ac
+830, 0x16b2aedb
+831, 0x77ccd696
+832, 0x9d108fcd
+833, 0x25ad233e
+834, 0xaa9bc370
+835, 0xa873ab50
+836, 0xaf19c9d9
+837, 0x696e1e6b
+838, 0x1fdc4bf4
+839, 0x4c2ebc81
+840, 0xde4929ed
+841, 0xf4d0c10c
+842, 0xb6595b76
+843, 0x75cbb1b3
+844, 0xbcb6de49
+845, 0xe23157fd
+846, 0x5e596078
+847, 0xa69b0d29
+848, 0x2118a41
+849, 0x7088c16
+850, 0xc75e1e1
+851, 0x6a4af2d6
+852, 0xf19c6521
+853, 0xaff7b3b1
+854, 0x615295c7
+855, 0xbda3a8d7
+856, 0x5b5ca72e
+857, 0xdad9d80f
+858, 0xfa81c084
+859, 0xf4703fa
+860, 0x3ca54540
+861, 0xa8961d51
+862, 0x53d1ecc2
+863, 0x808d83b6
+864, 0x68e8c48e
+865, 0x89be2039
+866, 0x9088ea11
+867, 0xb8665d12
+868, 0x91272f9
+869, 0x53dddff2
+870, 0xb7a54ab
+871, 0xd2b645ca
+872, 0x99fb8590
+873, 0x5315c8e
+874, 0x2a913806
+875, 0x7f15eb2b
+876, 0xa7f1cc5d
+877, 0xbb2ee836
+878, 0xd9fafd60
+879, 0x17448d6f
+880, 0x999ec436
+881, 0x482ec606
+882, 0x9b403c0e
+883, 0x569eb51b
+884, 0xb275d1a6
+885, 0xadd29c31
+886, 0xb7ebdb15
+887, 0xdfef3662
+888, 0x51aba6db
+889, 0x6d41946d
+890, 0x77bf8896
+891, 0xcafa6fab
+892, 0x976ab40f
+893, 0x49a6d86b
+894, 0x56639e55
+895, 0x9945b996
+896, 0x81459b50
+897, 0xbce97542
+898, 0xe397c9c9
+899, 0x247a5955
+900, 0xb72b1573
+901, 0x86306f86
+902, 0x34f65dc5
+903, 0x909360c0
+904, 0xf3f696ef
+905, 0xcb9faae5
+906, 0x93daecd9
+907, 0xde1af7af
+908, 0x43a1f2d
+909, 0x6d75cde5
+910, 0x9e412b6
+911, 0x5673fed
+912, 0x16bb511a
+913, 0x35ef4cca
+914, 0x4e615aca
+915, 0x5cdaf47a
+916, 0x26676047
+917, 0x8c199325
+918, 0x2adf0cb9
+919, 0x84f2e6fd
+920, 0x5e627f64
+921, 0xb7cee354
+922, 0x542ab4a6
+923, 0xe59cd83b
+924, 0x89cc3f10
+925, 0x92b0f5f
+926, 0xc1328370
+927, 0x8208d9f7
+928, 0x68eb00cf
+929, 0xfadd4ac4
+930, 0x2517784f
+931, 0x4042b99
+932, 0x75ce0230
+933, 0x97c5a1b4
+934, 0x1a97f709
+935, 0x4c62781e
+936, 0xf530a83
+937, 0x75776413
+938, 0x321c7240
+939, 0x6afe4e36
+940, 0xad00a2b4
+941, 0xbc05477d
+942, 0xb0911e80
+943, 0x9935b87d
+944, 0xd535eec5
+945, 0x149af45e
+946, 0x786934b0
+947, 0xbc13cdac
+948, 0x208bfa2e
+949, 0xcf4b39cc
+950, 0x6ac6c172
+951, 0xbfa9a37
+952, 0x42d28db6
+953, 0x2bf1ea63
+954, 0xbed6e677
+955, 0x50325d27
+956, 0xa79d3b8b
+957, 0x52448bb1
+958, 0xefaad1bd
+959, 0x833a2e54
+960, 0xd9de549a
+961, 0x9f59672f
+962, 0x9d5f5f16
+963, 0x1c914489
+964, 0xc08fa058
+965, 0xb188698b
+966, 0xdc4672b5
+967, 0x594f720e
+968, 0x56ed428f
+969, 0x9b0898af
+970, 0x8a64d3d5
+971, 0x773308d6
+972, 0x84d62098
+973, 0x46da7cf9
+974, 0x1114eae7
+975, 0xf9f2a092
+976, 0x5363a28
+977, 0xf2db7b3a
+978, 0x102c71a9
+979, 0xe8e76aaf
+980, 0x77a97b3b
+981, 0x77b090d
+982, 0x1099620e
+983, 0xa6daaae6
+984, 0x86ff4713
+985, 0xc0ef85b8
+986, 0xf621d409
+987, 0xfd1561e2
+988, 0x4bcc687d
+989, 0x596f760
+990, 0x7c8819f9
+991, 0x8cb865b8
+992, 0xadea115a
+993, 0x56609348
+994, 0xb321ac14
+995, 0x1bac7db2
+996, 0x5fe6ee2
+997, 0xe9bfe072
+998, 0x15549e74
+999, 0xad8c191b
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-1.csv b/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-1.csv
new file mode 100644
index 000000000..0c8271fab
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-1.csv
@@ -0,0 +1,1001 @@
+seed, 0xdeadbeaf
+0, 0x60d24054e17a0698
+1, 0xd5e79d89856e4f12
+2, 0xd254972fe64bd782
+3, 0xf1e3072a53c72571
+4, 0xd7c1d7393d4115c9
+5, 0x77b75928b763e1e2
+6, 0xee6dee05190f7909
+7, 0x15f7b1c51d7fa319
+8, 0x27e44105f26ac2d7
+9, 0xcc0d88b29e5b415
+10, 0xe07b1a90c685e361
+11, 0xd2e430240de95e38
+12, 0x3260bca9a24ca9da
+13, 0x9b3cf2e92385adb7
+14, 0x30b5514548271976
+15, 0xa3a1fa16c124faf9
+16, 0xf53e17e918e45bb6
+17, 0x26f19faaeb833bfc
+18, 0x95e1d605730cce1b
+19, 0xa7b520c5c093c1aa
+20, 0x4b68c010c9b106a3
+21, 0x25e19fe91df703f0
+22, 0x898364bb0bf593cb
+23, 0x5bd6ab7dbaa125db
+24, 0xd1fe47f25152045c
+25, 0x3bb11919addf2409
+26, 0x26a8cb7b3f54af8
+27, 0xe6a27ee11200aa24
+28, 0x7cb585ab01e22000
+29, 0x78e60028676d2ef3
+30, 0x5c32535e5a899528
+31, 0x83e8b6f8c4a46fb3
+32, 0xe56ef7668a161246
+33, 0x36dcbc15aeb73055
+34, 0x5ea247f0bd188acb
+35, 0x438b547b84601a80
+36, 0x8acda2a1273e9e3d
+37, 0x2b05e30a4b40c24c
+38, 0xfd87236bd13af032
+39, 0x471df211d8d985ef
+40, 0x18e8a5609a793292
+41, 0x46f0951fab6dc4e3
+42, 0x6c199c4e700f6795
+43, 0xf04aa16bfb7d22cb
+44, 0xd763d269fbaffc89
+45, 0x9991930cefbe5c2b
+46, 0xb2a11b953f824c96
+47, 0x63fd9f52172c44b0
+48, 0x183bdad907b1d848
+49, 0xe17953cddb931c52
+50, 0x515cf16726ec205a
+51, 0x88c327605150711a
+52, 0xc7090dd79cbc8dc3
+53, 0xcb487cedeb00a350
+54, 0xc8abf254d87b657
+55, 0xd43cc4cbfb493d1a
+56, 0x8705452e5d9ed1e
+57, 0xcecd11446769cf43
+58, 0xde72156c8d65bc69
+59, 0x796a8f0f47d52ee8
+60, 0xb4c0da443917d6c3
+61, 0xe07ad7568a8e3dc3
+62, 0xc24a8da39ce6dc21
+63, 0x92b21ea80a8556eb
+64, 0x572f21e531edf3af
+65, 0x9b917ed56bbed198
+66, 0xe65fd8ddc5ab3d7d
+67, 0xf55a80a8ec84fa18
+68, 0x18fc22e1a5227b61
+69, 0x72305dc7eeaa79d3
+70, 0x47ce58a36e7592cf
+71, 0x14c6374340c0f7cc
+72, 0x6f98273d4eb5a2c
+73, 0x59a8702c46fe8f8a
+74, 0xb67cbd8113cfe57f
+75, 0xaa03c5db5f5b7690
+76, 0x3fb0f77ea4568013
+77, 0x756530990398b26e
+78, 0x4c1952b2a3a6a343
+79, 0x1da15c5383074582
+80, 0xb405b21c81c274f7
+81, 0xbe664677a16788b
+82, 0x9d2e37550bcee656
+83, 0x8b4589f0d9defe02
+84, 0x2935f018ee06a59
+85, 0x3834bf88be97ed11
+86, 0xa610d049cea79b6d
+87, 0xd49ffc0d09a59ea9
+88, 0x4073365b76567adf
+89, 0x499eefb9bb7513e2
+90, 0x74a743ee6b0138a9
+91, 0x3bf0880f2d947594
+92, 0x555d1c0498600a99
+93, 0x923b32a88ef2ffa4
+94, 0x7325411065fbedea
+95, 0x9f4129ff8b79d300
+96, 0xab2b0a9b8a3785dc
+97, 0x11734bdfba3a1713
+98, 0xc8333398841ba585
+99, 0xee2409cc234e6742
+100, 0xf6638e700872ecd2
+101, 0x10875300c13cd284
+102, 0x27a9bbed7c15b2d3
+103, 0x3c87f8fef31ce9bd
+104, 0x92be263cd0914a95
+105, 0xa7b0f11bc742307e
+106, 0x4a56f788cc1c1a3c
+107, 0x4a130fa32257a48b
+108, 0x5d4d9eda16e90286
+109, 0x7cc2af564844bedc
+110, 0x2532867bfe7cda1a
+111, 0xb1c504676611fd17
+112, 0xce8e86cfb4189aee
+113, 0x99685898980d1970
+114, 0x8c3b67db23bcf1e
+115, 0x73e14c93905b135f
+116, 0xf0271b64ac2bd4d3
+117, 0xf4beba82f3ec1b2d
+118, 0x1cdbf3ee9f210af
+119, 0x2e938557c09c3ea6
+120, 0x2d314ccfa6ffd81d
+121, 0x31ad47079950ade4
+122, 0x342b27547b900872
+123, 0x171b0e20b9ef1a76
+124, 0xdf10ce6318b03654
+125, 0x1d625df4aa718897
+126, 0x8712715a9f6e02ec
+127, 0xb4a072da725bca3b
+128, 0x19d346cb7734bd42
+129, 0xfd4281d311cb2958
+130, 0x58274c9519fc8789
+131, 0x4cacf29d885fd544
+132, 0x784b14d1c2523b80
+133, 0x2d25242131bb2373
+134, 0xcd2a5e43a7d9abf9
+135, 0x15eda3806e650ecb
+136, 0xdaac5e277d764d96
+137, 0xdc5a5dd59aaa94e0
+138, 0x40d00237a46d5999
+139, 0x6205dd35a692743f
+140, 0xbbd8236740361f09
+141, 0x1625c9f4e7288bf9
+142, 0xb74f12df1479e3ce
+143, 0xb2d72a51b43d7131
+144, 0xf006a324b3707c83
+145, 0x28e8ab4abe7655b8
+146, 0xfb480093ad7ab55
+147, 0x3f8abd0d6ff8d272
+148, 0xc81a94177ac26bb7
+149, 0x3cdc178307751b14
+150, 0x9de84cc2b10ba025
+151, 0x3f8ab5aefcd046e2
+152, 0x43bdb894e1ee83b2
+153, 0xe288a40f3f06ac9d
+154, 0xdab62a7d04b4f30f
+155, 0x49f4e20295e1a805
+156, 0x3643764805e0edef
+157, 0x9449954618b6b
+158, 0x6c87e0d4508e0ce0
+159, 0x3a334be688a9dd7b
+160, 0xb35c39228776e499
+161, 0xc4118bfff938490e
+162, 0x88cbde3dcbb034b2
+163, 0xf91b287793c417c3
+164, 0x42b15f731a59f5b3
+165, 0xffa27104bbe4814d
+166, 0x1b6789d138beccde
+167, 0x542c2c1440d0ceb9
+168, 0x367294504d18fa0d
+169, 0xf918b60e804a1b58
+170, 0xd390964e33a9d0e3
+171, 0x23bb1be7c4030fe8
+172, 0x9731054d039a8afb
+173, 0x1a6205026b9d139b
+174, 0x2fa13b318254a07e
+175, 0x69571de7d8520626
+176, 0x641a13d7c03332b7
+177, 0x76a6237818f7a441
+178, 0x4e77860d0c660d81
+179, 0x4441448a1c1cbdb2
+180, 0xccd7783a042046e5
+181, 0xf620d8e0805e3200
+182, 0x7de02971367fdd0c
+183, 0x539c263c5914cab1
+184, 0x9c3b9ba1a87bbf08
+185, 0x6d95baa34cda215f
+186, 0x2db3f83ace0bac5f
+187, 0x7f5af1da2dc670a4
+188, 0xfcc098d16c891bfb
+189, 0x81a33df1d7a5ab12
+190, 0x767b0f863c8e9882
+191, 0x7a92983830de483d
+192, 0xfa7598c37a79ac25
+193, 0xb89b3ca42ce03053
+194, 0x457a542b8efed4f7
+195, 0x571b7737fd0eeda7
+196, 0xa0f59e524485c0a
+197, 0x82dca766b7901efd
+198, 0xa68243caf6a3bd5d
+199, 0x1bac981c6c740e5e
+200, 0xbcd51bedf9103e44
+201, 0x4e197efd3ae5a7bf
+202, 0x523568efd782268b
+203, 0x5ec4ef1191fef09
+204, 0xed751ed5e31c9ab
+205, 0x44eac24de03e1b29
+206, 0x9237d57c011d3fb3
+207, 0xa8c6da0f7692f235
+208, 0x9f9eb6bc15d6cac7
+209, 0x34bb8e0c93427aad
+210, 0x115febd738eaac4a
+211, 0xa439991ed139d27a
+212, 0x45c7c2633d8710a2
+213, 0x48b7475f3405a3ce
+214, 0x80158497c77bd00b
+215, 0x935c316a5b1657cb
+216, 0x59c5d54440e9695e
+217, 0x337c78c5b3d0ede2
+218, 0x8c46bb956b93790d
+219, 0xbf1dd03e471d71c5
+220, 0x2d375e90a4bef583
+221, 0xd0365428331b3790
+222, 0xfcd3969ac827ecd4
+223, 0x392fb6c580498410
+224, 0x6d6db4ceab5ea6c0
+225, 0x9bf84f1972e24786
+226, 0x798dfd820959dcc5
+227, 0x2e425095e65e8bfb
+228, 0x8c1aa11536b1c9c3
+229, 0xd28e2ef9b12f6f74
+230, 0x86583bc98c8f78d2
+231, 0x489877530e3f93e7
+232, 0xb1d9430631104a15
+233, 0x1814f6098e6263bd
+234, 0x8e2658a4e0d4cd53
+235, 0x5afe20e2531cdb2a
+236, 0x30d02f7c4755c9bf
+237, 0xe1e217cda16ed2d2
+238, 0xccb4913a42e3b791
+239, 0xfff21363ac183226
+240, 0xe788690bbda147a7
+241, 0x76905cf5917bfc6a
+242, 0x2a8fa58f7916f52c
+243, 0xf903c0cc0357815a
+244, 0x15d20f243a4998d2
+245, 0x5b7decee5a86ea44
+246, 0x114f7fc421211185
+247, 0x328eb21715764c50
+248, 0xaffaa3f45c0678fd
+249, 0x2579e6ef50378393
+250, 0x7610ab7743c19795
+251, 0xf9923d2bd101b197
+252, 0x57e42e7a62ba7e53
+253, 0x9f1dc217b4f02901
+254, 0x88a9ebd86509b234
+255, 0x867fc926aecc8591
+256, 0xaf22c1bfef04c718
+257, 0x39f701f0313f4288
+258, 0x6171ad397e6faab2
+259, 0x239bb5b9abdec4fc
+260, 0xd9a591e25dd01c6e
+261, 0x826dc4a75b628e49
+262, 0xf112b152c408f47
+263, 0x6843a06110f86c0
+264, 0x965e56a7185c1332
+265, 0x8d84492edbc71710
+266, 0xeee8ec111cfd1319
+267, 0xf2858e94ad98e458
+268, 0xbc9589fdf5f3a97e
+269, 0xaf0ceef3bc375130
+270, 0x48f4aaf13fa75c1e
+271, 0x111e9db47bee758f
+272, 0xea3171df130164ba
+273, 0x2a7bbe30bf827ab6
+274, 0xc516c3fdbf758c35
+275, 0xec55097754b04be5
+276, 0x374a997d52b6d3e6
+277, 0x487df5456085ffbc
+278, 0x528883b84df8eafe
+279, 0x805f77ab5ba26f86
+280, 0x8eb81477dc04f213
+281, 0x471ea08ec6794d72
+282, 0x69d3667ecc4d2176
+283, 0x98b7b6e295548a66
+284, 0x3877713c173f8f2
+285, 0xa00542570d0e8de3
+286, 0xf534b1bfa4033e50
+287, 0x7e1fedeac8bf6b26
+288, 0x8043f37c89628af4
+289, 0x1dd7039ec295e86d
+290, 0xce9c05b763a40cc4
+291, 0x246926481e61028f
+292, 0xb7cb0f1babf5893b
+293, 0xefe6b777f37fc63e
+294, 0xebbcabb4cb35cdcb
+295, 0x39fa63cd711eeea9
+296, 0xad5d3ba7aaf30c8d
+297, 0x8e9e78fe46021990
+298, 0xc7eaef6e7d5a3c62
+299, 0xefccdd5495d3f386
+300, 0x2179557ee8cfc76a
+301, 0x88a77f621f0885ce
+302, 0xafda62674543d90c
+303, 0xb8e6fbe2e13e56c0
+304, 0x8bfbbe26a14f9b1a
+305, 0x1404f59f5851f8c3
+306, 0x1140c53a0489566d
+307, 0x3edf2d138b5c3f1d
+308, 0x75d6bb275d817dc
+309, 0x8e660ae27107664e
+310, 0x7a8021038ee303e1
+311, 0x2042ef5eefa9079f
+312, 0xe3e7b90bbf6d457a
+313, 0xf3f819d2bb9405b
+314, 0x522e42155cae0c10
+315, 0xf5bfbb975b40e233
+316, 0x2cf82b614dd95cfa
+317, 0x183ef4a96bc40e55
+318, 0x9f6e351c5ba4e752
+319, 0x37c1110683c90846
+320, 0x1d89b7a996d8a977
+321, 0x18a444f77c7cb4d9
+322, 0xd0a8a971b78dc893
+323, 0x860232fb9e6543f1
+324, 0x60b6097f51002555
+325, 0xca1e5214123e3894
+326, 0xe03fe695c95f99bb
+327, 0x2c7c6779d5f03622
+328, 0xafeeee42f63055d1
+329, 0x670dde905515936a
+330, 0x9a922f42b59fb094
+331, 0xddb5ff49af5a651a
+332, 0xe61b04c9e58ebbf8
+333, 0x4e459dcf272e7fc4
+334, 0xd549e92c16adceeb
+335, 0x7a17dba1299d4a9c
+336, 0x825d756109f2b585
+337, 0xba142e61a9cb203e
+338, 0xc2a19f00e9c04a30
+339, 0x2d0f8140d23d0652
+340, 0x8b866d4d4d6caaf4
+341, 0x4f11d90dd91f8217
+342, 0xf6efc37373b9e0d
+343, 0x248493d6cd6a4736
+344, 0xd12b6ae74a951a3e
+345, 0x56e34722070b70a7
+346, 0x22d3f201cc9fa0eb
+347, 0xbfdcc320008291b7
+348, 0x1a7a6922e9204fbd
+349, 0x831421e0c4945ae4
+350, 0x66316feddddf0e11
+351, 0xa8c86a1517456554
+352, 0x14a9049ad989e335
+353, 0x837022259f141ecd
+354, 0xcb71793a06c261f7
+355, 0x4aeefc07ebe09a79
+356, 0x8982f15aa3b6594b
+357, 0x67bccfa7ed9b0d5b
+358, 0xb377463b523e9dec
+359, 0x53d3d594870fecb7
+360, 0xa5274b1caec5a60a
+361, 0xd6316d0cb643db39
+362, 0xabc1a9b536de88ce
+363, 0xed2fdb1383d2a077
+364, 0x12319c6feb97221b
+365, 0x7e0f6cd40ef47403
+366, 0x86135c84fe26dbf8
+367, 0xc96622d3fbbee19b
+368, 0xe3989d8d8511573f
+369, 0x42cc365554d1fdc7
+370, 0x4c1a1eb8bbce8b4f
+371, 0xfc4e30e7ef2034c1
+372, 0xc490444317a91e76
+373, 0x7ccdf469ff5dc81c
+374, 0xf5a0da4110cc09d7
+375, 0x505227baf34c0fb5
+376, 0xbe58737e8a35cc88
+377, 0xd449bee91b3e8c41
+378, 0x3e590e23299d0e6
+379, 0x291a7d9e0a64caf7
+380, 0xdc6fafbdfebd2293
+381, 0x8223f1e259fe8a65
+382, 0x6186fbc9efd9e3df
+383, 0xfda39b07e4007ffb
+384, 0xfc19aea98574dc02
+385, 0xd0e10d354fcacd8c
+386, 0xc9619916544a55a5
+387, 0xd454d50a8c8558cd
+388, 0xcd94a246712d91e
+389, 0x76a771f5d1231cce
+390, 0xdd20cb2b7b370ee5
+391, 0xa6f4f50feca57c49
+392, 0x78c8fb431f17ab9c
+393, 0x1b692b79a59b43cc
+394, 0x4c45045d287da7e6
+395, 0x522132e18bf43928
+396, 0x25c458983138b41c
+397, 0x2a1fb426ef229796
+398, 0x74dc324c74e5dd3d
+399, 0x6df75e3eb6eb5374
+400, 0xb63f2f4f9ca25b61
+401, 0xac72286112ee54d6
+402, 0x5a966f3d0a6863c4
+403, 0x8d7046bc64a46fc2
+404, 0xa7b740fd6e3087eb
+405, 0xcdbcbe0340cfcdf5
+406, 0xcb632613bf312b65
+407, 0xa91b3f2c2aac238b
+408, 0xa06deb3f5ae555a3
+409, 0x29d72e1f8db69
+410, 0x2d004bae09728ea6
+411, 0xc6eee5dce0736cc1
+412, 0xa7493145500ff60f
+413, 0xc4d68c4aa18ab93c
+414, 0x8210c29e79d48d7f
+415, 0xd0999d7889ecbef6
+416, 0x6e3bd61e66e93566
+417, 0xe6cc13d47d7d7b1f
+418, 0x3d6f181f42e03979
+419, 0xbed4e14fd867604a
+420, 0xbe511c84067bd86d
+421, 0x49a876d89e697d38
+422, 0xc04c3dde8f889c98
+423, 0xaf293eeab0f53e3f
+424, 0x9f6291dd65732cd6
+425, 0xd7811ac01de78c01
+426, 0xe385cf0261d50ec2
+427, 0x5a64134b3542bbf
+428, 0xf9d1302bc6f13a68
+429, 0x5d2aabbea37d8c31
+430, 0xd9842e99a5192970
+431, 0x713eadc4cd30e837
+432, 0xb7b002fc72abb413
+433, 0x276cfeea526af1cf
+434, 0x8519fe79b633a0ce
+435, 0x2f0e87363705a3e2
+436, 0x9adbac0be3c371e7
+437, 0xf3f44ba899a6173c
+438, 0x782d6c29618fde2b
+439, 0x7f61062acec408f
+440, 0x6e79cd836359258f
+441, 0x5c8e9b138df5785a
+442, 0xa54359c9f39a9a84
+443, 0xeec3f033135084b0
+444, 0x883ee717787a535c
+445, 0x9a2422b513a73b00
+446, 0x2dd4beddcdd64a58
+447, 0x90c8a13202239c7b
+448, 0x85b352ab759646d9
+449, 0x139f5cb2e46c53aa
+450, 0xe1d3ba6c721c66d1
+451, 0xaa66e0edc4b60a98
+452, 0x3521275c75be29b6
+453, 0x490a5190b3edfa5d
+454, 0xd2abcdd2ccb2f14e
+455, 0x9d9be8bef4a5857d
+456, 0xde19676f13ef7755
+457, 0xdac2fee2e42615f3
+458, 0xf4239801cb02f2ab
+459, 0xaa8bf923ed91875c
+460, 0x61d18a1940e4c7c0
+461, 0x1eb6aa3d5f077a6d
+462, 0xee7374c063bf29d8
+463, 0x2f0a59e34d76268d
+464, 0xc92e80e17d1eb3e9
+465, 0xafd05b3ec3d2ca72
+466, 0x28a61ad8d6c497b8
+467, 0xa7094d6834ad7d47
+468, 0x57d80ea9eccbb4f
+469, 0xb047e0fee6cdaf16
+470, 0x44f41b5eb48c00bb
+471, 0xd6dc8e1eb9c8c9ba
+472, 0x47adfd2c638c7849
+473, 0x365d63db7d526c68
+474, 0xc21cda439016135d
+475, 0x14d10c3f0f98863c
+476, 0xa93e56f74e037602
+477, 0x3b4e9c8915bdc9
+478, 0xb46f5ae155e54aa2
+479, 0x8e470d21ce1943e1
+480, 0x60b96301b5ba2e8d
+481, 0x1b473a41d381f9ff
+482, 0xabcf5a8e3269e73f
+483, 0xd410f6e94fb21fa1
+484, 0x65d1a47eebf87e5e
+485, 0x48eaa201c61cb843
+486, 0x212c1abc2499bfc5
+487, 0x4255ad8377d2d8d
+488, 0x44caeef472010612
+489, 0xffae764524f572f2
+490, 0x78d374d20c9ee550
+491, 0x6e003206c0511cee
+492, 0x7998a159145bfb82
+493, 0x921239650bda1d4d
+494, 0xae05025509bcfdc5
+495, 0xc6430c980be407b4
+496, 0x78524f1744b153f1
+497, 0x84089e6f468181fe
+498, 0x8d0d21d7dfb6c254
+499, 0x90bad90502a33603
+500, 0x3072a403cbd16315
+501, 0xdfadddf3f1c040c2
+502, 0x22f0b0639d9ff975
+503, 0xb49e48a4cad0765b
+504, 0x95a0a04f8239709d
+505, 0x56e147a24a4c481f
+506, 0xacf16ef61dea4c7e
+507, 0x424040afd2700de6
+508, 0xc67e8096a3c717a9
+509, 0x39f164181dd0a399
+510, 0x2449cedc1d62198c
+511, 0x7a53df11a1f1a61c
+512, 0x5596f1d4a3badae3
+513, 0x38ed4c822072b3d0
+514, 0xf07ef346b3fd730a
+515, 0xfd349c35c3ed51fd
+516, 0x2f15c9c7890f8f32
+517, 0x3b470df52b173c29
+518, 0xd31bfc8981281af7
+519, 0xbbcc9bdf561215bb
+520, 0x5782fffea326574f
+521, 0xb0ebdcfcc5e03290
+522, 0x7fd89d93d2b3fbef
+523, 0x280ea1865d9ba2
+524, 0xe726959845b2c100
+525, 0xd0361f032cd7dbb1
+526, 0x3c65ec2028b81a22
+527, 0x5221e9b2188920bf
+528, 0xeb5ab27c4125ec20
+529, 0x80a32dd48b54f0a4
+530, 0x369b5ced1012bebb
+531, 0x582d35d76530bc6f
+532, 0x7b50dc9b48e1e37d
+533, 0x37fdfe8bbacf8dad
+534, 0x7a0cb7e6e93840ea
+535, 0xa1132c870be0b2ce
+536, 0x9d8ac2c68267cd1a
+537, 0x470969b647fa7df4
+538, 0xabcb7d8adf7e2d24
+539, 0xacdebec9bdf9eb1c
+540, 0xe30f4cbf7eb6a59
+541, 0x746673836c4df41d
+542, 0x75120a6b647bb326
+543, 0x2f4eab556c3f6878
+544, 0xd84651ab05405b7a
+545, 0x9e695808b9622284
+546, 0xc93b71e56aa6e1a5
+547, 0x2be7f3be4a7b7050
+548, 0x6497e910b6733241
+549, 0xcf7050dfd08076fc
+550, 0x4e3cc156eca183f7
+551, 0xf801a33d9326c265
+552, 0x6aa293c8a47d40e6
+553, 0x28c429755faa6230
+554, 0x82b818651f54e7bb
+555, 0xa84d726d7acdbead
+556, 0x5cfa535d5774965d
+557, 0x4a34b7b1cb48d53
+558, 0x86a7b5bce426de84
+559, 0xfcd2307cecdb7318
+560, 0x16dbaaa71181a038
+561, 0x88e7e8cd261c2547
+562, 0x3c09ba6d1d5ea913
+563, 0x5dd3d643734ee5b6
+564, 0x326d725fe8cbb33
+565, 0x7bcca9ca2da8e784
+566, 0x482dcf6b11d7f9a4
+567, 0x1291b605b4cd3e04
+568, 0x6988181b50e2f4a8
+569, 0x649e3c37131fc292
+570, 0x4eeb67b9e21eba54
+571, 0xc051d39073dec45f
+572, 0xc99c52e110270d67
+573, 0xcb813d5d77868add
+574, 0x423a5f13573e7ac0
+575, 0x231ac4cc4fe73616
+576, 0x4c22b888a6e600ea
+577, 0x8059a6dc7c9e25c6
+578, 0x49f498a5b8ad22de
+579, 0xf1e812cc6d1826c8
+580, 0xbbaf60abe8b11e00
+581, 0x1d31d7f4d8be9a6a
+582, 0xfeadce70a9a10c14
+583, 0xb47c635bc136996a
+584, 0xd88e694c8da030cb
+585, 0xc41bbe132aff1364
+586, 0x34249ab18a4b0800
+587, 0xf14b5c825aa736cc
+588, 0x2710be6b08df78e
+589, 0x2ab56bcc9bf9e740
+590, 0x9b7f6e591b5f648
+591, 0xfb665c3772f34135
+592, 0x628a0a5d2db5d8d5
+593, 0xb3e3f251e61b5259
+594, 0x82310ae33faf1b23
+595, 0x24af8723a65cbd0b
+596, 0x671c93282fc4ad97
+597, 0x6cabeaac77270cad
+598, 0xef4643fe38b02b7f
+599, 0x7b011549d1ac6653
+600, 0xe2af87b9fccfe89
+601, 0x36b71ad67197ac8a
+602, 0xdbba55d06f2fd93b
+603, 0xf571dbd764b7f7e5
+604, 0x38ea402501cdbd45
+605, 0xb8ab5b5b1bab2913
+606, 0xfab973c4d45f32bd
+607, 0x9364f1717c2636b9
+608, 0xfad00f4d983e00fe
+609, 0xc90c532a11aef75a
+610, 0x64a6eda96e44783c
+611, 0x35891f2eb84520be
+612, 0x28d216080caed43
+613, 0x129629cc5bd206f6
+614, 0x22c3d39822cbb4b3
+615, 0xf1efbf4cce1eaa2b
+616, 0x7070cba12524ed08
+617, 0xa7ed0be9deabf20d
+618, 0x8ddb4cd6b454f76b
+619, 0xb82814b1db37b63
+620, 0x418e83b36de01876
+621, 0x9a538c7f39c6413
+622, 0xee0cd7abf8a2ecb9
+623, 0xa9222b07e95590f3
+624, 0x6296a415d68341e6
+625, 0x981e0a5a8f811929
+626, 0x4bb372d3b0de283d
+627, 0xa9805b5971866e16
+628, 0xaf3b5f5183497657
+629, 0x2152b0fd23c3d9f
+630, 0xb730c325b7173180
+631, 0x1e3439d231608c19
+632, 0x1c5ba6031379823c
+633, 0x87f5d12d6d365cbc
+634, 0xd3bc7f29614bc594
+635, 0x63102214bb391268
+636, 0x482bbd5bba648a44
+637, 0x6a23604690759dc4
+638, 0x4091d41408d3a39e
+639, 0x7cd017f922101b15
+640, 0x7ce9004ac5f9231
+641, 0x978bc3d8ec7f7fdf
+642, 0x5bd0c4d780580c11
+643, 0x4313c068bb040153
+644, 0x3ab7dab7bc38bf80
+645, 0x3aaf9c187728deea
+646, 0x6633a4ce8efb88d9
+647, 0x7263b089878f00fc
+648, 0xd0d767e96fe00eb8
+649, 0x184a7c0c01908028
+650, 0x1ebdf41e6f76e186
+651, 0xeb740ee1d0402083
+652, 0xfccf4974edb1c339
+653, 0x16e2707aa28306d
+654, 0x1684f0bdb018c3a5
+655, 0x887b6b67b88aa862
+656, 0x923d7810a2bea33a
+657, 0x56b3560babef5d6b
+658, 0xb39a14614c54b8c6
+659, 0x33e4dc545a509fc8
+660, 0x26e21f84142da9b
+661, 0xdd07598125756855
+662, 0x572d49a071d7ae0a
+663, 0xba3c7e3baea28760
+664, 0x7ecdb2d714db4b61
+665, 0x1c62b4920e1b2fe2
+666, 0x71bfafb70092834a
+667, 0xd710a4228f60d56a
+668, 0xeb16277d4ce4e95b
+669, 0x968168c90b16d3a1
+670, 0xac3439dfe8ad0062
+671, 0x5a8226f9dd5876ad
+672, 0xb843affe917291b0
+673, 0xd76d1e67051f8259
+674, 0xb73a6638cce8ccde
+675, 0xa0e6afd3c7295f9
+676, 0xff8857b4bbb5f4c6
+677, 0x99becf78938f0426
+678, 0xfcd17edc1e70f004
+679, 0x6223b8b23f2f50
+680, 0xca875f3e84587b4c
+681, 0x7d1e81e589f87fb9
+682, 0x9eb621586aa826fc
+683, 0xf46fb9ef5b9c2086
+684, 0x2882c9b7092725f3
+685, 0x5493f099bbedcd02
+686, 0x90c1ec979ffa811d
+687, 0x963f765025bcc53
+688, 0x56194e3ec3d9d4e9
+689, 0x7ec4720954cac1f0
+690, 0xfab3145171af7f90
+691, 0x52a0b4e41a13b593
+692, 0x740e2d4d5909d126
+693, 0x98f5339c09c94a28
+694, 0x1700e462fe8dec76
+695, 0x3dbffc2aa4695ac3
+696, 0x5763edacabdfe2a1
+697, 0x7b5b623ce49ef21d
+698, 0x30addc66f49860df
+699, 0xcc7511a6c31bceda
+700, 0x1b25b61ca75db43b
+701, 0x416bc4c298e59046
+702, 0x4cd11fe2d74e4649
+703, 0xb54458a9229fc978
+704, 0x8c21a27882b6ca35
+705, 0x57887c8b5e01639b
+706, 0xf4e893da996680bb
+707, 0x8d601297702c9c0d
+708, 0x2a27904a30aa53af
+709, 0x497800f6917ea8d0
+710, 0xe96db3340ada9c00
+711, 0xcc23166f14c010ee
+712, 0x782690d78fa65ec9
+713, 0xf3e00d74a0878eda
+714, 0xa7cbb683decca0a3
+715, 0xdd2e038e683a94aa
+716, 0xe2096ff8da896ca5
+717, 0xf7c83400afdabe11
+718, 0x395b8c6f6a4086a4
+719, 0x4a164ec05bee71d4
+720, 0xe87aa5d1ca0462fe
+721, 0x8dbc5aed6dff9ceb
+722, 0x12120d1e9552707b
+723, 0x877dca6889b3e6cd
+724, 0xbd65605c01e900fb
+725, 0xbd6b82c4157c3115
+726, 0x8b60282732caf78a
+727, 0x279fcf5e5de9e57f
+728, 0x34b34ebfb6a37eae
+729, 0xd258cc1a14e03b7b
+730, 0x9a528ba3db4a13fb
+731, 0xffa0aea59d057746
+732, 0x27fa7f456cd37c4e
+733, 0xe1117a57a6fdce63
+734, 0xdc8fc903970a1551
+735, 0x492dd104f30faf29
+736, 0x110def0959e5652b
+737, 0x7f8d1997636fdd15
+738, 0xfb77b05e538a9b59
+739, 0x2e41fa35b4b01fc6
+740, 0xbc35ae69a3374085
+741, 0x192c2a681c2d9b4b
+742, 0x12566b8866c189d6
+743, 0x9d88ea785c5185c8
+744, 0x30a621ad5f983c4
+745, 0x8b875efe1206f587
+746, 0x224d25c3af6e3423
+747, 0x7503e976a1ac7bcc
+748, 0x3c98aa869e823859
+749, 0x3d8835304b646892
+750, 0xf6353330ff970bc2
+751, 0x8a673f5e2edb8acb
+752, 0xf2fdcc53493838b9
+753, 0x85ddcd526236af16
+754, 0x60afb99814c676c5
+755, 0x32a1c2749e281ca8
+756, 0x2367a92ae3bee9ca
+757, 0x219fe082703743cc
+758, 0x34d8b74dc85182a9
+759, 0xdd04164c72db23f
+760, 0xe293ac28fe2671a9
+761, 0x9ca7d169cbda6f45
+762, 0x705c47972b4240ed
+763, 0xc10eda9eeb536209
+764, 0xc36ddacd0c94e85d
+765, 0x8eb592c27e8cd0d2
+766, 0x3e815991c76e7cc4
+767, 0xac9cfce31acf7580
+768, 0xbf7a4cb31c7aee94
+769, 0x663077444aceecf6
+770, 0xe7f614ff386eb568
+771, 0x79d7a229c66912c0
+772, 0x161ed4311f63e1f3
+773, 0x308a5faeb9982ede
+774, 0x7b38ddb9b7efd10
+775, 0x1e103a2589b27ecf
+776, 0x67b02baf4259f27e
+777, 0x868921c115ea2eee
+778, 0x959791912200f71e
+779, 0x4dd55f36dec10557
+780, 0xe3464d90080cb99d
+781, 0xfb2d4f6accce652f
+782, 0x109900a9257d77ba
+783, 0x3c4bda8e2c83684c
+784, 0xc9ae040fb7f868c6
+785, 0x78098ffe994f4905
+786, 0x7a94c33eca77f0b4
+787, 0xbe6a2a95e9b5c0e8
+788, 0x797d39cf963f4837
+789, 0x8d2e249e4425d06d
+790, 0x6ae2c30cd5da06f4
+791, 0x904489de762b179f
+792, 0x84713e2dfb591e3b
+793, 0x6405a40da3f6f51b
+794, 0x976b560d663a2df1
+795, 0xed1c544784ba1e22
+796, 0xca658e995ed9344c
+797, 0x2b1c6b8e4db49025
+798, 0x52b1513da528bad
+799, 0x3c63406d256d9968
+800, 0x63a31ca3d423f85e
+801, 0xb05a81f55789a720
+802, 0xd04412992c476c8e
+803, 0x828ec2f77a150a3d
+804, 0xee50926671bb60c6
+805, 0x5aa70f93e2df61b4
+806, 0x94d60fa2e8655858
+807, 0x3f5e5b770703cc7d
+808, 0xc62dfb2688ca7784
+809, 0xaaf02e1e8ba89fe4
+810, 0x4ab74e0d8c047405
+811, 0x31ee04fbac6fcead
+812, 0x1203b78b8228f5af
+813, 0x412a70836f9aa71a
+814, 0xab51cf98c03f1819
+815, 0x783a3ce9ce137f65
+816, 0x8897085b0a072cf2
+817, 0x685dd9bde8798cb
+818, 0x9a1fac7b1705e2c1
+819, 0xf3e9ff98de48e9cb
+820, 0x5c2d3eb1a1fbe917
+821, 0x3bda718b6b54d82e
+822, 0x29f2dd18f22f0821
+823, 0xb992da1572ac3597
+824, 0xacb69e7aa14b34f7
+825, 0xcd36e3ad14f088d1
+826, 0x6aaacc96a1ec55e8
+827, 0xf8ac593f154fe68f
+828, 0x18fc9cbff012339f
+829, 0x2f3368ccbbb99899
+830, 0x7cec7d17f37031f7
+831, 0x96e86bfaadcb8fc2
+832, 0x74f9e7ee3d42a752
+833, 0xbd52f6c7d9b0733
+834, 0xa48e6d96bb6ce1c9
+835, 0xaefa058254b82133
+836, 0xb7a19edfd0929107
+837, 0x6160ce9125b26e26
+838, 0x6537dbbde1d2aed
+839, 0xc567f9a6bec52dde
+840, 0xca29fd3f22443342
+841, 0x7732aa6db6a1c476
+842, 0x8f5a4d7df6b11b3
+843, 0x76649262aa7e31e1
+844, 0x60a13eb125fbc829
+845, 0xc81e4d123dd21ac1
+846, 0x643cbb09bb72f86b
+847, 0xf971a98fb25555a6
+848, 0xffa2774c66692d56
+849, 0xcb33c16c50b13ea9
+850, 0xfabf388dffda0e9b
+851, 0x55d41ec12ca24b9f
+852, 0x91cf693a3467e807
+853, 0x6be2c00b2c31d6dd
+854, 0xc5cf513b5251ae28
+855, 0xffc4384212403dec
+856, 0x45d4e1865255a69d
+857, 0xfb1dcf956972086a
+858, 0xcae946a55c4c55b8
+859, 0x7351ac7720e385c1
+860, 0x19aa8ffd86240254
+861, 0x8f515ae78f4040da
+862, 0x1e1ed2058de50fce
+863, 0x22d006dcdb374243
+864, 0x6e0f0ede7c95b441
+865, 0x70e8aa81b53b4d25
+866, 0x998f309ea41e3814
+867, 0x89ed6598fb66f390
+868, 0xb5997dc3278060df
+869, 0xb2a021eac4f7e046
+870, 0x3705b60aa2fd0768
+871, 0xfc415079ab9200e
+872, 0xf2871ac4cf45ecc9
+873, 0x24bf758d2246175f
+874, 0xac503dd6f8141b3
+875, 0x4e879d12d9f03b3
+876, 0x82034af8cf93b644
+877, 0x59899dd7e478a6c7
+878, 0xae90addb6eb11507
+879, 0x1524ddf76730cdef
+880, 0x6fd4afd5456b1c9d
+881, 0xcddb9221ea001cbc
+882, 0x64ff400bbf2e8604
+883, 0x6dda10549b06ed9b
+884, 0xed2c85104c261527
+885, 0xc7e09217d29929a8
+886, 0x56284df611a428b1
+887, 0x1a7608289c0a61
+888, 0x7cb63db15166ff66
+889, 0xc6013c76fcdcdc72
+890, 0x8e5dd566c7a5a676
+891, 0x5a8e8565f40d133b
+892, 0xe465973455848c44
+893, 0xf92eecbfe0f3c2c0
+894, 0x7d64155d4dcc5cac
+895, 0xf17595706f988dad
+896, 0xd590a001a6a19c5c
+897, 0x82a164475758db3d
+898, 0x6b144993ea1bbe32
+899, 0x22a81a7a6e453779
+900, 0x8e8c298df1a68a73
+901, 0x78056afd6d936b4c
+902, 0xaaceef0325faaf62
+903, 0xe78bb7699f82266f
+904, 0x523a2d283c5a5166
+905, 0x7076d87088f6c6db
+906, 0x6087dd54cff5aeb2
+907, 0x7ef82e62cb851680
+908, 0x4e8bcc8ed84d03d8
+909, 0xd12fa0361df3cfd3
+910, 0xefb89c79f8127297
+911, 0xa9af4e2fbce0b1f8
+912, 0x462136685b70331e
+913, 0xe9e74c93da699b77
+914, 0x9ec69215fb11d0c3
+915, 0xc10f229939e3e111
+916, 0x3f67fa79e41d2374
+917, 0xd5e7c1a9a7185162
+918, 0xa1dcce9ec91492fe
+919, 0xd4e61f0727b5d21b
+920, 0xdf6cdce46551800a
+921, 0xa3f256ce906982d3
+922, 0x209742a6b9ffc27
+923, 0x4006c96958526a57
+924, 0x9606aebc75a1967e
+925, 0x91b9f42fb64189df
+926, 0xb27119defcb938bc
+927, 0x128cc7a84ba05597
+928, 0x6c3df613c62d0d30
+929, 0x3adf69d48b629ec7
+930, 0xda42ee493837b128
+931, 0xb8e770480e760bb5
+932, 0x9feb55d57c99c626
+933, 0x29812d80afdae3ed
+934, 0xae4222a64276a8c7
+935, 0xe3897212a5b4ed53
+936, 0x98bedfd13886e669
+937, 0xca858675d7fc0d0e
+938, 0x28a359f665354234
+939, 0xfac2ccabe4128b35
+940, 0x61373cc5d11ca180
+941, 0x7007605a4512a87a
+942, 0xe71f8eade7b30b3d
+943, 0x3a9e77f9b99bd04d
+944, 0x70d3e42488098866
+945, 0xd30fc159c7cd4d99
+946, 0xe4d3f6600d2e2d6f
+947, 0x1088324dfa955c25
+948, 0x516437acd4764623
+949, 0x38a31abe50d0aa03
+950, 0x72e1054e9dc02ba
+951, 0xe6971dd664d1a2e2
+952, 0xf6698cb095d3b702
+953, 0xad995a5a8c19bd92
+954, 0x34e53c6936f656e6
+955, 0x10de240bc07c757a
+956, 0x3e3b9a6861c2bd1c
+957, 0x9c0b0b97d3712ec9
+958, 0xabf1505a75043aed
+959, 0xbdf93d3de3274179
+960, 0x28fa5904d3f62c28
+961, 0xc3b97b39ef6c5133
+962, 0xf2b2219225b8679d
+963, 0x8be4ec0f930c0aaa
+964, 0x47de5a56aa590643
+965, 0xb6f871b304129856
+966, 0x80a61c06233ab0f9
+967, 0x3ce6c3af8101b055
+968, 0x85b911708274e7d1
+969, 0x4cab65d093a488b7
+970, 0xaabc4b10661fe28e
+971, 0x35b16dea64474a68
+972, 0x1d6eb5b093361223
+973, 0xc39107b92f0fe1fb
+974, 0x1d09e048073c4841
+975, 0xc6a02f43aca8cb2f
+976, 0xaf6613dbc7da909c
+977, 0x5ac2a40c230aa756
+978, 0x33afb5e7c01c39a5
+979, 0xc7b0b20ea8b7d0ef
+980, 0xdf7306c8ccb1bbea
+981, 0x9710efc0c188b2a0
+982, 0xd6303eadb72c873e
+983, 0xa38ca609b118f35a
+984, 0x8390613065c6e535
+985, 0xdf9a0106757e431f
+986, 0x8bcf77039788e143
+987, 0x6026806a986b378e
+988, 0x482ff3b1394cb1dc
+989, 0x2a27d0ccac9ede9c
+990, 0x53c77f26e271b3ab
+991, 0x1ba004cf276cf3f
+992, 0xc135b0517dc81f7c
+993, 0x5d137838db75e442
+994, 0x3fe505f93d1dbdd7
+995, 0x351654ae7d598294
+996, 0x173f8d182af9d84d
+997, 0xf97dfcd164fe11c5
+998, 0xcda423e5ad43b290
+999, 0xa5cb380b8de10d10
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-2.csv b/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-2.csv
new file mode 100644
index 000000000..7c13e3172
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/pcg64-testset-2.csv
@@ -0,0 +1,1001 @@
+seed, 0x0
+0, 0xa30febcfd9c2825f
+1, 0x4510bdf882d9d721
+2, 0xa7d3da94ecde8b8
+3, 0x43b27b61342f01d
+4, 0xd0327a782cde513b
+5, 0xe9aa5979a6401c4e
+6, 0x9b4c7b7180edb27f
+7, 0xbac0495ff8829a45
+8, 0x8b2b01e7a1dc7fbf
+9, 0xef60e8078f56bfed
+10, 0xd0dbc74d4700374c
+11, 0xb37868abbe90b0
+12, 0xdb7ed8bf64e6f5f0
+13, 0x89910738de7951f
+14, 0xbacab307c3cfd379
+15, 0x2cf7c449d8b927a6
+16, 0xdcf94b3a16db7f0e
+17, 0x8a9d33d905a8792e
+18, 0x4cb9eb2014951238
+19, 0x6c353acf7b26d6f1
+20, 0x73ff53d673aa30c
+21, 0x1fd10760015eca68
+22, 0xabae0aa9021eeba8
+23, 0xa5ae363a868ee2bb
+24, 0x9d89e0f041de6631
+25, 0x6238b133c3991a65
+26, 0xff49267d75fef51a
+27, 0xfb180656ce13c53f
+28, 0xaf7fadf36128712d
+29, 0xa6847fc6f339c63e
+30, 0xb03e0b80d71ea5bc
+31, 0x63905abcb43969af
+32, 0x2295af3ee00a3bba
+33, 0xb8b375b994330415
+34, 0x867d9ef1d8716a3b
+35, 0x4f6c02f5601b4e18
+36, 0x7c5fb4c16c470d18
+37, 0xe3b57986b804b343
+38, 0xef1d79d212aca692
+39, 0x5b98774c8806209c
+40, 0x924fc76bac38a5d1
+41, 0x5266084c412ddeed
+42, 0x98240bf9b831d6a3
+43, 0x5681599e81219442
+44, 0x6441248fc2ba92bc
+45, 0xe3e9051a540349ea
+46, 0x3a2700034390baa3
+47, 0x9f893155b6d402bc
+48, 0x158207910c6d8aef
+49, 0xd5282ab7608c2cbc
+50, 0xc97f4651669dee4f
+51, 0x3d4750d95103ed60
+52, 0xe0614542caac1f04
+53, 0xefe5092144cfc6c
+54, 0x560bc486abd7e9ae
+55, 0x2678b71392daa4b8
+56, 0x734970d3dc2ba416
+57, 0xcbdbe849e51e4aaf
+58, 0x3b0b5e28b491556c
+59, 0xd51449ac45abd88
+60, 0x6790b59991f1b7ab
+61, 0x32d1c039ff2415bc
+62, 0x173b9772f24f72e0
+63, 0x9490a9ca9f883b1b
+64, 0x4c775989e6214222
+65, 0xac07db37e6ee6114
+66, 0x331371b2e3f10aee
+67, 0xf12e5326c21c28e4
+68, 0x5d77dc280c70d614
+69, 0x1b01bd17a2f281ec
+70, 0xa10d3b5882938487
+71, 0xed5a0033c394ae8f
+72, 0x70bc8ea568ea44b4
+73, 0xf4600ae77965e730
+74, 0x7ff92c0b321ce233
+75, 0x6cdbc87d0cc1d670
+76, 0x9ec64f0cf2000eb1
+77, 0xfebea50259800f68
+78, 0xf2edf9019a8fd343
+79, 0x75c584ac042e5468
+80, 0xc1fa8481d5bf9a1d
+81, 0x7f57180168514ac2
+82, 0x878100716b94f81e
+83, 0xc929406e3af17fd2
+84, 0x6a26e2c013e4bf4d
+85, 0xbc071d8848280955
+86, 0xb60d75abbfd1bdac
+87, 0xee9b76afeca9fa69
+88, 0x1d6c399d2f452810
+89, 0xbaa0bc1621e25c83
+90, 0xed6ba792f8671ba5
+91, 0xf7ca02c2ab11d8d7
+92, 0x3c3cadadf0b21e3
+93, 0xdd1784571e864e9c
+94, 0xfb2f992015157509
+95, 0xf50bb9f0d3ced743
+96, 0x261565f75c3e185f
+97, 0xf8fe33b284513e60
+98, 0xe3d2d10b5e024664
+99, 0xd28717566242cf35
+100, 0x7ae07d133ac5b789
+101, 0x3b7ccaaa53ac338e
+102, 0xcd480bace4871650
+103, 0xec6c78f923c080e9
+104, 0x44211d0ff8919d59
+105, 0x89f79af76d2a45fe
+106, 0x71583fd8a837548b
+107, 0xee57269c261511f5
+108, 0xa5ee8f3b128c5d1
+109, 0xbb64c20ed0765a17
+110, 0x9d4790ab2eeaf7e4
+111, 0x742f3db806d9e98
+112, 0xb81ec97aed6a0d1b
+113, 0x41808b34f6a8a23
+114, 0xc20913af175dfd4d
+115, 0x834427db263b22bb
+116, 0xedd9c632e611828a
+117, 0x10eac8524496f571
+118, 0xd76091b97eb00ab7
+119, 0x111298ae9fe95666
+120, 0x5824b2e2a6719c43
+121, 0x6e280ec539e934ed
+122, 0xf74fd832df90083e
+123, 0x8fee6d0f241c2e97
+124, 0x4244f331c2f19c3c
+125, 0x3dde75a845cce97f
+126, 0xe35bb8e635a9915b
+127, 0x39d2943037f7932e
+128, 0x1fe2d134201d0970
+129, 0x49d00b63c749b804
+130, 0x960c2942cd4e4e04
+131, 0x8dd8e009dbc0435f
+132, 0xcf493495c3a055cd
+133, 0x8f7b5a1c0f9fe9cd
+134, 0x49d5f90374641a25
+135, 0x69b3932073d3524c
+136, 0xd170603e7de84ee2
+137, 0xa062ba3ed3539948
+138, 0xf5861cc5b5d56c82
+139, 0x5e914998a30c7e76
+140, 0x8d77f2ad1503c0f1
+141, 0x980b6a9e3b4181fb
+142, 0xd9299cd50694c084
+143, 0x253dc0f8f1cec4c5
+144, 0x68110fb9d1b3e695
+145, 0xe8f3120d0aabc461
+146, 0xb066e7df0dfb042
+147, 0xd29ce0f797e6b60b
+148, 0x6a569bb7ca33bd42
+149, 0xd46e08b2dc2385f8
+150, 0x28c61d11d055767
+151, 0x5d73aa3d1a2bb725
+152, 0x1421191e1c14829a
+153, 0xa711bfb6423df35e
+154, 0x461af97a86308006
+155, 0xb3e1018ff3519367
+156, 0xf19cf866a268ef2b
+157, 0x207715eac9199d1d
+158, 0xdd621c410975b78c
+159, 0xf390aea68683610
+160, 0x617a2d107a0047d9
+161, 0x6e05ac416e5bebf0
+162, 0x7d253e70506c1bed
+163, 0xf9f96f4a7dd53810
+164, 0xc693b29cb1573f73
+165, 0x4f1146b0020ea544
+166, 0x45140608fbd40579
+167, 0xdcf57219828ce6be
+168, 0xe19d58cca37b5b32
+169, 0x82bda95b2a161235
+170, 0x5823c3d8a2b6c9ba
+171, 0xfeb2e74092fdf89a
+172, 0x50e1ad1abc8f869d
+173, 0x2ec63d0c105eb8da
+174, 0xe14e1c4845a3264a
+175, 0xcff53670455eb6aa
+176, 0xaafaccd24619fa3e
+177, 0xf55a988486e2422a
+178, 0xecfba16a90ff4d04
+179, 0xbf8d36c2f644757a
+180, 0xdc56ed75a0dd6249
+181, 0x3f45023eff17c3bb
+182, 0x2428bbfe90023fab
+183, 0xab892c611adcb70c
+184, 0xb6f13d8c0c2b9d74
+185, 0x2ac3fb11d224f2a8
+186, 0x65433dcfae2d9351
+187, 0xe906859ae4b45f82
+188, 0x8fb7f5f093d76a3b
+189, 0x940dd290b5e88d1a
+190, 0x31b27d21bef116e7
+191, 0x86a964e2c83b5296
+192, 0x85ffd17bc079a9e8
+193, 0x16c47c724e7ab7f1
+194, 0xfb6098a9867e7d7f
+195, 0x9246fb69092c6cb2
+196, 0x1a4033572760f32
+197, 0xc5cc568a8b273b84
+198, 0xfa6f9f2fbdd44abc
+199, 0x9701b8e087718ba3
+200, 0x51d6a7dcf73f8f3a
+201, 0x30008172cc6a972d
+202, 0xac2ab49a5ca6ac81
+203, 0x31f28ef79461e54c
+204, 0x93e35a8da8cc6132
+205, 0x9a2c58beeba3d5b9
+206, 0xf6615c1de266ac39
+207, 0x127ff9f8166b766b
+208, 0x7ffe380e80a69556
+209, 0xbe7d2c228e1542f7
+210, 0x2d5ebb4e50ba1746
+211, 0x63585761ae1bf684
+212, 0x1019eb5cee022fea
+213, 0xb9d3540ab58da30d
+214, 0x1677f4cb45620eb9
+215, 0x6524baee51783822
+216, 0xdf9f2ddcfabb0adc
+217, 0x78e8acc43b287935
+218, 0xe9a1974e999222b5
+219, 0xc41324ec2291e780
+220, 0xea52abc9ecdcbc9f
+221, 0x209d7bcd46ec6b04
+222, 0x12d504c09803db2e
+223, 0x1200e6bf21475d81
+224, 0xde6d3c2b35fd2cfc
+225, 0xa2526900ac33bd3c
+226, 0x7f1f5290fc432bc5
+227, 0x29ddfb380a3d69c8
+228, 0xac79cb6942a2909d
+229, 0x516996685b67a92a
+230, 0xb5fc39041cb828bb
+231, 0x75d9d8ca0644a276
+232, 0x81e98b76be92a3e9
+233, 0xca27888fafe12179
+234, 0x17be2ae039925765
+235, 0x9429846c0e6d0342
+236, 0x327dfd50439815e9
+237, 0xcee20cd7bc254aeb
+238, 0x7d250389f453f29e
+239, 0xfd1b232a85c95569
+240, 0x2ed55fac80f3e9e9
+241, 0xf6886c20417a1be7
+242, 0xcd08e61f0b0fdfde
+243, 0x7b33e34da5c27bff
+244, 0xd043c4b7d5603dd5
+245, 0x9a544e4c70a3b686
+246, 0xa7b60398c381f771
+247, 0xe9e7a3487c4bd4f2
+248, 0x10b58fdfe1ff112c
+249, 0xd5c1c9748c0f4ceb
+250, 0x61be9d09159d54ff
+251, 0x5356f51e8239f510
+252, 0xfe7889d9b202ecef
+253, 0xc7fc19ca5d263d5d
+254, 0x7c4c07e61dfd9f69
+255, 0x6c315fe5015f300a
+256, 0xe0a5bc00039747b4
+257, 0x16397fdcf829ee80
+258, 0xb55aee80d16a5169
+259, 0xca0609944d007eea
+260, 0xcc982249f65a02ce
+261, 0x528161feb149c148
+262, 0xcbf08ba49b41c006
+263, 0x39af1ff0b6f14138
+264, 0x5cc036be69799aec
+265, 0x6adde125b1db21c5
+266, 0x8a99d83d6b613b67
+267, 0x1cd43fca9451f74c
+268, 0x682dbb26ecc96365
+269, 0x13b4be2ceb43e3
+270, 0xbe8fbc3b6f4f581e
+271, 0xda148a2f4bda5719
+272, 0x239106ca3319f393
+273, 0xb42b4dde641f0dd5
+274, 0xd233cfdf4cb0af74
+275, 0xfb5919d905589afc
+276, 0xd802a8860c10b66a
+277, 0x6c923e1d00e7b5bc
+278, 0xfacce1134f383b89
+279, 0xf9570abda7a6d553
+280, 0x80f0f9796a208f18
+281, 0xc0e1df5280951c57
+282, 0xe9f143f08257bbe0
+283, 0x79e4c6463123d588
+284, 0xdd2118583f2b1684
+285, 0xb399ff5f2329fa18
+286, 0x4b3e9ebae96f813c
+287, 0xc484dbf247787384
+288, 0x921865eb97603f2c
+289, 0x18063c68e257d300
+290, 0x643181f345e7fc26
+291, 0x12e0b0e8eadf9fa7
+292, 0x79e613fe73dfa354
+293, 0x6db4c59203b7217a
+294, 0x6c7a0e9ba6139eaf
+295, 0x9617c7ac4e3f6d97
+296, 0x1f68a7b4fb1b4b75
+297, 0xef0b7ab24944f466
+298, 0xaf1dee1f4be1bc89
+299, 0xd2e355c959f5fd8d
+300, 0xe594c3fb95d96efc
+301, 0x9554766ca3342906
+302, 0xa4bbdc77d12842c
+303, 0xb62400211ee489a8
+304, 0x91abadaaa3bbe67c
+305, 0xd371eeb91deb42bb
+306, 0x883bab35cbd2b6e5
+307, 0xd030c3d9411a9041
+308, 0xff3c110a858ff000
+309, 0x59bdf5ca47d0bde7
+310, 0x2bc80fa3cdba1853
+311, 0x6444ccb652662cb8
+312, 0xc0c7e256b9e90339
+313, 0x70714ea9c9d72302
+314, 0x96a0142f9d897d27
+315, 0x209a9097c5a91ef7
+316, 0xb9e33afc5171e009
+317, 0x47b37af433a58d40
+318, 0x30cc4ffbfa831d26
+319, 0xdcea4a85ff815466
+320, 0x907d5bd027f2e5cc
+321, 0x7c081f6852e04a4b
+322, 0xe61950749c1d502b
+323, 0x1604e937ee69834a
+324, 0xb2372d952dd25309
+325, 0x53f6a5b834c72577
+326, 0x2ce7a74395e0b694
+327, 0xacbf9ab4fe91f225
+328, 0x5ce1e63d3a2bb90f
+329, 0x54740da3a5ed139b
+330, 0xf194ddb39f29880b
+331, 0x3305374f5d8ec08b
+332, 0x831dd0164927ff4a
+333, 0x625baa78e4458cf
+334, 0x29d27dc0a4a71152
+335, 0xe227bae9a1401034
+336, 0xca0c209831846b2b
+337, 0x8e8cc54b08b5a411
+338, 0x38f2b4acaac27db6
+339, 0x8ec88baac814e86b
+340, 0x31c08e46b007bde
+341, 0xb686c02722794c09
+342, 0xb77cf8fc682e3907
+343, 0xa56334e7f606f4b2
+344, 0x9c80b127bddd5f4f
+345, 0x12df14834cd858bf
+346, 0x3f14762a9cf5fb9f
+347, 0x930a70941ef5779e
+348, 0x64e96c849c30c080
+349, 0xfdf53bfba1300484
+350, 0xec7a9363c21bc616
+351, 0x26e9fd6a115ecb47
+352, 0x9707a84b5bc77fbb
+353, 0xb23b2737b20d5903
+354, 0x22f4825ae80f6501
+355, 0x500644b12be6a01b
+356, 0xb746645b2af082db
+357, 0xe6af051f697892f8
+358, 0x577c724248a1cfc6
+359, 0x3d2b6a434c84eed3
+360, 0xd260f5efd7328314
+361, 0x95c16cc84bb3f55c
+362, 0x7a01b2e4e0e80ca7
+363, 0x41930c3ce70a0935
+364, 0x1299bccf39d4e110
+365, 0x494883ba1a8a87f
+366, 0x9478ecfe2d918e60
+367, 0x30ec9a5670cda8af
+368, 0xf9bc877e833e2b99
+369, 0x1b83a0acfbb4a8db
+370, 0x73bc1740c0d18880
+371, 0x65086ca9773cb3e1
+372, 0x3b78c3ccd63cff2e
+373, 0xbfae748795acfb31
+374, 0xa4c9d5d56a15ba20
+375, 0xb9cb41721e52b71e
+376, 0x1532f15d4dc47748
+377, 0x5a4d647a4b9ee632
+378, 0x8513c7c5a50898d9
+379, 0x6d3d98ccd5461b2e
+380, 0xa65e99be2fe98d6
+381, 0x31abc8855334a0e5
+382, 0xf1ed22a661dca5b8
+383, 0x299e2b63229e03be
+384, 0xda201a06687bce48
+385, 0xd27794b302142c55
+386, 0x642bd3e1c7898a9d
+387, 0x777f1ff00afa1a87
+388, 0xd2f1c84fb3877baa
+389, 0xae417583289191fd
+390, 0xd641f1d88e0e2d55
+391, 0xc1f1d98fb5d18ebf
+392, 0xb0f72aecdadce97b
+393, 0xe9b8abc764f6018a
+394, 0xd2a37cff8e890594
+395, 0x2dd70d631a528771
+396, 0xbf8ba0478c18e336
+397, 0x1630bf47f372ce0a
+398, 0x6d04ea20dc3f46b8
+399, 0x6591881bf34337f2
+400, 0x33c149c7eb5b4103
+401, 0xf01a8c9857c86748
+402, 0x184348cdfc16d215
+403, 0x141168b253d2ed7
+404, 0x52aaf012ef50a6f1
+405, 0xfda1722387e16f4c
+406, 0x43c30f57d6c038fa
+407, 0xd4a8611f5f96d214
+408, 0x2c512ce17e987f2c
+409, 0x961ce450f0fa2822
+410, 0xf55a506ec6cea9cd
+411, 0xb76d694d9c7f5ef6
+412, 0xfb029216dbd8e988
+413, 0x93162501896a0081
+414, 0xfbbbd2c5ab300f5c
+415, 0xd648b6da7387d491
+416, 0xc73b4697471d9d98
+417, 0xe37412bf1c93ee76
+418, 0xa1a96d96570e6637
+419, 0x5b3ab4f82428f65c
+420, 0x873d849b188aa36f
+421, 0x39fbee0ffc9fa9ff
+422, 0xc70d21b744d677fe
+423, 0x2b8a43c23043d209
+424, 0x93c33eaa37370d16
+425, 0x8930ac1880f2b0ef
+426, 0xac01d27707036af0
+427, 0xc2af3fee504343a0
+428, 0x1c1dae2ad5535d97
+429, 0x9ffc21804b76a480
+430, 0x69f903412cc13563
+431, 0x9d3c4e2759a0c47d
+432, 0xb1a8f894be6302b9
+433, 0x95e1fd7951479506
+434, 0xbb9e6c03cd4ae8e3
+435, 0x85206010c9b737cf
+436, 0x767e813694d6238c
+437, 0x4969af329ccbb30a
+438, 0x3aa9af1075aaea5c
+439, 0xb1ff519e8118a993
+440, 0xb21a23a3c91180fe
+441, 0x320b24582ca3fd88
+442, 0xf8ca56415fb4e453
+443, 0xabd0899c07205e77
+444, 0x87fdc7a44b4ad50f
+445, 0xd75744911641a278
+446, 0x7c8c9a65df6fcb95
+447, 0x79d785e3c7a5b695
+448, 0x421e4565ba1f592f
+449, 0x27f87eb2517835cf
+450, 0xb62cc4297441c83e
+451, 0xd817a80ac815ca6d
+452, 0xad84388130df2aa8
+453, 0x5e6b1640452d6ac8
+454, 0x936285e15edce2a3
+455, 0x903bccc4969768e8
+456, 0xefc2cb7b109d3140
+457, 0x633e9dfdda2d903a
+458, 0x2a2f3225925678a1
+459, 0xe07eac91a27f8547
+460, 0xe50ced40eda78cb3
+461, 0xc5b22500e1c7441
+462, 0x32becf61bca3aa72
+463, 0xa2e37c4b30671344
+464, 0xc9f1c1910f45d544
+465, 0x9b50333b2dcdf730
+466, 0x310bfd53a1684b94
+467, 0x1e1dc21e66ac6455
+468, 0x81876c2bfb1ed5a1
+469, 0xd0c54a3e25eadc7b
+470, 0x3791b6fbbd5c7ba0
+471, 0x133be57356c599fc
+472, 0x8d1148eb8e83fdea
+473, 0x311aedba0d8b42cc
+474, 0x1142ae52745f94bb
+475, 0xc5f4ab2fbde8c4a3
+476, 0xd23be827b5b24f6d
+477, 0x65f95194cd122715
+478, 0x4b48969d73125922
+479, 0x46f165052b8ff988
+480, 0x5c689f94b9275ff4
+481, 0x93b03823ff2d536b
+482, 0x871f3775aa4e3523
+483, 0x5af829f7cc0f66a5
+484, 0xa32e05739cbeac8c
+485, 0xacff1856ddace0fe
+486, 0x8eeb5e7f991a5322
+487, 0x6325c2720e0dbdea
+488, 0x9fb817bc4fdf5200
+489, 0x9786f0d850e43d78
+490, 0x571f76dd7f9fb77a
+491, 0x4d9e94e181cbc63f
+492, 0x8bb632d3376c547a
+493, 0x9cc26d9efd1c88b9
+494, 0x9c5d49579df52b0b
+495, 0x6201abf7e1cda07b
+496, 0x90d68f0c6c884963
+497, 0xfc5b66188ef7f561
+498, 0x6d9303cf2e0e0f95
+499, 0xd7cfcff535f5ed07
+500, 0x14d1a1228daa4ac6
+501, 0xe00ef5762f66ae50
+502, 0xf113a79471582978
+503, 0x430985281785dc7a
+504, 0x31914108c206ed5
+505, 0x7ba6707b6419971c
+506, 0x2ec63b033ce112e5
+507, 0xf8bcd36ced3b41e3
+508, 0xe5cf908c8010414b
+509, 0xf5ee224b7c703e30
+510, 0x9a9733af0b12338b
+511, 0x83e18cc00ace34f8
+512, 0xd52cff39e23008b8
+513, 0xa700578136b9c0c5
+514, 0x3fa179d32ac51f99
+515, 0xef2d5eab6d4ad380
+516, 0x709024a5abd032df
+517, 0xc607c7ee349ede87
+518, 0x803d784e9731eb5f
+519, 0x2ef06f4ba769282d
+520, 0x4bc1dca1e9f07eb9
+521, 0x930c958a7a72f94d
+522, 0x249bc8db2cc7a3bf
+523, 0x3845305798f9a5d
+524, 0x6f137eca9ab6f948
+525, 0xc31f5a963d31bd67
+526, 0x9d39693d5383626f
+527, 0x52fb41c335a8b98e
+528, 0xb79d1a29a06006ec
+529, 0x7c0926a7a3eda2cc
+530, 0xffdf5214406fd53e
+531, 0xc6aa02a7e94282b9
+532, 0xd4a4431b4aa301ee
+533, 0x4271cc0f9420d3ab
+534, 0x26fccd7cc7fc2485
+535, 0x330594bb945b8d5a
+536, 0x6ea8eaad12e5cb8c
+537, 0x831c3467726bede3
+538, 0x31d1eb10017eaa61
+539, 0xc7aa75e41508f5cb
+540, 0xde51810f0cadd0b5
+541, 0x50e5b3e73692f80b
+542, 0x82107ec55636e188
+543, 0x9828ef175d843ab4
+544, 0xb8edc6a860dd421e
+545, 0x25c0c138fd537ac3
+546, 0x47e72a771e8eb563
+547, 0xbb0f8c5333f4a2cc
+548, 0x91750d2fb9b2d479
+549, 0xe662d8f6fe38df36
+550, 0x72a6d879fb5619f0
+551, 0x6817c7878dcbf077
+552, 0x4e7741cb484661e8
+553, 0x3b3b3ba0be5711bf
+554, 0xa6989f5d25868765
+555, 0x43c276398997e4e0
+556, 0xdcbe16a94da28870
+557, 0x454936980a699c99
+558, 0xac614bfa8f0266c6
+559, 0x9174841392e213d5
+560, 0xa0e2acffc5fc9d1f
+561, 0xe53a08a7a0e6521a
+562, 0x2b845cf7c24172e0
+563, 0x265a4fc5f7adec0d
+564, 0x1f34fbe5f1e49420
+565, 0x139181f6fb647f20
+566, 0x88c35d46e2fcd05e
+567, 0x2a6d5b55903c0459
+568, 0xcea28eb621ad7bf1
+569, 0x5c9cdc13e7aaa30
+570, 0x5fe63e14746e7103
+571, 0x7923e53d73835db9
+572, 0x376e661210bf1b06
+573, 0x5b1cab85450efdd5
+574, 0x3908dc096c70b452
+575, 0x4825e303cd1f396f
+576, 0xed476bfd702957c3
+577, 0x6acc013aff5db743
+578, 0x62c80b776343d488
+579, 0x9c75edcd5b012697
+580, 0xaa053362a3b9770a
+581, 0xa907e236c7c07e94
+582, 0x15b2c380451692c0
+583, 0x94f79142697bd61f
+584, 0xbc657d31ea98d44f
+585, 0xcbaa5e52517a1f5e
+586, 0x96aa2e44a7c4a03f
+587, 0x216d3c66db2b515d
+588, 0x157001807e3ca88a
+589, 0x52b3a596bdd3859a
+590, 0xed747e7fc5e3adac
+591, 0x78fd765ddb2c448d
+592, 0xe53dc7299ed8614e
+593, 0x75ad41fb1d7a790a
+594, 0xc14f6b944b0e6cb1
+595, 0x7c314b69fce3df1c
+596, 0xb56d82eb740d7abc
+597, 0x5132a93c41251fdb
+598, 0xe3ce35bd2a82f958
+599, 0x440571a981c722f2
+600, 0x194cdfd9f186bc9
+601, 0xb89e522a5db00939
+602, 0xad35f339f68df3c8
+603, 0xa82ab18420322293
+604, 0xaffa6df9b72b27c4
+605, 0x9615694d23beaa2c
+606, 0x1d82ebe563abad91
+607, 0xab50ef65fbd94385
+608, 0x1b070dbd70a9a14
+609, 0x2ececa796abbadf0
+610, 0x6bbeafe9e81ab2a2
+611, 0x60dcd0d2a9b76914
+612, 0x1e748039ef05c33f
+613, 0x6d4d17f2213ccdff
+614, 0x9fa56132957bc987
+615, 0x60a17185de2428eb
+616, 0xb56038ddf306479c
+617, 0x3b1db5df92d06d8b
+618, 0x24d1bba8bdedf580
+619, 0xbfb7e6740ebaa4d9
+620, 0xab31c4473e46f61d
+621, 0x6deb3cdd8fd5869f
+622, 0x23032e47746d72d6
+623, 0xa9e72d734e10f2e8
+624, 0xbffd199b6157bc23
+625, 0x29f8254df273fb62
+626, 0xb076142130ee55ec
+627, 0x5b0b08374126c309
+628, 0xea4536aae979521f
+629, 0xc064e7abec91a174
+630, 0x46133ef80c59d935
+631, 0xf0227e2da1b14160
+632, 0x675a76641e1af5a
+633, 0x2f50a069b33d198c
+634, 0x3ded5a65e1d657eb
+635, 0xbb6999b020694f6b
+636, 0x86b2f2b33487aed7
+637, 0x76e14e85f8bfb4cf
+638, 0x38f7f1e44bd4e0db
+639, 0xc1a7d41b7e80d4ae
+640, 0x1dfaaf80bbceb42e
+641, 0x3f51c11497720c2b
+642, 0xce6da1415ddb8b80
+643, 0x7377d8bcd359b5f3
+644, 0xe077208f3f810aca
+645, 0x9a06a8a2dacbffce
+646, 0xca1f99156b09b735
+647, 0x2ff9a93064d91451
+648, 0x50f3ea93f351a7ef
+649, 0x606fceccb07054de
+650, 0x7e83d6d2f8f6685d
+651, 0x78f3995291c5d407
+652, 0xd28d2460e22d0228
+653, 0x2c5636f68a0054dd
+654, 0xd9fafb1c56c8f6cb
+655, 0xe39889b5f9d74464
+656, 0x1355372bf5db2cc1
+657, 0x26768426b9ac323
+658, 0x4af1dbdc1111fd89
+659, 0x66973587943b927f
+660, 0xf86f5f50684dfb1d
+661, 0x1247d574ff79b534
+662, 0xc8039f3259210fe2
+663, 0x79b573235c92a9f5
+664, 0x213f642d8450e2f0
+665, 0x5db7706973376566
+666, 0x6182c12e69b373d7
+667, 0x3e5ac47300aec07f
+668, 0x4b5b6c57b1574376
+669, 0x6b7fcceefd56b17c
+670, 0xf656c3455cb9d4b8
+671, 0x7577e2e13329721f
+672, 0xf33c0c53ce956e8d
+673, 0x7d0f328ee356174
+674, 0x10ec9a168088686e
+675, 0x71ef1776d062dfa
+676, 0xaa7b590a488a6bc4
+677, 0x38612b6dd8049a1c
+678, 0x939045e36874f731
+679, 0xcb9d1d74c56d5ac9
+680, 0x54f1c1c8fef1d8ff
+681, 0x3ee4b85c8c7e939e
+682, 0xb9b4608e019f352c
+683, 0x79d4701275d12e6a
+684, 0x2632a2d9835c7f19
+685, 0x1662cd9fba293692
+686, 0xbcb70265115ee944
+687, 0xdc43fb9761468604
+688, 0xe3eec4e7d3871352
+689, 0x829531753226989d
+690, 0x2748cc67f540e074
+691, 0x39c4af25d607837d
+692, 0x741a243f4cb5df99
+693, 0xda1353287e18b49a
+694, 0xa6735689d751ea74
+695, 0x46326d587340ce0b
+696, 0xc18531df4550012b
+697, 0x6f7901e05dd4b818
+698, 0xfb966afc4c001d63
+699, 0x6dc10fca67a9cfdb
+700, 0xd6527ffadf0feaae
+701, 0x3b900172045e25d
+702, 0xb7dd594cdded6a46
+703, 0x6602aee7ec1599fc
+704, 0x7fbf12f23747546a
+705, 0x32e63f662bd2de0d
+706, 0xedf47770b67ed641
+707, 0x331bef83481c5c2a
+708, 0x8fc4256fdf05158c
+709, 0x98eba48dabccf5e0
+710, 0xdbc2f2cdb7b1c154
+711, 0x7777755616517ad3
+712, 0xd473c147d2628ac1
+713, 0x861e15d1d760b5a7
+714, 0xf4d25926405ecb07
+715, 0xb7739c69effff86e
+716, 0xe97fbafa6f96830c
+717, 0xf13e8a334e8bede1
+718, 0xcd60010cba4ee4f9
+719, 0x1f537ac2b82e6008
+720, 0x1fda8d781a89140a
+721, 0x9dc204f3f4a463f0
+722, 0x456dcd18eb56a1ab
+723, 0x629957bc87bd16a1
+724, 0x2c8000ddb8c75253
+725, 0xc31dae9ec8449284
+726, 0xdac05c8baa2b691a
+727, 0x21ff7be9ffa3e7ac
+728, 0x844f4b5ed4ee08d0
+729, 0x651f913fd636c994
+730, 0xca3e71a2110b2d49
+731, 0x7709bc42253ed09d
+732, 0xbb164d45b6569d43
+733, 0x90ec2f040c20a112
+734, 0xfa6e77e9166f5be4
+735, 0x6b6d12c1842d587d
+736, 0xfcd7ff8466e25e2a
+737, 0x6a5a2ed8bd971297
+738, 0x2ec35f6bba5adcbc
+739, 0xc83676e16651249a
+740, 0x458f6064cefe10ba
+741, 0x90d54d527e6cd028
+742, 0xa5613e88db27c388
+743, 0x331e0c7d85aa1abc
+744, 0x8cee4977e210358
+745, 0xfcae379aa6cbff8e
+746, 0xd1407afc97a57e86
+747, 0x1fab25c864f094ae
+748, 0xd914864a63004552
+749, 0x4214d226a20f1384
+750, 0x3f4e0d80c488b715
+751, 0xc5ca2f654024b7c8
+752, 0xc1e27a124e7c821c
+753, 0xd890a915ffc7918c
+754, 0x22fba040ce51a9f8
+755, 0xbf61cebd8891617a
+756, 0x7846609ee228e319
+757, 0x536d1854375509b8
+758, 0xbbfb45fc6e666f50
+759, 0xd85b4c0527f9d7d6
+760, 0x528cc9c7fa2a84c8
+761, 0x27a1baece647f2cb
+762, 0xfddf0cb92fe09dc3
+763, 0xeb5008fe965d8d96
+764, 0x4a3307937eb2e5c8
+765, 0xd07d74c240c6c363
+766, 0x16f62290179d1bbf
+767, 0xe99c9bcc9cb1ece7
+768, 0xc64f9be03c8a93be
+769, 0x32659effaf666c1f
+770, 0x4bb228cfb30b6672
+771, 0x98764870842068a5
+772, 0x5b12ef2d2cd8bdcc
+773, 0xbc79d1c1b41f28b8
+774, 0x97a517cf3279fc9a
+775, 0x34ffd46c1d4d6025
+776, 0x9c302307ee25c8f0
+777, 0x399604eed1f18a8
+778, 0x1c9b813c2043142a
+779, 0x2944ea5e55267fe9
+780, 0x5a8a9f5e728ea667
+781, 0x30c8440adb804a0
+782, 0xee0e6b627099a937
+783, 0x3d50757ada3c52da
+784, 0x4548916b32c813ab
+785, 0x602a186fe5bf109b
+786, 0xf0d440a2227ba304
+787, 0x5a10d4e0ca9ea32b
+788, 0x6e5eb90da13ba64c
+789, 0x4c6af8fd04241ab2
+790, 0xf9eb31d26e093006
+791, 0x5d674878839fe3ea
+792, 0x1562b55b2484e47c
+793, 0xa87188c099c1cb61
+794, 0xb7736b8aa02a3392
+795, 0x5f4b301125abb20f
+796, 0x361d566984637f44
+797, 0x68c4b3feac8bd0c3
+798, 0x7066c634dd2503c1
+799, 0xfecbf7c9441eb6ea
+800, 0xdbc26ae0fc81436b
+801, 0x9ef3e2b48252e7a4
+802, 0x31a49b4c339b37c7
+803, 0xb01b2a83cf346cf4
+804, 0xc24dc2347f82fbe3
+805, 0x134cad272dcd410f
+806, 0x61260742823ba59c
+807, 0x53ac4c193a97c730
+808, 0x9207c9833af34b52
+809, 0xa72e7ee77078d1f5
+810, 0x2e6f6e1b05936885
+811, 0x783b99ce5dbf9464
+812, 0xfdfeb6f0d027bb44
+813, 0x40eeb27096f92b0
+814, 0x5ef96ff5d4a4521f
+815, 0x5595806ae873718a
+816, 0x67d449eecf4ca1c3
+817, 0xde837ab611364f3f
+818, 0x7034c24d2b139be9
+819, 0xe21166603e0a9c86
+820, 0x935694435c1f0d51
+821, 0x6cb3bec90c126088
+822, 0x4096ef662b7a9f89
+823, 0xd2d85b8d238d8c15
+824, 0xa4ea533ce3ec59b2
+825, 0x3654729d80a2db29
+826, 0x214c4cc3906d29d4
+827, 0x201c447e7588e373
+828, 0xe8b8f0ae25f683eb
+829, 0x6744aaf5754e38af
+830, 0xd1ffb10d6f27a061
+831, 0xe536733a7b3a6c30
+832, 0x39f0f66e47cbf2c9
+833, 0x856a9593526fde2
+834, 0x2e2a817a0098ea4b
+835, 0xc5e1eeb551a0e3d3
+836, 0x3f21e2f5e2d50b2
+837, 0x906af56c66dd9f8c
+838, 0x30f6dbd70329fac8
+839, 0xc443dfddf3c01a60
+840, 0x7ab85d9aa9675470
+841, 0x8c9080bd39717bfc
+842, 0x4b1ccdb3c3597f6f
+843, 0x74e2542d70ab5d67
+844, 0xbb3d236aad00f74
+845, 0xcf3cadf9a2804774
+846, 0xe851d9750e42bd07
+847, 0xc0ad82029b1c371f
+848, 0x7ee119eb552d6c07
+849, 0xd8024049bd1d784a
+850, 0xfa67a899760363
+851, 0xaa7c2f438b178197
+852, 0xc473674a47ffe064
+853, 0x539fbe3fc674c270
+854, 0xdb48484748a76f3b
+855, 0xc73b2b092060d
+856, 0xa1d2a15345016f5d
+857, 0x4d0fe8599f9bba47
+858, 0xa0edc275e6f8f1d1
+859, 0x40590a8655bc8d72
+860, 0x35b4223161f05f75
+861, 0xa04c0c0f616752dc
+862, 0x7f371ed2ca45432d
+863, 0x2ff1a08f75ac6438
+864, 0xe2dc5c3682282f48
+865, 0xe1e4179fa98d9013
+866, 0x8cb083d6843a73d5
+867, 0xb4c2b5921b706854
+868, 0x738e14c0e7352445
+869, 0xcd2b646f91afd8c7
+870, 0xd5779a5b57a264fd
+871, 0xc39ff855586c7d07
+872, 0x3e3f0098c631a859
+873, 0x644e02fae032110
+874, 0xa8834613c0a45278
+875, 0x69482f2c08e10657
+876, 0xe4ee475bdb87e69a
+877, 0xdc1ef7b25c0d0019
+878, 0x88a3fa2be18d8744
+879, 0x60a02e0b21c5bec7
+880, 0xb6867b88aa19bc1a
+881, 0xb599409affcf10eb
+882, 0xaeaa1778a5e59daa
+883, 0xd7a91a52c16663e3
+884, 0x93cb269affe07b1c
+885, 0x841b6ced3a4ba815
+886, 0x84541768e1540a5c
+887, 0xe3943c84f83b3020
+888, 0x5de366fbd7b45258
+889, 0xd787cc3bde91a661
+890, 0x814071446edecb57
+891, 0x15d8c602a1141514
+892, 0x72f07bc8002d1d0d
+893, 0x4a8bd8dc9a1f0f3e
+894, 0x8723796ae0f20d35
+895, 0xda7283c2051f73b2
+896, 0x2df0cc247f90bd3b
+897, 0x79a8522b968f990a
+898, 0x951ede190c8b9d02
+899, 0xc512f1a5b14b018a
+900, 0xf0e3ddc03b9a4259
+901, 0x8cf4a35ad312e15f
+902, 0xebef28926b11094b
+903, 0x5628ba687325921c
+904, 0xc3aa75e57edc49c3
+905, 0xc38382fa98e762ba
+906, 0x8d209e896285848e
+907, 0x2c7d6adf592b4a3e
+908, 0x62de48e36f8338f3
+909, 0x4a752741e00de30e
+910, 0xf7855b70f1f6ec2b
+911, 0xa505fa4428199e43
+912, 0xe8b6b423b826bbac
+913, 0x4bd1206cf8786d05
+914, 0x6dcf040391fe3bf4
+915, 0x913f500f87e1bba3
+916, 0x5acf775aa180a5d5
+917, 0x74dd28d9432ce739
+918, 0x996c2ff2f0dc2495
+919, 0x73dbfe6c56effe4
+920, 0x56fddd25196f5e40
+921, 0xe87810158f5b7
+922, 0x7b8795e996383f1f
+923, 0x9ba5ee7c777c4c82
+924, 0x17ce3908d270fe1c
+925, 0x3df9e613c1aedfae
+926, 0xcdd26871b32fc8e1
+927, 0xd71cb13afc633979
+928, 0x63427c8ea9b1c79e
+929, 0xd070f7664d3b405d
+930, 0x46f2a9e32d9fb769
+931, 0xb4c3822a45e9fe9b
+932, 0x8ba30b97fe6f5ec7
+933, 0x70aa554ee2fc11f9
+934, 0xa80c99dbe0cfcfaf
+935, 0x36d9250cb2d68ed
+936, 0x2995e4b9e1cd1db4
+937, 0x4b3803ba57fc570f
+938, 0xae3959e7d740eaa5
+939, 0xb4cbd6662adbae08
+940, 0xae46576446e8dbc4
+941, 0xc4828e008a9a8a54
+942, 0x145d7db8e6554b2f
+943, 0x1b1b8916a730c371
+944, 0xdaf84b2bebe31963
+945, 0x5b59b80ef23a2403
+946, 0x9180c7e89cab6fd3
+947, 0x80e58f5411babf34
+948, 0xa06cf55185b9b005
+949, 0x13b2c798424173ad
+950, 0xc510f8e706311d49
+951, 0x1f974b83b6046d3a
+952, 0xae6e8e85e822d1c3
+953, 0x66f2c8dc3274a31a
+954, 0x7e04dbcbf65bd377
+955, 0xabf41ede01ec20a4
+956, 0x5efa0948f6bbb2ea
+957, 0xbc91c99d8592255
+958, 0xf6d6917911d86d75
+959, 0x85ce273d54e9097a
+960, 0xbdfd30f2420fff92
+961, 0x8802f02f610b537c
+962, 0xd1d70037ed543229
+963, 0x908aaf97f9693a46
+964, 0x1f6cfeaa0834d53a
+965, 0xa453fd1648ce04d2
+966, 0x2c38bb85ebc64af9
+967, 0xd2daff551c90c4f8
+968, 0xae5a0d949797d784
+969, 0xf0974c8552ac9593
+970, 0xa10b70499f65c693
+971, 0x39a449ebd594ddff
+972, 0x8ea090f2b17b9b49
+973, 0xc592de318090fd83
+974, 0xb63e4fbc467b6912
+975, 0x57a0c1c5ce0e4dcc
+976, 0xa7c517cf3d436b35
+977, 0xef6dcb0f3fad038b
+978, 0xaf4fb60315b91287
+979, 0x5e0776f67304f331
+980, 0xe927753b8e6f7932
+981, 0xd3df2dd92559e304
+982, 0xdaed52aa6af44413
+983, 0x1b59f4dac1e181f8
+984, 0x4a73c2293877ef39
+985, 0xca45d0d015fe44de
+986, 0x4659c8b7853735a8
+987, 0x12de6466bdf8adeb
+988, 0xaeea857a09bfec15
+989, 0xcc9cf4b3c0b88a23
+990, 0xa44ae52396a5e1bf
+991, 0x5847a724305d137f
+992, 0x8f4d4de223956182
+993, 0x58254dfada867a8
+994, 0x900a98222c2f339e
+995, 0xdb575260935d51d5
+996, 0x13fb4bfbbc0d7b53
+997, 0x62213850186bb92b
+998, 0x2a34823312c00388
+999, 0x6148329042f743b0
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-1.csv b/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-1.csv
new file mode 100644
index 000000000..e448cbf73
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-1.csv
@@ -0,0 +1,1001 @@
+seed, 0xdeadbeaf
+0, 0xedc95200e2bd66a5
+1, 0x581d4e43b7682352
+2, 0x4be7278f5e373eab
+3, 0xee47f17991a9e7ea
+4, 0x38a7d2ae422f2e2c
+5, 0xe2a6730a3b4a8a15
+6, 0x1588b7a841486442
+7, 0x13ad777246700504
+8, 0x14d157e0f5e18204
+9, 0xd87c22a7ee8c13f1
+10, 0x30cc389ce3542ba1
+11, 0xb8a53348955bb2e9
+12, 0xc08802e3c454f74f
+13, 0xb444f627671a5780
+14, 0x4b6dd42b29cbf567
+15, 0x6109c7dc0bc5f7d5
+16, 0x85c954715d6b5b1e
+17, 0x646178d3d9a3a5d5
+18, 0xebbde42b1cd83465
+19, 0x3d015102f6bc9c1a
+20, 0x720fe2ec3798d5fd
+21, 0x93120961289ceb2e
+22, 0xc9207e960a56fae2
+23, 0xa7f042f31d991b98
+24, 0x5fac117415fae74b
+25, 0xd0a970ba8dddc287
+26, 0x84b4e7e51b43106
+27, 0x6ad02bf525ea265f
+28, 0xcdc7e5992b36ef8f
+29, 0x44d4985209261d60
+30, 0x628c02d50f4b902e
+31, 0xc7b1914922d1e76d
+32, 0xfde99ff895cba51d
+33, 0x175a0be050fa985f
+34, 0x47297d3699e03228
+35, 0xccf1e9aeaa3339cd
+36, 0x9fdd18ebeeaf15b1
+37, 0x7c94c9ab68747011
+38, 0x612d8ef22c1fa80f
+39, 0x13f52b860de89ab5
+40, 0x81f264b8c139c43b
+41, 0x8d017ba4ef1e85ba
+42, 0x6d0556f46219951e
+43, 0x8ee7b85663cf67b6
+44, 0x2432fc707645fe67
+45, 0xaf814046051e5941
+46, 0x4d432a83739ac76f
+47, 0x59e5060d0983ccdd
+48, 0xdd20e828b83d9b53
+49, 0x1b891800d7385f4c
+50, 0x10e86a026c52ff5e
+51, 0xb932f11723f7b90c
+52, 0xb2413d0a1f3582d0
+53, 0xe7cd4edda65fc6b5
+54, 0x6d3808848d56593b
+55, 0x192a727c3c7f47d9
+56, 0x9659d8aea5db8c16
+57, 0x4242c79fe2c77c16
+58, 0x605f90c913827cea
+59, 0x53e153c8bfc2138a
+60, 0xed2158fbdef5910e
+61, 0xae9e6e29d4cb5060
+62, 0x7dd51afaad3b11ce
+63, 0x2b9ba533d01a5453
+64, 0x7e0e9cf2b6c72c8
+65, 0x1cc8b3c7747ed147
+66, 0x9b102651e2e11b48
+67, 0x30b0b53cbaac33ea
+68, 0x70c28aec39b99b85
+69, 0x5f1417ff536fdb75
+70, 0x3a1d91abd53acf58
+71, 0xba116a1772168259
+72, 0xf5369bc9bd284151
+73, 0x67bf11373bf183ca
+74, 0xef0b2d44dbd33dc7
+75, 0xbfd567ee1a2953ed
+76, 0x7d373f2579b5e5c6
+77, 0x756eeae7bcdd99be
+78, 0x75f16eb9faa56f3b
+79, 0x96d55ded2b54b9a5
+80, 0x94495191db692c24
+81, 0x32358bdd56bab38c
+82, 0x3f6b64078576579
+83, 0x7177e7948bc064c9
+84, 0x2cbf23f09ba9bc91
+85, 0x9b97cc31c26645f5
+86, 0x5af2d239ff9028b1
+87, 0x316fa920e0332abe
+88, 0x46535b7d1cae10a0
+89, 0x21f0a6869298022c
+90, 0xf395c623b12deb14
+91, 0x8573995180675aa7
+92, 0xc3076509f4dc42d5
+93, 0x15e11e49760c6066
+94, 0xe8a6d311e67a021d
+95, 0x7482f389c883339b
+96, 0xda6f881573cba403
+97, 0xb110ffb847e42f07
+98, 0x2c3393140605ccf9
+99, 0xba1c8ba37d8bdc33
+100, 0x59adf43db7a86fe0
+101, 0xb4fcbf6aa585ca85
+102, 0xd794a93c18033fa6
+103, 0x6e839c01985f9d4
+104, 0x64065bf28222b2c7
+105, 0x6a6359b293fa0640
+106, 0x5ff610969e383e44
+107, 0xa8172c263f05c7f7
+108, 0x62a0172e8bd75d07
+109, 0x7be66e3c453b65ac
+110, 0x6a3b8d5a14014292
+111, 0xa2583e6087450020
+112, 0xd5d3ecc480c627d2
+113, 0xa24e83f1eec8a27c
+114, 0xa23febd2a99ee75a
+115, 0x9a5fbf91c7310366
+116, 0x5b63156932e039b
+117, 0x942af3c569908505
+118, 0x89a850f71ab6a912
+119, 0xfeadc803ac132fe9
+120, 0x67bf60e758250f3
+121, 0x533c25103466a697
+122, 0xb7deede3482f9769
+123, 0x325e043b53bba915
+124, 0x9e8d9e7fde132006
+125, 0x6bacc6860bbc436e
+126, 0xb3ea0534c42b1c53
+127, 0xb2389334db583172
+128, 0xa74b1bfbf5242ee4
+129, 0x53a487e2dc51d15c
+130, 0xe5a3b538d2c7a82e
+131, 0x7b6c70bb0c4cadaf
+132, 0xae20791b2081df1
+133, 0xc685c12e3c61d32c
+134, 0x60110e6b0286e882
+135, 0x49682119c774045c
+136, 0x53dc11a3bbd072e
+137, 0xbdc87c6e732d9c2d
+138, 0xcc4620861ebac8fd
+139, 0x7e9c3558759350cc
+140, 0x157408dee34891ba
+141, 0x9bcad1855b80651b
+142, 0xd81b29141d636908
+143, 0x1ed041a9f319c69d
+144, 0x805b2f541208b490
+145, 0x484ef3bba2eb7c66
+146, 0xb6b5e37d50a99691
+147, 0xabc26a7d9e97e85f
+148, 0xcba2a3cce0417c2f
+149, 0xa030dfffd701993c
+150, 0x2bf2dc50582ebf33
+151, 0xd9df13dd3eb9993e
+152, 0x31ca28b757232ae5
+153, 0x614562a0ccf37263
+154, 0x44d635b01725afbb
+155, 0x5ae230bc9ca9cd
+156, 0xb23a124eb98705c6
+157, 0x6395675444981b11
+158, 0xd97314c34119f9ca
+159, 0x9de61048327dd980
+160, 0x16bac6bded819707
+161, 0xcea3700e3e84b8c7
+162, 0xaa96955e2ee9c408
+163, 0x95361dcc93b5bc99
+164, 0x306921aed3713287
+165, 0x4df87f3130cd302a
+166, 0x37c451daeb6a4af5
+167, 0x8dbbe35f911d5cc1
+168, 0x518157ce61cb10f9
+169, 0x669f577aebc7b35b
+170, 0x4b0a5824a8786040
+171, 0x519bc3528de379f5
+172, 0x6128012516b54e02
+173, 0x98e4f165e5e6a6dd
+174, 0x6404d03618a9b882
+175, 0x15b6aeb3d9cd8dc5
+176, 0x87ed2c1bae83c35b
+177, 0x8377fc0252d41278
+178, 0x843f89d257a9ba02
+179, 0xcdda696ea95d0180
+180, 0xcfc4b23a50a89def
+181, 0xf37fd270d5e29902
+182, 0xafe14418f76b7efa
+183, 0xf984b81577076842
+184, 0xe8c60649ccb5458d
+185, 0x3b7be8e50f8ff27b
+186, 0xaa7506f25cef1464
+187, 0x5e513da59f106688
+188, 0x3c585e1f21a90d91
+189, 0x1df0e2075af292a
+190, 0x29fdd36d4f72795f
+191, 0xb162fe6c24cb4741
+192, 0x45073a8c02bd12c4
+193, 0xcbaaa395c2106f34
+194, 0x5db3c4c6011bc21c
+195, 0x1b02aac4f752e377
+196, 0xa2dfb583eb7bec5
+197, 0xfe1d728805d34bb1
+198, 0xf647fb78bb4601ec
+199, 0xd17be06f0d1f51ef
+200, 0x39ec97c26e3d18a0
+201, 0xb7117c6037e142c8
+202, 0xe3a6ce6e6c71a028
+203, 0xe70a265e5db90bb2
+204, 0x24da4480530def1e
+205, 0xfd82b28ce11d9a90
+206, 0x5bf61ead55074a1d
+207, 0xbe9899c61dec480d
+208, 0xae7d66d21e51ec9e
+209, 0x384ee62c26a08419
+210, 0x6648dccb7c2f4abf
+211, 0xc72aa0c2c708bdc9
+212, 0x205c5946b2b5ba71
+213, 0xd4d8d0b01890a812
+214, 0x56f185493625378d
+215, 0x92f8072c81d39bd0
+216, 0xa60b3ceecb3e4979
+217, 0xfcf41d88b63b5896
+218, 0xf5a49aa845c14003
+219, 0xffcc7e99eee1e705
+220, 0xdd98312a7a43b32d
+221, 0xa6339bd7730b004
+222, 0xdac7874ba7e30386
+223, 0xadf6f0b0d321c8
+224, 0x126a173ae4ffa39f
+225, 0x5c854b137385c1e7
+226, 0x8173d471b1e69c00
+227, 0x23fa34de43581e27
+228, 0x343b373aef4507b1
+229, 0xa482d262b4ea919c
+230, 0xf7fbef1b6f7fbba
+231, 0xd8ce559487976613
+232, 0xbf3c8dd1e6ebc654
+233, 0xda41ed375451e988
+234, 0xf54906371fd4b9b3
+235, 0x5b6bb41231a04230
+236, 0x866d816482b29c17
+237, 0x11315b96941f27dc
+238, 0xff95c79205c47d50
+239, 0x19c4fff96fbdac98
+240, 0xbfb1ae6e4131d0f4
+241, 0x9d20923f3cdb82c9
+242, 0x282175507c865dff
+243, 0xdfd5e58a40fe29be
+244, 0xedbd906ff40c8e4f
+245, 0x11b04fc82614ccb3
+246, 0xeceb8afda76ae49f
+247, 0xa4856913847c2cdf
+248, 0x6f1425f15a627f2a
+249, 0xdf144ffedf60349e
+250, 0x392d7ecfd77cc65f
+251, 0x72b8e2531049b2c6
+252, 0x5a7eb2bdb0ec9529
+253, 0xdcfd4306443e78c1
+254, 0x89ad67ed86cd7583
+255, 0x276b06c0779a6c8f
+256, 0xb2dbb723196a0ac3
+257, 0x66c86a3b65906016
+258, 0x938348768a730b47
+259, 0x5f5282de938d1a96
+260, 0xa4d4588c4b473b1f
+261, 0x8daed5962be4796f
+262, 0x9dde8d796985a56e
+263, 0x46be06dbd9ed9543
+264, 0xdf98286ceb9c5955
+265, 0xa1da1f52d7a7ca2b
+266, 0x5a7f1449f24bbd62
+267, 0x3aedc4e324e525fd
+268, 0xced62464cd0154e1
+269, 0x148fc035e7d88ce3
+270, 0x82f8878948f40d4c
+271, 0x4c04d9cdd6135c17
+272, 0xdf046948d86b3b93
+273, 0x2f0dec84f403fe40
+274, 0xa61954fb71e63c0d
+275, 0x616d8496f00382e8
+276, 0x162c622472746e27
+277, 0x43bcfe48731d2ceb
+278, 0xff22432f9ff16d85
+279, 0xc033ed32bb0ad5a4
+280, 0x5d3717cc91c0ce09
+281, 0x7a39a4852d251075
+282, 0x61cd73d71d6e6a6
+283, 0xe37e2ea4783ab1a5
+284, 0x60e1882162579ea8
+285, 0x9258ec33f1a88e00
+286, 0x24b32acf029f0407
+287, 0x1410fc9aea6d3fac
+288, 0x6054cf2a3c71d8f7
+289, 0x82f7605157a66183
+290, 0x3b34c1c0dff9eac5
+291, 0xfebe01b6d5c61819
+292, 0x7372187c68b777f2
+293, 0xc6923812cda479f0
+294, 0x386613be41b45156
+295, 0x92cfebe8cc4014b
+296, 0x8e13c4595849828b
+297, 0x90e47390d412291f
+298, 0x6b21a1d93d285138
+299, 0xbf5b1f5922f04b12
+300, 0x21e65d1643b3cb69
+301, 0xf7683b131948ac3c
+302, 0xe5d99fc926196ed2
+303, 0x7b138debbec90116
+304, 0x8a2650a75c2c2a5c
+305, 0x20689a768f9b347b
+306, 0xdfa2900cfb72dc6e
+307, 0x98959c3855611cc2
+308, 0x5fdb71b89596cc7c
+309, 0x1c14ac5c49568c7b
+310, 0x958c4293016091fe
+311, 0x7484522eb0087243
+312, 0xc4018dfb34fc190f
+313, 0xca638567e9888860
+314, 0x102cd4805f0c0e89
+315, 0xcc3bc438e04548f8
+316, 0xb808944bb56ea5be
+317, 0xffd4778dbf945c57
+318, 0xfe42617784c0233b
+319, 0x3eccbfeae9b42d3c
+320, 0xd9f1b585fd0bfa60
+321, 0x5c063d1b2705d5dd
+322, 0x8e8bec3519941b64
+323, 0x9e94c36cbec2a42
+324, 0x1cd19f5b64ffd3ad
+325, 0x9632e3aebfc68e66
+326, 0x98960c2d9da4ae45
+327, 0xb76994b1f2bbfc1f
+328, 0xca184a737d3971cc
+329, 0x964d31b07183adfb
+330, 0xe9e0ff351cd276d4
+331, 0xb5747c860b05bbe4
+332, 0x5549ddc3bd3862e2
+333, 0x495496677b27873b
+334, 0x53910baa26e3ea18
+335, 0xaa07a07ad0a688d3
+336, 0xbb43bd1f09ecdb1e
+337, 0xe2ebc105699dd84
+338, 0x6e815a2729584035
+339, 0x2caab1713b17948a
+340, 0x43d39d209fa41c90
+341, 0xfe3e71089d5d1c3a
+342, 0xa778646c32f81177
+343, 0x8d42bfb86e6e92d5
+344, 0x175571f70b4fcfbe
+345, 0x2a66a6fe10dc3b5b
+346, 0xd9545e85235ca709
+347, 0x5642781c77ced48a
+348, 0x24facc40b72ccd09
+349, 0xa800fbacce33f6f8
+350, 0x675f58a0ff19fba
+351, 0x35aedf57bb5cde1b
+352, 0xe5535a6b63f6d068
+353, 0x84dffd0102aaa85d
+354, 0x621faad65467aaa7
+355, 0x596ad85b556b112f
+356, 0x837545fff8894c7a
+357, 0x3d9a4ae1356bc6a6
+358, 0xcd8b7153205d4ad0
+359, 0x98afdd40f1ed09a6
+360, 0xa38b2dc55a5cf87f
+361, 0x484aecce2b6838bc
+362, 0x6af05c26bdab18d9
+363, 0xf418b7399dcf2e4b
+364, 0x1cfa38789b0d2445
+365, 0xfbed23c34166ee67
+366, 0x38e6820039e4912a
+367, 0x1fe94911e963591e
+368, 0x1291c79aee29ad70
+369, 0x65eccfc89506f963
+370, 0x7d14de3b2f55b1f6
+371, 0x82eb79c36cd2a739
+372, 0x41ffe3b75ea0def5
+373, 0x9eba9156470a51d9
+374, 0xd17c00b981db37d1
+375, 0xf688769a75601aa7
+376, 0xbcf738e9e03d571e
+377, 0x14712e56df8f919b
+378, 0xab14e227d156e310
+379, 0xf53d193e993e351e
+380, 0x857fae46bd312141
+381, 0xc2dd71e41b639966
+382, 0x74f8b987a3d00ad1
+383, 0x5bce8526dc527981
+384, 0x94910926c172a379
+385, 0x503c45557688a9d5
+386, 0x244d03834e05807f
+387, 0x6e014cbab9c7a31f
+388, 0xae544c638530facf
+389, 0x9b853aaaf9cbc22d
+390, 0xfb42ab7024d060ed
+391, 0x74cc3fba0dfd7ff2
+392, 0x24ec9e8f62144ad5
+393, 0x72f082954307bbe7
+394, 0x36feda21bbf67577
+395, 0x3222191611b832f1
+396, 0xd0584e81bcac8b0b
+397, 0xdce8d793ef75e771
+398, 0x978824c6c2578fc
+399, 0x6e8f77503b3c2ee4
+400, 0xc85d2d86fecf5d03
+401, 0x3d35b4a5d4d723c4
+402, 0xd3987dfd4727fff3
+403, 0xd3cde63fb6a31add
+404, 0xf6699e86165bdaeb
+405, 0x9d60ba158ec364c4
+406, 0x920c3c18b346bfc9
+407, 0x770fd1fdfbc236ca
+408, 0x45998cfc5fc12ddd
+409, 0xd74a3454e888834b
+410, 0xbf2aa68081a4a28f
+411, 0xea41b26a6f1da1b3
+412, 0x5560a2d24b9d5903
+413, 0xe3791f652a228d8b
+414, 0x365116d3b5a8520c
+415, 0xb1b2bd46528f8969
+416, 0xfcfe14943ef16ae7
+417, 0xf4d43425e8a535dc
+418, 0xe6cf10a78782a7e0
+419, 0x9c7ac0de46556e3e
+420, 0xc667ae0856eed9ef
+421, 0x47dbb532e16f9c7e
+422, 0xdf4785a5d89ee82e
+423, 0xbd014925ce79dbcf
+424, 0xea0d663fb58fa5be
+425, 0x51af07d5cc3821fb
+426, 0x27a1bdcdc4159a9d
+427, 0x520c986c59b1e140
+428, 0x50b73fd9bacd5b39
+429, 0xae5240641f51e4f3
+430, 0x71faecc164ed9681
+431, 0xda95aa35529a7ee
+432, 0xe25ba29b853c1c6d
+433, 0x9871a925cda53735
+434, 0xde481ad8540e114d
+435, 0xa2997f540e8abca0
+436, 0xc9683c5035e28185
+437, 0x1082471b57182bac
+438, 0xbd3ecf0f0b788988
+439, 0xf479760776fbb342
+440, 0x3730929200d91f44
+441, 0xc1762d79ae72809c
+442, 0xfaa0a4c7b1686cb3
+443, 0xd581e6d55afdafcd
+444, 0x6cf57bdfba2dcf6d
+445, 0xdef79d9fe6a5bcef
+446, 0x13ed376e18132bd3
+447, 0xbe67efd72defa2a
+448, 0x5acc176c468966ea
+449, 0x8b35b626af139187
+450, 0x446de3fac0d973ac
+451, 0xe1d49e06dc890317
+452, 0x817bc3fd21fc09b7
+453, 0xb71c3958a13d5579
+454, 0x8746e010f73d7148
+455, 0x1b61c06009922e83
+456, 0xba17e62e6b092316
+457, 0x1375fa23c4db8290
+458, 0x3f071230f51245a6
+459, 0x51c99a086a61cd13
+460, 0x5f0f2ae78589e1fd
+461, 0x604834e114bbbc27
+462, 0x5eb2a7a34814e9a9
+463, 0x77a6907f386bf11e
+464, 0x99525de2bd407eeb
+465, 0xb818348c57b3b98f
+466, 0x25f5f9e702fbe78d
+467, 0x8f66669e6f884473
+468, 0x1e47d46e2af4f919
+469, 0xf6a19df846476833
+470, 0xff00c67bcd06621f
+471, 0xe3dfe069795d72d8
+472, 0x8affc88b2fea4d73
+473, 0x66df747e5f827168
+474, 0xf368ec338d898a0e
+475, 0x9e1f1a739c5984a2
+476, 0x46a1c90e1ca32cbc
+477, 0xc261bc305ed8d762
+478, 0x754d7949f7da9e72
+479, 0x4c8fbbb14ef47b17
+480, 0xccbdc67a3848d80d
+481, 0x3c25e6f58bae751d
+482, 0x7078b163b936d9b6
+483, 0x440e27463c134ecf
+484, 0x6c83ee39f324db0f
+485, 0x27cf901b22aea535
+486, 0x57262dec79a3f366
+487, 0x91db09f1dbb524fb
+488, 0xd7436eefba865df2
+489, 0x16c86b0a275a3f43
+490, 0x689493e6681deaa9
+491, 0x7e1dc536c1a9ac42
+492, 0x1145beac3ac7f5cc
+493, 0x3d05e211a104b2b0
+494, 0x4f9e77ced3c52f44
+495, 0x53de1369354add72
+496, 0x1fb60f835f47cdeb
+497, 0x6ab36f089e40c106
+498, 0xaabffcb0d3d04c7
+499, 0xaa399686d921bd25
+500, 0x2bf8dd8b6d6fa7f0
+501, 0x1ddbf4e124329613
+502, 0x466a740241466a72
+503, 0x98d7381eb68a761
+504, 0x817691510bc4857a
+505, 0x8837622c0171fe33
+506, 0xcba078873179ee16
+507, 0x13adad1ab7b75af4
+508, 0x3bac3f502428840c
+509, 0xbeb3cce138de9a91
+510, 0x30ef556e40b5f0b4
+511, 0x19c22abdf3bbb108
+512, 0x977e66ea4ddc7cf
+513, 0x9f4a505f223d3bf3
+514, 0x6bc3f42ac79ec87b
+515, 0x31e77712158d6c23
+516, 0x6d8de4295a28af0d
+517, 0xee1807dbda72adb7
+518, 0xda54140179cd038f
+519, 0x715aa5cdac38e062
+520, 0x5a7e55e99a22fa16
+521, 0xf190c36aa8edbe4f
+522, 0xccadd93a82c1d044
+523, 0x7070e6d5012c3f15
+524, 0x50a83341a26c1ba5
+525, 0x11bca7cc634142e5
+526, 0x623a0d27867d8b04
+527, 0x75c18acff54fbf6e
+528, 0x455ae7d933497a6f
+529, 0xf624cf27d030c3d3
+530, 0x7a852716f8758bac
+531, 0xe7a497ac1fa2b5b4
+532, 0xf84f097498f57562
+533, 0xc4bb392f87f65943
+534, 0x618e79a5d499fbfb
+535, 0xb3c0b61d82b48b8
+536, 0x4750a10815c78ea7
+537, 0x9cf09cca3ddece69
+538, 0x2a69f1c94cc901a2
+539, 0x347a0e446e1ce86d
+540, 0xb06f3a5a5ab37bb1
+541, 0x8035bd0713d591db
+542, 0x539c9637042c3a1f
+543, 0xd7ba4dc6b273cbd7
+544, 0x12f3f99933444f85
+545, 0x4a9517b9783fb9a4
+546, 0x6422b2ea95093bc5
+547, 0x3a5ecff0f996c2a6
+548, 0x31de504efc76a723
+549, 0x7ccb7c5233c21a9f
+550, 0xc687d9e6ce4186e8
+551, 0x6e40769d6940376a
+552, 0xf51207314f1f7528
+553, 0x67ee3acb190865e3
+554, 0xe08d586270588761
+555, 0xe387fa489af1a75c
+556, 0x73414a52d29d8375
+557, 0x671a38191cf2a357
+558, 0xe00fb25b1aa54008
+559, 0x11a0610e22cf549b
+560, 0xc90cc865d57c75be
+561, 0x90d0863cc15f2b79
+562, 0x8b3e60d32ebcb856
+563, 0xb28cc55af621e04a
+564, 0xcf60bd3cb2a5ab1d
+565, 0x212cb5d421948f86
+566, 0xee297b96e0a3363f
+567, 0x4e9392ff998760d1
+568, 0x61940c8d0105ba3e
+569, 0x14ebcbae72a59a16
+570, 0xdf0f39a3d10c02af
+571, 0xfc047b2b3c1c549d
+572, 0x91718b5b98e3b286
+573, 0x9ea9539b1547d326
+574, 0x7a5a624a89a165e6
+575, 0x145b37dcaa8c4166
+576, 0x63814bbb90e5616c
+577, 0xc4bc3ca6c38bb739
+578, 0x853c3a61ddc6626c
+579, 0xa7ce8481c433829a
+580, 0x8aff426941cc07b
+581, 0x2dc3347ca68d8b95
+582, 0xce69f44f349e9917
+583, 0x2fa5cb8aca009b11
+584, 0xf26bb012115d9aca
+585, 0xafa01c2f2d27235a
+586, 0xabcba21f1b40305e
+587, 0xfec20c896c0c1128
+588, 0xc5f7a71ebacadfa0
+589, 0xc8479ad14bab4eef
+590, 0xad86ec9a3e7d3dc
+591, 0xbbecd65292b915c5
+592, 0xb1f9e28149e67446
+593, 0x708d081c03dad352
+594, 0xaa8a84dbd1de916c
+595, 0x9aa3efb29ba9480b
+596, 0xd3c63969ff11443e
+597, 0x1e9e9ac861315919
+598, 0x4fe227f91e66b41d
+599, 0xefc0212d43d253ab
+600, 0x98341437727c42d1
+601, 0x5ea85c0fe9008adc
+602, 0x7891b15faa808613
+603, 0x32db2d63989aacfd
+604, 0xc92f7f28e88fd7bc
+605, 0x3513545eb6549475
+606, 0x49abe0082906fbf8
+607, 0xcee1e1a6551e729c
+608, 0x38556672b592a28e
+609, 0xc3e61409c4ec2d45
+610, 0x96c67ce2995a0fd4
+611, 0x9b9b0cada870293
+612, 0x82d6dd5dada48037
+613, 0xeea4f415299f1706
+614, 0x371107895f152ab3
+615, 0x2f6686159f4396bb
+616, 0x61005a2ff3680089
+617, 0x9d2f2cafb595e6b6
+618, 0x4a812a920f011672
+619, 0x317554d3a77385d7
+620, 0x24c01086727eb74b
+621, 0xa15ff76d618a3a9e
+622, 0x2121bfd983859940
+623, 0x384d11577eea8114
+624, 0xab0f4299f3c44d88
+625, 0x136fd4b07cfa14d9
+626, 0x665fe45cbfaa972a
+627, 0x76c5a23398a314e9
+628, 0x5507036357ccda98
+629, 0xd9b8c5ac9dce632b
+630, 0x366bc71781da6e27
+631, 0xdd2b2ba1d6be6d15
+632, 0xf33ed0d50ea6f1a6
+633, 0xf05a9b1900174c18
+634, 0x3947e1419e2787cf
+635, 0x6c742b1e029637d0
+636, 0x32aba12196a0d2e8
+637, 0x1b94aab2e82e7df
+638, 0x68b617db19229d6
+639, 0x6c88a95ac0a33f98
+640, 0xdc9b95fd60c2d23e
+641, 0x999e6971d3afc8b3
+642, 0x7071fc6ad8b60129
+643, 0x41a8184ef62485f6
+644, 0xb68e0605c7d5e713
+645, 0x272b961a1d1bbee
+646, 0x23f04e76446187b0
+647, 0x999a7a8f6d33f260
+648, 0xdbd6318df4f168d
+649, 0x8f5e74c84c40711e
+650, 0x8ccc6b04393a19d6
+651, 0xadcd24b782dd8d3d
+652, 0x1a966b4f80ef9499
+653, 0xcb6d4f9ff5a280f0
+654, 0x8095ff2b8484018a
+655, 0xbfd3389611b8e771
+656, 0x278eb670b7d12d51
+657, 0x31df54ca8d65c20f
+658, 0x121c7fb38af6985e
+659, 0x84fb94f38fe1d0a
+660, 0x15ae8af1a6d48f02
+661, 0x8d51e4a62cba1a28
+662, 0x58e6b6b3ae0f9e42
+663, 0x9365a0a85669cc99
+664, 0xe56e92f65a2106df
+665, 0x68fa299c66b428fc
+666, 0x55e51bb0b0a832c6
+667, 0x48b565293f9bc494
+668, 0x73d8132b1cbabb57
+669, 0x9178ac3926c36cbc
+670, 0xe2f22c7b28ea5e0f
+671, 0x6af45322a99afb12
+672, 0x59072fcb486a46f4
+673, 0x166b717b08d3d8e
+674, 0xd4e627a2dfacc4ab
+675, 0x33dad6f2921dedaa
+676, 0x4b13b806834a6704
+677, 0xe5f7971b398ed54d
+678, 0x20bfae65e3e6899b
+679, 0x881dab45d2b4fc98
+680, 0x6f248126b5b885be
+681, 0x7aeb39e986f9deee
+682, 0xf819f9574b8c3a03
+683, 0xff3d93ed6bd9781a
+684, 0x3a31e2e24a2f6385
+685, 0x7888a88f8944a5e
+686, 0x4faee12f5de95537
+687, 0x7f3e4efccdb2ed67
+688, 0x91e0f2fc12593af5
+689, 0xb5be8a4b886a40d3
+690, 0x998e8288ac3a9b1b
+691, 0x85c48fc8b1349e7b
+692, 0xf03af25222d8fae5
+693, 0x45467e805b242c2e
+694, 0xa2350db793dbebdc
+695, 0xfebe5b61d2174553
+696, 0xa9a331f02c54ad0b
+697, 0xe94e49a0f905aef3
+698, 0xe54b4c812b55e3da
+699, 0xdc454114c6bc0278
+700, 0x99c7765ab476baa2
+701, 0xccd9590e47fdff7c
+702, 0xfa2bcae7afd6cb71
+703, 0x2c1bf1a433a6f0f7
+704, 0x53882c62ff0aab28
+705, 0x80ac900f844dacc
+706, 0x27ba8eb5c4a44d54
+707, 0x78f3dfb072a46004
+708, 0x34e00e6ec629edce
+709, 0x5b88d19b552d1fbd
+710, 0xe4df375dc79df432
+711, 0x37446312ff79c3b4
+712, 0xb72256900a95fa6d
+713, 0x89f3171fbdff0bfc
+714, 0xd37885b048687eba
+715, 0xbb033213b283b60e
+716, 0xcf10b523ee769030
+717, 0xbf8070b6cfd7bafb
+718, 0xb7194da81fd1763b
+719, 0xbfc303de88e68d24
+720, 0xb949c7a5aea8a072
+721, 0x844216e7bae90455
+722, 0xf1e7f20840049a33
+723, 0x96e3263ad0cae794
+724, 0x10772d51f6e9ba49
+725, 0xcea24fccae9d23b3
+726, 0xefd378add9dde040
+727, 0xba0c7c5275805976
+728, 0x2e2a04608f64fa8c
+729, 0xafb42ec43aa0fa7
+730, 0x30444b84241ac465
+731, 0x19ef384bac4493ab
+732, 0xfd1ac615d3ba5ab9
+733, 0x6cc781ba38643aff
+734, 0x30ff27ebed875cfd
+735, 0xee1a261aca97ae62
+736, 0xc5a92715202bc940
+737, 0x9e6ec76f93c657ff
+738, 0x9b9fd55f55191ca5
+739, 0x654b13af008d8f03
+740, 0x1b7f030d9bd0719f
+741, 0x6d622e277550cb7f
+742, 0x3f8ee6b8830d0538
+743, 0x475462bcd0de190f
+744, 0x21380e8a513bdbcd
+745, 0x629bf3771b1bd7a4
+746, 0x3b5fd0b62c353709
+747, 0xf95634006ec3867e
+748, 0x1be8bb584a6653c2
+749, 0x2e2d3cfa85320ce8
+750, 0x5b904b692252d11d
+751, 0x4bfd76631d527990
+752, 0xc019571ca2bec4a0
+753, 0xf2eb730cea4cd751
+754, 0xd4571d709530191a
+755, 0x3b5bd947061f5a7d
+756, 0x56e2322cd2d1d1c0
+757, 0xa8830a5f62019f83
+758, 0x901d130c1b873cf3
+759, 0xb5dd29b363c61299
+760, 0xbb710bec3a17b26d
+761, 0xc0c464daca0f2328
+762, 0x4dc8055df02650f5
+763, 0x3d3cd9bbe8b957af
+764, 0xdb79612c2635b828
+765, 0xe25b3a8ad8fa3040
+766, 0xd5875c563cbf236b
+767, 0x46861c1c3849c9bc
+768, 0xf84bf1a2814dff43
+769, 0x6d8103902e0ad5e6
+770, 0x99f51c9be8af79e5
+771, 0xb0bfa8540ff94a96
+772, 0xaf45109a4e06f7d0
+773, 0x281df3e55aea9bfc
+774, 0x6a1155ca8aa40e60
+775, 0x754d32c5de1f5da
+776, 0xce1eafb1c6ca916f
+777, 0xc4f2185fa8577bd1
+778, 0x4a188e9bdb5501d9
+779, 0xbb14107e99bd5550
+780, 0xf0381d8425ec2962
+781, 0x213dbfffc16ec4f6
+782, 0x7a999c5a28ea65bc
+783, 0x23758c2aba7709ff
+784, 0xea7e4bb205e93b44
+785, 0x9c5a31e53911c658
+786, 0x7f04d0bbdc689ddc
+787, 0xe3ed89ab8d78dcb3
+788, 0x73c38bfb43986210
+789, 0x740c7d787eb8e158
+790, 0x5284fafdfb3fb9ec
+791, 0x2e91a58ac1fb1409
+792, 0xb94a600bf0a09af3
+793, 0x533ea4dbe07d81dd
+794, 0x48c3f1a736b3c5fd
+795, 0x56ae3499fa8720ce
+796, 0x526f2def663ca818
+797, 0x2f085759c65665c4
+798, 0xf715f042c69e0db4
+799, 0x110889c399231e60
+800, 0x64584a244866f3a0
+801, 0xf02ec101a39405d3
+802, 0xe73cd5e9a7f17283
+803, 0xfea64869e7028234
+804, 0x97559974ad877891
+805, 0xc8695aba1dc9f2e5
+806, 0x7b62b76ffc2264ec
+807, 0xf5e1df172ec5ccd
+808, 0xafaeb68765e443bd
+809, 0xd3870eb2e8337623
+810, 0x4f944d684138fb39
+811, 0x6977c575038916ad
+812, 0x8ada1a225df95a56
+813, 0xe4044c6c58d15e54
+814, 0x4e5121366681cf2
+815, 0xcf8640b079357b0d
+816, 0xcd5b157d44106fa3
+817, 0x9d7a5481279e25a1
+818, 0xe10e9db41fb4b34f
+819, 0x1052607be1eadff9
+820, 0x3403d67232fe2265
+821, 0xac9358f498c34afc
+822, 0x820172da0dc39c9
+823, 0xe186e91a3b826b6a
+824, 0x1a838e2a40284445
+825, 0x1870b617ebd7bce6
+826, 0xcb7cba4424be1ed7
+827, 0x6a2e56e40fdf9041
+828, 0xace93bbe108f97ee
+829, 0xfeb9bc74ac41ca08
+830, 0x8cb2d05b0f6a1f51
+831, 0x73792309f3fac0a9
+832, 0x2507343d431308ca
+833, 0xd0ea1197be615412
+834, 0xb1870812f1d2fa94
+835, 0x6d067b6935dcd23e
+836, 0xaf161014e5492c31
+837, 0xd4be0dce97064be4
+838, 0xf8edfe3fc75c20f1
+839, 0x894751dc442d2d9c
+840, 0xb4a95f6a6663456c
+841, 0x74e93162e2d805db
+842, 0x784bc5f3a7a2f645
+843, 0xd234d7c5b0582ea9
+844, 0x491f28d0ab6cb97c
+845, 0xa79419e5cf4336c3
+846, 0x66b00141978c849
+847, 0xa7ddbd64698d563f
+848, 0xefc33a4a5d97d4b2
+849, 0x95075514a65aebdc
+850, 0x40eca5b3e28cd25e
+851, 0x90ec7d00e9c9e35d
+852, 0x63e84104d5af417a
+853, 0xdaca0ea32df5744
+854, 0x7ed54f2587795881
+855, 0x5a73931760af4ee0
+856, 0x857d1a185a3081ec
+857, 0x6eac2aabe67fb463
+858, 0xd1f86155d8bfc55f
+859, 0x6d56398f3e7877ef
+860, 0x7642f61dfc62bc17
+861, 0x1d76b12843246ffa
+862, 0xde7817809b8a31d0
+863, 0xbcca9cd091198f9d
+864, 0xf71ca566dddcdfd4
+865, 0xea4386ee8b61d082
+866, 0xe351729d6010bac4
+867, 0xfd685d8a49910dd6
+868, 0xa7a20ea6c686bd3
+869, 0x1cdaf82f4dbd5536
+870, 0xa3da1d1e77dda3e0
+871, 0x4f723b3818ff8b2a
+872, 0x1290669eca152469
+873, 0xb54158b52d30651b
+874, 0xc06b74f2c7f0fee
+875, 0x7d5840bcbf702379
+876, 0x19fa4c1254a82ed
+877, 0xcf5ce090ad0b38ea
+878, 0xd4edd6ac9437e16d
+879, 0xc6ebf25eb623b426
+880, 0xd2b6dbdf00d8fea2
+881, 0x949cf98391cc59e1
+882, 0x380a0c7d0356f7b3
+883, 0x8ffefe32465473bf
+884, 0x637b6542d27c861e
+885, 0x347d12ffc664ecd9
+886, 0xea66e3a0c75a6b37
+887, 0xc3aff6f34fb537a1
+888, 0x67bdf3579959bf49
+889, 0xa17a348e3a74b723
+890, 0x93c9ef26ddadd569
+891, 0x483909059a5ac0b2
+892, 0x26ec9074b56d5a0d
+893, 0x6216000d9a48403a
+894, 0x79b43909eab1ec05
+895, 0xe4a8e8d03649e0de
+896, 0x1435d666f3ccdc08
+897, 0xb9e22ba902650a0e
+898, 0x44dffcccc68b41f8
+899, 0x23e60dcc7a559a17
+900, 0x6fd1735eacd81266
+901, 0xf6bda0745ea20c8e
+902, 0x85efcaefe271e07c
+903, 0x9be996ee931cef42
+904, 0xe78b41c158611d64
+905, 0xd6201df605839830
+906, 0x702e8e47d2769fd3
+907, 0xb8dcf70e18cf14c
+908, 0xac2690bab1bf5c17
+909, 0x92b166b71205d696
+910, 0xb0e73c795fc6df28
+911, 0x4bf2322c8b6b6f0d
+912, 0xa842fbe67918cea0
+913, 0xb01a8675d9294e54
+914, 0xfbe3c94f03ca5af2
+915, 0x51a5c089600c441f
+916, 0x60f0fd7512d85ded
+917, 0xef3113d3bc2cadb0
+918, 0xe1ea128ade300d60
+919, 0xde413b7f8d92d746
+920, 0xfc32c6d43f47c5d8
+921, 0x69d551d8c2b54c68
+922, 0xb9bc68c175777943
+923, 0xb9c79c687f0dae90
+924, 0xd799421ef883c06e
+925, 0xbff553ca95a29a3e
+926, 0xfc9ffac46bd0aca1
+927, 0x4f6c3a30c80c3e5a
+928, 0x8b7245bc6dc4a0a
+929, 0xaf4e191a4575ff60
+930, 0x41218c4a76b90f0b
+931, 0x986052aa51b8e89b
+932, 0x284b464ed5622f9
+933, 0xba6bded912626b40
+934, 0x43cad3ed7443cb5c
+935, 0x21641fa95725f328
+936, 0x6d99d6d09d755822
+937, 0x8246dfa2d4838492
+938, 0xd2ee70b9056f4726
+939, 0x87db515a786fbb8b
+940, 0x7c63e4c1d7786e7d
+941, 0xd1a9d548f10b3e88
+942, 0xa00856475f3b74c9
+943, 0x7f1964ce67148bf4
+944, 0x446650ec71e6018c
+945, 0xb1805ca07d1b6345
+946, 0x869c0a1625b7271b
+947, 0x79d6da06ce2ecfe2
+948, 0xec7b3cafc5e3c85f
+949, 0x1745ce21e39f2c3d
+950, 0xd9a0a7af6ee97825
+951, 0x680e0e52a6e11d5c
+952, 0xd86b3f344ff7f4cd
+953, 0xab56af117c840b9c
+954, 0x5c5404c7e333a10e
+955, 0x4f1eb462f35d990d
+956, 0xf857605a5644458e
+957, 0x3bb87cdf09262f86
+958, 0xd57295baf6da64b
+959, 0xb5993f48472f2894
+960, 0x7d1a501608c060b2
+961, 0x45fabe2d0e54adf0
+962, 0xbb41c3806afb4efe
+963, 0xbfbc506049424c8
+964, 0xb7dd6b67f2203344
+965, 0x389ce52eff883b81
+966, 0xe259c55c0cf6d000
+967, 0x70fb3e3824f7d213
+968, 0x9f36d5599ed55f4b
+969, 0xd14cf6f12f83c4f7
+970, 0x570a09d56aaa0b66
+971, 0x8accafd527f4598
+972, 0xa42d64c62175adfd
+973, 0xddb9c6a87b6e1558
+974, 0xd80b6c69fa1cde2a
+975, 0x44ebaac10082207b
+976, 0xf99be8889552fa1a
+977, 0x38253cd4b38b5dc5
+978, 0x85356c8b02675791
+979, 0xbf91677b2ecdcf55
+980, 0x2316cb85e93f366e
+981, 0x9abf35954db6b053
+982, 0xf49f7425e086b45a
+983, 0x8f5b625e074afde2
+984, 0xe0d614559791b080
+985, 0xbf7b866afab2a525
+986, 0xde89d7e1641a6412
+987, 0x1d10687d8ae5b86f
+988, 0x1f034caa0e904cbd
+989, 0x2086357aec8a7a2c
+990, 0x22dc476b80c56e1e
+991, 0xbef5a73cc0e3a493
+992, 0xddfa3829b26ed797
+993, 0x8917a87ec3d4dc78
+994, 0xfeabe390628c365e
+995, 0x581b0c4f6fb2d642
+996, 0x1ef8c590adbf5b9a
+997, 0x4d8e13aac0cce879
+998, 0xfe38f71e5977fad0
+999, 0x1f83a32d4adfd2ed
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-2.csv b/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-2.csv
new file mode 100644
index 000000000..69d24c38c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/philox-testset-2.csv
@@ -0,0 +1,1001 @@
+seed, 0x0
+0, 0x399e5b222b82fa9
+1, 0x41fd08c1f00f3bc5
+2, 0x78b8824162ee4d04
+3, 0x176747919e02739d
+4, 0xfaa88f002a8d3596
+5, 0x418eb6f592e6c227
+6, 0xef83020b8344dd45
+7, 0x30a74a1a6eaa064b
+8, 0x93d43bf97a490c3
+9, 0xe4ba28b442194cc
+10, 0xc829083a168a8656
+11, 0x73f45d50f8e22849
+12, 0xf912db57352824cc
+13, 0xf524216927b12ada
+14, 0x22b7697473b1dfda
+15, 0x311e2a936414b39f
+16, 0xb905abfdcc425be6
+17, 0x4b14630d031eac9c
+18, 0x1cf0c4ae01222bc8
+19, 0xa6c33efc6e82ef3
+20, 0x43b3576937ba0948
+21, 0x1e483d17cdde108a
+22, 0x6722784cac11ac88
+23, 0xee87569a48fc45d7
+24, 0xb821dcbe74d18661
+25, 0xa5d1876ef3da1a81
+26, 0xe4121c2af72a483
+27, 0x2d747e355a52cf43
+28, 0x609059957bd03725
+29, 0xc3327244b49e16c5
+30, 0xb5ae6cb000dde769
+31, 0x774315003209017
+32, 0xa2013397ba8db605
+33, 0x73b228945dbcd957
+34, 0x801af7190375d3c0
+35, 0xae6dca29f24c9c67
+36, 0xd1cc0bcb1ca26249
+37, 0x1defa62a5bd853be
+38, 0x67c2f5557fa89462
+39, 0xf1729b58122fab02
+40, 0xb67eb71949ec6c42
+41, 0x5456366ec1f8f7d7
+42, 0x44492b32eb7966f5
+43, 0xa801804159f175f1
+44, 0x5a416f23cac70d84
+45, 0x186f55293302303d
+46, 0x7339d5d7b6a43639
+47, 0xfc6df38d6a566121
+48, 0xed2fe018f150b39e
+49, 0x508e0b04a781fa1b
+50, 0x8bee9d50f32eaf50
+51, 0x9870015d37e63cc
+52, 0x93c6b12309c14f2d
+53, 0xb571cf798abe93ff
+54, 0x85c35a297a88ae6e
+55, 0x9b1b79afe497a2ae
+56, 0x1ca02e5b95d96b8d
+57, 0x5bb695a666c0a94a
+58, 0x4e3caf9bbab0b208
+59, 0x44a44be1a89f2dc1
+60, 0x4ff37c33445758d1
+61, 0xd0e02875322f35da
+62, 0xfd449a91fb92646b
+63, 0xbe0b49096b95db4d
+64, 0xffa3647cad13ef5d
+65, 0x75c127a61acd10c8
+66, 0xd65f697756f5f98e
+67, 0x3ced84be93d94434
+68, 0x4da3095c2fc46d68
+69, 0x67564e2a771ee9ac
+70, 0x36944775180644a9
+71, 0xf458db1c177cdb60
+72, 0x5b58406dcd034c8
+73, 0x793301a3fdab2a73
+74, 0x1c2a1a16d6db6128
+75, 0xc2dacd4ddddbe56c
+76, 0x2e7d15be2301a111
+77, 0xd4f4a6341b3bcd18
+78, 0x3622996bbe6a9e3b
+79, 0xaf29aa9a7d6d47da
+80, 0x6d7dbb74a4cd68ae
+81, 0xc260a17e0f39f841
+82, 0xdee0170f2af66f0d
+83, 0xf84ae780d7b5a06e
+84, 0x8326247b73f43c3a
+85, 0xd44eef44b4f98b84
+86, 0x3d10aee62ec895e3
+87, 0x4f23fef01bf703b3
+88, 0xf8e50aa57d888df6
+89, 0x7da67411e3bef261
+90, 0x1d00f2769b2f96d7
+91, 0x7ef9a15b7444b84e
+92, 0xcfa16436cc2b7e21
+93, 0x29ab8cfac00460ff
+94, 0x23613de8608b0e70
+95, 0xb1aa0980625798a8
+96, 0xb9256fd29db7df99
+97, 0xdacf311bf3e7fa18
+98, 0xa013c8f9fada20d8
+99, 0xaf5fd4fe8230fe3e
+100, 0xd3d59ca55102bc5c
+101, 0x9d08e2aa5242767f
+102, 0x40278fe131e83b53
+103, 0x56397d03c7c14c98
+104, 0xe874b77b119359b3
+105, 0x926a1ba4304ab19f
+106, 0x1e115d5aa695a91d
+107, 0xc6a459df441f2fe3
+108, 0x2ca842bc1b0b3c6a
+109, 0x24c804cf8e5eed16
+110, 0x7ca00fc4a4c3ebd3
+111, 0x546af7cecc4a4ba6
+112, 0x8faae1fa18fd6e3
+113, 0x40420b0089641a6a
+114, 0x88175a35d9abcb83
+115, 0xf7d746d1b8b1357c
+116, 0x7dae771a651be970
+117, 0x2f6485247ee4df84
+118, 0x6883702fab2d8ec5
+119, 0xeb7eea829a67f9a6
+120, 0x60d5880b485562ed
+121, 0x7d4ca3d7e41a4e7e
+122, 0xbb7fef961ab8de18
+123, 0x3b92452fb810c164
+124, 0x5f4b4755348b338
+125, 0xca45a715a7539806
+126, 0xc33efd9da5399dd
+127, 0x593d665a51d4aedd
+128, 0x75d6b8636563036b
+129, 0x7b57caa55e262082
+130, 0x4ede7427969e0dd5
+131, 0xc3f19b6f78ea00b
+132, 0xeea7bab9be2181ea
+133, 0x652c45fe9c420c04
+134, 0x14ba9e3d175670ee
+135, 0xd2ad156ba6490474
+136, 0x4d65ae41065f614
+137, 0x6ff911c8afa28eb1
+138, 0xedc2b33588f3cb68
+139, 0x437c8bc324666a2f
+140, 0x828cee25457a3f0
+141, 0x530c986091f31b9b
+142, 0x2f34671e8326ade7
+143, 0x4f686a8f4d77f6da
+144, 0xa4c1987083498895
+145, 0xbce5a88b672b0fb1
+146, 0x8476115a9e6a00cc
+147, 0x16de18a55dd2c238
+148, 0xdf38cf4c416232bc
+149, 0x2cb837924e7559f3
+150, 0xfad4727484e982ed
+151, 0x32a55d4b7801e4f
+152, 0x8b9ef96804bd10a5
+153, 0xa1fd422c9b5cf2a9
+154, 0xf46ddb122eb7e442
+155, 0x6e3842547afa3b33
+156, 0x863dee1c34afe5c4
+157, 0x6a43a1935b6db171
+158, 0x1060a5c2f8145821
+159, 0xf783ec9ed34c4607
+160, 0x1da4a86bf5f8c0b0
+161, 0x4c7714041ba12af8
+162, 0x580da7010be2f192
+163, 0xad682fe795a7ea7a
+164, 0x6687b6cb88a9ed2c
+165, 0x3c8d4b175517cd18
+166, 0xe9247c3a524a6b6b
+167, 0x337ca9cfaa02658
+168, 0xed95399481c6feec
+169, 0x58726a088e606062
+170, 0xfe7588a5b4ee342a
+171, 0xee434c7ed146fdee
+172, 0xe2ade8b60fdc4ba5
+173, 0xd57e4c155de4eaab
+174, 0xdefeae12de1137cb
+175, 0xb7a276a241316ac1
+176, 0xeb838b1b1df4ca15
+177, 0x6f78965edea32f6f
+178, 0x18bebd264d7a5d53
+179, 0x3641c691d77005ec
+180, 0xbe70ed7efea8c24c
+181, 0x33047fa8d03ca560
+182, 0x3bed0d2221ff0f87
+183, 0x23083a6ffbcf38a2
+184, 0xc23eb827073d3fa5
+185, 0xc873bb3415e9fb9b
+186, 0xa4645179e54147fe
+187, 0x2c72fb443f66e207
+188, 0x98084915dd89d8f4
+189, 0x88baa2de12c99037
+190, 0x85c74ab238cb795f
+191, 0xe122186469ea3a26
+192, 0x4c3bba99b3249292
+193, 0x85d6845d9a015234
+194, 0x147ddd69c13e6a31
+195, 0x255f4d678c9a570b
+196, 0x2d7c0c410bf962b4
+197, 0x58eb7649e0aa16ca
+198, 0x9d240bf662fe0783
+199, 0x5f74f6fa32d293cc
+200, 0x4928e52f0f79d9b9
+201, 0xe61c2b87146b706d
+202, 0xcfcd90d100cf5431
+203, 0xf15ea8138e6aa178
+204, 0x6ab8287024f9a819
+205, 0xed8942593db74e01
+206, 0xefc00e4ec2ae36dd
+207, 0xc21429fb9387f334
+208, 0xf9a3389e285a9bce
+209, 0xacdee8c43aae49b3
+210, 0xefc382f02ad55c25
+211, 0x1153b50e8d406b72
+212, 0xb00d39ebcc2f89d8
+213, 0xde62f0b9831c8850
+214, 0xc076994662eef6c7
+215, 0x66f08f4752f1e3ef
+216, 0x283b90619796249a
+217, 0x4e4869bc4227499e
+218, 0xb45ad78a49efd7ed
+219, 0xffe19aa77abf5f4b
+220, 0xfce11a0daf913aef
+221, 0x7e4e64450d5cdceb
+222, 0xe9621997cfd62762
+223, 0x4d2c9e156868081
+224, 0x4e2d96eb7cc9a08
+225, 0xda74849bba6e3bd3
+226, 0x6f4621da935e7fde
+227, 0xb94b914aa0497259
+228, 0xd50d03e8b8db1563
+229, 0x1a45c1ce5dca422e
+230, 0xc8d30d33276f843f
+231, 0xb57245774e4176b4
+232, 0x8d36342c05abbbb1
+233, 0x3591ad893ecf9e78
+234, 0x62f4717239ee0ac8
+235, 0x9b71148a1a1d4200
+236, 0x65f8e0f56dd94463
+237, 0x453b1fcfd4fac8c2
+238, 0x4c25e48e54a55865
+239, 0xa866baa05112ace2
+240, 0x7741d3c69c6e79c5
+241, 0x7deb375e8f4f7a8a
+242, 0xc242087ede42abd8
+243, 0x2fa9d1d488750c4b
+244, 0xe8940137a935d3d3
+245, 0x1dab4918ca24b2f2
+246, 0xe2368c782168fe3e
+247, 0x6e8b2d1d73695909
+248, 0x70455ebea268b33e
+249, 0x656a919202e28da1
+250, 0x5a5a8935647da999
+251, 0x428c6f77e118c13c
+252, 0xa87aee2b675bb083
+253, 0x3873a6412b239969
+254, 0x5f72c1e91cb8a2ee
+255, 0xa25af80a1beb5679
+256, 0x1af65d27c7b4abc3
+257, 0x133437060670e067
+258, 0xb1990fa39a97d32e
+259, 0x724adc89ae10ed17
+260, 0x3f682a3f2363a240
+261, 0x29198f8dbd343499
+262, 0xdfaeeaa42bc51105
+263, 0x5baff3901b9480c2
+264, 0x3f760a67043e77f5
+265, 0x610fa7aa355a43ba
+266, 0x394856ac09c4f7a7
+267, 0x1d9229d058aee82e
+268, 0x19c674804c41aeec
+269, 0x74cf12372012f4aa
+270, 0xa5d89b353fa2f6ca
+271, 0x697e4f672ac363dd
+272, 0xde6f55ba73df5af9
+273, 0x679cf537510bd68f
+274, 0x3dc916114ae9ef7e
+275, 0xd7e31a66ec2ee7ba
+276, 0xc21bebb968728495
+277, 0xc5e0781414e2adfd
+278, 0x71147b5412ddd4bd
+279, 0x3b864b410625cca9
+280, 0x433d67c0036cdc6
+281, 0x48083afa0ae20b1b
+282, 0x2d80beecd64ac4e8
+283, 0x2a753c27c3a3ee3e
+284, 0xb2c5e6afd1fe051a
+285, 0xea677930cd66c46b
+286, 0x4c3960932f92810a
+287, 0xf1b367a9e527eaba
+288, 0xb7d92a8a9a69a98e
+289, 0x9f9ad3210bd6b453
+290, 0x817f2889db2dcbd8
+291, 0x4270a665ac15813c
+292, 0x90b85353bd2be4dd
+293, 0x10c0460f7b2d68d
+294, 0x11cef32b94f947f5
+295, 0x3cf29ed8e7d477e8
+296, 0x793aaa9bd50599ef
+297, 0xbac15d1190014aad
+298, 0x987944ae80b5cb13
+299, 0x460aa51f8d57c484
+300, 0xc77df0385f97c2d3
+301, 0x92e743b7293a3822
+302, 0xbc3458bcfbcbb8c0
+303, 0xe277bcf3d04b4ed7
+304, 0xa537ae5cf1c9a31c
+305, 0x95eb00d30bd8cfb2
+306, 0x6376361c24e4f2dd
+307, 0x374477fe87b9ea8e
+308, 0x8210f1a9a039902e
+309, 0xe7628f7031321f68
+310, 0x8b8e9c0888fc1d3d
+311, 0x306be461fdc9e0ed
+312, 0x510009372f9b56f5
+313, 0xa6e6fa486b7a027a
+314, 0x9d3f002025203b5a
+315, 0x7a46e0e81ecbef86
+316, 0x41e280c611d04df0
+317, 0xedcec10418a99e8a
+318, 0x5c27b6327e0b9dbd
+319, 0xa81ed2035b509f07
+320, 0x3581e855983a4cc4
+321, 0x4744594b25e9809d
+322, 0xc737ac7c27fbd0ed
+323, 0x1b523a307045433a
+324, 0x8b4ce9171076f1d9
+325, 0x2db02d817cd5eec0
+326, 0x24a1f1229af50288
+327, 0x5550c0dcf583ff16
+328, 0x3587baaa122ec422
+329, 0xf9d3dc894229e510
+330, 0xf3100430d5cf8e87
+331, 0xc31af79862f8e2fb
+332, 0xd20582063b9f3537
+333, 0xac5e90ac95fcc7ad
+334, 0x107c4c704d5109d4
+335, 0xebc8628906dbfd70
+336, 0x215242776da8c531
+337, 0xa98002f1dcf08b51
+338, 0xbc3bdc07f3b09718
+339, 0x238677062495b512
+340, 0x53b4796f2a3c49e8
+341, 0x6424286467e22f0e
+342, 0x14d0952a11a71bac
+343, 0x2f97098149b82514
+344, 0x3777f2fdc425ad2
+345, 0xa32f2382938876d4
+346, 0xda8a39a021f20ae3
+347, 0x364361ef0a6ac32c
+348, 0x4413eede008ff05a
+349, 0x8dda8ace851aa327
+350, 0x4303cabbdcecd1ee
+351, 0x2e69f06d74aa549f
+352, 0x4797079cd4d9275c
+353, 0xc7b1890917e98307
+354, 0x34031b0e822a4b4c
+355, 0xfc79f76b566303ea
+356, 0x77014adbe255a930
+357, 0xab6c43dd162f3be5
+358, 0xa430041f3463f6b9
+359, 0x5c191a32ada3f84a
+360, 0xe8674a0781645a31
+361, 0x3a11cb667b8d0916
+362, 0xaedc73e80c39fd8a
+363, 0xfde12c1b42328765
+364, 0x97abb7dcccdc1a0b
+365, 0x52475c14d2167bc8
+366, 0x540e8811196d5aff
+367, 0xa867e4ccdb2b4b77
+368, 0x2be04af61e5bcfb9
+369, 0x81b645102bfc5dfd
+370, 0x96a52c9a66c6450f
+371, 0x632ec2d136889234
+372, 0x4ed530c0b36a6c25
+373, 0x6f4851225546b75
+374, 0x2c065d6ba46a1144
+375, 0xf8a3613ff416551d
+376, 0xb5f0fd60e9c971a9
+377, 0x339011a03bb4be65
+378, 0x9439f72b6995ded6
+379, 0xc1b03f3ef3b2292d
+380, 0xad12fd221daab3ae
+381, 0xf615b770f2cf996f
+382, 0x269d0fdcb764172
+383, 0x67837025e8039256
+384, 0x6402831fc823fafa
+385, 0x22854146a4abb964
+386, 0x7b5ad9b5a1bad7a8
+387, 0x67170e7beb6ac935
+388, 0xfc2d1e8e24adfaaa
+389, 0x7ded4395345ff40d
+390, 0x418981760a80dd07
+391, 0xc03bef38022c1d2
+392, 0x3a11850b26eade29
+393, 0xaa56d02c7175c5f4
+394, 0xd83b7917b9bfbff5
+395, 0x3c1df2f8fa6fced3
+396, 0xf3d6e2999c0bb760
+397, 0xc66d683a59a950e3
+398, 0x8e3972a9d73ffabf
+399, 0x97720a0443edffd9
+400, 0xa85f5d2fe198444a
+401, 0xfc5f0458e1b0de5e
+402, 0xe3973f03df632b87
+403, 0xe151073c84c594b3
+404, 0x68eb4e22e7ff8ecf
+405, 0x274f36eaed7cae27
+406, 0x3b87b1eb60896b13
+407, 0xbe0b2f831442d70a
+408, 0x2782ed7a48a1b328
+409, 0xb3619d890310f704
+410, 0xb03926b11b55921a
+411, 0xdb46fc44aa6a0ce4
+412, 0x4b063e2ef2e9453a
+413, 0xe1584f1aeec60fb5
+414, 0x7092bd6a879c5a49
+415, 0xb84e1e7c7d52b0e6
+416, 0x29d09ca48db64dfb
+417, 0x8f6c4a402066e905
+418, 0x77390795eabc36b
+419, 0xcc2dc2e4141cc69f
+420, 0x2727f83beb9e3c7c
+421, 0x1b29868619331de0
+422, 0xd38c571e192c246f
+423, 0x535327479fe37b6f
+424, 0xaff9ce5758617eb3
+425, 0x5658539e9288a4e4
+426, 0x8df91d87126c4c6d
+427, 0xe931cf8fdba6e255
+428, 0x815dfdf25fbee9e8
+429, 0x5c61f4c7cba91697
+430, 0xdd5f5512fe2313a1
+431, 0x499dd918a92a53cd
+432, 0xa7e969d007c97dfd
+433, 0xb8d39c6fc81ac0bb
+434, 0x1d646983def5746c
+435, 0x44d4b3b17432a60c
+436, 0x65664232a14db1e3
+437, 0xda8fae6433e7500b
+438, 0xbe51b94ff2a3fe94
+439, 0xe9b1bd9a9098ef9f
+440, 0xfe47d54176297ef5
+441, 0xb8ab99bc03bb7135
+442, 0xcfad97f608565b38
+443, 0xf05da71f6760d9c1
+444, 0xef8da40a7c70e7b
+445, 0xe0465d58dbd5d138
+446, 0xb54a2d70eb1a938
+447, 0xfdd50c905958f2d8
+448, 0x3c41933c90a57d43
+449, 0x678f6d894c6ad0bb
+450, 0x403e8f4582274e8
+451, 0x5cbbe975668df6b0
+452, 0x297e6520a7902f03
+453, 0x8f6dded33cd1efd7
+454, 0x8e903c97be8d783b
+455, 0x10bd015577e30f77
+456, 0x3fcd69d1c36eab0c
+457, 0xb45989f3ca198d3
+458, 0x507655ce02b491a9
+459, 0xa92cf99bb78602ce
+460, 0xebfb82055fbc2f0f
+461, 0x3334256279289b7a
+462, 0xc19d2a0f740ee0ac
+463, 0x8bb070dea3934905
+464, 0xa4ab57d3a8d1b3eb
+465, 0xfee1b09bcacf7ff4
+466, 0xccc7fb41ceec41fa
+467, 0xd4da49094eb5a74d
+468, 0xed5c693770af02ed
+469, 0x369dabc9bbfaa8e4
+470, 0x7eab9f360d054199
+471, 0xe36dbebf5ee94076
+472, 0xd30840e499b23d7
+473, 0x8678e6cb545015ff
+474, 0x3a47932ca0b336e
+475, 0xeb7c742b6e93d6fe
+476, 0x1404ea51fe5a62a9
+477, 0xa72cd49db978e288
+478, 0xfd7bada020173dcf
+479, 0xc9e74fc7abe50054
+480, 0x93197847bb66808d
+481, 0x25fd5f053dce5698
+482, 0xe198a9b18cc21f4
+483, 0x5cc27b1689452d5d
+484, 0x8b3657af955a98dc
+485, 0xc17f7584f54aa1c0
+486, 0xe821b088246b1427
+487, 0x32b5a9f6b45b6fa0
+488, 0x2aef7c315c2bae0c
+489, 0xe1af8129846b705a
+490, 0x4123b4c091b34614
+491, 0x6999d61ec341c073
+492, 0x14b9a8fcf86831ea
+493, 0xfd4cff6548f46c9f
+494, 0x350c3b7e6cc8d7d6
+495, 0x202a5047fecafcd5
+496, 0xa82509fe496bb57d
+497, 0x835e4b2608b575fe
+498, 0xf3abe3da919f54ec
+499, 0x8705a21e2c9b8796
+500, 0xfd02d1427005c314
+501, 0xa38458faa637f49b
+502, 0x61622f2360e7622a
+503, 0xe89335a773c2963b
+504, 0x481264b659b0e0d0
+505, 0x1e82ae94ebf62f15
+506, 0x8ea7812de49209d4
+507, 0xff963d764680584
+508, 0x418a68bef717f4af
+509, 0x581f0e7621a8ab91
+510, 0x840337e9a0ec4150
+511, 0x951ef61b344be505
+512, 0xc8b1b899feb61ec2
+513, 0x8b78ca13c56f6ed9
+514, 0x3d2fd793715a946f
+515, 0xf1c04fabcd0f4084
+516, 0x92b602614a9a9fcc
+517, 0x7991bd7a94a65be7
+518, 0x5dead10b06cad2d7
+519, 0xda7719b33f722f06
+520, 0x9d87a722b7bff71e
+521, 0xb038e479071409e9
+522, 0xf4e8bbec48054775
+523, 0x4fec2cd7a28a88ea
+524, 0x839e28526aad3e56
+525, 0xd37ec57852a98bf0
+526, 0xdef2cbbe00f3a02d
+527, 0x1aecfe01a9e4d801
+528, 0x59018d3c8beaf067
+529, 0x892753e6ac8bf3cd
+530, 0xefdd3437023d2d1c
+531, 0x447bfbd148c8cb88
+532, 0x282380221bd442b8
+533, 0xfce8658d1347384a
+534, 0x60b211a7ec6bfa8
+535, 0xd21729cfcc692974
+536, 0x162087ecd5038a47
+537, 0x2b17000c4bce39d2
+538, 0x3a1f75ff6adcdce0
+539, 0x721a411d312f1a2c
+540, 0x9c13b6133f66934d
+541, 0xaa975d14978980e5
+542, 0x9403dbd4754203fa
+543, 0x588c15762fdd643
+544, 0xdd1290f8d0ada73a
+545, 0xd9b77380936103f4
+546, 0xb2e2047a356eb829
+547, 0x7019e5e7f76f7a47
+548, 0x3c29a461f62b001d
+549, 0xa07dc6cfab59c116
+550, 0x9b97e278433f8eb
+551, 0x6affc714e7236588
+552, 0x36170aeb32911a73
+553, 0x4a665104d364a789
+554, 0x4be01464ec276c9c
+555, 0x71bb10271a8b4ecf
+556, 0xbf62e1d068bc018
+557, 0xc9ada5db2cbbb413
+558, 0x2bded75e726650e5
+559, 0x33d5a7af2f34385d
+560, 0x8179c46661d85657
+561, 0x324ebcfd29267359
+562, 0xac4c9311dc9f9110
+563, 0xc14bb6a52f9f9c0
+564, 0xc430abe15e7fb9db
+565, 0xf1cce5c14df91c38
+566, 0x651e3efa2c0750d3
+567, 0x38a33604a8be5c75
+568, 0x7aaf77fe7ff56a49
+569, 0xc0d1cc56bbf27706
+570, 0x887aa47324e156c6
+571, 0x12547c004b085e8d
+572, 0xd86a8d6fbbbfd011
+573, 0x57c860188c92d7b4
+574, 0xcd5d3843d361b8ca
+575, 0x8f586ef05a9cb3ef
+576, 0x174456e1ba6267d5
+577, 0xf5dc302c62fe583c
+578, 0xa349442fabcdb71
+579, 0xe5123c1a8b6fd08e
+580, 0x80681552aa318593
+581, 0xb295396deaef1e31
+582, 0xabb626e0b900e32b
+583, 0xf024db8d3f19c15e
+584, 0x1d04bb9548e2fb6c
+585, 0xd8ed2b2214936c2b
+586, 0x618ca1e430a52bc9
+587, 0xccbca44a6088136b
+588, 0xd0481855c8b9ccbe
+589, 0x3c92a2fade28bdf7
+590, 0x855e9fefc38c0816
+591, 0x1269bbfe55a7b27c
+592, 0x1d6c853d83726d43
+593, 0xc8655511cc7fcafc
+594, 0x301503eb125a9b0e
+595, 0xb3108e4532016b11
+596, 0xbb7ab6245da9cb3d
+597, 0x18004c49116d85eb
+598, 0x3480849c20f61129
+599, 0xe28f45157463937b
+600, 0x8e85e61060f2ce1
+601, 0x1673da4ec589ba5e
+602, 0x74b9a6bd1b194712
+603, 0xed39e147fa8b7601
+604, 0x28ce54019102ca77
+605, 0x42e0347f6d7a2f30
+606, 0xb6a908d1c4814731
+607, 0x16c3435e4e9a126d
+608, 0x8880190514c1ad54
+609, 0xfffd86229a6f773c
+610, 0x4f2420cdb0aa1a93
+611, 0xf8e1acb4120fc1fa
+612, 0x63a8c553ab36a2f2
+613, 0x86b88cf3c0a6a190
+614, 0x44d8b2801622c792
+615, 0xf6eae14e93082ff1
+616, 0xd9ed4f5d1b8fac61
+617, 0x1808ce17f4e1f70
+618, 0x446e83ea336f262f
+619, 0xc7c802b04c0917b7
+620, 0x626f45fd64968b73
+621, 0x9ffa540edc9b2c5c
+622, 0xa96a1e219e486af8
+623, 0x2bb8963884e887a1
+624, 0xba7f68a5d029e3c4
+625, 0xefc45f44392d9ca0
+626, 0x98d77762503c5eab
+627, 0xd89bcf62f2da627c
+628, 0xa3cab8347f833151
+629, 0xa095b7595907d5c7
+630, 0x3b3041274286181
+631, 0xb518db8919eb71fa
+632, 0x187036c14fdc9a36
+633, 0xd06e28301e696f5d
+634, 0xdbc71184e0c56492
+635, 0xfe51e9cae6125bfd
+636, 0x3b12d17cd014df24
+637, 0x3b95e4e2c986ac1a
+638, 0x29c1cce59fb2dea2
+639, 0x58c05793182a49d6
+640, 0xc016477e330d8c00
+641, 0x79ef335133ada5d
+642, 0x168e2cad941203f3
+643, 0xf99d0f219d702ef0
+644, 0x655628068f8f135b
+645, 0xdcdea51910ae3f92
+646, 0x8e4505039c567892
+647, 0x91a9ec7e947c89ae
+648, 0x8717172530f93949
+649, 0x1c80aba9a440171a
+650, 0x9c8f83f6ebe7441e
+651, 0x6c05e1efea4aa7f9
+652, 0x10af696b777c01b
+653, 0x5892e9d9a92fc309
+654, 0xd2ba7da71e709432
+655, 0x46378c7c3269a466
+656, 0x942c63dfe18e772c
+657, 0x6245cf02ef2476f
+658, 0x6f265b2759ea2aea
+659, 0x5aa757f17d17f4a6
+660, 0x1ad6a3c44fa09be6
+661, 0xe861af14e7015fb8
+662, 0x86be2e7db388c77
+663, 0x5c7bba32b519e9a0
+664, 0x3feb314850c4437b
+665, 0x97955add60cfb45b
+666, 0xfdb536230a540bdc
+667, 0xdac9d7bf6e58512e
+668, 0x4894c00e474e8120
+669, 0xa1918a37739da366
+670, 0xa8097f2096532807
+671, 0x592afe50e6c5e643
+672, 0xd69050ee6dcb33dc
+673, 0xa6956b262dd3c561
+674, 0x1a55c815555e63f7
+675, 0x2ec7fd37516de2bb
+676, 0x8ec251d9c70e76ba
+677, 0x9b76e4abafd2689
+678, 0x9ce3f5c751a57df1
+679, 0x915c4818bf287bc7
+680, 0x2293a0d1fe07c735
+681, 0x7627dcd5d5a66d3d
+682, 0xb5e4f92cc49c7138
+683, 0x6fc51298731d268c
+684, 0xd19800aa95441f87
+685, 0x14f70f31162fa115
+686, 0x41a3da3752936f59
+687, 0xbec0652be95652ee
+688, 0x7aa4bdb1020a290f
+689, 0x4382d0d9bee899ef
+690, 0xe6d988ae4277d6ff
+691, 0xe618088ccb2a32d1
+692, 0x411669dfaa899e90
+693, 0x234e2bf4ba76d9f
+694, 0xe109fe4cb7828687
+695, 0x1fb96b5022b0b360
+696, 0x6b24ad76c061a716
+697, 0x7e1781d4d7ecee15
+698, 0xf20c2dbe82ba38ba
+699, 0xeda8e8ae1d943655
+700, 0xa58d196e2a77eaec
+701, 0x44564765a5995a0b
+702, 0x11902fe871ecae21
+703, 0x2ea60279900e675d
+704, 0x38427227c18a9a96
+705, 0xe0af01490a1b1b48
+706, 0x826f91997e057824
+707, 0x1e57308e6e50451
+708, 0xb42d469bbbfdc350
+709, 0xb9734cff1109c49b
+710, 0x98967559bb9d364f
+711, 0xd6be360041907c12
+712, 0xa86a1279122a1e21
+713, 0x26f99a8527bfc698
+714, 0xfa8b85758f28f5d6
+715, 0xe3057429940806ae
+716, 0x4bee2d7e84f93b2b
+717, 0x948350a76ea506f4
+718, 0xa139154488045e74
+719, 0x8893579ba5e78085
+720, 0x5f21c215c6a9e397
+721, 0x456134f3a59641dc
+722, 0x92c0273f8e97a9c6
+723, 0xd2936c9c3f0c6936
+724, 0xcfa4221e752c4735
+725, 0x28cd5a7457355dca
+726, 0xecdfdde23d90999f
+727, 0x60631b2d494d032b
+728, 0xf67289df269a827f
+729, 0xcbe8011ef0f5b7ef
+730, 0x20eea973c70a84f5
+731, 0xbe1fd200398557ce
+732, 0xd2279ee030191bba
+733, 0xf2bd4291dedaf819
+734, 0xfc6d167dbe8c402
+735, 0x39ac298da5d0044b
+736, 0xceac026f5f561ce
+737, 0x10a5b0bdd8ad60e6
+738, 0xdeb3c626df6d4bcb
+739, 0x3c128962e77ff6ca
+740, 0xc786262e9c67a0e5
+741, 0x4332855b3febcdc0
+742, 0x7bda9724d1c0e020
+743, 0x6a8c93399bc4df22
+744, 0xa9b20100ac707396
+745, 0xa11a3458502c4eb5
+746, 0xb185461c60478941
+747, 0x13131d56195b7ff6
+748, 0x8d55875ddbd4aa1c
+749, 0xc09b67425f469aa5
+750, 0x39e33786cc7594c4
+751, 0x75e96db8e4b08b93
+752, 0xda01cd12a3275d1e
+753, 0x2c49e7822344fab5
+754, 0x9bd5f10612514ca7
+755, 0x1c801a5c828e7332
+756, 0x29797d3f4f6c7b4c
+757, 0xac992715e21e4e53
+758, 0xe40e89ee887ddb37
+759, 0x15189a2b265a783b
+760, 0xa854159a52af5c5
+761, 0xb9d8a5a81c12bead
+762, 0x3240cdc9d59e2a58
+763, 0x1d0b872234cf8e23
+764, 0xc01224cf6ce12cff
+765, 0x2601e9f3905c8663
+766, 0xd4ecf9890168d6b4
+767, 0xa45db796d89bfdd5
+768, 0x9f389406dad64ab4
+769, 0xa5a851adce43ffe3
+770, 0xd0962c41c26e5aa9
+771, 0x8a671679e48510a4
+772, 0xc196dc0924a6bfeb
+773, 0x3ead661043b549cb
+774, 0x51af4ca737d405ac
+775, 0xf4425b5c62275fb6
+776, 0x71e69d1f818c10f5
+777, 0xacaf4af2d3c70162
+778, 0x2e1f1d4fd7524244
+779, 0xe54fdd8f388890e8
+780, 0xfda0d33e84eb2b83
+781, 0x53965c5e392b81da
+782, 0x5c92288267263097
+783, 0xcac1b431c878c66c
+784, 0x36c0e1cf417241c6
+785, 0x5cc4d9cd1a36bf2c
+786, 0x32e4257bb5d3e470
+787, 0x4aecff904adb44fb
+788, 0x4d91a8e0d1d60cac
+789, 0xa3b478388385b038
+790, 0x48d955f24eba70be
+791, 0x310e4deb07f24f68
+792, 0x8853e73b1f30a5a
+793, 0x278aee45c2a65c5
+794, 0xf6932eedbd62fb0b
+795, 0xafb95958c82fafad
+796, 0x78e807c18616c16c
+797, 0xd7abadda7488ed9f
+798, 0x2dd72e2572aa2ae6
+799, 0x6ec3791982c2be09
+800, 0x6865bb314fac478f
+801, 0xa14dc0ce09000d1a
+802, 0xb8081ad134da10f2
+803, 0xc4ac1534aa825ef5
+804, 0xd83aeb48ae2d538f
+805, 0x38052027e3074be4
+806, 0xa9833e06ef136582
+807, 0x4f02d790ec9fd78
+808, 0xec2f60bc711c5bdc
+809, 0x9253b0d12268e561
+810, 0xa8ac607fdd62c206
+811, 0x895e28ebc920289f
+812, 0xe2fd42b154243ac7
+813, 0xc69cac2f776eee19
+814, 0xf4d4ac11db56d0dc
+815, 0xa8d37049b9f39833
+816, 0x75abbf8a196c337c
+817, 0xb115bb76750d27b8
+818, 0x39426d187839154
+819, 0xd488423e7f38bf83
+820, 0xbb92e0c76ecb6a62
+821, 0x3055a018ce39f4e3
+822, 0xc93fe0e907729bfb
+823, 0x65985d17c5863340
+824, 0x2088ae081b2028e1
+825, 0x6e628de873314057
+826, 0x864377cccf573f0e
+827, 0xae03f4c9aa63d132
+828, 0xb1db766d6404c66d
+829, 0xdce5a22414a374b
+830, 0x622155b777819997
+831, 0x69fe96e620371f3c
+832, 0xa9c67dbc326d94fc
+833, 0x932a84ae5dd43bab
+834, 0xe2301a20f6c48c3f
+835, 0x795d2e79c6477300
+836, 0xd8e3e631289521e7
+837, 0xae2684979002dfd6
+838, 0xc9c2392377550f89
+839, 0xa1b0c99d508ef7ec
+840, 0x593aef3c5a5272ec
+841, 0xe32e511a4b7162cd
+842, 0xab3b81655f5a2857
+843, 0x1b535e1a0aaf053e
+844, 0x5b33f56c1b6a07e2
+845, 0x782dc8cfcac4ef36
+846, 0xb3d4f256eecfd202
+847, 0xf73a6598f58c4f7e
+848, 0xd5722189524870ae
+849, 0x707878de6b995fc0
+850, 0xc3eb6ba73e3d7e8a
+851, 0xca75c017655b75a7
+852, 0x1b29369ea3541e5f
+853, 0x352e98858bdb58a3
+854, 0x1e4412d184b6b27d
+855, 0x2d375ba0304b2d17
+856, 0x56c30fce69a5d08e
+857, 0x6b8c2b0c06584bda
+858, 0xde4dfff228c8c91f
+859, 0xb7c9edd574e6287f
+860, 0xf6078281c9fca2b2
+861, 0xb9b9a51de02a2f1e
+862, 0xa411bef31c0103b0
+863, 0xc5facd8fc5e1d7a3
+864, 0x54e631c05ddf7359
+865, 0x815b42b3fd06c474
+866, 0xc9ac07566fda18ec
+867, 0xd84ea62957bd8e15
+868, 0x5575f74b5cfd8803
+869, 0x5779a8d460c2e304
+870, 0xfd6e87e264a85587
+871, 0xa1d674daa320b26d
+872, 0x2c3c3ec64b35afc4
+873, 0x393a274ff03e6935
+874, 0x1f40ecbac52c50ea
+875, 0xc3de64fa324ffc0c
+876, 0x56ae828b7f9deb04
+877, 0xe7c1a77b5c1f2cb3
+878, 0xa4c4aab19ea921cc
+879, 0xec164c238825822c
+880, 0xa6a3304770c03b03
+881, 0x3a63641d5b1e8123
+882, 0x42677be3a54617ef
+883, 0xa2680423e3a200c0
+884, 0x8b17cf75f3f37277
+885, 0xe7ce65a49242be3d
+886, 0x7f85934271323e4b
+887, 0xcfb0f431f79a4fab
+888, 0x392e4041a8505b65
+889, 0xd3e5daf0d8b25ea6
+890, 0x9447eff675d80f53
+891, 0xea27a9d53cfaeea8
+892, 0xe3f2335945a83ba
+893, 0x8875a43ce216413b
+894, 0xe49941f9eabce33e
+895, 0x9357c1296683a5b1
+896, 0xf0f16439e81ee701
+897, 0x3181515295ffd79a
+898, 0x9d7150fffd169ed8
+899, 0x2d6a1d281e255a72
+900, 0x81bf1286fb3a92b6
+901, 0x566d3079b499e279
+902, 0xc7939ca8f047341
+903, 0xb1f8050e7c2d59f6
+904, 0x605701045e7be192
+905, 0x51b73360e8e31a1c
+906, 0x9f4ad54483ba9fe0
+907, 0xd3085b8fcf69d1c8
+908, 0xc3e7475026dc5f0b
+909, 0x5800f8554b157354
+910, 0x37dfdf858cfcd963
+911, 0x3a1fce05ce385072
+912, 0xf495c062645c20c3
+913, 0xdcbeec2c3492c773
+914, 0xc38f427589d1d0b4
+915, 0x681ead60216a8184
+916, 0x4bd569c40cc88c41
+917, 0x49b0d442e130b7a2
+918, 0xee349156b7d1fa3f
+919, 0x2bde2d2db055135b
+920, 0xc6a460d2fbcb2378
+921, 0xd0f170494ff3dbb
+922, 0xb294422492528a23
+923, 0xfc95873c854e7b86
+924, 0x6c9c3ad1797bb19c
+925, 0xe0c06f2aab65062d
+926, 0x58e32ce0f11e3a81
+927, 0xa745fcd729ff5036
+928, 0x599b249b2fc2cdb2
+929, 0x78f23b5b0dd5b082
+930, 0x6de3e957f549ecfc
+931, 0x9d0712fa6d878756
+932, 0x9076e8554e4a413a
+933, 0xf3185818c0294de8
+934, 0x5de7cdf4b455b9b6
+935, 0xb15f6908ed703f7d
+936, 0x98c654dfedc6818
+937, 0x120502ab0e93ae42
+938, 0x67966a98a58dc120
+939, 0x1caa0fc628989482
+940, 0xd8b2c3cd480a8625
+941, 0x85c70071b3aed671
+942, 0xff385f8473714662
+943, 0xe2868e4bf3773b63
+944, 0x96cf8019b279298e
+945, 0x8511cc930bd74800
+946, 0x5312e48fdd55f5ab
+947, 0xfcdae564b52df78d
+948, 0x9eee48373e652176
+949, 0x953788f6bcbc56b0
+950, 0xd1a3855dbd2f6b37
+951, 0x3ad32acf77f4d1e9
+952, 0x917c7be81b003e30
+953, 0x9ce817da1e2e9dfb
+954, 0x2968983db162d44d
+955, 0x1e005decef5828ad
+956, 0xc38fe59d1aa4f3d5
+957, 0xf357f1710dc02f1d
+958, 0x2613912a4c83ec67
+959, 0x832a11470b9a17cb
+960, 0x5e85508a611f0dad
+961, 0x2781131677f59d56
+962, 0xa82358d7d4b0237f
+963, 0xfbf8b3cc030c3af6
+964, 0x68b2f68ac8a55adb
+965, 0x3b6fcf353add0ada
+966, 0xd1956049bcd15bd5
+967, 0x95b76f31c7f98b6d
+968, 0x814b6690df971a84
+969, 0xdcf7959cddd819e4
+970, 0xcf8c72c5d804fc88
+971, 0x56883769c8945a22
+972, 0x1f034652f658cf46
+973, 0x41df1324cda235a1
+974, 0xeccd32524504a054
+975, 0x974e0910a04ec02c
+976, 0x72104507b821f6db
+977, 0x791f8d089f273044
+978, 0xe0f79a4f567f73c3
+979, 0x52fe5bea3997f024
+980, 0x5f8b9b446494f78
+981, 0xfd9f511947059190
+982, 0x3aea9dac6063bce3
+983, 0xbfdae4dfc24aee60
+984, 0xa82cdbbf0a280318
+985, 0xf460aae18d70aa9d
+986, 0x997367cb204a57c4
+987, 0x616e21ab95ba05ef
+988, 0x9bfc93bec116769f
+989, 0x2b2ee27c37a3fa5b
+990, 0xb25c6ed54006ee38
+991, 0xab04d4a5c69e69a5
+992, 0x6d2f6b45f2d8438f
+993, 0x4ad2f32afc82f092
+994, 0x513d718908f709c0
+995, 0x5272aadc4fffca51
+996, 0xeb3f87e66156ef5d
+997, 0xf8a3d5a46a86ba85
+998, 0xdb4548a86f27abfd
+999, 0x57c05f47ff62380d
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-1.csv b/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-1.csv
new file mode 100644
index 000000000..4fffe6959
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-1.csv
@@ -0,0 +1,1001 @@
+seed, 0xdeadbeaf
+0, 0xa475f55fbb6bc638
+1, 0xb2d594b6c29d971c
+2, 0x275bc4ece4484fb1
+3, 0x569be72d9b3492fb
+4, 0x89a5bb9b206a670c
+5, 0xd951bfa06afdc3f9
+6, 0x7ee2e1029d52a265
+7, 0x12ef1d4de0cb4d4c
+8, 0x41658ba8f0ef0280
+9, 0x5b650c82e4fe09c5
+10, 0x638a9f3e30ec4e94
+11, 0x147487fb2ba9233e
+12, 0x89ef035603d2d1fb
+13, 0xe66ca57a190e6cbe
+14, 0x330f673740dd61fc
+15, 0xc71d3dce2f8bb34e
+16, 0x3c07c39ff150b185
+17, 0x5df952b6cae8f099
+18, 0x9f09f2b1f0ceac80
+19, 0x19598eee2d0c4c67
+20, 0x64e06483702e0ebd
+21, 0xda04d1fdb545f7fa
+22, 0xf2cf53b61a0c4f9b
+23, 0xf0bb724ce196f66e
+24, 0x71cefde55d9cf0f
+25, 0x6323f62824a20048
+26, 0x1e93604680f14b4e
+27, 0xd9d8fad1d4654025
+28, 0xf4ee25af2e76ca08
+29, 0x6af3325896befa98
+30, 0xad9e43abf5e04053
+31, 0xbf930e318ce09de3
+32, 0x61f9583b4f9ffe76
+33, 0x9b69d0b3d5ec8958
+34, 0xa608f250f9b2ca41
+35, 0x6fdba7073dc2bb5d
+36, 0xa9d57601efea6d26
+37, 0xc24a88a994954105
+38, 0xc728b1f78d88fe5b
+39, 0x88da88c2b083b3b2
+40, 0xa9e27f7303c76cfd
+41, 0xc4c24608c29176eb
+42, 0x5420b58466b972fd
+43, 0xd2018a661b6756c8
+44, 0x7caed83d9573fc7
+45, 0x562a3d81b849a06a
+46, 0x16588af120c21f2c
+47, 0x658109a7e0eb4837
+48, 0x877aabb14d3822e1
+49, 0x95704c342c3745fe
+50, 0xeeb8a0dc81603616
+51, 0x431bf94889290419
+52, 0xe4a9410ab92a5863
+53, 0xbc6be64ea60f12ba
+54, 0x328a2da920015063
+55, 0x40f6b3bf8271ae07
+56, 0x4068ff00a0e854f8
+57, 0x1b287572ca13fa78
+58, 0xa11624a600490b99
+59, 0x4a04ef29eb7150fa
+60, 0xcc9469ab5ffb739
+61, 0x99a6a9f8d95e782
+62, 0x8e90356573e7a070
+63, 0xa740b8fb415c81c4
+64, 0x47eccef67447f3da
+65, 0x2c720afe3a62a49b
+66, 0xe2a747f0a43eacf4
+67, 0xba063a87ab165576
+68, 0xbc1c78ed27feb5a3
+69, 0x285a19fa3974f9d
+70, 0x489c61e704f5f0e3
+71, 0xf5ab04f6b03f238b
+72, 0x7e25f88138a110dd
+73, 0xc3d1cef3d7c1f1d1
+74, 0xc3de6ec64d0d8e00
+75, 0x73682a15b6cc5088
+76, 0x6fecbeb319163dc5
+77, 0x7e100d5defe570a1
+78, 0xad2af9af076dce57
+79, 0x3c65100e23cd3a9a
+80, 0x4b442cc6cfe521bb
+81, 0xe89dc50f8ab1ef75
+82, 0x8b3c6fdc2496566
+83, 0xdfc50042bc2c308c
+84, 0xe39c5f158b33d2b2
+85, 0x92f6adefdfeb0ac
+86, 0xdf5808a949c85b3e
+87, 0x437384021c9dace9
+88, 0xa7b5ed0d3d67d8f
+89, 0xe1408f8b21da3c34
+90, 0xa1bba125c1e80522
+91, 0x7611dc4710385264
+92, 0xb00a46ea84082917
+93, 0x51bf8002ffa87cef
+94, 0x9bb81013e9810adc
+95, 0xd28f6600013541cd
+96, 0xc2ca3b1fa7791c1f
+97, 0x47f9ad58f099c82c
+98, 0x4d1bb9458469caf9
+99, 0xca0b165b2844257
+100, 0xc3b2e667d075dc66
+101, 0xde22f71136a3dbb1
+102, 0x23b4e3b6f219e4c3
+103, 0x327e0db4c9782f66
+104, 0x9365506a6c7a1807
+105, 0x3e868382dedd3be7
+106, 0xff04fa6534bcaa99
+107, 0x96621a8862995305
+108, 0x81bf39cb5f8e1df7
+109, 0x79b684bb8c37af7a
+110, 0xae3bc073c3cde33c
+111, 0x7805674112c899ac
+112, 0xd95a27995abb20f2
+113, 0x71a503c57b105c40
+114, 0x5ff00d6a73ec8acc
+115, 0x12f96391d91e47c2
+116, 0xd55ca097b3bd4947
+117, 0x794d79d20468b04
+118, 0x35d814efb0d7a07d
+119, 0xfa9ac9bd0aae76d3
+120, 0xa77b8a3711e175cd
+121, 0xe6694fbf421f9489
+122, 0xd8f1756525a1a0aa
+123, 0xe38dfa8426277433
+124, 0x16b640c269bbcd44
+125, 0x2a7a5a67ca24cfeb
+126, 0x669039c28d5344b4
+127, 0x2a445ee81fd596bb
+128, 0x600df94cf25607e0
+129, 0x9358561a7579abff
+130, 0xee1d52ea179fc274
+131, 0x21a8b325e89d31be
+132, 0x36fc0917486eec0a
+133, 0x3d99f40717a6be9f
+134, 0x39ac140051ca55ff
+135, 0xcef7447c26711575
+136, 0xf22666870eff441d
+137, 0x4a53c6134e1c7268
+138, 0xd26de518ad6bdb1b
+139, 0x1a736bf75b8b0e55
+140, 0xef1523f4e6bd0219
+141, 0xb287b32fd615ad92
+142, 0x2583d6af5e841dd5
+143, 0x4b9294aae7ca670c
+144, 0xf5aa4a84174f3ca9
+145, 0x886300f9e0dc6376
+146, 0x3611401e475ef130
+147, 0x69b56432b367e1ac
+148, 0x30c330e9ab36b7c4
+149, 0x1e0e73079a85b8d5
+150, 0x40fdfc7a5bfaecf
+151, 0xd7760f3e8e75a085
+152, 0x1cc1891f7f625313
+153, 0xeece1fe6165b4272
+154, 0xe61111b0c166a3c1
+155, 0x2f1201563312f185
+156, 0xfd10e8ecdd2a57cb
+157, 0x51cdc8c9dd3a89bf
+158, 0xed13cc93938b5496
+159, 0x843816129750526b
+160, 0xd09995cd6819ada
+161, 0x4601e778d40607df
+162, 0xef9df06bd66c2ea0
+163, 0xae0bdecd3db65d69
+164, 0xbb921a3c65a4ae9a
+165, 0xd66698ce8e9361be
+166, 0xacdc91647b6068f4
+167, 0xe505ef68f2a5c1c0
+168, 0xd6e62fd27c6ab137
+169, 0x6a2ba2c6a4641d86
+170, 0x9c89143715c3b81
+171, 0xe408c4e00362601a
+172, 0x986155cbf5d4bd9d
+173, 0xb9e6831728c893a7
+174, 0xb985497c3bf88d8c
+175, 0xd0d729214b727bec
+176, 0x4e557f75fece38a
+177, 0x6572067fdfd623ca
+178, 0x178d49bb4d5cd794
+179, 0xe6baf59f60445d82
+180, 0x5607d53518e3a8d2
+181, 0xba7931adb6ebbd61
+182, 0xe853576172611329
+183, 0xe945daff96000c44
+184, 0x565b9ba3d952a176
+185, 0xcdb54d4f88c584c8
+186, 0x482a7499bee9b5e5
+187, 0x76560dd0affe825b
+188, 0x2a56221faa5ca22c
+189, 0x7729be5b361f5a25
+190, 0xd6f2195795764876
+191, 0x59ef7f8f423f18c5
+192, 0x7ebefed6d02adde1
+193, 0xcfec7265329c73e5
+194, 0x4fd8606a5e59881c
+195, 0x95860982ae370b73
+196, 0xdecfa33b1f902acc
+197, 0xf9b8a57400b7c0a6
+198, 0xd20b822672ec857b
+199, 0x4eb81084096c7364
+200, 0xe535c29a44d9b6ad
+201, 0xdef8b48ebacb2e29
+202, 0x1063bc2b8ba0e915
+203, 0xe4e837fb53d76d02
+204, 0x4df935db53579fb8
+205, 0xa30a0c8053869a89
+206, 0xe891ee58a388a7b5
+207, 0x17931a0c64b8a985
+208, 0xaf2d350b494ce1b3
+209, 0x2ab9345ffbcfed82
+210, 0x7de3fe628a2592f0
+211, 0x85cf54fab8b7e79d
+212, 0x42d221520edab71b
+213, 0x17b695b3af36c233
+214, 0xa4ffe50fe53eb485
+215, 0x1102d242db800e4d
+216, 0xc8dc01f0233b3b6
+217, 0x984a030321053d36
+218, 0x27fa8dc7b7112c0e
+219, 0xba634dd8294e177f
+220, 0xe67ce34b36332eb
+221, 0x8f1351e1894fb41a
+222, 0xb522a3048761fd30
+223, 0xc350ad9bc6729edc
+224, 0xe0ed105bd3c805e1
+225, 0xa14043d2b0825aa7
+226, 0xee7779ce7fc11fdf
+227, 0xc0fa8ba23a60ab25
+228, 0xb596d1ce259afbad
+229, 0xaa9b8445537fdf62
+230, 0x770ab2c700762e13
+231, 0xe812f1183e40cc1
+232, 0x44bc898e57aefbbd
+233, 0xdd8a871df785c996
+234, 0x88836a5e371eb36b
+235, 0xb6081c9152623f27
+236, 0x895acbcd6528ca96
+237, 0xfb67e33ddfbed435
+238, 0xaf7af47d323ce26
+239, 0xe354a510c3c39b2d
+240, 0x5cacdedda0672ba3
+241, 0xa440d9a2c6c22b09
+242, 0x6395099f48d64304
+243, 0xc11cf04c75f655b5
+244, 0x1c4e054d144ddb30
+245, 0x3e0c2db89d336636
+246, 0x127ecf18a5b0b9a7
+247, 0x3b50551a88ea7a73
+248, 0xbd27003e47f1f684
+249, 0xf32d657782baac9b
+250, 0x727f5cabf020bc9
+251, 0x39c1c1c226197dc7
+252, 0x5552c87b35deeb69
+253, 0x64d54067b5ce493f
+254, 0x3494b091fe28dda0
+255, 0xdf0278bc85ee2965
+256, 0xdef16fec25efbd66
+257, 0xe2be09f578c4ce28
+258, 0xd27a9271979d3019
+259, 0x427f6fcd71845e3
+260, 0x26b52c5f81ec142b
+261, 0x98267efc3986ad46
+262, 0x7bf4165ddb7e4374
+263, 0xd05f7996d7941010
+264, 0x3b3991de97b45f14
+265, 0x9068217fb4f27a30
+266, 0xd8fe295160afc7f3
+267, 0x8a159fab4c3bc06f
+268, 0x57855506d19080b6
+269, 0x7636df6b3f2367a4
+270, 0x2844ee3abd1d5ec9
+271, 0xe5788de061f51c16
+272, 0x69e78cc9132a164
+273, 0xacd53cde6d8cd421
+274, 0xb23f3100068e91da
+275, 0x4140070a47f53891
+276, 0xe4a422225a96e53a
+277, 0xb82a8925a272a2ac
+278, 0x7c2f9573590fe3b7
+279, 0xbaf80764db170575
+280, 0x955abffa54358368
+281, 0x355ce7460614a869
+282, 0x3700ede779a4afbf
+283, 0x10a6ec01d92d68cd
+284, 0x3308f5a0a4c0afef
+285, 0x97b892d7601136c9
+286, 0x4955c3b941b8552e
+287, 0xca85aa67e941961d
+288, 0xb1859ae5db28e9d2
+289, 0x305d072ac1521fbd
+290, 0xed52a868996085bb
+291, 0x723bfa6a76358852
+292, 0x78d946ecd97c5fb3
+293, 0x39205b30a8e23e79
+294, 0xb927e3d086baadbe
+295, 0xa18d6946136e1ff5
+296, 0xdab6f0b51c1eb5ff
+297, 0xf0a640bf7a1af60c
+298, 0xf0e81db09004d0d4
+299, 0xfe76cebdbe5a4dde
+300, 0x2dafe9cc3decc376
+301, 0x4c871fdf1af34205
+302, 0xe79617d0c8fa893b
+303, 0xee658aaad3a141f7
+304, 0xfd91aa74863e19f1
+305, 0x841b8f55c103cc22
+306, 0x22766ed65444ad5d
+307, 0x56d03d1beca6c17a
+308, 0x5fd4c112c92036ae
+309, 0x75466ae58a5616dc
+310, 0xfbf98b1081e802a9
+311, 0xdc325e957bf6d8f5
+312, 0xb08da7015ebd19b7
+313, 0xf25a9c0944f0c073
+314, 0xf4625bafa0ced718
+315, 0x4349c9e093a9e692
+316, 0x75a9ccd4dd8935cb
+317, 0x7e6cf9e539361e91
+318, 0x20fdd22fb6edd475
+319, 0x5973021b57c2311f
+320, 0x75392403667edc15
+321, 0xed9b2156ea70d9f1
+322, 0xf40c114db50b64a0
+323, 0xe26bb2c9eef20c62
+324, 0x409c1e3037869f03
+325, 0xcdfd71fdda3b7f91
+326, 0xa0dfae46816777d6
+327, 0xde060a8f61a8deb8
+328, 0x890e082a8b0ca4fc
+329, 0xb9f2958eddf2d0db
+330, 0xd17c148020d20e30
+331, 0xffdc9cc176fe7201
+332, 0xffb83d925b764c1
+333, 0x817ea639e313da8d
+334, 0xa4dd335dd891ca91
+335, 0x1342d25a5e81f488
+336, 0xfa7eb9c3cf466b03
+337, 0xfe0a423d44b185d0
+338, 0x101cfd430ab96049
+339, 0x7b5d3eda9c4504b
+340, 0xe20ccc006e0193f1
+341, 0xf54ccddedebc5df0
+342, 0xc0edd142bd58f1db
+343, 0x3831f40d378d2430
+344, 0x80132353f0a88289
+345, 0x688f23c419d03ef8
+346, 0x4c6837e697884066
+347, 0x699387bb2e9a3a8f
+348, 0x8996f860342448d8
+349, 0xb0f80dff99bfa5cc
+350, 0x3e927a7f9ea12c8e
+351, 0xd7e498d1e5f9dff3
+352, 0x78ecb97bb3f864cc
+353, 0x3c4ffd069a014d38
+354, 0xf8d5073a1e09b4d4
+355, 0x8717e854f9faef23
+356, 0xfbcc5478d8d0ad7
+357, 0xd3cd8b233ca274ff
+358, 0x8bd8f11f79beb265
+359, 0xf64498a832d8fd0e
+360, 0xb01bba75112131ec
+361, 0x55572445a7869781
+362, 0x7b56622f18cb3d7a
+363, 0x7f192c9e075bdb83
+364, 0xd9a112f836b83ff3
+365, 0x68673b37269653dc
+366, 0xe46a9433fb6a0879
+367, 0x127d756ca4779001
+368, 0xc1378e8b1e8eab94
+369, 0x1006edb0f51d078c
+370, 0xc6dd53961232d926
+371, 0x9a4aeef44038256d
+372, 0xd357f4fa652d4f5f
+373, 0x59f3d2cc3378598
+374, 0xe76e6207a824a7fc
+375, 0x5fc5e33712ceffef
+376, 0x77d24aeb0ccb1adc
+377, 0x5be4b2826805659e
+378, 0x257c69d787e64634
+379, 0x58dd52ca6bc727b1
+380, 0x3ab997767235ea33
+381, 0x986a2a7a966fad14
+382, 0xc900f8b27761dcc4
+383, 0x44991bdb13795700
+384, 0xe5c145a4fe733b2
+385, 0x56f041b56bffe0d3
+386, 0x5779c4fef8067996
+387, 0xa0fe8748e829532d
+388, 0x840c1277d78d9dd4
+389, 0x37ebcb315432acbc
+390, 0xf4bc8738433ba3be
+391, 0x8b122993f2e10062
+392, 0xe1fe8481f2681ed5
+393, 0x8e23f1630d9f494a
+394, 0xda24661a01b7d0b3
+395, 0x7a02942a179cee36
+396, 0xf1e08a3c09b71ac
+397, 0x3dec2cc7ee0bd8fd
+398, 0x1f3e480113d805d4
+399, 0xc061b973ad4e3f2c
+400, 0x6bea750f17a66836
+401, 0xbc2add72eac84c25
+402, 0xcff058d3f97934ca
+403, 0x54ccc30987778ec2
+404, 0x93449ec1e1469558
+405, 0xe2ff369eb0c6836
+406, 0x41c2df2d63bf8e55
+407, 0xf9302629b6c71be2
+408, 0xdd30376b8e5ab29a
+409, 0x12db9e04f911d754
+410, 0x8d03d6cd359f1b97
+411, 0xe15956511abf1cee
+412, 0x9b68e10e2c2fd940
+413, 0x2e28de6491c1ce53
+414, 0x52b329b72d0c109d
+415, 0xc2c0b115f9da2a60
+416, 0x6ca084105271bbff
+417, 0x49b92b8676058c1e
+418, 0x767fc92a70f7e5a3
+419, 0x87ba4ed4b65a6aa0
+420, 0xf70b052e0a3975e9
+421, 0x3e925c3306db9eec
+422, 0x43253f1d96ac9513
+423, 0xe3e04f1a1ea454c4
+424, 0x763e3f4cc81ba0c8
+425, 0x2a2721ac69265705
+426, 0xdf3b0ac6416ea214
+427, 0xa6a6b57450f3e000
+428, 0xc3d3b1ac7dbfe6ac
+429, 0xb66e5e6f7d2e4ec0
+430, 0x43c65296f98f0f04
+431, 0xdb0f6e3ff974d842
+432, 0x3d6b48e02ebb203b
+433, 0xd74674ebf09d8f27
+434, 0xbe65243c58fc1200
+435, 0x55eb210a68d42625
+436, 0x87badab097dbe883
+437, 0xada3fda85a53824f
+438, 0xef2791e8f48cd37a
+439, 0x3fe7fceb927a641a
+440, 0xd3bffd3ff031ac78
+441, 0xb94efe03da4d18fb
+442, 0x162a0ad8da65ea68
+443, 0x300f234ef5b7e4a6
+444, 0xa2a8b4c77024e4fb
+445, 0x5950f095ddd7b109
+446, 0xded66dd2b1bb02ba
+447, 0x8ec24b7fa509bcb6
+448, 0x9bede53d924bdad6
+449, 0xa9c3f46423be1930
+450, 0x6dfc90597f8de8b4
+451, 0xb7419ebc65b434f0
+452, 0xa6596949238f58b9
+453, 0x966cbade640829b8
+454, 0x58c74877bdcbf65e
+455, 0xaa103b8f89b0c453
+456, 0x219f0a86e41179a4
+457, 0x90f534fc06ddc57f
+458, 0x8db7cdd644f1affa
+459, 0x38f91de0167127ac
+460, 0xdcd2a65e4df43daa
+461, 0x3e04f34a7e01f834
+462, 0x5b237eea68007768
+463, 0x7ff4d2b015921768
+464, 0xf786b286549d3d51
+465, 0xaefa053fc2c3884c
+466, 0x8e6a8ff381515d36
+467, 0x35b94f3d0a1fce3c
+468, 0x165266d19e9abb64
+469, 0x1deb5caa5f9d8076
+470, 0x13ab91290c7cfe9d
+471, 0x3651ca9856be3e05
+472, 0xe7b705f6e9cccc19
+473, 0xd6e7f79668c127ed
+474, 0xa9faf37154896f92
+475, 0x89fbf190603e0ab1
+476, 0xb34d155a86f942d0
+477, 0xb2d4400a78bfdd76
+478, 0x7c0946aca8cfb3f0
+479, 0x7492771591c9d0e8
+480, 0xd084d95c5ca2eb28
+481, 0xb18d12bd3a6023e
+482, 0xea217ed7b864d80b
+483, 0xe52f69a755dd5c6f
+484, 0x127133993d81c4aa
+485, 0xe07188fcf1670bfb
+486, 0x178fbfe668e4661d
+487, 0x1c9ee14bb0cda154
+488, 0x8d043b96b6668f98
+489, 0xbc858986ec96ca2b
+490, 0x7660f779d528b6b7
+491, 0xd448c6a1f74ae1d3
+492, 0x178e122cfc2a6862
+493, 0x236f000abaf2d23b
+494, 0x171b27f3f0921915
+495, 0x4c3ff07652f50a70
+496, 0x18663e5e7d3a66ca
+497, 0xb38c97946c750cc9
+498, 0xc5031aae6f78f909
+499, 0x4d1514e2925e95c1
+500, 0x4c2184a741dabfbb
+501, 0xfd410364edf77182
+502, 0xc228157f863ee873
+503, 0x9856fdc735cc09fc
+504, 0x660496cd1e41d60e
+505, 0x2edf1d7e01954c32
+506, 0xd32e94639bdd98cf
+507, 0x8e153f48709a77d
+508, 0x89357f332d2d6561
+509, 0x1840d512c97085e6
+510, 0x2f18d035c9e26a85
+511, 0x77b88b1448b26d5b
+512, 0xc1ca6ef4cdae0799
+513, 0xcc203f9e4508165f
+514, 0xeaf762fbc9e0cbbe
+515, 0xc070c687f3c4a290
+516, 0xd49ed321068d5c15
+517, 0x84a55eec17ee64ee
+518, 0x4d8ee685298a8871
+519, 0x9ff5f17d7e029793
+520, 0x791d7d0d62e46302
+521, 0xab218b9114e22bc6
+522, 0x4902b7ab3f7119a7
+523, 0x694930f2e29b049e
+524, 0x1a3c90650848999f
+525, 0x79f1b9d8499c932b
+526, 0xfacb6d3d55e3c92f
+527, 0x8fd8b4f25a5da9f5
+528, 0xd037dcc3a7e62ae7
+529, 0xfecf57300d8f84f4
+530, 0x32079b1e1dc12d48
+531, 0xe5f8f1e62b288f54
+532, 0x97feba3a9c108894
+533, 0xd279a51e1899a9a0
+534, 0xd68eea8e8e363fa8
+535, 0x7394cf2deeca9386
+536, 0x5f70b0c80f1dbf10
+537, 0x8d646916ed40462
+538, 0xd253bb1c8a12bbb6
+539, 0x38f399a821fbd73e
+540, 0x947523a26333ac90
+541, 0xb52e90affbc52a37
+542, 0xcf899cd964654da4
+543, 0xdf66ae9cca8d99e7
+544, 0x6051478e57c21b6a
+545, 0xffa7dc975af3c1da
+546, 0x195c7bff2d1a8f5
+547, 0x64f12b6575cf984d
+548, 0x536034cb842cf9e1
+549, 0x180f247ce5bbfad
+550, 0x8ced45081b134867
+551, 0x532bbfdf426710f3
+552, 0x4747933e74c4f54d
+553, 0x197a890dc4793401
+554, 0x76c7cc2bd42fae2
+555, 0xdabfd67f69675dd0
+556, 0x85c690a68cdb3197
+557, 0xe482cec89ce8f92
+558, 0x20bc9fb7797011b1
+559, 0x76dc85a2185782ad
+560, 0x3df37c164422117a
+561, 0x99211f5d231e0ab0
+562, 0xef7fd794a0a91f4
+563, 0x419577151915f5fe
+564, 0x3ce14a0a7135dae3
+565, 0x389b57598a075d6a
+566, 0x8cc2a9d51b5af9aa
+567, 0xe80a9beffbd13f13
+568, 0x65e96b22ea8a54d8
+569, 0x79f38c4164138ede
+570, 0xd1955846cba03d81
+571, 0x60359fe58e4f26d6
+572, 0x4ea724f585f8d13e
+573, 0x316dfdbadc801a3c
+574, 0x20aa29b7c6dd66fe
+575, 0x65eaf83a6a008caa
+576, 0x407000aff1b9e8cb
+577, 0xb4d49bfb2b268c40
+578, 0xd4e6fe8a7a0f14a9
+579, 0xe34afef924e8f58e
+580, 0xe377b0c891844824
+581, 0x29c2e20c112d30c8
+582, 0x906aad1fe0c18a95
+583, 0x308385f0efbb6474
+584, 0xf23900481bf70445
+585, 0xfdfe3ade7f937a55
+586, 0xf37aae71c33c4f97
+587, 0x1c81e3775a8bed85
+588, 0x7eb5013882ce35ea
+589, 0x37a1c1692495818d
+590, 0x3f90ae118622a0ba
+591, 0x58e4fe6fea29b037
+592, 0xd10ff1d269808825
+593, 0xbce30edb60c21bba
+594, 0x123732329afd6fee
+595, 0x429b4059f797d840
+596, 0x421166568a8c4be1
+597, 0x88f895c424c1bd7f
+598, 0x2adaf7a7b9f781cb
+599, 0xa425644b26cb698
+600, 0x8cc44d2486cc5743
+601, 0xdb9f357a33abf6ba
+602, 0x1a57c4ea77a4d70c
+603, 0x1dea29be75239e44
+604, 0x463141a137121a06
+605, 0x8fecfbbe0b8a9517
+606, 0x92c83984b3566123
+607, 0x3b1c69180ed28665
+608, 0x14a6073425ea8717
+609, 0x71f4c2b3283238d7
+610, 0xb3d491e3152f19f
+611, 0x3a0ba3a11ebac5d2
+612, 0xddb4d1dd4c0f54ac
+613, 0xdb8f36fe02414035
+614, 0x1cf5df5031b1902c
+615, 0x23a20ed12ef95870
+616, 0xf113e573b2dedcbb
+617, 0x308e2395cde0a9fa
+618, 0xd377a22581c3a7da
+619, 0xe0ced97a947a66fb
+620, 0xe44f4de9cd754b00
+621, 0x2344943337d9d1bf
+622, 0x4b5ae5e2ea6e749c
+623, 0x9b8d2e3ef41d1c01
+624, 0x59a5a53ebbd24c6b
+625, 0x4f7611bf9e8a06fb
+626, 0xea38c7b61361cd06
+627, 0xf125a2bfdd2c0c7
+628, 0x2df8dcb5926b9ebb
+629, 0x233e18720cc56988
+630, 0x974c61379b4aa95e
+631, 0xc7fe24c1c868910b
+632, 0x818fd1affc82a842
+633, 0xcee92a952a26d38e
+634, 0x8962f575ebcbf43
+635, 0x7770687e3678c460
+636, 0xdfb1db4ed1298117
+637, 0xb9db54cb03d434d3
+638, 0x34aebbf2244257ad
+639, 0xd836db0cb210c490
+640, 0x935daed7138957cd
+641, 0x3cd914b14e7948fd
+642, 0xd0472e9ed0a0f7f0
+643, 0xa9df33dca697f75e
+644, 0x15e9ea259398721a
+645, 0x23eeba0f970abd60
+646, 0x2217fdf8bbe99a12
+647, 0x5ea490a95717b198
+648, 0xf4e2bfc28280b639
+649, 0x9d19916072d6f05c
+650, 0x5e0387cab1734c6a
+651, 0x93c2c8ac26e5f01e
+652, 0xb0d934354d957eb1
+653, 0xee5099a1eef3188c
+654, 0x8be0abca8edc1115
+655, 0x989a60845dbf5aa3
+656, 0x181c7ed964eee892
+657, 0x49838ea07481288d
+658, 0x17dbc75d66116b2e
+659, 0xa4cafb7a87c0117e
+660, 0xab2d0ae44cdc2e6e
+661, 0xdf802f2457e7da6
+662, 0x4b966c4b9187e124
+663, 0x62de9db6f4811e1a
+664, 0x1e20485968bc62
+665, 0xe9ac288265caca94
+666, 0xc5c694d349aa8c1a
+667, 0x3d67f2083d9bdf10
+668, 0x9a2468e503085486
+669, 0x9d6acd3dc152d1a3
+670, 0xca951e2aeee8df77
+671, 0x2707371af9cdd7b0
+672, 0x2347ae6a4eb5ecbd
+673, 0x16abe5582cb426f
+674, 0x523af4ff980bbccb
+675, 0xb07a0f043e3694aa
+676, 0x14d7c3da81b2de7
+677, 0xf471f1b8ac22305b
+678, 0xdb087ffff9e18520
+679, 0x1a352db3574359e8
+680, 0x48d5431502cc7476
+681, 0x7c9b7e7003dfd1bf
+682, 0x4f43a48aae987169
+683, 0x9a5d3eb66dedb3e9
+684, 0xa7b331af76a9f817
+685, 0xba440154b118ab2d
+686, 0x64d22344ce24c9c6
+687, 0xa22377bd52bd043
+688, 0x9dfa1bb18ca6c5f7
+689, 0xdccf44a92f644c8b
+690, 0xf623d0a49fd18145
+691, 0x556d5c37978e28b3
+692, 0xad96e32ce9d2bb8b
+693, 0x2e479c120be52798
+694, 0x7501cf871af7b2f7
+695, 0xd02536a5d026a5b8
+696, 0x4b37ff53e76ab5a4
+697, 0xdb3a4039caaeab13
+698, 0x6cbd65e3b700c7be
+699, 0x7367abd98761a147
+700, 0xf4f9ba216a35aa77
+701, 0xf88ca25ce921eb86
+702, 0xb211de082ec2cbf2
+703, 0xdd94aa46ec57e12e
+704, 0xa967d74ad8210240
+705, 0xdaa1fada8cfa887
+706, 0x85901d081c4488ee
+707, 0xcf67f79a699ef06
+708, 0x7f2f1f0de921ee14
+709, 0x28bc61e9d3f2328b
+710, 0x3332f2963faf18e5
+711, 0x4167ac71fcf43a6
+712, 0x843c1746b0160b74
+713, 0xd9be80070c578a5e
+714, 0xbd7250c9af1473e7
+715, 0x43f78afaa3647899
+716, 0x91c6b5dd715a75a5
+717, 0x29cc66c8a07bfef3
+718, 0x3f5c667311dc22be
+719, 0x4f49cd47958260cd
+720, 0xbef8be43d920b64e
+721, 0x7a892a5f13061d8b
+722, 0x9532f40125c819b1
+723, 0x924fca3045f8a564
+724, 0x9b2c6442453b0c20
+725, 0x7e21009085b8e793
+726, 0x9b98c17e17af59d2
+727, 0xba61acb73e3ae89a
+728, 0xb9d61a710555c138
+729, 0xc2a425d80978974b
+730, 0xa275e13592da7d67
+731, 0xe962103202d9ad0f
+732, 0xbdf8367a4d6f33fd
+733, 0xe59beb2f8648bdc8
+734, 0xb4c387d8fbc4ac1c
+735, 0x5e3f276b63054b75
+736, 0xf27e616aa54d8464
+737, 0x3f271661d1cd7426
+738, 0x43a69dbee7502c78
+739, 0x8066fcea6df059a1
+740, 0x3c10f19409bdc993
+741, 0x6ba6f43fb21f23e0
+742, 0x9e182d70a5bccf09
+743, 0x1520783d2a63a199
+744, 0xba1dcc0c70b9cace
+745, 0x1009e1e9b1032d8
+746, 0xf632f6a95fb0315
+747, 0x48e711c7114cbfff
+748, 0xef281dcec67debf7
+749, 0x33789894d6abf59b
+750, 0x6c8e541fffbe7f9c
+751, 0x85417f13b08e0a88
+752, 0x9a581e36d589608f
+753, 0x461dca50b1befd35
+754, 0x5a3231680dde6462
+755, 0xcc57acf729780b97
+756, 0x50301efef62e1054
+757, 0x675d042cd4f6bbc9
+758, 0x1652fdd3794384c9
+759, 0x1c93bbeeb763cd4d
+760, 0x44b7240c4b105242
+761, 0x4c6af2a1b606ccfb
+762, 0x18fc43ece2ec1a40
+763, 0x859a5511aeae8acb
+764, 0x2f56826f1996ad2f
+765, 0xa8e95ce8bb363bdf
+766, 0xf4da396054e50e4b
+767, 0x5493865e9895883c
+768, 0x768e4c8b332ac0e3
+769, 0x32195d2aa583fca5
+770, 0xf2f353f21266bc15
+771, 0x43cddf1d021307d
+772, 0x6031e3aa30300e4a
+773, 0x4f1298469ac6088f
+774, 0x4b4d450bafac574e
+775, 0x23e1cf9c0582a22b
+776, 0x2e9036980db49cd0
+777, 0xe4e228b113c411b2
+778, 0x8bddcdb82b51706
+779, 0xd2a7ea8288593629
+780, 0x67fe90e98fdda61
+781, 0x7b63494dba95717b
+782, 0x105625904510d782
+783, 0xdf4aa2242454e50a
+784, 0x32541d6cd7d6c7e3
+785, 0x5661fb432591cf3b
+786, 0xce920a5ed047bce7
+787, 0xed4178a3c96eea8f
+788, 0xe378cd996e39863b
+789, 0x169e1fdc8e2b05e1
+790, 0xaee1812ef7149a96
+791, 0x648571c7453d12c5
+792, 0xb7b6bc9328573c43
+793, 0xe7fb969078e270d7
+794, 0xdfc2b1b8985f6e6f
+795, 0x862b6527ee39a1aa
+796, 0x1ee329aea91d7882
+797, 0x20d25324f2fe704
+798, 0xbfcc47401fc3bbfd
+799, 0x1515cdc8d48b2904
+800, 0xbd6eefe86284261c
+801, 0x9b1f28e3b35f22ee
+802, 0x842a29d35e5aecda
+803, 0xf2346109ad370765
+804, 0x24d68add5a71afd9
+805, 0x4a691421613d91e2
+806, 0x60e3058b3c244051
+807, 0x79194905cdaa5de8
+808, 0xe0e2df35c01e8987
+809, 0xe29b78beffbb5e4a
+810, 0xcdcdbc020218c19e
+811, 0x5ae0af8c16feae43
+812, 0x8109292feeaf14fa
+813, 0x34113f7508dfa521
+814, 0xc062ac163f56730a
+815, 0xf1660e66ec6d4c4c
+816, 0x5966c55f60151c80
+817, 0x3865ae8ec934b17
+818, 0x472a7314afb055ec
+819, 0x7a24277309a44a44
+820, 0x556e02dd35d38baa
+821, 0x9849611a1bc96ec1
+822, 0xd176f5d5a8eb0843
+823, 0x44db12ec60510030
+824, 0x272e3a06a0030078
+825, 0x7c4764dbefc075ea
+826, 0x910712f3735c1183
+827, 0xd49a2da74ae7aff6
+828, 0xcf9b3e6e8f776d71
+829, 0x27789fe3ec481a02
+830, 0x86659f82c6b5912b
+831, 0xe044b3dbf339158c
+832, 0x99d81f6bb62a37b0
+833, 0x5f5830c246fada9a
+834, 0xe68abab1eeb432cb
+835, 0x49c5c5ace04e104
+836, 0x1ac3871b3fc6771b
+837, 0x773b39f32d070652
+838, 0x9c4138c2ae58b1f3
+839, 0xac41c63d7452ac60
+840, 0x9248826b245359e1
+841, 0x99bba1c7a64f1670
+842, 0xe0dc99ff4ebb92f2
+843, 0x113638652740f87c
+844, 0xebf51e94da88cfc
+845, 0x5441c344b81b2585
+846, 0xe1e69e0bc2de652a
+847, 0xe9ab6d64ae42ed1e
+848, 0x879af8730e305f31
+849, 0x36b9ad912c7e00d6
+850, 0x83ef5e9fca853886
+851, 0xda54d48bb20ea974
+852, 0x32c6d93aefa92aa2
+853, 0x4e887b2c3391847d
+854, 0x50966e815f42b1b8
+855, 0x53411ac087832837
+856, 0x46f64fef79df4f29
+857, 0xb34aae3924cd272c
+858, 0xf5ad455869a0adbe
+859, 0x8351ded7144edac8
+860, 0xeb558af089677494
+861, 0x36ed71d69293a8d6
+862, 0x659f90bf5431b254
+863, 0x53349102b7519949
+864, 0x3db83e20b1713610
+865, 0x6d63f96090556254
+866, 0x4cc0467e8f45c645
+867, 0xb8840c4bd5cd4091
+868, 0xbd381463cc93d584
+869, 0x203410d878c2066d
+870, 0x2ebea06213cf71c8
+871, 0x598e8fb75e3fceb4
+872, 0xdcca41ceba0fce02
+873, 0x61bf69212b56aae5
+874, 0x97eed7f70c9114fa
+875, 0xf46f37a8b7a063f9
+876, 0x66c8f4ffe5bd6efa
+877, 0xe43fd6efda2d4e32
+878, 0x12d6c799e5ad01de
+879, 0x9ac83e7f8b709360
+880, 0xbbb7bb3c1957513d
+881, 0x7f87c08d4b3796b0
+882, 0x9a7d1d74b6aa4a5c
+883, 0xa4314530ff741b6f
+884, 0x99a80c6b6f15fca8
+885, 0xd2fec81d6d5fc3ce
+886, 0x15a98be1cc40cea
+887, 0x98693eb7719366f3
+888, 0x36ccdc2a9e9d4de8
+889, 0x3c8208f63d77df25
+890, 0xca2e376e2343df6
+891, 0xcc9b17cbb54420c6
+892, 0x8724c44a64d7dcb8
+893, 0x9d00c6949ff33869
+894, 0xf4f8e584d2699372
+895, 0x88f4748cdd5a2d53
+896, 0xe215072a1205bc6d
+897, 0x190934fe6d740442
+898, 0x7fac5c0ab2af106d
+899, 0x1b86633a0bd84fa1
+900, 0x1293e54318492dfb
+901, 0x433324fd390f34b9
+902, 0x4c5eb2c67a44643b
+903, 0x59a6e281c388b0dd
+904, 0xe78e03f9c44623b7
+905, 0x91307a93c768fc3d
+906, 0xde8867b004d8e3ff
+907, 0xdf52c3f57b7c5862
+908, 0x993f3e1d10358a92
+909, 0x9ccb10bc3e18662d
+910, 0x45093ce48a114c73
+911, 0xd59d05979d26330a
+912, 0x417c0e03300119a9
+913, 0x1c336500f90cde81
+914, 0x1c8ccd29ead9b85b
+915, 0xb76baf3e55d4d950
+916, 0x133ad6196c75fd7e
+917, 0x34200b0cde7ed560
+918, 0x9c7c3dacb213c8d9
+919, 0xd97563c4fd9bf1b6
+920, 0x5d910e871835b6cb
+921, 0x7d46c4733a16bdf9
+922, 0xe41d73194ddc87b2
+923, 0x7d3d8a0855a465a9
+924, 0x70c2a8b5d3f90c0f
+925, 0x9e7565ca5dccfe12
+926, 0x2c0acb4577aa51b1
+927, 0x3d2cd211145b79c7
+928, 0x15a7b17aa6da7732
+929, 0xab44a3730c27d780
+930, 0xf008bd6c802bde3a
+931, 0x82ed86ddf3619f77
+932, 0xaabe982ab15c49f9
+933, 0x9bcad8fa6d8e58a4
+934, 0x8f39ed8243718aa1
+935, 0xe9489340e03e3cb6
+936, 0xc722314f5eefb8d0
+937, 0x870e8869a436df59
+938, 0x4dae75b8087a8204
+939, 0xe1d790f6ec6e425b
+940, 0xafd39ea1b1d0ed09
+941, 0xdf2c99e464ddf08f
+942, 0x74936d859ab9644d
+943, 0x3871302164250e73
+944, 0x764b68921e911886
+945, 0x2a1d024b26bb9d66
+946, 0x797fba43918e75b4
+947, 0x62ec6d24ccca335b
+948, 0xf4bd8b951762b520
+949, 0x9d450dede9119397
+950, 0x5393a26d10f8c124
+951, 0x6b74769392896b57
+952, 0x7f61dbcc0e328581
+953, 0x64e1df3884d0d94
+954, 0xba77dcdf23738c37
+955, 0xf8e288bc0a177475
+956, 0x4a8abfd1702ecb7d
+957, 0x53f22886694736a7
+958, 0x8fc982597ced3e3
+959, 0x1bc46090f820fff7
+960, 0x8bd31f965d02229f
+961, 0x65cd0cb29996ee53
+962, 0x702e0f4fcf8c2e9f
+963, 0x293b77bff307a9a0
+964, 0x125a986b8b305788
+965, 0x416b0eea428ebf3c
+966, 0xeac85421ab0e8469
+967, 0x7f5496095019aa68
+968, 0x1a96d7afbc708e0
+969, 0xb91262e6766e01e1
+970, 0xd0a549cc4ccc6954
+971, 0x75a9a073f50c8a0d
+972, 0xae275d2c1c6cd23c
+973, 0xcf159b5ec5d28fd4
+974, 0x75d0838ce9b92b
+975, 0xd4eddcee6dc4677f
+976, 0x6a0a8ad5df6b75b8
+977, 0x6f3fd0ef0f13ecc4
+978, 0xb75a5826c1a8f8a8
+979, 0xd47098bbc7943766
+980, 0x3d4ddd62d5f23dd1
+981, 0x760a904e4583841c
+982, 0x2afeb5022b4cf1f
+983, 0x66d5f653729f0a13
+984, 0x9a6a5ab62980d30f
+985, 0xc332f5643bbf8d5b
+986, 0x848fb702e4056a90
+987, 0xa057beaf3f9e8c5f
+988, 0x6cc603e4560a6c6a
+989, 0xec761811a7b23211
+990, 0xb14aa4090a82aaa5
+991, 0xe29d9d028a5b2dbb
+992, 0x5564e53738d68f97
+993, 0xfabca36542eaaf3b
+994, 0xb9912fcb782020a2
+995, 0xe865e01b349284fd
+996, 0x540b5ff11c5f9274
+997, 0x3463f64e1e7451dc
+998, 0xe15d3e2f33b735f8
+999, 0xf5433336eadef6e
diff --git a/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-2.csv b/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-2.csv
new file mode 100644
index 000000000..70aebd5d5
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/data/sfc64-testset-2.csv
@@ -0,0 +1,1001 @@
+seed, 0x0
+0, 0x91959e5fb96a6332
+1, 0x3c1dd8a25a7e9f21
+2, 0x657bdffc99798d9e
+3, 0x1a04de320b19e022
+4, 0x65b92af0e5f3c61c
+5, 0x9c84070ce8f743c0
+6, 0xbb10e573693cdb25
+7, 0xd65ea9e76b37fb6b
+8, 0x503efd0e76c8ae66
+9, 0xd711dcd04c26d0f
+10, 0x12f53f435814ac8c
+11, 0xb392cd402cfc82bd
+12, 0x461764550e06c889
+13, 0x716a48b3514e6979
+14, 0xdd0a322213c18ad7
+15, 0x6673a8ca0a05c4d7
+16, 0x2992ef333437f844
+17, 0xc4aaf7e8240b2aad
+18, 0x6ab0a1af1f41474f
+19, 0xb0bae400c226941d
+20, 0xe5f80c2eeeab48c6
+21, 0x3832c6a93a4024bf
+22, 0x280bd824fabe8368
+23, 0x66b626228321e5ff
+24, 0xe0bdfba5325a307e
+25, 0x3a5f65c6ef254e05
+26, 0x99ea12503cb02f94
+27, 0x5d01fd2db77d420b
+28, 0x6959bf5f36b2368d
+29, 0xd856e30c62b5f5be
+30, 0xe33233e1d8140e66
+31, 0xb78be619d415fa8d
+32, 0x4f943bb2cc63d3b
+33, 0x9b1460b290952d81
+34, 0x19205d794826740e
+35, 0x64617bd9d7a6a1ff
+36, 0x30442124b55ea76a
+37, 0xebbbc3b29d0333fc
+38, 0x39235a0fe359751c
+39, 0xf9629768891121aa
+40, 0x32052f53f366e05a
+41, 0x60cc5b412c925bc8
+42, 0xf8b7ecda1c0e5a9
+43, 0x195f036e170a2568
+44, 0xfe06d0381a9ca782
+45, 0x919d89e8b88eebbf
+46, 0xa47fb30148cf0d43
+47, 0x5c983e99d5f9fd56
+48, 0xe7492cdb6a1d42cd
+49, 0xf9cfe5c865b0cfd8
+50, 0x35b653367bbc3b99
+51, 0xb1d92f6f4d4e440b
+52, 0x737e1d5bd87ed9c0
+53, 0x7a880ca1498f8e17
+54, 0x687dae8494f9a3f7
+55, 0x6bae1989f441d5d7
+56, 0x71ad3fa5a9195c2e
+57, 0x16b3969779f5d03
+58, 0xd1bce2ac973f15b3
+59, 0xa114b1ee2ce0dcdd
+60, 0x270d75c11eb1b8d5
+61, 0xc48ffa087c0a7bc
+62, 0xaaf9dc48cda9848d
+63, 0x8111cf10ef6e584d
+64, 0x6736df6af40ee6f4
+65, 0x1a1a111682fbf98d
+66, 0xeb217658e1cb3b5d
+67, 0xcaf58a8b79de9dec
+68, 0x25d0ffd63c88d7a1
+69, 0x4c498cd871b7f176
+70, 0x4069a6156eb0cf3c
+71, 0xdf012f12edcdd867
+72, 0x7734c0ac8edb1689
+73, 0xed6960ac53dbc245
+74, 0x305e20da8868c661
+75, 0x5f0c7a3719956f95
+76, 0x66842bbe3b28895
+77, 0xb608bc9a31eac410
+78, 0xfcb17d5529503abd
+79, 0x829ae5cbc29b92ee
+80, 0x17f2f0027bc24f3a
+81, 0x435926c33d8f44cc
+82, 0x3ab899327098dbec
+83, 0xaf78573b27f8ead8
+84, 0xa8b334fabcf8dc60
+85, 0xcdf3b366a6a303db
+86, 0x8da9379dd62b34c8
+87, 0xb0ba511955f264a7
+88, 0x9d72e21a644f961d
+89, 0xfac28382e2e7e710
+90, 0xd457065f048410aa
+91, 0x1cae57d952563969
+92, 0x5a160a6223253e03
+93, 0x2c45df736d73c8bd
+94, 0x7f651ebc6ad9cec5
+95, 0x77a6be96c7d2e7e7
+96, 0x1721fb1dbfd6546a
+97, 0xf73f433ecff3c997
+98, 0xed1e80f680965bfe
+99, 0x6705ad67a3003b30
+100, 0xac21134efcadb9f7
+101, 0x4d2ba0a91d456ac
+102, 0x59da7b59434eb52b
+103, 0x26c1d070fd414b5f
+104, 0xed7079ddfce83d9a
+105, 0x9277d21f88e0fb7a
+106, 0xfae16b9a8d53d282
+107, 0xb08a0e2e405fdf7d
+108, 0x2ea20df44229d6ec
+109, 0x80e4634cd3612825
+110, 0xbe62e8aeba8f8a1a
+111, 0x4981209769c190fb
+112, 0xcec96ef14c7e1f65
+113, 0x73fe4457b47e7b53
+114, 0x1d66300677315c31
+115, 0xe26821290498c4cc
+116, 0xf6110248fd8fb1c5
+117, 0x30fd7fe32dbd8be3
+118, 0x534ec9b910a2bd72
+119, 0x8f9bfe878bbf7382
+120, 0x4f4eb5295c0c2193
+121, 0xdeb22f03a913be9e
+122, 0x40f716f8e2a8886c
+123, 0xc65007d0e386cdb1
+124, 0x9bdd26d92b143a14
+125, 0xf644b0b77ea44625
+126, 0x75f5a53f6b01993a
+127, 0xfe803e347bf41010
+128, 0x594bff5fa17bc360
+129, 0x3551edfb450373c7
+130, 0x898f9dad433615db
+131, 0x923d2406daa26d49
+132, 0x99e07faccbc33426
+133, 0x7389f9ff4470f807
+134, 0xdc2a25957c6df90b
+135, 0x33c6d8965ef3053f
+136, 0x51a8f07e838f1ab
+137, 0x91c5db369380274f
+138, 0xc37de65ac56b207e
+139, 0xfcc6d2375dde7f14
+140, 0xa4e6418bff505958
+141, 0x4b8b9f78e46953c4
+142, 0x255ab2e0f93cf278
+143, 0xdf650717af3d96ef
+144, 0x2caa21cba3aae2b2
+145, 0xce7e46c6f393daa4
+146, 0x1d5b3573f9997ac7
+147, 0x5280c556e850847d
+148, 0x32edc31bef920ad7
+149, 0xefaa6b0b08cf2c6
+150, 0x5151c99d97b111c5
+151, 0x35ccf4bf53d17590
+152, 0xa210d7bd8697b385
+153, 0xa9419f95738fbe61
+154, 0xdeccf93a1a4fdc90
+155, 0xd0ea3365b18e7a05
+156, 0x84122df6dcd31b9a
+157, 0x33040a2125cea5f5
+158, 0xfe18306a862f6d86
+159, 0xdb97c8392e5c4457
+160, 0xc3e0fa735e80e422
+161, 0x7d106ff36467a0c1
+162, 0xb9825eecc720a76d
+163, 0x7fefc6f771647081
+164, 0xf5df3f5b3977bf13
+165, 0x18fb22736d36f1e0
+166, 0xadc4637b4953abfc
+167, 0x174e66d3e17974bd
+168, 0xf1614c51df4db5db
+169, 0x6664ecde5717b293
+170, 0xd5bc5b6839265c26
+171, 0xf6ca9ce1af3f1832
+172, 0xca696789a9d506ea
+173, 0x7399c246c8f9d53
+174, 0xadf49049626417e2
+175, 0xbcd84af37d09ab91
+176, 0xbb41c177f3a3fa45
+177, 0x592becc814d55302
+178, 0xa88b4e65f6cfe5f7
+179, 0xa0a55e34ff879426
+180, 0x3c2ea6aa725b42b7
+181, 0x65ac4a407b1f9521
+182, 0xde63d53f7e88b556
+183, 0x18bc76696d015f40
+184, 0xd1363f2cd4c116a8
+185, 0x2fe859be19a48e4a
+186, 0x83d6099b1415e656
+187, 0x43f2cbc1a4ee6410
+188, 0xb2eca3d3421c533d
+189, 0xc52b98ea3f031f5d
+190, 0xfe57eb01da07e9d1
+191, 0xf9377883537a6031
+192, 0x364030c05dac7add
+193, 0x6815cb06b35d4404
+194, 0xceae2d4ce31894be
+195, 0xc602bcdf6062bf6a
+196, 0xc8e4bd8dcc6062e3
+197, 0x9c29e87b92a1a791
+198, 0x41e626b871ca9651
+199, 0x325c3d1fb8efbcd8
+200, 0x7dbbacf8e3419fb3
+201, 0x3602e72516bb7319
+202, 0x537a008ebd94d24b
+203, 0xda7714fc9d4d161d
+204, 0x1c8c73700e1b621b
+205, 0x2749b80937d6c939
+206, 0x76ee6abac5b14d33
+207, 0xf18d1e92cb6a8b5c
+208, 0x6ce9579d9291c721
+209, 0x60523c745a40e58
+210, 0x637f837fcc901757
+211, 0x2ff71b19661dc5b3
+212, 0x393ab586326ad16f
+213, 0xa0970ea30fe742b7
+214, 0x570222d7f27fe5ae
+215, 0x3b5806d43fd38629
+216, 0x129a0ad7420180c5
+217, 0x1c4726355778d52c
+218, 0x7c1459cf77656499
+219, 0xfe038a0932132069
+220, 0x4c4cc317a937483a
+221, 0xa333d24067e926ba
+222, 0x401d9b6ab37f6ef2
+223, 0x87ad0e491ebe4a2a
+224, 0xfc02f312e72d121d
+225, 0xfde715b3b99767b2
+226, 0xd111c342ba521c92
+227, 0x83b221b10879c617
+228, 0x6a1bf5c01fdf4277
+229, 0x166bfc0c3f5892ee
+230, 0x4608d556d7c57856
+231, 0x8d786857c95ece49
+232, 0x2d357445a1aca4ac
+233, 0x79620dae28ecd796
+234, 0x90e715dc0f2201c4
+235, 0x173b68b4c9f4b665
+236, 0x4e14d040ebac4eef
+237, 0xbd25960b4b892e
+238, 0x911a199db6f1989d
+239, 0xfe822d7c601fd2e0
+240, 0x9b4c1d58d8223a69
+241, 0x907c1891283843b0
+242, 0xf4868bf54061c4b2
+243, 0x17f8cd1fc24efd85
+244, 0xd44253f9af14c3aa
+245, 0x16d0da0cb911d43c
+246, 0x3c6a46615828e79a
+247, 0x498591c1138e11a5
+248, 0xcc0f26336d0d6141
+249, 0x4d3ebc873212309a
+250, 0x16bad7792d5c2c6a
+251, 0x474215a80b2bbd11
+252, 0x7159848abd8492fc
+253, 0x359341c50973685f
+254, 0x27512ee7bf784a4a
+255, 0x45228ea080f70447
+256, 0x880cab616500d50e
+257, 0x12fae93f9830d56e
+258, 0x6744ee64348d9acd
+259, 0x484dada28cd2a828
+260, 0x98491d0729e41863
+261, 0x2f15aac43c2863b0
+262, 0x5727a34d77a1da0f
+263, 0xa435cebef6a62eed
+264, 0xd211697d57b053b0
+265, 0x65aa757b68bd557
+266, 0xe3a1b7a2d8a3e06a
+267, 0x2adf64e67252a7a9
+268, 0xadadcb75cadee276
+269, 0x7934bc57ac8d97bf
+270, 0xccff0d0f412e0606
+271, 0x101a82aa3e8f3db9
+272, 0xb0f2498094b4575c
+273, 0xba2561d9ef26ed8a
+274, 0xfbcd1268fc3febe1
+275, 0x9aa10bb19eb152e0
+276, 0xf496217a601a6d72
+277, 0xe4be1e4f2fa91363
+278, 0x473a602bf3dd68eb
+279, 0xfe8ed2a48c26f4b5
+280, 0x20e94b1a00159476
+281, 0x93e1cb1c6af86ec7
+282, 0x4fcba3898f7442ba
+283, 0x5150c3a3d94891df
+284, 0x91cfce6c85b033ea
+285, 0x625e8a832a806491
+286, 0x28c97ba72e3ec0b2
+287, 0x8e172de217c71ea1
+288, 0x926b80216c732639
+289, 0x28b19431a649ae3d
+290, 0x57c039a6e95a3795
+291, 0xfbc354182fe52718
+292, 0x819dfd7c7d534cef
+293, 0xabb4093a619ed44f
+294, 0xe785b7ac6f656745
+295, 0xb647b4588b2f942f
+296, 0x64cf870a14c72d27
+297, 0x6d4a4a2a0ba9b37e
+298, 0x78bfb0427d7ce6b0
+299, 0x8dcc72b8bfc79ac6
+300, 0x1c14d915d5e76c99
+301, 0xaf48ddea6f096d79
+302, 0x51b39b67aa130d8
+303, 0x1aeeb39d4def06de
+304, 0xd678092ffedfdd27
+305, 0x8f54787f325111d3
+306, 0xf2ca2e827beaa6bc
+307, 0x339d134099e98545
+308, 0x1f6a8a7b33942e43
+309, 0x952c8065dbef669a
+310, 0xe066aeb6690147f7
+311, 0xed25aa92cf58ebb6
+312, 0x7601edce215ef521
+313, 0xed1c5b396abd9434
+314, 0x4fd1e407535de9d5
+315, 0xccc8315a0d4d1441
+316, 0x85753e250bb86976
+317, 0xf232e469378761c3
+318, 0x81d691b8e9aef3c6
+319, 0x224a2f9cab0ad0e
+320, 0x978f3d3e50007f4e
+321, 0xd3713e6a6c0cbe60
+322, 0xcce8f1eadd41f80d
+323, 0x34bda028a97d469
+324, 0x90e242fdf0f59183
+325, 0x4d749754fbc5f092
+326, 0x4399f5b7851cc87b
+327, 0xcb921a5f25f6c5d7
+328, 0x120bf5d0162101
+329, 0x1304cc2aa352735a
+330, 0xf7236c5d0d5d417b
+331, 0xc31b320fc1654306
+332, 0xb468c6b23f3fb4e7
+333, 0xb5985b5bfaca4166
+334, 0x898285a1cd2f8375
+335, 0xa13493da372aa7c9
+336, 0x15c80c09c12634e7
+337, 0x9b765c5cc9d438bd
+338, 0xee7da816a9201dcb
+339, 0x92e269f73b5a248e
+340, 0xa8086c5de81400ce
+341, 0xe0053901853d42be
+342, 0x821df32c012f433e
+343, 0x17a6d69ca37387c7
+344, 0x2b10044bfba3501f
+345, 0x8dfd262afc2e8515
+346, 0xd68c2c7b60226371
+347, 0xe81ac114e4416774
+348, 0x5896d60061ebc471
+349, 0xa996e3147811dbd1
+350, 0xa819c7b80ecb3661
+351, 0x982ad71b38afbc01
+352, 0xab152b65aa17b7fe
+353, 0x4582bc282ef187ef
+354, 0xab5a17fe8d9bc669
+355, 0x83664fa9cb0284b7
+356, 0x234c4b0091968f52
+357, 0x8ab5f51805688d37
+358, 0xe9e11186e0c53eda
+359, 0x10df37ef1de2eccf
+360, 0x780f1b0d52db968f
+361, 0x50bd4ff292872cd5
+362, 0x51e681c265f5ad0
+363, 0x842c49660a527566
+364, 0x6e56ee026e9eda87
+365, 0x4cf39e40d8c80393
+366, 0x13e466df371f7e1f
+367, 0xf2ce1799f38e028e
+368, 0x833c8db7adc6ff0e
+369, 0xc6e189abc2ec98f
+370, 0xafebb3721283fec5
+371, 0xb49bc1eb5cc17bdc
+372, 0xf1d02e818f5e4488
+373, 0xe5e9d5b41a1dd815
+374, 0xce8aca6573b1bfe5
+375, 0x9b0a5d70e268b1d5
+376, 0xf3c0503a8358f4de
+377, 0x2681605dd755669d
+378, 0xea265ca7601efc70
+379, 0xa93747f0a159439f
+380, 0x62a86ede78a23e50
+381, 0xac8a18935c3d063c
+382, 0x729c0a298f5059f5
+383, 0xbbf195e5b54399f4
+384, 0x38aa9d551f968900
+385, 0x3b3e700c58778caa
+386, 0x68e6e33c4443957a
+387, 0x7c56fc13eb269815
+388, 0xaf7daca39711804a
+389, 0x50fde6d10f9544b3
+390, 0xf3d37159f6f6c03d
+391, 0x82d298f5c1a71685
+392, 0x478661ac54c5002c
+393, 0x6053768e1a324ae0
+394, 0xde8fb4a7e56707ea
+395, 0xaa2809301faa8cf4
+396, 0x690a8d49fedd0722
+397, 0xe17c481b9c217de9
+398, 0x60d1d8a2b57288e3
+399, 0x149adfaadc6b0886
+400, 0xa3c18b6eb79cd5fa
+401, 0x5774e3a091af5f58
+402, 0x2acca57ff30e5712
+403, 0x94454d67367c4b0c
+404, 0x581b2985ac2df5ca
+405, 0x71618e50744f3e70
+406, 0x270a7f3bd9a94ae6
+407, 0x3ef81af9bb36cd7b
+408, 0x8a4a2592875254aa
+409, 0x704ac6086fbb414a
+410, 0xda774d5d3f57414d
+411, 0xe20d3358b918ae9e
+412, 0x934a6b9f7b91e247
+413, 0xf91649cde87ec42c
+414, 0x248cec5f9b6ced30
+415, 0x56791809fd8d64ba
+416, 0xf502b2765c1395f
+417, 0x6b04ec973d75aa7f
+418, 0xb0339f2794bb26f
+419, 0x4c524636efbaea49
+420, 0x6bbf3876e9738748
+421, 0xf686524e754e9e24
+422, 0x8dafa05a42d19cd3
+423, 0xc5f069ab2434008e
+424, 0x4fd64cc713cba76
+425, 0xdbf93450c881ed5f
+426, 0x492e278ebabb59a2
+427, 0x993fddfde4542642
+428, 0xecde68a72c8d4e52
+429, 0xe0760b3074c311fd
+430, 0x68dc0e7e06528707
+431, 0x52b50edf49c0fdc7
+432, 0xb2bd4185c138f412
+433, 0x431496d7e1d86f3
+434, 0xa4e605b037e26c44
+435, 0x58236ae1f0aca2b5
+436, 0x26c72c420fc314d8
+437, 0x20134e982ab99a2b
+438, 0x544b59b8b211374b
+439, 0x1301c42f3a14d993
+440, 0x52a6ea740f763b0f
+441, 0xf209d70c2bebf119
+442, 0xac66a4ebc2aa1be
+443, 0x683713ed35878788
+444, 0x2b5578acec06b80c
+445, 0x86428efa11c45b36
+446, 0xb49010adb17d291e
+447, 0x73b686bd8664b6be
+448, 0x6d28ebf57b6884cc
+449, 0x9712091230ff58d9
+450, 0xc9c91f74c38b286
+451, 0x776310ac41dc008e
+452, 0x2f3739df0bf6a88e
+453, 0x5792dc62b94db675
+454, 0x5715910d024b06af
+455, 0xeb1dd745458da08
+456, 0xfce7b07ccfa851a7
+457, 0xc305f1e983ac368
+458, 0x485aa9519ac00bb0
+459, 0xa5354f6589fb0ea0
+460, 0x32fee02dfdbf4454
+461, 0x4d1ddc304bbefaaa
+462, 0x789a270a1737e57e
+463, 0x9f3072f4b1ed8156
+464, 0x4de3c00e89058120
+465, 0xb00a02529e0a86fa
+466, 0x539f6f0edd845d9a
+467, 0x85e578fe15a8c001
+468, 0xa12c8e1a72cce7d8
+469, 0xc6908abbc2b1828
+470, 0xcf70090774cbb38c
+471, 0x3b636a6977b45d4a
+472, 0xf0a731b220680b57
+473, 0x18973929f51443a8
+474, 0xe93e1fbe7eadabe
+475, 0x8233730f0a6dfa02
+476, 0x66e50b6919b0ab74
+477, 0xb1aba87c97fd08a2
+478, 0xd4dffc1fbc117ad6
+479, 0x6f7fa65724b96e6a
+480, 0x4bd5800dee92e0fa
+481, 0xe18a959db6256da
+482, 0xe53a291bc66df487
+483, 0xb7ec306a08651806
+484, 0x1847a6b80d2821e1
+485, 0xda50391283b14d39
+486, 0xacc4d3cd7cceb97a
+487, 0x57f70185165b7bc6
+488, 0x302b6d597c3aaba7
+489, 0xa47f32d037eab51e
+490, 0xe1509b4408abc559
+491, 0x4f30a1d7c2934157
+492, 0x2ad03e6c60b650b2
+493, 0x334d9c337b0a9064
+494, 0xc7f442821e7aac12
+495, 0xbcdeb09298694cdd
+496, 0xe42402389f8f0fb4
+497, 0xe5de56af539df727
+498, 0x7017f9b2101ee240
+499, 0x1ee5e68d5b10001d
+500, 0x436229051836387a
+501, 0xcd532d6d6ec38fb7
+502, 0x30a66606fdf38272
+503, 0xfdaa2ab9cf798496
+504, 0x4277b4adec70e7df
+505, 0x72cfc30256e0eaef
+506, 0x3c3359fd9bd34917
+507, 0xb7aa89598856efb0
+508, 0xf72226f8bf299ef5
+509, 0x258c499275a4356f
+510, 0x999a56bfc7f20d76
+511, 0x2b3e7432e20c18b
+512, 0x2d1251332f760cb5
+513, 0x7420e0eea62157c5
+514, 0xe85c895aa27cec3d
+515, 0x27a0545c7020d57c
+516, 0xc68638a65b4fff0d
+517, 0xfda473983a4ea747
+518, 0xd19fe65fb4c06062
+519, 0x6b1374e050ee15e4
+520, 0x80065ecd49bc4bef
+521, 0x4ee655954bc838de
+522, 0xe8fb777504a72299
+523, 0x86b652ea70f4bdde
+524, 0xcdc9e0fbde7e4f33
+525, 0x352c0a50cd3ac56
+526, 0x4b8605d368be75dc
+527, 0x1ac9ea8129efbc37
+528, 0x470325faa99f39c5
+529, 0x25dd7ef9adccf7a1
+530, 0x5ae2c7a03e965816
+531, 0xf733d2df59dacc7d
+532, 0xa05bbf0a8a1a7a70
+533, 0xe8aa3f102846ef5f
+534, 0xc9b85ec49ae71789
+535, 0xb904c14ed1cb1936
+536, 0x5ae618230b5f0444
+537, 0x97987fe47b5d7467
+538, 0xabb3aca8865ca761
+539, 0x38bfdf29d4508228
+540, 0x353654f408353330
+541, 0xeb7e92930ae4ef0d
+542, 0xec50f1a7ca526b96
+543, 0xd5e2dc08b5697544
+544, 0x24c7fd69d5ec32df
+545, 0x6f7e1095568b8620
+546, 0x6ed9c16ca13b3c8
+547, 0xe676ef460002130f
+548, 0xa3a01a3992c4b430
+549, 0xe2130406c3b1f202
+550, 0xa8f7263e2aedcd20
+551, 0xc45d71ef2e35f507
+552, 0x37155594021da7ba
+553, 0x22dc94f19de73159
+554, 0x7969fc6bffc5443f
+555, 0x97def7e44faa6bfe
+556, 0x8b940f5e8931d71f
+557, 0xd95b1dd3f1a3fdd5
+558, 0x1c83bfdca615701a
+559, 0xb7fcb56279ceca6b
+560, 0xd84f8950f20dcd0
+561, 0xb03343698de3cbe0
+562, 0xf64565d448d71f71
+563, 0xda52b4676e0ae662
+564, 0xda39c2c05b4ffb91
+565, 0xb35e2560421f6a85
+566, 0x1a7b108d48ac3646
+567, 0xc4e264dc390d79ed
+568, 0xa10727dfd9813256
+569, 0x40d23154e720e4f7
+570, 0xd9fa7cd7e313e119
+571, 0xcbf29107859e6013
+572, 0xc357338553d940b7
+573, 0x2641b7ab0bdfcbaa
+574, 0xd12f2b6060533ae7
+575, 0xd0435aa626411c56
+576, 0x44af4a488a9cec72
+577, 0xb934232ea8fa5696
+578, 0x760a8b12072b572d
+579, 0xfab18f9942cfa9b3
+580, 0x5676834c1fe84d16
+581, 0x9c54e4fddb353236
+582, 0xab49edfc9551f293
+583, 0x567f1fb45a871d
+584, 0x32a967c873998834
+585, 0x99240aad380ef8d1
+586, 0x7f66cbd432859a64
+587, 0x4cdc8a4658166822
+588, 0x984e3984a5766492
+589, 0xa3b2d0a3d64d3d94
+590, 0x177f667172f2affc
+591, 0xb1a90607a73a303f
+592, 0xe600b6c36427f878
+593, 0xf758f9834cb7f466
+594, 0x8ee9fce4a3f36449
+595, 0xcb8f11533e7da347
+596, 0xe7cf647794dabd7c
+597, 0xc9d92cfe6110806
+598, 0xea1335fa9145a1ec
+599, 0xbc6c29821d094552
+600, 0x37b9d6a858cc8bc3
+601, 0xf24e4c694929893e
+602, 0x55d025ce2d7d0004
+603, 0xccdc69acccf4267b
+604, 0xc491c04340c222eb
+605, 0xba50f75ecec9befb
+606, 0x1ec7bd85b8fe3bb9
+607, 0xe4de66498c59ae8a
+608, 0x38aa9e912712c889
+609, 0xcee0e43c5cc31566
+610, 0x72b69aa708fc7ed
+611, 0xdff70b7f6fa96679
+612, 0xd6d71d82112aadc3
+613, 0x365177892cb78531
+614, 0xa54852b39de4f72c
+615, 0x11dd5832bf16dd59
+616, 0x248a0f3369c97097
+617, 0xa14cec0260e26792
+618, 0x3517616ff142bed1
+619, 0x9b693ad39dab7636
+620, 0x739dff825e994434
+621, 0x67711e7356098c9
+622, 0xa81f8515d2fdf458
+623, 0xdac2908113fe568e
+624, 0xe99944ebc6e2806a
+625, 0x671728ca5b030975
+626, 0xfdad20edb2b4a789
+627, 0xedc6e466bd0369d2
+628, 0x88b5d469821f7e1b
+629, 0x2eabf94049a522a5
+630, 0x247794b7a2f5a8e3
+631, 0x278942bdbe02c649
+632, 0xbe5a9a9196ab99c1
+633, 0x75955060866da1b5
+634, 0xdedcfa149273c0b5
+635, 0xdbeb7a57758f3867
+636, 0x7b9053347a2c8d5a
+637, 0xa059b3f2eed338a5
+638, 0x59401a46ded3b79f
+639, 0x38044ba56a6d19fb
+640, 0x72c7221b4e77e779
+641, 0x526df3491a3a34da
+642, 0xc3b31184ba16c0c2
+643, 0xd94c7144488624af
+644, 0xcf966ee4dc373f91
+645, 0x62049e65dd416266
+646, 0x7c2adccb925bf8f
+647, 0xd5fa5c22ed4ef8e1
+648, 0xd00134ebd11f2cd1
+649, 0xfbdf81767bed3634
+650, 0x62e8cc8ff66b6e26
+651, 0x3a72d6bcd4f2dcf7
+652, 0xf1cd45b1b46a86ed
+653, 0x1271f98e0938bb9a
+654, 0x82e6927e83dc31fa
+655, 0x7b9b0e0acb67b92d
+656, 0x6df503e397b2e701
+657, 0x93888f6fb561e0c3
+658, 0x393fb6069a40291
+659, 0x967a7d894cc0754d
+660, 0x6e298996ad866333
+661, 0x5ff3cf5559d6ab46
+662, 0xd0d70508c40349f5
+663, 0xc64c66c0dd426b33
+664, 0x8fea340ee35c64dd
+665, 0xf9cd381eb3060005
+666, 0xfcc37c2799fc0b11
+667, 0x6a37c91d65b489fa
+668, 0x57231000fa0a0c9d
+669, 0x55f6e292c6703f9a
+670, 0xd0508ffbfa55a7a6
+671, 0x885db543276bdac8
+672, 0xc26dbe6a26b0e704
+673, 0x21f884874ebd709e
+674, 0x711f0b6c8f732220
+675, 0x354d0a361eaee195
+676, 0x721344d8d30b006a
+677, 0xa0e090a0d3a56f07
+678, 0x16b3d5d823a4952b
+679, 0x59d7874bc9eae7b6
+680, 0x9bbb32710076455f
+681, 0xd4fb22242ffabafd
+682, 0xe1d4ac6770be1d89
+683, 0xb259cedebc73dc8a
+684, 0x35faaa3b4246ab69
+685, 0x5d26addefdaee89
+686, 0x8e7ec350da0f3545
+687, 0xd0f316eed9f8fc79
+688, 0x98b2a52c9bf291b2
+689, 0xe4d294a8aca6a314
+690, 0x25bd554e6aa7673c
+691, 0xcfde5dcba5be2a6c
+692, 0xb5e01fb48d2d2107
+693, 0xe1caf28948028536
+694, 0xd434aa0a26f3ee9b
+695, 0xd17723381641b8f6
+696, 0xfe73bd1f3f3768a2
+697, 0x1cc6b1abd08d67e9
+698, 0x247e328371a28de0
+699, 0x502e7942e5a9104a
+700, 0x6a030fd242eb4502
+701, 0xa2ffe02744014ce8
+702, 0x59290763b18fe04e
+703, 0xcf14241564271436
+704, 0xb0fb73c3c1503aff
+705, 0x94e27c622f82137a
+706, 0x747a5b406ac3e1f0
+707, 0x9a914e96a732031d
+708, 0x59f68c6c8f078835
+709, 0x809d012c73eb4724
+710, 0x5b3c3b73e1b37d74
+711, 0xdde60ef3ba49cdf7
+712, 0x87a14e1f9c761986
+713, 0x4109b960604522af
+714, 0x122d0e1ed0eb6bb9
+715, 0xadc0d29e80bfe33
+716, 0xa25b1b44f5fc8e4e
+717, 0xbab85d8a9b793f20
+718, 0x825f4cbced0e7d1e
+719, 0x2d6ae8807acb37ea
+720, 0x8234420adce2e39
+721, 0x4a8ad4da6b804807
+722, 0x1e19f9bc215e5245
+723, 0x1d6f4848a916dd5e
+724, 0x9ac40dfcdc2d39cc
+725, 0x9f3524e3086155ec
+726, 0x861fffc43124b2ef
+727, 0xe640e3b756396372
+728, 0x41cb0f0c5e149669
+729, 0xe0bd37e1192e4205
+730, 0x62917d3858f4ce47
+731, 0xa36e7eb4d855820a
+732, 0x204b90255a3bf724
+733, 0x66ee83a0175535bc
+734, 0x2c14ce7c6b0c1423
+735, 0x85d9495fa514f70d
+736, 0x5a4fe45ead874dbc
+737, 0xe72248dcb8cfc863
+738, 0xfc21ff2932ed98cd
+739, 0xcbba1edd735b5cad
+740, 0x91ddc32809679bf5
+741, 0x192cdf2c7631ea1f
+742, 0xbbc451ddf2ea286f
+743, 0xad9e80cae2397a64
+744, 0x6918f0119b95d0e5
+745, 0xa40379017a27d70a
+746, 0x1aaeddb600e61e1
+747, 0x15afd93cbd7adda9
+748, 0x156719bc2b757ff4
+749, 0x13d9a59e2b2df49d
+750, 0x9a490986eaddf0a
+751, 0xef9a350f0b3eb6b4
+752, 0x5de7f6295ba4fa4d
+753, 0x7f37fd087c3fdb49
+754, 0xa9fe3749d6f3f209
+755, 0x50912ac036d9bfb
+756, 0x982cb4d726a441f8
+757, 0x8ca8d8af59b872d0
+758, 0x7f8adfb0ceeade8a
+759, 0xdad390ec742be44
+760, 0xa637944d0045be5b
+761, 0x3569a3b3af807061
+762, 0x9599da8eae14511d
+763, 0xc333e8d19589b01a
+764, 0xfb9b524a20b571e1
+765, 0xbd9dc8b37ce5c3e1
+766, 0x142333005fa389ac
+767, 0x1368bc37cd5bcce1
+768, 0x16094907ad6ecf73
+769, 0xb32c90dbba4c1130
+770, 0x82761d97c1747dd0
+771, 0x599f9f267ae3444d
+772, 0x79ad3382994852e1
+773, 0x2511f06d9ef06e54
+774, 0xb35e6ab7d5bbddae
+775, 0xfca9fa83a2988732
+776, 0x7d4350f0394ac3ba
+777, 0xa52a9527bb176ea3
+778, 0xb49fa0ceb2aa8353
+779, 0x1f62e504d1468cc0
+780, 0xe1a77bfccce6efc3
+781, 0x776cdff4dc0d6797
+782, 0x56612e39b652c1f2
+783, 0x5f096a29294eda04
+784, 0x7978abc3aabd8b23
+785, 0x79dd875e0485b979
+786, 0x8a98aa4d5735d778
+787, 0xcca43940f69d2388
+788, 0xb2d4b156f144f93a
+789, 0xbd528a676e9a862
+790, 0x2a394939c8e7ec5e
+791, 0xb1da900c6efe4abc
+792, 0x9869af479de4c034
+793, 0x78dbdfb88ac7c1db
+794, 0x18cb169143088041
+795, 0xe69e5461c51a3e13
+796, 0x5389fa16ea98183c
+797, 0xed7c80d1be1ea520
+798, 0x87246fc359758ced
+799, 0xab323eba95fae4ed
+800, 0xbc4c0dde7f8a1828
+801, 0xdb739f7955610b1a
+802, 0xecd8c68c3434cc
+803, 0x138c2eb88c477f44
+804, 0x28a65f96727aae41
+805, 0xdee879f2cf5629d
+806, 0x684f0c90ef20070f
+807, 0xa24a819ef5621800
+808, 0x8d0054f870e4fdcb
+809, 0x99e8c6e695b600b
+810, 0x50b705245891f7c3
+811, 0xc02eed3a6e58e51a
+812, 0x443d64e95443606c
+813, 0xca24959cfbd2d120
+814, 0xe072609ea48815bc
+815, 0xbcc715026590315b
+816, 0x3e76df24d7aa5938
+817, 0xd8ff04940d9b79ae
+818, 0x54474ce790059bcd
+819, 0x278390dd6aa70e81
+820, 0xf4df619fe35414e4
+821, 0x757d71270264e615
+822, 0x1e8a373699c11b23
+823, 0xef68c82046e67dd6
+824, 0xe280006599972620
+825, 0x234e095183b0f4d6
+826, 0xe3b7560ed9839749
+827, 0xcd5ec4086572332e
+828, 0xc41c0d4aaa279108
+829, 0x4b9cd6126bc16a6d
+830, 0x4a7252734f3e3dd0
+831, 0xb3132df156cc103a
+832, 0xf9e4abbf7b64464a
+833, 0xf936df27fb3c47b7
+834, 0x9142960873f6d71a
+835, 0x4ba6aa3235cdb10d
+836, 0x3237a2e765ba7766
+837, 0xd62f0b94c8e99e54
+838, 0x26b682f90a3ae41b
+839, 0x40ad5e82072b6f81
+840, 0xd0198101f5484000
+841, 0xe4fac60ba11c332
+842, 0x472d0b0a95ef9d38
+843, 0x8512557aec5a3d8f
+844, 0xef83169d3efd4de9
+845, 0x53fe89283e7a7676
+846, 0x2f50933053d69fc4
+847, 0x76f5e4362e2e53a2
+848, 0x8676fdccce28874a
+849, 0x2737764c1fb1f821
+850, 0x4a6f70afc066ab55
+851, 0x27f8e151e310fca4
+852, 0xd606960ccbe85161
+853, 0xcce51d7ddd270a32
+854, 0xb4235999794875c2
+855, 0x580084e358e884
+856, 0x2159d5e6dc8586d7
+857, 0x87bd54d8599b3ba4
+858, 0x3e9ade6a2181664
+859, 0x5e6e140406d97623
+860, 0x511545d5aa0080a2
+861, 0xf49d78ed219aac57
+862, 0xbece1f9c90b8ea87
+863, 0x1c741cac36a2c514
+864, 0x7453c141047db967
+865, 0xd751832a5037eba2
+866, 0x71370a3f30ada1f7
+867, 0x7c01cf2dcb408631
+868, 0x1052a4fbdccc0fa1
+869, 0x13d525c9df3fb6c
+870, 0xa3aa8dbfee760c55
+871, 0xc0288d200f5155cf
+872, 0x79f4bcd12af567c3
+873, 0x8160d163bb548755
+874, 0x5cf2995fb69fd2df
+875, 0xcc98ed01396639df
+876, 0xad95f1d9cfc8256e
+877, 0xa3df27d9fbdbfb9d
+878, 0x83e5f5dda4d52929
+879, 0x9adc05043009f55b
+880, 0xdfe8329dfde1c001
+881, 0x9980ccdd5298e6a2
+882, 0x636a7bd134f6ef56
+883, 0xef5ff780c4be6ba4
+884, 0x290d71dc77a56d16
+885, 0x6d65db9ff58de1e6
+886, 0x944b063b3805a696
+887, 0xce468ca2cce33008
+888, 0x5ba1ccb840f80f48
+889, 0x28ddce36fc9ad268
+890, 0x4f77ef254d507a21
+891, 0xce9b4057fadf3ab
+892, 0xb518bc68298730e6
+893, 0xd2eb5b8e2ec665b0
+894, 0xe1583303a4f87344
+895, 0x9d5a0df4fbe1bed5
+896, 0x2ba9bc03ec8cfd07
+897, 0x479ed880a96ca669
+898, 0xcedf96338324771a
+899, 0x312f4fc2da41ffaa
+900, 0xa0eb9cf23b5e1ed8
+901, 0xf8f88f975dc3f539
+902, 0x4a37e185d0e96e0f
+903, 0xf829654a5c0b46f9
+904, 0x3909cca7a7f8c7fb
+905, 0x4c2e1d66ceb45105
+906, 0xaffaa19e1db8af87
+907, 0x9ec498246bd18c76
+908, 0x21d51558edc089da
+909, 0xe8984112cd1b1561
+910, 0x7de1d2cf54b0c0e1
+911, 0xa06729aed50bfb9d
+912, 0xcf19f733e5db19e1
+913, 0x70edf2624ab777cd
+914, 0x46685becad10e078
+915, 0x825e0f6add46785
+916, 0x66d4af3b15f70de4
+917, 0xc676614b0666b21
+918, 0x282a916c864f5cb7
+919, 0x2707283a3f512167
+920, 0x37ff3afda7461623
+921, 0xc767eb1205e4ca86
+922, 0x46b359aecc4ea25b
+923, 0x67fbbb797a16dbb1
+924, 0x64fd4ba57122290e
+925, 0x8acc2a8ae59d8fac
+926, 0x64a49298599acc67
+927, 0xedf00de67177ce30
+928, 0x1ea9d8d7e76d2d2c
+929, 0x363fcac323f70eb2
+930, 0x19e6e3ec8a9712eb
+931, 0xca541e96b0961f09
+932, 0x4d8fd34c2822ec46
+933, 0x2fdd56a50b32f705
+934, 0xaac2fcf251e3fd3
+935, 0xb0c600299e57045c
+936, 0xd951ec589e909e38
+937, 0x4dc8414390cae508
+938, 0x537ef9d5e2321344
+939, 0xa57bc21fd31aa2dc
+940, 0xa3a60df564183750
+941, 0xbe69a5ce2e369fb6
+942, 0x7744601f4c053ec8
+943, 0x3838452af42f2612
+944, 0xd4f0dad7115a54e9
+945, 0x629cf68d8009a624
+946, 0x2211c8fa34cb98cb
+947, 0x8040b19e2213db83
+948, 0xb2a86d3ba2384fd
+949, 0x4b85cec4f93f0dab
+950, 0xc8d212d21ea6845d
+951, 0x5b271a03a4fe2be0
+952, 0xff4f671319ad8434
+953, 0x8e615a919d5afa96
+954, 0xea7f47c53161160a
+955, 0x33273930b13c6efc
+956, 0x98eedda27fb59c3c
+957, 0x188dc5e92e939677
+958, 0x9dbd0fa0911430f1
+959, 0x5b3dcf3fa75dfd2b
+960, 0x3f03846febdb275d
+961, 0x20cc24faea9e9cf6
+962, 0x854f3ac66199ff5d
+963, 0x31169ac99d341e6f
+964, 0xa85daed3c0bc1bbe
+965, 0x64633711e71ba5dd
+966, 0x530e79978dc73334
+967, 0x636f2ee6e20aef13
+968, 0xf6220f8b6d9a58fb
+969, 0x425db8fa32141a7b
+970, 0xac7c210f4b02be95
+971, 0x5fe8cfbe197a7754
+972, 0xfff7d40c79420ea
+973, 0x5f8bab9ef4697b77
+974, 0xaf6fe54e45b23fe8
+975, 0xce79456ccc70bbce
+976, 0x645ef680f48f1c00
+977, 0xa4dfac46e2028595
+978, 0x6bece4c41effc5df
+979, 0xd316df886442641f
+980, 0xa4f6ff994edd2a6
+981, 0x30281ae3cc49abe4
+982, 0x39acb7b663dea974
+983, 0x5e8829b01a7c06fb
+984, 0x87bdb08cf027f13e
+985, 0xdfa5ede784e802f6
+986, 0x46d03d55711c38cc
+987, 0xa55a961fc9788306
+988, 0xbf09ded495a2e57a
+989, 0xcd601b29a639cc16
+990, 0x2193ce026bfd1085
+991, 0x25ba27f3f225be13
+992, 0x6f685be82f64f2fe
+993, 0xec8454108229c450
+994, 0x6e79d8d205447a44
+995, 0x9ed7b6a96b9ccd68
+996, 0xae7134b3b7f8ee37
+997, 0x66963de0e5ebcc02
+998, 0x29c8dcd0d17c423f
+999, 0xfb8482c827eb90bc
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_direct.py b/venv/Lib/site-packages/numpy/random/tests/test_direct.py
new file mode 100644
index 000000000..dad12c8a8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_direct.py
@@ -0,0 +1,425 @@
+import os
+from os.path import join
+import sys
+
+import numpy as np
+from numpy.testing import (assert_equal, assert_allclose, assert_array_equal,
+                           assert_raises)
+import pytest
+
+from numpy.random import (
+    Generator, MT19937, PCG64, Philox, RandomState, SeedSequence, SFC64,
+    default_rng
+)
+from numpy.random._common import interface
+
+try:
+    import cffi  # noqa: F401
+
+    MISSING_CFFI = False
+except ImportError:
+    MISSING_CFFI = True
+
+try:
+    import ctypes  # noqa: F401
+
+    MISSING_CTYPES = False
+except ImportError:
+    MISSING_CTYPES = False
+
+if sys.flags.optimize > 1:
+    # no docstrings present to inspect when PYTHONOPTIMIZE/Py_OptimizeFlag > 1
+    # cffi cannot succeed
+    MISSING_CFFI = True
+
+
+pwd = os.path.dirname(os.path.abspath(__file__))
+
+
+def assert_state_equal(actual, target):
+    for key in actual:
+        if isinstance(actual[key], dict):
+            assert_state_equal(actual[key], target[key])
+        elif isinstance(actual[key], np.ndarray):
+            assert_array_equal(actual[key], target[key])
+        else:
+            assert actual[key] == target[key]
+
+
+def uniform32_from_uint64(x):
+    x = np.uint64(x)
+    upper = np.array(x >> np.uint64(32), dtype=np.uint32)
+    lower = np.uint64(0xffffffff)
+    lower = np.array(x & lower, dtype=np.uint32)
+    joined = np.column_stack([lower, upper]).ravel()
+    out = (joined >> np.uint32(9)) * (1.0 / 2 ** 23)
+    return out.astype(np.float32)
+
+
+def uniform32_from_uint53(x):
+    x = np.uint64(x) >> np.uint64(16)
+    x = np.uint32(x & np.uint64(0xffffffff))
+    out = (x >> np.uint32(9)) * (1.0 / 2 ** 23)
+    return out.astype(np.float32)
+
+
+def uniform32_from_uint32(x):
+    return (x >> np.uint32(9)) * (1.0 / 2 ** 23)
+
+
+def uniform32_from_uint(x, bits):
+    if bits == 64:
+        return uniform32_from_uint64(x)
+    elif bits == 53:
+        return uniform32_from_uint53(x)
+    elif bits == 32:
+        return uniform32_from_uint32(x)
+    else:
+        raise NotImplementedError
+
+
+def uniform_from_uint(x, bits):
+    if bits in (64, 63, 53):
+        return uniform_from_uint64(x)
+    elif bits == 32:
+        return uniform_from_uint32(x)
+
+
+def uniform_from_uint64(x):
+    return (x >> np.uint64(11)) * (1.0 / 9007199254740992.0)
+
+
+def uniform_from_uint32(x):
+    out = np.empty(len(x) // 2)
+    for i in range(0, len(x), 2):
+        a = x[i] >> 5
+        b = x[i + 1] >> 6
+        out[i // 2] = (a * 67108864.0 + b) / 9007199254740992.0
+    return out
+
+
+def uniform_from_dsfmt(x):
+    return x.view(np.double) - 1.0
+
+
+def gauss_from_uint(x, n, bits):
+    if bits in (64, 63):
+        doubles = uniform_from_uint64(x)
+    elif bits == 32:
+        doubles = uniform_from_uint32(x)
+    else:  # bits == 'dsfmt'
+        doubles = uniform_from_dsfmt(x)
+    gauss = []
+    loc = 0
+    x1 = x2 = 0.0
+    while len(gauss) < n:
+        r2 = 2
+        while r2 >= 1.0 or r2 == 0.0:
+            x1 = 2.0 * doubles[loc] - 1.0
+            x2 = 2.0 * doubles[loc + 1] - 1.0
+            r2 = x1 * x1 + x2 * x2
+            loc += 2
+
+        f = np.sqrt(-2.0 * np.log(r2) / r2)
+        gauss.append(f * x2)
+        gauss.append(f * x1)
+
+    return gauss[:n]
+
+def test_seedsequence():
+    from numpy.random.bit_generator import (ISeedSequence,
+                                            ISpawnableSeedSequence,
+                                            SeedlessSeedSequence)
+
+    s1 = SeedSequence(range(10), spawn_key=(1, 2), pool_size=6)
+    s1.spawn(10)
+    s2 = SeedSequence(**s1.state)
+    assert_equal(s1.state, s2.state)
+    assert_equal(s1.n_children_spawned, s2.n_children_spawned)
+
+    # The interfaces cannot be instantiated themselves.
+    assert_raises(TypeError, ISeedSequence)
+    assert_raises(TypeError, ISpawnableSeedSequence)
+    dummy = SeedlessSeedSequence()
+    assert_raises(NotImplementedError, dummy.generate_state, 10)
+    assert len(dummy.spawn(10)) == 10
+
+
+class Base:
+    dtype = np.uint64
+    data2 = data1 = {}
+
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = PCG64
+        cls.bits = 64
+        cls.dtype = np.uint64
+        cls.seed_error_type = TypeError
+        cls.invalid_init_types = []
+        cls.invalid_init_values = []
+
+    @classmethod
+    def _read_csv(cls, filename):
+        with open(filename) as csv:
+            seed = csv.readline()
+            seed = seed.split(',')
+            seed = [int(s.strip(), 0) for s in seed[1:]]
+            data = []
+            for line in csv:
+                data.append(int(line.split(',')[-1].strip(), 0))
+            return {'seed': seed, 'data': np.array(data, dtype=cls.dtype)}
+
+    def test_raw(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        uints = bit_generator.random_raw(1000)
+        assert_equal(uints, self.data1['data'])
+
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        uints = bit_generator.random_raw()
+        assert_equal(uints, self.data1['data'][0])
+
+        bit_generator = self.bit_generator(*self.data2['seed'])
+        uints = bit_generator.random_raw(1000)
+        assert_equal(uints, self.data2['data'])
+
+    def test_random_raw(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        uints = bit_generator.random_raw(output=False)
+        assert uints is None
+        uints = bit_generator.random_raw(1000, output=False)
+        assert uints is None
+
+    def test_gauss_inv(self):
+        n = 25
+        rs = RandomState(self.bit_generator(*self.data1['seed']))
+        gauss = rs.standard_normal(n)
+        assert_allclose(gauss,
+                        gauss_from_uint(self.data1['data'], n, self.bits))
+
+        rs = RandomState(self.bit_generator(*self.data2['seed']))
+        gauss = rs.standard_normal(25)
+        assert_allclose(gauss,
+                        gauss_from_uint(self.data2['data'], n, self.bits))
+
+    def test_uniform_double(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        vals = uniform_from_uint(self.data1['data'], self.bits)
+        uniforms = rs.random(len(vals))
+        assert_allclose(uniforms, vals)
+        assert_equal(uniforms.dtype, np.float64)
+
+        rs = Generator(self.bit_generator(*self.data2['seed']))
+        vals = uniform_from_uint(self.data2['data'], self.bits)
+        uniforms = rs.random(len(vals))
+        assert_allclose(uniforms, vals)
+        assert_equal(uniforms.dtype, np.float64)
+
+    def test_uniform_float(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        vals = uniform32_from_uint(self.data1['data'], self.bits)
+        uniforms = rs.random(len(vals), dtype=np.float32)
+        assert_allclose(uniforms, vals)
+        assert_equal(uniforms.dtype, np.float32)
+
+        rs = Generator(self.bit_generator(*self.data2['seed']))
+        vals = uniform32_from_uint(self.data2['data'], self.bits)
+        uniforms = rs.random(len(vals), dtype=np.float32)
+        assert_allclose(uniforms, vals)
+        assert_equal(uniforms.dtype, np.float32)
+
+    def test_repr(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        assert 'Generator' in repr(rs)
+        assert '{:#x}'.format(id(rs)).upper().replace('X', 'x') in repr(rs)
+
+    def test_str(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        assert 'Generator' in str(rs)
+        assert str(self.bit_generator.__name__) in str(rs)
+        assert '{:#x}'.format(id(rs)).upper().replace('X', 'x') not in str(rs)
+
+    def test_pickle(self):
+        import pickle
+
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        state = bit_generator.state
+        bitgen_pkl = pickle.dumps(bit_generator)
+        reloaded = pickle.loads(bitgen_pkl)
+        reloaded_state = reloaded.state
+        assert_array_equal(Generator(bit_generator).standard_normal(1000),
+                           Generator(reloaded).standard_normal(1000))
+        assert bit_generator is not reloaded
+        assert_state_equal(reloaded_state, state)
+
+        ss = SeedSequence(100)
+        aa = pickle.loads(pickle.dumps(ss))
+        assert_equal(ss.state, aa.state)
+
+    def test_invalid_state_type(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        with pytest.raises(TypeError):
+            bit_generator.state = {'1'}
+
+    def test_invalid_state_value(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        state = bit_generator.state
+        state['bit_generator'] = 'otherBitGenerator'
+        with pytest.raises(ValueError):
+            bit_generator.state = state
+
+    def test_invalid_init_type(self):
+        bit_generator = self.bit_generator
+        for st in self.invalid_init_types:
+            with pytest.raises(TypeError):
+                bit_generator(*st)
+
+    def test_invalid_init_values(self):
+        bit_generator = self.bit_generator
+        for st in self.invalid_init_values:
+            with pytest.raises((ValueError, OverflowError)):
+                bit_generator(*st)
+
+    def test_benchmark(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        bit_generator._benchmark(1)
+        bit_generator._benchmark(1, 'double')
+        with pytest.raises(ValueError):
+            bit_generator._benchmark(1, 'int32')
+
+    @pytest.mark.skipif(MISSING_CFFI, reason='cffi not available')
+    def test_cffi(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        cffi_interface = bit_generator.cffi
+        assert isinstance(cffi_interface, interface)
+        other_cffi_interface = bit_generator.cffi
+        assert other_cffi_interface is cffi_interface
+
+    @pytest.mark.skipif(MISSING_CTYPES, reason='ctypes not available')
+    def test_ctypes(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        ctypes_interface = bit_generator.ctypes
+        assert isinstance(ctypes_interface, interface)
+        other_ctypes_interface = bit_generator.ctypes
+        assert other_ctypes_interface is ctypes_interface
+
+    def test_getstate(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        state = bit_generator.state
+        alt_state = bit_generator.__getstate__()
+        assert_state_equal(state, alt_state)
+
+
+class TestPhilox(Base):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = Philox
+        cls.bits = 64
+        cls.dtype = np.uint64
+        cls.data1 = cls._read_csv(
+            join(pwd, './data/philox-testset-1.csv'))
+        cls.data2 = cls._read_csv(
+            join(pwd, './data/philox-testset-2.csv'))
+        cls.seed_error_type = TypeError
+        cls.invalid_init_types = []
+        cls.invalid_init_values = [(1, None, 1), (-1,), (None, None, 2 ** 257 + 1)]
+
+    def test_set_key(self):
+        bit_generator = self.bit_generator(*self.data1['seed'])
+        state = bit_generator.state
+        keyed = self.bit_generator(counter=state['state']['counter'],
+                                   key=state['state']['key'])
+        assert_state_equal(bit_generator.state, keyed.state)
+
+
+class TestPCG64(Base):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = PCG64
+        cls.bits = 64
+        cls.dtype = np.uint64
+        cls.data1 = cls._read_csv(join(pwd, './data/pcg64-testset-1.csv'))
+        cls.data2 = cls._read_csv(join(pwd, './data/pcg64-testset-2.csv'))
+        cls.seed_error_type = (ValueError, TypeError)
+        cls.invalid_init_types = [(3.2,), ([None],), (1, None)]
+        cls.invalid_init_values = [(-1,)]
+
+    def test_advance_symmetry(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        state = rs.bit_generator.state
+        step = -0x9e3779b97f4a7c150000000000000000
+        rs.bit_generator.advance(step)
+        val_neg = rs.integers(10)
+        rs.bit_generator.state = state
+        rs.bit_generator.advance(2**128 + step)
+        val_pos = rs.integers(10)
+        rs.bit_generator.state = state
+        rs.bit_generator.advance(10 * 2**128 + step)
+        val_big = rs.integers(10)
+        assert val_neg == val_pos
+        assert val_big == val_pos
+
+
+class TestMT19937(Base):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = MT19937
+        cls.bits = 32
+        cls.dtype = np.uint32
+        cls.data1 = cls._read_csv(join(pwd, './data/mt19937-testset-1.csv'))
+        cls.data2 = cls._read_csv(join(pwd, './data/mt19937-testset-2.csv'))
+        cls.seed_error_type = ValueError
+        cls.invalid_init_types = []
+        cls.invalid_init_values = [(-1,)]
+
+    def test_seed_float_array(self):
+        assert_raises(TypeError, self.bit_generator, np.array([np.pi]))
+        assert_raises(TypeError, self.bit_generator, np.array([-np.pi]))
+        assert_raises(TypeError, self.bit_generator, np.array([np.pi, -np.pi]))
+        assert_raises(TypeError, self.bit_generator, np.array([0, np.pi]))
+        assert_raises(TypeError, self.bit_generator, [np.pi])
+        assert_raises(TypeError, self.bit_generator, [0, np.pi])
+
+    def test_state_tuple(self):
+        rs = Generator(self.bit_generator(*self.data1['seed']))
+        bit_generator = rs.bit_generator
+        state = bit_generator.state
+        desired = rs.integers(2 ** 16)
+        tup = (state['bit_generator'], state['state']['key'],
+               state['state']['pos'])
+        bit_generator.state = tup
+        actual = rs.integers(2 ** 16)
+        assert_equal(actual, desired)
+        tup = tup + (0, 0.0)
+        bit_generator.state = tup
+        actual = rs.integers(2 ** 16)
+        assert_equal(actual, desired)
+
+
+class TestSFC64(Base):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = SFC64
+        cls.bits = 64
+        cls.dtype = np.uint64
+        cls.data1 = cls._read_csv(
+            join(pwd, './data/sfc64-testset-1.csv'))
+        cls.data2 = cls._read_csv(
+            join(pwd, './data/sfc64-testset-2.csv'))
+        cls.seed_error_type = (ValueError, TypeError)
+        cls.invalid_init_types = [(3.2,), ([None],), (1, None)]
+        cls.invalid_init_values = [(-1,)]
+
+
+class TestDefaultRNG:
+    def test_seed(self):
+        for args in [(), (None,), (1234,), ([1234, 5678],)]:
+            rg = default_rng(*args)
+            assert isinstance(rg.bit_generator, PCG64)
+
+    def test_passthrough(self):
+        bg = Philox()
+        rg = default_rng(bg)
+        assert rg.bit_generator is bg
+        rg2 = default_rng(rg)
+        assert rg2 is rg
+        assert rg2.bit_generator is bg
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_extending.py b/venv/Lib/site-packages/numpy/random/tests/test_extending.py
new file mode 100644
index 000000000..99a819efb
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_extending.py
@@ -0,0 +1,95 @@
+import os
+import pytest
+import shutil
+import subprocess
+import sys
+import warnings
+import numpy as np
+
+try:
+    import cffi
+except ImportError:
+    cffi = None
+
+if sys.flags.optimize > 1:
+    # no docstrings present to inspect when PYTHONOPTIMIZE/Py_OptimizeFlag > 1
+    # cffi cannot succeed
+    cffi = None
+
+try:
+    with warnings.catch_warnings(record=True) as w:
+        # numba issue gh-4733
+        warnings.filterwarnings('always', '', DeprecationWarning)
+        import numba
+except ImportError:
+    numba = None
+
+try:
+    import cython
+    from Cython.Compiler.Version import version as cython_version
+except ImportError:
+    cython = None
+else:
+    from distutils.version import LooseVersion
+    # Cython 0.29.21 is required for Python 3.9 and there are
+    # other fixes in the 0.29 series that are needed even for earlier
+    # Python versions.
+    # Note: keep in sync with the one in pyproject.toml
+    required_version = LooseVersion('0.29.21')
+    if LooseVersion(cython_version) < required_version:
+        # too old or wrong cython, skip the test
+        cython = None
+
+@pytest.mark.skipif(cython is None, reason="requires cython")
+@pytest.mark.slow
+def test_cython(tmp_path):
+    srcdir = os.path.join(os.path.dirname(__file__), '..')
+    shutil.copytree(srcdir, tmp_path / 'random')
+    # build the examples and "install" them into a temporary directory
+    build_dir = tmp_path / 'random' / '_examples' / 'cython'
+    subprocess.check_call([sys.executable, 'setup.py', 'build', 'install',
+                           '--prefix', str(tmp_path / 'installdir'),
+                           '--single-version-externally-managed',
+                           '--record', str(tmp_path/ 'tmp_install_log.txt'),
+                          ],
+                          cwd=str(build_dir),
+                      )
+    # gh-16162: make sure numpy's __init__.pxd was used for cython
+    # not really part of this test, but it is a convenient place to check
+    with open(build_dir / 'extending.c') as fid:
+        txt_to_find = 'NumPy API declarations from "numpy/__init__.pxd"'
+        for i, line in enumerate(fid):
+            if txt_to_find in line:
+                break
+        else:
+            assert False, ("Could not find '{}' in C file, "
+                           "wrong pxd used".format(txt_to_find))
+    # get the path to the so's
+    so1 = so2 = None
+    with open(tmp_path /'tmp_install_log.txt') as fid:
+        for line in fid:
+            if 'extending.' in line:
+                so1 = line.strip()
+            if 'extending_distributions' in line:
+                so2 = line.strip()
+    assert so1 is not None
+    assert so2 is not None
+    # import the so's without adding the directory to sys.path
+    from importlib.machinery import ExtensionFileLoader 
+    extending = ExtensionFileLoader('extending', so1).load_module()
+    extending_distributions = ExtensionFileLoader('extending_distributions', so2).load_module()
+
+    # actually test the cython c-extension
+    from numpy.random import PCG64
+    values = extending_distributions.uniforms_ex(PCG64(0), 10, 'd')
+    assert values.shape == (10,)
+    assert values.dtype == np.float64
+
+@pytest.mark.skipif(numba is None or cffi is None,
+                    reason="requires numba and cffi")
+def test_numba():
+    from numpy.random._examples.numba import extending  # noqa: F401
+
+@pytest.mark.skipif(cffi is None, reason="requires cffi")
+def test_cffi():
+    from numpy.random._examples.cffi import extending  # noqa: F401
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937.py b/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937.py
new file mode 100644
index 000000000..bb6d25ef1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937.py
@@ -0,0 +1,2450 @@
+import sys
+import hashlib
+
+import pytest
+
+import numpy as np
+from numpy.linalg import LinAlgError
+from numpy.testing import (
+    assert_, assert_raises, assert_equal, assert_allclose,
+    assert_warns, assert_no_warnings, assert_array_equal,
+    assert_array_almost_equal, suppress_warnings)
+
+from numpy.random import Generator, MT19937, SeedSequence
+
+random = Generator(MT19937())
+
+JUMP_TEST_DATA = [
+    {
+        "seed": 0,
+        "steps": 10,
+        "initial": {"key_md5": "64eaf265d2203179fb5ffb73380cd589", "pos": 9},
+        "jumped": {"key_md5": "8cb7b061136efceef5217a9ce2cc9a5a", "pos": 598},
+    },
+    {
+        "seed":384908324,
+        "steps":312,
+        "initial": {"key_md5": "e99708a47b82ff51a2c7b0625b81afb5", "pos": 311},
+        "jumped": {"key_md5": "2ecdbfc47a895b253e6e19ccb2e74b90", "pos": 276},
+    },
+    {
+        "seed": [839438204, 980239840, 859048019, 821],
+        "steps": 511,
+        "initial": {"key_md5": "9fcd6280df9199785e17e93162ce283c", "pos": 510},
+        "jumped": {"key_md5": "433b85229f2ed853cde06cd872818305", "pos": 475},
+    },
+]
+
+@pytest.fixture(scope='module', params=[True, False])
+def endpoint(request):
+    return request.param
+
+
+class TestSeed:
+    def test_scalar(self):
+        s = Generator(MT19937(0))
+        assert_equal(s.integers(1000), 479)
+        s = Generator(MT19937(4294967295))
+        assert_equal(s.integers(1000), 324)
+
+    def test_array(self):
+        s = Generator(MT19937(range(10)))
+        assert_equal(s.integers(1000), 465)
+        s = Generator(MT19937(np.arange(10)))
+        assert_equal(s.integers(1000), 465)
+        s = Generator(MT19937([0]))
+        assert_equal(s.integers(1000), 479)
+        s = Generator(MT19937([4294967295]))
+        assert_equal(s.integers(1000), 324)
+
+    def test_seedsequence(self):
+        s = MT19937(SeedSequence(0))
+        assert_equal(s.random_raw(1), 2058676884)
+
+    def test_invalid_scalar(self):
+        # seed must be an unsigned 32 bit integer
+        assert_raises(TypeError, MT19937, -0.5)
+        assert_raises(ValueError, MT19937, -1)
+
+    def test_invalid_array(self):
+        # seed must be an unsigned integer
+        assert_raises(TypeError, MT19937, [-0.5])
+        assert_raises(ValueError, MT19937, [-1])
+        assert_raises(ValueError, MT19937, [1, -2, 4294967296])
+
+    def test_noninstantized_bitgen(self):
+        assert_raises(ValueError, Generator, MT19937)
+
+
+class TestBinomial:
+    def test_n_zero(self):
+        # Tests the corner case of n == 0 for the binomial distribution.
+        # binomial(0, p) should be zero for any p in [0, 1].
+        # This test addresses issue #3480.
+        zeros = np.zeros(2, dtype='int')
+        for p in [0, .5, 1]:
+            assert_(random.binomial(0, p) == 0)
+            assert_array_equal(random.binomial(zeros, p), zeros)
+
+    def test_p_is_nan(self):
+        # Issue #4571.
+        assert_raises(ValueError, random.binomial, 1, np.nan)
+
+
+class TestMultinomial:
+    def test_basic(self):
+        random.multinomial(100, [0.2, 0.8])
+
+    def test_zero_probability(self):
+        random.multinomial(100, [0.2, 0.8, 0.0, 0.0, 0.0])
+
+    def test_int_negative_interval(self):
+        assert_(-5 <= random.integers(-5, -1) < -1)
+        x = random.integers(-5, -1, 5)
+        assert_(np.all(-5 <= x))
+        assert_(np.all(x < -1))
+
+    def test_size(self):
+        # gh-3173
+        p = [0.5, 0.5]
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(random.multinomial(1, p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(random.multinomial(1, p, np.array((2, 2))).shape,
+                     (2, 2, 2))
+
+        assert_raises(TypeError, random.multinomial, 1, p,
+                      float(1))
+
+    def test_invalid_prob(self):
+        assert_raises(ValueError, random.multinomial, 100, [1.1, 0.2])
+        assert_raises(ValueError, random.multinomial, 100, [-.1, 0.9])
+
+    def test_invalid_n(self):
+        assert_raises(ValueError, random.multinomial, -1, [0.8, 0.2])
+        assert_raises(ValueError, random.multinomial, [-1] * 10, [0.8, 0.2])
+
+    def test_p_non_contiguous(self):
+        p = np.arange(15.)
+        p /= np.sum(p[1::3])
+        pvals = p[1::3]
+        random = Generator(MT19937(1432985819))
+        non_contig = random.multinomial(100, pvals=pvals)
+        random = Generator(MT19937(1432985819))
+        contig = random.multinomial(100, pvals=np.ascontiguousarray(pvals))
+        assert_array_equal(non_contig, contig)
+
+    def test_multidimensional_pvals(self):
+        assert_raises(ValueError, random.multinomial, 10, [[0, 1]])
+        assert_raises(ValueError, random.multinomial, 10, [[0], [1]])
+        assert_raises(ValueError, random.multinomial, 10, [[[0], [1]], [[1], [0]]])
+        assert_raises(ValueError, random.multinomial, 10, np.array([[0, 1], [1, 0]]))
+
+
+class TestMultivariateHypergeometric:
+
+    def setup(self):
+        self.seed = 8675309
+
+    def test_argument_validation(self):
+        # Error cases...
+
+        # `colors` must be a 1-d sequence
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      10, 4)
+
+        # Negative nsample
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [2, 3, 4], -1)
+
+        # Negative color
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [-1, 2, 3], 2)
+
+        # nsample exceeds sum(colors)
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [2, 3, 4], 10)
+
+        # nsample exceeds sum(colors) (edge case of empty colors)
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [], 1)
+
+        # Validation errors associated with very large values in colors.
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [999999999, 101], 5, 1, 'marginals')
+
+        int64_info = np.iinfo(np.int64)
+        max_int64 = int64_info.max
+        max_int64_index = max_int64 // int64_info.dtype.itemsize
+        assert_raises(ValueError, random.multivariate_hypergeometric,
+                      [max_int64_index - 100, 101], 5, 1, 'count')
+
+    @pytest.mark.parametrize('method', ['count', 'marginals'])
+    def test_edge_cases(self, method):
+        # Set the seed, but in fact, all the results in this test are
+        # deterministic, so we don't really need this.
+        random = Generator(MT19937(self.seed))
+
+        x = random.multivariate_hypergeometric([0, 0, 0], 0, method=method)
+        assert_array_equal(x, [0, 0, 0])
+
+        x = random.multivariate_hypergeometric([], 0, method=method)
+        assert_array_equal(x, [])
+
+        x = random.multivariate_hypergeometric([], 0, size=1, method=method)
+        assert_array_equal(x, np.empty((1, 0), dtype=np.int64))
+
+        x = random.multivariate_hypergeometric([1, 2, 3], 0, method=method)
+        assert_array_equal(x, [0, 0, 0])
+
+        x = random.multivariate_hypergeometric([9, 0, 0], 3, method=method)
+        assert_array_equal(x, [3, 0, 0])
+
+        colors = [1, 1, 0, 1, 1]
+        x = random.multivariate_hypergeometric(colors, sum(colors),
+                                               method=method)
+        assert_array_equal(x, colors)
+
+        x = random.multivariate_hypergeometric([3, 4, 5], 12, size=3,
+                                               method=method)
+        assert_array_equal(x, [[3, 4, 5]]*3)
+
+    # Cases for nsample:
+    #     nsample < 10
+    #     10 <= nsample < colors.sum()/2
+    #     colors.sum()/2 < nsample < colors.sum() - 10
+    #     colors.sum() - 10 < nsample < colors.sum()
+    @pytest.mark.parametrize('nsample', [8, 25, 45, 55])
+    @pytest.mark.parametrize('method', ['count', 'marginals'])
+    @pytest.mark.parametrize('size', [5, (2, 3), 150000])
+    def test_typical_cases(self, nsample, method, size):
+        random = Generator(MT19937(self.seed))
+
+        colors = np.array([10, 5, 20, 25])
+        sample = random.multivariate_hypergeometric(colors, nsample, size,
+                                                    method=method)
+        if isinstance(size, int):
+            expected_shape = (size,) + colors.shape
+        else:
+            expected_shape = size + colors.shape
+        assert_equal(sample.shape, expected_shape)
+        assert_((sample >= 0).all())
+        assert_((sample <= colors).all())
+        assert_array_equal(sample.sum(axis=-1),
+                           np.full(size, fill_value=nsample, dtype=int))
+        if isinstance(size, int) and size >= 100000:
+            # This sample is large enough to compare its mean to
+            # the expected values.
+            assert_allclose(sample.mean(axis=0),
+                            nsample * colors / colors.sum(),
+                            rtol=1e-3, atol=0.005)
+
+    def test_repeatability1(self):
+        random = Generator(MT19937(self.seed))
+        sample = random.multivariate_hypergeometric([3, 4, 5], 5, size=5,
+                                                    method='count')
+        expected = np.array([[2, 1, 2],
+                             [2, 1, 2],
+                             [1, 1, 3],
+                             [2, 0, 3],
+                             [2, 1, 2]])
+        assert_array_equal(sample, expected)
+
+    def test_repeatability2(self):
+        random = Generator(MT19937(self.seed))
+        sample = random.multivariate_hypergeometric([20, 30, 50], 50,
+                                                    size=5,
+                                                    method='marginals')
+        expected = np.array([[ 9, 17, 24],
+                             [ 7, 13, 30],
+                             [ 9, 15, 26],
+                             [ 9, 17, 24],
+                             [12, 14, 24]])
+        assert_array_equal(sample, expected)
+
+    def test_repeatability3(self):
+        random = Generator(MT19937(self.seed))
+        sample = random.multivariate_hypergeometric([20, 30, 50], 12,
+                                                    size=5,
+                                                    method='marginals')
+        expected = np.array([[2, 3, 7],
+                             [5, 3, 4],
+                             [2, 5, 5],
+                             [5, 3, 4],
+                             [1, 5, 6]])
+        assert_array_equal(sample, expected)
+
+
+class TestSetState:
+    def setup(self):
+        self.seed = 1234567890
+        self.rg = Generator(MT19937(self.seed))
+        self.bit_generator = self.rg.bit_generator
+        self.state = self.bit_generator.state
+        self.legacy_state = (self.state['bit_generator'],
+                             self.state['state']['key'],
+                             self.state['state']['pos'])
+
+    def test_gaussian_reset(self):
+        # Make sure the cached every-other-Gaussian is reset.
+        old = self.rg.standard_normal(size=3)
+        self.bit_generator.state = self.state
+        new = self.rg.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_gaussian_reset_in_media_res(self):
+        # When the state is saved with a cached Gaussian, make sure the
+        # cached Gaussian is restored.
+
+        self.rg.standard_normal()
+        state = self.bit_generator.state
+        old = self.rg.standard_normal(size=3)
+        self.bit_generator.state = state
+        new = self.rg.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_negative_binomial(self):
+        # Ensure that the negative binomial results take floating point
+        # arguments without truncation.
+        self.rg.negative_binomial(0.5, 0.5)
+
+
+class TestIntegers:
+    rfunc = random.integers
+
+    # valid integer/boolean types
+    itype = [bool, np.int8, np.uint8, np.int16, np.uint16,
+             np.int32, np.uint32, np.int64, np.uint64]
+
+    def test_unsupported_type(self, endpoint):
+        assert_raises(TypeError, self.rfunc, 1, endpoint=endpoint, dtype=float)
+
+    def test_bounds_checking(self, endpoint):
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+            assert_raises(ValueError, self.rfunc, lbnd - 1, ubnd,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, lbnd, ubnd + 1,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, ubnd, lbnd,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, 1, 0, endpoint=endpoint,
+                          dtype=dt)
+
+            assert_raises(ValueError, self.rfunc, [lbnd - 1], ubnd,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, [lbnd], [ubnd + 1],
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, [ubnd], [lbnd],
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, 1, [0],
+                          endpoint=endpoint, dtype=dt)
+
+    def test_bounds_checking_array(self, endpoint):
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + (not endpoint)
+
+            assert_raises(ValueError, self.rfunc, [lbnd - 1] * 2, [ubnd] * 2,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, [lbnd] * 2,
+                          [ubnd + 1] * 2, endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, ubnd, [lbnd] * 2,
+                          endpoint=endpoint, dtype=dt)
+            assert_raises(ValueError, self.rfunc, [1] * 2, 0,
+                          endpoint=endpoint, dtype=dt)
+
+    def test_rng_zero_and_extremes(self, endpoint):
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+            is_open = not endpoint
+
+            tgt = ubnd - 1
+            assert_equal(self.rfunc(tgt, tgt + is_open, size=1000,
+                                    endpoint=endpoint, dtype=dt), tgt)
+            assert_equal(self.rfunc([tgt], tgt + is_open, size=1000,
+                                    endpoint=endpoint, dtype=dt), tgt)
+
+            tgt = lbnd
+            assert_equal(self.rfunc(tgt, tgt + is_open, size=1000,
+                                    endpoint=endpoint, dtype=dt), tgt)
+            assert_equal(self.rfunc(tgt, [tgt + is_open], size=1000,
+                                    endpoint=endpoint, dtype=dt), tgt)
+
+            tgt = (lbnd + ubnd) // 2
+            assert_equal(self.rfunc(tgt, tgt + is_open, size=1000,
+                                    endpoint=endpoint, dtype=dt), tgt)
+            assert_equal(self.rfunc([tgt], [tgt + is_open],
+                                    size=1000, endpoint=endpoint, dtype=dt),
+                         tgt)
+
+    def test_rng_zero_and_extremes_array(self, endpoint):
+        size = 1000
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            tgt = ubnd - 1
+            assert_equal(self.rfunc([tgt], [tgt + 1],
+                                    size=size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, size=size, dtype=dt), tgt)
+
+            tgt = lbnd
+            assert_equal(self.rfunc([tgt], [tgt + 1],
+                                    size=size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, size=size, dtype=dt), tgt)
+
+            tgt = (lbnd + ubnd) // 2
+            assert_equal(self.rfunc([tgt], [tgt + 1],
+                                    size=size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, dtype=dt), tgt)
+            assert_equal(self.rfunc(
+                [tgt] * size, [tgt + 1] * size, size=size, dtype=dt), tgt)
+
+    def test_full_range(self, endpoint):
+        # Test for ticket #1690
+
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            try:
+                self.rfunc(lbnd, ubnd, endpoint=endpoint, dtype=dt)
+            except Exception as e:
+                raise AssertionError("No error should have been raised, "
+                                     "but one was with the following "
+                                     "message:\n\n%s" % str(e))
+
+    def test_full_range_array(self, endpoint):
+        # Test for ticket #1690
+
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            try:
+                self.rfunc([lbnd] * 2, [ubnd], endpoint=endpoint, dtype=dt)
+            except Exception as e:
+                raise AssertionError("No error should have been raised, "
+                                     "but one was with the following "
+                                     "message:\n\n%s" % str(e))
+
+    def test_in_bounds_fuzz(self, endpoint):
+        # Don't use fixed seed
+        random = Generator(MT19937())
+
+        for dt in self.itype[1:]:
+            for ubnd in [4, 8, 16]:
+                vals = self.rfunc(2, ubnd - endpoint, size=2 ** 16,
+                                  endpoint=endpoint, dtype=dt)
+                assert_(vals.max() < ubnd)
+                assert_(vals.min() >= 2)
+
+        vals = self.rfunc(0, 2 - endpoint, size=2 ** 16, endpoint=endpoint,
+                          dtype=bool)
+        assert_(vals.max() < 2)
+        assert_(vals.min() >= 0)
+
+    def test_scalar_array_equiv(self, endpoint):
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            size = 1000
+            random = Generator(MT19937(1234))
+            scalar = random.integers(lbnd, ubnd, size=size, endpoint=endpoint,
+                                dtype=dt)
+
+            random = Generator(MT19937(1234))
+            scalar_array = random.integers([lbnd], [ubnd], size=size,
+                                      endpoint=endpoint, dtype=dt)
+
+            random = Generator(MT19937(1234))
+            array = random.integers([lbnd] * size, [ubnd] *
+                               size, size=size, endpoint=endpoint, dtype=dt)
+            assert_array_equal(scalar, scalar_array)
+            assert_array_equal(scalar, array)
+
+    def test_repeatability(self, endpoint):
+        # We use a md5 hash of generated sequences of 1000 samples
+        # in the range [0, 6) for all but bool, where the range
+        # is [0, 2). Hashes are for little endian numbers.
+        tgt = {'bool':   'b3300e66d2bb59e493d255d47c3a6cbe',
+               'int16':  '39624ead49ad67e37545744024d2648b',
+               'int32':  '5c4810373f979336c6c0c999996e47a1',
+               'int64':  'ab126c15edff26f55c50d2b7e37391ac',
+               'int8':   'ba71ccaffeeeb9eeb1860f8075020b9c',
+               'uint16': '39624ead49ad67e37545744024d2648b',
+               'uint32': '5c4810373f979336c6c0c999996e47a1',
+               'uint64': 'ab126c15edff26f55c50d2b7e37391ac',
+               'uint8':  'ba71ccaffeeeb9eeb1860f8075020b9c'}
+
+        for dt in self.itype[1:]:
+            random = Generator(MT19937(1234))
+
+            # view as little endian for hash
+            if sys.byteorder == 'little':
+                val = random.integers(0, 6 - endpoint, size=1000, endpoint=endpoint,
+                                 dtype=dt)
+            else:
+                val = random.integers(0, 6 - endpoint, size=1000, endpoint=endpoint,
+                                 dtype=dt).byteswap()
+
+            res = hashlib.md5(val).hexdigest()
+            assert_(tgt[np.dtype(dt).name] == res)
+
+        # bools do not depend on endianness
+        random = Generator(MT19937(1234))
+        val = random.integers(0, 2 - endpoint, size=1000, endpoint=endpoint,
+                         dtype=bool).view(np.int8)
+        res = hashlib.md5(val).hexdigest()
+        assert_(tgt[np.dtype(bool).name] == res)
+
+    def test_repeatability_broadcasting(self, endpoint):
+        for dt in self.itype:
+            lbnd = 0 if dt in (bool, np.bool_) else np.iinfo(dt).min
+            ubnd = 2 if dt in (bool, np.bool_) else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            # view as little endian for hash
+            random = Generator(MT19937(1234))
+            val = random.integers(lbnd, ubnd, size=1000, endpoint=endpoint,
+                             dtype=dt)
+
+            random = Generator(MT19937(1234))
+            val_bc = random.integers([lbnd] * 1000, ubnd, endpoint=endpoint,
+                                dtype=dt)
+
+            assert_array_equal(val, val_bc)
+
+            random = Generator(MT19937(1234))
+            val_bc = random.integers([lbnd] * 1000, [ubnd] * 1000,
+                                endpoint=endpoint, dtype=dt)
+
+            assert_array_equal(val, val_bc)
+
+    @pytest.mark.parametrize(
+        'bound, expected',
+        [(2**32 - 1, np.array([517043486, 1364798665, 1733884389, 1353720612,
+                               3769704066, 1170797179, 4108474671])),
+         (2**32, np.array([517043487, 1364798666, 1733884390, 1353720613,
+                           3769704067, 1170797180, 4108474672])),
+         (2**32 + 1, np.array([517043487, 1733884390, 3769704068, 4108474673,
+                               1831631863, 1215661561, 3869512430]))]
+    )
+    def test_repeatability_32bit_boundary(self, bound, expected):
+        for size in [None, len(expected)]:
+            random = Generator(MT19937(1234))
+            x = random.integers(bound, size=size)
+            assert_equal(x, expected if size is not None else expected[0])
+
+    def test_repeatability_32bit_boundary_broadcasting(self):
+        desired = np.array([[[1622936284, 3620788691, 1659384060],
+                             [1417365545,  760222891, 1909653332],
+                             [3788118662,  660249498, 4092002593]],
+                            [[3625610153, 2979601262, 3844162757],
+                             [ 685800658,  120261497, 2694012896],
+                             [1207779440, 1586594375, 3854335050]],
+                            [[3004074748, 2310761796, 3012642217],
+                             [2067714190, 2786677879, 1363865881],
+                             [ 791663441, 1867303284, 2169727960]],
+                            [[1939603804, 1250951100,  298950036],
+                             [1040128489, 3791912209, 3317053765],
+                             [3155528714,   61360675, 2305155588]],
+                            [[ 817688762, 1335621943, 3288952434],
+                             [1770890872, 1102951817, 1957607470],
+                             [3099996017,  798043451,   48334215]]])
+        for size in [None, (5, 3, 3)]:
+            random = Generator(MT19937(12345))
+            x = random.integers([[-1], [0], [1]],
+                                [2**32 - 1, 2**32, 2**32 + 1],
+                                size=size)
+            assert_array_equal(x, desired if size is not None else desired[0])
+
+    def test_int64_uint64_broadcast_exceptions(self, endpoint):
+        configs = {np.uint64: ((0, 2**65), (-1, 2**62), (10, 9), (0, 0)),
+                   np.int64: ((0, 2**64), (-(2**64), 2**62), (10, 9), (0, 0),
+                              (-2**63-1, -2**63-1))}
+        for dtype in configs:
+            for config in configs[dtype]:
+                low, high = config
+                high = high - endpoint
+                low_a = np.array([[low]*10])
+                high_a = np.array([high] * 10)
+                assert_raises(ValueError, random.integers, low, high,
+                              endpoint=endpoint, dtype=dtype)
+                assert_raises(ValueError, random.integers, low_a, high,
+                              endpoint=endpoint, dtype=dtype)
+                assert_raises(ValueError, random.integers, low, high_a,
+                              endpoint=endpoint, dtype=dtype)
+                assert_raises(ValueError, random.integers, low_a, high_a,
+                              endpoint=endpoint, dtype=dtype)
+
+                low_o = np.array([[low]*10], dtype=object)
+                high_o = np.array([high] * 10, dtype=object)
+                assert_raises(ValueError, random.integers, low_o, high,
+                              endpoint=endpoint, dtype=dtype)
+                assert_raises(ValueError, random.integers, low, high_o,
+                              endpoint=endpoint, dtype=dtype)
+                assert_raises(ValueError, random.integers, low_o, high_o,
+                              endpoint=endpoint, dtype=dtype)
+
+    def test_int64_uint64_corner_case(self, endpoint):
+        # When stored in Numpy arrays, `lbnd` is casted
+        # as np.int64, and `ubnd` is casted as np.uint64.
+        # Checking whether `lbnd` >= `ubnd` used to be
+        # done solely via direct comparison, which is incorrect
+        # because when Numpy tries to compare both numbers,
+        # it casts both to np.float64 because there is
+        # no integer superset of np.int64 and np.uint64. However,
+        # `ubnd` is too large to be represented in np.float64,
+        # causing it be round down to np.iinfo(np.int64).max,
+        # leading to a ValueError because `lbnd` now equals
+        # the new `ubnd`.
+
+        dt = np.int64
+        tgt = np.iinfo(np.int64).max
+        lbnd = np.int64(np.iinfo(np.int64).max)
+        ubnd = np.uint64(np.iinfo(np.int64).max + 1 - endpoint)
+
+        # None of these function calls should
+        # generate a ValueError now.
+        actual = random.integers(lbnd, ubnd, endpoint=endpoint, dtype=dt)
+        assert_equal(actual, tgt)
+
+    def test_respect_dtype_singleton(self, endpoint):
+        # See gh-7203
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+            dt = np.bool_ if dt is bool else dt
+
+            sample = self.rfunc(lbnd, ubnd, endpoint=endpoint, dtype=dt)
+            assert_equal(sample.dtype, dt)
+
+        for dt in (bool, int, np.compat.long):
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+
+            # gh-7284: Ensure that we get Python data types
+            sample = self.rfunc(lbnd, ubnd, endpoint=endpoint, dtype=dt)
+            assert not hasattr(sample, 'dtype')
+            assert_equal(type(sample), dt)
+
+    def test_respect_dtype_array(self, endpoint):
+        # See gh-7203
+        for dt in self.itype:
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+            ubnd = ubnd - 1 if endpoint else ubnd
+            dt = np.bool_ if dt is bool else dt
+
+            sample = self.rfunc([lbnd], [ubnd], endpoint=endpoint, dtype=dt)
+            assert_equal(sample.dtype, dt)
+            sample = self.rfunc([lbnd] * 2, [ubnd] * 2, endpoint=endpoint,
+                                dtype=dt)
+            assert_equal(sample.dtype, dt)
+
+    def test_zero_size(self, endpoint):
+        # See gh-7203
+        for dt in self.itype:
+            sample = self.rfunc(0, 0, (3, 0, 4), endpoint=endpoint, dtype=dt)
+            assert sample.shape == (3, 0, 4)
+            assert sample.dtype == dt
+            assert self.rfunc(0, -10, 0, endpoint=endpoint,
+                              dtype=dt).shape == (0,)
+            assert_equal(random.integers(0, 0, size=(3, 0, 4)).shape,
+                         (3, 0, 4))
+            assert_equal(random.integers(0, -10, size=0).shape, (0,))
+            assert_equal(random.integers(10, 10, size=0).shape, (0,))
+
+    def test_error_byteorder(self):
+        other_byteord_dt = '<i4' if sys.byteorder == 'big' else '>i4'
+        with pytest.raises(ValueError):
+            random.integers(0, 200, size=10, dtype=other_byteord_dt)
+
+    # chi2max is the maximum acceptable chi-squared value.
+    @pytest.mark.slow
+    @pytest.mark.parametrize('sample_size,high,dtype,chi2max',
+        [(5000000, 5, np.int8, 125.0),          # p-value ~4.6e-25
+         (5000000, 7, np.uint8, 150.0),         # p-value ~7.7e-30
+         (10000000, 2500, np.int16, 3300.0),    # p-value ~3.0e-25
+         (50000000, 5000, np.uint16, 6500.0),   # p-value ~3.5e-25
+        ])
+    def test_integers_small_dtype_chisquared(self, sample_size, high,
+                                             dtype, chi2max):
+        # Regression test for gh-14774.
+        samples = random.integers(high, size=sample_size, dtype=dtype)
+
+        values, counts = np.unique(samples, return_counts=True)
+        expected = sample_size / high
+        chi2 = ((counts - expected)**2 / expected).sum()
+        assert chi2 < chi2max
+
+
+class TestRandomDist:
+    # Make sure the random distribution returns the correct value for a
+    # given seed
+
+    def setup(self):
+        self.seed = 1234567890
+
+    def test_integers(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.integers(-99, 99, size=(3, 2))
+        desired = np.array([[-80, -56], [41, 37], [-83, -16]])
+        assert_array_equal(actual, desired)
+
+    def test_integers_masked(self):
+        # Test masked rejection sampling algorithm to generate array of
+        # uint32 in an interval.
+        random = Generator(MT19937(self.seed))
+        actual = random.integers(0, 99, size=(3, 2), dtype=np.uint32)
+        desired = np.array([[9, 21], [70, 68], [8, 41]], dtype=np.uint32)
+        assert_array_equal(actual, desired)
+
+    def test_integers_closed(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.integers(-99, 99, size=(3, 2), endpoint=True)
+        desired = np.array([[-80, -56], [ 41, 38], [-83, -15]])
+        assert_array_equal(actual, desired)
+
+    def test_integers_max_int(self):
+        # Tests whether integers with closed=True can generate the
+        # maximum allowed Python int that can be converted
+        # into a C long. Previous implementations of this
+        # method have thrown an OverflowError when attempting
+        # to generate this integer.
+        actual = random.integers(np.iinfo('l').max, np.iinfo('l').max,
+                                 endpoint=True)
+
+        desired = np.iinfo('l').max
+        assert_equal(actual, desired)
+
+    def test_random(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.random((3, 2))
+        desired = np.array([[0.096999199829214, 0.707517457682192],
+                            [0.084364834598269, 0.767731206553125],
+                            [0.665069021359413, 0.715487190596693]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.random()
+        assert_array_almost_equal(actual, desired[0, 0], decimal=15)
+
+    def test_random_float(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.random((3, 2))
+        desired = np.array([[0.0969992 , 0.70751746],
+                            [0.08436483, 0.76773121],
+                            [0.66506902, 0.71548719]])
+        assert_array_almost_equal(actual, desired, decimal=7)
+
+    def test_random_float_scalar(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.random(dtype=np.float32)
+        desired = 0.0969992
+        assert_array_almost_equal(actual, desired, decimal=7)
+
+    def test_random_unsupported_type(self):
+        assert_raises(TypeError, random.random, dtype='int32')
+
+    def test_choice_uniform_replace(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(4, 4)
+        desired = np.array([0, 0, 2, 2], dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_replace(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(4, 4, p=[0.4, 0.4, 0.1, 0.1])
+        desired = np.array([0, 1, 0, 1], dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+    def test_choice_uniform_noreplace(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(4, 3, replace=False)
+        desired = np.array([2, 0, 3], dtype=np.int64)
+        assert_array_equal(actual, desired)
+        actual = random.choice(4, 4, replace=False, shuffle=False)
+        desired = np.arange(4, dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_noreplace(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(4, 3, replace=False, p=[0.1, 0.3, 0.5, 0.1])
+        desired = np.array([0, 2, 3], dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+    def test_choice_noninteger(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(['a', 'b', 'c', 'd'], 4)
+        desired = np.array(['a', 'a', 'c', 'c'])
+        assert_array_equal(actual, desired)
+
+    def test_choice_multidimensional_default_axis(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice([[0, 1], [2, 3], [4, 5], [6, 7]], 3)
+        desired = np.array([[0, 1], [0, 1], [4, 5]])
+        assert_array_equal(actual, desired)
+
+    def test_choice_multidimensional_custom_axis(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.choice([[0, 1], [2, 3], [4, 5], [6, 7]], 1, axis=1)
+        desired = np.array([[0], [2], [4], [6]])
+        assert_array_equal(actual, desired)
+
+    def test_choice_exceptions(self):
+        sample = random.choice
+        assert_raises(ValueError, sample, -1, 3)
+        assert_raises(ValueError, sample, 3., 3)
+        assert_raises(ValueError, sample, [], 3)
+        assert_raises(ValueError, sample, [1, 2, 3, 4], 3,
+                      p=[[0.25, 0.25], [0.25, 0.25]])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4, 0.2])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[1.1, -0.1])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4])
+        assert_raises(ValueError, sample, [1, 2, 3], 4, replace=False)
+        # gh-13087
+        assert_raises(ValueError, sample, [1, 2, 3], -2, replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1,), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1, 1), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], 2,
+                      replace=False, p=[1, 0, 0])
+
+    def test_choice_return_shape(self):
+        p = [0.1, 0.9]
+        # Check scalar
+        assert_(np.isscalar(random.choice(2, replace=True)))
+        assert_(np.isscalar(random.choice(2, replace=False)))
+        assert_(np.isscalar(random.choice(2, replace=True, p=p)))
+        assert_(np.isscalar(random.choice(2, replace=False, p=p)))
+        assert_(np.isscalar(random.choice([1, 2], replace=True)))
+        assert_(random.choice([None], replace=True) is None)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(random.choice(arr, replace=True) is a)
+
+        # Check 0-d array
+        s = tuple()
+        assert_(not np.isscalar(random.choice(2, s, replace=True)))
+        assert_(not np.isscalar(random.choice(2, s, replace=False)))
+        assert_(not np.isscalar(random.choice(2, s, replace=True, p=p)))
+        assert_(not np.isscalar(random.choice(2, s, replace=False, p=p)))
+        assert_(not np.isscalar(random.choice([1, 2], s, replace=True)))
+        assert_(random.choice([None], s, replace=True).ndim == 0)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(random.choice(arr, s, replace=True).item() is a)
+
+        # Check multi dimensional array
+        s = (2, 3)
+        p = [0.1, 0.1, 0.1, 0.1, 0.4, 0.2]
+        assert_equal(random.choice(6, s, replace=True).shape, s)
+        assert_equal(random.choice(6, s, replace=False).shape, s)
+        assert_equal(random.choice(6, s, replace=True, p=p).shape, s)
+        assert_equal(random.choice(6, s, replace=False, p=p).shape, s)
+        assert_equal(random.choice(np.arange(6), s, replace=True).shape, s)
+
+        # Check zero-size
+        assert_equal(random.integers(0, 0, size=(3, 0, 4)).shape, (3, 0, 4))
+        assert_equal(random.integers(0, -10, size=0).shape, (0,))
+        assert_equal(random.integers(10, 10, size=0).shape, (0,))
+        assert_equal(random.choice(0, size=0).shape, (0,))
+        assert_equal(random.choice([], size=(0,)).shape, (0,))
+        assert_equal(random.choice(['a', 'b'], size=(3, 0, 4)).shape,
+                     (3, 0, 4))
+        assert_raises(ValueError, random.choice, [], 10)
+
+    def test_choice_nan_probabilities(self):
+        a = np.array([42, 1, 2])
+        p = [None, None, None]
+        assert_raises(ValueError, random.choice, a, p=p)
+
+    def test_choice_p_non_contiguous(self):
+        p = np.ones(10) / 5
+        p[1::2] = 3.0
+        random = Generator(MT19937(self.seed))
+        non_contig = random.choice(5, 3, p=p[::2])
+        random = Generator(MT19937(self.seed))
+        contig = random.choice(5, 3, p=np.ascontiguousarray(p[::2]))
+        assert_array_equal(non_contig, contig)
+
+    def test_choice_return_type(self):
+        # gh 9867
+        p = np.ones(4) / 4.
+        actual = random.choice(4, 2)
+        assert actual.dtype == np.int64
+        actual = random.choice(4, 2, replace=False)
+        assert actual.dtype == np.int64
+        actual = random.choice(4, 2, p=p)
+        assert actual.dtype == np.int64
+        actual = random.choice(4, 2, p=p, replace=False)
+        assert actual.dtype == np.int64
+
+    def test_choice_large_sample(self):
+        choice_hash = 'd44962a0b1e92f4a3373c23222244e21'
+        random = Generator(MT19937(self.seed))
+        actual = random.choice(10000, 5000, replace=False)
+        if sys.byteorder != 'little':
+            actual = actual.byteswap()
+        res = hashlib.md5(actual.view(np.int8)).hexdigest()
+        assert_(choice_hash == res)
+
+    def test_bytes(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.bytes(10)
+        desired = b'\x86\xf0\xd4\x18\xe1\x81\t8%\xdd'
+        assert_equal(actual, desired)
+
+    def test_shuffle(self):
+        # Test lists, arrays (of various dtypes), and multidimensional versions
+        # of both, c-contiguous or not:
+        for conv in [lambda x: np.array([]),
+                     lambda x: x,
+                     lambda x: np.asarray(x).astype(np.int8),
+                     lambda x: np.asarray(x).astype(np.float32),
+                     lambda x: np.asarray(x).astype(np.complex64),
+                     lambda x: np.asarray(x).astype(object),
+                     lambda x: [(i, i) for i in x],
+                     lambda x: np.asarray([[i, i] for i in x]),
+                     lambda x: np.vstack([x, x]).T,
+                     # gh-11442
+                     lambda x: (np.asarray([(i, i) for i in x],
+                                           [("a", int), ("b", int)])
+                                .view(np.recarray)),
+                     # gh-4270
+                     lambda x: np.asarray([(i, i) for i in x],
+                                          [("a", object, (1,)),
+                                           ("b", np.int32, (1,))])]:
+            random = Generator(MT19937(self.seed))
+            alist = conv([1, 2, 3, 4, 5, 6, 7, 8, 9, 0])
+            random.shuffle(alist)
+            actual = alist
+            desired = conv([4, 1, 9, 8, 0, 5, 3, 6, 2, 7])
+            assert_array_equal(actual, desired)
+
+    def test_shuffle_custom_axis(self):
+        random = Generator(MT19937(self.seed))
+        actual = np.arange(16).reshape((4, 4))
+        random.shuffle(actual, axis=1)
+        desired = np.array([[ 0,  3,  1,  2],
+                            [ 4,  7,  5,  6],
+                            [ 8, 11,  9, 10],
+                            [12, 15, 13, 14]])
+        assert_array_equal(actual, desired)
+        random = Generator(MT19937(self.seed))
+        actual = np.arange(16).reshape((4, 4))
+        random.shuffle(actual, axis=-1)
+        assert_array_equal(actual, desired)
+
+    def test_shuffle_axis_nonsquare(self):
+        y1 = np.arange(20).reshape(2, 10)
+        y2 = y1.copy()
+        random = Generator(MT19937(self.seed))
+        random.shuffle(y1, axis=1)
+        random = Generator(MT19937(self.seed))
+        random.shuffle(y2.T)
+        assert_array_equal(y1, y2)
+
+    def test_shuffle_masked(self):
+        # gh-3263
+        a = np.ma.masked_values(np.reshape(range(20), (5, 4)) % 3 - 1, -1)
+        b = np.ma.masked_values(np.arange(20) % 3 - 1, -1)
+        a_orig = a.copy()
+        b_orig = b.copy()
+        for i in range(50):
+            random.shuffle(a)
+            assert_equal(
+                sorted(a.data[~a.mask]), sorted(a_orig.data[~a_orig.mask]))
+            random.shuffle(b)
+            assert_equal(
+                sorted(b.data[~b.mask]), sorted(b_orig.data[~b_orig.mask]))
+
+    def test_shuffle_exceptions(self):
+        random = Generator(MT19937(self.seed))
+        arr = np.arange(10)
+        assert_raises(np.AxisError, random.shuffle, arr, 1)
+        arr = np.arange(9).reshape((3, 3))
+        assert_raises(np.AxisError, random.shuffle, arr, 3)
+        assert_raises(TypeError, random.shuffle, arr, slice(1, 2, None))
+        arr = [[1, 2, 3], [4, 5, 6]]
+        assert_raises(NotImplementedError, random.shuffle, arr, 1)
+
+    def test_permutation(self):
+        random = Generator(MT19937(self.seed))
+        alist = [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]
+        actual = random.permutation(alist)
+        desired = [4, 1, 9, 8, 0, 5, 3, 6, 2, 7]
+        assert_array_equal(actual, desired)
+
+        random = Generator(MT19937(self.seed))
+        arr_2d = np.atleast_2d([1, 2, 3, 4, 5, 6, 7, 8, 9, 0]).T
+        actual = random.permutation(arr_2d)
+        assert_array_equal(actual, np.atleast_2d(desired).T)
+        
+        bad_x_str = "abcd"
+        assert_raises(np.AxisError, random.permutation, bad_x_str)
+
+        bad_x_float = 1.2
+        assert_raises(np.AxisError, random.permutation, bad_x_float)
+
+        random = Generator(MT19937(self.seed))
+        integer_val = 10
+        desired = [3, 0, 8, 7, 9, 4, 2, 5, 1, 6]
+
+        actual = random.permutation(integer_val)
+        assert_array_equal(actual, desired)
+
+    def test_permutation_custom_axis(self):
+        a = np.arange(16).reshape((4, 4))
+        desired = np.array([[ 0,  3,  1,  2],
+                            [ 4,  7,  5,  6],
+                            [ 8, 11,  9, 10],
+                            [12, 15, 13, 14]])
+        random = Generator(MT19937(self.seed))
+        actual = random.permutation(a, axis=1)
+        assert_array_equal(actual, desired)
+        random = Generator(MT19937(self.seed))
+        actual = random.permutation(a, axis=-1)
+        assert_array_equal(actual, desired)
+
+    def test_permutation_exceptions(self):
+        random = Generator(MT19937(self.seed))
+        arr = np.arange(10)
+        assert_raises(np.AxisError, random.permutation, arr, 1)
+        arr = np.arange(9).reshape((3, 3))
+        assert_raises(np.AxisError, random.permutation, arr, 3)
+        assert_raises(TypeError, random.permutation, arr, slice(1, 2, None))
+
+    def test_beta(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.beta(.1, .9, size=(3, 2))
+        desired = np.array(
+            [[1.083029353267698e-10, 2.449965303168024e-11],
+             [2.397085162969853e-02, 3.590779671820755e-08],
+             [2.830254190078299e-04, 1.744709918330393e-01]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_binomial(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.binomial(100.123, .456, size=(3, 2))
+        desired = np.array([[42, 41],
+                            [42, 48],
+                            [44, 50]])
+        assert_array_equal(actual, desired)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.binomial(100.123, .456)
+        desired = 42
+        assert_array_equal(actual, desired)
+
+    def test_chisquare(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.chisquare(50, size=(3, 2))
+        desired = np.array([[32.9850547060149, 39.0219480493301],
+                            [56.2006134779419, 57.3474165711485],
+                            [55.4243733880198, 55.4209797925213]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_dirichlet(self):
+        random = Generator(MT19937(self.seed))
+        alpha = np.array([51.72840233779265162, 39.74494232180943953])
+        actual = random.dirichlet(alpha, size=(3, 2))
+        desired = np.array([[[0.5439892869558927,  0.45601071304410745],
+                             [0.5588917345860708,  0.4411082654139292 ]],
+                            [[0.5632074165063435,  0.43679258349365657],
+                             [0.54862581112627,    0.45137418887373015]],
+                            [[0.49961831357047226, 0.5003816864295278 ],
+                             [0.52374806183482,    0.47625193816517997]]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+        bad_alpha = np.array([5.4e-01, -1.0e-16])
+        assert_raises(ValueError, random.dirichlet, bad_alpha)
+
+        random = Generator(MT19937(self.seed))
+        alpha = np.array([51.72840233779265162, 39.74494232180943953])
+        actual = random.dirichlet(alpha)
+        assert_array_almost_equal(actual, desired[0, 0], decimal=15)
+
+    def test_dirichlet_size(self):
+        # gh-3173
+        p = np.array([51.72840233779265162, 39.74494232180943953])
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(random.dirichlet(p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(random.dirichlet(p, np.array((2, 2))).shape, (2, 2, 2))
+
+        assert_raises(TypeError, random.dirichlet, p, float(1))
+
+    def test_dirichlet_bad_alpha(self):
+        # gh-2089
+        alpha = np.array([5.4e-01, -1.0e-16])
+        assert_raises(ValueError, random.dirichlet, alpha)
+
+        # gh-15876
+        assert_raises(ValueError, random.dirichlet, [[5, 1]])
+        assert_raises(ValueError, random.dirichlet, [[5], [1]])
+        assert_raises(ValueError, random.dirichlet, [[[5], [1]], [[1], [5]]])
+        assert_raises(ValueError, random.dirichlet, np.array([[5, 1], [1, 5]]))
+
+    def test_dirichlet_alpha_non_contiguous(self):
+        a = np.array([51.72840233779265162, -1.0, 39.74494232180943953])
+        alpha = a[::2]
+        random = Generator(MT19937(self.seed))
+        non_contig = random.dirichlet(alpha, size=(3, 2))
+        random = Generator(MT19937(self.seed))
+        contig = random.dirichlet(np.ascontiguousarray(alpha),
+                                  size=(3, 2))
+        assert_array_almost_equal(non_contig, contig)
+
+    def test_dirichlet_small_alpha(self):
+        eps = 1.0e-9  # 1.0e-10 -> runtime x 10; 1e-11 -> runtime x 200, etc.
+        alpha = eps * np.array([1., 1.0e-3])
+        random = Generator(MT19937(self.seed))
+        actual = random.dirichlet(alpha, size=(3, 2))
+        expected = np.array([
+            [[1., 0.],
+             [1., 0.]],
+            [[1., 0.],
+             [1., 0.]],
+            [[1., 0.],
+             [1., 0.]]
+        ])
+        assert_array_almost_equal(actual, expected, decimal=15)
+
+    @pytest.mark.slow
+    def test_dirichlet_moderately_small_alpha(self):
+        # Use alpha.max() < 0.1 to trigger stick breaking code path
+        alpha = np.array([0.02, 0.04, 0.03])
+        exact_mean = alpha / alpha.sum()
+        random = Generator(MT19937(self.seed))
+        sample = random.dirichlet(alpha, size=20000000)
+        sample_mean = sample.mean(axis=0)
+        assert_allclose(sample_mean, exact_mean, rtol=1e-3)
+
+    def test_exponential(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.exponential(1.1234, size=(3, 2))
+        desired = np.array([[0.098845481066258, 1.560752510746964],
+                            [0.075730916041636, 1.769098974710777],
+                            [1.488602544592235, 2.49684815275751 ]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_exponential_0(self):
+        assert_equal(random.exponential(scale=0), 0)
+        assert_raises(ValueError, random.exponential, scale=-0.)
+
+    def test_f(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.f(12, 77, size=(3, 2))
+        desired = np.array([[0.461720027077085, 1.100441958872451],
+                            [1.100337455217484, 0.91421736740018 ],
+                            [0.500811891303113, 0.826802454552058]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gamma(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.gamma(5, 3, size=(3, 2))
+        desired = np.array([[ 5.03850858902096,  7.9228656732049 ],
+                            [18.73983605132985, 19.57961681699238],
+                            [18.17897755150825, 18.17653912505234]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_gamma_0(self):
+        assert_equal(random.gamma(shape=0, scale=0), 0)
+        assert_raises(ValueError, random.gamma, shape=-0., scale=-0.)
+
+    def test_geometric(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.geometric(.123456789, size=(3, 2))
+        desired = np.array([[ 1, 10],
+                            [ 1, 12],
+                            [ 9, 10]])
+        assert_array_equal(actual, desired)
+
+    def test_geometric_exceptions(self):
+        assert_raises(ValueError, random.geometric, 1.1)
+        assert_raises(ValueError, random.geometric, [1.1] * 10)
+        assert_raises(ValueError, random.geometric, -0.1)
+        assert_raises(ValueError, random.geometric, [-0.1] * 10)
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, random.geometric, np.nan)
+            assert_raises(ValueError, random.geometric, [np.nan] * 10)
+
+    def test_gumbel(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.gumbel(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[ 4.688397515056245, -0.289514845417841],
+                            [ 4.981176042584683, -0.633224272589149],
+                            [-0.055915275687488, -0.333962478257953]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gumbel_0(self):
+        assert_equal(random.gumbel(scale=0), 0)
+        assert_raises(ValueError, random.gumbel, scale=-0.)
+
+    def test_hypergeometric(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.hypergeometric(10.1, 5.5, 14, size=(3, 2))
+        desired = np.array([[ 9, 9],
+                            [ 9, 9],
+                            [10, 9]])
+        assert_array_equal(actual, desired)
+
+        # Test nbad = 0
+        actual = random.hypergeometric(5, 0, 3, size=4)
+        desired = np.array([3, 3, 3, 3])
+        assert_array_equal(actual, desired)
+
+        actual = random.hypergeometric(15, 0, 12, size=4)
+        desired = np.array([12, 12, 12, 12])
+        assert_array_equal(actual, desired)
+
+        # Test ngood = 0
+        actual = random.hypergeometric(0, 5, 3, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+        actual = random.hypergeometric(0, 15, 12, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+    def test_laplace(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.laplace(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[-3.156353949272393,  1.195863024830054],
+                            [-3.435458081645966,  1.656882398925444],
+                            [ 0.924824032467446,  1.251116432209336]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_laplace_0(self):
+        assert_equal(random.laplace(scale=0), 0)
+        assert_raises(ValueError, random.laplace, scale=-0.)
+
+    def test_logistic(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.logistic(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[-4.338584631510999,  1.890171436749954],
+                            [-4.64547787337966 ,  2.514545562919217],
+                            [ 1.495389489198666,  1.967827627577474]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_lognormal(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.lognormal(mean=.123456789, sigma=2.0, size=(3, 2))
+        desired = np.array([[ 0.0268252166335, 13.9534486483053],
+                            [ 0.1204014788936,  2.2422077497792],
+                            [ 4.2484199496128, 12.0093343977523]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_lognormal_0(self):
+        assert_equal(random.lognormal(sigma=0), 1)
+        assert_raises(ValueError, random.lognormal, sigma=-0.)
+
+    def test_logseries(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.logseries(p=.923456789, size=(3, 2))
+        desired = np.array([[14, 17],
+                            [3, 18],
+                            [5, 1]])
+        assert_array_equal(actual, desired)
+
+    def test_logseries_exceptions(self):
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, random.logseries, np.nan)
+            assert_raises(ValueError, random.logseries, [np.nan] * 10)
+
+    def test_multinomial(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.multinomial(20, [1 / 6.] * 6, size=(3, 2))
+        desired = np.array([[[1, 5, 1, 6, 4, 3],
+                             [4, 2, 6, 2, 4, 2]],
+                            [[5, 3, 2, 6, 3, 1],
+                             [4, 4, 0, 2, 3, 7]],
+                            [[6, 3, 1, 5, 3, 2],
+                             [5, 5, 3, 1, 2, 4]]])
+        assert_array_equal(actual, desired)
+
+    @pytest.mark.parametrize("method", ["svd", "eigh", "cholesky"])
+    def test_multivariate_normal(self, method):
+        random = Generator(MT19937(self.seed))
+        mean = (.123456789, 10)
+        cov = [[1, 0], [0, 1]]
+        size = (3, 2)
+        actual = random.multivariate_normal(mean, cov, size, method=method)
+        desired = np.array([[[-1.747478062846581,  11.25613495182354  ],
+                             [-0.9967333370066214, 10.342002097029821 ]],
+                            [[ 0.7850019631242964, 11.181113712443013 ],
+                             [ 0.8901349653255224,  8.873825399642492 ]],
+                            [[ 0.7130260107430003,  9.551628690083056 ],
+                             [ 0.7127098726541128, 11.991709234143173 ]]])
+
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        # Check for default size, was raising deprecation warning
+        actual = random.multivariate_normal(mean, cov, method=method)
+        desired = np.array([0.233278563284287, 9.424140804347195])
+        assert_array_almost_equal(actual, desired, decimal=15)
+        # Check that non symmetric covariance input raises exception when
+        # check_valid='raises' if using default svd method.
+        mean = [0, 0]
+        cov = [[1, 2], [1, 2]]
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='raise')
+
+        # Check that non positive-semidefinite covariance warns with
+        # RuntimeWarning
+        cov = [[1, 2], [2, 1]]
+        assert_warns(RuntimeWarning, random.multivariate_normal, mean, cov)
+        assert_warns(RuntimeWarning, random.multivariate_normal, mean, cov,
+                     method='eigh')
+        assert_raises(LinAlgError, random.multivariate_normal, mean, cov,
+                      method='cholesky')
+
+        # and that it doesn't warn with RuntimeWarning check_valid='ignore'
+        assert_no_warnings(random.multivariate_normal, mean, cov,
+                           check_valid='ignore')
+
+        # and that it raises with RuntimeWarning check_valid='raises'
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='raise')
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='raise', method='eigh')
+
+        # check degenerate samples from singular covariance matrix
+        cov = [[1, 1], [1, 1]]
+        if method in ('svd', 'eigh'):
+            samples = random.multivariate_normal(mean, cov, size=(3, 2),
+                                                 method=method)
+            assert_array_almost_equal(samples[..., 0], samples[..., 1],
+                                      decimal=6)
+        else:
+            assert_raises(LinAlgError, random.multivariate_normal, mean, cov,
+                          method='cholesky')
+
+        cov = np.array([[1, 0.1], [0.1, 1]], dtype=np.float32)
+        with suppress_warnings() as sup:
+            random.multivariate_normal(mean, cov, method=method)
+            w = sup.record(RuntimeWarning)
+            assert len(w) == 0
+
+        mu = np.zeros(2)
+        cov = np.eye(2)
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='other')
+        assert_raises(ValueError, random.multivariate_normal,
+                      np.zeros((2, 1, 1)), cov)
+        assert_raises(ValueError, random.multivariate_normal,
+                      mu, np.empty((3, 2)))
+        assert_raises(ValueError, random.multivariate_normal,
+                      mu, np.eye(3))
+
+    @pytest.mark.parametrize("method", ["svd", "eigh", "cholesky"])
+    def test_multivariate_normal_basic_stats(self, method):
+        random = Generator(MT19937(self.seed))
+        n_s = 1000
+        mean = np.array([1, 2])
+        cov = np.array([[2, 1], [1, 2]])
+        s = random.multivariate_normal(mean, cov, size=(n_s,), method=method)
+        s_center = s - mean
+        cov_emp = (s_center.T @ s_center) / (n_s - 1)
+        # these are pretty loose and are only designed to detect major errors
+        assert np.all(np.abs(s_center.mean(-2)) < 0.1)
+        assert np.all(np.abs(cov_emp - cov) < 0.2)
+
+    def test_negative_binomial(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.negative_binomial(n=100, p=.12345, size=(3, 2))
+        desired = np.array([[543, 727],
+                            [775, 760],
+                            [600, 674]])
+        assert_array_equal(actual, desired)
+
+    def test_negative_binomial_exceptions(self):
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, random.negative_binomial, 100, np.nan)
+            assert_raises(ValueError, random.negative_binomial, 100,
+                          [np.nan] * 10)
+
+    def test_negative_binomial_p0_exception(self):
+        # Verify that p=0 raises an exception.
+        with assert_raises(ValueError):
+            x = random.negative_binomial(1, 0)
+
+    def test_noncentral_chisquare(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.noncentral_chisquare(df=5, nonc=5, size=(3, 2))
+        desired = np.array([[ 1.70561552362133, 15.97378184942111],
+                            [13.71483425173724, 20.17859633310629],
+                            [11.3615477156643 ,  3.67891108738029]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        actual = random.noncentral_chisquare(df=.5, nonc=.2, size=(3, 2))
+        desired = np.array([[9.41427665607629e-04, 1.70473157518850e-04],
+                            [1.14554372041263e+00, 1.38187755933435e-03],
+                            [1.90659181905387e+00, 1.21772577941822e+00]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.noncentral_chisquare(df=5, nonc=0, size=(3, 2))
+        desired = np.array([[0.82947954590419, 1.80139670767078],
+                            [6.58720057417794, 7.00491463609814],
+                            [6.31101879073157, 6.30982307753005]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_noncentral_f(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.noncentral_f(dfnum=5, dfden=2, nonc=1,
+                                     size=(3, 2))
+        desired = np.array([[0.060310671139  , 0.23866058175939],
+                            [0.86860246709073, 0.2668510459738 ],
+                            [0.23375780078364, 1.88922102885943]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_noncentral_f_nan(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.noncentral_f(dfnum=5, dfden=2, nonc=np.nan)
+        assert np.isnan(actual)
+
+    def test_normal(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.normal(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[-3.618412914693162,  2.635726692647081],
+                            [-2.116923463013243,  0.807460983059643],
+                            [ 1.446547137248593,  2.485684213886024]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_normal_0(self):
+        assert_equal(random.normal(scale=0), 0)
+        assert_raises(ValueError, random.normal, scale=-0.)
+
+    def test_pareto(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.pareto(a=.123456789, size=(3, 2))
+        desired = np.array([[1.0394926776069018e+00, 7.7142534343505773e+04],
+                            [7.2640150889064703e-01, 3.4650454783825594e+05],
+                            [4.5852344481994740e+04, 6.5851383009539105e+07]])
+        # For some reason on 32-bit x86 Ubuntu 12.10 the [1, 0] entry in this
+        # matrix differs by 24 nulps. Discussion:
+        #   https://mail.python.org/pipermail/numpy-discussion/2012-September/063801.html
+        # Consensus is that this is probably some gcc quirk that affects
+        # rounding but not in any important way, so we just use a looser
+        # tolerance on this test:
+        np.testing.assert_array_almost_equal_nulp(actual, desired, nulp=30)
+
+    def test_poisson(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.poisson(lam=.123456789, size=(3, 2))
+        desired = np.array([[0, 0],
+                            [0, 0],
+                            [0, 0]])
+        assert_array_equal(actual, desired)
+
+    def test_poisson_exceptions(self):
+        lambig = np.iinfo('int64').max
+        lamneg = -1
+        assert_raises(ValueError, random.poisson, lamneg)
+        assert_raises(ValueError, random.poisson, [lamneg] * 10)
+        assert_raises(ValueError, random.poisson, lambig)
+        assert_raises(ValueError, random.poisson, [lambig] * 10)
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, random.poisson, np.nan)
+            assert_raises(ValueError, random.poisson, [np.nan] * 10)
+
+    def test_power(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.power(a=.123456789, size=(3, 2))
+        desired = np.array([[1.977857368842754e-09, 9.806792196620341e-02],
+                            [2.482442984543471e-10, 1.527108843266079e-01],
+                            [8.188283434244285e-02, 3.950547209346948e-01]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_rayleigh(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.rayleigh(scale=10, size=(3, 2))
+        desired = np.array([[ 4.51734079831581, 15.6802442485758 ],
+                            [ 4.19850651287094, 17.08718809823704],
+                            [14.7907457708776 , 15.85545333419775]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_rayleigh_0(self):
+        assert_equal(random.rayleigh(scale=0), 0)
+        assert_raises(ValueError, random.rayleigh, scale=-0.)
+
+    def test_standard_cauchy(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_cauchy(size=(3, 2))
+        desired = np.array([[-1.489437778266206, -3.275389641569784],
+                            [ 0.560102864910406, -0.680780916282552],
+                            [-1.314912905226277,  0.295852965660225]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_exponential(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_exponential(size=(3, 2), method='inv')
+        desired = np.array([[0.102031839440643, 1.229350298474972],
+                            [0.088137284693098, 1.459859985522667],
+                            [1.093830802293668, 1.256977002164613]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_expoential_type_error(self):
+        assert_raises(TypeError, random.standard_exponential, dtype=np.int32)
+
+    def test_standard_gamma(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_gamma(shape=3, size=(3, 2))
+        desired = np.array([[0.62970724056362, 1.22379851271008],
+                            [3.899412530884  , 4.12479964250139],
+                            [3.74994102464584, 3.74929307690815]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_standard_gammma_scalar_float(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_gamma(3, dtype=np.float32)
+        desired = 2.9242148399353027
+        assert_array_almost_equal(actual, desired, decimal=6)
+
+    def test_standard_gamma_float(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_gamma(shape=3, size=(3, 2))
+        desired = np.array([[0.62971, 1.2238 ],
+                            [3.89941, 4.1248 ],
+                            [3.74994, 3.74929]])
+        assert_array_almost_equal(actual, desired, decimal=5)
+
+    def test_standard_gammma_float_out(self):
+        actual = np.zeros((3, 2), dtype=np.float32)
+        random = Generator(MT19937(self.seed))
+        random.standard_gamma(10.0, out=actual, dtype=np.float32)
+        desired = np.array([[10.14987,  7.87012],
+                             [ 9.46284, 12.56832],
+                             [13.82495,  7.81533]], dtype=np.float32)
+        assert_array_almost_equal(actual, desired, decimal=5)
+
+        random = Generator(MT19937(self.seed))
+        random.standard_gamma(10.0, out=actual, size=(3, 2), dtype=np.float32)
+        assert_array_almost_equal(actual, desired, decimal=5)
+
+    def test_standard_gamma_unknown_type(self):
+        assert_raises(TypeError, random.standard_gamma, 1.,
+                      dtype='int32')
+
+    def test_out_size_mismatch(self):
+        out = np.zeros(10)
+        assert_raises(ValueError, random.standard_gamma, 10.0, size=20,
+                      out=out)
+        assert_raises(ValueError, random.standard_gamma, 10.0, size=(10, 1),
+                      out=out)
+
+    def test_standard_gamma_0(self):
+        assert_equal(random.standard_gamma(shape=0), 0)
+        assert_raises(ValueError, random.standard_gamma, shape=-0.)
+
+    def test_standard_normal(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_normal(size=(3, 2))
+        desired = np.array([[-1.870934851846581,  1.25613495182354 ],
+                            [-1.120190126006621,  0.342002097029821],
+                            [ 0.661545174124296,  1.181113712443012]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_normal_unsupported_type(self):
+        assert_raises(TypeError, random.standard_normal, dtype=np.int32)
+
+    def test_standard_t(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_t(df=10, size=(3, 2))
+        desired = np.array([[-1.484666193042647,  0.30597891831161 ],
+                            [ 1.056684299648085, -0.407312602088507],
+                            [ 0.130704414281157, -2.038053410490321]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_triangular(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.triangular(left=5.12, mode=10.23, right=20.34,
+                                   size=(3, 2))
+        desired = np.array([[ 7.86664070590917, 13.6313848513185 ],
+                            [ 7.68152445215983, 14.36169131136546],
+                            [13.16105603911429, 13.72341621856971]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_uniform(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.uniform(low=1.23, high=10.54, size=(3, 2))
+        desired = np.array([[2.13306255040998 , 7.816987531021207],
+                            [2.015436610109887, 8.377577533009589],
+                            [7.421792588856135, 7.891185744455209]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_uniform_range_bounds(self):
+        fmin = np.finfo('float').min
+        fmax = np.finfo('float').max
+
+        func = random.uniform
+        assert_raises(OverflowError, func, -np.inf, 0)
+        assert_raises(OverflowError, func, 0, np.inf)
+        assert_raises(OverflowError, func, fmin, fmax)
+        assert_raises(OverflowError, func, [-np.inf], [0])
+        assert_raises(OverflowError, func, [0], [np.inf])
+
+        # (fmax / 1e17) - fmin is within range, so this should not throw
+        # account for i386 extended precision DBL_MAX / 1e17 + DBL_MAX >
+        # DBL_MAX by increasing fmin a bit
+        random.uniform(low=np.nextafter(fmin, 1), high=fmax / 1e17)
+
+    def test_scalar_exception_propagation(self):
+        # Tests that exceptions are correctly propagated in distributions
+        # when called with objects that throw exceptions when converted to
+        # scalars.
+        #
+        # Regression test for gh: 8865
+
+        class ThrowingFloat(np.ndarray):
+            def __float__(self):
+                raise TypeError
+
+        throwing_float = np.array(1.0).view(ThrowingFloat)
+        assert_raises(TypeError, random.uniform, throwing_float,
+                      throwing_float)
+
+        class ThrowingInteger(np.ndarray):
+            def __int__(self):
+                raise TypeError
+
+        throwing_int = np.array(1).view(ThrowingInteger)
+        assert_raises(TypeError, random.hypergeometric, throwing_int, 1, 1)
+
+    def test_vonmises(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.vonmises(mu=1.23, kappa=1.54, size=(3, 2))
+        desired = np.array([[ 1.107972248690106,  2.841536476232361],
+                            [ 1.832602376042457,  1.945511926976032],
+                            [-0.260147475776542,  2.058047492231698]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_vonmises_small(self):
+        # check infinite loop, gh-4720
+        random = Generator(MT19937(self.seed))
+        r = random.vonmises(mu=0., kappa=1.1e-8, size=10**6)
+        assert_(np.isfinite(r).all())
+
+    def test_vonmises_nan(self):
+        random = Generator(MT19937(self.seed))
+        r = random.vonmises(mu=0., kappa=np.nan)
+        assert_(np.isnan(r))
+
+    def test_wald(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.wald(mean=1.23, scale=1.54, size=(3, 2))
+        desired = np.array([[0.26871721804551, 3.2233942732115 ],
+                            [2.20328374987066, 2.40958405189353],
+                            [2.07093587449261, 0.73073890064369]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_weibull(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.weibull(a=1.23, size=(3, 2))
+        desired = np.array([[0.138613914769468, 1.306463419753191],
+                            [0.111623365934763, 1.446570494646721],
+                            [1.257145775276011, 1.914247725027957]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_weibull_0(self):
+        random = Generator(MT19937(self.seed))
+        assert_equal(random.weibull(a=0, size=12), np.zeros(12))
+        assert_raises(ValueError, random.weibull, a=-0.)
+
+    def test_zipf(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.zipf(a=1.23, size=(3, 2))
+        desired = np.array([[  1,   1],
+                            [ 10, 867],
+                            [354,   2]])
+        assert_array_equal(actual, desired)
+
+
+class TestBroadcast:
+    # tests that functions that broadcast behave
+    # correctly when presented with non-scalar arguments
+    def setup(self):
+        self.seed = 123456789
+
+
+    def test_uniform(self):
+        random = Generator(MT19937(self.seed))
+        low = [0]
+        high = [1]
+        uniform = random.uniform
+        desired = np.array([0.16693771389729, 0.19635129550675, 0.75563050964095])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.uniform(low * 3, high)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.uniform(low, high * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_normal(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        random = Generator(MT19937(self.seed))
+        desired = np.array([-0.38736406738527,  0.79594375042255,  0.0197076236097])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.normal(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.normal, loc * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        normal = random.normal
+        actual = normal(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, normal, loc, bad_scale * 3)
+
+    def test_beta(self):
+        a = [1]
+        b = [2]
+        bad_a = [-1]
+        bad_b = [-2]
+        desired = np.array([0.18719338682602, 0.73234824491364, 0.17928615186455])
+
+        random = Generator(MT19937(self.seed))
+        beta = random.beta
+        actual = beta(a * 3, b)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, beta, bad_a * 3, b)
+        assert_raises(ValueError, beta, a * 3, bad_b)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.beta(a, b * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_exponential(self):
+        scale = [1]
+        bad_scale = [-1]
+        desired = np.array([0.67245993212806, 0.21380495318094, 0.7177848928629])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.exponential(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.exponential, bad_scale * 3)
+
+    def test_standard_gamma(self):
+        shape = [1]
+        bad_shape = [-1]
+        desired = np.array([0.67245993212806, 0.21380495318094, 0.7177848928629])
+
+        random = Generator(MT19937(self.seed))
+        std_gamma = random.standard_gamma
+        actual = std_gamma(shape * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, std_gamma, bad_shape * 3)
+
+    def test_gamma(self):
+        shape = [1]
+        scale = [2]
+        bad_shape = [-1]
+        bad_scale = [-2]
+        desired = np.array([1.34491986425611, 0.42760990636187, 1.4355697857258])
+
+        random = Generator(MT19937(self.seed))
+        gamma = random.gamma
+        actual = gamma(shape * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape * 3, scale)
+        assert_raises(ValueError, gamma, shape * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        gamma = random.gamma
+        actual = gamma(shape, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape, scale * 3)
+        assert_raises(ValueError, gamma, shape, bad_scale * 3)
+
+    def test_f(self):
+        dfnum = [1]
+        dfden = [2]
+        bad_dfnum = [-1]
+        bad_dfden = [-2]
+        desired = np.array([0.07765056244107, 7.72951397913186, 0.05786093891763])
+
+        random = Generator(MT19937(self.seed))
+        f = random.f
+        actual = f(dfnum * 3, dfden)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum * 3, dfden)
+        assert_raises(ValueError, f, dfnum * 3, bad_dfden)
+
+        random = Generator(MT19937(self.seed))
+        f = random.f
+        actual = f(dfnum, dfden * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum, dfden * 3)
+        assert_raises(ValueError, f, dfnum, bad_dfden * 3)
+
+    def test_noncentral_f(self):
+        dfnum = [2]
+        dfden = [3]
+        nonc = [4]
+        bad_dfnum = [0]
+        bad_dfden = [-1]
+        bad_nonc = [-2]
+        desired = np.array([2.02434240411421, 12.91838601070124, 1.24395160354629])
+
+        random = Generator(MT19937(self.seed))
+        nonc_f = random.noncentral_f
+        actual = nonc_f(dfnum * 3, dfden, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert np.all(np.isnan(nonc_f(dfnum, dfden, [np.nan] * 3)))
+
+        assert_raises(ValueError, nonc_f, bad_dfnum * 3, dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, bad_dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, dfden, bad_nonc)
+
+        random = Generator(MT19937(self.seed))
+        nonc_f = random.noncentral_f
+        actual = nonc_f(dfnum, dfden * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, dfden * 3, bad_nonc)
+
+        random = Generator(MT19937(self.seed))
+        nonc_f = random.noncentral_f
+        actual = nonc_f(dfnum, dfden, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, dfden, bad_nonc * 3)
+
+    def test_noncentral_f_small_df(self):
+        random = Generator(MT19937(self.seed))
+        desired = np.array([0.04714867120827, 0.1239390327694])
+        actual = random.noncentral_f(0.9, 0.9, 2, size=2)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_chisquare(self):
+        df = [1]
+        bad_df = [-1]
+        desired = np.array([0.05573640064251, 1.47220224353539, 2.9469379318589])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.chisquare(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.chisquare, bad_df * 3)
+
+    def test_noncentral_chisquare(self):
+        df = [1]
+        nonc = [2]
+        bad_df = [-1]
+        bad_nonc = [-2]
+        desired = np.array([0.07710766249436, 5.27829115110304, 0.630732147399])
+
+        random = Generator(MT19937(self.seed))
+        nonc_chi = random.noncentral_chisquare
+        actual = nonc_chi(df * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df * 3, nonc)
+        assert_raises(ValueError, nonc_chi, df * 3, bad_nonc)
+
+        random = Generator(MT19937(self.seed))
+        nonc_chi = random.noncentral_chisquare
+        actual = nonc_chi(df, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df, nonc * 3)
+        assert_raises(ValueError, nonc_chi, df, bad_nonc * 3)
+
+    def test_standard_t(self):
+        df = [1]
+        bad_df = [-1]
+        desired = np.array([-1.39498829447098, -1.23058658835223, 0.17207021065983])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.standard_t(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.standard_t, bad_df * 3)
+
+    def test_vonmises(self):
+        mu = [2]
+        kappa = [1]
+        bad_kappa = [-1]
+        desired = np.array([2.25935584988528, 2.23326261461399, -2.84152146503326])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.vonmises(mu * 3, kappa)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.vonmises, mu * 3, bad_kappa)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.vonmises(mu, kappa * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.vonmises, mu, bad_kappa * 3)
+
+    def test_pareto(self):
+        a = [1]
+        bad_a = [-1]
+        desired = np.array([0.95905052946317, 0.2383810889437 , 1.04988745750013])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.pareto(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.pareto, bad_a * 3)
+
+    def test_weibull(self):
+        a = [1]
+        bad_a = [-1]
+        desired = np.array([0.67245993212806, 0.21380495318094, 0.7177848928629])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.weibull(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.weibull, bad_a * 3)
+
+    def test_power(self):
+        a = [1]
+        bad_a = [-1]
+        desired = np.array([0.48954864361052, 0.19249412888486, 0.51216834058807])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.power(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.power, bad_a * 3)
+
+    def test_laplace(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        desired = np.array([-1.09698732625119, -0.93470271947368, 0.71592671378202])
+
+        random = Generator(MT19937(self.seed))
+        laplace = random.laplace
+        actual = laplace(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        laplace = random.laplace
+        actual = laplace(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc, bad_scale * 3)
+
+    def test_gumbel(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        desired = np.array([1.70020068231762, 1.52054354273631, -0.34293267607081])
+
+        random = Generator(MT19937(self.seed))
+        gumbel = random.gumbel
+        actual = gumbel(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        gumbel = random.gumbel
+        actual = gumbel(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc, bad_scale * 3)
+
+    def test_logistic(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        desired = np.array([-1.607487640433, -1.40925686003678, 1.12887112820397])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.logistic(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.logistic, loc * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.logistic(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.logistic, loc, bad_scale * 3)
+        assert_equal(random.logistic(1.0, 0.0), 1.0)
+
+    def test_lognormal(self):
+        mean = [0]
+        sigma = [1]
+        bad_sigma = [-1]
+        desired = np.array([0.67884390500697, 2.21653186290321, 1.01990310084276])
+
+        random = Generator(MT19937(self.seed))
+        lognormal = random.lognormal
+        actual = lognormal(mean * 3, sigma)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, lognormal, mean * 3, bad_sigma)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.lognormal(mean, sigma * 3)
+        assert_raises(ValueError, random.lognormal, mean, bad_sigma * 3)
+
+    def test_rayleigh(self):
+        scale = [1]
+        bad_scale = [-1]
+        desired = np.array([0.60439534475066, 0.66120048396359, 1.67873398389499])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.rayleigh(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.rayleigh, bad_scale * 3)
+
+    def test_wald(self):
+        mean = [0.5]
+        scale = [1]
+        bad_mean = [0]
+        bad_scale = [-2]
+        desired = np.array([0.38052407392905, 0.50701641508592, 0.484935249864])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.wald(mean * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.wald, bad_mean * 3, scale)
+        assert_raises(ValueError, random.wald, mean * 3, bad_scale)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.wald(mean, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, random.wald, bad_mean, scale * 3)
+        assert_raises(ValueError, random.wald, mean, bad_scale * 3)
+
+    def test_triangular(self):
+        left = [1]
+        right = [3]
+        mode = [2]
+        bad_left_one = [3]
+        bad_mode_one = [4]
+        bad_left_two, bad_mode_two = right * 2
+        desired = np.array([1.57781954604754, 1.62665986867957, 2.30090130831326])
+
+        random = Generator(MT19937(self.seed))
+        triangular = random.triangular
+        actual = triangular(left * 3, mode, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one * 3, mode, right)
+        assert_raises(ValueError, triangular, left * 3, bad_mode_one, right)
+        assert_raises(ValueError, triangular, bad_left_two * 3, bad_mode_two,
+                      right)
+
+        random = Generator(MT19937(self.seed))
+        triangular = random.triangular
+        actual = triangular(left, mode * 3, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode * 3, right)
+        assert_raises(ValueError, triangular, left, bad_mode_one * 3, right)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two * 3,
+                      right)
+
+        random = Generator(MT19937(self.seed))
+        triangular = random.triangular
+        actual = triangular(left, mode, right * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode, right * 3)
+        assert_raises(ValueError, triangular, left, bad_mode_one, right * 3)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two,
+                      right * 3)
+
+        assert_raises(ValueError, triangular, 10., 0., 20.)
+        assert_raises(ValueError, triangular, 10., 25., 20.)
+        assert_raises(ValueError, triangular, 10., 10., 10.)
+
+    def test_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        desired = np.array([0, 0, 1])
+
+        random = Generator(MT19937(self.seed))
+        binom = random.binomial
+        actual = binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n * 3, p)
+        assert_raises(ValueError, binom, n * 3, bad_p_one)
+        assert_raises(ValueError, binom, n * 3, bad_p_two)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.binomial(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n, p * 3)
+        assert_raises(ValueError, binom, n, bad_p_one * 3)
+        assert_raises(ValueError, binom, n, bad_p_two * 3)
+
+    def test_negative_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        desired = np.array([0, 2, 1], dtype=np.int64)
+
+        random = Generator(MT19937(self.seed))
+        neg_binom = random.negative_binomial
+        actual = neg_binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n * 3, p)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_one)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_two)
+
+        random = Generator(MT19937(self.seed))
+        neg_binom = random.negative_binomial
+        actual = neg_binom(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n, p * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_one * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_two * 3)
+
+    def test_poisson(self):
+
+        lam = [1]
+        bad_lam_one = [-1]
+        desired = np.array([0, 0, 3])
+
+        random = Generator(MT19937(self.seed))
+        max_lam = random._poisson_lam_max
+        bad_lam_two = [max_lam * 2]
+        poisson = random.poisson
+        actual = poisson(lam * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, poisson, bad_lam_one * 3)
+        assert_raises(ValueError, poisson, bad_lam_two * 3)
+
+    def test_zipf(self):
+        a = [2]
+        bad_a = [0]
+        desired = np.array([1, 8, 1])
+
+        random = Generator(MT19937(self.seed))
+        zipf = random.zipf
+        actual = zipf(a * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, zipf, bad_a * 3)
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, zipf, np.nan)
+            assert_raises(ValueError, zipf, [0, 0, np.nan])
+
+    def test_geometric(self):
+        p = [0.5]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        desired = np.array([1, 1, 3])
+
+        random = Generator(MT19937(self.seed))
+        geometric = random.geometric
+        actual = geometric(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, geometric, bad_p_one * 3)
+        assert_raises(ValueError, geometric, bad_p_two * 3)
+
+    def test_hypergeometric(self):
+        ngood = [1]
+        nbad = [2]
+        nsample = [2]
+        bad_ngood = [-1]
+        bad_nbad = [-2]
+        bad_nsample_one = [-1]
+        bad_nsample_two = [4]
+        desired = np.array([0, 0, 1])
+
+        random = Generator(MT19937(self.seed))
+        actual = random.hypergeometric(ngood * 3, nbad, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, random.hypergeometric, bad_ngood * 3, nbad, nsample)
+        assert_raises(ValueError, random.hypergeometric, ngood * 3, bad_nbad, nsample)
+        assert_raises(ValueError, random.hypergeometric, ngood * 3, nbad, bad_nsample_one)
+        assert_raises(ValueError, random.hypergeometric, ngood * 3, nbad, bad_nsample_two)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.hypergeometric(ngood, nbad * 3, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, random.hypergeometric, bad_ngood, nbad * 3, nsample)
+        assert_raises(ValueError, random.hypergeometric, ngood, bad_nbad * 3, nsample)
+        assert_raises(ValueError, random.hypergeometric, ngood, nbad * 3, bad_nsample_one)
+        assert_raises(ValueError, random.hypergeometric, ngood, nbad * 3, bad_nsample_two)
+
+        random = Generator(MT19937(self.seed))
+        hypergeom = random.hypergeometric
+        actual = hypergeom(ngood, nbad, nsample * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood, nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, bad_nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_one * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_two * 3)
+
+        assert_raises(ValueError, hypergeom, -1, 10, 20)
+        assert_raises(ValueError, hypergeom, 10, -1, 20)
+        assert_raises(ValueError, hypergeom, 10, 10, -1)
+        assert_raises(ValueError, hypergeom, 10, 10, 25)
+
+        # ValueError for arguments that are too big.
+        assert_raises(ValueError, hypergeom, 2**30, 10, 20)
+        assert_raises(ValueError, hypergeom, 999, 2**31, 50)
+        assert_raises(ValueError, hypergeom, 999, [2**29, 2**30], 1000)
+
+    def test_logseries(self):
+        p = [0.5]
+        bad_p_one = [2]
+        bad_p_two = [-1]
+        desired = np.array([1, 1, 1])
+
+        random = Generator(MT19937(self.seed))
+        logseries = random.logseries
+        actual = logseries(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, logseries, bad_p_one * 3)
+        assert_raises(ValueError, logseries, bad_p_two * 3)
+
+    def test_multinomial(self):
+        random = Generator(MT19937(self.seed))
+        actual = random.multinomial([5, 20], [1 / 6.] * 6, size=(3, 2))
+        desired = np.array([[[0, 0, 2, 1, 2, 0],
+                             [2, 3, 6, 4, 2, 3]],
+                            [[1, 0, 1, 0, 2, 1],
+                             [7, 2, 2, 1, 4, 4]],
+                            [[0, 2, 0, 1, 2, 0],
+                             [3, 2, 3, 3, 4, 5]]], dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+        random = Generator(MT19937(self.seed))
+        actual = random.multinomial([5, 20], [1 / 6.] * 6)
+        desired = np.array([[0, 0, 2, 1, 2, 0],
+                            [2, 3, 6, 4, 2, 3]], dtype=np.int64)
+        assert_array_equal(actual, desired)
+
+
+class TestThread:
+    # make sure each state produces the same sequence even in threads
+    def setup(self):
+        self.seeds = range(4)
+
+    def check_function(self, function, sz):
+        from threading import Thread
+
+        out1 = np.empty((len(self.seeds),) + sz)
+        out2 = np.empty((len(self.seeds),) + sz)
+
+        # threaded generation
+        t = [Thread(target=function, args=(Generator(MT19937(s)), o))
+             for s, o in zip(self.seeds, out1)]
+        [x.start() for x in t]
+        [x.join() for x in t]
+
+        # the same serial
+        for s, o in zip(self.seeds, out2):
+            function(Generator(MT19937(s)), o)
+
+        # these platforms change x87 fpu precision mode in threads
+        if np.intp().dtype.itemsize == 4 and sys.platform == "win32":
+            assert_array_almost_equal(out1, out2)
+        else:
+            assert_array_equal(out1, out2)
+
+    def test_normal(self):
+        def gen_random(state, out):
+            out[...] = state.normal(size=10000)
+
+        self.check_function(gen_random, sz=(10000,))
+
+    def test_exp(self):
+        def gen_random(state, out):
+            out[...] = state.exponential(scale=np.ones((100, 1000)))
+
+        self.check_function(gen_random, sz=(100, 1000))
+
+    def test_multinomial(self):
+        def gen_random(state, out):
+            out[...] = state.multinomial(10, [1 / 6.] * 6, size=10000)
+
+        self.check_function(gen_random, sz=(10000, 6))
+
+
+# See Issue #4263
+class TestSingleEltArrayInput:
+    def setup(self):
+        self.argOne = np.array([2])
+        self.argTwo = np.array([3])
+        self.argThree = np.array([4])
+        self.tgtShape = (1,)
+
+    def test_one_arg_funcs(self):
+        funcs = (random.exponential, random.standard_gamma,
+                 random.chisquare, random.standard_t,
+                 random.pareto, random.weibull,
+                 random.power, random.rayleigh,
+                 random.poisson, random.zipf,
+                 random.geometric, random.logseries)
+
+        probfuncs = (random.geometric, random.logseries)
+
+        for func in funcs:
+            if func in probfuncs:  # p < 1.0
+                out = func(np.array([0.5]))
+
+            else:
+                out = func(self.argOne)
+
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_two_arg_funcs(self):
+        funcs = (random.uniform, random.normal,
+                 random.beta, random.gamma,
+                 random.f, random.noncentral_chisquare,
+                 random.vonmises, random.laplace,
+                 random.gumbel, random.logistic,
+                 random.lognormal, random.wald,
+                 random.binomial, random.negative_binomial)
+
+        probfuncs = (random.binomial, random.negative_binomial)
+
+        for func in funcs:
+            if func in probfuncs:  # p <= 1
+                argTwo = np.array([0.5])
+
+            else:
+                argTwo = self.argTwo
+
+            out = func(self.argOne, argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, argTwo[0])
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_integers(self, endpoint):
+        itype = [np.bool_, np.int8, np.uint8, np.int16, np.uint16,
+                 np.int32, np.uint32, np.int64, np.uint64]
+        func = random.integers
+        high = np.array([1])
+        low = np.array([0])
+
+        for dt in itype:
+            out = func(low, high, endpoint=endpoint, dtype=dt)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(low[0], high, endpoint=endpoint, dtype=dt)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(low, high[0], endpoint=endpoint, dtype=dt)
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_three_arg_funcs(self):
+        funcs = [random.noncentral_f, random.triangular,
+                 random.hypergeometric]
+
+        for func in funcs:
+            out = func(self.argOne, self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, self.argTwo[0], self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+
+@pytest.mark.parametrize("config", JUMP_TEST_DATA)
+def test_jumped(config):
+    # Each config contains the initial seed, a number of raw steps
+    # the md5 hashes of the initial and the final states' keys and
+    # the position of of the initial and the final state.
+    # These were produced using the original C implementation.
+    seed = config["seed"]
+    steps = config["steps"]
+
+    mt19937 = MT19937(seed)
+    # Burn step
+    mt19937.random_raw(steps)
+    key = mt19937.state["state"]["key"]
+    if sys.byteorder == 'big':
+        key = key.byteswap()
+    md5 = hashlib.md5(key)
+    assert mt19937.state["state"]["pos"] == config["initial"]["pos"]
+    assert md5.hexdigest() == config["initial"]["key_md5"]
+
+    jumped = mt19937.jumped()
+    key = jumped.state["state"]["key"]
+    if sys.byteorder == 'big':
+        key = key.byteswap()
+    md5 = hashlib.md5(key)
+    assert jumped.state["state"]["pos"] == config["jumped"]["pos"]
+    assert md5.hexdigest() == config["jumped"]["key_md5"]
+
+
+def test_broadcast_size_error():
+    mu = np.ones(3)
+    sigma = np.ones((4, 3))
+    size = (10, 4, 2)
+    assert random.normal(mu, sigma, size=(5, 4, 3)).shape == (5, 4, 3)
+    with pytest.raises(ValueError):
+        random.normal(mu, sigma, size=size)
+    with pytest.raises(ValueError):
+        random.normal(mu, sigma, size=(1, 3))
+    with pytest.raises(ValueError):
+        random.normal(mu, sigma, size=(4, 1, 1))
+    # 1 arg
+    shape = np.ones((4, 3))
+    with pytest.raises(ValueError):
+        random.standard_gamma(shape, size=size)
+    with pytest.raises(ValueError):
+        random.standard_gamma(shape, size=(3,))
+    with pytest.raises(ValueError):
+        random.standard_gamma(shape, size=3)
+    # Check out
+    out = np.empty(size)
+    with pytest.raises(ValueError):
+        random.standard_gamma(shape, out=out)
+
+    # 2 arg
+    with pytest.raises(ValueError):
+        random.binomial(1, [0.3, 0.7], size=(2, 1))
+    with pytest.raises(ValueError):
+        random.binomial([1, 2], 0.3, size=(2, 1))
+    with pytest.raises(ValueError):
+        random.binomial([1, 2], [0.3, 0.7], size=(2, 1))
+    with pytest.raises(ValueError):
+        random.multinomial([2, 2], [.3, .7], size=(2, 1))
+
+    # 3 arg
+    a = random.chisquare(5, size=3)
+    b = random.chisquare(5, size=(4, 3))
+    c = random.chisquare(5, size=(5, 4, 3))
+    assert random.noncentral_f(a, b, c).shape == (5, 4, 3)
+    with pytest.raises(ValueError, match=r"Output size \(6, 5, 1, 1\) is"):
+        random.noncentral_f(a, b, c, size=(6, 5, 1, 1))
+
+
+def test_broadcast_size_scalar():
+    mu = np.ones(3)
+    sigma = np.ones(3)
+    random.normal(mu, sigma, size=3)
+    with pytest.raises(ValueError):
+        random.normal(mu, sigma, size=2)
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937_regressions.py b/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937_regressions.py
new file mode 100644
index 000000000..456c932d4
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_generator_mt19937_regressions.py
@@ -0,0 +1,150 @@
+from numpy.testing import (assert_, assert_array_equal)
+import numpy as np
+import pytest
+from numpy.random import Generator, MT19937
+
+mt19937 = Generator(MT19937())
+
+
+class TestRegression:
+
+    def test_VonMises_range(self):
+        # Make sure generated random variables are in [-pi, pi].
+        # Regression test for ticket #986.
+        for mu in np.linspace(-7., 7., 5):
+            r = mt19937.vonmises(mu, 1, 50)
+            assert_(np.all(r > -np.pi) and np.all(r <= np.pi))
+
+    def test_hypergeometric_range(self):
+        # Test for ticket #921
+        assert_(np.all(mt19937.hypergeometric(3, 18, 11, size=10) < 4))
+        assert_(np.all(mt19937.hypergeometric(18, 3, 11, size=10) > 0))
+
+        # Test for ticket #5623
+        args = (2**20 - 2, 2**20 - 2, 2**20 - 2)  # Check for 32-bit systems
+        assert_(mt19937.hypergeometric(*args) > 0)
+
+    def test_logseries_convergence(self):
+        # Test for ticket #923
+        N = 1000
+        mt19937 = Generator(MT19937(0))
+        rvsn = mt19937.logseries(0.8, size=N)
+        # these two frequency counts should be close to theoretical
+        # numbers with this large sample
+        # theoretical large N result is 0.49706795
+        freq = np.sum(rvsn == 1) / float(N)
+        msg = "Frequency was %f, should be > 0.45" % freq
+        assert_(freq > 0.45, msg)
+        # theoretical large N result is 0.19882718
+        freq = np.sum(rvsn == 2) / float(N)
+        msg = "Frequency was %f, should be < 0.23" % freq
+        assert_(freq < 0.23, msg)
+
+    def test_shuffle_mixed_dimension(self):
+        # Test for trac ticket #2074
+        for t in [[1, 2, 3, None],
+                  [(1, 1), (2, 2), (3, 3), None],
+                  [1, (2, 2), (3, 3), None],
+                  [(1, 1), 2, 3, None]]:
+            mt19937 = Generator(MT19937(12345))
+            shuffled = np.array(t, dtype=object)
+            mt19937.shuffle(shuffled)
+            expected = np.array([t[2], t[0], t[3], t[1]], dtype=object)
+            assert_array_equal(np.array(shuffled, dtype=object), expected)
+
+    def test_call_within_randomstate(self):
+        # Check that custom BitGenerator does not call into global state
+        res = np.array([1, 8, 0, 1, 5, 3, 3, 8, 1, 4])
+        for i in range(3):
+            mt19937 = Generator(MT19937(i))
+            m = Generator(MT19937(4321))
+            # If m.state is not honored, the result will change
+            assert_array_equal(m.choice(10, size=10, p=np.ones(10)/10.), res)
+
+    def test_multivariate_normal_size_types(self):
+        # Test for multivariate_normal issue with 'size' argument.
+        # Check that the multivariate_normal size argument can be a
+        # numpy integer.
+        mt19937.multivariate_normal([0], [[0]], size=1)
+        mt19937.multivariate_normal([0], [[0]], size=np.int_(1))
+        mt19937.multivariate_normal([0], [[0]], size=np.int64(1))
+
+    def test_beta_small_parameters(self):
+        # Test that beta with small a and b parameters does not produce
+        # NaNs due to roundoff errors causing 0 / 0, gh-5851
+        mt19937 = Generator(MT19937(1234567890))
+        x = mt19937.beta(0.0001, 0.0001, size=100)
+        assert_(not np.any(np.isnan(x)), 'Nans in mt19937.beta')
+
+    def test_choice_sum_of_probs_tolerance(self):
+        # The sum of probs should be 1.0 with some tolerance.
+        # For low precision dtypes the tolerance was too tight.
+        # See numpy github issue 6123.
+        mt19937 = Generator(MT19937(1234))
+        a = [1, 2, 3]
+        counts = [4, 4, 2]
+        for dt in np.float16, np.float32, np.float64:
+            probs = np.array(counts, dtype=dt) / sum(counts)
+            c = mt19937.choice(a, p=probs)
+            assert_(c in a)
+            with pytest.raises(ValueError):
+                mt19937.choice(a, p=probs*0.9)
+
+    def test_shuffle_of_array_of_different_length_strings(self):
+        # Test that permuting an array of different length strings
+        # will not cause a segfault on garbage collection
+        # Tests gh-7710
+        mt19937 = Generator(MT19937(1234))
+
+        a = np.array(['a', 'a' * 1000])
+
+        for _ in range(100):
+            mt19937.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_shuffle_of_array_of_objects(self):
+        # Test that permuting an array of objects will not cause
+        # a segfault on garbage collection.
+        # See gh-7719
+        mt19937 = Generator(MT19937(1234))
+        a = np.array([np.arange(1), np.arange(4)], dtype=object)
+
+        for _ in range(1000):
+            mt19937.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_permutation_subclass(self):
+        class N(np.ndarray):
+            pass
+
+        mt19937 = Generator(MT19937(1))
+        orig = np.arange(3).view(N)
+        perm = mt19937.permutation(orig)
+        assert_array_equal(perm, np.array([2, 0, 1]))
+        assert_array_equal(orig, np.arange(3).view(N))
+
+        class M:
+            a = np.arange(5)
+
+            def __array__(self):
+                return self.a
+
+        mt19937 = Generator(MT19937(1))
+        m = M()
+        perm = mt19937.permutation(m)
+        assert_array_equal(perm, np.array([4, 1, 3, 0, 2]))
+        assert_array_equal(m.__array__(), np.arange(5))
+
+    def test_gamma_0(self):
+        assert mt19937.standard_gamma(0.0) == 0.0
+        assert_array_equal(mt19937.standard_gamma([0.0]), 0.0)
+
+        actual = mt19937.standard_gamma([0.0], dtype='float')
+        expected = np.array([0.], dtype=np.float32)
+        assert_array_equal(actual, expected)
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_random.py b/venv/Lib/site-packages/numpy/random/tests/test_random.py
new file mode 100644
index 000000000..276b5bc81
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_random.py
@@ -0,0 +1,1685 @@
+import warnings
+
+import numpy as np
+from numpy.testing import (
+        assert_, assert_raises, assert_equal, assert_warns,
+        assert_no_warnings, assert_array_equal, assert_array_almost_equal,
+        suppress_warnings
+        )
+from numpy import random
+import sys
+
+
+class TestSeed:
+    def test_scalar(self):
+        s = np.random.RandomState(0)
+        assert_equal(s.randint(1000), 684)
+        s = np.random.RandomState(4294967295)
+        assert_equal(s.randint(1000), 419)
+
+    def test_array(self):
+        s = np.random.RandomState(range(10))
+        assert_equal(s.randint(1000), 468)
+        s = np.random.RandomState(np.arange(10))
+        assert_equal(s.randint(1000), 468)
+        s = np.random.RandomState([0])
+        assert_equal(s.randint(1000), 973)
+        s = np.random.RandomState([4294967295])
+        assert_equal(s.randint(1000), 265)
+
+    def test_invalid_scalar(self):
+        # seed must be an unsigned 32 bit integer
+        assert_raises(TypeError, np.random.RandomState, -0.5)
+        assert_raises(ValueError, np.random.RandomState, -1)
+
+    def test_invalid_array(self):
+        # seed must be an unsigned 32 bit integer
+        assert_raises(TypeError, np.random.RandomState, [-0.5])
+        assert_raises(ValueError, np.random.RandomState, [-1])
+        assert_raises(ValueError, np.random.RandomState, [4294967296])
+        assert_raises(ValueError, np.random.RandomState, [1, 2, 4294967296])
+        assert_raises(ValueError, np.random.RandomState, [1, -2, 4294967296])
+
+    def test_invalid_array_shape(self):
+        # gh-9832
+        assert_raises(ValueError, np.random.RandomState,
+                      np.array([], dtype=np.int64))
+        assert_raises(ValueError, np.random.RandomState, [[1, 2, 3]])
+        assert_raises(ValueError, np.random.RandomState, [[1, 2, 3],
+                                                          [4, 5, 6]])
+
+
+class TestBinomial:
+    def test_n_zero(self):
+        # Tests the corner case of n == 0 for the binomial distribution.
+        # binomial(0, p) should be zero for any p in [0, 1].
+        # This test addresses issue #3480.
+        zeros = np.zeros(2, dtype='int')
+        for p in [0, .5, 1]:
+            assert_(random.binomial(0, p) == 0)
+            assert_array_equal(random.binomial(zeros, p), zeros)
+
+    def test_p_is_nan(self):
+        # Issue #4571.
+        assert_raises(ValueError, random.binomial, 1, np.nan)
+
+
+class TestMultinomial:
+    def test_basic(self):
+        random.multinomial(100, [0.2, 0.8])
+
+    def test_zero_probability(self):
+        random.multinomial(100, [0.2, 0.8, 0.0, 0.0, 0.0])
+
+    def test_int_negative_interval(self):
+        assert_(-5 <= random.randint(-5, -1) < -1)
+        x = random.randint(-5, -1, 5)
+        assert_(np.all(-5 <= x))
+        assert_(np.all(x < -1))
+
+    def test_size(self):
+        # gh-3173
+        p = [0.5, 0.5]
+        assert_equal(np.random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.multinomial(1, p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(np.random.multinomial(1, p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(np.random.multinomial(1, p, np.array((2, 2))).shape,
+                     (2, 2, 2))
+
+        assert_raises(TypeError, np.random.multinomial, 1, p,
+                      float(1))
+
+    def test_multidimensional_pvals(self):
+        assert_raises(ValueError, np.random.multinomial, 10, [[0, 1]])
+        assert_raises(ValueError, np.random.multinomial, 10, [[0], [1]])
+        assert_raises(ValueError, np.random.multinomial, 10, [[[0], [1]], [[1], [0]]])
+        assert_raises(ValueError, np.random.multinomial, 10, np.array([[0, 1], [1, 0]]))
+
+
+class TestSetState:
+    def setup(self):
+        self.seed = 1234567890
+        self.prng = random.RandomState(self.seed)
+        self.state = self.prng.get_state()
+
+    def test_basic(self):
+        old = self.prng.tomaxint(16)
+        self.prng.set_state(self.state)
+        new = self.prng.tomaxint(16)
+        assert_(np.all(old == new))
+
+    def test_gaussian_reset(self):
+        # Make sure the cached every-other-Gaussian is reset.
+        old = self.prng.standard_normal(size=3)
+        self.prng.set_state(self.state)
+        new = self.prng.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_gaussian_reset_in_media_res(self):
+        # When the state is saved with a cached Gaussian, make sure the
+        # cached Gaussian is restored.
+
+        self.prng.standard_normal()
+        state = self.prng.get_state()
+        old = self.prng.standard_normal(size=3)
+        self.prng.set_state(state)
+        new = self.prng.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_backwards_compatibility(self):
+        # Make sure we can accept old state tuples that do not have the
+        # cached Gaussian value.
+        old_state = self.state[:-2]
+        x1 = self.prng.standard_normal(size=16)
+        self.prng.set_state(old_state)
+        x2 = self.prng.standard_normal(size=16)
+        self.prng.set_state(self.state)
+        x3 = self.prng.standard_normal(size=16)
+        assert_(np.all(x1 == x2))
+        assert_(np.all(x1 == x3))
+
+    def test_negative_binomial(self):
+        # Ensure that the negative binomial results take floating point
+        # arguments without truncation.
+        self.prng.negative_binomial(0.5, 0.5)
+
+
+class TestRandint:
+
+    rfunc = np.random.randint
+
+    # valid integer/boolean types
+    itype = [np.bool_, np.int8, np.uint8, np.int16, np.uint16,
+             np.int32, np.uint32, np.int64, np.uint64]
+
+    def test_unsupported_type(self):
+        assert_raises(TypeError, self.rfunc, 1, dtype=float)
+
+    def test_bounds_checking(self):
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+            assert_raises(ValueError, self.rfunc, lbnd - 1, ubnd, dtype=dt)
+            assert_raises(ValueError, self.rfunc, lbnd, ubnd + 1, dtype=dt)
+            assert_raises(ValueError, self.rfunc, ubnd, lbnd, dtype=dt)
+            assert_raises(ValueError, self.rfunc, 1, 0, dtype=dt)
+
+    def test_rng_zero_and_extremes(self):
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            tgt = ubnd - 1
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+            tgt = lbnd
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+            tgt = (lbnd + ubnd)//2
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+    def test_full_range(self):
+        # Test for ticket #1690
+
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            try:
+                self.rfunc(lbnd, ubnd, dtype=dt)
+            except Exception as e:
+                raise AssertionError("No error should have been raised, "
+                                     "but one was with the following "
+                                     "message:\n\n%s" % str(e))
+
+    def test_in_bounds_fuzz(self):
+        # Don't use fixed seed
+        np.random.seed()
+
+        for dt in self.itype[1:]:
+            for ubnd in [4, 8, 16]:
+                vals = self.rfunc(2, ubnd, size=2**16, dtype=dt)
+                assert_(vals.max() < ubnd)
+                assert_(vals.min() >= 2)
+
+        vals = self.rfunc(0, 2, size=2**16, dtype=np.bool_)
+
+        assert_(vals.max() < 2)
+        assert_(vals.min() >= 0)
+
+    def test_repeatability(self):
+        import hashlib
+        # We use a md5 hash of generated sequences of 1000 samples
+        # in the range [0, 6) for all but bool, where the range
+        # is [0, 2). Hashes are for little endian numbers.
+        tgt = {'bool': '7dd3170d7aa461d201a65f8bcf3944b0',
+               'int16': '1b7741b80964bb190c50d541dca1cac1',
+               'int32': '4dc9fcc2b395577ebb51793e58ed1a05',
+               'int64': '17db902806f448331b5a758d7d2ee672',
+               'int8': '27dd30c4e08a797063dffac2490b0be6',
+               'uint16': '1b7741b80964bb190c50d541dca1cac1',
+               'uint32': '4dc9fcc2b395577ebb51793e58ed1a05',
+               'uint64': '17db902806f448331b5a758d7d2ee672',
+               'uint8': '27dd30c4e08a797063dffac2490b0be6'}
+
+        for dt in self.itype[1:]:
+            np.random.seed(1234)
+
+            # view as little endian for hash
+            if sys.byteorder == 'little':
+                val = self.rfunc(0, 6, size=1000, dtype=dt)
+            else:
+                val = self.rfunc(0, 6, size=1000, dtype=dt).byteswap()
+
+            res = hashlib.md5(val.view(np.int8)).hexdigest()
+            assert_(tgt[np.dtype(dt).name] == res)
+
+        # bools do not depend on endianness
+        np.random.seed(1234)
+        val = self.rfunc(0, 2, size=1000, dtype=bool).view(np.int8)
+        res = hashlib.md5(val).hexdigest()
+        assert_(tgt[np.dtype(bool).name] == res)
+
+    def test_int64_uint64_corner_case(self):
+        # When stored in Numpy arrays, `lbnd` is casted
+        # as np.int64, and `ubnd` is casted as np.uint64.
+        # Checking whether `lbnd` >= `ubnd` used to be
+        # done solely via direct comparison, which is incorrect
+        # because when Numpy tries to compare both numbers,
+        # it casts both to np.float64 because there is
+        # no integer superset of np.int64 and np.uint64. However,
+        # `ubnd` is too large to be represented in np.float64,
+        # causing it be round down to np.iinfo(np.int64).max,
+        # leading to a ValueError because `lbnd` now equals
+        # the new `ubnd`.
+
+        dt = np.int64
+        tgt = np.iinfo(np.int64).max
+        lbnd = np.int64(np.iinfo(np.int64).max)
+        ubnd = np.uint64(np.iinfo(np.int64).max + 1)
+
+        # None of these function calls should
+        # generate a ValueError now.
+        actual = np.random.randint(lbnd, ubnd, dtype=dt)
+        assert_equal(actual, tgt)
+
+    def test_respect_dtype_singleton(self):
+        # See gh-7203
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            sample = self.rfunc(lbnd, ubnd, dtype=dt)
+            assert_equal(sample.dtype, np.dtype(dt))
+
+        for dt in (bool, int, np.compat.long):
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+
+            # gh-7284: Ensure that we get Python data types
+            sample = self.rfunc(lbnd, ubnd, dtype=dt)
+            assert_(not hasattr(sample, 'dtype'))
+            assert_equal(type(sample), dt)
+
+
+class TestRandomDist:
+    # Make sure the random distribution returns the correct value for a
+    # given seed
+
+    def setup(self):
+        self.seed = 1234567890
+
+    def test_rand(self):
+        np.random.seed(self.seed)
+        actual = np.random.rand(3, 2)
+        desired = np.array([[0.61879477158567997, 0.59162362775974664],
+                            [0.88868358904449662, 0.89165480011560816],
+                            [0.4575674820298663, 0.7781880808593471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_randn(self):
+        np.random.seed(self.seed)
+        actual = np.random.randn(3, 2)
+        desired = np.array([[1.34016345771863121, 1.73759122771936081],
+                           [1.498988344300628, -0.2286433324536169],
+                           [2.031033998682787, 2.17032494605655257]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_randint(self):
+        np.random.seed(self.seed)
+        actual = np.random.randint(-99, 99, size=(3, 2))
+        desired = np.array([[31, 3],
+                            [-52, 41],
+                            [-48, -66]])
+        assert_array_equal(actual, desired)
+
+    def test_random_integers(self):
+        np.random.seed(self.seed)
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            actual = np.random.random_integers(-99, 99, size=(3, 2))
+            assert_(len(w) == 1)
+        desired = np.array([[31, 3],
+                            [-52, 41],
+                            [-48, -66]])
+        assert_array_equal(actual, desired)
+
+    def test_random_integers_max_int(self):
+        # Tests whether random_integers can generate the
+        # maximum allowed Python int that can be converted
+        # into a C long. Previous implementations of this
+        # method have thrown an OverflowError when attempting
+        # to generate this integer.
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            actual = np.random.random_integers(np.iinfo('l').max,
+                                               np.iinfo('l').max)
+            assert_(len(w) == 1)
+
+        desired = np.iinfo('l').max
+        assert_equal(actual, desired)
+
+    def test_random_integers_deprecated(self):
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", DeprecationWarning)
+
+            # DeprecationWarning raised with high == None
+            assert_raises(DeprecationWarning,
+                          np.random.random_integers,
+                          np.iinfo('l').max)
+
+            # DeprecationWarning raised with high != None
+            assert_raises(DeprecationWarning,
+                          np.random.random_integers,
+                          np.iinfo('l').max, np.iinfo('l').max)
+
+    def test_random(self):
+        np.random.seed(self.seed)
+        actual = np.random.random((3, 2))
+        desired = np.array([[0.61879477158567997, 0.59162362775974664],
+                            [0.88868358904449662, 0.89165480011560816],
+                            [0.4575674820298663, 0.7781880808593471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_choice_uniform_replace(self):
+        np.random.seed(self.seed)
+        actual = np.random.choice(4, 4)
+        desired = np.array([2, 3, 2, 3])
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_replace(self):
+        np.random.seed(self.seed)
+        actual = np.random.choice(4, 4, p=[0.4, 0.4, 0.1, 0.1])
+        desired = np.array([1, 1, 2, 2])
+        assert_array_equal(actual, desired)
+
+    def test_choice_uniform_noreplace(self):
+        np.random.seed(self.seed)
+        actual = np.random.choice(4, 3, replace=False)
+        desired = np.array([0, 1, 3])
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_noreplace(self):
+        np.random.seed(self.seed)
+        actual = np.random.choice(4, 3, replace=False,
+                                  p=[0.1, 0.3, 0.5, 0.1])
+        desired = np.array([2, 3, 1])
+        assert_array_equal(actual, desired)
+
+    def test_choice_noninteger(self):
+        np.random.seed(self.seed)
+        actual = np.random.choice(['a', 'b', 'c', 'd'], 4)
+        desired = np.array(['c', 'd', 'c', 'd'])
+        assert_array_equal(actual, desired)
+
+    def test_choice_exceptions(self):
+        sample = np.random.choice
+        assert_raises(ValueError, sample, -1, 3)
+        assert_raises(ValueError, sample, 3., 3)
+        assert_raises(ValueError, sample, [[1, 2], [3, 4]], 3)
+        assert_raises(ValueError, sample, [], 3)
+        assert_raises(ValueError, sample, [1, 2, 3, 4], 3,
+                      p=[[0.25, 0.25], [0.25, 0.25]])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4, 0.2])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[1.1, -0.1])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4])
+        assert_raises(ValueError, sample, [1, 2, 3], 4, replace=False)
+        # gh-13087
+        assert_raises(ValueError, sample, [1, 2, 3], -2, replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1,), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1, 1), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], 2,
+                      replace=False, p=[1, 0, 0])
+
+    def test_choice_return_shape(self):
+        p = [0.1, 0.9]
+        # Check scalar
+        assert_(np.isscalar(np.random.choice(2, replace=True)))
+        assert_(np.isscalar(np.random.choice(2, replace=False)))
+        assert_(np.isscalar(np.random.choice(2, replace=True, p=p)))
+        assert_(np.isscalar(np.random.choice(2, replace=False, p=p)))
+        assert_(np.isscalar(np.random.choice([1, 2], replace=True)))
+        assert_(np.random.choice([None], replace=True) is None)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(np.random.choice(arr, replace=True) is a)
+
+        # Check 0-d array
+        s = tuple()
+        assert_(not np.isscalar(np.random.choice(2, s, replace=True)))
+        assert_(not np.isscalar(np.random.choice(2, s, replace=False)))
+        assert_(not np.isscalar(np.random.choice(2, s, replace=True, p=p)))
+        assert_(not np.isscalar(np.random.choice(2, s, replace=False, p=p)))
+        assert_(not np.isscalar(np.random.choice([1, 2], s, replace=True)))
+        assert_(np.random.choice([None], s, replace=True).ndim == 0)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(np.random.choice(arr, s, replace=True).item() is a)
+
+        # Check multi dimensional array
+        s = (2, 3)
+        p = [0.1, 0.1, 0.1, 0.1, 0.4, 0.2]
+        assert_equal(np.random.choice(6, s, replace=True).shape, s)
+        assert_equal(np.random.choice(6, s, replace=False).shape, s)
+        assert_equal(np.random.choice(6, s, replace=True, p=p).shape, s)
+        assert_equal(np.random.choice(6, s, replace=False, p=p).shape, s)
+        assert_equal(np.random.choice(np.arange(6), s, replace=True).shape, s)
+
+        # Check zero-size
+        assert_equal(np.random.randint(0, 0, size=(3, 0, 4)).shape, (3, 0, 4))
+        assert_equal(np.random.randint(0, -10, size=0).shape, (0,))
+        assert_equal(np.random.randint(10, 10, size=0).shape, (0,))
+        assert_equal(np.random.choice(0, size=0).shape, (0,))
+        assert_equal(np.random.choice([], size=(0,)).shape, (0,))
+        assert_equal(np.random.choice(['a', 'b'], size=(3, 0, 4)).shape,
+                     (3, 0, 4))
+        assert_raises(ValueError, np.random.choice, [], 10)
+
+    def test_choice_nan_probabilities(self):
+        a = np.array([42, 1, 2])
+        p = [None, None, None]
+        assert_raises(ValueError, np.random.choice, a, p=p)
+
+    def test_bytes(self):
+        np.random.seed(self.seed)
+        actual = np.random.bytes(10)
+        desired = b'\x82Ui\x9e\xff\x97+Wf\xa5'
+        assert_equal(actual, desired)
+
+    def test_shuffle(self):
+        # Test lists, arrays (of various dtypes), and multidimensional versions
+        # of both, c-contiguous or not:
+        for conv in [lambda x: np.array([]),
+                     lambda x: x,
+                     lambda x: np.asarray(x).astype(np.int8),
+                     lambda x: np.asarray(x).astype(np.float32),
+                     lambda x: np.asarray(x).astype(np.complex64),
+                     lambda x: np.asarray(x).astype(object),
+                     lambda x: [(i, i) for i in x],
+                     lambda x: np.asarray([[i, i] for i in x]),
+                     lambda x: np.vstack([x, x]).T,
+                     # gh-11442
+                     lambda x: (np.asarray([(i, i) for i in x],
+                                           [("a", int), ("b", int)])
+                                .view(np.recarray)),
+                     # gh-4270
+                     lambda x: np.asarray([(i, i) for i in x],
+                                          [("a", object), ("b", np.int32)])]:
+            np.random.seed(self.seed)
+            alist = conv([1, 2, 3, 4, 5, 6, 7, 8, 9, 0])
+            np.random.shuffle(alist)
+            actual = alist
+            desired = conv([0, 1, 9, 6, 2, 4, 5, 8, 7, 3])
+            assert_array_equal(actual, desired)
+
+    def test_shuffle_masked(self):
+        # gh-3263
+        a = np.ma.masked_values(np.reshape(range(20), (5, 4)) % 3 - 1, -1)
+        b = np.ma.masked_values(np.arange(20) % 3 - 1, -1)
+        a_orig = a.copy()
+        b_orig = b.copy()
+        for i in range(50):
+            np.random.shuffle(a)
+            assert_equal(
+                sorted(a.data[~a.mask]), sorted(a_orig.data[~a_orig.mask]))
+            np.random.shuffle(b)
+            assert_equal(
+                sorted(b.data[~b.mask]), sorted(b_orig.data[~b_orig.mask]))
+
+    def test_beta(self):
+        np.random.seed(self.seed)
+        actual = np.random.beta(.1, .9, size=(3, 2))
+        desired = np.array(
+                [[1.45341850513746058e-02, 5.31297615662868145e-04],
+                 [1.85366619058432324e-06, 4.19214516800110563e-03],
+                 [1.58405155108498093e-04, 1.26252891949397652e-04]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_binomial(self):
+        np.random.seed(self.seed)
+        actual = np.random.binomial(100, .456, size=(3, 2))
+        desired = np.array([[37, 43],
+                            [42, 48],
+                            [46, 45]])
+        assert_array_equal(actual, desired)
+
+    def test_chisquare(self):
+        np.random.seed(self.seed)
+        actual = np.random.chisquare(50, size=(3, 2))
+        desired = np.array([[63.87858175501090585, 68.68407748911370447],
+                            [65.77116116901505904, 47.09686762438974483],
+                            [72.3828403199695174, 74.18408615260374006]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_dirichlet(self):
+        np.random.seed(self.seed)
+        alpha = np.array([51.72840233779265162, 39.74494232180943953])
+        actual = np.random.mtrand.dirichlet(alpha, size=(3, 2))
+        desired = np.array([[[0.54539444573611562, 0.45460555426388438],
+                             [0.62345816822039413, 0.37654183177960598]],
+                            [[0.55206000085785778, 0.44793999914214233],
+                             [0.58964023305154301, 0.41035976694845688]],
+                            [[0.59266909280647828, 0.40733090719352177],
+                             [0.56974431743975207, 0.43025568256024799]]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_dirichlet_size(self):
+        # gh-3173
+        p = np.array([51.72840233779265162, 39.74494232180943953])
+        assert_equal(np.random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(np.random.dirichlet(p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(np.random.dirichlet(p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(np.random.dirichlet(p, np.array((2, 2))).shape, (2, 2, 2))
+
+        assert_raises(TypeError, np.random.dirichlet, p, float(1))
+
+    def test_dirichlet_bad_alpha(self):
+        # gh-2089
+        alpha = np.array([5.4e-01, -1.0e-16])
+        assert_raises(ValueError, np.random.mtrand.dirichlet, alpha)
+
+        # gh-15876
+        assert_raises(ValueError, random.dirichlet, [[5, 1]])
+        assert_raises(ValueError, random.dirichlet, [[5], [1]])
+        assert_raises(ValueError, random.dirichlet, [[[5], [1]], [[1], [5]]])
+        assert_raises(ValueError, random.dirichlet, np.array([[5, 1], [1, 5]]))
+
+    def test_exponential(self):
+        np.random.seed(self.seed)
+        actual = np.random.exponential(1.1234, size=(3, 2))
+        desired = np.array([[1.08342649775011624, 1.00607889924557314],
+                            [2.46628830085216721, 2.49668106809923884],
+                            [0.68717433461363442, 1.69175666993575979]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_exponential_0(self):
+        assert_equal(np.random.exponential(scale=0), 0)
+        assert_raises(ValueError, np.random.exponential, scale=-0.)
+
+    def test_f(self):
+        np.random.seed(self.seed)
+        actual = np.random.f(12, 77, size=(3, 2))
+        desired = np.array([[1.21975394418575878, 1.75135759791559775],
+                            [1.44803115017146489, 1.22108959480396262],
+                            [1.02176975757740629, 1.34431827623300415]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gamma(self):
+        np.random.seed(self.seed)
+        actual = np.random.gamma(5, 3, size=(3, 2))
+        desired = np.array([[24.60509188649287182, 28.54993563207210627],
+                            [26.13476110204064184, 12.56988482927716078],
+                            [31.71863275789960568, 33.30143302795922011]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_gamma_0(self):
+        assert_equal(np.random.gamma(shape=0, scale=0), 0)
+        assert_raises(ValueError, np.random.gamma, shape=-0., scale=-0.)
+
+    def test_geometric(self):
+        np.random.seed(self.seed)
+        actual = np.random.geometric(.123456789, size=(3, 2))
+        desired = np.array([[8, 7],
+                            [17, 17],
+                            [5, 12]])
+        assert_array_equal(actual, desired)
+
+    def test_gumbel(self):
+        np.random.seed(self.seed)
+        actual = np.random.gumbel(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[0.19591898743416816, 0.34405539668096674],
+                            [-1.4492522252274278, -1.47374816298446865],
+                            [1.10651090478803416, -0.69535848626236174]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gumbel_0(self):
+        assert_equal(np.random.gumbel(scale=0), 0)
+        assert_raises(ValueError, np.random.gumbel, scale=-0.)
+
+    def test_hypergeometric(self):
+        np.random.seed(self.seed)
+        actual = np.random.hypergeometric(10, 5, 14, size=(3, 2))
+        desired = np.array([[10, 10],
+                            [10, 10],
+                            [9, 9]])
+        assert_array_equal(actual, desired)
+
+        # Test nbad = 0
+        actual = np.random.hypergeometric(5, 0, 3, size=4)
+        desired = np.array([3, 3, 3, 3])
+        assert_array_equal(actual, desired)
+
+        actual = np.random.hypergeometric(15, 0, 12, size=4)
+        desired = np.array([12, 12, 12, 12])
+        assert_array_equal(actual, desired)
+
+        # Test ngood = 0
+        actual = np.random.hypergeometric(0, 5, 3, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+        actual = np.random.hypergeometric(0, 15, 12, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+    def test_laplace(self):
+        np.random.seed(self.seed)
+        actual = np.random.laplace(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[0.66599721112760157, 0.52829452552221945],
+                            [3.12791959514407125, 3.18202813572992005],
+                            [-0.05391065675859356, 1.74901336242837324]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_laplace_0(self):
+        assert_equal(np.random.laplace(scale=0), 0)
+        assert_raises(ValueError, np.random.laplace, scale=-0.)
+
+    def test_logistic(self):
+        np.random.seed(self.seed)
+        actual = np.random.logistic(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[1.09232835305011444, 0.8648196662399954],
+                            [4.27818590694950185, 4.33897006346929714],
+                            [-0.21682183359214885, 2.63373365386060332]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_lognormal(self):
+        np.random.seed(self.seed)
+        actual = np.random.lognormal(mean=.123456789, sigma=2.0, size=(3, 2))
+        desired = np.array([[16.50698631688883822, 36.54846706092654784],
+                            [22.67886599981281748, 0.71617561058995771],
+                            [65.72798501792723869, 86.84341601437161273]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_lognormal_0(self):
+        assert_equal(np.random.lognormal(sigma=0), 1)
+        assert_raises(ValueError, np.random.lognormal, sigma=-0.)
+
+    def test_logseries(self):
+        np.random.seed(self.seed)
+        actual = np.random.logseries(p=.923456789, size=(3, 2))
+        desired = np.array([[2, 2],
+                            [6, 17],
+                            [3, 6]])
+        assert_array_equal(actual, desired)
+
+    def test_multinomial(self):
+        np.random.seed(self.seed)
+        actual = np.random.multinomial(20, [1/6.]*6, size=(3, 2))
+        desired = np.array([[[4, 3, 5, 4, 2, 2],
+                             [5, 2, 8, 2, 2, 1]],
+                            [[3, 4, 3, 6, 0, 4],
+                             [2, 1, 4, 3, 6, 4]],
+                            [[4, 4, 2, 5, 2, 3],
+                             [4, 3, 4, 2, 3, 4]]])
+        assert_array_equal(actual, desired)
+
+    def test_multivariate_normal(self):
+        np.random.seed(self.seed)
+        mean = (.123456789, 10)
+        cov = [[1, 0], [0, 1]]
+        size = (3, 2)
+        actual = np.random.multivariate_normal(mean, cov, size)
+        desired = np.array([[[1.463620246718631, 11.73759122771936],
+                             [1.622445133300628, 9.771356667546383]],
+                            [[2.154490787682787, 12.170324946056553],
+                             [1.719909438201865, 9.230548443648306]],
+                            [[0.689515026297799, 9.880729819607714],
+                             [-0.023054015651998, 9.201096623542879]]])
+
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        # Check for default size, was raising deprecation warning
+        actual = np.random.multivariate_normal(mean, cov)
+        desired = np.array([0.895289569463708, 9.17180864067987])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        # Check that non positive-semidefinite covariance warns with
+        # RuntimeWarning
+        mean = [0, 0]
+        cov = [[1, 2], [2, 1]]
+        assert_warns(RuntimeWarning, np.random.multivariate_normal, mean, cov)
+
+        # and that it doesn't warn with RuntimeWarning check_valid='ignore'
+        assert_no_warnings(np.random.multivariate_normal, mean, cov,
+                           check_valid='ignore')
+
+        # and that it raises with RuntimeWarning check_valid='raises'
+        assert_raises(ValueError, np.random.multivariate_normal, mean, cov,
+                      check_valid='raise')
+
+        cov = np.array([[1, 0.1], [0.1, 1]], dtype=np.float32)
+        with suppress_warnings() as sup:
+            np.random.multivariate_normal(mean, cov)
+            w = sup.record(RuntimeWarning)
+            assert len(w) == 0
+
+    def test_negative_binomial(self):
+        np.random.seed(self.seed)
+        actual = np.random.negative_binomial(n=100, p=.12345, size=(3, 2))
+        desired = np.array([[848, 841],
+                            [892, 611],
+                            [779, 647]])
+        assert_array_equal(actual, desired)
+
+    def test_noncentral_chisquare(self):
+        np.random.seed(self.seed)
+        actual = np.random.noncentral_chisquare(df=5, nonc=5, size=(3, 2))
+        desired = np.array([[23.91905354498517511, 13.35324692733826346],
+                            [31.22452661329736401, 16.60047399466177254],
+                            [5.03461598262724586, 17.94973089023519464]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        actual = np.random.noncentral_chisquare(df=.5, nonc=.2, size=(3, 2))
+        desired = np.array([[1.47145377828516666,  0.15052899268012659],
+                            [0.00943803056963588,  1.02647251615666169],
+                            [0.332334982684171,  0.15451287602753125]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        np.random.seed(self.seed)
+        actual = np.random.noncentral_chisquare(df=5, nonc=0, size=(3, 2))
+        desired = np.array([[9.597154162763948, 11.725484450296079],
+                            [10.413711048138335, 3.694475922923986],
+                            [13.484222138963087, 14.377255424602957]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_noncentral_f(self):
+        np.random.seed(self.seed)
+        actual = np.random.noncentral_f(dfnum=5, dfden=2, nonc=1,
+                                        size=(3, 2))
+        desired = np.array([[1.40598099674926669, 0.34207973179285761],
+                            [3.57715069265772545, 7.92632662577829805],
+                            [0.43741599463544162, 1.1774208752428319]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_normal(self):
+        np.random.seed(self.seed)
+        actual = np.random.normal(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[2.80378370443726244, 3.59863924443872163],
+                            [3.121433477601256, -0.33382987590723379],
+                            [4.18552478636557357, 4.46410668111310471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_normal_0(self):
+        assert_equal(np.random.normal(scale=0), 0)
+        assert_raises(ValueError, np.random.normal, scale=-0.)
+
+    def test_pareto(self):
+        np.random.seed(self.seed)
+        actual = np.random.pareto(a=.123456789, size=(3, 2))
+        desired = np.array(
+                [[2.46852460439034849e+03, 1.41286880810518346e+03],
+                 [5.28287797029485181e+07, 6.57720981047328785e+07],
+                 [1.40840323350391515e+02, 1.98390255135251704e+05]])
+        # For some reason on 32-bit x86 Ubuntu 12.10 the [1, 0] entry in this
+        # matrix differs by 24 nulps. Discussion:
+        #   https://mail.python.org/pipermail/numpy-discussion/2012-September/063801.html
+        # Consensus is that this is probably some gcc quirk that affects
+        # rounding but not in any important way, so we just use a looser
+        # tolerance on this test:
+        np.testing.assert_array_almost_equal_nulp(actual, desired, nulp=30)
+
+    def test_poisson(self):
+        np.random.seed(self.seed)
+        actual = np.random.poisson(lam=.123456789, size=(3, 2))
+        desired = np.array([[0, 0],
+                            [1, 0],
+                            [0, 0]])
+        assert_array_equal(actual, desired)
+
+    def test_poisson_exceptions(self):
+        lambig = np.iinfo('l').max
+        lamneg = -1
+        assert_raises(ValueError, np.random.poisson, lamneg)
+        assert_raises(ValueError, np.random.poisson, [lamneg]*10)
+        assert_raises(ValueError, np.random.poisson, lambig)
+        assert_raises(ValueError, np.random.poisson, [lambig]*10)
+
+    def test_power(self):
+        np.random.seed(self.seed)
+        actual = np.random.power(a=.123456789, size=(3, 2))
+        desired = np.array([[0.02048932883240791, 0.01424192241128213],
+                            [0.38446073748535298, 0.39499689943484395],
+                            [0.00177699707563439, 0.13115505880863756]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_rayleigh(self):
+        np.random.seed(self.seed)
+        actual = np.random.rayleigh(scale=10, size=(3, 2))
+        desired = np.array([[13.8882496494248393, 13.383318339044731],
+                            [20.95413364294492098, 21.08285015800712614],
+                            [11.06066537006854311, 17.35468505778271009]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_rayleigh_0(self):
+        assert_equal(np.random.rayleigh(scale=0), 0)
+        assert_raises(ValueError, np.random.rayleigh, scale=-0.)
+
+    def test_standard_cauchy(self):
+        np.random.seed(self.seed)
+        actual = np.random.standard_cauchy(size=(3, 2))
+        desired = np.array([[0.77127660196445336, -6.55601161955910605],
+                            [0.93582023391158309, -2.07479293013759447],
+                            [-4.74601644297011926, 0.18338989290760804]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_exponential(self):
+        np.random.seed(self.seed)
+        actual = np.random.standard_exponential(size=(3, 2))
+        desired = np.array([[0.96441739162374596, 0.89556604882105506],
+                            [2.1953785836319808, 2.22243285392490542],
+                            [0.6116915921431676, 1.50592546727413201]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_gamma(self):
+        np.random.seed(self.seed)
+        actual = np.random.standard_gamma(shape=3, size=(3, 2))
+        desired = np.array([[5.50841531318455058, 6.62953470301903103],
+                            [5.93988484943779227, 2.31044849402133989],
+                            [7.54838614231317084, 8.012756093271868]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_standard_gamma_0(self):
+        assert_equal(np.random.standard_gamma(shape=0), 0)
+        assert_raises(ValueError, np.random.standard_gamma, shape=-0.)
+
+    def test_standard_normal(self):
+        np.random.seed(self.seed)
+        actual = np.random.standard_normal(size=(3, 2))
+        desired = np.array([[1.34016345771863121, 1.73759122771936081],
+                            [1.498988344300628, -0.2286433324536169],
+                            [2.031033998682787, 2.17032494605655257]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_t(self):
+        np.random.seed(self.seed)
+        actual = np.random.standard_t(df=10, size=(3, 2))
+        desired = np.array([[0.97140611862659965, -0.08830486548450577],
+                            [1.36311143689505321, -0.55317463909867071],
+                            [-0.18473749069684214, 0.61181537341755321]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_triangular(self):
+        np.random.seed(self.seed)
+        actual = np.random.triangular(left=5.12, mode=10.23, right=20.34,
+                                      size=(3, 2))
+        desired = np.array([[12.68117178949215784, 12.4129206149193152],
+                            [16.20131377335158263, 16.25692138747600524],
+                            [11.20400690911820263, 14.4978144835829923]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_uniform(self):
+        np.random.seed(self.seed)
+        actual = np.random.uniform(low=1.23, high=10.54, size=(3, 2))
+        desired = np.array([[6.99097932346268003, 6.73801597444323974],
+                            [9.50364421400426274, 9.53130618907631089],
+                            [5.48995325769805476, 8.47493103280052118]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_uniform_range_bounds(self):
+        fmin = np.finfo('float').min
+        fmax = np.finfo('float').max
+
+        func = np.random.uniform
+        assert_raises(OverflowError, func, -np.inf, 0)
+        assert_raises(OverflowError, func,  0,      np.inf)
+        assert_raises(OverflowError, func,  fmin,   fmax)
+        assert_raises(OverflowError, func, [-np.inf], [0])
+        assert_raises(OverflowError, func, [0], [np.inf])
+
+        # (fmax / 1e17) - fmin is within range, so this should not throw
+        # account for i386 extended precision DBL_MAX / 1e17 + DBL_MAX >
+        # DBL_MAX by increasing fmin a bit
+        np.random.uniform(low=np.nextafter(fmin, 1), high=fmax / 1e17)
+
+    def test_scalar_exception_propagation(self):
+        # Tests that exceptions are correctly propagated in distributions
+        # when called with objects that throw exceptions when converted to
+        # scalars.
+        #
+        # Regression test for gh: 8865
+
+        class ThrowingFloat(np.ndarray):
+            def __float__(self):
+                raise TypeError
+
+        throwing_float = np.array(1.0).view(ThrowingFloat)
+        assert_raises(TypeError, np.random.uniform, throwing_float,
+                      throwing_float)
+
+        class ThrowingInteger(np.ndarray):
+            def __int__(self):
+                raise TypeError
+
+            __index__ = __int__
+
+        throwing_int = np.array(1).view(ThrowingInteger)
+        assert_raises(TypeError, np.random.hypergeometric, throwing_int, 1, 1)
+
+    def test_vonmises(self):
+        np.random.seed(self.seed)
+        actual = np.random.vonmises(mu=1.23, kappa=1.54, size=(3, 2))
+        desired = np.array([[2.28567572673902042, 2.89163838442285037],
+                            [0.38198375564286025, 2.57638023113890746],
+                            [1.19153771588353052, 1.83509849681825354]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_vonmises_small(self):
+        # check infinite loop, gh-4720
+        np.random.seed(self.seed)
+        r = np.random.vonmises(mu=0., kappa=1.1e-8, size=10**6)
+        np.testing.assert_(np.isfinite(r).all())
+
+    def test_wald(self):
+        np.random.seed(self.seed)
+        actual = np.random.wald(mean=1.23, scale=1.54, size=(3, 2))
+        desired = np.array([[3.82935265715889983, 5.13125249184285526],
+                            [0.35045403618358717, 1.50832396872003538],
+                            [0.24124319895843183, 0.22031101461955038]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_weibull(self):
+        np.random.seed(self.seed)
+        actual = np.random.weibull(a=1.23, size=(3, 2))
+        desired = np.array([[0.97097342648766727, 0.91422896443565516],
+                            [1.89517770034962929, 1.91414357960479564],
+                            [0.67057783752390987, 1.39494046635066793]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_weibull_0(self):
+        np.random.seed(self.seed)
+        assert_equal(np.random.weibull(a=0, size=12), np.zeros(12))
+        assert_raises(ValueError, np.random.weibull, a=-0.)
+
+    def test_zipf(self):
+        np.random.seed(self.seed)
+        actual = np.random.zipf(a=1.23, size=(3, 2))
+        desired = np.array([[66, 29],
+                            [1, 1],
+                            [3, 13]])
+        assert_array_equal(actual, desired)
+
+
+class TestBroadcast:
+    # tests that functions that broadcast behave
+    # correctly when presented with non-scalar arguments
+    def setup(self):
+        self.seed = 123456789
+
+    def setSeed(self):
+        np.random.seed(self.seed)
+
+    # TODO: Include test for randint once it can broadcast
+    # Can steal the test written in PR #6938
+
+    def test_uniform(self):
+        low = [0]
+        high = [1]
+        uniform = np.random.uniform
+        desired = np.array([0.53283302478975902,
+                            0.53413660089041659,
+                            0.50955303552646702])
+
+        self.setSeed()
+        actual = uniform(low * 3, high)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        self.setSeed()
+        actual = uniform(low, high * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_normal(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        normal = np.random.normal
+        desired = np.array([2.2129019979039612,
+                            2.1283977976520019,
+                            1.8417114045748335])
+
+        self.setSeed()
+        actual = normal(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, normal, loc * 3, bad_scale)
+
+        self.setSeed()
+        actual = normal(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, normal, loc, bad_scale * 3)
+
+    def test_beta(self):
+        a = [1]
+        b = [2]
+        bad_a = [-1]
+        bad_b = [-2]
+        beta = np.random.beta
+        desired = np.array([0.19843558305989056,
+                            0.075230336409423643,
+                            0.24976865978980844])
+
+        self.setSeed()
+        actual = beta(a * 3, b)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, beta, bad_a * 3, b)
+        assert_raises(ValueError, beta, a * 3, bad_b)
+
+        self.setSeed()
+        actual = beta(a, b * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, beta, bad_a, b * 3)
+        assert_raises(ValueError, beta, a, bad_b * 3)
+
+    def test_exponential(self):
+        scale = [1]
+        bad_scale = [-1]
+        exponential = np.random.exponential
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.setSeed()
+        actual = exponential(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, exponential, bad_scale * 3)
+
+    def test_standard_gamma(self):
+        shape = [1]
+        bad_shape = [-1]
+        std_gamma = np.random.standard_gamma
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.setSeed()
+        actual = std_gamma(shape * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, std_gamma, bad_shape * 3)
+
+    def test_gamma(self):
+        shape = [1]
+        scale = [2]
+        bad_shape = [-1]
+        bad_scale = [-2]
+        gamma = np.random.gamma
+        desired = np.array([1.5221370731769048,
+                            1.5277256455738331,
+                            1.4248762625178359])
+
+        self.setSeed()
+        actual = gamma(shape * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape * 3, scale)
+        assert_raises(ValueError, gamma, shape * 3, bad_scale)
+
+        self.setSeed()
+        actual = gamma(shape, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape, scale * 3)
+        assert_raises(ValueError, gamma, shape, bad_scale * 3)
+
+    def test_f(self):
+        dfnum = [1]
+        dfden = [2]
+        bad_dfnum = [-1]
+        bad_dfden = [-2]
+        f = np.random.f
+        desired = np.array([0.80038951638264799,
+                            0.86768719635363512,
+                            2.7251095168386801])
+
+        self.setSeed()
+        actual = f(dfnum * 3, dfden)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum * 3, dfden)
+        assert_raises(ValueError, f, dfnum * 3, bad_dfden)
+
+        self.setSeed()
+        actual = f(dfnum, dfden * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum, dfden * 3)
+        assert_raises(ValueError, f, dfnum, bad_dfden * 3)
+
+    def test_noncentral_f(self):
+        dfnum = [2]
+        dfden = [3]
+        nonc = [4]
+        bad_dfnum = [0]
+        bad_dfden = [-1]
+        bad_nonc = [-2]
+        nonc_f = np.random.noncentral_f
+        desired = np.array([9.1393943263705211,
+                            13.025456344595602,
+                            8.8018098359100545])
+
+        self.setSeed()
+        actual = nonc_f(dfnum * 3, dfden, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum * 3, dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, bad_dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, dfden, bad_nonc)
+
+        self.setSeed()
+        actual = nonc_f(dfnum, dfden * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, dfden * 3, bad_nonc)
+
+        self.setSeed()
+        actual = nonc_f(dfnum, dfden, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, dfden, bad_nonc * 3)
+
+    def test_noncentral_f_small_df(self):
+        self.setSeed()
+        desired = np.array([6.869638627492048, 0.785880199263955])
+        actual = np.random.noncentral_f(0.9, 0.9, 2, size=2)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_chisquare(self):
+        df = [1]
+        bad_df = [-1]
+        chisquare = np.random.chisquare
+        desired = np.array([0.57022801133088286,
+                            0.51947702108840776,
+                            0.1320969254923558])
+
+        self.setSeed()
+        actual = chisquare(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, chisquare, bad_df * 3)
+
+    def test_noncentral_chisquare(self):
+        df = [1]
+        nonc = [2]
+        bad_df = [-1]
+        bad_nonc = [-2]
+        nonc_chi = np.random.noncentral_chisquare
+        desired = np.array([9.0015599467913763,
+                            4.5804135049718742,
+                            6.0872302432834564])
+
+        self.setSeed()
+        actual = nonc_chi(df * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df * 3, nonc)
+        assert_raises(ValueError, nonc_chi, df * 3, bad_nonc)
+
+        self.setSeed()
+        actual = nonc_chi(df, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df, nonc * 3)
+        assert_raises(ValueError, nonc_chi, df, bad_nonc * 3)
+
+    def test_standard_t(self):
+        df = [1]
+        bad_df = [-1]
+        t = np.random.standard_t
+        desired = np.array([3.0702872575217643,
+                            5.8560725167361607,
+                            1.0274791436474273])
+
+        self.setSeed()
+        actual = t(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, t, bad_df * 3)
+
+    def test_vonmises(self):
+        mu = [2]
+        kappa = [1]
+        bad_kappa = [-1]
+        vonmises = np.random.vonmises
+        desired = np.array([2.9883443664201312,
+                            -2.7064099483995943,
+                            -1.8672476700665914])
+
+        self.setSeed()
+        actual = vonmises(mu * 3, kappa)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, vonmises, mu * 3, bad_kappa)
+
+        self.setSeed()
+        actual = vonmises(mu, kappa * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, vonmises, mu, bad_kappa * 3)
+
+    def test_pareto(self):
+        a = [1]
+        bad_a = [-1]
+        pareto = np.random.pareto
+        desired = np.array([1.1405622680198362,
+                            1.1465519762044529,
+                            1.0389564467453547])
+
+        self.setSeed()
+        actual = pareto(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, pareto, bad_a * 3)
+
+    def test_weibull(self):
+        a = [1]
+        bad_a = [-1]
+        weibull = np.random.weibull
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.setSeed()
+        actual = weibull(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, weibull, bad_a * 3)
+
+    def test_power(self):
+        a = [1]
+        bad_a = [-1]
+        power = np.random.power
+        desired = np.array([0.53283302478975902,
+                            0.53413660089041659,
+                            0.50955303552646702])
+
+        self.setSeed()
+        actual = power(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, power, bad_a * 3)
+
+    def test_laplace(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        laplace = np.random.laplace
+        desired = np.array([0.067921356028507157,
+                            0.070715642226971326,
+                            0.019290950698972624])
+
+        self.setSeed()
+        actual = laplace(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc * 3, bad_scale)
+
+        self.setSeed()
+        actual = laplace(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc, bad_scale * 3)
+
+    def test_gumbel(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        gumbel = np.random.gumbel
+        desired = np.array([0.2730318639556768,
+                            0.26936705726291116,
+                            0.33906220393037939])
+
+        self.setSeed()
+        actual = gumbel(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc * 3, bad_scale)
+
+        self.setSeed()
+        actual = gumbel(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc, bad_scale * 3)
+
+    def test_logistic(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        logistic = np.random.logistic
+        desired = np.array([0.13152135837586171,
+                            0.13675915696285773,
+                            0.038216792802833396])
+
+        self.setSeed()
+        actual = logistic(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, logistic, loc * 3, bad_scale)
+
+        self.setSeed()
+        actual = logistic(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, logistic, loc, bad_scale * 3)
+
+    def test_lognormal(self):
+        mean = [0]
+        sigma = [1]
+        bad_sigma = [-1]
+        lognormal = np.random.lognormal
+        desired = np.array([9.1422086044848427,
+                            8.4013952870126261,
+                            6.3073234116578671])
+
+        self.setSeed()
+        actual = lognormal(mean * 3, sigma)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, lognormal, mean * 3, bad_sigma)
+
+        self.setSeed()
+        actual = lognormal(mean, sigma * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, lognormal, mean, bad_sigma * 3)
+
+    def test_rayleigh(self):
+        scale = [1]
+        bad_scale = [-1]
+        rayleigh = np.random.rayleigh
+        desired = np.array([1.2337491937897689,
+                            1.2360119924878694,
+                            1.1936818095781789])
+
+        self.setSeed()
+        actual = rayleigh(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, rayleigh, bad_scale * 3)
+
+    def test_wald(self):
+        mean = [0.5]
+        scale = [1]
+        bad_mean = [0]
+        bad_scale = [-2]
+        wald = np.random.wald
+        desired = np.array([0.11873681120271318,
+                            0.12450084820795027,
+                            0.9096122728408238])
+
+        self.setSeed()
+        actual = wald(mean * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, wald, bad_mean * 3, scale)
+        assert_raises(ValueError, wald, mean * 3, bad_scale)
+
+        self.setSeed()
+        actual = wald(mean, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, wald, bad_mean, scale * 3)
+        assert_raises(ValueError, wald, mean, bad_scale * 3)
+        assert_raises(ValueError, wald, 0.0, 1)
+        assert_raises(ValueError, wald, 0.5, 0.0)
+
+    def test_triangular(self):
+        left = [1]
+        right = [3]
+        mode = [2]
+        bad_left_one = [3]
+        bad_mode_one = [4]
+        bad_left_two, bad_mode_two = right * 2
+        triangular = np.random.triangular
+        desired = np.array([2.03339048710429,
+                            2.0347400359389356,
+                            2.0095991069536208])
+
+        self.setSeed()
+        actual = triangular(left * 3, mode, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one * 3, mode, right)
+        assert_raises(ValueError, triangular, left * 3, bad_mode_one, right)
+        assert_raises(ValueError, triangular, bad_left_two * 3, bad_mode_two,
+                      right)
+
+        self.setSeed()
+        actual = triangular(left, mode * 3, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode * 3, right)
+        assert_raises(ValueError, triangular, left, bad_mode_one * 3, right)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two * 3,
+                      right)
+
+        self.setSeed()
+        actual = triangular(left, mode, right * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode, right * 3)
+        assert_raises(ValueError, triangular, left, bad_mode_one, right * 3)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two,
+                      right * 3)
+
+    def test_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        binom = np.random.binomial
+        desired = np.array([1, 1, 1])
+
+        self.setSeed()
+        actual = binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n * 3, p)
+        assert_raises(ValueError, binom, n * 3, bad_p_one)
+        assert_raises(ValueError, binom, n * 3, bad_p_two)
+
+        self.setSeed()
+        actual = binom(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n, p * 3)
+        assert_raises(ValueError, binom, n, bad_p_one * 3)
+        assert_raises(ValueError, binom, n, bad_p_two * 3)
+
+    def test_negative_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        neg_binom = np.random.negative_binomial
+        desired = np.array([1, 0, 1])
+
+        self.setSeed()
+        actual = neg_binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n * 3, p)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_one)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_two)
+
+        self.setSeed()
+        actual = neg_binom(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n, p * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_one * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_two * 3)
+
+    def test_poisson(self):
+        max_lam = np.random.RandomState()._poisson_lam_max
+
+        lam = [1]
+        bad_lam_one = [-1]
+        bad_lam_two = [max_lam * 2]
+        poisson = np.random.poisson
+        desired = np.array([1, 1, 0])
+
+        self.setSeed()
+        actual = poisson(lam * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, poisson, bad_lam_one * 3)
+        assert_raises(ValueError, poisson, bad_lam_two * 3)
+
+    def test_zipf(self):
+        a = [2]
+        bad_a = [0]
+        zipf = np.random.zipf
+        desired = np.array([2, 2, 1])
+
+        self.setSeed()
+        actual = zipf(a * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, zipf, bad_a * 3)
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, zipf, np.nan)
+            assert_raises(ValueError, zipf, [0, 0, np.nan])
+
+    def test_geometric(self):
+        p = [0.5]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        geom = np.random.geometric
+        desired = np.array([2, 2, 2])
+
+        self.setSeed()
+        actual = geom(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, geom, bad_p_one * 3)
+        assert_raises(ValueError, geom, bad_p_two * 3)
+
+    def test_hypergeometric(self):
+        ngood = [1]
+        nbad = [2]
+        nsample = [2]
+        bad_ngood = [-1]
+        bad_nbad = [-2]
+        bad_nsample_one = [0]
+        bad_nsample_two = [4]
+        hypergeom = np.random.hypergeometric
+        desired = np.array([1, 1, 1])
+
+        self.setSeed()
+        actual = hypergeom(ngood * 3, nbad, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood * 3, nbad, nsample)
+        assert_raises(ValueError, hypergeom, ngood * 3, bad_nbad, nsample)
+        assert_raises(ValueError, hypergeom, ngood * 3, nbad, bad_nsample_one)
+        assert_raises(ValueError, hypergeom, ngood * 3, nbad, bad_nsample_two)
+
+        self.setSeed()
+        actual = hypergeom(ngood, nbad * 3, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood, nbad * 3, nsample)
+        assert_raises(ValueError, hypergeom, ngood, bad_nbad * 3, nsample)
+        assert_raises(ValueError, hypergeom, ngood, nbad * 3, bad_nsample_one)
+        assert_raises(ValueError, hypergeom, ngood, nbad * 3, bad_nsample_two)
+
+        self.setSeed()
+        actual = hypergeom(ngood, nbad, nsample * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood, nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, bad_nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_one * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_two * 3)
+
+    def test_logseries(self):
+        p = [0.5]
+        bad_p_one = [2]
+        bad_p_two = [-1]
+        logseries = np.random.logseries
+        desired = np.array([1, 1, 1])
+
+        self.setSeed()
+        actual = logseries(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, logseries, bad_p_one * 3)
+        assert_raises(ValueError, logseries, bad_p_two * 3)
+
+
+class TestThread:
+    # make sure each state produces the same sequence even in threads
+    def setup(self):
+        self.seeds = range(4)
+
+    def check_function(self, function, sz):
+        from threading import Thread
+
+        out1 = np.empty((len(self.seeds),) + sz)
+        out2 = np.empty((len(self.seeds),) + sz)
+
+        # threaded generation
+        t = [Thread(target=function, args=(np.random.RandomState(s), o))
+             for s, o in zip(self.seeds, out1)]
+        [x.start() for x in t]
+        [x.join() for x in t]
+
+        # the same serial
+        for s, o in zip(self.seeds, out2):
+            function(np.random.RandomState(s), o)
+
+        # these platforms change x87 fpu precision mode in threads
+        if np.intp().dtype.itemsize == 4 and sys.platform == "win32":
+            assert_array_almost_equal(out1, out2)
+        else:
+            assert_array_equal(out1, out2)
+
+    def test_normal(self):
+        def gen_random(state, out):
+            out[...] = state.normal(size=10000)
+        self.check_function(gen_random, sz=(10000,))
+
+    def test_exp(self):
+        def gen_random(state, out):
+            out[...] = state.exponential(scale=np.ones((100, 1000)))
+        self.check_function(gen_random, sz=(100, 1000))
+
+    def test_multinomial(self):
+        def gen_random(state, out):
+            out[...] = state.multinomial(10, [1/6.]*6, size=10000)
+        self.check_function(gen_random, sz=(10000, 6))
+
+
+# See Issue #4263
+class TestSingleEltArrayInput:
+    def setup(self):
+        self.argOne = np.array([2])
+        self.argTwo = np.array([3])
+        self.argThree = np.array([4])
+        self.tgtShape = (1,)
+
+    def test_one_arg_funcs(self):
+        funcs = (np.random.exponential, np.random.standard_gamma,
+                 np.random.chisquare, np.random.standard_t,
+                 np.random.pareto, np.random.weibull,
+                 np.random.power, np.random.rayleigh,
+                 np.random.poisson, np.random.zipf,
+                 np.random.geometric, np.random.logseries)
+
+        probfuncs = (np.random.geometric, np.random.logseries)
+
+        for func in funcs:
+            if func in probfuncs:  # p < 1.0
+                out = func(np.array([0.5]))
+
+            else:
+                out = func(self.argOne)
+
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_two_arg_funcs(self):
+        funcs = (np.random.uniform, np.random.normal,
+                 np.random.beta, np.random.gamma,
+                 np.random.f, np.random.noncentral_chisquare,
+                 np.random.vonmises, np.random.laplace,
+                 np.random.gumbel, np.random.logistic,
+                 np.random.lognormal, np.random.wald,
+                 np.random.binomial, np.random.negative_binomial)
+
+        probfuncs = (np.random.binomial, np.random.negative_binomial)
+
+        for func in funcs:
+            if func in probfuncs:  # p <= 1
+                argTwo = np.array([0.5])
+
+            else:
+                argTwo = self.argTwo
+
+            out = func(self.argOne, argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, argTwo[0])
+            assert_equal(out.shape, self.tgtShape)
+
+# TODO: Uncomment once randint can broadcast arguments
+#    def test_randint(self):
+#        itype = [bool, np.int8, np.uint8, np.int16, np.uint16,
+#                 np.int32, np.uint32, np.int64, np.uint64]
+#        func = np.random.randint
+#        high = np.array([1])
+#        low = np.array([0])
+#
+#        for dt in itype:
+#            out = func(low, high, dtype=dt)
+#            self.assert_equal(out.shape, self.tgtShape)
+#
+#            out = func(low[0], high, dtype=dt)
+#            self.assert_equal(out.shape, self.tgtShape)
+#
+#            out = func(low, high[0], dtype=dt)
+#            self.assert_equal(out.shape, self.tgtShape)
+
+    def test_three_arg_funcs(self):
+        funcs = [np.random.noncentral_f, np.random.triangular,
+                 np.random.hypergeometric]
+
+        for func in funcs:
+            out = func(self.argOne, self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, self.argTwo[0], self.argThree)
+            assert_equal(out.shape, self.tgtShape)
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_randomstate.py b/venv/Lib/site-packages/numpy/random/tests/test_randomstate.py
new file mode 100644
index 000000000..23dbbed6a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_randomstate.py
@@ -0,0 +1,2001 @@
+import hashlib
+import pickle
+import sys
+import warnings
+
+import numpy as np
+import pytest
+from numpy.testing import (
+        assert_, assert_raises, assert_equal, assert_warns,
+        assert_no_warnings, assert_array_equal, assert_array_almost_equal,
+        suppress_warnings
+        )
+
+from numpy.random import MT19937, PCG64
+from numpy import random
+
+INT_FUNCS = {'binomial': (100.0, 0.6),
+             'geometric': (.5,),
+             'hypergeometric': (20, 20, 10),
+             'logseries': (.5,),
+             'multinomial': (20, np.ones(6) / 6.0),
+             'negative_binomial': (100, .5),
+             'poisson': (10.0,),
+             'zipf': (2,),
+             }
+
+if np.iinfo(int).max < 2**32:
+    # Windows and some 32-bit platforms, e.g., ARM
+    INT_FUNC_HASHES = {'binomial': '670e1c04223ffdbab27e08fbbad7bdba',
+                       'logseries': '6bd0183d2f8030c61b0d6e11aaa60caf',
+                       'geometric': '6e9df886f3e1e15a643168568d5280c0',
+                       'hypergeometric': '7964aa611b046aecd33063b90f4dec06',
+                       'multinomial': '68a0b049c16411ed0aa4aff3572431e4',
+                       'negative_binomial': 'dc265219eec62b4338d39f849cd36d09',
+                       'poisson': '7b4dce8e43552fc82701c2fa8e94dc6e',
+                       'zipf': 'fcd2a2095f34578723ac45e43aca48c5',
+                       }
+else:
+    INT_FUNC_HASHES = {'binomial': 'b5f8dcd74f172836536deb3547257b14',
+                       'geometric': '8814571f45c87c59699d62ccd3d6c350',
+                       'hypergeometric': 'bc64ae5976eac452115a16dad2dcf642',
+                       'logseries': '84be924b37485a27c4a98797bc88a7a4',
+                       'multinomial': 'ec3c7f9cf9664044bb0c6fb106934200',
+                       'negative_binomial': '210533b2234943591364d0117a552969',
+                       'poisson': '0536a8850c79da0c78defd742dccc3e0',
+                       'zipf': 'f2841f504dd2525cd67cdcad7561e532',
+                       }
+
+
+@pytest.fixture(scope='module', params=INT_FUNCS)
+def int_func(request):
+    return (request.param, INT_FUNCS[request.param],
+            INT_FUNC_HASHES[request.param])
+
+
+def assert_mt19937_state_equal(a, b):
+    assert_equal(a['bit_generator'], b['bit_generator'])
+    assert_array_equal(a['state']['key'], b['state']['key'])
+    assert_array_equal(a['state']['pos'], b['state']['pos'])
+    assert_equal(a['has_gauss'], b['has_gauss'])
+    assert_equal(a['gauss'], b['gauss'])
+
+
+class TestSeed:
+    def test_scalar(self):
+        s = random.RandomState(0)
+        assert_equal(s.randint(1000), 684)
+        s = random.RandomState(4294967295)
+        assert_equal(s.randint(1000), 419)
+
+    def test_array(self):
+        s = random.RandomState(range(10))
+        assert_equal(s.randint(1000), 468)
+        s = random.RandomState(np.arange(10))
+        assert_equal(s.randint(1000), 468)
+        s = random.RandomState([0])
+        assert_equal(s.randint(1000), 973)
+        s = random.RandomState([4294967295])
+        assert_equal(s.randint(1000), 265)
+
+    def test_invalid_scalar(self):
+        # seed must be an unsigned 32 bit integer
+        assert_raises(TypeError, random.RandomState, -0.5)
+        assert_raises(ValueError, random.RandomState, -1)
+
+    def test_invalid_array(self):
+        # seed must be an unsigned 32 bit integer
+        assert_raises(TypeError, random.RandomState, [-0.5])
+        assert_raises(ValueError, random.RandomState, [-1])
+        assert_raises(ValueError, random.RandomState, [4294967296])
+        assert_raises(ValueError, random.RandomState, [1, 2, 4294967296])
+        assert_raises(ValueError, random.RandomState, [1, -2, 4294967296])
+
+    def test_invalid_array_shape(self):
+        # gh-9832
+        assert_raises(ValueError, random.RandomState, np.array([],
+                                                               dtype=np.int64))
+        assert_raises(ValueError, random.RandomState, [[1, 2, 3]])
+        assert_raises(ValueError, random.RandomState, [[1, 2, 3],
+                                                       [4, 5, 6]])
+
+    def test_cannot_seed(self):
+        rs = random.RandomState(PCG64(0))
+        with assert_raises(TypeError):
+            rs.seed(1234)
+
+    def test_invalid_initialization(self):
+        assert_raises(ValueError, random.RandomState, MT19937)
+
+
+class TestBinomial:
+    def test_n_zero(self):
+        # Tests the corner case of n == 0 for the binomial distribution.
+        # binomial(0, p) should be zero for any p in [0, 1].
+        # This test addresses issue #3480.
+        zeros = np.zeros(2, dtype='int')
+        for p in [0, .5, 1]:
+            assert_(random.binomial(0, p) == 0)
+            assert_array_equal(random.binomial(zeros, p), zeros)
+
+    def test_p_is_nan(self):
+        # Issue #4571.
+        assert_raises(ValueError, random.binomial, 1, np.nan)
+
+
+class TestMultinomial:
+    def test_basic(self):
+        random.multinomial(100, [0.2, 0.8])
+
+    def test_zero_probability(self):
+        random.multinomial(100, [0.2, 0.8, 0.0, 0.0, 0.0])
+
+    def test_int_negative_interval(self):
+        assert_(-5 <= random.randint(-5, -1) < -1)
+        x = random.randint(-5, -1, 5)
+        assert_(np.all(-5 <= x))
+        assert_(np.all(x < -1))
+
+    def test_size(self):
+        # gh-3173
+        p = [0.5, 0.5]
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.multinomial(1, p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(random.multinomial(1, p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(random.multinomial(1, p, np.array((2, 2))).shape,
+                     (2, 2, 2))
+
+        assert_raises(TypeError, random.multinomial, 1, p,
+                      float(1))
+
+    def test_invalid_prob(self):
+        assert_raises(ValueError, random.multinomial, 100, [1.1, 0.2])
+        assert_raises(ValueError, random.multinomial, 100, [-.1, 0.9])
+
+    def test_invalid_n(self):
+        assert_raises(ValueError, random.multinomial, -1, [0.8, 0.2])
+
+    def test_p_non_contiguous(self):
+        p = np.arange(15.)
+        p /= np.sum(p[1::3])
+        pvals = p[1::3]
+        random.seed(1432985819)
+        non_contig = random.multinomial(100, pvals=pvals)
+        random.seed(1432985819)
+        contig = random.multinomial(100, pvals=np.ascontiguousarray(pvals))
+        assert_array_equal(non_contig, contig)
+
+
+class TestSetState:
+    def setup(self):
+        self.seed = 1234567890
+        self.random_state = random.RandomState(self.seed)
+        self.state = self.random_state.get_state()
+
+    def test_basic(self):
+        old = self.random_state.tomaxint(16)
+        self.random_state.set_state(self.state)
+        new = self.random_state.tomaxint(16)
+        assert_(np.all(old == new))
+
+    def test_gaussian_reset(self):
+        # Make sure the cached every-other-Gaussian is reset.
+        old = self.random_state.standard_normal(size=3)
+        self.random_state.set_state(self.state)
+        new = self.random_state.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_gaussian_reset_in_media_res(self):
+        # When the state is saved with a cached Gaussian, make sure the
+        # cached Gaussian is restored.
+
+        self.random_state.standard_normal()
+        state = self.random_state.get_state()
+        old = self.random_state.standard_normal(size=3)
+        self.random_state.set_state(state)
+        new = self.random_state.standard_normal(size=3)
+        assert_(np.all(old == new))
+
+    def test_backwards_compatibility(self):
+        # Make sure we can accept old state tuples that do not have the
+        # cached Gaussian value.
+        old_state = self.state[:-2]
+        x1 = self.random_state.standard_normal(size=16)
+        self.random_state.set_state(old_state)
+        x2 = self.random_state.standard_normal(size=16)
+        self.random_state.set_state(self.state)
+        x3 = self.random_state.standard_normal(size=16)
+        assert_(np.all(x1 == x2))
+        assert_(np.all(x1 == x3))
+
+    def test_negative_binomial(self):
+        # Ensure that the negative binomial results take floating point
+        # arguments without truncation.
+        self.random_state.negative_binomial(0.5, 0.5)
+
+    def test_get_state_warning(self):
+        rs = random.RandomState(PCG64())
+        with suppress_warnings() as sup:
+            w = sup.record(RuntimeWarning)
+            state = rs.get_state()
+            assert_(len(w) == 1)
+            assert isinstance(state, dict)
+            assert state['bit_generator'] == 'PCG64'
+
+    def test_invalid_legacy_state_setting(self):
+        state = self.random_state.get_state()
+        new_state = ('Unknown', ) + state[1:]
+        assert_raises(ValueError, self.random_state.set_state, new_state)
+        assert_raises(TypeError, self.random_state.set_state,
+                      np.array(new_state, dtype=object))
+        state = self.random_state.get_state(legacy=False)
+        del state['bit_generator']
+        assert_raises(ValueError, self.random_state.set_state, state)
+
+    def test_pickle(self):
+        self.random_state.seed(0)
+        self.random_state.random_sample(100)
+        self.random_state.standard_normal()
+        pickled = self.random_state.get_state(legacy=False)
+        assert_equal(pickled['has_gauss'], 1)
+        rs_unpick = pickle.loads(pickle.dumps(self.random_state))
+        unpickled = rs_unpick.get_state(legacy=False)
+        assert_mt19937_state_equal(pickled, unpickled)
+
+    def test_state_setting(self):
+        attr_state = self.random_state.__getstate__()
+        self.random_state.standard_normal()
+        self.random_state.__setstate__(attr_state)
+        state = self.random_state.get_state(legacy=False)
+        assert_mt19937_state_equal(attr_state, state)
+
+    def test_repr(self):
+        assert repr(self.random_state).startswith('RandomState(MT19937)')
+
+
+class TestRandint:
+
+    rfunc = random.randint
+
+    # valid integer/boolean types
+    itype = [np.bool_, np.int8, np.uint8, np.int16, np.uint16,
+             np.int32, np.uint32, np.int64, np.uint64]
+
+    def test_unsupported_type(self):
+        assert_raises(TypeError, self.rfunc, 1, dtype=float)
+
+    def test_bounds_checking(self):
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+            assert_raises(ValueError, self.rfunc, lbnd - 1, ubnd, dtype=dt)
+            assert_raises(ValueError, self.rfunc, lbnd, ubnd + 1, dtype=dt)
+            assert_raises(ValueError, self.rfunc, ubnd, lbnd, dtype=dt)
+            assert_raises(ValueError, self.rfunc, 1, 0, dtype=dt)
+
+    def test_rng_zero_and_extremes(self):
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            tgt = ubnd - 1
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+            tgt = lbnd
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+            tgt = (lbnd + ubnd)//2
+            assert_equal(self.rfunc(tgt, tgt + 1, size=1000, dtype=dt), tgt)
+
+    def test_full_range(self):
+        # Test for ticket #1690
+
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            try:
+                self.rfunc(lbnd, ubnd, dtype=dt)
+            except Exception as e:
+                raise AssertionError("No error should have been raised, "
+                                     "but one was with the following "
+                                     "message:\n\n%s" % str(e))
+
+    def test_in_bounds_fuzz(self):
+        # Don't use fixed seed
+        random.seed()
+
+        for dt in self.itype[1:]:
+            for ubnd in [4, 8, 16]:
+                vals = self.rfunc(2, ubnd, size=2**16, dtype=dt)
+                assert_(vals.max() < ubnd)
+                assert_(vals.min() >= 2)
+
+        vals = self.rfunc(0, 2, size=2**16, dtype=np.bool_)
+
+        assert_(vals.max() < 2)
+        assert_(vals.min() >= 0)
+
+    def test_repeatability(self):
+        # We use a md5 hash of generated sequences of 1000 samples
+        # in the range [0, 6) for all but bool, where the range
+        # is [0, 2). Hashes are for little endian numbers.
+        tgt = {'bool': '7dd3170d7aa461d201a65f8bcf3944b0',
+               'int16': '1b7741b80964bb190c50d541dca1cac1',
+               'int32': '4dc9fcc2b395577ebb51793e58ed1a05',
+               'int64': '17db902806f448331b5a758d7d2ee672',
+               'int8': '27dd30c4e08a797063dffac2490b0be6',
+               'uint16': '1b7741b80964bb190c50d541dca1cac1',
+               'uint32': '4dc9fcc2b395577ebb51793e58ed1a05',
+               'uint64': '17db902806f448331b5a758d7d2ee672',
+               'uint8': '27dd30c4e08a797063dffac2490b0be6'}
+
+        for dt in self.itype[1:]:
+            random.seed(1234)
+
+            # view as little endian for hash
+            if sys.byteorder == 'little':
+                val = self.rfunc(0, 6, size=1000, dtype=dt)
+            else:
+                val = self.rfunc(0, 6, size=1000, dtype=dt).byteswap()
+
+            res = hashlib.md5(val.view(np.int8)).hexdigest()
+            assert_(tgt[np.dtype(dt).name] == res)
+
+        # bools do not depend on endianness
+        random.seed(1234)
+        val = self.rfunc(0, 2, size=1000, dtype=bool).view(np.int8)
+        res = hashlib.md5(val).hexdigest()
+        assert_(tgt[np.dtype(bool).name] == res)
+
+    @pytest.mark.skipif(np.iinfo('l').max < 2**32,
+                        reason='Cannot test with 32-bit C long')
+    def test_repeatability_32bit_boundary_broadcasting(self):
+        desired = np.array([[[3992670689, 2438360420, 2557845020],
+                             [4107320065, 4142558326, 3216529513],
+                             [1605979228, 2807061240,  665605495]],
+                            [[3211410639, 4128781000,  457175120],
+                             [1712592594, 1282922662, 3081439808],
+                             [3997822960, 2008322436, 1563495165]],
+                            [[1398375547, 4269260146,  115316740],
+                             [3414372578, 3437564012, 2112038651],
+                             [3572980305, 2260248732, 3908238631]],
+                            [[2561372503,  223155946, 3127879445],
+                             [ 441282060, 3514786552, 2148440361],
+                             [1629275283, 3479737011, 3003195987]],
+                            [[ 412181688,  940383289, 3047321305],
+                             [2978368172,  764731833, 2282559898],
+                             [ 105711276,  720447391, 3596512484]]])
+        for size in [None, (5, 3, 3)]:
+            random.seed(12345)
+            x = self.rfunc([[-1], [0], [1]], [2**32 - 1, 2**32, 2**32 + 1],
+                           size=size)
+            assert_array_equal(x, desired if size is not None else desired[0])
+
+    def test_int64_uint64_corner_case(self):
+        # When stored in Numpy arrays, `lbnd` is casted
+        # as np.int64, and `ubnd` is casted as np.uint64.
+        # Checking whether `lbnd` >= `ubnd` used to be
+        # done solely via direct comparison, which is incorrect
+        # because when Numpy tries to compare both numbers,
+        # it casts both to np.float64 because there is
+        # no integer superset of np.int64 and np.uint64. However,
+        # `ubnd` is too large to be represented in np.float64,
+        # causing it be round down to np.iinfo(np.int64).max,
+        # leading to a ValueError because `lbnd` now equals
+        # the new `ubnd`.
+
+        dt = np.int64
+        tgt = np.iinfo(np.int64).max
+        lbnd = np.int64(np.iinfo(np.int64).max)
+        ubnd = np.uint64(np.iinfo(np.int64).max + 1)
+
+        # None of these function calls should
+        # generate a ValueError now.
+        actual = random.randint(lbnd, ubnd, dtype=dt)
+        assert_equal(actual, tgt)
+
+    def test_respect_dtype_singleton(self):
+        # See gh-7203
+        for dt in self.itype:
+            lbnd = 0 if dt is np.bool_ else np.iinfo(dt).min
+            ubnd = 2 if dt is np.bool_ else np.iinfo(dt).max + 1
+
+            sample = self.rfunc(lbnd, ubnd, dtype=dt)
+            assert_equal(sample.dtype, np.dtype(dt))
+
+        for dt in (bool, int, np.compat.long):
+            lbnd = 0 if dt is bool else np.iinfo(dt).min
+            ubnd = 2 if dt is bool else np.iinfo(dt).max + 1
+
+            # gh-7284: Ensure that we get Python data types
+            sample = self.rfunc(lbnd, ubnd, dtype=dt)
+            assert_(not hasattr(sample, 'dtype'))
+            assert_equal(type(sample), dt)
+
+
+class TestRandomDist:
+    # Make sure the random distribution returns the correct value for a
+    # given seed
+
+    def setup(self):
+        self.seed = 1234567890
+
+    def test_rand(self):
+        random.seed(self.seed)
+        actual = random.rand(3, 2)
+        desired = np.array([[0.61879477158567997, 0.59162362775974664],
+                            [0.88868358904449662, 0.89165480011560816],
+                            [0.4575674820298663, 0.7781880808593471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_rand_singleton(self):
+        random.seed(self.seed)
+        actual = random.rand()
+        desired = 0.61879477158567997
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_randn(self):
+        random.seed(self.seed)
+        actual = random.randn(3, 2)
+        desired = np.array([[1.34016345771863121, 1.73759122771936081],
+                           [1.498988344300628, -0.2286433324536169],
+                           [2.031033998682787, 2.17032494605655257]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        random.seed(self.seed)
+        actual = random.randn()
+        assert_array_almost_equal(actual, desired[0, 0], decimal=15)
+
+    def test_randint(self):
+        random.seed(self.seed)
+        actual = random.randint(-99, 99, size=(3, 2))
+        desired = np.array([[31, 3],
+                            [-52, 41],
+                            [-48, -66]])
+        assert_array_equal(actual, desired)
+
+    def test_random_integers(self):
+        random.seed(self.seed)
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            actual = random.random_integers(-99, 99, size=(3, 2))
+            assert_(len(w) == 1)
+        desired = np.array([[31, 3],
+                            [-52, 41],
+                            [-48, -66]])
+        assert_array_equal(actual, desired)
+
+        random.seed(self.seed)
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            actual = random.random_integers(198, size=(3, 2))
+            assert_(len(w) == 1)
+        assert_array_equal(actual, desired + 100)
+
+    def test_tomaxint(self):
+        random.seed(self.seed)
+        rs = random.RandomState(self.seed)
+        actual = rs.tomaxint(size=(3, 2))
+        if np.iinfo(int).max == 2147483647:
+            desired = np.array([[1328851649,  731237375],
+                                [1270502067,  320041495],
+                                [1908433478,  499156889]], dtype=np.int64)
+        else:
+            desired = np.array([[5707374374421908479, 5456764827585442327],
+                                [8196659375100692377, 8224063923314595285],
+                                [4220315081820346526, 7177518203184491332]],
+                               dtype=np.int64)
+
+        assert_equal(actual, desired)
+
+        rs.seed(self.seed)
+        actual = rs.tomaxint()
+        assert_equal(actual, desired[0, 0])
+
+    def test_random_integers_max_int(self):
+        # Tests whether random_integers can generate the
+        # maximum allowed Python int that can be converted
+        # into a C long. Previous implementations of this
+        # method have thrown an OverflowError when attempting
+        # to generate this integer.
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            actual = random.random_integers(np.iinfo('l').max,
+                                            np.iinfo('l').max)
+            assert_(len(w) == 1)
+
+        desired = np.iinfo('l').max
+        assert_equal(actual, desired)
+        with suppress_warnings() as sup:
+            w = sup.record(DeprecationWarning)
+            typer = np.dtype('l').type
+            actual = random.random_integers(typer(np.iinfo('l').max),
+                                            typer(np.iinfo('l').max))
+            assert_(len(w) == 1)
+        assert_equal(actual, desired)
+
+    def test_random_integers_deprecated(self):
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", DeprecationWarning)
+
+            # DeprecationWarning raised with high == None
+            assert_raises(DeprecationWarning,
+                          random.random_integers,
+                          np.iinfo('l').max)
+
+            # DeprecationWarning raised with high != None
+            assert_raises(DeprecationWarning,
+                          random.random_integers,
+                          np.iinfo('l').max, np.iinfo('l').max)
+
+    def test_random_sample(self):
+        random.seed(self.seed)
+        actual = random.random_sample((3, 2))
+        desired = np.array([[0.61879477158567997, 0.59162362775974664],
+                            [0.88868358904449662, 0.89165480011560816],
+                            [0.4575674820298663, 0.7781880808593471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        random.seed(self.seed)
+        actual = random.random_sample()
+        assert_array_almost_equal(actual, desired[0, 0], decimal=15)
+
+    def test_choice_uniform_replace(self):
+        random.seed(self.seed)
+        actual = random.choice(4, 4)
+        desired = np.array([2, 3, 2, 3])
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_replace(self):
+        random.seed(self.seed)
+        actual = random.choice(4, 4, p=[0.4, 0.4, 0.1, 0.1])
+        desired = np.array([1, 1, 2, 2])
+        assert_array_equal(actual, desired)
+
+    def test_choice_uniform_noreplace(self):
+        random.seed(self.seed)
+        actual = random.choice(4, 3, replace=False)
+        desired = np.array([0, 1, 3])
+        assert_array_equal(actual, desired)
+
+    def test_choice_nonuniform_noreplace(self):
+        random.seed(self.seed)
+        actual = random.choice(4, 3, replace=False, p=[0.1, 0.3, 0.5, 0.1])
+        desired = np.array([2, 3, 1])
+        assert_array_equal(actual, desired)
+
+    def test_choice_noninteger(self):
+        random.seed(self.seed)
+        actual = random.choice(['a', 'b', 'c', 'd'], 4)
+        desired = np.array(['c', 'd', 'c', 'd'])
+        assert_array_equal(actual, desired)
+
+    def test_choice_exceptions(self):
+        sample = random.choice
+        assert_raises(ValueError, sample, -1, 3)
+        assert_raises(ValueError, sample, 3., 3)
+        assert_raises(ValueError, sample, [[1, 2], [3, 4]], 3)
+        assert_raises(ValueError, sample, [], 3)
+        assert_raises(ValueError, sample, [1, 2, 3, 4], 3,
+                      p=[[0.25, 0.25], [0.25, 0.25]])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4, 0.2])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[1.1, -0.1])
+        assert_raises(ValueError, sample, [1, 2], 3, p=[0.4, 0.4])
+        assert_raises(ValueError, sample, [1, 2, 3], 4, replace=False)
+        # gh-13087
+        assert_raises(ValueError, sample, [1, 2, 3], -2, replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1,), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], (-1, 1), replace=False)
+        assert_raises(ValueError, sample, [1, 2, 3], 2,
+                      replace=False, p=[1, 0, 0])
+
+    def test_choice_return_shape(self):
+        p = [0.1, 0.9]
+        # Check scalar
+        assert_(np.isscalar(random.choice(2, replace=True)))
+        assert_(np.isscalar(random.choice(2, replace=False)))
+        assert_(np.isscalar(random.choice(2, replace=True, p=p)))
+        assert_(np.isscalar(random.choice(2, replace=False, p=p)))
+        assert_(np.isscalar(random.choice([1, 2], replace=True)))
+        assert_(random.choice([None], replace=True) is None)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(random.choice(arr, replace=True) is a)
+
+        # Check 0-d array
+        s = tuple()
+        assert_(not np.isscalar(random.choice(2, s, replace=True)))
+        assert_(not np.isscalar(random.choice(2, s, replace=False)))
+        assert_(not np.isscalar(random.choice(2, s, replace=True, p=p)))
+        assert_(not np.isscalar(random.choice(2, s, replace=False, p=p)))
+        assert_(not np.isscalar(random.choice([1, 2], s, replace=True)))
+        assert_(random.choice([None], s, replace=True).ndim == 0)
+        a = np.array([1, 2])
+        arr = np.empty(1, dtype=object)
+        arr[0] = a
+        assert_(random.choice(arr, s, replace=True).item() is a)
+
+        # Check multi dimensional array
+        s = (2, 3)
+        p = [0.1, 0.1, 0.1, 0.1, 0.4, 0.2]
+        assert_equal(random.choice(6, s, replace=True).shape, s)
+        assert_equal(random.choice(6, s, replace=False).shape, s)
+        assert_equal(random.choice(6, s, replace=True, p=p).shape, s)
+        assert_equal(random.choice(6, s, replace=False, p=p).shape, s)
+        assert_equal(random.choice(np.arange(6), s, replace=True).shape, s)
+
+        # Check zero-size
+        assert_equal(random.randint(0, 0, size=(3, 0, 4)).shape, (3, 0, 4))
+        assert_equal(random.randint(0, -10, size=0).shape, (0,))
+        assert_equal(random.randint(10, 10, size=0).shape, (0,))
+        assert_equal(random.choice(0, size=0).shape, (0,))
+        assert_equal(random.choice([], size=(0,)).shape, (0,))
+        assert_equal(random.choice(['a', 'b'], size=(3, 0, 4)).shape,
+                     (3, 0, 4))
+        assert_raises(ValueError, random.choice, [], 10)
+
+    def test_choice_nan_probabilities(self):
+        a = np.array([42, 1, 2])
+        p = [None, None, None]
+        assert_raises(ValueError, random.choice, a, p=p)
+    
+    def test_choice_p_non_contiguous(self):
+        p = np.ones(10) / 5
+        p[1::2] = 3.0
+        random.seed(self.seed)
+        non_contig = random.choice(5, 3, p=p[::2])
+        random.seed(self.seed)
+        contig = random.choice(5, 3, p=np.ascontiguousarray(p[::2]))
+        assert_array_equal(non_contig, contig)
+
+    def test_bytes(self):
+        random.seed(self.seed)
+        actual = random.bytes(10)
+        desired = b'\x82Ui\x9e\xff\x97+Wf\xa5'
+        assert_equal(actual, desired)
+
+    def test_shuffle(self):
+        # Test lists, arrays (of various dtypes), and multidimensional versions
+        # of both, c-contiguous or not:
+        for conv in [lambda x: np.array([]),
+                     lambda x: x,
+                     lambda x: np.asarray(x).astype(np.int8),
+                     lambda x: np.asarray(x).astype(np.float32),
+                     lambda x: np.asarray(x).astype(np.complex64),
+                     lambda x: np.asarray(x).astype(object),
+                     lambda x: [(i, i) for i in x],
+                     lambda x: np.asarray([[i, i] for i in x]),
+                     lambda x: np.vstack([x, x]).T,
+                     # gh-11442
+                     lambda x: (np.asarray([(i, i) for i in x],
+                                           [("a", int), ("b", int)])
+                                .view(np.recarray)),
+                     # gh-4270
+                     lambda x: np.asarray([(i, i) for i in x],
+                                          [("a", object, (1,)),
+                                           ("b", np.int32, (1,))])]:
+            random.seed(self.seed)
+            alist = conv([1, 2, 3, 4, 5, 6, 7, 8, 9, 0])
+            random.shuffle(alist)
+            actual = alist
+            desired = conv([0, 1, 9, 6, 2, 4, 5, 8, 7, 3])
+            assert_array_equal(actual, desired)
+
+    def test_shuffle_masked(self):
+        # gh-3263
+        a = np.ma.masked_values(np.reshape(range(20), (5, 4)) % 3 - 1, -1)
+        b = np.ma.masked_values(np.arange(20) % 3 - 1, -1)
+        a_orig = a.copy()
+        b_orig = b.copy()
+        for i in range(50):
+            random.shuffle(a)
+            assert_equal(
+                sorted(a.data[~a.mask]), sorted(a_orig.data[~a_orig.mask]))
+            random.shuffle(b)
+            assert_equal(
+                sorted(b.data[~b.mask]), sorted(b_orig.data[~b_orig.mask]))
+
+    def test_permutation(self):
+        random.seed(self.seed)
+        alist = [1, 2, 3, 4, 5, 6, 7, 8, 9, 0]
+        actual = random.permutation(alist)
+        desired = [0, 1, 9, 6, 2, 4, 5, 8, 7, 3]
+        assert_array_equal(actual, desired)
+
+        random.seed(self.seed)
+        arr_2d = np.atleast_2d([1, 2, 3, 4, 5, 6, 7, 8, 9, 0]).T
+        actual = random.permutation(arr_2d)
+        assert_array_equal(actual, np.atleast_2d(desired).T)
+
+        random.seed(self.seed)
+        bad_x_str = "abcd"
+        assert_raises(IndexError, random.permutation, bad_x_str)
+
+        random.seed(self.seed)
+        bad_x_float = 1.2
+        assert_raises(IndexError, random.permutation, bad_x_float)
+
+        integer_val = 10
+        desired = [9, 0, 8, 5, 1, 3, 4, 7, 6, 2]
+
+        random.seed(self.seed)
+        actual = random.permutation(integer_val)
+        assert_array_equal(actual, desired)
+
+    def test_beta(self):
+        random.seed(self.seed)
+        actual = random.beta(.1, .9, size=(3, 2))
+        desired = np.array(
+                [[1.45341850513746058e-02, 5.31297615662868145e-04],
+                 [1.85366619058432324e-06, 4.19214516800110563e-03],
+                 [1.58405155108498093e-04, 1.26252891949397652e-04]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_binomial(self):
+        random.seed(self.seed)
+        actual = random.binomial(100.123, .456, size=(3, 2))
+        desired = np.array([[37, 43],
+                            [42, 48],
+                            [46, 45]])
+        assert_array_equal(actual, desired)
+
+        random.seed(self.seed)
+        actual = random.binomial(100.123, .456)
+        desired = 37
+        assert_array_equal(actual, desired)
+
+    def test_chisquare(self):
+        random.seed(self.seed)
+        actual = random.chisquare(50, size=(3, 2))
+        desired = np.array([[63.87858175501090585, 68.68407748911370447],
+                            [65.77116116901505904, 47.09686762438974483],
+                            [72.3828403199695174, 74.18408615260374006]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_dirichlet(self):
+        random.seed(self.seed)
+        alpha = np.array([51.72840233779265162, 39.74494232180943953])
+        actual = random.dirichlet(alpha, size=(3, 2))
+        desired = np.array([[[0.54539444573611562, 0.45460555426388438],
+                             [0.62345816822039413, 0.37654183177960598]],
+                            [[0.55206000085785778, 0.44793999914214233],
+                             [0.58964023305154301, 0.41035976694845688]],
+                            [[0.59266909280647828, 0.40733090719352177],
+                             [0.56974431743975207, 0.43025568256024799]]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+        bad_alpha = np.array([5.4e-01, -1.0e-16])
+        assert_raises(ValueError, random.dirichlet, bad_alpha)
+
+        random.seed(self.seed)
+        alpha = np.array([51.72840233779265162, 39.74494232180943953])
+        actual = random.dirichlet(alpha)
+        assert_array_almost_equal(actual, desired[0, 0], decimal=15)
+
+    def test_dirichlet_size(self):
+        # gh-3173
+        p = np.array([51.72840233779265162, 39.74494232180943953])
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, np.uint32(1)).shape, (1, 2))
+        assert_equal(random.dirichlet(p, [2, 2]).shape, (2, 2, 2))
+        assert_equal(random.dirichlet(p, (2, 2)).shape, (2, 2, 2))
+        assert_equal(random.dirichlet(p, np.array((2, 2))).shape, (2, 2, 2))
+
+        assert_raises(TypeError, random.dirichlet, p, float(1))
+
+    def test_dirichlet_bad_alpha(self):
+        # gh-2089
+        alpha = np.array([5.4e-01, -1.0e-16])
+        assert_raises(ValueError, random.dirichlet, alpha)
+
+    def test_dirichlet_alpha_non_contiguous(self):
+        a = np.array([51.72840233779265162, -1.0, 39.74494232180943953])
+        alpha = a[::2]
+        random.seed(self.seed)
+        non_contig = random.dirichlet(alpha, size=(3, 2))
+        random.seed(self.seed)
+        contig = random.dirichlet(np.ascontiguousarray(alpha),
+                                  size=(3, 2))
+        assert_array_almost_equal(non_contig, contig)
+
+    def test_exponential(self):
+        random.seed(self.seed)
+        actual = random.exponential(1.1234, size=(3, 2))
+        desired = np.array([[1.08342649775011624, 1.00607889924557314],
+                            [2.46628830085216721, 2.49668106809923884],
+                            [0.68717433461363442, 1.69175666993575979]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_exponential_0(self):
+        assert_equal(random.exponential(scale=0), 0)
+        assert_raises(ValueError, random.exponential, scale=-0.)
+
+    def test_f(self):
+        random.seed(self.seed)
+        actual = random.f(12, 77, size=(3, 2))
+        desired = np.array([[1.21975394418575878, 1.75135759791559775],
+                            [1.44803115017146489, 1.22108959480396262],
+                            [1.02176975757740629, 1.34431827623300415]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gamma(self):
+        random.seed(self.seed)
+        actual = random.gamma(5, 3, size=(3, 2))
+        desired = np.array([[24.60509188649287182, 28.54993563207210627],
+                            [26.13476110204064184, 12.56988482927716078],
+                            [31.71863275789960568, 33.30143302795922011]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_gamma_0(self):
+        assert_equal(random.gamma(shape=0, scale=0), 0)
+        assert_raises(ValueError, random.gamma, shape=-0., scale=-0.)
+
+    def test_geometric(self):
+        random.seed(self.seed)
+        actual = random.geometric(.123456789, size=(3, 2))
+        desired = np.array([[8, 7],
+                            [17, 17],
+                            [5, 12]])
+        assert_array_equal(actual, desired)
+
+    def test_geometric_exceptions(self):
+        assert_raises(ValueError, random.geometric, 1.1)
+        assert_raises(ValueError, random.geometric, [1.1] * 10)
+        assert_raises(ValueError, random.geometric, -0.1)
+        assert_raises(ValueError, random.geometric, [-0.1] * 10)
+        with suppress_warnings() as sup:
+            sup.record(RuntimeWarning)
+            assert_raises(ValueError, random.geometric, np.nan)
+            assert_raises(ValueError, random.geometric, [np.nan] * 10)
+
+    def test_gumbel(self):
+        random.seed(self.seed)
+        actual = random.gumbel(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[0.19591898743416816, 0.34405539668096674],
+                            [-1.4492522252274278, -1.47374816298446865],
+                            [1.10651090478803416, -0.69535848626236174]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_gumbel_0(self):
+        assert_equal(random.gumbel(scale=0), 0)
+        assert_raises(ValueError, random.gumbel, scale=-0.)
+
+    def test_hypergeometric(self):
+        random.seed(self.seed)
+        actual = random.hypergeometric(10.1, 5.5, 14, size=(3, 2))
+        desired = np.array([[10, 10],
+                            [10, 10],
+                            [9, 9]])
+        assert_array_equal(actual, desired)
+
+        # Test nbad = 0
+        actual = random.hypergeometric(5, 0, 3, size=4)
+        desired = np.array([3, 3, 3, 3])
+        assert_array_equal(actual, desired)
+
+        actual = random.hypergeometric(15, 0, 12, size=4)
+        desired = np.array([12, 12, 12, 12])
+        assert_array_equal(actual, desired)
+
+        # Test ngood = 0
+        actual = random.hypergeometric(0, 5, 3, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+        actual = random.hypergeometric(0, 15, 12, size=4)
+        desired = np.array([0, 0, 0, 0])
+        assert_array_equal(actual, desired)
+
+    def test_laplace(self):
+        random.seed(self.seed)
+        actual = random.laplace(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[0.66599721112760157, 0.52829452552221945],
+                            [3.12791959514407125, 3.18202813572992005],
+                            [-0.05391065675859356, 1.74901336242837324]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_laplace_0(self):
+        assert_equal(random.laplace(scale=0), 0)
+        assert_raises(ValueError, random.laplace, scale=-0.)
+
+    def test_logistic(self):
+        random.seed(self.seed)
+        actual = random.logistic(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[1.09232835305011444, 0.8648196662399954],
+                            [4.27818590694950185, 4.33897006346929714],
+                            [-0.21682183359214885, 2.63373365386060332]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_lognormal(self):
+        random.seed(self.seed)
+        actual = random.lognormal(mean=.123456789, sigma=2.0, size=(3, 2))
+        desired = np.array([[16.50698631688883822, 36.54846706092654784],
+                            [22.67886599981281748, 0.71617561058995771],
+                            [65.72798501792723869, 86.84341601437161273]])
+        assert_array_almost_equal(actual, desired, decimal=13)
+
+    def test_lognormal_0(self):
+        assert_equal(random.lognormal(sigma=0), 1)
+        assert_raises(ValueError, random.lognormal, sigma=-0.)
+
+    def test_logseries(self):
+        random.seed(self.seed)
+        actual = random.logseries(p=.923456789, size=(3, 2))
+        desired = np.array([[2, 2],
+                            [6, 17],
+                            [3, 6]])
+        assert_array_equal(actual, desired)
+
+    def test_logseries_exceptions(self):
+        with suppress_warnings() as sup:
+            sup.record(RuntimeWarning)
+            assert_raises(ValueError, random.logseries, np.nan)
+            assert_raises(ValueError, random.logseries, [np.nan] * 10)
+
+    def test_multinomial(self):
+        random.seed(self.seed)
+        actual = random.multinomial(20, [1 / 6.] * 6, size=(3, 2))
+        desired = np.array([[[4, 3, 5, 4, 2, 2],
+                             [5, 2, 8, 2, 2, 1]],
+                            [[3, 4, 3, 6, 0, 4],
+                             [2, 1, 4, 3, 6, 4]],
+                            [[4, 4, 2, 5, 2, 3],
+                             [4, 3, 4, 2, 3, 4]]])
+        assert_array_equal(actual, desired)
+
+    def test_multivariate_normal(self):
+        random.seed(self.seed)
+        mean = (.123456789, 10)
+        cov = [[1, 0], [0, 1]]
+        size = (3, 2)
+        actual = random.multivariate_normal(mean, cov, size)
+        desired = np.array([[[1.463620246718631, 11.73759122771936],
+                             [1.622445133300628, 9.771356667546383]],
+                            [[2.154490787682787, 12.170324946056553],
+                             [1.719909438201865, 9.230548443648306]],
+                            [[0.689515026297799, 9.880729819607714],
+                             [-0.023054015651998, 9.201096623542879]]])
+
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        # Check for default size, was raising deprecation warning
+        actual = random.multivariate_normal(mean, cov)
+        desired = np.array([0.895289569463708, 9.17180864067987])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+        # Check that non positive-semidefinite covariance warns with
+        # RuntimeWarning
+        mean = [0, 0]
+        cov = [[1, 2], [2, 1]]
+        assert_warns(RuntimeWarning, random.multivariate_normal, mean, cov)
+
+        # and that it doesn't warn with RuntimeWarning check_valid='ignore'
+        assert_no_warnings(random.multivariate_normal, mean, cov,
+                           check_valid='ignore')
+
+        # and that it raises with RuntimeWarning check_valid='raises'
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='raise')
+
+        cov = np.array([[1, 0.1], [0.1, 1]], dtype=np.float32)
+        with suppress_warnings() as sup:
+            random.multivariate_normal(mean, cov)
+            w = sup.record(RuntimeWarning)
+            assert len(w) == 0
+
+        mu = np.zeros(2)
+        cov = np.eye(2)
+        assert_raises(ValueError, random.multivariate_normal, mean, cov,
+                      check_valid='other')
+        assert_raises(ValueError, random.multivariate_normal,
+                      np.zeros((2, 1, 1)), cov)
+        assert_raises(ValueError, random.multivariate_normal,
+                      mu, np.empty((3, 2)))
+        assert_raises(ValueError, random.multivariate_normal,
+                      mu, np.eye(3))
+
+    def test_negative_binomial(self):
+        random.seed(self.seed)
+        actual = random.negative_binomial(n=100, p=.12345, size=(3, 2))
+        desired = np.array([[848, 841],
+                            [892, 611],
+                            [779, 647]])
+        assert_array_equal(actual, desired)
+
+    def test_negative_binomial_exceptions(self):
+        with suppress_warnings() as sup:
+            sup.record(RuntimeWarning)
+            assert_raises(ValueError, random.negative_binomial, 100, np.nan)
+            assert_raises(ValueError, random.negative_binomial, 100,
+                          [np.nan] * 10)
+
+    def test_noncentral_chisquare(self):
+        random.seed(self.seed)
+        actual = random.noncentral_chisquare(df=5, nonc=5, size=(3, 2))
+        desired = np.array([[23.91905354498517511, 13.35324692733826346],
+                            [31.22452661329736401, 16.60047399466177254],
+                            [5.03461598262724586, 17.94973089023519464]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        actual = random.noncentral_chisquare(df=.5, nonc=.2, size=(3, 2))
+        desired = np.array([[1.47145377828516666,  0.15052899268012659],
+                            [0.00943803056963588,  1.02647251615666169],
+                            [0.332334982684171,  0.15451287602753125]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        random.seed(self.seed)
+        actual = random.noncentral_chisquare(df=5, nonc=0, size=(3, 2))
+        desired = np.array([[9.597154162763948, 11.725484450296079],
+                            [10.413711048138335, 3.694475922923986],
+                            [13.484222138963087, 14.377255424602957]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_noncentral_f(self):
+        random.seed(self.seed)
+        actual = random.noncentral_f(dfnum=5, dfden=2, nonc=1,
+                                     size=(3, 2))
+        desired = np.array([[1.40598099674926669, 0.34207973179285761],
+                            [3.57715069265772545, 7.92632662577829805],
+                            [0.43741599463544162, 1.1774208752428319]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_noncentral_f_nan(self):
+        random.seed(self.seed)
+        actual = random.noncentral_f(dfnum=5, dfden=2, nonc=np.nan)
+        assert np.isnan(actual)
+
+    def test_normal(self):
+        random.seed(self.seed)
+        actual = random.normal(loc=.123456789, scale=2.0, size=(3, 2))
+        desired = np.array([[2.80378370443726244, 3.59863924443872163],
+                            [3.121433477601256, -0.33382987590723379],
+                            [4.18552478636557357, 4.46410668111310471]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_normal_0(self):
+        assert_equal(random.normal(scale=0), 0)
+        assert_raises(ValueError, random.normal, scale=-0.)
+
+    def test_pareto(self):
+        random.seed(self.seed)
+        actual = random.pareto(a=.123456789, size=(3, 2))
+        desired = np.array(
+                [[2.46852460439034849e+03, 1.41286880810518346e+03],
+                 [5.28287797029485181e+07, 6.57720981047328785e+07],
+                 [1.40840323350391515e+02, 1.98390255135251704e+05]])
+        # For some reason on 32-bit x86 Ubuntu 12.10 the [1, 0] entry in this
+        # matrix differs by 24 nulps. Discussion:
+        #   https://mail.python.org/pipermail/numpy-discussion/2012-September/063801.html
+        # Consensus is that this is probably some gcc quirk that affects
+        # rounding but not in any important way, so we just use a looser
+        # tolerance on this test:
+        np.testing.assert_array_almost_equal_nulp(actual, desired, nulp=30)
+
+    def test_poisson(self):
+        random.seed(self.seed)
+        actual = random.poisson(lam=.123456789, size=(3, 2))
+        desired = np.array([[0, 0],
+                            [1, 0],
+                            [0, 0]])
+        assert_array_equal(actual, desired)
+
+    def test_poisson_exceptions(self):
+        lambig = np.iinfo('l').max
+        lamneg = -1
+        assert_raises(ValueError, random.poisson, lamneg)
+        assert_raises(ValueError, random.poisson, [lamneg] * 10)
+        assert_raises(ValueError, random.poisson, lambig)
+        assert_raises(ValueError, random.poisson, [lambig] * 10)
+        with suppress_warnings() as sup:
+            sup.record(RuntimeWarning)
+            assert_raises(ValueError, random.poisson, np.nan)
+            assert_raises(ValueError, random.poisson, [np.nan] * 10)
+
+    def test_power(self):
+        random.seed(self.seed)
+        actual = random.power(a=.123456789, size=(3, 2))
+        desired = np.array([[0.02048932883240791, 0.01424192241128213],
+                            [0.38446073748535298, 0.39499689943484395],
+                            [0.00177699707563439, 0.13115505880863756]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_rayleigh(self):
+        random.seed(self.seed)
+        actual = random.rayleigh(scale=10, size=(3, 2))
+        desired = np.array([[13.8882496494248393, 13.383318339044731],
+                            [20.95413364294492098, 21.08285015800712614],
+                            [11.06066537006854311, 17.35468505778271009]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_rayleigh_0(self):
+        assert_equal(random.rayleigh(scale=0), 0)
+        assert_raises(ValueError, random.rayleigh, scale=-0.)
+
+    def test_standard_cauchy(self):
+        random.seed(self.seed)
+        actual = random.standard_cauchy(size=(3, 2))
+        desired = np.array([[0.77127660196445336, -6.55601161955910605],
+                            [0.93582023391158309, -2.07479293013759447],
+                            [-4.74601644297011926, 0.18338989290760804]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_exponential(self):
+        random.seed(self.seed)
+        actual = random.standard_exponential(size=(3, 2))
+        desired = np.array([[0.96441739162374596, 0.89556604882105506],
+                            [2.1953785836319808, 2.22243285392490542],
+                            [0.6116915921431676, 1.50592546727413201]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_gamma(self):
+        random.seed(self.seed)
+        actual = random.standard_gamma(shape=3, size=(3, 2))
+        desired = np.array([[5.50841531318455058, 6.62953470301903103],
+                            [5.93988484943779227, 2.31044849402133989],
+                            [7.54838614231317084, 8.012756093271868]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_standard_gamma_0(self):
+        assert_equal(random.standard_gamma(shape=0), 0)
+        assert_raises(ValueError, random.standard_gamma, shape=-0.)
+
+    def test_standard_normal(self):
+        random.seed(self.seed)
+        actual = random.standard_normal(size=(3, 2))
+        desired = np.array([[1.34016345771863121, 1.73759122771936081],
+                            [1.498988344300628, -0.2286433324536169],
+                            [2.031033998682787, 2.17032494605655257]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_randn_singleton(self):
+        random.seed(self.seed)
+        actual = random.randn()
+        desired = np.array(1.34016345771863121)
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_standard_t(self):
+        random.seed(self.seed)
+        actual = random.standard_t(df=10, size=(3, 2))
+        desired = np.array([[0.97140611862659965, -0.08830486548450577],
+                            [1.36311143689505321, -0.55317463909867071],
+                            [-0.18473749069684214, 0.61181537341755321]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_triangular(self):
+        random.seed(self.seed)
+        actual = random.triangular(left=5.12, mode=10.23, right=20.34,
+                                   size=(3, 2))
+        desired = np.array([[12.68117178949215784, 12.4129206149193152],
+                            [16.20131377335158263, 16.25692138747600524],
+                            [11.20400690911820263, 14.4978144835829923]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_uniform(self):
+        random.seed(self.seed)
+        actual = random.uniform(low=1.23, high=10.54, size=(3, 2))
+        desired = np.array([[6.99097932346268003, 6.73801597444323974],
+                            [9.50364421400426274, 9.53130618907631089],
+                            [5.48995325769805476, 8.47493103280052118]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_uniform_range_bounds(self):
+        fmin = np.finfo('float').min
+        fmax = np.finfo('float').max
+
+        func = random.uniform
+        assert_raises(OverflowError, func, -np.inf, 0)
+        assert_raises(OverflowError, func, 0, np.inf)
+        assert_raises(OverflowError, func, fmin, fmax)
+        assert_raises(OverflowError, func, [-np.inf], [0])
+        assert_raises(OverflowError, func, [0], [np.inf])
+
+        # (fmax / 1e17) - fmin is within range, so this should not throw
+        # account for i386 extended precision DBL_MAX / 1e17 + DBL_MAX >
+        # DBL_MAX by increasing fmin a bit
+        random.uniform(low=np.nextafter(fmin, 1), high=fmax / 1e17)
+
+    def test_scalar_exception_propagation(self):
+        # Tests that exceptions are correctly propagated in distributions
+        # when called with objects that throw exceptions when converted to
+        # scalars.
+        #
+        # Regression test for gh: 8865
+
+        class ThrowingFloat(np.ndarray):
+            def __float__(self):
+                raise TypeError
+
+        throwing_float = np.array(1.0).view(ThrowingFloat)
+        assert_raises(TypeError, random.uniform, throwing_float,
+                      throwing_float)
+
+        class ThrowingInteger(np.ndarray):
+            def __int__(self):
+                raise TypeError
+
+        throwing_int = np.array(1).view(ThrowingInteger)
+        assert_raises(TypeError, random.hypergeometric, throwing_int, 1, 1)
+
+    def test_vonmises(self):
+        random.seed(self.seed)
+        actual = random.vonmises(mu=1.23, kappa=1.54, size=(3, 2))
+        desired = np.array([[2.28567572673902042, 2.89163838442285037],
+                            [0.38198375564286025, 2.57638023113890746],
+                            [1.19153771588353052, 1.83509849681825354]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_vonmises_small(self):
+        # check infinite loop, gh-4720
+        random.seed(self.seed)
+        r = random.vonmises(mu=0., kappa=1.1e-8, size=10**6)
+        assert_(np.isfinite(r).all())
+
+    def test_vonmises_nan(self):
+        random.seed(self.seed)
+        r = random.vonmises(mu=0., kappa=np.nan)
+        assert_(np.isnan(r))
+
+    def test_wald(self):
+        random.seed(self.seed)
+        actual = random.wald(mean=1.23, scale=1.54, size=(3, 2))
+        desired = np.array([[3.82935265715889983, 5.13125249184285526],
+                            [0.35045403618358717, 1.50832396872003538],
+                            [0.24124319895843183, 0.22031101461955038]])
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_weibull(self):
+        random.seed(self.seed)
+        actual = random.weibull(a=1.23, size=(3, 2))
+        desired = np.array([[0.97097342648766727, 0.91422896443565516],
+                            [1.89517770034962929, 1.91414357960479564],
+                            [0.67057783752390987, 1.39494046635066793]])
+        assert_array_almost_equal(actual, desired, decimal=15)
+
+    def test_weibull_0(self):
+        random.seed(self.seed)
+        assert_equal(random.weibull(a=0, size=12), np.zeros(12))
+        assert_raises(ValueError, random.weibull, a=-0.)
+
+    def test_zipf(self):
+        random.seed(self.seed)
+        actual = random.zipf(a=1.23, size=(3, 2))
+        desired = np.array([[66, 29],
+                            [1, 1],
+                            [3, 13]])
+        assert_array_equal(actual, desired)
+
+
+class TestBroadcast:
+    # tests that functions that broadcast behave
+    # correctly when presented with non-scalar arguments
+    def setup(self):
+        self.seed = 123456789
+
+    def set_seed(self):
+        random.seed(self.seed)
+
+    def test_uniform(self):
+        low = [0]
+        high = [1]
+        uniform = random.uniform
+        desired = np.array([0.53283302478975902,
+                            0.53413660089041659,
+                            0.50955303552646702])
+
+        self.set_seed()
+        actual = uniform(low * 3, high)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+        self.set_seed()
+        actual = uniform(low, high * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_normal(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        normal = random.normal
+        desired = np.array([2.2129019979039612,
+                            2.1283977976520019,
+                            1.8417114045748335])
+
+        self.set_seed()
+        actual = normal(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, normal, loc * 3, bad_scale)
+
+        self.set_seed()
+        actual = normal(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, normal, loc, bad_scale * 3)
+
+    def test_beta(self):
+        a = [1]
+        b = [2]
+        bad_a = [-1]
+        bad_b = [-2]
+        beta = random.beta
+        desired = np.array([0.19843558305989056,
+                            0.075230336409423643,
+                            0.24976865978980844])
+
+        self.set_seed()
+        actual = beta(a * 3, b)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, beta, bad_a * 3, b)
+        assert_raises(ValueError, beta, a * 3, bad_b)
+
+        self.set_seed()
+        actual = beta(a, b * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, beta, bad_a, b * 3)
+        assert_raises(ValueError, beta, a, bad_b * 3)
+
+    def test_exponential(self):
+        scale = [1]
+        bad_scale = [-1]
+        exponential = random.exponential
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.set_seed()
+        actual = exponential(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, exponential, bad_scale * 3)
+
+    def test_standard_gamma(self):
+        shape = [1]
+        bad_shape = [-1]
+        std_gamma = random.standard_gamma
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.set_seed()
+        actual = std_gamma(shape * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, std_gamma, bad_shape * 3)
+
+    def test_gamma(self):
+        shape = [1]
+        scale = [2]
+        bad_shape = [-1]
+        bad_scale = [-2]
+        gamma = random.gamma
+        desired = np.array([1.5221370731769048,
+                            1.5277256455738331,
+                            1.4248762625178359])
+
+        self.set_seed()
+        actual = gamma(shape * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape * 3, scale)
+        assert_raises(ValueError, gamma, shape * 3, bad_scale)
+
+        self.set_seed()
+        actual = gamma(shape, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gamma, bad_shape, scale * 3)
+        assert_raises(ValueError, gamma, shape, bad_scale * 3)
+
+    def test_f(self):
+        dfnum = [1]
+        dfden = [2]
+        bad_dfnum = [-1]
+        bad_dfden = [-2]
+        f = random.f
+        desired = np.array([0.80038951638264799,
+                            0.86768719635363512,
+                            2.7251095168386801])
+
+        self.set_seed()
+        actual = f(dfnum * 3, dfden)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum * 3, dfden)
+        assert_raises(ValueError, f, dfnum * 3, bad_dfden)
+
+        self.set_seed()
+        actual = f(dfnum, dfden * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, f, bad_dfnum, dfden * 3)
+        assert_raises(ValueError, f, dfnum, bad_dfden * 3)
+
+    def test_noncentral_f(self):
+        dfnum = [2]
+        dfden = [3]
+        nonc = [4]
+        bad_dfnum = [0]
+        bad_dfden = [-1]
+        bad_nonc = [-2]
+        nonc_f = random.noncentral_f
+        desired = np.array([9.1393943263705211,
+                            13.025456344595602,
+                            8.8018098359100545])
+
+        self.set_seed()
+        actual = nonc_f(dfnum * 3, dfden, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert np.all(np.isnan(nonc_f(dfnum, dfden, [np.nan] * 3)))
+
+        assert_raises(ValueError, nonc_f, bad_dfnum * 3, dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, bad_dfden, nonc)
+        assert_raises(ValueError, nonc_f, dfnum * 3, dfden, bad_nonc)
+
+        self.set_seed()
+        actual = nonc_f(dfnum, dfden * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden * 3, nonc)
+        assert_raises(ValueError, nonc_f, dfnum, dfden * 3, bad_nonc)
+
+        self.set_seed()
+        actual = nonc_f(dfnum, dfden, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_f, bad_dfnum, dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, bad_dfden, nonc * 3)
+        assert_raises(ValueError, nonc_f, dfnum, dfden, bad_nonc * 3)
+
+    def test_noncentral_f_small_df(self):
+        self.set_seed()
+        desired = np.array([6.869638627492048, 0.785880199263955])
+        actual = random.noncentral_f(0.9, 0.9, 2, size=2)
+        assert_array_almost_equal(actual, desired, decimal=14)
+
+    def test_chisquare(self):
+        df = [1]
+        bad_df = [-1]
+        chisquare = random.chisquare
+        desired = np.array([0.57022801133088286,
+                            0.51947702108840776,
+                            0.1320969254923558])
+
+        self.set_seed()
+        actual = chisquare(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, chisquare, bad_df * 3)
+
+    def test_noncentral_chisquare(self):
+        df = [1]
+        nonc = [2]
+        bad_df = [-1]
+        bad_nonc = [-2]
+        nonc_chi = random.noncentral_chisquare
+        desired = np.array([9.0015599467913763,
+                            4.5804135049718742,
+                            6.0872302432834564])
+
+        self.set_seed()
+        actual = nonc_chi(df * 3, nonc)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df * 3, nonc)
+        assert_raises(ValueError, nonc_chi, df * 3, bad_nonc)
+
+        self.set_seed()
+        actual = nonc_chi(df, nonc * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, nonc_chi, bad_df, nonc * 3)
+        assert_raises(ValueError, nonc_chi, df, bad_nonc * 3)
+
+    def test_standard_t(self):
+        df = [1]
+        bad_df = [-1]
+        t = random.standard_t
+        desired = np.array([3.0702872575217643,
+                            5.8560725167361607,
+                            1.0274791436474273])
+
+        self.set_seed()
+        actual = t(df * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, t, bad_df * 3)
+        assert_raises(ValueError, random.standard_t, bad_df * 3)
+
+    def test_vonmises(self):
+        mu = [2]
+        kappa = [1]
+        bad_kappa = [-1]
+        vonmises = random.vonmises
+        desired = np.array([2.9883443664201312,
+                            -2.7064099483995943,
+                            -1.8672476700665914])
+
+        self.set_seed()
+        actual = vonmises(mu * 3, kappa)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, vonmises, mu * 3, bad_kappa)
+
+        self.set_seed()
+        actual = vonmises(mu, kappa * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, vonmises, mu, bad_kappa * 3)
+
+    def test_pareto(self):
+        a = [1]
+        bad_a = [-1]
+        pareto = random.pareto
+        desired = np.array([1.1405622680198362,
+                            1.1465519762044529,
+                            1.0389564467453547])
+
+        self.set_seed()
+        actual = pareto(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, pareto, bad_a * 3)
+        assert_raises(ValueError, random.pareto, bad_a * 3)
+
+    def test_weibull(self):
+        a = [1]
+        bad_a = [-1]
+        weibull = random.weibull
+        desired = np.array([0.76106853658845242,
+                            0.76386282278691653,
+                            0.71243813125891797])
+
+        self.set_seed()
+        actual = weibull(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, weibull, bad_a * 3)
+        assert_raises(ValueError, random.weibull, bad_a * 3)
+
+    def test_power(self):
+        a = [1]
+        bad_a = [-1]
+        power = random.power
+        desired = np.array([0.53283302478975902,
+                            0.53413660089041659,
+                            0.50955303552646702])
+
+        self.set_seed()
+        actual = power(a * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, power, bad_a * 3)
+        assert_raises(ValueError, random.power, bad_a * 3)
+
+    def test_laplace(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        laplace = random.laplace
+        desired = np.array([0.067921356028507157,
+                            0.070715642226971326,
+                            0.019290950698972624])
+
+        self.set_seed()
+        actual = laplace(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc * 3, bad_scale)
+
+        self.set_seed()
+        actual = laplace(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, laplace, loc, bad_scale * 3)
+
+    def test_gumbel(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        gumbel = random.gumbel
+        desired = np.array([0.2730318639556768,
+                            0.26936705726291116,
+                            0.33906220393037939])
+
+        self.set_seed()
+        actual = gumbel(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc * 3, bad_scale)
+
+        self.set_seed()
+        actual = gumbel(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, gumbel, loc, bad_scale * 3)
+
+    def test_logistic(self):
+        loc = [0]
+        scale = [1]
+        bad_scale = [-1]
+        logistic = random.logistic
+        desired = np.array([0.13152135837586171,
+                            0.13675915696285773,
+                            0.038216792802833396])
+
+        self.set_seed()
+        actual = logistic(loc * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, logistic, loc * 3, bad_scale)
+
+        self.set_seed()
+        actual = logistic(loc, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, logistic, loc, bad_scale * 3)
+        assert_equal(random.logistic(1.0, 0.0), 1.0)
+
+    def test_lognormal(self):
+        mean = [0]
+        sigma = [1]
+        bad_sigma = [-1]
+        lognormal = random.lognormal
+        desired = np.array([9.1422086044848427,
+                            8.4013952870126261,
+                            6.3073234116578671])
+
+        self.set_seed()
+        actual = lognormal(mean * 3, sigma)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, lognormal, mean * 3, bad_sigma)
+        assert_raises(ValueError, random.lognormal, mean * 3, bad_sigma)
+
+        self.set_seed()
+        actual = lognormal(mean, sigma * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, lognormal, mean, bad_sigma * 3)
+        assert_raises(ValueError, random.lognormal, mean, bad_sigma * 3)
+
+    def test_rayleigh(self):
+        scale = [1]
+        bad_scale = [-1]
+        rayleigh = random.rayleigh
+        desired = np.array([1.2337491937897689,
+                            1.2360119924878694,
+                            1.1936818095781789])
+
+        self.set_seed()
+        actual = rayleigh(scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, rayleigh, bad_scale * 3)
+
+    def test_wald(self):
+        mean = [0.5]
+        scale = [1]
+        bad_mean = [0]
+        bad_scale = [-2]
+        wald = random.wald
+        desired = np.array([0.11873681120271318,
+                            0.12450084820795027,
+                            0.9096122728408238])
+
+        self.set_seed()
+        actual = wald(mean * 3, scale)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, wald, bad_mean * 3, scale)
+        assert_raises(ValueError, wald, mean * 3, bad_scale)
+        assert_raises(ValueError, random.wald, bad_mean * 3, scale)
+        assert_raises(ValueError, random.wald, mean * 3, bad_scale)
+
+        self.set_seed()
+        actual = wald(mean, scale * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, wald, bad_mean, scale * 3)
+        assert_raises(ValueError, wald, mean, bad_scale * 3)
+        assert_raises(ValueError, wald, 0.0, 1)
+        assert_raises(ValueError, wald, 0.5, 0.0)
+
+    def test_triangular(self):
+        left = [1]
+        right = [3]
+        mode = [2]
+        bad_left_one = [3]
+        bad_mode_one = [4]
+        bad_left_two, bad_mode_two = right * 2
+        triangular = random.triangular
+        desired = np.array([2.03339048710429,
+                            2.0347400359389356,
+                            2.0095991069536208])
+
+        self.set_seed()
+        actual = triangular(left * 3, mode, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one * 3, mode, right)
+        assert_raises(ValueError, triangular, left * 3, bad_mode_one, right)
+        assert_raises(ValueError, triangular, bad_left_two * 3, bad_mode_two,
+                      right)
+
+        self.set_seed()
+        actual = triangular(left, mode * 3, right)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode * 3, right)
+        assert_raises(ValueError, triangular, left, bad_mode_one * 3, right)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two * 3,
+                      right)
+
+        self.set_seed()
+        actual = triangular(left, mode, right * 3)
+        assert_array_almost_equal(actual, desired, decimal=14)
+        assert_raises(ValueError, triangular, bad_left_one, mode, right * 3)
+        assert_raises(ValueError, triangular, left, bad_mode_one, right * 3)
+        assert_raises(ValueError, triangular, bad_left_two, bad_mode_two,
+                      right * 3)
+
+        assert_raises(ValueError, triangular, 10., 0., 20.)
+        assert_raises(ValueError, triangular, 10., 25., 20.)
+        assert_raises(ValueError, triangular, 10., 10., 10.)
+
+    def test_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        binom = random.binomial
+        desired = np.array([1, 1, 1])
+
+        self.set_seed()
+        actual = binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n * 3, p)
+        assert_raises(ValueError, binom, n * 3, bad_p_one)
+        assert_raises(ValueError, binom, n * 3, bad_p_two)
+
+        self.set_seed()
+        actual = binom(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, binom, bad_n, p * 3)
+        assert_raises(ValueError, binom, n, bad_p_one * 3)
+        assert_raises(ValueError, binom, n, bad_p_two * 3)
+
+    def test_negative_binomial(self):
+        n = [1]
+        p = [0.5]
+        bad_n = [-1]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        neg_binom = random.negative_binomial
+        desired = np.array([1, 0, 1])
+
+        self.set_seed()
+        actual = neg_binom(n * 3, p)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n * 3, p)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_one)
+        assert_raises(ValueError, neg_binom, n * 3, bad_p_two)
+
+        self.set_seed()
+        actual = neg_binom(n, p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, neg_binom, bad_n, p * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_one * 3)
+        assert_raises(ValueError, neg_binom, n, bad_p_two * 3)
+
+    def test_poisson(self):
+        max_lam = random.RandomState()._poisson_lam_max
+
+        lam = [1]
+        bad_lam_one = [-1]
+        bad_lam_two = [max_lam * 2]
+        poisson = random.poisson
+        desired = np.array([1, 1, 0])
+
+        self.set_seed()
+        actual = poisson(lam * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, poisson, bad_lam_one * 3)
+        assert_raises(ValueError, poisson, bad_lam_two * 3)
+
+    def test_zipf(self):
+        a = [2]
+        bad_a = [0]
+        zipf = random.zipf
+        desired = np.array([2, 2, 1])
+
+        self.set_seed()
+        actual = zipf(a * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, zipf, bad_a * 3)
+        with np.errstate(invalid='ignore'):
+            assert_raises(ValueError, zipf, np.nan)
+            assert_raises(ValueError, zipf, [0, 0, np.nan])
+
+    def test_geometric(self):
+        p = [0.5]
+        bad_p_one = [-1]
+        bad_p_two = [1.5]
+        geom = random.geometric
+        desired = np.array([2, 2, 2])
+
+        self.set_seed()
+        actual = geom(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, geom, bad_p_one * 3)
+        assert_raises(ValueError, geom, bad_p_two * 3)
+
+    def test_hypergeometric(self):
+        ngood = [1]
+        nbad = [2]
+        nsample = [2]
+        bad_ngood = [-1]
+        bad_nbad = [-2]
+        bad_nsample_one = [0]
+        bad_nsample_two = [4]
+        hypergeom = random.hypergeometric
+        desired = np.array([1, 1, 1])
+
+        self.set_seed()
+        actual = hypergeom(ngood * 3, nbad, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood * 3, nbad, nsample)
+        assert_raises(ValueError, hypergeom, ngood * 3, bad_nbad, nsample)
+        assert_raises(ValueError, hypergeom, ngood * 3, nbad, bad_nsample_one)
+        assert_raises(ValueError, hypergeom, ngood * 3, nbad, bad_nsample_two)
+
+        self.set_seed()
+        actual = hypergeom(ngood, nbad * 3, nsample)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood, nbad * 3, nsample)
+        assert_raises(ValueError, hypergeom, ngood, bad_nbad * 3, nsample)
+        assert_raises(ValueError, hypergeom, ngood, nbad * 3, bad_nsample_one)
+        assert_raises(ValueError, hypergeom, ngood, nbad * 3, bad_nsample_two)
+
+        self.set_seed()
+        actual = hypergeom(ngood, nbad, nsample * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, hypergeom, bad_ngood, nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, bad_nbad, nsample * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_one * 3)
+        assert_raises(ValueError, hypergeom, ngood, nbad, bad_nsample_two * 3)
+
+        assert_raises(ValueError, hypergeom, -1, 10, 20)
+        assert_raises(ValueError, hypergeom, 10, -1, 20)
+        assert_raises(ValueError, hypergeom, 10, 10, 0)
+        assert_raises(ValueError, hypergeom, 10, 10, 25)
+
+    def test_logseries(self):
+        p = [0.5]
+        bad_p_one = [2]
+        bad_p_two = [-1]
+        logseries = random.logseries
+        desired = np.array([1, 1, 1])
+
+        self.set_seed()
+        actual = logseries(p * 3)
+        assert_array_equal(actual, desired)
+        assert_raises(ValueError, logseries, bad_p_one * 3)
+        assert_raises(ValueError, logseries, bad_p_two * 3)
+
+
+class TestThread:
+    # make sure each state produces the same sequence even in threads
+    def setup(self):
+        self.seeds = range(4)
+
+    def check_function(self, function, sz):
+        from threading import Thread
+
+        out1 = np.empty((len(self.seeds),) + sz)
+        out2 = np.empty((len(self.seeds),) + sz)
+
+        # threaded generation
+        t = [Thread(target=function, args=(random.RandomState(s), o))
+             for s, o in zip(self.seeds, out1)]
+        [x.start() for x in t]
+        [x.join() for x in t]
+
+        # the same serial
+        for s, o in zip(self.seeds, out2):
+            function(random.RandomState(s), o)
+
+        # these platforms change x87 fpu precision mode in threads
+        if np.intp().dtype.itemsize == 4 and sys.platform == "win32":
+            assert_array_almost_equal(out1, out2)
+        else:
+            assert_array_equal(out1, out2)
+
+    def test_normal(self):
+        def gen_random(state, out):
+            out[...] = state.normal(size=10000)
+
+        self.check_function(gen_random, sz=(10000,))
+
+    def test_exp(self):
+        def gen_random(state, out):
+            out[...] = state.exponential(scale=np.ones((100, 1000)))
+
+        self.check_function(gen_random, sz=(100, 1000))
+
+    def test_multinomial(self):
+        def gen_random(state, out):
+            out[...] = state.multinomial(10, [1 / 6.] * 6, size=10000)
+
+        self.check_function(gen_random, sz=(10000, 6))
+
+
+# See Issue #4263
+class TestSingleEltArrayInput:
+    def setup(self):
+        self.argOne = np.array([2])
+        self.argTwo = np.array([3])
+        self.argThree = np.array([4])
+        self.tgtShape = (1,)
+
+    def test_one_arg_funcs(self):
+        funcs = (random.exponential, random.standard_gamma,
+                 random.chisquare, random.standard_t,
+                 random.pareto, random.weibull,
+                 random.power, random.rayleigh,
+                 random.poisson, random.zipf,
+                 random.geometric, random.logseries)
+
+        probfuncs = (random.geometric, random.logseries)
+
+        for func in funcs:
+            if func in probfuncs:  # p < 1.0
+                out = func(np.array([0.5]))
+
+            else:
+                out = func(self.argOne)
+
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_two_arg_funcs(self):
+        funcs = (random.uniform, random.normal,
+                 random.beta, random.gamma,
+                 random.f, random.noncentral_chisquare,
+                 random.vonmises, random.laplace,
+                 random.gumbel, random.logistic,
+                 random.lognormal, random.wald,
+                 random.binomial, random.negative_binomial)
+
+        probfuncs = (random.binomial, random.negative_binomial)
+
+        for func in funcs:
+            if func in probfuncs:  # p <= 1
+                argTwo = np.array([0.5])
+
+            else:
+                argTwo = self.argTwo
+
+            out = func(self.argOne, argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], argTwo)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, argTwo[0])
+            assert_equal(out.shape, self.tgtShape)
+
+    def test_three_arg_funcs(self):
+        funcs = [random.noncentral_f, random.triangular,
+                 random.hypergeometric]
+
+        for func in funcs:
+            out = func(self.argOne, self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne[0], self.argTwo, self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+            out = func(self.argOne, self.argTwo[0], self.argThree)
+            assert_equal(out.shape, self.tgtShape)
+
+
+# Ensure returned array dtype is correct for platform
+def test_integer_dtype(int_func):
+    random.seed(123456789)
+    fname, args, md5 = int_func
+    f = getattr(random, fname)
+    actual = f(*args, size=2)
+    assert_(actual.dtype == np.dtype('l'))
+
+
+def test_integer_repeat(int_func):
+    random.seed(123456789)
+    fname, args, md5 = int_func
+    f = getattr(random, fname)
+    val = f(*args, size=1000000)
+    if sys.byteorder != 'little':
+        val = val.byteswap()
+    res = hashlib.md5(val.view(np.int8)).hexdigest()
+    assert_(res == md5)
+
+
+def test_broadcast_size_error():
+    # GH-16833
+    with pytest.raises(ValueError):
+        random.binomial(1, [0.3, 0.7], size=(2, 1))
+    with pytest.raises(ValueError):
+        random.binomial([1, 2], 0.3, size=(2, 1))
+    with pytest.raises(ValueError):
+        random.binomial([1, 2], [0.3, 0.7], size=(2, 1))
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_randomstate_regression.py b/venv/Lib/site-packages/numpy/random/tests/test_randomstate_regression.py
new file mode 100644
index 000000000..4eb82fc4c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_randomstate_regression.py
@@ -0,0 +1,203 @@
+import sys
+
+import pytest
+
+from numpy.testing import (
+    assert_, assert_array_equal, assert_raises,
+    )
+import numpy as np
+
+from numpy import random
+
+
+class TestRegression:
+
+    def test_VonMises_range(self):
+        # Make sure generated random variables are in [-pi, pi].
+        # Regression test for ticket #986.
+        for mu in np.linspace(-7., 7., 5):
+            r = random.vonmises(mu, 1, 50)
+            assert_(np.all(r > -np.pi) and np.all(r <= np.pi))
+
+    def test_hypergeometric_range(self):
+        # Test for ticket #921
+        assert_(np.all(random.hypergeometric(3, 18, 11, size=10) < 4))
+        assert_(np.all(random.hypergeometric(18, 3, 11, size=10) > 0))
+
+        # Test for ticket #5623
+        args = [
+            (2**20 - 2, 2**20 - 2, 2**20 - 2),  # Check for 32-bit systems
+        ]
+        is_64bits = sys.maxsize > 2**32
+        if is_64bits and sys.platform != 'win32':
+            # Check for 64-bit systems
+            args.append((2**40 - 2, 2**40 - 2, 2**40 - 2))
+        for arg in args:
+            assert_(random.hypergeometric(*arg) > 0)
+
+    def test_logseries_convergence(self):
+        # Test for ticket #923
+        N = 1000
+        random.seed(0)
+        rvsn = random.logseries(0.8, size=N)
+        # these two frequency counts should be close to theoretical
+        # numbers with this large sample
+        # theoretical large N result is 0.49706795
+        freq = np.sum(rvsn == 1) / float(N)
+        msg = "Frequency was %f, should be > 0.45" % freq
+        assert_(freq > 0.45, msg)
+        # theoretical large N result is 0.19882718
+        freq = np.sum(rvsn == 2) / float(N)
+        msg = "Frequency was %f, should be < 0.23" % freq
+        assert_(freq < 0.23, msg)
+
+    def test_shuffle_mixed_dimension(self):
+        # Test for trac ticket #2074
+        for t in [[1, 2, 3, None],
+                  [(1, 1), (2, 2), (3, 3), None],
+                  [1, (2, 2), (3, 3), None],
+                  [(1, 1), 2, 3, None]]:
+            random.seed(12345)
+            shuffled = list(t)
+            random.shuffle(shuffled)
+            expected = np.array([t[0], t[3], t[1], t[2]], dtype=object)
+            assert_array_equal(np.array(shuffled, dtype=object), expected)
+
+    def test_call_within_randomstate(self):
+        # Check that custom RandomState does not call into global state
+        m = random.RandomState()
+        res = np.array([0, 8, 7, 2, 1, 9, 4, 7, 0, 3])
+        for i in range(3):
+            random.seed(i)
+            m.seed(4321)
+            # If m.state is not honored, the result will change
+            assert_array_equal(m.choice(10, size=10, p=np.ones(10)/10.), res)
+
+    def test_multivariate_normal_size_types(self):
+        # Test for multivariate_normal issue with 'size' argument.
+        # Check that the multivariate_normal size argument can be a
+        # numpy integer.
+        random.multivariate_normal([0], [[0]], size=1)
+        random.multivariate_normal([0], [[0]], size=np.int_(1))
+        random.multivariate_normal([0], [[0]], size=np.int64(1))
+
+    def test_beta_small_parameters(self):
+        # Test that beta with small a and b parameters does not produce
+        # NaNs due to roundoff errors causing 0 / 0, gh-5851
+        random.seed(1234567890)
+        x = random.beta(0.0001, 0.0001, size=100)
+        assert_(not np.any(np.isnan(x)), 'Nans in random.beta')
+
+    def test_choice_sum_of_probs_tolerance(self):
+        # The sum of probs should be 1.0 with some tolerance.
+        # For low precision dtypes the tolerance was too tight.
+        # See numpy github issue 6123.
+        random.seed(1234)
+        a = [1, 2, 3]
+        counts = [4, 4, 2]
+        for dt in np.float16, np.float32, np.float64:
+            probs = np.array(counts, dtype=dt) / sum(counts)
+            c = random.choice(a, p=probs)
+            assert_(c in a)
+            assert_raises(ValueError, random.choice, a, p=probs*0.9)
+
+    def test_shuffle_of_array_of_different_length_strings(self):
+        # Test that permuting an array of different length strings
+        # will not cause a segfault on garbage collection
+        # Tests gh-7710
+        random.seed(1234)
+
+        a = np.array(['a', 'a' * 1000])
+
+        for _ in range(100):
+            random.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_shuffle_of_array_of_objects(self):
+        # Test that permuting an array of objects will not cause
+        # a segfault on garbage collection.
+        # See gh-7719
+        random.seed(1234)
+        a = np.array([np.arange(1), np.arange(4)], dtype=object)
+
+        for _ in range(1000):
+            random.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_permutation_subclass(self):
+        class N(np.ndarray):
+            pass
+
+        random.seed(1)
+        orig = np.arange(3).view(N)
+        perm = random.permutation(orig)
+        assert_array_equal(perm, np.array([0, 2, 1]))
+        assert_array_equal(orig, np.arange(3).view(N))
+
+        class M:
+            a = np.arange(5)
+
+            def __array__(self):
+                return self.a
+
+        random.seed(1)
+        m = M()
+        perm = random.permutation(m)
+        assert_array_equal(perm, np.array([2, 1, 4, 0, 3]))
+        assert_array_equal(m.__array__(), np.arange(5))
+
+    def test_warns_byteorder(self):
+        # GH 13159
+        other_byteord_dt = '<i4' if sys.byteorder == 'big' else '>i4'
+        with pytest.deprecated_call(match='non-native byteorder is not'):
+            random.randint(0, 200, size=10, dtype=other_byteord_dt)
+
+    def test_named_argument_initialization(self):
+        # GH 13669
+        rs1 = np.random.RandomState(123456789)
+        rs2 = np.random.RandomState(seed=123456789)
+        assert rs1.randint(0, 100) == rs2.randint(0, 100)
+
+    def test_choice_retun_dtype(self):
+        # GH 9867
+        c = np.random.choice(10, p=[.1]*10, size=2)
+        assert c.dtype == np.dtype(int)
+        c = np.random.choice(10, p=[.1]*10, replace=False, size=2)
+        assert c.dtype == np.dtype(int)
+        c = np.random.choice(10, size=2)
+        assert c.dtype == np.dtype(int)
+        c = np.random.choice(10, replace=False, size=2)
+        assert c.dtype == np.dtype(int)
+
+    @pytest.mark.skipif(np.iinfo('l').max < 2**32,
+                        reason='Cannot test with 32-bit C long')
+    def test_randint_117(self):
+        # GH 14189
+        random.seed(0)
+        expected = np.array([2357136044, 2546248239, 3071714933, 3626093760,
+                             2588848963, 3684848379, 2340255427, 3638918503,
+                             1819583497, 2678185683], dtype='int64')
+        actual = random.randint(2**32, size=10)
+        assert_array_equal(actual, expected)
+
+    def test_p_zero_stream(self):
+        # Regression test for gh-14522.  Ensure that future versions
+        # generate the same variates as version 1.16.
+        np.random.seed(12345)
+        assert_array_equal(random.binomial(1, [0, 0.25, 0.5, 0.75, 1]),
+                           [0, 0, 0, 1, 1])
+
+    def test_n_zero_stream(self):
+        # Regression test for gh-14522.  Ensure that future versions
+        # generate the same variates as version 1.16.
+        np.random.seed(8675309)
+        expected = np.array([[0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+                             [3, 4, 2, 3, 3, 1, 5, 3, 1, 3]])
+        assert_array_equal(random.binomial([[0], [10]], 0.25, size=(2, 10)),
+                           expected)
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_regression.py b/venv/Lib/site-packages/numpy/random/tests/test_regression.py
new file mode 100644
index 000000000..278622287
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_regression.py
@@ -0,0 +1,149 @@
+import sys
+from numpy.testing import (
+    assert_, assert_array_equal, assert_raises,
+    )
+from numpy import random
+import numpy as np
+
+
+class TestRegression:
+
+    def test_VonMises_range(self):
+        # Make sure generated random variables are in [-pi, pi].
+        # Regression test for ticket #986.
+        for mu in np.linspace(-7., 7., 5):
+            r = random.mtrand.vonmises(mu, 1, 50)
+            assert_(np.all(r > -np.pi) and np.all(r <= np.pi))
+
+    def test_hypergeometric_range(self):
+        # Test for ticket #921
+        assert_(np.all(np.random.hypergeometric(3, 18, 11, size=10) < 4))
+        assert_(np.all(np.random.hypergeometric(18, 3, 11, size=10) > 0))
+
+        # Test for ticket #5623
+        args = [
+            (2**20 - 2, 2**20 - 2, 2**20 - 2),  # Check for 32-bit systems
+        ]
+        is_64bits = sys.maxsize > 2**32
+        if is_64bits and sys.platform != 'win32':
+            # Check for 64-bit systems
+            args.append((2**40 - 2, 2**40 - 2, 2**40 - 2))
+        for arg in args:
+            assert_(np.random.hypergeometric(*arg) > 0)
+
+    def test_logseries_convergence(self):
+        # Test for ticket #923
+        N = 1000
+        np.random.seed(0)
+        rvsn = np.random.logseries(0.8, size=N)
+        # these two frequency counts should be close to theoretical
+        # numbers with this large sample
+        # theoretical large N result is 0.49706795
+        freq = np.sum(rvsn == 1) / float(N)
+        msg = "Frequency was %f, should be > 0.45" % freq
+        assert_(freq > 0.45, msg)
+        # theoretical large N result is 0.19882718
+        freq = np.sum(rvsn == 2) / float(N)
+        msg = "Frequency was %f, should be < 0.23" % freq
+        assert_(freq < 0.23, msg)
+
+    def test_shuffle_mixed_dimension(self):
+        # Test for trac ticket #2074
+        for t in [[1, 2, 3, None],
+                  [(1, 1), (2, 2), (3, 3), None],
+                  [1, (2, 2), (3, 3), None],
+                  [(1, 1), 2, 3, None]]:
+            np.random.seed(12345)
+            shuffled = list(t)
+            random.shuffle(shuffled)
+            expected = np.array([t[0], t[3], t[1], t[2]], dtype=object)
+            assert_array_equal(np.array(shuffled, dtype=object), expected)
+
+    def test_call_within_randomstate(self):
+        # Check that custom RandomState does not call into global state
+        m = np.random.RandomState()
+        res = np.array([0, 8, 7, 2, 1, 9, 4, 7, 0, 3])
+        for i in range(3):
+            np.random.seed(i)
+            m.seed(4321)
+            # If m.state is not honored, the result will change
+            assert_array_equal(m.choice(10, size=10, p=np.ones(10)/10.), res)
+
+    def test_multivariate_normal_size_types(self):
+        # Test for multivariate_normal issue with 'size' argument.
+        # Check that the multivariate_normal size argument can be a
+        # numpy integer.
+        np.random.multivariate_normal([0], [[0]], size=1)
+        np.random.multivariate_normal([0], [[0]], size=np.int_(1))
+        np.random.multivariate_normal([0], [[0]], size=np.int64(1))
+
+    def test_beta_small_parameters(self):
+        # Test that beta with small a and b parameters does not produce
+        # NaNs due to roundoff errors causing 0 / 0, gh-5851
+        np.random.seed(1234567890)
+        x = np.random.beta(0.0001, 0.0001, size=100)
+        assert_(not np.any(np.isnan(x)), 'Nans in np.random.beta')
+
+    def test_choice_sum_of_probs_tolerance(self):
+        # The sum of probs should be 1.0 with some tolerance.
+        # For low precision dtypes the tolerance was too tight.
+        # See numpy github issue 6123.
+        np.random.seed(1234)
+        a = [1, 2, 3]
+        counts = [4, 4, 2]
+        for dt in np.float16, np.float32, np.float64:
+            probs = np.array(counts, dtype=dt) / sum(counts)
+            c = np.random.choice(a, p=probs)
+            assert_(c in a)
+            assert_raises(ValueError, np.random.choice, a, p=probs*0.9)
+
+    def test_shuffle_of_array_of_different_length_strings(self):
+        # Test that permuting an array of different length strings
+        # will not cause a segfault on garbage collection
+        # Tests gh-7710
+        np.random.seed(1234)
+
+        a = np.array(['a', 'a' * 1000])
+
+        for _ in range(100):
+            np.random.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_shuffle_of_array_of_objects(self):
+        # Test that permuting an array of objects will not cause
+        # a segfault on garbage collection.
+        # See gh-7719
+        np.random.seed(1234)
+        a = np.array([np.arange(1), np.arange(4)], dtype=object)
+
+        for _ in range(1000):
+            np.random.shuffle(a)
+
+        # Force Garbage Collection - should not segfault.
+        import gc
+        gc.collect()
+
+    def test_permutation_subclass(self):
+        class N(np.ndarray):
+            pass
+
+        np.random.seed(1)
+        orig = np.arange(3).view(N)
+        perm = np.random.permutation(orig)
+        assert_array_equal(perm, np.array([0, 2, 1]))
+        assert_array_equal(orig, np.arange(3).view(N))
+
+        class M:
+            a = np.arange(5)
+
+            def __array__(self):
+                return self.a
+
+        np.random.seed(1)
+        m = M()
+        perm = np.random.permutation(m)
+        assert_array_equal(perm, np.array([2, 1, 4, 0, 3]))
+        assert_array_equal(m.__array__(), np.arange(5))
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_seed_sequence.py b/venv/Lib/site-packages/numpy/random/tests/test_seed_sequence.py
new file mode 100644
index 000000000..f08cf80fa
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_seed_sequence.py
@@ -0,0 +1,80 @@
+import numpy as np
+from numpy.testing import assert_array_equal, assert_array_compare
+
+from numpy.random import SeedSequence
+
+
+def test_reference_data():
+    """ Check that SeedSequence generates data the same as the C++ reference.
+
+    https://gist.github.com/imneme/540829265469e673d045
+    """
+    inputs = [
+        [3735928559, 195939070, 229505742, 305419896],
+        [3668361503, 4165561550, 1661411377, 3634257570],
+        [164546577, 4166754639, 1765190214, 1303880213],
+        [446610472, 3941463886, 522937693, 1882353782],
+        [1864922766, 1719732118, 3882010307, 1776744564],
+        [4141682960, 3310988675, 553637289, 902896340],
+        [1134851934, 2352871630, 3699409824, 2648159817],
+        [1240956131, 3107113773, 1283198141, 1924506131],
+        [2669565031, 579818610, 3042504477, 2774880435],
+        [2766103236, 2883057919, 4029656435, 862374500],
+    ]
+    outputs = [
+        [3914649087, 576849849, 3593928901, 2229911004],
+        [2240804226, 3691353228, 1365957195, 2654016646],
+        [3562296087, 3191708229, 1147942216, 3726991905],
+        [1403443605, 3591372999, 1291086759, 441919183],
+        [1086200464, 2191331643, 560336446, 3658716651],
+        [3249937430, 2346751812, 847844327, 2996632307],
+        [2584285912, 4034195531, 3523502488, 169742686],
+        [959045797, 3875435559, 1886309314, 359682705],
+        [3978441347, 432478529, 3223635119, 138903045],
+        [296367413, 4262059219, 13109864, 3283683422],
+    ]
+    outputs64 = [
+        [2477551240072187391, 9577394838764454085],
+        [15854241394484835714, 11398914698975566411],
+        [13708282465491374871, 16007308345579681096],
+        [15424829579845884309, 1898028439751125927],
+        [9411697742461147792, 15714068361935982142],
+        [10079222287618677782, 12870437757549876199],
+        [17326737873898640088, 729039288628699544],
+        [16644868984619524261, 1544825456798124994],
+        [1857481142255628931, 596584038813451439],
+        [18305404959516669237, 14103312907920476776],
+    ]
+    for seed, expected, expected64 in zip(inputs, outputs, outputs64):
+        expected = np.array(expected, dtype=np.uint32)
+        ss = SeedSequence(seed)
+        state = ss.generate_state(len(expected))
+        assert_array_equal(state, expected)
+        state64 = ss.generate_state(len(expected64), dtype=np.uint64)
+        assert_array_equal(state64, expected64)
+
+
+def test_zero_padding():
+    """ Ensure that the implicit zero-padding does not cause problems.
+    """
+    # Ensure that large integers are inserted in little-endian fashion to avoid
+    # trailing 0s.
+    ss0 = SeedSequence(42)
+    ss1 = SeedSequence(42 << 32)
+    assert_array_compare(
+        np.not_equal,
+        ss0.generate_state(4),
+        ss1.generate_state(4))
+
+    # Ensure backwards compatibility with the original 0.17 release for small
+    # integers and no spawn key.
+    expected42 = np.array([3444837047, 2669555309, 2046530742, 3581440988],
+                          dtype=np.uint32)
+    assert_array_equal(SeedSequence(42).generate_state(4), expected42)
+
+    # Regression test for gh-16539 to ensure that the implicit 0s don't
+    # conflict with spawn keys.
+    assert_array_compare(
+        np.not_equal,
+        SeedSequence(42, spawn_key=(0,)).generate_state(4),
+        expected42)
diff --git a/venv/Lib/site-packages/numpy/random/tests/test_smoke.py b/venv/Lib/site-packages/numpy/random/tests/test_smoke.py
new file mode 100644
index 000000000..ebfc6825e
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/random/tests/test_smoke.py
@@ -0,0 +1,807 @@
+import pickle
+from functools import partial
+
+import numpy as np
+import pytest
+from numpy.testing import assert_equal, assert_, assert_array_equal
+from numpy.random import (Generator, MT19937, PCG64, Philox, SFC64)
+
+@pytest.fixture(scope='module',
+                params=(np.bool_, np.int8, np.int16, np.int32, np.int64,
+                        np.uint8, np.uint16, np.uint32, np.uint64))
+def dtype(request):
+    return request.param
+
+
+def params_0(f):
+    val = f()
+    assert_(np.isscalar(val))
+    val = f(10)
+    assert_(val.shape == (10,))
+    val = f((10, 10))
+    assert_(val.shape == (10, 10))
+    val = f((10, 10, 10))
+    assert_(val.shape == (10, 10, 10))
+    val = f(size=(5, 5))
+    assert_(val.shape == (5, 5))
+
+
+def params_1(f, bounded=False):
+    a = 5.0
+    b = np.arange(2.0, 12.0)
+    c = np.arange(2.0, 102.0).reshape((10, 10))
+    d = np.arange(2.0, 1002.0).reshape((10, 10, 10))
+    e = np.array([2.0, 3.0])
+    g = np.arange(2.0, 12.0).reshape((1, 10, 1))
+    if bounded:
+        a = 0.5
+        b = b / (1.5 * b.max())
+        c = c / (1.5 * c.max())
+        d = d / (1.5 * d.max())
+        e = e / (1.5 * e.max())
+        g = g / (1.5 * g.max())
+
+    # Scalar
+    f(a)
+    # Scalar - size
+    f(a, size=(10, 10))
+    # 1d
+    f(b)
+    # 2d
+    f(c)
+    # 3d
+    f(d)
+    # 1d size
+    f(b, size=10)
+    # 2d - size - broadcast
+    f(e, size=(10, 2))
+    # 3d - size
+    f(g, size=(10, 10, 10))
+
+
+def comp_state(state1, state2):
+    identical = True
+    if isinstance(state1, dict):
+        for key in state1:
+            identical &= comp_state(state1[key], state2[key])
+    elif type(state1) != type(state2):
+        identical &= type(state1) == type(state2)
+    else:
+        if (isinstance(state1, (list, tuple, np.ndarray)) and isinstance(
+                state2, (list, tuple, np.ndarray))):
+            for s1, s2 in zip(state1, state2):
+                identical &= comp_state(s1, s2)
+        else:
+            identical &= state1 == state2
+    return identical
+
+
+def warmup(rg, n=None):
+    if n is None:
+        n = 11 + np.random.randint(0, 20)
+    rg.standard_normal(n)
+    rg.standard_normal(n)
+    rg.standard_normal(n, dtype=np.float32)
+    rg.standard_normal(n, dtype=np.float32)
+    rg.integers(0, 2 ** 24, n, dtype=np.uint64)
+    rg.integers(0, 2 ** 48, n, dtype=np.uint64)
+    rg.standard_gamma(11.0, n)
+    rg.standard_gamma(11.0, n, dtype=np.float32)
+    rg.random(n, dtype=np.float64)
+    rg.random(n, dtype=np.float32)
+
+
+class RNG:
+    @classmethod
+    def setup_class(cls):
+        # Overridden in test classes. Place holder to silence IDE noise
+        cls.bit_generator = PCG64
+        cls.advance = None
+        cls.seed = [12345]
+        cls.rg = Generator(cls.bit_generator(*cls.seed))
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 64
+        cls._extra_setup()
+
+    @classmethod
+    def _extra_setup(cls):
+        cls.vec_1d = np.arange(2.0, 102.0)
+        cls.vec_2d = np.arange(2.0, 102.0)[None, :]
+        cls.mat = np.arange(2.0, 102.0, 0.01).reshape((100, 100))
+        cls.seed_error = TypeError
+
+    def _reset_state(self):
+        self.rg.bit_generator.state = self.initial_state
+
+    def test_init(self):
+        rg = Generator(self.bit_generator())
+        state = rg.bit_generator.state
+        rg.standard_normal(1)
+        rg.standard_normal(1)
+        rg.bit_generator.state = state
+        new_state = rg.bit_generator.state
+        assert_(comp_state(state, new_state))
+
+    def test_advance(self):
+        state = self.rg.bit_generator.state
+        if hasattr(self.rg.bit_generator, 'advance'):
+            self.rg.bit_generator.advance(self.advance)
+            assert_(not comp_state(state, self.rg.bit_generator.state))
+        else:
+            bitgen_name = self.rg.bit_generator.__class__.__name__
+            pytest.skip('Advance is not supported by {0}'.format(bitgen_name))
+
+    def test_jump(self):
+        state = self.rg.bit_generator.state
+        if hasattr(self.rg.bit_generator, 'jumped'):
+            bit_gen2 = self.rg.bit_generator.jumped()
+            jumped_state = bit_gen2.state
+            assert_(not comp_state(state, jumped_state))
+            self.rg.random(2 * 3 * 5 * 7 * 11 * 13 * 17)
+            self.rg.bit_generator.state = state
+            bit_gen3 = self.rg.bit_generator.jumped()
+            rejumped_state = bit_gen3.state
+            assert_(comp_state(jumped_state, rejumped_state))
+        else:
+            bitgen_name = self.rg.bit_generator.__class__.__name__
+            if bitgen_name not in ('SFC64',):
+                raise AttributeError('no "jumped" in %s' % bitgen_name)
+            pytest.skip('Jump is not supported by {0}'.format(bitgen_name))
+
+    def test_uniform(self):
+        r = self.rg.uniform(-1.0, 0.0, size=10)
+        assert_(len(r) == 10)
+        assert_((r > -1).all())
+        assert_((r <= 0).all())
+
+    def test_uniform_array(self):
+        r = self.rg.uniform(np.array([-1.0] * 10), 0.0, size=10)
+        assert_(len(r) == 10)
+        assert_((r > -1).all())
+        assert_((r <= 0).all())
+        r = self.rg.uniform(np.array([-1.0] * 10),
+                            np.array([0.0] * 10), size=10)
+        assert_(len(r) == 10)
+        assert_((r > -1).all())
+        assert_((r <= 0).all())
+        r = self.rg.uniform(-1.0, np.array([0.0] * 10), size=10)
+        assert_(len(r) == 10)
+        assert_((r > -1).all())
+        assert_((r <= 0).all())
+
+    def test_random(self):
+        assert_(len(self.rg.random(10)) == 10)
+        params_0(self.rg.random)
+
+    def test_standard_normal_zig(self):
+        assert_(len(self.rg.standard_normal(10)) == 10)
+
+    def test_standard_normal(self):
+        assert_(len(self.rg.standard_normal(10)) == 10)
+        params_0(self.rg.standard_normal)
+
+    def test_standard_gamma(self):
+        assert_(len(self.rg.standard_gamma(10, 10)) == 10)
+        assert_(len(self.rg.standard_gamma(np.array([10] * 10), 10)) == 10)
+        params_1(self.rg.standard_gamma)
+
+    def test_standard_exponential(self):
+        assert_(len(self.rg.standard_exponential(10)) == 10)
+        params_0(self.rg.standard_exponential)
+
+    def test_standard_exponential_float(self):
+        randoms = self.rg.standard_exponential(10, dtype='float32')
+        assert_(len(randoms) == 10)
+        assert randoms.dtype == np.float32
+        params_0(partial(self.rg.standard_exponential, dtype='float32'))
+
+    def test_standard_exponential_float_log(self):
+        randoms = self.rg.standard_exponential(10, dtype='float32',
+                                               method='inv')
+        assert_(len(randoms) == 10)
+        assert randoms.dtype == np.float32
+        params_0(partial(self.rg.standard_exponential, dtype='float32',
+                         method='inv'))
+
+    def test_standard_cauchy(self):
+        assert_(len(self.rg.standard_cauchy(10)) == 10)
+        params_0(self.rg.standard_cauchy)
+
+    def test_standard_t(self):
+        assert_(len(self.rg.standard_t(10, 10)) == 10)
+        params_1(self.rg.standard_t)
+
+    def test_binomial(self):
+        assert_(self.rg.binomial(10, .5) >= 0)
+        assert_(self.rg.binomial(1000, .5) >= 0)
+
+    def test_reset_state(self):
+        state = self.rg.bit_generator.state
+        int_1 = self.rg.integers(2**31)
+        self.rg.bit_generator.state = state
+        int_2 = self.rg.integers(2**31)
+        assert_(int_1 == int_2)
+
+    def test_entropy_init(self):
+        rg = Generator(self.bit_generator())
+        rg2 = Generator(self.bit_generator())
+        assert_(not comp_state(rg.bit_generator.state,
+                               rg2.bit_generator.state))
+
+    def test_seed(self):
+        rg = Generator(self.bit_generator(*self.seed))
+        rg2 = Generator(self.bit_generator(*self.seed))
+        rg.random()
+        rg2.random()
+        assert_(comp_state(rg.bit_generator.state, rg2.bit_generator.state))
+
+    def test_reset_state_gauss(self):
+        rg = Generator(self.bit_generator(*self.seed))
+        rg.standard_normal()
+        state = rg.bit_generator.state
+        n1 = rg.standard_normal(size=10)
+        rg2 = Generator(self.bit_generator())
+        rg2.bit_generator.state = state
+        n2 = rg2.standard_normal(size=10)
+        assert_array_equal(n1, n2)
+
+    def test_reset_state_uint32(self):
+        rg = Generator(self.bit_generator(*self.seed))
+        rg.integers(0, 2 ** 24, 120, dtype=np.uint32)
+        state = rg.bit_generator.state
+        n1 = rg.integers(0, 2 ** 24, 10, dtype=np.uint32)
+        rg2 = Generator(self.bit_generator())
+        rg2.bit_generator.state = state
+        n2 = rg2.integers(0, 2 ** 24, 10, dtype=np.uint32)
+        assert_array_equal(n1, n2)
+
+    def test_reset_state_float(self):
+        rg = Generator(self.bit_generator(*self.seed))
+        rg.random(dtype='float32')
+        state = rg.bit_generator.state
+        n1 = rg.random(size=10, dtype='float32')
+        rg2 = Generator(self.bit_generator())
+        rg2.bit_generator.state = state
+        n2 = rg2.random(size=10, dtype='float32')
+        assert_((n1 == n2).all())
+
+    def test_shuffle(self):
+        original = np.arange(200, 0, -1)
+        permuted = self.rg.permutation(original)
+        assert_((original != permuted).any())
+
+    def test_permutation(self):
+        original = np.arange(200, 0, -1)
+        permuted = self.rg.permutation(original)
+        assert_((original != permuted).any())
+
+    def test_beta(self):
+        vals = self.rg.beta(2.0, 2.0, 10)
+        assert_(len(vals) == 10)
+        vals = self.rg.beta(np.array([2.0] * 10), 2.0)
+        assert_(len(vals) == 10)
+        vals = self.rg.beta(2.0, np.array([2.0] * 10))
+        assert_(len(vals) == 10)
+        vals = self.rg.beta(np.array([2.0] * 10), np.array([2.0] * 10))
+        assert_(len(vals) == 10)
+        vals = self.rg.beta(np.array([2.0] * 10), np.array([[2.0]] * 10))
+        assert_(vals.shape == (10, 10))
+
+    def test_bytes(self):
+        vals = self.rg.bytes(10)
+        assert_(len(vals) == 10)
+
+    def test_chisquare(self):
+        vals = self.rg.chisquare(2.0, 10)
+        assert_(len(vals) == 10)
+        params_1(self.rg.chisquare)
+
+    def test_exponential(self):
+        vals = self.rg.exponential(2.0, 10)
+        assert_(len(vals) == 10)
+        params_1(self.rg.exponential)
+
+    def test_f(self):
+        vals = self.rg.f(3, 1000, 10)
+        assert_(len(vals) == 10)
+
+    def test_gamma(self):
+        vals = self.rg.gamma(3, 2, 10)
+        assert_(len(vals) == 10)
+
+    def test_geometric(self):
+        vals = self.rg.geometric(0.5, 10)
+        assert_(len(vals) == 10)
+        params_1(self.rg.exponential, bounded=True)
+
+    def test_gumbel(self):
+        vals = self.rg.gumbel(2.0, 2.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_laplace(self):
+        vals = self.rg.laplace(2.0, 2.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_logitic(self):
+        vals = self.rg.logistic(2.0, 2.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_logseries(self):
+        vals = self.rg.logseries(0.5, 10)
+        assert_(len(vals) == 10)
+
+    def test_negative_binomial(self):
+        vals = self.rg.negative_binomial(10, 0.2, 10)
+        assert_(len(vals) == 10)
+
+    def test_noncentral_chisquare(self):
+        vals = self.rg.noncentral_chisquare(10, 2, 10)
+        assert_(len(vals) == 10)
+
+    def test_noncentral_f(self):
+        vals = self.rg.noncentral_f(3, 1000, 2, 10)
+        assert_(len(vals) == 10)
+        vals = self.rg.noncentral_f(np.array([3] * 10), 1000, 2)
+        assert_(len(vals) == 10)
+        vals = self.rg.noncentral_f(3, np.array([1000] * 10), 2)
+        assert_(len(vals) == 10)
+        vals = self.rg.noncentral_f(3, 1000, np.array([2] * 10))
+        assert_(len(vals) == 10)
+
+    def test_normal(self):
+        vals = self.rg.normal(10, 0.2, 10)
+        assert_(len(vals) == 10)
+
+    def test_pareto(self):
+        vals = self.rg.pareto(3.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_poisson(self):
+        vals = self.rg.poisson(10, 10)
+        assert_(len(vals) == 10)
+        vals = self.rg.poisson(np.array([10] * 10))
+        assert_(len(vals) == 10)
+        params_1(self.rg.poisson)
+
+    def test_power(self):
+        vals = self.rg.power(0.2, 10)
+        assert_(len(vals) == 10)
+
+    def test_integers(self):
+        vals = self.rg.integers(10, 20, 10)
+        assert_(len(vals) == 10)
+
+    def test_rayleigh(self):
+        vals = self.rg.rayleigh(0.2, 10)
+        assert_(len(vals) == 10)
+        params_1(self.rg.rayleigh, bounded=True)
+
+    def test_vonmises(self):
+        vals = self.rg.vonmises(10, 0.2, 10)
+        assert_(len(vals) == 10)
+
+    def test_wald(self):
+        vals = self.rg.wald(1.0, 1.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_weibull(self):
+        vals = self.rg.weibull(1.0, 10)
+        assert_(len(vals) == 10)
+
+    def test_zipf(self):
+        vals = self.rg.zipf(10, 10)
+        assert_(len(vals) == 10)
+        vals = self.rg.zipf(self.vec_1d)
+        assert_(len(vals) == 100)
+        vals = self.rg.zipf(self.vec_2d)
+        assert_(vals.shape == (1, 100))
+        vals = self.rg.zipf(self.mat)
+        assert_(vals.shape == (100, 100))
+
+    def test_hypergeometric(self):
+        vals = self.rg.hypergeometric(25, 25, 20)
+        assert_(np.isscalar(vals))
+        vals = self.rg.hypergeometric(np.array([25] * 10), 25, 20)
+        assert_(vals.shape == (10,))
+
+    def test_triangular(self):
+        vals = self.rg.triangular(-5, 0, 5)
+        assert_(np.isscalar(vals))
+        vals = self.rg.triangular(-5, np.array([0] * 10), 5)
+        assert_(vals.shape == (10,))
+
+    def test_multivariate_normal(self):
+        mean = [0, 0]
+        cov = [[1, 0], [0, 100]]  # diagonal covariance
+        x = self.rg.multivariate_normal(mean, cov, 5000)
+        assert_(x.shape == (5000, 2))
+        x_zig = self.rg.multivariate_normal(mean, cov, 5000)
+        assert_(x.shape == (5000, 2))
+        x_inv = self.rg.multivariate_normal(mean, cov, 5000)
+        assert_(x.shape == (5000, 2))
+        assert_((x_zig != x_inv).any())
+
+    def test_multinomial(self):
+        vals = self.rg.multinomial(100, [1.0 / 3, 2.0 / 3])
+        assert_(vals.shape == (2,))
+        vals = self.rg.multinomial(100, [1.0 / 3, 2.0 / 3], size=10)
+        assert_(vals.shape == (10, 2))
+
+    def test_dirichlet(self):
+        s = self.rg.dirichlet((10, 5, 3), 20)
+        assert_(s.shape == (20, 3))
+
+    def test_pickle(self):
+        pick = pickle.dumps(self.rg)
+        unpick = pickle.loads(pick)
+        assert_((type(self.rg) == type(unpick)))
+        assert_(comp_state(self.rg.bit_generator.state,
+                           unpick.bit_generator.state))
+
+        pick = pickle.dumps(self.rg)
+        unpick = pickle.loads(pick)
+        assert_((type(self.rg) == type(unpick)))
+        assert_(comp_state(self.rg.bit_generator.state,
+                           unpick.bit_generator.state))
+
+    def test_seed_array(self):
+        if self.seed_vector_bits is None:
+            bitgen_name = self.bit_generator.__name__
+            pytest.skip('Vector seeding is not supported by '
+                        '{0}'.format(bitgen_name))
+
+        if self.seed_vector_bits == 32:
+            dtype = np.uint32
+        else:
+            dtype = np.uint64
+        seed = np.array([1], dtype=dtype)
+        bg = self.bit_generator(seed)
+        state1 = bg.state
+        bg = self.bit_generator(1)
+        state2 = bg.state
+        assert_(comp_state(state1, state2))
+
+        seed = np.arange(4, dtype=dtype)
+        bg = self.bit_generator(seed)
+        state1 = bg.state
+        bg = self.bit_generator(seed[0])
+        state2 = bg.state
+        assert_(not comp_state(state1, state2))
+
+        seed = np.arange(1500, dtype=dtype)
+        bg = self.bit_generator(seed)
+        state1 = bg.state
+        bg = self.bit_generator(seed[0])
+        state2 = bg.state
+        assert_(not comp_state(state1, state2))
+
+        seed = 2 ** np.mod(np.arange(1500, dtype=dtype),
+                           self.seed_vector_bits - 1) + 1
+        bg = self.bit_generator(seed)
+        state1 = bg.state
+        bg  = self.bit_generator(seed[0])
+        state2 = bg.state
+        assert_(not comp_state(state1, state2))
+
+    def test_uniform_float(self):
+        rg = Generator(self.bit_generator(12345))
+        warmup(rg)
+        state = rg.bit_generator.state
+        r1 = rg.random(11, dtype=np.float32)
+        rg2 = Generator(self.bit_generator())
+        warmup(rg2)
+        rg2.bit_generator.state = state
+        r2 = rg2.random(11, dtype=np.float32)
+        assert_array_equal(r1, r2)
+        assert_equal(r1.dtype, np.float32)
+        assert_(comp_state(rg.bit_generator.state, rg2.bit_generator.state))
+
+    def test_gamma_floats(self):
+        rg = Generator(self.bit_generator())
+        warmup(rg)
+        state = rg.bit_generator.state
+        r1 = rg.standard_gamma(4.0, 11, dtype=np.float32)
+        rg2 = Generator(self.bit_generator())
+        warmup(rg2)
+        rg2.bit_generator.state = state
+        r2 = rg2.standard_gamma(4.0, 11, dtype=np.float32)
+        assert_array_equal(r1, r2)
+        assert_equal(r1.dtype, np.float32)
+        assert_(comp_state(rg.bit_generator.state, rg2.bit_generator.state))
+
+    def test_normal_floats(self):
+        rg = Generator(self.bit_generator())
+        warmup(rg)
+        state = rg.bit_generator.state
+        r1 = rg.standard_normal(11, dtype=np.float32)
+        rg2 = Generator(self.bit_generator())
+        warmup(rg2)
+        rg2.bit_generator.state = state
+        r2 = rg2.standard_normal(11, dtype=np.float32)
+        assert_array_equal(r1, r2)
+        assert_equal(r1.dtype, np.float32)
+        assert_(comp_state(rg.bit_generator.state, rg2.bit_generator.state))
+
+    def test_normal_zig_floats(self):
+        rg = Generator(self.bit_generator())
+        warmup(rg)
+        state = rg.bit_generator.state
+        r1 = rg.standard_normal(11, dtype=np.float32)
+        rg2 = Generator(self.bit_generator())
+        warmup(rg2)
+        rg2.bit_generator.state = state
+        r2 = rg2.standard_normal(11, dtype=np.float32)
+        assert_array_equal(r1, r2)
+        assert_equal(r1.dtype, np.float32)
+        assert_(comp_state(rg.bit_generator.state, rg2.bit_generator.state))
+
+    def test_output_fill(self):
+        rg = self.rg
+        state = rg.bit_generator.state
+        size = (31, 7, 97)
+        existing = np.empty(size)
+        rg.bit_generator.state = state
+        rg.standard_normal(out=existing)
+        rg.bit_generator.state = state
+        direct = rg.standard_normal(size=size)
+        assert_equal(direct, existing)
+
+        sized = np.empty(size)
+        rg.bit_generator.state = state
+        rg.standard_normal(out=sized, size=sized.shape)
+
+        existing = np.empty(size, dtype=np.float32)
+        rg.bit_generator.state = state
+        rg.standard_normal(out=existing, dtype=np.float32)
+        rg.bit_generator.state = state
+        direct = rg.standard_normal(size=size, dtype=np.float32)
+        assert_equal(direct, existing)
+
+    def test_output_filling_uniform(self):
+        rg = self.rg
+        state = rg.bit_generator.state
+        size = (31, 7, 97)
+        existing = np.empty(size)
+        rg.bit_generator.state = state
+        rg.random(out=existing)
+        rg.bit_generator.state = state
+        direct = rg.random(size=size)
+        assert_equal(direct, existing)
+
+        existing = np.empty(size, dtype=np.float32)
+        rg.bit_generator.state = state
+        rg.random(out=existing, dtype=np.float32)
+        rg.bit_generator.state = state
+        direct = rg.random(size=size, dtype=np.float32)
+        assert_equal(direct, existing)
+
+    def test_output_filling_exponential(self):
+        rg = self.rg
+        state = rg.bit_generator.state
+        size = (31, 7, 97)
+        existing = np.empty(size)
+        rg.bit_generator.state = state
+        rg.standard_exponential(out=existing)
+        rg.bit_generator.state = state
+        direct = rg.standard_exponential(size=size)
+        assert_equal(direct, existing)
+
+        existing = np.empty(size, dtype=np.float32)
+        rg.bit_generator.state = state
+        rg.standard_exponential(out=existing, dtype=np.float32)
+        rg.bit_generator.state = state
+        direct = rg.standard_exponential(size=size, dtype=np.float32)
+        assert_equal(direct, existing)
+
+    def test_output_filling_gamma(self):
+        rg = self.rg
+        state = rg.bit_generator.state
+        size = (31, 7, 97)
+        existing = np.zeros(size)
+        rg.bit_generator.state = state
+        rg.standard_gamma(1.0, out=existing)
+        rg.bit_generator.state = state
+        direct = rg.standard_gamma(1.0, size=size)
+        assert_equal(direct, existing)
+
+        existing = np.zeros(size, dtype=np.float32)
+        rg.bit_generator.state = state
+        rg.standard_gamma(1.0, out=existing, dtype=np.float32)
+        rg.bit_generator.state = state
+        direct = rg.standard_gamma(1.0, size=size, dtype=np.float32)
+        assert_equal(direct, existing)
+
+    def test_output_filling_gamma_broadcast(self):
+        rg = self.rg
+        state = rg.bit_generator.state
+        size = (31, 7, 97)
+        mu = np.arange(97.0) + 1.0
+        existing = np.zeros(size)
+        rg.bit_generator.state = state
+        rg.standard_gamma(mu, out=existing)
+        rg.bit_generator.state = state
+        direct = rg.standard_gamma(mu, size=size)
+        assert_equal(direct, existing)
+
+        existing = np.zeros(size, dtype=np.float32)
+        rg.bit_generator.state = state
+        rg.standard_gamma(mu, out=existing, dtype=np.float32)
+        rg.bit_generator.state = state
+        direct = rg.standard_gamma(mu, size=size, dtype=np.float32)
+        assert_equal(direct, existing)
+
+    def test_output_fill_error(self):
+        rg = self.rg
+        size = (31, 7, 97)
+        existing = np.empty(size)
+        with pytest.raises(TypeError):
+            rg.standard_normal(out=existing, dtype=np.float32)
+        with pytest.raises(ValueError):
+            rg.standard_normal(out=existing[::3])
+        existing = np.empty(size, dtype=np.float32)
+        with pytest.raises(TypeError):
+            rg.standard_normal(out=existing, dtype=np.float64)
+
+        existing = np.zeros(size, dtype=np.float32)
+        with pytest.raises(TypeError):
+            rg.standard_gamma(1.0, out=existing, dtype=np.float64)
+        with pytest.raises(ValueError):
+            rg.standard_gamma(1.0, out=existing[::3], dtype=np.float32)
+        existing = np.zeros(size, dtype=np.float64)
+        with pytest.raises(TypeError):
+            rg.standard_gamma(1.0, out=existing, dtype=np.float32)
+        with pytest.raises(ValueError):
+            rg.standard_gamma(1.0, out=existing[::3])
+
+    def test_integers_broadcast(self, dtype):
+        if dtype == np.bool_:
+            upper = 2
+            lower = 0
+        else:
+            info = np.iinfo(dtype)
+            upper = int(info.max) + 1
+            lower = info.min
+        self._reset_state()
+        a = self.rg.integers(lower, [upper] * 10, dtype=dtype)
+        self._reset_state()
+        b = self.rg.integers([lower] * 10, upper, dtype=dtype)
+        assert_equal(a, b)
+        self._reset_state()
+        c = self.rg.integers(lower, upper, size=10, dtype=dtype)
+        assert_equal(a, c)
+        self._reset_state()
+        d = self.rg.integers(np.array(
+            [lower] * 10), np.array([upper], dtype=object), size=10,
+            dtype=dtype)
+        assert_equal(a, d)
+        self._reset_state()
+        e = self.rg.integers(
+            np.array([lower] * 10), np.array([upper] * 10), size=10,
+            dtype=dtype)
+        assert_equal(a, e)
+
+        self._reset_state()
+        a = self.rg.integers(0, upper, size=10, dtype=dtype)
+        self._reset_state()
+        b = self.rg.integers([upper] * 10, dtype=dtype)
+        assert_equal(a, b)
+
+    def test_integers_numpy(self, dtype):
+        high = np.array([1])
+        low = np.array([0])
+
+        out = self.rg.integers(low, high, dtype=dtype)
+        assert out.shape == (1,)
+
+        out = self.rg.integers(low[0], high, dtype=dtype)
+        assert out.shape == (1,)
+
+        out = self.rg.integers(low, high[0], dtype=dtype)
+        assert out.shape == (1,)
+
+    def test_integers_broadcast_errors(self, dtype):
+        if dtype == np.bool_:
+            upper = 2
+            lower = 0
+        else:
+            info = np.iinfo(dtype)
+            upper = int(info.max) + 1
+            lower = info.min
+        with pytest.raises(ValueError):
+            self.rg.integers(lower, [upper + 1] * 10, dtype=dtype)
+        with pytest.raises(ValueError):
+            self.rg.integers(lower - 1, [upper] * 10, dtype=dtype)
+        with pytest.raises(ValueError):
+            self.rg.integers([lower - 1], [upper] * 10, dtype=dtype)
+        with pytest.raises(ValueError):
+            self.rg.integers([0], [0], dtype=dtype)
+
+
+class TestMT19937(RNG):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = MT19937
+        cls.advance = None
+        cls.seed = [2 ** 21 + 2 ** 16 + 2 ** 5 + 1]
+        cls.rg = Generator(cls.bit_generator(*cls.seed))
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 32
+        cls._extra_setup()
+        cls.seed_error = ValueError
+
+    def test_numpy_state(self):
+        nprg = np.random.RandomState()
+        nprg.standard_normal(99)
+        state = nprg.get_state()
+        self.rg.bit_generator.state = state
+        state2 = self.rg.bit_generator.state
+        assert_((state[1] == state2['state']['key']).all())
+        assert_((state[2] == state2['state']['pos']))
+
+
+class TestPhilox(RNG):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = Philox
+        cls.advance = 2**63 + 2**31 + 2**15 + 1
+        cls.seed = [12345]
+        cls.rg = Generator(cls.bit_generator(*cls.seed))
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 64
+        cls._extra_setup()
+
+
+class TestSFC64(RNG):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = SFC64
+        cls.advance = None
+        cls.seed = [12345]
+        cls.rg = Generator(cls.bit_generator(*cls.seed))
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 192
+        cls._extra_setup()
+
+
+class TestPCG64(RNG):
+    @classmethod
+    def setup_class(cls):
+        cls.bit_generator = PCG64
+        cls.advance = 2**63 + 2**31 + 2**15 + 1
+        cls.seed = [12345]
+        cls.rg = Generator(cls.bit_generator(*cls.seed))
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 64
+        cls._extra_setup()
+
+
+class TestDefaultRNG(RNG):
+    @classmethod
+    def setup_class(cls):
+        # This will duplicate some tests that directly instantiate a fresh
+        # Generator(), but that's okay.
+        cls.bit_generator = PCG64
+        cls.advance = 2**63 + 2**31 + 2**15 + 1
+        cls.seed = [12345]
+        cls.rg = np.random.default_rng(*cls.seed)
+        cls.initial_state = cls.rg.bit_generator.state
+        cls.seed_vector_bits = 64
+        cls._extra_setup()
+
+    def test_default_is_pcg64(self):
+        # In order to change the default BitGenerator, we'll go through
+        # a deprecation cycle to move to a different function.
+        assert_(isinstance(self.rg.bit_generator, PCG64))
+
+    def test_seed(self):
+        np.random.default_rng()
+        np.random.default_rng(None)
+        np.random.default_rng(12345)
+        np.random.default_rng(0)
+        np.random.default_rng(43660444402423911716352051725018508569)
+        np.random.default_rng([43660444402423911716352051725018508569,
+                               279705150948142787361475340226491943209])
+        with pytest.raises(ValueError):
+            np.random.default_rng(-1)
+        with pytest.raises(ValueError):
+            np.random.default_rng([12345, -1])
diff --git a/venv/Lib/site-packages/numpy/setup.py b/venv/Lib/site-packages/numpy/setup.py
new file mode 100644
index 000000000..52db6a68b
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/setup.py
@@ -0,0 +1,26 @@
+#!/usr/bin/env python3
+
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('numpy', parent_package, top_path)
+
+    config.add_subpackage('compat')
+    config.add_subpackage('core')
+    config.add_subpackage('distutils')
+    config.add_subpackage('doc')
+    config.add_subpackage('f2py')
+    config.add_subpackage('fft')
+    config.add_subpackage('lib')
+    config.add_subpackage('linalg')
+    config.add_subpackage('ma')
+    config.add_subpackage('matrixlib')
+    config.add_subpackage('polynomial')
+    config.add_subpackage('random')
+    config.add_subpackage('testing')
+    config.add_data_dir('doc')
+    config.add_subpackage('tests')
+    config.make_config_py() # installs __config__.py
+    return config
+
+if __name__ == '__main__':
+    print('This is the wrong setup.py file to run')
diff --git a/venv/Lib/site-packages/numpy/testing/__init__.py b/venv/Lib/site-packages/numpy/testing/__init__.py
new file mode 100644
index 000000000..e1f87621f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/__init__.py
@@ -0,0 +1,20 @@
+"""Common test support for all numpy test scripts.
+
+This single module should provide all the common functionality for numpy tests
+in a single location, so that test scripts can just import it and work right
+away.
+
+"""
+from unittest import TestCase
+
+from ._private.utils import *
+from ._private import decorators as dec
+from ._private.nosetester import (
+    run_module_suite, NoseTester as Tester
+    )
+
+__all__ = _private.utils.__all__ + ['TestCase', 'run_module_suite']
+
+from numpy._pytesttester import PytestTester
+test = PytestTester(__name__)
+del PytestTester
diff --git a/venv/Lib/site-packages/numpy/testing/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..b8203ae8a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/__pycache__/print_coercion_tables.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/__pycache__/print_coercion_tables.cpython-36.pyc
new file mode 100644
index 000000000..1331dad1e
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/__pycache__/print_coercion_tables.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/__pycache__/setup.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/__pycache__/setup.cpython-36.pyc
new file mode 100644
index 000000000..cf797ca97
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/__pycache__/setup.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..a1ef9cd1f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__init__.py b/venv/Lib/site-packages/numpy/testing/_private/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..a0b4997f9
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/decorators.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/decorators.cpython-36.pyc
new file mode 100644
index 000000000..e47358dcb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/decorators.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/noseclasses.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/noseclasses.cpython-36.pyc
new file mode 100644
index 000000000..038ecd49a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/noseclasses.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/nosetester.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/nosetester.cpython-36.pyc
new file mode 100644
index 000000000..40c05623c
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/nosetester.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/parameterized.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/parameterized.cpython-36.pyc
new file mode 100644
index 000000000..9789cb10f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/parameterized.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..13bab4914
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/_private/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/_private/decorators.py b/venv/Lib/site-packages/numpy/testing/_private/decorators.py
new file mode 100644
index 000000000..b4b6259a0
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/_private/decorators.py
@@ -0,0 +1,284 @@
+"""
+Decorators for labeling and modifying behavior of test objects.
+
+Decorators that merely return a modified version of the original
+function object are straightforward. Decorators that return a new
+function object need to use
+::
+
+  nose.tools.make_decorator(original_function)(decorator)
+
+in returning the decorator, in order to preserve meta-data such as
+function name, setup and teardown functions and so on - see
+``nose.tools`` for more information.
+
+"""
+import collections.abc
+
+from .utils import SkipTest, assert_warns, HAS_REFCOUNT
+
+__all__ = ['slow', 'setastest', 'skipif', 'knownfailureif', 'deprecated',
+           'parametrize', '_needs_refcount',]
+
+
+def slow(t):
+    """
+    Label a test as 'slow'.
+
+    The exact definition of a slow test is obviously both subjective and
+    hardware-dependent, but in general any individual test that requires more
+    than a second or two should be labeled as slow (the whole suite consists of
+    thousands of tests, so even a second is significant).
+
+    Parameters
+    ----------
+    t : callable
+        The test to label as slow.
+
+    Returns
+    -------
+    t : callable
+        The decorated test `t`.
+
+    Examples
+    --------
+    The `numpy.testing` module includes ``import decorators as dec``.
+    A test can be decorated as slow like this::
+
+      from numpy.testing import *
+
+      @dec.slow
+      def test_big(self):
+          print('Big, slow test')
+
+    """
+
+    t.slow = True
+    return t
+
+def setastest(tf=True):
+    """
+    Signals to nose that this function is or is not a test.
+
+    Parameters
+    ----------
+    tf : bool
+        If True, specifies that the decorated callable is a test.
+        If False, specifies that the decorated callable is not a test.
+        Default is True.
+
+    Notes
+    -----
+    This decorator can't use the nose namespace, because it can be
+    called from a non-test module. See also ``istest`` and ``nottest`` in
+    ``nose.tools``.
+
+    Examples
+    --------
+    `setastest` can be used in the following way::
+
+      from numpy.testing import dec
+
+      @dec.setastest(False)
+      def func_with_test_in_name(arg1, arg2):
+          pass
+
+    """
+    def set_test(t):
+        t.__test__ = tf
+        return t
+    return set_test
+
+def skipif(skip_condition, msg=None):
+    """
+    Make function raise SkipTest exception if a given condition is true.
+
+    If the condition is a callable, it is used at runtime to dynamically
+    make the decision. This is useful for tests that may require costly
+    imports, to delay the cost until the test suite is actually executed.
+
+    Parameters
+    ----------
+    skip_condition : bool or callable
+        Flag to determine whether to skip the decorated test.
+    msg : str, optional
+        Message to give on raising a SkipTest exception. Default is None.
+
+    Returns
+    -------
+    decorator : function
+        Decorator which, when applied to a function, causes SkipTest
+        to be raised when `skip_condition` is True, and the function
+        to be called normally otherwise.
+
+    Notes
+    -----
+    The decorator itself is decorated with the ``nose.tools.make_decorator``
+    function in order to transmit function name, and various other metadata.
+
+    """
+
+    def skip_decorator(f):
+        # Local import to avoid a hard nose dependency and only incur the
+        # import time overhead at actual test-time.
+        import nose
+
+        # Allow for both boolean or callable skip conditions.
+        if isinstance(skip_condition, collections.abc.Callable):
+            skip_val = lambda: skip_condition()
+        else:
+            skip_val = lambda: skip_condition
+
+        def get_msg(func,msg=None):
+            """Skip message with information about function being skipped."""
+            if msg is None:
+                out = 'Test skipped due to test condition'
+            else:
+                out = msg
+
+            return "Skipping test: %s: %s" % (func.__name__, out)
+
+        # We need to define *two* skippers because Python doesn't allow both
+        # return with value and yield inside the same function.
+        def skipper_func(*args, **kwargs):
+            """Skipper for normal test functions."""
+            if skip_val():
+                raise SkipTest(get_msg(f, msg))
+            else:
+                return f(*args, **kwargs)
+
+        def skipper_gen(*args, **kwargs):
+            """Skipper for test generators."""
+            if skip_val():
+                raise SkipTest(get_msg(f, msg))
+            else:
+                yield from f(*args, **kwargs)
+
+        # Choose the right skipper to use when building the actual decorator.
+        if nose.util.isgenerator(f):
+            skipper = skipper_gen
+        else:
+            skipper = skipper_func
+
+        return nose.tools.make_decorator(f)(skipper)
+
+    return skip_decorator
+
+
+def knownfailureif(fail_condition, msg=None):
+    """
+    Make function raise KnownFailureException exception if given condition is true.
+
+    If the condition is a callable, it is used at runtime to dynamically
+    make the decision. This is useful for tests that may require costly
+    imports, to delay the cost until the test suite is actually executed.
+
+    Parameters
+    ----------
+    fail_condition : bool or callable
+        Flag to determine whether to mark the decorated test as a known
+        failure (if True) or not (if False).
+    msg : str, optional
+        Message to give on raising a KnownFailureException exception.
+        Default is None.
+
+    Returns
+    -------
+    decorator : function
+        Decorator, which, when applied to a function, causes
+        KnownFailureException to be raised when `fail_condition` is True,
+        and the function to be called normally otherwise.
+
+    Notes
+    -----
+    The decorator itself is decorated with the ``nose.tools.make_decorator``
+    function in order to transmit function name, and various other metadata.
+
+    """
+    if msg is None:
+        msg = 'Test skipped due to known failure'
+
+    # Allow for both boolean or callable known failure conditions.
+    if isinstance(fail_condition, collections.abc.Callable):
+        fail_val = lambda: fail_condition()
+    else:
+        fail_val = lambda: fail_condition
+
+    def knownfail_decorator(f):
+        # Local import to avoid a hard nose dependency and only incur the
+        # import time overhead at actual test-time.
+        import nose
+        from .noseclasses import KnownFailureException
+
+        def knownfailer(*args, **kwargs):
+            if fail_val():
+                raise KnownFailureException(msg)
+            else:
+                return f(*args, **kwargs)
+        return nose.tools.make_decorator(f)(knownfailer)
+
+    return knownfail_decorator
+
+def deprecated(conditional=True):
+    """
+    Filter deprecation warnings while running the test suite.
+
+    This decorator can be used to filter DeprecationWarning's, to avoid
+    printing them during the test suite run, while checking that the test
+    actually raises a DeprecationWarning.
+
+    Parameters
+    ----------
+    conditional : bool or callable, optional
+        Flag to determine whether to mark test as deprecated or not. If the
+        condition is a callable, it is used at runtime to dynamically make the
+        decision. Default is True.
+
+    Returns
+    -------
+    decorator : function
+        The `deprecated` decorator itself.
+
+    Notes
+    -----
+    .. versionadded:: 1.4.0
+
+    """
+    def deprecate_decorator(f):
+        # Local import to avoid a hard nose dependency and only incur the
+        # import time overhead at actual test-time.
+        import nose
+
+        def _deprecated_imp(*args, **kwargs):
+            # Poor man's replacement for the with statement
+            with assert_warns(DeprecationWarning):
+                f(*args, **kwargs)
+
+        if isinstance(conditional, collections.abc.Callable):
+            cond = conditional()
+        else:
+            cond = conditional
+        if cond:
+            return nose.tools.make_decorator(f)(_deprecated_imp)
+        else:
+            return f
+    return deprecate_decorator
+
+
+def parametrize(vars, input):
+    """
+    Pytest compatibility class. This implements the simplest level of
+    pytest.mark.parametrize for use in nose as an aid in making the transition
+    to pytest. It achieves that by adding a dummy var parameter and ignoring
+    the doc_func parameter of the base class. It does not support variable
+    substitution by name, nor does it support nesting or classes. See the
+    pytest documentation for usage.
+
+    .. versionadded:: 1.14.0
+
+    """
+    from .parameterized import parameterized
+
+    return parameterized(input)
+
+_needs_refcount = skipif(not HAS_REFCOUNT, "python has no sys.getrefcount")
diff --git a/venv/Lib/site-packages/numpy/testing/_private/noseclasses.py b/venv/Lib/site-packages/numpy/testing/_private/noseclasses.py
new file mode 100644
index 000000000..69e19e959
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/_private/noseclasses.py
@@ -0,0 +1,364 @@
+# These classes implement a doctest runner plugin for nose, a "known failure"
+# error class, and a customized TestProgram for NumPy.
+
+# Because this module imports nose directly, it should not
+# be used except by nosetester.py to avoid a general NumPy
+# dependency on nose.
+import os
+import sys
+import doctest
+import inspect
+
+import numpy
+import nose
+from nose.plugins import doctests as npd
+from nose.plugins.errorclass import ErrorClass, ErrorClassPlugin
+from nose.plugins.base import Plugin
+from nose.util import src
+from .nosetester import get_package_name
+from .utils import KnownFailureException, KnownFailureTest
+
+
+# Some of the classes in this module begin with 'Numpy' to clearly distinguish
+# them from the plethora of very similar names from nose/unittest/doctest
+
+#-----------------------------------------------------------------------------
+# Modified version of the one in the stdlib, that fixes a python bug (doctests
+# not found in extension modules, https://bugs.python.org/issue3158)
+class NumpyDocTestFinder(doctest.DocTestFinder):
+
+    def _from_module(self, module, object):
+        """
+        Return true if the given object is defined in the given
+        module.
+        """
+        if module is None:
+            return True
+        elif inspect.isfunction(object):
+            return module.__dict__ is object.__globals__
+        elif inspect.isbuiltin(object):
+            return module.__name__ == object.__module__
+        elif inspect.isclass(object):
+            return module.__name__ == object.__module__
+        elif inspect.ismethod(object):
+            # This one may be a bug in cython that fails to correctly set the
+            # __module__ attribute of methods, but since the same error is easy
+            # to make by extension code writers, having this safety in place
+            # isn't such a bad idea
+            return module.__name__ == object.__self__.__class__.__module__
+        elif inspect.getmodule(object) is not None:
+            return module is inspect.getmodule(object)
+        elif hasattr(object, '__module__'):
+            return module.__name__ == object.__module__
+        elif isinstance(object, property):
+            return True  # [XX] no way not be sure.
+        else:
+            raise ValueError("object must be a class or function")
+
+    def _find(self, tests, obj, name, module, source_lines, globs, seen):
+        """
+        Find tests for the given object and any contained objects, and
+        add them to `tests`.
+        """
+
+        doctest.DocTestFinder._find(self, tests, obj, name, module,
+                                    source_lines, globs, seen)
+
+        # Below we re-run pieces of the above method with manual modifications,
+        # because the original code is buggy and fails to correctly identify
+        # doctests in extension modules.
+
+        # Local shorthands
+        from inspect import (
+            isroutine, isclass, ismodule, isfunction, ismethod
+            )
+
+        # Look for tests in a module's contained objects.
+        if ismodule(obj) and self._recurse:
+            for valname, val in obj.__dict__.items():
+                valname1 = '%s.%s' % (name, valname)
+                if ( (isroutine(val) or isclass(val))
+                     and self._from_module(module, val)):
+
+                    self._find(tests, val, valname1, module, source_lines,
+                               globs, seen)
+
+        # Look for tests in a class's contained objects.
+        if isclass(obj) and self._recurse:
+            for valname, val in obj.__dict__.items():
+                # Special handling for staticmethod/classmethod.
+                if isinstance(val, staticmethod):
+                    val = getattr(obj, valname)
+                if isinstance(val, classmethod):
+                    val = getattr(obj, valname).__func__
+
+                # Recurse to methods, properties, and nested classes.
+                if ((isfunction(val) or isclass(val) or
+                     ismethod(val) or isinstance(val, property)) and
+                      self._from_module(module, val)):
+                    valname = '%s.%s' % (name, valname)
+                    self._find(tests, val, valname, module, source_lines,
+                               globs, seen)
+
+
+# second-chance checker; if the default comparison doesn't
+# pass, then see if the expected output string contains flags that
+# tell us to ignore the output
+class NumpyOutputChecker(doctest.OutputChecker):
+    def check_output(self, want, got, optionflags):
+        ret = doctest.OutputChecker.check_output(self, want, got,
+                                                 optionflags)
+        if not ret:
+            if "#random" in want:
+                return True
+
+            # it would be useful to normalize endianness so that
+            # bigendian machines don't fail all the tests (and there are
+            # actually some bigendian examples in the doctests). Let's try
+            # making them all little endian
+            got = got.replace("'>", "'<")
+            want = want.replace("'>", "'<")
+
+            # try to normalize out 32 and 64 bit default int sizes
+            for sz in [4, 8]:
+                got = got.replace("'<i%d'" % sz, "int")
+                want = want.replace("'<i%d'" % sz, "int")
+
+            ret = doctest.OutputChecker.check_output(self, want,
+                    got, optionflags)
+
+        return ret
+
+
+# Subclass nose.plugins.doctests.DocTestCase to work around a bug in
+# its constructor that blocks non-default arguments from being passed
+# down into doctest.DocTestCase
+class NumpyDocTestCase(npd.DocTestCase):
+    def __init__(self, test, optionflags=0, setUp=None, tearDown=None,
+                 checker=None, obj=None, result_var='_'):
+        self._result_var = result_var
+        self._nose_obj = obj
+        doctest.DocTestCase.__init__(self, test,
+                                     optionflags=optionflags,
+                                     setUp=setUp, tearDown=tearDown,
+                                     checker=checker)
+
+
+print_state = numpy.get_printoptions()
+
+class NumpyDoctest(npd.Doctest):
+    name = 'numpydoctest'   # call nosetests with --with-numpydoctest
+    score = 1000  # load late, after doctest builtin
+
+    # always use whitespace and ellipsis options for doctests
+    doctest_optflags = doctest.NORMALIZE_WHITESPACE | doctest.ELLIPSIS
+
+    # files that should be ignored for doctests
+    doctest_ignore = ['generate_numpy_api.py',
+                      'setup.py']
+
+    # Custom classes; class variables to allow subclassing
+    doctest_case_class = NumpyDocTestCase
+    out_check_class = NumpyOutputChecker
+    test_finder_class = NumpyDocTestFinder
+
+    # Don't use the standard doctest option handler; hard-code the option values
+    def options(self, parser, env=os.environ):
+        Plugin.options(self, parser, env)
+        # Test doctests in 'test' files / directories. Standard plugin default
+        # is False
+        self.doctest_tests = True
+        # Variable name; if defined, doctest results stored in this variable in
+        # the top-level namespace.  None is the standard default
+        self.doctest_result_var = None
+
+    def configure(self, options, config):
+        # parent method sets enabled flag from command line --with-numpydoctest
+        Plugin.configure(self, options, config)
+        self.finder = self.test_finder_class()
+        self.parser = doctest.DocTestParser()
+        if self.enabled:
+            # Pull standard doctest out of plugin list; there's no reason to run
+            # both.  In practice the Unplugger plugin above would cover us when
+            # run from a standard numpy.test() call; this is just in case
+            # someone wants to run our plugin outside the numpy.test() machinery
+            config.plugins.plugins = [p for p in config.plugins.plugins
+                                      if p.name != 'doctest']
+
+    def set_test_context(self, test):
+        """ Configure `test` object to set test context
+
+        We set the numpy / scipy standard doctest namespace
+
+        Parameters
+        ----------
+        test : test object
+            with ``globs`` dictionary defining namespace
+
+        Returns
+        -------
+        None
+
+        Notes
+        -----
+        `test` object modified in place
+        """
+        # set the namespace for tests
+        pkg_name = get_package_name(os.path.dirname(test.filename))
+
+        # Each doctest should execute in an environment equivalent to
+        # starting Python and executing "import numpy as np", and,
+        # for SciPy packages, an additional import of the local
+        # package (so that scipy.linalg.basic.py's doctests have an
+        # implicit "from scipy import linalg" as well).
+        #
+        # Note: __file__ allows the doctest in NoseTester to run
+        # without producing an error
+        test.globs = {'__builtins__':__builtins__,
+                      '__file__':'__main__',
+                      '__name__':'__main__',
+                      'np':numpy}
+        # add appropriate scipy import for SciPy tests
+        if 'scipy' in pkg_name:
+            p = pkg_name.split('.')
+            p2 = p[-1]
+            test.globs[p2] = __import__(pkg_name, test.globs, {}, [p2])
+
+    # Override test loading to customize test context (with set_test_context
+    # method), set standard docstring options, and install our own test output
+    # checker
+    def loadTestsFromModule(self, module):
+        if not self.matches(module.__name__):
+            npd.log.debug("Doctest doesn't want module %s", module)
+            return
+        try:
+            tests = self.finder.find(module)
+        except AttributeError:
+            # nose allows module.__test__ = False; doctest does not and
+            # throws AttributeError
+            return
+        if not tests:
+            return
+        tests.sort()
+        module_file = src(module.__file__)
+        for test in tests:
+            if not test.examples:
+                continue
+            if not test.filename:
+                test.filename = module_file
+            # Set test namespace; test altered in place
+            self.set_test_context(test)
+            yield self.doctest_case_class(test,
+                                          optionflags=self.doctest_optflags,
+                                          checker=self.out_check_class(),
+                                          result_var=self.doctest_result_var)
+
+    # Add an afterContext method to nose.plugins.doctests.Doctest in order
+    # to restore print options to the original state after each doctest
+    def afterContext(self):
+        numpy.set_printoptions(**print_state)
+
+    # Ignore NumPy-specific build files that shouldn't be searched for tests
+    def wantFile(self, file):
+        bn = os.path.basename(file)
+        if bn in self.doctest_ignore:
+            return False
+        return npd.Doctest.wantFile(self, file)
+
+
+class Unplugger:
+    """ Nose plugin to remove named plugin late in loading
+
+    By default it removes the "doctest" plugin.
+    """
+    name = 'unplugger'
+    enabled = True  # always enabled
+    score = 4000  # load late in order to be after builtins
+
+    def __init__(self, to_unplug='doctest'):
+        self.to_unplug = to_unplug
+
+    def options(self, parser, env):
+        pass
+
+    def configure(self, options, config):
+        # Pull named plugin out of plugins list
+        config.plugins.plugins = [p for p in config.plugins.plugins
+                                  if p.name != self.to_unplug]
+
+
+class KnownFailurePlugin(ErrorClassPlugin):
+    '''Plugin that installs a KNOWNFAIL error class for the
+    KnownFailureClass exception.  When KnownFailure is raised,
+    the exception will be logged in the knownfail attribute of the
+    result, 'K' or 'KNOWNFAIL' (verbose) will be output, and the
+    exception will not be counted as an error or failure.'''
+    enabled = True
+    knownfail = ErrorClass(KnownFailureException,
+                           label='KNOWNFAIL',
+                           isfailure=False)
+
+    def options(self, parser, env=os.environ):
+        env_opt = 'NOSE_WITHOUT_KNOWNFAIL'
+        parser.add_option('--no-knownfail', action='store_true',
+                          dest='noKnownFail', default=env.get(env_opt, False),
+                          help='Disable special handling of KnownFailure '
+                               'exceptions')
+
+    def configure(self, options, conf):
+        if not self.can_configure:
+            return
+        self.conf = conf
+        disable = getattr(options, 'noKnownFail', False)
+        if disable:
+            self.enabled = False
+
+KnownFailure = KnownFailurePlugin   # backwards compat
+
+
+class FPUModeCheckPlugin(Plugin):
+    """
+    Plugin that checks the FPU mode before and after each test,
+    raising failures if the test changed the mode.
+    """
+
+    def prepareTestCase(self, test):
+        from numpy.core._multiarray_tests import get_fpu_mode
+
+        def run(result):
+            old_mode = get_fpu_mode()
+            test.test(result)
+            new_mode = get_fpu_mode()
+
+            if old_mode != new_mode:
+                try:
+                    raise AssertionError(
+                        "FPU mode changed from {0:#x} to {1:#x} during the "
+                        "test".format(old_mode, new_mode))
+                except AssertionError:
+                    result.addFailure(test, sys.exc_info())
+
+        return run
+
+
+# Class allows us to save the results of the tests in runTests - see runTests
+# method docstring for details
+class NumpyTestProgram(nose.core.TestProgram):
+    def runTests(self):
+        """Run Tests. Returns true on success, false on failure, and
+        sets self.success to the same value.
+
+        Because nose currently discards the test result object, but we need
+        to return it to the user, override TestProgram.runTests to retain
+        the result
+        """
+        if self.testRunner is None:
+            self.testRunner = nose.core.TextTestRunner(stream=self.config.stream,
+                                                       verbosity=self.config.verbosity,
+                                                       config=self.config)
+        plug_runner = self.config.plugins.prepareTestRunner(self.testRunner)
+        if plug_runner is not None:
+            self.testRunner = plug_runner
+        self.result = self.testRunner.run(self.test)
+        self.success = self.result.wasSuccessful()
+        return self.success
diff --git a/venv/Lib/site-packages/numpy/testing/_private/nosetester.py b/venv/Lib/site-packages/numpy/testing/_private/nosetester.py
new file mode 100644
index 000000000..bd6d002aa
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/_private/nosetester.py
@@ -0,0 +1,545 @@
+"""
+Nose test running.
+
+This module implements ``test()`` and ``bench()`` functions for NumPy modules.
+
+"""
+import os
+import sys
+import warnings
+import numpy as np
+
+from .utils import import_nose, suppress_warnings
+
+
+__all__ = ['get_package_name', 'run_module_suite', 'NoseTester',
+           '_numpy_tester', 'get_package_name', 'import_nose',
+           'suppress_warnings']
+
+
+def get_package_name(filepath):
+    """
+    Given a path where a package is installed, determine its name.
+
+    Parameters
+    ----------
+    filepath : str
+        Path to a file. If the determination fails, "numpy" is returned.
+
+    Examples
+    --------
+    >>> np.testing.nosetester.get_package_name('nonsense')
+    'numpy'
+
+    """
+
+    fullpath = filepath[:]
+    pkg_name = []
+    while 'site-packages' in filepath or 'dist-packages' in filepath:
+        filepath, p2 = os.path.split(filepath)
+        if p2 in ('site-packages', 'dist-packages'):
+            break
+        pkg_name.append(p2)
+
+    # if package name determination failed, just default to numpy/scipy
+    if not pkg_name:
+        if 'scipy' in fullpath:
+            return 'scipy'
+        else:
+            return 'numpy'
+
+    # otherwise, reverse to get correct order and return
+    pkg_name.reverse()
+
+    # don't include the outer egg directory
+    if pkg_name[0].endswith('.egg'):
+        pkg_name.pop(0)
+
+    return '.'.join(pkg_name)
+
+
+def run_module_suite(file_to_run=None, argv=None):
+    """
+    Run a test module.
+
+    Equivalent to calling ``$ nosetests <argv> <file_to_run>`` from
+    the command line
+
+    Parameters
+    ----------
+    file_to_run : str, optional
+        Path to test module, or None.
+        By default, run the module from which this function is called.
+    argv : list of strings
+        Arguments to be passed to the nose test runner. ``argv[0]`` is
+        ignored. All command line arguments accepted by ``nosetests``
+        will work. If it is the default value None, sys.argv is used.
+
+        .. versionadded:: 1.9.0
+
+    Examples
+    --------
+    Adding the following::
+
+        if __name__ == "__main__" :
+            run_module_suite(argv=sys.argv)
+
+    at the end of a test module will run the tests when that module is
+    called in the python interpreter.
+
+    Alternatively, calling::
+
+    >>> run_module_suite(file_to_run="numpy/tests/test_matlib.py")  # doctest: +SKIP
+
+    from an interpreter will run all the test routine in 'test_matlib.py'.
+    """
+    if file_to_run is None:
+        f = sys._getframe(1)
+        file_to_run = f.f_locals.get('__file__', None)
+        if file_to_run is None:
+            raise AssertionError
+
+    if argv is None:
+        argv = sys.argv + [file_to_run]
+    else:
+        argv = argv + [file_to_run]
+
+    nose = import_nose()
+    from .noseclasses import KnownFailurePlugin
+    nose.run(argv=argv, addplugins=[KnownFailurePlugin()])
+
+
+class NoseTester:
+    """
+    Nose test runner.
+
+    This class is made available as numpy.testing.Tester, and a test function
+    is typically added to a package's __init__.py like so::
+
+      from numpy.testing import Tester
+      test = Tester().test
+
+    Calling this test function finds and runs all tests associated with the
+    package and all its sub-packages.
+
+    Attributes
+    ----------
+    package_path : str
+        Full path to the package to test.
+    package_name : str
+        Name of the package to test.
+
+    Parameters
+    ----------
+    package : module, str or None, optional
+        The package to test. If a string, this should be the full path to
+        the package. If None (default), `package` is set to the module from
+        which `NoseTester` is initialized.
+    raise_warnings : None, str or sequence of warnings, optional
+        This specifies which warnings to configure as 'raise' instead
+        of being shown once during the test execution.  Valid strings are:
+
+          - "develop" : equals ``(Warning,)``
+          - "release" : equals ``()``, don't raise on any warnings.
+
+        Default is "release".
+    depth : int, optional
+        If `package` is None, then this can be used to initialize from the
+        module of the caller of (the caller of (...)) the code that
+        initializes `NoseTester`. Default of 0 means the module of the
+        immediate caller; higher values are useful for utility routines that
+        want to initialize `NoseTester` objects on behalf of other code.
+
+    """
+    def __init__(self, package=None, raise_warnings="release", depth=0,
+                 check_fpu_mode=False):
+        # Back-compat: 'None' used to mean either "release" or "develop"
+        # depending on whether this was a release or develop version of
+        # numpy. Those semantics were fine for testing numpy, but not so
+        # helpful for downstream projects like scipy that use
+        # numpy.testing. (They want to set this based on whether *they* are a
+        # release or develop version, not whether numpy is.) So we continue to
+        # accept 'None' for back-compat, but it's now just an alias for the
+        # default "release".
+        if raise_warnings is None:
+            raise_warnings = "release"
+
+        package_name = None
+        if package is None:
+            f = sys._getframe(1 + depth)
+            package_path = f.f_locals.get('__file__', None)
+            if package_path is None:
+                raise AssertionError
+            package_path = os.path.dirname(package_path)
+            package_name = f.f_locals.get('__name__', None)
+        elif isinstance(package, type(os)):
+            package_path = os.path.dirname(package.__file__)
+            package_name = getattr(package, '__name__', None)
+        else:
+            package_path = str(package)
+
+        self.package_path = package_path
+
+        # Find the package name under test; this name is used to limit coverage
+        # reporting (if enabled).
+        if package_name is None:
+            package_name = get_package_name(package_path)
+        self.package_name = package_name
+
+        # Set to "release" in constructor in maintenance branches.
+        self.raise_warnings = raise_warnings
+
+        # Whether to check for FPU mode changes
+        self.check_fpu_mode = check_fpu_mode
+
+    def _test_argv(self, label, verbose, extra_argv):
+        ''' Generate argv for nosetest command
+
+        Parameters
+        ----------
+        label : {'fast', 'full', '', attribute identifier}, optional
+            see ``test`` docstring
+        verbose : int, optional
+            Verbosity value for test outputs, in the range 1-10. Default is 1.
+        extra_argv : list, optional
+            List with any extra arguments to pass to nosetests.
+
+        Returns
+        -------
+        argv : list
+            command line arguments that will be passed to nose
+        '''
+        argv = [__file__, self.package_path, '-s']
+        if label and label != 'full':
+            if not isinstance(label, str):
+                raise TypeError('Selection label should be a string')
+            if label == 'fast':
+                label = 'not slow'
+            argv += ['-A', label]
+        argv += ['--verbosity', str(verbose)]
+
+        # When installing with setuptools, and also in some other cases, the
+        # test_*.py files end up marked +x executable. Nose, by default, does
+        # not run files marked with +x as they might be scripts. However, in
+        # our case nose only looks for test_*.py files under the package
+        # directory, which should be safe.
+        argv += ['--exe']
+
+        if extra_argv:
+            argv += extra_argv
+        return argv
+
+    def _show_system_info(self):
+        nose = import_nose()
+
+        import numpy
+        print("NumPy version %s" % numpy.__version__)
+        relaxed_strides = numpy.ones((10, 1), order="C").flags.f_contiguous
+        print("NumPy relaxed strides checking option:", relaxed_strides)
+        npdir = os.path.dirname(numpy.__file__)
+        print("NumPy is installed in %s" % npdir)
+
+        if 'scipy' in self.package_name:
+            import scipy
+            print("SciPy version %s" % scipy.__version__)
+            spdir = os.path.dirname(scipy.__file__)
+            print("SciPy is installed in %s" % spdir)
+
+        pyversion = sys.version.replace('\n', '')
+        print("Python version %s" % pyversion)
+        print("nose version %d.%d.%d" % nose.__versioninfo__)
+
+    def _get_custom_doctester(self):
+        """ Return instantiated plugin for doctests
+
+        Allows subclassing of this class to override doctester
+
+        A return value of None means use the nose builtin doctest plugin
+        """
+        from .noseclasses import NumpyDoctest
+        return NumpyDoctest()
+
+    def prepare_test_args(self, label='fast', verbose=1, extra_argv=None,
+                          doctests=False, coverage=False, timer=False):
+        """
+        Run tests for module using nose.
+
+        This method does the heavy lifting for the `test` method. It takes all
+        the same arguments, for details see `test`.
+
+        See Also
+        --------
+        test
+
+        """
+        # fail with nice error message if nose is not present
+        import_nose()
+        # compile argv
+        argv = self._test_argv(label, verbose, extra_argv)
+        # our way of doing coverage
+        if coverage:
+            argv += ['--cover-package=%s' % self.package_name, '--with-coverage',
+                   '--cover-tests', '--cover-erase']
+
+        if timer:
+            if timer is True:
+                argv += ['--with-timer']
+            elif isinstance(timer, int):
+                argv += ['--with-timer', '--timer-top-n', str(timer)]
+
+        # construct list of plugins
+        import nose.plugins.builtin
+        from nose.plugins import EntryPointPluginManager
+        from .noseclasses import (KnownFailurePlugin, Unplugger,
+                                  FPUModeCheckPlugin)
+        plugins = [KnownFailurePlugin()]
+        plugins += [p() for p in nose.plugins.builtin.plugins]
+        if self.check_fpu_mode:
+            plugins += [FPUModeCheckPlugin()]
+            argv += ["--with-fpumodecheckplugin"]
+        try:
+            # External plugins (like nose-timer)
+            entrypoint_manager = EntryPointPluginManager()
+            entrypoint_manager.loadPlugins()
+            plugins += [p for p in entrypoint_manager.plugins]
+        except ImportError:
+            # Relies on pkg_resources, not a hard dependency
+            pass
+
+        # add doctesting if required
+        doctest_argv = '--with-doctest' in argv
+        if doctests == False and doctest_argv:
+            doctests = True
+        plug = self._get_custom_doctester()
+        if plug is None:
+            # use standard doctesting
+            if doctests and not doctest_argv:
+                argv += ['--with-doctest']
+        else:  # custom doctesting
+            if doctest_argv:  # in fact the unplugger would take care of this
+                argv.remove('--with-doctest')
+            plugins += [Unplugger('doctest'), plug]
+            if doctests:
+                argv += ['--with-' + plug.name]
+        return argv, plugins
+
+    def test(self, label='fast', verbose=1, extra_argv=None,
+             doctests=False, coverage=False, raise_warnings=None,
+             timer=False):
+        """
+        Run tests for module using nose.
+
+        Parameters
+        ----------
+        label : {'fast', 'full', '', attribute identifier}, optional
+            Identifies the tests to run. This can be a string to pass to
+            the nosetests executable with the '-A' option, or one of several
+            special values.  Special values are:
+
+            * 'fast' - the default - which corresponds to the ``nosetests -A``
+              option of 'not slow'.
+            * 'full' - fast (as above) and slow tests as in the
+              'no -A' option to nosetests - this is the same as ''.
+            * None or '' - run all tests.
+            * attribute_identifier - string passed directly to nosetests as '-A'.
+
+        verbose : int, optional
+            Verbosity value for test outputs, in the range 1-10. Default is 1.
+        extra_argv : list, optional
+            List with any extra arguments to pass to nosetests.
+        doctests : bool, optional
+            If True, run doctests in module. Default is False.
+        coverage : bool, optional
+            If True, report coverage of NumPy code. Default is False.
+            (This requires the
+            `coverage module <https://nedbatchelder.com/code/modules/coveragehtml>`_).
+        raise_warnings : None, str or sequence of warnings, optional
+            This specifies which warnings to configure as 'raise' instead
+            of being shown once during the test execution. Valid strings are:
+
+            * "develop" : equals ``(Warning,)``
+            * "release" : equals ``()``, do not raise on any warnings.
+        timer : bool or int, optional
+            Timing of individual tests with ``nose-timer`` (which needs to be
+            installed).  If True, time tests and report on all of them.
+            If an integer (say ``N``), report timing results for ``N`` slowest
+            tests.
+
+        Returns
+        -------
+        result : object
+            Returns the result of running the tests as a
+            ``nose.result.TextTestResult`` object.
+
+        Notes
+        -----
+        Each NumPy module exposes `test` in its namespace to run all tests for it.
+        For example, to run all tests for numpy.lib:
+
+        >>> np.lib.test() #doctest: +SKIP
+
+        Examples
+        --------
+        >>> result = np.lib.test() #doctest: +SKIP
+        Running unit tests for numpy.lib
+        ...
+        Ran 976 tests in 3.933s
+
+        OK
+
+        >>> result.errors #doctest: +SKIP
+        []
+        >>> result.knownfail #doctest: +SKIP
+        []
+        """
+
+        # cap verbosity at 3 because nose becomes *very* verbose beyond that
+        verbose = min(verbose, 3)
+
+        from . import utils
+        utils.verbose = verbose
+
+        argv, plugins = self.prepare_test_args(
+                label, verbose, extra_argv, doctests, coverage, timer)
+
+        if doctests:
+            print("Running unit tests and doctests for %s" % self.package_name)
+        else:
+            print("Running unit tests for %s" % self.package_name)
+
+        self._show_system_info()
+
+        # reset doctest state on every run
+        import doctest
+        doctest.master = None
+
+        if raise_warnings is None:
+            raise_warnings = self.raise_warnings
+
+        _warn_opts = dict(develop=(Warning,),
+                          release=())
+        if isinstance(raise_warnings, str):
+            raise_warnings = _warn_opts[raise_warnings]
+
+        with suppress_warnings("location") as sup:
+            # Reset the warning filters to the default state,
+            # so that running the tests is more repeatable.
+            warnings.resetwarnings()
+            # Set all warnings to 'warn', this is because the default 'once'
+            # has the bad property of possibly shadowing later warnings.
+            warnings.filterwarnings('always')
+            # Force the requested warnings to raise
+            for warningtype in raise_warnings:
+                warnings.filterwarnings('error', category=warningtype)
+            # Filter out annoying import messages.
+            sup.filter(message='Not importing directory')
+            sup.filter(message="numpy.dtype size changed")
+            sup.filter(message="numpy.ufunc size changed")
+            sup.filter(category=np.ModuleDeprecationWarning)
+            # Filter out boolean '-' deprecation messages. This allows
+            # older versions of scipy to test without a flood of messages.
+            sup.filter(message=".*boolean negative.*")
+            sup.filter(message=".*boolean subtract.*")
+            # Filter out distutils cpu warnings (could be localized to
+            # distutils tests). ASV has problems with top level import,
+            # so fetch module for suppression here.
+            with warnings.catch_warnings():
+                warnings.simplefilter("always")
+                from ...distutils import cpuinfo
+            sup.filter(category=UserWarning, module=cpuinfo)
+            # Filter out some deprecation warnings inside nose 1.3.7 when run
+            # on python 3.5b2. See
+            #     https://github.com/nose-devs/nose/issues/929
+            # Note: it is hard to filter based on module for sup (lineno could
+            #       be implemented).
+            warnings.filterwarnings("ignore", message=".*getargspec.*",
+                                    category=DeprecationWarning,
+                                    module=r"nose\.")
+
+            from .noseclasses import NumpyTestProgram
+
+            t = NumpyTestProgram(argv=argv, exit=False, plugins=plugins)
+
+        return t.result
+
+    def bench(self, label='fast', verbose=1, extra_argv=None):
+        """
+        Run benchmarks for module using nose.
+
+        Parameters
+        ----------
+        label : {'fast', 'full', '', attribute identifier}, optional
+            Identifies the benchmarks to run. This can be a string to pass to
+            the nosetests executable with the '-A' option, or one of several
+            special values.  Special values are:
+
+            * 'fast' - the default - which corresponds to the ``nosetests -A``
+              option of 'not slow'.
+            * 'full' - fast (as above) and slow benchmarks as in the
+              'no -A' option to nosetests - this is the same as ''.
+            * None or '' - run all tests.
+            * attribute_identifier - string passed directly to nosetests as '-A'.
+
+        verbose : int, optional
+            Verbosity value for benchmark outputs, in the range 1-10. Default is 1.
+        extra_argv : list, optional
+            List with any extra arguments to pass to nosetests.
+
+        Returns
+        -------
+        success : bool
+            Returns True if running the benchmarks works, False if an error
+            occurred.
+
+        Notes
+        -----
+        Benchmarks are like tests, but have names starting with "bench" instead
+        of "test", and can be found under the "benchmarks" sub-directory of the
+        module.
+
+        Each NumPy module exposes `bench` in its namespace to run all benchmarks
+        for it.
+
+        Examples
+        --------
+        >>> success = np.lib.bench() #doctest: +SKIP
+        Running benchmarks for numpy.lib
+        ...
+        using 562341 items:
+        unique:
+        0.11
+        unique1d:
+        0.11
+        ratio: 1.0
+        nUnique: 56230 == 56230
+        ...
+        OK
+
+        >>> success #doctest: +SKIP
+        True
+
+        """
+
+        print("Running benchmarks for %s" % self.package_name)
+        self._show_system_info()
+
+        argv = self._test_argv(label, verbose, extra_argv)
+        argv += ['--match', r'(?:^|[\\b_\\.%s-])[Bb]ench' % os.sep]
+
+        # import nose or make informative error
+        nose = import_nose()
+
+        # get plugin to disable doctests
+        from .noseclasses import Unplugger
+        add_plugins = [Unplugger('doctest')]
+
+        return nose.run(argv=argv, addplugins=add_plugins)
+
+
+def _numpy_tester():
+    if hasattr(np, "__version__") and ".dev0" in np.__version__:
+        mode = "develop"
+    else:
+        mode = "release"
+    return NoseTester(raise_warnings=mode, depth=1,
+                      check_fpu_mode=True)
diff --git a/venv/Lib/site-packages/numpy/testing/_private/parameterized.py b/venv/Lib/site-packages/numpy/testing/_private/parameterized.py
new file mode 100644
index 000000000..3bd8ede91
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/_private/parameterized.py
@@ -0,0 +1,444 @@
+"""
+tl;dr: all code code is licensed under simplified BSD, unless stated otherwise.
+
+Unless stated otherwise in the source files, all code is copyright 2010 David
+Wolever <david@wolever.net>. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+   1. Redistributions of source code must retain the above copyright notice,
+   this list of conditions and the following disclaimer.
+
+   2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY <COPYRIGHT HOLDER> ``AS IS'' AND ANY EXPRESS OR
+IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
+MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO
+EVENT SHALL <COPYRIGHT HOLDER> OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
+BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE
+OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF
+ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+The views and conclusions contained in the software and documentation are those
+of the authors and should not be interpreted as representing official policies,
+either expressed or implied, of David Wolever.
+
+"""
+import re
+import inspect
+import warnings
+from functools import wraps
+from types import MethodType
+from collections import namedtuple
+
+try:
+    from collections import OrderedDict as MaybeOrderedDict
+except ImportError:
+    MaybeOrderedDict = dict
+
+from unittest import TestCase
+
+_param = namedtuple("param", "args kwargs")
+
+class param(_param):
+    """ Represents a single parameter to a test case.
+
+        For example::
+
+            >>> p = param("foo", bar=16)
+            >>> p
+            param("foo", bar=16)
+            >>> p.args
+            ('foo', )
+            >>> p.kwargs
+            {'bar': 16}
+
+        Intended to be used as an argument to ``@parameterized``::
+
+            @parameterized([
+                param("foo", bar=16),
+            ])
+            def test_stuff(foo, bar=16):
+                pass
+        """
+
+    def __new__(cls, *args , **kwargs):
+        return _param.__new__(cls, args, kwargs)
+
+    @classmethod
+    def explicit(cls, args=None, kwargs=None):
+        """ Creates a ``param`` by explicitly specifying ``args`` and
+            ``kwargs``::
+
+                >>> param.explicit([1,2,3])
+                param(*(1, 2, 3))
+                >>> param.explicit(kwargs={"foo": 42})
+                param(*(), **{"foo": "42"})
+            """
+        args = args or ()
+        kwargs = kwargs or {}
+        return cls(*args, **kwargs)
+
+    @classmethod
+    def from_decorator(cls, args):
+        """ Returns an instance of ``param()`` for ``@parameterized`` argument
+            ``args``::
+
+                >>> param.from_decorator((42, ))
+                param(args=(42, ), kwargs={})
+                >>> param.from_decorator("foo")
+                param(args=("foo", ), kwargs={})
+            """
+        if isinstance(args, param):
+            return args
+        elif isinstance(args, (str,)):
+            args = (args, )
+        try:
+            return cls(*args)
+        except TypeError as e:
+            if "after * must be" not in str(e):
+                raise
+            raise TypeError(
+                "Parameters must be tuples, but %r is not (hint: use '(%r, )')"
+                %(args, args),
+            )
+
+    def __repr__(self):
+        return "param(*%r, **%r)" %self
+
+
+class QuietOrderedDict(MaybeOrderedDict):
+    """ When OrderedDict is available, use it to make sure that the kwargs in
+        doc strings are consistently ordered. """
+    __str__ = dict.__str__
+    __repr__ = dict.__repr__
+
+
+def parameterized_argument_value_pairs(func, p):
+    """Return tuples of parameterized arguments and their values.
+
+        This is useful if you are writing your own doc_func
+        function and need to know the values for each parameter name::
+
+            >>> def func(a, foo=None, bar=42, **kwargs): pass
+            >>> p = param(1, foo=7, extra=99)
+            >>> parameterized_argument_value_pairs(func, p)
+            [("a", 1), ("foo", 7), ("bar", 42), ("**kwargs", {"extra": 99})]
+
+        If the function's first argument is named ``self`` then it will be
+        ignored::
+
+            >>> def func(self, a): pass
+            >>> p = param(1)
+            >>> parameterized_argument_value_pairs(func, p)
+            [("a", 1)]
+
+        Additionally, empty ``*args`` or ``**kwargs`` will be ignored::
+
+            >>> def func(foo, *args): pass
+            >>> p = param(1)
+            >>> parameterized_argument_value_pairs(func, p)
+            [("foo", 1)]
+            >>> p = param(1, 16)
+            >>> parameterized_argument_value_pairs(func, p)
+            [("foo", 1), ("*args", (16, ))]
+    """
+    argspec = inspect.getargspec(func)
+    arg_offset = 1 if argspec.args[:1] == ["self"] else 0
+
+    named_args = argspec.args[arg_offset:]
+
+    result = list(zip(named_args, p.args))
+    named_args = argspec.args[len(result) + arg_offset:]
+    varargs = p.args[len(result):]
+
+    result.extend([
+        (name, p.kwargs.get(name, default))
+        for (name, default)
+        in zip(named_args, argspec.defaults or [])
+    ])
+
+    seen_arg_names = {n for (n, _) in result}
+    keywords = QuietOrderedDict(sorted([
+        (name, p.kwargs[name])
+        for name in p.kwargs
+        if name not in seen_arg_names
+    ]))
+
+    if varargs:
+        result.append(("*%s" %(argspec.varargs, ), tuple(varargs)))
+
+    if keywords:
+        result.append(("**%s" %(argspec.keywords, ), keywords))
+
+    return result
+
+def short_repr(x, n=64):
+    """ A shortened repr of ``x`` which is guaranteed to be ``unicode``::
+
+            >>> short_repr("foo")
+            u"foo"
+            >>> short_repr("123456789", n=4)
+            u"12...89"
+    """
+
+    x_repr = repr(x)
+    if isinstance(x_repr, bytes):
+        try:
+            x_repr = str(x_repr, "utf-8")
+        except UnicodeDecodeError:
+            x_repr = str(x_repr, "latin1")
+    if len(x_repr) > n:
+        x_repr = x_repr[:n//2] + "..." + x_repr[len(x_repr) - n//2:]
+    return x_repr
+
+def default_doc_func(func, num, p):
+    if func.__doc__ is None:
+        return None
+
+    all_args_with_values = parameterized_argument_value_pairs(func, p)
+
+    # Assumes that the function passed is a bound method.
+    descs = ["%s=%s" %(n, short_repr(v)) for n, v in all_args_with_values]
+
+    # The documentation might be a multiline string, so split it
+    # and just work with the first string, ignoring the period
+    # at the end if there is one.
+    first, nl, rest = func.__doc__.lstrip().partition("\n")
+    suffix = ""
+    if first.endswith("."):
+        suffix = "."
+        first = first[:-1]
+    args = "%s[with %s]" %(len(first) and " " or "", ", ".join(descs))
+    return "".join([first.rstrip(), args, suffix, nl, rest])
+
+def default_name_func(func, num, p):
+    base_name = func.__name__
+    name_suffix = "_%s" %(num, )
+    if len(p.args) > 0 and isinstance(p.args[0], (str,)):
+        name_suffix += "_" + parameterized.to_safe_name(p.args[0])
+    return base_name + name_suffix
+
+
+# force nose for numpy purposes.
+_test_runner_override = 'nose'
+_test_runner_guess = False
+_test_runners = set(["unittest", "unittest2", "nose", "nose2", "pytest"])
+_test_runner_aliases = {
+    "_pytest": "pytest",
+}
+
+def set_test_runner(name):
+    global _test_runner_override
+    if name not in _test_runners:
+        raise TypeError(
+            "Invalid test runner: %r (must be one of: %s)"
+            %(name, ", ".join(_test_runners)),
+        )
+    _test_runner_override = name
+
+def detect_runner():
+    """ Guess which test runner we're using by traversing the stack and looking
+        for the first matching module. This *should* be reasonably safe, as
+        it's done during test discovery where the test runner should be the
+        stack frame immediately outside. """
+    if _test_runner_override is not None:
+        return _test_runner_override
+    global _test_runner_guess
+    if _test_runner_guess is False:
+        stack = inspect.stack()
+        for record in reversed(stack):
+            frame = record[0]
+            module = frame.f_globals.get("__name__").partition(".")[0]
+            if module in _test_runner_aliases:
+                module = _test_runner_aliases[module]
+            if module in _test_runners:
+                _test_runner_guess = module
+                break
+        else:
+            _test_runner_guess = None
+    return _test_runner_guess
+
+class parameterized:
+    """ Parameterize a test case::
+
+            class TestInt:
+                @parameterized([
+                    ("A", 10),
+                    ("F", 15),
+                    param("10", 42, base=42)
+                ])
+                def test_int(self, input, expected, base=16):
+                    actual = int(input, base=base)
+                    assert_equal(actual, expected)
+
+            @parameterized([
+                (2, 3, 5)
+                (3, 5, 8),
+            ])
+            def test_add(a, b, expected):
+                assert_equal(a + b, expected)
+        """
+
+    def __init__(self, input, doc_func=None):
+        self.get_input = self.input_as_callable(input)
+        self.doc_func = doc_func or default_doc_func
+
+    def __call__(self, test_func):
+        self.assert_not_in_testcase_subclass()
+
+        @wraps(test_func)
+        def wrapper(test_self=None):
+            test_cls = test_self and type(test_self)
+
+            original_doc = wrapper.__doc__
+            for num, args in enumerate(wrapper.parameterized_input):
+                p = param.from_decorator(args)
+                unbound_func, nose_tuple = self.param_as_nose_tuple(test_self, test_func, num, p)
+                try:
+                    wrapper.__doc__ = nose_tuple[0].__doc__
+                    # Nose uses `getattr(instance, test_func.__name__)` to get
+                    # a method bound to the test instance (as opposed to a
+                    # method bound to the instance of the class created when
+                    # tests were being enumerated). Set a value here to make
+                    # sure nose can get the correct test method.
+                    if test_self is not None:
+                        setattr(test_cls, test_func.__name__, unbound_func)
+                    yield nose_tuple
+                finally:
+                    if test_self is not None:
+                        delattr(test_cls, test_func.__name__)
+                    wrapper.__doc__ = original_doc
+        wrapper.parameterized_input = self.get_input()
+        wrapper.parameterized_func = test_func
+        test_func.__name__ = "_parameterized_original_%s" %(test_func.__name__, )
+        return wrapper
+
+    def param_as_nose_tuple(self, test_self, func, num, p):
+        nose_func = wraps(func)(lambda *args: func(*args[:-1], **args[-1]))
+        nose_func.__doc__ = self.doc_func(func, num, p)
+        # Track the unbound function because we need to setattr the unbound
+        # function onto the class for nose to work (see comments above), and
+        # Python 3 doesn't let us pull the function out of a bound method.
+        unbound_func = nose_func
+        if test_self is not None:
+            nose_func = MethodType(nose_func, test_self)
+        return unbound_func, (nose_func, ) + p.args + (p.kwargs or {}, )
+
+    def assert_not_in_testcase_subclass(self):
+        parent_classes = self._terrible_magic_get_defining_classes()
+        if any(issubclass(cls, TestCase) for cls in parent_classes):
+            raise Exception("Warning: '@parameterized' tests won't work "
+                            "inside subclasses of 'TestCase' - use "
+                            "'@parameterized.expand' instead.")
+
+    def _terrible_magic_get_defining_classes(self):
+        """ Returns the set of parent classes of the class currently being defined.
+            Will likely only work if called from the ``parameterized`` decorator.
+            This function is entirely @brandon_rhodes's fault, as he suggested
+            the implementation: http://stackoverflow.com/a/8793684/71522
+            """
+        stack = inspect.stack()
+        if len(stack) <= 4:
+            return []
+        frame = stack[4]
+        code_context = frame[4] and frame[4][0].strip()
+        if not (code_context and code_context.startswith("class ")):
+            return []
+        _, _, parents = code_context.partition("(")
+        parents, _, _ = parents.partition(")")
+        return eval("[" + parents + "]", frame[0].f_globals, frame[0].f_locals)
+
+    @classmethod
+    def input_as_callable(cls, input):
+        if callable(input):
+            return lambda: cls.check_input_values(input())
+        input_values = cls.check_input_values(input)
+        return lambda: input_values
+
+    @classmethod
+    def check_input_values(cls, input_values):
+        # Explicitly convert non-list inputs to a list so that:
+        # 1. A helpful exception will be raised if they aren't iterable, and
+        # 2. Generators are unwrapped exactly once (otherwise `nosetests
+        #    --processes=n` has issues; see:
+        #    https://github.com/wolever/nose-parameterized/pull/31)
+        if not isinstance(input_values, list):
+            input_values = list(input_values)
+        return [ param.from_decorator(p) for p in input_values ]
+
+    @classmethod
+    def expand(cls, input, name_func=None, doc_func=None, **legacy):
+        """ A "brute force" method of parameterizing test cases. Creates new
+            test cases and injects them into the namespace that the wrapped
+            function is being defined in. Useful for parameterizing tests in
+            subclasses of 'UnitTest', where Nose test generators don't work.
+
+            >>> @parameterized.expand([("foo", 1, 2)])
+            ... def test_add1(name, input, expected):
+            ...     actual = add1(input)
+            ...     assert_equal(actual, expected)
+            ...
+            >>> locals()
+            ... 'test_add1_foo_0': <function ...> ...
+            >>>
+            """
+
+        if "testcase_func_name" in legacy:
+            warnings.warn("testcase_func_name= is deprecated; use name_func=",
+                          DeprecationWarning, stacklevel=2)
+            if not name_func:
+                name_func = legacy["testcase_func_name"]
+
+        if "testcase_func_doc" in legacy:
+            warnings.warn("testcase_func_doc= is deprecated; use doc_func=",
+                          DeprecationWarning, stacklevel=2)
+            if not doc_func:
+                doc_func = legacy["testcase_func_doc"]
+
+        doc_func = doc_func or default_doc_func
+        name_func = name_func or default_name_func
+
+        def parameterized_expand_wrapper(f, instance=None):
+            stack = inspect.stack()
+            frame = stack[1]
+            frame_locals = frame[0].f_locals
+
+            parameters = cls.input_as_callable(input)()
+            for num, p in enumerate(parameters):
+                name = name_func(f, num, p)
+                frame_locals[name] = cls.param_as_standalone_func(p, f, name)
+                frame_locals[name].__doc__ = doc_func(f, num, p)
+
+            f.__test__ = False
+        return parameterized_expand_wrapper
+
+    @classmethod
+    def param_as_standalone_func(cls, p, func, name):
+        @wraps(func)
+        def standalone_func(*a):
+            return func(*(a + p.args), **p.kwargs)
+        standalone_func.__name__ = name
+
+        # place_as is used by py.test to determine what source file should be
+        # used for this test.
+        standalone_func.place_as = func
+
+        # Remove __wrapped__ because py.test will try to look at __wrapped__
+        # to determine which parameters should be used with this test case,
+        # and obviously we don't need it to do any parameterization.
+        try:
+            del standalone_func.__wrapped__
+        except AttributeError:
+            pass
+        return standalone_func
+
+    @classmethod
+    def to_safe_name(cls, s):
+        return str(re.sub("[^a-zA-Z0-9_]+", "_", s))
diff --git a/venv/Lib/site-packages/numpy/testing/_private/utils.py b/venv/Lib/site-packages/numpy/testing/_private/utils.py
new file mode 100644
index 000000000..4097a6738
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/_private/utils.py
@@ -0,0 +1,2509 @@
+"""
+Utility function to facilitate testing.
+
+"""
+import os
+import sys
+import platform
+import re
+import gc
+import operator
+import warnings
+from functools import partial, wraps
+import shutil
+import contextlib
+from tempfile import mkdtemp, mkstemp
+from unittest.case import SkipTest
+from warnings import WarningMessage
+import pprint
+
+from numpy.core import(
+     intp, float32, empty, arange, array_repr, ndarray, isnat, array)
+import numpy.linalg.lapack_lite
+
+from io import StringIO
+
+__all__ = [
+        'assert_equal', 'assert_almost_equal', 'assert_approx_equal',
+        'assert_array_equal', 'assert_array_less', 'assert_string_equal',
+        'assert_array_almost_equal', 'assert_raises', 'build_err_msg',
+        'decorate_methods', 'jiffies', 'memusage', 'print_assert_equal',
+        'raises', 'rundocs', 'runstring', 'verbose', 'measure',
+        'assert_', 'assert_array_almost_equal_nulp', 'assert_raises_regex',
+        'assert_array_max_ulp', 'assert_warns', 'assert_no_warnings',
+        'assert_allclose', 'IgnoreException', 'clear_and_catch_warnings',
+        'SkipTest', 'KnownFailureException', 'temppath', 'tempdir', 'IS_PYPY',
+        'HAS_REFCOUNT', 'suppress_warnings', 'assert_array_compare',
+        '_assert_valid_refcount', '_gen_alignment_data', 'assert_no_gc_cycles',
+        'break_cycles', 'HAS_LAPACK64'
+        ]
+
+
+class KnownFailureException(Exception):
+    '''Raise this exception to mark a test as a known failing test.'''
+    pass
+
+
+KnownFailureTest = KnownFailureException  # backwards compat
+verbose = 0
+
+IS_PYPY = platform.python_implementation() == 'PyPy'
+HAS_REFCOUNT = getattr(sys, 'getrefcount', None) is not None
+HAS_LAPACK64 = numpy.linalg.lapack_lite._ilp64
+
+
+def import_nose():
+    """ Import nose only when needed.
+    """
+    nose_is_good = True
+    minimum_nose_version = (1, 0, 0)
+    try:
+        import nose
+    except ImportError:
+        nose_is_good = False
+    else:
+        if nose.__versioninfo__ < minimum_nose_version:
+            nose_is_good = False
+
+    if not nose_is_good:
+        msg = ('Need nose >= %d.%d.%d for tests - see '
+               'https://nose.readthedocs.io' %
+               minimum_nose_version)
+        raise ImportError(msg)
+
+    return nose
+
+
+def assert_(val, msg=''):
+    """
+    Assert that works in release mode.
+    Accepts callable msg to allow deferring evaluation until failure.
+
+    The Python built-in ``assert`` does not work when executing code in
+    optimized mode (the ``-O`` flag) - no byte-code is generated for it.
+
+    For documentation on usage, refer to the Python documentation.
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    if not val:
+        try:
+            smsg = msg()
+        except TypeError:
+            smsg = msg
+        raise AssertionError(smsg)
+
+
+def gisnan(x):
+    """like isnan, but always raise an error if type not supported instead of
+    returning a TypeError object.
+
+    Notes
+    -----
+    isnan and other ufunc sometimes return a NotImplementedType object instead
+    of raising any exception. This function is a wrapper to make sure an
+    exception is always raised.
+
+    This should be removed once this problem is solved at the Ufunc level."""
+    from numpy.core import isnan
+    st = isnan(x)
+    if isinstance(st, type(NotImplemented)):
+        raise TypeError("isnan not supported for this type")
+    return st
+
+
+def gisfinite(x):
+    """like isfinite, but always raise an error if type not supported instead of
+    returning a TypeError object.
+
+    Notes
+    -----
+    isfinite and other ufunc sometimes return a NotImplementedType object instead
+    of raising any exception. This function is a wrapper to make sure an
+    exception is always raised.
+
+    This should be removed once this problem is solved at the Ufunc level."""
+    from numpy.core import isfinite, errstate
+    with errstate(invalid='ignore'):
+        st = isfinite(x)
+        if isinstance(st, type(NotImplemented)):
+            raise TypeError("isfinite not supported for this type")
+    return st
+
+
+def gisinf(x):
+    """like isinf, but always raise an error if type not supported instead of
+    returning a TypeError object.
+
+    Notes
+    -----
+    isinf and other ufunc sometimes return a NotImplementedType object instead
+    of raising any exception. This function is a wrapper to make sure an
+    exception is always raised.
+
+    This should be removed once this problem is solved at the Ufunc level."""
+    from numpy.core import isinf, errstate
+    with errstate(invalid='ignore'):
+        st = isinf(x)
+        if isinstance(st, type(NotImplemented)):
+            raise TypeError("isinf not supported for this type")
+    return st
+
+
+if os.name == 'nt':
+    # Code "stolen" from enthought/debug/memusage.py
+    def GetPerformanceAttributes(object, counter, instance=None,
+                                 inum=-1, format=None, machine=None):
+        # NOTE: Many counters require 2 samples to give accurate results,
+        # including "% Processor Time" (as by definition, at any instant, a
+        # thread's CPU usage is either 0 or 100).  To read counters like this,
+        # you should copy this function, but keep the counter open, and call
+        # CollectQueryData() each time you need to know.
+        # See http://msdn.microsoft.com/library/en-us/dnperfmo/html/perfmonpt2.asp (dead link)
+        # My older explanation for this was that the "AddCounter" process forced
+        # the CPU to 100%, but the above makes more sense :)
+        import win32pdh
+        if format is None:
+            format = win32pdh.PDH_FMT_LONG
+        path = win32pdh.MakeCounterPath( (machine, object, instance, None, inum, counter))
+        hq = win32pdh.OpenQuery()
+        try:
+            hc = win32pdh.AddCounter(hq, path)
+            try:
+                win32pdh.CollectQueryData(hq)
+                type, val = win32pdh.GetFormattedCounterValue(hc, format)
+                return val
+            finally:
+                win32pdh.RemoveCounter(hc)
+        finally:
+            win32pdh.CloseQuery(hq)
+
+    def memusage(processName="python", instance=0):
+        # from win32pdhutil, part of the win32all package
+        import win32pdh
+        return GetPerformanceAttributes("Process", "Virtual Bytes",
+                                        processName, instance,
+                                        win32pdh.PDH_FMT_LONG, None)
+elif sys.platform[:5] == 'linux':
+
+    def memusage(_proc_pid_stat='/proc/%s/stat' % (os.getpid())):
+        """
+        Return virtual memory size in bytes of the running python.
+
+        """
+        try:
+            with open(_proc_pid_stat, 'r') as f:
+                l = f.readline().split(' ')
+            return int(l[22])
+        except Exception:
+            return
+else:
+    def memusage():
+        """
+        Return memory usage of running python. [Not implemented]
+
+        """
+        raise NotImplementedError
+
+
+if sys.platform[:5] == 'linux':
+    def jiffies(_proc_pid_stat='/proc/%s/stat' % (os.getpid()),
+                _load_time=[]):
+        """
+        Return number of jiffies elapsed.
+
+        Return number of jiffies (1/100ths of a second) that this
+        process has been scheduled in user mode. See man 5 proc.
+
+        """
+        import time
+        if not _load_time:
+            _load_time.append(time.time())
+        try:
+            with open(_proc_pid_stat, 'r') as f:
+                l = f.readline().split(' ')
+            return int(l[13])
+        except Exception:
+            return int(100*(time.time()-_load_time[0]))
+else:
+    # os.getpid is not in all platforms available.
+    # Using time is safe but inaccurate, especially when process
+    # was suspended or sleeping.
+    def jiffies(_load_time=[]):
+        """
+        Return number of jiffies elapsed.
+
+        Return number of jiffies (1/100ths of a second) that this
+        process has been scheduled in user mode. See man 5 proc.
+
+        """
+        import time
+        if not _load_time:
+            _load_time.append(time.time())
+        return int(100*(time.time()-_load_time[0]))
+
+
+def build_err_msg(arrays, err_msg, header='Items are not equal:',
+                  verbose=True, names=('ACTUAL', 'DESIRED'), precision=8):
+    msg = ['\n' + header]
+    if err_msg:
+        if err_msg.find('\n') == -1 and len(err_msg) < 79-len(header):
+            msg = [msg[0] + ' ' + err_msg]
+        else:
+            msg.append(err_msg)
+    if verbose:
+        for i, a in enumerate(arrays):
+
+            if isinstance(a, ndarray):
+                # precision argument is only needed if the objects are ndarrays
+                r_func = partial(array_repr, precision=precision)
+            else:
+                r_func = repr
+
+            try:
+                r = r_func(a)
+            except Exception as exc:
+                r = '[repr failed for <{}>: {}]'.format(type(a).__name__, exc)
+            if r.count('\n') > 3:
+                r = '\n'.join(r.splitlines()[:3])
+                r += '...'
+            msg.append(' %s: %s' % (names[i], r))
+    return '\n'.join(msg)
+
+
+def assert_equal(actual, desired, err_msg='', verbose=True):
+    """
+    Raises an AssertionError if two objects are not equal.
+
+    Given two objects (scalars, lists, tuples, dictionaries or numpy arrays),
+    check that all elements of these objects are equal. An exception is raised
+    at the first conflicting values.
+
+    When one of `actual` and `desired` is a scalar and the other is array_like,
+    the function checks that each element of the array_like object is equal to
+    the scalar.
+
+    This function handles NaN comparisons as if NaN was a "normal" number.
+    That is, AssertionError is not raised if both objects have NaNs in the same
+    positions.  This is in contrast to the IEEE standard on NaNs, which says
+    that NaN compared to anything must return False.
+
+    Parameters
+    ----------
+    actual : array_like
+        The object to check.
+    desired : array_like
+        The expected object.
+    err_msg : str, optional
+        The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+        If actual and desired are not equal.
+
+    Examples
+    --------
+    >>> np.testing.assert_equal([4,5], [4,6])
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Items are not equal:
+    item=1
+     ACTUAL: 5
+     DESIRED: 6
+
+    The following comparison does not raise an exception.  There are NaNs
+    in the inputs, but they are in the same positions.
+
+    >>> np.testing.assert_equal(np.array([1.0, 2.0, np.nan]), [1, 2, np.nan])
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    if isinstance(desired, dict):
+        if not isinstance(actual, dict):
+            raise AssertionError(repr(type(actual)))
+        assert_equal(len(actual), len(desired), err_msg, verbose)
+        for k, i in desired.items():
+            if k not in actual:
+                raise AssertionError(repr(k))
+            assert_equal(actual[k], desired[k], 'key=%r\n%s' % (k, err_msg), verbose)
+        return
+    if isinstance(desired, (list, tuple)) and isinstance(actual, (list, tuple)):
+        assert_equal(len(actual), len(desired), err_msg, verbose)
+        for k in range(len(desired)):
+            assert_equal(actual[k], desired[k], 'item=%r\n%s' % (k, err_msg), verbose)
+        return
+    from numpy.core import ndarray, isscalar, signbit
+    from numpy.lib import iscomplexobj, real, imag
+    if isinstance(actual, ndarray) or isinstance(desired, ndarray):
+        return assert_array_equal(actual, desired, err_msg, verbose)
+    msg = build_err_msg([actual, desired], err_msg, verbose=verbose)
+
+    # Handle complex numbers: separate into real/imag to handle
+    # nan/inf/negative zero correctly
+    # XXX: catch ValueError for subclasses of ndarray where iscomplex fail
+    try:
+        usecomplex = iscomplexobj(actual) or iscomplexobj(desired)
+    except (ValueError, TypeError):
+        usecomplex = False
+
+    if usecomplex:
+        if iscomplexobj(actual):
+            actualr = real(actual)
+            actuali = imag(actual)
+        else:
+            actualr = actual
+            actuali = 0
+        if iscomplexobj(desired):
+            desiredr = real(desired)
+            desiredi = imag(desired)
+        else:
+            desiredr = desired
+            desiredi = 0
+        try:
+            assert_equal(actualr, desiredr)
+            assert_equal(actuali, desiredi)
+        except AssertionError:
+            raise AssertionError(msg)
+
+    # isscalar test to check cases such as [np.nan] != np.nan
+    if isscalar(desired) != isscalar(actual):
+        raise AssertionError(msg)
+
+    try:
+        isdesnat = isnat(desired)
+        isactnat = isnat(actual)
+        dtypes_match = array(desired).dtype.type == array(actual).dtype.type
+        if isdesnat and isactnat:
+            # If both are NaT (and have the same dtype -- datetime or
+            # timedelta) they are considered equal.
+            if dtypes_match:
+                return
+            else:
+                raise AssertionError(msg)
+
+    except (TypeError, ValueError, NotImplementedError):
+        pass
+
+    # Inf/nan/negative zero handling
+    try:
+        isdesnan = gisnan(desired)
+        isactnan = gisnan(actual)
+        if isdesnan and isactnan:
+            return  # both nan, so equal
+
+        # handle signed zero specially for floats
+        array_actual = array(actual)
+        array_desired = array(desired)
+        if (array_actual.dtype.char in 'Mm' or
+                array_desired.dtype.char in 'Mm'):
+            # version 1.18
+            # until this version, gisnan failed for datetime64 and timedelta64.
+            # Now it succeeds but comparison to scalar with a different type
+            # emits a DeprecationWarning.
+            # Avoid that by skipping the next check
+            raise NotImplementedError('cannot compare to a scalar '
+                                      'with a different type')
+
+        if desired == 0 and actual == 0:
+            if not signbit(desired) == signbit(actual):
+                raise AssertionError(msg)
+
+    except (TypeError, ValueError, NotImplementedError):
+        pass
+
+    try:
+        # Explicitly use __eq__ for comparison, gh-2552
+        if not (desired == actual):
+            raise AssertionError(msg)
+
+    except (DeprecationWarning, FutureWarning) as e:
+        # this handles the case when the two types are not even comparable
+        if 'elementwise == comparison' in e.args[0]:
+            raise AssertionError(msg)
+        else:
+            raise
+
+
+def print_assert_equal(test_string, actual, desired):
+    """
+    Test if two objects are equal, and print an error message if test fails.
+
+    The test is performed with ``actual == desired``.
+
+    Parameters
+    ----------
+    test_string : str
+        The message supplied to AssertionError.
+    actual : object
+        The object to test for equality against `desired`.
+    desired : object
+        The expected result.
+
+    Examples
+    --------
+    >>> np.testing.print_assert_equal('Test XYZ of func xyz', [0, 1], [0, 1])
+    >>> np.testing.print_assert_equal('Test XYZ of func xyz', [0, 1], [0, 2])
+    Traceback (most recent call last):
+    ...
+    AssertionError: Test XYZ of func xyz failed
+    ACTUAL:
+    [0, 1]
+    DESIRED:
+    [0, 2]
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import pprint
+
+    if not (actual == desired):
+        msg = StringIO()
+        msg.write(test_string)
+        msg.write(' failed\nACTUAL: \n')
+        pprint.pprint(actual, msg)
+        msg.write('DESIRED: \n')
+        pprint.pprint(desired, msg)
+        raise AssertionError(msg.getvalue())
+
+
+def assert_almost_equal(actual,desired,decimal=7,err_msg='',verbose=True):
+    """
+    Raises an AssertionError if two items are not equal up to desired
+    precision.
+
+    .. note:: It is recommended to use one of `assert_allclose`,
+              `assert_array_almost_equal_nulp` or `assert_array_max_ulp`
+              instead of this function for more consistent floating point
+              comparisons.
+
+    The test verifies that the elements of ``actual`` and ``desired`` satisfy.
+
+        ``abs(desired-actual) < 1.5 * 10**(-decimal)``
+
+    That is a looser test than originally documented, but agrees with what the
+    actual implementation in `assert_array_almost_equal` did up to rounding
+    vagaries. An exception is raised at conflicting values. For ndarrays this
+    delegates to assert_array_almost_equal
+
+    Parameters
+    ----------
+    actual : array_like
+        The object to check.
+    desired : array_like
+        The expected object.
+    decimal : int, optional
+        Desired precision, default is 7.
+    err_msg : str, optional
+        The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+      If actual and desired are not equal up to specified precision.
+
+    See Also
+    --------
+    assert_allclose: Compare two array_like objects for equality with desired
+                     relative and/or absolute precision.
+    assert_array_almost_equal_nulp, assert_array_max_ulp, assert_equal
+
+    Examples
+    --------
+    >>> import numpy.testing as npt
+    >>> npt.assert_almost_equal(2.3333333333333, 2.33333334)
+    >>> npt.assert_almost_equal(2.3333333333333, 2.33333334, decimal=10)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not almost equal to 10 decimals
+     ACTUAL: 2.3333333333333
+     DESIRED: 2.33333334
+
+    >>> npt.assert_almost_equal(np.array([1.0,2.3333333333333]),
+    ...                         np.array([1.0,2.33333334]), decimal=9)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not almost equal to 9 decimals
+    <BLANKLINE>
+    Mismatched elements: 1 / 2 (50%)
+    Max absolute difference: 6.66669964e-09
+    Max relative difference: 2.85715698e-09
+     x: array([1.         , 2.333333333])
+     y: array([1.        , 2.33333334])
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    from numpy.core import ndarray
+    from numpy.lib import iscomplexobj, real, imag
+
+    # Handle complex numbers: separate into real/imag to handle
+    # nan/inf/negative zero correctly
+    # XXX: catch ValueError for subclasses of ndarray where iscomplex fail
+    try:
+        usecomplex = iscomplexobj(actual) or iscomplexobj(desired)
+    except ValueError:
+        usecomplex = False
+
+    def _build_err_msg():
+        header = ('Arrays are not almost equal to %d decimals' % decimal)
+        return build_err_msg([actual, desired], err_msg, verbose=verbose,
+                             header=header)
+
+    if usecomplex:
+        if iscomplexobj(actual):
+            actualr = real(actual)
+            actuali = imag(actual)
+        else:
+            actualr = actual
+            actuali = 0
+        if iscomplexobj(desired):
+            desiredr = real(desired)
+            desiredi = imag(desired)
+        else:
+            desiredr = desired
+            desiredi = 0
+        try:
+            assert_almost_equal(actualr, desiredr, decimal=decimal)
+            assert_almost_equal(actuali, desiredi, decimal=decimal)
+        except AssertionError:
+            raise AssertionError(_build_err_msg())
+
+    if isinstance(actual, (ndarray, tuple, list)) \
+            or isinstance(desired, (ndarray, tuple, list)):
+        return assert_array_almost_equal(actual, desired, decimal, err_msg)
+    try:
+        # If one of desired/actual is not finite, handle it specially here:
+        # check that both are nan if any is a nan, and test for equality
+        # otherwise
+        if not (gisfinite(desired) and gisfinite(actual)):
+            if gisnan(desired) or gisnan(actual):
+                if not (gisnan(desired) and gisnan(actual)):
+                    raise AssertionError(_build_err_msg())
+            else:
+                if not desired == actual:
+                    raise AssertionError(_build_err_msg())
+            return
+    except (NotImplementedError, TypeError):
+        pass
+    if abs(desired - actual) >= 1.5 * 10.0**(-decimal):
+        raise AssertionError(_build_err_msg())
+
+
+def assert_approx_equal(actual,desired,significant=7,err_msg='',verbose=True):
+    """
+    Raises an AssertionError if two items are not equal up to significant
+    digits.
+
+    .. note:: It is recommended to use one of `assert_allclose`,
+              `assert_array_almost_equal_nulp` or `assert_array_max_ulp`
+              instead of this function for more consistent floating point
+              comparisons.
+
+    Given two numbers, check that they are approximately equal.
+    Approximately equal is defined as the number of significant digits
+    that agree.
+
+    Parameters
+    ----------
+    actual : scalar
+        The object to check.
+    desired : scalar
+        The expected object.
+    significant : int, optional
+        Desired precision, default is 7.
+    err_msg : str, optional
+        The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+      If actual and desired are not equal up to specified precision.
+
+    See Also
+    --------
+    assert_allclose: Compare two array_like objects for equality with desired
+                     relative and/or absolute precision.
+    assert_array_almost_equal_nulp, assert_array_max_ulp, assert_equal
+
+    Examples
+    --------
+    >>> np.testing.assert_approx_equal(0.12345677777777e-20, 0.1234567e-20)
+    >>> np.testing.assert_approx_equal(0.12345670e-20, 0.12345671e-20,
+    ...                                significant=8)
+    >>> np.testing.assert_approx_equal(0.12345670e-20, 0.12345672e-20,
+    ...                                significant=8)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Items are not equal to 8 significant digits:
+     ACTUAL: 1.234567e-21
+     DESIRED: 1.2345672e-21
+
+    the evaluated condition that raises the exception is
+
+    >>> abs(0.12345670e-20/1e-21 - 0.12345672e-20/1e-21) >= 10**-(8-1)
+    True
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import numpy as np
+
+    (actual, desired) = map(float, (actual, desired))
+    if desired == actual:
+        return
+    # Normalized the numbers to be in range (-10.0,10.0)
+    # scale = float(pow(10,math.floor(math.log10(0.5*(abs(desired)+abs(actual))))))
+    with np.errstate(invalid='ignore'):
+        scale = 0.5*(np.abs(desired) + np.abs(actual))
+        scale = np.power(10, np.floor(np.log10(scale)))
+    try:
+        sc_desired = desired/scale
+    except ZeroDivisionError:
+        sc_desired = 0.0
+    try:
+        sc_actual = actual/scale
+    except ZeroDivisionError:
+        sc_actual = 0.0
+    msg = build_err_msg(
+        [actual, desired], err_msg,
+        header='Items are not equal to %d significant digits:' % significant,
+        verbose=verbose)
+    try:
+        # If one of desired/actual is not finite, handle it specially here:
+        # check that both are nan if any is a nan, and test for equality
+        # otherwise
+        if not (gisfinite(desired) and gisfinite(actual)):
+            if gisnan(desired) or gisnan(actual):
+                if not (gisnan(desired) and gisnan(actual)):
+                    raise AssertionError(msg)
+            else:
+                if not desired == actual:
+                    raise AssertionError(msg)
+            return
+    except (TypeError, NotImplementedError):
+        pass
+    if np.abs(sc_desired - sc_actual) >= np.power(10., -(significant-1)):
+        raise AssertionError(msg)
+
+
+def assert_array_compare(comparison, x, y, err_msg='', verbose=True,
+                         header='', precision=6, equal_nan=True,
+                         equal_inf=True):
+    __tracebackhide__ = True  # Hide traceback for py.test
+    from numpy.core import array, array2string, isnan, inf, bool_, errstate, all, max, object_
+
+    x = array(x, copy=False, subok=True)
+    y = array(y, copy=False, subok=True)
+
+    # original array for output formatting
+    ox, oy = x, y
+
+    def isnumber(x):
+        return x.dtype.char in '?bhilqpBHILQPefdgFDG'
+
+    def istime(x):
+        return x.dtype.char in "Mm"
+
+    def func_assert_same_pos(x, y, func=isnan, hasval='nan'):
+        """Handling nan/inf.
+
+        Combine results of running func on x and y, checking that they are True
+        at the same locations.
+
+        """
+        x_id = func(x)
+        y_id = func(y)
+        # We include work-arounds here to handle three types of slightly
+        # pathological ndarray subclasses:
+        # (1) all() on `masked` array scalars can return masked arrays, so we
+        #     use != True
+        # (2) __eq__ on some ndarray subclasses returns Python booleans
+        #     instead of element-wise comparisons, so we cast to bool_() and
+        #     use isinstance(..., bool) checks
+        # (3) subclasses with bare-bones __array_function__ implementations may
+        #     not implement np.all(), so favor using the .all() method
+        # We are not committed to supporting such subclasses, but it's nice to
+        # support them if possible.
+        if bool_(x_id == y_id).all() != True:
+            msg = build_err_msg([x, y],
+                                err_msg + '\nx and y %s location mismatch:'
+                                % (hasval), verbose=verbose, header=header,
+                                names=('x', 'y'), precision=precision)
+            raise AssertionError(msg)
+        # If there is a scalar, then here we know the array has the same
+        # flag as it everywhere, so we should return the scalar flag.
+        if isinstance(x_id, bool) or x_id.ndim == 0:
+            return bool_(x_id)
+        elif isinstance(x_id, bool) or y_id.ndim == 0:
+            return bool_(y_id)
+        else:
+            return y_id
+
+    try:
+        cond = (x.shape == () or y.shape == ()) or x.shape == y.shape
+        if not cond:
+            msg = build_err_msg([x, y],
+                                err_msg
+                                + '\n(shapes %s, %s mismatch)' % (x.shape,
+                                                                  y.shape),
+                                verbose=verbose, header=header,
+                                names=('x', 'y'), precision=precision)
+            raise AssertionError(msg)
+
+        flagged = bool_(False)
+        if isnumber(x) and isnumber(y):
+            if equal_nan:
+                flagged = func_assert_same_pos(x, y, func=isnan, hasval='nan')
+
+            if equal_inf:
+                flagged |= func_assert_same_pos(x, y,
+                                                func=lambda xy: xy == +inf,
+                                                hasval='+inf')
+                flagged |= func_assert_same_pos(x, y,
+                                                func=lambda xy: xy == -inf,
+                                                hasval='-inf')
+
+        elif istime(x) and istime(y):
+            # If one is datetime64 and the other timedelta64 there is no point
+            if equal_nan and x.dtype.type == y.dtype.type:
+                flagged = func_assert_same_pos(x, y, func=isnat, hasval="NaT")
+
+        if flagged.ndim > 0:
+            x, y = x[~flagged], y[~flagged]
+            # Only do the comparison if actual values are left
+            if x.size == 0:
+                return
+        elif flagged:
+            # no sense doing comparison if everything is flagged.
+            return
+
+        val = comparison(x, y)
+
+        if isinstance(val, bool):
+            cond = val
+            reduced = array([val])
+        else:
+            reduced = val.ravel()
+            cond = reduced.all()
+
+        # The below comparison is a hack to ensure that fully masked
+        # results, for which val.ravel().all() returns np.ma.masked,
+        # do not trigger a failure (np.ma.masked != True evaluates as
+        # np.ma.masked, which is falsy).
+        if cond != True:
+            n_mismatch = reduced.size - reduced.sum(dtype=intp)
+            n_elements = flagged.size if flagged.ndim != 0 else reduced.size
+            percent_mismatch = 100 * n_mismatch / n_elements
+            remarks = [
+                'Mismatched elements: {} / {} ({:.3g}%)'.format(
+                    n_mismatch, n_elements, percent_mismatch)]
+
+            with errstate(invalid='ignore', divide='ignore'):
+                # ignore errors for non-numeric types
+                with contextlib.suppress(TypeError):
+                    error = abs(x - y)
+                    max_abs_error = max(error)
+                    if getattr(error, 'dtype', object_) == object_:
+                        remarks.append('Max absolute difference: '
+                                        + str(max_abs_error))
+                    else:
+                        remarks.append('Max absolute difference: '
+                                        + array2string(max_abs_error))
+
+                    # note: this definition of relative error matches that one
+                    # used by assert_allclose (found in np.isclose)
+                    # Filter values where the divisor would be zero
+                    nonzero = bool_(y != 0)
+                    if all(~nonzero):
+                        max_rel_error = array(inf)
+                    else:
+                        max_rel_error = max(error[nonzero] / abs(y[nonzero]))
+                    if getattr(error, 'dtype', object_) == object_:
+                        remarks.append('Max relative difference: '
+                                        + str(max_rel_error))
+                    else:
+                        remarks.append('Max relative difference: '
+                                        + array2string(max_rel_error))
+
+            err_msg += '\n' + '\n'.join(remarks)
+            msg = build_err_msg([ox, oy], err_msg,
+                                verbose=verbose, header=header,
+                                names=('x', 'y'), precision=precision)
+            raise AssertionError(msg)
+    except ValueError:
+        import traceback
+        efmt = traceback.format_exc()
+        header = 'error during assertion:\n\n%s\n\n%s' % (efmt, header)
+
+        msg = build_err_msg([x, y], err_msg, verbose=verbose, header=header,
+                            names=('x', 'y'), precision=precision)
+        raise ValueError(msg)
+
+
+def assert_array_equal(x, y, err_msg='', verbose=True):
+    """
+    Raises an AssertionError if two array_like objects are not equal.
+
+    Given two array_like objects, check that the shape is equal and all
+    elements of these objects are equal (but see the Notes for the special
+    handling of a scalar). An exception is raised at shape mismatch or
+    conflicting values. In contrast to the standard usage in numpy, NaNs
+    are compared like numbers, no assertion is raised if both objects have
+    NaNs in the same positions.
+
+    The usual caution for verifying equality with floating point numbers is
+    advised.
+
+    Parameters
+    ----------
+    x : array_like
+        The actual object to check.
+    y : array_like
+        The desired, expected object.
+    err_msg : str, optional
+        The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+        If actual and desired objects are not equal.
+
+    See Also
+    --------
+    assert_allclose: Compare two array_like objects for equality with desired
+                     relative and/or absolute precision.
+    assert_array_almost_equal_nulp, assert_array_max_ulp, assert_equal
+
+    Notes
+    -----
+    When one of `x` and `y` is a scalar and the other is array_like, the
+    function checks that each element of the array_like object is equal to
+    the scalar.
+
+    Examples
+    --------
+    The first assert does not raise an exception:
+
+    >>> np.testing.assert_array_equal([1.0,2.33333,np.nan],
+    ...                               [np.exp(0),2.33333, np.nan])
+
+    Assert fails with numerical imprecision with floats:
+
+    >>> np.testing.assert_array_equal([1.0,np.pi,np.nan],
+    ...                               [1, np.sqrt(np.pi)**2, np.nan])
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not equal
+    <BLANKLINE>
+    Mismatched elements: 1 / 3 (33.3%)
+    Max absolute difference: 4.4408921e-16
+    Max relative difference: 1.41357986e-16
+     x: array([1.      , 3.141593,      nan])
+     y: array([1.      , 3.141593,      nan])
+
+    Use `assert_allclose` or one of the nulp (number of floating point values)
+    functions for these cases instead:
+
+    >>> np.testing.assert_allclose([1.0,np.pi,np.nan],
+    ...                            [1, np.sqrt(np.pi)**2, np.nan],
+    ...                            rtol=1e-10, atol=0)
+
+    As mentioned in the Notes section, `assert_array_equal` has special
+    handling for scalars. Here the test checks that each value in `x` is 3:
+
+    >>> x = np.full((2, 5), fill_value=3)
+    >>> np.testing.assert_array_equal(x, 3)
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    assert_array_compare(operator.__eq__, x, y, err_msg=err_msg,
+                         verbose=verbose, header='Arrays are not equal')
+
+
+def assert_array_almost_equal(x, y, decimal=6, err_msg='', verbose=True):
+    """
+    Raises an AssertionError if two objects are not equal up to desired
+    precision.
+
+    .. note:: It is recommended to use one of `assert_allclose`,
+              `assert_array_almost_equal_nulp` or `assert_array_max_ulp`
+              instead of this function for more consistent floating point
+              comparisons.
+
+    The test verifies identical shapes and that the elements of ``actual`` and
+    ``desired`` satisfy.
+
+        ``abs(desired-actual) < 1.5 * 10**(-decimal)``
+
+    That is a looser test than originally documented, but agrees with what the
+    actual implementation did up to rounding vagaries. An exception is raised
+    at shape mismatch or conflicting values. In contrast to the standard usage
+    in numpy, NaNs are compared like numbers, no assertion is raised if both
+    objects have NaNs in the same positions.
+
+    Parameters
+    ----------
+    x : array_like
+        The actual object to check.
+    y : array_like
+        The desired, expected object.
+    decimal : int, optional
+        Desired precision, default is 6.
+    err_msg : str, optional
+      The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+        If actual and desired are not equal up to specified precision.
+
+    See Also
+    --------
+    assert_allclose: Compare two array_like objects for equality with desired
+                     relative and/or absolute precision.
+    assert_array_almost_equal_nulp, assert_array_max_ulp, assert_equal
+
+    Examples
+    --------
+    the first assert does not raise an exception
+
+    >>> np.testing.assert_array_almost_equal([1.0,2.333,np.nan],
+    ...                                      [1.0,2.333,np.nan])
+
+    >>> np.testing.assert_array_almost_equal([1.0,2.33333,np.nan],
+    ...                                      [1.0,2.33339,np.nan], decimal=5)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not almost equal to 5 decimals
+    <BLANKLINE>
+    Mismatched elements: 1 / 3 (33.3%)
+    Max absolute difference: 6.e-05
+    Max relative difference: 2.57136612e-05
+     x: array([1.     , 2.33333,     nan])
+     y: array([1.     , 2.33339,     nan])
+
+    >>> np.testing.assert_array_almost_equal([1.0,2.33333,np.nan],
+    ...                                      [1.0,2.33333, 5], decimal=5)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not almost equal to 5 decimals
+    <BLANKLINE>
+    x and y nan location mismatch:
+     x: array([1.     , 2.33333,     nan])
+     y: array([1.     , 2.33333, 5.     ])
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    from numpy.core import number, float_, result_type, array
+    from numpy.core.numerictypes import issubdtype
+    from numpy.core.fromnumeric import any as npany
+
+    def compare(x, y):
+        try:
+            if npany(gisinf(x)) or npany( gisinf(y)):
+                xinfid = gisinf(x)
+                yinfid = gisinf(y)
+                if not (xinfid == yinfid).all():
+                    return False
+                # if one item, x and y is +- inf
+                if x.size == y.size == 1:
+                    return x == y
+                x = x[~xinfid]
+                y = y[~yinfid]
+        except (TypeError, NotImplementedError):
+            pass
+
+        # make sure y is an inexact type to avoid abs(MIN_INT); will cause
+        # casting of x later.
+        dtype = result_type(y, 1.)
+        y = array(y, dtype=dtype, copy=False, subok=True)
+        z = abs(x - y)
+
+        if not issubdtype(z.dtype, number):
+            z = z.astype(float_)  # handle object arrays
+
+        return z < 1.5 * 10.0**(-decimal)
+
+    assert_array_compare(compare, x, y, err_msg=err_msg, verbose=verbose,
+             header=('Arrays are not almost equal to %d decimals' % decimal),
+             precision=decimal)
+
+
+def assert_array_less(x, y, err_msg='', verbose=True):
+    """
+    Raises an AssertionError if two array_like objects are not ordered by less
+    than.
+
+    Given two array_like objects, check that the shape is equal and all
+    elements of the first object are strictly smaller than those of the
+    second object. An exception is raised at shape mismatch or incorrectly
+    ordered values. Shape mismatch does not raise if an object has zero
+    dimension. In contrast to the standard usage in numpy, NaNs are
+    compared, no assertion is raised if both objects have NaNs in the same
+    positions.
+
+
+
+    Parameters
+    ----------
+    x : array_like
+      The smaller object to check.
+    y : array_like
+      The larger object to compare.
+    err_msg : string
+      The error message to be printed in case of failure.
+    verbose : bool
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+      If actual and desired objects are not equal.
+
+    See Also
+    --------
+    assert_array_equal: tests objects for equality
+    assert_array_almost_equal: test objects for equality up to precision
+
+
+
+    Examples
+    --------
+    >>> np.testing.assert_array_less([1.0, 1.0, np.nan], [1.1, 2.0, np.nan])
+    >>> np.testing.assert_array_less([1.0, 1.0, np.nan], [1, 2.0, np.nan])
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not less-ordered
+    <BLANKLINE>
+    Mismatched elements: 1 / 3 (33.3%)
+    Max absolute difference: 1.
+    Max relative difference: 0.5
+     x: array([ 1.,  1., nan])
+     y: array([ 1.,  2., nan])
+
+    >>> np.testing.assert_array_less([1.0, 4.0], 3)
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not less-ordered
+    <BLANKLINE>
+    Mismatched elements: 1 / 2 (50%)
+    Max absolute difference: 2.
+    Max relative difference: 0.66666667
+     x: array([1., 4.])
+     y: array(3)
+
+    >>> np.testing.assert_array_less([1.0, 2.0, 3.0], [4])
+    Traceback (most recent call last):
+        ...
+    AssertionError:
+    Arrays are not less-ordered
+    <BLANKLINE>
+    (shapes (3,), (1,) mismatch)
+     x: array([1., 2., 3.])
+     y: array([4])
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    assert_array_compare(operator.__lt__, x, y, err_msg=err_msg,
+                         verbose=verbose,
+                         header='Arrays are not less-ordered',
+                         equal_inf=False)
+
+
+def runstring(astr, dict):
+    exec(astr, dict)
+
+
+def assert_string_equal(actual, desired):
+    """
+    Test if two strings are equal.
+
+    If the given strings are equal, `assert_string_equal` does nothing.
+    If they are not equal, an AssertionError is raised, and the diff
+    between the strings is shown.
+
+    Parameters
+    ----------
+    actual : str
+        The string to test for equality against the expected string.
+    desired : str
+        The expected string.
+
+    Examples
+    --------
+    >>> np.testing.assert_string_equal('abc', 'abc')
+    >>> np.testing.assert_string_equal('abc', 'abcd')
+    Traceback (most recent call last):
+      File "<stdin>", line 1, in <module>
+    ...
+    AssertionError: Differences in strings:
+    - abc+ abcd?    +
+
+    """
+    # delay import of difflib to reduce startup time
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import difflib
+
+    if not isinstance(actual, str):
+        raise AssertionError(repr(type(actual)))
+    if not isinstance(desired, str):
+        raise AssertionError(repr(type(desired)))
+    if desired == actual:
+        return
+
+    diff = list(difflib.Differ().compare(actual.splitlines(True), desired.splitlines(True)))
+    diff_list = []
+    while diff:
+        d1 = diff.pop(0)
+        if d1.startswith('  '):
+            continue
+        if d1.startswith('- '):
+            l = [d1]
+            d2 = diff.pop(0)
+            if d2.startswith('? '):
+                l.append(d2)
+                d2 = diff.pop(0)
+            if not d2.startswith('+ '):
+                raise AssertionError(repr(d2))
+            l.append(d2)
+            if diff:
+                d3 = diff.pop(0)
+                if d3.startswith('? '):
+                    l.append(d3)
+                else:
+                    diff.insert(0, d3)
+            if d2[2:] == d1[2:]:
+                continue
+            diff_list.extend(l)
+            continue
+        raise AssertionError(repr(d1))
+    if not diff_list:
+        return
+    msg = 'Differences in strings:\n%s' % (''.join(diff_list)).rstrip()
+    if actual != desired:
+        raise AssertionError(msg)
+
+
+def rundocs(filename=None, raise_on_error=True):
+    """
+    Run doctests found in the given file.
+
+    By default `rundocs` raises an AssertionError on failure.
+
+    Parameters
+    ----------
+    filename : str
+        The path to the file for which the doctests are run.
+    raise_on_error : bool
+        Whether to raise an AssertionError when a doctest fails. Default is
+        True.
+
+    Notes
+    -----
+    The doctests can be run by the user/developer by adding the ``doctests``
+    argument to the ``test()`` call. For example, to run all tests (including
+    doctests) for `numpy.lib`:
+
+    >>> np.lib.test(doctests=True)  # doctest: +SKIP
+    """
+    from numpy.compat import npy_load_module
+    import doctest
+    if filename is None:
+        f = sys._getframe(1)
+        filename = f.f_globals['__file__']
+    name = os.path.splitext(os.path.basename(filename))[0]
+    m = npy_load_module(name, filename)
+
+    tests = doctest.DocTestFinder().find(m)
+    runner = doctest.DocTestRunner(verbose=False)
+
+    msg = []
+    if raise_on_error:
+        out = lambda s: msg.append(s)
+    else:
+        out = None
+
+    for test in tests:
+        runner.run(test, out=out)
+
+    if runner.failures > 0 and raise_on_error:
+        raise AssertionError("Some doctests failed:\n%s" % "\n".join(msg))
+
+
+def raises(*args):
+    """Decorator to check for raised exceptions.
+
+    The decorated test function must raise one of the passed exceptions to
+    pass.  If you want to test many assertions about exceptions in a single
+    test, you may want to use `assert_raises` instead.
+
+    .. warning::
+       This decorator is nose specific, do not use it if you are using a
+       different test framework.
+
+    Parameters
+    ----------
+    args : exceptions
+        The test passes if any of the passed exceptions is raised.
+
+    Raises
+    ------
+    AssertionError
+
+    Examples
+    --------
+
+    Usage::
+
+        @raises(TypeError, ValueError)
+        def test_raises_type_error():
+            raise TypeError("This test passes")
+
+        @raises(Exception)
+        def test_that_fails_by_passing():
+            pass
+
+    """
+    nose = import_nose()
+    return nose.tools.raises(*args)
+
+#
+# assert_raises and assert_raises_regex are taken from unittest.
+#
+import unittest
+
+
+class _Dummy(unittest.TestCase):
+    def nop(self):
+        pass
+
+_d = _Dummy('nop')
+
+def assert_raises(*args, **kwargs):
+    """
+    assert_raises(exception_class, callable, *args, **kwargs)
+    assert_raises(exception_class)
+
+    Fail unless an exception of class exception_class is thrown
+    by callable when invoked with arguments args and keyword
+    arguments kwargs. If a different type of exception is
+    thrown, it will not be caught, and the test case will be
+    deemed to have suffered an error, exactly as for an
+    unexpected exception.
+
+    Alternatively, `assert_raises` can be used as a context manager:
+
+    >>> from numpy.testing import assert_raises
+    >>> with assert_raises(ZeroDivisionError):
+    ...     1 / 0
+
+    is equivalent to
+
+    >>> def div(x, y):
+    ...     return x / y
+    >>> assert_raises(ZeroDivisionError, div, 1, 0)
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    return _d.assertRaises(*args,**kwargs)
+
+
+def assert_raises_regex(exception_class, expected_regexp, *args, **kwargs):
+    """
+    assert_raises_regex(exception_class, expected_regexp, callable, *args,
+                        **kwargs)
+    assert_raises_regex(exception_class, expected_regexp)
+
+    Fail unless an exception of class exception_class and with message that
+    matches expected_regexp is thrown by callable when invoked with arguments
+    args and keyword arguments kwargs.
+
+    Alternatively, can be used as a context manager like `assert_raises`.
+
+    Name of this function adheres to Python 3.2+ reference, but should work in
+    all versions down to 2.6.
+
+    Notes
+    -----
+    .. versionadded:: 1.9.0
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    return _d.assertRaisesRegex(exception_class, expected_regexp, *args, **kwargs)
+
+
+def decorate_methods(cls, decorator, testmatch=None):
+    """
+    Apply a decorator to all methods in a class matching a regular expression.
+
+    The given decorator is applied to all public methods of `cls` that are
+    matched by the regular expression `testmatch`
+    (``testmatch.search(methodname)``). Methods that are private, i.e. start
+    with an underscore, are ignored.
+
+    Parameters
+    ----------
+    cls : class
+        Class whose methods to decorate.
+    decorator : function
+        Decorator to apply to methods
+    testmatch : compiled regexp or str, optional
+        The regular expression. Default value is None, in which case the
+        nose default (``re.compile(r'(?:^|[\\b_\\.%s-])[Tt]est' % os.sep)``)
+        is used.
+        If `testmatch` is a string, it is compiled to a regular expression
+        first.
+
+    """
+    if testmatch is None:
+        testmatch = re.compile(r'(?:^|[\\b_\\.%s-])[Tt]est' % os.sep)
+    else:
+        testmatch = re.compile(testmatch)
+    cls_attr = cls.__dict__
+
+    # delayed import to reduce startup time
+    from inspect import isfunction
+
+    methods = [_m for _m in cls_attr.values() if isfunction(_m)]
+    for function in methods:
+        try:
+            if hasattr(function, 'compat_func_name'):
+                funcname = function.compat_func_name
+            else:
+                funcname = function.__name__
+        except AttributeError:
+            # not a function
+            continue
+        if testmatch.search(funcname) and not funcname.startswith('_'):
+            setattr(cls, funcname, decorator(function))
+    return
+
+
+def measure(code_str, times=1, label=None):
+    """
+    Return elapsed time for executing code in the namespace of the caller.
+
+    The supplied code string is compiled with the Python builtin ``compile``.
+    The precision of the timing is 10 milli-seconds. If the code will execute
+    fast on this timescale, it can be executed many times to get reasonable
+    timing accuracy.
+
+    Parameters
+    ----------
+    code_str : str
+        The code to be timed.
+    times : int, optional
+        The number of times the code is executed. Default is 1. The code is
+        only compiled once.
+    label : str, optional
+        A label to identify `code_str` with. This is passed into ``compile``
+        as the second argument (for run-time error messages).
+
+    Returns
+    -------
+    elapsed : float
+        Total elapsed time in seconds for executing `code_str` `times` times.
+
+    Examples
+    --------
+    >>> times = 10
+    >>> etime = np.testing.measure('for i in range(1000): np.sqrt(i**2)', times=times)
+    >>> print("Time for a single execution : ", etime / times, "s")  # doctest: +SKIP
+    Time for a single execution :  0.005 s
+
+    """
+    frame = sys._getframe(1)
+    locs, globs = frame.f_locals, frame.f_globals
+
+    code = compile(code_str,
+                   'Test name: %s ' % label,
+                   'exec')
+    i = 0
+    elapsed = jiffies()
+    while i < times:
+        i += 1
+        exec(code, globs, locs)
+    elapsed = jiffies() - elapsed
+    return 0.01*elapsed
+
+
+def _assert_valid_refcount(op):
+    """
+    Check that ufuncs don't mishandle refcount of object `1`.
+    Used in a few regression tests.
+    """
+    if not HAS_REFCOUNT:
+        return True
+
+    import gc
+    import numpy as np
+
+    b = np.arange(100*100).reshape(100, 100)
+    c = b
+    i = 1
+
+    gc.disable()
+    try:
+        rc = sys.getrefcount(i)
+        for j in range(15):
+            d = op(b, c)
+        assert_(sys.getrefcount(i) >= rc)
+    finally:
+        gc.enable()
+    del d  # for pyflakes
+
+
+def assert_allclose(actual, desired, rtol=1e-7, atol=0, equal_nan=True,
+                    err_msg='', verbose=True):
+    """
+    Raises an AssertionError if two objects are not equal up to desired
+    tolerance.
+
+    The test is equivalent to ``allclose(actual, desired, rtol, atol)`` (note
+    that ``allclose`` has different default values). It compares the difference
+    between `actual` and `desired` to ``atol + rtol * abs(desired)``.
+
+    .. versionadded:: 1.5.0
+
+    Parameters
+    ----------
+    actual : array_like
+        Array obtained.
+    desired : array_like
+        Array desired.
+    rtol : float, optional
+        Relative tolerance.
+    atol : float, optional
+        Absolute tolerance.
+    equal_nan : bool, optional.
+        If True, NaNs will compare equal.
+    err_msg : str, optional
+        The error message to be printed in case of failure.
+    verbose : bool, optional
+        If True, the conflicting values are appended to the error message.
+
+    Raises
+    ------
+    AssertionError
+        If actual and desired are not equal up to specified precision.
+
+    See Also
+    --------
+    assert_array_almost_equal_nulp, assert_array_max_ulp
+
+    Examples
+    --------
+    >>> x = [1e-5, 1e-3, 1e-1]
+    >>> y = np.arccos(np.cos(x))
+    >>> np.testing.assert_allclose(x, y, rtol=1e-5, atol=0)
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import numpy as np
+
+    def compare(x, y):
+        return np.core.numeric.isclose(x, y, rtol=rtol, atol=atol,
+                                       equal_nan=equal_nan)
+
+    actual, desired = np.asanyarray(actual), np.asanyarray(desired)
+    header = 'Not equal to tolerance rtol=%g, atol=%g' % (rtol, atol)
+    assert_array_compare(compare, actual, desired, err_msg=str(err_msg),
+                         verbose=verbose, header=header, equal_nan=equal_nan)
+
+
+def assert_array_almost_equal_nulp(x, y, nulp=1):
+    """
+    Compare two arrays relatively to their spacing.
+
+    This is a relatively robust method to compare two arrays whose amplitude
+    is variable.
+
+    Parameters
+    ----------
+    x, y : array_like
+        Input arrays.
+    nulp : int, optional
+        The maximum number of unit in the last place for tolerance (see Notes).
+        Default is 1.
+
+    Returns
+    -------
+    None
+
+    Raises
+    ------
+    AssertionError
+        If the spacing between `x` and `y` for one or more elements is larger
+        than `nulp`.
+
+    See Also
+    --------
+    assert_array_max_ulp : Check that all items of arrays differ in at most
+        N Units in the Last Place.
+    spacing : Return the distance between x and the nearest adjacent number.
+
+    Notes
+    -----
+    An assertion is raised if the following condition is not met::
+
+        abs(x - y) <= nulps * spacing(maximum(abs(x), abs(y)))
+
+    Examples
+    --------
+    >>> x = np.array([1., 1e-10, 1e-20])
+    >>> eps = np.finfo(x.dtype).eps
+    >>> np.testing.assert_array_almost_equal_nulp(x, x*eps/2 + x)
+
+    >>> np.testing.assert_array_almost_equal_nulp(x, x*eps + x)
+    Traceback (most recent call last):
+      ...
+    AssertionError: X and Y are not equal to 1 ULP (max is 2)
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import numpy as np
+    ax = np.abs(x)
+    ay = np.abs(y)
+    ref = nulp * np.spacing(np.where(ax > ay, ax, ay))
+    if not np.all(np.abs(x-y) <= ref):
+        if np.iscomplexobj(x) or np.iscomplexobj(y):
+            msg = "X and Y are not equal to %d ULP" % nulp
+        else:
+            max_nulp = np.max(nulp_diff(x, y))
+            msg = "X and Y are not equal to %d ULP (max is %g)" % (nulp, max_nulp)
+        raise AssertionError(msg)
+
+
+def assert_array_max_ulp(a, b, maxulp=1, dtype=None):
+    """
+    Check that all items of arrays differ in at most N Units in the Last Place.
+
+    Parameters
+    ----------
+    a, b : array_like
+        Input arrays to be compared.
+    maxulp : int, optional
+        The maximum number of units in the last place that elements of `a` and
+        `b` can differ. Default is 1.
+    dtype : dtype, optional
+        Data-type to convert `a` and `b` to if given. Default is None.
+
+    Returns
+    -------
+    ret : ndarray
+        Array containing number of representable floating point numbers between
+        items in `a` and `b`.
+
+    Raises
+    ------
+    AssertionError
+        If one or more elements differ by more than `maxulp`.
+
+    Notes
+    -----
+    For computing the ULP difference, this API does not differentiate between
+    various representations of NAN (ULP difference between 0x7fc00000 and 0xffc00000
+    is zero).
+
+    See Also
+    --------
+    assert_array_almost_equal_nulp : Compare two arrays relatively to their
+        spacing.
+
+    Examples
+    --------
+    >>> a = np.linspace(0., 1., 100)
+    >>> res = np.testing.assert_array_max_ulp(a, np.arcsin(np.sin(a)))
+
+    """
+    __tracebackhide__ = True  # Hide traceback for py.test
+    import numpy as np
+    ret = nulp_diff(a, b, dtype)
+    if not np.all(ret <= maxulp):
+        raise AssertionError("Arrays are not almost equal up to %g "
+                             "ULP (max difference is %g ULP)" %
+                             (maxulp, np.max(ret)))
+    return ret
+
+
+def nulp_diff(x, y, dtype=None):
+    """For each item in x and y, return the number of representable floating
+    points between them.
+
+    Parameters
+    ----------
+    x : array_like
+        first input array
+    y : array_like
+        second input array
+    dtype : dtype, optional
+        Data-type to convert `x` and `y` to if given. Default is None.
+
+    Returns
+    -------
+    nulp : array_like
+        number of representable floating point numbers between each item in x
+        and y.
+
+    Notes
+    -----
+    For computing the ULP difference, this API does not differentiate between
+    various representations of NAN (ULP difference between 0x7fc00000 and 0xffc00000
+    is zero).
+
+    Examples
+    --------
+    # By definition, epsilon is the smallest number such as 1 + eps != 1, so
+    # there should be exactly one ULP between 1 and 1 + eps
+    >>> nulp_diff(1, 1 + np.finfo(x.dtype).eps)
+    1.0
+    """
+    import numpy as np
+    if dtype:
+        x = np.array(x, dtype=dtype)
+        y = np.array(y, dtype=dtype)
+    else:
+        x = np.array(x)
+        y = np.array(y)
+
+    t = np.common_type(x, y)
+    if np.iscomplexobj(x) or np.iscomplexobj(y):
+        raise NotImplementedError("_nulp not implemented for complex array")
+
+    x = np.array([x], dtype=t)
+    y = np.array([y], dtype=t)
+
+    x[np.isnan(x)] = np.nan
+    y[np.isnan(y)] = np.nan
+
+    if not x.shape == y.shape:
+        raise ValueError("x and y do not have the same shape: %s - %s" %
+                         (x.shape, y.shape))
+
+    def _diff(rx, ry, vdt):
+        diff = np.array(rx-ry, dtype=vdt)
+        return np.abs(diff)
+
+    rx = integer_repr(x)
+    ry = integer_repr(y)
+    return _diff(rx, ry, t)
+
+
+def _integer_repr(x, vdt, comp):
+    # Reinterpret binary representation of the float as sign-magnitude:
+    # take into account two-complement representation
+    # See also
+    # https://randomascii.wordpress.com/2012/02/25/comparing-floating-point-numbers-2012-edition/
+    rx = x.view(vdt)
+    if not (rx.size == 1):
+        rx[rx < 0] = comp - rx[rx < 0]
+    else:
+        if rx < 0:
+            rx = comp - rx
+
+    return rx
+
+
+def integer_repr(x):
+    """Return the signed-magnitude interpretation of the binary representation of
+    x."""
+    import numpy as np
+    if x.dtype == np.float16:
+        return _integer_repr(x, np.int16, np.int16(-2**15))
+    elif x.dtype == np.float32:
+        return _integer_repr(x, np.int32, np.int32(-2**31))
+    elif x.dtype == np.float64:
+        return _integer_repr(x, np.int64, np.int64(-2**63))
+    else:
+        raise ValueError("Unsupported dtype %s" % x.dtype)
+
+
+@contextlib.contextmanager
+def _assert_warns_context(warning_class, name=None):
+    __tracebackhide__ = True  # Hide traceback for py.test
+    with suppress_warnings() as sup:
+        l = sup.record(warning_class)
+        yield
+        if not len(l) > 0:
+            name_str = " when calling %s" % name if name is not None else ""
+            raise AssertionError("No warning raised" + name_str)
+
+
+def assert_warns(warning_class, *args, **kwargs):
+    """
+    Fail unless the given callable throws the specified warning.
+
+    A warning of class warning_class should be thrown by the callable when
+    invoked with arguments args and keyword arguments kwargs.
+    If a different type of warning is thrown, it will not be caught.
+
+    If called with all arguments other than the warning class omitted, may be
+    used as a context manager:
+
+        with assert_warns(SomeWarning):
+            do_something()
+
+    The ability to be used as a context manager is new in NumPy v1.11.0.
+
+    .. versionadded:: 1.4.0
+
+    Parameters
+    ----------
+    warning_class : class
+        The class defining the warning that `func` is expected to throw.
+    func : callable
+        The callable to test.
+    \\*args : Arguments
+        Arguments passed to `func`.
+    \\*\\*kwargs : Kwargs
+        Keyword arguments passed to `func`.
+
+    Returns
+    -------
+    The value returned by `func`.
+
+    """
+    if not args:
+        return _assert_warns_context(warning_class)
+
+    func = args[0]
+    args = args[1:]
+    with _assert_warns_context(warning_class, name=func.__name__):
+        return func(*args, **kwargs)
+
+
+@contextlib.contextmanager
+def _assert_no_warnings_context(name=None):
+    __tracebackhide__ = True  # Hide traceback for py.test
+    with warnings.catch_warnings(record=True) as l:
+        warnings.simplefilter('always')
+        yield
+        if len(l) > 0:
+            name_str = " when calling %s" % name if name is not None else ""
+            raise AssertionError("Got warnings%s: %s" % (name_str, l))
+
+
+def assert_no_warnings(*args, **kwargs):
+    """
+    Fail if the given callable produces any warnings.
+
+    If called with all arguments omitted, may be used as a context manager:
+
+        with assert_no_warnings():
+            do_something()
+
+    The ability to be used as a context manager is new in NumPy v1.11.0.
+
+    .. versionadded:: 1.7.0
+
+    Parameters
+    ----------
+    func : callable
+        The callable to test.
+    \\*args : Arguments
+        Arguments passed to `func`.
+    \\*\\*kwargs : Kwargs
+        Keyword arguments passed to `func`.
+
+    Returns
+    -------
+    The value returned by `func`.
+
+    """
+    if not args:
+        return _assert_no_warnings_context()
+
+    func = args[0]
+    args = args[1:]
+    with _assert_no_warnings_context(name=func.__name__):
+        return func(*args, **kwargs)
+
+
+def _gen_alignment_data(dtype=float32, type='binary', max_size=24):
+    """
+    generator producing data with different alignment and offsets
+    to test simd vectorization
+
+    Parameters
+    ----------
+    dtype : dtype
+        data type to produce
+    type : string
+        'unary': create data for unary operations, creates one input
+                 and output array
+        'binary': create data for unary operations, creates two input
+                 and output array
+    max_size : integer
+        maximum size of data to produce
+
+    Returns
+    -------
+    if type is 'unary' yields one output, one input array and a message
+    containing information on the data
+    if type is 'binary' yields one output array, two input array and a message
+    containing information on the data
+
+    """
+    ufmt = 'unary offset=(%d, %d), size=%d, dtype=%r, %s'
+    bfmt = 'binary offset=(%d, %d, %d), size=%d, dtype=%r, %s'
+    for o in range(3):
+        for s in range(o + 2, max(o + 3, max_size)):
+            if type == 'unary':
+                inp = lambda: arange(s, dtype=dtype)[o:]
+                out = empty((s,), dtype=dtype)[o:]
+                yield out, inp(), ufmt % (o, o, s, dtype, 'out of place')
+                d = inp()
+                yield d, d, ufmt % (o, o, s, dtype, 'in place')
+                yield out[1:], inp()[:-1], ufmt % \
+                    (o + 1, o, s - 1, dtype, 'out of place')
+                yield out[:-1], inp()[1:], ufmt % \
+                    (o, o + 1, s - 1, dtype, 'out of place')
+                yield inp()[:-1], inp()[1:], ufmt % \
+                    (o, o + 1, s - 1, dtype, 'aliased')
+                yield inp()[1:], inp()[:-1], ufmt % \
+                    (o + 1, o, s - 1, dtype, 'aliased')
+            if type == 'binary':
+                inp1 = lambda: arange(s, dtype=dtype)[o:]
+                inp2 = lambda: arange(s, dtype=dtype)[o:]
+                out = empty((s,), dtype=dtype)[o:]
+                yield out, inp1(), inp2(),  bfmt % \
+                    (o, o, o, s, dtype, 'out of place')
+                d = inp1()
+                yield d, d, inp2(), bfmt % \
+                    (o, o, o, s, dtype, 'in place1')
+                d = inp2()
+                yield d, inp1(), d, bfmt % \
+                    (o, o, o, s, dtype, 'in place2')
+                yield out[1:], inp1()[:-1], inp2()[:-1], bfmt % \
+                    (o + 1, o, o, s - 1, dtype, 'out of place')
+                yield out[:-1], inp1()[1:], inp2()[:-1], bfmt % \
+                    (o, o + 1, o, s - 1, dtype, 'out of place')
+                yield out[:-1], inp1()[:-1], inp2()[1:], bfmt % \
+                    (o, o, o + 1, s - 1, dtype, 'out of place')
+                yield inp1()[1:], inp1()[:-1], inp2()[:-1], bfmt % \
+                    (o + 1, o, o, s - 1, dtype, 'aliased')
+                yield inp1()[:-1], inp1()[1:], inp2()[:-1], bfmt % \
+                    (o, o + 1, o, s - 1, dtype, 'aliased')
+                yield inp1()[:-1], inp1()[:-1], inp2()[1:], bfmt % \
+                    (o, o, o + 1, s - 1, dtype, 'aliased')
+
+
+class IgnoreException(Exception):
+    "Ignoring this exception due to disabled feature"
+    pass
+
+
+@contextlib.contextmanager
+def tempdir(*args, **kwargs):
+    """Context manager to provide a temporary test folder.
+
+    All arguments are passed as this to the underlying tempfile.mkdtemp
+    function.
+
+    """
+    tmpdir = mkdtemp(*args, **kwargs)
+    try:
+        yield tmpdir
+    finally:
+        shutil.rmtree(tmpdir)
+
+
+@contextlib.contextmanager
+def temppath(*args, **kwargs):
+    """Context manager for temporary files.
+
+    Context manager that returns the path to a closed temporary file. Its
+    parameters are the same as for tempfile.mkstemp and are passed directly
+    to that function. The underlying file is removed when the context is
+    exited, so it should be closed at that time.
+
+    Windows does not allow a temporary file to be opened if it is already
+    open, so the underlying file must be closed after opening before it
+    can be opened again.
+
+    """
+    fd, path = mkstemp(*args, **kwargs)
+    os.close(fd)
+    try:
+        yield path
+    finally:
+        os.remove(path)
+
+
+class clear_and_catch_warnings(warnings.catch_warnings):
+    """ Context manager that resets warning registry for catching warnings
+
+    Warnings can be slippery, because, whenever a warning is triggered, Python
+    adds a ``__warningregistry__`` member to the *calling* module.  This makes
+    it impossible to retrigger the warning in this module, whatever you put in
+    the warnings filters.  This context manager accepts a sequence of `modules`
+    as a keyword argument to its constructor and:
+
+    * stores and removes any ``__warningregistry__`` entries in given `modules`
+      on entry;
+    * resets ``__warningregistry__`` to its previous state on exit.
+
+    This makes it possible to trigger any warning afresh inside the context
+    manager without disturbing the state of warnings outside.
+
+    For compatibility with Python 3.0, please consider all arguments to be
+    keyword-only.
+
+    Parameters
+    ----------
+    record : bool, optional
+        Specifies whether warnings should be captured by a custom
+        implementation of ``warnings.showwarning()`` and be appended to a list
+        returned by the context manager. Otherwise None is returned by the
+        context manager. The objects appended to the list are arguments whose
+        attributes mirror the arguments to ``showwarning()``.
+    modules : sequence, optional
+        Sequence of modules for which to reset warnings registry on entry and
+        restore on exit. To work correctly, all 'ignore' filters should
+        filter by one of these modules.
+
+    Examples
+    --------
+    >>> import warnings
+    >>> with np.testing.clear_and_catch_warnings(
+    ...         modules=[np.core.fromnumeric]):
+    ...     warnings.simplefilter('always')
+    ...     warnings.filterwarnings('ignore', module='np.core.fromnumeric')
+    ...     # do something that raises a warning but ignore those in
+    ...     # np.core.fromnumeric
+    """
+    class_modules = ()
+
+    def __init__(self, record=False, modules=()):
+        self.modules = set(modules).union(self.class_modules)
+        self._warnreg_copies = {}
+        super(clear_and_catch_warnings, self).__init__(record=record)
+
+    def __enter__(self):
+        for mod in self.modules:
+            if hasattr(mod, '__warningregistry__'):
+                mod_reg = mod.__warningregistry__
+                self._warnreg_copies[mod] = mod_reg.copy()
+                mod_reg.clear()
+        return super(clear_and_catch_warnings, self).__enter__()
+
+    def __exit__(self, *exc_info):
+        super(clear_and_catch_warnings, self).__exit__(*exc_info)
+        for mod in self.modules:
+            if hasattr(mod, '__warningregistry__'):
+                mod.__warningregistry__.clear()
+            if mod in self._warnreg_copies:
+                mod.__warningregistry__.update(self._warnreg_copies[mod])
+
+
+class suppress_warnings:
+    """
+    Context manager and decorator doing much the same as
+    ``warnings.catch_warnings``.
+
+    However, it also provides a filter mechanism to work around
+    https://bugs.python.org/issue4180.
+
+    This bug causes Python before 3.4 to not reliably show warnings again
+    after they have been ignored once (even within catch_warnings). It
+    means that no "ignore" filter can be used easily, since following
+    tests might need to see the warning. Additionally it allows easier
+    specificity for testing warnings and can be nested.
+
+    Parameters
+    ----------
+    forwarding_rule : str, optional
+        One of "always", "once", "module", or "location". Analogous to
+        the usual warnings module filter mode, it is useful to reduce
+        noise mostly on the outmost level. Unsuppressed and unrecorded
+        warnings will be forwarded based on this rule. Defaults to "always".
+        "location" is equivalent to the warnings "default", match by exact
+        location the warning warning originated from.
+
+    Notes
+    -----
+    Filters added inside the context manager will be discarded again
+    when leaving it. Upon entering all filters defined outside a
+    context will be applied automatically.
+
+    When a recording filter is added, matching warnings are stored in the
+    ``log`` attribute as well as in the list returned by ``record``.
+
+    If filters are added and the ``module`` keyword is given, the
+    warning registry of this module will additionally be cleared when
+    applying it, entering the context, or exiting it. This could cause
+    warnings to appear a second time after leaving the context if they
+    were configured to be printed once (default) and were already
+    printed before the context was entered.
+
+    Nesting this context manager will work as expected when the
+    forwarding rule is "always" (default). Unfiltered and unrecorded
+    warnings will be passed out and be matched by the outer level.
+    On the outmost level they will be printed (or caught by another
+    warnings context). The forwarding rule argument can modify this
+    behaviour.
+
+    Like ``catch_warnings`` this context manager is not threadsafe.
+
+    Examples
+    --------
+
+    With a context manager::
+
+        with np.testing.suppress_warnings() as sup:
+            sup.filter(DeprecationWarning, "Some text")
+            sup.filter(module=np.ma.core)
+            log = sup.record(FutureWarning, "Does this occur?")
+            command_giving_warnings()
+            # The FutureWarning was given once, the filtered warnings were
+            # ignored. All other warnings abide outside settings (may be
+            # printed/error)
+            assert_(len(log) == 1)
+            assert_(len(sup.log) == 1)  # also stored in log attribute
+
+    Or as a decorator::
+
+        sup = np.testing.suppress_warnings()
+        sup.filter(module=np.ma.core)  # module must match exactly
+        @sup
+        def some_function():
+            # do something which causes a warning in np.ma.core
+            pass
+    """
+    def __init__(self, forwarding_rule="always"):
+        self._entered = False
+
+        # Suppressions are either instance or defined inside one with block:
+        self._suppressions = []
+
+        if forwarding_rule not in {"always", "module", "once", "location"}:
+            raise ValueError("unsupported forwarding rule.")
+        self._forwarding_rule = forwarding_rule
+
+    def _clear_registries(self):
+        if hasattr(warnings, "_filters_mutated"):
+            # clearing the registry should not be necessary on new pythons,
+            # instead the filters should be mutated.
+            warnings._filters_mutated()
+            return
+        # Simply clear the registry, this should normally be harmless,
+        # note that on new pythons it would be invalidated anyway.
+        for module in self._tmp_modules:
+            if hasattr(module, "__warningregistry__"):
+                module.__warningregistry__.clear()
+
+    def _filter(self, category=Warning, message="", module=None, record=False):
+        if record:
+            record = []  # The log where to store warnings
+        else:
+            record = None
+        if self._entered:
+            if module is None:
+                warnings.filterwarnings(
+                    "always", category=category, message=message)
+            else:
+                module_regex = module.__name__.replace('.', r'\.') + '$'
+                warnings.filterwarnings(
+                    "always", category=category, message=message,
+                    module=module_regex)
+                self._tmp_modules.add(module)
+                self._clear_registries()
+
+            self._tmp_suppressions.append(
+                (category, message, re.compile(message, re.I), module, record))
+        else:
+            self._suppressions.append(
+                (category, message, re.compile(message, re.I), module, record))
+
+        return record
+
+    def filter(self, category=Warning, message="", module=None):
+        """
+        Add a new suppressing filter or apply it if the state is entered.
+
+        Parameters
+        ----------
+        category : class, optional
+            Warning class to filter
+        message : string, optional
+            Regular expression matching the warning message.
+        module : module, optional
+            Module to filter for. Note that the module (and its file)
+            must match exactly and cannot be a submodule. This may make
+            it unreliable for external modules.
+
+        Notes
+        -----
+        When added within a context, filters are only added inside
+        the context and will be forgotten when the context is exited.
+        """
+        self._filter(category=category, message=message, module=module,
+                     record=False)
+
+    def record(self, category=Warning, message="", module=None):
+        """
+        Append a new recording filter or apply it if the state is entered.
+
+        All warnings matching will be appended to the ``log`` attribute.
+
+        Parameters
+        ----------
+        category : class, optional
+            Warning class to filter
+        message : string, optional
+            Regular expression matching the warning message.
+        module : module, optional
+            Module to filter for. Note that the module (and its file)
+            must match exactly and cannot be a submodule. This may make
+            it unreliable for external modules.
+
+        Returns
+        -------
+        log : list
+            A list which will be filled with all matched warnings.
+
+        Notes
+        -----
+        When added within a context, filters are only added inside
+        the context and will be forgotten when the context is exited.
+        """
+        return self._filter(category=category, message=message, module=module,
+                            record=True)
+
+    def __enter__(self):
+        if self._entered:
+            raise RuntimeError("cannot enter suppress_warnings twice.")
+
+        self._orig_show = warnings.showwarning
+        self._filters = warnings.filters
+        warnings.filters = self._filters[:]
+
+        self._entered = True
+        self._tmp_suppressions = []
+        self._tmp_modules = set()
+        self._forwarded = set()
+
+        self.log = []  # reset global log (no need to keep same list)
+
+        for cat, mess, _, mod, log in self._suppressions:
+            if log is not None:
+                del log[:]  # clear the log
+            if mod is None:
+                warnings.filterwarnings(
+                    "always", category=cat, message=mess)
+            else:
+                module_regex = mod.__name__.replace('.', r'\.') + '$'
+                warnings.filterwarnings(
+                    "always", category=cat, message=mess,
+                    module=module_regex)
+                self._tmp_modules.add(mod)
+        warnings.showwarning = self._showwarning
+        self._clear_registries()
+
+        return self
+
+    def __exit__(self, *exc_info):
+        warnings.showwarning = self._orig_show
+        warnings.filters = self._filters
+        self._clear_registries()
+        self._entered = False
+        del self._orig_show
+        del self._filters
+
+    def _showwarning(self, message, category, filename, lineno,
+                     *args, use_warnmsg=None, **kwargs):
+        for cat, _, pattern, mod, rec in (
+                self._suppressions + self._tmp_suppressions)[::-1]:
+            if (issubclass(category, cat) and
+                    pattern.match(message.args[0]) is not None):
+                if mod is None:
+                    # Message and category match, either recorded or ignored
+                    if rec is not None:
+                        msg = WarningMessage(message, category, filename,
+                                             lineno, **kwargs)
+                        self.log.append(msg)
+                        rec.append(msg)
+                    return
+                # Use startswith, because warnings strips the c or o from
+                # .pyc/.pyo files.
+                elif mod.__file__.startswith(filename):
+                    # The message and module (filename) match
+                    if rec is not None:
+                        msg = WarningMessage(message, category, filename,
+                                             lineno, **kwargs)
+                        self.log.append(msg)
+                        rec.append(msg)
+                    return
+
+        # There is no filter in place, so pass to the outside handler
+        # unless we should only pass it once
+        if self._forwarding_rule == "always":
+            if use_warnmsg is None:
+                self._orig_show(message, category, filename, lineno,
+                                *args, **kwargs)
+            else:
+                self._orig_showmsg(use_warnmsg)
+            return
+
+        if self._forwarding_rule == "once":
+            signature = (message.args, category)
+        elif self._forwarding_rule == "module":
+            signature = (message.args, category, filename)
+        elif self._forwarding_rule == "location":
+            signature = (message.args, category, filename, lineno)
+
+        if signature in self._forwarded:
+            return
+        self._forwarded.add(signature)
+        if use_warnmsg is None:
+            self._orig_show(message, category, filename, lineno, *args,
+                            **kwargs)
+        else:
+            self._orig_showmsg(use_warnmsg)
+
+    def __call__(self, func):
+        """
+        Function decorator to apply certain suppressions to a whole
+        function.
+        """
+        @wraps(func)
+        def new_func(*args, **kwargs):
+            with self:
+                return func(*args, **kwargs)
+
+        return new_func
+
+
+@contextlib.contextmanager
+def _assert_no_gc_cycles_context(name=None):
+    __tracebackhide__ = True  # Hide traceback for py.test
+
+    # not meaningful to test if there is no refcounting
+    if not HAS_REFCOUNT:
+        yield
+        return
+
+    assert_(gc.isenabled())
+    gc.disable()
+    gc_debug = gc.get_debug()
+    try:
+        for i in range(100):
+            if gc.collect() == 0:
+                break
+        else:
+            raise RuntimeError(
+                "Unable to fully collect garbage - perhaps a __del__ method is "
+                "creating more reference cycles?")
+
+        gc.set_debug(gc.DEBUG_SAVEALL)
+        yield
+        # gc.collect returns the number of unreachable objects in cycles that
+        # were found -- we are checking that no cycles were created in the context
+        n_objects_in_cycles = gc.collect()
+        objects_in_cycles = gc.garbage[:]
+    finally:
+        del gc.garbage[:]
+        gc.set_debug(gc_debug)
+        gc.enable()
+
+    if n_objects_in_cycles:
+        name_str = " when calling %s" % name if name is not None else ""
+        raise AssertionError(
+            "Reference cycles were found{}: {} objects were collected, "
+            "of which {} are shown below:{}"
+            .format(
+                name_str,
+                n_objects_in_cycles,
+                len(objects_in_cycles),
+                ''.join(
+                    "\n  {} object with id={}:\n    {}".format(
+                        type(o).__name__,
+                        id(o),
+                        pprint.pformat(o).replace('\n', '\n    ')
+                    ) for o in objects_in_cycles
+                )
+            )
+        )
+
+
+def assert_no_gc_cycles(*args, **kwargs):
+    """
+    Fail if the given callable produces any reference cycles.
+
+    If called with all arguments omitted, may be used as a context manager:
+
+        with assert_no_gc_cycles():
+            do_something()
+
+    .. versionadded:: 1.15.0
+
+    Parameters
+    ----------
+    func : callable
+        The callable to test.
+    \\*args : Arguments
+        Arguments passed to `func`.
+    \\*\\*kwargs : Kwargs
+        Keyword arguments passed to `func`.
+
+    Returns
+    -------
+    Nothing. The result is deliberately discarded to ensure that all cycles
+    are found.
+
+    """
+    if not args:
+        return _assert_no_gc_cycles_context()
+
+    func = args[0]
+    args = args[1:]
+    with _assert_no_gc_cycles_context(name=func.__name__):
+        func(*args, **kwargs)
+
+def break_cycles():
+    """
+    Break reference cycles by calling gc.collect
+    Objects can call other objects' methods (for instance, another object's
+     __del__) inside their own __del__. On PyPy, the interpreter only runs
+    between calls to gc.collect, so multiple calls are needed to completely
+    release all cycles.
+    """
+
+    gc.collect()
+    if IS_PYPY:
+        # interpreter runs now, to call deleted objects' __del__ methods
+        gc.collect()
+        # one more, just to make sure
+        gc.collect()
+
+
+def requires_memory(free_bytes):
+    """Decorator to skip a test if not enough memory is available"""
+    import pytest
+
+    def decorator(func):
+        @wraps(func)
+        def wrapper(*a, **kw):
+            msg = check_free_memory(free_bytes)
+            if msg is not None:
+                pytest.skip(msg)
+
+            try:
+                return func(*a, **kw)
+            except MemoryError:
+                # Probably ran out of memory regardless: don't regard as failure
+                pytest.xfail("MemoryError raised")
+
+        return wrapper
+
+    return decorator
+
+
+def check_free_memory(free_bytes):
+    """
+    Check whether `free_bytes` amount of memory is currently free.
+    Returns: None if enough memory available, otherwise error message
+    """
+    env_var = 'NPY_AVAILABLE_MEM'
+    env_value = os.environ.get(env_var)
+    if env_value is not None:
+        try:
+            mem_free = _parse_size(env_value)
+        except ValueError as exc:
+            raise ValueError('Invalid environment variable {}: {!s}'.format(
+                env_var, exc))
+
+        msg = ('{0} GB memory required, but environment variable '
+               'NPY_AVAILABLE_MEM={1} set'.format(
+                   free_bytes/1e9, env_value))
+    else:
+        mem_free = _get_mem_available()
+
+        if mem_free is None:
+            msg = ("Could not determine available memory; set NPY_AVAILABLE_MEM "
+                   "environment variable (e.g. NPY_AVAILABLE_MEM=16GB) to run "
+                   "the test.")
+            mem_free = -1
+        else:
+            msg = '{0} GB memory required, but {1} GB available'.format(
+                free_bytes/1e9, mem_free/1e9)
+
+    return msg if mem_free < free_bytes else None
+
+
+def _parse_size(size_str):
+    """Convert memory size strings ('12 GB' etc.) to float"""
+    suffixes = {'': 1, 'b': 1,
+                'k': 1000, 'm': 1000**2, 'g': 1000**3, 't': 1000**4,
+                'kb': 1000, 'mb': 1000**2, 'gb': 1000**3, 'tb': 1000**4,
+                'kib': 1024, 'mib': 1024**2, 'gib': 1024**3, 'tib': 1024**4}
+
+    size_re = re.compile(r'^\s*(\d+|\d+\.\d+)\s*({0})\s*$'.format(
+        '|'.join(suffixes.keys())), re.I)
+
+    m = size_re.match(size_str.lower())
+    if not m or m.group(2) not in suffixes:
+        raise ValueError("value {!r} not a valid size".format(size_str))
+    return int(float(m.group(1)) * suffixes[m.group(2)])
+
+
+def _get_mem_available():
+    """Return available memory in bytes, or None if unknown."""
+    try:
+        import psutil
+        return psutil.virtual_memory().available
+    except (ImportError, AttributeError):
+        pass
+
+    if sys.platform.startswith('linux'):
+        info = {}
+        with open('/proc/meminfo', 'r') as f:
+            for line in f:
+                p = line.split()
+                info[p[0].strip(':').lower()] = int(p[1]) * 1024
+
+        if 'memavailable' in info:
+            # Linux >= 3.14
+            return info['memavailable']
+        else:
+            return info['memfree'] + info['cached']
+
+    return None
+
+
+def _no_tracing(func):
+    """
+    Decorator to temporarily turn off tracing for the duration of a test.
+    Needed in tests that check refcounting, otherwise the tracing itself
+    influences the refcounts
+    """
+    if not hasattr(sys, 'gettrace'):
+        return func
+    else:
+        @wraps(func)
+        def wrapper(*args, **kwargs):
+            original_trace = sys.gettrace()
+            try:
+                sys.settrace(None)
+                return func(*args, **kwargs)
+            finally:
+                sys.settrace(original_trace)
+        return wrapper
+
diff --git a/venv/Lib/site-packages/numpy/testing/print_coercion_tables.py b/venv/Lib/site-packages/numpy/testing/print_coercion_tables.py
new file mode 100644
index 000000000..8024df128
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/print_coercion_tables.py
@@ -0,0 +1,91 @@
+#!/usr/bin/env python3
+"""Prints type-coercion tables for the built-in NumPy types
+
+"""
+import numpy as np
+
+# Generic object that can be added, but doesn't do anything else
+class GenericObject:
+    def __init__(self, v):
+        self.v = v
+
+    def __add__(self, other):
+        return self
+
+    def __radd__(self, other):
+        return self
+
+    dtype = np.dtype('O')
+
+def print_cancast_table(ntypes):
+    print('X', end=' ')
+    for char in ntypes:
+        print(char, end=' ')
+    print()
+    for row in ntypes:
+        print(row, end=' ')
+        for col in ntypes:
+            print(int(np.can_cast(row, col)), end=' ')
+        print()
+
+def print_coercion_table(ntypes, inputfirstvalue, inputsecondvalue, firstarray, use_promote_types=False):
+    print('+', end=' ')
+    for char in ntypes:
+        print(char, end=' ')
+    print()
+    for row in ntypes:
+        if row == 'O':
+            rowtype = GenericObject
+        else:
+            rowtype = np.obj2sctype(row)
+
+        print(row, end=' ')
+        for col in ntypes:
+            if col == 'O':
+                coltype = GenericObject
+            else:
+                coltype = np.obj2sctype(col)
+            try:
+                if firstarray:
+                    rowvalue = np.array([rowtype(inputfirstvalue)], dtype=rowtype)
+                else:
+                    rowvalue = rowtype(inputfirstvalue)
+                colvalue = coltype(inputsecondvalue)
+                if use_promote_types:
+                    char = np.promote_types(rowvalue.dtype, colvalue.dtype).char
+                else:
+                    value = np.add(rowvalue, colvalue)
+                    if isinstance(value, np.ndarray):
+                        char = value.dtype.char
+                    else:
+                        char = np.dtype(type(value)).char
+            except ValueError:
+                char = '!'
+            except OverflowError:
+                char = '@'
+            except TypeError:
+                char = '#'
+            print(char, end=' ')
+        print()
+
+
+if __name__ == '__main__':
+    print("can cast")
+    print_cancast_table(np.typecodes['All'])
+    print()
+    print("In these tables, ValueError is '!', OverflowError is '@', TypeError is '#'")
+    print()
+    print("scalar + scalar")
+    print_coercion_table(np.typecodes['All'], 0, 0, False)
+    print()
+    print("scalar + neg scalar")
+    print_coercion_table(np.typecodes['All'], 0, -1, False)
+    print()
+    print("array + scalar")
+    print_coercion_table(np.typecodes['All'], 0, 0, True)
+    print()
+    print("array + neg scalar")
+    print_coercion_table(np.typecodes['All'], 0, -1, True)
+    print()
+    print("promote_types")
+    print_coercion_table(np.typecodes['All'], 0, 0, False, True)
diff --git a/venv/Lib/site-packages/numpy/testing/setup.py b/venv/Lib/site-packages/numpy/testing/setup.py
new file mode 100644
index 000000000..13191f13f
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/setup.py
@@ -0,0 +1,19 @@
+#!/usr/bin/env python3
+
+def configuration(parent_package='',top_path=None):
+    from numpy.distutils.misc_util import Configuration
+    config = Configuration('testing', parent_package, top_path)
+
+    config.add_subpackage('_private')
+    config.add_subpackage('tests')
+    return config
+
+if __name__ == '__main__':
+    from numpy.distutils.core import setup
+    setup(maintainer="NumPy Developers",
+          maintainer_email="numpy-dev@numpy.org",
+          description="NumPy test module",
+          url="https://www.numpy.org",
+          license="NumPy License (BSD Style)",
+          configuration=configuration,
+          )
diff --git a/venv/Lib/site-packages/numpy/testing/tests/__init__.py b/venv/Lib/site-packages/numpy/testing/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/testing/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..c0a248251
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_decorators.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_decorators.cpython-36.pyc
new file mode 100644
index 000000000..813194c14
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_decorators.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_doctesting.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_doctesting.cpython-36.pyc
new file mode 100644
index 000000000..2a53306eb
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_doctesting.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_utils.cpython-36.pyc b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_utils.cpython-36.pyc
new file mode 100644
index 000000000..46255ffc4
Binary files /dev/null and b/venv/Lib/site-packages/numpy/testing/tests/__pycache__/test_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/testing/tests/test_decorators.py b/venv/Lib/site-packages/numpy/testing/tests/test_decorators.py
new file mode 100644
index 000000000..b60d6dfbc
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/tests/test_decorators.py
@@ -0,0 +1,210 @@
+"""
+Test the decorators from ``testing.decorators``.
+
+"""
+import warnings
+import pytest
+
+from numpy.testing import (
+    assert_, assert_raises, dec, SkipTest, KnownFailureException,
+    )
+
+
+try:
+    with warnings.catch_warnings():
+        warnings.simplefilter("always")
+        import nose  # noqa: F401
+except ImportError:
+    HAVE_NOSE = False
+else:
+    HAVE_NOSE = True
+
+
+@pytest.mark.skipif(not HAVE_NOSE, reason="Needs nose")
+class TestNoseDecorators:
+    # These tests are run in a class for simplicity while still
+    # getting a report on each, skipped or success.
+
+    class DidntSkipException(Exception):
+        pass
+
+    def test_slow(self):
+        @dec.slow
+        def slow_func(x, y, z):
+            pass
+
+        assert_(slow_func.slow)
+
+    def test_setastest(self):
+        @dec.setastest()
+        def f_default(a):
+            pass
+
+        @dec.setastest(True)
+        def f_istest(a):
+            pass
+
+        @dec.setastest(False)
+        def f_isnottest(a):
+            pass
+
+        assert_(f_default.__test__)
+        assert_(f_istest.__test__)
+        assert_(not f_isnottest.__test__)
+
+    def test_skip_functions_hardcoded(self):
+        @dec.skipif(True)
+        def f1(x):
+            raise self.DidntSkipException
+
+        try:
+            f1('a')
+        except self.DidntSkipException:
+            raise Exception('Failed to skip')
+        except SkipTest().__class__:
+            pass
+
+        @dec.skipif(False)
+        def f2(x):
+            raise self.DidntSkipException
+
+        try:
+            f2('a')
+        except self.DidntSkipException:
+            pass
+        except SkipTest().__class__:
+            raise Exception('Skipped when not expected to')
+
+    def test_skip_functions_callable(self):
+        def skip_tester():
+            return skip_flag == 'skip me!'
+
+        @dec.skipif(skip_tester)
+        def f1(x):
+            raise self.DidntSkipException
+
+        try:
+            skip_flag = 'skip me!'
+            f1('a')
+        except self.DidntSkipException:
+            raise Exception('Failed to skip')
+        except SkipTest().__class__:
+            pass
+
+        @dec.skipif(skip_tester)
+        def f2(x):
+            raise self.DidntSkipException
+
+        try:
+            skip_flag = 'five is right out!'
+            f2('a')
+        except self.DidntSkipException:
+            pass
+        except SkipTest().__class__:
+            raise Exception('Skipped when not expected to')
+
+    def test_skip_generators_hardcoded(self):
+        @dec.knownfailureif(True, "This test is known to fail")
+        def g1(x):
+            yield from range(x)
+
+        try:
+            for j in g1(10):
+                pass
+        except KnownFailureException().__class__:
+            pass
+        else:
+            raise Exception('Failed to mark as known failure')
+
+        @dec.knownfailureif(False, "This test is NOT known to fail")
+        def g2(x):
+            yield from range(x)
+            raise self.DidntSkipException('FAIL')
+
+        try:
+            for j in g2(10):
+                pass
+        except KnownFailureException().__class__:
+            raise Exception('Marked incorrectly as known failure')
+        except self.DidntSkipException:
+            pass
+
+    def test_skip_generators_callable(self):
+        def skip_tester():
+            return skip_flag == 'skip me!'
+
+        @dec.knownfailureif(skip_tester, "This test is known to fail")
+        def g1(x):
+            yield from range(x)
+
+        try:
+            skip_flag = 'skip me!'
+            for j in g1(10):
+                pass
+        except KnownFailureException().__class__:
+            pass
+        else:
+            raise Exception('Failed to mark as known failure')
+
+        @dec.knownfailureif(skip_tester, "This test is NOT known to fail")
+        def g2(x):
+            yield from range(x)
+            raise self.DidntSkipException('FAIL')
+
+        try:
+            skip_flag = 'do not skip'
+            for j in g2(10):
+                pass
+        except KnownFailureException().__class__:
+            raise Exception('Marked incorrectly as known failure')
+        except self.DidntSkipException:
+            pass
+
+    def test_deprecated(self):
+        @dec.deprecated(True)
+        def non_deprecated_func():
+            pass
+
+        @dec.deprecated()
+        def deprecated_func():
+            import warnings
+            warnings.warn("TEST: deprecated func", DeprecationWarning)
+
+        @dec.deprecated()
+        def deprecated_func2():
+            import warnings
+            warnings.warn("AHHHH")
+            raise ValueError
+
+        @dec.deprecated()
+        def deprecated_func3():
+            import warnings
+            warnings.warn("AHHHH")
+
+        # marked as deprecated, but does not raise DeprecationWarning
+        assert_raises(AssertionError, non_deprecated_func)
+        # should be silent
+        deprecated_func()
+        with warnings.catch_warnings(record=True):
+            warnings.simplefilter("always")  # do not propagate unrelated warnings
+            # fails if deprecated decorator just disables test. See #1453.
+            assert_raises(ValueError, deprecated_func2)
+            # warning is not a DeprecationWarning
+            assert_raises(AssertionError, deprecated_func3)
+
+    def test_parametrize(self):
+        # dec.parametrize assumes that it is being run by nose. Because
+        # we are running under pytest, we need to explicitly check the
+        # results.
+        @dec.parametrize('base, power, expected',
+                [(1, 1, 1),
+                 (2, 1, 2),
+                 (2, 2, 4)])
+        def check_parametrize(base, power, expected):
+            assert_(base**power == expected)
+
+        count = 0
+        for test in check_parametrize():
+            test[0](*test[1:])
+            count += 1
+        assert_(count == 3)
diff --git a/venv/Lib/site-packages/numpy/testing/tests/test_doctesting.py b/venv/Lib/site-packages/numpy/testing/tests/test_doctesting.py
new file mode 100644
index 000000000..92c2156d8
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/tests/test_doctesting.py
@@ -0,0 +1,57 @@
+""" Doctests for NumPy-specific nose/doctest modifications
+
+"""
+#FIXME: None of these tests is run, because 'check' is not a recognized
+# testing prefix.
+
+# try the #random directive on the output line
+def check_random_directive():
+    '''
+    >>> 2+2
+    <BadExample object at 0x084D05AC>  #random: may vary on your system
+    '''
+
+# check the implicit "import numpy as np"
+def check_implicit_np():
+    '''
+    >>> np.array([1,2,3])
+    array([1, 2, 3])
+    '''
+
+# there's some extraneous whitespace around the correct responses
+def check_whitespace_enabled():
+    '''
+    # whitespace after the 3
+    >>> 1+2
+    3
+
+    # whitespace before the 7
+    >>> 3+4
+     7
+    '''
+
+def check_empty_output():
+    """ Check that no output does not cause an error.
+
+    This is related to nose bug 445; the numpy plugin changed the
+    doctest-result-variable default and therefore hit this bug:
+    http://code.google.com/p/python-nose/issues/detail?id=445
+
+    >>> a = 10
+    """
+
+def check_skip():
+    """ Check skip directive
+
+    The test below should not run
+
+    >>> 1/0 #doctest: +SKIP
+    """
+
+
+if __name__ == '__main__':
+    # Run tests outside numpy test rig
+    import nose
+    from numpy.testing.noseclasses import NumpyDoctest
+    argv = ['', __file__, '--with-numpydoctest']
+    nose.core.TestProgram(argv=argv, addplugins=[NumpyDoctest()])
diff --git a/venv/Lib/site-packages/numpy/testing/tests/test_utils.py b/venv/Lib/site-packages/numpy/testing/tests/test_utils.py
new file mode 100644
index 000000000..6a6cc664a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/tests/test_utils.py
@@ -0,0 +1,1609 @@
+import warnings
+import sys
+import os
+import itertools
+import pytest
+import weakref
+
+import numpy as np
+from numpy.testing import (
+    assert_equal, assert_array_equal, assert_almost_equal,
+    assert_array_almost_equal, assert_array_less, build_err_msg, raises,
+    assert_raises, assert_warns, assert_no_warnings, assert_allclose,
+    assert_approx_equal, assert_array_almost_equal_nulp, assert_array_max_ulp,
+    clear_and_catch_warnings, suppress_warnings, assert_string_equal, assert_,
+    tempdir, temppath, assert_no_gc_cycles, HAS_REFCOUNT
+    )
+from numpy.core.overrides import ARRAY_FUNCTION_ENABLED
+
+
+class _GenericTest:
+
+    def _test_equal(self, a, b):
+        self._assert_func(a, b)
+
+    def _test_not_equal(self, a, b):
+        with assert_raises(AssertionError):
+            self._assert_func(a, b)
+
+    def test_array_rank1_eq(self):
+        """Test two equal array of rank 1 are found equal."""
+        a = np.array([1, 2])
+        b = np.array([1, 2])
+
+        self._test_equal(a, b)
+
+    def test_array_rank1_noteq(self):
+        """Test two different array of rank 1 are found not equal."""
+        a = np.array([1, 2])
+        b = np.array([2, 2])
+
+        self._test_not_equal(a, b)
+
+    def test_array_rank2_eq(self):
+        """Test two equal array of rank 2 are found equal."""
+        a = np.array([[1, 2], [3, 4]])
+        b = np.array([[1, 2], [3, 4]])
+
+        self._test_equal(a, b)
+
+    def test_array_diffshape(self):
+        """Test two arrays with different shapes are found not equal."""
+        a = np.array([1, 2])
+        b = np.array([[1, 2], [1, 2]])
+
+        self._test_not_equal(a, b)
+
+    def test_objarray(self):
+        """Test object arrays."""
+        a = np.array([1, 1], dtype=object)
+        self._test_equal(a, 1)
+
+    def test_array_likes(self):
+        self._test_equal([1, 2, 3], (1, 2, 3))
+
+
+class TestArrayEqual(_GenericTest):
+
+    def setup(self):
+        self._assert_func = assert_array_equal
+
+    def test_generic_rank1(self):
+        """Test rank 1 array for all dtypes."""
+        def foo(t):
+            a = np.empty(2, t)
+            a.fill(1)
+            b = a.copy()
+            c = a.copy()
+            c.fill(0)
+            self._test_equal(a, b)
+            self._test_not_equal(c, b)
+
+        # Test numeric types and object
+        for t in '?bhilqpBHILQPfdgFDG':
+            foo(t)
+
+        # Test strings
+        for t in ['S1', 'U1']:
+            foo(t)
+
+    def test_0_ndim_array(self):
+        x = np.array(473963742225900817127911193656584771)
+        y = np.array(18535119325151578301457182298393896)
+        assert_raises(AssertionError, self._assert_func, x, y)
+
+        y = x
+        self._assert_func(x, y)
+
+        x = np.array(43)
+        y = np.array(10)
+        assert_raises(AssertionError, self._assert_func, x, y)
+
+        y = x
+        self._assert_func(x, y)
+
+    def test_generic_rank3(self):
+        """Test rank 3 array for all dtypes."""
+        def foo(t):
+            a = np.empty((4, 2, 3), t)
+            a.fill(1)
+            b = a.copy()
+            c = a.copy()
+            c.fill(0)
+            self._test_equal(a, b)
+            self._test_not_equal(c, b)
+
+        # Test numeric types and object
+        for t in '?bhilqpBHILQPfdgFDG':
+            foo(t)
+
+        # Test strings
+        for t in ['S1', 'U1']:
+            foo(t)
+
+    def test_nan_array(self):
+        """Test arrays with nan values in them."""
+        a = np.array([1, 2, np.nan])
+        b = np.array([1, 2, np.nan])
+
+        self._test_equal(a, b)
+
+        c = np.array([1, 2, 3])
+        self._test_not_equal(c, b)
+
+    def test_string_arrays(self):
+        """Test two arrays with different shapes are found not equal."""
+        a = np.array(['floupi', 'floupa'])
+        b = np.array(['floupi', 'floupa'])
+
+        self._test_equal(a, b)
+
+        c = np.array(['floupipi', 'floupa'])
+
+        self._test_not_equal(c, b)
+
+    def test_recarrays(self):
+        """Test record arrays."""
+        a = np.empty(2, [('floupi', float), ('floupa', float)])
+        a['floupi'] = [1, 2]
+        a['floupa'] = [1, 2]
+        b = a.copy()
+
+        self._test_equal(a, b)
+
+        c = np.empty(2, [('floupipi', float), ('floupa', float)])
+        c['floupipi'] = a['floupi'].copy()
+        c['floupa'] = a['floupa'].copy()
+
+        with suppress_warnings() as sup:
+            l = sup.record(FutureWarning, message="elementwise == ")
+            self._test_not_equal(c, b)
+            assert_equal(len(l), 1)
+
+    def test_masked_nan_inf(self):
+        # Regression test for gh-11121
+        a = np.ma.MaskedArray([3., 4., 6.5], mask=[False, True, False])
+        b = np.array([3., np.nan, 6.5])
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+        a = np.ma.MaskedArray([3., 4., 6.5], mask=[True, False, False])
+        b = np.array([np.inf, 4., 6.5])
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+
+    def test_subclass_that_overrides_eq(self):
+        # While we cannot guarantee testing functions will always work for
+        # subclasses, the tests should ideally rely only on subclasses having
+        # comparison operators, not on them being able to store booleans
+        # (which, e.g., astropy Quantity cannot usefully do). See gh-8452.
+        class MyArray(np.ndarray):
+            def __eq__(self, other):
+                return bool(np.equal(self, other).all())
+
+            def __ne__(self, other):
+                return not self == other
+
+        a = np.array([1., 2.]).view(MyArray)
+        b = np.array([2., 3.]).view(MyArray)
+        assert_(type(a == a), bool)
+        assert_(a == a)
+        assert_(a != b)
+        self._test_equal(a, a)
+        self._test_not_equal(a, b)
+        self._test_not_equal(b, a)
+
+    @pytest.mark.skipif(
+        not ARRAY_FUNCTION_ENABLED, reason='requires __array_function__')
+    def test_subclass_that_does_not_implement_npall(self):
+        class MyArray(np.ndarray):
+            def __array_function__(self, *args, **kwargs):
+                return NotImplemented
+
+        a = np.array([1., 2.]).view(MyArray)
+        b = np.array([2., 3.]).view(MyArray)
+        with assert_raises(TypeError):
+            np.all(a)
+        self._test_equal(a, a)
+        self._test_not_equal(a, b)
+        self._test_not_equal(b, a)
+
+
+class TestBuildErrorMessage:
+
+    def test_build_err_msg_defaults(self):
+        x = np.array([1.00001, 2.00002, 3.00003])
+        y = np.array([1.00002, 2.00003, 3.00004])
+        err_msg = 'There is a mismatch'
+
+        a = build_err_msg([x, y], err_msg)
+        b = ('\nItems are not equal: There is a mismatch\n ACTUAL: array(['
+             '1.00001, 2.00002, 3.00003])\n DESIRED: array([1.00002, '
+             '2.00003, 3.00004])')
+        assert_equal(a, b)
+
+    def test_build_err_msg_no_verbose(self):
+        x = np.array([1.00001, 2.00002, 3.00003])
+        y = np.array([1.00002, 2.00003, 3.00004])
+        err_msg = 'There is a mismatch'
+
+        a = build_err_msg([x, y], err_msg, verbose=False)
+        b = '\nItems are not equal: There is a mismatch'
+        assert_equal(a, b)
+
+    def test_build_err_msg_custom_names(self):
+        x = np.array([1.00001, 2.00002, 3.00003])
+        y = np.array([1.00002, 2.00003, 3.00004])
+        err_msg = 'There is a mismatch'
+
+        a = build_err_msg([x, y], err_msg, names=('FOO', 'BAR'))
+        b = ('\nItems are not equal: There is a mismatch\n FOO: array(['
+             '1.00001, 2.00002, 3.00003])\n BAR: array([1.00002, 2.00003, '
+             '3.00004])')
+        assert_equal(a, b)
+
+    def test_build_err_msg_custom_precision(self):
+        x = np.array([1.000000001, 2.00002, 3.00003])
+        y = np.array([1.000000002, 2.00003, 3.00004])
+        err_msg = 'There is a mismatch'
+
+        a = build_err_msg([x, y], err_msg, precision=10)
+        b = ('\nItems are not equal: There is a mismatch\n ACTUAL: array(['
+             '1.000000001, 2.00002    , 3.00003    ])\n DESIRED: array(['
+             '1.000000002, 2.00003    , 3.00004    ])')
+        assert_equal(a, b)
+
+
+class TestEqual(TestArrayEqual):
+
+    def setup(self):
+        self._assert_func = assert_equal
+
+    def test_nan_items(self):
+        self._assert_func(np.nan, np.nan)
+        self._assert_func([np.nan], [np.nan])
+        self._test_not_equal(np.nan, [np.nan])
+        self._test_not_equal(np.nan, 1)
+
+    def test_inf_items(self):
+        self._assert_func(np.inf, np.inf)
+        self._assert_func([np.inf], [np.inf])
+        self._test_not_equal(np.inf, [np.inf])
+
+    def test_datetime(self):
+        self._test_equal(
+            np.datetime64("2017-01-01", "s"),
+            np.datetime64("2017-01-01", "s")
+        )
+        self._test_equal(
+            np.datetime64("2017-01-01", "s"),
+            np.datetime64("2017-01-01", "m")
+        )
+
+        # gh-10081
+        self._test_not_equal(
+            np.datetime64("2017-01-01", "s"),
+            np.datetime64("2017-01-02", "s")
+        )
+        self._test_not_equal(
+            np.datetime64("2017-01-01", "s"),
+            np.datetime64("2017-01-02", "m")
+        )
+
+    def test_nat_items(self):
+        # not a datetime
+        nadt_no_unit = np.datetime64("NaT")
+        nadt_s = np.datetime64("NaT", "s")
+        nadt_d = np.datetime64("NaT", "ns")
+        # not a timedelta
+        natd_no_unit = np.timedelta64("NaT")
+        natd_s = np.timedelta64("NaT", "s")
+        natd_d = np.timedelta64("NaT", "ns")
+
+        dts = [nadt_no_unit, nadt_s, nadt_d]
+        tds = [natd_no_unit, natd_s, natd_d]
+        for a, b in itertools.product(dts, dts):
+            self._assert_func(a, b)
+            self._assert_func([a], [b])
+            self._test_not_equal([a], b)
+
+        for a, b in itertools.product(tds, tds):
+            self._assert_func(a, b)
+            self._assert_func([a], [b])
+            self._test_not_equal([a], b)
+
+        for a, b in itertools.product(tds, dts):
+            self._test_not_equal(a, b)
+            self._test_not_equal(a, [b])
+            self._test_not_equal([a], [b])
+            self._test_not_equal([a], np.datetime64("2017-01-01", "s"))
+            self._test_not_equal([b], np.datetime64("2017-01-01", "s"))
+            self._test_not_equal([a], np.timedelta64(123, "s"))
+            self._test_not_equal([b], np.timedelta64(123, "s"))
+
+    def test_non_numeric(self):
+        self._assert_func('ab', 'ab')
+        self._test_not_equal('ab', 'abb')
+
+    def test_complex_item(self):
+        self._assert_func(complex(1, 2), complex(1, 2))
+        self._assert_func(complex(1, np.nan), complex(1, np.nan))
+        self._test_not_equal(complex(1, np.nan), complex(1, 2))
+        self._test_not_equal(complex(np.nan, 1), complex(1, np.nan))
+        self._test_not_equal(complex(np.nan, np.inf), complex(np.nan, 2))
+
+    def test_negative_zero(self):
+        self._test_not_equal(np.PZERO, np.NZERO)
+
+    def test_complex(self):
+        x = np.array([complex(1, 2), complex(1, np.nan)])
+        y = np.array([complex(1, 2), complex(1, 2)])
+        self._assert_func(x, x)
+        self._test_not_equal(x, y)
+
+    def test_object(self):
+        #gh-12942
+        import datetime
+        a = np.array([datetime.datetime(2000, 1, 1),
+                      datetime.datetime(2000, 1, 2)])
+        self._test_not_equal(a, a[::-1])
+
+
+class TestArrayAlmostEqual(_GenericTest):
+
+    def setup(self):
+        self._assert_func = assert_array_almost_equal
+
+    def test_closeness(self):
+        # Note that in the course of time we ended up with
+        #     `abs(x - y) < 1.5 * 10**(-decimal)`
+        # instead of the previously documented
+        #     `abs(x - y) < 0.5 * 10**(-decimal)`
+        # so this check serves to preserve the wrongness.
+
+        # test scalars
+        self._assert_func(1.499999, 0.0, decimal=0)
+        assert_raises(AssertionError,
+                          lambda: self._assert_func(1.5, 0.0, decimal=0))
+
+        # test arrays
+        self._assert_func([1.499999], [0.0], decimal=0)
+        assert_raises(AssertionError,
+                          lambda: self._assert_func([1.5], [0.0], decimal=0))
+
+    def test_simple(self):
+        x = np.array([1234.2222])
+        y = np.array([1234.2223])
+
+        self._assert_func(x, y, decimal=3)
+        self._assert_func(x, y, decimal=4)
+        assert_raises(AssertionError,
+                lambda: self._assert_func(x, y, decimal=5))
+
+    def test_nan(self):
+        anan = np.array([np.nan])
+        aone = np.array([1])
+        ainf = np.array([np.inf])
+        self._assert_func(anan, anan)
+        assert_raises(AssertionError,
+                lambda: self._assert_func(anan, aone))
+        assert_raises(AssertionError,
+                lambda: self._assert_func(anan, ainf))
+        assert_raises(AssertionError,
+                lambda: self._assert_func(ainf, anan))
+
+    def test_inf(self):
+        a = np.array([[1., 2.], [3., 4.]])
+        b = a.copy()
+        a[0, 0] = np.inf
+        assert_raises(AssertionError,
+                lambda: self._assert_func(a, b))
+        b[0, 0] = -np.inf
+        assert_raises(AssertionError,
+                lambda: self._assert_func(a, b))
+
+    def test_subclass(self):
+        a = np.array([[1., 2.], [3., 4.]])
+        b = np.ma.masked_array([[1., 2.], [0., 4.]],
+                               [[False, False], [True, False]])
+        self._assert_func(a, b)
+        self._assert_func(b, a)
+        self._assert_func(b, b)
+
+        # Test fully masked as well (see gh-11123).
+        a = np.ma.MaskedArray(3.5, mask=True)
+        b = np.array([3., 4., 6.5])
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+        a = np.ma.masked
+        b = np.array([3., 4., 6.5])
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+        a = np.ma.MaskedArray([3., 4., 6.5], mask=[True, True, True])
+        b = np.array([1., 2., 3.])
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+        a = np.ma.MaskedArray([3., 4., 6.5], mask=[True, True, True])
+        b = np.array(1.)
+        self._test_equal(a, b)
+        self._test_equal(b, a)
+
+    def test_subclass_that_cannot_be_bool(self):
+        # While we cannot guarantee testing functions will always work for
+        # subclasses, the tests should ideally rely only on subclasses having
+        # comparison operators, not on them being able to store booleans
+        # (which, e.g., astropy Quantity cannot usefully do). See gh-8452.
+        class MyArray(np.ndarray):
+            def __eq__(self, other):
+                return super(MyArray, self).__eq__(other).view(np.ndarray)
+
+            def __lt__(self, other):
+                return super(MyArray, self).__lt__(other).view(np.ndarray)
+
+            def all(self, *args, **kwargs):
+                raise NotImplementedError
+
+        a = np.array([1., 2.]).view(MyArray)
+        self._assert_func(a, a)
+
+
+class TestAlmostEqual(_GenericTest):
+
+    def setup(self):
+        self._assert_func = assert_almost_equal
+
+    def test_closeness(self):
+        # Note that in the course of time we ended up with
+        #     `abs(x - y) < 1.5 * 10**(-decimal)`
+        # instead of the previously documented
+        #     `abs(x - y) < 0.5 * 10**(-decimal)`
+        # so this check serves to preserve the wrongness.
+
+        # test scalars
+        self._assert_func(1.499999, 0.0, decimal=0)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(1.5, 0.0, decimal=0))
+
+        # test arrays
+        self._assert_func([1.499999], [0.0], decimal=0)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func([1.5], [0.0], decimal=0))
+
+    def test_nan_item(self):
+        self._assert_func(np.nan, np.nan)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(np.nan, 1))
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(np.nan, np.inf))
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(np.inf, np.nan))
+
+    def test_inf_item(self):
+        self._assert_func(np.inf, np.inf)
+        self._assert_func(-np.inf, -np.inf)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(np.inf, 1))
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(-np.inf, np.inf))
+
+    def test_simple_item(self):
+        self._test_not_equal(1, 2)
+
+    def test_complex_item(self):
+        self._assert_func(complex(1, 2), complex(1, 2))
+        self._assert_func(complex(1, np.nan), complex(1, np.nan))
+        self._assert_func(complex(np.inf, np.nan), complex(np.inf, np.nan))
+        self._test_not_equal(complex(1, np.nan), complex(1, 2))
+        self._test_not_equal(complex(np.nan, 1), complex(1, np.nan))
+        self._test_not_equal(complex(np.nan, np.inf), complex(np.nan, 2))
+
+    def test_complex(self):
+        x = np.array([complex(1, 2), complex(1, np.nan)])
+        z = np.array([complex(1, 2), complex(np.nan, 1)])
+        y = np.array([complex(1, 2), complex(1, 2)])
+        self._assert_func(x, x)
+        self._test_not_equal(x, y)
+        self._test_not_equal(x, z)
+
+    def test_error_message(self):
+        """Check the message is formatted correctly for the decimal value.
+           Also check the message when input includes inf or nan (gh12200)"""
+        x = np.array([1.00000000001, 2.00000000002, 3.00003])
+        y = np.array([1.00000000002, 2.00000000003, 3.00004])
+
+        # Test with a different amount of decimal digits
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y, decimal=12)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 3 / 3 (100%)')
+        assert_equal(msgs[4], 'Max absolute difference: 1.e-05')
+        assert_equal(msgs[5], 'Max relative difference: 3.33328889e-06')
+        assert_equal(
+            msgs[6],
+            ' x: array([1.00000000001, 2.00000000002, 3.00003      ])')
+        assert_equal(
+            msgs[7],
+            ' y: array([1.00000000002, 2.00000000003, 3.00004      ])')
+
+        # With the default value of decimal digits, only the 3rd element
+        # differs. Note that we only check for the formatting of the arrays
+        # themselves.
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 1 / 3 (33.3%)')
+        assert_equal(msgs[4], 'Max absolute difference: 1.e-05')
+        assert_equal(msgs[5], 'Max relative difference: 3.33328889e-06')
+        assert_equal(msgs[6], ' x: array([1.     , 2.     , 3.00003])')
+        assert_equal(msgs[7], ' y: array([1.     , 2.     , 3.00004])')
+
+        # Check the error message when input includes inf
+        x = np.array([np.inf, 0])
+        y = np.array([np.inf, 1])
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 1 / 2 (50%)')
+        assert_equal(msgs[4], 'Max absolute difference: 1.')
+        assert_equal(msgs[5], 'Max relative difference: 1.')
+        assert_equal(msgs[6], ' x: array([inf,  0.])')
+        assert_equal(msgs[7], ' y: array([inf,  1.])')
+
+        # Check the error message when dividing by zero
+        x = np.array([1, 2])
+        y = np.array([0, 0])
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 2 / 2 (100%)')
+        assert_equal(msgs[4], 'Max absolute difference: 2')
+        assert_equal(msgs[5], 'Max relative difference: inf')
+
+    def test_error_message_2(self):
+        """Check the message is formatted correctly when either x or y is a scalar."""
+        x = 2
+        y = np.ones(20)
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 20 / 20 (100%)')
+        assert_equal(msgs[4], 'Max absolute difference: 1.')
+        assert_equal(msgs[5], 'Max relative difference: 1.')
+
+        y = 2
+        x = np.ones(20)
+        with pytest.raises(AssertionError) as exc_info:
+            self._assert_func(x, y)
+        msgs = str(exc_info.value).split('\n')
+        assert_equal(msgs[3], 'Mismatched elements: 20 / 20 (100%)')
+        assert_equal(msgs[4], 'Max absolute difference: 1.')
+        assert_equal(msgs[5], 'Max relative difference: 0.5')
+
+    def test_subclass_that_cannot_be_bool(self):
+        # While we cannot guarantee testing functions will always work for
+        # subclasses, the tests should ideally rely only on subclasses having
+        # comparison operators, not on them being able to store booleans
+        # (which, e.g., astropy Quantity cannot usefully do). See gh-8452.
+        class MyArray(np.ndarray):
+            def __eq__(self, other):
+                return super(MyArray, self).__eq__(other).view(np.ndarray)
+
+            def __lt__(self, other):
+                return super(MyArray, self).__lt__(other).view(np.ndarray)
+
+            def all(self, *args, **kwargs):
+                raise NotImplementedError
+
+        a = np.array([1., 2.]).view(MyArray)
+        self._assert_func(a, a)
+
+
+class TestApproxEqual:
+
+    def setup(self):
+        self._assert_func = assert_approx_equal
+
+    def test_simple_0d_arrays(self):
+        x = np.array(1234.22)
+        y = np.array(1234.23)
+
+        self._assert_func(x, y, significant=5)
+        self._assert_func(x, y, significant=6)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(x, y, significant=7))
+
+    def test_simple_items(self):
+        x = 1234.22
+        y = 1234.23
+
+        self._assert_func(x, y, significant=4)
+        self._assert_func(x, y, significant=5)
+        self._assert_func(x, y, significant=6)
+        assert_raises(AssertionError,
+                      lambda: self._assert_func(x, y, significant=7))
+
+    def test_nan_array(self):
+        anan = np.array(np.nan)
+        aone = np.array(1)
+        ainf = np.array(np.inf)
+        self._assert_func(anan, anan)
+        assert_raises(AssertionError, lambda: self._assert_func(anan, aone))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, anan))
+
+    def test_nan_items(self):
+        anan = np.array(np.nan)
+        aone = np.array(1)
+        ainf = np.array(np.inf)
+        self._assert_func(anan, anan)
+        assert_raises(AssertionError, lambda: self._assert_func(anan, aone))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, anan))
+
+
+class TestArrayAssertLess:
+
+    def setup(self):
+        self._assert_func = assert_array_less
+
+    def test_simple_arrays(self):
+        x = np.array([1.1, 2.2])
+        y = np.array([1.2, 2.3])
+
+        self._assert_func(x, y)
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+        y = np.array([1.0, 2.3])
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, y))
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+    def test_rank2(self):
+        x = np.array([[1.1, 2.2], [3.3, 4.4]])
+        y = np.array([[1.2, 2.3], [3.4, 4.5]])
+
+        self._assert_func(x, y)
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+        y = np.array([[1.0, 2.3], [3.4, 4.5]])
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, y))
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+    def test_rank3(self):
+        x = np.ones(shape=(2, 2, 2))
+        y = np.ones(shape=(2, 2, 2))+1
+
+        self._assert_func(x, y)
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+        y[0, 0, 0] = 0
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, y))
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+    def test_simple_items(self):
+        x = 1.1
+        y = 2.2
+
+        self._assert_func(x, y)
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+        y = np.array([2.2, 3.3])
+
+        self._assert_func(x, y)
+        assert_raises(AssertionError, lambda: self._assert_func(y, x))
+
+        y = np.array([1.0, 3.3])
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, y))
+
+    def test_nan_noncompare(self):
+        anan = np.array(np.nan)
+        aone = np.array(1)
+        ainf = np.array(np.inf)
+        self._assert_func(anan, anan)
+        assert_raises(AssertionError, lambda: self._assert_func(aone, anan))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, aone))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, anan))
+
+    def test_nan_noncompare_array(self):
+        x = np.array([1.1, 2.2, 3.3])
+        anan = np.array(np.nan)
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, anan))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, x))
+
+        x = np.array([1.1, 2.2, np.nan])
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, anan))
+        assert_raises(AssertionError, lambda: self._assert_func(anan, x))
+
+        y = np.array([1.0, 2.0, np.nan])
+
+        self._assert_func(y, x)
+        assert_raises(AssertionError, lambda: self._assert_func(x, y))
+
+    def test_inf_compare(self):
+        aone = np.array(1)
+        ainf = np.array(np.inf)
+
+        self._assert_func(aone, ainf)
+        self._assert_func(-ainf, aone)
+        self._assert_func(-ainf, ainf)
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, aone))
+        assert_raises(AssertionError, lambda: self._assert_func(aone, -ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, -ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(-ainf, -ainf))
+
+    def test_inf_compare_array(self):
+        x = np.array([1.1, 2.2, np.inf])
+        ainf = np.array(np.inf)
+
+        assert_raises(AssertionError, lambda: self._assert_func(x, ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(ainf, x))
+        assert_raises(AssertionError, lambda: self._assert_func(x, -ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(-x, -ainf))
+        assert_raises(AssertionError, lambda: self._assert_func(-ainf, -x))
+        self._assert_func(-ainf, x)
+
+
+@pytest.mark.skip(reason="The raises decorator depends on Nose")
+class TestRaises:
+
+    def setup(self):
+        class MyException(Exception):
+            pass
+
+        self.e = MyException
+
+    def raises_exception(self, e):
+        raise e
+
+    def does_not_raise_exception(self):
+        pass
+
+    def test_correct_catch(self):
+        raises(self.e)(self.raises_exception)(self.e)  # raises?
+
+    def test_wrong_exception(self):
+        try:
+            raises(self.e)(self.raises_exception)(RuntimeError)  # raises?
+        except RuntimeError:
+            return
+        else:
+            raise AssertionError("should have caught RuntimeError")
+
+    def test_catch_no_raise(self):
+        try:
+            raises(self.e)(self.does_not_raise_exception)()  # raises?
+        except AssertionError:
+            return
+        else:
+            raise AssertionError("should have raised an AssertionError")
+
+
+class TestWarns:
+
+    def test_warn(self):
+        def f():
+            warnings.warn("yo")
+            return 3
+
+        before_filters = sys.modules['warnings'].filters[:]
+        assert_equal(assert_warns(UserWarning, f), 3)
+        after_filters = sys.modules['warnings'].filters
+
+        assert_raises(AssertionError, assert_no_warnings, f)
+        assert_equal(assert_no_warnings(lambda x: x, 1), 1)
+
+        # Check that the warnings state is unchanged
+        assert_equal(before_filters, after_filters,
+                     "assert_warns does not preserver warnings state")
+
+    def test_context_manager(self):
+
+        before_filters = sys.modules['warnings'].filters[:]
+        with assert_warns(UserWarning):
+            warnings.warn("yo")
+        after_filters = sys.modules['warnings'].filters
+
+        def no_warnings():
+            with assert_no_warnings():
+                warnings.warn("yo")
+
+        assert_raises(AssertionError, no_warnings)
+        assert_equal(before_filters, after_filters,
+                     "assert_warns does not preserver warnings state")
+
+    def test_warn_wrong_warning(self):
+        def f():
+            warnings.warn("yo", DeprecationWarning)
+
+        failed = False
+        with warnings.catch_warnings():
+            warnings.simplefilter("error", DeprecationWarning)
+            try:
+                # Should raise a DeprecationWarning
+                assert_warns(UserWarning, f)
+                failed = True
+            except DeprecationWarning:
+                pass
+
+        if failed:
+            raise AssertionError("wrong warning caught by assert_warn")
+
+
+class TestAssertAllclose:
+
+    def test_simple(self):
+        x = 1e-3
+        y = 1e-9
+
+        assert_allclose(x, y, atol=1)
+        assert_raises(AssertionError, assert_allclose, x, y)
+
+        a = np.array([x, y, x, y])
+        b = np.array([x, y, x, x])
+
+        assert_allclose(a, b, atol=1)
+        assert_raises(AssertionError, assert_allclose, a, b)
+
+        b[-1] = y * (1 + 1e-8)
+        assert_allclose(a, b)
+        assert_raises(AssertionError, assert_allclose, a, b, rtol=1e-9)
+
+        assert_allclose(6, 10, rtol=0.5)
+        assert_raises(AssertionError, assert_allclose, 10, 6, rtol=0.5)
+
+    def test_min_int(self):
+        a = np.array([np.iinfo(np.int_).min], dtype=np.int_)
+        # Should not raise:
+        assert_allclose(a, a)
+
+    def test_report_fail_percentage(self):
+        a = np.array([1, 1, 1, 1])
+        b = np.array([1, 1, 1, 2])
+
+        with pytest.raises(AssertionError) as exc_info:
+            assert_allclose(a, b)
+        msg = str(exc_info.value)
+        assert_('Mismatched elements: 1 / 4 (25%)\n'
+                'Max absolute difference: 1\n'
+                'Max relative difference: 0.5' in msg)
+
+    def test_equal_nan(self):
+        a = np.array([np.nan])
+        b = np.array([np.nan])
+        # Should not raise:
+        assert_allclose(a, b, equal_nan=True)
+
+    def test_not_equal_nan(self):
+        a = np.array([np.nan])
+        b = np.array([np.nan])
+        assert_raises(AssertionError, assert_allclose, a, b, equal_nan=False)
+
+    def test_equal_nan_default(self):
+        # Make sure equal_nan default behavior remains unchanged. (All
+        # of these functions use assert_array_compare under the hood.)
+        # None of these should raise.
+        a = np.array([np.nan])
+        b = np.array([np.nan])
+        assert_array_equal(a, b)
+        assert_array_almost_equal(a, b)
+        assert_array_less(a, b)
+        assert_allclose(a, b)
+
+    def test_report_max_relative_error(self):
+        a = np.array([0, 1])
+        b = np.array([0, 2])
+
+        with pytest.raises(AssertionError) as exc_info:
+            assert_allclose(a, b)
+        msg = str(exc_info.value)
+        assert_('Max relative difference: 0.5' in msg)
+
+
+class TestArrayAlmostEqualNulp:
+
+    def test_float64_pass(self):
+        # The number of units of least precision
+        # In this case, use a few places above the lowest level (ie nulp=1)
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float64)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        # Addition
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+        # Subtraction
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+    def test_float64_fail(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float64)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+    def test_float64_ignore_nan(self):
+        # Ignore ULP differences between various NAN's
+        # Note that MIPS may reverse quiet and signaling nans
+        # so we use the builtin version as a base.
+        offset = np.uint64(0xffffffff)
+        nan1_i64 = np.array(np.nan, dtype=np.float64).view(np.uint64)
+        nan2_i64 = nan1_i64 ^ offset  # nan payload on MIPS is all ones.
+        nan1_f64 = nan1_i64.view(np.float64)
+        nan2_f64 = nan2_i64.view(np.float64)
+        assert_array_max_ulp(nan1_f64, nan2_f64, 0)
+
+    def test_float32_pass(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float32)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+    def test_float32_fail(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float32)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+    def test_float32_ignore_nan(self):
+        # Ignore ULP differences between various NAN's
+        # Note that MIPS may reverse quiet and signaling nans
+        # so we use the builtin version as a base.
+        offset = np.uint32(0xffff)
+        nan1_i32 = np.array(np.nan, dtype=np.float32).view(np.uint32)
+        nan2_i32 = nan1_i32 ^ offset  # nan payload on MIPS is all ones.
+        nan1_f32 = nan1_i32.view(np.float32)
+        nan2_f32 = nan2_i32.view(np.float32)
+        assert_array_max_ulp(nan1_f32, nan2_f32, 0)
+
+    def test_float16_pass(self):
+        nulp = 5
+        x = np.linspace(-4, 4, 10, dtype=np.float16)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp/2.
+        assert_array_almost_equal_nulp(x, y, nulp)
+
+    def test_float16_fail(self):
+        nulp = 5
+        x = np.linspace(-4, 4, 10, dtype=np.float16)
+        x = 10**x
+        x = np.r_[-x, x]
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      x, y, nulp)
+
+    def test_float16_ignore_nan(self):
+        # Ignore ULP differences between various NAN's
+        # Note that MIPS may reverse quiet and signaling nans
+        # so we use the builtin version as a base.
+        offset = np.uint16(0xff)
+        nan1_i16 = np.array(np.nan, dtype=np.float16).view(np.uint16)
+        nan2_i16 = nan1_i16 ^ offset  # nan payload on MIPS is all ones.
+        nan1_f16 = nan1_i16.view(np.float16)
+        nan2_f16 = nan2_i16.view(np.float16)
+        assert_array_max_ulp(nan1_f16, nan2_f16, 0)
+
+    def test_complex128_pass(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float64)
+        x = 10**x
+        x = np.r_[-x, x]
+        xi = x + x*1j
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp/2.
+        assert_array_almost_equal_nulp(xi, x + y*1j, nulp)
+        assert_array_almost_equal_nulp(xi, y + x*1j, nulp)
+        # The test condition needs to be at least a factor of sqrt(2) smaller
+        # because the real and imaginary parts both change
+        y = x + x*eps*nulp/4.
+        assert_array_almost_equal_nulp(xi, y + y*1j, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp/2.
+        assert_array_almost_equal_nulp(xi, x + y*1j, nulp)
+        assert_array_almost_equal_nulp(xi, y + x*1j, nulp)
+        y = x - x*epsneg*nulp/4.
+        assert_array_almost_equal_nulp(xi, y + y*1j, nulp)
+
+    def test_complex128_fail(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float64)
+        x = 10**x
+        x = np.r_[-x, x]
+        xi = x + x*1j
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, x + y*1j, nulp)
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + x*1j, nulp)
+        # The test condition needs to be at least a factor of sqrt(2) smaller
+        # because the real and imaginary parts both change
+        y = x + x*eps*nulp
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + y*1j, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, x + y*1j, nulp)
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + x*1j, nulp)
+        y = x - x*epsneg*nulp
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + y*1j, nulp)
+
+    def test_complex64_pass(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float32)
+        x = 10**x
+        x = np.r_[-x, x]
+        xi = x + x*1j
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp/2.
+        assert_array_almost_equal_nulp(xi, x + y*1j, nulp)
+        assert_array_almost_equal_nulp(xi, y + x*1j, nulp)
+        y = x + x*eps*nulp/4.
+        assert_array_almost_equal_nulp(xi, y + y*1j, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp/2.
+        assert_array_almost_equal_nulp(xi, x + y*1j, nulp)
+        assert_array_almost_equal_nulp(xi, y + x*1j, nulp)
+        y = x - x*epsneg*nulp/4.
+        assert_array_almost_equal_nulp(xi, y + y*1j, nulp)
+
+    def test_complex64_fail(self):
+        nulp = 5
+        x = np.linspace(-20, 20, 50, dtype=np.float32)
+        x = 10**x
+        x = np.r_[-x, x]
+        xi = x + x*1j
+
+        eps = np.finfo(x.dtype).eps
+        y = x + x*eps*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, x + y*1j, nulp)
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + x*1j, nulp)
+        y = x + x*eps*nulp
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + y*1j, nulp)
+
+        epsneg = np.finfo(x.dtype).epsneg
+        y = x - x*epsneg*nulp*2.
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, x + y*1j, nulp)
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + x*1j, nulp)
+        y = x - x*epsneg*nulp
+        assert_raises(AssertionError, assert_array_almost_equal_nulp,
+                      xi, y + y*1j, nulp)
+
+
+class TestULP:
+
+    def test_equal(self):
+        x = np.random.randn(10)
+        assert_array_max_ulp(x, x, maxulp=0)
+
+    def test_single(self):
+        # Generate 1 + small deviation, check that adding eps gives a few UNL
+        x = np.ones(10).astype(np.float32)
+        x += 0.01 * np.random.randn(10).astype(np.float32)
+        eps = np.finfo(np.float32).eps
+        assert_array_max_ulp(x, x+eps, maxulp=20)
+
+    def test_double(self):
+        # Generate 1 + small deviation, check that adding eps gives a few UNL
+        x = np.ones(10).astype(np.float64)
+        x += 0.01 * np.random.randn(10).astype(np.float64)
+        eps = np.finfo(np.float64).eps
+        assert_array_max_ulp(x, x+eps, maxulp=200)
+
+    def test_inf(self):
+        for dt in [np.float32, np.float64]:
+            inf = np.array([np.inf]).astype(dt)
+            big = np.array([np.finfo(dt).max])
+            assert_array_max_ulp(inf, big, maxulp=200)
+
+    def test_nan(self):
+        # Test that nan is 'far' from small, tiny, inf, max and min
+        for dt in [np.float32, np.float64]:
+            if dt == np.float32:
+                maxulp = 1e6
+            else:
+                maxulp = 1e12
+            inf = np.array([np.inf]).astype(dt)
+            nan = np.array([np.nan]).astype(dt)
+            big = np.array([np.finfo(dt).max])
+            tiny = np.array([np.finfo(dt).tiny])
+            zero = np.array([np.PZERO]).astype(dt)
+            nzero = np.array([np.NZERO]).astype(dt)
+            assert_raises(AssertionError,
+                          lambda: assert_array_max_ulp(nan, inf,
+                          maxulp=maxulp))
+            assert_raises(AssertionError,
+                          lambda: assert_array_max_ulp(nan, big,
+                          maxulp=maxulp))
+            assert_raises(AssertionError,
+                          lambda: assert_array_max_ulp(nan, tiny,
+                          maxulp=maxulp))
+            assert_raises(AssertionError,
+                          lambda: assert_array_max_ulp(nan, zero,
+                          maxulp=maxulp))
+            assert_raises(AssertionError,
+                          lambda: assert_array_max_ulp(nan, nzero,
+                          maxulp=maxulp))
+
+
+class TestStringEqual:
+    def test_simple(self):
+        assert_string_equal("hello", "hello")
+        assert_string_equal("hello\nmultiline", "hello\nmultiline")
+
+        with pytest.raises(AssertionError) as exc_info:
+            assert_string_equal("foo\nbar", "hello\nbar")
+        msg = str(exc_info.value)
+        assert_equal(msg, "Differences in strings:\n- foo\n+ hello")
+
+        assert_raises(AssertionError,
+                      lambda: assert_string_equal("foo", "hello"))
+
+    def test_regex(self):
+        assert_string_equal("a+*b", "a+*b")
+
+        assert_raises(AssertionError,
+                      lambda: assert_string_equal("aaa", "a+b"))
+
+
+def assert_warn_len_equal(mod, n_in_context, py34=None, py37=None):
+    try:
+        mod_warns = mod.__warningregistry__
+    except AttributeError:
+        # the lack of a __warningregistry__
+        # attribute means that no warning has
+        # occurred; this can be triggered in
+        # a parallel test scenario, while in
+        # a serial test scenario an initial
+        # warning (and therefore the attribute)
+        # are always created first
+        mod_warns = {}
+
+    num_warns = len(mod_warns)
+    # Python 3.4 appears to clear any pre-existing warnings of the same type,
+    # when raising warnings inside a catch_warnings block. So, there is a
+    # warning generated by the tests within the context manager, but no
+    # previous warnings.
+    if 'version' in mod_warns:
+        # Python 3 adds a 'version' entry to the registry,
+        # do not count it.
+        num_warns -= 1
+
+        # Behavior of warnings is Python version dependent. Adjust the
+        # expected result to compensate. In particular, Python 3.7 does
+        # not make an entry for ignored warnings.
+        if sys.version_info[:2] >= (3, 7):
+            if py37 is not None:
+                n_in_context = py37
+        elif sys.version_info[:2] >= (3, 4):
+            if py34 is not None:
+                n_in_context = py34
+    assert_equal(num_warns, n_in_context)
+
+def test_warn_len_equal_call_scenarios():
+    # assert_warn_len_equal is called under
+    # varying circumstances depending on serial
+    # vs. parallel test scenarios; this test
+    # simply aims to probe both code paths and
+    # check that no assertion is uncaught
+
+    # parallel scenario -- no warning issued yet
+    class mod:
+        pass
+
+    mod_inst = mod()
+
+    assert_warn_len_equal(mod=mod_inst,
+                          n_in_context=0)
+
+    # serial test scenario -- the __warningregistry__
+    # attribute should be present
+    class mod:
+        def __init__(self):
+            self.__warningregistry__ = {'warning1':1,
+                                        'warning2':2}
+
+    mod_inst = mod()
+    assert_warn_len_equal(mod=mod_inst,
+                          n_in_context=2)
+
+
+def _get_fresh_mod():
+    # Get this module, with warning registry empty
+    my_mod = sys.modules[__name__]
+    try:
+        my_mod.__warningregistry__.clear()
+    except AttributeError:
+        # will not have a __warningregistry__ unless warning has been
+        # raised in the module at some point
+        pass
+    return my_mod
+
+
+def test_clear_and_catch_warnings():
+    # Initial state of module, no warnings
+    my_mod = _get_fresh_mod()
+    assert_equal(getattr(my_mod, '__warningregistry__', {}), {})
+    with clear_and_catch_warnings(modules=[my_mod]):
+        warnings.simplefilter('ignore')
+        warnings.warn('Some warning')
+    assert_equal(my_mod.__warningregistry__, {})
+    # Without specified modules, don't clear warnings during context
+    # Python 3.7 catch_warnings doesn't make an entry for 'ignore'.
+    with clear_and_catch_warnings():
+        warnings.simplefilter('ignore')
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 1, py37=0)
+    # Confirm that specifying module keeps old warning, does not add new
+    with clear_and_catch_warnings(modules=[my_mod]):
+        warnings.simplefilter('ignore')
+        warnings.warn('Another warning')
+    assert_warn_len_equal(my_mod, 1, py37=0)
+    # Another warning, no module spec does add to warnings dict, except on
+    # Python 3.4 (see comments in `assert_warn_len_equal`)
+    # Python 3.7 catch_warnings doesn't make an entry for 'ignore'.
+    with clear_and_catch_warnings():
+        warnings.simplefilter('ignore')
+        warnings.warn('Another warning')
+    assert_warn_len_equal(my_mod, 2, py34=1, py37=0)
+
+
+def test_suppress_warnings_module():
+    # Initial state of module, no warnings
+    my_mod = _get_fresh_mod()
+    assert_equal(getattr(my_mod, '__warningregistry__', {}), {})
+
+    def warn_other_module():
+        # Apply along axis is implemented in python; stacklevel=2 means
+        # we end up inside its module, not ours.
+        def warn(arr):
+            warnings.warn("Some warning 2", stacklevel=2)
+            return arr
+        np.apply_along_axis(warn, 0, [0])
+
+    # Test module based warning suppression:
+    assert_warn_len_equal(my_mod, 0)
+    with suppress_warnings() as sup:
+        sup.record(UserWarning)
+        # suppress warning from other module (may have .pyc ending),
+        # if apply_along_axis is moved, had to be changed.
+        sup.filter(module=np.lib.shape_base)
+        warnings.warn("Some warning")
+        warn_other_module()
+    # Check that the suppression did test the file correctly (this module
+    # got filtered)
+    assert_equal(len(sup.log), 1)
+    assert_equal(sup.log[0].message.args[0], "Some warning")
+    assert_warn_len_equal(my_mod, 0, py37=0)
+    sup = suppress_warnings()
+    # Will have to be changed if apply_along_axis is moved:
+    sup.filter(module=my_mod)
+    with sup:
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 0)
+    # And test repeat works:
+    sup.filter(module=my_mod)
+    with sup:
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 0)
+
+    # Without specified modules, don't clear warnings during context
+    # Python 3.7 does not add ignored warnings.
+    with suppress_warnings():
+        warnings.simplefilter('ignore')
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 1, py37=0)
+
+def test_suppress_warnings_type():
+    # Initial state of module, no warnings
+    my_mod = _get_fresh_mod()
+    assert_equal(getattr(my_mod, '__warningregistry__', {}), {})
+
+    # Test module based warning suppression:
+    with suppress_warnings() as sup:
+        sup.filter(UserWarning)
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 0)
+    sup = suppress_warnings()
+    sup.filter(UserWarning)
+    with sup:
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 0)
+    # And test repeat works:
+    sup.filter(module=my_mod)
+    with sup:
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 0)
+
+    # Without specified modules, don't clear warnings during context
+    # Python 3.7 does not add ignored warnings.
+    with suppress_warnings():
+        warnings.simplefilter('ignore')
+        warnings.warn('Some warning')
+    assert_warn_len_equal(my_mod, 1, py37=0)
+
+
+def test_suppress_warnings_decorate_no_record():
+    sup = suppress_warnings()
+    sup.filter(UserWarning)
+
+    @sup
+    def warn(category):
+        warnings.warn('Some warning', category)
+
+    with warnings.catch_warnings(record=True) as w:
+        warnings.simplefilter("always")
+        warn(UserWarning)  # should be supppressed
+        warn(RuntimeWarning)
+        assert_equal(len(w), 1)
+
+
+def test_suppress_warnings_record():
+    sup = suppress_warnings()
+    log1 = sup.record()
+
+    with sup:
+        log2 = sup.record(message='Some other warning 2')
+        sup.filter(message='Some warning')
+        warnings.warn('Some warning')
+        warnings.warn('Some other warning')
+        warnings.warn('Some other warning 2')
+
+        assert_equal(len(sup.log), 2)
+        assert_equal(len(log1), 1)
+        assert_equal(len(log2),1)
+        assert_equal(log2[0].message.args[0], 'Some other warning 2')
+
+    # Do it again, with the same context to see if some warnings survived:
+    with sup:
+        log2 = sup.record(message='Some other warning 2')
+        sup.filter(message='Some warning')
+        warnings.warn('Some warning')
+        warnings.warn('Some other warning')
+        warnings.warn('Some other warning 2')
+
+        assert_equal(len(sup.log), 2)
+        assert_equal(len(log1), 1)
+        assert_equal(len(log2), 1)
+        assert_equal(log2[0].message.args[0], 'Some other warning 2')
+
+    # Test nested:
+    with suppress_warnings() as sup:
+        sup.record()
+        with suppress_warnings() as sup2:
+            sup2.record(message='Some warning')
+            warnings.warn('Some warning')
+            warnings.warn('Some other warning')
+            assert_equal(len(sup2.log), 1)
+        assert_equal(len(sup.log), 1)
+
+
+def test_suppress_warnings_forwarding():
+    def warn_other_module():
+        # Apply along axis is implemented in python; stacklevel=2 means
+        # we end up inside its module, not ours.
+        def warn(arr):
+            warnings.warn("Some warning", stacklevel=2)
+            return arr
+        np.apply_along_axis(warn, 0, [0])
+
+    with suppress_warnings() as sup:
+        sup.record()
+        with suppress_warnings("always"):
+            for i in range(2):
+                warnings.warn("Some warning")
+
+        assert_equal(len(sup.log), 2)
+
+    with suppress_warnings() as sup:
+        sup.record()
+        with suppress_warnings("location"):
+            for i in range(2):
+                warnings.warn("Some warning")
+                warnings.warn("Some warning")
+
+        assert_equal(len(sup.log), 2)
+
+    with suppress_warnings() as sup:
+        sup.record()
+        with suppress_warnings("module"):
+            for i in range(2):
+                warnings.warn("Some warning")
+                warnings.warn("Some warning")
+                warn_other_module()
+
+        assert_equal(len(sup.log), 2)
+
+    with suppress_warnings() as sup:
+        sup.record()
+        with suppress_warnings("once"):
+            for i in range(2):
+                warnings.warn("Some warning")
+                warnings.warn("Some other warning")
+                warn_other_module()
+
+        assert_equal(len(sup.log), 2)
+
+
+def test_tempdir():
+    with tempdir() as tdir:
+        fpath = os.path.join(tdir, 'tmp')
+        with open(fpath, 'w'):
+            pass
+    assert_(not os.path.isdir(tdir))
+
+    raised = False
+    try:
+        with tempdir() as tdir:
+            raise ValueError()
+    except ValueError:
+        raised = True
+    assert_(raised)
+    assert_(not os.path.isdir(tdir))
+
+
+def test_temppath():
+    with temppath() as fpath:
+        with open(fpath, 'w'):
+            pass
+    assert_(not os.path.isfile(fpath))
+
+    raised = False
+    try:
+        with temppath() as fpath:
+            raise ValueError()
+    except ValueError:
+        raised = True
+    assert_(raised)
+    assert_(not os.path.isfile(fpath))
+
+
+class my_cacw(clear_and_catch_warnings):
+
+    class_modules = (sys.modules[__name__],)
+
+
+def test_clear_and_catch_warnings_inherit():
+    # Test can subclass and add default modules
+    my_mod = _get_fresh_mod()
+    with my_cacw():
+        warnings.simplefilter('ignore')
+        warnings.warn('Some warning')
+    assert_equal(my_mod.__warningregistry__, {})
+
+
+@pytest.mark.skipif(not HAS_REFCOUNT, reason="Python lacks refcounts")
+class TestAssertNoGcCycles:
+    """ Test assert_no_gc_cycles """
+    def test_passes(self):
+        def no_cycle():
+            b = []
+            b.append([])
+            return b
+
+        with assert_no_gc_cycles():
+            no_cycle()
+
+        assert_no_gc_cycles(no_cycle)
+
+    def test_asserts(self):
+        def make_cycle():
+            a = []
+            a.append(a)
+            a.append(a)
+            return a
+
+        with assert_raises(AssertionError):
+            with assert_no_gc_cycles():
+                make_cycle()
+
+        with assert_raises(AssertionError):
+            assert_no_gc_cycles(make_cycle)
+
+    @pytest.mark.slow
+    def test_fails(self):
+        """
+        Test that in cases where the garbage cannot be collected, we raise an
+        error, instead of hanging forever trying to clear it.
+        """
+
+        class ReferenceCycleInDel:
+            """
+            An object that not only contains a reference cycle, but creates new
+            cycles whenever it's garbage-collected and its __del__ runs
+            """
+            make_cycle = True
+
+            def __init__(self):
+                self.cycle = self
+
+            def __del__(self):
+                # break the current cycle so that `self` can be freed
+                self.cycle = None
+
+                if ReferenceCycleInDel.make_cycle:
+                    # but create a new one so that the garbage collector has more
+                    # work to do.
+                    ReferenceCycleInDel()
+
+        try:
+            w = weakref.ref(ReferenceCycleInDel())
+            try:
+                with assert_raises(RuntimeError):
+                    # this will be unable to get a baseline empty garbage
+                    assert_no_gc_cycles(lambda: None)
+            except AssertionError:
+                # the above test is only necessary if the GC actually tried to free
+                # our object anyway, which python 2.7 does not.
+                if w() is not None:
+                    pytest.skip("GC does not call __del__ on cyclic objects")
+                    raise
+
+        finally:
+            # make sure that we stop creating reference cycles
+            ReferenceCycleInDel.make_cycle = False
diff --git a/venv/Lib/site-packages/numpy/testing/utils.py b/venv/Lib/site-packages/numpy/testing/utils.py
new file mode 100644
index 000000000..753258c13
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/testing/utils.py
@@ -0,0 +1,28 @@
+"""
+Back compatibility utils module. It will import the appropriate
+set of tools
+
+"""
+import warnings
+
+# 2018-04-04, numpy 1.15.0 ImportWarning
+# 2019-09-18, numpy 1.18.0 DeprecatonWarning (changed)
+warnings.warn("Importing from numpy.testing.utils is deprecated "
+              "since 1.15.0, import from numpy.testing instead.",
+              DeprecationWarning, stacklevel=2)
+
+from ._private.utils import *
+
+__all__ = [
+        'assert_equal', 'assert_almost_equal', 'assert_approx_equal',
+        'assert_array_equal', 'assert_array_less', 'assert_string_equal',
+        'assert_array_almost_equal', 'assert_raises', 'build_err_msg',
+        'decorate_methods', 'jiffies', 'memusage', 'print_assert_equal',
+        'raises', 'rundocs', 'runstring', 'verbose', 'measure',
+        'assert_', 'assert_array_almost_equal_nulp', 'assert_raises_regex',
+        'assert_array_max_ulp', 'assert_warns', 'assert_no_warnings',
+        'assert_allclose', 'IgnoreException', 'clear_and_catch_warnings',
+        'SkipTest', 'KnownFailureException', 'temppath', 'tempdir', 'IS_PYPY',
+        'HAS_REFCOUNT', 'suppress_warnings', 'assert_array_compare',
+        '_assert_valid_refcount', '_gen_alignment_data', 'assert_no_gc_cycles'
+        ]
diff --git a/venv/Lib/site-packages/numpy/tests/__init__.py b/venv/Lib/site-packages/numpy/tests/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4063ffa0b
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_ctypeslib.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_ctypeslib.cpython-36.pyc
new file mode 100644
index 000000000..acf4d85ee
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_ctypeslib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_matlib.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_matlib.cpython-36.pyc
new file mode 100644
index 000000000..69918eb58
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_matlib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_numpy_version.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_numpy_version.cpython-36.pyc
new file mode 100644
index 000000000..e24399cc7
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_numpy_version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_public_api.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_public_api.cpython-36.pyc
new file mode 100644
index 000000000..f2a9ed2f3
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_public_api.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_reloading.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_reloading.cpython-36.pyc
new file mode 100644
index 000000000..fc6297e1a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_reloading.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_scripts.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_scripts.cpython-36.pyc
new file mode 100644
index 000000000..f97db833f
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/__pycache__/test_warnings.cpython-36.pyc b/venv/Lib/site-packages/numpy/tests/__pycache__/test_warnings.cpython-36.pyc
new file mode 100644
index 000000000..1eda2380a
Binary files /dev/null and b/venv/Lib/site-packages/numpy/tests/__pycache__/test_warnings.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/numpy/tests/test_ctypeslib.py b/venv/Lib/site-packages/numpy/tests/test_ctypeslib.py
new file mode 100644
index 000000000..af3730df1
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_ctypeslib.py
@@ -0,0 +1,365 @@
+import sys
+import pytest
+import weakref
+
+import numpy as np
+from numpy.ctypeslib import ndpointer, load_library, as_array
+from numpy.distutils.misc_util import get_shared_lib_extension
+from numpy.testing import assert_, assert_array_equal, assert_raises, assert_equal
+
+try:
+    import ctypes
+except ImportError:
+    ctypes = None
+else:
+    cdll = None
+    test_cdll = None
+    if hasattr(sys, 'gettotalrefcount'):
+        try:
+            cdll = load_library('_multiarray_umath_d', np.core._multiarray_umath.__file__)
+        except OSError:
+            pass
+        try:
+            test_cdll = load_library('_multiarray_tests', np.core._multiarray_tests.__file__)
+        except OSError:
+            pass
+    if cdll is None:
+        cdll = load_library('_multiarray_umath', np.core._multiarray_umath.__file__)
+    if test_cdll is None:
+        test_cdll = load_library('_multiarray_tests', np.core._multiarray_tests.__file__)
+
+    c_forward_pointer = test_cdll.forward_pointer
+
+
+@pytest.mark.skipif(ctypes is None,
+                    reason="ctypes not available in this python")
+@pytest.mark.skipif(sys.platform == 'cygwin',
+                    reason="Known to fail on cygwin")
+class TestLoadLibrary:
+    def test_basic(self):
+        try:
+            # Should succeed
+            load_library('_multiarray_umath', np.core._multiarray_umath.__file__)
+        except ImportError as e:
+            msg = ("ctypes is not available on this python: skipping the test"
+                   " (import error was: %s)" % str(e))
+            print(msg)
+
+    def test_basic2(self):
+        # Regression for #801: load_library with a full library name
+        # (including extension) does not work.
+        try:
+            try:
+                so = get_shared_lib_extension(is_python_ext=True)
+                # Should succeed
+                load_library('_multiarray_umath%s' % so, np.core._multiarray_umath.__file__)
+            except ImportError:
+                print("No distutils available, skipping test.")
+        except ImportError as e:
+            msg = ("ctypes is not available on this python: skipping the test"
+                   " (import error was: %s)" % str(e))
+            print(msg)
+
+
+class TestNdpointer:
+    def test_dtype(self):
+        dt = np.intc
+        p = ndpointer(dtype=dt)
+        assert_(p.from_param(np.array([1], dt)))
+        dt = '<i4'
+        p = ndpointer(dtype=dt)
+        assert_(p.from_param(np.array([1], dt)))
+        dt = np.dtype('>i4')
+        p = ndpointer(dtype=dt)
+        p.from_param(np.array([1], dt))
+        assert_raises(TypeError, p.from_param,
+                          np.array([1], dt.newbyteorder('swap')))
+        dtnames = ['x', 'y']
+        dtformats = [np.intc, np.float64]
+        dtdescr = {'names': dtnames, 'formats': dtformats}
+        dt = np.dtype(dtdescr)
+        p = ndpointer(dtype=dt)
+        assert_(p.from_param(np.zeros((10,), dt)))
+        samedt = np.dtype(dtdescr)
+        p = ndpointer(dtype=samedt)
+        assert_(p.from_param(np.zeros((10,), dt)))
+        dt2 = np.dtype(dtdescr, align=True)
+        if dt.itemsize != dt2.itemsize:
+            assert_raises(TypeError, p.from_param, np.zeros((10,), dt2))
+        else:
+            assert_(p.from_param(np.zeros((10,), dt2)))
+
+    def test_ndim(self):
+        p = ndpointer(ndim=0)
+        assert_(p.from_param(np.array(1)))
+        assert_raises(TypeError, p.from_param, np.array([1]))
+        p = ndpointer(ndim=1)
+        assert_raises(TypeError, p.from_param, np.array(1))
+        assert_(p.from_param(np.array([1])))
+        p = ndpointer(ndim=2)
+        assert_(p.from_param(np.array([[1]])))
+
+    def test_shape(self):
+        p = ndpointer(shape=(1, 2))
+        assert_(p.from_param(np.array([[1, 2]])))
+        assert_raises(TypeError, p.from_param, np.array([[1], [2]]))
+        p = ndpointer(shape=())
+        assert_(p.from_param(np.array(1)))
+
+    def test_flags(self):
+        x = np.array([[1, 2], [3, 4]], order='F')
+        p = ndpointer(flags='FORTRAN')
+        assert_(p.from_param(x))
+        p = ndpointer(flags='CONTIGUOUS')
+        assert_raises(TypeError, p.from_param, x)
+        p = ndpointer(flags=x.flags.num)
+        assert_(p.from_param(x))
+        assert_raises(TypeError, p.from_param, np.array([[1, 2], [3, 4]]))
+
+    def test_cache(self):
+        assert_(ndpointer(dtype=np.float64) is ndpointer(dtype=np.float64))
+
+        # shapes are normalized
+        assert_(ndpointer(shape=2) is ndpointer(shape=(2,)))
+
+        # 1.12 <= v < 1.16 had a bug that made these fail
+        assert_(ndpointer(shape=2) is not ndpointer(ndim=2))
+        assert_(ndpointer(ndim=2) is not ndpointer(shape=2))
+
+@pytest.mark.skipif(ctypes is None,
+                    reason="ctypes not available on this python installation")
+class TestNdpointerCFunc:
+    def test_arguments(self):
+        """ Test that arguments are coerced from arrays """
+        c_forward_pointer.restype = ctypes.c_void_p
+        c_forward_pointer.argtypes = (ndpointer(ndim=2),)
+
+        c_forward_pointer(np.zeros((2, 3)))
+        # too many dimensions
+        assert_raises(
+            ctypes.ArgumentError, c_forward_pointer, np.zeros((2, 3, 4)))
+
+    @pytest.mark.parametrize(
+        'dt', [
+            float,
+            np.dtype(dict(
+                formats=['<i4', '<i4'],
+                names=['a', 'b'],
+                offsets=[0, 2],
+                itemsize=6
+            ))
+        ], ids=[
+            'float',
+            'overlapping-fields'
+        ]
+    )
+    def test_return(self, dt):
+        """ Test that return values are coerced to arrays """
+        arr = np.zeros((2, 3), dt)
+        ptr_type = ndpointer(shape=arr.shape, dtype=arr.dtype)
+
+        c_forward_pointer.restype = ptr_type
+        c_forward_pointer.argtypes = (ptr_type,)
+
+        # check that the arrays are equivalent views on the same data
+        arr2 = c_forward_pointer(arr)
+        assert_equal(arr2.dtype, arr.dtype)
+        assert_equal(arr2.shape, arr.shape)
+        assert_equal(
+            arr2.__array_interface__['data'],
+            arr.__array_interface__['data']
+        )
+
+    def test_vague_return_value(self):
+        """ Test that vague ndpointer return values do not promote to arrays """
+        arr = np.zeros((2, 3))
+        ptr_type = ndpointer(dtype=arr.dtype)
+
+        c_forward_pointer.restype = ptr_type
+        c_forward_pointer.argtypes = (ptr_type,)
+
+        ret = c_forward_pointer(arr)
+        assert_(isinstance(ret, ptr_type))
+
+
+@pytest.mark.skipif(ctypes is None,
+                    reason="ctypes not available on this python installation")
+class TestAsArray:
+    def test_array(self):
+        from ctypes import c_int
+
+        pair_t = c_int * 2
+        a = as_array(pair_t(1, 2))
+        assert_equal(a.shape, (2,))
+        assert_array_equal(a, np.array([1, 2]))
+        a = as_array((pair_t * 3)(pair_t(1, 2), pair_t(3, 4), pair_t(5, 6)))
+        assert_equal(a.shape, (3, 2))
+        assert_array_equal(a, np.array([[1, 2], [3, 4], [5, 6]]))
+
+    def test_pointer(self):
+        from ctypes import c_int, cast, POINTER
+
+        p = cast((c_int * 10)(*range(10)), POINTER(c_int))
+
+        a = as_array(p, shape=(10,))
+        assert_equal(a.shape, (10,))
+        assert_array_equal(a, np.arange(10))
+
+        a = as_array(p, shape=(2, 5))
+        assert_equal(a.shape, (2, 5))
+        assert_array_equal(a, np.arange(10).reshape((2, 5)))
+
+        # shape argument is required
+        assert_raises(TypeError, as_array, p)
+
+    def test_struct_array_pointer(self):
+        from ctypes import c_int16, Structure, pointer
+
+        class Struct(Structure):
+            _fields_ = [('a', c_int16)]
+
+        Struct3 = 3 * Struct
+
+        c_array = (2 * Struct3)(
+            Struct3(Struct(a=1), Struct(a=2), Struct(a=3)),
+            Struct3(Struct(a=4), Struct(a=5), Struct(a=6))
+        )
+
+        expected = np.array([
+            [(1,), (2,), (3,)],
+            [(4,), (5,), (6,)],
+        ], dtype=[('a', np.int16)])
+
+        def check(x):
+            assert_equal(x.dtype, expected.dtype)
+            assert_equal(x, expected)
+
+        # all of these should be equivalent
+        check(as_array(c_array))
+        check(as_array(pointer(c_array), shape=()))
+        check(as_array(pointer(c_array[0]), shape=(2,)))
+        check(as_array(pointer(c_array[0][0]), shape=(2, 3)))
+
+    def test_reference_cycles(self):
+        # related to gh-6511
+        import ctypes
+
+        # create array to work with
+        # don't use int/long to avoid running into bpo-10746
+        N = 100
+        a = np.arange(N, dtype=np.short)
+
+        # get pointer to array
+        pnt = np.ctypeslib.as_ctypes(a)
+
+        with np.testing.assert_no_gc_cycles():
+            # decay the array above to a pointer to its first element
+            newpnt = ctypes.cast(pnt, ctypes.POINTER(ctypes.c_short))
+            # and construct an array using this data
+            b = np.ctypeslib.as_array(newpnt, (N,))
+            # now delete both, which should cleanup both objects
+            del newpnt, b
+
+    def test_segmentation_fault(self):
+        arr = np.zeros((224, 224, 3))
+        c_arr = np.ctypeslib.as_ctypes(arr)
+        arr_ref = weakref.ref(arr)
+        del arr
+
+        # check the reference wasn't cleaned up
+        assert_(arr_ref() is not None)
+
+        # check we avoid the segfault
+        c_arr[0][0][0]
+
+
+@pytest.mark.skipif(ctypes is None,
+                    reason="ctypes not available on this python installation")
+class TestAsCtypesType:
+    """ Test conversion from dtypes to ctypes types """
+    def test_scalar(self):
+        dt = np.dtype('<u2')
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_equal(ct, ctypes.c_uint16.__ctype_le__)
+
+        dt = np.dtype('>u2')
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_equal(ct, ctypes.c_uint16.__ctype_be__)
+
+        dt = np.dtype('u2')
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_equal(ct, ctypes.c_uint16)
+
+    def test_subarray(self):
+        dt = np.dtype((np.int32, (2, 3)))
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_equal(ct, 2 * (3 * ctypes.c_int32))
+
+    def test_structure(self):
+        dt = np.dtype([
+            ('a', np.uint16),
+            ('b', np.uint32),
+        ])
+
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_(issubclass(ct, ctypes.Structure))
+        assert_equal(ctypes.sizeof(ct), dt.itemsize)
+        assert_equal(ct._fields_, [
+            ('a', ctypes.c_uint16),
+            ('b', ctypes.c_uint32),
+        ])
+
+    def test_structure_aligned(self):
+        dt = np.dtype([
+            ('a', np.uint16),
+            ('b', np.uint32),
+        ], align=True)
+
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_(issubclass(ct, ctypes.Structure))
+        assert_equal(ctypes.sizeof(ct), dt.itemsize)
+        assert_equal(ct._fields_, [
+            ('a', ctypes.c_uint16),
+            ('', ctypes.c_char * 2),  # padding
+            ('b', ctypes.c_uint32),
+        ])
+
+    def test_union(self):
+        dt = np.dtype(dict(
+            names=['a', 'b'],
+            offsets=[0, 0],
+            formats=[np.uint16, np.uint32]
+        ))
+
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_(issubclass(ct, ctypes.Union))
+        assert_equal(ctypes.sizeof(ct), dt.itemsize)
+        assert_equal(ct._fields_, [
+            ('a', ctypes.c_uint16),
+            ('b', ctypes.c_uint32),
+        ])
+
+    def test_padded_union(self):
+        dt = np.dtype(dict(
+            names=['a', 'b'],
+            offsets=[0, 0],
+            formats=[np.uint16, np.uint32],
+            itemsize=5,
+        ))
+
+        ct = np.ctypeslib.as_ctypes_type(dt)
+        assert_(issubclass(ct, ctypes.Union))
+        assert_equal(ctypes.sizeof(ct), dt.itemsize)
+        assert_equal(ct._fields_, [
+            ('a', ctypes.c_uint16),
+            ('b', ctypes.c_uint32),
+            ('', ctypes.c_char * 5),  # padding
+        ])
+
+    def test_overlapping(self):
+        dt = np.dtype(dict(
+            names=['a', 'b'],
+            offsets=[0, 2],
+            formats=[np.uint32, np.uint32]
+        ))
+        assert_raises(NotImplementedError, np.ctypeslib.as_ctypes_type, dt)
diff --git a/venv/Lib/site-packages/numpy/tests/test_matlib.py b/venv/Lib/site-packages/numpy/tests/test_matlib.py
new file mode 100644
index 000000000..0e93c4848
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_matlib.py
@@ -0,0 +1,58 @@
+import numpy as np
+import numpy.matlib
+from numpy.testing import assert_array_equal, assert_
+
+def test_empty():
+    x = numpy.matlib.empty((2,))
+    assert_(isinstance(x, np.matrix))
+    assert_(x.shape, (1, 2))
+
+def test_ones():
+    assert_array_equal(numpy.matlib.ones((2, 3)),
+                       np.matrix([[ 1.,  1.,  1.],
+                                 [ 1.,  1.,  1.]]))
+
+    assert_array_equal(numpy.matlib.ones(2), np.matrix([[ 1.,  1.]]))
+
+def test_zeros():
+    assert_array_equal(numpy.matlib.zeros((2, 3)),
+                       np.matrix([[ 0.,  0.,  0.],
+                                 [ 0.,  0.,  0.]]))
+
+    assert_array_equal(numpy.matlib.zeros(2), np.matrix([[ 0.,  0.]]))
+
+def test_identity():
+    x = numpy.matlib.identity(2, dtype=int)
+    assert_array_equal(x, np.matrix([[1, 0], [0, 1]]))
+
+def test_eye():
+    xc = numpy.matlib.eye(3, k=1, dtype=int)
+    assert_array_equal(xc, np.matrix([[ 0,  1,  0],
+                                      [ 0,  0,  1],
+                                      [ 0,  0,  0]]))
+    assert xc.flags.c_contiguous
+    assert not xc.flags.f_contiguous
+
+    xf = numpy.matlib.eye(3, 4, dtype=int, order='F')
+    assert_array_equal(xf, np.matrix([[ 1,  0,  0,  0],
+                                      [ 0,  1,  0,  0],
+                                      [ 0,  0,  1,  0]]))
+    assert not xf.flags.c_contiguous
+    assert xf.flags.f_contiguous
+
+def test_rand():
+    x = numpy.matlib.rand(3)
+    # check matrix type, array would have shape (3,)
+    assert_(x.ndim == 2)
+
+def test_randn():
+    x = np.matlib.randn(3)
+    # check matrix type, array would have shape (3,)
+    assert_(x.ndim == 2)
+
+def test_repmat():
+    a1 = np.arange(4)
+    x = numpy.matlib.repmat(a1, 2, 2)
+    y = np.array([[0, 1, 2, 3, 0, 1, 2, 3],
+                  [0, 1, 2, 3, 0, 1, 2, 3]])
+    assert_array_equal(x, y)
diff --git a/venv/Lib/site-packages/numpy/tests/test_numpy_version.py b/venv/Lib/site-packages/numpy/tests/test_numpy_version.py
new file mode 100644
index 000000000..916ab9383
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_numpy_version.py
@@ -0,0 +1,17 @@
+import re
+
+import numpy as np
+from numpy.testing import assert_
+
+
+def test_valid_numpy_version():
+    # Verify that the numpy version is a valid one (no .post suffix or other
+    # nonsense).  See gh-6431 for an issue caused by an invalid version.
+    version_pattern = r"^[0-9]+\.[0-9]+\.[0-9]+(|a[0-9]|b[0-9]|rc[0-9])"
+    dev_suffix = r"(\.dev0\+([0-9a-f]{7}|Unknown))"
+    if np.version.release:
+        res = re.match(version_pattern, np.__version__)
+    else:
+        res = re.match(version_pattern + dev_suffix, np.__version__)
+
+    assert_(res is not None, np.__version__)
diff --git a/venv/Lib/site-packages/numpy/tests/test_public_api.py b/venv/Lib/site-packages/numpy/tests/test_public_api.py
new file mode 100644
index 000000000..fb7ec5d83
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_public_api.py
@@ -0,0 +1,490 @@
+import sys
+import subprocess
+import pkgutil
+import types
+import importlib
+import warnings
+
+import numpy as np
+import numpy
+import pytest
+
+try:
+    import ctypes
+except ImportError:
+    ctypes = None
+
+
+def check_dir(module, module_name=None):
+    """Returns a mapping of all objects with the wrong __module__ attribute."""
+    if module_name is None:
+        module_name = module.__name__
+    results = {}
+    for name in dir(module):
+        item = getattr(module, name)
+        if (hasattr(item, '__module__') and hasattr(item, '__name__')
+                and item.__module__ != module_name):
+            results[name] = item.__module__ + '.' + item.__name__
+    return results
+
+
+def test_numpy_namespace():
+    # None of these objects are publicly documented to be part of the main
+    # NumPy namespace (some are useful though, others need to be cleaned up)
+    undocumented = {
+        'Tester': 'numpy.testing._private.nosetester.NoseTester',
+        '_add_newdoc_ufunc': 'numpy.core._multiarray_umath._add_newdoc_ufunc',
+        'add_docstring': 'numpy.core._multiarray_umath.add_docstring',
+        'add_newdoc': 'numpy.core.function_base.add_newdoc',
+        'add_newdoc_ufunc': 'numpy.core._multiarray_umath._add_newdoc_ufunc',
+        'byte_bounds': 'numpy.lib.utils.byte_bounds',
+        'compare_chararrays': 'numpy.core._multiarray_umath.compare_chararrays',
+        'deprecate': 'numpy.lib.utils.deprecate',
+        'deprecate_with_doc': 'numpy.lib.utils.<lambda>',
+        'disp': 'numpy.lib.function_base.disp',
+        'fastCopyAndTranspose': 'numpy.core._multiarray_umath._fastCopyAndTranspose',
+        'get_array_wrap': 'numpy.lib.shape_base.get_array_wrap',
+        'get_include': 'numpy.lib.utils.get_include',
+        'mafromtxt': 'numpy.lib.npyio.mafromtxt',
+        'ndfromtxt': 'numpy.lib.npyio.ndfromtxt',
+        'recfromcsv': 'numpy.lib.npyio.recfromcsv',
+        'recfromtxt': 'numpy.lib.npyio.recfromtxt',
+        'safe_eval': 'numpy.lib.utils.safe_eval',
+        'set_string_function': 'numpy.core.arrayprint.set_string_function',
+        'show_config': 'numpy.__config__.show',
+        'who': 'numpy.lib.utils.who',
+    }
+    # These built-in types are re-exported by numpy.
+    builtins = {
+        'bool': 'builtins.bool',
+        'complex': 'builtins.complex',
+        'float': 'builtins.float',
+        'int': 'builtins.int',
+        'long': 'builtins.int',
+        'object': 'builtins.object',
+        'str': 'builtins.str',
+        'unicode': 'builtins.str',
+    }
+    whitelist = dict(undocumented, **builtins)
+    bad_results = check_dir(np)
+    # pytest gives better error messages with the builtin assert than with
+    # assert_equal
+    assert bad_results == whitelist
+
+
+@pytest.mark.parametrize('name', ['testing', 'Tester'])
+def test_import_lazy_import(name):
+    """Make sure we can actually use the modules we lazy load.
+
+    While not exported as part of the public API, it was accessible.  With the
+    use of __getattr__ and __dir__, this isn't always true It can happen that
+    an infinite recursion may happen.
+
+    This is the only way I found that would force the failure to appear on the
+    badly implemented code.
+
+    We also test for the presence of the lazily imported modules in dir
+
+    """
+    exe = (sys.executable, '-c', "import numpy; numpy." + name)
+    result = subprocess.check_output(exe)
+    assert not result
+
+    # Make sure they are still in the __dir__
+    assert name in dir(np)
+
+
+def test_dir_testing():
+    """Assert that output of dir has only one "testing/tester"
+    attribute without duplicate"""
+    assert len(dir(np)) == len(set(dir(np)))
+    
+
+def test_numpy_linalg():
+    bad_results = check_dir(np.linalg)
+    assert bad_results == {}
+
+
+def test_numpy_fft():
+    bad_results = check_dir(np.fft)
+    assert bad_results == {}
+
+
+@pytest.mark.skipif(ctypes is None,
+                    reason="ctypes not available in this python")
+def test_NPY_NO_EXPORT():
+    cdll = ctypes.CDLL(np.core._multiarray_tests.__file__)
+    # Make sure an arbitrary NPY_NO_EXPORT function is actually hidden
+    f = getattr(cdll, 'test_not_exported', None)
+    assert f is None, ("'test_not_exported' is mistakenly exported, "
+                      "NPY_NO_EXPORT does not work")
+
+
+# Historically NumPy has not used leading underscores for private submodules
+# much.  This has resulted in lots of things that look like public modules
+# (i.e. things that can be imported as `import numpy.somesubmodule.somefile`),
+# but were never intended to be public.  The PUBLIC_MODULES list contains
+# modules that are either public because they were meant to be, or because they
+# contain public functions/objects that aren't present in any other namespace
+# for whatever reason and therefore should be treated as public.
+#
+# The PRIVATE_BUT_PRESENT_MODULES list contains modules that look public (lack
+# of underscores) but should not be used.  For many of those modules the
+# current status is fine.  For others it may make sense to work on making them
+# private, to clean up our public API and avoid confusion.
+PUBLIC_MODULES = ['numpy.' + s for s in [
+    "ctypeslib",
+    "distutils",
+    "distutils.cpuinfo",
+    "distutils.exec_command",
+    "distutils.misc_util",
+    "distutils.log",
+    "distutils.system_info",
+    "doc",
+    "doc.basics",
+    "doc.broadcasting",
+    "doc.byteswapping",
+    "doc.constants",
+    "doc.creation",
+    "doc.dispatch",
+    "doc.glossary",
+    "doc.indexing",
+    "doc.internals",
+    "doc.misc",
+    "doc.structured_arrays",
+    "doc.subclassing",
+    "doc.ufuncs",
+    "dual",
+    "f2py",
+    "fft",
+    "lib",
+    "lib.format",  # was this meant to be public?
+    "lib.mixins",
+    "lib.recfunctions",
+    "lib.scimath",
+    "linalg",
+    "ma",
+    "ma.extras",
+    "ma.mrecords",
+    "matlib",
+    "polynomial",
+    "polynomial.chebyshev",
+    "polynomial.hermite",
+    "polynomial.hermite_e",
+    "polynomial.laguerre",
+    "polynomial.legendre",
+    "polynomial.polynomial",
+    "polynomial.polyutils",
+    "random",
+    "testing",
+    "version",
+]]
+
+
+PUBLIC_ALIASED_MODULES = [
+    "numpy.char",
+    "numpy.emath",
+    "numpy.rec",
+]
+
+
+PRIVATE_BUT_PRESENT_MODULES = ['numpy.' + s for s in [
+    "compat",
+    "compat.py3k",
+    "conftest",
+    "core",
+    "core.arrayprint",
+    "core.defchararray",
+    "core.einsumfunc",
+    "core.fromnumeric",
+    "core.function_base",
+    "core.getlimits",
+    "core.machar",
+    "core.memmap",
+    "core.multiarray",
+    "core.numeric",
+    "core.numerictypes",
+    "core.overrides",
+    "core.records",
+    "core.shape_base",
+    "core.umath",
+    "core.umath_tests",
+    "distutils.ccompiler",
+    "distutils.command",
+    "distutils.command.autodist",
+    "distutils.command.bdist_rpm",
+    "distutils.command.build",
+    "distutils.command.build_clib",
+    "distutils.command.build_ext",
+    "distutils.command.build_py",
+    "distutils.command.build_scripts",
+    "distutils.command.build_src",
+    "distutils.command.config",
+    "distutils.command.config_compiler",
+    "distutils.command.develop",
+    "distutils.command.egg_info",
+    "distutils.command.install",
+    "distutils.command.install_clib",
+    "distutils.command.install_data",
+    "distutils.command.install_headers",
+    "distutils.command.sdist",
+    "distutils.conv_template",
+    "distutils.core",
+    "distutils.extension",
+    "distutils.fcompiler",
+    "distutils.fcompiler.absoft",
+    "distutils.fcompiler.compaq",
+    "distutils.fcompiler.environment",
+    "distutils.fcompiler.g95",
+    "distutils.fcompiler.gnu",
+    "distutils.fcompiler.hpux",
+    "distutils.fcompiler.ibm",
+    "distutils.fcompiler.intel",
+    "distutils.fcompiler.lahey",
+    "distutils.fcompiler.mips",
+    "distutils.fcompiler.nag",
+    "distutils.fcompiler.none",
+    "distutils.fcompiler.pathf95",
+    "distutils.fcompiler.pg",
+    "distutils.fcompiler.sun",
+    "distutils.fcompiler.vast",
+    "distutils.from_template",
+    "distutils.intelccompiler",
+    "distutils.lib2def",
+    "distutils.line_endings",
+    "distutils.mingw32ccompiler",
+    "distutils.msvccompiler",
+    "distutils.npy_pkg_config",
+    "distutils.numpy_distribution",
+    "distutils.pathccompiler",
+    "distutils.unixccompiler",
+    "f2py.auxfuncs",
+    "f2py.capi_maps",
+    "f2py.cb_rules",
+    "f2py.cfuncs",
+    "f2py.common_rules",
+    "f2py.crackfortran",
+    "f2py.diagnose",
+    "f2py.f2py2e",
+    "f2py.f2py_testing",
+    "f2py.f90mod_rules",
+    "f2py.func2subr",
+    "f2py.rules",
+    "f2py.use_rules",
+    "fft.helper",
+    "lib.arraypad",
+    "lib.arraysetops",
+    "lib.arrayterator",
+    "lib.financial",
+    "lib.function_base",
+    "lib.histograms",
+    "lib.index_tricks",
+    "lib.nanfunctions",
+    "lib.npyio",
+    "lib.polynomial",
+    "lib.shape_base",
+    "lib.stride_tricks",
+    "lib.twodim_base",
+    "lib.type_check",
+    "lib.ufunclike",
+    "lib.user_array",  # note: not in np.lib, but probably should just be deleted
+    "lib.utils",
+    "linalg.lapack_lite",
+    "linalg.linalg",
+    "ma.bench",
+    "ma.core",
+    "ma.testutils",
+    "ma.timer_comparison",
+    "matrixlib",
+    "matrixlib.defmatrix",
+    "random.mtrand",
+    "random.bit_generator",
+    "testing.print_coercion_tables",
+    "testing.utils",
+]]
+
+
+def is_unexpected(name):
+    """Check if this needs to be considered."""
+    if '._' in name or '.tests' in name or '.setup' in name:
+        return False
+
+    if name in PUBLIC_MODULES:
+        return False
+
+    if name in PUBLIC_ALIASED_MODULES:
+        return False
+
+    if name in PRIVATE_BUT_PRESENT_MODULES:
+        return False
+
+    return True
+
+
+# These are present in a directory with an __init__.py but cannot be imported
+# code_generators/ isn't installed, but present for an inplace build
+SKIP_LIST = [
+    "numpy.core.code_generators",
+    "numpy.core.code_generators.genapi",
+    "numpy.core.code_generators.generate_umath",
+    "numpy.core.code_generators.ufunc_docstrings",
+    "numpy.core.code_generators.generate_numpy_api",
+    "numpy.core.code_generators.generate_ufunc_api",
+    "numpy.core.code_generators.numpy_api",
+    "numpy.core.cversions",
+    "numpy.core.generate_numpy_api",
+    "numpy.distutils.msvc9compiler",
+]
+
+
+def test_all_modules_are_expected():
+    """
+    Test that we don't add anything that looks like a new public module by
+    accident.  Check is based on filenames.
+    """
+
+    modnames = []
+    for _, modname, ispkg in pkgutil.walk_packages(path=np.__path__,
+                                                   prefix=np.__name__ + '.',
+                                                   onerror=None):
+        if is_unexpected(modname) and modname not in SKIP_LIST:
+            # We have a name that is new.  If that's on purpose, add it to
+            # PUBLIC_MODULES.  We don't expect to have to add anything to
+            # PRIVATE_BUT_PRESENT_MODULES.  Use an underscore in the name!
+            modnames.append(modname)
+
+    if modnames:
+        raise AssertionError("Found unexpected modules: {}".format(modnames))
+
+
+# Stuff that clearly shouldn't be in the API and is detected by the next test
+# below
+SKIP_LIST_2 = [
+    'numpy.math',
+    'numpy.distutils.log.sys',
+    'numpy.distutils.system_info.copy',
+    'numpy.distutils.system_info.distutils',
+    'numpy.distutils.system_info.log',
+    'numpy.distutils.system_info.os',
+    'numpy.distutils.system_info.platform',
+    'numpy.distutils.system_info.re',
+    'numpy.distutils.system_info.shutil',
+    'numpy.distutils.system_info.subprocess',
+    'numpy.distutils.system_info.sys',
+    'numpy.distutils.system_info.tempfile',
+    'numpy.distutils.system_info.textwrap',
+    'numpy.distutils.system_info.warnings',
+    'numpy.doc.constants.re',
+    'numpy.doc.constants.textwrap',
+    'numpy.lib.emath',
+    'numpy.lib.math',
+    'numpy.matlib.char',
+    'numpy.matlib.rec',
+    'numpy.matlib.emath',
+    'numpy.matlib.math',
+    'numpy.matlib.linalg',
+    'numpy.matlib.fft',
+    'numpy.matlib.random',
+    'numpy.matlib.ctypeslib',
+    'numpy.matlib.ma',
+]
+
+
+def test_all_modules_are_expected_2():
+    """
+    Method checking all objects. The pkgutil-based method in
+    `test_all_modules_are_expected` does not catch imports into a namespace,
+    only filenames.  So this test is more thorough, and checks this like:
+
+        import .lib.scimath as emath
+
+    To check if something in a module is (effectively) public, one can check if
+    there's anything in that namespace that's a public function/object but is
+    not exposed in a higher-level namespace.  For example for a `numpy.lib`
+    submodule::
+
+        mod = np.lib.mixins
+        for obj in mod.__all__:
+            if obj in np.__all__:
+                continue
+            elif obj in np.lib.__all__:
+                continue
+
+            else:
+                print(obj)
+
+    """
+
+    def find_unexpected_members(mod_name):
+        members = []
+        module = importlib.import_module(mod_name)
+        if hasattr(module, '__all__'):
+            objnames = module.__all__
+        else:
+            objnames = dir(module)
+
+        for objname in objnames:
+            if not objname.startswith('_'):
+                fullobjname = mod_name + '.' + objname
+                if isinstance(getattr(module, objname), types.ModuleType):
+                    if is_unexpected(fullobjname):
+                        if fullobjname not in SKIP_LIST_2:
+                            members.append(fullobjname)
+
+        return members
+
+    unexpected_members = find_unexpected_members("numpy")
+    for modname in PUBLIC_MODULES:
+        unexpected_members.extend(find_unexpected_members(modname))
+
+    if unexpected_members:
+        raise AssertionError("Found unexpected object(s) that look like "
+                             "modules: {}".format(unexpected_members))
+
+
+def test_api_importable():
+    """
+    Check that all submodules listed higher up in this file can be imported
+
+    Note that if a PRIVATE_BUT_PRESENT_MODULES entry goes missing, it may
+    simply need to be removed from the list (deprecation may or may not be
+    needed - apply common sense).
+    """
+    def check_importable(module_name):
+        try:
+            importlib.import_module(module_name)
+        except (ImportError, AttributeError):
+            return False
+
+        return True
+
+    module_names = []
+    for module_name in PUBLIC_MODULES:
+        if not check_importable(module_name):
+            module_names.append(module_name)
+
+    if module_names:
+        raise AssertionError("Modules in the public API that cannot be "
+                             "imported: {}".format(module_names))
+
+    for module_name in PUBLIC_ALIASED_MODULES:
+        try:
+            eval(module_name)
+        except AttributeError:
+            module_names.append(module_name)
+
+    if module_names:
+        raise AssertionError("Modules in the public API that were not "
+                             "found: {}".format(module_names))
+
+    with warnings.catch_warnings(record=True) as w:
+        warnings.filterwarnings('always', category=DeprecationWarning)
+        warnings.filterwarnings('always', category=ImportWarning)
+        for module_name in PRIVATE_BUT_PRESENT_MODULES:
+            if not check_importable(module_name):
+                module_names.append(module_name)
+
+    if module_names:
+        raise AssertionError("Modules that are not really public but looked "
+                             "public and can not be imported: "
+                             "{}".format(module_names))
diff --git a/venv/Lib/site-packages/numpy/tests/test_reloading.py b/venv/Lib/site-packages/numpy/tests/test_reloading.py
new file mode 100644
index 000000000..61ae91b00
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_reloading.py
@@ -0,0 +1,57 @@
+from numpy.testing import assert_raises, assert_, assert_equal
+from numpy.compat import pickle
+
+import sys
+import subprocess
+import textwrap
+from importlib import reload
+
+
+def test_numpy_reloading():
+    # gh-7844. Also check that relevant globals retain their identity.
+    import numpy as np
+    import numpy._globals
+
+    _NoValue = np._NoValue
+    VisibleDeprecationWarning = np.VisibleDeprecationWarning
+    ModuleDeprecationWarning = np.ModuleDeprecationWarning
+
+    reload(np)
+    assert_(_NoValue is np._NoValue)
+    assert_(ModuleDeprecationWarning is np.ModuleDeprecationWarning)
+    assert_(VisibleDeprecationWarning is np.VisibleDeprecationWarning)
+
+    assert_raises(RuntimeError, reload, numpy._globals)
+    reload(np)
+    assert_(_NoValue is np._NoValue)
+    assert_(ModuleDeprecationWarning is np.ModuleDeprecationWarning)
+    assert_(VisibleDeprecationWarning is np.VisibleDeprecationWarning)
+
+def test_novalue():
+    import numpy as np
+    for proto in range(2, pickle.HIGHEST_PROTOCOL + 1):
+        assert_equal(repr(np._NoValue), '<no value>')
+        assert_(pickle.loads(pickle.dumps(np._NoValue,
+                                          protocol=proto)) is np._NoValue)
+
+
+def test_full_reimport():
+    """At the time of writing this, it is *not* truly supported, but
+    apparently enough users rely on it, for it to be an annoying change
+    when it started failing previously.
+    """
+    # Test within a new process, to ensure that we do not mess with the
+    # global state during the test run (could lead to cryptic test failures).
+    # This is generally unsafe, especially, since we also reload the C-modules.
+    code = textwrap.dedent(r"""
+        import sys
+        import numpy as np
+
+        for k in list(sys.modules.keys()):
+            if "numpy" in k:
+                del sys.modules[k]
+
+        import numpy as np
+        """)
+    p = subprocess.run([sys.executable, '-c', code])
+    assert p.returncode == 0
diff --git a/venv/Lib/site-packages/numpy/tests/test_scripts.py b/venv/Lib/site-packages/numpy/tests/test_scripts.py
new file mode 100644
index 000000000..a0f2ba70a
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_scripts.py
@@ -0,0 +1,46 @@
+""" Test scripts
+
+Test that we can run executable scripts that have been installed with numpy.
+"""
+import sys
+import os
+import pytest
+from os.path import join as pathjoin, isfile, dirname
+import subprocess
+
+import numpy as np
+from numpy.testing import assert_equal
+
+is_inplace = isfile(pathjoin(dirname(np.__file__),  '..', 'setup.py'))
+
+
+def find_f2py_commands():
+    if sys.platform == 'win32':
+        exe_dir = dirname(sys.executable)
+        if exe_dir.endswith('Scripts'): # virtualenv
+            return [os.path.join(exe_dir, 'f2py')]
+        else:
+            return [os.path.join(exe_dir, "Scripts", 'f2py')]
+    else:
+        # Three scripts are installed in Unix-like systems:
+        # 'f2py', 'f2py{major}', and 'f2py{major.minor}'. For example,
+        # if installed with python3.7 the scripts would be named
+        # 'f2py', 'f2py3', and 'f2py3.7'.
+        version = sys.version_info
+        major = str(version.major)
+        minor = str(version.minor)
+        return ['f2py', 'f2py' + major, 'f2py' + major + '.' + minor]
+
+
+@pytest.mark.skipif(is_inplace, reason="Cannot test f2py command inplace")
+@pytest.mark.xfail(reason="Test is unreliable")
+@pytest.mark.parametrize('f2py_cmd', find_f2py_commands())
+def test_f2py(f2py_cmd):
+    # test that we can run f2py script
+    stdout = subprocess.check_output([f2py_cmd, '-v'])
+    assert_equal(stdout.strip(), b'2')
+
+
+def test_pep338():
+    stdout = subprocess.check_output([sys.executable, '-mnumpy.f2py', '-v'])
+    assert_equal(stdout.strip(), b'2')
diff --git a/venv/Lib/site-packages/numpy/tests/test_warnings.py b/venv/Lib/site-packages/numpy/tests/test_warnings.py
new file mode 100644
index 000000000..d7a6d880c
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/tests/test_warnings.py
@@ -0,0 +1,74 @@
+"""
+Tests which scan for certain occurrences in the code, they may not find
+all of these occurrences but should catch almost all.
+"""
+import pytest
+
+from pathlib import Path
+import ast
+import tokenize
+import numpy
+
+class ParseCall(ast.NodeVisitor):
+    def __init__(self):
+        self.ls = []
+
+    def visit_Attribute(self, node):
+        ast.NodeVisitor.generic_visit(self, node)
+        self.ls.append(node.attr)
+
+    def visit_Name(self, node):
+        self.ls.append(node.id)
+
+
+class FindFuncs(ast.NodeVisitor):
+    def __init__(self, filename):
+        super().__init__()
+        self.__filename = filename
+
+    def visit_Call(self, node):
+        p = ParseCall()
+        p.visit(node.func)
+        ast.NodeVisitor.generic_visit(self, node)
+
+        if p.ls[-1] == 'simplefilter' or p.ls[-1] == 'filterwarnings':
+            if node.args[0].s == "ignore":
+                raise AssertionError(
+                    "warnings should have an appropriate stacklevel; found in "
+                    "{} on line {}".format(self.__filename, node.lineno))
+
+        if p.ls[-1] == 'warn' and (
+                len(p.ls) == 1 or p.ls[-2] == 'warnings'):
+
+            if "testing/tests/test_warnings.py" == self.__filename:
+                # This file
+                return
+
+            # See if stacklevel exists:
+            if len(node.args) == 3:
+                return
+            args = {kw.arg for kw in node.keywords}
+            if "stacklevel" in args:
+                return
+            raise AssertionError(
+                "warnings should have an appropriate stacklevel; found in "
+                "{} on line {}".format(self.__filename, node.lineno))
+
+
+@pytest.mark.slow
+def test_warning_calls():
+    # combined "ignore" and stacklevel error
+    base = Path(numpy.__file__).parent
+
+    for path in base.rglob("*.py"):
+        if base / "testing" in path.parents:
+            continue
+        if path == base / "__init__.py":
+            continue
+        if path == base / "random" / "__init__.py":
+            continue
+        # use tokenize to auto-detect encoding on systems where no
+        # default encoding is defined (e.g. LANG='C')
+        with tokenize.open(str(path)) as file:
+            tree = ast.parse(file.read())
+            FindFuncs(path).visit(tree)
diff --git a/venv/Lib/site-packages/numpy/version.py b/venv/Lib/site-packages/numpy/version.py
new file mode 100644
index 000000000..3179ff9de
--- /dev/null
+++ b/venv/Lib/site-packages/numpy/version.py
@@ -0,0 +1,12 @@
+
+# THIS FILE IS GENERATED FROM NUMPY SETUP.PY
+#
+# To compare versions robustly, use `numpy.lib.NumpyVersion`
+short_version = '1.19.2'
+version = '1.19.2'
+full_version = '1.19.2'
+git_revision = '68752f786df542d340f25c41a8920d9b2aed66cf'
+release = True
+
+if not release:
+    version = full_version
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/INSTALLER b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/INSTALLER
new file mode 100644
index 000000000..a1b589e38
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/INSTALLER
@@ -0,0 +1 @@
+pip
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE-3RD-PARTY.txt b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE-3RD-PARTY.txt
new file mode 100644
index 000000000..60c34bc06
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE-3RD-PARTY.txt
@@ -0,0 +1,2278 @@
+OpenCV library is redistributed within opencv-python package.
+This license applies to OpenCV binary in the directory cv2/.
+
+By downloading, copying, installing or using the software you agree to this license.
+If you do not agree to this license, do not download, install,
+copy or use the software.
+
+
+                          License Agreement
+               For Open Source Computer Vision Library
+                       (3-clause BSD License)
+
+Copyright (C) 2000-2020, Intel Corporation, all rights reserved.
+Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved.
+Copyright (C) 2009-2016, NVIDIA Corporation, all rights reserved.
+Copyright (C) 2010-2013, Advanced Micro Devices, Inc., all rights reserved.
+Copyright (C) 2015-2016, OpenCV Foundation, all rights reserved.
+Copyright (C) 2015-2016, Itseez Inc., all rights reserved.
+Copyright (C) 2019-2020, Xperience AI, all rights reserved.
+Third party copyrights are property of their respective owners.
+
+Redistribution and use in source and binary forms, with or without modification,
+are permitted provided that the following conditions are met:
+
+  * Redistributions of source code must retain the above copyright notice,
+    this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright notice,
+    this list of conditions and the following disclaimer in the documentation
+    and/or other materials provided with the distribution.
+
+  * Neither the names of the copyright holders nor the names of the contributors
+    may be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+This software is provided by the copyright holders and contributors "as is" and
+any express or implied warranties, including, but not limited to, the implied
+warranties of merchantability and fitness for a particular purpose are disclaimed.
+In no event shall copyright holders or contributors be liable for any direct,
+indirect, incidental, special, exemplary, or consequential damages
+(including, but not limited to, procurement of substitute goods or services;
+loss of use, data, or profits; or business interruption) however caused
+and on any theory of liability, whether in contract, strict liability,
+or tort (including negligence or otherwise) arising in any way out of
+the use of this software, even if advised of the possibility of such damage.
+
+------------------------------------------------------------------------------
+libvpx is redistributed within all opencv-python Linux packages.
+This license applies to libvpx binary in the directory cv2/.
+
+Copyright (c) 2010, The WebM Project authors. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.
+
+  * Neither the name of Google, nor the WebM Project, nor the names
+    of its contributors may be used to endorse or promote products
+    derived from this software without specific prior written
+    permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+FFmpeg is redistributed within all opencv-python packages.
+
+Libbluray, libgnutls, libnettle, libhogweed, libintl, libmp3lame, libp11,
+librtmp, libsoxr and libtasn1 are redistributed within all opencv-python macOS packages.
+
+This license applies to the above library binaries in the directory cv2/.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 2.1, February 1999
+
+ Copyright (C) 1991, 1999 Free Software Foundation, Inc.
+ 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+[This is the first released version of the Lesser GPL.  It also counts
+ as the successor of the GNU Library Public License, version 2, hence
+ the version number 2.1.]
+
+                            Preamble
+
+  The licenses for most software are designed to take away your
+freedom to share and change it.  By contrast, the GNU General Public
+Licenses are intended to guarantee your freedom to share and change
+free software--to make sure the software is free for all its users.
+
+  This license, the Lesser General Public License, applies to some
+specially designated software packages--typically libraries--of the
+Free Software Foundation and other authors who decide to use it.  You
+can use it too, but we suggest you first think carefully about whether
+this license or the ordinary General Public License is the better
+strategy to use in any particular case, based on the explanations below.
+
+  When we speak of free software, we are referring to freedom of use,
+not price.  Our General Public Licenses are designed to make sure that
+you have the freedom to distribute copies of free software (and charge
+for this service if you wish); that you receive source code or can get
+it if you want it; that you can change the software and use pieces of
+it in new free programs; and that you are informed that you can do
+these things.
+
+  To protect your rights, we need to make restrictions that forbid
+distributors to deny you these rights or to ask you to surrender these
+rights.  These restrictions translate to certain responsibilities for
+you if you distribute copies of the library or if you modify it.
+
+  For example, if you distribute copies of the library, whether gratis
+or for a fee, you must give the recipients all the rights that we gave
+you.  You must make sure that they, too, receive or can get the source
+code.  If you link other code with the library, you must provide
+complete object files to the recipients, so that they can relink them
+with the library after making changes to the library and recompiling
+it.  And you must show them these terms so they know their rights.
+
+  We protect your rights with a two-step method: (1) we copyright the
+library, and (2) we offer you this license, which gives you legal
+permission to copy, distribute and/or modify the library.
+
+  To protect each distributor, we want to make it very clear that
+there is no warranty for the free library.  Also, if the library is
+modified by someone else and passed on, the recipients should know
+that what they have is not the original version, so that the original
+author's reputation will not be affected by problems that might be
+introduced by others.
+
+  Finally, software patents pose a constant threat to the existence of
+any free program.  We wish to make sure that a company cannot
+effectively restrict the users of a free program by obtaining a
+restrictive license from a patent holder.  Therefore, we insist that
+any patent license obtained for a version of the library must be
+consistent with the full freedom of use specified in this license.
+
+  Most GNU software, including some libraries, is covered by the
+ordinary GNU General Public License.  This license, the GNU Lesser
+General Public License, applies to certain designated libraries, and
+is quite different from the ordinary General Public License.  We use
+this license for certain libraries in order to permit linking those
+libraries into non-free programs.
+
+  When a program is linked with a library, whether statically or using
+a shared library, the combination of the two is legally speaking a
+combined work, a derivative of the original library.  The ordinary
+General Public License therefore permits such linking only if the
+entire combination fits its criteria of freedom.  The Lesser General
+Public License permits more lax criteria for linking other code with
+the library.
+
+  We call this license the "Lesser" General Public License because it
+does Less to protect the user's freedom than the ordinary General
+Public License.  It also provides other free software developers Less
+of an advantage over competing non-free programs.  These disadvantages
+are the reason we use the ordinary General Public License for many
+libraries.  However, the Lesser license provides advantages in certain
+special circumstances.
+
+  For example, on rare occasions, there may be a special need to
+encourage the widest possible use of a certain library, so that it becomes
+a de-facto standard.  To achieve this, non-free programs must be
+allowed to use the library.  A more frequent case is that a free
+library does the same job as widely used non-free libraries.  In this
+case, there is little to gain by limiting the free library to free
+software only, so we use the Lesser General Public License.
+
+  In other cases, permission to use a particular library in non-free
+programs enables a greater number of people to use a large body of
+free software.  For example, permission to use the GNU C Library in
+non-free programs enables many more people to use the whole GNU
+operating system, as well as its variant, the GNU/Linux operating
+system.
+
+  Although the Lesser General Public License is Less protective of the
+users' freedom, it does ensure that the user of a program that is
+linked with the Library has the freedom and the wherewithal to run
+that program using a modified version of the Library.
+
+  The precise terms and conditions for copying, distribution and
+modification follow.  Pay close attention to the difference between a
+"work based on the library" and a "work that uses the library".  The
+former contains code derived from the library, whereas the latter must
+be combined with the library in order to run.
+
+                  GNU LESSER GENERAL PUBLIC LICENSE
+   TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION
+
+  0. This License Agreement applies to any software library or other
+program which contains a notice placed by the copyright holder or
+other authorized party saying it may be distributed under the terms of
+this Lesser General Public License (also called "this License").
+Each licensee is addressed as "you".
+
+  A "library" means a collection of software functions and/or data
+prepared so as to be conveniently linked with application programs
+(which use some of those functions and data) to form executables.
+
+  The "Library", below, refers to any such software library or work
+which has been distributed under these terms.  A "work based on the
+Library" means either the Library or any derivative work under
+copyright law: that is to say, a work containing the Library or a
+portion of it, either verbatim or with modifications and/or translated
+straightforwardly into another language.  (Hereinafter, translation is
+included without limitation in the term "modification".)
+
+  "Source code" for a work means the preferred form of the work for
+making modifications to it.  For a library, complete source code means
+all the source code for all modules it contains, plus any associated
+interface definition files, plus the scripts used to control compilation
+and installation of the library.
+
+  Activities other than copying, distribution and modification are not
+covered by this License; they are outside its scope.  The act of
+running a program using the Library is not restricted, and output from
+such a program is covered only if its contents constitute a work based
+on the Library (independent of the use of the Library in a tool for
+writing it).  Whether that is true depends on what the Library does
+and what the program that uses the Library does.
+
+  1. You may copy and distribute verbatim copies of the Library's
+complete source code as you receive it, in any medium, provided that
+you conspicuously and appropriately publish on each copy an
+appropriate copyright notice and disclaimer of warranty; keep intact
+all the notices that refer to this License and to the absence of any
+warranty; and distribute a copy of this License along with the
+Library.
+
+  You may charge a fee for the physical act of transferring a copy,
+and you may at your option offer warranty protection in exchange for a
+fee.
+
+  2. You may modify your copy or copies of the Library or any portion
+of it, thus forming a work based on the Library, and copy and
+distribute such modifications or work under the terms of Section 1
+above, provided that you also meet all of these conditions:
+
+    a) The modified work must itself be a software library.
+
+    b) You must cause the files modified to carry prominent notices
+    stating that you changed the files and the date of any change.
+
+    c) You must cause the whole of the work to be licensed at no
+    charge to all third parties under the terms of this License.
+
+    d) If a facility in the modified Library refers to a function or a
+    table of data to be supplied by an application program that uses
+    the facility, other than as an argument passed when the facility
+    is invoked, then you must make a good faith effort to ensure that,
+    in the event an application does not supply such function or
+    table, the facility still operates, and performs whatever part of
+    its purpose remains meaningful.
+
+    (For example, a function in a library to compute square roots has
+    a purpose that is entirely well-defined independent of the
+    application.  Therefore, Subsection 2d requires that any
+    application-supplied function or table used by this function must
+    be optional: if the application does not supply it, the square
+    root function must still compute square roots.)
+
+These requirements apply to the modified work as a whole.  If
+identifiable sections of that work are not derived from the Library,
+and can be reasonably considered independent and separate works in
+themselves, then this License, and its terms, do not apply to those
+sections when you distribute them as separate works.  But when you
+distribute the same sections as part of a whole which is a work based
+on the Library, the distribution of the whole must be on the terms of
+this License, whose permissions for other licensees extend to the
+entire whole, and thus to each and every part regardless of who wrote
+it.
+
+Thus, it is not the intent of this section to claim rights or contest
+your rights to work written entirely by you; rather, the intent is to
+exercise the right to control the distribution of derivative or
+collective works based on the Library.
+
+In addition, mere aggregation of another work not based on the Library
+with the Library (or with a work based on the Library) on a volume of
+a storage or distribution medium does not bring the other work under
+the scope of this License.
+
+  3. You may opt to apply the terms of the ordinary GNU General Public
+License instead of this License to a given copy of the Library.  To do
+this, you must alter all the notices that refer to this License, so
+that they refer to the ordinary GNU General Public License, version 2,
+instead of to this License.  (If a newer version than version 2 of the
+ordinary GNU General Public License has appeared, then you can specify
+that version instead if you wish.)  Do not make any other change in
+these notices.
+
+  Once this change is made in a given copy, it is irreversible for
+that copy, so the ordinary GNU General Public License applies to all
+subsequent copies and derivative works made from that copy.
+
+  This option is useful when you wish to copy part of the code of
+the Library into a program that is not a library.
+
+  4. You may copy and distribute the Library (or a portion or
+derivative of it, under Section 2) in object code or executable form
+under the terms of Sections 1 and 2 above provided that you accompany
+it with the complete corresponding machine-readable source code, which
+must be distributed under the terms of Sections 1 and 2 above on a
+medium customarily used for software interchange.
+
+  If distribution of object code is made by offering access to copy
+from a designated place, then offering equivalent access to copy the
+source code from the same place satisfies the requirement to
+distribute the source code, even though third parties are not
+compelled to copy the source along with the object code.
+
+  5. A program that contains no derivative of any portion of the
+Library, but is designed to work with the Library by being compiled or
+linked with it, is called a "work that uses the Library".  Such a
+work, in isolation, is not a derivative work of the Library, and
+therefore falls outside the scope of this License.
+
+  However, linking a "work that uses the Library" with the Library
+creates an executable that is a derivative of the Library (because it
+contains portions of the Library), rather than a "work that uses the
+library".  The executable is therefore covered by this License.
+Section 6 states terms for distribution of such executables.
+
+  When a "work that uses the Library" uses material from a header file
+that is part of the Library, the object code for the work may be a
+derivative work of the Library even though the source code is not.
+Whether this is true is especially significant if the work can be
+linked without the Library, or if the work is itself a library.  The
+threshold for this to be true is not precisely defined by law.
+
+  If such an object file uses only numerical parameters, data
+structure layouts and accessors, and small macros and small inline
+functions (ten lines or less in length), then the use of the object
+file is unrestricted, regardless of whether it is legally a derivative
+work.  (Executables containing this object code plus portions of the
+Library will still fall under Section 6.)
+
+  Otherwise, if the work is a derivative of the Library, you may
+distribute the object code for the work under the terms of Section 6.
+Any executables containing that work also fall under Section 6,
+whether or not they are linked directly with the Library itself.
+
+  6. As an exception to the Sections above, you may also combine or
+link a "work that uses the Library" with the Library to produce a
+work containing portions of the Library, and distribute that work
+under terms of your choice, provided that the terms permit
+modification of the work for the customer's own use and reverse
+engineering for debugging such modifications.
+
+  You must give prominent notice with each copy of the work that the
+Library is used in it and that the Library and its use are covered by
+this License.  You must supply a copy of this License.  If the work
+during execution displays copyright notices, you must include the
+copyright notice for the Library among them, as well as a reference
+directing the user to the copy of this License.  Also, you must do one
+of these things:
+
+    a) Accompany the work with the complete corresponding
+    machine-readable source code for the Library including whatever
+    changes were used in the work (which must be distributed under
+    Sections 1 and 2 above); and, if the work is an executable linked
+    with the Library, with the complete machine-readable "work that
+    uses the Library", as object code and/or source code, so that the
+    user can modify the Library and then relink to produce a modified
+    executable containing the modified Library.  (It is understood
+    that the user who changes the contents of definitions files in the
+    Library will not necessarily be able to recompile the application
+    to use the modified definitions.)
+
+    b) Use a suitable shared library mechanism for linking with the
+    Library.  A suitable mechanism is one that (1) uses at run time a
+    copy of the library already present on the user's computer system,
+    rather than copying library functions into the executable, and (2)
+    will operate properly with a modified version of the library, if
+    the user installs one, as long as the modified version is
+    interface-compatible with the version that the work was made with.
+
+    c) Accompany the work with a written offer, valid for at
+    least three years, to give the same user the materials
+    specified in Subsection 6a, above, for a charge no more
+    than the cost of performing this distribution.
+
+    d) If distribution of the work is made by offering access to copy
+    from a designated place, offer equivalent access to copy the above
+    specified materials from the same place.
+
+    e) Verify that the user has already received a copy of these
+    materials or that you have already sent this user a copy.
+
+  For an executable, the required form of the "work that uses the
+Library" must include any data and utility programs needed for
+reproducing the executable from it.  However, as a special exception,
+the materials to be distributed need not include anything that is
+normally distributed (in either source or binary form) with the major
+components (compiler, kernel, and so on) of the operating system on
+which the executable runs, unless that component itself accompanies
+the executable.
+
+  It may happen that this requirement contradicts the license
+restrictions of other proprietary libraries that do not normally
+accompany the operating system.  Such a contradiction means you cannot
+use both them and the Library together in an executable that you
+distribute.
+
+  7. You may place library facilities that are a work based on the
+Library side-by-side in a single library together with other library
+facilities not covered by this License, and distribute such a combined
+library, provided that the separate distribution of the work based on
+the Library and of the other library facilities is otherwise
+permitted, and provided that you do these two things:
+
+    a) Accompany the combined library with a copy of the same work
+    based on the Library, uncombined with any other library
+    facilities.  This must be distributed under the terms of the
+    Sections above.
+
+    b) Give prominent notice with the combined library of the fact
+    that part of it is a work based on the Library, and explaining
+    where to find the accompanying uncombined form of the same work.
+
+  8. You may not copy, modify, sublicense, link with, or distribute
+the Library except as expressly provided under this License.  Any
+attempt otherwise to copy, modify, sublicense, link with, or
+distribute the Library is void, and will automatically terminate your
+rights under this License.  However, parties who have received copies,
+or rights, from you under this License will not have their licenses
+terminated so long as such parties remain in full compliance.
+
+  9. You are not required to accept this License, since you have not
+signed it.  However, nothing else grants you permission to modify or
+distribute the Library or its derivative works.  These actions are
+prohibited by law if you do not accept this License.  Therefore, by
+modifying or distributing the Library (or any work based on the
+Library), you indicate your acceptance of this License to do so, and
+all its terms and conditions for copying, distributing or modifying
+the Library or works based on it.
+
+  10. Each time you redistribute the Library (or any work based on the
+Library), the recipient automatically receives a license from the
+original licensor to copy, distribute, link with or modify the Library
+subject to these terms and conditions.  You may not impose any further
+restrictions on the recipients' exercise of the rights granted herein.
+You are not responsible for enforcing compliance by third parties with
+this License.
+
+  11. If, as a consequence of a court judgment or allegation of patent
+infringement or for any other reason (not limited to patent issues),
+conditions are imposed on you (whether by court order, agreement or
+otherwise) that contradict the conditions of this License, they do not
+excuse you from the conditions of this License.  If you cannot
+distribute so as to satisfy simultaneously your obligations under this
+License and any other pertinent obligations, then as a consequence you
+may not distribute the Library at all.  For example, if a patent
+license would not permit royalty-free redistribution of the Library by
+all those who receive copies directly or indirectly through you, then
+the only way you could satisfy both it and this License would be to
+refrain entirely from distribution of the Library.
+
+If any portion of this section is held invalid or unenforceable under any
+particular circumstance, the balance of the section is intended to apply,
+and the section as a whole is intended to apply in other circumstances.
+
+It is not the purpose of this section to induce you to infringe any
+patents or other property right claims or to contest validity of any
+such claims; this section has the sole purpose of protecting the
+integrity of the free software distribution system which is
+implemented by public license practices.  Many people have made
+generous contributions to the wide range of software distributed
+through that system in reliance on consistent application of that
+system; it is up to the author/donor to decide if he or she is willing
+to distribute software through any other system and a licensee cannot
+impose that choice.
+
+This section is intended to make thoroughly clear what is believed to
+be a consequence of the rest of this License.
+
+  12. If the distribution and/or use of the Library is restricted in
+certain countries either by patents or by copyrighted interfaces, the
+original copyright holder who places the Library under this License may add
+an explicit geographical distribution limitation excluding those countries,
+so that distribution is permitted only in or among countries not thus
+excluded.  In such case, this License incorporates the limitation as if
+written in the body of this License.
+
+  13. The Free Software Foundation may publish revised and/or new
+versions of the Lesser General Public License from time to time.
+Such new versions will be similar in spirit to the present version,
+but may differ in detail to address new problems or concerns.
+
+Each version is given a distinguishing version number.  If the Library
+specifies a version number of this License which applies to it and
+"any later version", you have the option of following the terms and
+conditions either of that version or of any later version published by
+the Free Software Foundation.  If the Library does not specify a
+license version number, you may choose any version ever published by
+the Free Software Foundation.
+
+  14. If you wish to incorporate parts of the Library into other free
+programs whose distribution conditions are incompatible with these,
+write to the author to ask for permission.  For software which is
+copyrighted by the Free Software Foundation, write to the Free
+Software Foundation; we sometimes make exceptions for this.  Our
+decision will be guided by the two goals of preserving the free status
+of all derivatives of our free software and of promoting the sharing
+and reuse of software generally.
+
+                            NO WARRANTY
+
+  15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO
+WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW.
+EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR
+OTHER PARTIES PROVIDE THE LIBRARY "AS IS" WITHOUT WARRANTY OF ANY
+KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+PURPOSE.  THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE
+LIBRARY IS WITH YOU.  SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME
+THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION.
+
+  16. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN
+WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY
+AND/OR REDISTRIBUTE THE LIBRARY AS PERMITTED ABOVE, BE LIABLE TO YOU
+FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR
+CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE
+LIBRARY (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING
+RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A
+FAILURE OF THE LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF
+SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH
+DAMAGES.
+
+                     END OF TERMS AND CONDITIONS
+
+------------------------------------------------------------------------------
+Qt 5 is redistributed within non-headless opencv-python Linux and macOS packages.
+libgmp is redistributed within opencv-python macOS packages.
+libidn2 is redistributed within opencv-python macOS packages.
+libunistring is redistributed within opencv-python macOS packages.
+This license applies to the above binaries in the directory cv2/.
+
+                   GNU LESSER GENERAL PUBLIC LICENSE
+                       Version 3, 29 June 2007
+
+ Copyright (C) 2007 Free Software Foundation, Inc. <http://fsf.org/>
+ Everyone is permitted to copy and distribute verbatim copies
+ of this license document, but changing it is not allowed.
+
+  This version of the GNU Lesser General Public License incorporates
+the terms and conditions of version 3 of the GNU General Public
+License, supplemented by the additional permissions listed below.
+
+  0. Additional Definitions.
+
+  As used herein, "this License" refers to version 3 of the GNU Lesser
+General Public License, and the "GNU GPL" refers to version 3 of the GNU
+General Public License.
+
+  "The Library" refers to a covered work governed by this License,
+other than an Application or a Combined Work as defined below.
+
+  An "Application" is any work that makes use of an interface provided
+by the Library, but which is not otherwise based on the Library.
+Defining a subclass of a class defined by the Library is deemed a mode
+of using an interface provided by the Library.
+
+  A "Combined Work" is a work produced by combining or linking an
+Application with the Library.  The particular version of the Library
+with which the Combined Work was made is also called the "Linked
+Version".
+
+  The "Minimal Corresponding Source" for a Combined Work means the
+Corresponding Source for the Combined Work, excluding any source code
+for portions of the Combined Work that, considered in isolation, are
+based on the Application, and not on the Linked Version.
+
+  The "Corresponding Application Code" for a Combined Work means the
+object code and/or source code for the Application, including any data
+and utility programs needed for reproducing the Combined Work from the
+Application, but excluding the System Libraries of the Combined Work.
+
+  1. Exception to Section 3 of the GNU GPL.
+
+  You may convey a covered work under sections 3 and 4 of this License
+without being bound by section 3 of the GNU GPL.
+
+  2. Conveying Modified Versions.
+
+  If you modify a copy of the Library, and, in your modifications, a
+facility refers to a function or data to be supplied by an Application
+that uses the facility (other than as an argument passed when the
+facility is invoked), then you may convey a copy of the modified
+version:
+
+   a) under this License, provided that you make a good faith effort to
+   ensure that, in the event an Application does not supply the
+   function or data, the facility still operates, and performs
+   whatever part of its purpose remains meaningful, or
+
+   b) under the GNU GPL, with none of the additional permissions of
+   this License applicable to that copy.
+
+  3. Object Code Incorporating Material from Library Header Files.
+
+  The object code form of an Application may incorporate material from
+a header file that is part of the Library.  You may convey such object
+code under terms of your choice, provided that, if the incorporated
+material is not limited to numerical parameters, data structure
+layouts and accessors, or small macros, inline functions and templates
+(ten or fewer lines in length), you do both of the following:
+
+   a) Give prominent notice with each copy of the object code that the
+   Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the object code with a copy of the GNU GPL and this license
+   document.
+
+  4. Combined Works.
+
+  You may convey a Combined Work under terms of your choice that,
+taken together, effectively do not restrict modification of the
+portions of the Library contained in the Combined Work and reverse
+engineering for debugging such modifications, if you also do each of
+the following:
+
+   a) Give prominent notice with each copy of the Combined Work that
+   the Library is used in it and that the Library and its use are
+   covered by this License.
+
+   b) Accompany the Combined Work with a copy of the GNU GPL and this license
+   document.
+
+   c) For a Combined Work that displays copyright notices during
+   execution, include the copyright notice for the Library among
+   these notices, as well as a reference directing the user to the
+   copies of the GNU GPL and this license document.
+
+   d) Do one of the following:
+
+       0) Convey the Minimal Corresponding Source under the terms of this
+       License, and the Corresponding Application Code in a form
+       suitable for, and under terms that permit, the user to
+       recombine or relink the Application with a modified version of
+       the Linked Version to produce a modified Combined Work, in the
+       manner specified by section 6 of the GNU GPL for conveying
+       Corresponding Source.
+
+       1) Use a suitable shared library mechanism for linking with the
+       Library.  A suitable mechanism is one that (a) uses at run time
+       a copy of the Library already present on the user's computer
+       system, and (b) will operate properly with a modified version
+       of the Library that is interface-compatible with the Linked
+       Version.
+
+   e) Provide Installation Information, but only if you would otherwise
+   be required to provide such information under section 6 of the
+   GNU GPL, and only to the extent that such information is
+   necessary to install and execute a modified version of the
+   Combined Work produced by recombining or relinking the
+   Application with a modified version of the Linked Version. (If
+   you use option 4d0, the Installation Information must accompany
+   the Minimal Corresponding Source and Corresponding Application
+   Code. If you use option 4d1, you must provide the Installation
+   Information in the manner specified by section 6 of the GNU GPL
+   for conveying Corresponding Source.)
+
+  5. Combined Libraries.
+
+  You may place library facilities that are a work based on the
+Library side by side in a single library together with other library
+facilities that are not Applications and are not covered by this
+License, and convey such a combined library under terms of your
+choice, if you do both of the following:
+
+   a) Accompany the combined library with a copy of the same work based
+   on the Library, uncombined with any other library facilities,
+   conveyed under the terms of this License.
+
+   b) Give prominent notice with the combined library that part of it
+   is a work based on the Library, and explaining where to find the
+   accompanying uncombined form of the same work.
+
+  6. Revised Versions of the GNU Lesser General Public License.
+
+  The Free Software Foundation may publish revised and/or new versions
+of the GNU Lesser General Public License from time to time. Such new
+versions will be similar in spirit to the present version, but may
+differ in detail to address new problems or concerns.
+
+  Each version is given a distinguishing version number. If the
+Library as you received it specifies that a certain numbered version
+of the GNU Lesser General Public License "or any later version"
+applies to it, you have the option of following the terms and
+conditions either of that published version or of any later version
+published by the Free Software Foundation. If the Library as you
+received it does not specify a version number of the GNU Lesser
+General Public License, you may choose any version of the GNU Lesser
+General Public License ever published by the Free Software Foundation.
+
+  If the Library as you received it specifies that a proxy can decide
+whether future versions of the GNU Lesser General Public License shall
+apply, that proxy's public statement of acceptance of any version is
+permanent authorization for you to choose that version for the
+Library.
+
+------------------------------------------------------------------------------
+bzip2 is redistributed within all opencv-python Linux packages.
+This license applies to libbz2 binary in the directory cv2/.
+
+This program, "bzip2", the associated library "libbzip2", and all
+documentation, are copyright (C) 1996-2010 Julian R Seward.  All
+rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+
+2. The origin of this software must not be misrepresented; you must 
+   not claim that you wrote the original software.  If you use this 
+   software in a product, an acknowledgment in the product 
+   documentation would be appreciated but is not required.
+
+3. Altered source versions must be plainly marked as such, and must
+   not be misrepresented as being the original software.
+
+4. The name of the author may not be used to endorse or promote 
+   products derived from this software without specific prior written 
+   permission.
+
+THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS
+OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
+DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE
+GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY,
+WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Julian Seward, jseward@bzip.org
+bzip2/libbzip2 version 1.0.6 of 6 September 2010
+
+------------------------------------------------------------------------------
+libcrypto and libssl are redistributed within all opencv-python Linux and macOS packages.
+libopencore-amrnb and libopencore-amrwb are redistributed within all opencv-python Linux and macOS packages.
+This license applies to above binaries in the directory cv2/.
+
+  LICENSE ISSUES
+  ==============
+
+  The OpenSSL toolkit stays under a double license, i.e. both the conditions of
+  the OpenSSL License and the original SSLeay license apply to the toolkit.
+  See below for the actual license texts.
+
+  OpenSSL License
+  ---------------
+
+/* ====================================================================
+ * Copyright (c) 1998-2019 The OpenSSL Project.  All rights reserved.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ *
+ * 1. Redistributions of source code must retain the above copyright
+ *    notice, this list of conditions and the following disclaimer.
+ *
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in
+ *    the documentation and/or other materials provided with the
+ *    distribution.
+ *
+ * 3. All advertising materials mentioning features or use of this
+ *    software must display the following acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
+ *
+ * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
+ *    endorse or promote products derived from this software without
+ *    prior written permission. For written permission, please contact
+ *    openssl-core@openssl.org.
+ *
+ * 5. Products derived from this software may not be called "OpenSSL"
+ *    nor may "OpenSSL" appear in their names without prior written
+ *    permission of the OpenSSL Project.
+ *
+ * 6. Redistributions of any form whatsoever must retain the following
+ *    acknowledgment:
+ *    "This product includes software developed by the OpenSSL Project
+ *    for use in the OpenSSL Toolkit (http://www.openssl.org/)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
+ * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
+ * PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE OpenSSL PROJECT OR
+ * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+ * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
+ * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+ * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ * ====================================================================
+ *
+ * This product includes cryptographic software written by Eric Young
+ * (eay@cryptsoft.com).  This product includes software written by Tim
+ * Hudson (tjh@cryptsoft.com).
+ *
+ */
+
+ Original SSLeay License
+ -----------------------
+
+/* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com)
+ * All rights reserved.
+ *
+ * This package is an SSL implementation written
+ * by Eric Young (eay@cryptsoft.com).
+ * The implementation was written so as to conform with Netscapes SSL.
+ *
+ * This library is free for commercial and non-commercial use as long as
+ * the following conditions are aheared to.  The following conditions
+ * apply to all code found in this distribution, be it the RC4, RSA,
+ * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
+ * included with this distribution is covered by the same copyright terms
+ * except that the holder is Tim Hudson (tjh@cryptsoft.com).
+ *
+ * Copyright remains Eric Young's, and as such any Copyright notices in
+ * the code are not to be removed.
+ * If this package is used in a product, Eric Young should be given attribution
+ * as the author of the parts of the library used.
+ * This can be in the form of a textual message at program startup or
+ * in documentation (online or textual) provided with the package.
+ *
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 1. Redistributions of source code must retain the copyright
+ *    notice, this list of conditions and the following disclaimer.
+ * 2. Redistributions in binary form must reproduce the above copyright
+ *    notice, this list of conditions and the following disclaimer in the
+ *    documentation and/or other materials provided with the distribution.
+ * 3. All advertising materials mentioning features or use of this software
+ *    must display the following acknowledgement:
+ *    "This product includes cryptographic software written by
+ *     Eric Young (eay@cryptsoft.com)"
+ *    The word 'cryptographic' can be left out if the rouines from the library
+ *    being used are not cryptographic related :-).
+ * 4. If you include any Windows specific code (or a derivative thereof) from
+ *    the apps directory (application code) you must include an acknowledgement:
+ *    "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
+ *
+ * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
+ * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+ * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
+ * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+ * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
+ * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
+ * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
+ * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
+ * SUCH DAMAGE.
+ *
+ * The licence and distribution terms for any publically available version or
+ * derivative of this code cannot be changed.  i.e. this code cannot simply be
+ * copied and put under another distribution licence
+ * [including the GNU Public Licence.]
+ */
+
+------------------------------------------------------------------------------
+libfontconfig is redistributed within all opencv-python macOS packages.
+This license applies to libfontconfig binary in the directory cv2/.
+
+Copyright © 2000,2001,2002,2003,2004,2006,2007 Keith Packard
+Copyright © 2005 Patrick Lam
+Copyright © 2009 Roozbeh Pournader
+Copyright © 2008,2009 Red Hat, Inc.
+Copyright © 2008 Danilo Šegan
+Copyright © 2012 Google, Inc.
+
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation, and that the name of the author(s) not be used in
+advertising or publicity pertaining to distribution of the software without
+specific, written prior permission.  The authors make no
+representations about the suitability of this software for any purpose.  It
+is provided "as is" without express or implied warranty.
+
+THE AUTHOR(S) DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
+EVENT SHALL THE AUTHOR(S) BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
+------------------------------------------------------------------------------
+libfreetype is redistributed within opencv-python Linux and macOS packages.
+This license applies to libfreetype binary in the directory cv2/.
+
+                    The FreeType Project LICENSE
+                    ----------------------------
+
+                            2006-Jan-27
+
+                    Copyright 1996-2002, 2006 by
+          David Turner, Robert Wilhelm, and Werner Lemberg
+
+
+
+Introduction
+============
+
+  The FreeType  Project is distributed in  several archive packages;
+  some of them may contain, in addition to the FreeType font engine,
+  various tools and  contributions which rely on, or  relate to, the
+  FreeType Project.
+
+  This  license applies  to all  files found  in such  packages, and
+  which do not  fall under their own explicit  license.  The license
+  affects  thus  the  FreeType   font  engine,  the  test  programs,
+  documentation and makefiles, at the very least.
+
+  This  license   was  inspired  by  the  BSD,   Artistic,  and  IJG
+  (Independent JPEG  Group) licenses, which  all encourage inclusion
+  and  use of  free  software in  commercial  and freeware  products
+  alike.  As a consequence, its main points are that:
+
+    o We don't promise that this software works. However, we will be
+      interested in any kind of bug reports. (`as is' distribution)
+
+    o You can  use this software for whatever you  want, in parts or
+      full form, without having to pay us. (`royalty-free' usage)
+
+    o You may not pretend that  you wrote this software.  If you use
+      it, or  only parts of it,  in a program,  you must acknowledge
+      somewhere  in  your  documentation  that  you  have  used  the
+      FreeType code. (`credits')
+
+  We  specifically  permit  and  encourage  the  inclusion  of  this
+  software, with  or without modifications,  in commercial products.
+  We  disclaim  all warranties  covering  The  FreeType Project  and
+  assume no liability related to The FreeType Project.
+
+
+  Finally,  many  people  asked  us  for  a  preferred  form  for  a
+  credit/disclaimer to use in compliance with this license.  We thus
+  encourage you to use the following text:
+
+   """
+    Portions of this software are copyright © <year> The FreeType
+    Project (www.freetype.org).  All rights reserved.
+   """
+
+  Please replace <year> with the value from the FreeType version you
+  actually use.
+
+
+Legal Terms
+===========
+
+0. Definitions
+--------------
+
+  Throughout this license,  the terms `package', `FreeType Project',
+  and  `FreeType  archive' refer  to  the  set  of files  originally
+  distributed  by the  authors  (David Turner,  Robert Wilhelm,  and
+  Werner Lemberg) as the `FreeType Project', be they named as alpha,
+  beta or final release.
+
+  `You' refers to  the licensee, or person using  the project, where
+  `using' is a generic term including compiling the project's source
+  code as  well as linking it  to form a  `program' or `executable'.
+  This  program is  referred to  as  `a program  using the  FreeType
+  engine'.
+
+  This  license applies  to all  files distributed  in  the original
+  FreeType  Project,   including  all  source   code,  binaries  and
+  documentation,  unless  otherwise  stated   in  the  file  in  its
+  original, unmodified form as  distributed in the original archive.
+  If you are  unsure whether or not a particular  file is covered by
+  this license, you must contact us to verify this.
+
+  The FreeType  Project is copyright (C) 1996-2000  by David Turner,
+  Robert Wilhelm, and Werner Lemberg.  All rights reserved except as
+  specified below.
+
+1. No Warranty
+--------------
+
+  THE FREETYPE PROJECT  IS PROVIDED `AS IS' WITHOUT  WARRANTY OF ANY
+  KIND, EITHER  EXPRESS OR IMPLIED,  INCLUDING, BUT NOT  LIMITED TO,
+  WARRANTIES  OF  MERCHANTABILITY   AND  FITNESS  FOR  A  PARTICULAR
+  PURPOSE.  IN NO EVENT WILL ANY OF THE AUTHORS OR COPYRIGHT HOLDERS
+  BE LIABLE  FOR ANY DAMAGES CAUSED  BY THE USE OR  THE INABILITY TO
+  USE, OF THE FREETYPE PROJECT.
+
+2. Redistribution
+-----------------
+
+  This  license  grants  a  worldwide, royalty-free,  perpetual  and
+  irrevocable right  and license to use,  execute, perform, compile,
+  display,  copy,   create  derivative  works   of,  distribute  and
+  sublicense the  FreeType Project (in  both source and  object code
+  forms)  and  derivative works  thereof  for  any  purpose; and  to
+  authorize others  to exercise  some or all  of the  rights granted
+  herein, subject to the following conditions:
+
+    o Redistribution of  source code  must retain this  license file
+      (`FTL.TXT') unaltered; any  additions, deletions or changes to
+      the original  files must be clearly  indicated in accompanying
+      documentation.   The  copyright   notices  of  the  unaltered,
+      original  files must  be  preserved in  all  copies of  source
+      files.
+
+    o Redistribution in binary form must provide a  disclaimer  that
+      states  that  the software is based in part of the work of the
+      FreeType Team,  in  the  distribution  documentation.  We also
+      encourage you to put an URL to the FreeType web page  in  your
+      documentation, though this isn't mandatory.
+
+  These conditions  apply to any  software derived from or  based on
+  the FreeType Project,  not just the unmodified files.   If you use
+  our work, you  must acknowledge us.  However, no  fee need be paid
+  to us.
+
+3. Advertising
+--------------
+
+  Neither the  FreeType authors and  contributors nor you  shall use
+  the name of the  other for commercial, advertising, or promotional
+  purposes without specific prior written permission.
+
+  We suggest,  but do not require, that  you use one or  more of the
+  following phrases to refer  to this software in your documentation
+  or advertising  materials: `FreeType Project',  `FreeType Engine',
+  `FreeType library', or `FreeType Distribution'.
+
+  As  you have  not signed  this license,  you are  not  required to
+  accept  it.   However,  as  the FreeType  Project  is  copyrighted
+  material, only  this license, or  another one contracted  with the
+  authors, grants you  the right to use, distribute,  and modify it.
+  Therefore,  by  using,  distributing,  or modifying  the  FreeType
+  Project, you indicate that you understand and accept all the terms
+  of this license.
+
+4. Contacts
+-----------
+
+  There are two mailing lists related to FreeType:
+
+    o freetype@nongnu.org
+
+      Discusses general use and applications of FreeType, as well as
+      future and  wanted additions to the  library and distribution.
+      If  you are looking  for support,  start in  this list  if you
+      haven't found anything to help you in the documentation.
+
+    o freetype-devel@nongnu.org
+
+      Discusses bugs,  as well  as engine internals,  design issues,
+      specific licenses, porting, etc.
+
+  Our home page can be found at
+
+    https://www.freetype.org
+
+------------------------------------------------------------------------------
+libpng is redistributed within all opencv-python Linux and macOS packages.
+This license applies to libpng binary in the directory cv2/.
+
+PNG Reference Library License version 2
+---------------------------------------
+
+ * Copyright (c) 1995-2019 The PNG Reference Library Authors.
+ * Copyright (c) 2018-2019 Cosmin Truta.
+ * Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson.
+ * Copyright (c) 1996-1997 Andreas Dilger.
+ * Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
+
+The software is supplied "as is", without warranty of any kind,
+express or implied, including, without limitation, the warranties
+of merchantability, fitness for a particular purpose, title, and
+non-infringement.  In no event shall the Copyright owners, or
+anyone distributing the software, be liable for any damages or
+other liability, whether in contract, tort or otherwise, arising
+from, out of, or in connection with the software, or the use or
+other dealings in the software, even if advised of the possibility
+of such damage.
+
+Permission is hereby granted to use, copy, modify, and distribute
+this software, or portions hereof, for any purpose, without fee,
+subject to the following restrictions:
+
+ 1. The origin of this software must not be misrepresented; you
+    must not claim that you wrote the original software.  If you
+    use this software in a product, an acknowledgment in the product
+    documentation would be appreciated, but is not required.
+
+ 2. Altered source versions must be plainly marked as such, and must
+    not be misrepresented as being the original software.
+
+ 3. This Copyright notice may not be removed or altered from any
+    source or altered source distribution.
+
+
+PNG Reference Library License version 1 (for libpng 0.5 through 1.6.35)
+-----------------------------------------------------------------------
+
+libpng versions 1.0.7, July 1, 2000, through 1.6.35, July 15, 2018 are
+Copyright (c) 2000-2002, 2004, 2006-2018 Glenn Randers-Pehrson, are
+derived from libpng-1.0.6, and are distributed according to the same
+disclaimer and license as libpng-1.0.6 with the following individuals
+added to the list of Contributing Authors:
+
+    Simon-Pierre Cadieux
+    Eric S. Raymond
+    Mans Rullgard
+    Cosmin Truta
+    Gilles Vollant
+    James Yu
+    Mandar Sahastrabuddhe
+    Google Inc.
+    Vadim Barkov
+
+and with the following additions to the disclaimer:
+
+    There is no warranty against interference with your enjoyment of
+    the library or against infringement.  There is no warranty that our
+    efforts or the library will fulfill any of your particular purposes
+    or needs.  This library is provided with all faults, and the entire
+    risk of satisfactory quality, performance, accuracy, and effort is
+    with the user.
+
+Some files in the "contrib" directory and some configure-generated
+files that are distributed with libpng have other copyright owners, and
+are released under other open source licenses.
+
+libpng versions 0.97, January 1998, through 1.0.6, March 20, 2000, are
+Copyright (c) 1998-2000 Glenn Randers-Pehrson, are derived from
+libpng-0.96, and are distributed according to the same disclaimer and
+license as libpng-0.96, with the following individuals added to the
+list of Contributing Authors:
+
+    Tom Lane
+    Glenn Randers-Pehrson
+    Willem van Schaik
+
+libpng versions 0.89, June 1996, through 0.96, May 1997, are
+Copyright (c) 1996-1997 Andreas Dilger, are derived from libpng-0.88,
+and are distributed according to the same disclaimer and license as
+libpng-0.88, with the following individuals added to the list of
+Contributing Authors:
+
+    John Bowler
+    Kevin Bracey
+    Sam Bushell
+    Magnus Holmgren
+    Greg Roelofs
+    Tom Tanner
+
+Some files in the "scripts" directory have other copyright owners,
+but are released under this license.
+
+libpng versions 0.5, May 1995, through 0.88, January 1996, are
+Copyright (c) 1995-1996 Guy Eric Schalnat, Group 42, Inc.
+
+For the purposes of this copyright and license, "Contributing Authors"
+is defined as the following set of individuals:
+
+    Andreas Dilger
+    Dave Martindale
+    Guy Eric Schalnat
+    Paul Schmidt
+    Tim Wegner
+
+The PNG Reference Library is supplied "AS IS".  The Contributing
+Authors and Group 42, Inc. disclaim all warranties, expressed or
+implied, including, without limitation, the warranties of
+merchantability and of fitness for any purpose.  The Contributing
+Authors and Group 42, Inc. assume no liability for direct, indirect,
+incidental, special, exemplary, or consequential damages, which may
+result from the use of the PNG Reference Library, even if advised of
+the possibility of such damage.
+
+Permission is hereby granted to use, copy, modify, and distribute this
+source code, or portions hereof, for any purpose, without fee, subject
+to the following restrictions:
+
+ 1. The origin of this source code must not be misrepresented.
+
+ 2. Altered versions must be plainly marked as such and must not
+    be misrepresented as being the original source.
+
+ 3. This Copyright notice may not be removed or altered from any
+    source or altered source distribution.
+
+The Contributing Authors and Group 42, Inc. specifically permit,
+without fee, and encourage the use of this source code as a component
+to supporting the PNG file format in commercial products.  If you use
+this source code in a product, acknowledgment is not required but would
+be appreciated.
+
+------------------------------------------------------------------------------
+libz is redistributed within all opencv-python Linux packages.
+This license applies to libz binary in the directory cv2/.
+
+  Copyright (C) 1995-2017 Jean-loup Gailly and Mark Adler
+
+  This software is provided 'as-is', without any express or implied
+  warranty.  In no event will the authors be held liable for any damages
+  arising from the use of this software.
+
+  Permission is granted to anyone to use this software for any purpose,
+  including commercial applications, and to alter it and redistribute it
+  freely, subject to the following restrictions:
+
+  1. The origin of this software must not be misrepresented; you must not
+     claim that you wrote the original software. If you use this software
+     in a product, an acknowledgment in the product documentation would be
+     appreciated but is not required.
+  2. Altered source versions must be plainly marked as such, and must not be
+     misrepresented as being the original software.
+  3. This notice may not be removed or altered from any source distribution.
+
+  Jean-loup Gailly        Mark Adler
+  jloup@gzip.org          madler@alumni.caltech.edu
+
+------------------------------------------------------------------------------
+libdav1d is redistributed within opencv-python macOS packages.
+This license applies to libdav1d binary in the directory cv2/.
+
+Copyright © 2018-2019, VideoLAN and dav1d authors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+1. Redistributions of source code must retain the above copyright notice, this
+   list of conditions and the following disclaimer.
+
+2. Redistributions in binary form must reproduce the above copyright notice,
+   this list of conditions and the following disclaimer in the documentation
+   and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
+ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
+WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR
+ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+(INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
+LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
+ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libffi is redistributed within opencv-python macOS packages.
+This license applies to libffi binary in the directory cv2/.
+
+libffi - Copyright (c) 1996-2020  Anthony Green, Red Hat, Inc and others.
+See source files for details.
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+``Software''), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED ``AS IS'', WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+------------------------------------------------------------------------------
+libogg is redistributed within opencv-python macOS packages.
+This license applies to libogg binary in the directory cv2/.
+
+Copyright (c) 2002, Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libopenjp2 is redistributed within opencv-python macOS packages.
+This license applies to libopenjp2 binary in the directory cv2/.
+
+The copyright in this software is being made available under the 2-clauses 
+BSD License, included below. This software may be subject to other third 
+party and contributor rights, including patent rights, and no such rights
+are granted under this license.
+
+Copyright (c) 2002-2014, Universite catholique de Louvain (UCL), Belgium
+Copyright (c) 2002-2014, Professor Benoit Macq
+Copyright (c) 2003-2014, Antonin Descampe
+Copyright (c) 2003-2009, Francois-Olivier Devaux
+Copyright (c) 2005, Herve Drolon, FreeImage Team
+Copyright (c) 2002-2003, Yannick Verschueren
+Copyright (c) 2001-2003, David Janssens
+Copyright (c) 2011-2012, Centre National d'Etudes Spatiales (CNES), France 
+Copyright (c) 2012, CS Systemes d'Information, France
+
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+1. Redistributions of source code must retain the above copyright
+   notice, this list of conditions and the following disclaimer.
+2. Redistributions in binary form must reproduce the above copyright
+   notice, this list of conditions and the following disclaimer in the
+   documentation and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS `AS IS'
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
+ARE DISCLAIMED.  IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE
+LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
+CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
+SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
+INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
+CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
+POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libopus is redistributed within opencv-python macOS packages.
+This license applies to libopus binary in the directory cv2/.
+
+Copyright 2001-2011 Xiph.Org, Skype Limited, Octasic,
+                    Jean-Marc Valin, Timothy B. Terriberry,
+                    CSIRO, Gregory Maxwell, Mark Borgerding,
+                    Erik de Castro Lopo
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of Internet Society, IETF or IETF Trust, nor the
+names of specific contributors, may be used to endorse or promote
+products derived from this software without specific prior written
+permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+Opus is subject to the royalty-free patent licenses which are
+specified at:
+
+Xiph.Org Foundation:
+https://datatracker.ietf.org/ipr/1524/
+
+Microsoft Corporation:
+https://datatracker.ietf.org/ipr/1914/
+
+Broadcom Corporation:
+https://datatracker.ietf.org/ipr/1526/
+
+------------------------------------------------------------------------------
+librav1e is redistributed within opencv-python macOS packages.
+This license applies to librav1e binary in the directory cv2/.
+
+BSD 2-Clause License
+
+Copyright (c) 2017-2020, the rav1e contributors
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are met:
+
+* Redistributions of source code must retain the above copyright notice, this
+  list of conditions and the following disclaimer.
+
+* Redistributions in binary form must reproduce the above copyright notice,
+  this list of conditions and the following disclaimer in the documentation
+  and/or other materials provided with the distribution.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
+AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
+IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
+DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE
+FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
+DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
+CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,
+OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libsnappy is redistributed within opencv-python macOS packages.
+This license applies to libsnappy binary in the directory cv2/.
+
+Copyright 2011, Google Inc.
+All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+    * Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+    * Redistributions in binary form must reproduce the above
+copyright notice, this list of conditions and the following disclaimer
+in the documentation and/or other materials provided with the
+distribution.
+    * Neither the name of Google Inc. nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libspeex is redistributed within opencv-python macOS packages.
+This license applies to libspeex binary in the directory cv2/.
+
+Copyright 2002-2008   Xiph.org Foundation
+Copyright 2002-2008   Jean-Marc Valin
+Copyright 2005-2007 Analog Devices Inc.
+Copyright 2005-2008 Commonwealth Scientific and Industrial Research 
+                        Organisation (CSIRO)
+Copyright 1993, 2002, 2006 David Rowe
+Copyright 2003    EpicGames
+Copyright 1992-1994 Jutta Degener, Carsten Bormann
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION OR
+CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
+EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
+PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
+PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
+LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
+NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
+SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libsrt is redistributed within opencv-python macOS packages.
+This license applies to libsrt binary in the directory cv2/.
+
+/*
+ *  
+ * Copyright (c) 2001-2017 Cisco Systems, Inc.
+ * All rights reserved.
+ * 
+ * Redistribution and use in source and binary forms, with or without
+ * modification, are permitted provided that the following conditions
+ * are met:
+ * 
+ *   Redistributions of source code must retain the above copyright
+ *   notice, this list of conditions and the following disclaimer.
+ * 
+ *   Redistributions in binary form must reproduce the above
+ *   copyright notice, this list of conditions and the following
+ *   disclaimer in the documentation and/or other materials provided
+ *   with the distribution.
+ * 
+ *   Neither the name of the Cisco Systems, Inc. nor the names of its
+ *   contributors may be used to endorse or promote products derived
+ *   from this software without specific prior written permission.
+ * 
+ * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+ * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+ * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
+ * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
+ * COPYRIGHT HOLDERS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
+ * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
+ * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
+ * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
+ * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
+ * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
+ * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
+ * OF THE POSSIBILITY OF SUCH DAMAGE.
+ *
+ */
+
+
+ Mozilla Public License Version 2.0
+==================================
+
+1. Definitions
+--------------
+
+1.1. "Contributor"
+    means each individual or legal entity that creates, contributes to
+    the creation of, or owns Covered Software.
+
+1.2. "Contributor Version"
+    means the combination of the Contributions of others (if any) used
+    by a Contributor and that particular Contributor's Contribution.
+
+1.3. "Contribution"
+    means Covered Software of a particular Contributor.
+
+1.4. "Covered Software"
+    means Source Code Form to which the initial Contributor has attached
+    the notice in Exhibit A, the Executable Form of such Source Code
+    Form, and Modifications of such Source Code Form, in each case
+    including portions thereof.
+
+1.5. "Incompatible With Secondary Licenses"
+    means
+
+    (a) that the initial Contributor has attached the notice described
+        in Exhibit B to the Covered Software; or
+
+    (b) that the Covered Software was made available under the terms of
+        version 1.1 or earlier of the License, but not also under the
+        terms of a Secondary License.
+
+1.6. "Executable Form"
+    means any form of the work other than Source Code Form.
+
+1.7. "Larger Work"
+    means a work that combines Covered Software with other material, in 
+    a separate file or files, that is not Covered Software.
+
+1.8. "License"
+    means this document.
+
+1.9. "Licensable"
+    means having the right to grant, to the maximum extent possible,
+    whether at the time of the initial grant or subsequently, any and
+    all of the rights conveyed by this License.
+
+1.10. "Modifications"
+    means any of the following:
+
+    (a) any file in Source Code Form that results from an addition to,
+        deletion from, or modification of the contents of Covered
+        Software; or
+
+    (b) any new file in Source Code Form that contains any Covered
+        Software.
+
+1.11. "Patent Claims" of a Contributor
+    means any patent claim(s), including without limitation, method,
+    process, and apparatus claims, in any patent Licensable by such
+    Contributor that would be infringed, but for the grant of the
+    License, by the making, using, selling, offering for sale, having
+    made, import, or transfer of either its Contributions or its
+    Contributor Version.
+
+1.12. "Secondary License"
+    means either the GNU General Public License, Version 2.0, the GNU
+    Lesser General Public License, Version 2.1, the GNU Affero General
+    Public License, Version 3.0, or any later versions of those
+    licenses.
+
+1.13. "Source Code Form"
+    means the form of the work preferred for making modifications.
+
+1.14. "You" (or "Your")
+    means an individual or a legal entity exercising rights under this
+    License. For legal entities, "You" includes any entity that
+    controls, is controlled by, or is under common control with You. For
+    purposes of this definition, "control" means (a) the power, direct
+    or indirect, to cause the direction or management of such entity,
+    whether by contract or otherwise, or (b) ownership of more than
+    fifty percent (50%) of the outstanding shares or beneficial
+    ownership of such entity.
+
+2. License Grants and Conditions
+--------------------------------
+
+2.1. Grants
+
+Each Contributor hereby grants You a world-wide, royalty-free,
+non-exclusive license:
+
+(a) under intellectual property rights (other than patent or trademark)
+    Licensable by such Contributor to use, reproduce, make available,
+    modify, display, perform, distribute, and otherwise exploit its
+    Contributions, either on an unmodified basis, with Modifications, or
+    as part of a Larger Work; and
+
+(b) under Patent Claims of such Contributor to make, use, sell, offer
+    for sale, have made, import, and otherwise transfer either its
+    Contributions or its Contributor Version.
+
+2.2. Effective Date
+
+The licenses granted in Section 2.1 with respect to any Contribution
+become effective for each Contribution on the date the Contributor first
+distributes such Contribution.
+
+2.3. Limitations on Grant Scope
+
+The licenses granted in this Section 2 are the only rights granted under
+this License. No additional rights or licenses will be implied from the
+distribution or licensing of Covered Software under this License.
+Notwithstanding Section 2.1(b) above, no patent license is granted by a
+Contributor:
+
+(a) for any code that a Contributor has removed from Covered Software;
+    or
+
+(b) for infringements caused by: (i) Your and any other third party's
+    modifications of Covered Software, or (ii) the combination of its
+    Contributions with other software (except as part of its Contributor
+    Version); or
+
+(c) under Patent Claims infringed by Covered Software in the absence of
+    its Contributions.
+
+This License does not grant any rights in the trademarks, service marks,
+or logos of any Contributor (except as may be necessary to comply with
+the notice requirements in Section 3.4).
+
+2.4. Subsequent Licenses
+
+No Contributor makes additional grants as a result of Your choice to
+distribute the Covered Software under a subsequent version of this
+License (see Section 10.2) or under the terms of a Secondary License (if
+permitted under the terms of Section 3.3).
+
+2.5. Representation
+
+Each Contributor represents that the Contributor believes its
+Contributions are its original creation(s) or it has sufficient rights
+to grant the rights to its Contributions conveyed by this License.
+
+2.6. Fair Use
+
+This License is not intended to limit any rights You have under
+applicable copyright doctrines of fair use, fair dealing, or other
+equivalents.
+
+2.7. Conditions
+
+Sections 3.1, 3.2, 3.3, and 3.4 are conditions of the licenses granted
+in Section 2.1.
+
+3. Responsibilities
+-------------------
+
+3.1. Distribution of Source Form
+
+All distribution of Covered Software in Source Code Form, including any
+Modifications that You create or to which You contribute, must be under
+the terms of this License. You must inform recipients that the Source
+Code Form of the Covered Software is governed by the terms of this
+License, and how they can obtain a copy of this License. You may not
+attempt to alter or restrict the recipients' rights in the Source Code
+Form.
+
+3.2. Distribution of Executable Form
+
+If You distribute Covered Software in Executable Form then:
+
+(a) such Covered Software must also be made available in Source Code
+    Form, as described in Section 3.1, and You must inform recipients of
+    the Executable Form how they can obtain a copy of such Source Code
+    Form by reasonable means in a timely manner, at a charge no more
+    than the cost of distribution to the recipient; and
+
+(b) You may distribute such Executable Form under the terms of this
+    License, or sublicense it under different terms, provided that the
+    license for the Executable Form does not attempt to limit or alter
+    the recipients' rights in the Source Code Form under this License.
+
+3.3. Distribution of a Larger Work
+
+You may create and distribute a Larger Work under terms of Your choice,
+provided that You also comply with the requirements of this License for
+the Covered Software. If the Larger Work is a combination of Covered
+Software with a work governed by one or more Secondary Licenses, and the
+Covered Software is not Incompatible With Secondary Licenses, this
+License permits You to additionally distribute such Covered Software
+under the terms of such Secondary License(s), so that the recipient of
+the Larger Work may, at their option, further distribute the Covered
+Software under the terms of either this License or such Secondary
+License(s).
+
+3.4. Notices
+
+You may not remove or alter the substance of any license notices
+(including copyright notices, patent notices, disclaimers of warranty,
+or limitations of liability) contained within the Source Code Form of
+the Covered Software, except that You may alter any license notices to
+the extent required to remedy known factual inaccuracies.
+
+3.5. Application of Additional Terms
+
+You may choose to offer, and to charge a fee for, warranty, support,
+indemnity or liability obligations to one or more recipients of Covered
+Software. However, You may do so only on Your own behalf, and not on
+behalf of any Contributor. You must make it absolutely clear that any
+such warranty, support, indemnity, or liability obligation is offered by
+You alone, and You hereby agree to indemnify every Contributor for any
+liability incurred by such Contributor as a result of warranty, support,
+indemnity or liability terms You offer. You may include additional
+disclaimers of warranty and limitations of liability specific to any
+jurisdiction.
+
+4. Inability to Comply Due to Statute or Regulation
+---------------------------------------------------
+
+If it is impossible for You to comply with any of the terms of this
+License with respect to some or all of the Covered Software due to
+statute, judicial order, or regulation then You must: (a) comply with
+the terms of this License to the maximum extent possible; and (b)
+describe the limitations and the code they affect. Such description must
+be placed in a text file included with all distributions of the Covered
+Software under this License. Except to the extent prohibited by statute
+or regulation, such description must be sufficiently detailed for a
+recipient of ordinary skill to be able to understand it.
+
+5. Termination
+--------------
+
+5.1. The rights granted under this License will terminate automatically
+if You fail to comply with any of its terms. However, if You become
+compliant, then the rights granted under this License from a particular
+Contributor are reinstated (a) provisionally, unless and until such
+Contributor explicitly and finally terminates Your grants, and (b) on an
+ongoing basis, if such Contributor fails to notify You of the
+non-compliance by some reasonable means prior to 60 days after You have
+come back into compliance. Moreover, Your grants from a particular
+Contributor are reinstated on an ongoing basis if such Contributor
+notifies You of the non-compliance by some reasonable means, this is the
+first time You have received notice of non-compliance with this License
+from such Contributor, and You become compliant prior to 30 days after
+Your receipt of the notice.
+
+5.2. If You initiate litigation against any entity by asserting a patent
+infringement claim (excluding declaratory judgment actions,
+counter-claims, and cross-claims) alleging that a Contributor Version
+directly or indirectly infringes any patent, then the rights granted to
+You by any and all Contributors for the Covered Software under Section
+2.1 of this License shall terminate.
+
+5.3. In the event of termination under Sections 5.1 or 5.2 above, all
+end user license agreements (excluding distributors and resellers) which
+have been validly granted by You or Your distributors under this License
+prior to termination shall survive termination.
+
+************************************************************************
+*                                                                      *
+*  6. Disclaimer of Warranty                                           *
+*  -------------------------                                           *
+*                                                                      *
+*  Covered Software is provided under this License on an "as is"       *
+*  basis, without warranty of any kind, either expressed, implied, or  *
+*  statutory, including, without limitation, warranties that the       *
+*  Covered Software is free of defects, merchantable, fit for a        *
+*  particular purpose or non-infringing. The entire risk as to the     *
+*  quality and performance of the Covered Software is with You.        *
+*  Should any Covered Software prove defective in any respect, You     *
+*  (not any Contributor) assume the cost of any necessary servicing,   *
+*  repair, or correction. This disclaimer of warranty constitutes an   *
+*  essential part of this License. No use of any Covered Software is   *
+*  authorized under this License except under this disclaimer.         *
+*                                                                      *
+************************************************************************
+
+************************************************************************
+*                                                                      *
+*  7. Limitation of Liability                                          *
+*  --------------------------                                          *
+*                                                                      *
+*  Under no circumstances and under no legal theory, whether tort      *
+*  (including negligence), contract, or otherwise, shall any           *
+*  Contributor, or anyone who distributes Covered Software as          *
+*  permitted above, be liable to You for any direct, indirect,         *
+*  special, incidental, or consequential damages of any character      *
+*  including, without limitation, damages for lost profits, loss of    *
+*  goodwill, work stoppage, computer failure or malfunction, or any    *
+*  and all other commercial damages or losses, even if such party      *
+*  shall have been informed of the possibility of such damages. This   *
+*  limitation of liability shall not apply to liability for death or   *
+*  personal injury resulting from such party's negligence to the       *
+*  extent applicable law prohibits such limitation. Some               *
+*  jurisdictions do not allow the exclusion or limitation of           *
+*  incidental or consequential damages, so this exclusion and          *
+*  limitation may not apply to You.                                    *
+*                                                                      *
+************************************************************************
+
+8. Litigation
+-------------
+
+Any litigation relating to this License may be brought only in the
+courts of a jurisdiction where the defendant maintains its principal
+place of business and such litigation shall be governed by laws of that
+jurisdiction, without reference to its conflict-of-law provisions.
+Nothing in this Section shall prevent a party's ability to bring
+cross-claims or counter-claims.
+
+9. Miscellaneous
+----------------
+
+This License represents the complete agreement concerning the subject
+matter hereof. If any provision of this License is held to be
+unenforceable, such provision shall be reformed only to the extent
+necessary to make it enforceable. Any law or regulation which provides
+that the language of a contract shall be construed against the drafter
+shall not be used to construe this License against a Contributor.
+
+10. Versions of the License
+---------------------------
+
+10.1. New Versions
+
+Mozilla Foundation is the license steward. Except as provided in Section
+10.3, no one other than the license steward has the right to modify or
+publish new versions of this License. Each version will be given a
+distinguishing version number.
+
+10.2. Effect of New Versions
+
+You may distribute the Covered Software under the terms of the version
+of the License under which You originally received the Covered Software,
+or under the terms of any subsequent version published by the license
+steward.
+
+10.3. Modified Versions
+
+If you create software not governed by this License, and you want to
+create a new license for such software, you may create and use a
+modified version of this License if you rename the license and remove
+any references to the name of the license steward (except to note that
+such modified license differs from this License).
+
+10.4. Distributing Source Code Form that is Incompatible With Secondary
+Licenses
+
+If You choose to distribute Source Code Form that is Incompatible With
+Secondary Licenses under the terms of this version of the License, the
+notice described in Exhibit B of this License must be attached.
+
+Exhibit A - Source Code Form License Notice
+-------------------------------------------
+
+  This Source Code Form is subject to the terms of the Mozilla Public
+  License, v. 2.0. If a copy of the MPL was not distributed with this
+  file, You can obtain one at http://mozilla.org/MPL/2.0/.
+
+If it is not possible or desirable to put the notice in a particular
+file, then You may include the notice in a location (such as a LICENSE
+file in a relevant directory) where a recipient would be likely to look
+for such a notice.
+
+You may add additional accurate notices of copyright ownership.
+
+Exhibit B - "Incompatible With Secondary Licenses" Notice
+---------------------------------------------------------
+
+  This Source Code Form is "Incompatible With Secondary Licenses", as
+  defined by the Mozilla Public License, v. 2.0.
+
+------------------------------------------------------------------------------
+libtheoradec and libtheoraenc are redistributed within opencv-python macOS packages.
+This license applies to libtheoradec and libtheoraenc binaries in the directory cv2/.
+
+  Copyright (C) 2002-2009 Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libwebp and libwebpmux are redistributed within opencv-python macOS packages.
+This license applies to libwebp  and libwebpmux binaries in the directory cv2/.
+
+Copyright (c) 2010, Google Inc. All rights reserved.
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions are
+met:
+
+  * Redistributions of source code must retain the above copyright
+    notice, this list of conditions and the following disclaimer.
+
+  * Redistributions in binary form must reproduce the above copyright
+    notice, this list of conditions and the following disclaimer in
+    the documentation and/or other materials provided with the
+    distribution.
+
+  * Neither the name of Google nor the names of its contributors may
+    be used to endorse or promote products derived from this software
+    without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+"AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
+HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+libvorbis and libvorbisenc are redistributed within opencv-python macOS packages.
+This license applies to libvorbis and libvorbisenc binaries in the directory cv2/.
+
+Copyright (c) 2002-2020 Xiph.org Foundation
+
+Redistribution and use in source and binary forms, with or without
+modification, are permitted provided that the following conditions
+are met:
+
+- Redistributions of source code must retain the above copyright
+notice, this list of conditions and the following disclaimer.
+
+- Redistributions in binary form must reproduce the above copyright
+notice, this list of conditions and the following disclaimer in the
+documentation and/or other materials provided with the distribution.
+
+- Neither the name of the Xiph.org Foundation nor the names of its
+contributors may be used to endorse or promote products derived from
+this software without specific prior written permission.
+
+THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
+``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
+LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
+A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE FOUNDATION
+OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
+SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
+LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
+DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
+THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
+(INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
+OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
+
+------------------------------------------------------------------------------
+Libxcb utility libraries are redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb related binaries in the directory cv2/.
+
+Copyright (C) 2001-2006 Bart Massey, Jamey Sharp, and Josh Triplett.
+All Rights Reserved.
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated
+documentation files (the "Software"), to deal in the
+Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute,
+sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so,
+subject to the following conditions:
+
+The above copyright notice and this permission notice shall
+be included in all copies or substantial portions of the
+Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY
+KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE
+WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR
+PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS
+BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
+IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors
+or their institutions shall not be used in advertising or
+otherwise to promote the sale, use or other dealings in this
+Software without prior written authorization from the
+authors.
+
+------------------------------------------------------------------------------
+Libxcb-image is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-image binary in the directory cv2/.
+
+Copyright © 2007-2008 Bart Massey <bart@cs.pdx.edu>
+Copyright © 2008 Julien Danjou <julien@danjou.info>
+Copyright © 2008 Keith Packard <keithp@keithp.com>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use, copy,
+modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or
+their institutions shall not be used in advertising or otherwise to
+promote the sale, use or other dealings in this Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-util is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-util binary in the directory cv2/.
+
+Copyright © 2008 Bart Massey <bart@cs.pdx.edu>
+Copyright © 2008 Ian Osgood <iano@quirkster.com>
+Copyright © 2008 Jamey Sharp <jamey@minilop.net>
+Copyright © 2008 Josh Triplett <josh@freedesktop.org>
+Copyright © 2008-2009 Julien Danjou <julien@danjou.info>
+
+Permission is hereby granted, free of charge, to any person
+obtaining a copy of this software and associated documentation
+files (the "Software"), to deal in the Software without
+restriction, including without limitation the rights to use, copy,
+modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
+CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
+CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or
+their institutions shall not be used in advertising or otherwise to
+promote the sale, use or other dealings in this Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-render-util is redistributed within opencv-python non-headless Linux packages.
+This license applies to libxcb-render-util binary in the directory cv2/.
+
+Copyright © 2000 Keith Packard
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation, and that the name of Keith Packard not be used in
+advertising or publicity pertaining to distribution of the software without
+specific, written prior permission.  Keith Packard makes no
+representations about the suitability of this software for any purpose.  It
+is provided "as is" without express or implied warranty.
+
+KEITH PACKARD DISCLAIMS ALL WARRANTIES WITH REGARD TO THIS SOFTWARE,
+INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS, IN NO
+EVENT SHALL KEITH PACKARD BE LIABLE FOR ANY SPECIAL, INDIRECT OR
+CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE,
+DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR OTHER
+TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+
+Copyright © 2006 Jamey Sharp.
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or their
+institutions shall not be used in advertising or otherwise to promote the
+sale, use or other dealings in this Software without prior written
+authorization from the authors.
+
+Copyright © 2006 Ian Osgood
+
+Permission is hereby granted, free of charge, to any person obtaining a
+copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation
+the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the
+Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
+ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the names of the authors or their
+institutions shall not be used in advertising or otherwise to promote the
+sale, use or other dealings in this Software without prior written
+authorization from the authors.
+
+------------------------------------------------------------------------------
+Libxcb-icccm is redistributed within opencv-python non-headless Linux packages.
+This license applies to Libxcb-icccm binary in the directory cv2/.
+
+Copyright © 2008-2011 Arnaud Fontaine <arnau@debian.org>
+Copyright © 2007-2008 Vincent Torri <vtorri@univ-evry.fr>
+
+Permission  is  hereby  granted,  free  of charge,  to  any  person
+obtaining  a copy  of  this software  and associated  documentation
+files   (the  "Software"),   to  deal   in  the   Software  without
+restriction, including without limitation  the rights to use, copy,
+modify, merge, publish,  distribute, sublicense, and/or sell copies
+of  the Software, and  to permit  persons to  whom the  Software is
+furnished to do so, subject to the following conditions:
+
+The  above copyright  notice and  this permission  notice  shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE  IS PROVIDED  "AS IS", WITHOUT  WARRANTY OF  ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT  NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY,   FITNESS    FOR   A   PARTICULAR    PURPOSE   AND
+NONINFRINGEMENT. IN  NO EVENT SHALL  THE AUTHORS BE LIABLE  FOR ANY
+CLAIM,  DAMAGES  OR  OTHER  LIABILITY,  WHETHER  IN  AN  ACTION  OF
+CONTRACT, TORT OR OTHERWISE, ARISING  FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as  contained in  this notice, the  names of the  authors or
+their institutions shall not be used in advertising or otherwise to
+promote the  sale, use or  other dealings in this  Software without
+prior written authorization from the authors.
+
+------------------------------------------------------------------------------
+libXau is redistributed within opencv-python non-headless Linux packages.
+This license applies to libXau binary in the directory cv2/.
+
+Copyright 1988, 1993, 1994, 1998  The Open Group
+
+Permission to use, copy, modify, distribute, and sell this software and its
+documentation for any purpose is hereby granted without fee, provided that
+the above copyright notice appear in all copies and that both that
+copyright notice and this permission notice appear in supporting
+documentation.
+
+The above copyright notice and this permission notice shall be included in
+all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.  IN NO EVENT SHALL THE
+OPEN GROUP BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN
+AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
+CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+Except as contained in this notice, the name of The Open Group shall not be
+used in advertising or otherwise to promote the sale, use or other dealings
+in this Software without prior written authorization from The Open Group.
\ No newline at end of file
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE.txt b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE.txt
new file mode 100644
index 000000000..328bf5063
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/LICENSE.txt
@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) Olli-Pekka Heinisuo
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
\ No newline at end of file
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/METADATA b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/METADATA
new file mode 100644
index 000000000..0a2e74982
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/METADATA
@@ -0,0 +1,244 @@
+Metadata-Version: 2.1
+Name: opencv-python
+Version: 4.4.0.44
+Summary: Wrapper package for OpenCV python bindings.
+Home-page: https://github.com/skvark/opencv-python
+Maintainer: Olli-Pekka Heinisuo
+License: MIT
+Platform: UNKNOWN
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Environment :: Console
+Classifier: Intended Audience :: Developers
+Classifier: Intended Audience :: Education
+Classifier: Intended Audience :: Information Technology
+Classifier: Intended Audience :: Science/Research
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: MacOS
+Classifier: Operating System :: Microsoft :: Windows
+Classifier: Operating System :: POSIX
+Classifier: Operating System :: Unix
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Programming Language :: C++
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Topic :: Scientific/Engineering
+Classifier: Topic :: Scientific/Engineering :: Image Recognition
+Classifier: Topic :: Software Development
+Requires-Python: >=3.6
+Description-Content-Type: text/markdown
+Requires-Dist: numpy (>=1.13.3)
+
+[![Downloads](http://pepy.tech/badge/opencv-python)](http://pepy.tech/project/opencv-python)
+
+## OpenCV on Wheels
+
+**Unofficial** pre-built CPU-only OpenCV packages for Python.
+
+Check the manual build section if you wish to compile the bindings from source to enable additional modules such as CUDA. 
+
+### Installation and Usage
+
+1. If you have previous/other manually installed (= not installed via ``pip``) version of OpenCV installed (e.g. cv2 module in the root of Python's site-packages), remove it before installation to avoid conflicts.
+2. Make sure that your `pip` version is up-to-date (19.3 is the minimum supported version): `pip install --upgrade pip`. Check version with `pip -V`. For example Linux distributions ship usually with very old `pip` versions which cause a lot of unexpected problems especially with the `manylinux` format.
+3. Select the correct package for your environment:
+
+    There are four different packages (see options 1, 2, 3 and 4 below) and you should **SELECT ONLY ONE OF THEM**. Do not install multiple different packages in the same environment. There is no plugin architecture: all the packages use the same namespace (`cv2`). If you installed multiple different packages in the same environment, uninstall them all with ``pip uninstall`` and reinstall only one package.
+
+    **a.** Packages for standard desktop environments (Windows, macOS, almost any GNU/Linux distribution)
+
+    - Option 1 - Main modules package: ``pip install opencv-python``
+    - Option 2 - Full package (contains both main modules and contrib/extra modules): ``pip install opencv-contrib-python`` (check contrib/extra modules listing from [OpenCV documentation](https://docs.opencv.org/master/))
+
+    **b.** Packages for server (headless) environments (such as Docker, cloud environments etc.), no GUI library dependencies
+
+    These packages are smaller than the two other packages above because they do not contain any GUI functionality (not compiled with Qt / other GUI components). This means that the packages avoid a heavy dependency chain to X11 libraries and you will have for example smaller Docker images as a result. You should always use these packages if you do not use `cv2.imshow` et al. or you are using some other package (such as PyQt) than OpenCV to create your GUI.
+
+    - Option 3 - Headless main modules package: ``pip install opencv-python-headless``
+    - Option 4 - Headless full package (contains both main modules and contrib/extra modules): ``pip install opencv-contrib-python-headless`` (check contrib/extra modules listing from [OpenCV documentation](https://docs.opencv.org/master/))
+
+4. Import the package:
+
+    ``import cv2``
+
+    All packages contain haarcascade files. ``cv2.data.haarcascades`` can be used as a shortcut to the data folder. For example:
+
+    ``cv2.CascadeClassifier(cv2.data.haarcascades + "haarcascade_frontalface_default.xml")``
+
+5. Read [OpenCV documentation](https://docs.opencv.org/master/)
+
+6. Before opening a new issue, read the FAQ below and have a look at the other issues which are already open.
+
+Frequently Asked Questions
+--------------------------
+
+**Q: Do I need to install also OpenCV separately?**
+
+A: No, the packages are special wheel binary packages and they already contain statically built OpenCV binaries.
+
+**Q: Pip install fails with ``ModuleNotFoundError: No module named 'skbuild'``?**
+
+Since ``opencv-python`` version 4.3.0.\*, ``manylinux1`` wheels were replaced by ``manylinux2014`` wheels. If your pip is too old, it will try to use the new source distribution introduced in 4.3.0.38 to manually build OpenCV because it does not know how to install ``manylinux2014`` wheels. However, source build will also fail because of too old ``pip`` because it does not understand build dependencies in ``pyproject.toml``. To use the new ``manylinux2014`` pre-built wheels (or to build from source), your ``pip`` version must be >= 19.3. Please upgrade ``pip`` with ``pip install --upgrade pip``.
+
+**Q: Pip install fails with ``Could not find a version that satisfies the requirement ...``?**
+
+A: Most likely the issue is related to too old pip and can be fixed by running ``pip install --upgrade pip``. Note that the wheel (especially manylinux) format does not currently support properly ARM architecture so there are no packages for ARM based platforms in PyPI. However, ``opencv-python`` packages for Raspberry Pi can be found from https://www.piwheels.org/.
+
+**Q: Import fails on Windows: ``ImportError: DLL load failed: The specified module could not be found.``?**
+
+A: If the import fails on Windows, make sure you have [Visual C++ redistributable 2015](https://www.microsoft.com/en-us/download/details.aspx?id=48145) installed. If you are using older Windows version than Windows 10 and latest system updates are not installed, [Universal C Runtime](https://support.microsoft.com/en-us/help/2999226/update-for-universal-c-runtime-in-windows) might be also required.
+
+Windows N and KN editions do not include Media Feature Pack which is required by OpenCV. If you are using Windows N or KN edition, please install also [Windows Media Feature Pack](https://support.microsoft.com/en-us/help/3145500/media-feature-pack-list-for-windows-n-editions).
+
+If you have Windows Server 2012+, media DLLs are probably missing too; please install the Feature called "Media Foundation" in the Server Manager. Beware, some posts advise to install "Windows Server Essentials Media Pack", but this one requires the "Windows Server Essentials Experience" role, and this role will deeply affect your Windows Server configuration (by enforcing active directory integration etc.); so just installing the "Media Foundation" should be a safer choice.
+
+If the above does not help, check if you are using Anaconda. Old Anaconda versions have a bug which causes the error, see [this issue](https://github.com/skvark/opencv-python/issues/36) for a manual fix.
+
+If you still encounter the error after you have checked all the previous solutions, download [Dependencies](https://github.com/lucasg/Dependencies) and open the ``cv2.pyd`` (located usually at ``C:\Users\username\AppData\Local\Programs\Python\PythonXX\Lib\site-packages\cv2``) file with it to debug missing DLL issues.
+
+**Q: I have some other import errors?**
+
+A: Make sure you have removed old manual installations of OpenCV Python bindings (cv2.so or cv2.pyd in site-packages).
+
+**Q: Why the packages do not include non-free algorithms?**
+
+A: Non-free algorithms such as SURF are not included in these packages because they are patented / non-free and therefore cannot be distributed as built binaries. Note that SIFT is included in the builds due to patent expiration since OpenCV versions 4.3.0 and 3.4.10. See this issue for more info: https://github.com/skvark/opencv-python/issues/126
+
+**Q: Why the package and import are different (opencv-python vs. cv2)?**
+
+A: It's easier for users to understand ``opencv-python`` than ``cv2`` and it makes it easier to find the package with search engines. `cv2` (old interface in old OpenCV versions was named as `cv`) is the name that OpenCV developers chose when they created the binding generators. This is kept as the import name to be consistent with different kind of tutorials around the internet. Changing the import name or behaviour would be also confusing to experienced users who are accustomed to the ``import cv2``.
+
+## Documentation for opencv-python
+
+[![AppVeyor CI test status (Windows)](https://img.shields.io/appveyor/ci/skvark/opencv-python.svg?maxAge=3600&label=Windows)](https://ci.appveyor.com/project/skvark/opencv-python)
+[![Travis CI test status (Linux and macOS)](https://img.shields.io/travis/com/skvark/opencv-python/master?label=Linux%20%26%20macOS)](https://travis-ci.com/github/skvark/opencv-python/)
+
+The aim of this repository is to provide means to package each new [OpenCV release](https://github.com/opencv/opencv/releases) for the most used Python versions and platforms.
+
+### CI build process
+
+The project is structured like a normal Python package with a standard ``setup.py`` file.
+The build process for a single entry in the build matrices is as follows (see for example ``appveyor.yml`` file):
+
+0. In Linux and MacOS build: get OpenCV's optional C dependencies that we compile against
+
+1. Checkout repository and submodules
+
+   -  OpenCV is included as submodule and the version is updated
+      manually by maintainers when a new OpenCV release has been made
+   -  Contrib modules are also included as a submodule
+
+2. Find OpenCV version from the sources
+
+3. Build OpenCV
+
+   -  tests are disabled, otherwise build time increases too much
+   -  there are 4 build matrix entries for each build combination: with and without contrib modules, with and without GUI (headless)
+   -  Linux builds run in manylinux Docker containers (CentOS 5)
+   -  source distributions are separate entries in the build matrix 
+
+4. Rearrange OpenCV's build result, add our custom files and generate wheel
+
+5. Linux and macOS wheels are transformed with auditwheel and delocate, correspondingly
+
+6. Install the generated wheel
+7. Test that Python can import the library and run some sanity checks
+8. Use twine to upload the generated wheel to PyPI (only in release builds)
+
+Steps 1--4 are handled by ``pip wheel``.
+
+The build can be customized with environment variables. In addition to any variables that OpenCV's build accepts, we recognize:
+
+- ``CI_BUILD``. Set to ``1`` to emulate the CI environment build behaviour. Used only in CI builds to force certain build flags on in ``setup.py``. Do not use this unless you know what you are doing.
+- ``ENABLE_CONTRIB`` and ``ENABLE_HEADLESS``. Set to ``1`` to build the contrib and/or headless version
+- ``ENABLE_JAVA``, Set to ``1`` to enable the Java client build.  This is disabled by default.
+- ``CMAKE_ARGS``. Additional arguments for OpenCV's CMake invocation. You can use this to make a custom build. 
+
+See the next section for more info about manual builds outside the CI environment.
+
+### Manual builds
+
+If some dependency is not enabled in the pre-built wheels, you can also run the build locally to create a custom wheel.
+
+1. Clone this repository: `git clone --recursive https://github.com/skvark/opencv-python.git`
+2. ``cd opencv-python``
+    - you can use `git` to checkout some other version of OpenCV in the `opencv` and `opencv_contrib` submodules if needed
+3. Add custom Cmake flags if needed, for example: `export CMAKE_ARGS="-DSOME_FLAG=ON -DSOME_OTHER_FLAG=OFF"` (in Windows you need to set environment variables differently depending on Command Line or PowerShell)
+4. Select the package flavor which you wish to build with `ENABLE_CONTRIB` and `ENABLE_HEADLESS`: i.e. `export ENABLE_CONTRIB=1` if you wish to build `opencv-contrib-python`
+5. Run ``pip wheel . --verbose``. NOTE: make sure you have the latest ``pip`` version, the ``pip wheel`` command replaces the old ``python setup.py bdist_wheel`` command which does not support ``pyproject.toml``.
+    - this might take anything from 5 minutes to over 2 hours depending on your hardware
+6. You'll have the wheel file in the `dist` folder and you can do with that whatever you wish
+    - Optional: on Linux use some of the `manylinux` images as a build hosts if maximum portability is needed and run `auditwheel` for the wheel after build
+    - Optional: on macOS use ``delocate`` (same as ``auditwheel`` but for macOS) for better portability
+
+#### Source distributions
+
+Since OpenCV version 4.3.0, also source distributions are provided in PyPI. This means that if your system is not compatible with any of the wheels in PyPI, ``pip`` will attempt to build OpenCV from sources. If you need a OpenCV version which is not available in PyPI as a source distribution, please follow the manual build guidance above instead of this one.
+
+You can also force ``pip`` to build the wheels from the source distribution. Some examples: 
+
+- ``pip install --no-binary opencv-python opencv-python``
+- ``pip install --no-binary :all: opencv-python``
+
+If you need contrib modules or headless version, just change the package name (step 4 in the previous section is not needed). However, any additional CMake flags can be provided via environment variables as described in step 3 of the manual build section. If none are provided, OpenCV's CMake scripts will attempt to find and enable any suitable dependencies. Headless distributions have hard coded CMake flags which disable all possible GUI dependencies. 
+
+On slow systems such as Raspberry Pi the full build may take several hours. On a 8-core Ryzen 7 3700X the build takes about 6 minutes.
+
+### Licensing
+
+Opencv-python package (scripts in this repository) is available under MIT license.
+
+OpenCV itself is available under [3-clause BSD License](https://github.com/opencv/opencv/blob/master/LICENSE).
+
+Third party package licenses are at [LICENSE-3RD-PARTY.txt](https://github.com/skvark/opencv-python/blob/master/LICENSE-3RD-PARTY.txt).
+
+All wheels ship with [FFmpeg](http://ffmpeg.org) licensed under the [LGPLv2.1](http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html).
+
+Non-headless Linux and MacOS wheels ship with [Qt 5](http://doc.qt.io/qt-5/lgpl.html) licensed under the [LGPLv3](http://www.gnu.org/licenses/lgpl-3.0.html).
+
+The packages include also other binaries. Full list of licenses can be found from [LICENSE-3RD-PARTY.txt](https://github.com/skvark/opencv-python/blob/master/LICENSE-3RD-PARTY.txt).
+
+### Versioning
+
+``find_version.py`` script searches for the version information from OpenCV sources and appends also a revision number specific to this repository to the version string. It saves the version information to ``version.py`` file under ``cv2`` in addition to some other flags.
+
+### Releases
+
+A release is made and uploaded to PyPI when a new tag is pushed to master branch. These tags differentiate packages (this repo might have modifications but OpenCV version stays same) and should be incremented sequentially. In practice, release version numbers look like this:
+
+``cv_major.cv_minor.cv_revision.package_revision`` e.g. ``3.1.0.0``
+
+The master branch follows OpenCV master branch releases. 3.4 branch follows OpenCV 3.4 bugfix releases.
+
+### Development builds
+
+Every commit to the master branch of this repo will be built. Possible build artifacts use local version identifiers:
+
+``cv_major.cv_minor.cv_revision+git_hash_of_this_repo`` e.g. ``3.1.0+14a8d39``
+
+These artifacts can't be and will not be uploaded to PyPI.
+
+### Manylinux wheels
+
+Linux wheels are built using [manylinux2014](https://github.com/pypa/manylinux). These wheels should work out of the box for most of the distros (which use GNU C standard library) out there since they are built against an old version of glibc.
+
+The default ``manylinux2014`` images have been extended with some OpenCV dependencies. See [Docker folder](https://github.com/skvark/opencv-python/tree/master/docker) for more info.
+
+### Supported Python versions
+
+Python 3.x compatible pre-built wheels are provided for the officially supported Python versions (not in EOL):
+
+- 3.6
+- 3.7
+- 3.8
+
+### Backward compatibility
+
+Starting from 4.2.0 and 3.4.9 builds the macOS Travis build environment was updated to XCode 9.4. The change effectively dropped support for older than 10.13 macOS versions.
+
+Starting from 4.3.0 and 3.4.10 builds the Linux build environment was updated from `manylinux1` to `manylinux2014`. This dropped support for old Linux distributions.
+
+
+
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/RECORD b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/RECORD
new file mode 100644
index 000000000..b4e754e38
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/RECORD
@@ -0,0 +1,35 @@
+cv2/LICENSE-3RD-PARTY.txt,sha256=M5rC6acPDI-47HGaQQFT9ytsBYaTpud8Ie-due0Ptw4,110308
+cv2/LICENSE.txt,sha256=CdcZBY54Kse8cbohyUThE2zeK7lXwOiIEh8CGNa18Cw,1070
+cv2/__init__.py,sha256=jkcQbSTmNIAk6XxHV5XRNpk1y9X00nsqlu8TsvDPt4c,968
+cv2/__pycache__/__init__.cpython-36.pyc,,
+cv2/__pycache__/version.cpython-36.pyc,,
+cv2/cv2.cp36-win32.pyd,sha256=42iJIxojzxjaEFKkkOiffR3qP5mMauEfeyDwHtXvCfE,39421952
+cv2/data/__init__.py,sha256=125Pcte_OtB55ZxjWg5ko8ugpnogZ1sRMyP48dtBCMw,70
+cv2/data/__pycache__/__init__.cpython-36.pyc,,
+cv2/data/haarcascade_eye.xml,sha256=ccxk_DBaNV3GAGeID2-71D3RVb1j7jhEZhob2jSy_Yw,341406
+cv2/data/haarcascade_eye_tree_eyeglasses.xml,sha256=4y-cZ5NcM-nRMx6xT6WFVP8Xg1wDdCZjvLl6iS6Talc,601661
+cv2/data/haarcascade_frontalcatface.xml,sha256=rCusk07yQoTviisunY5X7vhKwdaUO00R5cnoWE3Aacg,411388
+cv2/data/haarcascade_frontalcatface_extended.xml,sha256=_9DR0o8H0DdsidtMmEUAnChVzHbIz_dj1TMdyTYdqFQ,382918
+cv2/data/haarcascade_frontalface_alt.xml,sha256=YoHfE0Wcwhj_BH0Csq44WbEv8UqT_-iVL3sz-te5aXs,676709
+cv2/data/haarcascade_frontalface_alt2.xml,sha256=ewyWfZq7373gJeuceGlH0VG2QmBA0HqPlWLtj9kHJLQ,540616
+cv2/data/haarcascade_frontalface_alt_tree.xml,sha256=Dl7kfswTJp1U3XpV-LU3UhZ8Ulh3IId3MjiPsHigSAo,2689040
+cv2/data/haarcascade_frontalface_default.xml,sha256=D31FJ4ROtRTUpJSOgi2pD7sWo0oLu7xq3GSYdHpar7A,930127
+cv2/data/haarcascade_fullbody.xml,sha256=BBdFxx7vG1yGrvIk8XznWwQtMzFMyPZ1dCT4vYzTCqE,476827
+cv2/data/haarcascade_lefteye_2splits.xml,sha256=dMMjx4yBR1_JFY-sv7hmuwzKBr5B9XHfR9SsjQH5zkw,195369
+cv2/data/haarcascade_licence_plate_rus_16stages.xml,sha256=TRxEv3obxOIE-iWwRu0Kz_1_cTzBP-KVi2l3Elxg3eo,47775
+cv2/data/haarcascade_lowerbody.xml,sha256=HmluHHxmxDmuIpz_-IcfQgN8NX6eHgkKK1nrwfj_XLs,395322
+cv2/data/haarcascade_profileface.xml,sha256=s5pKO-RVOdsUan_B0-dhopLBluuIQhGF5qYVswVeYS0,828514
+cv2/data/haarcascade_righteye_2splits.xml,sha256=TPDXK-pzB-mvfrmdSsvhXXEBpnwi_Nz77v1pKtN893Y,196170
+cv2/data/haarcascade_russian_plate_number.xml,sha256=gUy1lUaCr1cOWDYfnl-LW1E6QRJ3a7nsrO-fDkymwtc,75482
+cv2/data/haarcascade_smile.xml,sha256=TKHzBOq9C1rjAYDIGstT4Walhn5b4Xsxa9PzLP34fYo,188506
+cv2/data/haarcascade_upperbody.xml,sha256=cyirT9sVkvU9mNfqWxudkOAa9dlfISrzeMfrV5BIu18,785819
+cv2/opencv_videoio_ffmpeg440.dll,sha256=J1e12jCo_SBsprcUNwGaNRrvbPhm_vkaSjHUWuIzJDs,21213184
+cv2/version.py,sha256=F-obsooc3Y8ryOEvFldzLO9Xf-18azfaub7WdHtBWOU,79
+opencv_python-4.4.0.44.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
+opencv_python-4.4.0.44.dist-info/LICENSE-3RD-PARTY.txt,sha256=M5rC6acPDI-47HGaQQFT9ytsBYaTpud8Ie-due0Ptw4,110308
+opencv_python-4.4.0.44.dist-info/LICENSE.txt,sha256=CdcZBY54Kse8cbohyUThE2zeK7lXwOiIEh8CGNa18Cw,1070
+opencv_python-4.4.0.44.dist-info/METADATA,sha256=J8uOJZ4ImkuL1FxGtDpMVYed0t2LJ2Fi2xk5_NP3smY,16822
+opencv_python-4.4.0.44.dist-info/RECORD,,
+opencv_python-4.4.0.44.dist-info/REQUESTED,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+opencv_python-4.4.0.44.dist-info/WHEEL,sha256=m3IzPllG3Ha7jh_xG0KIlq5iWOvP3D87OZ0E_a816pc,96
+opencv_python-4.4.0.44.dist-info/top_level.txt,sha256=SY8vrf_sYOg99OP9euhz7q36pPy_2VK5vbeEWXwwSoc,4
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/REQUESTED b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/REQUESTED
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/WHEEL b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/WHEEL
new file mode 100644
index 000000000..ad326376b
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/WHEEL
@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: skbuild 0.11.1
+Root-Is-Purelib: false
+Tag: cp36-cp36m-win32
+
diff --git a/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/top_level.txt b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/top_level.txt
new file mode 100644
index 000000000..6f372d8a1
--- /dev/null
+++ b/venv/Lib/site-packages/opencv_python-4.4.0.44.dist-info/top_level.txt
@@ -0,0 +1 @@
+cv2
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/INSTALLER b/venv/Lib/site-packages/pip-20.2.3.dist-info/INSTALLER
new file mode 100644
index 000000000..a1b589e38
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/INSTALLER
@@ -0,0 +1 @@
+pip
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/LICENSE.txt b/venv/Lib/site-packages/pip-20.2.3.dist-info/LICENSE.txt
new file mode 100644
index 000000000..737fec5c5
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/LICENSE.txt
@@ -0,0 +1,20 @@
+Copyright (c) 2008-2019 The pip developers (see AUTHORS.txt file)
+
+Permission is hereby granted, free of charge, to any person obtaining
+a copy of this software and associated documentation files (the
+"Software"), to deal in the Software without restriction, including
+without limitation the rights to use, copy, modify, merge, publish,
+distribute, sublicense, and/or sell copies of the Software, and to
+permit persons to whom the Software is furnished to do so, subject to
+the following conditions:
+
+The above copyright notice and this permission notice shall be
+included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/METADATA b/venv/Lib/site-packages/pip-20.2.3.dist-info/METADATA
new file mode 100644
index 000000000..7fdd70549
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/METADATA
@@ -0,0 +1,88 @@
+Metadata-Version: 2.1
+Name: pip
+Version: 20.2.3
+Summary: The PyPA recommended tool for installing Python packages.
+Home-page: https://pip.pypa.io/
+Author: The pip developers
+Author-email: distutils-sig@python.org
+License: MIT
+Project-URL: Documentation, https://pip.pypa.io
+Project-URL: Source, https://github.com/pypa/pip
+Project-URL: Changelog, https://pip.pypa.io/en/stable/news/
+Keywords: distutils easy_install egg setuptools wheel virtualenv
+Platform: UNKNOWN
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Topic :: Software Development :: Build Tools
+Classifier: Programming Language :: Python
+Classifier: Programming Language :: Python :: 2
+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 :: 3.8
+Classifier: Programming Language :: Python :: Implementation :: CPython
+Classifier: Programming Language :: Python :: Implementation :: PyPy
+Requires-Python: >=2.7,!=3.0.*,!=3.1.*,!=3.2.*,!=3.3.*,!=3.4.*
+
+pip - The Python Package Installer
+==================================
+
+.. image:: https://img.shields.io/pypi/v/pip.svg
+   :target: https://pypi.org/project/pip/
+
+.. image:: https://readthedocs.org/projects/pip/badge/?version=latest
+   :target: https://pip.pypa.io/en/latest
+
+pip is the `package installer`_ for Python. You can use pip to install packages from the `Python Package Index`_ and other indexes.
+
+Please take a look at our documentation for how to install and use pip:
+
+* `Installation`_
+* `Usage`_
+
+We release updates regularly, with a new version every 3 months. Find more details in our documentation:
+
+* `Release notes`_
+* `Release process`_
+
+In 2020, we're working on improvements to the heart of pip. Please `learn more and take our survey`_ to help us do it right.
+
+If you find bugs, need help, or want to talk to the developers, please use our mailing lists or chat rooms:
+
+* `Issue tracking`_
+* `Discourse channel`_
+* `User IRC`_
+
+If you want to get involved head over to GitHub to get the source code, look at our development documentation and feel free to jump on the developer mailing lists and chat rooms:
+
+* `GitHub page`_
+* `Development documentation`_
+* `Development mailing list`_
+* `Development IRC`_
+
+Code of Conduct
+---------------
+
+Everyone interacting in the pip project's codebases, issue trackers, chat
+rooms, and mailing lists is expected to follow the `PyPA Code of Conduct`_.
+
+.. _package installer: https://packaging.python.org/guides/tool-recommendations/
+.. _Python Package Index: https://pypi.org
+.. _Installation: https://pip.pypa.io/en/stable/installing.html
+.. _Usage: https://pip.pypa.io/en/stable/
+.. _Release notes: https://pip.pypa.io/en/stable/news.html
+.. _Release process: https://pip.pypa.io/en/latest/development/release-process/
+.. _GitHub page: https://github.com/pypa/pip
+.. _Development documentation: https://pip.pypa.io/en/latest/development
+.. _learn more and take our survey: https://pyfound.blogspot.com/2020/03/new-pip-resolver-to-roll-out-this-year.html
+.. _Issue tracking: https://github.com/pypa/pip/issues
+.. _Discourse channel: https://discuss.python.org/c/packaging
+.. _Development mailing list: https://mail.python.org/mailman3/lists/distutils-sig.python.org/
+.. _User IRC: https://webchat.freenode.net/?channels=%23pypa
+.. _Development IRC: https://webchat.freenode.net/?channels=%23pypa-dev
+.. _PyPA Code of Conduct: https://www.pypa.io/en/latest/code-of-conduct/
+
+
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/RECORD b/venv/Lib/site-packages/pip-20.2.3.dist-info/RECORD
new file mode 100644
index 000000000..28b785797
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/RECORD
@@ -0,0 +1,751 @@
+../../Scripts/pip.exe,sha256=eUkKosYLuZ_Z5lu_ENYZ2nbSWMGT_DspCy0WhWOt4Ms,97237
+../../Scripts/pip3.6.exe,sha256=eUkKosYLuZ_Z5lu_ENYZ2nbSWMGT_DspCy0WhWOt4Ms,97237
+../../Scripts/pip3.exe,sha256=eUkKosYLuZ_Z5lu_ENYZ2nbSWMGT_DspCy0WhWOt4Ms,97237
+pip-20.2.3.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
+pip-20.2.3.dist-info/LICENSE.txt,sha256=W6Ifuwlk-TatfRU2LR7W1JMcyMj5_y1NkRkOEJvnRDE,1090
+pip-20.2.3.dist-info/METADATA,sha256=9mmHP3BezeQwiPj12NdLFspqcxqrf7xqW6OX9PwZSr4,3708
+pip-20.2.3.dist-info/RECORD,,
+pip-20.2.3.dist-info/WHEEL,sha256=ADKeyaGyKF5DwBNE0sRE5pvW-bSkFMJfBuhzZ3rceP4,110
+pip-20.2.3.dist-info/entry_points.txt,sha256=HtfDOwpUlr9s73jqLQ6wF9V0_0qvUXJwCBz7Vwx0Ue0,125
+pip-20.2.3.dist-info/top_level.txt,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
+pip/__init__.py,sha256=NkPibWV383InU5x7DgeQLdL2zhlXTKjJRBMQTSKNYjI,455
+pip/__main__.py,sha256=bqCAM1cj1HwHCDx3WJa-LJxOBXimGxE8OjBqAvnhVg0,911
+pip/__pycache__/__init__.cpython-36.pyc,,
+pip/__pycache__/__main__.cpython-36.pyc,,
+pip/_internal/__init__.py,sha256=2si23JBW1erg19xIJ8CD6tfGknz0ijtXmzuXjGfGMGE,495
+pip/_internal/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/__pycache__/build_env.cpython-36.pyc,,
+pip/_internal/__pycache__/cache.cpython-36.pyc,,
+pip/_internal/__pycache__/configuration.cpython-36.pyc,,
+pip/_internal/__pycache__/exceptions.cpython-36.pyc,,
+pip/_internal/__pycache__/locations.cpython-36.pyc,,
+pip/_internal/__pycache__/main.cpython-36.pyc,,
+pip/_internal/__pycache__/pyproject.cpython-36.pyc,,
+pip/_internal/__pycache__/self_outdated_check.cpython-36.pyc,,
+pip/_internal/__pycache__/wheel_builder.cpython-36.pyc,,
+pip/_internal/build_env.py,sha256=9_UaQ2fpsBvpKAji27f7bPAi2v3mb0cBvDYcejwFKNM,8088
+pip/_internal/cache.py,sha256=pT17VVxgzZK32aqY5FRS8GyAI73LKzNMF8ZelQ7Ojm0,12249
+pip/_internal/cli/__init__.py,sha256=FkHBgpxxb-_gd6r1FjnNhfMOzAUYyXoXKJ6abijfcFU,132
+pip/_internal/cli/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/autocompletion.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/base_command.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/cmdoptions.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/command_context.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/main.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/main_parser.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/parser.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/progress_bars.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/req_command.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/spinners.cpython-36.pyc,,
+pip/_internal/cli/__pycache__/status_codes.cpython-36.pyc,,
+pip/_internal/cli/autocompletion.py,sha256=ekGNtcDI0p7rFVc-7s4T9Tbss4Jgb7vsB649XJIblRg,6547
+pip/_internal/cli/base_command.py,sha256=bf058xM1HE9QJCNEHExbuTjL0peKg9kSxCNxDtwAh88,9302
+pip/_internal/cli/cmdoptions.py,sha256=M_BtuqeyRpZAUUYytts3pguBCF2RaGukVpDPE0niroI,28782
+pip/_internal/cli/command_context.py,sha256=ygMVoTy2jpNilKT-6416gFSQpaBtrKRBbVbi2fy__EU,975
+pip/_internal/cli/main.py,sha256=Hxc9dZyW3xiDsYZX-_J2cGXT5DWNLNn_Y7o9oUme-Ec,2616
+pip/_internal/cli/main_parser.py,sha256=voAtjo4WVPIYeu7Fqabva9SXaB3BjG0gH93GBfe6jHQ,2843
+pip/_internal/cli/parser.py,sha256=4FfwW8xB84CrkLs35ud90ZkhCcWyVkx17XD6j3XCW7c,9480
+pip/_internal/cli/progress_bars.py,sha256=J1zykt2LI4gbBeXorfYRmYV5FgXhcW4x3r6xE_a7Z7c,9121
+pip/_internal/cli/req_command.py,sha256=Eiz8TVzeqzG-40t7qLC1vO-vzjCRvX9C-qXMyfw9D1I,15132
+pip/_internal/cli/spinners.py,sha256=PS9s53LB5aDPelIn8FhKerK3bOdgeefFH5wSWJ2PCzI,5509
+pip/_internal/cli/status_codes.py,sha256=F6uDG6Gj7RNKQJUDnd87QKqI16Us-t-B0wPF_4QMpWc,156
+pip/_internal/commands/__init__.py,sha256=yoLAnmEXjoQgYfDuwsuWG3RzzD19oeHobGEhmpIYsB4,4100
+pip/_internal/commands/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/cache.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/check.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/completion.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/configuration.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/debug.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/download.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/freeze.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/hash.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/help.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/install.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/list.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/search.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/show.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/uninstall.cpython-36.pyc,,
+pip/_internal/commands/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/commands/cache.py,sha256=U3rLjls0AMMO8PxnhXVwIp7Biyvns8-gBThKTH3tX7Y,5676
+pip/_internal/commands/check.py,sha256=fqRrz2uKPC8Qsx2rgLygAD2Rbr-qxp1Q55zUoyZzB9Q,1677
+pip/_internal/commands/completion.py,sha256=ObssM77quf61qvbuSE6XLwUBdm_WcWIvXFI-Hy1RBsI,3081
+pip/_internal/commands/configuration.py,sha256=IN2QBF653sRiRU7-pHTpnZ6_gyiXNKUQkLiLaNRLKNw,9344
+pip/_internal/commands/debug.py,sha256=otBZnpnostX2kmYyOl6g6CeCLmk6H00Tsj2CDsCtFXw,7314
+pip/_internal/commands/download.py,sha256=EKFlj_ceGUEJj6yCDw7P6w7yUoB16IcNHhT2qnCFDNQ,4918
+pip/_internal/commands/freeze.py,sha256=vLBBP1d8wgEXrmlh06hbz_x_Q1mWHUdiWDa9NP2eKLE,3452
+pip/_internal/commands/hash.py,sha256=v2nYCiEsEI9nEam1p6GwdG8xyj5gFv-4WrqvNexKmeY,1843
+pip/_internal/commands/help.py,sha256=ryuMDt2tc7ic3NJYMjjoNRH5r6LrB2yQVZvehAm8bLs,1270
+pip/_internal/commands/install.py,sha256=OXjZCNSioJRfP7YMkJyAWLl7X7-8f6DkhWlhPhG6fXk,27995
+pip/_internal/commands/list.py,sha256=2o3rYw37ECrhe4-Bu5s_2C0bwhYgghh4833MxcWAEug,11312
+pip/_internal/commands/search.py,sha256=1HPAFU-tmgKrHhr4xNuk3xMoPeSzD_oDvDDiUFZZ15E,5756
+pip/_internal/commands/show.py,sha256=r69-G8HIepDKm4SeyeHj0Ez1P9xoihrpVUyXm6NmXYY,6996
+pip/_internal/commands/uninstall.py,sha256=Ys8hwFsg0kvvGtLGYG3ibL5BKvURhlSlCX50ZQ-hsHk,3311
+pip/_internal/commands/wheel.py,sha256=-HSISE5AV29I752Aqw4DdmulrGd8rB_ZTOdpbJ6T8iM,6419
+pip/_internal/configuration.py,sha256=-Gxz2J-KuvxiqWIJ9F-XnYVZ5lKhNk7VO6ondEbH4EM,14115
+pip/_internal/distributions/__init__.py,sha256=ECBUW5Gtu9TjJwyFLvim-i6kUMYVuikNh9I5asL6tbA,959
+pip/_internal/distributions/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/distributions/__pycache__/base.cpython-36.pyc,,
+pip/_internal/distributions/__pycache__/installed.cpython-36.pyc,,
+pip/_internal/distributions/__pycache__/sdist.cpython-36.pyc,,
+pip/_internal/distributions/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/distributions/base.py,sha256=ruprpM_L2T2HNi3KLUHlbHimZ1sWVw-3Q0Lb8O7TDAI,1425
+pip/_internal/distributions/installed.py,sha256=YqlkBKr6TVP1MAYS6SG8ojud21wVOYLMZ8jMLJe9MSU,760
+pip/_internal/distributions/sdist.py,sha256=D4XTMlCwgPlK69l62GLYkNSVTVe99fR5iAcVt2EbGok,4086
+pip/_internal/distributions/wheel.py,sha256=95uD-TfaYoq3KiKBdzk9YMN4RRqJ28LNoSTS2K46gek,1294
+pip/_internal/exceptions.py,sha256=ZVpArxQrSlm4qAMtHaY3nHvG_t5eSi3WCnMowdm_m8I,12637
+pip/_internal/index/__init__.py,sha256=vpt-JeTZefh8a-FC22ZeBSXFVbuBcXSGiILhQZJaNpQ,30
+pip/_internal/index/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/index/__pycache__/collector.cpython-36.pyc,,
+pip/_internal/index/__pycache__/package_finder.cpython-36.pyc,,
+pip/_internal/index/collector.py,sha256=rMdGdAABOrvIl0DYlCMWXr7mIoqrU2VGeQpCuWiPu1Q,22838
+pip/_internal/index/package_finder.py,sha256=ISieDd20dOSndMNybafCu3pO2JR3BKOfHv92Bes0j0Q,37364
+pip/_internal/locations.py,sha256=7YjzJy2CroQD8GBMemnHWRl9448BSIt0lfH98B-Dkd8,6732
+pip/_internal/main.py,sha256=IVBnUQ-FG7DK6617uEXRB5_QJqspAsBFmTmTesYkbdQ,437
+pip/_internal/models/__init__.py,sha256=3DHUd_qxpPozfzouoqa9g9ts1Czr5qaHfFxbnxriepM,63
+pip/_internal/models/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/models/__pycache__/candidate.cpython-36.pyc,,
+pip/_internal/models/__pycache__/direct_url.cpython-36.pyc,,
+pip/_internal/models/__pycache__/format_control.cpython-36.pyc,,
+pip/_internal/models/__pycache__/index.cpython-36.pyc,,
+pip/_internal/models/__pycache__/link.cpython-36.pyc,,
+pip/_internal/models/__pycache__/scheme.cpython-36.pyc,,
+pip/_internal/models/__pycache__/search_scope.cpython-36.pyc,,
+pip/_internal/models/__pycache__/selection_prefs.cpython-36.pyc,,
+pip/_internal/models/__pycache__/target_python.cpython-36.pyc,,
+pip/_internal/models/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/models/candidate.py,sha256=gACeCSHTIaWuB6RAeLmGJnbFFbKfp_47UERDoC_ldOU,1195
+pip/_internal/models/direct_url.py,sha256=MnBLPci1hE9Ndh6d3m0LAqB7hX3ci80CCJTE5eerFaQ,6900
+pip/_internal/models/format_control.py,sha256=RdnnmXxVJppCZWzWEmFTr-zD_m3G0izPLqJi6Iop75M,2823
+pip/_internal/models/index.py,sha256=carvxxaT7mJyoEkptaECHUZiNaA6R5NrsGF55zawNn8,1161
+pip/_internal/models/link.py,sha256=FMlxvqKmLoj7xTQSgKqfO2ehE1WcgD4C5DmEBuC_Qos,7470
+pip/_internal/models/scheme.py,sha256=EhPkT_6G0Md84JTLSVopYsp5H_K6BREYmFvU8H6wMK8,778
+pip/_internal/models/search_scope.py,sha256=Lum0mY4_pdR9DDBy6HV5xHGIMPp_kU8vMsqYKFHZip4,4751
+pip/_internal/models/selection_prefs.py,sha256=pgNjTfgePPiX1R5S2S8Yc6odOfU9NzG7YP_m_gnS0kw,2044
+pip/_internal/models/target_python.py,sha256=R7tAXI15B_cgw7Fgnq5cI9F-44goUZncH9JMtE8pXRw,4034
+pip/_internal/models/wheel.py,sha256=FTfzVb4WIbfIehxhdlAVvCil_MQ0-W44oyN56cE6NHc,2772
+pip/_internal/network/__init__.py,sha256=jf6Tt5nV_7zkARBrKojIXItgejvoegVJVKUbhAa5Ioc,50
+pip/_internal/network/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/network/__pycache__/auth.cpython-36.pyc,,
+pip/_internal/network/__pycache__/cache.cpython-36.pyc,,
+pip/_internal/network/__pycache__/download.cpython-36.pyc,,
+pip/_internal/network/__pycache__/lazy_wheel.cpython-36.pyc,,
+pip/_internal/network/__pycache__/session.cpython-36.pyc,,
+pip/_internal/network/__pycache__/utils.cpython-36.pyc,,
+pip/_internal/network/__pycache__/xmlrpc.cpython-36.pyc,,
+pip/_internal/network/auth.py,sha256=dt3NvTRJ8182S3VpdYFEZMPT0JhOKHyFtR-O-JMlJII,11652
+pip/_internal/network/cache.py,sha256=6cCD7XNrqh1d1lOSY5U-0ZXOG1YwEgMYs-VhRZVyzMA,2329
+pip/_internal/network/download.py,sha256=VTGDO01_nX-5MCdatd4Icv0F88_M8N3WnW6BevA6a0o,5151
+pip/_internal/network/lazy_wheel.py,sha256=RXcQILT5v5UO6kxgv76CSncLTqRL29o-OXbaW2aK7t4,8138
+pip/_internal/network/session.py,sha256=Zs0uiyPxTpfpgSv-ZI9hK9TjasmTplBuBivOTcUiJME,15208
+pip/_internal/network/utils.py,sha256=ZPHg7u6DEcg2EvILIdPECnvPLp21OPHxNVmeXfMy-n0,4172
+pip/_internal/network/xmlrpc.py,sha256=PFCiX_nnwYxC8SFIf7J3trP40ECGjA6fl2-IVNhbkPM,1882
+pip/_internal/operations/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/operations/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/operations/__pycache__/check.cpython-36.pyc,,
+pip/_internal/operations/__pycache__/freeze.cpython-36.pyc,,
+pip/_internal/operations/__pycache__/prepare.cpython-36.pyc,,
+pip/_internal/operations/build/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/operations/build/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/operations/build/__pycache__/metadata.cpython-36.pyc,,
+pip/_internal/operations/build/__pycache__/metadata_legacy.cpython-36.pyc,,
+pip/_internal/operations/build/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/operations/build/__pycache__/wheel_legacy.cpython-36.pyc,,
+pip/_internal/operations/build/metadata.py,sha256=2aILgWCQTF1aIhWuCH8TTSjv_kYmA3x1262fT2FQ6pQ,1254
+pip/_internal/operations/build/metadata_legacy.py,sha256=VgzBTk8naIO8-8N_ifEYF7ZAxWUDhphWVIaVlZ2FqYM,2011
+pip/_internal/operations/build/wheel.py,sha256=33vdkxTO-gNqrtWH1eNL_uZo4Irax85moDx2o9zae3M,1465
+pip/_internal/operations/build/wheel_legacy.py,sha256=N1aqNZyGURBX0Bj6wPmB0t4866oMbxoHUpC9pz6FyT0,3356
+pip/_internal/operations/check.py,sha256=JYDsVLvpFyJuJq0ttStgg8TRKbc0myYFAMnfnnQOREM,5215
+pip/_internal/operations/freeze.py,sha256=_vJSZwHBNzBV0GpRUSXhUJz3BrGFdcT2aTcWxH1L4P0,10373
+pip/_internal/operations/install/__init__.py,sha256=mX7hyD2GNBO2mFGokDQ30r_GXv7Y_PLdtxcUv144e-s,51
+pip/_internal/operations/install/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/operations/install/__pycache__/editable_legacy.cpython-36.pyc,,
+pip/_internal/operations/install/__pycache__/legacy.cpython-36.pyc,,
+pip/_internal/operations/install/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/operations/install/editable_legacy.py,sha256=rJ_xs2qtDUjpY2-n6eYlVyZiNoKbOtZXZrYrcnIELt4,1488
+pip/_internal/operations/install/legacy.py,sha256=zu3Gw54dgHtluyW5n8j5qKcAScidQXJvqB8fb0oLB-4,4281
+pip/_internal/operations/install/wheel.py,sha256=nJmOSOYY3keksXd_3GFuhAWeeoKvGOyoSGbjXABjZ40,31310
+pip/_internal/operations/prepare.py,sha256=Rt7Yh7w10_Q-vI3b7R1wkt2R6XPX8YVUdODk-TaGI9c,19903
+pip/_internal/pyproject.py,sha256=VJKsrXORGiGoDPVKCQhuu4tWlQSTOhoiRlVLRNu4rx4,7400
+pip/_internal/req/__init__.py,sha256=s-E5Vxxqqpcs7xfY5gY69oHogsWJ4sLbnUiDoWmkHOU,3133
+pip/_internal/req/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/req/__pycache__/constructors.cpython-36.pyc,,
+pip/_internal/req/__pycache__/req_file.cpython-36.pyc,,
+pip/_internal/req/__pycache__/req_install.cpython-36.pyc,,
+pip/_internal/req/__pycache__/req_set.cpython-36.pyc,,
+pip/_internal/req/__pycache__/req_tracker.cpython-36.pyc,,
+pip/_internal/req/__pycache__/req_uninstall.cpython-36.pyc,,
+pip/_internal/req/constructors.py,sha256=LrSHbRHu52-h6HM1qJKG68o1Jw5q8MvJGfr4As6j2uU,16387
+pip/_internal/req/req_file.py,sha256=p7n3Y0q275Eisqfxd0vtfnxYvlT6TCCY0tj75p-yiOY,19448
+pip/_internal/req/req_install.py,sha256=5IYle0AaLivlkZo6mhU9sj30CbzPqLe92csBnAfJq8U,33610
+pip/_internal/req/req_set.py,sha256=dxcfbieWYfYkTJNE07U8xaO40zLxl8BhWOcIHVFTmoo,7886
+pip/_internal/req/req_tracker.py,sha256=qWaiejNK6o6cqeyTOIGKIU1CoyrXCcqgMHYi3cqelOA,4690
+pip/_internal/req/req_uninstall.py,sha256=opMGDGb7ZaFippRbaarJaljtzl2CNZmBGEUSnTubE-A,23706
+pip/_internal/resolution/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/resolution/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/resolution/__pycache__/base.cpython-36.pyc,,
+pip/_internal/resolution/base.py,sha256=xi72YmIS-lEjyK13PN_3qkGGthA4yGoK0C6qWynyHrE,682
+pip/_internal/resolution/legacy/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/resolution/legacy/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/resolution/legacy/__pycache__/resolver.cpython-36.pyc,,
+pip/_internal/resolution/legacy/resolver.py,sha256=d-qW6UUxbZqKyXmX2bqnW5C8UtnO0ZcsQuKw_QXualc,18755
+pip/_internal/resolution/resolvelib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/resolution/resolvelib/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/base.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/candidates.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/factory.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/provider.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/requirements.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/__pycache__/resolver.cpython-36.pyc,,
+pip/_internal/resolution/resolvelib/base.py,sha256=n8Rilea9jCzhlbtFiJKwCwIQSPW0ATjEKsCc0Vpm894,2342
+pip/_internal/resolution/resolvelib/candidates.py,sha256=RHo9r9g25FWzufKv93Ti9nS4hvAPUrhAjSDL7GCZFNQ,20339
+pip/_internal/resolution/resolvelib/factory.py,sha256=--ahYsr-r9zIhdyJJ1ZuETgaQrWiPIqwILWiMDn1IIU,17169
+pip/_internal/resolution/resolvelib/provider.py,sha256=BP8nh07Z1FlcT-Iaw4FblRM-DjUeUkiItKdKARYeM6M,6134
+pip/_internal/resolution/resolvelib/requirements.py,sha256=lGvoHRhkusRfaz4cFxYBoQNqxS6TeuO3K68qlui6g-0,4511
+pip/_internal/resolution/resolvelib/resolver.py,sha256=kI8g0NVlYIsDMRmDplWQdox6WO-0H7CI2wN-1ixnaew,10149
+pip/_internal/self_outdated_check.py,sha256=q6_nqUHPpt-DScwD97h7FCSqd4nI1s-xkpOI4I5Za3Y,6779
+pip/_internal/utils/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_internal/utils/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/appdirs.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/compat.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/compatibility_tags.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/datetime.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/deprecation.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/direct_url_helpers.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/distutils_args.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/encoding.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/entrypoints.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/filesystem.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/filetypes.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/glibc.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/hashes.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/inject_securetransport.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/logging.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/misc.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/models.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/packaging.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/parallel.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/pkg_resources.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/setuptools_build.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/subprocess.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/temp_dir.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/typing.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/unpacking.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/urls.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/virtualenv.cpython-36.pyc,,
+pip/_internal/utils/__pycache__/wheel.cpython-36.pyc,,
+pip/_internal/utils/appdirs.py,sha256=RZzUG-Bkh2b-miX0DSZ3v703_-bgK-v0PfWCCjwVE9g,1349
+pip/_internal/utils/compat.py,sha256=GoCSUMoUmTGeg5irQGLDZ7v12As87yHrMzBXEke-njg,8865
+pip/_internal/utils/compatibility_tags.py,sha256=EtBJj-pstj_U0STUZ8FjlG7YDTjuRZUy6GY1cM86yv8,5439
+pip/_internal/utils/datetime.py,sha256=KL-vIdGU9JIpGB5NYkmwXWkH-G_2mvvABlmRtoSZsao,295
+pip/_internal/utils/deprecation.py,sha256=pBnNogoA4UGTxa_JDnPXBRRYpKMbExAhXpBwAwklOBs,3318
+pip/_internal/utils/direct_url_helpers.py,sha256=bZCBNwPQVyZpYGjX_VcomvVvRHvKw-9JzEV-Ft09LQc,4359
+pip/_internal/utils/distutils_args.py,sha256=a56mblNxk9BGifbpEETG61mmBrqhjtjRkJ4HYn-oOEE,1350
+pip/_internal/utils/encoding.py,sha256=wHDJ25yCT_T4ySscCL3P978OpLrfDCpitg8D64IEXMY,1284
+pip/_internal/utils/entrypoints.py,sha256=vHcNpnksCv6mllihU6hfifdsKPEjwcaJ1aLIXEaynaU,1152
+pip/_internal/utils/filesystem.py,sha256=-fU3XteCAIJwf_9FvCZU7vhywvt3nuf_cqkCdwgy1Y8,6943
+pip/_internal/utils/filetypes.py,sha256=R2FwzoeX7b-rZALOXx5cuO8VPPMhUQ4ne7wm3n3IcWA,571
+pip/_internal/utils/glibc.py,sha256=LOeNGgawCKS-4ke9fii78fwXD73dtNav3uxz1Bf-Ab8,3297
+pip/_internal/utils/hashes.py,sha256=xHmrqNwC1eBN0oY0R_RXLJLXGvFdo5gwmbz_pas94k8,4358
+pip/_internal/utils/inject_securetransport.py,sha256=M17ZlFVY66ApgeASVjKKLKNz0LAfk-SyU0HZ4ZB6MmI,810
+pip/_internal/utils/logging.py,sha256=YIfuDUEkmdn9cIRQ_Ec8rgXs1m5nOwDECtZqM4CBH5U,13093
+pip/_internal/utils/misc.py,sha256=QQZWMJkKKADPSWQYmrwlasc8b03eCcghn0yDNprYgrI,28001
+pip/_internal/utils/models.py,sha256=HqiBVtTbW_b_Umvj2fjhDWOHo2RKhPwSz4iAYkQZ688,1201
+pip/_internal/utils/packaging.py,sha256=VtiwcAAL7LBi7tGL2je7LeW4bE11KMHGCsJ1NZY5XtM,3035
+pip/_internal/utils/parallel.py,sha256=7az3aaTMCkqpaLFbpYYOvk0rj7Hu5YH1NPXXomqjgf4,3404
+pip/_internal/utils/pkg_resources.py,sha256=ZX-k7V5q_aNWyDse92nN7orN1aCpRLsaxzpkBZ1XKzU,1254
+pip/_internal/utils/setuptools_build.py,sha256=E1KswI7wfNnCDE5R6G8c9ZbByENpu7NqocjY26PCQDw,5058
+pip/_internal/utils/subprocess.py,sha256=UkPe89gcjxBMx73uutoeJXgD3kwdlL6YO16BkjDdVSI,9924
+pip/_internal/utils/temp_dir.py,sha256=blmG0jEvEgdxbYUt_V15bgcTIJIrxZwAw8QZlCTJYDE,8378
+pip/_internal/utils/typing.py,sha256=xkYwOeHlf4zsHXBDC4310HtEqwhQcYXFPq2h35Tcrl0,1401
+pip/_internal/utils/unpacking.py,sha256=YFAckhqqvmehA8Kan5vd3b1kN_9TafqmOk4b-yz4fho,9488
+pip/_internal/utils/urls.py,sha256=q2rw1kMiiig_XZcoyJSsWMJQqYw-2wUmrMoST4mCW_I,1527
+pip/_internal/utils/virtualenv.py,sha256=fNGrRp-8QmNL5OzXajBd-z7PbwOsx1XY6G-AVMAhfso,3706
+pip/_internal/utils/wheel.py,sha256=wFzn3h8GqYvgsyWPZtUyn0Rb3MJzmtyP3owMOhKnmL0,7303
+pip/_internal/vcs/__init__.py,sha256=viJxJRqRE_mVScum85bgQIXAd6o0ozFt18VpC-qIJrM,617
+pip/_internal/vcs/__pycache__/__init__.cpython-36.pyc,,
+pip/_internal/vcs/__pycache__/bazaar.cpython-36.pyc,,
+pip/_internal/vcs/__pycache__/git.cpython-36.pyc,,
+pip/_internal/vcs/__pycache__/mercurial.cpython-36.pyc,,
+pip/_internal/vcs/__pycache__/subversion.cpython-36.pyc,,
+pip/_internal/vcs/__pycache__/versioncontrol.cpython-36.pyc,,
+pip/_internal/vcs/bazaar.py,sha256=5rRR02uDZTLaxQT-R5Obd8FZDOMlShqYds-pwVSJJs8,3887
+pip/_internal/vcs/git.py,sha256=kvB729wrKY0OWMSgOS1pUly4LosZp8utrd3kOQsWalA,13985
+pip/_internal/vcs/mercurial.py,sha256=FzCGmYzVZvB-vyM73fKcQk2B4jMNXGnXlQ2bJ7nmglM,5162
+pip/_internal/vcs/subversion.py,sha256=rldcn9ZDt5twjNPzFn_FKRn4qdfkjlxHMJEsR2MFfoA,12399
+pip/_internal/vcs/versioncontrol.py,sha256=WpxeTRC0NoGB2uXJdmfq4pPxY-p7sk1rV_WkxMxgzQA,25966
+pip/_internal/wheel_builder.py,sha256=6w1VPXrpUvCCPlV0cI1wNaCqNz4laF6B6whvaxl9cns,9522
+pip/_vendor/__init__.py,sha256=CsxnpYPbi_2agrDI79iQrCmQeZRcwwIF0C6cm_1RynU,4588
+pip/_vendor/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/__pycache__/appdirs.cpython-36.pyc,,
+pip/_vendor/__pycache__/contextlib2.cpython-36.pyc,,
+pip/_vendor/__pycache__/distro.cpython-36.pyc,,
+pip/_vendor/__pycache__/ipaddress.cpython-36.pyc,,
+pip/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
+pip/_vendor/__pycache__/retrying.cpython-36.pyc,,
+pip/_vendor/__pycache__/six.cpython-36.pyc,,
+pip/_vendor/appdirs.py,sha256=M6IYRJtdZgmSPCXCSMBRB0VT3P8MdFbWCDbSLrB2Ebg,25907
+pip/_vendor/cachecontrol/__init__.py,sha256=pJtAaUxOsMPnytI1A3juAJkXYDr8krdSnsg4Yg3OBEg,302
+pip/_vendor/cachecontrol/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/_cmd.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/adapter.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/cache.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/controller.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/filewrapper.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/heuristics.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/serialize.cpython-36.pyc,,
+pip/_vendor/cachecontrol/__pycache__/wrapper.cpython-36.pyc,,
+pip/_vendor/cachecontrol/_cmd.py,sha256=URGE0KrA87QekCG3SGPatlSPT571dZTDjNa-ZXX3pDc,1295
+pip/_vendor/cachecontrol/adapter.py,sha256=sSwaSYd93IIfCFU4tOMgSo6b2LCt_gBSaQUj8ktJFOA,4882
+pip/_vendor/cachecontrol/cache.py,sha256=1fc4wJP8HYt1ycnJXeEw5pCpeBL2Cqxx6g9Fb0AYDWQ,805
+pip/_vendor/cachecontrol/caches/__init__.py,sha256=-gHNKYvaeD0kOk5M74eOrsSgIKUtC6i6GfbmugGweEo,86
+pip/_vendor/cachecontrol/caches/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/cachecontrol/caches/__pycache__/file_cache.cpython-36.pyc,,
+pip/_vendor/cachecontrol/caches/__pycache__/redis_cache.cpython-36.pyc,,
+pip/_vendor/cachecontrol/caches/file_cache.py,sha256=nYVKsJtXh6gJXvdn1iWyrhxvkwpQrK-eKoMRzuiwkKk,4153
+pip/_vendor/cachecontrol/caches/redis_cache.py,sha256=HxelMpNCo-dYr2fiJDwM3hhhRmxUYtB5tXm1GpAAT4Y,856
+pip/_vendor/cachecontrol/compat.py,sha256=kHNvMRdt6s_Xwqq_9qJmr9ou3wYMOMUMxPPcwNxT8Mc,695
+pip/_vendor/cachecontrol/controller.py,sha256=CWEX3pedIM9s60suf4zZPtm_JvVgnvogMGK_OiBG5F8,14149
+pip/_vendor/cachecontrol/filewrapper.py,sha256=vACKO8Llzu_ZWyjV1Fxn1MA4TGU60N5N3GSrAFdAY2Q,2533
+pip/_vendor/cachecontrol/heuristics.py,sha256=BFGHJ3yQcxvZizfo90LLZ04T_Z5XSCXvFotrp7Us0sc,4070
+pip/_vendor/cachecontrol/serialize.py,sha256=vIa4jvq4x_KSOLdEIedoknX2aXYHQujLDFV4-F21Dno,7091
+pip/_vendor/cachecontrol/wrapper.py,sha256=5LX0uJwkNQUtYSEw3aGmGu9WY8wGipd81mJ8lG0d0M4,690
+pip/_vendor/certifi/__init__.py,sha256=u1E_DrSGj_nnEkK5VglvEqP8D80KpghLVWL0A_pq41A,62
+pip/_vendor/certifi/__main__.py,sha256=1k3Cr95vCxxGRGDljrW3wMdpZdL3Nhf0u1n-k2qdsCY,255
+pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc,,
+pip/_vendor/certifi/__pycache__/core.cpython-36.pyc,,
+pip/_vendor/certifi/cacert.pem,sha256=GhT24f0R7_9y4YY_hkXwkO7BthZhRGDCEMO348E9S14,282394
+pip/_vendor/certifi/core.py,sha256=jBrwKEWpG0IKcuozK0BQ2HHGp8adXAOyBPC7ddgR6vM,2315
+pip/_vendor/chardet/__init__.py,sha256=YsP5wQlsHJ2auF1RZJfypiSrCA7_bQiRm3ES_NI76-Y,1559
+pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc,,
+pip/_vendor/chardet/__pycache__/version.cpython-36.pyc,,
+pip/_vendor/chardet/big5freq.py,sha256=D_zK5GyzoVsRes0HkLJziltFQX0bKCLOrFe9_xDvO_8,31254
+pip/_vendor/chardet/big5prober.py,sha256=kBxHbdetBpPe7xrlb-e990iot64g_eGSLd32lB7_h3M,1757
+pip/_vendor/chardet/chardistribution.py,sha256=3woWS62KrGooKyqz4zQSnjFbJpa6V7g02daAibTwcl8,9411
+pip/_vendor/chardet/charsetgroupprober.py,sha256=6bDu8YIiRuScX4ca9Igb0U69TA2PGXXDej6Cc4_9kO4,3787
+pip/_vendor/chardet/charsetprober.py,sha256=KSmwJErjypyj0bRZmC5F5eM7c8YQgLYIjZXintZNstg,5110
+pip/_vendor/chardet/cli/__init__.py,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
+pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc,,
+pip/_vendor/chardet/cli/chardetect.py,sha256=DI8dlV3FBD0c0XA_y3sQ78z754DUv1J8n34RtDjOXNw,2774
+pip/_vendor/chardet/codingstatemachine.py,sha256=VYp_6cyyki5sHgXDSZnXW4q1oelHc3cu9AyQTX7uug8,3590
+pip/_vendor/chardet/compat.py,sha256=PKTzHkSbtbHDqS9PyujMbX74q1a8mMpeQTDVsQhZMRw,1134
+pip/_vendor/chardet/cp949prober.py,sha256=TZ434QX8zzBsnUvL_8wm4AQVTZ2ZkqEEQL_lNw9f9ow,1855
+pip/_vendor/chardet/enums.py,sha256=Aimwdb9as1dJKZaFNUH2OhWIVBVd6ZkJJ_WK5sNY8cU,1661
+pip/_vendor/chardet/escprober.py,sha256=kkyqVg1Yw3DIOAMJ2bdlyQgUFQhuHAW8dUGskToNWSc,3950
+pip/_vendor/chardet/escsm.py,sha256=RuXlgNvTIDarndvllNCk5WZBIpdCxQ0kcd9EAuxUh84,10510
+pip/_vendor/chardet/eucjpprober.py,sha256=iD8Jdp0ISRjgjiVN7f0e8xGeQJ5GM2oeZ1dA8nbSeUw,3749
+pip/_vendor/chardet/euckrfreq.py,sha256=-7GdmvgWez4-eO4SuXpa7tBiDi5vRXQ8WvdFAzVaSfo,13546
+pip/_vendor/chardet/euckrprober.py,sha256=MqFMTQXxW4HbzIpZ9lKDHB3GN8SP4yiHenTmf8g_PxY,1748
+pip/_vendor/chardet/euctwfreq.py,sha256=No1WyduFOgB5VITUA7PLyC5oJRNzRyMbBxaKI1l16MA,31621
+pip/_vendor/chardet/euctwprober.py,sha256=13p6EP4yRaxqnP4iHtxHOJ6R2zxHq1_m8hTRjzVZ95c,1747
+pip/_vendor/chardet/gb2312freq.py,sha256=JX8lsweKLmnCwmk8UHEQsLgkr_rP_kEbvivC4qPOrlc,20715
+pip/_vendor/chardet/gb2312prober.py,sha256=gGvIWi9WhDjE-xQXHvNIyrnLvEbMAYgyUSZ65HUfylw,1754
+pip/_vendor/chardet/hebrewprober.py,sha256=c3SZ-K7hvyzGY6JRAZxJgwJ_sUS9k0WYkvMY00YBYFo,13838
+pip/_vendor/chardet/jisfreq.py,sha256=vpmJv2Bu0J8gnMVRPHMFefTRvo_ha1mryLig8CBwgOg,25777
+pip/_vendor/chardet/jpcntx.py,sha256=PYlNqRUQT8LM3cT5FmHGP0iiscFlTWED92MALvBungo,19643
+pip/_vendor/chardet/langbulgarianmodel.py,sha256=1HqQS9Pbtnj1xQgxitJMvw8X6kKr5OockNCZWfEQrPE,12839
+pip/_vendor/chardet/langcyrillicmodel.py,sha256=LODajvsetH87yYDDQKA2CULXUH87tI223dhfjh9Zx9c,17948
+pip/_vendor/chardet/langgreekmodel.py,sha256=8YAW7bU8YwSJap0kIJSbPMw1BEqzGjWzqcqf0WgUKAA,12688
+pip/_vendor/chardet/langhebrewmodel.py,sha256=JSnqmE5E62tDLTPTvLpQsg5gOMO4PbdWRvV7Avkc0HA,11345
+pip/_vendor/chardet/langhungarianmodel.py,sha256=RhapYSG5l0ZaO-VV4Fan5sW0WRGQqhwBM61yx3yxyOA,12592
+pip/_vendor/chardet/langthaimodel.py,sha256=8l0173Gu_W6G8mxmQOTEF4ls2YdE7FxWf3QkSxEGXJQ,11290
+pip/_vendor/chardet/langturkishmodel.py,sha256=W22eRNJsqI6uWAfwXSKVWWnCerYqrI8dZQTm_M0lRFk,11102
+pip/_vendor/chardet/latin1prober.py,sha256=S2IoORhFk39FEFOlSFWtgVybRiP6h7BlLldHVclNkU8,5370
+pip/_vendor/chardet/mbcharsetprober.py,sha256=AR95eFH9vuqSfvLQZN-L5ijea25NOBCoXqw8s5O9xLQ,3413
+pip/_vendor/chardet/mbcsgroupprober.py,sha256=h6TRnnYq2OxG1WdD5JOyxcdVpn7dG0q-vB8nWr5mbh4,2012
+pip/_vendor/chardet/mbcssm.py,sha256=SY32wVIF3HzcjY3BaEspy9metbNSKxIIB0RKPn7tjpI,25481
+pip/_vendor/chardet/sbcharsetprober.py,sha256=LDSpCldDCFlYwUkGkwD2oFxLlPWIWXT09akH_2PiY74,5657
+pip/_vendor/chardet/sbcsgroupprober.py,sha256=1IprcCB_k1qfmnxGC6MBbxELlKqD3scW6S8YIwdeyXA,3546
+pip/_vendor/chardet/sjisprober.py,sha256=IIt-lZj0WJqK4rmUZzKZP4GJlE8KUEtFYVuY96ek5MQ,3774
+pip/_vendor/chardet/universaldetector.py,sha256=qL0174lSZE442eB21nnktT9_VcAye07laFWUeUrjttY,12485
+pip/_vendor/chardet/utf8prober.py,sha256=IdD8v3zWOsB8OLiyPi-y_fqwipRFxV9Nc1eKBLSuIEw,2766
+pip/_vendor/chardet/version.py,sha256=sp3B08mrDXB-pf3K9fqJ_zeDHOCLC8RrngQyDFap_7g,242
+pip/_vendor/colorama/__init__.py,sha256=DqjXH9URVP3IJwmMt7peYw50ns1RNAymIB9-XdPEFV8,239
+pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc,,
+pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc,,
+pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc,,
+pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc,,
+pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc,,
+pip/_vendor/colorama/ansi.py,sha256=Fi0un-QLqRm-v7o_nKiOqyC8PapBJK7DLV_q9LKtTO0,2524
+pip/_vendor/colorama/ansitowin32.py,sha256=u8QaqdqS_xYSfNkPM1eRJLHz6JMWPodaJaP0mxgHCDc,10462
+pip/_vendor/colorama/initialise.py,sha256=PprovDNxMTrvoNHFcL2NZjpH2XzDc8BLxLxiErfUl4k,1915
+pip/_vendor/colorama/win32.py,sha256=bJ8Il9jwaBN5BJ8bmN6FoYZ1QYuMKv2j8fGrXh7TJjw,5404
+pip/_vendor/colorama/winterm.py,sha256=2y_2b7Zsv34feAsP67mLOVc-Bgq51mdYGo571VprlrM,6438
+pip/_vendor/contextlib2.py,sha256=5HjGflUzwWAUfcILhSmC2GqvoYdZZzFzVfIDztHigUs,16915
+pip/_vendor/distlib/__init__.py,sha256=3veAk2rPznOB2gsK6tjbbh0TQMmGE5P82eE9wXq6NIk,581
+pip/_vendor/distlib/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/database.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/index.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/locators.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/manifest.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/markers.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/metadata.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/resources.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/scripts.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/util.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/version.cpython-36.pyc,,
+pip/_vendor/distlib/__pycache__/wheel.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/__init__.py,sha256=bqS_dTOH6uW9iGgd0uzfpPjo6vZ4xpPZ7kyfZJ2vNaw,274
+pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.pyc,,
+pip/_vendor/distlib/_backport/misc.py,sha256=KWecINdbFNOxSOP1fGF680CJnaC6S4fBRgEtaYTw0ig,971
+pip/_vendor/distlib/_backport/shutil.py,sha256=IX_G2NPqwecJibkIDje04bqu0xpHkfSQ2GaGdEVqM5Y,25707
+pip/_vendor/distlib/_backport/sysconfig.cfg,sha256=swZKxq9RY5e9r3PXCrlvQPMsvOdiWZBTHLEbqS8LJLU,2617
+pip/_vendor/distlib/_backport/sysconfig.py,sha256=BQHFlb6pubCl_dvT1NjtzIthylofjKisox239stDg0U,26854
+pip/_vendor/distlib/_backport/tarfile.py,sha256=Ihp7rXRcjbIKw8COm9wSePV9ARGXbSF9gGXAMn2Q-KU,92628
+pip/_vendor/distlib/compat.py,sha256=ADA56xiAxar3mU6qemlBhNbsrFPosXRhO44RzsbJPqk,41408
+pip/_vendor/distlib/database.py,sha256=Kl0YvPQKc4OcpVi7k5cFziydM1xOK8iqdxLGXgbZHV4,51059
+pip/_vendor/distlib/index.py,sha256=SXKzpQCERctxYDMp_OLee2f0J0e19ZhGdCIoMlUfUQM,21066
+pip/_vendor/distlib/locators.py,sha256=c9E4cDEacJ_uKbuE5BqAVocoWp6rsuBGTkiNDQq3zV4,52100
+pip/_vendor/distlib/manifest.py,sha256=nQEhYmgoreaBZzyFzwYsXxJARu3fo4EkunU163U16iE,14811
+pip/_vendor/distlib/markers.py,sha256=6Ac3cCfFBERexiESWIOXmg-apIP8l2esafNSX3KMy-8,4387
+pip/_vendor/distlib/metadata.py,sha256=z2KPy3h3tcDnb9Xs7nAqQ5Oz0bqjWAUFmKWcFKRoodg,38962
+pip/_vendor/distlib/resources.py,sha256=2FGv0ZHF14KXjLIlL0R991lyQQGcewOS4mJ-5n-JVnc,10766
+pip/_vendor/distlib/scripts.py,sha256=_MAj3sMuv56kuM8FsiIWXqbT0gmumPGaOR_atOzn4a4,17180
+pip/_vendor/distlib/t32.exe,sha256=NS3xBCVAld35JVFNmb-1QRyVtThukMrwZVeXn4LhaEQ,96768
+pip/_vendor/distlib/t64.exe,sha256=oAqHes78rUWVM0OtVqIhUvequl_PKhAhXYQWnUf7zR0,105984
+pip/_vendor/distlib/util.py,sha256=f2jZCPrcLCt6LcnC0gUy-Fur60tXD8reA7k4rDpHMDw,59845
+pip/_vendor/distlib/version.py,sha256=_n7F6juvQGAcn769E_SHa7fOcf5ERlEVymJ_EjPRwGw,23391
+pip/_vendor/distlib/w32.exe,sha256=lJtnZdeUxTZWya_EW5DZos_K5rswRECGspIl8ZJCIXs,90112
+pip/_vendor/distlib/w64.exe,sha256=0aRzoN2BO9NWW4ENy4_4vHkHR4qZTFZNVSAJJYlODTI,99840
+pip/_vendor/distlib/wheel.py,sha256=v6DnwTqhNHwrEVFr8_YeiTW6G4ftP_evsywNgrmdb2o,41144
+pip/_vendor/distro.py,sha256=xxMIh2a3KmippeWEHzynTdHT3_jZM0o-pos0dAWJROM,43628
+pip/_vendor/html5lib/__init__.py,sha256=BYzcKCqeEii52xDrqBFruhnmtmkiuHXFyFh-cglQ8mk,1160
+pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc,,
+pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc,,
+pip/_vendor/html5lib/_ihatexml.py,sha256=ifOwF7pXqmyThIXc3boWc96s4MDezqRrRVp7FwDYUFs,16728
+pip/_vendor/html5lib/_inputstream.py,sha256=jErNASMlkgs7MpOM9Ve_VdLDJyFFweAjLuhVutZz33U,32353
+pip/_vendor/html5lib/_tokenizer.py,sha256=04mgA2sNTniutl2fxFv-ei5bns4iRaPxVXXHh_HrV_4,77040
+pip/_vendor/html5lib/_trie/__init__.py,sha256=nqfgO910329BEVJ5T4psVwQtjd2iJyEXQ2-X8c1YxwU,109
+pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc,,
+pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc,,
+pip/_vendor/html5lib/_trie/_base.py,sha256=CaybYyMro8uERQYjby2tTeSUatnWDfWroUN9N7ety5w,1013
+pip/_vendor/html5lib/_trie/py.py,sha256=wXmQLrZRf4MyWNyg0m3h81m9InhLR7GJ002mIIZh-8o,1775
+pip/_vendor/html5lib/_utils.py,sha256=Dx9AKntksRjFT1veBj7I362pf5OgIaT0zglwq43RnfU,4931
+pip/_vendor/html5lib/constants.py,sha256=Ll-yzLU_jcjyAI_h57zkqZ7aQWE5t5xA4y_jQgoUUhw,83464
+pip/_vendor/html5lib/filters/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc,,
+pip/_vendor/html5lib/filters/alphabeticalattributes.py,sha256=lViZc2JMCclXi_5gduvmdzrRxtO5Xo9ONnbHBVCsykU,919
+pip/_vendor/html5lib/filters/base.py,sha256=z-IU9ZAYjpsVsqmVt7kuWC63jR11hDMr6CVrvuao8W0,286
+pip/_vendor/html5lib/filters/inject_meta_charset.py,sha256=egDXUEHXmAG9504xz0K6ALDgYkvUrC2q15YUVeNlVQg,2945
+pip/_vendor/html5lib/filters/lint.py,sha256=jk6q56xY0ojiYfvpdP-OZSm9eTqcAdRqhCoPItemPYA,3643
+pip/_vendor/html5lib/filters/optionaltags.py,sha256=8lWT75J0aBOHmPgfmqTHSfPpPMp01T84NKu0CRedxcE,10588
+pip/_vendor/html5lib/filters/sanitizer.py,sha256=m6oGmkBhkGAnn2nV6D4hE78SCZ6WEnK9rKdZB3uXBIc,26897
+pip/_vendor/html5lib/filters/whitespace.py,sha256=8eWqZxd4UC4zlFGW6iyY6f-2uuT8pOCSALc3IZt7_t4,1214
+pip/_vendor/html5lib/html5parser.py,sha256=anr-aXre_ImfrkQ35c_rftKXxC80vJCREKe06Tq15HA,117186
+pip/_vendor/html5lib/serializer.py,sha256=_PpvcZF07cwE7xr9uKkZqh5f4UEaI8ltCU2xPJzaTpk,15759
+pip/_vendor/html5lib/treeadapters/__init__.py,sha256=A0rY5gXIe4bJOiSGRO_j_tFhngRBO8QZPzPtPw5dFzo,679
+pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc,,
+pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc,,
+pip/_vendor/html5lib/treeadapters/genshi.py,sha256=CH27pAsDKmu4ZGkAUrwty7u0KauGLCZRLPMzaO3M5vo,1715
+pip/_vendor/html5lib/treeadapters/sax.py,sha256=BKS8woQTnKiqeffHsxChUqL4q2ZR_wb5fc9MJ3zQC8s,1776
+pip/_vendor/html5lib/treebuilders/__init__.py,sha256=AysSJyvPfikCMMsTVvaxwkgDieELD5dfR8FJIAuq7hY,3592
+pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc,,
+pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc,,
+pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc,,
+pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc,,
+pip/_vendor/html5lib/treebuilders/base.py,sha256=z-o51vt9r_l2IDG5IioTOKGzZne4Fy3_Fc-7ztrOh4I,14565
+pip/_vendor/html5lib/treebuilders/dom.py,sha256=22whb0C71zXIsai5mamg6qzBEiigcBIvaDy4Asw3at0,8925
+pip/_vendor/html5lib/treebuilders/etree.py,sha256=w5ZFpKk6bAxnrwD2_BrF5EVC7vzz0L3LMi9Sxrbc_8w,12836
+pip/_vendor/html5lib/treebuilders/etree_lxml.py,sha256=9gqDjs-IxsPhBYa5cpvv2FZ1KZlG83Giusy2lFmvIkE,14766
+pip/_vendor/html5lib/treewalkers/__init__.py,sha256=OBPtc1TU5mGyy18QDMxKEyYEz0wxFUUNj5v0-XgmYhY,5719
+pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc,,
+pip/_vendor/html5lib/treewalkers/base.py,sha256=ouiOsuSzvI0KgzdWP8PlxIaSNs9falhbiinAEc_UIJY,7476
+pip/_vendor/html5lib/treewalkers/dom.py,sha256=EHyFR8D8lYNnyDU9lx_IKigVJRyecUGua0mOi7HBukc,1413
+pip/_vendor/html5lib/treewalkers/etree.py,sha256=xo1L5m9VtkfpFJK0pFmkLVajhqYYVisVZn3k9kYpPkI,4551
+pip/_vendor/html5lib/treewalkers/etree_lxml.py,sha256=_b0LAVWLcVu9WaU_-w3D8f0IRSpCbjf667V-3NRdhTw,6357
+pip/_vendor/html5lib/treewalkers/genshi.py,sha256=4D2PECZ5n3ZN3qu3jMl9yY7B81jnQApBQSVlfaIuYbA,2309
+pip/_vendor/idna/__init__.py,sha256=9Nt7xpyet3DmOrPUGooDdAwmHZZu1qUAy2EaJ93kGiQ,58
+pip/_vendor/idna/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/codec.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/core.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/idnadata.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/intranges.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/package_data.cpython-36.pyc,,
+pip/_vendor/idna/__pycache__/uts46data.cpython-36.pyc,,
+pip/_vendor/idna/codec.py,sha256=lvYb7yu7PhAqFaAIAdWcwgaWI2UmgseUua-1c0AsG0A,3299
+pip/_vendor/idna/compat.py,sha256=R-h29D-6mrnJzbXxymrWUW7iZUvy-26TQwZ0ij57i4U,232
+pip/_vendor/idna/core.py,sha256=jCoaLb3bA2tS_DDx9PpGuNTEZZN2jAzB369aP-IHYRE,11951
+pip/_vendor/idna/idnadata.py,sha256=gmzFwZWjdms3kKZ_M_vwz7-LP_SCgYfSeE03B21Qpsk,42350
+pip/_vendor/idna/intranges.py,sha256=TY1lpxZIQWEP6tNqjZkFA5hgoMWOj1OBmnUG8ihT87E,1749
+pip/_vendor/idna/package_data.py,sha256=bxBjpLnE06_1jSYKEy5svOMu1zM3OMztXVUb1tPlcp0,22
+pip/_vendor/idna/uts46data.py,sha256=lMdw2zdjkH1JUWXPPEfFUSYT3Fyj60bBmfLvvy5m7ko,202084
+pip/_vendor/ipaddress.py,sha256=-0RmurI31XgAaN20WCi0zrcuoat90nNA70_6yGlx2PU,79875
+pip/_vendor/msgpack/__init__.py,sha256=2gJwcsTIaAtCM0GMi2rU-_Y6kILeeQuqRkrQ22jSANc,1118
+pip/_vendor/msgpack/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/msgpack/__pycache__/_version.cpython-36.pyc,,
+pip/_vendor/msgpack/__pycache__/exceptions.cpython-36.pyc,,
+pip/_vendor/msgpack/__pycache__/ext.cpython-36.pyc,,
+pip/_vendor/msgpack/__pycache__/fallback.cpython-36.pyc,,
+pip/_vendor/msgpack/_version.py,sha256=hu7lzmZ_ClOaOOmRsWb4xomhzQ4UIsLsvv8KY6UysHE,20
+pip/_vendor/msgpack/exceptions.py,sha256=dCTWei8dpkrMsQDcjQk74ATl9HsIBH0ybt8zOPNqMYc,1081
+pip/_vendor/msgpack/ext.py,sha256=nV19BzE9Be8SJHrxxYJHFbvEHJaXcP3avRkHVp5wovM,6034
+pip/_vendor/msgpack/fallback.py,sha256=Z8V3iYUUPqKVy4WWTk64Vq3G0PylQIOmlWvgnMhmkdU,37133
+pip/_vendor/packaging/__about__.py,sha256=PNMsaZn4UcCHyubgROH1bl6CluduPjI5kFrSp_Zgklo,736
+pip/_vendor/packaging/__init__.py,sha256=6enbp5XgRfjBjsI9-bn00HjHf5TH21PDMOKkJW8xw-w,562
+pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/_typing.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/tags.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
+pip/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
+pip/_vendor/packaging/_compat.py,sha256=MXdsGpSE_W-ZrHoC87andI4LV2FAwU7HLL-eHe_CjhU,1128
+pip/_vendor/packaging/_structures.py,sha256=ozkCX8Q8f2qE1Eic3YiQ4buDVfgz2iYevY9e7R2y3iY,2022
+pip/_vendor/packaging/_typing.py,sha256=VgA0AAvsc97KB5nF89zoudOyCMEsV7FlaXzZbYqEkzA,1824
+pip/_vendor/packaging/markers.py,sha256=V_RdoQqOUbSfy7y9o2vRk7BkzAh3yneC82cuWpKrqOg,9491
+pip/_vendor/packaging/requirements.py,sha256=F93hkn7i8NKRZP-FtdTIlhz1PUsRjhe6eRbsBXX0Uh4,4903
+pip/_vendor/packaging/specifiers.py,sha256=uYp9l13F0LcknS6d4N60ytiBgFmIhKideOq9AnsxTco,31944
+pip/_vendor/packaging/tags.py,sha256=NKMS37Zo_nWrZxgsD6zbXsXgc9edn9m160cBiLmHJdE,24067
+pip/_vendor/packaging/utils.py,sha256=RShlvnjO2CtYSD8uri32frMMFMTmB-3ihsq1-ghzLEw,1811
+pip/_vendor/packaging/version.py,sha256=Cnbm-OO9D_qd8ZTFxzFcjSavexSYFZmyeaoPvMsjgPc,15470
+pip/_vendor/pep517/__init__.py,sha256=r5uA106NGJa3slspaD2m32aFpFUiZX-mZ9vIlzAEOp4,84
+pip/_vendor/pep517/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/_in_process.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/build.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/check.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/colorlog.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/dirtools.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/envbuild.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/meta.cpython-36.pyc,,
+pip/_vendor/pep517/__pycache__/wrappers.cpython-36.pyc,,
+pip/_vendor/pep517/_in_process.py,sha256=XrKOTURJdia5R7i3i_OQmS89LASFXE3HQXfX63qZBIE,8438
+pip/_vendor/pep517/build.py,sha256=DN4ouyj_bd00knOKqv0KHRtN0-JezJoNNZQmcDi4juk,3335
+pip/_vendor/pep517/check.py,sha256=YoaNE3poJGpz96biVCYwtcDshwEGE2HRU5KKya9yfpY,5961
+pip/_vendor/pep517/colorlog.py,sha256=Tk9AuYm_cLF3BKTBoSTJt9bRryn0aFojIQOwbfVUTxQ,4098
+pip/_vendor/pep517/compat.py,sha256=M-5s4VNp8rjyT76ZZ_ibnPD44DYVzSQlyCEHayjtDPw,780
+pip/_vendor/pep517/dirtools.py,sha256=2mkAkAL0mRz_elYFjRKuekTJVipH1zTn4tbf1EDev84,1129
+pip/_vendor/pep517/envbuild.py,sha256=szKUFlO50X1ahQfXwz4hD9V2VE_bz9MLVPIeidsFo4w,6041
+pip/_vendor/pep517/meta.py,sha256=8mnM5lDnT4zXQpBTliJbRGfesH7iioHwozbDxALPS9Y,2463
+pip/_vendor/pep517/wrappers.py,sha256=yFU4Lp7TIYbmuVOTY-pXnlyGZ3F_grIi-JlLkpGN8Gk,10783
+pip/_vendor/pkg_resources/__init__.py,sha256=XpGBfvS9fafA6bm5rx7vnxdxs7yqyoc_NnpzKApkJ64,108277
+pip/_vendor/pkg_resources/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/pkg_resources/__pycache__/py31compat.cpython-36.pyc,,
+pip/_vendor/pkg_resources/py31compat.py,sha256=CRk8fkiPRDLsbi5pZcKsHI__Pbmh_94L8mr9Qy9Ab2U,562
+pip/_vendor/progress/__init__.py,sha256=fcbQQXo5np2CoQyhSH5XprkicwLZNLePR3uIahznSO0,4857
+pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/progress/__pycache__/bar.cpython-36.pyc,,
+pip/_vendor/progress/__pycache__/counter.cpython-36.pyc,,
+pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc,,
+pip/_vendor/progress/bar.py,sha256=QuDuVNcmXgpxtNtxO0Fq72xKigxABaVmxYGBw4J3Z_E,2854
+pip/_vendor/progress/counter.py,sha256=MznyBrvPWrOlGe4MZAlGUb9q3aODe6_aNYeAE_VNoYA,1372
+pip/_vendor/progress/spinner.py,sha256=k8JbDW94T0-WXuXfxZIFhdoNPYp3jfnpXqBnfRv5fGs,1380
+pip/_vendor/pyparsing.py,sha256=J1b4z3S_KwyJW7hKGnoN-hXW9pgMIzIP6QThyY5yJq4,273394
+pip/_vendor/requests/__init__.py,sha256=orzv4-1uejMDc2v3LnTVneINGXiwqXSfrASoFBsYblE,4465
+pip/_vendor/requests/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/__version__.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/_internal_utils.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/adapters.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/api.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/auth.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/certs.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/compat.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/cookies.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/exceptions.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/help.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/hooks.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/models.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/packages.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/sessions.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/status_codes.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/structures.cpython-36.pyc,,
+pip/_vendor/requests/__pycache__/utils.cpython-36.pyc,,
+pip/_vendor/requests/__version__.py,sha256=Xwky1FMlMkJJGidBM50JC7FKcosWzkjIW-WhQGrBdFM,441
+pip/_vendor/requests/_internal_utils.py,sha256=Zx3PnEUccyfsB-ie11nZVAW8qClJy0gx1qNME7rgT18,1096
+pip/_vendor/requests/adapters.py,sha256=e-bmKEApNVqFdylxuMJJfiaHdlmS_zhWhIMEzlHvGuc,21548
+pip/_vendor/requests/api.py,sha256=PlHM-HT3PQ5lyufoeGmV-nJxRi7UnUyGVh7OV7B9XV4,6496
+pip/_vendor/requests/auth.py,sha256=OMoJIVKyRLy9THr91y8rxysZuclwPB-K1Xg1zBomUhQ,10207
+pip/_vendor/requests/certs.py,sha256=nXRVq9DtGmv_1AYbwjTu9UrgAcdJv05ZvkNeaoLOZxY,465
+pip/_vendor/requests/compat.py,sha256=LQWuCR4qXk6w7-qQopXyz0WNHUdAD40k0mKnaAEf1-g,2045
+pip/_vendor/requests/cookies.py,sha256=Y-bKX6TvW3FnYlE6Au0SXtVVWcaNdFvuAwQxw-G0iTI,18430
+pip/_vendor/requests/exceptions.py,sha256=d9fJJw8YFBB9VzG9qhvxLuOx6be3c_Dwbck-dVUEAcs,3173
+pip/_vendor/requests/help.py,sha256=SJPVcoXeo7KfK4AxJN5eFVQCjr0im87tU2n7ubLsksU,3578
+pip/_vendor/requests/hooks.py,sha256=QReGyy0bRcr5rkwCuObNakbYsc7EkiKeBwG4qHekr2Q,757
+pip/_vendor/requests/models.py,sha256=_tKIbrscbGvaTdX1UHCwRaiYmPF9VBIuBeydr4Qx1Tg,34287
+pip/_vendor/requests/packages.py,sha256=njJmVifY4aSctuW3PP5EFRCxjEwMRDO6J_feG2dKWsI,695
+pip/_vendor/requests/sessions.py,sha256=OBtwQs1vjkB1xamFdi_p5y8BVeX16BJoQcwSwx_Y3fI,29316
+pip/_vendor/requests/status_codes.py,sha256=gT79Pbs_cQjBgp-fvrUgg1dn2DQO32bDj4TInjnMPSc,4188
+pip/_vendor/requests/structures.py,sha256=msAtr9mq1JxHd-JRyiILfdFlpbJwvvFuP3rfUQT_QxE,3005
+pip/_vendor/requests/utils.py,sha256=VBs99cvV8Z29WGXeWZqHzZ80_nu1AwwjYzJfe0wQIvs,30176
+pip/_vendor/resolvelib/__init__.py,sha256=sqMOy4CbVJQiaG9bCPj0oAntGAVy-RWdPfVaC9XDIEQ,537
+pip/_vendor/resolvelib/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/resolvelib/__pycache__/providers.cpython-36.pyc,,
+pip/_vendor/resolvelib/__pycache__/reporters.cpython-36.pyc,,
+pip/_vendor/resolvelib/__pycache__/resolvers.cpython-36.pyc,,
+pip/_vendor/resolvelib/__pycache__/structs.cpython-36.pyc,,
+pip/_vendor/resolvelib/compat/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_vendor/resolvelib/compat/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/resolvelib/compat/__pycache__/collections_abc.cpython-36.pyc,,
+pip/_vendor/resolvelib/compat/collections_abc.py,sha256=mtTkpr3Gf3OGvU1PD8YuvrJRhVbioxV82T-niFPoX3o,127
+pip/_vendor/resolvelib/providers.py,sha256=TZDCmL-Ic-R5JRIZY8G4FLG5xB2343B0DfuK7aw2Yqw,4547
+pip/_vendor/resolvelib/reporters.py,sha256=ZPSJnVfK8WvXTbX8jE0Nren0-_Hg9ym4epCUPtU8Y0U,1405
+pip/_vendor/resolvelib/resolvers.py,sha256=lQTGcc-2fgHbmdiLzeNDUxVmGc5ZFjkAL6JrVqnqJIw,15018
+pip/_vendor/resolvelib/structs.py,sha256=yrdhd-n7DercimPGclXe20rgqhlxw8PnxC0wmcXO19Y,2016
+pip/_vendor/retrying.py,sha256=k3fflf5_Mm0XcIJYhB7Tj34bqCCPhUDkYbx1NvW2FPE,9972
+pip/_vendor/six.py,sha256=U4Z_yv534W5CNyjY9i8V1OXY2SjAny8y2L5vDLhhThM,34159
+pip/_vendor/toml/__init__.py,sha256=rJ1pu933HgUtyeeNiusoPd5jJOPNhaKHhSSld3o8AQo,747
+pip/_vendor/toml/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/toml/__pycache__/common.cpython-36.pyc,,
+pip/_vendor/toml/__pycache__/decoder.cpython-36.pyc,,
+pip/_vendor/toml/__pycache__/encoder.cpython-36.pyc,,
+pip/_vendor/toml/__pycache__/ordered.cpython-36.pyc,,
+pip/_vendor/toml/__pycache__/tz.cpython-36.pyc,,
+pip/_vendor/toml/common.py,sha256=ViBccAduP6eZNJAb1POhRhjOAi56TDsNgWJ1TjgXAug,242
+pip/_vendor/toml/decoder.py,sha256=atpXmyFCzNGiqhkcYLySBuJQkPeSHDzBz47sEaX1amw,38696
+pip/_vendor/toml/encoder.py,sha256=fPqLyFdPAam17X9SELz2TMp9affkfHCmgWZxRKcmzhY,9955
+pip/_vendor/toml/ordered.py,sha256=UWt5Eka90IWVBYdvLgY5PXnkBcVYpHjnw9T67rM85T8,378
+pip/_vendor/toml/tz.py,sha256=DrAgI3wZxZiGcLuV_l8ueA_nPrYoxQ3hZA9tJSjWRsQ,618
+pip/_vendor/urllib3/__init__.py,sha256=rdFZCO1L7e8861ZTvo8AiSKwxCe9SnWQUQwJ599YV9c,2683
+pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc,,
+pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc,,
+pip/_vendor/urllib3/_collections.py,sha256=GouVsNzwg6jADZTmimMI6oqmwKSswnMo9dh5tGNVWO4,10792
+pip/_vendor/urllib3/connection.py,sha256=Fln8a_bkegdNMkFoSOwyI0PJvL1OqzVUO6ifihKOTpc,14461
+pip/_vendor/urllib3/connectionpool.py,sha256=egdaX-Db_LVXifDxv3JY0dHIpQqDv0wC0_9Eeh8FkPM,35725
+pip/_vendor/urllib3/contrib/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/_appengine_environ.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/_appengine_environ.py,sha256=bDbyOEhW2CKLJcQqAKAyrEHN-aklsyHFKq6vF8ZFsmk,957
+pip/_vendor/urllib3/contrib/_securetransport/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc,,
+pip/_vendor/urllib3/contrib/_securetransport/bindings.py,sha256=mullWYFaghBdRWla6HYU-TBgFRTPLBEfxj3jplbeJmQ,16886
+pip/_vendor/urllib3/contrib/_securetransport/low_level.py,sha256=V7GnujxnWZh2N2sMsV5N4d9Imymokkm3zBwgt77_bSE,11956
+pip/_vendor/urllib3/contrib/appengine.py,sha256=gfdK4T7CRin7v9HRhHDbDh-Hbk66hHDWeoz7nV3PJo8,11034
+pip/_vendor/urllib3/contrib/ntlmpool.py,sha256=a402AwGN_Ll3N-4ur_AS6UrU-ycUtlnYqoBF76lORg8,4160
+pip/_vendor/urllib3/contrib/pyopenssl.py,sha256=9gm5kpC0ScbDCWobeCrh5LDqS8HgU8FNhmk5v8qQ5Bs,16582
+pip/_vendor/urllib3/contrib/securetransport.py,sha256=vBDFjSnH2gWa-ztMKVaiwW46K1mlDZKqvo_VAonfdcY,32401
+pip/_vendor/urllib3/contrib/socks.py,sha256=nzDMgDIFJWVubKHqvIn2-SKCO91hhJInP92WgHChGzA,7036
+pip/_vendor/urllib3/exceptions.py,sha256=D2Jvab7M7m_n0rnmBmq481paoVT32VvVeB6VeQM0y-w,7172
+pip/_vendor/urllib3/fields.py,sha256=kroD76QK-GdHHW7f_AUN4XxDC3OQPI2FFrS9eSL4BCs,8553
+pip/_vendor/urllib3/filepost.py,sha256=vj0qbrpT1AFzvvW4SuC8M5kJiw7wftHcSr-7b8UpPpw,2440
+pip/_vendor/urllib3/packages/__init__.py,sha256=h4BLhD4tLaBx1adaDtKXfupsgqY0wWLXb_f1_yVlV6A,108
+pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/backports/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/backports/makefile.py,sha256=005wrvH-_pWSnTFqQ2sdzzh4zVCtQUUQ4mR2Yyxwc0A,1418
+pip/_vendor/urllib3/packages/six.py,sha256=adx4z-eM_D0Vvu0IIqVzFACQ_ux9l64y7DkSEfbxCDs,32536
+pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py,sha256=ywgKMtfHi1-DrXlzPfVAhzsLzzqcK7GT6eLgdode1Fg,688
+pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc,,
+pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py,sha256=rvQDQviqQLtPJB6MfEgABnBFj3nXft7ZJ3Dx-BC0AQY,5696
+pip/_vendor/urllib3/poolmanager.py,sha256=iWEAIGrVNGoOmQyfiFwCqG-IyYy6GIQ-jJ9QCsX9li4,17861
+pip/_vendor/urllib3/request.py,sha256=hhoHvEEatyd9Tn5EbGjQ0emn-ENMCyY591yNWTneINA,6018
+pip/_vendor/urllib3/response.py,sha256=eo1Sfkn2x44FtjgP3qwwDsG9ak84spQAxEGy7Ovd4Pc,28221
+pip/_vendor/urllib3/util/__init__.py,sha256=bWNaav_OT-1L7-sxm59cGb59rDORlbhb_4noduM5m0U,1038
+pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/queue.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc,,
+pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc,,
+pip/_vendor/urllib3/util/connection.py,sha256=NsxUAKQ98GKywta--zg57CdVpeTCI6N-GElCq78Dl8U,4637
+pip/_vendor/urllib3/util/queue.py,sha256=myTX3JDHntglKQNBf3b6dasHH-uF-W59vzGSQiFdAfI,497
+pip/_vendor/urllib3/util/request.py,sha256=C-6-AWffxZG03AdRGoY59uqsn4CVItKU6gjxz7Hc3Mc,3815
+pip/_vendor/urllib3/util/response.py,sha256=_WbTQr8xRQuJuY2rTIZxVdJD6mnEOtQupjaK_bF_Vj8,2573
+pip/_vendor/urllib3/util/retry.py,sha256=3wbv7SdzYNOxPcBiFkPCubTbK1_6vWSepznOXirhUfA,15543
+pip/_vendor/urllib3/util/ssl_.py,sha256=N7gqt2iqzKBsWGmc61YeKNSPri6Ns2iZ_MD5hV2y8tU,14523
+pip/_vendor/urllib3/util/timeout.py,sha256=3qawUo-TZq4q7tyeRToMIOdNGEOBjOOQVq7nHnLryP4,9947
+pip/_vendor/urllib3/util/url.py,sha256=S4YyAwWKJPjFFECC7l9Vp9EKqRH1XAb-uQFANn1Tak0,13981
+pip/_vendor/urllib3/util/wait.py,sha256=k46KzqIYu3Vnzla5YW3EvtInNlU_QycFqQAghIOxoAg,5406
+pip/_vendor/vendor.txt,sha256=bWUiaRjMJhuUsqFZHEJkBH_6lJ_Avl9cOyszcI74IHs,437
+pip/_vendor/webencodings/__init__.py,sha256=qOBJIuPy_4ByYH6W_bNgJF-qYQ2DoU-dKsDu5yRWCXg,10579
+pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc,,
+pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc,,
+pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc,,
+pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc,,
+pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc,,
+pip/_vendor/webencodings/labels.py,sha256=4AO_KxTddqGtrL9ns7kAPjb0CcN6xsCIxbK37HY9r3E,8979
+pip/_vendor/webencodings/mklabels.py,sha256=GYIeywnpaLnP0GSic8LFWgd0UVvO_l1Nc6YoF-87R_4,1305
+pip/_vendor/webencodings/tests.py,sha256=OtGLyjhNY1fvkW1GvLJ_FV9ZoqC9Anyjr7q3kxTbzNs,6563
+pip/_vendor/webencodings/x_user_defined.py,sha256=yOqWSdmpytGfUgh_Z6JYgDNhoc-BAHyyeeT15Fr42tM,4307
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/WHEEL b/venv/Lib/site-packages/pip-20.2.3.dist-info/WHEEL
new file mode 100644
index 000000000..6d38aa060
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/WHEEL
@@ -0,0 +1,6 @@
+Wheel-Version: 1.0
+Generator: bdist_wheel (0.35.1)
+Root-Is-Purelib: true
+Tag: py2-none-any
+Tag: py3-none-any
+
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/entry_points.txt b/venv/Lib/site-packages/pip-20.2.3.dist-info/entry_points.txt
new file mode 100644
index 000000000..d48bd8a85
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/entry_points.txt
@@ -0,0 +1,5 @@
+[console_scripts]
+pip = pip._internal.cli.main:main
+pip3 = pip._internal.cli.main:main
+pip3.8 = pip._internal.cli.main:main
+
diff --git a/venv/Lib/site-packages/pip-20.2.3.dist-info/top_level.txt b/venv/Lib/site-packages/pip-20.2.3.dist-info/top_level.txt
new file mode 100644
index 000000000..a1b589e38
--- /dev/null
+++ b/venv/Lib/site-packages/pip-20.2.3.dist-info/top_level.txt
@@ -0,0 +1 @@
+pip
diff --git a/venv/Lib/site-packages/pip/__init__.py b/venv/Lib/site-packages/pip/__init__.py
new file mode 100644
index 000000000..9fb68d403
--- /dev/null
+++ b/venv/Lib/site-packages/pip/__init__.py
@@ -0,0 +1,18 @@
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional
+
+
+__version__ = "20.2.3"
+
+
+def main(args=None):
+    # type: (Optional[List[str]]) -> int
+    """This is an internal API only meant for use by pip's own console scripts.
+
+    For additional details, see https://github.com/pypa/pip/issues/7498.
+    """
+    from pip._internal.utils.entrypoints import _wrapper
+
+    return _wrapper(args)
diff --git a/venv/Lib/site-packages/pip/__main__.py b/venv/Lib/site-packages/pip/__main__.py
new file mode 100644
index 000000000..7c2505fa5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/__main__.py
@@ -0,0 +1,26 @@
+from __future__ import absolute_import
+
+import os
+import sys
+
+# Remove '' and current working directory from the first entry
+# of sys.path, if present to avoid using current directory
+# in pip commands check, freeze, install, list and show,
+# when invoked as python -m pip <command>
+if sys.path[0] in ('', os.getcwd()):
+    sys.path.pop(0)
+
+# If we are running from a wheel, add the wheel to sys.path
+# This allows the usage python pip-*.whl/pip install pip-*.whl
+if __package__ == '':
+    # __file__ is pip-*.whl/pip/__main__.py
+    # first dirname call strips of '/__main__.py', second strips off '/pip'
+    # Resulting path is the name of the wheel itself
+    # Add that to sys.path so we can import pip
+    path = os.path.dirname(os.path.dirname(__file__))
+    sys.path.insert(0, path)
+
+from pip._internal.cli.main import main as _main  # isort:skip # noqa
+
+if __name__ == '__main__':
+    sys.exit(_main())
diff --git a/venv/Lib/site-packages/pip/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..9496289bd
Binary files /dev/null and b/venv/Lib/site-packages/pip/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/__pycache__/__main__.cpython-36.pyc b/venv/Lib/site-packages/pip/__pycache__/__main__.cpython-36.pyc
new file mode 100644
index 000000000..ea4662b9b
Binary files /dev/null and b/venv/Lib/site-packages/pip/__pycache__/__main__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__init__.py b/venv/Lib/site-packages/pip/_internal/__init__.py
new file mode 100644
index 000000000..264c2cab8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/__init__.py
@@ -0,0 +1,17 @@
+import pip._internal.utils.inject_securetransport  # noqa
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, List
+
+
+def main(args=None):
+    # type: (Optional[List[str]]) -> int
+    """This is preserved for old console scripts that may still be referencing
+    it.
+
+    For additional details, see https://github.com/pypa/pip/issues/7498.
+    """
+    from pip._internal.utils.entrypoints import _wrapper
+
+    return _wrapper(args)
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..119b0bfda
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/build_env.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/build_env.cpython-36.pyc
new file mode 100644
index 000000000..967c0491d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/build_env.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/cache.cpython-36.pyc
new file mode 100644
index 000000000..af70e037e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/configuration.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/configuration.cpython-36.pyc
new file mode 100644
index 000000000..2ff53ce40
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/configuration.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/exceptions.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/exceptions.cpython-36.pyc
new file mode 100644
index 000000000..c7f6d6d06
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/locations.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/locations.cpython-36.pyc
new file mode 100644
index 000000000..f5231f69f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/locations.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/main.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/main.cpython-36.pyc
new file mode 100644
index 000000000..15d6276c3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/main.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/pyproject.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/pyproject.cpython-36.pyc
new file mode 100644
index 000000000..ea356eb3d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/pyproject.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/self_outdated_check.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/self_outdated_check.cpython-36.pyc
new file mode 100644
index 000000000..1a0f0c9ba
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/self_outdated_check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/__pycache__/wheel_builder.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/__pycache__/wheel_builder.cpython-36.pyc
new file mode 100644
index 000000000..48817931a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/__pycache__/wheel_builder.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/build_env.py b/venv/Lib/site-packages/pip/_internal/build_env.py
new file mode 100644
index 000000000..28d1ad689
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/build_env.py
@@ -0,0 +1,241 @@
+"""Build Environment used for isolation during sdist building
+"""
+
+import logging
+import os
+import sys
+import textwrap
+from collections import OrderedDict
+from distutils.sysconfig import get_python_lib
+from sysconfig import get_paths
+
+from pip._vendor.pkg_resources import Requirement, VersionConflict, WorkingSet
+
+from pip import __file__ as pip_location
+from pip._internal.cli.spinners import open_spinner
+from pip._internal.utils.subprocess import call_subprocess
+from pip._internal.utils.temp_dir import TempDirectory, tempdir_kinds
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from types import TracebackType
+    from typing import Tuple, Set, Iterable, Optional, List, Type
+    from pip._internal.index.package_finder import PackageFinder
+
+logger = logging.getLogger(__name__)
+
+
+class _Prefix:
+
+    def __init__(self, path):
+        # type: (str) -> None
+        self.path = path
+        self.setup = False
+        self.bin_dir = get_paths(
+            'nt' if os.name == 'nt' else 'posix_prefix',
+            vars={'base': path, 'platbase': path}
+        )['scripts']
+        # Note: prefer distutils' sysconfig to get the
+        # library paths so PyPy is correctly supported.
+        purelib = get_python_lib(plat_specific=False, prefix=path)
+        platlib = get_python_lib(plat_specific=True, prefix=path)
+        if purelib == platlib:
+            self.lib_dirs = [purelib]
+        else:
+            self.lib_dirs = [purelib, platlib]
+
+
+class BuildEnvironment(object):
+    """Creates and manages an isolated environment to install build deps
+    """
+
+    def __init__(self):
+        # type: () -> None
+        temp_dir = TempDirectory(
+            kind=tempdir_kinds.BUILD_ENV, globally_managed=True
+        )
+
+        self._prefixes = OrderedDict((
+            (name, _Prefix(os.path.join(temp_dir.path, name)))
+            for name in ('normal', 'overlay')
+        ))
+
+        self._bin_dirs = []  # type: List[str]
+        self._lib_dirs = []  # type: List[str]
+        for prefix in reversed(list(self._prefixes.values())):
+            self._bin_dirs.append(prefix.bin_dir)
+            self._lib_dirs.extend(prefix.lib_dirs)
+
+        # Customize site to:
+        # - ensure .pth files are honored
+        # - prevent access to system site packages
+        system_sites = {
+            os.path.normcase(site) for site in (
+                get_python_lib(plat_specific=False),
+                get_python_lib(plat_specific=True),
+            )
+        }
+        self._site_dir = os.path.join(temp_dir.path, 'site')
+        if not os.path.exists(self._site_dir):
+            os.mkdir(self._site_dir)
+        with open(os.path.join(self._site_dir, 'sitecustomize.py'), 'w') as fp:
+            fp.write(textwrap.dedent(
+                '''
+                import os, site, sys
+
+                # First, drop system-sites related paths.
+                original_sys_path = sys.path[:]
+                known_paths = set()
+                for path in {system_sites!r}:
+                    site.addsitedir(path, known_paths=known_paths)
+                system_paths = set(
+                    os.path.normcase(path)
+                    for path in sys.path[len(original_sys_path):]
+                )
+                original_sys_path = [
+                    path for path in original_sys_path
+                    if os.path.normcase(path) not in system_paths
+                ]
+                sys.path = original_sys_path
+
+                # Second, add lib directories.
+                # ensuring .pth file are processed.
+                for path in {lib_dirs!r}:
+                    assert not path in sys.path
+                    site.addsitedir(path)
+                '''
+            ).format(system_sites=system_sites, lib_dirs=self._lib_dirs))
+
+    def __enter__(self):
+        # type: () -> None
+        self._save_env = {
+            name: os.environ.get(name, None)
+            for name in ('PATH', 'PYTHONNOUSERSITE', 'PYTHONPATH')
+        }
+
+        path = self._bin_dirs[:]
+        old_path = self._save_env['PATH']
+        if old_path:
+            path.extend(old_path.split(os.pathsep))
+
+        pythonpath = [self._site_dir]
+
+        os.environ.update({
+            'PATH': os.pathsep.join(path),
+            'PYTHONNOUSERSITE': '1',
+            'PYTHONPATH': os.pathsep.join(pythonpath),
+        })
+
+    def __exit__(
+        self,
+        exc_type,  # type: Optional[Type[BaseException]]
+        exc_val,  # type: Optional[BaseException]
+        exc_tb  # type: Optional[TracebackType]
+    ):
+        # type: (...) -> None
+        for varname, old_value in self._save_env.items():
+            if old_value is None:
+                os.environ.pop(varname, None)
+            else:
+                os.environ[varname] = old_value
+
+    def check_requirements(self, reqs):
+        # type: (Iterable[str]) -> Tuple[Set[Tuple[str, str]], Set[str]]
+        """Return 2 sets:
+            - conflicting requirements: set of (installed, wanted) reqs tuples
+            - missing requirements: set of reqs
+        """
+        missing = set()
+        conflicting = set()
+        if reqs:
+            ws = WorkingSet(self._lib_dirs)
+            for req in reqs:
+                try:
+                    if ws.find(Requirement.parse(req)) is None:
+                        missing.add(req)
+                except VersionConflict as e:
+                    conflicting.add((str(e.args[0].as_requirement()),
+                                     str(e.args[1])))
+        return conflicting, missing
+
+    def install_requirements(
+        self,
+        finder,  # type: PackageFinder
+        requirements,  # type: Iterable[str]
+        prefix_as_string,  # type: str
+        message  # type: str
+    ):
+        # type: (...) -> None
+        prefix = self._prefixes[prefix_as_string]
+        assert not prefix.setup
+        prefix.setup = True
+        if not requirements:
+            return
+        args = [
+            sys.executable, os.path.dirname(pip_location), 'install',
+            '--ignore-installed', '--no-user', '--prefix', prefix.path,
+            '--no-warn-script-location',
+        ]  # type: List[str]
+        if logger.getEffectiveLevel() <= logging.DEBUG:
+            args.append('-v')
+        for format_control in ('no_binary', 'only_binary'):
+            formats = getattr(finder.format_control, format_control)
+            args.extend(('--' + format_control.replace('_', '-'),
+                         ','.join(sorted(formats or {':none:'}))))
+
+        index_urls = finder.index_urls
+        if index_urls:
+            args.extend(['-i', index_urls[0]])
+            for extra_index in index_urls[1:]:
+                args.extend(['--extra-index-url', extra_index])
+        else:
+            args.append('--no-index')
+        for link in finder.find_links:
+            args.extend(['--find-links', link])
+
+        for host in finder.trusted_hosts:
+            args.extend(['--trusted-host', host])
+        if finder.allow_all_prereleases:
+            args.append('--pre')
+        if finder.prefer_binary:
+            args.append('--prefer-binary')
+        args.append('--')
+        args.extend(requirements)
+        with open_spinner(message) as spinner:
+            call_subprocess(args, spinner=spinner)
+
+
+class NoOpBuildEnvironment(BuildEnvironment):
+    """A no-op drop-in replacement for BuildEnvironment
+    """
+
+    def __init__(self):
+        # type: () -> None
+        pass
+
+    def __enter__(self):
+        # type: () -> None
+        pass
+
+    def __exit__(
+        self,
+        exc_type,  # type: Optional[Type[BaseException]]
+        exc_val,  # type: Optional[BaseException]
+        exc_tb  # type: Optional[TracebackType]
+    ):
+        # type: (...) -> None
+        pass
+
+    def cleanup(self):
+        # type: () -> None
+        pass
+
+    def install_requirements(
+        self,
+        finder,  # type: PackageFinder
+        requirements,  # type: Iterable[str]
+        prefix_as_string,  # type: str
+        message  # type: str
+    ):
+        # type: (...) -> None
+        raise NotImplementedError()
diff --git a/venv/Lib/site-packages/pip/_internal/cache.py b/venv/Lib/site-packages/pip/_internal/cache.py
new file mode 100644
index 000000000..07db948b9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cache.py
@@ -0,0 +1,346 @@
+"""Cache Management
+"""
+
+import hashlib
+import json
+import logging
+import os
+
+from pip._vendor.packaging.tags import interpreter_name, interpreter_version
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.exceptions import InvalidWheelFilename
+from pip._internal.models.link import Link
+from pip._internal.models.wheel import Wheel
+from pip._internal.utils.temp_dir import TempDirectory, tempdir_kinds
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Set, List, Any, Dict
+
+    from pip._vendor.packaging.tags import Tag
+
+    from pip._internal.models.format_control import FormatControl
+
+logger = logging.getLogger(__name__)
+
+
+def _hash_dict(d):
+    # type: (Dict[str, str]) -> str
+    """Return a stable sha224 of a dictionary."""
+    s = json.dumps(d, sort_keys=True, separators=(",", ":"), ensure_ascii=True)
+    return hashlib.sha224(s.encode("ascii")).hexdigest()
+
+
+class Cache(object):
+    """An abstract class - provides cache directories for data from links
+
+
+        :param cache_dir: The root of the cache.
+        :param format_control: An object of FormatControl class to limit
+            binaries being read from the cache.
+        :param allowed_formats: which formats of files the cache should store.
+            ('binary' and 'source' are the only allowed values)
+    """
+
+    def __init__(self, cache_dir, format_control, allowed_formats):
+        # type: (str, FormatControl, Set[str]) -> None
+        super(Cache, self).__init__()
+        assert not cache_dir or os.path.isabs(cache_dir)
+        self.cache_dir = cache_dir or None
+        self.format_control = format_control
+        self.allowed_formats = allowed_formats
+
+        _valid_formats = {"source", "binary"}
+        assert self.allowed_formats.union(_valid_formats) == _valid_formats
+
+    def _get_cache_path_parts_legacy(self, link):
+        # type: (Link) -> List[str]
+        """Get parts of part that must be os.path.joined with cache_dir
+
+        Legacy cache key (pip < 20) for compatibility with older caches.
+        """
+
+        # We want to generate an url to use as our cache key, we don't want to
+        # just re-use the URL because it might have other items in the fragment
+        # and we don't care about those.
+        key_parts = [link.url_without_fragment]
+        if link.hash_name is not None and link.hash is not None:
+            key_parts.append("=".join([link.hash_name, link.hash]))
+        key_url = "#".join(key_parts)
+
+        # Encode our key url with sha224, we'll use this because it has similar
+        # security properties to sha256, but with a shorter total output (and
+        # thus less secure). However the differences don't make a lot of
+        # difference for our use case here.
+        hashed = hashlib.sha224(key_url.encode()).hexdigest()
+
+        # We want to nest the directories some to prevent having a ton of top
+        # level directories where we might run out of sub directories on some
+        # FS.
+        parts = [hashed[:2], hashed[2:4], hashed[4:6], hashed[6:]]
+
+        return parts
+
+    def _get_cache_path_parts(self, link):
+        # type: (Link) -> List[str]
+        """Get parts of part that must be os.path.joined with cache_dir
+        """
+
+        # We want to generate an url to use as our cache key, we don't want to
+        # just re-use the URL because it might have other items in the fragment
+        # and we don't care about those.
+        key_parts = {"url": link.url_without_fragment}
+        if link.hash_name is not None and link.hash is not None:
+            key_parts[link.hash_name] = link.hash
+        if link.subdirectory_fragment:
+            key_parts["subdirectory"] = link.subdirectory_fragment
+
+        # Include interpreter name, major and minor version in cache key
+        # to cope with ill-behaved sdists that build a different wheel
+        # depending on the python version their setup.py is being run on,
+        # and don't encode the difference in compatibility tags.
+        # https://github.com/pypa/pip/issues/7296
+        key_parts["interpreter_name"] = interpreter_name()
+        key_parts["interpreter_version"] = interpreter_version()
+
+        # Encode our key url with sha224, we'll use this because it has similar
+        # security properties to sha256, but with a shorter total output (and
+        # thus less secure). However the differences don't make a lot of
+        # difference for our use case here.
+        hashed = _hash_dict(key_parts)
+
+        # We want to nest the directories some to prevent having a ton of top
+        # level directories where we might run out of sub directories on some
+        # FS.
+        parts = [hashed[:2], hashed[2:4], hashed[4:6], hashed[6:]]
+
+        return parts
+
+    def _get_candidates(self, link, canonical_package_name):
+        # type: (Link, str) -> List[Any]
+        can_not_cache = (
+            not self.cache_dir or
+            not canonical_package_name or
+            not link
+        )
+        if can_not_cache:
+            return []
+
+        formats = self.format_control.get_allowed_formats(
+            canonical_package_name
+        )
+        if not self.allowed_formats.intersection(formats):
+            return []
+
+        candidates = []
+        path = self.get_path_for_link(link)
+        if os.path.isdir(path):
+            for candidate in os.listdir(path):
+                candidates.append((candidate, path))
+        # TODO remove legacy path lookup in pip>=21
+        legacy_path = self.get_path_for_link_legacy(link)
+        if os.path.isdir(legacy_path):
+            for candidate in os.listdir(legacy_path):
+                candidates.append((candidate, legacy_path))
+        return candidates
+
+    def get_path_for_link_legacy(self, link):
+        # type: (Link) -> str
+        raise NotImplementedError()
+
+    def get_path_for_link(self, link):
+        # type: (Link) -> str
+        """Return a directory to store cached items in for link.
+        """
+        raise NotImplementedError()
+
+    def get(
+        self,
+        link,            # type: Link
+        package_name,    # type: Optional[str]
+        supported_tags,  # type: List[Tag]
+    ):
+        # type: (...) -> Link
+        """Returns a link to a cached item if it exists, otherwise returns the
+        passed link.
+        """
+        raise NotImplementedError()
+
+
+class SimpleWheelCache(Cache):
+    """A cache of wheels for future installs.
+    """
+
+    def __init__(self, cache_dir, format_control):
+        # type: (str, FormatControl) -> None
+        super(SimpleWheelCache, self).__init__(
+            cache_dir, format_control, {"binary"}
+        )
+
+    def get_path_for_link_legacy(self, link):
+        # type: (Link) -> str
+        parts = self._get_cache_path_parts_legacy(link)
+        assert self.cache_dir
+        return os.path.join(self.cache_dir, "wheels", *parts)
+
+    def get_path_for_link(self, link):
+        # type: (Link) -> str
+        """Return a directory to store cached wheels for link
+
+        Because there are M wheels for any one sdist, we provide a directory
+        to cache them in, and then consult that directory when looking up
+        cache hits.
+
+        We only insert things into the cache if they have plausible version
+        numbers, so that we don't contaminate the cache with things that were
+        not unique. E.g. ./package might have dozens of installs done for it
+        and build a version of 0.0...and if we built and cached a wheel, we'd
+        end up using the same wheel even if the source has been edited.
+
+        :param link: The link of the sdist for which this will cache wheels.
+        """
+        parts = self._get_cache_path_parts(link)
+        assert self.cache_dir
+        # Store wheels within the root cache_dir
+        return os.path.join(self.cache_dir, "wheels", *parts)
+
+    def get(
+        self,
+        link,            # type: Link
+        package_name,    # type: Optional[str]
+        supported_tags,  # type: List[Tag]
+    ):
+        # type: (...) -> Link
+        candidates = []
+
+        if not package_name:
+            return link
+
+        canonical_package_name = canonicalize_name(package_name)
+        for wheel_name, wheel_dir in self._get_candidates(
+            link, canonical_package_name
+        ):
+            try:
+                wheel = Wheel(wheel_name)
+            except InvalidWheelFilename:
+                continue
+            if canonicalize_name(wheel.name) != canonical_package_name:
+                logger.debug(
+                    "Ignoring cached wheel %s for %s as it "
+                    "does not match the expected distribution name %s.",
+                    wheel_name, link, package_name,
+                )
+                continue
+            if not wheel.supported(supported_tags):
+                # Built for a different python/arch/etc
+                continue
+            candidates.append(
+                (
+                    wheel.support_index_min(supported_tags),
+                    wheel_name,
+                    wheel_dir,
+                )
+            )
+
+        if not candidates:
+            return link
+
+        _, wheel_name, wheel_dir = min(candidates)
+        return Link(path_to_url(os.path.join(wheel_dir, wheel_name)))
+
+
+class EphemWheelCache(SimpleWheelCache):
+    """A SimpleWheelCache that creates it's own temporary cache directory
+    """
+
+    def __init__(self, format_control):
+        # type: (FormatControl) -> None
+        self._temp_dir = TempDirectory(
+            kind=tempdir_kinds.EPHEM_WHEEL_CACHE,
+            globally_managed=True,
+        )
+
+        super(EphemWheelCache, self).__init__(
+            self._temp_dir.path, format_control
+        )
+
+
+class CacheEntry(object):
+    def __init__(
+        self,
+        link,  # type: Link
+        persistent,  # type: bool
+    ):
+        self.link = link
+        self.persistent = persistent
+
+
+class WheelCache(Cache):
+    """Wraps EphemWheelCache and SimpleWheelCache into a single Cache
+
+    This Cache allows for gracefully degradation, using the ephem wheel cache
+    when a certain link is not found in the simple wheel cache first.
+    """
+
+    def __init__(self, cache_dir, format_control):
+        # type: (str, FormatControl) -> None
+        super(WheelCache, self).__init__(
+            cache_dir, format_control, {'binary'}
+        )
+        self._wheel_cache = SimpleWheelCache(cache_dir, format_control)
+        self._ephem_cache = EphemWheelCache(format_control)
+
+    def get_path_for_link_legacy(self, link):
+        # type: (Link) -> str
+        return self._wheel_cache.get_path_for_link_legacy(link)
+
+    def get_path_for_link(self, link):
+        # type: (Link) -> str
+        return self._wheel_cache.get_path_for_link(link)
+
+    def get_ephem_path_for_link(self, link):
+        # type: (Link) -> str
+        return self._ephem_cache.get_path_for_link(link)
+
+    def get(
+        self,
+        link,            # type: Link
+        package_name,    # type: Optional[str]
+        supported_tags,  # type: List[Tag]
+    ):
+        # type: (...) -> Link
+        cache_entry = self.get_cache_entry(link, package_name, supported_tags)
+        if cache_entry is None:
+            return link
+        return cache_entry.link
+
+    def get_cache_entry(
+        self,
+        link,            # type: Link
+        package_name,    # type: Optional[str]
+        supported_tags,  # type: List[Tag]
+    ):
+        # type: (...) -> Optional[CacheEntry]
+        """Returns a CacheEntry with a link to a cached item if it exists or
+        None. The cache entry indicates if the item was found in the persistent
+        or ephemeral cache.
+        """
+        retval = self._wheel_cache.get(
+            link=link,
+            package_name=package_name,
+            supported_tags=supported_tags,
+        )
+        if retval is not link:
+            return CacheEntry(retval, persistent=True)
+
+        retval = self._ephem_cache.get(
+            link=link,
+            package_name=package_name,
+            supported_tags=supported_tags,
+        )
+        if retval is not link:
+            return CacheEntry(retval, persistent=False)
+
+        return None
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__init__.py b/venv/Lib/site-packages/pip/_internal/cli/__init__.py
new file mode 100644
index 000000000..e589bb917
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/__init__.py
@@ -0,0 +1,4 @@
+"""Subpackage containing all of pip's command line interface related code
+"""
+
+# This file intentionally does not import submodules
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..515a93c81
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/autocompletion.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/autocompletion.cpython-36.pyc
new file mode 100644
index 000000000..64017208b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/autocompletion.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/base_command.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/base_command.cpython-36.pyc
new file mode 100644
index 000000000..fe792f146
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/base_command.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/cmdoptions.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/cmdoptions.cpython-36.pyc
new file mode 100644
index 000000000..c034b5613
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/cmdoptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/command_context.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/command_context.cpython-36.pyc
new file mode 100644
index 000000000..779a7e847
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/command_context.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main.cpython-36.pyc
new file mode 100644
index 000000000..6a6060442
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main_parser.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main_parser.cpython-36.pyc
new file mode 100644
index 000000000..d4b9a06d8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/main_parser.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/parser.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/parser.cpython-36.pyc
new file mode 100644
index 000000000..81edc3c0c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/parser.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/progress_bars.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/progress_bars.cpython-36.pyc
new file mode 100644
index 000000000..e0c0b6a48
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/progress_bars.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/req_command.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/req_command.cpython-36.pyc
new file mode 100644
index 000000000..c0e2cbe8e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/req_command.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/spinners.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/spinners.cpython-36.pyc
new file mode 100644
index 000000000..a19355437
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/spinners.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/__pycache__/status_codes.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/status_codes.cpython-36.pyc
new file mode 100644
index 000000000..04b36a225
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/cli/__pycache__/status_codes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/cli/autocompletion.py b/venv/Lib/site-packages/pip/_internal/cli/autocompletion.py
new file mode 100644
index 000000000..329de6025
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/autocompletion.py
@@ -0,0 +1,164 @@
+"""Logic that powers autocompletion installed by ``pip completion``.
+"""
+
+import optparse
+import os
+import sys
+from itertools import chain
+
+from pip._internal.cli.main_parser import create_main_parser
+from pip._internal.commands import commands_dict, create_command
+from pip._internal.utils.misc import get_installed_distributions
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Iterable, List, Optional
+
+
+def autocomplete():
+    # type: () -> None
+    """Entry Point for completion of main and subcommand options.
+    """
+    # Don't complete if user hasn't sourced bash_completion file.
+    if 'PIP_AUTO_COMPLETE' not in os.environ:
+        return
+    cwords = os.environ['COMP_WORDS'].split()[1:]
+    cword = int(os.environ['COMP_CWORD'])
+    try:
+        current = cwords[cword - 1]
+    except IndexError:
+        current = ''
+
+    parser = create_main_parser()
+    subcommands = list(commands_dict)
+    options = []
+
+    # subcommand
+    subcommand_name = None  # type: Optional[str]
+    for word in cwords:
+        if word in subcommands:
+            subcommand_name = word
+            break
+    # subcommand options
+    if subcommand_name is not None:
+        # special case: 'help' subcommand has no options
+        if subcommand_name == 'help':
+            sys.exit(1)
+        # special case: list locally installed dists for show and uninstall
+        should_list_installed = (
+            subcommand_name in ['show', 'uninstall'] and
+            not current.startswith('-')
+        )
+        if should_list_installed:
+            installed = []
+            lc = current.lower()
+            for dist in get_installed_distributions(local_only=True):
+                if dist.key.startswith(lc) and dist.key not in cwords[1:]:
+                    installed.append(dist.key)
+            # if there are no dists installed, fall back to option completion
+            if installed:
+                for dist in installed:
+                    print(dist)
+                sys.exit(1)
+
+        subcommand = create_command(subcommand_name)
+
+        for opt in subcommand.parser.option_list_all:
+            if opt.help != optparse.SUPPRESS_HELP:
+                for opt_str in opt._long_opts + opt._short_opts:
+                    options.append((opt_str, opt.nargs))
+
+        # filter out previously specified options from available options
+        prev_opts = [x.split('=')[0] for x in cwords[1:cword - 1]]
+        options = [(x, v) for (x, v) in options if x not in prev_opts]
+        # filter options by current input
+        options = [(k, v) for k, v in options if k.startswith(current)]
+        # get completion type given cwords and available subcommand options
+        completion_type = get_path_completion_type(
+            cwords, cword, subcommand.parser.option_list_all,
+        )
+        # get completion files and directories if ``completion_type`` is
+        # ``<file>``, ``<dir>`` or ``<path>``
+        if completion_type:
+            paths = auto_complete_paths(current, completion_type)
+            options = [(path, 0) for path in paths]
+        for option in options:
+            opt_label = option[0]
+            # append '=' to options which require args
+            if option[1] and option[0][:2] == "--":
+                opt_label += '='
+            print(opt_label)
+    else:
+        # show main parser options only when necessary
+
+        opts = [i.option_list for i in parser.option_groups]
+        opts.append(parser.option_list)
+        flattened_opts = chain.from_iterable(opts)
+        if current.startswith('-'):
+            for opt in flattened_opts:
+                if opt.help != optparse.SUPPRESS_HELP:
+                    subcommands += opt._long_opts + opt._short_opts
+        else:
+            # get completion type given cwords and all available options
+            completion_type = get_path_completion_type(cwords, cword,
+                                                       flattened_opts)
+            if completion_type:
+                subcommands = list(auto_complete_paths(current,
+                                                       completion_type))
+
+        print(' '.join([x for x in subcommands if x.startswith(current)]))
+    sys.exit(1)
+
+
+def get_path_completion_type(cwords, cword, opts):
+    # type: (List[str], int, Iterable[Any]) -> Optional[str]
+    """Get the type of path completion (``file``, ``dir``, ``path`` or None)
+
+    :param cwords: same as the environmental variable ``COMP_WORDS``
+    :param cword: same as the environmental variable ``COMP_CWORD``
+    :param opts: The available options to check
+    :return: path completion type (``file``, ``dir``, ``path`` or None)
+    """
+    if cword < 2 or not cwords[cword - 2].startswith('-'):
+        return None
+    for opt in opts:
+        if opt.help == optparse.SUPPRESS_HELP:
+            continue
+        for o in str(opt).split('/'):
+            if cwords[cword - 2].split('=')[0] == o:
+                if not opt.metavar or any(
+                        x in ('path', 'file', 'dir')
+                        for x in opt.metavar.split('/')):
+                    return opt.metavar
+    return None
+
+
+def auto_complete_paths(current, completion_type):
+    # type: (str, str) -> Iterable[str]
+    """If ``completion_type`` is ``file`` or ``path``, list all regular files
+    and directories starting with ``current``; otherwise only list directories
+    starting with ``current``.
+
+    :param current: The word to be completed
+    :param completion_type: path completion type(`file`, `path` or `dir`)i
+    :return: A generator of regular files and/or directories
+    """
+    directory, filename = os.path.split(current)
+    current_path = os.path.abspath(directory)
+    # Don't complete paths if they can't be accessed
+    if not os.access(current_path, os.R_OK):
+        return
+    filename = os.path.normcase(filename)
+    # list all files that start with ``filename``
+    file_list = (x for x in os.listdir(current_path)
+                 if os.path.normcase(x).startswith(filename))
+    for f in file_list:
+        opt = os.path.join(current_path, f)
+        comp_file = os.path.normcase(os.path.join(directory, f))
+        # complete regular files when there is not ``<dir>`` after option
+        # complete directories when there is ``<file>``, ``<path>`` or
+        # ``<dir>``after option
+        if completion_type != 'dir' and os.path.isfile(opt):
+            yield comp_file
+        elif os.path.isdir(opt):
+            yield os.path.join(comp_file, '')
diff --git a/venv/Lib/site-packages/pip/_internal/cli/base_command.py b/venv/Lib/site-packages/pip/_internal/cli/base_command.py
new file mode 100644
index 000000000..197400a72
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/base_command.py
@@ -0,0 +1,265 @@
+"""Base Command class, and related routines"""
+
+from __future__ import absolute_import, print_function
+
+import logging
+import logging.config
+import optparse
+import os
+import platform
+import sys
+import traceback
+
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.command_context import CommandContextMixIn
+from pip._internal.cli.parser import (
+    ConfigOptionParser,
+    UpdatingDefaultsHelpFormatter,
+)
+from pip._internal.cli.status_codes import (
+    ERROR,
+    PREVIOUS_BUILD_DIR_ERROR,
+    UNKNOWN_ERROR,
+    VIRTUALENV_NOT_FOUND,
+)
+from pip._internal.exceptions import (
+    BadCommand,
+    CommandError,
+    InstallationError,
+    NetworkConnectionError,
+    PreviousBuildDirError,
+    SubProcessError,
+    UninstallationError,
+)
+from pip._internal.utils.deprecation import deprecated
+from pip._internal.utils.filesystem import check_path_owner
+from pip._internal.utils.logging import BrokenStdoutLoggingError, setup_logging
+from pip._internal.utils.misc import get_prog, normalize_path
+from pip._internal.utils.temp_dir import (
+    global_tempdir_manager,
+    tempdir_registry,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.virtualenv import running_under_virtualenv
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Tuple, Any
+    from optparse import Values
+
+    from pip._internal.utils.temp_dir import (
+        TempDirectoryTypeRegistry as TempDirRegistry
+    )
+
+__all__ = ['Command']
+
+logger = logging.getLogger(__name__)
+
+
+class Command(CommandContextMixIn):
+    usage = None  # type: str
+    ignore_require_venv = False  # type: bool
+
+    def __init__(self, name, summary, isolated=False):
+        # type: (str, str, bool) -> None
+        super(Command, self).__init__()
+        parser_kw = {
+            'usage': self.usage,
+            'prog': '{} {}'.format(get_prog(), name),
+            'formatter': UpdatingDefaultsHelpFormatter(),
+            'add_help_option': False,
+            'name': name,
+            'description': self.__doc__,
+            'isolated': isolated,
+        }
+
+        self.name = name
+        self.summary = summary
+        self.parser = ConfigOptionParser(**parser_kw)
+
+        self.tempdir_registry = None  # type: Optional[TempDirRegistry]
+
+        # Commands should add options to this option group
+        optgroup_name = '{} Options'.format(self.name.capitalize())
+        self.cmd_opts = optparse.OptionGroup(self.parser, optgroup_name)
+
+        # Add the general options
+        gen_opts = cmdoptions.make_option_group(
+            cmdoptions.general_group,
+            self.parser,
+        )
+        self.parser.add_option_group(gen_opts)
+
+        self.add_options()
+
+    def add_options(self):
+        # type: () -> None
+        pass
+
+    def handle_pip_version_check(self, options):
+        # type: (Values) -> None
+        """
+        This is a no-op so that commands by default do not do the pip version
+        check.
+        """
+        # Make sure we do the pip version check if the index_group options
+        # are present.
+        assert not hasattr(options, 'no_index')
+
+    def run(self, options, args):
+        # type: (Values, List[Any]) -> int
+        raise NotImplementedError
+
+    def parse_args(self, args):
+        # type: (List[str]) -> Tuple[Any, Any]
+        # factored out for testability
+        return self.parser.parse_args(args)
+
+    def main(self, args):
+        # type: (List[str]) -> int
+        try:
+            with self.main_context():
+                return self._main(args)
+        finally:
+            logging.shutdown()
+
+    def _main(self, args):
+        # type: (List[str]) -> int
+        # We must initialize this before the tempdir manager, otherwise the
+        # configuration would not be accessible by the time we clean up the
+        # tempdir manager.
+        self.tempdir_registry = self.enter_context(tempdir_registry())
+        # Intentionally set as early as possible so globally-managed temporary
+        # directories are available to the rest of the code.
+        self.enter_context(global_tempdir_manager())
+
+        options, args = self.parse_args(args)
+
+        # Set verbosity so that it can be used elsewhere.
+        self.verbosity = options.verbose - options.quiet
+
+        level_number = setup_logging(
+            verbosity=self.verbosity,
+            no_color=options.no_color,
+            user_log_file=options.log,
+        )
+
+        if (
+            sys.version_info[:2] == (2, 7) and
+            not options.no_python_version_warning
+        ):
+            message = (
+                "pip 21.0 will drop support for Python 2.7 in January 2021. "
+                "More details about Python 2 support in pip can be found at "
+                "https://pip.pypa.io/en/latest/development/release-process/#python-2-support"  # noqa
+            )
+            if platform.python_implementation() == "CPython":
+                message = (
+                    "Python 2.7 reached the end of its life on January "
+                    "1st, 2020. Please upgrade your Python as Python 2.7 "
+                    "is no longer maintained. "
+                ) + message
+            deprecated(message, replacement=None, gone_in="21.0")
+
+        if (
+            sys.version_info[:2] == (3, 5) and
+            not options.no_python_version_warning
+        ):
+            message = (
+                "Python 3.5 reached the end of its life on September "
+                "13th, 2020. Please upgrade your Python as Python 3.5 "
+                "is no longer maintained. pip 21.0 will drop support "
+                "for Python 3.5 in January 2021."
+            )
+            deprecated(message, replacement=None, gone_in="21.0")
+
+        # TODO: Try to get these passing down from the command?
+        #       without resorting to os.environ to hold these.
+        #       This also affects isolated builds and it should.
+
+        if options.no_input:
+            os.environ['PIP_NO_INPUT'] = '1'
+
+        if options.exists_action:
+            os.environ['PIP_EXISTS_ACTION'] = ' '.join(options.exists_action)
+
+        if options.require_venv and not self.ignore_require_venv:
+            # If a venv is required check if it can really be found
+            if not running_under_virtualenv():
+                logger.critical(
+                    'Could not find an activated virtualenv (required).'
+                )
+                sys.exit(VIRTUALENV_NOT_FOUND)
+
+        if options.cache_dir:
+            options.cache_dir = normalize_path(options.cache_dir)
+            if not check_path_owner(options.cache_dir):
+                logger.warning(
+                    "The directory '%s' or its parent directory is not owned "
+                    "or is not writable by the current user. The cache "
+                    "has been disabled. Check the permissions and owner of "
+                    "that directory. If executing pip with sudo, you may want "
+                    "sudo's -H flag.",
+                    options.cache_dir,
+                )
+                options.cache_dir = None
+
+        if getattr(options, "build_dir", None):
+            deprecated(
+                reason=(
+                    "The -b/--build/--build-dir/--build-directory "
+                    "option is deprecated."
+                ),
+                replacement=(
+                    "use the TMPDIR/TEMP/TMP environment variable, "
+                    "possibly combined with --no-clean"
+                ),
+                gone_in="20.3",
+                issue=8333,
+            )
+
+        if 'resolver' in options.unstable_features:
+            logger.critical(
+                "--unstable-feature=resolver is no longer supported, and "
+                "has been replaced with --use-feature=2020-resolver instead."
+            )
+            sys.exit(ERROR)
+
+        try:
+            status = self.run(options, args)
+            assert isinstance(status, int)
+            return status
+        except PreviousBuildDirError as exc:
+            logger.critical(str(exc))
+            logger.debug('Exception information:', exc_info=True)
+
+            return PREVIOUS_BUILD_DIR_ERROR
+        except (InstallationError, UninstallationError, BadCommand,
+                SubProcessError, NetworkConnectionError) as exc:
+            logger.critical(str(exc))
+            logger.debug('Exception information:', exc_info=True)
+
+            return ERROR
+        except CommandError as exc:
+            logger.critical('%s', exc)
+            logger.debug('Exception information:', exc_info=True)
+
+            return ERROR
+        except BrokenStdoutLoggingError:
+            # Bypass our logger and write any remaining messages to stderr
+            # because stdout no longer works.
+            print('ERROR: Pipe to stdout was broken', file=sys.stderr)
+            if level_number <= logging.DEBUG:
+                traceback.print_exc(file=sys.stderr)
+
+            return ERROR
+        except KeyboardInterrupt:
+            logger.critical('Operation cancelled by user')
+            logger.debug('Exception information:', exc_info=True)
+
+            return ERROR
+        except BaseException:
+            logger.critical('Exception:', exc_info=True)
+
+            return UNKNOWN_ERROR
+        finally:
+            self.handle_pip_version_check(options)
diff --git a/venv/Lib/site-packages/pip/_internal/cli/cmdoptions.py b/venv/Lib/site-packages/pip/_internal/cli/cmdoptions.py
new file mode 100644
index 000000000..ed42c5f5a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/cmdoptions.py
@@ -0,0 +1,975 @@
+"""
+shared options and groups
+
+The principle here is to define options once, but *not* instantiate them
+globally. One reason being that options with action='append' can carry state
+between parses. pip parses general options twice internally, and shouldn't
+pass on state. To be consistent, all options will follow this design.
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+from __future__ import absolute_import
+
+import os
+import textwrap
+import warnings
+from distutils.util import strtobool
+from functools import partial
+from optparse import SUPPRESS_HELP, Option, OptionGroup
+from textwrap import dedent
+
+from pip._internal.cli.progress_bars import BAR_TYPES
+from pip._internal.exceptions import CommandError
+from pip._internal.locations import USER_CACHE_DIR, get_src_prefix
+from pip._internal.models.format_control import FormatControl
+from pip._internal.models.index import PyPI
+from pip._internal.models.target_python import TargetPython
+from pip._internal.utils.hashes import STRONG_HASHES
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Callable, Dict, Optional, Tuple
+    from optparse import OptionParser, Values
+    from pip._internal.cli.parser import ConfigOptionParser
+
+
+def raise_option_error(parser, option, msg):
+    # type: (OptionParser, Option, str) -> None
+    """
+    Raise an option parsing error using parser.error().
+
+    Args:
+      parser: an OptionParser instance.
+      option: an Option instance.
+      msg: the error text.
+    """
+    msg = '{} error: {}'.format(option, msg)
+    msg = textwrap.fill(' '.join(msg.split()))
+    parser.error(msg)
+
+
+def make_option_group(group, parser):
+    # type: (Dict[str, Any], ConfigOptionParser) -> OptionGroup
+    """
+    Return an OptionGroup object
+    group  -- assumed to be dict with 'name' and 'options' keys
+    parser -- an optparse Parser
+    """
+    option_group = OptionGroup(parser, group['name'])
+    for option in group['options']:
+        option_group.add_option(option())
+    return option_group
+
+
+def check_install_build_global(options, check_options=None):
+    # type: (Values, Optional[Values]) -> None
+    """Disable wheels if per-setup.py call options are set.
+
+    :param options: The OptionParser options to update.
+    :param check_options: The options to check, if not supplied defaults to
+        options.
+    """
+    if check_options is None:
+        check_options = options
+
+    def getname(n):
+        # type: (str) -> Optional[Any]
+        return getattr(check_options, n, None)
+    names = ["build_options", "global_options", "install_options"]
+    if any(map(getname, names)):
+        control = options.format_control
+        control.disallow_binaries()
+        warnings.warn(
+            'Disabling all use of wheels due to the use of --build-option '
+            '/ --global-option / --install-option.', stacklevel=2,
+        )
+
+
+def check_dist_restriction(options, check_target=False):
+    # type: (Values, bool) -> None
+    """Function for determining if custom platform options are allowed.
+
+    :param options: The OptionParser options.
+    :param check_target: Whether or not to check if --target is being used.
+    """
+    dist_restriction_set = any([
+        options.python_version,
+        options.platform,
+        options.abi,
+        options.implementation,
+    ])
+
+    binary_only = FormatControl(set(), {':all:'})
+    sdist_dependencies_allowed = (
+        options.format_control != binary_only and
+        not options.ignore_dependencies
+    )
+
+    # Installations or downloads using dist restrictions must not combine
+    # source distributions and dist-specific wheels, as they are not
+    # guaranteed to be locally compatible.
+    if dist_restriction_set and sdist_dependencies_allowed:
+        raise CommandError(
+            "When restricting platform and interpreter constraints using "
+            "--python-version, --platform, --abi, or --implementation, "
+            "either --no-deps must be set, or --only-binary=:all: must be "
+            "set and --no-binary must not be set (or must be set to "
+            ":none:)."
+        )
+
+    if check_target:
+        if dist_restriction_set and not options.target_dir:
+            raise CommandError(
+                "Can not use any platform or abi specific options unless "
+                "installing via '--target'"
+            )
+
+
+def _path_option_check(option, opt, value):
+    # type: (Option, str, str) -> str
+    return os.path.expanduser(value)
+
+
+class PipOption(Option):
+    TYPES = Option.TYPES + ("path",)
+    TYPE_CHECKER = Option.TYPE_CHECKER.copy()
+    TYPE_CHECKER["path"] = _path_option_check
+
+
+###########
+# options #
+###########
+
+help_ = partial(
+    Option,
+    '-h', '--help',
+    dest='help',
+    action='help',
+    help='Show help.',
+)  # type: Callable[..., Option]
+
+isolated_mode = partial(
+    Option,
+    "--isolated",
+    dest="isolated_mode",
+    action="store_true",
+    default=False,
+    help=(
+        "Run pip in an isolated mode, ignoring environment variables and user "
+        "configuration."
+    ),
+)  # type: Callable[..., Option]
+
+require_virtualenv = partial(
+    Option,
+    # Run only if inside a virtualenv, bail if not.
+    '--require-virtualenv', '--require-venv',
+    dest='require_venv',
+    action='store_true',
+    default=False,
+    help=SUPPRESS_HELP
+)  # type: Callable[..., Option]
+
+verbose = partial(
+    Option,
+    '-v', '--verbose',
+    dest='verbose',
+    action='count',
+    default=0,
+    help='Give more output. Option is additive, and can be used up to 3 times.'
+)  # type: Callable[..., Option]
+
+no_color = partial(
+    Option,
+    '--no-color',
+    dest='no_color',
+    action='store_true',
+    default=False,
+    help="Suppress colored output",
+)  # type: Callable[..., Option]
+
+version = partial(
+    Option,
+    '-V', '--version',
+    dest='version',
+    action='store_true',
+    help='Show version and exit.',
+)  # type: Callable[..., Option]
+
+quiet = partial(
+    Option,
+    '-q', '--quiet',
+    dest='quiet',
+    action='count',
+    default=0,
+    help=(
+        'Give less output. Option is additive, and can be used up to 3'
+        ' times (corresponding to WARNING, ERROR, and CRITICAL logging'
+        ' levels).'
+    ),
+)  # type: Callable[..., Option]
+
+progress_bar = partial(
+    Option,
+    '--progress-bar',
+    dest='progress_bar',
+    type='choice',
+    choices=list(BAR_TYPES.keys()),
+    default='on',
+    help=(
+        'Specify type of progress to be displayed [' +
+        '|'.join(BAR_TYPES.keys()) + '] (default: %default)'
+    ),
+)  # type: Callable[..., Option]
+
+log = partial(
+    PipOption,
+    "--log", "--log-file", "--local-log",
+    dest="log",
+    metavar="path",
+    type="path",
+    help="Path to a verbose appending log."
+)  # type: Callable[..., Option]
+
+no_input = partial(
+    Option,
+    # Don't ask for input
+    '--no-input',
+    dest='no_input',
+    action='store_true',
+    default=False,
+    help="Disable prompting for input."
+)  # type: Callable[..., Option]
+
+proxy = partial(
+    Option,
+    '--proxy',
+    dest='proxy',
+    type='str',
+    default='',
+    help="Specify a proxy in the form [user:passwd@]proxy.server:port."
+)  # type: Callable[..., Option]
+
+retries = partial(
+    Option,
+    '--retries',
+    dest='retries',
+    type='int',
+    default=5,
+    help="Maximum number of retries each connection should attempt "
+         "(default %default times).",
+)  # type: Callable[..., Option]
+
+timeout = partial(
+    Option,
+    '--timeout', '--default-timeout',
+    metavar='sec',
+    dest='timeout',
+    type='float',
+    default=15,
+    help='Set the socket timeout (default %default seconds).',
+)  # type: Callable[..., Option]
+
+
+def exists_action():
+    # type: () -> Option
+    return Option(
+        # Option when path already exist
+        '--exists-action',
+        dest='exists_action',
+        type='choice',
+        choices=['s', 'i', 'w', 'b', 'a'],
+        default=[],
+        action='append',
+        metavar='action',
+        help="Default action when a path already exists: "
+             "(s)witch, (i)gnore, (w)ipe, (b)ackup, (a)bort.",
+    )
+
+
+cert = partial(
+    PipOption,
+    '--cert',
+    dest='cert',
+    type='path',
+    metavar='path',
+    help="Path to alternate CA bundle.",
+)  # type: Callable[..., Option]
+
+client_cert = partial(
+    PipOption,
+    '--client-cert',
+    dest='client_cert',
+    type='path',
+    default=None,
+    metavar='path',
+    help="Path to SSL client certificate, a single file containing the "
+         "private key and the certificate in PEM format.",
+)  # type: Callable[..., Option]
+
+index_url = partial(
+    Option,
+    '-i', '--index-url', '--pypi-url',
+    dest='index_url',
+    metavar='URL',
+    default=PyPI.simple_url,
+    help="Base URL of the Python Package Index (default %default). "
+         "This should point to a repository compliant with PEP 503 "
+         "(the simple repository API) or a local directory laid out "
+         "in the same format.",
+)  # type: Callable[..., Option]
+
+
+def extra_index_url():
+    # type: () -> Option
+    return Option(
+        '--extra-index-url',
+        dest='extra_index_urls',
+        metavar='URL',
+        action='append',
+        default=[],
+        help="Extra URLs of package indexes to use in addition to "
+             "--index-url. Should follow the same rules as "
+             "--index-url.",
+    )
+
+
+no_index = partial(
+    Option,
+    '--no-index',
+    dest='no_index',
+    action='store_true',
+    default=False,
+    help='Ignore package index (only looking at --find-links URLs instead).',
+)  # type: Callable[..., Option]
+
+
+def find_links():
+    # type: () -> Option
+    return Option(
+        '-f', '--find-links',
+        dest='find_links',
+        action='append',
+        default=[],
+        metavar='url',
+        help="If a URL or path to an html file, then parse for links to "
+             "archives such as sdist (.tar.gz) or wheel (.whl) files. "
+             "If a local path or file:// URL that's a directory,  "
+             "then look for archives in the directory listing. "
+             "Links to VCS project URLs are not supported.",
+    )
+
+
+def trusted_host():
+    # type: () -> Option
+    return Option(
+        "--trusted-host",
+        dest="trusted_hosts",
+        action="append",
+        metavar="HOSTNAME",
+        default=[],
+        help="Mark this host or host:port pair as trusted, even though it "
+             "does not have valid or any HTTPS.",
+    )
+
+
+def constraints():
+    # type: () -> Option
+    return Option(
+        '-c', '--constraint',
+        dest='constraints',
+        action='append',
+        default=[],
+        metavar='file',
+        help='Constrain versions using the given constraints file. '
+        'This option can be used multiple times.'
+    )
+
+
+def requirements():
+    # type: () -> Option
+    return Option(
+        '-r', '--requirement',
+        dest='requirements',
+        action='append',
+        default=[],
+        metavar='file',
+        help='Install from the given requirements file. '
+        'This option can be used multiple times.'
+    )
+
+
+def editable():
+    # type: () -> Option
+    return Option(
+        '-e', '--editable',
+        dest='editables',
+        action='append',
+        default=[],
+        metavar='path/url',
+        help=('Install a project in editable mode (i.e. setuptools '
+              '"develop mode") from a local project path or a VCS url.'),
+    )
+
+
+def _handle_src(option, opt_str, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    value = os.path.abspath(value)
+    setattr(parser.values, option.dest, value)
+
+
+src = partial(
+    PipOption,
+    '--src', '--source', '--source-dir', '--source-directory',
+    dest='src_dir',
+    type='path',
+    metavar='dir',
+    default=get_src_prefix(),
+    action='callback',
+    callback=_handle_src,
+    help='Directory to check out editable projects into. '
+    'The default in a virtualenv is "<venv path>/src". '
+    'The default for global installs is "<current dir>/src".'
+)  # type: Callable[..., Option]
+
+
+def _get_format_control(values, option):
+    # type: (Values, Option) -> Any
+    """Get a format_control object."""
+    return getattr(values, option.dest)
+
+
+def _handle_no_binary(option, opt_str, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    existing = _get_format_control(parser.values, option)
+    FormatControl.handle_mutual_excludes(
+        value, existing.no_binary, existing.only_binary,
+    )
+
+
+def _handle_only_binary(option, opt_str, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    existing = _get_format_control(parser.values, option)
+    FormatControl.handle_mutual_excludes(
+        value, existing.only_binary, existing.no_binary,
+    )
+
+
+def no_binary():
+    # type: () -> Option
+    format_control = FormatControl(set(), set())
+    return Option(
+        "--no-binary", dest="format_control", action="callback",
+        callback=_handle_no_binary, type="str",
+        default=format_control,
+        help='Do not use binary packages. Can be supplied multiple times, and '
+             'each time adds to the existing value. Accepts either ":all:" to '
+             'disable all binary packages, ":none:" to empty the set (notice '
+             'the colons), or one or more package names with commas between '
+             'them (no colons). Note that some packages are tricky to compile '
+             'and may fail to install when this option is used on them.',
+    )
+
+
+def only_binary():
+    # type: () -> Option
+    format_control = FormatControl(set(), set())
+    return Option(
+        "--only-binary", dest="format_control", action="callback",
+        callback=_handle_only_binary, type="str",
+        default=format_control,
+        help='Do not use source packages. Can be supplied multiple times, and '
+             'each time adds to the existing value. Accepts either ":all:" to '
+             'disable all source packages, ":none:" to empty the set, or one '
+             'or more package names with commas between them. Packages '
+             'without binary distributions will fail to install when this '
+             'option is used on them.',
+    )
+
+
+platform = partial(
+    Option,
+    '--platform',
+    dest='platform',
+    metavar='platform',
+    default=None,
+    help=("Only use wheels compatible with <platform>. "
+          "Defaults to the platform of the running system."),
+)  # type: Callable[..., Option]
+
+
+# This was made a separate function for unit-testing purposes.
+def _convert_python_version(value):
+    # type: (str) -> Tuple[Tuple[int, ...], Optional[str]]
+    """
+    Convert a version string like "3", "37", or "3.7.3" into a tuple of ints.
+
+    :return: A 2-tuple (version_info, error_msg), where `error_msg` is
+        non-None if and only if there was a parsing error.
+    """
+    if not value:
+        # The empty string is the same as not providing a value.
+        return (None, None)
+
+    parts = value.split('.')
+    if len(parts) > 3:
+        return ((), 'at most three version parts are allowed')
+
+    if len(parts) == 1:
+        # Then we are in the case of "3" or "37".
+        value = parts[0]
+        if len(value) > 1:
+            parts = [value[0], value[1:]]
+
+    try:
+        version_info = tuple(int(part) for part in parts)
+    except ValueError:
+        return ((), 'each version part must be an integer')
+
+    return (version_info, None)
+
+
+def _handle_python_version(option, opt_str, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    """
+    Handle a provided --python-version value.
+    """
+    version_info, error_msg = _convert_python_version(value)
+    if error_msg is not None:
+        msg = (
+            'invalid --python-version value: {!r}: {}'.format(
+                value, error_msg,
+            )
+        )
+        raise_option_error(parser, option=option, msg=msg)
+
+    parser.values.python_version = version_info
+
+
+python_version = partial(
+    Option,
+    '--python-version',
+    dest='python_version',
+    metavar='python_version',
+    action='callback',
+    callback=_handle_python_version, type='str',
+    default=None,
+    help=dedent("""\
+    The Python interpreter version to use for wheel and "Requires-Python"
+    compatibility checks. Defaults to a version derived from the running
+    interpreter. The version can be specified using up to three dot-separated
+    integers (e.g. "3" for 3.0.0, "3.7" for 3.7.0, or "3.7.3"). A major-minor
+    version can also be given as a string without dots (e.g. "37" for 3.7.0).
+    """),
+)  # type: Callable[..., Option]
+
+
+implementation = partial(
+    Option,
+    '--implementation',
+    dest='implementation',
+    metavar='implementation',
+    default=None,
+    help=("Only use wheels compatible with Python "
+          "implementation <implementation>, e.g. 'pp', 'jy', 'cp', "
+          " or 'ip'. If not specified, then the current "
+          "interpreter implementation is used.  Use 'py' to force "
+          "implementation-agnostic wheels."),
+)  # type: Callable[..., Option]
+
+
+abi = partial(
+    Option,
+    '--abi',
+    dest='abi',
+    metavar='abi',
+    default=None,
+    help=("Only use wheels compatible with Python "
+          "abi <abi>, e.g. 'pypy_41'.  If not specified, then the "
+          "current interpreter abi tag is used.  Generally "
+          "you will need to specify --implementation, "
+          "--platform, and --python-version when using "
+          "this option."),
+)  # type: Callable[..., Option]
+
+
+def add_target_python_options(cmd_opts):
+    # type: (OptionGroup) -> None
+    cmd_opts.add_option(platform())
+    cmd_opts.add_option(python_version())
+    cmd_opts.add_option(implementation())
+    cmd_opts.add_option(abi())
+
+
+def make_target_python(options):
+    # type: (Values) -> TargetPython
+    target_python = TargetPython(
+        platform=options.platform,
+        py_version_info=options.python_version,
+        abi=options.abi,
+        implementation=options.implementation,
+    )
+
+    return target_python
+
+
+def prefer_binary():
+    # type: () -> Option
+    return Option(
+        "--prefer-binary",
+        dest="prefer_binary",
+        action="store_true",
+        default=False,
+        help="Prefer older binary packages over newer source packages."
+    )
+
+
+cache_dir = partial(
+    PipOption,
+    "--cache-dir",
+    dest="cache_dir",
+    default=USER_CACHE_DIR,
+    metavar="dir",
+    type='path',
+    help="Store the cache data in <dir>."
+)  # type: Callable[..., Option]
+
+
+def _handle_no_cache_dir(option, opt, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    """
+    Process a value provided for the --no-cache-dir option.
+
+    This is an optparse.Option callback for the --no-cache-dir option.
+    """
+    # The value argument will be None if --no-cache-dir is passed via the
+    # command-line, since the option doesn't accept arguments.  However,
+    # the value can be non-None if the option is triggered e.g. by an
+    # environment variable, like PIP_NO_CACHE_DIR=true.
+    if value is not None:
+        # Then parse the string value to get argument error-checking.
+        try:
+            strtobool(value)
+        except ValueError as exc:
+            raise_option_error(parser, option=option, msg=str(exc))
+
+    # Originally, setting PIP_NO_CACHE_DIR to a value that strtobool()
+    # converted to 0 (like "false" or "no") caused cache_dir to be disabled
+    # rather than enabled (logic would say the latter).  Thus, we disable
+    # the cache directory not just on values that parse to True, but (for
+    # backwards compatibility reasons) also on values that parse to False.
+    # In other words, always set it to False if the option is provided in
+    # some (valid) form.
+    parser.values.cache_dir = False
+
+
+no_cache = partial(
+    Option,
+    "--no-cache-dir",
+    dest="cache_dir",
+    action="callback",
+    callback=_handle_no_cache_dir,
+    help="Disable the cache.",
+)  # type: Callable[..., Option]
+
+no_deps = partial(
+    Option,
+    '--no-deps', '--no-dependencies',
+    dest='ignore_dependencies',
+    action='store_true',
+    default=False,
+    help="Don't install package dependencies.",
+)  # type: Callable[..., Option]
+
+
+def _handle_build_dir(option, opt, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    if value:
+        value = os.path.abspath(value)
+    setattr(parser.values, option.dest, value)
+
+
+build_dir = partial(
+    PipOption,
+    '-b', '--build', '--build-dir', '--build-directory',
+    dest='build_dir',
+    type='path',
+    metavar='dir',
+    action='callback',
+    callback=_handle_build_dir,
+    help='(DEPRECATED) '
+         'Directory to unpack packages into and build in. Note that '
+         'an initial build still takes place in a temporary directory. '
+         'The location of temporary directories can be controlled by setting '
+         'the TMPDIR environment variable (TEMP on Windows) appropriately. '
+         'When passed, build directories are not cleaned in case of failures.'
+)  # type: Callable[..., Option]
+
+ignore_requires_python = partial(
+    Option,
+    '--ignore-requires-python',
+    dest='ignore_requires_python',
+    action='store_true',
+    help='Ignore the Requires-Python information.'
+)  # type: Callable[..., Option]
+
+no_build_isolation = partial(
+    Option,
+    '--no-build-isolation',
+    dest='build_isolation',
+    action='store_false',
+    default=True,
+    help='Disable isolation when building a modern source distribution. '
+         'Build dependencies specified by PEP 518 must be already installed '
+         'if this option is used.'
+)  # type: Callable[..., Option]
+
+
+def _handle_no_use_pep517(option, opt, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    """
+    Process a value provided for the --no-use-pep517 option.
+
+    This is an optparse.Option callback for the no_use_pep517 option.
+    """
+    # Since --no-use-pep517 doesn't accept arguments, the value argument
+    # will be None if --no-use-pep517 is passed via the command-line.
+    # However, the value can be non-None if the option is triggered e.g.
+    # by an environment variable, for example "PIP_NO_USE_PEP517=true".
+    if value is not None:
+        msg = """A value was passed for --no-use-pep517,
+        probably using either the PIP_NO_USE_PEP517 environment variable
+        or the "no-use-pep517" config file option. Use an appropriate value
+        of the PIP_USE_PEP517 environment variable or the "use-pep517"
+        config file option instead.
+        """
+        raise_option_error(parser, option=option, msg=msg)
+
+    # Otherwise, --no-use-pep517 was passed via the command-line.
+    parser.values.use_pep517 = False
+
+
+use_pep517 = partial(
+    Option,
+    '--use-pep517',
+    dest='use_pep517',
+    action='store_true',
+    default=None,
+    help='Use PEP 517 for building source distributions '
+         '(use --no-use-pep517 to force legacy behaviour).'
+)  # type: Any
+
+no_use_pep517 = partial(
+    Option,
+    '--no-use-pep517',
+    dest='use_pep517',
+    action='callback',
+    callback=_handle_no_use_pep517,
+    default=None,
+    help=SUPPRESS_HELP
+)  # type: Any
+
+install_options = partial(
+    Option,
+    '--install-option',
+    dest='install_options',
+    action='append',
+    metavar='options',
+    help="Extra arguments to be supplied to the setup.py install "
+         "command (use like --install-option=\"--install-scripts=/usr/local/"
+         "bin\"). Use multiple --install-option options to pass multiple "
+         "options to setup.py install. If you are using an option with a "
+         "directory path, be sure to use absolute path.",
+)  # type: Callable[..., Option]
+
+global_options = partial(
+    Option,
+    '--global-option',
+    dest='global_options',
+    action='append',
+    metavar='options',
+    help="Extra global options to be supplied to the setup.py "
+         "call before the install command.",
+)  # type: Callable[..., Option]
+
+no_clean = partial(
+    Option,
+    '--no-clean',
+    action='store_true',
+    default=False,
+    help="Don't clean up build directories."
+)  # type: Callable[..., Option]
+
+pre = partial(
+    Option,
+    '--pre',
+    action='store_true',
+    default=False,
+    help="Include pre-release and development versions. By default, "
+         "pip only finds stable versions.",
+)  # type: Callable[..., Option]
+
+disable_pip_version_check = partial(
+    Option,
+    "--disable-pip-version-check",
+    dest="disable_pip_version_check",
+    action="store_true",
+    default=False,
+    help="Don't periodically check PyPI to determine whether a new version "
+         "of pip is available for download. Implied with --no-index.",
+)  # type: Callable[..., Option]
+
+
+def _handle_merge_hash(option, opt_str, value, parser):
+    # type: (Option, str, str, OptionParser) -> None
+    """Given a value spelled "algo:digest", append the digest to a list
+    pointed to in a dict by the algo name."""
+    if not parser.values.hashes:
+        parser.values.hashes = {}
+    try:
+        algo, digest = value.split(':', 1)
+    except ValueError:
+        parser.error('Arguments to {} must be a hash name '  # noqa
+                     'followed by a value, like --hash=sha256:'
+                     'abcde...'.format(opt_str))
+    if algo not in STRONG_HASHES:
+        parser.error('Allowed hash algorithms for {} are {}.'.format(  # noqa
+                     opt_str, ', '.join(STRONG_HASHES)))
+    parser.values.hashes.setdefault(algo, []).append(digest)
+
+
+hash = partial(
+    Option,
+    '--hash',
+    # Hash values eventually end up in InstallRequirement.hashes due to
+    # __dict__ copying in process_line().
+    dest='hashes',
+    action='callback',
+    callback=_handle_merge_hash,
+    type='string',
+    help="Verify that the package's archive matches this "
+         'hash before installing. Example: --hash=sha256:abcdef...',
+)  # type: Callable[..., Option]
+
+
+require_hashes = partial(
+    Option,
+    '--require-hashes',
+    dest='require_hashes',
+    action='store_true',
+    default=False,
+    help='Require a hash to check each requirement against, for '
+         'repeatable installs. This option is implied when any package in a '
+         'requirements file has a --hash option.',
+)  # type: Callable[..., Option]
+
+
+list_path = partial(
+    PipOption,
+    '--path',
+    dest='path',
+    type='path',
+    action='append',
+    help='Restrict to the specified installation path for listing '
+         'packages (can be used multiple times).'
+)  # type: Callable[..., Option]
+
+
+def check_list_path_option(options):
+    # type: (Values) -> None
+    if options.path and (options.user or options.local):
+        raise CommandError(
+            "Cannot combine '--path' with '--user' or '--local'"
+        )
+
+
+no_python_version_warning = partial(
+    Option,
+    '--no-python-version-warning',
+    dest='no_python_version_warning',
+    action='store_true',
+    default=False,
+    help='Silence deprecation warnings for upcoming unsupported Pythons.',
+)  # type: Callable[..., Option]
+
+
+unstable_feature = partial(
+    Option,
+    '--unstable-feature',
+    dest='unstable_features',
+    metavar='feature',
+    action='append',
+    default=[],
+    choices=['resolver'],
+    help=SUPPRESS_HELP,  # TODO: drop this in pip 20.3
+)  # type: Callable[..., Option]
+
+use_new_feature = partial(
+    Option,
+    '--use-feature',
+    dest='features_enabled',
+    metavar='feature',
+    action='append',
+    default=[],
+    choices=['2020-resolver', 'fast-deps'],
+    help='Enable new functionality, that may be backward incompatible.',
+)  # type: Callable[..., Option]
+
+use_deprecated_feature = partial(
+    Option,
+    '--use-deprecated',
+    dest='deprecated_features_enabled',
+    metavar='feature',
+    action='append',
+    default=[],
+    choices=[],
+    help=(
+        'Enable deprecated functionality, that will be removed in the future.'
+    ),
+)  # type: Callable[..., Option]
+
+
+##########
+# groups #
+##########
+
+general_group = {
+    'name': 'General Options',
+    'options': [
+        help_,
+        isolated_mode,
+        require_virtualenv,
+        verbose,
+        version,
+        quiet,
+        log,
+        no_input,
+        proxy,
+        retries,
+        timeout,
+        exists_action,
+        trusted_host,
+        cert,
+        client_cert,
+        cache_dir,
+        no_cache,
+        disable_pip_version_check,
+        no_color,
+        no_python_version_warning,
+        unstable_feature,
+        use_new_feature,
+        use_deprecated_feature,
+    ]
+}  # type: Dict[str, Any]
+
+index_group = {
+    'name': 'Package Index Options',
+    'options': [
+        index_url,
+        extra_index_url,
+        no_index,
+        find_links,
+    ]
+}  # type: Dict[str, Any]
diff --git a/venv/Lib/site-packages/pip/_internal/cli/command_context.py b/venv/Lib/site-packages/pip/_internal/cli/command_context.py
new file mode 100644
index 000000000..d1a64a776
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/command_context.py
@@ -0,0 +1,36 @@
+from contextlib import contextmanager
+
+from pip._vendor.contextlib2 import ExitStack
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Iterator, ContextManager, TypeVar
+
+    _T = TypeVar('_T', covariant=True)
+
+
+class CommandContextMixIn(object):
+    def __init__(self):
+        # type: () -> None
+        super(CommandContextMixIn, self).__init__()
+        self._in_main_context = False
+        self._main_context = ExitStack()
+
+    @contextmanager
+    def main_context(self):
+        # type: () -> Iterator[None]
+        assert not self._in_main_context
+
+        self._in_main_context = True
+        try:
+            with self._main_context:
+                yield
+        finally:
+            self._in_main_context = False
+
+    def enter_context(self, context_provider):
+        # type: (ContextManager[_T]) -> _T
+        assert self._in_main_context
+
+        return self._main_context.enter_context(context_provider)
diff --git a/venv/Lib/site-packages/pip/_internal/cli/main.py b/venv/Lib/site-packages/pip/_internal/cli/main.py
new file mode 100644
index 000000000..172f30dd5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/main.py
@@ -0,0 +1,75 @@
+"""Primary application entrypoint.
+"""
+from __future__ import absolute_import
+
+import locale
+import logging
+import os
+import sys
+
+from pip._internal.cli.autocompletion import autocomplete
+from pip._internal.cli.main_parser import parse_command
+from pip._internal.commands import create_command
+from pip._internal.exceptions import PipError
+from pip._internal.utils import deprecation
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional
+
+logger = logging.getLogger(__name__)
+
+
+# Do not import and use main() directly! Using it directly is actively
+# discouraged by pip's maintainers. The name, location and behavior of
+# this function is subject to change, so calling it directly is not
+# portable across different pip versions.
+
+# In addition, running pip in-process is unsupported and unsafe. This is
+# elaborated in detail at
+# https://pip.pypa.io/en/stable/user_guide/#using-pip-from-your-program.
+# That document also provides suggestions that should work for nearly
+# all users that are considering importing and using main() directly.
+
+# However, we know that certain users will still want to invoke pip
+# in-process. If you understand and accept the implications of using pip
+# in an unsupported manner, the best approach is to use runpy to avoid
+# depending on the exact location of this entry point.
+
+# The following example shows how to use runpy to invoke pip in that
+# case:
+#
+#     sys.argv = ["pip", your, args, here]
+#     runpy.run_module("pip", run_name="__main__")
+#
+# Note that this will exit the process after running, unlike a direct
+# call to main. As it is not safe to do any processing after calling
+# main, this should not be an issue in practice.
+
+def main(args=None):
+    # type: (Optional[List[str]]) -> int
+    if args is None:
+        args = sys.argv[1:]
+
+    # Configure our deprecation warnings to be sent through loggers
+    deprecation.install_warning_logger()
+
+    autocomplete()
+
+    try:
+        cmd_name, cmd_args = parse_command(args)
+    except PipError as exc:
+        sys.stderr.write("ERROR: {}".format(exc))
+        sys.stderr.write(os.linesep)
+        sys.exit(1)
+
+    # Needed for locale.getpreferredencoding(False) to work
+    # in pip._internal.utils.encoding.auto_decode
+    try:
+        locale.setlocale(locale.LC_ALL, '')
+    except locale.Error as e:
+        # setlocale can apparently crash if locale are uninitialized
+        logger.debug("Ignoring error %s when setting locale", e)
+    command = create_command(cmd_name, isolated=("--isolated" in cmd_args))
+
+    return command.main(cmd_args)
diff --git a/venv/Lib/site-packages/pip/_internal/cli/main_parser.py b/venv/Lib/site-packages/pip/_internal/cli/main_parser.py
new file mode 100644
index 000000000..08c82c1f7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/main_parser.py
@@ -0,0 +1,99 @@
+"""A single place for constructing and exposing the main parser
+"""
+
+import os
+import sys
+
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.parser import (
+    ConfigOptionParser,
+    UpdatingDefaultsHelpFormatter,
+)
+from pip._internal.commands import commands_dict, get_similar_commands
+from pip._internal.exceptions import CommandError
+from pip._internal.utils.misc import get_pip_version, get_prog
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Tuple, List
+
+
+__all__ = ["create_main_parser", "parse_command"]
+
+
+def create_main_parser():
+    # type: () -> ConfigOptionParser
+    """Creates and returns the main parser for pip's CLI
+    """
+
+    parser_kw = {
+        'usage': '\n%prog <command> [options]',
+        'add_help_option': False,
+        'formatter': UpdatingDefaultsHelpFormatter(),
+        'name': 'global',
+        'prog': get_prog(),
+    }
+
+    parser = ConfigOptionParser(**parser_kw)
+    parser.disable_interspersed_args()
+
+    parser.version = get_pip_version()
+
+    # add the general options
+    gen_opts = cmdoptions.make_option_group(cmdoptions.general_group, parser)
+    parser.add_option_group(gen_opts)
+
+    # so the help formatter knows
+    parser.main = True  # type: ignore
+
+    # create command listing for description
+    description = [''] + [
+        '{name:27} {command_info.summary}'.format(**locals())
+        for name, command_info in commands_dict.items()
+    ]
+    parser.description = '\n'.join(description)
+
+    return parser
+
+
+def parse_command(args):
+    # type: (List[str]) -> Tuple[str, List[str]]
+    parser = create_main_parser()
+
+    # Note: parser calls disable_interspersed_args(), so the result of this
+    # call is to split the initial args into the general options before the
+    # subcommand and everything else.
+    # For example:
+    #  args: ['--timeout=5', 'install', '--user', 'INITools']
+    #  general_options: ['--timeout==5']
+    #  args_else: ['install', '--user', 'INITools']
+    general_options, args_else = parser.parse_args(args)
+
+    # --version
+    if general_options.version:
+        sys.stdout.write(parser.version)  # type: ignore
+        sys.stdout.write(os.linesep)
+        sys.exit()
+
+    # pip || pip help -> print_help()
+    if not args_else or (args_else[0] == 'help' and len(args_else) == 1):
+        parser.print_help()
+        sys.exit()
+
+    # the subcommand name
+    cmd_name = args_else[0]
+
+    if cmd_name not in commands_dict:
+        guess = get_similar_commands(cmd_name)
+
+        msg = ['unknown command "{}"'.format(cmd_name)]
+        if guess:
+            msg.append('maybe you meant "{}"'.format(guess))
+
+        raise CommandError(' - '.join(msg))
+
+    # all the args without the subcommand
+    cmd_args = args[:]
+    cmd_args.remove(cmd_name)
+
+    return cmd_name, cmd_args
diff --git a/venv/Lib/site-packages/pip/_internal/cli/parser.py b/venv/Lib/site-packages/pip/_internal/cli/parser.py
new file mode 100644
index 000000000..04e00b721
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/parser.py
@@ -0,0 +1,266 @@
+"""Base option parser setup"""
+
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import optparse
+import sys
+import textwrap
+from distutils.util import strtobool
+
+from pip._vendor.six import string_types
+
+from pip._internal.cli.status_codes import UNKNOWN_ERROR
+from pip._internal.configuration import Configuration, ConfigurationError
+from pip._internal.utils.compat import get_terminal_size
+
+logger = logging.getLogger(__name__)
+
+
+class PrettyHelpFormatter(optparse.IndentedHelpFormatter):
+    """A prettier/less verbose help formatter for optparse."""
+
+    def __init__(self, *args, **kwargs):
+        # help position must be aligned with __init__.parseopts.description
+        kwargs['max_help_position'] = 30
+        kwargs['indent_increment'] = 1
+        kwargs['width'] = get_terminal_size()[0] - 2
+        optparse.IndentedHelpFormatter.__init__(self, *args, **kwargs)
+
+    def format_option_strings(self, option):
+        return self._format_option_strings(option)
+
+    def _format_option_strings(self, option, mvarfmt=' <{}>', optsep=', '):
+        """
+        Return a comma-separated list of option strings and metavars.
+
+        :param option:  tuple of (short opt, long opt), e.g: ('-f', '--format')
+        :param mvarfmt: metavar format string
+        :param optsep:  separator
+        """
+        opts = []
+
+        if option._short_opts:
+            opts.append(option._short_opts[0])
+        if option._long_opts:
+            opts.append(option._long_opts[0])
+        if len(opts) > 1:
+            opts.insert(1, optsep)
+
+        if option.takes_value():
+            metavar = option.metavar or option.dest.lower()
+            opts.append(mvarfmt.format(metavar.lower()))
+
+        return ''.join(opts)
+
+    def format_heading(self, heading):
+        if heading == 'Options':
+            return ''
+        return heading + ':\n'
+
+    def format_usage(self, usage):
+        """
+        Ensure there is only one newline between usage and the first heading
+        if there is no description.
+        """
+        msg = '\nUsage: {}\n'.format(
+            self.indent_lines(textwrap.dedent(usage), "  "))
+        return msg
+
+    def format_description(self, description):
+        # leave full control over description to us
+        if description:
+            if hasattr(self.parser, 'main'):
+                label = 'Commands'
+            else:
+                label = 'Description'
+            # some doc strings have initial newlines, some don't
+            description = description.lstrip('\n')
+            # some doc strings have final newlines and spaces, some don't
+            description = description.rstrip()
+            # dedent, then reindent
+            description = self.indent_lines(textwrap.dedent(description), "  ")
+            description = '{}:\n{}\n'.format(label, description)
+            return description
+        else:
+            return ''
+
+    def format_epilog(self, epilog):
+        # leave full control over epilog to us
+        if epilog:
+            return epilog
+        else:
+            return ''
+
+    def indent_lines(self, text, indent):
+        new_lines = [indent + line for line in text.split('\n')]
+        return "\n".join(new_lines)
+
+
+class UpdatingDefaultsHelpFormatter(PrettyHelpFormatter):
+    """Custom help formatter for use in ConfigOptionParser.
+
+    This is updates the defaults before expanding them, allowing
+    them to show up correctly in the help listing.
+    """
+
+    def expand_default(self, option):
+        if self.parser is not None:
+            self.parser._update_defaults(self.parser.defaults)
+        return optparse.IndentedHelpFormatter.expand_default(self, option)
+
+
+class CustomOptionParser(optparse.OptionParser):
+
+    def insert_option_group(self, idx, *args, **kwargs):
+        """Insert an OptionGroup at a given position."""
+        group = self.add_option_group(*args, **kwargs)
+
+        self.option_groups.pop()
+        self.option_groups.insert(idx, group)
+
+        return group
+
+    @property
+    def option_list_all(self):
+        """Get a list of all options, including those in option groups."""
+        res = self.option_list[:]
+        for i in self.option_groups:
+            res.extend(i.option_list)
+
+        return res
+
+
+class ConfigOptionParser(CustomOptionParser):
+    """Custom option parser which updates its defaults by checking the
+    configuration files and environmental variables"""
+
+    def __init__(self, *args, **kwargs):
+        self.name = kwargs.pop('name')
+
+        isolated = kwargs.pop("isolated", False)
+        self.config = Configuration(isolated)
+
+        assert self.name
+        optparse.OptionParser.__init__(self, *args, **kwargs)
+
+    def check_default(self, option, key, val):
+        try:
+            return option.check_value(key, val)
+        except optparse.OptionValueError as exc:
+            print("An error occurred during configuration: {}".format(exc))
+            sys.exit(3)
+
+    def _get_ordered_configuration_items(self):
+        # Configuration gives keys in an unordered manner. Order them.
+        override_order = ["global", self.name, ":env:"]
+
+        # Pool the options into different groups
+        section_items = {name: [] for name in override_order}
+        for section_key, val in self.config.items():
+            # ignore empty values
+            if not val:
+                logger.debug(
+                    "Ignoring configuration key '%s' as it's value is empty.",
+                    section_key
+                )
+                continue
+
+            section, key = section_key.split(".", 1)
+            if section in override_order:
+                section_items[section].append((key, val))
+
+        # Yield each group in their override order
+        for section in override_order:
+            for key, val in section_items[section]:
+                yield key, val
+
+    def _update_defaults(self, defaults):
+        """Updates the given defaults with values from the config files and
+        the environ. Does a little special handling for certain types of
+        options (lists)."""
+
+        # Accumulate complex default state.
+        self.values = optparse.Values(self.defaults)
+        late_eval = set()
+        # Then set the options with those values
+        for key, val in self._get_ordered_configuration_items():
+            # '--' because configuration supports only long names
+            option = self.get_option('--' + key)
+
+            # Ignore options not present in this parser. E.g. non-globals put
+            # in [global] by users that want them to apply to all applicable
+            # commands.
+            if option is None:
+                continue
+
+            if option.action in ('store_true', 'store_false', 'count'):
+                try:
+                    val = strtobool(val)
+                except ValueError:
+                    error_msg = invalid_config_error_message(
+                        option.action, key, val
+                    )
+                    self.error(error_msg)
+
+            elif option.action == 'append':
+                val = val.split()
+                val = [self.check_default(option, key, v) for v in val]
+            elif option.action == 'callback':
+                late_eval.add(option.dest)
+                opt_str = option.get_opt_string()
+                val = option.convert_value(opt_str, val)
+                # From take_action
+                args = option.callback_args or ()
+                kwargs = option.callback_kwargs or {}
+                option.callback(option, opt_str, val, self, *args, **kwargs)
+            else:
+                val = self.check_default(option, key, val)
+
+            defaults[option.dest] = val
+
+        for key in late_eval:
+            defaults[key] = getattr(self.values, key)
+        self.values = None
+        return defaults
+
+    def get_default_values(self):
+        """Overriding to make updating the defaults after instantiation of
+        the option parser possible, _update_defaults() does the dirty work."""
+        if not self.process_default_values:
+            # Old, pre-Optik 1.5 behaviour.
+            return optparse.Values(self.defaults)
+
+        # Load the configuration, or error out in case of an error
+        try:
+            self.config.load()
+        except ConfigurationError as err:
+            self.exit(UNKNOWN_ERROR, str(err))
+
+        defaults = self._update_defaults(self.defaults.copy())  # ours
+        for option in self._get_all_options():
+            default = defaults.get(option.dest)
+            if isinstance(default, string_types):
+                opt_str = option.get_opt_string()
+                defaults[option.dest] = option.check_value(opt_str, default)
+        return optparse.Values(defaults)
+
+    def error(self, msg):
+        self.print_usage(sys.stderr)
+        self.exit(UNKNOWN_ERROR, "{}\n".format(msg))
+
+
+def invalid_config_error_message(action, key, val):
+    """Returns a better error message when invalid configuration option
+    is provided."""
+    if action in ('store_true', 'store_false'):
+        return ("{0} is not a valid value for {1} option, "
+                "please specify a boolean value like yes/no, "
+                "true/false or 1/0 instead.").format(val, key)
+
+    return ("{0} is not a valid value for {1} option, "
+            "please specify a numerical value like 1/0 "
+            "instead.").format(val, key)
diff --git a/venv/Lib/site-packages/pip/_internal/cli/progress_bars.py b/venv/Lib/site-packages/pip/_internal/cli/progress_bars.py
new file mode 100644
index 000000000..69338552f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/progress_bars.py
@@ -0,0 +1,280 @@
+from __future__ import division
+
+import itertools
+import sys
+from signal import SIGINT, default_int_handler, signal
+
+from pip._vendor import six
+from pip._vendor.progress.bar import Bar, FillingCirclesBar, IncrementalBar
+from pip._vendor.progress.spinner import Spinner
+
+from pip._internal.utils.compat import WINDOWS
+from pip._internal.utils.logging import get_indentation
+from pip._internal.utils.misc import format_size
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Dict, List
+
+try:
+    from pip._vendor import colorama
+# Lots of different errors can come from this, including SystemError and
+# ImportError.
+except Exception:
+    colorama = None
+
+
+def _select_progress_class(preferred, fallback):
+    # type: (Bar, Bar) -> Bar
+    encoding = getattr(preferred.file, "encoding", None)
+
+    # If we don't know what encoding this file is in, then we'll just assume
+    # that it doesn't support unicode and use the ASCII bar.
+    if not encoding:
+        return fallback
+
+    # Collect all of the possible characters we want to use with the preferred
+    # bar.
+    characters = [
+        getattr(preferred, "empty_fill", six.text_type()),
+        getattr(preferred, "fill", six.text_type()),
+    ]
+    characters += list(getattr(preferred, "phases", []))
+
+    # Try to decode the characters we're using for the bar using the encoding
+    # of the given file, if this works then we'll assume that we can use the
+    # fancier bar and if not we'll fall back to the plaintext bar.
+    try:
+        six.text_type().join(characters).encode(encoding)
+    except UnicodeEncodeError:
+        return fallback
+    else:
+        return preferred
+
+
+_BaseBar = _select_progress_class(IncrementalBar, Bar)  # type: Any
+
+
+class InterruptibleMixin(object):
+    """
+    Helper to ensure that self.finish() gets called on keyboard interrupt.
+
+    This allows downloads to be interrupted without leaving temporary state
+    (like hidden cursors) behind.
+
+    This class is similar to the progress library's existing SigIntMixin
+    helper, but as of version 1.2, that helper has the following problems:
+
+    1. It calls sys.exit().
+    2. It discards the existing SIGINT handler completely.
+    3. It leaves its own handler in place even after an uninterrupted finish,
+       which will have unexpected delayed effects if the user triggers an
+       unrelated keyboard interrupt some time after a progress-displaying
+       download has already completed, for example.
+    """
+
+    def __init__(self, *args, **kwargs):
+        # type: (List[Any], Dict[Any, Any]) -> None
+        """
+        Save the original SIGINT handler for later.
+        """
+        # https://github.com/python/mypy/issues/5887
+        super(InterruptibleMixin, self).__init__(  # type: ignore
+            *args,
+            **kwargs
+        )
+
+        self.original_handler = signal(SIGINT, self.handle_sigint)
+
+        # If signal() returns None, the previous handler was not installed from
+        # Python, and we cannot restore it. This probably should not happen,
+        # but if it does, we must restore something sensible instead, at least.
+        # The least bad option should be Python's default SIGINT handler, which
+        # just raises KeyboardInterrupt.
+        if self.original_handler is None:
+            self.original_handler = default_int_handler
+
+    def finish(self):
+        # type: () -> None
+        """
+        Restore the original SIGINT handler after finishing.
+
+        This should happen regardless of whether the progress display finishes
+        normally, or gets interrupted.
+        """
+        super(InterruptibleMixin, self).finish()  # type: ignore
+        signal(SIGINT, self.original_handler)
+
+    def handle_sigint(self, signum, frame):  # type: ignore
+        """
+        Call self.finish() before delegating to the original SIGINT handler.
+
+        This handler should only be in place while the progress display is
+        active.
+        """
+        self.finish()
+        self.original_handler(signum, frame)
+
+
+class SilentBar(Bar):
+
+    def update(self):
+        # type: () -> None
+        pass
+
+
+class BlueEmojiBar(IncrementalBar):
+
+    suffix = "%(percent)d%%"
+    bar_prefix = " "
+    bar_suffix = " "
+    phases = (u"\U0001F539", u"\U0001F537", u"\U0001F535")  # type: Any
+
+
+class DownloadProgressMixin(object):
+
+    def __init__(self, *args, **kwargs):
+        # type: (List[Any], Dict[Any, Any]) -> None
+        # https://github.com/python/mypy/issues/5887
+        super(DownloadProgressMixin, self).__init__(  # type: ignore
+            *args,
+            **kwargs
+        )
+        self.message = (" " * (
+            get_indentation() + 2
+        )) + self.message  # type: str
+
+    @property
+    def downloaded(self):
+        # type: () -> str
+        return format_size(self.index)  # type: ignore
+
+    @property
+    def download_speed(self):
+        # type: () -> str
+        # Avoid zero division errors...
+        if self.avg == 0.0:  # type: ignore
+            return "..."
+        return format_size(1 / self.avg) + "/s"  # type: ignore
+
+    @property
+    def pretty_eta(self):
+        # type: () -> str
+        if self.eta:  # type: ignore
+            return "eta {}".format(self.eta_td)  # type: ignore
+        return ""
+
+    def iter(self, it):  # type: ignore
+        for x in it:
+            yield x
+            # B305 is incorrectly raised here
+            # https://github.com/PyCQA/flake8-bugbear/issues/59
+            self.next(len(x))  # noqa: B305
+        self.finish()
+
+
+class WindowsMixin(object):
+
+    def __init__(self, *args, **kwargs):
+        # type: (List[Any], Dict[Any, Any]) -> None
+        # The Windows terminal does not support the hide/show cursor ANSI codes
+        # even with colorama. So we'll ensure that hide_cursor is False on
+        # Windows.
+        # This call needs to go before the super() call, so that hide_cursor
+        # is set in time. The base progress bar class writes the "hide cursor"
+        # code to the terminal in its init, so if we don't set this soon
+        # enough, we get a "hide" with no corresponding "show"...
+        if WINDOWS and self.hide_cursor:  # type: ignore
+            self.hide_cursor = False
+
+        # https://github.com/python/mypy/issues/5887
+        super(WindowsMixin, self).__init__(*args, **kwargs)  # type: ignore
+
+        # Check if we are running on Windows and we have the colorama module,
+        # if we do then wrap our file with it.
+        if WINDOWS and colorama:
+            self.file = colorama.AnsiToWin32(self.file)  # type: ignore
+            # The progress code expects to be able to call self.file.isatty()
+            # but the colorama.AnsiToWin32() object doesn't have that, so we'll
+            # add it.
+            self.file.isatty = lambda: self.file.wrapped.isatty()
+            # The progress code expects to be able to call self.file.flush()
+            # but the colorama.AnsiToWin32() object doesn't have that, so we'll
+            # add it.
+            self.file.flush = lambda: self.file.wrapped.flush()
+
+
+class BaseDownloadProgressBar(WindowsMixin, InterruptibleMixin,
+                              DownloadProgressMixin):
+
+    file = sys.stdout
+    message = "%(percent)d%%"
+    suffix = "%(downloaded)s %(download_speed)s %(pretty_eta)s"
+
+
+class DefaultDownloadProgressBar(BaseDownloadProgressBar,
+                                 _BaseBar):
+    pass
+
+
+class DownloadSilentBar(BaseDownloadProgressBar, SilentBar):
+    pass
+
+
+class DownloadBar(BaseDownloadProgressBar,
+                  Bar):
+    pass
+
+
+class DownloadFillingCirclesBar(BaseDownloadProgressBar,
+                                FillingCirclesBar):
+    pass
+
+
+class DownloadBlueEmojiProgressBar(BaseDownloadProgressBar,
+                                   BlueEmojiBar):
+    pass
+
+
+class DownloadProgressSpinner(WindowsMixin, InterruptibleMixin,
+                              DownloadProgressMixin, Spinner):
+
+    file = sys.stdout
+    suffix = "%(downloaded)s %(download_speed)s"
+
+    def next_phase(self):
+        # type: () -> str
+        if not hasattr(self, "_phaser"):
+            self._phaser = itertools.cycle(self.phases)
+        return next(self._phaser)
+
+    def update(self):
+        # type: () -> None
+        message = self.message % self
+        phase = self.next_phase()
+        suffix = self.suffix % self
+        line = ''.join([
+            message,
+            " " if message else "",
+            phase,
+            " " if suffix else "",
+            suffix,
+        ])
+
+        self.writeln(line)
+
+
+BAR_TYPES = {
+    "off": (DownloadSilentBar, DownloadSilentBar),
+    "on": (DefaultDownloadProgressBar, DownloadProgressSpinner),
+    "ascii": (DownloadBar, DownloadProgressSpinner),
+    "pretty": (DownloadFillingCirclesBar, DownloadProgressSpinner),
+    "emoji": (DownloadBlueEmojiProgressBar, DownloadProgressSpinner)
+}
+
+
+def DownloadProgressProvider(progress_bar, max=None):  # type: ignore
+    if max is None or max == 0:
+        return BAR_TYPES[progress_bar][1]().iter
+    else:
+        return BAR_TYPES[progress_bar][0](max=max).iter
diff --git a/venv/Lib/site-packages/pip/_internal/cli/req_command.py b/venv/Lib/site-packages/pip/_internal/cli/req_command.py
new file mode 100644
index 000000000..78b5ce6a1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/req_command.py
@@ -0,0 +1,402 @@
+"""Contains the Command base classes that depend on PipSession.
+
+The classes in this module are in a separate module so the commands not
+needing download / PackageFinder capability don't unnecessarily import the
+PackageFinder machinery and all its vendored dependencies, etc.
+"""
+
+import logging
+import os
+from functools import partial
+
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.command_context import CommandContextMixIn
+from pip._internal.exceptions import CommandError, PreviousBuildDirError
+from pip._internal.index.collector import LinkCollector
+from pip._internal.index.package_finder import PackageFinder
+from pip._internal.models.selection_prefs import SelectionPreferences
+from pip._internal.network.download import Downloader
+from pip._internal.network.session import PipSession
+from pip._internal.operations.prepare import RequirementPreparer
+from pip._internal.req.constructors import (
+    install_req_from_editable,
+    install_req_from_line,
+    install_req_from_parsed_requirement,
+    install_req_from_req_string,
+)
+from pip._internal.req.req_file import parse_requirements
+from pip._internal.self_outdated_check import pip_self_version_check
+from pip._internal.utils.temp_dir import tempdir_kinds
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import Any, List, Optional, Tuple
+
+    from pip._internal.cache import WheelCache
+    from pip._internal.models.target_python import TargetPython
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.req.req_tracker import RequirementTracker
+    from pip._internal.resolution.base import BaseResolver
+    from pip._internal.utils.temp_dir import (
+        TempDirectory,
+        TempDirectoryTypeRegistry,
+    )
+
+
+logger = logging.getLogger(__name__)
+
+
+class SessionCommandMixin(CommandContextMixIn):
+
+    """
+    A class mixin for command classes needing _build_session().
+    """
+    def __init__(self):
+        # type: () -> None
+        super(SessionCommandMixin, self).__init__()
+        self._session = None  # Optional[PipSession]
+
+    @classmethod
+    def _get_index_urls(cls, options):
+        # type: (Values) -> Optional[List[str]]
+        """Return a list of index urls from user-provided options."""
+        index_urls = []
+        if not getattr(options, "no_index", False):
+            url = getattr(options, "index_url", None)
+            if url:
+                index_urls.append(url)
+        urls = getattr(options, "extra_index_urls", None)
+        if urls:
+            index_urls.extend(urls)
+        # Return None rather than an empty list
+        return index_urls or None
+
+    def get_default_session(self, options):
+        # type: (Values) -> PipSession
+        """Get a default-managed session."""
+        if self._session is None:
+            self._session = self.enter_context(self._build_session(options))
+            # there's no type annotation on requests.Session, so it's
+            # automatically ContextManager[Any] and self._session becomes Any,
+            # then https://github.com/python/mypy/issues/7696 kicks in
+            assert self._session is not None
+        return self._session
+
+    def _build_session(self, options, retries=None, timeout=None):
+        # type: (Values, Optional[int], Optional[int]) -> PipSession
+        assert not options.cache_dir or os.path.isabs(options.cache_dir)
+        session = PipSession(
+            cache=(
+                os.path.join(options.cache_dir, "http")
+                if options.cache_dir else None
+            ),
+            retries=retries if retries is not None else options.retries,
+            trusted_hosts=options.trusted_hosts,
+            index_urls=self._get_index_urls(options),
+        )
+
+        # Handle custom ca-bundles from the user
+        if options.cert:
+            session.verify = options.cert
+
+        # Handle SSL client certificate
+        if options.client_cert:
+            session.cert = options.client_cert
+
+        # Handle timeouts
+        if options.timeout or timeout:
+            session.timeout = (
+                timeout if timeout is not None else options.timeout
+            )
+
+        # Handle configured proxies
+        if options.proxy:
+            session.proxies = {
+                "http": options.proxy,
+                "https": options.proxy,
+            }
+
+        # Determine if we can prompt the user for authentication or not
+        session.auth.prompting = not options.no_input
+
+        return session
+
+
+class IndexGroupCommand(Command, SessionCommandMixin):
+
+    """
+    Abstract base class for commands with the index_group options.
+
+    This also corresponds to the commands that permit the pip version check.
+    """
+
+    def handle_pip_version_check(self, options):
+        # type: (Values) -> None
+        """
+        Do the pip version check if not disabled.
+
+        This overrides the default behavior of not doing the check.
+        """
+        # Make sure the index_group options are present.
+        assert hasattr(options, 'no_index')
+
+        if options.disable_pip_version_check or options.no_index:
+            return
+
+        # Otherwise, check if we're using the latest version of pip available.
+        session = self._build_session(
+            options,
+            retries=0,
+            timeout=min(5, options.timeout)
+        )
+        with session:
+            pip_self_version_check(session, options)
+
+
+KEEPABLE_TEMPDIR_TYPES = [
+    tempdir_kinds.BUILD_ENV,
+    tempdir_kinds.EPHEM_WHEEL_CACHE,
+    tempdir_kinds.REQ_BUILD,
+]
+
+
+def with_cleanup(func):
+    # type: (Any) -> Any
+    """Decorator for common logic related to managing temporary
+    directories.
+    """
+    def configure_tempdir_registry(registry):
+        # type: (TempDirectoryTypeRegistry) -> None
+        for t in KEEPABLE_TEMPDIR_TYPES:
+            registry.set_delete(t, False)
+
+    def wrapper(self, options, args):
+        # type: (RequirementCommand, Values, List[Any]) -> Optional[int]
+        assert self.tempdir_registry is not None
+        if options.no_clean:
+            configure_tempdir_registry(self.tempdir_registry)
+
+        try:
+            return func(self, options, args)
+        except PreviousBuildDirError:
+            # This kind of conflict can occur when the user passes an explicit
+            # build directory with a pre-existing folder. In that case we do
+            # not want to accidentally remove it.
+            configure_tempdir_registry(self.tempdir_registry)
+            raise
+
+    return wrapper
+
+
+class RequirementCommand(IndexGroupCommand):
+
+    def __init__(self, *args, **kw):
+        # type: (Any, Any) -> None
+        super(RequirementCommand, self).__init__(*args, **kw)
+
+        self.cmd_opts.add_option(cmdoptions.no_clean())
+
+    @staticmethod
+    def make_requirement_preparer(
+        temp_build_dir,           # type: TempDirectory
+        options,                  # type: Values
+        req_tracker,              # type: RequirementTracker
+        session,                  # type: PipSession
+        finder,                   # type: PackageFinder
+        use_user_site,            # type: bool
+        download_dir=None,        # type: str
+        wheel_download_dir=None,  # type: str
+    ):
+        # type: (...) -> RequirementPreparer
+        """
+        Create a RequirementPreparer instance for the given parameters.
+        """
+        downloader = Downloader(session, progress_bar=options.progress_bar)
+
+        temp_build_dir_path = temp_build_dir.path
+        assert temp_build_dir_path is not None
+
+        return RequirementPreparer(
+            build_dir=temp_build_dir_path,
+            src_dir=options.src_dir,
+            download_dir=download_dir,
+            wheel_download_dir=wheel_download_dir,
+            build_isolation=options.build_isolation,
+            req_tracker=req_tracker,
+            downloader=downloader,
+            finder=finder,
+            require_hashes=options.require_hashes,
+            use_user_site=use_user_site,
+        )
+
+    @staticmethod
+    def make_resolver(
+        preparer,                            # type: RequirementPreparer
+        finder,                              # type: PackageFinder
+        options,                             # type: Values
+        wheel_cache=None,                    # type: Optional[WheelCache]
+        use_user_site=False,                 # type: bool
+        ignore_installed=True,               # type: bool
+        ignore_requires_python=False,        # type: bool
+        force_reinstall=False,               # type: bool
+        upgrade_strategy="to-satisfy-only",  # type: str
+        use_pep517=None,                     # type: Optional[bool]
+        py_version_info=None            # type: Optional[Tuple[int, ...]]
+    ):
+        # type: (...) -> BaseResolver
+        """
+        Create a Resolver instance for the given parameters.
+        """
+        make_install_req = partial(
+            install_req_from_req_string,
+            isolated=options.isolated_mode,
+            use_pep517=use_pep517,
+        )
+        # The long import name and duplicated invocation is needed to convince
+        # Mypy into correctly typechecking. Otherwise it would complain the
+        # "Resolver" class being redefined.
+        if '2020-resolver' in options.features_enabled:
+            import pip._internal.resolution.resolvelib.resolver
+            return pip._internal.resolution.resolvelib.resolver.Resolver(
+                preparer=preparer,
+                finder=finder,
+                wheel_cache=wheel_cache,
+                make_install_req=make_install_req,
+                use_user_site=use_user_site,
+                ignore_dependencies=options.ignore_dependencies,
+                ignore_installed=ignore_installed,
+                ignore_requires_python=ignore_requires_python,
+                force_reinstall=force_reinstall,
+                upgrade_strategy=upgrade_strategy,
+                py_version_info=py_version_info,
+                lazy_wheel='fast-deps' in options.features_enabled,
+            )
+        import pip._internal.resolution.legacy.resolver
+        return pip._internal.resolution.legacy.resolver.Resolver(
+            preparer=preparer,
+            finder=finder,
+            wheel_cache=wheel_cache,
+            make_install_req=make_install_req,
+            use_user_site=use_user_site,
+            ignore_dependencies=options.ignore_dependencies,
+            ignore_installed=ignore_installed,
+            ignore_requires_python=ignore_requires_python,
+            force_reinstall=force_reinstall,
+            upgrade_strategy=upgrade_strategy,
+            py_version_info=py_version_info,
+        )
+
+    def get_requirements(
+        self,
+        args,             # type: List[str]
+        options,          # type: Values
+        finder,           # type: PackageFinder
+        session,          # type: PipSession
+    ):
+        # type: (...) -> List[InstallRequirement]
+        """
+        Parse command-line arguments into the corresponding requirements.
+        """
+        requirements = []  # type: List[InstallRequirement]
+        for filename in options.constraints:
+            for parsed_req in parse_requirements(
+                    filename,
+                    constraint=True, finder=finder, options=options,
+                    session=session):
+                req_to_add = install_req_from_parsed_requirement(
+                    parsed_req,
+                    isolated=options.isolated_mode,
+                    user_supplied=False,
+                )
+                requirements.append(req_to_add)
+
+        for req in args:
+            req_to_add = install_req_from_line(
+                req, None, isolated=options.isolated_mode,
+                use_pep517=options.use_pep517,
+                user_supplied=True,
+            )
+            requirements.append(req_to_add)
+
+        for req in options.editables:
+            req_to_add = install_req_from_editable(
+                req,
+                user_supplied=True,
+                isolated=options.isolated_mode,
+                use_pep517=options.use_pep517,
+            )
+            requirements.append(req_to_add)
+
+        # NOTE: options.require_hashes may be set if --require-hashes is True
+        for filename in options.requirements:
+            for parsed_req in parse_requirements(
+                    filename,
+                    finder=finder, options=options, session=session):
+                req_to_add = install_req_from_parsed_requirement(
+                    parsed_req,
+                    isolated=options.isolated_mode,
+                    use_pep517=options.use_pep517,
+                    user_supplied=True,
+                )
+                requirements.append(req_to_add)
+
+        # If any requirement has hash options, enable hash checking.
+        if any(req.has_hash_options for req in requirements):
+            options.require_hashes = True
+
+        if not (args or options.editables or options.requirements):
+            opts = {'name': self.name}
+            if options.find_links:
+                raise CommandError(
+                    'You must give at least one requirement to {name} '
+                    '(maybe you meant "pip {name} {links}"?)'.format(
+                        **dict(opts, links=' '.join(options.find_links))))
+            else:
+                raise CommandError(
+                    'You must give at least one requirement to {name} '
+                    '(see "pip help {name}")'.format(**opts))
+
+        return requirements
+
+    @staticmethod
+    def trace_basic_info(finder):
+        # type: (PackageFinder) -> None
+        """
+        Trace basic information about the provided objects.
+        """
+        # Display where finder is looking for packages
+        search_scope = finder.search_scope
+        locations = search_scope.get_formatted_locations()
+        if locations:
+            logger.info(locations)
+
+    def _build_package_finder(
+        self,
+        options,               # type: Values
+        session,               # type: PipSession
+        target_python=None,    # type: Optional[TargetPython]
+        ignore_requires_python=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> PackageFinder
+        """
+        Create a package finder appropriate to this requirement command.
+
+        :param ignore_requires_python: Whether to ignore incompatible
+            "Requires-Python" values in links. Defaults to False.
+        """
+        link_collector = LinkCollector.create(session, options=options)
+        selection_prefs = SelectionPreferences(
+            allow_yanked=True,
+            format_control=options.format_control,
+            allow_all_prereleases=options.pre,
+            prefer_binary=options.prefer_binary,
+            ignore_requires_python=ignore_requires_python,
+        )
+
+        return PackageFinder.create(
+            link_collector=link_collector,
+            selection_prefs=selection_prefs,
+            target_python=target_python,
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/cli/spinners.py b/venv/Lib/site-packages/pip/_internal/cli/spinners.py
new file mode 100644
index 000000000..c6c4c5cd1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/spinners.py
@@ -0,0 +1,173 @@
+from __future__ import absolute_import, division
+
+import contextlib
+import itertools
+import logging
+import sys
+import time
+
+from pip._vendor.progress import HIDE_CURSOR, SHOW_CURSOR
+
+from pip._internal.utils.compat import WINDOWS
+from pip._internal.utils.logging import get_indentation
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Iterator, IO
+
+logger = logging.getLogger(__name__)
+
+
+class SpinnerInterface(object):
+    def spin(self):
+        # type: () -> None
+        raise NotImplementedError()
+
+    def finish(self, final_status):
+        # type: (str) -> None
+        raise NotImplementedError()
+
+
+class InteractiveSpinner(SpinnerInterface):
+    def __init__(self, message, file=None, spin_chars="-\\|/",
+                 # Empirically, 8 updates/second looks nice
+                 min_update_interval_seconds=0.125):
+        # type: (str, IO[str], str, float) -> None
+        self._message = message
+        if file is None:
+            file = sys.stdout
+        self._file = file
+        self._rate_limiter = RateLimiter(min_update_interval_seconds)
+        self._finished = False
+
+        self._spin_cycle = itertools.cycle(spin_chars)
+
+        self._file.write(" " * get_indentation() + self._message + " ... ")
+        self._width = 0
+
+    def _write(self, status):
+        # type: (str) -> None
+        assert not self._finished
+        # Erase what we wrote before by backspacing to the beginning, writing
+        # spaces to overwrite the old text, and then backspacing again
+        backup = "\b" * self._width
+        self._file.write(backup + " " * self._width + backup)
+        # Now we have a blank slate to add our status
+        self._file.write(status)
+        self._width = len(status)
+        self._file.flush()
+        self._rate_limiter.reset()
+
+    def spin(self):
+        # type: () -> None
+        if self._finished:
+            return
+        if not self._rate_limiter.ready():
+            return
+        self._write(next(self._spin_cycle))
+
+    def finish(self, final_status):
+        # type: (str) -> None
+        if self._finished:
+            return
+        self._write(final_status)
+        self._file.write("\n")
+        self._file.flush()
+        self._finished = True
+
+
+# Used for dumb terminals, non-interactive installs (no tty), etc.
+# We still print updates occasionally (once every 60 seconds by default) to
+# act as a keep-alive for systems like Travis-CI that take lack-of-output as
+# an indication that a task has frozen.
+class NonInteractiveSpinner(SpinnerInterface):
+    def __init__(self, message, min_update_interval_seconds=60):
+        # type: (str, float) -> None
+        self._message = message
+        self._finished = False
+        self._rate_limiter = RateLimiter(min_update_interval_seconds)
+        self._update("started")
+
+    def _update(self, status):
+        # type: (str) -> None
+        assert not self._finished
+        self._rate_limiter.reset()
+        logger.info("%s: %s", self._message, status)
+
+    def spin(self):
+        # type: () -> None
+        if self._finished:
+            return
+        if not self._rate_limiter.ready():
+            return
+        self._update("still running...")
+
+    def finish(self, final_status):
+        # type: (str) -> None
+        if self._finished:
+            return
+        self._update(
+            "finished with status '{final_status}'".format(**locals()))
+        self._finished = True
+
+
+class RateLimiter(object):
+    def __init__(self, min_update_interval_seconds):
+        # type: (float) -> None
+        self._min_update_interval_seconds = min_update_interval_seconds
+        self._last_update = 0  # type: float
+
+    def ready(self):
+        # type: () -> bool
+        now = time.time()
+        delta = now - self._last_update
+        return delta >= self._min_update_interval_seconds
+
+    def reset(self):
+        # type: () -> None
+        self._last_update = time.time()
+
+
+@contextlib.contextmanager
+def open_spinner(message):
+    # type: (str) -> Iterator[SpinnerInterface]
+    # Interactive spinner goes directly to sys.stdout rather than being routed
+    # through the logging system, but it acts like it has level INFO,
+    # i.e. it's only displayed if we're at level INFO or better.
+    # Non-interactive spinner goes through the logging system, so it is always
+    # in sync with logging configuration.
+    if sys.stdout.isatty() and logger.getEffectiveLevel() <= logging.INFO:
+        spinner = InteractiveSpinner(message)  # type: SpinnerInterface
+    else:
+        spinner = NonInteractiveSpinner(message)
+    try:
+        with hidden_cursor(sys.stdout):
+            yield spinner
+    except KeyboardInterrupt:
+        spinner.finish("canceled")
+        raise
+    except Exception:
+        spinner.finish("error")
+        raise
+    else:
+        spinner.finish("done")
+
+
+@contextlib.contextmanager
+def hidden_cursor(file):
+    # type: (IO[str]) -> Iterator[None]
+    # The Windows terminal does not support the hide/show cursor ANSI codes,
+    # even via colorama. So don't even try.
+    if WINDOWS:
+        yield
+    # We don't want to clutter the output with control characters if we're
+    # writing to a file, or if the user is running with --quiet.
+    # See https://github.com/pypa/pip/issues/3418
+    elif not file.isatty() or logger.getEffectiveLevel() > logging.INFO:
+        yield
+    else:
+        file.write(HIDE_CURSOR)
+        try:
+            yield
+        finally:
+            file.write(SHOW_CURSOR)
diff --git a/venv/Lib/site-packages/pip/_internal/cli/status_codes.py b/venv/Lib/site-packages/pip/_internal/cli/status_codes.py
new file mode 100644
index 000000000..275360a31
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/cli/status_codes.py
@@ -0,0 +1,8 @@
+from __future__ import absolute_import
+
+SUCCESS = 0
+ERROR = 1
+UNKNOWN_ERROR = 2
+VIRTUALENV_NOT_FOUND = 3
+PREVIOUS_BUILD_DIR_ERROR = 4
+NO_MATCHES_FOUND = 23
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__init__.py b/venv/Lib/site-packages/pip/_internal/commands/__init__.py
new file mode 100644
index 000000000..6825fa6e2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/__init__.py
@@ -0,0 +1,122 @@
+"""
+Package containing all pip commands
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+# There is currently a bug in python/typeshed mentioned at
+# https://github.com/python/typeshed/issues/3906 which causes the
+# return type of difflib.get_close_matches to be reported
+# as List[Sequence[str]] whereas it should have been List[str]
+
+from __future__ import absolute_import
+
+import importlib
+from collections import OrderedDict, namedtuple
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any
+    from pip._internal.cli.base_command import Command
+
+
+CommandInfo = namedtuple('CommandInfo', 'module_path, class_name, summary')
+
+# The ordering matters for help display.
+#    Also, even though the module path starts with the same
+# "pip._internal.commands" prefix in each case, we include the full path
+# because it makes testing easier (specifically when modifying commands_dict
+# in test setup / teardown by adding info for a FakeCommand class defined
+# in a test-related module).
+#    Finally, we need to pass an iterable of pairs here rather than a dict
+# so that the ordering won't be lost when using Python 2.7.
+commands_dict = OrderedDict([
+    ('install', CommandInfo(
+        'pip._internal.commands.install', 'InstallCommand',
+        'Install packages.',
+    )),
+    ('download', CommandInfo(
+        'pip._internal.commands.download', 'DownloadCommand',
+        'Download packages.',
+    )),
+    ('uninstall', CommandInfo(
+        'pip._internal.commands.uninstall', 'UninstallCommand',
+        'Uninstall packages.',
+    )),
+    ('freeze', CommandInfo(
+        'pip._internal.commands.freeze', 'FreezeCommand',
+        'Output installed packages in requirements format.',
+    )),
+    ('list', CommandInfo(
+        'pip._internal.commands.list', 'ListCommand',
+        'List installed packages.',
+    )),
+    ('show', CommandInfo(
+        'pip._internal.commands.show', 'ShowCommand',
+        'Show information about installed packages.',
+    )),
+    ('check', CommandInfo(
+        'pip._internal.commands.check', 'CheckCommand',
+        'Verify installed packages have compatible dependencies.',
+    )),
+    ('config', CommandInfo(
+        'pip._internal.commands.configuration', 'ConfigurationCommand',
+        'Manage local and global configuration.',
+    )),
+    ('search', CommandInfo(
+        'pip._internal.commands.search', 'SearchCommand',
+        'Search PyPI for packages.',
+    )),
+    ('cache', CommandInfo(
+        'pip._internal.commands.cache', 'CacheCommand',
+        "Inspect and manage pip's wheel cache.",
+    )),
+    ('wheel', CommandInfo(
+        'pip._internal.commands.wheel', 'WheelCommand',
+        'Build wheels from your requirements.',
+    )),
+    ('hash', CommandInfo(
+        'pip._internal.commands.hash', 'HashCommand',
+        'Compute hashes of package archives.',
+    )),
+    ('completion', CommandInfo(
+        'pip._internal.commands.completion', 'CompletionCommand',
+        'A helper command used for command completion.',
+    )),
+    ('debug', CommandInfo(
+        'pip._internal.commands.debug', 'DebugCommand',
+        'Show information useful for debugging.',
+    )),
+    ('help', CommandInfo(
+        'pip._internal.commands.help', 'HelpCommand',
+        'Show help for commands.',
+    )),
+])  # type: OrderedDict[str, CommandInfo]
+
+
+def create_command(name, **kwargs):
+    # type: (str, **Any) -> Command
+    """
+    Create an instance of the Command class with the given name.
+    """
+    module_path, class_name, summary = commands_dict[name]
+    module = importlib.import_module(module_path)
+    command_class = getattr(module, class_name)
+    command = command_class(name=name, summary=summary, **kwargs)
+
+    return command
+
+
+def get_similar_commands(name):
+    """Command name auto-correct."""
+    from difflib import get_close_matches
+
+    name = name.lower()
+
+    close_commands = get_close_matches(name, commands_dict.keys())
+
+    if close_commands:
+        return close_commands[0]
+    else:
+        return False
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..864475d75
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/cache.cpython-36.pyc
new file mode 100644
index 000000000..a89494c89
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/check.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/check.cpython-36.pyc
new file mode 100644
index 000000000..1c7c034c7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/completion.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/completion.cpython-36.pyc
new file mode 100644
index 000000000..86a2f577d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/completion.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/configuration.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/configuration.cpython-36.pyc
new file mode 100644
index 000000000..d868d5c98
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/configuration.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/debug.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/debug.cpython-36.pyc
new file mode 100644
index 000000000..8bb30322d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/debug.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/download.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/download.cpython-36.pyc
new file mode 100644
index 000000000..d2b7867a2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/download.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/freeze.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/freeze.cpython-36.pyc
new file mode 100644
index 000000000..76662cdbf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/freeze.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/hash.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/hash.cpython-36.pyc
new file mode 100644
index 000000000..167a68b5d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/hash.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/help.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/help.cpython-36.pyc
new file mode 100644
index 000000000..f48583094
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/help.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/install.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/install.cpython-36.pyc
new file mode 100644
index 000000000..7325aed27
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/list.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/list.cpython-36.pyc
new file mode 100644
index 000000000..4073b4a76
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/list.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/search.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/search.cpython-36.pyc
new file mode 100644
index 000000000..4a4333d06
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/search.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/show.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/show.cpython-36.pyc
new file mode 100644
index 000000000..a26c365f9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/show.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/uninstall.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/uninstall.cpython-36.pyc
new file mode 100644
index 000000000..d6666208b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/uninstall.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..a5b5a83c6
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/commands/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/commands/cache.py b/venv/Lib/site-packages/pip/_internal/commands/cache.py
new file mode 100644
index 000000000..747277f6e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/cache.py
@@ -0,0 +1,182 @@
+from __future__ import absolute_import
+
+import logging
+import os
+import textwrap
+
+import pip._internal.utils.filesystem as filesystem
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.exceptions import CommandError, PipError
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import Any, List
+
+
+logger = logging.getLogger(__name__)
+
+
+class CacheCommand(Command):
+    """
+    Inspect and manage pip's wheel cache.
+
+    Subcommands:
+
+    - dir: Show the cache directory.
+    - info: Show information about the cache.
+    - list: List filenames of packages stored in the cache.
+    - remove: Remove one or more package from the cache.
+    - purge: Remove all items from the cache.
+
+    ``<pattern>`` can be a glob expression or a package name.
+    """
+
+    ignore_require_venv = True
+    usage = """
+        %prog dir
+        %prog info
+        %prog list [<pattern>]
+        %prog remove <pattern>
+        %prog purge
+    """
+
+    def run(self, options, args):
+        # type: (Values, List[Any]) -> int
+        handlers = {
+            "dir": self.get_cache_dir,
+            "info": self.get_cache_info,
+            "list": self.list_cache_items,
+            "remove": self.remove_cache_items,
+            "purge": self.purge_cache,
+        }
+
+        if not options.cache_dir:
+            logger.error("pip cache commands can not "
+                         "function since cache is disabled.")
+            return ERROR
+
+        # Determine action
+        if not args or args[0] not in handlers:
+            logger.error(
+                "Need an action (%s) to perform.",
+                ", ".join(sorted(handlers)),
+            )
+            return ERROR
+
+        action = args[0]
+
+        # Error handling happens here, not in the action-handlers.
+        try:
+            handlers[action](options, args[1:])
+        except PipError as e:
+            logger.error(e.args[0])
+            return ERROR
+
+        return SUCCESS
+
+    def get_cache_dir(self, options, args):
+        # type: (Values, List[Any]) -> None
+        if args:
+            raise CommandError('Too many arguments')
+
+        logger.info(options.cache_dir)
+
+    def get_cache_info(self, options, args):
+        # type: (Values, List[Any]) -> None
+        if args:
+            raise CommandError('Too many arguments')
+
+        num_packages = len(self._find_wheels(options, '*'))
+
+        cache_location = self._wheels_cache_dir(options)
+        cache_size = filesystem.format_directory_size(cache_location)
+
+        message = textwrap.dedent("""
+            Location: {location}
+            Size: {size}
+            Number of wheels: {package_count}
+        """).format(
+            location=cache_location,
+            package_count=num_packages,
+            size=cache_size,
+        ).strip()
+
+        logger.info(message)
+
+    def list_cache_items(self, options, args):
+        # type: (Values, List[Any]) -> None
+        if len(args) > 1:
+            raise CommandError('Too many arguments')
+
+        if args:
+            pattern = args[0]
+        else:
+            pattern = '*'
+
+        files = self._find_wheels(options, pattern)
+
+        if not files:
+            logger.info('Nothing cached.')
+            return
+
+        results = []
+        for filename in files:
+            wheel = os.path.basename(filename)
+            size = filesystem.format_file_size(filename)
+            results.append(' - {} ({})'.format(wheel, size))
+        logger.info('Cache contents:\n')
+        logger.info('\n'.join(sorted(results)))
+
+    def remove_cache_items(self, options, args):
+        # type: (Values, List[Any]) -> None
+        if len(args) > 1:
+            raise CommandError('Too many arguments')
+
+        if not args:
+            raise CommandError('Please provide a pattern')
+
+        files = self._find_wheels(options, args[0])
+        if not files:
+            raise CommandError('No matching packages')
+
+        for filename in files:
+            os.unlink(filename)
+            logger.debug('Removed %s', filename)
+        logger.info('Files removed: %s', len(files))
+
+    def purge_cache(self, options, args):
+        # type: (Values, List[Any]) -> None
+        if args:
+            raise CommandError('Too many arguments')
+
+        return self.remove_cache_items(options, ['*'])
+
+    def _wheels_cache_dir(self, options):
+        # type: (Values) -> str
+        return os.path.join(options.cache_dir, 'wheels')
+
+    def _find_wheels(self, options, pattern):
+        # type: (Values, str) -> List[str]
+        wheel_dir = self._wheels_cache_dir(options)
+
+        # The wheel filename format, as specified in PEP 427, is:
+        #     {distribution}-{version}(-{build})?-{python}-{abi}-{platform}.whl
+        #
+        # Additionally, non-alphanumeric values in the distribution are
+        # normalized to underscores (_), meaning hyphens can never occur
+        # before `-{version}`.
+        #
+        # Given that information:
+        # - If the pattern we're given contains a hyphen (-), the user is
+        #   providing at least the version. Thus, we can just append `*.whl`
+        #   to match the rest of it.
+        # - If the pattern we're given doesn't contain a hyphen (-), the
+        #   user is only providing the name. Thus, we append `-*.whl` to
+        #   match the hyphen before the version, followed by anything else.
+        #
+        # PEP 427: https://www.python.org/dev/peps/pep-0427/
+        pattern = pattern + ("*.whl" if "-" in pattern else "-*.whl")
+
+        return filesystem.find_files(wheel_dir, pattern)
diff --git a/venv/Lib/site-packages/pip/_internal/commands/check.py b/venv/Lib/site-packages/pip/_internal/commands/check.py
new file mode 100644
index 000000000..b557ca641
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/check.py
@@ -0,0 +1,51 @@
+import logging
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.operations.check import (
+    check_package_set,
+    create_package_set_from_installed,
+)
+from pip._internal.utils.misc import write_output
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+logger = logging.getLogger(__name__)
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Any
+    from optparse import Values
+
+
+class CheckCommand(Command):
+    """Verify installed packages have compatible dependencies."""
+
+    usage = """
+      %prog [options]"""
+
+    def run(self, options, args):
+        # type: (Values, List[Any]) -> int
+
+        package_set, parsing_probs = create_package_set_from_installed()
+        missing, conflicting = check_package_set(package_set)
+
+        for project_name in missing:
+            version = package_set[project_name].version
+            for dependency in missing[project_name]:
+                write_output(
+                    "%s %s requires %s, which is not installed.",
+                    project_name, version, dependency[0],
+                )
+
+        for project_name in conflicting:
+            version = package_set[project_name].version
+            for dep_name, dep_version, req in conflicting[project_name]:
+                write_output(
+                    "%s %s has requirement %s, but you have %s %s.",
+                    project_name, version, req, dep_name, dep_version,
+                )
+
+        if missing or conflicting or parsing_probs:
+            return ERROR
+        else:
+            write_output("No broken requirements found.")
+            return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/completion.py b/venv/Lib/site-packages/pip/_internal/commands/completion.py
new file mode 100644
index 000000000..9b99f51f0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/completion.py
@@ -0,0 +1,98 @@
+from __future__ import absolute_import
+
+import sys
+import textwrap
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.utils.misc import get_prog
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List
+    from optparse import Values
+
+BASE_COMPLETION = """
+# pip {shell} completion start{script}# pip {shell} completion end
+"""
+
+COMPLETION_SCRIPTS = {
+    'bash': """
+        _pip_completion()
+        {{
+            COMPREPLY=( $( COMP_WORDS="${{COMP_WORDS[*]}}" \\
+                           COMP_CWORD=$COMP_CWORD \\
+                           PIP_AUTO_COMPLETE=1 $1 2>/dev/null ) )
+        }}
+        complete -o default -F _pip_completion {prog}
+    """,
+    'zsh': """
+        function _pip_completion {{
+          local words cword
+          read -Ac words
+          read -cn cword
+          reply=( $( COMP_WORDS="$words[*]" \\
+                     COMP_CWORD=$(( cword-1 )) \\
+                     PIP_AUTO_COMPLETE=1 $words[1] 2>/dev/null ))
+        }}
+        compctl -K _pip_completion {prog}
+    """,
+    'fish': """
+        function __fish_complete_pip
+            set -lx COMP_WORDS (commandline -o) ""
+            set -lx COMP_CWORD ( \\
+                math (contains -i -- (commandline -t) $COMP_WORDS)-1 \\
+            )
+            set -lx PIP_AUTO_COMPLETE 1
+            string split \\  -- (eval $COMP_WORDS[1])
+        end
+        complete -fa "(__fish_complete_pip)" -c {prog}
+    """,
+}
+
+
+class CompletionCommand(Command):
+    """A helper command to be used for command completion."""
+
+    ignore_require_venv = True
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '--bash', '-b',
+            action='store_const',
+            const='bash',
+            dest='shell',
+            help='Emit completion code for bash')
+        self.cmd_opts.add_option(
+            '--zsh', '-z',
+            action='store_const',
+            const='zsh',
+            dest='shell',
+            help='Emit completion code for zsh')
+        self.cmd_opts.add_option(
+            '--fish', '-f',
+            action='store_const',
+            const='fish',
+            dest='shell',
+            help='Emit completion code for fish')
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        #  type: (Values, List[str]) -> int
+        """Prints the completion code of the given shell"""
+        shells = COMPLETION_SCRIPTS.keys()
+        shell_options = ['--' + shell for shell in sorted(shells)]
+        if options.shell in shells:
+            script = textwrap.dedent(
+                COMPLETION_SCRIPTS.get(options.shell, '').format(
+                    prog=get_prog())
+            )
+            print(BASE_COMPLETION.format(script=script, shell=options.shell))
+            return SUCCESS
+        else:
+            sys.stderr.write(
+                'ERROR: You must pass {}\n' .format(' or '.join(shell_options))
+            )
+            return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/configuration.py b/venv/Lib/site-packages/pip/_internal/commands/configuration.py
new file mode 100644
index 000000000..f9b3ab79d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/configuration.py
@@ -0,0 +1,284 @@
+import logging
+import os
+import subprocess
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.configuration import (
+    Configuration,
+    get_configuration_files,
+    kinds,
+)
+from pip._internal.exceptions import PipError
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import get_prog, write_output
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Any, Optional
+    from optparse import Values
+
+    from pip._internal.configuration import Kind
+
+logger = logging.getLogger(__name__)
+
+
+class ConfigurationCommand(Command):
+    """
+    Manage local and global configuration.
+
+    Subcommands:
+
+    - list: List the active configuration (or from the file specified)
+    - edit: Edit the configuration file in an editor
+    - get: Get the value associated with name
+    - set: Set the name=value
+    - unset: Unset the value associated with name
+    - debug: List the configuration files and values defined under them
+
+    If none of --user, --global and --site are passed, a virtual
+    environment configuration file is used if one is active and the file
+    exists. Otherwise, all modifications happen on the to the user file by
+    default.
+    """
+
+    ignore_require_venv = True
+    usage = """
+        %prog [<file-option>] list
+        %prog [<file-option>] [--editor <editor-path>] edit
+
+        %prog [<file-option>] get name
+        %prog [<file-option>] set name value
+        %prog [<file-option>] unset name
+        %prog [<file-option>] debug
+    """
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '--editor',
+            dest='editor',
+            action='store',
+            default=None,
+            help=(
+                'Editor to use to edit the file. Uses VISUAL or EDITOR '
+                'environment variables if not provided.'
+            )
+        )
+
+        self.cmd_opts.add_option(
+            '--global',
+            dest='global_file',
+            action='store_true',
+            default=False,
+            help='Use the system-wide configuration file only'
+        )
+
+        self.cmd_opts.add_option(
+            '--user',
+            dest='user_file',
+            action='store_true',
+            default=False,
+            help='Use the user configuration file only'
+        )
+
+        self.cmd_opts.add_option(
+            '--site',
+            dest='site_file',
+            action='store_true',
+            default=False,
+            help='Use the current environment configuration file only'
+        )
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        handlers = {
+            "list": self.list_values,
+            "edit": self.open_in_editor,
+            "get": self.get_name,
+            "set": self.set_name_value,
+            "unset": self.unset_name,
+            "debug": self.list_config_values,
+        }
+
+        # Determine action
+        if not args or args[0] not in handlers:
+            logger.error(
+                "Need an action (%s) to perform.",
+                ", ".join(sorted(handlers)),
+            )
+            return ERROR
+
+        action = args[0]
+
+        # Determine which configuration files are to be loaded
+        #    Depends on whether the command is modifying.
+        try:
+            load_only = self._determine_file(
+                options, need_value=(action in ["get", "set", "unset", "edit"])
+            )
+        except PipError as e:
+            logger.error(e.args[0])
+            return ERROR
+
+        # Load a new configuration
+        self.configuration = Configuration(
+            isolated=options.isolated_mode, load_only=load_only
+        )
+        self.configuration.load()
+
+        # Error handling happens here, not in the action-handlers.
+        try:
+            handlers[action](options, args[1:])
+        except PipError as e:
+            logger.error(e.args[0])
+            return ERROR
+
+        return SUCCESS
+
+    def _determine_file(self, options, need_value):
+        # type: (Values, bool) -> Optional[Kind]
+        file_options = [key for key, value in (
+            (kinds.USER, options.user_file),
+            (kinds.GLOBAL, options.global_file),
+            (kinds.SITE, options.site_file),
+        ) if value]
+
+        if not file_options:
+            if not need_value:
+                return None
+            # Default to user, unless there's a site file.
+            elif any(
+                os.path.exists(site_config_file)
+                for site_config_file in get_configuration_files()[kinds.SITE]
+            ):
+                return kinds.SITE
+            else:
+                return kinds.USER
+        elif len(file_options) == 1:
+            return file_options[0]
+
+        raise PipError(
+            "Need exactly one file to operate upon "
+            "(--user, --site, --global) to perform."
+        )
+
+    def list_values(self, options, args):
+        # type: (Values, List[str]) -> None
+        self._get_n_args(args, "list", n=0)
+
+        for key, value in sorted(self.configuration.items()):
+            write_output("%s=%r", key, value)
+
+    def get_name(self, options, args):
+        # type: (Values, List[str]) -> None
+        key = self._get_n_args(args, "get [name]", n=1)
+        value = self.configuration.get_value(key)
+
+        write_output("%s", value)
+
+    def set_name_value(self, options, args):
+        # type: (Values, List[str]) -> None
+        key, value = self._get_n_args(args, "set [name] [value]", n=2)
+        self.configuration.set_value(key, value)
+
+        self._save_configuration()
+
+    def unset_name(self, options, args):
+        # type: (Values, List[str]) -> None
+        key = self._get_n_args(args, "unset [name]", n=1)
+        self.configuration.unset_value(key)
+
+        self._save_configuration()
+
+    def list_config_values(self, options, args):
+        # type: (Values, List[str]) -> None
+        """List config key-value pairs across different config files"""
+        self._get_n_args(args, "debug", n=0)
+
+        self.print_env_var_values()
+        # Iterate over config files and print if they exist, and the
+        # key-value pairs present in them if they do
+        for variant, files in sorted(self.configuration.iter_config_files()):
+            write_output("%s:", variant)
+            for fname in files:
+                with indent_log():
+                    file_exists = os.path.exists(fname)
+                    write_output("%s, exists: %r",
+                                 fname, file_exists)
+                    if file_exists:
+                        self.print_config_file_values(variant)
+
+    def print_config_file_values(self, variant):
+        # type: (Kind) -> None
+        """Get key-value pairs from the file of a variant"""
+        for name, value in self.configuration.\
+                get_values_in_config(variant).items():
+            with indent_log():
+                write_output("%s: %s", name, value)
+
+    def print_env_var_values(self):
+        # type: () -> None
+        """Get key-values pairs present as environment variables"""
+        write_output("%s:", 'env_var')
+        with indent_log():
+            for key, value in sorted(self.configuration.get_environ_vars()):
+                env_var = 'PIP_{}'.format(key.upper())
+                write_output("%s=%r", env_var, value)
+
+    def open_in_editor(self, options, args):
+        # type: (Values, List[str]) -> None
+        editor = self._determine_editor(options)
+
+        fname = self.configuration.get_file_to_edit()
+        if fname is None:
+            raise PipError("Could not determine appropriate file.")
+
+        try:
+            subprocess.check_call([editor, fname])
+        except subprocess.CalledProcessError as e:
+            raise PipError(
+                "Editor Subprocess exited with exit code {}"
+                .format(e.returncode)
+            )
+
+    def _get_n_args(self, args, example, n):
+        # type: (List[str], str, int) -> Any
+        """Helper to make sure the command got the right number of arguments
+        """
+        if len(args) != n:
+            msg = (
+                'Got unexpected number of arguments, expected {}. '
+                '(example: "{} config {}")'
+            ).format(n, get_prog(), example)
+            raise PipError(msg)
+
+        if n == 1:
+            return args[0]
+        else:
+            return args
+
+    def _save_configuration(self):
+        # type: () -> None
+        # We successfully ran a modifying command. Need to save the
+        # configuration.
+        try:
+            self.configuration.save()
+        except Exception:
+            logger.exception(
+                "Unable to save configuration. Please report this as a bug."
+            )
+            raise PipError("Internal Error.")
+
+    def _determine_editor(self, options):
+        # type: (Values) -> str
+        if options.editor is not None:
+            return options.editor
+        elif "VISUAL" in os.environ:
+            return os.environ["VISUAL"]
+        elif "EDITOR" in os.environ:
+            return os.environ["EDITOR"]
+        else:
+            raise PipError("Could not determine editor to use.")
diff --git a/venv/Lib/site-packages/pip/_internal/commands/debug.py b/venv/Lib/site-packages/pip/_internal/commands/debug.py
new file mode 100644
index 000000000..ff369d7d9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/debug.py
@@ -0,0 +1,229 @@
+from __future__ import absolute_import
+
+import locale
+import logging
+import os
+import sys
+
+import pip._vendor
+from pip._vendor import pkg_resources
+from pip._vendor.certifi import where
+
+from pip import __file__ as pip_location
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.cmdoptions import make_target_python
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import get_pip_version
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from types import ModuleType
+    from typing import List, Optional, Dict
+    from optparse import Values
+    from pip._internal.configuration import Configuration
+
+logger = logging.getLogger(__name__)
+
+
+def show_value(name, value):
+    # type: (str, Optional[str]) -> None
+    logger.info('%s: %s', name, value)
+
+
+def show_sys_implementation():
+    # type: () -> None
+    logger.info('sys.implementation:')
+    if hasattr(sys, 'implementation'):
+        implementation = sys.implementation  # type: ignore
+        implementation_name = implementation.name
+    else:
+        implementation_name = ''
+
+    with indent_log():
+        show_value('name', implementation_name)
+
+
+def create_vendor_txt_map():
+    # type: () -> Dict[str, str]
+    vendor_txt_path = os.path.join(
+        os.path.dirname(pip_location),
+        '_vendor',
+        'vendor.txt'
+    )
+
+    with open(vendor_txt_path) as f:
+        # Purge non version specifying lines.
+        # Also, remove any space prefix or suffixes (including comments).
+        lines = [line.strip().split(' ', 1)[0]
+                 for line in f.readlines() if '==' in line]
+
+    # Transform into "module" -> version dict.
+    return dict(line.split('==', 1) for line in lines)  # type: ignore
+
+
+def get_module_from_module_name(module_name):
+    # type: (str) -> ModuleType
+    # Module name can be uppercase in vendor.txt for some reason...
+    module_name = module_name.lower()
+    # PATCH: setuptools is actually only pkg_resources.
+    if module_name == 'setuptools':
+        module_name = 'pkg_resources'
+
+    __import__(
+        'pip._vendor.{}'.format(module_name),
+        globals(),
+        locals(),
+        level=0
+    )
+    return getattr(pip._vendor, module_name)
+
+
+def get_vendor_version_from_module(module_name):
+    # type: (str) -> Optional[str]
+    module = get_module_from_module_name(module_name)
+    version = getattr(module, '__version__', None)
+
+    if not version:
+        # Try to find version in debundled module info
+        # The type for module.__file__ is Optional[str] in
+        # Python 2, and str in Python 3. The type: ignore is
+        # added to account for Python 2, instead of a cast
+        # and should be removed once we drop Python 2 support
+        pkg_set = pkg_resources.WorkingSet(
+            [os.path.dirname(module.__file__)]  # type: ignore
+        )
+        package = pkg_set.find(pkg_resources.Requirement.parse(module_name))
+        version = getattr(package, 'version', None)
+
+    return version
+
+
+def show_actual_vendor_versions(vendor_txt_versions):
+    # type: (Dict[str, str]) -> None
+    """Log the actual version and print extra info if there is
+    a conflict or if the actual version could not be imported.
+    """
+    for module_name, expected_version in vendor_txt_versions.items():
+        extra_message = ''
+        actual_version = get_vendor_version_from_module(module_name)
+        if not actual_version:
+            extra_message = ' (Unable to locate actual module version, using'\
+                            ' vendor.txt specified version)'
+            actual_version = expected_version
+        elif actual_version != expected_version:
+            extra_message = ' (CONFLICT: vendor.txt suggests version should'\
+                            ' be {})'.format(expected_version)
+        logger.info('%s==%s%s', module_name, actual_version, extra_message)
+
+
+def show_vendor_versions():
+    # type: () -> None
+    logger.info('vendored library versions:')
+
+    vendor_txt_versions = create_vendor_txt_map()
+    with indent_log():
+        show_actual_vendor_versions(vendor_txt_versions)
+
+
+def show_tags(options):
+    # type: (Values) -> None
+    tag_limit = 10
+
+    target_python = make_target_python(options)
+    tags = target_python.get_tags()
+
+    # Display the target options that were explicitly provided.
+    formatted_target = target_python.format_given()
+    suffix = ''
+    if formatted_target:
+        suffix = ' (target: {})'.format(formatted_target)
+
+    msg = 'Compatible tags: {}{}'.format(len(tags), suffix)
+    logger.info(msg)
+
+    if options.verbose < 1 and len(tags) > tag_limit:
+        tags_limited = True
+        tags = tags[:tag_limit]
+    else:
+        tags_limited = False
+
+    with indent_log():
+        for tag in tags:
+            logger.info(str(tag))
+
+        if tags_limited:
+            msg = (
+                '...\n'
+                '[First {tag_limit} tags shown. Pass --verbose to show all.]'
+            ).format(tag_limit=tag_limit)
+            logger.info(msg)
+
+
+def ca_bundle_info(config):
+    # type: (Configuration) -> str
+    levels = set()
+    for key, _ in config.items():
+        levels.add(key.split('.')[0])
+
+    if not levels:
+        return "Not specified"
+
+    levels_that_override_global = ['install', 'wheel', 'download']
+    global_overriding_level = [
+        level for level in levels if level in levels_that_override_global
+    ]
+    if not global_overriding_level:
+        return 'global'
+
+    if 'global' in levels:
+        levels.remove('global')
+    return ", ".join(levels)
+
+
+class DebugCommand(Command):
+    """
+    Display debug information.
+    """
+
+    usage = """
+      %prog <options>"""
+    ignore_require_venv = True
+
+    def add_options(self):
+        # type: () -> None
+        cmdoptions.add_target_python_options(self.cmd_opts)
+        self.parser.insert_option_group(0, self.cmd_opts)
+        self.parser.config.load()
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        logger.warning(
+            "This command is only meant for debugging. "
+            "Do not use this with automation for parsing and getting these "
+            "details, since the output and options of this command may "
+            "change without notice."
+        )
+        show_value('pip version', get_pip_version())
+        show_value('sys.version', sys.version)
+        show_value('sys.executable', sys.executable)
+        show_value('sys.getdefaultencoding', sys.getdefaultencoding())
+        show_value('sys.getfilesystemencoding', sys.getfilesystemencoding())
+        show_value(
+            'locale.getpreferredencoding', locale.getpreferredencoding(),
+        )
+        show_value('sys.platform', sys.platform)
+        show_sys_implementation()
+
+        show_value("'cert' config value", ca_bundle_info(self.parser.config))
+        show_value("REQUESTS_CA_BUNDLE", os.environ.get('REQUESTS_CA_BUNDLE'))
+        show_value("CURL_CA_BUNDLE", os.environ.get('CURL_CA_BUNDLE'))
+        show_value("pip._vendor.certifi.where()", where())
+        show_value("pip._vendor.DEBUNDLED", pip._vendor.DEBUNDLED)
+
+        show_vendor_versions()
+
+        show_tags(options)
+
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/download.py b/venv/Lib/site-packages/pip/_internal/commands/download.py
new file mode 100644
index 000000000..46e837126
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/download.py
@@ -0,0 +1,143 @@
+from __future__ import absolute_import
+
+import logging
+import os
+
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.cmdoptions import make_target_python
+from pip._internal.cli.req_command import RequirementCommand, with_cleanup
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.req.req_tracker import get_requirement_tracker
+from pip._internal.utils.misc import ensure_dir, normalize_path, write_output
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List
+
+logger = logging.getLogger(__name__)
+
+
+class DownloadCommand(RequirementCommand):
+    """
+    Download packages from:
+
+    - PyPI (and other indexes) using requirement specifiers.
+    - VCS project urls.
+    - Local project directories.
+    - Local or remote source archives.
+
+    pip also supports downloading from "requirements files", which provide
+    an easy way to specify a whole environment to be downloaded.
+    """
+
+    usage = """
+      %prog [options] <requirement specifier> [package-index-options] ...
+      %prog [options] -r <requirements file> [package-index-options] ...
+      %prog [options] <vcs project url> ...
+      %prog [options] <local project path> ...
+      %prog [options] <archive url/path> ..."""
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(cmdoptions.constraints())
+        self.cmd_opts.add_option(cmdoptions.requirements())
+        self.cmd_opts.add_option(cmdoptions.build_dir())
+        self.cmd_opts.add_option(cmdoptions.no_deps())
+        self.cmd_opts.add_option(cmdoptions.global_options())
+        self.cmd_opts.add_option(cmdoptions.no_binary())
+        self.cmd_opts.add_option(cmdoptions.only_binary())
+        self.cmd_opts.add_option(cmdoptions.prefer_binary())
+        self.cmd_opts.add_option(cmdoptions.src())
+        self.cmd_opts.add_option(cmdoptions.pre())
+        self.cmd_opts.add_option(cmdoptions.require_hashes())
+        self.cmd_opts.add_option(cmdoptions.progress_bar())
+        self.cmd_opts.add_option(cmdoptions.no_build_isolation())
+        self.cmd_opts.add_option(cmdoptions.use_pep517())
+        self.cmd_opts.add_option(cmdoptions.no_use_pep517())
+
+        self.cmd_opts.add_option(
+            '-d', '--dest', '--destination-dir', '--destination-directory',
+            dest='download_dir',
+            metavar='dir',
+            default=os.curdir,
+            help=("Download packages into <dir>."),
+        )
+
+        cmdoptions.add_target_python_options(self.cmd_opts)
+
+        index_opts = cmdoptions.make_option_group(
+            cmdoptions.index_group,
+            self.parser,
+        )
+
+        self.parser.insert_option_group(0, index_opts)
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    @with_cleanup
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+
+        options.ignore_installed = True
+        # editable doesn't really make sense for `pip download`, but the bowels
+        # of the RequirementSet code require that property.
+        options.editables = []
+
+        cmdoptions.check_dist_restriction(options)
+
+        options.download_dir = normalize_path(options.download_dir)
+
+        ensure_dir(options.download_dir)
+
+        session = self.get_default_session(options)
+
+        target_python = make_target_python(options)
+        finder = self._build_package_finder(
+            options=options,
+            session=session,
+            target_python=target_python,
+        )
+        build_delete = (not (options.no_clean or options.build_dir))
+
+        req_tracker = self.enter_context(get_requirement_tracker())
+
+        directory = TempDirectory(
+            options.build_dir,
+            delete=build_delete,
+            kind="download",
+            globally_managed=True,
+        )
+
+        reqs = self.get_requirements(args, options, finder, session)
+
+        preparer = self.make_requirement_preparer(
+            temp_build_dir=directory,
+            options=options,
+            req_tracker=req_tracker,
+            session=session,
+            finder=finder,
+            download_dir=options.download_dir,
+            use_user_site=False,
+        )
+
+        resolver = self.make_resolver(
+            preparer=preparer,
+            finder=finder,
+            options=options,
+            py_version_info=options.python_version,
+        )
+
+        self.trace_basic_info(finder)
+
+        requirement_set = resolver.resolve(
+            reqs, check_supported_wheels=True
+        )
+
+        downloaded = ' '.join([req.name  # type: ignore
+                               for req in requirement_set.requirements.values()
+                               if req.successfully_downloaded])
+        if downloaded:
+            write_output('Successfully downloaded %s', downloaded)
+
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/freeze.py b/venv/Lib/site-packages/pip/_internal/commands/freeze.py
new file mode 100644
index 000000000..2071fbabd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/freeze.py
@@ -0,0 +1,103 @@
+from __future__ import absolute_import
+
+import sys
+
+from pip._internal.cache import WheelCache
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.models.format_control import FormatControl
+from pip._internal.operations.freeze import freeze
+from pip._internal.utils.compat import stdlib_pkgs
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+DEV_PKGS = {'pip', 'setuptools', 'distribute', 'wheel'}
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List
+
+
+class FreezeCommand(Command):
+    """
+    Output installed packages in requirements format.
+
+    packages are listed in a case-insensitive sorted order.
+    """
+
+    usage = """
+      %prog [options]"""
+    log_streams = ("ext://sys.stderr", "ext://sys.stderr")
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-r', '--requirement',
+            dest='requirements',
+            action='append',
+            default=[],
+            metavar='file',
+            help="Use the order in the given requirements file and its "
+                 "comments when generating output. This option can be "
+                 "used multiple times.")
+        self.cmd_opts.add_option(
+            '-f', '--find-links',
+            dest='find_links',
+            action='append',
+            default=[],
+            metavar='URL',
+            help='URL for finding packages, which will be added to the '
+                 'output.')
+        self.cmd_opts.add_option(
+            '-l', '--local',
+            dest='local',
+            action='store_true',
+            default=False,
+            help='If in a virtualenv that has global access, do not output '
+                 'globally-installed packages.')
+        self.cmd_opts.add_option(
+            '--user',
+            dest='user',
+            action='store_true',
+            default=False,
+            help='Only output packages installed in user-site.')
+        self.cmd_opts.add_option(cmdoptions.list_path())
+        self.cmd_opts.add_option(
+            '--all',
+            dest='freeze_all',
+            action='store_true',
+            help='Do not skip these packages in the output:'
+                 ' {}'.format(', '.join(DEV_PKGS)))
+        self.cmd_opts.add_option(
+            '--exclude-editable',
+            dest='exclude_editable',
+            action='store_true',
+            help='Exclude editable package from output.')
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        format_control = FormatControl(set(), set())
+        wheel_cache = WheelCache(options.cache_dir, format_control)
+        skip = set(stdlib_pkgs)
+        if not options.freeze_all:
+            skip.update(DEV_PKGS)
+
+        cmdoptions.check_list_path_option(options)
+
+        freeze_kwargs = dict(
+            requirement=options.requirements,
+            find_links=options.find_links,
+            local_only=options.local,
+            user_only=options.user,
+            paths=options.path,
+            isolated=options.isolated_mode,
+            wheel_cache=wheel_cache,
+            skip=skip,
+            exclude_editable=options.exclude_editable,
+        )
+
+        for line in freeze(**freeze_kwargs):
+            sys.stdout.write(line + '\n')
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/hash.py b/venv/Lib/site-packages/pip/_internal/commands/hash.py
new file mode 100644
index 000000000..37831c395
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/hash.py
@@ -0,0 +1,63 @@
+from __future__ import absolute_import
+
+import hashlib
+import logging
+import sys
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.utils.hashes import FAVORITE_HASH, STRONG_HASHES
+from pip._internal.utils.misc import read_chunks, write_output
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List
+
+logger = logging.getLogger(__name__)
+
+
+class HashCommand(Command):
+    """
+    Compute a hash of a local package archive.
+
+    These can be used with --hash in a requirements file to do repeatable
+    installs.
+    """
+
+    usage = '%prog [options] <file> ...'
+    ignore_require_venv = True
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-a', '--algorithm',
+            dest='algorithm',
+            choices=STRONG_HASHES,
+            action='store',
+            default=FAVORITE_HASH,
+            help='The hash algorithm to use: one of {}'.format(
+                 ', '.join(STRONG_HASHES)))
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        if not args:
+            self.parser.print_usage(sys.stderr)
+            return ERROR
+
+        algorithm = options.algorithm
+        for path in args:
+            write_output('%s:\n--hash=%s:%s',
+                         path, algorithm, _hash_of_file(path, algorithm))
+        return SUCCESS
+
+
+def _hash_of_file(path, algorithm):
+    # type: (str, str) -> str
+    """Return the hash digest of a file."""
+    with open(path, 'rb') as archive:
+        hash = hashlib.new(algorithm)
+        for chunk in read_chunks(archive):
+            hash.update(chunk)
+    return hash.hexdigest()
diff --git a/venv/Lib/site-packages/pip/_internal/commands/help.py b/venv/Lib/site-packages/pip/_internal/commands/help.py
new file mode 100644
index 000000000..a2edc2989
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/help.py
@@ -0,0 +1,44 @@
+from __future__ import absolute_import
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.exceptions import CommandError
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List
+    from optparse import Values
+
+
+class HelpCommand(Command):
+    """Show help for commands"""
+
+    usage = """
+      %prog <command>"""
+    ignore_require_venv = True
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        from pip._internal.commands import (
+            commands_dict, create_command, get_similar_commands,
+        )
+
+        try:
+            # 'pip help' with no args is handled by pip.__init__.parseopt()
+            cmd_name = args[0]  # the command we need help for
+        except IndexError:
+            return SUCCESS
+
+        if cmd_name not in commands_dict:
+            guess = get_similar_commands(cmd_name)
+
+            msg = ['unknown command "{}"'.format(cmd_name)]
+            if guess:
+                msg.append('maybe you meant "{}"'.format(guess))
+
+            raise CommandError(' - '.join(msg))
+
+        command = create_command(cmd_name)
+        command.parser.print_help()
+
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/install.py b/venv/Lib/site-packages/pip/_internal/commands/install.py
new file mode 100644
index 000000000..704e2d656
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/install.py
@@ -0,0 +1,749 @@
+from __future__ import absolute_import
+
+import errno
+import logging
+import operator
+import os
+import shutil
+import site
+from optparse import SUPPRESS_HELP
+
+from pip._vendor import pkg_resources
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.cache import WheelCache
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.cmdoptions import make_target_python
+from pip._internal.cli.req_command import RequirementCommand, with_cleanup
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.exceptions import CommandError, InstallationError
+from pip._internal.locations import distutils_scheme
+from pip._internal.operations.check import check_install_conflicts
+from pip._internal.req import install_given_reqs
+from pip._internal.req.req_tracker import get_requirement_tracker
+from pip._internal.utils.datetime import today_is_later_than
+from pip._internal.utils.distutils_args import parse_distutils_args
+from pip._internal.utils.filesystem import test_writable_dir
+from pip._internal.utils.misc import (
+    ensure_dir,
+    get_installed_version,
+    get_pip_version,
+    protect_pip_from_modification_on_windows,
+    write_output,
+)
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.virtualenv import virtualenv_no_global
+from pip._internal.wheel_builder import build, should_build_for_install_command
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import Iterable, List, Optional
+
+    from pip._internal.models.format_control import FormatControl
+    from pip._internal.operations.check import ConflictDetails
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.wheel_builder import BinaryAllowedPredicate
+
+
+logger = logging.getLogger(__name__)
+
+
+def get_check_binary_allowed(format_control):
+    # type: (FormatControl) -> BinaryAllowedPredicate
+    def check_binary_allowed(req):
+        # type: (InstallRequirement) -> bool
+        if req.use_pep517:
+            return True
+        canonical_name = canonicalize_name(req.name)
+        allowed_formats = format_control.get_allowed_formats(canonical_name)
+        return "binary" in allowed_formats
+
+    return check_binary_allowed
+
+
+class InstallCommand(RequirementCommand):
+    """
+    Install packages from:
+
+    - PyPI (and other indexes) using requirement specifiers.
+    - VCS project urls.
+    - Local project directories.
+    - Local or remote source archives.
+
+    pip also supports installing from "requirements files", which provide
+    an easy way to specify a whole environment to be installed.
+    """
+
+    usage = """
+      %prog [options] <requirement specifier> [package-index-options] ...
+      %prog [options] -r <requirements file> [package-index-options] ...
+      %prog [options] [-e] <vcs project url> ...
+      %prog [options] [-e] <local project path> ...
+      %prog [options] <archive url/path> ..."""
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(cmdoptions.requirements())
+        self.cmd_opts.add_option(cmdoptions.constraints())
+        self.cmd_opts.add_option(cmdoptions.no_deps())
+        self.cmd_opts.add_option(cmdoptions.pre())
+
+        self.cmd_opts.add_option(cmdoptions.editable())
+        self.cmd_opts.add_option(
+            '-t', '--target',
+            dest='target_dir',
+            metavar='dir',
+            default=None,
+            help='Install packages into <dir>. '
+                 'By default this will not replace existing files/folders in '
+                 '<dir>. Use --upgrade to replace existing packages in <dir> '
+                 'with new versions.'
+        )
+        cmdoptions.add_target_python_options(self.cmd_opts)
+
+        self.cmd_opts.add_option(
+            '--user',
+            dest='use_user_site',
+            action='store_true',
+            help="Install to the Python user install directory for your "
+                 "platform. Typically ~/.local/, or %APPDATA%\\Python on "
+                 "Windows. (See the Python documentation for site.USER_BASE "
+                 "for full details.)")
+        self.cmd_opts.add_option(
+            '--no-user',
+            dest='use_user_site',
+            action='store_false',
+            help=SUPPRESS_HELP)
+        self.cmd_opts.add_option(
+            '--root',
+            dest='root_path',
+            metavar='dir',
+            default=None,
+            help="Install everything relative to this alternate root "
+                 "directory.")
+        self.cmd_opts.add_option(
+            '--prefix',
+            dest='prefix_path',
+            metavar='dir',
+            default=None,
+            help="Installation prefix where lib, bin and other top-level "
+                 "folders are placed")
+
+        self.cmd_opts.add_option(cmdoptions.build_dir())
+
+        self.cmd_opts.add_option(cmdoptions.src())
+
+        self.cmd_opts.add_option(
+            '-U', '--upgrade',
+            dest='upgrade',
+            action='store_true',
+            help='Upgrade all specified packages to the newest available '
+                 'version. The handling of dependencies depends on the '
+                 'upgrade-strategy used.'
+        )
+
+        self.cmd_opts.add_option(
+            '--upgrade-strategy',
+            dest='upgrade_strategy',
+            default='only-if-needed',
+            choices=['only-if-needed', 'eager'],
+            help='Determines how dependency upgrading should be handled '
+                 '[default: %default]. '
+                 '"eager" - dependencies are upgraded regardless of '
+                 'whether the currently installed version satisfies the '
+                 'requirements of the upgraded package(s). '
+                 '"only-if-needed" -  are upgraded only when they do not '
+                 'satisfy the requirements of the upgraded package(s).'
+        )
+
+        self.cmd_opts.add_option(
+            '--force-reinstall',
+            dest='force_reinstall',
+            action='store_true',
+            help='Reinstall all packages even if they are already '
+                 'up-to-date.')
+
+        self.cmd_opts.add_option(
+            '-I', '--ignore-installed',
+            dest='ignore_installed',
+            action='store_true',
+            help='Ignore the installed packages, overwriting them. '
+                 'This can break your system if the existing package '
+                 'is of a different version or was installed '
+                 'with a different package manager!'
+        )
+
+        self.cmd_opts.add_option(cmdoptions.ignore_requires_python())
+        self.cmd_opts.add_option(cmdoptions.no_build_isolation())
+        self.cmd_opts.add_option(cmdoptions.use_pep517())
+        self.cmd_opts.add_option(cmdoptions.no_use_pep517())
+
+        self.cmd_opts.add_option(cmdoptions.install_options())
+        self.cmd_opts.add_option(cmdoptions.global_options())
+
+        self.cmd_opts.add_option(
+            "--compile",
+            action="store_true",
+            dest="compile",
+            default=True,
+            help="Compile Python source files to bytecode",
+        )
+
+        self.cmd_opts.add_option(
+            "--no-compile",
+            action="store_false",
+            dest="compile",
+            help="Do not compile Python source files to bytecode",
+        )
+
+        self.cmd_opts.add_option(
+            "--no-warn-script-location",
+            action="store_false",
+            dest="warn_script_location",
+            default=True,
+            help="Do not warn when installing scripts outside PATH",
+        )
+        self.cmd_opts.add_option(
+            "--no-warn-conflicts",
+            action="store_false",
+            dest="warn_about_conflicts",
+            default=True,
+            help="Do not warn about broken dependencies",
+        )
+
+        self.cmd_opts.add_option(cmdoptions.no_binary())
+        self.cmd_opts.add_option(cmdoptions.only_binary())
+        self.cmd_opts.add_option(cmdoptions.prefer_binary())
+        self.cmd_opts.add_option(cmdoptions.require_hashes())
+        self.cmd_opts.add_option(cmdoptions.progress_bar())
+
+        index_opts = cmdoptions.make_option_group(
+            cmdoptions.index_group,
+            self.parser,
+        )
+
+        self.parser.insert_option_group(0, index_opts)
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    @with_cleanup
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        if options.use_user_site and options.target_dir is not None:
+            raise CommandError("Can not combine '--user' and '--target'")
+
+        cmdoptions.check_install_build_global(options)
+        upgrade_strategy = "to-satisfy-only"
+        if options.upgrade:
+            upgrade_strategy = options.upgrade_strategy
+
+        cmdoptions.check_dist_restriction(options, check_target=True)
+
+        install_options = options.install_options or []
+
+        logger.debug("Using %s", get_pip_version())
+        options.use_user_site = decide_user_install(
+            options.use_user_site,
+            prefix_path=options.prefix_path,
+            target_dir=options.target_dir,
+            root_path=options.root_path,
+            isolated_mode=options.isolated_mode,
+        )
+
+        target_temp_dir = None  # type: Optional[TempDirectory]
+        target_temp_dir_path = None  # type: Optional[str]
+        if options.target_dir:
+            options.ignore_installed = True
+            options.target_dir = os.path.abspath(options.target_dir)
+            if (os.path.exists(options.target_dir) and not
+                    os.path.isdir(options.target_dir)):
+                raise CommandError(
+                    "Target path exists but is not a directory, will not "
+                    "continue."
+                )
+
+            # Create a target directory for using with the target option
+            target_temp_dir = TempDirectory(kind="target")
+            target_temp_dir_path = target_temp_dir.path
+            self.enter_context(target_temp_dir)
+
+        global_options = options.global_options or []
+
+        session = self.get_default_session(options)
+
+        target_python = make_target_python(options)
+        finder = self._build_package_finder(
+            options=options,
+            session=session,
+            target_python=target_python,
+            ignore_requires_python=options.ignore_requires_python,
+        )
+        build_delete = (not (options.no_clean or options.build_dir))
+        wheel_cache = WheelCache(options.cache_dir, options.format_control)
+
+        req_tracker = self.enter_context(get_requirement_tracker())
+
+        directory = TempDirectory(
+            options.build_dir,
+            delete=build_delete,
+            kind="install",
+            globally_managed=True,
+        )
+
+        try:
+            reqs = self.get_requirements(args, options, finder, session)
+
+            reject_location_related_install_options(
+                reqs, options.install_options
+            )
+
+            preparer = self.make_requirement_preparer(
+                temp_build_dir=directory,
+                options=options,
+                req_tracker=req_tracker,
+                session=session,
+                finder=finder,
+                use_user_site=options.use_user_site,
+            )
+            resolver = self.make_resolver(
+                preparer=preparer,
+                finder=finder,
+                options=options,
+                wheel_cache=wheel_cache,
+                use_user_site=options.use_user_site,
+                ignore_installed=options.ignore_installed,
+                ignore_requires_python=options.ignore_requires_python,
+                force_reinstall=options.force_reinstall,
+                upgrade_strategy=upgrade_strategy,
+                use_pep517=options.use_pep517,
+            )
+
+            self.trace_basic_info(finder)
+
+            requirement_set = resolver.resolve(
+                reqs, check_supported_wheels=not options.target_dir
+            )
+
+            try:
+                pip_req = requirement_set.get_requirement("pip")
+            except KeyError:
+                modifying_pip = False
+            else:
+                # If we're not replacing an already installed pip,
+                # we're not modifying it.
+                modifying_pip = pip_req.satisfied_by is None
+            protect_pip_from_modification_on_windows(
+                modifying_pip=modifying_pip
+            )
+
+            check_binary_allowed = get_check_binary_allowed(
+                finder.format_control
+            )
+
+            reqs_to_build = [
+                r for r in requirement_set.requirements.values()
+                if should_build_for_install_command(
+                    r, check_binary_allowed
+                )
+            ]
+
+            _, build_failures = build(
+                reqs_to_build,
+                wheel_cache=wheel_cache,
+                build_options=[],
+                global_options=[],
+            )
+
+            # If we're using PEP 517, we cannot do a direct install
+            # so we fail here.
+            pep517_build_failure_names = [
+                r.name   # type: ignore
+                for r in build_failures if r.use_pep517
+            ]  # type: List[str]
+            if pep517_build_failure_names:
+                raise InstallationError(
+                    "Could not build wheels for {} which use"
+                    " PEP 517 and cannot be installed directly".format(
+                        ", ".join(pep517_build_failure_names)
+                    )
+                )
+
+            # For now, we just warn about failures building legacy
+            # requirements, as we'll fall through to a direct
+            # install for those.
+            for r in build_failures:
+                if not r.use_pep517:
+                    r.legacy_install_reason = 8368
+
+            to_install = resolver.get_installation_order(
+                requirement_set
+            )
+
+            # Check for conflicts in the package set we're installing.
+            conflicts = None  # type: Optional[ConflictDetails]
+            should_warn_about_conflicts = (
+                not options.ignore_dependencies and
+                options.warn_about_conflicts
+            )
+            if should_warn_about_conflicts:
+                conflicts = self._determine_conflicts(to_install)
+
+            # Don't warn about script install locations if
+            # --target has been specified
+            warn_script_location = options.warn_script_location
+            if options.target_dir:
+                warn_script_location = False
+
+            installed = install_given_reqs(
+                to_install,
+                install_options,
+                global_options,
+                root=options.root_path,
+                home=target_temp_dir_path,
+                prefix=options.prefix_path,
+                warn_script_location=warn_script_location,
+                use_user_site=options.use_user_site,
+                pycompile=options.compile,
+            )
+
+            lib_locations = get_lib_location_guesses(
+                user=options.use_user_site,
+                home=target_temp_dir_path,
+                root=options.root_path,
+                prefix=options.prefix_path,
+                isolated=options.isolated_mode,
+            )
+            working_set = pkg_resources.WorkingSet(lib_locations)
+
+            installed.sort(key=operator.attrgetter('name'))
+            items = []
+            for result in installed:
+                item = result.name
+                try:
+                    installed_version = get_installed_version(
+                        result.name, working_set=working_set
+                    )
+                    if installed_version:
+                        item += '-' + installed_version
+                except Exception:
+                    pass
+                items.append(item)
+
+            if conflicts is not None:
+                self._warn_about_conflicts(
+                    conflicts,
+                    new_resolver='2020-resolver' in options.features_enabled,
+                )
+
+            installed_desc = ' '.join(items)
+            if installed_desc:
+                write_output(
+                    'Successfully installed %s', installed_desc,
+                )
+        except EnvironmentError as error:
+            show_traceback = (self.verbosity >= 1)
+
+            message = create_env_error_message(
+                error, show_traceback, options.use_user_site,
+            )
+            logger.error(message, exc_info=show_traceback)  # noqa
+
+            return ERROR
+
+        if options.target_dir:
+            assert target_temp_dir
+            self._handle_target_dir(
+                options.target_dir, target_temp_dir, options.upgrade
+            )
+
+        return SUCCESS
+
+    def _handle_target_dir(self, target_dir, target_temp_dir, upgrade):
+        # type: (str, TempDirectory, bool) -> None
+        ensure_dir(target_dir)
+
+        # Checking both purelib and platlib directories for installed
+        # packages to be moved to target directory
+        lib_dir_list = []
+
+        # Checking both purelib and platlib directories for installed
+        # packages to be moved to target directory
+        scheme = distutils_scheme('', home=target_temp_dir.path)
+        purelib_dir = scheme['purelib']
+        platlib_dir = scheme['platlib']
+        data_dir = scheme['data']
+
+        if os.path.exists(purelib_dir):
+            lib_dir_list.append(purelib_dir)
+        if os.path.exists(platlib_dir) and platlib_dir != purelib_dir:
+            lib_dir_list.append(platlib_dir)
+        if os.path.exists(data_dir):
+            lib_dir_list.append(data_dir)
+
+        for lib_dir in lib_dir_list:
+            for item in os.listdir(lib_dir):
+                if lib_dir == data_dir:
+                    ddir = os.path.join(data_dir, item)
+                    if any(s.startswith(ddir) for s in lib_dir_list[:-1]):
+                        continue
+                target_item_dir = os.path.join(target_dir, item)
+                if os.path.exists(target_item_dir):
+                    if not upgrade:
+                        logger.warning(
+                            'Target directory %s already exists. Specify '
+                            '--upgrade to force replacement.',
+                            target_item_dir
+                        )
+                        continue
+                    if os.path.islink(target_item_dir):
+                        logger.warning(
+                            'Target directory %s already exists and is '
+                            'a link. pip will not automatically replace '
+                            'links, please remove if replacement is '
+                            'desired.',
+                            target_item_dir
+                        )
+                        continue
+                    if os.path.isdir(target_item_dir):
+                        shutil.rmtree(target_item_dir)
+                    else:
+                        os.remove(target_item_dir)
+
+                shutil.move(
+                    os.path.join(lib_dir, item),
+                    target_item_dir
+                )
+
+    def _determine_conflicts(self, to_install):
+        # type: (List[InstallRequirement]) -> Optional[ConflictDetails]
+        try:
+            return check_install_conflicts(to_install)
+        except Exception:
+            logger.exception(
+                "Error while checking for conflicts. Please file an issue on "
+                "pip's issue tracker: https://github.com/pypa/pip/issues/new"
+            )
+            return None
+
+    def _warn_about_conflicts(self, conflict_details, new_resolver):
+        # type: (ConflictDetails, bool) -> None
+        package_set, (missing, conflicting) = conflict_details
+        if not missing and not conflicting:
+            return
+
+        parts = []  # type: List[str]
+        if not new_resolver:
+            parts.append(
+                "After October 2020 you may experience errors when installing "
+                "or updating packages. This is because pip will change the "
+                "way that it resolves dependency conflicts.\n"
+            )
+            parts.append(
+                "We recommend you use --use-feature=2020-resolver to test "
+                "your packages with the new resolver before it becomes the "
+                "default.\n"
+            )
+        elif not today_is_later_than(year=2020, month=7, day=31):
+            # NOTE: trailing newlines here are intentional
+            parts.append(
+                "Pip will install or upgrade your package(s) and its "
+                "dependencies without taking into account other packages you "
+                "already have installed. This may cause an uncaught "
+                "dependency conflict.\n"
+            )
+            form_link = "https://forms.gle/cWKMoDs8sUVE29hz9"
+            parts.append(
+                "If you would like pip to take your other packages into "
+                "account, please tell us here: {}\n".format(form_link)
+            )
+
+        # NOTE: There is some duplication here, with commands/check.py
+        for project_name in missing:
+            version = package_set[project_name][0]
+            for dependency in missing[project_name]:
+                message = (
+                    "{name} {version} requires {requirement}, "
+                    "which is not installed."
+                ).format(
+                    name=project_name,
+                    version=version,
+                    requirement=dependency[1],
+                )
+                parts.append(message)
+
+        for project_name in conflicting:
+            version = package_set[project_name][0]
+            for dep_name, dep_version, req in conflicting[project_name]:
+                message = (
+                    "{name} {version} requires {requirement}, but you'll have "
+                    "{dep_name} {dep_version} which is incompatible."
+                ).format(
+                    name=project_name,
+                    version=version,
+                    requirement=req,
+                    dep_name=dep_name,
+                    dep_version=dep_version,
+                )
+                parts.append(message)
+
+        logger.critical("\n".join(parts))
+
+
+def get_lib_location_guesses(
+        user=False,  # type: bool
+        home=None,  # type: Optional[str]
+        root=None,  # type: Optional[str]
+        isolated=False,  # type: bool
+        prefix=None  # type: Optional[str]
+):
+    # type:(...) -> List[str]
+    scheme = distutils_scheme('', user=user, home=home, root=root,
+                              isolated=isolated, prefix=prefix)
+    return [scheme['purelib'], scheme['platlib']]
+
+
+def site_packages_writable(root, isolated):
+    # type: (Optional[str], bool) -> bool
+    return all(
+        test_writable_dir(d) for d in set(
+            get_lib_location_guesses(root=root, isolated=isolated))
+    )
+
+
+def decide_user_install(
+    use_user_site,  # type: Optional[bool]
+    prefix_path=None,  # type: Optional[str]
+    target_dir=None,  # type: Optional[str]
+    root_path=None,  # type: Optional[str]
+    isolated_mode=False,  # type: bool
+):
+    # type: (...) -> bool
+    """Determine whether to do a user install based on the input options.
+
+    If use_user_site is False, no additional checks are done.
+    If use_user_site is True, it is checked for compatibility with other
+    options.
+    If use_user_site is None, the default behaviour depends on the environment,
+    which is provided by the other arguments.
+    """
+    # In some cases (config from tox), use_user_site can be set to an integer
+    # rather than a bool, which 'use_user_site is False' wouldn't catch.
+    if (use_user_site is not None) and (not use_user_site):
+        logger.debug("Non-user install by explicit request")
+        return False
+
+    if use_user_site:
+        if prefix_path:
+            raise CommandError(
+                "Can not combine '--user' and '--prefix' as they imply "
+                "different installation locations"
+            )
+        if virtualenv_no_global():
+            raise InstallationError(
+                "Can not perform a '--user' install. User site-packages "
+                "are not visible in this virtualenv."
+            )
+        logger.debug("User install by explicit request")
+        return True
+
+    # If we are here, user installs have not been explicitly requested/avoided
+    assert use_user_site is None
+
+    # user install incompatible with --prefix/--target
+    if prefix_path or target_dir:
+        logger.debug("Non-user install due to --prefix or --target option")
+        return False
+
+    # If user installs are not enabled, choose a non-user install
+    if not site.ENABLE_USER_SITE:
+        logger.debug("Non-user install because user site-packages disabled")
+        return False
+
+    # If we have permission for a non-user install, do that,
+    # otherwise do a user install.
+    if site_packages_writable(root=root_path, isolated=isolated_mode):
+        logger.debug("Non-user install because site-packages writeable")
+        return False
+
+    logger.info("Defaulting to user installation because normal site-packages "
+                "is not writeable")
+    return True
+
+
+def reject_location_related_install_options(requirements, options):
+    # type: (List[InstallRequirement], Optional[List[str]]) -> None
+    """If any location-changing --install-option arguments were passed for
+    requirements or on the command-line, then show a deprecation warning.
+    """
+    def format_options(option_names):
+        # type: (Iterable[str]) -> List[str]
+        return ["--{}".format(name.replace("_", "-")) for name in option_names]
+
+    offenders = []
+
+    for requirement in requirements:
+        install_options = requirement.install_options
+        location_options = parse_distutils_args(install_options)
+        if location_options:
+            offenders.append(
+                "{!r} from {}".format(
+                    format_options(location_options.keys()), requirement
+                )
+            )
+
+    if options:
+        location_options = parse_distutils_args(options)
+        if location_options:
+            offenders.append(
+                "{!r} from command line".format(
+                    format_options(location_options.keys())
+                )
+            )
+
+    if not offenders:
+        return
+
+    raise CommandError(
+        "Location-changing options found in --install-option: {}."
+        " This is unsupported, use pip-level options like --user,"
+        " --prefix, --root, and --target instead.".format(
+            "; ".join(offenders)
+        )
+    )
+
+
+def create_env_error_message(error, show_traceback, using_user_site):
+    # type: (EnvironmentError, bool, bool) -> str
+    """Format an error message for an EnvironmentError
+
+    It may occur anytime during the execution of the install command.
+    """
+    parts = []
+
+    # Mention the error if we are not going to show a traceback
+    parts.append("Could not install packages due to an EnvironmentError")
+    if not show_traceback:
+        parts.append(": ")
+        parts.append(str(error))
+    else:
+        parts.append(".")
+
+    # Spilt the error indication from a helper message (if any)
+    parts[-1] += "\n"
+
+    # Suggest useful actions to the user:
+    #  (1) using user site-packages or (2) verifying the permissions
+    if error.errno == errno.EACCES:
+        user_option_part = "Consider using the `--user` option"
+        permissions_part = "Check the permissions"
+
+        if not using_user_site:
+            parts.extend([
+                user_option_part, " or ",
+                permissions_part.lower(),
+            ])
+        else:
+            parts.append(permissions_part)
+        parts.append(".\n")
+
+    return "".join(parts).strip() + "\n"
diff --git a/venv/Lib/site-packages/pip/_internal/commands/list.py b/venv/Lib/site-packages/pip/_internal/commands/list.py
new file mode 100644
index 000000000..20e9bff2b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/list.py
@@ -0,0 +1,320 @@
+from __future__ import absolute_import
+
+import json
+import logging
+
+from pip._vendor import six
+
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.req_command import IndexGroupCommand
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.exceptions import CommandError
+from pip._internal.index.collector import LinkCollector
+from pip._internal.index.package_finder import PackageFinder
+from pip._internal.models.selection_prefs import SelectionPreferences
+from pip._internal.utils.misc import (
+    dist_is_editable,
+    get_installed_distributions,
+    tabulate,
+    write_output,
+)
+from pip._internal.utils.packaging import get_installer
+from pip._internal.utils.parallel import map_multithread
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List, Set, Tuple, Iterator
+
+    from pip._internal.network.session import PipSession
+    from pip._vendor.pkg_resources import Distribution
+
+logger = logging.getLogger(__name__)
+
+
+class ListCommand(IndexGroupCommand):
+    """
+    List installed packages, including editables.
+
+    Packages are listed in a case-insensitive sorted order.
+    """
+
+    ignore_require_venv = True
+    usage = """
+      %prog [options]"""
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-o', '--outdated',
+            action='store_true',
+            default=False,
+            help='List outdated packages')
+        self.cmd_opts.add_option(
+            '-u', '--uptodate',
+            action='store_true',
+            default=False,
+            help='List uptodate packages')
+        self.cmd_opts.add_option(
+            '-e', '--editable',
+            action='store_true',
+            default=False,
+            help='List editable projects.')
+        self.cmd_opts.add_option(
+            '-l', '--local',
+            action='store_true',
+            default=False,
+            help=('If in a virtualenv that has global access, do not list '
+                  'globally-installed packages.'),
+        )
+        self.cmd_opts.add_option(
+            '--user',
+            dest='user',
+            action='store_true',
+            default=False,
+            help='Only output packages installed in user-site.')
+        self.cmd_opts.add_option(cmdoptions.list_path())
+        self.cmd_opts.add_option(
+            '--pre',
+            action='store_true',
+            default=False,
+            help=("Include pre-release and development versions. By default, "
+                  "pip only finds stable versions."),
+        )
+
+        self.cmd_opts.add_option(
+            '--format',
+            action='store',
+            dest='list_format',
+            default="columns",
+            choices=('columns', 'freeze', 'json'),
+            help="Select the output format among: columns (default), freeze, "
+                 "or json",
+        )
+
+        self.cmd_opts.add_option(
+            '--not-required',
+            action='store_true',
+            dest='not_required',
+            help="List packages that are not dependencies of "
+                 "installed packages.",
+        )
+
+        self.cmd_opts.add_option(
+            '--exclude-editable',
+            action='store_false',
+            dest='include_editable',
+            help='Exclude editable package from output.',
+        )
+        self.cmd_opts.add_option(
+            '--include-editable',
+            action='store_true',
+            dest='include_editable',
+            help='Include editable package from output.',
+            default=True,
+        )
+        index_opts = cmdoptions.make_option_group(
+            cmdoptions.index_group, self.parser
+        )
+
+        self.parser.insert_option_group(0, index_opts)
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def _build_package_finder(self, options, session):
+        # type: (Values, PipSession) -> PackageFinder
+        """
+        Create a package finder appropriate to this list command.
+        """
+        link_collector = LinkCollector.create(session, options=options)
+
+        # Pass allow_yanked=False to ignore yanked versions.
+        selection_prefs = SelectionPreferences(
+            allow_yanked=False,
+            allow_all_prereleases=options.pre,
+        )
+
+        return PackageFinder.create(
+            link_collector=link_collector,
+            selection_prefs=selection_prefs,
+        )
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        if options.outdated and options.uptodate:
+            raise CommandError(
+                "Options --outdated and --uptodate cannot be combined.")
+
+        cmdoptions.check_list_path_option(options)
+
+        packages = get_installed_distributions(
+            local_only=options.local,
+            user_only=options.user,
+            editables_only=options.editable,
+            include_editables=options.include_editable,
+            paths=options.path,
+        )
+
+        # get_not_required must be called firstly in order to find and
+        # filter out all dependencies correctly. Otherwise a package
+        # can't be identified as requirement because some parent packages
+        # could be filtered out before.
+        if options.not_required:
+            packages = self.get_not_required(packages, options)
+
+        if options.outdated:
+            packages = self.get_outdated(packages, options)
+        elif options.uptodate:
+            packages = self.get_uptodate(packages, options)
+
+        self.output_package_listing(packages, options)
+        return SUCCESS
+
+    def get_outdated(self, packages, options):
+        # type: (List[Distribution], Values) -> List[Distribution]
+        return [
+            dist for dist in self.iter_packages_latest_infos(packages, options)
+            if dist.latest_version > dist.parsed_version
+        ]
+
+    def get_uptodate(self, packages, options):
+        # type: (List[Distribution], Values) -> List[Distribution]
+        return [
+            dist for dist in self.iter_packages_latest_infos(packages, options)
+            if dist.latest_version == dist.parsed_version
+        ]
+
+    def get_not_required(self, packages, options):
+        # type: (List[Distribution], Values) -> List[Distribution]
+        dep_keys = set()  # type: Set[Distribution]
+        for dist in packages:
+            dep_keys.update(requirement.key for requirement in dist.requires())
+
+        # Create a set to remove duplicate packages, and cast it to a list
+        # to keep the return type consistent with get_outdated and
+        # get_uptodate
+        return list({pkg for pkg in packages if pkg.key not in dep_keys})
+
+    def iter_packages_latest_infos(self, packages, options):
+        # type: (List[Distribution], Values) -> Iterator[Distribution]
+        with self._build_session(options) as session:
+            finder = self._build_package_finder(options, session)
+
+            def latest_info(dist):
+                # type: (Distribution) -> Distribution
+                typ = 'unknown'
+                all_candidates = finder.find_all_candidates(dist.key)
+                if not options.pre:
+                    # Remove prereleases
+                    all_candidates = [candidate for candidate in all_candidates
+                                      if not candidate.version.is_prerelease]
+
+                evaluator = finder.make_candidate_evaluator(
+                    project_name=dist.project_name,
+                )
+                best_candidate = evaluator.sort_best_candidate(all_candidates)
+                if best_candidate is None:
+                    return None
+
+                remote_version = best_candidate.version
+                if best_candidate.link.is_wheel:
+                    typ = 'wheel'
+                else:
+                    typ = 'sdist'
+                # This is dirty but makes the rest of the code much cleaner
+                dist.latest_version = remote_version
+                dist.latest_filetype = typ
+                return dist
+
+            for dist in map_multithread(latest_info, packages):
+                if dist is not None:
+                    yield dist
+
+    def output_package_listing(self, packages, options):
+        # type: (List[Distribution], Values) -> None
+        packages = sorted(
+            packages,
+            key=lambda dist: dist.project_name.lower(),
+        )
+        if options.list_format == 'columns' and packages:
+            data, header = format_for_columns(packages, options)
+            self.output_package_listing_columns(data, header)
+        elif options.list_format == 'freeze':
+            for dist in packages:
+                if options.verbose >= 1:
+                    write_output("%s==%s (%s)", dist.project_name,
+                                 dist.version, dist.location)
+                else:
+                    write_output("%s==%s", dist.project_name, dist.version)
+        elif options.list_format == 'json':
+            write_output(format_for_json(packages, options))
+
+    def output_package_listing_columns(self, data, header):
+        # type: (List[List[str]], List[str]) -> None
+        # insert the header first: we need to know the size of column names
+        if len(data) > 0:
+            data.insert(0, header)
+
+        pkg_strings, sizes = tabulate(data)
+
+        # Create and add a separator.
+        if len(data) > 0:
+            pkg_strings.insert(1, " ".join(map(lambda x: '-' * x, sizes)))
+
+        for val in pkg_strings:
+            write_output(val)
+
+
+def format_for_columns(pkgs, options):
+    # type: (List[Distribution], Values) -> Tuple[List[List[str]], List[str]]
+    """
+    Convert the package data into something usable
+    by output_package_listing_columns.
+    """
+    running_outdated = options.outdated
+    # Adjust the header for the `pip list --outdated` case.
+    if running_outdated:
+        header = ["Package", "Version", "Latest", "Type"]
+    else:
+        header = ["Package", "Version"]
+
+    data = []
+    if options.verbose >= 1 or any(dist_is_editable(x) for x in pkgs):
+        header.append("Location")
+    if options.verbose >= 1:
+        header.append("Installer")
+
+    for proj in pkgs:
+        # if we're working on the 'outdated' list, separate out the
+        # latest_version and type
+        row = [proj.project_name, proj.version]
+
+        if running_outdated:
+            row.append(proj.latest_version)
+            row.append(proj.latest_filetype)
+
+        if options.verbose >= 1 or dist_is_editable(proj):
+            row.append(proj.location)
+        if options.verbose >= 1:
+            row.append(get_installer(proj))
+
+        data.append(row)
+
+    return data, header
+
+
+def format_for_json(packages, options):
+    # type: (List[Distribution], Values) -> str
+    data = []
+    for dist in packages:
+        info = {
+            'name': dist.project_name,
+            'version': six.text_type(dist.version),
+        }
+        if options.verbose >= 1:
+            info['location'] = dist.location
+            info['installer'] = get_installer(dist)
+        if options.outdated:
+            info['latest_version'] = six.text_type(dist.latest_version)
+            info['latest_filetype'] = dist.latest_filetype
+        data.append(info)
+    return json.dumps(data)
diff --git a/venv/Lib/site-packages/pip/_internal/commands/search.py b/venv/Lib/site-packages/pip/_internal/commands/search.py
new file mode 100644
index 000000000..ff0947202
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/search.py
@@ -0,0 +1,160 @@
+from __future__ import absolute_import
+
+import logging
+import sys
+import textwrap
+from collections import OrderedDict
+
+from pip._vendor import pkg_resources
+from pip._vendor.packaging.version import parse as parse_version
+# NOTE: XMLRPC Client is not annotated in typeshed as on 2017-07-17, which is
+#       why we ignore the type on this import
+from pip._vendor.six.moves import xmlrpc_client  # type: ignore
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.req_command import SessionCommandMixin
+from pip._internal.cli.status_codes import NO_MATCHES_FOUND, SUCCESS
+from pip._internal.exceptions import CommandError
+from pip._internal.models.index import PyPI
+from pip._internal.network.xmlrpc import PipXmlrpcTransport
+from pip._internal.utils.compat import get_terminal_size
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import get_distribution, write_output
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List, Dict, Optional
+    from typing_extensions import TypedDict
+    TransformedHit = TypedDict(
+        'TransformedHit',
+        {'name': str, 'summary': str, 'versions': List[str]},
+    )
+
+logger = logging.getLogger(__name__)
+
+
+class SearchCommand(Command, SessionCommandMixin):
+    """Search for PyPI packages whose name or summary contains <query>."""
+
+    usage = """
+      %prog [options] <query>"""
+    ignore_require_venv = True
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-i', '--index',
+            dest='index',
+            metavar='URL',
+            default=PyPI.pypi_url,
+            help='Base URL of Python Package Index (default %default)')
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        if not args:
+            raise CommandError('Missing required argument (search query).')
+        query = args
+        pypi_hits = self.search(query, options)
+        hits = transform_hits(pypi_hits)
+
+        terminal_width = None
+        if sys.stdout.isatty():
+            terminal_width = get_terminal_size()[0]
+
+        print_results(hits, terminal_width=terminal_width)
+        if pypi_hits:
+            return SUCCESS
+        return NO_MATCHES_FOUND
+
+    def search(self, query, options):
+        # type: (List[str], Values) -> List[Dict[str, str]]
+        index_url = options.index
+
+        session = self.get_default_session(options)
+
+        transport = PipXmlrpcTransport(index_url, session)
+        pypi = xmlrpc_client.ServerProxy(index_url, transport)
+        hits = pypi.search({'name': query, 'summary': query}, 'or')
+        return hits
+
+
+def transform_hits(hits):
+    # type: (List[Dict[str, str]]) -> List[TransformedHit]
+    """
+    The list from pypi is really a list of versions. We want a list of
+    packages with the list of versions stored inline. This converts the
+    list from pypi into one we can use.
+    """
+    packages = OrderedDict()  # type: OrderedDict[str, TransformedHit]
+    for hit in hits:
+        name = hit['name']
+        summary = hit['summary']
+        version = hit['version']
+
+        if name not in packages.keys():
+            packages[name] = {
+                'name': name,
+                'summary': summary,
+                'versions': [version],
+            }
+        else:
+            packages[name]['versions'].append(version)
+
+            # if this is the highest version, replace summary and score
+            if version == highest_version(packages[name]['versions']):
+                packages[name]['summary'] = summary
+
+    return list(packages.values())
+
+
+def print_results(hits, name_column_width=None, terminal_width=None):
+    # type: (List[TransformedHit], Optional[int], Optional[int]) -> None
+    if not hits:
+        return
+    if name_column_width is None:
+        name_column_width = max([
+            len(hit['name']) + len(highest_version(hit.get('versions', ['-'])))
+            for hit in hits
+        ]) + 4
+
+    installed_packages = [p.project_name for p in pkg_resources.working_set]
+    for hit in hits:
+        name = hit['name']
+        summary = hit['summary'] or ''
+        latest = highest_version(hit.get('versions', ['-']))
+        if terminal_width is not None:
+            target_width = terminal_width - name_column_width - 5
+            if target_width > 10:
+                # wrap and indent summary to fit terminal
+                summary_lines = textwrap.wrap(summary, target_width)
+                summary = ('\n' + ' ' * (name_column_width + 3)).join(
+                    summary_lines)
+
+        line = '{name_latest:{name_column_width}} - {summary}'.format(
+            name_latest='{name} ({latest})'.format(**locals()),
+            **locals())
+        try:
+            write_output(line)
+            if name in installed_packages:
+                dist = get_distribution(name)
+                assert dist is not None
+                with indent_log():
+                    if dist.version == latest:
+                        write_output('INSTALLED: %s (latest)', dist.version)
+                    else:
+                        write_output('INSTALLED: %s', dist.version)
+                        if parse_version(latest).pre:
+                            write_output('LATEST:    %s (pre-release; install'
+                                         ' with "pip install --pre")', latest)
+                        else:
+                            write_output('LATEST:    %s', latest)
+        except UnicodeEncodeError:
+            pass
+
+
+def highest_version(versions):
+    # type: (List[str]) -> str
+    return max(versions, key=parse_version)
diff --git a/venv/Lib/site-packages/pip/_internal/commands/show.py b/venv/Lib/site-packages/pip/_internal/commands/show.py
new file mode 100644
index 000000000..3892c5959
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/show.py
@@ -0,0 +1,186 @@
+from __future__ import absolute_import
+
+import logging
+import os
+from email.parser import FeedParser
+
+from pip._vendor import pkg_resources
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.status_codes import ERROR, SUCCESS
+from pip._internal.utils.misc import write_output
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List, Dict, Iterator
+
+logger = logging.getLogger(__name__)
+
+
+class ShowCommand(Command):
+    """
+    Show information about one or more installed packages.
+
+    The output is in RFC-compliant mail header format.
+    """
+
+    usage = """
+      %prog [options] <package> ..."""
+    ignore_require_venv = True
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-f', '--files',
+            dest='files',
+            action='store_true',
+            default=False,
+            help='Show the full list of installed files for each package.')
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        if not args:
+            logger.warning('ERROR: Please provide a package name or names.')
+            return ERROR
+        query = args
+
+        results = search_packages_info(query)
+        if not print_results(
+                results, list_files=options.files, verbose=options.verbose):
+            return ERROR
+        return SUCCESS
+
+
+def search_packages_info(query):
+    # type: (List[str]) -> Iterator[Dict[str, str]]
+    """
+    Gather details from installed distributions. Print distribution name,
+    version, location, and installed files. Installed files requires a
+    pip generated 'installed-files.txt' in the distributions '.egg-info'
+    directory.
+    """
+    installed = {}
+    for p in pkg_resources.working_set:
+        installed[canonicalize_name(p.project_name)] = p
+
+    query_names = [canonicalize_name(name) for name in query]
+    missing = sorted(
+        [name for name, pkg in zip(query, query_names) if pkg not in installed]
+    )
+    if missing:
+        logger.warning('Package(s) not found: %s', ', '.join(missing))
+
+    def get_requiring_packages(package_name):
+        # type: (str) -> List[str]
+        canonical_name = canonicalize_name(package_name)
+        return [
+            pkg.project_name for pkg in pkg_resources.working_set
+            if canonical_name in
+               [canonicalize_name(required.name) for required in
+                pkg.requires()]
+        ]
+
+    for dist in [installed[pkg] for pkg in query_names if pkg in installed]:
+        package = {
+            'name': dist.project_name,
+            'version': dist.version,
+            'location': dist.location,
+            'requires': [dep.project_name for dep in dist.requires()],
+            'required_by': get_requiring_packages(dist.project_name)
+        }
+        file_list = None
+        metadata = ''
+        if isinstance(dist, pkg_resources.DistInfoDistribution):
+            # RECORDs should be part of .dist-info metadatas
+            if dist.has_metadata('RECORD'):
+                lines = dist.get_metadata_lines('RECORD')
+                paths = [line.split(',')[0] for line in lines]
+                paths = [os.path.join(dist.location, p) for p in paths]
+                file_list = [os.path.relpath(p, dist.location) for p in paths]
+
+            if dist.has_metadata('METADATA'):
+                metadata = dist.get_metadata('METADATA')
+        else:
+            # Otherwise use pip's log for .egg-info's
+            if dist.has_metadata('installed-files.txt'):
+                paths = dist.get_metadata_lines('installed-files.txt')
+                paths = [os.path.join(dist.egg_info, p) for p in paths]
+                file_list = [os.path.relpath(p, dist.location) for p in paths]
+
+            if dist.has_metadata('PKG-INFO'):
+                metadata = dist.get_metadata('PKG-INFO')
+
+        if dist.has_metadata('entry_points.txt'):
+            entry_points = dist.get_metadata_lines('entry_points.txt')
+            package['entry_points'] = entry_points
+
+        if dist.has_metadata('INSTALLER'):
+            for line in dist.get_metadata_lines('INSTALLER'):
+                if line.strip():
+                    package['installer'] = line.strip()
+                    break
+
+        # @todo: Should pkg_resources.Distribution have a
+        # `get_pkg_info` method?
+        feed_parser = FeedParser()
+        feed_parser.feed(metadata)
+        pkg_info_dict = feed_parser.close()
+        for key in ('metadata-version', 'summary',
+                    'home-page', 'author', 'author-email', 'license'):
+            package[key] = pkg_info_dict.get(key)
+
+        # It looks like FeedParser cannot deal with repeated headers
+        classifiers = []
+        for line in metadata.splitlines():
+            if line.startswith('Classifier: '):
+                classifiers.append(line[len('Classifier: '):])
+        package['classifiers'] = classifiers
+
+        if file_list:
+            package['files'] = sorted(file_list)
+        yield package
+
+
+def print_results(distributions, list_files=False, verbose=False):
+    # type: (Iterator[Dict[str, str]], bool, bool) -> bool
+    """
+    Print the information from installed distributions found.
+    """
+    results_printed = False
+    for i, dist in enumerate(distributions):
+        results_printed = True
+        if i > 0:
+            write_output("---")
+
+        write_output("Name: %s", dist.get('name', ''))
+        write_output("Version: %s", dist.get('version', ''))
+        write_output("Summary: %s", dist.get('summary', ''))
+        write_output("Home-page: %s", dist.get('home-page', ''))
+        write_output("Author: %s", dist.get('author', ''))
+        write_output("Author-email: %s", dist.get('author-email', ''))
+        write_output("License: %s", dist.get('license', ''))
+        write_output("Location: %s", dist.get('location', ''))
+        write_output("Requires: %s", ', '.join(dist.get('requires', [])))
+        write_output("Required-by: %s", ', '.join(dist.get('required_by', [])))
+
+        if verbose:
+            write_output("Metadata-Version: %s",
+                         dist.get('metadata-version', ''))
+            write_output("Installer: %s", dist.get('installer', ''))
+            write_output("Classifiers:")
+            for classifier in dist.get('classifiers', []):
+                write_output("  %s", classifier)
+            write_output("Entry-points:")
+            for entry in dist.get('entry_points', []):
+                write_output("  %s", entry.strip())
+        if list_files:
+            write_output("Files:")
+            for line in dist.get('files', []):
+                write_output("  %s", line.strip())
+            if "files" not in dist:
+                write_output("Cannot locate installed-files.txt")
+    return results_printed
diff --git a/venv/Lib/site-packages/pip/_internal/commands/uninstall.py b/venv/Lib/site-packages/pip/_internal/commands/uninstall.py
new file mode 100644
index 000000000..3371fe47f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/uninstall.py
@@ -0,0 +1,95 @@
+from __future__ import absolute_import
+
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.cli.base_command import Command
+from pip._internal.cli.req_command import SessionCommandMixin
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.exceptions import InstallationError
+from pip._internal.req import parse_requirements
+from pip._internal.req.constructors import (
+    install_req_from_line,
+    install_req_from_parsed_requirement,
+)
+from pip._internal.utils.misc import protect_pip_from_modification_on_windows
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List
+
+
+class UninstallCommand(Command, SessionCommandMixin):
+    """
+    Uninstall packages.
+
+    pip is able to uninstall most installed packages. Known exceptions are:
+
+    - Pure distutils packages installed with ``python setup.py install``, which
+      leave behind no metadata to determine what files were installed.
+    - Script wrappers installed by ``python setup.py develop``.
+    """
+
+    usage = """
+      %prog [options] <package> ...
+      %prog [options] -r <requirements file> ..."""
+
+    def add_options(self):
+        # type: () -> None
+        self.cmd_opts.add_option(
+            '-r', '--requirement',
+            dest='requirements',
+            action='append',
+            default=[],
+            metavar='file',
+            help='Uninstall all the packages listed in the given requirements '
+                 'file.  This option can be used multiple times.',
+        )
+        self.cmd_opts.add_option(
+            '-y', '--yes',
+            dest='yes',
+            action='store_true',
+            help="Don't ask for confirmation of uninstall deletions.")
+
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        session = self.get_default_session(options)
+
+        reqs_to_uninstall = {}
+        for name in args:
+            req = install_req_from_line(
+                name, isolated=options.isolated_mode,
+            )
+            if req.name:
+                reqs_to_uninstall[canonicalize_name(req.name)] = req
+        for filename in options.requirements:
+            for parsed_req in parse_requirements(
+                    filename,
+                    options=options,
+                    session=session):
+                req = install_req_from_parsed_requirement(
+                    parsed_req,
+                    isolated=options.isolated_mode
+                )
+                if req.name:
+                    reqs_to_uninstall[canonicalize_name(req.name)] = req
+        if not reqs_to_uninstall:
+            raise InstallationError(
+                'You must give at least one requirement to {self.name} (see '
+                '"pip help {self.name}")'.format(**locals())
+            )
+
+        protect_pip_from_modification_on_windows(
+            modifying_pip="pip" in reqs_to_uninstall
+        )
+
+        for req in reqs_to_uninstall.values():
+            uninstall_pathset = req.uninstall(
+                auto_confirm=options.yes, verbose=self.verbosity > 0,
+            )
+            if uninstall_pathset:
+                uninstall_pathset.commit()
+
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/commands/wheel.py b/venv/Lib/site-packages/pip/_internal/commands/wheel.py
new file mode 100644
index 000000000..0f718566b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/commands/wheel.py
@@ -0,0 +1,188 @@
+# -*- coding: utf-8 -*-
+
+from __future__ import absolute_import
+
+import logging
+import os
+import shutil
+
+from pip._internal.cache import WheelCache
+from pip._internal.cli import cmdoptions
+from pip._internal.cli.req_command import RequirementCommand, with_cleanup
+from pip._internal.cli.status_codes import SUCCESS
+from pip._internal.exceptions import CommandError
+from pip._internal.req.req_tracker import get_requirement_tracker
+from pip._internal.utils.misc import ensure_dir, normalize_path
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.wheel_builder import build, should_build_for_wheel_command
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import List
+
+
+logger = logging.getLogger(__name__)
+
+
+class WheelCommand(RequirementCommand):
+    """
+    Build Wheel archives for your requirements and dependencies.
+
+    Wheel is a built-package format, and offers the advantage of not
+    recompiling your software during every install. For more details, see the
+    wheel docs: https://wheel.readthedocs.io/en/latest/
+
+    Requirements: setuptools>=0.8, and wheel.
+
+    'pip wheel' uses the bdist_wheel setuptools extension from the wheel
+    package to build individual wheels.
+
+    """
+
+    usage = """
+      %prog [options] <requirement specifier> ...
+      %prog [options] -r <requirements file> ...
+      %prog [options] [-e] <vcs project url> ...
+      %prog [options] [-e] <local project path> ...
+      %prog [options] <archive url/path> ..."""
+
+    def add_options(self):
+        # type: () -> None
+
+        self.cmd_opts.add_option(
+            '-w', '--wheel-dir',
+            dest='wheel_dir',
+            metavar='dir',
+            default=os.curdir,
+            help=("Build wheels into <dir>, where the default is the "
+                  "current working directory."),
+        )
+        self.cmd_opts.add_option(cmdoptions.no_binary())
+        self.cmd_opts.add_option(cmdoptions.only_binary())
+        self.cmd_opts.add_option(cmdoptions.prefer_binary())
+        self.cmd_opts.add_option(
+            '--build-option',
+            dest='build_options',
+            metavar='options',
+            action='append',
+            help="Extra arguments to be supplied to 'setup.py bdist_wheel'.",
+        )
+        self.cmd_opts.add_option(cmdoptions.no_build_isolation())
+        self.cmd_opts.add_option(cmdoptions.use_pep517())
+        self.cmd_opts.add_option(cmdoptions.no_use_pep517())
+        self.cmd_opts.add_option(cmdoptions.constraints())
+        self.cmd_opts.add_option(cmdoptions.editable())
+        self.cmd_opts.add_option(cmdoptions.requirements())
+        self.cmd_opts.add_option(cmdoptions.src())
+        self.cmd_opts.add_option(cmdoptions.ignore_requires_python())
+        self.cmd_opts.add_option(cmdoptions.no_deps())
+        self.cmd_opts.add_option(cmdoptions.build_dir())
+        self.cmd_opts.add_option(cmdoptions.progress_bar())
+
+        self.cmd_opts.add_option(
+            '--global-option',
+            dest='global_options',
+            action='append',
+            metavar='options',
+            help="Extra global options to be supplied to the setup.py "
+            "call before the 'bdist_wheel' command.")
+
+        self.cmd_opts.add_option(
+            '--pre',
+            action='store_true',
+            default=False,
+            help=("Include pre-release and development versions. By default, "
+                  "pip only finds stable versions."),
+        )
+
+        self.cmd_opts.add_option(cmdoptions.require_hashes())
+
+        index_opts = cmdoptions.make_option_group(
+            cmdoptions.index_group,
+            self.parser,
+        )
+
+        self.parser.insert_option_group(0, index_opts)
+        self.parser.insert_option_group(0, self.cmd_opts)
+
+    @with_cleanup
+    def run(self, options, args):
+        # type: (Values, List[str]) -> int
+        cmdoptions.check_install_build_global(options)
+
+        session = self.get_default_session(options)
+
+        finder = self._build_package_finder(options, session)
+        build_delete = (not (options.no_clean or options.build_dir))
+        wheel_cache = WheelCache(options.cache_dir, options.format_control)
+
+        options.wheel_dir = normalize_path(options.wheel_dir)
+        ensure_dir(options.wheel_dir)
+
+        req_tracker = self.enter_context(get_requirement_tracker())
+
+        directory = TempDirectory(
+            options.build_dir,
+            delete=build_delete,
+            kind="wheel",
+            globally_managed=True,
+        )
+
+        reqs = self.get_requirements(args, options, finder, session)
+
+        preparer = self.make_requirement_preparer(
+            temp_build_dir=directory,
+            options=options,
+            req_tracker=req_tracker,
+            session=session,
+            finder=finder,
+            wheel_download_dir=options.wheel_dir,
+            use_user_site=False,
+        )
+
+        resolver = self.make_resolver(
+            preparer=preparer,
+            finder=finder,
+            options=options,
+            wheel_cache=wheel_cache,
+            ignore_requires_python=options.ignore_requires_python,
+            use_pep517=options.use_pep517,
+        )
+
+        self.trace_basic_info(finder)
+
+        requirement_set = resolver.resolve(
+            reqs, check_supported_wheels=True
+        )
+
+        reqs_to_build = [
+            r for r in requirement_set.requirements.values()
+            if should_build_for_wheel_command(r)
+        ]
+
+        # build wheels
+        build_successes, build_failures = build(
+            reqs_to_build,
+            wheel_cache=wheel_cache,
+            build_options=options.build_options or [],
+            global_options=options.global_options or [],
+        )
+        for req in build_successes:
+            assert req.link and req.link.is_wheel
+            assert req.local_file_path
+            # copy from cache to target directory
+            try:
+                shutil.copy(req.local_file_path, options.wheel_dir)
+            except OSError as e:
+                logger.warning(
+                    "Building wheel for %s failed: %s",
+                    req.name, e,
+                )
+                build_failures.append(req)
+        if len(build_failures) != 0:
+            raise CommandError(
+                "Failed to build one or more wheels"
+            )
+
+        return SUCCESS
diff --git a/venv/Lib/site-packages/pip/_internal/configuration.py b/venv/Lib/site-packages/pip/_internal/configuration.py
new file mode 100644
index 000000000..e49a5f4f5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/configuration.py
@@ -0,0 +1,418 @@
+"""Configuration management setup
+
+Some terminology:
+- name
+  As written in config files.
+- value
+  Value associated with a name
+- key
+  Name combined with it's section (section.name)
+- variant
+  A single word describing where the configuration key-value pair came from
+"""
+
+import locale
+import logging
+import os
+import sys
+
+from pip._vendor.six.moves import configparser
+
+from pip._internal.exceptions import (
+    ConfigurationError,
+    ConfigurationFileCouldNotBeLoaded,
+)
+from pip._internal.utils import appdirs
+from pip._internal.utils.compat import WINDOWS, expanduser
+from pip._internal.utils.misc import ensure_dir, enum
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Dict, Iterable, List, NewType, Optional, Tuple
+    )
+
+    RawConfigParser = configparser.RawConfigParser  # Shorthand
+    Kind = NewType("Kind", str)
+
+logger = logging.getLogger(__name__)
+
+
+# NOTE: Maybe use the optionx attribute to normalize keynames.
+def _normalize_name(name):
+    # type: (str) -> str
+    """Make a name consistent regardless of source (environment or file)
+    """
+    name = name.lower().replace('_', '-')
+    if name.startswith('--'):
+        name = name[2:]  # only prefer long opts
+    return name
+
+
+def _disassemble_key(name):
+    # type: (str) -> List[str]
+    if "." not in name:
+        error_message = (
+            "Key does not contain dot separated section and key. "
+            "Perhaps you wanted to use 'global.{}' instead?"
+        ).format(name)
+        raise ConfigurationError(error_message)
+    return name.split(".", 1)
+
+
+# The kinds of configurations there are.
+kinds = enum(
+    USER="user",        # User Specific
+    GLOBAL="global",    # System Wide
+    SITE="site",        # [Virtual] Environment Specific
+    ENV="env",          # from PIP_CONFIG_FILE
+    ENV_VAR="env-var",  # from Environment Variables
+)
+
+
+CONFIG_BASENAME = 'pip.ini' if WINDOWS else 'pip.conf'
+
+
+def get_configuration_files():
+    # type: () -> Dict[Kind, List[str]]
+    global_config_files = [
+        os.path.join(path, CONFIG_BASENAME)
+        for path in appdirs.site_config_dirs('pip')
+    ]
+
+    site_config_file = os.path.join(sys.prefix, CONFIG_BASENAME)
+    legacy_config_file = os.path.join(
+        expanduser('~'),
+        'pip' if WINDOWS else '.pip',
+        CONFIG_BASENAME,
+    )
+    new_config_file = os.path.join(
+        appdirs.user_config_dir("pip"), CONFIG_BASENAME
+    )
+    return {
+        kinds.GLOBAL: global_config_files,
+        kinds.SITE: [site_config_file],
+        kinds.USER: [legacy_config_file, new_config_file],
+    }
+
+
+class Configuration(object):
+    """Handles management of configuration.
+
+    Provides an interface to accessing and managing configuration files.
+
+    This class converts provides an API that takes "section.key-name" style
+    keys and stores the value associated with it as "key-name" under the
+    section "section".
+
+    This allows for a clean interface wherein the both the section and the
+    key-name are preserved in an easy to manage form in the configuration files
+    and the data stored is also nice.
+    """
+
+    def __init__(self, isolated, load_only=None):
+        # type: (bool, Optional[Kind]) -> None
+        super(Configuration, self).__init__()
+
+        _valid_load_only = [kinds.USER, kinds.GLOBAL, kinds.SITE, None]
+        if load_only not in _valid_load_only:
+            raise ConfigurationError(
+                "Got invalid value for load_only - should be one of {}".format(
+                    ", ".join(map(repr, _valid_load_only[:-1]))
+                )
+            )
+        self.isolated = isolated
+        self.load_only = load_only
+
+        # The order here determines the override order.
+        self._override_order = [
+            kinds.GLOBAL, kinds.USER, kinds.SITE, kinds.ENV, kinds.ENV_VAR
+        ]
+
+        self._ignore_env_names = ["version", "help"]
+
+        # Because we keep track of where we got the data from
+        self._parsers = {
+            variant: [] for variant in self._override_order
+        }  # type: Dict[Kind, List[Tuple[str, RawConfigParser]]]
+        self._config = {
+            variant: {} for variant in self._override_order
+        }  # type: Dict[Kind, Dict[str, Any]]
+        self._modified_parsers = []  # type: List[Tuple[str, RawConfigParser]]
+
+    def load(self):
+        # type: () -> None
+        """Loads configuration from configuration files and environment
+        """
+        self._load_config_files()
+        if not self.isolated:
+            self._load_environment_vars()
+
+    def get_file_to_edit(self):
+        # type: () -> Optional[str]
+        """Returns the file with highest priority in configuration
+        """
+        assert self.load_only is not None, \
+            "Need to be specified a file to be editing"
+
+        try:
+            return self._get_parser_to_modify()[0]
+        except IndexError:
+            return None
+
+    def items(self):
+        # type: () -> Iterable[Tuple[str, Any]]
+        """Returns key-value pairs like dict.items() representing the loaded
+        configuration
+        """
+        return self._dictionary.items()
+
+    def get_value(self, key):
+        # type: (str) -> Any
+        """Get a value from the configuration.
+        """
+        try:
+            return self._dictionary[key]
+        except KeyError:
+            raise ConfigurationError("No such key - {}".format(key))
+
+    def set_value(self, key, value):
+        # type: (str, Any) -> None
+        """Modify a value in the configuration.
+        """
+        self._ensure_have_load_only()
+
+        assert self.load_only
+        fname, parser = self._get_parser_to_modify()
+
+        if parser is not None:
+            section, name = _disassemble_key(key)
+
+            # Modify the parser and the configuration
+            if not parser.has_section(section):
+                parser.add_section(section)
+            parser.set(section, name, value)
+
+        self._config[self.load_only][key] = value
+        self._mark_as_modified(fname, parser)
+
+    def unset_value(self, key):
+        # type: (str) -> None
+        """Unset a value in the configuration."""
+        self._ensure_have_load_only()
+
+        assert self.load_only
+        if key not in self._config[self.load_only]:
+            raise ConfigurationError("No such key - {}".format(key))
+
+        fname, parser = self._get_parser_to_modify()
+
+        if parser is not None:
+            section, name = _disassemble_key(key)
+            if not (parser.has_section(section)
+                    and parser.remove_option(section, name)):
+                # The option was not removed.
+                raise ConfigurationError(
+                    "Fatal Internal error [id=1]. Please report as a bug."
+                )
+
+            # The section may be empty after the option was removed.
+            if not parser.items(section):
+                parser.remove_section(section)
+            self._mark_as_modified(fname, parser)
+
+        del self._config[self.load_only][key]
+
+    def save(self):
+        # type: () -> None
+        """Save the current in-memory state.
+        """
+        self._ensure_have_load_only()
+
+        for fname, parser in self._modified_parsers:
+            logger.info("Writing to %s", fname)
+
+            # Ensure directory exists.
+            ensure_dir(os.path.dirname(fname))
+
+            with open(fname, "w") as f:
+                parser.write(f)
+
+    #
+    # Private routines
+    #
+
+    def _ensure_have_load_only(self):
+        # type: () -> None
+        if self.load_only is None:
+            raise ConfigurationError("Needed a specific file to be modifying.")
+        logger.debug("Will be working with %s variant only", self.load_only)
+
+    @property
+    def _dictionary(self):
+        # type: () -> Dict[str, Any]
+        """A dictionary representing the loaded configuration.
+        """
+        # NOTE: Dictionaries are not populated if not loaded. So, conditionals
+        #       are not needed here.
+        retval = {}
+
+        for variant in self._override_order:
+            retval.update(self._config[variant])
+
+        return retval
+
+    def _load_config_files(self):
+        # type: () -> None
+        """Loads configuration from configuration files
+        """
+        config_files = dict(self.iter_config_files())
+        if config_files[kinds.ENV][0:1] == [os.devnull]:
+            logger.debug(
+                "Skipping loading configuration files due to "
+                "environment's PIP_CONFIG_FILE being os.devnull"
+            )
+            return
+
+        for variant, files in config_files.items():
+            for fname in files:
+                # If there's specific variant set in `load_only`, load only
+                # that variant, not the others.
+                if self.load_only is not None and variant != self.load_only:
+                    logger.debug(
+                        "Skipping file '%s' (variant: %s)", fname, variant
+                    )
+                    continue
+
+                parser = self._load_file(variant, fname)
+
+                # Keeping track of the parsers used
+                self._parsers[variant].append((fname, parser))
+
+    def _load_file(self, variant, fname):
+        # type: (Kind, str) -> RawConfigParser
+        logger.debug("For variant '%s', will try loading '%s'", variant, fname)
+        parser = self._construct_parser(fname)
+
+        for section in parser.sections():
+            items = parser.items(section)
+            self._config[variant].update(self._normalized_keys(section, items))
+
+        return parser
+
+    def _construct_parser(self, fname):
+        # type: (str) -> RawConfigParser
+        parser = configparser.RawConfigParser()
+        # If there is no such file, don't bother reading it but create the
+        # parser anyway, to hold the data.
+        # Doing this is useful when modifying and saving files, where we don't
+        # need to construct a parser.
+        if os.path.exists(fname):
+            try:
+                parser.read(fname)
+            except UnicodeDecodeError:
+                # See https://github.com/pypa/pip/issues/4963
+                raise ConfigurationFileCouldNotBeLoaded(
+                    reason="contains invalid {} characters".format(
+                        locale.getpreferredencoding(False)
+                    ),
+                    fname=fname,
+                )
+            except configparser.Error as error:
+                # See https://github.com/pypa/pip/issues/4893
+                raise ConfigurationFileCouldNotBeLoaded(error=error)
+        return parser
+
+    def _load_environment_vars(self):
+        # type: () -> None
+        """Loads configuration from environment variables
+        """
+        self._config[kinds.ENV_VAR].update(
+            self._normalized_keys(":env:", self.get_environ_vars())
+        )
+
+    def _normalized_keys(self, section, items):
+        # type: (str, Iterable[Tuple[str, Any]]) -> Dict[str, Any]
+        """Normalizes items to construct a dictionary with normalized keys.
+
+        This routine is where the names become keys and are made the same
+        regardless of source - configuration files or environment.
+        """
+        normalized = {}
+        for name, val in items:
+            key = section + "." + _normalize_name(name)
+            normalized[key] = val
+        return normalized
+
+    def get_environ_vars(self):
+        # type: () -> Iterable[Tuple[str, str]]
+        """Returns a generator with all environmental vars with prefix PIP_"""
+        for key, val in os.environ.items():
+            should_be_yielded = (
+                key.startswith("PIP_") and
+                key[4:].lower() not in self._ignore_env_names
+            )
+            if should_be_yielded:
+                yield key[4:].lower(), val
+
+    # XXX: This is patched in the tests.
+    def iter_config_files(self):
+        # type: () -> Iterable[Tuple[Kind, List[str]]]
+        """Yields variant and configuration files associated with it.
+
+        This should be treated like items of a dictionary.
+        """
+        # SMELL: Move the conditions out of this function
+
+        # environment variables have the lowest priority
+        config_file = os.environ.get('PIP_CONFIG_FILE', None)
+        if config_file is not None:
+            yield kinds.ENV, [config_file]
+        else:
+            yield kinds.ENV, []
+
+        config_files = get_configuration_files()
+
+        # at the base we have any global configuration
+        yield kinds.GLOBAL, config_files[kinds.GLOBAL]
+
+        # per-user configuration next
+        should_load_user_config = not self.isolated and not (
+            config_file and os.path.exists(config_file)
+        )
+        if should_load_user_config:
+            # The legacy config file is overridden by the new config file
+            yield kinds.USER, config_files[kinds.USER]
+
+        # finally virtualenv configuration first trumping others
+        yield kinds.SITE, config_files[kinds.SITE]
+
+    def get_values_in_config(self, variant):
+        # type: (Kind) -> Dict[str, Any]
+        """Get values present in a config file"""
+        return self._config[variant]
+
+    def _get_parser_to_modify(self):
+        # type: () -> Tuple[str, RawConfigParser]
+        # Determine which parser to modify
+        assert self.load_only
+        parsers = self._parsers[self.load_only]
+        if not parsers:
+            # This should not happen if everything works correctly.
+            raise ConfigurationError(
+                "Fatal Internal error [id=2]. Please report as a bug."
+            )
+
+        # Use the highest priority parser.
+        return parsers[-1]
+
+    # XXX: This is patched in the tests.
+    def _mark_as_modified(self, fname, parser):
+        # type: (str, RawConfigParser) -> None
+        file_parser_tuple = (fname, parser)
+        if file_parser_tuple not in self._modified_parsers:
+            self._modified_parsers.append(file_parser_tuple)
+
+    def __repr__(self):
+        # type: () -> str
+        return "{}({!r})".format(self.__class__.__name__, self._dictionary)
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__init__.py b/venv/Lib/site-packages/pip/_internal/distributions/__init__.py
new file mode 100644
index 000000000..d5c1afc5b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/distributions/__init__.py
@@ -0,0 +1,24 @@
+from pip._internal.distributions.sdist import SourceDistribution
+from pip._internal.distributions.wheel import WheelDistribution
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from pip._internal.distributions.base import AbstractDistribution
+    from pip._internal.req.req_install import InstallRequirement
+
+
+def make_distribution_for_install_requirement(install_req):
+    # type: (InstallRequirement) -> AbstractDistribution
+    """Returns a Distribution for the given InstallRequirement
+    """
+    # Editable requirements will always be source distributions. They use the
+    # legacy logic until we create a modern standard for them.
+    if install_req.editable:
+        return SourceDistribution(install_req)
+
+    # If it's a wheel, it's a WheelDistribution
+    if install_req.is_wheel:
+        return WheelDistribution(install_req)
+
+    # Otherwise, a SourceDistribution
+    return SourceDistribution(install_req)
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..e419d4808
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..948a27016
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/installed.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/installed.cpython-36.pyc
new file mode 100644
index 000000000..ed98bf884
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/installed.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/sdist.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/sdist.cpython-36.pyc
new file mode 100644
index 000000000..8f7d24130
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/sdist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..c576e67d5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/distributions/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/base.py b/venv/Lib/site-packages/pip/_internal/distributions/base.py
new file mode 100644
index 000000000..b836b98d1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/distributions/base.py
@@ -0,0 +1,45 @@
+import abc
+
+from pip._vendor.six import add_metaclass
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional
+
+    from pip._vendor.pkg_resources import Distribution
+    from pip._internal.req import InstallRequirement
+    from pip._internal.index.package_finder import PackageFinder
+
+
+@add_metaclass(abc.ABCMeta)
+class AbstractDistribution(object):
+    """A base class for handling installable artifacts.
+
+    The requirements for anything installable are as follows:
+
+     - we must be able to determine the requirement name
+       (or we can't correctly handle the non-upgrade case).
+
+     - for packages with setup requirements, we must also be able
+       to determine their requirements without installing additional
+       packages (for the same reason as run-time dependencies)
+
+     - we must be able to create a Distribution object exposing the
+       above metadata.
+    """
+
+    def __init__(self, req):
+        # type: (InstallRequirement) -> None
+        super(AbstractDistribution, self).__init__()
+        self.req = req
+
+    @abc.abstractmethod
+    def get_pkg_resources_distribution(self):
+        # type: () -> Optional[Distribution]
+        raise NotImplementedError()
+
+    @abc.abstractmethod
+    def prepare_distribution_metadata(self, finder, build_isolation):
+        # type: (PackageFinder, bool) -> None
+        raise NotImplementedError()
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/installed.py b/venv/Lib/site-packages/pip/_internal/distributions/installed.py
new file mode 100644
index 000000000..0d15bf424
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/distributions/installed.py
@@ -0,0 +1,24 @@
+from pip._internal.distributions.base import AbstractDistribution
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional
+
+    from pip._vendor.pkg_resources import Distribution
+    from pip._internal.index.package_finder import PackageFinder
+
+
+class InstalledDistribution(AbstractDistribution):
+    """Represents an installed package.
+
+    This does not need any preparation as the required information has already
+    been computed.
+    """
+
+    def get_pkg_resources_distribution(self):
+        # type: () -> Optional[Distribution]
+        return self.req.satisfied_by
+
+    def prepare_distribution_metadata(self, finder, build_isolation):
+        # type: (PackageFinder, bool) -> None
+        pass
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/sdist.py b/venv/Lib/site-packages/pip/_internal/distributions/sdist.py
new file mode 100644
index 000000000..be3d7d97a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/distributions/sdist.py
@@ -0,0 +1,104 @@
+import logging
+
+from pip._internal.build_env import BuildEnvironment
+from pip._internal.distributions.base import AbstractDistribution
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.subprocess import runner_with_spinner_message
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Set, Tuple
+
+    from pip._vendor.pkg_resources import Distribution
+    from pip._internal.index.package_finder import PackageFinder
+
+
+logger = logging.getLogger(__name__)
+
+
+class SourceDistribution(AbstractDistribution):
+    """Represents a source distribution.
+
+    The preparation step for these needs metadata for the packages to be
+    generated, either using PEP 517 or using the legacy `setup.py egg_info`.
+    """
+
+    def get_pkg_resources_distribution(self):
+        # type: () -> Distribution
+        return self.req.get_dist()
+
+    def prepare_distribution_metadata(self, finder, build_isolation):
+        # type: (PackageFinder, bool) -> None
+        # Load pyproject.toml, to determine whether PEP 517 is to be used
+        self.req.load_pyproject_toml()
+
+        # Set up the build isolation, if this requirement should be isolated
+        should_isolate = self.req.use_pep517 and build_isolation
+        if should_isolate:
+            self._setup_isolation(finder)
+
+        self.req.prepare_metadata()
+
+    def _setup_isolation(self, finder):
+        # type: (PackageFinder) -> None
+        def _raise_conflicts(conflicting_with, conflicting_reqs):
+            # type: (str, Set[Tuple[str, str]]) -> None
+            format_string = (
+                "Some build dependencies for {requirement} "
+                "conflict with {conflicting_with}: {description}."
+            )
+            error_message = format_string.format(
+                requirement=self.req,
+                conflicting_with=conflicting_with,
+                description=', '.join(
+                    '{} is incompatible with {}'.format(installed, wanted)
+                    for installed, wanted in sorted(conflicting)
+                )
+            )
+            raise InstallationError(error_message)
+
+        # Isolate in a BuildEnvironment and install the build-time
+        # requirements.
+        pyproject_requires = self.req.pyproject_requires
+        assert pyproject_requires is not None
+
+        self.req.build_env = BuildEnvironment()
+        self.req.build_env.install_requirements(
+            finder, pyproject_requires, 'overlay',
+            "Installing build dependencies"
+        )
+        conflicting, missing = self.req.build_env.check_requirements(
+            self.req.requirements_to_check
+        )
+        if conflicting:
+            _raise_conflicts("PEP 517/518 supported requirements",
+                             conflicting)
+        if missing:
+            logger.warning(
+                "Missing build requirements in pyproject.toml for %s.",
+                self.req,
+            )
+            logger.warning(
+                "The project does not specify a build backend, and "
+                "pip cannot fall back to setuptools without %s.",
+                " and ".join(map(repr, sorted(missing)))
+            )
+        # Install any extra build dependencies that the backend requests.
+        # This must be done in a second pass, as the pyproject.toml
+        # dependencies must be installed before we can call the backend.
+        with self.req.build_env:
+            runner = runner_with_spinner_message(
+                "Getting requirements to build wheel"
+            )
+            backend = self.req.pep517_backend
+            assert backend is not None
+            with backend.subprocess_runner(runner):
+                reqs = backend.get_requires_for_build_wheel()
+
+        conflicting, missing = self.req.build_env.check_requirements(reqs)
+        if conflicting:
+            _raise_conflicts("the backend dependencies", conflicting)
+        self.req.build_env.install_requirements(
+            finder, missing, 'normal',
+            "Installing backend dependencies"
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/distributions/wheel.py b/venv/Lib/site-packages/pip/_internal/distributions/wheel.py
new file mode 100644
index 000000000..bf3482b15
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/distributions/wheel.py
@@ -0,0 +1,36 @@
+from zipfile import ZipFile
+
+from pip._internal.distributions.base import AbstractDistribution
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.wheel import pkg_resources_distribution_for_wheel
+
+if MYPY_CHECK_RUNNING:
+    from pip._vendor.pkg_resources import Distribution
+    from pip._internal.index.package_finder import PackageFinder
+
+
+class WheelDistribution(AbstractDistribution):
+    """Represents a wheel distribution.
+
+    This does not need any preparation as wheels can be directly unpacked.
+    """
+
+    def get_pkg_resources_distribution(self):
+        # type: () -> Distribution
+        """Loads the metadata from the wheel file into memory and returns a
+        Distribution that uses it, not relying on the wheel file or
+        requirement.
+        """
+        # Set as part of preparation during download.
+        assert self.req.local_file_path
+        # Wheels are never unnamed.
+        assert self.req.name
+
+        with ZipFile(self.req.local_file_path, allowZip64=True) as z:
+            return pkg_resources_distribution_for_wheel(
+                z, self.req.name, self.req.local_file_path
+            )
+
+    def prepare_distribution_metadata(self, finder, build_isolation):
+        # type: (PackageFinder, bool) -> None
+        pass
diff --git a/venv/Lib/site-packages/pip/_internal/exceptions.py b/venv/Lib/site-packages/pip/_internal/exceptions.py
new file mode 100644
index 000000000..3f26215d6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/exceptions.py
@@ -0,0 +1,381 @@
+"""Exceptions used throughout package"""
+
+from __future__ import absolute_import
+
+from itertools import chain, groupby, repeat
+
+from pip._vendor.six import iteritems
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Optional, List, Dict, Text
+
+    from pip._vendor.pkg_resources import Distribution
+    from pip._vendor.requests.models import Response, Request
+    from pip._vendor.six import PY3
+    from pip._vendor.six.moves import configparser
+
+    from pip._internal.req.req_install import InstallRequirement
+
+    if PY3:
+        from hashlib import _Hash
+    else:
+        from hashlib import _hash as _Hash
+
+
+class PipError(Exception):
+    """Base pip exception"""
+
+
+class ConfigurationError(PipError):
+    """General exception in configuration"""
+
+
+class InstallationError(PipError):
+    """General exception during installation"""
+
+
+class UninstallationError(PipError):
+    """General exception during uninstallation"""
+
+
+class NoneMetadataError(PipError):
+    """
+    Raised when accessing "METADATA" or "PKG-INFO" metadata for a
+    pip._vendor.pkg_resources.Distribution object and
+    `dist.has_metadata('METADATA')` returns True but
+    `dist.get_metadata('METADATA')` returns None (and similarly for
+    "PKG-INFO").
+    """
+
+    def __init__(self, dist, metadata_name):
+        # type: (Distribution, str) -> None
+        """
+        :param dist: A Distribution object.
+        :param metadata_name: The name of the metadata being accessed
+            (can be "METADATA" or "PKG-INFO").
+        """
+        self.dist = dist
+        self.metadata_name = metadata_name
+
+    def __str__(self):
+        # type: () -> str
+        # Use `dist` in the error message because its stringification
+        # includes more information, like the version and location.
+        return (
+            'None {} metadata found for distribution: {}'.format(
+                self.metadata_name, self.dist,
+            )
+        )
+
+
+class DistributionNotFound(InstallationError):
+    """Raised when a distribution cannot be found to satisfy a requirement"""
+
+
+class RequirementsFileParseError(InstallationError):
+    """Raised when a general error occurs parsing a requirements file line."""
+
+
+class BestVersionAlreadyInstalled(PipError):
+    """Raised when the most up-to-date version of a package is already
+    installed."""
+
+
+class BadCommand(PipError):
+    """Raised when virtualenv or a command is not found"""
+
+
+class CommandError(PipError):
+    """Raised when there is an error in command-line arguments"""
+
+
+class SubProcessError(PipError):
+    """Raised when there is an error raised while executing a
+    command in subprocess"""
+
+
+class PreviousBuildDirError(PipError):
+    """Raised when there's a previous conflicting build directory"""
+
+
+class NetworkConnectionError(PipError):
+    """HTTP connection error"""
+
+    def __init__(self, error_msg, response=None, request=None):
+        # type: (Text, Response, Request) -> None
+        """
+        Initialize NetworkConnectionError with  `request` and `response`
+        objects.
+        """
+        self.response = response
+        self.request = request
+        self.error_msg = error_msg
+        if (self.response is not None and not self.request and
+                hasattr(response, 'request')):
+            self.request = self.response.request
+        super(NetworkConnectionError, self).__init__(
+            error_msg, response, request)
+
+    def __str__(self):
+        # type: () -> str
+        return str(self.error_msg)
+
+
+class InvalidWheelFilename(InstallationError):
+    """Invalid wheel filename."""
+
+
+class UnsupportedWheel(InstallationError):
+    """Unsupported wheel."""
+
+
+class MetadataInconsistent(InstallationError):
+    """Built metadata contains inconsistent information.
+
+    This is raised when the metadata contains values (e.g. name and version)
+    that do not match the information previously obtained from sdist filename
+    or user-supplied ``#egg=`` value.
+    """
+    def __init__(self, ireq, field, built):
+        # type: (InstallRequirement, str, Any) -> None
+        self.ireq = ireq
+        self.field = field
+        self.built = built
+
+    def __str__(self):
+        # type: () -> str
+        return "Requested {} has different {} in metadata: {!r}".format(
+            self.ireq, self.field, self.built,
+        )
+
+
+class HashErrors(InstallationError):
+    """Multiple HashError instances rolled into one for reporting"""
+
+    def __init__(self):
+        # type: () -> None
+        self.errors = []  # type: List[HashError]
+
+    def append(self, error):
+        # type: (HashError) -> None
+        self.errors.append(error)
+
+    def __str__(self):
+        # type: () -> str
+        lines = []
+        self.errors.sort(key=lambda e: e.order)
+        for cls, errors_of_cls in groupby(self.errors, lambda e: e.__class__):
+            lines.append(cls.head)
+            lines.extend(e.body() for e in errors_of_cls)
+        if lines:
+            return '\n'.join(lines)
+        return ''
+
+    def __nonzero__(self):
+        # type: () -> bool
+        return bool(self.errors)
+
+    def __bool__(self):
+        # type: () -> bool
+        return self.__nonzero__()
+
+
+class HashError(InstallationError):
+    """
+    A failure to verify a package against known-good hashes
+
+    :cvar order: An int sorting hash exception classes by difficulty of
+        recovery (lower being harder), so the user doesn't bother fretting
+        about unpinned packages when he has deeper issues, like VCS
+        dependencies, to deal with. Also keeps error reports in a
+        deterministic order.
+    :cvar head: A section heading for display above potentially many
+        exceptions of this kind
+    :ivar req: The InstallRequirement that triggered this error. This is
+        pasted on after the exception is instantiated, because it's not
+        typically available earlier.
+
+    """
+    req = None  # type: Optional[InstallRequirement]
+    head = ''
+    order = None  # type: Optional[int]
+
+    def body(self):
+        # type: () -> str
+        """Return a summary of me for display under the heading.
+
+        This default implementation simply prints a description of the
+        triggering requirement.
+
+        :param req: The InstallRequirement that provoked this error, with
+            its link already populated by the resolver's _populate_link().
+
+        """
+        return '    {}'.format(self._requirement_name())
+
+    def __str__(self):
+        # type: () -> str
+        return '{}\n{}'.format(self.head, self.body())
+
+    def _requirement_name(self):
+        # type: () -> str
+        """Return a description of the requirement that triggered me.
+
+        This default implementation returns long description of the req, with
+        line numbers
+
+        """
+        return str(self.req) if self.req else 'unknown package'
+
+
+class VcsHashUnsupported(HashError):
+    """A hash was provided for a version-control-system-based requirement, but
+    we don't have a method for hashing those."""
+
+    order = 0
+    head = ("Can't verify hashes for these requirements because we don't "
+            "have a way to hash version control repositories:")
+
+
+class DirectoryUrlHashUnsupported(HashError):
+    """A hash was provided for a version-control-system-based requirement, but
+    we don't have a method for hashing those."""
+
+    order = 1
+    head = ("Can't verify hashes for these file:// requirements because they "
+            "point to directories:")
+
+
+class HashMissing(HashError):
+    """A hash was needed for a requirement but is absent."""
+
+    order = 2
+    head = ('Hashes are required in --require-hashes mode, but they are '
+            'missing from some requirements. Here is a list of those '
+            'requirements along with the hashes their downloaded archives '
+            'actually had. Add lines like these to your requirements files to '
+            'prevent tampering. (If you did not enable --require-hashes '
+            'manually, note that it turns on automatically when any package '
+            'has a hash.)')
+
+    def __init__(self, gotten_hash):
+        # type: (str) -> None
+        """
+        :param gotten_hash: The hash of the (possibly malicious) archive we
+            just downloaded
+        """
+        self.gotten_hash = gotten_hash
+
+    def body(self):
+        # type: () -> str
+        # Dodge circular import.
+        from pip._internal.utils.hashes import FAVORITE_HASH
+
+        package = None
+        if self.req:
+            # In the case of URL-based requirements, display the original URL
+            # seen in the requirements file rather than the package name,
+            # so the output can be directly copied into the requirements file.
+            package = (self.req.original_link if self.req.original_link
+                       # In case someone feeds something downright stupid
+                       # to InstallRequirement's constructor.
+                       else getattr(self.req, 'req', None))
+        return '    {} --hash={}:{}'.format(package or 'unknown package',
+                                            FAVORITE_HASH,
+                                            self.gotten_hash)
+
+
+class HashUnpinned(HashError):
+    """A requirement had a hash specified but was not pinned to a specific
+    version."""
+
+    order = 3
+    head = ('In --require-hashes mode, all requirements must have their '
+            'versions pinned with ==. These do not:')
+
+
+class HashMismatch(HashError):
+    """
+    Distribution file hash values don't match.
+
+    :ivar package_name: The name of the package that triggered the hash
+        mismatch. Feel free to write to this after the exception is raise to
+        improve its error message.
+
+    """
+    order = 4
+    head = ('THESE PACKAGES DO NOT MATCH THE HASHES FROM THE REQUIREMENTS '
+            'FILE. If you have updated the package versions, please update '
+            'the hashes. Otherwise, examine the package contents carefully; '
+            'someone may have tampered with them.')
+
+    def __init__(self, allowed, gots):
+        # type: (Dict[str, List[str]], Dict[str, _Hash]) -> None
+        """
+        :param allowed: A dict of algorithm names pointing to lists of allowed
+            hex digests
+        :param gots: A dict of algorithm names pointing to hashes we
+            actually got from the files under suspicion
+        """
+        self.allowed = allowed
+        self.gots = gots
+
+    def body(self):
+        # type: () -> str
+        return '    {}:\n{}'.format(self._requirement_name(),
+                                    self._hash_comparison())
+
+    def _hash_comparison(self):
+        # type: () -> str
+        """
+        Return a comparison of actual and expected hash values.
+
+        Example::
+
+               Expected sha256 abcdeabcdeabcdeabcdeabcdeabcdeabcdeabcdeabcde
+                            or 123451234512345123451234512345123451234512345
+                    Got        bcdefbcdefbcdefbcdefbcdefbcdefbcdefbcdefbcdef
+
+        """
+        def hash_then_or(hash_name):
+            # type: (str) -> chain[str]
+            # For now, all the decent hashes have 6-char names, so we can get
+            # away with hard-coding space literals.
+            return chain([hash_name], repeat('    or'))
+
+        lines = []  # type: List[str]
+        for hash_name, expecteds in iteritems(self.allowed):
+            prefix = hash_then_or(hash_name)
+            lines.extend(('        Expected {} {}'.format(next(prefix), e))
+                         for e in expecteds)
+            lines.append('             Got        {}\n'.format(
+                         self.gots[hash_name].hexdigest()))
+        return '\n'.join(lines)
+
+
+class UnsupportedPythonVersion(InstallationError):
+    """Unsupported python version according to Requires-Python package
+    metadata."""
+
+
+class ConfigurationFileCouldNotBeLoaded(ConfigurationError):
+    """When there are errors while loading a configuration file
+    """
+
+    def __init__(self, reason="could not be loaded", fname=None, error=None):
+        # type: (str, Optional[str], Optional[configparser.Error]) -> None
+        super(ConfigurationFileCouldNotBeLoaded, self).__init__(error)
+        self.reason = reason
+        self.fname = fname
+        self.error = error
+
+    def __str__(self):
+        # type: () -> str
+        if self.fname is not None:
+            message_part = " in {}.".format(self.fname)
+        else:
+            assert self.error is not None
+            message_part = ".\n{}\n".format(self.error)
+        return "Configuration file {}{}".format(self.reason, message_part)
diff --git a/venv/Lib/site-packages/pip/_internal/index/__init__.py b/venv/Lib/site-packages/pip/_internal/index/__init__.py
new file mode 100644
index 000000000..7a17b7b3b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/index/__init__.py
@@ -0,0 +1,2 @@
+"""Index interaction code
+"""
diff --git a/venv/Lib/site-packages/pip/_internal/index/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/index/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..ebfc8c5d0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/index/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/index/__pycache__/collector.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/index/__pycache__/collector.cpython-36.pyc
new file mode 100644
index 000000000..bb1b8f93e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/index/__pycache__/collector.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/index/__pycache__/package_finder.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/index/__pycache__/package_finder.cpython-36.pyc
new file mode 100644
index 000000000..bb91440b9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/index/__pycache__/package_finder.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/index/collector.py b/venv/Lib/site-packages/pip/_internal/index/collector.py
new file mode 100644
index 000000000..6c35fc660
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/index/collector.py
@@ -0,0 +1,692 @@
+"""
+The main purpose of this module is to expose LinkCollector.collect_links().
+"""
+
+import cgi
+import functools
+import itertools
+import logging
+import mimetypes
+import os
+import re
+from collections import OrderedDict
+
+from pip._vendor import html5lib, requests
+from pip._vendor.distlib.compat import unescape
+from pip._vendor.requests.exceptions import RetryError, SSLError
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+from pip._vendor.six.moves.urllib import request as urllib_request
+
+from pip._internal.exceptions import NetworkConnectionError
+from pip._internal.models.link import Link
+from pip._internal.models.search_scope import SearchScope
+from pip._internal.network.utils import raise_for_status
+from pip._internal.utils.filetypes import ARCHIVE_EXTENSIONS
+from pip._internal.utils.misc import pairwise, redact_auth_from_url
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url, url_to_path
+from pip._internal.vcs import is_url, vcs
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import (
+        Callable, Iterable, List, MutableMapping, Optional,
+        Protocol, Sequence, Tuple, TypeVar, Union,
+    )
+    import xml.etree.ElementTree
+
+    from pip._vendor.requests import Response
+
+    from pip._internal.network.session import PipSession
+
+    HTMLElement = xml.etree.ElementTree.Element
+    ResponseHeaders = MutableMapping[str, str]
+
+    # Used in the @lru_cache polyfill.
+    F = TypeVar('F')
+
+    class LruCache(Protocol):
+        def __call__(self, maxsize=None):
+            # type: (Optional[int]) -> Callable[[F], F]
+            raise NotImplementedError
+
+
+logger = logging.getLogger(__name__)
+
+
+# Fallback to noop_lru_cache in Python 2
+# TODO: this can be removed when python 2 support is dropped!
+def noop_lru_cache(maxsize=None):
+    # type: (Optional[int]) -> Callable[[F], F]
+    def _wrapper(f):
+        # type: (F) -> F
+        return f
+    return _wrapper
+
+
+_lru_cache = getattr(functools, "lru_cache", noop_lru_cache)  # type: LruCache
+
+
+def _match_vcs_scheme(url):
+    # type: (str) -> Optional[str]
+    """Look for VCS schemes in the URL.
+
+    Returns the matched VCS scheme, or None if there's no match.
+    """
+    for scheme in vcs.schemes:
+        if url.lower().startswith(scheme) and url[len(scheme)] in '+:':
+            return scheme
+    return None
+
+
+def _is_url_like_archive(url):
+    # type: (str) -> bool
+    """Return whether the URL looks like an archive.
+    """
+    filename = Link(url).filename
+    for bad_ext in ARCHIVE_EXTENSIONS:
+        if filename.endswith(bad_ext):
+            return True
+    return False
+
+
+class _NotHTML(Exception):
+    def __init__(self, content_type, request_desc):
+        # type: (str, str) -> None
+        super(_NotHTML, self).__init__(content_type, request_desc)
+        self.content_type = content_type
+        self.request_desc = request_desc
+
+
+def _ensure_html_header(response):
+    # type: (Response) -> None
+    """Check the Content-Type header to ensure the response contains HTML.
+
+    Raises `_NotHTML` if the content type is not text/html.
+    """
+    content_type = response.headers.get("Content-Type", "")
+    if not content_type.lower().startswith("text/html"):
+        raise _NotHTML(content_type, response.request.method)
+
+
+class _NotHTTP(Exception):
+    pass
+
+
+def _ensure_html_response(url, session):
+    # type: (str, PipSession) -> None
+    """Send a HEAD request to the URL, and ensure the response contains HTML.
+
+    Raises `_NotHTTP` if the URL is not available for a HEAD request, or
+    `_NotHTML` if the content type is not text/html.
+    """
+    scheme, netloc, path, query, fragment = urllib_parse.urlsplit(url)
+    if scheme not in {'http', 'https'}:
+        raise _NotHTTP()
+
+    resp = session.head(url, allow_redirects=True)
+    raise_for_status(resp)
+
+    _ensure_html_header(resp)
+
+
+def _get_html_response(url, session):
+    # type: (str, PipSession) -> Response
+    """Access an HTML page with GET, and return the response.
+
+    This consists of three parts:
+
+    1. If the URL looks suspiciously like an archive, send a HEAD first to
+       check the Content-Type is HTML, to avoid downloading a large file.
+       Raise `_NotHTTP` if the content type cannot be determined, or
+       `_NotHTML` if it is not HTML.
+    2. Actually perform the request. Raise HTTP exceptions on network failures.
+    3. Check the Content-Type header to make sure we got HTML, and raise
+       `_NotHTML` otherwise.
+    """
+    if _is_url_like_archive(url):
+        _ensure_html_response(url, session=session)
+
+    logger.debug('Getting page %s', redact_auth_from_url(url))
+
+    resp = session.get(
+        url,
+        headers={
+            "Accept": "text/html",
+            # We don't want to blindly returned cached data for
+            # /simple/, because authors generally expecting that
+            # twine upload && pip install will function, but if
+            # they've done a pip install in the last ~10 minutes
+            # it won't. Thus by setting this to zero we will not
+            # blindly use any cached data, however the benefit of
+            # using max-age=0 instead of no-cache, is that we will
+            # still support conditional requests, so we will still
+            # minimize traffic sent in cases where the page hasn't
+            # changed at all, we will just always incur the round
+            # trip for the conditional GET now instead of only
+            # once per 10 minutes.
+            # For more information, please see pypa/pip#5670.
+            "Cache-Control": "max-age=0",
+        },
+    )
+    raise_for_status(resp)
+
+    # The check for archives above only works if the url ends with
+    # something that looks like an archive. However that is not a
+    # requirement of an url. Unless we issue a HEAD request on every
+    # url we cannot know ahead of time for sure if something is HTML
+    # or not. However we can check after we've downloaded it.
+    _ensure_html_header(resp)
+
+    return resp
+
+
+def _get_encoding_from_headers(headers):
+    # type: (ResponseHeaders) -> Optional[str]
+    """Determine if we have any encoding information in our headers.
+    """
+    if headers and "Content-Type" in headers:
+        content_type, params = cgi.parse_header(headers["Content-Type"])
+        if "charset" in params:
+            return params['charset']
+    return None
+
+
+def _determine_base_url(document, page_url):
+    # type: (HTMLElement, str) -> str
+    """Determine the HTML document's base URL.
+
+    This looks for a ``<base>`` tag in the HTML document. If present, its href
+    attribute denotes the base URL of anchor tags in the document. If there is
+    no such tag (or if it does not have a valid href attribute), the HTML
+    file's URL is used as the base URL.
+
+    :param document: An HTML document representation. The current
+        implementation expects the result of ``html5lib.parse()``.
+    :param page_url: The URL of the HTML document.
+    """
+    for base in document.findall(".//base"):
+        href = base.get("href")
+        if href is not None:
+            return href
+    return page_url
+
+
+def _clean_url_path_part(part):
+    # type: (str) -> str
+    """
+    Clean a "part" of a URL path (i.e. after splitting on "@" characters).
+    """
+    # We unquote prior to quoting to make sure nothing is double quoted.
+    return urllib_parse.quote(urllib_parse.unquote(part))
+
+
+def _clean_file_url_path(part):
+    # type: (str) -> str
+    """
+    Clean the first part of a URL path that corresponds to a local
+    filesystem path (i.e. the first part after splitting on "@" characters).
+    """
+    # We unquote prior to quoting to make sure nothing is double quoted.
+    # Also, on Windows the path part might contain a drive letter which
+    # should not be quoted. On Linux where drive letters do not
+    # exist, the colon should be quoted. We rely on urllib.request
+    # to do the right thing here.
+    return urllib_request.pathname2url(urllib_request.url2pathname(part))
+
+
+# percent-encoded:                   /
+_reserved_chars_re = re.compile('(@|%2F)', re.IGNORECASE)
+
+
+def _clean_url_path(path, is_local_path):
+    # type: (str, bool) -> str
+    """
+    Clean the path portion of a URL.
+    """
+    if is_local_path:
+        clean_func = _clean_file_url_path
+    else:
+        clean_func = _clean_url_path_part
+
+    # Split on the reserved characters prior to cleaning so that
+    # revision strings in VCS URLs are properly preserved.
+    parts = _reserved_chars_re.split(path)
+
+    cleaned_parts = []
+    for to_clean, reserved in pairwise(itertools.chain(parts, [''])):
+        cleaned_parts.append(clean_func(to_clean))
+        # Normalize %xx escapes (e.g. %2f -> %2F)
+        cleaned_parts.append(reserved.upper())
+
+    return ''.join(cleaned_parts)
+
+
+def _clean_link(url):
+    # type: (str) -> str
+    """
+    Make sure a link is fully quoted.
+    For example, if ' ' occurs in the URL, it will be replaced with "%20",
+    and without double-quoting other characters.
+    """
+    # Split the URL into parts according to the general structure
+    # `scheme://netloc/path;parameters?query#fragment`.
+    result = urllib_parse.urlparse(url)
+    # If the netloc is empty, then the URL refers to a local filesystem path.
+    is_local_path = not result.netloc
+    path = _clean_url_path(result.path, is_local_path=is_local_path)
+    return urllib_parse.urlunparse(result._replace(path=path))
+
+
+def _create_link_from_element(
+    anchor,    # type: HTMLElement
+    page_url,  # type: str
+    base_url,  # type: str
+):
+    # type: (...) -> Optional[Link]
+    """
+    Convert an anchor element in a simple repository page to a Link.
+    """
+    href = anchor.get("href")
+    if not href:
+        return None
+
+    url = _clean_link(urllib_parse.urljoin(base_url, href))
+    pyrequire = anchor.get('data-requires-python')
+    pyrequire = unescape(pyrequire) if pyrequire else None
+
+    yanked_reason = anchor.get('data-yanked')
+    if yanked_reason:
+        # This is a unicode string in Python 2 (and 3).
+        yanked_reason = unescape(yanked_reason)
+
+    link = Link(
+        url,
+        comes_from=page_url,
+        requires_python=pyrequire,
+        yanked_reason=yanked_reason,
+    )
+
+    return link
+
+
+class CacheablePageContent(object):
+    def __init__(self, page):
+        # type: (HTMLPage) -> None
+        assert page.cache_link_parsing
+        self.page = page
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return (isinstance(other, type(self)) and
+                self.page.url == other.page.url)
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self.page.url)
+
+
+def with_cached_html_pages(
+    fn,    # type: Callable[[HTMLPage], Iterable[Link]]
+):
+    # type: (...) -> Callable[[HTMLPage], List[Link]]
+    """
+    Given a function that parses an Iterable[Link] from an HTMLPage, cache the
+    function's result (keyed by CacheablePageContent), unless the HTMLPage
+    `page` has `page.cache_link_parsing == False`.
+    """
+
+    @_lru_cache(maxsize=None)
+    def wrapper(cacheable_page):
+        # type: (CacheablePageContent) -> List[Link]
+        return list(fn(cacheable_page.page))
+
+    @functools.wraps(fn)
+    def wrapper_wrapper(page):
+        # type: (HTMLPage) -> List[Link]
+        if page.cache_link_parsing:
+            return wrapper(CacheablePageContent(page))
+        return list(fn(page))
+
+    return wrapper_wrapper
+
+
+@with_cached_html_pages
+def parse_links(page):
+    # type: (HTMLPage) -> Iterable[Link]
+    """
+    Parse an HTML document, and yield its anchor elements as Link objects.
+    """
+    document = html5lib.parse(
+        page.content,
+        transport_encoding=page.encoding,
+        namespaceHTMLElements=False,
+    )
+
+    url = page.url
+    base_url = _determine_base_url(document, url)
+    for anchor in document.findall(".//a"):
+        link = _create_link_from_element(
+            anchor,
+            page_url=url,
+            base_url=base_url,
+        )
+        if link is None:
+            continue
+        yield link
+
+
+class HTMLPage(object):
+    """Represents one page, along with its URL"""
+
+    def __init__(
+        self,
+        content,                  # type: bytes
+        encoding,                 # type: Optional[str]
+        url,                      # type: str
+        cache_link_parsing=True,  # type: bool
+    ):
+        # type: (...) -> None
+        """
+        :param encoding: the encoding to decode the given content.
+        :param url: the URL from which the HTML was downloaded.
+        :param cache_link_parsing: whether links parsed from this page's url
+                                   should be cached. PyPI index urls should
+                                   have this set to False, for example.
+        """
+        self.content = content
+        self.encoding = encoding
+        self.url = url
+        self.cache_link_parsing = cache_link_parsing
+
+    def __str__(self):
+        # type: () -> str
+        return redact_auth_from_url(self.url)
+
+
+def _handle_get_page_fail(
+    link,  # type: Link
+    reason,  # type: Union[str, Exception]
+    meth=None  # type: Optional[Callable[..., None]]
+):
+    # type: (...) -> None
+    if meth is None:
+        meth = logger.debug
+    meth("Could not fetch URL %s: %s - skipping", link, reason)
+
+
+def _make_html_page(response, cache_link_parsing=True):
+    # type: (Response, bool) -> HTMLPage
+    encoding = _get_encoding_from_headers(response.headers)
+    return HTMLPage(
+        response.content,
+        encoding=encoding,
+        url=response.url,
+        cache_link_parsing=cache_link_parsing)
+
+
+def _get_html_page(link, session=None):
+    # type: (Link, Optional[PipSession]) -> Optional[HTMLPage]
+    if session is None:
+        raise TypeError(
+            "_get_html_page() missing 1 required keyword argument: 'session'"
+        )
+
+    url = link.url.split('#', 1)[0]
+
+    # Check for VCS schemes that do not support lookup as web pages.
+    vcs_scheme = _match_vcs_scheme(url)
+    if vcs_scheme:
+        logger.warning('Cannot look at %s URL %s because it does not support '
+                       'lookup as web pages.', vcs_scheme, link)
+        return None
+
+    # Tack index.html onto file:// URLs that point to directories
+    scheme, _, path, _, _, _ = urllib_parse.urlparse(url)
+    if (scheme == 'file' and os.path.isdir(urllib_request.url2pathname(path))):
+        # add trailing slash if not present so urljoin doesn't trim
+        # final segment
+        if not url.endswith('/'):
+            url += '/'
+        url = urllib_parse.urljoin(url, 'index.html')
+        logger.debug(' file: URL is directory, getting %s', url)
+
+    try:
+        resp = _get_html_response(url, session=session)
+    except _NotHTTP:
+        logger.warning(
+            'Skipping page %s because it looks like an archive, and cannot '
+            'be checked by a HTTP HEAD request.', link,
+        )
+    except _NotHTML as exc:
+        logger.warning(
+            'Skipping page %s because the %s request got Content-Type: %s.'
+            'The only supported Content-Type is text/html',
+            link, exc.request_desc, exc.content_type,
+        )
+    except NetworkConnectionError as exc:
+        _handle_get_page_fail(link, exc)
+    except RetryError as exc:
+        _handle_get_page_fail(link, exc)
+    except SSLError as exc:
+        reason = "There was a problem confirming the ssl certificate: "
+        reason += str(exc)
+        _handle_get_page_fail(link, reason, meth=logger.info)
+    except requests.ConnectionError as exc:
+        _handle_get_page_fail(link, "connection error: {}".format(exc))
+    except requests.Timeout:
+        _handle_get_page_fail(link, "timed out")
+    else:
+        return _make_html_page(resp,
+                               cache_link_parsing=link.cache_link_parsing)
+    return None
+
+
+def _remove_duplicate_links(links):
+    # type: (Iterable[Link]) -> List[Link]
+    """
+    Return a list of links, with duplicates removed and ordering preserved.
+    """
+    # We preserve the ordering when removing duplicates because we can.
+    return list(OrderedDict.fromkeys(links))
+
+
+def group_locations(locations, expand_dir=False):
+    # type: (Sequence[str], bool) -> Tuple[List[str], List[str]]
+    """
+    Divide a list of locations into two groups: "files" (archives) and "urls."
+
+    :return: A pair of lists (files, urls).
+    """
+    files = []
+    urls = []
+
+    # puts the url for the given file path into the appropriate list
+    def sort_path(path):
+        # type: (str) -> None
+        url = path_to_url(path)
+        if mimetypes.guess_type(url, strict=False)[0] == 'text/html':
+            urls.append(url)
+        else:
+            files.append(url)
+
+    for url in locations:
+
+        is_local_path = os.path.exists(url)
+        is_file_url = url.startswith('file:')
+
+        if is_local_path or is_file_url:
+            if is_local_path:
+                path = url
+            else:
+                path = url_to_path(url)
+            if os.path.isdir(path):
+                if expand_dir:
+                    path = os.path.realpath(path)
+                    for item in os.listdir(path):
+                        sort_path(os.path.join(path, item))
+                elif is_file_url:
+                    urls.append(url)
+                else:
+                    logger.warning(
+                        "Path '%s' is ignored: it is a directory.", path,
+                    )
+            elif os.path.isfile(path):
+                sort_path(path)
+            else:
+                logger.warning(
+                    "Url '%s' is ignored: it is neither a file "
+                    "nor a directory.", url,
+                )
+        elif is_url(url):
+            # Only add url with clear scheme
+            urls.append(url)
+        else:
+            logger.warning(
+                "Url '%s' is ignored. It is either a non-existing "
+                "path or lacks a specific scheme.", url,
+            )
+
+    return files, urls
+
+
+class CollectedLinks(object):
+
+    """
+    Encapsulates the return value of a call to LinkCollector.collect_links().
+
+    The return value includes both URLs to project pages containing package
+    links, as well as individual package Link objects collected from other
+    sources.
+
+    This info is stored separately as:
+
+    (1) links from the configured file locations,
+    (2) links from the configured find_links, and
+    (3) urls to HTML project pages, as described by the PEP 503 simple
+        repository API.
+    """
+
+    def __init__(
+        self,
+        files,         # type: List[Link]
+        find_links,    # type: List[Link]
+        project_urls,  # type: List[Link]
+    ):
+        # type: (...) -> None
+        """
+        :param files: Links from file locations.
+        :param find_links: Links from find_links.
+        :param project_urls: URLs to HTML project pages, as described by
+            the PEP 503 simple repository API.
+        """
+        self.files = files
+        self.find_links = find_links
+        self.project_urls = project_urls
+
+
+class LinkCollector(object):
+
+    """
+    Responsible for collecting Link objects from all configured locations,
+    making network requests as needed.
+
+    The class's main method is its collect_links() method.
+    """
+
+    def __init__(
+        self,
+        session,       # type: PipSession
+        search_scope,  # type: SearchScope
+    ):
+        # type: (...) -> None
+        self.search_scope = search_scope
+        self.session = session
+
+    @classmethod
+    def create(cls, session, options, suppress_no_index=False):
+        # type: (PipSession, Values, bool) -> LinkCollector
+        """
+        :param session: The Session to use to make requests.
+        :param suppress_no_index: Whether to ignore the --no-index option
+            when constructing the SearchScope object.
+        """
+        index_urls = [options.index_url] + options.extra_index_urls
+        if options.no_index and not suppress_no_index:
+            logger.debug(
+                'Ignoring indexes: %s',
+                ','.join(redact_auth_from_url(url) for url in index_urls),
+            )
+            index_urls = []
+
+        # Make sure find_links is a list before passing to create().
+        find_links = options.find_links or []
+
+        search_scope = SearchScope.create(
+            find_links=find_links, index_urls=index_urls,
+        )
+        link_collector = LinkCollector(
+            session=session, search_scope=search_scope,
+        )
+        return link_collector
+
+    @property
+    def find_links(self):
+        # type: () -> List[str]
+        return self.search_scope.find_links
+
+    def fetch_page(self, location):
+        # type: (Link) -> Optional[HTMLPage]
+        """
+        Fetch an HTML page containing package links.
+        """
+        return _get_html_page(location, session=self.session)
+
+    def collect_links(self, project_name):
+        # type: (str) -> CollectedLinks
+        """Find all available links for the given project name.
+
+        :return: All the Link objects (unfiltered), as a CollectedLinks object.
+        """
+        search_scope = self.search_scope
+        index_locations = search_scope.get_index_urls_locations(project_name)
+        index_file_loc, index_url_loc = group_locations(index_locations)
+        fl_file_loc, fl_url_loc = group_locations(
+            self.find_links, expand_dir=True,
+        )
+
+        file_links = [
+            Link(url) for url in itertools.chain(index_file_loc, fl_file_loc)
+        ]
+
+        # We trust every directly linked archive in find_links
+        find_link_links = [Link(url, '-f') for url in self.find_links]
+
+        # We trust every url that the user has given us whether it was given
+        # via --index-url or --find-links.
+        # We want to filter out anything that does not have a secure origin.
+        url_locations = [
+            link for link in itertools.chain(
+                # Mark PyPI indices as "cache_link_parsing == False" -- this
+                # will avoid caching the result of parsing the page for links.
+                (Link(url, cache_link_parsing=False) for url in index_url_loc),
+                (Link(url) for url in fl_url_loc),
+            )
+            if self.session.is_secure_origin(link)
+        ]
+
+        url_locations = _remove_duplicate_links(url_locations)
+        lines = [
+            '{} location(s) to search for versions of {}:'.format(
+                len(url_locations), project_name,
+            ),
+        ]
+        for link in url_locations:
+            lines.append('* {}'.format(link))
+        logger.debug('\n'.join(lines))
+
+        return CollectedLinks(
+            files=file_links,
+            find_links=find_link_links,
+            project_urls=url_locations,
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/index/package_finder.py b/venv/Lib/site-packages/pip/_internal/index/package_finder.py
new file mode 100644
index 000000000..84115783a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/index/package_finder.py
@@ -0,0 +1,1014 @@
+"""Routines related to PyPI, indexes"""
+
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+from __future__ import absolute_import
+
+import logging
+import re
+
+from pip._vendor.packaging import specifiers
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.packaging.version import parse as parse_version
+
+from pip._internal.exceptions import (
+    BestVersionAlreadyInstalled,
+    DistributionNotFound,
+    InvalidWheelFilename,
+    UnsupportedWheel,
+)
+from pip._internal.index.collector import parse_links
+from pip._internal.models.candidate import InstallationCandidate
+from pip._internal.models.format_control import FormatControl
+from pip._internal.models.link import Link
+from pip._internal.models.selection_prefs import SelectionPreferences
+from pip._internal.models.target_python import TargetPython
+from pip._internal.models.wheel import Wheel
+from pip._internal.utils.filetypes import WHEEL_EXTENSION
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import build_netloc
+from pip._internal.utils.packaging import check_requires_python
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.unpacking import SUPPORTED_EXTENSIONS
+from pip._internal.utils.urls import url_to_path
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        FrozenSet, Iterable, List, Optional, Set, Text, Tuple, Union,
+    )
+
+    from pip._vendor.packaging.tags import Tag
+    from pip._vendor.packaging.version import _BaseVersion
+
+    from pip._internal.index.collector import LinkCollector
+    from pip._internal.models.search_scope import SearchScope
+    from pip._internal.req import InstallRequirement
+    from pip._internal.utils.hashes import Hashes
+
+    BuildTag = Union[Tuple[()], Tuple[int, str]]
+    CandidateSortingKey = (
+        Tuple[int, int, int, _BaseVersion, BuildTag, Optional[int]]
+    )
+
+
+__all__ = ['FormatControl', 'BestCandidateResult', 'PackageFinder']
+
+
+logger = logging.getLogger(__name__)
+
+
+def _check_link_requires_python(
+    link,  # type: Link
+    version_info,  # type: Tuple[int, int, int]
+    ignore_requires_python=False,  # type: bool
+):
+    # type: (...) -> bool
+    """
+    Return whether the given Python version is compatible with a link's
+    "Requires-Python" value.
+
+    :param version_info: A 3-tuple of ints representing the Python
+        major-minor-micro version to check.
+    :param ignore_requires_python: Whether to ignore the "Requires-Python"
+        value if the given Python version isn't compatible.
+    """
+    try:
+        is_compatible = check_requires_python(
+            link.requires_python, version_info=version_info,
+        )
+    except specifiers.InvalidSpecifier:
+        logger.debug(
+            "Ignoring invalid Requires-Python (%r) for link: %s",
+            link.requires_python, link,
+        )
+    else:
+        if not is_compatible:
+            version = '.'.join(map(str, version_info))
+            if not ignore_requires_python:
+                logger.debug(
+                    'Link requires a different Python (%s not in: %r): %s',
+                    version, link.requires_python, link,
+                )
+                return False
+
+            logger.debug(
+                'Ignoring failed Requires-Python check (%s not in: %r) '
+                'for link: %s',
+                version, link.requires_python, link,
+            )
+
+    return True
+
+
+class LinkEvaluator(object):
+
+    """
+    Responsible for evaluating links for a particular project.
+    """
+
+    _py_version_re = re.compile(r'-py([123]\.?[0-9]?)$')
+
+    # Don't include an allow_yanked default value to make sure each call
+    # site considers whether yanked releases are allowed. This also causes
+    # that decision to be made explicit in the calling code, which helps
+    # people when reading the code.
+    def __init__(
+        self,
+        project_name,    # type: str
+        canonical_name,  # type: str
+        formats,         # type: FrozenSet[str]
+        target_python,   # type: TargetPython
+        allow_yanked,    # type: bool
+        ignore_requires_python=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> None
+        """
+        :param project_name: The user supplied package name.
+        :param canonical_name: The canonical package name.
+        :param formats: The formats allowed for this package. Should be a set
+            with 'binary' or 'source' or both in it.
+        :param target_python: The target Python interpreter to use when
+            evaluating link compatibility. This is used, for example, to
+            check wheel compatibility, as well as when checking the Python
+            version, e.g. the Python version embedded in a link filename
+            (or egg fragment) and against an HTML link's optional PEP 503
+            "data-requires-python" attribute.
+        :param allow_yanked: Whether files marked as yanked (in the sense
+            of PEP 592) are permitted to be candidates for install.
+        :param ignore_requires_python: Whether to ignore incompatible
+            PEP 503 "data-requires-python" values in HTML links. Defaults
+            to False.
+        """
+        if ignore_requires_python is None:
+            ignore_requires_python = False
+
+        self._allow_yanked = allow_yanked
+        self._canonical_name = canonical_name
+        self._ignore_requires_python = ignore_requires_python
+        self._formats = formats
+        self._target_python = target_python
+
+        self.project_name = project_name
+
+    def evaluate_link(self, link):
+        # type: (Link) -> Tuple[bool, Optional[Text]]
+        """
+        Determine whether a link is a candidate for installation.
+
+        :return: A tuple (is_candidate, result), where `result` is (1) a
+            version string if `is_candidate` is True, and (2) if
+            `is_candidate` is False, an optional string to log the reason
+            the link fails to qualify.
+        """
+        version = None
+        if link.is_yanked and not self._allow_yanked:
+            reason = link.yanked_reason or '<none given>'
+            # Mark this as a unicode string to prevent "UnicodeEncodeError:
+            # 'ascii' codec can't encode character" in Python 2 when
+            # the reason contains non-ascii characters.
+            return (False, u'yanked for reason: {}'.format(reason))
+
+        if link.egg_fragment:
+            egg_info = link.egg_fragment
+            ext = link.ext
+        else:
+            egg_info, ext = link.splitext()
+            if not ext:
+                return (False, 'not a file')
+            if ext not in SUPPORTED_EXTENSIONS:
+                return (False, 'unsupported archive format: {}'.format(ext))
+            if "binary" not in self._formats and ext == WHEEL_EXTENSION:
+                reason = 'No binaries permitted for {}'.format(
+                    self.project_name)
+                return (False, reason)
+            if "macosx10" in link.path and ext == '.zip':
+                return (False, 'macosx10 one')
+            if ext == WHEEL_EXTENSION:
+                try:
+                    wheel = Wheel(link.filename)
+                except InvalidWheelFilename:
+                    return (False, 'invalid wheel filename')
+                if canonicalize_name(wheel.name) != self._canonical_name:
+                    reason = 'wrong project name (not {})'.format(
+                        self.project_name)
+                    return (False, reason)
+
+                supported_tags = self._target_python.get_tags()
+                if not wheel.supported(supported_tags):
+                    # Include the wheel's tags in the reason string to
+                    # simplify troubleshooting compatibility issues.
+                    file_tags = wheel.get_formatted_file_tags()
+                    reason = (
+                        "none of the wheel's tags match: {}".format(
+                            ', '.join(file_tags)
+                        )
+                    )
+                    return (False, reason)
+
+                version = wheel.version
+
+        # This should be up by the self.ok_binary check, but see issue 2700.
+        if "source" not in self._formats and ext != WHEEL_EXTENSION:
+            reason = 'No sources permitted for {}'.format(self.project_name)
+            return (False, reason)
+
+        if not version:
+            version = _extract_version_from_fragment(
+                egg_info, self._canonical_name,
+            )
+        if not version:
+            reason = 'Missing project version for {}'.format(self.project_name)
+            return (False, reason)
+
+        match = self._py_version_re.search(version)
+        if match:
+            version = version[:match.start()]
+            py_version = match.group(1)
+            if py_version != self._target_python.py_version:
+                return (False, 'Python version is incorrect')
+
+        supports_python = _check_link_requires_python(
+            link, version_info=self._target_python.py_version_info,
+            ignore_requires_python=self._ignore_requires_python,
+        )
+        if not supports_python:
+            # Return None for the reason text to suppress calling
+            # _log_skipped_link().
+            return (False, None)
+
+        logger.debug('Found link %s, version: %s', link, version)
+
+        return (True, version)
+
+
+def filter_unallowed_hashes(
+    candidates,    # type: List[InstallationCandidate]
+    hashes,        # type: Hashes
+    project_name,  # type: str
+):
+    # type: (...) -> List[InstallationCandidate]
+    """
+    Filter out candidates whose hashes aren't allowed, and return a new
+    list of candidates.
+
+    If at least one candidate has an allowed hash, then all candidates with
+    either an allowed hash or no hash specified are returned.  Otherwise,
+    the given candidates are returned.
+
+    Including the candidates with no hash specified when there is a match
+    allows a warning to be logged if there is a more preferred candidate
+    with no hash specified.  Returning all candidates in the case of no
+    matches lets pip report the hash of the candidate that would otherwise
+    have been installed (e.g. permitting the user to more easily update
+    their requirements file with the desired hash).
+    """
+    if not hashes:
+        logger.debug(
+            'Given no hashes to check %s links for project %r: '
+            'discarding no candidates',
+            len(candidates),
+            project_name,
+        )
+        # Make sure we're not returning back the given value.
+        return list(candidates)
+
+    matches_or_no_digest = []
+    # Collect the non-matches for logging purposes.
+    non_matches = []
+    match_count = 0
+    for candidate in candidates:
+        link = candidate.link
+        if not link.has_hash:
+            pass
+        elif link.is_hash_allowed(hashes=hashes):
+            match_count += 1
+        else:
+            non_matches.append(candidate)
+            continue
+
+        matches_or_no_digest.append(candidate)
+
+    if match_count:
+        filtered = matches_or_no_digest
+    else:
+        # Make sure we're not returning back the given value.
+        filtered = list(candidates)
+
+    if len(filtered) == len(candidates):
+        discard_message = 'discarding no candidates'
+    else:
+        discard_message = 'discarding {} non-matches:\n  {}'.format(
+            len(non_matches),
+            '\n  '.join(str(candidate.link) for candidate in non_matches)
+        )
+
+    logger.debug(
+        'Checked %s links for project %r against %s hashes '
+        '(%s matches, %s no digest): %s',
+        len(candidates),
+        project_name,
+        hashes.digest_count,
+        match_count,
+        len(matches_or_no_digest) - match_count,
+        discard_message
+    )
+
+    return filtered
+
+
+class CandidatePreferences(object):
+
+    """
+    Encapsulates some of the preferences for filtering and sorting
+    InstallationCandidate objects.
+    """
+
+    def __init__(
+        self,
+        prefer_binary=False,  # type: bool
+        allow_all_prereleases=False,  # type: bool
+    ):
+        # type: (...) -> None
+        """
+        :param allow_all_prereleases: Whether to allow all pre-releases.
+        """
+        self.allow_all_prereleases = allow_all_prereleases
+        self.prefer_binary = prefer_binary
+
+
+class BestCandidateResult(object):
+    """A collection of candidates, returned by `PackageFinder.find_best_candidate`.
+
+    This class is only intended to be instantiated by CandidateEvaluator's
+    `compute_best_candidate()` method.
+    """
+
+    def __init__(
+        self,
+        candidates,             # type: List[InstallationCandidate]
+        applicable_candidates,  # type: List[InstallationCandidate]
+        best_candidate,         # type: Optional[InstallationCandidate]
+    ):
+        # type: (...) -> None
+        """
+        :param candidates: A sequence of all available candidates found.
+        :param applicable_candidates: The applicable candidates.
+        :param best_candidate: The most preferred candidate found, or None
+            if no applicable candidates were found.
+        """
+        assert set(applicable_candidates) <= set(candidates)
+
+        if best_candidate is None:
+            assert not applicable_candidates
+        else:
+            assert best_candidate in applicable_candidates
+
+        self._applicable_candidates = applicable_candidates
+        self._candidates = candidates
+
+        self.best_candidate = best_candidate
+
+    def iter_all(self):
+        # type: () -> Iterable[InstallationCandidate]
+        """Iterate through all candidates.
+        """
+        return iter(self._candidates)
+
+    def iter_applicable(self):
+        # type: () -> Iterable[InstallationCandidate]
+        """Iterate through the applicable candidates.
+        """
+        return iter(self._applicable_candidates)
+
+
+class CandidateEvaluator(object):
+
+    """
+    Responsible for filtering and sorting candidates for installation based
+    on what tags are valid.
+    """
+
+    @classmethod
+    def create(
+        cls,
+        project_name,         # type: str
+        target_python=None,   # type: Optional[TargetPython]
+        prefer_binary=False,  # type: bool
+        allow_all_prereleases=False,  # type: bool
+        specifier=None,       # type: Optional[specifiers.BaseSpecifier]
+        hashes=None,          # type: Optional[Hashes]
+    ):
+        # type: (...) -> CandidateEvaluator
+        """Create a CandidateEvaluator object.
+
+        :param target_python: The target Python interpreter to use when
+            checking compatibility. If None (the default), a TargetPython
+            object will be constructed from the running Python.
+        :param specifier: An optional object implementing `filter`
+            (e.g. `packaging.specifiers.SpecifierSet`) to filter applicable
+            versions.
+        :param hashes: An optional collection of allowed hashes.
+        """
+        if target_python is None:
+            target_python = TargetPython()
+        if specifier is None:
+            specifier = specifiers.SpecifierSet()
+
+        supported_tags = target_python.get_tags()
+
+        return cls(
+            project_name=project_name,
+            supported_tags=supported_tags,
+            specifier=specifier,
+            prefer_binary=prefer_binary,
+            allow_all_prereleases=allow_all_prereleases,
+            hashes=hashes,
+        )
+
+    def __init__(
+        self,
+        project_name,         # type: str
+        supported_tags,       # type: List[Tag]
+        specifier,            # type: specifiers.BaseSpecifier
+        prefer_binary=False,  # type: bool
+        allow_all_prereleases=False,  # type: bool
+        hashes=None,                  # type: Optional[Hashes]
+    ):
+        # type: (...) -> None
+        """
+        :param supported_tags: The PEP 425 tags supported by the target
+            Python in order of preference (most preferred first).
+        """
+        self._allow_all_prereleases = allow_all_prereleases
+        self._hashes = hashes
+        self._prefer_binary = prefer_binary
+        self._project_name = project_name
+        self._specifier = specifier
+        self._supported_tags = supported_tags
+
+    def get_applicable_candidates(
+        self,
+        candidates,  # type: List[InstallationCandidate]
+    ):
+        # type: (...) -> List[InstallationCandidate]
+        """
+        Return the applicable candidates from a list of candidates.
+        """
+        # Using None infers from the specifier instead.
+        allow_prereleases = self._allow_all_prereleases or None
+        specifier = self._specifier
+        versions = {
+            str(v) for v in specifier.filter(
+                # We turn the version object into a str here because otherwise
+                # when we're debundled but setuptools isn't, Python will see
+                # packaging.version.Version and
+                # pkg_resources._vendor.packaging.version.Version as different
+                # types. This way we'll use a str as a common data interchange
+                # format. If we stop using the pkg_resources provided specifier
+                # and start using our own, we can drop the cast to str().
+                (str(c.version) for c in candidates),
+                prereleases=allow_prereleases,
+            )
+        }
+
+        # Again, converting version to str to deal with debundling.
+        applicable_candidates = [
+            c for c in candidates if str(c.version) in versions
+        ]
+
+        filtered_applicable_candidates = filter_unallowed_hashes(
+            candidates=applicable_candidates,
+            hashes=self._hashes,
+            project_name=self._project_name,
+        )
+
+        return sorted(filtered_applicable_candidates, key=self._sort_key)
+
+    def _sort_key(self, candidate):
+        # type: (InstallationCandidate) -> CandidateSortingKey
+        """
+        Function to pass as the `key` argument to a call to sorted() to sort
+        InstallationCandidates by preference.
+
+        Returns a tuple such that tuples sorting as greater using Python's
+        default comparison operator are more preferred.
+
+        The preference is as follows:
+
+        First and foremost, candidates with allowed (matching) hashes are
+        always preferred over candidates without matching hashes. This is
+        because e.g. if the only candidate with an allowed hash is yanked,
+        we still want to use that candidate.
+
+        Second, excepting hash considerations, candidates that have been
+        yanked (in the sense of PEP 592) are always less preferred than
+        candidates that haven't been yanked. Then:
+
+        If not finding wheels, they are sorted by version only.
+        If finding wheels, then the sort order is by version, then:
+          1. existing installs
+          2. wheels ordered via Wheel.support_index_min(self._supported_tags)
+          3. source archives
+        If prefer_binary was set, then all wheels are sorted above sources.
+
+        Note: it was considered to embed this logic into the Link
+              comparison operators, but then different sdist links
+              with the same version, would have to be considered equal
+        """
+        valid_tags = self._supported_tags
+        support_num = len(valid_tags)
+        build_tag = ()  # type: BuildTag
+        binary_preference = 0
+        link = candidate.link
+        if link.is_wheel:
+            # can raise InvalidWheelFilename
+            wheel = Wheel(link.filename)
+            if not wheel.supported(valid_tags):
+                raise UnsupportedWheel(
+                    "{} is not a supported wheel for this platform. It "
+                    "can't be sorted.".format(wheel.filename)
+                )
+            if self._prefer_binary:
+                binary_preference = 1
+            pri = -(wheel.support_index_min(valid_tags))
+            if wheel.build_tag is not None:
+                match = re.match(r'^(\d+)(.*)$', wheel.build_tag)
+                build_tag_groups = match.groups()
+                build_tag = (int(build_tag_groups[0]), build_tag_groups[1])
+        else:  # sdist
+            pri = -(support_num)
+        has_allowed_hash = int(link.is_hash_allowed(self._hashes))
+        yank_value = -1 * int(link.is_yanked)  # -1 for yanked.
+        return (
+            has_allowed_hash, yank_value, binary_preference, candidate.version,
+            build_tag, pri,
+        )
+
+    def sort_best_candidate(
+        self,
+        candidates,    # type: List[InstallationCandidate]
+    ):
+        # type: (...) -> Optional[InstallationCandidate]
+        """
+        Return the best candidate per the instance's sort order, or None if
+        no candidate is acceptable.
+        """
+        if not candidates:
+            return None
+        best_candidate = max(candidates, key=self._sort_key)
+        return best_candidate
+
+    def compute_best_candidate(
+        self,
+        candidates,      # type: List[InstallationCandidate]
+    ):
+        # type: (...) -> BestCandidateResult
+        """
+        Compute and return a `BestCandidateResult` instance.
+        """
+        applicable_candidates = self.get_applicable_candidates(candidates)
+
+        best_candidate = self.sort_best_candidate(applicable_candidates)
+
+        return BestCandidateResult(
+            candidates,
+            applicable_candidates=applicable_candidates,
+            best_candidate=best_candidate,
+        )
+
+
+class PackageFinder(object):
+    """This finds packages.
+
+    This is meant to match easy_install's technique for looking for
+    packages, by reading pages and looking for appropriate links.
+    """
+
+    def __init__(
+        self,
+        link_collector,       # type: LinkCollector
+        target_python,        # type: TargetPython
+        allow_yanked,         # type: bool
+        format_control=None,  # type: Optional[FormatControl]
+        candidate_prefs=None,         # type: CandidatePreferences
+        ignore_requires_python=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> None
+        """
+        This constructor is primarily meant to be used by the create() class
+        method and from tests.
+
+        :param format_control: A FormatControl object, used to control
+            the selection of source packages / binary packages when consulting
+            the index and links.
+        :param candidate_prefs: Options to use when creating a
+            CandidateEvaluator object.
+        """
+        if candidate_prefs is None:
+            candidate_prefs = CandidatePreferences()
+
+        format_control = format_control or FormatControl(set(), set())
+
+        self._allow_yanked = allow_yanked
+        self._candidate_prefs = candidate_prefs
+        self._ignore_requires_python = ignore_requires_python
+        self._link_collector = link_collector
+        self._target_python = target_python
+
+        self.format_control = format_control
+
+        # These are boring links that have already been logged somehow.
+        self._logged_links = set()  # type: Set[Link]
+
+    # Don't include an allow_yanked default value to make sure each call
+    # site considers whether yanked releases are allowed. This also causes
+    # that decision to be made explicit in the calling code, which helps
+    # people when reading the code.
+    @classmethod
+    def create(
+        cls,
+        link_collector,      # type: LinkCollector
+        selection_prefs,     # type: SelectionPreferences
+        target_python=None,  # type: Optional[TargetPython]
+    ):
+        # type: (...) -> PackageFinder
+        """Create a PackageFinder.
+
+        :param selection_prefs: The candidate selection preferences, as a
+            SelectionPreferences object.
+        :param target_python: The target Python interpreter to use when
+            checking compatibility. If None (the default), a TargetPython
+            object will be constructed from the running Python.
+        """
+        if target_python is None:
+            target_python = TargetPython()
+
+        candidate_prefs = CandidatePreferences(
+            prefer_binary=selection_prefs.prefer_binary,
+            allow_all_prereleases=selection_prefs.allow_all_prereleases,
+        )
+
+        return cls(
+            candidate_prefs=candidate_prefs,
+            link_collector=link_collector,
+            target_python=target_python,
+            allow_yanked=selection_prefs.allow_yanked,
+            format_control=selection_prefs.format_control,
+            ignore_requires_python=selection_prefs.ignore_requires_python,
+        )
+
+    @property
+    def target_python(self):
+        # type: () -> TargetPython
+        return self._target_python
+
+    @property
+    def search_scope(self):
+        # type: () -> SearchScope
+        return self._link_collector.search_scope
+
+    @search_scope.setter
+    def search_scope(self, search_scope):
+        # type: (SearchScope) -> None
+        self._link_collector.search_scope = search_scope
+
+    @property
+    def find_links(self):
+        # type: () -> List[str]
+        return self._link_collector.find_links
+
+    @property
+    def index_urls(self):
+        # type: () -> List[str]
+        return self.search_scope.index_urls
+
+    @property
+    def trusted_hosts(self):
+        # type: () -> Iterable[str]
+        for host_port in self._link_collector.session.pip_trusted_origins:
+            yield build_netloc(*host_port)
+
+    @property
+    def allow_all_prereleases(self):
+        # type: () -> bool
+        return self._candidate_prefs.allow_all_prereleases
+
+    def set_allow_all_prereleases(self):
+        # type: () -> None
+        self._candidate_prefs.allow_all_prereleases = True
+
+    @property
+    def prefer_binary(self):
+        # type: () -> bool
+        return self._candidate_prefs.prefer_binary
+
+    def set_prefer_binary(self):
+        # type: () -> None
+        self._candidate_prefs.prefer_binary = True
+
+    def make_link_evaluator(self, project_name):
+        # type: (str) -> LinkEvaluator
+        canonical_name = canonicalize_name(project_name)
+        formats = self.format_control.get_allowed_formats(canonical_name)
+
+        return LinkEvaluator(
+            project_name=project_name,
+            canonical_name=canonical_name,
+            formats=formats,
+            target_python=self._target_python,
+            allow_yanked=self._allow_yanked,
+            ignore_requires_python=self._ignore_requires_python,
+        )
+
+    def _sort_links(self, links):
+        # type: (Iterable[Link]) -> List[Link]
+        """
+        Returns elements of links in order, non-egg links first, egg links
+        second, while eliminating duplicates
+        """
+        eggs, no_eggs = [], []
+        seen = set()  # type: Set[Link]
+        for link in links:
+            if link not in seen:
+                seen.add(link)
+                if link.egg_fragment:
+                    eggs.append(link)
+                else:
+                    no_eggs.append(link)
+        return no_eggs + eggs
+
+    def _log_skipped_link(self, link, reason):
+        # type: (Link, Text) -> None
+        if link not in self._logged_links:
+            # Mark this as a unicode string to prevent "UnicodeEncodeError:
+            # 'ascii' codec can't encode character" in Python 2 when
+            # the reason contains non-ascii characters.
+            #   Also, put the link at the end so the reason is more visible
+            # and because the link string is usually very long.
+            logger.debug(u'Skipping link: %s: %s', reason, link)
+            self._logged_links.add(link)
+
+    def get_install_candidate(self, link_evaluator, link):
+        # type: (LinkEvaluator, Link) -> Optional[InstallationCandidate]
+        """
+        If the link is a candidate for install, convert it to an
+        InstallationCandidate and return it. Otherwise, return None.
+        """
+        is_candidate, result = link_evaluator.evaluate_link(link)
+        if not is_candidate:
+            if result:
+                self._log_skipped_link(link, reason=result)
+            return None
+
+        return InstallationCandidate(
+            name=link_evaluator.project_name,
+            link=link,
+            # Convert the Text result to str since InstallationCandidate
+            # accepts str.
+            version=str(result),
+        )
+
+    def evaluate_links(self, link_evaluator, links):
+        # type: (LinkEvaluator, Iterable[Link]) -> List[InstallationCandidate]
+        """
+        Convert links that are candidates to InstallationCandidate objects.
+        """
+        candidates = []
+        for link in self._sort_links(links):
+            candidate = self.get_install_candidate(link_evaluator, link)
+            if candidate is not None:
+                candidates.append(candidate)
+
+        return candidates
+
+    def process_project_url(self, project_url, link_evaluator):
+        # type: (Link, LinkEvaluator) -> List[InstallationCandidate]
+        logger.debug(
+            'Fetching project page and analyzing links: %s', project_url,
+        )
+        html_page = self._link_collector.fetch_page(project_url)
+        if html_page is None:
+            return []
+
+        page_links = list(parse_links(html_page))
+
+        with indent_log():
+            package_links = self.evaluate_links(
+                link_evaluator,
+                links=page_links,
+            )
+
+        return package_links
+
+    def find_all_candidates(self, project_name):
+        # type: (str) -> List[InstallationCandidate]
+        """Find all available InstallationCandidate for project_name
+
+        This checks index_urls and find_links.
+        All versions found are returned as an InstallationCandidate list.
+
+        See LinkEvaluator.evaluate_link() for details on which files
+        are accepted.
+        """
+        collected_links = self._link_collector.collect_links(project_name)
+
+        link_evaluator = self.make_link_evaluator(project_name)
+
+        find_links_versions = self.evaluate_links(
+            link_evaluator,
+            links=collected_links.find_links,
+        )
+
+        page_versions = []
+        for project_url in collected_links.project_urls:
+            package_links = self.process_project_url(
+                project_url, link_evaluator=link_evaluator,
+            )
+            page_versions.extend(package_links)
+
+        file_versions = self.evaluate_links(
+            link_evaluator,
+            links=collected_links.files,
+        )
+        if file_versions:
+            file_versions.sort(reverse=True)
+            logger.debug(
+                'Local files found: %s',
+                ', '.join([
+                    url_to_path(candidate.link.url)
+                    for candidate in file_versions
+                ])
+            )
+
+        # This is an intentional priority ordering
+        return file_versions + find_links_versions + page_versions
+
+    def make_candidate_evaluator(
+        self,
+        project_name,    # type: str
+        specifier=None,  # type: Optional[specifiers.BaseSpecifier]
+        hashes=None,     # type: Optional[Hashes]
+    ):
+        # type: (...) -> CandidateEvaluator
+        """Create a CandidateEvaluator object to use.
+        """
+        candidate_prefs = self._candidate_prefs
+        return CandidateEvaluator.create(
+            project_name=project_name,
+            target_python=self._target_python,
+            prefer_binary=candidate_prefs.prefer_binary,
+            allow_all_prereleases=candidate_prefs.allow_all_prereleases,
+            specifier=specifier,
+            hashes=hashes,
+        )
+
+    def find_best_candidate(
+        self,
+        project_name,       # type: str
+        specifier=None,     # type: Optional[specifiers.BaseSpecifier]
+        hashes=None,        # type: Optional[Hashes]
+    ):
+        # type: (...) -> BestCandidateResult
+        """Find matches for the given project and specifier.
+
+        :param specifier: An optional object implementing `filter`
+            (e.g. `packaging.specifiers.SpecifierSet`) to filter applicable
+            versions.
+
+        :return: A `BestCandidateResult` instance.
+        """
+        candidates = self.find_all_candidates(project_name)
+        candidate_evaluator = self.make_candidate_evaluator(
+            project_name=project_name,
+            specifier=specifier,
+            hashes=hashes,
+        )
+        return candidate_evaluator.compute_best_candidate(candidates)
+
+    def find_requirement(self, req, upgrade):
+        # type: (InstallRequirement, bool) -> Optional[InstallationCandidate]
+        """Try to find a Link matching req
+
+        Expects req, an InstallRequirement and upgrade, a boolean
+        Returns a InstallationCandidate if found,
+        Raises DistributionNotFound or BestVersionAlreadyInstalled otherwise
+        """
+        hashes = req.hashes(trust_internet=False)
+        best_candidate_result = self.find_best_candidate(
+            req.name, specifier=req.specifier, hashes=hashes,
+        )
+        best_candidate = best_candidate_result.best_candidate
+
+        installed_version = None    # type: Optional[_BaseVersion]
+        if req.satisfied_by is not None:
+            installed_version = parse_version(req.satisfied_by.version)
+
+        def _format_versions(cand_iter):
+            # type: (Iterable[InstallationCandidate]) -> str
+            # This repeated parse_version and str() conversion is needed to
+            # handle different vendoring sources from pip and pkg_resources.
+            # If we stop using the pkg_resources provided specifier and start
+            # using our own, we can drop the cast to str().
+            return ", ".join(sorted(
+                {str(c.version) for c in cand_iter},
+                key=parse_version,
+            )) or "none"
+
+        if installed_version is None and best_candidate is None:
+            logger.critical(
+                'Could not find a version that satisfies the requirement %s '
+                '(from versions: %s)',
+                req,
+                _format_versions(best_candidate_result.iter_all()),
+            )
+
+            raise DistributionNotFound(
+                'No matching distribution found for {}'.format(
+                    req)
+            )
+
+        best_installed = False
+        if installed_version and (
+                best_candidate is None or
+                best_candidate.version <= installed_version):
+            best_installed = True
+
+        if not upgrade and installed_version is not None:
+            if best_installed:
+                logger.debug(
+                    'Existing installed version (%s) is most up-to-date and '
+                    'satisfies requirement',
+                    installed_version,
+                )
+            else:
+                logger.debug(
+                    'Existing installed version (%s) satisfies requirement '
+                    '(most up-to-date version is %s)',
+                    installed_version,
+                    best_candidate.version,
+                )
+            return None
+
+        if best_installed:
+            # We have an existing version, and its the best version
+            logger.debug(
+                'Installed version (%s) is most up-to-date (past versions: '
+                '%s)',
+                installed_version,
+                _format_versions(best_candidate_result.iter_applicable()),
+            )
+            raise BestVersionAlreadyInstalled
+
+        logger.debug(
+            'Using version %s (newest of versions: %s)',
+            best_candidate.version,
+            _format_versions(best_candidate_result.iter_applicable()),
+        )
+        return best_candidate
+
+
+def _find_name_version_sep(fragment, canonical_name):
+    # type: (str, str) -> int
+    """Find the separator's index based on the package's canonical name.
+
+    :param fragment: A <package>+<version> filename "fragment" (stem) or
+        egg fragment.
+    :param canonical_name: The package's canonical name.
+
+    This function is needed since the canonicalized name does not necessarily
+    have the same length as the egg info's name part. An example::
+
+    >>> fragment = 'foo__bar-1.0'
+    >>> canonical_name = 'foo-bar'
+    >>> _find_name_version_sep(fragment, canonical_name)
+    8
+    """
+    # Project name and version must be separated by one single dash. Find all
+    # occurrences of dashes; if the string in front of it matches the canonical
+    # name, this is the one separating the name and version parts.
+    for i, c in enumerate(fragment):
+        if c != "-":
+            continue
+        if canonicalize_name(fragment[:i]) == canonical_name:
+            return i
+    raise ValueError("{} does not match {}".format(fragment, canonical_name))
+
+
+def _extract_version_from_fragment(fragment, canonical_name):
+    # type: (str, str) -> Optional[str]
+    """Parse the version string from a <package>+<version> filename
+    "fragment" (stem) or egg fragment.
+
+    :param fragment: The string to parse. E.g. foo-2.1
+    :param canonical_name: The canonicalized name of the package this
+        belongs to.
+    """
+    try:
+        version_start = _find_name_version_sep(fragment, canonical_name) + 1
+    except ValueError:
+        return None
+    version = fragment[version_start:]
+    if not version:
+        return None
+    return version
diff --git a/venv/Lib/site-packages/pip/_internal/locations.py b/venv/Lib/site-packages/pip/_internal/locations.py
new file mode 100644
index 000000000..0c1235488
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/locations.py
@@ -0,0 +1,194 @@
+"""Locations where we look for configs, install stuff, etc"""
+
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+from __future__ import absolute_import
+
+import os
+import os.path
+import platform
+import site
+import sys
+import sysconfig
+from distutils import sysconfig as distutils_sysconfig
+from distutils.command.install import SCHEME_KEYS  # type: ignore
+from distutils.command.install import install as distutils_install_command
+
+from pip._internal.models.scheme import Scheme
+from pip._internal.utils import appdirs
+from pip._internal.utils.compat import WINDOWS
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING, cast
+from pip._internal.utils.virtualenv import running_under_virtualenv
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, List, Optional, Union
+
+    from distutils.cmd import Command as DistutilsCommand
+
+
+# Application Directories
+USER_CACHE_DIR = appdirs.user_cache_dir("pip")
+
+
+def get_major_minor_version():
+    # type: () -> str
+    """
+    Return the major-minor version of the current Python as a string, e.g.
+    "3.7" or "3.10".
+    """
+    return '{}.{}'.format(*sys.version_info)
+
+
+def get_src_prefix():
+    # type: () -> str
+    if running_under_virtualenv():
+        src_prefix = os.path.join(sys.prefix, 'src')
+    else:
+        # FIXME: keep src in cwd for now (it is not a temporary folder)
+        try:
+            src_prefix = os.path.join(os.getcwd(), 'src')
+        except OSError:
+            # In case the current working directory has been renamed or deleted
+            sys.exit(
+                "The folder you are executing pip from can no longer be found."
+            )
+
+    # under macOS + virtualenv sys.prefix is not properly resolved
+    # it is something like /path/to/python/bin/..
+    return os.path.abspath(src_prefix)
+
+
+# FIXME doesn't account for venv linked to global site-packages
+
+site_packages = sysconfig.get_path("purelib")  # type: Optional[str]
+
+# This is because of a bug in PyPy's sysconfig module, see
+# https://bitbucket.org/pypy/pypy/issues/2506/sysconfig-returns-incorrect-paths
+# for more information.
+if platform.python_implementation().lower() == "pypy":
+    site_packages = distutils_sysconfig.get_python_lib()
+try:
+    # Use getusersitepackages if this is present, as it ensures that the
+    # value is initialised properly.
+    user_site = site.getusersitepackages()
+except AttributeError:
+    user_site = site.USER_SITE
+
+if WINDOWS:
+    bin_py = os.path.join(sys.prefix, 'Scripts')
+    bin_user = os.path.join(user_site, 'Scripts')
+    # buildout uses 'bin' on Windows too?
+    if not os.path.exists(bin_py):
+        bin_py = os.path.join(sys.prefix, 'bin')
+        bin_user = os.path.join(user_site, 'bin')
+else:
+    bin_py = os.path.join(sys.prefix, 'bin')
+    bin_user = os.path.join(user_site, 'bin')
+
+    # Forcing to use /usr/local/bin for standard macOS framework installs
+    # Also log to ~/Library/Logs/ for use with the Console.app log viewer
+    if sys.platform[:6] == 'darwin' and sys.prefix[:16] == '/System/Library/':
+        bin_py = '/usr/local/bin'
+
+
+def distutils_scheme(
+    dist_name, user=False, home=None, root=None, isolated=False, prefix=None
+):
+    # type:(str, bool, str, str, bool, str) -> Dict[str, str]
+    """
+    Return a distutils install scheme
+    """
+    from distutils.dist import Distribution
+
+    dist_args = {'name': dist_name}  # type: Dict[str, Union[str, List[str]]]
+    if isolated:
+        dist_args["script_args"] = ["--no-user-cfg"]
+
+    d = Distribution(dist_args)
+    d.parse_config_files()
+    obj = None  # type: Optional[DistutilsCommand]
+    obj = d.get_command_obj('install', create=True)
+    assert obj is not None
+    i = cast(distutils_install_command, obj)
+    # NOTE: setting user or home has the side-effect of creating the home dir
+    # or user base for installations during finalize_options()
+    # ideally, we'd prefer a scheme class that has no side-effects.
+    assert not (user and prefix), "user={} prefix={}".format(user, prefix)
+    assert not (home and prefix), "home={} prefix={}".format(home, prefix)
+    i.user = user or i.user
+    if user or home:
+        i.prefix = ""
+    i.prefix = prefix or i.prefix
+    i.home = home or i.home
+    i.root = root or i.root
+    i.finalize_options()
+
+    scheme = {}
+    for key in SCHEME_KEYS:
+        scheme[key] = getattr(i, 'install_' + key)
+
+    # install_lib specified in setup.cfg should install *everything*
+    # into there (i.e. it takes precedence over both purelib and
+    # platlib).  Note, i.install_lib is *always* set after
+    # finalize_options(); we only want to override here if the user
+    # has explicitly requested it hence going back to the config
+    if 'install_lib' in d.get_option_dict('install'):
+        scheme.update(dict(purelib=i.install_lib, platlib=i.install_lib))
+
+    if running_under_virtualenv():
+        scheme['headers'] = os.path.join(
+            i.prefix,
+            'include',
+            'site',
+            'python{}'.format(get_major_minor_version()),
+            dist_name,
+        )
+
+        if root is not None:
+            path_no_drive = os.path.splitdrive(
+                os.path.abspath(scheme["headers"]))[1]
+            scheme["headers"] = os.path.join(
+                root,
+                path_no_drive[1:],
+            )
+
+    return scheme
+
+
+def get_scheme(
+    dist_name,  # type: str
+    user=False,  # type: bool
+    home=None,  # type: Optional[str]
+    root=None,  # type: Optional[str]
+    isolated=False,  # type: bool
+    prefix=None,  # type: Optional[str]
+):
+    # type: (...) -> Scheme
+    """
+    Get the "scheme" corresponding to the input parameters. The distutils
+    documentation provides the context for the available schemes:
+    https://docs.python.org/3/install/index.html#alternate-installation
+
+    :param dist_name: the name of the package to retrieve the scheme for, used
+        in the headers scheme path
+    :param user: indicates to use the "user" scheme
+    :param home: indicates to use the "home" scheme and provides the base
+        directory for the same
+    :param root: root under which other directories are re-based
+    :param isolated: equivalent to --no-user-cfg, i.e. do not consider
+        ~/.pydistutils.cfg (posix) or ~/pydistutils.cfg (non-posix) for
+        scheme paths
+    :param prefix: indicates to use the "prefix" scheme and provides the
+        base directory for the same
+    """
+    scheme = distutils_scheme(
+        dist_name, user, home, root, isolated, prefix
+    )
+    return Scheme(
+        platlib=scheme["platlib"],
+        purelib=scheme["purelib"],
+        headers=scheme["headers"],
+        scripts=scheme["scripts"],
+        data=scheme["data"],
+    )
diff --git a/venv/Lib/site-packages/pip/_internal/main.py b/venv/Lib/site-packages/pip/_internal/main.py
new file mode 100644
index 000000000..3208d5b88
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/main.py
@@ -0,0 +1,16 @@
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, List
+
+
+def main(args=None):
+    # type: (Optional[List[str]]) -> int
+    """This is preserved for old console scripts that may still be referencing
+    it.
+
+    For additional details, see https://github.com/pypa/pip/issues/7498.
+    """
+    from pip._internal.utils.entrypoints import _wrapper
+
+    return _wrapper(args)
diff --git a/venv/Lib/site-packages/pip/_internal/models/__init__.py b/venv/Lib/site-packages/pip/_internal/models/__init__.py
new file mode 100644
index 000000000..7855226e4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/__init__.py
@@ -0,0 +1,2 @@
+"""A package that contains models that represent entities.
+"""
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..e8fc3e15d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/candidate.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/candidate.cpython-36.pyc
new file mode 100644
index 000000000..c6f7dc274
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/candidate.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/direct_url.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/direct_url.cpython-36.pyc
new file mode 100644
index 000000000..9a16a691c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/direct_url.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/format_control.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/format_control.cpython-36.pyc
new file mode 100644
index 000000000..8c4d92713
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/format_control.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/index.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/index.cpython-36.pyc
new file mode 100644
index 000000000..b358720e5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/index.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/link.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/link.cpython-36.pyc
new file mode 100644
index 000000000..39d3e3f79
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/link.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/scheme.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/scheme.cpython-36.pyc
new file mode 100644
index 000000000..796ee3802
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/scheme.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/search_scope.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/search_scope.cpython-36.pyc
new file mode 100644
index 000000000..29392a055
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/search_scope.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/selection_prefs.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/selection_prefs.cpython-36.pyc
new file mode 100644
index 000000000..3d9eda2ad
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/selection_prefs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/target_python.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/target_python.cpython-36.pyc
new file mode 100644
index 000000000..d1671870c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/target_python.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/models/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..a770916f3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/models/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/models/candidate.py b/venv/Lib/site-packages/pip/_internal/models/candidate.py
new file mode 100644
index 000000000..9149e0fc6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/candidate.py
@@ -0,0 +1,38 @@
+from pip._vendor.packaging.version import parse as parse_version
+
+from pip._internal.utils.models import KeyBasedCompareMixin
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from pip._vendor.packaging.version import _BaseVersion
+    from pip._internal.models.link import Link
+
+
+class InstallationCandidate(KeyBasedCompareMixin):
+    """Represents a potential "candidate" for installation.
+    """
+
+    __slots__ = ["name", "version", "link"]
+
+    def __init__(self, name, version, link):
+        # type: (str, str, Link) -> None
+        self.name = name
+        self.version = parse_version(version)  # type: _BaseVersion
+        self.link = link
+
+        super(InstallationCandidate, self).__init__(
+            key=(self.name, self.version, self.link),
+            defining_class=InstallationCandidate
+        )
+
+    def __repr__(self):
+        # type: () -> str
+        return "<InstallationCandidate({!r}, {!r}, {!r})>".format(
+            self.name, self.version, self.link,
+        )
+
+    def __str__(self):
+        # type: () -> str
+        return '{!r} candidate (version {} at {})'.format(
+            self.name, self.version, self.link,
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/models/direct_url.py b/venv/Lib/site-packages/pip/_internal/models/direct_url.py
new file mode 100644
index 000000000..87bd9fe4b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/direct_url.py
@@ -0,0 +1,245 @@
+""" PEP 610 """
+import json
+import re
+
+from pip._vendor import six
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Dict, Iterable, Optional, Type, TypeVar, Union
+    )
+
+    T = TypeVar("T")
+
+
+DIRECT_URL_METADATA_NAME = "direct_url.json"
+ENV_VAR_RE = re.compile(r"^\$\{[A-Za-z0-9-_]+\}(:\$\{[A-Za-z0-9-_]+\})?$")
+
+__all__ = [
+    "DirectUrl",
+    "DirectUrlValidationError",
+    "DirInfo",
+    "ArchiveInfo",
+    "VcsInfo",
+]
+
+
+class DirectUrlValidationError(Exception):
+    pass
+
+
+def _get(d, expected_type, key, default=None):
+    # type: (Dict[str, Any], Type[T], str, Optional[T]) -> Optional[T]
+    """Get value from dictionary and verify expected type."""
+    if key not in d:
+        return default
+    value = d[key]
+    if six.PY2 and expected_type is str:
+        expected_type = six.string_types  # type: ignore
+    if not isinstance(value, expected_type):
+        raise DirectUrlValidationError(
+            "{!r} has unexpected type for {} (expected {})".format(
+                value, key, expected_type
+            )
+        )
+    return value
+
+
+def _get_required(d, expected_type, key, default=None):
+    # type: (Dict[str, Any], Type[T], str, Optional[T]) -> T
+    value = _get(d, expected_type, key, default)
+    if value is None:
+        raise DirectUrlValidationError("{} must have a value".format(key))
+    return value
+
+
+def _exactly_one_of(infos):
+    # type: (Iterable[Optional[InfoType]]) -> InfoType
+    infos = [info for info in infos if info is not None]
+    if not infos:
+        raise DirectUrlValidationError(
+            "missing one of archive_info, dir_info, vcs_info"
+        )
+    if len(infos) > 1:
+        raise DirectUrlValidationError(
+            "more than one of archive_info, dir_info, vcs_info"
+        )
+    assert infos[0] is not None
+    return infos[0]
+
+
+def _filter_none(**kwargs):
+    # type: (Any) -> Dict[str, Any]
+    """Make dict excluding None values."""
+    return {k: v for k, v in kwargs.items() if v is not None}
+
+
+class VcsInfo(object):
+    name = "vcs_info"
+
+    def __init__(
+        self,
+        vcs,  # type: str
+        commit_id,  # type: str
+        requested_revision=None,  # type: Optional[str]
+        resolved_revision=None,  # type: Optional[str]
+        resolved_revision_type=None,  # type: Optional[str]
+    ):
+        self.vcs = vcs
+        self.requested_revision = requested_revision
+        self.commit_id = commit_id
+        self.resolved_revision = resolved_revision
+        self.resolved_revision_type = resolved_revision_type
+
+    @classmethod
+    def _from_dict(cls, d):
+        # type: (Optional[Dict[str, Any]]) -> Optional[VcsInfo]
+        if d is None:
+            return None
+        return cls(
+            vcs=_get_required(d, str, "vcs"),
+            commit_id=_get_required(d, str, "commit_id"),
+            requested_revision=_get(d, str, "requested_revision"),
+            resolved_revision=_get(d, str, "resolved_revision"),
+            resolved_revision_type=_get(d, str, "resolved_revision_type"),
+        )
+
+    def _to_dict(self):
+        # type: () -> Dict[str, Any]
+        return _filter_none(
+            vcs=self.vcs,
+            requested_revision=self.requested_revision,
+            commit_id=self.commit_id,
+            resolved_revision=self.resolved_revision,
+            resolved_revision_type=self.resolved_revision_type,
+        )
+
+
+class ArchiveInfo(object):
+    name = "archive_info"
+
+    def __init__(
+        self,
+        hash=None,  # type: Optional[str]
+    ):
+        self.hash = hash
+
+    @classmethod
+    def _from_dict(cls, d):
+        # type: (Optional[Dict[str, Any]]) -> Optional[ArchiveInfo]
+        if d is None:
+            return None
+        return cls(hash=_get(d, str, "hash"))
+
+    def _to_dict(self):
+        # type: () -> Dict[str, Any]
+        return _filter_none(hash=self.hash)
+
+
+class DirInfo(object):
+    name = "dir_info"
+
+    def __init__(
+        self,
+        editable=False,  # type: bool
+    ):
+        self.editable = editable
+
+    @classmethod
+    def _from_dict(cls, d):
+        # type: (Optional[Dict[str, Any]]) -> Optional[DirInfo]
+        if d is None:
+            return None
+        return cls(
+            editable=_get_required(d, bool, "editable", default=False)
+        )
+
+    def _to_dict(self):
+        # type: () -> Dict[str, Any]
+        return _filter_none(editable=self.editable or None)
+
+
+if MYPY_CHECK_RUNNING:
+    InfoType = Union[ArchiveInfo, DirInfo, VcsInfo]
+
+
+class DirectUrl(object):
+
+    def __init__(
+        self,
+        url,  # type: str
+        info,  # type: InfoType
+        subdirectory=None,  # type: Optional[str]
+    ):
+        self.url = url
+        self.info = info
+        self.subdirectory = subdirectory
+
+    def _remove_auth_from_netloc(self, netloc):
+        # type: (str) -> str
+        if "@" not in netloc:
+            return netloc
+        user_pass, netloc_no_user_pass = netloc.split("@", 1)
+        if (
+            isinstance(self.info, VcsInfo) and
+            self.info.vcs == "git" and
+            user_pass == "git"
+        ):
+            return netloc
+        if ENV_VAR_RE.match(user_pass):
+            return netloc
+        return netloc_no_user_pass
+
+    @property
+    def redacted_url(self):
+        # type: () -> str
+        """url with user:password part removed unless it is formed with
+        environment variables as specified in PEP 610, or it is ``git``
+        in the case of a git URL.
+        """
+        purl = urllib_parse.urlsplit(self.url)
+        netloc = self._remove_auth_from_netloc(purl.netloc)
+        surl = urllib_parse.urlunsplit(
+            (purl.scheme, netloc, purl.path, purl.query, purl.fragment)
+        )
+        return surl
+
+    def validate(self):
+        # type: () -> None
+        self.from_dict(self.to_dict())
+
+    @classmethod
+    def from_dict(cls, d):
+        # type: (Dict[str, Any]) -> DirectUrl
+        return DirectUrl(
+            url=_get_required(d, str, "url"),
+            subdirectory=_get(d, str, "subdirectory"),
+            info=_exactly_one_of(
+                [
+                    ArchiveInfo._from_dict(_get(d, dict, "archive_info")),
+                    DirInfo._from_dict(_get(d, dict, "dir_info")),
+                    VcsInfo._from_dict(_get(d, dict, "vcs_info")),
+                ]
+            ),
+        )
+
+    def to_dict(self):
+        # type: () -> Dict[str, Any]
+        res = _filter_none(
+            url=self.redacted_url,
+            subdirectory=self.subdirectory,
+        )
+        res[self.info.name] = self.info._to_dict()
+        return res
+
+    @classmethod
+    def from_json(cls, s):
+        # type: (str) -> DirectUrl
+        return cls.from_dict(json.loads(s))
+
+    def to_json(self):
+        # type: () -> str
+        return json.dumps(self.to_dict(), sort_keys=True)
diff --git a/venv/Lib/site-packages/pip/_internal/models/format_control.py b/venv/Lib/site-packages/pip/_internal/models/format_control.py
new file mode 100644
index 000000000..c6275e721
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/format_control.py
@@ -0,0 +1,92 @@
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.exceptions import CommandError
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Set, FrozenSet
+
+
+class FormatControl(object):
+    """Helper for managing formats from which a package can be installed.
+    """
+
+    __slots__ = ["no_binary", "only_binary"]
+
+    def __init__(self, no_binary=None, only_binary=None):
+        # type: (Optional[Set[str]], Optional[Set[str]]) -> None
+        if no_binary is None:
+            no_binary = set()
+        if only_binary is None:
+            only_binary = set()
+
+        self.no_binary = no_binary
+        self.only_binary = only_binary
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if not isinstance(other, self.__class__):
+            return NotImplemented
+
+        if self.__slots__ != other.__slots__:
+            return False
+
+        return all(
+            getattr(self, k) == getattr(other, k)
+            for k in self.__slots__
+        )
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not self.__eq__(other)
+
+    def __repr__(self):
+        # type: () -> str
+        return "{}({}, {})".format(
+            self.__class__.__name__,
+            self.no_binary,
+            self.only_binary
+        )
+
+    @staticmethod
+    def handle_mutual_excludes(value, target, other):
+        # type: (str, Set[str], Set[str]) -> None
+        if value.startswith('-'):
+            raise CommandError(
+                "--no-binary / --only-binary option requires 1 argument."
+            )
+        new = value.split(',')
+        while ':all:' in new:
+            other.clear()
+            target.clear()
+            target.add(':all:')
+            del new[:new.index(':all:') + 1]
+            # Without a none, we want to discard everything as :all: covers it
+            if ':none:' not in new:
+                return
+        for name in new:
+            if name == ':none:':
+                target.clear()
+                continue
+            name = canonicalize_name(name)
+            other.discard(name)
+            target.add(name)
+
+    def get_allowed_formats(self, canonical_name):
+        # type: (str) -> FrozenSet[str]
+        result = {"binary", "source"}
+        if canonical_name in self.only_binary:
+            result.discard('source')
+        elif canonical_name in self.no_binary:
+            result.discard('binary')
+        elif ':all:' in self.only_binary:
+            result.discard('source')
+        elif ':all:' in self.no_binary:
+            result.discard('binary')
+        return frozenset(result)
+
+    def disallow_binaries(self):
+        # type: () -> None
+        self.handle_mutual_excludes(
+            ':all:', self.no_binary, self.only_binary,
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/models/index.py b/venv/Lib/site-packages/pip/_internal/models/index.py
new file mode 100644
index 000000000..5b4a1fe22
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/index.py
@@ -0,0 +1,34 @@
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+
+class PackageIndex(object):
+    """Represents a Package Index and provides easier access to endpoints
+    """
+
+    __slots__ = ['url', 'netloc', 'simple_url', 'pypi_url',
+                 'file_storage_domain']
+
+    def __init__(self, url, file_storage_domain):
+        # type: (str, str) -> None
+        super(PackageIndex, self).__init__()
+        self.url = url
+        self.netloc = urllib_parse.urlsplit(url).netloc
+        self.simple_url = self._url_for_path('simple')
+        self.pypi_url = self._url_for_path('pypi')
+
+        # This is part of a temporary hack used to block installs of PyPI
+        # packages which depend on external urls only necessary until PyPI can
+        # block such packages themselves
+        self.file_storage_domain = file_storage_domain
+
+    def _url_for_path(self, path):
+        # type: (str) -> str
+        return urllib_parse.urljoin(self.url, path)
+
+
+PyPI = PackageIndex(
+    'https://pypi.org/', file_storage_domain='files.pythonhosted.org'
+)
+TestPyPI = PackageIndex(
+    'https://test.pypi.org/', file_storage_domain='test-files.pythonhosted.org'
+)
diff --git a/venv/Lib/site-packages/pip/_internal/models/link.py b/venv/Lib/site-packages/pip/_internal/models/link.py
new file mode 100644
index 000000000..c0d278ade
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/link.py
@@ -0,0 +1,245 @@
+import os
+import posixpath
+import re
+
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.utils.filetypes import WHEEL_EXTENSION
+from pip._internal.utils.misc import (
+    redact_auth_from_url,
+    split_auth_from_netloc,
+    splitext,
+)
+from pip._internal.utils.models import KeyBasedCompareMixin
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url, url_to_path
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Text, Tuple, Union
+    from pip._internal.index.collector import HTMLPage
+    from pip._internal.utils.hashes import Hashes
+
+
+class Link(KeyBasedCompareMixin):
+    """Represents a parsed link from a Package Index's simple URL
+    """
+
+    __slots__ = [
+        "_parsed_url",
+        "_url",
+        "comes_from",
+        "requires_python",
+        "yanked_reason",
+        "cache_link_parsing",
+    ]
+
+    def __init__(
+        self,
+        url,                   # type: str
+        comes_from=None,       # type: Optional[Union[str, HTMLPage]]
+        requires_python=None,  # type: Optional[str]
+        yanked_reason=None,    # type: Optional[Text]
+        cache_link_parsing=True,  # type: bool
+    ):
+        # type: (...) -> None
+        """
+        :param url: url of the resource pointed to (href of the link)
+        :param comes_from: instance of HTMLPage where the link was found,
+            or string.
+        :param requires_python: String containing the `Requires-Python`
+            metadata field, specified in PEP 345. This may be specified by
+            a data-requires-python attribute in the HTML link tag, as
+            described in PEP 503.
+        :param yanked_reason: the reason the file has been yanked, if the
+            file has been yanked, or None if the file hasn't been yanked.
+            This is the value of the "data-yanked" attribute, if present, in
+            a simple repository HTML link. If the file has been yanked but
+            no reason was provided, this should be the empty string. See
+            PEP 592 for more information and the specification.
+        :param cache_link_parsing: A flag that is used elsewhere to determine
+                                   whether resources retrieved from this link
+                                   should be cached. PyPI index urls should
+                                   generally have this set to False, for
+                                   example.
+        """
+
+        # url can be a UNC windows share
+        if url.startswith('\\\\'):
+            url = path_to_url(url)
+
+        self._parsed_url = urllib_parse.urlsplit(url)
+        # Store the url as a private attribute to prevent accidentally
+        # trying to set a new value.
+        self._url = url
+
+        self.comes_from = comes_from
+        self.requires_python = requires_python if requires_python else None
+        self.yanked_reason = yanked_reason
+
+        super(Link, self).__init__(key=url, defining_class=Link)
+
+        self.cache_link_parsing = cache_link_parsing
+
+    def __str__(self):
+        # type: () -> str
+        if self.requires_python:
+            rp = ' (requires-python:{})'.format(self.requires_python)
+        else:
+            rp = ''
+        if self.comes_from:
+            return '{} (from {}){}'.format(
+                redact_auth_from_url(self._url), self.comes_from, rp)
+        else:
+            return redact_auth_from_url(str(self._url))
+
+    def __repr__(self):
+        # type: () -> str
+        return '<Link {}>'.format(self)
+
+    @property
+    def url(self):
+        # type: () -> str
+        return self._url
+
+    @property
+    def filename(self):
+        # type: () -> str
+        path = self.path.rstrip('/')
+        name = posixpath.basename(path)
+        if not name:
+            # Make sure we don't leak auth information if the netloc
+            # includes a username and password.
+            netloc, user_pass = split_auth_from_netloc(self.netloc)
+            return netloc
+
+        name = urllib_parse.unquote(name)
+        assert name, (
+            'URL {self._url!r} produced no filename'.format(**locals()))
+        return name
+
+    @property
+    def file_path(self):
+        # type: () -> str
+        return url_to_path(self.url)
+
+    @property
+    def scheme(self):
+        # type: () -> str
+        return self._parsed_url.scheme
+
+    @property
+    def netloc(self):
+        # type: () -> str
+        """
+        This can contain auth information.
+        """
+        return self._parsed_url.netloc
+
+    @property
+    def path(self):
+        # type: () -> str
+        return urllib_parse.unquote(self._parsed_url.path)
+
+    def splitext(self):
+        # type: () -> Tuple[str, str]
+        return splitext(posixpath.basename(self.path.rstrip('/')))
+
+    @property
+    def ext(self):
+        # type: () -> str
+        return self.splitext()[1]
+
+    @property
+    def url_without_fragment(self):
+        # type: () -> str
+        scheme, netloc, path, query, fragment = self._parsed_url
+        return urllib_parse.urlunsplit((scheme, netloc, path, query, None))
+
+    _egg_fragment_re = re.compile(r'[#&]egg=([^&]*)')
+
+    @property
+    def egg_fragment(self):
+        # type: () -> Optional[str]
+        match = self._egg_fragment_re.search(self._url)
+        if not match:
+            return None
+        return match.group(1)
+
+    _subdirectory_fragment_re = re.compile(r'[#&]subdirectory=([^&]*)')
+
+    @property
+    def subdirectory_fragment(self):
+        # type: () -> Optional[str]
+        match = self._subdirectory_fragment_re.search(self._url)
+        if not match:
+            return None
+        return match.group(1)
+
+    _hash_re = re.compile(
+        r'(sha1|sha224|sha384|sha256|sha512|md5)=([a-f0-9]+)'
+    )
+
+    @property
+    def hash(self):
+        # type: () -> Optional[str]
+        match = self._hash_re.search(self._url)
+        if match:
+            return match.group(2)
+        return None
+
+    @property
+    def hash_name(self):
+        # type: () -> Optional[str]
+        match = self._hash_re.search(self._url)
+        if match:
+            return match.group(1)
+        return None
+
+    @property
+    def show_url(self):
+        # type: () -> str
+        return posixpath.basename(self._url.split('#', 1)[0].split('?', 1)[0])
+
+    @property
+    def is_file(self):
+        # type: () -> bool
+        return self.scheme == 'file'
+
+    def is_existing_dir(self):
+        # type: () -> bool
+        return self.is_file and os.path.isdir(self.file_path)
+
+    @property
+    def is_wheel(self):
+        # type: () -> bool
+        return self.ext == WHEEL_EXTENSION
+
+    @property
+    def is_vcs(self):
+        # type: () -> bool
+        from pip._internal.vcs import vcs
+
+        return self.scheme in vcs.all_schemes
+
+    @property
+    def is_yanked(self):
+        # type: () -> bool
+        return self.yanked_reason is not None
+
+    @property
+    def has_hash(self):
+        # type: () -> bool
+        return self.hash_name is not None
+
+    def is_hash_allowed(self, hashes):
+        # type: (Optional[Hashes]) -> bool
+        """
+        Return True if the link has a hash and it is allowed.
+        """
+        if hashes is None or not self.has_hash:
+            return False
+        # Assert non-None so mypy knows self.hash_name and self.hash are str.
+        assert self.hash_name is not None
+        assert self.hash is not None
+
+        return hashes.is_hash_allowed(self.hash_name, hex_digest=self.hash)
diff --git a/venv/Lib/site-packages/pip/_internal/models/scheme.py b/venv/Lib/site-packages/pip/_internal/models/scheme.py
new file mode 100644
index 000000000..5040551eb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/scheme.py
@@ -0,0 +1,31 @@
+"""
+For types associated with installation schemes.
+
+For a general overview of available schemes and their context, see
+https://docs.python.org/3/install/index.html#alternate-installation.
+"""
+
+
+SCHEME_KEYS = ['platlib', 'purelib', 'headers', 'scripts', 'data']
+
+
+class Scheme(object):
+    """A Scheme holds paths which are used as the base directories for
+    artifacts associated with a Python package.
+    """
+
+    __slots__ = SCHEME_KEYS
+
+    def __init__(
+        self,
+        platlib,  # type: str
+        purelib,  # type: str
+        headers,  # type: str
+        scripts,  # type: str
+        data,  # type: str
+    ):
+        self.platlib = platlib
+        self.purelib = purelib
+        self.headers = headers
+        self.scripts = scripts
+        self.data = data
diff --git a/venv/Lib/site-packages/pip/_internal/models/search_scope.py b/venv/Lib/site-packages/pip/_internal/models/search_scope.py
new file mode 100644
index 000000000..d732504e6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/search_scope.py
@@ -0,0 +1,135 @@
+import itertools
+import logging
+import os
+import posixpath
+
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.models.index import PyPI
+from pip._internal.utils.compat import has_tls
+from pip._internal.utils.misc import normalize_path, redact_auth_from_url
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List
+
+
+logger = logging.getLogger(__name__)
+
+
+class SearchScope(object):
+
+    """
+    Encapsulates the locations that pip is configured to search.
+    """
+
+    __slots__ = ["find_links", "index_urls"]
+
+    @classmethod
+    def create(
+        cls,
+        find_links,  # type: List[str]
+        index_urls,  # type: List[str]
+    ):
+        # type: (...) -> SearchScope
+        """
+        Create a SearchScope object after normalizing the `find_links`.
+        """
+        # Build find_links. If an argument starts with ~, it may be
+        # a local file relative to a home directory. So try normalizing
+        # it and if it exists, use the normalized version.
+        # This is deliberately conservative - it might be fine just to
+        # blindly normalize anything starting with a ~...
+        built_find_links = []  # type: List[str]
+        for link in find_links:
+            if link.startswith('~'):
+                new_link = normalize_path(link)
+                if os.path.exists(new_link):
+                    link = new_link
+            built_find_links.append(link)
+
+        # If we don't have TLS enabled, then WARN if anyplace we're looking
+        # relies on TLS.
+        if not has_tls():
+            for link in itertools.chain(index_urls, built_find_links):
+                parsed = urllib_parse.urlparse(link)
+                if parsed.scheme == 'https':
+                    logger.warning(
+                        'pip is configured with locations that require '
+                        'TLS/SSL, however the ssl module in Python is not '
+                        'available.'
+                    )
+                    break
+
+        return cls(
+            find_links=built_find_links,
+            index_urls=index_urls,
+        )
+
+    def __init__(
+        self,
+        find_links,  # type: List[str]
+        index_urls,  # type: List[str]
+    ):
+        # type: (...) -> None
+        self.find_links = find_links
+        self.index_urls = index_urls
+
+    def get_formatted_locations(self):
+        # type: () -> str
+        lines = []
+        redacted_index_urls = []
+        if self.index_urls and self.index_urls != [PyPI.simple_url]:
+            for url in self.index_urls:
+
+                redacted_index_url = redact_auth_from_url(url)
+
+                # Parse the URL
+                purl = urllib_parse.urlsplit(redacted_index_url)
+
+                # URL is generally invalid if scheme and netloc is missing
+                # there are issues with Python and URL parsing, so this test
+                # is a bit crude. See bpo-20271, bpo-23505. Python doesn't
+                # always parse invalid URLs correctly - it should raise
+                # exceptions for malformed URLs
+                if not purl.scheme and not purl.netloc:
+                    logger.warning(
+                        'The index url "%s" seems invalid, '
+                        'please provide a scheme.', redacted_index_url)
+
+                redacted_index_urls.append(redacted_index_url)
+
+            lines.append('Looking in indexes: {}'.format(
+                ', '.join(redacted_index_urls)))
+
+        if self.find_links:
+            lines.append(
+                'Looking in links: {}'.format(', '.join(
+                    redact_auth_from_url(url) for url in self.find_links))
+            )
+        return '\n'.join(lines)
+
+    def get_index_urls_locations(self, project_name):
+        # type: (str) -> List[str]
+        """Returns the locations found via self.index_urls
+
+        Checks the url_name on the main (first in the list) index and
+        use this url_name to produce all locations
+        """
+
+        def mkurl_pypi_url(url):
+            # type: (str) -> str
+            loc = posixpath.join(
+                url,
+                urllib_parse.quote(canonicalize_name(project_name)))
+            # For maximum compatibility with easy_install, ensure the path
+            # ends in a trailing slash.  Although this isn't in the spec
+            # (and PyPI can handle it without the slash) some other index
+            # implementations might break if they relied on easy_install's
+            # behavior.
+            if not loc.endswith('/'):
+                loc = loc + '/'
+            return loc
+
+        return [mkurl_pypi_url(url) for url in self.index_urls]
diff --git a/venv/Lib/site-packages/pip/_internal/models/selection_prefs.py b/venv/Lib/site-packages/pip/_internal/models/selection_prefs.py
new file mode 100644
index 000000000..5db3ca91c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/selection_prefs.py
@@ -0,0 +1,49 @@
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional
+    from pip._internal.models.format_control import FormatControl
+
+
+class SelectionPreferences(object):
+    """
+    Encapsulates the candidate selection preferences for downloading
+    and installing files.
+    """
+
+    __slots__ = ['allow_yanked', 'allow_all_prereleases', 'format_control',
+                 'prefer_binary', 'ignore_requires_python']
+
+    # Don't include an allow_yanked default value to make sure each call
+    # site considers whether yanked releases are allowed. This also causes
+    # that decision to be made explicit in the calling code, which helps
+    # people when reading the code.
+    def __init__(
+        self,
+        allow_yanked,  # type: bool
+        allow_all_prereleases=False,  # type: bool
+        format_control=None,          # type: Optional[FormatControl]
+        prefer_binary=False,          # type: bool
+        ignore_requires_python=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> None
+        """Create a SelectionPreferences object.
+
+        :param allow_yanked: Whether files marked as yanked (in the sense
+            of PEP 592) are permitted to be candidates for install.
+        :param format_control: A FormatControl object or None. Used to control
+            the selection of source packages / binary packages when consulting
+            the index and links.
+        :param prefer_binary: Whether to prefer an old, but valid, binary
+            dist over a new source dist.
+        :param ignore_requires_python: Whether to ignore incompatible
+            "Requires-Python" values in links. Defaults to False.
+        """
+        if ignore_requires_python is None:
+            ignore_requires_python = False
+
+        self.allow_yanked = allow_yanked
+        self.allow_all_prereleases = allow_all_prereleases
+        self.format_control = format_control
+        self.prefer_binary = prefer_binary
+        self.ignore_requires_python = ignore_requires_python
diff --git a/venv/Lib/site-packages/pip/_internal/models/target_python.py b/venv/Lib/site-packages/pip/_internal/models/target_python.py
new file mode 100644
index 000000000..6d1ca7964
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/target_python.py
@@ -0,0 +1,120 @@
+import sys
+
+from pip._internal.utils.compatibility_tags import (
+    get_supported,
+    version_info_to_nodot,
+)
+from pip._internal.utils.misc import normalize_version_info
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Tuple
+
+    from pip._vendor.packaging.tags import Tag
+
+
+class TargetPython(object):
+
+    """
+    Encapsulates the properties of a Python interpreter one is targeting
+    for a package install, download, etc.
+    """
+
+    __slots__ = [
+        "_given_py_version_info",
+        "abi",
+        "implementation",
+        "platform",
+        "py_version",
+        "py_version_info",
+        "_valid_tags",
+    ]
+
+    def __init__(
+        self,
+        platform=None,  # type: Optional[str]
+        py_version_info=None,  # type: Optional[Tuple[int, ...]]
+        abi=None,  # type: Optional[str]
+        implementation=None,  # type: Optional[str]
+    ):
+        # type: (...) -> None
+        """
+        :param platform: A string or None. If None, searches for packages
+            that are supported by the current system. Otherwise, will find
+            packages that can be built on the platform passed in. These
+            packages will only be downloaded for distribution: they will
+            not be built locally.
+        :param py_version_info: An optional tuple of ints representing the
+            Python version information to use (e.g. `sys.version_info[:3]`).
+            This can have length 1, 2, or 3 when provided.
+        :param abi: A string or None. This is passed to compatibility_tags.py's
+            get_supported() function as is.
+        :param implementation: A string or None. This is passed to
+            compatibility_tags.py's get_supported() function as is.
+        """
+        # Store the given py_version_info for when we call get_supported().
+        self._given_py_version_info = py_version_info
+
+        if py_version_info is None:
+            py_version_info = sys.version_info[:3]
+        else:
+            py_version_info = normalize_version_info(py_version_info)
+
+        py_version = '.'.join(map(str, py_version_info[:2]))
+
+        self.abi = abi
+        self.implementation = implementation
+        self.platform = platform
+        self.py_version = py_version
+        self.py_version_info = py_version_info
+
+        # This is used to cache the return value of get_tags().
+        self._valid_tags = None  # type: Optional[List[Tag]]
+
+    def format_given(self):
+        # type: () -> str
+        """
+        Format the given, non-None attributes for display.
+        """
+        display_version = None
+        if self._given_py_version_info is not None:
+            display_version = '.'.join(
+                str(part) for part in self._given_py_version_info
+            )
+
+        key_values = [
+            ('platform', self.platform),
+            ('version_info', display_version),
+            ('abi', self.abi),
+            ('implementation', self.implementation),
+        ]
+        return ' '.join(
+            '{}={!r}'.format(key, value) for key, value in key_values
+            if value is not None
+        )
+
+    def get_tags(self):
+        # type: () -> List[Tag]
+        """
+        Return the supported PEP 425 tags to check wheel candidates against.
+
+        The tags are returned in order of preference (most preferred first).
+        """
+        if self._valid_tags is None:
+            # Pass versions=None if no py_version_info was given since
+            # versions=None uses special default logic.
+            py_version_info = self._given_py_version_info
+            if py_version_info is None:
+                version = None
+            else:
+                version = version_info_to_nodot(py_version_info)
+
+            tags = get_supported(
+                version=version,
+                platform=self.platform,
+                abi=self.abi,
+                impl=self.implementation,
+            )
+            self._valid_tags = tags
+
+        return self._valid_tags
diff --git a/venv/Lib/site-packages/pip/_internal/models/wheel.py b/venv/Lib/site-packages/pip/_internal/models/wheel.py
new file mode 100644
index 000000000..4d4068f3b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/models/wheel.py
@@ -0,0 +1,78 @@
+"""Represents a wheel file and provides access to the various parts of the
+name that have meaning.
+"""
+import re
+
+from pip._vendor.packaging.tags import Tag
+
+from pip._internal.exceptions import InvalidWheelFilename
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List
+
+
+class Wheel(object):
+    """A wheel file"""
+
+    wheel_file_re = re.compile(
+        r"""^(?P<namever>(?P<name>.+?)-(?P<ver>.*?))
+        ((-(?P<build>\d[^-]*?))?-(?P<pyver>.+?)-(?P<abi>.+?)-(?P<plat>.+?)
+        \.whl|\.dist-info)$""",
+        re.VERBOSE
+    )
+
+    def __init__(self, filename):
+        # type: (str) -> None
+        """
+        :raises InvalidWheelFilename: when the filename is invalid for a wheel
+        """
+        wheel_info = self.wheel_file_re.match(filename)
+        if not wheel_info:
+            raise InvalidWheelFilename(
+                "{} is not a valid wheel filename.".format(filename)
+            )
+        self.filename = filename
+        self.name = wheel_info.group('name').replace('_', '-')
+        # we'll assume "_" means "-" due to wheel naming scheme
+        # (https://github.com/pypa/pip/issues/1150)
+        self.version = wheel_info.group('ver').replace('_', '-')
+        self.build_tag = wheel_info.group('build')
+        self.pyversions = wheel_info.group('pyver').split('.')
+        self.abis = wheel_info.group('abi').split('.')
+        self.plats = wheel_info.group('plat').split('.')
+
+        # All the tag combinations from this file
+        self.file_tags = {
+            Tag(x, y, z) for x in self.pyversions
+            for y in self.abis for z in self.plats
+        }
+
+    def get_formatted_file_tags(self):
+        # type: () -> List[str]
+        """Return the wheel's tags as a sorted list of strings."""
+        return sorted(str(tag) for tag in self.file_tags)
+
+    def support_index_min(self, tags):
+        # type: (List[Tag]) -> int
+        """Return the lowest index that one of the wheel's file_tag combinations
+        achieves in the given list of supported tags.
+
+        For example, if there are 8 supported tags and one of the file tags
+        is first in the list, then return 0.
+
+        :param tags: the PEP 425 tags to check the wheel against, in order
+            with most preferred first.
+
+        :raises ValueError: If none of the wheel's file tags match one of
+            the supported tags.
+        """
+        return min(tags.index(tag) for tag in self.file_tags if tag in tags)
+
+    def supported(self, tags):
+        # type: (List[Tag]) -> bool
+        """Return whether the wheel is compatible with one of the given tags.
+
+        :param tags: the PEP 425 tags to check the wheel against.
+        """
+        return not self.file_tags.isdisjoint(tags)
diff --git a/venv/Lib/site-packages/pip/_internal/network/__init__.py b/venv/Lib/site-packages/pip/_internal/network/__init__.py
new file mode 100644
index 000000000..b51bde91b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/__init__.py
@@ -0,0 +1,2 @@
+"""Contains purely network-related utilities.
+"""
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..d5a9c7900
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/auth.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/auth.cpython-36.pyc
new file mode 100644
index 000000000..90f38b670
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/auth.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/cache.cpython-36.pyc
new file mode 100644
index 000000000..89fef804e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/download.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/download.cpython-36.pyc
new file mode 100644
index 000000000..cd8131d11
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/download.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/lazy_wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/lazy_wheel.cpython-36.pyc
new file mode 100644
index 000000000..f9d757c70
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/lazy_wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/session.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/session.cpython-36.pyc
new file mode 100644
index 000000000..9bccddc54
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/session.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..091192fc3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/__pycache__/xmlrpc.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/network/__pycache__/xmlrpc.cpython-36.pyc
new file mode 100644
index 000000000..50b67479e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/network/__pycache__/xmlrpc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/network/auth.py b/venv/Lib/site-packages/pip/_internal/network/auth.py
new file mode 100644
index 000000000..c49deaaf1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/auth.py
@@ -0,0 +1,310 @@
+"""Network Authentication Helpers
+
+Contains interface (MultiDomainBasicAuth) and associated glue code for
+providing credentials in the context of network requests.
+"""
+
+import logging
+
+from pip._vendor.requests.auth import AuthBase, HTTPBasicAuth
+from pip._vendor.requests.utils import get_netrc_auth
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.utils.misc import (
+    ask,
+    ask_input,
+    ask_password,
+    remove_auth_from_url,
+    split_auth_netloc_from_url,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, Optional, Tuple, List, Any
+
+    from pip._internal.vcs.versioncontrol import AuthInfo
+
+    from pip._vendor.requests.models import Response, Request
+
+    Credentials = Tuple[str, str, str]
+
+logger = logging.getLogger(__name__)
+
+try:
+    import keyring  # noqa
+except ImportError:
+    keyring = None
+except Exception as exc:
+    logger.warning(
+        "Keyring is skipped due to an exception: %s", str(exc),
+    )
+    keyring = None
+
+
+def get_keyring_auth(url, username):
+    # type: (str, str) -> Optional[AuthInfo]
+    """Return the tuple auth for a given url from keyring."""
+    global keyring
+    if not url or not keyring:
+        return None
+
+    try:
+        try:
+            get_credential = keyring.get_credential
+        except AttributeError:
+            pass
+        else:
+            logger.debug("Getting credentials from keyring for %s", url)
+            cred = get_credential(url, username)
+            if cred is not None:
+                return cred.username, cred.password
+            return None
+
+        if username:
+            logger.debug("Getting password from keyring for %s", url)
+            password = keyring.get_password(url, username)
+            if password:
+                return username, password
+
+    except Exception as exc:
+        logger.warning(
+            "Keyring is skipped due to an exception: %s", str(exc),
+        )
+        keyring = None
+    return None
+
+
+class MultiDomainBasicAuth(AuthBase):
+
+    def __init__(self, prompting=True, index_urls=None):
+        # type: (bool, Optional[List[str]]) -> None
+        self.prompting = prompting
+        self.index_urls = index_urls
+        self.passwords = {}  # type: Dict[str, AuthInfo]
+        # When the user is prompted to enter credentials and keyring is
+        # available, we will offer to save them. If the user accepts,
+        # this value is set to the credentials they entered. After the
+        # request authenticates, the caller should call
+        # ``save_credentials`` to save these.
+        self._credentials_to_save = None  # type: Optional[Credentials]
+
+    def _get_index_url(self, url):
+        # type: (str) -> Optional[str]
+        """Return the original index URL matching the requested URL.
+
+        Cached or dynamically generated credentials may work against
+        the original index URL rather than just the netloc.
+
+        The provided url should have had its username and password
+        removed already. If the original index url had credentials then
+        they will be included in the return value.
+
+        Returns None if no matching index was found, or if --no-index
+        was specified by the user.
+        """
+        if not url or not self.index_urls:
+            return None
+
+        for u in self.index_urls:
+            prefix = remove_auth_from_url(u).rstrip("/") + "/"
+            if url.startswith(prefix):
+                return u
+        return None
+
+    def _get_new_credentials(self, original_url, allow_netrc=True,
+                             allow_keyring=True):
+        # type: (str, bool, bool) -> AuthInfo
+        """Find and return credentials for the specified URL."""
+        # Split the credentials and netloc from the url.
+        url, netloc, url_user_password = split_auth_netloc_from_url(
+            original_url,
+        )
+
+        # Start with the credentials embedded in the url
+        username, password = url_user_password
+        if username is not None and password is not None:
+            logger.debug("Found credentials in url for %s", netloc)
+            return url_user_password
+
+        # Find a matching index url for this request
+        index_url = self._get_index_url(url)
+        if index_url:
+            # Split the credentials from the url.
+            index_info = split_auth_netloc_from_url(index_url)
+            if index_info:
+                index_url, _, index_url_user_password = index_info
+                logger.debug("Found index url %s", index_url)
+
+        # If an index URL was found, try its embedded credentials
+        if index_url and index_url_user_password[0] is not None:
+            username, password = index_url_user_password
+            if username is not None and password is not None:
+                logger.debug("Found credentials in index url for %s", netloc)
+                return index_url_user_password
+
+        # Get creds from netrc if we still don't have them
+        if allow_netrc:
+            netrc_auth = get_netrc_auth(original_url)
+            if netrc_auth:
+                logger.debug("Found credentials in netrc for %s", netloc)
+                return netrc_auth
+
+        # If we don't have a password and keyring is available, use it.
+        if allow_keyring:
+            # The index url is more specific than the netloc, so try it first
+            kr_auth = (
+                get_keyring_auth(index_url, username) or
+                get_keyring_auth(netloc, username)
+            )
+            if kr_auth:
+                logger.debug("Found credentials in keyring for %s", netloc)
+                return kr_auth
+
+        return username, password
+
+    def _get_url_and_credentials(self, original_url):
+        # type: (str) -> Tuple[str, Optional[str], Optional[str]]
+        """Return the credentials to use for the provided URL.
+
+        If allowed, netrc and keyring may be used to obtain the
+        correct credentials.
+
+        Returns (url_without_credentials, username, password). Note
+        that even if the original URL contains credentials, this
+        function may return a different username and password.
+        """
+        url, netloc, _ = split_auth_netloc_from_url(original_url)
+
+        # Use any stored credentials that we have for this netloc
+        username, password = self.passwords.get(netloc, (None, None))
+
+        if username is None and password is None:
+            # No stored credentials. Acquire new credentials without prompting
+            # the user. (e.g. from netrc, keyring, or the URL itself)
+            username, password = self._get_new_credentials(original_url)
+
+        if username is not None or password is not None:
+            # Convert the username and password if they're None, so that
+            # this netloc will show up as "cached" in the conditional above.
+            # Further, HTTPBasicAuth doesn't accept None, so it makes sense to
+            # cache the value that is going to be used.
+            username = username or ""
+            password = password or ""
+
+            # Store any acquired credentials.
+            self.passwords[netloc] = (username, password)
+
+        assert (
+            # Credentials were found
+            (username is not None and password is not None) or
+            # Credentials were not found
+            (username is None and password is None)
+        ), "Could not load credentials from url: {}".format(original_url)
+
+        return url, username, password
+
+    def __call__(self, req):
+        # type: (Request) -> Request
+        # Get credentials for this request
+        url, username, password = self._get_url_and_credentials(req.url)
+
+        # Set the url of the request to the url without any credentials
+        req.url = url
+
+        if username is not None and password is not None:
+            # Send the basic auth with this request
+            req = HTTPBasicAuth(username, password)(req)
+
+        # Attach a hook to handle 401 responses
+        req.register_hook("response", self.handle_401)
+
+        return req
+
+    # Factored out to allow for easy patching in tests
+    def _prompt_for_password(self, netloc):
+        # type: (str) -> Tuple[Optional[str], Optional[str], bool]
+        username = ask_input("User for {}: ".format(netloc))
+        if not username:
+            return None, None, False
+        auth = get_keyring_auth(netloc, username)
+        if auth and auth[0] is not None and auth[1] is not None:
+            return auth[0], auth[1], False
+        password = ask_password("Password: ")
+        return username, password, True
+
+    # Factored out to allow for easy patching in tests
+    def _should_save_password_to_keyring(self):
+        # type: () -> bool
+        if not keyring:
+            return False
+        return ask("Save credentials to keyring [y/N]: ", ["y", "n"]) == "y"
+
+    def handle_401(self, resp, **kwargs):
+        # type: (Response, **Any) -> Response
+        # We only care about 401 responses, anything else we want to just
+        #   pass through the actual response
+        if resp.status_code != 401:
+            return resp
+
+        # We are not able to prompt the user so simply return the response
+        if not self.prompting:
+            return resp
+
+        parsed = urllib_parse.urlparse(resp.url)
+
+        # Prompt the user for a new username and password
+        username, password, save = self._prompt_for_password(parsed.netloc)
+
+        # Store the new username and password to use for future requests
+        self._credentials_to_save = None
+        if username is not None and password is not None:
+            self.passwords[parsed.netloc] = (username, password)
+
+            # Prompt to save the password to keyring
+            if save and self._should_save_password_to_keyring():
+                self._credentials_to_save = (parsed.netloc, username, password)
+
+        # Consume content and release the original connection to allow our new
+        #   request to reuse the same one.
+        resp.content
+        resp.raw.release_conn()
+
+        # Add our new username and password to the request
+        req = HTTPBasicAuth(username or "", password or "")(resp.request)
+        req.register_hook("response", self.warn_on_401)
+
+        # On successful request, save the credentials that were used to
+        # keyring. (Note that if the user responded "no" above, this member
+        # is not set and nothing will be saved.)
+        if self._credentials_to_save:
+            req.register_hook("response", self.save_credentials)
+
+        # Send our new request
+        new_resp = resp.connection.send(req, **kwargs)
+        new_resp.history.append(resp)
+
+        return new_resp
+
+    def warn_on_401(self, resp, **kwargs):
+        # type: (Response, **Any) -> None
+        """Response callback to warn about incorrect credentials."""
+        if resp.status_code == 401:
+            logger.warning(
+                '401 Error, Credentials not correct for %s', resp.request.url,
+            )
+
+    def save_credentials(self, resp, **kwargs):
+        # type: (Response, **Any) -> None
+        """Response callback to save credentials on success."""
+        assert keyring is not None, "should never reach here without keyring"
+        if not keyring:
+            return
+
+        creds = self._credentials_to_save
+        self._credentials_to_save = None
+        if creds and resp.status_code < 400:
+            try:
+                logger.info('Saving credentials to keyring')
+                keyring.set_password(*creds)
+            except Exception:
+                logger.exception('Failed to save credentials')
diff --git a/venv/Lib/site-packages/pip/_internal/network/cache.py b/venv/Lib/site-packages/pip/_internal/network/cache.py
new file mode 100644
index 000000000..a0d55b5e9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/cache.py
@@ -0,0 +1,79 @@
+"""HTTP cache implementation.
+"""
+
+import os
+from contextlib import contextmanager
+
+from pip._vendor.cachecontrol.cache import BaseCache
+from pip._vendor.cachecontrol.caches import FileCache
+from pip._vendor.requests.models import Response
+
+from pip._internal.utils.filesystem import adjacent_tmp_file, replace
+from pip._internal.utils.misc import ensure_dir
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Iterator
+
+
+def is_from_cache(response):
+    # type: (Response) -> bool
+    return getattr(response, "from_cache", False)
+
+
+@contextmanager
+def suppressed_cache_errors():
+    # type: () -> Iterator[None]
+    """If we can't access the cache then we can just skip caching and process
+    requests as if caching wasn't enabled.
+    """
+    try:
+        yield
+    except (OSError, IOError):
+        pass
+
+
+class SafeFileCache(BaseCache):
+    """
+    A file based cache which is safe to use even when the target directory may
+    not be accessible or writable.
+    """
+
+    def __init__(self, directory):
+        # type: (str) -> None
+        assert directory is not None, "Cache directory must not be None."
+        super(SafeFileCache, self).__init__()
+        self.directory = directory
+
+    def _get_cache_path(self, name):
+        # type: (str) -> str
+        # From cachecontrol.caches.file_cache.FileCache._fn, brought into our
+        # class for backwards-compatibility and to avoid using a non-public
+        # method.
+        hashed = FileCache.encode(name)
+        parts = list(hashed[:5]) + [hashed]
+        return os.path.join(self.directory, *parts)
+
+    def get(self, key):
+        # type: (str) -> Optional[bytes]
+        path = self._get_cache_path(key)
+        with suppressed_cache_errors():
+            with open(path, 'rb') as f:
+                return f.read()
+
+    def set(self, key, value):
+        # type: (str, bytes) -> None
+        path = self._get_cache_path(key)
+        with suppressed_cache_errors():
+            ensure_dir(os.path.dirname(path))
+
+            with adjacent_tmp_file(path) as f:
+                f.write(value)
+
+            replace(f.name, path)
+
+    def delete(self, key):
+        # type: (str) -> None
+        path = self._get_cache_path(key)
+        with suppressed_cache_errors():
+            os.remove(path)
diff --git a/venv/Lib/site-packages/pip/_internal/network/download.py b/venv/Lib/site-packages/pip/_internal/network/download.py
new file mode 100644
index 000000000..44f9985a3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/download.py
@@ -0,0 +1,182 @@
+"""Download files with progress indicators.
+"""
+import cgi
+import logging
+import mimetypes
+import os
+
+from pip._vendor.requests.models import CONTENT_CHUNK_SIZE
+
+from pip._internal.cli.progress_bars import DownloadProgressProvider
+from pip._internal.exceptions import NetworkConnectionError
+from pip._internal.models.index import PyPI
+from pip._internal.network.cache import is_from_cache
+from pip._internal.network.utils import (
+    HEADERS,
+    raise_for_status,
+    response_chunks,
+)
+from pip._internal.utils.misc import (
+    format_size,
+    redact_auth_from_url,
+    splitext,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Iterable, Optional
+
+    from pip._vendor.requests.models import Response
+
+    from pip._internal.models.link import Link
+    from pip._internal.network.session import PipSession
+
+logger = logging.getLogger(__name__)
+
+
+def _get_http_response_size(resp):
+    # type: (Response) -> Optional[int]
+    try:
+        return int(resp.headers['content-length'])
+    except (ValueError, KeyError, TypeError):
+        return None
+
+
+def _prepare_download(
+    resp,  # type: Response
+    link,  # type: Link
+    progress_bar  # type: str
+):
+    # type: (...) -> Iterable[bytes]
+    total_length = _get_http_response_size(resp)
+
+    if link.netloc == PyPI.file_storage_domain:
+        url = link.show_url
+    else:
+        url = link.url_without_fragment
+
+    logged_url = redact_auth_from_url(url)
+
+    if total_length:
+        logged_url = '{} ({})'.format(logged_url, format_size(total_length))
+
+    if is_from_cache(resp):
+        logger.info("Using cached %s", logged_url)
+    else:
+        logger.info("Downloading %s", logged_url)
+
+    if logger.getEffectiveLevel() > logging.INFO:
+        show_progress = False
+    elif is_from_cache(resp):
+        show_progress = False
+    elif not total_length:
+        show_progress = True
+    elif total_length > (40 * 1000):
+        show_progress = True
+    else:
+        show_progress = False
+
+    chunks = response_chunks(resp, CONTENT_CHUNK_SIZE)
+
+    if not show_progress:
+        return chunks
+
+    return DownloadProgressProvider(
+        progress_bar, max=total_length
+    )(chunks)
+
+
+def sanitize_content_filename(filename):
+    # type: (str) -> str
+    """
+    Sanitize the "filename" value from a Content-Disposition header.
+    """
+    return os.path.basename(filename)
+
+
+def parse_content_disposition(content_disposition, default_filename):
+    # type: (str, str) -> str
+    """
+    Parse the "filename" value from a Content-Disposition header, and
+    return the default filename if the result is empty.
+    """
+    _type, params = cgi.parse_header(content_disposition)
+    filename = params.get('filename')
+    if filename:
+        # We need to sanitize the filename to prevent directory traversal
+        # in case the filename contains ".." path parts.
+        filename = sanitize_content_filename(filename)
+    return filename or default_filename
+
+
+def _get_http_response_filename(resp, link):
+    # type: (Response, Link) -> str
+    """Get an ideal filename from the given HTTP response, falling back to
+    the link filename if not provided.
+    """
+    filename = link.filename  # fallback
+    # Have a look at the Content-Disposition header for a better guess
+    content_disposition = resp.headers.get('content-disposition')
+    if content_disposition:
+        filename = parse_content_disposition(content_disposition, filename)
+    ext = splitext(filename)[1]  # type: Optional[str]
+    if not ext:
+        ext = mimetypes.guess_extension(
+            resp.headers.get('content-type', '')
+        )
+        if ext:
+            filename += ext
+    if not ext and link.url != resp.url:
+        ext = os.path.splitext(resp.url)[1]
+        if ext:
+            filename += ext
+    return filename
+
+
+def _http_get_download(session, link):
+    # type: (PipSession, Link) -> Response
+    target_url = link.url.split('#', 1)[0]
+    resp = session.get(target_url, headers=HEADERS, stream=True)
+    raise_for_status(resp)
+    return resp
+
+
+class Download(object):
+    def __init__(
+        self,
+        response,  # type: Response
+        filename,  # type: str
+        chunks,  # type: Iterable[bytes]
+    ):
+        # type: (...) -> None
+        self.response = response
+        self.filename = filename
+        self.chunks = chunks
+
+
+class Downloader(object):
+    def __init__(
+        self,
+        session,  # type: PipSession
+        progress_bar,  # type: str
+    ):
+        # type: (...) -> None
+        self._session = session
+        self._progress_bar = progress_bar
+
+    def __call__(self, link):
+        # type: (Link) -> Download
+        try:
+            resp = _http_get_download(self._session, link)
+        except NetworkConnectionError as e:
+            assert e.response is not None
+            logger.critical(
+                "HTTP error %s while getting %s", e.response.status_code, link
+            )
+            raise
+
+        return Download(
+            resp,
+            _get_http_response_filename(resp, link),
+            _prepare_download(resp, link, self._progress_bar),
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/network/lazy_wheel.py b/venv/Lib/site-packages/pip/_internal/network/lazy_wheel.py
new file mode 100644
index 000000000..a0f9e151d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/lazy_wheel.py
@@ -0,0 +1,235 @@
+"""Lazy ZIP over HTTP"""
+
+__all__ = ['HTTPRangeRequestUnsupported', 'dist_from_wheel_url']
+
+from bisect import bisect_left, bisect_right
+from contextlib import contextmanager
+from tempfile import NamedTemporaryFile
+from zipfile import BadZipfile, ZipFile
+
+from pip._vendor.requests.models import CONTENT_CHUNK_SIZE
+from pip._vendor.six.moves import range
+
+from pip._internal.network.utils import (
+    HEADERS,
+    raise_for_status,
+    response_chunks,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.wheel import pkg_resources_distribution_for_wheel
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Dict, Iterator, List, Optional, Tuple
+
+    from pip._vendor.pkg_resources import Distribution
+    from pip._vendor.requests.models import Response
+
+    from pip._internal.network.session import PipSession
+
+
+class HTTPRangeRequestUnsupported(Exception):
+    pass
+
+
+def dist_from_wheel_url(name, url, session):
+    # type: (str, str, PipSession) -> Distribution
+    """Return a pkg_resources.Distribution from the given wheel URL.
+
+    This uses HTTP range requests to only fetch the potion of the wheel
+    containing metadata, just enough for the object to be constructed.
+    If such requests are not supported, HTTPRangeRequestUnsupported
+    is raised.
+    """
+    with LazyZipOverHTTP(url, session) as wheel:
+        # For read-only ZIP files, ZipFile only needs methods read,
+        # seek, seekable and tell, not the whole IO protocol.
+        zip_file = ZipFile(wheel)  # type: ignore
+        # After context manager exit, wheel.name
+        # is an invalid file by intention.
+        return pkg_resources_distribution_for_wheel(zip_file, name, wheel.name)
+
+
+class LazyZipOverHTTP(object):
+    """File-like object mapped to a ZIP file over HTTP.
+
+    This uses HTTP range requests to lazily fetch the file's content,
+    which is supposed to be fed to ZipFile.  If such requests are not
+    supported by the server, raise HTTPRangeRequestUnsupported
+    during initialization.
+    """
+
+    def __init__(self, url, session, chunk_size=CONTENT_CHUNK_SIZE):
+        # type: (str, PipSession, int) -> None
+        head = session.head(url, headers=HEADERS)
+        raise_for_status(head)
+        assert head.status_code == 200
+        self._session, self._url, self._chunk_size = session, url, chunk_size
+        self._length = int(head.headers['Content-Length'])
+        self._file = NamedTemporaryFile()
+        self.truncate(self._length)
+        self._left = []  # type: List[int]
+        self._right = []  # type: List[int]
+        if 'bytes' not in head.headers.get('Accept-Ranges', 'none'):
+            raise HTTPRangeRequestUnsupported('range request is not supported')
+        self._check_zip()
+
+    @property
+    def mode(self):
+        # type: () -> str
+        """Opening mode, which is always rb."""
+        return 'rb'
+
+    @property
+    def name(self):
+        # type: () -> str
+        """Path to the underlying file."""
+        return self._file.name
+
+    def seekable(self):
+        # type: () -> bool
+        """Return whether random access is supported, which is True."""
+        return True
+
+    def close(self):
+        # type: () -> None
+        """Close the file."""
+        self._file.close()
+
+    @property
+    def closed(self):
+        # type: () -> bool
+        """Whether the file is closed."""
+        return self._file.closed
+
+    def read(self, size=-1):
+        # type: (int) -> bytes
+        """Read up to size bytes from the object and return them.
+
+        As a convenience, if size is unspecified or -1,
+        all bytes until EOF are returned.  Fewer than
+        size bytes may be returned if EOF is reached.
+        """
+        download_size = max(size, self._chunk_size)
+        start, length = self.tell(), self._length
+        stop = length if size < 0 else min(start+download_size, length)
+        start = max(0, stop-download_size)
+        self._download(start, stop-1)
+        return self._file.read(size)
+
+    def readable(self):
+        # type: () -> bool
+        """Return whether the file is readable, which is True."""
+        return True
+
+    def seek(self, offset, whence=0):
+        # type: (int, int) -> int
+        """Change stream position and return the new absolute position.
+
+        Seek to offset relative position indicated by whence:
+        * 0: Start of stream (the default).  pos should be >= 0;
+        * 1: Current position - pos may be negative;
+        * 2: End of stream - pos usually negative.
+        """
+        return self._file.seek(offset, whence)
+
+    def tell(self):
+        # type: () -> int
+        """Return the current possition."""
+        return self._file.tell()
+
+    def truncate(self, size=None):
+        # type: (Optional[int]) -> int
+        """Resize the stream to the given size in bytes.
+
+        If size is unspecified resize to the current position.
+        The current stream position isn't changed.
+
+        Return the new file size.
+        """
+        return self._file.truncate(size)
+
+    def writable(self):
+        # type: () -> bool
+        """Return False."""
+        return False
+
+    def __enter__(self):
+        # type: () -> LazyZipOverHTTP
+        self._file.__enter__()
+        return self
+
+    def __exit__(self, *exc):
+        # type: (*Any) -> Optional[bool]
+        return self._file.__exit__(*exc)
+
+    @contextmanager
+    def _stay(self):
+        # type: ()-> Iterator[None]
+        """Return a context manager keeping the position.
+
+        At the end of the block, seek back to original position.
+        """
+        pos = self.tell()
+        try:
+            yield
+        finally:
+            self.seek(pos)
+
+    def _check_zip(self):
+        # type: () -> None
+        """Check and download until the file is a valid ZIP."""
+        end = self._length - 1
+        for start in reversed(range(0, end, self._chunk_size)):
+            self._download(start, end)
+            with self._stay():
+                try:
+                    # For read-only ZIP files, ZipFile only needs
+                    # methods read, seek, seekable and tell.
+                    ZipFile(self)  # type: ignore
+                except BadZipfile:
+                    pass
+                else:
+                    break
+
+    def _stream_response(self, start, end, base_headers=HEADERS):
+        # type: (int, int, Dict[str, str]) -> Response
+        """Return HTTP response to a range request from start to end."""
+        headers = base_headers.copy()
+        headers['Range'] = 'bytes={}-{}'.format(start, end)
+        # TODO: Get range requests to be correctly cached
+        headers['Cache-Control'] = 'no-cache'
+        return self._session.get(self._url, headers=headers, stream=True)
+
+    def _merge(self, start, end, left, right):
+        # type: (int, int, int, int) -> Iterator[Tuple[int, int]]
+        """Return an iterator of intervals to be fetched.
+
+        Args:
+            start (int): Start of needed interval
+            end (int): End of needed interval
+            left (int): Index of first overlapping downloaded data
+            right (int): Index after last overlapping downloaded data
+        """
+        lslice, rslice = self._left[left:right], self._right[left:right]
+        i = start = min([start]+lslice[:1])
+        end = max([end]+rslice[-1:])
+        for j, k in zip(lslice, rslice):
+            if j > i:
+                yield i, j-1
+            i = k + 1
+        if i <= end:
+            yield i, end
+        self._left[left:right], self._right[left:right] = [start], [end]
+
+    def _download(self, start, end):
+        # type: (int, int) -> None
+        """Download bytes from start to end inclusively."""
+        with self._stay():
+            left = bisect_left(self._right, start)
+            right = bisect_right(self._left, end)
+            for start, end in self._merge(start, end, left, right):
+                response = self._stream_response(start, end)
+                response.raise_for_status()
+                self.seek(start)
+                for chunk in response_chunks(response, self._chunk_size):
+                    self._file.write(chunk)
diff --git a/venv/Lib/site-packages/pip/_internal/network/session.py b/venv/Lib/site-packages/pip/_internal/network/session.py
new file mode 100644
index 000000000..39a4a546e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/session.py
@@ -0,0 +1,421 @@
+"""PipSession and supporting code, containing all pip-specific
+network request configuration and behavior.
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+import email.utils
+import json
+import logging
+import mimetypes
+import os
+import platform
+import sys
+import warnings
+
+from pip._vendor import requests, six, urllib3
+from pip._vendor.cachecontrol import CacheControlAdapter
+from pip._vendor.requests.adapters import BaseAdapter, HTTPAdapter
+from pip._vendor.requests.models import Response
+from pip._vendor.requests.structures import CaseInsensitiveDict
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+from pip._vendor.urllib3.exceptions import InsecureRequestWarning
+
+from pip import __version__
+from pip._internal.network.auth import MultiDomainBasicAuth
+from pip._internal.network.cache import SafeFileCache
+# Import ssl from compat so the initial import occurs in only one place.
+from pip._internal.utils.compat import has_tls, ipaddress
+from pip._internal.utils.glibc import libc_ver
+from pip._internal.utils.misc import (
+    build_url_from_netloc,
+    get_installed_version,
+    parse_netloc,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import url_to_path
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Iterator, List, Optional, Tuple, Union,
+    )
+
+    from pip._internal.models.link import Link
+
+    SecureOrigin = Tuple[str, str, Optional[Union[int, str]]]
+
+
+logger = logging.getLogger(__name__)
+
+
+# Ignore warning raised when using --trusted-host.
+warnings.filterwarnings("ignore", category=InsecureRequestWarning)
+
+
+SECURE_ORIGINS = [
+    # protocol, hostname, port
+    # Taken from Chrome's list of secure origins (See: http://bit.ly/1qrySKC)
+    ("https", "*", "*"),
+    ("*", "localhost", "*"),
+    ("*", "127.0.0.0/8", "*"),
+    ("*", "::1/128", "*"),
+    ("file", "*", None),
+    # ssh is always secure.
+    ("ssh", "*", "*"),
+]  # type: List[SecureOrigin]
+
+
+# These are environment variables present when running under various
+# CI systems.  For each variable, some CI systems that use the variable
+# are indicated.  The collection was chosen so that for each of a number
+# of popular systems, at least one of the environment variables is used.
+# This list is used to provide some indication of and lower bound for
+# CI traffic to PyPI.  Thus, it is okay if the list is not comprehensive.
+# For more background, see: https://github.com/pypa/pip/issues/5499
+CI_ENVIRONMENT_VARIABLES = (
+    # Azure Pipelines
+    'BUILD_BUILDID',
+    # Jenkins
+    'BUILD_ID',
+    # AppVeyor, CircleCI, Codeship, Gitlab CI, Shippable, Travis CI
+    'CI',
+    # Explicit environment variable.
+    'PIP_IS_CI',
+)
+
+
+def looks_like_ci():
+    # type: () -> bool
+    """
+    Return whether it looks like pip is running under CI.
+    """
+    # We don't use the method of checking for a tty (e.g. using isatty())
+    # because some CI systems mimic a tty (e.g. Travis CI).  Thus that
+    # method doesn't provide definitive information in either direction.
+    return any(name in os.environ for name in CI_ENVIRONMENT_VARIABLES)
+
+
+def user_agent():
+    """
+    Return a string representing the user agent.
+    """
+    data = {
+        "installer": {"name": "pip", "version": __version__},
+        "python": platform.python_version(),
+        "implementation": {
+            "name": platform.python_implementation(),
+        },
+    }
+
+    if data["implementation"]["name"] == 'CPython':
+        data["implementation"]["version"] = platform.python_version()
+    elif data["implementation"]["name"] == 'PyPy':
+        if sys.pypy_version_info.releaselevel == 'final':
+            pypy_version_info = sys.pypy_version_info[:3]
+        else:
+            pypy_version_info = sys.pypy_version_info
+        data["implementation"]["version"] = ".".join(
+            [str(x) for x in pypy_version_info]
+        )
+    elif data["implementation"]["name"] == 'Jython':
+        # Complete Guess
+        data["implementation"]["version"] = platform.python_version()
+    elif data["implementation"]["name"] == 'IronPython':
+        # Complete Guess
+        data["implementation"]["version"] = platform.python_version()
+
+    if sys.platform.startswith("linux"):
+        from pip._vendor import distro
+        distro_infos = dict(filter(
+            lambda x: x[1],
+            zip(["name", "version", "id"], distro.linux_distribution()),
+        ))
+        libc = dict(filter(
+            lambda x: x[1],
+            zip(["lib", "version"], libc_ver()),
+        ))
+        if libc:
+            distro_infos["libc"] = libc
+        if distro_infos:
+            data["distro"] = distro_infos
+
+    if sys.platform.startswith("darwin") and platform.mac_ver()[0]:
+        data["distro"] = {"name": "macOS", "version": platform.mac_ver()[0]}
+
+    if platform.system():
+        data.setdefault("system", {})["name"] = platform.system()
+
+    if platform.release():
+        data.setdefault("system", {})["release"] = platform.release()
+
+    if platform.machine():
+        data["cpu"] = platform.machine()
+
+    if has_tls():
+        import _ssl as ssl
+        data["openssl_version"] = ssl.OPENSSL_VERSION
+
+    setuptools_version = get_installed_version("setuptools")
+    if setuptools_version is not None:
+        data["setuptools_version"] = setuptools_version
+
+    # Use None rather than False so as not to give the impression that
+    # pip knows it is not being run under CI.  Rather, it is a null or
+    # inconclusive result.  Also, we include some value rather than no
+    # value to make it easier to know that the check has been run.
+    data["ci"] = True if looks_like_ci() else None
+
+    user_data = os.environ.get("PIP_USER_AGENT_USER_DATA")
+    if user_data is not None:
+        data["user_data"] = user_data
+
+    return "{data[installer][name]}/{data[installer][version]} {json}".format(
+        data=data,
+        json=json.dumps(data, separators=(",", ":"), sort_keys=True),
+    )
+
+
+class LocalFSAdapter(BaseAdapter):
+
+    def send(self, request, stream=None, timeout=None, verify=None, cert=None,
+             proxies=None):
+        pathname = url_to_path(request.url)
+
+        resp = Response()
+        resp.status_code = 200
+        resp.url = request.url
+
+        try:
+            stats = os.stat(pathname)
+        except OSError as exc:
+            resp.status_code = 404
+            resp.raw = exc
+        else:
+            modified = email.utils.formatdate(stats.st_mtime, usegmt=True)
+            content_type = mimetypes.guess_type(pathname)[0] or "text/plain"
+            resp.headers = CaseInsensitiveDict({
+                "Content-Type": content_type,
+                "Content-Length": stats.st_size,
+                "Last-Modified": modified,
+            })
+
+            resp.raw = open(pathname, "rb")
+            resp.close = resp.raw.close
+
+        return resp
+
+    def close(self):
+        pass
+
+
+class InsecureHTTPAdapter(HTTPAdapter):
+
+    def cert_verify(self, conn, url, verify, cert):
+        super(InsecureHTTPAdapter, self).cert_verify(
+            conn=conn, url=url, verify=False, cert=cert
+        )
+
+
+class InsecureCacheControlAdapter(CacheControlAdapter):
+
+    def cert_verify(self, conn, url, verify, cert):
+        super(InsecureCacheControlAdapter, self).cert_verify(
+            conn=conn, url=url, verify=False, cert=cert
+        )
+
+
+class PipSession(requests.Session):
+
+    timeout = None  # type: Optional[int]
+
+    def __init__(self, *args, **kwargs):
+        """
+        :param trusted_hosts: Domains not to emit warnings for when not using
+            HTTPS.
+        """
+        retries = kwargs.pop("retries", 0)
+        cache = kwargs.pop("cache", None)
+        trusted_hosts = kwargs.pop("trusted_hosts", [])  # type: List[str]
+        index_urls = kwargs.pop("index_urls", None)
+
+        super(PipSession, self).__init__(*args, **kwargs)
+
+        # Namespace the attribute with "pip_" just in case to prevent
+        # possible conflicts with the base class.
+        self.pip_trusted_origins = []  # type: List[Tuple[str, Optional[int]]]
+
+        # Attach our User Agent to the request
+        self.headers["User-Agent"] = user_agent()
+
+        # Attach our Authentication handler to the session
+        self.auth = MultiDomainBasicAuth(index_urls=index_urls)
+
+        # Create our urllib3.Retry instance which will allow us to customize
+        # how we handle retries.
+        retries = urllib3.Retry(
+            # Set the total number of retries that a particular request can
+            # have.
+            total=retries,
+
+            # A 503 error from PyPI typically means that the Fastly -> Origin
+            # connection got interrupted in some way. A 503 error in general
+            # is typically considered a transient error so we'll go ahead and
+            # retry it.
+            # A 500 may indicate transient error in Amazon S3
+            # A 520 or 527 - may indicate transient error in CloudFlare
+            status_forcelist=[500, 503, 520, 527],
+
+            # Add a small amount of back off between failed requests in
+            # order to prevent hammering the service.
+            backoff_factor=0.25,
+        )
+
+        # Our Insecure HTTPAdapter disables HTTPS validation. It does not
+        # support caching so we'll use it for all http:// URLs.
+        # If caching is disabled, we will also use it for
+        # https:// hosts that we've marked as ignoring
+        # TLS errors for (trusted-hosts).
+        insecure_adapter = InsecureHTTPAdapter(max_retries=retries)
+
+        # We want to _only_ cache responses on securely fetched origins or when
+        # the host is specified as trusted. We do this because
+        # we can't validate the response of an insecurely/untrusted fetched
+        # origin, and we don't want someone to be able to poison the cache and
+        # require manual eviction from the cache to fix it.
+        if cache:
+            secure_adapter = CacheControlAdapter(
+                cache=SafeFileCache(cache),
+                max_retries=retries,
+            )
+            self._trusted_host_adapter = InsecureCacheControlAdapter(
+                cache=SafeFileCache(cache),
+                max_retries=retries,
+            )
+        else:
+            secure_adapter = HTTPAdapter(max_retries=retries)
+            self._trusted_host_adapter = insecure_adapter
+
+        self.mount("https://", secure_adapter)
+        self.mount("http://", insecure_adapter)
+
+        # Enable file:// urls
+        self.mount("file://", LocalFSAdapter())
+
+        for host in trusted_hosts:
+            self.add_trusted_host(host, suppress_logging=True)
+
+    def add_trusted_host(self, host, source=None, suppress_logging=False):
+        # type: (str, Optional[str], bool) -> None
+        """
+        :param host: It is okay to provide a host that has previously been
+            added.
+        :param source: An optional source string, for logging where the host
+            string came from.
+        """
+        if not suppress_logging:
+            msg = 'adding trusted host: {!r}'.format(host)
+            if source is not None:
+                msg += ' (from {})'.format(source)
+            logger.info(msg)
+
+        host_port = parse_netloc(host)
+        if host_port not in self.pip_trusted_origins:
+            self.pip_trusted_origins.append(host_port)
+
+        self.mount(
+            build_url_from_netloc(host) + '/',
+            self._trusted_host_adapter
+        )
+        if not host_port[1]:
+            # Mount wildcard ports for the same host.
+            self.mount(
+                build_url_from_netloc(host) + ':',
+                self._trusted_host_adapter
+            )
+
+    def iter_secure_origins(self):
+        # type: () -> Iterator[SecureOrigin]
+        for secure_origin in SECURE_ORIGINS:
+            yield secure_origin
+        for host, port in self.pip_trusted_origins:
+            yield ('*', host, '*' if port is None else port)
+
+    def is_secure_origin(self, location):
+        # type: (Link) -> bool
+        # Determine if this url used a secure transport mechanism
+        parsed = urllib_parse.urlparse(str(location))
+        origin_protocol, origin_host, origin_port = (
+            parsed.scheme, parsed.hostname, parsed.port,
+        )
+
+        # The protocol to use to see if the protocol matches.
+        # Don't count the repository type as part of the protocol: in
+        # cases such as "git+ssh", only use "ssh". (I.e., Only verify against
+        # the last scheme.)
+        origin_protocol = origin_protocol.rsplit('+', 1)[-1]
+
+        # Determine if our origin is a secure origin by looking through our
+        # hardcoded list of secure origins, as well as any additional ones
+        # configured on this PackageFinder instance.
+        for secure_origin in self.iter_secure_origins():
+            secure_protocol, secure_host, secure_port = secure_origin
+            if origin_protocol != secure_protocol and secure_protocol != "*":
+                continue
+
+            try:
+                addr = ipaddress.ip_address(
+                    None
+                    if origin_host is None
+                    else six.ensure_text(origin_host)
+                )
+                network = ipaddress.ip_network(
+                    six.ensure_text(secure_host)
+                )
+            except ValueError:
+                # We don't have both a valid address or a valid network, so
+                # we'll check this origin against hostnames.
+                if (
+                    origin_host and
+                    origin_host.lower() != secure_host.lower() and
+                    secure_host != "*"
+                ):
+                    continue
+            else:
+                # We have a valid address and network, so see if the address
+                # is contained within the network.
+                if addr not in network:
+                    continue
+
+            # Check to see if the port matches.
+            if (
+                origin_port != secure_port and
+                secure_port != "*" and
+                secure_port is not None
+            ):
+                continue
+
+            # If we've gotten here, then this origin matches the current
+            # secure origin and we should return True
+            return True
+
+        # If we've gotten to this point, then the origin isn't secure and we
+        # will not accept it as a valid location to search. We will however
+        # log a warning that we are ignoring it.
+        logger.warning(
+            "The repository located at %s is not a trusted or secure host and "
+            "is being ignored. If this repository is available via HTTPS we "
+            "recommend you use HTTPS instead, otherwise you may silence "
+            "this warning and allow it anyway with '--trusted-host %s'.",
+            origin_host,
+            origin_host,
+        )
+
+        return False
+
+    def request(self, method, url, *args, **kwargs):
+        # Allow setting a default timeout on a session
+        kwargs.setdefault("timeout", self.timeout)
+
+        # Dispatch the actual request
+        return super(PipSession, self).request(method, url, *args, **kwargs)
diff --git a/venv/Lib/site-packages/pip/_internal/network/utils.py b/venv/Lib/site-packages/pip/_internal/network/utils.py
new file mode 100644
index 000000000..907b3fed4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/utils.py
@@ -0,0 +1,97 @@
+from pip._vendor.requests.models import CONTENT_CHUNK_SIZE, Response
+
+from pip._internal.exceptions import NetworkConnectionError
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, Iterator
+
+# The following comments and HTTP headers were originally added by
+# Donald Stufft in git commit 22c562429a61bb77172039e480873fb239dd8c03.
+#
+# We use Accept-Encoding: identity here because requests defaults to
+# accepting compressed responses. This breaks in a variety of ways
+# depending on how the server is configured.
+# - Some servers will notice that the file isn't a compressible file
+#   and will leave the file alone and with an empty Content-Encoding
+# - Some servers will notice that the file is already compressed and
+#   will leave the file alone, adding a Content-Encoding: gzip header
+# - Some servers won't notice anything at all and will take a file
+#   that's already been compressed and compress it again, and set
+#   the Content-Encoding: gzip header
+# By setting this to request only the identity encoding we're hoping
+# to eliminate the third case.  Hopefully there does not exist a server
+# which when given a file will notice it is already compressed and that
+# you're not asking for a compressed file and will then decompress it
+# before sending because if that's the case I don't think it'll ever be
+# possible to make this work.
+HEADERS = {'Accept-Encoding': 'identity'}  # type: Dict[str, str]
+
+
+def raise_for_status(resp):
+    # type: (Response) -> None
+    http_error_msg = u''
+    if isinstance(resp.reason, bytes):
+        # We attempt to decode utf-8 first because some servers
+        # choose to localize their reason strings. If the string
+        # isn't utf-8, we fall back to iso-8859-1 for all other
+        # encodings.
+        try:
+            reason = resp.reason.decode('utf-8')
+        except UnicodeDecodeError:
+            reason = resp.reason.decode('iso-8859-1')
+    else:
+        reason = resp.reason
+
+    if 400 <= resp.status_code < 500:
+        http_error_msg = u'%s Client Error: %s for url: %s' % (
+            resp.status_code, reason, resp.url)
+
+    elif 500 <= resp.status_code < 600:
+        http_error_msg = u'%s Server Error: %s for url: %s' % (
+            resp.status_code, reason, resp.url)
+
+    if http_error_msg:
+        raise NetworkConnectionError(http_error_msg, response=resp)
+
+
+def response_chunks(response, chunk_size=CONTENT_CHUNK_SIZE):
+    # type: (Response, int) -> Iterator[bytes]
+    """Given a requests Response, provide the data chunks.
+    """
+    try:
+        # Special case for urllib3.
+        for chunk in response.raw.stream(
+            chunk_size,
+            # We use decode_content=False here because we don't
+            # want urllib3 to mess with the raw bytes we get
+            # from the server. If we decompress inside of
+            # urllib3 then we cannot verify the checksum
+            # because the checksum will be of the compressed
+            # file. This breakage will only occur if the
+            # server adds a Content-Encoding header, which
+            # depends on how the server was configured:
+            # - Some servers will notice that the file isn't a
+            #   compressible file and will leave the file alone
+            #   and with an empty Content-Encoding
+            # - Some servers will notice that the file is
+            #   already compressed and will leave the file
+            #   alone and will add a Content-Encoding: gzip
+            #   header
+            # - Some servers won't notice anything at all and
+            #   will take a file that's already been compressed
+            #   and compress it again and set the
+            #   Content-Encoding: gzip header
+            #
+            # By setting this not to decode automatically we
+            # hope to eliminate problems with the second case.
+            decode_content=False,
+        ):
+            yield chunk
+    except AttributeError:
+        # Standard file-like object.
+        while True:
+            chunk = response.raw.read(chunk_size)
+            if not chunk:
+                break
+            yield chunk
diff --git a/venv/Lib/site-packages/pip/_internal/network/xmlrpc.py b/venv/Lib/site-packages/pip/_internal/network/xmlrpc.py
new file mode 100644
index 000000000..e61126241
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/network/xmlrpc.py
@@ -0,0 +1,52 @@
+"""xmlrpclib.Transport implementation
+"""
+
+import logging
+
+# NOTE: XMLRPC Client is not annotated in typeshed as on 2017-07-17, which is
+#       why we ignore the type on this import
+from pip._vendor.six.moves import xmlrpc_client  # type: ignore
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.exceptions import NetworkConnectionError
+from pip._internal.network.utils import raise_for_status
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict
+    from pip._internal.network.session import PipSession
+
+
+logger = logging.getLogger(__name__)
+
+
+class PipXmlrpcTransport(xmlrpc_client.Transport):
+    """Provide a `xmlrpclib.Transport` implementation via a `PipSession`
+    object.
+    """
+
+    def __init__(self, index_url, session, use_datetime=False):
+        # type: (str, PipSession, bool) -> None
+        xmlrpc_client.Transport.__init__(self, use_datetime)
+        index_parts = urllib_parse.urlparse(index_url)
+        self._scheme = index_parts.scheme
+        self._session = session
+
+    def request(self, host, handler, request_body, verbose=False):
+        # type: (str, str, Dict[str, str], bool) -> None
+        parts = (self._scheme, host, handler, None, None, None)
+        url = urllib_parse.urlunparse(parts)
+        try:
+            headers = {'Content-Type': 'text/xml'}
+            response = self._session.post(url, data=request_body,
+                                          headers=headers, stream=True)
+            raise_for_status(response)
+            self.verbose = verbose
+            return self.parse_response(response.raw)
+        except NetworkConnectionError as exc:
+            assert exc.response
+            logger.critical(
+                "HTTP error %s while getting %s",
+                exc.response.status_code, url,
+            )
+            raise
diff --git a/venv/Lib/site-packages/pip/_internal/operations/__init__.py b/venv/Lib/site-packages/pip/_internal/operations/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/operations/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..478908220
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/__pycache__/check.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/check.cpython-36.pyc
new file mode 100644
index 000000000..88e9506a4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/__pycache__/freeze.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/freeze.cpython-36.pyc
new file mode 100644
index 000000000..de4aa9aff
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/freeze.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/__pycache__/prepare.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/prepare.cpython-36.pyc
new file mode 100644
index 000000000..8dd1fc2b3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/__pycache__/prepare.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__init__.py b/venv/Lib/site-packages/pip/_internal/operations/build/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..3ecd464c7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata.cpython-36.pyc
new file mode 100644
index 000000000..6cb9a19a1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata_legacy.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata_legacy.cpython-36.pyc
new file mode 100644
index 000000000..e1e872be0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/metadata_legacy.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..8d0a612f0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel_legacy.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel_legacy.cpython-36.pyc
new file mode 100644
index 000000000..4347b5ac3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/build/__pycache__/wheel_legacy.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/metadata.py b/venv/Lib/site-packages/pip/_internal/operations/build/metadata.py
new file mode 100644
index 000000000..cf52f8d8f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/build/metadata.py
@@ -0,0 +1,37 @@
+"""Metadata generation logic for source distributions.
+"""
+
+import os
+
+from pip._internal.utils.subprocess import runner_with_spinner_message
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from pip._internal.build_env import BuildEnvironment
+    from pip._vendor.pep517.wrappers import Pep517HookCaller
+
+
+def generate_metadata(build_env, backend):
+    # type: (BuildEnvironment, Pep517HookCaller) -> str
+    """Generate metadata using mechanisms described in PEP 517.
+
+    Returns the generated metadata directory.
+    """
+    metadata_tmpdir = TempDirectory(
+        kind="modern-metadata", globally_managed=True
+    )
+
+    metadata_dir = metadata_tmpdir.path
+
+    with build_env:
+        # Note that Pep517HookCaller implements a fallback for
+        # prepare_metadata_for_build_wheel, so we don't have to
+        # consider the possibility that this hook doesn't exist.
+        runner = runner_with_spinner_message("Preparing wheel metadata")
+        with backend.subprocess_runner(runner):
+            distinfo_dir = backend.prepare_metadata_for_build_wheel(
+                metadata_dir
+            )
+
+    return os.path.join(metadata_dir, distinfo_dir)
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/metadata_legacy.py b/venv/Lib/site-packages/pip/_internal/operations/build/metadata_legacy.py
new file mode 100644
index 000000000..14762aef3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/build/metadata_legacy.py
@@ -0,0 +1,77 @@
+"""Metadata generation logic for legacy source distributions.
+"""
+
+import logging
+import os
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.setuptools_build import make_setuptools_egg_info_args
+from pip._internal.utils.subprocess import call_subprocess
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from pip._internal.build_env import BuildEnvironment
+
+logger = logging.getLogger(__name__)
+
+
+def _find_egg_info(directory):
+    # type: (str) -> str
+    """Find an .egg-info subdirectory in `directory`.
+    """
+    filenames = [
+        f for f in os.listdir(directory) if f.endswith(".egg-info")
+    ]
+
+    if not filenames:
+        raise InstallationError(
+            "No .egg-info directory found in {}".format(directory)
+        )
+
+    if len(filenames) > 1:
+        raise InstallationError(
+            "More than one .egg-info directory found in {}".format(
+                directory
+            )
+        )
+
+    return os.path.join(directory, filenames[0])
+
+
+def generate_metadata(
+    build_env,  # type: BuildEnvironment
+    setup_py_path,  # type: str
+    source_dir,  # type: str
+    isolated,  # type: bool
+    details,  # type: str
+):
+    # type: (...) -> str
+    """Generate metadata using setup.py-based defacto mechanisms.
+
+    Returns the generated metadata directory.
+    """
+    logger.debug(
+        'Running setup.py (path:%s) egg_info for package %s',
+        setup_py_path, details,
+    )
+
+    egg_info_dir = TempDirectory(
+        kind="pip-egg-info", globally_managed=True
+    ).path
+
+    args = make_setuptools_egg_info_args(
+        setup_py_path,
+        egg_info_dir=egg_info_dir,
+        no_user_config=isolated,
+    )
+
+    with build_env:
+        call_subprocess(
+            args,
+            cwd=source_dir,
+            command_desc='python setup.py egg_info',
+        )
+
+    # Return the .egg-info directory.
+    return _find_egg_info(egg_info_dir)
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/wheel.py b/venv/Lib/site-packages/pip/_internal/operations/build/wheel.py
new file mode 100644
index 000000000..0c28c4989
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/build/wheel.py
@@ -0,0 +1,46 @@
+import logging
+import os
+
+from pip._internal.utils.subprocess import runner_with_spinner_message
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional
+    from pip._vendor.pep517.wrappers import Pep517HookCaller
+
+logger = logging.getLogger(__name__)
+
+
+def build_wheel_pep517(
+    name,  # type: str
+    backend,  # type: Pep517HookCaller
+    metadata_directory,  # type: str
+    build_options,  # type: List[str]
+    tempd,  # type: str
+):
+    # type: (...) -> Optional[str]
+    """Build one InstallRequirement using the PEP 517 build process.
+
+    Returns path to wheel if successfully built. Otherwise, returns None.
+    """
+    assert metadata_directory is not None
+    if build_options:
+        # PEP 517 does not support --build-options
+        logger.error('Cannot build wheel for %s using PEP 517 when '
+                     '--build-option is present', name)
+        return None
+    try:
+        logger.debug('Destination directory: %s', tempd)
+
+        runner = runner_with_spinner_message(
+            'Building wheel for {} (PEP 517)'.format(name)
+        )
+        with backend.subprocess_runner(runner):
+            wheel_name = backend.build_wheel(
+                tempd,
+                metadata_directory=metadata_directory,
+            )
+    except Exception:
+        logger.error('Failed building wheel for %s', name)
+        return None
+    return os.path.join(tempd, wheel_name)
diff --git a/venv/Lib/site-packages/pip/_internal/operations/build/wheel_legacy.py b/venv/Lib/site-packages/pip/_internal/operations/build/wheel_legacy.py
new file mode 100644
index 000000000..37dc876ac
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/build/wheel_legacy.py
@@ -0,0 +1,115 @@
+import logging
+import os.path
+
+from pip._internal.cli.spinners import open_spinner
+from pip._internal.utils.setuptools_build import (
+    make_setuptools_bdist_wheel_args,
+)
+from pip._internal.utils.subprocess import (
+    LOG_DIVIDER,
+    call_subprocess,
+    format_command_args,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Text
+
+logger = logging.getLogger(__name__)
+
+
+def format_command_result(
+    command_args,  # type: List[str]
+    command_output,  # type: Text
+):
+    # type: (...) -> str
+    """Format command information for logging."""
+    command_desc = format_command_args(command_args)
+    text = 'Command arguments: {}\n'.format(command_desc)
+
+    if not command_output:
+        text += 'Command output: None'
+    elif logger.getEffectiveLevel() > logging.DEBUG:
+        text += 'Command output: [use --verbose to show]'
+    else:
+        if not command_output.endswith('\n'):
+            command_output += '\n'
+        text += 'Command output:\n{}{}'.format(command_output, LOG_DIVIDER)
+
+    return text
+
+
+def get_legacy_build_wheel_path(
+    names,  # type: List[str]
+    temp_dir,  # type: str
+    name,  # type: str
+    command_args,  # type: List[str]
+    command_output,  # type: Text
+):
+    # type: (...) -> Optional[str]
+    """Return the path to the wheel in the temporary build directory."""
+    # Sort for determinism.
+    names = sorted(names)
+    if not names:
+        msg = (
+            'Legacy build of wheel for {!r} created no files.\n'
+        ).format(name)
+        msg += format_command_result(command_args, command_output)
+        logger.warning(msg)
+        return None
+
+    if len(names) > 1:
+        msg = (
+            'Legacy build of wheel for {!r} created more than one file.\n'
+            'Filenames (choosing first): {}\n'
+        ).format(name, names)
+        msg += format_command_result(command_args, command_output)
+        logger.warning(msg)
+
+    return os.path.join(temp_dir, names[0])
+
+
+def build_wheel_legacy(
+    name,  # type: str
+    setup_py_path,  # type: str
+    source_dir,  # type: str
+    global_options,  # type: List[str]
+    build_options,  # type: List[str]
+    tempd,  # type: str
+):
+    # type: (...) -> Optional[str]
+    """Build one unpacked package using the "legacy" build process.
+
+    Returns path to wheel if successfully built. Otherwise, returns None.
+    """
+    wheel_args = make_setuptools_bdist_wheel_args(
+        setup_py_path,
+        global_options=global_options,
+        build_options=build_options,
+        destination_dir=tempd,
+    )
+
+    spin_message = 'Building wheel for {} (setup.py)'.format(name)
+    with open_spinner(spin_message) as spinner:
+        logger.debug('Destination directory: %s', tempd)
+
+        try:
+            output = call_subprocess(
+                wheel_args,
+                cwd=source_dir,
+                spinner=spinner,
+            )
+        except Exception:
+            spinner.finish("error")
+            logger.error('Failed building wheel for %s', name)
+            return None
+
+        names = os.listdir(tempd)
+        wheel_path = get_legacy_build_wheel_path(
+            names=names,
+            temp_dir=tempd,
+            name=name,
+            command_args=wheel_args,
+            command_output=output,
+        )
+        return wheel_path
diff --git a/venv/Lib/site-packages/pip/_internal/operations/check.py b/venv/Lib/site-packages/pip/_internal/operations/check.py
new file mode 100644
index 000000000..5714915bc
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/check.py
@@ -0,0 +1,158 @@
+"""Validation of dependencies of packages
+"""
+
+import logging
+from collections import namedtuple
+
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.pkg_resources import RequirementParseError
+
+from pip._internal.distributions import (
+    make_distribution_for_install_requirement,
+)
+from pip._internal.utils.misc import get_installed_distributions
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+logger = logging.getLogger(__name__)
+
+if MYPY_CHECK_RUNNING:
+    from pip._internal.req.req_install import InstallRequirement
+    from typing import (
+        Any, Callable, Dict, Optional, Set, Tuple, List
+    )
+
+    # Shorthands
+    PackageSet = Dict[str, 'PackageDetails']
+    Missing = Tuple[str, Any]
+    Conflicting = Tuple[str, str, Any]
+
+    MissingDict = Dict[str, List[Missing]]
+    ConflictingDict = Dict[str, List[Conflicting]]
+    CheckResult = Tuple[MissingDict, ConflictingDict]
+    ConflictDetails = Tuple[PackageSet, CheckResult]
+
+PackageDetails = namedtuple('PackageDetails', ['version', 'requires'])
+
+
+def create_package_set_from_installed(**kwargs):
+    # type: (**Any) -> Tuple[PackageSet, bool]
+    """Converts a list of distributions into a PackageSet.
+    """
+    # Default to using all packages installed on the system
+    if kwargs == {}:
+        kwargs = {"local_only": False, "skip": ()}
+
+    package_set = {}
+    problems = False
+    for dist in get_installed_distributions(**kwargs):
+        name = canonicalize_name(dist.project_name)
+        try:
+            package_set[name] = PackageDetails(dist.version, dist.requires())
+        except RequirementParseError as e:
+            # Don't crash on broken metadata
+            logger.warning("Error parsing requirements for %s: %s", name, e)
+            problems = True
+    return package_set, problems
+
+
+def check_package_set(package_set, should_ignore=None):
+    # type: (PackageSet, Optional[Callable[[str], bool]]) -> CheckResult
+    """Check if a package set is consistent
+
+    If should_ignore is passed, it should be a callable that takes a
+    package name and returns a boolean.
+    """
+
+    missing = {}
+    conflicting = {}
+
+    for package_name in package_set:
+        # Info about dependencies of package_name
+        missing_deps = set()  # type: Set[Missing]
+        conflicting_deps = set()  # type: Set[Conflicting]
+
+        if should_ignore and should_ignore(package_name):
+            continue
+
+        for req in package_set[package_name].requires:
+            name = canonicalize_name(req.project_name)  # type: str
+
+            # Check if it's missing
+            if name not in package_set:
+                missed = True
+                if req.marker is not None:
+                    missed = req.marker.evaluate()
+                if missed:
+                    missing_deps.add((name, req))
+                continue
+
+            # Check if there's a conflict
+            version = package_set[name].version  # type: str
+            if not req.specifier.contains(version, prereleases=True):
+                conflicting_deps.add((name, version, req))
+
+        if missing_deps:
+            missing[package_name] = sorted(missing_deps, key=str)
+        if conflicting_deps:
+            conflicting[package_name] = sorted(conflicting_deps, key=str)
+
+    return missing, conflicting
+
+
+def check_install_conflicts(to_install):
+    # type: (List[InstallRequirement]) -> ConflictDetails
+    """For checking if the dependency graph would be consistent after \
+    installing given requirements
+    """
+    # Start from the current state
+    package_set, _ = create_package_set_from_installed()
+    # Install packages
+    would_be_installed = _simulate_installation_of(to_install, package_set)
+
+    # Only warn about directly-dependent packages; create a whitelist of them
+    whitelist = _create_whitelist(would_be_installed, package_set)
+
+    return (
+        package_set,
+        check_package_set(
+            package_set, should_ignore=lambda name: name not in whitelist
+        )
+    )
+
+
+def _simulate_installation_of(to_install, package_set):
+    # type: (List[InstallRequirement], PackageSet) -> Set[str]
+    """Computes the version of packages after installing to_install.
+    """
+
+    # Keep track of packages that were installed
+    installed = set()
+
+    # Modify it as installing requirement_set would (assuming no errors)
+    for inst_req in to_install:
+        abstract_dist = make_distribution_for_install_requirement(inst_req)
+        dist = abstract_dist.get_pkg_resources_distribution()
+
+        assert dist is not None
+        name = canonicalize_name(dist.key)
+        package_set[name] = PackageDetails(dist.version, dist.requires())
+
+        installed.add(name)
+
+    return installed
+
+
+def _create_whitelist(would_be_installed, package_set):
+    # type: (Set[str], PackageSet) -> Set[str]
+    packages_affected = set(would_be_installed)
+
+    for package_name in package_set:
+        if package_name in packages_affected:
+            continue
+
+        for req in package_set[package_name].requires:
+            if canonicalize_name(req.name) in packages_affected:
+                packages_affected.add(package_name)
+                break
+
+    return packages_affected
diff --git a/venv/Lib/site-packages/pip/_internal/operations/freeze.py b/venv/Lib/site-packages/pip/_internal/operations/freeze.py
new file mode 100644
index 000000000..ddb9cb232
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/freeze.py
@@ -0,0 +1,272 @@
+from __future__ import absolute_import
+
+import collections
+import logging
+import os
+
+from pip._vendor import six
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.pkg_resources import RequirementParseError
+
+from pip._internal.exceptions import BadCommand, InstallationError
+from pip._internal.req.constructors import (
+    install_req_from_editable,
+    install_req_from_line,
+)
+from pip._internal.req.req_file import COMMENT_RE
+from pip._internal.utils.direct_url_helpers import (
+    direct_url_as_pep440_direct_reference,
+    dist_get_direct_url,
+)
+from pip._internal.utils.misc import (
+    dist_is_editable,
+    get_installed_distributions,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Iterator, Optional, List, Container, Set, Dict, Tuple, Iterable, Union
+    )
+    from pip._internal.cache import WheelCache
+    from pip._vendor.pkg_resources import (
+        Distribution, Requirement
+    )
+
+    RequirementInfo = Tuple[Optional[Union[str, Requirement]], bool, List[str]]
+
+
+logger = logging.getLogger(__name__)
+
+
+def freeze(
+    requirement=None,  # type: Optional[List[str]]
+    find_links=None,  # type: Optional[List[str]]
+    local_only=False,  # type: bool
+    user_only=False,  # type: bool
+    paths=None,  # type: Optional[List[str]]
+    isolated=False,  # type: bool
+    wheel_cache=None,  # type: Optional[WheelCache]
+    exclude_editable=False,  # type: bool
+    skip=()  # type: Container[str]
+):
+    # type: (...) -> Iterator[str]
+    find_links = find_links or []
+
+    for link in find_links:
+        yield '-f {}'.format(link)
+    installations = {}  # type: Dict[str, FrozenRequirement]
+
+    for dist in get_installed_distributions(
+            local_only=local_only,
+            skip=(),
+            user_only=user_only,
+            paths=paths
+    ):
+        try:
+            req = FrozenRequirement.from_dist(dist)
+        except RequirementParseError as exc:
+            # We include dist rather than dist.project_name because the
+            # dist string includes more information, like the version and
+            # location. We also include the exception message to aid
+            # troubleshooting.
+            logger.warning(
+                'Could not generate requirement for distribution %r: %s',
+                dist, exc
+            )
+            continue
+        if exclude_editable and req.editable:
+            continue
+        installations[req.canonical_name] = req
+
+    if requirement:
+        # the options that don't get turned into an InstallRequirement
+        # should only be emitted once, even if the same option is in multiple
+        # requirements files, so we need to keep track of what has been emitted
+        # so that we don't emit it again if it's seen again
+        emitted_options = set()  # type: Set[str]
+        # keep track of which files a requirement is in so that we can
+        # give an accurate warning if a requirement appears multiple times.
+        req_files = collections.defaultdict(list)  # type: Dict[str, List[str]]
+        for req_file_path in requirement:
+            with open(req_file_path) as req_file:
+                for line in req_file:
+                    if (not line.strip() or
+                            line.strip().startswith('#') or
+                            line.startswith((
+                                '-r', '--requirement',
+                                '-f', '--find-links',
+                                '-i', '--index-url',
+                                '--pre',
+                                '--trusted-host',
+                                '--process-dependency-links',
+                                '--extra-index-url',
+                                '--use-feature'))):
+                        line = line.rstrip()
+                        if line not in emitted_options:
+                            emitted_options.add(line)
+                            yield line
+                        continue
+
+                    if line.startswith('-e') or line.startswith('--editable'):
+                        if line.startswith('-e'):
+                            line = line[2:].strip()
+                        else:
+                            line = line[len('--editable'):].strip().lstrip('=')
+                        line_req = install_req_from_editable(
+                            line,
+                            isolated=isolated,
+                        )
+                    else:
+                        line_req = install_req_from_line(
+                            COMMENT_RE.sub('', line).strip(),
+                            isolated=isolated,
+                        )
+
+                    if not line_req.name:
+                        logger.info(
+                            "Skipping line in requirement file [%s] because "
+                            "it's not clear what it would install: %s",
+                            req_file_path, line.strip(),
+                        )
+                        logger.info(
+                            "  (add #egg=PackageName to the URL to avoid"
+                            " this warning)"
+                        )
+                    else:
+                        line_req_canonical_name = canonicalize_name(
+                            line_req.name)
+                        if line_req_canonical_name not in installations:
+                            # either it's not installed, or it is installed
+                            # but has been processed already
+                            if not req_files[line_req.name]:
+                                logger.warning(
+                                    "Requirement file [%s] contains %s, but "
+                                    "package %r is not installed",
+                                    req_file_path,
+                                    COMMENT_RE.sub('', line).strip(),
+                                    line_req.name
+                                )
+                            else:
+                                req_files[line_req.name].append(req_file_path)
+                        else:
+                            yield str(installations[
+                                line_req_canonical_name]).rstrip()
+                            del installations[line_req_canonical_name]
+                            req_files[line_req.name].append(req_file_path)
+
+        # Warn about requirements that were included multiple times (in a
+        # single requirements file or in different requirements files).
+        for name, files in six.iteritems(req_files):
+            if len(files) > 1:
+                logger.warning("Requirement %s included multiple times [%s]",
+                               name, ', '.join(sorted(set(files))))
+
+        yield(
+            '## The following requirements were added by '
+            'pip freeze:'
+        )
+    for installation in sorted(
+            installations.values(), key=lambda x: x.name.lower()):
+        if installation.canonical_name not in skip:
+            yield str(installation).rstrip()
+
+
+def get_requirement_info(dist):
+    # type: (Distribution) -> RequirementInfo
+    """
+    Compute and return values (req, editable, comments) for use in
+    FrozenRequirement.from_dist().
+    """
+    if not dist_is_editable(dist):
+        return (None, False, [])
+
+    location = os.path.normcase(os.path.abspath(dist.location))
+
+    from pip._internal.vcs import vcs, RemoteNotFoundError
+    vcs_backend = vcs.get_backend_for_dir(location)
+
+    if vcs_backend is None:
+        req = dist.as_requirement()
+        logger.debug(
+            'No VCS found for editable requirement "%s" in: %r', req,
+            location,
+        )
+        comments = [
+            '# Editable install with no version control ({})'.format(req)
+        ]
+        return (location, True, comments)
+
+    try:
+        req = vcs_backend.get_src_requirement(location, dist.project_name)
+    except RemoteNotFoundError:
+        req = dist.as_requirement()
+        comments = [
+            '# Editable {} install with no remote ({})'.format(
+                type(vcs_backend).__name__, req,
+            )
+        ]
+        return (location, True, comments)
+
+    except BadCommand:
+        logger.warning(
+            'cannot determine version of editable source in %s '
+            '(%s command not found in path)',
+            location,
+            vcs_backend.name,
+        )
+        return (None, True, [])
+
+    except InstallationError as exc:
+        logger.warning(
+            "Error when trying to get requirement for VCS system %s, "
+            "falling back to uneditable format", exc
+        )
+    else:
+        if req is not None:
+            return (req, True, [])
+
+    logger.warning(
+        'Could not determine repository location of %s', location
+    )
+    comments = ['## !! Could not determine repository location']
+
+    return (None, False, comments)
+
+
+class FrozenRequirement(object):
+    def __init__(self, name, req, editable, comments=()):
+        # type: (str, Union[str, Requirement], bool, Iterable[str]) -> None
+        self.name = name
+        self.canonical_name = canonicalize_name(name)
+        self.req = req
+        self.editable = editable
+        self.comments = comments
+
+    @classmethod
+    def from_dist(cls, dist):
+        # type: (Distribution) -> FrozenRequirement
+        # TODO `get_requirement_info` is taking care of editable requirements.
+        # TODO This should be refactored when we will add detection of
+        #      editable that provide .dist-info metadata.
+        req, editable, comments = get_requirement_info(dist)
+        if req is None and not editable:
+            # if PEP 610 metadata is present, attempt to use it
+            direct_url = dist_get_direct_url(dist)
+            if direct_url:
+                req = direct_url_as_pep440_direct_reference(
+                    direct_url, dist.project_name
+                )
+                comments = []
+        if req is None:
+            # name==version requirement
+            req = dist.as_requirement()
+
+        return cls(dist.project_name, req, editable, comments=comments)
+
+    def __str__(self):
+        # type: () -> str
+        req = self.req
+        if self.editable:
+            req = '-e {}'.format(req)
+        return '\n'.join(list(self.comments) + [str(req)]) + '\n'
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/__init__.py b/venv/Lib/site-packages/pip/_internal/operations/install/__init__.py
new file mode 100644
index 000000000..24d6a5dd3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/install/__init__.py
@@ -0,0 +1,2 @@
+"""For modules related to installing packages.
+"""
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..583d892d6
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/editable_legacy.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/editable_legacy.cpython-36.pyc
new file mode 100644
index 000000000..bff899174
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/editable_legacy.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/legacy.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/legacy.cpython-36.pyc
new file mode 100644
index 000000000..805e37a7b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/legacy.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..a29272e24
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/operations/install/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/editable_legacy.py b/venv/Lib/site-packages/pip/_internal/operations/install/editable_legacy.py
new file mode 100644
index 000000000..a668a61dc
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/install/editable_legacy.py
@@ -0,0 +1,52 @@
+"""Legacy editable installation process, i.e. `setup.py develop`.
+"""
+import logging
+
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.setuptools_build import make_setuptools_develop_args
+from pip._internal.utils.subprocess import call_subprocess
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Sequence
+
+    from pip._internal.build_env import BuildEnvironment
+
+
+logger = logging.getLogger(__name__)
+
+
+def install_editable(
+    install_options,  # type: List[str]
+    global_options,  # type: Sequence[str]
+    prefix,  # type: Optional[str]
+    home,  # type: Optional[str]
+    use_user_site,  # type: bool
+    name,  # type: str
+    setup_py_path,  # type: str
+    isolated,  # type: bool
+    build_env,  # type: BuildEnvironment
+    unpacked_source_directory,  # type: str
+):
+    # type: (...) -> None
+    """Install a package in editable mode. Most arguments are pass-through
+    to setuptools.
+    """
+    logger.info('Running setup.py develop for %s', name)
+
+    args = make_setuptools_develop_args(
+        setup_py_path,
+        global_options=global_options,
+        install_options=install_options,
+        no_user_config=isolated,
+        prefix=prefix,
+        home=home,
+        use_user_site=use_user_site,
+    )
+
+    with indent_log():
+        with build_env:
+            call_subprocess(
+                args,
+                cwd=unpacked_source_directory,
+            )
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/legacy.py b/venv/Lib/site-packages/pip/_internal/operations/install/legacy.py
new file mode 100644
index 000000000..87227d5fe
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/install/legacy.py
@@ -0,0 +1,130 @@
+"""Legacy installation process, i.e. `setup.py install`.
+"""
+
+import logging
+import os
+import sys
+from distutils.util import change_root
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import ensure_dir
+from pip._internal.utils.setuptools_build import make_setuptools_install_args
+from pip._internal.utils.subprocess import runner_with_spinner_message
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Sequence
+
+    from pip._internal.build_env import BuildEnvironment
+    from pip._internal.models.scheme import Scheme
+
+
+logger = logging.getLogger(__name__)
+
+
+class LegacyInstallFailure(Exception):
+    def __init__(self):
+        # type: () -> None
+        self.parent = sys.exc_info()
+
+
+def install(
+    install_options,  # type: List[str]
+    global_options,  # type: Sequence[str]
+    root,  # type: Optional[str]
+    home,  # type: Optional[str]
+    prefix,  # type: Optional[str]
+    use_user_site,  # type: bool
+    pycompile,  # type: bool
+    scheme,  # type: Scheme
+    setup_py_path,  # type: str
+    isolated,  # type: bool
+    req_name,  # type: str
+    build_env,  # type: BuildEnvironment
+    unpacked_source_directory,  # type: str
+    req_description,  # type: str
+):
+    # type: (...) -> bool
+
+    header_dir = scheme.headers
+
+    with TempDirectory(kind="record") as temp_dir:
+        try:
+            record_filename = os.path.join(temp_dir.path, 'install-record.txt')
+            install_args = make_setuptools_install_args(
+                setup_py_path,
+                global_options=global_options,
+                install_options=install_options,
+                record_filename=record_filename,
+                root=root,
+                prefix=prefix,
+                header_dir=header_dir,
+                home=home,
+                use_user_site=use_user_site,
+                no_user_config=isolated,
+                pycompile=pycompile,
+            )
+
+            runner = runner_with_spinner_message(
+                "Running setup.py install for {}".format(req_name)
+            )
+            with indent_log(), build_env:
+                runner(
+                    cmd=install_args,
+                    cwd=unpacked_source_directory,
+                )
+
+            if not os.path.exists(record_filename):
+                logger.debug('Record file %s not found', record_filename)
+                # Signal to the caller that we didn't install the new package
+                return False
+
+        except Exception:
+            # Signal to the caller that we didn't install the new package
+            raise LegacyInstallFailure
+
+        # At this point, we have successfully installed the requirement.
+
+        # We intentionally do not use any encoding to read the file because
+        # setuptools writes the file using distutils.file_util.write_file,
+        # which does not specify an encoding.
+        with open(record_filename) as f:
+            record_lines = f.read().splitlines()
+
+    def prepend_root(path):
+        # type: (str) -> str
+        if root is None or not os.path.isabs(path):
+            return path
+        else:
+            return change_root(root, path)
+
+    for line in record_lines:
+        directory = os.path.dirname(line)
+        if directory.endswith('.egg-info'):
+            egg_info_dir = prepend_root(directory)
+            break
+    else:
+        message = (
+            "{} did not indicate that it installed an "
+            ".egg-info directory. Only setup.py projects "
+            "generating .egg-info directories are supported."
+        ).format(req_description)
+        raise InstallationError(message)
+
+    new_lines = []
+    for line in record_lines:
+        filename = line.strip()
+        if os.path.isdir(filename):
+            filename += os.path.sep
+        new_lines.append(
+            os.path.relpath(prepend_root(filename), egg_info_dir)
+        )
+    new_lines.sort()
+    ensure_dir(egg_info_dir)
+    inst_files_path = os.path.join(egg_info_dir, 'installed-files.txt')
+    with open(inst_files_path, 'w') as f:
+        f.write('\n'.join(new_lines) + '\n')
+
+    return True
diff --git a/venv/Lib/site-packages/pip/_internal/operations/install/wheel.py b/venv/Lib/site-packages/pip/_internal/operations/install/wheel.py
new file mode 100644
index 000000000..e91b1b8d5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/install/wheel.py
@@ -0,0 +1,861 @@
+"""Support for installing and building the "wheel" binary package format.
+"""
+
+from __future__ import absolute_import
+
+import collections
+import compileall
+import contextlib
+import csv
+import importlib
+import logging
+import os.path
+import re
+import shutil
+import sys
+import warnings
+from base64 import urlsafe_b64encode
+from itertools import chain, starmap
+from zipfile import ZipFile
+
+from pip._vendor import pkg_resources
+from pip._vendor.distlib.scripts import ScriptMaker
+from pip._vendor.distlib.util import get_export_entry
+from pip._vendor.six import (
+    PY2,
+    ensure_str,
+    ensure_text,
+    itervalues,
+    reraise,
+    text_type,
+)
+from pip._vendor.six.moves import filterfalse, map
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.locations import get_major_minor_version
+from pip._internal.models.direct_url import DIRECT_URL_METADATA_NAME, DirectUrl
+from pip._internal.models.scheme import SCHEME_KEYS
+from pip._internal.utils.filesystem import adjacent_tmp_file, replace
+from pip._internal.utils.misc import (
+    captured_stdout,
+    ensure_dir,
+    hash_file,
+    partition,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.unpacking import (
+    current_umask,
+    is_within_directory,
+    set_extracted_file_to_default_mode_plus_executable,
+    zip_item_is_executable,
+)
+from pip._internal.utils.wheel import (
+    parse_wheel,
+    pkg_resources_distribution_for_wheel,
+)
+
+# Use the custom cast function at runtime to make cast work,
+# and import typing.cast when performing pre-commit and type
+# checks
+if not MYPY_CHECK_RUNNING:
+    from pip._internal.utils.typing import cast
+else:
+    from email.message import Message
+    from typing import (
+        Any,
+        Callable,
+        Dict,
+        IO,
+        Iterable,
+        Iterator,
+        List,
+        NewType,
+        Optional,
+        Protocol,
+        Sequence,
+        Set,
+        Tuple,
+        Union,
+        cast,
+    )
+    from zipfile import ZipInfo
+
+    from pip._vendor.pkg_resources import Distribution
+
+    from pip._internal.models.scheme import Scheme
+    from pip._internal.utils.filesystem import NamedTemporaryFileResult
+
+    RecordPath = NewType('RecordPath', text_type)
+    InstalledCSVRow = Tuple[RecordPath, str, Union[int, str]]
+
+    class File(Protocol):
+        src_record_path = None  # type: RecordPath
+        dest_path = None  # type: text_type
+        changed = None  # type: bool
+
+        def save(self):
+            # type: () -> None
+            pass
+
+
+logger = logging.getLogger(__name__)
+
+
+def rehash(path, blocksize=1 << 20):
+    # type: (text_type, int) -> Tuple[str, str]
+    """Return (encoded_digest, length) for path using hashlib.sha256()"""
+    h, length = hash_file(path, blocksize)
+    digest = 'sha256=' + urlsafe_b64encode(
+        h.digest()
+    ).decode('latin1').rstrip('=')
+    # unicode/str python2 issues
+    return (digest, str(length))  # type: ignore
+
+
+def csv_io_kwargs(mode):
+    # type: (str) -> Dict[str, Any]
+    """Return keyword arguments to properly open a CSV file
+    in the given mode.
+    """
+    if PY2:
+        return {'mode': '{}b'.format(mode)}
+    else:
+        return {'mode': mode, 'newline': '', 'encoding': 'utf-8'}
+
+
+def fix_script(path):
+    # type: (text_type) -> bool
+    """Replace #!python with #!/path/to/python
+    Return True if file was changed.
+    """
+    # XXX RECORD hashes will need to be updated
+    assert os.path.isfile(path)
+
+    with open(path, 'rb') as script:
+        firstline = script.readline()
+        if not firstline.startswith(b'#!python'):
+            return False
+        exename = sys.executable.encode(sys.getfilesystemencoding())
+        firstline = b'#!' + exename + os.linesep.encode("ascii")
+        rest = script.read()
+    with open(path, 'wb') as script:
+        script.write(firstline)
+        script.write(rest)
+    return True
+
+
+def wheel_root_is_purelib(metadata):
+    # type: (Message) -> bool
+    return metadata.get("Root-Is-Purelib", "").lower() == "true"
+
+
+def get_entrypoints(distribution):
+    # type: (Distribution) -> Tuple[Dict[str, str], Dict[str, str]]
+    # get the entry points and then the script names
+    try:
+        console = distribution.get_entry_map('console_scripts')
+        gui = distribution.get_entry_map('gui_scripts')
+    except KeyError:
+        # Our dict-based Distribution raises KeyError if entry_points.txt
+        # doesn't exist.
+        return {}, {}
+
+    def _split_ep(s):
+        # type: (pkg_resources.EntryPoint) -> Tuple[str, str]
+        """get the string representation of EntryPoint,
+        remove space and split on '='
+        """
+        split_parts = str(s).replace(" ", "").split("=")
+        return split_parts[0], split_parts[1]
+
+    # convert the EntryPoint objects into strings with module:function
+    console = dict(_split_ep(v) for v in console.values())
+    gui = dict(_split_ep(v) for v in gui.values())
+    return console, gui
+
+
+def message_about_scripts_not_on_PATH(scripts):
+    # type: (Sequence[str]) -> Optional[str]
+    """Determine if any scripts are not on PATH and format a warning.
+    Returns a warning message if one or more scripts are not on PATH,
+    otherwise None.
+    """
+    if not scripts:
+        return None
+
+    # Group scripts by the path they were installed in
+    grouped_by_dir = collections.defaultdict(set)  # type: Dict[str, Set[str]]
+    for destfile in scripts:
+        parent_dir = os.path.dirname(destfile)
+        script_name = os.path.basename(destfile)
+        grouped_by_dir[parent_dir].add(script_name)
+
+    # We don't want to warn for directories that are on PATH.
+    not_warn_dirs = [
+        os.path.normcase(i).rstrip(os.sep) for i in
+        os.environ.get("PATH", "").split(os.pathsep)
+    ]
+    # If an executable sits with sys.executable, we don't warn for it.
+    #     This covers the case of venv invocations without activating the venv.
+    not_warn_dirs.append(os.path.normcase(os.path.dirname(sys.executable)))
+    warn_for = {
+        parent_dir: scripts for parent_dir, scripts in grouped_by_dir.items()
+        if os.path.normcase(parent_dir) not in not_warn_dirs
+    }  # type: Dict[str, Set[str]]
+    if not warn_for:
+        return None
+
+    # Format a message
+    msg_lines = []
+    for parent_dir, dir_scripts in warn_for.items():
+        sorted_scripts = sorted(dir_scripts)  # type: List[str]
+        if len(sorted_scripts) == 1:
+            start_text = "script {} is".format(sorted_scripts[0])
+        else:
+            start_text = "scripts {} are".format(
+                ", ".join(sorted_scripts[:-1]) + " and " + sorted_scripts[-1]
+            )
+
+        msg_lines.append(
+            "The {} installed in '{}' which is not on PATH."
+            .format(start_text, parent_dir)
+        )
+
+    last_line_fmt = (
+        "Consider adding {} to PATH or, if you prefer "
+        "to suppress this warning, use --no-warn-script-location."
+    )
+    if len(msg_lines) == 1:
+        msg_lines.append(last_line_fmt.format("this directory"))
+    else:
+        msg_lines.append(last_line_fmt.format("these directories"))
+
+    # Add a note if any directory starts with ~
+    warn_for_tilde = any(
+        i[0] == "~" for i in os.environ.get("PATH", "").split(os.pathsep) if i
+    )
+    if warn_for_tilde:
+        tilde_warning_msg = (
+            "NOTE: The current PATH contains path(s) starting with `~`, "
+            "which may not be expanded by all applications."
+        )
+        msg_lines.append(tilde_warning_msg)
+
+    # Returns the formatted multiline message
+    return "\n".join(msg_lines)
+
+
+def _normalized_outrows(outrows):
+    # type: (Iterable[InstalledCSVRow]) -> List[Tuple[str, str, str]]
+    """Normalize the given rows of a RECORD file.
+
+    Items in each row are converted into str. Rows are then sorted to make
+    the value more predictable for tests.
+
+    Each row is a 3-tuple (path, hash, size) and corresponds to a record of
+    a RECORD file (see PEP 376 and PEP 427 for details).  For the rows
+    passed to this function, the size can be an integer as an int or string,
+    or the empty string.
+    """
+    # Normally, there should only be one row per path, in which case the
+    # second and third elements don't come into play when sorting.
+    # However, in cases in the wild where a path might happen to occur twice,
+    # we don't want the sort operation to trigger an error (but still want
+    # determinism).  Since the third element can be an int or string, we
+    # coerce each element to a string to avoid a TypeError in this case.
+    # For additional background, see--
+    # https://github.com/pypa/pip/issues/5868
+    return sorted(
+        (ensure_str(record_path, encoding='utf-8'), hash_, str(size))
+        for record_path, hash_, size in outrows
+    )
+
+
+def _record_to_fs_path(record_path):
+    # type: (RecordPath) -> text_type
+    return record_path
+
+
+def _fs_to_record_path(path, relative_to=None):
+    # type: (text_type, Optional[text_type]) -> RecordPath
+    if relative_to is not None:
+        # On Windows, do not handle relative paths if they belong to different
+        # logical disks
+        if os.path.splitdrive(path)[0].lower() == \
+                os.path.splitdrive(relative_to)[0].lower():
+            path = os.path.relpath(path, relative_to)
+    path = path.replace(os.path.sep, '/')
+    return cast('RecordPath', path)
+
+
+def _parse_record_path(record_column):
+    # type: (str) -> RecordPath
+    p = ensure_text(record_column, encoding='utf-8')
+    return cast('RecordPath', p)
+
+
+def get_csv_rows_for_installed(
+    old_csv_rows,  # type: List[List[str]]
+    installed,  # type: Dict[RecordPath, RecordPath]
+    changed,  # type: Set[RecordPath]
+    generated,  # type: List[str]
+    lib_dir,  # type: str
+):
+    # type: (...) -> List[InstalledCSVRow]
+    """
+    :param installed: A map from archive RECORD path to installation RECORD
+        path.
+    """
+    installed_rows = []  # type: List[InstalledCSVRow]
+    for row in old_csv_rows:
+        if len(row) > 3:
+            logger.warning('RECORD line has more than three elements: %s', row)
+        old_record_path = _parse_record_path(row[0])
+        new_record_path = installed.pop(old_record_path, old_record_path)
+        if new_record_path in changed:
+            digest, length = rehash(_record_to_fs_path(new_record_path))
+        else:
+            digest = row[1] if len(row) > 1 else ''
+            length = row[2] if len(row) > 2 else ''
+        installed_rows.append((new_record_path, digest, length))
+    for f in generated:
+        path = _fs_to_record_path(f, lib_dir)
+        digest, length = rehash(f)
+        installed_rows.append((path, digest, length))
+    for installed_record_path in itervalues(installed):
+        installed_rows.append((installed_record_path, '', ''))
+    return installed_rows
+
+
+def get_console_script_specs(console):
+    # type: (Dict[str, str]) -> List[str]
+    """
+    Given the mapping from entrypoint name to callable, return the relevant
+    console script specs.
+    """
+    # Don't mutate caller's version
+    console = console.copy()
+
+    scripts_to_generate = []
+
+    # Special case pip and setuptools to generate versioned wrappers
+    #
+    # The issue is that some projects (specifically, pip and setuptools) use
+    # code in setup.py to create "versioned" entry points - pip2.7 on Python
+    # 2.7, pip3.3 on Python 3.3, etc. But these entry points are baked into
+    # the wheel metadata at build time, and so if the wheel is installed with
+    # a *different* version of Python the entry points will be wrong. The
+    # correct fix for this is to enhance the metadata to be able to describe
+    # such versioned entry points, but that won't happen till Metadata 2.0 is
+    # available.
+    # In the meantime, projects using versioned entry points will either have
+    # incorrect versioned entry points, or they will not be able to distribute
+    # "universal" wheels (i.e., they will need a wheel per Python version).
+    #
+    # Because setuptools and pip are bundled with _ensurepip and virtualenv,
+    # we need to use universal wheels. So, as a stopgap until Metadata 2.0, we
+    # override the versioned entry points in the wheel and generate the
+    # correct ones. This code is purely a short-term measure until Metadata 2.0
+    # is available.
+    #
+    # To add the level of hack in this section of code, in order to support
+    # ensurepip this code will look for an ``ENSUREPIP_OPTIONS`` environment
+    # variable which will control which version scripts get installed.
+    #
+    # ENSUREPIP_OPTIONS=altinstall
+    #   - Only pipX.Y and easy_install-X.Y will be generated and installed
+    # ENSUREPIP_OPTIONS=install
+    #   - pipX.Y, pipX, easy_install-X.Y will be generated and installed. Note
+    #     that this option is technically if ENSUREPIP_OPTIONS is set and is
+    #     not altinstall
+    # DEFAULT
+    #   - The default behavior is to install pip, pipX, pipX.Y, easy_install
+    #     and easy_install-X.Y.
+    pip_script = console.pop('pip', None)
+    if pip_script:
+        if "ENSUREPIP_OPTIONS" not in os.environ:
+            scripts_to_generate.append('pip = ' + pip_script)
+
+        if os.environ.get("ENSUREPIP_OPTIONS", "") != "altinstall":
+            scripts_to_generate.append(
+                'pip{} = {}'.format(sys.version_info[0], pip_script)
+            )
+
+        scripts_to_generate.append(
+            'pip{} = {}'.format(get_major_minor_version(), pip_script)
+        )
+        # Delete any other versioned pip entry points
+        pip_ep = [k for k in console if re.match(r'pip(\d(\.\d)?)?$', k)]
+        for k in pip_ep:
+            del console[k]
+    easy_install_script = console.pop('easy_install', None)
+    if easy_install_script:
+        if "ENSUREPIP_OPTIONS" not in os.environ:
+            scripts_to_generate.append(
+                'easy_install = ' + easy_install_script
+            )
+
+        scripts_to_generate.append(
+            'easy_install-{} = {}'.format(
+                get_major_minor_version(), easy_install_script
+            )
+        )
+        # Delete any other versioned easy_install entry points
+        easy_install_ep = [
+            k for k in console if re.match(r'easy_install(-\d\.\d)?$', k)
+        ]
+        for k in easy_install_ep:
+            del console[k]
+
+    # Generate the console entry points specified in the wheel
+    scripts_to_generate.extend(starmap('{} = {}'.format, console.items()))
+
+    return scripts_to_generate
+
+
+class ZipBackedFile(object):
+    def __init__(self, src_record_path, dest_path, zip_file):
+        # type: (RecordPath, text_type, ZipFile) -> None
+        self.src_record_path = src_record_path
+        self.dest_path = dest_path
+        self._zip_file = zip_file
+        self.changed = False
+
+    def _getinfo(self):
+        # type: () -> ZipInfo
+        if not PY2:
+            return self._zip_file.getinfo(self.src_record_path)
+        # Python 2 does not expose a way to detect a ZIP's encoding, but the
+        # wheel specification (PEP 427) explicitly mandates that paths should
+        # use UTF-8, so we assume it is true.
+        return self._zip_file.getinfo(self.src_record_path.encode("utf-8"))
+
+    def save(self):
+        # type: () -> None
+        # directory creation is lazy and after file filtering
+        # to ensure we don't install empty dirs; empty dirs can't be
+        # uninstalled.
+        parent_dir = os.path.dirname(self.dest_path)
+        ensure_dir(parent_dir)
+
+        # When we open the output file below, any existing file is truncated
+        # before we start writing the new contents. This is fine in most
+        # cases, but can cause a segfault if pip has loaded a shared
+        # object (e.g. from pyopenssl through its vendored urllib3)
+        # Since the shared object is mmap'd an attempt to call a
+        # symbol in it will then cause a segfault. Unlinking the file
+        # allows writing of new contents while allowing the process to
+        # continue to use the old copy.
+        if os.path.exists(self.dest_path):
+            os.unlink(self.dest_path)
+
+        zipinfo = self._getinfo()
+
+        with self._zip_file.open(zipinfo) as f:
+            with open(self.dest_path, "wb") as dest:
+                shutil.copyfileobj(f, dest)
+
+        if zip_item_is_executable(zipinfo):
+            set_extracted_file_to_default_mode_plus_executable(self.dest_path)
+
+
+class ScriptFile(object):
+    def __init__(self, file):
+        # type: (File) -> None
+        self._file = file
+        self.src_record_path = self._file.src_record_path
+        self.dest_path = self._file.dest_path
+        self.changed = False
+
+    def save(self):
+        # type: () -> None
+        self._file.save()
+        self.changed = fix_script(self.dest_path)
+
+
+class MissingCallableSuffix(InstallationError):
+    def __init__(self, entry_point):
+        # type: (str) -> None
+        super(MissingCallableSuffix, self).__init__(
+            "Invalid script entry point: {} - A callable "
+            "suffix is required. Cf https://packaging.python.org/"
+            "specifications/entry-points/#use-for-scripts for more "
+            "information.".format(entry_point)
+        )
+
+
+def _raise_for_invalid_entrypoint(specification):
+    # type: (str) -> None
+    entry = get_export_entry(specification)
+    if entry is not None and entry.suffix is None:
+        raise MissingCallableSuffix(str(entry))
+
+
+class PipScriptMaker(ScriptMaker):
+    def make(self, specification, options=None):
+        # type: (str, Dict[str, Any]) -> List[str]
+        _raise_for_invalid_entrypoint(specification)
+        return super(PipScriptMaker, self).make(specification, options)
+
+
+def _install_wheel(
+    name,  # type: str
+    wheel_zip,  # type: ZipFile
+    wheel_path,  # type: str
+    scheme,  # type: Scheme
+    pycompile=True,  # type: bool
+    warn_script_location=True,  # type: bool
+    direct_url=None,  # type: Optional[DirectUrl]
+    requested=False,  # type: bool
+):
+    # type: (...) -> None
+    """Install a wheel.
+
+    :param name: Name of the project to install
+    :param wheel_zip: open ZipFile for wheel being installed
+    :param scheme: Distutils scheme dictating the install directories
+    :param req_description: String used in place of the requirement, for
+        logging
+    :param pycompile: Whether to byte-compile installed Python files
+    :param warn_script_location: Whether to check that scripts are installed
+        into a directory on PATH
+    :raises UnsupportedWheel:
+        * when the directory holds an unpacked wheel with incompatible
+          Wheel-Version
+        * when the .dist-info dir does not match the wheel
+    """
+    info_dir, metadata = parse_wheel(wheel_zip, name)
+
+    if wheel_root_is_purelib(metadata):
+        lib_dir = scheme.purelib
+    else:
+        lib_dir = scheme.platlib
+
+    # Record details of the files moved
+    #   installed = files copied from the wheel to the destination
+    #   changed = files changed while installing (scripts #! line typically)
+    #   generated = files newly generated during the install (script wrappers)
+    installed = {}  # type: Dict[RecordPath, RecordPath]
+    changed = set()  # type: Set[RecordPath]
+    generated = []  # type: List[str]
+
+    def record_installed(srcfile, destfile, modified=False):
+        # type: (RecordPath, text_type, bool) -> None
+        """Map archive RECORD paths to installation RECORD paths."""
+        newpath = _fs_to_record_path(destfile, lib_dir)
+        installed[srcfile] = newpath
+        if modified:
+            changed.add(_fs_to_record_path(destfile))
+
+    def all_paths():
+        # type: () -> Iterable[RecordPath]
+        names = wheel_zip.namelist()
+        # If a flag is set, names may be unicode in Python 2. We convert to
+        # text explicitly so these are valid for lookup in RECORD.
+        decoded_names = map(ensure_text, names)
+        for name in decoded_names:
+            yield cast("RecordPath", name)
+
+    def is_dir_path(path):
+        # type: (RecordPath) -> bool
+        return path.endswith("/")
+
+    def assert_no_path_traversal(dest_dir_path, target_path):
+        # type: (text_type, text_type) -> None
+        if not is_within_directory(dest_dir_path, target_path):
+            message = (
+                "The wheel {!r} has a file {!r} trying to install"
+                " outside the target directory {!r}"
+            )
+            raise InstallationError(
+                message.format(wheel_path, target_path, dest_dir_path)
+            )
+
+    def root_scheme_file_maker(zip_file, dest):
+        # type: (ZipFile, text_type) -> Callable[[RecordPath], File]
+        def make_root_scheme_file(record_path):
+            # type: (RecordPath) -> File
+            normed_path = os.path.normpath(record_path)
+            dest_path = os.path.join(dest, normed_path)
+            assert_no_path_traversal(dest, dest_path)
+            return ZipBackedFile(record_path, dest_path, zip_file)
+
+        return make_root_scheme_file
+
+    def data_scheme_file_maker(zip_file, scheme):
+        # type: (ZipFile, Scheme) -> Callable[[RecordPath], File]
+        scheme_paths = {}
+        for key in SCHEME_KEYS:
+            encoded_key = ensure_text(key)
+            scheme_paths[encoded_key] = ensure_text(
+                getattr(scheme, key), encoding=sys.getfilesystemencoding()
+            )
+
+        def make_data_scheme_file(record_path):
+            # type: (RecordPath) -> File
+            normed_path = os.path.normpath(record_path)
+            try:
+                _, scheme_key, dest_subpath = normed_path.split(os.path.sep, 2)
+            except ValueError:
+                message = (
+                    "Unexpected file in {}: {!r}. .data directory contents"
+                    " should be named like: '<scheme key>/<path>'."
+                ).format(wheel_path, record_path)
+                raise InstallationError(message)
+
+            try:
+                scheme_path = scheme_paths[scheme_key]
+            except KeyError:
+                valid_scheme_keys = ", ".join(sorted(scheme_paths))
+                message = (
+                    "Unknown scheme key used in {}: {} (for file {!r}). .data"
+                    " directory contents should be in subdirectories named"
+                    " with a valid scheme key ({})"
+                ).format(
+                    wheel_path, scheme_key, record_path, valid_scheme_keys
+                )
+                raise InstallationError(message)
+
+            dest_path = os.path.join(scheme_path, dest_subpath)
+            assert_no_path_traversal(scheme_path, dest_path)
+            return ZipBackedFile(record_path, dest_path, zip_file)
+
+        return make_data_scheme_file
+
+    def is_data_scheme_path(path):
+        # type: (RecordPath) -> bool
+        return path.split("/", 1)[0].endswith(".data")
+
+    paths = all_paths()
+    file_paths = filterfalse(is_dir_path, paths)
+    root_scheme_paths, data_scheme_paths = partition(
+        is_data_scheme_path, file_paths
+    )
+
+    make_root_scheme_file = root_scheme_file_maker(
+        wheel_zip,
+        ensure_text(lib_dir, encoding=sys.getfilesystemencoding()),
+    )
+    files = map(make_root_scheme_file, root_scheme_paths)
+
+    def is_script_scheme_path(path):
+        # type: (RecordPath) -> bool
+        parts = path.split("/", 2)
+        return (
+            len(parts) > 2 and
+            parts[0].endswith(".data") and
+            parts[1] == "scripts"
+        )
+
+    other_scheme_paths, script_scheme_paths = partition(
+        is_script_scheme_path, data_scheme_paths
+    )
+
+    make_data_scheme_file = data_scheme_file_maker(wheel_zip, scheme)
+    other_scheme_files = map(make_data_scheme_file, other_scheme_paths)
+    files = chain(files, other_scheme_files)
+
+    # Get the defined entry points
+    distribution = pkg_resources_distribution_for_wheel(
+        wheel_zip, name, wheel_path
+    )
+    console, gui = get_entrypoints(distribution)
+
+    def is_entrypoint_wrapper(file):
+        # type: (File) -> bool
+        # EP, EP.exe and EP-script.py are scripts generated for
+        # entry point EP by setuptools
+        path = file.dest_path
+        name = os.path.basename(path)
+        if name.lower().endswith('.exe'):
+            matchname = name[:-4]
+        elif name.lower().endswith('-script.py'):
+            matchname = name[:-10]
+        elif name.lower().endswith(".pya"):
+            matchname = name[:-4]
+        else:
+            matchname = name
+        # Ignore setuptools-generated scripts
+        return (matchname in console or matchname in gui)
+
+    script_scheme_files = map(make_data_scheme_file, script_scheme_paths)
+    script_scheme_files = filterfalse(
+        is_entrypoint_wrapper, script_scheme_files
+    )
+    script_scheme_files = map(ScriptFile, script_scheme_files)
+    files = chain(files, script_scheme_files)
+
+    for file in files:
+        file.save()
+        record_installed(file.src_record_path, file.dest_path, file.changed)
+
+    def pyc_source_file_paths():
+        # type: () -> Iterator[text_type]
+        # We de-duplicate installation paths, since there can be overlap (e.g.
+        # file in .data maps to same location as file in wheel root).
+        # Sorting installation paths makes it easier to reproduce and debug
+        # issues related to permissions on existing files.
+        for installed_path in sorted(set(installed.values())):
+            full_installed_path = os.path.join(lib_dir, installed_path)
+            if not os.path.isfile(full_installed_path):
+                continue
+            if not full_installed_path.endswith('.py'):
+                continue
+            yield full_installed_path
+
+    def pyc_output_path(path):
+        # type: (text_type) -> text_type
+        """Return the path the pyc file would have been written to.
+        """
+        if PY2:
+            if sys.flags.optimize:
+                return path + 'o'
+            else:
+                return path + 'c'
+        else:
+            return importlib.util.cache_from_source(path)
+
+    # Compile all of the pyc files for the installed files
+    if pycompile:
+        with captured_stdout() as stdout:
+            with warnings.catch_warnings():
+                warnings.filterwarnings('ignore')
+                for path in pyc_source_file_paths():
+                    # Python 2's `compileall.compile_file` requires a str in
+                    # error cases, so we must convert to the native type.
+                    path_arg = ensure_str(
+                        path, encoding=sys.getfilesystemencoding()
+                    )
+                    success = compileall.compile_file(
+                        path_arg, force=True, quiet=True
+                    )
+                    if success:
+                        pyc_path = pyc_output_path(path)
+                        assert os.path.exists(pyc_path)
+                        pyc_record_path = cast(
+                            "RecordPath", pyc_path.replace(os.path.sep, "/")
+                        )
+                        record_installed(pyc_record_path, pyc_path)
+        logger.debug(stdout.getvalue())
+
+    maker = PipScriptMaker(None, scheme.scripts)
+
+    # Ensure old scripts are overwritten.
+    # See https://github.com/pypa/pip/issues/1800
+    maker.clobber = True
+
+    # Ensure we don't generate any variants for scripts because this is almost
+    # never what somebody wants.
+    # See https://bitbucket.org/pypa/distlib/issue/35/
+    maker.variants = {''}
+
+    # This is required because otherwise distlib creates scripts that are not
+    # executable.
+    # See https://bitbucket.org/pypa/distlib/issue/32/
+    maker.set_mode = True
+
+    # Generate the console and GUI entry points specified in the wheel
+    scripts_to_generate = get_console_script_specs(console)
+
+    gui_scripts_to_generate = list(starmap('{} = {}'.format, gui.items()))
+
+    generated_console_scripts = maker.make_multiple(scripts_to_generate)
+    generated.extend(generated_console_scripts)
+
+    generated.extend(
+        maker.make_multiple(gui_scripts_to_generate, {'gui': True})
+    )
+
+    if warn_script_location:
+        msg = message_about_scripts_not_on_PATH(generated_console_scripts)
+        if msg is not None:
+            logger.warning(msg)
+
+    generated_file_mode = 0o666 & ~current_umask()
+
+    @contextlib.contextmanager
+    def _generate_file(path, **kwargs):
+        # type: (str, **Any) -> Iterator[NamedTemporaryFileResult]
+        with adjacent_tmp_file(path, **kwargs) as f:
+            yield f
+        os.chmod(f.name, generated_file_mode)
+        replace(f.name, path)
+
+    dest_info_dir = os.path.join(lib_dir, info_dir)
+
+    # Record pip as the installer
+    installer_path = os.path.join(dest_info_dir, 'INSTALLER')
+    with _generate_file(installer_path) as installer_file:
+        installer_file.write(b'pip\n')
+    generated.append(installer_path)
+
+    # Record the PEP 610 direct URL reference
+    if direct_url is not None:
+        direct_url_path = os.path.join(dest_info_dir, DIRECT_URL_METADATA_NAME)
+        with _generate_file(direct_url_path) as direct_url_file:
+            direct_url_file.write(direct_url.to_json().encode("utf-8"))
+        generated.append(direct_url_path)
+
+    # Record the REQUESTED file
+    if requested:
+        requested_path = os.path.join(dest_info_dir, 'REQUESTED')
+        with open(requested_path, "w"):
+            pass
+        generated.append(requested_path)
+
+    record_text = distribution.get_metadata('RECORD')
+    record_rows = list(csv.reader(record_text.splitlines()))
+
+    rows = get_csv_rows_for_installed(
+        record_rows,
+        installed=installed,
+        changed=changed,
+        generated=generated,
+        lib_dir=lib_dir)
+
+    # Record details of all files installed
+    record_path = os.path.join(dest_info_dir, 'RECORD')
+
+    with _generate_file(record_path, **csv_io_kwargs('w')) as record_file:
+        # The type mypy infers for record_file is different for Python 3
+        # (typing.IO[Any]) and Python 2 (typing.BinaryIO). We explicitly
+        # cast to typing.IO[str] as a workaround.
+        writer = csv.writer(cast('IO[str]', record_file))
+        writer.writerows(_normalized_outrows(rows))
+
+
+@contextlib.contextmanager
+def req_error_context(req_description):
+    # type: (str) -> Iterator[None]
+    try:
+        yield
+    except InstallationError as e:
+        message = "For req: {}. {}".format(req_description, e.args[0])
+        reraise(
+            InstallationError, InstallationError(message), sys.exc_info()[2]
+        )
+
+
+def install_wheel(
+    name,  # type: str
+    wheel_path,  # type: str
+    scheme,  # type: Scheme
+    req_description,  # type: str
+    pycompile=True,  # type: bool
+    warn_script_location=True,  # type: bool
+    direct_url=None,  # type: Optional[DirectUrl]
+    requested=False,  # type: bool
+):
+    # type: (...) -> None
+    with ZipFile(wheel_path, allowZip64=True) as z:
+        with req_error_context(req_description):
+            _install_wheel(
+                name=name,
+                wheel_zip=z,
+                wheel_path=wheel_path,
+                scheme=scheme,
+                pycompile=pycompile,
+                warn_script_location=warn_script_location,
+                direct_url=direct_url,
+                requested=requested,
+            )
diff --git a/venv/Lib/site-packages/pip/_internal/operations/prepare.py b/venv/Lib/site-packages/pip/_internal/operations/prepare.py
new file mode 100644
index 000000000..a5455fcc8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/operations/prepare.py
@@ -0,0 +1,562 @@
+"""Prepares a distribution for installation
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+import logging
+import mimetypes
+import os
+import shutil
+
+from pip._vendor.six import PY2
+
+from pip._internal.distributions import (
+    make_distribution_for_install_requirement,
+)
+from pip._internal.distributions.installed import InstalledDistribution
+from pip._internal.exceptions import (
+    DirectoryUrlHashUnsupported,
+    HashMismatch,
+    HashUnpinned,
+    InstallationError,
+    NetworkConnectionError,
+    PreviousBuildDirError,
+    VcsHashUnsupported,
+)
+from pip._internal.utils.filesystem import copy2_fixed
+from pip._internal.utils.hashes import MissingHashes
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import (
+    display_path,
+    hide_url,
+    path_to_display,
+    rmtree,
+)
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.unpacking import unpack_file
+from pip._internal.vcs import vcs
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Callable, List, Optional, Tuple,
+    )
+
+    from mypy_extensions import TypedDict
+
+    from pip._internal.distributions import AbstractDistribution
+    from pip._internal.index.package_finder import PackageFinder
+    from pip._internal.models.link import Link
+    from pip._internal.network.download import Downloader
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.req.req_tracker import RequirementTracker
+    from pip._internal.utils.hashes import Hashes
+
+    if PY2:
+        CopytreeKwargs = TypedDict(
+            'CopytreeKwargs',
+            {
+                'ignore': Callable[[str, List[str]], List[str]],
+                'symlinks': bool,
+            },
+            total=False,
+        )
+    else:
+        CopytreeKwargs = TypedDict(
+            'CopytreeKwargs',
+            {
+                'copy_function': Callable[[str, str], None],
+                'ignore': Callable[[str, List[str]], List[str]],
+                'ignore_dangling_symlinks': bool,
+                'symlinks': bool,
+            },
+            total=False,
+        )
+
+logger = logging.getLogger(__name__)
+
+
+def _get_prepared_distribution(
+        req,  # type: InstallRequirement
+        req_tracker,  # type: RequirementTracker
+        finder,  # type: PackageFinder
+        build_isolation  # type: bool
+):
+    # type: (...) -> AbstractDistribution
+    """Prepare a distribution for installation.
+    """
+    abstract_dist = make_distribution_for_install_requirement(req)
+    with req_tracker.track(req):
+        abstract_dist.prepare_distribution_metadata(finder, build_isolation)
+    return abstract_dist
+
+
+def unpack_vcs_link(link, location):
+    # type: (Link, str) -> None
+    vcs_backend = vcs.get_backend_for_scheme(link.scheme)
+    assert vcs_backend is not None
+    vcs_backend.unpack(location, url=hide_url(link.url))
+
+
+class File(object):
+    def __init__(self, path, content_type):
+        # type: (str, str) -> None
+        self.path = path
+        self.content_type = content_type
+
+
+def get_http_url(
+    link,  # type: Link
+    downloader,  # type: Downloader
+    download_dir=None,  # type: Optional[str]
+    hashes=None,  # type: Optional[Hashes]
+):
+    # type: (...) -> File
+    temp_dir = TempDirectory(kind="unpack", globally_managed=True)
+    # If a download dir is specified, is the file already downloaded there?
+    already_downloaded_path = None
+    if download_dir:
+        already_downloaded_path = _check_download_dir(
+            link, download_dir, hashes
+        )
+
+    if already_downloaded_path:
+        from_path = already_downloaded_path
+        content_type = mimetypes.guess_type(from_path)[0]
+    else:
+        # let's download to a tmp dir
+        from_path, content_type = _download_http_url(
+            link, downloader, temp_dir.path, hashes
+        )
+
+    return File(from_path, content_type)
+
+
+def _copy2_ignoring_special_files(src, dest):
+    # type: (str, str) -> None
+    """Copying special files is not supported, but as a convenience to users
+    we skip errors copying them. This supports tools that may create e.g.
+    socket files in the project source directory.
+    """
+    try:
+        copy2_fixed(src, dest)
+    except shutil.SpecialFileError as e:
+        # SpecialFileError may be raised due to either the source or
+        # destination. If the destination was the cause then we would actually
+        # care, but since the destination directory is deleted prior to
+        # copy we ignore all of them assuming it is caused by the source.
+        logger.warning(
+            "Ignoring special file error '%s' encountered copying %s to %s.",
+            str(e),
+            path_to_display(src),
+            path_to_display(dest),
+        )
+
+
+def _copy_source_tree(source, target):
+    # type: (str, str) -> None
+    target_abspath = os.path.abspath(target)
+    target_basename = os.path.basename(target_abspath)
+    target_dirname = os.path.dirname(target_abspath)
+
+    def ignore(d, names):
+        # type: (str, List[str]) -> List[str]
+        skipped = []  # type: List[str]
+        if d == source:
+            # Pulling in those directories can potentially be very slow,
+            # exclude the following directories if they appear in the top
+            # level dir (and only it).
+            # See discussion at https://github.com/pypa/pip/pull/6770
+            skipped += ['.tox', '.nox']
+        if os.path.abspath(d) == target_dirname:
+            # Prevent an infinite recursion if the target is in source.
+            # This can happen when TMPDIR is set to ${PWD}/...
+            # and we copy PWD to TMPDIR.
+            skipped += [target_basename]
+        return skipped
+
+    kwargs = dict(ignore=ignore, symlinks=True)  # type: CopytreeKwargs
+
+    if not PY2:
+        # Python 2 does not support copy_function, so we only ignore
+        # errors on special file copy in Python 3.
+        kwargs['copy_function'] = _copy2_ignoring_special_files
+
+    shutil.copytree(source, target, **kwargs)
+
+
+def get_file_url(
+    link,  # type: Link
+    download_dir=None,  # type: Optional[str]
+    hashes=None  # type: Optional[Hashes]
+):
+    # type: (...) -> File
+    """Get file and optionally check its hash.
+    """
+    # If a download dir is specified, is the file already there and valid?
+    already_downloaded_path = None
+    if download_dir:
+        already_downloaded_path = _check_download_dir(
+            link, download_dir, hashes
+        )
+
+    if already_downloaded_path:
+        from_path = already_downloaded_path
+    else:
+        from_path = link.file_path
+
+    # If --require-hashes is off, `hashes` is either empty, the
+    # link's embedded hash, or MissingHashes; it is required to
+    # match. If --require-hashes is on, we are satisfied by any
+    # hash in `hashes` matching: a URL-based or an option-based
+    # one; no internet-sourced hash will be in `hashes`.
+    if hashes:
+        hashes.check_against_path(from_path)
+
+    content_type = mimetypes.guess_type(from_path)[0]
+
+    return File(from_path, content_type)
+
+
+def unpack_url(
+    link,  # type: Link
+    location,  # type: str
+    downloader,  # type: Downloader
+    download_dir=None,  # type: Optional[str]
+    hashes=None,  # type: Optional[Hashes]
+):
+    # type: (...) -> Optional[File]
+    """Unpack link into location, downloading if required.
+
+    :param hashes: A Hashes object, one of whose embedded hashes must match,
+        or HashMismatch will be raised. If the Hashes is empty, no matches are
+        required, and unhashable types of requirements (like VCS ones, which
+        would ordinarily raise HashUnsupported) are allowed.
+    """
+    # non-editable vcs urls
+    if link.is_vcs:
+        unpack_vcs_link(link, location)
+        return None
+
+    # If it's a url to a local directory
+    if link.is_existing_dir():
+        if os.path.isdir(location):
+            rmtree(location)
+        _copy_source_tree(link.file_path, location)
+        return None
+
+    # file urls
+    if link.is_file:
+        file = get_file_url(link, download_dir, hashes=hashes)
+
+    # http urls
+    else:
+        file = get_http_url(
+            link,
+            downloader,
+            download_dir,
+            hashes=hashes,
+        )
+
+    # unpack the archive to the build dir location. even when only downloading
+    # archives, they have to be unpacked to parse dependencies, except wheels
+    if not link.is_wheel:
+        unpack_file(file.path, location, file.content_type)
+
+    return file
+
+
+def _download_http_url(
+    link,  # type: Link
+    downloader,  # type: Downloader
+    temp_dir,  # type: str
+    hashes,  # type: Optional[Hashes]
+):
+    # type: (...) -> Tuple[str, str]
+    """Download link url into temp_dir using provided session"""
+    download = downloader(link)
+
+    file_path = os.path.join(temp_dir, download.filename)
+    with open(file_path, 'wb') as content_file:
+        for chunk in download.chunks:
+            content_file.write(chunk)
+
+    if hashes:
+        hashes.check_against_path(file_path)
+
+    return file_path, download.response.headers.get('content-type', '')
+
+
+def _check_download_dir(link, download_dir, hashes):
+    # type: (Link, str, Optional[Hashes]) -> Optional[str]
+    """ Check download_dir for previously downloaded file with correct hash
+        If a correct file is found return its path else None
+    """
+    download_path = os.path.join(download_dir, link.filename)
+
+    if not os.path.exists(download_path):
+        return None
+
+    # If already downloaded, does its hash match?
+    logger.info('File was already downloaded %s', download_path)
+    if hashes:
+        try:
+            hashes.check_against_path(download_path)
+        except HashMismatch:
+            logger.warning(
+                'Previously-downloaded file %s has bad hash. '
+                'Re-downloading.',
+                download_path
+            )
+            os.unlink(download_path)
+            return None
+    return download_path
+
+
+class RequirementPreparer(object):
+    """Prepares a Requirement
+    """
+
+    def __init__(
+        self,
+        build_dir,  # type: str
+        download_dir,  # type: Optional[str]
+        src_dir,  # type: str
+        wheel_download_dir,  # type: Optional[str]
+        build_isolation,  # type: bool
+        req_tracker,  # type: RequirementTracker
+        downloader,  # type: Downloader
+        finder,  # type: PackageFinder
+        require_hashes,  # type: bool
+        use_user_site,  # type: bool
+    ):
+        # type: (...) -> None
+        super(RequirementPreparer, self).__init__()
+
+        self.src_dir = src_dir
+        self.build_dir = build_dir
+        self.req_tracker = req_tracker
+        self.downloader = downloader
+        self.finder = finder
+
+        # Where still-packed archives should be written to. If None, they are
+        # not saved, and are deleted immediately after unpacking.
+        self.download_dir = download_dir
+
+        # Where still-packed .whl files should be written to. If None, they are
+        # written to the download_dir parameter. Separate to download_dir to
+        # permit only keeping wheel archives for pip wheel.
+        self.wheel_download_dir = wheel_download_dir
+
+        # NOTE
+        # download_dir and wheel_download_dir overlap semantically and may
+        # be combined if we're willing to have non-wheel archives present in
+        # the wheelhouse output by 'pip wheel'.
+
+        # Is build isolation allowed?
+        self.build_isolation = build_isolation
+
+        # Should hash-checking be required?
+        self.require_hashes = require_hashes
+
+        # Should install in user site-packages?
+        self.use_user_site = use_user_site
+
+    @property
+    def _download_should_save(self):
+        # type: () -> bool
+        if not self.download_dir:
+            return False
+
+        if os.path.exists(self.download_dir):
+            return True
+
+        logger.critical('Could not find download directory')
+        raise InstallationError(
+            "Could not find or access download directory '{}'"
+            .format(self.download_dir))
+
+    def _log_preparing_link(self, req):
+        # type: (InstallRequirement) -> None
+        """Log the way the link prepared."""
+        if req.link.is_file:
+            path = req.link.file_path
+            logger.info('Processing %s', display_path(path))
+        else:
+            logger.info('Collecting %s', req.req or req)
+
+    def _ensure_link_req_src_dir(self, req, download_dir, parallel_builds):
+        # type: (InstallRequirement, Optional[str], bool) -> None
+        """Ensure source_dir of a linked InstallRequirement."""
+        # Since source_dir is only set for editable requirements.
+        if req.link.is_wheel:
+            # We don't need to unpack wheels, so no need for a source
+            # directory.
+            return
+        assert req.source_dir is None
+        # We always delete unpacked sdists after pip runs.
+        req.ensure_has_source_dir(
+            self.build_dir,
+            autodelete=True,
+            parallel_builds=parallel_builds,
+        )
+
+        # If a checkout exists, it's unwise to keep going.  version
+        # inconsistencies are logged later, but do not fail the
+        # installation.
+        # FIXME: this won't upgrade when there's an existing
+        # package unpacked in `req.source_dir`
+        if os.path.exists(os.path.join(req.source_dir, 'setup.py')):
+            raise PreviousBuildDirError(
+                "pip can't proceed with requirements '{}' due to a"
+                "pre-existing build directory ({}). This is likely "
+                "due to a previous installation that failed . pip is "
+                "being responsible and not assuming it can delete this. "
+                "Please delete it and try again.".format(req, req.source_dir)
+            )
+
+    def _get_linked_req_hashes(self, req):
+        # type: (InstallRequirement) -> Hashes
+        # By the time this is called, the requirement's link should have
+        # been checked so we can tell what kind of requirements req is
+        # and raise some more informative errors than otherwise.
+        # (For example, we can raise VcsHashUnsupported for a VCS URL
+        # rather than HashMissing.)
+        if not self.require_hashes:
+            return req.hashes(trust_internet=True)
+
+        # We could check these first 2 conditions inside unpack_url
+        # and save repetition of conditions, but then we would
+        # report less-useful error messages for unhashable
+        # requirements, complaining that there's no hash provided.
+        if req.link.is_vcs:
+            raise VcsHashUnsupported()
+        if req.link.is_existing_dir():
+            raise DirectoryUrlHashUnsupported()
+
+        # Unpinned packages are asking for trouble when a new version
+        # is uploaded.  This isn't a security check, but it saves users
+        # a surprising hash mismatch in the future.
+        # file:/// URLs aren't pinnable, so don't complain about them
+        # not being pinned.
+        if req.original_link is None and not req.is_pinned:
+            raise HashUnpinned()
+
+        # If known-good hashes are missing for this requirement,
+        # shim it with a facade object that will provoke hash
+        # computation and then raise a HashMissing exception
+        # showing the user what the hash should be.
+        return req.hashes(trust_internet=False) or MissingHashes()
+
+    def prepare_linked_requirement(self, req, parallel_builds=False):
+        # type: (InstallRequirement, bool) -> AbstractDistribution
+        """Prepare a requirement to be obtained from req.link."""
+        assert req.link
+        link = req.link
+        self._log_preparing_link(req)
+        if link.is_wheel and self.wheel_download_dir:
+            # Download wheels to a dedicated dir when doing `pip wheel`.
+            download_dir = self.wheel_download_dir
+        else:
+            download_dir = self.download_dir
+
+        with indent_log():
+            self._ensure_link_req_src_dir(req, download_dir, parallel_builds)
+            try:
+                local_file = unpack_url(
+                    link, req.source_dir, self.downloader, download_dir,
+                    hashes=self._get_linked_req_hashes(req)
+                )
+            except NetworkConnectionError as exc:
+                raise InstallationError(
+                    'Could not install requirement {} because of HTTP '
+                    'error {} for URL {}'.format(req, exc, link)
+                )
+
+            # For use in later processing, preserve the file path on the
+            # requirement.
+            if local_file:
+                req.local_file_path = local_file.path
+
+            abstract_dist = _get_prepared_distribution(
+                req, self.req_tracker, self.finder, self.build_isolation,
+            )
+
+            if download_dir:
+                if link.is_existing_dir():
+                    logger.info('Link is a directory, ignoring download_dir')
+                elif local_file:
+                    download_location = os.path.join(
+                        download_dir, link.filename
+                    )
+                    if not os.path.exists(download_location):
+                        shutil.copy(local_file.path, download_location)
+                        download_path = display_path(download_location)
+                        logger.info('Saved %s', download_path)
+
+            if self._download_should_save:
+                # Make a .zip of the source_dir we already created.
+                if link.is_vcs:
+                    req.archive(self.download_dir)
+        return abstract_dist
+
+    def prepare_editable_requirement(
+        self,
+        req,  # type: InstallRequirement
+    ):
+        # type: (...) -> AbstractDistribution
+        """Prepare an editable requirement
+        """
+        assert req.editable, "cannot prepare a non-editable req as editable"
+
+        logger.info('Obtaining %s', req)
+
+        with indent_log():
+            if self.require_hashes:
+                raise InstallationError(
+                    'The editable requirement {} cannot be installed when '
+                    'requiring hashes, because there is no single file to '
+                    'hash.'.format(req)
+                )
+            req.ensure_has_source_dir(self.src_dir)
+            req.update_editable(not self._download_should_save)
+
+            abstract_dist = _get_prepared_distribution(
+                req, self.req_tracker, self.finder, self.build_isolation,
+            )
+
+            if self._download_should_save:
+                req.archive(self.download_dir)
+            req.check_if_exists(self.use_user_site)
+
+        return abstract_dist
+
+    def prepare_installed_requirement(
+        self,
+        req,  # type: InstallRequirement
+        skip_reason  # type: str
+    ):
+        # type: (...) -> AbstractDistribution
+        """Prepare an already-installed requirement
+        """
+        assert req.satisfied_by, "req should have been satisfied but isn't"
+        assert skip_reason is not None, (
+            "did not get skip reason skipped but req.satisfied_by "
+            "is set to {}".format(req.satisfied_by)
+        )
+        logger.info(
+            'Requirement %s: %s (%s)',
+            skip_reason, req, req.satisfied_by.version
+        )
+        with indent_log():
+            if self.require_hashes:
+                logger.debug(
+                    'Since it is already installed, we are trusting this '
+                    'package without checking its hash. To ensure a '
+                    'completely repeatable environment, install into an '
+                    'empty virtualenv.'
+                )
+            abstract_dist = InstalledDistribution(req)
+
+        return abstract_dist
diff --git a/venv/Lib/site-packages/pip/_internal/pyproject.py b/venv/Lib/site-packages/pip/_internal/pyproject.py
new file mode 100644
index 000000000..6b4faf7a7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/pyproject.py
@@ -0,0 +1,196 @@
+from __future__ import absolute_import
+
+import io
+import os
+import sys
+from collections import namedtuple
+
+from pip._vendor import six, toml
+from pip._vendor.packaging.requirements import InvalidRequirement, Requirement
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Optional, List
+
+
+def _is_list_of_str(obj):
+    # type: (Any) -> bool
+    return (
+        isinstance(obj, list) and
+        all(isinstance(item, six.string_types) for item in obj)
+    )
+
+
+def make_pyproject_path(unpacked_source_directory):
+    # type: (str) -> str
+    path = os.path.join(unpacked_source_directory, 'pyproject.toml')
+
+    # Python2 __file__ should not be unicode
+    if six.PY2 and isinstance(path, six.text_type):
+        path = path.encode(sys.getfilesystemencoding())
+
+    return path
+
+
+BuildSystemDetails = namedtuple('BuildSystemDetails', [
+    'requires', 'backend', 'check', 'backend_path'
+])
+
+
+def load_pyproject_toml(
+    use_pep517,  # type: Optional[bool]
+    pyproject_toml,  # type: str
+    setup_py,  # type: str
+    req_name  # type: str
+):
+    # type: (...) -> Optional[BuildSystemDetails]
+    """Load the pyproject.toml file.
+
+    Parameters:
+        use_pep517 - Has the user requested PEP 517 processing? None
+                     means the user hasn't explicitly specified.
+        pyproject_toml - Location of the project's pyproject.toml file
+        setup_py - Location of the project's setup.py file
+        req_name - The name of the requirement we're processing (for
+                   error reporting)
+
+    Returns:
+        None if we should use the legacy code path, otherwise a tuple
+        (
+            requirements from pyproject.toml,
+            name of PEP 517 backend,
+            requirements we should check are installed after setting
+                up the build environment
+            directory paths to import the backend from (backend-path),
+                relative to the project root.
+        )
+    """
+    has_pyproject = os.path.isfile(pyproject_toml)
+    has_setup = os.path.isfile(setup_py)
+
+    if has_pyproject:
+        with io.open(pyproject_toml, encoding="utf-8") as f:
+            pp_toml = toml.load(f)
+        build_system = pp_toml.get("build-system")
+    else:
+        build_system = None
+
+    # The following cases must use PEP 517
+    # We check for use_pep517 being non-None and falsey because that means
+    # the user explicitly requested --no-use-pep517.  The value 0 as
+    # opposed to False can occur when the value is provided via an
+    # environment variable or config file option (due to the quirk of
+    # strtobool() returning an integer in pip's configuration code).
+    if has_pyproject and not has_setup:
+        if use_pep517 is not None and not use_pep517:
+            raise InstallationError(
+                "Disabling PEP 517 processing is invalid: "
+                "project does not have a setup.py"
+            )
+        use_pep517 = True
+    elif build_system and "build-backend" in build_system:
+        if use_pep517 is not None and not use_pep517:
+            raise InstallationError(
+                "Disabling PEP 517 processing is invalid: "
+                "project specifies a build backend of {} "
+                "in pyproject.toml".format(
+                    build_system["build-backend"]
+                )
+            )
+        use_pep517 = True
+
+    # If we haven't worked out whether to use PEP 517 yet,
+    # and the user hasn't explicitly stated a preference,
+    # we do so if the project has a pyproject.toml file.
+    elif use_pep517 is None:
+        use_pep517 = has_pyproject
+
+    # At this point, we know whether we're going to use PEP 517.
+    assert use_pep517 is not None
+
+    # If we're using the legacy code path, there is nothing further
+    # for us to do here.
+    if not use_pep517:
+        return None
+
+    if build_system is None:
+        # Either the user has a pyproject.toml with no build-system
+        # section, or the user has no pyproject.toml, but has opted in
+        # explicitly via --use-pep517.
+        # In the absence of any explicit backend specification, we
+        # assume the setuptools backend that most closely emulates the
+        # traditional direct setup.py execution, and require wheel and
+        # a version of setuptools that supports that backend.
+
+        build_system = {
+            "requires": ["setuptools>=40.8.0", "wheel"],
+            "build-backend": "setuptools.build_meta:__legacy__",
+        }
+
+    # If we're using PEP 517, we have build system information (either
+    # from pyproject.toml, or defaulted by the code above).
+    # Note that at this point, we do not know if the user has actually
+    # specified a backend, though.
+    assert build_system is not None
+
+    # Ensure that the build-system section in pyproject.toml conforms
+    # to PEP 518.
+    error_template = (
+        "{package} has a pyproject.toml file that does not comply "
+        "with PEP 518: {reason}"
+    )
+
+    # Specifying the build-system table but not the requires key is invalid
+    if "requires" not in build_system:
+        raise InstallationError(
+            error_template.format(package=req_name, reason=(
+                "it has a 'build-system' table but not "
+                "'build-system.requires' which is mandatory in the table"
+            ))
+        )
+
+    # Error out if requires is not a list of strings
+    requires = build_system["requires"]
+    if not _is_list_of_str(requires):
+        raise InstallationError(error_template.format(
+            package=req_name,
+            reason="'build-system.requires' is not a list of strings.",
+        ))
+
+    # Each requirement must be valid as per PEP 508
+    for requirement in requires:
+        try:
+            Requirement(requirement)
+        except InvalidRequirement:
+            raise InstallationError(
+                error_template.format(
+                    package=req_name,
+                    reason=(
+                        "'build-system.requires' contains an invalid "
+                        "requirement: {!r}".format(requirement)
+                    ),
+                )
+            )
+
+    backend = build_system.get("build-backend")
+    backend_path = build_system.get("backend-path", [])
+    check = []  # type: List[str]
+    if backend is None:
+        # If the user didn't specify a backend, we assume they want to use
+        # the setuptools backend. But we can't be sure they have included
+        # a version of setuptools which supplies the backend, or wheel
+        # (which is needed by the backend) in their requirements. So we
+        # make a note to check that those requirements are present once
+        # we have set up the environment.
+        # This is quite a lot of work to check for a very specific case. But
+        # the problem is, that case is potentially quite common - projects that
+        # adopted PEP 518 early for the ability to specify requirements to
+        # execute setup.py, but never considered needing to mention the build
+        # tools themselves. The original PEP 518 code had a similar check (but
+        # implemented in a different way).
+        backend = "setuptools.build_meta:__legacy__"
+        check = ["setuptools>=40.8.0", "wheel"]
+
+    return BuildSystemDetails(requires, backend, check, backend_path)
diff --git a/venv/Lib/site-packages/pip/_internal/req/__init__.py b/venv/Lib/site-packages/pip/_internal/req/__init__.py
new file mode 100644
index 000000000..8568d3f8b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/__init__.py
@@ -0,0 +1,103 @@
+from __future__ import absolute_import
+
+import collections
+import logging
+
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+from .req_file import parse_requirements
+from .req_install import InstallRequirement
+from .req_set import RequirementSet
+
+if MYPY_CHECK_RUNNING:
+    from typing import Iterator, List, Optional, Sequence, Tuple
+
+__all__ = [
+    "RequirementSet", "InstallRequirement",
+    "parse_requirements", "install_given_reqs",
+]
+
+logger = logging.getLogger(__name__)
+
+
+class InstallationResult(object):
+    def __init__(self, name):
+        # type: (str) -> None
+        self.name = name
+
+    def __repr__(self):
+        # type: () -> str
+        return "InstallationResult(name={!r})".format(self.name)
+
+
+def _validate_requirements(
+    requirements,  # type: List[InstallRequirement]
+):
+    # type: (...) -> Iterator[Tuple[str, InstallRequirement]]
+    for req in requirements:
+        assert req.name, "invalid to-be-installed requirement: {}".format(req)
+        yield req.name, req
+
+
+def install_given_reqs(
+    requirements,  # type: List[InstallRequirement]
+    install_options,  # type: List[str]
+    global_options,  # type: Sequence[str]
+    root,  # type: Optional[str]
+    home,  # type: Optional[str]
+    prefix,  # type: Optional[str]
+    warn_script_location,  # type: bool
+    use_user_site,  # type: bool
+    pycompile,  # type: bool
+):
+    # type: (...) -> List[InstallationResult]
+    """
+    Install everything in the given list.
+
+    (to be called after having downloaded and unpacked the packages)
+    """
+    to_install = collections.OrderedDict(_validate_requirements(requirements))
+
+    if to_install:
+        logger.info(
+            'Installing collected packages: %s',
+            ', '.join(to_install.keys()),
+        )
+
+    installed = []
+
+    with indent_log():
+        for req_name, requirement in to_install.items():
+            if requirement.should_reinstall:
+                logger.info('Attempting uninstall: %s', req_name)
+                with indent_log():
+                    uninstalled_pathset = requirement.uninstall(
+                        auto_confirm=True
+                    )
+            else:
+                uninstalled_pathset = None
+
+            try:
+                requirement.install(
+                    install_options,
+                    global_options,
+                    root=root,
+                    home=home,
+                    prefix=prefix,
+                    warn_script_location=warn_script_location,
+                    use_user_site=use_user_site,
+                    pycompile=pycompile,
+                )
+            except Exception:
+                # if install did not succeed, rollback previous uninstall
+                if uninstalled_pathset and not requirement.install_succeeded:
+                    uninstalled_pathset.rollback()
+                raise
+            else:
+                if uninstalled_pathset and requirement.install_succeeded:
+                    uninstalled_pathset.commit()
+
+            installed.append(InstallationResult(req_name))
+
+    return installed
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..ea63a3ada
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/constructors.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/constructors.cpython-36.pyc
new file mode 100644
index 000000000..8843f4913
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/constructors.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_file.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_file.cpython-36.pyc
new file mode 100644
index 000000000..e217275af
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_file.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_install.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_install.cpython-36.pyc
new file mode 100644
index 000000000..888e03d90
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_set.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_set.cpython-36.pyc
new file mode 100644
index 000000000..f6a3582ae
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_set.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_tracker.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_tracker.cpython-36.pyc
new file mode 100644
index 000000000..75dfdef51
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_tracker.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_uninstall.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_uninstall.cpython-36.pyc
new file mode 100644
index 000000000..87a4da6fd
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/req/__pycache__/req_uninstall.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/req/constructors.py b/venv/Lib/site-packages/pip/_internal/req/constructors.py
new file mode 100644
index 000000000..7a4641ef5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/constructors.py
@@ -0,0 +1,486 @@
+"""Backing implementation for InstallRequirement's various constructors
+
+The idea here is that these formed a major chunk of InstallRequirement's size
+so, moving them and support code dedicated to them outside of that class
+helps creates for better understandability for the rest of the code.
+
+These are meant to be used elsewhere within pip to create instances of
+InstallRequirement.
+"""
+
+import logging
+import os
+import re
+
+from pip._vendor.packaging.markers import Marker
+from pip._vendor.packaging.requirements import InvalidRequirement, Requirement
+from pip._vendor.packaging.specifiers import Specifier
+from pip._vendor.pkg_resources import RequirementParseError, parse_requirements
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.models.index import PyPI, TestPyPI
+from pip._internal.models.link import Link
+from pip._internal.models.wheel import Wheel
+from pip._internal.pyproject import make_pyproject_path
+from pip._internal.req.req_install import InstallRequirement
+from pip._internal.utils.deprecation import deprecated
+from pip._internal.utils.filetypes import ARCHIVE_EXTENSIONS
+from pip._internal.utils.misc import is_installable_dir, splitext
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url
+from pip._internal.vcs import is_url, vcs
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Dict, Optional, Set, Tuple, Union,
+    )
+    from pip._internal.req.req_file import ParsedRequirement
+
+
+__all__ = [
+    "install_req_from_editable", "install_req_from_line",
+    "parse_editable"
+]
+
+logger = logging.getLogger(__name__)
+operators = Specifier._operators.keys()
+
+
+def is_archive_file(name):
+    # type: (str) -> bool
+    """Return True if `name` is a considered as an archive file."""
+    ext = splitext(name)[1].lower()
+    if ext in ARCHIVE_EXTENSIONS:
+        return True
+    return False
+
+
+def _strip_extras(path):
+    # type: (str) -> Tuple[str, Optional[str]]
+    m = re.match(r'^(.+)(\[[^\]]+\])$', path)
+    extras = None
+    if m:
+        path_no_extras = m.group(1)
+        extras = m.group(2)
+    else:
+        path_no_extras = path
+
+    return path_no_extras, extras
+
+
+def convert_extras(extras):
+    # type: (Optional[str]) -> Set[str]
+    if not extras:
+        return set()
+    return Requirement("placeholder" + extras.lower()).extras
+
+
+def parse_editable(editable_req):
+    # type: (str) -> Tuple[Optional[str], str, Set[str]]
+    """Parses an editable requirement into:
+        - a requirement name
+        - an URL
+        - extras
+        - editable options
+    Accepted requirements:
+        svn+http://blahblah@rev#egg=Foobar[baz]&subdirectory=version_subdir
+        .[some_extra]
+    """
+
+    url = editable_req
+
+    # If a file path is specified with extras, strip off the extras.
+    url_no_extras, extras = _strip_extras(url)
+
+    if os.path.isdir(url_no_extras):
+        if not os.path.exists(os.path.join(url_no_extras, 'setup.py')):
+            msg = (
+                'File "setup.py" not found. Directory cannot be installed '
+                'in editable mode: {}'.format(os.path.abspath(url_no_extras))
+            )
+            pyproject_path = make_pyproject_path(url_no_extras)
+            if os.path.isfile(pyproject_path):
+                msg += (
+                    '\n(A "pyproject.toml" file was found, but editable '
+                    'mode currently requires a setup.py based build.)'
+                )
+            raise InstallationError(msg)
+
+        # Treating it as code that has already been checked out
+        url_no_extras = path_to_url(url_no_extras)
+
+    if url_no_extras.lower().startswith('file:'):
+        package_name = Link(url_no_extras).egg_fragment
+        if extras:
+            return (
+                package_name,
+                url_no_extras,
+                Requirement("placeholder" + extras.lower()).extras,
+            )
+        else:
+            return package_name, url_no_extras, set()
+
+    for version_control in vcs:
+        if url.lower().startswith('{}:'.format(version_control)):
+            url = '{}+{}'.format(version_control, url)
+            break
+
+    if '+' not in url:
+        raise InstallationError(
+            '{} is not a valid editable requirement. '
+            'It should either be a path to a local project or a VCS URL '
+            '(beginning with svn+, git+, hg+, or bzr+).'.format(editable_req)
+        )
+
+    vc_type = url.split('+', 1)[0].lower()
+
+    if not vcs.get_backend(vc_type):
+        backends = ", ".join([bends.name + '+URL' for bends in vcs.backends])
+        error_message = "For --editable={}, " \
+                        "only {} are currently supported".format(
+                            editable_req, backends)
+        raise InstallationError(error_message)
+
+    package_name = Link(url).egg_fragment
+    if not package_name:
+        raise InstallationError(
+            "Could not detect requirement name for '{}', please specify one "
+            "with #egg=your_package_name".format(editable_req)
+        )
+    return package_name, url, set()
+
+
+def deduce_helpful_msg(req):
+    # type: (str) -> str
+    """Returns helpful msg in case requirements file does not exist,
+    or cannot be parsed.
+
+    :params req: Requirements file path
+    """
+    msg = ""
+    if os.path.exists(req):
+        msg = " It does exist."
+        # Try to parse and check if it is a requirements file.
+        try:
+            with open(req, 'r') as fp:
+                # parse first line only
+                next(parse_requirements(fp.read()))
+                msg += (
+                    "The argument you provided "
+                    "({}) appears to be a"
+                    " requirements file. If that is the"
+                    " case, use the '-r' flag to install"
+                    " the packages specified within it."
+                ).format(req)
+        except RequirementParseError:
+            logger.debug(
+                "Cannot parse '%s' as requirements file", req, exc_info=True
+            )
+    else:
+        msg += " File '{}' does not exist.".format(req)
+    return msg
+
+
+class RequirementParts(object):
+    def __init__(
+            self,
+            requirement,  # type: Optional[Requirement]
+            link,         # type: Optional[Link]
+            markers,      # type: Optional[Marker]
+            extras,       # type: Set[str]
+    ):
+        self.requirement = requirement
+        self.link = link
+        self.markers = markers
+        self.extras = extras
+
+
+def parse_req_from_editable(editable_req):
+    # type: (str) -> RequirementParts
+    name, url, extras_override = parse_editable(editable_req)
+
+    if name is not None:
+        try:
+            req = Requirement(name)
+        except InvalidRequirement:
+            raise InstallationError("Invalid requirement: '{}'".format(name))
+    else:
+        req = None
+
+    link = Link(url)
+
+    return RequirementParts(req, link, None, extras_override)
+
+
+# ---- The actual constructors follow ----
+
+
+def install_req_from_editable(
+    editable_req,  # type: str
+    comes_from=None,  # type: Optional[Union[InstallRequirement, str]]
+    use_pep517=None,  # type: Optional[bool]
+    isolated=False,  # type: bool
+    options=None,  # type: Optional[Dict[str, Any]]
+    constraint=False,  # type: bool
+    user_supplied=False,  # type: bool
+):
+    # type: (...) -> InstallRequirement
+
+    parts = parse_req_from_editable(editable_req)
+
+    return InstallRequirement(
+        parts.requirement,
+        comes_from=comes_from,
+        user_supplied=user_supplied,
+        editable=True,
+        link=parts.link,
+        constraint=constraint,
+        use_pep517=use_pep517,
+        isolated=isolated,
+        install_options=options.get("install_options", []) if options else [],
+        global_options=options.get("global_options", []) if options else [],
+        hash_options=options.get("hashes", {}) if options else {},
+        extras=parts.extras,
+    )
+
+
+def _looks_like_path(name):
+    # type: (str) -> bool
+    """Checks whether the string "looks like" a path on the filesystem.
+
+    This does not check whether the target actually exists, only judge from the
+    appearance.
+
+    Returns true if any of the following conditions is true:
+    * a path separator is found (either os.path.sep or os.path.altsep);
+    * a dot is found (which represents the current directory).
+    """
+    if os.path.sep in name:
+        return True
+    if os.path.altsep is not None and os.path.altsep in name:
+        return True
+    if name.startswith("."):
+        return True
+    return False
+
+
+def _get_url_from_path(path, name):
+    # type: (str, str) -> Optional[str]
+    """
+    First, it checks whether a provided path is an installable directory
+    (e.g. it has a setup.py). If it is, returns the path.
+
+    If false, check if the path is an archive file (such as a .whl).
+    The function checks if the path is a file. If false, if the path has
+    an @, it will treat it as a PEP 440 URL requirement and return the path.
+    """
+    if _looks_like_path(name) and os.path.isdir(path):
+        if is_installable_dir(path):
+            return path_to_url(path)
+        raise InstallationError(
+            "Directory {name!r} is not installable. Neither 'setup.py' "
+            "nor 'pyproject.toml' found.".format(**locals())
+        )
+    if not is_archive_file(path):
+        return None
+    if os.path.isfile(path):
+        return path_to_url(path)
+    urlreq_parts = name.split('@', 1)
+    if len(urlreq_parts) >= 2 and not _looks_like_path(urlreq_parts[0]):
+        # If the path contains '@' and the part before it does not look
+        # like a path, try to treat it as a PEP 440 URL req instead.
+        return None
+    logger.warning(
+        'Requirement %r looks like a filename, but the '
+        'file does not exist',
+        name
+    )
+    return path_to_url(path)
+
+
+def parse_req_from_line(name, line_source):
+    # type: (str, Optional[str]) -> RequirementParts
+    if is_url(name):
+        marker_sep = '; '
+    else:
+        marker_sep = ';'
+    if marker_sep in name:
+        name, markers_as_string = name.split(marker_sep, 1)
+        markers_as_string = markers_as_string.strip()
+        if not markers_as_string:
+            markers = None
+        else:
+            markers = Marker(markers_as_string)
+    else:
+        markers = None
+    name = name.strip()
+    req_as_string = None
+    path = os.path.normpath(os.path.abspath(name))
+    link = None
+    extras_as_string = None
+
+    if is_url(name):
+        link = Link(name)
+    else:
+        p, extras_as_string = _strip_extras(path)
+        url = _get_url_from_path(p, name)
+        if url is not None:
+            link = Link(url)
+
+    # it's a local file, dir, or url
+    if link:
+        # Handle relative file URLs
+        if link.scheme == 'file' and re.search(r'\.\./', link.url):
+            link = Link(
+                path_to_url(os.path.normpath(os.path.abspath(link.path))))
+        # wheel file
+        if link.is_wheel:
+            wheel = Wheel(link.filename)  # can raise InvalidWheelFilename
+            req_as_string = "{wheel.name}=={wheel.version}".format(**locals())
+        else:
+            # set the req to the egg fragment.  when it's not there, this
+            # will become an 'unnamed' requirement
+            req_as_string = link.egg_fragment
+
+    # a requirement specifier
+    else:
+        req_as_string = name
+
+    extras = convert_extras(extras_as_string)
+
+    def with_source(text):
+        # type: (str) -> str
+        if not line_source:
+            return text
+        return '{} (from {})'.format(text, line_source)
+
+    if req_as_string is not None:
+        try:
+            req = Requirement(req_as_string)
+        except InvalidRequirement:
+            if os.path.sep in req_as_string:
+                add_msg = "It looks like a path."
+                add_msg += deduce_helpful_msg(req_as_string)
+            elif ('=' in req_as_string and
+                  not any(op in req_as_string for op in operators)):
+                add_msg = "= is not a valid operator. Did you mean == ?"
+            else:
+                add_msg = ''
+            msg = with_source(
+                'Invalid requirement: {!r}'.format(req_as_string)
+            )
+            if add_msg:
+                msg += '\nHint: {}'.format(add_msg)
+            raise InstallationError(msg)
+        else:
+            # Deprecate extras after specifiers: "name>=1.0[extras]"
+            # This currently works by accident because _strip_extras() parses
+            # any extras in the end of the string and those are saved in
+            # RequirementParts
+            for spec in req.specifier:
+                spec_str = str(spec)
+                if spec_str.endswith(']'):
+                    msg = "Extras after version '{}'.".format(spec_str)
+                    replace = "moving the extras before version specifiers"
+                    deprecated(msg, replacement=replace, gone_in="21.0")
+    else:
+        req = None
+
+    return RequirementParts(req, link, markers, extras)
+
+
+def install_req_from_line(
+    name,  # type: str
+    comes_from=None,  # type: Optional[Union[str, InstallRequirement]]
+    use_pep517=None,  # type: Optional[bool]
+    isolated=False,  # type: bool
+    options=None,  # type: Optional[Dict[str, Any]]
+    constraint=False,  # type: bool
+    line_source=None,  # type: Optional[str]
+    user_supplied=False,  # type: bool
+):
+    # type: (...) -> InstallRequirement
+    """Creates an InstallRequirement from a name, which might be a
+    requirement, directory containing 'setup.py', filename, or URL.
+
+    :param line_source: An optional string describing where the line is from,
+        for logging purposes in case of an error.
+    """
+    parts = parse_req_from_line(name, line_source)
+
+    return InstallRequirement(
+        parts.requirement, comes_from, link=parts.link, markers=parts.markers,
+        use_pep517=use_pep517, isolated=isolated,
+        install_options=options.get("install_options", []) if options else [],
+        global_options=options.get("global_options", []) if options else [],
+        hash_options=options.get("hashes", {}) if options else {},
+        constraint=constraint,
+        extras=parts.extras,
+        user_supplied=user_supplied,
+    )
+
+
+def install_req_from_req_string(
+    req_string,  # type: str
+    comes_from=None,  # type: Optional[InstallRequirement]
+    isolated=False,  # type: bool
+    use_pep517=None,  # type: Optional[bool]
+    user_supplied=False,  # type: bool
+):
+    # type: (...) -> InstallRequirement
+    try:
+        req = Requirement(req_string)
+    except InvalidRequirement:
+        raise InstallationError("Invalid requirement: '{}'".format(req_string))
+
+    domains_not_allowed = [
+        PyPI.file_storage_domain,
+        TestPyPI.file_storage_domain,
+    ]
+    if (req.url and comes_from and comes_from.link and
+            comes_from.link.netloc in domains_not_allowed):
+        # Explicitly disallow pypi packages that depend on external urls
+        raise InstallationError(
+            "Packages installed from PyPI cannot depend on packages "
+            "which are not also hosted on PyPI.\n"
+            "{} depends on {} ".format(comes_from.name, req)
+        )
+
+    return InstallRequirement(
+        req,
+        comes_from,
+        isolated=isolated,
+        use_pep517=use_pep517,
+        user_supplied=user_supplied,
+    )
+
+
+def install_req_from_parsed_requirement(
+    parsed_req,  # type: ParsedRequirement
+    isolated=False,  # type: bool
+    use_pep517=None,  # type: Optional[bool]
+    user_supplied=False,  # type: bool
+):
+    # type: (...) -> InstallRequirement
+    if parsed_req.is_editable:
+        req = install_req_from_editable(
+            parsed_req.requirement,
+            comes_from=parsed_req.comes_from,
+            use_pep517=use_pep517,
+            constraint=parsed_req.constraint,
+            isolated=isolated,
+            user_supplied=user_supplied,
+        )
+
+    else:
+        req = install_req_from_line(
+            parsed_req.requirement,
+            comes_from=parsed_req.comes_from,
+            use_pep517=use_pep517,
+            isolated=isolated,
+            options=parsed_req.options,
+            constraint=parsed_req.constraint,
+            line_source=parsed_req.line_source,
+            user_supplied=user_supplied,
+        )
+    return req
diff --git a/venv/Lib/site-packages/pip/_internal/req/req_file.py b/venv/Lib/site-packages/pip/_internal/req/req_file.py
new file mode 100644
index 000000000..105058228
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/req_file.py
@@ -0,0 +1,592 @@
+"""
+Requirements file parsing
+"""
+
+from __future__ import absolute_import
+
+import optparse
+import os
+import re
+import shlex
+import sys
+
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.cli import cmdoptions
+from pip._internal.exceptions import (
+    InstallationError,
+    RequirementsFileParseError,
+)
+from pip._internal.models.search_scope import SearchScope
+from pip._internal.network.utils import raise_for_status
+from pip._internal.utils.encoding import auto_decode
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import get_url_scheme
+
+if MYPY_CHECK_RUNNING:
+    from optparse import Values
+    from typing import (
+        Any, Callable, Dict, Iterator, List, NoReturn, Optional, Text, Tuple,
+    )
+
+    from pip._internal.index.package_finder import PackageFinder
+    from pip._internal.network.session import PipSession
+
+    ReqFileLines = Iterator[Tuple[int, Text]]
+
+    LineParser = Callable[[Text], Tuple[str, Values]]
+
+
+__all__ = ['parse_requirements']
+
+SCHEME_RE = re.compile(r'^(http|https|file):', re.I)
+COMMENT_RE = re.compile(r'(^|\s+)#.*$')
+
+# Matches environment variable-style values in '${MY_VARIABLE_1}' with the
+# variable name consisting of only uppercase letters, digits or the '_'
+# (underscore). This follows the POSIX standard defined in IEEE Std 1003.1,
+# 2013 Edition.
+ENV_VAR_RE = re.compile(r'(?P<var>\$\{(?P<name>[A-Z0-9_]+)\})')
+
+SUPPORTED_OPTIONS = [
+    cmdoptions.index_url,
+    cmdoptions.extra_index_url,
+    cmdoptions.no_index,
+    cmdoptions.constraints,
+    cmdoptions.requirements,
+    cmdoptions.editable,
+    cmdoptions.find_links,
+    cmdoptions.no_binary,
+    cmdoptions.only_binary,
+    cmdoptions.prefer_binary,
+    cmdoptions.require_hashes,
+    cmdoptions.pre,
+    cmdoptions.trusted_host,
+    cmdoptions.use_new_feature,
+]  # type: List[Callable[..., optparse.Option]]
+
+# options to be passed to requirements
+SUPPORTED_OPTIONS_REQ = [
+    cmdoptions.install_options,
+    cmdoptions.global_options,
+    cmdoptions.hash,
+]  # type: List[Callable[..., optparse.Option]]
+
+# the 'dest' string values
+SUPPORTED_OPTIONS_REQ_DEST = [str(o().dest) for o in SUPPORTED_OPTIONS_REQ]
+
+
+class ParsedRequirement(object):
+    def __init__(
+        self,
+        requirement,  # type:str
+        is_editable,  # type: bool
+        comes_from,  # type: str
+        constraint,  # type: bool
+        options=None,  # type: Optional[Dict[str, Any]]
+        line_source=None,  # type: Optional[str]
+    ):
+        # type: (...) -> None
+        self.requirement = requirement
+        self.is_editable = is_editable
+        self.comes_from = comes_from
+        self.options = options
+        self.constraint = constraint
+        self.line_source = line_source
+
+
+class ParsedLine(object):
+    def __init__(
+        self,
+        filename,  # type: str
+        lineno,  # type: int
+        comes_from,  # type: Optional[str]
+        args,  # type: str
+        opts,  # type: Values
+        constraint,  # type: bool
+    ):
+        # type: (...) -> None
+        self.filename = filename
+        self.lineno = lineno
+        self.comes_from = comes_from
+        self.opts = opts
+        self.constraint = constraint
+
+        if args:
+            self.is_requirement = True
+            self.is_editable = False
+            self.requirement = args
+        elif opts.editables:
+            self.is_requirement = True
+            self.is_editable = True
+            # We don't support multiple -e on one line
+            self.requirement = opts.editables[0]
+        else:
+            self.is_requirement = False
+
+
+def parse_requirements(
+    filename,  # type: str
+    session,  # type: PipSession
+    finder=None,  # type: Optional[PackageFinder]
+    comes_from=None,  # type: Optional[str]
+    options=None,  # type: Optional[optparse.Values]
+    constraint=False,  # type: bool
+):
+    # type: (...) -> Iterator[ParsedRequirement]
+    """Parse a requirements file and yield ParsedRequirement instances.
+
+    :param filename:    Path or url of requirements file.
+    :param session:     PipSession instance.
+    :param finder:      Instance of pip.index.PackageFinder.
+    :param comes_from:  Origin description of requirements.
+    :param options:     cli options.
+    :param constraint:  If true, parsing a constraint file rather than
+        requirements file.
+    """
+    line_parser = get_line_parser(finder)
+    parser = RequirementsFileParser(session, line_parser, comes_from)
+
+    for parsed_line in parser.parse(filename, constraint):
+        parsed_req = handle_line(
+            parsed_line,
+            options=options,
+            finder=finder,
+            session=session
+        )
+        if parsed_req is not None:
+            yield parsed_req
+
+
+def preprocess(content):
+    # type: (Text) -> ReqFileLines
+    """Split, filter, and join lines, and return a line iterator
+
+    :param content: the content of the requirements file
+    """
+    lines_enum = enumerate(content.splitlines(), start=1)  # type: ReqFileLines
+    lines_enum = join_lines(lines_enum)
+    lines_enum = ignore_comments(lines_enum)
+    lines_enum = expand_env_variables(lines_enum)
+    return lines_enum
+
+
+def handle_requirement_line(
+    line,  # type: ParsedLine
+    options=None,  # type: Optional[optparse.Values]
+):
+    # type: (...) -> ParsedRequirement
+
+    # preserve for the nested code path
+    line_comes_from = '{} {} (line {})'.format(
+        '-c' if line.constraint else '-r', line.filename, line.lineno,
+    )
+
+    assert line.is_requirement
+
+    if line.is_editable:
+        # For editable requirements, we don't support per-requirement
+        # options, so just return the parsed requirement.
+        return ParsedRequirement(
+            requirement=line.requirement,
+            is_editable=line.is_editable,
+            comes_from=line_comes_from,
+            constraint=line.constraint,
+        )
+    else:
+        if options:
+            # Disable wheels if the user has specified build options
+            cmdoptions.check_install_build_global(options, line.opts)
+
+        # get the options that apply to requirements
+        req_options = {}
+        for dest in SUPPORTED_OPTIONS_REQ_DEST:
+            if dest in line.opts.__dict__ and line.opts.__dict__[dest]:
+                req_options[dest] = line.opts.__dict__[dest]
+
+        line_source = 'line {} of {}'.format(line.lineno, line.filename)
+        return ParsedRequirement(
+            requirement=line.requirement,
+            is_editable=line.is_editable,
+            comes_from=line_comes_from,
+            constraint=line.constraint,
+            options=req_options,
+            line_source=line_source,
+        )
+
+
+def handle_option_line(
+    opts,  # type: Values
+    filename,  # type: str
+    lineno,  # type: int
+    finder=None,  # type: Optional[PackageFinder]
+    options=None,  # type: Optional[optparse.Values]
+    session=None,  # type: Optional[PipSession]
+):
+    # type:  (...) -> None
+
+    if options:
+        # percolate options upward
+        if opts.require_hashes:
+            options.require_hashes = opts.require_hashes
+        if opts.features_enabled:
+            options.features_enabled.extend(
+                f for f in opts.features_enabled
+                if f not in options.features_enabled
+            )
+
+    # set finder options
+    if finder:
+        find_links = finder.find_links
+        index_urls = finder.index_urls
+        if opts.index_url:
+            index_urls = [opts.index_url]
+        if opts.no_index is True:
+            index_urls = []
+        if opts.extra_index_urls:
+            index_urls.extend(opts.extra_index_urls)
+        if opts.find_links:
+            # FIXME: it would be nice to keep track of the source
+            # of the find_links: support a find-links local path
+            # relative to a requirements file.
+            value = opts.find_links[0]
+            req_dir = os.path.dirname(os.path.abspath(filename))
+            relative_to_reqs_file = os.path.join(req_dir, value)
+            if os.path.exists(relative_to_reqs_file):
+                value = relative_to_reqs_file
+            find_links.append(value)
+
+        search_scope = SearchScope(
+            find_links=find_links,
+            index_urls=index_urls,
+        )
+        finder.search_scope = search_scope
+
+        if opts.pre:
+            finder.set_allow_all_prereleases()
+
+        if opts.prefer_binary:
+            finder.set_prefer_binary()
+
+        if session:
+            for host in opts.trusted_hosts or []:
+                source = 'line {} of {}'.format(lineno, filename)
+                session.add_trusted_host(host, source=source)
+
+
+def handle_line(
+    line,  # type: ParsedLine
+    options=None,  # type: Optional[optparse.Values]
+    finder=None,  # type: Optional[PackageFinder]
+    session=None,  # type: Optional[PipSession]
+):
+    # type: (...) -> Optional[ParsedRequirement]
+    """Handle a single parsed requirements line; This can result in
+    creating/yielding requirements, or updating the finder.
+
+    :param line:        The parsed line to be processed.
+    :param options:     CLI options.
+    :param finder:      The finder - updated by non-requirement lines.
+    :param session:     The session - updated by non-requirement lines.
+
+    Returns a ParsedRequirement object if the line is a requirement line,
+    otherwise returns None.
+
+    For lines that contain requirements, the only options that have an effect
+    are from SUPPORTED_OPTIONS_REQ, and they are scoped to the
+    requirement. Other options from SUPPORTED_OPTIONS may be present, but are
+    ignored.
+
+    For lines that do not contain requirements, the only options that have an
+    effect are from SUPPORTED_OPTIONS. Options from SUPPORTED_OPTIONS_REQ may
+    be present, but are ignored. These lines may contain multiple options
+    (although our docs imply only one is supported), and all our parsed and
+    affect the finder.
+    """
+
+    if line.is_requirement:
+        parsed_req = handle_requirement_line(line, options)
+        return parsed_req
+    else:
+        handle_option_line(
+            line.opts,
+            line.filename,
+            line.lineno,
+            finder,
+            options,
+            session,
+        )
+        return None
+
+
+class RequirementsFileParser(object):
+    def __init__(
+        self,
+        session,  # type: PipSession
+        line_parser,  # type: LineParser
+        comes_from,  # type: Optional[str]
+    ):
+        # type: (...) -> None
+        self._session = session
+        self._line_parser = line_parser
+        self._comes_from = comes_from
+
+    def parse(self, filename, constraint):
+        # type: (str, bool) -> Iterator[ParsedLine]
+        """Parse a given file, yielding parsed lines.
+        """
+        for line in self._parse_and_recurse(filename, constraint):
+            yield line
+
+    def _parse_and_recurse(self, filename, constraint):
+        # type: (str, bool) -> Iterator[ParsedLine]
+        for line in self._parse_file(filename, constraint):
+            if (
+                not line.is_requirement and
+                (line.opts.requirements or line.opts.constraints)
+            ):
+                # parse a nested requirements file
+                if line.opts.requirements:
+                    req_path = line.opts.requirements[0]
+                    nested_constraint = False
+                else:
+                    req_path = line.opts.constraints[0]
+                    nested_constraint = True
+
+                # original file is over http
+                if SCHEME_RE.search(filename):
+                    # do a url join so relative paths work
+                    req_path = urllib_parse.urljoin(filename, req_path)
+                # original file and nested file are paths
+                elif not SCHEME_RE.search(req_path):
+                    # do a join so relative paths work
+                    req_path = os.path.join(
+                        os.path.dirname(filename), req_path,
+                    )
+
+                for inner_line in self._parse_and_recurse(
+                    req_path, nested_constraint,
+                ):
+                    yield inner_line
+            else:
+                yield line
+
+    def _parse_file(self, filename, constraint):
+        # type: (str, bool) -> Iterator[ParsedLine]
+        _, content = get_file_content(
+            filename, self._session, comes_from=self._comes_from
+        )
+
+        lines_enum = preprocess(content)
+
+        for line_number, line in lines_enum:
+            try:
+                args_str, opts = self._line_parser(line)
+            except OptionParsingError as e:
+                # add offending line
+                msg = 'Invalid requirement: {}\n{}'.format(line, e.msg)
+                raise RequirementsFileParseError(msg)
+
+            yield ParsedLine(
+                filename,
+                line_number,
+                self._comes_from,
+                args_str,
+                opts,
+                constraint,
+            )
+
+
+def get_line_parser(finder):
+    # type: (Optional[PackageFinder]) -> LineParser
+    def parse_line(line):
+        # type: (Text) -> Tuple[str, Values]
+        # Build new parser for each line since it accumulates appendable
+        # options.
+        parser = build_parser()
+        defaults = parser.get_default_values()
+        defaults.index_url = None
+        if finder:
+            defaults.format_control = finder.format_control
+
+        args_str, options_str = break_args_options(line)
+        # Prior to 2.7.3, shlex cannot deal with unicode entries
+        if sys.version_info < (2, 7, 3):
+            # https://github.com/python/mypy/issues/1174
+            options_str = options_str.encode('utf8')  # type: ignore
+
+        # https://github.com/python/mypy/issues/1174
+        opts, _ = parser.parse_args(
+            shlex.split(options_str), defaults)  # type: ignore
+
+        return args_str, opts
+
+    return parse_line
+
+
+def break_args_options(line):
+    # type: (Text) -> Tuple[str, Text]
+    """Break up the line into an args and options string.  We only want to shlex
+    (and then optparse) the options, not the args.  args can contain markers
+    which are corrupted by shlex.
+    """
+    tokens = line.split(' ')
+    args = []
+    options = tokens[:]
+    for token in tokens:
+        if token.startswith('-') or token.startswith('--'):
+            break
+        else:
+            args.append(token)
+            options.pop(0)
+    return ' '.join(args), ' '.join(options)  # type: ignore
+
+
+class OptionParsingError(Exception):
+    def __init__(self, msg):
+        # type: (str) -> None
+        self.msg = msg
+
+
+def build_parser():
+    # type: () -> optparse.OptionParser
+    """
+    Return a parser for parsing requirement lines
+    """
+    parser = optparse.OptionParser(add_help_option=False)
+
+    option_factories = SUPPORTED_OPTIONS + SUPPORTED_OPTIONS_REQ
+    for option_factory in option_factories:
+        option = option_factory()
+        parser.add_option(option)
+
+    # By default optparse sys.exits on parsing errors. We want to wrap
+    # that in our own exception.
+    def parser_exit(self, msg):
+        # type: (Any, str) -> NoReturn
+        raise OptionParsingError(msg)
+    # NOTE: mypy disallows assigning to a method
+    #       https://github.com/python/mypy/issues/2427
+    parser.exit = parser_exit  # type: ignore
+
+    return parser
+
+
+def join_lines(lines_enum):
+    # type: (ReqFileLines) -> ReqFileLines
+    """Joins a line ending in '\' with the previous line (except when following
+    comments).  The joined line takes on the index of the first line.
+    """
+    primary_line_number = None
+    new_line = []  # type: List[Text]
+    for line_number, line in lines_enum:
+        if not line.endswith('\\') or COMMENT_RE.match(line):
+            if COMMENT_RE.match(line):
+                # this ensures comments are always matched later
+                line = ' ' + line
+            if new_line:
+                new_line.append(line)
+                assert primary_line_number is not None
+                yield primary_line_number, ''.join(new_line)
+                new_line = []
+            else:
+                yield line_number, line
+        else:
+            if not new_line:
+                primary_line_number = line_number
+            new_line.append(line.strip('\\'))
+
+    # last line contains \
+    if new_line:
+        assert primary_line_number is not None
+        yield primary_line_number, ''.join(new_line)
+
+    # TODO: handle space after '\'.
+
+
+def ignore_comments(lines_enum):
+    # type: (ReqFileLines) -> ReqFileLines
+    """
+    Strips comments and filter empty lines.
+    """
+    for line_number, line in lines_enum:
+        line = COMMENT_RE.sub('', line)
+        line = line.strip()
+        if line:
+            yield line_number, line
+
+
+def expand_env_variables(lines_enum):
+    # type: (ReqFileLines) -> ReqFileLines
+    """Replace all environment variables that can be retrieved via `os.getenv`.
+
+    The only allowed format for environment variables defined in the
+    requirement file is `${MY_VARIABLE_1}` to ensure two things:
+
+    1. Strings that contain a `$` aren't accidentally (partially) expanded.
+    2. Ensure consistency across platforms for requirement files.
+
+    These points are the result of a discussion on the `github pull
+    request #3514 <https://github.com/pypa/pip/pull/3514>`_.
+
+    Valid characters in variable names follow the `POSIX standard
+    <http://pubs.opengroup.org/onlinepubs/9699919799/>`_ and are limited
+    to uppercase letter, digits and the `_` (underscore).
+    """
+    for line_number, line in lines_enum:
+        for env_var, var_name in ENV_VAR_RE.findall(line):
+            value = os.getenv(var_name)
+            if not value:
+                continue
+
+            line = line.replace(env_var, value)
+
+        yield line_number, line
+
+
+def get_file_content(url, session, comes_from=None):
+    # type: (str, PipSession, Optional[str]) -> Tuple[str, Text]
+    """Gets the content of a file; it may be a filename, file: URL, or
+    http: URL.  Returns (location, content).  Content is unicode.
+    Respects # -*- coding: declarations on the retrieved files.
+
+    :param url:         File path or url.
+    :param session:     PipSession instance.
+    :param comes_from:  Origin description of requirements.
+    """
+    scheme = get_url_scheme(url)
+
+    if scheme in ['http', 'https']:
+        # FIXME: catch some errors
+        resp = session.get(url)
+        raise_for_status(resp)
+        return resp.url, resp.text
+
+    elif scheme == 'file':
+        if comes_from and comes_from.startswith('http'):
+            raise InstallationError(
+                'Requirements file {} references URL {}, '
+                'which is local'.format(comes_from, url)
+            )
+
+        path = url.split(':', 1)[1]
+        path = path.replace('\\', '/')
+        match = _url_slash_drive_re.match(path)
+        if match:
+            path = match.group(1) + ':' + path.split('|', 1)[1]
+        path = urllib_parse.unquote(path)
+        if path.startswith('/'):
+            path = '/' + path.lstrip('/')
+        url = path
+
+    try:
+        with open(url, 'rb') as f:
+            content = auto_decode(f.read())
+    except IOError as exc:
+        raise InstallationError(
+            'Could not open requirements file: {}'.format(exc)
+        )
+    return url, content
+
+
+_url_slash_drive_re = re.compile(r'/*([a-z])\|', re.I)
diff --git a/venv/Lib/site-packages/pip/_internal/req/req_install.py b/venv/Lib/site-packages/pip/_internal/req/req_install.py
new file mode 100644
index 000000000..f25cec96a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/req_install.py
@@ -0,0 +1,905 @@
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+from __future__ import absolute_import
+
+import logging
+import os
+import shutil
+import sys
+import uuid
+import zipfile
+
+from pip._vendor import pkg_resources, six
+from pip._vendor.packaging.requirements import Requirement
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.packaging.version import Version
+from pip._vendor.packaging.version import parse as parse_version
+from pip._vendor.pep517.wrappers import Pep517HookCaller
+
+from pip._internal.build_env import NoOpBuildEnvironment
+from pip._internal.exceptions import InstallationError
+from pip._internal.locations import get_scheme
+from pip._internal.models.link import Link
+from pip._internal.operations.build.metadata import generate_metadata
+from pip._internal.operations.build.metadata_legacy import \
+    generate_metadata as generate_metadata_legacy
+from pip._internal.operations.install.editable_legacy import \
+    install_editable as install_editable_legacy
+from pip._internal.operations.install.legacy import LegacyInstallFailure
+from pip._internal.operations.install.legacy import install as install_legacy
+from pip._internal.operations.install.wheel import install_wheel
+from pip._internal.pyproject import load_pyproject_toml, make_pyproject_path
+from pip._internal.req.req_uninstall import UninstallPathSet
+from pip._internal.utils.deprecation import deprecated
+from pip._internal.utils.direct_url_helpers import direct_url_from_link
+from pip._internal.utils.hashes import Hashes
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import (
+    ask_path_exists,
+    backup_dir,
+    display_path,
+    dist_in_site_packages,
+    dist_in_usersite,
+    get_distribution,
+    get_installed_version,
+    hide_url,
+    redact_auth_from_url,
+)
+from pip._internal.utils.packaging import get_metadata
+from pip._internal.utils.temp_dir import TempDirectory, tempdir_kinds
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.virtualenv import running_under_virtualenv
+from pip._internal.vcs import vcs
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Dict, Iterable, List, Optional, Sequence, Union,
+    )
+    from pip._internal.build_env import BuildEnvironment
+    from pip._vendor.pkg_resources import Distribution
+    from pip._vendor.packaging.specifiers import SpecifierSet
+    from pip._vendor.packaging.markers import Marker
+
+
+logger = logging.getLogger(__name__)
+
+
+def _get_dist(metadata_directory):
+    # type: (str) -> Distribution
+    """Return a pkg_resources.Distribution for the provided
+    metadata directory.
+    """
+    dist_dir = metadata_directory.rstrip(os.sep)
+
+    # Build a PathMetadata object, from path to metadata. :wink:
+    base_dir, dist_dir_name = os.path.split(dist_dir)
+    metadata = pkg_resources.PathMetadata(base_dir, dist_dir)
+
+    # Determine the correct Distribution object type.
+    if dist_dir.endswith(".egg-info"):
+        dist_cls = pkg_resources.Distribution
+        dist_name = os.path.splitext(dist_dir_name)[0]
+    else:
+        assert dist_dir.endswith(".dist-info")
+        dist_cls = pkg_resources.DistInfoDistribution
+        dist_name = os.path.splitext(dist_dir_name)[0].split("-")[0]
+
+    return dist_cls(
+        base_dir,
+        project_name=dist_name,
+        metadata=metadata,
+    )
+
+
+class InstallRequirement(object):
+    """
+    Represents something that may be installed later on, may have information
+    about where to fetch the relevant requirement and also contains logic for
+    installing the said requirement.
+    """
+
+    def __init__(
+        self,
+        req,  # type: Optional[Requirement]
+        comes_from,  # type: Optional[Union[str, InstallRequirement]]
+        editable=False,  # type: bool
+        link=None,  # type: Optional[Link]
+        markers=None,  # type: Optional[Marker]
+        use_pep517=None,  # type: Optional[bool]
+        isolated=False,  # type: bool
+        install_options=None,  # type: Optional[List[str]]
+        global_options=None,  # type: Optional[List[str]]
+        hash_options=None,  # type: Optional[Dict[str, List[str]]]
+        constraint=False,  # type: bool
+        extras=(),  # type: Iterable[str]
+        user_supplied=False,  # type: bool
+    ):
+        # type: (...) -> None
+        assert req is None or isinstance(req, Requirement), req
+        self.req = req
+        self.comes_from = comes_from
+        self.constraint = constraint
+        self.editable = editable
+        self.legacy_install_reason = None  # type: Optional[int]
+
+        # source_dir is the local directory where the linked requirement is
+        # located, or unpacked. In case unpacking is needed, creating and
+        # populating source_dir is done by the RequirementPreparer. Note this
+        # is not necessarily the directory where pyproject.toml or setup.py is
+        # located - that one is obtained via unpacked_source_directory.
+        self.source_dir = None  # type: Optional[str]
+        if self.editable:
+            assert link
+            if link.is_file:
+                self.source_dir = os.path.normpath(
+                    os.path.abspath(link.file_path)
+                )
+
+        if link is None and req and req.url:
+            # PEP 508 URL requirement
+            link = Link(req.url)
+        self.link = self.original_link = link
+        self.original_link_is_in_wheel_cache = False
+
+        # Path to any downloaded or already-existing package.
+        self.local_file_path = None  # type: Optional[str]
+        if self.link and self.link.is_file:
+            self.local_file_path = self.link.file_path
+
+        if extras:
+            self.extras = extras
+        elif req:
+            self.extras = {
+                pkg_resources.safe_extra(extra) for extra in req.extras
+            }
+        else:
+            self.extras = set()
+        if markers is None and req:
+            markers = req.marker
+        self.markers = markers
+
+        # This holds the pkg_resources.Distribution object if this requirement
+        # is already available:
+        self.satisfied_by = None  # type: Optional[Distribution]
+        # Whether the installation process should try to uninstall an existing
+        # distribution before installing this requirement.
+        self.should_reinstall = False
+        # Temporary build location
+        self._temp_build_dir = None  # type: Optional[TempDirectory]
+        # Set to True after successful installation
+        self.install_succeeded = None  # type: Optional[bool]
+        # Supplied options
+        self.install_options = install_options if install_options else []
+        self.global_options = global_options if global_options else []
+        self.hash_options = hash_options if hash_options else {}
+        # Set to True after successful preparation of this requirement
+        self.prepared = False
+        # User supplied requirement are explicitly requested for installation
+        # by the user via CLI arguments or requirements files, as opposed to,
+        # e.g. dependencies, extras or constraints.
+        self.user_supplied = user_supplied
+
+        # Set by the legacy resolver when the requirement has been downloaded
+        # TODO: This introduces a strong coupling between the resolver and the
+        #       requirement (the coupling was previously between the resolver
+        #       and the requirement set). This should be refactored to allow
+        #       the requirement to decide for itself when it has been
+        #       successfully downloaded - but that is more tricky to get right,
+        #       se we are making the change in stages.
+        self.successfully_downloaded = False
+
+        self.isolated = isolated
+        self.build_env = NoOpBuildEnvironment()  # type: BuildEnvironment
+
+        # For PEP 517, the directory where we request the project metadata
+        # gets stored. We need this to pass to build_wheel, so the backend
+        # can ensure that the wheel matches the metadata (see the PEP for
+        # details).
+        self.metadata_directory = None  # type: Optional[str]
+
+        # The static build requirements (from pyproject.toml)
+        self.pyproject_requires = None  # type: Optional[List[str]]
+
+        # Build requirements that we will check are available
+        self.requirements_to_check = []  # type: List[str]
+
+        # The PEP 517 backend we should use to build the project
+        self.pep517_backend = None  # type: Optional[Pep517HookCaller]
+
+        # Are we using PEP 517 for this requirement?
+        # After pyproject.toml has been loaded, the only valid values are True
+        # and False. Before loading, None is valid (meaning "use the default").
+        # Setting an explicit value before loading pyproject.toml is supported,
+        # but after loading this flag should be treated as read only.
+        self.use_pep517 = use_pep517
+
+    def __str__(self):
+        # type: () -> str
+        if self.req:
+            s = str(self.req)
+            if self.link:
+                s += ' from {}'.format(redact_auth_from_url(self.link.url))
+        elif self.link:
+            s = redact_auth_from_url(self.link.url)
+        else:
+            s = '<InstallRequirement>'
+        if self.satisfied_by is not None:
+            s += ' in {}'.format(display_path(self.satisfied_by.location))
+        if self.comes_from:
+            if isinstance(self.comes_from, six.string_types):
+                comes_from = self.comes_from  # type: Optional[str]
+            else:
+                comes_from = self.comes_from.from_path()
+            if comes_from:
+                s += ' (from {})'.format(comes_from)
+        return s
+
+    def __repr__(self):
+        # type: () -> str
+        return '<{} object: {} editable={!r}>'.format(
+            self.__class__.__name__, str(self), self.editable)
+
+    def format_debug(self):
+        # type: () -> str
+        """An un-tested helper for getting state, for debugging.
+        """
+        attributes = vars(self)
+        names = sorted(attributes)
+
+        state = (
+            "{}={!r}".format(attr, attributes[attr]) for attr in sorted(names)
+        )
+        return '<{name} object: {{{state}}}>'.format(
+            name=self.__class__.__name__,
+            state=", ".join(state),
+        )
+
+    # Things that are valid for all kinds of requirements?
+    @property
+    def name(self):
+        # type: () -> Optional[str]
+        if self.req is None:
+            return None
+        return six.ensure_str(pkg_resources.safe_name(self.req.name))
+
+    @property
+    def specifier(self):
+        # type: () -> SpecifierSet
+        return self.req.specifier
+
+    @property
+    def is_pinned(self):
+        # type: () -> bool
+        """Return whether I am pinned to an exact version.
+
+        For example, some-package==1.2 is pinned; some-package>1.2 is not.
+        """
+        specifiers = self.specifier
+        return (len(specifiers) == 1 and
+                next(iter(specifiers)).operator in {'==', '==='})
+
+    @property
+    def installed_version(self):
+        # type: () -> Optional[str]
+        return get_installed_version(self.name)
+
+    def match_markers(self, extras_requested=None):
+        # type: (Optional[Iterable[str]]) -> bool
+        if not extras_requested:
+            # Provide an extra to safely evaluate the markers
+            # without matching any extra
+            extras_requested = ('',)
+        if self.markers is not None:
+            return any(
+                self.markers.evaluate({'extra': extra})
+                for extra in extras_requested)
+        else:
+            return True
+
+    @property
+    def has_hash_options(self):
+        # type: () -> bool
+        """Return whether any known-good hashes are specified as options.
+
+        These activate --require-hashes mode; hashes specified as part of a
+        URL do not.
+
+        """
+        return bool(self.hash_options)
+
+    def hashes(self, trust_internet=True):
+        # type: (bool) -> Hashes
+        """Return a hash-comparer that considers my option- and URL-based
+        hashes to be known-good.
+
+        Hashes in URLs--ones embedded in the requirements file, not ones
+        downloaded from an index server--are almost peers with ones from
+        flags. They satisfy --require-hashes (whether it was implicitly or
+        explicitly activated) but do not activate it. md5 and sha224 are not
+        allowed in flags, which should nudge people toward good algos. We
+        always OR all hashes together, even ones from URLs.
+
+        :param trust_internet: Whether to trust URL-based (#md5=...) hashes
+            downloaded from the internet, as by populate_link()
+
+        """
+        good_hashes = self.hash_options.copy()
+        link = self.link if trust_internet else self.original_link
+        if link and link.hash:
+            good_hashes.setdefault(link.hash_name, []).append(link.hash)
+        return Hashes(good_hashes)
+
+    def from_path(self):
+        # type: () -> Optional[str]
+        """Format a nice indicator to show where this "comes from"
+        """
+        if self.req is None:
+            return None
+        s = str(self.req)
+        if self.comes_from:
+            if isinstance(self.comes_from, six.string_types):
+                comes_from = self.comes_from
+            else:
+                comes_from = self.comes_from.from_path()
+            if comes_from:
+                s += '->' + comes_from
+        return s
+
+    def ensure_build_location(self, build_dir, autodelete, parallel_builds):
+        # type: (str, bool, bool) -> str
+        assert build_dir is not None
+        if self._temp_build_dir is not None:
+            assert self._temp_build_dir.path
+            return self._temp_build_dir.path
+        if self.req is None:
+            # Some systems have /tmp as a symlink which confuses custom
+            # builds (such as numpy). Thus, we ensure that the real path
+            # is returned.
+            self._temp_build_dir = TempDirectory(
+                kind=tempdir_kinds.REQ_BUILD, globally_managed=True
+            )
+
+            return self._temp_build_dir.path
+
+        # When parallel builds are enabled, add a UUID to the build directory
+        # name so multiple builds do not interfere with each other.
+        dir_name = canonicalize_name(self.name)
+        if parallel_builds:
+            dir_name = "{}_{}".format(dir_name, uuid.uuid4().hex)
+
+        # FIXME: Is there a better place to create the build_dir? (hg and bzr
+        # need this)
+        if not os.path.exists(build_dir):
+            logger.debug('Creating directory %s', build_dir)
+            os.makedirs(build_dir)
+        actual_build_dir = os.path.join(build_dir, dir_name)
+        # `None` indicates that we respect the globally-configured deletion
+        # settings, which is what we actually want when auto-deleting.
+        delete_arg = None if autodelete else False
+        return TempDirectory(
+            path=actual_build_dir,
+            delete=delete_arg,
+            kind=tempdir_kinds.REQ_BUILD,
+            globally_managed=True,
+        ).path
+
+    def _set_requirement(self):
+        # type: () -> None
+        """Set requirement after generating metadata.
+        """
+        assert self.req is None
+        assert self.metadata is not None
+        assert self.source_dir is not None
+
+        # Construct a Requirement object from the generated metadata
+        if isinstance(parse_version(self.metadata["Version"]), Version):
+            op = "=="
+        else:
+            op = "==="
+
+        self.req = Requirement(
+            "".join([
+                self.metadata["Name"],
+                op,
+                self.metadata["Version"],
+            ])
+        )
+
+    def warn_on_mismatching_name(self):
+        # type: () -> None
+        metadata_name = canonicalize_name(self.metadata["Name"])
+        if canonicalize_name(self.req.name) == metadata_name:
+            # Everything is fine.
+            return
+
+        # If we're here, there's a mismatch. Log a warning about it.
+        logger.warning(
+            'Generating metadata for package %s '
+            'produced metadata for project name %s. Fix your '
+            '#egg=%s fragments.',
+            self.name, metadata_name, self.name
+        )
+        self.req = Requirement(metadata_name)
+
+    def check_if_exists(self, use_user_site):
+        # type: (bool) -> None
+        """Find an installed distribution that satisfies or conflicts
+        with this requirement, and set self.satisfied_by or
+        self.should_reinstall appropriately.
+        """
+        if self.req is None:
+            return
+        existing_dist = get_distribution(self.req.name)
+        if not existing_dist:
+            return
+
+        existing_version = existing_dist.parsed_version
+        if not self.req.specifier.contains(existing_version, prereleases=True):
+            self.satisfied_by = None
+            if use_user_site:
+                if dist_in_usersite(existing_dist):
+                    self.should_reinstall = True
+                elif (running_under_virtualenv() and
+                        dist_in_site_packages(existing_dist)):
+                    raise InstallationError(
+                        "Will not install to the user site because it will "
+                        "lack sys.path precedence to {} in {}".format(
+                            existing_dist.project_name, existing_dist.location)
+                    )
+            else:
+                self.should_reinstall = True
+        else:
+            if self.editable:
+                self.should_reinstall = True
+                # when installing editables, nothing pre-existing should ever
+                # satisfy
+                self.satisfied_by = None
+            else:
+                self.satisfied_by = existing_dist
+
+    # Things valid for wheels
+    @property
+    def is_wheel(self):
+        # type: () -> bool
+        if not self.link:
+            return False
+        return self.link.is_wheel
+
+    # Things valid for sdists
+    @property
+    def unpacked_source_directory(self):
+        # type: () -> str
+        return os.path.join(
+            self.source_dir,
+            self.link and self.link.subdirectory_fragment or '')
+
+    @property
+    def setup_py_path(self):
+        # type: () -> str
+        assert self.source_dir, "No source dir for {}".format(self)
+        setup_py = os.path.join(self.unpacked_source_directory, 'setup.py')
+
+        # Python2 __file__ should not be unicode
+        if six.PY2 and isinstance(setup_py, six.text_type):
+            setup_py = setup_py.encode(sys.getfilesystemencoding())
+
+        return setup_py
+
+    @property
+    def pyproject_toml_path(self):
+        # type: () -> str
+        assert self.source_dir, "No source dir for {}".format(self)
+        return make_pyproject_path(self.unpacked_source_directory)
+
+    def load_pyproject_toml(self):
+        # type: () -> None
+        """Load the pyproject.toml file.
+
+        After calling this routine, all of the attributes related to PEP 517
+        processing for this requirement have been set. In particular, the
+        use_pep517 attribute can be used to determine whether we should
+        follow the PEP 517 or legacy (setup.py) code path.
+        """
+        pyproject_toml_data = load_pyproject_toml(
+            self.use_pep517,
+            self.pyproject_toml_path,
+            self.setup_py_path,
+            str(self)
+        )
+
+        if pyproject_toml_data is None:
+            self.use_pep517 = False
+            return
+
+        self.use_pep517 = True
+        requires, backend, check, backend_path = pyproject_toml_data
+        self.requirements_to_check = check
+        self.pyproject_requires = requires
+        self.pep517_backend = Pep517HookCaller(
+            self.unpacked_source_directory, backend, backend_path=backend_path,
+        )
+
+    def _generate_metadata(self):
+        # type: () -> str
+        """Invokes metadata generator functions, with the required arguments.
+        """
+        if not self.use_pep517:
+            assert self.unpacked_source_directory
+
+            return generate_metadata_legacy(
+                build_env=self.build_env,
+                setup_py_path=self.setup_py_path,
+                source_dir=self.unpacked_source_directory,
+                isolated=self.isolated,
+                details=self.name or "from {}".format(self.link)
+            )
+
+        assert self.pep517_backend is not None
+
+        return generate_metadata(
+            build_env=self.build_env,
+            backend=self.pep517_backend,
+        )
+
+    def prepare_metadata(self):
+        # type: () -> None
+        """Ensure that project metadata is available.
+
+        Under PEP 517, call the backend hook to prepare the metadata.
+        Under legacy processing, call setup.py egg-info.
+        """
+        assert self.source_dir
+
+        with indent_log():
+            self.metadata_directory = self._generate_metadata()
+
+        # Act on the newly generated metadata, based on the name and version.
+        if not self.name:
+            self._set_requirement()
+        else:
+            self.warn_on_mismatching_name()
+
+        self.assert_source_matches_version()
+
+    @property
+    def metadata(self):
+        # type: () -> Any
+        if not hasattr(self, '_metadata'):
+            self._metadata = get_metadata(self.get_dist())
+
+        return self._metadata
+
+    def get_dist(self):
+        # type: () -> Distribution
+        return _get_dist(self.metadata_directory)
+
+    def assert_source_matches_version(self):
+        # type: () -> None
+        assert self.source_dir
+        version = self.metadata['version']
+        if self.req.specifier and version not in self.req.specifier:
+            logger.warning(
+                'Requested %s, but installing version %s',
+                self,
+                version,
+            )
+        else:
+            logger.debug(
+                'Source in %s has version %s, which satisfies requirement %s',
+                display_path(self.source_dir),
+                version,
+                self,
+            )
+
+    # For both source distributions and editables
+    def ensure_has_source_dir(
+        self,
+        parent_dir,
+        autodelete=False,
+        parallel_builds=False,
+    ):
+        # type: (str, bool, bool) -> None
+        """Ensure that a source_dir is set.
+
+        This will create a temporary build dir if the name of the requirement
+        isn't known yet.
+
+        :param parent_dir: The ideal pip parent_dir for the source_dir.
+            Generally src_dir for editables and build_dir for sdists.
+        :return: self.source_dir
+        """
+        if self.source_dir is None:
+            self.source_dir = self.ensure_build_location(
+                parent_dir,
+                autodelete=autodelete,
+                parallel_builds=parallel_builds,
+            )
+
+    # For editable installations
+    def update_editable(self, obtain=True):
+        # type: (bool) -> None
+        if not self.link:
+            logger.debug(
+                "Cannot update repository at %s; repository location is "
+                "unknown",
+                self.source_dir,
+            )
+            return
+        assert self.editable
+        assert self.source_dir
+        if self.link.scheme == 'file':
+            # Static paths don't get updated
+            return
+        assert '+' in self.link.url, \
+            "bad url: {self.link.url!r}".format(**locals())
+        vc_type, url = self.link.url.split('+', 1)
+        vcs_backend = vcs.get_backend(vc_type)
+        if vcs_backend:
+            if not self.link.is_vcs:
+                reason = (
+                    "This form of VCS requirement is being deprecated: {}."
+                ).format(
+                    self.link.url
+                )
+                replacement = None
+                if self.link.url.startswith("git+git@"):
+                    replacement = (
+                        "git+https://git@example.com/..., "
+                        "git+ssh://git@example.com/..., "
+                        "or the insecure git+git://git@example.com/..."
+                    )
+                deprecated(reason, replacement, gone_in="21.0", issue=7554)
+            hidden_url = hide_url(self.link.url)
+            if obtain:
+                vcs_backend.obtain(self.source_dir, url=hidden_url)
+            else:
+                vcs_backend.export(self.source_dir, url=hidden_url)
+        else:
+            assert 0, (
+                'Unexpected version control type (in {}): {}'.format(
+                    self.link, vc_type))
+
+    # Top-level Actions
+    def uninstall(self, auto_confirm=False, verbose=False):
+        # type: (bool, bool) -> Optional[UninstallPathSet]
+        """
+        Uninstall the distribution currently satisfying this requirement.
+
+        Prompts before removing or modifying files unless
+        ``auto_confirm`` is True.
+
+        Refuses to delete or modify files outside of ``sys.prefix`` -
+        thus uninstallation within a virtual environment can only
+        modify that virtual environment, even if the virtualenv is
+        linked to global site-packages.
+
+        """
+        assert self.req
+        dist = get_distribution(self.req.name)
+        if not dist:
+            logger.warning("Skipping %s as it is not installed.", self.name)
+            return None
+        logger.info('Found existing installation: %s', dist)
+
+        uninstalled_pathset = UninstallPathSet.from_dist(dist)
+        uninstalled_pathset.remove(auto_confirm, verbose)
+        return uninstalled_pathset
+
+    def _get_archive_name(self, path, parentdir, rootdir):
+        # type: (str, str, str) -> str
+
+        def _clean_zip_name(name, prefix):
+            # type: (str, str) -> str
+            assert name.startswith(prefix + os.path.sep), (
+                "name {name!r} doesn't start with prefix {prefix!r}"
+                .format(**locals())
+            )
+            name = name[len(prefix) + 1:]
+            name = name.replace(os.path.sep, '/')
+            return name
+
+        path = os.path.join(parentdir, path)
+        name = _clean_zip_name(path, rootdir)
+        return self.name + '/' + name
+
+    def archive(self, build_dir):
+        # type: (str) -> None
+        """Saves archive to provided build_dir.
+
+        Used for saving downloaded VCS requirements as part of `pip download`.
+        """
+        assert self.source_dir
+
+        create_archive = True
+        archive_name = '{}-{}.zip'.format(self.name, self.metadata["version"])
+        archive_path = os.path.join(build_dir, archive_name)
+
+        if os.path.exists(archive_path):
+            response = ask_path_exists(
+                'The file {} exists. (i)gnore, (w)ipe, '
+                '(b)ackup, (a)bort '.format(
+                    display_path(archive_path)),
+                ('i', 'w', 'b', 'a'))
+            if response == 'i':
+                create_archive = False
+            elif response == 'w':
+                logger.warning('Deleting %s', display_path(archive_path))
+                os.remove(archive_path)
+            elif response == 'b':
+                dest_file = backup_dir(archive_path)
+                logger.warning(
+                    'Backing up %s to %s',
+                    display_path(archive_path),
+                    display_path(dest_file),
+                )
+                shutil.move(archive_path, dest_file)
+            elif response == 'a':
+                sys.exit(-1)
+
+        if not create_archive:
+            return
+
+        zip_output = zipfile.ZipFile(
+            archive_path, 'w', zipfile.ZIP_DEFLATED, allowZip64=True,
+        )
+        with zip_output:
+            dir = os.path.normcase(
+                os.path.abspath(self.unpacked_source_directory)
+            )
+            for dirpath, dirnames, filenames in os.walk(dir):
+                for dirname in dirnames:
+                    dir_arcname = self._get_archive_name(
+                        dirname, parentdir=dirpath, rootdir=dir,
+                    )
+                    zipdir = zipfile.ZipInfo(dir_arcname + '/')
+                    zipdir.external_attr = 0x1ED << 16  # 0o755
+                    zip_output.writestr(zipdir, '')
+                for filename in filenames:
+                    file_arcname = self._get_archive_name(
+                        filename, parentdir=dirpath, rootdir=dir,
+                    )
+                    filename = os.path.join(dirpath, filename)
+                    zip_output.write(filename, file_arcname)
+
+        logger.info('Saved %s', display_path(archive_path))
+
+    def install(
+        self,
+        install_options,  # type: List[str]
+        global_options=None,  # type: Optional[Sequence[str]]
+        root=None,  # type: Optional[str]
+        home=None,  # type: Optional[str]
+        prefix=None,  # type: Optional[str]
+        warn_script_location=True,  # type: bool
+        use_user_site=False,  # type: bool
+        pycompile=True  # type: bool
+    ):
+        # type: (...) -> None
+        scheme = get_scheme(
+            self.name,
+            user=use_user_site,
+            home=home,
+            root=root,
+            isolated=self.isolated,
+            prefix=prefix,
+        )
+
+        global_options = global_options if global_options is not None else []
+        if self.editable:
+            install_editable_legacy(
+                install_options,
+                global_options,
+                prefix=prefix,
+                home=home,
+                use_user_site=use_user_site,
+                name=self.name,
+                setup_py_path=self.setup_py_path,
+                isolated=self.isolated,
+                build_env=self.build_env,
+                unpacked_source_directory=self.unpacked_source_directory,
+            )
+            self.install_succeeded = True
+            return
+
+        if self.is_wheel:
+            assert self.local_file_path
+            direct_url = None
+            if self.original_link:
+                direct_url = direct_url_from_link(
+                    self.original_link,
+                    self.source_dir,
+                    self.original_link_is_in_wheel_cache,
+                )
+            install_wheel(
+                self.name,
+                self.local_file_path,
+                scheme=scheme,
+                req_description=str(self.req),
+                pycompile=pycompile,
+                warn_script_location=warn_script_location,
+                direct_url=direct_url,
+                requested=self.user_supplied,
+            )
+            self.install_succeeded = True
+            return
+
+        # TODO: Why don't we do this for editable installs?
+
+        # Extend the list of global and install options passed on to
+        # the setup.py call with the ones from the requirements file.
+        # Options specified in requirements file override those
+        # specified on the command line, since the last option given
+        # to setup.py is the one that is used.
+        global_options = list(global_options) + self.global_options
+        install_options = list(install_options) + self.install_options
+
+        try:
+            success = install_legacy(
+                install_options=install_options,
+                global_options=global_options,
+                root=root,
+                home=home,
+                prefix=prefix,
+                use_user_site=use_user_site,
+                pycompile=pycompile,
+                scheme=scheme,
+                setup_py_path=self.setup_py_path,
+                isolated=self.isolated,
+                req_name=self.name,
+                build_env=self.build_env,
+                unpacked_source_directory=self.unpacked_source_directory,
+                req_description=str(self.req),
+            )
+        except LegacyInstallFailure as exc:
+            self.install_succeeded = False
+            six.reraise(*exc.parent)
+        except Exception:
+            self.install_succeeded = True
+            raise
+
+        self.install_succeeded = success
+
+        if success and self.legacy_install_reason == 8368:
+            deprecated(
+                reason=(
+                    "{} was installed using the legacy 'setup.py install' "
+                    "method, because a wheel could not be built for it.".
+                    format(self.name)
+                ),
+                replacement="to fix the wheel build issue reported above",
+                gone_in="21.0",
+                issue=8368,
+            )
+
+
+def check_invalid_constraint_type(req):
+    # type: (InstallRequirement) -> str
+
+    # Check for unsupported forms
+    problem = ""
+    if not req.name:
+        problem = "Unnamed requirements are not allowed as constraints"
+    elif req.link:
+        problem = "Links are not allowed as constraints"
+    elif req.extras:
+        problem = "Constraints cannot have extras"
+
+    if problem:
+        deprecated(
+            reason=(
+                "Constraints are only allowed to take the form of a package "
+                "name and a version specifier. Other forms were originally "
+                "permitted as an accident of the implementation, but were "
+                "undocumented. The new implementation of the resolver no "
+                "longer supports these forms."
+            ),
+            replacement=(
+                "replacing the constraint with a requirement."
+            ),
+            # No plan yet for when the new resolver becomes default
+            gone_in=None,
+            issue=8210
+        )
+
+    return problem
diff --git a/venv/Lib/site-packages/pip/_internal/req/req_set.py b/venv/Lib/site-packages/pip/_internal/req/req_set.py
new file mode 100644
index 000000000..ab4b6f849
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/req_set.py
@@ -0,0 +1,203 @@
+from __future__ import absolute_import
+
+import logging
+from collections import OrderedDict
+
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.models.wheel import Wheel
+from pip._internal.utils import compatibility_tags
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, Iterable, List, Optional, Tuple
+    from pip._internal.req.req_install import InstallRequirement
+
+
+logger = logging.getLogger(__name__)
+
+
+class RequirementSet(object):
+
+    def __init__(self, check_supported_wheels=True):
+        # type: (bool) -> None
+        """Create a RequirementSet.
+        """
+
+        self.requirements = OrderedDict()  # type: Dict[str, InstallRequirement]  # noqa: E501
+        self.check_supported_wheels = check_supported_wheels
+
+        self.unnamed_requirements = []  # type: List[InstallRequirement]
+
+    def __str__(self):
+        # type: () -> str
+        requirements = sorted(
+            (req for req in self.requirements.values() if not req.comes_from),
+            key=lambda req: canonicalize_name(req.name),
+        )
+        return ' '.join(str(req.req) for req in requirements)
+
+    def __repr__(self):
+        # type: () -> str
+        requirements = sorted(
+            self.requirements.values(),
+            key=lambda req: canonicalize_name(req.name),
+        )
+
+        format_string = '<{classname} object; {count} requirement(s): {reqs}>'
+        return format_string.format(
+            classname=self.__class__.__name__,
+            count=len(requirements),
+            reqs=', '.join(str(req.req) for req in requirements),
+        )
+
+    def add_unnamed_requirement(self, install_req):
+        # type: (InstallRequirement) -> None
+        assert not install_req.name
+        self.unnamed_requirements.append(install_req)
+
+    def add_named_requirement(self, install_req):
+        # type: (InstallRequirement) -> None
+        assert install_req.name
+
+        project_name = canonicalize_name(install_req.name)
+        self.requirements[project_name] = install_req
+
+    def add_requirement(
+        self,
+        install_req,  # type: InstallRequirement
+        parent_req_name=None,  # type: Optional[str]
+        extras_requested=None  # type: Optional[Iterable[str]]
+    ):
+        # type: (...) -> Tuple[List[InstallRequirement], Optional[InstallRequirement]]  # noqa: E501
+        """Add install_req as a requirement to install.
+
+        :param parent_req_name: The name of the requirement that needed this
+            added. The name is used because when multiple unnamed requirements
+            resolve to the same name, we could otherwise end up with dependency
+            links that point outside the Requirements set. parent_req must
+            already be added. Note that None implies that this is a user
+            supplied requirement, vs an inferred one.
+        :param extras_requested: an iterable of extras used to evaluate the
+            environment markers.
+        :return: Additional requirements to scan. That is either [] if
+            the requirement is not applicable, or [install_req] if the
+            requirement is applicable and has just been added.
+        """
+        # If the markers do not match, ignore this requirement.
+        if not install_req.match_markers(extras_requested):
+            logger.info(
+                "Ignoring %s: markers '%s' don't match your environment",
+                install_req.name, install_req.markers,
+            )
+            return [], None
+
+        # If the wheel is not supported, raise an error.
+        # Should check this after filtering out based on environment markers to
+        # allow specifying different wheels based on the environment/OS, in a
+        # single requirements file.
+        if install_req.link and install_req.link.is_wheel:
+            wheel = Wheel(install_req.link.filename)
+            tags = compatibility_tags.get_supported()
+            if (self.check_supported_wheels and not wheel.supported(tags)):
+                raise InstallationError(
+                    "{} is not a supported wheel on this platform.".format(
+                        wheel.filename)
+                )
+
+        # This next bit is really a sanity check.
+        assert not install_req.user_supplied or parent_req_name is None, (
+            "a user supplied req shouldn't have a parent"
+        )
+
+        # Unnamed requirements are scanned again and the requirement won't be
+        # added as a dependency until after scanning.
+        if not install_req.name:
+            self.add_unnamed_requirement(install_req)
+            return [install_req], None
+
+        try:
+            existing_req = self.get_requirement(
+                install_req.name)  # type: Optional[InstallRequirement]
+        except KeyError:
+            existing_req = None
+
+        has_conflicting_requirement = (
+            parent_req_name is None and
+            existing_req and
+            not existing_req.constraint and
+            existing_req.extras == install_req.extras and
+            existing_req.req.specifier != install_req.req.specifier
+        )
+        if has_conflicting_requirement:
+            raise InstallationError(
+                "Double requirement given: {} (already in {}, name={!r})"
+                .format(install_req, existing_req, install_req.name)
+            )
+
+        # When no existing requirement exists, add the requirement as a
+        # dependency and it will be scanned again after.
+        if not existing_req:
+            self.add_named_requirement(install_req)
+            # We'd want to rescan this requirement later
+            return [install_req], install_req
+
+        # Assume there's no need to scan, and that we've already
+        # encountered this for scanning.
+        if install_req.constraint or not existing_req.constraint:
+            return [], existing_req
+
+        does_not_satisfy_constraint = (
+            install_req.link and
+            not (
+                existing_req.link and
+                install_req.link.path == existing_req.link.path
+            )
+        )
+        if does_not_satisfy_constraint:
+            raise InstallationError(
+                "Could not satisfy constraints for '{}': "
+                "installation from path or url cannot be "
+                "constrained to a version".format(install_req.name)
+            )
+        # If we're now installing a constraint, mark the existing
+        # object for real installation.
+        existing_req.constraint = False
+        # If we're now installing a user supplied requirement,
+        # mark the existing object as such.
+        if install_req.user_supplied:
+            existing_req.user_supplied = True
+        existing_req.extras = tuple(sorted(
+            set(existing_req.extras) | set(install_req.extras)
+        ))
+        logger.debug(
+            "Setting %s extras to: %s",
+            existing_req, existing_req.extras,
+        )
+        # Return the existing requirement for addition to the parent and
+        # scanning again.
+        return [existing_req], existing_req
+
+    def has_requirement(self, name):
+        # type: (str) -> bool
+        project_name = canonicalize_name(name)
+
+        return (
+            project_name in self.requirements and
+            not self.requirements[project_name].constraint
+        )
+
+    def get_requirement(self, name):
+        # type: (str) -> InstallRequirement
+        project_name = canonicalize_name(name)
+
+        if project_name in self.requirements:
+            return self.requirements[project_name]
+
+        raise KeyError("No project with the name {name!r}".format(**locals()))
+
+    @property
+    def all_requirements(self):
+        # type: () -> List[InstallRequirement]
+        return self.unnamed_requirements + list(self.requirements.values())
diff --git a/venv/Lib/site-packages/pip/_internal/req/req_tracker.py b/venv/Lib/site-packages/pip/_internal/req/req_tracker.py
new file mode 100644
index 000000000..13fb24563
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/req_tracker.py
@@ -0,0 +1,150 @@
+from __future__ import absolute_import
+
+import contextlib
+import errno
+import hashlib
+import logging
+import os
+
+from pip._vendor import contextlib2
+
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from types import TracebackType
+    from typing import Dict, Iterator, Optional, Set, Type, Union
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.models.link import Link
+
+logger = logging.getLogger(__name__)
+
+
+@contextlib.contextmanager
+def update_env_context_manager(**changes):
+    # type: (str) -> Iterator[None]
+    target = os.environ
+
+    # Save values from the target and change them.
+    non_existent_marker = object()
+    saved_values = {}  # type: Dict[str, Union[object, str]]
+    for name, new_value in changes.items():
+        try:
+            saved_values[name] = target[name]
+        except KeyError:
+            saved_values[name] = non_existent_marker
+        target[name] = new_value
+
+    try:
+        yield
+    finally:
+        # Restore original values in the target.
+        for name, original_value in saved_values.items():
+            if original_value is non_existent_marker:
+                del target[name]
+            else:
+                assert isinstance(original_value, str)  # for mypy
+                target[name] = original_value
+
+
+@contextlib.contextmanager
+def get_requirement_tracker():
+    # type: () -> Iterator[RequirementTracker]
+    root = os.environ.get('PIP_REQ_TRACKER')
+    with contextlib2.ExitStack() as ctx:
+        if root is None:
+            root = ctx.enter_context(
+                TempDirectory(kind='req-tracker')
+            ).path
+            ctx.enter_context(update_env_context_manager(PIP_REQ_TRACKER=root))
+            logger.debug("Initialized build tracking at %s", root)
+
+        with RequirementTracker(root) as tracker:
+            yield tracker
+
+
+class RequirementTracker(object):
+
+    def __init__(self, root):
+        # type: (str) -> None
+        self._root = root
+        self._entries = set()  # type: Set[InstallRequirement]
+        logger.debug("Created build tracker: %s", self._root)
+
+    def __enter__(self):
+        # type: () -> RequirementTracker
+        logger.debug("Entered build tracker: %s", self._root)
+        return self
+
+    def __exit__(
+        self,
+        exc_type,  # type: Optional[Type[BaseException]]
+        exc_val,  # type: Optional[BaseException]
+        exc_tb  # type: Optional[TracebackType]
+    ):
+        # type: (...) -> None
+        self.cleanup()
+
+    def _entry_path(self, link):
+        # type: (Link) -> str
+        hashed = hashlib.sha224(link.url_without_fragment.encode()).hexdigest()
+        return os.path.join(self._root, hashed)
+
+    def add(self, req):
+        # type: (InstallRequirement) -> None
+        """Add an InstallRequirement to build tracking.
+        """
+
+        assert req.link
+        # Get the file to write information about this requirement.
+        entry_path = self._entry_path(req.link)
+
+        # Try reading from the file. If it exists and can be read from, a build
+        # is already in progress, so a LookupError is raised.
+        try:
+            with open(entry_path) as fp:
+                contents = fp.read()
+        except IOError as e:
+            # if the error is anything other than "file does not exist", raise.
+            if e.errno != errno.ENOENT:
+                raise
+        else:
+            message = '{} is already being built: {}'.format(
+                req.link, contents)
+            raise LookupError(message)
+
+        # If we're here, req should really not be building already.
+        assert req not in self._entries
+
+        # Start tracking this requirement.
+        with open(entry_path, 'w') as fp:
+            fp.write(str(req))
+        self._entries.add(req)
+
+        logger.debug('Added %s to build tracker %r', req, self._root)
+
+    def remove(self, req):
+        # type: (InstallRequirement) -> None
+        """Remove an InstallRequirement from build tracking.
+        """
+
+        assert req.link
+        # Delete the created file and the corresponding entries.
+        os.unlink(self._entry_path(req.link))
+        self._entries.remove(req)
+
+        logger.debug('Removed %s from build tracker %r', req, self._root)
+
+    def cleanup(self):
+        # type: () -> None
+        for req in set(self._entries):
+            self.remove(req)
+
+        logger.debug("Removed build tracker: %r", self._root)
+
+    @contextlib.contextmanager
+    def track(self, req):
+        # type: (InstallRequirement) -> Iterator[None]
+        self.add(req)
+        yield
+        self.remove(req)
diff --git a/venv/Lib/site-packages/pip/_internal/req/req_uninstall.py b/venv/Lib/site-packages/pip/_internal/req/req_uninstall.py
new file mode 100644
index 000000000..69719d338
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/req/req_uninstall.py
@@ -0,0 +1,648 @@
+from __future__ import absolute_import
+
+import csv
+import functools
+import logging
+import os
+import sys
+import sysconfig
+
+from pip._vendor import pkg_resources
+
+from pip._internal.exceptions import UninstallationError
+from pip._internal.locations import bin_py, bin_user
+from pip._internal.utils.compat import WINDOWS, cache_from_source, uses_pycache
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import (
+    FakeFile,
+    ask,
+    dist_in_usersite,
+    dist_is_local,
+    egg_link_path,
+    is_local,
+    normalize_path,
+    renames,
+    rmtree,
+)
+from pip._internal.utils.temp_dir import AdjacentTempDirectory, TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Callable, Dict, Iterable, Iterator, List, Optional, Set, Tuple,
+    )
+    from pip._vendor.pkg_resources import Distribution
+
+logger = logging.getLogger(__name__)
+
+
+def _script_names(dist, script_name, is_gui):
+    # type: (Distribution, str, bool) -> List[str]
+    """Create the fully qualified name of the files created by
+    {console,gui}_scripts for the given ``dist``.
+    Returns the list of file names
+    """
+    if dist_in_usersite(dist):
+        bin_dir = bin_user
+    else:
+        bin_dir = bin_py
+    exe_name = os.path.join(bin_dir, script_name)
+    paths_to_remove = [exe_name]
+    if WINDOWS:
+        paths_to_remove.append(exe_name + '.exe')
+        paths_to_remove.append(exe_name + '.exe.manifest')
+        if is_gui:
+            paths_to_remove.append(exe_name + '-script.pyw')
+        else:
+            paths_to_remove.append(exe_name + '-script.py')
+    return paths_to_remove
+
+
+def _unique(fn):
+    # type: (Callable[..., Iterator[Any]]) -> Callable[..., Iterator[Any]]
+    @functools.wraps(fn)
+    def unique(*args, **kw):
+        # type: (Any, Any) -> Iterator[Any]
+        seen = set()  # type: Set[Any]
+        for item in fn(*args, **kw):
+            if item not in seen:
+                seen.add(item)
+                yield item
+    return unique
+
+
+@_unique
+def uninstallation_paths(dist):
+    # type: (Distribution) -> Iterator[str]
+    """
+    Yield all the uninstallation paths for dist based on RECORD-without-.py[co]
+
+    Yield paths to all the files in RECORD. For each .py file in RECORD, add
+    the .pyc and .pyo in the same directory.
+
+    UninstallPathSet.add() takes care of the __pycache__ .py[co].
+    """
+    r = csv.reader(FakeFile(dist.get_metadata_lines('RECORD')))
+    for row in r:
+        path = os.path.join(dist.location, row[0])
+        yield path
+        if path.endswith('.py'):
+            dn, fn = os.path.split(path)
+            base = fn[:-3]
+            path = os.path.join(dn, base + '.pyc')
+            yield path
+            path = os.path.join(dn, base + '.pyo')
+            yield path
+
+
+def compact(paths):
+    # type: (Iterable[str]) -> Set[str]
+    """Compact a path set to contain the minimal number of paths
+    necessary to contain all paths in the set. If /a/path/ and
+    /a/path/to/a/file.txt are both in the set, leave only the
+    shorter path."""
+
+    sep = os.path.sep
+    short_paths = set()  # type: Set[str]
+    for path in sorted(paths, key=len):
+        should_skip = any(
+            path.startswith(shortpath.rstrip("*")) and
+            path[len(shortpath.rstrip("*").rstrip(sep))] == sep
+            for shortpath in short_paths
+        )
+        if not should_skip:
+            short_paths.add(path)
+    return short_paths
+
+
+def compress_for_rename(paths):
+    # type: (Iterable[str]) -> Set[str]
+    """Returns a set containing the paths that need to be renamed.
+
+    This set may include directories when the original sequence of paths
+    included every file on disk.
+    """
+    case_map = dict((os.path.normcase(p), p) for p in paths)
+    remaining = set(case_map)
+    unchecked = sorted(set(os.path.split(p)[0]
+                           for p in case_map.values()), key=len)
+    wildcards = set()  # type: Set[str]
+
+    def norm_join(*a):
+        # type: (str) -> str
+        return os.path.normcase(os.path.join(*a))
+
+    for root in unchecked:
+        if any(os.path.normcase(root).startswith(w)
+               for w in wildcards):
+            # This directory has already been handled.
+            continue
+
+        all_files = set()  # type: Set[str]
+        all_subdirs = set()  # type: Set[str]
+        for dirname, subdirs, files in os.walk(root):
+            all_subdirs.update(norm_join(root, dirname, d)
+                               for d in subdirs)
+            all_files.update(norm_join(root, dirname, f)
+                             for f in files)
+        # If all the files we found are in our remaining set of files to
+        # remove, then remove them from the latter set and add a wildcard
+        # for the directory.
+        if not (all_files - remaining):
+            remaining.difference_update(all_files)
+            wildcards.add(root + os.sep)
+
+    return set(map(case_map.__getitem__, remaining)) | wildcards
+
+
+def compress_for_output_listing(paths):
+    # type: (Iterable[str]) -> Tuple[Set[str], Set[str]]
+    """Returns a tuple of 2 sets of which paths to display to user
+
+    The first set contains paths that would be deleted. Files of a package
+    are not added and the top-level directory of the package has a '*' added
+    at the end - to signify that all it's contents are removed.
+
+    The second set contains files that would have been skipped in the above
+    folders.
+    """
+
+    will_remove = set(paths)
+    will_skip = set()
+
+    # Determine folders and files
+    folders = set()
+    files = set()
+    for path in will_remove:
+        if path.endswith(".pyc"):
+            continue
+        if path.endswith("__init__.py") or ".dist-info" in path:
+            folders.add(os.path.dirname(path))
+        files.add(path)
+
+    # probably this one https://github.com/python/mypy/issues/390
+    _normcased_files = set(map(os.path.normcase, files))  # type: ignore
+
+    folders = compact(folders)
+
+    # This walks the tree using os.walk to not miss extra folders
+    # that might get added.
+    for folder in folders:
+        for dirpath, _, dirfiles in os.walk(folder):
+            for fname in dirfiles:
+                if fname.endswith(".pyc"):
+                    continue
+
+                file_ = os.path.join(dirpath, fname)
+                if (os.path.isfile(file_) and
+                        os.path.normcase(file_) not in _normcased_files):
+                    # We are skipping this file. Add it to the set.
+                    will_skip.add(file_)
+
+    will_remove = files | {
+        os.path.join(folder, "*") for folder in folders
+    }
+
+    return will_remove, will_skip
+
+
+class StashedUninstallPathSet(object):
+    """A set of file rename operations to stash files while
+    tentatively uninstalling them."""
+    def __init__(self):
+        # type: () -> None
+        # Mapping from source file root to [Adjacent]TempDirectory
+        # for files under that directory.
+        self._save_dirs = {}  # type: Dict[str, TempDirectory]
+        # (old path, new path) tuples for each move that may need
+        # to be undone.
+        self._moves = []  # type: List[Tuple[str, str]]
+
+    def _get_directory_stash(self, path):
+        # type: (str) -> str
+        """Stashes a directory.
+
+        Directories are stashed adjacent to their original location if
+        possible, or else moved/copied into the user's temp dir."""
+
+        try:
+            save_dir = AdjacentTempDirectory(path)  # type: TempDirectory
+        except OSError:
+            save_dir = TempDirectory(kind="uninstall")
+        self._save_dirs[os.path.normcase(path)] = save_dir
+
+        return save_dir.path
+
+    def _get_file_stash(self, path):
+        # type: (str) -> str
+        """Stashes a file.
+
+        If no root has been provided, one will be created for the directory
+        in the user's temp directory."""
+        path = os.path.normcase(path)
+        head, old_head = os.path.dirname(path), None
+        save_dir = None
+
+        while head != old_head:
+            try:
+                save_dir = self._save_dirs[head]
+                break
+            except KeyError:
+                pass
+            head, old_head = os.path.dirname(head), head
+        else:
+            # Did not find any suitable root
+            head = os.path.dirname(path)
+            save_dir = TempDirectory(kind='uninstall')
+            self._save_dirs[head] = save_dir
+
+        relpath = os.path.relpath(path, head)
+        if relpath and relpath != os.path.curdir:
+            return os.path.join(save_dir.path, relpath)
+        return save_dir.path
+
+    def stash(self, path):
+        # type: (str) -> str
+        """Stashes the directory or file and returns its new location.
+        Handle symlinks as files to avoid modifying the symlink targets.
+        """
+        path_is_dir = os.path.isdir(path) and not os.path.islink(path)
+        if path_is_dir:
+            new_path = self._get_directory_stash(path)
+        else:
+            new_path = self._get_file_stash(path)
+
+        self._moves.append((path, new_path))
+        if (path_is_dir and os.path.isdir(new_path)):
+            # If we're moving a directory, we need to
+            # remove the destination first or else it will be
+            # moved to inside the existing directory.
+            # We just created new_path ourselves, so it will
+            # be removable.
+            os.rmdir(new_path)
+        renames(path, new_path)
+        return new_path
+
+    def commit(self):
+        # type: () -> None
+        """Commits the uninstall by removing stashed files."""
+        for _, save_dir in self._save_dirs.items():
+            save_dir.cleanup()
+        self._moves = []
+        self._save_dirs = {}
+
+    def rollback(self):
+        # type: () -> None
+        """Undoes the uninstall by moving stashed files back."""
+        for p in self._moves:
+            logger.info("Moving to %s\n from %s", *p)
+
+        for new_path, path in self._moves:
+            try:
+                logger.debug('Replacing %s from %s', new_path, path)
+                if os.path.isfile(new_path) or os.path.islink(new_path):
+                    os.unlink(new_path)
+                elif os.path.isdir(new_path):
+                    rmtree(new_path)
+                renames(path, new_path)
+            except OSError as ex:
+                logger.error("Failed to restore %s", new_path)
+                logger.debug("Exception: %s", ex)
+
+        self.commit()
+
+    @property
+    def can_rollback(self):
+        # type: () -> bool
+        return bool(self._moves)
+
+
+class UninstallPathSet(object):
+    """A set of file paths to be removed in the uninstallation of a
+    requirement."""
+    def __init__(self, dist):
+        # type: (Distribution) -> None
+        self.paths = set()  # type: Set[str]
+        self._refuse = set()  # type: Set[str]
+        self.pth = {}  # type: Dict[str, UninstallPthEntries]
+        self.dist = dist
+        self._moved_paths = StashedUninstallPathSet()
+
+    def _permitted(self, path):
+        # type: (str) -> bool
+        """
+        Return True if the given path is one we are permitted to
+        remove/modify, False otherwise.
+
+        """
+        return is_local(path)
+
+    def add(self, path):
+        # type: (str) -> None
+        head, tail = os.path.split(path)
+
+        # we normalize the head to resolve parent directory symlinks, but not
+        # the tail, since we only want to uninstall symlinks, not their targets
+        path = os.path.join(normalize_path(head), os.path.normcase(tail))
+
+        if not os.path.exists(path):
+            return
+        if self._permitted(path):
+            self.paths.add(path)
+        else:
+            self._refuse.add(path)
+
+        # __pycache__ files can show up after 'installed-files.txt' is created,
+        # due to imports
+        if os.path.splitext(path)[1] == '.py' and uses_pycache:
+            self.add(cache_from_source(path))
+
+    def add_pth(self, pth_file, entry):
+        # type: (str, str) -> None
+        pth_file = normalize_path(pth_file)
+        if self._permitted(pth_file):
+            if pth_file not in self.pth:
+                self.pth[pth_file] = UninstallPthEntries(pth_file)
+            self.pth[pth_file].add(entry)
+        else:
+            self._refuse.add(pth_file)
+
+    def remove(self, auto_confirm=False, verbose=False):
+        # type: (bool, bool) -> None
+        """Remove paths in ``self.paths`` with confirmation (unless
+        ``auto_confirm`` is True)."""
+
+        if not self.paths:
+            logger.info(
+                "Can't uninstall '%s'. No files were found to uninstall.",
+                self.dist.project_name,
+            )
+            return
+
+        dist_name_version = (
+            self.dist.project_name + "-" + self.dist.version
+        )
+        logger.info('Uninstalling %s:', dist_name_version)
+
+        with indent_log():
+            if auto_confirm or self._allowed_to_proceed(verbose):
+                moved = self._moved_paths
+
+                for_rename = compress_for_rename(self.paths)
+
+                for path in sorted(compact(for_rename)):
+                    moved.stash(path)
+                    logger.debug('Removing file or directory %s', path)
+
+                for pth in self.pth.values():
+                    pth.remove()
+
+                logger.info('Successfully uninstalled %s', dist_name_version)
+
+    def _allowed_to_proceed(self, verbose):
+        # type: (bool) -> bool
+        """Display which files would be deleted and prompt for confirmation
+        """
+
+        def _display(msg, paths):
+            # type: (str, Iterable[str]) -> None
+            if not paths:
+                return
+
+            logger.info(msg)
+            with indent_log():
+                for path in sorted(compact(paths)):
+                    logger.info(path)
+
+        if not verbose:
+            will_remove, will_skip = compress_for_output_listing(self.paths)
+        else:
+            # In verbose mode, display all the files that are going to be
+            # deleted.
+            will_remove = set(self.paths)
+            will_skip = set()
+
+        _display('Would remove:', will_remove)
+        _display('Would not remove (might be manually added):', will_skip)
+        _display('Would not remove (outside of prefix):', self._refuse)
+        if verbose:
+            _display('Will actually move:', compress_for_rename(self.paths))
+
+        return ask('Proceed (y/n)? ', ('y', 'n')) == 'y'
+
+    def rollback(self):
+        # type: () -> None
+        """Rollback the changes previously made by remove()."""
+        if not self._moved_paths.can_rollback:
+            logger.error(
+                "Can't roll back %s; was not uninstalled",
+                self.dist.project_name,
+            )
+            return
+        logger.info('Rolling back uninstall of %s', self.dist.project_name)
+        self._moved_paths.rollback()
+        for pth in self.pth.values():
+            pth.rollback()
+
+    def commit(self):
+        # type: () -> None
+        """Remove temporary save dir: rollback will no longer be possible."""
+        self._moved_paths.commit()
+
+    @classmethod
+    def from_dist(cls, dist):
+        # type: (Distribution) -> UninstallPathSet
+        dist_path = normalize_path(dist.location)
+        if not dist_is_local(dist):
+            logger.info(
+                "Not uninstalling %s at %s, outside environment %s",
+                dist.key,
+                dist_path,
+                sys.prefix,
+            )
+            return cls(dist)
+
+        if dist_path in {p for p in {sysconfig.get_path("stdlib"),
+                                     sysconfig.get_path("platstdlib")}
+                         if p}:
+            logger.info(
+                "Not uninstalling %s at %s, as it is in the standard library.",
+                dist.key,
+                dist_path,
+            )
+            return cls(dist)
+
+        paths_to_remove = cls(dist)
+        develop_egg_link = egg_link_path(dist)
+        develop_egg_link_egg_info = '{}.egg-info'.format(
+            pkg_resources.to_filename(dist.project_name))
+        egg_info_exists = dist.egg_info and os.path.exists(dist.egg_info)
+        # Special case for distutils installed package
+        distutils_egg_info = getattr(dist._provider, 'path', None)
+
+        # Uninstall cases order do matter as in the case of 2 installs of the
+        # same package, pip needs to uninstall the currently detected version
+        if (egg_info_exists and dist.egg_info.endswith('.egg-info') and
+                not dist.egg_info.endswith(develop_egg_link_egg_info)):
+            # if dist.egg_info.endswith(develop_egg_link_egg_info), we
+            # are in fact in the develop_egg_link case
+            paths_to_remove.add(dist.egg_info)
+            if dist.has_metadata('installed-files.txt'):
+                for installed_file in dist.get_metadata(
+                        'installed-files.txt').splitlines():
+                    path = os.path.normpath(
+                        os.path.join(dist.egg_info, installed_file)
+                    )
+                    paths_to_remove.add(path)
+            # FIXME: need a test for this elif block
+            # occurs with --single-version-externally-managed/--record outside
+            # of pip
+            elif dist.has_metadata('top_level.txt'):
+                if dist.has_metadata('namespace_packages.txt'):
+                    namespaces = dist.get_metadata('namespace_packages.txt')
+                else:
+                    namespaces = []
+                for top_level_pkg in [
+                        p for p
+                        in dist.get_metadata('top_level.txt').splitlines()
+                        if p and p not in namespaces]:
+                    path = os.path.join(dist.location, top_level_pkg)
+                    paths_to_remove.add(path)
+                    paths_to_remove.add(path + '.py')
+                    paths_to_remove.add(path + '.pyc')
+                    paths_to_remove.add(path + '.pyo')
+
+        elif distutils_egg_info:
+            raise UninstallationError(
+                "Cannot uninstall {!r}. It is a distutils installed project "
+                "and thus we cannot accurately determine which files belong "
+                "to it which would lead to only a partial uninstall.".format(
+                    dist.project_name,
+                )
+            )
+
+        elif dist.location.endswith('.egg'):
+            # package installed by easy_install
+            # We cannot match on dist.egg_name because it can slightly vary
+            # i.e. setuptools-0.6c11-py2.6.egg vs setuptools-0.6rc11-py2.6.egg
+            paths_to_remove.add(dist.location)
+            easy_install_egg = os.path.split(dist.location)[1]
+            easy_install_pth = os.path.join(os.path.dirname(dist.location),
+                                            'easy-install.pth')
+            paths_to_remove.add_pth(easy_install_pth, './' + easy_install_egg)
+
+        elif egg_info_exists and dist.egg_info.endswith('.dist-info'):
+            for path in uninstallation_paths(dist):
+                paths_to_remove.add(path)
+
+        elif develop_egg_link:
+            # develop egg
+            with open(develop_egg_link, 'r') as fh:
+                link_pointer = os.path.normcase(fh.readline().strip())
+            assert (link_pointer == dist.location), (
+                'Egg-link {} does not match installed location of {} '
+                '(at {})'.format(
+                    link_pointer, dist.project_name, dist.location)
+            )
+            paths_to_remove.add(develop_egg_link)
+            easy_install_pth = os.path.join(os.path.dirname(develop_egg_link),
+                                            'easy-install.pth')
+            paths_to_remove.add_pth(easy_install_pth, dist.location)
+
+        else:
+            logger.debug(
+                'Not sure how to uninstall: %s - Check: %s',
+                dist, dist.location,
+            )
+
+        # find distutils scripts= scripts
+        if dist.has_metadata('scripts') and dist.metadata_isdir('scripts'):
+            for script in dist.metadata_listdir('scripts'):
+                if dist_in_usersite(dist):
+                    bin_dir = bin_user
+                else:
+                    bin_dir = bin_py
+                paths_to_remove.add(os.path.join(bin_dir, script))
+                if WINDOWS:
+                    paths_to_remove.add(os.path.join(bin_dir, script) + '.bat')
+
+        # find console_scripts
+        _scripts_to_remove = []
+        console_scripts = dist.get_entry_map(group='console_scripts')
+        for name in console_scripts.keys():
+            _scripts_to_remove.extend(_script_names(dist, name, False))
+        # find gui_scripts
+        gui_scripts = dist.get_entry_map(group='gui_scripts')
+        for name in gui_scripts.keys():
+            _scripts_to_remove.extend(_script_names(dist, name, True))
+
+        for s in _scripts_to_remove:
+            paths_to_remove.add(s)
+
+        return paths_to_remove
+
+
+class UninstallPthEntries(object):
+    def __init__(self, pth_file):
+        # type: (str) -> None
+        self.file = pth_file
+        self.entries = set()  # type: Set[str]
+        self._saved_lines = None  # type: Optional[List[bytes]]
+
+    def add(self, entry):
+        # type: (str) -> None
+        entry = os.path.normcase(entry)
+        # On Windows, os.path.normcase converts the entry to use
+        # backslashes.  This is correct for entries that describe absolute
+        # paths outside of site-packages, but all the others use forward
+        # slashes.
+        # os.path.splitdrive is used instead of os.path.isabs because isabs
+        # treats non-absolute paths with drive letter markings like c:foo\bar
+        # as absolute paths. It also does not recognize UNC paths if they don't
+        # have more than "\\sever\share". Valid examples: "\\server\share\" or
+        # "\\server\share\folder". Python 2.7.8+ support UNC in splitdrive.
+        if WINDOWS and not os.path.splitdrive(entry)[0]:
+            entry = entry.replace('\\', '/')
+        self.entries.add(entry)
+
+    def remove(self):
+        # type: () -> None
+        logger.debug('Removing pth entries from %s:', self.file)
+
+        # If the file doesn't exist, log a warning and return
+        if not os.path.isfile(self.file):
+            logger.warning(
+                "Cannot remove entries from nonexistent file %s", self.file
+            )
+            return
+        with open(self.file, 'rb') as fh:
+            # windows uses '\r\n' with py3k, but uses '\n' with py2.x
+            lines = fh.readlines()
+            self._saved_lines = lines
+        if any(b'\r\n' in line for line in lines):
+            endline = '\r\n'
+        else:
+            endline = '\n'
+        # handle missing trailing newline
+        if lines and not lines[-1].endswith(endline.encode("utf-8")):
+            lines[-1] = lines[-1] + endline.encode("utf-8")
+        for entry in self.entries:
+            try:
+                logger.debug('Removing entry: %s', entry)
+                lines.remove((entry + endline).encode("utf-8"))
+            except ValueError:
+                pass
+        with open(self.file, 'wb') as fh:
+            fh.writelines(lines)
+
+    def rollback(self):
+        # type: () -> bool
+        if self._saved_lines is None:
+            logger.error(
+                'Cannot roll back changes to %s, none were made', self.file
+            )
+            return False
+        logger.debug('Rolling %s back to previous state', self.file)
+        with open(self.file, 'wb') as fh:
+            fh.writelines(self._saved_lines)
+        return True
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/__init__.py b/venv/Lib/site-packages/pip/_internal/resolution/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..73447b5a7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..08410c385
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/base.py b/venv/Lib/site-packages/pip/_internal/resolution/base.py
new file mode 100644
index 000000000..2fa118bd8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/base.py
@@ -0,0 +1,20 @@
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Callable, List
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.req.req_set import RequirementSet
+
+    InstallRequirementProvider = Callable[
+        [str, InstallRequirement], InstallRequirement
+    ]
+
+
+class BaseResolver(object):
+    def resolve(self, root_reqs, check_supported_wheels):
+        # type: (List[InstallRequirement], bool) -> RequirementSet
+        raise NotImplementedError()
+
+    def get_installation_order(self, req_set):
+        # type: (RequirementSet) -> List[InstallRequirement]
+        raise NotImplementedError()
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/legacy/__init__.py b/venv/Lib/site-packages/pip/_internal/resolution/legacy/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..367614940
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/resolver.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/resolver.cpython-36.pyc
new file mode 100644
index 000000000..5669c43ae
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/legacy/__pycache__/resolver.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/legacy/resolver.py b/venv/Lib/site-packages/pip/_internal/resolution/legacy/resolver.py
new file mode 100644
index 000000000..c9b4c6616
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/legacy/resolver.py
@@ -0,0 +1,485 @@
+"""Dependency Resolution
+
+The dependency resolution in pip is performed as follows:
+
+for top-level requirements:
+    a. only one spec allowed per project, regardless of conflicts or not.
+       otherwise a "double requirement" exception is raised
+    b. they override sub-dependency requirements.
+for sub-dependencies
+    a. "first found, wins" (where the order is breadth first)
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+# mypy: disallow-untyped-defs=False
+
+import logging
+import sys
+from collections import defaultdict
+from itertools import chain
+
+from pip._vendor.packaging import specifiers
+
+from pip._internal.exceptions import (
+    BestVersionAlreadyInstalled,
+    DistributionNotFound,
+    HashError,
+    HashErrors,
+    UnsupportedPythonVersion,
+)
+from pip._internal.req.req_install import check_invalid_constraint_type
+from pip._internal.req.req_set import RequirementSet
+from pip._internal.resolution.base import BaseResolver
+from pip._internal.utils.compatibility_tags import get_supported
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import dist_in_usersite, normalize_version_info
+from pip._internal.utils.packaging import (
+    check_requires_python,
+    get_requires_python,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import DefaultDict, List, Optional, Set, Tuple
+    from pip._vendor import pkg_resources
+
+    from pip._internal.cache import WheelCache
+    from pip._internal.distributions import AbstractDistribution
+    from pip._internal.index.package_finder import PackageFinder
+    from pip._internal.models.link import Link
+    from pip._internal.operations.prepare import RequirementPreparer
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.resolution.base import InstallRequirementProvider
+
+    DiscoveredDependencies = DefaultDict[str, List[InstallRequirement]]
+
+logger = logging.getLogger(__name__)
+
+
+def _check_dist_requires_python(
+    dist,  # type: pkg_resources.Distribution
+    version_info,  # type: Tuple[int, int, int]
+    ignore_requires_python=False,  # type: bool
+):
+    # type: (...) -> None
+    """
+    Check whether the given Python version is compatible with a distribution's
+    "Requires-Python" value.
+
+    :param version_info: A 3-tuple of ints representing the Python
+        major-minor-micro version to check.
+    :param ignore_requires_python: Whether to ignore the "Requires-Python"
+        value if the given Python version isn't compatible.
+
+    :raises UnsupportedPythonVersion: When the given Python version isn't
+        compatible.
+    """
+    requires_python = get_requires_python(dist)
+    try:
+        is_compatible = check_requires_python(
+            requires_python, version_info=version_info,
+        )
+    except specifiers.InvalidSpecifier as exc:
+        logger.warning(
+            "Package %r has an invalid Requires-Python: %s",
+            dist.project_name, exc,
+        )
+        return
+
+    if is_compatible:
+        return
+
+    version = '.'.join(map(str, version_info))
+    if ignore_requires_python:
+        logger.debug(
+            'Ignoring failed Requires-Python check for package %r: '
+            '%s not in %r',
+            dist.project_name, version, requires_python,
+        )
+        return
+
+    raise UnsupportedPythonVersion(
+        'Package {!r} requires a different Python: {} not in {!r}'.format(
+            dist.project_name, version, requires_python,
+        ))
+
+
+class Resolver(BaseResolver):
+    """Resolves which packages need to be installed/uninstalled to perform \
+    the requested operation without breaking the requirements of any package.
+    """
+
+    _allowed_strategies = {"eager", "only-if-needed", "to-satisfy-only"}
+
+    def __init__(
+        self,
+        preparer,  # type: RequirementPreparer
+        finder,  # type: PackageFinder
+        wheel_cache,  # type: Optional[WheelCache]
+        make_install_req,  # type: InstallRequirementProvider
+        use_user_site,  # type: bool
+        ignore_dependencies,  # type: bool
+        ignore_installed,  # type: bool
+        ignore_requires_python,  # type: bool
+        force_reinstall,  # type: bool
+        upgrade_strategy,  # type: str
+        py_version_info=None,  # type: Optional[Tuple[int, ...]]
+    ):
+        # type: (...) -> None
+        super(Resolver, self).__init__()
+        assert upgrade_strategy in self._allowed_strategies
+
+        if py_version_info is None:
+            py_version_info = sys.version_info[:3]
+        else:
+            py_version_info = normalize_version_info(py_version_info)
+
+        self._py_version_info = py_version_info
+
+        self.preparer = preparer
+        self.finder = finder
+        self.wheel_cache = wheel_cache
+
+        self.upgrade_strategy = upgrade_strategy
+        self.force_reinstall = force_reinstall
+        self.ignore_dependencies = ignore_dependencies
+        self.ignore_installed = ignore_installed
+        self.ignore_requires_python = ignore_requires_python
+        self.use_user_site = use_user_site
+        self._make_install_req = make_install_req
+
+        self._discovered_dependencies = \
+            defaultdict(list)  # type: DiscoveredDependencies
+
+    def resolve(self, root_reqs, check_supported_wheels):
+        # type: (List[InstallRequirement], bool) -> RequirementSet
+        """Resolve what operations need to be done
+
+        As a side-effect of this method, the packages (and their dependencies)
+        are downloaded, unpacked and prepared for installation. This
+        preparation is done by ``pip.operations.prepare``.
+
+        Once PyPI has static dependency metadata available, it would be
+        possible to move the preparation to become a step separated from
+        dependency resolution.
+        """
+        requirement_set = RequirementSet(
+            check_supported_wheels=check_supported_wheels
+        )
+        for req in root_reqs:
+            if req.constraint:
+                check_invalid_constraint_type(req)
+            requirement_set.add_requirement(req)
+
+        # Actually prepare the files, and collect any exceptions. Most hash
+        # exceptions cannot be checked ahead of time, because
+        # _populate_link() needs to be called before we can make decisions
+        # based on link type.
+        discovered_reqs = []  # type: List[InstallRequirement]
+        hash_errors = HashErrors()
+        for req in chain(requirement_set.all_requirements, discovered_reqs):
+            try:
+                discovered_reqs.extend(self._resolve_one(requirement_set, req))
+            except HashError as exc:
+                exc.req = req
+                hash_errors.append(exc)
+
+        if hash_errors:
+            raise hash_errors
+
+        return requirement_set
+
+    def _is_upgrade_allowed(self, req):
+        # type: (InstallRequirement) -> bool
+        if self.upgrade_strategy == "to-satisfy-only":
+            return False
+        elif self.upgrade_strategy == "eager":
+            return True
+        else:
+            assert self.upgrade_strategy == "only-if-needed"
+            return req.user_supplied or req.constraint
+
+    def _set_req_to_reinstall(self, req):
+        # type: (InstallRequirement) -> None
+        """
+        Set a requirement to be installed.
+        """
+        # Don't uninstall the conflict if doing a user install and the
+        # conflict is not a user install.
+        if not self.use_user_site or dist_in_usersite(req.satisfied_by):
+            req.should_reinstall = True
+        req.satisfied_by = None
+
+    def _check_skip_installed(self, req_to_install):
+        # type: (InstallRequirement) -> Optional[str]
+        """Check if req_to_install should be skipped.
+
+        This will check if the req is installed, and whether we should upgrade
+        or reinstall it, taking into account all the relevant user options.
+
+        After calling this req_to_install will only have satisfied_by set to
+        None if the req_to_install is to be upgraded/reinstalled etc. Any
+        other value will be a dist recording the current thing installed that
+        satisfies the requirement.
+
+        Note that for vcs urls and the like we can't assess skipping in this
+        routine - we simply identify that we need to pull the thing down,
+        then later on it is pulled down and introspected to assess upgrade/
+        reinstalls etc.
+
+        :return: A text reason for why it was skipped, or None.
+        """
+        if self.ignore_installed:
+            return None
+
+        req_to_install.check_if_exists(self.use_user_site)
+        if not req_to_install.satisfied_by:
+            return None
+
+        if self.force_reinstall:
+            self._set_req_to_reinstall(req_to_install)
+            return None
+
+        if not self._is_upgrade_allowed(req_to_install):
+            if self.upgrade_strategy == "only-if-needed":
+                return 'already satisfied, skipping upgrade'
+            return 'already satisfied'
+
+        # Check for the possibility of an upgrade.  For link-based
+        # requirements we have to pull the tree down and inspect to assess
+        # the version #, so it's handled way down.
+        if not req_to_install.link:
+            try:
+                self.finder.find_requirement(req_to_install, upgrade=True)
+            except BestVersionAlreadyInstalled:
+                # Then the best version is installed.
+                return 'already up-to-date'
+            except DistributionNotFound:
+                # No distribution found, so we squash the error.  It will
+                # be raised later when we re-try later to do the install.
+                # Why don't we just raise here?
+                pass
+
+        self._set_req_to_reinstall(req_to_install)
+        return None
+
+    def _find_requirement_link(self, req):
+        # type: (InstallRequirement) -> Optional[Link]
+        upgrade = self._is_upgrade_allowed(req)
+        best_candidate = self.finder.find_requirement(req, upgrade)
+        if not best_candidate:
+            return None
+
+        # Log a warning per PEP 592 if necessary before returning.
+        link = best_candidate.link
+        if link.is_yanked:
+            reason = link.yanked_reason or '<none given>'
+            msg = (
+                # Mark this as a unicode string to prevent
+                # "UnicodeEncodeError: 'ascii' codec can't encode character"
+                # in Python 2 when the reason contains non-ascii characters.
+                u'The candidate selected for download or install is a '
+                'yanked version: {candidate}\n'
+                'Reason for being yanked: {reason}'
+            ).format(candidate=best_candidate, reason=reason)
+            logger.warning(msg)
+
+        return link
+
+    def _populate_link(self, req):
+        # type: (InstallRequirement) -> None
+        """Ensure that if a link can be found for this, that it is found.
+
+        Note that req.link may still be None - if the requirement is already
+        installed and not needed to be upgraded based on the return value of
+        _is_upgrade_allowed().
+
+        If preparer.require_hashes is True, don't use the wheel cache, because
+        cached wheels, always built locally, have different hashes than the
+        files downloaded from the index server and thus throw false hash
+        mismatches. Furthermore, cached wheels at present have undeterministic
+        contents due to file modification times.
+        """
+        if req.link is None:
+            req.link = self._find_requirement_link(req)
+
+        if self.wheel_cache is None or self.preparer.require_hashes:
+            return
+        cache_entry = self.wheel_cache.get_cache_entry(
+            link=req.link,
+            package_name=req.name,
+            supported_tags=get_supported(),
+        )
+        if cache_entry is not None:
+            logger.debug('Using cached wheel link: %s', cache_entry.link)
+            if req.link is req.original_link and cache_entry.persistent:
+                req.original_link_is_in_wheel_cache = True
+            req.link = cache_entry.link
+
+    def _get_abstract_dist_for(self, req):
+        # type: (InstallRequirement) -> AbstractDistribution
+        """Takes a InstallRequirement and returns a single AbstractDist \
+        representing a prepared variant of the same.
+        """
+        if req.editable:
+            return self.preparer.prepare_editable_requirement(req)
+
+        # satisfied_by is only evaluated by calling _check_skip_installed,
+        # so it must be None here.
+        assert req.satisfied_by is None
+        skip_reason = self._check_skip_installed(req)
+
+        if req.satisfied_by:
+            return self.preparer.prepare_installed_requirement(
+                req, skip_reason
+            )
+
+        # We eagerly populate the link, since that's our "legacy" behavior.
+        self._populate_link(req)
+        abstract_dist = self.preparer.prepare_linked_requirement(req)
+
+        # NOTE
+        # The following portion is for determining if a certain package is
+        # going to be re-installed/upgraded or not and reporting to the user.
+        # This should probably get cleaned up in a future refactor.
+
+        # req.req is only avail after unpack for URL
+        # pkgs repeat check_if_exists to uninstall-on-upgrade
+        # (#14)
+        if not self.ignore_installed:
+            req.check_if_exists(self.use_user_site)
+
+        if req.satisfied_by:
+            should_modify = (
+                self.upgrade_strategy != "to-satisfy-only" or
+                self.force_reinstall or
+                self.ignore_installed or
+                req.link.scheme == 'file'
+            )
+            if should_modify:
+                self._set_req_to_reinstall(req)
+            else:
+                logger.info(
+                    'Requirement already satisfied (use --upgrade to upgrade):'
+                    ' %s', req,
+                )
+
+        return abstract_dist
+
+    def _resolve_one(
+        self,
+        requirement_set,  # type: RequirementSet
+        req_to_install,  # type: InstallRequirement
+    ):
+        # type: (...) -> List[InstallRequirement]
+        """Prepare a single requirements file.
+
+        :return: A list of additional InstallRequirements to also install.
+        """
+        # Tell user what we are doing for this requirement:
+        # obtain (editable), skipping, processing (local url), collecting
+        # (remote url or package name)
+        if req_to_install.constraint or req_to_install.prepared:
+            return []
+
+        req_to_install.prepared = True
+
+        abstract_dist = self._get_abstract_dist_for(req_to_install)
+
+        # Parse and return dependencies
+        dist = abstract_dist.get_pkg_resources_distribution()
+        # This will raise UnsupportedPythonVersion if the given Python
+        # version isn't compatible with the distribution's Requires-Python.
+        _check_dist_requires_python(
+            dist, version_info=self._py_version_info,
+            ignore_requires_python=self.ignore_requires_python,
+        )
+
+        more_reqs = []  # type: List[InstallRequirement]
+
+        def add_req(subreq, extras_requested):
+            sub_install_req = self._make_install_req(
+                str(subreq),
+                req_to_install,
+            )
+            parent_req_name = req_to_install.name
+            to_scan_again, add_to_parent = requirement_set.add_requirement(
+                sub_install_req,
+                parent_req_name=parent_req_name,
+                extras_requested=extras_requested,
+            )
+            if parent_req_name and add_to_parent:
+                self._discovered_dependencies[parent_req_name].append(
+                    add_to_parent
+                )
+            more_reqs.extend(to_scan_again)
+
+        with indent_log():
+            # We add req_to_install before its dependencies, so that we
+            # can refer to it when adding dependencies.
+            if not requirement_set.has_requirement(req_to_install.name):
+                # 'unnamed' requirements will get added here
+                # 'unnamed' requirements can only come from being directly
+                # provided by the user.
+                assert req_to_install.user_supplied
+                requirement_set.add_requirement(
+                    req_to_install, parent_req_name=None,
+                )
+
+            if not self.ignore_dependencies:
+                if req_to_install.extras:
+                    logger.debug(
+                        "Installing extra requirements: %r",
+                        ','.join(req_to_install.extras),
+                    )
+                missing_requested = sorted(
+                    set(req_to_install.extras) - set(dist.extras)
+                )
+                for missing in missing_requested:
+                    logger.warning(
+                        "%s does not provide the extra '%s'",
+                        dist, missing
+                    )
+
+                available_requested = sorted(
+                    set(dist.extras) & set(req_to_install.extras)
+                )
+                for subreq in dist.requires(available_requested):
+                    add_req(subreq, extras_requested=available_requested)
+
+            if not req_to_install.editable and not req_to_install.satisfied_by:
+                # XXX: --no-install leads this to report 'Successfully
+                # downloaded' for only non-editable reqs, even though we took
+                # action on them.
+                req_to_install.successfully_downloaded = True
+
+        return more_reqs
+
+    def get_installation_order(self, req_set):
+        # type: (RequirementSet) -> List[InstallRequirement]
+        """Create the installation order.
+
+        The installation order is topological - requirements are installed
+        before the requiring thing. We break cycles at an arbitrary point,
+        and make no other guarantees.
+        """
+        # The current implementation, which we may change at any point
+        # installs the user specified things in the order given, except when
+        # dependencies must come earlier to achieve topological order.
+        order = []
+        ordered_reqs = set()  # type: Set[InstallRequirement]
+
+        def schedule(req):
+            if req.satisfied_by or req in ordered_reqs:
+                return
+            if req.constraint:
+                return
+            ordered_reqs.add(req)
+            for dep in self._discovered_dependencies[req.name]:
+                schedule(dep)
+            order.append(req)
+
+        for install_req in req_set.requirements.values():
+            schedule(install_req)
+        return order
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__init__.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..080be64f3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..23ce9402a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/candidates.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/candidates.cpython-36.pyc
new file mode 100644
index 000000000..63e9453c8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/candidates.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/factory.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/factory.cpython-36.pyc
new file mode 100644
index 000000000..0b946ad7e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/factory.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/provider.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/provider.cpython-36.pyc
new file mode 100644
index 000000000..11eddf646
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/provider.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/requirements.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/requirements.cpython-36.pyc
new file mode 100644
index 000000000..266addd4d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/requirements.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/resolver.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/resolver.cpython-36.pyc
new file mode 100644
index 000000000..e4c533579
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/__pycache__/resolver.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/base.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/base.py
new file mode 100644
index 000000000..9245747bf
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/base.py
@@ -0,0 +1,82 @@
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import FrozenSet, Iterable, Optional, Tuple
+
+    from pip._vendor.packaging.version import _BaseVersion
+
+    from pip._internal.models.link import Link
+    from pip._internal.req.req_install import InstallRequirement
+
+    CandidateLookup = Tuple[
+        Optional["Candidate"],
+        Optional[InstallRequirement],
+    ]
+
+
+def format_name(project, extras):
+    # type: (str, FrozenSet[str]) -> str
+    if not extras:
+        return project
+    canonical_extras = sorted(canonicalize_name(e) for e in extras)
+    return "{}[{}]".format(project, ",".join(canonical_extras))
+
+
+class Requirement(object):
+    @property
+    def name(self):
+        # type: () -> str
+        raise NotImplementedError("Subclass should override")
+
+    def is_satisfied_by(self, candidate):
+        # type: (Candidate) -> bool
+        return False
+
+    def get_candidate_lookup(self):
+        # type: () -> CandidateLookup
+        raise NotImplementedError("Subclass should override")
+
+    def format_for_error(self):
+        # type: () -> str
+        raise NotImplementedError("Subclass should override")
+
+
+class Candidate(object):
+    @property
+    def name(self):
+        # type: () -> str
+        raise NotImplementedError("Override in subclass")
+
+    @property
+    def version(self):
+        # type: () -> _BaseVersion
+        raise NotImplementedError("Override in subclass")
+
+    @property
+    def is_installed(self):
+        # type: () -> bool
+        raise NotImplementedError("Override in subclass")
+
+    @property
+    def is_editable(self):
+        # type: () -> bool
+        raise NotImplementedError("Override in subclass")
+
+    @property
+    def source_link(self):
+        # type: () -> Optional[Link]
+        raise NotImplementedError("Override in subclass")
+
+    def iter_dependencies(self, with_requires):
+        # type: (bool) -> Iterable[Optional[Requirement]]
+        raise NotImplementedError("Override in subclass")
+
+    def get_install_requirement(self):
+        # type: () -> Optional[InstallRequirement]
+        raise NotImplementedError("Override in subclass")
+
+    def format_for_error(self):
+        # type: () -> str
+        raise NotImplementedError("Subclass should override")
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/candidates.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/candidates.py
new file mode 100644
index 000000000..46cc7e7a2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/candidates.py
@@ -0,0 +1,600 @@
+import logging
+import sys
+
+from pip._vendor.contextlib2 import suppress
+from pip._vendor.packaging.specifiers import InvalidSpecifier, SpecifierSet
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.packaging.version import Version
+
+from pip._internal.exceptions import HashError, MetadataInconsistent
+from pip._internal.network.lazy_wheel import (
+    HTTPRangeRequestUnsupported,
+    dist_from_wheel_url,
+)
+from pip._internal.req.constructors import (
+    install_req_from_editable,
+    install_req_from_line,
+)
+from pip._internal.req.req_install import InstallRequirement
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import dist_is_editable, normalize_version_info
+from pip._internal.utils.packaging import get_requires_python
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+from .base import Candidate, format_name
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, FrozenSet, Iterable, Optional, Tuple, Union
+
+    from pip._vendor.packaging.version import _BaseVersion
+    from pip._vendor.pkg_resources import Distribution
+
+    from pip._internal.distributions import AbstractDistribution
+    from pip._internal.models.link import Link
+
+    from .base import Requirement
+    from .factory import Factory
+
+    BaseCandidate = Union[
+        "AlreadyInstalledCandidate",
+        "EditableCandidate",
+        "LinkCandidate",
+    ]
+
+
+logger = logging.getLogger(__name__)
+
+
+def make_install_req_from_link(link, template):
+    # type: (Link, InstallRequirement) -> InstallRequirement
+    assert not template.editable, "template is editable"
+    if template.req:
+        line = str(template.req)
+    else:
+        line = link.url
+    ireq = install_req_from_line(
+        line,
+        user_supplied=template.user_supplied,
+        comes_from=template.comes_from,
+        use_pep517=template.use_pep517,
+        isolated=template.isolated,
+        constraint=template.constraint,
+        options=dict(
+            install_options=template.install_options,
+            global_options=template.global_options,
+            hashes=template.hash_options
+        ),
+    )
+    ireq.original_link = template.original_link
+    ireq.link = link
+    return ireq
+
+
+def make_install_req_from_editable(link, template):
+    # type: (Link, InstallRequirement) -> InstallRequirement
+    assert template.editable, "template not editable"
+    return install_req_from_editable(
+        link.url,
+        user_supplied=template.user_supplied,
+        comes_from=template.comes_from,
+        use_pep517=template.use_pep517,
+        isolated=template.isolated,
+        constraint=template.constraint,
+        options=dict(
+            install_options=template.install_options,
+            global_options=template.global_options,
+            hashes=template.hash_options
+        ),
+    )
+
+
+def make_install_req_from_dist(dist, template):
+    # type: (Distribution, InstallRequirement) -> InstallRequirement
+    project_name = canonicalize_name(dist.project_name)
+    if template.req:
+        line = str(template.req)
+    elif template.link:
+        line = "{} @ {}".format(project_name, template.link.url)
+    else:
+        line = "{}=={}".format(project_name, dist.parsed_version)
+    ireq = install_req_from_line(
+        line,
+        user_supplied=template.user_supplied,
+        comes_from=template.comes_from,
+        use_pep517=template.use_pep517,
+        isolated=template.isolated,
+        constraint=template.constraint,
+        options=dict(
+            install_options=template.install_options,
+            global_options=template.global_options,
+            hashes=template.hash_options
+        ),
+    )
+    ireq.satisfied_by = dist
+    return ireq
+
+
+class _InstallRequirementBackedCandidate(Candidate):
+    """A candidate backed by an ``InstallRequirement``.
+
+    This represents a package request with the target not being already
+    in the environment, and needs to be fetched and installed. The backing
+    ``InstallRequirement`` is responsible for most of the leg work; this
+    class exposes appropriate information to the resolver.
+
+    :param link: The link passed to the ``InstallRequirement``. The backing
+        ``InstallRequirement`` will use this link to fetch the distribution.
+    :param source_link: The link this candidate "originates" from. This is
+        different from ``link`` when the link is found in the wheel cache.
+        ``link`` would point to the wheel cache, while this points to the
+        found remote link (e.g. from pypi.org).
+    """
+    is_installed = False
+
+    def __init__(
+        self,
+        link,          # type: Link
+        source_link,   # type: Link
+        ireq,          # type: InstallRequirement
+        factory,       # type: Factory
+        name=None,     # type: Optional[str]
+        version=None,  # type: Optional[_BaseVersion]
+    ):
+        # type: (...) -> None
+        self._link = link
+        self._source_link = source_link
+        self._factory = factory
+        self._ireq = ireq
+        self._name = name
+        self._version = version
+        self._dist = None  # type: Optional[Distribution]
+        self._prepared = False
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}({link!r})".format(
+            class_name=self.__class__.__name__,
+            link=str(self._link),
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self.__class__, self._link))
+
+    def __eq__(self, other):
+        # type: (Any) -> bool
+        if isinstance(other, self.__class__):
+            return self._link == other._link
+        return False
+
+    # Needed for Python 2, which does not implement this by default
+    def __ne__(self, other):
+        # type: (Any) -> bool
+        return not self.__eq__(other)
+
+    @property
+    def source_link(self):
+        # type: () -> Optional[Link]
+        return self._source_link
+
+    @property
+    def name(self):
+        # type: () -> str
+        """The normalised name of the project the candidate refers to"""
+        if self._name is None:
+            self._name = canonicalize_name(self.dist.project_name)
+        return self._name
+
+    @property
+    def version(self):
+        # type: () -> _BaseVersion
+        if self._version is None:
+            self._version = self.dist.parsed_version
+        return self._version
+
+    def format_for_error(self):
+        # type: () -> str
+        return "{} {} (from {})".format(
+            self.name,
+            self.version,
+            self._link.file_path if self._link.is_file else self._link
+        )
+
+    def _prepare_abstract_distribution(self):
+        # type: () -> AbstractDistribution
+        raise NotImplementedError("Override in subclass")
+
+    def _check_metadata_consistency(self):
+        # type: () -> None
+        """Check for consistency of project name and version of dist."""
+        # TODO: (Longer term) Rather than abort, reject this candidate
+        #       and backtrack. This would need resolvelib support.
+        dist = self._dist  # type: Distribution
+        name = canonicalize_name(dist.project_name)
+        if self._name is not None and self._name != name:
+            raise MetadataInconsistent(self._ireq, "name", dist.project_name)
+        version = dist.parsed_version
+        if self._version is not None and self._version != version:
+            raise MetadataInconsistent(self._ireq, "version", dist.version)
+
+    def _prepare(self):
+        # type: () -> None
+        if self._prepared:
+            return
+        try:
+            abstract_dist = self._prepare_abstract_distribution()
+        except HashError as e:
+            e.req = self._ireq
+            raise
+
+        self._dist = abstract_dist.get_pkg_resources_distribution()
+        assert self._dist is not None, "Distribution already installed"
+        self._check_metadata_consistency()
+        self._prepared = True
+
+    def _fetch_metadata(self):
+        # type: () -> None
+        """Fetch metadata, using lazy wheel if possible."""
+        preparer = self._factory.preparer
+        use_lazy_wheel = self._factory.use_lazy_wheel
+        remote_wheel = self._link.is_wheel and not self._link.is_file
+        if use_lazy_wheel and remote_wheel and not preparer.require_hashes:
+            assert self._name is not None
+            logger.info('Collecting %s', self._ireq.req or self._ireq)
+            # If HTTPRangeRequestUnsupported is raised, fallback silently.
+            with indent_log(), suppress(HTTPRangeRequestUnsupported):
+                logger.info(
+                    'Obtaining dependency information from %s %s',
+                    self._name, self._version,
+                )
+                url = self._link.url.split('#', 1)[0]
+                session = preparer.downloader._session
+                self._dist = dist_from_wheel_url(self._name, url, session)
+                self._check_metadata_consistency()
+        if self._dist is None:
+            self._prepare()
+
+    @property
+    def dist(self):
+        # type: () -> Distribution
+        if self._dist is None:
+            self._fetch_metadata()
+        return self._dist
+
+    def _get_requires_python_specifier(self):
+        # type: () -> Optional[SpecifierSet]
+        requires_python = get_requires_python(self.dist)
+        if requires_python is None:
+            return None
+        try:
+            spec = SpecifierSet(requires_python)
+        except InvalidSpecifier as e:
+            logger.warning(
+                "Package %r has an invalid Requires-Python: %s", self.name, e,
+            )
+            return None
+        return spec
+
+    def iter_dependencies(self, with_requires):
+        # type: (bool) -> Iterable[Optional[Requirement]]
+        if not with_requires:
+            return
+        for r in self.dist.requires():
+            yield self._factory.make_requirement_from_spec(str(r), self._ireq)
+        python_dep = self._factory.make_requires_python_requirement(
+            self._get_requires_python_specifier(),
+        )
+        if python_dep:
+            yield python_dep
+
+    def get_install_requirement(self):
+        # type: () -> Optional[InstallRequirement]
+        self._prepare()
+        return self._ireq
+
+
+class LinkCandidate(_InstallRequirementBackedCandidate):
+    is_editable = False
+
+    def __init__(
+        self,
+        link,          # type: Link
+        template,        # type: InstallRequirement
+        factory,       # type: Factory
+        name=None,     # type: Optional[str]
+        version=None,  # type: Optional[_BaseVersion]
+    ):
+        # type: (...) -> None
+        source_link = link
+        cache_entry = factory.get_wheel_cache_entry(link, name)
+        if cache_entry is not None:
+            logger.debug("Using cached wheel link: %s", cache_entry.link)
+            link = cache_entry.link
+        ireq = make_install_req_from_link(link, template)
+
+        if (cache_entry is not None and
+                cache_entry.persistent and
+                template.link is template.original_link):
+            ireq.original_link_is_in_wheel_cache = True
+
+        super(LinkCandidate, self).__init__(
+            link=link,
+            source_link=source_link,
+            ireq=ireq,
+            factory=factory,
+            name=name,
+            version=version,
+        )
+
+    def _prepare_abstract_distribution(self):
+        # type: () -> AbstractDistribution
+        return self._factory.preparer.prepare_linked_requirement(
+            self._ireq, parallel_builds=True,
+        )
+
+
+class EditableCandidate(_InstallRequirementBackedCandidate):
+    is_editable = True
+
+    def __init__(
+        self,
+        link,          # type: Link
+        template,        # type: InstallRequirement
+        factory,       # type: Factory
+        name=None,     # type: Optional[str]
+        version=None,  # type: Optional[_BaseVersion]
+    ):
+        # type: (...) -> None
+        super(EditableCandidate, self).__init__(
+            link=link,
+            source_link=link,
+            ireq=make_install_req_from_editable(link, template),
+            factory=factory,
+            name=name,
+            version=version,
+        )
+
+    def _prepare_abstract_distribution(self):
+        # type: () -> AbstractDistribution
+        return self._factory.preparer.prepare_editable_requirement(self._ireq)
+
+
+class AlreadyInstalledCandidate(Candidate):
+    is_installed = True
+    source_link = None
+
+    def __init__(
+        self,
+        dist,  # type: Distribution
+        template,  # type: InstallRequirement
+        factory,  # type: Factory
+    ):
+        # type: (...) -> None
+        self.dist = dist
+        self._ireq = make_install_req_from_dist(dist, template)
+        self._factory = factory
+
+        # This is just logging some messages, so we can do it eagerly.
+        # The returned dist would be exactly the same as self.dist because we
+        # set satisfied_by in make_install_req_from_dist.
+        # TODO: Supply reason based on force_reinstall and upgrade_strategy.
+        skip_reason = "already satisfied"
+        factory.preparer.prepare_installed_requirement(self._ireq, skip_reason)
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}({distribution!r})".format(
+            class_name=self.__class__.__name__,
+            distribution=self.dist,
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self.__class__, self.name, self.version))
+
+    def __eq__(self, other):
+        # type: (Any) -> bool
+        if isinstance(other, self.__class__):
+            return self.name == other.name and self.version == other.version
+        return False
+
+    # Needed for Python 2, which does not implement this by default
+    def __ne__(self, other):
+        # type: (Any) -> bool
+        return not self.__eq__(other)
+
+    @property
+    def name(self):
+        # type: () -> str
+        return canonicalize_name(self.dist.project_name)
+
+    @property
+    def version(self):
+        # type: () -> _BaseVersion
+        return self.dist.parsed_version
+
+    @property
+    def is_editable(self):
+        # type: () -> bool
+        return dist_is_editable(self.dist)
+
+    def format_for_error(self):
+        # type: () -> str
+        return "{} {} (Installed)".format(self.name, self.version)
+
+    def iter_dependencies(self, with_requires):
+        # type: (bool) -> Iterable[Optional[Requirement]]
+        if not with_requires:
+            return
+        for r in self.dist.requires():
+            yield self._factory.make_requirement_from_spec(str(r), self._ireq)
+
+    def get_install_requirement(self):
+        # type: () -> Optional[InstallRequirement]
+        return None
+
+
+class ExtrasCandidate(Candidate):
+    """A candidate that has 'extras', indicating additional dependencies.
+
+    Requirements can be for a project with dependencies, something like
+    foo[extra].  The extras don't affect the project/version being installed
+    directly, but indicate that we need additional dependencies. We model that
+    by having an artificial ExtrasCandidate that wraps the "base" candidate.
+
+    The ExtrasCandidate differs from the base in the following ways:
+
+    1. It has a unique name, of the form foo[extra]. This causes the resolver
+       to treat it as a separate node in the dependency graph.
+    2. When we're getting the candidate's dependencies,
+       a) We specify that we want the extra dependencies as well.
+       b) We add a dependency on the base candidate.
+          See below for why this is needed.
+    3. We return None for the underlying InstallRequirement, as the base
+       candidate will provide it, and we don't want to end up with duplicates.
+
+    The dependency on the base candidate is needed so that the resolver can't
+    decide that it should recommend foo[extra1] version 1.0 and foo[extra2]
+    version 2.0. Having those candidates depend on foo=1.0 and foo=2.0
+    respectively forces the resolver to recognise that this is a conflict.
+    """
+    def __init__(
+        self,
+        base,  # type: BaseCandidate
+        extras,  # type: FrozenSet[str]
+    ):
+        # type: (...) -> None
+        self.base = base
+        self.extras = extras
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}(base={base!r}, extras={extras!r})".format(
+            class_name=self.__class__.__name__,
+            base=self.base,
+            extras=self.extras,
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self.base, self.extras))
+
+    def __eq__(self, other):
+        # type: (Any) -> bool
+        if isinstance(other, self.__class__):
+            return self.base == other.base and self.extras == other.extras
+        return False
+
+    # Needed for Python 2, which does not implement this by default
+    def __ne__(self, other):
+        # type: (Any) -> bool
+        return not self.__eq__(other)
+
+    @property
+    def name(self):
+        # type: () -> str
+        """The normalised name of the project the candidate refers to"""
+        return format_name(self.base.name, self.extras)
+
+    @property
+    def version(self):
+        # type: () -> _BaseVersion
+        return self.base.version
+
+    def format_for_error(self):
+        # type: () -> str
+        return "{} [{}]".format(
+            self.base.format_for_error(),
+            ", ".join(sorted(self.extras))
+        )
+
+    @property
+    def is_installed(self):
+        # type: () -> bool
+        return self.base.is_installed
+
+    @property
+    def is_editable(self):
+        # type: () -> bool
+        return self.base.is_editable
+
+    @property
+    def source_link(self):
+        # type: () -> Optional[Link]
+        return self.base.source_link
+
+    def iter_dependencies(self, with_requires):
+        # type: (bool) -> Iterable[Optional[Requirement]]
+        factory = self.base._factory
+
+        # Add a dependency on the exact base
+        # (See note 2b in the class docstring)
+        yield factory.make_requirement_from_candidate(self.base)
+        if not with_requires:
+            return
+
+        # The user may have specified extras that the candidate doesn't
+        # support. We ignore any unsupported extras here.
+        valid_extras = self.extras.intersection(self.base.dist.extras)
+        invalid_extras = self.extras.difference(self.base.dist.extras)
+        for extra in sorted(invalid_extras):
+            logger.warning(
+                "%s %s does not provide the extra '%s'",
+                self.base.name,
+                self.version,
+                extra
+            )
+
+        for r in self.base.dist.requires(valid_extras):
+            requirement = factory.make_requirement_from_spec(
+                str(r), self.base._ireq, valid_extras,
+            )
+            if requirement:
+                yield requirement
+
+    def get_install_requirement(self):
+        # type: () -> Optional[InstallRequirement]
+        # We don't return anything here, because we always
+        # depend on the base candidate, and we'll get the
+        # install requirement from that.
+        return None
+
+
+class RequiresPythonCandidate(Candidate):
+    is_installed = False
+    source_link = None
+
+    def __init__(self, py_version_info):
+        # type: (Optional[Tuple[int, ...]]) -> None
+        if py_version_info is not None:
+            version_info = normalize_version_info(py_version_info)
+        else:
+            version_info = sys.version_info[:3]
+        self._version = Version(".".join(str(c) for c in version_info))
+
+    # We don't need to implement __eq__() and __ne__() since there is always
+    # only one RequiresPythonCandidate in a resolution, i.e. the host Python.
+    # The built-in object.__eq__() and object.__ne__() do exactly what we want.
+
+    @property
+    def name(self):
+        # type: () -> str
+        # Avoid conflicting with the PyPI package "Python".
+        return "<Python from Requires-Python>"
+
+    @property
+    def version(self):
+        # type: () -> _BaseVersion
+        return self._version
+
+    def format_for_error(self):
+        # type: () -> str
+        return "Python {}".format(self.version)
+
+    def iter_dependencies(self, with_requires):
+        # type: (bool) -> Iterable[Optional[Requirement]]
+        return ()
+
+    def get_install_requirement(self):
+        # type: () -> Optional[InstallRequirement]
+        return None
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/factory.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/factory.py
new file mode 100644
index 000000000..dab23aa09
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/factory.py
@@ -0,0 +1,459 @@
+import collections
+import logging
+
+from pip._vendor import six
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.exceptions import (
+    DistributionNotFound,
+    InstallationError,
+    UnsupportedPythonVersion,
+    UnsupportedWheel,
+)
+from pip._internal.models.wheel import Wheel
+from pip._internal.req.req_install import InstallRequirement
+from pip._internal.utils.compatibility_tags import get_supported
+from pip._internal.utils.hashes import Hashes
+from pip._internal.utils.misc import (
+    dist_in_site_packages,
+    dist_in_usersite,
+    get_installed_distributions,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.virtualenv import running_under_virtualenv
+
+from .candidates import (
+    AlreadyInstalledCandidate,
+    EditableCandidate,
+    ExtrasCandidate,
+    LinkCandidate,
+    RequiresPythonCandidate,
+)
+from .requirements import (
+    ExplicitRequirement,
+    RequiresPythonRequirement,
+    SpecifierRequirement,
+)
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        FrozenSet,
+        Dict,
+        Iterable,
+        List,
+        Optional,
+        Sequence,
+        Set,
+        Tuple,
+        TypeVar,
+    )
+
+    from pip._vendor.packaging.specifiers import SpecifierSet
+    from pip._vendor.packaging.version import _BaseVersion
+    from pip._vendor.pkg_resources import Distribution
+    from pip._vendor.resolvelib import ResolutionImpossible
+
+    from pip._internal.cache import CacheEntry, WheelCache
+    from pip._internal.index.package_finder import PackageFinder
+    from pip._internal.models.link import Link
+    from pip._internal.operations.prepare import RequirementPreparer
+    from pip._internal.resolution.base import InstallRequirementProvider
+
+    from .base import Candidate, Requirement
+    from .candidates import BaseCandidate
+
+    C = TypeVar("C")
+    Cache = Dict[Link, C]
+    VersionCandidates = Dict[_BaseVersion, Candidate]
+
+
+logger = logging.getLogger(__name__)
+
+
+class Factory(object):
+    def __init__(
+        self,
+        finder,  # type: PackageFinder
+        preparer,  # type: RequirementPreparer
+        make_install_req,  # type: InstallRequirementProvider
+        wheel_cache,  # type: Optional[WheelCache]
+        use_user_site,  # type: bool
+        force_reinstall,  # type: bool
+        ignore_installed,  # type: bool
+        ignore_requires_python,  # type: bool
+        py_version_info=None,  # type: Optional[Tuple[int, ...]]
+        lazy_wheel=False,  # type: bool
+    ):
+        # type: (...) -> None
+        self._finder = finder
+        self.preparer = preparer
+        self._wheel_cache = wheel_cache
+        self._python_candidate = RequiresPythonCandidate(py_version_info)
+        self._make_install_req_from_spec = make_install_req
+        self._use_user_site = use_user_site
+        self._force_reinstall = force_reinstall
+        self._ignore_requires_python = ignore_requires_python
+        self.use_lazy_wheel = lazy_wheel
+
+        self._link_candidate_cache = {}  # type: Cache[LinkCandidate]
+        self._editable_candidate_cache = {}  # type: Cache[EditableCandidate]
+
+        if not ignore_installed:
+            self._installed_dists = {
+                canonicalize_name(dist.project_name): dist
+                for dist in get_installed_distributions()
+            }
+        else:
+            self._installed_dists = {}
+
+    @property
+    def force_reinstall(self):
+        # type: () -> bool
+        return self._force_reinstall
+
+    def _make_candidate_from_dist(
+        self,
+        dist,  # type: Distribution
+        extras,  # type: FrozenSet[str]
+        template,  # type: InstallRequirement
+    ):
+        # type: (...) -> Candidate
+        base = AlreadyInstalledCandidate(dist, template, factory=self)
+        if extras:
+            return ExtrasCandidate(base, extras)
+        return base
+
+    def _make_candidate_from_link(
+        self,
+        link,  # type: Link
+        extras,  # type: FrozenSet[str]
+        template,  # type: InstallRequirement
+        name,  # type: Optional[str]
+        version,  # type: Optional[_BaseVersion]
+    ):
+        # type: (...) -> Candidate
+        # TODO: Check already installed candidate, and use it if the link and
+        # editable flag match.
+        if template.editable:
+            if link not in self._editable_candidate_cache:
+                self._editable_candidate_cache[link] = EditableCandidate(
+                    link, template, factory=self, name=name, version=version,
+                )
+            base = self._editable_candidate_cache[link]  # type: BaseCandidate
+        else:
+            if link not in self._link_candidate_cache:
+                self._link_candidate_cache[link] = LinkCandidate(
+                    link, template, factory=self, name=name, version=version,
+                )
+            base = self._link_candidate_cache[link]
+        if extras:
+            return ExtrasCandidate(base, extras)
+        return base
+
+    def _iter_found_candidates(
+        self,
+        ireqs,  # type: Sequence[InstallRequirement]
+        specifier,  # type: SpecifierSet
+    ):
+        # type: (...) -> Iterable[Candidate]
+        if not ireqs:
+            return ()
+
+        # The InstallRequirement implementation requires us to give it a
+        # "template". Here we just choose the first requirement to represent
+        # all of them.
+        # Hopefully the Project model can correct this mismatch in the future.
+        template = ireqs[0]
+        name = canonicalize_name(template.req.name)
+
+        hashes = Hashes()
+        extras = frozenset()  # type: FrozenSet[str]
+        for ireq in ireqs:
+            specifier &= ireq.req.specifier
+            hashes |= ireq.hashes(trust_internet=False)
+            extras |= frozenset(ireq.extras)
+
+        # We use this to ensure that we only yield a single candidate for
+        # each version (the finder's preferred one for that version). The
+        # requirement needs to return only one candidate per version, so we
+        # implement that logic here so that requirements using this helper
+        # don't all have to do the same thing later.
+        candidates = collections.OrderedDict()  # type: VersionCandidates
+
+        # Get the installed version, if it matches, unless the user
+        # specified `--force-reinstall`, when we want the version from
+        # the index instead.
+        installed_version = None
+        installed_candidate = None
+        if not self._force_reinstall and name in self._installed_dists:
+            installed_dist = self._installed_dists[name]
+            installed_version = installed_dist.parsed_version
+            if specifier.contains(installed_version, prereleases=True):
+                installed_candidate = self._make_candidate_from_dist(
+                    dist=installed_dist,
+                    extras=extras,
+                    template=template,
+                )
+
+        found = self._finder.find_best_candidate(
+            project_name=name,
+            specifier=specifier,
+            hashes=hashes,
+        )
+        for ican in found.iter_applicable():
+            if ican.version == installed_version and installed_candidate:
+                candidate = installed_candidate
+            else:
+                candidate = self._make_candidate_from_link(
+                    link=ican.link,
+                    extras=extras,
+                    template=template,
+                    name=name,
+                    version=ican.version,
+                )
+            candidates[ican.version] = candidate
+
+        # Yield the installed version even if it is not found on the index.
+        if installed_version and installed_candidate:
+            candidates[installed_version] = installed_candidate
+
+        return six.itervalues(candidates)
+
+    def find_candidates(self, requirements, constraint):
+        # type: (Sequence[Requirement], SpecifierSet) -> Iterable[Candidate]
+        explicit_candidates = set()  # type: Set[Candidate]
+        ireqs = []  # type: List[InstallRequirement]
+        for req in requirements:
+            cand, ireq = req.get_candidate_lookup()
+            if cand is not None:
+                explicit_candidates.add(cand)
+            if ireq is not None:
+                ireqs.append(ireq)
+
+        # If none of the requirements want an explicit candidate, we can ask
+        # the finder for candidates.
+        if not explicit_candidates:
+            return self._iter_found_candidates(ireqs, constraint)
+
+        if constraint:
+            name = explicit_candidates.pop().name
+            raise InstallationError(
+                "Could not satisfy constraints for {!r}: installation from "
+                "path or url cannot be constrained to a version".format(name)
+            )
+
+        return (
+            c for c in explicit_candidates
+            if all(req.is_satisfied_by(c) for req in requirements)
+        )
+
+    def make_requirement_from_install_req(self, ireq, requested_extras):
+        # type: (InstallRequirement, Iterable[str]) -> Optional[Requirement]
+        if not ireq.match_markers(requested_extras):
+            logger.info(
+                "Ignoring %s: markers '%s' don't match your environment",
+                ireq.name, ireq.markers,
+            )
+            return None
+        if not ireq.link:
+            return SpecifierRequirement(ireq)
+        if ireq.link.is_wheel:
+            wheel = Wheel(ireq.link.filename)
+            if not wheel.supported(self._finder.target_python.get_tags()):
+                msg = "{} is not a supported wheel on this platform.".format(
+                    wheel.filename,
+                )
+                raise UnsupportedWheel(msg)
+        cand = self._make_candidate_from_link(
+            ireq.link,
+            extras=frozenset(ireq.extras),
+            template=ireq,
+            name=canonicalize_name(ireq.name) if ireq.name else None,
+            version=None,
+        )
+        return self.make_requirement_from_candidate(cand)
+
+    def make_requirement_from_candidate(self, candidate):
+        # type: (Candidate) -> ExplicitRequirement
+        return ExplicitRequirement(candidate)
+
+    def make_requirement_from_spec(
+        self,
+        specifier,  # type: str
+        comes_from,  # type: InstallRequirement
+        requested_extras=(),  # type: Iterable[str]
+    ):
+        # type: (...) -> Optional[Requirement]
+        ireq = self._make_install_req_from_spec(specifier, comes_from)
+        return self.make_requirement_from_install_req(ireq, requested_extras)
+
+    def make_requires_python_requirement(self, specifier):
+        # type: (Optional[SpecifierSet]) -> Optional[Requirement]
+        if self._ignore_requires_python or specifier is None:
+            return None
+        return RequiresPythonRequirement(specifier, self._python_candidate)
+
+    def get_wheel_cache_entry(self, link, name):
+        # type: (Link, Optional[str]) -> Optional[CacheEntry]
+        """Look up the link in the wheel cache.
+
+        If ``preparer.require_hashes`` is True, don't use the wheel cache,
+        because cached wheels, always built locally, have different hashes
+        than the files downloaded from the index server and thus throw false
+        hash mismatches. Furthermore, cached wheels at present have
+        nondeterministic contents due to file modification times.
+        """
+        if self._wheel_cache is None or self.preparer.require_hashes:
+            return None
+        return self._wheel_cache.get_cache_entry(
+            link=link,
+            package_name=name,
+            supported_tags=get_supported(),
+        )
+
+    def get_dist_to_uninstall(self, candidate):
+        # type: (Candidate) -> Optional[Distribution]
+        # TODO: Are there more cases this needs to return True? Editable?
+        dist = self._installed_dists.get(candidate.name)
+        if dist is None:  # Not installed, no uninstallation required.
+            return None
+
+        # We're installing into global site. The current installation must
+        # be uninstalled, no matter it's in global or user site, because the
+        # user site installation has precedence over global.
+        if not self._use_user_site:
+            return dist
+
+        # We're installing into user site. Remove the user site installation.
+        if dist_in_usersite(dist):
+            return dist
+
+        # We're installing into user site, but the installed incompatible
+        # package is in global site. We can't uninstall that, and would let
+        # the new user installation to "shadow" it. But shadowing won't work
+        # in virtual environments, so we error out.
+        if running_under_virtualenv() and dist_in_site_packages(dist):
+            raise InstallationError(
+                "Will not install to the user site because it will "
+                "lack sys.path precedence to {} in {}".format(
+                    dist.project_name, dist.location,
+                )
+            )
+        return None
+
+    def _report_requires_python_error(
+        self,
+        requirement,  # type: RequiresPythonRequirement
+        template,  # type: Candidate
+    ):
+        # type: (...) -> UnsupportedPythonVersion
+        message_format = (
+            "Package {package!r} requires a different Python: "
+            "{version} not in {specifier!r}"
+        )
+        message = message_format.format(
+            package=template.name,
+            version=self._python_candidate.version,
+            specifier=str(requirement.specifier),
+        )
+        return UnsupportedPythonVersion(message)
+
+    def get_installation_error(self, e):
+        # type: (ResolutionImpossible) -> InstallationError
+
+        assert e.causes, "Installation error reported with no cause"
+
+        # If one of the things we can't solve is "we need Python X.Y",
+        # that is what we report.
+        for cause in e.causes:
+            if isinstance(cause.requirement, RequiresPythonRequirement):
+                return self._report_requires_python_error(
+                    cause.requirement,
+                    cause.parent,
+                )
+
+        # Otherwise, we have a set of causes which can't all be satisfied
+        # at once.
+
+        # The simplest case is when we have *one* cause that can't be
+        # satisfied. We just report that case.
+        if len(e.causes) == 1:
+            req, parent = e.causes[0]
+            if parent is None:
+                req_disp = str(req)
+            else:
+                req_disp = '{} (from {})'.format(req, parent.name)
+            logger.critical(
+                "Could not find a version that satisfies the requirement %s",
+                req_disp,
+            )
+            return DistributionNotFound(
+                'No matching distribution found for {}'.format(req)
+            )
+
+        # OK, we now have a list of requirements that can't all be
+        # satisfied at once.
+
+        # A couple of formatting helpers
+        def text_join(parts):
+            # type: (List[str]) -> str
+            if len(parts) == 1:
+                return parts[0]
+
+            return ", ".join(parts[:-1]) + " and " + parts[-1]
+
+        def readable_form(cand):
+            # type: (Candidate) -> str
+            return "{} {}".format(cand.name, cand.version)
+
+        def describe_trigger(parent):
+            # type: (Candidate) -> str
+            ireq = parent.get_install_requirement()
+            if not ireq or not ireq.comes_from:
+                return "{} {}".format(parent.name, parent.version)
+            if isinstance(ireq.comes_from, InstallRequirement):
+                return str(ireq.comes_from.name)
+            return str(ireq.comes_from)
+
+        triggers = []
+        for req, parent in e.causes:
+            if parent is None:
+                # This is a root requirement, so we can report it directly
+                trigger = req.format_for_error()
+            else:
+                trigger = describe_trigger(parent)
+            triggers.append(trigger)
+
+        if triggers:
+            info = text_join(triggers)
+        else:
+            info = "the requested packages"
+
+        msg = "Cannot install {} because these package versions " \
+            "have conflicting dependencies.".format(info)
+        logger.critical(msg)
+        msg = "\nThe conflict is caused by:"
+        for req, parent in e.causes:
+            msg = msg + "\n    "
+            if parent:
+                msg = msg + "{} {} depends on ".format(
+                    parent.name,
+                    parent.version
+                )
+            else:
+                msg = msg + "The user requested "
+            msg = msg + req.format_for_error()
+
+        msg = msg + "\n\n" + \
+            "To fix this you could try to:\n" + \
+            "1. loosen the range of package versions you've specified\n" + \
+            "2. remove package versions to allow pip attempt to solve " + \
+            "the dependency conflict\n"
+
+        logger.info(msg)
+
+        return DistributionNotFound(
+            "ResolutionImpossible: for help visit "
+            "https://pip.pypa.io/en/latest/user_guide/"
+            "#fixing-conflicting-dependencies"
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/provider.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/provider.py
new file mode 100644
index 000000000..b2eb9d06e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/provider.py
@@ -0,0 +1,153 @@
+from pip._vendor.packaging.specifiers import SpecifierSet
+from pip._vendor.resolvelib.providers import AbstractProvider
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any,
+        Dict,
+        Iterable,
+        Optional,
+        Sequence,
+        Set,
+        Tuple,
+        Union,
+    )
+
+    from .base import Requirement, Candidate
+    from .factory import Factory
+
+# Notes on the relationship between the provider, the factory, and the
+# candidate and requirement classes.
+#
+# The provider is a direct implementation of the resolvelib class. Its role
+# is to deliver the API that resolvelib expects.
+#
+# Rather than work with completely abstract "requirement" and "candidate"
+# concepts as resolvelib does, pip has concrete classes implementing these two
+# ideas. The API of Requirement and Candidate objects are defined in the base
+# classes, but essentially map fairly directly to the equivalent provider
+# methods. In particular, `find_matches` and `is_satisfied_by` are
+# requirement methods, and `get_dependencies` is a candidate method.
+#
+# The factory is the interface to pip's internal mechanisms. It is stateless,
+# and is created by the resolver and held as a property of the provider. It is
+# responsible for creating Requirement and Candidate objects, and provides
+# services to those objects (access to pip's finder and preparer).
+
+
+class PipProvider(AbstractProvider):
+    def __init__(
+        self,
+        factory,  # type: Factory
+        constraints,  # type: Dict[str, SpecifierSet]
+        ignore_dependencies,  # type: bool
+        upgrade_strategy,  # type: str
+        user_requested,  # type: Set[str]
+    ):
+        # type: (...) -> None
+        self._factory = factory
+        self._constraints = constraints
+        self._ignore_dependencies = ignore_dependencies
+        self._upgrade_strategy = upgrade_strategy
+        self.user_requested = user_requested
+
+    def _sort_matches(self, matches):
+        # type: (Iterable[Candidate]) -> Sequence[Candidate]
+
+        # The requirement is responsible for returning a sequence of potential
+        # candidates, one per version. The provider handles the logic of
+        # deciding the order in which these candidates should be passed to
+        # the resolver.
+
+        # The `matches` argument is a sequence of candidates, one per version,
+        # which are potential options to be installed. The requirement will
+        # have already sorted out whether to give us an already-installed
+        # candidate or a version from PyPI (i.e., it will deal with options
+        # like --force-reinstall and --ignore-installed).
+
+        # We now work out the correct order.
+        #
+        # 1. If no other considerations apply, later versions take priority.
+        # 2. An already installed distribution is preferred over any other,
+        #    unless the user has requested an upgrade.
+        #    Upgrades are allowed when:
+        #    * The --upgrade flag is set, and
+        #      - The project was specified on the command line, or
+        #      - The project is a dependency and the "eager" upgrade strategy
+        #        was requested.
+        def _eligible_for_upgrade(name):
+            # type: (str) -> bool
+            """Are upgrades allowed for this project?
+
+            This checks the upgrade strategy, and whether the project was one
+            that the user specified in the command line, in order to decide
+            whether we should upgrade if there's a newer version available.
+
+            (Note that we don't need access to the `--upgrade` flag, because
+            an upgrade strategy of "to-satisfy-only" means that `--upgrade`
+            was not specified).
+            """
+            if self._upgrade_strategy == "eager":
+                return True
+            elif self._upgrade_strategy == "only-if-needed":
+                return (name in self.user_requested)
+            return False
+
+        def sort_key(c):
+            # type: (Candidate) -> int
+            """Return a sort key for the matches.
+
+            The highest priority should be given to installed candidates that
+            are not eligible for upgrade. We use the integer value in the first
+            part of the key to sort these before other candidates.
+
+            We only pull the installed candidate to the bottom (i.e. most
+            preferred), but otherwise keep the ordering returned by the
+            requirement. The requirement is responsible for returning a list
+            otherwise sorted for the resolver, taking account for versions
+            and binary preferences as specified by the user.
+            """
+            if c.is_installed and not _eligible_for_upgrade(c.name):
+                return 1
+            return 0
+
+        return sorted(matches, key=sort_key)
+
+    def identify(self, dependency):
+        # type: (Union[Requirement, Candidate]) -> str
+        return dependency.name
+
+    def get_preference(
+        self,
+        resolution,  # type: Optional[Candidate]
+        candidates,  # type: Sequence[Candidate]
+        information  # type: Sequence[Tuple[Requirement, Candidate]]
+    ):
+        # type: (...) -> Any
+        # Use the "usual" value for now
+        return len(candidates)
+
+    def find_matches(self, requirements):
+        # type: (Sequence[Requirement]) -> Iterable[Candidate]
+        if not requirements:
+            return []
+        constraint = self._constraints.get(
+            requirements[0].name, SpecifierSet(),
+        )
+        candidates = self._factory.find_candidates(requirements, constraint)
+        return reversed(self._sort_matches(candidates))
+
+    def is_satisfied_by(self, requirement, candidate):
+        # type: (Requirement, Candidate) -> bool
+        return requirement.is_satisfied_by(candidate)
+
+    def get_dependencies(self, candidate):
+        # type: (Candidate) -> Sequence[Requirement]
+        with_requires = not self._ignore_dependencies
+        return [
+            r
+            for r in candidate.iter_dependencies(with_requires)
+            if r is not None
+        ]
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/requirements.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/requirements.py
new file mode 100644
index 000000000..bc1061f43
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/requirements.py
@@ -0,0 +1,137 @@
+from pip._vendor.packaging.utils import canonicalize_name
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+from .base import Requirement, format_name
+
+if MYPY_CHECK_RUNNING:
+    from pip._vendor.packaging.specifiers import SpecifierSet
+
+    from pip._internal.req.req_install import InstallRequirement
+
+    from .base import Candidate, CandidateLookup
+
+
+class ExplicitRequirement(Requirement):
+    def __init__(self, candidate):
+        # type: (Candidate) -> None
+        self.candidate = candidate
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}({candidate!r})".format(
+            class_name=self.__class__.__name__,
+            candidate=self.candidate,
+        )
+
+    @property
+    def name(self):
+        # type: () -> str
+        # No need to canonicalise - the candidate did this
+        return self.candidate.name
+
+    def format_for_error(self):
+        # type: () -> str
+        return self.candidate.format_for_error()
+
+    def get_candidate_lookup(self):
+        # type: () -> CandidateLookup
+        return self.candidate, None
+
+    def is_satisfied_by(self, candidate):
+        # type: (Candidate) -> bool
+        return candidate == self.candidate
+
+
+class SpecifierRequirement(Requirement):
+    def __init__(self, ireq):
+        # type: (InstallRequirement) -> None
+        assert ireq.link is None, "This is a link, not a specifier"
+        self._ireq = ireq
+        self._extras = frozenset(ireq.extras)
+
+    def __str__(self):
+        # type: () -> str
+        return str(self._ireq.req)
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}({requirement!r})".format(
+            class_name=self.__class__.__name__,
+            requirement=str(self._ireq.req),
+        )
+
+    @property
+    def name(self):
+        # type: () -> str
+        canonical_name = canonicalize_name(self._ireq.req.name)
+        return format_name(canonical_name, self._extras)
+
+    def format_for_error(self):
+        # type: () -> str
+
+        # Convert comma-separated specifiers into "A, B, ..., F and G"
+        # This makes the specifier a bit more "human readable", without
+        # risking a change in meaning. (Hopefully! Not all edge cases have
+        # been checked)
+        parts = [s.strip() for s in str(self).split(",")]
+        if len(parts) == 0:
+            return ""
+        elif len(parts) == 1:
+            return parts[0]
+
+        return ", ".join(parts[:-1]) + " and " + parts[-1]
+
+    def get_candidate_lookup(self):
+        # type: () -> CandidateLookup
+        return None, self._ireq
+
+    def is_satisfied_by(self, candidate):
+        # type: (Candidate) -> bool
+        assert candidate.name == self.name, \
+            "Internal issue: Candidate is not for this requirement " \
+            " {} vs {}".format(candidate.name, self.name)
+        # We can safely always allow prereleases here since PackageFinder
+        # already implements the prerelease logic, and would have filtered out
+        # prerelease candidates if the user does not expect them.
+        spec = self._ireq.req.specifier
+        return spec.contains(candidate.version, prereleases=True)
+
+
+class RequiresPythonRequirement(Requirement):
+    """A requirement representing Requires-Python metadata.
+    """
+    def __init__(self, specifier, match):
+        # type: (SpecifierSet, Candidate) -> None
+        self.specifier = specifier
+        self._candidate = match
+
+    def __repr__(self):
+        # type: () -> str
+        return "{class_name}({specifier!r})".format(
+            class_name=self.__class__.__name__,
+            specifier=str(self.specifier),
+        )
+
+    @property
+    def name(self):
+        # type: () -> str
+        return self._candidate.name
+
+    def format_for_error(self):
+        # type: () -> str
+        return "Python " + str(self.specifier)
+
+    def get_candidate_lookup(self):
+        # type: () -> CandidateLookup
+        if self.specifier.contains(self._candidate.version, prereleases=True):
+            return self._candidate, None
+        return None, None
+
+    def is_satisfied_by(self, candidate):
+        # type: (Candidate) -> bool
+        assert candidate.name == self._candidate.name, "Not Python candidate"
+        # We can safely always allow prereleases here since PackageFinder
+        # already implements the prerelease logic, and would have filtered out
+        # prerelease candidates if the user does not expect them.
+        return self.specifier.contains(candidate.version, prereleases=True)
diff --git a/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/resolver.py b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/resolver.py
new file mode 100644
index 000000000..aecddb113
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/resolution/resolvelib/resolver.py
@@ -0,0 +1,259 @@
+import functools
+import logging
+
+from pip._vendor import six
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.resolvelib import BaseReporter, ResolutionImpossible
+from pip._vendor.resolvelib import Resolver as RLResolver
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.req.req_install import check_invalid_constraint_type
+from pip._internal.req.req_set import RequirementSet
+from pip._internal.resolution.base import BaseResolver
+from pip._internal.resolution.resolvelib.provider import PipProvider
+from pip._internal.utils.misc import dist_is_editable
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+from .factory import Factory
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, List, Optional, Set, Tuple
+
+    from pip._vendor.packaging.specifiers import SpecifierSet
+    from pip._vendor.resolvelib.resolvers import Result
+    from pip._vendor.resolvelib.structs import Graph
+
+    from pip._internal.cache import WheelCache
+    from pip._internal.index.package_finder import PackageFinder
+    from pip._internal.operations.prepare import RequirementPreparer
+    from pip._internal.req.req_install import InstallRequirement
+    from pip._internal.resolution.base import InstallRequirementProvider
+
+
+logger = logging.getLogger(__name__)
+
+
+class Resolver(BaseResolver):
+    _allowed_strategies = {"eager", "only-if-needed", "to-satisfy-only"}
+
+    def __init__(
+        self,
+        preparer,  # type: RequirementPreparer
+        finder,  # type: PackageFinder
+        wheel_cache,  # type: Optional[WheelCache]
+        make_install_req,  # type: InstallRequirementProvider
+        use_user_site,  # type: bool
+        ignore_dependencies,  # type: bool
+        ignore_installed,  # type: bool
+        ignore_requires_python,  # type: bool
+        force_reinstall,  # type: bool
+        upgrade_strategy,  # type: str
+        py_version_info=None,  # type: Optional[Tuple[int, ...]]
+        lazy_wheel=False,  # type: bool
+    ):
+        super(Resolver, self).__init__()
+        if lazy_wheel:
+            logger.warning(
+                'pip is using lazily downloaded wheels using HTTP '
+                'range requests to obtain dependency information. '
+                'This experimental feature is enabled through '
+                '--use-feature=fast-deps and it is not ready for production.'
+            )
+
+        assert upgrade_strategy in self._allowed_strategies
+
+        self.factory = Factory(
+            finder=finder,
+            preparer=preparer,
+            make_install_req=make_install_req,
+            wheel_cache=wheel_cache,
+            use_user_site=use_user_site,
+            force_reinstall=force_reinstall,
+            ignore_installed=ignore_installed,
+            ignore_requires_python=ignore_requires_python,
+            py_version_info=py_version_info,
+            lazy_wheel=lazy_wheel,
+        )
+        self.ignore_dependencies = ignore_dependencies
+        self.upgrade_strategy = upgrade_strategy
+        self._result = None  # type: Optional[Result]
+
+    def resolve(self, root_reqs, check_supported_wheels):
+        # type: (List[InstallRequirement], bool) -> RequirementSet
+
+        constraints = {}  # type: Dict[str, SpecifierSet]
+        user_requested = set()  # type: Set[str]
+        requirements = []
+        for req in root_reqs:
+            if req.constraint:
+                # Ensure we only accept valid constraints
+                problem = check_invalid_constraint_type(req)
+                if problem:
+                    raise InstallationError(problem)
+                if not req.match_markers():
+                    continue
+                name = canonicalize_name(req.name)
+                if name in constraints:
+                    constraints[name] = constraints[name] & req.specifier
+                else:
+                    constraints[name] = req.specifier
+            else:
+                if req.user_supplied and req.name:
+                    user_requested.add(canonicalize_name(req.name))
+                r = self.factory.make_requirement_from_install_req(
+                    req, requested_extras=(),
+                )
+                if r is not None:
+                    requirements.append(r)
+
+        provider = PipProvider(
+            factory=self.factory,
+            constraints=constraints,
+            ignore_dependencies=self.ignore_dependencies,
+            upgrade_strategy=self.upgrade_strategy,
+            user_requested=user_requested,
+        )
+        reporter = BaseReporter()
+        resolver = RLResolver(provider, reporter)
+
+        try:
+            try_to_avoid_resolution_too_deep = 2000000
+            self._result = resolver.resolve(
+                requirements, max_rounds=try_to_avoid_resolution_too_deep,
+            )
+
+        except ResolutionImpossible as e:
+            error = self.factory.get_installation_error(e)
+            six.raise_from(error, e)
+
+        req_set = RequirementSet(check_supported_wheels=check_supported_wheels)
+        for candidate in self._result.mapping.values():
+            ireq = candidate.get_install_requirement()
+            if ireq is None:
+                continue
+
+            # Check if there is already an installation under the same name,
+            # and set a flag for later stages to uninstall it, if needed.
+            # * There isn't, good -- no uninstalltion needed.
+            # * The --force-reinstall flag is set. Always reinstall.
+            # * The installation is different in version or editable-ness, so
+            #   we need to uninstall it to install the new distribution.
+            # * The installed version is the same as the pending distribution.
+            #   Skip this distrubiton altogether to save work.
+            installed_dist = self.factory.get_dist_to_uninstall(candidate)
+            if installed_dist is None:
+                ireq.should_reinstall = False
+            elif self.factory.force_reinstall:
+                ireq.should_reinstall = True
+            elif installed_dist.parsed_version != candidate.version:
+                ireq.should_reinstall = True
+            elif dist_is_editable(installed_dist) != candidate.is_editable:
+                ireq.should_reinstall = True
+            else:
+                continue
+
+            link = candidate.source_link
+            if link and link.is_yanked:
+                # The reason can contain non-ASCII characters, Unicode
+                # is required for Python 2.
+                msg = (
+                    u'The candidate selected for download or install is a '
+                    u'yanked version: {name!r} candidate (version {version} '
+                    u'at {link})\nReason for being yanked: {reason}'
+                ).format(
+                    name=candidate.name,
+                    version=candidate.version,
+                    link=link,
+                    reason=link.yanked_reason or u'<none given>',
+                )
+                logger.warning(msg)
+
+            req_set.add_named_requirement(ireq)
+
+        return req_set
+
+    def get_installation_order(self, req_set):
+        # type: (RequirementSet) -> List[InstallRequirement]
+        """Get order for installation of requirements in RequirementSet.
+
+        The returned list contains a requirement before another that depends on
+        it. This helps ensure that the environment is kept consistent as they
+        get installed one-by-one.
+
+        The current implementation creates a topological ordering of the
+        dependency graph, while breaking any cycles in the graph at arbitrary
+        points. We make no guarantees about where the cycle would be broken,
+        other than they would be broken.
+        """
+        assert self._result is not None, "must call resolve() first"
+
+        graph = self._result.graph
+        weights = get_topological_weights(graph)
+
+        sorted_items = sorted(
+            req_set.requirements.items(),
+            key=functools.partial(_req_set_item_sorter, weights=weights),
+            reverse=True,
+        )
+        return [ireq for _, ireq in sorted_items]
+
+
+def get_topological_weights(graph):
+    # type: (Graph) -> Dict[Optional[str], int]
+    """Assign weights to each node based on how "deep" they are.
+
+    This implementation may change at any point in the future without prior
+    notice.
+
+    We take the length for the longest path to any node from root, ignoring any
+    paths that contain a single node twice (i.e. cycles). This is done through
+    a depth-first search through the graph, while keeping track of the path to
+    the node.
+
+    Cycles in the graph result would result in node being revisited while also
+    being it's own path. In this case, take no action. This helps ensure we
+    don't get stuck in a cycle.
+
+    When assigning weight, the longer path (i.e. larger length) is preferred.
+    """
+    path = set()  # type: Set[Optional[str]]
+    weights = {}  # type: Dict[Optional[str], int]
+
+    def visit(node):
+        # type: (Optional[str]) -> None
+        if node in path:
+            # We hit a cycle, so we'll break it here.
+            return
+
+        # Time to visit the children!
+        path.add(node)
+        for child in graph.iter_children(node):
+            visit(child)
+        path.remove(node)
+
+        last_known_parent_count = weights.get(node, 0)
+        weights[node] = max(last_known_parent_count, len(path))
+
+    # `None` is guaranteed to be the root node by resolvelib.
+    visit(None)
+
+    # Sanity checks
+    assert weights[None] == 0
+    assert len(weights) == len(graph)
+
+    return weights
+
+
+def _req_set_item_sorter(
+    item,     # type: Tuple[str, InstallRequirement]
+    weights,  # type: Dict[Optional[str], int]
+):
+    # type: (...) -> Tuple[int, str]
+    """Key function used to sort install requirements for installation.
+
+    Based on the "weight" mapping calculated in ``get_installation_order()``.
+    The canonical package name is returned as the second member as a tie-
+    breaker to ensure the result is predictable, which is useful in tests.
+    """
+    name = canonicalize_name(item[0])
+    return weights[name], name
diff --git a/venv/Lib/site-packages/pip/_internal/self_outdated_check.py b/venv/Lib/site-packages/pip/_internal/self_outdated_check.py
new file mode 100644
index 000000000..fbd9dfd48
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/self_outdated_check.py
@@ -0,0 +1,205 @@
+from __future__ import absolute_import
+
+import datetime
+import hashlib
+import json
+import logging
+import os.path
+import sys
+
+from pip._vendor.packaging import version as packaging_version
+from pip._vendor.six import ensure_binary
+
+from pip._internal.index.collector import LinkCollector
+from pip._internal.index.package_finder import PackageFinder
+from pip._internal.models.selection_prefs import SelectionPreferences
+from pip._internal.utils.filesystem import (
+    adjacent_tmp_file,
+    check_path_owner,
+    replace,
+)
+from pip._internal.utils.misc import (
+    ensure_dir,
+    get_distribution,
+    get_installed_version,
+)
+from pip._internal.utils.packaging import get_installer
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    import optparse
+    from typing import Any, Dict, Text, Union
+
+    from pip._internal.network.session import PipSession
+
+
+SELFCHECK_DATE_FMT = "%Y-%m-%dT%H:%M:%SZ"
+
+
+logger = logging.getLogger(__name__)
+
+
+def _get_statefile_name(key):
+    # type: (Union[str, Text]) -> str
+    key_bytes = ensure_binary(key)
+    name = hashlib.sha224(key_bytes).hexdigest()
+    return name
+
+
+class SelfCheckState(object):
+    def __init__(self, cache_dir):
+        # type: (str) -> None
+        self.state = {}  # type: Dict[str, Any]
+        self.statefile_path = None
+
+        # Try to load the existing state
+        if cache_dir:
+            self.statefile_path = os.path.join(
+                cache_dir, "selfcheck", _get_statefile_name(self.key)
+            )
+            try:
+                with open(self.statefile_path) as statefile:
+                    self.state = json.load(statefile)
+            except (IOError, ValueError, KeyError):
+                # Explicitly suppressing exceptions, since we don't want to
+                # error out if the cache file is invalid.
+                pass
+
+    @property
+    def key(self):
+        # type: () -> str
+        return sys.prefix
+
+    def save(self, pypi_version, current_time):
+        # type: (str, datetime.datetime) -> None
+        # If we do not have a path to cache in, don't bother saving.
+        if not self.statefile_path:
+            return
+
+        # Check to make sure that we own the directory
+        if not check_path_owner(os.path.dirname(self.statefile_path)):
+            return
+
+        # Now that we've ensured the directory is owned by this user, we'll go
+        # ahead and make sure that all our directories are created.
+        ensure_dir(os.path.dirname(self.statefile_path))
+
+        state = {
+            # Include the key so it's easy to tell which pip wrote the
+            # file.
+            "key": self.key,
+            "last_check": current_time.strftime(SELFCHECK_DATE_FMT),
+            "pypi_version": pypi_version,
+        }
+
+        text = json.dumps(state, sort_keys=True, separators=(",", ":"))
+
+        with adjacent_tmp_file(self.statefile_path) as f:
+            f.write(ensure_binary(text))
+
+        try:
+            # Since we have a prefix-specific state file, we can just
+            # overwrite whatever is there, no need to check.
+            replace(f.name, self.statefile_path)
+        except OSError:
+            # Best effort.
+            pass
+
+
+def was_installed_by_pip(pkg):
+    # type: (str) -> bool
+    """Checks whether pkg was installed by pip
+
+    This is used not to display the upgrade message when pip is in fact
+    installed by system package manager, such as dnf on Fedora.
+    """
+    dist = get_distribution(pkg)
+    if not dist:
+        return False
+    return "pip" == get_installer(dist)
+
+
+def pip_self_version_check(session, options):
+    # type: (PipSession, optparse.Values) -> None
+    """Check for an update for pip.
+
+    Limit the frequency of checks to once per week. State is stored either in
+    the active virtualenv or in the user's USER_CACHE_DIR keyed off the prefix
+    of the pip script path.
+    """
+    installed_version = get_installed_version("pip")
+    if not installed_version:
+        return
+
+    pip_version = packaging_version.parse(installed_version)
+    pypi_version = None
+
+    try:
+        state = SelfCheckState(cache_dir=options.cache_dir)
+
+        current_time = datetime.datetime.utcnow()
+        # Determine if we need to refresh the state
+        if "last_check" in state.state and "pypi_version" in state.state:
+            last_check = datetime.datetime.strptime(
+                state.state["last_check"],
+                SELFCHECK_DATE_FMT
+            )
+            if (current_time - last_check).total_seconds() < 7 * 24 * 60 * 60:
+                pypi_version = state.state["pypi_version"]
+
+        # Refresh the version if we need to or just see if we need to warn
+        if pypi_version is None:
+            # Lets use PackageFinder to see what the latest pip version is
+            link_collector = LinkCollector.create(
+                session,
+                options=options,
+                suppress_no_index=True,
+            )
+
+            # Pass allow_yanked=False so we don't suggest upgrading to a
+            # yanked version.
+            selection_prefs = SelectionPreferences(
+                allow_yanked=False,
+                allow_all_prereleases=False,  # Explicitly set to False
+            )
+
+            finder = PackageFinder.create(
+                link_collector=link_collector,
+                selection_prefs=selection_prefs,
+            )
+            best_candidate = finder.find_best_candidate("pip").best_candidate
+            if best_candidate is None:
+                return
+            pypi_version = str(best_candidate.version)
+
+            # save that we've performed a check
+            state.save(pypi_version, current_time)
+
+        remote_version = packaging_version.parse(pypi_version)
+
+        local_version_is_older = (
+            pip_version < remote_version and
+            pip_version.base_version != remote_version.base_version and
+            was_installed_by_pip('pip')
+        )
+
+        # Determine if our pypi_version is older
+        if not local_version_is_older:
+            return
+
+        # We cannot tell how the current pip is available in the current
+        # command context, so be pragmatic here and suggest the command
+        # that's always available. This does not accommodate spaces in
+        # `sys.executable`.
+        pip_cmd = "{} -m pip".format(sys.executable)
+        logger.warning(
+            "You are using pip version %s; however, version %s is "
+            "available.\nYou should consider upgrading via the "
+            "'%s install --upgrade pip' command.",
+            pip_version, pypi_version, pip_cmd
+        )
+    except Exception:
+        logger.debug(
+            "There was an error checking the latest version of pip",
+            exc_info=True,
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__init__.py b/venv/Lib/site-packages/pip/_internal/utils/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..7bb62eac9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/appdirs.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/appdirs.cpython-36.pyc
new file mode 100644
index 000000000..fc7294984
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/appdirs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..bec15e1cf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compatibility_tags.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compatibility_tags.cpython-36.pyc
new file mode 100644
index 000000000..bf0c83126
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/compatibility_tags.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/datetime.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/datetime.cpython-36.pyc
new file mode 100644
index 000000000..739696061
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/datetime.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/deprecation.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/deprecation.cpython-36.pyc
new file mode 100644
index 000000000..58fe82827
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/deprecation.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/direct_url_helpers.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/direct_url_helpers.cpython-36.pyc
new file mode 100644
index 000000000..063a56829
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/direct_url_helpers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/distutils_args.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/distutils_args.cpython-36.pyc
new file mode 100644
index 000000000..7daa87256
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/distutils_args.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/encoding.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/encoding.cpython-36.pyc
new file mode 100644
index 000000000..2aef81437
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/encoding.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/entrypoints.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/entrypoints.cpython-36.pyc
new file mode 100644
index 000000000..3da5716a3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/entrypoints.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filesystem.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filesystem.cpython-36.pyc
new file mode 100644
index 000000000..a4ad23d91
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filesystem.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filetypes.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filetypes.cpython-36.pyc
new file mode 100644
index 000000000..5de4d881d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/filetypes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/glibc.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/glibc.cpython-36.pyc
new file mode 100644
index 000000000..9b2b41741
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/glibc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/hashes.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/hashes.cpython-36.pyc
new file mode 100644
index 000000000..340aa4add
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/hashes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/inject_securetransport.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/inject_securetransport.cpython-36.pyc
new file mode 100644
index 000000000..87ec3a990
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/inject_securetransport.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/logging.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/logging.cpython-36.pyc
new file mode 100644
index 000000000..bcb586ed4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/logging.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/misc.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/misc.cpython-36.pyc
new file mode 100644
index 000000000..8d8f4036c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/misc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/models.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/models.cpython-36.pyc
new file mode 100644
index 000000000..5d038888a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/models.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/packaging.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/packaging.cpython-36.pyc
new file mode 100644
index 000000000..869443c53
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/packaging.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/parallel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/parallel.cpython-36.pyc
new file mode 100644
index 000000000..59eeb9305
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/parallel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/pkg_resources.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/pkg_resources.cpython-36.pyc
new file mode 100644
index 000000000..8420f0db9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/pkg_resources.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/setuptools_build.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/setuptools_build.cpython-36.pyc
new file mode 100644
index 000000000..d3d60480d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/setuptools_build.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/subprocess.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/subprocess.cpython-36.pyc
new file mode 100644
index 000000000..2d6a4e278
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/subprocess.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/temp_dir.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/temp_dir.cpython-36.pyc
new file mode 100644
index 000000000..9189a4321
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/temp_dir.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/typing.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/typing.cpython-36.pyc
new file mode 100644
index 000000000..51b4c5a85
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/typing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/unpacking.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/unpacking.cpython-36.pyc
new file mode 100644
index 000000000..b0d460984
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/unpacking.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/urls.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/urls.cpython-36.pyc
new file mode 100644
index 000000000..fa14e0c23
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/urls.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/virtualenv.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/virtualenv.cpython-36.pyc
new file mode 100644
index 000000000..b67eab9c8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/virtualenv.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..712a3916d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/utils/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/utils/appdirs.py b/venv/Lib/site-packages/pip/_internal/utils/appdirs.py
new file mode 100644
index 000000000..3989ed31c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/appdirs.py
@@ -0,0 +1,44 @@
+"""
+This code wraps the vendored appdirs module to so the return values are
+compatible for the current pip code base.
+
+The intention is to rewrite current usages gradually, keeping the tests pass,
+and eventually drop this after all usages are changed.
+"""
+
+from __future__ import absolute_import
+
+import os
+
+from pip._vendor import appdirs as _appdirs
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List
+
+
+def user_cache_dir(appname):
+    # type: (str) -> str
+    return _appdirs.user_cache_dir(appname, appauthor=False)
+
+
+def user_config_dir(appname, roaming=True):
+    # type: (str, bool) -> str
+    path = _appdirs.user_config_dir(appname, appauthor=False, roaming=roaming)
+    if _appdirs.system == "darwin" and not os.path.isdir(path):
+        path = os.path.expanduser('~/.config/')
+        if appname:
+            path = os.path.join(path, appname)
+    return path
+
+
+# for the discussion regarding site_config_dir locations
+# see <https://github.com/pypa/pip/issues/1733>
+def site_config_dirs(appname):
+    # type: (str) -> List[str]
+    dirval = _appdirs.site_config_dir(appname, appauthor=False, multipath=True)
+    if _appdirs.system not in ["win32", "darwin"]:
+        # always look in /etc directly as well
+        return dirval.split(os.pathsep) + ['/etc']
+    return [dirval]
diff --git a/venv/Lib/site-packages/pip/_internal/utils/compat.py b/venv/Lib/site-packages/pip/_internal/utils/compat.py
new file mode 100644
index 000000000..89c5169af
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/compat.py
@@ -0,0 +1,271 @@
+"""Stuff that differs in different Python versions and platform
+distributions."""
+
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import, division
+
+import codecs
+import locale
+import logging
+import os
+import shutil
+import sys
+
+from pip._vendor.six import PY2, text_type
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Text, Tuple, Union
+
+try:
+    import ipaddress
+except ImportError:
+    try:
+        from pip._vendor import ipaddress  # type: ignore
+    except ImportError:
+        import ipaddr as ipaddress  # type: ignore
+        ipaddress.ip_address = ipaddress.IPAddress  # type: ignore
+        ipaddress.ip_network = ipaddress.IPNetwork  # type: ignore
+
+
+__all__ = [
+    "ipaddress", "uses_pycache", "console_to_str",
+    "get_path_uid", "stdlib_pkgs", "WINDOWS", "samefile", "get_terminal_size",
+]
+
+
+logger = logging.getLogger(__name__)
+
+if PY2:
+    import imp
+
+    try:
+        cache_from_source = imp.cache_from_source  # type: ignore
+    except AttributeError:
+        # does not use __pycache__
+        cache_from_source = None
+
+    uses_pycache = cache_from_source is not None
+else:
+    uses_pycache = True
+    from importlib.util import cache_from_source
+
+
+if PY2:
+    # In Python 2.7, backslashreplace exists
+    # but does not support use for decoding.
+    # We implement our own replace handler for this
+    # situation, so that we can consistently use
+    # backslash replacement for all versions.
+    def backslashreplace_decode_fn(err):
+        raw_bytes = (err.object[i] for i in range(err.start, err.end))
+        # Python 2 gave us characters - convert to numeric bytes
+        raw_bytes = (ord(b) for b in raw_bytes)
+        return u"".join(map(u"\\x{:x}".format, raw_bytes)), err.end
+    codecs.register_error(
+        "backslashreplace_decode",
+        backslashreplace_decode_fn,
+    )
+    backslashreplace_decode = "backslashreplace_decode"
+else:
+    backslashreplace_decode = "backslashreplace"
+
+
+def has_tls():
+    # type: () -> bool
+    try:
+        import _ssl  # noqa: F401  # ignore unused
+        return True
+    except ImportError:
+        pass
+
+    from pip._vendor.urllib3.util import IS_PYOPENSSL
+    return IS_PYOPENSSL
+
+
+def str_to_display(data, desc=None):
+    # type: (Union[bytes, Text], Optional[str]) -> Text
+    """
+    For display or logging purposes, convert a bytes object (or text) to
+    text (e.g. unicode in Python 2) safe for output.
+
+    :param desc: An optional phrase describing the input data, for use in
+        the log message if a warning is logged. Defaults to "Bytes object".
+
+    This function should never error out and so can take a best effort
+    approach. It is okay to be lossy if needed since the return value is
+    just for display.
+
+    We assume the data is in the locale preferred encoding. If it won't
+    decode properly, we warn the user but decode as best we can.
+
+    We also ensure that the output can be safely written to standard output
+    without encoding errors.
+    """
+    if isinstance(data, text_type):
+        return data
+
+    # Otherwise, data is a bytes object (str in Python 2).
+    # First, get the encoding we assume. This is the preferred
+    # encoding for the locale, unless that is not found, or
+    # it is ASCII, in which case assume UTF-8
+    encoding = locale.getpreferredencoding()
+    if (not encoding) or codecs.lookup(encoding).name == "ascii":
+        encoding = "utf-8"
+
+    # Now try to decode the data - if we fail, warn the user and
+    # decode with replacement.
+    try:
+        decoded_data = data.decode(encoding)
+    except UnicodeDecodeError:
+        logger.warning(
+            '%s does not appear to be encoded as %s',
+            desc or 'Bytes object',
+            encoding,
+        )
+        decoded_data = data.decode(encoding, errors=backslashreplace_decode)
+
+    # Make sure we can print the output, by encoding it to the output
+    # encoding with replacement of unencodable characters, and then
+    # decoding again.
+    # We use stderr's encoding because it's less likely to be
+    # redirected and if we don't find an encoding we skip this
+    # step (on the assumption that output is wrapped by something
+    # that won't fail).
+    # The double getattr is to deal with the possibility that we're
+    # being called in a situation where sys.__stderr__ doesn't exist,
+    # or doesn't have an encoding attribute. Neither of these cases
+    # should occur in normal pip use, but there's no harm in checking
+    # in case people use pip in (unsupported) unusual situations.
+    output_encoding = getattr(getattr(sys, "__stderr__", None),
+                              "encoding", None)
+
+    if output_encoding:
+        output_encoded = decoded_data.encode(
+            output_encoding,
+            errors="backslashreplace"
+        )
+        decoded_data = output_encoded.decode(output_encoding)
+
+    return decoded_data
+
+
+def console_to_str(data):
+    # type: (bytes) -> Text
+    """Return a string, safe for output, of subprocess output.
+    """
+    return str_to_display(data, desc='Subprocess output')
+
+
+def get_path_uid(path):
+    # type: (str) -> int
+    """
+    Return path's uid.
+
+    Does not follow symlinks:
+        https://github.com/pypa/pip/pull/935#discussion_r5307003
+
+    Placed this function in compat due to differences on AIX and
+    Jython, that should eventually go away.
+
+    :raises OSError: When path is a symlink or can't be read.
+    """
+    if hasattr(os, 'O_NOFOLLOW'):
+        fd = os.open(path, os.O_RDONLY | os.O_NOFOLLOW)
+        file_uid = os.fstat(fd).st_uid
+        os.close(fd)
+    else:  # AIX and Jython
+        # WARNING: time of check vulnerability, but best we can do w/o NOFOLLOW
+        if not os.path.islink(path):
+            # older versions of Jython don't have `os.fstat`
+            file_uid = os.stat(path).st_uid
+        else:
+            # raise OSError for parity with os.O_NOFOLLOW above
+            raise OSError(
+                "{} is a symlink; Will not return uid for symlinks".format(
+                    path)
+            )
+    return file_uid
+
+
+def expanduser(path):
+    # type: (str) -> str
+    """
+    Expand ~ and ~user constructions.
+
+    Includes a workaround for https://bugs.python.org/issue14768
+    """
+    expanded = os.path.expanduser(path)
+    if path.startswith('~/') and expanded.startswith('//'):
+        expanded = expanded[1:]
+    return expanded
+
+
+# packages in the stdlib that may have installation metadata, but should not be
+# considered 'installed'.  this theoretically could be determined based on
+# dist.location (py27:`sysconfig.get_paths()['stdlib']`,
+# py26:sysconfig.get_config_vars('LIBDEST')), but fear platform variation may
+# make this ineffective, so hard-coding
+stdlib_pkgs = {"python", "wsgiref", "argparse"}
+
+
+# windows detection, covers cpython and ironpython
+WINDOWS = (sys.platform.startswith("win") or
+           (sys.platform == 'cli' and os.name == 'nt'))
+
+
+def samefile(file1, file2):
+    # type: (str, str) -> bool
+    """Provide an alternative for os.path.samefile on Windows/Python2"""
+    if hasattr(os.path, 'samefile'):
+        return os.path.samefile(file1, file2)
+    else:
+        path1 = os.path.normcase(os.path.abspath(file1))
+        path2 = os.path.normcase(os.path.abspath(file2))
+        return path1 == path2
+
+
+if hasattr(shutil, 'get_terminal_size'):
+    def get_terminal_size():
+        # type: () -> Tuple[int, int]
+        """
+        Returns a tuple (x, y) representing the width(x) and the height(y)
+        in characters of the terminal window.
+        """
+        return tuple(shutil.get_terminal_size())  # type: ignore
+else:
+    def get_terminal_size():
+        # type: () -> Tuple[int, int]
+        """
+        Returns a tuple (x, y) representing the width(x) and the height(y)
+        in characters of the terminal window.
+        """
+        def ioctl_GWINSZ(fd):
+            try:
+                import fcntl
+                import termios
+                import struct
+                cr = struct.unpack_from(
+                    'hh',
+                    fcntl.ioctl(fd, termios.TIOCGWINSZ, '12345678')
+                )
+            except Exception:
+                return None
+            if cr == (0, 0):
+                return None
+            return cr
+        cr = ioctl_GWINSZ(0) or ioctl_GWINSZ(1) or ioctl_GWINSZ(2)
+        if not cr:
+            if sys.platform != "win32":
+                try:
+                    fd = os.open(os.ctermid(), os.O_RDONLY)
+                    cr = ioctl_GWINSZ(fd)
+                    os.close(fd)
+                except Exception:
+                    pass
+        if not cr:
+            cr = (os.environ.get('LINES', 25), os.environ.get('COLUMNS', 80))
+        return int(cr[1]), int(cr[0])
diff --git a/venv/Lib/site-packages/pip/_internal/utils/compatibility_tags.py b/venv/Lib/site-packages/pip/_internal/utils/compatibility_tags.py
new file mode 100644
index 000000000..4f21874ec
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/compatibility_tags.py
@@ -0,0 +1,166 @@
+"""Generate and work with PEP 425 Compatibility Tags.
+"""
+
+from __future__ import absolute_import
+
+import re
+
+from pip._vendor.packaging.tags import (
+    Tag,
+    compatible_tags,
+    cpython_tags,
+    generic_tags,
+    interpreter_name,
+    interpreter_version,
+    mac_platforms,
+)
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Tuple
+
+    from pip._vendor.packaging.tags import PythonVersion
+
+_osx_arch_pat = re.compile(r'(.+)_(\d+)_(\d+)_(.+)')
+
+
+def version_info_to_nodot(version_info):
+    # type: (Tuple[int, ...]) -> str
+    # Only use up to the first two numbers.
+    return ''.join(map(str, version_info[:2]))
+
+
+def _mac_platforms(arch):
+    # type: (str) -> List[str]
+    match = _osx_arch_pat.match(arch)
+    if match:
+        name, major, minor, actual_arch = match.groups()
+        mac_version = (int(major), int(minor))
+        arches = [
+            # Since we have always only checked that the platform starts
+            # with "macosx", for backwards-compatibility we extract the
+            # actual prefix provided by the user in case they provided
+            # something like "macosxcustom_". It may be good to remove
+            # this as undocumented or deprecate it in the future.
+            '{}_{}'.format(name, arch[len('macosx_'):])
+            for arch in mac_platforms(mac_version, actual_arch)
+        ]
+    else:
+        # arch pattern didn't match (?!)
+        arches = [arch]
+    return arches
+
+
+def _custom_manylinux_platforms(arch):
+    # type: (str) -> List[str]
+    arches = [arch]
+    arch_prefix, arch_sep, arch_suffix = arch.partition('_')
+    if arch_prefix == 'manylinux2014':
+        # manylinux1/manylinux2010 wheels run on most manylinux2014 systems
+        # with the exception of wheels depending on ncurses. PEP 599 states
+        # manylinux1/manylinux2010 wheels should be considered
+        # manylinux2014 wheels:
+        # https://www.python.org/dev/peps/pep-0599/#backwards-compatibility-with-manylinux2010-wheels
+        if arch_suffix in {'i686', 'x86_64'}:
+            arches.append('manylinux2010' + arch_sep + arch_suffix)
+            arches.append('manylinux1' + arch_sep + arch_suffix)
+    elif arch_prefix == 'manylinux2010':
+        # manylinux1 wheels run on most manylinux2010 systems with the
+        # exception of wheels depending on ncurses. PEP 571 states
+        # manylinux1 wheels should be considered manylinux2010 wheels:
+        # https://www.python.org/dev/peps/pep-0571/#backwards-compatibility-with-manylinux1-wheels
+        arches.append('manylinux1' + arch_sep + arch_suffix)
+    return arches
+
+
+def _get_custom_platforms(arch):
+    # type: (str) -> List[str]
+    arch_prefix, arch_sep, arch_suffix = arch.partition('_')
+    if arch.startswith('macosx'):
+        arches = _mac_platforms(arch)
+    elif arch_prefix in ['manylinux2014', 'manylinux2010']:
+        arches = _custom_manylinux_platforms(arch)
+    else:
+        arches = [arch]
+    return arches
+
+
+def _get_python_version(version):
+    # type: (str) -> PythonVersion
+    if len(version) > 1:
+        return int(version[0]), int(version[1:])
+    else:
+        return (int(version[0]),)
+
+
+def _get_custom_interpreter(implementation=None, version=None):
+    # type: (Optional[str], Optional[str]) -> str
+    if implementation is None:
+        implementation = interpreter_name()
+    if version is None:
+        version = interpreter_version()
+    return "{}{}".format(implementation, version)
+
+
+def get_supported(
+    version=None,  # type: Optional[str]
+    platform=None,  # type: Optional[str]
+    impl=None,  # type: Optional[str]
+    abi=None  # type: Optional[str]
+):
+    # type: (...) -> List[Tag]
+    """Return a list of supported tags for each version specified in
+    `versions`.
+
+    :param version: a string version, of the form "33" or "32",
+        or None. The version will be assumed to support our ABI.
+    :param platform: specify the exact platform you want valid
+        tags for, or None. If None, use the local system platform.
+    :param impl: specify the exact implementation you want valid
+        tags for, or None. If None, use the local interpreter impl.
+    :param abi: specify the exact abi you want valid
+        tags for, or None. If None, use the local interpreter abi.
+    """
+    supported = []  # type: List[Tag]
+
+    python_version = None  # type: Optional[PythonVersion]
+    if version is not None:
+        python_version = _get_python_version(version)
+
+    interpreter = _get_custom_interpreter(impl, version)
+
+    abis = None  # type: Optional[List[str]]
+    if abi is not None:
+        abis = [abi]
+
+    platforms = None  # type: Optional[List[str]]
+    if platform is not None:
+        platforms = _get_custom_platforms(platform)
+
+    is_cpython = (impl or interpreter_name()) == "cp"
+    if is_cpython:
+        supported.extend(
+            cpython_tags(
+                python_version=python_version,
+                abis=abis,
+                platforms=platforms,
+            )
+        )
+    else:
+        supported.extend(
+            generic_tags(
+                interpreter=interpreter,
+                abis=abis,
+                platforms=platforms,
+            )
+        )
+    supported.extend(
+        compatible_tags(
+            python_version=python_version,
+            interpreter=interpreter,
+            platforms=platforms,
+        )
+    )
+
+    return supported
diff --git a/venv/Lib/site-packages/pip/_internal/utils/datetime.py b/venv/Lib/site-packages/pip/_internal/utils/datetime.py
new file mode 100644
index 000000000..4d0503c2f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/datetime.py
@@ -0,0 +1,14 @@
+"""For when pip wants to check the date or time.
+"""
+
+from __future__ import absolute_import
+
+import datetime
+
+
+def today_is_later_than(year, month, day):
+    # type: (int, int, int) -> bool
+    today = datetime.date.today()
+    given = datetime.date(year, month, day)
+
+    return today > given
diff --git a/venv/Lib/site-packages/pip/_internal/utils/deprecation.py b/venv/Lib/site-packages/pip/_internal/utils/deprecation.py
new file mode 100644
index 000000000..2f20cfd49
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/deprecation.py
@@ -0,0 +1,104 @@
+"""
+A module that implements tooling to enable easy warnings about deprecations.
+"""
+
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import warnings
+
+from pip._vendor.packaging.version import parse
+
+from pip import __version__ as current_version
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Optional
+
+
+DEPRECATION_MSG_PREFIX = "DEPRECATION: "
+
+
+class PipDeprecationWarning(Warning):
+    pass
+
+
+_original_showwarning = None  # type: Any
+
+
+# Warnings <-> Logging Integration
+def _showwarning(message, category, filename, lineno, file=None, line=None):
+    if file is not None:
+        if _original_showwarning is not None:
+            _original_showwarning(
+                message, category, filename, lineno, file, line,
+            )
+    elif issubclass(category, PipDeprecationWarning):
+        # We use a specially named logger which will handle all of the
+        # deprecation messages for pip.
+        logger = logging.getLogger("pip._internal.deprecations")
+        logger.warning(message)
+    else:
+        _original_showwarning(
+            message, category, filename, lineno, file, line,
+        )
+
+
+def install_warning_logger():
+    # type: () -> None
+    # Enable our Deprecation Warnings
+    warnings.simplefilter("default", PipDeprecationWarning, append=True)
+
+    global _original_showwarning
+
+    if _original_showwarning is None:
+        _original_showwarning = warnings.showwarning
+        warnings.showwarning = _showwarning
+
+
+def deprecated(reason, replacement, gone_in, issue=None):
+    # type: (str, Optional[str], Optional[str], Optional[int]) -> None
+    """Helper to deprecate existing functionality.
+
+    reason:
+        Textual reason shown to the user about why this functionality has
+        been deprecated.
+    replacement:
+        Textual suggestion shown to the user about what alternative
+        functionality they can use.
+    gone_in:
+        The version of pip does this functionality should get removed in.
+        Raises errors if pip's current version is greater than or equal to
+        this.
+    issue:
+        Issue number on the tracker that would serve as a useful place for
+        users to find related discussion and provide feedback.
+
+    Always pass replacement, gone_in and issue as keyword arguments for clarity
+    at the call site.
+    """
+
+    # Construct a nice message.
+    #   This is eagerly formatted as we want it to get logged as if someone
+    #   typed this entire message out.
+    sentences = [
+        (reason, DEPRECATION_MSG_PREFIX + "{}"),
+        (gone_in, "pip {} will remove support for this functionality."),
+        (replacement, "A possible replacement is {}."),
+        (issue, (
+            "You can find discussion regarding this at "
+            "https://github.com/pypa/pip/issues/{}."
+        )),
+    ]
+    message = " ".join(
+        template.format(val) for val, template in sentences if val is not None
+    )
+
+    # Raise as an error if it has to be removed.
+    if gone_in is not None and parse(current_version) >= parse(gone_in):
+        raise PipDeprecationWarning(message)
+
+    warnings.warn(message, category=PipDeprecationWarning, stacklevel=2)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/direct_url_helpers.py b/venv/Lib/site-packages/pip/_internal/utils/direct_url_helpers.py
new file mode 100644
index 000000000..f1fe209e9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/direct_url_helpers.py
@@ -0,0 +1,130 @@
+import logging
+
+from pip._internal.models.direct_url import (
+    DIRECT_URL_METADATA_NAME,
+    ArchiveInfo,
+    DirectUrl,
+    DirectUrlValidationError,
+    DirInfo,
+    VcsInfo,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.vcs import vcs
+
+try:
+    from json import JSONDecodeError
+except ImportError:
+    # PY2
+    JSONDecodeError = ValueError  # type: ignore
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional
+
+    from pip._internal.models.link import Link
+
+    from pip._vendor.pkg_resources import Distribution
+
+logger = logging.getLogger(__name__)
+
+
+def direct_url_as_pep440_direct_reference(direct_url, name):
+    # type: (DirectUrl, str) -> str
+    """Convert a DirectUrl to a pip requirement string."""
+    direct_url.validate()  # if invalid, this is a pip bug
+    requirement = name + " @ "
+    fragments = []
+    if isinstance(direct_url.info, VcsInfo):
+        requirement += "{}+{}@{}".format(
+            direct_url.info.vcs, direct_url.url, direct_url.info.commit_id
+        )
+    elif isinstance(direct_url.info, ArchiveInfo):
+        requirement += direct_url.url
+        if direct_url.info.hash:
+            fragments.append(direct_url.info.hash)
+    else:
+        assert isinstance(direct_url.info, DirInfo)
+        # pip should never reach this point for editables, since
+        # pip freeze inspects the editable project location to produce
+        # the requirement string
+        assert not direct_url.info.editable
+        requirement += direct_url.url
+    if direct_url.subdirectory:
+        fragments.append("subdirectory=" + direct_url.subdirectory)
+    if fragments:
+        requirement += "#" + "&".join(fragments)
+    return requirement
+
+
+def direct_url_from_link(link, source_dir=None, link_is_in_wheel_cache=False):
+    # type: (Link, Optional[str], bool) -> DirectUrl
+    if link.is_vcs:
+        vcs_backend = vcs.get_backend_for_scheme(link.scheme)
+        assert vcs_backend
+        url, requested_revision, _ = (
+            vcs_backend.get_url_rev_and_auth(link.url_without_fragment)
+        )
+        # For VCS links, we need to find out and add commit_id.
+        if link_is_in_wheel_cache:
+            # If the requested VCS link corresponds to a cached
+            # wheel, it means the requested revision was an
+            # immutable commit hash, otherwise it would not have
+            # been cached. In that case we don't have a source_dir
+            # with the VCS checkout.
+            assert requested_revision
+            commit_id = requested_revision
+        else:
+            # If the wheel was not in cache, it means we have
+            # had to checkout from VCS to build and we have a source_dir
+            # which we can inspect to find out the commit id.
+            assert source_dir
+            commit_id = vcs_backend.get_revision(source_dir)
+        return DirectUrl(
+            url=url,
+            info=VcsInfo(
+                vcs=vcs_backend.name,
+                commit_id=commit_id,
+                requested_revision=requested_revision,
+            ),
+            subdirectory=link.subdirectory_fragment,
+        )
+    elif link.is_existing_dir():
+        return DirectUrl(
+            url=link.url_without_fragment,
+            info=DirInfo(),
+            subdirectory=link.subdirectory_fragment,
+        )
+    else:
+        hash = None
+        hash_name = link.hash_name
+        if hash_name:
+            hash = "{}={}".format(hash_name, link.hash)
+        return DirectUrl(
+            url=link.url_without_fragment,
+            info=ArchiveInfo(hash=hash),
+            subdirectory=link.subdirectory_fragment,
+        )
+
+
+def dist_get_direct_url(dist):
+    # type: (Distribution) -> Optional[DirectUrl]
+    """Obtain a DirectUrl from a pkg_resource.Distribution.
+
+    Returns None if the distribution has no `direct_url.json` metadata,
+    or if `direct_url.json` is invalid.
+    """
+    if not dist.has_metadata(DIRECT_URL_METADATA_NAME):
+        return None
+    try:
+        return DirectUrl.from_json(dist.get_metadata(DIRECT_URL_METADATA_NAME))
+    except (
+        DirectUrlValidationError,
+        JSONDecodeError,
+        UnicodeDecodeError
+    ) as e:
+        logger.warning(
+            "Error parsing %s for %s: %s",
+            DIRECT_URL_METADATA_NAME,
+            dist.project_name,
+            e,
+        )
+        return None
diff --git a/venv/Lib/site-packages/pip/_internal/utils/distutils_args.py b/venv/Lib/site-packages/pip/_internal/utils/distutils_args.py
new file mode 100644
index 000000000..e38e402d7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/distutils_args.py
@@ -0,0 +1,48 @@
+from distutils.errors import DistutilsArgError
+from distutils.fancy_getopt import FancyGetopt
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, List
+
+
+_options = [
+    ("exec-prefix=", None, ""),
+    ("home=", None, ""),
+    ("install-base=", None, ""),
+    ("install-data=", None, ""),
+    ("install-headers=", None, ""),
+    ("install-lib=", None, ""),
+    ("install-platlib=", None, ""),
+    ("install-purelib=", None, ""),
+    ("install-scripts=", None, ""),
+    ("prefix=", None, ""),
+    ("root=", None, ""),
+    ("user", None, ""),
+]
+
+
+# typeshed doesn't permit Tuple[str, None, str], see python/typeshed#3469.
+_distutils_getopt = FancyGetopt(_options)  # type: ignore
+
+
+def parse_distutils_args(args):
+    # type: (List[str]) -> Dict[str, str]
+    """Parse provided arguments, returning an object that has the
+    matched arguments.
+
+    Any unknown arguments are ignored.
+    """
+    result = {}
+    for arg in args:
+        try:
+            _, match = _distutils_getopt.getopt(args=[arg])
+        except DistutilsArgError:
+            # We don't care about any other options, which here may be
+            # considered unrecognized since our option list is not
+            # exhaustive.
+            pass
+        else:
+            result.update(match.__dict__)
+    return result
diff --git a/venv/Lib/site-packages/pip/_internal/utils/encoding.py b/venv/Lib/site-packages/pip/_internal/utils/encoding.py
new file mode 100644
index 000000000..5b83d61bb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/encoding.py
@@ -0,0 +1,41 @@
+import codecs
+import locale
+import re
+import sys
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Tuple, Text
+
+BOMS = [
+    (codecs.BOM_UTF8, 'utf-8'),
+    (codecs.BOM_UTF16, 'utf-16'),
+    (codecs.BOM_UTF16_BE, 'utf-16-be'),
+    (codecs.BOM_UTF16_LE, 'utf-16-le'),
+    (codecs.BOM_UTF32, 'utf-32'),
+    (codecs.BOM_UTF32_BE, 'utf-32-be'),
+    (codecs.BOM_UTF32_LE, 'utf-32-le'),
+]  # type: List[Tuple[bytes, Text]]
+
+ENCODING_RE = re.compile(br'coding[:=]\s*([-\w.]+)')
+
+
+def auto_decode(data):
+    # type: (bytes) -> Text
+    """Check a bytes string for a BOM to correctly detect the encoding
+
+    Fallback to locale.getpreferredencoding(False) like open() on Python3"""
+    for bom, encoding in BOMS:
+        if data.startswith(bom):
+            return data[len(bom):].decode(encoding)
+    # Lets check the first two lines as in PEP263
+    for line in data.split(b'\n')[:2]:
+        if line[0:1] == b'#' and ENCODING_RE.search(line):
+            result = ENCODING_RE.search(line)
+            assert result is not None
+            encoding = result.groups()[0].decode('ascii')
+            return data.decode(encoding)
+    return data.decode(
+        locale.getpreferredencoding(False) or sys.getdefaultencoding(),
+    )
diff --git a/venv/Lib/site-packages/pip/_internal/utils/entrypoints.py b/venv/Lib/site-packages/pip/_internal/utils/entrypoints.py
new file mode 100644
index 000000000..befd01c89
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/entrypoints.py
@@ -0,0 +1,31 @@
+import sys
+
+from pip._internal.cli.main import main
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, List
+
+
+def _wrapper(args=None):
+    # type: (Optional[List[str]]) -> int
+    """Central wrapper for all old entrypoints.
+
+    Historically pip has had several entrypoints defined. Because of issues
+    arising from PATH, sys.path, multiple Pythons, their interactions, and most
+    of them having a pip installed, users suffer every time an entrypoint gets
+    moved.
+
+    To alleviate this pain, and provide a mechanism for warning users and
+    directing them to an appropriate place for help, we now define all of
+    our old entrypoints as wrappers for the current one.
+    """
+    sys.stderr.write(
+        "WARNING: pip is being invoked by an old script wrapper. This will "
+        "fail in a future version of pip.\n"
+        "Please see https://github.com/pypa/pip/issues/5599 for advice on "
+        "fixing the underlying issue.\n"
+        "To avoid this problem you can invoke Python with '-m pip' instead of "
+        "running pip directly.\n"
+    )
+    return main(args)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/filesystem.py b/venv/Lib/site-packages/pip/_internal/utils/filesystem.py
new file mode 100644
index 000000000..303243fd2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/filesystem.py
@@ -0,0 +1,224 @@
+import errno
+import fnmatch
+import os
+import os.path
+import random
+import shutil
+import stat
+import sys
+from contextlib import contextmanager
+from tempfile import NamedTemporaryFile
+
+# NOTE: retrying is not annotated in typeshed as on 2017-07-17, which is
+#       why we ignore the type on this import.
+from pip._vendor.retrying import retry  # type: ignore
+from pip._vendor.six import PY2
+
+from pip._internal.utils.compat import get_path_uid
+from pip._internal.utils.misc import format_size
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING, cast
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, BinaryIO, Iterator, List, Union
+
+    class NamedTemporaryFileResult(BinaryIO):
+        @property
+        def file(self):
+            # type: () -> BinaryIO
+            pass
+
+
+def check_path_owner(path):
+    # type: (str) -> bool
+    # If we don't have a way to check the effective uid of this process, then
+    # we'll just assume that we own the directory.
+    if sys.platform == "win32" or not hasattr(os, "geteuid"):
+        return True
+
+    assert os.path.isabs(path)
+
+    previous = None
+    while path != previous:
+        if os.path.lexists(path):
+            # Check if path is writable by current user.
+            if os.geteuid() == 0:
+                # Special handling for root user in order to handle properly
+                # cases where users use sudo without -H flag.
+                try:
+                    path_uid = get_path_uid(path)
+                except OSError:
+                    return False
+                return path_uid == 0
+            else:
+                return os.access(path, os.W_OK)
+        else:
+            previous, path = path, os.path.dirname(path)
+    return False  # assume we don't own the path
+
+
+def copy2_fixed(src, dest):
+    # type: (str, str) -> None
+    """Wrap shutil.copy2() but map errors copying socket files to
+    SpecialFileError as expected.
+
+    See also https://bugs.python.org/issue37700.
+    """
+    try:
+        shutil.copy2(src, dest)
+    except (OSError, IOError):
+        for f in [src, dest]:
+            try:
+                is_socket_file = is_socket(f)
+            except OSError:
+                # An error has already occurred. Another error here is not
+                # a problem and we can ignore it.
+                pass
+            else:
+                if is_socket_file:
+                    raise shutil.SpecialFileError(
+                        "`{f}` is a socket".format(**locals()))
+
+        raise
+
+
+def is_socket(path):
+    # type: (str) -> bool
+    return stat.S_ISSOCK(os.lstat(path).st_mode)
+
+
+@contextmanager
+def adjacent_tmp_file(path, **kwargs):
+    # type: (str, **Any) -> Iterator[NamedTemporaryFileResult]
+    """Return a file-like object pointing to a tmp file next to path.
+
+    The file is created securely and is ensured to be written to disk
+    after the context reaches its end.
+
+    kwargs will be passed to tempfile.NamedTemporaryFile to control
+    the way the temporary file will be opened.
+    """
+    with NamedTemporaryFile(
+        delete=False,
+        dir=os.path.dirname(path),
+        prefix=os.path.basename(path),
+        suffix='.tmp',
+        **kwargs
+    ) as f:
+        result = cast('NamedTemporaryFileResult', f)
+        try:
+            yield result
+        finally:
+            result.file.flush()
+            os.fsync(result.file.fileno())
+
+
+_replace_retry = retry(stop_max_delay=1000, wait_fixed=250)
+
+if PY2:
+    @_replace_retry
+    def replace(src, dest):
+        # type: (str, str) -> None
+        try:
+            os.rename(src, dest)
+        except OSError:
+            os.remove(dest)
+            os.rename(src, dest)
+
+else:
+    replace = _replace_retry(os.replace)
+
+
+# test_writable_dir and _test_writable_dir_win are copied from Flit,
+# with the author's agreement to also place them under pip's license.
+def test_writable_dir(path):
+    # type: (str) -> bool
+    """Check if a directory is writable.
+
+    Uses os.access() on POSIX, tries creating files on Windows.
+    """
+    # If the directory doesn't exist, find the closest parent that does.
+    while not os.path.isdir(path):
+        parent = os.path.dirname(path)
+        if parent == path:
+            break  # Should never get here, but infinite loops are bad
+        path = parent
+
+    if os.name == 'posix':
+        return os.access(path, os.W_OK)
+
+    return _test_writable_dir_win(path)
+
+
+def _test_writable_dir_win(path):
+    # type: (str) -> bool
+    # os.access doesn't work on Windows: http://bugs.python.org/issue2528
+    # and we can't use tempfile: http://bugs.python.org/issue22107
+    basename = 'accesstest_deleteme_fishfingers_custard_'
+    alphabet = 'abcdefghijklmnopqrstuvwxyz0123456789'
+    for _ in range(10):
+        name = basename + ''.join(random.choice(alphabet) for _ in range(6))
+        file = os.path.join(path, name)
+        try:
+            fd = os.open(file, os.O_RDWR | os.O_CREAT | os.O_EXCL)
+        # Python 2 doesn't support FileExistsError and PermissionError.
+        except OSError as e:
+            # exception FileExistsError
+            if e.errno == errno.EEXIST:
+                continue
+            # exception PermissionError
+            if e.errno == errno.EPERM or e.errno == errno.EACCES:
+                # This could be because there's a directory with the same name.
+                # But it's highly unlikely there's a directory called that,
+                # so we'll assume it's because the parent dir is not writable.
+                # This could as well be because the parent dir is not readable,
+                # due to non-privileged user access.
+                return False
+            raise
+        else:
+            os.close(fd)
+            os.unlink(file)
+            return True
+
+    # This should never be reached
+    raise EnvironmentError(
+        'Unexpected condition testing for writable directory'
+    )
+
+
+def find_files(path, pattern):
+    # type: (str, str) -> List[str]
+    """Returns a list of absolute paths of files beneath path, recursively,
+    with filenames which match the UNIX-style shell glob pattern."""
+    result = []  # type: List[str]
+    for root, _, files in os.walk(path):
+        matches = fnmatch.filter(files, pattern)
+        result.extend(os.path.join(root, f) for f in matches)
+    return result
+
+
+def file_size(path):
+    # type: (str) -> Union[int, float]
+    # If it's a symlink, return 0.
+    if os.path.islink(path):
+        return 0
+    return os.path.getsize(path)
+
+
+def format_file_size(path):
+    # type: (str) -> str
+    return format_size(file_size(path))
+
+
+def directory_size(path):
+    # type: (str) -> Union[int, float]
+    size = 0.0
+    for root, _dirs, files in os.walk(path):
+        for filename in files:
+            file_path = os.path.join(root, filename)
+            size += file_size(file_path)
+    return size
+
+
+def format_directory_size(path):
+    # type: (str) -> str
+    return format_size(directory_size(path))
diff --git a/venv/Lib/site-packages/pip/_internal/utils/filetypes.py b/venv/Lib/site-packages/pip/_internal/utils/filetypes.py
new file mode 100644
index 000000000..daa0ca771
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/filetypes.py
@@ -0,0 +1,16 @@
+"""Filetype information.
+"""
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Tuple
+
+WHEEL_EXTENSION = '.whl'
+BZ2_EXTENSIONS = ('.tar.bz2', '.tbz')  # type: Tuple[str, ...]
+XZ_EXTENSIONS = ('.tar.xz', '.txz', '.tlz',
+                 '.tar.lz', '.tar.lzma')  # type: Tuple[str, ...]
+ZIP_EXTENSIONS = ('.zip', WHEEL_EXTENSION)  # type: Tuple[str, ...]
+TAR_EXTENSIONS = ('.tar.gz', '.tgz', '.tar')  # type: Tuple[str, ...]
+ARCHIVE_EXTENSIONS = (
+    ZIP_EXTENSIONS + BZ2_EXTENSIONS + TAR_EXTENSIONS + XZ_EXTENSIONS
+)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/glibc.py b/venv/Lib/site-packages/pip/_internal/utils/glibc.py
new file mode 100644
index 000000000..361042441
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/glibc.py
@@ -0,0 +1,98 @@
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+
+from __future__ import absolute_import
+
+import os
+import sys
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Tuple
+
+
+def glibc_version_string():
+    # type: () -> Optional[str]
+    "Returns glibc version string, or None if not using glibc."
+    return glibc_version_string_confstr() or glibc_version_string_ctypes()
+
+
+def glibc_version_string_confstr():
+    # type: () -> Optional[str]
+    "Primary implementation of glibc_version_string using os.confstr."
+    # os.confstr is quite a bit faster than ctypes.DLL. It's also less likely
+    # to be broken or missing. This strategy is used in the standard library
+    # platform module:
+    # https://github.com/python/cpython/blob/fcf1d003bf4f0100c9d0921ff3d70e1127ca1b71/Lib/platform.py#L175-L183
+    if sys.platform == "win32":
+        return None
+    try:
+        # os.confstr("CS_GNU_LIBC_VERSION") returns a string like "glibc 2.17":
+        _, version = os.confstr("CS_GNU_LIBC_VERSION").split()
+    except (AttributeError, OSError, ValueError):
+        # os.confstr() or CS_GNU_LIBC_VERSION not available (or a bad value)...
+        return None
+    return version
+
+
+def glibc_version_string_ctypes():
+    # type: () -> Optional[str]
+    "Fallback implementation of glibc_version_string using ctypes."
+
+    try:
+        import ctypes
+    except ImportError:
+        return None
+
+    # ctypes.CDLL(None) internally calls dlopen(NULL), and as the dlopen
+    # manpage says, "If filename is NULL, then the returned handle is for the
+    # main program". This way we can let the linker do the work to figure out
+    # which libc our process is actually using.
+    process_namespace = ctypes.CDLL(None)
+    try:
+        gnu_get_libc_version = process_namespace.gnu_get_libc_version
+    except AttributeError:
+        # Symbol doesn't exist -> therefore, we are not linked to
+        # glibc.
+        return None
+
+    # Call gnu_get_libc_version, which returns a string like "2.5"
+    gnu_get_libc_version.restype = ctypes.c_char_p
+    version_str = gnu_get_libc_version()
+    # py2 / py3 compatibility:
+    if not isinstance(version_str, str):
+        version_str = version_str.decode("ascii")
+
+    return version_str
+
+
+# platform.libc_ver regularly returns completely nonsensical glibc
+# versions. E.g. on my computer, platform says:
+#
+#   ~$ python2.7 -c 'import platform; print(platform.libc_ver())'
+#   ('glibc', '2.7')
+#   ~$ python3.5 -c 'import platform; print(platform.libc_ver())'
+#   ('glibc', '2.9')
+#
+# But the truth is:
+#
+#   ~$ ldd --version
+#   ldd (Debian GLIBC 2.22-11) 2.22
+#
+# This is unfortunate, because it means that the linehaul data on libc
+# versions that was generated by pip 8.1.2 and earlier is useless and
+# misleading. Solution: instead of using platform, use our code that actually
+# works.
+def libc_ver():
+    # type: () -> Tuple[str, str]
+    """Try to determine the glibc version
+
+    Returns a tuple of strings (lib, version) which default to empty strings
+    in case the lookup fails.
+    """
+    glibc_version = glibc_version_string()
+    if glibc_version is None:
+        return ("", "")
+    else:
+        return ("glibc", glibc_version)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/hashes.py b/venv/Lib/site-packages/pip/_internal/utils/hashes.py
new file mode 100644
index 000000000..d1b062fed
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/hashes.py
@@ -0,0 +1,145 @@
+from __future__ import absolute_import
+
+import hashlib
+
+from pip._vendor.six import iteritems, iterkeys, itervalues
+
+from pip._internal.exceptions import (
+    HashMismatch,
+    HashMissing,
+    InstallationError,
+)
+from pip._internal.utils.misc import read_chunks
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Dict, List, BinaryIO, NoReturn, Iterator
+    )
+    from pip._vendor.six import PY3
+    if PY3:
+        from hashlib import _Hash
+    else:
+        from hashlib import _hash as _Hash
+
+
+# The recommended hash algo of the moment. Change this whenever the state of
+# the art changes; it won't hurt backward compatibility.
+FAVORITE_HASH = 'sha256'
+
+
+# Names of hashlib algorithms allowed by the --hash option and ``pip hash``
+# Currently, those are the ones at least as collision-resistant as sha256.
+STRONG_HASHES = ['sha256', 'sha384', 'sha512']
+
+
+class Hashes(object):
+    """A wrapper that builds multiple hashes at once and checks them against
+    known-good values
+
+    """
+    def __init__(self, hashes=None):
+        # type: (Dict[str, List[str]]) -> None
+        """
+        :param hashes: A dict of algorithm names pointing to lists of allowed
+            hex digests
+        """
+        self._allowed = {} if hashes is None else hashes
+
+    def __or__(self, other):
+        # type: (Hashes) -> Hashes
+        if not isinstance(other, Hashes):
+            return NotImplemented
+        new = self._allowed.copy()
+        for alg, values in iteritems(other._allowed):
+            try:
+                new[alg] += values
+            except KeyError:
+                new[alg] = values
+        return Hashes(new)
+
+    @property
+    def digest_count(self):
+        # type: () -> int
+        return sum(len(digests) for digests in self._allowed.values())
+
+    def is_hash_allowed(
+        self,
+        hash_name,   # type: str
+        hex_digest,  # type: str
+    ):
+        # type: (...) -> bool
+        """Return whether the given hex digest is allowed."""
+        return hex_digest in self._allowed.get(hash_name, [])
+
+    def check_against_chunks(self, chunks):
+        # type: (Iterator[bytes]) -> None
+        """Check good hashes against ones built from iterable of chunks of
+        data.
+
+        Raise HashMismatch if none match.
+
+        """
+        gots = {}
+        for hash_name in iterkeys(self._allowed):
+            try:
+                gots[hash_name] = hashlib.new(hash_name)
+            except (ValueError, TypeError):
+                raise InstallationError(
+                    'Unknown hash name: {}'.format(hash_name)
+                )
+
+        for chunk in chunks:
+            for hash in itervalues(gots):
+                hash.update(chunk)
+
+        for hash_name, got in iteritems(gots):
+            if got.hexdigest() in self._allowed[hash_name]:
+                return
+        self._raise(gots)
+
+    def _raise(self, gots):
+        # type: (Dict[str, _Hash]) -> NoReturn
+        raise HashMismatch(self._allowed, gots)
+
+    def check_against_file(self, file):
+        # type: (BinaryIO) -> None
+        """Check good hashes against a file-like object
+
+        Raise HashMismatch if none match.
+
+        """
+        return self.check_against_chunks(read_chunks(file))
+
+    def check_against_path(self, path):
+        # type: (str) -> None
+        with open(path, 'rb') as file:
+            return self.check_against_file(file)
+
+    def __nonzero__(self):
+        # type: () -> bool
+        """Return whether I know any known-good hashes."""
+        return bool(self._allowed)
+
+    def __bool__(self):
+        # type: () -> bool
+        return self.__nonzero__()
+
+
+class MissingHashes(Hashes):
+    """A workalike for Hashes used when we're missing a hash for a requirement
+
+    It computes the actual hash of the requirement and raises a HashMissing
+    exception showing it to the user.
+
+    """
+    def __init__(self):
+        # type: () -> None
+        """Don't offer the ``hashes`` kwarg."""
+        # Pass our favorite hash in to generate a "gotten hash". With the
+        # empty list, it will never match, so an error will always raise.
+        super(MissingHashes, self).__init__(hashes={FAVORITE_HASH: []})
+
+    def _raise(self, gots):
+        # type: (Dict[str, _Hash]) -> NoReturn
+        raise HashMissing(gots[FAVORITE_HASH].hexdigest())
diff --git a/venv/Lib/site-packages/pip/_internal/utils/inject_securetransport.py b/venv/Lib/site-packages/pip/_internal/utils/inject_securetransport.py
new file mode 100644
index 000000000..5b93b1d67
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/inject_securetransport.py
@@ -0,0 +1,36 @@
+"""A helper module that injects SecureTransport, on import.
+
+The import should be done as early as possible, to ensure all requests and
+sessions (or whatever) are created after injecting SecureTransport.
+
+Note that we only do the injection on macOS, when the linked OpenSSL is too
+old to handle TLSv1.2.
+"""
+
+import sys
+
+
+def inject_securetransport():
+    # type: () -> None
+    # Only relevant on macOS
+    if sys.platform != "darwin":
+        return
+
+    try:
+        import ssl
+    except ImportError:
+        return
+
+    # Checks for OpenSSL 1.0.1
+    if ssl.OPENSSL_VERSION_NUMBER >= 0x1000100f:
+        return
+
+    try:
+        from pip._vendor.urllib3.contrib import securetransport
+    except (ImportError, OSError):
+        return
+
+    securetransport.inject_into_urllib3()
+
+
+inject_securetransport()
diff --git a/venv/Lib/site-packages/pip/_internal/utils/logging.py b/venv/Lib/site-packages/pip/_internal/utils/logging.py
new file mode 100644
index 000000000..9a017cf7e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/logging.py
@@ -0,0 +1,399 @@
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import contextlib
+import errno
+import logging
+import logging.handlers
+import os
+import sys
+from logging import Filter, getLogger
+
+from pip._vendor.six import PY2
+
+from pip._internal.utils.compat import WINDOWS
+from pip._internal.utils.deprecation import DEPRECATION_MSG_PREFIX
+from pip._internal.utils.misc import ensure_dir
+
+try:
+    import threading
+except ImportError:
+    import dummy_threading as threading  # type: ignore
+
+
+try:
+    # Use "import as" and set colorama in the else clause to avoid mypy
+    # errors and get the following correct revealed type for colorama:
+    # `Union[_importlib_modulespec.ModuleType, None]`
+    # Otherwise, we get an error like the following in the except block:
+    #  > Incompatible types in assignment (expression has type "None",
+    #   variable has type Module)
+    # TODO: eliminate the need to use "import as" once mypy addresses some
+    #  of its issues with conditional imports. Here is an umbrella issue:
+    #  https://github.com/python/mypy/issues/1297
+    from pip._vendor import colorama as _colorama
+# Lots of different errors can come from this, including SystemError and
+# ImportError.
+except Exception:
+    colorama = None
+else:
+    # Import Fore explicitly rather than accessing below as colorama.Fore
+    # to avoid the following error running mypy:
+    # > Module has no attribute "Fore"
+    # TODO: eliminate the need to import Fore once mypy addresses some of its
+    #  issues with conditional imports. This particular case could be an
+    #  instance of the following issue (but also see the umbrella issue above):
+    #  https://github.com/python/mypy/issues/3500
+    from pip._vendor.colorama import Fore
+
+    colorama = _colorama
+
+
+_log_state = threading.local()
+subprocess_logger = getLogger('pip.subprocessor')
+
+
+class BrokenStdoutLoggingError(Exception):
+    """
+    Raised if BrokenPipeError occurs for the stdout stream while logging.
+    """
+    pass
+
+
+# BrokenPipeError does not exist in Python 2 and, in addition, manifests
+# differently in Windows and non-Windows.
+if WINDOWS:
+    # In Windows, a broken pipe can show up as EINVAL rather than EPIPE:
+    # https://bugs.python.org/issue19612
+    # https://bugs.python.org/issue30418
+    if PY2:
+        def _is_broken_pipe_error(exc_class, exc):
+            """See the docstring for non-Windows Python 3 below."""
+            return (exc_class is IOError and
+                    exc.errno in (errno.EINVAL, errno.EPIPE))
+    else:
+        # In Windows, a broken pipe IOError became OSError in Python 3.
+        def _is_broken_pipe_error(exc_class, exc):
+            """See the docstring for non-Windows Python 3 below."""
+            return ((exc_class is BrokenPipeError) or  # noqa: F821
+                    (exc_class is OSError and
+                     exc.errno in (errno.EINVAL, errno.EPIPE)))
+elif PY2:
+    def _is_broken_pipe_error(exc_class, exc):
+        """See the docstring for non-Windows Python 3 below."""
+        return (exc_class is IOError and exc.errno == errno.EPIPE)
+else:
+    # Then we are in the non-Windows Python 3 case.
+    def _is_broken_pipe_error(exc_class, exc):
+        """
+        Return whether an exception is a broken pipe error.
+
+        Args:
+          exc_class: an exception class.
+          exc: an exception instance.
+        """
+        return (exc_class is BrokenPipeError)  # noqa: F821
+
+
+@contextlib.contextmanager
+def indent_log(num=2):
+    """
+    A context manager which will cause the log output to be indented for any
+    log messages emitted inside it.
+    """
+    # For thread-safety
+    _log_state.indentation = get_indentation()
+    _log_state.indentation += num
+    try:
+        yield
+    finally:
+        _log_state.indentation -= num
+
+
+def get_indentation():
+    return getattr(_log_state, 'indentation', 0)
+
+
+class IndentingFormatter(logging.Formatter):
+
+    def __init__(self, *args, **kwargs):
+        """
+        A logging.Formatter that obeys the indent_log() context manager.
+
+        :param add_timestamp: A bool indicating output lines should be prefixed
+            with their record's timestamp.
+        """
+        self.add_timestamp = kwargs.pop("add_timestamp", False)
+        super(IndentingFormatter, self).__init__(*args, **kwargs)
+
+    def get_message_start(self, formatted, levelno):
+        """
+        Return the start of the formatted log message (not counting the
+        prefix to add to each line).
+        """
+        if levelno < logging.WARNING:
+            return ''
+        if formatted.startswith(DEPRECATION_MSG_PREFIX):
+            # Then the message already has a prefix.  We don't want it to
+            # look like "WARNING: DEPRECATION: ...."
+            return ''
+        if levelno < logging.ERROR:
+            return 'WARNING: '
+
+        return 'ERROR: '
+
+    def format(self, record):
+        """
+        Calls the standard formatter, but will indent all of the log message
+        lines by our current indentation level.
+        """
+        formatted = super(IndentingFormatter, self).format(record)
+        message_start = self.get_message_start(formatted, record.levelno)
+        formatted = message_start + formatted
+
+        prefix = ''
+        if self.add_timestamp:
+            # TODO: Use Formatter.default_time_format after dropping PY2.
+            t = self.formatTime(record, "%Y-%m-%dT%H:%M:%S")
+            prefix = '{t},{record.msecs:03.0f} '.format(**locals())
+        prefix += " " * get_indentation()
+        formatted = "".join([
+            prefix + line
+            for line in formatted.splitlines(True)
+        ])
+        return formatted
+
+
+def _color_wrap(*colors):
+    def wrapped(inp):
+        return "".join(list(colors) + [inp, colorama.Style.RESET_ALL])
+    return wrapped
+
+
+class ColorizedStreamHandler(logging.StreamHandler):
+
+    # Don't build up a list of colors if we don't have colorama
+    if colorama:
+        COLORS = [
+            # This needs to be in order from highest logging level to lowest.
+            (logging.ERROR, _color_wrap(Fore.RED)),
+            (logging.WARNING, _color_wrap(Fore.YELLOW)),
+        ]
+    else:
+        COLORS = []
+
+    def __init__(self, stream=None, no_color=None):
+        logging.StreamHandler.__init__(self, stream)
+        self._no_color = no_color
+
+        if WINDOWS and colorama:
+            self.stream = colorama.AnsiToWin32(self.stream)
+
+    def _using_stdout(self):
+        """
+        Return whether the handler is using sys.stdout.
+        """
+        if WINDOWS and colorama:
+            # Then self.stream is an AnsiToWin32 object.
+            return self.stream.wrapped is sys.stdout
+
+        return self.stream is sys.stdout
+
+    def should_color(self):
+        # Don't colorize things if we do not have colorama or if told not to
+        if not colorama or self._no_color:
+            return False
+
+        real_stream = (
+            self.stream if not isinstance(self.stream, colorama.AnsiToWin32)
+            else self.stream.wrapped
+        )
+
+        # If the stream is a tty we should color it
+        if hasattr(real_stream, "isatty") and real_stream.isatty():
+            return True
+
+        # If we have an ANSI term we should color it
+        if os.environ.get("TERM") == "ANSI":
+            return True
+
+        # If anything else we should not color it
+        return False
+
+    def format(self, record):
+        msg = logging.StreamHandler.format(self, record)
+
+        if self.should_color():
+            for level, color in self.COLORS:
+                if record.levelno >= level:
+                    msg = color(msg)
+                    break
+
+        return msg
+
+    # The logging module says handleError() can be customized.
+    def handleError(self, record):
+        exc_class, exc = sys.exc_info()[:2]
+        # If a broken pipe occurred while calling write() or flush() on the
+        # stdout stream in logging's Handler.emit(), then raise our special
+        # exception so we can handle it in main() instead of logging the
+        # broken pipe error and continuing.
+        if (exc_class and self._using_stdout() and
+                _is_broken_pipe_error(exc_class, exc)):
+            raise BrokenStdoutLoggingError()
+
+        return super(ColorizedStreamHandler, self).handleError(record)
+
+
+class BetterRotatingFileHandler(logging.handlers.RotatingFileHandler):
+
+    def _open(self):
+        ensure_dir(os.path.dirname(self.baseFilename))
+        return logging.handlers.RotatingFileHandler._open(self)
+
+
+class MaxLevelFilter(Filter):
+
+    def __init__(self, level):
+        self.level = level
+
+    def filter(self, record):
+        return record.levelno < self.level
+
+
+class ExcludeLoggerFilter(Filter):
+
+    """
+    A logging Filter that excludes records from a logger (or its children).
+    """
+
+    def filter(self, record):
+        # The base Filter class allows only records from a logger (or its
+        # children).
+        return not super(ExcludeLoggerFilter, self).filter(record)
+
+
+def setup_logging(verbosity, no_color, user_log_file):
+    """Configures and sets up all of the logging
+
+    Returns the requested logging level, as its integer value.
+    """
+
+    # Determine the level to be logging at.
+    if verbosity >= 1:
+        level = "DEBUG"
+    elif verbosity == -1:
+        level = "WARNING"
+    elif verbosity == -2:
+        level = "ERROR"
+    elif verbosity <= -3:
+        level = "CRITICAL"
+    else:
+        level = "INFO"
+
+    level_number = getattr(logging, level)
+
+    # The "root" logger should match the "console" level *unless* we also need
+    # to log to a user log file.
+    include_user_log = user_log_file is not None
+    if include_user_log:
+        additional_log_file = user_log_file
+        root_level = "DEBUG"
+    else:
+        additional_log_file = "/dev/null"
+        root_level = level
+
+    # Disable any logging besides WARNING unless we have DEBUG level logging
+    # enabled for vendored libraries.
+    vendored_log_level = "WARNING" if level in ["INFO", "ERROR"] else "DEBUG"
+
+    # Shorthands for clarity
+    log_streams = {
+        "stdout": "ext://sys.stdout",
+        "stderr": "ext://sys.stderr",
+    }
+    handler_classes = {
+        "stream": "pip._internal.utils.logging.ColorizedStreamHandler",
+        "file": "pip._internal.utils.logging.BetterRotatingFileHandler",
+    }
+    handlers = ["console", "console_errors", "console_subprocess"] + (
+        ["user_log"] if include_user_log else []
+    )
+
+    logging.config.dictConfig({
+        "version": 1,
+        "disable_existing_loggers": False,
+        "filters": {
+            "exclude_warnings": {
+                "()": "pip._internal.utils.logging.MaxLevelFilter",
+                "level": logging.WARNING,
+            },
+            "restrict_to_subprocess": {
+                "()": "logging.Filter",
+                "name": subprocess_logger.name,
+            },
+            "exclude_subprocess": {
+                "()": "pip._internal.utils.logging.ExcludeLoggerFilter",
+                "name": subprocess_logger.name,
+            },
+        },
+        "formatters": {
+            "indent": {
+                "()": IndentingFormatter,
+                "format": "%(message)s",
+            },
+            "indent_with_timestamp": {
+                "()": IndentingFormatter,
+                "format": "%(message)s",
+                "add_timestamp": True,
+            },
+        },
+        "handlers": {
+            "console": {
+                "level": level,
+                "class": handler_classes["stream"],
+                "no_color": no_color,
+                "stream": log_streams["stdout"],
+                "filters": ["exclude_subprocess", "exclude_warnings"],
+                "formatter": "indent",
+            },
+            "console_errors": {
+                "level": "WARNING",
+                "class": handler_classes["stream"],
+                "no_color": no_color,
+                "stream": log_streams["stderr"],
+                "filters": ["exclude_subprocess"],
+                "formatter": "indent",
+            },
+            # A handler responsible for logging to the console messages
+            # from the "subprocessor" logger.
+            "console_subprocess": {
+                "level": level,
+                "class": handler_classes["stream"],
+                "no_color": no_color,
+                "stream": log_streams["stderr"],
+                "filters": ["restrict_to_subprocess"],
+                "formatter": "indent",
+            },
+            "user_log": {
+                "level": "DEBUG",
+                "class": handler_classes["file"],
+                "filename": additional_log_file,
+                "delay": True,
+                "formatter": "indent_with_timestamp",
+            },
+        },
+        "root": {
+            "level": root_level,
+            "handlers": handlers,
+        },
+        "loggers": {
+            "pip._vendor": {
+                "level": vendored_log_level
+            }
+        },
+    })
+
+    return level_number
diff --git a/venv/Lib/site-packages/pip/_internal/utils/misc.py b/venv/Lib/site-packages/pip/_internal/utils/misc.py
new file mode 100644
index 000000000..5629c60c1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/misc.py
@@ -0,0 +1,959 @@
+# The following comment should be removed at some point in the future.
+# mypy: strict-optional=False
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import contextlib
+import errno
+import getpass
+import hashlib
+import io
+import logging
+import os
+import posixpath
+import shutil
+import stat
+import sys
+from collections import deque
+from itertools import tee
+
+from pip._vendor import pkg_resources
+from pip._vendor.packaging.utils import canonicalize_name
+# NOTE: retrying is not annotated in typeshed as on 2017-07-17, which is
+#       why we ignore the type on this import.
+from pip._vendor.retrying import retry  # type: ignore
+from pip._vendor.six import PY2, text_type
+from pip._vendor.six.moves import filter, filterfalse, input, map, zip_longest
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+from pip._vendor.six.moves.urllib.parse import unquote as urllib_unquote
+
+from pip import __version__
+from pip._internal.exceptions import CommandError
+from pip._internal.locations import (
+    get_major_minor_version,
+    site_packages,
+    user_site,
+)
+from pip._internal.utils.compat import (
+    WINDOWS,
+    expanduser,
+    stdlib_pkgs,
+    str_to_display,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING, cast
+from pip._internal.utils.virtualenv import (
+    running_under_virtualenv,
+    virtualenv_no_global,
+)
+
+if PY2:
+    from io import BytesIO as StringIO
+else:
+    from io import StringIO
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, AnyStr, Callable, Container, Iterable, Iterator, List, Optional,
+        Text, Tuple, TypeVar, Union,
+    )
+    from pip._vendor.pkg_resources import Distribution
+
+    VersionInfo = Tuple[int, int, int]
+    T = TypeVar("T")
+
+
+__all__ = ['rmtree', 'display_path', 'backup_dir',
+           'ask', 'splitext',
+           'format_size', 'is_installable_dir',
+           'normalize_path',
+           'renames', 'get_prog',
+           'captured_stdout', 'ensure_dir',
+           'get_installed_version', 'remove_auth_from_url']
+
+
+logger = logging.getLogger(__name__)
+
+
+def get_pip_version():
+    # type: () -> str
+    pip_pkg_dir = os.path.join(os.path.dirname(__file__), "..", "..")
+    pip_pkg_dir = os.path.abspath(pip_pkg_dir)
+
+    return (
+        'pip {} from {} (python {})'.format(
+            __version__, pip_pkg_dir, get_major_minor_version(),
+        )
+    )
+
+
+def normalize_version_info(py_version_info):
+    # type: (Tuple[int, ...]) -> Tuple[int, int, int]
+    """
+    Convert a tuple of ints representing a Python version to one of length
+    three.
+
+    :param py_version_info: a tuple of ints representing a Python version,
+        or None to specify no version. The tuple can have any length.
+
+    :return: a tuple of length three if `py_version_info` is non-None.
+        Otherwise, return `py_version_info` unchanged (i.e. None).
+    """
+    if len(py_version_info) < 3:
+        py_version_info += (3 - len(py_version_info)) * (0,)
+    elif len(py_version_info) > 3:
+        py_version_info = py_version_info[:3]
+
+    return cast('VersionInfo', py_version_info)
+
+
+def ensure_dir(path):
+    # type: (AnyStr) -> None
+    """os.path.makedirs without EEXIST."""
+    try:
+        os.makedirs(path)
+    except OSError as e:
+        # Windows can raise spurious ENOTEMPTY errors. See #6426.
+        if e.errno != errno.EEXIST and e.errno != errno.ENOTEMPTY:
+            raise
+
+
+def get_prog():
+    # type: () -> str
+    try:
+        prog = os.path.basename(sys.argv[0])
+        if prog in ('__main__.py', '-c'):
+            return "{} -m pip".format(sys.executable)
+        else:
+            return prog
+    except (AttributeError, TypeError, IndexError):
+        pass
+    return 'pip'
+
+
+# Retry every half second for up to 3 seconds
+@retry(stop_max_delay=3000, wait_fixed=500)
+def rmtree(dir, ignore_errors=False):
+    # type: (Text, bool) -> None
+    shutil.rmtree(dir, ignore_errors=ignore_errors,
+                  onerror=rmtree_errorhandler)
+
+
+def rmtree_errorhandler(func, path, exc_info):
+    """On Windows, the files in .svn are read-only, so when rmtree() tries to
+    remove them, an exception is thrown.  We catch that here, remove the
+    read-only attribute, and hopefully continue without problems."""
+    try:
+        has_attr_readonly = not (os.stat(path).st_mode & stat.S_IWRITE)
+    except (IOError, OSError):
+        # it's equivalent to os.path.exists
+        return
+
+    if has_attr_readonly:
+        # convert to read/write
+        os.chmod(path, stat.S_IWRITE)
+        # use the original function to repeat the operation
+        func(path)
+        return
+    else:
+        raise
+
+
+def path_to_display(path):
+    # type: (Optional[Union[str, Text]]) -> Optional[Text]
+    """
+    Convert a bytes (or text) path to text (unicode in Python 2) for display
+    and logging purposes.
+
+    This function should never error out. Also, this function is mainly needed
+    for Python 2 since in Python 3 str paths are already text.
+    """
+    if path is None:
+        return None
+    if isinstance(path, text_type):
+        return path
+    # Otherwise, path is a bytes object (str in Python 2).
+    try:
+        display_path = path.decode(sys.getfilesystemencoding(), 'strict')
+    except UnicodeDecodeError:
+        # Include the full bytes to make troubleshooting easier, even though
+        # it may not be very human readable.
+        if PY2:
+            # Convert the bytes to a readable str representation using
+            # repr(), and then convert the str to unicode.
+            #   Also, we add the prefix "b" to the repr() return value both
+            # to make the Python 2 output look like the Python 3 output, and
+            # to signal to the user that this is a bytes representation.
+            display_path = str_to_display('b{!r}'.format(path))
+        else:
+            # Silence the "F821 undefined name 'ascii'" flake8 error since
+            # in Python 3 ascii() is a built-in.
+            display_path = ascii(path)  # noqa: F821
+
+    return display_path
+
+
+def display_path(path):
+    # type: (Union[str, Text]) -> str
+    """Gives the display value for a given path, making it relative to cwd
+    if possible."""
+    path = os.path.normcase(os.path.abspath(path))
+    if sys.version_info[0] == 2:
+        path = path.decode(sys.getfilesystemencoding(), 'replace')
+        path = path.encode(sys.getdefaultencoding(), 'replace')
+    if path.startswith(os.getcwd() + os.path.sep):
+        path = '.' + path[len(os.getcwd()):]
+    return path
+
+
+def backup_dir(dir, ext='.bak'):
+    # type: (str, str) -> str
+    """Figure out the name of a directory to back up the given dir to
+    (adding .bak, .bak2, etc)"""
+    n = 1
+    extension = ext
+    while os.path.exists(dir + extension):
+        n += 1
+        extension = ext + str(n)
+    return dir + extension
+
+
+def ask_path_exists(message, options):
+    # type: (str, Iterable[str]) -> str
+    for action in os.environ.get('PIP_EXISTS_ACTION', '').split():
+        if action in options:
+            return action
+    return ask(message, options)
+
+
+def _check_no_input(message):
+    # type: (str) -> None
+    """Raise an error if no input is allowed."""
+    if os.environ.get('PIP_NO_INPUT'):
+        raise Exception(
+            'No input was expected ($PIP_NO_INPUT set); question: {}'.format(
+                message)
+        )
+
+
+def ask(message, options):
+    # type: (str, Iterable[str]) -> str
+    """Ask the message interactively, with the given possible responses"""
+    while 1:
+        _check_no_input(message)
+        response = input(message)
+        response = response.strip().lower()
+        if response not in options:
+            print(
+                'Your response ({!r}) was not one of the expected responses: '
+                '{}'.format(response, ', '.join(options))
+            )
+        else:
+            return response
+
+
+def ask_input(message):
+    # type: (str) -> str
+    """Ask for input interactively."""
+    _check_no_input(message)
+    return input(message)
+
+
+def ask_password(message):
+    # type: (str) -> str
+    """Ask for a password interactively."""
+    _check_no_input(message)
+    return getpass.getpass(message)
+
+
+def format_size(bytes):
+    # type: (float) -> str
+    if bytes > 1000 * 1000:
+        return '{:.1f} MB'.format(bytes / 1000.0 / 1000)
+    elif bytes > 10 * 1000:
+        return '{} kB'.format(int(bytes / 1000))
+    elif bytes > 1000:
+        return '{:.1f} kB'.format(bytes / 1000.0)
+    else:
+        return '{} bytes'.format(int(bytes))
+
+
+def tabulate(rows):
+    # type: (Iterable[Iterable[Any]]) -> Tuple[List[str], List[int]]
+    """Return a list of formatted rows and a list of column sizes.
+
+    For example::
+
+    >>> tabulate([['foobar', 2000], [0xdeadbeef]])
+    (['foobar     2000', '3735928559'], [10, 4])
+    """
+    rows = [tuple(map(str, row)) for row in rows]
+    sizes = [max(map(len, col)) for col in zip_longest(*rows, fillvalue='')]
+    table = [" ".join(map(str.ljust, row, sizes)).rstrip() for row in rows]
+    return table, sizes
+
+
+def is_installable_dir(path):
+    # type: (str) -> bool
+    """Is path is a directory containing setup.py or pyproject.toml?
+    """
+    if not os.path.isdir(path):
+        return False
+    setup_py = os.path.join(path, 'setup.py')
+    if os.path.isfile(setup_py):
+        return True
+    pyproject_toml = os.path.join(path, 'pyproject.toml')
+    if os.path.isfile(pyproject_toml):
+        return True
+    return False
+
+
+def read_chunks(file, size=io.DEFAULT_BUFFER_SIZE):
+    """Yield pieces of data from a file-like object until EOF."""
+    while True:
+        chunk = file.read(size)
+        if not chunk:
+            break
+        yield chunk
+
+
+def normalize_path(path, resolve_symlinks=True):
+    # type: (str, bool) -> str
+    """
+    Convert a path to its canonical, case-normalized, absolute version.
+
+    """
+    path = expanduser(path)
+    if resolve_symlinks:
+        path = os.path.realpath(path)
+    else:
+        path = os.path.abspath(path)
+    return os.path.normcase(path)
+
+
+def splitext(path):
+    # type: (str) -> Tuple[str, str]
+    """Like os.path.splitext, but take off .tar too"""
+    base, ext = posixpath.splitext(path)
+    if base.lower().endswith('.tar'):
+        ext = base[-4:] + ext
+        base = base[:-4]
+    return base, ext
+
+
+def renames(old, new):
+    # type: (str, str) -> None
+    """Like os.renames(), but handles renaming across devices."""
+    # Implementation borrowed from os.renames().
+    head, tail = os.path.split(new)
+    if head and tail and not os.path.exists(head):
+        os.makedirs(head)
+
+    shutil.move(old, new)
+
+    head, tail = os.path.split(old)
+    if head and tail:
+        try:
+            os.removedirs(head)
+        except OSError:
+            pass
+
+
+def is_local(path):
+    # type: (str) -> bool
+    """
+    Return True if path is within sys.prefix, if we're running in a virtualenv.
+
+    If we're not in a virtualenv, all paths are considered "local."
+
+    Caution: this function assumes the head of path has been normalized
+    with normalize_path.
+    """
+    if not running_under_virtualenv():
+        return True
+    return path.startswith(normalize_path(sys.prefix))
+
+
+def dist_is_local(dist):
+    # type: (Distribution) -> bool
+    """
+    Return True if given Distribution object is installed locally
+    (i.e. within current virtualenv).
+
+    Always True if we're not in a virtualenv.
+
+    """
+    return is_local(dist_location(dist))
+
+
+def dist_in_usersite(dist):
+    # type: (Distribution) -> bool
+    """
+    Return True if given Distribution is installed in user site.
+    """
+    return dist_location(dist).startswith(normalize_path(user_site))
+
+
+def dist_in_site_packages(dist):
+    # type: (Distribution) -> bool
+    """
+    Return True if given Distribution is installed in
+    sysconfig.get_python_lib().
+    """
+    return dist_location(dist).startswith(normalize_path(site_packages))
+
+
+def dist_is_editable(dist):
+    # type: (Distribution) -> bool
+    """
+    Return True if given Distribution is an editable install.
+    """
+    for path_item in sys.path:
+        egg_link = os.path.join(path_item, dist.project_name + '.egg-link')
+        if os.path.isfile(egg_link):
+            return True
+    return False
+
+
+def get_installed_distributions(
+        local_only=True,  # type: bool
+        skip=stdlib_pkgs,  # type: Container[str]
+        include_editables=True,  # type: bool
+        editables_only=False,  # type: bool
+        user_only=False,  # type: bool
+        paths=None  # type: Optional[List[str]]
+):
+    # type: (...) -> List[Distribution]
+    """
+    Return a list of installed Distribution objects.
+
+    If ``local_only`` is True (default), only return installations
+    local to the current virtualenv, if in a virtualenv.
+
+    ``skip`` argument is an iterable of lower-case project names to
+    ignore; defaults to stdlib_pkgs
+
+    If ``include_editables`` is False, don't report editables.
+
+    If ``editables_only`` is True , only report editables.
+
+    If ``user_only`` is True , only report installations in the user
+    site directory.
+
+    If ``paths`` is set, only report the distributions present at the
+    specified list of locations.
+    """
+    if paths:
+        working_set = pkg_resources.WorkingSet(paths)
+    else:
+        working_set = pkg_resources.working_set
+
+    if local_only:
+        local_test = dist_is_local
+    else:
+        def local_test(d):
+            return True
+
+    if include_editables:
+        def editable_test(d):
+            return True
+    else:
+        def editable_test(d):
+            return not dist_is_editable(d)
+
+    if editables_only:
+        def editables_only_test(d):
+            return dist_is_editable(d)
+    else:
+        def editables_only_test(d):
+            return True
+
+    if user_only:
+        user_test = dist_in_usersite
+    else:
+        def user_test(d):
+            return True
+
+    return [d for d in working_set
+            if local_test(d) and
+            d.key not in skip and
+            editable_test(d) and
+            editables_only_test(d) and
+            user_test(d)
+            ]
+
+
+def _search_distribution(req_name):
+    # type: (str) -> Optional[Distribution]
+    """Find a distribution matching the ``req_name`` in the environment.
+
+    This searches from *all* distributions available in the environment, to
+    match the behavior of ``pkg_resources.get_distribution()``.
+    """
+    # Canonicalize the name before searching in the list of
+    # installed distributions and also while creating the package
+    # dictionary to get the Distribution object
+    req_name = canonicalize_name(req_name)
+    packages = get_installed_distributions(
+        local_only=False,
+        skip=(),
+        include_editables=True,
+        editables_only=False,
+        user_only=False,
+        paths=None,
+    )
+    pkg_dict = {canonicalize_name(p.key): p for p in packages}
+    return pkg_dict.get(req_name)
+
+
+def get_distribution(req_name):
+    # type: (str) -> Optional[Distribution]
+    """Given a requirement name, return the installed Distribution object.
+
+    This searches from *all* distributions available in the environment, to
+    match the behavior of ``pkg_resources.get_distribution()``.
+    """
+
+    # Search the distribution by looking through the working set
+    dist = _search_distribution(req_name)
+
+    # If distribution could not be found, call working_set.require
+    # to update the working set, and try to find the distribution
+    # again.
+    # This might happen for e.g. when you install a package
+    # twice, once using setup.py develop and again using setup.py install.
+    # Now when run pip uninstall twice, the package gets removed
+    # from the working set in the first uninstall, so we have to populate
+    # the working set again so that pip knows about it and the packages
+    # gets picked up and is successfully uninstalled the second time too.
+    if not dist:
+        try:
+            pkg_resources.working_set.require(req_name)
+        except pkg_resources.DistributionNotFound:
+            return None
+    return _search_distribution(req_name)
+
+
+def egg_link_path(dist):
+    # type: (Distribution) -> Optional[str]
+    """
+    Return the path for the .egg-link file if it exists, otherwise, None.
+
+    There's 3 scenarios:
+    1) not in a virtualenv
+       try to find in site.USER_SITE, then site_packages
+    2) in a no-global virtualenv
+       try to find in site_packages
+    3) in a yes-global virtualenv
+       try to find in site_packages, then site.USER_SITE
+       (don't look in global location)
+
+    For #1 and #3, there could be odd cases, where there's an egg-link in 2
+    locations.
+
+    This method will just return the first one found.
+    """
+    sites = []
+    if running_under_virtualenv():
+        sites.append(site_packages)
+        if not virtualenv_no_global() and user_site:
+            sites.append(user_site)
+    else:
+        if user_site:
+            sites.append(user_site)
+        sites.append(site_packages)
+
+    for site in sites:
+        egglink = os.path.join(site, dist.project_name) + '.egg-link'
+        if os.path.isfile(egglink):
+            return egglink
+    return None
+
+
+def dist_location(dist):
+    # type: (Distribution) -> str
+    """
+    Get the site-packages location of this distribution. Generally
+    this is dist.location, except in the case of develop-installed
+    packages, where dist.location is the source code location, and we
+    want to know where the egg-link file is.
+
+    The returned location is normalized (in particular, with symlinks removed).
+    """
+    egg_link = egg_link_path(dist)
+    if egg_link:
+        return normalize_path(egg_link)
+    return normalize_path(dist.location)
+
+
+def write_output(msg, *args):
+    # type: (Any, Any) -> None
+    logger.info(msg, *args)
+
+
+class FakeFile(object):
+    """Wrap a list of lines in an object with readline() to make
+    ConfigParser happy."""
+    def __init__(self, lines):
+        self._gen = iter(lines)
+
+    def readline(self):
+        try:
+            return next(self._gen)
+        except StopIteration:
+            return ''
+
+    def __iter__(self):
+        return self._gen
+
+
+class StreamWrapper(StringIO):
+
+    @classmethod
+    def from_stream(cls, orig_stream):
+        cls.orig_stream = orig_stream
+        return cls()
+
+    # compileall.compile_dir() needs stdout.encoding to print to stdout
+    @property
+    def encoding(self):
+        return self.orig_stream.encoding
+
+
+@contextlib.contextmanager
+def captured_output(stream_name):
+    """Return a context manager used by captured_stdout/stdin/stderr
+    that temporarily replaces the sys stream *stream_name* with a StringIO.
+
+    Taken from Lib/support/__init__.py in the CPython repo.
+    """
+    orig_stdout = getattr(sys, stream_name)
+    setattr(sys, stream_name, StreamWrapper.from_stream(orig_stdout))
+    try:
+        yield getattr(sys, stream_name)
+    finally:
+        setattr(sys, stream_name, orig_stdout)
+
+
+def captured_stdout():
+    """Capture the output of sys.stdout:
+
+       with captured_stdout() as stdout:
+           print('hello')
+       self.assertEqual(stdout.getvalue(), 'hello\n')
+
+    Taken from Lib/support/__init__.py in the CPython repo.
+    """
+    return captured_output('stdout')
+
+
+def captured_stderr():
+    """
+    See captured_stdout().
+    """
+    return captured_output('stderr')
+
+
+def get_installed_version(dist_name, working_set=None):
+    """Get the installed version of dist_name avoiding pkg_resources cache"""
+    # Create a requirement that we'll look for inside of setuptools.
+    req = pkg_resources.Requirement.parse(dist_name)
+
+    if working_set is None:
+        # We want to avoid having this cached, so we need to construct a new
+        # working set each time.
+        working_set = pkg_resources.WorkingSet()
+
+    # Get the installed distribution from our working set
+    dist = working_set.find(req)
+
+    # Check to see if we got an installed distribution or not, if we did
+    # we want to return it's version.
+    return dist.version if dist else None
+
+
+def consume(iterator):
+    """Consume an iterable at C speed."""
+    deque(iterator, maxlen=0)
+
+
+# Simulates an enum
+def enum(*sequential, **named):
+    enums = dict(zip(sequential, range(len(sequential))), **named)
+    reverse = {value: key for key, value in enums.items()}
+    enums['reverse_mapping'] = reverse
+    return type('Enum', (), enums)
+
+
+def build_netloc(host, port):
+    # type: (str, Optional[int]) -> str
+    """
+    Build a netloc from a host-port pair
+    """
+    if port is None:
+        return host
+    if ':' in host:
+        # Only wrap host with square brackets when it is IPv6
+        host = '[{}]'.format(host)
+    return '{}:{}'.format(host, port)
+
+
+def build_url_from_netloc(netloc, scheme='https'):
+    # type: (str, str) -> str
+    """
+    Build a full URL from a netloc.
+    """
+    if netloc.count(':') >= 2 and '@' not in netloc and '[' not in netloc:
+        # It must be a bare IPv6 address, so wrap it with brackets.
+        netloc = '[{}]'.format(netloc)
+    return '{}://{}'.format(scheme, netloc)
+
+
+def parse_netloc(netloc):
+    # type: (str) -> Tuple[str, Optional[int]]
+    """
+    Return the host-port pair from a netloc.
+    """
+    url = build_url_from_netloc(netloc)
+    parsed = urllib_parse.urlparse(url)
+    return parsed.hostname, parsed.port
+
+
+def split_auth_from_netloc(netloc):
+    """
+    Parse out and remove the auth information from a netloc.
+
+    Returns: (netloc, (username, password)).
+    """
+    if '@' not in netloc:
+        return netloc, (None, None)
+
+    # Split from the right because that's how urllib.parse.urlsplit()
+    # behaves if more than one @ is present (which can be checked using
+    # the password attribute of urlsplit()'s return value).
+    auth, netloc = netloc.rsplit('@', 1)
+    if ':' in auth:
+        # Split from the left because that's how urllib.parse.urlsplit()
+        # behaves if more than one : is present (which again can be checked
+        # using the password attribute of the return value)
+        user_pass = auth.split(':', 1)
+    else:
+        user_pass = auth, None
+
+    user_pass = tuple(
+        None if x is None else urllib_unquote(x) for x in user_pass
+    )
+
+    return netloc, user_pass
+
+
+def redact_netloc(netloc):
+    # type: (str) -> str
+    """
+    Replace the sensitive data in a netloc with "****", if it exists.
+
+    For example:
+        - "user:pass@example.com" returns "user:****@example.com"
+        - "accesstoken@example.com" returns "****@example.com"
+    """
+    netloc, (user, password) = split_auth_from_netloc(netloc)
+    if user is None:
+        return netloc
+    if password is None:
+        user = '****'
+        password = ''
+    else:
+        user = urllib_parse.quote(user)
+        password = ':****'
+    return '{user}{password}@{netloc}'.format(user=user,
+                                              password=password,
+                                              netloc=netloc)
+
+
+def _transform_url(url, transform_netloc):
+    """Transform and replace netloc in a url.
+
+    transform_netloc is a function taking the netloc and returning a
+    tuple. The first element of this tuple is the new netloc. The
+    entire tuple is returned.
+
+    Returns a tuple containing the transformed url as item 0 and the
+    original tuple returned by transform_netloc as item 1.
+    """
+    purl = urllib_parse.urlsplit(url)
+    netloc_tuple = transform_netloc(purl.netloc)
+    # stripped url
+    url_pieces = (
+        purl.scheme, netloc_tuple[0], purl.path, purl.query, purl.fragment
+    )
+    surl = urllib_parse.urlunsplit(url_pieces)
+    return surl, netloc_tuple
+
+
+def _get_netloc(netloc):
+    return split_auth_from_netloc(netloc)
+
+
+def _redact_netloc(netloc):
+    return (redact_netloc(netloc),)
+
+
+def split_auth_netloc_from_url(url):
+    # type: (str) -> Tuple[str, str, Tuple[str, str]]
+    """
+    Parse a url into separate netloc, auth, and url with no auth.
+
+    Returns: (url_without_auth, netloc, (username, password))
+    """
+    url_without_auth, (netloc, auth) = _transform_url(url, _get_netloc)
+    return url_without_auth, netloc, auth
+
+
+def remove_auth_from_url(url):
+    # type: (str) -> str
+    """Return a copy of url with 'username:password@' removed."""
+    # username/pass params are passed to subversion through flags
+    # and are not recognized in the url.
+    return _transform_url(url, _get_netloc)[0]
+
+
+def redact_auth_from_url(url):
+    # type: (str) -> str
+    """Replace the password in a given url with ****."""
+    return _transform_url(url, _redact_netloc)[0]
+
+
+class HiddenText(object):
+    def __init__(
+        self,
+        secret,    # type: str
+        redacted,  # type: str
+    ):
+        # type: (...) -> None
+        self.secret = secret
+        self.redacted = redacted
+
+    def __repr__(self):
+        # type: (...) -> str
+        return '<HiddenText {!r}>'.format(str(self))
+
+    def __str__(self):
+        # type: (...) -> str
+        return self.redacted
+
+    # This is useful for testing.
+    def __eq__(self, other):
+        # type: (Any) -> bool
+        if type(self) != type(other):
+            return False
+
+        # The string being used for redaction doesn't also have to match,
+        # just the raw, original string.
+        return (self.secret == other.secret)
+
+    # We need to provide an explicit __ne__ implementation for Python 2.
+    # TODO: remove this when we drop PY2 support.
+    def __ne__(self, other):
+        # type: (Any) -> bool
+        return not self == other
+
+
+def hide_value(value):
+    # type: (str) -> HiddenText
+    return HiddenText(value, redacted='****')
+
+
+def hide_url(url):
+    # type: (str) -> HiddenText
+    redacted = redact_auth_from_url(url)
+    return HiddenText(url, redacted=redacted)
+
+
+def protect_pip_from_modification_on_windows(modifying_pip):
+    # type: (bool) -> None
+    """Protection of pip.exe from modification on Windows
+
+    On Windows, any operation modifying pip should be run as:
+        python -m pip ...
+    """
+    pip_names = [
+        "pip.exe",
+        "pip{}.exe".format(sys.version_info[0]),
+        "pip{}.{}.exe".format(*sys.version_info[:2])
+    ]
+
+    # See https://github.com/pypa/pip/issues/1299 for more discussion
+    should_show_use_python_msg = (
+        modifying_pip and
+        WINDOWS and
+        os.path.basename(sys.argv[0]) in pip_names
+    )
+
+    if should_show_use_python_msg:
+        new_command = [
+            sys.executable, "-m", "pip"
+        ] + sys.argv[1:]
+        raise CommandError(
+            'To modify pip, please run the following command:\n{}'
+            .format(" ".join(new_command))
+        )
+
+
+def is_console_interactive():
+    # type: () -> bool
+    """Is this console interactive?
+    """
+    return sys.stdin is not None and sys.stdin.isatty()
+
+
+def hash_file(path, blocksize=1 << 20):
+    # type: (Text, int) -> Tuple[Any, int]
+    """Return (hash, length) for path using hashlib.sha256()
+    """
+
+    h = hashlib.sha256()
+    length = 0
+    with open(path, 'rb') as f:
+        for block in read_chunks(f, size=blocksize):
+            length += len(block)
+            h.update(block)
+    return h, length
+
+
+def is_wheel_installed():
+    """
+    Return whether the wheel package is installed.
+    """
+    try:
+        import wheel  # noqa: F401
+    except ImportError:
+        return False
+
+    return True
+
+
+def pairwise(iterable):
+    # type: (Iterable[Any]) -> Iterator[Tuple[Any, Any]]
+    """
+    Return paired elements.
+
+    For example:
+        s -> (s0, s1), (s2, s3), (s4, s5), ...
+    """
+    iterable = iter(iterable)
+    return zip_longest(iterable, iterable)
+
+
+def partition(
+    pred,  # type: Callable[[T], bool]
+    iterable,  # type: Iterable[T]
+):
+    # type: (...) -> Tuple[Iterable[T], Iterable[T]]
+    """
+    Use a predicate to partition entries into false entries and true entries,
+    like
+
+        partition(is_odd, range(10)) --> 0 2 4 6 8   and  1 3 5 7 9
+    """
+    t1, t2 = tee(iterable)
+    return filterfalse(pred, t1), filter(pred, t2)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/models.py b/venv/Lib/site-packages/pip/_internal/utils/models.py
new file mode 100644
index 000000000..d1c2f2267
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/models.py
@@ -0,0 +1,44 @@
+"""Utilities for defining models
+"""
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+import operator
+
+
+class KeyBasedCompareMixin(object):
+    """Provides comparison capabilities that is based on a key
+    """
+
+    __slots__ = ['_compare_key', '_defining_class']
+
+    def __init__(self, key, defining_class):
+        self._compare_key = key
+        self._defining_class = defining_class
+
+    def __hash__(self):
+        return hash(self._compare_key)
+
+    def __lt__(self, other):
+        return self._compare(other, operator.__lt__)
+
+    def __le__(self, other):
+        return self._compare(other, operator.__le__)
+
+    def __gt__(self, other):
+        return self._compare(other, operator.__gt__)
+
+    def __ge__(self, other):
+        return self._compare(other, operator.__ge__)
+
+    def __eq__(self, other):
+        return self._compare(other, operator.__eq__)
+
+    def __ne__(self, other):
+        return self._compare(other, operator.__ne__)
+
+    def _compare(self, other, method):
+        if not isinstance(other, self._defining_class):
+            return NotImplemented
+
+        return method(self._compare_key, other._compare_key)
diff --git a/venv/Lib/site-packages/pip/_internal/utils/packaging.py b/venv/Lib/site-packages/pip/_internal/utils/packaging.py
new file mode 100644
index 000000000..68aa86edb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/packaging.py
@@ -0,0 +1,94 @@
+from __future__ import absolute_import
+
+import logging
+from email.parser import FeedParser
+
+from pip._vendor import pkg_resources
+from pip._vendor.packaging import specifiers, version
+
+from pip._internal.exceptions import NoneMetadataError
+from pip._internal.utils.misc import display_path
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Tuple
+    from email.message import Message
+    from pip._vendor.pkg_resources import Distribution
+
+
+logger = logging.getLogger(__name__)
+
+
+def check_requires_python(requires_python, version_info):
+    # type: (Optional[str], Tuple[int, ...]) -> bool
+    """
+    Check if the given Python version matches a "Requires-Python" specifier.
+
+    :param version_info: A 3-tuple of ints representing a Python
+        major-minor-micro version to check (e.g. `sys.version_info[:3]`).
+
+    :return: `True` if the given Python version satisfies the requirement.
+        Otherwise, return `False`.
+
+    :raises InvalidSpecifier: If `requires_python` has an invalid format.
+    """
+    if requires_python is None:
+        # The package provides no information
+        return True
+    requires_python_specifier = specifiers.SpecifierSet(requires_python)
+
+    python_version = version.parse('.'.join(map(str, version_info)))
+    return python_version in requires_python_specifier
+
+
+def get_metadata(dist):
+    # type: (Distribution) -> Message
+    """
+    :raises NoneMetadataError: if the distribution reports `has_metadata()`
+        True but `get_metadata()` returns None.
+    """
+    metadata_name = 'METADATA'
+    if (isinstance(dist, pkg_resources.DistInfoDistribution) and
+            dist.has_metadata(metadata_name)):
+        metadata = dist.get_metadata(metadata_name)
+    elif dist.has_metadata('PKG-INFO'):
+        metadata_name = 'PKG-INFO'
+        metadata = dist.get_metadata(metadata_name)
+    else:
+        logger.warning("No metadata found in %s", display_path(dist.location))
+        metadata = ''
+
+    if metadata is None:
+        raise NoneMetadataError(dist, metadata_name)
+
+    feed_parser = FeedParser()
+    # The following line errors out if with a "NoneType" TypeError if
+    # passed metadata=None.
+    feed_parser.feed(metadata)
+    return feed_parser.close()
+
+
+def get_requires_python(dist):
+    # type: (pkg_resources.Distribution) -> Optional[str]
+    """
+    Return the "Requires-Python" metadata for a distribution, or None
+    if not present.
+    """
+    pkg_info_dict = get_metadata(dist)
+    requires_python = pkg_info_dict.get('Requires-Python')
+
+    if requires_python is not None:
+        # Convert to a str to satisfy the type checker, since requires_python
+        # can be a Header object.
+        requires_python = str(requires_python)
+
+    return requires_python
+
+
+def get_installer(dist):
+    # type: (Distribution) -> str
+    if dist.has_metadata('INSTALLER'):
+        for line in dist.get_metadata_lines('INSTALLER'):
+            if line.strip():
+                return line.strip()
+    return ''
diff --git a/venv/Lib/site-packages/pip/_internal/utils/parallel.py b/venv/Lib/site-packages/pip/_internal/utils/parallel.py
new file mode 100644
index 000000000..9fe1fe8b9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/parallel.py
@@ -0,0 +1,107 @@
+"""Convenient parallelization of higher order functions.
+
+This module provides two helper functions, with appropriate fallbacks on
+Python 2 and on systems lacking support for synchronization mechanisms:
+
+- map_multiprocess
+- map_multithread
+
+These helpers work like Python 3's map, with two differences:
+
+- They don't guarantee the order of processing of
+  the elements of the iterable.
+- The underlying process/thread pools chop the iterable into
+  a number of chunks, so that for very long iterables using
+  a large value for chunksize can make the job complete much faster
+  than using the default value of 1.
+"""
+
+__all__ = ['map_multiprocess', 'map_multithread']
+
+from contextlib import contextmanager
+from multiprocessing import Pool as ProcessPool
+from multiprocessing.dummy import Pool as ThreadPool
+
+from pip._vendor.requests.adapters import DEFAULT_POOLSIZE
+from pip._vendor.six import PY2
+from pip._vendor.six.moves import map
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Callable, Iterable, Iterator, Union, TypeVar
+    from multiprocessing import pool
+
+    Pool = Union[pool.Pool, pool.ThreadPool]
+    S = TypeVar('S')
+    T = TypeVar('T')
+
+# On platforms without sem_open, multiprocessing[.dummy] Pool
+# cannot be created.
+try:
+    import multiprocessing.synchronize  # noqa
+except ImportError:
+    LACK_SEM_OPEN = True
+else:
+    LACK_SEM_OPEN = False
+
+# Incredibly large timeout to work around bpo-8296 on Python 2.
+TIMEOUT = 2000000
+
+
+@contextmanager
+def closing(pool):
+    # type: (Pool) -> Iterator[Pool]
+    """Return a context manager making sure the pool closes properly."""
+    try:
+        yield pool
+    finally:
+        # For Pool.imap*, close and join are needed
+        # for the returned iterator to begin yielding.
+        pool.close()
+        pool.join()
+        pool.terminate()
+
+
+def _map_fallback(func, iterable, chunksize=1):
+    # type: (Callable[[S], T], Iterable[S], int) -> Iterator[T]
+    """Make an iterator applying func to each element in iterable.
+
+    This function is the sequential fallback either on Python 2
+    where Pool.imap* doesn't react to KeyboardInterrupt
+    or when sem_open is unavailable.
+    """
+    return map(func, iterable)
+
+
+def _map_multiprocess(func, iterable, chunksize=1):
+    # type: (Callable[[S], T], Iterable[S], int) -> Iterator[T]
+    """Chop iterable into chunks and submit them to a process pool.
+
+    For very long iterables using a large value for chunksize can make
+    the job complete much faster than using the default value of 1.
+
+    Return an unordered iterator of the results.
+    """
+    with closing(ProcessPool()) as pool:
+        return pool.imap_unordered(func, iterable, chunksize)
+
+
+def _map_multithread(func, iterable, chunksize=1):
+    # type: (Callable[[S], T], Iterable[S], int) -> Iterator[T]
+    """Chop iterable into chunks and submit them to a thread pool.
+
+    For very long iterables using a large value for chunksize can make
+    the job complete much faster than using the default value of 1.
+
+    Return an unordered iterator of the results.
+    """
+    with closing(ThreadPool(DEFAULT_POOLSIZE)) as pool:
+        return pool.imap_unordered(func, iterable, chunksize)
+
+
+if LACK_SEM_OPEN or PY2:
+    map_multiprocess = map_multithread = _map_fallback
+else:
+    map_multiprocess = _map_multiprocess
+    map_multithread = _map_multithread
diff --git a/venv/Lib/site-packages/pip/_internal/utils/pkg_resources.py b/venv/Lib/site-packages/pip/_internal/utils/pkg_resources.py
new file mode 100644
index 000000000..0bc129acc
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/pkg_resources.py
@@ -0,0 +1,44 @@
+from pip._vendor.pkg_resources import yield_lines
+from pip._vendor.six import ensure_str
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Dict, Iterable, List
+
+
+class DictMetadata(object):
+    """IMetadataProvider that reads metadata files from a dictionary.
+    """
+    def __init__(self, metadata):
+        # type: (Dict[str, bytes]) -> None
+        self._metadata = metadata
+
+    def has_metadata(self, name):
+        # type: (str) -> bool
+        return name in self._metadata
+
+    def get_metadata(self, name):
+        # type: (str) -> str
+        try:
+            return ensure_str(self._metadata[name])
+        except UnicodeDecodeError as e:
+            # Mirrors handling done in pkg_resources.NullProvider.
+            e.reason += " in {} file".format(name)
+            raise
+
+    def get_metadata_lines(self, name):
+        # type: (str) -> Iterable[str]
+        return yield_lines(self.get_metadata(name))
+
+    def metadata_isdir(self, name):
+        # type: (str) -> bool
+        return False
+
+    def metadata_listdir(self, name):
+        # type: (str) -> List[str]
+        return []
+
+    def run_script(self, script_name, namespace):
+        # type: (str, str) -> None
+        pass
diff --git a/venv/Lib/site-packages/pip/_internal/utils/setuptools_build.py b/venv/Lib/site-packages/pip/_internal/utils/setuptools_build.py
new file mode 100644
index 000000000..2a664b007
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/setuptools_build.py
@@ -0,0 +1,181 @@
+import sys
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional, Sequence
+
+# Shim to wrap setup.py invocation with setuptools
+#
+# We set sys.argv[0] to the path to the underlying setup.py file so
+# setuptools / distutils don't take the path to the setup.py to be "-c" when
+# invoking via the shim.  This avoids e.g. the following manifest_maker
+# warning: "warning: manifest_maker: standard file '-c' not found".
+_SETUPTOOLS_SHIM = (
+    "import sys, setuptools, tokenize; sys.argv[0] = {0!r}; __file__={0!r};"
+    "f=getattr(tokenize, 'open', open)(__file__);"
+    "code=f.read().replace('\\r\\n', '\\n');"
+    "f.close();"
+    "exec(compile(code, __file__, 'exec'))"
+)
+
+
+def make_setuptools_shim_args(
+    setup_py_path,  # type: str
+    global_options=None,  # type: Sequence[str]
+    no_user_config=False,  # type: bool
+    unbuffered_output=False  # type: bool
+):
+    # type: (...) -> List[str]
+    """
+    Get setuptools command arguments with shim wrapped setup file invocation.
+
+    :param setup_py_path: The path to setup.py to be wrapped.
+    :param global_options: Additional global options.
+    :param no_user_config: If True, disables personal user configuration.
+    :param unbuffered_output: If True, adds the unbuffered switch to the
+     argument list.
+    """
+    args = [sys.executable]
+    if unbuffered_output:
+        args += ["-u"]
+    args += ["-c", _SETUPTOOLS_SHIM.format(setup_py_path)]
+    if global_options:
+        args += global_options
+    if no_user_config:
+        args += ["--no-user-cfg"]
+    return args
+
+
+def make_setuptools_bdist_wheel_args(
+    setup_py_path,  # type: str
+    global_options,  # type: Sequence[str]
+    build_options,  # type: Sequence[str]
+    destination_dir,  # type: str
+):
+    # type: (...) -> List[str]
+    # NOTE: Eventually, we'd want to also -S to the flags here, when we're
+    # isolating. Currently, it breaks Python in virtualenvs, because it
+    # relies on site.py to find parts of the standard library outside the
+    # virtualenv.
+    args = make_setuptools_shim_args(
+        setup_py_path,
+        global_options=global_options,
+        unbuffered_output=True
+    )
+    args += ["bdist_wheel", "-d", destination_dir]
+    args += build_options
+    return args
+
+
+def make_setuptools_clean_args(
+    setup_py_path,  # type: str
+    global_options,  # type: Sequence[str]
+):
+    # type: (...) -> List[str]
+    args = make_setuptools_shim_args(
+        setup_py_path,
+        global_options=global_options,
+        unbuffered_output=True
+    )
+    args += ["clean", "--all"]
+    return args
+
+
+def make_setuptools_develop_args(
+    setup_py_path,  # type: str
+    global_options,  # type: Sequence[str]
+    install_options,  # type: Sequence[str]
+    no_user_config,  # type: bool
+    prefix,  # type: Optional[str]
+    home,  # type: Optional[str]
+    use_user_site,  # type: bool
+):
+    # type: (...) -> List[str]
+    assert not (use_user_site and prefix)
+
+    args = make_setuptools_shim_args(
+        setup_py_path,
+        global_options=global_options,
+        no_user_config=no_user_config,
+    )
+
+    args += ["develop", "--no-deps"]
+
+    args += install_options
+
+    if prefix:
+        args += ["--prefix", prefix]
+    if home is not None:
+        args += ["--home", home]
+
+    if use_user_site:
+        args += ["--user", "--prefix="]
+
+    return args
+
+
+def make_setuptools_egg_info_args(
+    setup_py_path,  # type: str
+    egg_info_dir,  # type: Optional[str]
+    no_user_config,  # type: bool
+):
+    # type: (...) -> List[str]
+    args = make_setuptools_shim_args(
+        setup_py_path, no_user_config=no_user_config
+    )
+
+    args += ["egg_info"]
+
+    if egg_info_dir:
+        args += ["--egg-base", egg_info_dir]
+
+    return args
+
+
+def make_setuptools_install_args(
+    setup_py_path,  # type: str
+    global_options,  # type: Sequence[str]
+    install_options,  # type: Sequence[str]
+    record_filename,  # type: str
+    root,  # type: Optional[str]
+    prefix,  # type: Optional[str]
+    header_dir,  # type: Optional[str]
+    home,  # type: Optional[str]
+    use_user_site,  # type: bool
+    no_user_config,  # type: bool
+    pycompile  # type: bool
+):
+    # type: (...) -> List[str]
+    assert not (use_user_site and prefix)
+    assert not (use_user_site and root)
+
+    args = make_setuptools_shim_args(
+        setup_py_path,
+        global_options=global_options,
+        no_user_config=no_user_config,
+        unbuffered_output=True
+    )
+    args += ["install", "--record", record_filename]
+    args += ["--single-version-externally-managed"]
+
+    if root is not None:
+        args += ["--root", root]
+    if prefix is not None:
+        args += ["--prefix", prefix]
+    if home is not None:
+        args += ["--home", home]
+    if use_user_site:
+        args += ["--user", "--prefix="]
+
+    if pycompile:
+        args += ["--compile"]
+    else:
+        args += ["--no-compile"]
+
+    if header_dir:
+        args += ["--install-headers", header_dir]
+
+    args += install_options
+
+    return args
diff --git a/venv/Lib/site-packages/pip/_internal/utils/subprocess.py b/venv/Lib/site-packages/pip/_internal/utils/subprocess.py
new file mode 100644
index 000000000..d398e68da
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/subprocess.py
@@ -0,0 +1,280 @@
+from __future__ import absolute_import
+
+import logging
+import os
+import subprocess
+
+from pip._vendor.six.moves import shlex_quote
+
+from pip._internal.cli.spinners import SpinnerInterface, open_spinner
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.compat import console_to_str, str_to_display
+from pip._internal.utils.logging import subprocess_logger
+from pip._internal.utils.misc import HiddenText, path_to_display
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Callable, Iterable, List, Mapping, Optional, Text, Union,
+    )
+
+    CommandArgs = List[Union[str, HiddenText]]
+
+
+LOG_DIVIDER = '----------------------------------------'
+
+
+def make_command(*args):
+    # type: (Union[str, HiddenText, CommandArgs]) -> CommandArgs
+    """
+    Create a CommandArgs object.
+    """
+    command_args = []  # type: CommandArgs
+    for arg in args:
+        # Check for list instead of CommandArgs since CommandArgs is
+        # only known during type-checking.
+        if isinstance(arg, list):
+            command_args.extend(arg)
+        else:
+            # Otherwise, arg is str or HiddenText.
+            command_args.append(arg)
+
+    return command_args
+
+
+def format_command_args(args):
+    # type: (Union[List[str], CommandArgs]) -> str
+    """
+    Format command arguments for display.
+    """
+    # For HiddenText arguments, display the redacted form by calling str().
+    # Also, we don't apply str() to arguments that aren't HiddenText since
+    # this can trigger a UnicodeDecodeError in Python 2 if the argument
+    # has type unicode and includes a non-ascii character.  (The type
+    # checker doesn't ensure the annotations are correct in all cases.)
+    return ' '.join(
+        shlex_quote(str(arg)) if isinstance(arg, HiddenText)
+        else shlex_quote(arg) for arg in args
+    )
+
+
+def reveal_command_args(args):
+    # type: (Union[List[str], CommandArgs]) -> List[str]
+    """
+    Return the arguments in their raw, unredacted form.
+    """
+    return [
+        arg.secret if isinstance(arg, HiddenText) else arg for arg in args
+    ]
+
+
+def make_subprocess_output_error(
+    cmd_args,     # type: Union[List[str], CommandArgs]
+    cwd,          # type: Optional[str]
+    lines,        # type: List[Text]
+    exit_status,  # type: int
+):
+    # type: (...) -> Text
+    """
+    Create and return the error message to use to log a subprocess error
+    with command output.
+
+    :param lines: A list of lines, each ending with a newline.
+    """
+    command = format_command_args(cmd_args)
+    # Convert `command` and `cwd` to text (unicode in Python 2) so we can use
+    # them as arguments in the unicode format string below. This avoids
+    # "UnicodeDecodeError: 'ascii' codec can't decode byte ..." in Python 2
+    # if either contains a non-ascii character.
+    command_display = str_to_display(command, desc='command bytes')
+    cwd_display = path_to_display(cwd)
+
+    # We know the joined output value ends in a newline.
+    output = ''.join(lines)
+    msg = (
+        # Use a unicode string to avoid "UnicodeEncodeError: 'ascii'
+        # codec can't encode character ..." in Python 2 when a format
+        # argument (e.g. `output`) has a non-ascii character.
+        u'Command errored out with exit status {exit_status}:\n'
+        ' command: {command_display}\n'
+        '     cwd: {cwd_display}\n'
+        'Complete output ({line_count} lines):\n{output}{divider}'
+    ).format(
+        exit_status=exit_status,
+        command_display=command_display,
+        cwd_display=cwd_display,
+        line_count=len(lines),
+        output=output,
+        divider=LOG_DIVIDER,
+    )
+    return msg
+
+
+def call_subprocess(
+    cmd,  # type: Union[List[str], CommandArgs]
+    show_stdout=False,  # type: bool
+    cwd=None,  # type: Optional[str]
+    on_returncode='raise',  # type: str
+    extra_ok_returncodes=None,  # type: Optional[Iterable[int]]
+    command_desc=None,  # type: Optional[str]
+    extra_environ=None,  # type: Optional[Mapping[str, Any]]
+    unset_environ=None,  # type: Optional[Iterable[str]]
+    spinner=None,  # type: Optional[SpinnerInterface]
+    log_failed_cmd=True  # type: Optional[bool]
+):
+    # type: (...) -> Text
+    """
+    Args:
+      show_stdout: if true, use INFO to log the subprocess's stderr and
+        stdout streams.  Otherwise, use DEBUG.  Defaults to False.
+      extra_ok_returncodes: an iterable of integer return codes that are
+        acceptable, in addition to 0. Defaults to None, which means [].
+      unset_environ: an iterable of environment variable names to unset
+        prior to calling subprocess.Popen().
+      log_failed_cmd: if false, failed commands are not logged, only raised.
+    """
+    if extra_ok_returncodes is None:
+        extra_ok_returncodes = []
+    if unset_environ is None:
+        unset_environ = []
+    # Most places in pip use show_stdout=False. What this means is--
+    #
+    # - We connect the child's output (combined stderr and stdout) to a
+    #   single pipe, which we read.
+    # - We log this output to stderr at DEBUG level as it is received.
+    # - If DEBUG logging isn't enabled (e.g. if --verbose logging wasn't
+    #   requested), then we show a spinner so the user can still see the
+    #   subprocess is in progress.
+    # - If the subprocess exits with an error, we log the output to stderr
+    #   at ERROR level if it hasn't already been displayed to the console
+    #   (e.g. if --verbose logging wasn't enabled).  This way we don't log
+    #   the output to the console twice.
+    #
+    # If show_stdout=True, then the above is still done, but with DEBUG
+    # replaced by INFO.
+    if show_stdout:
+        # Then log the subprocess output at INFO level.
+        log_subprocess = subprocess_logger.info
+        used_level = logging.INFO
+    else:
+        # Then log the subprocess output using DEBUG.  This also ensures
+        # it will be logged to the log file (aka user_log), if enabled.
+        log_subprocess = subprocess_logger.debug
+        used_level = logging.DEBUG
+
+    # Whether the subprocess will be visible in the console.
+    showing_subprocess = subprocess_logger.getEffectiveLevel() <= used_level
+
+    # Only use the spinner if we're not showing the subprocess output
+    # and we have a spinner.
+    use_spinner = not showing_subprocess and spinner is not None
+
+    if command_desc is None:
+        command_desc = format_command_args(cmd)
+
+    log_subprocess("Running command %s", command_desc)
+    env = os.environ.copy()
+    if extra_environ:
+        env.update(extra_environ)
+    for name in unset_environ:
+        env.pop(name, None)
+    try:
+        proc = subprocess.Popen(
+            # Convert HiddenText objects to the underlying str.
+            reveal_command_args(cmd),
+            stderr=subprocess.STDOUT, stdin=subprocess.PIPE,
+            stdout=subprocess.PIPE, cwd=cwd, env=env,
+        )
+        assert proc.stdin
+        assert proc.stdout
+        proc.stdin.close()
+    except Exception as exc:
+        if log_failed_cmd:
+            subprocess_logger.critical(
+                "Error %s while executing command %s", exc, command_desc,
+            )
+        raise
+    all_output = []
+    while True:
+        # The "line" value is a unicode string in Python 2.
+        line = console_to_str(proc.stdout.readline())
+        if not line:
+            break
+        line = line.rstrip()
+        all_output.append(line + '\n')
+
+        # Show the line immediately.
+        log_subprocess(line)
+        # Update the spinner.
+        if use_spinner:
+            assert spinner
+            spinner.spin()
+    try:
+        proc.wait()
+    finally:
+        if proc.stdout:
+            proc.stdout.close()
+    proc_had_error = (
+        proc.returncode and proc.returncode not in extra_ok_returncodes
+    )
+    if use_spinner:
+        assert spinner
+        if proc_had_error:
+            spinner.finish("error")
+        else:
+            spinner.finish("done")
+    if proc_had_error:
+        if on_returncode == 'raise':
+            if not showing_subprocess and log_failed_cmd:
+                # Then the subprocess streams haven't been logged to the
+                # console yet.
+                msg = make_subprocess_output_error(
+                    cmd_args=cmd,
+                    cwd=cwd,
+                    lines=all_output,
+                    exit_status=proc.returncode,
+                )
+                subprocess_logger.error(msg)
+            exc_msg = (
+                'Command errored out with exit status {}: {} '
+                'Check the logs for full command output.'
+            ).format(proc.returncode, command_desc)
+            raise InstallationError(exc_msg)
+        elif on_returncode == 'warn':
+            subprocess_logger.warning(
+                'Command "%s" had error code %s in %s',
+                command_desc,
+                proc.returncode,
+                cwd,
+            )
+        elif on_returncode == 'ignore':
+            pass
+        else:
+            raise ValueError('Invalid value: on_returncode={!r}'.format(
+                             on_returncode))
+    return ''.join(all_output)
+
+
+def runner_with_spinner_message(message):
+    # type: (str) -> Callable[..., None]
+    """Provide a subprocess_runner that shows a spinner message.
+
+    Intended for use with for pep517's Pep517HookCaller. Thus, the runner has
+    an API that matches what's expected by Pep517HookCaller.subprocess_runner.
+    """
+
+    def runner(
+        cmd,  # type: List[str]
+        cwd=None,  # type: Optional[str]
+        extra_environ=None  # type: Optional[Mapping[str, Any]]
+    ):
+        # type: (...) -> None
+        with open_spinner(message) as spinner:
+            call_subprocess(
+                cmd,
+                cwd=cwd,
+                extra_environ=extra_environ,
+                spinner=spinner,
+            )
+
+    return runner
diff --git a/venv/Lib/site-packages/pip/_internal/utils/temp_dir.py b/venv/Lib/site-packages/pip/_internal/utils/temp_dir.py
new file mode 100644
index 000000000..03aa82866
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/temp_dir.py
@@ -0,0 +1,274 @@
+from __future__ import absolute_import
+
+import errno
+import itertools
+import logging
+import os.path
+import tempfile
+from contextlib import contextmanager
+
+from pip._vendor.contextlib2 import ExitStack
+from pip._vendor.six import ensure_text
+
+from pip._internal.utils.misc import enum, rmtree
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Any, Dict, Iterator, Optional, TypeVar, Union
+
+    _T = TypeVar('_T', bound='TempDirectory')
+
+
+logger = logging.getLogger(__name__)
+
+
+# Kinds of temporary directories. Only needed for ones that are
+# globally-managed.
+tempdir_kinds = enum(
+    BUILD_ENV="build-env",
+    EPHEM_WHEEL_CACHE="ephem-wheel-cache",
+    REQ_BUILD="req-build",
+)
+
+
+_tempdir_manager = None  # type: Optional[ExitStack]
+
+
+@contextmanager
+def global_tempdir_manager():
+    # type: () -> Iterator[None]
+    global _tempdir_manager
+    with ExitStack() as stack:
+        old_tempdir_manager, _tempdir_manager = _tempdir_manager, stack
+        try:
+            yield
+        finally:
+            _tempdir_manager = old_tempdir_manager
+
+
+class TempDirectoryTypeRegistry(object):
+    """Manages temp directory behavior
+    """
+
+    def __init__(self):
+        # type: () -> None
+        self._should_delete = {}  # type: Dict[str, bool]
+
+    def set_delete(self, kind, value):
+        # type: (str, bool) -> None
+        """Indicate whether a TempDirectory of the given kind should be
+        auto-deleted.
+        """
+        self._should_delete[kind] = value
+
+    def get_delete(self, kind):
+        # type: (str) -> bool
+        """Get configured auto-delete flag for a given TempDirectory type,
+        default True.
+        """
+        return self._should_delete.get(kind, True)
+
+
+_tempdir_registry = None  # type: Optional[TempDirectoryTypeRegistry]
+
+
+@contextmanager
+def tempdir_registry():
+    # type: () -> Iterator[TempDirectoryTypeRegistry]
+    """Provides a scoped global tempdir registry that can be used to dictate
+    whether directories should be deleted.
+    """
+    global _tempdir_registry
+    old_tempdir_registry = _tempdir_registry
+    _tempdir_registry = TempDirectoryTypeRegistry()
+    try:
+        yield _tempdir_registry
+    finally:
+        _tempdir_registry = old_tempdir_registry
+
+
+class _Default(object):
+    pass
+
+
+_default = _Default()
+
+
+class TempDirectory(object):
+    """Helper class that owns and cleans up a temporary directory.
+
+    This class can be used as a context manager or as an OO representation of a
+    temporary directory.
+
+    Attributes:
+        path
+            Location to the created temporary directory
+        delete
+            Whether the directory should be deleted when exiting
+            (when used as a contextmanager)
+
+    Methods:
+        cleanup()
+            Deletes the temporary directory
+
+    When used as a context manager, if the delete attribute is True, on
+    exiting the context the temporary directory is deleted.
+    """
+
+    def __init__(
+        self,
+        path=None,    # type: Optional[str]
+        delete=_default,  # type: Union[bool, None, _Default]
+        kind="temp",  # type: str
+        globally_managed=False,  # type: bool
+    ):
+        super(TempDirectory, self).__init__()
+
+        if delete is _default:
+            if path is not None:
+                # If we were given an explicit directory, resolve delete option
+                # now.
+                delete = False
+            else:
+                # Otherwise, we wait until cleanup and see what
+                # tempdir_registry says.
+                delete = None
+
+        if path is None:
+            path = self._create(kind)
+
+        self._path = path
+        self._deleted = False
+        self.delete = delete
+        self.kind = kind
+
+        if globally_managed:
+            assert _tempdir_manager is not None
+            _tempdir_manager.enter_context(self)
+
+    @property
+    def path(self):
+        # type: () -> str
+        assert not self._deleted, (
+            "Attempted to access deleted path: {}".format(self._path)
+        )
+        return self._path
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{} {!r}>".format(self.__class__.__name__, self.path)
+
+    def __enter__(self):
+        # type: (_T) -> _T
+        return self
+
+    def __exit__(self, exc, value, tb):
+        # type: (Any, Any, Any) -> None
+        if self.delete is not None:
+            delete = self.delete
+        elif _tempdir_registry:
+            delete = _tempdir_registry.get_delete(self.kind)
+        else:
+            delete = True
+
+        if delete:
+            self.cleanup()
+
+    def _create(self, kind):
+        # type: (str) -> str
+        """Create a temporary directory and store its path in self.path
+        """
+        # We realpath here because some systems have their default tmpdir
+        # symlinked to another directory.  This tends to confuse build
+        # scripts, so we canonicalize the path by traversing potential
+        # symlinks here.
+        path = os.path.realpath(
+            tempfile.mkdtemp(prefix="pip-{}-".format(kind))
+        )
+        logger.debug("Created temporary directory: %s", path)
+        return path
+
+    def cleanup(self):
+        # type: () -> None
+        """Remove the temporary directory created and reset state
+        """
+        self._deleted = True
+        if os.path.exists(self._path):
+            # Make sure to pass unicode on Python 2 to make the contents also
+            # use unicode, ensuring non-ASCII names and can be represented.
+            rmtree(ensure_text(self._path))
+
+
+class AdjacentTempDirectory(TempDirectory):
+    """Helper class that creates a temporary directory adjacent to a real one.
+
+    Attributes:
+        original
+            The original directory to create a temp directory for.
+        path
+            After calling create() or entering, contains the full
+            path to the temporary directory.
+        delete
+            Whether the directory should be deleted when exiting
+            (when used as a contextmanager)
+
+    """
+    # The characters that may be used to name the temp directory
+    # We always prepend a ~ and then rotate through these until
+    # a usable name is found.
+    # pkg_resources raises a different error for .dist-info folder
+    # with leading '-' and invalid metadata
+    LEADING_CHARS = "-~.=%0123456789"
+
+    def __init__(self, original, delete=None):
+        # type: (str, Optional[bool]) -> None
+        self.original = original.rstrip('/\\')
+        super(AdjacentTempDirectory, self).__init__(delete=delete)
+
+    @classmethod
+    def _generate_names(cls, name):
+        # type: (str) -> Iterator[str]
+        """Generates a series of temporary names.
+
+        The algorithm replaces the leading characters in the name
+        with ones that are valid filesystem characters, but are not
+        valid package names (for both Python and pip definitions of
+        package).
+        """
+        for i in range(1, len(name)):
+            for candidate in itertools.combinations_with_replacement(
+                    cls.LEADING_CHARS, i - 1):
+                new_name = '~' + ''.join(candidate) + name[i:]
+                if new_name != name:
+                    yield new_name
+
+        # If we make it this far, we will have to make a longer name
+        for i in range(len(cls.LEADING_CHARS)):
+            for candidate in itertools.combinations_with_replacement(
+                    cls.LEADING_CHARS, i):
+                new_name = '~' + ''.join(candidate) + name
+                if new_name != name:
+                    yield new_name
+
+    def _create(self, kind):
+        # type: (str) -> str
+        root, name = os.path.split(self.original)
+        for candidate in self._generate_names(name):
+            path = os.path.join(root, candidate)
+            try:
+                os.mkdir(path)
+            except OSError as ex:
+                # Continue if the name exists already
+                if ex.errno != errno.EEXIST:
+                    raise
+            else:
+                path = os.path.realpath(path)
+                break
+        else:
+            # Final fallback on the default behavior.
+            path = os.path.realpath(
+                tempfile.mkdtemp(prefix="pip-{}-".format(kind))
+            )
+
+        logger.debug("Created temporary directory: %s", path)
+        return path
diff --git a/venv/Lib/site-packages/pip/_internal/utils/typing.py b/venv/Lib/site-packages/pip/_internal/utils/typing.py
new file mode 100644
index 000000000..8505a29b1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/typing.py
@@ -0,0 +1,38 @@
+"""For neatly implementing static typing in pip.
+
+`mypy` - the static type analysis tool we use - uses the `typing` module, which
+provides core functionality fundamental to mypy's functioning.
+
+Generally, `typing` would be imported at runtime and used in that fashion -
+it acts as a no-op at runtime and does not have any run-time overhead by
+design.
+
+As it turns out, `typing` is not vendorable - it uses separate sources for
+Python 2/Python 3. Thus, this codebase can not expect it to be present.
+To work around this, mypy allows the typing import to be behind a False-y
+optional to prevent it from running at runtime and type-comments can be used
+to remove the need for the types to be accessible directly during runtime.
+
+This module provides the False-y guard in a nicely named fashion so that a
+curious maintainer can reach here to read this.
+
+In pip, all static-typing related imports should be guarded as follows:
+
+    from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+    if MYPY_CHECK_RUNNING:
+        from typing import ...
+
+Ref: https://github.com/python/mypy/issues/3216
+"""
+
+MYPY_CHECK_RUNNING = False
+
+
+if MYPY_CHECK_RUNNING:
+    from typing import cast
+else:
+    # typing's cast() is needed at runtime, but we don't want to import typing.
+    # Thus, we use a dummy no-op version, which we tell mypy to ignore.
+    def cast(type_, value):  # type: ignore
+        return value
diff --git a/venv/Lib/site-packages/pip/_internal/utils/unpacking.py b/venv/Lib/site-packages/pip/_internal/utils/unpacking.py
new file mode 100644
index 000000000..620f31ebb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/unpacking.py
@@ -0,0 +1,281 @@
+"""Utilities related archives.
+"""
+
+from __future__ import absolute_import
+
+import logging
+import os
+import shutil
+import stat
+import tarfile
+import zipfile
+
+from pip._internal.exceptions import InstallationError
+from pip._internal.utils.filetypes import (
+    BZ2_EXTENSIONS,
+    TAR_EXTENSIONS,
+    XZ_EXTENSIONS,
+    ZIP_EXTENSIONS,
+)
+from pip._internal.utils.misc import ensure_dir
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Iterable, List, Optional, Text, Union
+    from zipfile import ZipInfo
+
+
+logger = logging.getLogger(__name__)
+
+
+SUPPORTED_EXTENSIONS = ZIP_EXTENSIONS + TAR_EXTENSIONS
+
+try:
+    import bz2  # noqa
+    SUPPORTED_EXTENSIONS += BZ2_EXTENSIONS
+except ImportError:
+    logger.debug('bz2 module is not available')
+
+try:
+    # Only for Python 3.3+
+    import lzma  # noqa
+    SUPPORTED_EXTENSIONS += XZ_EXTENSIONS
+except ImportError:
+    logger.debug('lzma module is not available')
+
+
+def current_umask():
+    # type: () -> int
+    """Get the current umask which involves having to set it temporarily."""
+    mask = os.umask(0)
+    os.umask(mask)
+    return mask
+
+
+def split_leading_dir(path):
+    # type: (Union[str, Text]) -> List[Union[str, Text]]
+    path = path.lstrip('/').lstrip('\\')
+    if (
+        '/' in path and (
+            ('\\' in path and path.find('/') < path.find('\\')) or
+            '\\' not in path
+        )
+    ):
+        return path.split('/', 1)
+    elif '\\' in path:
+        return path.split('\\', 1)
+    else:
+        return [path, '']
+
+
+def has_leading_dir(paths):
+    # type: (Iterable[Union[str, Text]]) -> bool
+    """Returns true if all the paths have the same leading path name
+    (i.e., everything is in one subdirectory in an archive)"""
+    common_prefix = None
+    for path in paths:
+        prefix, rest = split_leading_dir(path)
+        if not prefix:
+            return False
+        elif common_prefix is None:
+            common_prefix = prefix
+        elif prefix != common_prefix:
+            return False
+    return True
+
+
+def is_within_directory(directory, target):
+    # type: ((Union[str, Text]), (Union[str, Text])) -> bool
+    """
+    Return true if the absolute path of target is within the directory
+    """
+    abs_directory = os.path.abspath(directory)
+    abs_target = os.path.abspath(target)
+
+    prefix = os.path.commonprefix([abs_directory, abs_target])
+    return prefix == abs_directory
+
+
+def set_extracted_file_to_default_mode_plus_executable(path):
+    # type: (Union[str, Text]) -> None
+    """
+    Make file present at path have execute for user/group/world
+    (chmod +x) is no-op on windows per python docs
+    """
+    os.chmod(path, (0o777 & ~current_umask() | 0o111))
+
+
+def zip_item_is_executable(info):
+    # type: (ZipInfo) -> bool
+    mode = info.external_attr >> 16
+    # if mode and regular file and any execute permissions for
+    # user/group/world?
+    return bool(mode and stat.S_ISREG(mode) and mode & 0o111)
+
+
+def unzip_file(filename, location, flatten=True):
+    # type: (str, str, bool) -> None
+    """
+    Unzip the file (with path `filename`) to the destination `location`.  All
+    files are written based on system defaults and umask (i.e. permissions are
+    not preserved), except that regular file members with any execute
+    permissions (user, group, or world) have "chmod +x" applied after being
+    written. Note that for windows, any execute changes using os.chmod are
+    no-ops per the python docs.
+    """
+    ensure_dir(location)
+    zipfp = open(filename, 'rb')
+    try:
+        zip = zipfile.ZipFile(zipfp, allowZip64=True)
+        leading = has_leading_dir(zip.namelist()) and flatten
+        for info in zip.infolist():
+            name = info.filename
+            fn = name
+            if leading:
+                fn = split_leading_dir(name)[1]
+            fn = os.path.join(location, fn)
+            dir = os.path.dirname(fn)
+            if not is_within_directory(location, fn):
+                message = (
+                    'The zip file ({}) has a file ({}) trying to install '
+                    'outside target directory ({})'
+                )
+                raise InstallationError(message.format(filename, fn, location))
+            if fn.endswith('/') or fn.endswith('\\'):
+                # A directory
+                ensure_dir(fn)
+            else:
+                ensure_dir(dir)
+                # Don't use read() to avoid allocating an arbitrarily large
+                # chunk of memory for the file's content
+                fp = zip.open(name)
+                try:
+                    with open(fn, 'wb') as destfp:
+                        shutil.copyfileobj(fp, destfp)
+                finally:
+                    fp.close()
+                    if zip_item_is_executable(info):
+                        set_extracted_file_to_default_mode_plus_executable(fn)
+    finally:
+        zipfp.close()
+
+
+def untar_file(filename, location):
+    # type: (str, str) -> None
+    """
+    Untar the file (with path `filename`) to the destination `location`.
+    All files are written based on system defaults and umask (i.e. permissions
+    are not preserved), except that regular file members with any execute
+    permissions (user, group, or world) have "chmod +x" applied after being
+    written.  Note that for windows, any execute changes using os.chmod are
+    no-ops per the python docs.
+    """
+    ensure_dir(location)
+    if filename.lower().endswith('.gz') or filename.lower().endswith('.tgz'):
+        mode = 'r:gz'
+    elif filename.lower().endswith(BZ2_EXTENSIONS):
+        mode = 'r:bz2'
+    elif filename.lower().endswith(XZ_EXTENSIONS):
+        mode = 'r:xz'
+    elif filename.lower().endswith('.tar'):
+        mode = 'r'
+    else:
+        logger.warning(
+            'Cannot determine compression type for file %s', filename,
+        )
+        mode = 'r:*'
+    tar = tarfile.open(filename, mode)
+    try:
+        leading = has_leading_dir([
+            member.name for member in tar.getmembers()
+        ])
+        for member in tar.getmembers():
+            fn = member.name
+            if leading:
+                # https://github.com/python/mypy/issues/1174
+                fn = split_leading_dir(fn)[1]  # type: ignore
+            path = os.path.join(location, fn)
+            if not is_within_directory(location, path):
+                message = (
+                    'The tar file ({}) has a file ({}) trying to install '
+                    'outside target directory ({})'
+                )
+                raise InstallationError(
+                    message.format(filename, path, location)
+                )
+            if member.isdir():
+                ensure_dir(path)
+            elif member.issym():
+                try:
+                    # https://github.com/python/typeshed/issues/2673
+                    tar._extract_member(member, path)  # type: ignore
+                except Exception as exc:
+                    # Some corrupt tar files seem to produce this
+                    # (specifically bad symlinks)
+                    logger.warning(
+                        'In the tar file %s the member %s is invalid: %s',
+                        filename, member.name, exc,
+                    )
+                    continue
+            else:
+                try:
+                    fp = tar.extractfile(member)
+                except (KeyError, AttributeError) as exc:
+                    # Some corrupt tar files seem to produce this
+                    # (specifically bad symlinks)
+                    logger.warning(
+                        'In the tar file %s the member %s is invalid: %s',
+                        filename, member.name, exc,
+                    )
+                    continue
+                ensure_dir(os.path.dirname(path))
+                assert fp is not None
+                with open(path, 'wb') as destfp:
+                    shutil.copyfileobj(fp, destfp)
+                fp.close()
+                # Update the timestamp (useful for cython compiled files)
+                # https://github.com/python/typeshed/issues/2673
+                tar.utime(member, path)  # type: ignore
+                # member have any execute permissions for user/group/world?
+                if member.mode & 0o111:
+                    set_extracted_file_to_default_mode_plus_executable(path)
+    finally:
+        tar.close()
+
+
+def unpack_file(
+        filename,  # type: str
+        location,  # type: str
+        content_type=None,  # type: Optional[str]
+):
+    # type: (...) -> None
+    filename = os.path.realpath(filename)
+    if (
+        content_type == 'application/zip' or
+        filename.lower().endswith(ZIP_EXTENSIONS) or
+        zipfile.is_zipfile(filename)
+    ):
+        unzip_file(
+            filename,
+            location,
+            flatten=not filename.endswith('.whl')
+        )
+    elif (
+        content_type == 'application/x-gzip' or
+        tarfile.is_tarfile(filename) or
+        filename.lower().endswith(
+            TAR_EXTENSIONS + BZ2_EXTENSIONS + XZ_EXTENSIONS
+        )
+    ):
+        untar_file(filename, location)
+    else:
+        # FIXME: handle?
+        # FIXME: magic signatures?
+        logger.critical(
+            'Cannot unpack file %s (downloaded from %s, content-type: %s); '
+            'cannot detect archive format',
+            filename, location, content_type,
+        )
+        raise InstallationError(
+            'Cannot determine archive format of {}'.format(location)
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/utils/urls.py b/venv/Lib/site-packages/pip/_internal/utils/urls.py
new file mode 100644
index 000000000..f37bc8f90
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/urls.py
@@ -0,0 +1,55 @@
+import os
+import sys
+
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+from pip._vendor.six.moves.urllib import request as urllib_request
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Text, Union
+
+
+def get_url_scheme(url):
+    # type: (Union[str, Text]) -> Optional[Text]
+    if ':' not in url:
+        return None
+    return url.split(':', 1)[0].lower()
+
+
+def path_to_url(path):
+    # type: (Union[str, Text]) -> str
+    """
+    Convert a path to a file: URL.  The path will be made absolute and have
+    quoted path parts.
+    """
+    path = os.path.normpath(os.path.abspath(path))
+    url = urllib_parse.urljoin('file:', urllib_request.pathname2url(path))
+    return url
+
+
+def url_to_path(url):
+    # type: (str) -> str
+    """
+    Convert a file: URL to a path.
+    """
+    assert url.startswith('file:'), (
+        "You can only turn file: urls into filenames (not {url!r})"
+        .format(**locals()))
+
+    _, netloc, path, _, _ = urllib_parse.urlsplit(url)
+
+    if not netloc or netloc == 'localhost':
+        # According to RFC 8089, same as empty authority.
+        netloc = ''
+    elif sys.platform == 'win32':
+        # If we have a UNC path, prepend UNC share notation.
+        netloc = '\\\\' + netloc
+    else:
+        raise ValueError(
+            'non-local file URIs are not supported on this platform: {url!r}'
+            .format(**locals())
+        )
+
+    path = urllib_request.url2pathname(netloc + path)
+    return path
diff --git a/venv/Lib/site-packages/pip/_internal/utils/virtualenv.py b/venv/Lib/site-packages/pip/_internal/utils/virtualenv.py
new file mode 100644
index 000000000..4a7812873
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/virtualenv.py
@@ -0,0 +1,119 @@
+from __future__ import absolute_import
+
+import io
+import logging
+import os
+import re
+import site
+import sys
+
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from typing import List, Optional
+
+logger = logging.getLogger(__name__)
+_INCLUDE_SYSTEM_SITE_PACKAGES_REGEX = re.compile(
+    r"include-system-site-packages\s*=\s*(?P<value>true|false)"
+)
+
+
+def _running_under_venv():
+    # type: () -> bool
+    """Checks if sys.base_prefix and sys.prefix match.
+
+    This handles PEP 405 compliant virtual environments.
+    """
+    return sys.prefix != getattr(sys, "base_prefix", sys.prefix)
+
+
+def _running_under_regular_virtualenv():
+    # type: () -> bool
+    """Checks if sys.real_prefix is set.
+
+    This handles virtual environments created with pypa's virtualenv.
+    """
+    # pypa/virtualenv case
+    return hasattr(sys, 'real_prefix')
+
+
+def running_under_virtualenv():
+    # type: () -> bool
+    """Return True if we're running inside a virtualenv, False otherwise.
+    """
+    return _running_under_venv() or _running_under_regular_virtualenv()
+
+
+def _get_pyvenv_cfg_lines():
+    # type: () -> Optional[List[str]]
+    """Reads {sys.prefix}/pyvenv.cfg and returns its contents as list of lines
+
+    Returns None, if it could not read/access the file.
+    """
+    pyvenv_cfg_file = os.path.join(sys.prefix, 'pyvenv.cfg')
+    try:
+        # Although PEP 405 does not specify, the built-in venv module always
+        # writes with UTF-8. (pypa/pip#8717)
+        with io.open(pyvenv_cfg_file, encoding='utf-8') as f:
+            return f.read().splitlines()  # avoids trailing newlines
+    except IOError:
+        return None
+
+
+def _no_global_under_venv():
+    # type: () -> bool
+    """Check `{sys.prefix}/pyvenv.cfg` for system site-packages inclusion
+
+    PEP 405 specifies that when system site-packages are not supposed to be
+    visible from a virtual environment, `pyvenv.cfg` must contain the following
+    line:
+
+        include-system-site-packages = false
+
+    Additionally, log a warning if accessing the file fails.
+    """
+    cfg_lines = _get_pyvenv_cfg_lines()
+    if cfg_lines is None:
+        # We're not in a "sane" venv, so assume there is no system
+        # site-packages access (since that's PEP 405's default state).
+        logger.warning(
+            "Could not access 'pyvenv.cfg' despite a virtual environment "
+            "being active. Assuming global site-packages is not accessible "
+            "in this environment."
+        )
+        return True
+
+    for line in cfg_lines:
+        match = _INCLUDE_SYSTEM_SITE_PACKAGES_REGEX.match(line)
+        if match is not None and match.group('value') == 'false':
+            return True
+    return False
+
+
+def _no_global_under_regular_virtualenv():
+    # type: () -> bool
+    """Check if "no-global-site-packages.txt" exists beside site.py
+
+    This mirrors logic in pypa/virtualenv for determining whether system
+    site-packages are visible in the virtual environment.
+    """
+    site_mod_dir = os.path.dirname(os.path.abspath(site.__file__))
+    no_global_site_packages_file = os.path.join(
+        site_mod_dir, 'no-global-site-packages.txt',
+    )
+    return os.path.exists(no_global_site_packages_file)
+
+
+def virtualenv_no_global():
+    # type: () -> bool
+    """Returns a boolean, whether running in venv with no system site-packages.
+    """
+    # PEP 405 compliance needs to be checked first since virtualenv >=20 would
+    # return True for both checks, but is only able to use the PEP 405 config.
+    if _running_under_venv():
+        return _no_global_under_venv()
+
+    if _running_under_regular_virtualenv():
+        return _no_global_under_regular_virtualenv()
+
+    return False
diff --git a/venv/Lib/site-packages/pip/_internal/utils/wheel.py b/venv/Lib/site-packages/pip/_internal/utils/wheel.py
new file mode 100644
index 000000000..9ce371c76
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/utils/wheel.py
@@ -0,0 +1,225 @@
+"""Support functions for working with wheel files.
+"""
+
+from __future__ import absolute_import
+
+import logging
+from email.parser import Parser
+from zipfile import ZipFile
+
+from pip._vendor.packaging.utils import canonicalize_name
+from pip._vendor.pkg_resources import DistInfoDistribution
+from pip._vendor.six import PY2, ensure_str
+
+from pip._internal.exceptions import UnsupportedWheel
+from pip._internal.utils.pkg_resources import DictMetadata
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+
+if MYPY_CHECK_RUNNING:
+    from email.message import Message
+    from typing import Dict, Tuple
+
+    from pip._vendor.pkg_resources import Distribution
+
+if PY2:
+    from zipfile import BadZipfile as BadZipFile
+else:
+    from zipfile import BadZipFile
+
+
+VERSION_COMPATIBLE = (1, 0)
+
+
+logger = logging.getLogger(__name__)
+
+
+class WheelMetadata(DictMetadata):
+    """Metadata provider that maps metadata decoding exceptions to our
+    internal exception type.
+    """
+    def __init__(self, metadata, wheel_name):
+        # type: (Dict[str, bytes], str) -> None
+        super(WheelMetadata, self).__init__(metadata)
+        self._wheel_name = wheel_name
+
+    def get_metadata(self, name):
+        # type: (str) -> str
+        try:
+            return super(WheelMetadata, self).get_metadata(name)
+        except UnicodeDecodeError as e:
+            # Augment the default error with the origin of the file.
+            raise UnsupportedWheel(
+                "Error decoding metadata for {}: {}".format(
+                    self._wheel_name, e
+                )
+            )
+
+
+def pkg_resources_distribution_for_wheel(wheel_zip, name, location):
+    # type: (ZipFile, str, str) -> Distribution
+    """Get a pkg_resources distribution given a wheel.
+
+    :raises UnsupportedWheel: on any errors
+    """
+    info_dir, _ = parse_wheel(wheel_zip, name)
+
+    metadata_files = [
+        p for p in wheel_zip.namelist() if p.startswith("{}/".format(info_dir))
+    ]
+
+    metadata_text = {}  # type: Dict[str, bytes]
+    for path in metadata_files:
+        # If a flag is set, namelist entries may be unicode in Python 2.
+        # We coerce them to native str type to match the types used in the rest
+        # of the code. This cannot fail because unicode can always be encoded
+        # with UTF-8.
+        full_path = ensure_str(path)
+        _, metadata_name = full_path.split("/", 1)
+
+        try:
+            metadata_text[metadata_name] = read_wheel_metadata_file(
+                wheel_zip, full_path
+            )
+        except UnsupportedWheel as e:
+            raise UnsupportedWheel(
+                "{} has an invalid wheel, {}".format(name, str(e))
+            )
+
+    metadata = WheelMetadata(metadata_text, location)
+
+    return DistInfoDistribution(
+        location=location, metadata=metadata, project_name=name
+    )
+
+
+def parse_wheel(wheel_zip, name):
+    # type: (ZipFile, str) -> Tuple[str, Message]
+    """Extract information from the provided wheel, ensuring it meets basic
+    standards.
+
+    Returns the name of the .dist-info directory and the parsed WHEEL metadata.
+    """
+    try:
+        info_dir = wheel_dist_info_dir(wheel_zip, name)
+        metadata = wheel_metadata(wheel_zip, info_dir)
+        version = wheel_version(metadata)
+    except UnsupportedWheel as e:
+        raise UnsupportedWheel(
+            "{} has an invalid wheel, {}".format(name, str(e))
+        )
+
+    check_compatibility(version, name)
+
+    return info_dir, metadata
+
+
+def wheel_dist_info_dir(source, name):
+    # type: (ZipFile, str) -> str
+    """Returns the name of the contained .dist-info directory.
+
+    Raises AssertionError or UnsupportedWheel if not found, >1 found, or
+    it doesn't match the provided name.
+    """
+    # Zip file path separators must be /
+    subdirs = set(p.split("/", 1)[0] for p in source.namelist())
+
+    info_dirs = [s for s in subdirs if s.endswith('.dist-info')]
+
+    if not info_dirs:
+        raise UnsupportedWheel(".dist-info directory not found")
+
+    if len(info_dirs) > 1:
+        raise UnsupportedWheel(
+            "multiple .dist-info directories found: {}".format(
+                ", ".join(info_dirs)
+            )
+        )
+
+    info_dir = info_dirs[0]
+
+    info_dir_name = canonicalize_name(info_dir)
+    canonical_name = canonicalize_name(name)
+    if not info_dir_name.startswith(canonical_name):
+        raise UnsupportedWheel(
+            ".dist-info directory {!r} does not start with {!r}".format(
+                info_dir, canonical_name
+            )
+        )
+
+    # Zip file paths can be unicode or str depending on the zip entry flags,
+    # so normalize it.
+    return ensure_str(info_dir)
+
+
+def read_wheel_metadata_file(source, path):
+    # type: (ZipFile, str) -> bytes
+    try:
+        return source.read(path)
+        # BadZipFile for general corruption, KeyError for missing entry,
+        # and RuntimeError for password-protected files
+    except (BadZipFile, KeyError, RuntimeError) as e:
+        raise UnsupportedWheel(
+            "could not read {!r} file: {!r}".format(path, e)
+        )
+
+
+def wheel_metadata(source, dist_info_dir):
+    # type: (ZipFile, str) -> Message
+    """Return the WHEEL metadata of an extracted wheel, if possible.
+    Otherwise, raise UnsupportedWheel.
+    """
+    path = "{}/WHEEL".format(dist_info_dir)
+    # Zip file path separators must be /
+    wheel_contents = read_wheel_metadata_file(source, path)
+
+    try:
+        wheel_text = ensure_str(wheel_contents)
+    except UnicodeDecodeError as e:
+        raise UnsupportedWheel("error decoding {!r}: {!r}".format(path, e))
+
+    # FeedParser (used by Parser) does not raise any exceptions. The returned
+    # message may have .defects populated, but for backwards-compatibility we
+    # currently ignore them.
+    return Parser().parsestr(wheel_text)
+
+
+def wheel_version(wheel_data):
+    # type: (Message) -> Tuple[int, ...]
+    """Given WHEEL metadata, return the parsed Wheel-Version.
+    Otherwise, raise UnsupportedWheel.
+    """
+    version_text = wheel_data["Wheel-Version"]
+    if version_text is None:
+        raise UnsupportedWheel("WHEEL is missing Wheel-Version")
+
+    version = version_text.strip()
+
+    try:
+        return tuple(map(int, version.split('.')))
+    except ValueError:
+        raise UnsupportedWheel("invalid Wheel-Version: {!r}".format(version))
+
+
+def check_compatibility(version, name):
+    # type: (Tuple[int, ...], str) -> None
+    """Raises errors or warns if called with an incompatible Wheel-Version.
+
+    pip should refuse to install a Wheel-Version that's a major series
+    ahead of what it's compatible with (e.g 2.0 > 1.1); and warn when
+    installing a version only minor version ahead (e.g 1.2 > 1.1).
+
+    version: a 2-tuple representing a Wheel-Version (Major, Minor)
+    name: name of wheel or package to raise exception about
+
+    :raises UnsupportedWheel: when an incompatible Wheel-Version is given
+    """
+    if version[0] > VERSION_COMPATIBLE[0]:
+        raise UnsupportedWheel(
+            "{}'s Wheel-Version ({}) is not compatible with this version "
+            "of pip".format(name, '.'.join(map(str, version)))
+        )
+    elif version > VERSION_COMPATIBLE:
+        logger.warning(
+            'Installing from a newer Wheel-Version (%s)',
+            '.'.join(map(str, version)),
+        )
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__init__.py b/venv/Lib/site-packages/pip/_internal/vcs/__init__.py
new file mode 100644
index 000000000..2a4eb1375
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/__init__.py
@@ -0,0 +1,15 @@
+# Expose a limited set of classes and functions so callers outside of
+# the vcs package don't need to import deeper than `pip._internal.vcs`.
+# (The test directory and imports protected by MYPY_CHECK_RUNNING may
+# still need to import from a vcs sub-package.)
+# Import all vcs modules to register each VCS in the VcsSupport object.
+import pip._internal.vcs.bazaar
+import pip._internal.vcs.git
+import pip._internal.vcs.mercurial
+import pip._internal.vcs.subversion  # noqa: F401
+from pip._internal.vcs.versioncontrol import (  # noqa: F401
+    RemoteNotFoundError,
+    is_url,
+    make_vcs_requirement_url,
+    vcs,
+)
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..e5565e3f9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/bazaar.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/bazaar.cpython-36.pyc
new file mode 100644
index 000000000..9595b6895
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/bazaar.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/git.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/git.cpython-36.pyc
new file mode 100644
index 000000000..faafe5e0b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/git.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/mercurial.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/mercurial.cpython-36.pyc
new file mode 100644
index 000000000..d05ce8e76
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/mercurial.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/subversion.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/subversion.cpython-36.pyc
new file mode 100644
index 000000000..a44bb93c0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/subversion.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/versioncontrol.cpython-36.pyc b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/versioncontrol.cpython-36.pyc
new file mode 100644
index 000000000..273d1ec7d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_internal/vcs/__pycache__/versioncontrol.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/bazaar.py b/venv/Lib/site-packages/pip/_internal/vcs/bazaar.py
new file mode 100644
index 000000000..94408c52f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/bazaar.py
@@ -0,0 +1,119 @@
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import os
+
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.utils.misc import display_path, rmtree
+from pip._internal.utils.subprocess import make_command
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url
+from pip._internal.vcs.versioncontrol import VersionControl, vcs
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Tuple
+    from pip._internal.utils.misc import HiddenText
+    from pip._internal.vcs.versioncontrol import AuthInfo, RevOptions
+
+
+logger = logging.getLogger(__name__)
+
+
+class Bazaar(VersionControl):
+    name = 'bzr'
+    dirname = '.bzr'
+    repo_name = 'branch'
+    schemes = (
+        'bzr', 'bzr+http', 'bzr+https', 'bzr+ssh', 'bzr+sftp', 'bzr+ftp',
+        'bzr+lp',
+    )
+
+    def __init__(self, *args, **kwargs):
+        super(Bazaar, self).__init__(*args, **kwargs)
+        # This is only needed for python <2.7.5
+        # Register lp but do not expose as a scheme to support bzr+lp.
+        if getattr(urllib_parse, 'uses_fragment', None):
+            urllib_parse.uses_fragment.extend(['lp'])
+
+    @staticmethod
+    def get_base_rev_args(rev):
+        return ['-r', rev]
+
+    def export(self, location, url):
+        # type: (str, HiddenText) -> None
+        """
+        Export the Bazaar repository at the url to the destination location
+        """
+        # Remove the location to make sure Bazaar can export it correctly
+        if os.path.exists(location):
+            rmtree(location)
+
+        url, rev_options = self.get_url_rev_options(url)
+        self.run_command(
+            make_command('export', location, url, rev_options.to_args())
+        )
+
+    def fetch_new(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        rev_display = rev_options.to_display()
+        logger.info(
+            'Checking out %s%s to %s',
+            url,
+            rev_display,
+            display_path(dest),
+        )
+        cmd_args = (
+            make_command('branch', '-q', rev_options.to_args(), url, dest)
+        )
+        self.run_command(cmd_args)
+
+    def switch(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        self.run_command(make_command('switch', url), cwd=dest)
+
+    def update(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        cmd_args = make_command('pull', '-q', rev_options.to_args())
+        self.run_command(cmd_args, cwd=dest)
+
+    @classmethod
+    def get_url_rev_and_auth(cls, url):
+        # type: (str) -> Tuple[str, Optional[str], AuthInfo]
+        # hotfix the URL scheme after removing bzr+ from bzr+ssh:// readd it
+        url, rev, user_pass = super(Bazaar, cls).get_url_rev_and_auth(url)
+        if url.startswith('ssh://'):
+            url = 'bzr+' + url
+        return url, rev, user_pass
+
+    @classmethod
+    def get_remote_url(cls, location):
+        urls = cls.run_command(['info'], cwd=location)
+        for line in urls.splitlines():
+            line = line.strip()
+            for x in ('checkout of branch: ',
+                      'parent branch: '):
+                if line.startswith(x):
+                    repo = line.split(x)[1]
+                    if cls._is_local_repository(repo):
+                        return path_to_url(repo)
+                    return repo
+        return None
+
+    @classmethod
+    def get_revision(cls, location):
+        revision = cls.run_command(
+            ['revno'], cwd=location,
+        )
+        return revision.splitlines()[-1]
+
+    @classmethod
+    def is_commit_id_equal(cls, dest, name):
+        """Always assume the versions don't match"""
+        return False
+
+
+vcs.register(Bazaar)
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/git.py b/venv/Lib/site-packages/pip/_internal/vcs/git.py
new file mode 100644
index 000000000..a9c7fb66e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/git.py
@@ -0,0 +1,397 @@
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import os.path
+import re
+
+from pip._vendor.packaging.version import parse as parse_version
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+from pip._vendor.six.moves.urllib import request as urllib_request
+
+from pip._internal.exceptions import BadCommand, SubProcessError
+from pip._internal.utils.misc import display_path, hide_url
+from pip._internal.utils.subprocess import make_command
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.vcs.versioncontrol import (
+    RemoteNotFoundError,
+    VersionControl,
+    find_path_to_setup_from_repo_root,
+    vcs,
+)
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Tuple
+    from pip._internal.utils.misc import HiddenText
+    from pip._internal.vcs.versioncontrol import AuthInfo, RevOptions
+
+
+urlsplit = urllib_parse.urlsplit
+urlunsplit = urllib_parse.urlunsplit
+
+
+logger = logging.getLogger(__name__)
+
+
+HASH_REGEX = re.compile('^[a-fA-F0-9]{40}$')
+
+
+def looks_like_hash(sha):
+    return bool(HASH_REGEX.match(sha))
+
+
+class Git(VersionControl):
+    name = 'git'
+    dirname = '.git'
+    repo_name = 'clone'
+    schemes = (
+        'git', 'git+http', 'git+https', 'git+ssh', 'git+git', 'git+file',
+    )
+    # Prevent the user's environment variables from interfering with pip:
+    # https://github.com/pypa/pip/issues/1130
+    unset_environ = ('GIT_DIR', 'GIT_WORK_TREE')
+    default_arg_rev = 'HEAD'
+
+    @staticmethod
+    def get_base_rev_args(rev):
+        return [rev]
+
+    def is_immutable_rev_checkout(self, url, dest):
+        # type: (str, str) -> bool
+        _, rev_options = self.get_url_rev_options(hide_url(url))
+        if not rev_options.rev:
+            return False
+        if not self.is_commit_id_equal(dest, rev_options.rev):
+            # the current commit is different from rev,
+            # which means rev was something else than a commit hash
+            return False
+        # return False in the rare case rev is both a commit hash
+        # and a tag or a branch; we don't want to cache in that case
+        # because that branch/tag could point to something else in the future
+        is_tag_or_branch = bool(
+            self.get_revision_sha(dest, rev_options.rev)[0]
+        )
+        return not is_tag_or_branch
+
+    def get_git_version(self):
+        VERSION_PFX = 'git version '
+        version = self.run_command(['version'])
+        if version.startswith(VERSION_PFX):
+            version = version[len(VERSION_PFX):].split()[0]
+        else:
+            version = ''
+        # get first 3 positions of the git version because
+        # on windows it is x.y.z.windows.t, and this parses as
+        # LegacyVersion which always smaller than a Version.
+        version = '.'.join(version.split('.')[:3])
+        return parse_version(version)
+
+    @classmethod
+    def get_current_branch(cls, location):
+        """
+        Return the current branch, or None if HEAD isn't at a branch
+        (e.g. detached HEAD).
+        """
+        # git-symbolic-ref exits with empty stdout if "HEAD" is a detached
+        # HEAD rather than a symbolic ref.  In addition, the -q causes the
+        # command to exit with status code 1 instead of 128 in this case
+        # and to suppress the message to stderr.
+        args = ['symbolic-ref', '-q', 'HEAD']
+        output = cls.run_command(
+            args, extra_ok_returncodes=(1, ), cwd=location,
+        )
+        ref = output.strip()
+
+        if ref.startswith('refs/heads/'):
+            return ref[len('refs/heads/'):]
+
+        return None
+
+    def export(self, location, url):
+        # type: (str, HiddenText) -> None
+        """Export the Git repository at the url to the destination location"""
+        if not location.endswith('/'):
+            location = location + '/'
+
+        with TempDirectory(kind="export") as temp_dir:
+            self.unpack(temp_dir.path, url=url)
+            self.run_command(
+                ['checkout-index', '-a', '-f', '--prefix', location],
+                cwd=temp_dir.path
+            )
+
+    @classmethod
+    def get_revision_sha(cls, dest, rev):
+        """
+        Return (sha_or_none, is_branch), where sha_or_none is a commit hash
+        if the revision names a remote branch or tag, otherwise None.
+
+        Args:
+          dest: the repository directory.
+          rev: the revision name.
+        """
+        # Pass rev to pre-filter the list.
+
+        output = ''
+        try:
+            output = cls.run_command(['show-ref', rev], cwd=dest)
+        except SubProcessError:
+            pass
+
+        refs = {}
+        for line in output.strip().splitlines():
+            try:
+                sha, ref = line.split()
+            except ValueError:
+                # Include the offending line to simplify troubleshooting if
+                # this error ever occurs.
+                raise ValueError('unexpected show-ref line: {!r}'.format(line))
+
+            refs[ref] = sha
+
+        branch_ref = 'refs/remotes/origin/{}'.format(rev)
+        tag_ref = 'refs/tags/{}'.format(rev)
+
+        sha = refs.get(branch_ref)
+        if sha is not None:
+            return (sha, True)
+
+        sha = refs.get(tag_ref)
+
+        return (sha, False)
+
+    @classmethod
+    def resolve_revision(cls, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> RevOptions
+        """
+        Resolve a revision to a new RevOptions object with the SHA1 of the
+        branch, tag, or ref if found.
+
+        Args:
+          rev_options: a RevOptions object.
+        """
+        rev = rev_options.arg_rev
+        # The arg_rev property's implementation for Git ensures that the
+        # rev return value is always non-None.
+        assert rev is not None
+
+        sha, is_branch = cls.get_revision_sha(dest, rev)
+
+        if sha is not None:
+            rev_options = rev_options.make_new(sha)
+            rev_options.branch_name = rev if is_branch else None
+
+            return rev_options
+
+        # Do not show a warning for the common case of something that has
+        # the form of a Git commit hash.
+        if not looks_like_hash(rev):
+            logger.warning(
+                "Did not find branch or tag '%s', assuming revision or ref.",
+                rev,
+            )
+
+        if not rev.startswith('refs/'):
+            return rev_options
+
+        # If it looks like a ref, we have to fetch it explicitly.
+        cls.run_command(
+            make_command('fetch', '-q', url, rev_options.to_args()),
+            cwd=dest,
+        )
+        # Change the revision to the SHA of the ref we fetched
+        sha = cls.get_revision(dest, rev='FETCH_HEAD')
+        rev_options = rev_options.make_new(sha)
+
+        return rev_options
+
+    @classmethod
+    def is_commit_id_equal(cls, dest, name):
+        """
+        Return whether the current commit hash equals the given name.
+
+        Args:
+          dest: the repository directory.
+          name: a string name.
+        """
+        if not name:
+            # Then avoid an unnecessary subprocess call.
+            return False
+
+        return cls.get_revision(dest) == name
+
+    def fetch_new(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        rev_display = rev_options.to_display()
+        logger.info('Cloning %s%s to %s', url, rev_display, display_path(dest))
+        self.run_command(make_command('clone', '-q', url, dest))
+
+        if rev_options.rev:
+            # Then a specific revision was requested.
+            rev_options = self.resolve_revision(dest, url, rev_options)
+            branch_name = getattr(rev_options, 'branch_name', None)
+            if branch_name is None:
+                # Only do a checkout if the current commit id doesn't match
+                # the requested revision.
+                if not self.is_commit_id_equal(dest, rev_options.rev):
+                    cmd_args = make_command(
+                        'checkout', '-q', rev_options.to_args(),
+                    )
+                    self.run_command(cmd_args, cwd=dest)
+            elif self.get_current_branch(dest) != branch_name:
+                # Then a specific branch was requested, and that branch
+                # is not yet checked out.
+                track_branch = 'origin/{}'.format(branch_name)
+                cmd_args = [
+                    'checkout', '-b', branch_name, '--track', track_branch,
+                ]
+                self.run_command(cmd_args, cwd=dest)
+
+        #: repo may contain submodules
+        self.update_submodules(dest)
+
+    def switch(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        self.run_command(
+            make_command('config', 'remote.origin.url', url),
+            cwd=dest,
+        )
+        cmd_args = make_command('checkout', '-q', rev_options.to_args())
+        self.run_command(cmd_args, cwd=dest)
+
+        self.update_submodules(dest)
+
+    def update(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        # First fetch changes from the default remote
+        if self.get_git_version() >= parse_version('1.9.0'):
+            # fetch tags in addition to everything else
+            self.run_command(['fetch', '-q', '--tags'], cwd=dest)
+        else:
+            self.run_command(['fetch', '-q'], cwd=dest)
+        # Then reset to wanted revision (maybe even origin/master)
+        rev_options = self.resolve_revision(dest, url, rev_options)
+        cmd_args = make_command('reset', '--hard', '-q', rev_options.to_args())
+        self.run_command(cmd_args, cwd=dest)
+        #: update submodules
+        self.update_submodules(dest)
+
+    @classmethod
+    def get_remote_url(cls, location):
+        """
+        Return URL of the first remote encountered.
+
+        Raises RemoteNotFoundError if the repository does not have a remote
+        url configured.
+        """
+        # We need to pass 1 for extra_ok_returncodes since the command
+        # exits with return code 1 if there are no matching lines.
+        stdout = cls.run_command(
+            ['config', '--get-regexp', r'remote\..*\.url'],
+            extra_ok_returncodes=(1, ), cwd=location,
+        )
+        remotes = stdout.splitlines()
+        try:
+            found_remote = remotes[0]
+        except IndexError:
+            raise RemoteNotFoundError
+
+        for remote in remotes:
+            if remote.startswith('remote.origin.url '):
+                found_remote = remote
+                break
+        url = found_remote.split(' ')[1]
+        return url.strip()
+
+    @classmethod
+    def get_revision(cls, location, rev=None):
+        if rev is None:
+            rev = 'HEAD'
+        current_rev = cls.run_command(
+            ['rev-parse', rev], cwd=location,
+        )
+        return current_rev.strip()
+
+    @classmethod
+    def get_subdirectory(cls, location):
+        """
+        Return the path to setup.py, relative to the repo root.
+        Return None if setup.py is in the repo root.
+        """
+        # find the repo root
+        git_dir = cls.run_command(
+            ['rev-parse', '--git-dir'],
+            cwd=location).strip()
+        if not os.path.isabs(git_dir):
+            git_dir = os.path.join(location, git_dir)
+        repo_root = os.path.abspath(os.path.join(git_dir, '..'))
+        return find_path_to_setup_from_repo_root(location, repo_root)
+
+    @classmethod
+    def get_url_rev_and_auth(cls, url):
+        # type: (str) -> Tuple[str, Optional[str], AuthInfo]
+        """
+        Prefixes stub URLs like 'user@hostname:user/repo.git' with 'ssh://'.
+        That's required because although they use SSH they sometimes don't
+        work with a ssh:// scheme (e.g. GitHub). But we need a scheme for
+        parsing. Hence we remove it again afterwards and return it as a stub.
+        """
+        # Works around an apparent Git bug
+        # (see https://article.gmane.org/gmane.comp.version-control.git/146500)
+        scheme, netloc, path, query, fragment = urlsplit(url)
+        if scheme.endswith('file'):
+            initial_slashes = path[:-len(path.lstrip('/'))]
+            newpath = (
+                initial_slashes +
+                urllib_request.url2pathname(path)
+                .replace('\\', '/').lstrip('/')
+            )
+            url = urlunsplit((scheme, netloc, newpath, query, fragment))
+            after_plus = scheme.find('+') + 1
+            url = scheme[:after_plus] + urlunsplit(
+                (scheme[after_plus:], netloc, newpath, query, fragment),
+            )
+
+        if '://' not in url:
+            assert 'file:' not in url
+            url = url.replace('git+', 'git+ssh://')
+            url, rev, user_pass = super(Git, cls).get_url_rev_and_auth(url)
+            url = url.replace('ssh://', '')
+        else:
+            url, rev, user_pass = super(Git, cls).get_url_rev_and_auth(url)
+
+        return url, rev, user_pass
+
+    @classmethod
+    def update_submodules(cls, location):
+        if not os.path.exists(os.path.join(location, '.gitmodules')):
+            return
+        cls.run_command(
+            ['submodule', 'update', '--init', '--recursive', '-q'],
+            cwd=location,
+        )
+
+    @classmethod
+    def get_repository_root(cls, location):
+        loc = super(Git, cls).get_repository_root(location)
+        if loc:
+            return loc
+        try:
+            r = cls.run_command(
+                ['rev-parse', '--show-toplevel'],
+                cwd=location,
+                log_failed_cmd=False,
+            )
+        except BadCommand:
+            logger.debug("could not determine if %s is under git control "
+                         "because git is not available", location)
+            return None
+        except SubProcessError:
+            return None
+        return os.path.normpath(r.rstrip('\r\n'))
+
+
+vcs.register(Git)
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/mercurial.py b/venv/Lib/site-packages/pip/_internal/vcs/mercurial.py
new file mode 100644
index 000000000..69763feae
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/mercurial.py
@@ -0,0 +1,158 @@
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import os
+
+from pip._vendor.six.moves import configparser
+
+from pip._internal.exceptions import BadCommand, SubProcessError
+from pip._internal.utils.misc import display_path
+from pip._internal.utils.subprocess import make_command
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url
+from pip._internal.vcs.versioncontrol import (
+    VersionControl,
+    find_path_to_setup_from_repo_root,
+    vcs,
+)
+
+if MYPY_CHECK_RUNNING:
+    from pip._internal.utils.misc import HiddenText
+    from pip._internal.vcs.versioncontrol import RevOptions
+
+
+logger = logging.getLogger(__name__)
+
+
+class Mercurial(VersionControl):
+    name = 'hg'
+    dirname = '.hg'
+    repo_name = 'clone'
+    schemes = (
+        'hg', 'hg+file', 'hg+http', 'hg+https', 'hg+ssh', 'hg+static-http',
+    )
+
+    @staticmethod
+    def get_base_rev_args(rev):
+        return [rev]
+
+    def export(self, location, url):
+        # type: (str, HiddenText) -> None
+        """Export the Hg repository at the url to the destination location"""
+        with TempDirectory(kind="export") as temp_dir:
+            self.unpack(temp_dir.path, url=url)
+
+            self.run_command(
+                ['archive', location], cwd=temp_dir.path
+            )
+
+    def fetch_new(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        rev_display = rev_options.to_display()
+        logger.info(
+            'Cloning hg %s%s to %s',
+            url,
+            rev_display,
+            display_path(dest),
+        )
+        self.run_command(make_command('clone', '--noupdate', '-q', url, dest))
+        self.run_command(
+            make_command('update', '-q', rev_options.to_args()),
+            cwd=dest,
+        )
+
+    def switch(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        repo_config = os.path.join(dest, self.dirname, 'hgrc')
+        config = configparser.RawConfigParser()
+        try:
+            config.read(repo_config)
+            config.set('paths', 'default', url.secret)
+            with open(repo_config, 'w') as config_file:
+                config.write(config_file)
+        except (OSError, configparser.NoSectionError) as exc:
+            logger.warning(
+                'Could not switch Mercurial repository to %s: %s', url, exc,
+            )
+        else:
+            cmd_args = make_command('update', '-q', rev_options.to_args())
+            self.run_command(cmd_args, cwd=dest)
+
+    def update(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        self.run_command(['pull', '-q'], cwd=dest)
+        cmd_args = make_command('update', '-q', rev_options.to_args())
+        self.run_command(cmd_args, cwd=dest)
+
+    @classmethod
+    def get_remote_url(cls, location):
+        url = cls.run_command(
+            ['showconfig', 'paths.default'],
+            cwd=location).strip()
+        if cls._is_local_repository(url):
+            url = path_to_url(url)
+        return url.strip()
+
+    @classmethod
+    def get_revision(cls, location):
+        """
+        Return the repository-local changeset revision number, as an integer.
+        """
+        current_revision = cls.run_command(
+            ['parents', '--template={rev}'], cwd=location).strip()
+        return current_revision
+
+    @classmethod
+    def get_requirement_revision(cls, location):
+        """
+        Return the changeset identification hash, as a 40-character
+        hexadecimal string
+        """
+        current_rev_hash = cls.run_command(
+            ['parents', '--template={node}'],
+            cwd=location).strip()
+        return current_rev_hash
+
+    @classmethod
+    def is_commit_id_equal(cls, dest, name):
+        """Always assume the versions don't match"""
+        return False
+
+    @classmethod
+    def get_subdirectory(cls, location):
+        """
+        Return the path to setup.py, relative to the repo root.
+        Return None if setup.py is in the repo root.
+        """
+        # find the repo root
+        repo_root = cls.run_command(
+            ['root'], cwd=location).strip()
+        if not os.path.isabs(repo_root):
+            repo_root = os.path.abspath(os.path.join(location, repo_root))
+        return find_path_to_setup_from_repo_root(location, repo_root)
+
+    @classmethod
+    def get_repository_root(cls, location):
+        loc = super(Mercurial, cls).get_repository_root(location)
+        if loc:
+            return loc
+        try:
+            r = cls.run_command(
+                ['root'],
+                cwd=location,
+                log_failed_cmd=False,
+            )
+        except BadCommand:
+            logger.debug("could not determine if %s is under hg control "
+                         "because hg is not available", location)
+            return None
+        except SubProcessError:
+            return None
+        return os.path.normpath(r.rstrip('\r\n'))
+
+
+vcs.register(Mercurial)
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/subversion.py b/venv/Lib/site-packages/pip/_internal/vcs/subversion.py
new file mode 100644
index 000000000..ab134970b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/subversion.py
@@ -0,0 +1,336 @@
+# The following comment should be removed at some point in the future.
+# mypy: disallow-untyped-defs=False
+
+from __future__ import absolute_import
+
+import logging
+import os
+import re
+
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import (
+    display_path,
+    is_console_interactive,
+    rmtree,
+    split_auth_from_netloc,
+)
+from pip._internal.utils.subprocess import make_command
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.vcs.versioncontrol import VersionControl, vcs
+
+_svn_xml_url_re = re.compile('url="([^"]+)"')
+_svn_rev_re = re.compile(r'committed-rev="(\d+)"')
+_svn_info_xml_rev_re = re.compile(r'\s*revision="(\d+)"')
+_svn_info_xml_url_re = re.compile(r'<url>(.*)</url>')
+
+
+if MYPY_CHECK_RUNNING:
+    from typing import Optional, Tuple
+    from pip._internal.utils.subprocess import CommandArgs
+    from pip._internal.utils.misc import HiddenText
+    from pip._internal.vcs.versioncontrol import AuthInfo, RevOptions
+
+
+logger = logging.getLogger(__name__)
+
+
+class Subversion(VersionControl):
+    name = 'svn'
+    dirname = '.svn'
+    repo_name = 'checkout'
+    schemes = ('svn', 'svn+ssh', 'svn+http', 'svn+https', 'svn+svn')
+
+    @classmethod
+    def should_add_vcs_url_prefix(cls, remote_url):
+        return True
+
+    @staticmethod
+    def get_base_rev_args(rev):
+        return ['-r', rev]
+
+    @classmethod
+    def get_revision(cls, location):
+        """
+        Return the maximum revision for all files under a given location
+        """
+        # Note: taken from setuptools.command.egg_info
+        revision = 0
+
+        for base, dirs, _ in os.walk(location):
+            if cls.dirname not in dirs:
+                dirs[:] = []
+                continue    # no sense walking uncontrolled subdirs
+            dirs.remove(cls.dirname)
+            entries_fn = os.path.join(base, cls.dirname, 'entries')
+            if not os.path.exists(entries_fn):
+                # FIXME: should we warn?
+                continue
+
+            dirurl, localrev = cls._get_svn_url_rev(base)
+
+            if base == location:
+                base = dirurl + '/'   # save the root url
+            elif not dirurl or not dirurl.startswith(base):
+                dirs[:] = []
+                continue    # not part of the same svn tree, skip it
+            revision = max(revision, localrev)
+        return revision
+
+    @classmethod
+    def get_netloc_and_auth(cls, netloc, scheme):
+        """
+        This override allows the auth information to be passed to svn via the
+        --username and --password options instead of via the URL.
+        """
+        if scheme == 'ssh':
+            # The --username and --password options can't be used for
+            # svn+ssh URLs, so keep the auth information in the URL.
+            return super(Subversion, cls).get_netloc_and_auth(netloc, scheme)
+
+        return split_auth_from_netloc(netloc)
+
+    @classmethod
+    def get_url_rev_and_auth(cls, url):
+        # type: (str) -> Tuple[str, Optional[str], AuthInfo]
+        # hotfix the URL scheme after removing svn+ from svn+ssh:// readd it
+        url, rev, user_pass = super(Subversion, cls).get_url_rev_and_auth(url)
+        if url.startswith('ssh://'):
+            url = 'svn+' + url
+        return url, rev, user_pass
+
+    @staticmethod
+    def make_rev_args(username, password):
+        # type: (Optional[str], Optional[HiddenText]) -> CommandArgs
+        extra_args = []  # type: CommandArgs
+        if username:
+            extra_args += ['--username', username]
+        if password:
+            extra_args += ['--password', password]
+
+        return extra_args
+
+    @classmethod
+    def get_remote_url(cls, location):
+        # In cases where the source is in a subdirectory, not alongside
+        # setup.py we have to look up in the location until we find a real
+        # setup.py
+        orig_location = location
+        while not os.path.exists(os.path.join(location, 'setup.py')):
+            last_location = location
+            location = os.path.dirname(location)
+            if location == last_location:
+                # We've traversed up to the root of the filesystem without
+                # finding setup.py
+                logger.warning(
+                    "Could not find setup.py for directory %s (tried all "
+                    "parent directories)",
+                    orig_location,
+                )
+                return None
+
+        return cls._get_svn_url_rev(location)[0]
+
+    @classmethod
+    def _get_svn_url_rev(cls, location):
+        from pip._internal.exceptions import SubProcessError
+
+        entries_path = os.path.join(location, cls.dirname, 'entries')
+        if os.path.exists(entries_path):
+            with open(entries_path) as f:
+                data = f.read()
+        else:  # subversion >= 1.7 does not have the 'entries' file
+            data = ''
+
+        if (data.startswith('8') or
+                data.startswith('9') or
+                data.startswith('10')):
+            data = list(map(str.splitlines, data.split('\n\x0c\n')))
+            del data[0][0]  # get rid of the '8'
+            url = data[0][3]
+            revs = [int(d[9]) for d in data if len(d) > 9 and d[9]] + [0]
+        elif data.startswith('<?xml'):
+            match = _svn_xml_url_re.search(data)
+            if not match:
+                raise ValueError(
+                    'Badly formatted data: {data!r}'.format(**locals()))
+            url = match.group(1)    # get repository URL
+            revs = [int(m.group(1)) for m in _svn_rev_re.finditer(data)] + [0]
+        else:
+            try:
+                # subversion >= 1.7
+                # Note that using get_remote_call_options is not necessary here
+                # because `svn info` is being run against a local directory.
+                # We don't need to worry about making sure interactive mode
+                # is being used to prompt for passwords, because passwords
+                # are only potentially needed for remote server requests.
+                xml = cls.run_command(
+                    ['info', '--xml', location],
+                )
+                url = _svn_info_xml_url_re.search(xml).group(1)
+                revs = [
+                    int(m.group(1)) for m in _svn_info_xml_rev_re.finditer(xml)
+                ]
+            except SubProcessError:
+                url, revs = None, []
+
+        if revs:
+            rev = max(revs)
+        else:
+            rev = 0
+
+        return url, rev
+
+    @classmethod
+    def is_commit_id_equal(cls, dest, name):
+        """Always assume the versions don't match"""
+        return False
+
+    def __init__(self, use_interactive=None):
+        # type: (bool) -> None
+        if use_interactive is None:
+            use_interactive = is_console_interactive()
+        self.use_interactive = use_interactive
+
+        # This member is used to cache the fetched version of the current
+        # ``svn`` client.
+        # Special value definitions:
+        #   None: Not evaluated yet.
+        #   Empty tuple: Could not parse version.
+        self._vcs_version = None  # type: Optional[Tuple[int, ...]]
+
+        super(Subversion, self).__init__()
+
+    def call_vcs_version(self):
+        # type: () -> Tuple[int, ...]
+        """Query the version of the currently installed Subversion client.
+
+        :return: A tuple containing the parts of the version information or
+            ``()`` if the version returned from ``svn`` could not be parsed.
+        :raises: BadCommand: If ``svn`` is not installed.
+        """
+        # Example versions:
+        #   svn, version 1.10.3 (r1842928)
+        #      compiled Feb 25 2019, 14:20:39 on x86_64-apple-darwin17.0.0
+        #   svn, version 1.7.14 (r1542130)
+        #      compiled Mar 28 2018, 08:49:13 on x86_64-pc-linux-gnu
+        #   svn, version 1.12.0-SlikSvn (SlikSvn/1.12.0)
+        #      compiled May 28 2019, 13:44:56 on x86_64-microsoft-windows6.2
+        version_prefix = 'svn, version '
+        version = self.run_command(['--version'])
+
+        if not version.startswith(version_prefix):
+            return ()
+
+        version = version[len(version_prefix):].split()[0]
+        version_list = version.partition('-')[0].split('.')
+        try:
+            parsed_version = tuple(map(int, version_list))
+        except ValueError:
+            return ()
+
+        return parsed_version
+
+    def get_vcs_version(self):
+        # type: () -> Tuple[int, ...]
+        """Return the version of the currently installed Subversion client.
+
+        If the version of the Subversion client has already been queried,
+        a cached value will be used.
+
+        :return: A tuple containing the parts of the version information or
+            ``()`` if the version returned from ``svn`` could not be parsed.
+        :raises: BadCommand: If ``svn`` is not installed.
+        """
+        if self._vcs_version is not None:
+            # Use cached version, if available.
+            # If parsing the version failed previously (empty tuple),
+            # do not attempt to parse it again.
+            return self._vcs_version
+
+        vcs_version = self.call_vcs_version()
+        self._vcs_version = vcs_version
+        return vcs_version
+
+    def get_remote_call_options(self):
+        # type: () -> CommandArgs
+        """Return options to be used on calls to Subversion that contact the server.
+
+        These options are applicable for the following ``svn`` subcommands used
+        in this class.
+
+            - checkout
+            - export
+            - switch
+            - update
+
+        :return: A list of command line arguments to pass to ``svn``.
+        """
+        if not self.use_interactive:
+            # --non-interactive switch is available since Subversion 0.14.4.
+            # Subversion < 1.8 runs in interactive mode by default.
+            return ['--non-interactive']
+
+        svn_version = self.get_vcs_version()
+        # By default, Subversion >= 1.8 runs in non-interactive mode if
+        # stdin is not a TTY. Since that is how pip invokes SVN, in
+        # call_subprocess(), pip must pass --force-interactive to ensure
+        # the user can be prompted for a password, if required.
+        #   SVN added the --force-interactive option in SVN 1.8. Since
+        # e.g. RHEL/CentOS 7, which is supported until 2024, ships with
+        # SVN 1.7, pip should continue to support SVN 1.7. Therefore, pip
+        # can't safely add the option if the SVN version is < 1.8 (or unknown).
+        if svn_version >= (1, 8):
+            return ['--force-interactive']
+
+        return []
+
+    def export(self, location, url):
+        # type: (str, HiddenText) -> None
+        """Export the svn repository at the url to the destination location"""
+        url, rev_options = self.get_url_rev_options(url)
+
+        logger.info('Exporting svn repository %s to %s', url, location)
+        with indent_log():
+            if os.path.exists(location):
+                # Subversion doesn't like to check out over an existing
+                # directory --force fixes this, but was only added in svn 1.5
+                rmtree(location)
+            cmd_args = make_command(
+                'export', self.get_remote_call_options(),
+                rev_options.to_args(), url, location,
+            )
+            self.run_command(cmd_args)
+
+    def fetch_new(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        rev_display = rev_options.to_display()
+        logger.info(
+            'Checking out %s%s to %s',
+            url,
+            rev_display,
+            display_path(dest),
+        )
+        cmd_args = make_command(
+            'checkout', '-q', self.get_remote_call_options(),
+            rev_options.to_args(), url, dest,
+        )
+        self.run_command(cmd_args)
+
+    def switch(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        cmd_args = make_command(
+            'switch', self.get_remote_call_options(), rev_options.to_args(),
+            url, dest,
+        )
+        self.run_command(cmd_args)
+
+    def update(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        cmd_args = make_command(
+            'update', self.get_remote_call_options(), rev_options.to_args(),
+            dest,
+        )
+        self.run_command(cmd_args)
+
+
+vcs.register(Subversion)
diff --git a/venv/Lib/site-packages/pip/_internal/vcs/versioncontrol.py b/venv/Lib/site-packages/pip/_internal/vcs/versioncontrol.py
new file mode 100644
index 000000000..96f830f99
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/vcs/versioncontrol.py
@@ -0,0 +1,811 @@
+"""Handles all VCS (version control) support"""
+
+from __future__ import absolute_import
+
+import errno
+import logging
+import os
+import shutil
+import subprocess
+import sys
+
+from pip._vendor import pkg_resources
+from pip._vendor.six.moves.urllib import parse as urllib_parse
+
+from pip._internal.exceptions import (
+    BadCommand,
+    InstallationError,
+    SubProcessError,
+)
+from pip._internal.utils.compat import console_to_str, samefile
+from pip._internal.utils.logging import subprocess_logger
+from pip._internal.utils.misc import (
+    ask_path_exists,
+    backup_dir,
+    display_path,
+    hide_url,
+    hide_value,
+    rmtree,
+)
+from pip._internal.utils.subprocess import (
+    format_command_args,
+    make_command,
+    make_subprocess_output_error,
+    reveal_command_args,
+)
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import get_url_scheme
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Dict, Iterable, Iterator, List, Optional, Text, Tuple,
+        Type, Union, Mapping, Any
+    )
+    from pip._internal.utils.misc import HiddenText
+    from pip._internal.utils.subprocess import CommandArgs
+
+    AuthInfo = Tuple[Optional[str], Optional[str]]
+
+
+__all__ = ['vcs']
+
+
+logger = logging.getLogger(__name__)
+
+
+def is_url(name):
+    # type: (Union[str, Text]) -> bool
+    """
+    Return true if the name looks like a URL.
+    """
+    scheme = get_url_scheme(name)
+    if scheme is None:
+        return False
+    return scheme in ['http', 'https', 'file', 'ftp'] + vcs.all_schemes
+
+
+def make_vcs_requirement_url(repo_url, rev, project_name, subdir=None):
+    # type: (str, str, str, Optional[str]) -> str
+    """
+    Return the URL for a VCS requirement.
+
+    Args:
+      repo_url: the remote VCS url, with any needed VCS prefix (e.g. "git+").
+      project_name: the (unescaped) project name.
+    """
+    egg_project_name = pkg_resources.to_filename(project_name)
+    req = '{}@{}#egg={}'.format(repo_url, rev, egg_project_name)
+    if subdir:
+        req += '&subdirectory={}'.format(subdir)
+
+    return req
+
+
+def call_subprocess(
+    cmd,  # type: Union[List[str], CommandArgs]
+    cwd=None,  # type: Optional[str]
+    extra_environ=None,  # type: Optional[Mapping[str, Any]]
+    extra_ok_returncodes=None,  # type: Optional[Iterable[int]]
+    log_failed_cmd=True  # type: Optional[bool]
+):
+    # type: (...) -> Text
+    """
+    Args:
+      extra_ok_returncodes: an iterable of integer return codes that are
+        acceptable, in addition to 0. Defaults to None, which means [].
+      log_failed_cmd: if false, failed commands are not logged,
+        only raised.
+    """
+    if extra_ok_returncodes is None:
+        extra_ok_returncodes = []
+
+    # log the subprocess output at DEBUG level.
+    log_subprocess = subprocess_logger.debug
+
+    env = os.environ.copy()
+    if extra_environ:
+        env.update(extra_environ)
+
+    # Whether the subprocess will be visible in the console.
+    showing_subprocess = True
+
+    command_desc = format_command_args(cmd)
+    try:
+        proc = subprocess.Popen(
+            # Convert HiddenText objects to the underlying str.
+            reveal_command_args(cmd),
+            stdout=subprocess.PIPE,
+            stderr=subprocess.PIPE,
+            cwd=cwd
+        )
+        if proc.stdin:
+            proc.stdin.close()
+    except Exception as exc:
+        if log_failed_cmd:
+            subprocess_logger.critical(
+                "Error %s while executing command %s", exc, command_desc,
+            )
+        raise
+    all_output = []
+    while True:
+        # The "line" value is a unicode string in Python 2.
+        line = None
+        if proc.stdout:
+            line = console_to_str(proc.stdout.readline())
+        if not line:
+            break
+        line = line.rstrip()
+        all_output.append(line + '\n')
+
+        # Show the line immediately.
+        log_subprocess(line)
+    try:
+        proc.wait()
+    finally:
+        if proc.stdout:
+            proc.stdout.close()
+
+    proc_had_error = (
+        proc.returncode and proc.returncode not in extra_ok_returncodes
+    )
+    if proc_had_error:
+        if not showing_subprocess and log_failed_cmd:
+            # Then the subprocess streams haven't been logged to the
+            # console yet.
+            msg = make_subprocess_output_error(
+                cmd_args=cmd,
+                cwd=cwd,
+                lines=all_output,
+                exit_status=proc.returncode,
+            )
+            subprocess_logger.error(msg)
+        exc_msg = (
+            'Command errored out with exit status {}: {} '
+            'Check the logs for full command output.'
+        ).format(proc.returncode, command_desc)
+        raise SubProcessError(exc_msg)
+    return ''.join(all_output)
+
+
+def find_path_to_setup_from_repo_root(location, repo_root):
+    # type: (str, str) -> Optional[str]
+    """
+    Find the path to `setup.py` by searching up the filesystem from `location`.
+    Return the path to `setup.py` relative to `repo_root`.
+    Return None if `setup.py` is in `repo_root` or cannot be found.
+    """
+    # find setup.py
+    orig_location = location
+    while not os.path.exists(os.path.join(location, 'setup.py')):
+        last_location = location
+        location = os.path.dirname(location)
+        if location == last_location:
+            # We've traversed up to the root of the filesystem without
+            # finding setup.py
+            logger.warning(
+                "Could not find setup.py for directory %s (tried all "
+                "parent directories)",
+                orig_location,
+            )
+            return None
+
+    if samefile(repo_root, location):
+        return None
+
+    return os.path.relpath(location, repo_root)
+
+
+class RemoteNotFoundError(Exception):
+    pass
+
+
+class RevOptions(object):
+
+    """
+    Encapsulates a VCS-specific revision to install, along with any VCS
+    install options.
+
+    Instances of this class should be treated as if immutable.
+    """
+
+    def __init__(
+        self,
+        vc_class,  # type: Type[VersionControl]
+        rev=None,  # type: Optional[str]
+        extra_args=None,  # type: Optional[CommandArgs]
+    ):
+        # type: (...) -> None
+        """
+        Args:
+          vc_class: a VersionControl subclass.
+          rev: the name of the revision to install.
+          extra_args: a list of extra options.
+        """
+        if extra_args is None:
+            extra_args = []
+
+        self.extra_args = extra_args
+        self.rev = rev
+        self.vc_class = vc_class
+        self.branch_name = None  # type: Optional[str]
+
+    def __repr__(self):
+        # type: () -> str
+        return '<RevOptions {}: rev={!r}>'.format(self.vc_class.name, self.rev)
+
+    @property
+    def arg_rev(self):
+        # type: () -> Optional[str]
+        if self.rev is None:
+            return self.vc_class.default_arg_rev
+
+        return self.rev
+
+    def to_args(self):
+        # type: () -> CommandArgs
+        """
+        Return the VCS-specific command arguments.
+        """
+        args = []  # type: CommandArgs
+        rev = self.arg_rev
+        if rev is not None:
+            args += self.vc_class.get_base_rev_args(rev)
+        args += self.extra_args
+
+        return args
+
+    def to_display(self):
+        # type: () -> str
+        if not self.rev:
+            return ''
+
+        return ' (to revision {})'.format(self.rev)
+
+    def make_new(self, rev):
+        # type: (str) -> RevOptions
+        """
+        Make a copy of the current instance, but with a new rev.
+
+        Args:
+          rev: the name of the revision for the new object.
+        """
+        return self.vc_class.make_rev_options(rev, extra_args=self.extra_args)
+
+
+class VcsSupport(object):
+    _registry = {}  # type: Dict[str, VersionControl]
+    schemes = ['ssh', 'git', 'hg', 'bzr', 'sftp', 'svn']
+
+    def __init__(self):
+        # type: () -> None
+        # Register more schemes with urlparse for various version control
+        # systems
+        urllib_parse.uses_netloc.extend(self.schemes)
+        # Python >= 2.7.4, 3.3 doesn't have uses_fragment
+        if getattr(urllib_parse, 'uses_fragment', None):
+            urllib_parse.uses_fragment.extend(self.schemes)
+        super(VcsSupport, self).__init__()
+
+    def __iter__(self):
+        # type: () -> Iterator[str]
+        return self._registry.__iter__()
+
+    @property
+    def backends(self):
+        # type: () -> List[VersionControl]
+        return list(self._registry.values())
+
+    @property
+    def dirnames(self):
+        # type: () -> List[str]
+        return [backend.dirname for backend in self.backends]
+
+    @property
+    def all_schemes(self):
+        # type: () -> List[str]
+        schemes = []  # type: List[str]
+        for backend in self.backends:
+            schemes.extend(backend.schemes)
+        return schemes
+
+    def register(self, cls):
+        # type: (Type[VersionControl]) -> None
+        if not hasattr(cls, 'name'):
+            logger.warning('Cannot register VCS %s', cls.__name__)
+            return
+        if cls.name not in self._registry:
+            self._registry[cls.name] = cls()
+            logger.debug('Registered VCS backend: %s', cls.name)
+
+    def unregister(self, name):
+        # type: (str) -> None
+        if name in self._registry:
+            del self._registry[name]
+
+    def get_backend_for_dir(self, location):
+        # type: (str) -> Optional[VersionControl]
+        """
+        Return a VersionControl object if a repository of that type is found
+        at the given directory.
+        """
+        vcs_backends = {}
+        for vcs_backend in self._registry.values():
+            repo_path = vcs_backend.get_repository_root(location)
+            if not repo_path:
+                continue
+            logger.debug('Determine that %s uses VCS: %s',
+                         location, vcs_backend.name)
+            vcs_backends[repo_path] = vcs_backend
+
+        if not vcs_backends:
+            return None
+
+        # Choose the VCS in the inner-most directory. Since all repository
+        # roots found here would be either `location` or one of its
+        # parents, the longest path should have the most path components,
+        # i.e. the backend representing the inner-most repository.
+        inner_most_repo_path = max(vcs_backends, key=len)
+        return vcs_backends[inner_most_repo_path]
+
+    def get_backend_for_scheme(self, scheme):
+        # type: (str) -> Optional[VersionControl]
+        """
+        Return a VersionControl object or None.
+        """
+        for vcs_backend in self._registry.values():
+            if scheme in vcs_backend.schemes:
+                return vcs_backend
+        return None
+
+    def get_backend(self, name):
+        # type: (str) -> Optional[VersionControl]
+        """
+        Return a VersionControl object or None.
+        """
+        name = name.lower()
+        return self._registry.get(name)
+
+
+vcs = VcsSupport()
+
+
+class VersionControl(object):
+    name = ''
+    dirname = ''
+    repo_name = ''
+    # List of supported schemes for this Version Control
+    schemes = ()  # type: Tuple[str, ...]
+    # Iterable of environment variable names to pass to call_subprocess().
+    unset_environ = ()  # type: Tuple[str, ...]
+    default_arg_rev = None  # type: Optional[str]
+
+    @classmethod
+    def should_add_vcs_url_prefix(cls, remote_url):
+        # type: (str) -> bool
+        """
+        Return whether the vcs prefix (e.g. "git+") should be added to a
+        repository's remote url when used in a requirement.
+        """
+        return not remote_url.lower().startswith('{}:'.format(cls.name))
+
+    @classmethod
+    def get_subdirectory(cls, location):
+        # type: (str) -> Optional[str]
+        """
+        Return the path to setup.py, relative to the repo root.
+        Return None if setup.py is in the repo root.
+        """
+        return None
+
+    @classmethod
+    def get_requirement_revision(cls, repo_dir):
+        # type: (str) -> str
+        """
+        Return the revision string that should be used in a requirement.
+        """
+        return cls.get_revision(repo_dir)
+
+    @classmethod
+    def get_src_requirement(cls, repo_dir, project_name):
+        # type: (str, str) -> Optional[str]
+        """
+        Return the requirement string to use to redownload the files
+        currently at the given repository directory.
+
+        Args:
+          project_name: the (unescaped) project name.
+
+        The return value has a form similar to the following:
+
+            {repository_url}@{revision}#egg={project_name}
+        """
+        repo_url = cls.get_remote_url(repo_dir)
+        if repo_url is None:
+            return None
+
+        if cls.should_add_vcs_url_prefix(repo_url):
+            repo_url = '{}+{}'.format(cls.name, repo_url)
+
+        revision = cls.get_requirement_revision(repo_dir)
+        subdir = cls.get_subdirectory(repo_dir)
+        req = make_vcs_requirement_url(repo_url, revision, project_name,
+                                       subdir=subdir)
+
+        return req
+
+    @staticmethod
+    def get_base_rev_args(rev):
+        # type: (str) -> List[str]
+        """
+        Return the base revision arguments for a vcs command.
+
+        Args:
+          rev: the name of a revision to install.  Cannot be None.
+        """
+        raise NotImplementedError
+
+    def is_immutable_rev_checkout(self, url, dest):
+        # type: (str, str) -> bool
+        """
+        Return true if the commit hash checked out at dest matches
+        the revision in url.
+
+        Always return False, if the VCS does not support immutable commit
+        hashes.
+
+        This method does not check if there are local uncommitted changes
+        in dest after checkout, as pip currently has no use case for that.
+        """
+        return False
+
+    @classmethod
+    def make_rev_options(cls, rev=None, extra_args=None):
+        # type: (Optional[str], Optional[CommandArgs]) -> RevOptions
+        """
+        Return a RevOptions object.
+
+        Args:
+          rev: the name of a revision to install.
+          extra_args: a list of extra options.
+        """
+        return RevOptions(cls, rev, extra_args=extra_args)
+
+    @classmethod
+    def _is_local_repository(cls, repo):
+        # type: (str) -> bool
+        """
+           posix absolute paths start with os.path.sep,
+           win32 ones start with drive (like c:\\folder)
+        """
+        drive, tail = os.path.splitdrive(repo)
+        return repo.startswith(os.path.sep) or bool(drive)
+
+    def export(self, location, url):
+        # type: (str, HiddenText) -> None
+        """
+        Export the repository at the url to the destination location
+        i.e. only download the files, without vcs informations
+
+        :param url: the repository URL starting with a vcs prefix.
+        """
+        raise NotImplementedError
+
+    @classmethod
+    def get_netloc_and_auth(cls, netloc, scheme):
+        # type: (str, str) -> Tuple[str, Tuple[Optional[str], Optional[str]]]
+        """
+        Parse the repository URL's netloc, and return the new netloc to use
+        along with auth information.
+
+        Args:
+          netloc: the original repository URL netloc.
+          scheme: the repository URL's scheme without the vcs prefix.
+
+        This is mainly for the Subversion class to override, so that auth
+        information can be provided via the --username and --password options
+        instead of through the URL.  For other subclasses like Git without
+        such an option, auth information must stay in the URL.
+
+        Returns: (netloc, (username, password)).
+        """
+        return netloc, (None, None)
+
+    @classmethod
+    def get_url_rev_and_auth(cls, url):
+        # type: (str) -> Tuple[str, Optional[str], AuthInfo]
+        """
+        Parse the repository URL to use, and return the URL, revision,
+        and auth info to use.
+
+        Returns: (url, rev, (username, password)).
+        """
+        scheme, netloc, path, query, frag = urllib_parse.urlsplit(url)
+        if '+' not in scheme:
+            raise ValueError(
+                "Sorry, {!r} is a malformed VCS url. "
+                "The format is <vcs>+<protocol>://<url>, "
+                "e.g. svn+http://myrepo/svn/MyApp#egg=MyApp".format(url)
+            )
+        # Remove the vcs prefix.
+        scheme = scheme.split('+', 1)[1]
+        netloc, user_pass = cls.get_netloc_and_auth(netloc, scheme)
+        rev = None
+        if '@' in path:
+            path, rev = path.rsplit('@', 1)
+            if not rev:
+                raise InstallationError(
+                    "The URL {!r} has an empty revision (after @) "
+                    "which is not supported. Include a revision after @ "
+                    "or remove @ from the URL.".format(url)
+                )
+        url = urllib_parse.urlunsplit((scheme, netloc, path, query, ''))
+        return url, rev, user_pass
+
+    @staticmethod
+    def make_rev_args(username, password):
+        # type: (Optional[str], Optional[HiddenText]) -> CommandArgs
+        """
+        Return the RevOptions "extra arguments" to use in obtain().
+        """
+        return []
+
+    def get_url_rev_options(self, url):
+        # type: (HiddenText) -> Tuple[HiddenText, RevOptions]
+        """
+        Return the URL and RevOptions object to use in obtain() and in
+        some cases export(), as a tuple (url, rev_options).
+        """
+        secret_url, rev, user_pass = self.get_url_rev_and_auth(url.secret)
+        username, secret_password = user_pass
+        password = None  # type: Optional[HiddenText]
+        if secret_password is not None:
+            password = hide_value(secret_password)
+        extra_args = self.make_rev_args(username, password)
+        rev_options = self.make_rev_options(rev, extra_args=extra_args)
+
+        return hide_url(secret_url), rev_options
+
+    @staticmethod
+    def normalize_url(url):
+        # type: (str) -> str
+        """
+        Normalize a URL for comparison by unquoting it and removing any
+        trailing slash.
+        """
+        return urllib_parse.unquote(url).rstrip('/')
+
+    @classmethod
+    def compare_urls(cls, url1, url2):
+        # type: (str, str) -> bool
+        """
+        Compare two repo URLs for identity, ignoring incidental differences.
+        """
+        return (cls.normalize_url(url1) == cls.normalize_url(url2))
+
+    def fetch_new(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        """
+        Fetch a revision from a repository, in the case that this is the
+        first fetch from the repository.
+
+        Args:
+          dest: the directory to fetch the repository to.
+          rev_options: a RevOptions object.
+        """
+        raise NotImplementedError
+
+    def switch(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        """
+        Switch the repo at ``dest`` to point to ``URL``.
+
+        Args:
+          rev_options: a RevOptions object.
+        """
+        raise NotImplementedError
+
+    def update(self, dest, url, rev_options):
+        # type: (str, HiddenText, RevOptions) -> None
+        """
+        Update an already-existing repo to the given ``rev_options``.
+
+        Args:
+          rev_options: a RevOptions object.
+        """
+        raise NotImplementedError
+
+    @classmethod
+    def is_commit_id_equal(cls, dest, name):
+        # type: (str, Optional[str]) -> bool
+        """
+        Return whether the id of the current commit equals the given name.
+
+        Args:
+          dest: the repository directory.
+          name: a string name.
+        """
+        raise NotImplementedError
+
+    def obtain(self, dest, url):
+        # type: (str, HiddenText) -> None
+        """
+        Install or update in editable mode the package represented by this
+        VersionControl object.
+
+        :param dest: the repository directory in which to install or update.
+        :param url: the repository URL starting with a vcs prefix.
+        """
+        url, rev_options = self.get_url_rev_options(url)
+
+        if not os.path.exists(dest):
+            self.fetch_new(dest, url, rev_options)
+            return
+
+        rev_display = rev_options.to_display()
+        if self.is_repository_directory(dest):
+            existing_url = self.get_remote_url(dest)
+            if self.compare_urls(existing_url, url.secret):
+                logger.debug(
+                    '%s in %s exists, and has correct URL (%s)',
+                    self.repo_name.title(),
+                    display_path(dest),
+                    url,
+                )
+                if not self.is_commit_id_equal(dest, rev_options.rev):
+                    logger.info(
+                        'Updating %s %s%s',
+                        display_path(dest),
+                        self.repo_name,
+                        rev_display,
+                    )
+                    self.update(dest, url, rev_options)
+                else:
+                    logger.info('Skipping because already up-to-date.')
+                return
+
+            logger.warning(
+                '%s %s in %s exists with URL %s',
+                self.name,
+                self.repo_name,
+                display_path(dest),
+                existing_url,
+            )
+            prompt = ('(s)witch, (i)gnore, (w)ipe, (b)ackup ',
+                      ('s', 'i', 'w', 'b'))
+        else:
+            logger.warning(
+                'Directory %s already exists, and is not a %s %s.',
+                dest,
+                self.name,
+                self.repo_name,
+            )
+            # https://github.com/python/mypy/issues/1174
+            prompt = ('(i)gnore, (w)ipe, (b)ackup ',  # type: ignore
+                      ('i', 'w', 'b'))
+
+        logger.warning(
+            'The plan is to install the %s repository %s',
+            self.name,
+            url,
+        )
+        response = ask_path_exists('What to do?  {}'.format(
+            prompt[0]), prompt[1])
+
+        if response == 'a':
+            sys.exit(-1)
+
+        if response == 'w':
+            logger.warning('Deleting %s', display_path(dest))
+            rmtree(dest)
+            self.fetch_new(dest, url, rev_options)
+            return
+
+        if response == 'b':
+            dest_dir = backup_dir(dest)
+            logger.warning(
+                'Backing up %s to %s', display_path(dest), dest_dir,
+            )
+            shutil.move(dest, dest_dir)
+            self.fetch_new(dest, url, rev_options)
+            return
+
+        # Do nothing if the response is "i".
+        if response == 's':
+            logger.info(
+                'Switching %s %s to %s%s',
+                self.repo_name,
+                display_path(dest),
+                url,
+                rev_display,
+            )
+            self.switch(dest, url, rev_options)
+
+    def unpack(self, location, url):
+        # type: (str, HiddenText) -> None
+        """
+        Clean up current location and download the url repository
+        (and vcs infos) into location
+
+        :param url: the repository URL starting with a vcs prefix.
+        """
+        if os.path.exists(location):
+            rmtree(location)
+        self.obtain(location, url=url)
+
+    @classmethod
+    def get_remote_url(cls, location):
+        # type: (str) -> str
+        """
+        Return the url used at location
+
+        Raises RemoteNotFoundError if the repository does not have a remote
+        url configured.
+        """
+        raise NotImplementedError
+
+    @classmethod
+    def get_revision(cls, location):
+        # type: (str) -> str
+        """
+        Return the current commit id of the files at the given location.
+        """
+        raise NotImplementedError
+
+    @classmethod
+    def run_command(
+        cls,
+        cmd,  # type: Union[List[str], CommandArgs]
+        cwd=None,  # type: Optional[str]
+        extra_environ=None,  # type: Optional[Mapping[str, Any]]
+        extra_ok_returncodes=None,  # type: Optional[Iterable[int]]
+        log_failed_cmd=True  # type: bool
+    ):
+        # type: (...) -> Text
+        """
+        Run a VCS subcommand
+        This is simply a wrapper around call_subprocess that adds the VCS
+        command name, and checks that the VCS is available
+        """
+        cmd = make_command(cls.name, *cmd)
+        try:
+            return call_subprocess(cmd, cwd,
+                                   extra_environ=extra_environ,
+                                   extra_ok_returncodes=extra_ok_returncodes,
+                                   log_failed_cmd=log_failed_cmd)
+        except OSError as e:
+            # errno.ENOENT = no such file or directory
+            # In other words, the VCS executable isn't available
+            if e.errno == errno.ENOENT:
+                raise BadCommand(
+                    'Cannot find command {cls.name!r} - do you have '
+                    '{cls.name!r} installed and in your '
+                    'PATH?'.format(**locals()))
+            else:
+                raise  # re-raise exception if a different error occurred
+
+    @classmethod
+    def is_repository_directory(cls, path):
+        # type: (str) -> bool
+        """
+        Return whether a directory path is a repository directory.
+        """
+        logger.debug('Checking in %s for %s (%s)...',
+                     path, cls.dirname, cls.name)
+        return os.path.exists(os.path.join(path, cls.dirname))
+
+    @classmethod
+    def get_repository_root(cls, location):
+        # type: (str) -> Optional[str]
+        """
+        Return the "root" (top-level) directory controlled by the vcs,
+        or `None` if the directory is not in any.
+
+        It is meant to be overridden to implement smarter detection
+        mechanisms for specific vcs.
+
+        This can do more than is_repository_directory() alone. For
+        example, the Git override checks that Git is actually available.
+        """
+        if cls.is_repository_directory(location):
+            return location
+        return None
diff --git a/venv/Lib/site-packages/pip/_internal/wheel_builder.py b/venv/Lib/site-packages/pip/_internal/wheel_builder.py
new file mode 100644
index 000000000..fa08016bd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_internal/wheel_builder.py
@@ -0,0 +1,308 @@
+"""Orchestrator for building wheels from InstallRequirements.
+"""
+
+import logging
+import os.path
+import re
+import shutil
+
+from pip._internal.models.link import Link
+from pip._internal.operations.build.wheel import build_wheel_pep517
+from pip._internal.operations.build.wheel_legacy import build_wheel_legacy
+from pip._internal.utils.logging import indent_log
+from pip._internal.utils.misc import ensure_dir, hash_file, is_wheel_installed
+from pip._internal.utils.setuptools_build import make_setuptools_clean_args
+from pip._internal.utils.subprocess import call_subprocess
+from pip._internal.utils.temp_dir import TempDirectory
+from pip._internal.utils.typing import MYPY_CHECK_RUNNING
+from pip._internal.utils.urls import path_to_url
+from pip._internal.vcs import vcs
+
+if MYPY_CHECK_RUNNING:
+    from typing import (
+        Any, Callable, Iterable, List, Optional, Tuple,
+    )
+
+    from pip._internal.cache import WheelCache
+    from pip._internal.req.req_install import InstallRequirement
+
+    BinaryAllowedPredicate = Callable[[InstallRequirement], bool]
+    BuildResult = Tuple[List[InstallRequirement], List[InstallRequirement]]
+
+logger = logging.getLogger(__name__)
+
+_egg_info_re = re.compile(r'([a-z0-9_.]+)-([a-z0-9_.!+-]+)', re.IGNORECASE)
+
+
+def _contains_egg_info(s):
+    # type: (str) -> bool
+    """Determine whether the string looks like an egg_info.
+
+    :param s: The string to parse. E.g. foo-2.1
+    """
+    return bool(_egg_info_re.search(s))
+
+
+def _should_build(
+    req,  # type: InstallRequirement
+    need_wheel,  # type: bool
+    check_binary_allowed,  # type: BinaryAllowedPredicate
+):
+    # type: (...) -> bool
+    """Return whether an InstallRequirement should be built into a wheel."""
+    if req.constraint:
+        # never build requirements that are merely constraints
+        return False
+    if req.is_wheel:
+        if need_wheel:
+            logger.info(
+                'Skipping %s, due to already being wheel.', req.name,
+            )
+        return False
+
+    if need_wheel:
+        # i.e. pip wheel, not pip install
+        return True
+
+    # From this point, this concerns the pip install command only
+    # (need_wheel=False).
+
+    if req.editable or not req.source_dir:
+        return False
+
+    if not check_binary_allowed(req):
+        logger.info(
+            "Skipping wheel build for %s, due to binaries "
+            "being disabled for it.", req.name,
+        )
+        return False
+
+    if not req.use_pep517 and not is_wheel_installed():
+        # we don't build legacy requirements if wheel is not installed
+        logger.info(
+            "Using legacy 'setup.py install' for %s, "
+            "since package 'wheel' is not installed.", req.name,
+        )
+        return False
+
+    return True
+
+
+def should_build_for_wheel_command(
+    req,  # type: InstallRequirement
+):
+    # type: (...) -> bool
+    return _should_build(
+        req, need_wheel=True, check_binary_allowed=_always_true
+    )
+
+
+def should_build_for_install_command(
+    req,  # type: InstallRequirement
+    check_binary_allowed,  # type: BinaryAllowedPredicate
+):
+    # type: (...) -> bool
+    return _should_build(
+        req, need_wheel=False, check_binary_allowed=check_binary_allowed
+    )
+
+
+def _should_cache(
+    req,  # type: InstallRequirement
+):
+    # type: (...) -> Optional[bool]
+    """
+    Return whether a built InstallRequirement can be stored in the persistent
+    wheel cache, assuming the wheel cache is available, and _should_build()
+    has determined a wheel needs to be built.
+    """
+    if req.editable or not req.source_dir:
+        # never cache editable requirements
+        return False
+
+    if req.link and req.link.is_vcs:
+        # VCS checkout. Do not cache
+        # unless it points to an immutable commit hash.
+        assert not req.editable
+        assert req.source_dir
+        vcs_backend = vcs.get_backend_for_scheme(req.link.scheme)
+        assert vcs_backend
+        if vcs_backend.is_immutable_rev_checkout(req.link.url, req.source_dir):
+            return True
+        return False
+
+    assert req.link
+    base, ext = req.link.splitext()
+    if _contains_egg_info(base):
+        return True
+
+    # Otherwise, do not cache.
+    return False
+
+
+def _get_cache_dir(
+    req,  # type: InstallRequirement
+    wheel_cache,  # type: WheelCache
+):
+    # type: (...) -> str
+    """Return the persistent or temporary cache directory where the built
+    wheel need to be stored.
+    """
+    cache_available = bool(wheel_cache.cache_dir)
+    assert req.link
+    if cache_available and _should_cache(req):
+        cache_dir = wheel_cache.get_path_for_link(req.link)
+    else:
+        cache_dir = wheel_cache.get_ephem_path_for_link(req.link)
+    return cache_dir
+
+
+def _always_true(_):
+    # type: (Any) -> bool
+    return True
+
+
+def _build_one(
+    req,  # type: InstallRequirement
+    output_dir,  # type: str
+    build_options,  # type: List[str]
+    global_options,  # type: List[str]
+):
+    # type: (...) -> Optional[str]
+    """Build one wheel.
+
+    :return: The filename of the built wheel, or None if the build failed.
+    """
+    try:
+        ensure_dir(output_dir)
+    except OSError as e:
+        logger.warning(
+            "Building wheel for %s failed: %s",
+            req.name, e,
+        )
+        return None
+
+    # Install build deps into temporary directory (PEP 518)
+    with req.build_env:
+        return _build_one_inside_env(
+            req, output_dir, build_options, global_options
+        )
+
+
+def _build_one_inside_env(
+    req,  # type: InstallRequirement
+    output_dir,  # type: str
+    build_options,  # type: List[str]
+    global_options,  # type: List[str]
+):
+    # type: (...) -> Optional[str]
+    with TempDirectory(kind="wheel") as temp_dir:
+        assert req.name
+        if req.use_pep517:
+            assert req.metadata_directory
+            wheel_path = build_wheel_pep517(
+                name=req.name,
+                backend=req.pep517_backend,
+                metadata_directory=req.metadata_directory,
+                build_options=build_options,
+                tempd=temp_dir.path,
+            )
+        else:
+            wheel_path = build_wheel_legacy(
+                name=req.name,
+                setup_py_path=req.setup_py_path,
+                source_dir=req.unpacked_source_directory,
+                global_options=global_options,
+                build_options=build_options,
+                tempd=temp_dir.path,
+            )
+
+        if wheel_path is not None:
+            wheel_name = os.path.basename(wheel_path)
+            dest_path = os.path.join(output_dir, wheel_name)
+            try:
+                wheel_hash, length = hash_file(wheel_path)
+                shutil.move(wheel_path, dest_path)
+                logger.info('Created wheel for %s: '
+                            'filename=%s size=%d sha256=%s',
+                            req.name, wheel_name, length,
+                            wheel_hash.hexdigest())
+                logger.info('Stored in directory: %s', output_dir)
+                return dest_path
+            except Exception as e:
+                logger.warning(
+                    "Building wheel for %s failed: %s",
+                    req.name, e,
+                )
+        # Ignore return, we can't do anything else useful.
+        if not req.use_pep517:
+            _clean_one_legacy(req, global_options)
+        return None
+
+
+def _clean_one_legacy(req, global_options):
+    # type: (InstallRequirement, List[str]) -> bool
+    clean_args = make_setuptools_clean_args(
+        req.setup_py_path,
+        global_options=global_options,
+    )
+
+    logger.info('Running setup.py clean for %s', req.name)
+    try:
+        call_subprocess(clean_args, cwd=req.source_dir)
+        return True
+    except Exception:
+        logger.error('Failed cleaning build dir for %s', req.name)
+        return False
+
+
+def build(
+    requirements,  # type: Iterable[InstallRequirement]
+    wheel_cache,  # type: WheelCache
+    build_options,  # type: List[str]
+    global_options,  # type: List[str]
+):
+    # type: (...) -> BuildResult
+    """Build wheels.
+
+    :return: The list of InstallRequirement that succeeded to build and
+        the list of InstallRequirement that failed to build.
+    """
+    if not requirements:
+        return [], []
+
+    # Build the wheels.
+    logger.info(
+        'Building wheels for collected packages: %s',
+        ', '.join(req.name for req in requirements),  # type: ignore
+    )
+
+    with indent_log():
+        build_successes, build_failures = [], []
+        for req in requirements:
+            cache_dir = _get_cache_dir(req, wheel_cache)
+            wheel_file = _build_one(
+                req, cache_dir, build_options, global_options
+            )
+            if wheel_file:
+                # Update the link for this.
+                req.link = Link(path_to_url(wheel_file))
+                req.local_file_path = req.link.file_path
+                assert req.link.is_wheel
+                build_successes.append(req)
+            else:
+                build_failures.append(req)
+
+    # notify success/failure
+    if build_successes:
+        logger.info(
+            'Successfully built %s',
+            ' '.join([req.name for req in build_successes]),  # type: ignore
+        )
+    if build_failures:
+        logger.info(
+            'Failed to build %s',
+            ' '.join([req.name for req in build_failures]),  # type: ignore
+        )
+    # Return a list of requirements that failed to build
+    return build_successes, build_failures
diff --git a/venv/Lib/site-packages/pip/_vendor/__init__.py b/venv/Lib/site-packages/pip/_vendor/__init__.py
new file mode 100644
index 000000000..581db54c8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/__init__.py
@@ -0,0 +1,110 @@
+"""
+pip._vendor is for vendoring dependencies of pip to prevent needing pip to
+depend on something external.
+
+Files inside of pip._vendor should be considered immutable and should only be
+updated to versions from upstream.
+"""
+from __future__ import absolute_import
+
+import glob
+import os.path
+import sys
+
+# Downstream redistributors which have debundled our dependencies should also
+# patch this value to be true. This will trigger the additional patching
+# to cause things like "six" to be available as pip.
+DEBUNDLED = False
+
+# By default, look in this directory for a bunch of .whl files which we will
+# add to the beginning of sys.path before attempting to import anything. This
+# is done to support downstream re-distributors like Debian and Fedora who
+# wish to create their own Wheels for our dependencies to aid in debundling.
+WHEEL_DIR = os.path.abspath(os.path.dirname(__file__))
+
+
+# Define a small helper function to alias our vendored modules to the real ones
+# if the vendored ones do not exist. This idea of this was taken from
+# https://github.com/kennethreitz/requests/pull/2567.
+def vendored(modulename):
+    vendored_name = "{0}.{1}".format(__name__, modulename)
+
+    try:
+        __import__(modulename, globals(), locals(), level=0)
+    except ImportError:
+        # This error used to be silenced in earlier variants of this file, to instead
+        # raise the error when pip actually tries to use the missing module. 
+        # Based on inputs in #5354, this was changed to explicitly raise the error.
+        # Re-raising the exception without modifying it is an intentional choice. 
+        raise
+    else:
+        sys.modules[vendored_name] = sys.modules[modulename]
+        base, head = vendored_name.rsplit(".", 1)
+        setattr(sys.modules[base], head, sys.modules[modulename])
+
+
+# If we're operating in a debundled setup, then we want to go ahead and trigger
+# the aliasing of our vendored libraries as well as looking for wheels to add
+# to our sys.path. This will cause all of this code to be a no-op typically
+# however downstream redistributors can enable it in a consistent way across
+# all platforms.
+if DEBUNDLED:
+    # Actually look inside of WHEEL_DIR to find .whl files and add them to the
+    # front of our sys.path.
+    sys.path[:] = glob.glob(os.path.join(WHEEL_DIR, "*.whl")) + sys.path
+
+    # Actually alias all of our vendored dependencies.
+    vendored("appdirs")
+    vendored("cachecontrol")
+    vendored("certifi")
+    vendored("colorama")
+    vendored("contextlib2")
+    vendored("distlib")
+    vendored("distro")
+    vendored("html5lib")
+    vendored("six")
+    vendored("six.moves")
+    vendored("six.moves.urllib")
+    vendored("six.moves.urllib.parse")
+    vendored("packaging")
+    vendored("packaging.version")
+    vendored("packaging.specifiers")
+    vendored("pep517")
+    vendored("pkg_resources")
+    vendored("progress")
+    vendored("retrying")
+    vendored("requests")
+    vendored("requests.exceptions")
+    vendored("requests.packages")
+    vendored("requests.packages.urllib3")
+    vendored("requests.packages.urllib3._collections")
+    vendored("requests.packages.urllib3.connection")
+    vendored("requests.packages.urllib3.connectionpool")
+    vendored("requests.packages.urllib3.contrib")
+    vendored("requests.packages.urllib3.contrib.ntlmpool")
+    vendored("requests.packages.urllib3.contrib.pyopenssl")
+    vendored("requests.packages.urllib3.exceptions")
+    vendored("requests.packages.urllib3.fields")
+    vendored("requests.packages.urllib3.filepost")
+    vendored("requests.packages.urllib3.packages")
+    vendored("requests.packages.urllib3.packages.ordered_dict")
+    vendored("requests.packages.urllib3.packages.six")
+    vendored("requests.packages.urllib3.packages.ssl_match_hostname")
+    vendored("requests.packages.urllib3.packages.ssl_match_hostname."
+             "_implementation")
+    vendored("requests.packages.urllib3.poolmanager")
+    vendored("requests.packages.urllib3.request")
+    vendored("requests.packages.urllib3.response")
+    vendored("requests.packages.urllib3.util")
+    vendored("requests.packages.urllib3.util.connection")
+    vendored("requests.packages.urllib3.util.request")
+    vendored("requests.packages.urllib3.util.response")
+    vendored("requests.packages.urllib3.util.retry")
+    vendored("requests.packages.urllib3.util.ssl_")
+    vendored("requests.packages.urllib3.util.timeout")
+    vendored("requests.packages.urllib3.util.url")
+    vendored("resolvelib")
+    vendored("toml")
+    vendored("toml.encoder")
+    vendored("toml.decoder")
+    vendored("urllib3")
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..5c07ef93d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/appdirs.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/appdirs.cpython-36.pyc
new file mode 100644
index 000000000..c0f39b255
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/appdirs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/contextlib2.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/contextlib2.cpython-36.pyc
new file mode 100644
index 000000000..3ddffd564
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/contextlib2.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/distro.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/distro.cpython-36.pyc
new file mode 100644
index 000000000..21dc930be
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/distro.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/ipaddress.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/ipaddress.cpython-36.pyc
new file mode 100644
index 000000000..2d8360964
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/ipaddress.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/pyparsing.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/pyparsing.cpython-36.pyc
new file mode 100644
index 000000000..0dcfda73c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/pyparsing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/retrying.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/retrying.cpython-36.pyc
new file mode 100644
index 000000000..e3229734b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/retrying.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/__pycache__/six.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/__pycache__/six.cpython-36.pyc
new file mode 100644
index 000000000..62ae0712b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/__pycache__/six.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/appdirs.py b/venv/Lib/site-packages/pip/_vendor/appdirs.py
new file mode 100644
index 000000000..33a3b7741
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/appdirs.py
@@ -0,0 +1,633 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+# Copyright (c) 2005-2010 ActiveState Software Inc.
+# Copyright (c) 2013 Eddy Petrișor
+
+"""Utilities for determining application-specific dirs.
+
+See <http://github.com/ActiveState/appdirs> for details and usage.
+"""
+# Dev Notes:
+# - MSDN on where to store app data files:
+#   http://support.microsoft.com/default.aspx?scid=kb;en-us;310294#XSLTH3194121123120121120120
+# - Mac OS X: http://developer.apple.com/documentation/MacOSX/Conceptual/BPFileSystem/index.html
+# - XDG spec for Un*x: http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html
+
+__version__ = "1.4.4"
+__version_info__ = tuple(int(segment) for segment in __version__.split("."))
+
+
+import sys
+import os
+
+PY3 = sys.version_info[0] == 3
+
+if PY3:
+    unicode = str
+
+if sys.platform.startswith('java'):
+    import platform
+    os_name = platform.java_ver()[3][0]
+    if os_name.startswith('Windows'): # "Windows XP", "Windows 7", etc.
+        system = 'win32'
+    elif os_name.startswith('Mac'): # "Mac OS X", etc.
+        system = 'darwin'
+    else: # "Linux", "SunOS", "FreeBSD", etc.
+        # Setting this to "linux2" is not ideal, but only Windows or Mac
+        # are actually checked for and the rest of the module expects
+        # *sys.platform* style strings.
+        system = 'linux2'
+elif sys.platform == 'cli' and os.name == 'nt':
+    # Detect Windows in IronPython to match pip._internal.utils.compat.WINDOWS
+    # Discussion: <https://github.com/pypa/pip/pull/7501>
+    system = 'win32'
+else:
+    system = sys.platform
+
+
+
+def user_data_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user data directories are:
+        Mac OS X:               ~/Library/Application Support/<AppName>  # or ~/.config/<AppName>, if the other does not exist
+        Unix:                   ~/.local/share/<AppName>    # or in $XDG_DATA_HOME, if defined
+        Win XP (not roaming):   C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
+        Win XP (roaming):       C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
+        Win 7  (not roaming):   C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
+        Win 7  (roaming):       C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
+
+    For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
+    That means, by default "~/.local/share/<AppName>".
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        const = roaming and "CSIDL_APPDATA" or "CSIDL_LOCAL_APPDATA"
+        path = os.path.normpath(_get_win_folder(const))
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+    elif system == 'darwin':
+        path = os.path.expanduser('~/Library/Application Support/')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        path = os.getenv('XDG_DATA_HOME', os.path.expanduser("~/.local/share"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def site_data_dir(appname=None, appauthor=None, version=None, multipath=False):
+    r"""Return full path to the user-shared data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "multipath" is an optional parameter only applicable to *nix
+            which indicates that the entire list of data dirs should be
+            returned. By default, the first item from XDG_DATA_DIRS is
+            returned, or '/usr/local/share/<AppName>',
+            if XDG_DATA_DIRS is not set
+
+    Typical site data directories are:
+        Mac OS X:   /Library/Application Support/<AppName>
+        Unix:       /usr/local/share/<AppName> or /usr/share/<AppName>
+        Win XP:     C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
+        Vista:      (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
+        Win 7:      C:\ProgramData\<AppAuthor>\<AppName>   # Hidden, but writeable on Win 7.
+
+    For Unix, this is using the $XDG_DATA_DIRS[0] default.
+
+    WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        path = os.path.normpath(_get_win_folder("CSIDL_COMMON_APPDATA"))
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+    elif system == 'darwin':
+        path = os.path.expanduser('/Library/Application Support')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        # XDG default for $XDG_DATA_DIRS
+        # only first, if multipath is False
+        path = os.getenv('XDG_DATA_DIRS',
+                         os.pathsep.join(['/usr/local/share', '/usr/share']))
+        pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep)]
+        if appname:
+            if version:
+                appname = os.path.join(appname, version)
+            pathlist = [os.path.join(x, appname) for x in pathlist]
+
+        if multipath:
+            path = os.pathsep.join(pathlist)
+        else:
+            path = pathlist[0]
+        return path
+
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_config_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific config dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user config directories are:
+        Mac OS X:               same as user_data_dir
+        Unix:                   ~/.config/<AppName>     # or in $XDG_CONFIG_HOME, if defined
+        Win *:                  same as user_data_dir
+
+    For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
+    That means, by default "~/.config/<AppName>".
+    """
+    if system in ["win32", "darwin"]:
+        path = user_data_dir(appname, appauthor, None, roaming)
+    else:
+        path = os.getenv('XDG_CONFIG_HOME', os.path.expanduser("~/.config"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+# for the discussion regarding site_config_dir locations
+# see <https://github.com/pypa/pip/issues/1733>
+def site_config_dir(appname=None, appauthor=None, version=None, multipath=False):
+    r"""Return full path to the user-shared data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "multipath" is an optional parameter only applicable to *nix
+            which indicates that the entire list of config dirs should be
+            returned. By default, the first item from XDG_CONFIG_DIRS is
+            returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
+
+    Typical site config directories are:
+        Mac OS X:   same as site_data_dir
+        Unix:       /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
+                    $XDG_CONFIG_DIRS
+        Win *:      same as site_data_dir
+        Vista:      (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
+
+    For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
+
+    WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
+    """
+    if system in ["win32", "darwin"]:
+        path = site_data_dir(appname, appauthor)
+        if appname and version:
+            path = os.path.join(path, version)
+    else:
+        # XDG default for $XDG_CONFIG_DIRS (missing or empty)
+        # see <https://github.com/pypa/pip/pull/7501#discussion_r360624829>
+        # only first, if multipath is False
+        path = os.getenv('XDG_CONFIG_DIRS') or '/etc/xdg'
+        pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep) if x]
+        if appname:
+            if version:
+                appname = os.path.join(appname, version)
+            pathlist = [os.path.join(x, appname) for x in pathlist]
+
+        if multipath:
+            path = os.pathsep.join(pathlist)
+        else:
+            path = pathlist[0]
+    return path
+
+
+def user_cache_dir(appname=None, appauthor=None, version=None, opinion=True):
+    r"""Return full path to the user-specific cache dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "opinion" (boolean) can be False to disable the appending of
+            "Cache" to the base app data dir for Windows. See
+            discussion below.
+
+    Typical user cache directories are:
+        Mac OS X:   ~/Library/Caches/<AppName>
+        Unix:       ~/.cache/<AppName> (XDG default)
+        Win XP:     C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
+        Vista:      C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
+
+    On Windows the only suggestion in the MSDN docs is that local settings go in
+    the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
+    app data dir (the default returned by `user_data_dir` above). Apps typically
+    put cache data somewhere *under* the given dir here. Some examples:
+        ...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
+        ...\Acme\SuperApp\Cache\1.0
+    OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
+    This can be disabled with the `opinion=False` option.
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        path = os.path.normpath(_get_win_folder("CSIDL_LOCAL_APPDATA"))
+        # When using Python 2, return paths as bytes on Windows like we do on
+        # other operating systems. See helper function docs for more details.
+        if not PY3 and isinstance(path, unicode):
+            path = _win_path_to_bytes(path)
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+            if opinion:
+                path = os.path.join(path, "Cache")
+    elif system == 'darwin':
+        path = os.path.expanduser('~/Library/Caches')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        path = os.getenv('XDG_CACHE_HOME', os.path.expanduser('~/.cache'))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_state_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific state dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user state directories are:
+        Mac OS X:  same as user_data_dir
+        Unix:      ~/.local/state/<AppName>   # or in $XDG_STATE_HOME, if defined
+        Win *:     same as user_data_dir
+
+    For Unix, we follow this Debian proposal <https://wiki.debian.org/XDGBaseDirectorySpecification#state>
+    to extend the XDG spec and support $XDG_STATE_HOME.
+
+    That means, by default "~/.local/state/<AppName>".
+    """
+    if system in ["win32", "darwin"]:
+        path = user_data_dir(appname, appauthor, None, roaming)
+    else:
+        path = os.getenv('XDG_STATE_HOME', os.path.expanduser("~/.local/state"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_log_dir(appname=None, appauthor=None, version=None, opinion=True):
+    r"""Return full path to the user-specific log dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "opinion" (boolean) can be False to disable the appending of
+            "Logs" to the base app data dir for Windows, and "log" to the
+            base cache dir for Unix. See discussion below.
+
+    Typical user log directories are:
+        Mac OS X:   ~/Library/Logs/<AppName>
+        Unix:       ~/.cache/<AppName>/log  # or under $XDG_CACHE_HOME if defined
+        Win XP:     C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
+        Vista:      C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
+
+    On Windows the only suggestion in the MSDN docs is that local settings
+    go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
+    examples of what some windows apps use for a logs dir.)
+
+    OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
+    value for Windows and appends "log" to the user cache dir for Unix.
+    This can be disabled with the `opinion=False` option.
+    """
+    if system == "darwin":
+        path = os.path.join(
+            os.path.expanduser('~/Library/Logs'),
+            appname)
+    elif system == "win32":
+        path = user_data_dir(appname, appauthor, version)
+        version = False
+        if opinion:
+            path = os.path.join(path, "Logs")
+    else:
+        path = user_cache_dir(appname, appauthor, version)
+        version = False
+        if opinion:
+            path = os.path.join(path, "log")
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+class AppDirs(object):
+    """Convenience wrapper for getting application dirs."""
+    def __init__(self, appname=None, appauthor=None, version=None,
+            roaming=False, multipath=False):
+        self.appname = appname
+        self.appauthor = appauthor
+        self.version = version
+        self.roaming = roaming
+        self.multipath = multipath
+
+    @property
+    def user_data_dir(self):
+        return user_data_dir(self.appname, self.appauthor,
+                             version=self.version, roaming=self.roaming)
+
+    @property
+    def site_data_dir(self):
+        return site_data_dir(self.appname, self.appauthor,
+                             version=self.version, multipath=self.multipath)
+
+    @property
+    def user_config_dir(self):
+        return user_config_dir(self.appname, self.appauthor,
+                               version=self.version, roaming=self.roaming)
+
+    @property
+    def site_config_dir(self):
+        return site_config_dir(self.appname, self.appauthor,
+                             version=self.version, multipath=self.multipath)
+
+    @property
+    def user_cache_dir(self):
+        return user_cache_dir(self.appname, self.appauthor,
+                              version=self.version)
+
+    @property
+    def user_state_dir(self):
+        return user_state_dir(self.appname, self.appauthor,
+                              version=self.version)
+
+    @property
+    def user_log_dir(self):
+        return user_log_dir(self.appname, self.appauthor,
+                            version=self.version)
+
+
+#---- internal support stuff
+
+def _get_win_folder_from_registry(csidl_name):
+    """This is a fallback technique at best. I'm not sure if using the
+    registry for this guarantees us the correct answer for all CSIDL_*
+    names.
+    """
+    if PY3:
+      import winreg as _winreg
+    else:
+      import _winreg
+
+    shell_folder_name = {
+        "CSIDL_APPDATA": "AppData",
+        "CSIDL_COMMON_APPDATA": "Common AppData",
+        "CSIDL_LOCAL_APPDATA": "Local AppData",
+    }[csidl_name]
+
+    key = _winreg.OpenKey(
+        _winreg.HKEY_CURRENT_USER,
+        r"Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders"
+    )
+    dir, type = _winreg.QueryValueEx(key, shell_folder_name)
+    return dir
+
+
+def _get_win_folder_with_pywin32(csidl_name):
+    from win32com.shell import shellcon, shell
+    dir = shell.SHGetFolderPath(0, getattr(shellcon, csidl_name), 0, 0)
+    # Try to make this a unicode path because SHGetFolderPath does
+    # not return unicode strings when there is unicode data in the
+    # path.
+    try:
+        dir = unicode(dir)
+
+        # Downgrade to short path name if have highbit chars. See
+        # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+        has_high_char = False
+        for c in dir:
+            if ord(c) > 255:
+                has_high_char = True
+                break
+        if has_high_char:
+            try:
+                import win32api
+                dir = win32api.GetShortPathName(dir)
+            except ImportError:
+                pass
+    except UnicodeError:
+        pass
+    return dir
+
+
+def _get_win_folder_with_ctypes(csidl_name):
+    import ctypes
+
+    csidl_const = {
+        "CSIDL_APPDATA": 26,
+        "CSIDL_COMMON_APPDATA": 35,
+        "CSIDL_LOCAL_APPDATA": 28,
+    }[csidl_name]
+
+    buf = ctypes.create_unicode_buffer(1024)
+    ctypes.windll.shell32.SHGetFolderPathW(None, csidl_const, None, 0, buf)
+
+    # Downgrade to short path name if have highbit chars. See
+    # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+    has_high_char = False
+    for c in buf:
+        if ord(c) > 255:
+            has_high_char = True
+            break
+    if has_high_char:
+        buf2 = ctypes.create_unicode_buffer(1024)
+        if ctypes.windll.kernel32.GetShortPathNameW(buf.value, buf2, 1024):
+            buf = buf2
+
+    return buf.value
+
+def _get_win_folder_with_jna(csidl_name):
+    import array
+    from com.sun import jna
+    from com.sun.jna.platform import win32
+
+    buf_size = win32.WinDef.MAX_PATH * 2
+    buf = array.zeros('c', buf_size)
+    shell = win32.Shell32.INSTANCE
+    shell.SHGetFolderPath(None, getattr(win32.ShlObj, csidl_name), None, win32.ShlObj.SHGFP_TYPE_CURRENT, buf)
+    dir = jna.Native.toString(buf.tostring()).rstrip("\0")
+
+    # Downgrade to short path name if have highbit chars. See
+    # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+    has_high_char = False
+    for c in dir:
+        if ord(c) > 255:
+            has_high_char = True
+            break
+    if has_high_char:
+        buf = array.zeros('c', buf_size)
+        kernel = win32.Kernel32.INSTANCE
+        if kernel.GetShortPathName(dir, buf, buf_size):
+            dir = jna.Native.toString(buf.tostring()).rstrip("\0")
+
+    return dir
+
+if system == "win32":
+    try:
+        from ctypes import windll
+        _get_win_folder = _get_win_folder_with_ctypes
+    except ImportError:
+        try:
+            import com.sun.jna
+            _get_win_folder = _get_win_folder_with_jna
+        except ImportError:
+            _get_win_folder = _get_win_folder_from_registry
+
+
+def _win_path_to_bytes(path):
+    """Encode Windows paths to bytes. Only used on Python 2.
+
+    Motivation is to be consistent with other operating systems where paths
+    are also returned as bytes. This avoids problems mixing bytes and Unicode
+    elsewhere in the codebase. For more details and discussion see
+    <https://github.com/pypa/pip/issues/3463>.
+
+    If encoding using ASCII and MBCS fails, return the original Unicode path.
+    """
+    for encoding in ('ASCII', 'MBCS'):
+        try:
+            return path.encode(encoding)
+        except (UnicodeEncodeError, LookupError):
+            pass
+    return path
+
+
+#---- self test code
+
+if __name__ == "__main__":
+    appname = "MyApp"
+    appauthor = "MyCompany"
+
+    props = ("user_data_dir",
+             "user_config_dir",
+             "user_cache_dir",
+             "user_state_dir",
+             "user_log_dir",
+             "site_data_dir",
+             "site_config_dir")
+
+    print("-- app dirs %s --" % __version__)
+
+    print("-- app dirs (with optional 'version')")
+    dirs = AppDirs(appname, appauthor, version="1.0")
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (without optional 'version')")
+    dirs = AppDirs(appname, appauthor)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (without optional 'appauthor')")
+    dirs = AppDirs(appname)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (with disabled 'appauthor')")
+    dirs = AppDirs(appname, appauthor=False)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__init__.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__init__.py
new file mode 100644
index 000000000..a1bbbbe3b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__init__.py
@@ -0,0 +1,11 @@
+"""CacheControl import Interface.
+
+Make it easy to import from cachecontrol without long namespaces.
+"""
+__author__ = "Eric Larson"
+__email__ = "eric@ionrock.org"
+__version__ = "0.12.6"
+
+from .wrapper import CacheControl
+from .adapter import CacheControlAdapter
+from .controller import CacheController
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..9add2ee79
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/_cmd.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/_cmd.cpython-36.pyc
new file mode 100644
index 000000000..712efbe5e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/_cmd.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/adapter.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/adapter.cpython-36.pyc
new file mode 100644
index 000000000..f08289db4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/adapter.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/cache.cpython-36.pyc
new file mode 100644
index 000000000..0405346ed
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..eeedee18f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/controller.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/controller.cpython-36.pyc
new file mode 100644
index 000000000..ea457ea35
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/controller.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/filewrapper.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/filewrapper.cpython-36.pyc
new file mode 100644
index 000000000..ec73eaebf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/filewrapper.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/heuristics.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/heuristics.cpython-36.pyc
new file mode 100644
index 000000000..f1f283a6b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/heuristics.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/serialize.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/serialize.cpython-36.pyc
new file mode 100644
index 000000000..b2c9be3d2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/serialize.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/wrapper.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/wrapper.cpython-36.pyc
new file mode 100644
index 000000000..32371bf7a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/__pycache__/wrapper.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/_cmd.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/_cmd.py
new file mode 100644
index 000000000..f1e0ad94a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/_cmd.py
@@ -0,0 +1,57 @@
+import logging
+
+from pip._vendor import requests
+
+from pip._vendor.cachecontrol.adapter import CacheControlAdapter
+from pip._vendor.cachecontrol.cache import DictCache
+from pip._vendor.cachecontrol.controller import logger
+
+from argparse import ArgumentParser
+
+
+def setup_logging():
+    logger.setLevel(logging.DEBUG)
+    handler = logging.StreamHandler()
+    logger.addHandler(handler)
+
+
+def get_session():
+    adapter = CacheControlAdapter(
+        DictCache(), cache_etags=True, serializer=None, heuristic=None
+    )
+    sess = requests.Session()
+    sess.mount("http://", adapter)
+    sess.mount("https://", adapter)
+
+    sess.cache_controller = adapter.controller
+    return sess
+
+
+def get_args():
+    parser = ArgumentParser()
+    parser.add_argument("url", help="The URL to try and cache")
+    return parser.parse_args()
+
+
+def main(args=None):
+    args = get_args()
+    sess = get_session()
+
+    # Make a request to get a response
+    resp = sess.get(args.url)
+
+    # Turn on logging
+    setup_logging()
+
+    # try setting the cache
+    sess.cache_controller.cache_response(resp.request, resp.raw)
+
+    # Now try to get it
+    if sess.cache_controller.cached_request(resp.request):
+        print("Cached!")
+    else:
+        print("Not cached :(")
+
+
+if __name__ == "__main__":
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/adapter.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/adapter.py
new file mode 100644
index 000000000..815650e81
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/adapter.py
@@ -0,0 +1,133 @@
+import types
+import functools
+import zlib
+
+from pip._vendor.requests.adapters import HTTPAdapter
+
+from .controller import CacheController
+from .cache import DictCache
+from .filewrapper import CallbackFileWrapper
+
+
+class CacheControlAdapter(HTTPAdapter):
+    invalidating_methods = {"PUT", "DELETE"}
+
+    def __init__(
+        self,
+        cache=None,
+        cache_etags=True,
+        controller_class=None,
+        serializer=None,
+        heuristic=None,
+        cacheable_methods=None,
+        *args,
+        **kw
+    ):
+        super(CacheControlAdapter, self).__init__(*args, **kw)
+        self.cache = DictCache() if cache is None else cache
+        self.heuristic = heuristic
+        self.cacheable_methods = cacheable_methods or ("GET",)
+
+        controller_factory = controller_class or CacheController
+        self.controller = controller_factory(
+            self.cache, cache_etags=cache_etags, serializer=serializer
+        )
+
+    def send(self, request, cacheable_methods=None, **kw):
+        """
+        Send a request. Use the request information to see if it
+        exists in the cache and cache the response if we need to and can.
+        """
+        cacheable = cacheable_methods or self.cacheable_methods
+        if request.method in cacheable:
+            try:
+                cached_response = self.controller.cached_request(request)
+            except zlib.error:
+                cached_response = None
+            if cached_response:
+                return self.build_response(request, cached_response, from_cache=True)
+
+            # check for etags and add headers if appropriate
+            request.headers.update(self.controller.conditional_headers(request))
+
+        resp = super(CacheControlAdapter, self).send(request, **kw)
+
+        return resp
+
+    def build_response(
+        self, request, response, from_cache=False, cacheable_methods=None
+    ):
+        """
+        Build a response by making a request or using the cache.
+
+        This will end up calling send and returning a potentially
+        cached response
+        """
+        cacheable = cacheable_methods or self.cacheable_methods
+        if not from_cache and request.method in cacheable:
+            # Check for any heuristics that might update headers
+            # before trying to cache.
+            if self.heuristic:
+                response = self.heuristic.apply(response)
+
+            # apply any expiration heuristics
+            if response.status == 304:
+                # We must have sent an ETag request. This could mean
+                # that we've been expired already or that we simply
+                # have an etag. In either case, we want to try and
+                # update the cache if that is the case.
+                cached_response = self.controller.update_cached_response(
+                    request, response
+                )
+
+                if cached_response is not response:
+                    from_cache = True
+
+                # We are done with the server response, read a
+                # possible response body (compliant servers will
+                # not return one, but we cannot be 100% sure) and
+                # release the connection back to the pool.
+                response.read(decode_content=False)
+                response.release_conn()
+
+                response = cached_response
+
+            # We always cache the 301 responses
+            elif response.status == 301:
+                self.controller.cache_response(request, response)
+            else:
+                # Wrap the response file with a wrapper that will cache the
+                #   response when the stream has been consumed.
+                response._fp = CallbackFileWrapper(
+                    response._fp,
+                    functools.partial(
+                        self.controller.cache_response, request, response
+                    ),
+                )
+                if response.chunked:
+                    super_update_chunk_length = response._update_chunk_length
+
+                    def _update_chunk_length(self):
+                        super_update_chunk_length()
+                        if self.chunk_left == 0:
+                            self._fp._close()
+
+                    response._update_chunk_length = types.MethodType(
+                        _update_chunk_length, response
+                    )
+
+        resp = super(CacheControlAdapter, self).build_response(request, response)
+
+        # See if we should invalidate the cache.
+        if request.method in self.invalidating_methods and resp.ok:
+            cache_url = self.controller.cache_url(request.url)
+            self.cache.delete(cache_url)
+
+        # Give the request a from_cache attr to let people use it
+        resp.from_cache = from_cache
+
+        return resp
+
+    def close(self):
+        self.cache.close()
+        super(CacheControlAdapter, self).close()
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/cache.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/cache.py
new file mode 100644
index 000000000..94e07732d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/cache.py
@@ -0,0 +1,39 @@
+"""
+The cache object API for implementing caches. The default is a thread
+safe in-memory dictionary.
+"""
+from threading import Lock
+
+
+class BaseCache(object):
+
+    def get(self, key):
+        raise NotImplementedError()
+
+    def set(self, key, value):
+        raise NotImplementedError()
+
+    def delete(self, key):
+        raise NotImplementedError()
+
+    def close(self):
+        pass
+
+
+class DictCache(BaseCache):
+
+    def __init__(self, init_dict=None):
+        self.lock = Lock()
+        self.data = init_dict or {}
+
+    def get(self, key):
+        return self.data.get(key, None)
+
+    def set(self, key, value):
+        with self.lock:
+            self.data.update({key: value})
+
+    def delete(self, key):
+        with self.lock:
+            if key in self.data:
+                self.data.pop(key)
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__init__.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__init__.py
new file mode 100644
index 000000000..0e1658fa5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__init__.py
@@ -0,0 +1,2 @@
+from .file_cache import FileCache  # noqa
+from .redis_cache import RedisCache  # noqa
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..da2e60964
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/file_cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/file_cache.cpython-36.pyc
new file mode 100644
index 000000000..3b38e2212
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/file_cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/redis_cache.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/redis_cache.cpython-36.pyc
new file mode 100644
index 000000000..e6e43de9f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/__pycache__/redis_cache.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/file_cache.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/file_cache.py
new file mode 100644
index 000000000..607b94524
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/file_cache.py
@@ -0,0 +1,146 @@
+import hashlib
+import os
+from textwrap import dedent
+
+from ..cache import BaseCache
+from ..controller import CacheController
+
+try:
+    FileNotFoundError
+except NameError:
+    # py2.X
+    FileNotFoundError = (IOError, OSError)
+
+
+def _secure_open_write(filename, fmode):
+    # We only want to write to this file, so open it in write only mode
+    flags = os.O_WRONLY
+
+    # os.O_CREAT | os.O_EXCL will fail if the file already exists, so we only
+    #  will open *new* files.
+    # We specify this because we want to ensure that the mode we pass is the
+    # mode of the file.
+    flags |= os.O_CREAT | os.O_EXCL
+
+    # Do not follow symlinks to prevent someone from making a symlink that
+    # we follow and insecurely open a cache file.
+    if hasattr(os, "O_NOFOLLOW"):
+        flags |= os.O_NOFOLLOW
+
+    # On Windows we'll mark this file as binary
+    if hasattr(os, "O_BINARY"):
+        flags |= os.O_BINARY
+
+    # Before we open our file, we want to delete any existing file that is
+    # there
+    try:
+        os.remove(filename)
+    except (IOError, OSError):
+        # The file must not exist already, so we can just skip ahead to opening
+        pass
+
+    # Open our file, the use of os.O_CREAT | os.O_EXCL will ensure that if a
+    # race condition happens between the os.remove and this line, that an
+    # error will be raised. Because we utilize a lockfile this should only
+    # happen if someone is attempting to attack us.
+    fd = os.open(filename, flags, fmode)
+    try:
+        return os.fdopen(fd, "wb")
+
+    except:
+        # An error occurred wrapping our FD in a file object
+        os.close(fd)
+        raise
+
+
+class FileCache(BaseCache):
+
+    def __init__(
+        self,
+        directory,
+        forever=False,
+        filemode=0o0600,
+        dirmode=0o0700,
+        use_dir_lock=None,
+        lock_class=None,
+    ):
+
+        if use_dir_lock is not None and lock_class is not None:
+            raise ValueError("Cannot use use_dir_lock and lock_class together")
+
+        try:
+            from lockfile import LockFile
+            from lockfile.mkdirlockfile import MkdirLockFile
+        except ImportError:
+            notice = dedent(
+                """
+            NOTE: In order to use the FileCache you must have
+            lockfile installed. You can install it via pip:
+              pip install lockfile
+            """
+            )
+            raise ImportError(notice)
+
+        else:
+            if use_dir_lock:
+                lock_class = MkdirLockFile
+
+            elif lock_class is None:
+                lock_class = LockFile
+
+        self.directory = directory
+        self.forever = forever
+        self.filemode = filemode
+        self.dirmode = dirmode
+        self.lock_class = lock_class
+
+    @staticmethod
+    def encode(x):
+        return hashlib.sha224(x.encode()).hexdigest()
+
+    def _fn(self, name):
+        # NOTE: This method should not change as some may depend on it.
+        #       See: https://github.com/ionrock/cachecontrol/issues/63
+        hashed = self.encode(name)
+        parts = list(hashed[:5]) + [hashed]
+        return os.path.join(self.directory, *parts)
+
+    def get(self, key):
+        name = self._fn(key)
+        try:
+            with open(name, "rb") as fh:
+                return fh.read()
+
+        except FileNotFoundError:
+            return None
+
+    def set(self, key, value):
+        name = self._fn(key)
+
+        # Make sure the directory exists
+        try:
+            os.makedirs(os.path.dirname(name), self.dirmode)
+        except (IOError, OSError):
+            pass
+
+        with self.lock_class(name) as lock:
+            # Write our actual file
+            with _secure_open_write(lock.path, self.filemode) as fh:
+                fh.write(value)
+
+    def delete(self, key):
+        name = self._fn(key)
+        if not self.forever:
+            try:
+                os.remove(name)
+            except FileNotFoundError:
+                pass
+
+
+def url_to_file_path(url, filecache):
+    """Return the file cache path based on the URL.
+
+    This does not ensure the file exists!
+    """
+    key = CacheController.cache_url(url)
+    return filecache._fn(key)
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/redis_cache.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/redis_cache.py
new file mode 100644
index 000000000..ed705ce7d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/caches/redis_cache.py
@@ -0,0 +1,33 @@
+from __future__ import division
+
+from datetime import datetime
+from pip._vendor.cachecontrol.cache import BaseCache
+
+
+class RedisCache(BaseCache):
+
+    def __init__(self, conn):
+        self.conn = conn
+
+    def get(self, key):
+        return self.conn.get(key)
+
+    def set(self, key, value, expires=None):
+        if not expires:
+            self.conn.set(key, value)
+        else:
+            expires = expires - datetime.utcnow()
+            self.conn.setex(key, int(expires.total_seconds()), value)
+
+    def delete(self, key):
+        self.conn.delete(key)
+
+    def clear(self):
+        """Helper for clearing all the keys in a database. Use with
+        caution!"""
+        for key in self.conn.keys():
+            self.conn.delete(key)
+
+    def close(self):
+        """Redis uses connection pooling, no need to close the connection."""
+        pass
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/compat.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/compat.py
new file mode 100644
index 000000000..33b5aed0a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/compat.py
@@ -0,0 +1,29 @@
+try:
+    from urllib.parse import urljoin
+except ImportError:
+    from urlparse import urljoin
+
+
+try:
+    import cPickle as pickle
+except ImportError:
+    import pickle
+
+
+# Handle the case where the requests module has been patched to not have
+# urllib3 bundled as part of its source.
+try:
+    from pip._vendor.requests.packages.urllib3.response import HTTPResponse
+except ImportError:
+    from pip._vendor.urllib3.response import HTTPResponse
+
+try:
+    from pip._vendor.requests.packages.urllib3.util import is_fp_closed
+except ImportError:
+    from pip._vendor.urllib3.util import is_fp_closed
+
+# Replicate some six behaviour
+try:
+    text_type = unicode
+except NameError:
+    text_type = str
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/controller.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/controller.py
new file mode 100644
index 000000000..dafe55ca7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/controller.py
@@ -0,0 +1,376 @@
+"""
+The httplib2 algorithms ported for use with requests.
+"""
+import logging
+import re
+import calendar
+import time
+from email.utils import parsedate_tz
+
+from pip._vendor.requests.structures import CaseInsensitiveDict
+
+from .cache import DictCache
+from .serialize import Serializer
+
+
+logger = logging.getLogger(__name__)
+
+URI = re.compile(r"^(([^:/?#]+):)?(//([^/?#]*))?([^?#]*)(\?([^#]*))?(#(.*))?")
+
+
+def parse_uri(uri):
+    """Parses a URI using the regex given in Appendix B of RFC 3986.
+
+        (scheme, authority, path, query, fragment) = parse_uri(uri)
+    """
+    groups = URI.match(uri).groups()
+    return (groups[1], groups[3], groups[4], groups[6], groups[8])
+
+
+class CacheController(object):
+    """An interface to see if request should cached or not.
+    """
+
+    def __init__(
+        self, cache=None, cache_etags=True, serializer=None, status_codes=None
+    ):
+        self.cache = DictCache() if cache is None else cache
+        self.cache_etags = cache_etags
+        self.serializer = serializer or Serializer()
+        self.cacheable_status_codes = status_codes or (200, 203, 300, 301)
+
+    @classmethod
+    def _urlnorm(cls, uri):
+        """Normalize the URL to create a safe key for the cache"""
+        (scheme, authority, path, query, fragment) = parse_uri(uri)
+        if not scheme or not authority:
+            raise Exception("Only absolute URIs are allowed. uri = %s" % uri)
+
+        scheme = scheme.lower()
+        authority = authority.lower()
+
+        if not path:
+            path = "/"
+
+        # Could do syntax based normalization of the URI before
+        # computing the digest. See Section 6.2.2 of Std 66.
+        request_uri = query and "?".join([path, query]) or path
+        defrag_uri = scheme + "://" + authority + request_uri
+
+        return defrag_uri
+
+    @classmethod
+    def cache_url(cls, uri):
+        return cls._urlnorm(uri)
+
+    def parse_cache_control(self, headers):
+        known_directives = {
+            # https://tools.ietf.org/html/rfc7234#section-5.2
+            "max-age": (int, True),
+            "max-stale": (int, False),
+            "min-fresh": (int, True),
+            "no-cache": (None, False),
+            "no-store": (None, False),
+            "no-transform": (None, False),
+            "only-if-cached": (None, False),
+            "must-revalidate": (None, False),
+            "public": (None, False),
+            "private": (None, False),
+            "proxy-revalidate": (None, False),
+            "s-maxage": (int, True),
+        }
+
+        cc_headers = headers.get("cache-control", headers.get("Cache-Control", ""))
+
+        retval = {}
+
+        for cc_directive in cc_headers.split(","):
+            if not cc_directive.strip():
+                continue
+
+            parts = cc_directive.split("=", 1)
+            directive = parts[0].strip()
+
+            try:
+                typ, required = known_directives[directive]
+            except KeyError:
+                logger.debug("Ignoring unknown cache-control directive: %s", directive)
+                continue
+
+            if not typ or not required:
+                retval[directive] = None
+            if typ:
+                try:
+                    retval[directive] = typ(parts[1].strip())
+                except IndexError:
+                    if required:
+                        logger.debug(
+                            "Missing value for cache-control " "directive: %s",
+                            directive,
+                        )
+                except ValueError:
+                    logger.debug(
+                        "Invalid value for cache-control directive " "%s, must be %s",
+                        directive,
+                        typ.__name__,
+                    )
+
+        return retval
+
+    def cached_request(self, request):
+        """
+        Return a cached response if it exists in the cache, otherwise
+        return False.
+        """
+        cache_url = self.cache_url(request.url)
+        logger.debug('Looking up "%s" in the cache', cache_url)
+        cc = self.parse_cache_control(request.headers)
+
+        # Bail out if the request insists on fresh data
+        if "no-cache" in cc:
+            logger.debug('Request header has "no-cache", cache bypassed')
+            return False
+
+        if "max-age" in cc and cc["max-age"] == 0:
+            logger.debug('Request header has "max_age" as 0, cache bypassed')
+            return False
+
+        # Request allows serving from the cache, let's see if we find something
+        cache_data = self.cache.get(cache_url)
+        if cache_data is None:
+            logger.debug("No cache entry available")
+            return False
+
+        # Check whether it can be deserialized
+        resp = self.serializer.loads(request, cache_data)
+        if not resp:
+            logger.warning("Cache entry deserialization failed, entry ignored")
+            return False
+
+        # If we have a cached 301, return it immediately. We don't
+        # need to test our response for other headers b/c it is
+        # intrinsically "cacheable" as it is Permanent.
+        # See:
+        #   https://tools.ietf.org/html/rfc7231#section-6.4.2
+        #
+        # Client can try to refresh the value by repeating the request
+        # with cache busting headers as usual (ie no-cache).
+        if resp.status == 301:
+            msg = (
+                'Returning cached "301 Moved Permanently" response '
+                "(ignoring date and etag information)"
+            )
+            logger.debug(msg)
+            return resp
+
+        headers = CaseInsensitiveDict(resp.headers)
+        if not headers or "date" not in headers:
+            if "etag" not in headers:
+                # Without date or etag, the cached response can never be used
+                # and should be deleted.
+                logger.debug("Purging cached response: no date or etag")
+                self.cache.delete(cache_url)
+            logger.debug("Ignoring cached response: no date")
+            return False
+
+        now = time.time()
+        date = calendar.timegm(parsedate_tz(headers["date"]))
+        current_age = max(0, now - date)
+        logger.debug("Current age based on date: %i", current_age)
+
+        # TODO: There is an assumption that the result will be a
+        #       urllib3 response object. This may not be best since we
+        #       could probably avoid instantiating or constructing the
+        #       response until we know we need it.
+        resp_cc = self.parse_cache_control(headers)
+
+        # determine freshness
+        freshness_lifetime = 0
+
+        # Check the max-age pragma in the cache control header
+        if "max-age" in resp_cc:
+            freshness_lifetime = resp_cc["max-age"]
+            logger.debug("Freshness lifetime from max-age: %i", freshness_lifetime)
+
+        # If there isn't a max-age, check for an expires header
+        elif "expires" in headers:
+            expires = parsedate_tz(headers["expires"])
+            if expires is not None:
+                expire_time = calendar.timegm(expires) - date
+                freshness_lifetime = max(0, expire_time)
+                logger.debug("Freshness lifetime from expires: %i", freshness_lifetime)
+
+        # Determine if we are setting freshness limit in the
+        # request. Note, this overrides what was in the response.
+        if "max-age" in cc:
+            freshness_lifetime = cc["max-age"]
+            logger.debug(
+                "Freshness lifetime from request max-age: %i", freshness_lifetime
+            )
+
+        if "min-fresh" in cc:
+            min_fresh = cc["min-fresh"]
+            # adjust our current age by our min fresh
+            current_age += min_fresh
+            logger.debug("Adjusted current age from min-fresh: %i", current_age)
+
+        # Return entry if it is fresh enough
+        if freshness_lifetime > current_age:
+            logger.debug('The response is "fresh", returning cached response')
+            logger.debug("%i > %i", freshness_lifetime, current_age)
+            return resp
+
+        # we're not fresh. If we don't have an Etag, clear it out
+        if "etag" not in headers:
+            logger.debug('The cached response is "stale" with no etag, purging')
+            self.cache.delete(cache_url)
+
+        # return the original handler
+        return False
+
+    def conditional_headers(self, request):
+        cache_url = self.cache_url(request.url)
+        resp = self.serializer.loads(request, self.cache.get(cache_url))
+        new_headers = {}
+
+        if resp:
+            headers = CaseInsensitiveDict(resp.headers)
+
+            if "etag" in headers:
+                new_headers["If-None-Match"] = headers["ETag"]
+
+            if "last-modified" in headers:
+                new_headers["If-Modified-Since"] = headers["Last-Modified"]
+
+        return new_headers
+
+    def cache_response(self, request, response, body=None, status_codes=None):
+        """
+        Algorithm for caching requests.
+
+        This assumes a requests Response object.
+        """
+        # From httplib2: Don't cache 206's since we aren't going to
+        #                handle byte range requests
+        cacheable_status_codes = status_codes or self.cacheable_status_codes
+        if response.status not in cacheable_status_codes:
+            logger.debug(
+                "Status code %s not in %s", response.status, cacheable_status_codes
+            )
+            return
+
+        response_headers = CaseInsensitiveDict(response.headers)
+
+        # If we've been given a body, our response has a Content-Length, that
+        # Content-Length is valid then we can check to see if the body we've
+        # been given matches the expected size, and if it doesn't we'll just
+        # skip trying to cache it.
+        if (
+            body is not None
+            and "content-length" in response_headers
+            and response_headers["content-length"].isdigit()
+            and int(response_headers["content-length"]) != len(body)
+        ):
+            return
+
+        cc_req = self.parse_cache_control(request.headers)
+        cc = self.parse_cache_control(response_headers)
+
+        cache_url = self.cache_url(request.url)
+        logger.debug('Updating cache with response from "%s"', cache_url)
+
+        # Delete it from the cache if we happen to have it stored there
+        no_store = False
+        if "no-store" in cc:
+            no_store = True
+            logger.debug('Response header has "no-store"')
+        if "no-store" in cc_req:
+            no_store = True
+            logger.debug('Request header has "no-store"')
+        if no_store and self.cache.get(cache_url):
+            logger.debug('Purging existing cache entry to honor "no-store"')
+            self.cache.delete(cache_url)
+        if no_store:
+            return
+
+        # https://tools.ietf.org/html/rfc7234#section-4.1:
+        # A Vary header field-value of "*" always fails to match.
+        # Storing such a response leads to a deserialization warning
+        # during cache lookup and is not allowed to ever be served,
+        # so storing it can be avoided.
+        if "*" in response_headers.get("vary", ""):
+            logger.debug('Response header has "Vary: *"')
+            return
+
+        # If we've been given an etag, then keep the response
+        if self.cache_etags and "etag" in response_headers:
+            logger.debug("Caching due to etag")
+            self.cache.set(
+                cache_url, self.serializer.dumps(request, response, body=body)
+            )
+
+        # Add to the cache any 301s. We do this before looking that
+        # the Date headers.
+        elif response.status == 301:
+            logger.debug("Caching permanant redirect")
+            self.cache.set(cache_url, self.serializer.dumps(request, response))
+
+        # Add to the cache if the response headers demand it. If there
+        # is no date header then we can't do anything about expiring
+        # the cache.
+        elif "date" in response_headers:
+            # cache when there is a max-age > 0
+            if "max-age" in cc and cc["max-age"] > 0:
+                logger.debug("Caching b/c date exists and max-age > 0")
+                self.cache.set(
+                    cache_url, self.serializer.dumps(request, response, body=body)
+                )
+
+            # If the request can expire, it means we should cache it
+            # in the meantime.
+            elif "expires" in response_headers:
+                if response_headers["expires"]:
+                    logger.debug("Caching b/c of expires header")
+                    self.cache.set(
+                        cache_url, self.serializer.dumps(request, response, body=body)
+                    )
+
+    def update_cached_response(self, request, response):
+        """On a 304 we will get a new set of headers that we want to
+        update our cached value with, assuming we have one.
+
+        This should only ever be called when we've sent an ETag and
+        gotten a 304 as the response.
+        """
+        cache_url = self.cache_url(request.url)
+
+        cached_response = self.serializer.loads(request, self.cache.get(cache_url))
+
+        if not cached_response:
+            # we didn't have a cached response
+            return response
+
+        # Lets update our headers with the headers from the new request:
+        # http://tools.ietf.org/html/draft-ietf-httpbis-p4-conditional-26#section-4.1
+        #
+        # The server isn't supposed to send headers that would make
+        # the cached body invalid. But... just in case, we'll be sure
+        # to strip out ones we know that might be problmatic due to
+        # typical assumptions.
+        excluded_headers = ["content-length"]
+
+        cached_response.headers.update(
+            dict(
+                (k, v)
+                for k, v in response.headers.items()
+                if k.lower() not in excluded_headers
+            )
+        )
+
+        # we want a 200 b/c we have content via the cache
+        cached_response.status = 200
+
+        # update our cache
+        self.cache.set(cache_url, self.serializer.dumps(request, cached_response))
+
+        return cached_response
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/filewrapper.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/filewrapper.py
new file mode 100644
index 000000000..30ed4c5a6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/filewrapper.py
@@ -0,0 +1,80 @@
+from io import BytesIO
+
+
+class CallbackFileWrapper(object):
+    """
+    Small wrapper around a fp object which will tee everything read into a
+    buffer, and when that file is closed it will execute a callback with the
+    contents of that buffer.
+
+    All attributes are proxied to the underlying file object.
+
+    This class uses members with a double underscore (__) leading prefix so as
+    not to accidentally shadow an attribute.
+    """
+
+    def __init__(self, fp, callback):
+        self.__buf = BytesIO()
+        self.__fp = fp
+        self.__callback = callback
+
+    def __getattr__(self, name):
+        # The vaguaries of garbage collection means that self.__fp is
+        # not always set.  By using __getattribute__ and the private
+        # name[0] allows looking up the attribute value and raising an
+        # AttributeError when it doesn't exist. This stop thigns from
+        # infinitely recursing calls to getattr in the case where
+        # self.__fp hasn't been set.
+        #
+        # [0] https://docs.python.org/2/reference/expressions.html#atom-identifiers
+        fp = self.__getattribute__("_CallbackFileWrapper__fp")
+        return getattr(fp, name)
+
+    def __is_fp_closed(self):
+        try:
+            return self.__fp.fp is None
+
+        except AttributeError:
+            pass
+
+        try:
+            return self.__fp.closed
+
+        except AttributeError:
+            pass
+
+        # We just don't cache it then.
+        # TODO: Add some logging here...
+        return False
+
+    def _close(self):
+        if self.__callback:
+            self.__callback(self.__buf.getvalue())
+
+        # We assign this to None here, because otherwise we can get into
+        # really tricky problems where the CPython interpreter dead locks
+        # because the callback is holding a reference to something which
+        # has a __del__ method. Setting this to None breaks the cycle
+        # and allows the garbage collector to do it's thing normally.
+        self.__callback = None
+
+    def read(self, amt=None):
+        data = self.__fp.read(amt)
+        self.__buf.write(data)
+        if self.__is_fp_closed():
+            self._close()
+
+        return data
+
+    def _safe_read(self, amt):
+        data = self.__fp._safe_read(amt)
+        if amt == 2 and data == b"\r\n":
+            # urllib executes this read to toss the CRLF at the end
+            # of the chunk.
+            return data
+
+        self.__buf.write(data)
+        if self.__is_fp_closed():
+            self._close()
+
+        return data
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/heuristics.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/heuristics.py
new file mode 100644
index 000000000..6c0e9790d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/heuristics.py
@@ -0,0 +1,135 @@
+import calendar
+import time
+
+from email.utils import formatdate, parsedate, parsedate_tz
+
+from datetime import datetime, timedelta
+
+TIME_FMT = "%a, %d %b %Y %H:%M:%S GMT"
+
+
+def expire_after(delta, date=None):
+    date = date or datetime.utcnow()
+    return date + delta
+
+
+def datetime_to_header(dt):
+    return formatdate(calendar.timegm(dt.timetuple()))
+
+
+class BaseHeuristic(object):
+
+    def warning(self, response):
+        """
+        Return a valid 1xx warning header value describing the cache
+        adjustments.
+
+        The response is provided too allow warnings like 113
+        http://tools.ietf.org/html/rfc7234#section-5.5.4 where we need
+        to explicitly say response is over 24 hours old.
+        """
+        return '110 - "Response is Stale"'
+
+    def update_headers(self, response):
+        """Update the response headers with any new headers.
+
+        NOTE: This SHOULD always include some Warning header to
+              signify that the response was cached by the client, not
+              by way of the provided headers.
+        """
+        return {}
+
+    def apply(self, response):
+        updated_headers = self.update_headers(response)
+
+        if updated_headers:
+            response.headers.update(updated_headers)
+            warning_header_value = self.warning(response)
+            if warning_header_value is not None:
+                response.headers.update({"Warning": warning_header_value})
+
+        return response
+
+
+class OneDayCache(BaseHeuristic):
+    """
+    Cache the response by providing an expires 1 day in the
+    future.
+    """
+
+    def update_headers(self, response):
+        headers = {}
+
+        if "expires" not in response.headers:
+            date = parsedate(response.headers["date"])
+            expires = expire_after(timedelta(days=1), date=datetime(*date[:6]))
+            headers["expires"] = datetime_to_header(expires)
+            headers["cache-control"] = "public"
+        return headers
+
+
+class ExpiresAfter(BaseHeuristic):
+    """
+    Cache **all** requests for a defined time period.
+    """
+
+    def __init__(self, **kw):
+        self.delta = timedelta(**kw)
+
+    def update_headers(self, response):
+        expires = expire_after(self.delta)
+        return {"expires": datetime_to_header(expires), "cache-control": "public"}
+
+    def warning(self, response):
+        tmpl = "110 - Automatically cached for %s. Response might be stale"
+        return tmpl % self.delta
+
+
+class LastModified(BaseHeuristic):
+    """
+    If there is no Expires header already, fall back on Last-Modified
+    using the heuristic from
+    http://tools.ietf.org/html/rfc7234#section-4.2.2
+    to calculate a reasonable value.
+
+    Firefox also does something like this per
+    https://developer.mozilla.org/en-US/docs/Web/HTTP/Caching_FAQ
+    http://lxr.mozilla.org/mozilla-release/source/netwerk/protocol/http/nsHttpResponseHead.cpp#397
+    Unlike mozilla we limit this to 24-hr.
+    """
+    cacheable_by_default_statuses = {
+        200, 203, 204, 206, 300, 301, 404, 405, 410, 414, 501
+    }
+
+    def update_headers(self, resp):
+        headers = resp.headers
+
+        if "expires" in headers:
+            return {}
+
+        if "cache-control" in headers and headers["cache-control"] != "public":
+            return {}
+
+        if resp.status not in self.cacheable_by_default_statuses:
+            return {}
+
+        if "date" not in headers or "last-modified" not in headers:
+            return {}
+
+        date = calendar.timegm(parsedate_tz(headers["date"]))
+        last_modified = parsedate(headers["last-modified"])
+        if date is None or last_modified is None:
+            return {}
+
+        now = time.time()
+        current_age = max(0, now - date)
+        delta = date - calendar.timegm(last_modified)
+        freshness_lifetime = max(0, min(delta / 10, 24 * 3600))
+        if freshness_lifetime <= current_age:
+            return {}
+
+        expires = date + freshness_lifetime
+        return {"expires": time.strftime(TIME_FMT, time.gmtime(expires))}
+
+    def warning(self, resp):
+        return None
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/serialize.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/serialize.py
new file mode 100644
index 000000000..3b6ec2de1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/serialize.py
@@ -0,0 +1,188 @@
+import base64
+import io
+import json
+import zlib
+
+from pip._vendor import msgpack
+from pip._vendor.requests.structures import CaseInsensitiveDict
+
+from .compat import HTTPResponse, pickle, text_type
+
+
+def _b64_decode_bytes(b):
+    return base64.b64decode(b.encode("ascii"))
+
+
+def _b64_decode_str(s):
+    return _b64_decode_bytes(s).decode("utf8")
+
+
+class Serializer(object):
+
+    def dumps(self, request, response, body=None):
+        response_headers = CaseInsensitiveDict(response.headers)
+
+        if body is None:
+            body = response.read(decode_content=False)
+
+            # NOTE: 99% sure this is dead code. I'm only leaving it
+            #       here b/c I don't have a test yet to prove
+            #       it. Basically, before using
+            #       `cachecontrol.filewrapper.CallbackFileWrapper`,
+            #       this made an effort to reset the file handle. The
+            #       `CallbackFileWrapper` short circuits this code by
+            #       setting the body as the content is consumed, the
+            #       result being a `body` argument is *always* passed
+            #       into cache_response, and in turn,
+            #       `Serializer.dump`.
+            response._fp = io.BytesIO(body)
+
+        # NOTE: This is all a bit weird, but it's really important that on
+        #       Python 2.x these objects are unicode and not str, even when
+        #       they contain only ascii. The problem here is that msgpack
+        #       understands the difference between unicode and bytes and we
+        #       have it set to differentiate between them, however Python 2
+        #       doesn't know the difference. Forcing these to unicode will be
+        #       enough to have msgpack know the difference.
+        data = {
+            u"response": {
+                u"body": body,
+                u"headers": dict(
+                    (text_type(k), text_type(v)) for k, v in response.headers.items()
+                ),
+                u"status": response.status,
+                u"version": response.version,
+                u"reason": text_type(response.reason),
+                u"strict": response.strict,
+                u"decode_content": response.decode_content,
+            }
+        }
+
+        # Construct our vary headers
+        data[u"vary"] = {}
+        if u"vary" in response_headers:
+            varied_headers = response_headers[u"vary"].split(",")
+            for header in varied_headers:
+                header = text_type(header).strip()
+                header_value = request.headers.get(header, None)
+                if header_value is not None:
+                    header_value = text_type(header_value)
+                data[u"vary"][header] = header_value
+
+        return b",".join([b"cc=4", msgpack.dumps(data, use_bin_type=True)])
+
+    def loads(self, request, data):
+        # Short circuit if we've been given an empty set of data
+        if not data:
+            return
+
+        # Determine what version of the serializer the data was serialized
+        # with
+        try:
+            ver, data = data.split(b",", 1)
+        except ValueError:
+            ver = b"cc=0"
+
+        # Make sure that our "ver" is actually a version and isn't a false
+        # positive from a , being in the data stream.
+        if ver[:3] != b"cc=":
+            data = ver + data
+            ver = b"cc=0"
+
+        # Get the version number out of the cc=N
+        ver = ver.split(b"=", 1)[-1].decode("ascii")
+
+        # Dispatch to the actual load method for the given version
+        try:
+            return getattr(self, "_loads_v{}".format(ver))(request, data)
+
+        except AttributeError:
+            # This is a version we don't have a loads function for, so we'll
+            # just treat it as a miss and return None
+            return
+
+    def prepare_response(self, request, cached):
+        """Verify our vary headers match and construct a real urllib3
+        HTTPResponse object.
+        """
+        # Special case the '*' Vary value as it means we cannot actually
+        # determine if the cached response is suitable for this request.
+        # This case is also handled in the controller code when creating
+        # a cache entry, but is left here for backwards compatibility.
+        if "*" in cached.get("vary", {}):
+            return
+
+        # Ensure that the Vary headers for the cached response match our
+        # request
+        for header, value in cached.get("vary", {}).items():
+            if request.headers.get(header, None) != value:
+                return
+
+        body_raw = cached["response"].pop("body")
+
+        headers = CaseInsensitiveDict(data=cached["response"]["headers"])
+        if headers.get("transfer-encoding", "") == "chunked":
+            headers.pop("transfer-encoding")
+
+        cached["response"]["headers"] = headers
+
+        try:
+            body = io.BytesIO(body_raw)
+        except TypeError:
+            # This can happen if cachecontrol serialized to v1 format (pickle)
+            # using Python 2. A Python 2 str(byte string) will be unpickled as
+            # a Python 3 str (unicode string), which will cause the above to
+            # fail with:
+            #
+            #     TypeError: 'str' does not support the buffer interface
+            body = io.BytesIO(body_raw.encode("utf8"))
+
+        return HTTPResponse(body=body, preload_content=False, **cached["response"])
+
+    def _loads_v0(self, request, data):
+        # The original legacy cache data. This doesn't contain enough
+        # information to construct everything we need, so we'll treat this as
+        # a miss.
+        return
+
+    def _loads_v1(self, request, data):
+        try:
+            cached = pickle.loads(data)
+        except ValueError:
+            return
+
+        return self.prepare_response(request, cached)
+
+    def _loads_v2(self, request, data):
+        try:
+            cached = json.loads(zlib.decompress(data).decode("utf8"))
+        except (ValueError, zlib.error):
+            return
+
+        # We need to decode the items that we've base64 encoded
+        cached["response"]["body"] = _b64_decode_bytes(cached["response"]["body"])
+        cached["response"]["headers"] = dict(
+            (_b64_decode_str(k), _b64_decode_str(v))
+            for k, v in cached["response"]["headers"].items()
+        )
+        cached["response"]["reason"] = _b64_decode_str(cached["response"]["reason"])
+        cached["vary"] = dict(
+            (_b64_decode_str(k), _b64_decode_str(v) if v is not None else v)
+            for k, v in cached["vary"].items()
+        )
+
+        return self.prepare_response(request, cached)
+
+    def _loads_v3(self, request, data):
+        # Due to Python 2 encoding issues, it's impossible to know for sure
+        # exactly how to load v3 entries, thus we'll treat these as a miss so
+        # that they get rewritten out as v4 entries.
+        return
+
+    def _loads_v4(self, request, data):
+        try:
+            cached = msgpack.loads(data, raw=False)
+        except ValueError:
+            return
+
+        return self.prepare_response(request, cached)
diff --git a/venv/Lib/site-packages/pip/_vendor/cachecontrol/wrapper.py b/venv/Lib/site-packages/pip/_vendor/cachecontrol/wrapper.py
new file mode 100644
index 000000000..d8e6fc6a9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/cachecontrol/wrapper.py
@@ -0,0 +1,29 @@
+from .adapter import CacheControlAdapter
+from .cache import DictCache
+
+
+def CacheControl(
+    sess,
+    cache=None,
+    cache_etags=True,
+    serializer=None,
+    heuristic=None,
+    controller_class=None,
+    adapter_class=None,
+    cacheable_methods=None,
+):
+
+    cache = DictCache() if cache is None else cache
+    adapter_class = adapter_class or CacheControlAdapter
+    adapter = adapter_class(
+        cache,
+        cache_etags=cache_etags,
+        serializer=serializer,
+        heuristic=heuristic,
+        controller_class=controller_class,
+        cacheable_methods=cacheable_methods,
+    )
+    sess.mount("http://", adapter)
+    sess.mount("https://", adapter)
+
+    return sess
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/__init__.py b/venv/Lib/site-packages/pip/_vendor/certifi/__init__.py
new file mode 100644
index 000000000..5d52a62e7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/certifi/__init__.py
@@ -0,0 +1,3 @@
+from .core import contents, where
+
+__version__ = "2020.06.20"
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/__main__.py b/venv/Lib/site-packages/pip/_vendor/certifi/__main__.py
new file mode 100644
index 000000000..00376349e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/certifi/__main__.py
@@ -0,0 +1,12 @@
+import argparse
+
+from pip._vendor.certifi import contents, where
+
+parser = argparse.ArgumentParser()
+parser.add_argument("-c", "--contents", action="store_true")
+args = parser.parse_args()
+
+if args.contents:
+    print(contents())
+else:
+    print(where())
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..d554b57b2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc
new file mode 100644
index 000000000..88e6da48e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/__main__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/core.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/core.cpython-36.pyc
new file mode 100644
index 000000000..1f6648777
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/certifi/__pycache__/core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/cacert.pem b/venv/Lib/site-packages/pip/_vendor/certifi/cacert.pem
new file mode 100644
index 000000000..0fd855f46
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/certifi/cacert.pem
@@ -0,0 +1,4620 @@
+
+# Issuer: CN=GlobalSign Root CA O=GlobalSign nv-sa OU=Root CA
+# Subject: CN=GlobalSign Root CA O=GlobalSign nv-sa OU=Root CA
+# Label: "GlobalSign Root CA"
+# Serial: 4835703278459707669005204
+# MD5 Fingerprint: 3e:45:52:15:09:51:92:e1:b7:5d:37:9f:b1:87:29:8a
+# SHA1 Fingerprint: b1:bc:96:8b:d4:f4:9d:62:2a:a8:9a:81:f2:15:01:52:a4:1d:82:9c
+# SHA256 Fingerprint: eb:d4:10:40:e4:bb:3e:c7:42:c9:e3:81:d3:1e:f2:a4:1a:48:b6:68:5c:96:e7:ce:f3:c1:df:6c:d4:33:1c:99
+-----BEGIN CERTIFICATE-----
+MIIDdTCCAl2gAwIBAgILBAAAAAABFUtaw5QwDQYJKoZIhvcNAQEFBQAwVzELMAkG
+A1UEBhMCQkUxGTAXBgNVBAoTEEdsb2JhbFNpZ24gbnYtc2ExEDAOBgNVBAsTB1Jv
+b3QgQ0ExGzAZBgNVBAMTEkdsb2JhbFNpZ24gUm9vdCBDQTAeFw05ODA5MDExMjAw
+MDBaFw0yODAxMjgxMjAwMDBaMFcxCzAJBgNVBAYTAkJFMRkwFwYDVQQKExBHbG9i
+YWxTaWduIG52LXNhMRAwDgYDVQQLEwdSb290IENBMRswGQYDVQQDExJHbG9iYWxT
+aWduIFJvb3QgQ0EwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDaDuaZ
+jc6j40+Kfvvxi4Mla+pIH/EqsLmVEQS98GPR4mdmzxzdzxtIK+6NiY6arymAZavp
+xy0Sy6scTHAHoT0KMM0VjU/43dSMUBUc71DuxC73/OlS8pF94G3VNTCOXkNz8kHp
+1Wrjsok6Vjk4bwY8iGlbKk3Fp1S4bInMm/k8yuX9ifUSPJJ4ltbcdG6TRGHRjcdG
+snUOhugZitVtbNV4FpWi6cgKOOvyJBNPc1STE4U6G7weNLWLBYy5d4ux2x8gkasJ
+U26Qzns3dLlwR5EiUWMWea6xrkEmCMgZK9FGqkjWZCrXgzT/LCrBbBlDSgeF59N8
+9iFo7+ryUp9/k5DPAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8E
+BTADAQH/MB0GA1UdDgQWBBRge2YaRQ2XyolQL30EzTSo//z9SzANBgkqhkiG9w0B
+AQUFAAOCAQEA1nPnfE920I2/7LqivjTFKDK1fPxsnCwrvQmeU79rXqoRSLblCKOz
+yj1hTdNGCbM+w6DjY1Ub8rrvrTnhQ7k4o+YviiY776BQVvnGCv04zcQLcFGUl5gE
+38NflNUVyRRBnMRddWQVDf9VMOyGj/8N7yy5Y0b2qvzfvGn9LhJIZJrglfCm7ymP
+AbEVtQwdpf5pLGkkeB6zpxxxYu7KyJesF12KwvhHhm4qxFYxldBniYUr+WymXUad
+DKqC5JlR3XC321Y9YeRq4VzW9v493kHMB65jUr9TU/Qr6cf9tveCX4XSQRjbgbME
+HMUfpIBvFSDJ3gyICh3WZlXi/EjJKSZp4A==
+-----END CERTIFICATE-----
+
+# Issuer: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R2
+# Subject: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R2
+# Label: "GlobalSign Root CA - R2"
+# Serial: 4835703278459682885658125
+# MD5 Fingerprint: 94:14:77:7e:3e:5e:fd:8f:30:bd:41:b0:cf:e7:d0:30
+# SHA1 Fingerprint: 75:e0:ab:b6:13:85:12:27:1c:04:f8:5f:dd:de:38:e4:b7:24:2e:fe
+# SHA256 Fingerprint: ca:42:dd:41:74:5f:d0:b8:1e:b9:02:36:2c:f9:d8:bf:71:9d:a1:bd:1b:1e:fc:94:6f:5b:4c:99:f4:2c:1b:9e
+-----BEGIN CERTIFICATE-----
+MIIDujCCAqKgAwIBAgILBAAAAAABD4Ym5g0wDQYJKoZIhvcNAQEFBQAwTDEgMB4G
+A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjIxEzARBgNVBAoTCkdsb2JhbFNp
+Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDYxMjE1MDgwMDAwWhcNMjExMjE1
+MDgwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMjETMBEG
+A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAKbPJA6+Lm8omUVCxKs+IVSbC9N/hHD6ErPL
+v4dfxn+G07IwXNb9rfF73OX4YJYJkhD10FPe+3t+c4isUoh7SqbKSaZeqKeMWhG8
+eoLrvozps6yWJQeXSpkqBy+0Hne/ig+1AnwblrjFuTosvNYSuetZfeLQBoZfXklq
+tTleiDTsvHgMCJiEbKjNS7SgfQx5TfC4LcshytVsW33hoCmEofnTlEnLJGKRILzd
+C9XZzPnqJworc5HGnRusyMvo4KD0L5CLTfuwNhv2GXqF4G3yYROIXJ/gkwpRl4pa
+zq+r1feqCapgvdzZX99yqWATXgAByUr6P6TqBwMhAo6CygPCm48CAwEAAaOBnDCB
+mTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUm+IH
+V2ccHsBqBt5ZtJot39wZhi4wNgYDVR0fBC8wLTAroCmgJ4YlaHR0cDovL2NybC5n
+bG9iYWxzaWduLm5ldC9yb290LXIyLmNybDAfBgNVHSMEGDAWgBSb4gdXZxwewGoG
+3lm0mi3f3BmGLjANBgkqhkiG9w0BAQUFAAOCAQEAmYFThxxol4aR7OBKuEQLq4Gs
+J0/WwbgcQ3izDJr86iw8bmEbTUsp9Z8FHSbBuOmDAGJFtqkIk7mpM0sYmsL4h4hO
+291xNBrBVNpGP+DTKqttVCL1OmLNIG+6KYnX3ZHu01yiPqFbQfXf5WRDLenVOavS
+ot+3i9DAgBkcRcAtjOj4LaR0VknFBbVPFd5uRHg5h6h+u/N5GJG79G+dwfCMNYxd
+AfvDbbnvRG15RjF+Cv6pgsH/76tuIMRQyV+dTZsXjAzlAcmgQWpzU/qlULRuJQ/7
+TBj0/VLZjmmx6BEP3ojY+x1J96relc8geMJgEtslQIxq/H5COEBkEveegeGTLg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Entrust.net Certification Authority (2048) O=Entrust.net OU=www.entrust.net/CPS_2048 incorp. by ref. (limits liab.)/(c) 1999 Entrust.net Limited
+# Subject: CN=Entrust.net Certification Authority (2048) O=Entrust.net OU=www.entrust.net/CPS_2048 incorp. by ref. (limits liab.)/(c) 1999 Entrust.net Limited
+# Label: "Entrust.net Premium 2048 Secure Server CA"
+# Serial: 946069240
+# MD5 Fingerprint: ee:29:31:bc:32:7e:9a:e6:e8:b5:f7:51:b4:34:71:90
+# SHA1 Fingerprint: 50:30:06:09:1d:97:d4:f5:ae:39:f7:cb:e7:92:7d:7d:65:2d:34:31
+# SHA256 Fingerprint: 6d:c4:71:72:e0:1c:bc:b0:bf:62:58:0d:89:5f:e2:b8:ac:9a:d4:f8:73:80:1e:0c:10:b9:c8:37:d2:1e:b1:77
+-----BEGIN CERTIFICATE-----
+MIIEKjCCAxKgAwIBAgIEOGPe+DANBgkqhkiG9w0BAQUFADCBtDEUMBIGA1UEChML
+RW50cnVzdC5uZXQxQDA+BgNVBAsUN3d3dy5lbnRydXN0Lm5ldC9DUFNfMjA0OCBp
+bmNvcnAuIGJ5IHJlZi4gKGxpbWl0cyBsaWFiLikxJTAjBgNVBAsTHChjKSAxOTk5
+IEVudHJ1c3QubmV0IExpbWl0ZWQxMzAxBgNVBAMTKkVudHJ1c3QubmV0IENlcnRp
+ZmljYXRpb24gQXV0aG9yaXR5ICgyMDQ4KTAeFw05OTEyMjQxNzUwNTFaFw0yOTA3
+MjQxNDE1MTJaMIG0MRQwEgYDVQQKEwtFbnRydXN0Lm5ldDFAMD4GA1UECxQ3d3d3
+LmVudHJ1c3QubmV0L0NQU18yMDQ4IGluY29ycC4gYnkgcmVmLiAobGltaXRzIGxp
+YWIuKTElMCMGA1UECxMcKGMpIDE5OTkgRW50cnVzdC5uZXQgTGltaXRlZDEzMDEG
+A1UEAxMqRW50cnVzdC5uZXQgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgKDIwNDgp
+MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEArU1LqRKGsuqjIAcVFmQq
+K0vRvwtKTY7tgHalZ7d4QMBzQshowNtTK91euHaYNZOLGp18EzoOH1u3Hs/lJBQe
+sYGpjX24zGtLA/ECDNyrpUAkAH90lKGdCCmziAv1h3edVc3kw37XamSrhRSGlVuX
+MlBvPci6Zgzj/L24ScF2iUkZ/cCovYmjZy/Gn7xxGWC4LeksyZB2ZnuU4q941mVT
+XTzWnLLPKQP5L6RQstRIzgUyVYr9smRMDuSYB3Xbf9+5CFVghTAp+XtIpGmG4zU/
+HoZdenoVve8AjhUiVBcAkCaTvA5JaJG/+EfTnZVCwQ5N328mz8MYIWJmQ3DW1cAH
+4QIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV
+HQ4EFgQUVeSB0RGAvtiJuQijMfmhJAkWuXAwDQYJKoZIhvcNAQEFBQADggEBADub
+j1abMOdTmXx6eadNl9cZlZD7Bh/KM3xGY4+WZiT6QBshJ8rmcnPyT/4xmf3IDExo
+U8aAghOY+rat2l098c5u9hURlIIM7j+VrxGrD9cv3h8Dj1csHsm7mhpElesYT6Yf
+zX1XEC+bBAlahLVu2B064dae0Wx5XnkcFMXj0EyTO2U87d89vqbllRrDtRnDvV5b
+u/8j72gZyxKTJ1wDLW8w0B62GqzeWvfRqqgnpv55gcR5mTNXuhKwqeBCbJPKVt7+
+bYQLCIt+jerXmCHG8+c8eS9enNFMFY3h7CI3zJpDC5fcgJCNs2ebb0gIFVbPv/Er
+fF6adulZkMV8gzURZVE=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Baltimore CyberTrust Root O=Baltimore OU=CyberTrust
+# Subject: CN=Baltimore CyberTrust Root O=Baltimore OU=CyberTrust
+# Label: "Baltimore CyberTrust Root"
+# Serial: 33554617
+# MD5 Fingerprint: ac:b6:94:a5:9c:17:e0:d7:91:52:9b:b1:97:06:a6:e4
+# SHA1 Fingerprint: d4:de:20:d0:5e:66:fc:53:fe:1a:50:88:2c:78:db:28:52:ca:e4:74
+# SHA256 Fingerprint: 16:af:57:a9:f6:76:b0:ab:12:60:95:aa:5e:ba:de:f2:2a:b3:11:19:d6:44:ac:95:cd:4b:93:db:f3:f2:6a:eb
+-----BEGIN CERTIFICATE-----
+MIIDdzCCAl+gAwIBAgIEAgAAuTANBgkqhkiG9w0BAQUFADBaMQswCQYDVQQGEwJJ
+RTESMBAGA1UEChMJQmFsdGltb3JlMRMwEQYDVQQLEwpDeWJlclRydXN0MSIwIAYD
+VQQDExlCYWx0aW1vcmUgQ3liZXJUcnVzdCBSb290MB4XDTAwMDUxMjE4NDYwMFoX
+DTI1MDUxMjIzNTkwMFowWjELMAkGA1UEBhMCSUUxEjAQBgNVBAoTCUJhbHRpbW9y
+ZTETMBEGA1UECxMKQ3liZXJUcnVzdDEiMCAGA1UEAxMZQmFsdGltb3JlIEN5YmVy
+VHJ1c3QgUm9vdDCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAKMEuyKr
+mD1X6CZymrV51Cni4eiVgLGw41uOKymaZN+hXe2wCQVt2yguzmKiYv60iNoS6zjr
+IZ3AQSsBUnuId9Mcj8e6uYi1agnnc+gRQKfRzMpijS3ljwumUNKoUMMo6vWrJYeK
+mpYcqWe4PwzV9/lSEy/CG9VwcPCPwBLKBsua4dnKM3p31vjsufFoREJIE9LAwqSu
+XmD+tqYF/LTdB1kC1FkYmGP1pWPgkAx9XbIGevOF6uvUA65ehD5f/xXtabz5OTZy
+dc93Uk3zyZAsuT3lySNTPx8kmCFcB5kpvcY67Oduhjprl3RjM71oGDHweI12v/ye
+jl0qhqdNkNwnGjkCAwEAAaNFMEMwHQYDVR0OBBYEFOWdWTCCR1jMrPoIVDaGezq1
+BE3wMBIGA1UdEwEB/wQIMAYBAf8CAQMwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3
+DQEBBQUAA4IBAQCFDF2O5G9RaEIFoN27TyclhAO992T9Ldcw46QQF+vaKSm2eT92
+9hkTI7gQCvlYpNRhcL0EYWoSihfVCr3FvDB81ukMJY2GQE/szKN+OMY3EU/t3Wgx
+jkzSswF07r51XgdIGn9w/xZchMB5hbgF/X++ZRGjD8ACtPhSNzkE1akxehi/oCr0
+Epn3o0WC4zxe9Z2etciefC7IpJ5OCBRLbf1wbWsaY71k5h+3zvDyny67G7fyUIhz
+ksLi4xaNmjICq44Y3ekQEe5+NauQrz4wlHrQMz2nZQ/1/I6eYs9HRCwBXbsdtTLS
+R9I4LtD+gdwyah617jzV/OeBHRnDJELqYzmp
+-----END CERTIFICATE-----
+
+# Issuer: CN=Entrust Root Certification Authority O=Entrust, Inc. OU=www.entrust.net/CPS is incorporated by reference/(c) 2006 Entrust, Inc.
+# Subject: CN=Entrust Root Certification Authority O=Entrust, Inc. OU=www.entrust.net/CPS is incorporated by reference/(c) 2006 Entrust, Inc.
+# Label: "Entrust Root Certification Authority"
+# Serial: 1164660820
+# MD5 Fingerprint: d6:a5:c3:ed:5d:dd:3e:00:c1:3d:87:92:1f:1d:3f:e4
+# SHA1 Fingerprint: b3:1e:b1:b7:40:e3:6c:84:02:da:dc:37:d4:4d:f5:d4:67:49:52:f9
+# SHA256 Fingerprint: 73:c1:76:43:4f:1b:c6:d5:ad:f4:5b:0e:76:e7:27:28:7c:8d:e5:76:16:c1:e6:e6:14:1a:2b:2c:bc:7d:8e:4c
+-----BEGIN CERTIFICATE-----
+MIIEkTCCA3mgAwIBAgIERWtQVDANBgkqhkiG9w0BAQUFADCBsDELMAkGA1UEBhMC
+VVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xOTA3BgNVBAsTMHd3dy5lbnRydXN0
+Lm5ldC9DUFMgaXMgaW5jb3Jwb3JhdGVkIGJ5IHJlZmVyZW5jZTEfMB0GA1UECxMW
+KGMpIDIwMDYgRW50cnVzdCwgSW5jLjEtMCsGA1UEAxMkRW50cnVzdCBSb290IENl
+cnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTA2MTEyNzIwMjM0MloXDTI2MTEyNzIw
+NTM0MlowgbAxCzAJBgNVBAYTAlVTMRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMTkw
+NwYDVQQLEzB3d3cuZW50cnVzdC5uZXQvQ1BTIGlzIGluY29ycG9yYXRlZCBieSBy
+ZWZlcmVuY2UxHzAdBgNVBAsTFihjKSAyMDA2IEVudHJ1c3QsIEluYy4xLTArBgNV
+BAMTJEVudHJ1c3QgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTCCASIwDQYJ
+KoZIhvcNAQEBBQADggEPADCCAQoCggEBALaVtkNC+sZtKm9I35RMOVcF7sN5EUFo
+Nu3s/poBj6E4KPz3EEZmLk0eGrEaTsbRwJWIsMn/MYszA9u3g3s+IIRe7bJWKKf4
+4LlAcTfFy0cOlypowCKVYhXbR9n10Cv/gkvJrT7eTNuQgFA/CYqEAOwwCj0Yzfv9
+KlmaI5UXLEWeH25DeW0MXJj+SKfFI0dcXv1u5x609mhF0YaDW6KKjbHjKYD+JXGI
+rb68j6xSlkuqUY3kEzEZ6E5Nn9uss2rVvDlUccp6en+Q3X0dgNmBu1kmwhH+5pPi
+94DkZfs0Nw4pgHBNrziGLp5/V6+eF67rHMsoIV+2HNjnogQi+dPa2MsCAwEAAaOB
+sDCBrTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zArBgNVHRAEJDAi
+gA8yMDA2MTEyNzIwMjM0MlqBDzIwMjYxMTI3MjA1MzQyWjAfBgNVHSMEGDAWgBRo
+kORnpKZTgMeGZqTx90tD+4S9bTAdBgNVHQ4EFgQUaJDkZ6SmU4DHhmak8fdLQ/uE
+vW0wHQYJKoZIhvZ9B0EABBAwDhsIVjcuMTo0LjADAgSQMA0GCSqGSIb3DQEBBQUA
+A4IBAQCT1DCw1wMgKtD5Y+iRDAUgqV8ZyntyTtSx29CW+1RaGSwMCPeyvIWonX9t
+O1KzKtvn1ISMY/YPyyYBkVBs9F8U4pN0wBOeMDpQ47RgxRzwIkSNcUesyBrJ6Zua
+AGAT/3B+XxFNSRuzFVJ7yVTav52Vr2ua2J7p8eRDjeIRRDq/r72DQnNSi6q7pynP
+9WQcCk3RvKqsnyrQ/39/2n3qse0wJcGE2jTSW3iDVuycNsMm4hH2Z0kdkquM++v/
+eu6FSqdQgPCnXEqULl8FmTxSQeDNtGPPAUO6nIPcj2A781q0tHuu2guQOHXvgR1m
+0vdXcDazv/wor3ElhVsT/h5/WrQ8
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Global CA O=GeoTrust Inc.
+# Subject: CN=GeoTrust Global CA O=GeoTrust Inc.
+# Label: "GeoTrust Global CA"
+# Serial: 144470
+# MD5 Fingerprint: f7:75:ab:29:fb:51:4e:b7:77:5e:ff:05:3c:99:8e:f5
+# SHA1 Fingerprint: de:28:f4:a4:ff:e5:b9:2f:a3:c5:03:d1:a3:49:a7:f9:96:2a:82:12
+# SHA256 Fingerprint: ff:85:6a:2d:25:1d:cd:88:d3:66:56:f4:50:12:67:98:cf:ab:aa:de:40:79:9c:72:2d:e4:d2:b5:db:36:a7:3a
+-----BEGIN CERTIFICATE-----
+MIIDVDCCAjygAwIBAgIDAjRWMA0GCSqGSIb3DQEBBQUAMEIxCzAJBgNVBAYTAlVT
+MRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMRswGQYDVQQDExJHZW9UcnVzdCBHbG9i
+YWwgQ0EwHhcNMDIwNTIxMDQwMDAwWhcNMjIwNTIxMDQwMDAwWjBCMQswCQYDVQQG
+EwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEbMBkGA1UEAxMSR2VvVHJ1c3Qg
+R2xvYmFsIENBMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA2swYYzD9
+9BcjGlZ+W988bDjkcbd4kdS8odhM+KhDtgPpTSEHCIjaWC9mOSm9BXiLnTjoBbdq
+fnGk5sRgprDvgOSJKA+eJdbtg/OtppHHmMlCGDUUna2YRpIuT8rxh0PBFpVXLVDv
+iS2Aelet8u5fa9IAjbkU+BQVNdnARqN7csiRv8lVK83Qlz6cJmTM386DGXHKTubU
+1XupGc1V3sjs0l44U+VcT4wt/lAjNvxm5suOpDkZALeVAjmRCw7+OC7RHQWa9k0+
+bw8HHa8sHo9gOeL6NlMTOdReJivbPagUvTLrGAMoUgRx5aszPeE4uwc2hGKceeoW
+MPRfwCvocWvk+QIDAQABo1MwUTAPBgNVHRMBAf8EBTADAQH/MB0GA1UdDgQWBBTA
+ephojYn7qwVkDBF9qn1luMrMTjAfBgNVHSMEGDAWgBTAephojYn7qwVkDBF9qn1l
+uMrMTjANBgkqhkiG9w0BAQUFAAOCAQEANeMpauUvXVSOKVCUn5kaFOSPeCpilKIn
+Z57QzxpeR+nBsqTP3UEaBU6bS+5Kb1VSsyShNwrrZHYqLizz/Tt1kL/6cdjHPTfS
+tQWVYrmm3ok9Nns4d0iXrKYgjy6myQzCsplFAMfOEVEiIuCl6rYVSAlk6l5PdPcF
+PseKUgzbFbS9bZvlxrFUaKnjaZC2mqUPuLk/IH2uSrW4nOQdtqvmlKXBx4Ot2/Un
+hw4EbNX/3aBd7YdStysVAq45pmp06drE57xNNB6pXE0zX5IJL4hmXXeXxx12E6nV
+5fEWCRE11azbJHFwLJhWC9kXtNHjUStedejV0NxPNO3CBWaAocvmMw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Universal CA O=GeoTrust Inc.
+# Subject: CN=GeoTrust Universal CA O=GeoTrust Inc.
+# Label: "GeoTrust Universal CA"
+# Serial: 1
+# MD5 Fingerprint: 92:65:58:8b:a2:1a:31:72:73:68:5c:b4:a5:7a:07:48
+# SHA1 Fingerprint: e6:21:f3:35:43:79:05:9a:4b:68:30:9d:8a:2f:74:22:15:87:ec:79
+# SHA256 Fingerprint: a0:45:9b:9f:63:b2:25:59:f5:fa:5d:4c:6d:b3:f9:f7:2f:f1:93:42:03:35:78:f0:73:bf:1d:1b:46:cb:b9:12
+-----BEGIN CERTIFICATE-----
+MIIFaDCCA1CgAwIBAgIBATANBgkqhkiG9w0BAQUFADBFMQswCQYDVQQGEwJVUzEW
+MBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEeMBwGA1UEAxMVR2VvVHJ1c3QgVW5pdmVy
+c2FsIENBMB4XDTA0MDMwNDA1MDAwMFoXDTI5MDMwNDA1MDAwMFowRTELMAkGA1UE
+BhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xHjAcBgNVBAMTFUdlb1RydXN0
+IFVuaXZlcnNhbCBDQTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAKYV
+VaCjxuAfjJ0hUNfBvitbtaSeodlyWL0AG0y/YckUHUWCq8YdgNY96xCcOq9tJPi8
+cQGeBvV8Xx7BDlXKg5pZMK4ZyzBIle0iN430SppyZj6tlcDgFgDgEB8rMQ7XlFTT
+QjOgNB0eRXbdT8oYN+yFFXoZCPzVx5zw8qkuEKmS5j1YPakWaDwvdSEYfyh3peFh
+F7em6fgemdtzbvQKoiFs7tqqhZJmr/Z6a4LauiIINQ/PQvE1+mrufislzDoR5G2v
+c7J2Ha3QsnhnGqQ5HFELZ1aD/ThdDc7d8Lsrlh/eezJS/R27tQahsiFepdaVaH/w
+mZ7cRQg+59IJDTWU3YBOU5fXtQlEIGQWFwMCTFMNaN7VqnJNk22CDtucvc+081xd
+VHppCZbW2xHBjXWotM85yM48vCR85mLK4b19p71XZQvk/iXttmkQ3CgaRr0BHdCX
+teGYO8A3ZNY9lO4L4fUorgtWv3GLIylBjobFS1J72HGrH4oVpjuDWtdYAVHGTEHZ
+f9hBZ3KiKN9gg6meyHv8U3NyWfWTehd2Ds735VzZC1U0oqpbtWpU5xPKV+yXbfRe
+Bi9Fi1jUIxaS5BZuKGNZMN9QAZxjiRqf2xeUgnA3wySemkfWWspOqGmJch+RbNt+
+nhutxx9z3SxPGWX9f5NAEC7S8O08ni4oPmkmM8V7AgMBAAGjYzBhMA8GA1UdEwEB
+/wQFMAMBAf8wHQYDVR0OBBYEFNq7LqqwDLiIJlF0XG0D08DYj3rWMB8GA1UdIwQY
+MBaAFNq7LqqwDLiIJlF0XG0D08DYj3rWMA4GA1UdDwEB/wQEAwIBhjANBgkqhkiG
+9w0BAQUFAAOCAgEAMXjmx7XfuJRAyXHEqDXsRh3ChfMoWIawC/yOsjmPRFWrZIRc
+aanQmjg8+uUfNeVE44B5lGiku8SfPeE0zTBGi1QrlaXv9z+ZhP015s8xxtxqv6fX
+IwjhmF7DWgh2qaavdy+3YL1ERmrvl/9zlcGO6JP7/TG37FcREUWbMPEaiDnBTzyn
+ANXH/KttgCJwpQzgXQQpAvvLoJHRfNbDflDVnVi+QTjruXU8FdmbyUqDWcDaU/0z
+uzYYm4UPFd3uLax2k7nZAY1IEKj79TiG8dsKxr2EoyNB3tZ3b4XUhRxQ4K5RirqN
+Pnbiucon8l+f725ZDQbYKxek0nxru18UGkiPGkzns0ccjkxFKyDuSN/n3QmOGKja
+QI2SJhFTYXNd673nxE0pN2HrrDktZy4W1vUAg4WhzH92xH3kt0tm7wNFYGm2DFKW
+koRepqO1pD4r2czYG0eq8kTaT/kD6PAUyz/zg97QwVTjt+gKN02LIFkDMBmhLMi9
+ER/frslKxfMnZmaGrGiR/9nmUxwPi1xpZQomyB40w11Re9epnAahNt3ViZS82eQt
+DF4JbAiXfKM9fJP/P6EUp8+1Xevb2xzEdt+Iub1FBZUbrvxGakyvSOPOrg/Sfuvm
+bJxPgWp6ZKy7PtXny3YuxadIwVyQD8vIP/rmMuGNG2+k5o7Y+SlIis5z/iw=
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Universal CA 2 O=GeoTrust Inc.
+# Subject: CN=GeoTrust Universal CA 2 O=GeoTrust Inc.
+# Label: "GeoTrust Universal CA 2"
+# Serial: 1
+# MD5 Fingerprint: 34:fc:b8:d0:36:db:9e:14:b3:c2:f2:db:8f:e4:94:c7
+# SHA1 Fingerprint: 37:9a:19:7b:41:85:45:35:0c:a6:03:69:f3:3c:2e:af:47:4f:20:79
+# SHA256 Fingerprint: a0:23:4f:3b:c8:52:7c:a5:62:8e:ec:81:ad:5d:69:89:5d:a5:68:0d:c9:1d:1c:b8:47:7f:33:f8:78:b9:5b:0b
+-----BEGIN CERTIFICATE-----
+MIIFbDCCA1SgAwIBAgIBATANBgkqhkiG9w0BAQUFADBHMQswCQYDVQQGEwJVUzEW
+MBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEgMB4GA1UEAxMXR2VvVHJ1c3QgVW5pdmVy
+c2FsIENBIDIwHhcNMDQwMzA0MDUwMDAwWhcNMjkwMzA0MDUwMDAwWjBHMQswCQYD
+VQQGEwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjEgMB4GA1UEAxMXR2VvVHJ1
+c3QgVW5pdmVyc2FsIENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoIC
+AQCzVFLByT7y2dyxUxpZKeexw0Uo5dfR7cXFS6GqdHtXr0om/Nj1XqduGdt0DE81
+WzILAePb63p3NeqqWuDW6KFXlPCQo3RWlEQwAx5cTiuFJnSCegx2oG9NzkEtoBUG
+FF+3Qs17j1hhNNwqCPkuwwGmIkQcTAeC5lvO0Ep8BNMZcyfwqph/Lq9O64ceJHdq
+XbboW0W63MOhBW9Wjo8QJqVJwy7XQYci4E+GymC16qFjwAGXEHm9ADwSbSsVsaxL
+se4YuU6W3Nx2/zu+z18DwPw76L5GG//aQMJS9/7jOvdqdzXQ2o3rXhhqMcceujwb
+KNZrVMaqW9eiLBsZzKIC9ptZvTdrhrVtgrrY6slWvKk2WP0+GfPtDCapkzj4T8Fd
+IgbQl+rhrcZV4IErKIM6+vR7IVEAvlI4zs1meaj0gVbi0IMJR1FbUGrP20gaXT73
+y/Zl92zxlfgCOzJWgjl6W70viRu/obTo/3+NjN8D8WBOWBFM66M/ECuDmgFz2ZRt
+hAAnZqzwcEAJQpKtT5MNYQlRJNiS1QuUYbKHsu3/mjX/hVTK7URDrBs8FmtISgoc
+QIgfksILAAX/8sgCSqSqqcyZlpwvWOB94b67B9xfBHJcMTTD7F8t4D1kkCLm0ey4
+Lt1ZrtmhN79UNdxzMk+MBB4zsslG8dhcyFVQyWi9qLo2CQIDAQABo2MwYTAPBgNV
+HRMBAf8EBTADAQH/MB0GA1UdDgQWBBR281Xh+qQ2+/CfXGJx7Tz0RzgQKzAfBgNV
+HSMEGDAWgBR281Xh+qQ2+/CfXGJx7Tz0RzgQKzAOBgNVHQ8BAf8EBAMCAYYwDQYJ
+KoZIhvcNAQEFBQADggIBAGbBxiPz2eAubl/oz66wsCVNK/g7WJtAJDday6sWSf+z
+dXkzoS9tcBc0kf5nfo/sm+VegqlVHy/c1FEHEv6sFj4sNcZj/NwQ6w2jqtB8zNHQ
+L1EuxBRa3ugZ4T7GzKQp5y6EqgYweHZUcyiYWTjgAA1i00J9IZ+uPTqM1fp3DRgr
+Fg5fNuH8KrUwJM/gYwx7WBr+mbpCErGR9Hxo4sjoryzqyX6uuyo9DRXcNJW2GHSo
+ag/HtPQTxORb7QrSpJdMKu0vbBKJPfEncKpqA1Ihn0CoZ1Dy81of398j9tx4TuaY
+T1U6U+Pv8vSfx3zYWK8pIpe44L2RLrB27FcRz+8pRPPphXpgY+RdM4kX2TGq2tbz
+GDVyz4crL2MjhF2EjD9XoIj8mZEoJmmZ1I+XRL6O1UixpCgp8RW04eWe3fiPpm8m
+1wk8OhwRDqZsN/etRIcsKMfYdIKz0G9KV7s1KSegi+ghp4dkNl3M2Basx7InQJJV
+OCiNUW7dFGdTbHFcJoRNdVq2fmBWqU2t+5sel/MN2dKXVHfaPRK34B7vCAas+YWH
+6aLcr34YEoP9VhdBLtUpgn2Z9DH2canPLAEnpQW5qrJITirvn5NSUZU8UnOOVkwX
+QMAJKOSLakhT2+zNVVXxxvjpoixMptEmX36vWkzaH6byHCx+rgIW0lbQL1dTR+iS
+-----END CERTIFICATE-----
+
+# Issuer: CN=AAA Certificate Services O=Comodo CA Limited
+# Subject: CN=AAA Certificate Services O=Comodo CA Limited
+# Label: "Comodo AAA Services root"
+# Serial: 1
+# MD5 Fingerprint: 49:79:04:b0:eb:87:19:ac:47:b0:bc:11:51:9b:74:d0
+# SHA1 Fingerprint: d1:eb:23:a4:6d:17:d6:8f:d9:25:64:c2:f1:f1:60:17:64:d8:e3:49
+# SHA256 Fingerprint: d7:a7:a0:fb:5d:7e:27:31:d7:71:e9:48:4e:bc:de:f7:1d:5f:0c:3e:0a:29:48:78:2b:c8:3e:e0:ea:69:9e:f4
+-----BEGIN CERTIFICATE-----
+MIIEMjCCAxqgAwIBAgIBATANBgkqhkiG9w0BAQUFADB7MQswCQYDVQQGEwJHQjEb
+MBkGA1UECAwSR3JlYXRlciBNYW5jaGVzdGVyMRAwDgYDVQQHDAdTYWxmb3JkMRow
+GAYDVQQKDBFDb21vZG8gQ0EgTGltaXRlZDEhMB8GA1UEAwwYQUFBIENlcnRpZmlj
+YXRlIFNlcnZpY2VzMB4XDTA0MDEwMTAwMDAwMFoXDTI4MTIzMTIzNTk1OVowezEL
+MAkGA1UEBhMCR0IxGzAZBgNVBAgMEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UE
+BwwHU2FsZm9yZDEaMBgGA1UECgwRQ29tb2RvIENBIExpbWl0ZWQxITAfBgNVBAMM
+GEFBQSBDZXJ0aWZpY2F0ZSBTZXJ2aWNlczCCASIwDQYJKoZIhvcNAQEBBQADggEP
+ADCCAQoCggEBAL5AnfRu4ep2hxxNRUSOvkbIgwadwSr+GB+O5AL686tdUIoWMQua
+BtDFcCLNSS1UY8y2bmhGC1Pqy0wkwLxyTurxFa70VJoSCsN6sjNg4tqJVfMiWPPe
+3M/vg4aijJRPn2jymJBGhCfHdr/jzDUsi14HZGWCwEiwqJH5YZ92IFCokcdmtet4
+YgNW8IoaE+oxox6gmf049vYnMlhvB/VruPsUK6+3qszWY19zjNoFmag4qMsXeDZR
+rOme9Hg6jc8P2ULimAyrL58OAd7vn5lJ8S3frHRNG5i1R8XlKdH5kBjHYpy+g8cm
+ez6KJcfA3Z3mNWgQIJ2P2N7Sw4ScDV7oL8kCAwEAAaOBwDCBvTAdBgNVHQ4EFgQU
+oBEKIz6W8Qfs4q8p74Klf9AwpLQwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQF
+MAMBAf8wewYDVR0fBHQwcjA4oDagNIYyaHR0cDovL2NybC5jb21vZG9jYS5jb20v
+QUFBQ2VydGlmaWNhdGVTZXJ2aWNlcy5jcmwwNqA0oDKGMGh0dHA6Ly9jcmwuY29t
+b2RvLm5ldC9BQUFDZXJ0aWZpY2F0ZVNlcnZpY2VzLmNybDANBgkqhkiG9w0BAQUF
+AAOCAQEACFb8AvCb6P+k+tZ7xkSAzk/ExfYAWMymtrwUSWgEdujm7l3sAg9g1o1Q
+GE8mTgHj5rCl7r+8dFRBv/38ErjHT1r0iWAFf2C3BUrz9vHCv8S5dIa2LX1rzNLz
+Rt0vxuBqw8M0Ayx9lt1awg6nCpnBBYurDC/zXDrPbDdVCYfeU0BsWO/8tqtlbgT2
+G9w84FoVxp7Z8VlIMCFlA2zs6SFz7JsDoeA3raAVGI/6ugLOpyypEBMs1OUIJqsi
+l2D4kF501KKaU73yqWjgom7C12yxow+ev+to51byrvLjKzg6CYG1a4XXvi3tPxq3
+smPi9WIsgtRqAEFQ8TmDn5XpNpaYbg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root Certification Authority O=QuoVadis Limited OU=Root Certification Authority
+# Subject: CN=QuoVadis Root Certification Authority O=QuoVadis Limited OU=Root Certification Authority
+# Label: "QuoVadis Root CA"
+# Serial: 985026699
+# MD5 Fingerprint: 27:de:36:fe:72:b7:00:03:00:9d:f4:f0:1e:6c:04:24
+# SHA1 Fingerprint: de:3f:40:bd:50:93:d3:9b:6c:60:f6:da:bc:07:62:01:00:89:76:c9
+# SHA256 Fingerprint: a4:5e:de:3b:bb:f0:9c:8a:e1:5c:72:ef:c0:72:68:d6:93:a2:1c:99:6f:d5:1e:67:ca:07:94:60:fd:6d:88:73
+-----BEGIN CERTIFICATE-----
+MIIF0DCCBLigAwIBAgIEOrZQizANBgkqhkiG9w0BAQUFADB/MQswCQYDVQQGEwJC
+TTEZMBcGA1UEChMQUXVvVmFkaXMgTGltaXRlZDElMCMGA1UECxMcUm9vdCBDZXJ0
+aWZpY2F0aW9uIEF1dGhvcml0eTEuMCwGA1UEAxMlUXVvVmFkaXMgUm9vdCBDZXJ0
+aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wMTAzMTkxODMzMzNaFw0yMTAzMTcxODMz
+MzNaMH8xCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMSUw
+IwYDVQQLExxSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MS4wLAYDVQQDEyVR
+dW9WYWRpcyBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG
+9w0BAQEFAAOCAQ8AMIIBCgKCAQEAv2G1lVO6V/z68mcLOhrfEYBklbTRvM16z/Yp
+li4kVEAkOPcahdxYTMukJ0KX0J+DisPkBgNbAKVRHnAEdOLB1Dqr1607BxgFjv2D
+rOpm2RgbaIr1VxqYuvXtdj182d6UajtLF8HVj71lODqV0D1VNk7feVcxKh7YWWVJ
+WCCYfqtffp/p1k3sg3Spx2zY7ilKhSoGFPlU5tPaZQeLYzcS19Dsw3sgQUSj7cug
+F+FxZc4dZjH3dgEZyH0DWLaVSR2mEiboxgx24ONmy+pdpibu5cxfvWenAScOospU
+xbF6lR1xHkopigPcakXBpBlebzbNw6Kwt/5cOOJSvPhEQ+aQuwIDAQABo4ICUjCC
+Ak4wPQYIKwYBBQUHAQEEMTAvMC0GCCsGAQUFBzABhiFodHRwczovL29jc3AucXVv
+dmFkaXNvZmZzaG9yZS5jb20wDwYDVR0TAQH/BAUwAwEB/zCCARoGA1UdIASCAREw
+ggENMIIBCQYJKwYBBAG+WAABMIH7MIHUBggrBgEFBQcCAjCBxxqBxFJlbGlhbmNl
+IG9uIHRoZSBRdW9WYWRpcyBSb290IENlcnRpZmljYXRlIGJ5IGFueSBwYXJ0eSBh
+c3N1bWVzIGFjY2VwdGFuY2Ugb2YgdGhlIHRoZW4gYXBwbGljYWJsZSBzdGFuZGFy
+ZCB0ZXJtcyBhbmQgY29uZGl0aW9ucyBvZiB1c2UsIGNlcnRpZmljYXRpb24gcHJh
+Y3RpY2VzLCBhbmQgdGhlIFF1b1ZhZGlzIENlcnRpZmljYXRlIFBvbGljeS4wIgYI
+KwYBBQUHAgEWFmh0dHA6Ly93d3cucXVvdmFkaXMuYm0wHQYDVR0OBBYEFItLbe3T
+KbkGGew5Oanwl4Rqy+/fMIGuBgNVHSMEgaYwgaOAFItLbe3TKbkGGew5Oanwl4Rq
+y+/foYGEpIGBMH8xCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1p
+dGVkMSUwIwYDVQQLExxSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MS4wLAYD
+VQQDEyVRdW9WYWRpcyBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5ggQ6tlCL
+MA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQUFAAOCAQEAitQUtf70mpKnGdSk
+fnIYj9lofFIk3WdvOXrEql494liwTXCYhGHoG+NpGA7O+0dQoE7/8CQfvbLO9Sf8
+7C9TqnN7Az10buYWnuulLsS/VidQK2K6vkscPFVcQR0kvoIgR13VRH56FmjffU1R
+cHhXHTMe/QKZnAzNCgVPx7uOpHX6Sm2xgI4JVrmcGmD+XcHXetwReNDWXcG31a0y
+mQM6isxUJTkxgXsTIlG6Rmyhu576BGxJJnSP0nPrzDCi5upZIof4l/UO/erMkqQW
+xFIY6iHOsfHmhIHluqmGKPJDWl0Snawe2ajlCmqnf6CHKc/yiU3U7MXi5nrQNiOK
+SnQ2+Q==
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root CA 2 O=QuoVadis Limited
+# Subject: CN=QuoVadis Root CA 2 O=QuoVadis Limited
+# Label: "QuoVadis Root CA 2"
+# Serial: 1289
+# MD5 Fingerprint: 5e:39:7b:dd:f8:ba:ec:82:e9:ac:62:ba:0c:54:00:2b
+# SHA1 Fingerprint: ca:3a:fb:cf:12:40:36:4b:44:b2:16:20:88:80:48:39:19:93:7c:f7
+# SHA256 Fingerprint: 85:a0:dd:7d:d7:20:ad:b7:ff:05:f8:3d:54:2b:20:9d:c7:ff:45:28:f7:d6:77:b1:83:89:fe:a5:e5:c4:9e:86
+-----BEGIN CERTIFICATE-----
+MIIFtzCCA5+gAwIBAgICBQkwDQYJKoZIhvcNAQEFBQAwRTELMAkGA1UEBhMCQk0x
+GTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMTElF1b1ZhZGlzIFJv
+b3QgQ0EgMjAeFw0wNjExMjQxODI3MDBaFw0zMTExMjQxODIzMzNaMEUxCzAJBgNV
+BAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMRswGQYDVQQDExJRdW9W
+YWRpcyBSb290IENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCa
+GMpLlA0ALa8DKYrwD4HIrkwZhR0In6spRIXzL4GtMh6QRr+jhiYaHv5+HBg6XJxg
+Fyo6dIMzMH1hVBHL7avg5tKifvVrbxi3Cgst/ek+7wrGsxDp3MJGF/hd/aTa/55J
+WpzmM+Yklvc/ulsrHHo1wtZn/qtmUIttKGAr79dgw8eTvI02kfN/+NsRE8Scd3bB
+rrcCaoF6qUWD4gXmuVbBlDePSHFjIuwXZQeVikvfj8ZaCuWw419eaxGrDPmF60Tp
++ARz8un+XJiM9XOva7R+zdRcAitMOeGylZUtQofX1bOQQ7dsE/He3fbE+Ik/0XX1
+ksOR1YqI0JDs3G3eicJlcZaLDQP9nL9bFqyS2+r+eXyt66/3FsvbzSUr5R/7mp/i
+Ucw6UwxI5g69ybR2BlLmEROFcmMDBOAENisgGQLodKcftslWZvB1JdxnwQ5hYIiz
+PtGo/KPaHbDRsSNU30R2be1B2MGyIrZTHN81Hdyhdyox5C315eXbyOD/5YDXC2Og
+/zOhD7osFRXql7PSorW+8oyWHhqPHWykYTe5hnMz15eWniN9gqRMgeKh0bpnX5UH
+oycR7hYQe7xFSkyyBNKr79X9DFHOUGoIMfmR2gyPZFwDwzqLID9ujWc9Otb+fVuI
+yV77zGHcizN300QyNQliBJIWENieJ0f7OyHj+OsdWwIDAQABo4GwMIGtMA8GA1Ud
+EwEB/wQFMAMBAf8wCwYDVR0PBAQDAgEGMB0GA1UdDgQWBBQahGK8SEwzJQTU7tD2
+A8QZRtGUazBuBgNVHSMEZzBlgBQahGK8SEwzJQTU7tD2A8QZRtGUa6FJpEcwRTEL
+MAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMT
+ElF1b1ZhZGlzIFJvb3QgQ0EgMoICBQkwDQYJKoZIhvcNAQEFBQADggIBAD4KFk2f
+BluornFdLwUvZ+YTRYPENvbzwCYMDbVHZF34tHLJRqUDGCdViXh9duqWNIAXINzn
+g/iN/Ae42l9NLmeyhP3ZRPx3UIHmfLTJDQtyU/h2BwdBR5YM++CCJpNVjP4iH2Bl
+fF/nJrP3MpCYUNQ3cVX2kiF495V5+vgtJodmVjB3pjd4M1IQWK4/YY7yarHvGH5K
+WWPKjaJW1acvvFYfzznB4vsKqBUsfU16Y8Zsl0Q80m/DShcK+JDSV6IZUaUtl0Ha
+B0+pUNqQjZRG4T7wlP0QADj1O+hA4bRuVhogzG9Yje0uRY/W6ZM/57Es3zrWIozc
+hLsib9D45MY56QSIPMO661V6bYCZJPVsAfv4l7CUW+v90m/xd2gNNWQjrLhVoQPR
+TUIZ3Ph1WVaj+ahJefivDrkRoHy3au000LYmYjgahwz46P0u05B/B5EqHdZ+XIWD
+mbA4CD/pXvk1B+TJYm5Xf6dQlfe6yJvmjqIBxdZmv3lh8zwc4bmCXF2gw+nYSL0Z
+ohEUGW6yhhtoPkg3Goi3XZZenMfvJ2II4pEZXNLxId26F0KCl3GBUzGpn/Z9Yr9y
+4aOTHcyKJloJONDO1w2AFrR4pTqHTI2KpdVGl/IsELm8VCLAAVBpQ570su9t+Oza
+8eOx79+Rj1QqCyXBJhnEUhAFZdWCEOrCMc0u
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root CA 3 O=QuoVadis Limited
+# Subject: CN=QuoVadis Root CA 3 O=QuoVadis Limited
+# Label: "QuoVadis Root CA 3"
+# Serial: 1478
+# MD5 Fingerprint: 31:85:3c:62:94:97:63:b9:aa:fd:89:4e:af:6f:e0:cf
+# SHA1 Fingerprint: 1f:49:14:f7:d8:74:95:1d:dd:ae:02:c0:be:fd:3a:2d:82:75:51:85
+# SHA256 Fingerprint: 18:f1:fc:7f:20:5d:f8:ad:dd:eb:7f:e0:07:dd:57:e3:af:37:5a:9c:4d:8d:73:54:6b:f4:f1:fe:d1:e1:8d:35
+-----BEGIN CERTIFICATE-----
+MIIGnTCCBIWgAwIBAgICBcYwDQYJKoZIhvcNAQEFBQAwRTELMAkGA1UEBhMCQk0x
+GTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxGzAZBgNVBAMTElF1b1ZhZGlzIFJv
+b3QgQ0EgMzAeFw0wNjExMjQxOTExMjNaFw0zMTExMjQxOTA2NDRaMEUxCzAJBgNV
+BAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBMaW1pdGVkMRswGQYDVQQDExJRdW9W
+YWRpcyBSb290IENBIDMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDM
+V0IWVJzmmNPTTe7+7cefQzlKZbPoFog02w1ZkXTPkrgEQK0CSzGrvI2RaNggDhoB
+4hp7Thdd4oq3P5kazethq8Jlph+3t723j/z9cI8LoGe+AaJZz3HmDyl2/7FWeUUr
+H556VOijKTVopAFPD6QuN+8bv+OPEKhyq1hX51SGyMnzW9os2l2ObjyjPtr7guXd
+8lyyBTNvijbO0BNO/79KDDRMpsMhvVAEVeuxu537RR5kFd5VAYwCdrXLoT9Cabwv
+vWhDFlaJKjdhkf2mrk7AyxRllDdLkgbvBNDInIjbC3uBr7E9KsRlOni27tyAsdLT
+mZw67mtaa7ONt9XOnMK+pUsvFrGeaDsGb659n/je7Mwpp5ijJUMv7/FfJuGITfhe
+btfZFG4ZM2mnO4SJk8RTVROhUXhA+LjJou57ulJCg54U7QVSWllWp5f8nT8KKdjc
+T5EOE7zelaTfi5m+rJsziO+1ga8bxiJTyPbH7pcUsMV8eFLI8M5ud2CEpukqdiDt
+WAEXMJPpGovgc2PZapKUSU60rUqFxKMiMPwJ7Wgic6aIDFUhWMXhOp8q3crhkODZ
+c6tsgLjoC2SToJyMGf+z0gzskSaHirOi4XCPLArlzW1oUevaPwV/izLmE1xr/l9A
+4iLItLRkT9a6fUg+qGkM17uGcclzuD87nSVL2v9A6wIDAQABo4IBlTCCAZEwDwYD
+VR0TAQH/BAUwAwEB/zCB4QYDVR0gBIHZMIHWMIHTBgkrBgEEAb5YAAMwgcUwgZMG
+CCsGAQUFBwICMIGGGoGDQW55IHVzZSBvZiB0aGlzIENlcnRpZmljYXRlIGNvbnN0
+aXR1dGVzIGFjY2VwdGFuY2Ugb2YgdGhlIFF1b1ZhZGlzIFJvb3QgQ0EgMyBDZXJ0
+aWZpY2F0ZSBQb2xpY3kgLyBDZXJ0aWZpY2F0aW9uIFByYWN0aWNlIFN0YXRlbWVu
+dC4wLQYIKwYBBQUHAgEWIWh0dHA6Ly93d3cucXVvdmFkaXNnbG9iYWwuY29tL2Nw
+czALBgNVHQ8EBAMCAQYwHQYDVR0OBBYEFPLAE+CCQz777i9nMpY1XNu4ywLQMG4G
+A1UdIwRnMGWAFPLAE+CCQz777i9nMpY1XNu4ywLQoUmkRzBFMQswCQYDVQQGEwJC
+TTEZMBcGA1UEChMQUXVvVmFkaXMgTGltaXRlZDEbMBkGA1UEAxMSUXVvVmFkaXMg
+Um9vdCBDQSAzggIFxjANBgkqhkiG9w0BAQUFAAOCAgEAT62gLEz6wPJv92ZVqyM0
+7ucp2sNbtrCD2dDQ4iH782CnO11gUyeim/YIIirnv6By5ZwkajGxkHon24QRiSem
+d1o417+shvzuXYO8BsbRd2sPbSQvS3pspweWyuOEn62Iix2rFo1bZhfZFvSLgNLd
++LJ2w/w4E6oM3kJpK27zPOuAJ9v1pkQNn1pVWQvVDVJIxa6f8i+AxeoyUDUSly7B
+4f/xI4hROJ/yZlZ25w9Rl6VSDE1JUZU2Pb+iSwwQHYaZTKrzchGT5Or2m9qoXadN
+t54CrnMAyNojA+j56hl0YgCUyyIgvpSnWbWCar6ZeXqp8kokUvd0/bpO5qgdAm6x
+DYBEwa7TIzdfu4V8K5Iu6H6li92Z4b8nby1dqnuH/grdS/yO9SbkbnBCbjPsMZ57
+k8HkyWkaPcBrTiJt7qtYTcbQQcEr6k8Sh17rRdhs9ZgC06DYVYoGmRmioHfRMJ6s
+zHXug/WwYjnPbFfiTNKRCw51KBuav/0aQ/HKd/s7j2G4aSgWQgRecCocIdiP4b0j
+Wy10QJLZYxkNc91pvGJHvOB0K7Lrfb5BG7XARsWhIstfTsEokt4YutUqKLsRixeT
+mJlglFwjz1onl14LBQaTNx47aTbrqZ5hHY8y2o4M1nQ+ewkk2gF3R8Q7zTSMmfXK
+4SVhM7JZG+Ju1zdXtg2pEto=
+-----END CERTIFICATE-----
+
+# Issuer: O=SECOM Trust.net OU=Security Communication RootCA1
+# Subject: O=SECOM Trust.net OU=Security Communication RootCA1
+# Label: "Security Communication Root CA"
+# Serial: 0
+# MD5 Fingerprint: f1:bc:63:6a:54:e0:b5:27:f5:cd:e7:1a:e3:4d:6e:4a
+# SHA1 Fingerprint: 36:b1:2b:49:f9:81:9e:d7:4c:9e:bc:38:0f:c6:56:8f:5d:ac:b2:f7
+# SHA256 Fingerprint: e7:5e:72:ed:9f:56:0e:ec:6e:b4:80:00:73:a4:3f:c3:ad:19:19:5a:39:22:82:01:78:95:97:4a:99:02:6b:6c
+-----BEGIN CERTIFICATE-----
+MIIDWjCCAkKgAwIBAgIBADANBgkqhkiG9w0BAQUFADBQMQswCQYDVQQGEwJKUDEY
+MBYGA1UEChMPU0VDT00gVHJ1c3QubmV0MScwJQYDVQQLEx5TZWN1cml0eSBDb21t
+dW5pY2F0aW9uIFJvb3RDQTEwHhcNMDMwOTMwMDQyMDQ5WhcNMjMwOTMwMDQyMDQ5
+WjBQMQswCQYDVQQGEwJKUDEYMBYGA1UEChMPU0VDT00gVHJ1c3QubmV0MScwJQYD
+VQQLEx5TZWN1cml0eSBDb21tdW5pY2F0aW9uIFJvb3RDQTEwggEiMA0GCSqGSIb3
+DQEBAQUAA4IBDwAwggEKAoIBAQCzs/5/022x7xZ8V6UMbXaKL0u/ZPtM7orw8yl8
+9f/uKuDp6bpbZCKamm8sOiZpUQWZJtzVHGpxxpp9Hp3dfGzGjGdnSj74cbAZJ6kJ
+DKaVv0uMDPpVmDvY6CKhS3E4eayXkmmziX7qIWgGmBSWh9JhNrxtJ1aeV+7AwFb9
+Ms+k2Y7CI9eNqPPYJayX5HA49LY6tJ07lyZDo6G8SVlyTCMwhwFY9k6+HGhWZq/N
+QV3Is00qVUarH9oe4kA92819uZKAnDfdDJZkndwi92SL32HeFZRSFaB9UslLqCHJ
+xrHty8OVYNEP8Ktw+N/LTX7s1vqr2b1/VPKl6Xn62dZ2JChzAgMBAAGjPzA9MB0G
+A1UdDgQWBBSgc0mZaNyFW2XjmygvV5+9M7wHSDALBgNVHQ8EBAMCAQYwDwYDVR0T
+AQH/BAUwAwEB/zANBgkqhkiG9w0BAQUFAAOCAQEAaECpqLvkT115swW1F7NgE+vG
+kl3g0dNq/vu+m22/xwVtWSDEHPC32oRYAmP6SBbvT6UL90qY8j+eG61Ha2POCEfr
+Uj94nK9NrvjVT8+amCoQQTlSxN3Zmw7vkwGusi7KaEIkQmywszo+zenaSMQVy+n5
+Bw+SUEmK3TGXX8npN6o7WWWXlDLJs58+OmJYxUmtYg5xpTKqL8aJdkNAExNnPaJU
+JRDL8Try2frbSVa7pv6nQTXD4IhhyYjH3zYQIphZ6rBK+1YWc26sTfcioU+tHXot
+RSflMMFe8toTyyVCUZVHA4xsIcx0Qu1T/zOLjw9XARYvz6buyXAiFL39vmwLAw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Sonera Class2 CA O=Sonera
+# Subject: CN=Sonera Class2 CA O=Sonera
+# Label: "Sonera Class 2 Root CA"
+# Serial: 29
+# MD5 Fingerprint: a3:ec:75:0f:2e:88:df:fa:48:01:4e:0b:5c:48:6f:fb
+# SHA1 Fingerprint: 37:f7:6d:e6:07:7c:90:c5:b1:3e:93:1a:b7:41:10:b4:f2:e4:9a:27
+# SHA256 Fingerprint: 79:08:b4:03:14:c1:38:10:0b:51:8d:07:35:80:7f:fb:fc:f8:51:8a:00:95:33:71:05:ba:38:6b:15:3d:d9:27
+-----BEGIN CERTIFICATE-----
+MIIDIDCCAgigAwIBAgIBHTANBgkqhkiG9w0BAQUFADA5MQswCQYDVQQGEwJGSTEP
+MA0GA1UEChMGU29uZXJhMRkwFwYDVQQDExBTb25lcmEgQ2xhc3MyIENBMB4XDTAx
+MDQwNjA3Mjk0MFoXDTIxMDQwNjA3Mjk0MFowOTELMAkGA1UEBhMCRkkxDzANBgNV
+BAoTBlNvbmVyYTEZMBcGA1UEAxMQU29uZXJhIENsYXNzMiBDQTCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAJAXSjWdyvANlsdE+hY3/Ei9vX+ALTU74W+o
+Z6m/AxxNjG8yR9VBaKQTBME1DJqEQ/xcHf+Js+gXGM2RX/uJ4+q/Tl18GybTdXnt
+5oTjV+WtKcT0OijnpXuENmmz/V52vaMtmdOQTiMofRhj8VQ7Jp12W5dCsv+u8E7s
+3TmVToMGf+dJQMjFAbJUWmYdPfz56TwKnoG4cPABi+QjVHzIrviQHgCWctRUz2Ej
+vOr7nQKV0ba5cTppCD8PtOFCx4j1P5iop7oc4HFx71hXgVB6XGt0Rg6DA5jDjqhu
+8nYybieDwnPz3BjotJPqdURrBGAgcVeHnfO+oJAjPYok4doh28MCAwEAAaMzMDEw
+DwYDVR0TAQH/BAUwAwEB/zARBgNVHQ4ECgQISqCqWITTXjwwCwYDVR0PBAQDAgEG
+MA0GCSqGSIb3DQEBBQUAA4IBAQBazof5FnIVV0sd2ZvnoiYw7JNn39Yt0jSv9zil
+zqsWuasvfDXLrNAPtEwr/IDva4yRXzZ299uzGxnq9LIR/WFxRL8oszodv7ND6J+/
+3DEIcbCdjdY0RzKQxmUk96BKfARzjzlvF4xytb1LyHr4e4PDKE6cCepnP7JnBBvD
+FNr450kkkdAdavphOe9r5yF1BgfYErQhIHBCcYHaPJo2vqZbDWpsmh+Re/n570K6
+Tk6ezAyNlNzZRZxe7EJQY670XcSxEtzKO6gunRRaBXW37Ndj4ro1tgQIkejanZz2
+ZrUYrAqmVCY0M9IbwdR/GjqOC6oybtv8TyWf2TLHllpwrN9M
+-----END CERTIFICATE-----
+
+# Issuer: CN=XRamp Global Certification Authority O=XRamp Security Services Inc OU=www.xrampsecurity.com
+# Subject: CN=XRamp Global Certification Authority O=XRamp Security Services Inc OU=www.xrampsecurity.com
+# Label: "XRamp Global CA Root"
+# Serial: 107108908803651509692980124233745014957
+# MD5 Fingerprint: a1:0b:44:b3:ca:10:d8:00:6e:9d:0f:d8:0f:92:0a:d1
+# SHA1 Fingerprint: b8:01:86:d1:eb:9c:86:a5:41:04:cf:30:54:f3:4c:52:b7:e5:58:c6
+# SHA256 Fingerprint: ce:cd:dc:90:50:99:d8:da:df:c5:b1:d2:09:b7:37:cb:e2:c1:8c:fb:2c:10:c0:ff:0b:cf:0d:32:86:fc:1a:a2
+-----BEGIN CERTIFICATE-----
+MIIEMDCCAxigAwIBAgIQUJRs7Bjq1ZxN1ZfvdY+grTANBgkqhkiG9w0BAQUFADCB
+gjELMAkGA1UEBhMCVVMxHjAcBgNVBAsTFXd3dy54cmFtcHNlY3VyaXR5LmNvbTEk
+MCIGA1UEChMbWFJhbXAgU2VjdXJpdHkgU2VydmljZXMgSW5jMS0wKwYDVQQDEyRY
+UmFtcCBHbG9iYWwgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDQxMTAxMTcx
+NDA0WhcNMzUwMTAxMDUzNzE5WjCBgjELMAkGA1UEBhMCVVMxHjAcBgNVBAsTFXd3
+dy54cmFtcHNlY3VyaXR5LmNvbTEkMCIGA1UEChMbWFJhbXAgU2VjdXJpdHkgU2Vy
+dmljZXMgSW5jMS0wKwYDVQQDEyRYUmFtcCBHbG9iYWwgQ2VydGlmaWNhdGlvbiBB
+dXRob3JpdHkwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCYJB69FbS6
+38eMpSe2OAtp87ZOqCwuIR1cRN8hXX4jdP5efrRKt6atH67gBhbim1vZZ3RrXYCP
+KZ2GG9mcDZhtdhAoWORlsH9KmHmf4MMxfoArtYzAQDsRhtDLooY2YKTVMIJt2W7Q
+DxIEM5dfT2Fa8OT5kavnHTu86M/0ay00fOJIYRyO82FEzG+gSqmUsE3a56k0enI4
+qEHMPJQRfevIpoy3hsvKMzvZPTeL+3o+hiznc9cKV6xkmxnr9A8ECIqsAxcZZPRa
+JSKNNCyy9mgdEm3Tih4U2sSPpuIjhdV6Db1q4Ons7Be7QhtnqiXtRYMh/MHJfNVi
+PvryxS3T/dRlAgMBAAGjgZ8wgZwwEwYJKwYBBAGCNxQCBAYeBABDAEEwCwYDVR0P
+BAQDAgGGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFMZPoj0GY4QJnM5i5ASs
+jVy16bYbMDYGA1UdHwQvMC0wK6ApoCeGJWh0dHA6Ly9jcmwueHJhbXBzZWN1cml0
+eS5jb20vWEdDQS5jcmwwEAYJKwYBBAGCNxUBBAMCAQEwDQYJKoZIhvcNAQEFBQAD
+ggEBAJEVOQMBG2f7Shz5CmBbodpNl2L5JFMn14JkTpAuw0kbK5rc/Kh4ZzXxHfAR
+vbdI4xD2Dd8/0sm2qlWkSLoC295ZLhVbO50WfUfXN+pfTXYSNrsf16GBBEYgoyxt
+qZ4Bfj8pzgCT3/3JknOJiWSe5yvkHJEs0rnOfc5vMZnT5r7SHpDwCRR5XCOrTdLa
+IR9NmXmd4c8nnxCbHIgNsIpkQTG4DmyQJKSbXHGPurt+HBvbaoAPIbzp26a3QPSy
+i6mx5O+aGtA9aZnuqCij4Tyz8LIRnM98QObd50N9otg6tamN8jSZxNQQ4Qb9CYQQ
+O+7ETPTsJ3xCwnR8gooJybQDJbw=
+-----END CERTIFICATE-----
+
+# Issuer: O=The Go Daddy Group, Inc. OU=Go Daddy Class 2 Certification Authority
+# Subject: O=The Go Daddy Group, Inc. OU=Go Daddy Class 2 Certification Authority
+# Label: "Go Daddy Class 2 CA"
+# Serial: 0
+# MD5 Fingerprint: 91:de:06:25:ab:da:fd:32:17:0c:bb:25:17:2a:84:67
+# SHA1 Fingerprint: 27:96:ba:e6:3f:18:01:e2:77:26:1b:a0:d7:77:70:02:8f:20:ee:e4
+# SHA256 Fingerprint: c3:84:6b:f2:4b:9e:93:ca:64:27:4c:0e:c6:7c:1e:cc:5e:02:4f:fc:ac:d2:d7:40:19:35:0e:81:fe:54:6a:e4
+-----BEGIN CERTIFICATE-----
+MIIEADCCAuigAwIBAgIBADANBgkqhkiG9w0BAQUFADBjMQswCQYDVQQGEwJVUzEh
+MB8GA1UEChMYVGhlIEdvIERhZGR5IEdyb3VwLCBJbmMuMTEwLwYDVQQLEyhHbyBE
+YWRkeSBDbGFzcyAyIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTA0MDYyOTE3
+MDYyMFoXDTM0MDYyOTE3MDYyMFowYzELMAkGA1UEBhMCVVMxITAfBgNVBAoTGFRo
+ZSBHbyBEYWRkeSBHcm91cCwgSW5jLjExMC8GA1UECxMoR28gRGFkZHkgQ2xhc3Mg
+MiBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTCCASAwDQYJKoZIhvcNAQEBBQADggEN
+ADCCAQgCggEBAN6d1+pXGEmhW+vXX0iG6r7d/+TvZxz0ZWizV3GgXne77ZtJ6XCA
+PVYYYwhv2vLM0D9/AlQiVBDYsoHUwHU9S3/Hd8M+eKsaA7Ugay9qK7HFiH7Eux6w
+wdhFJ2+qN1j3hybX2C32qRe3H3I2TqYXP2WYktsqbl2i/ojgC95/5Y0V4evLOtXi
+EqITLdiOr18SPaAIBQi2XKVlOARFmR6jYGB0xUGlcmIbYsUfb18aQr4CUWWoriMY
+avx4A6lNf4DD+qta/KFApMoZFv6yyO9ecw3ud72a9nmYvLEHZ6IVDd2gWMZEewo+
+YihfukEHU1jPEX44dMX4/7VpkI+EdOqXG68CAQOjgcAwgb0wHQYDVR0OBBYEFNLE
+sNKR1EwRcbNhyz2h/t2oatTjMIGNBgNVHSMEgYUwgYKAFNLEsNKR1EwRcbNhyz2h
+/t2oatTjoWekZTBjMQswCQYDVQQGEwJVUzEhMB8GA1UEChMYVGhlIEdvIERhZGR5
+IEdyb3VwLCBJbmMuMTEwLwYDVQQLEyhHbyBEYWRkeSBDbGFzcyAyIENlcnRpZmlj
+YXRpb24gQXV0aG9yaXR5ggEAMAwGA1UdEwQFMAMBAf8wDQYJKoZIhvcNAQEFBQAD
+ggEBADJL87LKPpH8EsahB4yOd6AzBhRckB4Y9wimPQoZ+YeAEW5p5JYXMP80kWNy
+OO7MHAGjHZQopDH2esRU1/blMVgDoszOYtuURXO1v0XJJLXVggKtI3lpjbi2Tc7P
+TMozI+gciKqdi0FuFskg5YmezTvacPd+mSYgFFQlq25zheabIZ0KbIIOqPjCDPoQ
+HmyW74cNxA9hi63ugyuV+I6ShHI56yDqg+2DzZduCLzrTia2cyvk0/ZM/iZx4mER
+dEr/VxqHD3VILs9RaRegAhJhldXRQLIQTO7ErBBDpqWeCtWVYpoNz4iCxTIM5Cuf
+ReYNnyicsbkqWletNw+vHX/bvZ8=
+-----END CERTIFICATE-----
+
+# Issuer: O=Starfield Technologies, Inc. OU=Starfield Class 2 Certification Authority
+# Subject: O=Starfield Technologies, Inc. OU=Starfield Class 2 Certification Authority
+# Label: "Starfield Class 2 CA"
+# Serial: 0
+# MD5 Fingerprint: 32:4a:4b:bb:c8:63:69:9b:be:74:9a:c6:dd:1d:46:24
+# SHA1 Fingerprint: ad:7e:1c:28:b0:64:ef:8f:60:03:40:20:14:c3:d0:e3:37:0e:b5:8a
+# SHA256 Fingerprint: 14:65:fa:20:53:97:b8:76:fa:a6:f0:a9:95:8e:55:90:e4:0f:cc:7f:aa:4f:b7:c2:c8:67:75:21:fb:5f:b6:58
+-----BEGIN CERTIFICATE-----
+MIIEDzCCAvegAwIBAgIBADANBgkqhkiG9w0BAQUFADBoMQswCQYDVQQGEwJVUzEl
+MCMGA1UEChMcU3RhcmZpZWxkIFRlY2hub2xvZ2llcywgSW5jLjEyMDAGA1UECxMp
+U3RhcmZpZWxkIENsYXNzIDIgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDQw
+NjI5MTczOTE2WhcNMzQwNjI5MTczOTE2WjBoMQswCQYDVQQGEwJVUzElMCMGA1UE
+ChMcU3RhcmZpZWxkIFRlY2hub2xvZ2llcywgSW5jLjEyMDAGA1UECxMpU3RhcmZp
+ZWxkIENsYXNzIDIgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwggEgMA0GCSqGSIb3
+DQEBAQUAA4IBDQAwggEIAoIBAQC3Msj+6XGmBIWtDBFk385N78gDGIc/oav7PKaf
+8MOh2tTYbitTkPskpD6E8J7oX+zlJ0T1KKY/e97gKvDIr1MvnsoFAZMej2YcOadN
++lq2cwQlZut3f+dZxkqZJRRU6ybH838Z1TBwj6+wRir/resp7defqgSHo9T5iaU0
+X9tDkYI22WY8sbi5gv2cOj4QyDvvBmVmepsZGD3/cVE8MC5fvj13c7JdBmzDI1aa
+K4UmkhynArPkPw2vCHmCuDY96pzTNbO8acr1zJ3o/WSNF4Azbl5KXZnJHoe0nRrA
+1W4TNSNe35tfPe/W93bC6j67eA0cQmdrBNj41tpvi/JEoAGrAgEDo4HFMIHCMB0G
+A1UdDgQWBBS/X7fRzt0fhvRbVazc1xDCDqmI5zCBkgYDVR0jBIGKMIGHgBS/X7fR
+zt0fhvRbVazc1xDCDqmI56FspGowaDELMAkGA1UEBhMCVVMxJTAjBgNVBAoTHFN0
+YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xMjAwBgNVBAsTKVN0YXJmaWVsZCBD
+bGFzcyAyIENlcnRpZmljYXRpb24gQXV0aG9yaXR5ggEAMAwGA1UdEwQFMAMBAf8w
+DQYJKoZIhvcNAQEFBQADggEBAAWdP4id0ckaVaGsafPzWdqbAYcaT1epoXkJKtv3
+L7IezMdeatiDh6GX70k1PncGQVhiv45YuApnP+yz3SFmH8lU+nLMPUxA2IGvd56D
+eruix/U0F47ZEUD0/CwqTRV/p2JdLiXTAAsgGh1o+Re49L2L7ShZ3U0WixeDyLJl
+xy16paq8U4Zt3VekyvggQQto8PT7dL5WXXp59fkdheMtlb71cZBDzI0fmgAKhynp
+VSJYACPq4xJDKVtHCN2MQWplBqjlIapBtJUhlbl90TSrE9atvNziPTnNvT51cKEY
+WQPJIrSPnNVeKtelttQKbfi3QBFGmh95DmK/D5fs4C8fF5Q=
+-----END CERTIFICATE-----
+
+# Issuer: O=Government Root Certification Authority
+# Subject: O=Government Root Certification Authority
+# Label: "Taiwan GRCA"
+# Serial: 42023070807708724159991140556527066870
+# MD5 Fingerprint: 37:85:44:53:32:45:1f:20:f0:f3:95:e1:25:c4:43:4e
+# SHA1 Fingerprint: f4:8b:11:bf:de:ab:be:94:54:20:71:e6:41:de:6b:be:88:2b:40:b9
+# SHA256 Fingerprint: 76:00:29:5e:ef:e8:5b:9e:1f:d6:24:db:76:06:2a:aa:ae:59:81:8a:54:d2:77:4c:d4:c0:b2:c0:11:31:e1:b3
+-----BEGIN CERTIFICATE-----
+MIIFcjCCA1qgAwIBAgIQH51ZWtcvwgZEpYAIaeNe9jANBgkqhkiG9w0BAQUFADA/
+MQswCQYDVQQGEwJUVzEwMC4GA1UECgwnR292ZXJubWVudCBSb290IENlcnRpZmlj
+YXRpb24gQXV0aG9yaXR5MB4XDTAyMTIwNTEzMjMzM1oXDTMyMTIwNTEzMjMzM1ow
+PzELMAkGA1UEBhMCVFcxMDAuBgNVBAoMJ0dvdmVybm1lbnQgUm9vdCBDZXJ0aWZp
+Y2F0aW9uIEF1dGhvcml0eTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIB
+AJoluOzMonWoe/fOW1mKydGGEghU7Jzy50b2iPN86aXfTEc2pBsBHH8eV4qNw8XR
+IePaJD9IK/ufLqGU5ywck9G/GwGHU5nOp/UKIXZ3/6m3xnOUT0b3EEk3+qhZSV1q
+gQdW8or5BtD3cCJNtLdBuTK4sfCxw5w/cP1T3YGq2GN49thTbqGsaoQkclSGxtKy
+yhwOeYHWtXBiCAEuTk8O1RGvqa/lmr/czIdtJuTJV6L7lvnM4T9TjGxMfptTCAts
+F/tnyMKtsc2AtJfcdgEWFelq16TheEfOhtX7MfP6Mb40qij7cEwdScevLJ1tZqa2
+jWR+tSBqnTuBto9AAGdLiYa4zGX+FVPpBMHWXx1E1wovJ5pGfaENda1UhhXcSTvx
+ls4Pm6Dso3pdvtUqdULle96ltqqvKKyskKw4t9VoNSZ63Pc78/1Fm9G7Q3hub/FC
+VGqY8A2tl+lSXunVanLeavcbYBT0peS2cWeqH+riTcFCQP5nRhc4L0c/cZyu5SHK
+YS1tB6iEfC3uUSXxY5Ce/eFXiGvviiNtsea9P63RPZYLhY3Naye7twWb7LuRqQoH
+EgKXTiCQ8P8NHuJBO9NAOueNXdpm5AKwB1KYXA6OM5zCppX7VRluTI6uSw+9wThN
+Xo+EHWbNxWCWtFJaBYmOlXqYwZE8lSOyDvR5tMl8wUohAgMBAAGjajBoMB0GA1Ud
+DgQWBBTMzO/MKWCkO7GStjz6MmKPrCUVOzAMBgNVHRMEBTADAQH/MDkGBGcqBwAE
+MTAvMC0CAQAwCQYFKw4DAhoFADAHBgVnKgMAAAQUA5vwIhP/lSg209yewDL7MTqK
+UWUwDQYJKoZIhvcNAQEFBQADggIBAECASvomyc5eMN1PhnR2WPWus4MzeKR6dBcZ
+TulStbngCnRiqmjKeKBMmo4sIy7VahIkv9Ro04rQ2JyftB8M3jh+Vzj8jeJPXgyf
+qzvS/3WXy6TjZwj/5cAWtUgBfen5Cv8b5Wppv3ghqMKnI6mGq3ZW6A4M9hPdKmaK
+ZEk9GhiHkASfQlK3T8v+R0F2Ne//AHY2RTKbxkaFXeIksB7jSJaYV0eUVXoPQbFE
+JPPB/hprv4j9wabak2BegUqZIJxIZhm1AHlUD7gsL0u8qV1bYH+Mh6XgUmMqvtg7
+hUAV/h62ZT/FS9p+tXo1KaMuephgIqP0fSdOLeq0dDzpD6QzDxARvBMB1uUO07+1
+EqLhRSPAzAhuYbeJq4PjJB7mXQfnHyA+z2fI56wwbSdLaG5LKlwCCDTb+HbkZ6Mm
+nD+iMsJKxYEYMRBWqoTvLQr/uB930r+lWKBi5NdLkXWNiYCYfm3LU05er/ayl4WX
+udpVBrkk7tfGOB5jGxI7leFYrPLfhNVfmS8NVVvmONsuP3LpSIXLuykTjx44Vbnz
+ssQwmSNOXfJIoRIM3BKQCZBUkQM8R+XVyWXgt0t97EfTsws+rZ7QdAAO671RrcDe
+LMDDav7v3Aun+kbfYNucpllQdSNpc5Oy+fwC00fmcc4QAu4njIT/rEUNE1yDMuAl
+pYYsfPQS
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Assured ID Root CA O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Assured ID Root CA O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Assured ID Root CA"
+# Serial: 17154717934120587862167794914071425081
+# MD5 Fingerprint: 87:ce:0b:7b:2a:0e:49:00:e1:58:71:9b:37:a8:93:72
+# SHA1 Fingerprint: 05:63:b8:63:0d:62:d7:5a:bb:c8:ab:1e:4b:df:b5:a8:99:b2:4d:43
+# SHA256 Fingerprint: 3e:90:99:b5:01:5e:8f:48:6c:00:bc:ea:9d:11:1e:e7:21:fa:ba:35:5a:89:bc:f1:df:69:56:1e:3d:c6:32:5c
+-----BEGIN CERTIFICATE-----
+MIIDtzCCAp+gAwIBAgIQDOfg5RfYRv6P5WD8G/AwOTANBgkqhkiG9w0BAQUFADBl
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJv
+b3QgQ0EwHhcNMDYxMTEwMDAwMDAwWhcNMzExMTEwMDAwMDAwWjBlMQswCQYDVQQG
+EwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNl
+cnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgQ0EwggEi
+MA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCtDhXO5EOAXLGH87dg+XESpa7c
+JpSIqvTO9SA5KFhgDPiA2qkVlTJhPLWxKISKityfCgyDF3qPkKyK53lTXDGEKvYP
+mDI2dsze3Tyoou9q+yHyUmHfnyDXH+Kx2f4YZNISW1/5WBg1vEfNoTb5a3/UsDg+
+wRvDjDPZ2C8Y/igPs6eD1sNuRMBhNZYW/lmci3Zt1/GiSw0r/wty2p5g0I6QNcZ4
+VYcgoc/lbQrISXwxmDNsIumH0DJaoroTghHtORedmTpyoeb6pNnVFzF1roV9Iq4/
+AUaG9ih5yLHa5FcXxH4cDrC0kqZWs72yl+2qp/C3xag/lRbQ/6GW6whfGHdPAgMB
+AAGjYzBhMA4GA1UdDwEB/wQEAwIBhjAPBgNVHRMBAf8EBTADAQH/MB0GA1UdDgQW
+BBRF66Kv9JLLgjEtUYunpyGd823IDzAfBgNVHSMEGDAWgBRF66Kv9JLLgjEtUYun
+pyGd823IDzANBgkqhkiG9w0BAQUFAAOCAQEAog683+Lt8ONyc3pklL/3cmbYMuRC
+dWKuh+vy1dneVrOfzM4UKLkNl2BcEkxY5NM9g0lFWJc1aRqoR+pWxnmrEthngYTf
+fwk8lOa4JiwgvT2zKIn3X/8i4peEH+ll74fg38FnSbNd67IJKusm7Xi+fT8r87cm
+NW1fiQG2SVufAQWbqz0lwcy2f8Lxb4bG+mRo64EtlOtCt/qMHt1i8b5QZ7dsvfPx
+H2sMNgcWfzd8qVttevESRmCD1ycEvkvOl77DZypoEd+A5wwzZr8TDRRu838fYxAe
++o0bJW1sj6W3YQGx0qMmoRBxna3iw/nDmVG3KwcIzi7mULKn+gpFL6Lw8g==
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Global Root CA O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Global Root CA O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Global Root CA"
+# Serial: 10944719598952040374951832963794454346
+# MD5 Fingerprint: 79:e4:a9:84:0d:7d:3a:96:d7:c0:4f:e2:43:4c:89:2e
+# SHA1 Fingerprint: a8:98:5d:3a:65:e5:e5:c4:b2:d7:d6:6d:40:c6:dd:2f:b1:9c:54:36
+# SHA256 Fingerprint: 43:48:a0:e9:44:4c:78:cb:26:5e:05:8d:5e:89:44:b4:d8:4f:96:62:bd:26:db:25:7f:89:34:a4:43:c7:01:61
+-----BEGIN CERTIFICATE-----
+MIIDrzCCApegAwIBAgIQCDvgVpBCRrGhdWrJWZHHSjANBgkqhkiG9w0BAQUFADBh
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBD
+QTAeFw0wNjExMTAwMDAwMDBaFw0zMTExMTAwMDAwMDBaMGExCzAJBgNVBAYTAlVT
+MRUwEwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5j
+b20xIDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IENBMIIBIjANBgkqhkiG
+9w0BAQEFAAOCAQ8AMIIBCgKCAQEA4jvhEXLeqKTTo1eqUKKPC3eQyaKl7hLOllsB
+CSDMAZOnTjC3U/dDxGkAV53ijSLdhwZAAIEJzs4bg7/fzTtxRuLWZscFs3YnFo97
+nh6Vfe63SKMI2tavegw5BmV/Sl0fvBf4q77uKNd0f3p4mVmFaG5cIzJLv07A6Fpt
+43C/dxC//AH2hdmoRBBYMql1GNXRor5H4idq9Joz+EkIYIvUX7Q6hL+hqkpMfT7P
+T19sdl6gSzeRntwi5m3OFBqOasv+zbMUZBfHWymeMr/y7vrTC0LUq7dBMtoM1O/4
+gdW7jVg/tRvoSSiicNoxBN33shbyTApOB6jtSj1etX+jkMOvJwIDAQABo2MwYTAO
+BgNVHQ8BAf8EBAMCAYYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUA95QNVbR
+TLtm8KPiGxvDl7I90VUwHwYDVR0jBBgwFoAUA95QNVbRTLtm8KPiGxvDl7I90VUw
+DQYJKoZIhvcNAQEFBQADggEBAMucN6pIExIK+t1EnE9SsPTfrgT1eXkIoyQY/Esr
+hMAtudXH/vTBH1jLuG2cenTnmCmrEbXjcKChzUyImZOMkXDiqw8cvpOp/2PV5Adg
+06O/nVsJ8dWO41P0jmP6P6fbtGbfYmbW0W5BjfIttep3Sp+dWOIrWcBAI+0tKIJF
+PnlUkiaY4IBIqDfv8NZ5YBberOgOzW6sRBc4L0na4UU+Krk2U886UAb3LujEV0ls
+YSEY1QSteDwsOoBrp+uvFRTp2InBuThs4pFsiv9kuXclVzDAGySj4dzp30d8tbQk
+CAUw7C29C79Fv1C5qfPrmAESrciIxpg0X40KPMbp1ZWVbd4=
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert High Assurance EV Root CA O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert High Assurance EV Root CA O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert High Assurance EV Root CA"
+# Serial: 3553400076410547919724730734378100087
+# MD5 Fingerprint: d4:74:de:57:5c:39:b2:d3:9c:85:83:c5:c0:65:49:8a
+# SHA1 Fingerprint: 5f:b7:ee:06:33:e2:59:db:ad:0c:4c:9a:e6:d3:8f:1a:61:c7:dc:25
+# SHA256 Fingerprint: 74:31:e5:f4:c3:c1:ce:46:90:77:4f:0b:61:e0:54:40:88:3b:a9:a0:1e:d0:0b:a6:ab:d7:80:6e:d3:b1:18:cf
+-----BEGIN CERTIFICATE-----
+MIIDxTCCAq2gAwIBAgIQAqxcJmoLQJuPC3nyrkYldzANBgkqhkiG9w0BAQUFADBs
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSswKQYDVQQDEyJEaWdpQ2VydCBIaWdoIEFzc3VyYW5j
+ZSBFViBSb290IENBMB4XDTA2MTExMDAwMDAwMFoXDTMxMTExMDAwMDAwMFowbDEL
+MAkGA1UEBhMCVVMxFTATBgNVBAoTDERpZ2lDZXJ0IEluYzEZMBcGA1UECxMQd3d3
+LmRpZ2ljZXJ0LmNvbTErMCkGA1UEAxMiRGlnaUNlcnQgSGlnaCBBc3N1cmFuY2Ug
+RVYgUm9vdCBDQTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAMbM5XPm
++9S75S0tMqbf5YE/yc0lSbZxKsPVlDRnogocsF9ppkCxxLeyj9CYpKlBWTrT3JTW
+PNt0OKRKzE0lgvdKpVMSOO7zSW1xkX5jtqumX8OkhPhPYlG++MXs2ziS4wblCJEM
+xChBVfvLWokVfnHoNb9Ncgk9vjo4UFt3MRuNs8ckRZqnrG0AFFoEt7oT61EKmEFB
+Ik5lYYeBQVCmeVyJ3hlKV9Uu5l0cUyx+mM0aBhakaHPQNAQTXKFx01p8VdteZOE3
+hzBWBOURtCmAEvF5OYiiAhF8J2a3iLd48soKqDirCmTCv2ZdlYTBoSUeh10aUAsg
+EsxBu24LUTi4S8sCAwEAAaNjMGEwDgYDVR0PAQH/BAQDAgGGMA8GA1UdEwEB/wQF
+MAMBAf8wHQYDVR0OBBYEFLE+w2kD+L9HAdSYJhoIAu9jZCvDMB8GA1UdIwQYMBaA
+FLE+w2kD+L9HAdSYJhoIAu9jZCvDMA0GCSqGSIb3DQEBBQUAA4IBAQAcGgaX3Nec
+nzyIZgYIVyHbIUf4KmeqvxgydkAQV8GK83rZEWWONfqe/EW1ntlMMUu4kehDLI6z
+eM7b41N5cdblIZQB2lWHmiRk9opmzN6cN82oNLFpmyPInngiK3BD41VHMWEZ71jF
+hS9OMPagMRYjyOfiZRYzy78aG6A9+MpeizGLYAiJLQwGXFK3xPkKmNEVX58Svnw2
+Yzi9RKR/5CYrCsSXaQ3pjOLAEFe4yHYSkVXySGnYvCoCWw9E1CAx2/S6cCZdkGCe
+vEsXCS+0yx5DaMkHJ8HSXPfqIbloEpw8nL+e/IBcm2PN7EeqJSdnoDfzAIJ9VNep
++OkuE6N36B9K
+-----END CERTIFICATE-----
+
+# Issuer: CN=DST Root CA X3 O=Digital Signature Trust Co.
+# Subject: CN=DST Root CA X3 O=Digital Signature Trust Co.
+# Label: "DST Root CA X3"
+# Serial: 91299735575339953335919266965803778155
+# MD5 Fingerprint: 41:03:52:dc:0f:f7:50:1b:16:f0:02:8e:ba:6f:45:c5
+# SHA1 Fingerprint: da:c9:02:4f:54:d8:f6:df:94:93:5f:b1:73:26:38:ca:6a:d7:7c:13
+# SHA256 Fingerprint: 06:87:26:03:31:a7:24:03:d9:09:f1:05:e6:9b:cf:0d:32:e1:bd:24:93:ff:c6:d9:20:6d:11:bc:d6:77:07:39
+-----BEGIN CERTIFICATE-----
+MIIDSjCCAjKgAwIBAgIQRK+wgNajJ7qJMDmGLvhAazANBgkqhkiG9w0BAQUFADA/
+MSQwIgYDVQQKExtEaWdpdGFsIFNpZ25hdHVyZSBUcnVzdCBDby4xFzAVBgNVBAMT
+DkRTVCBSb290IENBIFgzMB4XDTAwMDkzMDIxMTIxOVoXDTIxMDkzMDE0MDExNVow
+PzEkMCIGA1UEChMbRGlnaXRhbCBTaWduYXR1cmUgVHJ1c3QgQ28uMRcwFQYDVQQD
+Ew5EU1QgUm9vdCBDQSBYMzCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEB
+AN+v6ZdQCINXtMxiZfaQguzH0yxrMMpb7NnDfcdAwRgUi+DoM3ZJKuM/IUmTrE4O
+rz5Iy2Xu/NMhD2XSKtkyj4zl93ewEnu1lcCJo6m67XMuegwGMoOifooUMM0RoOEq
+OLl5CjH9UL2AZd+3UWODyOKIYepLYYHsUmu5ouJLGiifSKOeDNoJjj4XLh7dIN9b
+xiqKqy69cK3FCxolkHRyxXtqqzTWMIn/5WgTe1QLyNau7Fqckh49ZLOMxt+/yUFw
+7BZy1SbsOFU5Q9D8/RhcQPGX69Wam40dutolucbY38EVAjqr2m7xPi71XAicPNaD
+aeQQmxkqtilX4+U9m5/wAl0CAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNV
+HQ8BAf8EBAMCAQYwHQYDVR0OBBYEFMSnsaR7LHH62+FLkHX/xBVghYkQMA0GCSqG
+SIb3DQEBBQUAA4IBAQCjGiybFwBcqR7uKGY3Or+Dxz9LwwmglSBd49lZRNI+DT69
+ikugdB/OEIKcdBodfpga3csTS7MgROSR6cz8faXbauX+5v3gTt23ADq1cEmv8uXr
+AvHRAosZy5Q6XkjEGB5YGV8eAlrwDPGxrancWYaLbumR9YbK+rlmM6pZW87ipxZz
+R8srzJmwN0jP41ZL9c8PDHIyh8bwRLtTcm1D9SZImlJnt1ir/md2cXjbDaJWFBM5
+JDGFoqgCWjBH4d1QB7wCCZAA62RjYJsWvIjJEubSfZGL+T0yjWW06XyxV3bqxbYo
+Ob8VZRzI9neWagqNdwvYkQsEjgfbKbYK7p2CNTUQ
+-----END CERTIFICATE-----
+
+# Issuer: CN=SwissSign Gold CA - G2 O=SwissSign AG
+# Subject: CN=SwissSign Gold CA - G2 O=SwissSign AG
+# Label: "SwissSign Gold CA - G2"
+# Serial: 13492815561806991280
+# MD5 Fingerprint: 24:77:d9:a8:91:d1:3b:fa:88:2d:c2:ff:f8:cd:33:93
+# SHA1 Fingerprint: d8:c5:38:8a:b7:30:1b:1b:6e:d4:7a:e6:45:25:3a:6f:9f:1a:27:61
+# SHA256 Fingerprint: 62:dd:0b:e9:b9:f5:0a:16:3e:a0:f8:e7:5c:05:3b:1e:ca:57:ea:55:c8:68:8f:64:7c:68:81:f2:c8:35:7b:95
+-----BEGIN CERTIFICATE-----
+MIIFujCCA6KgAwIBAgIJALtAHEP1Xk+wMA0GCSqGSIb3DQEBBQUAMEUxCzAJBgNV
+BAYTAkNIMRUwEwYDVQQKEwxTd2lzc1NpZ24gQUcxHzAdBgNVBAMTFlN3aXNzU2ln
+biBHb2xkIENBIC0gRzIwHhcNMDYxMDI1MDgzMDM1WhcNMzYxMDI1MDgzMDM1WjBF
+MQswCQYDVQQGEwJDSDEVMBMGA1UEChMMU3dpc3NTaWduIEFHMR8wHQYDVQQDExZT
+d2lzc1NpZ24gR29sZCBDQSAtIEcyMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIIC
+CgKCAgEAr+TufoskDhJuqVAtFkQ7kpJcyrhdhJJCEyq8ZVeCQD5XJM1QiyUqt2/8
+76LQwB8CJEoTlo8jE+YoWACjR8cGp4QjK7u9lit/VcyLwVcfDmJlD909Vopz2q5+
+bbqBHH5CjCA12UNNhPqE21Is8w4ndwtrvxEvcnifLtg+5hg3Wipy+dpikJKVyh+c
+6bM8K8vzARO/Ws/BtQpgvd21mWRTuKCWs2/iJneRjOBiEAKfNA+k1ZIzUd6+jbqE
+emA8atufK+ze3gE/bk3lUIbLtK/tREDFylqM2tIrfKjuvqblCqoOpd8FUrdVxyJd
+MmqXl2MT28nbeTZ7hTpKxVKJ+STnnXepgv9VHKVxaSvRAiTysybUa9oEVeXBCsdt
+MDeQKuSeFDNeFhdVxVu1yzSJkvGdJo+hB9TGsnhQ2wwMC3wLjEHXuendjIj3o02y
+MszYF9rNt85mndT9Xv+9lz4pded+p2JYryU0pUHHPbwNUMoDAw8IWh+Vc3hiv69y
+FGkOpeUDDniOJihC8AcLYiAQZzlG+qkDzAQ4embvIIO1jEpWjpEA/I5cgt6IoMPi
+aG59je883WX0XaxR7ySArqpWl2/5rX3aYT+YdzylkbYcjCbaZaIJbcHiVOO5ykxM
+gI93e2CaHt+28kgeDrpOVG2Y4OGiGqJ3UM/EY5LsRxmd6+ZrzsECAwEAAaOBrDCB
+qTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUWyV7
+lqRlUX64OfPAeGZe6Drn8O4wHwYDVR0jBBgwFoAUWyV7lqRlUX64OfPAeGZe6Drn
+8O4wRgYDVR0gBD8wPTA7BglghXQBWQECAQEwLjAsBggrBgEFBQcCARYgaHR0cDov
+L3JlcG9zaXRvcnkuc3dpc3NzaWduLmNvbS8wDQYJKoZIhvcNAQEFBQADggIBACe6
+45R88a7A3hfm5djV9VSwg/S7zV4Fe0+fdWavPOhWfvxyeDgD2StiGwC5+OlgzczO
+UYrHUDFu4Up+GC9pWbY9ZIEr44OE5iKHjn3g7gKZYbge9LgriBIWhMIxkziWMaa5
+O1M/wySTVltpkuzFwbs4AOPsF6m43Md8AYOfMke6UiI0HTJ6CVanfCU2qT1L2sCC
+bwq7EsiHSycR+R4tx5M/nttfJmtS2S6K8RTGRI0Vqbe/vd6mGu6uLftIdxf+u+yv
+GPUqUfA5hJeVbG4bwyvEdGB5JbAKJ9/fXtI5z0V9QkvfsywexcZdylU6oJxpmo/a
+77KwPJ+HbBIrZXAVUjEaJM9vMSNQH4xPjyPDdEFjHFWoFN0+4FFQz/EbMFYOkrCC
+hdiDyyJkvC24JdVUorgG6q2SpCSgwYa1ShNqR88uC1aVVMvOmttqtKay20EIhid3
+92qgQmwLOM7XdVAyksLfKzAiSNDVQTglXaTpXZ/GlHXQRf0wl0OPkKsKx4ZzYEpp
+Ld6leNcG2mqeSz53OiATIgHQv2ieY2BrNU0LbbqhPcCT4H8js1WtciVORvnSFu+w
+ZMEBnunKoGqYDs/YYPIvSbjkQuE4NRb0yG5P94FW6LqjviOvrv1vA+ACOzB2+htt
+Qc8Bsem4yWb02ybzOqR08kkkW8mw0FfB+j564ZfJ
+-----END CERTIFICATE-----
+
+# Issuer: CN=SwissSign Silver CA - G2 O=SwissSign AG
+# Subject: CN=SwissSign Silver CA - G2 O=SwissSign AG
+# Label: "SwissSign Silver CA - G2"
+# Serial: 5700383053117599563
+# MD5 Fingerprint: e0:06:a1:c9:7d:cf:c9:fc:0d:c0:56:75:96:d8:62:13
+# SHA1 Fingerprint: 9b:aa:e5:9f:56:ee:21:cb:43:5a:be:25:93:df:a7:f0:40:d1:1d:cb
+# SHA256 Fingerprint: be:6c:4d:a2:bb:b9:ba:59:b6:f3:93:97:68:37:42:46:c3:c0:05:99:3f:a9:8f:02:0d:1d:ed:be:d4:8a:81:d5
+-----BEGIN CERTIFICATE-----
+MIIFvTCCA6WgAwIBAgIITxvUL1S7L0swDQYJKoZIhvcNAQEFBQAwRzELMAkGA1UE
+BhMCQ0gxFTATBgNVBAoTDFN3aXNzU2lnbiBBRzEhMB8GA1UEAxMYU3dpc3NTaWdu
+IFNpbHZlciBDQSAtIEcyMB4XDTA2MTAyNTA4MzI0NloXDTM2MTAyNTA4MzI0Nlow
+RzELMAkGA1UEBhMCQ0gxFTATBgNVBAoTDFN3aXNzU2lnbiBBRzEhMB8GA1UEAxMY
+U3dpc3NTaWduIFNpbHZlciBDQSAtIEcyMIICIjANBgkqhkiG9w0BAQEFAAOCAg8A
+MIICCgKCAgEAxPGHf9N4Mfc4yfjDmUO8x/e8N+dOcbpLj6VzHVxumK4DV644N0Mv
+Fz0fyM5oEMF4rhkDKxD6LHmD9ui5aLlV8gREpzn5/ASLHvGiTSf5YXu6t+WiE7br
+YT7QbNHm+/pe7R20nqA1W6GSy/BJkv6FCgU+5tkL4k+73JU3/JHpMjUi0R86TieF
+nbAVlDLaYQ1HTWBCrpJH6INaUFjpiou5XaHc3ZlKHzZnu0jkg7Y360g6rw9njxcH
+6ATK72oxh9TAtvmUcXtnZLi2kUpCe2UuMGoM9ZDulebyzYLs2aFK7PayS+VFheZt
+eJMELpyCbTapxDFkH4aDCyr0NQp4yVXPQbBH6TCfmb5hqAaEuSh6XzjZG6k4sIN/
+c8HDO0gqgg8hm7jMqDXDhBuDsz6+pJVpATqJAHgE2cn0mRmrVn5bi4Y5FZGkECwJ
+MoBgs5PAKrYYC51+jUnyEEp/+dVGLxmSo5mnJqy7jDzmDrxHB9xzUfFwZC8I+bRH
+HTBsROopN4WSaGa8gzj+ezku01DwH/teYLappvonQfGbGHLy9YR0SslnxFSuSGTf
+jNFusB3hB48IHpmccelM2KX3RxIfdNFRnobzwqIjQAtz20um53MGjMGg6cFZrEb6
+5i/4z3GcRm25xBWNOHkDRUjvxF3XCO6HOSKGsg0PWEP3calILv3q1h8CAwEAAaOB
+rDCBqTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQU
+F6DNweRBtjpbO8tFnb0cwpj6hlgwHwYDVR0jBBgwFoAUF6DNweRBtjpbO8tFnb0c
+wpj6hlgwRgYDVR0gBD8wPTA7BglghXQBWQEDAQEwLjAsBggrBgEFBQcCARYgaHR0
+cDovL3JlcG9zaXRvcnkuc3dpc3NzaWduLmNvbS8wDQYJKoZIhvcNAQEFBQADggIB
+AHPGgeAn0i0P4JUw4ppBf1AsX19iYamGamkYDHRJ1l2E6kFSGG9YrVBWIGrGvShp
+WJHckRE1qTodvBqlYJ7YH39FkWnZfrt4csEGDyrOj4VwYaygzQu4OSlWhDJOhrs9
+xCrZ1x9y7v5RoSJBsXECYxqCsGKrXlcSH9/L3XWgwF15kIwb4FDm3jH+mHtwX6WQ
+2K34ArZv02DdQEsixT2tOnqfGhpHkXkzuoLcMmkDlm4fS/Bx/uNncqCxv1yL5PqZ
+IseEuRuNI5c/7SXgz2W79WEE790eslpBIlqhn10s6FvJbakMDHiqYMZWjwFaDGi8
+aRl5xB9+lwW/xekkUV7U1UtT7dkjWjYDZaPBA61BMPNGG4WQr2W11bHkFlt4dR2X
+em1ZqSqPe97Dh4kQmUlzeMg9vVE1dCrV8X5pGyq7O70luJpaPXJhkGaH7gzWTdQR
+dAtq/gsD/KNVV4n+SsuuWxcFyPKNIzFTONItaj+CuY0IavdeQXRuwxF+B6wpYJE/
+OMpXEA29MC/HpeZBoNquBYeaoKRlbEwJDIm6uNO5wJOKMPqN5ZprFQFOZ6raYlY+
+hAhm0sQ2fac+EPyI4NSA5QC9qvNOBqN6avlicuMJT+ubDgEj8Z+7fNzcbBGXJbLy
+tGMU0gYqZ4yD9c7qB9iaah7s5Aq7KkzrCWA5zspi2C5u
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Primary Certification Authority O=GeoTrust Inc.
+# Subject: CN=GeoTrust Primary Certification Authority O=GeoTrust Inc.
+# Label: "GeoTrust Primary Certification Authority"
+# Serial: 32798226551256963324313806436981982369
+# MD5 Fingerprint: 02:26:c3:01:5e:08:30:37:43:a9:d0:7d:cf:37:e6:bf
+# SHA1 Fingerprint: 32:3c:11:8e:1b:f7:b8:b6:52:54:e2:e2:10:0d:d6:02:90:37:f0:96
+# SHA256 Fingerprint: 37:d5:10:06:c5:12:ea:ab:62:64:21:f1:ec:8c:92:01:3f:c5:f8:2a:e9:8e:e5:33:eb:46:19:b8:de:b4:d0:6c
+-----BEGIN CERTIFICATE-----
+MIIDfDCCAmSgAwIBAgIQGKy1av1pthU6Y2yv2vrEoTANBgkqhkiG9w0BAQUFADBY
+MQswCQYDVQQGEwJVUzEWMBQGA1UEChMNR2VvVHJ1c3QgSW5jLjExMC8GA1UEAxMo
+R2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wNjEx
+MjcwMDAwMDBaFw0zNjA3MTYyMzU5NTlaMFgxCzAJBgNVBAYTAlVTMRYwFAYDVQQK
+Ew1HZW9UcnVzdCBJbmMuMTEwLwYDVQQDEyhHZW9UcnVzdCBQcmltYXJ5IENlcnRp
+ZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC
+AQEAvrgVe//UfH1nrYNke8hCUy3f9oQIIGHWAVlqnEQRr+92/ZV+zmEwu3qDXwK9
+AWbK7hWNb6EwnL2hhZ6UOvNWiAAxz9juapYC2e0DjPt1befquFUWBRaa9OBesYjA
+ZIVcFU2Ix7e64HXprQU9nceJSOC7KMgD4TCTZF5SwFlwIjVXiIrxlQqD17wxcwE0
+7e9GceBrAqg1cmuXm2bgyxx5X9gaBGgeRwLmnWDiNpcB3841kt++Z8dtd1k7j53W
+kBWUvEI0EME5+bEnPn7WinXFsq+W06Lem+SYvn3h6YGttm/81w7a4DSwDRp35+MI
+mO9Y+pyEtzavwt+s0vQQBnBxNQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4G
+A1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQULNVQQZcVi/CPNmFbSvtr2ZnJM5IwDQYJ
+KoZIhvcNAQEFBQADggEBAFpwfyzdtzRP9YZRqSa+S7iq8XEN3GHHoOo0Hnp3DwQ1
+6CePbJC/kRYkRj5KTs4rFtULUh38H2eiAkUxT87z+gOneZ1TatnaYzr4gNfTmeGl
+4b7UVXGYNTq+k+qurUKykG/g/CFNNWMziUnWm07Kx+dOCQD32sfvmWKZd7aVIl6K
+oKv0uHiYyjgZmclynnjNS6yvGaBzEi38wkG6gZHaFloxt/m0cYASSJlyc1pZU8Fj
+UjPtp8nSOQJw+uCxQmYpqptR7TBUIhRf2asdweSU8Pj1K/fqynhG1riR/aYNKxoU
+AT6A8EKglQdebc3MS6RFjasS6LPeWuWgfOgPIh1a6Vk=
+-----END CERTIFICATE-----
+
+# Issuer: CN=thawte Primary Root CA O=thawte, Inc. OU=Certification Services Division/(c) 2006 thawte, Inc. - For authorized use only
+# Subject: CN=thawte Primary Root CA O=thawte, Inc. OU=Certification Services Division/(c) 2006 thawte, Inc. - For authorized use only
+# Label: "thawte Primary Root CA"
+# Serial: 69529181992039203566298953787712940909
+# MD5 Fingerprint: 8c:ca:dc:0b:22:ce:f5:be:72:ac:41:1a:11:a8:d8:12
+# SHA1 Fingerprint: 91:c6:d6:ee:3e:8a:c8:63:84:e5:48:c2:99:29:5c:75:6c:81:7b:81
+# SHA256 Fingerprint: 8d:72:2f:81:a9:c1:13:c0:79:1d:f1:36:a2:96:6d:b2:6c:95:0a:97:1d:b4:6b:41:99:f4:ea:54:b7:8b:fb:9f
+-----BEGIN CERTIFICATE-----
+MIIEIDCCAwigAwIBAgIQNE7VVyDV7exJ9C/ON9srbTANBgkqhkiG9w0BAQUFADCB
+qTELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjEoMCYGA1UECxMf
+Q2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYGA1UECxMvKGMpIDIw
+MDYgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxHzAdBgNV
+BAMTFnRoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EwHhcNMDYxMTE3MDAwMDAwWhcNMzYw
+NzE2MjM1OTU5WjCBqTELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5j
+LjEoMCYGA1UECxMfQ2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYG
+A1UECxMvKGMpIDIwMDYgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNl
+IG9ubHkxHzAdBgNVBAMTFnRoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EwggEiMA0GCSqG
+SIb3DQEBAQUAA4IBDwAwggEKAoIBAQCsoPD7gFnUnMekz52hWXMJEEUMDSxuaPFs
+W0hoSVk3/AszGcJ3f8wQLZU0HObrTQmnHNK4yZc2AreJ1CRfBsDMRJSUjQJib+ta
+3RGNKJpchJAQeg29dGYvajig4tVUROsdB58Hum/u6f1OCyn1PoSgAfGcq/gcfomk
+6KHYcWUNo1F77rzSImANuVud37r8UVsLr5iy6S7pBOhih94ryNdOwUxkHt3Ph1i6
+Sk/KaAcdHJ1KxtUvkcx8cXIcxcBn6zL9yZJclNqFwJu/U30rCfSMnZEfl2pSy94J
+NqR32HuHUETVPm4pafs5SSYeCaWAe0At6+gnhcn+Yf1+5nyXHdWdAgMBAAGjQjBA
+MA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBR7W0XP
+r87Lev0xkhpqtvNG61dIUDANBgkqhkiG9w0BAQUFAAOCAQEAeRHAS7ORtvzw6WfU
+DW5FvlXok9LOAz/t2iWwHVfLHjp2oEzsUHboZHIMpKnxuIvW1oeEuzLlQRHAd9mz
+YJ3rG9XRbkREqaYB7FViHXe4XI5ISXycO1cRrK1zN44veFyQaEfZYGDm/Ac9IiAX
+xPcW6cTYcvnIc3zfFi8VqT79aie2oetaupgf1eNNZAqdE8hhuvU5HIe6uL17In/2
+/qxAeeWsEG89jxt5dovEN7MhGITlNgDrYyCZuen+MwS7QcjBAvlEYyCegc5C09Y/
+LHbTY5xZ3Y+m4Q6gLkH3LpVHz7z9M/P2C2F+fpErgUfCJzDupxBdN49cOSvkBPB7
+jVaMaA==
+-----END CERTIFICATE-----
+
+# Issuer: CN=VeriSign Class 3 Public Primary Certification Authority - G5 O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2006 VeriSign, Inc. - For authorized use only
+# Subject: CN=VeriSign Class 3 Public Primary Certification Authority - G5 O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2006 VeriSign, Inc. - For authorized use only
+# Label: "VeriSign Class 3 Public Primary Certification Authority - G5"
+# Serial: 33037644167568058970164719475676101450
+# MD5 Fingerprint: cb:17:e4:31:67:3e:e2:09:fe:45:57:93:f3:0a:fa:1c
+# SHA1 Fingerprint: 4e:b6:d5:78:49:9b:1c:cf:5f:58:1e:ad:56:be:3d:9b:67:44:a5:e5
+# SHA256 Fingerprint: 9a:cf:ab:7e:43:c8:d8:80:d0:6b:26:2a:94:de:ee:e4:b4:65:99:89:c3:d0:ca:f1:9b:af:64:05:e4:1a:b7:df
+-----BEGIN CERTIFICATE-----
+MIIE0zCCA7ugAwIBAgIQGNrRniZ96LtKIVjNzGs7SjANBgkqhkiG9w0BAQUFADCB
+yjELMAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQL
+ExZWZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNiBWZXJp
+U2lnbiwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxW
+ZXJpU2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0
+aG9yaXR5IC0gRzUwHhcNMDYxMTA4MDAwMDAwWhcNMzYwNzE2MjM1OTU5WjCByjEL
+MAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZW
+ZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNiBWZXJpU2ln
+biwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJp
+U2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9y
+aXR5IC0gRzUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCvJAgIKXo1
+nmAMqudLO07cfLw8RRy7K+D+KQL5VwijZIUVJ/XxrcgxiV0i6CqqpkKzj/i5Vbex
+t0uz/o9+B1fs70PbZmIVYc9gDaTY3vjgw2IIPVQT60nKWVSFJuUrjxuf6/WhkcIz
+SdhDY2pSS9KP6HBRTdGJaXvHcPaz3BJ023tdS1bTlr8Vd6Gw9KIl8q8ckmcY5fQG
+BO+QueQA5N06tRn/Arr0PO7gi+s3i+z016zy9vA9r911kTMZHRxAy3QkGSGT2RT+
+rCpSx4/VBEnkjWNHiDxpg8v+R70rfk/Fla4OndTRQ8Bnc+MUCH7lP59zuDMKz10/
+NIeWiu5T6CUVAgMBAAGjgbIwga8wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8E
+BAMCAQYwbQYIKwYBBQUHAQwEYTBfoV2gWzBZMFcwVRYJaW1hZ2UvZ2lmMCEwHzAH
+BgUrDgMCGgQUj+XTGoasjY5rw8+AatRIGCx7GS4wJRYjaHR0cDovL2xvZ28udmVy
+aXNpZ24uY29tL3ZzbG9nby5naWYwHQYDVR0OBBYEFH/TZafC3ey78DAJ80M5+gKv
+MzEzMA0GCSqGSIb3DQEBBQUAA4IBAQCTJEowX2LP2BqYLz3q3JktvXf2pXkiOOzE
+p6B4Eq1iDkVwZMXnl2YtmAl+X6/WzChl8gGqCBpH3vn5fJJaCGkgDdk+bW48DW7Y
+5gaRQBi5+MHt39tBquCWIMnNZBU4gcmU7qKEKQsTb47bDN0lAtukixlE0kF6BWlK
+WE9gyn6CagsCqiUXObXbf+eEZSqVir2G3l6BFoMtEMze/aiCKm0oHw0LxOXnGiYZ
+4fQRbxC1lfznQgUy286dUV4otp6F01vvpX1FQHKOtw5rDgb7MzVIcbidJ4vEZV8N
+hnacRHr2lVz2XTIIM6RUthg/aFzyQkqFOFSDX9HoLPKsEdao7WNq
+-----END CERTIFICATE-----
+
+# Issuer: CN=SecureTrust CA O=SecureTrust Corporation
+# Subject: CN=SecureTrust CA O=SecureTrust Corporation
+# Label: "SecureTrust CA"
+# Serial: 17199774589125277788362757014266862032
+# MD5 Fingerprint: dc:32:c3:a7:6d:25:57:c7:68:09:9d:ea:2d:a9:a2:d1
+# SHA1 Fingerprint: 87:82:c6:c3:04:35:3b:cf:d2:96:92:d2:59:3e:7d:44:d9:34:ff:11
+# SHA256 Fingerprint: f1:c1:b5:0a:e5:a2:0d:d8:03:0e:c9:f6:bc:24:82:3d:d3:67:b5:25:57:59:b4:e7:1b:61:fc:e9:f7:37:5d:73
+-----BEGIN CERTIFICATE-----
+MIIDuDCCAqCgAwIBAgIQDPCOXAgWpa1Cf/DrJxhZ0DANBgkqhkiG9w0BAQUFADBI
+MQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3QgQ29ycG9yYXRpb24x
+FzAVBgNVBAMTDlNlY3VyZVRydXN0IENBMB4XDTA2MTEwNzE5MzExOFoXDTI5MTIz
+MTE5NDA1NVowSDELMAkGA1UEBhMCVVMxIDAeBgNVBAoTF1NlY3VyZVRydXN0IENv
+cnBvcmF0aW9uMRcwFQYDVQQDEw5TZWN1cmVUcnVzdCBDQTCCASIwDQYJKoZIhvcN
+AQEBBQADggEPADCCAQoCggEBAKukgeWVzfX2FI7CT8rU4niVWJxB4Q2ZQCQXOZEz
+Zum+4YOvYlyJ0fwkW2Gz4BERQRwdbvC4u/jep4G6pkjGnx29vo6pQT64lO0pGtSO
+0gMdA+9tDWccV9cGrcrI9f4Or2YlSASWC12juhbDCE/RRvgUXPLIXgGZbf2IzIao
+wW8xQmxSPmjL8xk037uHGFaAJsTQ3MBv396gwpEWoGQRS0S8Hvbn+mPeZqx2pHGj
+7DaUaHp3pLHnDi+BeuK1cobvomuL8A/b01k/unK8RCSc43Oz969XL0Imnal0ugBS
+8kvNU3xHCzaFDmapCJcWNFfBZveA4+1wVMeT4C4oFVmHursCAwEAAaOBnTCBmjAT
+BgkrBgEEAYI3FAIEBh4EAEMAQTALBgNVHQ8EBAMCAYYwDwYDVR0TAQH/BAUwAwEB
+/zAdBgNVHQ4EFgQUQjK2FvoE/f5dS3rD/fdMQB1aQ68wNAYDVR0fBC0wKzApoCeg
+JYYjaHR0cDovL2NybC5zZWN1cmV0cnVzdC5jb20vU1RDQS5jcmwwEAYJKwYBBAGC
+NxUBBAMCAQAwDQYJKoZIhvcNAQEFBQADggEBADDtT0rhWDpSclu1pqNlGKa7UTt3
+6Z3q059c4EVlew3KW+JwULKUBRSuSceNQQcSc5R+DCMh/bwQf2AQWnL1mA6s7Ll/
+3XpvXdMc9P+IBWlCqQVxyLesJugutIxq/3HcuLHfmbx8IVQr5Fiiu1cprp6poxkm
+D5kuCLDv/WnPmRoJjeOnnyvJNjR7JLN4TJUXpAYmHrZkUjZfYGfZnMUFdAvnZyPS
+CPyI6a6Lf+Ew9Dd+/cYy2i2eRDAwbO4H3tI0/NL/QPZL9GZGBlSm8jIKYyYwa5vR
+3ItHuuG51WLQoqD0ZwV4KWMabwTW+MZMo5qxN7SN5ShLHZ4swrhovO0C7jE=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Secure Global CA O=SecureTrust Corporation
+# Subject: CN=Secure Global CA O=SecureTrust Corporation
+# Label: "Secure Global CA"
+# Serial: 9751836167731051554232119481456978597
+# MD5 Fingerprint: cf:f4:27:0d:d4:ed:dc:65:16:49:6d:3d:da:bf:6e:de
+# SHA1 Fingerprint: 3a:44:73:5a:e5:81:90:1f:24:86:61:46:1e:3b:9c:c4:5f:f5:3a:1b
+# SHA256 Fingerprint: 42:00:f5:04:3a:c8:59:0e:bb:52:7d:20:9e:d1:50:30:29:fb:cb:d4:1c:a1:b5:06:ec:27:f1:5a:de:7d:ac:69
+-----BEGIN CERTIFICATE-----
+MIIDvDCCAqSgAwIBAgIQB1YipOjUiolN9BPI8PjqpTANBgkqhkiG9w0BAQUFADBK
+MQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3QgQ29ycG9yYXRpb24x
+GTAXBgNVBAMTEFNlY3VyZSBHbG9iYWwgQ0EwHhcNMDYxMTA3MTk0MjI4WhcNMjkx
+MjMxMTk1MjA2WjBKMQswCQYDVQQGEwJVUzEgMB4GA1UEChMXU2VjdXJlVHJ1c3Qg
+Q29ycG9yYXRpb24xGTAXBgNVBAMTEFNlY3VyZSBHbG9iYWwgQ0EwggEiMA0GCSqG
+SIb3DQEBAQUAA4IBDwAwggEKAoIBAQCvNS7YrGxVaQZx5RNoJLNP2MwhR/jxYDiJ
+iQPpvepeRlMJ3Fz1Wuj3RSoC6zFh1ykzTM7HfAo3fg+6MpjhHZevj8fcyTiW89sa
+/FHtaMbQbqR8JNGuQsiWUGMu4P51/pinX0kuleM5M2SOHqRfkNJnPLLZ/kG5VacJ
+jnIFHovdRIWCQtBJwB1g8NEXLJXr9qXBkqPFwqcIYA1gBBCWeZ4WNOaptvolRTnI
+HmX5k/Wq8VLcmZg9pYYaDDUz+kulBAYVHDGA76oYa8J719rO+TMg1fW9ajMtgQT7
+sFzUnKPiXB3jqUJ1XnvUd+85VLrJChgbEplJL4hL/VBi0XPnj3pDAgMBAAGjgZ0w
+gZowEwYJKwYBBAGCNxQCBAYeBABDAEEwCwYDVR0PBAQDAgGGMA8GA1UdEwEB/wQF
+MAMBAf8wHQYDVR0OBBYEFK9EBMJBfkiD2045AuzshHrmzsmkMDQGA1UdHwQtMCsw
+KaAnoCWGI2h0dHA6Ly9jcmwuc2VjdXJldHJ1c3QuY29tL1NHQ0EuY3JsMBAGCSsG
+AQQBgjcVAQQDAgEAMA0GCSqGSIb3DQEBBQUAA4IBAQBjGghAfaReUw132HquHw0L
+URYD7xh8yOOvaliTFGCRsoTciE6+OYo68+aCiV0BN7OrJKQVDpI1WkpEXk5X+nXO
+H0jOZvQ8QCaSmGwb7iRGDBezUqXbpZGRzzfTb+cnCDpOGR86p1hcF895P4vkp9Mm
+I50mD1hp/Ed+stCNi5O/KU9DaXR2Z0vPB4zmAve14bRDtUstFJ/53CYNv6ZHdAbY
+iNE6KTCEztI5gGIbqMdXSbxqVVFnFUq+NQfk1XWYN3kwFNspnWzFacxHVaIw98xc
+f8LDmBxrThaA63p4ZUWiABqvDA1VZDRIuJK58bRQKfJPIx/abKwfROHdI3hRW8cW
+-----END CERTIFICATE-----
+
+# Issuer: CN=COMODO Certification Authority O=COMODO CA Limited
+# Subject: CN=COMODO Certification Authority O=COMODO CA Limited
+# Label: "COMODO Certification Authority"
+# Serial: 104350513648249232941998508985834464573
+# MD5 Fingerprint: 5c:48:dc:f7:42:72:ec:56:94:6d:1c:cc:71:35:80:75
+# SHA1 Fingerprint: 66:31:bf:9e:f7:4f:9e:b6:c9:d5:a6:0c:ba:6a:be:d1:f7:bd:ef:7b
+# SHA256 Fingerprint: 0c:2c:d6:3d:f7:80:6f:a3:99:ed:e8:09:11:6b:57:5b:f8:79:89:f0:65:18:f9:80:8c:86:05:03:17:8b:af:66
+-----BEGIN CERTIFICATE-----
+MIIEHTCCAwWgAwIBAgIQToEtioJl4AsC7j41AkblPTANBgkqhkiG9w0BAQUFADCB
+gTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4G
+A1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxJzAlBgNV
+BAMTHkNPTU9ETyBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAeFw0wNjEyMDEwMDAw
+MDBaFw0yOTEyMzEyMzU5NTlaMIGBMQswCQYDVQQGEwJHQjEbMBkGA1UECBMSR3Jl
+YXRlciBNYW5jaGVzdGVyMRAwDgYDVQQHEwdTYWxmb3JkMRowGAYDVQQKExFDT01P
+RE8gQ0EgTGltaXRlZDEnMCUGA1UEAxMeQ09NT0RPIENlcnRpZmljYXRpb24gQXV0
+aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA0ECLi3LjkRv3
+UcEbVASY06m/weaKXTuH+7uIzg3jLz8GlvCiKVCZrts7oVewdFFxze1CkU1B/qnI
+2GqGd0S7WWaXUF601CxwRM/aN5VCaTwwxHGzUvAhTaHYujl8HJ6jJJ3ygxaYqhZ8
+Q5sVW7euNJH+1GImGEaaP+vB+fGQV+useg2L23IwambV4EajcNxo2f8ESIl33rXp
++2dtQem8Ob0y2WIC8bGoPW43nOIv4tOiJovGuFVDiOEjPqXSJDlqR6sA1KGzqSX+
+DT+nHbrTUcELpNqsOO9VUCQFZUaTNE8tja3G1CEZ0o7KBWFxB3NH5YoZEr0ETc5O
+nKVIrLsm9wIDAQABo4GOMIGLMB0GA1UdDgQWBBQLWOWLxkwVN6RAqTCpIb5HNlpW
+/zAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zBJBgNVHR8EQjBAMD6g
+PKA6hjhodHRwOi8vY3JsLmNvbW9kb2NhLmNvbS9DT01PRE9DZXJ0aWZpY2F0aW9u
+QXV0aG9yaXR5LmNybDANBgkqhkiG9w0BAQUFAAOCAQEAPpiem/Yb6dc5t3iuHXIY
+SdOH5EOC6z/JqvWote9VfCFSZfnVDeFs9D6Mk3ORLgLETgdxb8CPOGEIqB6BCsAv
+IC9Bi5HcSEW88cbeunZrM8gALTFGTO3nnc+IlP8zwFboJIYmuNg4ON8qa90SzMc/
+RxdMosIGlgnW2/4/PEZB31jiVg88O8EckzXZOFKs7sjsLjBOlDW0JB9LeGna8gI4
+zJVSk/BwJVmcIGfE7vmLV2H0knZ9P4SNVbfo5azV8fUZVqZa+5Acr5Pr5RzUZ5dd
+BA6+C4OmF4O5MBKgxTMVBbkN+8cFduPYSo38NBejxiEovjBFMR7HeL5YYTisO+IB
+ZQ==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Network Solutions Certificate Authority O=Network Solutions L.L.C.
+# Subject: CN=Network Solutions Certificate Authority O=Network Solutions L.L.C.
+# Label: "Network Solutions Certificate Authority"
+# Serial: 116697915152937497490437556386812487904
+# MD5 Fingerprint: d3:f3:a6:16:c0:fa:6b:1d:59:b1:2d:96:4d:0e:11:2e
+# SHA1 Fingerprint: 74:f8:a3:c3:ef:e7:b3:90:06:4b:83:90:3c:21:64:60:20:e5:df:ce
+# SHA256 Fingerprint: 15:f0:ba:00:a3:ac:7a:f3:ac:88:4c:07:2b:10:11:a0:77:bd:77:c0:97:f4:01:64:b2:f8:59:8a:bd:83:86:0c
+-----BEGIN CERTIFICATE-----
+MIID5jCCAs6gAwIBAgIQV8szb8JcFuZHFhfjkDFo4DANBgkqhkiG9w0BAQUFADBi
+MQswCQYDVQQGEwJVUzEhMB8GA1UEChMYTmV0d29yayBTb2x1dGlvbnMgTC5MLkMu
+MTAwLgYDVQQDEydOZXR3b3JrIFNvbHV0aW9ucyBDZXJ0aWZpY2F0ZSBBdXRob3Jp
+dHkwHhcNMDYxMjAxMDAwMDAwWhcNMjkxMjMxMjM1OTU5WjBiMQswCQYDVQQGEwJV
+UzEhMB8GA1UEChMYTmV0d29yayBTb2x1dGlvbnMgTC5MLkMuMTAwLgYDVQQDEydO
+ZXR3b3JrIFNvbHV0aW9ucyBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkwggEiMA0GCSqG
+SIb3DQEBAQUAA4IBDwAwggEKAoIBAQDkvH6SMG3G2I4rC7xGzuAnlt7e+foS0zwz
+c7MEL7xxjOWftiJgPl9dzgn/ggwbmlFQGiaJ3dVhXRncEg8tCqJDXRfQNJIg6nPP
+OCwGJgl6cvf6UDL4wpPTaaIjzkGxzOTVHzbRijr4jGPiFFlp7Q3Tf2vouAPlT2rl
+mGNpSAW+Lv8ztumXWWn4Zxmuk2GWRBXTcrA/vGp97Eh/jcOrqnErU2lBUzS1sLnF
+BgrEsEX1QV1uiUV7PTsmjHTC5dLRfbIR1PtYMiKagMnc/Qzpf14Dl847ABSHJ3A4
+qY5usyd2mFHgBeMhqxrVhSI8KbWaFsWAqPS7azCPL0YCorEMIuDTAgMBAAGjgZcw
+gZQwHQYDVR0OBBYEFCEwyfsA106Y2oeqKtCnLrFAMadMMA4GA1UdDwEB/wQEAwIB
+BjAPBgNVHRMBAf8EBTADAQH/MFIGA1UdHwRLMEkwR6BFoEOGQWh0dHA6Ly9jcmwu
+bmV0c29sc3NsLmNvbS9OZXR3b3JrU29sdXRpb25zQ2VydGlmaWNhdGVBdXRob3Jp
+dHkuY3JsMA0GCSqGSIb3DQEBBQUAA4IBAQC7rkvnt1frf6ott3NHhWrB5KUd5Oc8
+6fRZZXe1eltajSU24HqXLjjAV2CDmAaDn7l2em5Q4LqILPxFzBiwmZVRDuwduIj/
+h1AcgsLj4DKAv6ALR8jDMe+ZZzKATxcheQxpXN5eNK4CtSbqUN9/GGUsyfJj4akH
+/nxxH2szJGoeBfcFaMBqEssuXmHLrijTfsK0ZpEmXzwuJF/LWA/rKOyvEZbz3Htv
+wKeI8lN3s2Berq4o2jUsbzRF0ybh3uxbTydrFny9RAQYgrOJeRcQcT16ohZO9QHN
+pGxlaKFJdlxDydi8NmdspZS11My5vWo1ViHe2MPr+8ukYEywVaCge1ey
+-----END CERTIFICATE-----
+
+# Issuer: CN=COMODO ECC Certification Authority O=COMODO CA Limited
+# Subject: CN=COMODO ECC Certification Authority O=COMODO CA Limited
+# Label: "COMODO ECC Certification Authority"
+# Serial: 41578283867086692638256921589707938090
+# MD5 Fingerprint: 7c:62:ff:74:9d:31:53:5e:68:4a:d5:78:aa:1e:bf:23
+# SHA1 Fingerprint: 9f:74:4e:9f:2b:4d:ba:ec:0f:31:2c:50:b6:56:3b:8e:2d:93:c3:11
+# SHA256 Fingerprint: 17:93:92:7a:06:14:54:97:89:ad:ce:2f:8f:34:f7:f0:b6:6d:0f:3a:e3:a3:b8:4d:21:ec:15:db:ba:4f:ad:c7
+-----BEGIN CERTIFICATE-----
+MIICiTCCAg+gAwIBAgIQH0evqmIAcFBUTAGem2OZKjAKBggqhkjOPQQDAzCBhTEL
+MAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UE
+BxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxKzApBgNVBAMT
+IkNPTU9ETyBFQ0MgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDgwMzA2MDAw
+MDAwWhcNMzgwMTE4MjM1OTU5WjCBhTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdy
+ZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09N
+T0RPIENBIExpbWl0ZWQxKzApBgNVBAMTIkNPTU9ETyBFQ0MgQ2VydGlmaWNhdGlv
+biBBdXRob3JpdHkwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQDR3svdcmCFYX7deSR
+FtSrYpn1PlILBs5BAH+X4QokPB0BBO490o0JlwzgdeT6+3eKKvUDYEs2ixYjFq0J
+cfRK9ChQtP6IHG4/bC8vCVlbpVsLM5niwz2J+Wos77LTBumjQjBAMB0GA1UdDgQW
+BBR1cacZSBm8nZ3qQUfflMRId5nTeTAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/
+BAUwAwEB/zAKBggqhkjOPQQDAwNoADBlAjEA7wNbeqy3eApyt4jf/7VGFAkK+qDm
+fQjGGoe9GKhzvSbKYAydzpmfz1wPMOG+FDHqAjAU9JM8SaczepBGR7NjfRObTrdv
+GDeAU/7dIOA1mjbRxwG55tzd8/8dLDoWV9mSOdY=
+-----END CERTIFICATE-----
+
+# Issuer: CN=OISTE WISeKey Global Root GA CA O=WISeKey OU=Copyright (c) 2005/OISTE Foundation Endorsed
+# Subject: CN=OISTE WISeKey Global Root GA CA O=WISeKey OU=Copyright (c) 2005/OISTE Foundation Endorsed
+# Label: "OISTE WISeKey Global Root GA CA"
+# Serial: 86718877871133159090080555911823548314
+# MD5 Fingerprint: bc:6c:51:33:a7:e9:d3:66:63:54:15:72:1b:21:92:93
+# SHA1 Fingerprint: 59:22:a1:e1:5a:ea:16:35:21:f8:98:39:6a:46:46:b0:44:1b:0f:a9
+# SHA256 Fingerprint: 41:c9:23:86:6a:b4:ca:d6:b7:ad:57:80:81:58:2e:02:07:97:a6:cb:df:4f:ff:78:ce:83:96:b3:89:37:d7:f5
+-----BEGIN CERTIFICATE-----
+MIID8TCCAtmgAwIBAgIQQT1yx/RrH4FDffHSKFTfmjANBgkqhkiG9w0BAQUFADCB
+ijELMAkGA1UEBhMCQ0gxEDAOBgNVBAoTB1dJU2VLZXkxGzAZBgNVBAsTEkNvcHly
+aWdodCAoYykgMjAwNTEiMCAGA1UECxMZT0lTVEUgRm91bmRhdGlvbiBFbmRvcnNl
+ZDEoMCYGA1UEAxMfT0lTVEUgV0lTZUtleSBHbG9iYWwgUm9vdCBHQSBDQTAeFw0w
+NTEyMTExNjAzNDRaFw0zNzEyMTExNjA5NTFaMIGKMQswCQYDVQQGEwJDSDEQMA4G
+A1UEChMHV0lTZUtleTEbMBkGA1UECxMSQ29weXJpZ2h0IChjKSAyMDA1MSIwIAYD
+VQQLExlPSVNURSBGb3VuZGF0aW9uIEVuZG9yc2VkMSgwJgYDVQQDEx9PSVNURSBX
+SVNlS2V5IEdsb2JhbCBSb290IEdBIENBMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8A
+MIIBCgKCAQEAy0+zAJs9Nt350UlqaxBJH+zYK7LG+DKBKUOVTJoZIyEVRd7jyBxR
+VVuuk+g3/ytr6dTqvirdqFEr12bDYVxgAsj1znJ7O7jyTmUIms2kahnBAbtzptf2
+w93NvKSLtZlhuAGio9RN1AU9ka34tAhxZK9w8RxrfvbDd50kc3vkDIzh2TbhmYsF
+mQvtRTEJysIA2/dyoJaqlYfQjse2YXMNdmaM3Bu0Y6Kff5MTMPGhJ9vZ/yxViJGg
+4E8HsChWjBgbl0SOid3gF27nKu+POQoxhILYQBRJLnpB5Kf+42TMwVlxSywhp1t9
+4B3RLoGbw9ho972WG6xwsRYUC9tguSYBBQIDAQABo1EwTzALBgNVHQ8EBAMCAYYw
+DwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUswN+rja8sHnR3JQmthG+IbJphpQw
+EAYJKwYBBAGCNxUBBAMCAQAwDQYJKoZIhvcNAQEFBQADggEBAEuh/wuHbrP5wUOx
+SPMowB0uyQlB+pQAHKSkq0lPjz0e701vvbyk9vImMMkQyh2I+3QZH4VFvbBsUfk2
+ftv1TDI6QU9bR8/oCy22xBmddMVHxjtqD6wU2zz0c5ypBd8A3HR4+vg1YFkCExh8
+vPtNsCBtQ7tgMHpnM1zFmdH4LTlSc/uMqpclXHLZCB6rTjzjgTGfA6b7wP4piFXa
+hNVQA7bihKOmNqoROgHhGEvWRGizPflTdISzRpFGlgC3gCy24eMQ4tui5yiPAZZi
+Fj4A4xylNoEYokxSdsARo27mHbrjWr42U8U+dY+GaSlYU7Wcu2+fXMUY7N0v4ZjJ
+/L7fCg0=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Certigna O=Dhimyotis
+# Subject: CN=Certigna O=Dhimyotis
+# Label: "Certigna"
+# Serial: 18364802974209362175
+# MD5 Fingerprint: ab:57:a6:5b:7d:42:82:19:b5:d8:58:26:28:5e:fd:ff
+# SHA1 Fingerprint: b1:2e:13:63:45:86:a4:6f:1a:b2:60:68:37:58:2d:c4:ac:fd:94:97
+# SHA256 Fingerprint: e3:b6:a2:db:2e:d7:ce:48:84:2f:7a:c5:32:41:c7:b7:1d:54:14:4b:fb:40:c1:1f:3f:1d:0b:42:f5:ee:a1:2d
+-----BEGIN CERTIFICATE-----
+MIIDqDCCApCgAwIBAgIJAP7c4wEPyUj/MA0GCSqGSIb3DQEBBQUAMDQxCzAJBgNV
+BAYTAkZSMRIwEAYDVQQKDAlEaGlteW90aXMxETAPBgNVBAMMCENlcnRpZ25hMB4X
+DTA3MDYyOTE1MTMwNVoXDTI3MDYyOTE1MTMwNVowNDELMAkGA1UEBhMCRlIxEjAQ
+BgNVBAoMCURoaW15b3RpczERMA8GA1UEAwwIQ2VydGlnbmEwggEiMA0GCSqGSIb3
+DQEBAQUAA4IBDwAwggEKAoIBAQDIaPHJ1tazNHUmgh7stL7qXOEm7RFHYeGifBZ4
+QCHkYJ5ayGPhxLGWkv8YbWkj4Sti993iNi+RB7lIzw7sebYs5zRLcAglozyHGxny
+gQcPOJAZ0xH+hrTy0V4eHpbNgGzOOzGTtvKg0KmVEn2lmsxryIRWijOp5yIVUxbw
+zBfsV1/pogqYCd7jX5xv3EjjhQsVWqa6n6xI4wmy9/Qy3l40vhx4XUJbzg4ij02Q
+130yGLMLLGq/jj8UEYkgDncUtT2UCIf3JR7VsmAA7G8qKCVuKj4YYxclPz5EIBb2
+JsglrgVKtOdjLPOMFlN+XPsRGgjBRmKfIrjxwo1p3Po6WAbfAgMBAAGjgbwwgbkw
+DwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUGu3+QTmQtCRZvgHyUtVF9lo53BEw
+ZAYDVR0jBF0wW4AUGu3+QTmQtCRZvgHyUtVF9lo53BGhOKQ2MDQxCzAJBgNVBAYT
+AkZSMRIwEAYDVQQKDAlEaGlteW90aXMxETAPBgNVBAMMCENlcnRpZ25hggkA/tzj
+AQ/JSP8wDgYDVR0PAQH/BAQDAgEGMBEGCWCGSAGG+EIBAQQEAwIABzANBgkqhkiG
+9w0BAQUFAAOCAQEAhQMeknH2Qq/ho2Ge6/PAD/Kl1NqV5ta+aDY9fm4fTIrv0Q8h
+bV6lUmPOEvjvKtpv6zf+EwLHyzs+ImvaYS5/1HI93TDhHkxAGYwP15zRgzB7mFnc
+fca5DClMoTOi62c6ZYTTluLtdkVwj7Ur3vkj1kluPBS1xp81HlDQwY9qcEQCYsuu
+HWhBp6pX6FOqB9IG9tUUBguRA3UsbHK1YZWaDYu5Def131TN3ubY1gkIl2PlwS6w
+t0QmwCbAr1UwnjvVNioZBPRcHv/PLLf/0P2HQBHVESO7SMAhqaQoLf0V+LBOK/Qw
+WyH8EZE0vkHve52Xdf+XlcCWWC/qu0bXu+TZLg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Cybertrust Global Root O=Cybertrust, Inc
+# Subject: CN=Cybertrust Global Root O=Cybertrust, Inc
+# Label: "Cybertrust Global Root"
+# Serial: 4835703278459682877484360
+# MD5 Fingerprint: 72:e4:4a:87:e3:69:40:80:77:ea:bc:e3:f4:ff:f0:e1
+# SHA1 Fingerprint: 5f:43:e5:b1:bf:f8:78:8c:ac:1c:c7:ca:4a:9a:c6:22:2b:cc:34:c6
+# SHA256 Fingerprint: 96:0a:df:00:63:e9:63:56:75:0c:29:65:dd:0a:08:67:da:0b:9c:bd:6e:77:71:4a:ea:fb:23:49:ab:39:3d:a3
+-----BEGIN CERTIFICATE-----
+MIIDoTCCAomgAwIBAgILBAAAAAABD4WqLUgwDQYJKoZIhvcNAQEFBQAwOzEYMBYG
+A1UEChMPQ3liZXJ0cnVzdCwgSW5jMR8wHQYDVQQDExZDeWJlcnRydXN0IEdsb2Jh
+bCBSb290MB4XDTA2MTIxNTA4MDAwMFoXDTIxMTIxNTA4MDAwMFowOzEYMBYGA1UE
+ChMPQ3liZXJ0cnVzdCwgSW5jMR8wHQYDVQQDExZDeWJlcnRydXN0IEdsb2JhbCBS
+b290MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA+Mi8vRRQZhP/8NN5
+7CPytxrHjoXxEnOmGaoQ25yiZXRadz5RfVb23CO21O1fWLE3TdVJDm71aofW0ozS
+J8bi/zafmGWgE07GKmSb1ZASzxQG9Dvj1Ci+6A74q05IlG2OlTEQXO2iLb3VOm2y
+HLtgwEZLAfVJrn5GitB0jaEMAs7u/OePuGtm839EAL9mJRQr3RAwHQeWP032a7iP
+t3sMpTjr3kfb1V05/Iin89cqdPHoWqI7n1C6poxFNcJQZZXcY4Lv3b93TZxiyWNz
+FtApD0mpSPCzqrdsxacwOUBdrsTiXSZT8M4cIwhhqJQZugRiQOwfOHB3EgZxpzAY
+XSUnpQIDAQABo4GlMIGiMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/
+MB0GA1UdDgQWBBS2CHsNesysIEyGVjJez6tuhS1wVzA/BgNVHR8EODA2MDSgMqAw
+hi5odHRwOi8vd3d3Mi5wdWJsaWMtdHJ1c3QuY29tL2NybC9jdC9jdHJvb3QuY3Js
+MB8GA1UdIwQYMBaAFLYIew16zKwgTIZWMl7Pq26FLXBXMA0GCSqGSIb3DQEBBQUA
+A4IBAQBW7wojoFROlZfJ+InaRcHUowAl9B8Tq7ejhVhpwjCt2BWKLePJzYFa+HMj
+Wqd8BfP9IjsO0QbE2zZMcwSO5bAi5MXzLqXZI+O4Tkogp24CJJ8iYGd7ix1yCcUx
+XOl5n4BHPa2hCwcUPUf/A2kaDAtE52Mlp3+yybh2hO0j9n0Hq0V+09+zv+mKts2o
+omcrUtW3ZfA5TGOgkXmTUg9U3YO7n9GPp1Nzw8v/MOx8BLjYRB+TX3EJIrduPuoc
+A06dGiBh+4E37F78CkWr1+cXVdCg6mCbpvbjjFspwgZgFJ0tl0ypkxWdYcQBX0jW
+WL1WMRJOEcgh4LMRkWXbtKaIOM5V
+-----END CERTIFICATE-----
+
+# Issuer: O=Chunghwa Telecom Co., Ltd. OU=ePKI Root Certification Authority
+# Subject: O=Chunghwa Telecom Co., Ltd. OU=ePKI Root Certification Authority
+# Label: "ePKI Root Certification Authority"
+# Serial: 28956088682735189655030529057352760477
+# MD5 Fingerprint: 1b:2e:00:ca:26:06:90:3d:ad:fe:6f:15:68:d3:6b:b3
+# SHA1 Fingerprint: 67:65:0d:f1:7e:8e:7e:5b:82:40:a4:f4:56:4b:cf:e2:3d:69:c6:f0
+# SHA256 Fingerprint: c0:a6:f4:dc:63:a2:4b:fd:cf:54:ef:2a:6a:08:2a:0a:72:de:35:80:3e:2f:f5:ff:52:7a:e5:d8:72:06:df:d5
+-----BEGIN CERTIFICATE-----
+MIIFsDCCA5igAwIBAgIQFci9ZUdcr7iXAF7kBtK8nTANBgkqhkiG9w0BAQUFADBe
+MQswCQYDVQQGEwJUVzEjMCEGA1UECgwaQ2h1bmdod2EgVGVsZWNvbSBDby4sIEx0
+ZC4xKjAoBgNVBAsMIWVQS0kgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAe
+Fw0wNDEyMjAwMjMxMjdaFw0zNDEyMjAwMjMxMjdaMF4xCzAJBgNVBAYTAlRXMSMw
+IQYDVQQKDBpDaHVuZ2h3YSBUZWxlY29tIENvLiwgTHRkLjEqMCgGA1UECwwhZVBL
+SSBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIICIjANBgkqhkiG9w0BAQEF
+AAOCAg8AMIICCgKCAgEA4SUP7o3biDN1Z82tH306Tm2d0y8U82N0ywEhajfqhFAH
+SyZbCUNsIZ5qyNUD9WBpj8zwIuQf5/dqIjG3LBXy4P4AakP/h2XGtRrBp0xtInAh
+ijHyl3SJCRImHJ7K2RKilTza6We/CKBk49ZCt0Xvl/T29de1ShUCWH2YWEtgvM3X
+DZoTM1PRYfl61dd4s5oz9wCGzh1NlDivqOx4UXCKXBCDUSH3ET00hl7lSM2XgYI1
+TBnsZfZrxQWh7kcT1rMhJ5QQCtkkO7q+RBNGMD+XPNjX12ruOzjjK9SXDrkb5wdJ
+fzcq+Xd4z1TtW0ado4AOkUPB1ltfFLqfpo0kR0BZv3I4sjZsN/+Z0V0OWQqraffA
+sgRFelQArr5T9rXn4fg8ozHSqf4hUmTFpmfwdQcGlBSBVcYn5AGPF8Fqcde+S/uU
+WH1+ETOxQvdibBjWzwloPn9s9h6PYq2lY9sJpx8iQkEeb5mKPtf5P0B6ebClAZLS
+nT0IFaUQAS2zMnaolQ2zepr7BxB4EW/hj8e6DyUadCrlHJhBmd8hh+iVBmoKs2pH
+dmX2Os+PYhcZewoozRrSgx4hxyy/vv9haLdnG7t4TY3OZ+XkwY63I2binZB1NJip
+NiuKmpS5nezMirH4JYlcWrYvjB9teSSnUmjDhDXiZo1jDiVN1Rmy5nk3pyKdVDEC
+AwEAAaNqMGgwHQYDVR0OBBYEFB4M97Zn8uGSJglFwFU5Lnc/QkqiMAwGA1UdEwQF
+MAMBAf8wOQYEZyoHAAQxMC8wLQIBADAJBgUrDgMCGgUAMAcGBWcqAwAABBRFsMLH
+ClZ87lt4DJX5GFPBphzYEDANBgkqhkiG9w0BAQUFAAOCAgEACbODU1kBPpVJufGB
+uvl2ICO1J2B01GqZNF5sAFPZn/KmsSQHRGoqxqWOeBLoR9lYGxMqXnmbnwoqZ6Yl
+PwZpVnPDimZI+ymBV3QGypzqKOg4ZyYr8dW1P2WT+DZdjo2NQCCHGervJ8A9tDkP
+JXtoUHRVnAxZfVo9QZQlUgjgRywVMRnVvwdVxrsStZf0X4OFunHB2WyBEXYKCrC/
+gpf36j36+uwtqSiUO1bd0lEursC9CBWMd1I0ltabrNMdjmEPNXubrjlpC2JgQCA2
+j6/7Nu4tCEoduL+bXPjqpRugc6bY+G7gMwRfaKonh+3ZwZCc7b3jajWvY9+rGNm6
+5ulK6lCKD2GTHuItGeIwlDWSXQ62B68ZgI9HkFFLLk3dheLSClIKF5r8GrBQAuUB
+o2M3IUxExJtRmREOc5wGj1QupyheRDmHVi03vYVElOEMSyycw5KFNGHLD7ibSkNS
+/jQ6fbjpKdx2qcgw+BRxgMYeNkh0IkFch4LoGHGLQYlE535YW6i4jRPpp2zDR+2z
+Gp1iro2C6pSe3VkQw63d4k3jMdXH7OjysP6SHhYKGvzZ8/gntsm+HbRsZJB/9OTE
+W9c3rkIO3aQab3yIVMUWbuF6aC74Or8NpDyJO3inTmODBCEIZ43ygknQW/2xzQ+D
+hNQ+IIX3Sj0rnP0qCglN6oH4EZw=
+-----END CERTIFICATE-----
+
+# Issuer: O=certSIGN OU=certSIGN ROOT CA
+# Subject: O=certSIGN OU=certSIGN ROOT CA
+# Label: "certSIGN ROOT CA"
+# Serial: 35210227249154
+# MD5 Fingerprint: 18:98:c0:d6:e9:3a:fc:f9:b0:f5:0c:f7:4b:01:44:17
+# SHA1 Fingerprint: fa:b7:ee:36:97:26:62:fb:2d:b0:2a:f6:bf:03:fd:e8:7c:4b:2f:9b
+# SHA256 Fingerprint: ea:a9:62:c4:fa:4a:6b:af:eb:e4:15:19:6d:35:1c:cd:88:8d:4f:53:f3:fa:8a:e6:d7:c4:66:a9:4e:60:42:bb
+-----BEGIN CERTIFICATE-----
+MIIDODCCAiCgAwIBAgIGIAYFFnACMA0GCSqGSIb3DQEBBQUAMDsxCzAJBgNVBAYT
+AlJPMREwDwYDVQQKEwhjZXJ0U0lHTjEZMBcGA1UECxMQY2VydFNJR04gUk9PVCBD
+QTAeFw0wNjA3MDQxNzIwMDRaFw0zMTA3MDQxNzIwMDRaMDsxCzAJBgNVBAYTAlJP
+MREwDwYDVQQKEwhjZXJ0U0lHTjEZMBcGA1UECxMQY2VydFNJR04gUk9PVCBDQTCC
+ASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALczuX7IJUqOtdu0KBuqV5Do
+0SLTZLrTk+jUrIZhQGpgV2hUhE28alQCBf/fm5oqrl0Hj0rDKH/v+yv6efHHrfAQ
+UySQi2bJqIirr1qjAOm+ukbuW3N7LBeCgV5iLKECZbO9xSsAfsT8AzNXDe3i+s5d
+RdY4zTW2ssHQnIFKquSyAVwdj1+ZxLGt24gh65AIgoDzMKND5pCCrlUoSe1b16kQ
+OA7+j0xbm0bqQfWwCHTD0IgztnzXdN/chNFDDnU5oSVAKOp4yw4sLjmdjItuFhwv
+JoIQ4uNllAoEwF73XVv4EOLQunpL+943AAAaWyjj0pxzPjKHmKHJUS/X3qwzs08C
+AwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAcYwHQYDVR0O
+BBYEFOCMm9slSbPxfIbWskKHC9BroNnkMA0GCSqGSIb3DQEBBQUAA4IBAQA+0hyJ
+LjX8+HXd5n9liPRyTMks1zJO890ZeUe9jjtbkw9QSSQTaxQGcu8J06Gh40CEyecY
+MnQ8SG4Pn0vU9x7Tk4ZkVJdjclDVVc/6IJMCopvDI5NOFlV2oHB5bc0hH88vLbwZ
+44gx+FkagQnIl6Z0x2DEW8xXjrJ1/RsCCdtZb3KTafcxQdaIOL+Hsr0Wefmq5L6I
+Jd1hJyMctTEHBDa0GpC9oHRxUIltvBTjD4au8as+x6AJzKNI0eDbZOeStc+vckNw
+i/nDhDwTqn6Sm1dTk/pwwpEOMfmbZ13pljheX7NzTogVZ96edhBiIL5VaZVDADlN
+9u6wWk5JRFRYX0KD
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Primary Certification Authority - G3 O=GeoTrust Inc. OU=(c) 2008 GeoTrust Inc. - For authorized use only
+# Subject: CN=GeoTrust Primary Certification Authority - G3 O=GeoTrust Inc. OU=(c) 2008 GeoTrust Inc. - For authorized use only
+# Label: "GeoTrust Primary Certification Authority - G3"
+# Serial: 28809105769928564313984085209975885599
+# MD5 Fingerprint: b5:e8:34:36:c9:10:44:58:48:70:6d:2e:83:d4:b8:05
+# SHA1 Fingerprint: 03:9e:ed:b8:0b:e7:a0:3c:69:53:89:3b:20:d2:d9:32:3a:4c:2a:fd
+# SHA256 Fingerprint: b4:78:b8:12:25:0d:f8:78:63:5c:2a:a7:ec:7d:15:5e:aa:62:5e:e8:29:16:e2:cd:29:43:61:88:6c:d1:fb:d4
+-----BEGIN CERTIFICATE-----
+MIID/jCCAuagAwIBAgIQFaxulBmyeUtB9iepwxgPHzANBgkqhkiG9w0BAQsFADCB
+mDELMAkGA1UEBhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xOTA3BgNVBAsT
+MChjKSAyMDA4IEdlb1RydXN0IEluYy4gLSBGb3IgYXV0aG9yaXplZCB1c2Ugb25s
+eTE2MDQGA1UEAxMtR2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhv
+cml0eSAtIEczMB4XDTA4MDQwMjAwMDAwMFoXDTM3MTIwMTIzNTk1OVowgZgxCzAJ
+BgNVBAYTAlVTMRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMTkwNwYDVQQLEzAoYykg
+MjAwOCBHZW9UcnVzdCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxNjA0
+BgNVBAMTLUdlb1RydXN0IFByaW1hcnkgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkg
+LSBHMzCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANziXmJYHTNXOTIz
++uvLh4yn1ErdBojqZI4xmKU4kB6Yzy5jK/BGvESyiaHAKAxJcCGVn2TAppMSAmUm
+hsalifD614SgcK9PGpc/BkTVyetyEH3kMSj7HGHmKAdEc5IiaacDiGydY8hS2pgn
+5whMcD60yRLBxWeDXTPzAxHsatBT4tG6NmCUgLthY2xbF37fQJQeqw3CIShwiP/W
+JmxsYAQlTlV+fe+/lEjetx3dcI0FX4ilm/LC7urRQEFtYjgdVgbFA0dRIBn8exAL
+DmKudlW/X3e+PkkBUz2YJQN2JFodtNuJ6nnltrM7P7pMKEF/BqxqjsHQ9gUdfeZC
+huOl1UcCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYw
+HQYDVR0OBBYEFMR5yo6hTgMdHNxr2zFblD4/MH8tMA0GCSqGSIb3DQEBCwUAA4IB
+AQAtxRPPVoB7eni9n64smefv2t+UXglpp+duaIy9cr5HqQ6XErhK8WTTOd8lNNTB
+zU6B8A8ExCSzNJbGpqow32hhc9f5joWJ7w5elShKKiePEI4ufIbEAp7aDHdlDkQN
+kv39sxY2+hENHYwOB4lqKVb3cvTdFZx3NWZXqxNT2I7BQMXXExZacse3aQHEerGD
+AWh9jUGhlBjBJVz88P6DAod8DQ3PLghcSkANPuyBYeYk28rgDi0Hsj5W3I31QYUH
+SJsMC8tJP33st/3LjWeJGqvtux6jAAgIFyqCXDFdRootD4abdNlF+9RAsXqqaC2G
+spki4cErx5z481+oghLrGREt
+-----END CERTIFICATE-----
+
+# Issuer: CN=thawte Primary Root CA - G2 O=thawte, Inc. OU=(c) 2007 thawte, Inc. - For authorized use only
+# Subject: CN=thawte Primary Root CA - G2 O=thawte, Inc. OU=(c) 2007 thawte, Inc. - For authorized use only
+# Label: "thawte Primary Root CA - G2"
+# Serial: 71758320672825410020661621085256472406
+# MD5 Fingerprint: 74:9d:ea:60:24:c4:fd:22:53:3e:cc:3a:72:d9:29:4f
+# SHA1 Fingerprint: aa:db:bc:22:23:8f:c4:01:a1:27:bb:38:dd:f4:1d:db:08:9e:f0:12
+# SHA256 Fingerprint: a4:31:0d:50:af:18:a6:44:71:90:37:2a:86:af:af:8b:95:1f:fb:43:1d:83:7f:1e:56:88:b4:59:71:ed:15:57
+-----BEGIN CERTIFICATE-----
+MIICiDCCAg2gAwIBAgIQNfwmXNmET8k9Jj1Xm67XVjAKBggqhkjOPQQDAzCBhDEL
+MAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjE4MDYGA1UECxMvKGMp
+IDIwMDcgdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxJDAi
+BgNVBAMTG3RoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EgLSBHMjAeFw0wNzExMDUwMDAw
+MDBaFw0zODAxMTgyMzU5NTlaMIGEMQswCQYDVQQGEwJVUzEVMBMGA1UEChMMdGhh
+d3RlLCBJbmMuMTgwNgYDVQQLEy8oYykgMjAwNyB0aGF3dGUsIEluYy4gLSBGb3Ig
+YXV0aG9yaXplZCB1c2Ugb25seTEkMCIGA1UEAxMbdGhhd3RlIFByaW1hcnkgUm9v
+dCBDQSAtIEcyMHYwEAYHKoZIzj0CAQYFK4EEACIDYgAEotWcgnuVnfFSeIf+iha/
+BebfowJPDQfGAFG6DAJSLSKkQjnE/o/qycG+1E3/n3qe4rF8mq2nhglzh9HnmuN6
+papu+7qzcMBniKI11KOasf2twu8x+qi58/sIxpHR+ymVo0IwQDAPBgNVHRMBAf8E
+BTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUmtgAMADna3+FGO6Lts6K
+DPgR4bswCgYIKoZIzj0EAwMDaQAwZgIxAN344FdHW6fmCsO99YCKlzUNG4k8VIZ3
+KMqh9HneteY4sPBlcIx/AlTCv//YoT7ZzwIxAMSNlPzcU9LcnXgWHxUzI1NS41ox
+XZ3Krr0TKUQNJ1uo52icEvdYPy5yAlejj6EULg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=thawte Primary Root CA - G3 O=thawte, Inc. OU=Certification Services Division/(c) 2008 thawte, Inc. - For authorized use only
+# Subject: CN=thawte Primary Root CA - G3 O=thawte, Inc. OU=Certification Services Division/(c) 2008 thawte, Inc. - For authorized use only
+# Label: "thawte Primary Root CA - G3"
+# Serial: 127614157056681299805556476275995414779
+# MD5 Fingerprint: fb:1b:5d:43:8a:94:cd:44:c6:76:f2:43:4b:47:e7:31
+# SHA1 Fingerprint: f1:8b:53:8d:1b:e9:03:b6:a6:f0:56:43:5b:17:15:89:ca:f3:6b:f2
+# SHA256 Fingerprint: 4b:03:f4:58:07:ad:70:f2:1b:fc:2c:ae:71:c9:fd:e4:60:4c:06:4c:f5:ff:b6:86:ba:e5:db:aa:d7:fd:d3:4c
+-----BEGIN CERTIFICATE-----
+MIIEKjCCAxKgAwIBAgIQYAGXt0an6rS0mtZLL/eQ+zANBgkqhkiG9w0BAQsFADCB
+rjELMAkGA1UEBhMCVVMxFTATBgNVBAoTDHRoYXd0ZSwgSW5jLjEoMCYGA1UECxMf
+Q2VydGlmaWNhdGlvbiBTZXJ2aWNlcyBEaXZpc2lvbjE4MDYGA1UECxMvKGMpIDIw
+MDggdGhhd3RlLCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxJDAiBgNV
+BAMTG3RoYXd0ZSBQcmltYXJ5IFJvb3QgQ0EgLSBHMzAeFw0wODA0MDIwMDAwMDBa
+Fw0zNzEyMDEyMzU5NTlaMIGuMQswCQYDVQQGEwJVUzEVMBMGA1UEChMMdGhhd3Rl
+LCBJbmMuMSgwJgYDVQQLEx9DZXJ0aWZpY2F0aW9uIFNlcnZpY2VzIERpdmlzaW9u
+MTgwNgYDVQQLEy8oYykgMjAwOCB0aGF3dGUsIEluYy4gLSBGb3IgYXV0aG9yaXpl
+ZCB1c2Ugb25seTEkMCIGA1UEAxMbdGhhd3RlIFByaW1hcnkgUm9vdCBDQSAtIEcz
+MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAsr8nLPvb2FvdeHsbnndm
+gcs+vHyu86YnmjSjaDFxODNi5PNxZnmxqWWjpYvVj2AtP0LMqmsywCPLLEHd5N/8
+YZzic7IilRFDGF/Eth9XbAoFWCLINkw6fKXRz4aviKdEAhN0cXMKQlkC+BsUa0Lf
+b1+6a4KinVvnSr0eAXLbS3ToO39/fR8EtCab4LRarEc9VbjXsCZSKAExQGbY2SS9
+9irY7CFJXJv2eul/VTV+lmuNk5Mny5K76qxAwJ/C+IDPXfRa3M50hqY+bAtTyr2S
+zhkGcuYMXDhpxwTWvGzOW/b3aJzcJRVIiKHpqfiYnODz1TEoYRFsZ5aNOZnLwkUk
+OQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNV
+HQ4EFgQUrWyqlGCc7eT/+j4KdCtjA/e2Wb8wDQYJKoZIhvcNAQELBQADggEBABpA
+2JVlrAmSicY59BDlqQ5mU1143vokkbvnRFHfxhY0Cu9qRFHqKweKA3rD6z8KLFIW
+oCtDuSWQP3CpMyVtRRooOyfPqsMpQhvfO0zAMzRbQYi/aytlryjvsvXDqmbOe1bu
+t8jLZ8HJnBoYuMTDSQPxYA5QzUbF83d597YV4Djbxy8ooAw/dyZ02SUS2jHaGh7c
+KUGRIjxpp7sC8rZcJwOJ9Abqm+RyguOhCcHpABnTPtRwa7pxpqpYrvS76Wy274fM
+m7v/OeZWYdMKp8RcTGB7BXcmer/YB1IsYvdwY9k5vG8cwnncdimvzsUsZAReiDZu
+MdRAGmI0Nj81Aa6sY6A=
+-----END CERTIFICATE-----
+
+# Issuer: CN=GeoTrust Primary Certification Authority - G2 O=GeoTrust Inc. OU=(c) 2007 GeoTrust Inc. - For authorized use only
+# Subject: CN=GeoTrust Primary Certification Authority - G2 O=GeoTrust Inc. OU=(c) 2007 GeoTrust Inc. - For authorized use only
+# Label: "GeoTrust Primary Certification Authority - G2"
+# Serial: 80682863203381065782177908751794619243
+# MD5 Fingerprint: 01:5e:d8:6b:bd:6f:3d:8e:a1:31:f8:12:e0:98:73:6a
+# SHA1 Fingerprint: 8d:17:84:d5:37:f3:03:7d:ec:70:fe:57:8b:51:9a:99:e6:10:d7:b0
+# SHA256 Fingerprint: 5e:db:7a:c4:3b:82:a0:6a:87:61:e8:d7:be:49:79:eb:f2:61:1f:7d:d7:9b:f9:1c:1c:6b:56:6a:21:9e:d7:66
+-----BEGIN CERTIFICATE-----
+MIICrjCCAjWgAwIBAgIQPLL0SAoA4v7rJDteYD7DazAKBggqhkjOPQQDAzCBmDEL
+MAkGA1UEBhMCVVMxFjAUBgNVBAoTDUdlb1RydXN0IEluYy4xOTA3BgNVBAsTMChj
+KSAyMDA3IEdlb1RydXN0IEluYy4gLSBGb3IgYXV0aG9yaXplZCB1c2Ugb25seTE2
+MDQGA1UEAxMtR2VvVHJ1c3QgUHJpbWFyeSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0
+eSAtIEcyMB4XDTA3MTEwNTAwMDAwMFoXDTM4MDExODIzNTk1OVowgZgxCzAJBgNV
+BAYTAlVTMRYwFAYDVQQKEw1HZW9UcnVzdCBJbmMuMTkwNwYDVQQLEzAoYykgMjAw
+NyBHZW9UcnVzdCBJbmMuIC0gRm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxNjA0BgNV
+BAMTLUdlb1RydXN0IFByaW1hcnkgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgLSBH
+MjB2MBAGByqGSM49AgEGBSuBBAAiA2IABBWx6P0DFUPlrOuHNxFi79KDNlJ9RVcL
+So17VDs6bl8VAsBQps8lL33KSLjHUGMcKiEIfJo22Av+0SbFWDEwKCXzXV2juLal
+tJLtbCyf691DiaI8S0iRHVDsJt/WYC69IaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAO
+BgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFBVfNVdRVfslsq0DafwBo/q+EVXVMAoG
+CCqGSM49BAMDA2cAMGQCMGSWWaboCd6LuvpaiIjwH5HTRqjySkwCY/tsXzjbLkGT
+qQ7mndwxHLKgpxgceeHHNgIwOlavmnRs9vuD4DPTCF+hnMJbn0bWtsuRBmOiBucz
+rD6ogRLQy7rQkgu2npaqBA+K
+-----END CERTIFICATE-----
+
+# Issuer: CN=VeriSign Universal Root Certification Authority O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2008 VeriSign, Inc. - For authorized use only
+# Subject: CN=VeriSign Universal Root Certification Authority O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2008 VeriSign, Inc. - For authorized use only
+# Label: "VeriSign Universal Root Certification Authority"
+# Serial: 85209574734084581917763752644031726877
+# MD5 Fingerprint: 8e:ad:b5:01:aa:4d:81:e4:8c:1d:d1:e1:14:00:95:19
+# SHA1 Fingerprint: 36:79:ca:35:66:87:72:30:4d:30:a5:fb:87:3b:0f:a7:7b:b7:0d:54
+# SHA256 Fingerprint: 23:99:56:11:27:a5:71:25:de:8c:ef:ea:61:0d:df:2f:a0:78:b5:c8:06:7f:4e:82:82:90:bf:b8:60:e8:4b:3c
+-----BEGIN CERTIFICATE-----
+MIIEuTCCA6GgAwIBAgIQQBrEZCGzEyEDDrvkEhrFHTANBgkqhkiG9w0BAQsFADCB
+vTELMAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQL
+ExZWZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwOCBWZXJp
+U2lnbiwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MTgwNgYDVQQDEy9W
+ZXJpU2lnbiBVbml2ZXJzYWwgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTAe
+Fw0wODA0MDIwMDAwMDBaFw0zNzEyMDEyMzU5NTlaMIG9MQswCQYDVQQGEwJVUzEX
+MBUGA1UEChMOVmVyaVNpZ24sIEluYy4xHzAdBgNVBAsTFlZlcmlTaWduIFRydXN0
+IE5ldHdvcmsxOjA4BgNVBAsTMShjKSAyMDA4IFZlcmlTaWduLCBJbmMuIC0gRm9y
+IGF1dGhvcml6ZWQgdXNlIG9ubHkxODA2BgNVBAMTL1ZlcmlTaWduIFVuaXZlcnNh
+bCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5MIIBIjANBgkqhkiG9w0BAQEF
+AAOCAQ8AMIIBCgKCAQEAx2E3XrEBNNti1xWb/1hajCMj1mCOkdeQmIN65lgZOIzF
+9uVkhbSicfvtvbnazU0AtMgtc6XHaXGVHzk8skQHnOgO+k1KxCHfKWGPMiJhgsWH
+H26MfF8WIFFE0XBPV+rjHOPMee5Y2A7Cs0WTwCznmhcrewA3ekEzeOEz4vMQGn+H
+LL729fdC4uW/h2KJXwBL38Xd5HVEMkE6HnFuacsLdUYI0crSK5XQz/u5QGtkjFdN
+/BMReYTtXlT2NJ8IAfMQJQYXStrxHXpma5hgZqTZ79IugvHw7wnqRMkVauIDbjPT
+rJ9VAMf2CGqUuV/c4DPxhGD5WycRtPwW8rtWaoAljQIDAQABo4GyMIGvMA8GA1Ud
+EwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMG0GCCsGAQUFBwEMBGEwX6FdoFsw
+WTBXMFUWCWltYWdlL2dpZjAhMB8wBwYFKw4DAhoEFI/l0xqGrI2Oa8PPgGrUSBgs
+exkuMCUWI2h0dHA6Ly9sb2dvLnZlcmlzaWduLmNvbS92c2xvZ28uZ2lmMB0GA1Ud
+DgQWBBS2d/ppSEefUxLVwuoHMnYH0ZcHGTANBgkqhkiG9w0BAQsFAAOCAQEASvj4
+sAPmLGd75JR3Y8xuTPl9Dg3cyLk1uXBPY/ok+myDjEedO2Pzmvl2MpWRsXe8rJq+
+seQxIcaBlVZaDrHC1LGmWazxY8u4TB1ZkErvkBYoH1quEPuBUDgMbMzxPcP1Y+Oz
+4yHJJDnp/RVmRvQbEdBNc6N9Rvk97ahfYtTxP/jgdFcrGJ2BtMQo2pSXpXDrrB2+
+BxHw1dvd5Yzw1TKwg+ZX4o+/vqGqvz0dtdQ46tewXDpPaj+PwGZsY6rp2aQW9IHR
+lRQOfc2VNNnSj3BzgXucfr2YYdhFh5iQxeuGMMY1v/D/w1WIg0vvBZIGcfK4mJO3
+7M2CYfE45k+XmCpajQ==
+-----END CERTIFICATE-----
+
+# Issuer: CN=VeriSign Class 3 Public Primary Certification Authority - G4 O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2007 VeriSign, Inc. - For authorized use only
+# Subject: CN=VeriSign Class 3 Public Primary Certification Authority - G4 O=VeriSign, Inc. OU=VeriSign Trust Network/(c) 2007 VeriSign, Inc. - For authorized use only
+# Label: "VeriSign Class 3 Public Primary Certification Authority - G4"
+# Serial: 63143484348153506665311985501458640051
+# MD5 Fingerprint: 3a:52:e1:e7:fd:6f:3a:e3:6f:f3:6f:99:1b:f9:22:41
+# SHA1 Fingerprint: 22:d5:d8:df:8f:02:31:d1:8d:f7:9d:b7:cf:8a:2d:64:c9:3f:6c:3a
+# SHA256 Fingerprint: 69:dd:d7:ea:90:bb:57:c9:3e:13:5d:c8:5e:a6:fc:d5:48:0b:60:32:39:bd:c4:54:fc:75:8b:2a:26:cf:7f:79
+-----BEGIN CERTIFICATE-----
+MIIDhDCCAwqgAwIBAgIQL4D+I4wOIg9IZxIokYesszAKBggqhkjOPQQDAzCByjEL
+MAkGA1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZW
+ZXJpU2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNyBWZXJpU2ln
+biwgSW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJp
+U2lnbiBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9y
+aXR5IC0gRzQwHhcNMDcxMTA1MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCByjELMAkG
+A1UEBhMCVVMxFzAVBgNVBAoTDlZlcmlTaWduLCBJbmMuMR8wHQYDVQQLExZWZXJp
+U2lnbiBUcnVzdCBOZXR3b3JrMTowOAYDVQQLEzEoYykgMjAwNyBWZXJpU2lnbiwg
+SW5jLiAtIEZvciBhdXRob3JpemVkIHVzZSBvbmx5MUUwQwYDVQQDEzxWZXJpU2ln
+biBDbGFzcyAzIFB1YmxpYyBQcmltYXJ5IENlcnRpZmljYXRpb24gQXV0aG9yaXR5
+IC0gRzQwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAASnVnp8Utpkmw4tXNherJI9/gHm
+GUo9FANL+mAnINmDiWn6VMaaGF5VKmTeBvaNSjutEDxlPZCIBIngMGGzrl0Bp3ve
+fLK+ymVhAIau2o970ImtTR1ZmkGxvEeA3J5iw/mjgbIwga8wDwYDVR0TAQH/BAUw
+AwEB/zAOBgNVHQ8BAf8EBAMCAQYwbQYIKwYBBQUHAQwEYTBfoV2gWzBZMFcwVRYJ
+aW1hZ2UvZ2lmMCEwHzAHBgUrDgMCGgQUj+XTGoasjY5rw8+AatRIGCx7GS4wJRYj
+aHR0cDovL2xvZ28udmVyaXNpZ24uY29tL3ZzbG9nby5naWYwHQYDVR0OBBYEFLMW
+kf3upm7ktS5Jj4d4gYDs5bG1MAoGCCqGSM49BAMDA2gAMGUCMGYhDBgmYFo4e1ZC
+4Kf8NoRRkSAsdk1DPcQdhCPQrNZ8NQbOzWm9kA3bbEhCHQ6qQgIxAJw9SDkjOVga
+FRJZap7v1VmyHVIsmXHNxynfGyphe3HR3vPA5Q06Sqotp9iGKt0uEA==
+-----END CERTIFICATE-----
+
+# Issuer: CN=NetLock Arany (Class Gold) F\u0151tan\xfas\xedtv\xe1ny O=NetLock Kft. OU=Tan\xfas\xedtv\xe1nykiad\xf3k (Certification Services)
+# Subject: CN=NetLock Arany (Class Gold) F\u0151tan\xfas\xedtv\xe1ny O=NetLock Kft. OU=Tan\xfas\xedtv\xe1nykiad\xf3k (Certification Services)
+# Label: "NetLock Arany (Class Gold) F\u0151tan\xfas\xedtv\xe1ny"
+# Serial: 80544274841616
+# MD5 Fingerprint: c5:a1:b7:ff:73:dd:d6:d7:34:32:18:df:fc:3c:ad:88
+# SHA1 Fingerprint: 06:08:3f:59:3f:15:a1:04:a0:69:a4:6b:a9:03:d0:06:b7:97:09:91
+# SHA256 Fingerprint: 6c:61:da:c3:a2:de:f0:31:50:6b:e0:36:d2:a6:fe:40:19:94:fb:d1:3d:f9:c8:d4:66:59:92:74:c4:46:ec:98
+-----BEGIN CERTIFICATE-----
+MIIEFTCCAv2gAwIBAgIGSUEs5AAQMA0GCSqGSIb3DQEBCwUAMIGnMQswCQYDVQQG
+EwJIVTERMA8GA1UEBwwIQnVkYXBlc3QxFTATBgNVBAoMDE5ldExvY2sgS2Z0LjE3
+MDUGA1UECwwuVGFuw7pzw610dsOhbnlraWFkw7NrIChDZXJ0aWZpY2F0aW9uIFNl
+cnZpY2VzKTE1MDMGA1UEAwwsTmV0TG9jayBBcmFueSAoQ2xhc3MgR29sZCkgRsWR
+dGFuw7pzw610dsOhbnkwHhcNMDgxMjExMTUwODIxWhcNMjgxMjA2MTUwODIxWjCB
+pzELMAkGA1UEBhMCSFUxETAPBgNVBAcMCEJ1ZGFwZXN0MRUwEwYDVQQKDAxOZXRM
+b2NrIEtmdC4xNzA1BgNVBAsMLlRhbsO6c8OtdHbDoW55a2lhZMOzayAoQ2VydGlm
+aWNhdGlvbiBTZXJ2aWNlcykxNTAzBgNVBAMMLE5ldExvY2sgQXJhbnkgKENsYXNz
+IEdvbGQpIEbFkXRhbsO6c8OtdHbDoW55MIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8A
+MIIBCgKCAQEAxCRec75LbRTDofTjl5Bu0jBFHjzuZ9lk4BqKf8owyoPjIMHj9DrT
+lF8afFttvzBPhCf2nx9JvMaZCpDyD/V/Q4Q3Y1GLeqVw/HpYzY6b7cNGbIRwXdrz
+AZAj/E4wqX7hJ2Pn7WQ8oLjJM2P+FpD/sLj916jAwJRDC7bVWaaeVtAkH3B5r9s5
+VA1lddkVQZQBr17s9o3x/61k/iCa11zr/qYfCGSji3ZVrR47KGAuhyXoqq8fxmRG
+ILdwfzzeSNuWU7c5d+Qa4scWhHaXWy+7GRWF+GmF9ZmnqfI0p6m2pgP8b4Y9VHx2
+BJtr+UBdADTHLpl1neWIA6pN+APSQnbAGwIDAKiLo0UwQzASBgNVHRMBAf8ECDAG
+AQH/AgEEMA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUzPpnk/C2uNClwB7zU/2M
+U9+D15YwDQYJKoZIhvcNAQELBQADggEBAKt/7hwWqZw8UQCgwBEIBaeZ5m8BiFRh
+bvG5GK1Krf6BQCOUL/t1fC8oS2IkgYIL9WHxHG64YTjrgfpioTtaYtOUZcTh5m2C
++C8lcLIhJsFyUR+MLMOEkMNaj7rP9KdlpeuY0fsFskZ1FSNqb4VjMIDw1Z4fKRzC
+bLBQWV2QWzuoDTDPv31/zvGdg73JRm4gpvlhUbohL3u+pRVjodSVh/GeufOJ8z2F
+uLjbvrW5KfnaNwUASZQDhETnv0Mxz3WLJdH0pmT1kvarBes96aULNmLazAZfNou2
+XjG4Kvte9nHfRCaexOYNkbQudZWAUWpLMKawYqGT8ZvYzsRjdT9ZR7E=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Hongkong Post Root CA 1 O=Hongkong Post
+# Subject: CN=Hongkong Post Root CA 1 O=Hongkong Post
+# Label: "Hongkong Post Root CA 1"
+# Serial: 1000
+# MD5 Fingerprint: a8:0d:6f:39:78:b9:43:6d:77:42:6d:98:5a:cc:23:ca
+# SHA1 Fingerprint: d6:da:a8:20:8d:09:d2:15:4d:24:b5:2f:cb:34:6e:b2:58:b2:8a:58
+# SHA256 Fingerprint: f9:e6:7d:33:6c:51:00:2a:c0:54:c6:32:02:2d:66:dd:a2:e7:e3:ff:f1:0a:d0:61:ed:31:d8:bb:b4:10:cf:b2
+-----BEGIN CERTIFICATE-----
+MIIDMDCCAhigAwIBAgICA+gwDQYJKoZIhvcNAQEFBQAwRzELMAkGA1UEBhMCSEsx
+FjAUBgNVBAoTDUhvbmdrb25nIFBvc3QxIDAeBgNVBAMTF0hvbmdrb25nIFBvc3Qg
+Um9vdCBDQSAxMB4XDTAzMDUxNTA1MTMxNFoXDTIzMDUxNTA0NTIyOVowRzELMAkG
+A1UEBhMCSEsxFjAUBgNVBAoTDUhvbmdrb25nIFBvc3QxIDAeBgNVBAMTF0hvbmdr
+b25nIFBvc3QgUm9vdCBDQSAxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC
+AQEArP84tulmAknjorThkPlAj3n54r15/gK97iSSHSL22oVyaf7XPwnU3ZG1ApzQ
+jVrhVcNQhrkpJsLj2aDxaQMoIIBFIi1WpztUlVYiWR8o3x8gPW2iNr4joLFutbEn
+PzlTCeqrauh0ssJlXI6/fMN4hM2eFvz1Lk8gKgifd/PFHsSaUmYeSF7jEAaPIpjh
+ZY4bXSNmO7ilMlHIhqqhqZ5/dpTCpmy3QfDVyAY45tQM4vM7TG1QjMSDJ8EThFk9
+nnV0ttgCXjqQesBCNnLsak3c78QA3xMYV18meMjWCnl3v/evt3a5pQuEF10Q6m/h
+q5URX208o1xNg1vysxmKgIsLhwIDAQABoyYwJDASBgNVHRMBAf8ECDAGAQH/AgED
+MA4GA1UdDwEB/wQEAwIBxjANBgkqhkiG9w0BAQUFAAOCAQEADkbVPK7ih9legYsC
+mEEIjEy82tvuJxuC52pF7BaLT4Wg87JwvVqWuspube5Gi27nKi6Wsxkz67SfqLI3
+7piol7Yutmcn1KZJ/RyTZXaeQi/cImyaT/JaFTmxcdcrUehtHJjA2Sr0oYJ71clB
+oiMBdDhViw+5LmeiIAQ32pwL0xch4I+XeTRvhEgCIDMb5jREn5Fw9IBehEPCKdJs
+EhTkYY2sEJCehFC78JZvRZ+K88psT/oROhUVRsPNH4NbLUES7VBnQRM9IauUiqpO
+fMGx+6fWtScvl6tu4B3i0RwsH0Ti/L6RoZz71ilTc4afU9hDDl3WY4JxHYB0yvbi
+AmvZWg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=SecureSign RootCA11 O=Japan Certification Services, Inc.
+# Subject: CN=SecureSign RootCA11 O=Japan Certification Services, Inc.
+# Label: "SecureSign RootCA11"
+# Serial: 1
+# MD5 Fingerprint: b7:52:74:e2:92:b4:80:93:f2:75:e4:cc:d7:f2:ea:26
+# SHA1 Fingerprint: 3b:c4:9f:48:f8:f3:73:a0:9c:1e:bd:f8:5b:b1:c3:65:c7:d8:11:b3
+# SHA256 Fingerprint: bf:0f:ee:fb:9e:3a:58:1a:d5:f9:e9:db:75:89:98:57:43:d2:61:08:5c:4d:31:4f:6f:5d:72:59:aa:42:16:12
+-----BEGIN CERTIFICATE-----
+MIIDbTCCAlWgAwIBAgIBATANBgkqhkiG9w0BAQUFADBYMQswCQYDVQQGEwJKUDEr
+MCkGA1UEChMiSmFwYW4gQ2VydGlmaWNhdGlvbiBTZXJ2aWNlcywgSW5jLjEcMBoG
+A1UEAxMTU2VjdXJlU2lnbiBSb290Q0ExMTAeFw0wOTA0MDgwNDU2NDdaFw0yOTA0
+MDgwNDU2NDdaMFgxCzAJBgNVBAYTAkpQMSswKQYDVQQKEyJKYXBhbiBDZXJ0aWZp
+Y2F0aW9uIFNlcnZpY2VzLCBJbmMuMRwwGgYDVQQDExNTZWN1cmVTaWduIFJvb3RD
+QTExMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA/XeqpRyQBTvLTJsz
+i1oURaTnkBbR31fSIRCkF/3frNYfp+TbfPfs37gD2pRY/V1yfIw/XwFndBWW4wI8
+h9uuywGOwvNmxoVF9ALGOrVisq/6nL+k5tSAMJjzDbaTj6nU2DbysPyKyiyhFTOV
+MdrAG/LuYpmGYz+/3ZMqg6h2uRMft85OQoWPIucuGvKVCbIFtUROd6EgvanyTgp9
+UK31BQ1FT0Zx/Sg+U/sE2C3XZR1KG/rPO7AxmjVuyIsG0wCR8pQIZUyxNAYAeoni
+8McDWc/V1uinMrPmmECGxc0nEovMe863ETxiYAcjPitAbpSACW22s293bzUIUPsC
+h8U+iQIDAQABo0IwQDAdBgNVHQ4EFgQUW/hNT7KlhtQ60vFjmqC+CfZXt94wDgYD
+VR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEFBQADggEB
+AKChOBZmLqdWHyGcBvod7bkixTgm2E5P7KN/ed5GIaGHd48HCJqypMWvDzKYC3xm
+KbabfSVSSUOrTC4rbnpwrxYO4wJs+0LmGJ1F2FXI6Dvd5+H0LgscNFxsWEr7jIhQ
+X5Ucv+2rIrVls4W6ng+4reV6G4pQOh29Dbx7VFALuUKvVaAYga1lme++5Jy/xIWr
+QbJUb9wlze144o4MjQlJ3WN7WmmWAiGovVJZ6X01y8hSyn+B/tlr0/cR7SXf+Of5
+pPpyl4RTDaXQMhhRdlkUbA/r7F+AjHVDg8OFmP9Mni0N5HeDk061lgeLKBObjBmN
+QSdJQO7e5iNEOdyhIta6A/I=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Microsec e-Szigno Root CA 2009 O=Microsec Ltd.
+# Subject: CN=Microsec e-Szigno Root CA 2009 O=Microsec Ltd.
+# Label: "Microsec e-Szigno Root CA 2009"
+# Serial: 14014712776195784473
+# MD5 Fingerprint: f8:49:f4:03:bc:44:2d:83:be:48:69:7d:29:64:fc:b1
+# SHA1 Fingerprint: 89:df:74:fe:5c:f4:0f:4a:80:f9:e3:37:7d:54:da:91:e1:01:31:8e
+# SHA256 Fingerprint: 3c:5f:81:fe:a5:fa:b8:2c:64:bf:a2:ea:ec:af:cd:e8:e0:77:fc:86:20:a7:ca:e5:37:16:3d:f3:6e:db:f3:78
+-----BEGIN CERTIFICATE-----
+MIIECjCCAvKgAwIBAgIJAMJ+QwRORz8ZMA0GCSqGSIb3DQEBCwUAMIGCMQswCQYD
+VQQGEwJIVTERMA8GA1UEBwwIQnVkYXBlc3QxFjAUBgNVBAoMDU1pY3Jvc2VjIEx0
+ZC4xJzAlBgNVBAMMHk1pY3Jvc2VjIGUtU3ppZ25vIFJvb3QgQ0EgMjAwOTEfMB0G
+CSqGSIb3DQEJARYQaW5mb0BlLXN6aWduby5odTAeFw0wOTA2MTYxMTMwMThaFw0y
+OTEyMzAxMTMwMThaMIGCMQswCQYDVQQGEwJIVTERMA8GA1UEBwwIQnVkYXBlc3Qx
+FjAUBgNVBAoMDU1pY3Jvc2VjIEx0ZC4xJzAlBgNVBAMMHk1pY3Jvc2VjIGUtU3pp
+Z25vIFJvb3QgQ0EgMjAwOTEfMB0GCSqGSIb3DQEJARYQaW5mb0BlLXN6aWduby5o
+dTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAOn4j/NjrdqG2KfgQvvP
+kd6mJviZpWNwrZuuyjNAfW2WbqEORO7hE52UQlKavXWFdCyoDh2Tthi3jCyoz/tc
+cbna7P7ofo/kLx2yqHWH2Leh5TvPmUpG0IMZfcChEhyVbUr02MelTTMuhTlAdX4U
+fIASmFDHQWe4oIBhVKZsTh/gnQ4H6cm6M+f+wFUoLAKApxn1ntxVUwOXewdI/5n7
+N4okxFnMUBBjjqqpGrCEGob5X7uxUG6k0QrM1XF+H6cbfPVTbiJfyyvm1HxdrtbC
+xkzlBQHZ7Vf8wSN5/PrIJIOV87VqUQHQd9bpEqH5GoP7ghu5sJf0dgYzQ0mg/wu1
++rUCAwEAAaOBgDB+MA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0G
+A1UdDgQWBBTLD8bfQkPMPcu1SCOhGnqmKrs0aDAfBgNVHSMEGDAWgBTLD8bfQkPM
+Pcu1SCOhGnqmKrs0aDAbBgNVHREEFDASgRBpbmZvQGUtc3ppZ25vLmh1MA0GCSqG
+SIb3DQEBCwUAA4IBAQDJ0Q5eLtXMs3w+y/w9/w0olZMEyL/azXm4Q5DwpL7v8u8h
+mLzU1F0G9u5C7DBsoKqpyvGvivo/C3NqPuouQH4frlRheesuCDfXI/OMn74dseGk
+ddug4lQUsbocKaQY9hK6ohQU4zE1yED/t+AFdlfBHFny+L/k7SViXITwfn4fs775
+tyERzAMBVnCnEJIeGzSBHq2cGsMEPO0CYdYeBvNfOofyK/FFh+U9rNHHV4S9a67c
+2Pm2G2JwCz02yULyMtd6YebS2z3PyKnJm9zbWETXbzivf3jTo60adbocwTZ8jx5t
+HMN1Rq41Bab2XD0h7lbwyYIiLXpUq3DDfSJlgnCW
+-----END CERTIFICATE-----
+
+# Issuer: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R3
+# Subject: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R3
+# Label: "GlobalSign Root CA - R3"
+# Serial: 4835703278459759426209954
+# MD5 Fingerprint: c5:df:b8:49:ca:05:13:55:ee:2d:ba:1a:c3:3e:b0:28
+# SHA1 Fingerprint: d6:9b:56:11:48:f0:1c:77:c5:45:78:c1:09:26:df:5b:85:69:76:ad
+# SHA256 Fingerprint: cb:b5:22:d7:b7:f1:27:ad:6a:01:13:86:5b:df:1c:d4:10:2e:7d:07:59:af:63:5a:7c:f4:72:0d:c9:63:c5:3b
+-----BEGIN CERTIFICATE-----
+MIIDXzCCAkegAwIBAgILBAAAAAABIVhTCKIwDQYJKoZIhvcNAQELBQAwTDEgMB4G
+A1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjMxEzARBgNVBAoTCkdsb2JhbFNp
+Z24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMDkwMzE4MTAwMDAwWhcNMjkwMzE4
+MTAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSMzETMBEG
+A1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAMwldpB5BngiFvXAg7aEyiie/QV2EcWtiHL8
+RgJDx7KKnQRfJMsuS+FggkbhUqsMgUdwbN1k0ev1LKMPgj0MK66X17YUhhB5uzsT
+gHeMCOFJ0mpiLx9e+pZo34knlTifBtc+ycsmWQ1z3rDI6SYOgxXG71uL0gRgykmm
+KPZpO/bLyCiR5Z2KYVc3rHQU3HTgOu5yLy6c+9C7v/U9AOEGM+iCK65TpjoWc4zd
+QQ4gOsC0p6Hpsk+QLjJg6VfLuQSSaGjlOCZgdbKfd/+RFO+uIEn8rUAVSNECMWEZ
+XriX7613t2Saer9fwRPvm2L7DWzgVGkWqQPabumDk3F2xmmFghcCAwEAAaNCMEAw
+DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFI/wS3+o
+LkUkrk1Q+mOai97i3Ru8MA0GCSqGSIb3DQEBCwUAA4IBAQBLQNvAUKr+yAzv95ZU
+RUm7lgAJQayzE4aGKAczymvmdLm6AC2upArT9fHxD4q/c2dKg8dEe3jgr25sbwMp
+jjM5RcOO5LlXbKr8EpbsU8Yt5CRsuZRj+9xTaGdWPoO4zzUhw8lo/s7awlOqzJCK
+6fBdRoyV3XpYKBovHd7NADdBj+1EbddTKJd+82cEHhXXipa0095MJ6RMG3NzdvQX
+mcIfeg7jLQitChws/zyrVQ4PkX4268NXSb7hLi18YIvDQVETI53O9zJrlAGomecs
+Mx86OyXShkDOOyyGeMlhLxS67ttVb9+E7gUJTb0o2HLO02JQZR7rkpeDMdmztcpH
+WD9f
+-----END CERTIFICATE-----
+
+# Issuer: CN=Autoridad de Certificacion Firmaprofesional CIF A62634068
+# Subject: CN=Autoridad de Certificacion Firmaprofesional CIF A62634068
+# Label: "Autoridad de Certificacion Firmaprofesional CIF A62634068"
+# Serial: 6047274297262753887
+# MD5 Fingerprint: 73:3a:74:7a:ec:bb:a3:96:a6:c2:e4:e2:c8:9b:c0:c3
+# SHA1 Fingerprint: ae:c5:fb:3f:c8:e1:bf:c4:e5:4f:03:07:5a:9a:e8:00:b7:f7:b6:fa
+# SHA256 Fingerprint: 04:04:80:28:bf:1f:28:64:d4:8f:9a:d4:d8:32:94:36:6a:82:88:56:55:3f:3b:14:30:3f:90:14:7f:5d:40:ef
+-----BEGIN CERTIFICATE-----
+MIIGFDCCA/ygAwIBAgIIU+w77vuySF8wDQYJKoZIhvcNAQEFBQAwUTELMAkGA1UE
+BhMCRVMxQjBABgNVBAMMOUF1dG9yaWRhZCBkZSBDZXJ0aWZpY2FjaW9uIEZpcm1h
+cHJvZmVzaW9uYWwgQ0lGIEE2MjYzNDA2ODAeFw0wOTA1MjAwODM4MTVaFw0zMDEy
+MzEwODM4MTVaMFExCzAJBgNVBAYTAkVTMUIwQAYDVQQDDDlBdXRvcmlkYWQgZGUg
+Q2VydGlmaWNhY2lvbiBGaXJtYXByb2Zlc2lvbmFsIENJRiBBNjI2MzQwNjgwggIi
+MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDKlmuO6vj78aI14H9M2uDDUtd9
+thDIAl6zQyrET2qyyhxdKJp4ERppWVevtSBC5IsP5t9bpgOSL/UR5GLXMnE42QQM
+cas9UX4PB99jBVzpv5RvwSmCwLTaUbDBPLutN0pcyvFLNg4kq7/DhHf9qFD0sefG
+L9ItWY16Ck6WaVICqjaY7Pz6FIMMNx/Jkjd/14Et5cS54D40/mf0PmbR0/RAz15i
+NA9wBj4gGFrO93IbJWyTdBSTo3OxDqqHECNZXyAFGUftaI6SEspd/NYrspI8IM/h
+X68gvqB2f3bl7BqGYTM+53u0P6APjqK5am+5hyZvQWyIplD9amML9ZMWGxmPsu2b
+m8mQ9QEM3xk9Dz44I8kvjwzRAv4bVdZO0I08r0+k8/6vKtMFnXkIoctXMbScyJCy
+Z/QYFpM6/EfY0XiWMR+6KwxfXZmtY4laJCB22N/9q06mIqqdXuYnin1oKaPnirja
+EbsXLZmdEyRG98Xi2J+Of8ePdG1asuhy9azuJBCtLxTa/y2aRnFHvkLfuwHb9H/T
+KI8xWVvTyQKmtFLKbpf7Q8UIJm+K9Lv9nyiqDdVF8xM6HdjAeI9BZzwelGSuewvF
+6NkBiDkal4ZkQdU7hwxu+g/GvUgUvzlN1J5Bto+WHWOWk9mVBngxaJ43BjuAiUVh
+OSPHG0SjFeUc+JIwuwIDAQABo4HvMIHsMBIGA1UdEwEB/wQIMAYBAf8CAQEwDgYD
+VR0PAQH/BAQDAgEGMB0GA1UdDgQWBBRlzeurNR4APn7VdMActHNHDhpkLzCBpgYD
+VR0gBIGeMIGbMIGYBgRVHSAAMIGPMC8GCCsGAQUFBwIBFiNodHRwOi8vd3d3LmZp
+cm1hcHJvZmVzaW9uYWwuY29tL2NwczBcBggrBgEFBQcCAjBQHk4AUABhAHMAZQBv
+ACAAZABlACAAbABhACAAQgBvAG4AYQBuAG8AdgBhACAANAA3ACAAQgBhAHIAYwBl
+AGwAbwBuAGEAIAAwADgAMAAxADcwDQYJKoZIhvcNAQEFBQADggIBABd9oPm03cXF
+661LJLWhAqvdpYhKsg9VSytXjDvlMd3+xDLx51tkljYyGOylMnfX40S2wBEqgLk9
+am58m9Ot/MPWo+ZkKXzR4Tgegiv/J2Wv+xYVxC5xhOW1//qkR71kMrv2JYSiJ0L1
+ILDCExARzRAVukKQKtJE4ZYm6zFIEv0q2skGz3QeqUvVhyj5eTSSPi5E6PaPT481
+PyWzOdxjKpBrIF/EUhJOlywqrJ2X3kjyo2bbwtKDlaZmp54lD+kLM5FlClrD2VQS
+3a/DTg4fJl4N3LON7NWBcN7STyQF82xO9UxJZo3R/9ILJUFI/lGExkKvgATP0H5k
+SeTy36LssUzAKh3ntLFlosS88Zj0qnAHY7S42jtM+kAiMFsRpvAFDsYCA0irhpuF
+3dvd6qJ2gHN99ZwExEWN57kci57q13XRcrHedUTnQn3iV2t93Jm8PYMo6oCTjcVM
+ZcFwgbg4/EMxsvYDNEeyrPsiBsse3RdHHF9mudMaotoRsaS8I8nkvof/uZS2+F0g
+StRf571oe2XyFR7SOqkt6dhrJKyXWERHrVkY8SFlcN7ONGCoQPHzPKTDKCOM/icz
+Q0CgFzzr6juwcqajuUpLXhZI9LK8yIySxZ2frHI2vDSANGupi5LAuBft7HZT9SQB
+jLMi6Et8Vcad+qMUu2WFbm5PEn4KPJ2V
+-----END CERTIFICATE-----
+
+# Issuer: CN=Izenpe.com O=IZENPE S.A.
+# Subject: CN=Izenpe.com O=IZENPE S.A.
+# Label: "Izenpe.com"
+# Serial: 917563065490389241595536686991402621
+# MD5 Fingerprint: a6:b0:cd:85:80:da:5c:50:34:a3:39:90:2f:55:67:73
+# SHA1 Fingerprint: 2f:78:3d:25:52:18:a7:4a:65:39:71:b5:2c:a2:9c:45:15:6f:e9:19
+# SHA256 Fingerprint: 25:30:cc:8e:98:32:15:02:ba:d9:6f:9b:1f:ba:1b:09:9e:2d:29:9e:0f:45:48:bb:91:4f:36:3b:c0:d4:53:1f
+-----BEGIN CERTIFICATE-----
+MIIF8TCCA9mgAwIBAgIQALC3WhZIX7/hy/WL1xnmfTANBgkqhkiG9w0BAQsFADA4
+MQswCQYDVQQGEwJFUzEUMBIGA1UECgwLSVpFTlBFIFMuQS4xEzARBgNVBAMMCkl6
+ZW5wZS5jb20wHhcNMDcxMjEzMTMwODI4WhcNMzcxMjEzMDgyNzI1WjA4MQswCQYD
+VQQGEwJFUzEUMBIGA1UECgwLSVpFTlBFIFMuQS4xEzARBgNVBAMMCkl6ZW5wZS5j
+b20wggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDJ03rKDx6sp4boFmVq
+scIbRTJxldn+EFvMr+eleQGPicPK8lVx93e+d5TzcqQsRNiekpsUOqHnJJAKClaO
+xdgmlOHZSOEtPtoKct2jmRXagaKH9HtuJneJWK3W6wyyQXpzbm3benhB6QiIEn6H
+LmYRY2xU+zydcsC8Lv/Ct90NduM61/e0aL6i9eOBbsFGb12N4E3GVFWJGjMxCrFX
+uaOKmMPsOzTFlUFpfnXCPCDFYbpRR6AgkJOhkEvzTnyFRVSa0QUmQbC1TR0zvsQD
+yCV8wXDbO/QJLVQnSKwv4cSsPsjLkkxTOTcj7NMB+eAJRE1NZMDhDVqHIrytG6P+
+JrUV86f8hBnp7KGItERphIPzidF0BqnMC9bC3ieFUCbKF7jJeodWLBoBHmy+E60Q
+rLUk9TiRodZL2vG70t5HtfG8gfZZa88ZU+mNFctKy6lvROUbQc/hhqfK0GqfvEyN
+BjNaooXlkDWgYlwWTvDjovoDGrQscbNYLN57C9saD+veIR8GdwYDsMnvmfzAuU8L
+hij+0rnq49qlw0dpEuDb8PYZi+17cNcC1u2HGCgsBCRMd+RIihrGO5rUD8r6ddIB
+QFqNeb+Lz0vPqhbBleStTIo+F5HUsWLlguWABKQDfo2/2n+iD5dPDNMN+9fR5XJ+
+HMh3/1uaD7euBUbl8agW7EekFwIDAQABo4H2MIHzMIGwBgNVHREEgagwgaWBD2lu
+Zm9AaXplbnBlLmNvbaSBkTCBjjFHMEUGA1UECgw+SVpFTlBFIFMuQS4gLSBDSUYg
+QTAxMzM3MjYwLVJNZXJjLlZpdG9yaWEtR2FzdGVpeiBUMTA1NSBGNjIgUzgxQzBB
+BgNVBAkMOkF2ZGEgZGVsIE1lZGl0ZXJyYW5lbyBFdG9yYmlkZWEgMTQgLSAwMTAx
+MCBWaXRvcmlhLUdhc3RlaXowDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMC
+AQYwHQYDVR0OBBYEFB0cZQ6o8iV7tJHP5LGx5r1VdGwFMA0GCSqGSIb3DQEBCwUA
+A4ICAQB4pgwWSp9MiDrAyw6lFn2fuUhfGI8NYjb2zRlrrKvV9pF9rnHzP7MOeIWb
+laQnIUdCSnxIOvVFfLMMjlF4rJUT3sb9fbgakEyrkgPH7UIBzg/YsfqikuFgba56
+awmqxinuaElnMIAkejEWOVt+8Rwu3WwJrfIxwYJOubv5vr8qhT/AQKM6WfxZSzwo
+JNu0FXWuDYi6LnPAvViH5ULy617uHjAimcs30cQhbIHsvm0m5hzkQiCeR7Csg1lw
+LDXWrzY0tM07+DKo7+N4ifuNRSzanLh+QBxh5z6ikixL8s36mLYp//Pye6kfLqCT
+VyvehQP5aTfLnnhqBbTFMXiJ7HqnheG5ezzevh55hM6fcA5ZwjUukCox2eRFekGk
+LhObNA5me0mrZJfQRsN5nXJQY6aYWwa9SG3YOYNw6DXwBdGqvOPbyALqfP2C2sJb
+UjWumDqtujWTI6cfSN01RpiyEGjkpTHCClguGYEQyVB1/OpaFs4R1+7vUIgtYf8/
+QnMFlEPVjjxOAToZpR9GTnfQXeWBIiGH/pR9hNiTrdZoQ0iy2+tzJOeRf1SktoA+
+naM8THLCV8Sg1Mw4J87VBp6iSNnpn86CcDaTmjvfliHjWbcM2pE38P1ZWrOZyGls
+QyYBNWNgVYkDOnXYukrZVP/u3oDYLdE41V4tC5h9Pmzb/CaIxw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Chambers of Commerce Root - 2008 O=AC Camerfirma S.A.
+# Subject: CN=Chambers of Commerce Root - 2008 O=AC Camerfirma S.A.
+# Label: "Chambers of Commerce Root - 2008"
+# Serial: 11806822484801597146
+# MD5 Fingerprint: 5e:80:9e:84:5a:0e:65:0b:17:02:f3:55:18:2a:3e:d7
+# SHA1 Fingerprint: 78:6a:74:ac:76:ab:14:7f:9c:6a:30:50:ba:9e:a8:7e:fe:9a:ce:3c
+# SHA256 Fingerprint: 06:3e:4a:fa:c4:91:df:d3:32:f3:08:9b:85:42:e9:46:17:d8:93:d7:fe:94:4e:10:a7:93:7e:e2:9d:96:93:c0
+-----BEGIN CERTIFICATE-----
+MIIHTzCCBTegAwIBAgIJAKPaQn6ksa7aMA0GCSqGSIb3DQEBBQUAMIGuMQswCQYD
+VQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3VycmVudCBhZGRyZXNzIGF0
+IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAGA1UEBRMJQTgyNzQzMjg3
+MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xKTAnBgNVBAMTIENoYW1iZXJz
+IG9mIENvbW1lcmNlIFJvb3QgLSAyMDA4MB4XDTA4MDgwMTEyMjk1MFoXDTM4MDcz
+MTEyMjk1MFowga4xCzAJBgNVBAYTAkVVMUMwQQYDVQQHEzpNYWRyaWQgKHNlZSBj
+dXJyZW50IGFkZHJlc3MgYXQgd3d3LmNhbWVyZmlybWEuY29tL2FkZHJlc3MpMRIw
+EAYDVQQFEwlBODI3NDMyODcxGzAZBgNVBAoTEkFDIENhbWVyZmlybWEgUy5BLjEp
+MCcGA1UEAxMgQ2hhbWJlcnMgb2YgQ29tbWVyY2UgUm9vdCAtIDIwMDgwggIiMA0G
+CSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCvAMtwNyuAWko6bHiUfaN/Gh/2NdW9
+28sNRHI+JrKQUrpjOyhYb6WzbZSm891kDFX29ufyIiKAXuFixrYp4YFs8r/lfTJq
+VKAyGVn+H4vXPWCGhSRv4xGzdz4gljUha7MI2XAuZPeEklPWDrCQiorjh40G072Q
+DuKZoRuGDtqaCrsLYVAGUvGef3bsyw/QHg3PmTA9HMRFEFis1tPo1+XqxQEHd9ZR
+5gN/ikilTWh1uem8nk4ZcfUyS5xtYBkL+8ydddy/Js2Pk3g5eXNeJQ7KXOt3EgfL
+ZEFHcpOrUMPrCXZkNNI5t3YRCQ12RcSprj1qr7V9ZS+UWBDsXHyvfuK2GNnQm05a
+Sd+pZgvMPMZ4fKecHePOjlO+Bd5gD2vlGts/4+EhySnB8esHnFIbAURRPHsl18Tl
+UlRdJQfKFiC4reRB7noI/plvg6aRArBsNlVq5331lubKgdaX8ZSD6e2wsWsSaR6s
++12pxZjptFtYer49okQ6Y1nUCyXeG0+95QGezdIp1Z8XGQpvvwyQ0wlf2eOKNcx5
+Wk0ZN5K3xMGtr/R5JJqyAQuxr1yW84Ay+1w9mPGgP0revq+ULtlVmhduYJ1jbLhj
+ya6BXBg14JC7vjxPNyK5fuvPnnchpj04gftI2jE9K+OJ9dC1vX7gUMQSibMjmhAx
+hduub+84Mxh2EQIDAQABo4IBbDCCAWgwEgYDVR0TAQH/BAgwBgEB/wIBDDAdBgNV
+HQ4EFgQU+SSsD7K1+HnA+mCIG8TZTQKeFxkwgeMGA1UdIwSB2zCB2IAU+SSsD7K1
++HnA+mCIG8TZTQKeFxmhgbSkgbEwga4xCzAJBgNVBAYTAkVVMUMwQQYDVQQHEzpN
+YWRyaWQgKHNlZSBjdXJyZW50IGFkZHJlc3MgYXQgd3d3LmNhbWVyZmlybWEuY29t
+L2FkZHJlc3MpMRIwEAYDVQQFEwlBODI3NDMyODcxGzAZBgNVBAoTEkFDIENhbWVy
+ZmlybWEgUy5BLjEpMCcGA1UEAxMgQ2hhbWJlcnMgb2YgQ29tbWVyY2UgUm9vdCAt
+IDIwMDiCCQCj2kJ+pLGu2jAOBgNVHQ8BAf8EBAMCAQYwPQYDVR0gBDYwNDAyBgRV
+HSAAMCowKAYIKwYBBQUHAgEWHGh0dHA6Ly9wb2xpY3kuY2FtZXJmaXJtYS5jb20w
+DQYJKoZIhvcNAQEFBQADggIBAJASryI1wqM58C7e6bXpeHxIvj99RZJe6dqxGfwW
+PJ+0W2aeaufDuV2I6A+tzyMP3iU6XsxPpcG1Lawk0lgH3qLPaYRgM+gQDROpI9CF
+5Y57pp49chNyM/WqfcZjHwj0/gF/JM8rLFQJ3uIrbZLGOU8W6jx+ekbURWpGqOt1
+glanq6B8aBMz9p0w8G8nOSQjKpD9kCk18pPfNKXG9/jvjA9iSnyu0/VU+I22mlaH
+FoI6M6taIgj3grrqLuBHmrS1RaMFO9ncLkVAO+rcf+g769HsJtg1pDDFOqxXnrN2
+pSB7+R5KBWIBpih1YJeSDW4+TTdDDZIVnBgizVGZoCkaPF+KMjNbMMeJL0eYD6MD
+xvbxrN8y8NmBGuScvfaAFPDRLLmF9dijscilIeUcE5fuDr3fKanvNFNb0+RqE4QG
+tjICxFKuItLcsiFCGtpA8CnJ7AoMXOLQusxI0zcKzBIKinmwPQN/aUv0NCB9szTq
+jktk9T79syNnFQ0EuPAtwQlRPLJsFfClI9eDdOTlLsn+mCdCxqvGnrDQWzilm1De
+fhiYtUU79nm06PcaewaD+9CL2rvHvRirCG88gGtAPxkZumWK5r7VXNM21+9AUiRg
+OGcEMeyP84LG3rlV8zsxkVrctQgVrXYlCg17LofiDKYGvCYQbTed7N14jHyAxfDZ
+d0jQ
+-----END CERTIFICATE-----
+
+# Issuer: CN=Global Chambersign Root - 2008 O=AC Camerfirma S.A.
+# Subject: CN=Global Chambersign Root - 2008 O=AC Camerfirma S.A.
+# Label: "Global Chambersign Root - 2008"
+# Serial: 14541511773111788494
+# MD5 Fingerprint: 9e:80:ff:78:01:0c:2e:c1:36:bd:fe:96:90:6e:08:f3
+# SHA1 Fingerprint: 4a:bd:ee:ec:95:0d:35:9c:89:ae:c7:52:a1:2c:5b:29:f6:d6:aa:0c
+# SHA256 Fingerprint: 13:63:35:43:93:34:a7:69:80:16:a0:d3:24:de:72:28:4e:07:9d:7b:52:20:bb:8f:bd:74:78:16:ee:be:ba:ca
+-----BEGIN CERTIFICATE-----
+MIIHSTCCBTGgAwIBAgIJAMnN0+nVfSPOMA0GCSqGSIb3DQEBBQUAMIGsMQswCQYD
+VQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3VycmVudCBhZGRyZXNzIGF0
+IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAGA1UEBRMJQTgyNzQzMjg3
+MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xJzAlBgNVBAMTHkdsb2JhbCBD
+aGFtYmVyc2lnbiBSb290IC0gMjAwODAeFw0wODA4MDExMjMxNDBaFw0zODA3MzEx
+MjMxNDBaMIGsMQswCQYDVQQGEwJFVTFDMEEGA1UEBxM6TWFkcmlkIChzZWUgY3Vy
+cmVudCBhZGRyZXNzIGF0IHd3dy5jYW1lcmZpcm1hLmNvbS9hZGRyZXNzKTESMBAG
+A1UEBRMJQTgyNzQzMjg3MRswGQYDVQQKExJBQyBDYW1lcmZpcm1hIFMuQS4xJzAl
+BgNVBAMTHkdsb2JhbCBDaGFtYmVyc2lnbiBSb290IC0gMjAwODCCAiIwDQYJKoZI
+hvcNAQEBBQADggIPADCCAgoCggIBAMDfVtPkOpt2RbQT2//BthmLN0EYlVJH6xed
+KYiONWwGMi5HYvNJBL99RDaxccy9Wglz1dmFRP+RVyXfXjaOcNFccUMd2drvXNL7
+G706tcuto8xEpw2uIRU/uXpbknXYpBI4iRmKt4DS4jJvVpyR1ogQC7N0ZJJ0YPP2
+zxhPYLIj0Mc7zmFLmY/CDNBAspjcDahOo7kKrmCgrUVSY7pmvWjg+b4aqIG7HkF4
+ddPB/gBVsIdU6CeQNR1MM62X/JcumIS/LMmjv9GYERTtY/jKmIhYF5ntRQOXfjyG
+HoiMvvKRhI9lNNgATH23MRdaKXoKGCQwoze1eqkBfSbW+Q6OWfH9GzO1KTsXO0G2
+Id3UwD2ln58fQ1DJu7xsepeY7s2MH/ucUa6LcL0nn3HAa6x9kGbo1106DbDVwo3V
+yJ2dwW3Q0L9R5OP4wzg2rtandeavhENdk5IMagfeOx2YItaswTXbo6Al/3K1dh3e
+beksZixShNBFks4c5eUzHdwHU1SjqoI7mjcv3N2gZOnm3b2u/GSFHTynyQbehP9r
+6GsaPMWis0L7iwk+XwhSx2LE1AVxv8Rk5Pihg+g+EpuoHtQ2TS9x9o0o9oOpE9Jh
+wZG7SMA0j0GMS0zbaRL/UJScIINZc+18ofLx/d33SdNDWKBWY8o9PeU1VlnpDsog
+zCtLkykPAgMBAAGjggFqMIIBZjASBgNVHRMBAf8ECDAGAQH/AgEMMB0GA1UdDgQW
+BBS5CcqcHtvTbDprru1U8VuTBjUuXjCB4QYDVR0jBIHZMIHWgBS5CcqcHtvTbDpr
+ru1U8VuTBjUuXqGBsqSBrzCBrDELMAkGA1UEBhMCRVUxQzBBBgNVBAcTOk1hZHJp
+ZCAoc2VlIGN1cnJlbnQgYWRkcmVzcyBhdCB3d3cuY2FtZXJmaXJtYS5jb20vYWRk
+cmVzcykxEjAQBgNVBAUTCUE4Mjc0MzI4NzEbMBkGA1UEChMSQUMgQ2FtZXJmaXJt
+YSBTLkEuMScwJQYDVQQDEx5HbG9iYWwgQ2hhbWJlcnNpZ24gUm9vdCAtIDIwMDiC
+CQDJzdPp1X0jzjAOBgNVHQ8BAf8EBAMCAQYwPQYDVR0gBDYwNDAyBgRVHSAAMCow
+KAYIKwYBBQUHAgEWHGh0dHA6Ly9wb2xpY3kuY2FtZXJmaXJtYS5jb20wDQYJKoZI
+hvcNAQEFBQADggIBAICIf3DekijZBZRG/5BXqfEv3xoNa/p8DhxJJHkn2EaqbylZ
+UohwEurdPfWbU1Rv4WCiqAm57OtZfMY18dwY6fFn5a+6ReAJ3spED8IXDneRRXoz
+X1+WLGiLwUePmJs9wOzL9dWCkoQ10b42OFZyMVtHLaoXpGNR6woBrX/sdZ7LoR/x
+fxKxueRkf2fWIyr0uDldmOghp+G9PUIadJpwr2hsUF1Jz//7Dl3mLEfXgTpZALVz
+a2Mg9jFFCDkO9HB+QHBaP9BrQql0PSgvAm11cpUJjUhjxsYjV5KTXjXBjfkK9yyd
+Yhz2rXzdpjEetrHHfoUm+qRqtdpjMNHvkzeyZi99Bffnt0uYlDXA2TopwZ2yUDMd
+SqlapskD7+3056huirRXhOukP9DuqqqHW2Pok+JrqNS4cnhrG+055F3Lm6qH1U9O
+AP7Zap88MQ8oAgF9mOinsKJknnn4SPIVqczmyETrP3iZ8ntxPjzxmKfFGBI/5rso
+M0LpRQp8bfKGeS/Fghl9CYl8slR2iK7ewfPM4W7bMdaTrpmg7yVqc5iJWzouE4ge
+v8CSlDQb4ye3ix5vQv/n6TebUB0tovkC7stYWDpxvGjjqsGvHCgfotwjZT+B6q6Z
+09gwzxMNTxXJhLynSC34MCN32EZLeW32jO06f2ARePTpm67VVMB0gNELQp/B
+-----END CERTIFICATE-----
+
+# Issuer: CN=Go Daddy Root Certificate Authority - G2 O=GoDaddy.com, Inc.
+# Subject: CN=Go Daddy Root Certificate Authority - G2 O=GoDaddy.com, Inc.
+# Label: "Go Daddy Root Certificate Authority - G2"
+# Serial: 0
+# MD5 Fingerprint: 80:3a:bc:22:c1:e6:fb:8d:9b:3b:27:4a:32:1b:9a:01
+# SHA1 Fingerprint: 47:be:ab:c9:22:ea:e8:0e:78:78:34:62:a7:9f:45:c2:54:fd:e6:8b
+# SHA256 Fingerprint: 45:14:0b:32:47:eb:9c:c8:c5:b4:f0:d7:b5:30:91:f7:32:92:08:9e:6e:5a:63:e2:74:9d:d3:ac:a9:19:8e:da
+-----BEGIN CERTIFICATE-----
+MIIDxTCCAq2gAwIBAgIBADANBgkqhkiG9w0BAQsFADCBgzELMAkGA1UEBhMCVVMx
+EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxGjAYBgNVBAoT
+EUdvRGFkZHkuY29tLCBJbmMuMTEwLwYDVQQDEyhHbyBEYWRkeSBSb290IENlcnRp
+ZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5MDkwMTAwMDAwMFoXDTM3MTIzMTIz
+NTk1OVowgYMxCzAJBgNVBAYTAlVTMRAwDgYDVQQIEwdBcml6b25hMRMwEQYDVQQH
+EwpTY290dHNkYWxlMRowGAYDVQQKExFHb0RhZGR5LmNvbSwgSW5jLjExMC8GA1UE
+AxMoR28gRGFkZHkgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkgLSBHMjCCASIw
+DQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBAL9xYgjx+lk09xvJGKP3gElY6SKD
+E6bFIEMBO4Tx5oVJnyfq9oQbTqC023CYxzIBsQU+B07u9PpPL1kwIuerGVZr4oAH
+/PMWdYA5UXvl+TW2dE6pjYIT5LY/qQOD+qK+ihVqf94Lw7YZFAXK6sOoBJQ7Rnwy
+DfMAZiLIjWltNowRGLfTshxgtDj6AozO091GB94KPutdfMh8+7ArU6SSYmlRJQVh
+GkSBjCypQ5Yj36w6gZoOKcUcqeldHraenjAKOc7xiID7S13MMuyFYkMlNAJWJwGR
+tDtwKj9useiciAF9n9T521NtYJ2/LOdYq7hfRvzOxBsDPAnrSTFcaUaz4EcCAwEA
+AaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYE
+FDqahQcQZyi27/a9BUFuIMGU2g/eMA0GCSqGSIb3DQEBCwUAA4IBAQCZ21151fmX
+WWcDYfF+OwYxdS2hII5PZYe096acvNjpL9DbWu7PdIxztDhC2gV7+AJ1uP2lsdeu
+9tfeE8tTEH6KRtGX+rcuKxGrkLAngPnon1rpN5+r5N9ss4UXnT3ZJE95kTXWXwTr
+gIOrmgIttRD02JDHBHNA7XIloKmf7J6raBKZV8aPEjoJpL1E/QYVN8Gb5DKj7Tjo
+2GTzLH4U/ALqn83/B2gX2yKQOC16jdFU8WnjXzPKej17CuPKf1855eJ1usV2GDPO
+LPAvTK33sefOT6jEm0pUBsV/fdUID+Ic/n4XuKxe9tQWskMJDE32p2u0mYRlynqI
+4uJEvlz36hz1
+-----END CERTIFICATE-----
+
+# Issuer: CN=Starfield Root Certificate Authority - G2 O=Starfield Technologies, Inc.
+# Subject: CN=Starfield Root Certificate Authority - G2 O=Starfield Technologies, Inc.
+# Label: "Starfield Root Certificate Authority - G2"
+# Serial: 0
+# MD5 Fingerprint: d6:39:81:c6:52:7e:96:69:fc:fc:ca:66:ed:05:f2:96
+# SHA1 Fingerprint: b5:1c:06:7c:ee:2b:0c:3d:f8:55:ab:2d:92:f4:fe:39:d4:e7:0f:0e
+# SHA256 Fingerprint: 2c:e1:cb:0b:f9:d2:f9:e1:02:99:3f:be:21:51:52:c3:b2:dd:0c:ab:de:1c:68:e5:31:9b:83:91:54:db:b7:f5
+-----BEGIN CERTIFICATE-----
+MIID3TCCAsWgAwIBAgIBADANBgkqhkiG9w0BAQsFADCBjzELMAkGA1UEBhMCVVMx
+EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxJTAjBgNVBAoT
+HFN0YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xMjAwBgNVBAMTKVN0YXJmaWVs
+ZCBSb290IENlcnRpZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5MDkwMTAwMDAw
+MFoXDTM3MTIzMTIzNTk1OVowgY8xCzAJBgNVBAYTAlVTMRAwDgYDVQQIEwdBcml6
+b25hMRMwEQYDVQQHEwpTY290dHNkYWxlMSUwIwYDVQQKExxTdGFyZmllbGQgVGVj
+aG5vbG9naWVzLCBJbmMuMTIwMAYDVQQDEylTdGFyZmllbGQgUm9vdCBDZXJ0aWZp
+Y2F0ZSBBdXRob3JpdHkgLSBHMjCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoC
+ggEBAL3twQP89o/8ArFvW59I2Z154qK3A2FWGMNHttfKPTUuiUP3oWmb3ooa/RMg
+nLRJdzIpVv257IzdIvpy3Cdhl+72WoTsbhm5iSzchFvVdPtrX8WJpRBSiUZV9Lh1
+HOZ/5FSuS/hVclcCGfgXcVnrHigHdMWdSL5stPSksPNkN3mSwOxGXn/hbVNMYq/N
+Hwtjuzqd+/x5AJhhdM8mgkBj87JyahkNmcrUDnXMN/uLicFZ8WJ/X7NfZTD4p7dN
+dloedl40wOiWVpmKs/B/pM293DIxfJHP4F8R+GuqSVzRmZTRouNjWwl2tVZi4Ut0
+HZbUJtQIBFnQmA4O5t78w+wfkPECAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAO
+BgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFHwMMh+n2TB/xH1oo2Kooc6rB1snMA0G
+CSqGSIb3DQEBCwUAA4IBAQARWfolTwNvlJk7mh+ChTnUdgWUXuEok21iXQnCoKjU
+sHU48TRqneSfioYmUeYs0cYtbpUgSpIB7LiKZ3sx4mcujJUDJi5DnUox9g61DLu3
+4jd/IroAow57UvtruzvE03lRTs2Q9GcHGcg8RnoNAX3FWOdt5oUwF5okxBDgBPfg
+8n/Uqgr/Qh037ZTlZFkSIHc40zI+OIF1lnP6aI+xy84fxez6nH7PfrHxBy22/L/K
+pL/QlwVKvOoYKAKQvVR4CSFx09F9HdkWsKlhPdAKACL8x3vLCWRFCztAgfd9fDL1
+mMpYjn0q7pBZc2T5NnReJaH1ZgUufzkVqSr7UIuOhWn0
+-----END CERTIFICATE-----
+
+# Issuer: CN=Starfield Services Root Certificate Authority - G2 O=Starfield Technologies, Inc.
+# Subject: CN=Starfield Services Root Certificate Authority - G2 O=Starfield Technologies, Inc.
+# Label: "Starfield Services Root Certificate Authority - G2"
+# Serial: 0
+# MD5 Fingerprint: 17:35:74:af:7b:61:1c:eb:f4:f9:3c:e2:ee:40:f9:a2
+# SHA1 Fingerprint: 92:5a:8f:8d:2c:6d:04:e0:66:5f:59:6a:ff:22:d8:63:e8:25:6f:3f
+# SHA256 Fingerprint: 56:8d:69:05:a2:c8:87:08:a4:b3:02:51:90:ed:cf:ed:b1:97:4a:60:6a:13:c6:e5:29:0f:cb:2a:e6:3e:da:b5
+-----BEGIN CERTIFICATE-----
+MIID7zCCAtegAwIBAgIBADANBgkqhkiG9w0BAQsFADCBmDELMAkGA1UEBhMCVVMx
+EDAOBgNVBAgTB0FyaXpvbmExEzARBgNVBAcTClNjb3R0c2RhbGUxJTAjBgNVBAoT
+HFN0YXJmaWVsZCBUZWNobm9sb2dpZXMsIEluYy4xOzA5BgNVBAMTMlN0YXJmaWVs
+ZCBTZXJ2aWNlcyBSb290IENlcnRpZmljYXRlIEF1dGhvcml0eSAtIEcyMB4XDTA5
+MDkwMTAwMDAwMFoXDTM3MTIzMTIzNTk1OVowgZgxCzAJBgNVBAYTAlVTMRAwDgYD
+VQQIEwdBcml6b25hMRMwEQYDVQQHEwpTY290dHNkYWxlMSUwIwYDVQQKExxTdGFy
+ZmllbGQgVGVjaG5vbG9naWVzLCBJbmMuMTswOQYDVQQDEzJTdGFyZmllbGQgU2Vy
+dmljZXMgUm9vdCBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkgLSBHMjCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBANUMOsQq+U7i9b4Zl1+OiFOxHz/Lz58gE20p
+OsgPfTz3a3Y4Y9k2YKibXlwAgLIvWX/2h/klQ4bnaRtSmpDhcePYLQ1Ob/bISdm2
+8xpWriu2dBTrz/sm4xq6HZYuajtYlIlHVv8loJNwU4PahHQUw2eeBGg6345AWh1K
+Ts9DkTvnVtYAcMtS7nt9rjrnvDH5RfbCYM8TWQIrgMw0R9+53pBlbQLPLJGmpufe
+hRhJfGZOozptqbXuNC66DQO4M99H67FrjSXZm86B0UVGMpZwh94CDklDhbZsc7tk
+6mFBrMnUVN+HL8cisibMn1lUaJ/8viovxFUcdUBgF4UCVTmLfwUCAwEAAaNCMEAw
+DwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFJxfAN+q
+AdcwKziIorhtSpzyEZGDMA0GCSqGSIb3DQEBCwUAA4IBAQBLNqaEd2ndOxmfZyMI
+bw5hyf2E3F/YNoHN2BtBLZ9g3ccaaNnRbobhiCPPE95Dz+I0swSdHynVv/heyNXB
+ve6SbzJ08pGCL72CQnqtKrcgfU28elUSwhXqvfdqlS5sdJ/PHLTyxQGjhdByPq1z
+qwubdQxtRbeOlKyWN7Wg0I8VRw7j6IPdj/3vQQF3zCepYoUz8jcI73HPdwbeyBkd
+iEDPfUYd/x7H4c7/I9vG+o1VTqkC50cRRj70/b17KSa7qWFiNyi2LSr2EIZkyXCn
+0q23KXB56jzaYyWf/Wi3MOxw+3WKt21gZ7IeyLnp2KhvAotnDU0mV3HaIPzBSlCN
+sSi6
+-----END CERTIFICATE-----
+
+# Issuer: CN=AffirmTrust Commercial O=AffirmTrust
+# Subject: CN=AffirmTrust Commercial O=AffirmTrust
+# Label: "AffirmTrust Commercial"
+# Serial: 8608355977964138876
+# MD5 Fingerprint: 82:92:ba:5b:ef:cd:8a:6f:a6:3d:55:f9:84:f6:d6:b7
+# SHA1 Fingerprint: f9:b5:b6:32:45:5f:9c:be:ec:57:5f:80:dc:e9:6e:2c:c7:b2:78:b7
+# SHA256 Fingerprint: 03:76:ab:1d:54:c5:f9:80:3c:e4:b2:e2:01:a0:ee:7e:ef:7b:57:b6:36:e8:a9:3c:9b:8d:48:60:c9:6f:5f:a7
+-----BEGIN CERTIFICATE-----
+MIIDTDCCAjSgAwIBAgIId3cGJyapsXwwDQYJKoZIhvcNAQELBQAwRDELMAkGA1UE
+BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZpcm1UcnVz
+dCBDb21tZXJjaWFsMB4XDTEwMDEyOTE0MDYwNloXDTMwMTIzMTE0MDYwNlowRDEL
+MAkGA1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZp
+cm1UcnVzdCBDb21tZXJjaWFsMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC
+AQEA9htPZwcroRX1BiLLHwGy43NFBkRJLLtJJRTWzsO3qyxPxkEylFf6EqdbDuKP
+Hx6GGaeqtS25Xw2Kwq+FNXkyLbscYjfysVtKPcrNcV/pQr6U6Mje+SJIZMblq8Yr
+ba0F8PrVC8+a5fBQpIs7R6UjW3p6+DM/uO+Zl+MgwdYoic+U+7lF7eNAFxHUdPAL
+MeIrJmqbTFeurCA+ukV6BfO9m2kVrn1OIGPENXY6BwLJN/3HR+7o8XYdcxXyl6S1
+yHp52UKqK39c/s4mT6NmgTWvRLpUHhwwMmWd5jyTXlBOeuM61G7MGvv50jeuJCqr
+VwMiKA1JdX+3KNp1v47j3A55MQIDAQABo0IwQDAdBgNVHQ4EFgQUnZPGU4teyq8/
+nx4P5ZmVvCT2lI8wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwDQYJ
+KoZIhvcNAQELBQADggEBAFis9AQOzcAN/wr91LoWXym9e2iZWEnStB03TX8nfUYG
+XUPGhi4+c7ImfU+TqbbEKpqrIZcUsd6M06uJFdhrJNTxFq7YpFzUf1GO7RgBsZNj
+vbz4YYCanrHOQnDiqX0GJX0nof5v7LMeJNrjS1UaADs1tDvZ110w/YETifLCBivt
+Z8SOyUOyXGsViQK8YvxO8rUzqrJv0wqiUOP2O+guRMLbZjipM1ZI8W0bM40NjD9g
+N53Tym1+NH4Nn3J2ixufcv1SNUFFApYvHLKac0khsUlHRUe072o0EclNmsxZt9YC
+nlpOZbWUrhvfKbAW8b8Angc6F2S1BLUjIZkKlTuXfO8=
+-----END CERTIFICATE-----
+
+# Issuer: CN=AffirmTrust Networking O=AffirmTrust
+# Subject: CN=AffirmTrust Networking O=AffirmTrust
+# Label: "AffirmTrust Networking"
+# Serial: 8957382827206547757
+# MD5 Fingerprint: 42:65:ca:be:01:9a:9a:4c:a9:8c:41:49:cd:c0:d5:7f
+# SHA1 Fingerprint: 29:36:21:02:8b:20:ed:02:f5:66:c5:32:d1:d6:ed:90:9f:45:00:2f
+# SHA256 Fingerprint: 0a:81:ec:5a:92:97:77:f1:45:90:4a:f3:8d:5d:50:9f:66:b5:e2:c5:8f:cd:b5:31:05:8b:0e:17:f3:f0:b4:1b
+-----BEGIN CERTIFICATE-----
+MIIDTDCCAjSgAwIBAgIIfE8EORzUmS0wDQYJKoZIhvcNAQEFBQAwRDELMAkGA1UE
+BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZpcm1UcnVz
+dCBOZXR3b3JraW5nMB4XDTEwMDEyOTE0MDgyNFoXDTMwMTIzMTE0MDgyNFowRDEL
+MAkGA1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MR8wHQYDVQQDDBZBZmZp
+cm1UcnVzdCBOZXR3b3JraW5nMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKC
+AQEAtITMMxcua5Rsa2FSoOujz3mUTOWUgJnLVWREZY9nZOIG41w3SfYvm4SEHi3y
+YJ0wTsyEheIszx6e/jarM3c1RNg1lho9Nuh6DtjVR6FqaYvZ/Ls6rnla1fTWcbua
+kCNrmreIdIcMHl+5ni36q1Mr3Lt2PpNMCAiMHqIjHNRqrSK6mQEubWXLviRmVSRL
+QESxG9fhwoXA3hA/Pe24/PHxI1Pcv2WXb9n5QHGNfb2V1M6+oF4nI979ptAmDgAp
+6zxG8D1gvz9Q0twmQVGeFDdCBKNwV6gbh+0t+nvujArjqWaJGctB+d1ENmHP4ndG
+yH329JKBNv3bNPFyfvMMFr20FQIDAQABo0IwQDAdBgNVHQ4EFgQUBx/S55zawm6i
+QLSwelAQUHTEyL0wDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwDQYJ
+KoZIhvcNAQEFBQADggEBAIlXshZ6qML91tmbmzTCnLQyFE2npN/svqe++EPbkTfO
+tDIuUFUaNU52Q3Eg75N3ThVwLofDwR1t3Mu1J9QsVtFSUzpE0nPIxBsFZVpikpzu
+QY0x2+c06lkh1QF612S4ZDnNye2v7UsDSKegmQGA3GWjNq5lWUhPgkvIZfFXHeVZ
+Lgo/bNjR9eUJtGxUAArgFU2HdW23WJZa3W3SAKD0m0i+wzekujbgfIeFlxoVot4u
+olu9rxj5kFDNcFn4J2dHy8egBzp90SxdbBk6ZrV9/ZFvgrG+CJPbFEfxojfHRZ48
+x3evZKiT3/Zpg4Jg8klCNO1aAFSFHBY2kgxc+qatv9s=
+-----END CERTIFICATE-----
+
+# Issuer: CN=AffirmTrust Premium O=AffirmTrust
+# Subject: CN=AffirmTrust Premium O=AffirmTrust
+# Label: "AffirmTrust Premium"
+# Serial: 7893706540734352110
+# MD5 Fingerprint: c4:5d:0e:48:b6:ac:28:30:4e:0a:bc:f9:38:16:87:57
+# SHA1 Fingerprint: d8:a6:33:2c:e0:03:6f:b1:85:f6:63:4f:7d:6a:06:65:26:32:28:27
+# SHA256 Fingerprint: 70:a7:3f:7f:37:6b:60:07:42:48:90:45:34:b1:14:82:d5:bf:0e:69:8e:cc:49:8d:f5:25:77:eb:f2:e9:3b:9a
+-----BEGIN CERTIFICATE-----
+MIIFRjCCAy6gAwIBAgIIbYwURrGmCu4wDQYJKoZIhvcNAQEMBQAwQTELMAkGA1UE
+BhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MRwwGgYDVQQDDBNBZmZpcm1UcnVz
+dCBQcmVtaXVtMB4XDTEwMDEyOTE0MTAzNloXDTQwMTIzMTE0MTAzNlowQTELMAkG
+A1UEBhMCVVMxFDASBgNVBAoMC0FmZmlybVRydXN0MRwwGgYDVQQDDBNBZmZpcm1U
+cnVzdCBQcmVtaXVtMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAxBLf
+qV/+Qd3d9Z+K4/as4Tx4mrzY8H96oDMq3I0gW64tb+eT2TZwamjPjlGjhVtnBKAQ
+JG9dKILBl1fYSCkTtuG+kU3fhQxTGJoeJKJPj/CihQvL9Cl/0qRY7iZNyaqoe5rZ
++jjeRFcV5fiMyNlI4g0WJx0eyIOFJbe6qlVBzAMiSy2RjYvmia9mx+n/K+k8rNrS
+s8PhaJyJ+HoAVt70VZVs+7pk3WKL3wt3MutizCaam7uqYoNMtAZ6MMgpv+0GTZe5
+HMQxK9VfvFMSF5yZVylmd2EhMQcuJUmdGPLu8ytxjLW6OQdJd/zvLpKQBY0tL3d7
+70O/Nbua2Plzpyzy0FfuKE4mX4+QaAkvuPjcBukumj5Rp9EixAqnOEhss/n/fauG
+V+O61oV4d7pD6kh/9ti+I20ev9E2bFhc8e6kGVQa9QPSdubhjL08s9NIS+LI+H+S
+qHZGnEJlPqQewQcDWkYtuJfzt9WyVSHvutxMAJf7FJUnM7/oQ0dG0giZFmA7mn7S
+5u046uwBHjxIVkkJx0w3AJ6IDsBz4W9m6XJHMD4Q5QsDyZpCAGzFlH5hxIrff4Ia
+C1nEWTJ3s7xgaVY5/bQGeyzWZDbZvUjthB9+pSKPKrhC9IK31FOQeE4tGv2Bb0TX
+OwF0lkLgAOIua+rF7nKsu7/+6qqo+Nz2snmKtmcCAwEAAaNCMEAwHQYDVR0OBBYE
+FJ3AZ6YMItkm9UWrpmVSESfYRaxjMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/
+BAQDAgEGMA0GCSqGSIb3DQEBDAUAA4ICAQCzV00QYk465KzquByvMiPIs0laUZx2
+KI15qldGF9X1Uva3ROgIRL8YhNILgM3FEv0AVQVhh0HctSSePMTYyPtwni94loMg
+Nt58D2kTiKV1NpgIpsbfrM7jWNa3Pt668+s0QNiigfV4Py/VpfzZotReBA4Xrf5B
+8OWycvpEgjNC6C1Y91aMYj+6QrCcDFx+LmUmXFNPALJ4fqENmS2NuB2OosSw/WDQ
+MKSOyARiqcTtNd56l+0OOF6SL5Nwpamcb6d9Ex1+xghIsV5n61EIJenmJWtSKZGc
+0jlzCFfemQa0W50QBuHCAKi4HEoCChTQwUHK+4w1IX2COPKpVJEZNZOUbWo6xbLQ
+u4mGk+ibyQ86p3q4ofB4Rvr8Ny/lioTz3/4E2aFooC8k4gmVBtWVyuEklut89pMF
+u+1z6S3RdTnX5yTb2E5fQ4+e0BQ5v1VwSJlXMbSc7kqYA5YwH2AG7hsj/oFgIxpH
+YoWlzBk0gG+zrBrjn/B7SK3VAdlntqlyk+otZrWyuOQ9PLLvTIzq6we/qzWaVYa8
+GKa1qF60g2xraUDTn9zxw2lrueFtCfTxqlB2Cnp9ehehVZZCmTEJ3WARjQUwfuaO
+RtGdFNrHF+QFlozEJLUbzxQHskD4o55BhrwE0GuWyCqANP2/7waj3VjFhT0+j/6e
+KeC2uAloGRwYQw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=AffirmTrust Premium ECC O=AffirmTrust
+# Subject: CN=AffirmTrust Premium ECC O=AffirmTrust
+# Label: "AffirmTrust Premium ECC"
+# Serial: 8401224907861490260
+# MD5 Fingerprint: 64:b0:09:55:cf:b1:d5:99:e2:be:13:ab:a6:5d:ea:4d
+# SHA1 Fingerprint: b8:23:6b:00:2f:1d:16:86:53:01:55:6c:11:a4:37:ca:eb:ff:c3:bb
+# SHA256 Fingerprint: bd:71:fd:f6:da:97:e4:cf:62:d1:64:7a:dd:25:81:b0:7d:79:ad:f8:39:7e:b4:ec:ba:9c:5e:84:88:82:14:23
+-----BEGIN CERTIFICATE-----
+MIIB/jCCAYWgAwIBAgIIdJclisc/elQwCgYIKoZIzj0EAwMwRTELMAkGA1UEBhMC
+VVMxFDASBgNVBAoMC0FmZmlybVRydXN0MSAwHgYDVQQDDBdBZmZpcm1UcnVzdCBQ
+cmVtaXVtIEVDQzAeFw0xMDAxMjkxNDIwMjRaFw00MDEyMzExNDIwMjRaMEUxCzAJ
+BgNVBAYTAlVTMRQwEgYDVQQKDAtBZmZpcm1UcnVzdDEgMB4GA1UEAwwXQWZmaXJt
+VHJ1c3QgUHJlbWl1bSBFQ0MwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQNMF4bFZ0D
+0KF5Nbc6PJJ6yhUczWLznCZcBz3lVPqj1swS6vQUX+iOGasvLkjmrBhDeKzQN8O9
+ss0s5kfiGuZjuD0uL3jET9v0D6RoTFVya5UdThhClXjMNzyR4ptlKymjQjBAMB0G
+A1UdDgQWBBSaryl6wBE1NSZRMADDav5A1a7WPDAPBgNVHRMBAf8EBTADAQH/MA4G
+A1UdDwEB/wQEAwIBBjAKBggqhkjOPQQDAwNnADBkAjAXCfOHiFBar8jAQr9HX/Vs
+aobgxCd05DhT1wV/GzTjxi+zygk8N53X57hG8f2h4nECMEJZh0PUUd+60wkyWs6I
+flc9nF9Ca/UHLbXwgpP5WW+uZPpY5Yse42O+tYHNbwKMeQ==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Certum Trusted Network CA O=Unizeto Technologies S.A. OU=Certum Certification Authority
+# Subject: CN=Certum Trusted Network CA O=Unizeto Technologies S.A. OU=Certum Certification Authority
+# Label: "Certum Trusted Network CA"
+# Serial: 279744
+# MD5 Fingerprint: d5:e9:81:40:c5:18:69:fc:46:2c:89:75:62:0f:aa:78
+# SHA1 Fingerprint: 07:e0:32:e0:20:b7:2c:3f:19:2f:06:28:a2:59:3a:19:a7:0f:06:9e
+# SHA256 Fingerprint: 5c:58:46:8d:55:f5:8e:49:7e:74:39:82:d2:b5:00:10:b6:d1:65:37:4a:cf:83:a7:d4:a3:2d:b7:68:c4:40:8e
+-----BEGIN CERTIFICATE-----
+MIIDuzCCAqOgAwIBAgIDBETAMA0GCSqGSIb3DQEBBQUAMH4xCzAJBgNVBAYTAlBM
+MSIwIAYDVQQKExlVbml6ZXRvIFRlY2hub2xvZ2llcyBTLkEuMScwJQYDVQQLEx5D
+ZXJ0dW0gQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkxIjAgBgNVBAMTGUNlcnR1bSBU
+cnVzdGVkIE5ldHdvcmsgQ0EwHhcNMDgxMDIyMTIwNzM3WhcNMjkxMjMxMTIwNzM3
+WjB+MQswCQYDVQQGEwJQTDEiMCAGA1UEChMZVW5pemV0byBUZWNobm9sb2dpZXMg
+Uy5BLjEnMCUGA1UECxMeQ2VydHVtIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MSIw
+IAYDVQQDExlDZXJ0dW0gVHJ1c3RlZCBOZXR3b3JrIENBMIIBIjANBgkqhkiG9w0B
+AQEFAAOCAQ8AMIIBCgKCAQEA4/t9o3K6wvDJFIf1awFO4W5AB7ptJ11/91sts1rH
+UV+rpDKmYYe2bg+G0jACl/jXaVehGDldamR5xgFZrDwxSjh80gTSSyjoIF87B6LM
+TXPb865Px1bVWqeWifrzq2jUI4ZZJ88JJ7ysbnKDHDBy3+Ci6dLhdHUZvSqeexVU
+BBvXQzmtVSjF4hq79MDkrjhJM8x2hZ85RdKknvISjFH4fOQtf/WsX+sWn7Et0brM
+kUJ3TCXJkDhv2/DM+44el1k+1WBO5gUo7Ul5E0u6SNsv+XLTOcr+H9g0cvW0QM8x
+AcPs3hEtF10fuFDRXhmnad4HMyjKUJX5p1TLVIZQRan5SQIDAQABo0IwQDAPBgNV
+HRMBAf8EBTADAQH/MB0GA1UdDgQWBBQIds3LB/8k9sXN7buQvOKEN0Z19zAOBgNV
+HQ8BAf8EBAMCAQYwDQYJKoZIhvcNAQEFBQADggEBAKaorSLOAT2mo/9i0Eidi15y
+sHhE49wcrwn9I0j6vSrEuVUEtRCjjSfeC4Jj0O7eDDd5QVsisrCaQVymcODU0HfL
+I9MA4GxWL+FpDQ3Zqr8hgVDZBqWo/5U30Kr+4rP1mS1FhIrlQgnXdAIv94nYmem8
+J9RHjboNRhx3zxSkHLmkMcScKHQDNP8zGSal6Q10tz6XxnboJ5ajZt3hrvJBW8qY
+VoNzcOSGGtIxQbovvi0TWnZvTuhOgQ4/WwMioBK+ZlgRSssDxLQqKi2WF+A5VLxI
+03YnnZotBqbJ7DnSq9ufmgsnAjUpsUCV5/nonFWIGUbWtzT1fs45mtk48VH3Tyw=
+-----END CERTIFICATE-----
+
+# Issuer: CN=TWCA Root Certification Authority O=TAIWAN-CA OU=Root CA
+# Subject: CN=TWCA Root Certification Authority O=TAIWAN-CA OU=Root CA
+# Label: "TWCA Root Certification Authority"
+# Serial: 1
+# MD5 Fingerprint: aa:08:8f:f6:f9:7b:b7:f2:b1:a7:1e:9b:ea:ea:bd:79
+# SHA1 Fingerprint: cf:9e:87:6d:d3:eb:fc:42:26:97:a3:b5:a3:7a:a0:76:a9:06:23:48
+# SHA256 Fingerprint: bf:d8:8f:e1:10:1c:41:ae:3e:80:1b:f8:be:56:35:0e:e9:ba:d1:a6:b9:bd:51:5e:dc:5c:6d:5b:87:11:ac:44
+-----BEGIN CERTIFICATE-----
+MIIDezCCAmOgAwIBAgIBATANBgkqhkiG9w0BAQUFADBfMQswCQYDVQQGEwJUVzES
+MBAGA1UECgwJVEFJV0FOLUNBMRAwDgYDVQQLDAdSb290IENBMSowKAYDVQQDDCFU
+V0NBIFJvb3QgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMDgwODI4MDcyNDMz
+WhcNMzAxMjMxMTU1OTU5WjBfMQswCQYDVQQGEwJUVzESMBAGA1UECgwJVEFJV0FO
+LUNBMRAwDgYDVQQLDAdSb290IENBMSowKAYDVQQDDCFUV0NBIFJvb3QgQ2VydGlm
+aWNhdGlvbiBBdXRob3JpdHkwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIB
+AQCwfnK4pAOU5qfeCTiRShFAh6d8WWQUe7UREN3+v9XAu1bihSX0NXIP+FPQQeFE
+AcK0HMMxQhZHhTMidrIKbw/lJVBPhYa+v5guEGcevhEFhgWQxFnQfHgQsIBct+HH
+K3XLfJ+utdGdIzdjp9xCoi2SBBtQwXu4PhvJVgSLL1KbralW6cH/ralYhzC2gfeX
+RfwZVzsrb+RH9JlF/h3x+JejiB03HFyP4HYlmlD4oFT/RJB2I9IyxsOrBr/8+7/z
+rX2SYgJbKdM1o5OaQ2RgXbL6Mv87BK9NQGr5x+PvI/1ry+UPizgN7gr8/g+YnzAx
+3WxSZfmLgb4i4RxYA7qRG4kHAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNV
+HRMBAf8EBTADAQH/MB0GA1UdDgQWBBRqOFsmjd6LWvJPelSDGRjjCDWmujANBgkq
+hkiG9w0BAQUFAAOCAQEAPNV3PdrfibqHDAhUaiBQkr6wQT25JmSDCi/oQMCXKCeC
+MErJk/9q56YAf4lCmtYR5VPOL8zy2gXE/uJQxDqGfczafhAJO5I1KlOy/usrBdls
+XebQ79NqZp4VKIV66IIArB6nCWlWQtNoURi+VJq/REG6Sb4gumlc7rh3zc5sH62D
+lhh9DrUUOYTxKOkto557HnpyWoOzeW/vtPzQCqVYT0bf+215WfKEIlKuD8z7fDvn
+aspHYcN6+NOSBB+4IIThNlQWx0DeO4pz3N/GCUzf7Nr/1FNCocnyYh0igzyXxfkZ
+YiesZSLX0zzG5Y6yU8xJzrww/nsOM5D77dIUkR8Hrw==
+-----END CERTIFICATE-----
+
+# Issuer: O=SECOM Trust Systems CO.,LTD. OU=Security Communication RootCA2
+# Subject: O=SECOM Trust Systems CO.,LTD. OU=Security Communication RootCA2
+# Label: "Security Communication RootCA2"
+# Serial: 0
+# MD5 Fingerprint: 6c:39:7d:a4:0e:55:59:b2:3f:d6:41:b1:12:50:de:43
+# SHA1 Fingerprint: 5f:3b:8c:f2:f8:10:b3:7d:78:b4:ce:ec:19:19:c3:73:34:b9:c7:74
+# SHA256 Fingerprint: 51:3b:2c:ec:b8:10:d4:cd:e5:dd:85:39:1a:df:c6:c2:dd:60:d8:7b:b7:36:d2:b5:21:48:4a:a4:7a:0e:be:f6
+-----BEGIN CERTIFICATE-----
+MIIDdzCCAl+gAwIBAgIBADANBgkqhkiG9w0BAQsFADBdMQswCQYDVQQGEwJKUDEl
+MCMGA1UEChMcU0VDT00gVHJ1c3QgU3lzdGVtcyBDTy4sTFRELjEnMCUGA1UECxMe
+U2VjdXJpdHkgQ29tbXVuaWNhdGlvbiBSb290Q0EyMB4XDTA5MDUyOTA1MDAzOVoX
+DTI5MDUyOTA1MDAzOVowXTELMAkGA1UEBhMCSlAxJTAjBgNVBAoTHFNFQ09NIFRy
+dXN0IFN5c3RlbXMgQ08uLExURC4xJzAlBgNVBAsTHlNlY3VyaXR5IENvbW11bmlj
+YXRpb24gUm9vdENBMjCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBANAV
+OVKxUrO6xVmCxF1SrjpDZYBLx/KWvNs2l9amZIyoXvDjChz335c9S672XewhtUGr
+zbl+dp+++T42NKA7wfYxEUV0kz1XgMX5iZnK5atq1LXaQZAQwdbWQonCv/Q4EpVM
+VAX3NuRFg3sUZdbcDE3R3n4MqzvEFb46VqZab3ZpUql6ucjrappdUtAtCms1FgkQ
+hNBqyjoGADdH5H5XTz+L62e4iKrFvlNVspHEfbmwhRkGeC7bYRr6hfVKkaHnFtWO
+ojnflLhwHyg/i/xAXmODPIMqGplrz95Zajv8bxbXH/1KEOtOghY6rCcMU/Gt1SSw
+awNQwS08Ft1ENCcadfsCAwEAAaNCMEAwHQYDVR0OBBYEFAqFqXdlBZh8QIH4D5cs
+OPEK7DzPMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MA0GCSqGSIb3
+DQEBCwUAA4IBAQBMOqNErLlFsceTfsgLCkLfZOoc7llsCLqJX2rKSpWeeo8HxdpF
+coJxDjrSzG+ntKEju/Ykn8sX/oymzsLS28yN/HH8AynBbF0zX2S2ZTuJbxh2ePXc
+okgfGT+Ok+vx+hfuzU7jBBJV1uXk3fs+BXziHV7Gp7yXT2g69ekuCkO2r1dcYmh8
+t/2jioSgrGK+KwmHNPBqAbubKVY8/gA3zyNs8U6qtnRGEmyR7jTV7JqR50S+kDFy
+1UkC9gLl9B/rfNmWVan/7Ir5mUf/NVoCqgTLiluHcSmRvaS0eg29mvVXIwAHIRc/
+SjnRBUkLp7Y3gaVdjKozXoEofKd9J+sAro03
+-----END CERTIFICATE-----
+
+# Issuer: CN=EC-ACC O=Agencia Catalana de Certificacio (NIF Q-0801176-I) OU=Serveis Publics de Certificacio/Vegeu https://www.catcert.net/verarrel (c)03/Jerarquia Entitats de Certificacio Catalanes
+# Subject: CN=EC-ACC O=Agencia Catalana de Certificacio (NIF Q-0801176-I) OU=Serveis Publics de Certificacio/Vegeu https://www.catcert.net/verarrel (c)03/Jerarquia Entitats de Certificacio Catalanes
+# Label: "EC-ACC"
+# Serial: -23701579247955709139626555126524820479
+# MD5 Fingerprint: eb:f5:9d:29:0d:61:f9:42:1f:7c:c2:ba:6d:e3:15:09
+# SHA1 Fingerprint: 28:90:3a:63:5b:52:80:fa:e6:77:4c:0b:6d:a7:d6:ba:a6:4a:f2:e8
+# SHA256 Fingerprint: 88:49:7f:01:60:2f:31:54:24:6a:e2:8c:4d:5a:ef:10:f1:d8:7e:bb:76:62:6f:4a:e0:b7:f9:5b:a7:96:87:99
+-----BEGIN CERTIFICATE-----
+MIIFVjCCBD6gAwIBAgIQ7is969Qh3hSoYqwE893EATANBgkqhkiG9w0BAQUFADCB
+8zELMAkGA1UEBhMCRVMxOzA5BgNVBAoTMkFnZW5jaWEgQ2F0YWxhbmEgZGUgQ2Vy
+dGlmaWNhY2lvIChOSUYgUS0wODAxMTc2LUkpMSgwJgYDVQQLEx9TZXJ2ZWlzIFB1
+YmxpY3MgZGUgQ2VydGlmaWNhY2lvMTUwMwYDVQQLEyxWZWdldSBodHRwczovL3d3
+dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbCAoYykwMzE1MDMGA1UECxMsSmVyYXJxdWlh
+IEVudGl0YXRzIGRlIENlcnRpZmljYWNpbyBDYXRhbGFuZXMxDzANBgNVBAMTBkVD
+LUFDQzAeFw0wMzAxMDcyMzAwMDBaFw0zMTAxMDcyMjU5NTlaMIHzMQswCQYDVQQG
+EwJFUzE7MDkGA1UEChMyQWdlbmNpYSBDYXRhbGFuYSBkZSBDZXJ0aWZpY2FjaW8g
+KE5JRiBRLTA4MDExNzYtSSkxKDAmBgNVBAsTH1NlcnZlaXMgUHVibGljcyBkZSBD
+ZXJ0aWZpY2FjaW8xNTAzBgNVBAsTLFZlZ2V1IGh0dHBzOi8vd3d3LmNhdGNlcnQu
+bmV0L3ZlcmFycmVsIChjKTAzMTUwMwYDVQQLEyxKZXJhcnF1aWEgRW50aXRhdHMg
+ZGUgQ2VydGlmaWNhY2lvIENhdGFsYW5lczEPMA0GA1UEAxMGRUMtQUNDMIIBIjAN
+BgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAsyLHT+KXQpWIR4NA9h0X84NzJB5R
+85iKw5K4/0CQBXCHYMkAqbWUZRkiFRfCQ2xmRJoNBD45b6VLeqpjt4pEndljkYRm
+4CgPukLjbo73FCeTae6RDqNfDrHrZqJyTxIThmV6PttPB/SnCWDaOkKZx7J/sxaV
+HMf5NLWUhdWZXqBIoH7nF2W4onW4HvPlQn2v7fOKSGRdghST2MDk/7NQcvJ29rNd
+QlB50JQ+awwAvthrDk4q7D7SzIKiGGUzE3eeml0aE9jD2z3Il3rucO2n5nzbcc8t
+lGLfbdb1OL4/pYUKGbio2Al1QnDE6u/LDsg0qBIimAy4E5S2S+zw0JDnJwIDAQAB
+o4HjMIHgMB0GA1UdEQQWMBSBEmVjX2FjY0BjYXRjZXJ0Lm5ldDAPBgNVHRMBAf8E
+BTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUoMOLRKo3pUW/l4Ba0fF4
+opvpXY0wfwYDVR0gBHgwdjB0BgsrBgEEAfV4AQMBCjBlMCwGCCsGAQUFBwIBFiBo
+dHRwczovL3d3dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbDA1BggrBgEFBQcCAjApGidW
+ZWdldSBodHRwczovL3d3dy5jYXRjZXJ0Lm5ldC92ZXJhcnJlbCAwDQYJKoZIhvcN
+AQEFBQADggEBAKBIW4IB9k1IuDlVNZyAelOZ1Vr/sXE7zDkJlF7W2u++AVtd0x7Y
+/X1PzaBB4DSTv8vihpw3kpBWHNzrKQXlxJ7HNd+KDM3FIUPpqojlNcAZQmNaAl6k
+SBg6hW/cnbw/nZzBh7h6YQjpdwt/cKt63dmXLGQehb+8dJahw3oS7AwaboMMPOhy
+Rp/7SNVel+axofjk70YllJyJ22k4vuxcDlbHZVHlUIiIv0LVKz3l+bqeLrPK9HOS
+Agu+TGbrIP65y7WZf+a2E/rKS03Z7lNGBjvGTq2TWoF+bCpLagVFjPIhpDGQh2xl
+nJ2lYJU6Un/10asIbvPuW/mIPX64b24D5EI=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Hellenic Academic and Research Institutions RootCA 2011 O=Hellenic Academic and Research Institutions Cert. Authority
+# Subject: CN=Hellenic Academic and Research Institutions RootCA 2011 O=Hellenic Academic and Research Institutions Cert. Authority
+# Label: "Hellenic Academic and Research Institutions RootCA 2011"
+# Serial: 0
+# MD5 Fingerprint: 73:9f:4c:4b:73:5b:79:e9:fa:ba:1c:ef:6e:cb:d5:c9
+# SHA1 Fingerprint: fe:45:65:9b:79:03:5b:98:a1:61:b5:51:2e:ac:da:58:09:48:22:4d
+# SHA256 Fingerprint: bc:10:4f:15:a4:8b:e7:09:dc:a5:42:a7:e1:d4:b9:df:6f:05:45:27:e8:02:ea:a9:2d:59:54:44:25:8a:fe:71
+-----BEGIN CERTIFICATE-----
+MIIEMTCCAxmgAwIBAgIBADANBgkqhkiG9w0BAQUFADCBlTELMAkGA1UEBhMCR1Ix
+RDBCBgNVBAoTO0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1
+dGlvbnMgQ2VydC4gQXV0aG9yaXR5MUAwPgYDVQQDEzdIZWxsZW5pYyBBY2FkZW1p
+YyBhbmQgUmVzZWFyY2ggSW5zdGl0dXRpb25zIFJvb3RDQSAyMDExMB4XDTExMTIw
+NjEzNDk1MloXDTMxMTIwMTEzNDk1MlowgZUxCzAJBgNVBAYTAkdSMUQwQgYDVQQK
+EztIZWxsZW5pYyBBY2FkZW1pYyBhbmQgUmVzZWFyY2ggSW5zdGl0dXRpb25zIENl
+cnQuIEF1dGhvcml0eTFAMD4GA1UEAxM3SGVsbGVuaWMgQWNhZGVtaWMgYW5kIFJl
+c2VhcmNoIEluc3RpdHV0aW9ucyBSb290Q0EgMjAxMTCCASIwDQYJKoZIhvcNAQEB
+BQADggEPADCCAQoCggEBAKlTAOMupvaO+mDYLZU++CwqVE7NuYRhlFhPjz2L5EPz
+dYmNUeTDN9KKiE15HrcS3UN4SoqS5tdI1Q+kOilENbgH9mgdVc04UfCMJDGFr4PJ
+fel3r+0ae50X+bOdOFAPplp5kYCvN66m0zH7tSYJnTxa71HFK9+WXesyHgLacEns
+bgzImjeN9/E2YEsmLIKe0HjzDQ9jpFEw4fkrJxIH2Oq9GGKYsFk3fb7u8yBRQlqD
+75O6aRXxYp2fmTmCobd0LovUxQt7L/DICto9eQqakxylKHJzkUOap9FNhYS5qXSP
+FEDH3N6sQWRstBmbAmNtJGSPRLIl6s5ddAxjMlyNh+UCAwEAAaOBiTCBhjAPBgNV
+HRMBAf8EBTADAQH/MAsGA1UdDwQEAwIBBjAdBgNVHQ4EFgQUppFC/RNhSiOeCKQp
+5dgTBCPuQSUwRwYDVR0eBEAwPqA8MAWCAy5ncjAFggMuZXUwBoIELmVkdTAGggQu
+b3JnMAWBAy5ncjAFgQMuZXUwBoEELmVkdTAGgQQub3JnMA0GCSqGSIb3DQEBBQUA
+A4IBAQAf73lB4XtuP7KMhjdCSk4cNx6NZrokgclPEg8hwAOXhiVtXdMiKahsog2p
+6z0GW5k6x8zDmjR/qw7IThzh+uTczQ2+vyT+bOdrwg3IBp5OjWEopmr95fZi6hg8
+TqBTnbI6nOulnJEWtk2C4AwFSKls9cz4y51JtPACpf1wA+2KIaWuE4ZJwzNzvoc7
+dIsXRSZMFpGD/md9zU1jZ/rzAxKWeAaNsWftjj++n08C9bMJL/NMh98qy5V8Acys
+Nnq/onN694/BtZqhFLKPM58N7yLcZnuEvUUXBj08yrl3NI/K6s8/MT7jiOOASSXI
+l7WdmplNsDz4SgCbZN2fOUvRJ9e4
+-----END CERTIFICATE-----
+
+# Issuer: CN=Actalis Authentication Root CA O=Actalis S.p.A./03358520967
+# Subject: CN=Actalis Authentication Root CA O=Actalis S.p.A./03358520967
+# Label: "Actalis Authentication Root CA"
+# Serial: 6271844772424770508
+# MD5 Fingerprint: 69:c1:0d:4f:07:a3:1b:c3:fe:56:3d:04:bc:11:f6:a6
+# SHA1 Fingerprint: f3:73:b3:87:06:5a:28:84:8a:f2:f3:4a:ce:19:2b:dd:c7:8e:9c:ac
+# SHA256 Fingerprint: 55:92:60:84:ec:96:3a:64:b9:6e:2a:be:01:ce:0b:a8:6a:64:fb:fe:bc:c7:aa:b5:af:c1:55:b3:7f:d7:60:66
+-----BEGIN CERTIFICATE-----
+MIIFuzCCA6OgAwIBAgIIVwoRl0LE48wwDQYJKoZIhvcNAQELBQAwazELMAkGA1UE
+BhMCSVQxDjAMBgNVBAcMBU1pbGFuMSMwIQYDVQQKDBpBY3RhbGlzIFMucC5BLi8w
+MzM1ODUyMDk2NzEnMCUGA1UEAwweQWN0YWxpcyBBdXRoZW50aWNhdGlvbiBSb290
+IENBMB4XDTExMDkyMjExMjIwMloXDTMwMDkyMjExMjIwMlowazELMAkGA1UEBhMC
+SVQxDjAMBgNVBAcMBU1pbGFuMSMwIQYDVQQKDBpBY3RhbGlzIFMucC5BLi8wMzM1
+ODUyMDk2NzEnMCUGA1UEAwweQWN0YWxpcyBBdXRoZW50aWNhdGlvbiBSb290IENB
+MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAp8bEpSmkLO/lGMWwUKNv
+UTufClrJwkg4CsIcoBh/kbWHuUA/3R1oHwiD1S0eiKD4j1aPbZkCkpAW1V8IbInX
+4ay8IMKx4INRimlNAJZaby/ARH6jDuSRzVju3PvHHkVH3Se5CAGfpiEd9UEtL0z9
+KK3giq0itFZljoZUj5NDKd45RnijMCO6zfB9E1fAXdKDa0hMxKufgFpbOr3JpyI/
+gCczWw63igxdBzcIy2zSekciRDXFzMwujt0q7bd9Zg1fYVEiVRvjRuPjPdA1Yprb
+rxTIW6HMiRvhMCb8oJsfgadHHwTrozmSBp+Z07/T6k9QnBn+locePGX2oxgkg4YQ
+51Q+qDp2JE+BIcXjDwL4k5RHILv+1A7TaLndxHqEguNTVHnd25zS8gebLra8Pu2F
+be8lEfKXGkJh90qX6IuxEAf6ZYGyojnP9zz/GPvG8VqLWeICrHuS0E4UT1lF9gxe
+KF+w6D9Fz8+vm2/7hNN3WpVvrJSEnu68wEqPSpP4RCHiMUVhUE4Q2OM1fEwZtN4F
+v6MGn8i1zeQf1xcGDXqVdFUNaBr8EBtiZJ1t4JWgw5QHVw0U5r0F+7if5t+L4sbn
+fpb2U8WANFAoWPASUHEXMLrmeGO89LKtmyuy/uE5jF66CyCU3nuDuP/jVo23Eek7
+jPKxwV2dpAtMK9myGPW1n0sCAwEAAaNjMGEwHQYDVR0OBBYEFFLYiDrIn3hm7Ynz
+ezhwlMkCAjbQMA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUUtiIOsifeGbt
+ifN7OHCUyQICNtAwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3DQEBCwUAA4ICAQAL
+e3KHwGCmSUyIWOYdiPcUZEim2FgKDk8TNd81HdTtBjHIgT5q1d07GjLukD0R0i70
+jsNjLiNmsGe+b7bAEzlgqqI0JZN1Ut6nna0Oh4lScWoWPBkdg/iaKWW+9D+a2fDz
+WochcYBNy+A4mz+7+uAwTc+G02UQGRjRlwKxK3JCaKygvU5a2hi/a5iB0P2avl4V
+SM0RFbnAKVy06Ij3Pjaut2L9HmLecHgQHEhb2rykOLpn7VU+Xlff1ANATIGk0k9j
+pwlCCRT8AKnCgHNPLsBA2RF7SOp6AsDT6ygBJlh0wcBzIm2Tlf05fbsq4/aC4yyX
+X04fkZT6/iyj2HYauE2yOE+b+h1IYHkm4vP9qdCa6HCPSXrW5b0KDtst842/6+Ok
+fcvHlXHo2qN8xcL4dJIEG4aspCJTQLas/kx2z/uUMsA1n3Y/buWQbqCmJqK4LL7R
+K4X9p2jIugErsWx0Hbhzlefut8cl8ABMALJ+tguLHPPAUJ4lueAI3jZm/zel0btU
+ZCzJJ7VLkn5l/9Mt4blOvH+kQSGQQXemOR/qnuOf0GZvBeyqdn6/axag67XH/JJU
+LysRJyU3eExRarDzzFhdFPFqSBX/wge2sY0PjlxQRrM9vwGYT7JZVEc+NHt4bVaT
+LnPqZih4zR0Uv6CPLy64Lo7yFIrM6bV8+2ydDKXhlg==
+-----END CERTIFICATE-----
+
+# Issuer: O=Trustis Limited OU=Trustis FPS Root CA
+# Subject: O=Trustis Limited OU=Trustis FPS Root CA
+# Label: "Trustis FPS Root CA"
+# Serial: 36053640375399034304724988975563710553
+# MD5 Fingerprint: 30:c9:e7:1e:6b:e6:14:eb:65:b2:16:69:20:31:67:4d
+# SHA1 Fingerprint: 3b:c0:38:0b:33:c3:f6:a6:0c:86:15:22:93:d9:df:f5:4b:81:c0:04
+# SHA256 Fingerprint: c1:b4:82:99:ab:a5:20:8f:e9:63:0a:ce:55:ca:68:a0:3e:da:5a:51:9c:88:02:a0:d3:a6:73:be:8f:8e:55:7d
+-----BEGIN CERTIFICATE-----
+MIIDZzCCAk+gAwIBAgIQGx+ttiD5JNM2a/fH8YygWTANBgkqhkiG9w0BAQUFADBF
+MQswCQYDVQQGEwJHQjEYMBYGA1UEChMPVHJ1c3RpcyBMaW1pdGVkMRwwGgYDVQQL
+ExNUcnVzdGlzIEZQUyBSb290IENBMB4XDTAzMTIyMzEyMTQwNloXDTI0MDEyMTEx
+MzY1NFowRTELMAkGA1UEBhMCR0IxGDAWBgNVBAoTD1RydXN0aXMgTGltaXRlZDEc
+MBoGA1UECxMTVHJ1c3RpcyBGUFMgUm9vdCBDQTCCASIwDQYJKoZIhvcNAQEBBQAD
+ggEPADCCAQoCggEBAMVQe547NdDfxIzNjpvto8A2mfRC6qc+gIMPpqdZh8mQRUN+
+AOqGeSoDvT03mYlmt+WKVoaTnGhLaASMk5MCPjDSNzoiYYkchU59j9WvezX2fihH
+iTHcDnlkH5nSW7r+f2C/revnPDgpai/lkQtV/+xvWNUtyd5MZnGPDNcE2gfmHhjj
+vSkCqPoc4Vu5g6hBSLwacY3nYuUtsuvffM/bq1rKMfFMIvMFE/eC+XN5DL7XSxzA
+0RU8k0Fk0ea+IxciAIleH2ulrG6nS4zto3Lmr2NNL4XSFDWaLk6M6jKYKIahkQlB
+OrTh4/L68MkKokHdqeMDx4gVOxzUGpTXn2RZEm0CAwEAAaNTMFEwDwYDVR0TAQH/
+BAUwAwEB/zAfBgNVHSMEGDAWgBS6+nEleYtXQSUhhgtx67JkDoshZzAdBgNVHQ4E
+FgQUuvpxJXmLV0ElIYYLceuyZA6LIWcwDQYJKoZIhvcNAQEFBQADggEBAH5Y//01
+GX2cGE+esCu8jowU/yyg2kdbw++BLa8F6nRIW/M+TgfHbcWzk88iNVy2P3UnXwmW
+zaD+vkAMXBJV+JOCyinpXj9WV4s4NvdFGkwozZ5BuO1WTISkQMi4sKUraXAEasP4
+1BIy+Q7DsdwyhEQsb8tGD+pmQQ9P8Vilpg0ND2HepZ5dfWWhPBfnqFVO76DH7cZE
+f1T1o+CP8HxVIo8ptoGj4W1OLBuAZ+ytIJ8MYmHVl/9D7S3B2l0pKoU/rGXuhg8F
+jZBf3+6f9L/uHfuY5H+QK4R4EA5sSVPvFVtlRkpdr7r7OnIdzfYliB6XzCGcKQEN
+ZetX2fNXlrtIzYE=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Buypass Class 2 Root CA O=Buypass AS-983163327
+# Subject: CN=Buypass Class 2 Root CA O=Buypass AS-983163327
+# Label: "Buypass Class 2 Root CA"
+# Serial: 2
+# MD5 Fingerprint: 46:a7:d2:fe:45:fb:64:5a:a8:59:90:9b:78:44:9b:29
+# SHA1 Fingerprint: 49:0a:75:74:de:87:0a:47:fe:58:ee:f6:c7:6b:eb:c6:0b:12:40:99
+# SHA256 Fingerprint: 9a:11:40:25:19:7c:5b:b9:5d:94:e6:3d:55:cd:43:79:08:47:b6:46:b2:3c:df:11:ad:a4:a0:0e:ff:15:fb:48
+-----BEGIN CERTIFICATE-----
+MIIFWTCCA0GgAwIBAgIBAjANBgkqhkiG9w0BAQsFADBOMQswCQYDVQQGEwJOTzEd
+MBsGA1UECgwUQnV5cGFzcyBBUy05ODMxNjMzMjcxIDAeBgNVBAMMF0J1eXBhc3Mg
+Q2xhc3MgMiBSb290IENBMB4XDTEwMTAyNjA4MzgwM1oXDTQwMTAyNjA4MzgwM1ow
+TjELMAkGA1UEBhMCTk8xHTAbBgNVBAoMFEJ1eXBhc3MgQVMtOTgzMTYzMzI3MSAw
+HgYDVQQDDBdCdXlwYXNzIENsYXNzIDIgUm9vdCBDQTCCAiIwDQYJKoZIhvcNAQEB
+BQADggIPADCCAgoCggIBANfHXvfBB9R3+0Mh9PT1aeTuMgHbo4Yf5FkNuud1g1Lr
+6hxhFUi7HQfKjK6w3Jad6sNgkoaCKHOcVgb/S2TwDCo3SbXlzwx87vFKu3MwZfPV
+L4O2fuPn9Z6rYPnT8Z2SdIrkHJasW4DptfQxh6NR/Md+oW+OU3fUl8FVM5I+GC91
+1K2GScuVr1QGbNgGE41b/+EmGVnAJLqBcXmQRFBoJJRfuLMR8SlBYaNByyM21cHx
+MlAQTn/0hpPshNOOvEu/XAFOBz3cFIqUCqTqc/sLUegTBxj6DvEr0VQVfTzh97QZ
+QmdiXnfgolXsttlpF9U6r0TtSsWe5HonfOV116rLJeffawrbD02TTqigzXsu8lkB
+arcNuAeBfos4GzjmCleZPe4h6KP1DBbdi+w0jpwqHAAVF41og9JwnxgIzRFo1clr
+Us3ERo/ctfPYV3Me6ZQ5BL/T3jjetFPsaRyifsSP5BtwrfKi+fv3FmRmaZ9JUaLi
+FRhnBkp/1Wy1TbMz4GHrXb7pmA8y1x1LPC5aAVKRCfLf6o3YBkBjqhHk/sM3nhRS
+P/TizPJhk9H9Z2vXUq6/aKtAQ6BXNVN48FP4YUIHZMbXb5tMOA1jrGKvNouicwoN
+9SG9dKpN6nIDSdvHXx1iY8f93ZHsM+71bbRuMGjeyNYmsHVee7QHIJihdjK4TWxP
+AgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFMmAd+BikoL1Rpzz
+uvdMw964o605MA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQsFAAOCAgEAU18h
+9bqwOlI5LJKwbADJ784g7wbylp7ppHR/ehb8t/W2+xUbP6umwHJdELFx7rxP462s
+A20ucS6vxOOto70MEae0/0qyexAQH6dXQbLArvQsWdZHEIjzIVEpMMpghq9Gqx3t
+OluwlN5E40EIosHsHdb9T7bWR9AUC8rmyrV7d35BH16Dx7aMOZawP5aBQW9gkOLo
++fsicdl9sz1Gv7SEr5AcD48Saq/v7h56rgJKihcrdv6sVIkkLE8/trKnToyokZf7
+KcZ7XC25y2a2t6hbElGFtQl+Ynhw/qlqYLYdDnkM/crqJIByw5c/8nerQyIKx+u2
+DISCLIBrQYoIwOula9+ZEsuK1V6ADJHgJgg2SMX6OBE1/yWDLfJ6v9r9jv6ly0Us
+H8SIU653DtmadsWOLB2jutXsMq7Aqqz30XpN69QH4kj3Io6wpJ9qzo6ysmD0oyLQ
+I+uUWnpp3Q+/QFesa1lQ2aOZ4W7+jQF5JyMV3pKdewlNWudLSDBaGOYKbeaP4NK7
+5t98biGCwWg5TbSYWGZizEqQXsP6JwSxeRV0mcy+rSDeJmAc61ZRpqPq5KM/p/9h
+3PFaTWwyI0PurKju7koSCTxdccK+efrCh2gdC/1cacwG0Jp9VJkqyTkaGa9LKkPz
+Y11aWOIv4x3kqdbQCtCev9eBCfHJxyYNrJgWVqA=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Buypass Class 3 Root CA O=Buypass AS-983163327
+# Subject: CN=Buypass Class 3 Root CA O=Buypass AS-983163327
+# Label: "Buypass Class 3 Root CA"
+# Serial: 2
+# MD5 Fingerprint: 3d:3b:18:9e:2c:64:5a:e8:d5:88:ce:0e:f9:37:c2:ec
+# SHA1 Fingerprint: da:fa:f7:fa:66:84:ec:06:8f:14:50:bd:c7:c2:81:a5:bc:a9:64:57
+# SHA256 Fingerprint: ed:f7:eb:bc:a2:7a:2a:38:4d:38:7b:7d:40:10:c6:66:e2:ed:b4:84:3e:4c:29:b4:ae:1d:5b:93:32:e6:b2:4d
+-----BEGIN CERTIFICATE-----
+MIIFWTCCA0GgAwIBAgIBAjANBgkqhkiG9w0BAQsFADBOMQswCQYDVQQGEwJOTzEd
+MBsGA1UECgwUQnV5cGFzcyBBUy05ODMxNjMzMjcxIDAeBgNVBAMMF0J1eXBhc3Mg
+Q2xhc3MgMyBSb290IENBMB4XDTEwMTAyNjA4Mjg1OFoXDTQwMTAyNjA4Mjg1OFow
+TjELMAkGA1UEBhMCTk8xHTAbBgNVBAoMFEJ1eXBhc3MgQVMtOTgzMTYzMzI3MSAw
+HgYDVQQDDBdCdXlwYXNzIENsYXNzIDMgUm9vdCBDQTCCAiIwDQYJKoZIhvcNAQEB
+BQADggIPADCCAgoCggIBAKXaCpUWUOOV8l6ddjEGMnqb8RB2uACatVI2zSRHsJ8Y
+ZLya9vrVediQYkwiL944PdbgqOkcLNt4EemOaFEVcsfzM4fkoF0LXOBXByow9c3E
+N3coTRiR5r/VUv1xLXA+58bEiuPwKAv0dpihi4dVsjoT/Lc+JzeOIuOoTyrvYLs9
+tznDDgFHmV0ST9tD+leh7fmdvhFHJlsTmKtdFoqwNxxXnUX/iJY2v7vKB3tvh2PX
+0DJq1l1sDPGzbjniazEuOQAnFN44wOwZZoYS6J1yFhNkUsepNxz9gjDthBgd9K5c
+/3ATAOux9TN6S9ZV+AWNS2mw9bMoNlwUxFFzTWsL8TQH2xc519woe2v1n/MuwU8X
+KhDzzMro6/1rqy6any2CbgTUUgGTLT2G/H783+9CHaZr77kgxve9oKeV/afmiSTY
+zIw0bOIjL9kSGiG5VZFvC5F5GQytQIgLcOJ60g7YaEi7ghM5EFjp2CoHxhLbWNvS
+O1UQRwUVZ2J+GGOmRj8JDlQyXr8NYnon74Do29lLBlo3WiXQCBJ31G8JUJc9yB3D
+34xFMFbG02SrZvPAXpacw8Tvw3xrizp5f7NJzz3iiZ+gMEuFuZyUJHmPfWupRWgP
+K9Dx2hzLabjKSWJtyNBjYt1gD1iqj6G8BaVmos8bdrKEZLFMOVLAMLrwjEsCsLa3
+AgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFEe4zf/lb+74suwv
+Tg75JbCOPGvDMA4GA1UdDwEB/wQEAwIBBjANBgkqhkiG9w0BAQsFAAOCAgEAACAj
+QTUEkMJAYmDv4jVM1z+s4jSQuKFvdvoWFqRINyzpkMLyPPgKn9iB5btb2iUspKdV
+cSQy9sgL8rxq+JOssgfCX5/bzMiKqr5qb+FJEMwx14C7u8jYog5kV+qi9cKpMRXS
+IGrs/CIBKM+GuIAeqcwRpTzyFrNHnfzSgCHEy9BHcEGhyoMZCCxt8l13nIoUE9Q2
+HJLw5QY33KbmkJs4j1xrG0aGQ0JfPgEHU1RdZX33inOhmlRaHylDFCfChQ+1iHsa
+O5S3HWCntZznKWlXWpuTekMwGwPXYshApqr8ZORK15FTAaggiG6cX0S5y2CBNOxv
+033aSF/rtJC8LakcC6wc1aJoIIAE1vyxjy+7SjENSoYc6+I2KSb12tjE8nVhz36u
+dmNKekBlk4f4HoCMhuWG1o8O/FMsYOgWYRqiPkN7zTlgVGr18okmAWiDSKIz6MkE
+kbIRNBE+6tBDGR8Dk5AM/1E9V/RBbuHLoL7ryWPNbczk+DaqaJ3tvV2XcEQNtg41
+3OEMXbugUZTLfhbrES+jkkXITHHZvMmZUldGL1DPvTVp9D0VzgalLA8+9oG6lLvD
+u79leNKGef9JOxqDDPDeeOzI8k1MGt6CKfjBWtrt7uYnXuhF0J0cUahoq0Tj0Itq
+4/g7u9xN12TyUb7mqqta6THuBrxzvxNiCp/HuZc=
+-----END CERTIFICATE-----
+
+# Issuer: CN=T-TeleSec GlobalRoot Class 3 O=T-Systems Enterprise Services GmbH OU=T-Systems Trust Center
+# Subject: CN=T-TeleSec GlobalRoot Class 3 O=T-Systems Enterprise Services GmbH OU=T-Systems Trust Center
+# Label: "T-TeleSec GlobalRoot Class 3"
+# Serial: 1
+# MD5 Fingerprint: ca:fb:40:a8:4e:39:92:8a:1d:fe:8e:2f:c4:27:ea:ef
+# SHA1 Fingerprint: 55:a6:72:3e:cb:f2:ec:cd:c3:23:74:70:19:9d:2a:be:11:e3:81:d1
+# SHA256 Fingerprint: fd:73:da:d3:1c:64:4f:f1:b4:3b:ef:0c:cd:da:96:71:0b:9c:d9:87:5e:ca:7e:31:70:7a:f3:e9:6d:52:2b:bd
+-----BEGIN CERTIFICATE-----
+MIIDwzCCAqugAwIBAgIBATANBgkqhkiG9w0BAQsFADCBgjELMAkGA1UEBhMCREUx
+KzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnByaXNlIFNlcnZpY2VzIEdtYkgxHzAd
+BgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50ZXIxJTAjBgNVBAMMHFQtVGVsZVNl
+YyBHbG9iYWxSb290IENsYXNzIDMwHhcNMDgxMDAxMTAyOTU2WhcNMzMxMDAxMjM1
+OTU5WjCBgjELMAkGA1UEBhMCREUxKzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnBy
+aXNlIFNlcnZpY2VzIEdtYkgxHzAdBgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50
+ZXIxJTAjBgNVBAMMHFQtVGVsZVNlYyBHbG9iYWxSb290IENsYXNzIDMwggEiMA0G
+CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQC9dZPwYiJvJK7genasfb3ZJNW4t/zN
+8ELg63iIVl6bmlQdTQyK9tPPcPRStdiTBONGhnFBSivwKixVA9ZIw+A5OO3yXDw/
+RLyTPWGrTs0NvvAgJ1gORH8EGoel15YUNpDQSXuhdfsaa3Ox+M6pCSzyU9XDFES4
+hqX2iys52qMzVNn6chr3IhUciJFrf2blw2qAsCTz34ZFiP0Zf3WHHx+xGwpzJFu5
+ZeAsVMhg02YXP+HMVDNzkQI6pn97djmiH5a2OK61yJN0HZ65tOVgnS9W0eDrXltM
+EnAMbEQgqxHY9Bn20pxSN+f6tsIxO0rUFJmtxxr1XV/6B7h8DR/Wgx6zAgMBAAGj
+QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBS1
+A/d2O2GCahKqGFPrAyGUv/7OyjANBgkqhkiG9w0BAQsFAAOCAQEAVj3vlNW92nOy
+WL6ukK2YJ5f+AbGwUgC4TeQbIXQbfsDuXmkqJa9c1h3a0nnJ85cp4IaH3gRZD/FZ
+1GSFS5mvJQQeyUapl96Cshtwn5z2r3Ex3XsFpSzTucpH9sry9uetuUg/vBa3wW30
+6gmv7PO15wWeph6KU1HWk4HMdJP2udqmJQV0eVp+QD6CSyYRMG7hP0HHRwA11fXT
+91Q+gT3aSWqas+8QPebrb9HIIkfLzM8BMZLZGOMivgkeGj5asuRrDFR6fUNOuIml
+e9eiPZaGzPImNC1qkp2aGtAw4l1OBLBfiyB+d8E9lYLRRpo7PHi4b6HQDWSieB4p
+TpPDpFQUWw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=EE Certification Centre Root CA O=AS Sertifitseerimiskeskus
+# Subject: CN=EE Certification Centre Root CA O=AS Sertifitseerimiskeskus
+# Label: "EE Certification Centre Root CA"
+# Serial: 112324828676200291871926431888494945866
+# MD5 Fingerprint: 43:5e:88:d4:7d:1a:4a:7e:fd:84:2e:52:eb:01:d4:6f
+# SHA1 Fingerprint: c9:a8:b9:e7:55:80:5e:58:e3:53:77:a7:25:eb:af:c3:7b:27:cc:d7
+# SHA256 Fingerprint: 3e:84:ba:43:42:90:85:16:e7:75:73:c0:99:2f:09:79:ca:08:4e:46:85:68:1f:f1:95:cc:ba:8a:22:9b:8a:76
+-----BEGIN CERTIFICATE-----
+MIIEAzCCAuugAwIBAgIQVID5oHPtPwBMyonY43HmSjANBgkqhkiG9w0BAQUFADB1
+MQswCQYDVQQGEwJFRTEiMCAGA1UECgwZQVMgU2VydGlmaXRzZWVyaW1pc2tlc2t1
+czEoMCYGA1UEAwwfRUUgQ2VydGlmaWNhdGlvbiBDZW50cmUgUm9vdCBDQTEYMBYG
+CSqGSIb3DQEJARYJcGtpQHNrLmVlMCIYDzIwMTAxMDMwMTAxMDMwWhgPMjAzMDEy
+MTcyMzU5NTlaMHUxCzAJBgNVBAYTAkVFMSIwIAYDVQQKDBlBUyBTZXJ0aWZpdHNl
+ZXJpbWlza2Vza3VzMSgwJgYDVQQDDB9FRSBDZXJ0aWZpY2F0aW9uIENlbnRyZSBS
+b290IENBMRgwFgYJKoZIhvcNAQkBFglwa2lAc2suZWUwggEiMA0GCSqGSIb3DQEB
+AQUAA4IBDwAwggEKAoIBAQDIIMDs4MVLqwd4lfNE7vsLDP90jmG7sWLqI9iroWUy
+euuOF0+W2Ap7kaJjbMeMTC55v6kF/GlclY1i+blw7cNRfdCT5mzrMEvhvH2/UpvO
+bntl8jixwKIy72KyaOBhU8E2lf/slLo2rpwcpzIP5Xy0xm90/XsY6KxX7QYgSzIw
+WFv9zajmofxwvI6Sc9uXp3whrj3B9UiHbCe9nyV0gVWw93X2PaRka9ZP585ArQ/d
+MtO8ihJTmMmJ+xAdTX7Nfh9WDSFwhfYggx/2uh8Ej+p3iDXE/+pOoYtNP2MbRMNE
+1CV2yreN1x5KZmTNXMWcg+HCCIia7E6j8T4cLNlsHaFLAgMBAAGjgYowgYcwDwYD
+VR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFBLyWj7qVhy/
+zQas8fElyalL1BSZMEUGA1UdJQQ+MDwGCCsGAQUFBwMCBggrBgEFBQcDAQYIKwYB
+BQUHAwMGCCsGAQUFBwMEBggrBgEFBQcDCAYIKwYBBQUHAwkwDQYJKoZIhvcNAQEF
+BQADggEBAHv25MANqhlHt01Xo/6tu7Fq1Q+e2+RjxY6hUFaTlrg4wCQiZrxTFGGV
+v9DHKpY5P30osxBAIWrEr7BSdxjhlthWXePdNl4dp1BUoMUq5KqMlIpPnTX/dqQG
+E5Gion0ARD9V04I8GtVbvFZMIi5GQ4okQC3zErg7cBqklrkar4dBGmoYDQZPxz5u
+uSlNDUmJEYcyW+ZLBMjkXOZ0c5RdFpgTlf7727FE5TpwrDdr5rMzcijJs1eg9gIW
+iAYLtqZLICjU3j2LrTcFU3T+bsy8QxdxXvnFzBqpYe73dgzzcvRyrc9yAjYHR8/v
+GVCJYMzpJJUPwssd8m92kMfMdcGWxZ0=
+-----END CERTIFICATE-----
+
+# Issuer: CN=D-TRUST Root Class 3 CA 2 2009 O=D-Trust GmbH
+# Subject: CN=D-TRUST Root Class 3 CA 2 2009 O=D-Trust GmbH
+# Label: "D-TRUST Root Class 3 CA 2 2009"
+# Serial: 623603
+# MD5 Fingerprint: cd:e0:25:69:8d:47:ac:9c:89:35:90:f7:fd:51:3d:2f
+# SHA1 Fingerprint: 58:e8:ab:b0:36:15:33:fb:80:f7:9b:1b:6d:29:d3:ff:8d:5f:00:f0
+# SHA256 Fingerprint: 49:e7:a4:42:ac:f0:ea:62:87:05:00:54:b5:25:64:b6:50:e4:f4:9e:42:e3:48:d6:aa:38:e0:39:e9:57:b1:c1
+-----BEGIN CERTIFICATE-----
+MIIEMzCCAxugAwIBAgIDCYPzMA0GCSqGSIb3DQEBCwUAME0xCzAJBgNVBAYTAkRF
+MRUwEwYDVQQKDAxELVRydXN0IEdtYkgxJzAlBgNVBAMMHkQtVFJVU1QgUm9vdCBD
+bGFzcyAzIENBIDIgMjAwOTAeFw0wOTExMDUwODM1NThaFw0yOTExMDUwODM1NTha
+ME0xCzAJBgNVBAYTAkRFMRUwEwYDVQQKDAxELVRydXN0IEdtYkgxJzAlBgNVBAMM
+HkQtVFJVU1QgUm9vdCBDbGFzcyAzIENBIDIgMjAwOTCCASIwDQYJKoZIhvcNAQEB
+BQADggEPADCCAQoCggEBANOySs96R+91myP6Oi/WUEWJNTrGa9v+2wBoqOADER03
+UAifTUpolDWzU9GUY6cgVq/eUXjsKj3zSEhQPgrfRlWLJ23DEE0NkVJD2IfgXU42
+tSHKXzlABF9bfsyjxiupQB7ZNoTWSPOSHjRGICTBpFGOShrvUD9pXRl/RcPHAY9R
+ySPocq60vFYJfxLLHLGvKZAKyVXMD9O0Gu1HNVpK7ZxzBCHQqr0ME7UAyiZsxGsM
+lFqVlNpQmvH/pStmMaTJOKDfHR+4CS7zp+hnUquVH+BGPtikw8paxTGA6Eian5Rp
+/hnd2HN8gcqW3o7tszIFZYQ05ub9VxC1X3a/L7AQDcUCAwEAAaOCARowggEWMA8G
+A1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFP3aFMSfMN4hvR5COfyrYyNJ4PGEMA4G
+A1UdDwEB/wQEAwIBBjCB0wYDVR0fBIHLMIHIMIGAoH6gfIZ6bGRhcDovL2RpcmVj
+dG9yeS5kLXRydXN0Lm5ldC9DTj1ELVRSVVNUJTIwUm9vdCUyMENsYXNzJTIwMyUy
+MENBJTIwMiUyMDIwMDksTz1ELVRydXN0JTIwR21iSCxDPURFP2NlcnRpZmljYXRl
+cmV2b2NhdGlvbmxpc3QwQ6BBoD+GPWh0dHA6Ly93d3cuZC10cnVzdC5uZXQvY3Js
+L2QtdHJ1c3Rfcm9vdF9jbGFzc18zX2NhXzJfMjAwOS5jcmwwDQYJKoZIhvcNAQEL
+BQADggEBAH+X2zDI36ScfSF6gHDOFBJpiBSVYEQBrLLpME+bUMJm2H6NMLVwMeni
+acfzcNsgFYbQDfC+rAF1hM5+n02/t2A7nPPKHeJeaNijnZflQGDSNiH+0LS4F9p0
+o3/U37CYAqxva2ssJSRyoWXuJVrl5jLn8t+rSfrzkGkj2wTZ51xY/GXUl77M/C4K
+zCUqNQT4YJEVdT1B/yMfGchs64JTBKbkTCJNjYy6zltz7GRUUG3RnFX7acM2w4y8
+PIWmawomDeCTmGCufsYkl4phX5GOZpIJhzbNi5stPvZR1FDUWSi9g/LMKHtThm3Y
+Johw1+qRzT65ysCQblrGXnRl11z+o+I=
+-----END CERTIFICATE-----
+
+# Issuer: CN=D-TRUST Root Class 3 CA 2 EV 2009 O=D-Trust GmbH
+# Subject: CN=D-TRUST Root Class 3 CA 2 EV 2009 O=D-Trust GmbH
+# Label: "D-TRUST Root Class 3 CA 2 EV 2009"
+# Serial: 623604
+# MD5 Fingerprint: aa:c6:43:2c:5e:2d:cd:c4:34:c0:50:4f:11:02:4f:b6
+# SHA1 Fingerprint: 96:c9:1b:0b:95:b4:10:98:42:fa:d0:d8:22:79:fe:60:fa:b9:16:83
+# SHA256 Fingerprint: ee:c5:49:6b:98:8c:e9:86:25:b9:34:09:2e:ec:29:08:be:d0:b0:f3:16:c2:d4:73:0c:84:ea:f1:f3:d3:48:81
+-----BEGIN CERTIFICATE-----
+MIIEQzCCAyugAwIBAgIDCYP0MA0GCSqGSIb3DQEBCwUAMFAxCzAJBgNVBAYTAkRF
+MRUwEwYDVQQKDAxELVRydXN0IEdtYkgxKjAoBgNVBAMMIUQtVFJVU1QgUm9vdCBD
+bGFzcyAzIENBIDIgRVYgMjAwOTAeFw0wOTExMDUwODUwNDZaFw0yOTExMDUwODUw
+NDZaMFAxCzAJBgNVBAYTAkRFMRUwEwYDVQQKDAxELVRydXN0IEdtYkgxKjAoBgNV
+BAMMIUQtVFJVU1QgUm9vdCBDbGFzcyAzIENBIDIgRVYgMjAwOTCCASIwDQYJKoZI
+hvcNAQEBBQADggEPADCCAQoCggEBAJnxhDRwui+3MKCOvXwEz75ivJn9gpfSegpn
+ljgJ9hBOlSJzmY3aFS3nBfwZcyK3jpgAvDw9rKFs+9Z5JUut8Mxk2og+KbgPCdM0
+3TP1YtHhzRnp7hhPTFiu4h7WDFsVWtg6uMQYZB7jM7K1iXdODL/ZlGsTl28So/6Z
+qQTMFexgaDbtCHu39b+T7WYxg4zGcTSHThfqr4uRjRxWQa4iN1438h3Z0S0NL2lR
+p75mpoo6Kr3HGrHhFPC+Oh25z1uxav60sUYgovseO3Dvk5h9jHOW8sXvhXCtKSb8
+HgQ+HKDYD8tSg2J87otTlZCpV6LqYQXY+U3EJ/pure3511H3a6UCAwEAAaOCASQw
+ggEgMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFNOUikxiEyoZLsyvcop9Ntea
+HNxnMA4GA1UdDwEB/wQEAwIBBjCB3QYDVR0fBIHVMIHSMIGHoIGEoIGBhn9sZGFw
+Oi8vZGlyZWN0b3J5LmQtdHJ1c3QubmV0L0NOPUQtVFJVU1QlMjBSb290JTIwQ2xh
+c3MlMjAzJTIwQ0ElMjAyJTIwRVYlMjAyMDA5LE89RC1UcnVzdCUyMEdtYkgsQz1E
+RT9jZXJ0aWZpY2F0ZXJldm9jYXRpb25saXN0MEagRKBChkBodHRwOi8vd3d3LmQt
+dHJ1c3QubmV0L2NybC9kLXRydXN0X3Jvb3RfY2xhc3NfM19jYV8yX2V2XzIwMDku
+Y3JsMA0GCSqGSIb3DQEBCwUAA4IBAQA07XtaPKSUiO8aEXUHL7P+PPoeUSbrh/Yp
+3uDx1MYkCenBz1UbtDDZzhr+BlGmFaQt77JLvyAoJUnRpjZ3NOhk31KxEcdzes05
+nsKtjHEh8lprr988TlWvsoRlFIm5d8sqMb7Po23Pb0iUMkZv53GMoKaEGTcH8gNF
+CSuGdXzfX2lXANtu2KZyIktQ1HWYVt+3GP9DQ1CuekR78HlR10M9p9OB0/DJT7na
+xpeG0ILD5EJt/rDiZE4OJudANCa1CInXCGNjOCd1HjPqbqjdn5lPdE2BiYBL3ZqX
+KVwvvoFBuYz/6n1gBp7N1z3TLqMVvKjmJuVvw9y4AyHqnxbxLFS1
+-----END CERTIFICATE-----
+
+# Issuer: CN=CA Disig Root R2 O=Disig a.s.
+# Subject: CN=CA Disig Root R2 O=Disig a.s.
+# Label: "CA Disig Root R2"
+# Serial: 10572350602393338211
+# MD5 Fingerprint: 26:01:fb:d8:27:a7:17:9a:45:54:38:1a:43:01:3b:03
+# SHA1 Fingerprint: b5:61:eb:ea:a4:de:e4:25:4b:69:1a:98:a5:57:47:c2:34:c7:d9:71
+# SHA256 Fingerprint: e2:3d:4a:03:6d:7b:70:e9:f5:95:b1:42:20:79:d2:b9:1e:df:bb:1f:b6:51:a0:63:3e:aa:8a:9d:c5:f8:07:03
+-----BEGIN CERTIFICATE-----
+MIIFaTCCA1GgAwIBAgIJAJK4iNuwisFjMA0GCSqGSIb3DQEBCwUAMFIxCzAJBgNV
+BAYTAlNLMRMwEQYDVQQHEwpCcmF0aXNsYXZhMRMwEQYDVQQKEwpEaXNpZyBhLnMu
+MRkwFwYDVQQDExBDQSBEaXNpZyBSb290IFIyMB4XDTEyMDcxOTA5MTUzMFoXDTQy
+MDcxOTA5MTUzMFowUjELMAkGA1UEBhMCU0sxEzARBgNVBAcTCkJyYXRpc2xhdmEx
+EzARBgNVBAoTCkRpc2lnIGEucy4xGTAXBgNVBAMTEENBIERpc2lnIFJvb3QgUjIw
+ggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCio8QACdaFXS1tFPbCw3Oe
+NcJxVX6B+6tGUODBfEl45qt5WDza/3wcn9iXAng+a0EE6UG9vgMsRfYvZNSrXaNH
+PWSb6WiaxswbP7q+sos0Ai6YVRn8jG+qX9pMzk0DIaPY0jSTVpbLTAwAFjxfGs3I
+x2ymrdMxp7zo5eFm1tL7A7RBZckQrg4FY8aAamkw/dLukO8NJ9+flXP04SXabBbe
+QTg06ov80egEFGEtQX6sx3dOy1FU+16SGBsEWmjGycT6txOgmLcRK7fWV8x8nhfR
+yyX+hk4kLlYMeE2eARKmK6cBZW58Yh2EhN/qwGu1pSqVg8NTEQxzHQuyRpDRQjrO
+QG6Vrf/GlK1ul4SOfW+eioANSW1z4nuSHsPzwfPrLgVv2RvPN3YEyLRa5Beny912
+H9AZdugsBbPWnDTYltxhh5EF5EQIM8HauQhl1K6yNg3ruji6DOWbnuuNZt2Zz9aJ
+QfYEkoopKW1rOhzndX0CcQ7zwOe9yxndnWCywmZgtrEE7snmhrmaZkCo5xHtgUUD
+i/ZnWejBBhG93c+AAk9lQHhcR1DIm+YfgXvkRKhbhZri3lrVx/k6RGZL5DJUfORs
+nLMOPReisjQS1n6yqEm70XooQL6iFh/f5DcfEXP7kAplQ6INfPgGAVUzfbANuPT1
+rqVCV3w2EYx7XsQDnYx5nQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1Ud
+DwEB/wQEAwIBBjAdBgNVHQ4EFgQUtZn4r7CU9eMg1gqtzk5WpC5uQu0wDQYJKoZI
+hvcNAQELBQADggIBACYGXnDnZTPIgm7ZnBc6G3pmsgH2eDtpXi/q/075KMOYKmFM
+tCQSin1tERT3nLXK5ryeJ45MGcipvXrA1zYObYVybqjGom32+nNjf7xueQgcnYqf
+GopTpti72TVVsRHFqQOzVju5hJMiXn7B9hJSi+osZ7z+Nkz1uM/Rs0mSO9MpDpkb
+lvdhuDvEK7Z4bLQjb/D907JedR+Zlais9trhxTF7+9FGs9K8Z7RiVLoJ92Owk6Ka
++elSLotgEqv89WBW7xBci8QaQtyDW2QOy7W81k/BfDxujRNt+3vrMNDcTa/F1bal
+TFtxyegxvug4BkihGuLq0t4SOVga/4AOgnXmt8kHbA7v/zjxmHHEt38OFdAlab0i
+nSvtBfZGR6ztwPDUO+Ls7pZbkBNOHlY667DvlruWIxG68kOGdGSVyCh13x01utI3
+gzhTODY7z2zp+WsO0PsE6E9312UBeIYMej4hYvF/Y3EMyZ9E26gnonW+boE+18Dr
+G5gPcFw0sorMwIUY6256s/daoQe/qUKS82Ail+QUoQebTnbAjn39pCXHR+3/H3Os
+zMOl6W8KjptlwlCFtaOgUxLMVYdh84GuEEZhvUQhuMI9dM9+JDX6HAcOmz0iyu8x
+L4ysEr3vQCj8KWefshNPZiTEUxnpHikV7+ZtsH8tZ/3zbBt1RqPlShfppNcL
+-----END CERTIFICATE-----
+
+# Issuer: CN=ACCVRAIZ1 O=ACCV OU=PKIACCV
+# Subject: CN=ACCVRAIZ1 O=ACCV OU=PKIACCV
+# Label: "ACCVRAIZ1"
+# Serial: 6828503384748696800
+# MD5 Fingerprint: d0:a0:5a:ee:05:b6:09:94:21:a1:7d:f1:b2:29:82:02
+# SHA1 Fingerprint: 93:05:7a:88:15:c6:4f:ce:88:2f:fa:91:16:52:28:78:bc:53:64:17
+# SHA256 Fingerprint: 9a:6e:c0:12:e1:a7:da:9d:be:34:19:4d:47:8a:d7:c0:db:18:22:fb:07:1d:f1:29:81:49:6e:d1:04:38:41:13
+-----BEGIN CERTIFICATE-----
+MIIH0zCCBbugAwIBAgIIXsO3pkN/pOAwDQYJKoZIhvcNAQEFBQAwQjESMBAGA1UE
+AwwJQUNDVlJBSVoxMRAwDgYDVQQLDAdQS0lBQ0NWMQ0wCwYDVQQKDARBQ0NWMQsw
+CQYDVQQGEwJFUzAeFw0xMTA1MDUwOTM3MzdaFw0zMDEyMzEwOTM3MzdaMEIxEjAQ
+BgNVBAMMCUFDQ1ZSQUlaMTEQMA4GA1UECwwHUEtJQUNDVjENMAsGA1UECgwEQUND
+VjELMAkGA1UEBhMCRVMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCb
+qau/YUqXry+XZpp0X9DZlv3P4uRm7x8fRzPCRKPfmt4ftVTdFXxpNRFvu8gMjmoY
+HtiP2Ra8EEg2XPBjs5BaXCQ316PWywlxufEBcoSwfdtNgM3802/J+Nq2DoLSRYWo
+G2ioPej0RGy9ocLLA76MPhMAhN9KSMDjIgro6TenGEyxCQ0jVn8ETdkXhBilyNpA
+lHPrzg5XPAOBOp0KoVdDaaxXbXmQeOW1tDvYvEyNKKGno6e6Ak4l0Squ7a4DIrhr
+IA8wKFSVf+DuzgpmndFALW4ir50awQUZ0m/A8p/4e7MCQvtQqR0tkw8jq8bBD5L/
+0KIV9VMJcRz/RROE5iZe+OCIHAr8Fraocwa48GOEAqDGWuzndN9wrqODJerWx5eH
+k6fGioozl2A3ED6XPm4pFdahD9GILBKfb6qkxkLrQaLjlUPTAYVtjrs78yM2x/47
+4KElB0iryYl0/wiPgL/AlmXz7uxLaL2diMMxs0Dx6M/2OLuc5NF/1OVYm3z61PMO
+m3WR5LpSLhl+0fXNWhn8ugb2+1KoS5kE3fj5tItQo05iifCHJPqDQsGH+tUtKSpa
+cXpkatcnYGMN285J9Y0fkIkyF/hzQ7jSWpOGYdbhdQrqeWZ2iE9x6wQl1gpaepPl
+uUsXQA+xtrn13k/c4LOsOxFwYIRKQ26ZIMApcQrAZQIDAQABo4ICyzCCAscwfQYI
+KwYBBQUHAQEEcTBvMEwGCCsGAQUFBzAChkBodHRwOi8vd3d3LmFjY3YuZXMvZmls
+ZWFkbWluL0FyY2hpdm9zL2NlcnRpZmljYWRvcy9yYWl6YWNjdjEuY3J0MB8GCCsG
+AQUFBzABhhNodHRwOi8vb2NzcC5hY2N2LmVzMB0GA1UdDgQWBBTSh7Tj3zcnk1X2
+VuqB5TbMjB4/vTAPBgNVHRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFNKHtOPfNyeT
+VfZW6oHlNsyMHj+9MIIBcwYDVR0gBIIBajCCAWYwggFiBgRVHSAAMIIBWDCCASIG
+CCsGAQUFBwICMIIBFB6CARAAQQB1AHQAbwByAGkAZABhAGQAIABkAGUAIABDAGUA
+cgB0AGkAZgBpAGMAYQBjAGkA8wBuACAAUgBhAO0AegAgAGQAZQAgAGwAYQAgAEEA
+QwBDAFYAIAAoAEEAZwBlAG4AYwBpAGEAIABkAGUAIABUAGUAYwBuAG8AbABvAGcA
+7QBhACAAeQAgAEMAZQByAHQAaQBmAGkAYwBhAGMAaQDzAG4AIABFAGwAZQBjAHQA
+cgDzAG4AaQBjAGEALAAgAEMASQBGACAAUQA0ADYAMAAxADEANQA2AEUAKQAuACAA
+QwBQAFMAIABlAG4AIABoAHQAdABwADoALwAvAHcAdwB3AC4AYQBjAGMAdgAuAGUA
+czAwBggrBgEFBQcCARYkaHR0cDovL3d3dy5hY2N2LmVzL2xlZ2lzbGFjaW9uX2Mu
+aHRtMFUGA1UdHwROMEwwSqBIoEaGRGh0dHA6Ly93d3cuYWNjdi5lcy9maWxlYWRt
+aW4vQXJjaGl2b3MvY2VydGlmaWNhZG9zL3JhaXphY2N2MV9kZXIuY3JsMA4GA1Ud
+DwEB/wQEAwIBBjAXBgNVHREEEDAOgQxhY2N2QGFjY3YuZXMwDQYJKoZIhvcNAQEF
+BQADggIBAJcxAp/n/UNnSEQU5CmH7UwoZtCPNdpNYbdKl02125DgBS4OxnnQ8pdp
+D70ER9m+27Up2pvZrqmZ1dM8MJP1jaGo/AaNRPTKFpV8M9xii6g3+CfYCS0b78gU
+JyCpZET/LtZ1qmxNYEAZSUNUY9rizLpm5U9EelvZaoErQNV/+QEnWCzI7UiRfD+m
+AM/EKXMRNt6GGT6d7hmKG9Ww7Y49nCrADdg9ZuM8Db3VlFzi4qc1GwQA9j9ajepD
+vV+JHanBsMyZ4k0ACtrJJ1vnE5Bc5PUzolVt3OAJTS+xJlsndQAJxGJ3KQhfnlms
+tn6tn1QwIgPBHnFk/vk4CpYY3QIUrCPLBhwepH2NDd4nQeit2hW3sCPdK6jT2iWH
+7ehVRE2I9DZ+hJp4rPcOVkkO1jMl1oRQQmwgEh0q1b688nCBpHBgvgW1m54ERL5h
+I6zppSSMEYCUWqKiuUnSwdzRp+0xESyeGabu4VXhwOrPDYTkF7eifKXeVSUG7szA
+h1xA2syVP1XgNce4hL60Xc16gwFy7ofmXx2utYXGJt/mwZrpHgJHnyqobalbz+xF
+d3+YJ5oyXSrjhO7FmGYvliAd3djDJ9ew+f7Zfc3Qn48LFFhRny+Lwzgt3uiP1o2H
+pPVWQxaZLPSkVrQ0uGE3ycJYgBugl6H8WY3pEfbRD0tVNEYqi4Y7
+-----END CERTIFICATE-----
+
+# Issuer: CN=TWCA Global Root CA O=TAIWAN-CA OU=Root CA
+# Subject: CN=TWCA Global Root CA O=TAIWAN-CA OU=Root CA
+# Label: "TWCA Global Root CA"
+# Serial: 3262
+# MD5 Fingerprint: f9:03:7e:cf:e6:9e:3c:73:7a:2a:90:07:69:ff:2b:96
+# SHA1 Fingerprint: 9c:bb:48:53:f6:a4:f6:d3:52:a4:e8:32:52:55:60:13:f5:ad:af:65
+# SHA256 Fingerprint: 59:76:90:07:f7:68:5d:0f:cd:50:87:2f:9f:95:d5:75:5a:5b:2b:45:7d:81:f3:69:2b:61:0a:98:67:2f:0e:1b
+-----BEGIN CERTIFICATE-----
+MIIFQTCCAymgAwIBAgICDL4wDQYJKoZIhvcNAQELBQAwUTELMAkGA1UEBhMCVFcx
+EjAQBgNVBAoTCVRBSVdBTi1DQTEQMA4GA1UECxMHUm9vdCBDQTEcMBoGA1UEAxMT
+VFdDQSBHbG9iYWwgUm9vdCBDQTAeFw0xMjA2MjcwNjI4MzNaFw0zMDEyMzExNTU5
+NTlaMFExCzAJBgNVBAYTAlRXMRIwEAYDVQQKEwlUQUlXQU4tQ0ExEDAOBgNVBAsT
+B1Jvb3QgQ0ExHDAaBgNVBAMTE1RXQ0EgR2xvYmFsIFJvb3QgQ0EwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQCwBdvI64zEbooh745NnHEKH1Jw7W2CnJfF
+10xORUnLQEK1EjRsGcJ0pDFfhQKX7EMzClPSnIyOt7h52yvVavKOZsTuKwEHktSz
+0ALfUPZVr2YOy+BHYC8rMjk1Ujoog/h7FsYYuGLWRyWRzvAZEk2tY/XTP3VfKfCh
+MBwqoJimFb3u/Rk28OKRQ4/6ytYQJ0lM793B8YVwm8rqqFpD/G2Gb3PpN0Wp8DbH
+zIh1HrtsBv+baz4X7GGqcXzGHaL3SekVtTzWoWH1EfcFbx39Eb7QMAfCKbAJTibc
+46KokWofwpFFiFzlmLhxpRUZyXx1EcxwdE8tmx2RRP1WKKD+u4ZqyPpcC1jcxkt2
+yKsi2XMPpfRaAok/T54igu6idFMqPVMnaR1sjjIsZAAmY2E2TqNGtz99sy2sbZCi
+laLOz9qC5wc0GZbpuCGqKX6mOL6OKUohZnkfs8O1CWfe1tQHRvMq2uYiN2DLgbYP
+oA/pyJV/v1WRBXrPPRXAb94JlAGD1zQbzECl8LibZ9WYkTunhHiVJqRaCPgrdLQA
+BDzfuBSO6N+pjWxnkjMdwLfS7JLIvgm/LCkFbwJrnu+8vyq8W8BQj0FwcYeyTbcE
+qYSjMq+u7msXi7Kx/mzhkIyIqJdIzshNy/MGz19qCkKxHh53L46g5pIOBvwFItIm
+4TFRfTLcDwIDAQABoyMwITAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB
+/zANBgkqhkiG9w0BAQsFAAOCAgEAXzSBdu+WHdXltdkCY4QWwa6gcFGn90xHNcgL
+1yg9iXHZqjNB6hQbbCEAwGxCGX6faVsgQt+i0trEfJdLjbDorMjupWkEmQqSpqsn
+LhpNgb+E1HAerUf+/UqdM+DyucRFCCEK2mlpc3INvjT+lIutwx4116KD7+U4x6WF
+H6vPNOw/KP4M8VeGTslV9xzU2KV9Bnpv1d8Q34FOIWWxtuEXeZVFBs5fzNxGiWNo
+RI2T9GRwoD2dKAXDOXC4Ynsg/eTb6QihuJ49CcdP+yz4k3ZB3lLg4VfSnQO8d57+
+nile98FRYB/e2guyLXW3Q0iT5/Z5xoRdgFlglPx4mI88k1HtQJAH32RjJMtOcQWh
+15QaiDLxInQirqWm2BJpTGCjAu4r7NRjkgtevi92a6O2JryPA9gK8kxkRr05YuWW
+6zRjESjMlfGt7+/cgFhI6Uu46mWs6fyAtbXIRfmswZ/ZuepiiI7E8UuDEq3mi4TW
+nsLrgxifarsbJGAzcMzs9zLzXNl5fe+epP7JI8Mk7hWSsT2RTyaGvWZzJBPqpK5j
+wa19hAM8EHiGG3njxPPyBJUgriOCxLM6AGK/5jYk4Ve6xx6QddVfP5VhK8E7zeWz
+aGHQRiapIVJpLesux+t3zqY6tQMzT3bR51xUAV3LePTJDL/PEo4XLSNolOer/qmy
+KwbQBM0=
+-----END CERTIFICATE-----
+
+# Issuer: CN=TeliaSonera Root CA v1 O=TeliaSonera
+# Subject: CN=TeliaSonera Root CA v1 O=TeliaSonera
+# Label: "TeliaSonera Root CA v1"
+# Serial: 199041966741090107964904287217786801558
+# MD5 Fingerprint: 37:41:49:1b:18:56:9a:26:f5:ad:c2:66:fb:40:a5:4c
+# SHA1 Fingerprint: 43:13:bb:96:f1:d5:86:9b:c1:4e:6a:92:f6:cf:f6:34:69:87:82:37
+# SHA256 Fingerprint: dd:69:36:fe:21:f8:f0:77:c1:23:a1:a5:21:c1:22:24:f7:22:55:b7:3e:03:a7:26:06:93:e8:a2:4b:0f:a3:89
+-----BEGIN CERTIFICATE-----
+MIIFODCCAyCgAwIBAgIRAJW+FqD3LkbxezmCcvqLzZYwDQYJKoZIhvcNAQEFBQAw
+NzEUMBIGA1UECgwLVGVsaWFTb25lcmExHzAdBgNVBAMMFlRlbGlhU29uZXJhIFJv
+b3QgQ0EgdjEwHhcNMDcxMDE4MTIwMDUwWhcNMzIxMDE4MTIwMDUwWjA3MRQwEgYD
+VQQKDAtUZWxpYVNvbmVyYTEfMB0GA1UEAwwWVGVsaWFTb25lcmEgUm9vdCBDQSB2
+MTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAMK+6yfwIaPzaSZVfp3F
+VRaRXP3vIb9TgHot0pGMYzHw7CTww6XScnwQbfQ3t+XmfHnqjLWCi65ItqwA3GV1
+7CpNX8GH9SBlK4GoRz6JI5UwFpB/6FcHSOcZrr9FZ7E3GwYq/t75rH2D+1665I+X
+Z75Ljo1kB1c4VWk0Nj0TSO9P4tNmHqTPGrdeNjPUtAa9GAH9d4RQAEX1jF3oI7x+
+/jXh7VB7qTCNGdMJjmhnXb88lxhTuylixcpecsHHltTbLaC0H2kD7OriUPEMPPCs
+81Mt8Bz17Ww5OXOAFshSsCPN4D7c3TxHoLs1iuKYaIu+5b9y7tL6pe0S7fyYGKkm
+dtwoSxAgHNN/Fnct7W+A90m7UwW7XWjH1Mh1Fj+JWov3F0fUTPHSiXk+TT2YqGHe
+Oh7S+F4D4MHJHIzTjU3TlTazN19jY5szFPAtJmtTfImMMsJu7D0hADnJoWjiUIMu
+sDor8zagrC/kb2HCUQk5PotTubtn2txTuXZZNp1D5SDgPTJghSJRt8czu90VL6R4
+pgd7gUY2BIbdeTXHlSw7sKMXNeVzH7RcWe/a6hBle3rQf5+ztCo3O3CLm1u5K7fs
+slESl1MpWtTwEhDcTwK7EpIvYtQ/aUN8Ddb8WHUBiJ1YFkveupD/RwGJBmr2X7KQ
+arMCpgKIv7NHfirZ1fpoeDVNAgMBAAGjPzA9MA8GA1UdEwEB/wQFMAMBAf8wCwYD
+VR0PBAQDAgEGMB0GA1UdDgQWBBTwj1k4ALP1j5qWDNXr+nuqF+gTEjANBgkqhkiG
+9w0BAQUFAAOCAgEAvuRcYk4k9AwI//DTDGjkk0kiP0Qnb7tt3oNmzqjMDfz1mgbl
+dxSR651Be5kqhOX//CHBXfDkH1e3damhXwIm/9fH907eT/j3HEbAek9ALCI18Bmx
+0GtnLLCo4MBANzX2hFxc469CeP6nyQ1Q6g2EdvZR74NTxnr/DlZJLo961gzmJ1Tj
+TQpgcmLNkQfWpb/ImWvtxBnmq0wROMVvMeJuScg/doAmAyYp4Db29iBT4xdwNBed
+Y2gea+zDTYa4EzAvXUYNR0PVG6pZDrlcjQZIrXSHX8f8MVRBE+LHIQ6e4B4N4cB7
+Q4WQxYpYxmUKeFfyxiMPAdkgS94P+5KFdSpcc41teyWRyu5FrgZLAMzTsVlQ2jqI
+OylDRl6XK1TOU2+NSueW+r9xDkKLfP0ooNBIytrEgUy7onOTJsjrDNYmiLbAJM+7
+vVvrdX3pCI6GMyx5dwlppYn8s3CQh3aP0yK7Qs69cwsgJirQmz1wHiRszYd2qReW
+t88NkvuOGKmYSdGe/mBEciG5Ge3C9THxOUiIkCR1VBatzvT4aRRkOfujuLpwQMcn
+HL/EVlP6Y2XQ8xwOFvVrhlhNGNTkDY6lnVuR3HYkUD/GKvvZt5y11ubQ2egZixVx
+SK236thZiNSQvxaz2emsWWFUyBy6ysHK4bkgTI86k4mloMy/0/Z1pHWWbVY=
+-----END CERTIFICATE-----
+
+# Issuer: CN=E-Tugra Certification Authority O=E-Tu\u011fra EBG Bili\u015fim Teknolojileri ve Hizmetleri A.\u015e. OU=E-Tugra Sertifikasyon Merkezi
+# Subject: CN=E-Tugra Certification Authority O=E-Tu\u011fra EBG Bili\u015fim Teknolojileri ve Hizmetleri A.\u015e. OU=E-Tugra Sertifikasyon Merkezi
+# Label: "E-Tugra Certification Authority"
+# Serial: 7667447206703254355
+# MD5 Fingerprint: b8:a1:03:63:b0:bd:21:71:70:8a:6f:13:3a:bb:79:49
+# SHA1 Fingerprint: 51:c6:e7:08:49:06:6e:f3:92:d4:5c:a0:0d:6d:a3:62:8f:c3:52:39
+# SHA256 Fingerprint: b0:bf:d5:2b:b0:d7:d9:bd:92:bf:5d:4d:c1:3d:a2:55:c0:2c:54:2f:37:83:65:ea:89:39:11:f5:5e:55:f2:3c
+-----BEGIN CERTIFICATE-----
+MIIGSzCCBDOgAwIBAgIIamg+nFGby1MwDQYJKoZIhvcNAQELBQAwgbIxCzAJBgNV
+BAYTAlRSMQ8wDQYDVQQHDAZBbmthcmExQDA+BgNVBAoMN0UtVHXEn3JhIEVCRyBC
+aWxpxZ9pbSBUZWtub2xvamlsZXJpIHZlIEhpem1ldGxlcmkgQS7Fni4xJjAkBgNV
+BAsMHUUtVHVncmEgU2VydGlmaWthc3lvbiBNZXJrZXppMSgwJgYDVQQDDB9FLVR1
+Z3JhIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MB4XDTEzMDMwNTEyMDk0OFoXDTIz
+MDMwMzEyMDk0OFowgbIxCzAJBgNVBAYTAlRSMQ8wDQYDVQQHDAZBbmthcmExQDA+
+BgNVBAoMN0UtVHXEn3JhIEVCRyBCaWxpxZ9pbSBUZWtub2xvamlsZXJpIHZlIEhp
+em1ldGxlcmkgQS7Fni4xJjAkBgNVBAsMHUUtVHVncmEgU2VydGlmaWthc3lvbiBN
+ZXJrZXppMSgwJgYDVQQDDB9FLVR1Z3JhIENlcnRpZmljYXRpb24gQXV0aG9yaXR5
+MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA4vU/kwVRHoViVF56C/UY
+B4Oufq9899SKa6VjQzm5S/fDxmSJPZQuVIBSOTkHS0vdhQd2h8y/L5VMzH2nPbxH
+D5hw+IyFHnSOkm0bQNGZDbt1bsipa5rAhDGvykPL6ys06I+XawGb1Q5KCKpbknSF
+Q9OArqGIW66z6l7LFpp3RMih9lRozt6Plyu6W0ACDGQXwLWTzeHxE2bODHnv0ZEo
+q1+gElIwcxmOj+GMB6LDu0rw6h8VqO4lzKRG+Bsi77MOQ7osJLjFLFzUHPhdZL3D
+k14opz8n8Y4e0ypQBaNV2cvnOVPAmJ6MVGKLJrD3fY185MaeZkJVgkfnsliNZvcH
+fC425lAcP9tDJMW/hkd5s3kc91r0E+xs+D/iWR+V7kI+ua2oMoVJl0b+SzGPWsut
+dEcf6ZG33ygEIqDUD13ieU/qbIWGvaimzuT6w+Gzrt48Ue7LE3wBf4QOXVGUnhMM
+ti6lTPk5cDZvlsouDERVxcr6XQKj39ZkjFqzAQqptQpHF//vkUAqjqFGOjGY5RH8
+zLtJVor8udBhmm9lbObDyz51Sf6Pp+KJxWfXnUYTTjF2OySznhFlhqt/7x3U+Lzn
+rFpct1pHXFXOVbQicVtbC/DP3KBhZOqp12gKY6fgDT+gr9Oq0n7vUaDmUStVkhUX
+U8u3Zg5mTPj5dUyQ5xJwx0UCAwEAAaNjMGEwHQYDVR0OBBYEFC7j27JJ0JxUeVz6
+Jyr+zE7S6E5UMA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAULuPbsknQnFR5
+XPonKv7MTtLoTlQwDgYDVR0PAQH/BAQDAgEGMA0GCSqGSIb3DQEBCwUAA4ICAQAF
+Nzr0TbdF4kV1JI+2d1LoHNgQk2Xz8lkGpD4eKexd0dCrfOAKkEh47U6YA5n+KGCR
+HTAduGN8qOY1tfrTYXbm1gdLymmasoR6d5NFFxWfJNCYExL/u6Au/U5Mh/jOXKqY
+GwXgAEZKgoClM4so3O0409/lPun++1ndYYRP0lSWE2ETPo+Aab6TR7U1Q9Jauz1c
+77NCR807VRMGsAnb/WP2OogKmW9+4c4bU2pEZiNRCHu8W1Ki/QY3OEBhj0qWuJA3
++GbHeJAAFS6LrVE1Uweoa2iu+U48BybNCAVwzDk/dr2l02cmAYamU9JgO3xDf1WK
+vJUawSg5TB9D0pH0clmKuVb8P7Sd2nCcdlqMQ1DujjByTd//SffGqWfZbawCEeI6
+FiWnWAjLb1NBnEg4R2gz0dfHj9R0IdTDBZB6/86WiLEVKV0jq9BgoRJP3vQXzTLl
+yb/IQ639Lo7xr+L0mPoSHyDYwKcMhcWQ9DstliaxLL5Mq+ux0orJ23gTDx4JnW2P
+AJ8C2sH6H3p6CcRK5ogql5+Ji/03X186zjhZhkuvcQu02PJwT58yE+Owp1fl2tpD
+y4Q08ijE6m30Ku/Ba3ba+367hTzSU8JNvnHhRdH9I2cNE3X7z2VnIp2usAnRCf8d
+NL/+I5c30jn6PQ0GC7TbO6Orb1wdtn7os4I07QZcJA==
+-----END CERTIFICATE-----
+
+# Issuer: CN=T-TeleSec GlobalRoot Class 2 O=T-Systems Enterprise Services GmbH OU=T-Systems Trust Center
+# Subject: CN=T-TeleSec GlobalRoot Class 2 O=T-Systems Enterprise Services GmbH OU=T-Systems Trust Center
+# Label: "T-TeleSec GlobalRoot Class 2"
+# Serial: 1
+# MD5 Fingerprint: 2b:9b:9e:e4:7b:6c:1f:00:72:1a:cc:c1:77:79:df:6a
+# SHA1 Fingerprint: 59:0d:2d:7d:88:4f:40:2e:61:7e:a5:62:32:17:65:cf:17:d8:94:e9
+# SHA256 Fingerprint: 91:e2:f5:78:8d:58:10:eb:a7:ba:58:73:7d:e1:54:8a:8e:ca:cd:01:45:98:bc:0b:14:3e:04:1b:17:05:25:52
+-----BEGIN CERTIFICATE-----
+MIIDwzCCAqugAwIBAgIBATANBgkqhkiG9w0BAQsFADCBgjELMAkGA1UEBhMCREUx
+KzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnByaXNlIFNlcnZpY2VzIEdtYkgxHzAd
+BgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50ZXIxJTAjBgNVBAMMHFQtVGVsZVNl
+YyBHbG9iYWxSb290IENsYXNzIDIwHhcNMDgxMDAxMTA0MDE0WhcNMzMxMDAxMjM1
+OTU5WjCBgjELMAkGA1UEBhMCREUxKzApBgNVBAoMIlQtU3lzdGVtcyBFbnRlcnBy
+aXNlIFNlcnZpY2VzIEdtYkgxHzAdBgNVBAsMFlQtU3lzdGVtcyBUcnVzdCBDZW50
+ZXIxJTAjBgNVBAMMHFQtVGVsZVNlYyBHbG9iYWxSb290IENsYXNzIDIwggEiMA0G
+CSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCqX9obX+hzkeXaXPSi5kfl82hVYAUd
+AqSzm1nzHoqvNK38DcLZSBnuaY/JIPwhqgcZ7bBcrGXHX+0CfHt8LRvWurmAwhiC
+FoT6ZrAIxlQjgeTNuUk/9k9uN0goOA/FvudocP05l03Sx5iRUKrERLMjfTlH6VJi
+1hKTXrcxlkIF+3anHqP1wvzpesVsqXFP6st4vGCvx9702cu+fjOlbpSD8DT6Iavq
+jnKgP6TeMFvvhk1qlVtDRKgQFRzlAVfFmPHmBiiRqiDFt1MmUUOyCxGVWOHAD3bZ
+wI18gfNycJ5v/hqO2V81xrJvNHy+SE/iWjnX2J14np+GPgNeGYtEotXHAgMBAAGj
+QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBS/
+WSA2AHmgoCJrjNXyYdK4LMuCSjANBgkqhkiG9w0BAQsFAAOCAQEAMQOiYQsfdOhy
+NsZt+U2e+iKo4YFWz827n+qrkRk4r6p8FU3ztqONpfSO9kSpp+ghla0+AGIWiPAC
+uvxhI+YzmzB6azZie60EI4RYZeLbK4rnJVM3YlNfvNoBYimipidx5joifsFvHZVw
+IEoHNN/q/xWA5brXethbdXwFeilHfkCoMRN3zUA7tFFHei4R40cR3p1m0IvVVGb6
+g1XqfMIpiRvpb7PO4gWEyS8+eIVibslfwXhjdFjASBgMmTnrpMwatXlajRWc2BQN
+9noHV8cigwUtPJslJj0Ys6lDfMjIq2SPDqO/nBudMNva0Bkuqjzx+zOAduTNrRlP
+BSeOE6Fuwg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Atos TrustedRoot 2011 O=Atos
+# Subject: CN=Atos TrustedRoot 2011 O=Atos
+# Label: "Atos TrustedRoot 2011"
+# Serial: 6643877497813316402
+# MD5 Fingerprint: ae:b9:c4:32:4b:ac:7f:5d:66:cc:77:94:bb:2a:77:56
+# SHA1 Fingerprint: 2b:b1:f5:3e:55:0c:1d:c5:f1:d4:e6:b7:6a:46:4b:55:06:02:ac:21
+# SHA256 Fingerprint: f3:56:be:a2:44:b7:a9:1e:b3:5d:53:ca:9a:d7:86:4a:ce:01:8e:2d:35:d5:f8:f9:6d:df:68:a6:f4:1a:a4:74
+-----BEGIN CERTIFICATE-----
+MIIDdzCCAl+gAwIBAgIIXDPLYixfszIwDQYJKoZIhvcNAQELBQAwPDEeMBwGA1UE
+AwwVQXRvcyBUcnVzdGVkUm9vdCAyMDExMQ0wCwYDVQQKDARBdG9zMQswCQYDVQQG
+EwJERTAeFw0xMTA3MDcxNDU4MzBaFw0zMDEyMzEyMzU5NTlaMDwxHjAcBgNVBAMM
+FUF0b3MgVHJ1c3RlZFJvb3QgMjAxMTENMAsGA1UECgwEQXRvczELMAkGA1UEBhMC
+REUwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQCVhTuXbyo7LjvPpvMp
+Nb7PGKw+qtn4TaA+Gke5vJrf8v7MPkfoepbCJI419KkM/IL9bcFyYie96mvr54rM
+VD6QUM+A1JX76LWC1BTFtqlVJVfbsVD2sGBkWXppzwO3bw2+yj5vdHLqqjAqc2K+
+SZFhyBH+DgMq92og3AIVDV4VavzjgsG1xZ1kCWyjWZgHJ8cblithdHFsQ/H3NYkQ
+4J7sVaE3IqKHBAUsR320HLliKWYoyrfhk/WklAOZuXCFteZI6o1Q/NnezG8HDt0L
+cp2AMBYHlT8oDv3FdU9T1nSatCQujgKRz3bFmx5VdJx4IbHwLfELn8LVlhgf8FQi
+eowHAgMBAAGjfTB7MB0GA1UdDgQWBBSnpQaxLKYJYO7Rl+lwrrw7GWzbITAPBgNV
+HRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFKelBrEspglg7tGX6XCuvDsZbNshMBgG
+A1UdIAQRMA8wDQYLKwYBBAGwLQMEAQEwDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3
+DQEBCwUAA4IBAQAmdzTblEiGKkGdLD4GkGDEjKwLVLgfuXvTBznk+j57sj1O7Z8j
+vZfza1zv7v1Apt+hk6EKhqzvINB5Ab149xnYJDE0BAGmuhWawyfc2E8PzBhj/5kP
+DpFrdRbhIfzYJsdHt6bPWHJxfrrhTZVHO8mvbaG0weyJ9rQPOLXiZNwlz6bb65pc
+maHFCN795trV1lpFDMS3wrUU77QR/w4VtfX128a961qn8FYiqTxlVMYVqL2Gns2D
+lmh6cYGJ4Qvh6hEbaAjMaZ7snkGeRDImeuKHCnE96+RapNLbxc3G3mB/ufNPRJLv
+KrcYPqcZ2Qt9sTdBQrC6YB3y/gkRsPCHe6ed
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root CA 1 G3 O=QuoVadis Limited
+# Subject: CN=QuoVadis Root CA 1 G3 O=QuoVadis Limited
+# Label: "QuoVadis Root CA 1 G3"
+# Serial: 687049649626669250736271037606554624078720034195
+# MD5 Fingerprint: a4:bc:5b:3f:fe:37:9a:fa:64:f0:e2:fa:05:3d:0b:ab
+# SHA1 Fingerprint: 1b:8e:ea:57:96:29:1a:c9:39:ea:b8:0a:81:1a:73:73:c0:93:79:67
+# SHA256 Fingerprint: 8a:86:6f:d1:b2:76:b5:7e:57:8e:92:1c:65:82:8a:2b:ed:58:e9:f2:f2:88:05:41:34:b7:f1:f4:bf:c9:cc:74
+-----BEGIN CERTIFICATE-----
+MIIFYDCCA0igAwIBAgIUeFhfLq0sGUvjNwc1NBMotZbUZZMwDQYJKoZIhvcNAQEL
+BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc
+BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMSBHMzAeFw0xMjAxMTIxNzI3NDRaFw00
+MjAxMTIxNzI3NDRaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM
+aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDEgRzMwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQCgvlAQjunybEC0BJyFuTHK3C3kEakEPBtV
+wedYMB0ktMPvhd6MLOHBPd+C5k+tR4ds7FtJwUrVu4/sh6x/gpqG7D0DmVIB0jWe
+rNrwU8lmPNSsAgHaJNM7qAJGr6Qc4/hzWHa39g6QDbXwz8z6+cZM5cOGMAqNF341
+68Xfuw6cwI2H44g4hWf6Pser4BOcBRiYz5P1sZK0/CPTz9XEJ0ngnjybCKOLXSoh
+4Pw5qlPafX7PGglTvF0FBM+hSo+LdoINofjSxxR3W5A2B4GbPgb6Ul5jxaYA/qXp
+UhtStZI5cgMJYr2wYBZupt0lwgNm3fME0UDiTouG9G/lg6AnhF4EwfWQvTA9xO+o
+abw4m6SkltFi2mnAAZauy8RRNOoMqv8hjlmPSlzkYZqn0ukqeI1RPToV7qJZjqlc
+3sX5kCLliEVx3ZGZbHqfPT2YfF72vhZooF6uCyP8Wg+qInYtyaEQHeTTRCOQiJ/G
+KubX9ZqzWB4vMIkIG1SitZgj7Ah3HJVdYdHLiZxfokqRmu8hqkkWCKi9YSgxyXSt
+hfbZxbGL0eUQMk1fiyA6PEkfM4VZDdvLCXVDaXP7a3F98N/ETH3Goy7IlXnLc6KO
+Tk0k+17kBL5yG6YnLUlamXrXXAkgt3+UuU/xDRxeiEIbEbfnkduebPRq34wGmAOt
+zCjvpUfzUwIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB
+BjAdBgNVHQ4EFgQUo5fW816iEOGrRZ88F2Q87gFwnMwwDQYJKoZIhvcNAQELBQAD
+ggIBABj6W3X8PnrHX3fHyt/PX8MSxEBd1DKquGrX1RUVRpgjpeaQWxiZTOOtQqOC
+MTaIzen7xASWSIsBx40Bz1szBpZGZnQdT+3Btrm0DWHMY37XLneMlhwqI2hrhVd2
+cDMT/uFPpiN3GPoajOi9ZcnPP/TJF9zrx7zABC4tRi9pZsMbj/7sPtPKlL92CiUN
+qXsCHKnQO18LwIE6PWThv6ctTr1NxNgpxiIY0MWscgKCP6o6ojoilzHdCGPDdRS5
+YCgtW2jgFqlmgiNR9etT2DGbe+m3nUvriBbP+V04ikkwj+3x6xn0dxoxGE1nVGwv
+b2X52z3sIexe9PSLymBlVNFxZPT5pqOBMzYzcfCkeF9OrYMh3jRJjehZrJ3ydlo2
+8hP0r+AJx2EqbPfgna67hkooby7utHnNkDPDs3b69fBsnQGQ+p6Q9pxyz0fawx/k
+NSBT8lTR32GDpgLiJTjehTItXnOQUl1CxM49S+H5GYQd1aJQzEH7QRTDvdbJWqNj
+ZgKAvQU6O0ec7AAmTPWIUb+oI38YB7AL7YsmoWTTYUrrXJ/es69nA7Mf3W1daWhp
+q1467HxpvMc7hU6eFbm0FU/DlXpY18ls6Wy58yljXrQs8C097Vpl4KlbQMJImYFt
+nh8GKjwStIsPm6Ik8KaN1nrgS7ZklmOVhMJKzRwuJIczYOXD
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root CA 2 G3 O=QuoVadis Limited
+# Subject: CN=QuoVadis Root CA 2 G3 O=QuoVadis Limited
+# Label: "QuoVadis Root CA 2 G3"
+# Serial: 390156079458959257446133169266079962026824725800
+# MD5 Fingerprint: af:0c:86:6e:bf:40:2d:7f:0b:3e:12:50:ba:12:3d:06
+# SHA1 Fingerprint: 09:3c:61:f3:8b:8b:dc:7d:55:df:75:38:02:05:00:e1:25:f5:c8:36
+# SHA256 Fingerprint: 8f:e4:fb:0a:f9:3a:4d:0d:67:db:0b:eb:b2:3e:37:c7:1b:f3:25:dc:bc:dd:24:0e:a0:4d:af:58:b4:7e:18:40
+-----BEGIN CERTIFICATE-----
+MIIFYDCCA0igAwIBAgIURFc0JFuBiZs18s64KztbpybwdSgwDQYJKoZIhvcNAQEL
+BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc
+BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMiBHMzAeFw0xMjAxMTIxODU5MzJaFw00
+MjAxMTIxODU5MzJaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM
+aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDIgRzMwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQChriWyARjcV4g/Ruv5r+LrI3HimtFhZiFf
+qq8nUeVuGxbULX1QsFN3vXg6YOJkApt8hpvWGo6t/x8Vf9WVHhLL5hSEBMHfNrMW
+n4rjyduYNM7YMxcoRvynyfDStNVNCXJJ+fKH46nafaF9a7I6JaltUkSs+L5u+9ym
+c5GQYaYDFCDy54ejiK2toIz/pgslUiXnFgHVy7g1gQyjO/Dh4fxaXc6AcW34Sas+
+O7q414AB+6XrW7PFXmAqMaCvN+ggOp+oMiwMzAkd056OXbxMmO7FGmh77FOm6RQ1
+o9/NgJ8MSPsc9PG/Srj61YxxSscfrf5BmrODXfKEVu+lV0POKa2Mq1W/xPtbAd0j
+IaFYAI7D0GoT7RPjEiuA3GfmlbLNHiJuKvhB1PLKFAeNilUSxmn1uIZoL1NesNKq
+IcGY5jDjZ1XHm26sGahVpkUG0CM62+tlXSoREfA7T8pt9DTEceT/AFr2XK4jYIVz
+8eQQsSWu1ZK7E8EM4DnatDlXtas1qnIhO4M15zHfeiFuuDIIfR0ykRVKYnLP43eh
+vNURG3YBZwjgQQvD6xVu+KQZ2aKrr+InUlYrAoosFCT5v0ICvybIxo/gbjh9Uy3l
+7ZizlWNof/k19N+IxWA1ksB8aRxhlRbQ694Lrz4EEEVlWFA4r0jyWbYW8jwNkALG
+cC4BrTwV1wIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB
+BjAdBgNVHQ4EFgQU7edvdlq/YOxJW8ald7tyFnGbxD0wDQYJKoZIhvcNAQELBQAD
+ggIBAJHfgD9DCX5xwvfrs4iP4VGyvD11+ShdyLyZm3tdquXK4Qr36LLTn91nMX66
+AarHakE7kNQIXLJgapDwyM4DYvmL7ftuKtwGTTwpD4kWilhMSA/ohGHqPHKmd+RC
+roijQ1h5fq7KpVMNqT1wvSAZYaRsOPxDMuHBR//47PERIjKWnML2W2mWeyAMQ0Ga
+W/ZZGYjeVYg3UQt4XAoeo0L9x52ID8DyeAIkVJOviYeIyUqAHerQbj5hLja7NQ4n
+lv1mNDthcnPxFlxHBlRJAHpYErAK74X9sbgzdWqTHBLmYF5vHX/JHyPLhGGfHoJE
++V+tYlUkmlKY7VHnoX6XOuYvHxHaU4AshZ6rNRDbIl9qxV6XU/IyAgkwo1jwDQHV
+csaxfGl7w/U2Rcxhbl5MlMVerugOXou/983g7aEOGzPuVBj+D77vfoRrQ+NwmNtd
+dbINWQeFFSM51vHfqSYP1kjHs6Yi9TM3WpVHn3u6GBVv/9YUZINJ0gpnIdsPNWNg
+KCLjsZWDzYWm3S8P52dSbrsvhXz1SnPnxT7AvSESBT/8twNJAlvIJebiVDj1eYeM
+HVOyToV7BjjHLPj4sHKNJeV3UvQDHEimUF+IIDBu8oJDqz2XhOdT+yHBTw8imoa4
+WSr2Rz0ZiC3oheGe7IUIarFsNMkd7EgrO3jtZsSOeWmD3n+M
+-----END CERTIFICATE-----
+
+# Issuer: CN=QuoVadis Root CA 3 G3 O=QuoVadis Limited
+# Subject: CN=QuoVadis Root CA 3 G3 O=QuoVadis Limited
+# Label: "QuoVadis Root CA 3 G3"
+# Serial: 268090761170461462463995952157327242137089239581
+# MD5 Fingerprint: df:7d:b9:ad:54:6f:68:a1:df:89:57:03:97:43:b0:d7
+# SHA1 Fingerprint: 48:12:bd:92:3c:a8:c4:39:06:e7:30:6d:27:96:e6:a4:cf:22:2e:7d
+# SHA256 Fingerprint: 88:ef:81:de:20:2e:b0:18:45:2e:43:f8:64:72:5c:ea:5f:bd:1f:c2:d9:d2:05:73:07:09:c5:d8:b8:69:0f:46
+-----BEGIN CERTIFICATE-----
+MIIFYDCCA0igAwIBAgIULvWbAiin23r/1aOp7r0DoM8Sah0wDQYJKoZIhvcNAQEL
+BQAwSDELMAkGA1UEBhMCQk0xGTAXBgNVBAoTEFF1b1ZhZGlzIExpbWl0ZWQxHjAc
+BgNVBAMTFVF1b1ZhZGlzIFJvb3QgQ0EgMyBHMzAeFw0xMjAxMTIyMDI2MzJaFw00
+MjAxMTIyMDI2MzJaMEgxCzAJBgNVBAYTAkJNMRkwFwYDVQQKExBRdW9WYWRpcyBM
+aW1pdGVkMR4wHAYDVQQDExVRdW9WYWRpcyBSb290IENBIDMgRzMwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQCzyw4QZ47qFJenMioKVjZ/aEzHs286IxSR
+/xl/pcqs7rN2nXrpixurazHb+gtTTK/FpRp5PIpM/6zfJd5O2YIyC0TeytuMrKNu
+FoM7pmRLMon7FhY4futD4tN0SsJiCnMK3UmzV9KwCoWdcTzeo8vAMvMBOSBDGzXR
+U7Ox7sWTaYI+FrUoRqHe6okJ7UO4BUaKhvVZR74bbwEhELn9qdIoyhA5CcoTNs+c
+ra1AdHkrAj80//ogaX3T7mH1urPnMNA3I4ZyYUUpSFlob3emLoG+B01vr87ERROR
+FHAGjx+f+IdpsQ7vw4kZ6+ocYfx6bIrc1gMLnia6Et3UVDmrJqMz6nWB2i3ND0/k
+A9HvFZcba5DFApCTZgIhsUfei5pKgLlVj7WiL8DWM2fafsSntARE60f75li59wzw
+eyuxwHApw0BiLTtIadwjPEjrewl5qW3aqDCYz4ByA4imW0aucnl8CAMhZa634Ryl
+sSqiMd5mBPfAdOhx3v89WcyWJhKLhZVXGqtrdQtEPREoPHtht+KPZ0/l7DxMYIBp
+VzgeAVuNVejH38DMdyM0SXV89pgR6y3e7UEuFAUCf+D+IOs15xGsIs5XPd7JMG0Q
+A4XN8f+MFrXBsj6IbGB/kE+V9/YtrQE5BwT6dYB9v0lQ7e/JxHwc64B+27bQ3RP+
+ydOc17KXqQIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB
+BjAdBgNVHQ4EFgQUxhfQvKjqAkPyGwaZXSuQILnXnOQwDQYJKoZIhvcNAQELBQAD
+ggIBADRh2Va1EodVTd2jNTFGu6QHcrxfYWLopfsLN7E8trP6KZ1/AvWkyaiTt3px
+KGmPc+FSkNrVvjrlt3ZqVoAh313m6Tqe5T72omnHKgqwGEfcIHB9UqM+WXzBusnI
+FUBhynLWcKzSt/Ac5IYp8M7vaGPQtSCKFWGafoaYtMnCdvvMujAWzKNhxnQT5Wvv
+oxXqA/4Ti2Tk08HS6IT7SdEQTXlm66r99I0xHnAUrdzeZxNMgRVhvLfZkXdxGYFg
+u/BYpbWcC/ePIlUnwEsBbTuZDdQdm2NnL9DuDcpmvJRPpq3t/O5jrFc/ZSXPsoaP
+0Aj/uHYUbt7lJ+yreLVTubY/6CD50qi+YUbKh4yE8/nxoGibIh6BJpsQBJFxwAYf
+3KDTuVan45gtf4Od34wrnDKOMpTwATwiKp9Dwi7DmDkHOHv8XgBCH/MyJnmDhPbl
+8MFREsALHgQjDFSlTC9JxUrRtm5gDWv8a4uFJGS3iQ6rJUdbPM9+Sb3H6QrG2vd+
+DhcI00iX0HGS8A85PjRqHH3Y8iKuu2n0M7SmSFXRDw4m6Oy2Cy2nhTXN/VnIn9HN
+PlopNLk9hM6xZdRZkZFWdSHBd575euFgndOtBBj0fOtek49TSiIp+EgrPk2GrFt/
+ywaZWWDYWGWVjUTR939+J399roD1B0y2PpxxVJkES/1Y+Zj0
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Assured ID Root G2 O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Assured ID Root G2 O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Assured ID Root G2"
+# Serial: 15385348160840213938643033620894905419
+# MD5 Fingerprint: 92:38:b9:f8:63:24:82:65:2c:57:33:e6:fe:81:8f:9d
+# SHA1 Fingerprint: a1:4b:48:d9:43:ee:0a:0e:40:90:4f:3c:e0:a4:c0:91:93:51:5d:3f
+# SHA256 Fingerprint: 7d:05:eb:b6:82:33:9f:8c:94:51:ee:09:4e:eb:fe:fa:79:53:a1:14:ed:b2:f4:49:49:45:2f:ab:7d:2f:c1:85
+-----BEGIN CERTIFICATE-----
+MIIDljCCAn6gAwIBAgIQC5McOtY5Z+pnI7/Dr5r0SzANBgkqhkiG9w0BAQsFADBl
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJv
+b3QgRzIwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBlMQswCQYDVQQG
+EwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNl
+cnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgRzIwggEi
+MA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDZ5ygvUj82ckmIkzTz+GoeMVSA
+n61UQbVH35ao1K+ALbkKz3X9iaV9JPrjIgwrvJUXCzO/GU1BBpAAvQxNEP4Htecc
+biJVMWWXvdMX0h5i89vqbFCMP4QMls+3ywPgym2hFEwbid3tALBSfK+RbLE4E9Hp
+EgjAALAcKxHad3A2m67OeYfcgnDmCXRwVWmvo2ifv922ebPynXApVfSr/5Vh88lA
+bx3RvpO704gqu52/clpWcTs/1PPRCv4o76Pu2ZmvA9OPYLfykqGxvYmJHzDNw6Yu
+YjOuFgJ3RFrngQo8p0Quebg/BLxcoIfhG69Rjs3sLPr4/m3wOnyqi+RnlTGNAgMB
+AAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQW
+BBTOw0q5mVXyuNtgv6l+vVa1lzan1jANBgkqhkiG9w0BAQsFAAOCAQEAyqVVjOPI
+QW5pJ6d1Ee88hjZv0p3GeDgdaZaikmkuOGybfQTUiaWxMTeKySHMq2zNixya1r9I
+0jJmwYrA8y8678Dj1JGG0VDjA9tzd29KOVPt3ibHtX2vK0LRdWLjSisCx1BL4Gni
+lmwORGYQRI+tBev4eaymG+g3NJ1TyWGqolKvSnAWhsI6yLETcDbYz+70CjTVW0z9
+B5yiutkBclzzTcHdDrEcDcRjvq30FPuJ7KJBDkzMyFdA0G4Dqs0MjomZmWzwPDCv
+ON9vvKO+KSAnq3T/EyJ43pdSVR6DtVQgA+6uwE9W3jfMw3+qBCe703e4YtsXfJwo
+IhNzbM8m9Yop5w==
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Assured ID Root G3 O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Assured ID Root G3 O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Assured ID Root G3"
+# Serial: 15459312981008553731928384953135426796
+# MD5 Fingerprint: 7c:7f:65:31:0c:81:df:8d:ba:3e:99:e2:5c:ad:6e:fb
+# SHA1 Fingerprint: f5:17:a2:4f:9a:48:c6:c9:f8:a2:00:26:9f:dc:0f:48:2c:ab:30:89
+# SHA256 Fingerprint: 7e:37:cb:8b:4c:47:09:0c:ab:36:55:1b:a6:f4:5d:b8:40:68:0f:ba:16:6a:95:2d:b1:00:71:7f:43:05:3f:c2
+-----BEGIN CERTIFICATE-----
+MIICRjCCAc2gAwIBAgIQC6Fa+h3foLVJRK/NJKBs7DAKBggqhkjOPQQDAzBlMQsw
+CQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cu
+ZGlnaWNlcnQuY29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3Qg
+RzMwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBlMQswCQYDVQQGEwJV
+UzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNlcnQu
+Y29tMSQwIgYDVQQDExtEaWdpQ2VydCBBc3N1cmVkIElEIFJvb3QgRzMwdjAQBgcq
+hkjOPQIBBgUrgQQAIgNiAAQZ57ysRGXtzbg/WPuNsVepRC0FFfLvC/8QdJ+1YlJf
+Zn4f5dwbRXkLzMZTCp2NXQLZqVneAlr2lSoOjThKiknGvMYDOAdfVdp+CW7if17Q
+RSAPWXYQ1qAk8C3eNvJsKTmjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/
+BAQDAgGGMB0GA1UdDgQWBBTL0L2p4ZgFUaFNN6KDec6NHSrkhDAKBggqhkjOPQQD
+AwNnADBkAjAlpIFFAmsSS3V0T8gj43DydXLefInwz5FyYZ5eEJJZVrmDxxDnOOlY
+JjZ91eQ0hjkCMHw2U/Aw5WJjOpnitqM7mzT6HtoQknFekROn3aRukswy1vUhZscv
+6pZjamVFkpUBtA==
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Global Root G2 O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Global Root G2 O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Global Root G2"
+# Serial: 4293743540046975378534879503202253541
+# MD5 Fingerprint: e4:a6:8a:c8:54:ac:52:42:46:0a:fd:72:48:1b:2a:44
+# SHA1 Fingerprint: df:3c:24:f9:bf:d6:66:76:1b:26:80:73:fe:06:d1:cc:8d:4f:82:a4
+# SHA256 Fingerprint: cb:3c:cb:b7:60:31:e5:e0:13:8f:8d:d3:9a:23:f9:de:47:ff:c3:5e:43:c1:14:4c:ea:27:d4:6a:5a:b1:cb:5f
+-----BEGIN CERTIFICATE-----
+MIIDjjCCAnagAwIBAgIQAzrx5qcRqaC7KGSxHQn65TANBgkqhkiG9w0BAQsFADBh
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBH
+MjAeFw0xMzA4MDExMjAwMDBaFw0zODAxMTUxMjAwMDBaMGExCzAJBgNVBAYTAlVT
+MRUwEwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5j
+b20xIDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IEcyMIIBIjANBgkqhkiG
+9w0BAQEFAAOCAQ8AMIIBCgKCAQEAuzfNNNx7a8myaJCtSnX/RrohCgiN9RlUyfuI
+2/Ou8jqJkTx65qsGGmvPrC3oXgkkRLpimn7Wo6h+4FR1IAWsULecYxpsMNzaHxmx
+1x7e/dfgy5SDN67sH0NO3Xss0r0upS/kqbitOtSZpLYl6ZtrAGCSYP9PIUkY92eQ
+q2EGnI/yuum06ZIya7XzV+hdG82MHauVBJVJ8zUtluNJbd134/tJS7SsVQepj5Wz
+tCO7TG1F8PapspUwtP1MVYwnSlcUfIKdzXOS0xZKBgyMUNGPHgm+F6HmIcr9g+UQ
+vIOlCsRnKPZzFBQ9RnbDhxSJITRNrw9FDKZJobq7nMWxM4MphQIDAQABo0IwQDAP
+BgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBhjAdBgNVHQ4EFgQUTiJUIBiV
+5uNu5g/6+rkS7QYXjzkwDQYJKoZIhvcNAQELBQADggEBAGBnKJRvDkhj6zHd6mcY
+1Yl9PMWLSn/pvtsrF9+wX3N3KjITOYFnQoQj8kVnNeyIv/iPsGEMNKSuIEyExtv4
+NeF22d+mQrvHRAiGfzZ0JFrabA0UWTW98kndth/Jsw1HKj2ZL7tcu7XUIOGZX1NG
+Fdtom/DzMNU+MeKNhJ7jitralj41E6Vf8PlwUHBHQRFXGU7Aj64GxJUTFy8bJZ91
+8rGOmaFvE7FBcf6IKshPECBV1/MUReXgRPTqh5Uykw7+U0b6LJ3/iyK5S9kJRaTe
+pLiaWN0bfVKfjllDiIGknibVb63dDcY3fe0Dkhvld1927jyNxF1WW6LZZm6zNTfl
+MrY=
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Global Root G3 O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Global Root G3 O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Global Root G3"
+# Serial: 7089244469030293291760083333884364146
+# MD5 Fingerprint: f5:5d:a4:50:a5:fb:28:7e:1e:0f:0d:cc:96:57:56:ca
+# SHA1 Fingerprint: 7e:04:de:89:6a:3e:66:6d:00:e6:87:d3:3f:fa:d9:3b:e8:3d:34:9e
+# SHA256 Fingerprint: 31:ad:66:48:f8:10:41:38:c7:38:f3:9e:a4:32:01:33:39:3e:3a:18:cc:02:29:6e:f9:7c:2a:c9:ef:67:31:d0
+-----BEGIN CERTIFICATE-----
+MIICPzCCAcWgAwIBAgIQBVVWvPJepDU1w6QP1atFcjAKBggqhkjOPQQDAzBhMQsw
+CQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cu
+ZGlnaWNlcnQuY29tMSAwHgYDVQQDExdEaWdpQ2VydCBHbG9iYWwgUm9vdCBHMzAe
+Fw0xMzA4MDExMjAwMDBaFw0zODAxMTUxMjAwMDBaMGExCzAJBgNVBAYTAlVTMRUw
+EwYDVQQKEwxEaWdpQ2VydCBJbmMxGTAXBgNVBAsTEHd3dy5kaWdpY2VydC5jb20x
+IDAeBgNVBAMTF0RpZ2lDZXJ0IEdsb2JhbCBSb290IEczMHYwEAYHKoZIzj0CAQYF
+K4EEACIDYgAE3afZu4q4C/sLfyHS8L6+c/MzXRq8NOrexpu80JX28MzQC7phW1FG
+fp4tn+6OYwwX7Adw9c+ELkCDnOg/QW07rdOkFFk2eJ0DQ+4QE2xy3q6Ip6FrtUPO
+Z9wj/wMco+I+o0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBhjAd
+BgNVHQ4EFgQUs9tIpPmhxdiuNkHMEWNpYim8S8YwCgYIKoZIzj0EAwMDaAAwZQIx
+AK288mw/EkrRLTnDCgmXc/SINoyIJ7vmiI1Qhadj+Z4y3maTD/HMsQmP3Wyr+mt/
+oAIwOWZbwmSNuJ5Q3KjVSaLtx9zRSX8XAbjIho9OjIgrqJqpisXRAL34VOKa5Vt8
+sycX
+-----END CERTIFICATE-----
+
+# Issuer: CN=DigiCert Trusted Root G4 O=DigiCert Inc OU=www.digicert.com
+# Subject: CN=DigiCert Trusted Root G4 O=DigiCert Inc OU=www.digicert.com
+# Label: "DigiCert Trusted Root G4"
+# Serial: 7451500558977370777930084869016614236
+# MD5 Fingerprint: 78:f2:fc:aa:60:1f:2f:b4:eb:c9:37:ba:53:2e:75:49
+# SHA1 Fingerprint: dd:fb:16:cd:49:31:c9:73:a2:03:7d:3f:c8:3a:4d:7d:77:5d:05:e4
+# SHA256 Fingerprint: 55:2f:7b:dc:f1:a7:af:9e:6c:e6:72:01:7f:4f:12:ab:f7:72:40:c7:8e:76:1a:c2:03:d1:d9:d2:0a:c8:99:88
+-----BEGIN CERTIFICATE-----
+MIIFkDCCA3igAwIBAgIQBZsbV56OITLiOQe9p3d1XDANBgkqhkiG9w0BAQwFADBi
+MQswCQYDVQQGEwJVUzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3
+d3cuZGlnaWNlcnQuY29tMSEwHwYDVQQDExhEaWdpQ2VydCBUcnVzdGVkIFJvb3Qg
+RzQwHhcNMTMwODAxMTIwMDAwWhcNMzgwMTE1MTIwMDAwWjBiMQswCQYDVQQGEwJV
+UzEVMBMGA1UEChMMRGlnaUNlcnQgSW5jMRkwFwYDVQQLExB3d3cuZGlnaWNlcnQu
+Y29tMSEwHwYDVQQDExhEaWdpQ2VydCBUcnVzdGVkIFJvb3QgRzQwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQC/5pBzaN675F1KPDAiMGkz7MKnJS7JIT3y
+ithZwuEppz1Yq3aaza57G4QNxDAf8xukOBbrVsaXbR2rsnnyyhHS5F/WBTxSD1If
+xp4VpX6+n6lXFllVcq9ok3DCsrp1mWpzMpTREEQQLt+C8weE5nQ7bXHiLQwb7iDV
+ySAdYyktzuxeTsiT+CFhmzTrBcZe7FsavOvJz82sNEBfsXpm7nfISKhmV1efVFiO
+DCu3T6cw2Vbuyntd463JT17lNecxy9qTXtyOj4DatpGYQJB5w3jHtrHEtWoYOAMQ
+jdjUN6QuBX2I9YI+EJFwq1WCQTLX2wRzKm6RAXwhTNS8rhsDdV14Ztk6MUSaM0C/
+CNdaSaTC5qmgZ92kJ7yhTzm1EVgX9yRcRo9k98FpiHaYdj1ZXUJ2h4mXaXpI8OCi
+EhtmmnTK3kse5w5jrubU75KSOp493ADkRSWJtppEGSt+wJS00mFt6zPZxd9LBADM
+fRyVw4/3IbKyEbe7f/LVjHAsQWCqsWMYRJUadmJ+9oCw++hkpjPRiQfhvbfmQ6QY
+uKZ3AeEPlAwhHbJUKSWJbOUOUlFHdL4mrLZBdd56rF+NP8m800ERElvlEFDrMcXK
+chYiCd98THU/Y+whX8QgUWtvsauGi0/C1kVfnSD8oR7FwI+isX4KJpn15GkvmB0t
+9dmpsh3lGwIDAQABo0IwQDAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIB
+hjAdBgNVHQ4EFgQU7NfjgtJxXWRM3y5nP+e6mK4cD08wDQYJKoZIhvcNAQEMBQAD
+ggIBALth2X2pbL4XxJEbw6GiAI3jZGgPVs93rnD5/ZpKmbnJeFwMDF/k5hQpVgs2
+SV1EY+CtnJYYZhsjDT156W1r1lT40jzBQ0CuHVD1UvyQO7uYmWlrx8GnqGikJ9yd
++SeuMIW59mdNOj6PWTkiU0TryF0Dyu1Qen1iIQqAyHNm0aAFYF/opbSnr6j3bTWc
+fFqK1qI4mfN4i/RN0iAL3gTujJtHgXINwBQy7zBZLq7gcfJW5GqXb5JQbZaNaHqa
+sjYUegbyJLkJEVDXCLG4iXqEI2FCKeWjzaIgQdfRnGTZ6iahixTXTBmyUEFxPT9N
+cCOGDErcgdLMMpSEDQgJlxxPwO5rIHQw0uA5NBCFIRUBCOhVMt5xSdkoF1BN5r5N
+0XWs0Mr7QbhDparTwwVETyw2m+L64kW4I1NsBm9nVX9GtUw/bihaeSbSpKhil9Ie
+4u1Ki7wb/UdKDd9nZn6yW0HQO+T0O/QEY+nvwlQAUaCKKsnOeMzV6ocEGLPOr0mI
+r/OSmbaz5mEP0oUA51Aa5BuVnRmhuZyxm7EAHu/QD09CbMkKvO5D+jpxpchNJqU1
+/YldvIViHTLSoCtU7ZpXwdv6EM8Zt4tKG48BtieVU+i2iW1bvGjUI+iLUaJW+fCm
+gKDWHrO8Dw9TdSmq6hN35N6MgSGtBxBHEa2HPQfRdbzP82Z+
+-----END CERTIFICATE-----
+
+# Issuer: CN=COMODO RSA Certification Authority O=COMODO CA Limited
+# Subject: CN=COMODO RSA Certification Authority O=COMODO CA Limited
+# Label: "COMODO RSA Certification Authority"
+# Serial: 101909084537582093308941363524873193117
+# MD5 Fingerprint: 1b:31:b0:71:40:36:cc:14:36:91:ad:c4:3e:fd:ec:18
+# SHA1 Fingerprint: af:e5:d2:44:a8:d1:19:42:30:ff:47:9f:e2:f8:97:bb:cd:7a:8c:b4
+# SHA256 Fingerprint: 52:f0:e1:c4:e5:8e:c6:29:29:1b:60:31:7f:07:46:71:b8:5d:7e:a8:0d:5b:07:27:34:63:53:4b:32:b4:02:34
+-----BEGIN CERTIFICATE-----
+MIIF2DCCA8CgAwIBAgIQTKr5yttjb+Af907YWwOGnTANBgkqhkiG9w0BAQwFADCB
+hTELMAkGA1UEBhMCR0IxGzAZBgNVBAgTEkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4G
+A1UEBxMHU2FsZm9yZDEaMBgGA1UEChMRQ09NT0RPIENBIExpbWl0ZWQxKzApBgNV
+BAMTIkNPTU9ETyBSU0EgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAwMTE5
+MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBhTELMAkGA1UEBhMCR0IxGzAZBgNVBAgT
+EkdyZWF0ZXIgTWFuY2hlc3RlcjEQMA4GA1UEBxMHU2FsZm9yZDEaMBgGA1UEChMR
+Q09NT0RPIENBIExpbWl0ZWQxKzApBgNVBAMTIkNPTU9ETyBSU0EgQ2VydGlmaWNh
+dGlvbiBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQCR
+6FSS0gpWsawNJN3Fz0RndJkrN6N9I3AAcbxT38T6KhKPS38QVr2fcHK3YX/JSw8X
+pz3jsARh7v8Rl8f0hj4K+j5c+ZPmNHrZFGvnnLOFoIJ6dq9xkNfs/Q36nGz637CC
+9BR++b7Epi9Pf5l/tfxnQ3K9DADWietrLNPtj5gcFKt+5eNu/Nio5JIk2kNrYrhV
+/erBvGy2i/MOjZrkm2xpmfh4SDBF1a3hDTxFYPwyllEnvGfDyi62a+pGx8cgoLEf
+Zd5ICLqkTqnyg0Y3hOvozIFIQ2dOciqbXL1MGyiKXCJ7tKuY2e7gUYPDCUZObT6Z
++pUX2nwzV0E8jVHtC7ZcryxjGt9XyD+86V3Em69FmeKjWiS0uqlWPc9vqv9JWL7w
+qP/0uK3pN/u6uPQLOvnoQ0IeidiEyxPx2bvhiWC4jChWrBQdnArncevPDt09qZah
+SL0896+1DSJMwBGB7FY79tOi4lu3sgQiUpWAk2nojkxl8ZEDLXB0AuqLZxUpaVIC
+u9ffUGpVRr+goyhhf3DQw6KqLCGqR84onAZFdr+CGCe01a60y1Dma/RMhnEw6abf
+Fobg2P9A3fvQQoh/ozM6LlweQRGBY84YcWsr7KaKtzFcOmpH4MN5WdYgGq/yapiq
+crxXStJLnbsQ/LBMQeXtHT1eKJ2czL+zUdqnR+WEUwIDAQABo0IwQDAdBgNVHQ4E
+FgQUu69+Aj36pvE8hI6t7jiY7NkyMtQwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB
+/wQFMAMBAf8wDQYJKoZIhvcNAQEMBQADggIBAArx1UaEt65Ru2yyTUEUAJNMnMvl
+wFTPoCWOAvn9sKIN9SCYPBMtrFaisNZ+EZLpLrqeLppysb0ZRGxhNaKatBYSaVqM
+4dc+pBroLwP0rmEdEBsqpIt6xf4FpuHA1sj+nq6PK7o9mfjYcwlYRm6mnPTXJ9OV
+2jeDchzTc+CiR5kDOF3VSXkAKRzH7JsgHAckaVd4sjn8OoSgtZx8jb8uk2Intzna
+FxiuvTwJaP+EmzzV1gsD41eeFPfR60/IvYcjt7ZJQ3mFXLrrkguhxuhoqEwWsRqZ
+CuhTLJK7oQkYdQxlqHvLI7cawiiFwxv/0Cti76R7CZGYZ4wUAc1oBmpjIXUDgIiK
+boHGhfKppC3n9KUkEEeDys30jXlYsQab5xoq2Z0B15R97QNKyvDb6KkBPvVWmcke
+jkk9u+UJueBPSZI9FoJAzMxZxuY67RIuaTxslbH9qh17f4a+Hg4yRvv7E491f0yL
+S0Zj/gA0QHDBw7mh3aZw4gSzQbzpgJHqZJx64SIDqZxubw5lT2yHh17zbqD5daWb
+QOhTsiedSrnAdyGN/4fy3ryM7xfft0kL0fJuMAsaDk527RH89elWsn2/x20Kk4yl
+0MC2Hb46TpSi125sC8KKfPog88Tk5c0NqMuRkrF8hey1FGlmDoLnzc7ILaZRfyHB
+NVOFBkpdn627G190
+-----END CERTIFICATE-----
+
+# Issuer: CN=USERTrust RSA Certification Authority O=The USERTRUST Network
+# Subject: CN=USERTrust RSA Certification Authority O=The USERTRUST Network
+# Label: "USERTrust RSA Certification Authority"
+# Serial: 2645093764781058787591871645665788717
+# MD5 Fingerprint: 1b:fe:69:d1:91:b7:19:33:a3:72:a8:0f:e1:55:e5:b5
+# SHA1 Fingerprint: 2b:8f:1b:57:33:0d:bb:a2:d0:7a:6c:51:f7:0e:e9:0d:da:b9:ad:8e
+# SHA256 Fingerprint: e7:93:c9:b0:2f:d8:aa:13:e2:1c:31:22:8a:cc:b0:81:19:64:3b:74:9c:89:89:64:b1:74:6d:46:c3:d4:cb:d2
+-----BEGIN CERTIFICATE-----
+MIIF3jCCA8agAwIBAgIQAf1tMPyjylGoG7xkDjUDLTANBgkqhkiG9w0BAQwFADCB
+iDELMAkGA1UEBhMCVVMxEzARBgNVBAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0pl
+cnNleSBDaXR5MR4wHAYDVQQKExVUaGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNV
+BAMTJVVTRVJUcnVzdCBSU0EgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAw
+MjAxMDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBiDELMAkGA1UEBhMCVVMxEzARBgNV
+BAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNleSBDaXR5MR4wHAYDVQQKExVU
+aGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMTJVVTRVJUcnVzdCBSU0EgQ2Vy
+dGlmaWNhdGlvbiBBdXRob3JpdHkwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK
+AoICAQCAEmUXNg7D2wiz0KxXDXbtzSfTTK1Qg2HiqiBNCS1kCdzOiZ/MPans9s/B
+3PHTsdZ7NygRK0faOca8Ohm0X6a9fZ2jY0K2dvKpOyuR+OJv0OwWIJAJPuLodMkY
+tJHUYmTbf6MG8YgYapAiPLz+E/CHFHv25B+O1ORRxhFnRghRy4YUVD+8M/5+bJz/
+Fp0YvVGONaanZshyZ9shZrHUm3gDwFA66Mzw3LyeTP6vBZY1H1dat//O+T23LLb2
+VN3I5xI6Ta5MirdcmrS3ID3KfyI0rn47aGYBROcBTkZTmzNg95S+UzeQc0PzMsNT
+79uq/nROacdrjGCT3sTHDN/hMq7MkztReJVni+49Vv4M0GkPGw/zJSZrM233bkf6
+c0Plfg6lZrEpfDKEY1WJxA3Bk1QwGROs0303p+tdOmw1XNtB1xLaqUkL39iAigmT
+Yo61Zs8liM2EuLE/pDkP2QKe6xJMlXzzawWpXhaDzLhn4ugTncxbgtNMs+1b/97l
+c6wjOy0AvzVVdAlJ2ElYGn+SNuZRkg7zJn0cTRe8yexDJtC/QV9AqURE9JnnV4ee
+UB9XVKg+/XRjL7FQZQnmWEIuQxpMtPAlR1n6BB6T1CZGSlCBst6+eLf8ZxXhyVeE
+Hg9j1uliutZfVS7qXMYoCAQlObgOK6nyTJccBz8NUvXt7y+CDwIDAQABo0IwQDAd
+BgNVHQ4EFgQUU3m/WqorSs9UgOHYm8Cd8rIDZsswDgYDVR0PAQH/BAQDAgEGMA8G
+A1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEMBQADggIBAFzUfA3P9wF9QZllDHPF
+Up/L+M+ZBn8b2kMVn54CVVeWFPFSPCeHlCjtHzoBN6J2/FNQwISbxmtOuowhT6KO
+VWKR82kV2LyI48SqC/3vqOlLVSoGIG1VeCkZ7l8wXEskEVX/JJpuXior7gtNn3/3
+ATiUFJVDBwn7YKnuHKsSjKCaXqeYalltiz8I+8jRRa8YFWSQEg9zKC7F4iRO/Fjs
+8PRF/iKz6y+O0tlFYQXBl2+odnKPi4w2r78NBc5xjeambx9spnFixdjQg3IM8WcR
+iQycE0xyNN+81XHfqnHd4blsjDwSXWXavVcStkNr/+XeTWYRUc+ZruwXtuhxkYze
+Sf7dNXGiFSeUHM9h4ya7b6NnJSFd5t0dCy5oGzuCr+yDZ4XUmFF0sbmZgIn/f3gZ
+XHlKYC6SQK5MNyosycdiyA5d9zZbyuAlJQG03RoHnHcAP9Dc1ew91Pq7P8yF1m9/
+qS3fuQL39ZeatTXaw2ewh0qpKJ4jjv9cJ2vhsE/zB+4ALtRZh8tSQZXq9EfX7mRB
+VXyNWQKV3WKdwrnuWih0hKWbt5DHDAff9Yk2dDLWKMGwsAvgnEzDHNb842m1R0aB
+L6KCq9NjRHDEjf8tM7qtj3u1cIiuPhnPQCjY/MiQu12ZIvVS5ljFH4gxQ+6IHdfG
+jjxDah2nGN59PRbxYvnKkKj9
+-----END CERTIFICATE-----
+
+# Issuer: CN=USERTrust ECC Certification Authority O=The USERTRUST Network
+# Subject: CN=USERTrust ECC Certification Authority O=The USERTRUST Network
+# Label: "USERTrust ECC Certification Authority"
+# Serial: 123013823720199481456569720443997572134
+# MD5 Fingerprint: fa:68:bc:d9:b5:7f:ad:fd:c9:1d:06:83:28:cc:24:c1
+# SHA1 Fingerprint: d1:cb:ca:5d:b2:d5:2a:7f:69:3b:67:4d:e5:f0:5a:1d:0c:95:7d:f0
+# SHA256 Fingerprint: 4f:f4:60:d5:4b:9c:86:da:bf:bc:fc:57:12:e0:40:0d:2b:ed:3f:bc:4d:4f:bd:aa:86:e0:6a:dc:d2:a9:ad:7a
+-----BEGIN CERTIFICATE-----
+MIICjzCCAhWgAwIBAgIQXIuZxVqUxdJxVt7NiYDMJjAKBggqhkjOPQQDAzCBiDEL
+MAkGA1UEBhMCVVMxEzARBgNVBAgTCk5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNl
+eSBDaXR5MR4wHAYDVQQKExVUaGUgVVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMT
+JVVTRVJUcnVzdCBFQ0MgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkwHhcNMTAwMjAx
+MDAwMDAwWhcNMzgwMTE4MjM1OTU5WjCBiDELMAkGA1UEBhMCVVMxEzARBgNVBAgT
+Ck5ldyBKZXJzZXkxFDASBgNVBAcTC0plcnNleSBDaXR5MR4wHAYDVQQKExVUaGUg
+VVNFUlRSVVNUIE5ldHdvcmsxLjAsBgNVBAMTJVVTRVJUcnVzdCBFQ0MgQ2VydGlm
+aWNhdGlvbiBBdXRob3JpdHkwdjAQBgcqhkjOPQIBBgUrgQQAIgNiAAQarFRaqflo
+I+d61SRvU8Za2EurxtW20eZzca7dnNYMYf3boIkDuAUU7FfO7l0/4iGzzvfUinng
+o4N+LZfQYcTxmdwlkWOrfzCjtHDix6EznPO/LlxTsV+zfTJ/ijTjeXmjQjBAMB0G
+A1UdDgQWBBQ64QmG1M8ZwpZ2dEl23OA1xmNjmjAOBgNVHQ8BAf8EBAMCAQYwDwYD
+VR0TAQH/BAUwAwEB/zAKBggqhkjOPQQDAwNoADBlAjA2Z6EWCNzklwBBHU6+4WMB
+zzuqQhFkoJ2UOQIReVx7Hfpkue4WQrO/isIJxOzksU0CMQDpKmFHjFJKS04YcPbW
+RNZu9YO6bVi9JNlWSOrvxKJGgYhqOkbRqZtNyWHa0V1Xahg=
+-----END CERTIFICATE-----
+
+# Issuer: CN=GlobalSign O=GlobalSign OU=GlobalSign ECC Root CA - R4
+# Subject: CN=GlobalSign O=GlobalSign OU=GlobalSign ECC Root CA - R4
+# Label: "GlobalSign ECC Root CA - R4"
+# Serial: 14367148294922964480859022125800977897474
+# MD5 Fingerprint: 20:f0:27:68:d1:7e:a0:9d:0e:e6:2a:ca:df:5c:89:8e
+# SHA1 Fingerprint: 69:69:56:2e:40:80:f4:24:a1:e7:19:9f:14:ba:f3:ee:58:ab:6a:bb
+# SHA256 Fingerprint: be:c9:49:11:c2:95:56:76:db:6c:0a:55:09:86:d7:6e:3b:a0:05:66:7c:44:2c:97:62:b4:fb:b7:73:de:22:8c
+-----BEGIN CERTIFICATE-----
+MIIB4TCCAYegAwIBAgIRKjikHJYKBN5CsiilC+g0mAIwCgYIKoZIzj0EAwIwUDEk
+MCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBDQSAtIFI0MRMwEQYDVQQKEwpH
+bG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWduMB4XDTEyMTExMzAwMDAwMFoX
+DTM4MDExOTAzMTQwN1owUDEkMCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBD
+QSAtIFI0MRMwEQYDVQQKEwpHbG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWdu
+MFkwEwYHKoZIzj0CAQYIKoZIzj0DAQcDQgAEuMZ5049sJQ6fLjkZHAOkrprlOQcJ
+FspjsbmG+IpXwVfOQvpzofdlQv8ewQCybnMO/8ch5RikqtlxP6jUuc6MHaNCMEAw
+DgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFFSwe61F
+uOJAf/sKbvu+M8k8o4TVMAoGCCqGSM49BAMCA0gAMEUCIQDckqGgE6bPA7DmxCGX
+kPoUVy0D7O48027KqGx2vKLeuwIgJ6iFJzWbVsaj8kfSt24bAgAXqmemFZHe+pTs
+ewv4n4Q=
+-----END CERTIFICATE-----
+
+# Issuer: CN=GlobalSign O=GlobalSign OU=GlobalSign ECC Root CA - R5
+# Subject: CN=GlobalSign O=GlobalSign OU=GlobalSign ECC Root CA - R5
+# Label: "GlobalSign ECC Root CA - R5"
+# Serial: 32785792099990507226680698011560947931244
+# MD5 Fingerprint: 9f:ad:3b:1c:02:1e:8a:ba:17:74:38:81:0c:a2:bc:08
+# SHA1 Fingerprint: 1f:24:c6:30:cd:a4:18:ef:20:69:ff:ad:4f:dd:5f:46:3a:1b:69:aa
+# SHA256 Fingerprint: 17:9f:bc:14:8a:3d:d0:0f:d2:4e:a1:34:58:cc:43:bf:a7:f5:9c:81:82:d7:83:a5:13:f6:eb:ec:10:0c:89:24
+-----BEGIN CERTIFICATE-----
+MIICHjCCAaSgAwIBAgIRYFlJ4CYuu1X5CneKcflK2GwwCgYIKoZIzj0EAwMwUDEk
+MCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBDQSAtIFI1MRMwEQYDVQQKEwpH
+bG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWduMB4XDTEyMTExMzAwMDAwMFoX
+DTM4MDExOTAzMTQwN1owUDEkMCIGA1UECxMbR2xvYmFsU2lnbiBFQ0MgUm9vdCBD
+QSAtIFI1MRMwEQYDVQQKEwpHbG9iYWxTaWduMRMwEQYDVQQDEwpHbG9iYWxTaWdu
+MHYwEAYHKoZIzj0CAQYFK4EEACIDYgAER0UOlvt9Xb/pOdEh+J8LttV7HpI6SFkc
+8GIxLcB6KP4ap1yztsyX50XUWPrRd21DosCHZTQKH3rd6zwzocWdTaRvQZU4f8ke
+hOvRnkmSh5SHDDqFSmafnVmTTZdhBoZKo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYD
+VR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUPeYpSJvqB8ohREom3m7e0oPQn1kwCgYI
+KoZIzj0EAwMDaAAwZQIxAOVpEslu28YxuglB4Zf4+/2a4n0Sye18ZNPLBSWLVtmg
+515dTguDnFt2KaAJJiFqYgIwcdK1j1zqO+F4CYWodZI7yFz9SO8NdCKoCOJuxUnO
+xwy8p2Fp8fc74SrL+SvzZpA3
+-----END CERTIFICATE-----
+
+# Issuer: CN=Staat der Nederlanden Root CA - G3 O=Staat der Nederlanden
+# Subject: CN=Staat der Nederlanden Root CA - G3 O=Staat der Nederlanden
+# Label: "Staat der Nederlanden Root CA - G3"
+# Serial: 10003001
+# MD5 Fingerprint: 0b:46:67:07:db:10:2f:19:8c:35:50:60:d1:0b:f4:37
+# SHA1 Fingerprint: d8:eb:6b:41:51:92:59:e0:f3:e7:85:00:c0:3d:b6:88:97:c9:ee:fc
+# SHA256 Fingerprint: 3c:4f:b0:b9:5a:b8:b3:00:32:f4:32:b8:6f:53:5f:e1:72:c1:85:d0:fd:39:86:58:37:cf:36:18:7f:a6:f4:28
+-----BEGIN CERTIFICATE-----
+MIIFdDCCA1ygAwIBAgIEAJiiOTANBgkqhkiG9w0BAQsFADBaMQswCQYDVQQGEwJO
+TDEeMBwGA1UECgwVU3RhYXQgZGVyIE5lZGVybGFuZGVuMSswKQYDVQQDDCJTdGFh
+dCBkZXIgTmVkZXJsYW5kZW4gUm9vdCBDQSAtIEczMB4XDTEzMTExNDExMjg0MloX
+DTI4MTExMzIzMDAwMFowWjELMAkGA1UEBhMCTkwxHjAcBgNVBAoMFVN0YWF0IGRl
+ciBOZWRlcmxhbmRlbjErMCkGA1UEAwwiU3RhYXQgZGVyIE5lZGVybGFuZGVuIFJv
+b3QgQ0EgLSBHMzCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAL4yolQP
+cPssXFnrbMSkUeiFKrPMSjTysF/zDsccPVMeiAho2G89rcKezIJnByeHaHE6n3WW
+IkYFsO2tx1ueKt6c/DrGlaf1F2cY5y9JCAxcz+bMNO14+1Cx3Gsy8KL+tjzk7FqX
+xz8ecAgwoNzFs21v0IJyEavSgWhZghe3eJJg+szeP4TrjTgzkApyI/o1zCZxMdFy
+KJLZWyNtZrVtB0LrpjPOktvA9mxjeM3KTj215VKb8b475lRgsGYeCasH/lSJEULR
+9yS6YHgamPfJEf0WwTUaVHXvQ9Plrk7O53vDxk5hUUurmkVLoR9BvUhTFXFkC4az
+5S6+zqQbwSmEorXLCCN2QyIkHxcE1G6cxvx/K2Ya7Irl1s9N9WMJtxU51nus6+N8
+6U78dULI7ViVDAZCopz35HCz33JvWjdAidiFpNfxC95DGdRKWCyMijmev4SH8RY7
+Ngzp07TKbBlBUgmhHbBqv4LvcFEhMtwFdozL92TkA1CvjJFnq8Xy7ljY3r735zHP
+bMk7ccHViLVlvMDoFxcHErVc0qsgk7TmgoNwNsXNo42ti+yjwUOH5kPiNL6VizXt
+BznaqB16nzaeErAMZRKQFWDZJkBE41ZgpRDUajz9QdwOWke275dhdU/Z/seyHdTt
+XUmzqWrLZoQT1Vyg3N9udwbRcXXIV2+vD3dbAgMBAAGjQjBAMA8GA1UdEwEB/wQF
+MAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBRUrfrHkleuyjWcLhL75Lpd
+INyUVzANBgkqhkiG9w0BAQsFAAOCAgEAMJmdBTLIXg47mAE6iqTnB/d6+Oea31BD
+U5cqPco8R5gu4RV78ZLzYdqQJRZlwJ9UXQ4DO1t3ApyEtg2YXzTdO2PCwyiBwpwp
+LiniyMMB8jPqKqrMCQj3ZWfGzd/TtiunvczRDnBfuCPRy5FOCvTIeuXZYzbB1N/8
+Ipf3YF3qKS9Ysr1YvY2WTxB1v0h7PVGHoTx0IsL8B3+A3MSs/mrBcDCw6Y5p4ixp
+gZQJut3+TcCDjJRYwEYgr5wfAvg1VUkvRtTA8KCWAg8zxXHzniN9lLf9OtMJgwYh
+/WA9rjLA0u6NpvDntIJ8CsxwyXmA+P5M9zWEGYox+wrZ13+b8KKaa8MFSu1BYBQw
+0aoRQm7TIwIEC8Zl3d1Sd9qBa7Ko+gE4uZbqKmxnl4mUnrzhVNXkanjvSr0rmj1A
+fsbAddJu+2gw7OyLnflJNZoaLNmzlTnVHpL3prllL+U9bTpITAjc5CgSKL59NVzq
+4BZ+Extq1z7XnvwtdbLBFNUjA9tbbws+eC8N3jONFrdI54OagQ97wUNNVQQXOEpR
+1VmiiXTTn74eS9fGbbeIJG9gkaSChVtWQbzQRKtqE77RLFi3EjNYsjdj3BP1lB0/
+QFH1T/U67cjF68IeHRaVesd+QnGTbksVtzDfqu1XhUisHWrdOWnk4Xl4vs4Fv6EM
+94B7IWcnMFk=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Staat der Nederlanden EV Root CA O=Staat der Nederlanden
+# Subject: CN=Staat der Nederlanden EV Root CA O=Staat der Nederlanden
+# Label: "Staat der Nederlanden EV Root CA"
+# Serial: 10000013
+# MD5 Fingerprint: fc:06:af:7b:e8:1a:f1:9a:b4:e8:d2:70:1f:c0:f5:ba
+# SHA1 Fingerprint: 76:e2:7e:c1:4f:db:82:c1:c0:a6:75:b5:05:be:3d:29:b4:ed:db:bb
+# SHA256 Fingerprint: 4d:24:91:41:4c:fe:95:67:46:ec:4c:ef:a6:cf:6f:72:e2:8a:13:29:43:2f:9d:8a:90:7a:c4:cb:5d:ad:c1:5a
+-----BEGIN CERTIFICATE-----
+MIIFcDCCA1igAwIBAgIEAJiWjTANBgkqhkiG9w0BAQsFADBYMQswCQYDVQQGEwJO
+TDEeMBwGA1UECgwVU3RhYXQgZGVyIE5lZGVybGFuZGVuMSkwJwYDVQQDDCBTdGFh
+dCBkZXIgTmVkZXJsYW5kZW4gRVYgUm9vdCBDQTAeFw0xMDEyMDgxMTE5MjlaFw0y
+MjEyMDgxMTEwMjhaMFgxCzAJBgNVBAYTAk5MMR4wHAYDVQQKDBVTdGFhdCBkZXIg
+TmVkZXJsYW5kZW4xKTAnBgNVBAMMIFN0YWF0IGRlciBOZWRlcmxhbmRlbiBFViBS
+b290IENBMIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEA48d+ifkkSzrS
+M4M1LGns3Amk41GoJSt5uAg94JG6hIXGhaTK5skuU6TJJB79VWZxXSzFYGgEt9nC
+UiY4iKTWO0Cmws0/zZiTs1QUWJZV1VD+hq2kY39ch/aO5ieSZxeSAgMs3NZmdO3d
+Z//BYY1jTw+bbRcwJu+r0h8QoPnFfxZpgQNH7R5ojXKhTbImxrpsX23Wr9GxE46p
+rfNeaXUmGD5BKyF/7otdBwadQ8QpCiv8Kj6GyzyDOvnJDdrFmeK8eEEzduG/L13l
+pJhQDBXd4Pqcfzho0LKmeqfRMb1+ilgnQ7O6M5HTp5gVXJrm0w912fxBmJc+qiXb
+j5IusHsMX/FjqTf5m3VpTCgmJdrV8hJwRVXj33NeN/UhbJCONVrJ0yPr08C+eKxC
+KFhmpUZtcALXEPlLVPxdhkqHz3/KRawRWrUgUY0viEeXOcDPusBCAUCZSCELa6fS
+/ZbV0b5GnUngC6agIk440ME8MLxwjyx1zNDFjFE7PZQIZCZhfbnDZY8UnCHQqv0X
+cgOPvZuM5l5Tnrmd74K74bzickFbIZTTRTeU0d8JOV3nI6qaHcptqAqGhYqCvkIH
+1vI4gnPah1vlPNOePqc7nvQDs/nxfRN0Av+7oeX6AHkcpmZBiFxgV6YuCcS6/ZrP
+px9Aw7vMWgpVSzs4dlG4Y4uElBbmVvMCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB
+/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFP6rAJCYniT8qcwaivsnuL8wbqg7
+MA0GCSqGSIb3DQEBCwUAA4ICAQDPdyxuVr5Os7aEAJSrR8kN0nbHhp8dB9O2tLsI
+eK9p0gtJ3jPFrK3CiAJ9Brc1AsFgyb/E6JTe1NOpEyVa/m6irn0F3H3zbPB+po3u
+2dfOWBfoqSmuc0iH55vKbimhZF8ZE/euBhD/UcabTVUlT5OZEAFTdfETzsemQUHS
+v4ilf0X8rLiltTMMgsT7B/Zq5SWEXwbKwYY5EdtYzXc7LMJMD16a4/CrPmEbUCTC
+wPTxGfARKbalGAKb12NMcIxHowNDXLldRqANb/9Zjr7dn3LDWyvfjFvO5QxGbJKy
+CqNMVEIYFRIYvdr8unRu/8G2oGTYqV9Vrp9canaW2HNnh/tNf1zuacpzEPuKqf2e
+vTY4SUmH9A4U8OmHuD+nT3pajnnUk+S7aFKErGzp85hwVXIy+TSrK0m1zSBi5Dp6
+Z2Orltxtrpfs/J92VoguZs9btsmksNcFuuEnL5O7Jiqik7Ab846+HUCjuTaPPoIa
+Gl6I6lD4WeKDRikL40Rc4ZW2aZCaFG+XroHPaO+Zmr615+F/+PoTRxZMzG0IQOeL
+eG9QgkRQP2YGiqtDhFZKDyAthg710tvSeopLzaXoTvFeJiUBWSOgftL2fiFX1ye8
+FVdMpEbB4IMeDExNH08GGeL5qPQ6gqGyeUN51q1veieQA6TqJIc/2b3Z6fJfUEkc
+7uzXLg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=IdenTrust Commercial Root CA 1 O=IdenTrust
+# Subject: CN=IdenTrust Commercial Root CA 1 O=IdenTrust
+# Label: "IdenTrust Commercial Root CA 1"
+# Serial: 13298821034946342390520003877796839426
+# MD5 Fingerprint: b3:3e:77:73:75:ee:a0:d3:e3:7e:49:63:49:59:bb:c7
+# SHA1 Fingerprint: df:71:7e:aa:4a:d9:4e:c9:55:84:99:60:2d:48:de:5f:bc:f0:3a:25
+# SHA256 Fingerprint: 5d:56:49:9b:e4:d2:e0:8b:cf:ca:d0:8a:3e:38:72:3d:50:50:3b:de:70:69:48:e4:2f:55:60:30:19:e5:28:ae
+-----BEGIN CERTIFICATE-----
+MIIFYDCCA0igAwIBAgIQCgFCgAAAAUUjyES1AAAAAjANBgkqhkiG9w0BAQsFADBK
+MQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MScwJQYDVQQDEx5JZGVu
+VHJ1c3QgQ29tbWVyY2lhbCBSb290IENBIDEwHhcNMTQwMTE2MTgxMjIzWhcNMzQw
+MTE2MTgxMjIzWjBKMQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MScw
+JQYDVQQDEx5JZGVuVHJ1c3QgQ29tbWVyY2lhbCBSb290IENBIDEwggIiMA0GCSqG
+SIb3DQEBAQUAA4ICDwAwggIKAoICAQCnUBneP5k91DNG8W9RYYKyqU+PZ4ldhNlT
+3Qwo2dfw/66VQ3KZ+bVdfIrBQuExUHTRgQ18zZshq0PirK1ehm7zCYofWjK9ouuU
++ehcCuz/mNKvcbO0U59Oh++SvL3sTzIwiEsXXlfEU8L2ApeN2WIrvyQfYo3fw7gp
+S0l4PJNgiCL8mdo2yMKi1CxUAGc1bnO/AljwpN3lsKImesrgNqUZFvX9t++uP0D1
+bVoE/c40yiTcdCMbXTMTEl3EASX2MN0CXZ/g1Ue9tOsbobtJSdifWwLziuQkkORi
+T0/Br4sOdBeo0XKIanoBScy0RnnGF7HamB4HWfp1IYVl3ZBWzvurpWCdxJ35UrCL
+vYf5jysjCiN2O/cz4ckA82n5S6LgTrx+kzmEB/dEcH7+B1rlsazRGMzyNeVJSQjK
+Vsk9+w8YfYs7wRPCTY/JTw436R+hDmrfYi7LNQZReSzIJTj0+kuniVyc0uMNOYZK
+dHzVWYfCP04MXFL0PfdSgvHqo6z9STQaKPNBiDoT7uje/5kdX7rL6B7yuVBgwDHT
+c+XvvqDtMwt0viAgxGds8AgDelWAf0ZOlqf0Hj7h9tgJ4TNkK2PXMl6f+cB7D3hv
+l7yTmvmcEpB4eoCHFddydJxVdHixuuFucAS6T6C6aMN7/zHwcz09lCqxC0EOoP5N
+iGVreTO01wIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB
+/zAdBgNVHQ4EFgQU7UQZwNPwBovupHu+QucmVMiONnYwDQYJKoZIhvcNAQELBQAD
+ggIBAA2ukDL2pkt8RHYZYR4nKM1eVO8lvOMIkPkp165oCOGUAFjvLi5+U1KMtlwH
+6oi6mYtQlNeCgN9hCQCTrQ0U5s7B8jeUeLBfnLOic7iPBZM4zY0+sLj7wM+x8uwt
+LRvM7Kqas6pgghstO8OEPVeKlh6cdbjTMM1gCIOQ045U8U1mwF10A0Cj7oV+wh93
+nAbowacYXVKV7cndJZ5t+qntozo00Fl72u1Q8zW/7esUTTHHYPTa8Yec4kjixsU3
++wYQ+nVZZjFHKdp2mhzpgq7vmrlR94gjmmmVYjzlVYA211QC//G5Xc7UI2/YRYRK
+W2XviQzdFKcgyxilJbQN+QHwotL0AMh0jqEqSI5l2xPE4iUXfeu+h1sXIFRRk0pT
+AwvsXcoz7WL9RccvW9xYoIA55vrX/hMUpu09lEpCdNTDd1lzzY9GvlU47/rokTLq
+l1gEIt44w8y8bckzOmoKaT+gyOpyj4xjhiO9bTyWnpXgSUyqorkqG5w2gXjtw+hG
+4iZZRHUe2XWJUc0QhJ1hYMtd+ZciTY6Y5uN/9lu7rs3KSoFrXgvzUeF0K+l+J6fZ
+mUlO+KWA2yUPHGNiiskzZ2s8EIPGrd6ozRaOjfAHN3Gf8qv8QfXBi+wAN10J5U6A
+7/qxXDgGpRtK4dw4LTzcqx+QGtVKnO7RcGzM7vRX+Bi6hG6H
+-----END CERTIFICATE-----
+
+# Issuer: CN=IdenTrust Public Sector Root CA 1 O=IdenTrust
+# Subject: CN=IdenTrust Public Sector Root CA 1 O=IdenTrust
+# Label: "IdenTrust Public Sector Root CA 1"
+# Serial: 13298821034946342390521976156843933698
+# MD5 Fingerprint: 37:06:a5:b0:fc:89:9d:ba:f4:6b:8c:1a:64:cd:d5:ba
+# SHA1 Fingerprint: ba:29:41:60:77:98:3f:f4:f3:ef:f2:31:05:3b:2e:ea:6d:4d:45:fd
+# SHA256 Fingerprint: 30:d0:89:5a:9a:44:8a:26:20:91:63:55:22:d1:f5:20:10:b5:86:7a:ca:e1:2c:78:ef:95:8f:d4:f4:38:9f:2f
+-----BEGIN CERTIFICATE-----
+MIIFZjCCA06gAwIBAgIQCgFCgAAAAUUjz0Z8AAAAAjANBgkqhkiG9w0BAQsFADBN
+MQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0MSowKAYDVQQDEyFJZGVu
+VHJ1c3QgUHVibGljIFNlY3RvciBSb290IENBIDEwHhcNMTQwMTE2MTc1MzMyWhcN
+MzQwMTE2MTc1MzMyWjBNMQswCQYDVQQGEwJVUzESMBAGA1UEChMJSWRlblRydXN0
+MSowKAYDVQQDEyFJZGVuVHJ1c3QgUHVibGljIFNlY3RvciBSb290IENBIDEwggIi
+MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQC2IpT8pEiv6EdrCvsnduTyP4o7
+ekosMSqMjbCpwzFrqHd2hCa2rIFCDQjrVVi7evi8ZX3yoG2LqEfpYnYeEe4IFNGy
+RBb06tD6Hi9e28tzQa68ALBKK0CyrOE7S8ItneShm+waOh7wCLPQ5CQ1B5+ctMlS
+bdsHyo+1W/CD80/HLaXIrcuVIKQxKFdYWuSNG5qrng0M8gozOSI5Cpcu81N3uURF
+/YTLNiCBWS2ab21ISGHKTN9T0a9SvESfqy9rg3LvdYDaBjMbXcjaY8ZNzaxmMc3R
+3j6HEDbhuaR672BQssvKplbgN6+rNBM5Jeg5ZuSYeqoSmJxZZoY+rfGwyj4GD3vw
+EUs3oERte8uojHH01bWRNszwFcYr3lEXsZdMUD2xlVl8BX0tIdUAvwFnol57plzy
+9yLxkA2T26pEUWbMfXYD62qoKjgZl3YNa4ph+bz27nb9cCvdKTz4Ch5bQhyLVi9V
+GxyhLrXHFub4qjySjmm2AcG1hp2JDws4lFTo6tyePSW8Uybt1as5qsVATFSrsrTZ
+2fjXctscvG29ZV/viDUqZi/u9rNl8DONfJhBaUYPQxxp+pu10GFqzcpL2UyQRqsV
+WaFHVCkugyhfHMKiq3IXAAaOReyL4jM9f9oZRORicsPfIsbyVtTdX5Vy7W1f90gD
+W/3FKqD2cyOEEBsB5wIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/
+BAUwAwEB/zAdBgNVHQ4EFgQU43HgntinQtnbcZFrlJPrw6PRFKMwDQYJKoZIhvcN
+AQELBQADggIBAEf63QqwEZE4rU1d9+UOl1QZgkiHVIyqZJnYWv6IAcVYpZmxI1Qj
+t2odIFflAWJBF9MJ23XLblSQdf4an4EKwt3X9wnQW3IV5B4Jaj0z8yGa5hV+rVHV
+DRDtfULAj+7AmgjVQdZcDiFpboBhDhXAuM/FSRJSzL46zNQuOAXeNf0fb7iAaJg9
+TaDKQGXSc3z1i9kKlT/YPyNtGtEqJBnZhbMX73huqVjRI9PHE+1yJX9dsXNw0H8G
+lwmEKYBhHfpe/3OsoOOJuBxxFcbeMX8S3OFtm6/n6J91eEyrRjuazr8FGF1NFTwW
+mhlQBJqymm9li1JfPFgEKCXAZmExfrngdbkaqIHWchezxQMxNRF4eKLg6TCMf4Df
+WN88uieW4oA0beOY02QnrEh+KHdcxiVhJfiFDGX6xDIvpZgF5PgLZxYWxoK4Mhn5
++bl53B/N66+rDt0b20XkeucC4pVd/GnwU2lhlXV5C15V5jgclKlZM57IcXR5f1GJ
+tshquDDIajjDbp7hNxbqBWJMWxJH7ae0s1hWx0nzfxJoCTFx8G34Tkf71oXuxVhA
+GaQdp/lLQzfcaFpPz+vCZHTetBXZ9FRUGi8c15dxVJCO2SCdUyt/q4/i6jC8UDfv
+8Ue1fXwsBOxonbRJRBD0ckscZOf85muQ3Wl9af0AVqW3rLatt8o+Ae+c
+-----END CERTIFICATE-----
+
+# Issuer: CN=Entrust Root Certification Authority - G2 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2009 Entrust, Inc. - for authorized use only
+# Subject: CN=Entrust Root Certification Authority - G2 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2009 Entrust, Inc. - for authorized use only
+# Label: "Entrust Root Certification Authority - G2"
+# Serial: 1246989352
+# MD5 Fingerprint: 4b:e2:c9:91:96:65:0c:f4:0e:5a:93:92:a0:0a:fe:b2
+# SHA1 Fingerprint: 8c:f4:27:fd:79:0c:3a:d1:66:06:8d:e8:1e:57:ef:bb:93:22:72:d4
+# SHA256 Fingerprint: 43:df:57:74:b0:3e:7f:ef:5f:e4:0d:93:1a:7b:ed:f1:bb:2e:6b:42:73:8c:4e:6d:38:41:10:3d:3a:a7:f3:39
+-----BEGIN CERTIFICATE-----
+MIIEPjCCAyagAwIBAgIESlOMKDANBgkqhkiG9w0BAQsFADCBvjELMAkGA1UEBhMC
+VVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3d3cuZW50
+cnVzdC5uZXQvbGVnYWwtdGVybXMxOTA3BgNVBAsTMChjKSAyMDA5IEVudHJ1c3Qs
+IEluYy4gLSBmb3IgYXV0aG9yaXplZCB1c2Ugb25seTEyMDAGA1UEAxMpRW50cnVz
+dCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IC0gRzIwHhcNMDkwNzA3MTcy
+NTU0WhcNMzAxMjA3MTc1NTU0WjCBvjELMAkGA1UEBhMCVVMxFjAUBgNVBAoTDUVu
+dHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3d3cuZW50cnVzdC5uZXQvbGVnYWwt
+dGVybXMxOTA3BgNVBAsTMChjKSAyMDA5IEVudHJ1c3QsIEluYy4gLSBmb3IgYXV0
+aG9yaXplZCB1c2Ugb25seTEyMDAGA1UEAxMpRW50cnVzdCBSb290IENlcnRpZmlj
+YXRpb24gQXV0aG9yaXR5IC0gRzIwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEK
+AoIBAQC6hLZy254Ma+KZ6TABp3bqMriVQRrJ2mFOWHLP/vaCeb9zYQYKpSfYs1/T
+RU4cctZOMvJyig/3gxnQaoCAAEUesMfnmr8SVycco2gvCoe9amsOXmXzHHfV1IWN
+cCG0szLni6LVhjkCsbjSR87kyUnEO6fe+1R9V77w6G7CebI6C1XiUJgWMhNcL3hW
+wcKUs/Ja5CeanyTXxuzQmyWC48zCxEXFjJd6BmsqEZ+pCm5IO2/b1BEZQvePB7/1
+U1+cPvQXLOZprE4yTGJ36rfo5bs0vBmLrpxR57d+tVOxMyLlbc9wPBr64ptntoP0
+jaWvYkxN4FisZDQSA/i2jZRjJKRxAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAP
+BgNVHRMBAf8EBTADAQH/MB0GA1UdDgQWBBRqciZ60B7vfec7aVHUbI2fkBJmqzAN
+BgkqhkiG9w0BAQsFAAOCAQEAeZ8dlsa2eT8ijYfThwMEYGprmi5ZiXMRrEPR9RP/
+jTkrwPK9T3CMqS/qF8QLVJ7UG5aYMzyorWKiAHarWWluBh1+xLlEjZivEtRh2woZ
+Rkfz6/djwUAFQKXSt/S1mja/qYh2iARVBCuch38aNzx+LaUa2NSJXsq9rD1s2G2v
+1fN2D807iDginWyTmsQ9v4IbZT+mD12q/OWyFcq1rca8PdCE6OoGcrBNOTJ4vz4R
+nAuknZoh8/CbCzB428Hch0P+vGOaysXCHMnHjf87ElgI5rY97HosTvuDls4MPGmH
+VHOkc8KT/1EQrBVUAdj8BbGJoX90g5pJ19xOe4pIb4tF9g==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Entrust Root Certification Authority - EC1 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2012 Entrust, Inc. - for authorized use only
+# Subject: CN=Entrust Root Certification Authority - EC1 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2012 Entrust, Inc. - for authorized use only
+# Label: "Entrust Root Certification Authority - EC1"
+# Serial: 51543124481930649114116133369
+# MD5 Fingerprint: b6:7e:1d:f0:58:c5:49:6c:24:3b:3d:ed:98:18:ed:bc
+# SHA1 Fingerprint: 20:d8:06:40:df:9b:25:f5:12:25:3a:11:ea:f7:59:8a:eb:14:b5:47
+# SHA256 Fingerprint: 02:ed:0e:b2:8c:14:da:45:16:5c:56:67:91:70:0d:64:51:d7:fb:56:f0:b2:ab:1d:3b:8e:b0:70:e5:6e:df:f5
+-----BEGIN CERTIFICATE-----
+MIIC+TCCAoCgAwIBAgINAKaLeSkAAAAAUNCR+TAKBggqhkjOPQQDAzCBvzELMAkG
+A1UEBhMCVVMxFjAUBgNVBAoTDUVudHJ1c3QsIEluYy4xKDAmBgNVBAsTH1NlZSB3
+d3cuZW50cnVzdC5uZXQvbGVnYWwtdGVybXMxOTA3BgNVBAsTMChjKSAyMDEyIEVu
+dHJ1c3QsIEluYy4gLSBmb3IgYXV0aG9yaXplZCB1c2Ugb25seTEzMDEGA1UEAxMq
+RW50cnVzdCBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IC0gRUMxMB4XDTEy
+MTIxODE1MjUzNloXDTM3MTIxODE1NTUzNlowgb8xCzAJBgNVBAYTAlVTMRYwFAYD
+VQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQLEx9TZWUgd3d3LmVudHJ1c3QubmV0
+L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykgMjAxMiBFbnRydXN0LCBJbmMuIC0g
+Zm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMzAxBgNVBAMTKkVudHJ1c3QgUm9vdCBD
+ZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEVDMTB2MBAGByqGSM49AgEGBSuBBAAi
+A2IABIQTydC6bUF74mzQ61VfZgIaJPRbiWlH47jCffHyAsWfoPZb1YsGGYZPUxBt
+ByQnoaD41UcZYUx9ypMn6nQM72+WCf5j7HBdNq1nd67JnXxVRDqiY1Ef9eNi1KlH
+Bz7MIKNCMEAwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0O
+BBYEFLdj5xrdjekIplWDpOBqUEFlEUJJMAoGCCqGSM49BAMDA2cAMGQCMGF52OVC
+R98crlOZF7ZvHH3hvxGU0QOIdeSNiaSKd0bebWHvAvX7td/M/k7//qnmpwIwW5nX
+hTcGtXsI/esni0qU+eH6p44mCOh8kmhtc9hvJqwhAriZtyZBWyVgrtBIGu4G
+-----END CERTIFICATE-----
+
+# Issuer: CN=CFCA EV ROOT O=China Financial Certification Authority
+# Subject: CN=CFCA EV ROOT O=China Financial Certification Authority
+# Label: "CFCA EV ROOT"
+# Serial: 407555286
+# MD5 Fingerprint: 74:e1:b6:ed:26:7a:7a:44:30:33:94:ab:7b:27:81:30
+# SHA1 Fingerprint: e2:b8:29:4b:55:84:ab:6b:58:c2:90:46:6c:ac:3f:b8:39:8f:84:83
+# SHA256 Fingerprint: 5c:c3:d7:8e:4e:1d:5e:45:54:7a:04:e6:87:3e:64:f9:0c:f9:53:6d:1c:cc:2e:f8:00:f3:55:c4:c5:fd:70:fd
+-----BEGIN CERTIFICATE-----
+MIIFjTCCA3WgAwIBAgIEGErM1jANBgkqhkiG9w0BAQsFADBWMQswCQYDVQQGEwJD
+TjEwMC4GA1UECgwnQ2hpbmEgRmluYW5jaWFsIENlcnRpZmljYXRpb24gQXV0aG9y
+aXR5MRUwEwYDVQQDDAxDRkNBIEVWIFJPT1QwHhcNMTIwODA4MDMwNzAxWhcNMjkx
+MjMxMDMwNzAxWjBWMQswCQYDVQQGEwJDTjEwMC4GA1UECgwnQ2hpbmEgRmluYW5j
+aWFsIENlcnRpZmljYXRpb24gQXV0aG9yaXR5MRUwEwYDVQQDDAxDRkNBIEVWIFJP
+T1QwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDXXWvNED8fBVnVBU03
+sQ7smCuOFR36k0sXgiFxEFLXUWRwFsJVaU2OFW2fvwwbwuCjZ9YMrM8irq93VCpL
+TIpTUnrD7i7es3ElweldPe6hL6P3KjzJIx1qqx2hp/Hz7KDVRM8Vz3IvHWOX6Jn5
+/ZOkVIBMUtRSqy5J35DNuF++P96hyk0g1CXohClTt7GIH//62pCfCqktQT+x8Rgp
+7hZZLDRJGqgG16iI0gNyejLi6mhNbiyWZXvKWfry4t3uMCz7zEasxGPrb382KzRz
+EpR/38wmnvFyXVBlWY9ps4deMm/DGIq1lY+wejfeWkU7xzbh72fROdOXW3NiGUgt
+hxwG+3SYIElz8AXSG7Ggo7cbcNOIabla1jj0Ytwli3i/+Oh+uFzJlU9fpy25IGvP
+a931DfSCt/SyZi4QKPaXWnuWFo8BGS1sbn85WAZkgwGDg8NNkt0yxoekN+kWzqot
+aK8KgWU6cMGbrU1tVMoqLUuFG7OA5nBFDWteNfB/O7ic5ARwiRIlk9oKmSJgamNg
+TnYGmE69g60dWIolhdLHZR4tjsbftsbhf4oEIRUpdPA+nJCdDC7xij5aqgwJHsfV
+PKPtl8MeNPo4+QgO48BdK4PRVmrJtqhUUy54Mmc9gn900PvhtgVguXDbjgv5E1hv
+cWAQUhC5wUEJ73IfZzF4/5YFjQIDAQABo2MwYTAfBgNVHSMEGDAWgBTj/i39KNAL
+tbq2osS/BqoFjJP7LzAPBgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAd
+BgNVHQ4EFgQU4/4t/SjQC7W6tqLEvwaqBYyT+y8wDQYJKoZIhvcNAQELBQADggIB
+ACXGumvrh8vegjmWPfBEp2uEcwPenStPuiB/vHiyz5ewG5zz13ku9Ui20vsXiObT
+ej/tUxPQ4i9qecsAIyjmHjdXNYmEwnZPNDatZ8POQQaIxffu2Bq41gt/UP+TqhdL
+jOztUmCypAbqTuv0axn96/Ua4CUqmtzHQTb3yHQFhDmVOdYLO6Qn+gjYXB74BGBS
+ESgoA//vU2YApUo0FmZ8/Qmkrp5nGm9BC2sGE5uPhnEFtC+NiWYzKXZUmhH4J/qy
+P5Hgzg0b8zAarb8iXRvTvyUFTeGSGn+ZnzxEk8rUQElsgIfXBDrDMlI1Dlb4pd19
+xIsNER9Tyx6yF7Zod1rg1MvIB671Oi6ON7fQAUtDKXeMOZePglr4UeWJoBjnaH9d
+Ci77o0cOPaYjesYBx4/IXr9tgFa+iiS6M+qf4TIRnvHST4D2G0CvOJ4RUHlzEhLN
+5mydLIhyPDCBBpEi6lmt2hkuIsKNuYyH4Ga8cyNfIWRjgEj1oDwYPZTISEEdQLpe
+/v5WOaHIz16eGWRGENoXkbcFgKyLmZJ956LYBws2J+dIeWCKw9cTXPhyQN9Ky8+Z
+AAoACxGV2lZFA4gKn2fQ1XmxqI1AbQ3CekD6819kR5LLU7m7Wc5P/dAVUwHY3+vZ
+5nbv0CO7O6l5s9UCKc2Jo5YPSjXnTkLAdc0Hz+Ys63su
+-----END CERTIFICATE-----
+
+# Issuer: CN=OISTE WISeKey Global Root GB CA O=WISeKey OU=OISTE Foundation Endorsed
+# Subject: CN=OISTE WISeKey Global Root GB CA O=WISeKey OU=OISTE Foundation Endorsed
+# Label: "OISTE WISeKey Global Root GB CA"
+# Serial: 157768595616588414422159278966750757568
+# MD5 Fingerprint: a4:eb:b9:61:28:2e:b7:2f:98:b0:35:26:90:99:51:1d
+# SHA1 Fingerprint: 0f:f9:40:76:18:d3:d7:6a:4b:98:f0:a8:35:9e:0c:fd:27:ac:cc:ed
+# SHA256 Fingerprint: 6b:9c:08:e8:6e:b0:f7:67:cf:ad:65:cd:98:b6:21:49:e5:49:4a:67:f5:84:5e:7b:d1:ed:01:9f:27:b8:6b:d6
+-----BEGIN CERTIFICATE-----
+MIIDtTCCAp2gAwIBAgIQdrEgUnTwhYdGs/gjGvbCwDANBgkqhkiG9w0BAQsFADBt
+MQswCQYDVQQGEwJDSDEQMA4GA1UEChMHV0lTZUtleTEiMCAGA1UECxMZT0lTVEUg
+Rm91bmRhdGlvbiBFbmRvcnNlZDEoMCYGA1UEAxMfT0lTVEUgV0lTZUtleSBHbG9i
+YWwgUm9vdCBHQiBDQTAeFw0xNDEyMDExNTAwMzJaFw0zOTEyMDExNTEwMzFaMG0x
+CzAJBgNVBAYTAkNIMRAwDgYDVQQKEwdXSVNlS2V5MSIwIAYDVQQLExlPSVNURSBG
+b3VuZGF0aW9uIEVuZG9yc2VkMSgwJgYDVQQDEx9PSVNURSBXSVNlS2V5IEdsb2Jh
+bCBSb290IEdCIENBMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEA2Be3
+HEokKtaXscriHvt9OO+Y9bI5mE4nuBFde9IllIiCFSZqGzG7qFshISvYD06fWvGx
+WuR51jIjK+FTzJlFXHtPrby/h0oLS5daqPZI7H17Dc0hBt+eFf1Biki3IPShehtX
+1F1Q/7pn2COZH8g/497/b1t3sWtuuMlk9+HKQUYOKXHQuSP8yYFfTvdv37+ErXNk
+u7dCjmn21HYdfp2nuFeKUWdy19SouJVUQHMD9ur06/4oQnc/nSMbsrY9gBQHTC5P
+99UKFg29ZkM3fiNDecNAhvVMKdqOmq0NpQSHiB6F4+lT1ZvIiwNjeOvgGUpuuy9r
+M2RYk61pv48b74JIxwIDAQABo1EwTzALBgNVHQ8EBAMCAYYwDwYDVR0TAQH/BAUw
+AwEB/zAdBgNVHQ4EFgQUNQ/INmNe4qPs+TtmFc5RUuORmj0wEAYJKwYBBAGCNxUB
+BAMCAQAwDQYJKoZIhvcNAQELBQADggEBAEBM+4eymYGQfp3FsLAmzYh7KzKNbrgh
+cViXfa43FK8+5/ea4n32cZiZBKpDdHij40lhPnOMTZTg+XHEthYOU3gf1qKHLwI5
+gSk8rxWYITD+KJAAjNHhy/peyP34EEY7onhCkRd0VQreUGdNZtGn//3ZwLWoo4rO
+ZvUPQ82nK1d7Y0Zqqi5S2PTt4W2tKZB4SLrhI6qjiey1q5bAtEuiHZeeevJuQHHf
+aPFlTc58Bd9TZaml8LGXBHAVRgOY1NK/VLSgWH1Sb9pWJmLU2NuJMW8c8CLC02Ic
+Nc1MaRVUGpCY3useX8p3x8uOPUNpnJpY0CQ73xtAln41rYHHTnG6iBM=
+-----END CERTIFICATE-----
+
+# Issuer: CN=SZAFIR ROOT CA2 O=Krajowa Izba Rozliczeniowa S.A.
+# Subject: CN=SZAFIR ROOT CA2 O=Krajowa Izba Rozliczeniowa S.A.
+# Label: "SZAFIR ROOT CA2"
+# Serial: 357043034767186914217277344587386743377558296292
+# MD5 Fingerprint: 11:64:c1:89:b0:24:b1:8c:b1:07:7e:89:9e:51:9e:99
+# SHA1 Fingerprint: e2:52:fa:95:3f:ed:db:24:60:bd:6e:28:f3:9c:cc:cf:5e:b3:3f:de
+# SHA256 Fingerprint: a1:33:9d:33:28:1a:0b:56:e5:57:d3:d3:2b:1c:e7:f9:36:7e:b0:94:bd:5f:a7:2a:7e:50:04:c8:de:d7:ca:fe
+-----BEGIN CERTIFICATE-----
+MIIDcjCCAlqgAwIBAgIUPopdB+xV0jLVt+O2XwHrLdzk1uQwDQYJKoZIhvcNAQEL
+BQAwUTELMAkGA1UEBhMCUEwxKDAmBgNVBAoMH0tyYWpvd2EgSXpiYSBSb3psaWN6
+ZW5pb3dhIFMuQS4xGDAWBgNVBAMMD1NaQUZJUiBST09UIENBMjAeFw0xNTEwMTkw
+NzQzMzBaFw0zNTEwMTkwNzQzMzBaMFExCzAJBgNVBAYTAlBMMSgwJgYDVQQKDB9L
+cmFqb3dhIEl6YmEgUm96bGljemVuaW93YSBTLkEuMRgwFgYDVQQDDA9TWkFGSVIg
+Uk9PVCBDQTIwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQC3vD5QqEvN
+QLXOYeeWyrSh2gwisPq1e3YAd4wLz32ohswmUeQgPYUM1ljj5/QqGJ3a0a4m7utT
+3PSQ1hNKDJA8w/Ta0o4NkjrcsbH/ON7Dui1fgLkCvUqdGw+0w8LBZwPd3BucPbOw
+3gAeqDRHu5rr/gsUvTaE2g0gv/pby6kWIK05YO4vdbbnl5z5Pv1+TW9NL++IDWr6
+3fE9biCloBK0TXC5ztdyO4mTp4CEHCdJckm1/zuVnsHMyAHs6A6KCpbns6aH5db5
+BSsNl0BwPLqsdVqc1U2dAgrSS5tmS0YHF2Wtn2yIANwiieDhZNRnvDF5YTy7ykHN
+XGoAyDw4jlivAgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQD
+AgEGMB0GA1UdDgQWBBQuFqlKGLXLzPVvUPMjX/hd56zwyDANBgkqhkiG9w0BAQsF
+AAOCAQEAtXP4A9xZWx126aMqe5Aosk3AM0+qmrHUuOQn/6mWmc5G4G18TKI4pAZw
+8PRBEew/R40/cof5O/2kbytTAOD/OblqBw7rHRz2onKQy4I9EYKL0rufKq8h5mOG
+nXkZ7/e7DDWQw4rtTw/1zBLZpD67oPwglV9PJi8RI4NOdQcPv5vRtB3pEAT+ymCP
+oky4rc/hkA/NrgrHXXu3UNLUYfrVFdvXn4dRVOul4+vJhaAlIDf7js4MNIThPIGy
+d05DpYhfhmehPea0XGG2Ptv+tyjFogeutcrKjSoS75ftwjCkySp6+/NNIxuZMzSg
+LvWpCz/UXeHPhJ/iGcJfitYgHuNztw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Certum Trusted Network CA 2 O=Unizeto Technologies S.A. OU=Certum Certification Authority
+# Subject: CN=Certum Trusted Network CA 2 O=Unizeto Technologies S.A. OU=Certum Certification Authority
+# Label: "Certum Trusted Network CA 2"
+# Serial: 44979900017204383099463764357512596969
+# MD5 Fingerprint: 6d:46:9e:d9:25:6d:08:23:5b:5e:74:7d:1e:27:db:f2
+# SHA1 Fingerprint: d3:dd:48:3e:2b:bf:4c:05:e8:af:10:f5:fa:76:26:cf:d3:dc:30:92
+# SHA256 Fingerprint: b6:76:f2:ed:da:e8:77:5c:d3:6c:b0:f6:3c:d1:d4:60:39:61:f4:9e:62:65:ba:01:3a:2f:03:07:b6:d0:b8:04
+-----BEGIN CERTIFICATE-----
+MIIF0jCCA7qgAwIBAgIQIdbQSk8lD8kyN/yqXhKN6TANBgkqhkiG9w0BAQ0FADCB
+gDELMAkGA1UEBhMCUEwxIjAgBgNVBAoTGVVuaXpldG8gVGVjaG5vbG9naWVzIFMu
+QS4xJzAlBgNVBAsTHkNlcnR1bSBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eTEkMCIG
+A1UEAxMbQ2VydHVtIFRydXN0ZWQgTmV0d29yayBDQSAyMCIYDzIwMTExMDA2MDgz
+OTU2WhgPMjA0NjEwMDYwODM5NTZaMIGAMQswCQYDVQQGEwJQTDEiMCAGA1UEChMZ
+VW5pemV0byBUZWNobm9sb2dpZXMgUy5BLjEnMCUGA1UECxMeQ2VydHVtIENlcnRp
+ZmljYXRpb24gQXV0aG9yaXR5MSQwIgYDVQQDExtDZXJ0dW0gVHJ1c3RlZCBOZXR3
+b3JrIENBIDIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQC9+Xj45tWA
+DGSdhhuWZGc/IjoedQF97/tcZ4zJzFxrqZHmuULlIEub2pt7uZld2ZuAS9eEQCsn
+0+i6MLs+CRqnSZXvK0AkwpfHp+6bJe+oCgCXhVqqndwpyeI1B+twTUrWwbNWuKFB
+OJvR+zF/j+Bf4bE/D44WSWDXBo0Y+aomEKsq09DRZ40bRr5HMNUuctHFY9rnY3lE
+fktjJImGLjQ/KUxSiyqnwOKRKIm5wFv5HdnnJ63/mgKXwcZQkpsCLL2puTRZCr+E
+Sv/f/rOf69me4Jgj7KZrdxYq28ytOxykh9xGc14ZYmhFV+SQgkK7QtbwYeDBoz1m
+o130GO6IyY0XRSmZMnUCMe4pJshrAua1YkV/NxVaI2iJ1D7eTiew8EAMvE0Xy02i
+sx7QBlrd9pPPV3WZ9fqGGmd4s7+W/jTcvedSVuWz5XV710GRBdxdaeOVDUO5/IOW
+OZV7bIBaTxNyxtd9KXpEulKkKtVBRgkg/iKgtlswjbyJDNXXcPiHUv3a76xRLgez
+Tv7QCdpw75j6VuZt27VXS9zlLCUVyJ4ueE742pyehizKV/Ma5ciSixqClnrDvFAS
+adgOWkaLOusm+iPJtrCBvkIApPjW/jAux9JG9uWOdf3yzLnQh1vMBhBgu4M1t15n
+3kfsmUjxpKEV/q2MYo45VU85FrmxY53/twIDAQABo0IwQDAPBgNVHRMBAf8EBTAD
+AQH/MB0GA1UdDgQWBBS2oVQ5AsOgP46KvPrU+Bym0ToO/TAOBgNVHQ8BAf8EBAMC
+AQYwDQYJKoZIhvcNAQENBQADggIBAHGlDs7k6b8/ONWJWsQCYftMxRQXLYtPU2sQ
+F/xlhMcQSZDe28cmk4gmb3DWAl45oPePq5a1pRNcgRRtDoGCERuKTsZPpd1iHkTf
+CVn0W3cLN+mLIMb4Ck4uWBzrM9DPhmDJ2vuAL55MYIR4PSFk1vtBHxgP58l1cb29
+XN40hz5BsA72udY/CROWFC/emh1auVbONTqwX3BNXuMp8SMoclm2q8KMZiYcdywm
+djWLKKdpoPk79SPdhRB0yZADVpHnr7pH1BKXESLjokmUbOe3lEu6LaTaM4tMpkT/
+WjzGHWTYtTHkpjx6qFcL2+1hGsvxznN3Y6SHb0xRONbkX8eftoEq5IVIeVheO/jb
+AoJnwTnbw3RLPTYe+SmTiGhbqEQZIfCn6IENLOiTNrQ3ssqwGyZ6miUfmpqAnksq
+P/ujmv5zMnHCnsZy4YpoJ/HkD7TETKVhk/iXEAcqMCWpuchxuO9ozC1+9eB+D4Ko
+b7a6bINDd82Kkhehnlt4Fj1F4jNy3eFmypnTycUm/Q1oBEauttmbjL4ZvrHG8hnj
+XALKLNhvSgfZyTXaQHXyxKcZb55CEJh15pWLYLztxRLXis7VmFxWlgPF7ncGNf/P
+5O4/E2Hu29othfDNrp2yGAlFw5Khchf8R7agCyzxxN5DaAhqXzvwdmP7zAYspsbi
+DrW5viSP
+-----END CERTIFICATE-----
+
+# Issuer: CN=Hellenic Academic and Research Institutions RootCA 2015 O=Hellenic Academic and Research Institutions Cert. Authority
+# Subject: CN=Hellenic Academic and Research Institutions RootCA 2015 O=Hellenic Academic and Research Institutions Cert. Authority
+# Label: "Hellenic Academic and Research Institutions RootCA 2015"
+# Serial: 0
+# MD5 Fingerprint: ca:ff:e2:db:03:d9:cb:4b:e9:0f:ad:84:fd:7b:18:ce
+# SHA1 Fingerprint: 01:0c:06:95:a6:98:19:14:ff:bf:5f:c6:b0:b6:95:ea:29:e9:12:a6
+# SHA256 Fingerprint: a0:40:92:9a:02:ce:53:b4:ac:f4:f2:ff:c6:98:1c:e4:49:6f:75:5e:6d:45:fe:0b:2a:69:2b:cd:52:52:3f:36
+-----BEGIN CERTIFICATE-----
+MIIGCzCCA/OgAwIBAgIBADANBgkqhkiG9w0BAQsFADCBpjELMAkGA1UEBhMCR1Ix
+DzANBgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNhZGVtaWMgYW5k
+IFJlc2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkxQDA+BgNVBAMT
+N0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgUm9v
+dENBIDIwMTUwHhcNMTUwNzA3MTAxMTIxWhcNNDAwNjMwMTAxMTIxWjCBpjELMAkG
+A1UEBhMCR1IxDzANBgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNh
+ZGVtaWMgYW5kIFJlc2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkx
+QDA+BgNVBAMTN0hlbGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1
+dGlvbnMgUm9vdENBIDIwMTUwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoIC
+AQDC+Kk/G4n8PDwEXT2QNrCROnk8ZlrvbTkBSRq0t89/TSNTt5AA4xMqKKYx8ZEA
+4yjsriFBzh/a/X0SWwGDD7mwX5nh8hKDgE0GPt+sr+ehiGsxr/CL0BgzuNtFajT0
+AoAkKAoCFZVedioNmToUW/bLy1O8E00BiDeUJRtCvCLYjqOWXjrZMts+6PAQZe10
+4S+nfK8nNLspfZu2zwnI5dMK/IhlZXQK3HMcXM1AsRzUtoSMTFDPaI6oWa7CJ06C
+ojXdFPQf/7J31Ycvqm59JCfnxssm5uX+Zwdj2EUN3TpZZTlYepKZcj2chF6IIbjV
+9Cz82XBST3i4vTwri5WY9bPRaM8gFH5MXF/ni+X1NYEZN9cRCLdmvtNKzoNXADrD
+gfgXy5I2XdGj2HUb4Ysn6npIQf1FGQatJ5lOwXBH3bWfgVMS5bGMSF0xQxfjjMZ6
+Y5ZLKTBOhE5iGV48zpeQpX8B653g+IuJ3SWYPZK2fu/Z8VFRfS0myGlZYeCsargq
+NhEEelC9MoS+L9xy1dcdFkfkR2YgP/SWxa+OAXqlD3pk9Q0Yh9muiNX6hME6wGko
+LfINaFGq46V3xqSQDqE3izEjR8EJCOtu93ib14L8hCCZSRm2Ekax+0VVFqmjZayc
+Bw/qa9wfLgZy7IaIEuQt218FL+TwA9MmM+eAws1CoRc0CwIDAQABo0IwQDAPBgNV
+HRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAdBgNVHQ4EFgQUcRVnyMjJvXVd
+ctA4GGqd83EkVAswDQYJKoZIhvcNAQELBQADggIBAHW7bVRLqhBYRjTyYtcWNl0I
+XtVsyIe9tC5G8jH4fOpCtZMWVdyhDBKg2mF+D1hYc2Ryx+hFjtyp8iY/xnmMsVMI
+M4GwVhO+5lFc2JsKT0ucVlMC6U/2DWDqTUJV6HwbISHTGzrMd/K4kPFox/la/vot
+9L/J9UUbzjgQKjeKeaO04wlshYaT/4mWJ3iBj2fjRnRUjtkNaeJK9E10A/+yd+2V
+Z5fkscWrv2oj6NSU4kQoYsRL4vDY4ilrGnB+JGGTe08DMiUNRSQrlrRGar9KC/ea
+j8GsGsVn82800vpzY4zvFrCopEYq+OsS7HK07/grfoxSwIuEVPkvPuNVqNxmsdnh
+X9izjFk0WaSrT2y7HxjbdavYy5LNlDhhDgcGH0tGEPEVvo2FXDtKK4F5D7Rpn0lQ
+l033DlZdwJVqwjbDG2jJ9SrcR5q+ss7FJej6A7na+RZukYT1HCjI/CbM1xyQVqdf
+bzoEvM14iQuODy+jqk+iGxI9FghAD/FGTNeqewjBCvVtJ94Cj8rDtSvK6evIIVM4
+pcw72Hc3MKJP2W/R8kCtQXoXxdZKNYm3QdV8hn9VTYNKpXMgwDqvkPGaJI7ZjnHK
+e7iG2rKPmT4dEw0SEe7Uq/DpFXYC5ODfqiAeW2GFZECpkJcNrVPSWh2HagCXZWK0
+vm9qp/UsQu0yrbYhnr68
+-----END CERTIFICATE-----
+
+# Issuer: CN=Hellenic Academic and Research Institutions ECC RootCA 2015 O=Hellenic Academic and Research Institutions Cert. Authority
+# Subject: CN=Hellenic Academic and Research Institutions ECC RootCA 2015 O=Hellenic Academic and Research Institutions Cert. Authority
+# Label: "Hellenic Academic and Research Institutions ECC RootCA 2015"
+# Serial: 0
+# MD5 Fingerprint: 81:e5:b4:17:eb:c2:f5:e1:4b:0d:41:7b:49:92:fe:ef
+# SHA1 Fingerprint: 9f:f1:71:8d:92:d5:9a:f3:7d:74:97:b4:bc:6f:84:68:0b:ba:b6:66
+# SHA256 Fingerprint: 44:b5:45:aa:8a:25:e6:5a:73:ca:15:dc:27:fc:36:d2:4c:1c:b9:95:3a:06:65:39:b1:15:82:dc:48:7b:48:33
+-----BEGIN CERTIFICATE-----
+MIICwzCCAkqgAwIBAgIBADAKBggqhkjOPQQDAjCBqjELMAkGA1UEBhMCR1IxDzAN
+BgNVBAcTBkF0aGVuczFEMEIGA1UEChM7SGVsbGVuaWMgQWNhZGVtaWMgYW5kIFJl
+c2VhcmNoIEluc3RpdHV0aW9ucyBDZXJ0LiBBdXRob3JpdHkxRDBCBgNVBAMTO0hl
+bGxlbmljIEFjYWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgRUNDIFJv
+b3RDQSAyMDE1MB4XDTE1MDcwNzEwMzcxMloXDTQwMDYzMDEwMzcxMlowgaoxCzAJ
+BgNVBAYTAkdSMQ8wDQYDVQQHEwZBdGhlbnMxRDBCBgNVBAoTO0hlbGxlbmljIEFj
+YWRlbWljIGFuZCBSZXNlYXJjaCBJbnN0aXR1dGlvbnMgQ2VydC4gQXV0aG9yaXR5
+MUQwQgYDVQQDEztIZWxsZW5pYyBBY2FkZW1pYyBhbmQgUmVzZWFyY2ggSW5zdGl0
+dXRpb25zIEVDQyBSb290Q0EgMjAxNTB2MBAGByqGSM49AgEGBSuBBAAiA2IABJKg
+QehLgoRc4vgxEZmGZE4JJS+dQS8KrjVPdJWyUWRrjWvmP3CV8AVER6ZyOFB2lQJa
+jq4onvktTpnvLEhvTCUp6NFxW98dwXU3tNf6e3pCnGoKVlp8aQuqgAkkbH7BRqNC
+MEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFLQi
+C4KZJAEOnLvkDv2/+5cgk5kqMAoGCCqGSM49BAMCA2cAMGQCMGfOFmI4oqxiRaep
+lSTAGiecMjvAwNW6qef4BENThe5SId6d9SWDPp5YSy/XZxMOIQIwBeF1Ad5o7Sof
+TUwJCA3sS61kFyjndc5FZXIhF8siQQ6ME5g4mlRtm8rifOoCWCKR
+-----END CERTIFICATE-----
+
+# Issuer: CN=ISRG Root X1 O=Internet Security Research Group
+# Subject: CN=ISRG Root X1 O=Internet Security Research Group
+# Label: "ISRG Root X1"
+# Serial: 172886928669790476064670243504169061120
+# MD5 Fingerprint: 0c:d2:f9:e0:da:17:73:e9:ed:86:4d:a5:e3:70:e7:4e
+# SHA1 Fingerprint: ca:bd:2a:79:a1:07:6a:31:f2:1d:25:36:35:cb:03:9d:43:29:a5:e8
+# SHA256 Fingerprint: 96:bc:ec:06:26:49:76:f3:74:60:77:9a:cf:28:c5:a7:cf:e8:a3:c0:aa:e1:1a:8f:fc:ee:05:c0:bd:df:08:c6
+-----BEGIN CERTIFICATE-----
+MIIFazCCA1OgAwIBAgIRAIIQz7DSQONZRGPgu2OCiwAwDQYJKoZIhvcNAQELBQAw
+TzELMAkGA1UEBhMCVVMxKTAnBgNVBAoTIEludGVybmV0IFNlY3VyaXR5IFJlc2Vh
+cmNoIEdyb3VwMRUwEwYDVQQDEwxJU1JHIFJvb3QgWDEwHhcNMTUwNjA0MTEwNDM4
+WhcNMzUwNjA0MTEwNDM4WjBPMQswCQYDVQQGEwJVUzEpMCcGA1UEChMgSW50ZXJu
+ZXQgU2VjdXJpdHkgUmVzZWFyY2ggR3JvdXAxFTATBgNVBAMTDElTUkcgUm9vdCBY
+MTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAK3oJHP0FDfzm54rVygc
+h77ct984kIxuPOZXoHj3dcKi/vVqbvYATyjb3miGbESTtrFj/RQSa78f0uoxmyF+
+0TM8ukj13Xnfs7j/EvEhmkvBioZxaUpmZmyPfjxwv60pIgbz5MDmgK7iS4+3mX6U
+A5/TR5d8mUgjU+g4rk8Kb4Mu0UlXjIB0ttov0DiNewNwIRt18jA8+o+u3dpjq+sW
+T8KOEUt+zwvo/7V3LvSye0rgTBIlDHCNAymg4VMk7BPZ7hm/ELNKjD+Jo2FR3qyH
+B5T0Y3HsLuJvW5iB4YlcNHlsdu87kGJ55tukmi8mxdAQ4Q7e2RCOFvu396j3x+UC
+B5iPNgiV5+I3lg02dZ77DnKxHZu8A/lJBdiB3QW0KtZB6awBdpUKD9jf1b0SHzUv
+KBds0pjBqAlkd25HN7rOrFleaJ1/ctaJxQZBKT5ZPt0m9STJEadao0xAH0ahmbWn
+OlFuhjuefXKnEgV4We0+UXgVCwOPjdAvBbI+e0ocS3MFEvzG6uBQE3xDk3SzynTn
+jh8BCNAw1FtxNrQHusEwMFxIt4I7mKZ9YIqioymCzLq9gwQbooMDQaHWBfEbwrbw
+qHyGO0aoSCqI3Haadr8faqU9GY/rOPNk3sgrDQoo//fb4hVC1CLQJ13hef4Y53CI
+rU7m2Ys6xt0nUW7/vGT1M0NPAgMBAAGjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNV
+HRMBAf8EBTADAQH/MB0GA1UdDgQWBBR5tFnme7bl5AFzgAiIyBpY9umbbjANBgkq
+hkiG9w0BAQsFAAOCAgEAVR9YqbyyqFDQDLHYGmkgJykIrGF1XIpu+ILlaS/V9lZL
+ubhzEFnTIZd+50xx+7LSYK05qAvqFyFWhfFQDlnrzuBZ6brJFe+GnY+EgPbk6ZGQ
+3BebYhtF8GaV0nxvwuo77x/Py9auJ/GpsMiu/X1+mvoiBOv/2X/qkSsisRcOj/KK
+NFtY2PwByVS5uCbMiogziUwthDyC3+6WVwW6LLv3xLfHTjuCvjHIInNzktHCgKQ5
+ORAzI4JMPJ+GslWYHb4phowim57iaztXOoJwTdwJx4nLCgdNbOhdjsnvzqvHu7Ur
+TkXWStAmzOVyyghqpZXjFaH3pO3JLF+l+/+sKAIuvtd7u+Nxe5AW0wdeRlN8NwdC
+jNPElpzVmbUq4JUagEiuTDkHzsxHpFKVK7q4+63SM1N95R1NbdWhscdCb+ZAJzVc
+oyi3B43njTOQ5yOf+1CceWxG1bQVs5ZufpsMljq4Ui0/1lvh+wjChP4kqKOJ2qxq
+4RgqsahDYVvTH9w7jXbyLeiNdd8XM2w9U/t7y0Ff/9yi0GE44Za4rF2LN9d11TPA
+mRGunUHBcnWEvgJBQl9nJEiU0Zsnvgc/ubhPgXRR4Xq37Z0j4r7g1SgEEzwxA57d
+emyPxgcYxn/eR44/KJ4EBs+lVDR3veyJm+kXQ99b21/+jh5Xos1AnX5iItreGCc=
+-----END CERTIFICATE-----
+
+# Issuer: O=FNMT-RCM OU=AC RAIZ FNMT-RCM
+# Subject: O=FNMT-RCM OU=AC RAIZ FNMT-RCM
+# Label: "AC RAIZ FNMT-RCM"
+# Serial: 485876308206448804701554682760554759
+# MD5 Fingerprint: e2:09:04:b4:d3:bd:d1:a0:14:fd:1a:d2:47:c4:57:1d
+# SHA1 Fingerprint: ec:50:35:07:b2:15:c4:95:62:19:e2:a8:9a:5b:42:99:2c:4c:2c:20
+# SHA256 Fingerprint: eb:c5:57:0c:29:01:8c:4d:67:b1:aa:12:7b:af:12:f7:03:b4:61:1e:bc:17:b7:da:b5:57:38:94:17:9b:93:fa
+-----BEGIN CERTIFICATE-----
+MIIFgzCCA2ugAwIBAgIPXZONMGc2yAYdGsdUhGkHMA0GCSqGSIb3DQEBCwUAMDsx
+CzAJBgNVBAYTAkVTMREwDwYDVQQKDAhGTk1ULVJDTTEZMBcGA1UECwwQQUMgUkFJ
+WiBGTk1ULVJDTTAeFw0wODEwMjkxNTU5NTZaFw0zMDAxMDEwMDAwMDBaMDsxCzAJ
+BgNVBAYTAkVTMREwDwYDVQQKDAhGTk1ULVJDTTEZMBcGA1UECwwQQUMgUkFJWiBG
+Tk1ULVJDTTCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBALpxgHpMhm5/
+yBNtwMZ9HACXjywMI7sQmkCpGreHiPibVmr75nuOi5KOpyVdWRHbNi63URcfqQgf
+BBckWKo3Shjf5TnUV/3XwSyRAZHiItQDwFj8d0fsjz50Q7qsNI1NOHZnjrDIbzAz
+WHFctPVrbtQBULgTfmxKo0nRIBnuvMApGGWn3v7v3QqQIecaZ5JCEJhfTzC8PhxF
+tBDXaEAUwED653cXeuYLj2VbPNmaUtu1vZ5Gzz3rkQUCwJaydkxNEJY7kvqcfw+Z
+374jNUUeAlz+taibmSXaXvMiwzn15Cou08YfxGyqxRxqAQVKL9LFwag0Jl1mpdIC
+IfkYtwb1TplvqKtMUejPUBjFd8g5CSxJkjKZqLsXF3mwWsXmo8RZZUc1g16p6DUL
+mbvkzSDGm0oGObVo/CK67lWMK07q87Hj/LaZmtVC+nFNCM+HHmpxffnTtOmlcYF7
+wk5HlqX2doWjKI/pgG6BU6VtX7hI+cL5NqYuSf+4lsKMB7ObiFj86xsc3i1w4peS
+MKGJ47xVqCfWS+2QrYv6YyVZLag13cqXM7zlzced0ezvXg5KkAYmY6252TUtB7p2
+ZSysV4999AeU14ECll2jB0nVetBX+RvnU0Z1qrB5QstocQjpYL05ac70r8NWQMet
+UqIJ5G+GR4of6ygnXYMgrwTJbFaai0b1AgMBAAGjgYMwgYAwDwYDVR0TAQH/BAUw
+AwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYEFPd9xf3E6Jobd2Sn9R2gzL+H
+YJptMD4GA1UdIAQ3MDUwMwYEVR0gADArMCkGCCsGAQUFBwIBFh1odHRwOi8vd3d3
+LmNlcnQuZm5tdC5lcy9kcGNzLzANBgkqhkiG9w0BAQsFAAOCAgEAB5BK3/MjTvDD
+nFFlm5wioooMhfNzKWtN/gHiqQxjAb8EZ6WdmF/9ARP67Jpi6Yb+tmLSbkyU+8B1
+RXxlDPiyN8+sD8+Nb/kZ94/sHvJwnvDKuO+3/3Y3dlv2bojzr2IyIpMNOmqOFGYM
+LVN0V2Ue1bLdI4E7pWYjJ2cJj+F3qkPNZVEI7VFY/uY5+ctHhKQV8Xa7pO6kO8Rf
+77IzlhEYt8llvhjho6Tc+hj507wTmzl6NLrTQfv6MooqtyuGC2mDOL7Nii4LcK2N
+JpLuHvUBKwrZ1pebbuCoGRw6IYsMHkCtA+fdZn71uSANA+iW+YJF1DngoABd15jm
+fZ5nc8OaKveri6E6FO80vFIOiZiaBECEHX5FaZNXzuvO+FB8TxxuBEOb+dY7Ixjp
+6o7RTUaN8Tvkasq6+yO3m/qZASlaWFot4/nUbQ4mrcFuNLwy+AwF+mWj2zs3gyLp
+1txyM/1d8iC9djwj2ij3+RvrWWTV3F9yfiD8zYm1kGdNYno/Tq0dwzn+evQoFt9B
+9kiABdcPUXmsEKvU7ANm5mqwujGSQkBqvjrTcuFqN1W8rB2Vt2lh8kORdOag0wok
+RqEIr9baRRmW1FMdW4R58MD3R++Lj8UGrp1MYp3/RgT408m2ECVAdf4WqslKYIYv
+uu8wd+RU4riEmViAqhOLUTpPSPaLtrM=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Amazon Root CA 1 O=Amazon
+# Subject: CN=Amazon Root CA 1 O=Amazon
+# Label: "Amazon Root CA 1"
+# Serial: 143266978916655856878034712317230054538369994
+# MD5 Fingerprint: 43:c6:bf:ae:ec:fe:ad:2f:18:c6:88:68:30:fc:c8:e6
+# SHA1 Fingerprint: 8d:a7:f9:65:ec:5e:fc:37:91:0f:1c:6e:59:fd:c1:cc:6a:6e:de:16
+# SHA256 Fingerprint: 8e:cd:e6:88:4f:3d:87:b1:12:5b:a3:1a:c3:fc:b1:3d:70:16:de:7f:57:cc:90:4f:e1:cb:97:c6:ae:98:19:6e
+-----BEGIN CERTIFICATE-----
+MIIDQTCCAimgAwIBAgITBmyfz5m/jAo54vB4ikPmljZbyjANBgkqhkiG9w0BAQsF
+ADA5MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6
+b24gUm9vdCBDQSAxMB4XDTE1MDUyNjAwMDAwMFoXDTM4MDExNzAwMDAwMFowOTEL
+MAkGA1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJv
+b3QgQ0EgMTCCASIwDQYJKoZIhvcNAQEBBQADggEPADCCAQoCggEBALJ4gHHKeNXj
+ca9HgFB0fW7Y14h29Jlo91ghYPl0hAEvrAIthtOgQ3pOsqTQNroBvo3bSMgHFzZM
+9O6II8c+6zf1tRn4SWiw3te5djgdYZ6k/oI2peVKVuRF4fn9tBb6dNqcmzU5L/qw
+IFAGbHrQgLKm+a/sRxmPUDgH3KKHOVj4utWp+UhnMJbulHheb4mjUcAwhmahRWa6
+VOujw5H5SNz/0egwLX0tdHA114gk957EWW67c4cX8jJGKLhD+rcdqsq08p8kDi1L
+93FcXmn/6pUCyziKrlA4b9v7LWIbxcceVOF34GfID5yHI9Y/QCB/IIDEgEw+OyQm
+jgSubJrIqg0CAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMC
+AYYwHQYDVR0OBBYEFIQYzIU07LwMlJQuCFmcx7IQTgoIMA0GCSqGSIb3DQEBCwUA
+A4IBAQCY8jdaQZChGsV2USggNiMOruYou6r4lK5IpDB/G/wkjUu0yKGX9rbxenDI
+U5PMCCjjmCXPI6T53iHTfIUJrU6adTrCC2qJeHZERxhlbI1Bjjt/msv0tadQ1wUs
+N+gDS63pYaACbvXy8MWy7Vu33PqUXHeeE6V/Uq2V8viTO96LXFvKWlJbYK8U90vv
+o/ufQJVtMVT8QtPHRh8jrdkPSHCa2XV4cdFyQzR1bldZwgJcJmApzyMZFo6IQ6XU
+5MsI+yMRQ+hDKXJioaldXgjUkK642M4UwtBV8ob2xJNDd2ZhwLnoQdeXeGADbkpy
+rqXRfboQnoZsG4q5WTP468SQvvG5
+-----END CERTIFICATE-----
+
+# Issuer: CN=Amazon Root CA 2 O=Amazon
+# Subject: CN=Amazon Root CA 2 O=Amazon
+# Label: "Amazon Root CA 2"
+# Serial: 143266982885963551818349160658925006970653239
+# MD5 Fingerprint: c8:e5:8d:ce:a8:42:e2:7a:c0:2a:5c:7c:9e:26:bf:66
+# SHA1 Fingerprint: 5a:8c:ef:45:d7:a6:98:59:76:7a:8c:8b:44:96:b5:78:cf:47:4b:1a
+# SHA256 Fingerprint: 1b:a5:b2:aa:8c:65:40:1a:82:96:01:18:f8:0b:ec:4f:62:30:4d:83:ce:c4:71:3a:19:c3:9c:01:1e:a4:6d:b4
+-----BEGIN CERTIFICATE-----
+MIIFQTCCAymgAwIBAgITBmyf0pY1hp8KD+WGePhbJruKNzANBgkqhkiG9w0BAQwF
+ADA5MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6
+b24gUm9vdCBDQSAyMB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTEL
+MAkGA1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJv
+b3QgQ0EgMjCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAK2Wny2cSkxK
+gXlRmeyKy2tgURO8TW0G/LAIjd0ZEGrHJgw12MBvIITplLGbhQPDW9tK6Mj4kHbZ
+W0/jTOgGNk3Mmqw9DJArktQGGWCsN0R5hYGCrVo34A3MnaZMUnbqQ523BNFQ9lXg
+1dKmSYXpN+nKfq5clU1Imj+uIFptiJXZNLhSGkOQsL9sBbm2eLfq0OQ6PBJTYv9K
+8nu+NQWpEjTj82R0Yiw9AElaKP4yRLuH3WUnAnE72kr3H9rN9yFVkE8P7K6C4Z9r
+2UXTu/Bfh+08LDmG2j/e7HJV63mjrdvdfLC6HM783k81ds8P+HgfajZRRidhW+me
+z/CiVX18JYpvL7TFz4QuK/0NURBs+18bvBt+xa47mAExkv8LV/SasrlX6avvDXbR
+8O70zoan4G7ptGmh32n2M8ZpLpcTnqWHsFcQgTfJU7O7f/aS0ZzQGPSSbtqDT6Zj
+mUyl+17vIWR6IF9sZIUVyzfpYgwLKhbcAS4y2j5L9Z469hdAlO+ekQiG+r5jqFoz
+7Mt0Q5X5bGlSNscpb/xVA1wf+5+9R+vnSUeVC06JIglJ4PVhHvG/LopyboBZ/1c6
++XUyo05f7O0oYtlNc/LMgRdg7c3r3NunysV+Ar3yVAhU/bQtCSwXVEqY0VThUWcI
+0u1ufm8/0i2BWSlmy5A5lREedCf+3euvAgMBAAGjQjBAMA8GA1UdEwEB/wQFMAMB
+Af8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQWBBSwDPBMMPQFWAJI/TPlUq9LhONm
+UjANBgkqhkiG9w0BAQwFAAOCAgEAqqiAjw54o+Ci1M3m9Zh6O+oAA7CXDpO8Wqj2
+LIxyh6mx/H9z/WNxeKWHWc8w4Q0QshNabYL1auaAn6AFC2jkR2vHat+2/XcycuUY
++gn0oJMsXdKMdYV2ZZAMA3m3MSNjrXiDCYZohMr/+c8mmpJ5581LxedhpxfL86kS
+k5Nrp+gvU5LEYFiwzAJRGFuFjWJZY7attN6a+yb3ACfAXVU3dJnJUH/jWS5E4ywl
+7uxMMne0nxrpS10gxdr9HIcWxkPo1LsmmkVwXqkLN1PiRnsn/eBG8om3zEK2yygm
+btmlyTrIQRNg91CMFa6ybRoVGld45pIq2WWQgj9sAq+uEjonljYE1x2igGOpm/Hl
+urR8FLBOybEfdF849lHqm/osohHUqS0nGkWxr7JOcQ3AWEbWaQbLU8uz/mtBzUF+
+fUwPfHJ5elnNXkoOrJupmHN5fLT0zLm4BwyydFy4x2+IoZCn9Kr5v2c69BoVYh63
+n749sSmvZ6ES8lgQGVMDMBu4Gon2nL2XA46jCfMdiyHxtN/kHNGfZQIG6lzWE7OE
+76KlXIx3KadowGuuQNKotOrN8I1LOJwZmhsoVLiJkO/KdYE+HvJkJMcYr07/R54H
+9jVlpNMKVv/1F2Rs76giJUmTtt8AF9pYfl3uxRuw0dFfIRDH+fO6AgonB8Xx1sfT
+4PsJYGw=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Amazon Root CA 3 O=Amazon
+# Subject: CN=Amazon Root CA 3 O=Amazon
+# Label: "Amazon Root CA 3"
+# Serial: 143266986699090766294700635381230934788665930
+# MD5 Fingerprint: a0:d4:ef:0b:f7:b5:d8:49:95:2a:ec:f5:c4:fc:81:87
+# SHA1 Fingerprint: 0d:44:dd:8c:3c:8c:1a:1a:58:75:64:81:e9:0f:2e:2a:ff:b3:d2:6e
+# SHA256 Fingerprint: 18:ce:6c:fe:7b:f1:4e:60:b2:e3:47:b8:df:e8:68:cb:31:d0:2e:bb:3a:da:27:15:69:f5:03:43:b4:6d:b3:a4
+-----BEGIN CERTIFICATE-----
+MIIBtjCCAVugAwIBAgITBmyf1XSXNmY/Owua2eiedgPySjAKBggqhkjOPQQDAjA5
+MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6b24g
+Um9vdCBDQSAzMB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTELMAkG
+A1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJvb3Qg
+Q0EgMzBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABCmXp8ZBf8ANm+gBG1bG8lKl
+ui2yEujSLtf6ycXYqm0fc4E7O5hrOXwzpcVOho6AF2hiRVd9RFgdszflZwjrZt6j
+QjBAMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMB0GA1UdDgQWBBSr
+ttvXBp43rDCGB5Fwx5zEGbF4wDAKBggqhkjOPQQDAgNJADBGAiEA4IWSoxe3jfkr
+BqWTrBqYaGFy+uGh0PsceGCmQ5nFuMQCIQCcAu/xlJyzlvnrxir4tiz+OpAUFteM
+YyRIHN8wfdVoOw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Amazon Root CA 4 O=Amazon
+# Subject: CN=Amazon Root CA 4 O=Amazon
+# Label: "Amazon Root CA 4"
+# Serial: 143266989758080763974105200630763877849284878
+# MD5 Fingerprint: 89:bc:27:d5:eb:17:8d:06:6a:69:d5:fd:89:47:b4:cd
+# SHA1 Fingerprint: f6:10:84:07:d6:f8:bb:67:98:0c:c2:e2:44:c2:eb:ae:1c:ef:63:be
+# SHA256 Fingerprint: e3:5d:28:41:9e:d0:20:25:cf:a6:90:38:cd:62:39:62:45:8d:a5:c6:95:fb:de:a3:c2:2b:0b:fb:25:89:70:92
+-----BEGIN CERTIFICATE-----
+MIIB8jCCAXigAwIBAgITBmyf18G7EEwpQ+Vxe3ssyBrBDjAKBggqhkjOPQQDAzA5
+MQswCQYDVQQGEwJVUzEPMA0GA1UEChMGQW1hem9uMRkwFwYDVQQDExBBbWF6b24g
+Um9vdCBDQSA0MB4XDTE1MDUyNjAwMDAwMFoXDTQwMDUyNjAwMDAwMFowOTELMAkG
+A1UEBhMCVVMxDzANBgNVBAoTBkFtYXpvbjEZMBcGA1UEAxMQQW1hem9uIFJvb3Qg
+Q0EgNDB2MBAGByqGSM49AgEGBSuBBAAiA2IABNKrijdPo1MN/sGKe0uoe0ZLY7Bi
+9i0b2whxIdIA6GO9mif78DluXeo9pcmBqqNbIJhFXRbb/egQbeOc4OO9X4Ri83Bk
+M6DLJC9wuoihKqB1+IGuYgbEgds5bimwHvouXKNCMEAwDwYDVR0TAQH/BAUwAwEB
+/zAOBgNVHQ8BAf8EBAMCAYYwHQYDVR0OBBYEFNPsxzplbszh2naaVvuc84ZtV+WB
+MAoGCCqGSM49BAMDA2gAMGUCMDqLIfG9fhGt0O9Yli/W651+kI0rz2ZVwyzjKKlw
+CkcO8DdZEv8tmZQoTipPNU0zWgIxAOp1AE47xDqUEpHJWEadIRNyp4iciuRMStuW
+1KyLa2tJElMzrdfkviT8tQp21KW8EA==
+-----END CERTIFICATE-----
+
+# Issuer: CN=TUBITAK Kamu SM SSL Kok Sertifikasi - Surum 1 O=Turkiye Bilimsel ve Teknolojik Arastirma Kurumu - TUBITAK OU=Kamu Sertifikasyon Merkezi - Kamu SM
+# Subject: CN=TUBITAK Kamu SM SSL Kok Sertifikasi - Surum 1 O=Turkiye Bilimsel ve Teknolojik Arastirma Kurumu - TUBITAK OU=Kamu Sertifikasyon Merkezi - Kamu SM
+# Label: "TUBITAK Kamu SM SSL Kok Sertifikasi - Surum 1"
+# Serial: 1
+# MD5 Fingerprint: dc:00:81:dc:69:2f:3e:2f:b0:3b:f6:3d:5a:91:8e:49
+# SHA1 Fingerprint: 31:43:64:9b:ec:ce:27:ec:ed:3a:3f:0b:8f:0d:e4:e8:91:dd:ee:ca
+# SHA256 Fingerprint: 46:ed:c3:68:90:46:d5:3a:45:3f:b3:10:4a:b8:0d:ca:ec:65:8b:26:60:ea:16:29:dd:7e:86:79:90:64:87:16
+-----BEGIN CERTIFICATE-----
+MIIEYzCCA0ugAwIBAgIBATANBgkqhkiG9w0BAQsFADCB0jELMAkGA1UEBhMCVFIx
+GDAWBgNVBAcTD0dlYnplIC0gS29jYWVsaTFCMEAGA1UEChM5VHVya2l5ZSBCaWxp
+bXNlbCB2ZSBUZWtub2xvamlrIEFyYXN0aXJtYSBLdXJ1bXUgLSBUVUJJVEFLMS0w
+KwYDVQQLEyRLYW11IFNlcnRpZmlrYXN5b24gTWVya2V6aSAtIEthbXUgU00xNjA0
+BgNVBAMTLVRVQklUQUsgS2FtdSBTTSBTU0wgS29rIFNlcnRpZmlrYXNpIC0gU3Vy
+dW0gMTAeFw0xMzExMjUwODI1NTVaFw00MzEwMjUwODI1NTVaMIHSMQswCQYDVQQG
+EwJUUjEYMBYGA1UEBxMPR2ViemUgLSBLb2NhZWxpMUIwQAYDVQQKEzlUdXJraXll
+IEJpbGltc2VsIHZlIFRla25vbG9qaWsgQXJhc3Rpcm1hIEt1cnVtdSAtIFRVQklU
+QUsxLTArBgNVBAsTJEthbXUgU2VydGlmaWthc3lvbiBNZXJrZXppIC0gS2FtdSBT
+TTE2MDQGA1UEAxMtVFVCSVRBSyBLYW11IFNNIFNTTCBLb2sgU2VydGlmaWthc2kg
+LSBTdXJ1bSAxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAr3UwM6q7
+a9OZLBI3hNmNe5eA027n/5tQlT6QlVZC1xl8JoSNkvoBHToP4mQ4t4y86Ij5iySr
+LqP1N+RAjhgleYN1Hzv/bKjFxlb4tO2KRKOrbEz8HdDc72i9z+SqzvBV96I01INr
+N3wcwv61A+xXzry0tcXtAA9TNypN9E8Mg/uGz8v+jE69h/mniyFXnHrfA2eJLJ2X
+YacQuFWQfw4tJzh03+f92k4S400VIgLI4OD8D62K18lUUMw7D8oWgITQUVbDjlZ/
+iSIzL+aFCr2lqBs23tPcLG07xxO9WSMs5uWk99gL7eqQQESolbuT1dCANLZGeA4f
+AJNG4e7p+exPFwIDAQABo0IwQDAdBgNVHQ4EFgQUZT/HiobGPN08VFw1+DrtUgxH
+V8gwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEL
+BQADggEBACo/4fEyjq7hmFxLXs9rHmoJ0iKpEsdeV31zVmSAhHqT5Am5EM2fKifh
+AHe+SMg1qIGf5LgsyX8OsNJLN13qudULXjS99HMpw+0mFZx+CFOKWI3QSyjfwbPf
+IPP54+M638yclNhOT8NrF7f3cuitZjO1JVOr4PhMqZ398g26rrnZqsZr+ZO7rqu4
+lzwDGrpDxpa5RXI4s6ehlj2Re37AIVNMh+3yC1SVUZPVIqUNivGTDj5UDrDYyU7c
+8jEyVupk+eq1nRZmQnLzf9OxMUP8pI4X8W0jq5Rm+K37DwhuJi1/FwcJsoz7UMCf
+lo3Ptv0AnVoUmr8CRPXBwp8iXqIPoeM=
+-----END CERTIFICATE-----
+
+# Issuer: CN=GDCA TrustAUTH R5 ROOT O=GUANG DONG CERTIFICATE AUTHORITY CO.,LTD.
+# Subject: CN=GDCA TrustAUTH R5 ROOT O=GUANG DONG CERTIFICATE AUTHORITY CO.,LTD.
+# Label: "GDCA TrustAUTH R5 ROOT"
+# Serial: 9009899650740120186
+# MD5 Fingerprint: 63:cc:d9:3d:34:35:5c:6f:53:a3:e2:08:70:48:1f:b4
+# SHA1 Fingerprint: 0f:36:38:5b:81:1a:25:c3:9b:31:4e:83:ca:e9:34:66:70:cc:74:b4
+# SHA256 Fingerprint: bf:ff:8f:d0:44:33:48:7d:6a:8a:a6:0c:1a:29:76:7a:9f:c2:bb:b0:5e:42:0f:71:3a:13:b9:92:89:1d:38:93
+-----BEGIN CERTIFICATE-----
+MIIFiDCCA3CgAwIBAgIIfQmX/vBH6nowDQYJKoZIhvcNAQELBQAwYjELMAkGA1UE
+BhMCQ04xMjAwBgNVBAoMKUdVQU5HIERPTkcgQ0VSVElGSUNBVEUgQVVUSE9SSVRZ
+IENPLixMVEQuMR8wHQYDVQQDDBZHRENBIFRydXN0QVVUSCBSNSBST09UMB4XDTE0
+MTEyNjA1MTMxNVoXDTQwMTIzMTE1NTk1OVowYjELMAkGA1UEBhMCQ04xMjAwBgNV
+BAoMKUdVQU5HIERPTkcgQ0VSVElGSUNBVEUgQVVUSE9SSVRZIENPLixMVEQuMR8w
+HQYDVQQDDBZHRENBIFRydXN0QVVUSCBSNSBST09UMIICIjANBgkqhkiG9w0BAQEF
+AAOCAg8AMIICCgKCAgEA2aMW8Mh0dHeb7zMNOwZ+Vfy1YI92hhJCfVZmPoiC7XJj
+Dp6L3TQsAlFRwxn9WVSEyfFrs0yw6ehGXTjGoqcuEVe6ghWinI9tsJlKCvLriXBj
+TnnEt1u9ol2x8kECK62pOqPseQrsXzrj/e+APK00mxqriCZ7VqKChh/rNYmDf1+u
+KU49tm7srsHwJ5uu4/Ts765/94Y9cnrrpftZTqfrlYwiOXnhLQiPzLyRuEH3FMEj
+qcOtmkVEs7LXLM3GKeJQEK5cy4KOFxg2fZfmiJqwTTQJ9Cy5WmYqsBebnh52nUpm
+MUHfP/vFBu8btn4aRjb3ZGM74zkYI+dndRTVdVeSN72+ahsmUPI2JgaQxXABZG12
+ZuGR224HwGGALrIuL4xwp9E7PLOR5G62xDtw8mySlwnNR30YwPO7ng/Wi64HtloP
+zgsMR6flPri9fcebNaBhlzpBdRfMK5Z3KpIhHtmVdiBnaM8Nvd/WHwlqmuLMc3Gk
+L30SgLdTMEZeS1SZD2fJpcjyIMGC7J0R38IC+xo70e0gmu9lZJIQDSri3nDxGGeC
+jGHeuLzRL5z7D9Ar7Rt2ueQ5Vfj4oR24qoAATILnsn8JuLwwoC8N9VKejveSswoA
+HQBUlwbgsQfZxw9cZX08bVlX5O2ljelAU58VS6Bx9hoh49pwBiFYFIeFd3mqgnkC
+AwEAAaNCMEAwHQYDVR0OBBYEFOLJQJ9NzuiaoXzPDj9lxSmIahlRMA8GA1UdEwEB
+/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3DQEBCwUAA4ICAQDRSVfg
+p8xoWLoBDysZzY2wYUWsEe1jUGn4H3++Fo/9nesLqjJHdtJnJO29fDMylyrHBYZm
+DRd9FBUb1Ov9H5r2XpdptxolpAqzkT9fNqyL7FeoPueBihhXOYV0GkLH6VsTX4/5
+COmSdI31R9KrO9b7eGZONn356ZLpBN79SWP8bfsUcZNnL0dKt7n/HipzcEYwv1ry
+L3ml4Y0M2fmyYzeMN2WFcGpcWwlyua1jPLHd+PwyvzeG5LuOmCd+uh8W4XAR8gPf
+JWIyJyYYMoSf/wA6E7qaTfRPuBRwIrHKK5DOKcFw9C+df/KQHtZa37dG/OaG+svg
+IHZ6uqbL9XzeYqWxi+7egmaKTjowHz+Ay60nugxe19CxVsp3cbK1daFQqUBDF8Io
+2c9Si1vIY9RCPqAzekYu9wogRlR+ak8x8YF+QnQ4ZXMn7sZ8uI7XpTrXmKGcjBBV
+09tL7ECQ8s1uV9JiDnxXk7Gnbc2dg7sq5+W2O3FYrf3RRbxake5TFW/TRQl1brqQ
+XR4EzzffHqhmsYzmIGrv/EhOdJhCrylvLmrH+33RZjEizIYAfmaDDEL0vTSSwxrq
+T8p+ck0LcIymSLumoRT2+1hEmRSuqguTaaApJUqlyyvdimYHFngVV3Eb7PVHhPOe
+MTd61X8kreS8/f3MboPoDKi3QWwH3b08hpcv0g==
+-----END CERTIFICATE-----
+
+# Issuer: CN=TrustCor RootCert CA-1 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Subject: CN=TrustCor RootCert CA-1 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Label: "TrustCor RootCert CA-1"
+# Serial: 15752444095811006489
+# MD5 Fingerprint: 6e:85:f1:dc:1a:00:d3:22:d5:b2:b2:ac:6b:37:05:45
+# SHA1 Fingerprint: ff:bd:cd:e7:82:c8:43:5e:3c:6f:26:86:5c:ca:a8:3a:45:5b:c3:0a
+# SHA256 Fingerprint: d4:0e:9c:86:cd:8f:e4:68:c1:77:69:59:f4:9e:a7:74:fa:54:86:84:b6:c4:06:f3:90:92:61:f4:dc:e2:57:5c
+-----BEGIN CERTIFICATE-----
+MIIEMDCCAxigAwIBAgIJANqb7HHzA7AZMA0GCSqGSIb3DQEBCwUAMIGkMQswCQYD
+VQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEgQ2l0eTEk
+MCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYDVQQLDB5U
+cnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxHzAdBgNVBAMMFlRydXN0Q29y
+IFJvb3RDZXJ0IENBLTEwHhcNMTYwMjA0MTIzMjE2WhcNMjkxMjMxMTcyMzE2WjCB
+pDELMAkGA1UEBhMCUEExDzANBgNVBAgMBlBhbmFtYTEUMBIGA1UEBwwLUGFuYW1h
+IENpdHkxJDAiBgNVBAoMG1RydXN0Q29yIFN5c3RlbXMgUy4gZGUgUi5MLjEnMCUG
+A1UECwweVHJ1c3RDb3IgQ2VydGlmaWNhdGUgQXV0aG9yaXR5MR8wHQYDVQQDDBZU
+cnVzdENvciBSb290Q2VydCBDQS0xMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIB
+CgKCAQEAv463leLCJhJrMxnHQFgKq1mqjQCj/IDHUHuO1CAmujIS2CNUSSUQIpid
+RtLByZ5OGy4sDjjzGiVoHKZaBeYei0i/mJZ0PmnK6bV4pQa81QBeCQryJ3pS/C3V
+seq0iWEk8xoT26nPUu0MJLq5nux+AHT6k61sKZKuUbS701e/s/OojZz0JEsq1pme
+9J7+wH5COucLlVPat2gOkEz7cD+PSiyU8ybdY2mplNgQTsVHCJCZGxdNuWxu72CV
+EY4hgLW9oHPY0LJ3xEXqWib7ZnZ2+AYfYW0PVcWDtxBWcgYHpfOxGgMFZA6dWorW
+hnAbJN7+KIor0Gqw/Hqi3LJ5DotlDwIDAQABo2MwYTAdBgNVHQ4EFgQU7mtJPHo/
+DeOxCbeKyKsZn3MzUOcwHwYDVR0jBBgwFoAU7mtJPHo/DeOxCbeKyKsZn3MzUOcw
+DwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQAD
+ggEBACUY1JGPE+6PHh0RU9otRCkZoB5rMZ5NDp6tPVxBb5UrJKF5mDo4Nvu7Zp5I
+/5CQ7z3UuJu0h3U/IJvOcs+hVcFNZKIZBqEHMwwLKeXx6quj7LUKdJDHfXLy11yf
+ke+Ri7fc7Waiz45mO7yfOgLgJ90WmMCV1Aqk5IGadZQ1nJBfiDcGrVmVCrDRZ9MZ
+yonnMlo2HD6CqFqTvsbQZJG2z9m2GM/bftJlo6bEjhcxwft+dtvTheNYsnd6djts
+L1Ac59v2Z3kf9YKVmgenFK+P3CghZwnS1k1aHBkcjndcw5QkPTJrS37UeJSDvjdN
+zl/HHk484IkzlQsPpTLWPFp5LBk=
+-----END CERTIFICATE-----
+
+# Issuer: CN=TrustCor RootCert CA-2 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Subject: CN=TrustCor RootCert CA-2 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Label: "TrustCor RootCert CA-2"
+# Serial: 2711694510199101698
+# MD5 Fingerprint: a2:e1:f8:18:0b:ba:45:d5:c7:41:2a:bb:37:52:45:64
+# SHA1 Fingerprint: b8:be:6d:cb:56:f1:55:b9:63:d4:12:ca:4e:06:34:c7:94:b2:1c:c0
+# SHA256 Fingerprint: 07:53:e9:40:37:8c:1b:d5:e3:83:6e:39:5d:ae:a5:cb:83:9e:50:46:f1:bd:0e:ae:19:51:cf:10:fe:c7:c9:65
+-----BEGIN CERTIFICATE-----
+MIIGLzCCBBegAwIBAgIIJaHfyjPLWQIwDQYJKoZIhvcNAQELBQAwgaQxCzAJBgNV
+BAYTAlBBMQ8wDQYDVQQIDAZQYW5hbWExFDASBgNVBAcMC1BhbmFtYSBDaXR5MSQw
+IgYDVQQKDBtUcnVzdENvciBTeXN0ZW1zIFMuIGRlIFIuTC4xJzAlBgNVBAsMHlRy
+dXN0Q29yIENlcnRpZmljYXRlIEF1dGhvcml0eTEfMB0GA1UEAwwWVHJ1c3RDb3Ig
+Um9vdENlcnQgQ0EtMjAeFw0xNjAyMDQxMjMyMjNaFw0zNDEyMzExNzI2MzlaMIGk
+MQswCQYDVQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEg
+Q2l0eTEkMCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYD
+VQQLDB5UcnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxHzAdBgNVBAMMFlRy
+dXN0Q29yIFJvb3RDZXJ0IENBLTIwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK
+AoICAQCnIG7CKqJiJJWQdsg4foDSq8GbZQWU9MEKENUCrO2fk8eHyLAnK0IMPQo+
+QVqedd2NyuCb7GgypGmSaIwLgQ5WoD4a3SwlFIIvl9NkRvRUqdw6VC0xK5mC8tkq
+1+9xALgxpL56JAfDQiDyitSSBBtlVkxs1Pu2YVpHI7TYabS3OtB0PAx1oYxOdqHp
+2yqlO/rOsP9+aij9JxzIsekp8VduZLTQwRVtDr4uDkbIXvRR/u8OYzo7cbrPb1nK
+DOObXUm4TOJXsZiKQlecdu/vvdFoqNL0Cbt3Nb4lggjEFixEIFapRBF37120Hape
+az6LMvYHL1cEksr1/p3C6eizjkxLAjHZ5DxIgif3GIJ2SDpxsROhOdUuxTTCHWKF
+3wP+TfSvPd9cW436cOGlfifHhi5qjxLGhF5DUVCcGZt45vz27Ud+ez1m7xMTiF88
+oWP7+ayHNZ/zgp6kPwqcMWmLmaSISo5uZk3vFsQPeSghYA2FFn3XVDjxklb9tTNM
+g9zXEJ9L/cb4Qr26fHMC4P99zVvh1Kxhe1fVSntb1IVYJ12/+CtgrKAmrhQhJ8Z3
+mjOAPF5GP/fDsaOGM8boXg25NSyqRsGFAnWAoOsk+xWq5Gd/bnc/9ASKL3x74xdh
+8N0JqSDIvgmk0H5Ew7IwSjiqqewYmgeCK9u4nBit2uBGF6zPXQIDAQABo2MwYTAd
+BgNVHQ4EFgQU2f4hQG6UnrybPZx9mCAZ5YwwYrIwHwYDVR0jBBgwFoAU2f4hQG6U
+nrybPZx9mCAZ5YwwYrIwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYw
+DQYJKoZIhvcNAQELBQADggIBAJ5Fngw7tu/hOsh80QA9z+LqBrWyOrsGS2h60COX
+dKcs8AjYeVrXWoSK2BKaG9l9XE1wxaX5q+WjiYndAfrs3fnpkpfbsEZC89NiqpX+
+MWcUaViQCqoL7jcjx1BRtPV+nuN79+TMQjItSQzL/0kMmx40/W5ulop5A7Zv2wnL
+/V9lFDfhOPXzYRZY5LVtDQsEGz9QLX+zx3oaFoBg+Iof6Rsqxvm6ARppv9JYx1RX
+CI/hOWB3S6xZhBqI8d3LT3jX5+EzLfzuQfogsL7L9ziUwOHQhQ+77Sxzq+3+knYa
+ZH9bDTMJBzN7Bj8RpFxwPIXAz+OQqIN3+tvmxYxoZxBnpVIt8MSZj3+/0WvitUfW
+2dCFmU2Umw9Lje4AWkcdEQOsQRivh7dvDDqPys/cA8GiCcjl/YBeyGBCARsaU1q7
+N6a3vLqE6R5sGtRk2tRD/pOLS/IseRYQ1JMLiI+h2IYURpFHmygk71dSTlxCnKr3
+Sewn6EAes6aJInKc9Q0ztFijMDvd1GpUk74aTfOTlPf8hAs/hCBcNANExdqtvArB
+As8e5ZTZ845b2EzwnexhF7sUMlQMAimTHpKG9n/v55IFDlndmQguLvqcAFLTxWYp
+5KeXRKQOKIETNcX2b2TmQcTVL8w0RSXPQQCWPUouwpaYT05KnJe32x+SMsj/D1Fu
+1uwJ
+-----END CERTIFICATE-----
+
+# Issuer: CN=TrustCor ECA-1 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Subject: CN=TrustCor ECA-1 O=TrustCor Systems S. de R.L. OU=TrustCor Certificate Authority
+# Label: "TrustCor ECA-1"
+# Serial: 9548242946988625984
+# MD5 Fingerprint: 27:92:23:1d:0a:f5:40:7c:e9:e6:6b:9d:d8:f5:e7:6c
+# SHA1 Fingerprint: 58:d1:df:95:95:67:6b:63:c0:f0:5b:1c:17:4d:8b:84:0b:c8:78:bd
+# SHA256 Fingerprint: 5a:88:5d:b1:9c:01:d9:12:c5:75:93:88:93:8c:af:bb:df:03:1a:b2:d4:8e:91:ee:15:58:9b:42:97:1d:03:9c
+-----BEGIN CERTIFICATE-----
+MIIEIDCCAwigAwIBAgIJAISCLF8cYtBAMA0GCSqGSIb3DQEBCwUAMIGcMQswCQYD
+VQQGEwJQQTEPMA0GA1UECAwGUGFuYW1hMRQwEgYDVQQHDAtQYW5hbWEgQ2l0eTEk
+MCIGA1UECgwbVHJ1c3RDb3IgU3lzdGVtcyBTLiBkZSBSLkwuMScwJQYDVQQLDB5U
+cnVzdENvciBDZXJ0aWZpY2F0ZSBBdXRob3JpdHkxFzAVBgNVBAMMDlRydXN0Q29y
+IEVDQS0xMB4XDTE2MDIwNDEyMzIzM1oXDTI5MTIzMTE3MjgwN1owgZwxCzAJBgNV
+BAYTAlBBMQ8wDQYDVQQIDAZQYW5hbWExFDASBgNVBAcMC1BhbmFtYSBDaXR5MSQw
+IgYDVQQKDBtUcnVzdENvciBTeXN0ZW1zIFMuIGRlIFIuTC4xJzAlBgNVBAsMHlRy
+dXN0Q29yIENlcnRpZmljYXRlIEF1dGhvcml0eTEXMBUGA1UEAwwOVHJ1c3RDb3Ig
+RUNBLTEwggEiMA0GCSqGSIb3DQEBAQUAA4IBDwAwggEKAoIBAQDPj+ARtZ+odnbb
+3w9U73NjKYKtR8aja+3+XzP4Q1HpGjORMRegdMTUpwHmspI+ap3tDvl0mEDTPwOA
+BoJA6LHip1GnHYMma6ve+heRK9jGrB6xnhkB1Zem6g23xFUfJ3zSCNV2HykVh0A5
+3ThFEXXQmqc04L/NyFIduUd+Dbi7xgz2c1cWWn5DkR9VOsZtRASqnKmcp0yJF4Ou
+owReUoCLHhIlERnXDH19MURB6tuvsBzvgdAsxZohmz3tQjtQJvLsznFhBmIhVE5/
+wZ0+fyCMgMsq2JdiyIMzkX2woloPV+g7zPIlstR8L+xNxqE6FXrntl019fZISjZF
+ZtS6mFjBAgMBAAGjYzBhMB0GA1UdDgQWBBREnkj1zG1I1KBLf/5ZJC+Dl5mahjAf
+BgNVHSMEGDAWgBREnkj1zG1I1KBLf/5ZJC+Dl5mahjAPBgNVHRMBAf8EBTADAQH/
+MA4GA1UdDwEB/wQEAwIBhjANBgkqhkiG9w0BAQsFAAOCAQEABT41XBVwm8nHc2Fv
+civUwo/yQ10CzsSUuZQRg2dd4mdsdXa/uwyqNsatR5Nj3B5+1t4u/ukZMjgDfxT2
+AHMsWbEhBuH7rBiVDKP/mZb3Kyeb1STMHd3BOuCYRLDE5D53sXOpZCz2HAF8P11F
+hcCF5yWPldwX8zyfGm6wyuMdKulMY/okYWLW2n62HGz1Ah3UKt1VkOsqEUc8Ll50
+soIipX1TH0XsJ5F95yIW6MBoNtjG8U+ARDL54dHRHareqKucBK+tIA5kmE2la8BI
+WJZpTdwHjFGTot+fDz2LYLSCjaoITmJF4PkL0uDgPFveXHEnJcLmA4GLEFPjx1Wi
+tJ/X5g==
+-----END CERTIFICATE-----
+
+# Issuer: CN=SSL.com Root Certification Authority RSA O=SSL Corporation
+# Subject: CN=SSL.com Root Certification Authority RSA O=SSL Corporation
+# Label: "SSL.com Root Certification Authority RSA"
+# Serial: 8875640296558310041
+# MD5 Fingerprint: 86:69:12:c0:70:f1:ec:ac:ac:c2:d5:bc:a5:5b:a1:29
+# SHA1 Fingerprint: b7:ab:33:08:d1:ea:44:77:ba:14:80:12:5a:6f:bd:a9:36:49:0c:bb
+# SHA256 Fingerprint: 85:66:6a:56:2e:e0:be:5c:e9:25:c1:d8:89:0a:6f:76:a8:7e:c1:6d:4d:7d:5f:29:ea:74:19:cf:20:12:3b:69
+-----BEGIN CERTIFICATE-----
+MIIF3TCCA8WgAwIBAgIIeyyb0xaAMpkwDQYJKoZIhvcNAQELBQAwfDELMAkGA1UE
+BhMCVVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQK
+DA9TU0wgQ29ycG9yYXRpb24xMTAvBgNVBAMMKFNTTC5jb20gUm9vdCBDZXJ0aWZp
+Y2F0aW9uIEF1dGhvcml0eSBSU0EwHhcNMTYwMjEyMTczOTM5WhcNNDEwMjEyMTcz
+OTM5WjB8MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hv
+dXN0b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjExMC8GA1UEAwwoU1NMLmNv
+bSBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IFJTQTCCAiIwDQYJKoZIhvcN
+AQEBBQADggIPADCCAgoCggIBAPkP3aMrfcvQKv7sZ4Wm5y4bunfh4/WvpOz6Sl2R
+xFdHaxh3a3by/ZPkPQ/CFp4LZsNWlJ4Xg4XOVu/yFv0AYvUiCVToZRdOQbngT0aX
+qhvIuG5iXmmxX9sqAn78bMrzQdjt0Oj8P2FI7bADFB0QDksZ4LtO7IZl/zbzXmcC
+C52GVWH9ejjt/uIZALdvoVBidXQ8oPrIJZK0bnoix/geoeOy3ZExqysdBP+lSgQ3
+6YWkMyv94tZVNHwZpEpox7Ko07fKoZOI68GXvIz5HdkihCR0xwQ9aqkpk8zruFvh
+/l8lqjRYyMEjVJ0bmBHDOJx+PYZspQ9AhnwC9FwCTyjLrnGfDzrIM/4RJTXq/LrF
+YD3ZfBjVsqnTdXgDciLKOsMf7yzlLqn6niy2UUb9rwPW6mBo6oUWNmuF6R7As93E
+JNyAKoFBbZQ+yODJgUEAnl6/f8UImKIYLEJAs/lvOCdLToD0PYFH4Ih86hzOtXVc
+US4cK38acijnALXRdMbX5J+tB5O2UzU1/Dfkw/ZdFr4hc96SCvigY2q8lpJqPvi8
+ZVWb3vUNiSYE/CUapiVpy8JtynziWV+XrOvvLsi81xtZPCvM8hnIk2snYxnP/Okm
++Mpxm3+T/jRnhE6Z6/yzeAkzcLpmpnbtG3PrGqUNxCITIJRWCk4sbE6x/c+cCbqi
+M+2HAgMBAAGjYzBhMB0GA1UdDgQWBBTdBAkHovV6fVJTEpKV7jiAJQ2mWTAPBgNV
+HRMBAf8EBTADAQH/MB8GA1UdIwQYMBaAFN0ECQei9Xp9UlMSkpXuOIAlDaZZMA4G
+A1UdDwEB/wQEAwIBhjANBgkqhkiG9w0BAQsFAAOCAgEAIBgRlCn7Jp0cHh5wYfGV
+cpNxJK1ok1iOMq8bs3AD/CUrdIWQPXhq9LmLpZc7tRiRux6n+UBbkflVma8eEdBc
+Hadm47GUBwwyOabqG7B52B2ccETjit3E+ZUfijhDPwGFpUenPUayvOUiaPd7nNgs
+PgohyC0zrL/FgZkxdMF1ccW+sfAjRfSda/wZY52jvATGGAslu1OJD7OAUN5F7kR/
+q5R4ZJjT9ijdh9hwZXT7DrkT66cPYakylszeu+1jTBi7qUD3oFRuIIhxdRjqerQ0
+cuAjJ3dctpDqhiVAq+8zD8ufgr6iIPv2tS0a5sKFsXQP+8hlAqRSAUfdSSLBv9jr
+a6x+3uxjMxW3IwiPxg+NQVrdjsW5j+VFP3jbutIbQLH+cU0/4IGiul607BXgk90I
+H37hVZkLId6Tngr75qNJvTYw/ud3sqB1l7UtgYgXZSD32pAAn8lSzDLKNXz1PQ/Y
+K9f1JmzJBjSWFupwWRoyeXkLtoh/D1JIPb9s2KJELtFOt3JY04kTlf5Eq/jXixtu
+nLwsoFvVagCvXzfh1foQC5ichucmj87w7G6KVwuA406ywKBjYZC6VWg3dGq2ktuf
+oYYitmUnDuy2n0Jg5GfCtdpBC8TTi2EbvPofkSvXRAdeuims2cXp71NIWuuA8ShY
+Ic2wBlX7Jz9TkHCpBB5XJ7k=
+-----END CERTIFICATE-----
+
+# Issuer: CN=SSL.com Root Certification Authority ECC O=SSL Corporation
+# Subject: CN=SSL.com Root Certification Authority ECC O=SSL Corporation
+# Label: "SSL.com Root Certification Authority ECC"
+# Serial: 8495723813297216424
+# MD5 Fingerprint: 2e:da:e4:39:7f:9c:8f:37:d1:70:9f:26:17:51:3a:8e
+# SHA1 Fingerprint: c3:19:7c:39:24:e6:54:af:1b:c4:ab:20:95:7a:e2:c3:0e:13:02:6a
+# SHA256 Fingerprint: 34:17:bb:06:cc:60:07:da:1b:96:1c:92:0b:8a:b4:ce:3f:ad:82:0e:4a:a3:0b:9a:cb:c4:a7:4e:bd:ce:bc:65
+-----BEGIN CERTIFICATE-----
+MIICjTCCAhSgAwIBAgIIdebfy8FoW6gwCgYIKoZIzj0EAwIwfDELMAkGA1UEBhMC
+VVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQKDA9T
+U0wgQ29ycG9yYXRpb24xMTAvBgNVBAMMKFNTTC5jb20gUm9vdCBDZXJ0aWZpY2F0
+aW9uIEF1dGhvcml0eSBFQ0MwHhcNMTYwMjEyMTgxNDAzWhcNNDEwMjEyMTgxNDAz
+WjB8MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hvdXN0
+b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjExMC8GA1UEAwwoU1NMLmNvbSBS
+b290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IEVDQzB2MBAGByqGSM49AgEGBSuB
+BAAiA2IABEVuqVDEpiM2nl8ojRfLliJkP9x6jh3MCLOicSS6jkm5BBtHllirLZXI
+7Z4INcgn64mMU1jrYor+8FsPazFSY0E7ic3s7LaNGdM0B9y7xgZ/wkWV7Mt/qCPg
+CemB+vNH06NjMGEwHQYDVR0OBBYEFILRhXMw5zUE044CkvvlpNHEIejNMA8GA1Ud
+EwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUgtGFczDnNQTTjgKS++Wk0cQh6M0wDgYD
+VR0PAQH/BAQDAgGGMAoGCCqGSM49BAMCA2cAMGQCMG/n61kRpGDPYbCWe+0F+S8T
+kdzt5fxQaxFGRrMcIQBiu77D5+jNB5n5DQtdcj7EqgIwH7y6C+IwJPt8bYBVCpk+
+gA0z5Wajs6O7pdWLjwkspl1+4vAHCGht0nxpbl/f5Wpl
+-----END CERTIFICATE-----
+
+# Issuer: CN=SSL.com EV Root Certification Authority RSA R2 O=SSL Corporation
+# Subject: CN=SSL.com EV Root Certification Authority RSA R2 O=SSL Corporation
+# Label: "SSL.com EV Root Certification Authority RSA R2"
+# Serial: 6248227494352943350
+# MD5 Fingerprint: e1:1e:31:58:1a:ae:54:53:02:f6:17:6a:11:7b:4d:95
+# SHA1 Fingerprint: 74:3a:f0:52:9b:d0:32:a0:f4:4a:83:cd:d4:ba:a9:7b:7c:2e:c4:9a
+# SHA256 Fingerprint: 2e:7b:f1:6c:c2:24:85:a7:bb:e2:aa:86:96:75:07:61:b0:ae:39:be:3b:2f:e9:d0:cc:6d:4e:f7:34:91:42:5c
+-----BEGIN CERTIFICATE-----
+MIIF6zCCA9OgAwIBAgIIVrYpzTS8ePYwDQYJKoZIhvcNAQELBQAwgYIxCzAJBgNV
+BAYTAlVTMQ4wDAYDVQQIDAVUZXhhczEQMA4GA1UEBwwHSG91c3RvbjEYMBYGA1UE
+CgwPU1NMIENvcnBvcmF0aW9uMTcwNQYDVQQDDC5TU0wuY29tIEVWIFJvb3QgQ2Vy
+dGlmaWNhdGlvbiBBdXRob3JpdHkgUlNBIFIyMB4XDTE3MDUzMTE4MTQzN1oXDTQy
+MDUzMDE4MTQzN1owgYIxCzAJBgNVBAYTAlVTMQ4wDAYDVQQIDAVUZXhhczEQMA4G
+A1UEBwwHSG91c3RvbjEYMBYGA1UECgwPU1NMIENvcnBvcmF0aW9uMTcwNQYDVQQD
+DC5TU0wuY29tIEVWIFJvb3QgQ2VydGlmaWNhdGlvbiBBdXRob3JpdHkgUlNBIFIy
+MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAjzZlQOHWTcDXtOlG2mvq
+M0fNTPl9fb69LT3w23jhhqXZuglXaO1XPqDQCEGD5yhBJB/jchXQARr7XnAjssuf
+OePPxU7Gkm0mxnu7s9onnQqG6YE3Bf7wcXHswxzpY6IXFJ3vG2fThVUCAtZJycxa
+4bH3bzKfydQ7iEGonL3Lq9ttewkfokxykNorCPzPPFTOZw+oz12WGQvE43LrrdF9
+HSfvkusQv1vrO6/PgN3B0pYEW3p+pKk8OHakYo6gOV7qd89dAFmPZiw+B6KjBSYR
+aZfqhbcPlgtLyEDhULouisv3D5oi53+aNxPN8k0TayHRwMwi8qFG9kRpnMphNQcA
+b9ZhCBHqurj26bNg5U257J8UZslXWNvNh2n4ioYSA0e/ZhN2rHd9NCSFg83XqpyQ
+Gp8hLH94t2S42Oim9HizVcuE0jLEeK6jj2HdzghTreyI/BXkmg3mnxp3zkyPuBQV
+PWKchjgGAGYS5Fl2WlPAApiiECtoRHuOec4zSnaqW4EWG7WK2NAAe15itAnWhmMO
+pgWVSbooi4iTsjQc2KRVbrcc0N6ZVTsj9CLg+SlmJuwgUHfbSguPvuUCYHBBXtSu
+UDkiFCbLsjtzdFVHB3mBOagwE0TlBIqulhMlQg+5U8Sb/M3kHN48+qvWBkofZ6aY
+MBzdLNvcGJVXZsb/XItW9XcCAwEAAaNjMGEwDwYDVR0TAQH/BAUwAwEB/zAfBgNV
+HSMEGDAWgBT5YLvU49U09rj1BoAlp3PbRmmonjAdBgNVHQ4EFgQU+WC71OPVNPa4
+9QaAJadz20ZpqJ4wDgYDVR0PAQH/BAQDAgGGMA0GCSqGSIb3DQEBCwUAA4ICAQBW
+s47LCp1Jjr+kxJG7ZhcFUZh1++VQLHqe8RT6q9OKPv+RKY9ji9i0qVQBDb6Thi/5
+Sm3HXvVX+cpVHBK+Rw82xd9qt9t1wkclf7nxY/hoLVUE0fKNsKTPvDxeH3jnpaAg
+cLAExbf3cqfeIg29MyVGjGSSJuM+LmOW2puMPfgYCdcDzH2GguDKBAdRUNf/ktUM
+79qGn5nX67evaOI5JpS6aLe/g9Pqemc9YmeuJeVy6OLk7K4S9ksrPJ/psEDzOFSz
+/bdoyNrGj1E8svuR3Bznm53htw1yj+KkxKl4+esUrMZDBcJlOSgYAsOCsp0FvmXt
+ll9ldDz7CTUue5wT/RsPXcdtgTpWD8w74a8CLyKsRspGPKAcTNZEtF4uXBVmCeEm
+Kf7GUmG6sXP/wwyc5WxqlD8UykAWlYTzWamsX0xhk23RO8yilQwipmdnRC652dKK
+QbNmC1r7fSOl8hqw/96bg5Qu0T/fkreRrwU7ZcegbLHNYhLDkBvjJc40vG93drEQ
+w/cFGsDWr3RiSBd3kmmQYRzelYB0VI8YHMPzA9C/pEN1hlMYegouCRw2n5H9gooi
+S9EOUCXdywMMF8mDAAhONU2Ki+3wApRmLER/y5UnlhetCTCstnEXbosX9hwJ1C07
+mKVx01QT2WDz9UtmT/rx7iASjbSsV7FFY6GsdqnC+w==
+-----END CERTIFICATE-----
+
+# Issuer: CN=SSL.com EV Root Certification Authority ECC O=SSL Corporation
+# Subject: CN=SSL.com EV Root Certification Authority ECC O=SSL Corporation
+# Label: "SSL.com EV Root Certification Authority ECC"
+# Serial: 3182246526754555285
+# MD5 Fingerprint: 59:53:22:65:83:42:01:54:c0:ce:42:b9:5a:7c:f2:90
+# SHA1 Fingerprint: 4c:dd:51:a3:d1:f5:20:32:14:b0:c6:c5:32:23:03:91:c7:46:42:6d
+# SHA256 Fingerprint: 22:a2:c1:f7:bd:ed:70:4c:c1:e7:01:b5:f4:08:c3:10:88:0f:e9:56:b5:de:2a:4a:44:f9:9c:87:3a:25:a7:c8
+-----BEGIN CERTIFICATE-----
+MIIClDCCAhqgAwIBAgIILCmcWxbtBZUwCgYIKoZIzj0EAwIwfzELMAkGA1UEBhMC
+VVMxDjAMBgNVBAgMBVRleGFzMRAwDgYDVQQHDAdIb3VzdG9uMRgwFgYDVQQKDA9T
+U0wgQ29ycG9yYXRpb24xNDAyBgNVBAMMK1NTTC5jb20gRVYgUm9vdCBDZXJ0aWZp
+Y2F0aW9uIEF1dGhvcml0eSBFQ0MwHhcNMTYwMjEyMTgxNTIzWhcNNDEwMjEyMTgx
+NTIzWjB/MQswCQYDVQQGEwJVUzEOMAwGA1UECAwFVGV4YXMxEDAOBgNVBAcMB0hv
+dXN0b24xGDAWBgNVBAoMD1NTTCBDb3Jwb3JhdGlvbjE0MDIGA1UEAwwrU1NMLmNv
+bSBFViBSb290IENlcnRpZmljYXRpb24gQXV0aG9yaXR5IEVDQzB2MBAGByqGSM49
+AgEGBSuBBAAiA2IABKoSR5CYG/vvw0AHgyBO8TCCogbR8pKGYfL2IWjKAMTH6kMA
+VIbc/R/fALhBYlzccBYy3h+Z1MzFB8gIH2EWB1E9fVwHU+M1OIzfzZ/ZLg1Kthku
+WnBaBu2+8KGwytAJKaNjMGEwHQYDVR0OBBYEFFvKXuXe0oGqzagtZFG22XKbl+ZP
+MA8GA1UdEwEB/wQFMAMBAf8wHwYDVR0jBBgwFoAUW8pe5d7SgarNqC1kUbbZcpuX
+5k8wDgYDVR0PAQH/BAQDAgGGMAoGCCqGSM49BAMCA2gAMGUCMQCK5kCJN+vp1RPZ
+ytRrJPOwPYdGWBrssd9v+1a6cGvHOMzosYxPD/fxZ3YOg9AeUY8CMD32IygmTMZg
+h5Mmm7I1HrrW9zzRHM76JTymGoEVW/MSD2zuZYrJh6j5B+BimoxcSg==
+-----END CERTIFICATE-----
+
+# Issuer: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R6
+# Subject: CN=GlobalSign O=GlobalSign OU=GlobalSign Root CA - R6
+# Label: "GlobalSign Root CA - R6"
+# Serial: 1417766617973444989252670301619537
+# MD5 Fingerprint: 4f:dd:07:e4:d4:22:64:39:1e:0c:37:42:ea:d1:c6:ae
+# SHA1 Fingerprint: 80:94:64:0e:b5:a7:a1:ca:11:9c:1f:dd:d5:9f:81:02:63:a7:fb:d1
+# SHA256 Fingerprint: 2c:ab:ea:fe:37:d0:6c:a2:2a:ba:73:91:c0:03:3d:25:98:29:52:c4:53:64:73:49:76:3a:3a:b5:ad:6c:cf:69
+-----BEGIN CERTIFICATE-----
+MIIFgzCCA2ugAwIBAgIORea7A4Mzw4VlSOb/RVEwDQYJKoZIhvcNAQEMBQAwTDEg
+MB4GA1UECxMXR2xvYmFsU2lnbiBSb290IENBIC0gUjYxEzARBgNVBAoTCkdsb2Jh
+bFNpZ24xEzARBgNVBAMTCkdsb2JhbFNpZ24wHhcNMTQxMjEwMDAwMDAwWhcNMzQx
+MjEwMDAwMDAwWjBMMSAwHgYDVQQLExdHbG9iYWxTaWduIFJvb3QgQ0EgLSBSNjET
+MBEGA1UEChMKR2xvYmFsU2lnbjETMBEGA1UEAxMKR2xvYmFsU2lnbjCCAiIwDQYJ
+KoZIhvcNAQEBBQADggIPADCCAgoCggIBAJUH6HPKZvnsFMp7PPcNCPG0RQssgrRI
+xutbPK6DuEGSMxSkb3/pKszGsIhrxbaJ0cay/xTOURQh7ErdG1rG1ofuTToVBu1k
+ZguSgMpE3nOUTvOniX9PeGMIyBJQbUJmL025eShNUhqKGoC3GYEOfsSKvGRMIRxD
+aNc9PIrFsmbVkJq3MQbFvuJtMgamHvm566qjuL++gmNQ0PAYid/kD3n16qIfKtJw
+LnvnvJO7bVPiSHyMEAc4/2ayd2F+4OqMPKq0pPbzlUoSB239jLKJz9CgYXfIWHSw
+1CM69106yqLbnQneXUQtkPGBzVeS+n68UARjNN9rkxi+azayOeSsJDa38O+2HBNX
+k7besvjihbdzorg1qkXy4J02oW9UivFyVm4uiMVRQkQVlO6jxTiWm05OWgtH8wY2
+SXcwvHE35absIQh1/OZhFj931dmRl4QKbNQCTXTAFO39OfuD8l4UoQSwC+n+7o/h
+bguyCLNhZglqsQY6ZZZZwPA1/cnaKI0aEYdwgQqomnUdnjqGBQCe24DWJfncBZ4n
+WUx2OVvq+aWh2IMP0f/fMBH5hc8zSPXKbWQULHpYT9NLCEnFlWQaYw55PfWzjMpY
+rZxCRXluDocZXFSxZba/jJvcE+kNb7gu3GduyYsRtYQUigAZcIN5kZeR1Bonvzce
+MgfYFGM8KEyvAgMBAAGjYzBhMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTAD
+AQH/MB0GA1UdDgQWBBSubAWjkxPioufi1xzWx/B/yGdToDAfBgNVHSMEGDAWgBSu
+bAWjkxPioufi1xzWx/B/yGdToDANBgkqhkiG9w0BAQwFAAOCAgEAgyXt6NH9lVLN
+nsAEoJFp5lzQhN7craJP6Ed41mWYqVuoPId8AorRbrcWc+ZfwFSY1XS+wc3iEZGt
+Ixg93eFyRJa0lV7Ae46ZeBZDE1ZXs6KzO7V33EByrKPrmzU+sQghoefEQzd5Mr61
+55wsTLxDKZmOMNOsIeDjHfrYBzN2VAAiKrlNIC5waNrlU/yDXNOd8v9EDERm8tLj
+vUYAGm0CuiVdjaExUd1URhxN25mW7xocBFymFe944Hn+Xds+qkxV/ZoVqW/hpvvf
+cDDpw+5CRu3CkwWJ+n1jez/QcYF8AOiYrg54NMMl+68KnyBr3TsTjxKM4kEaSHpz
+oHdpx7Zcf4LIHv5YGygrqGytXm3ABdJ7t+uA/iU3/gKbaKxCXcPu9czc8FB10jZp
+nOZ7BN9uBmm23goJSFmH63sUYHpkqmlD75HHTOwY3WzvUy2MmeFe8nI+z1TIvWfs
+pA9MRf/TuTAjB0yPEL+GltmZWrSZVxykzLsViVO6LAUP5MSeGbEYNNVMnbrt9x+v
+JJUEeKgDu+6B5dpffItKoZB0JaezPkvILFa9x8jvOOJckvB595yEunQtYQEgfn7R
+8k8HWV+LLUNS60YMlOH1Zkd5d9VUWx+tJDfLRVpOoERIyNiwmcUVhAn21klJwGW4
+5hpxbqCo8YLoRT5s1gLXCmeDBVrJpBA=
+-----END CERTIFICATE-----
+
+# Issuer: CN=OISTE WISeKey Global Root GC CA O=WISeKey OU=OISTE Foundation Endorsed
+# Subject: CN=OISTE WISeKey Global Root GC CA O=WISeKey OU=OISTE Foundation Endorsed
+# Label: "OISTE WISeKey Global Root GC CA"
+# Serial: 44084345621038548146064804565436152554
+# MD5 Fingerprint: a9:d6:b9:2d:2f:93:64:f8:a5:69:ca:91:e9:68:07:23
+# SHA1 Fingerprint: e0:11:84:5e:34:de:be:88:81:b9:9c:f6:16:26:d1:96:1f:c3:b9:31
+# SHA256 Fingerprint: 85:60:f9:1c:36:24:da:ba:95:70:b5:fe:a0:db:e3:6f:f1:1a:83:23:be:94:86:85:4f:b3:f3:4a:55:71:19:8d
+-----BEGIN CERTIFICATE-----
+MIICaTCCAe+gAwIBAgIQISpWDK7aDKtARb8roi066jAKBggqhkjOPQQDAzBtMQsw
+CQYDVQQGEwJDSDEQMA4GA1UEChMHV0lTZUtleTEiMCAGA1UECxMZT0lTVEUgRm91
+bmRhdGlvbiBFbmRvcnNlZDEoMCYGA1UEAxMfT0lTVEUgV0lTZUtleSBHbG9iYWwg
+Um9vdCBHQyBDQTAeFw0xNzA1MDkwOTQ4MzRaFw00MjA1MDkwOTU4MzNaMG0xCzAJ
+BgNVBAYTAkNIMRAwDgYDVQQKEwdXSVNlS2V5MSIwIAYDVQQLExlPSVNURSBGb3Vu
+ZGF0aW9uIEVuZG9yc2VkMSgwJgYDVQQDEx9PSVNURSBXSVNlS2V5IEdsb2JhbCBS
+b290IEdDIENBMHYwEAYHKoZIzj0CAQYFK4EEACIDYgAETOlQwMYPchi82PG6s4ni
+eUqjFqdrVCTbUf/q9Akkwwsin8tqJ4KBDdLArzHkdIJuyiXZjHWd8dvQmqJLIX4W
+p2OQ0jnUsYd4XxiWD1AbNTcPasbc2RNNpI6QN+a9WzGRo1QwUjAOBgNVHQ8BAf8E
+BAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNVHQ4EFgQUSIcUrOPDnpBgOtfKie7T
+rYy0UGYwEAYJKwYBBAGCNxUBBAMCAQAwCgYIKoZIzj0EAwMDaAAwZQIwJsdpW9zV
+57LnyAyMjMPdeYwbY9XJUpROTYJKcx6ygISpJcBMWm1JKWB4E+J+SOtkAjEA2zQg
+Mgj/mkkCtojeFK9dbJlxjRo/i9fgojaGHAeCOnZT/cKi7e97sIBPWA9LUzm9
+-----END CERTIFICATE-----
+
+# Issuer: CN=GTS Root R1 O=Google Trust Services LLC
+# Subject: CN=GTS Root R1 O=Google Trust Services LLC
+# Label: "GTS Root R1"
+# Serial: 146587175971765017618439757810265552097
+# MD5 Fingerprint: 82:1a:ef:d4:d2:4a:f2:9f:e2:3d:97:06:14:70:72:85
+# SHA1 Fingerprint: e1:c9:50:e6:ef:22:f8:4c:56:45:72:8b:92:20:60:d7:d5:a7:a3:e8
+# SHA256 Fingerprint: 2a:57:54:71:e3:13:40:bc:21:58:1c:bd:2c:f1:3e:15:84:63:20:3e:ce:94:bc:f9:d3:cc:19:6b:f0:9a:54:72
+-----BEGIN CERTIFICATE-----
+MIIFWjCCA0KgAwIBAgIQbkepxUtHDA3sM9CJuRz04TANBgkqhkiG9w0BAQwFADBH
+MQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExM
+QzEUMBIGA1UEAxMLR1RTIFJvb3QgUjEwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIy
+MDAwMDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNl
+cnZpY2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjEwggIiMA0GCSqGSIb3DQEB
+AQUAA4ICDwAwggIKAoICAQC2EQKLHuOhd5s73L+UPreVp0A8of2C+X0yBoJx9vaM
+f/vo27xqLpeXo4xL+Sv2sfnOhB2x+cWX3u+58qPpvBKJXqeqUqv4IyfLpLGcY9vX
+mX7wCl7raKb0xlpHDU0QM+NOsROjyBhsS+z8CZDfnWQpJSMHobTSPS5g4M/SCYe7
+zUjwTcLCeoiKu7rPWRnWr4+wB7CeMfGCwcDfLqZtbBkOtdh+JhpFAz2weaSUKK0P
+fyblqAj+lug8aJRT7oM6iCsVlgmy4HqMLnXWnOunVmSPlk9orj2XwoSPwLxAwAtc
+vfaHszVsrBhQf4TgTM2S0yDpM7xSma8ytSmzJSq0SPly4cpk9+aCEI3oncKKiPo4
+Zor8Y/kB+Xj9e1x3+naH+uzfsQ55lVe0vSbv1gHR6xYKu44LtcXFilWr06zqkUsp
+zBmkMiVOKvFlRNACzqrOSbTqn3yDsEB750Orp2yjj32JgfpMpf/VjsPOS+C12LOO
+Rc92wO1AK/1TD7Cn1TsNsYqiA94xrcx36m97PtbfkSIS5r762DL8EGMUUXLeXdYW
+k70paDPvOmbsB4om3xPXV2V4J95eSRQAogB/mqghtqmxlbCluQ0WEdrHbEg8QOB+
+DVrNVjzRlwW5y0vtOUucxD/SVRNuJLDWcfr0wbrM7Rv1/oFB2ACYPTrIrnqYNxgF
+lQIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV
+HQ4EFgQU5K8rJnEaK0gnhS9SZizv8IkTcT4wDQYJKoZIhvcNAQEMBQADggIBADiW
+Cu49tJYeX++dnAsznyvgyv3SjgofQXSlfKqE1OXyHuY3UjKcC9FhHb8owbZEKTV1
+d5iyfNm9dKyKaOOpMQkpAWBz40d8U6iQSifvS9efk+eCNs6aaAyC58/UEBZvXw6Z
+XPYfcX3v73svfuo21pdwCxXu11xWajOl40k4DLh9+42FpLFZXvRq4d2h9mREruZR
+gyFmxhE+885H7pwoHyXa/6xmld01D1zvICxi/ZG6qcz8WpyTgYMpl0p8WnK0OdC3
+d8t5/Wk6kjftbjhlRn7pYL15iJdfOBL07q9bgsiG1eGZbYwE8na6SfZu6W0eX6Dv
+J4J2QPim01hcDyxC2kLGe4g0x8HYRZvBPsVhHdljUEn2NIVq4BjFbkerQUIpm/Zg
+DdIx02OYI5NaAIFItO/Nis3Jz5nu2Z6qNuFoS3FJFDYoOj0dzpqPJeaAcWErtXvM
++SUWgeExX6GjfhaknBZqlxi9dnKlC54dNuYvoS++cJEPqOba+MSSQGwlfnuzCdyy
+F62ARPBopY+Udf90WuioAnwMCeKpSwughQtiue+hMZL77/ZRBIls6Kl0obsXs7X9
+SQ98POyDGCBDTtWTurQ0sR8WNh8M5mQ5Fkzc4P4dyKliPUDqysU0ArSuiYgzNdws
+E3PYJ/HQcu51OyLemGhmW/HGY0dVHLqlCFF1pkgl
+-----END CERTIFICATE-----
+
+# Issuer: CN=GTS Root R2 O=Google Trust Services LLC
+# Subject: CN=GTS Root R2 O=Google Trust Services LLC
+# Label: "GTS Root R2"
+# Serial: 146587176055767053814479386953112547951
+# MD5 Fingerprint: 44:ed:9a:0e:a4:09:3b:00:f2:ae:4c:a3:c6:61:b0:8b
+# SHA1 Fingerprint: d2:73:96:2a:2a:5e:39:9f:73:3f:e1:c7:1e:64:3f:03:38:34:fc:4d
+# SHA256 Fingerprint: c4:5d:7b:b0:8e:6d:67:e6:2e:42:35:11:0b:56:4e:5f:78:fd:92:ef:05:8c:84:0a:ea:4e:64:55:d7:58:5c:60
+-----BEGIN CERTIFICATE-----
+MIIFWjCCA0KgAwIBAgIQbkepxlqz5yDFMJo/aFLybzANBgkqhkiG9w0BAQwFADBH
+MQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExM
+QzEUMBIGA1UEAxMLR1RTIFJvb3QgUjIwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIy
+MDAwMDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNl
+cnZpY2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjIwggIiMA0GCSqGSIb3DQEB
+AQUAA4ICDwAwggIKAoICAQDO3v2m++zsFDQ8BwZabFn3GTXd98GdVarTzTukk3Lv
+CvptnfbwhYBboUhSnznFt+4orO/LdmgUud+tAWyZH8QiHZ/+cnfgLFuv5AS/T3Kg
+GjSY6Dlo7JUle3ah5mm5hRm9iYz+re026nO8/4Piy33B0s5Ks40FnotJk9/BW9Bu
+XvAuMC6C/Pq8tBcKSOWIm8Wba96wyrQD8Nr0kLhlZPdcTK3ofmZemde4wj7I0BOd
+re7kRXuJVfeKH2JShBKzwkCX44ofR5GmdFrS+LFjKBC4swm4VndAoiaYecb+3yXu
+PuWgf9RhD1FLPD+M2uFwdNjCaKH5wQzpoeJ/u1U8dgbuak7MkogwTZq9TwtImoS1
+mKPV+3PBV2HdKFZ1E66HjucMUQkQdYhMvI35ezzUIkgfKtzra7tEscszcTJGr61K
+8YzodDqs5xoic4DSMPclQsciOzsSrZYuxsN2B6ogtzVJV+mSSeh2FnIxZyuWfoqj
+x5RWIr9qS34BIbIjMt/kmkRtWVtd9QCgHJvGeJeNkP+byKq0rxFROV7Z+2et1VsR
+nTKaG73VululycslaVNVJ1zgyjbLiGH7HrfQy+4W+9OmTN6SpdTi3/UGVN4unUu0
+kzCqgc7dGtxRcw1PcOnlthYhGXmy5okLdWTK1au8CcEYof/UVKGFPP0UJAOyh9Ok
+twIDAQABo0IwQDAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAdBgNV
+HQ4EFgQUu//KjiOfT5nK2+JopqUVJxce2Q4wDQYJKoZIhvcNAQEMBQADggIBALZp
+8KZ3/p7uC4Gt4cCpx/k1HUCCq+YEtN/L9x0Pg/B+E02NjO7jMyLDOfxA325BS0JT
+vhaI8dI4XsRomRyYUpOM52jtG2pzegVATX9lO9ZY8c6DR2Dj/5epnGB3GFW1fgiT
+z9D2PGcDFWEJ+YF59exTpJ/JjwGLc8R3dtyDovUMSRqodt6Sm2T4syzFJ9MHwAiA
+pJiS4wGWAqoC7o87xdFtCjMwc3i5T1QWvwsHoaRc5svJXISPD+AVdyx+Jn7axEvb
+pxZ3B7DNdehyQtaVhJ2Gg/LkkM0JR9SLA3DaWsYDQvTtN6LwG1BUSw7YhN4ZKJmB
+R64JGz9I0cNv4rBgF/XuIwKl2gBbbZCr7qLpGzvpx0QnRY5rn/WkhLx3+WuXrD5R
+RaIRpsyF7gpo8j5QOHokYh4XIDdtak23CZvJ/KRY9bb7nE4Yu5UC56GtmwfuNmsk
+0jmGwZODUNKBRqhfYlcsu2xkiAhu7xNUX90txGdj08+JN7+dIPT7eoOboB6BAFDC
+5AwiWVIQ7UNWhwD4FFKnHYuTjKJNRn8nxnGbJN7k2oaLDX5rIMHAnuFl2GqjpuiF
+izoHCBy69Y9Vmhh1fuXsgWbRIXOhNUQLgD1bnF5vKheW0YMjiGZt5obicDIvUiLn
+yOd/xCxgXS/Dr55FBcOEArf9LAhST4Ldo/DUhgkC
+-----END CERTIFICATE-----
+
+# Issuer: CN=GTS Root R3 O=Google Trust Services LLC
+# Subject: CN=GTS Root R3 O=Google Trust Services LLC
+# Label: "GTS Root R3"
+# Serial: 146587176140553309517047991083707763997
+# MD5 Fingerprint: 1a:79:5b:6b:04:52:9c:5d:c7:74:33:1b:25:9a:f9:25
+# SHA1 Fingerprint: 30:d4:24:6f:07:ff:db:91:89:8a:0b:e9:49:66:11:eb:8c:5e:46:e5
+# SHA256 Fingerprint: 15:d5:b8:77:46:19:ea:7d:54:ce:1c:a6:d0:b0:c4:03:e0:37:a9:17:f1:31:e8:a0:4e:1e:6b:7a:71:ba:bc:e5
+-----BEGIN CERTIFICATE-----
+MIICDDCCAZGgAwIBAgIQbkepx2ypcyRAiQ8DVd2NHTAKBggqhkjOPQQDAzBHMQsw
+CQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExMQzEU
+MBIGA1UEAxMLR1RTIFJvb3QgUjMwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIyMDAw
+MDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZp
+Y2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjMwdjAQBgcqhkjOPQIBBgUrgQQA
+IgNiAAQfTzOHMymKoYTey8chWEGJ6ladK0uFxh1MJ7x/JlFyb+Kf1qPKzEUURout
+736GjOyxfi//qXGdGIRFBEFVbivqJn+7kAHjSxm65FSWRQmx1WyRRK2EE46ajA2A
+DDL24CejQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MB0GA1Ud
+DgQWBBTB8Sa6oC2uhYHP0/EqEr24Cmf9vDAKBggqhkjOPQQDAwNpADBmAjEAgFuk
+fCPAlaUs3L6JbyO5o91lAFJekazInXJ0glMLfalAvWhgxeG4VDvBNhcl2MG9AjEA
+njWSdIUlUfUk7GRSJFClH9voy8l27OyCbvWFGFPouOOaKaqW04MjyaR7YbPMAuhd
+-----END CERTIFICATE-----
+
+# Issuer: CN=GTS Root R4 O=Google Trust Services LLC
+# Subject: CN=GTS Root R4 O=Google Trust Services LLC
+# Label: "GTS Root R4"
+# Serial: 146587176229350439916519468929765261721
+# MD5 Fingerprint: 5d:b6:6a:c4:60:17:24:6a:1a:99:a8:4b:ee:5e:b4:26
+# SHA1 Fingerprint: 2a:1d:60:27:d9:4a:b1:0a:1c:4d:91:5c:cd:33:a0:cb:3e:2d:54:cb
+# SHA256 Fingerprint: 71:cc:a5:39:1f:9e:79:4b:04:80:25:30:b3:63:e1:21:da:8a:30:43:bb:26:66:2f:ea:4d:ca:7f:c9:51:a4:bd
+-----BEGIN CERTIFICATE-----
+MIICCjCCAZGgAwIBAgIQbkepyIuUtui7OyrYorLBmTAKBggqhkjOPQQDAzBHMQsw
+CQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZpY2VzIExMQzEU
+MBIGA1UEAxMLR1RTIFJvb3QgUjQwHhcNMTYwNjIyMDAwMDAwWhcNMzYwNjIyMDAw
+MDAwWjBHMQswCQYDVQQGEwJVUzEiMCAGA1UEChMZR29vZ2xlIFRydXN0IFNlcnZp
+Y2VzIExMQzEUMBIGA1UEAxMLR1RTIFJvb3QgUjQwdjAQBgcqhkjOPQIBBgUrgQQA
+IgNiAATzdHOnaItgrkO4NcWBMHtLSZ37wWHO5t5GvWvVYRg1rkDdc/eJkTBa6zzu
+hXyiQHY7qca4R9gq55KRanPpsXI5nymfopjTX15YhmUPoYRlBtHci8nHc8iMai/l
+xKvRHYqjQjBAMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMBAf8EBTADAQH/MB0GA1Ud
+DgQWBBSATNbrdP9JNqPV2Py1PsVq8JQdjDAKBggqhkjOPQQDAwNnADBkAjBqUFJ0
+CMRw3J5QdCHojXohw0+WbhXRIjVhLfoIN+4Zba3bssx9BzT1YBkstTTZbyACMANx
+sbqjYAuG7ZoIapVon+Kz4ZNkfF6Tpt95LY2F45TPI11xzPKwTdb+mciUqXWi4w==
+-----END CERTIFICATE-----
+
+# Issuer: CN=UCA Global G2 Root O=UniTrust
+# Subject: CN=UCA Global G2 Root O=UniTrust
+# Label: "UCA Global G2 Root"
+# Serial: 124779693093741543919145257850076631279
+# MD5 Fingerprint: 80:fe:f0:c4:4a:f0:5c:62:32:9f:1c:ba:78:a9:50:f8
+# SHA1 Fingerprint: 28:f9:78:16:19:7a:ff:18:25:18:aa:44:fe:c1:a0:ce:5c:b6:4c:8a
+# SHA256 Fingerprint: 9b:ea:11:c9:76:fe:01:47:64:c1:be:56:a6:f9:14:b5:a5:60:31:7a:bd:99:88:39:33:82:e5:16:1a:a0:49:3c
+-----BEGIN CERTIFICATE-----
+MIIFRjCCAy6gAwIBAgIQXd+x2lqj7V2+WmUgZQOQ7zANBgkqhkiG9w0BAQsFADA9
+MQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxGzAZBgNVBAMMElVDQSBH
+bG9iYWwgRzIgUm9vdDAeFw0xNjAzMTEwMDAwMDBaFw00MDEyMzEwMDAwMDBaMD0x
+CzAJBgNVBAYTAkNOMREwDwYDVQQKDAhVbmlUcnVzdDEbMBkGA1UEAwwSVUNBIEds
+b2JhbCBHMiBSb290MIICIjANBgkqhkiG9w0BAQEFAAOCAg8AMIICCgKCAgEAxeYr
+b3zvJgUno4Ek2m/LAfmZmqkywiKHYUGRO8vDaBsGxUypK8FnFyIdK+35KYmToni9
+kmugow2ifsqTs6bRjDXVdfkX9s9FxeV67HeToI8jrg4aA3++1NDtLnurRiNb/yzm
+VHqUwCoV8MmNsHo7JOHXaOIxPAYzRrZUEaalLyJUKlgNAQLx+hVRZ2zA+te2G3/R
+VogvGjqNO7uCEeBHANBSh6v7hn4PJGtAnTRnvI3HLYZveT6OqTwXS3+wmeOwcWDc
+C/Vkw85DvG1xudLeJ1uK6NjGruFZfc8oLTW4lVYa8bJYS7cSN8h8s+1LgOGN+jIj
+tm+3SJUIsUROhYw6AlQgL9+/V087OpAh18EmNVQg7Mc/R+zvWr9LesGtOxdQXGLY
+D0tK3Cv6brxzks3sx1DoQZbXqX5t2Okdj4q1uViSukqSKwxW/YDrCPBeKW4bHAyv
+j5OJrdu9o54hyokZ7N+1wxrrFv54NkzWbtA+FxyQF2smuvt6L78RHBgOLXMDj6Dl
+NaBa4kx1HXHhOThTeEDMg5PXCp6dW4+K5OXgSORIskfNTip1KnvyIvbJvgmRlld6
+iIis7nCs+dwp4wwcOxJORNanTrAmyPPZGpeRaOrvjUYG0lZFWJo8DA+DuAUlwznP
+O6Q0ibd5Ei9Hxeepl2n8pndntd978XplFeRhVmUCAwEAAaNCMEAwDgYDVR0PAQH/
+BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wHQYDVR0OBBYEFIHEjMz15DD/pQwIX4wV
+ZyF0Ad/fMA0GCSqGSIb3DQEBCwUAA4ICAQATZSL1jiutROTL/7lo5sOASD0Ee/oj
+L3rtNtqyzm325p7lX1iPyzcyochltq44PTUbPrw7tgTQvPlJ9Zv3hcU2tsu8+Mg5
+1eRfB70VVJd0ysrtT7q6ZHafgbiERUlMjW+i67HM0cOU2kTC5uLqGOiiHycFutfl
+1qnN3e92mI0ADs0b+gO3joBYDic/UvuUospeZcnWhNq5NXHzJsBPd+aBJ9J3O5oU
+b3n09tDh05S60FdRvScFDcH9yBIw7m+NESsIndTUv4BFFJqIRNow6rSn4+7vW4LV
+PtateJLbXDzz2K36uGt/xDYotgIVilQsnLAXc47QN6MUPJiVAAwpBVueSUmxX8fj
+y88nZY41F7dXyDDZQVu5FLbowg+UMaeUmMxq67XhJ/UQqAHojhJi6IjMtX9Gl8Cb
+EGY4GjZGXyJoPd/JxhMnq1MGrKI8hgZlb7F+sSlEmqO6SWkoaY/X5V+tBIZkbxqg
+DMUIYs6Ao9Dz7GjevjPHF1t/gMRMTLGmhIrDO7gJzRSBuhjjVFc2/tsvfEehOjPI
++Vg7RE+xygKJBJYoaMVLuCaJu9YzL1DV/pqJuhgyklTGW+Cd+V7lDSKb9triyCGy
+YiGqhkCyLmTTX8jjfhFnRR8F/uOi77Oos/N9j/gMHyIfLXC0uAE0djAA5SN4p1bX
+UB+K+wb1whnw0A==
+-----END CERTIFICATE-----
+
+# Issuer: CN=UCA Extended Validation Root O=UniTrust
+# Subject: CN=UCA Extended Validation Root O=UniTrust
+# Label: "UCA Extended Validation Root"
+# Serial: 106100277556486529736699587978573607008
+# MD5 Fingerprint: a1:f3:5f:43:c6:34:9b:da:bf:8c:7e:05:53:ad:96:e2
+# SHA1 Fingerprint: a3:a1:b0:6f:24:61:23:4a:e3:36:a5:c2:37:fc:a6:ff:dd:f0:d7:3a
+# SHA256 Fingerprint: d4:3a:f9:b3:54:73:75:5c:96:84:fc:06:d7:d8:cb:70:ee:5c:28:e7:73:fb:29:4e:b4:1e:e7:17:22:92:4d:24
+-----BEGIN CERTIFICATE-----
+MIIFWjCCA0KgAwIBAgIQT9Irj/VkyDOeTzRYZiNwYDANBgkqhkiG9w0BAQsFADBH
+MQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxJTAjBgNVBAMMHFVDQSBF
+eHRlbmRlZCBWYWxpZGF0aW9uIFJvb3QwHhcNMTUwMzEzMDAwMDAwWhcNMzgxMjMx
+MDAwMDAwWjBHMQswCQYDVQQGEwJDTjERMA8GA1UECgwIVW5pVHJ1c3QxJTAjBgNV
+BAMMHFVDQSBFeHRlbmRlZCBWYWxpZGF0aW9uIFJvb3QwggIiMA0GCSqGSIb3DQEB
+AQUAA4ICDwAwggIKAoICAQCpCQcoEwKwmeBkqh5DFnpzsZGgdT6o+uM4AHrsiWog
+D4vFsJszA1qGxliG1cGFu0/GnEBNyr7uaZa4rYEwmnySBesFK5pI0Lh2PpbIILvS
+sPGP2KxFRv+qZ2C0d35qHzwaUnoEPQc8hQ2E0B92CvdqFN9y4zR8V05WAT558aop
+O2z6+I9tTcg1367r3CTueUWnhbYFiN6IXSV8l2RnCdm/WhUFhvMJHuxYMjMR83dk
+sHYf5BA1FxvyDrFspCqjc/wJHx4yGVMR59mzLC52LqGj3n5qiAno8geK+LLNEOfi
+c0CTuwjRP+H8C5SzJe98ptfRr5//lpr1kXuYC3fUfugH0mK1lTnj8/FtDw5lhIpj
+VMWAtuCeS31HJqcBCF3RiJ7XwzJE+oJKCmhUfzhTA8ykADNkUVkLo4KRel7sFsLz
+KuZi2irbWWIQJUoqgQtHB0MGcIfS+pMRKXpITeuUx3BNr2fVUbGAIAEBtHoIppB/
+TuDvB0GHr2qlXov7z1CymlSvw4m6WC31MJixNnI5fkkE/SmnTHnkBVfblLkWU41G
+sx2VYVdWf6/wFlthWG82UBEL2KwrlRYaDh8IzTY0ZRBiZtWAXxQgXy0MoHgKaNYs
+1+lvK9JKBZP8nm9rZ/+I8U6laUpSNwXqxhaN0sSZ0YIrO7o1dfdRUVjzyAfd5LQD
+fwIDAQABo0IwQDAdBgNVHQ4EFgQU2XQ65DA9DfcS3H5aBZ8eNJr34RQwDwYDVR0T
+AQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAYYwDQYJKoZIhvcNAQELBQADggIBADaN
+l8xCFWQpN5smLNb7rhVpLGsaGvdftvkHTFnq88nIua7Mui563MD1sC3AO6+fcAUR
+ap8lTwEpcOPlDOHqWnzcSbvBHiqB9RZLcpHIojG5qtr8nR/zXUACE/xOHAbKsxSQ
+VBcZEhrxH9cMaVr2cXj0lH2RC47skFSOvG+hTKv8dGT9cZr4QQehzZHkPJrgmzI5
+c6sq1WnIeJEmMX3ixzDx/BR4dxIOE/TdFpS/S2d7cFOFyrC78zhNLJA5wA3CXWvp
+4uXViI3WLL+rG761KIcSF3Ru/H38j9CHJrAb+7lsq+KePRXBOy5nAliRn+/4Qh8s
+t2j1da3Ptfb/EX3C8CSlrdP6oDyp+l3cpaDvRKS+1ujl5BOWF3sGPjLtx7dCvHaj
+2GU4Kzg1USEODm8uNBNA4StnDG1KQTAYI1oyVZnJF+A83vbsea0rWBmirSwiGpWO
+vpaQXUJXxPkUAzUrHC1RVwinOt4/5Mi0A3PCwSaAuwtCH60NryZy2sy+s6ODWA2C
+xR9GUeOcGMyNm43sSet1UNWMKFnKdDTajAshqx7qG+XH/RU+wBeq+yNuJkbL+vmx
+cmtpzyKEC2IPrNkZAJSidjzULZrtBJ4tBmIQN1IchXIbJ+XMxjHsN+xjWZsLHXbM
+fjKaiJUINlK73nZfdklJrX+9ZSCyycErdhh2n1ax
+-----END CERTIFICATE-----
+
+# Issuer: CN=Certigna Root CA O=Dhimyotis OU=0002 48146308100036
+# Subject: CN=Certigna Root CA O=Dhimyotis OU=0002 48146308100036
+# Label: "Certigna Root CA"
+# Serial: 269714418870597844693661054334862075617
+# MD5 Fingerprint: 0e:5c:30:62:27:eb:5b:bc:d7:ae:62:ba:e9:d5:df:77
+# SHA1 Fingerprint: 2d:0d:52:14:ff:9e:ad:99:24:01:74:20:47:6e:6c:85:27:27:f5:43
+# SHA256 Fingerprint: d4:8d:3d:23:ee:db:50:a4:59:e5:51:97:60:1c:27:77:4b:9d:7b:18:c9:4d:5a:05:95:11:a1:02:50:b9:31:68
+-----BEGIN CERTIFICATE-----
+MIIGWzCCBEOgAwIBAgIRAMrpG4nxVQMNo+ZBbcTjpuEwDQYJKoZIhvcNAQELBQAw
+WjELMAkGA1UEBhMCRlIxEjAQBgNVBAoMCURoaW15b3RpczEcMBoGA1UECwwTMDAw
+MiA0ODE0NjMwODEwMDAzNjEZMBcGA1UEAwwQQ2VydGlnbmEgUm9vdCBDQTAeFw0x
+MzEwMDEwODMyMjdaFw0zMzEwMDEwODMyMjdaMFoxCzAJBgNVBAYTAkZSMRIwEAYD
+VQQKDAlEaGlteW90aXMxHDAaBgNVBAsMEzAwMDIgNDgxNDYzMDgxMDAwMzYxGTAX
+BgNVBAMMEENlcnRpZ25hIFJvb3QgQ0EwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAw
+ggIKAoICAQDNGDllGlmx6mQWDoyUJJV8g9PFOSbcDO8WV43X2KyjQn+Cyu3NW9sO
+ty3tRQgXstmzy9YXUnIo245Onoq2C/mehJpNdt4iKVzSs9IGPjA5qXSjklYcoW9M
+CiBtnyN6tMbaLOQdLNyzKNAT8kxOAkmhVECe5uUFoC2EyP+YbNDrihqECB63aCPu
+I9Vwzm1RaRDuoXrC0SIxwoKF0vJVdlB8JXrJhFwLrN1CTivngqIkicuQstDuI7pm
+TLtipPlTWmR7fJj6o0ieD5Wupxj0auwuA0Wv8HT4Ks16XdG+RCYyKfHx9WzMfgIh
+C59vpD++nVPiz32pLHxYGpfhPTc3GGYo0kDFUYqMwy3OU4gkWGQwFsWq4NYKpkDf
+ePb1BHxpE4S80dGnBs8B92jAqFe7OmGtBIyT46388NtEbVncSVmurJqZNjBBe3Yz
+IoejwpKGbvlw7q6Hh5UbxHq9MfPU0uWZ/75I7HX1eBYdpnDBfzwboZL7z8g81sWT
+Co/1VTp2lc5ZmIoJlXcymoO6LAQ6l73UL77XbJuiyn1tJslV1c/DeVIICZkHJC1k
+JWumIWmbat10TWuXekG9qxf5kBdIjzb5LdXF2+6qhUVB+s06RbFo5jZMm5BX7CO5
+hwjCxAnxl4YqKE3idMDaxIzb3+KhF1nOJFl0Mdp//TBt2dzhauH8XwIDAQABo4IB
+GjCCARYwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYDVR0OBBYE
+FBiHVuBud+4kNTxOc5of1uHieX4rMB8GA1UdIwQYMBaAFBiHVuBud+4kNTxOc5of
+1uHieX4rMEQGA1UdIAQ9MDswOQYEVR0gADAxMC8GCCsGAQUFBwIBFiNodHRwczov
+L3d3d3cuY2VydGlnbmEuZnIvYXV0b3JpdGVzLzBtBgNVHR8EZjBkMC+gLaArhilo
+dHRwOi8vY3JsLmNlcnRpZ25hLmZyL2NlcnRpZ25hcm9vdGNhLmNybDAxoC+gLYYr
+aHR0cDovL2NybC5kaGlteW90aXMuY29tL2NlcnRpZ25hcm9vdGNhLmNybDANBgkq
+hkiG9w0BAQsFAAOCAgEAlLieT/DjlQgi581oQfccVdV8AOItOoldaDgvUSILSo3L
+6btdPrtcPbEo/uRTVRPPoZAbAh1fZkYJMyjhDSSXcNMQH+pkV5a7XdrnxIxPTGRG
+HVyH41neQtGbqH6mid2PHMkwgu07nM3A6RngatgCdTer9zQoKJHyBApPNeNgJgH6
+0BGM+RFq7q89w1DTj18zeTyGqHNFkIwgtnJzFyO+B2XleJINugHA64wcZr+shncB
+lA2c5uk5jR+mUYyZDDl34bSb+hxnV29qao6pK0xXeXpXIs/NX2NGjVxZOob4Mkdi
+o2cNGJHc+6Zr9UhhcyNZjgKnvETq9Emd8VRY+WCv2hikLyhF3HqgiIZd8zvn/yk1
+gPxkQ5Tm4xxvvq0OKmOZK8l+hfZx6AYDlf7ej0gcWtSS6Cvu5zHbugRqh5jnxV/v
+faci9wHYTfmJ0A6aBVmknpjZbyvKcL5kwlWj9Omvw5Ip3IgWJJk8jSaYtlu3zM63
+Nwf9JtmYhST/WSMDmu2dnajkXjjO11INb9I/bbEFa0nOipFGc/T2L/Coc3cOZayh
+jWZSaX5LaAzHHjcng6WMxwLkFM1JAbBzs/3GkDpv0mztO+7skb6iQ12LAEpmJURw
+3kAP+HwV96LOPNdeE4yBFxgX0b3xdxA61GU5wSesVywlVP+i2k+KYTlerj1KjL0=
+-----END CERTIFICATE-----
+
+# Issuer: CN=emSign Root CA - G1 O=eMudhra Technologies Limited OU=emSign PKI
+# Subject: CN=emSign Root CA - G1 O=eMudhra Technologies Limited OU=emSign PKI
+# Label: "emSign Root CA - G1"
+# Serial: 235931866688319308814040
+# MD5 Fingerprint: 9c:42:84:57:dd:cb:0b:a7:2e:95:ad:b6:f3:da:bc:ac
+# SHA1 Fingerprint: 8a:c7:ad:8f:73:ac:4e:c1:b5:75:4d:a5:40:f4:fc:cf:7c:b5:8e:8c
+# SHA256 Fingerprint: 40:f6:af:03:46:a9:9a:a1:cd:1d:55:5a:4e:9c:ce:62:c7:f9:63:46:03:ee:40:66:15:83:3d:c8:c8:d0:03:67
+-----BEGIN CERTIFICATE-----
+MIIDlDCCAnygAwIBAgIKMfXkYgxsWO3W2DANBgkqhkiG9w0BAQsFADBnMQswCQYD
+VQQGEwJJTjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBU
+ZWNobm9sb2dpZXMgTGltaXRlZDEcMBoGA1UEAxMTZW1TaWduIFJvb3QgQ0EgLSBH
+MTAeFw0xODAyMTgxODMwMDBaFw00MzAyMTgxODMwMDBaMGcxCzAJBgNVBAYTAklO
+MRMwEQYDVQQLEwplbVNpZ24gUEtJMSUwIwYDVQQKExxlTXVkaHJhIFRlY2hub2xv
+Z2llcyBMaW1pdGVkMRwwGgYDVQQDExNlbVNpZ24gUm9vdCBDQSAtIEcxMIIBIjAN
+BgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAk0u76WaK7p1b1TST0Bsew+eeuGQz
+f2N4aLTNLnF115sgxk0pvLZoYIr3IZpWNVrzdr3YzZr/k1ZLpVkGoZM0Kd0WNHVO
+8oG0x5ZOrRkVUkr+PHB1cM2vK6sVmjM8qrOLqs1D/fXqcP/tzxE7lM5OMhbTI0Aq
+d7OvPAEsbO2ZLIvZTmmYsvePQbAyeGHWDV/D+qJAkh1cF+ZwPjXnorfCYuKrpDhM
+tTk1b+oDafo6VGiFbdbyL0NVHpENDtjVaqSW0RM8LHhQ6DqS0hdW5TUaQBw+jSzt
+Od9C4INBdN+jzcKGYEho42kLVACL5HZpIQ15TjQIXhTCzLG3rdd8cIrHhQIDAQAB
+o0IwQDAdBgNVHQ4EFgQU++8Nhp6w492pufEhF38+/PB3KxowDgYDVR0PAQH/BAQD
+AgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQELBQADggEBAFn/8oz1h31x
+PaOfG1vR2vjTnGs2vZupYeveFix0PZ7mddrXuqe8QhfnPZHr5X3dPpzxz5KsbEjM
+wiI/aTvFthUvozXGaCocV685743QNcMYDHsAVhzNixl03r4PEuDQqqE/AjSxcM6d
+GNYIAwlG7mDgfrbESQRRfXBgvKqy/3lyeqYdPV8q+Mri/Tm3R7nrft8EI6/6nAYH
+6ftjk4BAtcZsCjEozgyfz7MjNYBBjWzEN3uBL4ChQEKF6dk4jeihU80Bv2noWgby
+RQuQ+q7hv53yrlc8pa6yVvSLZUDp/TGBLPQ5Cdjua6e0ph0VpZj3AYHYhX3zUVxx
+iN66zB+Afko=
+-----END CERTIFICATE-----
+
+# Issuer: CN=emSign ECC Root CA - G3 O=eMudhra Technologies Limited OU=emSign PKI
+# Subject: CN=emSign ECC Root CA - G3 O=eMudhra Technologies Limited OU=emSign PKI
+# Label: "emSign ECC Root CA - G3"
+# Serial: 287880440101571086945156
+# MD5 Fingerprint: ce:0b:72:d1:9f:88:8e:d0:50:03:e8:e3:b8:8b:67:40
+# SHA1 Fingerprint: 30:43:fa:4f:f2:57:dc:a0:c3:80:ee:2e:58:ea:78:b2:3f:e6:bb:c1
+# SHA256 Fingerprint: 86:a1:ec:ba:08:9c:4a:8d:3b:be:27:34:c6:12:ba:34:1d:81:3e:04:3c:f9:e8:a8:62:cd:5c:57:a3:6b:be:6b
+-----BEGIN CERTIFICATE-----
+MIICTjCCAdOgAwIBAgIKPPYHqWhwDtqLhDAKBggqhkjOPQQDAzBrMQswCQYDVQQG
+EwJJTjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBUZWNo
+bm9sb2dpZXMgTGltaXRlZDEgMB4GA1UEAxMXZW1TaWduIEVDQyBSb290IENBIC0g
+RzMwHhcNMTgwMjE4MTgzMDAwWhcNNDMwMjE4MTgzMDAwWjBrMQswCQYDVQQGEwJJ
+TjETMBEGA1UECxMKZW1TaWduIFBLSTElMCMGA1UEChMcZU11ZGhyYSBUZWNobm9s
+b2dpZXMgTGltaXRlZDEgMB4GA1UEAxMXZW1TaWduIEVDQyBSb290IENBIC0gRzMw
+djAQBgcqhkjOPQIBBgUrgQQAIgNiAAQjpQy4LRL1KPOxst3iAhKAnjlfSU2fySU0
+WXTsuwYc58Byr+iuL+FBVIcUqEqy6HyC5ltqtdyzdc6LBtCGI79G1Y4PPwT01xyS
+fvalY8L1X44uT6EYGQIrMgqCZH0Wk9GjQjBAMB0GA1UdDgQWBBR8XQKEE9TMipuB
+zhccLikenEhjQjAOBgNVHQ8BAf8EBAMCAQYwDwYDVR0TAQH/BAUwAwEB/zAKBggq
+hkjOPQQDAwNpADBmAjEAvvNhzwIQHWSVB7gYboiFBS+DCBeQyh+KTOgNG3qxrdWB
+CUfvO6wIBHxcmbHtRwfSAjEAnbpV/KlK6O3t5nYBQnvI+GDZjVGLVTv7jHvrZQnD
++JbNR6iC8hZVdyR+EhCVBCyj
+-----END CERTIFICATE-----
+
+# Issuer: CN=emSign Root CA - C1 O=eMudhra Inc OU=emSign PKI
+# Subject: CN=emSign Root CA - C1 O=eMudhra Inc OU=emSign PKI
+# Label: "emSign Root CA - C1"
+# Serial: 825510296613316004955058
+# MD5 Fingerprint: d8:e3:5d:01:21:fa:78:5a:b0:df:ba:d2:ee:2a:5f:68
+# SHA1 Fingerprint: e7:2e:f1:df:fc:b2:09:28:cf:5d:d4:d5:67:37:b1:51:cb:86:4f:01
+# SHA256 Fingerprint: 12:56:09:aa:30:1d:a0:a2:49:b9:7a:82:39:cb:6a:34:21:6f:44:dc:ac:9f:39:54:b1:42:92:f2:e8:c8:60:8f
+-----BEGIN CERTIFICATE-----
+MIIDczCCAlugAwIBAgILAK7PALrEzzL4Q7IwDQYJKoZIhvcNAQELBQAwVjELMAkG
+A1UEBhMCVVMxEzARBgNVBAsTCmVtU2lnbiBQS0kxFDASBgNVBAoTC2VNdWRocmEg
+SW5jMRwwGgYDVQQDExNlbVNpZ24gUm9vdCBDQSAtIEMxMB4XDTE4MDIxODE4MzAw
+MFoXDTQzMDIxODE4MzAwMFowVjELMAkGA1UEBhMCVVMxEzARBgNVBAsTCmVtU2ln
+biBQS0kxFDASBgNVBAoTC2VNdWRocmEgSW5jMRwwGgYDVQQDExNlbVNpZ24gUm9v
+dCBDQSAtIEMxMIIBIjANBgkqhkiG9w0BAQEFAAOCAQ8AMIIBCgKCAQEAz+upufGZ
+BczYKCFK83M0UYRWEPWgTywS4/oTmifQz/l5GnRfHXk5/Fv4cI7gklL35CX5VIPZ
+HdPIWoU/Xse2B+4+wM6ar6xWQio5JXDWv7V7Nq2s9nPczdcdioOl+yuQFTdrHCZH
+3DspVpNqs8FqOp099cGXOFgFixwR4+S0uF2FHYP+eF8LRWgYSKVGczQ7/g/IdrvH
+GPMF0Ybzhe3nudkyrVWIzqa2kbBPrH4VI5b2P/AgNBbeCsbEBEV5f6f9vtKppa+c
+xSMq9zwhbL2vj07FOrLzNBL834AaSaTUqZX3noleoomslMuoaJuvimUnzYnu3Yy1
+aylwQ6BpC+S5DwIDAQABo0IwQDAdBgNVHQ4EFgQU/qHgcB4qAzlSWkK+XJGFehiq
+TbUwDgYDVR0PAQH/BAQDAgEGMA8GA1UdEwEB/wQFMAMBAf8wDQYJKoZIhvcNAQEL
+BQADggEBAMJKVvoVIXsoounlHfv4LcQ5lkFMOycsxGwYFYDGrK9HWS8mC+M2sO87
+/kOXSTKZEhVb3xEp/6tT+LvBeA+snFOvV71ojD1pM/CjoCNjO2RnIkSt1XHLVip4
+kqNPEjE2NuLe/gDEo2APJ62gsIq1NnpSob0n9CAnYuhNlCQT5AoE6TyrLshDCUrG
+YQTlSTR+08TI9Q/Aqum6VF7zYytPT1DU/rl7mYw9wC68AivTxEDkigcxHpvOJpkT
++xHqmiIMERnHXhuBUDDIlhJu58tBf5E7oke3VIAb3ADMmpDqw8NQBmIMMMAVSKeo
+WXzhriKi4gp6D/piq1JM4fHfyr6DDUI=
+-----END CERTIFICATE-----
+
+# Issuer: CN=emSign ECC Root CA - C3 O=eMudhra Inc OU=emSign PKI
+# Subject: CN=emSign ECC Root CA - C3 O=eMudhra Inc OU=emSign PKI
+# Label: "emSign ECC Root CA - C3"
+# Serial: 582948710642506000014504
+# MD5 Fingerprint: 3e:53:b3:a3:81:ee:d7:10:f8:d3:b0:1d:17:92:f5:d5
+# SHA1 Fingerprint: b6:af:43:c2:9b:81:53:7d:f6:ef:6b:c3:1f:1f:60:15:0c:ee:48:66
+# SHA256 Fingerprint: bc:4d:80:9b:15:18:9d:78:db:3e:1d:8c:f4:f9:72:6a:79:5d:a1:64:3c:a5:f1:35:8e:1d:db:0e:dc:0d:7e:b3
+-----BEGIN CERTIFICATE-----
+MIICKzCCAbGgAwIBAgIKe3G2gla4EnycqDAKBggqhkjOPQQDAzBaMQswCQYDVQQG
+EwJVUzETMBEGA1UECxMKZW1TaWduIFBLSTEUMBIGA1UEChMLZU11ZGhyYSBJbmMx
+IDAeBgNVBAMTF2VtU2lnbiBFQ0MgUm9vdCBDQSAtIEMzMB4XDTE4MDIxODE4MzAw
+MFoXDTQzMDIxODE4MzAwMFowWjELMAkGA1UEBhMCVVMxEzARBgNVBAsTCmVtU2ln
+biBQS0kxFDASBgNVBAoTC2VNdWRocmEgSW5jMSAwHgYDVQQDExdlbVNpZ24gRUND
+IFJvb3QgQ0EgLSBDMzB2MBAGByqGSM49AgEGBSuBBAAiA2IABP2lYa57JhAd6bci
+MK4G9IGzsUJxlTm801Ljr6/58pc1kjZGDoeVjbk5Wum739D+yAdBPLtVb4Ojavti
+sIGJAnB9SMVK4+kiVCJNk7tCDK93nCOmfddhEc5lx/h//vXyqaNCMEAwHQYDVR0O
+BBYEFPtaSNCAIEDyqOkAB2kZd6fmw/TPMA4GA1UdDwEB/wQEAwIBBjAPBgNVHRMB
+Af8EBTADAQH/MAoGCCqGSM49BAMDA2gAMGUCMQC02C8Cif22TGK6Q04ThHK1rt0c
+3ta13FaPWEBaLd4gTCKDypOofu4SQMfWh0/434UCMBwUZOR8loMRnLDRWmFLpg9J
+0wD8ofzkpf9/rdcw0Md3f76BB1UwUCAU9Vc4CqgxUQ==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Hongkong Post Root CA 3 O=Hongkong Post
+# Subject: CN=Hongkong Post Root CA 3 O=Hongkong Post
+# Label: "Hongkong Post Root CA 3"
+# Serial: 46170865288971385588281144162979347873371282084
+# MD5 Fingerprint: 11:fc:9f:bd:73:30:02:8a:fd:3f:f3:58:b9:cb:20:f0
+# SHA1 Fingerprint: 58:a2:d0:ec:20:52:81:5b:c1:f3:f8:64:02:24:4e:c2:8e:02:4b:02
+# SHA256 Fingerprint: 5a:2f:c0:3f:0c:83:b0:90:bb:fa:40:60:4b:09:88:44:6c:76:36:18:3d:f9:84:6e:17:10:1a:44:7f:b8:ef:d6
+-----BEGIN CERTIFICATE-----
+MIIFzzCCA7egAwIBAgIUCBZfikyl7ADJk0DfxMauI7gcWqQwDQYJKoZIhvcNAQEL
+BQAwbzELMAkGA1UEBhMCSEsxEjAQBgNVBAgTCUhvbmcgS29uZzESMBAGA1UEBxMJ
+SG9uZyBLb25nMRYwFAYDVQQKEw1Ib25na29uZyBQb3N0MSAwHgYDVQQDExdIb25n
+a29uZyBQb3N0IFJvb3QgQ0EgMzAeFw0xNzA2MDMwMjI5NDZaFw00MjA2MDMwMjI5
+NDZaMG8xCzAJBgNVBAYTAkhLMRIwEAYDVQQIEwlIb25nIEtvbmcxEjAQBgNVBAcT
+CUhvbmcgS29uZzEWMBQGA1UEChMNSG9uZ2tvbmcgUG9zdDEgMB4GA1UEAxMXSG9u
+Z2tvbmcgUG9zdCBSb290IENBIDMwggIiMA0GCSqGSIb3DQEBAQUAA4ICDwAwggIK
+AoICAQCziNfqzg8gTr7m1gNt7ln8wlffKWihgw4+aMdoWJwcYEuJQwy51BWy7sFO
+dem1p+/l6TWZ5Mwc50tfjTMwIDNT2aa71T4Tjukfh0mtUC1Qyhi+AViiE3CWu4mI
+VoBc+L0sPOFMV4i707mV78vH9toxdCim5lSJ9UExyuUmGs2C4HDaOym71QP1mbpV
+9WTRYA6ziUm4ii8F0oRFKHyPaFASePwLtVPLwpgchKOesL4jpNrcyCse2m5FHomY
+2vkALgbpDDtw1VAliJnLzXNg99X/NWfFobxeq81KuEXryGgeDQ0URhLj0mRiikKY
+vLTGCAj4/ahMZJx2Ab0vqWwzD9g/KLg8aQFChn5pwckGyuV6RmXpwtZQQS4/t+Tt
+bNe/JgERohYpSms0BpDsE9K2+2p20jzt8NYt3eEV7KObLyzJPivkaTv/ciWxNoZb
+x39ri1UbSsUgYT2uy1DhCDq+sI9jQVMwCFk8mB13umOResoQUGC/8Ne8lYePl8X+
+l2oBlKN8W4UdKjk60FSh0Tlxnf0h+bV78OLgAo9uliQlLKAeLKjEiafv7ZkGL7YK
+TE/bosw3Gq9HhS2KX8Q0NEwA/RiTZxPRN+ZItIsGxVd7GYYKecsAyVKvQv83j+Gj
+Hno9UKtjBucVtT+2RTeUN7F+8kjDf8V1/peNRY8apxpyKBpADwIDAQABo2MwYTAP
+BgNVHRMBAf8EBTADAQH/MA4GA1UdDwEB/wQEAwIBBjAfBgNVHSMEGDAWgBQXnc0e
+i9Y5K3DTXNSguB+wAPzFYTAdBgNVHQ4EFgQUF53NHovWOStw01zUoLgfsAD8xWEw
+DQYJKoZIhvcNAQELBQADggIBAFbVe27mIgHSQpsY1Q7XZiNc4/6gx5LS6ZStS6LG
+7BJ8dNVI0lkUmcDrudHr9EgwW62nV3OZqdPlt9EuWSRY3GguLmLYauRwCy0gUCCk
+MpXRAJi70/33MvJJrsZ64Ee+bs7Lo3I6LWldy8joRTnU+kLBEUx3XZL7av9YROXr
+gZ6voJmtvqkBZss4HTzfQx/0TW60uhdG/H39h4F5ag0zD/ov+BS5gLNdTaqX4fnk
+GMX41TiMJjz98iji7lpJiCzfeT2OnpA8vUFKOt1b9pq0zj8lMH8yfaIDlNDceqFS
+3m6TjRgm/VWsvY+b0s+v54Ysyx8Jb6NvqYTUc79NoXQbTiNg8swOqn+knEwlqLJm
+Ozj/2ZQw9nKEvmhVEA/GcywWaZMH/rFF7buiVWqw2rVKAiUnhde3t4ZEFolsgCs+
+l6mc1X5VTMbeRRAc6uk7nwNT7u56AQIWeNTowr5GdogTPyK7SBIdUgC0An4hGh6c
+JfTzPV4e0hz5sy229zdcxsshTrD3mUcYhcErulWuBurQB7Lcq9CClnXO0lD+mefP
+L5/ndtFhKvshuzHQqp9HpLIiyhY6UFfEW0NnxWViA0kB60PZ2Pierc+xYw5F9KBa
+LJstxabArahH9CdMOA0uG0k7UvToiIMrVCjU8jVStDKDYmlkDJGcn5fqdBb9HxEG
+mpv0
+-----END CERTIFICATE-----
+
+# Issuer: CN=Entrust Root Certification Authority - G4 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2015 Entrust, Inc. - for authorized use only
+# Subject: CN=Entrust Root Certification Authority - G4 O=Entrust, Inc. OU=See www.entrust.net/legal-terms/(c) 2015 Entrust, Inc. - for authorized use only
+# Label: "Entrust Root Certification Authority - G4"
+# Serial: 289383649854506086828220374796556676440
+# MD5 Fingerprint: 89:53:f1:83:23:b7:7c:8e:05:f1:8c:71:38:4e:1f:88
+# SHA1 Fingerprint: 14:88:4e:86:26:37:b0:26:af:59:62:5c:40:77:ec:35:29:ba:96:01
+# SHA256 Fingerprint: db:35:17:d1:f6:73:2a:2d:5a:b9:7c:53:3e:c7:07:79:ee:32:70:a6:2f:b4:ac:42:38:37:24:60:e6:f0:1e:88
+-----BEGIN CERTIFICATE-----
+MIIGSzCCBDOgAwIBAgIRANm1Q3+vqTkPAAAAAFVlrVgwDQYJKoZIhvcNAQELBQAw
+gb4xCzAJBgNVBAYTAlVTMRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQL
+Ex9TZWUgd3d3LmVudHJ1c3QubmV0L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykg
+MjAxNSBFbnRydXN0LCBJbmMuIC0gZm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMjAw
+BgNVBAMTKUVudHJ1c3QgUm9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEc0
+MB4XDTE1MDUyNzExMTExNloXDTM3MTIyNzExNDExNlowgb4xCzAJBgNVBAYTAlVT
+MRYwFAYDVQQKEw1FbnRydXN0LCBJbmMuMSgwJgYDVQQLEx9TZWUgd3d3LmVudHJ1
+c3QubmV0L2xlZ2FsLXRlcm1zMTkwNwYDVQQLEzAoYykgMjAxNSBFbnRydXN0LCBJ
+bmMuIC0gZm9yIGF1dGhvcml6ZWQgdXNlIG9ubHkxMjAwBgNVBAMTKUVudHJ1c3Qg
+Um9vdCBDZXJ0aWZpY2F0aW9uIEF1dGhvcml0eSAtIEc0MIICIjANBgkqhkiG9w0B
+AQEFAAOCAg8AMIICCgKCAgEAsewsQu7i0TD/pZJH4i3DumSXbcr3DbVZwbPLqGgZ
+2K+EbTBwXX7zLtJTmeH+H17ZSK9dE43b/2MzTdMAArzE+NEGCJR5WIoV3imz/f3E
+T+iq4qA7ec2/a0My3dl0ELn39GjUu9CH1apLiipvKgS1sqbHoHrmSKvS0VnM1n4j
+5pds8ELl3FFLFUHtSUrJ3hCX1nbB76W1NhSXNdh4IjVS70O92yfbYVaCNNzLiGAM
+C1rlLAHGVK/XqsEQe9IFWrhAnoanw5CGAlZSCXqc0ieCU0plUmr1POeo8pyvi73T
+DtTUXm6Hnmo9RR3RXRv06QqsYJn7ibT/mCzPfB3pAqoEmh643IhuJbNsZvc8kPNX
+wbMv9W3y+8qh+CmdRouzavbmZwe+LGcKKh9asj5XxNMhIWNlUpEbsZmOeX7m640A
+2Vqq6nPopIICR5b+W45UYaPrL0swsIsjdXJ8ITzI9vF01Bx7owVV7rtNOzK+mndm
+nqxpkCIHH2E6lr7lmk/MBTwoWdPBDFSoWWG9yHJM6Nyfh3+9nEg2XpWjDrk4JFX8
+dWbrAuMINClKxuMrLzOg2qOGpRKX/YAr2hRC45K9PvJdXmd0LhyIRyk0X+IyqJwl
+N4y6mACXi0mWHv0liqzc2thddG5msP9E36EYxr5ILzeUePiVSj9/E15dWf10hkNj
+c0kCAwEAAaNCMEAwDwYDVR0TAQH/BAUwAwEB/zAOBgNVHQ8BAf8EBAMCAQYwHQYD
+VR0OBBYEFJ84xFYjwznooHFs6FRM5Og6sb9nMA0GCSqGSIb3DQEBCwUAA4ICAQAS
+5UKme4sPDORGpbZgQIeMJX6tuGguW8ZAdjwD+MlZ9POrYs4QjbRaZIxowLByQzTS
+Gwv2LFPSypBLhmb8qoMi9IsabyZIrHZ3CL/FmFz0Jomee8O5ZDIBf9PD3Vht7LGr
+hFV0d4QEJ1JrhkzO3bll/9bGXp+aEJlLdWr+aumXIOTkdnrG0CSqkM0gkLpHZPt/
+B7NTeLUKYvJzQ85BK4FqLoUWlFPUa19yIqtRLULVAJyZv967lDtX/Zr1hstWO1uI
+AeV8KEsD+UmDfLJ/fOPtjqF/YFOOVZ1QNBIPt5d7bIdKROf1beyAN/BYGW5KaHbw
+H5Lk6rWS02FREAutp9lfx1/cH6NcjKF+m7ee01ZvZl4HliDtC3T7Zk6LERXpgUl+
+b7DUUH8i119lAg2m9IUe2K4GS0qn0jFmwvjO5QimpAKWRGhXxNUzzxkvFMSUHHuk
+2fCfDrGA4tGeEWSpiBE6doLlYsKA2KSD7ZPvfC+QsDJMlhVoSFLUmQjAJOgc47Ol
+IQ6SwJAfzyBfyjs4x7dtOvPmRLgOMWuIjnDrnBdSqEGULoe256YSxXXfW8AKbnuk
+5F6G+TaU33fD6Q3AOfF5u0aOq0NZJ7cguyPpVkAh7DE9ZapD8j3fcEThuk0mEDuY
+n/PIjhs4ViFqUZPTkcpG2om3PVODLAgfi49T3f+sHw==
+-----END CERTIFICATE-----
+
+# Issuer: CN=Microsoft ECC Root Certificate Authority 2017 O=Microsoft Corporation
+# Subject: CN=Microsoft ECC Root Certificate Authority 2017 O=Microsoft Corporation
+# Label: "Microsoft ECC Root Certificate Authority 2017"
+# Serial: 136839042543790627607696632466672567020
+# MD5 Fingerprint: dd:a1:03:e6:4a:93:10:d1:bf:f0:19:42:cb:fe:ed:67
+# SHA1 Fingerprint: 99:9a:64:c3:7f:f4:7d:9f:ab:95:f1:47:69:89:14:60:ee:c4:c3:c5
+# SHA256 Fingerprint: 35:8d:f3:9d:76:4a:f9:e1:b7:66:e9:c9:72:df:35:2e:e1:5c:fa:c2:27:af:6a:d1:d7:0e:8e:4a:6e:dc:ba:02
+-----BEGIN CERTIFICATE-----
+MIICWTCCAd+gAwIBAgIQZvI9r4fei7FK6gxXMQHC7DAKBggqhkjOPQQDAzBlMQsw
+CQYDVQQGEwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYD
+VQQDEy1NaWNyb3NvZnQgRUNDIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIw
+MTcwHhcNMTkxMjE4MjMwNjQ1WhcNNDIwNzE4MjMxNjA0WjBlMQswCQYDVQQGEwJV
+UzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYDVQQDEy1NaWNy
+b3NvZnQgRUNDIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIwMTcwdjAQBgcq
+hkjOPQIBBgUrgQQAIgNiAATUvD0CQnVBEyPNgASGAlEvaqiBYgtlzPbKnR5vSmZR
+ogPZnZH6thaxjG7efM3beaYvzrvOcS/lpaso7GMEZpn4+vKTEAXhgShC48Zo9OYb
+hGBKia/teQ87zvH2RPUBeMCjVDBSMA4GA1UdDwEB/wQEAwIBhjAPBgNVHRMBAf8E
+BTADAQH/MB0GA1UdDgQWBBTIy5lycFIM+Oa+sgRXKSrPQhDtNTAQBgkrBgEEAYI3
+FQEEAwIBADAKBggqhkjOPQQDAwNoADBlAjBY8k3qDPlfXu5gKcs68tvWMoQZP3zV
+L8KxzJOuULsJMsbG7X7JNpQS5GiFBqIb0C8CMQCZ6Ra0DvpWSNSkMBaReNtUjGUB
+iudQZsIxtzm6uBoiB078a1QWIP8rtedMDE2mT3M=
+-----END CERTIFICATE-----
+
+# Issuer: CN=Microsoft RSA Root Certificate Authority 2017 O=Microsoft Corporation
+# Subject: CN=Microsoft RSA Root Certificate Authority 2017 O=Microsoft Corporation
+# Label: "Microsoft RSA Root Certificate Authority 2017"
+# Serial: 40975477897264996090493496164228220339
+# MD5 Fingerprint: 10:ff:00:ff:cf:c9:f8:c7:7a:c0:ee:35:8e:c9:0f:47
+# SHA1 Fingerprint: 73:a5:e6:4a:3b:ff:83:16:ff:0e:dc:cc:61:8a:90:6e:4e:ae:4d:74
+# SHA256 Fingerprint: c7:41:f7:0f:4b:2a:8d:88:bf:2e:71:c1:41:22:ef:53:ef:10:eb:a0:cf:a5:e6:4c:fa:20:f4:18:85:30:73:e0
+-----BEGIN CERTIFICATE-----
+MIIFqDCCA5CgAwIBAgIQHtOXCV/YtLNHcB6qvn9FszANBgkqhkiG9w0BAQwFADBl
+MQswCQYDVQQGEwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYw
+NAYDVQQDEy1NaWNyb3NvZnQgUlNBIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5
+IDIwMTcwHhcNMTkxMjE4MjI1MTIyWhcNNDIwNzE4MjMwMDIzWjBlMQswCQYDVQQG
+EwJVUzEeMBwGA1UEChMVTWljcm9zb2Z0IENvcnBvcmF0aW9uMTYwNAYDVQQDEy1N
+aWNyb3NvZnQgUlNBIFJvb3QgQ2VydGlmaWNhdGUgQXV0aG9yaXR5IDIwMTcwggIi
+MA0GCSqGSIb3DQEBAQUAA4ICDwAwggIKAoICAQDKW76UM4wplZEWCpW9R2LBifOZ
+Nt9GkMml7Xhqb0eRaPgnZ1AzHaGm++DlQ6OEAlcBXZxIQIJTELy/xztokLaCLeX0
+ZdDMbRnMlfl7rEqUrQ7eS0MdhweSE5CAg2Q1OQT85elss7YfUJQ4ZVBcF0a5toW1
+HLUX6NZFndiyJrDKxHBKrmCk3bPZ7Pw71VdyvD/IybLeS2v4I2wDwAW9lcfNcztm
+gGTjGqwu+UcF8ga2m3P1eDNbx6H7JyqhtJqRjJHTOoI+dkC0zVJhUXAoP8XFWvLJ
+jEm7FFtNyP9nTUwSlq31/niol4fX/V4ggNyhSyL71Imtus5Hl0dVe49FyGcohJUc
+aDDv70ngNXtk55iwlNpNhTs+VcQor1fznhPbRiefHqJeRIOkpcrVE7NLP8TjwuaG
+YaRSMLl6IE9vDzhTyzMMEyuP1pq9KsgtsRx9S1HKR9FIJ3Jdh+vVReZIZZ2vUpC6
+W6IYZVcSn2i51BVrlMRpIpj0M+Dt+VGOQVDJNE92kKz8OMHY4Xu54+OU4UZpyw4K
+UGsTuqwPN1q3ErWQgR5WrlcihtnJ0tHXUeOrO8ZV/R4O03QK0dqq6mm4lyiPSMQH
++FJDOvTKVTUssKZqwJz58oHhEmrARdlns87/I6KJClTUFLkqqNfs+avNJVgyeY+Q
+W5g5xAgGwax/Dj0ApQIDAQABo1QwUjAOBgNVHQ8BAf8EBAMCAYYwDwYDVR0TAQH/
+BAUwAwEB/zAdBgNVHQ4EFgQUCctZf4aycI8awznjwNnpv7tNsiMwEAYJKwYBBAGC
+NxUBBAMCAQAwDQYJKoZIhvcNAQEMBQADggIBAKyvPl3CEZaJjqPnktaXFbgToqZC
+LgLNFgVZJ8og6Lq46BrsTaiXVq5lQ7GPAJtSzVXNUzltYkyLDVt8LkS/gxCP81OC
+gMNPOsduET/m4xaRhPtthH80dK2Jp86519efhGSSvpWhrQlTM93uCupKUY5vVau6
+tZRGrox/2KJQJWVggEbbMwSubLWYdFQl3JPk+ONVFT24bcMKpBLBaYVu32TxU5nh
+SnUgnZUP5NbcA/FZGOhHibJXWpS2qdgXKxdJ5XbLwVaZOjex/2kskZGT4d9Mozd2
+TaGf+G0eHdP67Pv0RR0Tbc/3WeUiJ3IrhvNXuzDtJE3cfVa7o7P4NHmJweDyAmH3
+pvwPuxwXC65B2Xy9J6P9LjrRk5Sxcx0ki69bIImtt2dmefU6xqaWM/5TkshGsRGR
+xpl/j8nWZjEgQRCHLQzWwa80mMpkg/sTV9HB8Dx6jKXB/ZUhoHHBk2dxEuqPiApp
+GWSZI1b7rCoucL5mxAyE7+WL85MB+GqQk2dLsmijtWKP6T+MejteD+eMuMZ87zf9
+dOLITzNy4ZQ5bb0Sr74MTnB8G2+NszKTc0QWbej09+CVgI+WXTik9KveCjCHk9hN
+AHFiRSdLOkKEW39lt2c0Ui2cFmuqqNh7o0JMcccMyj6D5KbvtwEwXlGjefVwaaZB
+RA+GsCyRxj3qrg+E
+-----END CERTIFICATE-----
+
+# Issuer: CN=e-Szigno Root CA 2017 O=Microsec Ltd.
+# Subject: CN=e-Szigno Root CA 2017 O=Microsec Ltd.
+# Label: "e-Szigno Root CA 2017"
+# Serial: 411379200276854331539784714
+# MD5 Fingerprint: de:1f:f6:9e:84:ae:a7:b4:21:ce:1e:58:7d:d1:84:98
+# SHA1 Fingerprint: 89:d4:83:03:4f:9e:9a:48:80:5f:72:37:d4:a9:a6:ef:cb:7c:1f:d1
+# SHA256 Fingerprint: be:b0:0b:30:83:9b:9b:c3:2c:32:e4:44:79:05:95:06:41:f2:64:21:b1:5e:d0:89:19:8b:51:8a:e2:ea:1b:99
+-----BEGIN CERTIFICATE-----
+MIICQDCCAeWgAwIBAgIMAVRI7yH9l1kN9QQKMAoGCCqGSM49BAMCMHExCzAJBgNV
+BAYTAkhVMREwDwYDVQQHDAhCdWRhcGVzdDEWMBQGA1UECgwNTWljcm9zZWMgTHRk
+LjEXMBUGA1UEYQwOVkFUSFUtMjM1ODQ0OTcxHjAcBgNVBAMMFWUtU3ppZ25vIFJv
+b3QgQ0EgMjAxNzAeFw0xNzA4MjIxMjA3MDZaFw00MjA4MjIxMjA3MDZaMHExCzAJ
+BgNVBAYTAkhVMREwDwYDVQQHDAhCdWRhcGVzdDEWMBQGA1UECgwNTWljcm9zZWMg
+THRkLjEXMBUGA1UEYQwOVkFUSFUtMjM1ODQ0OTcxHjAcBgNVBAMMFWUtU3ppZ25v
+IFJvb3QgQ0EgMjAxNzBZMBMGByqGSM49AgEGCCqGSM49AwEHA0IABJbcPYrYsHtv
+xie+RJCxs1YVe45DJH0ahFnuY2iyxl6H0BVIHqiQrb1TotreOpCmYF9oMrWGQd+H
+Wyx7xf58etqjYzBhMA8GA1UdEwEB/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0G
+A1UdDgQWBBSHERUI0arBeAyxr87GyZDvvzAEwDAfBgNVHSMEGDAWgBSHERUI0arB
+eAyxr87GyZDvvzAEwDAKBggqhkjOPQQDAgNJADBGAiEAtVfd14pVCzbhhkT61Nlo
+jbjcI4qKDdQvfepz7L9NbKgCIQDLpbQS+ue16M9+k/zzNY9vTlp8tLxOsvxyqltZ
++efcMQ==
+-----END CERTIFICATE-----
+
+# Issuer: O=CERTSIGN SA OU=certSIGN ROOT CA G2
+# Subject: O=CERTSIGN SA OU=certSIGN ROOT CA G2
+# Label: "certSIGN Root CA G2"
+# Serial: 313609486401300475190
+# MD5 Fingerprint: 8c:f1:75:8a:c6:19:cf:94:b7:f7:65:20:87:c3:97:c7
+# SHA1 Fingerprint: 26:f9:93:b4:ed:3d:28:27:b0:b9:4b:a7:e9:15:1d:a3:8d:92:e5:32
+# SHA256 Fingerprint: 65:7c:fe:2f:a7:3f:aa:38:46:25:71:f3:32:a2:36:3a:46:fc:e7:02:09:51:71:07:02:cd:fb:b6:ee:da:33:05
+-----BEGIN CERTIFICATE-----
+MIIFRzCCAy+gAwIBAgIJEQA0tk7GNi02MA0GCSqGSIb3DQEBCwUAMEExCzAJBgNV
+BAYTAlJPMRQwEgYDVQQKEwtDRVJUU0lHTiBTQTEcMBoGA1UECxMTY2VydFNJR04g
+Uk9PVCBDQSBHMjAeFw0xNzAyMDYwOTI3MzVaFw00MjAyMDYwOTI3MzVaMEExCzAJ
+BgNVBAYTAlJPMRQwEgYDVQQKEwtDRVJUU0lHTiBTQTEcMBoGA1UECxMTY2VydFNJ
+R04gUk9PVCBDQSBHMjCCAiIwDQYJKoZIhvcNAQEBBQADggIPADCCAgoCggIBAMDF
+dRmRfUR0dIf+DjuW3NgBFszuY5HnC2/OOwppGnzC46+CjobXXo9X69MhWf05N0Iw
+vlDqtg+piNguLWkh59E3GE59kdUWX2tbAMI5Qw02hVK5U2UPHULlj88F0+7cDBrZ
+uIt4ImfkabBoxTzkbFpG583H+u/E7Eu9aqSs/cwoUe+StCmrqzWaTOTECMYmzPhp
+n+Sc8CnTXPnGFiWeI8MgwT0PPzhAsP6CRDiqWhqKa2NYOLQV07YRaXseVO6MGiKs
+cpc/I1mbySKEwQdPzH/iV8oScLumZfNpdWO9lfsbl83kqK/20U6o2YpxJM02PbyW
+xPFsqa7lzw1uKA2wDrXKUXt4FMMgL3/7FFXhEZn91QqhngLjYl/rNUssuHLoPj1P
+rCy7Lobio3aP5ZMqz6WryFyNSwb/EkaseMsUBzXgqd+L6a8VTxaJW732jcZZroiF
+DsGJ6x9nxUWO/203Nit4ZoORUSs9/1F3dmKh7Gc+PoGD4FapUB8fepmrY7+EF3fx
+DTvf95xhszWYijqy7DwaNz9+j5LP2RIUZNoQAhVB/0/E6xyjyfqZ90bp4RjZsbgy
+LcsUDFDYg2WD7rlcz8sFWkz6GZdr1l0T08JcVLwyc6B49fFtHsufpaafItzRUZ6C
+eWRgKRM+o/1Pcmqr4tTluCRVLERLiohEnMqE0yo7AgMBAAGjQjBAMA8GA1UdEwEB
+/wQFMAMBAf8wDgYDVR0PAQH/BAQDAgEGMB0GA1UdDgQWBBSCIS1mxteg4BXrzkwJ
+d8RgnlRuAzANBgkqhkiG9w0BAQsFAAOCAgEAYN4auOfyYILVAzOBywaK8SJJ6ejq
+kX/GM15oGQOGO0MBzwdw5AgeZYWR5hEit/UCI46uuR59H35s5r0l1ZUa8gWmr4UC
+b6741jH/JclKyMeKqdmfS0mbEVeZkkMR3rYzpMzXjWR91M08KCy0mpbqTfXERMQl
+qiCA2ClV9+BB/AYm/7k29UMUA2Z44RGx2iBfRgB4ACGlHgAoYXhvqAEBj500mv/0
+OJD7uNGzcgbJceaBxXntC6Z58hMLnPddDnskk7RI24Zf3lCGeOdA5jGokHZwYa+c
+NywRtYK3qq4kNFtyDGkNzVmf9nGvnAvRCjj5BiKDUyUM/FHE5r7iOZULJK2v0ZXk
+ltd0ZGtxTgI8qoXzIKNDOXZbbFD+mpwUHmUUihW9o4JFWklWatKcsWMy5WHgUyIO
+pwpJ6st+H6jiYoD2EEVSmAYY3qXNL3+q1Ok+CHLsIwMCPKaq2LxndD0UF/tUSxfj
+03k9bWtJySgOLnRQvwzZRjoQhsmnP+mg7H/rpXdYaXHmgwo38oZJar55CJD2AhZk
+PuXaTH4MNMn5X7azKFGnpyuqSfqNZSlO42sTp5SjLVFteAxEy9/eCG/Oo2Sr05WE
+1LlSVHJ7liXMvGnjSG4N0MedJ5qq+BOS3R7fY581qRY27Iy4g/Q9iY/NtBde17MX
+QRBdJ3NghVdJIgc=
+-----END CERTIFICATE-----
diff --git a/venv/Lib/site-packages/pip/_vendor/certifi/core.py b/venv/Lib/site-packages/pip/_vendor/certifi/core.py
new file mode 100644
index 000000000..8987449f6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/certifi/core.py
@@ -0,0 +1,60 @@
+# -*- coding: utf-8 -*-
+
+"""
+certifi.py
+~~~~~~~~~~
+
+This module returns the installation location of cacert.pem or its contents.
+"""
+import os
+
+try:
+    from importlib.resources import path as get_path, read_text
+
+    _CACERT_CTX = None
+    _CACERT_PATH = None
+
+    def where():
+        # This is slightly terrible, but we want to delay extracting the file
+        # in cases where we're inside of a zipimport situation until someone
+        # actually calls where(), but we don't want to re-extract the file
+        # on every call of where(), so we'll do it once then store it in a
+        # global variable.
+        global _CACERT_CTX
+        global _CACERT_PATH
+        if _CACERT_PATH is None:
+            # This is slightly janky, the importlib.resources API wants you to
+            # manage the cleanup of this file, so it doesn't actually return a
+            # path, it returns a context manager that will give you the path
+            # when you enter it and will do any cleanup when you leave it. In
+            # the common case of not needing a temporary file, it will just
+            # return the file system location and the __exit__() is a no-op.
+            #
+            # We also have to hold onto the actual context manager, because
+            # it will do the cleanup whenever it gets garbage collected, so
+            # we will also store that at the global level as well.
+            _CACERT_CTX = get_path("pip._vendor.certifi", "cacert.pem")
+            _CACERT_PATH = str(_CACERT_CTX.__enter__())
+
+        return _CACERT_PATH
+
+
+except ImportError:
+    # This fallback will work for Python versions prior to 3.7 that lack the
+    # importlib.resources module but relies on the existing `where` function
+    # so won't address issues with environments like PyOxidizer that don't set
+    # __file__ on modules.
+    def read_text(_module, _path, encoding="ascii"):
+        with open(where(), "r", encoding=encoding) as data:
+            return data.read()
+
+    # If we don't have importlib.resources, then we will just do the old logic
+    # of assuming we're on the filesystem and munge the path directly.
+    def where():
+        f = os.path.dirname(__file__)
+
+        return os.path.join(f, "cacert.pem")
+
+
+def contents():
+    return read_text("certifi", "cacert.pem", encoding="ascii")
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__init__.py b/venv/Lib/site-packages/pip/_vendor/chardet/__init__.py
new file mode 100644
index 000000000..0f9f820ef
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/__init__.py
@@ -0,0 +1,39 @@
+######################## BEGIN LICENSE BLOCK ########################
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+
+from .compat import PY2, PY3
+from .universaldetector import UniversalDetector
+from .version import __version__, VERSION
+
+
+def detect(byte_str):
+    """
+    Detect the encoding of the given byte string.
+
+    :param byte_str:     The byte sequence to examine.
+    :type byte_str:      ``bytes`` or ``bytearray``
+    """
+    if not isinstance(byte_str, bytearray):
+        if not isinstance(byte_str, bytes):
+            raise TypeError('Expected object of type bytes or bytearray, got: '
+                            '{0}'.format(type(byte_str)))
+        else:
+            byte_str = bytearray(byte_str)
+    detector = UniversalDetector()
+    detector.feed(byte_str)
+    return detector.close()
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..81d23a7f3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc
new file mode 100644
index 000000000..a427a2466
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5freq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc
new file mode 100644
index 000000000..89d2dded5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/big5prober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc
new file mode 100644
index 000000000..0c2da7b87
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/chardistribution.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc
new file mode 100644
index 000000000..2b4bd0521
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetgroupprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc
new file mode 100644
index 000000000..eeec2bb6d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/charsetprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc
new file mode 100644
index 000000000..21ffe1364
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/codingstatemachine.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..24af5fefc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc
new file mode 100644
index 000000000..d714a8f90
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/cp949prober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc
new file mode 100644
index 000000000..48b080691
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/enums.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc
new file mode 100644
index 000000000..7befa8d08
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc
new file mode 100644
index 000000000..e9e879750
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/escsm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc
new file mode 100644
index 000000000..7f1138fb2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/eucjpprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc
new file mode 100644
index 000000000..06ce0f9c2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrfreq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc
new file mode 100644
index 000000000..7e5b85512
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euckrprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc
new file mode 100644
index 000000000..721776283
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwfreq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc
new file mode 100644
index 000000000..f81edaa6e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/euctwprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc
new file mode 100644
index 000000000..752ae4dc9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312freq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc
new file mode 100644
index 000000000..cb7633ba5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/gb2312prober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc
new file mode 100644
index 000000000..d61b76fcf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/hebrewprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc
new file mode 100644
index 000000000..7b125f500
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jisfreq.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc
new file mode 100644
index 000000000..c244bfd96
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/jpcntx.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc
new file mode 100644
index 000000000..de81d10e7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langbulgarianmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc
new file mode 100644
index 000000000..cd980d3fc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langcyrillicmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc
new file mode 100644
index 000000000..1d11ccbf1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langgreekmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc
new file mode 100644
index 000000000..51b55aef7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhebrewmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc
new file mode 100644
index 000000000..86ce4d28b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langhungarianmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc
new file mode 100644
index 000000000..e50df0853
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langthaimodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc
new file mode 100644
index 000000000..3b04435ba
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/langturkishmodel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc
new file mode 100644
index 000000000..0f720b208
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/latin1prober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc
new file mode 100644
index 000000000..e4b839330
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcharsetprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc
new file mode 100644
index 000000000..c592f239f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcsgroupprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc
new file mode 100644
index 000000000..0ea79ed6a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/mbcssm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc
new file mode 100644
index 000000000..f1b0711d0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcharsetprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc
new file mode 100644
index 000000000..f9d4a5457
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sbcsgroupprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc
new file mode 100644
index 000000000..3f5c6924c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/sjisprober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc
new file mode 100644
index 000000000..0f44b4c82
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/universaldetector.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc
new file mode 100644
index 000000000..24121af3d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/utf8prober.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..c8b323035
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/big5freq.py b/venv/Lib/site-packages/pip/_vendor/chardet/big5freq.py
new file mode 100644
index 000000000..38f32517a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/big5freq.py
@@ -0,0 +1,386 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# Big5 frequency table
+# by Taiwan's Mandarin Promotion Council
+# <http://www.edu.tw:81/mandr/>
+#
+# 128  --> 0.42261
+# 256  --> 0.57851
+# 512  --> 0.74851
+# 1024 --> 0.89384
+# 2048 --> 0.97583
+#
+# Ideal Distribution Ratio = 0.74851/(1-0.74851) =2.98
+# Random Distribution Ration = 512/(5401-512)=0.105
+#
+# Typical Distribution Ratio about 25% of Ideal one, still much higher than RDR
+
+BIG5_TYPICAL_DISTRIBUTION_RATIO = 0.75
+
+#Char to FreqOrder table
+BIG5_TABLE_SIZE = 5376
+
+BIG5_CHAR_TO_FREQ_ORDER = (
+   1,1801,1506, 255,1431, 198,   9,  82,   6,5008, 177, 202,3681,1256,2821, 110, #   16
+3814,  33,3274, 261,  76,  44,2114,  16,2946,2187,1176, 659,3971,  26,3451,2653, #   32
+1198,3972,3350,4202, 410,2215, 302, 590, 361,1964,   8, 204,  58,4510,5009,1932, #   48
+  63,5010,5011, 317,1614,  75, 222, 159,4203,2417,1480,5012,3555,3091, 224,2822, #   64
+3682,   3,  10,3973,1471,  29,2787,1135,2866,1940, 873, 130,3275,1123, 312,5013, #   80
+4511,2052, 507, 252, 682,5014, 142,1915, 124, 206,2947,  34,3556,3204,  64, 604, #   96
+5015,2501,1977,1978, 155,1991, 645, 641,1606,5016,3452, 337,  72, 406,5017,  80, #  112
+ 630, 238,3205,1509, 263, 939,1092,2654, 756,1440,1094,3453, 449,  69,2987, 591, #  128
+ 179,2096, 471, 115,2035,1844,  60,  50,2988, 134, 806,1869, 734,2036,3454, 180, #  144
+ 995,1607, 156, 537,2907, 688,5018, 319,1305, 779,2145, 514,2379, 298,4512, 359, #  160
+2502,  90,2716,1338, 663,  11, 906,1099,2553,  20,2441, 182, 532,1716,5019, 732, #  176
+1376,4204,1311,1420,3206,  25,2317,1056, 113, 399, 382,1950, 242,3455,2474, 529, #  192
+3276, 475,1447,3683,5020, 117,  21, 656, 810,1297,2300,2334,3557,5021, 126,4205, #  208
+ 706, 456, 150, 613,4513,  71,1118,2037,4206, 145,3092,  85, 835, 486,2115,1246, #  224
+1426, 428, 727,1285,1015, 800, 106, 623, 303,1281,5022,2128,2359, 347,3815, 221, #  240
+3558,3135,5023,1956,1153,4207,  83, 296,1199,3093, 192, 624,  93,5024, 822,1898, #  256
+2823,3136, 795,2065, 991,1554,1542,1592,  27,  43,2867, 859, 139,1456, 860,4514, #  272
+ 437, 712,3974, 164,2397,3137, 695, 211,3037,2097, 195,3975,1608,3559,3560,3684, #  288
+3976, 234, 811,2989,2098,3977,2233,1441,3561,1615,2380, 668,2077,1638, 305, 228, #  304
+1664,4515, 467, 415,5025, 262,2099,1593, 239, 108, 300, 200,1033, 512,1247,2078, #  320
+5026,5027,2176,3207,3685,2682, 593, 845,1062,3277,  88,1723,2038,3978,1951, 212, #  336
+ 266, 152, 149, 468,1899,4208,4516,  77, 187,5028,3038,  37,   5,2990,5029,3979, #  352
+5030,5031,  39,2524,4517,2908,3208,2079,  55, 148,  74,4518, 545, 483,1474,1029, #  368
+1665, 217,1870,1531,3138,1104,2655,4209,  24, 172,3562, 900,3980,3563,3564,4519, #  384
+  32,1408,2824,1312, 329, 487,2360,2251,2717, 784,2683,   4,3039,3351,1427,1789, #  400
+ 188, 109, 499,5032,3686,1717,1790, 888,1217,3040,4520,5033,3565,5034,3352,1520, #  416
+3687,3981, 196,1034, 775,5035,5036, 929,1816, 249, 439,  38,5037,1063,5038, 794, #  432
+3982,1435,2301,  46, 178,3278,2066,5039,2381,5040, 214,1709,4521, 804,  35, 707, #  448
+ 324,3688,1601,2554, 140, 459,4210,5041,5042,1365, 839, 272, 978,2262,2580,3456, #  464
+2129,1363,3689,1423, 697, 100,3094,  48,  70,1231, 495,3139,2196,5043,1294,5044, #  480
+2080, 462, 586,1042,3279, 853, 256, 988, 185,2382,3457,1698, 434,1084,5045,3458, #  496
+ 314,2625,2788,4522,2335,2336, 569,2285, 637,1817,2525, 757,1162,1879,1616,3459, #  512
+ 287,1577,2116, 768,4523,1671,2868,3566,2526,1321,3816, 909,2418,5046,4211, 933, #  528
+3817,4212,2053,2361,1222,4524, 765,2419,1322, 786,4525,5047,1920,1462,1677,2909, #  544
+1699,5048,4526,1424,2442,3140,3690,2600,3353,1775,1941,3460,3983,4213, 309,1369, #  560
+1130,2825, 364,2234,1653,1299,3984,3567,3985,3986,2656, 525,1085,3041, 902,2001, #  576
+1475, 964,4527, 421,1845,1415,1057,2286, 940,1364,3141, 376,4528,4529,1381,   7, #  592
+2527, 983,2383, 336,1710,2684,1846, 321,3461, 559,1131,3042,2752,1809,1132,1313, #  608
+ 265,1481,1858,5049, 352,1203,2826,3280, 167,1089, 420,2827, 776, 792,1724,3568, #  624
+4214,2443,3281,5050,4215,5051, 446, 229, 333,2753, 901,3818,1200,1557,4530,2657, #  640
+1921, 395,2754,2685,3819,4216,1836, 125, 916,3209,2626,4531,5052,5053,3820,5054, #  656
+5055,5056,4532,3142,3691,1133,2555,1757,3462,1510,2318,1409,3569,5057,2146, 438, #  672
+2601,2910,2384,3354,1068, 958,3043, 461, 311,2869,2686,4217,1916,3210,4218,1979, #  688
+ 383, 750,2755,2627,4219, 274, 539, 385,1278,1442,5058,1154,1965, 384, 561, 210, #  704
+  98,1295,2556,3570,5059,1711,2420,1482,3463,3987,2911,1257, 129,5060,3821, 642, #  720
+ 523,2789,2790,2658,5061, 141,2235,1333,  68, 176, 441, 876, 907,4220, 603,2602, #  736
+ 710, 171,3464, 404, 549,  18,3143,2398,1410,3692,1666,5062,3571,4533,2912,4534, #  752
+5063,2991, 368,5064, 146, 366,  99, 871,3693,1543, 748, 807,1586,1185,  22,2263, #  768
+ 379,3822,3211,5065,3212, 505,1942,2628,1992,1382,2319,5066, 380,2362, 218, 702, #  784
+1818,1248,3465,3044,3572,3355,3282,5067,2992,3694, 930,3283,3823,5068,  59,5069, #  800
+ 585, 601,4221, 497,3466,1112,1314,4535,1802,5070,1223,1472,2177,5071, 749,1837, #  816
+ 690,1900,3824,1773,3988,1476, 429,1043,1791,2236,2117, 917,4222, 447,1086,1629, #  832
+5072, 556,5073,5074,2021,1654, 844,1090, 105, 550, 966,1758,2828,1008,1783, 686, #  848
+1095,5075,2287, 793,1602,5076,3573,2603,4536,4223,2948,2302,4537,3825, 980,2503, #  864
+ 544, 353, 527,4538, 908,2687,2913,5077, 381,2629,1943,1348,5078,1341,1252, 560, #  880
+3095,5079,3467,2870,5080,2054, 973, 886,2081, 143,4539,5081,5082, 157,3989, 496, #  896
+4224,  57, 840, 540,2039,4540,4541,3468,2118,1445, 970,2264,1748,1966,2082,4225, #  912
+3144,1234,1776,3284,2829,3695, 773,1206,2130,1066,2040,1326,3990,1738,1725,4226, #  928
+ 279,3145,  51,1544,2604, 423,1578,2131,2067, 173,4542,1880,5083,5084,1583, 264, #  944
+ 610,3696,4543,2444, 280, 154,5085,5086,5087,1739, 338,1282,3096, 693,2871,1411, #  960
+1074,3826,2445,5088,4544,5089,5090,1240, 952,2399,5091,2914,1538,2688, 685,1483, #  976
+4227,2475,1436, 953,4228,2055,4545, 671,2400,  79,4229,2446,3285, 608, 567,2689, #  992
+3469,4230,4231,1691, 393,1261,1792,2401,5092,4546,5093,5094,5095,5096,1383,1672, # 1008
+3827,3213,1464, 522,1119, 661,1150, 216, 675,4547,3991,1432,3574, 609,4548,2690, # 1024
+2402,5097,5098,5099,4232,3045,   0,5100,2476, 315, 231,2447, 301,3356,4549,2385, # 1040
+5101, 233,4233,3697,1819,4550,4551,5102,  96,1777,1315,2083,5103, 257,5104,1810, # 1056
+3698,2718,1139,1820,4234,2022,1124,2164,2791,1778,2659,5105,3097, 363,1655,3214, # 1072
+5106,2993,5107,5108,5109,3992,1567,3993, 718, 103,3215, 849,1443, 341,3357,2949, # 1088
+1484,5110,1712, 127,  67, 339,4235,2403, 679,1412, 821,5111,5112, 834, 738, 351, # 1104
+2994,2147, 846, 235,1497,1881, 418,1993,3828,2719, 186,1100,2148,2756,3575,1545, # 1120
+1355,2950,2872,1377, 583,3994,4236,2581,2995,5113,1298,3699,1078,2557,3700,2363, # 1136
+  78,3829,3830, 267,1289,2100,2002,1594,4237, 348, 369,1274,2197,2178,1838,4552, # 1152
+1821,2830,3701,2757,2288,2003,4553,2951,2758, 144,3358, 882,4554,3995,2759,3470, # 1168
+4555,2915,5114,4238,1726, 320,5115,3996,3046, 788,2996,5116,2831,1774,1327,2873, # 1184
+3997,2832,5117,1306,4556,2004,1700,3831,3576,2364,2660, 787,2023, 506, 824,3702, # 1200
+ 534, 323,4557,1044,3359,2024,1901, 946,3471,5118,1779,1500,1678,5119,1882,4558, # 1216
+ 165, 243,4559,3703,2528, 123, 683,4239, 764,4560,  36,3998,1793, 589,2916, 816, # 1232
+ 626,1667,3047,2237,1639,1555,1622,3832,3999,5120,4000,2874,1370,1228,1933, 891, # 1248
+2084,2917, 304,4240,5121, 292,2997,2720,3577, 691,2101,4241,1115,4561, 118, 662, # 1264
+5122, 611,1156, 854,2386,1316,2875,   2, 386, 515,2918,5123,5124,3286, 868,2238, # 1280
+1486, 855,2661, 785,2216,3048,5125,1040,3216,3578,5126,3146, 448,5127,1525,5128, # 1296
+2165,4562,5129,3833,5130,4242,2833,3579,3147, 503, 818,4001,3148,1568, 814, 676, # 1312
+1444, 306,1749,5131,3834,1416,1030, 197,1428, 805,2834,1501,4563,5132,5133,5134, # 1328
+1994,5135,4564,5136,5137,2198,  13,2792,3704,2998,3149,1229,1917,5138,3835,2132, # 1344
+5139,4243,4565,2404,3580,5140,2217,1511,1727,1120,5141,5142, 646,3836,2448, 307, # 1360
+5143,5144,1595,3217,5145,5146,5147,3705,1113,1356,4002,1465,2529,2530,5148, 519, # 1376
+5149, 128,2133,  92,2289,1980,5150,4003,1512, 342,3150,2199,5151,2793,2218,1981, # 1392
+3360,4244, 290,1656,1317, 789, 827,2365,5152,3837,4566, 562, 581,4004,5153, 401, # 1408
+4567,2252,  94,4568,5154,1399,2794,5155,1463,2025,4569,3218,1944,5156, 828,1105, # 1424
+4245,1262,1394,5157,4246, 605,4570,5158,1784,2876,5159,2835, 819,2102, 578,2200, # 1440
+2952,5160,1502, 436,3287,4247,3288,2836,4005,2919,3472,3473,5161,2721,2320,5162, # 1456
+5163,2337,2068,  23,4571, 193, 826,3838,2103, 699,1630,4248,3098, 390,1794,1064, # 1472
+3581,5164,1579,3099,3100,1400,5165,4249,1839,1640,2877,5166,4572,4573, 137,4250, # 1488
+ 598,3101,1967, 780, 104, 974,2953,5167, 278, 899, 253, 402, 572, 504, 493,1339, # 1504
+5168,4006,1275,4574,2582,2558,5169,3706,3049,3102,2253, 565,1334,2722, 863,  41, # 1520
+5170,5171,4575,5172,1657,2338,  19, 463,2760,4251, 606,5173,2999,3289,1087,2085, # 1536
+1323,2662,3000,5174,1631,1623,1750,4252,2691,5175,2878, 791,2723,2663,2339, 232, # 1552
+2421,5176,3001,1498,5177,2664,2630, 755,1366,3707,3290,3151,2026,1609, 119,1918, # 1568
+3474, 862,1026,4253,5178,4007,3839,4576,4008,4577,2265,1952,2477,5179,1125, 817, # 1584
+4254,4255,4009,1513,1766,2041,1487,4256,3050,3291,2837,3840,3152,5180,5181,1507, # 1600
+5182,2692, 733,  40,1632,1106,2879, 345,4257, 841,2531, 230,4578,3002,1847,3292, # 1616
+3475,5183,1263, 986,3476,5184, 735, 879, 254,1137, 857, 622,1300,1180,1388,1562, # 1632
+4010,4011,2954, 967,2761,2665,1349, 592,2134,1692,3361,3003,1995,4258,1679,4012, # 1648
+1902,2188,5185, 739,3708,2724,1296,1290,5186,4259,2201,2202,1922,1563,2605,2559, # 1664
+1871,2762,3004,5187, 435,5188, 343,1108, 596,  17,1751,4579,2239,3477,3709,5189, # 1680
+4580, 294,3582,2955,1693, 477, 979, 281,2042,3583, 643,2043,3710,2631,2795,2266, # 1696
+1031,2340,2135,2303,3584,4581, 367,1249,2560,5190,3585,5191,4582,1283,3362,2005, # 1712
+ 240,1762,3363,4583,4584, 836,1069,3153, 474,5192,2149,2532, 268,3586,5193,3219, # 1728
+1521,1284,5194,1658,1546,4260,5195,3587,3588,5196,4261,3364,2693,1685,4262, 961, # 1744
+1673,2632, 190,2006,2203,3841,4585,4586,5197, 570,2504,3711,1490,5198,4587,2633, # 1760
+3293,1957,4588, 584,1514, 396,1045,1945,5199,4589,1968,2449,5200,5201,4590,4013, # 1776
+ 619,5202,3154,3294, 215,2007,2796,2561,3220,4591,3221,4592, 763,4263,3842,4593, # 1792
+5203,5204,1958,1767,2956,3365,3712,1174, 452,1477,4594,3366,3155,5205,2838,1253, # 1808
+2387,2189,1091,2290,4264, 492,5206, 638,1169,1825,2136,1752,4014, 648, 926,1021, # 1824
+1324,4595, 520,4596, 997, 847,1007, 892,4597,3843,2267,1872,3713,2405,1785,4598, # 1840
+1953,2957,3103,3222,1728,4265,2044,3714,4599,2008,1701,3156,1551,  30,2268,4266, # 1856
+5207,2027,4600,3589,5208, 501,5209,4267, 594,3478,2166,1822,3590,3479,3591,3223, # 1872
+ 829,2839,4268,5210,1680,3157,1225,4269,5211,3295,4601,4270,3158,2341,5212,4602, # 1888
+4271,5213,4015,4016,5214,1848,2388,2606,3367,5215,4603, 374,4017, 652,4272,4273, # 1904
+ 375,1140, 798,5216,5217,5218,2366,4604,2269, 546,1659, 138,3051,2450,4605,5219, # 1920
+2254, 612,1849, 910, 796,3844,1740,1371, 825,3845,3846,5220,2920,2562,5221, 692, # 1936
+ 444,3052,2634, 801,4606,4274,5222,1491, 244,1053,3053,4275,4276, 340,5223,4018, # 1952
+1041,3005, 293,1168,  87,1357,5224,1539, 959,5225,2240, 721, 694,4277,3847, 219, # 1968
+1478, 644,1417,3368,2666,1413,1401,1335,1389,4019,5226,5227,3006,2367,3159,1826, # 1984
+ 730,1515, 184,2840,  66,4607,5228,1660,2958, 246,3369, 378,1457, 226,3480, 975, # 2000
+4020,2959,1264,3592, 674, 696,5229, 163,5230,1141,2422,2167, 713,3593,3370,4608, # 2016
+4021,5231,5232,1186,  15,5233,1079,1070,5234,1522,3224,3594, 276,1050,2725, 758, # 2032
+1126, 653,2960,3296,5235,2342, 889,3595,4022,3104,3007, 903,1250,4609,4023,3481, # 2048
+3596,1342,1681,1718, 766,3297, 286,  89,2961,3715,5236,1713,5237,2607,3371,3008, # 2064
+5238,2962,2219,3225,2880,5239,4610,2505,2533, 181, 387,1075,4024, 731,2190,3372, # 2080
+5240,3298, 310, 313,3482,2304, 770,4278,  54,3054, 189,4611,3105,3848,4025,5241, # 2096
+1230,1617,1850, 355,3597,4279,4612,3373, 111,4280,3716,1350,3160,3483,3055,4281, # 2112
+2150,3299,3598,5242,2797,4026,4027,3009, 722,2009,5243,1071, 247,1207,2343,2478, # 2128
+1378,4613,2010, 864,1437,1214,4614, 373,3849,1142,2220, 667,4615, 442,2763,2563, # 2144
+3850,4028,1969,4282,3300,1840, 837, 170,1107, 934,1336,1883,5244,5245,2119,4283, # 2160
+2841, 743,1569,5246,4616,4284, 582,2389,1418,3484,5247,1803,5248, 357,1395,1729, # 2176
+3717,3301,2423,1564,2241,5249,3106,3851,1633,4617,1114,2086,4285,1532,5250, 482, # 2192
+2451,4618,5251,5252,1492, 833,1466,5253,2726,3599,1641,2842,5254,1526,1272,3718, # 2208
+4286,1686,1795, 416,2564,1903,1954,1804,5255,3852,2798,3853,1159,2321,5256,2881, # 2224
+4619,1610,1584,3056,2424,2764, 443,3302,1163,3161,5257,5258,4029,5259,4287,2506, # 2240
+3057,4620,4030,3162,2104,1647,3600,2011,1873,4288,5260,4289, 431,3485,5261, 250, # 2256
+  97,  81,4290,5262,1648,1851,1558, 160, 848,5263, 866, 740,1694,5264,2204,2843, # 2272
+3226,4291,4621,3719,1687, 950,2479, 426, 469,3227,3720,3721,4031,5265,5266,1188, # 2288
+ 424,1996, 861,3601,4292,3854,2205,2694, 168,1235,3602,4293,5267,2087,1674,4622, # 2304
+3374,3303, 220,2565,1009,5268,3855, 670,3010, 332,1208, 717,5269,5270,3603,2452, # 2320
+4032,3375,5271, 513,5272,1209,2882,3376,3163,4623,1080,5273,5274,5275,5276,2534, # 2336
+3722,3604, 815,1587,4033,4034,5277,3605,3486,3856,1254,4624,1328,3058,1390,4035, # 2352
+1741,4036,3857,4037,5278, 236,3858,2453,3304,5279,5280,3723,3859,1273,3860,4625, # 2368
+5281, 308,5282,4626, 245,4627,1852,2480,1307,2583, 430, 715,2137,2454,5283, 270, # 2384
+ 199,2883,4038,5284,3606,2727,1753, 761,1754, 725,1661,1841,4628,3487,3724,5285, # 2400
+5286, 587,  14,3305, 227,2608, 326, 480,2270, 943,2765,3607, 291, 650,1884,5287, # 2416
+1702,1226, 102,1547,  62,3488, 904,4629,3489,1164,4294,5288,5289,1224,1548,2766, # 2432
+ 391, 498,1493,5290,1386,1419,5291,2056,1177,4630, 813, 880,1081,2368, 566,1145, # 2448
+4631,2291,1001,1035,2566,2609,2242, 394,1286,5292,5293,2069,5294,  86,1494,1730, # 2464
+4039, 491,1588, 745, 897,2963, 843,3377,4040,2767,2884,3306,1768, 998,2221,2070, # 2480
+ 397,1827,1195,1970,3725,3011,3378, 284,5295,3861,2507,2138,2120,1904,5296,4041, # 2496
+2151,4042,4295,1036,3490,1905, 114,2567,4296, 209,1527,5297,5298,2964,2844,2635, # 2512
+2390,2728,3164, 812,2568,5299,3307,5300,1559, 737,1885,3726,1210, 885,  28,2695, # 2528
+3608,3862,5301,4297,1004,1780,4632,5302, 346,1982,2222,2696,4633,3863,1742, 797, # 2544
+1642,4043,1934,1072,1384,2152, 896,4044,3308,3727,3228,2885,3609,5303,2569,1959, # 2560
+4634,2455,1786,5304,5305,5306,4045,4298,1005,1308,3728,4299,2729,4635,4636,1528, # 2576
+2610, 161,1178,4300,1983, 987,4637,1101,4301, 631,4046,1157,3229,2425,1343,1241, # 2592
+1016,2243,2570, 372, 877,2344,2508,1160, 555,1935, 911,4047,5307, 466,1170, 169, # 2608
+1051,2921,2697,3729,2481,3012,1182,2012,2571,1251,2636,5308, 992,2345,3491,1540, # 2624
+2730,1201,2071,2406,1997,2482,5309,4638, 528,1923,2191,1503,1874,1570,2369,3379, # 2640
+3309,5310, 557,1073,5311,1828,3492,2088,2271,3165,3059,3107, 767,3108,2799,4639, # 2656
+1006,4302,4640,2346,1267,2179,3730,3230, 778,4048,3231,2731,1597,2667,5312,4641, # 2672
+5313,3493,5314,5315,5316,3310,2698,1433,3311, 131,  95,1504,4049, 723,4303,3166, # 2688
+1842,3610,2768,2192,4050,2028,2105,3731,5317,3013,4051,1218,5318,3380,3232,4052, # 2704
+4304,2584, 248,1634,3864, 912,5319,2845,3732,3060,3865, 654,  53,5320,3014,5321, # 2720
+1688,4642, 777,3494,1032,4053,1425,5322, 191, 820,2121,2846, 971,4643, 931,3233, # 2736
+ 135, 664, 783,3866,1998, 772,2922,1936,4054,3867,4644,2923,3234, 282,2732, 640, # 2752
+1372,3495,1127, 922, 325,3381,5323,5324, 711,2045,5325,5326,4055,2223,2800,1937, # 2768
+4056,3382,2224,2255,3868,2305,5327,4645,3869,1258,3312,4057,3235,2139,2965,4058, # 2784
+4059,5328,2225, 258,3236,4646, 101,1227,5329,3313,1755,5330,1391,3314,5331,2924, # 2800
+2057, 893,5332,5333,5334,1402,4305,2347,5335,5336,3237,3611,5337,5338, 878,1325, # 2816
+1781,2801,4647, 259,1385,2585, 744,1183,2272,4648,5339,4060,2509,5340, 684,1024, # 2832
+4306,5341, 472,3612,3496,1165,3315,4061,4062, 322,2153, 881, 455,1695,1152,1340, # 2848
+ 660, 554,2154,4649,1058,4650,4307, 830,1065,3383,4063,4651,1924,5342,1703,1919, # 2864
+5343, 932,2273, 122,5344,4652, 947, 677,5345,3870,2637, 297,1906,1925,2274,4653, # 2880
+2322,3316,5346,5347,4308,5348,4309,  84,4310, 112, 989,5349, 547,1059,4064, 701, # 2896
+3613,1019,5350,4311,5351,3497, 942, 639, 457,2306,2456, 993,2966, 407, 851, 494, # 2912
+4654,3384, 927,5352,1237,5353,2426,3385, 573,4312, 680, 921,2925,1279,1875, 285, # 2928
+ 790,1448,1984, 719,2168,5354,5355,4655,4065,4066,1649,5356,1541, 563,5357,1077, # 2944
+5358,3386,3061,3498, 511,3015,4067,4068,3733,4069,1268,2572,3387,3238,4656,4657, # 2960
+5359, 535,1048,1276,1189,2926,2029,3167,1438,1373,2847,2967,1134,2013,5360,4313, # 2976
+1238,2586,3109,1259,5361, 700,5362,2968,3168,3734,4314,5363,4315,1146,1876,1907, # 2992
+4658,2611,4070, 781,2427, 132,1589, 203, 147, 273,2802,2407, 898,1787,2155,4071, # 3008
+4072,5364,3871,2803,5365,5366,4659,4660,5367,3239,5368,1635,3872, 965,5369,1805, # 3024
+2699,1516,3614,1121,1082,1329,3317,4073,1449,3873,  65,1128,2848,2927,2769,1590, # 3040
+3874,5370,5371,  12,2668,  45, 976,2587,3169,4661, 517,2535,1013,1037,3240,5372, # 3056
+3875,2849,5373,3876,5374,3499,5375,2612, 614,1999,2323,3877,3110,2733,2638,5376, # 3072
+2588,4316, 599,1269,5377,1811,3735,5378,2700,3111, 759,1060, 489,1806,3388,3318, # 3088
+1358,5379,5380,2391,1387,1215,2639,2256, 490,5381,5382,4317,1759,2392,2348,5383, # 3104
+4662,3878,1908,4074,2640,1807,3241,4663,3500,3319,2770,2349, 874,5384,5385,3501, # 3120
+3736,1859,  91,2928,3737,3062,3879,4664,5386,3170,4075,2669,5387,3502,1202,1403, # 3136
+3880,2969,2536,1517,2510,4665,3503,2511,5388,4666,5389,2701,1886,1495,1731,4076, # 3152
+2370,4667,5390,2030,5391,5392,4077,2702,1216, 237,2589,4318,2324,4078,3881,4668, # 3168
+4669,2703,3615,3504, 445,4670,5393,5394,5395,5396,2771,  61,4079,3738,1823,4080, # 3184
+5397, 687,2046, 935, 925, 405,2670, 703,1096,1860,2734,4671,4081,1877,1367,2704, # 3200
+3389, 918,2106,1782,2483, 334,3320,1611,1093,4672, 564,3171,3505,3739,3390, 945, # 3216
+2641,2058,4673,5398,1926, 872,4319,5399,3506,2705,3112, 349,4320,3740,4082,4674, # 3232
+3882,4321,3741,2156,4083,4675,4676,4322,4677,2408,2047, 782,4084, 400, 251,4323, # 3248
+1624,5400,5401, 277,3742, 299,1265, 476,1191,3883,2122,4324,4325,1109, 205,5402, # 3264
+2590,1000,2157,3616,1861,5403,5404,5405,4678,5406,4679,2573, 107,2484,2158,4085, # 3280
+3507,3172,5407,1533, 541,1301, 158, 753,4326,2886,3617,5408,1696, 370,1088,4327, # 3296
+4680,3618, 579, 327, 440, 162,2244, 269,1938,1374,3508, 968,3063,  56,1396,3113, # 3312
+2107,3321,3391,5409,1927,2159,4681,3016,5410,3619,5411,5412,3743,4682,2485,5413, # 3328
+2804,5414,1650,4683,5415,2613,5416,5417,4086,2671,3392,1149,3393,4087,3884,4088, # 3344
+5418,1076,  49,5419, 951,3242,3322,3323, 450,2850, 920,5420,1812,2805,2371,4328, # 3360
+1909,1138,2372,3885,3509,5421,3243,4684,1910,1147,1518,2428,4685,3886,5422,4686, # 3376
+2393,2614, 260,1796,3244,5423,5424,3887,3324, 708,5425,3620,1704,5426,3621,1351, # 3392
+1618,3394,3017,1887, 944,4329,3395,4330,3064,3396,4331,5427,3744, 422, 413,1714, # 3408
+3325, 500,2059,2350,4332,2486,5428,1344,1911, 954,5429,1668,5430,5431,4089,2409, # 3424
+4333,3622,3888,4334,5432,2307,1318,2512,3114, 133,3115,2887,4687, 629,  31,2851, # 3440
+2706,3889,4688, 850, 949,4689,4090,2970,1732,2089,4335,1496,1853,5433,4091, 620, # 3456
+3245, 981,1242,3745,3397,1619,3746,1643,3326,2140,2457,1971,1719,3510,2169,5434, # 3472
+3246,5435,5436,3398,1829,5437,1277,4690,1565,2048,5438,1636,3623,3116,5439, 869, # 3488
+2852, 655,3890,3891,3117,4092,3018,3892,1310,3624,4691,5440,5441,5442,1733, 558, # 3504
+4692,3747, 335,1549,3065,1756,4336,3748,1946,3511,1830,1291,1192, 470,2735,2108, # 3520
+2806, 913,1054,4093,5443,1027,5444,3066,4094,4693, 982,2672,3399,3173,3512,3247, # 3536
+3248,1947,2807,5445, 571,4694,5446,1831,5447,3625,2591,1523,2429,5448,2090, 984, # 3552
+4695,3749,1960,5449,3750, 852, 923,2808,3513,3751, 969,1519, 999,2049,2325,1705, # 3568
+5450,3118, 615,1662, 151, 597,4095,2410,2326,1049, 275,4696,3752,4337, 568,3753, # 3584
+3626,2487,4338,3754,5451,2430,2275, 409,3249,5452,1566,2888,3514,1002, 769,2853, # 3600
+ 194,2091,3174,3755,2226,3327,4339, 628,1505,5453,5454,1763,2180,3019,4096, 521, # 3616
+1161,2592,1788,2206,2411,4697,4097,1625,4340,4341, 412,  42,3119, 464,5455,2642, # 3632
+4698,3400,1760,1571,2889,3515,2537,1219,2207,3893,2643,2141,2373,4699,4700,3328, # 3648
+1651,3401,3627,5456,5457,3628,2488,3516,5458,3756,5459,5460,2276,2092, 460,5461, # 3664
+4701,5462,3020, 962, 588,3629, 289,3250,2644,1116,  52,5463,3067,1797,5464,5465, # 3680
+5466,1467,5467,1598,1143,3757,4342,1985,1734,1067,4702,1280,3402, 465,4703,1572, # 3696
+ 510,5468,1928,2245,1813,1644,3630,5469,4704,3758,5470,5471,2673,1573,1534,5472, # 3712
+5473, 536,1808,1761,3517,3894,3175,2645,5474,5475,5476,4705,3518,2929,1912,2809, # 3728
+5477,3329,1122, 377,3251,5478, 360,5479,5480,4343,1529, 551,5481,2060,3759,1769, # 3744
+2431,5482,2930,4344,3330,3120,2327,2109,2031,4706,1404, 136,1468,1479, 672,1171, # 3760
+3252,2308, 271,3176,5483,2772,5484,2050, 678,2736, 865,1948,4707,5485,2014,4098, # 3776
+2971,5486,2737,2227,1397,3068,3760,4708,4709,1735,2931,3403,3631,5487,3895, 509, # 3792
+2854,2458,2890,3896,5488,5489,3177,3178,4710,4345,2538,4711,2309,1166,1010, 552, # 3808
+ 681,1888,5490,5491,2972,2973,4099,1287,1596,1862,3179, 358, 453, 736, 175, 478, # 3824
+1117, 905,1167,1097,5492,1854,1530,5493,1706,5494,2181,3519,2292,3761,3520,3632, # 3840
+4346,2093,4347,5495,3404,1193,2489,4348,1458,2193,2208,1863,1889,1421,3331,2932, # 3856
+3069,2182,3521, 595,2123,5496,4100,5497,5498,4349,1707,2646, 223,3762,1359, 751, # 3872
+3121, 183,3522,5499,2810,3021, 419,2374, 633, 704,3897,2394, 241,5500,5501,5502, # 3888
+ 838,3022,3763,2277,2773,2459,3898,1939,2051,4101,1309,3122,2246,1181,5503,1136, # 3904
+2209,3899,2375,1446,4350,2310,4712,5504,5505,4351,1055,2615, 484,3764,5506,4102, # 3920
+ 625,4352,2278,3405,1499,4353,4103,5507,4104,4354,3253,2279,2280,3523,5508,5509, # 3936
+2774, 808,2616,3765,3406,4105,4355,3123,2539, 526,3407,3900,4356, 955,5510,1620, # 3952
+4357,2647,2432,5511,1429,3766,1669,1832, 994, 928,5512,3633,1260,5513,5514,5515, # 3968
+1949,2293, 741,2933,1626,4358,2738,2460, 867,1184, 362,3408,1392,5516,5517,4106, # 3984
+4359,1770,1736,3254,2934,4713,4714,1929,2707,1459,1158,5518,3070,3409,2891,1292, # 4000
+1930,2513,2855,3767,1986,1187,2072,2015,2617,4360,5519,2574,2514,2170,3768,2490, # 4016
+3332,5520,3769,4715,5521,5522, 666,1003,3023,1022,3634,4361,5523,4716,1814,2257, # 4032
+ 574,3901,1603, 295,1535, 705,3902,4362, 283, 858, 417,5524,5525,3255,4717,4718, # 4048
+3071,1220,1890,1046,2281,2461,4107,1393,1599, 689,2575, 388,4363,5526,2491, 802, # 4064
+5527,2811,3903,2061,1405,2258,5528,4719,3904,2110,1052,1345,3256,1585,5529, 809, # 4080
+5530,5531,5532, 575,2739,3524, 956,1552,1469,1144,2328,5533,2329,1560,2462,3635, # 4096
+3257,4108, 616,2210,4364,3180,2183,2294,5534,1833,5535,3525,4720,5536,1319,3770, # 4112
+3771,1211,3636,1023,3258,1293,2812,5537,5538,5539,3905, 607,2311,3906, 762,2892, # 4128
+1439,4365,1360,4721,1485,3072,5540,4722,1038,4366,1450,2062,2648,4367,1379,4723, # 4144
+2593,5541,5542,4368,1352,1414,2330,2935,1172,5543,5544,3907,3908,4724,1798,1451, # 4160
+5545,5546,5547,5548,2936,4109,4110,2492,2351, 411,4111,4112,3637,3333,3124,4725, # 4176
+1561,2674,1452,4113,1375,5549,5550,  47,2974, 316,5551,1406,1591,2937,3181,5552, # 4192
+1025,2142,3125,3182, 354,2740, 884,2228,4369,2412, 508,3772, 726,3638, 996,2433, # 4208
+3639, 729,5553, 392,2194,1453,4114,4726,3773,5554,5555,2463,3640,2618,1675,2813, # 4224
+ 919,2352,2975,2353,1270,4727,4115,  73,5556,5557, 647,5558,3259,2856,2259,1550, # 4240
+1346,3024,5559,1332, 883,3526,5560,5561,5562,5563,3334,2775,5564,1212, 831,1347, # 4256
+4370,4728,2331,3909,1864,3073, 720,3910,4729,4730,3911,5565,4371,5566,5567,4731, # 4272
+5568,5569,1799,4732,3774,2619,4733,3641,1645,2376,4734,5570,2938, 669,2211,2675, # 4288
+2434,5571,2893,5572,5573,1028,3260,5574,4372,2413,5575,2260,1353,5576,5577,4735, # 4304
+3183, 518,5578,4116,5579,4373,1961,5580,2143,4374,5581,5582,3025,2354,2355,3912, # 4320
+ 516,1834,1454,4117,2708,4375,4736,2229,2620,1972,1129,3642,5583,2776,5584,2976, # 4336
+1422, 577,1470,3026,1524,3410,5585,5586, 432,4376,3074,3527,5587,2594,1455,2515, # 4352
+2230,1973,1175,5588,1020,2741,4118,3528,4737,5589,2742,5590,1743,1361,3075,3529, # 4368
+2649,4119,4377,4738,2295, 895, 924,4378,2171, 331,2247,3076, 166,1627,3077,1098, # 4384
+5591,1232,2894,2231,3411,4739, 657, 403,1196,2377, 542,3775,3412,1600,4379,3530, # 4400
+5592,4740,2777,3261, 576, 530,1362,4741,4742,2540,2676,3776,4120,5593, 842,3913, # 4416
+5594,2814,2032,1014,4121, 213,2709,3413, 665, 621,4380,5595,3777,2939,2435,5596, # 4432
+2436,3335,3643,3414,4743,4381,2541,4382,4744,3644,1682,4383,3531,1380,5597, 724, # 4448
+2282, 600,1670,5598,1337,1233,4745,3126,2248,5599,1621,4746,5600, 651,4384,5601, # 4464
+1612,4385,2621,5602,2857,5603,2743,2312,3078,5604, 716,2464,3079, 174,1255,2710, # 4480
+4122,3645, 548,1320,1398, 728,4123,1574,5605,1891,1197,3080,4124,5606,3081,3082, # 4496
+3778,3646,3779, 747,5607, 635,4386,4747,5608,5609,5610,4387,5611,5612,4748,5613, # 4512
+3415,4749,2437, 451,5614,3780,2542,2073,4388,2744,4389,4125,5615,1764,4750,5616, # 4528
+4390, 350,4751,2283,2395,2493,5617,4391,4126,2249,1434,4127, 488,4752, 458,4392, # 4544
+4128,3781, 771,1330,2396,3914,2576,3184,2160,2414,1553,2677,3185,4393,5618,2494, # 4560
+2895,2622,1720,2711,4394,3416,4753,5619,2543,4395,5620,3262,4396,2778,5621,2016, # 4576
+2745,5622,1155,1017,3782,3915,5623,3336,2313, 201,1865,4397,1430,5624,4129,5625, # 4592
+5626,5627,5628,5629,4398,1604,5630, 414,1866, 371,2595,4754,4755,3532,2017,3127, # 4608
+4756,1708, 960,4399, 887, 389,2172,1536,1663,1721,5631,2232,4130,2356,2940,1580, # 4624
+5632,5633,1744,4757,2544,4758,4759,5634,4760,5635,2074,5636,4761,3647,3417,2896, # 4640
+4400,5637,4401,2650,3418,2815, 673,2712,2465, 709,3533,4131,3648,4402,5638,1148, # 4656
+ 502, 634,5639,5640,1204,4762,3649,1575,4763,2623,3783,5641,3784,3128, 948,3263, # 4672
+ 121,1745,3916,1110,5642,4403,3083,2516,3027,4132,3785,1151,1771,3917,1488,4133, # 4688
+1987,5643,2438,3534,5644,5645,2094,5646,4404,3918,1213,1407,2816, 531,2746,2545, # 4704
+3264,1011,1537,4764,2779,4405,3129,1061,5647,3786,3787,1867,2897,5648,2018, 120, # 4720
+4406,4407,2063,3650,3265,2314,3919,2678,3419,1955,4765,4134,5649,3535,1047,2713, # 4736
+1266,5650,1368,4766,2858, 649,3420,3920,2546,2747,1102,2859,2679,5651,5652,2000, # 4752
+5653,1111,3651,2977,5654,2495,3921,3652,2817,1855,3421,3788,5655,5656,3422,2415, # 4768
+2898,3337,3266,3653,5657,2577,5658,3654,2818,4135,1460, 856,5659,3655,5660,2899, # 4784
+2978,5661,2900,3922,5662,4408, 632,2517, 875,3923,1697,3924,2296,5663,5664,4767, # 4800
+3028,1239, 580,4768,4409,5665, 914, 936,2075,1190,4136,1039,2124,5666,5667,5668, # 4816
+5669,3423,1473,5670,1354,4410,3925,4769,2173,3084,4137, 915,3338,4411,4412,3339, # 4832
+1605,1835,5671,2748, 398,3656,4413,3926,4138, 328,1913,2860,4139,3927,1331,4414, # 4848
+3029, 937,4415,5672,3657,4140,4141,3424,2161,4770,3425, 524, 742, 538,3085,1012, # 4864
+5673,5674,3928,2466,5675, 658,1103, 225,3929,5676,5677,4771,5678,4772,5679,3267, # 4880
+1243,5680,4142, 963,2250,4773,5681,2714,3658,3186,5682,5683,2596,2332,5684,4774, # 4896
+5685,5686,5687,3536, 957,3426,2547,2033,1931,2941,2467, 870,2019,3659,1746,2780, # 4912
+2781,2439,2468,5688,3930,5689,3789,3130,3790,3537,3427,3791,5690,1179,3086,5691, # 4928
+3187,2378,4416,3792,2548,3188,3131,2749,4143,5692,3428,1556,2549,2297, 977,2901, # 4944
+2034,4144,1205,3429,5693,1765,3430,3189,2125,1271, 714,1689,4775,3538,5694,2333, # 4960
+3931, 533,4417,3660,2184, 617,5695,2469,3340,3539,2315,5696,5697,3190,5698,5699, # 4976
+3932,1988, 618, 427,2651,3540,3431,5700,5701,1244,1690,5702,2819,4418,4776,5703, # 4992
+3541,4777,5704,2284,1576, 473,3661,4419,3432, 972,5705,3662,5706,3087,5707,5708, # 5008
+4778,4779,5709,3793,4145,4146,5710, 153,4780, 356,5711,1892,2902,4420,2144, 408, # 5024
+ 803,2357,5712,3933,5713,4421,1646,2578,2518,4781,4782,3934,5714,3935,4422,5715, # 5040
+2416,3433, 752,5716,5717,1962,3341,2979,5718, 746,3030,2470,4783,4423,3794, 698, # 5056
+4784,1893,4424,3663,2550,4785,3664,3936,5719,3191,3434,5720,1824,1302,4147,2715, # 5072
+3937,1974,4425,5721,4426,3192, 823,1303,1288,1236,2861,3542,4148,3435, 774,3938, # 5088
+5722,1581,4786,1304,2862,3939,4787,5723,2440,2162,1083,3268,4427,4149,4428, 344, # 5104
+1173, 288,2316, 454,1683,5724,5725,1461,4788,4150,2597,5726,5727,4789, 985, 894, # 5120
+5728,3436,3193,5729,1914,2942,3795,1989,5730,2111,1975,5731,4151,5732,2579,1194, # 5136
+ 425,5733,4790,3194,1245,3796,4429,5734,5735,2863,5736, 636,4791,1856,3940, 760, # 5152
+1800,5737,4430,2212,1508,4792,4152,1894,1684,2298,5738,5739,4793,4431,4432,2213, # 5168
+ 479,5740,5741, 832,5742,4153,2496,5743,2980,2497,3797, 990,3132, 627,1815,2652, # 5184
+4433,1582,4434,2126,2112,3543,4794,5744, 799,4435,3195,5745,4795,2113,1737,3031, # 5200
+1018, 543, 754,4436,3342,1676,4796,4797,4154,4798,1489,5746,3544,5747,2624,2903, # 5216
+4155,5748,5749,2981,5750,5751,5752,5753,3196,4799,4800,2185,1722,5754,3269,3270, # 5232
+1843,3665,1715, 481, 365,1976,1857,5755,5756,1963,2498,4801,5757,2127,3666,3271, # 5248
+ 433,1895,2064,2076,5758, 602,2750,5759,5760,5761,5762,5763,3032,1628,3437,5764, # 5264
+3197,4802,4156,2904,4803,2519,5765,2551,2782,5766,5767,5768,3343,4804,2905,5769, # 5280
+4805,5770,2864,4806,4807,1221,2982,4157,2520,5771,5772,5773,1868,1990,5774,5775, # 5296
+5776,1896,5777,5778,4808,1897,4158, 318,5779,2095,4159,4437,5780,5781, 485,5782, # 5312
+ 938,3941, 553,2680, 116,5783,3942,3667,5784,3545,2681,2783,3438,3344,2820,5785, # 5328
+3668,2943,4160,1747,2944,2983,5786,5787, 207,5788,4809,5789,4810,2521,5790,3033, # 5344
+ 890,3669,3943,5791,1878,3798,3439,5792,2186,2358,3440,1652,5793,5794,5795, 941, # 5360
+2299, 208,3546,4161,2020, 330,4438,3944,2906,2499,3799,4439,4811,5796,5797,5798, # 5376
+)
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/big5prober.py b/venv/Lib/site-packages/pip/_vendor/chardet/big5prober.py
new file mode 100644
index 000000000..98f997012
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/big5prober.py
@@ -0,0 +1,47 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import Big5DistributionAnalysis
+from .mbcssm import BIG5_SM_MODEL
+
+
+class Big5Prober(MultiByteCharSetProber):
+    def __init__(self):
+        super(Big5Prober, self).__init__()
+        self.coding_sm = CodingStateMachine(BIG5_SM_MODEL)
+        self.distribution_analyzer = Big5DistributionAnalysis()
+        self.reset()
+
+    @property
+    def charset_name(self):
+        return "Big5"
+
+    @property
+    def language(self):
+        return "Chinese"
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/chardistribution.py b/venv/Lib/site-packages/pip/_vendor/chardet/chardistribution.py
new file mode 100644
index 000000000..c0395f4a4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/chardistribution.py
@@ -0,0 +1,233 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .euctwfreq import (EUCTW_CHAR_TO_FREQ_ORDER, EUCTW_TABLE_SIZE,
+                        EUCTW_TYPICAL_DISTRIBUTION_RATIO)
+from .euckrfreq import (EUCKR_CHAR_TO_FREQ_ORDER, EUCKR_TABLE_SIZE,
+                        EUCKR_TYPICAL_DISTRIBUTION_RATIO)
+from .gb2312freq import (GB2312_CHAR_TO_FREQ_ORDER, GB2312_TABLE_SIZE,
+                         GB2312_TYPICAL_DISTRIBUTION_RATIO)
+from .big5freq import (BIG5_CHAR_TO_FREQ_ORDER, BIG5_TABLE_SIZE,
+                       BIG5_TYPICAL_DISTRIBUTION_RATIO)
+from .jisfreq import (JIS_CHAR_TO_FREQ_ORDER, JIS_TABLE_SIZE,
+                      JIS_TYPICAL_DISTRIBUTION_RATIO)
+
+
+class CharDistributionAnalysis(object):
+    ENOUGH_DATA_THRESHOLD = 1024
+    SURE_YES = 0.99
+    SURE_NO = 0.01
+    MINIMUM_DATA_THRESHOLD = 3
+
+    def __init__(self):
+        # Mapping table to get frequency order from char order (get from
+        # GetOrder())
+        self._char_to_freq_order = None
+        self._table_size = None  # Size of above table
+        # This is a constant value which varies from language to language,
+        # used in calculating confidence.  See
+        # http://www.mozilla.org/projects/intl/UniversalCharsetDetection.html
+        # for further detail.
+        self.typical_distribution_ratio = None
+        self._done = None
+        self._total_chars = None
+        self._freq_chars = None
+        self.reset()
+
+    def reset(self):
+        """reset analyser, clear any state"""
+        # If this flag is set to True, detection is done and conclusion has
+        # been made
+        self._done = False
+        self._total_chars = 0  # Total characters encountered
+        # The number of characters whose frequency order is less than 512
+        self._freq_chars = 0
+
+    def feed(self, char, char_len):
+        """feed a character with known length"""
+        if char_len == 2:
+            # we only care about 2-bytes character in our distribution analysis
+            order = self.get_order(char)
+        else:
+            order = -1
+        if order >= 0:
+            self._total_chars += 1
+            # order is valid
+            if order < self._table_size:
+                if 512 > self._char_to_freq_order[order]:
+                    self._freq_chars += 1
+
+    def get_confidence(self):
+        """return confidence based on existing data"""
+        # if we didn't receive any character in our consideration range,
+        # return negative answer
+        if self._total_chars <= 0 or self._freq_chars <= self.MINIMUM_DATA_THRESHOLD:
+            return self.SURE_NO
+
+        if self._total_chars != self._freq_chars:
+            r = (self._freq_chars / ((self._total_chars - self._freq_chars)
+                 * self.typical_distribution_ratio))
+            if r < self.SURE_YES:
+                return r
+
+        # normalize confidence (we don't want to be 100% sure)
+        return self.SURE_YES
+
+    def got_enough_data(self):
+        # It is not necessary to receive all data to draw conclusion.
+        # For charset detection, certain amount of data is enough
+        return self._total_chars > self.ENOUGH_DATA_THRESHOLD
+
+    def get_order(self, byte_str):
+        # We do not handle characters based on the original encoding string,
+        # but convert this encoding string to a number, here called order.
+        # This allows multiple encodings of a language to share one frequency
+        # table.
+        return -1
+
+
+class EUCTWDistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(EUCTWDistributionAnalysis, self).__init__()
+        self._char_to_freq_order = EUCTW_CHAR_TO_FREQ_ORDER
+        self._table_size = EUCTW_TABLE_SIZE
+        self.typical_distribution_ratio = EUCTW_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for euc-TW encoding, we are interested
+        #   first  byte range: 0xc4 -- 0xfe
+        #   second byte range: 0xa1 -- 0xfe
+        # no validation needed here. State machine has done that
+        first_char = byte_str[0]
+        if first_char >= 0xC4:
+            return 94 * (first_char - 0xC4) + byte_str[1] - 0xA1
+        else:
+            return -1
+
+
+class EUCKRDistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(EUCKRDistributionAnalysis, self).__init__()
+        self._char_to_freq_order = EUCKR_CHAR_TO_FREQ_ORDER
+        self._table_size = EUCKR_TABLE_SIZE
+        self.typical_distribution_ratio = EUCKR_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for euc-KR encoding, we are interested
+        #   first  byte range: 0xb0 -- 0xfe
+        #   second byte range: 0xa1 -- 0xfe
+        # no validation needed here. State machine has done that
+        first_char = byte_str[0]
+        if first_char >= 0xB0:
+            return 94 * (first_char - 0xB0) + byte_str[1] - 0xA1
+        else:
+            return -1
+
+
+class GB2312DistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(GB2312DistributionAnalysis, self).__init__()
+        self._char_to_freq_order = GB2312_CHAR_TO_FREQ_ORDER
+        self._table_size = GB2312_TABLE_SIZE
+        self.typical_distribution_ratio = GB2312_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for GB2312 encoding, we are interested
+        #  first  byte range: 0xb0 -- 0xfe
+        #  second byte range: 0xa1 -- 0xfe
+        # no validation needed here. State machine has done that
+        first_char, second_char = byte_str[0], byte_str[1]
+        if (first_char >= 0xB0) and (second_char >= 0xA1):
+            return 94 * (first_char - 0xB0) + second_char - 0xA1
+        else:
+            return -1
+
+
+class Big5DistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(Big5DistributionAnalysis, self).__init__()
+        self._char_to_freq_order = BIG5_CHAR_TO_FREQ_ORDER
+        self._table_size = BIG5_TABLE_SIZE
+        self.typical_distribution_ratio = BIG5_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for big5 encoding, we are interested
+        #   first  byte range: 0xa4 -- 0xfe
+        #   second byte range: 0x40 -- 0x7e , 0xa1 -- 0xfe
+        # no validation needed here. State machine has done that
+        first_char, second_char = byte_str[0], byte_str[1]
+        if first_char >= 0xA4:
+            if second_char >= 0xA1:
+                return 157 * (first_char - 0xA4) + second_char - 0xA1 + 63
+            else:
+                return 157 * (first_char - 0xA4) + second_char - 0x40
+        else:
+            return -1
+
+
+class SJISDistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(SJISDistributionAnalysis, self).__init__()
+        self._char_to_freq_order = JIS_CHAR_TO_FREQ_ORDER
+        self._table_size = JIS_TABLE_SIZE
+        self.typical_distribution_ratio = JIS_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for sjis encoding, we are interested
+        #   first  byte range: 0x81 -- 0x9f , 0xe0 -- 0xfe
+        #   second byte range: 0x40 -- 0x7e,  0x81 -- oxfe
+        # no validation needed here. State machine has done that
+        first_char, second_char = byte_str[0], byte_str[1]
+        if (first_char >= 0x81) and (first_char <= 0x9F):
+            order = 188 * (first_char - 0x81)
+        elif (first_char >= 0xE0) and (first_char <= 0xEF):
+            order = 188 * (first_char - 0xE0 + 31)
+        else:
+            return -1
+        order = order + second_char - 0x40
+        if second_char > 0x7F:
+            order = -1
+        return order
+
+
+class EUCJPDistributionAnalysis(CharDistributionAnalysis):
+    def __init__(self):
+        super(EUCJPDistributionAnalysis, self).__init__()
+        self._char_to_freq_order = JIS_CHAR_TO_FREQ_ORDER
+        self._table_size = JIS_TABLE_SIZE
+        self.typical_distribution_ratio = JIS_TYPICAL_DISTRIBUTION_RATIO
+
+    def get_order(self, byte_str):
+        # for euc-JP encoding, we are interested
+        #   first  byte range: 0xa0 -- 0xfe
+        #   second byte range: 0xa1 -- 0xfe
+        # no validation needed here. State machine has done that
+        char = byte_str[0]
+        if char >= 0xA0:
+            return 94 * (char - 0xA1) + byte_str[1] - 0xa1
+        else:
+            return -1
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/charsetgroupprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/charsetgroupprober.py
new file mode 100644
index 000000000..8b3738efd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/charsetgroupprober.py
@@ -0,0 +1,106 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .enums import ProbingState
+from .charsetprober import CharSetProber
+
+
+class CharSetGroupProber(CharSetProber):
+    def __init__(self, lang_filter=None):
+        super(CharSetGroupProber, self).__init__(lang_filter=lang_filter)
+        self._active_num = 0
+        self.probers = []
+        self._best_guess_prober = None
+
+    def reset(self):
+        super(CharSetGroupProber, self).reset()
+        self._active_num = 0
+        for prober in self.probers:
+            if prober:
+                prober.reset()
+                prober.active = True
+                self._active_num += 1
+        self._best_guess_prober = None
+
+    @property
+    def charset_name(self):
+        if not self._best_guess_prober:
+            self.get_confidence()
+            if not self._best_guess_prober:
+                return None
+        return self._best_guess_prober.charset_name
+
+    @property
+    def language(self):
+        if not self._best_guess_prober:
+            self.get_confidence()
+            if not self._best_guess_prober:
+                return None
+        return self._best_guess_prober.language
+
+    def feed(self, byte_str):
+        for prober in self.probers:
+            if not prober:
+                continue
+            if not prober.active:
+                continue
+            state = prober.feed(byte_str)
+            if not state:
+                continue
+            if state == ProbingState.FOUND_IT:
+                self._best_guess_prober = prober
+                return self.state
+            elif state == ProbingState.NOT_ME:
+                prober.active = False
+                self._active_num -= 1
+                if self._active_num <= 0:
+                    self._state = ProbingState.NOT_ME
+                    return self.state
+        return self.state
+
+    def get_confidence(self):
+        state = self.state
+        if state == ProbingState.FOUND_IT:
+            return 0.99
+        elif state == ProbingState.NOT_ME:
+            return 0.01
+        best_conf = 0.0
+        self._best_guess_prober = None
+        for prober in self.probers:
+            if not prober:
+                continue
+            if not prober.active:
+                self.logger.debug('%s not active', prober.charset_name)
+                continue
+            conf = prober.get_confidence()
+            self.logger.debug('%s %s confidence = %s', prober.charset_name, prober.language, conf)
+            if best_conf < conf:
+                best_conf = conf
+                self._best_guess_prober = prober
+        if not self._best_guess_prober:
+            return 0.0
+        return best_conf
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/charsetprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/charsetprober.py
new file mode 100644
index 000000000..eac4e5986
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/charsetprober.py
@@ -0,0 +1,145 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+import logging
+import re
+
+from .enums import ProbingState
+
+
+class CharSetProber(object):
+
+    SHORTCUT_THRESHOLD = 0.95
+
+    def __init__(self, lang_filter=None):
+        self._state = None
+        self.lang_filter = lang_filter
+        self.logger = logging.getLogger(__name__)
+
+    def reset(self):
+        self._state = ProbingState.DETECTING
+
+    @property
+    def charset_name(self):
+        return None
+
+    def feed(self, buf):
+        pass
+
+    @property
+    def state(self):
+        return self._state
+
+    def get_confidence(self):
+        return 0.0
+
+    @staticmethod
+    def filter_high_byte_only(buf):
+        buf = re.sub(b'([\x00-\x7F])+', b' ', buf)
+        return buf
+
+    @staticmethod
+    def filter_international_words(buf):
+        """
+        We define three types of bytes:
+        alphabet: english alphabets [a-zA-Z]
+        international: international characters [\x80-\xFF]
+        marker: everything else [^a-zA-Z\x80-\xFF]
+
+        The input buffer can be thought to contain a series of words delimited
+        by markers. This function works to filter all words that contain at
+        least one international character. All contiguous sequences of markers
+        are replaced by a single space ascii character.
+
+        This filter applies to all scripts which do not use English characters.
+        """
+        filtered = bytearray()
+
+        # This regex expression filters out only words that have at-least one
+        # international character. The word may include one marker character at
+        # the end.
+        words = re.findall(b'[a-zA-Z]*[\x80-\xFF]+[a-zA-Z]*[^a-zA-Z\x80-\xFF]?',
+                           buf)
+
+        for word in words:
+            filtered.extend(word[:-1])
+
+            # If the last character in the word is a marker, replace it with a
+            # space as markers shouldn't affect our analysis (they are used
+            # similarly across all languages and may thus have similar
+            # frequencies).
+            last_char = word[-1:]
+            if not last_char.isalpha() and last_char < b'\x80':
+                last_char = b' '
+            filtered.extend(last_char)
+
+        return filtered
+
+    @staticmethod
+    def filter_with_english_letters(buf):
+        """
+        Returns a copy of ``buf`` that retains only the sequences of English
+        alphabet and high byte characters that are not between <> characters.
+        Also retains English alphabet and high byte characters immediately
+        before occurrences of >.
+
+        This filter can be applied to all scripts which contain both English
+        characters and extended ASCII characters, but is currently only used by
+        ``Latin1Prober``.
+        """
+        filtered = bytearray()
+        in_tag = False
+        prev = 0
+
+        for curr in range(len(buf)):
+            # Slice here to get bytes instead of an int with Python 3
+            buf_char = buf[curr:curr + 1]
+            # Check if we're coming out of or entering an HTML tag
+            if buf_char == b'>':
+                in_tag = False
+            elif buf_char == b'<':
+                in_tag = True
+
+            # If current character is not extended-ASCII and not alphabetic...
+            if buf_char < b'\x80' and not buf_char.isalpha():
+                # ...and we're not in a tag
+                if curr > prev and not in_tag:
+                    # Keep everything after last non-extended-ASCII,
+                    # non-alphabetic character
+                    filtered.extend(buf[prev:curr])
+                    # Output a space to delimit stretch we kept
+                    filtered.extend(b' ')
+                prev = curr + 1
+
+        # If we're not in a tag...
+        if not in_tag:
+            # Keep everything after last non-extended-ASCII, non-alphabetic
+            # character
+            filtered.extend(buf[prev:])
+
+        return filtered
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/cli/__init__.py b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__init__.py
new file mode 100644
index 000000000..8b1378917
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__init__.py
@@ -0,0 +1 @@
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..35c95100a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc
new file mode 100644
index 000000000..0a9778028
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/chardet/cli/__pycache__/chardetect.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/cli/chardetect.py b/venv/Lib/site-packages/pip/_vendor/chardet/cli/chardetect.py
new file mode 100644
index 000000000..c61136b63
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/cli/chardetect.py
@@ -0,0 +1,85 @@
+#!/usr/bin/env python
+"""
+Script which takes one or more file paths and reports on their detected
+encodings
+
+Example::
+
+    % chardetect somefile someotherfile
+    somefile: windows-1252 with confidence 0.5
+    someotherfile: ascii with confidence 1.0
+
+If no paths are provided, it takes its input from stdin.
+
+"""
+
+from __future__ import absolute_import, print_function, unicode_literals
+
+import argparse
+import sys
+
+from pip._vendor.chardet import __version__
+from pip._vendor.chardet.compat import PY2
+from pip._vendor.chardet.universaldetector import UniversalDetector
+
+
+def description_of(lines, name='stdin'):
+    """
+    Return a string describing the probable encoding of a file or
+    list of strings.
+
+    :param lines: The lines to get the encoding of.
+    :type lines: Iterable of bytes
+    :param name: Name of file or collection of lines
+    :type name: str
+    """
+    u = UniversalDetector()
+    for line in lines:
+        line = bytearray(line)
+        u.feed(line)
+        # shortcut out of the loop to save reading further - particularly useful if we read a BOM.
+        if u.done:
+            break
+    u.close()
+    result = u.result
+    if PY2:
+        name = name.decode(sys.getfilesystemencoding(), 'ignore')
+    if result['encoding']:
+        return '{0}: {1} with confidence {2}'.format(name, result['encoding'],
+                                                     result['confidence'])
+    else:
+        return '{0}: no result'.format(name)
+
+
+def main(argv=None):
+    """
+    Handles command line arguments and gets things started.
+
+    :param argv: List of arguments, as if specified on the command-line.
+                 If None, ``sys.argv[1:]`` is used instead.
+    :type argv: list of str
+    """
+    # Get command line arguments
+    parser = argparse.ArgumentParser(
+        description="Takes one or more file paths and reports their detected \
+                     encodings")
+    parser.add_argument('input',
+                        help='File whose encoding we would like to determine. \
+                              (default: stdin)',
+                        type=argparse.FileType('rb'), nargs='*',
+                        default=[sys.stdin if PY2 else sys.stdin.buffer])
+    parser.add_argument('--version', action='version',
+                        version='%(prog)s {0}'.format(__version__))
+    args = parser.parse_args(argv)
+
+    for f in args.input:
+        if f.isatty():
+            print("You are running chardetect interactively. Press " +
+                  "CTRL-D twice at the start of a blank line to signal the " +
+                  "end of your input. If you want help, run chardetect " +
+                  "--help\n", file=sys.stderr)
+        print(description_of(f, f.name))
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/codingstatemachine.py b/venv/Lib/site-packages/pip/_vendor/chardet/codingstatemachine.py
new file mode 100644
index 000000000..68fba44f1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/codingstatemachine.py
@@ -0,0 +1,88 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+import logging
+
+from .enums import MachineState
+
+
+class CodingStateMachine(object):
+    """
+    A state machine to verify a byte sequence for a particular encoding. For
+    each byte the detector receives, it will feed that byte to every active
+    state machine available, one byte at a time. The state machine changes its
+    state based on its previous state and the byte it receives. There are 3
+    states in a state machine that are of interest to an auto-detector:
+
+    START state: This is the state to start with, or a legal byte sequence
+                 (i.e. a valid code point) for character has been identified.
+
+    ME state:  This indicates that the state machine identified a byte sequence
+               that is specific to the charset it is designed for and that
+               there is no other possible encoding which can contain this byte
+               sequence. This will to lead to an immediate positive answer for
+               the detector.
+
+    ERROR state: This indicates the state machine identified an illegal byte
+                 sequence for that encoding. This will lead to an immediate
+                 negative answer for this encoding. Detector will exclude this
+                 encoding from consideration from here on.
+    """
+    def __init__(self, sm):
+        self._model = sm
+        self._curr_byte_pos = 0
+        self._curr_char_len = 0
+        self._curr_state = None
+        self.logger = logging.getLogger(__name__)
+        self.reset()
+
+    def reset(self):
+        self._curr_state = MachineState.START
+
+    def next_state(self, c):
+        # for each byte we get its class
+        # if it is first byte, we also get byte length
+        byte_class = self._model['class_table'][c]
+        if self._curr_state == MachineState.START:
+            self._curr_byte_pos = 0
+            self._curr_char_len = self._model['char_len_table'][byte_class]
+        # from byte's class and state_table, we get its next state
+        curr_state = (self._curr_state * self._model['class_factor']
+                      + byte_class)
+        self._curr_state = self._model['state_table'][curr_state]
+        self._curr_byte_pos += 1
+        return self._curr_state
+
+    def get_current_charlen(self):
+        return self._curr_char_len
+
+    def get_coding_state_machine(self):
+        return self._model['name']
+
+    @property
+    def language(self):
+        return self._model['language']
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/compat.py b/venv/Lib/site-packages/pip/_vendor/chardet/compat.py
new file mode 100644
index 000000000..ddd74687c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/compat.py
@@ -0,0 +1,34 @@
+######################## BEGIN LICENSE BLOCK ########################
+# Contributor(s):
+#   Dan Blanchard
+#   Ian Cordasco
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+import sys
+
+
+if sys.version_info < (3, 0):
+    PY2 = True
+    PY3 = False
+    base_str = (str, unicode)
+    text_type = unicode
+else:
+    PY2 = False
+    PY3 = True
+    base_str = (bytes, str)
+    text_type = str
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/cp949prober.py b/venv/Lib/site-packages/pip/_vendor/chardet/cp949prober.py
new file mode 100644
index 000000000..efd793abc
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/cp949prober.py
@@ -0,0 +1,49 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .chardistribution import EUCKRDistributionAnalysis
+from .codingstatemachine import CodingStateMachine
+from .mbcharsetprober import MultiByteCharSetProber
+from .mbcssm import CP949_SM_MODEL
+
+
+class CP949Prober(MultiByteCharSetProber):
+    def __init__(self):
+        super(CP949Prober, self).__init__()
+        self.coding_sm = CodingStateMachine(CP949_SM_MODEL)
+        # NOTE: CP949 is a superset of EUC-KR, so the distribution should be
+        #       not different.
+        self.distribution_analyzer = EUCKRDistributionAnalysis()
+        self.reset()
+
+    @property
+    def charset_name(self):
+        return "CP949"
+
+    @property
+    def language(self):
+        return "Korean"
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/enums.py b/venv/Lib/site-packages/pip/_vendor/chardet/enums.py
new file mode 100644
index 000000000..045120722
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/enums.py
@@ -0,0 +1,76 @@
+"""
+All of the Enums that are used throughout the chardet package.
+
+:author: Dan Blanchard (dan.blanchard@gmail.com)
+"""
+
+
+class InputState(object):
+    """
+    This enum represents the different states a universal detector can be in.
+    """
+    PURE_ASCII = 0
+    ESC_ASCII = 1
+    HIGH_BYTE = 2
+
+
+class LanguageFilter(object):
+    """
+    This enum represents the different language filters we can apply to a
+    ``UniversalDetector``.
+    """
+    CHINESE_SIMPLIFIED = 0x01
+    CHINESE_TRADITIONAL = 0x02
+    JAPANESE = 0x04
+    KOREAN = 0x08
+    NON_CJK = 0x10
+    ALL = 0x1F
+    CHINESE = CHINESE_SIMPLIFIED | CHINESE_TRADITIONAL
+    CJK = CHINESE | JAPANESE | KOREAN
+
+
+class ProbingState(object):
+    """
+    This enum represents the different states a prober can be in.
+    """
+    DETECTING = 0
+    FOUND_IT = 1
+    NOT_ME = 2
+
+
+class MachineState(object):
+    """
+    This enum represents the different states a state machine can be in.
+    """
+    START = 0
+    ERROR = 1
+    ITS_ME = 2
+
+
+class SequenceLikelihood(object):
+    """
+    This enum represents the likelihood of a character following the previous one.
+    """
+    NEGATIVE = 0
+    UNLIKELY = 1
+    LIKELY = 2
+    POSITIVE = 3
+
+    @classmethod
+    def get_num_categories(cls):
+        """:returns: The number of likelihood categories in the enum."""
+        return 4
+
+
+class CharacterCategory(object):
+    """
+    This enum represents the different categories language models for
+    ``SingleByteCharsetProber`` put characters into.
+
+    Anything less than CONTROL is considered a letter.
+    """
+    UNDEFINED = 255
+    LINE_BREAK = 254
+    SYMBOL = 253
+    DIGIT = 252
+    CONTROL = 251
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/escprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/escprober.py
new file mode 100644
index 000000000..c70493f2b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/escprober.py
@@ -0,0 +1,101 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .codingstatemachine import CodingStateMachine
+from .enums import LanguageFilter, ProbingState, MachineState
+from .escsm import (HZ_SM_MODEL, ISO2022CN_SM_MODEL, ISO2022JP_SM_MODEL,
+                    ISO2022KR_SM_MODEL)
+
+
+class EscCharSetProber(CharSetProber):
+    """
+    This CharSetProber uses a "code scheme" approach for detecting encodings,
+    whereby easily recognizable escape or shift sequences are relied on to
+    identify these encodings.
+    """
+
+    def __init__(self, lang_filter=None):
+        super(EscCharSetProber, self).__init__(lang_filter=lang_filter)
+        self.coding_sm = []
+        if self.lang_filter & LanguageFilter.CHINESE_SIMPLIFIED:
+            self.coding_sm.append(CodingStateMachine(HZ_SM_MODEL))
+            self.coding_sm.append(CodingStateMachine(ISO2022CN_SM_MODEL))
+        if self.lang_filter & LanguageFilter.JAPANESE:
+            self.coding_sm.append(CodingStateMachine(ISO2022JP_SM_MODEL))
+        if self.lang_filter & LanguageFilter.KOREAN:
+            self.coding_sm.append(CodingStateMachine(ISO2022KR_SM_MODEL))
+        self.active_sm_count = None
+        self._detected_charset = None
+        self._detected_language = None
+        self._state = None
+        self.reset()
+
+    def reset(self):
+        super(EscCharSetProber, self).reset()
+        for coding_sm in self.coding_sm:
+            if not coding_sm:
+                continue
+            coding_sm.active = True
+            coding_sm.reset()
+        self.active_sm_count = len(self.coding_sm)
+        self._detected_charset = None
+        self._detected_language = None
+
+    @property
+    def charset_name(self):
+        return self._detected_charset
+
+    @property
+    def language(self):
+        return self._detected_language
+
+    def get_confidence(self):
+        if self._detected_charset:
+            return 0.99
+        else:
+            return 0.00
+
+    def feed(self, byte_str):
+        for c in byte_str:
+            for coding_sm in self.coding_sm:
+                if not coding_sm or not coding_sm.active:
+                    continue
+                coding_state = coding_sm.next_state(c)
+                if coding_state == MachineState.ERROR:
+                    coding_sm.active = False
+                    self.active_sm_count -= 1
+                    if self.active_sm_count <= 0:
+                        self._state = ProbingState.NOT_ME
+                        return self.state
+                elif coding_state == MachineState.ITS_ME:
+                    self._state = ProbingState.FOUND_IT
+                    self._detected_charset = coding_sm.get_coding_state_machine()
+                    self._detected_language = coding_sm.language
+                    return self.state
+
+        return self.state
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/escsm.py b/venv/Lib/site-packages/pip/_vendor/chardet/escsm.py
new file mode 100644
index 000000000..0069523a0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/escsm.py
@@ -0,0 +1,246 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .enums import MachineState
+
+HZ_CLS = (
+1,0,0,0,0,0,0,0,  # 00 - 07
+0,0,0,0,0,0,0,0,  # 08 - 0f
+0,0,0,0,0,0,0,0,  # 10 - 17
+0,0,0,1,0,0,0,0,  # 18 - 1f
+0,0,0,0,0,0,0,0,  # 20 - 27
+0,0,0,0,0,0,0,0,  # 28 - 2f
+0,0,0,0,0,0,0,0,  # 30 - 37
+0,0,0,0,0,0,0,0,  # 38 - 3f
+0,0,0,0,0,0,0,0,  # 40 - 47
+0,0,0,0,0,0,0,0,  # 48 - 4f
+0,0,0,0,0,0,0,0,  # 50 - 57
+0,0,0,0,0,0,0,0,  # 58 - 5f
+0,0,0,0,0,0,0,0,  # 60 - 67
+0,0,0,0,0,0,0,0,  # 68 - 6f
+0,0,0,0,0,0,0,0,  # 70 - 77
+0,0,0,4,0,5,2,0,  # 78 - 7f
+1,1,1,1,1,1,1,1,  # 80 - 87
+1,1,1,1,1,1,1,1,  # 88 - 8f
+1,1,1,1,1,1,1,1,  # 90 - 97
+1,1,1,1,1,1,1,1,  # 98 - 9f
+1,1,1,1,1,1,1,1,  # a0 - a7
+1,1,1,1,1,1,1,1,  # a8 - af
+1,1,1,1,1,1,1,1,  # b0 - b7
+1,1,1,1,1,1,1,1,  # b8 - bf
+1,1,1,1,1,1,1,1,  # c0 - c7
+1,1,1,1,1,1,1,1,  # c8 - cf
+1,1,1,1,1,1,1,1,  # d0 - d7
+1,1,1,1,1,1,1,1,  # d8 - df
+1,1,1,1,1,1,1,1,  # e0 - e7
+1,1,1,1,1,1,1,1,  # e8 - ef
+1,1,1,1,1,1,1,1,  # f0 - f7
+1,1,1,1,1,1,1,1,  # f8 - ff
+)
+
+HZ_ST = (
+MachineState.START,MachineState.ERROR,     3,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,# 00-07
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 08-0f
+MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,     4,MachineState.ERROR,# 10-17
+     5,MachineState.ERROR,     6,MachineState.ERROR,     5,     5,     4,MachineState.ERROR,# 18-1f
+     4,MachineState.ERROR,     4,     4,     4,MachineState.ERROR,     4,MachineState.ERROR,# 20-27
+     4,MachineState.ITS_ME,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 28-2f
+)
+
+HZ_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0)
+
+HZ_SM_MODEL = {'class_table': HZ_CLS,
+               'class_factor': 6,
+               'state_table': HZ_ST,
+               'char_len_table': HZ_CHAR_LEN_TABLE,
+               'name': "HZ-GB-2312",
+               'language': 'Chinese'}
+
+ISO2022CN_CLS = (
+2,0,0,0,0,0,0,0,  # 00 - 07
+0,0,0,0,0,0,0,0,  # 08 - 0f
+0,0,0,0,0,0,0,0,  # 10 - 17
+0,0,0,1,0,0,0,0,  # 18 - 1f
+0,0,0,0,0,0,0,0,  # 20 - 27
+0,3,0,0,0,0,0,0,  # 28 - 2f
+0,0,0,0,0,0,0,0,  # 30 - 37
+0,0,0,0,0,0,0,0,  # 38 - 3f
+0,0,0,4,0,0,0,0,  # 40 - 47
+0,0,0,0,0,0,0,0,  # 48 - 4f
+0,0,0,0,0,0,0,0,  # 50 - 57
+0,0,0,0,0,0,0,0,  # 58 - 5f
+0,0,0,0,0,0,0,0,  # 60 - 67
+0,0,0,0,0,0,0,0,  # 68 - 6f
+0,0,0,0,0,0,0,0,  # 70 - 77
+0,0,0,0,0,0,0,0,  # 78 - 7f
+2,2,2,2,2,2,2,2,  # 80 - 87
+2,2,2,2,2,2,2,2,  # 88 - 8f
+2,2,2,2,2,2,2,2,  # 90 - 97
+2,2,2,2,2,2,2,2,  # 98 - 9f
+2,2,2,2,2,2,2,2,  # a0 - a7
+2,2,2,2,2,2,2,2,  # a8 - af
+2,2,2,2,2,2,2,2,  # b0 - b7
+2,2,2,2,2,2,2,2,  # b8 - bf
+2,2,2,2,2,2,2,2,  # c0 - c7
+2,2,2,2,2,2,2,2,  # c8 - cf
+2,2,2,2,2,2,2,2,  # d0 - d7
+2,2,2,2,2,2,2,2,  # d8 - df
+2,2,2,2,2,2,2,2,  # e0 - e7
+2,2,2,2,2,2,2,2,  # e8 - ef
+2,2,2,2,2,2,2,2,  # f0 - f7
+2,2,2,2,2,2,2,2,  # f8 - ff
+)
+
+ISO2022CN_ST = (
+MachineState.START,     3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 00-07
+MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 08-0f
+MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 10-17
+MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     4,MachineState.ERROR,# 18-1f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 20-27
+     5,     6,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 28-2f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 30-37
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,# 38-3f
+)
+
+ISO2022CN_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0, 0, 0, 0)
+
+ISO2022CN_SM_MODEL = {'class_table': ISO2022CN_CLS,
+                      'class_factor': 9,
+                      'state_table': ISO2022CN_ST,
+                      'char_len_table': ISO2022CN_CHAR_LEN_TABLE,
+                      'name': "ISO-2022-CN",
+                      'language': 'Chinese'}
+
+ISO2022JP_CLS = (
+2,0,0,0,0,0,0,0,  # 00 - 07
+0,0,0,0,0,0,2,2,  # 08 - 0f
+0,0,0,0,0,0,0,0,  # 10 - 17
+0,0,0,1,0,0,0,0,  # 18 - 1f
+0,0,0,0,7,0,0,0,  # 20 - 27
+3,0,0,0,0,0,0,0,  # 28 - 2f
+0,0,0,0,0,0,0,0,  # 30 - 37
+0,0,0,0,0,0,0,0,  # 38 - 3f
+6,0,4,0,8,0,0,0,  # 40 - 47
+0,9,5,0,0,0,0,0,  # 48 - 4f
+0,0,0,0,0,0,0,0,  # 50 - 57
+0,0,0,0,0,0,0,0,  # 58 - 5f
+0,0,0,0,0,0,0,0,  # 60 - 67
+0,0,0,0,0,0,0,0,  # 68 - 6f
+0,0,0,0,0,0,0,0,  # 70 - 77
+0,0,0,0,0,0,0,0,  # 78 - 7f
+2,2,2,2,2,2,2,2,  # 80 - 87
+2,2,2,2,2,2,2,2,  # 88 - 8f
+2,2,2,2,2,2,2,2,  # 90 - 97
+2,2,2,2,2,2,2,2,  # 98 - 9f
+2,2,2,2,2,2,2,2,  # a0 - a7
+2,2,2,2,2,2,2,2,  # a8 - af
+2,2,2,2,2,2,2,2,  # b0 - b7
+2,2,2,2,2,2,2,2,  # b8 - bf
+2,2,2,2,2,2,2,2,  # c0 - c7
+2,2,2,2,2,2,2,2,  # c8 - cf
+2,2,2,2,2,2,2,2,  # d0 - d7
+2,2,2,2,2,2,2,2,  # d8 - df
+2,2,2,2,2,2,2,2,  # e0 - e7
+2,2,2,2,2,2,2,2,  # e8 - ef
+2,2,2,2,2,2,2,2,  # f0 - f7
+2,2,2,2,2,2,2,2,  # f8 - ff
+)
+
+ISO2022JP_ST = (
+MachineState.START,     3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 00-07
+MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 08-0f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 10-17
+MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,# 18-1f
+MachineState.ERROR,     5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     4,MachineState.ERROR,MachineState.ERROR,# 20-27
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     6,MachineState.ITS_ME,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,# 28-2f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,# 30-37
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 38-3f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,MachineState.START,# 40-47
+)
+
+ISO2022JP_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0, 0, 0, 0, 0)
+
+ISO2022JP_SM_MODEL = {'class_table': ISO2022JP_CLS,
+                      'class_factor': 10,
+                      'state_table': ISO2022JP_ST,
+                      'char_len_table': ISO2022JP_CHAR_LEN_TABLE,
+                      'name': "ISO-2022-JP",
+                      'language': 'Japanese'}
+
+ISO2022KR_CLS = (
+2,0,0,0,0,0,0,0,  # 00 - 07
+0,0,0,0,0,0,0,0,  # 08 - 0f
+0,0,0,0,0,0,0,0,  # 10 - 17
+0,0,0,1,0,0,0,0,  # 18 - 1f
+0,0,0,0,3,0,0,0,  # 20 - 27
+0,4,0,0,0,0,0,0,  # 28 - 2f
+0,0,0,0,0,0,0,0,  # 30 - 37
+0,0,0,0,0,0,0,0,  # 38 - 3f
+0,0,0,5,0,0,0,0,  # 40 - 47
+0,0,0,0,0,0,0,0,  # 48 - 4f
+0,0,0,0,0,0,0,0,  # 50 - 57
+0,0,0,0,0,0,0,0,  # 58 - 5f
+0,0,0,0,0,0,0,0,  # 60 - 67
+0,0,0,0,0,0,0,0,  # 68 - 6f
+0,0,0,0,0,0,0,0,  # 70 - 77
+0,0,0,0,0,0,0,0,  # 78 - 7f
+2,2,2,2,2,2,2,2,  # 80 - 87
+2,2,2,2,2,2,2,2,  # 88 - 8f
+2,2,2,2,2,2,2,2,  # 90 - 97
+2,2,2,2,2,2,2,2,  # 98 - 9f
+2,2,2,2,2,2,2,2,  # a0 - a7
+2,2,2,2,2,2,2,2,  # a8 - af
+2,2,2,2,2,2,2,2,  # b0 - b7
+2,2,2,2,2,2,2,2,  # b8 - bf
+2,2,2,2,2,2,2,2,  # c0 - c7
+2,2,2,2,2,2,2,2,  # c8 - cf
+2,2,2,2,2,2,2,2,  # d0 - d7
+2,2,2,2,2,2,2,2,  # d8 - df
+2,2,2,2,2,2,2,2,  # e0 - e7
+2,2,2,2,2,2,2,2,  # e8 - ef
+2,2,2,2,2,2,2,2,  # f0 - f7
+2,2,2,2,2,2,2,2,  # f8 - ff
+)
+
+ISO2022KR_ST = (
+MachineState.START,     3,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,# 00-07
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,# 08-0f
+MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     4,MachineState.ERROR,MachineState.ERROR,# 10-17
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,# 18-1f
+MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.START,MachineState.START,MachineState.START,MachineState.START,# 20-27
+)
+
+ISO2022KR_CHAR_LEN_TABLE = (0, 0, 0, 0, 0, 0)
+
+ISO2022KR_SM_MODEL = {'class_table': ISO2022KR_CLS,
+                      'class_factor': 6,
+                      'state_table': ISO2022KR_ST,
+                      'char_len_table': ISO2022KR_CHAR_LEN_TABLE,
+                      'name': "ISO-2022-KR",
+                      'language': 'Korean'}
+
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/eucjpprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/eucjpprober.py
new file mode 100644
index 000000000..20ce8f7d1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/eucjpprober.py
@@ -0,0 +1,92 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .enums import ProbingState, MachineState
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import EUCJPDistributionAnalysis
+from .jpcntx import EUCJPContextAnalysis
+from .mbcssm import EUCJP_SM_MODEL
+
+
+class EUCJPProber(MultiByteCharSetProber):
+    def __init__(self):
+        super(EUCJPProber, self).__init__()
+        self.coding_sm = CodingStateMachine(EUCJP_SM_MODEL)
+        self.distribution_analyzer = EUCJPDistributionAnalysis()
+        self.context_analyzer = EUCJPContextAnalysis()
+        self.reset()
+
+    def reset(self):
+        super(EUCJPProber, self).reset()
+        self.context_analyzer.reset()
+
+    @property
+    def charset_name(self):
+        return "EUC-JP"
+
+    @property
+    def language(self):
+        return "Japanese"
+
+    def feed(self, byte_str):
+        for i in range(len(byte_str)):
+            # PY3K: byte_str is a byte array, so byte_str[i] is an int, not a byte
+            coding_state = self.coding_sm.next_state(byte_str[i])
+            if coding_state == MachineState.ERROR:
+                self.logger.debug('%s %s prober hit error at byte %s',
+                                  self.charset_name, self.language, i)
+                self._state = ProbingState.NOT_ME
+                break
+            elif coding_state == MachineState.ITS_ME:
+                self._state = ProbingState.FOUND_IT
+                break
+            elif coding_state == MachineState.START:
+                char_len = self.coding_sm.get_current_charlen()
+                if i == 0:
+                    self._last_char[1] = byte_str[0]
+                    self.context_analyzer.feed(self._last_char, char_len)
+                    self.distribution_analyzer.feed(self._last_char, char_len)
+                else:
+                    self.context_analyzer.feed(byte_str[i - 1:i + 1],
+                                                char_len)
+                    self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
+                                                     char_len)
+
+        self._last_char[0] = byte_str[-1]
+
+        if self.state == ProbingState.DETECTING:
+            if (self.context_analyzer.got_enough_data() and
+               (self.get_confidence() > self.SHORTCUT_THRESHOLD)):
+                self._state = ProbingState.FOUND_IT
+
+        return self.state
+
+    def get_confidence(self):
+        context_conf = self.context_analyzer.get_confidence()
+        distrib_conf = self.distribution_analyzer.get_confidence()
+        return max(context_conf, distrib_conf)
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/euckrfreq.py b/venv/Lib/site-packages/pip/_vendor/chardet/euckrfreq.py
new file mode 100644
index 000000000..b68078cb9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/euckrfreq.py
@@ -0,0 +1,195 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# Sampling from about 20M text materials include literature and computer technology
+
+# 128  --> 0.79
+# 256  --> 0.92
+# 512  --> 0.986
+# 1024 --> 0.99944
+# 2048 --> 0.99999
+#
+# Idea Distribution Ratio = 0.98653 / (1-0.98653) = 73.24
+# Random Distribution Ration = 512 / (2350-512) = 0.279.
+#
+# Typical Distribution Ratio
+
+EUCKR_TYPICAL_DISTRIBUTION_RATIO = 6.0
+
+EUCKR_TABLE_SIZE = 2352
+
+# Char to FreqOrder table ,
+EUCKR_CHAR_TO_FREQ_ORDER = (
+  13, 130, 120,1396, 481,1719,1720, 328, 609, 212,1721, 707, 400, 299,1722,  87,
+1397,1723, 104, 536,1117,1203,1724,1267, 685,1268, 508,1725,1726,1727,1728,1398,
+1399,1729,1730,1731, 141, 621, 326,1057, 368,1732, 267, 488,  20,1733,1269,1734,
+ 945,1400,1735,  47, 904,1270,1736,1737, 773, 248,1738, 409, 313, 786, 429,1739,
+ 116, 987, 813,1401, 683,  75,1204, 145,1740,1741,1742,1743,  16, 847, 667, 622,
+ 708,1744,1745,1746, 966, 787, 304, 129,1747,  60, 820, 123, 676,1748,1749,1750,
+1751, 617,1752, 626,1753,1754,1755,1756, 653,1757,1758,1759,1760,1761,1762, 856,
+ 344,1763,1764,1765,1766,  89, 401, 418, 806, 905, 848,1767,1768,1769, 946,1205,
+ 709,1770,1118,1771, 241,1772,1773,1774,1271,1775, 569,1776, 999,1777,1778,1779,
+1780, 337, 751,1058,  28, 628, 254,1781, 177, 906, 270, 349, 891,1079,1782,  19,
+1783, 379,1784, 315,1785, 629, 754,1402, 559,1786, 636, 203,1206,1787, 710, 567,
+1788, 935, 814,1789,1790,1207, 766, 528,1791,1792,1208,1793,1794,1795,1796,1797,
+1403,1798,1799, 533,1059,1404,1405,1156,1406, 936, 884,1080,1800, 351,1801,1802,
+1803,1804,1805, 801,1806,1807,1808,1119,1809,1157, 714, 474,1407,1810, 298, 899,
+ 885,1811,1120, 802,1158,1812, 892,1813,1814,1408, 659,1815,1816,1121,1817,1818,
+1819,1820,1821,1822, 319,1823, 594, 545,1824, 815, 937,1209,1825,1826, 573,1409,
+1022,1827,1210,1828,1829,1830,1831,1832,1833, 556, 722, 807,1122,1060,1834, 697,
+1835, 900, 557, 715,1836,1410, 540,1411, 752,1159, 294, 597,1211, 976, 803, 770,
+1412,1837,1838,  39, 794,1413, 358,1839, 371, 925,1840, 453, 661, 788, 531, 723,
+ 544,1023,1081, 869,  91,1841, 392, 430, 790, 602,1414, 677,1082, 457,1415,1416,
+1842,1843, 475, 327,1024,1417, 795, 121,1844, 733, 403,1418,1845,1846,1847, 300,
+ 119, 711,1212, 627,1848,1272, 207,1849,1850, 796,1213, 382,1851, 519,1852,1083,
+ 893,1853,1854,1855, 367, 809, 487, 671,1856, 663,1857,1858, 956, 471, 306, 857,
+1859,1860,1160,1084,1861,1862,1863,1864,1865,1061,1866,1867,1868,1869,1870,1871,
+ 282,  96, 574,1872, 502,1085,1873,1214,1874, 907,1875,1876, 827, 977,1419,1420,
+1421, 268,1877,1422,1878,1879,1880, 308,1881,   2, 537,1882,1883,1215,1884,1885,
+ 127, 791,1886,1273,1423,1887,  34, 336, 404, 643,1888, 571, 654, 894, 840,1889,
+   0, 886,1274, 122, 575, 260, 908, 938,1890,1275, 410, 316,1891,1892, 100,1893,
+1894,1123,  48,1161,1124,1025,1895, 633, 901,1276,1896,1897, 115, 816,1898, 317,
+1899, 694,1900, 909, 734,1424, 572, 866,1425, 691,  85, 524,1010, 543, 394, 841,
+1901,1902,1903,1026,1904,1905,1906,1907,1908,1909,  30, 451, 651, 988, 310,1910,
+1911,1426, 810,1216,  93,1912,1913,1277,1217,1914, 858, 759,  45,  58, 181, 610,
+ 269,1915,1916, 131,1062, 551, 443,1000, 821,1427, 957, 895,1086,1917,1918, 375,
+1919, 359,1920, 687,1921, 822,1922, 293,1923,1924,  40, 662, 118, 692,  29, 939,
+ 887, 640, 482, 174,1925,  69,1162, 728,1428, 910,1926,1278,1218,1279, 386, 870,
+ 217, 854,1163, 823,1927,1928,1929,1930, 834,1931,  78,1932, 859,1933,1063,1934,
+1935,1936,1937, 438,1164, 208, 595,1938,1939,1940,1941,1219,1125,1942, 280, 888,
+1429,1430,1220,1431,1943,1944,1945,1946,1947,1280, 150, 510,1432,1948,1949,1950,
+1951,1952,1953,1954,1011,1087,1955,1433,1043,1956, 881,1957, 614, 958,1064,1065,
+1221,1958, 638,1001, 860, 967, 896,1434, 989, 492, 553,1281,1165,1959,1282,1002,
+1283,1222,1960,1961,1962,1963,  36, 383, 228, 753, 247, 454,1964, 876, 678,1965,
+1966,1284, 126, 464, 490, 835, 136, 672, 529, 940,1088,1435, 473,1967,1968, 467,
+  50, 390, 227, 587, 279, 378, 598, 792, 968, 240, 151, 160, 849, 882,1126,1285,
+ 639,1044, 133, 140, 288, 360, 811, 563,1027, 561, 142, 523,1969,1970,1971,   7,
+ 103, 296, 439, 407, 506, 634, 990,1972,1973,1974,1975, 645,1976,1977,1978,1979,
+1980,1981, 236,1982,1436,1983,1984,1089, 192, 828, 618, 518,1166, 333,1127,1985,
+ 818,1223,1986,1987,1988,1989,1990,1991,1992,1993, 342,1128,1286, 746, 842,1994,
+1995, 560, 223,1287,  98,   8, 189, 650, 978,1288,1996,1437,1997,  17, 345, 250,
+ 423, 277, 234, 512, 226,  97, 289,  42, 167,1998, 201,1999,2000, 843, 836, 824,
+ 532, 338, 783,1090, 182, 576, 436,1438,1439, 527, 500,2001, 947, 889,2002,2003,
+2004,2005, 262, 600, 314, 447,2006, 547,2007, 693, 738,1129,2008,  71,1440, 745,
+ 619, 688,2009, 829,2010,2011, 147,2012,  33, 948,2013,2014,  74, 224,2015,  61,
+ 191, 918, 399, 637,2016,1028,1130, 257, 902,2017,2018,2019,2020,2021,2022,2023,
+2024,2025,2026, 837,2027,2028,2029,2030, 179, 874, 591,  52, 724, 246,2031,2032,
+2033,2034,1167, 969,2035,1289, 630, 605, 911,1091,1168,2036,2037,2038,1441, 912,
+2039, 623,2040,2041, 253,1169,1290,2042,1442, 146, 620, 611, 577, 433,2043,1224,
+ 719,1170, 959, 440, 437, 534,  84, 388, 480,1131, 159, 220, 198, 679,2044,1012,
+ 819,1066,1443, 113,1225, 194, 318,1003,1029,2045,2046,2047,2048,1067,2049,2050,
+2051,2052,2053,  59, 913, 112,2054, 632,2055, 455, 144, 739,1291,2056, 273, 681,
+ 499,2057, 448,2058,2059, 760,2060,2061, 970, 384, 169, 245,1132,2062,2063, 414,
+1444,2064,2065,  41, 235,2066, 157, 252, 877, 568, 919, 789, 580,2067, 725,2068,
+2069,1292,2070,2071,1445,2072,1446,2073,2074,  55, 588,  66,1447, 271,1092,2075,
+1226,2076, 960,1013, 372,2077,2078,2079,2080,2081,1293,2082,2083,2084,2085, 850,
+2086,2087,2088,2089,2090, 186,2091,1068, 180,2092,2093,2094, 109,1227, 522, 606,
+2095, 867,1448,1093, 991,1171, 926, 353,1133,2096, 581,2097,2098,2099,1294,1449,
+1450,2100, 596,1172,1014,1228,2101,1451,1295,1173,1229,2102,2103,1296,1134,1452,
+ 949,1135,2104,2105,1094,1453,1454,1455,2106,1095,2107,2108,2109,2110,2111,2112,
+2113,2114,2115,2116,2117, 804,2118,2119,1230,1231, 805,1456, 405,1136,2120,2121,
+2122,2123,2124, 720, 701,1297, 992,1457, 927,1004,2125,2126,2127,2128,2129,2130,
+  22, 417,2131, 303,2132, 385,2133, 971, 520, 513,2134,1174,  73,1096, 231, 274,
+ 962,1458, 673,2135,1459,2136, 152,1137,2137,2138,2139,2140,1005,1138,1460,1139,
+2141,2142,2143,2144,  11, 374, 844,2145, 154,1232,  46,1461,2146, 838, 830, 721,
+1233, 106,2147,  90, 428, 462, 578, 566,1175, 352,2148,2149, 538,1234, 124,1298,
+2150,1462, 761, 565,2151, 686,2152, 649,2153,  72, 173,2154, 460, 415,2155,1463,
+2156,1235, 305,2157,2158,2159,2160,2161,2162, 579,2163,2164,2165,2166,2167, 747,
+2168,2169,2170,2171,1464, 669,2172,2173,2174,2175,2176,1465,2177,  23, 530, 285,
+2178, 335, 729,2179, 397,2180,2181,2182,1030,2183,2184, 698,2185,2186, 325,2187,
+2188, 369,2189, 799,1097,1015, 348,2190,1069, 680,2191, 851,1466,2192,2193,  10,
+2194, 613, 424,2195, 979, 108, 449, 589,  27, 172,  81,1031,  80, 774, 281, 350,
+1032, 525, 301, 582,1176,2196, 674,1045,2197,2198,1467, 730, 762,2199,2200,2201,
+2202,1468,2203, 993,2204,2205, 266,1070, 963,1140,2206,2207,2208, 664,1098, 972,
+2209,2210,2211,1177,1469,1470, 871,2212,2213,2214,2215,2216,1471,2217,2218,2219,
+2220,2221,2222,2223,2224,2225,2226,2227,1472,1236,2228,2229,2230,2231,2232,2233,
+2234,2235,1299,2236,2237, 200,2238, 477, 373,2239,2240, 731, 825, 777,2241,2242,
+2243, 521, 486, 548,2244,2245,2246,1473,1300,  53, 549, 137, 875,  76, 158,2247,
+1301,1474, 469, 396,1016, 278, 712,2248, 321, 442, 503, 767, 744, 941,1237,1178,
+1475,2249,  82, 178,1141,1179, 973,2250,1302,2251, 297,2252,2253, 570,2254,2255,
+2256,  18, 450, 206,2257, 290, 292,1142,2258, 511, 162,  99, 346, 164, 735,2259,
+1476,1477,   4, 554, 343, 798,1099,2260,1100,2261,  43, 171,1303, 139, 215,2262,
+2263, 717, 775,2264,1033, 322, 216,2265, 831,2266, 149,2267,1304,2268,2269, 702,
+1238, 135, 845, 347, 309,2270, 484,2271, 878, 655, 238,1006,1478,2272,  67,2273,
+ 295,2274,2275, 461,2276, 478, 942, 412,2277,1034,2278,2279,2280, 265,2281, 541,
+2282,2283,2284,2285,2286,  70, 852,1071,2287,2288,2289,2290,  21,  56, 509, 117,
+ 432,2291,2292, 331, 980, 552,1101, 148, 284, 105, 393,1180,1239, 755,2293, 187,
+2294,1046,1479,2295, 340,2296,  63,1047, 230,2297,2298,1305, 763,1306, 101, 800,
+ 808, 494,2299,2300,2301, 903,2302,  37,1072,  14,   5,2303,  79, 675,2304, 312,
+2305,2306,2307,2308,2309,1480,   6,1307,2310,2311,2312,   1, 470,  35,  24, 229,
+2313, 695, 210,  86, 778,  15, 784, 592, 779,  32,  77, 855, 964,2314, 259,2315,
+ 501, 380,2316,2317,  83, 981, 153, 689,1308,1481,1482,1483,2318,2319, 716,1484,
+2320,2321,2322,2323,2324,2325,1485,2326,2327, 128,  57,  68, 261,1048, 211, 170,
+1240,  31,2328,  51, 435, 742,2329,2330,2331, 635,2332, 264, 456,2333,2334,2335,
+ 425,2336,1486, 143, 507, 263, 943,2337, 363, 920,1487, 256,1488,1102, 243, 601,
+1489,2338,2339,2340,2341,2342,2343,2344, 861,2345,2346,2347,2348,2349,2350, 395,
+2351,1490,1491,  62, 535, 166, 225,2352,2353, 668, 419,1241, 138, 604, 928,2354,
+1181,2355,1492,1493,2356,2357,2358,1143,2359, 696,2360, 387, 307,1309, 682, 476,
+2361,2362, 332,  12, 222, 156,2363, 232,2364, 641, 276, 656, 517,1494,1495,1035,
+ 416, 736,1496,2365,1017, 586,2366,2367,2368,1497,2369, 242,2370,2371,2372,1498,
+2373, 965, 713,2374,2375,2376,2377, 740, 982,1499, 944,1500,1007,2378,2379,1310,
+1501,2380,2381,2382, 785, 329,2383,2384,1502,2385,2386,2387, 932,2388,1503,2389,
+2390,2391,2392,1242,2393,2394,2395,2396,2397, 994, 950,2398,2399,2400,2401,1504,
+1311,2402,2403,2404,2405,1049, 749,2406,2407, 853, 718,1144,1312,2408,1182,1505,
+2409,2410, 255, 516, 479, 564, 550, 214,1506,1507,1313, 413, 239, 444, 339,1145,
+1036,1508,1509,1314,1037,1510,1315,2411,1511,2412,2413,2414, 176, 703, 497, 624,
+ 593, 921, 302,2415, 341, 165,1103,1512,2416,1513,2417,2418,2419, 376,2420, 700,
+2421,2422,2423, 258, 768,1316,2424,1183,2425, 995, 608,2426,2427,2428,2429, 221,
+2430,2431,2432,2433,2434,2435,2436,2437, 195, 323, 726, 188, 897, 983,1317, 377,
+ 644,1050, 879,2438, 452,2439,2440,2441,2442,2443,2444, 914,2445,2446,2447,2448,
+ 915, 489,2449,1514,1184,2450,2451, 515,  64, 427, 495,2452, 583,2453, 483, 485,
+1038, 562, 213,1515, 748, 666,2454,2455,2456,2457, 334,2458, 780, 996,1008, 705,
+1243,2459,2460,2461,2462,2463, 114,2464, 493,1146, 366, 163,1516, 961,1104,2465,
+ 291,2466,1318,1105,2467,1517, 365,2468, 355, 951,1244,2469,1319,2470, 631,2471,
+2472, 218,1320, 364, 320, 756,1518,1519,1321,1520,1322,2473,2474,2475,2476, 997,
+2477,2478,2479,2480, 665,1185,2481, 916,1521,2482,2483,2484, 584, 684,2485,2486,
+ 797,2487,1051,1186,2488,2489,2490,1522,2491,2492, 370,2493,1039,1187,  65,2494,
+ 434, 205, 463,1188,2495, 125, 812, 391, 402, 826, 699, 286, 398, 155, 781, 771,
+ 585,2496, 590, 505,1073,2497, 599, 244, 219, 917,1018, 952, 646,1523,2498,1323,
+2499,2500,  49, 984, 354, 741,2501, 625,2502,1324,2503,1019, 190, 357, 757, 491,
+  95, 782, 868,2504,2505,2506,2507,2508,2509, 134,1524,1074, 422,1525, 898,2510,
+ 161,2511,2512,2513,2514, 769,2515,1526,2516,2517, 411,1325,2518, 472,1527,2519,
+2520,2521,2522,2523,2524, 985,2525,2526,2527,2528,2529,2530, 764,2531,1245,2532,
+2533,  25, 204, 311,2534, 496,2535,1052,2536,2537,2538,2539,2540,2541,2542, 199,
+ 704, 504, 468, 758, 657,1528, 196,  44, 839,1246, 272, 750,2543, 765, 862,2544,
+2545,1326,2546, 132, 615, 933,2547, 732,2548,2549,2550,1189,1529,2551, 283,1247,
+1053, 607, 929,2552,2553,2554, 930, 183, 872, 616,1040,1147,2555,1148,1020, 441,
+ 249,1075,2556,2557,2558, 466, 743,2559,2560,2561,  92, 514, 426, 420, 526,2562,
+2563,2564,2565,2566,2567,2568, 185,2569,2570,2571,2572, 776,1530, 658,2573, 362,
+2574, 361, 922,1076, 793,2575,2576,2577,2578,2579,2580,1531, 251,2581,2582,2583,
+2584,1532,  54, 612, 237,1327,2585,2586, 275, 408, 647, 111,2587,1533,1106, 465,
+   3, 458,   9,  38,2588, 107, 110, 890, 209,  26, 737, 498,2589,1534,2590, 431,
+ 202,  88,1535, 356, 287,1107, 660,1149,2591, 381,1536, 986,1150, 445,1248,1151,
+ 974,2592,2593, 846,2594, 446, 953, 184,1249,1250, 727,2595, 923, 193, 883,2596,
+2597,2598, 102, 324, 539, 817,2599, 421,1041,2600, 832,2601,  94, 175, 197, 406,
+2602, 459,2603,2604,2605,2606,2607, 330, 555,2608,2609,2610, 706,1108, 389,2611,
+2612,2613,2614, 233,2615, 833, 558, 931, 954,1251,2616,2617,1537, 546,2618,2619,
+1009,2620,2621,2622,1538, 690,1328,2623, 955,2624,1539,2625,2626, 772,2627,2628,
+2629,2630,2631, 924, 648, 863, 603,2632,2633, 934,1540, 864, 865,2634, 642,1042,
+ 670,1190,2635,2636,2637,2638, 168,2639, 652, 873, 542,1054,1541,2640,2641,2642,  # 512, 256
+)
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/euckrprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/euckrprober.py
new file mode 100644
index 000000000..345a060d0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/euckrprober.py
@@ -0,0 +1,47 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import EUCKRDistributionAnalysis
+from .mbcssm import EUCKR_SM_MODEL
+
+
+class EUCKRProber(MultiByteCharSetProber):
+    def __init__(self):
+        super(EUCKRProber, self).__init__()
+        self.coding_sm = CodingStateMachine(EUCKR_SM_MODEL)
+        self.distribution_analyzer = EUCKRDistributionAnalysis()
+        self.reset()
+
+    @property
+    def charset_name(self):
+        return "EUC-KR"
+
+    @property
+    def language(self):
+        return "Korean"
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/euctwfreq.py b/venv/Lib/site-packages/pip/_vendor/chardet/euctwfreq.py
new file mode 100644
index 000000000..ed7a995a3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/euctwfreq.py
@@ -0,0 +1,387 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# EUCTW frequency table
+# Converted from big5 work
+# by Taiwan's Mandarin Promotion Council
+# <http:#www.edu.tw:81/mandr/>
+
+# 128  --> 0.42261
+# 256  --> 0.57851
+# 512  --> 0.74851
+# 1024 --> 0.89384
+# 2048 --> 0.97583
+#
+# Idea Distribution Ratio = 0.74851/(1-0.74851) =2.98
+# Random Distribution Ration = 512/(5401-512)=0.105
+#
+# Typical Distribution Ratio about 25% of Ideal one, still much higher than RDR
+
+EUCTW_TYPICAL_DISTRIBUTION_RATIO = 0.75
+
+# Char to FreqOrder table ,
+EUCTW_TABLE_SIZE = 5376
+
+EUCTW_CHAR_TO_FREQ_ORDER = (
+   1,1800,1506, 255,1431, 198,   9,  82,   6,7310, 177, 202,3615,1256,2808, 110,  # 2742
+3735,  33,3241, 261,  76,  44,2113,  16,2931,2184,1176, 659,3868,  26,3404,2643,  # 2758
+1198,3869,3313,4060, 410,2211, 302, 590, 361,1963,   8, 204,  58,4296,7311,1931,  # 2774
+  63,7312,7313, 317,1614,  75, 222, 159,4061,2412,1480,7314,3500,3068, 224,2809,  # 2790
+3616,   3,  10,3870,1471,  29,2774,1135,2852,1939, 873, 130,3242,1123, 312,7315,  # 2806
+4297,2051, 507, 252, 682,7316, 142,1914, 124, 206,2932,  34,3501,3173,  64, 604,  # 2822
+7317,2494,1976,1977, 155,1990, 645, 641,1606,7318,3405, 337,  72, 406,7319,  80,  # 2838
+ 630, 238,3174,1509, 263, 939,1092,2644, 756,1440,1094,3406, 449,  69,2969, 591,  # 2854
+ 179,2095, 471, 115,2034,1843,  60,  50,2970, 134, 806,1868, 734,2035,3407, 180,  # 2870
+ 995,1607, 156, 537,2893, 688,7320, 319,1305, 779,2144, 514,2374, 298,4298, 359,  # 2886
+2495,  90,2707,1338, 663,  11, 906,1099,2545,  20,2436, 182, 532,1716,7321, 732,  # 2902
+1376,4062,1311,1420,3175,  25,2312,1056, 113, 399, 382,1949, 242,3408,2467, 529,  # 2918
+3243, 475,1447,3617,7322, 117,  21, 656, 810,1297,2295,2329,3502,7323, 126,4063,  # 2934
+ 706, 456, 150, 613,4299,  71,1118,2036,4064, 145,3069,  85, 835, 486,2114,1246,  # 2950
+1426, 428, 727,1285,1015, 800, 106, 623, 303,1281,7324,2127,2354, 347,3736, 221,  # 2966
+3503,3110,7325,1955,1153,4065,  83, 296,1199,3070, 192, 624,  93,7326, 822,1897,  # 2982
+2810,3111, 795,2064, 991,1554,1542,1592,  27,  43,2853, 859, 139,1456, 860,4300,  # 2998
+ 437, 712,3871, 164,2392,3112, 695, 211,3017,2096, 195,3872,1608,3504,3505,3618,  # 3014
+3873, 234, 811,2971,2097,3874,2229,1441,3506,1615,2375, 668,2076,1638, 305, 228,  # 3030
+1664,4301, 467, 415,7327, 262,2098,1593, 239, 108, 300, 200,1033, 512,1247,2077,  # 3046
+7328,7329,2173,3176,3619,2673, 593, 845,1062,3244,  88,1723,2037,3875,1950, 212,  # 3062
+ 266, 152, 149, 468,1898,4066,4302,  77, 187,7330,3018,  37,   5,2972,7331,3876,  # 3078
+7332,7333,  39,2517,4303,2894,3177,2078,  55, 148,  74,4304, 545, 483,1474,1029,  # 3094
+1665, 217,1869,1531,3113,1104,2645,4067,  24, 172,3507, 900,3877,3508,3509,4305,  # 3110
+  32,1408,2811,1312, 329, 487,2355,2247,2708, 784,2674,   4,3019,3314,1427,1788,  # 3126
+ 188, 109, 499,7334,3620,1717,1789, 888,1217,3020,4306,7335,3510,7336,3315,1520,  # 3142
+3621,3878, 196,1034, 775,7337,7338, 929,1815, 249, 439,  38,7339,1063,7340, 794,  # 3158
+3879,1435,2296,  46, 178,3245,2065,7341,2376,7342, 214,1709,4307, 804,  35, 707,  # 3174
+ 324,3622,1601,2546, 140, 459,4068,7343,7344,1365, 839, 272, 978,2257,2572,3409,  # 3190
+2128,1363,3623,1423, 697, 100,3071,  48,  70,1231, 495,3114,2193,7345,1294,7346,  # 3206
+2079, 462, 586,1042,3246, 853, 256, 988, 185,2377,3410,1698, 434,1084,7347,3411,  # 3222
+ 314,2615,2775,4308,2330,2331, 569,2280, 637,1816,2518, 757,1162,1878,1616,3412,  # 3238
+ 287,1577,2115, 768,4309,1671,2854,3511,2519,1321,3737, 909,2413,7348,4069, 933,  # 3254
+3738,7349,2052,2356,1222,4310, 765,2414,1322, 786,4311,7350,1919,1462,1677,2895,  # 3270
+1699,7351,4312,1424,2437,3115,3624,2590,3316,1774,1940,3413,3880,4070, 309,1369,  # 3286
+1130,2812, 364,2230,1653,1299,3881,3512,3882,3883,2646, 525,1085,3021, 902,2000,  # 3302
+1475, 964,4313, 421,1844,1415,1057,2281, 940,1364,3116, 376,4314,4315,1381,   7,  # 3318
+2520, 983,2378, 336,1710,2675,1845, 321,3414, 559,1131,3022,2742,1808,1132,1313,  # 3334
+ 265,1481,1857,7352, 352,1203,2813,3247, 167,1089, 420,2814, 776, 792,1724,3513,  # 3350
+4071,2438,3248,7353,4072,7354, 446, 229, 333,2743, 901,3739,1200,1557,4316,2647,  # 3366
+1920, 395,2744,2676,3740,4073,1835, 125, 916,3178,2616,4317,7355,7356,3741,7357,  # 3382
+7358,7359,4318,3117,3625,1133,2547,1757,3415,1510,2313,1409,3514,7360,2145, 438,  # 3398
+2591,2896,2379,3317,1068, 958,3023, 461, 311,2855,2677,4074,1915,3179,4075,1978,  # 3414
+ 383, 750,2745,2617,4076, 274, 539, 385,1278,1442,7361,1154,1964, 384, 561, 210,  # 3430
+  98,1295,2548,3515,7362,1711,2415,1482,3416,3884,2897,1257, 129,7363,3742, 642,  # 3446
+ 523,2776,2777,2648,7364, 141,2231,1333,  68, 176, 441, 876, 907,4077, 603,2592,  # 3462
+ 710, 171,3417, 404, 549,  18,3118,2393,1410,3626,1666,7365,3516,4319,2898,4320,  # 3478
+7366,2973, 368,7367, 146, 366,  99, 871,3627,1543, 748, 807,1586,1185,  22,2258,  # 3494
+ 379,3743,3180,7368,3181, 505,1941,2618,1991,1382,2314,7369, 380,2357, 218, 702,  # 3510
+1817,1248,3418,3024,3517,3318,3249,7370,2974,3628, 930,3250,3744,7371,  59,7372,  # 3526
+ 585, 601,4078, 497,3419,1112,1314,4321,1801,7373,1223,1472,2174,7374, 749,1836,  # 3542
+ 690,1899,3745,1772,3885,1476, 429,1043,1790,2232,2116, 917,4079, 447,1086,1629,  # 3558
+7375, 556,7376,7377,2020,1654, 844,1090, 105, 550, 966,1758,2815,1008,1782, 686,  # 3574
+1095,7378,2282, 793,1602,7379,3518,2593,4322,4080,2933,2297,4323,3746, 980,2496,  # 3590
+ 544, 353, 527,4324, 908,2678,2899,7380, 381,2619,1942,1348,7381,1341,1252, 560,  # 3606
+3072,7382,3420,2856,7383,2053, 973, 886,2080, 143,4325,7384,7385, 157,3886, 496,  # 3622
+4081,  57, 840, 540,2038,4326,4327,3421,2117,1445, 970,2259,1748,1965,2081,4082,  # 3638
+3119,1234,1775,3251,2816,3629, 773,1206,2129,1066,2039,1326,3887,1738,1725,4083,  # 3654
+ 279,3120,  51,1544,2594, 423,1578,2130,2066, 173,4328,1879,7386,7387,1583, 264,  # 3670
+ 610,3630,4329,2439, 280, 154,7388,7389,7390,1739, 338,1282,3073, 693,2857,1411,  # 3686
+1074,3747,2440,7391,4330,7392,7393,1240, 952,2394,7394,2900,1538,2679, 685,1483,  # 3702
+4084,2468,1436, 953,4085,2054,4331, 671,2395,  79,4086,2441,3252, 608, 567,2680,  # 3718
+3422,4087,4088,1691, 393,1261,1791,2396,7395,4332,7396,7397,7398,7399,1383,1672,  # 3734
+3748,3182,1464, 522,1119, 661,1150, 216, 675,4333,3888,1432,3519, 609,4334,2681,  # 3750
+2397,7400,7401,7402,4089,3025,   0,7403,2469, 315, 231,2442, 301,3319,4335,2380,  # 3766
+7404, 233,4090,3631,1818,4336,4337,7405,  96,1776,1315,2082,7406, 257,7407,1809,  # 3782
+3632,2709,1139,1819,4091,2021,1124,2163,2778,1777,2649,7408,3074, 363,1655,3183,  # 3798
+7409,2975,7410,7411,7412,3889,1567,3890, 718, 103,3184, 849,1443, 341,3320,2934,  # 3814
+1484,7413,1712, 127,  67, 339,4092,2398, 679,1412, 821,7414,7415, 834, 738, 351,  # 3830
+2976,2146, 846, 235,1497,1880, 418,1992,3749,2710, 186,1100,2147,2746,3520,1545,  # 3846
+1355,2935,2858,1377, 583,3891,4093,2573,2977,7416,1298,3633,1078,2549,3634,2358,  # 3862
+  78,3750,3751, 267,1289,2099,2001,1594,4094, 348, 369,1274,2194,2175,1837,4338,  # 3878
+1820,2817,3635,2747,2283,2002,4339,2936,2748, 144,3321, 882,4340,3892,2749,3423,  # 3894
+4341,2901,7417,4095,1726, 320,7418,3893,3026, 788,2978,7419,2818,1773,1327,2859,  # 3910
+3894,2819,7420,1306,4342,2003,1700,3752,3521,2359,2650, 787,2022, 506, 824,3636,  # 3926
+ 534, 323,4343,1044,3322,2023,1900, 946,3424,7421,1778,1500,1678,7422,1881,4344,  # 3942
+ 165, 243,4345,3637,2521, 123, 683,4096, 764,4346,  36,3895,1792, 589,2902, 816,  # 3958
+ 626,1667,3027,2233,1639,1555,1622,3753,3896,7423,3897,2860,1370,1228,1932, 891,  # 3974
+2083,2903, 304,4097,7424, 292,2979,2711,3522, 691,2100,4098,1115,4347, 118, 662,  # 3990
+7425, 611,1156, 854,2381,1316,2861,   2, 386, 515,2904,7426,7427,3253, 868,2234,  # 4006
+1486, 855,2651, 785,2212,3028,7428,1040,3185,3523,7429,3121, 448,7430,1525,7431,  # 4022
+2164,4348,7432,3754,7433,4099,2820,3524,3122, 503, 818,3898,3123,1568, 814, 676,  # 4038
+1444, 306,1749,7434,3755,1416,1030, 197,1428, 805,2821,1501,4349,7435,7436,7437,  # 4054
+1993,7438,4350,7439,7440,2195,  13,2779,3638,2980,3124,1229,1916,7441,3756,2131,  # 4070
+7442,4100,4351,2399,3525,7443,2213,1511,1727,1120,7444,7445, 646,3757,2443, 307,  # 4086
+7446,7447,1595,3186,7448,7449,7450,3639,1113,1356,3899,1465,2522,2523,7451, 519,  # 4102
+7452, 128,2132,  92,2284,1979,7453,3900,1512, 342,3125,2196,7454,2780,2214,1980,  # 4118
+3323,7455, 290,1656,1317, 789, 827,2360,7456,3758,4352, 562, 581,3901,7457, 401,  # 4134
+4353,2248,  94,4354,1399,2781,7458,1463,2024,4355,3187,1943,7459, 828,1105,4101,  # 4150
+1262,1394,7460,4102, 605,4356,7461,1783,2862,7462,2822, 819,2101, 578,2197,2937,  # 4166
+7463,1502, 436,3254,4103,3255,2823,3902,2905,3425,3426,7464,2712,2315,7465,7466,  # 4182
+2332,2067,  23,4357, 193, 826,3759,2102, 699,1630,4104,3075, 390,1793,1064,3526,  # 4198
+7467,1579,3076,3077,1400,7468,4105,1838,1640,2863,7469,4358,4359, 137,4106, 598,  # 4214
+3078,1966, 780, 104, 974,2938,7470, 278, 899, 253, 402, 572, 504, 493,1339,7471,  # 4230
+3903,1275,4360,2574,2550,7472,3640,3029,3079,2249, 565,1334,2713, 863,  41,7473,  # 4246
+7474,4361,7475,1657,2333,  19, 463,2750,4107, 606,7476,2981,3256,1087,2084,1323,  # 4262
+2652,2982,7477,1631,1623,1750,4108,2682,7478,2864, 791,2714,2653,2334, 232,2416,  # 4278
+7479,2983,1498,7480,2654,2620, 755,1366,3641,3257,3126,2025,1609, 119,1917,3427,  # 4294
+ 862,1026,4109,7481,3904,3760,4362,3905,4363,2260,1951,2470,7482,1125, 817,4110,  # 4310
+4111,3906,1513,1766,2040,1487,4112,3030,3258,2824,3761,3127,7483,7484,1507,7485,  # 4326
+2683, 733,  40,1632,1106,2865, 345,4113, 841,2524, 230,4364,2984,1846,3259,3428,  # 4342
+7486,1263, 986,3429,7487, 735, 879, 254,1137, 857, 622,1300,1180,1388,1562,3907,  # 4358
+3908,2939, 967,2751,2655,1349, 592,2133,1692,3324,2985,1994,4114,1679,3909,1901,  # 4374
+2185,7488, 739,3642,2715,1296,1290,7489,4115,2198,2199,1921,1563,2595,2551,1870,  # 4390
+2752,2986,7490, 435,7491, 343,1108, 596,  17,1751,4365,2235,3430,3643,7492,4366,  # 4406
+ 294,3527,2940,1693, 477, 979, 281,2041,3528, 643,2042,3644,2621,2782,2261,1031,  # 4422
+2335,2134,2298,3529,4367, 367,1249,2552,7493,3530,7494,4368,1283,3325,2004, 240,  # 4438
+1762,3326,4369,4370, 836,1069,3128, 474,7495,2148,2525, 268,3531,7496,3188,1521,  # 4454
+1284,7497,1658,1546,4116,7498,3532,3533,7499,4117,3327,2684,1685,4118, 961,1673,  # 4470
+2622, 190,2005,2200,3762,4371,4372,7500, 570,2497,3645,1490,7501,4373,2623,3260,  # 4486
+1956,4374, 584,1514, 396,1045,1944,7502,4375,1967,2444,7503,7504,4376,3910, 619,  # 4502
+7505,3129,3261, 215,2006,2783,2553,3189,4377,3190,4378, 763,4119,3763,4379,7506,  # 4518
+7507,1957,1767,2941,3328,3646,1174, 452,1477,4380,3329,3130,7508,2825,1253,2382,  # 4534
+2186,1091,2285,4120, 492,7509, 638,1169,1824,2135,1752,3911, 648, 926,1021,1324,  # 4550
+4381, 520,4382, 997, 847,1007, 892,4383,3764,2262,1871,3647,7510,2400,1784,4384,  # 4566
+1952,2942,3080,3191,1728,4121,2043,3648,4385,2007,1701,3131,1551,  30,2263,4122,  # 4582
+7511,2026,4386,3534,7512, 501,7513,4123, 594,3431,2165,1821,3535,3432,3536,3192,  # 4598
+ 829,2826,4124,7514,1680,3132,1225,4125,7515,3262,4387,4126,3133,2336,7516,4388,  # 4614
+4127,7517,3912,3913,7518,1847,2383,2596,3330,7519,4389, 374,3914, 652,4128,4129,  # 4630
+ 375,1140, 798,7520,7521,7522,2361,4390,2264, 546,1659, 138,3031,2445,4391,7523,  # 4646
+2250, 612,1848, 910, 796,3765,1740,1371, 825,3766,3767,7524,2906,2554,7525, 692,  # 4662
+ 444,3032,2624, 801,4392,4130,7526,1491, 244,1053,3033,4131,4132, 340,7527,3915,  # 4678
+1041,2987, 293,1168,  87,1357,7528,1539, 959,7529,2236, 721, 694,4133,3768, 219,  # 4694
+1478, 644,1417,3331,2656,1413,1401,1335,1389,3916,7530,7531,2988,2362,3134,1825,  # 4710
+ 730,1515, 184,2827,  66,4393,7532,1660,2943, 246,3332, 378,1457, 226,3433, 975,  # 4726
+3917,2944,1264,3537, 674, 696,7533, 163,7534,1141,2417,2166, 713,3538,3333,4394,  # 4742
+3918,7535,7536,1186,  15,7537,1079,1070,7538,1522,3193,3539, 276,1050,2716, 758,  # 4758
+1126, 653,2945,3263,7539,2337, 889,3540,3919,3081,2989, 903,1250,4395,3920,3434,  # 4774
+3541,1342,1681,1718, 766,3264, 286,  89,2946,3649,7540,1713,7541,2597,3334,2990,  # 4790
+7542,2947,2215,3194,2866,7543,4396,2498,2526, 181, 387,1075,3921, 731,2187,3335,  # 4806
+7544,3265, 310, 313,3435,2299, 770,4134,  54,3034, 189,4397,3082,3769,3922,7545,  # 4822
+1230,1617,1849, 355,3542,4135,4398,3336, 111,4136,3650,1350,3135,3436,3035,4137,  # 4838
+2149,3266,3543,7546,2784,3923,3924,2991, 722,2008,7547,1071, 247,1207,2338,2471,  # 4854
+1378,4399,2009, 864,1437,1214,4400, 373,3770,1142,2216, 667,4401, 442,2753,2555,  # 4870
+3771,3925,1968,4138,3267,1839, 837, 170,1107, 934,1336,1882,7548,7549,2118,4139,  # 4886
+2828, 743,1569,7550,4402,4140, 582,2384,1418,3437,7551,1802,7552, 357,1395,1729,  # 4902
+3651,3268,2418,1564,2237,7553,3083,3772,1633,4403,1114,2085,4141,1532,7554, 482,  # 4918
+2446,4404,7555,7556,1492, 833,1466,7557,2717,3544,1641,2829,7558,1526,1272,3652,  # 4934
+4142,1686,1794, 416,2556,1902,1953,1803,7559,3773,2785,3774,1159,2316,7560,2867,  # 4950
+4405,1610,1584,3036,2419,2754, 443,3269,1163,3136,7561,7562,3926,7563,4143,2499,  # 4966
+3037,4406,3927,3137,2103,1647,3545,2010,1872,4144,7564,4145, 431,3438,7565, 250,  # 4982
+  97,  81,4146,7566,1648,1850,1558, 160, 848,7567, 866, 740,1694,7568,2201,2830,  # 4998
+3195,4147,4407,3653,1687, 950,2472, 426, 469,3196,3654,3655,3928,7569,7570,1188,  # 5014
+ 424,1995, 861,3546,4148,3775,2202,2685, 168,1235,3547,4149,7571,2086,1674,4408,  # 5030
+3337,3270, 220,2557,1009,7572,3776, 670,2992, 332,1208, 717,7573,7574,3548,2447,  # 5046
+3929,3338,7575, 513,7576,1209,2868,3339,3138,4409,1080,7577,7578,7579,7580,2527,  # 5062
+3656,3549, 815,1587,3930,3931,7581,3550,3439,3777,1254,4410,1328,3038,1390,3932,  # 5078
+1741,3933,3778,3934,7582, 236,3779,2448,3271,7583,7584,3657,3780,1273,3781,4411,  # 5094
+7585, 308,7586,4412, 245,4413,1851,2473,1307,2575, 430, 715,2136,2449,7587, 270,  # 5110
+ 199,2869,3935,7588,3551,2718,1753, 761,1754, 725,1661,1840,4414,3440,3658,7589,  # 5126
+7590, 587,  14,3272, 227,2598, 326, 480,2265, 943,2755,3552, 291, 650,1883,7591,  # 5142
+1702,1226, 102,1547,  62,3441, 904,4415,3442,1164,4150,7592,7593,1224,1548,2756,  # 5158
+ 391, 498,1493,7594,1386,1419,7595,2055,1177,4416, 813, 880,1081,2363, 566,1145,  # 5174
+4417,2286,1001,1035,2558,2599,2238, 394,1286,7596,7597,2068,7598,  86,1494,1730,  # 5190
+3936, 491,1588, 745, 897,2948, 843,3340,3937,2757,2870,3273,1768, 998,2217,2069,  # 5206
+ 397,1826,1195,1969,3659,2993,3341, 284,7599,3782,2500,2137,2119,1903,7600,3938,  # 5222
+2150,3939,4151,1036,3443,1904, 114,2559,4152, 209,1527,7601,7602,2949,2831,2625,  # 5238
+2385,2719,3139, 812,2560,7603,3274,7604,1559, 737,1884,3660,1210, 885,  28,2686,  # 5254
+3553,3783,7605,4153,1004,1779,4418,7606, 346,1981,2218,2687,4419,3784,1742, 797,  # 5270
+1642,3940,1933,1072,1384,2151, 896,3941,3275,3661,3197,2871,3554,7607,2561,1958,  # 5286
+4420,2450,1785,7608,7609,7610,3942,4154,1005,1308,3662,4155,2720,4421,4422,1528,  # 5302
+2600, 161,1178,4156,1982, 987,4423,1101,4157, 631,3943,1157,3198,2420,1343,1241,  # 5318
+1016,2239,2562, 372, 877,2339,2501,1160, 555,1934, 911,3944,7611, 466,1170, 169,  # 5334
+1051,2907,2688,3663,2474,2994,1182,2011,2563,1251,2626,7612, 992,2340,3444,1540,  # 5350
+2721,1201,2070,2401,1996,2475,7613,4424, 528,1922,2188,1503,1873,1570,2364,3342,  # 5366
+3276,7614, 557,1073,7615,1827,3445,2087,2266,3140,3039,3084, 767,3085,2786,4425,  # 5382
+1006,4158,4426,2341,1267,2176,3664,3199, 778,3945,3200,2722,1597,2657,7616,4427,  # 5398
+7617,3446,7618,7619,7620,3277,2689,1433,3278, 131,  95,1504,3946, 723,4159,3141,  # 5414
+1841,3555,2758,2189,3947,2027,2104,3665,7621,2995,3948,1218,7622,3343,3201,3949,  # 5430
+4160,2576, 248,1634,3785, 912,7623,2832,3666,3040,3786, 654,  53,7624,2996,7625,  # 5446
+1688,4428, 777,3447,1032,3950,1425,7626, 191, 820,2120,2833, 971,4429, 931,3202,  # 5462
+ 135, 664, 783,3787,1997, 772,2908,1935,3951,3788,4430,2909,3203, 282,2723, 640,  # 5478
+1372,3448,1127, 922, 325,3344,7627,7628, 711,2044,7629,7630,3952,2219,2787,1936,  # 5494
+3953,3345,2220,2251,3789,2300,7631,4431,3790,1258,3279,3954,3204,2138,2950,3955,  # 5510
+3956,7632,2221, 258,3205,4432, 101,1227,7633,3280,1755,7634,1391,3281,7635,2910,  # 5526
+2056, 893,7636,7637,7638,1402,4161,2342,7639,7640,3206,3556,7641,7642, 878,1325,  # 5542
+1780,2788,4433, 259,1385,2577, 744,1183,2267,4434,7643,3957,2502,7644, 684,1024,  # 5558
+4162,7645, 472,3557,3449,1165,3282,3958,3959, 322,2152, 881, 455,1695,1152,1340,  # 5574
+ 660, 554,2153,4435,1058,4436,4163, 830,1065,3346,3960,4437,1923,7646,1703,1918,  # 5590
+7647, 932,2268, 122,7648,4438, 947, 677,7649,3791,2627, 297,1905,1924,2269,4439,  # 5606
+2317,3283,7650,7651,4164,7652,4165,  84,4166, 112, 989,7653, 547,1059,3961, 701,  # 5622
+3558,1019,7654,4167,7655,3450, 942, 639, 457,2301,2451, 993,2951, 407, 851, 494,  # 5638
+4440,3347, 927,7656,1237,7657,2421,3348, 573,4168, 680, 921,2911,1279,1874, 285,  # 5654
+ 790,1448,1983, 719,2167,7658,7659,4441,3962,3963,1649,7660,1541, 563,7661,1077,  # 5670
+7662,3349,3041,3451, 511,2997,3964,3965,3667,3966,1268,2564,3350,3207,4442,4443,  # 5686
+7663, 535,1048,1276,1189,2912,2028,3142,1438,1373,2834,2952,1134,2012,7664,4169,  # 5702
+1238,2578,3086,1259,7665, 700,7666,2953,3143,3668,4170,7667,4171,1146,1875,1906,  # 5718
+4444,2601,3967, 781,2422, 132,1589, 203, 147, 273,2789,2402, 898,1786,2154,3968,  # 5734
+3969,7668,3792,2790,7669,7670,4445,4446,7671,3208,7672,1635,3793, 965,7673,1804,  # 5750
+2690,1516,3559,1121,1082,1329,3284,3970,1449,3794,  65,1128,2835,2913,2759,1590,  # 5766
+3795,7674,7675,  12,2658,  45, 976,2579,3144,4447, 517,2528,1013,1037,3209,7676,  # 5782
+3796,2836,7677,3797,7678,3452,7679,2602, 614,1998,2318,3798,3087,2724,2628,7680,  # 5798
+2580,4172, 599,1269,7681,1810,3669,7682,2691,3088, 759,1060, 489,1805,3351,3285,  # 5814
+1358,7683,7684,2386,1387,1215,2629,2252, 490,7685,7686,4173,1759,2387,2343,7687,  # 5830
+4448,3799,1907,3971,2630,1806,3210,4449,3453,3286,2760,2344, 874,7688,7689,3454,  # 5846
+3670,1858,  91,2914,3671,3042,3800,4450,7690,3145,3972,2659,7691,3455,1202,1403,  # 5862
+3801,2954,2529,1517,2503,4451,3456,2504,7692,4452,7693,2692,1885,1495,1731,3973,  # 5878
+2365,4453,7694,2029,7695,7696,3974,2693,1216, 237,2581,4174,2319,3975,3802,4454,  # 5894
+4455,2694,3560,3457, 445,4456,7697,7698,7699,7700,2761,  61,3976,3672,1822,3977,  # 5910
+7701, 687,2045, 935, 925, 405,2660, 703,1096,1859,2725,4457,3978,1876,1367,2695,  # 5926
+3352, 918,2105,1781,2476, 334,3287,1611,1093,4458, 564,3146,3458,3673,3353, 945,  # 5942
+2631,2057,4459,7702,1925, 872,4175,7703,3459,2696,3089, 349,4176,3674,3979,4460,  # 5958
+3803,4177,3675,2155,3980,4461,4462,4178,4463,2403,2046, 782,3981, 400, 251,4179,  # 5974
+1624,7704,7705, 277,3676, 299,1265, 476,1191,3804,2121,4180,4181,1109, 205,7706,  # 5990
+2582,1000,2156,3561,1860,7707,7708,7709,4464,7710,4465,2565, 107,2477,2157,3982,  # 6006
+3460,3147,7711,1533, 541,1301, 158, 753,4182,2872,3562,7712,1696, 370,1088,4183,  # 6022
+4466,3563, 579, 327, 440, 162,2240, 269,1937,1374,3461, 968,3043,  56,1396,3090,  # 6038
+2106,3288,3354,7713,1926,2158,4467,2998,7714,3564,7715,7716,3677,4468,2478,7717,  # 6054
+2791,7718,1650,4469,7719,2603,7720,7721,3983,2661,3355,1149,3356,3984,3805,3985,  # 6070
+7722,1076,  49,7723, 951,3211,3289,3290, 450,2837, 920,7724,1811,2792,2366,4184,  # 6086
+1908,1138,2367,3806,3462,7725,3212,4470,1909,1147,1518,2423,4471,3807,7726,4472,  # 6102
+2388,2604, 260,1795,3213,7727,7728,3808,3291, 708,7729,3565,1704,7730,3566,1351,  # 6118
+1618,3357,2999,1886, 944,4185,3358,4186,3044,3359,4187,7731,3678, 422, 413,1714,  # 6134
+3292, 500,2058,2345,4188,2479,7732,1344,1910, 954,7733,1668,7734,7735,3986,2404,  # 6150
+4189,3567,3809,4190,7736,2302,1318,2505,3091, 133,3092,2873,4473, 629,  31,2838,  # 6166
+2697,3810,4474, 850, 949,4475,3987,2955,1732,2088,4191,1496,1852,7737,3988, 620,  # 6182
+3214, 981,1242,3679,3360,1619,3680,1643,3293,2139,2452,1970,1719,3463,2168,7738,  # 6198
+3215,7739,7740,3361,1828,7741,1277,4476,1565,2047,7742,1636,3568,3093,7743, 869,  # 6214
+2839, 655,3811,3812,3094,3989,3000,3813,1310,3569,4477,7744,7745,7746,1733, 558,  # 6230
+4478,3681, 335,1549,3045,1756,4192,3682,1945,3464,1829,1291,1192, 470,2726,2107,  # 6246
+2793, 913,1054,3990,7747,1027,7748,3046,3991,4479, 982,2662,3362,3148,3465,3216,  # 6262
+3217,1946,2794,7749, 571,4480,7750,1830,7751,3570,2583,1523,2424,7752,2089, 984,  # 6278
+4481,3683,1959,7753,3684, 852, 923,2795,3466,3685, 969,1519, 999,2048,2320,1705,  # 6294
+7754,3095, 615,1662, 151, 597,3992,2405,2321,1049, 275,4482,3686,4193, 568,3687,  # 6310
+3571,2480,4194,3688,7755,2425,2270, 409,3218,7756,1566,2874,3467,1002, 769,2840,  # 6326
+ 194,2090,3149,3689,2222,3294,4195, 628,1505,7757,7758,1763,2177,3001,3993, 521,  # 6342
+1161,2584,1787,2203,2406,4483,3994,1625,4196,4197, 412,  42,3096, 464,7759,2632,  # 6358
+4484,3363,1760,1571,2875,3468,2530,1219,2204,3814,2633,2140,2368,4485,4486,3295,  # 6374
+1651,3364,3572,7760,7761,3573,2481,3469,7762,3690,7763,7764,2271,2091, 460,7765,  # 6390
+4487,7766,3002, 962, 588,3574, 289,3219,2634,1116,  52,7767,3047,1796,7768,7769,  # 6406
+7770,1467,7771,1598,1143,3691,4198,1984,1734,1067,4488,1280,3365, 465,4489,1572,  # 6422
+ 510,7772,1927,2241,1812,1644,3575,7773,4490,3692,7774,7775,2663,1573,1534,7776,  # 6438
+7777,4199, 536,1807,1761,3470,3815,3150,2635,7778,7779,7780,4491,3471,2915,1911,  # 6454
+2796,7781,3296,1122, 377,3220,7782, 360,7783,7784,4200,1529, 551,7785,2059,3693,  # 6470
+1769,2426,7786,2916,4201,3297,3097,2322,2108,2030,4492,1404, 136,1468,1479, 672,  # 6486
+1171,3221,2303, 271,3151,7787,2762,7788,2049, 678,2727, 865,1947,4493,7789,2013,  # 6502
+3995,2956,7790,2728,2223,1397,3048,3694,4494,4495,1735,2917,3366,3576,7791,3816,  # 6518
+ 509,2841,2453,2876,3817,7792,7793,3152,3153,4496,4202,2531,4497,2304,1166,1010,  # 6534
+ 552, 681,1887,7794,7795,2957,2958,3996,1287,1596,1861,3154, 358, 453, 736, 175,  # 6550
+ 478,1117, 905,1167,1097,7796,1853,1530,7797,1706,7798,2178,3472,2287,3695,3473,  # 6566
+3577,4203,2092,4204,7799,3367,1193,2482,4205,1458,2190,2205,1862,1888,1421,3298,  # 6582
+2918,3049,2179,3474, 595,2122,7800,3997,7801,7802,4206,1707,2636, 223,3696,1359,  # 6598
+ 751,3098, 183,3475,7803,2797,3003, 419,2369, 633, 704,3818,2389, 241,7804,7805,  # 6614
+7806, 838,3004,3697,2272,2763,2454,3819,1938,2050,3998,1309,3099,2242,1181,7807,  # 6630
+1136,2206,3820,2370,1446,4207,2305,4498,7808,7809,4208,1055,2605, 484,3698,7810,  # 6646
+3999, 625,4209,2273,3368,1499,4210,4000,7811,4001,4211,3222,2274,2275,3476,7812,  # 6662
+7813,2764, 808,2606,3699,3369,4002,4212,3100,2532, 526,3370,3821,4213, 955,7814,  # 6678
+1620,4214,2637,2427,7815,1429,3700,1669,1831, 994, 928,7816,3578,1260,7817,7818,  # 6694
+7819,1948,2288, 741,2919,1626,4215,2729,2455, 867,1184, 362,3371,1392,7820,7821,  # 6710
+4003,4216,1770,1736,3223,2920,4499,4500,1928,2698,1459,1158,7822,3050,3372,2877,  # 6726
+1292,1929,2506,2842,3701,1985,1187,2071,2014,2607,4217,7823,2566,2507,2169,3702,  # 6742
+2483,3299,7824,3703,4501,7825,7826, 666,1003,3005,1022,3579,4218,7827,4502,1813,  # 6758
+2253, 574,3822,1603, 295,1535, 705,3823,4219, 283, 858, 417,7828,7829,3224,4503,  # 6774
+4504,3051,1220,1889,1046,2276,2456,4004,1393,1599, 689,2567, 388,4220,7830,2484,  # 6790
+ 802,7831,2798,3824,2060,1405,2254,7832,4505,3825,2109,1052,1345,3225,1585,7833,  # 6806
+ 809,7834,7835,7836, 575,2730,3477, 956,1552,1469,1144,2323,7837,2324,1560,2457,  # 6822
+3580,3226,4005, 616,2207,3155,2180,2289,7838,1832,7839,3478,4506,7840,1319,3704,  # 6838
+3705,1211,3581,1023,3227,1293,2799,7841,7842,7843,3826, 607,2306,3827, 762,2878,  # 6854
+1439,4221,1360,7844,1485,3052,7845,4507,1038,4222,1450,2061,2638,4223,1379,4508,  # 6870
+2585,7846,7847,4224,1352,1414,2325,2921,1172,7848,7849,3828,3829,7850,1797,1451,  # 6886
+7851,7852,7853,7854,2922,4006,4007,2485,2346, 411,4008,4009,3582,3300,3101,4509,  # 6902
+1561,2664,1452,4010,1375,7855,7856,  47,2959, 316,7857,1406,1591,2923,3156,7858,  # 6918
+1025,2141,3102,3157, 354,2731, 884,2224,4225,2407, 508,3706, 726,3583, 996,2428,  # 6934
+3584, 729,7859, 392,2191,1453,4011,4510,3707,7860,7861,2458,3585,2608,1675,2800,  # 6950
+ 919,2347,2960,2348,1270,4511,4012,  73,7862,7863, 647,7864,3228,2843,2255,1550,  # 6966
+1346,3006,7865,1332, 883,3479,7866,7867,7868,7869,3301,2765,7870,1212, 831,1347,  # 6982
+4226,4512,2326,3830,1863,3053, 720,3831,4513,4514,3832,7871,4227,7872,7873,4515,  # 6998
+7874,7875,1798,4516,3708,2609,4517,3586,1645,2371,7876,7877,2924, 669,2208,2665,  # 7014
+2429,7878,2879,7879,7880,1028,3229,7881,4228,2408,7882,2256,1353,7883,7884,4518,  # 7030
+3158, 518,7885,4013,7886,4229,1960,7887,2142,4230,7888,7889,3007,2349,2350,3833,  # 7046
+ 516,1833,1454,4014,2699,4231,4519,2225,2610,1971,1129,3587,7890,2766,7891,2961,  # 7062
+1422, 577,1470,3008,1524,3373,7892,7893, 432,4232,3054,3480,7894,2586,1455,2508,  # 7078
+2226,1972,1175,7895,1020,2732,4015,3481,4520,7896,2733,7897,1743,1361,3055,3482,  # 7094
+2639,4016,4233,4521,2290, 895, 924,4234,2170, 331,2243,3056, 166,1627,3057,1098,  # 7110
+7898,1232,2880,2227,3374,4522, 657, 403,1196,2372, 542,3709,3375,1600,4235,3483,  # 7126
+7899,4523,2767,3230, 576, 530,1362,7900,4524,2533,2666,3710,4017,7901, 842,3834,  # 7142
+7902,2801,2031,1014,4018, 213,2700,3376, 665, 621,4236,7903,3711,2925,2430,7904,  # 7158
+2431,3302,3588,3377,7905,4237,2534,4238,4525,3589,1682,4239,3484,1380,7906, 724,  # 7174
+2277, 600,1670,7907,1337,1233,4526,3103,2244,7908,1621,4527,7909, 651,4240,7910,  # 7190
+1612,4241,2611,7911,2844,7912,2734,2307,3058,7913, 716,2459,3059, 174,1255,2701,  # 7206
+4019,3590, 548,1320,1398, 728,4020,1574,7914,1890,1197,3060,4021,7915,3061,3062,  # 7222
+3712,3591,3713, 747,7916, 635,4242,4528,7917,7918,7919,4243,7920,7921,4529,7922,  # 7238
+3378,4530,2432, 451,7923,3714,2535,2072,4244,2735,4245,4022,7924,1764,4531,7925,  # 7254
+4246, 350,7926,2278,2390,2486,7927,4247,4023,2245,1434,4024, 488,4532, 458,4248,  # 7270
+4025,3715, 771,1330,2391,3835,2568,3159,2159,2409,1553,2667,3160,4249,7928,2487,  # 7286
+2881,2612,1720,2702,4250,3379,4533,7929,2536,4251,7930,3231,4252,2768,7931,2015,  # 7302
+2736,7932,1155,1017,3716,3836,7933,3303,2308, 201,1864,4253,1430,7934,4026,7935,  # 7318
+7936,7937,7938,7939,4254,1604,7940, 414,1865, 371,2587,4534,4535,3485,2016,3104,  # 7334
+4536,1708, 960,4255, 887, 389,2171,1536,1663,1721,7941,2228,4027,2351,2926,1580,  # 7350
+7942,7943,7944,1744,7945,2537,4537,4538,7946,4539,7947,2073,7948,7949,3592,3380,  # 7366
+2882,4256,7950,4257,2640,3381,2802, 673,2703,2460, 709,3486,4028,3593,4258,7951,  # 7382
+1148, 502, 634,7952,7953,1204,4540,3594,1575,4541,2613,3717,7954,3718,3105, 948,  # 7398
+3232, 121,1745,3837,1110,7955,4259,3063,2509,3009,4029,3719,1151,1771,3838,1488,  # 7414
+4030,1986,7956,2433,3487,7957,7958,2093,7959,4260,3839,1213,1407,2803, 531,2737,  # 7430
+2538,3233,1011,1537,7960,2769,4261,3106,1061,7961,3720,3721,1866,2883,7962,2017,  # 7446
+ 120,4262,4263,2062,3595,3234,2309,3840,2668,3382,1954,4542,7963,7964,3488,1047,  # 7462
+2704,1266,7965,1368,4543,2845, 649,3383,3841,2539,2738,1102,2846,2669,7966,7967,  # 7478
+1999,7968,1111,3596,2962,7969,2488,3842,3597,2804,1854,3384,3722,7970,7971,3385,  # 7494
+2410,2884,3304,3235,3598,7972,2569,7973,3599,2805,4031,1460, 856,7974,3600,7975,  # 7510
+2885,2963,7976,2886,3843,7977,4264, 632,2510, 875,3844,1697,3845,2291,7978,7979,  # 7526
+4544,3010,1239, 580,4545,4265,7980, 914, 936,2074,1190,4032,1039,2123,7981,7982,  # 7542
+7983,3386,1473,7984,1354,4266,3846,7985,2172,3064,4033, 915,3305,4267,4268,3306,  # 7558
+1605,1834,7986,2739, 398,3601,4269,3847,4034, 328,1912,2847,4035,3848,1331,4270,  # 7574
+3011, 937,4271,7987,3602,4036,4037,3387,2160,4546,3388, 524, 742, 538,3065,1012,  # 7590
+7988,7989,3849,2461,7990, 658,1103, 225,3850,7991,7992,4547,7993,4548,7994,3236,  # 7606
+1243,7995,4038, 963,2246,4549,7996,2705,3603,3161,7997,7998,2588,2327,7999,4550,  # 7622
+8000,8001,8002,3489,3307, 957,3389,2540,2032,1930,2927,2462, 870,2018,3604,1746,  # 7638
+2770,2771,2434,2463,8003,3851,8004,3723,3107,3724,3490,3390,3725,8005,1179,3066,  # 7654
+8006,3162,2373,4272,3726,2541,3163,3108,2740,4039,8007,3391,1556,2542,2292, 977,  # 7670
+2887,2033,4040,1205,3392,8008,1765,3393,3164,2124,1271,1689, 714,4551,3491,8009,  # 7686
+2328,3852, 533,4273,3605,2181, 617,8010,2464,3308,3492,2310,8011,8012,3165,8013,  # 7702
+8014,3853,1987, 618, 427,2641,3493,3394,8015,8016,1244,1690,8017,2806,4274,4552,  # 7718
+8018,3494,8019,8020,2279,1576, 473,3606,4275,3395, 972,8021,3607,8022,3067,8023,  # 7734
+8024,4553,4554,8025,3727,4041,4042,8026, 153,4555, 356,8027,1891,2888,4276,2143,  # 7750
+ 408, 803,2352,8028,3854,8029,4277,1646,2570,2511,4556,4557,3855,8030,3856,4278,  # 7766
+8031,2411,3396, 752,8032,8033,1961,2964,8034, 746,3012,2465,8035,4279,3728, 698,  # 7782
+4558,1892,4280,3608,2543,4559,3609,3857,8036,3166,3397,8037,1823,1302,4043,2706,  # 7798
+3858,1973,4281,8038,4282,3167, 823,1303,1288,1236,2848,3495,4044,3398, 774,3859,  # 7814
+8039,1581,4560,1304,2849,3860,4561,8040,2435,2161,1083,3237,4283,4045,4284, 344,  # 7830
+1173, 288,2311, 454,1683,8041,8042,1461,4562,4046,2589,8043,8044,4563, 985, 894,  # 7846
+8045,3399,3168,8046,1913,2928,3729,1988,8047,2110,1974,8048,4047,8049,2571,1194,  # 7862
+ 425,8050,4564,3169,1245,3730,4285,8051,8052,2850,8053, 636,4565,1855,3861, 760,  # 7878
+1799,8054,4286,2209,1508,4566,4048,1893,1684,2293,8055,8056,8057,4287,4288,2210,  # 7894
+ 479,8058,8059, 832,8060,4049,2489,8061,2965,2490,3731, 990,3109, 627,1814,2642,  # 7910
+4289,1582,4290,2125,2111,3496,4567,8062, 799,4291,3170,8063,4568,2112,1737,3013,  # 7926
+1018, 543, 754,4292,3309,1676,4569,4570,4050,8064,1489,8065,3497,8066,2614,2889,  # 7942
+4051,8067,8068,2966,8069,8070,8071,8072,3171,4571,4572,2182,1722,8073,3238,3239,  # 7958
+1842,3610,1715, 481, 365,1975,1856,8074,8075,1962,2491,4573,8076,2126,3611,3240,  # 7974
+ 433,1894,2063,2075,8077, 602,2741,8078,8079,8080,8081,8082,3014,1628,3400,8083,  # 7990
+3172,4574,4052,2890,4575,2512,8084,2544,2772,8085,8086,8087,3310,4576,2891,8088,  # 8006
+4577,8089,2851,4578,4579,1221,2967,4053,2513,8090,8091,8092,1867,1989,8093,8094,  # 8022
+8095,1895,8096,8097,4580,1896,4054, 318,8098,2094,4055,4293,8099,8100, 485,8101,  # 8038
+ 938,3862, 553,2670, 116,8102,3863,3612,8103,3498,2671,2773,3401,3311,2807,8104,  # 8054
+3613,2929,4056,1747,2930,2968,8105,8106, 207,8107,8108,2672,4581,2514,8109,3015,  # 8070
+ 890,3614,3864,8110,1877,3732,3402,8111,2183,2353,3403,1652,8112,8113,8114, 941,  # 8086
+2294, 208,3499,4057,2019, 330,4294,3865,2892,2492,3733,4295,8115,8116,8117,8118,  # 8102
+)
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/euctwprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/euctwprober.py
new file mode 100644
index 000000000..35669cc4d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/euctwprober.py
@@ -0,0 +1,46 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import EUCTWDistributionAnalysis
+from .mbcssm import EUCTW_SM_MODEL
+
+class EUCTWProber(MultiByteCharSetProber):
+    def __init__(self):
+        super(EUCTWProber, self).__init__()
+        self.coding_sm = CodingStateMachine(EUCTW_SM_MODEL)
+        self.distribution_analyzer = EUCTWDistributionAnalysis()
+        self.reset()
+
+    @property
+    def charset_name(self):
+        return "EUC-TW"
+
+    @property
+    def language(self):
+        return "Taiwan"
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/gb2312freq.py b/venv/Lib/site-packages/pip/_vendor/chardet/gb2312freq.py
new file mode 100644
index 000000000..697837bd9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/gb2312freq.py
@@ -0,0 +1,283 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# GB2312 most frequently used character table
+#
+# Char to FreqOrder table , from hz6763
+
+# 512  --> 0.79  -- 0.79
+# 1024 --> 0.92  -- 0.13
+# 2048 --> 0.98  -- 0.06
+# 6768 --> 1.00  -- 0.02
+#
+# Ideal Distribution Ratio = 0.79135/(1-0.79135) = 3.79
+# Random Distribution Ration = 512 / (3755 - 512) = 0.157
+#
+# Typical Distribution Ratio about 25% of Ideal one, still much higher that RDR
+
+GB2312_TYPICAL_DISTRIBUTION_RATIO = 0.9
+
+GB2312_TABLE_SIZE = 3760
+
+GB2312_CHAR_TO_FREQ_ORDER = (
+1671, 749,1443,2364,3924,3807,2330,3921,1704,3463,2691,1511,1515, 572,3191,2205,
+2361, 224,2558, 479,1711, 963,3162, 440,4060,1905,2966,2947,3580,2647,3961,3842,
+2204, 869,4207, 970,2678,5626,2944,2956,1479,4048, 514,3595, 588,1346,2820,3409,
+ 249,4088,1746,1873,2047,1774, 581,1813, 358,1174,3590,1014,1561,4844,2245, 670,
+1636,3112, 889,1286, 953, 556,2327,3060,1290,3141, 613, 185,3477,1367, 850,3820,
+1715,2428,2642,2303,2732,3041,2562,2648,3566,3946,1349, 388,3098,2091,1360,3585,
+ 152,1687,1539, 738,1559,  59,1232,2925,2267,1388,1249,1741,1679,2960, 151,1566,
+1125,1352,4271, 924,4296, 385,3166,4459, 310,1245,2850,  70,3285,2729,3534,3575,
+2398,3298,3466,1960,2265, 217,3647, 864,1909,2084,4401,2773,1010,3269,5152, 853,
+3051,3121,1244,4251,1895, 364,1499,1540,2313,1180,3655,2268, 562, 715,2417,3061,
+ 544, 336,3768,2380,1752,4075, 950, 280,2425,4382, 183,2759,3272, 333,4297,2155,
+1688,2356,1444,1039,4540, 736,1177,3349,2443,2368,2144,2225, 565, 196,1482,3406,
+ 927,1335,4147, 692, 878,1311,1653,3911,3622,1378,4200,1840,2969,3149,2126,1816,
+2534,1546,2393,2760, 737,2494,  13, 447, 245,2747,  38,2765,2129,2589,1079, 606,
+ 360, 471,3755,2890, 404, 848, 699,1785,1236, 370,2221,1023,3746,2074,2026,2023,
+2388,1581,2119, 812,1141,3091,2536,1519, 804,2053, 406,1596,1090, 784, 548,4414,
+1806,2264,2936,1100, 343,4114,5096, 622,3358, 743,3668,1510,1626,5020,3567,2513,
+3195,4115,5627,2489,2991,  24,2065,2697,1087,2719,  48,1634, 315,  68, 985,2052,
+ 198,2239,1347,1107,1439, 597,2366,2172, 871,3307, 919,2487,2790,1867, 236,2570,
+1413,3794, 906,3365,3381,1701,1982,1818,1524,2924,1205, 616,2586,2072,2004, 575,
+ 253,3099,  32,1365,1182, 197,1714,2454,1201, 554,3388,3224,2748, 756,2587, 250,
+2567,1507,1517,3529,1922,2761,2337,3416,1961,1677,2452,2238,3153, 615, 911,1506,
+1474,2495,1265,1906,2749,3756,3280,2161, 898,2714,1759,3450,2243,2444, 563,  26,
+3286,2266,3769,3344,2707,3677, 611,1402, 531,1028,2871,4548,1375, 261,2948, 835,
+1190,4134, 353, 840,2684,1900,3082,1435,2109,1207,1674, 329,1872,2781,4055,2686,
+2104, 608,3318,2423,2957,2768,1108,3739,3512,3271,3985,2203,1771,3520,1418,2054,
+1681,1153, 225,1627,2929, 162,2050,2511,3687,1954, 124,1859,2431,1684,3032,2894,
+ 585,4805,3969,2869,2704,2088,2032,2095,3656,2635,4362,2209, 256, 518,2042,2105,
+3777,3657, 643,2298,1148,1779, 190, 989,3544, 414,  11,2135,2063,2979,1471, 403,
+3678, 126, 770,1563, 671,2499,3216,2877, 600,1179, 307,2805,4937,1268,1297,2694,
+ 252,4032,1448,1494,1331,1394, 127,2256, 222,1647,1035,1481,3056,1915,1048, 873,
+3651, 210,  33,1608,2516, 200,1520, 415, 102,   0,3389,1287, 817,  91,3299,2940,
+ 836,1814, 549,2197,1396,1669,2987,3582,2297,2848,4528,1070, 687,  20,1819, 121,
+1552,1364,1461,1968,2617,3540,2824,2083, 177, 948,4938,2291, 110,4549,2066, 648,
+3359,1755,2110,2114,4642,4845,1693,3937,3308,1257,1869,2123, 208,1804,3159,2992,
+2531,2549,3361,2418,1350,2347,2800,2568,1291,2036,2680,  72, 842,1990, 212,1233,
+1154,1586,  75,2027,3410,4900,1823,1337,2710,2676, 728,2810,1522,3026,4995, 157,
+ 755,1050,4022, 710, 785,1936,2194,2085,1406,2777,2400, 150,1250,4049,1206, 807,
+1910, 534, 529,3309,1721,1660, 274,  39,2827, 661,2670,1578, 925,3248,3815,1094,
+4278,4901,4252,  41,1150,3747,2572,2227,4501,3658,4902,3813,3357,3617,2884,2258,
+ 887, 538,4187,3199,1294,2439,3042,2329,2343,2497,1255, 107, 543,1527, 521,3478,
+3568, 194,5062,  15, 961,3870,1241,1192,2664,  66,5215,3260,2111,1295,1127,2152,
+3805,4135, 901,1164,1976, 398,1278, 530,1460, 748, 904,1054,1966,1426,  53,2909,
+ 509, 523,2279,1534, 536,1019, 239,1685, 460,2353, 673,1065,2401,3600,4298,2272,
+1272,2363, 284,1753,3679,4064,1695,  81, 815,2677,2757,2731,1386, 859, 500,4221,
+2190,2566, 757,1006,2519,2068,1166,1455, 337,2654,3203,1863,1682,1914,3025,1252,
+1409,1366, 847, 714,2834,2038,3209, 964,2970,1901, 885,2553,1078,1756,3049, 301,
+1572,3326, 688,2130,1996,2429,1805,1648,2930,3421,2750,3652,3088, 262,1158,1254,
+ 389,1641,1812, 526,1719, 923,2073,1073,1902, 468, 489,4625,1140, 857,2375,3070,
+3319,2863, 380, 116,1328,2693,1161,2244, 273,1212,1884,2769,3011,1775,1142, 461,
+3066,1200,2147,2212, 790, 702,2695,4222,1601,1058, 434,2338,5153,3640,  67,2360,
+4099,2502, 618,3472,1329, 416,1132, 830,2782,1807,2653,3211,3510,1662, 192,2124,
+ 296,3979,1739,1611,3684,  23, 118, 324, 446,1239,1225, 293,2520,3814,3795,2535,
+3116,  17,1074, 467,2692,2201, 387,2922,  45,1326,3055,1645,3659,2817, 958, 243,
+1903,2320,1339,2825,1784,3289, 356, 576, 865,2315,2381,3377,3916,1088,3122,1713,
+1655, 935, 628,4689,1034,1327, 441, 800, 720, 894,1979,2183,1528,5289,2702,1071,
+4046,3572,2399,1571,3281,  79, 761,1103, 327, 134, 758,1899,1371,1615, 879, 442,
+ 215,2605,2579, 173,2048,2485,1057,2975,3317,1097,2253,3801,4263,1403,1650,2946,
+ 814,4968,3487,1548,2644,1567,1285,   2, 295,2636,  97, 946,3576, 832, 141,4257,
+3273, 760,3821,3521,3156,2607, 949,1024,1733,1516,1803,1920,2125,2283,2665,3180,
+1501,2064,3560,2171,1592, 803,3518,1416, 732,3897,4258,1363,1362,2458, 119,1427,
+ 602,1525,2608,1605,1639,3175, 694,3064,  10, 465,  76,2000,4846,4208, 444,3781,
+1619,3353,2206,1273,3796, 740,2483, 320,1723,2377,3660,2619,1359,1137,1762,1724,
+2345,2842,1850,1862, 912, 821,1866, 612,2625,1735,2573,3369,1093, 844,  89, 937,
+ 930,1424,3564,2413,2972,1004,3046,3019,2011, 711,3171,1452,4178, 428, 801,1943,
+ 432, 445,2811, 206,4136,1472, 730, 349,  73, 397,2802,2547, 998,1637,1167, 789,
+ 396,3217, 154,1218, 716,1120,1780,2819,4826,1931,3334,3762,2139,1215,2627, 552,
+3664,3628,3232,1405,2383,3111,1356,2652,3577,3320,3101,1703, 640,1045,1370,1246,
+4996, 371,1575,2436,1621,2210, 984,4033,1734,2638,  16,4529, 663,2755,3255,1451,
+3917,2257,1253,1955,2234,1263,2951, 214,1229, 617, 485, 359,1831,1969, 473,2310,
+ 750,2058, 165,  80,2864,2419, 361,4344,2416,2479,1134, 796,3726,1266,2943, 860,
+2715, 938, 390,2734,1313,1384, 248, 202, 877,1064,2854, 522,3907, 279,1602, 297,
+2357, 395,3740, 137,2075, 944,4089,2584,1267,3802,  62,1533,2285, 178, 176, 780,
+2440, 201,3707, 590, 478,1560,4354,2117,1075,  30,  74,4643,4004,1635,1441,2745,
+ 776,2596, 238,1077,1692,1912,2844, 605, 499,1742,3947, 241,3053, 980,1749, 936,
+2640,4511,2582, 515,1543,2162,5322,2892,2993, 890,2148,1924, 665,1827,3581,1032,
+ 968,3163, 339,1044,1896, 270, 583,1791,1720,4367,1194,3488,3669,  43,2523,1657,
+ 163,2167, 290,1209,1622,3378, 550, 634,2508,2510, 695,2634,2384,2512,1476,1414,
+ 220,1469,2341,2138,2852,3183,2900,4939,2865,3502,1211,3680, 854,3227,1299,2976,
+3172, 186,2998,1459, 443,1067,3251,1495, 321,1932,3054, 909, 753,1410,1828, 436,
+2441,1119,1587,3164,2186,1258, 227, 231,1425,1890,3200,3942, 247, 959, 725,5254,
+2741, 577,2158,2079, 929, 120, 174, 838,2813, 591,1115, 417,2024,  40,3240,1536,
+1037, 291,4151,2354, 632,1298,2406,2500,3535,1825,1846,3451, 205,1171, 345,4238,
+  18,1163, 811, 685,2208,1217, 425,1312,1508,1175,4308,2552,1033, 587,1381,3059,
+2984,3482, 340,1316,4023,3972, 792,3176, 519, 777,4690, 918, 933,4130,2981,3741,
+  90,3360,2911,2200,5184,4550, 609,3079,2030, 272,3379,2736, 363,3881,1130,1447,
+ 286, 779, 357,1169,3350,3137,1630,1220,2687,2391, 747,1277,3688,2618,2682,2601,
+1156,3196,5290,4034,3102,1689,3596,3128, 874, 219,2783, 798, 508,1843,2461, 269,
+1658,1776,1392,1913,2983,3287,2866,2159,2372, 829,4076,  46,4253,2873,1889,1894,
+ 915,1834,1631,2181,2318, 298, 664,2818,3555,2735, 954,3228,3117, 527,3511,2173,
+ 681,2712,3033,2247,2346,3467,1652, 155,2164,3382, 113,1994, 450, 899, 494, 994,
+1237,2958,1875,2336,1926,3727, 545,1577,1550, 633,3473, 204,1305,3072,2410,1956,
+2471, 707,2134, 841,2195,2196,2663,3843,1026,4940, 990,3252,4997, 368,1092, 437,
+3212,3258,1933,1829, 675,2977,2893, 412, 943,3723,4644,3294,3283,2230,2373,5154,
+2389,2241,2661,2323,1404,2524, 593, 787, 677,3008,1275,2059, 438,2709,2609,2240,
+2269,2246,1446,  36,1568,1373,3892,1574,2301,1456,3962, 693,2276,5216,2035,1143,
+2720,1919,1797,1811,2763,4137,2597,1830,1699,1488,1198,2090, 424,1694, 312,3634,
+3390,4179,3335,2252,1214, 561,1059,3243,2295,2561, 975,5155,2321,2751,3772, 472,
+1537,3282,3398,1047,2077,2348,2878,1323,3340,3076, 690,2906,  51, 369, 170,3541,
+1060,2187,2688,3670,2541,1083,1683, 928,3918, 459, 109,4427, 599,3744,4286, 143,
+2101,2730,2490,  82,1588,3036,2121, 281,1860, 477,4035,1238,2812,3020,2716,3312,
+1530,2188,2055,1317, 843, 636,1808,1173,3495, 649, 181,1002, 147,3641,1159,2414,
+3750,2289,2795, 813,3123,2610,1136,4368,   5,3391,4541,2174, 420, 429,1728, 754,
+1228,2115,2219, 347,2223,2733, 735,1518,3003,2355,3134,1764,3948,3329,1888,2424,
+1001,1234,1972,3321,3363,1672,1021,1450,1584, 226, 765, 655,2526,3404,3244,2302,
+3665, 731, 594,2184, 319,1576, 621, 658,2656,4299,2099,3864,1279,2071,2598,2739,
+ 795,3086,3699,3908,1707,2352,2402,1382,3136,2475,1465,4847,3496,3865,1085,3004,
+2591,1084, 213,2287,1963,3565,2250, 822, 793,4574,3187,1772,1789,3050, 595,1484,
+1959,2770,1080,2650, 456, 422,2996, 940,3322,4328,4345,3092,2742, 965,2784, 739,
+4124, 952,1358,2498,2949,2565, 332,2698,2378, 660,2260,2473,4194,3856,2919, 535,
+1260,2651,1208,1428,1300,1949,1303,2942, 433,2455,2450,1251,1946, 614,1269, 641,
+1306,1810,2737,3078,2912, 564,2365,1419,1415,1497,4460,2367,2185,1379,3005,1307,
+3218,2175,1897,3063, 682,1157,4040,4005,1712,1160,1941,1399, 394, 402,2952,1573,
+1151,2986,2404, 862, 299,2033,1489,3006, 346, 171,2886,3401,1726,2932, 168,2533,
+  47,2507,1030,3735,1145,3370,1395,1318,1579,3609,4560,2857,4116,1457,2529,1965,
+ 504,1036,2690,2988,2405, 745,5871, 849,2397,2056,3081, 863,2359,3857,2096,  99,
+1397,1769,2300,4428,1643,3455,1978,1757,3718,1440,  35,4879,3742,1296,4228,2280,
+ 160,5063,1599,2013, 166, 520,3479,1646,3345,3012, 490,1937,1545,1264,2182,2505,
+1096,1188,1369,1436,2421,1667,2792,2460,1270,2122, 727,3167,2143, 806,1706,1012,
+1800,3037, 960,2218,1882, 805, 139,2456,1139,1521, 851,1052,3093,3089, 342,2039,
+ 744,5097,1468,1502,1585,2087, 223, 939, 326,2140,2577, 892,2481,1623,4077, 982,
+3708, 135,2131,  87,2503,3114,2326,1106, 876,1616, 547,2997,2831,2093,3441,4530,
+4314,   9,3256,4229,4148, 659,1462,1986,1710,2046,2913,2231,4090,4880,5255,3392,
+3274,1368,3689,4645,1477, 705,3384,3635,1068,1529,2941,1458,3782,1509, 100,1656,
+2548, 718,2339, 408,1590,2780,3548,1838,4117,3719,1345,3530, 717,3442,2778,3220,
+2898,1892,4590,3614,3371,2043,1998,1224,3483, 891, 635, 584,2559,3355, 733,1766,
+1729,1172,3789,1891,2307, 781,2982,2271,1957,1580,5773,2633,2005,4195,3097,1535,
+3213,1189,1934,5693,3262, 586,3118,1324,1598, 517,1564,2217,1868,1893,4445,3728,
+2703,3139,1526,1787,1992,3882,2875,1549,1199,1056,2224,1904,2711,5098,4287, 338,
+1993,3129,3489,2689,1809,2815,1997, 957,1855,3898,2550,3275,3057,1105,1319, 627,
+1505,1911,1883,3526, 698,3629,3456,1833,1431, 746,  77,1261,2017,2296,1977,1885,
+ 125,1334,1600, 525,1798,1109,2222,1470,1945, 559,2236,1186,3443,2476,1929,1411,
+2411,3135,1777,3372,2621,1841,1613,3229, 668,1430,1839,2643,2916, 195,1989,2671,
+2358,1387, 629,3205,2293,5256,4439, 123,1310, 888,1879,4300,3021,3605,1003,1162,
+3192,2910,2010, 140,2395,2859,  55,1082,2012,2901, 662, 419,2081,1438, 680,2774,
+4654,3912,1620,1731,1625,5035,4065,2328, 512,1344, 802,5443,2163,2311,2537, 524,
+3399,  98,1155,2103,1918,2606,3925,2816,1393,2465,1504,3773,2177,3963,1478,4346,
+ 180,1113,4655,3461,2028,1698, 833,2696,1235,1322,1594,4408,3623,3013,3225,2040,
+3022, 541,2881, 607,3632,2029,1665,1219, 639,1385,1686,1099,2803,3231,1938,3188,
+2858, 427, 676,2772,1168,2025, 454,3253,2486,3556, 230,1950, 580, 791,1991,1280,
+1086,1974,2034, 630, 257,3338,2788,4903,1017,  86,4790, 966,2789,1995,1696,1131,
+ 259,3095,4188,1308, 179,1463,5257, 289,4107,1248,  42,3413,1725,2288, 896,1947,
+ 774,4474,4254, 604,3430,4264, 392,2514,2588, 452, 237,1408,3018, 988,4531,1970,
+3034,3310, 540,2370,1562,1288,2990, 502,4765,1147,   4,1853,2708, 207, 294,2814,
+4078,2902,2509, 684,  34,3105,3532,2551, 644, 709,2801,2344, 573,1727,3573,3557,
+2021,1081,3100,4315,2100,3681, 199,2263,1837,2385, 146,3484,1195,2776,3949, 997,
+1939,3973,1008,1091,1202,1962,1847,1149,4209,5444,1076, 493, 117,5400,2521, 972,
+1490,2934,1796,4542,2374,1512,2933,2657, 413,2888,1135,2762,2314,2156,1355,2369,
+ 766,2007,2527,2170,3124,2491,2593,2632,4757,2437, 234,3125,3591,1898,1750,1376,
+1942,3468,3138, 570,2127,2145,3276,4131, 962, 132,1445,4196,  19, 941,3624,3480,
+3366,1973,1374,4461,3431,2629, 283,2415,2275, 808,2887,3620,2112,2563,1353,3610,
+ 955,1089,3103,1053,  96,  88,4097, 823,3808,1583, 399, 292,4091,3313, 421,1128,
+ 642,4006, 903,2539,1877,2082, 596,  29,4066,1790, 722,2157, 130, 995,1569, 769,
+1485, 464, 513,2213, 288,1923,1101,2453,4316, 133, 486,2445,  50, 625, 487,2207,
+  57, 423, 481,2962, 159,3729,1558, 491, 303, 482, 501, 240,2837, 112,3648,2392,
+1783, 362,   8,3433,3422, 610,2793,3277,1390,1284,1654,  21,3823, 734, 367, 623,
+ 193, 287, 374,1009,1483, 816, 476, 313,2255,2340,1262,2150,2899,1146,2581, 782,
+2116,1659,2018,1880, 255,3586,3314,1110,2867,2137,2564, 986,2767,5185,2006, 650,
+ 158, 926, 762, 881,3157,2717,2362,3587, 306,3690,3245,1542,3077,2427,1691,2478,
+2118,2985,3490,2438, 539,2305, 983, 129,1754, 355,4201,2386, 827,2923, 104,1773,
+2838,2771, 411,2905,3919, 376, 767, 122,1114, 828,2422,1817,3506, 266,3460,1007,
+1609,4998, 945,2612,4429,2274, 726,1247,1964,2914,2199,2070,4002,4108, 657,3323,
+1422, 579, 455,2764,4737,1222,2895,1670, 824,1223,1487,2525, 558, 861,3080, 598,
+2659,2515,1967, 752,2583,2376,2214,4180, 977, 704,2464,4999,2622,4109,1210,2961,
+ 819,1541, 142,2284,  44, 418, 457,1126,3730,4347,4626,1644,1876,3671,1864, 302,
+1063,5694, 624, 723,1984,3745,1314,1676,2488,1610,1449,3558,3569,2166,2098, 409,
+1011,2325,3704,2306, 818,1732,1383,1824,1844,3757, 999,2705,3497,1216,1423,2683,
+2426,2954,2501,2726,2229,1475,2554,5064,1971,1794,1666,2014,1343, 783, 724, 191,
+2434,1354,2220,5065,1763,2752,2472,4152, 131, 175,2885,3434,  92,1466,4920,2616,
+3871,3872,3866, 128,1551,1632, 669,1854,3682,4691,4125,1230, 188,2973,3290,1302,
+1213, 560,3266, 917, 763,3909,3249,1760, 868,1958, 764,1782,2097, 145,2277,3774,
+4462,  64,1491,3062, 971,2132,3606,2442, 221,1226,1617, 218, 323,1185,3207,3147,
+ 571, 619,1473,1005,1744,2281, 449,1887,2396,3685, 275, 375,3816,1743,3844,3731,
+ 845,1983,2350,4210,1377, 773, 967,3499,3052,3743,2725,4007,1697,1022,3943,1464,
+3264,2855,2722,1952,1029,2839,2467,  84,4383,2215, 820,1391,2015,2448,3672, 377,
+1948,2168, 797,2545,3536,2578,2645,  94,2874,1678, 405,1259,3071, 771, 546,1315,
+ 470,1243,3083, 895,2468, 981, 969,2037, 846,4181, 653,1276,2928,  14,2594, 557,
+3007,2474, 156, 902,1338,1740,2574, 537,2518, 973,2282,2216,2433,1928, 138,2903,
+1293,2631,1612, 646,3457, 839,2935, 111, 496,2191,2847, 589,3186, 149,3994,2060,
+4031,2641,4067,3145,1870,  37,3597,2136,1025,2051,3009,3383,3549,1121,1016,3261,
+1301, 251,2446,2599,2153, 872,3246, 637, 334,3705, 831, 884, 921,3065,3140,4092,
+2198,1944, 246,2964, 108,2045,1152,1921,2308,1031, 203,3173,4170,1907,3890, 810,
+1401,2003,1690, 506, 647,1242,2828,1761,1649,3208,2249,1589,3709,2931,5156,1708,
+ 498, 666,2613, 834,3817,1231, 184,2851,1124, 883,3197,2261,3710,1765,1553,2658,
+1178,2639,2351,  93,1193, 942,2538,2141,4402, 235,1821, 870,1591,2192,1709,1871,
+3341,1618,4126,2595,2334, 603, 651,  69, 701, 268,2662,3411,2555,1380,1606, 503,
+ 448, 254,2371,2646, 574,1187,2309,1770, 322,2235,1292,1801, 305, 566,1133, 229,
+2067,2057, 706, 167, 483,2002,2672,3295,1820,3561,3067, 316, 378,2746,3452,1112,
+ 136,1981, 507,1651,2917,1117, 285,4591, 182,2580,3522,1304, 335,3303,1835,2504,
+1795,1792,2248, 674,1018,2106,2449,1857,2292,2845, 976,3047,1781,2600,2727,1389,
+1281,  52,3152, 153, 265,3950, 672,3485,3951,4463, 430,1183, 365, 278,2169,  27,
+1407,1336,2304, 209,1340,1730,2202,1852,2403,2883, 979,1737,1062, 631,2829,2542,
+3876,2592, 825,2086,2226,3048,3625, 352,1417,3724, 542, 991, 431,1351,3938,1861,
+2294, 826,1361,2927,3142,3503,1738, 463,2462,2723, 582,1916,1595,2808, 400,3845,
+3891,2868,3621,2254,  58,2492,1123, 910,2160,2614,1372,1603,1196,1072,3385,1700,
+3267,1980, 696, 480,2430, 920, 799,1570,2920,1951,2041,4047,2540,1321,4223,2469,
+3562,2228,1271,2602, 401,2833,3351,2575,5157, 907,2312,1256, 410, 263,3507,1582,
+ 996, 678,1849,2316,1480, 908,3545,2237, 703,2322, 667,1826,2849,1531,2604,2999,
+2407,3146,2151,2630,1786,3711, 469,3542, 497,3899,2409, 858, 837,4446,3393,1274,
+ 786, 620,1845,2001,3311, 484, 308,3367,1204,1815,3691,2332,1532,2557,1842,2020,
+2724,1927,2333,4440, 567,  22,1673,2728,4475,1987,1858,1144,1597, 101,1832,3601,
+  12, 974,3783,4391, 951,1412,   1,3720, 453,4608,4041, 528,1041,1027,3230,2628,
+1129, 875,1051,3291,1203,2262,1069,2860,2799,2149,2615,3278, 144,1758,3040,  31,
+ 475,1680, 366,2685,3184, 311,1642,4008,2466,5036,1593,1493,2809, 216,1420,1668,
+ 233, 304,2128,3284, 232,1429,1768,1040,2008,3407,2740,2967,2543, 242,2133, 778,
+1565,2022,2620, 505,2189,2756,1098,2273, 372,1614, 708, 553,2846,2094,2278, 169,
+3626,2835,4161, 228,2674,3165, 809,1454,1309, 466,1705,1095, 900,3423, 880,2667,
+3751,5258,2317,3109,2571,4317,2766,1503,1342, 866,4447,1118,  63,2076, 314,1881,
+1348,1061, 172, 978,3515,1747, 532, 511,3970,   6, 601, 905,2699,3300,1751, 276,
+1467,3725,2668,  65,4239,2544,2779,2556,1604, 578,2451,1802, 992,2331,2624,1320,
+3446, 713,1513,1013, 103,2786,2447,1661, 886,1702, 916, 654,3574,2031,1556, 751,
+2178,2821,2179,1498,1538,2176, 271, 914,2251,2080,1325, 638,1953,2937,3877,2432,
+2754,  95,3265,1716, 260,1227,4083, 775, 106,1357,3254, 426,1607, 555,2480, 772,
+1985, 244,2546, 474, 495,1046,2611,1851,2061,  71,2089,1675,2590, 742,3758,2843,
+3222,1433, 267,2180,2576,2826,2233,2092,3913,2435, 956,1745,3075, 856,2113,1116,
+ 451,   3,1988,2896,1398, 993,2463,1878,2049,1341,2718,2721,2870,2108, 712,2904,
+4363,2753,2324, 277,2872,2349,2649, 384, 987, 435, 691,3000, 922, 164,3939, 652,
+1500,1184,4153,2482,3373,2165,4848,2335,3775,3508,3154,2806,2830,1554,2102,1664,
+2530,1434,2408, 893,1547,2623,3447,2832,2242,2532,3169,2856,3223,2078,  49,3770,
+3469, 462, 318, 656,2259,3250,3069, 679,1629,2758, 344,1138,1104,3120,1836,1283,
+3115,2154,1437,4448, 934, 759,1999, 794,2862,1038, 533,2560,1722,2342, 855,2626,
+1197,1663,4476,3127,  85,4240,2528,  25,1111,1181,3673, 407,3470,4561,2679,2713,
+ 768,1925,2841,3986,1544,1165, 932, 373,1240,2146,1930,2673, 721,4766, 354,4333,
+ 391,2963, 187,  61,3364,1442,1102, 330,1940,1767, 341,3809,4118, 393,2496,2062,
+2211, 105, 331, 300, 439, 913,1332, 626, 379,3304,1557, 328, 689,3952, 309,1555,
+ 931, 317,2517,3027, 325, 569, 686,2107,3084,  60,1042,1333,2794, 264,3177,4014,
+1628, 258,3712,   7,4464,1176,1043,1778, 683, 114,1975,  78,1492, 383,1886, 510,
+ 386, 645,5291,2891,2069,3305,4138,3867,2939,2603,2493,1935,1066,1848,3588,1015,
+1282,1289,4609, 697,1453,3044,2666,3611,1856,2412,  54, 719,1330, 568,3778,2459,
+1748, 788, 492, 551,1191,1000, 488,3394,3763, 282,1799, 348,2016,1523,3155,2390,
+1049, 382,2019,1788,1170, 729,2968,3523, 897,3926,2785,2938,3292, 350,2319,3238,
+1718,1717,2655,3453,3143,4465, 161,2889,2980,2009,1421,  56,1908,1640,2387,2232,
+1917,1874,2477,4921, 148,  83,3438, 592,4245,2882,1822,1055, 741, 115,1496,1624,
+ 381,1638,4592,1020, 516,3214, 458, 947,4575,1432, 211,1514,2926,1865,2142, 189,
+ 852,1221,1400,1486, 882,2299,4036, 351,  28,1122, 700,6479,6480,6481,6482,6483,  #last 512
+)
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/gb2312prober.py b/venv/Lib/site-packages/pip/_vendor/chardet/gb2312prober.py
new file mode 100644
index 000000000..8446d2dd9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/gb2312prober.py
@@ -0,0 +1,46 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import GB2312DistributionAnalysis
+from .mbcssm import GB2312_SM_MODEL
+
+class GB2312Prober(MultiByteCharSetProber):
+    def __init__(self):
+        super(GB2312Prober, self).__init__()
+        self.coding_sm = CodingStateMachine(GB2312_SM_MODEL)
+        self.distribution_analyzer = GB2312DistributionAnalysis()
+        self.reset()
+
+    @property
+    def charset_name(self):
+        return "GB2312"
+
+    @property
+    def language(self):
+        return "Chinese"
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/hebrewprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/hebrewprober.py
new file mode 100644
index 000000000..b0e1bf492
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/hebrewprober.py
@@ -0,0 +1,292 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+#          Shy Shalom
+# Portions created by the Initial Developer are Copyright (C) 2005
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .enums import ProbingState
+
+# This prober doesn't actually recognize a language or a charset.
+# It is a helper prober for the use of the Hebrew model probers
+
+### General ideas of the Hebrew charset recognition ###
+#
+# Four main charsets exist in Hebrew:
+# "ISO-8859-8" - Visual Hebrew
+# "windows-1255" - Logical Hebrew
+# "ISO-8859-8-I" - Logical Hebrew
+# "x-mac-hebrew" - ?? Logical Hebrew ??
+#
+# Both "ISO" charsets use a completely identical set of code points, whereas
+# "windows-1255" and "x-mac-hebrew" are two different proper supersets of
+# these code points. windows-1255 defines additional characters in the range
+# 0x80-0x9F as some misc punctuation marks as well as some Hebrew-specific
+# diacritics and additional 'Yiddish' ligature letters in the range 0xc0-0xd6.
+# x-mac-hebrew defines similar additional code points but with a different
+# mapping.
+#
+# As far as an average Hebrew text with no diacritics is concerned, all four
+# charsets are identical with respect to code points. Meaning that for the
+# main Hebrew alphabet, all four map the same values to all 27 Hebrew letters
+# (including final letters).
+#
+# The dominant difference between these charsets is their directionality.
+# "Visual" directionality means that the text is ordered as if the renderer is
+# not aware of a BIDI rendering algorithm. The renderer sees the text and
+# draws it from left to right. The text itself when ordered naturally is read
+# backwards. A buffer of Visual Hebrew generally looks like so:
+# "[last word of first line spelled backwards] [whole line ordered backwards
+# and spelled backwards] [first word of first line spelled backwards]
+# [end of line] [last word of second line] ... etc' "
+# adding punctuation marks, numbers and English text to visual text is
+# naturally also "visual" and from left to right.
+#
+# "Logical" directionality means the text is ordered "naturally" according to
+# the order it is read. It is the responsibility of the renderer to display
+# the text from right to left. A BIDI algorithm is used to place general
+# punctuation marks, numbers and English text in the text.
+#
+# Texts in x-mac-hebrew are almost impossible to find on the Internet. From
+# what little evidence I could find, it seems that its general directionality
+# is Logical.
+#
+# To sum up all of the above, the Hebrew probing mechanism knows about two
+# charsets:
+# Visual Hebrew - "ISO-8859-8" - backwards text - Words and sentences are
+#    backwards while line order is natural. For charset recognition purposes
+#    the line order is unimportant (In fact, for this implementation, even
+#    word order is unimportant).
+# Logical Hebrew - "windows-1255" - normal, naturally ordered text.
+#
+# "ISO-8859-8-I" is a subset of windows-1255 and doesn't need to be
+#    specifically identified.
+# "x-mac-hebrew" is also identified as windows-1255. A text in x-mac-hebrew
+#    that contain special punctuation marks or diacritics is displayed with
+#    some unconverted characters showing as question marks. This problem might
+#    be corrected using another model prober for x-mac-hebrew. Due to the fact
+#    that x-mac-hebrew texts are so rare, writing another model prober isn't
+#    worth the effort and performance hit.
+#
+#### The Prober ####
+#
+# The prober is divided between two SBCharSetProbers and a HebrewProber,
+# all of which are managed, created, fed data, inquired and deleted by the
+# SBCSGroupProber. The two SBCharSetProbers identify that the text is in
+# fact some kind of Hebrew, Logical or Visual. The final decision about which
+# one is it is made by the HebrewProber by combining final-letter scores
+# with the scores of the two SBCharSetProbers to produce a final answer.
+#
+# The SBCSGroupProber is responsible for stripping the original text of HTML
+# tags, English characters, numbers, low-ASCII punctuation characters, spaces
+# and new lines. It reduces any sequence of such characters to a single space.
+# The buffer fed to each prober in the SBCS group prober is pure text in
+# high-ASCII.
+# The two SBCharSetProbers (model probers) share the same language model:
+# Win1255Model.
+# The first SBCharSetProber uses the model normally as any other
+# SBCharSetProber does, to recognize windows-1255, upon which this model was
+# built. The second SBCharSetProber is told to make the pair-of-letter
+# lookup in the language model backwards. This in practice exactly simulates
+# a visual Hebrew model using the windows-1255 logical Hebrew model.
+#
+# The HebrewProber is not using any language model. All it does is look for
+# final-letter evidence suggesting the text is either logical Hebrew or visual
+# Hebrew. Disjointed from the model probers, the results of the HebrewProber
+# alone are meaningless. HebrewProber always returns 0.00 as confidence
+# since it never identifies a charset by itself. Instead, the pointer to the
+# HebrewProber is passed to the model probers as a helper "Name Prober".
+# When the Group prober receives a positive identification from any prober,
+# it asks for the name of the charset identified. If the prober queried is a
+# Hebrew model prober, the model prober forwards the call to the
+# HebrewProber to make the final decision. In the HebrewProber, the
+# decision is made according to the final-letters scores maintained and Both
+# model probers scores. The answer is returned in the form of the name of the
+# charset identified, either "windows-1255" or "ISO-8859-8".
+
+class HebrewProber(CharSetProber):
+    # windows-1255 / ISO-8859-8 code points of interest
+    FINAL_KAF = 0xea
+    NORMAL_KAF = 0xeb
+    FINAL_MEM = 0xed
+    NORMAL_MEM = 0xee
+    FINAL_NUN = 0xef
+    NORMAL_NUN = 0xf0
+    FINAL_PE = 0xf3
+    NORMAL_PE = 0xf4
+    FINAL_TSADI = 0xf5
+    NORMAL_TSADI = 0xf6
+
+    # Minimum Visual vs Logical final letter score difference.
+    # If the difference is below this, don't rely solely on the final letter score
+    # distance.
+    MIN_FINAL_CHAR_DISTANCE = 5
+
+    # Minimum Visual vs Logical model score difference.
+    # If the difference is below this, don't rely at all on the model score
+    # distance.
+    MIN_MODEL_DISTANCE = 0.01
+
+    VISUAL_HEBREW_NAME = "ISO-8859-8"
+    LOGICAL_HEBREW_NAME = "windows-1255"
+
+    def __init__(self):
+        super(HebrewProber, self).__init__()
+        self._final_char_logical_score = None
+        self._final_char_visual_score = None
+        self._prev = None
+        self._before_prev = None
+        self._logical_prober = None
+        self._visual_prober = None
+        self.reset()
+
+    def reset(self):
+        self._final_char_logical_score = 0
+        self._final_char_visual_score = 0
+        # The two last characters seen in the previous buffer,
+        # mPrev and mBeforePrev are initialized to space in order to simulate
+        # a word delimiter at the beginning of the data
+        self._prev = ' '
+        self._before_prev = ' '
+        # These probers are owned by the group prober.
+
+    def set_model_probers(self, logicalProber, visualProber):
+        self._logical_prober = logicalProber
+        self._visual_prober = visualProber
+
+    def is_final(self, c):
+        return c in [self.FINAL_KAF, self.FINAL_MEM, self.FINAL_NUN,
+                     self.FINAL_PE, self.FINAL_TSADI]
+
+    def is_non_final(self, c):
+        # The normal Tsadi is not a good Non-Final letter due to words like
+        # 'lechotet' (to chat) containing an apostrophe after the tsadi. This
+        # apostrophe is converted to a space in FilterWithoutEnglishLetters
+        # causing the Non-Final tsadi to appear at an end of a word even
+        # though this is not the case in the original text.
+        # The letters Pe and Kaf rarely display a related behavior of not being
+        # a good Non-Final letter. Words like 'Pop', 'Winamp' and 'Mubarak'
+        # for example legally end with a Non-Final Pe or Kaf. However, the
+        # benefit of these letters as Non-Final letters outweighs the damage
+        # since these words are quite rare.
+        return c in [self.NORMAL_KAF, self.NORMAL_MEM,
+                     self.NORMAL_NUN, self.NORMAL_PE]
+
+    def feed(self, byte_str):
+        # Final letter analysis for logical-visual decision.
+        # Look for evidence that the received buffer is either logical Hebrew
+        # or visual Hebrew.
+        # The following cases are checked:
+        # 1) A word longer than 1 letter, ending with a final letter. This is
+        #    an indication that the text is laid out "naturally" since the
+        #    final letter really appears at the end. +1 for logical score.
+        # 2) A word longer than 1 letter, ending with a Non-Final letter. In
+        #    normal Hebrew, words ending with Kaf, Mem, Nun, Pe or Tsadi,
+        #    should not end with the Non-Final form of that letter. Exceptions
+        #    to this rule are mentioned above in isNonFinal(). This is an
+        #    indication that the text is laid out backwards. +1 for visual
+        #    score
+        # 3) A word longer than 1 letter, starting with a final letter. Final
+        #    letters should not appear at the beginning of a word. This is an
+        #    indication that the text is laid out backwards. +1 for visual
+        #    score.
+        #
+        # The visual score and logical score are accumulated throughout the
+        # text and are finally checked against each other in GetCharSetName().
+        # No checking for final letters in the middle of words is done since
+        # that case is not an indication for either Logical or Visual text.
+        #
+        # We automatically filter out all 7-bit characters (replace them with
+        # spaces) so the word boundary detection works properly. [MAP]
+
+        if self.state == ProbingState.NOT_ME:
+            # Both model probers say it's not them. No reason to continue.
+            return ProbingState.NOT_ME
+
+        byte_str = self.filter_high_byte_only(byte_str)
+
+        for cur in byte_str:
+            if cur == ' ':
+                # We stand on a space - a word just ended
+                if self._before_prev != ' ':
+                    # next-to-last char was not a space so self._prev is not a
+                    # 1 letter word
+                    if self.is_final(self._prev):
+                        # case (1) [-2:not space][-1:final letter][cur:space]
+                        self._final_char_logical_score += 1
+                    elif self.is_non_final(self._prev):
+                        # case (2) [-2:not space][-1:Non-Final letter][
+                        #  cur:space]
+                        self._final_char_visual_score += 1
+            else:
+                # Not standing on a space
+                if ((self._before_prev == ' ') and
+                        (self.is_final(self._prev)) and (cur != ' ')):
+                    # case (3) [-2:space][-1:final letter][cur:not space]
+                    self._final_char_visual_score += 1
+            self._before_prev = self._prev
+            self._prev = cur
+
+        # Forever detecting, till the end or until both model probers return
+        # ProbingState.NOT_ME (handled above)
+        return ProbingState.DETECTING
+
+    @property
+    def charset_name(self):
+        # Make the decision: is it Logical or Visual?
+        # If the final letter score distance is dominant enough, rely on it.
+        finalsub = self._final_char_logical_score - self._final_char_visual_score
+        if finalsub >= self.MIN_FINAL_CHAR_DISTANCE:
+            return self.LOGICAL_HEBREW_NAME
+        if finalsub <= -self.MIN_FINAL_CHAR_DISTANCE:
+            return self.VISUAL_HEBREW_NAME
+
+        # It's not dominant enough, try to rely on the model scores instead.
+        modelsub = (self._logical_prober.get_confidence()
+                    - self._visual_prober.get_confidence())
+        if modelsub > self.MIN_MODEL_DISTANCE:
+            return self.LOGICAL_HEBREW_NAME
+        if modelsub < -self.MIN_MODEL_DISTANCE:
+            return self.VISUAL_HEBREW_NAME
+
+        # Still no good, back to final letter distance, maybe it'll save the
+        # day.
+        if finalsub < 0.0:
+            return self.VISUAL_HEBREW_NAME
+
+        # (finalsub > 0 - Logical) or (don't know what to do) default to
+        # Logical.
+        return self.LOGICAL_HEBREW_NAME
+
+    @property
+    def language(self):
+        return 'Hebrew'
+
+    @property
+    def state(self):
+        # Remain active as long as any of the model probers are active.
+        if (self._logical_prober.state == ProbingState.NOT_ME) and \
+           (self._visual_prober.state == ProbingState.NOT_ME):
+            return ProbingState.NOT_ME
+        return ProbingState.DETECTING
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/jisfreq.py b/venv/Lib/site-packages/pip/_vendor/chardet/jisfreq.py
new file mode 100644
index 000000000..83fc082b5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/jisfreq.py
@@ -0,0 +1,325 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# Sampling from about 20M text materials include literature and computer technology
+#
+# Japanese frequency table, applied to both S-JIS and EUC-JP
+# They are sorted in order.
+
+# 128  --> 0.77094
+# 256  --> 0.85710
+# 512  --> 0.92635
+# 1024 --> 0.97130
+# 2048 --> 0.99431
+#
+# Ideal Distribution Ratio = 0.92635 / (1-0.92635) = 12.58
+# Random Distribution Ration = 512 / (2965+62+83+86-512) = 0.191
+#
+# Typical Distribution Ratio, 25% of IDR
+
+JIS_TYPICAL_DISTRIBUTION_RATIO = 3.0
+
+# Char to FreqOrder table ,
+JIS_TABLE_SIZE = 4368
+
+JIS_CHAR_TO_FREQ_ORDER = (
+  40,   1,   6, 182, 152, 180, 295,2127, 285, 381,3295,4304,3068,4606,3165,3510, #   16
+3511,1822,2785,4607,1193,2226,5070,4608, 171,2996,1247,  18, 179,5071, 856,1661, #   32
+1262,5072, 619, 127,3431,3512,3230,1899,1700, 232, 228,1294,1298, 284, 283,2041, #   48
+2042,1061,1062,  48,  49,  44,  45, 433, 434,1040,1041, 996, 787,2997,1255,4305, #   64
+2108,4609,1684,1648,5073,5074,5075,5076,5077,5078,3687,5079,4610,5080,3927,3928, #   80
+5081,3296,3432, 290,2285,1471,2187,5082,2580,2825,1303,2140,1739,1445,2691,3375, #   96
+1691,3297,4306,4307,4611, 452,3376,1182,2713,3688,3069,4308,5083,5084,5085,5086, #  112
+5087,5088,5089,5090,5091,5092,5093,5094,5095,5096,5097,5098,5099,5100,5101,5102, #  128
+5103,5104,5105,5106,5107,5108,5109,5110,5111,5112,4097,5113,5114,5115,5116,5117, #  144
+5118,5119,5120,5121,5122,5123,5124,5125,5126,5127,5128,5129,5130,5131,5132,5133, #  160
+5134,5135,5136,5137,5138,5139,5140,5141,5142,5143,5144,5145,5146,5147,5148,5149, #  176
+5150,5151,5152,4612,5153,5154,5155,5156,5157,5158,5159,5160,5161,5162,5163,5164, #  192
+5165,5166,5167,5168,5169,5170,5171,5172,5173,5174,5175,1472, 598, 618, 820,1205, #  208
+1309,1412,1858,1307,1692,5176,5177,5178,5179,5180,5181,5182,1142,1452,1234,1172, #  224
+1875,2043,2149,1793,1382,2973, 925,2404,1067,1241, 960,1377,2935,1491, 919,1217, #  240
+1865,2030,1406,1499,2749,4098,5183,5184,5185,5186,5187,5188,2561,4099,3117,1804, #  256
+2049,3689,4309,3513,1663,5189,3166,3118,3298,1587,1561,3433,5190,3119,1625,2998, #  272
+3299,4613,1766,3690,2786,4614,5191,5192,5193,5194,2161,  26,3377,   2,3929,  20, #  288
+3691,  47,4100,  50,  17,  16,  35, 268,  27, 243,  42, 155,  24, 154,  29, 184, #  304
+   4,  91,  14,  92,  53, 396,  33, 289,   9,  37,  64, 620,  21,  39, 321,   5, #  320
+  12,  11,  52,  13,   3, 208, 138,   0,   7,  60, 526, 141, 151,1069, 181, 275, #  336
+1591,  83, 132,1475, 126, 331, 829,  15,  69, 160,  59,  22, 157,  55,1079, 312, #  352
+ 109,  38,  23,  25,  10,  19,  79,5195,  61, 382,1124,   8,  30,5196,5197,5198, #  368
+5199,5200,5201,5202,5203,5204,5205,5206,  89,  62,  74,  34,2416, 112, 139, 196, #  384
+ 271, 149,  84, 607, 131, 765,  46,  88, 153, 683,  76, 874, 101, 258,  57,  80, #  400
+  32, 364, 121,1508, 169,1547,  68, 235, 145,2999,  41, 360,3027,  70,  63,  31, #  416
+  43, 259, 262,1383,  99, 533, 194,  66,  93, 846, 217, 192,  56, 106,  58, 565, #  432
+ 280, 272, 311, 256, 146,  82, 308,  71, 100, 128, 214, 655, 110, 261, 104,1140, #  448
+  54,  51,  36,  87,  67,3070, 185,2618,2936,2020,  28,1066,2390,2059,5207,5208, #  464
+5209,5210,5211,5212,5213,5214,5215,5216,4615,5217,5218,5219,5220,5221,5222,5223, #  480
+5224,5225,5226,5227,5228,5229,5230,5231,5232,5233,5234,5235,5236,3514,5237,5238, #  496
+5239,5240,5241,5242,5243,5244,2297,2031,4616,4310,3692,5245,3071,5246,3598,5247, #  512
+4617,3231,3515,5248,4101,4311,4618,3808,4312,4102,5249,4103,4104,3599,5250,5251, #  528
+5252,5253,5254,5255,5256,5257,5258,5259,5260,5261,5262,5263,5264,5265,5266,5267, #  544
+5268,5269,5270,5271,5272,5273,5274,5275,5276,5277,5278,5279,5280,5281,5282,5283, #  560
+5284,5285,5286,5287,5288,5289,5290,5291,5292,5293,5294,5295,5296,5297,5298,5299, #  576
+5300,5301,5302,5303,5304,5305,5306,5307,5308,5309,5310,5311,5312,5313,5314,5315, #  592
+5316,5317,5318,5319,5320,5321,5322,5323,5324,5325,5326,5327,5328,5329,5330,5331, #  608
+5332,5333,5334,5335,5336,5337,5338,5339,5340,5341,5342,5343,5344,5345,5346,5347, #  624
+5348,5349,5350,5351,5352,5353,5354,5355,5356,5357,5358,5359,5360,5361,5362,5363, #  640
+5364,5365,5366,5367,5368,5369,5370,5371,5372,5373,5374,5375,5376,5377,5378,5379, #  656
+5380,5381, 363, 642,2787,2878,2788,2789,2316,3232,2317,3434,2011, 165,1942,3930, #  672
+3931,3932,3933,5382,4619,5383,4620,5384,5385,5386,5387,5388,5389,5390,5391,5392, #  688
+5393,5394,5395,5396,5397,5398,5399,5400,5401,5402,5403,5404,5405,5406,5407,5408, #  704
+5409,5410,5411,5412,5413,5414,5415,5416,5417,5418,5419,5420,5421,5422,5423,5424, #  720
+5425,5426,5427,5428,5429,5430,5431,5432,5433,5434,5435,5436,5437,5438,5439,5440, #  736
+5441,5442,5443,5444,5445,5446,5447,5448,5449,5450,5451,5452,5453,5454,5455,5456, #  752
+5457,5458,5459,5460,5461,5462,5463,5464,5465,5466,5467,5468,5469,5470,5471,5472, #  768
+5473,5474,5475,5476,5477,5478,5479,5480,5481,5482,5483,5484,5485,5486,5487,5488, #  784
+5489,5490,5491,5492,5493,5494,5495,5496,5497,5498,5499,5500,5501,5502,5503,5504, #  800
+5505,5506,5507,5508,5509,5510,5511,5512,5513,5514,5515,5516,5517,5518,5519,5520, #  816
+5521,5522,5523,5524,5525,5526,5527,5528,5529,5530,5531,5532,5533,5534,5535,5536, #  832
+5537,5538,5539,5540,5541,5542,5543,5544,5545,5546,5547,5548,5549,5550,5551,5552, #  848
+5553,5554,5555,5556,5557,5558,5559,5560,5561,5562,5563,5564,5565,5566,5567,5568, #  864
+5569,5570,5571,5572,5573,5574,5575,5576,5577,5578,5579,5580,5581,5582,5583,5584, #  880
+5585,5586,5587,5588,5589,5590,5591,5592,5593,5594,5595,5596,5597,5598,5599,5600, #  896
+5601,5602,5603,5604,5605,5606,5607,5608,5609,5610,5611,5612,5613,5614,5615,5616, #  912
+5617,5618,5619,5620,5621,5622,5623,5624,5625,5626,5627,5628,5629,5630,5631,5632, #  928
+5633,5634,5635,5636,5637,5638,5639,5640,5641,5642,5643,5644,5645,5646,5647,5648, #  944
+5649,5650,5651,5652,5653,5654,5655,5656,5657,5658,5659,5660,5661,5662,5663,5664, #  960
+5665,5666,5667,5668,5669,5670,5671,5672,5673,5674,5675,5676,5677,5678,5679,5680, #  976
+5681,5682,5683,5684,5685,5686,5687,5688,5689,5690,5691,5692,5693,5694,5695,5696, #  992
+5697,5698,5699,5700,5701,5702,5703,5704,5705,5706,5707,5708,5709,5710,5711,5712, # 1008
+5713,5714,5715,5716,5717,5718,5719,5720,5721,5722,5723,5724,5725,5726,5727,5728, # 1024
+5729,5730,5731,5732,5733,5734,5735,5736,5737,5738,5739,5740,5741,5742,5743,5744, # 1040
+5745,5746,5747,5748,5749,5750,5751,5752,5753,5754,5755,5756,5757,5758,5759,5760, # 1056
+5761,5762,5763,5764,5765,5766,5767,5768,5769,5770,5771,5772,5773,5774,5775,5776, # 1072
+5777,5778,5779,5780,5781,5782,5783,5784,5785,5786,5787,5788,5789,5790,5791,5792, # 1088
+5793,5794,5795,5796,5797,5798,5799,5800,5801,5802,5803,5804,5805,5806,5807,5808, # 1104
+5809,5810,5811,5812,5813,5814,5815,5816,5817,5818,5819,5820,5821,5822,5823,5824, # 1120
+5825,5826,5827,5828,5829,5830,5831,5832,5833,5834,5835,5836,5837,5838,5839,5840, # 1136
+5841,5842,5843,5844,5845,5846,5847,5848,5849,5850,5851,5852,5853,5854,5855,5856, # 1152
+5857,5858,5859,5860,5861,5862,5863,5864,5865,5866,5867,5868,5869,5870,5871,5872, # 1168
+5873,5874,5875,5876,5877,5878,5879,5880,5881,5882,5883,5884,5885,5886,5887,5888, # 1184
+5889,5890,5891,5892,5893,5894,5895,5896,5897,5898,5899,5900,5901,5902,5903,5904, # 1200
+5905,5906,5907,5908,5909,5910,5911,5912,5913,5914,5915,5916,5917,5918,5919,5920, # 1216
+5921,5922,5923,5924,5925,5926,5927,5928,5929,5930,5931,5932,5933,5934,5935,5936, # 1232
+5937,5938,5939,5940,5941,5942,5943,5944,5945,5946,5947,5948,5949,5950,5951,5952, # 1248
+5953,5954,5955,5956,5957,5958,5959,5960,5961,5962,5963,5964,5965,5966,5967,5968, # 1264
+5969,5970,5971,5972,5973,5974,5975,5976,5977,5978,5979,5980,5981,5982,5983,5984, # 1280
+5985,5986,5987,5988,5989,5990,5991,5992,5993,5994,5995,5996,5997,5998,5999,6000, # 1296
+6001,6002,6003,6004,6005,6006,6007,6008,6009,6010,6011,6012,6013,6014,6015,6016, # 1312
+6017,6018,6019,6020,6021,6022,6023,6024,6025,6026,6027,6028,6029,6030,6031,6032, # 1328
+6033,6034,6035,6036,6037,6038,6039,6040,6041,6042,6043,6044,6045,6046,6047,6048, # 1344
+6049,6050,6051,6052,6053,6054,6055,6056,6057,6058,6059,6060,6061,6062,6063,6064, # 1360
+6065,6066,6067,6068,6069,6070,6071,6072,6073,6074,6075,6076,6077,6078,6079,6080, # 1376
+6081,6082,6083,6084,6085,6086,6087,6088,6089,6090,6091,6092,6093,6094,6095,6096, # 1392
+6097,6098,6099,6100,6101,6102,6103,6104,6105,6106,6107,6108,6109,6110,6111,6112, # 1408
+6113,6114,2044,2060,4621, 997,1235, 473,1186,4622, 920,3378,6115,6116, 379,1108, # 1424
+4313,2657,2735,3934,6117,3809, 636,3233, 573,1026,3693,3435,2974,3300,2298,4105, # 1440
+ 854,2937,2463, 393,2581,2417, 539, 752,1280,2750,2480, 140,1161, 440, 708,1569, # 1456
+ 665,2497,1746,1291,1523,3000, 164,1603, 847,1331, 537,1997, 486, 508,1693,2418, # 1472
+1970,2227, 878,1220, 299,1030, 969, 652,2751, 624,1137,3301,2619,  65,3302,2045, # 1488
+1761,1859,3120,1930,3694,3516, 663,1767, 852, 835,3695, 269, 767,2826,2339,1305, # 1504
+ 896,1150, 770,1616,6118, 506,1502,2075,1012,2519, 775,2520,2975,2340,2938,4314, # 1520
+3028,2086,1224,1943,2286,6119,3072,4315,2240,1273,1987,3935,1557, 175, 597, 985, # 1536
+3517,2419,2521,1416,3029, 585, 938,1931,1007,1052,1932,1685,6120,3379,4316,4623, # 1552
+ 804, 599,3121,1333,2128,2539,1159,1554,2032,3810, 687,2033,2904, 952, 675,1467, # 1568
+3436,6121,2241,1096,1786,2440,1543,1924, 980,1813,2228, 781,2692,1879, 728,1918, # 1584
+3696,4624, 548,1950,4625,1809,1088,1356,3303,2522,1944, 502, 972, 373, 513,2827, # 1600
+ 586,2377,2391,1003,1976,1631,6122,2464,1084, 648,1776,4626,2141, 324, 962,2012, # 1616
+2177,2076,1384, 742,2178,1448,1173,1810, 222, 102, 301, 445, 125,2420, 662,2498, # 1632
+ 277, 200,1476,1165,1068, 224,2562,1378,1446, 450,1880, 659, 791, 582,4627,2939, # 1648
+3936,1516,1274, 555,2099,3697,1020,1389,1526,3380,1762,1723,1787,2229, 412,2114, # 1664
+1900,2392,3518, 512,2597, 427,1925,2341,3122,1653,1686,2465,2499, 697, 330, 273, # 1680
+ 380,2162, 951, 832, 780, 991,1301,3073, 965,2270,3519, 668,2523,2636,1286, 535, # 1696
+1407, 518, 671, 957,2658,2378, 267, 611,2197,3030,6123, 248,2299, 967,1799,2356, # 1712
+ 850,1418,3437,1876,1256,1480,2828,1718,6124,6125,1755,1664,2405,6126,4628,2879, # 1728
+2829, 499,2179, 676,4629, 557,2329,2214,2090, 325,3234, 464, 811,3001, 992,2342, # 1744
+2481,1232,1469, 303,2242, 466,1070,2163, 603,1777,2091,4630,2752,4631,2714, 322, # 1760
+2659,1964,1768, 481,2188,1463,2330,2857,3600,2092,3031,2421,4632,2318,2070,1849, # 1776
+2598,4633,1302,2254,1668,1701,2422,3811,2905,3032,3123,2046,4106,1763,1694,4634, # 1792
+1604, 943,1724,1454, 917, 868,2215,1169,2940, 552,1145,1800,1228,1823,1955, 316, # 1808
+1080,2510, 361,1807,2830,4107,2660,3381,1346,1423,1134,4108,6127, 541,1263,1229, # 1824
+1148,2540, 545, 465,1833,2880,3438,1901,3074,2482, 816,3937, 713,1788,2500, 122, # 1840
+1575, 195,1451,2501,1111,6128, 859, 374,1225,2243,2483,4317, 390,1033,3439,3075, # 1856
+2524,1687, 266, 793,1440,2599, 946, 779, 802, 507, 897,1081, 528,2189,1292, 711, # 1872
+1866,1725,1167,1640, 753, 398,2661,1053, 246, 348,4318, 137,1024,3440,1600,2077, # 1888
+2129, 825,4319, 698, 238, 521, 187,2300,1157,2423,1641,1605,1464,1610,1097,2541, # 1904
+1260,1436, 759,2255,1814,2150, 705,3235, 409,2563,3304, 561,3033,2005,2564, 726, # 1920
+1956,2343,3698,4109, 949,3812,3813,3520,1669, 653,1379,2525, 881,2198, 632,2256, # 1936
+1027, 778,1074, 733,1957, 514,1481,2466, 554,2180, 702,3938,1606,1017,1398,6129, # 1952
+1380,3521, 921, 993,1313, 594, 449,1489,1617,1166, 768,1426,1360, 495,1794,3601, # 1968
+1177,3602,1170,4320,2344, 476, 425,3167,4635,3168,1424, 401,2662,1171,3382,1998, # 1984
+1089,4110, 477,3169, 474,6130,1909, 596,2831,1842, 494, 693,1051,1028,1207,3076, # 2000
+ 606,2115, 727,2790,1473,1115, 743,3522, 630, 805,1532,4321,2021, 366,1057, 838, # 2016
+ 684,1114,2142,4322,2050,1492,1892,1808,2271,3814,2424,1971,1447,1373,3305,1090, # 2032
+1536,3939,3523,3306,1455,2199, 336, 369,2331,1035, 584,2393, 902, 718,2600,6131, # 2048
+2753, 463,2151,1149,1611,2467, 715,1308,3124,1268, 343,1413,3236,1517,1347,2663, # 2064
+2093,3940,2022,1131,1553,2100,2941,1427,3441,2942,1323,2484,6132,1980, 872,2368, # 2080
+2441,2943, 320,2369,2116,1082, 679,1933,3941,2791,3815, 625,1143,2023, 422,2200, # 2096
+3816,6133, 730,1695, 356,2257,1626,2301,2858,2637,1627,1778, 937, 883,2906,2693, # 2112
+3002,1769,1086, 400,1063,1325,3307,2792,4111,3077, 456,2345,1046, 747,6134,1524, # 2128
+ 884,1094,3383,1474,2164,1059, 974,1688,2181,2258,1047, 345,1665,1187, 358, 875, # 2144
+3170, 305, 660,3524,2190,1334,1135,3171,1540,1649,2542,1527, 927, 968,2793, 885, # 2160
+1972,1850, 482, 500,2638,1218,1109,1085,2543,1654,2034, 876,  78,2287,1482,1277, # 2176
+ 861,1675,1083,1779, 724,2754, 454, 397,1132,1612,2332, 893, 672,1237, 257,2259, # 2192
+2370, 135,3384, 337,2244, 547, 352, 340, 709,2485,1400, 788,1138,2511, 540, 772, # 2208
+1682,2260,2272,2544,2013,1843,1902,4636,1999,1562,2288,4637,2201,1403,1533, 407, # 2224
+ 576,3308,1254,2071, 978,3385, 170, 136,1201,3125,2664,3172,2394, 213, 912, 873, # 2240
+3603,1713,2202, 699,3604,3699, 813,3442, 493, 531,1054, 468,2907,1483, 304, 281, # 2256
+4112,1726,1252,2094, 339,2319,2130,2639, 756,1563,2944, 748, 571,2976,1588,2425, # 2272
+2715,1851,1460,2426,1528,1392,1973,3237, 288,3309, 685,3386, 296, 892,2716,2216, # 2288
+1570,2245, 722,1747,2217, 905,3238,1103,6135,1893,1441,1965, 251,1805,2371,3700, # 2304
+2601,1919,1078,  75,2182,1509,1592,1270,2640,4638,2152,6136,3310,3817, 524, 706, # 2320
+1075, 292,3818,1756,2602, 317,  98,3173,3605,3525,1844,2218,3819,2502, 814, 567, # 2336
+ 385,2908,1534,6137, 534,1642,3239, 797,6138,1670,1529, 953,4323, 188,1071, 538, # 2352
+ 178, 729,3240,2109,1226,1374,2000,2357,2977, 731,2468,1116,2014,2051,6139,1261, # 2368
+1593, 803,2859,2736,3443, 556, 682, 823,1541,6140,1369,2289,1706,2794, 845, 462, # 2384
+2603,2665,1361, 387, 162,2358,1740, 739,1770,1720,1304,1401,3241,1049, 627,1571, # 2400
+2427,3526,1877,3942,1852,1500, 431,1910,1503, 677, 297,2795, 286,1433,1038,1198, # 2416
+2290,1133,1596,4113,4639,2469,1510,1484,3943,6141,2442, 108, 712,4640,2372, 866, # 2432
+3701,2755,3242,1348, 834,1945,1408,3527,2395,3243,1811, 824, 994,1179,2110,1548, # 2448
+1453, 790,3003, 690,4324,4325,2832,2909,3820,1860,3821, 225,1748, 310, 346,1780, # 2464
+2470, 821,1993,2717,2796, 828, 877,3528,2860,2471,1702,2165,2910,2486,1789, 453, # 2480
+ 359,2291,1676,  73,1164,1461,1127,3311, 421, 604, 314,1037, 589, 116,2487, 737, # 2496
+ 837,1180, 111, 244, 735,6142,2261,1861,1362, 986, 523, 418, 581,2666,3822, 103, # 2512
+ 855, 503,1414,1867,2488,1091, 657,1597, 979, 605,1316,4641,1021,2443,2078,2001, # 2528
+1209,  96, 587,2166,1032, 260,1072,2153, 173,  94, 226,3244, 819,2006,4642,4114, # 2544
+2203, 231,1744, 782,  97,2667, 786,3387, 887, 391, 442,2219,4326,1425,6143,2694, # 2560
+ 633,1544,1202, 483,2015, 592,2052,1958,2472,1655, 419, 129,4327,3444,3312,1714, # 2576
+1257,3078,4328,1518,1098, 865,1310,1019,1885,1512,1734, 469,2444, 148, 773, 436, # 2592
+1815,1868,1128,1055,4329,1245,2756,3445,2154,1934,1039,4643, 579,1238, 932,2320, # 2608
+ 353, 205, 801, 115,2428, 944,2321,1881, 399,2565,1211, 678, 766,3944, 335,2101, # 2624
+1459,1781,1402,3945,2737,2131,1010, 844, 981,1326,1013, 550,1816,1545,2620,1335, # 2640
+1008, 371,2881, 936,1419,1613,3529,1456,1395,2273,1834,2604,1317,2738,2503, 416, # 2656
+1643,4330, 806,1126, 229, 591,3946,1314,1981,1576,1837,1666, 347,1790, 977,3313, # 2672
+ 764,2861,1853, 688,2429,1920,1462,  77, 595, 415,2002,3034, 798,1192,4115,6144, # 2688
+2978,4331,3035,2695,2582,2072,2566, 430,2430,1727, 842,1396,3947,3702, 613, 377, # 2704
+ 278, 236,1417,3388,3314,3174, 757,1869, 107,3530,6145,1194, 623,2262, 207,1253, # 2720
+2167,3446,3948, 492,1117,1935, 536,1838,2757,1246,4332, 696,2095,2406,1393,1572, # 2736
+3175,1782, 583, 190, 253,1390,2230, 830,3126,3389, 934,3245,1703,1749,2979,1870, # 2752
+2545,1656,2204, 869,2346,4116,3176,1817, 496,1764,4644, 942,1504, 404,1903,1122, # 2768
+1580,3606,2945,1022, 515, 372,1735, 955,2431,3036,6146,2797,1110,2302,2798, 617, # 2784
+6147, 441, 762,1771,3447,3607,3608,1904, 840,3037,  86, 939,1385, 572,1370,2445, # 2800
+1336, 114,3703, 898, 294, 203,3315, 703,1583,2274, 429, 961,4333,1854,1951,3390, # 2816
+2373,3704,4334,1318,1381, 966,1911,2322,1006,1155, 309, 989, 458,2718,1795,1372, # 2832
+1203, 252,1689,1363,3177, 517,1936, 168,1490, 562, 193,3823,1042,4117,1835, 551, # 2848
+ 470,4645, 395, 489,3448,1871,1465,2583,2641, 417,1493, 279,1295, 511,1236,1119, # 2864
+  72,1231,1982,1812,3004, 871,1564, 984,3449,1667,2696,2096,4646,2347,2833,1673, # 2880
+3609, 695,3246,2668, 807,1183,4647, 890, 388,2333,1801,1457,2911,1765,1477,1031, # 2896
+3316,3317,1278,3391,2799,2292,2526, 163,3450,4335,2669,1404,1802,6148,2323,2407, # 2912
+1584,1728,1494,1824,1269, 298, 909,3318,1034,1632, 375, 776,1683,2061, 291, 210, # 2928
+1123, 809,1249,1002,2642,3038, 206,1011,2132, 144, 975, 882,1565, 342, 667, 754, # 2944
+1442,2143,1299,2303,2062, 447, 626,2205,1221,2739,2912,1144,1214,2206,2584, 760, # 2960
+1715, 614, 950,1281,2670,2621, 810, 577,1287,2546,4648, 242,2168, 250,2643, 691, # 2976
+ 123,2644, 647, 313,1029, 689,1357,2946,1650, 216, 771,1339,1306, 808,2063, 549, # 2992
+ 913,1371,2913,2914,6149,1466,1092,1174,1196,1311,2605,2396,1783,1796,3079, 406, # 3008
+2671,2117,3949,4649, 487,1825,2220,6150,2915, 448,2348,1073,6151,2397,1707, 130, # 3024
+ 900,1598, 329, 176,1959,2527,1620,6152,2275,4336,3319,1983,2191,3705,3610,2155, # 3040
+3706,1912,1513,1614,6153,1988, 646, 392,2304,1589,3320,3039,1826,1239,1352,1340, # 3056
+2916, 505,2567,1709,1437,2408,2547, 906,6154,2672, 384,1458,1594,1100,1329, 710, # 3072
+ 423,3531,2064,2231,2622,1989,2673,1087,1882, 333, 841,3005,1296,2882,2379, 580, # 3088
+1937,1827,1293,2585, 601, 574, 249,1772,4118,2079,1120, 645, 901,1176,1690, 795, # 3104
+2207, 478,1434, 516,1190,1530, 761,2080, 930,1264, 355, 435,1552, 644,1791, 987, # 3120
+ 220,1364,1163,1121,1538, 306,2169,1327,1222, 546,2645, 218, 241, 610,1704,3321, # 3136
+1984,1839,1966,2528, 451,6155,2586,3707,2568, 907,3178, 254,2947, 186,1845,4650, # 3152
+ 745, 432,1757, 428,1633, 888,2246,2221,2489,3611,2118,1258,1265, 956,3127,1784, # 3168
+4337,2490, 319, 510, 119, 457,3612, 274,2035,2007,4651,1409,3128, 970,2758, 590, # 3184
+2800, 661,2247,4652,2008,3950,1420,1549,3080,3322,3951,1651,1375,2111, 485,2491, # 3200
+1429,1156,6156,2548,2183,1495, 831,1840,2529,2446, 501,1657, 307,1894,3247,1341, # 3216
+ 666, 899,2156,1539,2549,1559, 886, 349,2208,3081,2305,1736,3824,2170,2759,1014, # 3232
+1913,1386, 542,1397,2948, 490, 368, 716, 362, 159, 282,2569,1129,1658,1288,1750, # 3248
+2674, 276, 649,2016, 751,1496, 658,1818,1284,1862,2209,2087,2512,3451, 622,2834, # 3264
+ 376, 117,1060,2053,1208,1721,1101,1443, 247,1250,3179,1792,3952,2760,2398,3953, # 3280
+6157,2144,3708, 446,2432,1151,2570,3452,2447,2761,2835,1210,2448,3082, 424,2222, # 3296
+1251,2449,2119,2836, 504,1581,4338, 602, 817, 857,3825,2349,2306, 357,3826,1470, # 3312
+1883,2883, 255, 958, 929,2917,3248, 302,4653,1050,1271,1751,2307,1952,1430,2697, # 3328
+2719,2359, 354,3180, 777, 158,2036,4339,1659,4340,4654,2308,2949,2248,1146,2232, # 3344
+3532,2720,1696,2623,3827,6158,3129,1550,2698,1485,1297,1428, 637, 931,2721,2145, # 3360
+ 914,2550,2587,  81,2450, 612, 827,2646,1242,4655,1118,2884, 472,1855,3181,3533, # 3376
+3534, 569,1353,2699,1244,1758,2588,4119,2009,2762,2171,3709,1312,1531,6159,1152, # 3392
+1938, 134,1830, 471,3710,2276,1112,1535,3323,3453,3535, 982,1337,2950, 488, 826, # 3408
+ 674,1058,1628,4120,2017, 522,2399, 211, 568,1367,3454, 350, 293,1872,1139,3249, # 3424
+1399,1946,3006,1300,2360,3324, 588, 736,6160,2606, 744, 669,3536,3828,6161,1358, # 3440
+ 199, 723, 848, 933, 851,1939,1505,1514,1338,1618,1831,4656,1634,3613, 443,2740, # 3456
+3829, 717,1947, 491,1914,6162,2551,1542,4121,1025,6163,1099,1223, 198,3040,2722, # 3472
+ 370, 410,1905,2589, 998,1248,3182,2380, 519,1449,4122,1710, 947, 928,1153,4341, # 3488
+2277, 344,2624,1511, 615, 105, 161,1212,1076,1960,3130,2054,1926,1175,1906,2473, # 3504
+ 414,1873,2801,6164,2309, 315,1319,3325, 318,2018,2146,2157, 963, 631, 223,4342, # 3520
+4343,2675, 479,3711,1197,2625,3712,2676,2361,6165,4344,4123,6166,2451,3183,1886, # 3536
+2184,1674,1330,1711,1635,1506, 799, 219,3250,3083,3954,1677,3713,3326,2081,3614, # 3552
+1652,2073,4657,1147,3041,1752, 643,1961, 147,1974,3955,6167,1716,2037, 918,3007, # 3568
+1994, 120,1537, 118, 609,3184,4345, 740,3455,1219, 332,1615,3830,6168,1621,2980, # 3584
+1582, 783, 212, 553,2350,3714,1349,2433,2082,4124, 889,6169,2310,1275,1410, 973, # 3600
+ 166,1320,3456,1797,1215,3185,2885,1846,2590,2763,4658, 629, 822,3008, 763, 940, # 3616
+1990,2862, 439,2409,1566,1240,1622, 926,1282,1907,2764, 654,2210,1607, 327,1130, # 3632
+3956,1678,1623,6170,2434,2192, 686, 608,3831,3715, 903,3957,3042,6171,2741,1522, # 3648
+1915,1105,1555,2552,1359, 323,3251,4346,3457, 738,1354,2553,2311,2334,1828,2003, # 3664
+3832,1753,2351,1227,6172,1887,4125,1478,6173,2410,1874,1712,1847, 520,1204,2607, # 3680
+ 264,4659, 836,2677,2102, 600,4660,3833,2278,3084,6174,4347,3615,1342, 640, 532, # 3696
+ 543,2608,1888,2400,2591,1009,4348,1497, 341,1737,3616,2723,1394, 529,3252,1321, # 3712
+ 983,4661,1515,2120, 971,2592, 924, 287,1662,3186,4349,2700,4350,1519, 908,1948, # 3728
+2452, 156, 796,1629,1486,2223,2055, 694,4126,1259,1036,3392,1213,2249,2742,1889, # 3744
+1230,3958,1015, 910, 408, 559,3617,4662, 746, 725, 935,4663,3959,3009,1289, 563, # 3760
+ 867,4664,3960,1567,2981,2038,2626, 988,2263,2381,4351, 143,2374, 704,1895,6175, # 3776
+1188,3716,2088, 673,3085,2362,4352, 484,1608,1921,2765,2918, 215, 904,3618,3537, # 3792
+ 894, 509, 976,3043,2701,3961,4353,2837,2982, 498,6176,6177,1102,3538,1332,3393, # 3808
+1487,1636,1637, 233, 245,3962, 383, 650, 995,3044, 460,1520,1206,2352, 749,3327, # 3824
+ 530, 700, 389,1438,1560,1773,3963,2264, 719,2951,2724,3834, 870,1832,1644,1000, # 3840
+ 839,2474,3717, 197,1630,3394, 365,2886,3964,1285,2133, 734, 922, 818,1106, 732, # 3856
+ 480,2083,1774,3458, 923,2279,1350, 221,3086,  85,2233,2234,3835,1585,3010,2147, # 3872
+1387,1705,2382,1619,2475, 133, 239,2802,1991,1016,2084,2383, 411,2838,1113, 651, # 3888
+1985,1160,3328, 990,1863,3087,1048,1276,2647, 265,2627,1599,3253,2056, 150, 638, # 3904
+2019, 656, 853, 326,1479, 680,1439,4354,1001,1759, 413,3459,3395,2492,1431, 459, # 3920
+4355,1125,3329,2265,1953,1450,2065,2863, 849, 351,2678,3131,3254,3255,1104,1577, # 3936
+ 227,1351,1645,2453,2193,1421,2887, 812,2121, 634,  95,2435, 201,2312,4665,1646, # 3952
+1671,2743,1601,2554,2702,2648,2280,1315,1366,2089,3132,1573,3718,3965,1729,1189, # 3968
+ 328,2679,1077,1940,1136, 558,1283, 964,1195, 621,2074,1199,1743,3460,3619,1896, # 3984
+1916,1890,3836,2952,1154,2112,1064, 862, 378,3011,2066,2113,2803,1568,2839,6178, # 4000
+3088,2919,1941,1660,2004,1992,2194, 142, 707,1590,1708,1624,1922,1023,1836,1233, # 4016
+1004,2313, 789, 741,3620,6179,1609,2411,1200,4127,3719,3720,4666,2057,3721, 593, # 4032
+2840, 367,2920,1878,6180,3461,1521, 628,1168, 692,2211,2649, 300, 720,2067,2571, # 4048
+2953,3396, 959,2504,3966,3539,3462,1977, 701,6181, 954,1043, 800, 681, 183,3722, # 4064
+1803,1730,3540,4128,2103, 815,2314, 174, 467, 230,2454,1093,2134, 755,3541,3397, # 4080
+1141,1162,6182,1738,2039, 270,3256,2513,1005,1647,2185,3837, 858,1679,1897,1719, # 4096
+2954,2324,1806, 402, 670, 167,4129,1498,2158,2104, 750,6183, 915, 189,1680,1551, # 4112
+ 455,4356,1501,2455, 405,1095,2955, 338,1586,1266,1819, 570, 641,1324, 237,1556, # 4128
+2650,1388,3723,6184,1368,2384,1343,1978,3089,2436, 879,3724, 792,1191, 758,3012, # 4144
+1411,2135,1322,4357, 240,4667,1848,3725,1574,6185, 420,3045,1546,1391, 714,4358, # 4160
+1967, 941,1864, 863, 664, 426, 560,1731,2680,1785,2864,1949,2363, 403,3330,1415, # 4176
+1279,2136,1697,2335, 204, 721,2097,3838,  90,6186,2085,2505, 191,3967, 124,2148, # 4192
+1376,1798,1178,1107,1898,1405, 860,4359,1243,1272,2375,2983,1558,2456,1638, 113, # 4208
+3621, 578,1923,2609, 880, 386,4130, 784,2186,2266,1422,2956,2172,1722, 497, 263, # 4224
+2514,1267,2412,2610, 177,2703,3542, 774,1927,1344, 616,1432,1595,1018, 172,4360, # 4240
+2325, 911,4361, 438,1468,3622, 794,3968,2024,2173,1681,1829,2957, 945, 895,3090, # 4256
+ 575,2212,2476, 475,2401,2681, 785,2744,1745,2293,2555,1975,3133,2865, 394,4668, # 4272
+3839, 635,4131, 639, 202,1507,2195,2766,1345,1435,2572,3726,1908,1184,1181,2457, # 4288
+3727,3134,4362, 843,2611, 437, 916,4669, 234, 769,1884,3046,3047,3623, 833,6187, # 4304
+1639,2250,2402,1355,1185,2010,2047, 999, 525,1732,1290,1488,2612, 948,1578,3728, # 4320
+2413,2477,1216,2725,2159, 334,3840,1328,3624,2921,1525,4132, 564,1056, 891,4363, # 4336
+1444,1698,2385,2251,3729,1365,2281,2235,1717,6188, 864,3841,2515, 444, 527,2767, # 4352
+2922,3625, 544, 461,6189, 566, 209,2437,3398,2098,1065,2068,3331,3626,3257,2137, # 4368  #last 512
+)
+
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/jpcntx.py b/venv/Lib/site-packages/pip/_vendor/chardet/jpcntx.py
new file mode 100644
index 000000000..20044e4bc
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/jpcntx.py
@@ -0,0 +1,233 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+
+# This is hiragana 2-char sequence table, the number in each cell represents its frequency category
+jp2CharContext = (
+(0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1),
+(2,4,0,4,0,3,0,4,0,3,4,4,4,2,4,3,3,4,3,2,3,3,4,2,3,3,3,2,4,1,4,3,3,1,5,4,3,4,3,4,3,5,3,0,3,5,4,2,0,3,1,0,3,3,0,3,3,0,1,1,0,4,3,0,3,3,0,4,0,2,0,3,5,5,5,5,4,0,4,1,0,3,4),
+(0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2),
+(0,4,0,5,0,5,0,4,0,4,5,4,4,3,5,3,5,1,5,3,4,3,4,4,3,4,3,3,4,3,5,4,4,3,5,5,3,5,5,5,3,5,5,3,4,5,5,3,1,3,2,0,3,4,0,4,2,0,4,2,1,5,3,2,3,5,0,4,0,2,0,5,4,4,5,4,5,0,4,0,0,4,4),
+(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
+(0,3,0,4,0,3,0,3,0,4,5,4,3,3,3,3,4,3,5,4,4,3,5,4,4,3,4,3,4,4,4,4,5,3,4,4,3,4,5,5,4,5,5,1,4,5,4,3,0,3,3,1,3,3,0,4,4,0,3,3,1,5,3,3,3,5,0,4,0,3,0,4,4,3,4,3,3,0,4,1,1,3,4),
+(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
+(0,4,0,3,0,3,0,4,0,3,4,4,3,2,2,1,2,1,3,1,3,3,3,3,3,4,3,1,3,3,5,3,3,0,4,3,0,5,4,3,3,5,4,4,3,4,4,5,0,1,2,0,1,2,0,2,2,0,1,0,0,5,2,2,1,4,0,3,0,1,0,4,4,3,5,4,3,0,2,1,0,4,3),
+(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
+(0,3,0,5,0,4,0,2,1,4,4,2,4,1,4,2,4,2,4,3,3,3,4,3,3,3,3,1,4,2,3,3,3,1,4,4,1,1,1,4,3,3,2,0,2,4,3,2,0,3,3,0,3,1,1,0,0,0,3,3,0,4,2,2,3,4,0,4,0,3,0,4,4,5,3,4,4,0,3,0,0,1,4),
+(1,4,0,4,0,4,0,4,0,3,5,4,4,3,4,3,5,4,3,3,4,3,5,4,4,4,4,3,4,2,4,3,3,1,5,4,3,2,4,5,4,5,5,4,4,5,4,4,0,3,2,2,3,3,0,4,3,1,3,2,1,4,3,3,4,5,0,3,0,2,0,4,5,5,4,5,4,0,4,0,0,5,4),
+(0,5,0,5,0,4,0,3,0,4,4,3,4,3,3,3,4,0,4,4,4,3,4,3,4,3,3,1,4,2,4,3,4,0,5,4,1,4,5,4,4,5,3,2,4,3,4,3,2,4,1,3,3,3,2,3,2,0,4,3,3,4,3,3,3,4,0,4,0,3,0,4,5,4,4,4,3,0,4,1,0,1,3),
+(0,3,1,4,0,3,0,2,0,3,4,4,3,1,4,2,3,3,4,3,4,3,4,3,4,4,3,2,3,1,5,4,4,1,4,4,3,5,4,4,3,5,5,4,3,4,4,3,1,2,3,1,2,2,0,3,2,0,3,1,0,5,3,3,3,4,3,3,3,3,4,4,4,4,5,4,2,0,3,3,2,4,3),
+(0,2,0,3,0,1,0,1,0,0,3,2,0,0,2,0,1,0,2,1,3,3,3,1,2,3,1,0,1,0,4,2,1,1,3,3,0,4,3,3,1,4,3,3,0,3,3,2,0,0,0,0,1,0,0,2,0,0,0,0,0,4,1,0,2,3,2,2,2,1,3,3,3,4,4,3,2,0,3,1,0,3,3),
+(0,4,0,4,0,3,0,3,0,4,4,4,3,3,3,3,3,3,4,3,4,2,4,3,4,3,3,2,4,3,4,5,4,1,4,5,3,5,4,5,3,5,4,0,3,5,5,3,1,3,3,2,2,3,0,3,4,1,3,3,2,4,3,3,3,4,0,4,0,3,0,4,5,4,4,5,3,0,4,1,0,3,4),
+(0,2,0,3,0,3,0,0,0,2,2,2,1,0,1,0,0,0,3,0,3,0,3,0,1,3,1,0,3,1,3,3,3,1,3,3,3,0,1,3,1,3,4,0,0,3,1,1,0,3,2,0,0,0,0,1,3,0,1,0,0,3,3,2,0,3,0,0,0,0,0,3,4,3,4,3,3,0,3,0,0,2,3),
+(2,3,0,3,0,2,0,1,0,3,3,4,3,1,3,1,1,1,3,1,4,3,4,3,3,3,0,0,3,1,5,4,3,1,4,3,2,5,5,4,4,4,4,3,3,4,4,4,0,2,1,1,3,2,0,1,2,0,0,1,0,4,1,3,3,3,0,3,0,1,0,4,4,4,5,5,3,0,2,0,0,4,4),
+(0,2,0,1,0,3,1,3,0,2,3,3,3,0,3,1,0,0,3,0,3,2,3,1,3,2,1,1,0,0,4,2,1,0,2,3,1,4,3,2,0,4,4,3,1,3,1,3,0,1,0,0,1,0,0,0,1,0,0,0,0,4,1,1,1,2,0,3,0,0,0,3,4,2,4,3,2,0,1,0,0,3,3),
+(0,1,0,4,0,5,0,4,0,2,4,4,2,3,3,2,3,3,5,3,3,3,4,3,4,2,3,0,4,3,3,3,4,1,4,3,2,1,5,5,3,4,5,1,3,5,4,2,0,3,3,0,1,3,0,4,2,0,1,3,1,4,3,3,3,3,0,3,0,1,0,3,4,4,4,5,5,0,3,0,1,4,5),
+(0,2,0,3,0,3,0,0,0,2,3,1,3,0,4,0,1,1,3,0,3,4,3,2,3,1,0,3,3,2,3,1,3,0,2,3,0,2,1,4,1,2,2,0,0,3,3,0,0,2,0,0,0,1,0,0,0,0,2,2,0,3,2,1,3,3,0,2,0,2,0,0,3,3,1,2,4,0,3,0,2,2,3),
+(2,4,0,5,0,4,0,4,0,2,4,4,4,3,4,3,3,3,1,2,4,3,4,3,4,4,5,0,3,3,3,3,2,0,4,3,1,4,3,4,1,4,4,3,3,4,4,3,1,2,3,0,4,2,0,4,1,0,3,3,0,4,3,3,3,4,0,4,0,2,0,3,5,3,4,5,2,0,3,0,0,4,5),
+(0,3,0,4,0,1,0,1,0,1,3,2,2,1,3,0,3,0,2,0,2,0,3,0,2,0,0,0,1,0,1,1,0,0,3,1,0,0,0,4,0,3,1,0,2,1,3,0,0,0,0,0,0,3,0,0,0,0,0,0,0,4,2,2,3,1,0,3,0,0,0,1,4,4,4,3,0,0,4,0,0,1,4),
+(1,4,1,5,0,3,0,3,0,4,5,4,4,3,5,3,3,4,4,3,4,1,3,3,3,3,2,1,4,1,5,4,3,1,4,4,3,5,4,4,3,5,4,3,3,4,4,4,0,3,3,1,2,3,0,3,1,0,3,3,0,5,4,4,4,4,4,4,3,3,5,4,4,3,3,5,4,0,3,2,0,4,4),
+(0,2,0,3,0,1,0,0,0,1,3,3,3,2,4,1,3,0,3,1,3,0,2,2,1,1,0,0,2,0,4,3,1,0,4,3,0,4,4,4,1,4,3,1,1,3,3,1,0,2,0,0,1,3,0,0,0,0,2,0,0,4,3,2,4,3,5,4,3,3,3,4,3,3,4,3,3,0,2,1,0,3,3),
+(0,2,0,4,0,3,0,2,0,2,5,5,3,4,4,4,4,1,4,3,3,0,4,3,4,3,1,3,3,2,4,3,0,3,4,3,0,3,4,4,2,4,4,0,4,5,3,3,2,2,1,1,1,2,0,1,5,0,3,3,2,4,3,3,3,4,0,3,0,2,0,4,4,3,5,5,0,0,3,0,2,3,3),
+(0,3,0,4,0,3,0,1,0,3,4,3,3,1,3,3,3,0,3,1,3,0,4,3,3,1,1,0,3,0,3,3,0,0,4,4,0,1,5,4,3,3,5,0,3,3,4,3,0,2,0,1,1,1,0,1,3,0,1,2,1,3,3,2,3,3,0,3,0,1,0,1,3,3,4,4,1,0,1,2,2,1,3),
+(0,1,0,4,0,4,0,3,0,1,3,3,3,2,3,1,1,0,3,0,3,3,4,3,2,4,2,0,1,0,4,3,2,0,4,3,0,5,3,3,2,4,4,4,3,3,3,4,0,1,3,0,0,1,0,0,1,0,0,0,0,4,2,3,3,3,0,3,0,0,0,4,4,4,5,3,2,0,3,3,0,3,5),
+(0,2,0,3,0,0,0,3,0,1,3,0,2,0,0,0,1,0,3,1,1,3,3,0,0,3,0,0,3,0,2,3,1,0,3,1,0,3,3,2,0,4,2,2,0,2,0,0,0,4,0,0,0,0,0,0,0,0,0,0,0,2,1,2,0,1,0,1,0,0,0,1,3,1,2,0,0,0,1,0,0,1,4),
+(0,3,0,3,0,5,0,1,0,2,4,3,1,3,3,2,1,1,5,2,1,0,5,1,2,0,0,0,3,3,2,2,3,2,4,3,0,0,3,3,1,3,3,0,2,5,3,4,0,3,3,0,1,2,0,2,2,0,3,2,0,2,2,3,3,3,0,2,0,1,0,3,4,4,2,5,4,0,3,0,0,3,5),
+(0,3,0,3,0,3,0,1,0,3,3,3,3,0,3,0,2,0,2,1,1,0,2,0,1,0,0,0,2,1,0,0,1,0,3,2,0,0,3,3,1,2,3,1,0,3,3,0,0,1,0,0,0,0,0,2,0,0,0,0,0,2,3,1,2,3,0,3,0,1,0,3,2,1,0,4,3,0,1,1,0,3,3),
+(0,4,0,5,0,3,0,3,0,4,5,5,4,3,5,3,4,3,5,3,3,2,5,3,4,4,4,3,4,3,4,5,5,3,4,4,3,4,4,5,4,4,4,3,4,5,5,4,2,3,4,2,3,4,0,3,3,1,4,3,2,4,3,3,5,5,0,3,0,3,0,5,5,5,5,4,4,0,4,0,1,4,4),
+(0,4,0,4,0,3,0,3,0,3,5,4,4,2,3,2,5,1,3,2,5,1,4,2,3,2,3,3,4,3,3,3,3,2,5,4,1,3,3,5,3,4,4,0,4,4,3,1,1,3,1,0,2,3,0,2,3,0,3,0,0,4,3,1,3,4,0,3,0,2,0,4,4,4,3,4,5,0,4,0,0,3,4),
+(0,3,0,3,0,3,1,2,0,3,4,4,3,3,3,0,2,2,4,3,3,1,3,3,3,1,1,0,3,1,4,3,2,3,4,4,2,4,4,4,3,4,4,3,2,4,4,3,1,3,3,1,3,3,0,4,1,0,2,2,1,4,3,2,3,3,5,4,3,3,5,4,4,3,3,0,4,0,3,2,2,4,4),
+(0,2,0,1,0,0,0,0,0,1,2,1,3,0,0,0,0,0,2,0,1,2,1,0,0,1,0,0,0,0,3,0,0,1,0,1,1,3,1,0,0,0,1,1,0,1,1,0,0,0,0,0,2,0,0,0,0,0,0,0,0,1,1,2,2,0,3,4,0,0,0,1,1,0,0,1,0,0,0,0,0,1,1),
+(0,1,0,0,0,1,0,0,0,0,4,0,4,1,4,0,3,0,4,0,3,0,4,0,3,0,3,0,4,1,5,1,4,0,0,3,0,5,0,5,2,0,1,0,0,0,2,1,4,0,1,3,0,0,3,0,0,3,1,1,4,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0),
+(1,4,0,5,0,3,0,2,0,3,5,4,4,3,4,3,5,3,4,3,3,0,4,3,3,3,3,3,3,2,4,4,3,1,3,4,4,5,4,4,3,4,4,1,3,5,4,3,3,3,1,2,2,3,3,1,3,1,3,3,3,5,3,3,4,5,0,3,0,3,0,3,4,3,4,4,3,0,3,0,2,4,3),
+(0,1,0,4,0,0,0,0,0,1,4,0,4,1,4,2,4,0,3,0,1,0,1,0,0,0,0,0,2,0,3,1,1,1,0,3,0,0,0,1,2,1,0,0,1,1,1,1,0,1,0,0,0,1,0,0,3,0,0,0,0,3,2,0,2,2,0,1,0,0,0,2,3,2,3,3,0,0,0,0,2,1,0),
+(0,5,1,5,0,3,0,3,0,5,4,4,5,1,5,3,3,0,4,3,4,3,5,3,4,3,3,2,4,3,4,3,3,0,3,3,1,4,4,3,4,4,4,3,4,5,5,3,2,3,1,1,3,3,1,3,1,1,3,3,2,4,5,3,3,5,0,4,0,3,0,4,4,3,5,3,3,0,3,4,0,4,3),
+(0,5,0,5,0,3,0,2,0,4,4,3,5,2,4,3,3,3,4,4,4,3,5,3,5,3,3,1,4,0,4,3,3,0,3,3,0,4,4,4,4,5,4,3,3,5,5,3,2,3,1,2,3,2,0,1,0,0,3,2,2,4,4,3,1,5,0,4,0,3,0,4,3,1,3,2,1,0,3,3,0,3,3),
+(0,4,0,5,0,5,0,4,0,4,5,5,5,3,4,3,3,2,5,4,4,3,5,3,5,3,4,0,4,3,4,4,3,2,4,4,3,4,5,4,4,5,5,0,3,5,5,4,1,3,3,2,3,3,1,3,1,0,4,3,1,4,4,3,4,5,0,4,0,2,0,4,3,4,4,3,3,0,4,0,0,5,5),
+(0,4,0,4,0,5,0,1,1,3,3,4,4,3,4,1,3,0,5,1,3,0,3,1,3,1,1,0,3,0,3,3,4,0,4,3,0,4,4,4,3,4,4,0,3,5,4,1,0,3,0,0,2,3,0,3,1,0,3,1,0,3,2,1,3,5,0,3,0,1,0,3,2,3,3,4,4,0,2,2,0,4,4),
+(2,4,0,5,0,4,0,3,0,4,5,5,4,3,5,3,5,3,5,3,5,2,5,3,4,3,3,4,3,4,5,3,2,1,5,4,3,2,3,4,5,3,4,1,2,5,4,3,0,3,3,0,3,2,0,2,3,0,4,1,0,3,4,3,3,5,0,3,0,1,0,4,5,5,5,4,3,0,4,2,0,3,5),
+(0,5,0,4,0,4,0,2,0,5,4,3,4,3,4,3,3,3,4,3,4,2,5,3,5,3,4,1,4,3,4,4,4,0,3,5,0,4,4,4,4,5,3,1,3,4,5,3,3,3,3,3,3,3,0,2,2,0,3,3,2,4,3,3,3,5,3,4,1,3,3,5,3,2,0,0,0,0,4,3,1,3,3),
+(0,1,0,3,0,3,0,1,0,1,3,3,3,2,3,3,3,0,3,0,0,0,3,1,3,0,0,0,2,2,2,3,0,0,3,2,0,1,2,4,1,3,3,0,0,3,3,3,0,1,0,0,2,1,0,0,3,0,3,1,0,3,0,0,1,3,0,2,0,1,0,3,3,1,3,3,0,0,1,1,0,3,3),
+(0,2,0,3,0,2,1,4,0,2,2,3,1,1,3,1,1,0,2,0,3,1,2,3,1,3,0,0,1,0,4,3,2,3,3,3,1,4,2,3,3,3,3,1,0,3,1,4,0,1,1,0,1,2,0,1,1,0,1,1,0,3,1,3,2,2,0,1,0,0,0,2,3,3,3,1,0,0,0,0,0,2,3),
+(0,5,0,4,0,5,0,2,0,4,5,5,3,3,4,3,3,1,5,4,4,2,4,4,4,3,4,2,4,3,5,5,4,3,3,4,3,3,5,5,4,5,5,1,3,4,5,3,1,4,3,1,3,3,0,3,3,1,4,3,1,4,5,3,3,5,0,4,0,3,0,5,3,3,1,4,3,0,4,0,1,5,3),
+(0,5,0,5,0,4,0,2,0,4,4,3,4,3,3,3,3,3,5,4,4,4,4,4,4,5,3,3,5,2,4,4,4,3,4,4,3,3,4,4,5,5,3,3,4,3,4,3,3,4,3,3,3,3,1,2,2,1,4,3,3,5,4,4,3,4,0,4,0,3,0,4,4,4,4,4,1,0,4,2,0,2,4),
+(0,4,0,4,0,3,0,1,0,3,5,2,3,0,3,0,2,1,4,2,3,3,4,1,4,3,3,2,4,1,3,3,3,0,3,3,0,0,3,3,3,5,3,3,3,3,3,2,0,2,0,0,2,0,0,2,0,0,1,0,0,3,1,2,2,3,0,3,0,2,0,4,4,3,3,4,1,0,3,0,0,2,4),
+(0,0,0,4,0,0,0,0,0,0,1,0,1,0,2,0,0,0,0,0,1,0,2,0,1,0,0,0,0,0,3,1,3,0,3,2,0,0,0,1,0,3,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,4,0,2,0,0,0,0,0,0,2),
+(0,2,1,3,0,2,0,2,0,3,3,3,3,1,3,1,3,3,3,3,3,3,4,2,2,1,2,1,4,0,4,3,1,3,3,3,2,4,3,5,4,3,3,3,3,3,3,3,0,1,3,0,2,0,0,1,0,0,1,0,0,4,2,0,2,3,0,3,3,0,3,3,4,2,3,1,4,0,1,2,0,2,3),
+(0,3,0,3,0,1,0,3,0,2,3,3,3,0,3,1,2,0,3,3,2,3,3,2,3,2,3,1,3,0,4,3,2,0,3,3,1,4,3,3,2,3,4,3,1,3,3,1,1,0,1,1,0,1,0,1,0,1,0,0,0,4,1,1,0,3,0,3,1,0,2,3,3,3,3,3,1,0,0,2,0,3,3),
+(0,0,0,0,0,0,0,0,0,0,3,0,2,0,3,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,3,0,3,0,3,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,2,0,2,3,0,0,0,0,0,0,0,0,3),
+(0,2,0,3,1,3,0,3,0,2,3,3,3,1,3,1,3,1,3,1,3,3,3,1,3,0,2,3,1,1,4,3,3,2,3,3,1,2,2,4,1,3,3,0,1,4,2,3,0,1,3,0,3,0,0,1,3,0,2,0,0,3,3,2,1,3,0,3,0,2,0,3,4,4,4,3,1,0,3,0,0,3,3),
+(0,2,0,1,0,2,0,0,0,1,3,2,2,1,3,0,1,1,3,0,3,2,3,1,2,0,2,0,1,1,3,3,3,0,3,3,1,1,2,3,2,3,3,1,2,3,2,0,0,1,0,0,0,0,0,0,3,0,1,0,0,2,1,2,1,3,0,3,0,0,0,3,4,4,4,3,2,0,2,0,0,2,4),
+(0,0,0,1,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,2,2,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,3,1,0,0,0,0,0,0,0,3),
+(0,3,0,3,0,2,0,3,0,3,3,3,2,3,2,2,2,0,3,1,3,3,3,2,3,3,0,0,3,0,3,2,2,0,2,3,1,4,3,4,3,3,2,3,1,5,4,4,0,3,1,2,1,3,0,3,1,1,2,0,2,3,1,3,1,3,0,3,0,1,0,3,3,4,4,2,1,0,2,1,0,2,4),
+(0,1,0,3,0,1,0,2,0,1,4,2,5,1,4,0,2,0,2,1,3,1,4,0,2,1,0,0,2,1,4,1,1,0,3,3,0,5,1,3,2,3,3,1,0,3,2,3,0,1,0,0,0,0,0,0,1,0,0,0,0,4,0,1,0,3,0,2,0,1,0,3,3,3,4,3,3,0,0,0,0,2,3),
+(0,0,0,1,0,0,0,0,0,0,2,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,1,0,0,1,0,0,0,0,0,3),
+(0,1,0,3,0,4,0,3,0,2,4,3,1,0,3,2,2,1,3,1,2,2,3,1,1,1,2,1,3,0,1,2,0,1,3,2,1,3,0,5,5,1,0,0,1,3,2,1,0,3,0,0,1,0,0,0,0,0,3,4,0,1,1,1,3,2,0,2,0,1,0,2,3,3,1,2,3,0,1,0,1,0,4),
+(0,0,0,1,0,3,0,3,0,2,2,1,0,0,4,0,3,0,3,1,3,0,3,0,3,0,1,0,3,0,3,1,3,0,3,3,0,0,1,2,1,1,1,0,1,2,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,2,2,1,2,0,0,2,0,0,0,0,2,3,3,3,3,0,0,0,0,1,4),
+(0,0,0,3,0,3,0,0,0,0,3,1,1,0,3,0,1,0,2,0,1,0,0,0,0,0,0,0,1,0,3,0,2,0,2,3,0,0,2,2,3,1,2,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,2,3),
+(2,4,0,5,0,5,0,4,0,3,4,3,3,3,4,3,3,3,4,3,4,4,5,4,5,5,5,2,3,0,5,5,4,1,5,4,3,1,5,4,3,4,4,3,3,4,3,3,0,3,2,0,2,3,0,3,0,0,3,3,0,5,3,2,3,3,0,3,0,3,0,3,4,5,4,5,3,0,4,3,0,3,4),
+(0,3,0,3,0,3,0,3,0,3,3,4,3,2,3,2,3,0,4,3,3,3,3,3,3,3,3,0,3,2,4,3,3,1,3,4,3,4,4,4,3,4,4,3,2,4,4,1,0,2,0,0,1,1,0,2,0,0,3,1,0,5,3,2,1,3,0,3,0,1,2,4,3,2,4,3,3,0,3,2,0,4,4),
+(0,3,0,3,0,1,0,0,0,1,4,3,3,2,3,1,3,1,4,2,3,2,4,2,3,4,3,0,2,2,3,3,3,0,3,3,3,0,3,4,1,3,3,0,3,4,3,3,0,1,1,0,1,0,0,0,4,0,3,0,0,3,1,2,1,3,0,4,0,1,0,4,3,3,4,3,3,0,2,0,0,3,3),
+(0,3,0,4,0,1,0,3,0,3,4,3,3,0,3,3,3,1,3,1,3,3,4,3,3,3,0,0,3,1,5,3,3,1,3,3,2,5,4,3,3,4,5,3,2,5,3,4,0,1,0,0,0,0,0,2,0,0,1,1,0,4,2,2,1,3,0,3,0,2,0,4,4,3,5,3,2,0,1,1,0,3,4),
+(0,5,0,4,0,5,0,2,0,4,4,3,3,2,3,3,3,1,4,3,4,1,5,3,4,3,4,0,4,2,4,3,4,1,5,4,0,4,4,4,4,5,4,1,3,5,4,2,1,4,1,1,3,2,0,3,1,0,3,2,1,4,3,3,3,4,0,4,0,3,0,4,4,4,3,3,3,0,4,2,0,3,4),
+(1,4,0,4,0,3,0,1,0,3,3,3,1,1,3,3,2,2,3,3,1,0,3,2,2,1,2,0,3,1,2,1,2,0,3,2,0,2,2,3,3,4,3,0,3,3,1,2,0,1,1,3,1,2,0,0,3,0,1,1,0,3,2,2,3,3,0,3,0,0,0,2,3,3,4,3,3,0,1,0,0,1,4),
+(0,4,0,4,0,4,0,0,0,3,4,4,3,1,4,2,3,2,3,3,3,1,4,3,4,0,3,0,4,2,3,3,2,2,5,4,2,1,3,4,3,4,3,1,3,3,4,2,0,2,1,0,3,3,0,0,2,0,3,1,0,4,4,3,4,3,0,4,0,1,0,2,4,4,4,4,4,0,3,2,0,3,3),
+(0,0,0,1,0,4,0,0,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,3,2,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,2),
+(0,2,0,3,0,4,0,4,0,1,3,3,3,0,4,0,2,1,2,1,1,1,2,0,3,1,1,0,1,0,3,1,0,0,3,3,2,0,1,1,0,0,0,0,0,1,0,2,0,2,2,0,3,1,0,0,1,0,1,1,0,1,2,0,3,0,0,0,0,1,0,0,3,3,4,3,1,0,1,0,3,0,2),
+(0,0,0,3,0,5,0,0,0,0,1,0,2,0,3,1,0,1,3,0,0,0,2,0,0,0,1,0,0,0,1,1,0,0,4,0,0,0,2,3,0,1,4,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,1,0,0,0,0,0,0,0,2,0,0,3,0,0,0,0,0,3),
+(0,2,0,5,0,5,0,1,0,2,4,3,3,2,5,1,3,2,3,3,3,0,4,1,2,0,3,0,4,0,2,2,1,1,5,3,0,0,1,4,2,3,2,0,3,3,3,2,0,2,4,1,1,2,0,1,1,0,3,1,0,1,3,1,2,3,0,2,0,0,0,1,3,5,4,4,4,0,3,0,0,1,3),
+(0,4,0,5,0,4,0,4,0,4,5,4,3,3,4,3,3,3,4,3,4,4,5,3,4,5,4,2,4,2,3,4,3,1,4,4,1,3,5,4,4,5,5,4,4,5,5,5,2,3,3,1,4,3,1,3,3,0,3,3,1,4,3,4,4,4,0,3,0,4,0,3,3,4,4,5,0,0,4,3,0,4,5),
+(0,4,0,4,0,3,0,3,0,3,4,4,4,3,3,2,4,3,4,3,4,3,5,3,4,3,2,1,4,2,4,4,3,1,3,4,2,4,5,5,3,4,5,4,1,5,4,3,0,3,2,2,3,2,1,3,1,0,3,3,3,5,3,3,3,5,4,4,2,3,3,4,3,3,3,2,1,0,3,2,1,4,3),
+(0,4,0,5,0,4,0,3,0,3,5,5,3,2,4,3,4,0,5,4,4,1,4,4,4,3,3,3,4,3,5,5,2,3,3,4,1,2,5,5,3,5,5,2,3,5,5,4,0,3,2,0,3,3,1,1,5,1,4,1,0,4,3,2,3,5,0,4,0,3,0,5,4,3,4,3,0,0,4,1,0,4,4),
+(1,3,0,4,0,2,0,2,0,2,5,5,3,3,3,3,3,0,4,2,3,4,4,4,3,4,0,0,3,4,5,4,3,3,3,3,2,5,5,4,5,5,5,4,3,5,5,5,1,3,1,0,1,0,0,3,2,0,4,2,0,5,2,3,2,4,1,3,0,3,0,4,5,4,5,4,3,0,4,2,0,5,4),
+(0,3,0,4,0,5,0,3,0,3,4,4,3,2,3,2,3,3,3,3,3,2,4,3,3,2,2,0,3,3,3,3,3,1,3,3,3,0,4,4,3,4,4,1,1,4,4,2,0,3,1,0,1,1,0,4,1,0,2,3,1,3,3,1,3,4,0,3,0,1,0,3,1,3,0,0,1,0,2,0,0,4,4),
+(0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0),
+(0,3,0,3,0,2,0,3,0,1,5,4,3,3,3,1,4,2,1,2,3,4,4,2,4,4,5,0,3,1,4,3,4,0,4,3,3,3,2,3,2,5,3,4,3,2,2,3,0,0,3,0,2,1,0,1,2,0,0,0,0,2,1,1,3,1,0,2,0,4,0,3,4,4,4,5,2,0,2,0,0,1,3),
+(0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,1,0,0,1,1,0,0,0,4,2,1,1,0,1,0,3,2,0,0,3,1,1,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,3,0,1,0,0,0,2,0,0,0,1,4,0,4,2,1,0,0,0,0,0,1),
+(0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,1,0,1,0,0,0,0,3,1,0,0,0,2,0,2,1,0,0,1,2,1,0,1,1,0,0,3,0,0,0,0,0,0,0,0,0,0,0,1,3,1,0,0,0,0,0,1,0,0,2,1,0,0,0,0,0,0,0,0,2),
+(0,4,0,4,0,4,0,3,0,4,4,3,4,2,4,3,2,0,4,4,4,3,5,3,5,3,3,2,4,2,4,3,4,3,1,4,0,2,3,4,4,4,3,3,3,4,4,4,3,4,1,3,4,3,2,1,2,1,3,3,3,4,4,3,3,5,0,4,0,3,0,4,3,3,3,2,1,0,3,0,0,3,3),
+(0,4,0,3,0,3,0,3,0,3,5,5,3,3,3,3,4,3,4,3,3,3,4,4,4,3,3,3,3,4,3,5,3,3,1,3,2,4,5,5,5,5,4,3,4,5,5,3,2,2,3,3,3,3,2,3,3,1,2,3,2,4,3,3,3,4,0,4,0,2,0,4,3,2,2,1,2,0,3,0,0,4,1),
+)
+
+class JapaneseContextAnalysis(object):
+    NUM_OF_CATEGORY = 6
+    DONT_KNOW = -1
+    ENOUGH_REL_THRESHOLD = 100
+    MAX_REL_THRESHOLD = 1000
+    MINIMUM_DATA_THRESHOLD = 4
+
+    def __init__(self):
+        self._total_rel = None
+        self._rel_sample = None
+        self._need_to_skip_char_num = None
+        self._last_char_order = None
+        self._done = None
+        self.reset()
+
+    def reset(self):
+        self._total_rel = 0  # total sequence received
+        # category counters, each integer counts sequence in its category
+        self._rel_sample = [0] * self.NUM_OF_CATEGORY
+        # if last byte in current buffer is not the last byte of a character,
+        # we need to know how many bytes to skip in next buffer
+        self._need_to_skip_char_num = 0
+        self._last_char_order = -1  # The order of previous char
+        # If this flag is set to True, detection is done and conclusion has
+        # been made
+        self._done = False
+
+    def feed(self, byte_str, num_bytes):
+        if self._done:
+            return
+
+        # The buffer we got is byte oriented, and a character may span in more than one
+        # buffers. In case the last one or two byte in last buffer is not
+        # complete, we record how many byte needed to complete that character
+        # and skip these bytes here.  We can choose to record those bytes as
+        # well and analyse the character once it is complete, but since a
+        # character will not make much difference, by simply skipping
+        # this character will simply our logic and improve performance.
+        i = self._need_to_skip_char_num
+        while i < num_bytes:
+            order, char_len = self.get_order(byte_str[i:i + 2])
+            i += char_len
+            if i > num_bytes:
+                self._need_to_skip_char_num = i - num_bytes
+                self._last_char_order = -1
+            else:
+                if (order != -1) and (self._last_char_order != -1):
+                    self._total_rel += 1
+                    if self._total_rel > self.MAX_REL_THRESHOLD:
+                        self._done = True
+                        break
+                    self._rel_sample[jp2CharContext[self._last_char_order][order]] += 1
+                self._last_char_order = order
+
+    def got_enough_data(self):
+        return self._total_rel > self.ENOUGH_REL_THRESHOLD
+
+    def get_confidence(self):
+        # This is just one way to calculate confidence. It works well for me.
+        if self._total_rel > self.MINIMUM_DATA_THRESHOLD:
+            return (self._total_rel - self._rel_sample[0]) / self._total_rel
+        else:
+            return self.DONT_KNOW
+
+    def get_order(self, byte_str):
+        return -1, 1
+
+class SJISContextAnalysis(JapaneseContextAnalysis):
+    def __init__(self):
+        super(SJISContextAnalysis, self).__init__()
+        self._charset_name = "SHIFT_JIS"
+
+    @property
+    def charset_name(self):
+        return self._charset_name
+
+    def get_order(self, byte_str):
+        if not byte_str:
+            return -1, 1
+        # find out current char's byte length
+        first_char = byte_str[0]
+        if (0x81 <= first_char <= 0x9F) or (0xE0 <= first_char <= 0xFC):
+            char_len = 2
+            if (first_char == 0x87) or (0xFA <= first_char <= 0xFC):
+                self._charset_name = "CP932"
+        else:
+            char_len = 1
+
+        # return its order if it is hiragana
+        if len(byte_str) > 1:
+            second_char = byte_str[1]
+            if (first_char == 202) and (0x9F <= second_char <= 0xF1):
+                return second_char - 0x9F, char_len
+
+        return -1, char_len
+
+class EUCJPContextAnalysis(JapaneseContextAnalysis):
+    def get_order(self, byte_str):
+        if not byte_str:
+            return -1, 1
+        # find out current char's byte length
+        first_char = byte_str[0]
+        if (first_char == 0x8E) or (0xA1 <= first_char <= 0xFE):
+            char_len = 2
+        elif first_char == 0x8F:
+            char_len = 3
+        else:
+            char_len = 1
+
+        # return its order if it is hiragana
+        if len(byte_str) > 1:
+            second_char = byte_str[1]
+            if (first_char == 0xA4) and (0xA1 <= second_char <= 0xF3):
+                return second_char - 0xA1, char_len
+
+        return -1, char_len
+
+
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langbulgarianmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langbulgarianmodel.py
new file mode 100644
index 000000000..2aa4fb2e2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langbulgarianmodel.py
@@ -0,0 +1,228 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# Character Mapping Table:
+# this table is modified base on win1251BulgarianCharToOrderMap, so
+# only number <64 is sure valid
+
+Latin5_BulgarianCharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 77, 90, 99,100, 72,109,107,101, 79,185, 81,102, 76, 94, 82,  # 40
+110,186,108, 91, 74,119, 84, 96,111,187,115,253,253,253,253,253,  # 50
+253, 65, 69, 70, 66, 63, 68,112,103, 92,194,104, 95, 86, 87, 71,  # 60
+116,195, 85, 93, 97,113,196,197,198,199,200,253,253,253,253,253,  # 70
+194,195,196,197,198,199,200,201,202,203,204,205,206,207,208,209,  # 80
+210,211,212,213,214,215,216,217,218,219,220,221,222,223,224,225,  # 90
+ 81,226,227,228,229,230,105,231,232,233,234,235,236, 45,237,238,  # a0
+ 31, 32, 35, 43, 37, 44, 55, 47, 40, 59, 33, 46, 38, 36, 41, 30,  # b0
+ 39, 28, 34, 51, 48, 49, 53, 50, 54, 57, 61,239, 67,240, 60, 56,  # c0
+  1, 18,  9, 20, 11,  3, 23, 15,  2, 26, 12, 10, 14,  6,  4, 13,  # d0
+  7,  8,  5, 19, 29, 25, 22, 21, 27, 24, 17, 75, 52,241, 42, 16,  # e0
+ 62,242,243,244, 58,245, 98,246,247,248,249,250,251, 91,252,253,  # f0
+)
+
+win1251BulgarianCharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 77, 90, 99,100, 72,109,107,101, 79,185, 81,102, 76, 94, 82,  # 40
+110,186,108, 91, 74,119, 84, 96,111,187,115,253,253,253,253,253,  # 50
+253, 65, 69, 70, 66, 63, 68,112,103, 92,194,104, 95, 86, 87, 71,  # 60
+116,195, 85, 93, 97,113,196,197,198,199,200,253,253,253,253,253,  # 70
+206,207,208,209,210,211,212,213,120,214,215,216,217,218,219,220,  # 80
+221, 78, 64, 83,121, 98,117,105,222,223,224,225,226,227,228,229,  # 90
+ 88,230,231,232,233,122, 89,106,234,235,236,237,238, 45,239,240,  # a0
+ 73, 80,118,114,241,242,243,244,245, 62, 58,246,247,248,249,250,  # b0
+ 31, 32, 35, 43, 37, 44, 55, 47, 40, 59, 33, 46, 38, 36, 41, 30,  # c0
+ 39, 28, 34, 51, 48, 49, 53, 50, 54, 57, 61,251, 67,252, 60, 56,  # d0
+  1, 18,  9, 20, 11,  3, 23, 15,  2, 26, 12, 10, 14,  6,  4, 13,  # e0
+  7,  8,  5, 19, 29, 25, 22, 21, 27, 24, 17, 75, 52,253, 42, 16,  # f0
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 96.9392%
+# first 1024 sequences:3.0618%
+# rest  sequences:     0.2992%
+# negative sequences:  0.0020%
+BulgarianLangModel = (
+0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,2,3,3,3,3,3,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,2,2,3,2,2,1,2,2,
+3,1,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,3,3,3,3,3,3,3,0,3,0,1,
+0,0,0,0,0,0,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,2,3,3,3,3,3,3,3,3,0,3,1,0,
+0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,2,2,2,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,2,3,3,3,3,3,3,3,3,0,3,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,1,3,2,3,3,3,3,3,3,3,3,0,3,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,2,3,2,2,1,3,3,3,3,2,2,2,1,1,2,0,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,2,3,2,2,3,3,1,1,2,3,3,2,3,3,3,3,2,1,2,0,2,0,3,0,0,
+0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,1,3,3,3,3,3,2,3,2,3,3,3,3,3,2,3,3,1,3,0,3,0,2,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,3,1,3,3,2,3,3,3,1,3,3,2,3,2,2,2,0,0,2,0,2,0,2,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,3,3,0,3,3,3,2,2,3,3,3,1,2,2,3,2,1,1,2,0,2,0,0,0,0,
+1,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,2,3,3,1,2,3,2,2,2,3,3,3,3,3,2,2,3,1,2,0,2,1,2,0,0,
+0,0,0,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,1,3,3,3,3,3,2,3,3,3,2,3,3,2,3,2,2,2,3,1,2,0,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,3,3,3,3,1,1,1,2,2,1,3,1,3,2,2,3,0,0,1,0,1,0,1,0,0,
+0,0,0,1,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,2,2,3,2,2,3,1,2,1,1,1,2,3,1,3,1,2,2,0,1,1,1,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,1,3,2,2,3,3,1,2,3,1,1,3,3,3,3,1,2,2,1,1,1,0,2,0,2,0,1,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,2,2,3,3,3,2,2,1,1,2,0,2,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,0,1,2,1,3,3,2,3,3,3,3,3,2,3,2,1,0,3,1,2,1,2,1,2,3,2,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,1,1,2,3,3,3,3,3,3,3,3,3,3,3,3,0,0,3,1,3,3,2,3,3,2,2,2,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,3,0,3,3,3,3,3,2,1,1,2,1,3,3,0,3,1,1,1,1,3,2,0,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,2,2,2,3,3,3,3,3,3,3,3,3,3,3,1,1,3,1,3,3,2,3,2,2,2,3,0,2,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,2,3,3,2,2,3,2,1,1,1,1,1,3,1,3,1,1,0,0,0,1,0,0,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,2,3,2,0,3,2,0,3,0,2,0,0,2,1,3,1,0,0,1,0,0,0,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,2,1,1,1,1,2,1,1,2,1,1,1,2,2,1,2,1,1,1,0,1,1,0,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,2,1,3,1,1,2,1,3,2,1,1,0,1,2,3,2,1,1,1,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,3,2,2,1,0,1,0,0,1,0,0,0,2,1,0,3,0,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,2,3,2,3,3,1,3,2,1,1,1,2,1,1,2,1,3,0,1,0,0,0,1,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,1,2,2,3,3,2,3,2,2,2,3,1,2,2,1,1,2,1,1,2,2,0,1,1,0,1,0,2,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,2,1,3,1,0,2,2,1,3,2,1,0,0,2,0,2,0,1,0,0,0,0,0,0,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,3,1,2,0,2,3,1,2,3,2,0,1,3,1,2,1,1,1,0,0,1,0,0,2,2,2,3,
+2,2,2,2,1,2,1,1,2,2,1,1,2,0,1,1,1,0,0,1,1,0,0,1,1,0,0,0,1,1,0,1,
+3,3,3,3,3,2,1,2,2,1,2,0,2,0,1,0,1,2,1,2,1,1,0,0,0,1,0,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,
+3,3,2,3,3,1,1,3,1,0,3,2,1,0,0,0,1,2,0,2,0,1,0,0,0,1,0,1,2,1,2,2,
+1,1,1,1,1,1,1,2,2,2,1,1,1,1,1,1,1,0,1,2,1,1,1,0,0,0,0,0,1,1,0,0,
+3,1,0,1,0,2,3,2,2,2,3,2,2,2,2,2,1,0,2,1,2,1,1,1,0,1,2,1,2,2,2,1,
+1,1,2,2,2,2,1,2,1,1,0,1,2,1,2,2,2,1,1,1,0,1,1,1,1,2,0,1,0,0,0,0,
+2,3,2,3,3,0,0,2,1,0,2,1,0,0,0,0,2,3,0,2,0,0,0,0,0,1,0,0,2,0,1,2,
+2,1,2,1,2,2,1,1,1,2,1,1,1,0,1,2,2,1,1,1,1,1,0,1,1,1,0,0,1,2,0,0,
+3,3,2,2,3,0,2,3,1,1,2,0,0,0,1,0,0,2,0,2,0,0,0,1,0,1,0,1,2,0,2,2,
+1,1,1,1,2,1,0,1,2,2,2,1,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,1,0,0,
+2,3,2,3,3,0,0,3,0,1,1,0,1,0,0,0,2,2,1,2,0,0,0,0,0,0,0,0,2,0,1,2,
+2,2,1,1,1,1,1,2,2,2,1,0,2,0,1,0,1,0,0,1,0,1,0,0,1,0,0,0,0,1,0,0,
+3,3,3,3,2,2,2,2,2,0,2,1,1,1,1,2,1,2,1,1,0,2,0,1,0,1,0,0,2,0,1,2,
+1,1,1,1,1,1,1,2,2,1,1,0,2,0,1,0,2,0,0,1,1,1,0,0,2,0,0,0,1,1,0,0,
+2,3,3,3,3,1,0,0,0,0,0,0,0,0,0,0,2,0,0,1,1,0,0,0,0,0,0,1,2,0,1,2,
+2,2,2,1,1,2,1,1,2,2,2,1,2,0,1,1,1,1,1,1,0,1,1,1,1,0,0,1,1,1,0,0,
+2,3,3,3,3,0,2,2,0,2,1,0,0,0,1,1,1,2,0,2,0,0,0,3,0,0,0,0,2,0,2,2,
+1,1,1,2,1,2,1,1,2,2,2,1,2,0,1,1,1,0,1,1,1,1,0,2,1,0,0,0,1,1,0,0,
+2,3,3,3,3,0,2,1,0,0,2,0,0,0,0,0,1,2,0,2,0,0,0,0,0,0,0,0,2,0,1,2,
+1,1,1,2,1,1,1,1,2,2,2,0,1,0,1,1,1,0,0,1,1,1,0,0,1,0,0,0,0,1,0,0,
+3,3,2,2,3,0,1,0,1,0,0,0,0,0,0,0,1,1,0,3,0,0,0,0,0,0,0,0,1,0,2,2,
+1,1,1,1,1,2,1,1,2,2,1,2,2,1,0,1,1,1,1,1,0,1,0,0,1,0,0,0,1,1,0,0,
+3,1,0,1,0,2,2,2,2,3,2,1,1,1,2,3,0,0,1,0,2,1,1,0,1,1,1,1,2,1,1,1,
+1,2,2,1,2,1,2,2,1,1,0,1,2,1,2,2,1,1,1,0,0,1,1,1,2,1,0,1,0,0,0,0,
+2,1,0,1,0,3,1,2,2,2,2,1,2,2,1,1,1,0,2,1,2,2,1,1,2,1,1,0,2,1,1,1,
+1,2,2,2,2,2,2,2,1,2,0,1,1,0,2,1,1,1,1,1,0,0,1,1,1,1,0,1,0,0,0,0,
+2,1,1,1,1,2,2,2,2,1,2,2,2,1,2,2,1,1,2,1,2,3,2,2,1,1,1,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,3,2,0,1,2,0,1,2,1,1,0,1,0,1,2,1,2,0,0,0,1,1,0,0,0,1,0,0,2,
+1,1,0,0,1,1,0,1,1,1,1,0,2,0,1,1,1,0,0,1,1,0,0,0,0,1,0,0,0,1,0,0,
+2,0,0,0,0,1,2,2,2,2,2,2,2,1,2,1,1,1,1,1,1,1,0,1,1,1,1,1,2,1,1,1,
+1,2,2,2,2,1,1,2,1,2,1,1,1,0,2,1,2,1,1,1,0,2,1,1,1,1,0,1,0,0,0,0,
+3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,
+1,1,0,1,0,1,1,1,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,3,2,0,0,0,0,1,0,0,0,0,0,0,1,1,0,2,0,0,0,0,0,0,0,0,1,0,1,2,
+1,1,1,1,1,1,0,0,2,2,2,2,2,0,1,1,0,1,1,1,1,1,0,0,1,0,0,0,1,1,0,1,
+2,3,1,2,1,0,1,1,0,2,2,2,0,0,1,0,0,1,1,1,1,0,0,0,0,0,0,0,1,0,1,2,
+1,1,1,1,2,1,1,1,1,1,1,1,1,0,1,1,0,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,
+2,2,2,2,2,0,0,2,0,0,2,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,2,0,2,2,
+1,1,1,1,1,0,0,1,2,1,1,0,1,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,2,2,0,0,2,0,1,1,0,0,0,1,0,0,2,0,2,0,0,0,0,0,0,0,0,0,0,1,1,
+0,0,0,1,1,1,1,1,1,1,1,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,3,2,0,0,1,0,0,1,0,0,0,0,0,0,1,0,2,0,0,0,1,0,0,0,0,0,0,0,2,
+1,1,0,0,1,0,0,0,1,1,0,0,1,0,1,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
+2,1,2,2,2,1,2,1,2,2,1,1,2,1,1,1,0,1,1,1,1,2,0,1,0,1,1,1,1,0,1,1,
+1,1,2,1,1,1,1,1,1,0,0,1,2,1,1,1,1,1,1,0,0,1,1,1,0,0,0,0,0,0,0,0,
+1,0,0,1,3,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,2,1,0,0,1,0,2,0,0,0,0,0,1,1,1,0,1,0,0,0,0,0,0,0,0,2,0,0,1,
+0,2,0,1,0,0,1,1,2,0,1,0,1,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,2,2,0,1,1,0,2,1,0,1,1,1,0,0,1,0,2,0,1,0,0,0,0,0,0,0,0,0,1,
+0,1,0,0,1,0,0,0,1,1,0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,2,2,0,0,1,0,0,0,1,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,1,
+0,1,0,1,1,1,0,0,1,1,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
+2,0,1,0,0,1,2,1,1,1,1,1,1,2,2,1,0,0,1,0,1,0,0,0,0,1,1,1,1,0,0,0,
+1,1,2,1,1,1,1,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,1,2,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,1,
+0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
+0,1,1,0,1,1,1,0,0,1,0,0,1,0,1,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,
+1,0,1,0,0,1,1,1,1,1,1,1,1,1,1,1,0,0,1,0,2,0,0,2,0,1,0,0,1,0,0,1,
+1,1,0,0,1,1,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,
+1,1,1,1,1,1,1,2,0,0,0,0,0,0,2,1,0,1,1,0,0,1,1,1,0,1,0,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,1,1,1,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+)
+
+Latin5BulgarianModel = {
+  'char_to_order_map': Latin5_BulgarianCharToOrderMap,
+  'precedence_matrix': BulgarianLangModel,
+  'typical_positive_ratio': 0.969392,
+  'keep_english_letter': False,
+  'charset_name': "ISO-8859-5",
+  'language': 'Bulgairan',
+}
+
+Win1251BulgarianModel = {
+  'char_to_order_map': win1251BulgarianCharToOrderMap,
+  'precedence_matrix': BulgarianLangModel,
+  'typical_positive_ratio': 0.969392,
+  'keep_english_letter': False,
+  'charset_name': "windows-1251",
+  'language': 'Bulgarian',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langcyrillicmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langcyrillicmodel.py
new file mode 100644
index 000000000..e5f9a1fd1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langcyrillicmodel.py
@@ -0,0 +1,333 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# KOI8-R language model
+# Character Mapping Table:
+KOI8R_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,  # 80
+207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,  # 90
+223,224,225, 68,226,227,228,229,230,231,232,233,234,235,236,237,  # a0
+238,239,240,241,242,243,244,245,246,247,248,249,250,251,252,253,  # b0
+ 27,  3, 21, 28, 13,  2, 39, 19, 26,  4, 23, 11,  8, 12,  5,  1,  # c0
+ 15, 16,  9,  7,  6, 14, 24, 10, 17, 18, 20, 25, 30, 29, 22, 54,  # d0
+ 59, 37, 44, 58, 41, 48, 53, 46, 55, 42, 60, 36, 49, 38, 31, 34,  # e0
+ 35, 43, 45, 32, 40, 52, 56, 33, 61, 62, 51, 57, 47, 63, 50, 70,  # f0
+)
+
+win1251_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
+207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
+223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
+239,240,241,242,243,244,245,246, 68,247,248,249,250,251,252,253,
+ 37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
+ 45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
+  3, 21, 10, 19, 13,  2, 24, 20,  4, 23, 11,  8, 12,  5,  1, 15,
+  9,  7,  6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
+)
+
+latin5_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
+207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
+223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
+ 37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
+ 45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
+  3, 21, 10, 19, 13,  2, 24, 20,  4, 23, 11,  8, 12,  5,  1, 15,
+  9,  7,  6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
+239, 68,240,241,242,243,244,245,246,247,248,249,250,251,252,255,
+)
+
+macCyrillic_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+ 37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
+ 45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
+191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
+207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
+223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
+239,240,241,242,243,244,245,246,247,248,249,250,251,252, 68, 16,
+  3, 21, 10, 19, 13,  2, 24, 20,  4, 23, 11,  8, 12,  5,  1, 15,
+  9,  7,  6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27,255,
+)
+
+IBM855_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+191,192,193,194, 68,195,196,197,198,199,200,201,202,203,204,205,
+206,207,208,209,210,211,212,213,214,215,216,217, 27, 59, 54, 70,
+  3, 37, 21, 44, 28, 58, 13, 41,  2, 48, 39, 53, 19, 46,218,219,
+220,221,222,223,224, 26, 55,  4, 42,225,226,227,228, 23, 60,229,
+230,231,232,233,234,235, 11, 36,236,237,238,239,240,241,242,243,
+  8, 49, 12, 38,  5, 31,  1, 34, 15,244,245,246,247, 35, 16,248,
+ 43,  9, 45,  7, 32,  6, 40, 14, 52, 24, 56, 10, 33, 17, 61,249,
+250, 18, 62, 20, 51, 25, 57, 30, 47, 29, 63, 22, 50,251,252,255,
+)
+
+IBM866_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,142,143,144,145,146,147,148,149,150,151,152, 74,153, 75,154,  # 40
+155,156,157,158,159,160,161,162,163,164,165,253,253,253,253,253,  # 50
+253, 71,172, 66,173, 65,174, 76,175, 64,176,177, 77, 72,178, 69,  # 60
+ 67,179, 78, 73,180,181, 79,182,183,184,185,253,253,253,253,253,  # 70
+ 37, 44, 33, 46, 41, 48, 56, 51, 42, 60, 36, 49, 38, 31, 34, 35,
+ 45, 32, 40, 52, 53, 55, 58, 50, 57, 63, 70, 62, 61, 47, 59, 43,
+  3, 21, 10, 19, 13,  2, 24, 20,  4, 23, 11,  8, 12,  5,  1, 15,
+191,192,193,194,195,196,197,198,199,200,201,202,203,204,205,206,
+207,208,209,210,211,212,213,214,215,216,217,218,219,220,221,222,
+223,224,225,226,227,228,229,230,231,232,233,234,235,236,237,238,
+  9,  7,  6, 14, 39, 26, 28, 22, 25, 29, 54, 18, 17, 30, 27, 16,
+239, 68,240,241,242,243,244,245,246,247,248,249,250,251,252,255,
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 97.6601%
+# first 1024 sequences: 2.3389%
+# rest  sequences:      0.1237%
+# negative sequences:   0.0009%
+RussianLangModel = (
+0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,1,3,3,3,3,1,3,3,3,2,3,2,3,3,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,2,2,2,2,2,0,0,2,
+3,3,3,2,3,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,3,2,3,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,2,2,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,2,3,3,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,0,0,3,3,3,3,3,3,3,3,3,3,3,2,1,
+0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,0,0,3,3,3,3,3,3,3,3,3,3,3,2,1,
+0,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,2,2,2,3,1,3,3,1,3,3,3,3,2,2,3,0,2,2,2,3,3,2,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,3,3,3,3,3,2,2,3,2,3,3,3,2,1,2,2,0,1,2,2,2,2,2,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,3,0,2,2,3,3,2,1,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,3,3,1,2,3,2,2,3,2,3,3,3,3,2,2,3,0,3,2,2,3,1,1,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,2,3,3,3,3,2,2,2,0,3,3,3,2,2,2,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,2,3,2,3,3,3,3,3,3,2,3,2,2,0,1,3,2,1,2,2,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,2,1,1,3,0,1,1,1,1,2,1,1,0,2,2,2,1,2,0,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,3,3,2,2,2,2,1,3,2,3,2,3,2,1,2,2,0,1,1,2,1,2,1,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,2,2,3,2,3,3,3,2,2,2,2,0,2,2,2,2,3,1,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+3,2,3,2,2,3,3,3,3,3,3,3,3,3,1,3,2,0,0,3,3,3,3,2,3,3,3,3,2,3,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,3,3,2,2,3,3,0,2,1,0,3,2,3,2,3,0,0,1,2,0,0,1,0,1,2,1,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,3,0,2,3,3,3,3,2,3,3,3,3,1,2,2,0,0,2,3,2,2,2,3,2,3,2,2,3,0,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,3,0,2,3,2,3,0,1,2,3,3,2,0,2,3,0,0,2,3,2,2,0,1,3,1,3,2,2,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,3,0,2,3,3,3,3,3,3,3,3,2,1,3,2,0,0,2,2,3,3,3,2,3,3,0,2,2,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,2,3,3,2,2,2,3,3,0,0,1,1,1,1,1,2,0,0,1,1,1,1,0,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,2,3,3,3,3,3,3,3,0,3,2,3,3,2,3,2,0,2,1,0,1,1,0,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,3,3,3,2,2,2,2,3,1,3,2,3,1,1,2,1,0,2,2,2,2,1,3,1,0,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+2,2,3,3,3,3,3,1,2,2,1,3,1,0,3,0,0,3,0,0,0,1,1,0,1,2,1,0,0,0,0,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,2,1,1,3,3,3,2,2,1,2,2,3,1,1,2,0,0,2,2,1,3,0,0,2,1,1,2,1,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,3,3,3,3,1,2,2,2,1,2,1,3,3,1,1,2,1,2,1,2,2,0,2,0,0,1,1,0,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,3,3,2,1,3,2,2,3,2,0,3,2,0,3,0,1,0,1,1,0,0,1,1,1,1,0,1,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,2,3,3,3,2,2,2,3,3,1,2,1,2,1,0,1,0,1,1,0,1,0,0,2,1,1,1,0,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+3,1,1,2,1,2,3,3,2,2,1,2,2,3,0,2,1,0,0,2,2,3,2,1,2,2,2,2,2,3,1,0,
+0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,1,1,0,1,1,2,2,1,1,3,0,0,1,3,1,1,1,0,0,0,1,0,1,1,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,1,3,3,3,2,0,0,0,2,1,0,1,0,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,1,0,0,2,3,2,2,2,1,2,2,2,1,2,1,0,0,1,1,1,0,2,0,1,1,1,0,0,1,1,
+1,0,0,0,0,0,1,2,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,3,0,0,0,0,1,0,0,0,0,3,0,1,2,1,0,0,0,0,0,0,0,1,1,0,0,1,1,
+1,0,1,0,1,2,0,0,1,1,2,1,0,1,1,1,1,0,1,1,1,1,0,1,0,0,1,0,0,1,1,0,
+2,2,3,2,2,2,3,1,2,2,2,2,2,2,2,2,1,1,1,1,1,1,1,0,1,0,1,1,1,0,2,1,
+1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,1,0,1,0,1,1,0,1,1,1,0,1,1,0,
+3,3,3,2,2,2,2,3,2,2,1,1,2,2,2,2,1,1,3,1,2,1,2,0,0,1,1,0,1,0,2,1,
+1,1,1,1,1,2,1,0,1,1,1,1,0,1,0,0,1,1,0,0,1,0,1,0,0,1,0,0,0,1,1,0,
+2,0,0,1,0,3,2,2,2,2,1,2,1,2,1,2,0,0,0,2,1,2,2,1,1,2,2,0,1,1,0,2,
+1,1,1,1,1,0,1,1,1,2,1,1,1,2,1,0,1,2,1,1,1,1,0,1,1,1,0,0,1,0,0,1,
+1,3,2,2,2,1,1,1,2,3,0,0,0,0,2,0,2,2,1,0,0,0,0,0,0,1,0,0,0,0,1,1,
+1,0,1,1,0,1,0,1,1,0,1,1,0,2,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,
+2,3,2,3,2,1,2,2,2,2,1,0,0,0,2,0,0,1,1,0,0,0,0,0,0,0,1,1,0,0,2,1,
+1,1,2,1,0,2,0,0,1,0,1,0,0,1,0,0,1,1,0,1,1,0,0,0,0,0,1,0,0,0,0,0,
+3,0,0,1,0,2,2,2,3,2,2,2,2,2,2,2,0,0,0,2,1,2,1,1,1,2,2,0,0,0,1,2,
+1,1,1,1,1,0,1,2,1,1,1,1,1,1,1,0,1,1,1,1,1,1,0,1,1,1,1,1,1,0,0,1,
+2,3,2,3,3,2,0,1,1,1,0,0,1,0,2,0,1,1,3,1,0,0,0,0,0,0,0,1,0,0,2,1,
+1,1,1,1,1,1,1,0,1,0,1,1,1,1,0,1,1,1,0,0,1,1,0,1,0,0,0,0,0,0,1,0,
+2,3,3,3,3,1,2,2,2,2,0,1,1,0,2,1,1,1,2,1,0,1,1,0,0,1,0,1,0,0,2,0,
+0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,3,3,2,0,0,1,1,2,2,1,0,0,2,0,1,1,3,0,0,1,0,0,0,0,0,1,0,1,2,1,
+1,1,2,0,1,1,1,0,1,0,1,1,0,1,0,1,1,1,1,0,1,0,0,0,0,0,0,1,0,1,1,0,
+1,3,2,3,2,1,0,0,2,2,2,0,1,0,2,0,1,1,1,0,1,0,0,0,3,0,1,1,0,0,2,1,
+1,1,1,0,1,1,0,0,0,0,1,1,0,1,0,0,2,1,1,0,1,0,0,0,1,0,1,0,0,1,1,0,
+3,1,2,1,1,2,2,2,2,2,2,1,2,2,1,1,0,0,0,2,2,2,0,0,0,1,2,1,0,1,0,1,
+2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,2,1,1,1,0,1,0,1,1,0,1,1,1,0,0,1,
+3,0,0,0,0,2,0,1,1,1,1,1,1,1,0,1,0,0,0,1,1,1,0,1,0,1,1,0,0,1,0,1,
+1,1,0,0,1,0,0,0,1,0,1,1,0,0,1,0,1,0,1,0,0,0,0,1,0,0,0,1,0,0,0,1,
+1,3,3,2,2,0,0,0,2,2,0,0,0,1,2,0,1,1,2,0,0,0,0,0,0,0,0,1,0,0,2,1,
+0,1,1,0,0,1,1,0,0,0,1,1,0,1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
+2,3,2,3,2,0,0,0,0,1,1,0,0,0,2,0,2,0,2,0,0,0,0,0,1,0,0,1,0,0,1,1,
+1,1,2,0,1,2,1,0,1,1,2,1,1,1,1,1,2,1,1,0,1,0,0,1,1,1,1,1,0,1,1,0,
+1,3,2,2,2,1,0,0,2,2,1,0,1,2,2,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,1,1,
+0,0,1,1,0,1,1,0,0,1,1,0,1,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,1,0,2,3,1,2,2,2,2,2,2,1,1,0,0,0,1,0,1,0,2,1,1,1,0,0,0,0,1,
+1,1,0,1,1,0,1,1,1,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
+2,0,2,0,0,1,0,3,2,1,2,1,2,2,0,1,0,0,0,2,1,0,0,2,1,1,1,1,0,2,0,2,
+2,1,1,1,1,1,1,1,1,1,1,1,1,2,1,0,1,1,1,1,0,0,0,1,1,1,1,0,1,0,0,1,
+1,2,2,2,2,1,0,0,1,0,0,0,0,0,2,0,1,1,1,1,0,0,0,0,1,0,1,2,0,0,2,0,
+1,0,1,1,1,2,1,0,1,0,1,1,0,0,1,0,1,1,1,0,1,0,0,0,1,0,0,1,0,1,1,0,
+2,1,2,2,2,0,3,0,1,1,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+0,0,0,1,1,1,0,0,1,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,
+1,2,2,3,2,2,0,0,1,1,2,0,1,2,1,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,
+0,1,1,0,0,1,1,0,0,1,1,0,0,1,1,0,1,1,0,0,1,0,0,0,0,0,0,0,0,1,1,0,
+2,2,1,1,2,1,2,2,2,2,2,1,2,2,0,1,0,0,0,1,2,2,2,1,2,1,1,1,1,1,2,1,
+1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,0,1,
+1,2,2,2,2,0,1,0,2,2,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,
+0,0,1,0,0,1,0,0,0,0,1,0,1,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,2,2,0,0,0,2,2,2,0,1,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,1,
+0,1,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,2,2,0,0,0,0,1,0,0,1,1,2,0,0,0,0,1,0,1,0,0,1,0,0,2,0,0,0,1,
+0,0,1,0,0,1,0,0,0,1,1,0,0,0,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,
+1,2,2,2,1,1,2,0,2,1,1,1,1,0,2,2,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,1,
+0,0,1,0,1,1,0,0,0,0,1,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+1,0,2,1,2,0,0,0,0,0,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,
+0,0,1,0,1,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
+1,0,0,0,0,2,0,1,2,1,0,1,1,1,0,1,0,0,0,1,0,1,0,0,1,0,1,0,0,0,0,1,
+0,0,0,0,0,1,0,0,1,1,0,0,1,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,
+2,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+1,0,0,0,1,0,0,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+1,1,1,0,1,0,1,0,0,1,1,1,1,0,0,0,1,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+1,1,0,1,1,0,1,0,1,0,0,0,0,1,1,0,1,1,0,0,0,0,0,1,0,1,1,0,1,0,0,0,
+0,1,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
+)
+
+Koi8rModel = {
+  'char_to_order_map': KOI8R_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "KOI8-R",
+  'language': 'Russian',
+}
+
+Win1251CyrillicModel = {
+  'char_to_order_map': win1251_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "windows-1251",
+  'language': 'Russian',
+}
+
+Latin5CyrillicModel = {
+  'char_to_order_map': latin5_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "ISO-8859-5",
+  'language': 'Russian',
+}
+
+MacCyrillicModel = {
+  'char_to_order_map': macCyrillic_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "MacCyrillic",
+  'language': 'Russian',
+}
+
+Ibm866Model = {
+  'char_to_order_map': IBM866_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "IBM866",
+  'language': 'Russian',
+}
+
+Ibm855Model = {
+  'char_to_order_map': IBM855_char_to_order_map,
+  'precedence_matrix': RussianLangModel,
+  'typical_positive_ratio': 0.976601,
+  'keep_english_letter': False,
+  'charset_name': "IBM855",
+  'language': 'Russian',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langgreekmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langgreekmodel.py
new file mode 100644
index 000000000..533222166
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langgreekmodel.py
@@ -0,0 +1,225 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# Character Mapping Table:
+Latin7_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 82,100,104, 94, 98,101,116,102,111,187,117, 92, 88,113, 85,  # 40
+ 79,118,105, 83, 67,114,119, 95, 99,109,188,253,253,253,253,253,  # 50
+253, 72, 70, 80, 81, 60, 96, 93, 89, 68,120, 97, 77, 86, 69, 55,  # 60
+ 78,115, 65, 66, 58, 76,106,103, 87,107,112,253,253,253,253,253,  # 70
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 80
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 90
+253,233, 90,253,253,253,253,253,253,253,253,253,253, 74,253,253,  # a0
+253,253,253,253,247,248, 61, 36, 46, 71, 73,253, 54,253,108,123,  # b0
+110, 31, 51, 43, 41, 34, 91, 40, 52, 47, 44, 53, 38, 49, 59, 39,  # c0
+ 35, 48,250, 37, 33, 45, 56, 50, 84, 57,120,121, 17, 18, 22, 15,  # d0
+124,  1, 29, 20, 21,  3, 32, 13, 25,  5, 11, 16, 10,  6, 30,  4,  # e0
+  9,  8, 14,  7,  2, 12, 28, 23, 42, 24, 64, 75, 19, 26, 27,253,  # f0
+)
+
+win1253_char_to_order_map = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 82,100,104, 94, 98,101,116,102,111,187,117, 92, 88,113, 85,  # 40
+ 79,118,105, 83, 67,114,119, 95, 99,109,188,253,253,253,253,253,  # 50
+253, 72, 70, 80, 81, 60, 96, 93, 89, 68,120, 97, 77, 86, 69, 55,  # 60
+ 78,115, 65, 66, 58, 76,106,103, 87,107,112,253,253,253,253,253,  # 70
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 80
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 90
+253,233, 61,253,253,253,253,253,253,253,253,253,253, 74,253,253,  # a0
+253,253,253,253,247,253,253, 36, 46, 71, 73,253, 54,253,108,123,  # b0
+110, 31, 51, 43, 41, 34, 91, 40, 52, 47, 44, 53, 38, 49, 59, 39,  # c0
+ 35, 48,250, 37, 33, 45, 56, 50, 84, 57,120,121, 17, 18, 22, 15,  # d0
+124,  1, 29, 20, 21,  3, 32, 13, 25,  5, 11, 16, 10,  6, 30,  4,  # e0
+  9,  8, 14,  7,  2, 12, 28, 23, 42, 24, 64, 75, 19, 26, 27,253,  # f0
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 98.2851%
+# first 1024 sequences:1.7001%
+# rest  sequences:     0.0359%
+# negative sequences:  0.0148%
+GreekLangModel = (
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,2,2,3,3,3,3,3,3,3,3,1,3,3,3,0,2,2,3,3,0,3,0,3,2,0,3,3,3,0,
+3,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,0,3,3,0,3,2,3,3,0,3,2,3,3,3,0,0,3,0,3,0,3,3,2,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
+0,2,3,2,2,3,3,3,3,3,3,3,3,0,3,3,3,3,0,2,3,3,0,3,3,3,3,2,3,3,3,0,
+2,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,0,2,1,3,3,3,3,2,3,3,2,3,3,2,0,
+0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,0,3,3,3,3,3,3,0,3,3,0,3,3,3,3,3,3,3,3,3,3,0,3,2,3,3,0,
+2,0,1,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,2,3,0,0,0,0,3,3,0,3,1,3,3,3,0,3,3,0,3,3,3,3,0,0,0,0,
+2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,0,3,0,3,3,3,3,3,0,3,2,2,2,3,0,2,3,3,3,3,3,2,3,3,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,3,2,2,2,3,3,3,3,0,3,1,3,3,3,3,2,3,3,3,3,3,3,3,2,2,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,2,0,3,0,0,0,3,3,2,3,3,3,3,3,0,0,3,2,3,0,2,3,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,3,3,3,3,0,0,3,3,0,2,3,0,3,0,3,3,3,0,0,3,0,3,0,2,2,3,3,0,0,
+0,0,1,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,2,0,3,2,3,3,3,3,0,3,3,3,3,3,0,3,3,2,3,2,3,3,2,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,2,3,2,3,3,3,3,3,3,0,2,3,2,3,2,2,2,3,2,3,3,2,3,0,2,2,2,3,0,
+2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,0,0,0,3,3,3,2,3,3,0,0,3,0,3,0,0,0,3,2,0,3,0,3,0,0,2,0,2,0,
+0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,0,3,3,3,3,3,3,0,3,3,0,3,0,0,0,3,3,0,3,3,3,0,0,1,2,3,0,
+3,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,2,0,0,3,2,2,3,3,0,3,3,3,3,3,2,1,3,0,3,2,3,3,2,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,3,0,2,3,3,3,3,3,3,0,0,3,0,3,0,0,0,3,3,0,3,2,3,0,0,3,3,3,0,
+3,0,0,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,0,3,3,3,3,3,3,0,0,3,0,3,0,0,0,3,2,0,3,2,3,0,0,3,2,3,0,
+2,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,1,2,2,3,3,3,3,3,3,0,2,3,0,3,0,0,0,3,3,0,3,0,2,0,0,2,3,1,0,
+2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,3,3,3,3,0,3,0,3,3,2,3,0,3,3,3,3,3,3,0,3,3,3,0,2,3,0,0,3,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,3,3,3,0,0,3,0,0,0,3,3,0,3,0,2,3,3,0,0,3,0,3,0,3,3,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,0,0,0,3,3,3,3,3,3,0,0,3,0,2,0,0,0,3,3,0,3,0,3,0,0,2,0,2,0,
+0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,3,0,3,0,2,0,3,2,0,3,2,3,2,3,0,0,3,2,3,2,3,3,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,0,0,2,3,3,3,3,3,0,0,0,3,0,2,1,0,0,3,2,2,2,0,3,0,0,2,2,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,3,3,3,2,0,3,0,3,0,3,3,0,2,1,2,3,3,0,0,3,0,3,0,3,3,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,3,3,3,0,3,3,3,3,3,3,0,2,3,0,3,0,0,0,2,1,0,2,2,3,0,0,2,2,2,0,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,3,0,0,2,3,3,3,2,3,0,0,1,3,0,2,0,0,0,0,3,0,1,0,2,0,0,1,1,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,3,1,0,3,0,0,0,3,2,0,3,2,3,3,3,0,0,3,0,3,2,2,2,1,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,3,3,3,0,0,3,0,0,0,0,2,0,2,3,3,2,2,2,2,3,0,2,0,2,2,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,3,3,3,2,0,0,0,0,0,0,2,3,0,2,0,2,3,2,0,0,3,0,3,0,3,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,3,2,3,3,2,2,3,0,2,0,3,0,0,0,2,0,0,0,0,1,2,0,2,0,2,0,
+0,2,0,2,0,2,2,0,0,1,0,2,2,2,0,2,2,2,0,2,2,2,0,0,2,0,0,1,0,0,0,0,
+0,2,0,3,3,2,0,0,0,0,0,0,1,3,0,2,0,2,2,2,0,0,2,0,3,0,0,2,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,0,2,3,2,0,2,2,0,2,0,2,2,0,2,0,2,2,2,0,0,0,0,0,0,2,3,0,0,0,2,
+0,1,2,0,0,0,0,2,2,0,0,0,2,1,0,2,2,0,0,0,0,0,0,1,0,2,0,0,0,0,0,0,
+0,0,2,1,0,2,3,2,2,3,2,3,2,0,0,3,3,3,0,0,3,2,0,0,0,1,1,0,2,0,2,2,
+0,2,0,2,0,2,2,0,0,2,0,2,2,2,0,2,2,2,2,0,0,2,0,0,0,2,0,1,0,0,0,0,
+0,3,0,3,3,2,2,0,3,0,0,0,2,2,0,2,2,2,1,2,0,0,1,2,2,0,0,3,0,0,0,2,
+0,1,2,0,0,0,1,2,0,0,0,0,0,0,0,2,2,0,1,0,0,2,0,0,0,2,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,3,3,2,2,0,0,0,2,0,2,3,3,0,2,0,0,0,0,0,0,2,2,2,0,2,2,0,2,0,2,
+0,2,2,0,0,2,2,2,2,1,0,0,2,2,0,2,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,
+0,2,0,3,2,3,0,0,0,3,0,0,2,2,0,2,0,2,2,2,0,0,2,0,0,0,0,0,0,0,0,2,
+0,0,2,2,0,0,2,2,2,0,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,2,0,0,3,2,0,2,2,2,2,2,0,0,0,2,0,0,0,0,2,0,1,0,0,2,0,1,0,0,0,
+0,2,2,2,0,2,2,0,1,2,0,2,2,2,0,2,2,2,2,1,2,2,0,0,2,0,0,0,0,0,0,0,
+0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+0,2,0,2,0,2,2,0,0,0,0,1,2,1,0,0,2,2,0,0,2,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,3,2,3,0,0,2,0,0,0,2,2,0,2,0,0,0,1,0,0,2,0,2,0,2,2,0,0,0,0,
+0,0,2,0,0,0,0,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,
+0,2,2,3,2,2,0,0,0,0,0,0,1,3,0,2,0,2,2,0,0,0,1,0,2,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,0,2,0,3,2,0,2,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+0,0,2,0,0,0,0,1,1,0,0,2,1,2,0,2,2,0,1,0,0,1,0,0,0,2,0,0,0,0,0,0,
+0,3,0,2,2,2,0,0,2,0,0,0,2,0,0,0,2,3,0,2,0,0,0,0,0,0,2,2,0,0,0,2,
+0,1,2,0,0,0,1,2,2,1,0,0,0,2,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,1,2,0,2,2,0,2,0,0,2,0,0,0,0,1,2,1,0,2,1,0,0,0,0,0,0,0,0,0,0,
+0,0,2,0,0,0,3,1,2,2,0,2,0,0,0,0,2,0,0,0,2,0,0,3,0,0,0,0,2,2,2,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,1,0,2,0,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,2,
+0,2,2,0,0,2,2,2,2,2,0,1,2,0,0,0,2,2,0,1,0,2,0,0,2,2,0,0,0,0,0,0,
+0,0,0,0,1,0,0,0,0,0,0,0,3,0,0,2,0,0,0,0,0,0,0,0,2,0,2,0,0,0,0,2,
+0,1,2,0,0,0,0,2,2,1,0,1,0,1,0,2,2,2,1,0,0,0,0,0,0,1,0,0,0,0,0,0,
+0,2,0,1,2,0,0,0,0,0,0,0,0,0,0,2,0,0,2,2,0,0,0,0,1,0,0,0,0,0,0,2,
+0,2,2,0,0,0,0,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,
+0,2,2,2,2,0,0,0,3,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,1,
+0,0,2,0,0,0,0,1,2,0,0,0,0,0,0,2,2,1,1,0,0,0,0,0,0,1,0,0,0,0,0,0,
+0,2,0,2,2,2,0,0,2,0,0,0,0,0,0,0,2,2,2,0,0,0,2,0,0,0,0,0,0,0,0,2,
+0,0,1,0,0,0,0,2,1,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
+0,3,0,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,2,
+0,0,2,0,0,0,0,2,2,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,2,0,2,2,1,0,0,0,0,0,0,2,0,0,2,0,2,2,2,0,0,0,0,0,0,2,0,0,0,0,2,
+0,0,2,0,0,2,0,2,2,0,0,0,0,2,0,2,0,0,0,0,0,2,0,0,0,2,0,0,0,0,0,0,
+0,0,3,0,0,0,2,2,0,2,2,0,0,0,0,0,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,2,0,0,0,0,0,
+0,2,2,2,2,2,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,
+0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,2,2,0,0,0,0,0,2,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+0,2,0,0,0,2,0,0,0,0,0,1,0,0,0,0,2,2,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,2,0,0,0,
+0,2,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,2,0,2,0,0,0,
+0,0,0,0,0,0,0,0,2,1,0,0,0,0,0,0,2,0,0,0,1,2,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+)
+
+Latin7GreekModel = {
+  'char_to_order_map': Latin7_char_to_order_map,
+  'precedence_matrix': GreekLangModel,
+  'typical_positive_ratio': 0.982851,
+  'keep_english_letter': False,
+  'charset_name': "ISO-8859-7",
+  'language': 'Greek',
+}
+
+Win1253GreekModel = {
+  'char_to_order_map': win1253_char_to_order_map,
+  'precedence_matrix': GreekLangModel,
+  'typical_positive_ratio': 0.982851,
+  'keep_english_letter': False,
+  'charset_name': "windows-1253",
+  'language': 'Greek',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langhebrewmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langhebrewmodel.py
new file mode 100644
index 000000000..58f4c875e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langhebrewmodel.py
@@ -0,0 +1,200 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+#          Simon Montagu
+# Portions created by the Initial Developer are Copyright (C) 2005
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#   Shoshannah Forbes - original C code (?)
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# Windows-1255 language model
+# Character Mapping Table:
+WIN1255_CHAR_TO_ORDER_MAP = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 69, 91, 79, 80, 92, 89, 97, 90, 68,111,112, 82, 73, 95, 85,  # 40
+ 78,121, 86, 71, 67,102,107, 84,114,103,115,253,253,253,253,253,  # 50
+253, 50, 74, 60, 61, 42, 76, 70, 64, 53,105, 93, 56, 65, 54, 49,  # 60
+ 66,110, 51, 43, 44, 63, 81, 77, 98, 75,108,253,253,253,253,253,  # 70
+124,202,203,204,205, 40, 58,206,207,208,209,210,211,212,213,214,
+215, 83, 52, 47, 46, 72, 32, 94,216,113,217,109,218,219,220,221,
+ 34,116,222,118,100,223,224,117,119,104,125,225,226, 87, 99,227,
+106,122,123,228, 55,229,230,101,231,232,120,233, 48, 39, 57,234,
+ 30, 59, 41, 88, 33, 37, 36, 31, 29, 35,235, 62, 28,236,126,237,
+238, 38, 45,239,240,241,242,243,127,244,245,246,247,248,249,250,
+  9,  8, 20, 16,  3,  2, 24, 14, 22,  1, 25, 15,  4, 11,  6, 23,
+ 12, 19, 13, 26, 18, 27, 21, 17,  7, 10,  5,251,252,128, 96,253,
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 98.4004%
+# first 1024 sequences: 1.5981%
+# rest  sequences:      0.087%
+# negative sequences:   0.0015%
+HEBREW_LANG_MODEL = (
+0,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,2,3,2,1,2,0,1,0,0,
+3,0,3,1,0,0,1,3,2,0,1,1,2,0,2,2,2,1,1,1,1,2,1,1,1,2,0,0,2,2,0,1,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,
+1,2,1,2,1,2,0,0,2,0,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,
+1,2,1,3,1,1,0,0,2,0,0,0,1,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,0,1,2,2,1,3,
+1,2,1,1,2,2,0,0,2,2,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,1,0,1,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,2,2,2,2,3,2,
+1,2,1,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,2,3,2,2,3,2,2,2,1,2,2,2,2,
+1,2,1,1,2,2,0,1,2,0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,0,2,2,2,2,2,
+0,2,0,2,2,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,0,2,2,2,
+0,2,1,2,2,2,0,0,2,1,0,0,0,0,1,0,1,0,0,0,0,0,0,2,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,2,1,2,3,2,2,2,
+1,2,1,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,1,0,
+3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,3,3,1,0,2,0,2,
+0,2,1,2,2,2,0,0,1,2,0,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,2,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,2,3,2,2,3,2,1,2,1,1,1,
+0,1,1,1,1,1,3,0,1,0,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,1,1,0,0,1,0,0,1,0,0,0,0,
+0,0,1,0,0,0,0,0,2,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,
+0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,2,3,3,3,2,1,2,3,3,2,3,3,3,3,2,3,2,1,2,0,2,1,2,
+0,2,0,2,2,2,0,0,1,2,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,1,0,0,1,0,
+3,3,3,3,3,3,3,3,3,2,3,3,3,1,2,2,3,3,2,3,2,3,2,2,3,1,2,2,0,2,2,2,
+0,2,1,2,2,2,0,0,1,2,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,1,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,2,2,2,3,3,3,3,1,3,2,2,2,
+0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,3,3,3,2,3,2,2,2,1,2,2,0,2,2,2,2,
+0,2,0,2,2,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,1,3,2,3,3,2,3,3,2,2,1,2,2,2,2,2,2,
+0,2,1,2,1,2,0,0,1,0,0,0,0,0,1,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,2,3,2,3,3,2,3,3,3,3,2,3,2,3,3,3,3,3,2,2,2,2,2,2,2,1,
+0,2,0,1,2,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,2,1,2,3,3,3,3,3,3,3,2,3,2,3,2,1,2,3,0,2,1,2,2,
+0,2,1,1,2,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,2,0,
+3,3,3,3,3,3,3,3,3,2,3,3,3,3,2,1,3,1,2,2,2,1,2,3,3,1,2,1,2,2,2,2,
+0,1,1,1,1,1,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,0,2,3,3,3,1,3,3,3,1,2,2,2,2,1,1,2,2,2,2,2,2,
+0,2,0,1,1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,2,3,3,3,2,2,3,3,3,2,1,2,3,2,3,2,2,2,2,1,2,1,1,1,2,2,
+0,2,1,1,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,1,0,0,0,0,0,
+1,0,1,0,0,0,0,0,2,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,2,3,3,2,3,1,2,2,2,2,3,2,3,1,1,2,2,1,2,2,1,1,0,2,2,2,2,
+0,1,0,1,2,2,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,
+3,0,0,1,1,0,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,2,2,0,
+0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,1,0,1,0,1,1,0,1,1,0,0,0,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,0,0,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+3,2,2,1,2,2,2,2,2,2,2,1,2,2,1,2,2,1,1,1,1,1,1,1,1,2,1,1,0,3,3,3,
+0,3,0,2,2,2,2,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+2,2,2,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,2,1,2,2,2,1,1,1,2,0,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,2,2,2,2,0,2,2,0,0,0,0,0,0,
+0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,1,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,2,1,0,2,1,0,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,1,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+0,3,1,1,2,2,2,2,2,1,2,2,2,1,1,2,2,2,2,2,2,2,1,2,2,1,0,1,1,1,1,0,
+0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,2,1,1,1,1,2,1,1,2,1,0,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,
+0,0,2,0,0,0,0,0,0,0,0,1,1,0,0,0,0,1,1,0,0,1,1,0,0,0,0,0,0,1,0,0,
+2,1,1,2,2,2,2,2,2,2,2,2,2,2,1,2,2,2,2,2,1,2,1,2,1,1,1,1,0,0,0,0,
+0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,2,1,2,2,2,2,2,2,2,2,2,2,1,2,1,2,1,1,2,1,1,1,2,1,2,1,2,0,1,0,1,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,3,1,2,2,2,1,2,2,2,2,2,2,2,2,1,2,1,1,1,1,1,1,2,1,2,1,1,0,1,0,1,
+0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,1,2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,2,2,
+0,2,0,1,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,1,1,1,1,1,1,1,0,1,1,0,1,0,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,2,0,1,1,1,0,1,0,0,0,1,1,0,1,1,0,0,0,0,0,1,1,0,0,
+0,1,1,1,2,1,2,2,2,0,2,0,2,0,1,1,2,1,1,1,1,2,1,0,1,1,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,1,0,0,0,0,0,1,0,1,2,2,0,1,0,0,1,1,2,2,1,2,0,2,0,0,0,1,2,0,1,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,2,0,2,1,2,0,2,0,0,1,1,1,1,1,1,0,1,0,0,0,1,0,0,1,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1,0,0,0,0,0,1,0,2,1,1,0,1,0,0,1,1,1,2,2,0,0,1,0,0,0,1,0,0,1,
+1,1,2,1,0,1,1,1,0,1,0,1,1,1,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,2,2,1,
+0,2,0,1,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,1,0,0,1,0,1,1,1,1,0,0,0,0,0,1,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,1,1,1,1,1,1,1,1,2,1,0,1,1,1,1,1,1,1,1,1,1,1,0,1,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,1,1,0,0,0,0,1,1,1,0,1,1,0,1,0,0,0,1,1,0,1,
+2,0,1,0,1,0,1,0,0,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,1,1,1,0,1,0,0,1,1,2,1,1,2,0,1,0,0,0,1,1,0,1,
+1,0,0,1,0,0,1,0,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,0,0,2,1,1,2,0,2,0,0,0,1,1,0,1,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,2,1,1,0,1,0,0,2,2,1,2,1,1,0,1,0,0,0,1,1,0,1,
+2,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,2,2,0,0,0,0,0,1,1,0,1,0,0,1,0,0,0,0,1,0,1,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,2,2,0,0,0,0,2,1,1,1,0,2,1,1,0,0,0,2,1,0,1,
+1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,1,1,0,2,1,1,0,1,0,0,0,1,1,0,1,
+2,2,1,1,1,0,1,1,0,1,1,0,1,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,2,1,1,0,1,0,0,1,1,0,1,2,1,0,2,0,0,0,1,1,0,1,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,
+0,1,0,0,2,0,2,1,1,0,1,0,1,0,0,1,0,0,0,0,1,0,0,0,1,0,0,0,0,0,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,1,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,1,0,1,1,2,0,1,0,0,1,1,1,0,1,0,0,1,0,0,0,1,0,0,1,
+1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,0,0,0,0,0,1,0,1,1,0,0,1,0,0,2,1,1,1,1,1,0,1,0,0,0,0,1,0,1,
+0,1,1,1,2,1,1,1,1,0,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,1,2,1,0,0,0,0,0,1,1,1,1,1,0,1,0,0,0,1,1,0,0,
+)
+
+Win1255HebrewModel = {
+  'char_to_order_map': WIN1255_CHAR_TO_ORDER_MAP,
+  'precedence_matrix': HEBREW_LANG_MODEL,
+  'typical_positive_ratio': 0.984004,
+  'keep_english_letter': False,
+  'charset_name': "windows-1255",
+  'language': 'Hebrew',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langhungarianmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langhungarianmodel.py
new file mode 100644
index 000000000..bb7c095e1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langhungarianmodel.py
@@ -0,0 +1,225 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# Character Mapping Table:
+Latin2_HungarianCharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 28, 40, 54, 45, 32, 50, 49, 38, 39, 53, 36, 41, 34, 35, 47,
+ 46, 71, 43, 33, 37, 57, 48, 64, 68, 55, 52,253,253,253,253,253,
+253,  2, 18, 26, 17,  1, 27, 12, 20,  9, 22,  7,  6, 13,  4,  8,
+ 23, 67, 10,  5,  3, 21, 19, 65, 62, 16, 11,253,253,253,253,253,
+159,160,161,162,163,164,165,166,167,168,169,170,171,172,173,174,
+175,176,177,178,179,180,181,182,183,184,185,186,187,188,189,190,
+191,192,193,194,195,196,197, 75,198,199,200,201,202,203,204,205,
+ 79,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,
+221, 51, 81,222, 78,223,224,225,226, 44,227,228,229, 61,230,231,
+232,233,234, 58,235, 66, 59,236,237,238, 60, 69, 63,239,240,241,
+ 82, 14, 74,242, 70, 80,243, 72,244, 15, 83, 77, 84, 30, 76, 85,
+245,246,247, 25, 73, 42, 24,248,249,250, 31, 56, 29,251,252,253,
+)
+
+win1250HungarianCharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253, 28, 40, 54, 45, 32, 50, 49, 38, 39, 53, 36, 41, 34, 35, 47,
+ 46, 72, 43, 33, 37, 57, 48, 64, 68, 55, 52,253,253,253,253,253,
+253,  2, 18, 26, 17,  1, 27, 12, 20,  9, 22,  7,  6, 13,  4,  8,
+ 23, 67, 10,  5,  3, 21, 19, 65, 62, 16, 11,253,253,253,253,253,
+161,162,163,164,165,166,167,168,169,170,171,172,173,174,175,176,
+177,178,179,180, 78,181, 69,182,183,184,185,186,187,188,189,190,
+191,192,193,194,195,196,197, 76,198,199,200,201,202,203,204,205,
+ 81,206,207,208,209,210,211,212,213,214,215,216,217,218,219,220,
+221, 51, 83,222, 80,223,224,225,226, 44,227,228,229, 61,230,231,
+232,233,234, 58,235, 66, 59,236,237,238, 60, 70, 63,239,240,241,
+ 84, 14, 75,242, 71, 82,243, 73,244, 15, 85, 79, 86, 30, 77, 87,
+245,246,247, 25, 74, 42, 24,248,249,250, 31, 56, 29,251,252,253,
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 94.7368%
+# first 1024 sequences:5.2623%
+# rest  sequences:     0.8894%
+# negative sequences:  0.0009%
+HungarianLangModel = (
+0,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,1,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,
+3,3,3,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,2,2,3,3,1,1,2,2,2,2,2,1,2,
+3,2,2,3,3,3,3,3,2,3,3,3,3,3,3,1,2,3,3,3,3,2,3,3,1,1,3,3,0,1,1,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,
+3,2,1,3,3,3,3,3,2,3,3,3,3,3,1,1,2,3,3,3,3,3,3,3,1,1,3,2,0,1,1,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,1,1,2,3,3,3,1,3,3,3,3,3,1,3,3,2,2,0,3,2,3,
+0,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,3,3,3,2,3,3,2,3,3,3,3,3,2,3,3,2,2,3,2,3,2,0,3,2,2,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,
+3,3,3,3,3,3,2,3,3,3,3,3,2,3,3,3,1,2,3,2,2,3,1,2,3,3,2,2,0,3,3,3,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,3,2,3,3,3,3,2,3,3,3,3,0,2,3,2,
+0,0,0,1,1,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,1,1,1,3,3,2,1,3,2,2,3,2,1,3,2,2,1,0,3,3,1,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,2,2,3,3,3,3,3,1,2,3,3,3,3,1,2,1,3,3,3,3,2,2,3,1,1,3,2,0,1,1,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,2,2,3,3,3,3,3,2,1,3,3,3,3,3,2,2,1,3,3,3,0,1,1,2,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,1,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,3,3,3,2,3,3,2,3,3,3,2,0,3,2,3,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,1,0,
+3,3,3,3,3,3,2,3,3,3,2,3,2,3,3,3,1,3,2,2,2,3,1,1,3,3,1,1,0,3,3,2,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,2,3,3,3,2,3,2,3,3,3,2,3,3,3,3,3,1,2,3,2,2,0,2,2,2,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,2,2,2,3,1,3,3,2,2,1,3,3,3,1,1,3,1,2,3,2,3,2,2,2,1,0,2,2,2,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
+3,1,1,3,3,3,3,3,1,2,3,3,3,3,1,2,1,3,3,3,2,2,3,2,1,0,3,2,0,1,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,1,3,3,3,3,3,1,2,3,3,3,3,1,1,0,3,3,3,3,0,2,3,0,0,2,1,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,2,2,3,3,2,2,2,2,3,3,0,1,2,3,2,3,2,2,3,2,1,2,0,2,2,2,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
+3,3,3,3,3,3,1,2,3,3,3,2,1,2,3,3,2,2,2,3,2,3,3,1,3,3,1,1,0,2,3,2,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,1,2,2,2,2,3,3,3,1,1,1,3,3,1,1,3,1,1,3,2,1,2,3,1,1,0,2,2,2,
+0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,2,1,2,1,1,3,3,1,1,1,1,3,3,1,1,2,2,1,2,1,1,2,2,1,1,0,2,2,1,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,1,1,2,1,1,3,3,1,0,1,1,3,3,2,0,1,1,2,3,1,0,2,2,1,0,0,1,3,2,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,2,1,3,3,3,3,3,1,2,3,2,3,3,2,1,1,3,2,3,2,1,2,2,0,1,2,1,0,0,1,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,3,3,2,2,2,2,3,1,2,2,1,1,3,3,0,3,2,1,2,3,2,1,3,3,1,1,0,2,1,3,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,3,3,2,2,2,3,2,3,3,3,2,1,1,3,3,1,1,1,2,2,3,2,3,2,2,2,1,0,2,2,1,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+1,0,0,3,3,3,3,3,0,0,3,3,2,3,0,0,0,2,3,3,1,0,1,2,0,0,1,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,2,3,3,3,3,3,1,2,3,3,2,2,1,1,0,3,3,2,2,1,2,2,1,0,2,2,0,1,1,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,2,2,1,3,1,2,3,3,2,2,1,1,2,2,1,1,1,1,3,2,1,1,1,1,2,1,0,1,2,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+2,3,3,1,1,1,1,1,3,3,3,0,1,1,3,3,1,1,1,1,1,2,2,0,3,1,1,2,0,2,1,1,
+0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,
+3,1,0,1,2,1,2,2,0,1,2,3,1,2,0,0,0,2,1,1,1,1,1,2,0,0,1,1,0,0,0,0,
+1,2,1,2,2,2,1,2,1,2,0,2,0,2,2,1,1,2,1,1,2,1,1,1,0,1,0,0,0,1,1,0,
+1,1,1,2,3,2,3,3,0,1,2,2,3,1,0,1,0,2,1,2,2,0,1,1,0,0,1,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,3,3,2,2,1,0,0,3,2,3,2,0,0,0,1,1,3,0,0,1,1,0,0,2,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,1,2,2,3,3,1,0,1,3,2,3,1,1,1,0,1,1,1,1,1,3,1,0,0,2,2,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,1,1,2,2,2,1,0,1,2,3,3,2,0,0,0,2,1,1,1,2,1,1,1,0,1,1,1,0,0,0,
+1,2,2,2,2,2,1,1,1,2,0,2,1,1,1,1,1,2,1,1,1,1,1,1,0,1,1,1,0,0,1,1,
+3,2,2,1,0,0,1,1,2,2,0,3,0,1,2,1,1,0,0,1,1,1,0,1,1,1,1,0,2,1,1,1,
+2,2,1,1,1,2,1,2,1,1,1,1,1,1,1,2,1,1,1,2,3,1,1,1,1,1,1,1,1,1,0,1,
+2,3,3,0,1,0,0,0,3,3,1,0,0,1,2,2,1,0,0,0,0,2,0,0,1,1,1,0,2,1,1,1,
+2,1,1,1,1,1,1,2,1,1,0,1,1,0,1,1,1,0,1,2,1,1,0,1,1,1,1,1,1,1,0,1,
+2,3,3,0,1,0,0,0,2,2,0,0,0,0,1,2,2,0,0,0,0,1,0,0,1,1,0,0,2,0,1,0,
+2,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,1,1,2,0,1,1,1,1,1,0,1,
+3,2,2,0,1,0,1,0,2,3,2,0,0,1,2,2,1,0,0,1,1,1,0,0,2,1,0,1,2,2,1,1,
+2,1,1,1,1,1,1,2,1,1,1,1,1,1,0,2,1,0,1,1,0,1,1,1,0,1,1,2,1,1,0,1,
+2,2,2,0,0,1,0,0,2,2,1,1,0,0,2,1,1,0,0,0,1,2,0,0,2,1,0,0,2,1,1,1,
+2,1,1,1,1,2,1,2,1,1,1,2,2,1,1,2,1,1,1,2,1,1,1,1,1,1,1,1,1,1,0,1,
+1,2,3,0,0,0,1,0,3,2,1,0,0,1,2,1,1,0,0,0,0,2,1,0,1,1,0,0,2,1,2,1,
+1,1,0,0,0,1,0,1,1,1,1,1,2,0,0,1,0,0,0,2,0,0,1,1,1,1,1,1,1,1,0,1,
+3,0,0,2,1,2,2,1,0,0,2,1,2,2,0,0,0,2,1,1,1,0,1,1,0,0,1,1,2,0,0,0,
+1,2,1,2,2,1,1,2,1,2,0,1,1,1,1,1,1,1,1,1,2,1,1,0,0,1,1,1,1,0,0,1,
+1,3,2,0,0,0,1,0,2,2,2,0,0,0,2,2,1,0,0,0,0,3,1,1,1,1,0,0,2,1,1,1,
+2,1,0,1,1,1,0,1,1,1,1,1,1,1,0,2,1,0,0,1,0,1,1,0,1,1,1,1,1,1,0,1,
+2,3,2,0,0,0,1,0,2,2,0,0,0,0,2,1,1,0,0,0,0,2,1,0,1,1,0,0,2,1,1,0,
+2,1,1,1,1,2,1,2,1,2,0,1,1,1,0,2,1,1,1,2,1,1,1,1,0,1,1,1,1,1,0,1,
+3,1,1,2,2,2,3,2,1,1,2,2,1,1,0,1,0,2,2,1,1,1,1,1,0,0,1,1,0,1,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,0,0,0,0,0,2,2,0,0,0,0,2,2,1,0,0,0,1,1,0,0,1,2,0,0,2,1,1,1,
+2,2,1,1,1,2,1,2,1,1,0,1,1,1,1,2,1,1,1,2,1,1,1,1,0,1,2,1,1,1,0,1,
+1,0,0,1,2,3,2,1,0,0,2,0,1,1,0,0,0,1,1,1,1,0,1,1,0,0,1,0,0,0,0,0,
+1,2,1,2,1,2,1,1,1,2,0,2,1,1,1,0,1,2,0,0,1,1,1,0,0,0,0,0,0,0,0,0,
+2,3,2,0,0,0,0,0,1,1,2,1,0,0,1,1,1,0,0,0,0,2,0,0,1,1,0,0,2,1,1,1,
+2,1,1,1,1,1,1,2,1,0,1,1,1,1,0,2,1,1,1,1,1,1,0,1,0,1,1,1,1,1,0,1,
+1,2,2,0,1,1,1,0,2,2,2,0,0,0,3,2,1,0,0,0,1,1,0,0,1,1,0,1,1,1,0,0,
+1,1,0,1,1,1,1,1,1,1,1,2,1,1,1,1,1,1,1,2,1,1,1,0,0,1,1,1,0,1,0,1,
+2,1,0,2,1,1,2,2,1,1,2,1,1,1,0,0,0,1,1,0,1,1,1,1,0,0,1,1,1,0,0,0,
+1,2,2,2,2,2,1,1,1,2,0,2,1,1,1,1,1,1,1,1,1,1,1,1,0,1,1,0,0,0,1,0,
+1,2,3,0,0,0,1,0,2,2,0,0,0,0,2,2,0,0,0,0,0,1,0,0,1,0,0,0,2,0,1,0,
+2,1,1,1,1,1,0,2,0,0,0,1,2,1,1,1,1,0,1,2,0,1,0,1,0,1,1,1,0,1,0,1,
+2,2,2,0,0,0,1,0,2,1,2,0,0,0,1,1,2,0,0,0,0,1,0,0,1,1,0,0,2,1,0,1,
+2,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,2,0,1,1,1,1,1,0,1,
+1,2,2,0,0,0,1,0,2,2,2,0,0,0,1,1,0,0,0,0,0,1,1,0,2,0,0,1,1,1,0,1,
+1,0,1,1,1,1,1,1,0,1,1,1,1,0,0,1,0,0,1,1,0,1,0,1,1,1,1,1,0,0,0,1,
+1,0,0,1,0,1,2,1,0,0,1,1,1,2,0,0,0,1,1,0,1,0,1,1,0,0,1,0,0,0,0,0,
+0,2,1,2,1,1,1,1,1,2,0,2,0,1,1,0,1,2,1,0,1,1,1,0,0,0,0,0,0,1,0,0,
+2,1,1,0,1,2,0,0,1,1,1,0,0,0,1,1,0,0,0,0,0,1,0,0,1,0,0,0,2,1,0,1,
+2,2,1,1,1,1,1,2,1,1,0,1,1,1,1,2,1,1,1,2,1,1,0,1,0,1,1,1,1,1,0,1,
+1,2,2,0,0,0,0,0,1,1,0,0,0,0,2,1,0,0,0,0,0,2,0,0,2,2,0,0,2,0,0,1,
+2,1,1,1,1,1,1,1,0,1,1,0,1,1,0,1,0,0,0,1,1,1,1,0,0,1,1,1,1,0,0,1,
+1,1,2,0,0,3,1,0,2,1,1,1,0,0,1,1,1,0,0,0,1,1,0,0,0,1,0,0,1,0,1,0,
+1,2,1,0,1,1,1,2,1,1,0,1,1,1,1,1,0,0,0,1,1,1,1,1,0,1,0,0,0,1,0,0,
+2,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,0,1,0,0,0,1,0,0,0,0,2,0,0,0,
+2,1,1,1,1,1,1,1,1,1,0,1,1,1,1,1,1,1,1,1,2,1,1,0,0,1,1,1,1,1,0,1,
+2,1,1,1,2,1,1,1,0,1,1,2,1,0,0,0,0,1,1,1,1,0,1,0,0,0,0,1,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,1,0,1,1,1,1,1,0,0,1,1,2,1,0,0,0,1,1,0,0,0,1,1,0,0,1,0,1,0,0,0,
+1,2,1,1,1,1,1,1,1,1,0,1,0,1,1,1,1,1,1,0,1,1,1,0,0,0,0,0,0,1,0,0,
+2,0,0,0,1,1,1,1,0,0,1,1,0,0,0,0,0,1,1,1,2,0,0,1,0,0,1,0,1,0,0,0,
+0,1,1,1,1,1,1,1,1,2,0,1,1,1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
+1,0,0,1,1,1,1,1,0,0,2,1,0,1,0,0,0,1,0,1,0,0,0,0,0,0,1,0,0,0,0,0,
+0,1,1,1,1,1,1,0,1,1,0,1,0,1,1,0,1,1,0,0,1,1,1,0,0,0,0,0,0,0,0,0,
+1,0,0,1,1,1,0,0,0,0,1,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+0,1,1,1,1,1,0,0,1,1,0,1,0,1,0,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
+0,0,0,1,0,0,0,0,0,0,1,1,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,1,1,1,0,1,0,0,1,1,0,1,0,1,1,0,1,1,1,0,1,1,1,0,0,0,0,0,0,0,0,0,
+2,1,1,1,1,1,1,1,1,1,1,0,0,1,1,1,0,0,1,0,0,1,0,1,0,1,1,1,0,0,1,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,0,1,1,1,1,0,0,0,1,1,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,0,0,0,
+0,1,1,1,1,1,1,0,1,1,0,1,0,1,0,0,1,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
+)
+
+Latin2HungarianModel = {
+  'char_to_order_map': Latin2_HungarianCharToOrderMap,
+  'precedence_matrix': HungarianLangModel,
+  'typical_positive_ratio': 0.947368,
+  'keep_english_letter': True,
+  'charset_name': "ISO-8859-2",
+  'language': 'Hungarian',
+}
+
+Win1250HungarianModel = {
+  'char_to_order_map': win1250HungarianCharToOrderMap,
+  'precedence_matrix': HungarianLangModel,
+  'typical_positive_ratio': 0.947368,
+  'keep_english_letter': True,
+  'charset_name': "windows-1250",
+  'language': 'Hungarian',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langthaimodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langthaimodel.py
new file mode 100644
index 000000000..15f94c2df
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langthaimodel.py
@@ -0,0 +1,199 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# The following result for thai was collected from a limited sample (1M).
+
+# Character Mapping Table:
+TIS620CharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,254,255,255,254,255,255,  # 00
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,  # 10
+253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,253,  # 20
+252,252,252,252,252,252,252,252,252,252,253,253,253,253,253,253,  # 30
+253,182,106,107,100,183,184,185,101, 94,186,187,108,109,110,111,  # 40
+188,189,190, 89, 95,112,113,191,192,193,194,253,253,253,253,253,  # 50
+253, 64, 72, 73,114, 74,115,116,102, 81,201,117, 90,103, 78, 82,  # 60
+ 96,202, 91, 79, 84,104,105, 97, 98, 92,203,253,253,253,253,253,  # 70
+209,210,211,212,213, 88,214,215,216,217,218,219,220,118,221,222,
+223,224, 99, 85, 83,225,226,227,228,229,230,231,232,233,234,235,
+236,  5, 30,237, 24,238, 75,  8, 26, 52, 34, 51,119, 47, 58, 57,
+ 49, 53, 55, 43, 20, 19, 44, 14, 48,  3, 17, 25, 39, 62, 31, 54,
+ 45,  9, 16,  2, 61, 15,239, 12, 42, 46, 18, 21, 76,  4, 66, 63,
+ 22, 10,  1, 36, 23, 13, 40, 27, 32, 35, 86,240,241,242,243,244,
+ 11, 28, 41, 29, 33,245, 50, 37,  6,  7, 67, 77, 38, 93,246,247,
+ 68, 56, 59, 65, 69, 60, 70, 80, 71, 87,248,249,250,251,252,253,
+)
+
+# Model Table:
+# total sequences: 100%
+# first 512 sequences: 92.6386%
+# first 1024 sequences:7.3177%
+# rest  sequences:     1.0230%
+# negative sequences:  0.0436%
+ThaiLangModel = (
+0,1,3,3,3,3,0,0,3,3,0,3,3,0,3,3,3,3,3,3,3,3,0,0,3,3,3,0,3,3,3,3,
+0,3,3,0,0,0,1,3,0,3,3,2,3,3,0,1,2,3,3,3,3,0,2,0,2,0,0,3,2,1,2,2,
+3,0,3,3,2,3,0,0,3,3,0,3,3,0,3,3,3,3,3,3,3,3,3,0,3,2,3,0,2,2,2,3,
+0,2,3,0,0,0,0,1,0,1,2,3,1,1,3,2,2,0,1,1,0,0,1,0,0,0,0,0,0,0,1,1,
+3,3,3,2,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,3,3,2,3,2,3,3,2,2,2,
+3,1,2,3,0,3,3,2,2,1,2,3,3,1,2,0,1,3,0,1,0,0,1,0,0,0,0,0,0,0,1,1,
+3,3,2,2,3,3,3,3,1,2,3,3,3,3,3,2,2,2,2,3,3,2,2,3,3,2,2,3,2,3,2,2,
+3,3,1,2,3,1,2,2,3,3,1,0,2,1,0,0,3,1,2,1,0,0,1,0,0,0,0,0,0,1,0,1,
+3,3,3,3,3,3,2,2,3,3,3,3,2,3,2,2,3,3,2,2,3,2,2,2,2,1,1,3,1,2,1,1,
+3,2,1,0,2,1,0,1,0,1,1,0,1,1,0,0,1,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,
+3,3,3,2,3,2,3,3,2,2,3,2,3,3,2,3,1,1,2,3,2,2,2,3,2,2,2,2,2,1,2,1,
+2,2,1,1,3,3,2,1,0,1,2,2,0,1,3,0,0,0,1,1,0,0,0,0,0,2,3,0,0,2,1,1,
+3,3,2,3,3,2,0,0,3,3,0,3,3,0,2,2,3,1,2,2,1,1,1,0,2,2,2,0,2,2,1,1,
+0,2,1,0,2,0,0,2,0,1,0,0,1,0,0,0,1,1,1,1,0,0,0,0,0,0,0,0,0,0,1,0,
+3,3,2,3,3,2,0,0,3,3,0,2,3,0,2,1,2,2,2,2,1,2,0,0,2,2,2,0,2,2,1,1,
+0,2,1,0,2,0,0,2,0,1,1,0,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,
+3,3,2,3,2,3,2,0,2,2,1,3,2,1,3,2,1,2,3,2,2,3,0,2,3,2,2,1,2,2,2,2,
+1,2,2,0,0,0,0,2,0,1,2,0,1,1,1,0,1,0,3,1,1,0,0,0,0,0,0,0,0,0,1,0,
+3,3,2,3,3,2,3,2,2,2,3,2,2,3,2,2,1,2,3,2,2,3,1,3,2,2,2,3,2,2,2,3,
+3,2,1,3,0,1,1,1,0,2,1,1,1,1,1,0,1,0,1,1,0,0,0,0,0,0,0,0,0,2,0,0,
+1,0,0,3,0,3,3,3,3,3,0,0,3,0,2,2,3,3,3,3,3,0,0,0,1,1,3,0,0,0,0,2,
+0,0,1,0,0,0,0,0,0,0,2,3,0,0,0,3,0,2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
+2,0,3,3,3,3,0,0,2,3,0,0,3,0,3,3,2,3,3,3,3,3,0,0,3,3,3,0,0,0,3,3,
+0,0,3,0,0,0,0,2,0,0,2,1,1,3,0,0,1,0,0,2,3,0,1,0,0,0,0,0,0,0,1,0,
+3,3,3,3,2,3,3,3,3,3,3,3,1,2,1,3,3,2,2,1,2,2,2,3,1,1,2,0,2,1,2,1,
+2,2,1,0,0,0,1,1,0,1,0,1,1,0,0,0,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,
+3,0,2,1,2,3,3,3,0,2,0,2,2,0,2,1,3,2,2,1,2,1,0,0,2,2,1,0,2,1,2,2,
+0,1,1,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,2,1,3,3,1,1,3,0,2,3,1,1,3,2,1,1,2,0,2,2,3,2,1,1,1,1,1,2,
+3,0,0,1,3,1,2,1,2,0,3,0,0,0,1,0,3,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,
+3,3,1,1,3,2,3,3,3,1,3,2,1,3,2,1,3,2,2,2,2,1,3,3,1,2,1,3,1,2,3,0,
+2,1,1,3,2,2,2,1,2,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,
+3,3,2,3,2,3,3,2,3,2,3,2,3,3,2,1,0,3,2,2,2,1,2,2,2,1,2,2,1,2,1,1,
+2,2,2,3,0,1,3,1,1,1,1,0,1,1,0,2,1,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,2,3,2,2,1,1,3,2,3,2,3,2,0,3,2,2,1,2,0,2,2,2,1,2,2,2,2,1,
+3,2,1,2,2,1,0,2,0,1,0,0,1,1,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,1,
+3,3,3,3,3,2,3,1,2,3,3,2,2,3,0,1,1,2,0,3,3,2,2,3,0,1,1,3,0,0,0,0,
+3,1,0,3,3,0,2,0,2,1,0,0,3,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,2,3,2,3,3,0,1,3,1,1,2,1,2,1,1,3,1,1,0,2,3,1,1,1,1,1,1,1,1,
+3,1,1,2,2,2,2,1,1,1,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,2,2,1,1,2,1,3,3,2,3,2,2,3,2,2,3,1,2,2,1,2,0,3,2,1,2,2,2,2,2,1,
+3,2,1,2,2,2,1,1,1,1,0,0,1,1,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,1,3,3,0,2,1,0,3,2,0,0,3,1,0,1,1,0,1,0,0,0,0,0,1,
+1,0,0,1,0,3,2,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,2,2,2,3,0,0,1,3,0,3,2,0,3,2,2,3,3,3,3,3,1,0,2,2,2,0,2,2,1,2,
+0,2,3,0,0,0,0,1,0,1,0,0,1,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+3,0,2,3,1,3,3,2,3,3,0,3,3,0,3,2,2,3,2,3,3,3,0,0,2,2,3,0,1,1,1,3,
+0,0,3,0,0,0,2,2,0,1,3,0,1,2,2,2,3,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,
+3,2,3,3,2,0,3,3,2,2,3,1,3,2,1,3,2,0,1,2,2,0,2,3,2,1,0,3,0,0,0,0,
+3,0,0,2,3,1,3,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,1,3,2,2,2,1,2,0,1,3,1,1,3,1,3,0,0,2,1,1,1,1,2,1,1,1,0,2,1,0,1,
+1,2,0,0,0,3,1,1,0,0,0,0,1,0,1,0,0,1,0,1,0,0,0,0,0,3,1,0,0,0,1,0,
+3,3,3,3,2,2,2,2,2,1,3,1,1,1,2,0,1,1,2,1,2,1,3,2,0,0,3,1,1,1,1,1,
+3,1,0,2,3,0,0,0,3,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,2,3,0,3,3,0,2,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,2,3,1,3,0,0,1,2,0,0,2,0,3,3,2,3,3,3,2,3,0,0,2,2,2,0,0,0,2,2,
+0,0,1,0,0,0,0,3,0,0,0,0,2,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+0,0,0,3,0,2,0,0,0,0,0,0,0,0,0,0,1,2,3,1,3,3,0,0,1,0,3,0,0,0,0,0,
+0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,1,2,3,1,2,3,1,0,3,0,2,2,1,0,2,1,1,2,0,1,0,0,1,1,1,1,0,1,0,0,
+1,0,0,0,0,1,1,0,3,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,2,1,0,1,1,1,3,1,2,2,2,2,2,2,1,1,1,1,0,3,1,0,1,3,1,1,1,1,
+1,1,0,2,0,1,3,1,1,0,0,1,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,1,
+3,0,2,2,1,3,3,2,3,3,0,1,1,0,2,2,1,2,1,3,3,1,0,0,3,2,0,0,0,0,2,1,
+0,1,0,0,0,0,1,2,0,1,1,3,1,1,2,2,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,
+0,0,3,0,0,1,0,0,0,3,0,0,3,0,3,1,0,1,1,1,3,2,0,0,0,3,0,0,0,0,2,0,
+0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
+3,3,1,3,2,1,3,3,1,2,2,0,1,2,1,0,1,2,0,0,0,0,0,3,0,0,0,3,0,0,0,0,
+3,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,1,2,0,3,3,3,2,2,0,1,1,0,1,3,0,0,0,2,2,0,0,0,0,3,1,0,1,0,0,0,
+0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,2,3,1,2,0,0,2,1,0,3,1,0,1,2,0,1,1,1,1,3,0,0,3,1,1,0,2,2,1,1,
+0,2,0,0,0,0,0,1,0,1,0,0,1,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,0,3,1,2,0,0,2,2,0,1,2,0,1,0,1,3,1,2,1,0,0,0,2,0,3,0,0,0,1,0,
+0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,1,1,2,2,0,0,0,2,0,2,1,0,1,1,0,1,1,1,2,1,0,0,1,1,1,0,2,1,1,1,
+0,1,1,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1,0,1,
+0,0,0,2,0,1,3,1,1,1,1,0,0,0,0,3,2,0,1,0,0,0,1,2,0,0,0,1,0,0,0,0,
+0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,3,3,3,3,1,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,0,2,3,2,2,0,0,0,1,0,0,0,0,2,3,2,1,2,2,3,0,0,0,2,3,1,0,0,0,1,1,
+0,0,1,0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,1,1,0,1,0,0,0,0,0,0,0,0,0,
+3,3,2,2,0,1,0,0,0,0,2,0,2,0,1,0,0,0,1,1,0,0,0,2,1,0,1,0,1,1,0,0,
+0,1,0,2,0,0,1,0,3,0,1,0,0,0,2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,1,0,0,1,0,0,0,0,0,1,1,2,0,0,0,0,1,0,0,1,3,1,0,0,0,0,1,1,0,0,
+0,1,0,0,0,0,3,0,0,0,0,0,0,3,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,
+3,3,1,1,1,1,2,3,0,0,2,1,1,1,1,1,0,2,1,1,0,0,0,2,1,0,1,2,1,1,0,1,
+2,1,0,3,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,3,1,0,0,0,0,0,0,0,3,0,0,0,3,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,
+0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,2,0,0,0,0,0,0,1,2,1,0,1,1,0,2,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,2,0,0,0,1,3,0,1,0,0,0,2,0,0,0,0,0,0,0,1,2,0,0,0,0,0,
+3,3,0,0,1,1,2,0,0,1,2,1,0,1,1,1,0,1,1,0,0,2,1,1,0,1,0,0,1,1,1,0,
+0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,3,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,1,0,0,0,0,1,0,0,0,0,3,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
+2,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,3,0,0,1,1,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+1,1,0,1,2,0,1,2,0,0,1,1,0,2,0,1,0,0,1,0,0,0,0,1,0,0,0,2,0,0,0,0,
+1,0,0,1,0,1,1,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,1,0,0,0,0,0,0,0,1,1,0,1,1,0,2,1,3,0,0,0,0,1,1,0,0,0,0,0,0,0,3,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,1,0,1,0,0,2,0,0,2,0,0,1,1,2,0,0,1,1,0,0,0,1,0,0,0,1,1,0,0,0,
+1,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,
+1,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,1,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,3,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,0,0,0,2,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,1,3,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,1,0,0,0,0,
+1,0,0,0,0,0,0,0,0,1,0,0,0,0,2,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1,1,0,0,2,1,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+)
+
+TIS620ThaiModel = {
+  'char_to_order_map': TIS620CharToOrderMap,
+  'precedence_matrix': ThaiLangModel,
+  'typical_positive_ratio': 0.926386,
+  'keep_english_letter': False,
+  'charset_name': "TIS-620",
+  'language': 'Thai',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/langturkishmodel.py b/venv/Lib/site-packages/pip/_vendor/chardet/langturkishmodel.py
new file mode 100644
index 000000000..a427a4573
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/langturkishmodel.py
@@ -0,0 +1,193 @@
+# -*- coding: utf-8 -*-
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Communicator client code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Özgür Baskın - Turkish Language Model
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+# 255: Control characters that usually does not exist in any text
+# 254: Carriage/Return
+# 253: symbol (punctuation) that does not belong to word
+# 252: 0 - 9
+
+# Character Mapping Table:
+Latin5_TurkishCharToOrderMap = (
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,255,
+255, 23, 37, 47, 39, 29, 52, 36, 45, 53, 60, 16, 49, 20, 46, 42,
+ 48, 69, 44, 35, 31, 51, 38, 62, 65, 43, 56,255,255,255,255,255,
+255,  1, 21, 28, 12,  2, 18, 27, 25,  3, 24, 10,  5, 13,  4, 15,
+ 26, 64,  7,  8,  9, 14, 32, 57, 58, 11, 22,255,255,255,255,255,
+180,179,178,177,176,175,174,173,172,171,170,169,168,167,166,165,
+164,163,162,161,160,159,101,158,157,156,155,154,153,152,151,106,
+150,149,148,147,146,145,144,100,143,142,141,140,139,138,137,136,
+ 94, 80, 93,135,105,134,133, 63,132,131,130,129,128,127,126,125,
+124,104, 73, 99, 79, 85,123, 54,122, 98, 92,121,120, 91,103,119,
+ 68,118,117, 97,116,115, 50, 90,114,113,112,111, 55, 41, 40, 86,
+ 89, 70, 59, 78, 71, 82, 88, 33, 77, 66, 84, 83,110, 75, 61, 96,
+ 30, 67,109, 74, 87,102, 34, 95, 81,108, 76, 72, 17,  6, 19,107,
+)
+
+TurkishLangModel = (
+3,2,3,3,3,1,3,3,3,3,3,3,3,3,2,1,1,3,3,1,3,3,0,3,3,3,3,3,0,3,1,3,
+3,2,1,0,0,1,1,0,0,0,1,0,0,1,1,1,1,0,0,0,0,0,0,0,2,2,0,0,1,0,0,1,
+3,2,2,3,3,0,3,3,3,3,3,3,3,2,3,1,0,3,3,1,3,3,0,3,3,3,3,3,0,3,0,3,
+3,1,1,0,1,0,1,0,0,0,0,0,0,1,1,1,1,0,0,0,0,0,0,0,2,2,0,0,0,1,0,1,
+3,3,2,3,3,0,3,3,3,3,3,3,3,2,3,1,1,3,3,0,3,3,1,2,3,3,3,3,0,3,0,3,
+3,1,1,0,0,0,1,0,0,0,0,1,1,0,1,2,1,0,0,0,1,0,0,0,0,2,0,0,0,0,0,1,
+3,3,3,3,3,3,2,3,3,3,3,3,3,3,3,1,3,3,2,0,3,2,1,2,2,1,3,3,0,0,0,2,
+2,2,0,1,0,0,1,0,0,1,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,1,0,1,0,0,1,
+3,3,3,2,3,3,1,2,3,3,3,3,3,3,3,1,3,2,1,0,3,2,0,1,2,3,3,2,1,0,0,2,
+2,1,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,2,0,2,0,0,0,
+1,0,1,3,3,1,3,3,3,3,3,3,3,1,2,0,0,2,3,0,2,3,0,0,2,2,2,3,0,3,0,1,
+2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,0,3,3,3,0,3,2,0,2,3,2,3,3,1,0,0,2,
+3,2,0,0,1,0,0,0,0,0,0,2,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,0,2,0,0,1,
+3,3,3,2,3,3,2,3,3,3,3,2,3,3,3,0,3,3,0,0,2,1,0,0,2,3,2,2,0,0,0,2,
+2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,1,0,1,0,2,0,0,1,
+3,3,3,2,3,3,3,3,3,3,3,2,3,3,3,0,3,2,0,1,3,2,1,1,3,2,3,2,1,0,0,2,
+2,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,
+3,3,3,2,3,3,3,3,3,3,3,2,3,3,3,0,3,2,2,0,2,3,0,0,2,2,2,2,0,0,0,2,
+3,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,1,0,0,0,
+3,3,3,3,3,3,3,2,2,2,2,3,2,3,3,0,3,3,1,1,2,2,0,0,2,2,3,2,0,0,1,3,
+0,3,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,1,
+3,3,3,2,3,3,3,2,1,2,2,3,2,3,3,0,3,2,0,0,1,1,0,1,1,2,1,2,0,0,0,1,
+0,3,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,1,0,0,0,
+3,3,3,2,3,3,2,3,2,2,2,3,3,3,3,1,3,1,1,0,3,2,1,1,3,3,2,3,1,0,0,1,
+1,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,2,0,0,1,
+3,2,2,3,3,0,3,3,3,3,3,3,3,2,2,1,0,3,3,1,3,3,0,1,3,3,2,3,0,3,0,3,
+2,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
+2,2,2,3,3,0,3,3,3,3,3,3,3,3,3,0,0,3,2,0,3,3,0,3,2,3,3,3,0,3,1,3,
+2,0,0,0,0,0,0,0,0,0,0,1,0,1,2,0,1,0,0,0,0,0,0,0,2,2,0,0,1,0,0,1,
+3,3,3,1,2,3,3,1,0,0,1,0,0,3,3,2,3,0,0,2,0,0,2,0,2,0,0,0,2,0,2,0,
+0,3,1,0,1,0,0,0,2,2,1,0,1,1,2,1,2,2,2,0,2,1,1,0,0,0,2,0,0,0,0,0,
+1,2,1,3,3,0,3,3,3,3,3,2,3,0,0,0,0,2,3,0,2,3,1,0,2,3,1,3,0,3,0,2,
+3,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,1,3,3,2,2,3,2,2,0,1,2,3,0,1,2,1,0,1,0,0,0,1,0,2,2,0,0,0,1,
+1,1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,1,1,0,0,1,0,0,0,
+3,3,3,1,3,3,1,1,3,3,1,1,3,3,1,0,2,1,2,0,2,1,0,0,1,1,2,1,0,0,0,2,
+2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,1,0,2,1,3,0,0,2,0,0,3,3,0,3,0,0,1,0,1,2,0,0,1,1,2,2,0,1,0,
+0,1,2,1,1,0,1,0,1,1,1,1,1,0,1,1,1,2,2,1,2,0,1,0,0,0,0,0,0,1,0,0,
+3,3,3,2,3,2,3,3,0,2,2,2,3,3,3,0,3,0,0,0,2,2,0,1,2,1,1,1,0,0,0,1,
+0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
+3,3,3,3,3,3,2,1,2,2,3,3,3,3,2,0,2,0,0,0,2,2,0,0,2,1,3,3,0,0,1,1,
+1,1,0,0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,
+1,1,2,3,3,0,3,3,3,3,3,3,2,2,0,2,0,2,3,2,3,2,2,2,2,2,2,2,1,3,2,3,
+2,0,2,1,2,2,2,2,1,1,2,2,1,2,2,1,2,0,0,2,1,1,0,2,1,0,0,1,0,0,0,1,
+2,3,3,1,1,1,0,1,1,1,2,3,2,1,1,0,0,0,0,0,0,0,0,0,0,1,0,1,0,0,0,0,
+0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,2,2,2,3,2,3,2,2,1,3,3,3,0,2,1,2,0,2,1,0,0,1,1,1,1,1,0,0,1,
+2,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,2,0,1,0,0,0,
+3,3,3,2,3,3,3,3,3,2,3,1,2,3,3,1,2,0,0,0,0,0,0,0,3,2,1,1,0,0,0,0,
+2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
+3,3,3,2,2,3,3,2,1,1,1,1,1,3,3,0,3,1,0,0,1,1,0,0,3,1,2,1,0,0,0,0,
+0,3,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,
+3,3,3,2,2,3,2,2,2,3,2,1,1,3,3,0,3,0,0,0,0,1,0,0,3,1,1,2,0,0,0,1,
+1,0,0,1,0,0,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,
+1,1,1,3,3,0,3,3,3,3,3,2,2,2,1,2,0,2,1,2,2,1,1,0,1,2,2,2,2,2,2,2,
+0,0,2,1,2,1,2,1,0,1,1,3,1,2,1,1,2,0,0,2,0,1,0,1,0,1,0,0,0,1,0,1,
+3,3,3,1,3,3,3,0,1,1,0,2,2,3,1,0,3,0,0,0,1,0,0,0,1,0,0,1,0,1,0,0,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,2,0,0,2,2,1,0,0,1,0,0,3,3,1,3,0,0,1,1,0,2,0,3,0,0,0,2,0,1,1,
+0,1,2,0,1,2,2,0,2,2,2,2,1,0,2,1,1,0,2,0,2,1,2,0,0,0,0,0,0,0,0,0,
+3,3,3,1,3,2,3,2,0,2,2,2,1,3,2,0,2,1,2,0,1,2,0,0,1,0,2,2,0,0,0,2,
+1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,0,1,0,0,0,
+3,3,3,0,3,3,1,1,2,3,1,0,3,2,3,0,3,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,
+1,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,3,3,0,3,3,2,3,3,2,2,0,0,0,0,1,2,0,1,3,0,0,0,3,1,1,0,3,0,2,
+2,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,1,2,2,1,0,3,1,1,1,1,3,3,2,3,0,0,1,0,1,2,0,2,2,0,2,2,0,2,1,
+0,2,2,1,1,1,1,0,2,1,1,0,1,1,1,1,2,1,2,1,2,0,1,0,1,0,0,0,0,0,0,0,
+3,3,3,0,1,1,3,0,0,1,1,0,0,2,2,0,3,0,0,1,1,0,1,0,0,0,0,0,2,0,0,0,
+0,3,1,0,1,0,1,0,2,0,0,1,0,1,0,1,1,1,2,1,1,0,2,0,0,0,0,0,0,0,0,0,
+3,3,3,0,2,0,2,0,1,1,1,0,0,3,3,0,2,0,0,1,0,0,2,1,1,0,1,0,1,0,1,0,
+0,2,0,1,2,0,2,0,2,1,1,0,1,0,2,1,1,0,2,1,1,0,1,0,0,0,1,1,0,0,0,0,
+3,2,3,0,1,0,0,0,0,0,0,0,0,1,2,0,1,0,0,1,0,0,1,0,0,0,0,0,2,0,0,0,
+0,0,1,1,0,0,1,0,1,0,0,1,0,0,0,2,1,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,0,0,2,3,0,0,1,0,1,0,2,3,2,3,0,0,1,3,0,2,1,0,0,0,0,2,0,1,0,
+0,2,1,0,0,1,1,0,2,1,0,0,1,0,0,1,1,0,1,1,2,0,1,0,0,0,0,1,0,0,0,0,
+3,2,2,0,0,1,1,0,0,0,0,0,0,3,1,1,1,0,0,0,0,0,1,0,0,0,0,0,2,0,1,0,
+0,1,0,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,3,3,0,2,3,2,2,1,2,2,1,1,2,0,1,3,2,2,2,0,0,2,2,0,0,0,1,2,1,
+3,0,2,1,1,0,1,1,1,0,1,2,2,2,1,1,2,0,0,0,0,1,0,1,1,0,0,0,0,0,0,0,
+0,1,1,2,3,0,3,3,3,2,2,2,2,1,0,1,0,1,0,1,2,2,0,0,2,2,1,3,1,1,2,1,
+0,0,1,1,2,0,1,1,0,0,1,2,0,2,1,1,2,0,0,1,0,0,0,1,0,1,0,1,0,0,0,0,
+3,3,2,0,0,3,1,0,0,0,0,0,0,3,2,1,2,0,0,1,0,0,2,0,0,0,0,0,2,0,1,0,
+0,2,1,1,0,0,1,0,1,2,0,0,1,1,0,0,2,1,1,1,1,0,2,0,0,0,0,0,0,0,0,0,
+3,3,2,0,0,1,0,0,0,0,1,0,0,3,3,2,2,0,0,1,0,0,2,0,1,0,0,0,2,0,1,0,
+0,0,1,1,0,0,2,0,2,1,0,0,1,1,2,1,2,0,2,1,2,1,1,1,0,0,1,1,0,0,0,0,
+3,3,2,0,0,2,2,0,0,0,1,1,0,2,2,1,3,1,0,1,0,1,2,0,0,0,0,0,1,0,1,0,
+0,1,1,0,0,0,0,0,1,0,0,1,0,0,0,1,1,0,1,0,1,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,2,0,0,0,1,0,0,1,0,0,2,3,1,2,0,0,1,0,0,2,0,0,0,1,0,2,0,2,0,
+0,1,1,2,2,1,2,0,2,1,1,0,0,1,1,0,1,1,1,1,2,1,1,0,0,0,0,0,0,0,0,0,
+3,3,3,0,2,1,2,1,0,0,1,1,0,3,3,1,2,0,0,1,0,0,2,0,2,0,1,1,2,0,0,0,
+0,0,1,1,1,1,2,0,1,1,0,1,1,1,1,0,0,0,1,1,1,0,1,0,0,0,1,0,0,0,0,0,
+3,3,3,0,2,2,3,2,0,0,1,0,0,2,3,1,0,0,0,0,0,0,2,0,2,0,0,0,2,0,0,0,
+0,1,1,0,0,0,1,0,0,1,0,1,1,0,1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,0,0,
+3,2,3,0,0,0,0,0,0,0,1,0,0,2,2,2,2,0,0,1,0,0,2,0,0,0,0,0,2,0,1,0,
+0,0,2,1,1,0,1,0,2,1,1,0,0,1,1,2,1,0,2,0,2,0,1,0,0,0,2,0,0,0,0,0,
+0,0,0,2,2,0,2,1,1,1,1,2,2,0,0,1,0,1,0,0,1,3,0,0,0,0,1,0,0,2,1,0,
+0,0,1,0,1,0,0,0,0,0,2,1,0,1,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,
+2,0,0,2,3,0,2,3,1,2,2,0,2,0,0,2,0,2,1,1,1,2,1,0,0,1,2,1,1,2,1,0,
+1,0,2,0,1,0,1,1,0,0,2,2,1,2,1,1,2,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,
+3,3,3,0,2,1,2,0,0,0,1,0,0,3,2,0,1,0,0,1,0,0,2,0,0,0,1,2,1,0,1,0,
+0,0,0,0,1,0,1,0,0,1,0,0,0,0,1,0,1,0,1,1,1,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,2,2,0,2,2,1,1,0,1,1,1,1,1,0,0,1,2,1,1,1,0,1,0,0,0,1,1,1,1,
+0,0,2,1,0,1,1,1,0,1,1,2,1,2,1,1,2,0,1,1,2,1,0,2,0,0,0,0,0,0,0,0,
+3,2,2,0,0,2,0,0,0,0,0,0,0,2,2,0,2,0,0,1,0,0,2,0,0,0,0,0,2,0,0,0,
+0,2,1,0,0,0,0,0,1,0,0,0,0,0,0,0,1,0,0,0,1,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,3,2,0,2,2,0,1,1,0,1,0,0,1,0,0,0,1,0,1,0,0,0,0,0,1,0,0,0,0,
+2,0,1,0,1,0,1,1,0,0,1,2,0,1,0,1,1,0,0,1,0,1,0,2,0,0,0,0,0,0,0,0,
+2,2,2,0,1,1,0,0,0,1,0,0,0,1,2,0,1,0,0,1,0,0,1,0,0,0,0,1,2,0,1,0,
+0,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,1,0,1,0,2,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,2,1,0,1,1,1,0,0,0,0,1,2,0,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,
+1,1,2,0,1,0,0,0,1,0,1,0,0,0,1,0,0,1,0,0,0,0,0,0,0,1,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,2,0,0,0,0,0,1,
+0,0,1,2,2,0,2,1,2,1,1,2,2,0,0,0,0,1,0,0,1,1,0,0,2,0,0,0,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,
+2,2,2,0,0,0,1,0,0,0,0,0,0,2,2,1,1,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,
+0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,1,1,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+2,2,2,0,1,0,1,0,0,0,0,0,0,1,1,0,0,0,0,0,0,0,1,0,1,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,1,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,1,0,0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
+)
+
+Latin5TurkishModel = {
+  'char_to_order_map': Latin5_TurkishCharToOrderMap,
+  'precedence_matrix': TurkishLangModel,
+  'typical_positive_ratio': 0.970290,
+  'keep_english_letter': True,
+  'charset_name': "ISO-8859-9",
+  'language': 'Turkish',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/latin1prober.py b/venv/Lib/site-packages/pip/_vendor/chardet/latin1prober.py
new file mode 100644
index 000000000..7d1e8c20f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/latin1prober.py
@@ -0,0 +1,145 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .enums import ProbingState
+
+FREQ_CAT_NUM = 4
+
+UDF = 0  # undefined
+OTH = 1  # other
+ASC = 2  # ascii capital letter
+ASS = 3  # ascii small letter
+ACV = 4  # accent capital vowel
+ACO = 5  # accent capital other
+ASV = 6  # accent small vowel
+ASO = 7  # accent small other
+CLASS_NUM = 8  # total classes
+
+Latin1_CharToClass = (
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 00 - 07
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 08 - 0F
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 10 - 17
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 18 - 1F
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 20 - 27
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 28 - 2F
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 30 - 37
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 38 - 3F
+    OTH, ASC, ASC, ASC, ASC, ASC, ASC, ASC,   # 40 - 47
+    ASC, ASC, ASC, ASC, ASC, ASC, ASC, ASC,   # 48 - 4F
+    ASC, ASC, ASC, ASC, ASC, ASC, ASC, ASC,   # 50 - 57
+    ASC, ASC, ASC, OTH, OTH, OTH, OTH, OTH,   # 58 - 5F
+    OTH, ASS, ASS, ASS, ASS, ASS, ASS, ASS,   # 60 - 67
+    ASS, ASS, ASS, ASS, ASS, ASS, ASS, ASS,   # 68 - 6F
+    ASS, ASS, ASS, ASS, ASS, ASS, ASS, ASS,   # 70 - 77
+    ASS, ASS, ASS, OTH, OTH, OTH, OTH, OTH,   # 78 - 7F
+    OTH, UDF, OTH, ASO, OTH, OTH, OTH, OTH,   # 80 - 87
+    OTH, OTH, ACO, OTH, ACO, UDF, ACO, UDF,   # 88 - 8F
+    UDF, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # 90 - 97
+    OTH, OTH, ASO, OTH, ASO, UDF, ASO, ACO,   # 98 - 9F
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # A0 - A7
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # A8 - AF
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # B0 - B7
+    OTH, OTH, OTH, OTH, OTH, OTH, OTH, OTH,   # B8 - BF
+    ACV, ACV, ACV, ACV, ACV, ACV, ACO, ACO,   # C0 - C7
+    ACV, ACV, ACV, ACV, ACV, ACV, ACV, ACV,   # C8 - CF
+    ACO, ACO, ACV, ACV, ACV, ACV, ACV, OTH,   # D0 - D7
+    ACV, ACV, ACV, ACV, ACV, ACO, ACO, ACO,   # D8 - DF
+    ASV, ASV, ASV, ASV, ASV, ASV, ASO, ASO,   # E0 - E7
+    ASV, ASV, ASV, ASV, ASV, ASV, ASV, ASV,   # E8 - EF
+    ASO, ASO, ASV, ASV, ASV, ASV, ASV, OTH,   # F0 - F7
+    ASV, ASV, ASV, ASV, ASV, ASO, ASO, ASO,   # F8 - FF
+)
+
+# 0 : illegal
+# 1 : very unlikely
+# 2 : normal
+# 3 : very likely
+Latin1ClassModel = (
+# UDF OTH ASC ASS ACV ACO ASV ASO
+    0,  0,  0,  0,  0,  0,  0,  0,  # UDF
+    0,  3,  3,  3,  3,  3,  3,  3,  # OTH
+    0,  3,  3,  3,  3,  3,  3,  3,  # ASC
+    0,  3,  3,  3,  1,  1,  3,  3,  # ASS
+    0,  3,  3,  3,  1,  2,  1,  2,  # ACV
+    0,  3,  3,  3,  3,  3,  3,  3,  # ACO
+    0,  3,  1,  3,  1,  1,  1,  3,  # ASV
+    0,  3,  1,  3,  1,  1,  3,  3,  # ASO
+)
+
+
+class Latin1Prober(CharSetProber):
+    def __init__(self):
+        super(Latin1Prober, self).__init__()
+        self._last_char_class = None
+        self._freq_counter = None
+        self.reset()
+
+    def reset(self):
+        self._last_char_class = OTH
+        self._freq_counter = [0] * FREQ_CAT_NUM
+        CharSetProber.reset(self)
+
+    @property
+    def charset_name(self):
+        return "ISO-8859-1"
+
+    @property
+    def language(self):
+        return ""
+
+    def feed(self, byte_str):
+        byte_str = self.filter_with_english_letters(byte_str)
+        for c in byte_str:
+            char_class = Latin1_CharToClass[c]
+            freq = Latin1ClassModel[(self._last_char_class * CLASS_NUM)
+                                    + char_class]
+            if freq == 0:
+                self._state = ProbingState.NOT_ME
+                break
+            self._freq_counter[freq] += 1
+            self._last_char_class = char_class
+
+        return self.state
+
+    def get_confidence(self):
+        if self.state == ProbingState.NOT_ME:
+            return 0.01
+
+        total = sum(self._freq_counter)
+        if total < 0.01:
+            confidence = 0.0
+        else:
+            confidence = ((self._freq_counter[3] - self._freq_counter[1] * 20.0)
+                          / total)
+        if confidence < 0.0:
+            confidence = 0.0
+        # lower the confidence of latin1 so that other more accurate
+        # detector can take priority.
+        confidence = confidence * 0.73
+        return confidence
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/mbcharsetprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/mbcharsetprober.py
new file mode 100644
index 000000000..6256ecfd1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/mbcharsetprober.py
@@ -0,0 +1,91 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#   Proofpoint, Inc.
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .enums import ProbingState, MachineState
+
+
+class MultiByteCharSetProber(CharSetProber):
+    """
+    MultiByteCharSetProber
+    """
+
+    def __init__(self, lang_filter=None):
+        super(MultiByteCharSetProber, self).__init__(lang_filter=lang_filter)
+        self.distribution_analyzer = None
+        self.coding_sm = None
+        self._last_char = [0, 0]
+
+    def reset(self):
+        super(MultiByteCharSetProber, self).reset()
+        if self.coding_sm:
+            self.coding_sm.reset()
+        if self.distribution_analyzer:
+            self.distribution_analyzer.reset()
+        self._last_char = [0, 0]
+
+    @property
+    def charset_name(self):
+        raise NotImplementedError
+
+    @property
+    def language(self):
+        raise NotImplementedError
+
+    def feed(self, byte_str):
+        for i in range(len(byte_str)):
+            coding_state = self.coding_sm.next_state(byte_str[i])
+            if coding_state == MachineState.ERROR:
+                self.logger.debug('%s %s prober hit error at byte %s',
+                                  self.charset_name, self.language, i)
+                self._state = ProbingState.NOT_ME
+                break
+            elif coding_state == MachineState.ITS_ME:
+                self._state = ProbingState.FOUND_IT
+                break
+            elif coding_state == MachineState.START:
+                char_len = self.coding_sm.get_current_charlen()
+                if i == 0:
+                    self._last_char[1] = byte_str[0]
+                    self.distribution_analyzer.feed(self._last_char, char_len)
+                else:
+                    self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
+                                                    char_len)
+
+        self._last_char[0] = byte_str[-1]
+
+        if self.state == ProbingState.DETECTING:
+            if (self.distribution_analyzer.got_enough_data() and
+                    (self.get_confidence() > self.SHORTCUT_THRESHOLD)):
+                self._state = ProbingState.FOUND_IT
+
+        return self.state
+
+    def get_confidence(self):
+        return self.distribution_analyzer.get_confidence()
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/mbcsgroupprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/mbcsgroupprober.py
new file mode 100644
index 000000000..530abe75e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/mbcsgroupprober.py
@@ -0,0 +1,54 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#   Proofpoint, Inc.
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetgroupprober import CharSetGroupProber
+from .utf8prober import UTF8Prober
+from .sjisprober import SJISProber
+from .eucjpprober import EUCJPProber
+from .gb2312prober import GB2312Prober
+from .euckrprober import EUCKRProber
+from .cp949prober import CP949Prober
+from .big5prober import Big5Prober
+from .euctwprober import EUCTWProber
+
+
+class MBCSGroupProber(CharSetGroupProber):
+    def __init__(self, lang_filter=None):
+        super(MBCSGroupProber, self).__init__(lang_filter=lang_filter)
+        self.probers = [
+            UTF8Prober(),
+            SJISProber(),
+            EUCJPProber(),
+            GB2312Prober(),
+            EUCKRProber(),
+            CP949Prober(),
+            Big5Prober(),
+            EUCTWProber()
+        ]
+        self.reset()
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/mbcssm.py b/venv/Lib/site-packages/pip/_vendor/chardet/mbcssm.py
new file mode 100644
index 000000000..8360d0f28
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/mbcssm.py
@@ -0,0 +1,572 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .enums import MachineState
+
+# BIG5
+
+BIG5_CLS = (
+    1,1,1,1,1,1,1,1,  # 00 - 07    #allow 0x00 as legal value
+    1,1,1,1,1,1,0,0,  # 08 - 0f
+    1,1,1,1,1,1,1,1,  # 10 - 17
+    1,1,1,0,1,1,1,1,  # 18 - 1f
+    1,1,1,1,1,1,1,1,  # 20 - 27
+    1,1,1,1,1,1,1,1,  # 28 - 2f
+    1,1,1,1,1,1,1,1,  # 30 - 37
+    1,1,1,1,1,1,1,1,  # 38 - 3f
+    2,2,2,2,2,2,2,2,  # 40 - 47
+    2,2,2,2,2,2,2,2,  # 48 - 4f
+    2,2,2,2,2,2,2,2,  # 50 - 57
+    2,2,2,2,2,2,2,2,  # 58 - 5f
+    2,2,2,2,2,2,2,2,  # 60 - 67
+    2,2,2,2,2,2,2,2,  # 68 - 6f
+    2,2,2,2,2,2,2,2,  # 70 - 77
+    2,2,2,2,2,2,2,1,  # 78 - 7f
+    4,4,4,4,4,4,4,4,  # 80 - 87
+    4,4,4,4,4,4,4,4,  # 88 - 8f
+    4,4,4,4,4,4,4,4,  # 90 - 97
+    4,4,4,4,4,4,4,4,  # 98 - 9f
+    4,3,3,3,3,3,3,3,  # a0 - a7
+    3,3,3,3,3,3,3,3,  # a8 - af
+    3,3,3,3,3,3,3,3,  # b0 - b7
+    3,3,3,3,3,3,3,3,  # b8 - bf
+    3,3,3,3,3,3,3,3,  # c0 - c7
+    3,3,3,3,3,3,3,3,  # c8 - cf
+    3,3,3,3,3,3,3,3,  # d0 - d7
+    3,3,3,3,3,3,3,3,  # d8 - df
+    3,3,3,3,3,3,3,3,  # e0 - e7
+    3,3,3,3,3,3,3,3,  # e8 - ef
+    3,3,3,3,3,3,3,3,  # f0 - f7
+    3,3,3,3,3,3,3,0  # f8 - ff
+)
+
+BIG5_ST = (
+    MachineState.ERROR,MachineState.START,MachineState.START,     3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
+    MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,#08-0f
+    MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START#10-17
+)
+
+BIG5_CHAR_LEN_TABLE = (0, 1, 1, 2, 0)
+
+BIG5_SM_MODEL = {'class_table': BIG5_CLS,
+                 'class_factor': 5,
+                 'state_table': BIG5_ST,
+                 'char_len_table': BIG5_CHAR_LEN_TABLE,
+                 'name': 'Big5'}
+
+# CP949
+
+CP949_CLS  = (
+    1,1,1,1,1,1,1,1, 1,1,1,1,1,1,0,0,  # 00 - 0f
+    1,1,1,1,1,1,1,1, 1,1,1,0,1,1,1,1,  # 10 - 1f
+    1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,  # 20 - 2f
+    1,1,1,1,1,1,1,1, 1,1,1,1,1,1,1,1,  # 30 - 3f
+    1,4,4,4,4,4,4,4, 4,4,4,4,4,4,4,4,  # 40 - 4f
+    4,4,5,5,5,5,5,5, 5,5,5,1,1,1,1,1,  # 50 - 5f
+    1,5,5,5,5,5,5,5, 5,5,5,5,5,5,5,5,  # 60 - 6f
+    5,5,5,5,5,5,5,5, 5,5,5,1,1,1,1,1,  # 70 - 7f
+    0,6,6,6,6,6,6,6, 6,6,6,6,6,6,6,6,  # 80 - 8f
+    6,6,6,6,6,6,6,6, 6,6,6,6,6,6,6,6,  # 90 - 9f
+    6,7,7,7,7,7,7,7, 7,7,7,7,7,8,8,8,  # a0 - af
+    7,7,7,7,7,7,7,7, 7,7,7,7,7,7,7,7,  # b0 - bf
+    7,7,7,7,7,7,9,2, 2,3,2,2,2,2,2,2,  # c0 - cf
+    2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,  # d0 - df
+    2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,2,  # e0 - ef
+    2,2,2,2,2,2,2,2, 2,2,2,2,2,2,2,0,  # f0 - ff
+)
+
+CP949_ST = (
+#cls=    0      1      2      3      4      5      6      7      8      9  # previous state =
+    MachineState.ERROR,MachineState.START,     3,MachineState.ERROR,MachineState.START,MachineState.START,     4,     5,MachineState.ERROR,     6, # MachineState.START
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR, # MachineState.ERROR
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME, # MachineState.ITS_ME
+    MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START, # 3
+    MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START, # 4
+    MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START, # 5
+    MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START, # 6
+)
+
+CP949_CHAR_LEN_TABLE = (0, 1, 2, 0, 1, 1, 2, 2, 0, 2)
+
+CP949_SM_MODEL = {'class_table': CP949_CLS,
+                  'class_factor': 10,
+                  'state_table': CP949_ST,
+                  'char_len_table': CP949_CHAR_LEN_TABLE,
+                  'name': 'CP949'}
+
+# EUC-JP
+
+EUCJP_CLS = (
+    4,4,4,4,4,4,4,4,  # 00 - 07
+    4,4,4,4,4,4,5,5,  # 08 - 0f
+    4,4,4,4,4,4,4,4,  # 10 - 17
+    4,4,4,5,4,4,4,4,  # 18 - 1f
+    4,4,4,4,4,4,4,4,  # 20 - 27
+    4,4,4,4,4,4,4,4,  # 28 - 2f
+    4,4,4,4,4,4,4,4,  # 30 - 37
+    4,4,4,4,4,4,4,4,  # 38 - 3f
+    4,4,4,4,4,4,4,4,  # 40 - 47
+    4,4,4,4,4,4,4,4,  # 48 - 4f
+    4,4,4,4,4,4,4,4,  # 50 - 57
+    4,4,4,4,4,4,4,4,  # 58 - 5f
+    4,4,4,4,4,4,4,4,  # 60 - 67
+    4,4,4,4,4,4,4,4,  # 68 - 6f
+    4,4,4,4,4,4,4,4,  # 70 - 77
+    4,4,4,4,4,4,4,4,  # 78 - 7f
+    5,5,5,5,5,5,5,5,  # 80 - 87
+    5,5,5,5,5,5,1,3,  # 88 - 8f
+    5,5,5,5,5,5,5,5,  # 90 - 97
+    5,5,5,5,5,5,5,5,  # 98 - 9f
+    5,2,2,2,2,2,2,2,  # a0 - a7
+    2,2,2,2,2,2,2,2,  # a8 - af
+    2,2,2,2,2,2,2,2,  # b0 - b7
+    2,2,2,2,2,2,2,2,  # b8 - bf
+    2,2,2,2,2,2,2,2,  # c0 - c7
+    2,2,2,2,2,2,2,2,  # c8 - cf
+    2,2,2,2,2,2,2,2,  # d0 - d7
+    2,2,2,2,2,2,2,2,  # d8 - df
+    0,0,0,0,0,0,0,0,  # e0 - e7
+    0,0,0,0,0,0,0,0,  # e8 - ef
+    0,0,0,0,0,0,0,0,  # f0 - f7
+    0,0,0,0,0,0,0,5  # f8 - ff
+)
+
+EUCJP_ST = (
+          3,     4,     3,     5,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
+     MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+     MachineState.ITS_ME,MachineState.ITS_ME,MachineState.START,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#10-17
+     MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     3,MachineState.ERROR,#18-1f
+          3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START#20-27
+)
+
+EUCJP_CHAR_LEN_TABLE = (2, 2, 2, 3, 1, 0)
+
+EUCJP_SM_MODEL = {'class_table': EUCJP_CLS,
+                  'class_factor': 6,
+                  'state_table': EUCJP_ST,
+                  'char_len_table': EUCJP_CHAR_LEN_TABLE,
+                  'name': 'EUC-JP'}
+
+# EUC-KR
+
+EUCKR_CLS  = (
+    1,1,1,1,1,1,1,1,  # 00 - 07
+    1,1,1,1,1,1,0,0,  # 08 - 0f
+    1,1,1,1,1,1,1,1,  # 10 - 17
+    1,1,1,0,1,1,1,1,  # 18 - 1f
+    1,1,1,1,1,1,1,1,  # 20 - 27
+    1,1,1,1,1,1,1,1,  # 28 - 2f
+    1,1,1,1,1,1,1,1,  # 30 - 37
+    1,1,1,1,1,1,1,1,  # 38 - 3f
+    1,1,1,1,1,1,1,1,  # 40 - 47
+    1,1,1,1,1,1,1,1,  # 48 - 4f
+    1,1,1,1,1,1,1,1,  # 50 - 57
+    1,1,1,1,1,1,1,1,  # 58 - 5f
+    1,1,1,1,1,1,1,1,  # 60 - 67
+    1,1,1,1,1,1,1,1,  # 68 - 6f
+    1,1,1,1,1,1,1,1,  # 70 - 77
+    1,1,1,1,1,1,1,1,  # 78 - 7f
+    0,0,0,0,0,0,0,0,  # 80 - 87
+    0,0,0,0,0,0,0,0,  # 88 - 8f
+    0,0,0,0,0,0,0,0,  # 90 - 97
+    0,0,0,0,0,0,0,0,  # 98 - 9f
+    0,2,2,2,2,2,2,2,  # a0 - a7
+    2,2,2,2,2,3,3,3,  # a8 - af
+    2,2,2,2,2,2,2,2,  # b0 - b7
+    2,2,2,2,2,2,2,2,  # b8 - bf
+    2,2,2,2,2,2,2,2,  # c0 - c7
+    2,3,2,2,2,2,2,2,  # c8 - cf
+    2,2,2,2,2,2,2,2,  # d0 - d7
+    2,2,2,2,2,2,2,2,  # d8 - df
+    2,2,2,2,2,2,2,2,  # e0 - e7
+    2,2,2,2,2,2,2,2,  # e8 - ef
+    2,2,2,2,2,2,2,2,  # f0 - f7
+    2,2,2,2,2,2,2,0   # f8 - ff
+)
+
+EUCKR_ST = (
+    MachineState.ERROR,MachineState.START,     3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START #08-0f
+)
+
+EUCKR_CHAR_LEN_TABLE = (0, 1, 2, 0)
+
+EUCKR_SM_MODEL = {'class_table': EUCKR_CLS,
+                'class_factor': 4,
+                'state_table': EUCKR_ST,
+                'char_len_table': EUCKR_CHAR_LEN_TABLE,
+                'name': 'EUC-KR'}
+
+# EUC-TW
+
+EUCTW_CLS = (
+    2,2,2,2,2,2,2,2,  # 00 - 07
+    2,2,2,2,2,2,0,0,  # 08 - 0f
+    2,2,2,2,2,2,2,2,  # 10 - 17
+    2,2,2,0,2,2,2,2,  # 18 - 1f
+    2,2,2,2,2,2,2,2,  # 20 - 27
+    2,2,2,2,2,2,2,2,  # 28 - 2f
+    2,2,2,2,2,2,2,2,  # 30 - 37
+    2,2,2,2,2,2,2,2,  # 38 - 3f
+    2,2,2,2,2,2,2,2,  # 40 - 47
+    2,2,2,2,2,2,2,2,  # 48 - 4f
+    2,2,2,2,2,2,2,2,  # 50 - 57
+    2,2,2,2,2,2,2,2,  # 58 - 5f
+    2,2,2,2,2,2,2,2,  # 60 - 67
+    2,2,2,2,2,2,2,2,  # 68 - 6f
+    2,2,2,2,2,2,2,2,  # 70 - 77
+    2,2,2,2,2,2,2,2,  # 78 - 7f
+    0,0,0,0,0,0,0,0,  # 80 - 87
+    0,0,0,0,0,0,6,0,  # 88 - 8f
+    0,0,0,0,0,0,0,0,  # 90 - 97
+    0,0,0,0,0,0,0,0,  # 98 - 9f
+    0,3,4,4,4,4,4,4,  # a0 - a7
+    5,5,1,1,1,1,1,1,  # a8 - af
+    1,1,1,1,1,1,1,1,  # b0 - b7
+    1,1,1,1,1,1,1,1,  # b8 - bf
+    1,1,3,1,3,3,3,3,  # c0 - c7
+    3,3,3,3,3,3,3,3,  # c8 - cf
+    3,3,3,3,3,3,3,3,  # d0 - d7
+    3,3,3,3,3,3,3,3,  # d8 - df
+    3,3,3,3,3,3,3,3,  # e0 - e7
+    3,3,3,3,3,3,3,3,  # e8 - ef
+    3,3,3,3,3,3,3,3,  # f0 - f7
+    3,3,3,3,3,3,3,0   # f8 - ff
+)
+
+EUCTW_ST = (
+    MachineState.ERROR,MachineState.ERROR,MachineState.START,     3,     3,     3,     4,MachineState.ERROR,#00-07
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.START,MachineState.ERROR,#10-17
+    MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
+         5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.START,MachineState.START,#20-27
+    MachineState.START,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START #28-2f
+)
+
+EUCTW_CHAR_LEN_TABLE = (0, 0, 1, 2, 2, 2, 3)
+
+EUCTW_SM_MODEL = {'class_table': EUCTW_CLS,
+                'class_factor': 7,
+                'state_table': EUCTW_ST,
+                'char_len_table': EUCTW_CHAR_LEN_TABLE,
+                'name': 'x-euc-tw'}
+
+# GB2312
+
+GB2312_CLS = (
+    1,1,1,1,1,1,1,1,  # 00 - 07
+    1,1,1,1,1,1,0,0,  # 08 - 0f
+    1,1,1,1,1,1,1,1,  # 10 - 17
+    1,1,1,0,1,1,1,1,  # 18 - 1f
+    1,1,1,1,1,1,1,1,  # 20 - 27
+    1,1,1,1,1,1,1,1,  # 28 - 2f
+    3,3,3,3,3,3,3,3,  # 30 - 37
+    3,3,1,1,1,1,1,1,  # 38 - 3f
+    2,2,2,2,2,2,2,2,  # 40 - 47
+    2,2,2,2,2,2,2,2,  # 48 - 4f
+    2,2,2,2,2,2,2,2,  # 50 - 57
+    2,2,2,2,2,2,2,2,  # 58 - 5f
+    2,2,2,2,2,2,2,2,  # 60 - 67
+    2,2,2,2,2,2,2,2,  # 68 - 6f
+    2,2,2,2,2,2,2,2,  # 70 - 77
+    2,2,2,2,2,2,2,4,  # 78 - 7f
+    5,6,6,6,6,6,6,6,  # 80 - 87
+    6,6,6,6,6,6,6,6,  # 88 - 8f
+    6,6,6,6,6,6,6,6,  # 90 - 97
+    6,6,6,6,6,6,6,6,  # 98 - 9f
+    6,6,6,6,6,6,6,6,  # a0 - a7
+    6,6,6,6,6,6,6,6,  # a8 - af
+    6,6,6,6,6,6,6,6,  # b0 - b7
+    6,6,6,6,6,6,6,6,  # b8 - bf
+    6,6,6,6,6,6,6,6,  # c0 - c7
+    6,6,6,6,6,6,6,6,  # c8 - cf
+    6,6,6,6,6,6,6,6,  # d0 - d7
+    6,6,6,6,6,6,6,6,  # d8 - df
+    6,6,6,6,6,6,6,6,  # e0 - e7
+    6,6,6,6,6,6,6,6,  # e8 - ef
+    6,6,6,6,6,6,6,6,  # f0 - f7
+    6,6,6,6,6,6,6,0   # f8 - ff
+)
+
+GB2312_ST = (
+    MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,     3,MachineState.ERROR,#00-07
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,#10-17
+         4,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
+    MachineState.ERROR,MachineState.ERROR,     5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,#20-27
+    MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.START #28-2f
+)
+
+# To be accurate, the length of class 6 can be either 2 or 4.
+# But it is not necessary to discriminate between the two since
+# it is used for frequency analysis only, and we are validating
+# each code range there as well. So it is safe to set it to be
+# 2 here.
+GB2312_CHAR_LEN_TABLE = (0, 1, 1, 1, 1, 1, 2)
+
+GB2312_SM_MODEL = {'class_table': GB2312_CLS,
+                   'class_factor': 7,
+                   'state_table': GB2312_ST,
+                   'char_len_table': GB2312_CHAR_LEN_TABLE,
+                   'name': 'GB2312'}
+
+# Shift_JIS
+
+SJIS_CLS = (
+    1,1,1,1,1,1,1,1,  # 00 - 07
+    1,1,1,1,1,1,0,0,  # 08 - 0f
+    1,1,1,1,1,1,1,1,  # 10 - 17
+    1,1,1,0,1,1,1,1,  # 18 - 1f
+    1,1,1,1,1,1,1,1,  # 20 - 27
+    1,1,1,1,1,1,1,1,  # 28 - 2f
+    1,1,1,1,1,1,1,1,  # 30 - 37
+    1,1,1,1,1,1,1,1,  # 38 - 3f
+    2,2,2,2,2,2,2,2,  # 40 - 47
+    2,2,2,2,2,2,2,2,  # 48 - 4f
+    2,2,2,2,2,2,2,2,  # 50 - 57
+    2,2,2,2,2,2,2,2,  # 58 - 5f
+    2,2,2,2,2,2,2,2,  # 60 - 67
+    2,2,2,2,2,2,2,2,  # 68 - 6f
+    2,2,2,2,2,2,2,2,  # 70 - 77
+    2,2,2,2,2,2,2,1,  # 78 - 7f
+    3,3,3,3,3,2,2,3,  # 80 - 87
+    3,3,3,3,3,3,3,3,  # 88 - 8f
+    3,3,3,3,3,3,3,3,  # 90 - 97
+    3,3,3,3,3,3,3,3,  # 98 - 9f
+    #0xa0 is illegal in sjis encoding, but some pages does
+    #contain such byte. We need to be more error forgiven.
+    2,2,2,2,2,2,2,2,  # a0 - a7
+    2,2,2,2,2,2,2,2,  # a8 - af
+    2,2,2,2,2,2,2,2,  # b0 - b7
+    2,2,2,2,2,2,2,2,  # b8 - bf
+    2,2,2,2,2,2,2,2,  # c0 - c7
+    2,2,2,2,2,2,2,2,  # c8 - cf
+    2,2,2,2,2,2,2,2,  # d0 - d7
+    2,2,2,2,2,2,2,2,  # d8 - df
+    3,3,3,3,3,3,3,3,  # e0 - e7
+    3,3,3,3,3,4,4,4,  # e8 - ef
+    3,3,3,3,3,3,3,3,  # f0 - f7
+    3,3,3,3,3,0,0,0)  # f8 - ff
+
+
+SJIS_ST = (
+    MachineState.ERROR,MachineState.START,MachineState.START,     3,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#00-07
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START #10-17
+)
+
+SJIS_CHAR_LEN_TABLE = (0, 1, 1, 2, 0, 0)
+
+SJIS_SM_MODEL = {'class_table': SJIS_CLS,
+               'class_factor': 6,
+               'state_table': SJIS_ST,
+               'char_len_table': SJIS_CHAR_LEN_TABLE,
+               'name': 'Shift_JIS'}
+
+# UCS2-BE
+
+UCS2BE_CLS = (
+    0,0,0,0,0,0,0,0,  # 00 - 07
+    0,0,1,0,0,2,0,0,  # 08 - 0f
+    0,0,0,0,0,0,0,0,  # 10 - 17
+    0,0,0,3,0,0,0,0,  # 18 - 1f
+    0,0,0,0,0,0,0,0,  # 20 - 27
+    0,3,3,3,3,3,0,0,  # 28 - 2f
+    0,0,0,0,0,0,0,0,  # 30 - 37
+    0,0,0,0,0,0,0,0,  # 38 - 3f
+    0,0,0,0,0,0,0,0,  # 40 - 47
+    0,0,0,0,0,0,0,0,  # 48 - 4f
+    0,0,0,0,0,0,0,0,  # 50 - 57
+    0,0,0,0,0,0,0,0,  # 58 - 5f
+    0,0,0,0,0,0,0,0,  # 60 - 67
+    0,0,0,0,0,0,0,0,  # 68 - 6f
+    0,0,0,0,0,0,0,0,  # 70 - 77
+    0,0,0,0,0,0,0,0,  # 78 - 7f
+    0,0,0,0,0,0,0,0,  # 80 - 87
+    0,0,0,0,0,0,0,0,  # 88 - 8f
+    0,0,0,0,0,0,0,0,  # 90 - 97
+    0,0,0,0,0,0,0,0,  # 98 - 9f
+    0,0,0,0,0,0,0,0,  # a0 - a7
+    0,0,0,0,0,0,0,0,  # a8 - af
+    0,0,0,0,0,0,0,0,  # b0 - b7
+    0,0,0,0,0,0,0,0,  # b8 - bf
+    0,0,0,0,0,0,0,0,  # c0 - c7
+    0,0,0,0,0,0,0,0,  # c8 - cf
+    0,0,0,0,0,0,0,0,  # d0 - d7
+    0,0,0,0,0,0,0,0,  # d8 - df
+    0,0,0,0,0,0,0,0,  # e0 - e7
+    0,0,0,0,0,0,0,0,  # e8 - ef
+    0,0,0,0,0,0,0,0,  # f0 - f7
+    0,0,0,0,0,0,4,5   # f8 - ff
+)
+
+UCS2BE_ST  = (
+          5,     7,     7,MachineState.ERROR,     4,     3,MachineState.ERROR,MachineState.ERROR,#00-07
+     MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+     MachineState.ITS_ME,MachineState.ITS_ME,     6,     6,     6,     6,MachineState.ERROR,MachineState.ERROR,#10-17
+          6,     6,     6,     6,     6,MachineState.ITS_ME,     6,     6,#18-1f
+          6,     6,     6,     6,     5,     7,     7,MachineState.ERROR,#20-27
+          5,     8,     6,     6,MachineState.ERROR,     6,     6,     6,#28-2f
+          6,     6,     6,     6,MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START #30-37
+)
+
+UCS2BE_CHAR_LEN_TABLE = (2, 2, 2, 0, 2, 2)
+
+UCS2BE_SM_MODEL = {'class_table': UCS2BE_CLS,
+                   'class_factor': 6,
+                   'state_table': UCS2BE_ST,
+                   'char_len_table': UCS2BE_CHAR_LEN_TABLE,
+                   'name': 'UTF-16BE'}
+
+# UCS2-LE
+
+UCS2LE_CLS = (
+    0,0,0,0,0,0,0,0,  # 00 - 07
+    0,0,1,0,0,2,0,0,  # 08 - 0f
+    0,0,0,0,0,0,0,0,  # 10 - 17
+    0,0,0,3,0,0,0,0,  # 18 - 1f
+    0,0,0,0,0,0,0,0,  # 20 - 27
+    0,3,3,3,3,3,0,0,  # 28 - 2f
+    0,0,0,0,0,0,0,0,  # 30 - 37
+    0,0,0,0,0,0,0,0,  # 38 - 3f
+    0,0,0,0,0,0,0,0,  # 40 - 47
+    0,0,0,0,0,0,0,0,  # 48 - 4f
+    0,0,0,0,0,0,0,0,  # 50 - 57
+    0,0,0,0,0,0,0,0,  # 58 - 5f
+    0,0,0,0,0,0,0,0,  # 60 - 67
+    0,0,0,0,0,0,0,0,  # 68 - 6f
+    0,0,0,0,0,0,0,0,  # 70 - 77
+    0,0,0,0,0,0,0,0,  # 78 - 7f
+    0,0,0,0,0,0,0,0,  # 80 - 87
+    0,0,0,0,0,0,0,0,  # 88 - 8f
+    0,0,0,0,0,0,0,0,  # 90 - 97
+    0,0,0,0,0,0,0,0,  # 98 - 9f
+    0,0,0,0,0,0,0,0,  # a0 - a7
+    0,0,0,0,0,0,0,0,  # a8 - af
+    0,0,0,0,0,0,0,0,  # b0 - b7
+    0,0,0,0,0,0,0,0,  # b8 - bf
+    0,0,0,0,0,0,0,0,  # c0 - c7
+    0,0,0,0,0,0,0,0,  # c8 - cf
+    0,0,0,0,0,0,0,0,  # d0 - d7
+    0,0,0,0,0,0,0,0,  # d8 - df
+    0,0,0,0,0,0,0,0,  # e0 - e7
+    0,0,0,0,0,0,0,0,  # e8 - ef
+    0,0,0,0,0,0,0,0,  # f0 - f7
+    0,0,0,0,0,0,4,5   # f8 - ff
+)
+
+UCS2LE_ST = (
+          6,     6,     7,     6,     4,     3,MachineState.ERROR,MachineState.ERROR,#00-07
+     MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#08-0f
+     MachineState.ITS_ME,MachineState.ITS_ME,     5,     5,     5,MachineState.ERROR,MachineState.ITS_ME,MachineState.ERROR,#10-17
+          5,     5,     5,MachineState.ERROR,     5,MachineState.ERROR,     6,     6,#18-1f
+          7,     6,     8,     8,     5,     5,     5,MachineState.ERROR,#20-27
+          5,     5,     5,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     5,     5,#28-2f
+          5,     5,     5,MachineState.ERROR,     5,MachineState.ERROR,MachineState.START,MachineState.START #30-37
+)
+
+UCS2LE_CHAR_LEN_TABLE = (2, 2, 2, 2, 2, 2)
+
+UCS2LE_SM_MODEL = {'class_table': UCS2LE_CLS,
+                 'class_factor': 6,
+                 'state_table': UCS2LE_ST,
+                 'char_len_table': UCS2LE_CHAR_LEN_TABLE,
+                 'name': 'UTF-16LE'}
+
+# UTF-8
+
+UTF8_CLS = (
+    1,1,1,1,1,1,1,1,  # 00 - 07  #allow 0x00 as a legal value
+    1,1,1,1,1,1,0,0,  # 08 - 0f
+    1,1,1,1,1,1,1,1,  # 10 - 17
+    1,1,1,0,1,1,1,1,  # 18 - 1f
+    1,1,1,1,1,1,1,1,  # 20 - 27
+    1,1,1,1,1,1,1,1,  # 28 - 2f
+    1,1,1,1,1,1,1,1,  # 30 - 37
+    1,1,1,1,1,1,1,1,  # 38 - 3f
+    1,1,1,1,1,1,1,1,  # 40 - 47
+    1,1,1,1,1,1,1,1,  # 48 - 4f
+    1,1,1,1,1,1,1,1,  # 50 - 57
+    1,1,1,1,1,1,1,1,  # 58 - 5f
+    1,1,1,1,1,1,1,1,  # 60 - 67
+    1,1,1,1,1,1,1,1,  # 68 - 6f
+    1,1,1,1,1,1,1,1,  # 70 - 77
+    1,1,1,1,1,1,1,1,  # 78 - 7f
+    2,2,2,2,3,3,3,3,  # 80 - 87
+    4,4,4,4,4,4,4,4,  # 88 - 8f
+    4,4,4,4,4,4,4,4,  # 90 - 97
+    4,4,4,4,4,4,4,4,  # 98 - 9f
+    5,5,5,5,5,5,5,5,  # a0 - a7
+    5,5,5,5,5,5,5,5,  # a8 - af
+    5,5,5,5,5,5,5,5,  # b0 - b7
+    5,5,5,5,5,5,5,5,  # b8 - bf
+    0,0,6,6,6,6,6,6,  # c0 - c7
+    6,6,6,6,6,6,6,6,  # c8 - cf
+    6,6,6,6,6,6,6,6,  # d0 - d7
+    6,6,6,6,6,6,6,6,  # d8 - df
+    7,8,8,8,8,8,8,8,  # e0 - e7
+    8,8,8,8,8,9,8,8,  # e8 - ef
+    10,11,11,11,11,11,11,11,  # f0 - f7
+    12,13,13,13,14,15,0,0    # f8 - ff
+)
+
+UTF8_ST = (
+    MachineState.ERROR,MachineState.START,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     12,   10,#00-07
+         9,     11,     8,     7,     6,     5,     4,    3,#08-0f
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#10-17
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#18-1f
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#20-27
+    MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,MachineState.ITS_ME,#28-2f
+    MachineState.ERROR,MachineState.ERROR,     5,     5,     5,     5,MachineState.ERROR,MachineState.ERROR,#30-37
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#38-3f
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     5,     5,     5,MachineState.ERROR,MachineState.ERROR,#40-47
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#48-4f
+    MachineState.ERROR,MachineState.ERROR,     7,     7,     7,     7,MachineState.ERROR,MachineState.ERROR,#50-57
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#58-5f
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     7,     7,MachineState.ERROR,MachineState.ERROR,#60-67
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#68-6f
+    MachineState.ERROR,MachineState.ERROR,     9,     9,     9,     9,MachineState.ERROR,MachineState.ERROR,#70-77
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#78-7f
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,     9,MachineState.ERROR,MachineState.ERROR,#80-87
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#88-8f
+    MachineState.ERROR,MachineState.ERROR,    12,    12,    12,    12,MachineState.ERROR,MachineState.ERROR,#90-97
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#98-9f
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,    12,MachineState.ERROR,MachineState.ERROR,#a0-a7
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#a8-af
+    MachineState.ERROR,MachineState.ERROR,    12,    12,    12,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#b0-b7
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,#b8-bf
+    MachineState.ERROR,MachineState.ERROR,MachineState.START,MachineState.START,MachineState.START,MachineState.START,MachineState.ERROR,MachineState.ERROR,#c0-c7
+    MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR,MachineState.ERROR #c8-cf
+)
+
+UTF8_CHAR_LEN_TABLE = (0, 1, 0, 0, 0, 0, 2, 3, 3, 3, 4, 4, 5, 5, 6, 6)
+
+UTF8_SM_MODEL = {'class_table': UTF8_CLS,
+                 'class_factor': 16,
+                 'state_table': UTF8_ST,
+                 'char_len_table': UTF8_CHAR_LEN_TABLE,
+                 'name': 'UTF-8'}
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/sbcharsetprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/sbcharsetprober.py
new file mode 100644
index 000000000..0adb51de5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/sbcharsetprober.py
@@ -0,0 +1,132 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .enums import CharacterCategory, ProbingState, SequenceLikelihood
+
+
+class SingleByteCharSetProber(CharSetProber):
+    SAMPLE_SIZE = 64
+    SB_ENOUGH_REL_THRESHOLD = 1024  #  0.25 * SAMPLE_SIZE^2
+    POSITIVE_SHORTCUT_THRESHOLD = 0.95
+    NEGATIVE_SHORTCUT_THRESHOLD = 0.05
+
+    def __init__(self, model, reversed=False, name_prober=None):
+        super(SingleByteCharSetProber, self).__init__()
+        self._model = model
+        # TRUE if we need to reverse every pair in the model lookup
+        self._reversed = reversed
+        # Optional auxiliary prober for name decision
+        self._name_prober = name_prober
+        self._last_order = None
+        self._seq_counters = None
+        self._total_seqs = None
+        self._total_char = None
+        self._freq_char = None
+        self.reset()
+
+    def reset(self):
+        super(SingleByteCharSetProber, self).reset()
+        # char order of last character
+        self._last_order = 255
+        self._seq_counters = [0] * SequenceLikelihood.get_num_categories()
+        self._total_seqs = 0
+        self._total_char = 0
+        # characters that fall in our sampling range
+        self._freq_char = 0
+
+    @property
+    def charset_name(self):
+        if self._name_prober:
+            return self._name_prober.charset_name
+        else:
+            return self._model['charset_name']
+
+    @property
+    def language(self):
+        if self._name_prober:
+            return self._name_prober.language
+        else:
+            return self._model.get('language')
+
+    def feed(self, byte_str):
+        if not self._model['keep_english_letter']:
+            byte_str = self.filter_international_words(byte_str)
+        if not byte_str:
+            return self.state
+        char_to_order_map = self._model['char_to_order_map']
+        for i, c in enumerate(byte_str):
+            # XXX: Order is in range 1-64, so one would think we want 0-63 here,
+            #      but that leads to 27 more test failures than before.
+            order = char_to_order_map[c]
+            # XXX: This was SYMBOL_CAT_ORDER before, with a value of 250, but
+            #      CharacterCategory.SYMBOL is actually 253, so we use CONTROL
+            #      to make it closer to the original intent. The only difference
+            #      is whether or not we count digits and control characters for
+            #      _total_char purposes.
+            if order < CharacterCategory.CONTROL:
+                self._total_char += 1
+            if order < self.SAMPLE_SIZE:
+                self._freq_char += 1
+                if self._last_order < self.SAMPLE_SIZE:
+                    self._total_seqs += 1
+                    if not self._reversed:
+                        i = (self._last_order * self.SAMPLE_SIZE) + order
+                        model = self._model['precedence_matrix'][i]
+                    else:  # reverse the order of the letters in the lookup
+                        i = (order * self.SAMPLE_SIZE) + self._last_order
+                        model = self._model['precedence_matrix'][i]
+                    self._seq_counters[model] += 1
+            self._last_order = order
+
+        charset_name = self._model['charset_name']
+        if self.state == ProbingState.DETECTING:
+            if self._total_seqs > self.SB_ENOUGH_REL_THRESHOLD:
+                confidence = self.get_confidence()
+                if confidence > self.POSITIVE_SHORTCUT_THRESHOLD:
+                    self.logger.debug('%s confidence = %s, we have a winner',
+                                      charset_name, confidence)
+                    self._state = ProbingState.FOUND_IT
+                elif confidence < self.NEGATIVE_SHORTCUT_THRESHOLD:
+                    self.logger.debug('%s confidence = %s, below negative '
+                                      'shortcut threshhold %s', charset_name,
+                                      confidence,
+                                      self.NEGATIVE_SHORTCUT_THRESHOLD)
+                    self._state = ProbingState.NOT_ME
+
+        return self.state
+
+    def get_confidence(self):
+        r = 0.01
+        if self._total_seqs > 0:
+            r = ((1.0 * self._seq_counters[SequenceLikelihood.POSITIVE]) /
+                 self._total_seqs / self._model['typical_positive_ratio'])
+            r = r * self._freq_char / self._total_char
+            if r >= 1.0:
+                r = 0.99
+        return r
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/sbcsgroupprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/sbcsgroupprober.py
new file mode 100644
index 000000000..98e95dc1a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/sbcsgroupprober.py
@@ -0,0 +1,73 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetgroupprober import CharSetGroupProber
+from .sbcharsetprober import SingleByteCharSetProber
+from .langcyrillicmodel import (Win1251CyrillicModel, Koi8rModel,
+                                Latin5CyrillicModel, MacCyrillicModel,
+                                Ibm866Model, Ibm855Model)
+from .langgreekmodel import Latin7GreekModel, Win1253GreekModel
+from .langbulgarianmodel import Latin5BulgarianModel, Win1251BulgarianModel
+# from .langhungarianmodel import Latin2HungarianModel, Win1250HungarianModel
+from .langthaimodel import TIS620ThaiModel
+from .langhebrewmodel import Win1255HebrewModel
+from .hebrewprober import HebrewProber
+from .langturkishmodel import Latin5TurkishModel
+
+
+class SBCSGroupProber(CharSetGroupProber):
+    def __init__(self):
+        super(SBCSGroupProber, self).__init__()
+        self.probers = [
+            SingleByteCharSetProber(Win1251CyrillicModel),
+            SingleByteCharSetProber(Koi8rModel),
+            SingleByteCharSetProber(Latin5CyrillicModel),
+            SingleByteCharSetProber(MacCyrillicModel),
+            SingleByteCharSetProber(Ibm866Model),
+            SingleByteCharSetProber(Ibm855Model),
+            SingleByteCharSetProber(Latin7GreekModel),
+            SingleByteCharSetProber(Win1253GreekModel),
+            SingleByteCharSetProber(Latin5BulgarianModel),
+            SingleByteCharSetProber(Win1251BulgarianModel),
+            # TODO: Restore Hungarian encodings (iso-8859-2 and windows-1250)
+            #       after we retrain model.
+            # SingleByteCharSetProber(Latin2HungarianModel),
+            # SingleByteCharSetProber(Win1250HungarianModel),
+            SingleByteCharSetProber(TIS620ThaiModel),
+            SingleByteCharSetProber(Latin5TurkishModel),
+        ]
+        hebrew_prober = HebrewProber()
+        logical_hebrew_prober = SingleByteCharSetProber(Win1255HebrewModel,
+                                                        False, hebrew_prober)
+        visual_hebrew_prober = SingleByteCharSetProber(Win1255HebrewModel, True,
+                                                       hebrew_prober)
+        hebrew_prober.set_model_probers(logical_hebrew_prober, visual_hebrew_prober)
+        self.probers.extend([hebrew_prober, logical_hebrew_prober,
+                             visual_hebrew_prober])
+
+        self.reset()
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/sjisprober.py b/venv/Lib/site-packages/pip/_vendor/chardet/sjisprober.py
new file mode 100644
index 000000000..9e29623bd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/sjisprober.py
@@ -0,0 +1,92 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .mbcharsetprober import MultiByteCharSetProber
+from .codingstatemachine import CodingStateMachine
+from .chardistribution import SJISDistributionAnalysis
+from .jpcntx import SJISContextAnalysis
+from .mbcssm import SJIS_SM_MODEL
+from .enums import ProbingState, MachineState
+
+
+class SJISProber(MultiByteCharSetProber):
+    def __init__(self):
+        super(SJISProber, self).__init__()
+        self.coding_sm = CodingStateMachine(SJIS_SM_MODEL)
+        self.distribution_analyzer = SJISDistributionAnalysis()
+        self.context_analyzer = SJISContextAnalysis()
+        self.reset()
+
+    def reset(self):
+        super(SJISProber, self).reset()
+        self.context_analyzer.reset()
+
+    @property
+    def charset_name(self):
+        return self.context_analyzer.charset_name
+
+    @property
+    def language(self):
+        return "Japanese"
+
+    def feed(self, byte_str):
+        for i in range(len(byte_str)):
+            coding_state = self.coding_sm.next_state(byte_str[i])
+            if coding_state == MachineState.ERROR:
+                self.logger.debug('%s %s prober hit error at byte %s',
+                                  self.charset_name, self.language, i)
+                self._state = ProbingState.NOT_ME
+                break
+            elif coding_state == MachineState.ITS_ME:
+                self._state = ProbingState.FOUND_IT
+                break
+            elif coding_state == MachineState.START:
+                char_len = self.coding_sm.get_current_charlen()
+                if i == 0:
+                    self._last_char[1] = byte_str[0]
+                    self.context_analyzer.feed(self._last_char[2 - char_len:],
+                                               char_len)
+                    self.distribution_analyzer.feed(self._last_char, char_len)
+                else:
+                    self.context_analyzer.feed(byte_str[i + 1 - char_len:i + 3
+                                                        - char_len], char_len)
+                    self.distribution_analyzer.feed(byte_str[i - 1:i + 1],
+                                                    char_len)
+
+        self._last_char[0] = byte_str[-1]
+
+        if self.state == ProbingState.DETECTING:
+            if (self.context_analyzer.got_enough_data() and
+               (self.get_confidence() > self.SHORTCUT_THRESHOLD)):
+                self._state = ProbingState.FOUND_IT
+
+        return self.state
+
+    def get_confidence(self):
+        context_conf = self.context_analyzer.get_confidence()
+        distrib_conf = self.distribution_analyzer.get_confidence()
+        return max(context_conf, distrib_conf)
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/universaldetector.py b/venv/Lib/site-packages/pip/_vendor/chardet/universaldetector.py
new file mode 100644
index 000000000..7b4e92d61
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/universaldetector.py
@@ -0,0 +1,286 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is Mozilla Universal charset detector code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 2001
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#   Shy Shalom - original C code
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+"""
+Module containing the UniversalDetector detector class, which is the primary
+class a user of ``chardet`` should use.
+
+:author: Mark Pilgrim (initial port to Python)
+:author: Shy Shalom (original C code)
+:author: Dan Blanchard (major refactoring for 3.0)
+:author: Ian Cordasco
+"""
+
+
+import codecs
+import logging
+import re
+
+from .charsetgroupprober import CharSetGroupProber
+from .enums import InputState, LanguageFilter, ProbingState
+from .escprober import EscCharSetProber
+from .latin1prober import Latin1Prober
+from .mbcsgroupprober import MBCSGroupProber
+from .sbcsgroupprober import SBCSGroupProber
+
+
+class UniversalDetector(object):
+    """
+    The ``UniversalDetector`` class underlies the ``chardet.detect`` function
+    and coordinates all of the different charset probers.
+
+    To get a ``dict`` containing an encoding and its confidence, you can simply
+    run:
+
+    .. code::
+
+            u = UniversalDetector()
+            u.feed(some_bytes)
+            u.close()
+            detected = u.result
+
+    """
+
+    MINIMUM_THRESHOLD = 0.20
+    HIGH_BYTE_DETECTOR = re.compile(b'[\x80-\xFF]')
+    ESC_DETECTOR = re.compile(b'(\033|~{)')
+    WIN_BYTE_DETECTOR = re.compile(b'[\x80-\x9F]')
+    ISO_WIN_MAP = {'iso-8859-1': 'Windows-1252',
+                   'iso-8859-2': 'Windows-1250',
+                   'iso-8859-5': 'Windows-1251',
+                   'iso-8859-6': 'Windows-1256',
+                   'iso-8859-7': 'Windows-1253',
+                   'iso-8859-8': 'Windows-1255',
+                   'iso-8859-9': 'Windows-1254',
+                   'iso-8859-13': 'Windows-1257'}
+
+    def __init__(self, lang_filter=LanguageFilter.ALL):
+        self._esc_charset_prober = None
+        self._charset_probers = []
+        self.result = None
+        self.done = None
+        self._got_data = None
+        self._input_state = None
+        self._last_char = None
+        self.lang_filter = lang_filter
+        self.logger = logging.getLogger(__name__)
+        self._has_win_bytes = None
+        self.reset()
+
+    def reset(self):
+        """
+        Reset the UniversalDetector and all of its probers back to their
+        initial states.  This is called by ``__init__``, so you only need to
+        call this directly in between analyses of different documents.
+        """
+        self.result = {'encoding': None, 'confidence': 0.0, 'language': None}
+        self.done = False
+        self._got_data = False
+        self._has_win_bytes = False
+        self._input_state = InputState.PURE_ASCII
+        self._last_char = b''
+        if self._esc_charset_prober:
+            self._esc_charset_prober.reset()
+        for prober in self._charset_probers:
+            prober.reset()
+
+    def feed(self, byte_str):
+        """
+        Takes a chunk of a document and feeds it through all of the relevant
+        charset probers.
+
+        After calling ``feed``, you can check the value of the ``done``
+        attribute to see if you need to continue feeding the
+        ``UniversalDetector`` more data, or if it has made a prediction
+        (in the ``result`` attribute).
+
+        .. note::
+           You should always call ``close`` when you're done feeding in your
+           document if ``done`` is not already ``True``.
+        """
+        if self.done:
+            return
+
+        if not len(byte_str):
+            return
+
+        if not isinstance(byte_str, bytearray):
+            byte_str = bytearray(byte_str)
+
+        # First check for known BOMs, since these are guaranteed to be correct
+        if not self._got_data:
+            # If the data starts with BOM, we know it is UTF
+            if byte_str.startswith(codecs.BOM_UTF8):
+                # EF BB BF  UTF-8 with BOM
+                self.result = {'encoding': "UTF-8-SIG",
+                               'confidence': 1.0,
+                               'language': ''}
+            elif byte_str.startswith((codecs.BOM_UTF32_LE,
+                                      codecs.BOM_UTF32_BE)):
+                # FF FE 00 00  UTF-32, little-endian BOM
+                # 00 00 FE FF  UTF-32, big-endian BOM
+                self.result = {'encoding': "UTF-32",
+                               'confidence': 1.0,
+                               'language': ''}
+            elif byte_str.startswith(b'\xFE\xFF\x00\x00'):
+                # FE FF 00 00  UCS-4, unusual octet order BOM (3412)
+                self.result = {'encoding': "X-ISO-10646-UCS-4-3412",
+                               'confidence': 1.0,
+                               'language': ''}
+            elif byte_str.startswith(b'\x00\x00\xFF\xFE'):
+                # 00 00 FF FE  UCS-4, unusual octet order BOM (2143)
+                self.result = {'encoding': "X-ISO-10646-UCS-4-2143",
+                               'confidence': 1.0,
+                               'language': ''}
+            elif byte_str.startswith((codecs.BOM_LE, codecs.BOM_BE)):
+                # FF FE  UTF-16, little endian BOM
+                # FE FF  UTF-16, big endian BOM
+                self.result = {'encoding': "UTF-16",
+                               'confidence': 1.0,
+                               'language': ''}
+
+            self._got_data = True
+            if self.result['encoding'] is not None:
+                self.done = True
+                return
+
+        # If none of those matched and we've only see ASCII so far, check
+        # for high bytes and escape sequences
+        if self._input_state == InputState.PURE_ASCII:
+            if self.HIGH_BYTE_DETECTOR.search(byte_str):
+                self._input_state = InputState.HIGH_BYTE
+            elif self._input_state == InputState.PURE_ASCII and \
+                    self.ESC_DETECTOR.search(self._last_char + byte_str):
+                self._input_state = InputState.ESC_ASCII
+
+        self._last_char = byte_str[-1:]
+
+        # If we've seen escape sequences, use the EscCharSetProber, which
+        # uses a simple state machine to check for known escape sequences in
+        # HZ and ISO-2022 encodings, since those are the only encodings that
+        # use such sequences.
+        if self._input_state == InputState.ESC_ASCII:
+            if not self._esc_charset_prober:
+                self._esc_charset_prober = EscCharSetProber(self.lang_filter)
+            if self._esc_charset_prober.feed(byte_str) == ProbingState.FOUND_IT:
+                self.result = {'encoding':
+                               self._esc_charset_prober.charset_name,
+                               'confidence':
+                               self._esc_charset_prober.get_confidence(),
+                               'language':
+                               self._esc_charset_prober.language}
+                self.done = True
+        # If we've seen high bytes (i.e., those with values greater than 127),
+        # we need to do more complicated checks using all our multi-byte and
+        # single-byte probers that are left.  The single-byte probers
+        # use character bigram distributions to determine the encoding, whereas
+        # the multi-byte probers use a combination of character unigram and
+        # bigram distributions.
+        elif self._input_state == InputState.HIGH_BYTE:
+            if not self._charset_probers:
+                self._charset_probers = [MBCSGroupProber(self.lang_filter)]
+                # If we're checking non-CJK encodings, use single-byte prober
+                if self.lang_filter & LanguageFilter.NON_CJK:
+                    self._charset_probers.append(SBCSGroupProber())
+                self._charset_probers.append(Latin1Prober())
+            for prober in self._charset_probers:
+                if prober.feed(byte_str) == ProbingState.FOUND_IT:
+                    self.result = {'encoding': prober.charset_name,
+                                   'confidence': prober.get_confidence(),
+                                   'language': prober.language}
+                    self.done = True
+                    break
+            if self.WIN_BYTE_DETECTOR.search(byte_str):
+                self._has_win_bytes = True
+
+    def close(self):
+        """
+        Stop analyzing the current document and come up with a final
+        prediction.
+
+        :returns:  The ``result`` attribute, a ``dict`` with the keys
+                   `encoding`, `confidence`, and `language`.
+        """
+        # Don't bother with checks if we're already done
+        if self.done:
+            return self.result
+        self.done = True
+
+        if not self._got_data:
+            self.logger.debug('no data received!')
+
+        # Default to ASCII if it is all we've seen so far
+        elif self._input_state == InputState.PURE_ASCII:
+            self.result = {'encoding': 'ascii',
+                           'confidence': 1.0,
+                           'language': ''}
+
+        # If we have seen non-ASCII, return the best that met MINIMUM_THRESHOLD
+        elif self._input_state == InputState.HIGH_BYTE:
+            prober_confidence = None
+            max_prober_confidence = 0.0
+            max_prober = None
+            for prober in self._charset_probers:
+                if not prober:
+                    continue
+                prober_confidence = prober.get_confidence()
+                if prober_confidence > max_prober_confidence:
+                    max_prober_confidence = prober_confidence
+                    max_prober = prober
+            if max_prober and (max_prober_confidence > self.MINIMUM_THRESHOLD):
+                charset_name = max_prober.charset_name
+                lower_charset_name = max_prober.charset_name.lower()
+                confidence = max_prober.get_confidence()
+                # Use Windows encoding name instead of ISO-8859 if we saw any
+                # extra Windows-specific bytes
+                if lower_charset_name.startswith('iso-8859'):
+                    if self._has_win_bytes:
+                        charset_name = self.ISO_WIN_MAP.get(lower_charset_name,
+                                                            charset_name)
+                self.result = {'encoding': charset_name,
+                               'confidence': confidence,
+                               'language': max_prober.language}
+
+        # Log all prober confidences if none met MINIMUM_THRESHOLD
+        if self.logger.getEffectiveLevel() == logging.DEBUG:
+            if self.result['encoding'] is None:
+                self.logger.debug('no probers hit minimum threshold')
+                for group_prober in self._charset_probers:
+                    if not group_prober:
+                        continue
+                    if isinstance(group_prober, CharSetGroupProber):
+                        for prober in group_prober.probers:
+                            self.logger.debug('%s %s confidence = %s',
+                                              prober.charset_name,
+                                              prober.language,
+                                              prober.get_confidence())
+                    else:
+                        self.logger.debug('%s %s confidence = %s',
+                                          prober.charset_name,
+                                          prober.language,
+                                          prober.get_confidence())
+        return self.result
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/utf8prober.py b/venv/Lib/site-packages/pip/_vendor/chardet/utf8prober.py
new file mode 100644
index 000000000..6c3196cc2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/utf8prober.py
@@ -0,0 +1,82 @@
+######################## BEGIN LICENSE BLOCK ########################
+# The Original Code is mozilla.org code.
+#
+# The Initial Developer of the Original Code is
+# Netscape Communications Corporation.
+# Portions created by the Initial Developer are Copyright (C) 1998
+# the Initial Developer. All Rights Reserved.
+#
+# Contributor(s):
+#   Mark Pilgrim - port to Python
+#
+# This library is free software; you can redistribute it and/or
+# modify it under the terms of the GNU Lesser General Public
+# License as published by the Free Software Foundation; either
+# version 2.1 of the License, or (at your option) any later version.
+#
+# This library is distributed in the hope that it will be useful,
+# but WITHOUT ANY WARRANTY; without even the implied warranty of
+# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
+# Lesser General Public License for more details.
+#
+# You should have received a copy of the GNU Lesser General Public
+# License along with this library; if not, write to the Free Software
+# Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
+# 02110-1301  USA
+######################### END LICENSE BLOCK #########################
+
+from .charsetprober import CharSetProber
+from .enums import ProbingState, MachineState
+from .codingstatemachine import CodingStateMachine
+from .mbcssm import UTF8_SM_MODEL
+
+
+
+class UTF8Prober(CharSetProber):
+    ONE_CHAR_PROB = 0.5
+
+    def __init__(self):
+        super(UTF8Prober, self).__init__()
+        self.coding_sm = CodingStateMachine(UTF8_SM_MODEL)
+        self._num_mb_chars = None
+        self.reset()
+
+    def reset(self):
+        super(UTF8Prober, self).reset()
+        self.coding_sm.reset()
+        self._num_mb_chars = 0
+
+    @property
+    def charset_name(self):
+        return "utf-8"
+
+    @property
+    def language(self):
+        return ""
+
+    def feed(self, byte_str):
+        for c in byte_str:
+            coding_state = self.coding_sm.next_state(c)
+            if coding_state == MachineState.ERROR:
+                self._state = ProbingState.NOT_ME
+                break
+            elif coding_state == MachineState.ITS_ME:
+                self._state = ProbingState.FOUND_IT
+                break
+            elif coding_state == MachineState.START:
+                if self.coding_sm.get_current_charlen() >= 2:
+                    self._num_mb_chars += 1
+
+        if self.state == ProbingState.DETECTING:
+            if self.get_confidence() > self.SHORTCUT_THRESHOLD:
+                self._state = ProbingState.FOUND_IT
+
+        return self.state
+
+    def get_confidence(self):
+        unlike = 0.99
+        if self._num_mb_chars < 6:
+            unlike *= self.ONE_CHAR_PROB ** self._num_mb_chars
+            return 1.0 - unlike
+        else:
+            return unlike
diff --git a/venv/Lib/site-packages/pip/_vendor/chardet/version.py b/venv/Lib/site-packages/pip/_vendor/chardet/version.py
new file mode 100644
index 000000000..bb2a34a70
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/chardet/version.py
@@ -0,0 +1,9 @@
+"""
+This module exists only to simplify retrieving the version number of chardet
+from within setup.py and from chardet subpackages.
+
+:author: Dan Blanchard (dan.blanchard@gmail.com)
+"""
+
+__version__ = "3.0.4"
+VERSION = __version__.split('.')
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__init__.py b/venv/Lib/site-packages/pip/_vendor/colorama/__init__.py
new file mode 100644
index 000000000..34c263cc8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/__init__.py
@@ -0,0 +1,6 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+from .initialise import init, deinit, reinit, colorama_text
+from .ansi import Fore, Back, Style, Cursor
+from .ansitowin32 import AnsiToWin32
+
+__version__ = '0.4.3'
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..bd7b3a16b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc
new file mode 100644
index 000000000..3eb7d253a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansi.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc
new file mode 100644
index 000000000..2694c7c8c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/ansitowin32.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc
new file mode 100644
index 000000000..bbf69a625
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/initialise.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc
new file mode 100644
index 000000000..60e04c9e2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/win32.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc
new file mode 100644
index 000000000..10cd6662b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/colorama/__pycache__/winterm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/ansi.py b/venv/Lib/site-packages/pip/_vendor/colorama/ansi.py
new file mode 100644
index 000000000..78776588d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/ansi.py
@@ -0,0 +1,102 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+'''
+This module generates ANSI character codes to printing colors to terminals.
+See: http://en.wikipedia.org/wiki/ANSI_escape_code
+'''
+
+CSI = '\033['
+OSC = '\033]'
+BEL = '\007'
+
+
+def code_to_chars(code):
+    return CSI + str(code) + 'm'
+
+def set_title(title):
+    return OSC + '2;' + title + BEL
+
+def clear_screen(mode=2):
+    return CSI + str(mode) + 'J'
+
+def clear_line(mode=2):
+    return CSI + str(mode) + 'K'
+
+
+class AnsiCodes(object):
+    def __init__(self):
+        # the subclasses declare class attributes which are numbers.
+        # Upon instantiation we define instance attributes, which are the same
+        # as the class attributes but wrapped with the ANSI escape sequence
+        for name in dir(self):
+            if not name.startswith('_'):
+                value = getattr(self, name)
+                setattr(self, name, code_to_chars(value))
+
+
+class AnsiCursor(object):
+    def UP(self, n=1):
+        return CSI + str(n) + 'A'
+    def DOWN(self, n=1):
+        return CSI + str(n) + 'B'
+    def FORWARD(self, n=1):
+        return CSI + str(n) + 'C'
+    def BACK(self, n=1):
+        return CSI + str(n) + 'D'
+    def POS(self, x=1, y=1):
+        return CSI + str(y) + ';' + str(x) + 'H'
+
+
+class AnsiFore(AnsiCodes):
+    BLACK           = 30
+    RED             = 31
+    GREEN           = 32
+    YELLOW          = 33
+    BLUE            = 34
+    MAGENTA         = 35
+    CYAN            = 36
+    WHITE           = 37
+    RESET           = 39
+
+    # These are fairly well supported, but not part of the standard.
+    LIGHTBLACK_EX   = 90
+    LIGHTRED_EX     = 91
+    LIGHTGREEN_EX   = 92
+    LIGHTYELLOW_EX  = 93
+    LIGHTBLUE_EX    = 94
+    LIGHTMAGENTA_EX = 95
+    LIGHTCYAN_EX    = 96
+    LIGHTWHITE_EX   = 97
+
+
+class AnsiBack(AnsiCodes):
+    BLACK           = 40
+    RED             = 41
+    GREEN           = 42
+    YELLOW          = 43
+    BLUE            = 44
+    MAGENTA         = 45
+    CYAN            = 46
+    WHITE           = 47
+    RESET           = 49
+
+    # These are fairly well supported, but not part of the standard.
+    LIGHTBLACK_EX   = 100
+    LIGHTRED_EX     = 101
+    LIGHTGREEN_EX   = 102
+    LIGHTYELLOW_EX  = 103
+    LIGHTBLUE_EX    = 104
+    LIGHTMAGENTA_EX = 105
+    LIGHTCYAN_EX    = 106
+    LIGHTWHITE_EX   = 107
+
+
+class AnsiStyle(AnsiCodes):
+    BRIGHT    = 1
+    DIM       = 2
+    NORMAL    = 22
+    RESET_ALL = 0
+
+Fore   = AnsiFore()
+Back   = AnsiBack()
+Style  = AnsiStyle()
+Cursor = AnsiCursor()
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/ansitowin32.py b/venv/Lib/site-packages/pip/_vendor/colorama/ansitowin32.py
new file mode 100644
index 000000000..359c92be5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/ansitowin32.py
@@ -0,0 +1,257 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+import re
+import sys
+import os
+
+from .ansi import AnsiFore, AnsiBack, AnsiStyle, Style
+from .winterm import WinTerm, WinColor, WinStyle
+from .win32 import windll, winapi_test
+
+
+winterm = None
+if windll is not None:
+    winterm = WinTerm()
+
+
+class StreamWrapper(object):
+    '''
+    Wraps a stream (such as stdout), acting as a transparent proxy for all
+    attribute access apart from method 'write()', which is delegated to our
+    Converter instance.
+    '''
+    def __init__(self, wrapped, converter):
+        # double-underscore everything to prevent clashes with names of
+        # attributes on the wrapped stream object.
+        self.__wrapped = wrapped
+        self.__convertor = converter
+
+    def __getattr__(self, name):
+        return getattr(self.__wrapped, name)
+
+    def __enter__(self, *args, **kwargs):
+        # special method lookup bypasses __getattr__/__getattribute__, see
+        # https://stackoverflow.com/questions/12632894/why-doesnt-getattr-work-with-exit
+        # thus, contextlib magic methods are not proxied via __getattr__
+        return self.__wrapped.__enter__(*args, **kwargs)
+
+    def __exit__(self, *args, **kwargs):
+        return self.__wrapped.__exit__(*args, **kwargs)
+
+    def write(self, text):
+        self.__convertor.write(text)
+
+    def isatty(self):
+        stream = self.__wrapped
+        if 'PYCHARM_HOSTED' in os.environ:
+            if stream is not None and (stream is sys.__stdout__ or stream is sys.__stderr__):
+                return True
+        try:
+            stream_isatty = stream.isatty
+        except AttributeError:
+            return False
+        else:
+            return stream_isatty()
+
+    @property
+    def closed(self):
+        stream = self.__wrapped
+        try:
+            return stream.closed
+        except AttributeError:
+            return True
+
+
+class AnsiToWin32(object):
+    '''
+    Implements a 'write()' method which, on Windows, will strip ANSI character
+    sequences from the text, and if outputting to a tty, will convert them into
+    win32 function calls.
+    '''
+    ANSI_CSI_RE = re.compile('\001?\033\\[((?:\\d|;)*)([a-zA-Z])\002?')   # Control Sequence Introducer
+    ANSI_OSC_RE = re.compile('\001?\033\\]((?:.|;)*?)(\x07)\002?')        # Operating System Command
+
+    def __init__(self, wrapped, convert=None, strip=None, autoreset=False):
+        # The wrapped stream (normally sys.stdout or sys.stderr)
+        self.wrapped = wrapped
+
+        # should we reset colors to defaults after every .write()
+        self.autoreset = autoreset
+
+        # create the proxy wrapping our output stream
+        self.stream = StreamWrapper(wrapped, self)
+
+        on_windows = os.name == 'nt'
+        # We test if the WinAPI works, because even if we are on Windows
+        # we may be using a terminal that doesn't support the WinAPI
+        # (e.g. Cygwin Terminal). In this case it's up to the terminal
+        # to support the ANSI codes.
+        conversion_supported = on_windows and winapi_test()
+
+        # should we strip ANSI sequences from our output?
+        if strip is None:
+            strip = conversion_supported or (not self.stream.closed and not self.stream.isatty())
+        self.strip = strip
+
+        # should we should convert ANSI sequences into win32 calls?
+        if convert is None:
+            convert = conversion_supported and not self.stream.closed and self.stream.isatty()
+        self.convert = convert
+
+        # dict of ansi codes to win32 functions and parameters
+        self.win32_calls = self.get_win32_calls()
+
+        # are we wrapping stderr?
+        self.on_stderr = self.wrapped is sys.stderr
+
+    def should_wrap(self):
+        '''
+        True if this class is actually needed. If false, then the output
+        stream will not be affected, nor will win32 calls be issued, so
+        wrapping stdout is not actually required. This will generally be
+        False on non-Windows platforms, unless optional functionality like
+        autoreset has been requested using kwargs to init()
+        '''
+        return self.convert or self.strip or self.autoreset
+
+    def get_win32_calls(self):
+        if self.convert and winterm:
+            return {
+                AnsiStyle.RESET_ALL: (winterm.reset_all, ),
+                AnsiStyle.BRIGHT: (winterm.style, WinStyle.BRIGHT),
+                AnsiStyle.DIM: (winterm.style, WinStyle.NORMAL),
+                AnsiStyle.NORMAL: (winterm.style, WinStyle.NORMAL),
+                AnsiFore.BLACK: (winterm.fore, WinColor.BLACK),
+                AnsiFore.RED: (winterm.fore, WinColor.RED),
+                AnsiFore.GREEN: (winterm.fore, WinColor.GREEN),
+                AnsiFore.YELLOW: (winterm.fore, WinColor.YELLOW),
+                AnsiFore.BLUE: (winterm.fore, WinColor.BLUE),
+                AnsiFore.MAGENTA: (winterm.fore, WinColor.MAGENTA),
+                AnsiFore.CYAN: (winterm.fore, WinColor.CYAN),
+                AnsiFore.WHITE: (winterm.fore, WinColor.GREY),
+                AnsiFore.RESET: (winterm.fore, ),
+                AnsiFore.LIGHTBLACK_EX: (winterm.fore, WinColor.BLACK, True),
+                AnsiFore.LIGHTRED_EX: (winterm.fore, WinColor.RED, True),
+                AnsiFore.LIGHTGREEN_EX: (winterm.fore, WinColor.GREEN, True),
+                AnsiFore.LIGHTYELLOW_EX: (winterm.fore, WinColor.YELLOW, True),
+                AnsiFore.LIGHTBLUE_EX: (winterm.fore, WinColor.BLUE, True),
+                AnsiFore.LIGHTMAGENTA_EX: (winterm.fore, WinColor.MAGENTA, True),
+                AnsiFore.LIGHTCYAN_EX: (winterm.fore, WinColor.CYAN, True),
+                AnsiFore.LIGHTWHITE_EX: (winterm.fore, WinColor.GREY, True),
+                AnsiBack.BLACK: (winterm.back, WinColor.BLACK),
+                AnsiBack.RED: (winterm.back, WinColor.RED),
+                AnsiBack.GREEN: (winterm.back, WinColor.GREEN),
+                AnsiBack.YELLOW: (winterm.back, WinColor.YELLOW),
+                AnsiBack.BLUE: (winterm.back, WinColor.BLUE),
+                AnsiBack.MAGENTA: (winterm.back, WinColor.MAGENTA),
+                AnsiBack.CYAN: (winterm.back, WinColor.CYAN),
+                AnsiBack.WHITE: (winterm.back, WinColor.GREY),
+                AnsiBack.RESET: (winterm.back, ),
+                AnsiBack.LIGHTBLACK_EX: (winterm.back, WinColor.BLACK, True),
+                AnsiBack.LIGHTRED_EX: (winterm.back, WinColor.RED, True),
+                AnsiBack.LIGHTGREEN_EX: (winterm.back, WinColor.GREEN, True),
+                AnsiBack.LIGHTYELLOW_EX: (winterm.back, WinColor.YELLOW, True),
+                AnsiBack.LIGHTBLUE_EX: (winterm.back, WinColor.BLUE, True),
+                AnsiBack.LIGHTMAGENTA_EX: (winterm.back, WinColor.MAGENTA, True),
+                AnsiBack.LIGHTCYAN_EX: (winterm.back, WinColor.CYAN, True),
+                AnsiBack.LIGHTWHITE_EX: (winterm.back, WinColor.GREY, True),
+            }
+        return dict()
+
+    def write(self, text):
+        if self.strip or self.convert:
+            self.write_and_convert(text)
+        else:
+            self.wrapped.write(text)
+            self.wrapped.flush()
+        if self.autoreset:
+            self.reset_all()
+
+
+    def reset_all(self):
+        if self.convert:
+            self.call_win32('m', (0,))
+        elif not self.strip and not self.stream.closed:
+            self.wrapped.write(Style.RESET_ALL)
+
+
+    def write_and_convert(self, text):
+        '''
+        Write the given text to our wrapped stream, stripping any ANSI
+        sequences from the text, and optionally converting them into win32
+        calls.
+        '''
+        cursor = 0
+        text = self.convert_osc(text)
+        for match in self.ANSI_CSI_RE.finditer(text):
+            start, end = match.span()
+            self.write_plain_text(text, cursor, start)
+            self.convert_ansi(*match.groups())
+            cursor = end
+        self.write_plain_text(text, cursor, len(text))
+
+
+    def write_plain_text(self, text, start, end):
+        if start < end:
+            self.wrapped.write(text[start:end])
+            self.wrapped.flush()
+
+
+    def convert_ansi(self, paramstring, command):
+        if self.convert:
+            params = self.extract_params(command, paramstring)
+            self.call_win32(command, params)
+
+
+    def extract_params(self, command, paramstring):
+        if command in 'Hf':
+            params = tuple(int(p) if len(p) != 0 else 1 for p in paramstring.split(';'))
+            while len(params) < 2:
+                # defaults:
+                params = params + (1,)
+        else:
+            params = tuple(int(p) for p in paramstring.split(';') if len(p) != 0)
+            if len(params) == 0:
+                # defaults:
+                if command in 'JKm':
+                    params = (0,)
+                elif command in 'ABCD':
+                    params = (1,)
+
+        return params
+
+
+    def call_win32(self, command, params):
+        if command == 'm':
+            for param in params:
+                if param in self.win32_calls:
+                    func_args = self.win32_calls[param]
+                    func = func_args[0]
+                    args = func_args[1:]
+                    kwargs = dict(on_stderr=self.on_stderr)
+                    func(*args, **kwargs)
+        elif command in 'J':
+            winterm.erase_screen(params[0], on_stderr=self.on_stderr)
+        elif command in 'K':
+            winterm.erase_line(params[0], on_stderr=self.on_stderr)
+        elif command in 'Hf':     # cursor position - absolute
+            winterm.set_cursor_position(params, on_stderr=self.on_stderr)
+        elif command in 'ABCD':   # cursor position - relative
+            n = params[0]
+            # A - up, B - down, C - forward, D - back
+            x, y = {'A': (0, -n), 'B': (0, n), 'C': (n, 0), 'D': (-n, 0)}[command]
+            winterm.cursor_adjust(x, y, on_stderr=self.on_stderr)
+
+
+    def convert_osc(self, text):
+        for match in self.ANSI_OSC_RE.finditer(text):
+            start, end = match.span()
+            text = text[:start] + text[end:]
+            paramstring, command = match.groups()
+            if command in '\x07':       # \x07 = BEL
+                params = paramstring.split(";")
+                # 0 - change title and icon (we will only change title)
+                # 1 - change icon (we don't support this)
+                # 2 - change title
+                if params[0] in '02':
+                    winterm.set_title(params[1])
+        return text
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/initialise.py b/venv/Lib/site-packages/pip/_vendor/colorama/initialise.py
new file mode 100644
index 000000000..430d06687
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/initialise.py
@@ -0,0 +1,80 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+import atexit
+import contextlib
+import sys
+
+from .ansitowin32 import AnsiToWin32
+
+
+orig_stdout = None
+orig_stderr = None
+
+wrapped_stdout = None
+wrapped_stderr = None
+
+atexit_done = False
+
+
+def reset_all():
+    if AnsiToWin32 is not None:    # Issue #74: objects might become None at exit
+        AnsiToWin32(orig_stdout).reset_all()
+
+
+def init(autoreset=False, convert=None, strip=None, wrap=True):
+
+    if not wrap and any([autoreset, convert, strip]):
+        raise ValueError('wrap=False conflicts with any other arg=True')
+
+    global wrapped_stdout, wrapped_stderr
+    global orig_stdout, orig_stderr
+
+    orig_stdout = sys.stdout
+    orig_stderr = sys.stderr
+
+    if sys.stdout is None:
+        wrapped_stdout = None
+    else:
+        sys.stdout = wrapped_stdout = \
+            wrap_stream(orig_stdout, convert, strip, autoreset, wrap)
+    if sys.stderr is None:
+        wrapped_stderr = None
+    else:
+        sys.stderr = wrapped_stderr = \
+            wrap_stream(orig_stderr, convert, strip, autoreset, wrap)
+
+    global atexit_done
+    if not atexit_done:
+        atexit.register(reset_all)
+        atexit_done = True
+
+
+def deinit():
+    if orig_stdout is not None:
+        sys.stdout = orig_stdout
+    if orig_stderr is not None:
+        sys.stderr = orig_stderr
+
+
+@contextlib.contextmanager
+def colorama_text(*args, **kwargs):
+    init(*args, **kwargs)
+    try:
+        yield
+    finally:
+        deinit()
+
+
+def reinit():
+    if wrapped_stdout is not None:
+        sys.stdout = wrapped_stdout
+    if wrapped_stderr is not None:
+        sys.stderr = wrapped_stderr
+
+
+def wrap_stream(stream, convert, strip, autoreset, wrap):
+    if wrap:
+        wrapper = AnsiToWin32(stream,
+            convert=convert, strip=strip, autoreset=autoreset)
+        if wrapper.should_wrap():
+            stream = wrapper.stream
+    return stream
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/win32.py b/venv/Lib/site-packages/pip/_vendor/colorama/win32.py
new file mode 100644
index 000000000..c2d836033
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/win32.py
@@ -0,0 +1,152 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+
+# from winbase.h
+STDOUT = -11
+STDERR = -12
+
+try:
+    import ctypes
+    from ctypes import LibraryLoader
+    windll = LibraryLoader(ctypes.WinDLL)
+    from ctypes import wintypes
+except (AttributeError, ImportError):
+    windll = None
+    SetConsoleTextAttribute = lambda *_: None
+    winapi_test = lambda *_: None
+else:
+    from ctypes import byref, Structure, c_char, POINTER
+
+    COORD = wintypes._COORD
+
+    class CONSOLE_SCREEN_BUFFER_INFO(Structure):
+        """struct in wincon.h."""
+        _fields_ = [
+            ("dwSize", COORD),
+            ("dwCursorPosition", COORD),
+            ("wAttributes", wintypes.WORD),
+            ("srWindow", wintypes.SMALL_RECT),
+            ("dwMaximumWindowSize", COORD),
+        ]
+        def __str__(self):
+            return '(%d,%d,%d,%d,%d,%d,%d,%d,%d,%d,%d)' % (
+                self.dwSize.Y, self.dwSize.X
+                , self.dwCursorPosition.Y, self.dwCursorPosition.X
+                , self.wAttributes
+                , self.srWindow.Top, self.srWindow.Left, self.srWindow.Bottom, self.srWindow.Right
+                , self.dwMaximumWindowSize.Y, self.dwMaximumWindowSize.X
+            )
+
+    _GetStdHandle = windll.kernel32.GetStdHandle
+    _GetStdHandle.argtypes = [
+        wintypes.DWORD,
+    ]
+    _GetStdHandle.restype = wintypes.HANDLE
+
+    _GetConsoleScreenBufferInfo = windll.kernel32.GetConsoleScreenBufferInfo
+    _GetConsoleScreenBufferInfo.argtypes = [
+        wintypes.HANDLE,
+        POINTER(CONSOLE_SCREEN_BUFFER_INFO),
+    ]
+    _GetConsoleScreenBufferInfo.restype = wintypes.BOOL
+
+    _SetConsoleTextAttribute = windll.kernel32.SetConsoleTextAttribute
+    _SetConsoleTextAttribute.argtypes = [
+        wintypes.HANDLE,
+        wintypes.WORD,
+    ]
+    _SetConsoleTextAttribute.restype = wintypes.BOOL
+
+    _SetConsoleCursorPosition = windll.kernel32.SetConsoleCursorPosition
+    _SetConsoleCursorPosition.argtypes = [
+        wintypes.HANDLE,
+        COORD,
+    ]
+    _SetConsoleCursorPosition.restype = wintypes.BOOL
+
+    _FillConsoleOutputCharacterA = windll.kernel32.FillConsoleOutputCharacterA
+    _FillConsoleOutputCharacterA.argtypes = [
+        wintypes.HANDLE,
+        c_char,
+        wintypes.DWORD,
+        COORD,
+        POINTER(wintypes.DWORD),
+    ]
+    _FillConsoleOutputCharacterA.restype = wintypes.BOOL
+
+    _FillConsoleOutputAttribute = windll.kernel32.FillConsoleOutputAttribute
+    _FillConsoleOutputAttribute.argtypes = [
+        wintypes.HANDLE,
+        wintypes.WORD,
+        wintypes.DWORD,
+        COORD,
+        POINTER(wintypes.DWORD),
+    ]
+    _FillConsoleOutputAttribute.restype = wintypes.BOOL
+
+    _SetConsoleTitleW = windll.kernel32.SetConsoleTitleW
+    _SetConsoleTitleW.argtypes = [
+        wintypes.LPCWSTR
+    ]
+    _SetConsoleTitleW.restype = wintypes.BOOL
+
+    def _winapi_test(handle):
+        csbi = CONSOLE_SCREEN_BUFFER_INFO()
+        success = _GetConsoleScreenBufferInfo(
+            handle, byref(csbi))
+        return bool(success)
+
+    def winapi_test():
+        return any(_winapi_test(h) for h in
+                   (_GetStdHandle(STDOUT), _GetStdHandle(STDERR)))
+
+    def GetConsoleScreenBufferInfo(stream_id=STDOUT):
+        handle = _GetStdHandle(stream_id)
+        csbi = CONSOLE_SCREEN_BUFFER_INFO()
+        success = _GetConsoleScreenBufferInfo(
+            handle, byref(csbi))
+        return csbi
+
+    def SetConsoleTextAttribute(stream_id, attrs):
+        handle = _GetStdHandle(stream_id)
+        return _SetConsoleTextAttribute(handle, attrs)
+
+    def SetConsoleCursorPosition(stream_id, position, adjust=True):
+        position = COORD(*position)
+        # If the position is out of range, do nothing.
+        if position.Y <= 0 or position.X <= 0:
+            return
+        # Adjust for Windows' SetConsoleCursorPosition:
+        #    1. being 0-based, while ANSI is 1-based.
+        #    2. expecting (x,y), while ANSI uses (y,x).
+        adjusted_position = COORD(position.Y - 1, position.X - 1)
+        if adjust:
+            # Adjust for viewport's scroll position
+            sr = GetConsoleScreenBufferInfo(STDOUT).srWindow
+            adjusted_position.Y += sr.Top
+            adjusted_position.X += sr.Left
+        # Resume normal processing
+        handle = _GetStdHandle(stream_id)
+        return _SetConsoleCursorPosition(handle, adjusted_position)
+
+    def FillConsoleOutputCharacter(stream_id, char, length, start):
+        handle = _GetStdHandle(stream_id)
+        char = c_char(char.encode())
+        length = wintypes.DWORD(length)
+        num_written = wintypes.DWORD(0)
+        # Note that this is hard-coded for ANSI (vs wide) bytes.
+        success = _FillConsoleOutputCharacterA(
+            handle, char, length, start, byref(num_written))
+        return num_written.value
+
+    def FillConsoleOutputAttribute(stream_id, attr, length, start):
+        ''' FillConsoleOutputAttribute( hConsole, csbi.wAttributes, dwConSize, coordScreen, &cCharsWritten )'''
+        handle = _GetStdHandle(stream_id)
+        attribute = wintypes.WORD(attr)
+        length = wintypes.DWORD(length)
+        num_written = wintypes.DWORD(0)
+        # Note that this is hard-coded for ANSI (vs wide) bytes.
+        return _FillConsoleOutputAttribute(
+            handle, attribute, length, start, byref(num_written))
+
+    def SetConsoleTitle(title):
+        return _SetConsoleTitleW(title)
diff --git a/venv/Lib/site-packages/pip/_vendor/colorama/winterm.py b/venv/Lib/site-packages/pip/_vendor/colorama/winterm.py
new file mode 100644
index 000000000..0fdb4ec4e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/colorama/winterm.py
@@ -0,0 +1,169 @@
+# Copyright Jonathan Hartley 2013. BSD 3-Clause license, see LICENSE file.
+from . import win32
+
+
+# from wincon.h
+class WinColor(object):
+    BLACK   = 0
+    BLUE    = 1
+    GREEN   = 2
+    CYAN    = 3
+    RED     = 4
+    MAGENTA = 5
+    YELLOW  = 6
+    GREY    = 7
+
+# from wincon.h
+class WinStyle(object):
+    NORMAL              = 0x00 # dim text, dim background
+    BRIGHT              = 0x08 # bright text, dim background
+    BRIGHT_BACKGROUND   = 0x80 # dim text, bright background
+
+class WinTerm(object):
+
+    def __init__(self):
+        self._default = win32.GetConsoleScreenBufferInfo(win32.STDOUT).wAttributes
+        self.set_attrs(self._default)
+        self._default_fore = self._fore
+        self._default_back = self._back
+        self._default_style = self._style
+        # In order to emulate LIGHT_EX in windows, we borrow the BRIGHT style.
+        # So that LIGHT_EX colors and BRIGHT style do not clobber each other,
+        # we track them separately, since LIGHT_EX is overwritten by Fore/Back
+        # and BRIGHT is overwritten by Style codes.
+        self._light = 0
+
+    def get_attrs(self):
+        return self._fore + self._back * 16 + (self._style | self._light)
+
+    def set_attrs(self, value):
+        self._fore = value & 7
+        self._back = (value >> 4) & 7
+        self._style = value & (WinStyle.BRIGHT | WinStyle.BRIGHT_BACKGROUND)
+
+    def reset_all(self, on_stderr=None):
+        self.set_attrs(self._default)
+        self.set_console(attrs=self._default)
+        self._light = 0
+
+    def fore(self, fore=None, light=False, on_stderr=False):
+        if fore is None:
+            fore = self._default_fore
+        self._fore = fore
+        # Emulate LIGHT_EX with BRIGHT Style
+        if light:
+            self._light |= WinStyle.BRIGHT
+        else:
+            self._light &= ~WinStyle.BRIGHT
+        self.set_console(on_stderr=on_stderr)
+
+    def back(self, back=None, light=False, on_stderr=False):
+        if back is None:
+            back = self._default_back
+        self._back = back
+        # Emulate LIGHT_EX with BRIGHT_BACKGROUND Style
+        if light:
+            self._light |= WinStyle.BRIGHT_BACKGROUND
+        else:
+            self._light &= ~WinStyle.BRIGHT_BACKGROUND
+        self.set_console(on_stderr=on_stderr)
+
+    def style(self, style=None, on_stderr=False):
+        if style is None:
+            style = self._default_style
+        self._style = style
+        self.set_console(on_stderr=on_stderr)
+
+    def set_console(self, attrs=None, on_stderr=False):
+        if attrs is None:
+            attrs = self.get_attrs()
+        handle = win32.STDOUT
+        if on_stderr:
+            handle = win32.STDERR
+        win32.SetConsoleTextAttribute(handle, attrs)
+
+    def get_position(self, handle):
+        position = win32.GetConsoleScreenBufferInfo(handle).dwCursorPosition
+        # Because Windows coordinates are 0-based,
+        # and win32.SetConsoleCursorPosition expects 1-based.
+        position.X += 1
+        position.Y += 1
+        return position
+
+    def set_cursor_position(self, position=None, on_stderr=False):
+        if position is None:
+            # I'm not currently tracking the position, so there is no default.
+            # position = self.get_position()
+            return
+        handle = win32.STDOUT
+        if on_stderr:
+            handle = win32.STDERR
+        win32.SetConsoleCursorPosition(handle, position)
+
+    def cursor_adjust(self, x, y, on_stderr=False):
+        handle = win32.STDOUT
+        if on_stderr:
+            handle = win32.STDERR
+        position = self.get_position(handle)
+        adjusted_position = (position.Y + y, position.X + x)
+        win32.SetConsoleCursorPosition(handle, adjusted_position, adjust=False)
+
+    def erase_screen(self, mode=0, on_stderr=False):
+        # 0 should clear from the cursor to the end of the screen.
+        # 1 should clear from the cursor to the beginning of the screen.
+        # 2 should clear the entire screen, and move cursor to (1,1)
+        handle = win32.STDOUT
+        if on_stderr:
+            handle = win32.STDERR
+        csbi = win32.GetConsoleScreenBufferInfo(handle)
+        # get the number of character cells in the current buffer
+        cells_in_screen = csbi.dwSize.X * csbi.dwSize.Y
+        # get number of character cells before current cursor position
+        cells_before_cursor = csbi.dwSize.X * csbi.dwCursorPosition.Y + csbi.dwCursorPosition.X
+        if mode == 0:
+            from_coord = csbi.dwCursorPosition
+            cells_to_erase = cells_in_screen - cells_before_cursor
+        elif mode == 1:
+            from_coord = win32.COORD(0, 0)
+            cells_to_erase = cells_before_cursor
+        elif mode == 2:
+            from_coord = win32.COORD(0, 0)
+            cells_to_erase = cells_in_screen
+        else:
+            # invalid mode
+            return
+        # fill the entire screen with blanks
+        win32.FillConsoleOutputCharacter(handle, ' ', cells_to_erase, from_coord)
+        # now set the buffer's attributes accordingly
+        win32.FillConsoleOutputAttribute(handle, self.get_attrs(), cells_to_erase, from_coord)
+        if mode == 2:
+            # put the cursor where needed
+            win32.SetConsoleCursorPosition(handle, (1, 1))
+
+    def erase_line(self, mode=0, on_stderr=False):
+        # 0 should clear from the cursor to the end of the line.
+        # 1 should clear from the cursor to the beginning of the line.
+        # 2 should clear the entire line.
+        handle = win32.STDOUT
+        if on_stderr:
+            handle = win32.STDERR
+        csbi = win32.GetConsoleScreenBufferInfo(handle)
+        if mode == 0:
+            from_coord = csbi.dwCursorPosition
+            cells_to_erase = csbi.dwSize.X - csbi.dwCursorPosition.X
+        elif mode == 1:
+            from_coord = win32.COORD(0, csbi.dwCursorPosition.Y)
+            cells_to_erase = csbi.dwCursorPosition.X
+        elif mode == 2:
+            from_coord = win32.COORD(0, csbi.dwCursorPosition.Y)
+            cells_to_erase = csbi.dwSize.X
+        else:
+            # invalid mode
+            return
+        # fill the entire screen with blanks
+        win32.FillConsoleOutputCharacter(handle, ' ', cells_to_erase, from_coord)
+        # now set the buffer's attributes accordingly
+        win32.FillConsoleOutputAttribute(handle, self.get_attrs(), cells_to_erase, from_coord)
+
+    def set_title(self, title):
+        win32.SetConsoleTitle(title)
diff --git a/venv/Lib/site-packages/pip/_vendor/contextlib2.py b/venv/Lib/site-packages/pip/_vendor/contextlib2.py
new file mode 100644
index 000000000..3aae8f411
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/contextlib2.py
@@ -0,0 +1,518 @@
+"""contextlib2 - backports and enhancements to the contextlib module"""
+
+import abc
+import sys
+import warnings
+from collections import deque
+from functools import wraps
+
+__all__ = ["contextmanager", "closing", "nullcontext",
+           "AbstractContextManager",
+           "ContextDecorator", "ExitStack",
+           "redirect_stdout", "redirect_stderr", "suppress"]
+
+# Backwards compatibility
+__all__ += ["ContextStack"]
+
+
+# Backport abc.ABC
+if sys.version_info[:2] >= (3, 4):
+    _abc_ABC = abc.ABC
+else:
+    _abc_ABC = abc.ABCMeta('ABC', (object,), {'__slots__': ()})
+
+
+# Backport classic class MRO
+def _classic_mro(C, result):
+    if C in result:
+        return
+    result.append(C)
+    for B in C.__bases__:
+        _classic_mro(B, result)
+    return result
+
+
+# Backport _collections_abc._check_methods
+def _check_methods(C, *methods):
+    try:
+        mro = C.__mro__
+    except AttributeError:
+        mro = tuple(_classic_mro(C, []))
+
+    for method in methods:
+        for B in mro:
+            if method in B.__dict__:
+                if B.__dict__[method] is None:
+                    return NotImplemented
+                break
+        else:
+            return NotImplemented
+    return True
+
+
+class AbstractContextManager(_abc_ABC):
+    """An abstract base class for context managers."""
+
+    def __enter__(self):
+        """Return `self` upon entering the runtime context."""
+        return self
+
+    @abc.abstractmethod
+    def __exit__(self, exc_type, exc_value, traceback):
+        """Raise any exception triggered within the runtime context."""
+        return None
+
+    @classmethod
+    def __subclasshook__(cls, C):
+        """Check whether subclass is considered a subclass of this ABC."""
+        if cls is AbstractContextManager:
+            return _check_methods(C, "__enter__", "__exit__")
+        return NotImplemented
+
+
+class ContextDecorator(object):
+    """A base class or mixin that enables context managers to work as decorators."""
+
+    def refresh_cm(self):
+        """Returns the context manager used to actually wrap the call to the
+        decorated function.
+
+        The default implementation just returns *self*.
+
+        Overriding this method allows otherwise one-shot context managers
+        like _GeneratorContextManager to support use as decorators via
+        implicit recreation.
+
+        DEPRECATED: refresh_cm was never added to the standard library's
+                    ContextDecorator API
+        """
+        warnings.warn("refresh_cm was never added to the standard library",
+                      DeprecationWarning)
+        return self._recreate_cm()
+
+    def _recreate_cm(self):
+        """Return a recreated instance of self.
+
+        Allows an otherwise one-shot context manager like
+        _GeneratorContextManager to support use as
+        a decorator via implicit recreation.
+
+        This is a private interface just for _GeneratorContextManager.
+        See issue #11647 for details.
+        """
+        return self
+
+    def __call__(self, func):
+        @wraps(func)
+        def inner(*args, **kwds):
+            with self._recreate_cm():
+                return func(*args, **kwds)
+        return inner
+
+
+class _GeneratorContextManager(ContextDecorator):
+    """Helper for @contextmanager decorator."""
+
+    def __init__(self, func, args, kwds):
+        self.gen = func(*args, **kwds)
+        self.func, self.args, self.kwds = func, args, kwds
+        # Issue 19330: ensure context manager instances have good docstrings
+        doc = getattr(func, "__doc__", None)
+        if doc is None:
+            doc = type(self).__doc__
+        self.__doc__ = doc
+        # Unfortunately, this still doesn't provide good help output when
+        # inspecting the created context manager instances, since pydoc
+        # currently bypasses the instance docstring and shows the docstring
+        # for the class instead.
+        # See http://bugs.python.org/issue19404 for more details.
+
+    def _recreate_cm(self):
+        # _GCM instances are one-shot context managers, so the
+        # CM must be recreated each time a decorated function is
+        # called
+        return self.__class__(self.func, self.args, self.kwds)
+
+    def __enter__(self):
+        try:
+            return next(self.gen)
+        except StopIteration:
+            raise RuntimeError("generator didn't yield")
+
+    def __exit__(self, type, value, traceback):
+        if type is None:
+            try:
+                next(self.gen)
+            except StopIteration:
+                return
+            else:
+                raise RuntimeError("generator didn't stop")
+        else:
+            if value is None:
+                # Need to force instantiation so we can reliably
+                # tell if we get the same exception back
+                value = type()
+            try:
+                self.gen.throw(type, value, traceback)
+                raise RuntimeError("generator didn't stop after throw()")
+            except StopIteration as exc:
+                # Suppress StopIteration *unless* it's the same exception that
+                # was passed to throw().  This prevents a StopIteration
+                # raised inside the "with" statement from being suppressed.
+                return exc is not value
+            except RuntimeError as exc:
+                # Don't re-raise the passed in exception
+                if exc is value:
+                    return False
+                # Likewise, avoid suppressing if a StopIteration exception
+                # was passed to throw() and later wrapped into a RuntimeError
+                # (see PEP 479).
+                if _HAVE_EXCEPTION_CHAINING and exc.__cause__ is value:
+                    return False
+                raise
+            except:
+                # only re-raise if it's *not* the exception that was
+                # passed to throw(), because __exit__() must not raise
+                # an exception unless __exit__() itself failed.  But throw()
+                # has to raise the exception to signal propagation, so this
+                # fixes the impedance mismatch between the throw() protocol
+                # and the __exit__() protocol.
+                #
+                if sys.exc_info()[1] is not value:
+                    raise
+
+
+def contextmanager(func):
+    """@contextmanager decorator.
+
+    Typical usage:
+
+        @contextmanager
+        def some_generator(<arguments>):
+            <setup>
+            try:
+                yield <value>
+            finally:
+                <cleanup>
+
+    This makes this:
+
+        with some_generator(<arguments>) as <variable>:
+            <body>
+
+    equivalent to this:
+
+        <setup>
+        try:
+            <variable> = <value>
+            <body>
+        finally:
+            <cleanup>
+
+    """
+    @wraps(func)
+    def helper(*args, **kwds):
+        return _GeneratorContextManager(func, args, kwds)
+    return helper
+
+
+class closing(object):
+    """Context to automatically close something at the end of a block.
+
+    Code like this:
+
+        with closing(<module>.open(<arguments>)) as f:
+            <block>
+
+    is equivalent to this:
+
+        f = <module>.open(<arguments>)
+        try:
+            <block>
+        finally:
+            f.close()
+
+    """
+    def __init__(self, thing):
+        self.thing = thing
+
+    def __enter__(self):
+        return self.thing
+
+    def __exit__(self, *exc_info):
+        self.thing.close()
+
+
+class _RedirectStream(object):
+
+    _stream = None
+
+    def __init__(self, new_target):
+        self._new_target = new_target
+        # We use a list of old targets to make this CM re-entrant
+        self._old_targets = []
+
+    def __enter__(self):
+        self._old_targets.append(getattr(sys, self._stream))
+        setattr(sys, self._stream, self._new_target)
+        return self._new_target
+
+    def __exit__(self, exctype, excinst, exctb):
+        setattr(sys, self._stream, self._old_targets.pop())
+
+
+class redirect_stdout(_RedirectStream):
+    """Context manager for temporarily redirecting stdout to another file.
+
+        # How to send help() to stderr
+        with redirect_stdout(sys.stderr):
+            help(dir)
+
+        # How to write help() to a file
+        with open('help.txt', 'w') as f:
+            with redirect_stdout(f):
+                help(pow)
+    """
+
+    _stream = "stdout"
+
+
+class redirect_stderr(_RedirectStream):
+    """Context manager for temporarily redirecting stderr to another file."""
+
+    _stream = "stderr"
+
+
+class suppress(object):
+    """Context manager to suppress specified exceptions
+
+    After the exception is suppressed, execution proceeds with the next
+    statement following the with statement.
+
+         with suppress(FileNotFoundError):
+             os.remove(somefile)
+         # Execution still resumes here if the file was already removed
+    """
+
+    def __init__(self, *exceptions):
+        self._exceptions = exceptions
+
+    def __enter__(self):
+        pass
+
+    def __exit__(self, exctype, excinst, exctb):
+        # Unlike isinstance and issubclass, CPython exception handling
+        # currently only looks at the concrete type hierarchy (ignoring
+        # the instance and subclass checking hooks). While Guido considers
+        # that a bug rather than a feature, it's a fairly hard one to fix
+        # due to various internal implementation details. suppress provides
+        # the simpler issubclass based semantics, rather than trying to
+        # exactly reproduce the limitations of the CPython interpreter.
+        #
+        # See http://bugs.python.org/issue12029 for more details
+        return exctype is not None and issubclass(exctype, self._exceptions)
+
+
+# Context manipulation is Python 3 only
+_HAVE_EXCEPTION_CHAINING = sys.version_info[0] >= 3
+if _HAVE_EXCEPTION_CHAINING:
+    def _make_context_fixer(frame_exc):
+        def _fix_exception_context(new_exc, old_exc):
+            # Context may not be correct, so find the end of the chain
+            while 1:
+                exc_context = new_exc.__context__
+                if exc_context is old_exc:
+                    # Context is already set correctly (see issue 20317)
+                    return
+                if exc_context is None or exc_context is frame_exc:
+                    break
+                new_exc = exc_context
+            # Change the end of the chain to point to the exception
+            # we expect it to reference
+            new_exc.__context__ = old_exc
+        return _fix_exception_context
+
+    def _reraise_with_existing_context(exc_details):
+        try:
+            # bare "raise exc_details[1]" replaces our carefully
+            # set-up context
+            fixed_ctx = exc_details[1].__context__
+            raise exc_details[1]
+        except BaseException:
+            exc_details[1].__context__ = fixed_ctx
+            raise
+else:
+    # No exception context in Python 2
+    def _make_context_fixer(frame_exc):
+        return lambda new_exc, old_exc: None
+
+    # Use 3 argument raise in Python 2,
+    # but use exec to avoid SyntaxError in Python 3
+    def _reraise_with_existing_context(exc_details):
+        exc_type, exc_value, exc_tb = exc_details
+        exec("raise exc_type, exc_value, exc_tb")
+
+# Handle old-style classes if they exist
+try:
+    from types import InstanceType
+except ImportError:
+    # Python 3 doesn't have old-style classes
+    _get_type = type
+else:
+    # Need to handle old-style context managers on Python 2
+    def _get_type(obj):
+        obj_type = type(obj)
+        if obj_type is InstanceType:
+            return obj.__class__  # Old-style class
+        return obj_type  # New-style class
+
+
+# Inspired by discussions on http://bugs.python.org/issue13585
+class ExitStack(object):
+    """Context manager for dynamic management of a stack of exit callbacks
+
+    For example:
+
+        with ExitStack() as stack:
+            files = [stack.enter_context(open(fname)) for fname in filenames]
+            # All opened files will automatically be closed at the end of
+            # the with statement, even if attempts to open files later
+            # in the list raise an exception
+
+    """
+    def __init__(self):
+        self._exit_callbacks = deque()
+
+    def pop_all(self):
+        """Preserve the context stack by transferring it to a new instance"""
+        new_stack = type(self)()
+        new_stack._exit_callbacks = self._exit_callbacks
+        self._exit_callbacks = deque()
+        return new_stack
+
+    def _push_cm_exit(self, cm, cm_exit):
+        """Helper to correctly register callbacks to __exit__ methods"""
+        def _exit_wrapper(*exc_details):
+            return cm_exit(cm, *exc_details)
+        _exit_wrapper.__self__ = cm
+        self.push(_exit_wrapper)
+
+    def push(self, exit):
+        """Registers a callback with the standard __exit__ method signature
+
+        Can suppress exceptions the same way __exit__ methods can.
+
+        Also accepts any object with an __exit__ method (registering a call
+        to the method instead of the object itself)
+        """
+        # We use an unbound method rather than a bound method to follow
+        # the standard lookup behaviour for special methods
+        _cb_type = _get_type(exit)
+        try:
+            exit_method = _cb_type.__exit__
+        except AttributeError:
+            # Not a context manager, so assume its a callable
+            self._exit_callbacks.append(exit)
+        else:
+            self._push_cm_exit(exit, exit_method)
+        return exit # Allow use as a decorator
+
+    def callback(self, callback, *args, **kwds):
+        """Registers an arbitrary callback and arguments.
+
+        Cannot suppress exceptions.
+        """
+        def _exit_wrapper(exc_type, exc, tb):
+            callback(*args, **kwds)
+        # We changed the signature, so using @wraps is not appropriate, but
+        # setting __wrapped__ may still help with introspection
+        _exit_wrapper.__wrapped__ = callback
+        self.push(_exit_wrapper)
+        return callback # Allow use as a decorator
+
+    def enter_context(self, cm):
+        """Enters the supplied context manager
+
+        If successful, also pushes its __exit__ method as a callback and
+        returns the result of the __enter__ method.
+        """
+        # We look up the special methods on the type to match the with statement
+        _cm_type = _get_type(cm)
+        _exit = _cm_type.__exit__
+        result = _cm_type.__enter__(cm)
+        self._push_cm_exit(cm, _exit)
+        return result
+
+    def close(self):
+        """Immediately unwind the context stack"""
+        self.__exit__(None, None, None)
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, *exc_details):
+        received_exc = exc_details[0] is not None
+
+        # We manipulate the exception state so it behaves as though
+        # we were actually nesting multiple with statements
+        frame_exc = sys.exc_info()[1]
+        _fix_exception_context = _make_context_fixer(frame_exc)
+
+        # Callbacks are invoked in LIFO order to match the behaviour of
+        # nested context managers
+        suppressed_exc = False
+        pending_raise = False
+        while self._exit_callbacks:
+            cb = self._exit_callbacks.pop()
+            try:
+                if cb(*exc_details):
+                    suppressed_exc = True
+                    pending_raise = False
+                    exc_details = (None, None, None)
+            except:
+                new_exc_details = sys.exc_info()
+                # simulate the stack of exceptions by setting the context
+                _fix_exception_context(new_exc_details[1], exc_details[1])
+                pending_raise = True
+                exc_details = new_exc_details
+        if pending_raise:
+            _reraise_with_existing_context(exc_details)
+        return received_exc and suppressed_exc
+
+
+# Preserve backwards compatibility
+class ContextStack(ExitStack):
+    """Backwards compatibility alias for ExitStack"""
+
+    def __init__(self):
+        warnings.warn("ContextStack has been renamed to ExitStack",
+                      DeprecationWarning)
+        super(ContextStack, self).__init__()
+
+    def register_exit(self, callback):
+        return self.push(callback)
+
+    def register(self, callback, *args, **kwds):
+        return self.callback(callback, *args, **kwds)
+
+    def preserve(self):
+        return self.pop_all()
+
+
+class nullcontext(AbstractContextManager):
+    """Context manager that does no additional processing.
+    Used as a stand-in for a normal context manager, when a particular
+    block of code is only sometimes used with a normal context manager:
+    cm = optional_cm if condition else nullcontext()
+    with cm:
+        # Perform operation, using optional_cm if condition is True
+    """
+
+    def __init__(self, enter_result=None):
+        self.enter_result = enter_result
+
+    def __enter__(self):
+        return self.enter_result
+
+    def __exit__(self, *excinfo):
+        pass
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__init__.py b/venv/Lib/site-packages/pip/_vendor/distlib/__init__.py
new file mode 100644
index 000000000..63d916e34
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/__init__.py
@@ -0,0 +1,23 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2019 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+import logging
+
+__version__ = '0.3.1'
+
+class DistlibException(Exception):
+    pass
+
+try:
+    from logging import NullHandler
+except ImportError: # pragma: no cover
+    class NullHandler(logging.Handler):
+        def handle(self, record): pass
+        def emit(self, record): pass
+        def createLock(self): self.lock = None
+
+logger = logging.getLogger(__name__)
+logger.addHandler(NullHandler())
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..e9918ab7e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..2f692fa94
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/database.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/database.cpython-36.pyc
new file mode 100644
index 000000000..842a104f5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/database.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/index.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/index.cpython-36.pyc
new file mode 100644
index 000000000..b1700c164
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/index.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/locators.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/locators.cpython-36.pyc
new file mode 100644
index 000000000..46a801492
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/locators.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/manifest.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/manifest.cpython-36.pyc
new file mode 100644
index 000000000..c33128c07
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/manifest.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/markers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/markers.cpython-36.pyc
new file mode 100644
index 000000000..b5448dccb
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/markers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/metadata.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/metadata.cpython-36.pyc
new file mode 100644
index 000000000..ad23a298a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/metadata.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/resources.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/resources.cpython-36.pyc
new file mode 100644
index 000000000..5c8f12ce0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/resources.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/scripts.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/scripts.cpython-36.pyc
new file mode 100644
index 000000000..8fac5cefc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/util.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/util.cpython-36.pyc
new file mode 100644
index 000000000..d6cb88adf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..65e80f5a7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..72d03e44d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__init__.py b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__init__.py
new file mode 100644
index 000000000..f7dbf4c9a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__init__.py
@@ -0,0 +1,6 @@
+"""Modules copied from Python 3 standard libraries, for internal use only.
+
+Individual classes and functions are found in d2._backport.misc.  Intended
+usage is to always import things missing from 3.1 from that module: the
+built-in/stdlib objects will be used if found.
+"""
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..0c5628218
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc
new file mode 100644
index 000000000..7fab8660c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/misc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.pyc
new file mode 100644
index 000000000..ec4b18082
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/shutil.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc
new file mode 100644
index 000000000..febabe668
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/sysconfig.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.pyc
new file mode 100644
index 000000000..a061be26e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/__pycache__/tarfile.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/misc.py b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/misc.py
new file mode 100644
index 000000000..cfb318d34
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/misc.py
@@ -0,0 +1,41 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""Backports for individual classes and functions."""
+
+import os
+import sys
+
+__all__ = ['cache_from_source', 'callable', 'fsencode']
+
+
+try:
+    from imp import cache_from_source
+except ImportError:
+    def cache_from_source(py_file, debug=__debug__):
+        ext = debug and 'c' or 'o'
+        return py_file + ext
+
+
+try:
+    callable = callable
+except NameError:
+    from collections import Callable
+
+    def callable(obj):
+        return isinstance(obj, Callable)
+
+
+try:
+    fsencode = os.fsencode
+except AttributeError:
+    def fsencode(filename):
+        if isinstance(filename, bytes):
+            return filename
+        elif isinstance(filename, str):
+            return filename.encode(sys.getfilesystemencoding())
+        else:
+            raise TypeError("expect bytes or str, not %s" %
+                            type(filename).__name__)
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/shutil.py b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/shutil.py
new file mode 100644
index 000000000..10ed36253
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/shutil.py
@@ -0,0 +1,764 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""Utility functions for copying and archiving files and directory trees.
+
+XXX The functions here don't copy the resource fork or other metadata on Mac.
+
+"""
+
+import os
+import sys
+import stat
+from os.path import abspath
+import fnmatch
+try:
+    from collections.abc import Callable
+except ImportError:
+    from collections import Callable
+import errno
+from . import tarfile
+
+try:
+    import bz2
+    _BZ2_SUPPORTED = True
+except ImportError:
+    _BZ2_SUPPORTED = False
+
+try:
+    from pwd import getpwnam
+except ImportError:
+    getpwnam = None
+
+try:
+    from grp import getgrnam
+except ImportError:
+    getgrnam = None
+
+__all__ = ["copyfileobj", "copyfile", "copymode", "copystat", "copy", "copy2",
+           "copytree", "move", "rmtree", "Error", "SpecialFileError",
+           "ExecError", "make_archive", "get_archive_formats",
+           "register_archive_format", "unregister_archive_format",
+           "get_unpack_formats", "register_unpack_format",
+           "unregister_unpack_format", "unpack_archive", "ignore_patterns"]
+
+class Error(EnvironmentError):
+    pass
+
+class SpecialFileError(EnvironmentError):
+    """Raised when trying to do a kind of operation (e.g. copying) which is
+    not supported on a special file (e.g. a named pipe)"""
+
+class ExecError(EnvironmentError):
+    """Raised when a command could not be executed"""
+
+class ReadError(EnvironmentError):
+    """Raised when an archive cannot be read"""
+
+class RegistryError(Exception):
+    """Raised when a registry operation with the archiving
+    and unpacking registries fails"""
+
+
+try:
+    WindowsError
+except NameError:
+    WindowsError = None
+
+def copyfileobj(fsrc, fdst, length=16*1024):
+    """copy data from file-like object fsrc to file-like object fdst"""
+    while 1:
+        buf = fsrc.read(length)
+        if not buf:
+            break
+        fdst.write(buf)
+
+def _samefile(src, dst):
+    # Macintosh, Unix.
+    if hasattr(os.path, 'samefile'):
+        try:
+            return os.path.samefile(src, dst)
+        except OSError:
+            return False
+
+    # All other platforms: check for same pathname.
+    return (os.path.normcase(os.path.abspath(src)) ==
+            os.path.normcase(os.path.abspath(dst)))
+
+def copyfile(src, dst):
+    """Copy data from src to dst"""
+    if _samefile(src, dst):
+        raise Error("`%s` and `%s` are the same file" % (src, dst))
+
+    for fn in [src, dst]:
+        try:
+            st = os.stat(fn)
+        except OSError:
+            # File most likely does not exist
+            pass
+        else:
+            # XXX What about other special files? (sockets, devices...)
+            if stat.S_ISFIFO(st.st_mode):
+                raise SpecialFileError("`%s` is a named pipe" % fn)
+
+    with open(src, 'rb') as fsrc:
+        with open(dst, 'wb') as fdst:
+            copyfileobj(fsrc, fdst)
+
+def copymode(src, dst):
+    """Copy mode bits from src to dst"""
+    if hasattr(os, 'chmod'):
+        st = os.stat(src)
+        mode = stat.S_IMODE(st.st_mode)
+        os.chmod(dst, mode)
+
+def copystat(src, dst):
+    """Copy all stat info (mode bits, atime, mtime, flags) from src to dst"""
+    st = os.stat(src)
+    mode = stat.S_IMODE(st.st_mode)
+    if hasattr(os, 'utime'):
+        os.utime(dst, (st.st_atime, st.st_mtime))
+    if hasattr(os, 'chmod'):
+        os.chmod(dst, mode)
+    if hasattr(os, 'chflags') and hasattr(st, 'st_flags'):
+        try:
+            os.chflags(dst, st.st_flags)
+        except OSError as why:
+            if (not hasattr(errno, 'EOPNOTSUPP') or
+                why.errno != errno.EOPNOTSUPP):
+                raise
+
+def copy(src, dst):
+    """Copy data and mode bits ("cp src dst").
+
+    The destination may be a directory.
+
+    """
+    if os.path.isdir(dst):
+        dst = os.path.join(dst, os.path.basename(src))
+    copyfile(src, dst)
+    copymode(src, dst)
+
+def copy2(src, dst):
+    """Copy data and all stat info ("cp -p src dst").
+
+    The destination may be a directory.
+
+    """
+    if os.path.isdir(dst):
+        dst = os.path.join(dst, os.path.basename(src))
+    copyfile(src, dst)
+    copystat(src, dst)
+
+def ignore_patterns(*patterns):
+    """Function that can be used as copytree() ignore parameter.
+
+    Patterns is a sequence of glob-style patterns
+    that are used to exclude files"""
+    def _ignore_patterns(path, names):
+        ignored_names = []
+        for pattern in patterns:
+            ignored_names.extend(fnmatch.filter(names, pattern))
+        return set(ignored_names)
+    return _ignore_patterns
+
+def copytree(src, dst, symlinks=False, ignore=None, copy_function=copy2,
+             ignore_dangling_symlinks=False):
+    """Recursively copy a directory tree.
+
+    The destination directory must not already exist.
+    If exception(s) occur, an Error is raised with a list of reasons.
+
+    If the optional symlinks flag is true, symbolic links in the
+    source tree result in symbolic links in the destination tree; if
+    it is false, the contents of the files pointed to by symbolic
+    links are copied. If the file pointed by the symlink doesn't
+    exist, an exception will be added in the list of errors raised in
+    an Error exception at the end of the copy process.
+
+    You can set the optional ignore_dangling_symlinks flag to true if you
+    want to silence this exception. Notice that this has no effect on
+    platforms that don't support os.symlink.
+
+    The optional ignore argument is a callable. If given, it
+    is called with the `src` parameter, which is the directory
+    being visited by copytree(), and `names` which is the list of
+    `src` contents, as returned by os.listdir():
+
+        callable(src, names) -> ignored_names
+
+    Since copytree() is called recursively, the callable will be
+    called once for each directory that is copied. It returns a
+    list of names relative to the `src` directory that should
+    not be copied.
+
+    The optional copy_function argument is a callable that will be used
+    to copy each file. It will be called with the source path and the
+    destination path as arguments. By default, copy2() is used, but any
+    function that supports the same signature (like copy()) can be used.
+
+    """
+    names = os.listdir(src)
+    if ignore is not None:
+        ignored_names = ignore(src, names)
+    else:
+        ignored_names = set()
+
+    os.makedirs(dst)
+    errors = []
+    for name in names:
+        if name in ignored_names:
+            continue
+        srcname = os.path.join(src, name)
+        dstname = os.path.join(dst, name)
+        try:
+            if os.path.islink(srcname):
+                linkto = os.readlink(srcname)
+                if symlinks:
+                    os.symlink(linkto, dstname)
+                else:
+                    # ignore dangling symlink if the flag is on
+                    if not os.path.exists(linkto) and ignore_dangling_symlinks:
+                        continue
+                    # otherwise let the copy occurs. copy2 will raise an error
+                    copy_function(srcname, dstname)
+            elif os.path.isdir(srcname):
+                copytree(srcname, dstname, symlinks, ignore, copy_function)
+            else:
+                # Will raise a SpecialFileError for unsupported file types
+                copy_function(srcname, dstname)
+        # catch the Error from the recursive copytree so that we can
+        # continue with other files
+        except Error as err:
+            errors.extend(err.args[0])
+        except EnvironmentError as why:
+            errors.append((srcname, dstname, str(why)))
+    try:
+        copystat(src, dst)
+    except OSError as why:
+        if WindowsError is not None and isinstance(why, WindowsError):
+            # Copying file access times may fail on Windows
+            pass
+        else:
+            errors.extend((src, dst, str(why)))
+    if errors:
+        raise Error(errors)
+
+def rmtree(path, ignore_errors=False, onerror=None):
+    """Recursively delete a directory tree.
+
+    If ignore_errors is set, errors are ignored; otherwise, if onerror
+    is set, it is called to handle the error with arguments (func,
+    path, exc_info) where func is os.listdir, os.remove, or os.rmdir;
+    path is the argument to that function that caused it to fail; and
+    exc_info is a tuple returned by sys.exc_info().  If ignore_errors
+    is false and onerror is None, an exception is raised.
+
+    """
+    if ignore_errors:
+        def onerror(*args):
+            pass
+    elif onerror is None:
+        def onerror(*args):
+            raise
+    try:
+        if os.path.islink(path):
+            # symlinks to directories are forbidden, see bug #1669
+            raise OSError("Cannot call rmtree on a symbolic link")
+    except OSError:
+        onerror(os.path.islink, path, sys.exc_info())
+        # can't continue even if onerror hook returns
+        return
+    names = []
+    try:
+        names = os.listdir(path)
+    except os.error:
+        onerror(os.listdir, path, sys.exc_info())
+    for name in names:
+        fullname = os.path.join(path, name)
+        try:
+            mode = os.lstat(fullname).st_mode
+        except os.error:
+            mode = 0
+        if stat.S_ISDIR(mode):
+            rmtree(fullname, ignore_errors, onerror)
+        else:
+            try:
+                os.remove(fullname)
+            except os.error:
+                onerror(os.remove, fullname, sys.exc_info())
+    try:
+        os.rmdir(path)
+    except os.error:
+        onerror(os.rmdir, path, sys.exc_info())
+
+
+def _basename(path):
+    # A basename() variant which first strips the trailing slash, if present.
+    # Thus we always get the last component of the path, even for directories.
+    return os.path.basename(path.rstrip(os.path.sep))
+
+def move(src, dst):
+    """Recursively move a file or directory to another location. This is
+    similar to the Unix "mv" command.
+
+    If the destination is a directory or a symlink to a directory, the source
+    is moved inside the directory. The destination path must not already
+    exist.
+
+    If the destination already exists but is not a directory, it may be
+    overwritten depending on os.rename() semantics.
+
+    If the destination is on our current filesystem, then rename() is used.
+    Otherwise, src is copied to the destination and then removed.
+    A lot more could be done here...  A look at a mv.c shows a lot of
+    the issues this implementation glosses over.
+
+    """
+    real_dst = dst
+    if os.path.isdir(dst):
+        if _samefile(src, dst):
+            # We might be on a case insensitive filesystem,
+            # perform the rename anyway.
+            os.rename(src, dst)
+            return
+
+        real_dst = os.path.join(dst, _basename(src))
+        if os.path.exists(real_dst):
+            raise Error("Destination path '%s' already exists" % real_dst)
+    try:
+        os.rename(src, real_dst)
+    except OSError:
+        if os.path.isdir(src):
+            if _destinsrc(src, dst):
+                raise Error("Cannot move a directory '%s' into itself '%s'." % (src, dst))
+            copytree(src, real_dst, symlinks=True)
+            rmtree(src)
+        else:
+            copy2(src, real_dst)
+            os.unlink(src)
+
+def _destinsrc(src, dst):
+    src = abspath(src)
+    dst = abspath(dst)
+    if not src.endswith(os.path.sep):
+        src += os.path.sep
+    if not dst.endswith(os.path.sep):
+        dst += os.path.sep
+    return dst.startswith(src)
+
+def _get_gid(name):
+    """Returns a gid, given a group name."""
+    if getgrnam is None or name is None:
+        return None
+    try:
+        result = getgrnam(name)
+    except KeyError:
+        result = None
+    if result is not None:
+        return result[2]
+    return None
+
+def _get_uid(name):
+    """Returns an uid, given a user name."""
+    if getpwnam is None or name is None:
+        return None
+    try:
+        result = getpwnam(name)
+    except KeyError:
+        result = None
+    if result is not None:
+        return result[2]
+    return None
+
+def _make_tarball(base_name, base_dir, compress="gzip", verbose=0, dry_run=0,
+                  owner=None, group=None, logger=None):
+    """Create a (possibly compressed) tar file from all the files under
+    'base_dir'.
+
+    'compress' must be "gzip" (the default), "bzip2", or None.
+
+    'owner' and 'group' can be used to define an owner and a group for the
+    archive that is being built. If not provided, the current owner and group
+    will be used.
+
+    The output tar file will be named 'base_name' +  ".tar", possibly plus
+    the appropriate compression extension (".gz", or ".bz2").
+
+    Returns the output filename.
+    """
+    tar_compression = {'gzip': 'gz', None: ''}
+    compress_ext = {'gzip': '.gz'}
+
+    if _BZ2_SUPPORTED:
+        tar_compression['bzip2'] = 'bz2'
+        compress_ext['bzip2'] = '.bz2'
+
+    # flags for compression program, each element of list will be an argument
+    if compress is not None and compress not in compress_ext:
+        raise ValueError("bad value for 'compress', or compression format not "
+                         "supported : {0}".format(compress))
+
+    archive_name = base_name + '.tar' + compress_ext.get(compress, '')
+    archive_dir = os.path.dirname(archive_name)
+
+    if not os.path.exists(archive_dir):
+        if logger is not None:
+            logger.info("creating %s", archive_dir)
+        if not dry_run:
+            os.makedirs(archive_dir)
+
+    # creating the tarball
+    if logger is not None:
+        logger.info('Creating tar archive')
+
+    uid = _get_uid(owner)
+    gid = _get_gid(group)
+
+    def _set_uid_gid(tarinfo):
+        if gid is not None:
+            tarinfo.gid = gid
+            tarinfo.gname = group
+        if uid is not None:
+            tarinfo.uid = uid
+            tarinfo.uname = owner
+        return tarinfo
+
+    if not dry_run:
+        tar = tarfile.open(archive_name, 'w|%s' % tar_compression[compress])
+        try:
+            tar.add(base_dir, filter=_set_uid_gid)
+        finally:
+            tar.close()
+
+    return archive_name
+
+def _call_external_zip(base_dir, zip_filename, verbose=False, dry_run=False):
+    # XXX see if we want to keep an external call here
+    if verbose:
+        zipoptions = "-r"
+    else:
+        zipoptions = "-rq"
+    from distutils.errors import DistutilsExecError
+    from distutils.spawn import spawn
+    try:
+        spawn(["zip", zipoptions, zip_filename, base_dir], dry_run=dry_run)
+    except DistutilsExecError:
+        # XXX really should distinguish between "couldn't find
+        # external 'zip' command" and "zip failed".
+        raise ExecError("unable to create zip file '%s': "
+            "could neither import the 'zipfile' module nor "
+            "find a standalone zip utility") % zip_filename
+
+def _make_zipfile(base_name, base_dir, verbose=0, dry_run=0, logger=None):
+    """Create a zip file from all the files under 'base_dir'.
+
+    The output zip file will be named 'base_name' + ".zip".  Uses either the
+    "zipfile" Python module (if available) or the InfoZIP "zip" utility
+    (if installed and found on the default search path).  If neither tool is
+    available, raises ExecError.  Returns the name of the output zip
+    file.
+    """
+    zip_filename = base_name + ".zip"
+    archive_dir = os.path.dirname(base_name)
+
+    if not os.path.exists(archive_dir):
+        if logger is not None:
+            logger.info("creating %s", archive_dir)
+        if not dry_run:
+            os.makedirs(archive_dir)
+
+    # If zipfile module is not available, try spawning an external 'zip'
+    # command.
+    try:
+        import zipfile
+    except ImportError:
+        zipfile = None
+
+    if zipfile is None:
+        _call_external_zip(base_dir, zip_filename, verbose, dry_run)
+    else:
+        if logger is not None:
+            logger.info("creating '%s' and adding '%s' to it",
+                        zip_filename, base_dir)
+
+        if not dry_run:
+            zip = zipfile.ZipFile(zip_filename, "w",
+                                  compression=zipfile.ZIP_DEFLATED)
+
+            for dirpath, dirnames, filenames in os.walk(base_dir):
+                for name in filenames:
+                    path = os.path.normpath(os.path.join(dirpath, name))
+                    if os.path.isfile(path):
+                        zip.write(path, path)
+                        if logger is not None:
+                            logger.info("adding '%s'", path)
+            zip.close()
+
+    return zip_filename
+
+_ARCHIVE_FORMATS = {
+    'gztar': (_make_tarball, [('compress', 'gzip')], "gzip'ed tar-file"),
+    'bztar': (_make_tarball, [('compress', 'bzip2')], "bzip2'ed tar-file"),
+    'tar':   (_make_tarball, [('compress', None)], "uncompressed tar file"),
+    'zip':   (_make_zipfile, [], "ZIP file"),
+    }
+
+if _BZ2_SUPPORTED:
+    _ARCHIVE_FORMATS['bztar'] = (_make_tarball, [('compress', 'bzip2')],
+                                "bzip2'ed tar-file")
+
+def get_archive_formats():
+    """Returns a list of supported formats for archiving and unarchiving.
+
+    Each element of the returned sequence is a tuple (name, description)
+    """
+    formats = [(name, registry[2]) for name, registry in
+               _ARCHIVE_FORMATS.items()]
+    formats.sort()
+    return formats
+
+def register_archive_format(name, function, extra_args=None, description=''):
+    """Registers an archive format.
+
+    name is the name of the format. function is the callable that will be
+    used to create archives. If provided, extra_args is a sequence of
+    (name, value) tuples that will be passed as arguments to the callable.
+    description can be provided to describe the format, and will be returned
+    by the get_archive_formats() function.
+    """
+    if extra_args is None:
+        extra_args = []
+    if not isinstance(function, Callable):
+        raise TypeError('The %s object is not callable' % function)
+    if not isinstance(extra_args, (tuple, list)):
+        raise TypeError('extra_args needs to be a sequence')
+    for element in extra_args:
+        if not isinstance(element, (tuple, list)) or len(element) !=2:
+            raise TypeError('extra_args elements are : (arg_name, value)')
+
+    _ARCHIVE_FORMATS[name] = (function, extra_args, description)
+
+def unregister_archive_format(name):
+    del _ARCHIVE_FORMATS[name]
+
+def make_archive(base_name, format, root_dir=None, base_dir=None, verbose=0,
+                 dry_run=0, owner=None, group=None, logger=None):
+    """Create an archive file (eg. zip or tar).
+
+    'base_name' is the name of the file to create, minus any format-specific
+    extension; 'format' is the archive format: one of "zip", "tar", "bztar"
+    or "gztar".
+
+    'root_dir' is a directory that will be the root directory of the
+    archive; ie. we typically chdir into 'root_dir' before creating the
+    archive.  'base_dir' is the directory where we start archiving from;
+    ie. 'base_dir' will be the common prefix of all files and
+    directories in the archive.  'root_dir' and 'base_dir' both default
+    to the current directory.  Returns the name of the archive file.
+
+    'owner' and 'group' are used when creating a tar archive. By default,
+    uses the current owner and group.
+    """
+    save_cwd = os.getcwd()
+    if root_dir is not None:
+        if logger is not None:
+            logger.debug("changing into '%s'", root_dir)
+        base_name = os.path.abspath(base_name)
+        if not dry_run:
+            os.chdir(root_dir)
+
+    if base_dir is None:
+        base_dir = os.curdir
+
+    kwargs = {'dry_run': dry_run, 'logger': logger}
+
+    try:
+        format_info = _ARCHIVE_FORMATS[format]
+    except KeyError:
+        raise ValueError("unknown archive format '%s'" % format)
+
+    func = format_info[0]
+    for arg, val in format_info[1]:
+        kwargs[arg] = val
+
+    if format != 'zip':
+        kwargs['owner'] = owner
+        kwargs['group'] = group
+
+    try:
+        filename = func(base_name, base_dir, **kwargs)
+    finally:
+        if root_dir is not None:
+            if logger is not None:
+                logger.debug("changing back to '%s'", save_cwd)
+            os.chdir(save_cwd)
+
+    return filename
+
+
+def get_unpack_formats():
+    """Returns a list of supported formats for unpacking.
+
+    Each element of the returned sequence is a tuple
+    (name, extensions, description)
+    """
+    formats = [(name, info[0], info[3]) for name, info in
+               _UNPACK_FORMATS.items()]
+    formats.sort()
+    return formats
+
+def _check_unpack_options(extensions, function, extra_args):
+    """Checks what gets registered as an unpacker."""
+    # first make sure no other unpacker is registered for this extension
+    existing_extensions = {}
+    for name, info in _UNPACK_FORMATS.items():
+        for ext in info[0]:
+            existing_extensions[ext] = name
+
+    for extension in extensions:
+        if extension in existing_extensions:
+            msg = '%s is already registered for "%s"'
+            raise RegistryError(msg % (extension,
+                                       existing_extensions[extension]))
+
+    if not isinstance(function, Callable):
+        raise TypeError('The registered function must be a callable')
+
+
+def register_unpack_format(name, extensions, function, extra_args=None,
+                           description=''):
+    """Registers an unpack format.
+
+    `name` is the name of the format. `extensions` is a list of extensions
+    corresponding to the format.
+
+    `function` is the callable that will be
+    used to unpack archives. The callable will receive archives to unpack.
+    If it's unable to handle an archive, it needs to raise a ReadError
+    exception.
+
+    If provided, `extra_args` is a sequence of
+    (name, value) tuples that will be passed as arguments to the callable.
+    description can be provided to describe the format, and will be returned
+    by the get_unpack_formats() function.
+    """
+    if extra_args is None:
+        extra_args = []
+    _check_unpack_options(extensions, function, extra_args)
+    _UNPACK_FORMATS[name] = extensions, function, extra_args, description
+
+def unregister_unpack_format(name):
+    """Removes the pack format from the registry."""
+    del _UNPACK_FORMATS[name]
+
+def _ensure_directory(path):
+    """Ensure that the parent directory of `path` exists"""
+    dirname = os.path.dirname(path)
+    if not os.path.isdir(dirname):
+        os.makedirs(dirname)
+
+def _unpack_zipfile(filename, extract_dir):
+    """Unpack zip `filename` to `extract_dir`
+    """
+    try:
+        import zipfile
+    except ImportError:
+        raise ReadError('zlib not supported, cannot unpack this archive.')
+
+    if not zipfile.is_zipfile(filename):
+        raise ReadError("%s is not a zip file" % filename)
+
+    zip = zipfile.ZipFile(filename)
+    try:
+        for info in zip.infolist():
+            name = info.filename
+
+            # don't extract absolute paths or ones with .. in them
+            if name.startswith('/') or '..' in name:
+                continue
+
+            target = os.path.join(extract_dir, *name.split('/'))
+            if not target:
+                continue
+
+            _ensure_directory(target)
+            if not name.endswith('/'):
+                # file
+                data = zip.read(info.filename)
+                f = open(target, 'wb')
+                try:
+                    f.write(data)
+                finally:
+                    f.close()
+                    del data
+    finally:
+        zip.close()
+
+def _unpack_tarfile(filename, extract_dir):
+    """Unpack tar/tar.gz/tar.bz2 `filename` to `extract_dir`
+    """
+    try:
+        tarobj = tarfile.open(filename)
+    except tarfile.TarError:
+        raise ReadError(
+            "%s is not a compressed or uncompressed tar file" % filename)
+    try:
+        tarobj.extractall(extract_dir)
+    finally:
+        tarobj.close()
+
+_UNPACK_FORMATS = {
+    'gztar': (['.tar.gz', '.tgz'], _unpack_tarfile, [], "gzip'ed tar-file"),
+    'tar':   (['.tar'], _unpack_tarfile, [], "uncompressed tar file"),
+    'zip':   (['.zip'], _unpack_zipfile, [], "ZIP file")
+    }
+
+if _BZ2_SUPPORTED:
+    _UNPACK_FORMATS['bztar'] = (['.bz2'], _unpack_tarfile, [],
+                                "bzip2'ed tar-file")
+
+def _find_unpack_format(filename):
+    for name, info in _UNPACK_FORMATS.items():
+        for extension in info[0]:
+            if filename.endswith(extension):
+                return name
+    return None
+
+def unpack_archive(filename, extract_dir=None, format=None):
+    """Unpack an archive.
+
+    `filename` is the name of the archive.
+
+    `extract_dir` is the name of the target directory, where the archive
+    is unpacked. If not provided, the current working directory is used.
+
+    `format` is the archive format: one of "zip", "tar", or "gztar". Or any
+    other registered format. If not provided, unpack_archive will use the
+    filename extension and see if an unpacker was registered for that
+    extension.
+
+    In case none is found, a ValueError is raised.
+    """
+    if extract_dir is None:
+        extract_dir = os.getcwd()
+
+    if format is not None:
+        try:
+            format_info = _UNPACK_FORMATS[format]
+        except KeyError:
+            raise ValueError("Unknown unpack format '{0}'".format(format))
+
+        func = format_info[1]
+        func(filename, extract_dir, **dict(format_info[2]))
+    else:
+        # we need to look at the registered unpackers supported extensions
+        format = _find_unpack_format(filename)
+        if format is None:
+            raise ReadError("Unknown archive format '{0}'".format(filename))
+
+        func = _UNPACK_FORMATS[format][1]
+        kwargs = dict(_UNPACK_FORMATS[format][2])
+        func(filename, extract_dir, **kwargs)
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.cfg b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.cfg
new file mode 100644
index 000000000..1746bd01c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.cfg
@@ -0,0 +1,84 @@
+[posix_prefix]
+# Configuration directories.  Some of these come straight out of the
+# configure script.  They are for implementing the other variables, not to
+# be used directly in [resource_locations].
+confdir = /etc
+datadir = /usr/share
+libdir = /usr/lib
+statedir = /var
+# User resource directory
+local = ~/.local/{distribution.name}
+
+stdlib = {base}/lib/python{py_version_short}
+platstdlib = {platbase}/lib/python{py_version_short}
+purelib = {base}/lib/python{py_version_short}/site-packages
+platlib = {platbase}/lib/python{py_version_short}/site-packages
+include = {base}/include/python{py_version_short}{abiflags}
+platinclude = {platbase}/include/python{py_version_short}{abiflags}
+data = {base}
+
+[posix_home]
+stdlib = {base}/lib/python
+platstdlib = {base}/lib/python
+purelib = {base}/lib/python
+platlib = {base}/lib/python
+include = {base}/include/python
+platinclude = {base}/include/python
+scripts = {base}/bin
+data = {base}
+
+[nt]
+stdlib = {base}/Lib
+platstdlib = {base}/Lib
+purelib = {base}/Lib/site-packages
+platlib = {base}/Lib/site-packages
+include = {base}/Include
+platinclude = {base}/Include
+scripts = {base}/Scripts
+data = {base}
+
+[os2]
+stdlib = {base}/Lib
+platstdlib = {base}/Lib
+purelib = {base}/Lib/site-packages
+platlib = {base}/Lib/site-packages
+include = {base}/Include
+platinclude = {base}/Include
+scripts = {base}/Scripts
+data = {base}
+
+[os2_home]
+stdlib = {userbase}/lib/python{py_version_short}
+platstdlib = {userbase}/lib/python{py_version_short}
+purelib = {userbase}/lib/python{py_version_short}/site-packages
+platlib = {userbase}/lib/python{py_version_short}/site-packages
+include = {userbase}/include/python{py_version_short}
+scripts = {userbase}/bin
+data = {userbase}
+
+[nt_user]
+stdlib = {userbase}/Python{py_version_nodot}
+platstdlib = {userbase}/Python{py_version_nodot}
+purelib = {userbase}/Python{py_version_nodot}/site-packages
+platlib = {userbase}/Python{py_version_nodot}/site-packages
+include = {userbase}/Python{py_version_nodot}/Include
+scripts = {userbase}/Scripts
+data = {userbase}
+
+[posix_user]
+stdlib = {userbase}/lib/python{py_version_short}
+platstdlib = {userbase}/lib/python{py_version_short}
+purelib = {userbase}/lib/python{py_version_short}/site-packages
+platlib = {userbase}/lib/python{py_version_short}/site-packages
+include = {userbase}/include/python{py_version_short}
+scripts = {userbase}/bin
+data = {userbase}
+
+[osx_framework_user]
+stdlib = {userbase}/lib/python
+platstdlib = {userbase}/lib/python
+purelib = {userbase}/lib/python/site-packages
+platlib = {userbase}/lib/python/site-packages
+include = {userbase}/include
+scripts = {userbase}/bin
+data = {userbase}
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.py b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.py
new file mode 100644
index 000000000..b470a373c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/sysconfig.py
@@ -0,0 +1,786 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""Access to Python's configuration information."""
+
+import codecs
+import os
+import re
+import sys
+from os.path import pardir, realpath
+try:
+    import configparser
+except ImportError:
+    import ConfigParser as configparser
+
+
+__all__ = [
+    'get_config_h_filename',
+    'get_config_var',
+    'get_config_vars',
+    'get_makefile_filename',
+    'get_path',
+    'get_path_names',
+    'get_paths',
+    'get_platform',
+    'get_python_version',
+    'get_scheme_names',
+    'parse_config_h',
+]
+
+
+def _safe_realpath(path):
+    try:
+        return realpath(path)
+    except OSError:
+        return path
+
+
+if sys.executable:
+    _PROJECT_BASE = os.path.dirname(_safe_realpath(sys.executable))
+else:
+    # sys.executable can be empty if argv[0] has been changed and Python is
+    # unable to retrieve the real program name
+    _PROJECT_BASE = _safe_realpath(os.getcwd())
+
+if os.name == "nt" and "pcbuild" in _PROJECT_BASE[-8:].lower():
+    _PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir))
+# PC/VS7.1
+if os.name == "nt" and "\\pc\\v" in _PROJECT_BASE[-10:].lower():
+    _PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir, pardir))
+# PC/AMD64
+if os.name == "nt" and "\\pcbuild\\amd64" in _PROJECT_BASE[-14:].lower():
+    _PROJECT_BASE = _safe_realpath(os.path.join(_PROJECT_BASE, pardir, pardir))
+
+
+def is_python_build():
+    for fn in ("Setup.dist", "Setup.local"):
+        if os.path.isfile(os.path.join(_PROJECT_BASE, "Modules", fn)):
+            return True
+    return False
+
+_PYTHON_BUILD = is_python_build()
+
+_cfg_read = False
+
+def _ensure_cfg_read():
+    global _cfg_read
+    if not _cfg_read:
+        from ..resources import finder
+        backport_package = __name__.rsplit('.', 1)[0]
+        _finder = finder(backport_package)
+        _cfgfile = _finder.find('sysconfig.cfg')
+        assert _cfgfile, 'sysconfig.cfg exists'
+        with _cfgfile.as_stream() as s:
+            _SCHEMES.readfp(s)
+        if _PYTHON_BUILD:
+            for scheme in ('posix_prefix', 'posix_home'):
+                _SCHEMES.set(scheme, 'include', '{srcdir}/Include')
+                _SCHEMES.set(scheme, 'platinclude', '{projectbase}/.')
+
+        _cfg_read = True
+
+
+_SCHEMES = configparser.RawConfigParser()
+_VAR_REPL = re.compile(r'\{([^{]*?)\}')
+
+def _expand_globals(config):
+    _ensure_cfg_read()
+    if config.has_section('globals'):
+        globals = config.items('globals')
+    else:
+        globals = tuple()
+
+    sections = config.sections()
+    for section in sections:
+        if section == 'globals':
+            continue
+        for option, value in globals:
+            if config.has_option(section, option):
+                continue
+            config.set(section, option, value)
+    config.remove_section('globals')
+
+    # now expanding local variables defined in the cfg file
+    #
+    for section in config.sections():
+        variables = dict(config.items(section))
+
+        def _replacer(matchobj):
+            name = matchobj.group(1)
+            if name in variables:
+                return variables[name]
+            return matchobj.group(0)
+
+        for option, value in config.items(section):
+            config.set(section, option, _VAR_REPL.sub(_replacer, value))
+
+#_expand_globals(_SCHEMES)
+
+_PY_VERSION = '%s.%s.%s' % sys.version_info[:3]
+_PY_VERSION_SHORT = '%s.%s' % sys.version_info[:2]
+_PY_VERSION_SHORT_NO_DOT = '%s%s' % sys.version_info[:2]
+_PREFIX = os.path.normpath(sys.prefix)
+_EXEC_PREFIX = os.path.normpath(sys.exec_prefix)
+_CONFIG_VARS = None
+_USER_BASE = None
+
+
+def _subst_vars(path, local_vars):
+    """In the string `path`, replace tokens like {some.thing} with the
+    corresponding value from the map `local_vars`.
+
+    If there is no corresponding value, leave the token unchanged.
+    """
+    def _replacer(matchobj):
+        name = matchobj.group(1)
+        if name in local_vars:
+            return local_vars[name]
+        elif name in os.environ:
+            return os.environ[name]
+        return matchobj.group(0)
+    return _VAR_REPL.sub(_replacer, path)
+
+
+def _extend_dict(target_dict, other_dict):
+    target_keys = target_dict.keys()
+    for key, value in other_dict.items():
+        if key in target_keys:
+            continue
+        target_dict[key] = value
+
+
+def _expand_vars(scheme, vars):
+    res = {}
+    if vars is None:
+        vars = {}
+    _extend_dict(vars, get_config_vars())
+
+    for key, value in _SCHEMES.items(scheme):
+        if os.name in ('posix', 'nt'):
+            value = os.path.expanduser(value)
+        res[key] = os.path.normpath(_subst_vars(value, vars))
+    return res
+
+
+def format_value(value, vars):
+    def _replacer(matchobj):
+        name = matchobj.group(1)
+        if name in vars:
+            return vars[name]
+        return matchobj.group(0)
+    return _VAR_REPL.sub(_replacer, value)
+
+
+def _get_default_scheme():
+    if os.name == 'posix':
+        # the default scheme for posix is posix_prefix
+        return 'posix_prefix'
+    return os.name
+
+
+def _getuserbase():
+    env_base = os.environ.get("PYTHONUSERBASE", None)
+
+    def joinuser(*args):
+        return os.path.expanduser(os.path.join(*args))
+
+    # what about 'os2emx', 'riscos' ?
+    if os.name == "nt":
+        base = os.environ.get("APPDATA") or "~"
+        if env_base:
+            return env_base
+        else:
+            return joinuser(base, "Python")
+
+    if sys.platform == "darwin":
+        framework = get_config_var("PYTHONFRAMEWORK")
+        if framework:
+            if env_base:
+                return env_base
+            else:
+                return joinuser("~", "Library", framework, "%d.%d" %
+                                sys.version_info[:2])
+
+    if env_base:
+        return env_base
+    else:
+        return joinuser("~", ".local")
+
+
+def _parse_makefile(filename, vars=None):
+    """Parse a Makefile-style file.
+
+    A dictionary containing name/value pairs is returned.  If an
+    optional dictionary is passed in as the second argument, it is
+    used instead of a new dictionary.
+    """
+    # Regexes needed for parsing Makefile (and similar syntaxes,
+    # like old-style Setup files).
+    _variable_rx = re.compile(r"([a-zA-Z][a-zA-Z0-9_]+)\s*=\s*(.*)")
+    _findvar1_rx = re.compile(r"\$\(([A-Za-z][A-Za-z0-9_]*)\)")
+    _findvar2_rx = re.compile(r"\${([A-Za-z][A-Za-z0-9_]*)}")
+
+    if vars is None:
+        vars = {}
+    done = {}
+    notdone = {}
+
+    with codecs.open(filename, encoding='utf-8', errors="surrogateescape") as f:
+        lines = f.readlines()
+
+    for line in lines:
+        if line.startswith('#') or line.strip() == '':
+            continue
+        m = _variable_rx.match(line)
+        if m:
+            n, v = m.group(1, 2)
+            v = v.strip()
+            # `$$' is a literal `$' in make
+            tmpv = v.replace('$$', '')
+
+            if "$" in tmpv:
+                notdone[n] = v
+            else:
+                try:
+                    v = int(v)
+                except ValueError:
+                    # insert literal `$'
+                    done[n] = v.replace('$$', '$')
+                else:
+                    done[n] = v
+
+    # do variable interpolation here
+    variables = list(notdone.keys())
+
+    # Variables with a 'PY_' prefix in the makefile. These need to
+    # be made available without that prefix through sysconfig.
+    # Special care is needed to ensure that variable expansion works, even
+    # if the expansion uses the name without a prefix.
+    renamed_variables = ('CFLAGS', 'LDFLAGS', 'CPPFLAGS')
+
+    while len(variables) > 0:
+        for name in tuple(variables):
+            value = notdone[name]
+            m = _findvar1_rx.search(value) or _findvar2_rx.search(value)
+            if m is not None:
+                n = m.group(1)
+                found = True
+                if n in done:
+                    item = str(done[n])
+                elif n in notdone:
+                    # get it on a subsequent round
+                    found = False
+                elif n in os.environ:
+                    # do it like make: fall back to environment
+                    item = os.environ[n]
+
+                elif n in renamed_variables:
+                    if (name.startswith('PY_') and
+                        name[3:] in renamed_variables):
+                        item = ""
+
+                    elif 'PY_' + n in notdone:
+                        found = False
+
+                    else:
+                        item = str(done['PY_' + n])
+
+                else:
+                    done[n] = item = ""
+
+                if found:
+                    after = value[m.end():]
+                    value = value[:m.start()] + item + after
+                    if "$" in after:
+                        notdone[name] = value
+                    else:
+                        try:
+                            value = int(value)
+                        except ValueError:
+                            done[name] = value.strip()
+                        else:
+                            done[name] = value
+                        variables.remove(name)
+
+                        if (name.startswith('PY_') and
+                            name[3:] in renamed_variables):
+
+                            name = name[3:]
+                            if name not in done:
+                                done[name] = value
+
+            else:
+                # bogus variable reference (e.g. "prefix=$/opt/python");
+                # just drop it since we can't deal
+                done[name] = value
+                variables.remove(name)
+
+    # strip spurious spaces
+    for k, v in done.items():
+        if isinstance(v, str):
+            done[k] = v.strip()
+
+    # save the results in the global dictionary
+    vars.update(done)
+    return vars
+
+
+def get_makefile_filename():
+    """Return the path of the Makefile."""
+    if _PYTHON_BUILD:
+        return os.path.join(_PROJECT_BASE, "Makefile")
+    if hasattr(sys, 'abiflags'):
+        config_dir_name = 'config-%s%s' % (_PY_VERSION_SHORT, sys.abiflags)
+    else:
+        config_dir_name = 'config'
+    return os.path.join(get_path('stdlib'), config_dir_name, 'Makefile')
+
+
+def _init_posix(vars):
+    """Initialize the module as appropriate for POSIX systems."""
+    # load the installed Makefile:
+    makefile = get_makefile_filename()
+    try:
+        _parse_makefile(makefile, vars)
+    except IOError as e:
+        msg = "invalid Python installation: unable to open %s" % makefile
+        if hasattr(e, "strerror"):
+            msg = msg + " (%s)" % e.strerror
+        raise IOError(msg)
+    # load the installed pyconfig.h:
+    config_h = get_config_h_filename()
+    try:
+        with open(config_h) as f:
+            parse_config_h(f, vars)
+    except IOError as e:
+        msg = "invalid Python installation: unable to open %s" % config_h
+        if hasattr(e, "strerror"):
+            msg = msg + " (%s)" % e.strerror
+        raise IOError(msg)
+    # On AIX, there are wrong paths to the linker scripts in the Makefile
+    # -- these paths are relative to the Python source, but when installed
+    # the scripts are in another directory.
+    if _PYTHON_BUILD:
+        vars['LDSHARED'] = vars['BLDSHARED']
+
+
+def _init_non_posix(vars):
+    """Initialize the module as appropriate for NT"""
+    # set basic install directories
+    vars['LIBDEST'] = get_path('stdlib')
+    vars['BINLIBDEST'] = get_path('platstdlib')
+    vars['INCLUDEPY'] = get_path('include')
+    vars['SO'] = '.pyd'
+    vars['EXE'] = '.exe'
+    vars['VERSION'] = _PY_VERSION_SHORT_NO_DOT
+    vars['BINDIR'] = os.path.dirname(_safe_realpath(sys.executable))
+
+#
+# public APIs
+#
+
+
+def parse_config_h(fp, vars=None):
+    """Parse a config.h-style file.
+
+    A dictionary containing name/value pairs is returned.  If an
+    optional dictionary is passed in as the second argument, it is
+    used instead of a new dictionary.
+    """
+    if vars is None:
+        vars = {}
+    define_rx = re.compile("#define ([A-Z][A-Za-z0-9_]+) (.*)\n")
+    undef_rx = re.compile("/[*] #undef ([A-Z][A-Za-z0-9_]+) [*]/\n")
+
+    while True:
+        line = fp.readline()
+        if not line:
+            break
+        m = define_rx.match(line)
+        if m:
+            n, v = m.group(1, 2)
+            try:
+                v = int(v)
+            except ValueError:
+                pass
+            vars[n] = v
+        else:
+            m = undef_rx.match(line)
+            if m:
+                vars[m.group(1)] = 0
+    return vars
+
+
+def get_config_h_filename():
+    """Return the path of pyconfig.h."""
+    if _PYTHON_BUILD:
+        if os.name == "nt":
+            inc_dir = os.path.join(_PROJECT_BASE, "PC")
+        else:
+            inc_dir = _PROJECT_BASE
+    else:
+        inc_dir = get_path('platinclude')
+    return os.path.join(inc_dir, 'pyconfig.h')
+
+
+def get_scheme_names():
+    """Return a tuple containing the schemes names."""
+    return tuple(sorted(_SCHEMES.sections()))
+
+
+def get_path_names():
+    """Return a tuple containing the paths names."""
+    # xxx see if we want a static list
+    return _SCHEMES.options('posix_prefix')
+
+
+def get_paths(scheme=_get_default_scheme(), vars=None, expand=True):
+    """Return a mapping containing an install scheme.
+
+    ``scheme`` is the install scheme name. If not provided, it will
+    return the default scheme for the current platform.
+    """
+    _ensure_cfg_read()
+    if expand:
+        return _expand_vars(scheme, vars)
+    else:
+        return dict(_SCHEMES.items(scheme))
+
+
+def get_path(name, scheme=_get_default_scheme(), vars=None, expand=True):
+    """Return a path corresponding to the scheme.
+
+    ``scheme`` is the install scheme name.
+    """
+    return get_paths(scheme, vars, expand)[name]
+
+
+def get_config_vars(*args):
+    """With no arguments, return a dictionary of all configuration
+    variables relevant for the current platform.
+
+    On Unix, this means every variable defined in Python's installed Makefile;
+    On Windows and Mac OS it's a much smaller set.
+
+    With arguments, return a list of values that result from looking up
+    each argument in the configuration variable dictionary.
+    """
+    global _CONFIG_VARS
+    if _CONFIG_VARS is None:
+        _CONFIG_VARS = {}
+        # Normalized versions of prefix and exec_prefix are handy to have;
+        # in fact, these are the standard versions used most places in the
+        # distutils2 module.
+        _CONFIG_VARS['prefix'] = _PREFIX
+        _CONFIG_VARS['exec_prefix'] = _EXEC_PREFIX
+        _CONFIG_VARS['py_version'] = _PY_VERSION
+        _CONFIG_VARS['py_version_short'] = _PY_VERSION_SHORT
+        _CONFIG_VARS['py_version_nodot'] = _PY_VERSION[0] + _PY_VERSION[2]
+        _CONFIG_VARS['base'] = _PREFIX
+        _CONFIG_VARS['platbase'] = _EXEC_PREFIX
+        _CONFIG_VARS['projectbase'] = _PROJECT_BASE
+        try:
+            _CONFIG_VARS['abiflags'] = sys.abiflags
+        except AttributeError:
+            # sys.abiflags may not be defined on all platforms.
+            _CONFIG_VARS['abiflags'] = ''
+
+        if os.name in ('nt', 'os2'):
+            _init_non_posix(_CONFIG_VARS)
+        if os.name == 'posix':
+            _init_posix(_CONFIG_VARS)
+        # Setting 'userbase' is done below the call to the
+        # init function to enable using 'get_config_var' in
+        # the init-function.
+        if sys.version >= '2.6':
+            _CONFIG_VARS['userbase'] = _getuserbase()
+
+        if 'srcdir' not in _CONFIG_VARS:
+            _CONFIG_VARS['srcdir'] = _PROJECT_BASE
+        else:
+            _CONFIG_VARS['srcdir'] = _safe_realpath(_CONFIG_VARS['srcdir'])
+
+        # Convert srcdir into an absolute path if it appears necessary.
+        # Normally it is relative to the build directory.  However, during
+        # testing, for example, we might be running a non-installed python
+        # from a different directory.
+        if _PYTHON_BUILD and os.name == "posix":
+            base = _PROJECT_BASE
+            try:
+                cwd = os.getcwd()
+            except OSError:
+                cwd = None
+            if (not os.path.isabs(_CONFIG_VARS['srcdir']) and
+                base != cwd):
+                # srcdir is relative and we are not in the same directory
+                # as the executable. Assume executable is in the build
+                # directory and make srcdir absolute.
+                srcdir = os.path.join(base, _CONFIG_VARS['srcdir'])
+                _CONFIG_VARS['srcdir'] = os.path.normpath(srcdir)
+
+        if sys.platform == 'darwin':
+            kernel_version = os.uname()[2]  # Kernel version (8.4.3)
+            major_version = int(kernel_version.split('.')[0])
+
+            if major_version < 8:
+                # On Mac OS X before 10.4, check if -arch and -isysroot
+                # are in CFLAGS or LDFLAGS and remove them if they are.
+                # This is needed when building extensions on a 10.3 system
+                # using a universal build of python.
+                for key in ('LDFLAGS', 'BASECFLAGS',
+                        # a number of derived variables. These need to be
+                        # patched up as well.
+                        'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
+                    flags = _CONFIG_VARS[key]
+                    flags = re.sub(r'-arch\s+\w+\s', ' ', flags)
+                    flags = re.sub('-isysroot [^ \t]*', ' ', flags)
+                    _CONFIG_VARS[key] = flags
+            else:
+                # Allow the user to override the architecture flags using
+                # an environment variable.
+                # NOTE: This name was introduced by Apple in OSX 10.5 and
+                # is used by several scripting languages distributed with
+                # that OS release.
+                if 'ARCHFLAGS' in os.environ:
+                    arch = os.environ['ARCHFLAGS']
+                    for key in ('LDFLAGS', 'BASECFLAGS',
+                        # a number of derived variables. These need to be
+                        # patched up as well.
+                        'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
+
+                        flags = _CONFIG_VARS[key]
+                        flags = re.sub(r'-arch\s+\w+\s', ' ', flags)
+                        flags = flags + ' ' + arch
+                        _CONFIG_VARS[key] = flags
+
+                # If we're on OSX 10.5 or later and the user tries to
+                # compiles an extension using an SDK that is not present
+                # on the current machine it is better to not use an SDK
+                # than to fail.
+                #
+                # The major usecase for this is users using a Python.org
+                # binary installer  on OSX 10.6: that installer uses
+                # the 10.4u SDK, but that SDK is not installed by default
+                # when you install Xcode.
+                #
+                CFLAGS = _CONFIG_VARS.get('CFLAGS', '')
+                m = re.search(r'-isysroot\s+(\S+)', CFLAGS)
+                if m is not None:
+                    sdk = m.group(1)
+                    if not os.path.exists(sdk):
+                        for key in ('LDFLAGS', 'BASECFLAGS',
+                             # a number of derived variables. These need to be
+                             # patched up as well.
+                            'CFLAGS', 'PY_CFLAGS', 'BLDSHARED'):
+
+                            flags = _CONFIG_VARS[key]
+                            flags = re.sub(r'-isysroot\s+\S+(\s|$)', ' ', flags)
+                            _CONFIG_VARS[key] = flags
+
+    if args:
+        vals = []
+        for name in args:
+            vals.append(_CONFIG_VARS.get(name))
+        return vals
+    else:
+        return _CONFIG_VARS
+
+
+def get_config_var(name):
+    """Return the value of a single variable using the dictionary returned by
+    'get_config_vars()'.
+
+    Equivalent to get_config_vars().get(name)
+    """
+    return get_config_vars().get(name)
+
+
+def get_platform():
+    """Return a string that identifies the current platform.
+
+    This is used mainly to distinguish platform-specific build directories and
+    platform-specific built distributions.  Typically includes the OS name
+    and version and the architecture (as supplied by 'os.uname()'),
+    although the exact information included depends on the OS; eg. for IRIX
+    the architecture isn't particularly important (IRIX only runs on SGI
+    hardware), but for Linux the kernel version isn't particularly
+    important.
+
+    Examples of returned values:
+       linux-i586
+       linux-alpha (?)
+       solaris-2.6-sun4u
+       irix-5.3
+       irix64-6.2
+
+    Windows will return one of:
+       win-amd64 (64bit Windows on AMD64 (aka x86_64, Intel64, EM64T, etc)
+       win-ia64 (64bit Windows on Itanium)
+       win32 (all others - specifically, sys.platform is returned)
+
+    For other non-POSIX platforms, currently just returns 'sys.platform'.
+    """
+    if os.name == 'nt':
+        # sniff sys.version for architecture.
+        prefix = " bit ("
+        i = sys.version.find(prefix)
+        if i == -1:
+            return sys.platform
+        j = sys.version.find(")", i)
+        look = sys.version[i+len(prefix):j].lower()
+        if look == 'amd64':
+            return 'win-amd64'
+        if look == 'itanium':
+            return 'win-ia64'
+        return sys.platform
+
+    if os.name != "posix" or not hasattr(os, 'uname'):
+        # XXX what about the architecture? NT is Intel or Alpha,
+        # Mac OS is M68k or PPC, etc.
+        return sys.platform
+
+    # Try to distinguish various flavours of Unix
+    osname, host, release, version, machine = os.uname()
+
+    # Convert the OS name to lowercase, remove '/' characters
+    # (to accommodate BSD/OS), and translate spaces (for "Power Macintosh")
+    osname = osname.lower().replace('/', '')
+    machine = machine.replace(' ', '_')
+    machine = machine.replace('/', '-')
+
+    if osname[:5] == "linux":
+        # At least on Linux/Intel, 'machine' is the processor --
+        # i386, etc.
+        # XXX what about Alpha, SPARC, etc?
+        return  "%s-%s" % (osname, machine)
+    elif osname[:5] == "sunos":
+        if release[0] >= "5":           # SunOS 5 == Solaris 2
+            osname = "solaris"
+            release = "%d.%s" % (int(release[0]) - 3, release[2:])
+        # fall through to standard osname-release-machine representation
+    elif osname[:4] == "irix":              # could be "irix64"!
+        return "%s-%s" % (osname, release)
+    elif osname[:3] == "aix":
+        return "%s-%s.%s" % (osname, version, release)
+    elif osname[:6] == "cygwin":
+        osname = "cygwin"
+        rel_re = re.compile(r'[\d.]+')
+        m = rel_re.match(release)
+        if m:
+            release = m.group()
+    elif osname[:6] == "darwin":
+        #
+        # For our purposes, we'll assume that the system version from
+        # distutils' perspective is what MACOSX_DEPLOYMENT_TARGET is set
+        # to. This makes the compatibility story a bit more sane because the
+        # machine is going to compile and link as if it were
+        # MACOSX_DEPLOYMENT_TARGET.
+        cfgvars = get_config_vars()
+        macver = cfgvars.get('MACOSX_DEPLOYMENT_TARGET')
+
+        if True:
+            # Always calculate the release of the running machine,
+            # needed to determine if we can build fat binaries or not.
+
+            macrelease = macver
+            # Get the system version. Reading this plist is a documented
+            # way to get the system version (see the documentation for
+            # the Gestalt Manager)
+            try:
+                f = open('/System/Library/CoreServices/SystemVersion.plist')
+            except IOError:
+                # We're on a plain darwin box, fall back to the default
+                # behaviour.
+                pass
+            else:
+                try:
+                    m = re.search(r'<key>ProductUserVisibleVersion</key>\s*'
+                                  r'<string>(.*?)</string>', f.read())
+                finally:
+                    f.close()
+                if m is not None:
+                    macrelease = '.'.join(m.group(1).split('.')[:2])
+                # else: fall back to the default behaviour
+
+        if not macver:
+            macver = macrelease
+
+        if macver:
+            release = macver
+            osname = "macosx"
+
+            if ((macrelease + '.') >= '10.4.' and
+                '-arch' in get_config_vars().get('CFLAGS', '').strip()):
+                # The universal build will build fat binaries, but not on
+                # systems before 10.4
+                #
+                # Try to detect 4-way universal builds, those have machine-type
+                # 'universal' instead of 'fat'.
+
+                machine = 'fat'
+                cflags = get_config_vars().get('CFLAGS')
+
+                archs = re.findall(r'-arch\s+(\S+)', cflags)
+                archs = tuple(sorted(set(archs)))
+
+                if len(archs) == 1:
+                    machine = archs[0]
+                elif archs == ('i386', 'ppc'):
+                    machine = 'fat'
+                elif archs == ('i386', 'x86_64'):
+                    machine = 'intel'
+                elif archs == ('i386', 'ppc', 'x86_64'):
+                    machine = 'fat3'
+                elif archs == ('ppc64', 'x86_64'):
+                    machine = 'fat64'
+                elif archs == ('i386', 'ppc', 'ppc64', 'x86_64'):
+                    machine = 'universal'
+                else:
+                    raise ValueError(
+                       "Don't know machine value for archs=%r" % (archs,))
+
+            elif machine == 'i386':
+                # On OSX the machine type returned by uname is always the
+                # 32-bit variant, even if the executable architecture is
+                # the 64-bit variant
+                if sys.maxsize >= 2**32:
+                    machine = 'x86_64'
+
+            elif machine in ('PowerPC', 'Power_Macintosh'):
+                # Pick a sane name for the PPC architecture.
+                # See 'i386' case
+                if sys.maxsize >= 2**32:
+                    machine = 'ppc64'
+                else:
+                    machine = 'ppc'
+
+    return "%s-%s-%s" % (osname, release, machine)
+
+
+def get_python_version():
+    return _PY_VERSION_SHORT
+
+
+def _print_dict(title, data):
+    for index, (key, value) in enumerate(sorted(data.items())):
+        if index == 0:
+            print('%s: ' % (title))
+        print('\t%s = "%s"' % (key, value))
+
+
+def _main():
+    """Display all information sysconfig detains."""
+    print('Platform: "%s"' % get_platform())
+    print('Python version: "%s"' % get_python_version())
+    print('Current installation scheme: "%s"' % _get_default_scheme())
+    print()
+    _print_dict('Paths', get_paths())
+    print()
+    _print_dict('Variables', get_config_vars())
+
+
+if __name__ == '__main__':
+    _main()
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/_backport/tarfile.py b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/tarfile.py
new file mode 100644
index 000000000..d66d85663
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/_backport/tarfile.py
@@ -0,0 +1,2607 @@
+#-------------------------------------------------------------------
+# tarfile.py
+#-------------------------------------------------------------------
+# Copyright (C) 2002 Lars Gustaebel <lars@gustaebel.de>
+# All rights reserved.
+#
+# Permission  is  hereby granted,  free  of charge,  to  any person
+# obtaining a  copy of  this software  and associated documentation
+# files  (the  "Software"),  to   deal  in  the  Software   without
+# restriction,  including  without limitation  the  rights to  use,
+# copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies  of  the  Software,  and to  permit  persons  to  whom the
+# Software  is  furnished  to  do  so,  subject  to  the  following
+# conditions:
+#
+# The above copyright  notice and this  permission notice shall  be
+# included in all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS  IS", WITHOUT WARRANTY OF ANY  KIND,
+# EXPRESS OR IMPLIED, INCLUDING  BUT NOT LIMITED TO  THE WARRANTIES
+# OF  MERCHANTABILITY,  FITNESS   FOR  A  PARTICULAR   PURPOSE  AND
+# NONINFRINGEMENT.  IN  NO  EVENT SHALL  THE  AUTHORS  OR COPYRIGHT
+# HOLDERS  BE LIABLE  FOR ANY  CLAIM, DAMAGES  OR OTHER  LIABILITY,
+# WHETHER  IN AN  ACTION OF  CONTRACT, TORT  OR OTHERWISE,  ARISING
+# FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR
+# OTHER DEALINGS IN THE SOFTWARE.
+#
+from __future__ import print_function
+
+"""Read from and write to tar format archives.
+"""
+
+__version__ = "$Revision$"
+
+version     = "0.9.0"
+__author__  = "Lars Gust\u00e4bel (lars@gustaebel.de)"
+__date__    = "$Date: 2011-02-25 17:42:01 +0200 (Fri, 25 Feb 2011) $"
+__cvsid__   = "$Id: tarfile.py 88586 2011-02-25 15:42:01Z marc-andre.lemburg $"
+__credits__ = "Gustavo Niemeyer, Niels Gust\u00e4bel, Richard Townsend."
+
+#---------
+# Imports
+#---------
+import sys
+import os
+import stat
+import errno
+import time
+import struct
+import copy
+import re
+
+try:
+    import grp, pwd
+except ImportError:
+    grp = pwd = None
+
+# os.symlink on Windows prior to 6.0 raises NotImplementedError
+symlink_exception = (AttributeError, NotImplementedError)
+try:
+    # WindowsError (1314) will be raised if the caller does not hold the
+    # SeCreateSymbolicLinkPrivilege privilege
+    symlink_exception += (WindowsError,)
+except NameError:
+    pass
+
+# from tarfile import *
+__all__ = ["TarFile", "TarInfo", "is_tarfile", "TarError"]
+
+if sys.version_info[0] < 3:
+    import __builtin__ as builtins
+else:
+    import builtins
+
+_open = builtins.open   # Since 'open' is TarFile.open
+
+#---------------------------------------------------------
+# tar constants
+#---------------------------------------------------------
+NUL = b"\0"                     # the null character
+BLOCKSIZE = 512                 # length of processing blocks
+RECORDSIZE = BLOCKSIZE * 20     # length of records
+GNU_MAGIC = b"ustar  \0"        # magic gnu tar string
+POSIX_MAGIC = b"ustar\x0000"    # magic posix tar string
+
+LENGTH_NAME = 100               # maximum length of a filename
+LENGTH_LINK = 100               # maximum length of a linkname
+LENGTH_PREFIX = 155             # maximum length of the prefix field
+
+REGTYPE = b"0"                  # regular file
+AREGTYPE = b"\0"                # regular file
+LNKTYPE = b"1"                  # link (inside tarfile)
+SYMTYPE = b"2"                  # symbolic link
+CHRTYPE = b"3"                  # character special device
+BLKTYPE = b"4"                  # block special device
+DIRTYPE = b"5"                  # directory
+FIFOTYPE = b"6"                 # fifo special device
+CONTTYPE = b"7"                 # contiguous file
+
+GNUTYPE_LONGNAME = b"L"         # GNU tar longname
+GNUTYPE_LONGLINK = b"K"         # GNU tar longlink
+GNUTYPE_SPARSE = b"S"           # GNU tar sparse file
+
+XHDTYPE = b"x"                  # POSIX.1-2001 extended header
+XGLTYPE = b"g"                  # POSIX.1-2001 global header
+SOLARIS_XHDTYPE = b"X"          # Solaris extended header
+
+USTAR_FORMAT = 0                # POSIX.1-1988 (ustar) format
+GNU_FORMAT = 1                  # GNU tar format
+PAX_FORMAT = 2                  # POSIX.1-2001 (pax) format
+DEFAULT_FORMAT = GNU_FORMAT
+
+#---------------------------------------------------------
+# tarfile constants
+#---------------------------------------------------------
+# File types that tarfile supports:
+SUPPORTED_TYPES = (REGTYPE, AREGTYPE, LNKTYPE,
+                   SYMTYPE, DIRTYPE, FIFOTYPE,
+                   CONTTYPE, CHRTYPE, BLKTYPE,
+                   GNUTYPE_LONGNAME, GNUTYPE_LONGLINK,
+                   GNUTYPE_SPARSE)
+
+# File types that will be treated as a regular file.
+REGULAR_TYPES = (REGTYPE, AREGTYPE,
+                 CONTTYPE, GNUTYPE_SPARSE)
+
+# File types that are part of the GNU tar format.
+GNU_TYPES = (GNUTYPE_LONGNAME, GNUTYPE_LONGLINK,
+             GNUTYPE_SPARSE)
+
+# Fields from a pax header that override a TarInfo attribute.
+PAX_FIELDS = ("path", "linkpath", "size", "mtime",
+              "uid", "gid", "uname", "gname")
+
+# Fields from a pax header that are affected by hdrcharset.
+PAX_NAME_FIELDS = set(("path", "linkpath", "uname", "gname"))
+
+# Fields in a pax header that are numbers, all other fields
+# are treated as strings.
+PAX_NUMBER_FIELDS = {
+    "atime": float,
+    "ctime": float,
+    "mtime": float,
+    "uid": int,
+    "gid": int,
+    "size": int
+}
+
+#---------------------------------------------------------
+# Bits used in the mode field, values in octal.
+#---------------------------------------------------------
+S_IFLNK = 0o120000        # symbolic link
+S_IFREG = 0o100000        # regular file
+S_IFBLK = 0o060000        # block device
+S_IFDIR = 0o040000        # directory
+S_IFCHR = 0o020000        # character device
+S_IFIFO = 0o010000        # fifo
+
+TSUID   = 0o4000          # set UID on execution
+TSGID   = 0o2000          # set GID on execution
+TSVTX   = 0o1000          # reserved
+
+TUREAD  = 0o400           # read by owner
+TUWRITE = 0o200           # write by owner
+TUEXEC  = 0o100           # execute/search by owner
+TGREAD  = 0o040           # read by group
+TGWRITE = 0o020           # write by group
+TGEXEC  = 0o010           # execute/search by group
+TOREAD  = 0o004           # read by other
+TOWRITE = 0o002           # write by other
+TOEXEC  = 0o001           # execute/search by other
+
+#---------------------------------------------------------
+# initialization
+#---------------------------------------------------------
+if os.name in ("nt", "ce"):
+    ENCODING = "utf-8"
+else:
+    ENCODING = sys.getfilesystemencoding()
+
+#---------------------------------------------------------
+# Some useful functions
+#---------------------------------------------------------
+
+def stn(s, length, encoding, errors):
+    """Convert a string to a null-terminated bytes object.
+    """
+    s = s.encode(encoding, errors)
+    return s[:length] + (length - len(s)) * NUL
+
+def nts(s, encoding, errors):
+    """Convert a null-terminated bytes object to a string.
+    """
+    p = s.find(b"\0")
+    if p != -1:
+        s = s[:p]
+    return s.decode(encoding, errors)
+
+def nti(s):
+    """Convert a number field to a python number.
+    """
+    # There are two possible encodings for a number field, see
+    # itn() below.
+    if s[0] != chr(0o200):
+        try:
+            n = int(nts(s, "ascii", "strict") or "0", 8)
+        except ValueError:
+            raise InvalidHeaderError("invalid header")
+    else:
+        n = 0
+        for i in range(len(s) - 1):
+            n <<= 8
+            n += ord(s[i + 1])
+    return n
+
+def itn(n, digits=8, format=DEFAULT_FORMAT):
+    """Convert a python number to a number field.
+    """
+    # POSIX 1003.1-1988 requires numbers to be encoded as a string of
+    # octal digits followed by a null-byte, this allows values up to
+    # (8**(digits-1))-1. GNU tar allows storing numbers greater than
+    # that if necessary. A leading 0o200 byte indicates this particular
+    # encoding, the following digits-1 bytes are a big-endian
+    # representation. This allows values up to (256**(digits-1))-1.
+    if 0 <= n < 8 ** (digits - 1):
+        s = ("%0*o" % (digits - 1, n)).encode("ascii") + NUL
+    else:
+        if format != GNU_FORMAT or n >= 256 ** (digits - 1):
+            raise ValueError("overflow in number field")
+
+        if n < 0:
+            # XXX We mimic GNU tar's behaviour with negative numbers,
+            # this could raise OverflowError.
+            n = struct.unpack("L", struct.pack("l", n))[0]
+
+        s = bytearray()
+        for i in range(digits - 1):
+            s.insert(0, n & 0o377)
+            n >>= 8
+        s.insert(0, 0o200)
+    return s
+
+def calc_chksums(buf):
+    """Calculate the checksum for a member's header by summing up all
+       characters except for the chksum field which is treated as if
+       it was filled with spaces. According to the GNU tar sources,
+       some tars (Sun and NeXT) calculate chksum with signed char,
+       which will be different if there are chars in the buffer with
+       the high bit set. So we calculate two checksums, unsigned and
+       signed.
+    """
+    unsigned_chksum = 256 + sum(struct.unpack("148B", buf[:148]) + struct.unpack("356B", buf[156:512]))
+    signed_chksum = 256 + sum(struct.unpack("148b", buf[:148]) + struct.unpack("356b", buf[156:512]))
+    return unsigned_chksum, signed_chksum
+
+def copyfileobj(src, dst, length=None):
+    """Copy length bytes from fileobj src to fileobj dst.
+       If length is None, copy the entire content.
+    """
+    if length == 0:
+        return
+    if length is None:
+        while True:
+            buf = src.read(16*1024)
+            if not buf:
+                break
+            dst.write(buf)
+        return
+
+    BUFSIZE = 16 * 1024
+    blocks, remainder = divmod(length, BUFSIZE)
+    for b in range(blocks):
+        buf = src.read(BUFSIZE)
+        if len(buf) < BUFSIZE:
+            raise IOError("end of file reached")
+        dst.write(buf)
+
+    if remainder != 0:
+        buf = src.read(remainder)
+        if len(buf) < remainder:
+            raise IOError("end of file reached")
+        dst.write(buf)
+    return
+
+filemode_table = (
+    ((S_IFLNK,      "l"),
+     (S_IFREG,      "-"),
+     (S_IFBLK,      "b"),
+     (S_IFDIR,      "d"),
+     (S_IFCHR,      "c"),
+     (S_IFIFO,      "p")),
+
+    ((TUREAD,       "r"),),
+    ((TUWRITE,      "w"),),
+    ((TUEXEC|TSUID, "s"),
+     (TSUID,        "S"),
+     (TUEXEC,       "x")),
+
+    ((TGREAD,       "r"),),
+    ((TGWRITE,      "w"),),
+    ((TGEXEC|TSGID, "s"),
+     (TSGID,        "S"),
+     (TGEXEC,       "x")),
+
+    ((TOREAD,       "r"),),
+    ((TOWRITE,      "w"),),
+    ((TOEXEC|TSVTX, "t"),
+     (TSVTX,        "T"),
+     (TOEXEC,       "x"))
+)
+
+def filemode(mode):
+    """Convert a file's mode to a string of the form
+       -rwxrwxrwx.
+       Used by TarFile.list()
+    """
+    perm = []
+    for table in filemode_table:
+        for bit, char in table:
+            if mode & bit == bit:
+                perm.append(char)
+                break
+        else:
+            perm.append("-")
+    return "".join(perm)
+
+class TarError(Exception):
+    """Base exception."""
+    pass
+class ExtractError(TarError):
+    """General exception for extract errors."""
+    pass
+class ReadError(TarError):
+    """Exception for unreadable tar archives."""
+    pass
+class CompressionError(TarError):
+    """Exception for unavailable compression methods."""
+    pass
+class StreamError(TarError):
+    """Exception for unsupported operations on stream-like TarFiles."""
+    pass
+class HeaderError(TarError):
+    """Base exception for header errors."""
+    pass
+class EmptyHeaderError(HeaderError):
+    """Exception for empty headers."""
+    pass
+class TruncatedHeaderError(HeaderError):
+    """Exception for truncated headers."""
+    pass
+class EOFHeaderError(HeaderError):
+    """Exception for end of file headers."""
+    pass
+class InvalidHeaderError(HeaderError):
+    """Exception for invalid headers."""
+    pass
+class SubsequentHeaderError(HeaderError):
+    """Exception for missing and invalid extended headers."""
+    pass
+
+#---------------------------
+# internal stream interface
+#---------------------------
+class _LowLevelFile(object):
+    """Low-level file object. Supports reading and writing.
+       It is used instead of a regular file object for streaming
+       access.
+    """
+
+    def __init__(self, name, mode):
+        mode = {
+            "r": os.O_RDONLY,
+            "w": os.O_WRONLY | os.O_CREAT | os.O_TRUNC,
+        }[mode]
+        if hasattr(os, "O_BINARY"):
+            mode |= os.O_BINARY
+        self.fd = os.open(name, mode, 0o666)
+
+    def close(self):
+        os.close(self.fd)
+
+    def read(self, size):
+        return os.read(self.fd, size)
+
+    def write(self, s):
+        os.write(self.fd, s)
+
+class _Stream(object):
+    """Class that serves as an adapter between TarFile and
+       a stream-like object.  The stream-like object only
+       needs to have a read() or write() method and is accessed
+       blockwise.  Use of gzip or bzip2 compression is possible.
+       A stream-like object could be for example: sys.stdin,
+       sys.stdout, a socket, a tape device etc.
+
+       _Stream is intended to be used only internally.
+    """
+
+    def __init__(self, name, mode, comptype, fileobj, bufsize):
+        """Construct a _Stream object.
+        """
+        self._extfileobj = True
+        if fileobj is None:
+            fileobj = _LowLevelFile(name, mode)
+            self._extfileobj = False
+
+        if comptype == '*':
+            # Enable transparent compression detection for the
+            # stream interface
+            fileobj = _StreamProxy(fileobj)
+            comptype = fileobj.getcomptype()
+
+        self.name     = name or ""
+        self.mode     = mode
+        self.comptype = comptype
+        self.fileobj  = fileobj
+        self.bufsize  = bufsize
+        self.buf      = b""
+        self.pos      = 0
+        self.closed   = False
+
+        try:
+            if comptype == "gz":
+                try:
+                    import zlib
+                except ImportError:
+                    raise CompressionError("zlib module is not available")
+                self.zlib = zlib
+                self.crc = zlib.crc32(b"")
+                if mode == "r":
+                    self._init_read_gz()
+                else:
+                    self._init_write_gz()
+
+            if comptype == "bz2":
+                try:
+                    import bz2
+                except ImportError:
+                    raise CompressionError("bz2 module is not available")
+                if mode == "r":
+                    self.dbuf = b""
+                    self.cmp = bz2.BZ2Decompressor()
+                else:
+                    self.cmp = bz2.BZ2Compressor()
+        except:
+            if not self._extfileobj:
+                self.fileobj.close()
+            self.closed = True
+            raise
+
+    def __del__(self):
+        if hasattr(self, "closed") and not self.closed:
+            self.close()
+
+    def _init_write_gz(self):
+        """Initialize for writing with gzip compression.
+        """
+        self.cmp = self.zlib.compressobj(9, self.zlib.DEFLATED,
+                                            -self.zlib.MAX_WBITS,
+                                            self.zlib.DEF_MEM_LEVEL,
+                                            0)
+        timestamp = struct.pack("<L", int(time.time()))
+        self.__write(b"\037\213\010\010" + timestamp + b"\002\377")
+        if self.name.endswith(".gz"):
+            self.name = self.name[:-3]
+        # RFC1952 says we must use ISO-8859-1 for the FNAME field.
+        self.__write(self.name.encode("iso-8859-1", "replace") + NUL)
+
+    def write(self, s):
+        """Write string s to the stream.
+        """
+        if self.comptype == "gz":
+            self.crc = self.zlib.crc32(s, self.crc)
+        self.pos += len(s)
+        if self.comptype != "tar":
+            s = self.cmp.compress(s)
+        self.__write(s)
+
+    def __write(self, s):
+        """Write string s to the stream if a whole new block
+           is ready to be written.
+        """
+        self.buf += s
+        while len(self.buf) > self.bufsize:
+            self.fileobj.write(self.buf[:self.bufsize])
+            self.buf = self.buf[self.bufsize:]
+
+    def close(self):
+        """Close the _Stream object. No operation should be
+           done on it afterwards.
+        """
+        if self.closed:
+            return
+
+        if self.mode == "w" and self.comptype != "tar":
+            self.buf += self.cmp.flush()
+
+        if self.mode == "w" and self.buf:
+            self.fileobj.write(self.buf)
+            self.buf = b""
+            if self.comptype == "gz":
+                # The native zlib crc is an unsigned 32-bit integer, but
+                # the Python wrapper implicitly casts that to a signed C
+                # long.  So, on a 32-bit box self.crc may "look negative",
+                # while the same crc on a 64-bit box may "look positive".
+                # To avoid irksome warnings from the `struct` module, force
+                # it to look positive on all boxes.
+                self.fileobj.write(struct.pack("<L", self.crc & 0xffffffff))
+                self.fileobj.write(struct.pack("<L", self.pos & 0xffffFFFF))
+
+        if not self._extfileobj:
+            self.fileobj.close()
+
+        self.closed = True
+
+    def _init_read_gz(self):
+        """Initialize for reading a gzip compressed fileobj.
+        """
+        self.cmp = self.zlib.decompressobj(-self.zlib.MAX_WBITS)
+        self.dbuf = b""
+
+        # taken from gzip.GzipFile with some alterations
+        if self.__read(2) != b"\037\213":
+            raise ReadError("not a gzip file")
+        if self.__read(1) != b"\010":
+            raise CompressionError("unsupported compression method")
+
+        flag = ord(self.__read(1))
+        self.__read(6)
+
+        if flag & 4:
+            xlen = ord(self.__read(1)) + 256 * ord(self.__read(1))
+            self.read(xlen)
+        if flag & 8:
+            while True:
+                s = self.__read(1)
+                if not s or s == NUL:
+                    break
+        if flag & 16:
+            while True:
+                s = self.__read(1)
+                if not s or s == NUL:
+                    break
+        if flag & 2:
+            self.__read(2)
+
+    def tell(self):
+        """Return the stream's file pointer position.
+        """
+        return self.pos
+
+    def seek(self, pos=0):
+        """Set the stream's file pointer to pos. Negative seeking
+           is forbidden.
+        """
+        if pos - self.pos >= 0:
+            blocks, remainder = divmod(pos - self.pos, self.bufsize)
+            for i in range(blocks):
+                self.read(self.bufsize)
+            self.read(remainder)
+        else:
+            raise StreamError("seeking backwards is not allowed")
+        return self.pos
+
+    def read(self, size=None):
+        """Return the next size number of bytes from the stream.
+           If size is not defined, return all bytes of the stream
+           up to EOF.
+        """
+        if size is None:
+            t = []
+            while True:
+                buf = self._read(self.bufsize)
+                if not buf:
+                    break
+                t.append(buf)
+            buf = "".join(t)
+        else:
+            buf = self._read(size)
+        self.pos += len(buf)
+        return buf
+
+    def _read(self, size):
+        """Return size bytes from the stream.
+        """
+        if self.comptype == "tar":
+            return self.__read(size)
+
+        c = len(self.dbuf)
+        while c < size:
+            buf = self.__read(self.bufsize)
+            if not buf:
+                break
+            try:
+                buf = self.cmp.decompress(buf)
+            except IOError:
+                raise ReadError("invalid compressed data")
+            self.dbuf += buf
+            c += len(buf)
+        buf = self.dbuf[:size]
+        self.dbuf = self.dbuf[size:]
+        return buf
+
+    def __read(self, size):
+        """Return size bytes from stream. If internal buffer is empty,
+           read another block from the stream.
+        """
+        c = len(self.buf)
+        while c < size:
+            buf = self.fileobj.read(self.bufsize)
+            if not buf:
+                break
+            self.buf += buf
+            c += len(buf)
+        buf = self.buf[:size]
+        self.buf = self.buf[size:]
+        return buf
+# class _Stream
+
+class _StreamProxy(object):
+    """Small proxy class that enables transparent compression
+       detection for the Stream interface (mode 'r|*').
+    """
+
+    def __init__(self, fileobj):
+        self.fileobj = fileobj
+        self.buf = self.fileobj.read(BLOCKSIZE)
+
+    def read(self, size):
+        self.read = self.fileobj.read
+        return self.buf
+
+    def getcomptype(self):
+        if self.buf.startswith(b"\037\213\010"):
+            return "gz"
+        if self.buf.startswith(b"BZh91"):
+            return "bz2"
+        return "tar"
+
+    def close(self):
+        self.fileobj.close()
+# class StreamProxy
+
+class _BZ2Proxy(object):
+    """Small proxy class that enables external file object
+       support for "r:bz2" and "w:bz2" modes. This is actually
+       a workaround for a limitation in bz2 module's BZ2File
+       class which (unlike gzip.GzipFile) has no support for
+       a file object argument.
+    """
+
+    blocksize = 16 * 1024
+
+    def __init__(self, fileobj, mode):
+        self.fileobj = fileobj
+        self.mode = mode
+        self.name = getattr(self.fileobj, "name", None)
+        self.init()
+
+    def init(self):
+        import bz2
+        self.pos = 0
+        if self.mode == "r":
+            self.bz2obj = bz2.BZ2Decompressor()
+            self.fileobj.seek(0)
+            self.buf = b""
+        else:
+            self.bz2obj = bz2.BZ2Compressor()
+
+    def read(self, size):
+        x = len(self.buf)
+        while x < size:
+            raw = self.fileobj.read(self.blocksize)
+            if not raw:
+                break
+            data = self.bz2obj.decompress(raw)
+            self.buf += data
+            x += len(data)
+
+        buf = self.buf[:size]
+        self.buf = self.buf[size:]
+        self.pos += len(buf)
+        return buf
+
+    def seek(self, pos):
+        if pos < self.pos:
+            self.init()
+        self.read(pos - self.pos)
+
+    def tell(self):
+        return self.pos
+
+    def write(self, data):
+        self.pos += len(data)
+        raw = self.bz2obj.compress(data)
+        self.fileobj.write(raw)
+
+    def close(self):
+        if self.mode == "w":
+            raw = self.bz2obj.flush()
+            self.fileobj.write(raw)
+# class _BZ2Proxy
+
+#------------------------
+# Extraction file object
+#------------------------
+class _FileInFile(object):
+    """A thin wrapper around an existing file object that
+       provides a part of its data as an individual file
+       object.
+    """
+
+    def __init__(self, fileobj, offset, size, blockinfo=None):
+        self.fileobj = fileobj
+        self.offset = offset
+        self.size = size
+        self.position = 0
+
+        if blockinfo is None:
+            blockinfo = [(0, size)]
+
+        # Construct a map with data and zero blocks.
+        self.map_index = 0
+        self.map = []
+        lastpos = 0
+        realpos = self.offset
+        for offset, size in blockinfo:
+            if offset > lastpos:
+                self.map.append((False, lastpos, offset, None))
+            self.map.append((True, offset, offset + size, realpos))
+            realpos += size
+            lastpos = offset + size
+        if lastpos < self.size:
+            self.map.append((False, lastpos, self.size, None))
+
+    def seekable(self):
+        if not hasattr(self.fileobj, "seekable"):
+            # XXX gzip.GzipFile and bz2.BZ2File
+            return True
+        return self.fileobj.seekable()
+
+    def tell(self):
+        """Return the current file position.
+        """
+        return self.position
+
+    def seek(self, position):
+        """Seek to a position in the file.
+        """
+        self.position = position
+
+    def read(self, size=None):
+        """Read data from the file.
+        """
+        if size is None:
+            size = self.size - self.position
+        else:
+            size = min(size, self.size - self.position)
+
+        buf = b""
+        while size > 0:
+            while True:
+                data, start, stop, offset = self.map[self.map_index]
+                if start <= self.position < stop:
+                    break
+                else:
+                    self.map_index += 1
+                    if self.map_index == len(self.map):
+                        self.map_index = 0
+            length = min(size, stop - self.position)
+            if data:
+                self.fileobj.seek(offset + (self.position - start))
+                buf += self.fileobj.read(length)
+            else:
+                buf += NUL * length
+            size -= length
+            self.position += length
+        return buf
+#class _FileInFile
+
+
+class ExFileObject(object):
+    """File-like object for reading an archive member.
+       Is returned by TarFile.extractfile().
+    """
+    blocksize = 1024
+
+    def __init__(self, tarfile, tarinfo):
+        self.fileobj = _FileInFile(tarfile.fileobj,
+                                   tarinfo.offset_data,
+                                   tarinfo.size,
+                                   tarinfo.sparse)
+        self.name = tarinfo.name
+        self.mode = "r"
+        self.closed = False
+        self.size = tarinfo.size
+
+        self.position = 0
+        self.buffer = b""
+
+    def readable(self):
+        return True
+
+    def writable(self):
+        return False
+
+    def seekable(self):
+        return self.fileobj.seekable()
+
+    def read(self, size=None):
+        """Read at most size bytes from the file. If size is not
+           present or None, read all data until EOF is reached.
+        """
+        if self.closed:
+            raise ValueError("I/O operation on closed file")
+
+        buf = b""
+        if self.buffer:
+            if size is None:
+                buf = self.buffer
+                self.buffer = b""
+            else:
+                buf = self.buffer[:size]
+                self.buffer = self.buffer[size:]
+
+        if size is None:
+            buf += self.fileobj.read()
+        else:
+            buf += self.fileobj.read(size - len(buf))
+
+        self.position += len(buf)
+        return buf
+
+    # XXX TextIOWrapper uses the read1() method.
+    read1 = read
+
+    def readline(self, size=-1):
+        """Read one entire line from the file. If size is present
+           and non-negative, return a string with at most that
+           size, which may be an incomplete line.
+        """
+        if self.closed:
+            raise ValueError("I/O operation on closed file")
+
+        pos = self.buffer.find(b"\n") + 1
+        if pos == 0:
+            # no newline found.
+            while True:
+                buf = self.fileobj.read(self.blocksize)
+                self.buffer += buf
+                if not buf or b"\n" in buf:
+                    pos = self.buffer.find(b"\n") + 1
+                    if pos == 0:
+                        # no newline found.
+                        pos = len(self.buffer)
+                    break
+
+        if size != -1:
+            pos = min(size, pos)
+
+        buf = self.buffer[:pos]
+        self.buffer = self.buffer[pos:]
+        self.position += len(buf)
+        return buf
+
+    def readlines(self):
+        """Return a list with all remaining lines.
+        """
+        result = []
+        while True:
+            line = self.readline()
+            if not line: break
+            result.append(line)
+        return result
+
+    def tell(self):
+        """Return the current file position.
+        """
+        if self.closed:
+            raise ValueError("I/O operation on closed file")
+
+        return self.position
+
+    def seek(self, pos, whence=os.SEEK_SET):
+        """Seek to a position in the file.
+        """
+        if self.closed:
+            raise ValueError("I/O operation on closed file")
+
+        if whence == os.SEEK_SET:
+            self.position = min(max(pos, 0), self.size)
+        elif whence == os.SEEK_CUR:
+            if pos < 0:
+                self.position = max(self.position + pos, 0)
+            else:
+                self.position = min(self.position + pos, self.size)
+        elif whence == os.SEEK_END:
+            self.position = max(min(self.size + pos, self.size), 0)
+        else:
+            raise ValueError("Invalid argument")
+
+        self.buffer = b""
+        self.fileobj.seek(self.position)
+
+    def close(self):
+        """Close the file object.
+        """
+        self.closed = True
+
+    def __iter__(self):
+        """Get an iterator over the file's lines.
+        """
+        while True:
+            line = self.readline()
+            if not line:
+                break
+            yield line
+#class ExFileObject
+
+#------------------
+# Exported Classes
+#------------------
+class TarInfo(object):
+    """Informational class which holds the details about an
+       archive member given by a tar header block.
+       TarInfo objects are returned by TarFile.getmember(),
+       TarFile.getmembers() and TarFile.gettarinfo() and are
+       usually created internally.
+    """
+
+    __slots__ = ("name", "mode", "uid", "gid", "size", "mtime",
+                 "chksum", "type", "linkname", "uname", "gname",
+                 "devmajor", "devminor",
+                 "offset", "offset_data", "pax_headers", "sparse",
+                 "tarfile", "_sparse_structs", "_link_target")
+
+    def __init__(self, name=""):
+        """Construct a TarInfo object. name is the optional name
+           of the member.
+        """
+        self.name = name        # member name
+        self.mode = 0o644       # file permissions
+        self.uid = 0            # user id
+        self.gid = 0            # group id
+        self.size = 0           # file size
+        self.mtime = 0          # modification time
+        self.chksum = 0         # header checksum
+        self.type = REGTYPE     # member type
+        self.linkname = ""      # link name
+        self.uname = ""         # user name
+        self.gname = ""         # group name
+        self.devmajor = 0       # device major number
+        self.devminor = 0       # device minor number
+
+        self.offset = 0         # the tar header starts here
+        self.offset_data = 0    # the file's data starts here
+
+        self.sparse = None      # sparse member information
+        self.pax_headers = {}   # pax header information
+
+    # In pax headers the "name" and "linkname" field are called
+    # "path" and "linkpath".
+    def _getpath(self):
+        return self.name
+    def _setpath(self, name):
+        self.name = name
+    path = property(_getpath, _setpath)
+
+    def _getlinkpath(self):
+        return self.linkname
+    def _setlinkpath(self, linkname):
+        self.linkname = linkname
+    linkpath = property(_getlinkpath, _setlinkpath)
+
+    def __repr__(self):
+        return "<%s %r at %#x>" % (self.__class__.__name__,self.name,id(self))
+
+    def get_info(self):
+        """Return the TarInfo's attributes as a dictionary.
+        """
+        info = {
+            "name":     self.name,
+            "mode":     self.mode & 0o7777,
+            "uid":      self.uid,
+            "gid":      self.gid,
+            "size":     self.size,
+            "mtime":    self.mtime,
+            "chksum":   self.chksum,
+            "type":     self.type,
+            "linkname": self.linkname,
+            "uname":    self.uname,
+            "gname":    self.gname,
+            "devmajor": self.devmajor,
+            "devminor": self.devminor
+        }
+
+        if info["type"] == DIRTYPE and not info["name"].endswith("/"):
+            info["name"] += "/"
+
+        return info
+
+    def tobuf(self, format=DEFAULT_FORMAT, encoding=ENCODING, errors="surrogateescape"):
+        """Return a tar header as a string of 512 byte blocks.
+        """
+        info = self.get_info()
+
+        if format == USTAR_FORMAT:
+            return self.create_ustar_header(info, encoding, errors)
+        elif format == GNU_FORMAT:
+            return self.create_gnu_header(info, encoding, errors)
+        elif format == PAX_FORMAT:
+            return self.create_pax_header(info, encoding)
+        else:
+            raise ValueError("invalid format")
+
+    def create_ustar_header(self, info, encoding, errors):
+        """Return the object as a ustar header block.
+        """
+        info["magic"] = POSIX_MAGIC
+
+        if len(info["linkname"]) > LENGTH_LINK:
+            raise ValueError("linkname is too long")
+
+        if len(info["name"]) > LENGTH_NAME:
+            info["prefix"], info["name"] = self._posix_split_name(info["name"])
+
+        return self._create_header(info, USTAR_FORMAT, encoding, errors)
+
+    def create_gnu_header(self, info, encoding, errors):
+        """Return the object as a GNU header block sequence.
+        """
+        info["magic"] = GNU_MAGIC
+
+        buf = b""
+        if len(info["linkname"]) > LENGTH_LINK:
+            buf += self._create_gnu_long_header(info["linkname"], GNUTYPE_LONGLINK, encoding, errors)
+
+        if len(info["name"]) > LENGTH_NAME:
+            buf += self._create_gnu_long_header(info["name"], GNUTYPE_LONGNAME, encoding, errors)
+
+        return buf + self._create_header(info, GNU_FORMAT, encoding, errors)
+
+    def create_pax_header(self, info, encoding):
+        """Return the object as a ustar header block. If it cannot be
+           represented this way, prepend a pax extended header sequence
+           with supplement information.
+        """
+        info["magic"] = POSIX_MAGIC
+        pax_headers = self.pax_headers.copy()
+
+        # Test string fields for values that exceed the field length or cannot
+        # be represented in ASCII encoding.
+        for name, hname, length in (
+                ("name", "path", LENGTH_NAME), ("linkname", "linkpath", LENGTH_LINK),
+                ("uname", "uname", 32), ("gname", "gname", 32)):
+
+            if hname in pax_headers:
+                # The pax header has priority.
+                continue
+
+            # Try to encode the string as ASCII.
+            try:
+                info[name].encode("ascii", "strict")
+            except UnicodeEncodeError:
+                pax_headers[hname] = info[name]
+                continue
+
+            if len(info[name]) > length:
+                pax_headers[hname] = info[name]
+
+        # Test number fields for values that exceed the field limit or values
+        # that like to be stored as float.
+        for name, digits in (("uid", 8), ("gid", 8), ("size", 12), ("mtime", 12)):
+            if name in pax_headers:
+                # The pax header has priority. Avoid overflow.
+                info[name] = 0
+                continue
+
+            val = info[name]
+            if not 0 <= val < 8 ** (digits - 1) or isinstance(val, float):
+                pax_headers[name] = str(val)
+                info[name] = 0
+
+        # Create a pax extended header if necessary.
+        if pax_headers:
+            buf = self._create_pax_generic_header(pax_headers, XHDTYPE, encoding)
+        else:
+            buf = b""
+
+        return buf + self._create_header(info, USTAR_FORMAT, "ascii", "replace")
+
+    @classmethod
+    def create_pax_global_header(cls, pax_headers):
+        """Return the object as a pax global header block sequence.
+        """
+        return cls._create_pax_generic_header(pax_headers, XGLTYPE, "utf8")
+
+    def _posix_split_name(self, name):
+        """Split a name longer than 100 chars into a prefix
+           and a name part.
+        """
+        prefix = name[:LENGTH_PREFIX + 1]
+        while prefix and prefix[-1] != "/":
+            prefix = prefix[:-1]
+
+        name = name[len(prefix):]
+        prefix = prefix[:-1]
+
+        if not prefix or len(name) > LENGTH_NAME:
+            raise ValueError("name is too long")
+        return prefix, name
+
+    @staticmethod
+    def _create_header(info, format, encoding, errors):
+        """Return a header block. info is a dictionary with file
+           information, format must be one of the *_FORMAT constants.
+        """
+        parts = [
+            stn(info.get("name", ""), 100, encoding, errors),
+            itn(info.get("mode", 0) & 0o7777, 8, format),
+            itn(info.get("uid", 0), 8, format),
+            itn(info.get("gid", 0), 8, format),
+            itn(info.get("size", 0), 12, format),
+            itn(info.get("mtime", 0), 12, format),
+            b"        ", # checksum field
+            info.get("type", REGTYPE),
+            stn(info.get("linkname", ""), 100, encoding, errors),
+            info.get("magic", POSIX_MAGIC),
+            stn(info.get("uname", ""), 32, encoding, errors),
+            stn(info.get("gname", ""), 32, encoding, errors),
+            itn(info.get("devmajor", 0), 8, format),
+            itn(info.get("devminor", 0), 8, format),
+            stn(info.get("prefix", ""), 155, encoding, errors)
+        ]
+
+        buf = struct.pack("%ds" % BLOCKSIZE, b"".join(parts))
+        chksum = calc_chksums(buf[-BLOCKSIZE:])[0]
+        buf = buf[:-364] + ("%06o\0" % chksum).encode("ascii") + buf[-357:]
+        return buf
+
+    @staticmethod
+    def _create_payload(payload):
+        """Return the string payload filled with zero bytes
+           up to the next 512 byte border.
+        """
+        blocks, remainder = divmod(len(payload), BLOCKSIZE)
+        if remainder > 0:
+            payload += (BLOCKSIZE - remainder) * NUL
+        return payload
+
+    @classmethod
+    def _create_gnu_long_header(cls, name, type, encoding, errors):
+        """Return a GNUTYPE_LONGNAME or GNUTYPE_LONGLINK sequence
+           for name.
+        """
+        name = name.encode(encoding, errors) + NUL
+
+        info = {}
+        info["name"] = "././@LongLink"
+        info["type"] = type
+        info["size"] = len(name)
+        info["magic"] = GNU_MAGIC
+
+        # create extended header + name blocks.
+        return cls._create_header(info, USTAR_FORMAT, encoding, errors) + \
+                cls._create_payload(name)
+
+    @classmethod
+    def _create_pax_generic_header(cls, pax_headers, type, encoding):
+        """Return a POSIX.1-2008 extended or global header sequence
+           that contains a list of keyword, value pairs. The values
+           must be strings.
+        """
+        # Check if one of the fields contains surrogate characters and thereby
+        # forces hdrcharset=BINARY, see _proc_pax() for more information.
+        binary = False
+        for keyword, value in pax_headers.items():
+            try:
+                value.encode("utf8", "strict")
+            except UnicodeEncodeError:
+                binary = True
+                break
+
+        records = b""
+        if binary:
+            # Put the hdrcharset field at the beginning of the header.
+            records += b"21 hdrcharset=BINARY\n"
+
+        for keyword, value in pax_headers.items():
+            keyword = keyword.encode("utf8")
+            if binary:
+                # Try to restore the original byte representation of `value'.
+                # Needless to say, that the encoding must match the string.
+                value = value.encode(encoding, "surrogateescape")
+            else:
+                value = value.encode("utf8")
+
+            l = len(keyword) + len(value) + 3   # ' ' + '=' + '\n'
+            n = p = 0
+            while True:
+                n = l + len(str(p))
+                if n == p:
+                    break
+                p = n
+            records += bytes(str(p), "ascii") + b" " + keyword + b"=" + value + b"\n"
+
+        # We use a hardcoded "././@PaxHeader" name like star does
+        # instead of the one that POSIX recommends.
+        info = {}
+        info["name"] = "././@PaxHeader"
+        info["type"] = type
+        info["size"] = len(records)
+        info["magic"] = POSIX_MAGIC
+
+        # Create pax header + record blocks.
+        return cls._create_header(info, USTAR_FORMAT, "ascii", "replace") + \
+                cls._create_payload(records)
+
+    @classmethod
+    def frombuf(cls, buf, encoding, errors):
+        """Construct a TarInfo object from a 512 byte bytes object.
+        """
+        if len(buf) == 0:
+            raise EmptyHeaderError("empty header")
+        if len(buf) != BLOCKSIZE:
+            raise TruncatedHeaderError("truncated header")
+        if buf.count(NUL) == BLOCKSIZE:
+            raise EOFHeaderError("end of file header")
+
+        chksum = nti(buf[148:156])
+        if chksum not in calc_chksums(buf):
+            raise InvalidHeaderError("bad checksum")
+
+        obj = cls()
+        obj.name = nts(buf[0:100], encoding, errors)
+        obj.mode = nti(buf[100:108])
+        obj.uid = nti(buf[108:116])
+        obj.gid = nti(buf[116:124])
+        obj.size = nti(buf[124:136])
+        obj.mtime = nti(buf[136:148])
+        obj.chksum = chksum
+        obj.type = buf[156:157]
+        obj.linkname = nts(buf[157:257], encoding, errors)
+        obj.uname = nts(buf[265:297], encoding, errors)
+        obj.gname = nts(buf[297:329], encoding, errors)
+        obj.devmajor = nti(buf[329:337])
+        obj.devminor = nti(buf[337:345])
+        prefix = nts(buf[345:500], encoding, errors)
+
+        # Old V7 tar format represents a directory as a regular
+        # file with a trailing slash.
+        if obj.type == AREGTYPE and obj.name.endswith("/"):
+            obj.type = DIRTYPE
+
+        # The old GNU sparse format occupies some of the unused
+        # space in the buffer for up to 4 sparse structures.
+        # Save the them for later processing in _proc_sparse().
+        if obj.type == GNUTYPE_SPARSE:
+            pos = 386
+            structs = []
+            for i in range(4):
+                try:
+                    offset = nti(buf[pos:pos + 12])
+                    numbytes = nti(buf[pos + 12:pos + 24])
+                except ValueError:
+                    break
+                structs.append((offset, numbytes))
+                pos += 24
+            isextended = bool(buf[482])
+            origsize = nti(buf[483:495])
+            obj._sparse_structs = (structs, isextended, origsize)
+
+        # Remove redundant slashes from directories.
+        if obj.isdir():
+            obj.name = obj.name.rstrip("/")
+
+        # Reconstruct a ustar longname.
+        if prefix and obj.type not in GNU_TYPES:
+            obj.name = prefix + "/" + obj.name
+        return obj
+
+    @classmethod
+    def fromtarfile(cls, tarfile):
+        """Return the next TarInfo object from TarFile object
+           tarfile.
+        """
+        buf = tarfile.fileobj.read(BLOCKSIZE)
+        obj = cls.frombuf(buf, tarfile.encoding, tarfile.errors)
+        obj.offset = tarfile.fileobj.tell() - BLOCKSIZE
+        return obj._proc_member(tarfile)
+
+    #--------------------------------------------------------------------------
+    # The following are methods that are called depending on the type of a
+    # member. The entry point is _proc_member() which can be overridden in a
+    # subclass to add custom _proc_*() methods. A _proc_*() method MUST
+    # implement the following
+    # operations:
+    # 1. Set self.offset_data to the position where the data blocks begin,
+    #    if there is data that follows.
+    # 2. Set tarfile.offset to the position where the next member's header will
+    #    begin.
+    # 3. Return self or another valid TarInfo object.
+    def _proc_member(self, tarfile):
+        """Choose the right processing method depending on
+           the type and call it.
+        """
+        if self.type in (GNUTYPE_LONGNAME, GNUTYPE_LONGLINK):
+            return self._proc_gnulong(tarfile)
+        elif self.type == GNUTYPE_SPARSE:
+            return self._proc_sparse(tarfile)
+        elif self.type in (XHDTYPE, XGLTYPE, SOLARIS_XHDTYPE):
+            return self._proc_pax(tarfile)
+        else:
+            return self._proc_builtin(tarfile)
+
+    def _proc_builtin(self, tarfile):
+        """Process a builtin type or an unknown type which
+           will be treated as a regular file.
+        """
+        self.offset_data = tarfile.fileobj.tell()
+        offset = self.offset_data
+        if self.isreg() or self.type not in SUPPORTED_TYPES:
+            # Skip the following data blocks.
+            offset += self._block(self.size)
+        tarfile.offset = offset
+
+        # Patch the TarInfo object with saved global
+        # header information.
+        self._apply_pax_info(tarfile.pax_headers, tarfile.encoding, tarfile.errors)
+
+        return self
+
+    def _proc_gnulong(self, tarfile):
+        """Process the blocks that hold a GNU longname
+           or longlink member.
+        """
+        buf = tarfile.fileobj.read(self._block(self.size))
+
+        # Fetch the next header and process it.
+        try:
+            next = self.fromtarfile(tarfile)
+        except HeaderError:
+            raise SubsequentHeaderError("missing or bad subsequent header")
+
+        # Patch the TarInfo object from the next header with
+        # the longname information.
+        next.offset = self.offset
+        if self.type == GNUTYPE_LONGNAME:
+            next.name = nts(buf, tarfile.encoding, tarfile.errors)
+        elif self.type == GNUTYPE_LONGLINK:
+            next.linkname = nts(buf, tarfile.encoding, tarfile.errors)
+
+        return next
+
+    def _proc_sparse(self, tarfile):
+        """Process a GNU sparse header plus extra headers.
+        """
+        # We already collected some sparse structures in frombuf().
+        structs, isextended, origsize = self._sparse_structs
+        del self._sparse_structs
+
+        # Collect sparse structures from extended header blocks.
+        while isextended:
+            buf = tarfile.fileobj.read(BLOCKSIZE)
+            pos = 0
+            for i in range(21):
+                try:
+                    offset = nti(buf[pos:pos + 12])
+                    numbytes = nti(buf[pos + 12:pos + 24])
+                except ValueError:
+                    break
+                if offset and numbytes:
+                    structs.append((offset, numbytes))
+                pos += 24
+            isextended = bool(buf[504])
+        self.sparse = structs
+
+        self.offset_data = tarfile.fileobj.tell()
+        tarfile.offset = self.offset_data + self._block(self.size)
+        self.size = origsize
+        return self
+
+    def _proc_pax(self, tarfile):
+        """Process an extended or global header as described in
+           POSIX.1-2008.
+        """
+        # Read the header information.
+        buf = tarfile.fileobj.read(self._block(self.size))
+
+        # A pax header stores supplemental information for either
+        # the following file (extended) or all following files
+        # (global).
+        if self.type == XGLTYPE:
+            pax_headers = tarfile.pax_headers
+        else:
+            pax_headers = tarfile.pax_headers.copy()
+
+        # Check if the pax header contains a hdrcharset field. This tells us
+        # the encoding of the path, linkpath, uname and gname fields. Normally,
+        # these fields are UTF-8 encoded but since POSIX.1-2008 tar
+        # implementations are allowed to store them as raw binary strings if
+        # the translation to UTF-8 fails.
+        match = re.search(br"\d+ hdrcharset=([^\n]+)\n", buf)
+        if match is not None:
+            pax_headers["hdrcharset"] = match.group(1).decode("utf8")
+
+        # For the time being, we don't care about anything other than "BINARY".
+        # The only other value that is currently allowed by the standard is
+        # "ISO-IR 10646 2000 UTF-8" in other words UTF-8.
+        hdrcharset = pax_headers.get("hdrcharset")
+        if hdrcharset == "BINARY":
+            encoding = tarfile.encoding
+        else:
+            encoding = "utf8"
+
+        # Parse pax header information. A record looks like that:
+        # "%d %s=%s\n" % (length, keyword, value). length is the size
+        # of the complete record including the length field itself and
+        # the newline. keyword and value are both UTF-8 encoded strings.
+        regex = re.compile(br"(\d+) ([^=]+)=")
+        pos = 0
+        while True:
+            match = regex.match(buf, pos)
+            if not match:
+                break
+
+            length, keyword = match.groups()
+            length = int(length)
+            value = buf[match.end(2) + 1:match.start(1) + length - 1]
+
+            # Normally, we could just use "utf8" as the encoding and "strict"
+            # as the error handler, but we better not take the risk. For
+            # example, GNU tar <= 1.23 is known to store filenames it cannot
+            # translate to UTF-8 as raw strings (unfortunately without a
+            # hdrcharset=BINARY header).
+            # We first try the strict standard encoding, and if that fails we
+            # fall back on the user's encoding and error handler.
+            keyword = self._decode_pax_field(keyword, "utf8", "utf8",
+                    tarfile.errors)
+            if keyword in PAX_NAME_FIELDS:
+                value = self._decode_pax_field(value, encoding, tarfile.encoding,
+                        tarfile.errors)
+            else:
+                value = self._decode_pax_field(value, "utf8", "utf8",
+                        tarfile.errors)
+
+            pax_headers[keyword] = value
+            pos += length
+
+        # Fetch the next header.
+        try:
+            next = self.fromtarfile(tarfile)
+        except HeaderError:
+            raise SubsequentHeaderError("missing or bad subsequent header")
+
+        # Process GNU sparse information.
+        if "GNU.sparse.map" in pax_headers:
+            # GNU extended sparse format version 0.1.
+            self._proc_gnusparse_01(next, pax_headers)
+
+        elif "GNU.sparse.size" in pax_headers:
+            # GNU extended sparse format version 0.0.
+            self._proc_gnusparse_00(next, pax_headers, buf)
+
+        elif pax_headers.get("GNU.sparse.major") == "1" and pax_headers.get("GNU.sparse.minor") == "0":
+            # GNU extended sparse format version 1.0.
+            self._proc_gnusparse_10(next, pax_headers, tarfile)
+
+        if self.type in (XHDTYPE, SOLARIS_XHDTYPE):
+            # Patch the TarInfo object with the extended header info.
+            next._apply_pax_info(pax_headers, tarfile.encoding, tarfile.errors)
+            next.offset = self.offset
+
+            if "size" in pax_headers:
+                # If the extended header replaces the size field,
+                # we need to recalculate the offset where the next
+                # header starts.
+                offset = next.offset_data
+                if next.isreg() or next.type not in SUPPORTED_TYPES:
+                    offset += next._block(next.size)
+                tarfile.offset = offset
+
+        return next
+
+    def _proc_gnusparse_00(self, next, pax_headers, buf):
+        """Process a GNU tar extended sparse header, version 0.0.
+        """
+        offsets = []
+        for match in re.finditer(br"\d+ GNU.sparse.offset=(\d+)\n", buf):
+            offsets.append(int(match.group(1)))
+        numbytes = []
+        for match in re.finditer(br"\d+ GNU.sparse.numbytes=(\d+)\n", buf):
+            numbytes.append(int(match.group(1)))
+        next.sparse = list(zip(offsets, numbytes))
+
+    def _proc_gnusparse_01(self, next, pax_headers):
+        """Process a GNU tar extended sparse header, version 0.1.
+        """
+        sparse = [int(x) for x in pax_headers["GNU.sparse.map"].split(",")]
+        next.sparse = list(zip(sparse[::2], sparse[1::2]))
+
+    def _proc_gnusparse_10(self, next, pax_headers, tarfile):
+        """Process a GNU tar extended sparse header, version 1.0.
+        """
+        fields = None
+        sparse = []
+        buf = tarfile.fileobj.read(BLOCKSIZE)
+        fields, buf = buf.split(b"\n", 1)
+        fields = int(fields)
+        while len(sparse) < fields * 2:
+            if b"\n" not in buf:
+                buf += tarfile.fileobj.read(BLOCKSIZE)
+            number, buf = buf.split(b"\n", 1)
+            sparse.append(int(number))
+        next.offset_data = tarfile.fileobj.tell()
+        next.sparse = list(zip(sparse[::2], sparse[1::2]))
+
+    def _apply_pax_info(self, pax_headers, encoding, errors):
+        """Replace fields with supplemental information from a previous
+           pax extended or global header.
+        """
+        for keyword, value in pax_headers.items():
+            if keyword == "GNU.sparse.name":
+                setattr(self, "path", value)
+            elif keyword == "GNU.sparse.size":
+                setattr(self, "size", int(value))
+            elif keyword == "GNU.sparse.realsize":
+                setattr(self, "size", int(value))
+            elif keyword in PAX_FIELDS:
+                if keyword in PAX_NUMBER_FIELDS:
+                    try:
+                        value = PAX_NUMBER_FIELDS[keyword](value)
+                    except ValueError:
+                        value = 0
+                if keyword == "path":
+                    value = value.rstrip("/")
+                setattr(self, keyword, value)
+
+        self.pax_headers = pax_headers.copy()
+
+    def _decode_pax_field(self, value, encoding, fallback_encoding, fallback_errors):
+        """Decode a single field from a pax record.
+        """
+        try:
+            return value.decode(encoding, "strict")
+        except UnicodeDecodeError:
+            return value.decode(fallback_encoding, fallback_errors)
+
+    def _block(self, count):
+        """Round up a byte count by BLOCKSIZE and return it,
+           e.g. _block(834) => 1024.
+        """
+        blocks, remainder = divmod(count, BLOCKSIZE)
+        if remainder:
+            blocks += 1
+        return blocks * BLOCKSIZE
+
+    def isreg(self):
+        return self.type in REGULAR_TYPES
+    def isfile(self):
+        return self.isreg()
+    def isdir(self):
+        return self.type == DIRTYPE
+    def issym(self):
+        return self.type == SYMTYPE
+    def islnk(self):
+        return self.type == LNKTYPE
+    def ischr(self):
+        return self.type == CHRTYPE
+    def isblk(self):
+        return self.type == BLKTYPE
+    def isfifo(self):
+        return self.type == FIFOTYPE
+    def issparse(self):
+        return self.sparse is not None
+    def isdev(self):
+        return self.type in (CHRTYPE, BLKTYPE, FIFOTYPE)
+# class TarInfo
+
+class TarFile(object):
+    """The TarFile Class provides an interface to tar archives.
+    """
+
+    debug = 0                   # May be set from 0 (no msgs) to 3 (all msgs)
+
+    dereference = False         # If true, add content of linked file to the
+                                # tar file, else the link.
+
+    ignore_zeros = False        # If true, skips empty or invalid blocks and
+                                # continues processing.
+
+    errorlevel = 1              # If 0, fatal errors only appear in debug
+                                # messages (if debug >= 0). If > 0, errors
+                                # are passed to the caller as exceptions.
+
+    format = DEFAULT_FORMAT     # The format to use when creating an archive.
+
+    encoding = ENCODING         # Encoding for 8-bit character strings.
+
+    errors = None               # Error handler for unicode conversion.
+
+    tarinfo = TarInfo           # The default TarInfo class to use.
+
+    fileobject = ExFileObject   # The default ExFileObject class to use.
+
+    def __init__(self, name=None, mode="r", fileobj=None, format=None,
+            tarinfo=None, dereference=None, ignore_zeros=None, encoding=None,
+            errors="surrogateescape", pax_headers=None, debug=None, errorlevel=None):
+        """Open an (uncompressed) tar archive `name'. `mode' is either 'r' to
+           read from an existing archive, 'a' to append data to an existing
+           file or 'w' to create a new file overwriting an existing one. `mode'
+           defaults to 'r'.
+           If `fileobj' is given, it is used for reading or writing data. If it
+           can be determined, `mode' is overridden by `fileobj's mode.
+           `fileobj' is not closed, when TarFile is closed.
+        """
+        if len(mode) > 1 or mode not in "raw":
+            raise ValueError("mode must be 'r', 'a' or 'w'")
+        self.mode = mode
+        self._mode = {"r": "rb", "a": "r+b", "w": "wb"}[mode]
+
+        if not fileobj:
+            if self.mode == "a" and not os.path.exists(name):
+                # Create nonexistent files in append mode.
+                self.mode = "w"
+                self._mode = "wb"
+            fileobj = bltn_open(name, self._mode)
+            self._extfileobj = False
+        else:
+            if name is None and hasattr(fileobj, "name"):
+                name = fileobj.name
+            if hasattr(fileobj, "mode"):
+                self._mode = fileobj.mode
+            self._extfileobj = True
+        self.name = os.path.abspath(name) if name else None
+        self.fileobj = fileobj
+
+        # Init attributes.
+        if format is not None:
+            self.format = format
+        if tarinfo is not None:
+            self.tarinfo = tarinfo
+        if dereference is not None:
+            self.dereference = dereference
+        if ignore_zeros is not None:
+            self.ignore_zeros = ignore_zeros
+        if encoding is not None:
+            self.encoding = encoding
+        self.errors = errors
+
+        if pax_headers is not None and self.format == PAX_FORMAT:
+            self.pax_headers = pax_headers
+        else:
+            self.pax_headers = {}
+
+        if debug is not None:
+            self.debug = debug
+        if errorlevel is not None:
+            self.errorlevel = errorlevel
+
+        # Init datastructures.
+        self.closed = False
+        self.members = []       # list of members as TarInfo objects
+        self._loaded = False    # flag if all members have been read
+        self.offset = self.fileobj.tell()
+                                # current position in the archive file
+        self.inodes = {}        # dictionary caching the inodes of
+                                # archive members already added
+
+        try:
+            if self.mode == "r":
+                self.firstmember = None
+                self.firstmember = self.next()
+
+            if self.mode == "a":
+                # Move to the end of the archive,
+                # before the first empty block.
+                while True:
+                    self.fileobj.seek(self.offset)
+                    try:
+                        tarinfo = self.tarinfo.fromtarfile(self)
+                        self.members.append(tarinfo)
+                    except EOFHeaderError:
+                        self.fileobj.seek(self.offset)
+                        break
+                    except HeaderError as e:
+                        raise ReadError(str(e))
+
+            if self.mode in "aw":
+                self._loaded = True
+
+                if self.pax_headers:
+                    buf = self.tarinfo.create_pax_global_header(self.pax_headers.copy())
+                    self.fileobj.write(buf)
+                    self.offset += len(buf)
+        except:
+            if not self._extfileobj:
+                self.fileobj.close()
+            self.closed = True
+            raise
+
+    #--------------------------------------------------------------------------
+    # Below are the classmethods which act as alternate constructors to the
+    # TarFile class. The open() method is the only one that is needed for
+    # public use; it is the "super"-constructor and is able to select an
+    # adequate "sub"-constructor for a particular compression using the mapping
+    # from OPEN_METH.
+    #
+    # This concept allows one to subclass TarFile without losing the comfort of
+    # the super-constructor. A sub-constructor is registered and made available
+    # by adding it to the mapping in OPEN_METH.
+
+    @classmethod
+    def open(cls, name=None, mode="r", fileobj=None, bufsize=RECORDSIZE, **kwargs):
+        """Open a tar archive for reading, writing or appending. Return
+           an appropriate TarFile class.
+
+           mode:
+           'r' or 'r:*' open for reading with transparent compression
+           'r:'         open for reading exclusively uncompressed
+           'r:gz'       open for reading with gzip compression
+           'r:bz2'      open for reading with bzip2 compression
+           'a' or 'a:'  open for appending, creating the file if necessary
+           'w' or 'w:'  open for writing without compression
+           'w:gz'       open for writing with gzip compression
+           'w:bz2'      open for writing with bzip2 compression
+
+           'r|*'        open a stream of tar blocks with transparent compression
+           'r|'         open an uncompressed stream of tar blocks for reading
+           'r|gz'       open a gzip compressed stream of tar blocks
+           'r|bz2'      open a bzip2 compressed stream of tar blocks
+           'w|'         open an uncompressed stream for writing
+           'w|gz'       open a gzip compressed stream for writing
+           'w|bz2'      open a bzip2 compressed stream for writing
+        """
+
+        if not name and not fileobj:
+            raise ValueError("nothing to open")
+
+        if mode in ("r", "r:*"):
+            # Find out which *open() is appropriate for opening the file.
+            for comptype in cls.OPEN_METH:
+                func = getattr(cls, cls.OPEN_METH[comptype])
+                if fileobj is not None:
+                    saved_pos = fileobj.tell()
+                try:
+                    return func(name, "r", fileobj, **kwargs)
+                except (ReadError, CompressionError) as e:
+                    if fileobj is not None:
+                        fileobj.seek(saved_pos)
+                    continue
+            raise ReadError("file could not be opened successfully")
+
+        elif ":" in mode:
+            filemode, comptype = mode.split(":", 1)
+            filemode = filemode or "r"
+            comptype = comptype or "tar"
+
+            # Select the *open() function according to
+            # given compression.
+            if comptype in cls.OPEN_METH:
+                func = getattr(cls, cls.OPEN_METH[comptype])
+            else:
+                raise CompressionError("unknown compression type %r" % comptype)
+            return func(name, filemode, fileobj, **kwargs)
+
+        elif "|" in mode:
+            filemode, comptype = mode.split("|", 1)
+            filemode = filemode or "r"
+            comptype = comptype or "tar"
+
+            if filemode not in "rw":
+                raise ValueError("mode must be 'r' or 'w'")
+
+            stream = _Stream(name, filemode, comptype, fileobj, bufsize)
+            try:
+                t = cls(name, filemode, stream, **kwargs)
+            except:
+                stream.close()
+                raise
+            t._extfileobj = False
+            return t
+
+        elif mode in "aw":
+            return cls.taropen(name, mode, fileobj, **kwargs)
+
+        raise ValueError("undiscernible mode")
+
+    @classmethod
+    def taropen(cls, name, mode="r", fileobj=None, **kwargs):
+        """Open uncompressed tar archive name for reading or writing.
+        """
+        if len(mode) > 1 or mode not in "raw":
+            raise ValueError("mode must be 'r', 'a' or 'w'")
+        return cls(name, mode, fileobj, **kwargs)
+
+    @classmethod
+    def gzopen(cls, name, mode="r", fileobj=None, compresslevel=9, **kwargs):
+        """Open gzip compressed tar archive name for reading or writing.
+           Appending is not allowed.
+        """
+        if len(mode) > 1 or mode not in "rw":
+            raise ValueError("mode must be 'r' or 'w'")
+
+        try:
+            import gzip
+            gzip.GzipFile
+        except (ImportError, AttributeError):
+            raise CompressionError("gzip module is not available")
+
+        extfileobj = fileobj is not None
+        try:
+            fileobj = gzip.GzipFile(name, mode + "b", compresslevel, fileobj)
+            t = cls.taropen(name, mode, fileobj, **kwargs)
+        except IOError:
+            if not extfileobj and fileobj is not None:
+                fileobj.close()
+            if fileobj is None:
+                raise
+            raise ReadError("not a gzip file")
+        except:
+            if not extfileobj and fileobj is not None:
+                fileobj.close()
+            raise
+        t._extfileobj = extfileobj
+        return t
+
+    @classmethod
+    def bz2open(cls, name, mode="r", fileobj=None, compresslevel=9, **kwargs):
+        """Open bzip2 compressed tar archive name for reading or writing.
+           Appending is not allowed.
+        """
+        if len(mode) > 1 or mode not in "rw":
+            raise ValueError("mode must be 'r' or 'w'.")
+
+        try:
+            import bz2
+        except ImportError:
+            raise CompressionError("bz2 module is not available")
+
+        if fileobj is not None:
+            fileobj = _BZ2Proxy(fileobj, mode)
+        else:
+            fileobj = bz2.BZ2File(name, mode, compresslevel=compresslevel)
+
+        try:
+            t = cls.taropen(name, mode, fileobj, **kwargs)
+        except (IOError, EOFError):
+            fileobj.close()
+            raise ReadError("not a bzip2 file")
+        t._extfileobj = False
+        return t
+
+    # All *open() methods are registered here.
+    OPEN_METH = {
+        "tar": "taropen",   # uncompressed tar
+        "gz":  "gzopen",    # gzip compressed tar
+        "bz2": "bz2open"    # bzip2 compressed tar
+    }
+
+    #--------------------------------------------------------------------------
+    # The public methods which TarFile provides:
+
+    def close(self):
+        """Close the TarFile. In write-mode, two finishing zero blocks are
+           appended to the archive.
+        """
+        if self.closed:
+            return
+
+        if self.mode in "aw":
+            self.fileobj.write(NUL * (BLOCKSIZE * 2))
+            self.offset += (BLOCKSIZE * 2)
+            # fill up the end with zero-blocks
+            # (like option -b20 for tar does)
+            blocks, remainder = divmod(self.offset, RECORDSIZE)
+            if remainder > 0:
+                self.fileobj.write(NUL * (RECORDSIZE - remainder))
+
+        if not self._extfileobj:
+            self.fileobj.close()
+        self.closed = True
+
+    def getmember(self, name):
+        """Return a TarInfo object for member `name'. If `name' can not be
+           found in the archive, KeyError is raised. If a member occurs more
+           than once in the archive, its last occurrence is assumed to be the
+           most up-to-date version.
+        """
+        tarinfo = self._getmember(name)
+        if tarinfo is None:
+            raise KeyError("filename %r not found" % name)
+        return tarinfo
+
+    def getmembers(self):
+        """Return the members of the archive as a list of TarInfo objects. The
+           list has the same order as the members in the archive.
+        """
+        self._check()
+        if not self._loaded:    # if we want to obtain a list of
+            self._load()        # all members, we first have to
+                                # scan the whole archive.
+        return self.members
+
+    def getnames(self):
+        """Return the members of the archive as a list of their names. It has
+           the same order as the list returned by getmembers().
+        """
+        return [tarinfo.name for tarinfo in self.getmembers()]
+
+    def gettarinfo(self, name=None, arcname=None, fileobj=None):
+        """Create a TarInfo object for either the file `name' or the file
+           object `fileobj' (using os.fstat on its file descriptor). You can
+           modify some of the TarInfo's attributes before you add it using
+           addfile(). If given, `arcname' specifies an alternative name for the
+           file in the archive.
+        """
+        self._check("aw")
+
+        # When fileobj is given, replace name by
+        # fileobj's real name.
+        if fileobj is not None:
+            name = fileobj.name
+
+        # Building the name of the member in the archive.
+        # Backward slashes are converted to forward slashes,
+        # Absolute paths are turned to relative paths.
+        if arcname is None:
+            arcname = name
+        drv, arcname = os.path.splitdrive(arcname)
+        arcname = arcname.replace(os.sep, "/")
+        arcname = arcname.lstrip("/")
+
+        # Now, fill the TarInfo object with
+        # information specific for the file.
+        tarinfo = self.tarinfo()
+        tarinfo.tarfile = self
+
+        # Use os.stat or os.lstat, depending on platform
+        # and if symlinks shall be resolved.
+        if fileobj is None:
+            if hasattr(os, "lstat") and not self.dereference:
+                statres = os.lstat(name)
+            else:
+                statres = os.stat(name)
+        else:
+            statres = os.fstat(fileobj.fileno())
+        linkname = ""
+
+        stmd = statres.st_mode
+        if stat.S_ISREG(stmd):
+            inode = (statres.st_ino, statres.st_dev)
+            if not self.dereference and statres.st_nlink > 1 and \
+                    inode in self.inodes and arcname != self.inodes[inode]:
+                # Is it a hardlink to an already
+                # archived file?
+                type = LNKTYPE
+                linkname = self.inodes[inode]
+            else:
+                # The inode is added only if its valid.
+                # For win32 it is always 0.
+                type = REGTYPE
+                if inode[0]:
+                    self.inodes[inode] = arcname
+        elif stat.S_ISDIR(stmd):
+            type = DIRTYPE
+        elif stat.S_ISFIFO(stmd):
+            type = FIFOTYPE
+        elif stat.S_ISLNK(stmd):
+            type = SYMTYPE
+            linkname = os.readlink(name)
+        elif stat.S_ISCHR(stmd):
+            type = CHRTYPE
+        elif stat.S_ISBLK(stmd):
+            type = BLKTYPE
+        else:
+            return None
+
+        # Fill the TarInfo object with all
+        # information we can get.
+        tarinfo.name = arcname
+        tarinfo.mode = stmd
+        tarinfo.uid = statres.st_uid
+        tarinfo.gid = statres.st_gid
+        if type == REGTYPE:
+            tarinfo.size = statres.st_size
+        else:
+            tarinfo.size = 0
+        tarinfo.mtime = statres.st_mtime
+        tarinfo.type = type
+        tarinfo.linkname = linkname
+        if pwd:
+            try:
+                tarinfo.uname = pwd.getpwuid(tarinfo.uid)[0]
+            except KeyError:
+                pass
+        if grp:
+            try:
+                tarinfo.gname = grp.getgrgid(tarinfo.gid)[0]
+            except KeyError:
+                pass
+
+        if type in (CHRTYPE, BLKTYPE):
+            if hasattr(os, "major") and hasattr(os, "minor"):
+                tarinfo.devmajor = os.major(statres.st_rdev)
+                tarinfo.devminor = os.minor(statres.st_rdev)
+        return tarinfo
+
+    def list(self, verbose=True):
+        """Print a table of contents to sys.stdout. If `verbose' is False, only
+           the names of the members are printed. If it is True, an `ls -l'-like
+           output is produced.
+        """
+        self._check()
+
+        for tarinfo in self:
+            if verbose:
+                print(filemode(tarinfo.mode), end=' ')
+                print("%s/%s" % (tarinfo.uname or tarinfo.uid,
+                                 tarinfo.gname or tarinfo.gid), end=' ')
+                if tarinfo.ischr() or tarinfo.isblk():
+                    print("%10s" % ("%d,%d" \
+                                    % (tarinfo.devmajor, tarinfo.devminor)), end=' ')
+                else:
+                    print("%10d" % tarinfo.size, end=' ')
+                print("%d-%02d-%02d %02d:%02d:%02d" \
+                      % time.localtime(tarinfo.mtime)[:6], end=' ')
+
+            print(tarinfo.name + ("/" if tarinfo.isdir() else ""), end=' ')
+
+            if verbose:
+                if tarinfo.issym():
+                    print("->", tarinfo.linkname, end=' ')
+                if tarinfo.islnk():
+                    print("link to", tarinfo.linkname, end=' ')
+            print()
+
+    def add(self, name, arcname=None, recursive=True, exclude=None, filter=None):
+        """Add the file `name' to the archive. `name' may be any type of file
+           (directory, fifo, symbolic link, etc.). If given, `arcname'
+           specifies an alternative name for the file in the archive.
+           Directories are added recursively by default. This can be avoided by
+           setting `recursive' to False. `exclude' is a function that should
+           return True for each filename to be excluded. `filter' is a function
+           that expects a TarInfo object argument and returns the changed
+           TarInfo object, if it returns None the TarInfo object will be
+           excluded from the archive.
+        """
+        self._check("aw")
+
+        if arcname is None:
+            arcname = name
+
+        # Exclude pathnames.
+        if exclude is not None:
+            import warnings
+            warnings.warn("use the filter argument instead",
+                    DeprecationWarning, 2)
+            if exclude(name):
+                self._dbg(2, "tarfile: Excluded %r" % name)
+                return
+
+        # Skip if somebody tries to archive the archive...
+        if self.name is not None and os.path.abspath(name) == self.name:
+            self._dbg(2, "tarfile: Skipped %r" % name)
+            return
+
+        self._dbg(1, name)
+
+        # Create a TarInfo object from the file.
+        tarinfo = self.gettarinfo(name, arcname)
+
+        if tarinfo is None:
+            self._dbg(1, "tarfile: Unsupported type %r" % name)
+            return
+
+        # Change or exclude the TarInfo object.
+        if filter is not None:
+            tarinfo = filter(tarinfo)
+            if tarinfo is None:
+                self._dbg(2, "tarfile: Excluded %r" % name)
+                return
+
+        # Append the tar header and data to the archive.
+        if tarinfo.isreg():
+            f = bltn_open(name, "rb")
+            self.addfile(tarinfo, f)
+            f.close()
+
+        elif tarinfo.isdir():
+            self.addfile(tarinfo)
+            if recursive:
+                for f in os.listdir(name):
+                    self.add(os.path.join(name, f), os.path.join(arcname, f),
+                            recursive, exclude, filter=filter)
+
+        else:
+            self.addfile(tarinfo)
+
+    def addfile(self, tarinfo, fileobj=None):
+        """Add the TarInfo object `tarinfo' to the archive. If `fileobj' is
+           given, tarinfo.size bytes are read from it and added to the archive.
+           You can create TarInfo objects using gettarinfo().
+           On Windows platforms, `fileobj' should always be opened with mode
+           'rb' to avoid irritation about the file size.
+        """
+        self._check("aw")
+
+        tarinfo = copy.copy(tarinfo)
+
+        buf = tarinfo.tobuf(self.format, self.encoding, self.errors)
+        self.fileobj.write(buf)
+        self.offset += len(buf)
+
+        # If there's data to follow, append it.
+        if fileobj is not None:
+            copyfileobj(fileobj, self.fileobj, tarinfo.size)
+            blocks, remainder = divmod(tarinfo.size, BLOCKSIZE)
+            if remainder > 0:
+                self.fileobj.write(NUL * (BLOCKSIZE - remainder))
+                blocks += 1
+            self.offset += blocks * BLOCKSIZE
+
+        self.members.append(tarinfo)
+
+    def extractall(self, path=".", members=None):
+        """Extract all members from the archive to the current working
+           directory and set owner, modification time and permissions on
+           directories afterwards. `path' specifies a different directory
+           to extract to. `members' is optional and must be a subset of the
+           list returned by getmembers().
+        """
+        directories = []
+
+        if members is None:
+            members = self
+
+        for tarinfo in members:
+            if tarinfo.isdir():
+                # Extract directories with a safe mode.
+                directories.append(tarinfo)
+                tarinfo = copy.copy(tarinfo)
+                tarinfo.mode = 0o700
+            # Do not set_attrs directories, as we will do that further down
+            self.extract(tarinfo, path, set_attrs=not tarinfo.isdir())
+
+        # Reverse sort directories.
+        directories.sort(key=lambda a: a.name)
+        directories.reverse()
+
+        # Set correct owner, mtime and filemode on directories.
+        for tarinfo in directories:
+            dirpath = os.path.join(path, tarinfo.name)
+            try:
+                self.chown(tarinfo, dirpath)
+                self.utime(tarinfo, dirpath)
+                self.chmod(tarinfo, dirpath)
+            except ExtractError as e:
+                if self.errorlevel > 1:
+                    raise
+                else:
+                    self._dbg(1, "tarfile: %s" % e)
+
+    def extract(self, member, path="", set_attrs=True):
+        """Extract a member from the archive to the current working directory,
+           using its full name. Its file information is extracted as accurately
+           as possible. `member' may be a filename or a TarInfo object. You can
+           specify a different directory using `path'. File attributes (owner,
+           mtime, mode) are set unless `set_attrs' is False.
+        """
+        self._check("r")
+
+        if isinstance(member, str):
+            tarinfo = self.getmember(member)
+        else:
+            tarinfo = member
+
+        # Prepare the link target for makelink().
+        if tarinfo.islnk():
+            tarinfo._link_target = os.path.join(path, tarinfo.linkname)
+
+        try:
+            self._extract_member(tarinfo, os.path.join(path, tarinfo.name),
+                                 set_attrs=set_attrs)
+        except EnvironmentError as e:
+            if self.errorlevel > 0:
+                raise
+            else:
+                if e.filename is None:
+                    self._dbg(1, "tarfile: %s" % e.strerror)
+                else:
+                    self._dbg(1, "tarfile: %s %r" % (e.strerror, e.filename))
+        except ExtractError as e:
+            if self.errorlevel > 1:
+                raise
+            else:
+                self._dbg(1, "tarfile: %s" % e)
+
+    def extractfile(self, member):
+        """Extract a member from the archive as a file object. `member' may be
+           a filename or a TarInfo object. If `member' is a regular file, a
+           file-like object is returned. If `member' is a link, a file-like
+           object is constructed from the link's target. If `member' is none of
+           the above, None is returned.
+           The file-like object is read-only and provides the following
+           methods: read(), readline(), readlines(), seek() and tell()
+        """
+        self._check("r")
+
+        if isinstance(member, str):
+            tarinfo = self.getmember(member)
+        else:
+            tarinfo = member
+
+        if tarinfo.isreg():
+            return self.fileobject(self, tarinfo)
+
+        elif tarinfo.type not in SUPPORTED_TYPES:
+            # If a member's type is unknown, it is treated as a
+            # regular file.
+            return self.fileobject(self, tarinfo)
+
+        elif tarinfo.islnk() or tarinfo.issym():
+            if isinstance(self.fileobj, _Stream):
+                # A small but ugly workaround for the case that someone tries
+                # to extract a (sym)link as a file-object from a non-seekable
+                # stream of tar blocks.
+                raise StreamError("cannot extract (sym)link as file object")
+            else:
+                # A (sym)link's file object is its target's file object.
+                return self.extractfile(self._find_link_target(tarinfo))
+        else:
+            # If there's no data associated with the member (directory, chrdev,
+            # blkdev, etc.), return None instead of a file object.
+            return None
+
+    def _extract_member(self, tarinfo, targetpath, set_attrs=True):
+        """Extract the TarInfo object tarinfo to a physical
+           file called targetpath.
+        """
+        # Fetch the TarInfo object for the given name
+        # and build the destination pathname, replacing
+        # forward slashes to platform specific separators.
+        targetpath = targetpath.rstrip("/")
+        targetpath = targetpath.replace("/", os.sep)
+
+        # Create all upper directories.
+        upperdirs = os.path.dirname(targetpath)
+        if upperdirs and not os.path.exists(upperdirs):
+            # Create directories that are not part of the archive with
+            # default permissions.
+            os.makedirs(upperdirs)
+
+        if tarinfo.islnk() or tarinfo.issym():
+            self._dbg(1, "%s -> %s" % (tarinfo.name, tarinfo.linkname))
+        else:
+            self._dbg(1, tarinfo.name)
+
+        if tarinfo.isreg():
+            self.makefile(tarinfo, targetpath)
+        elif tarinfo.isdir():
+            self.makedir(tarinfo, targetpath)
+        elif tarinfo.isfifo():
+            self.makefifo(tarinfo, targetpath)
+        elif tarinfo.ischr() or tarinfo.isblk():
+            self.makedev(tarinfo, targetpath)
+        elif tarinfo.islnk() or tarinfo.issym():
+            self.makelink(tarinfo, targetpath)
+        elif tarinfo.type not in SUPPORTED_TYPES:
+            self.makeunknown(tarinfo, targetpath)
+        else:
+            self.makefile(tarinfo, targetpath)
+
+        if set_attrs:
+            self.chown(tarinfo, targetpath)
+            if not tarinfo.issym():
+                self.chmod(tarinfo, targetpath)
+                self.utime(tarinfo, targetpath)
+
+    #--------------------------------------------------------------------------
+    # Below are the different file methods. They are called via
+    # _extract_member() when extract() is called. They can be replaced in a
+    # subclass to implement other functionality.
+
+    def makedir(self, tarinfo, targetpath):
+        """Make a directory called targetpath.
+        """
+        try:
+            # Use a safe mode for the directory, the real mode is set
+            # later in _extract_member().
+            os.mkdir(targetpath, 0o700)
+        except EnvironmentError as e:
+            if e.errno != errno.EEXIST:
+                raise
+
+    def makefile(self, tarinfo, targetpath):
+        """Make a file called targetpath.
+        """
+        source = self.fileobj
+        source.seek(tarinfo.offset_data)
+        target = bltn_open(targetpath, "wb")
+        if tarinfo.sparse is not None:
+            for offset, size in tarinfo.sparse:
+                target.seek(offset)
+                copyfileobj(source, target, size)
+        else:
+            copyfileobj(source, target, tarinfo.size)
+        target.seek(tarinfo.size)
+        target.truncate()
+        target.close()
+
+    def makeunknown(self, tarinfo, targetpath):
+        """Make a file from a TarInfo object with an unknown type
+           at targetpath.
+        """
+        self.makefile(tarinfo, targetpath)
+        self._dbg(1, "tarfile: Unknown file type %r, " \
+                     "extracted as regular file." % tarinfo.type)
+
+    def makefifo(self, tarinfo, targetpath):
+        """Make a fifo called targetpath.
+        """
+        if hasattr(os, "mkfifo"):
+            os.mkfifo(targetpath)
+        else:
+            raise ExtractError("fifo not supported by system")
+
+    def makedev(self, tarinfo, targetpath):
+        """Make a character or block device called targetpath.
+        """
+        if not hasattr(os, "mknod") or not hasattr(os, "makedev"):
+            raise ExtractError("special devices not supported by system")
+
+        mode = tarinfo.mode
+        if tarinfo.isblk():
+            mode |= stat.S_IFBLK
+        else:
+            mode |= stat.S_IFCHR
+
+        os.mknod(targetpath, mode,
+                 os.makedev(tarinfo.devmajor, tarinfo.devminor))
+
+    def makelink(self, tarinfo, targetpath):
+        """Make a (symbolic) link called targetpath. If it cannot be created
+          (platform limitation), we try to make a copy of the referenced file
+          instead of a link.
+        """
+        try:
+            # For systems that support symbolic and hard links.
+            if tarinfo.issym():
+                os.symlink(tarinfo.linkname, targetpath)
+            else:
+                # See extract().
+                if os.path.exists(tarinfo._link_target):
+                    os.link(tarinfo._link_target, targetpath)
+                else:
+                    self._extract_member(self._find_link_target(tarinfo),
+                                         targetpath)
+        except symlink_exception:
+            if tarinfo.issym():
+                linkpath = os.path.join(os.path.dirname(tarinfo.name),
+                                        tarinfo.linkname)
+            else:
+                linkpath = tarinfo.linkname
+        else:
+            try:
+                self._extract_member(self._find_link_target(tarinfo),
+                                     targetpath)
+            except KeyError:
+                raise ExtractError("unable to resolve link inside archive")
+
+    def chown(self, tarinfo, targetpath):
+        """Set owner of targetpath according to tarinfo.
+        """
+        if pwd and hasattr(os, "geteuid") and os.geteuid() == 0:
+            # We have to be root to do so.
+            try:
+                g = grp.getgrnam(tarinfo.gname)[2]
+            except KeyError:
+                g = tarinfo.gid
+            try:
+                u = pwd.getpwnam(tarinfo.uname)[2]
+            except KeyError:
+                u = tarinfo.uid
+            try:
+                if tarinfo.issym() and hasattr(os, "lchown"):
+                    os.lchown(targetpath, u, g)
+                else:
+                    if sys.platform != "os2emx":
+                        os.chown(targetpath, u, g)
+            except EnvironmentError as e:
+                raise ExtractError("could not change owner")
+
+    def chmod(self, tarinfo, targetpath):
+        """Set file permissions of targetpath according to tarinfo.
+        """
+        if hasattr(os, 'chmod'):
+            try:
+                os.chmod(targetpath, tarinfo.mode)
+            except EnvironmentError as e:
+                raise ExtractError("could not change mode")
+
+    def utime(self, tarinfo, targetpath):
+        """Set modification time of targetpath according to tarinfo.
+        """
+        if not hasattr(os, 'utime'):
+            return
+        try:
+            os.utime(targetpath, (tarinfo.mtime, tarinfo.mtime))
+        except EnvironmentError as e:
+            raise ExtractError("could not change modification time")
+
+    #--------------------------------------------------------------------------
+    def next(self):
+        """Return the next member of the archive as a TarInfo object, when
+           TarFile is opened for reading. Return None if there is no more
+           available.
+        """
+        self._check("ra")
+        if self.firstmember is not None:
+            m = self.firstmember
+            self.firstmember = None
+            return m
+
+        # Read the next block.
+        self.fileobj.seek(self.offset)
+        tarinfo = None
+        while True:
+            try:
+                tarinfo = self.tarinfo.fromtarfile(self)
+            except EOFHeaderError as e:
+                if self.ignore_zeros:
+                    self._dbg(2, "0x%X: %s" % (self.offset, e))
+                    self.offset += BLOCKSIZE
+                    continue
+            except InvalidHeaderError as e:
+                if self.ignore_zeros:
+                    self._dbg(2, "0x%X: %s" % (self.offset, e))
+                    self.offset += BLOCKSIZE
+                    continue
+                elif self.offset == 0:
+                    raise ReadError(str(e))
+            except EmptyHeaderError:
+                if self.offset == 0:
+                    raise ReadError("empty file")
+            except TruncatedHeaderError as e:
+                if self.offset == 0:
+                    raise ReadError(str(e))
+            except SubsequentHeaderError as e:
+                raise ReadError(str(e))
+            break
+
+        if tarinfo is not None:
+            self.members.append(tarinfo)
+        else:
+            self._loaded = True
+
+        return tarinfo
+
+    #--------------------------------------------------------------------------
+    # Little helper methods:
+
+    def _getmember(self, name, tarinfo=None, normalize=False):
+        """Find an archive member by name from bottom to top.
+           If tarinfo is given, it is used as the starting point.
+        """
+        # Ensure that all members have been loaded.
+        members = self.getmembers()
+
+        # Limit the member search list up to tarinfo.
+        if tarinfo is not None:
+            members = members[:members.index(tarinfo)]
+
+        if normalize:
+            name = os.path.normpath(name)
+
+        for member in reversed(members):
+            if normalize:
+                member_name = os.path.normpath(member.name)
+            else:
+                member_name = member.name
+
+            if name == member_name:
+                return member
+
+    def _load(self):
+        """Read through the entire archive file and look for readable
+           members.
+        """
+        while True:
+            tarinfo = self.next()
+            if tarinfo is None:
+                break
+        self._loaded = True
+
+    def _check(self, mode=None):
+        """Check if TarFile is still open, and if the operation's mode
+           corresponds to TarFile's mode.
+        """
+        if self.closed:
+            raise IOError("%s is closed" % self.__class__.__name__)
+        if mode is not None and self.mode not in mode:
+            raise IOError("bad operation for mode %r" % self.mode)
+
+    def _find_link_target(self, tarinfo):
+        """Find the target member of a symlink or hardlink member in the
+           archive.
+        """
+        if tarinfo.issym():
+            # Always search the entire archive.
+            linkname = os.path.dirname(tarinfo.name) + "/" + tarinfo.linkname
+            limit = None
+        else:
+            # Search the archive before the link, because a hard link is
+            # just a reference to an already archived file.
+            linkname = tarinfo.linkname
+            limit = tarinfo
+
+        member = self._getmember(linkname, tarinfo=limit, normalize=True)
+        if member is None:
+            raise KeyError("linkname %r not found" % linkname)
+        return member
+
+    def __iter__(self):
+        """Provide an iterator object.
+        """
+        if self._loaded:
+            return iter(self.members)
+        else:
+            return TarIter(self)
+
+    def _dbg(self, level, msg):
+        """Write debugging output to sys.stderr.
+        """
+        if level <= self.debug:
+            print(msg, file=sys.stderr)
+
+    def __enter__(self):
+        self._check()
+        return self
+
+    def __exit__(self, type, value, traceback):
+        if type is None:
+            self.close()
+        else:
+            # An exception occurred. We must not call close() because
+            # it would try to write end-of-archive blocks and padding.
+            if not self._extfileobj:
+                self.fileobj.close()
+            self.closed = True
+# class TarFile
+
+class TarIter(object):
+    """Iterator Class.
+
+       for tarinfo in TarFile(...):
+           suite...
+    """
+
+    def __init__(self, tarfile):
+        """Construct a TarIter object.
+        """
+        self.tarfile = tarfile
+        self.index = 0
+    def __iter__(self):
+        """Return iterator object.
+        """
+        return self
+
+    def __next__(self):
+        """Return the next item using TarFile's next() method.
+           When all members have been read, set TarFile as _loaded.
+        """
+        # Fix for SF #1100429: Under rare circumstances it can
+        # happen that getmembers() is called during iteration,
+        # which will cause TarIter to stop prematurely.
+        if not self.tarfile._loaded:
+            tarinfo = self.tarfile.next()
+            if not tarinfo:
+                self.tarfile._loaded = True
+                raise StopIteration
+        else:
+            try:
+                tarinfo = self.tarfile.members[self.index]
+            except IndexError:
+                raise StopIteration
+        self.index += 1
+        return tarinfo
+
+    next = __next__ # for Python 2.x
+
+#--------------------
+# exported functions
+#--------------------
+def is_tarfile(name):
+    """Return True if name points to a tar archive that we
+       are able to handle, else return False.
+    """
+    try:
+        t = open(name)
+        t.close()
+        return True
+    except TarError:
+        return False
+
+bltn_open = open
+open = TarFile.open
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/compat.py b/venv/Lib/site-packages/pip/_vendor/distlib/compat.py
new file mode 100644
index 000000000..c316fd973
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/compat.py
@@ -0,0 +1,1120 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2013-2017 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+from __future__ import absolute_import
+
+import os
+import re
+import sys
+
+try:
+    import ssl
+except ImportError:  # pragma: no cover
+    ssl = None
+
+if sys.version_info[0] < 3:  # pragma: no cover
+    from StringIO import StringIO
+    string_types = basestring,
+    text_type = unicode
+    from types import FileType as file_type
+    import __builtin__ as builtins
+    import ConfigParser as configparser
+    from ._backport import shutil
+    from urlparse import urlparse, urlunparse, urljoin, urlsplit, urlunsplit
+    from urllib import (urlretrieve, quote as _quote, unquote, url2pathname,
+                        pathname2url, ContentTooShortError, splittype)
+
+    def quote(s):
+        if isinstance(s, unicode):
+            s = s.encode('utf-8')
+        return _quote(s)
+
+    import urllib2
+    from urllib2 import (Request, urlopen, URLError, HTTPError,
+                         HTTPBasicAuthHandler, HTTPPasswordMgr,
+                         HTTPHandler, HTTPRedirectHandler,
+                         build_opener)
+    if ssl:
+        from urllib2 import HTTPSHandler
+    import httplib
+    import xmlrpclib
+    import Queue as queue
+    from HTMLParser import HTMLParser
+    import htmlentitydefs
+    raw_input = raw_input
+    from itertools import ifilter as filter
+    from itertools import ifilterfalse as filterfalse
+
+    _userprog = None
+    def splituser(host):
+        """splituser('user[:passwd]@host[:port]') --> 'user[:passwd]', 'host[:port]'."""
+        global _userprog
+        if _userprog is None:
+            import re
+            _userprog = re.compile('^(.*)@(.*)$')
+
+        match = _userprog.match(host)
+        if match: return match.group(1, 2)
+        return None, host
+
+else:  # pragma: no cover
+    from io import StringIO
+    string_types = str,
+    text_type = str
+    from io import TextIOWrapper as file_type
+    import builtins
+    import configparser
+    import shutil
+    from urllib.parse import (urlparse, urlunparse, urljoin, splituser, quote,
+                              unquote, urlsplit, urlunsplit, splittype)
+    from urllib.request import (urlopen, urlretrieve, Request, url2pathname,
+                                pathname2url,
+                                HTTPBasicAuthHandler, HTTPPasswordMgr,
+                                HTTPHandler, HTTPRedirectHandler,
+                                build_opener)
+    if ssl:
+        from urllib.request import HTTPSHandler
+    from urllib.error import HTTPError, URLError, ContentTooShortError
+    import http.client as httplib
+    import urllib.request as urllib2
+    import xmlrpc.client as xmlrpclib
+    import queue
+    from html.parser import HTMLParser
+    import html.entities as htmlentitydefs
+    raw_input = input
+    from itertools import filterfalse
+    filter = filter
+
+try:
+    from ssl import match_hostname, CertificateError
+except ImportError: # pragma: no cover
+    class CertificateError(ValueError):
+        pass
+
+
+    def _dnsname_match(dn, hostname, max_wildcards=1):
+        """Matching according to RFC 6125, section 6.4.3
+
+        http://tools.ietf.org/html/rfc6125#section-6.4.3
+        """
+        pats = []
+        if not dn:
+            return False
+
+        parts = dn.split('.')
+        leftmost, remainder = parts[0], parts[1:]
+
+        wildcards = leftmost.count('*')
+        if wildcards > max_wildcards:
+            # Issue #17980: avoid denials of service by refusing more
+            # than one wildcard per fragment.  A survey of established
+            # policy among SSL implementations showed it to be a
+            # reasonable choice.
+            raise CertificateError(
+                "too many wildcards in certificate DNS name: " + repr(dn))
+
+        # speed up common case w/o wildcards
+        if not wildcards:
+            return dn.lower() == hostname.lower()
+
+        # RFC 6125, section 6.4.3, subitem 1.
+        # The client SHOULD NOT attempt to match a presented identifier in which
+        # the wildcard character comprises a label other than the left-most label.
+        if leftmost == '*':
+            # When '*' is a fragment by itself, it matches a non-empty dotless
+            # fragment.
+            pats.append('[^.]+')
+        elif leftmost.startswith('xn--') or hostname.startswith('xn--'):
+            # RFC 6125, section 6.4.3, subitem 3.
+            # The client SHOULD NOT attempt to match a presented identifier
+            # where the wildcard character is embedded within an A-label or
+            # U-label of an internationalized domain name.
+            pats.append(re.escape(leftmost))
+        else:
+            # Otherwise, '*' matches any dotless string, e.g. www*
+            pats.append(re.escape(leftmost).replace(r'\*', '[^.]*'))
+
+        # add the remaining fragments, ignore any wildcards
+        for frag in remainder:
+            pats.append(re.escape(frag))
+
+        pat = re.compile(r'\A' + r'\.'.join(pats) + r'\Z', re.IGNORECASE)
+        return pat.match(hostname)
+
+
+    def match_hostname(cert, hostname):
+        """Verify that *cert* (in decoded format as returned by
+        SSLSocket.getpeercert()) matches the *hostname*.  RFC 2818 and RFC 6125
+        rules are followed, but IP addresses are not accepted for *hostname*.
+
+        CertificateError is raised on failure. On success, the function
+        returns nothing.
+        """
+        if not cert:
+            raise ValueError("empty or no certificate, match_hostname needs a "
+                             "SSL socket or SSL context with either "
+                             "CERT_OPTIONAL or CERT_REQUIRED")
+        dnsnames = []
+        san = cert.get('subjectAltName', ())
+        for key, value in san:
+            if key == 'DNS':
+                if _dnsname_match(value, hostname):
+                    return
+                dnsnames.append(value)
+        if not dnsnames:
+            # The subject is only checked when there is no dNSName entry
+            # in subjectAltName
+            for sub in cert.get('subject', ()):
+                for key, value in sub:
+                    # XXX according to RFC 2818, the most specific Common Name
+                    # must be used.
+                    if key == 'commonName':
+                        if _dnsname_match(value, hostname):
+                            return
+                        dnsnames.append(value)
+        if len(dnsnames) > 1:
+            raise CertificateError("hostname %r "
+                "doesn't match either of %s"
+                % (hostname, ', '.join(map(repr, dnsnames))))
+        elif len(dnsnames) == 1:
+            raise CertificateError("hostname %r "
+                "doesn't match %r"
+                % (hostname, dnsnames[0]))
+        else:
+            raise CertificateError("no appropriate commonName or "
+                "subjectAltName fields were found")
+
+
+try:
+    from types import SimpleNamespace as Container
+except ImportError:  # pragma: no cover
+    class Container(object):
+        """
+        A generic container for when multiple values need to be returned
+        """
+        def __init__(self, **kwargs):
+            self.__dict__.update(kwargs)
+
+
+try:
+    from shutil import which
+except ImportError:  # pragma: no cover
+    # Implementation from Python 3.3
+    def which(cmd, mode=os.F_OK | os.X_OK, path=None):
+        """Given a command, mode, and a PATH string, return the path which
+        conforms to the given mode on the PATH, or None if there is no such
+        file.
+
+        `mode` defaults to os.F_OK | os.X_OK. `path` defaults to the result
+        of os.environ.get("PATH"), or can be overridden with a custom search
+        path.
+
+        """
+        # Check that a given file can be accessed with the correct mode.
+        # Additionally check that `file` is not a directory, as on Windows
+        # directories pass the os.access check.
+        def _access_check(fn, mode):
+            return (os.path.exists(fn) and os.access(fn, mode)
+                    and not os.path.isdir(fn))
+
+        # If we're given a path with a directory part, look it up directly rather
+        # than referring to PATH directories. This includes checking relative to the
+        # current directory, e.g. ./script
+        if os.path.dirname(cmd):
+            if _access_check(cmd, mode):
+                return cmd
+            return None
+
+        if path is None:
+            path = os.environ.get("PATH", os.defpath)
+        if not path:
+            return None
+        path = path.split(os.pathsep)
+
+        if sys.platform == "win32":
+            # The current directory takes precedence on Windows.
+            if not os.curdir in path:
+                path.insert(0, os.curdir)
+
+            # PATHEXT is necessary to check on Windows.
+            pathext = os.environ.get("PATHEXT", "").split(os.pathsep)
+            # See if the given file matches any of the expected path extensions.
+            # This will allow us to short circuit when given "python.exe".
+            # If it does match, only test that one, otherwise we have to try
+            # others.
+            if any(cmd.lower().endswith(ext.lower()) for ext in pathext):
+                files = [cmd]
+            else:
+                files = [cmd + ext for ext in pathext]
+        else:
+            # On other platforms you don't have things like PATHEXT to tell you
+            # what file suffixes are executable, so just pass on cmd as-is.
+            files = [cmd]
+
+        seen = set()
+        for dir in path:
+            normdir = os.path.normcase(dir)
+            if not normdir in seen:
+                seen.add(normdir)
+                for thefile in files:
+                    name = os.path.join(dir, thefile)
+                    if _access_check(name, mode):
+                        return name
+        return None
+
+
+# ZipFile is a context manager in 2.7, but not in 2.6
+
+from zipfile import ZipFile as BaseZipFile
+
+if hasattr(BaseZipFile, '__enter__'):  # pragma: no cover
+    ZipFile = BaseZipFile
+else:  # pragma: no cover
+    from zipfile import ZipExtFile as BaseZipExtFile
+
+    class ZipExtFile(BaseZipExtFile):
+        def __init__(self, base):
+            self.__dict__.update(base.__dict__)
+
+        def __enter__(self):
+            return self
+
+        def __exit__(self, *exc_info):
+            self.close()
+            # return None, so if an exception occurred, it will propagate
+
+    class ZipFile(BaseZipFile):
+        def __enter__(self):
+            return self
+
+        def __exit__(self, *exc_info):
+            self.close()
+            # return None, so if an exception occurred, it will propagate
+
+        def open(self, *args, **kwargs):
+            base = BaseZipFile.open(self, *args, **kwargs)
+            return ZipExtFile(base)
+
+try:
+    from platform import python_implementation
+except ImportError: # pragma: no cover
+    def python_implementation():
+        """Return a string identifying the Python implementation."""
+        if 'PyPy' in sys.version:
+            return 'PyPy'
+        if os.name == 'java':
+            return 'Jython'
+        if sys.version.startswith('IronPython'):
+            return 'IronPython'
+        return 'CPython'
+
+try:
+    import sysconfig
+except ImportError: # pragma: no cover
+    from ._backport import sysconfig
+
+try:
+    callable = callable
+except NameError:   # pragma: no cover
+    from collections.abc import Callable
+
+    def callable(obj):
+        return isinstance(obj, Callable)
+
+
+try:
+    fsencode = os.fsencode
+    fsdecode = os.fsdecode
+except AttributeError:  # pragma: no cover
+    # Issue #99: on some systems (e.g. containerised),
+    # sys.getfilesystemencoding() returns None, and we need a real value,
+    # so fall back to utf-8. From the CPython 2.7 docs relating to Unix and
+    # sys.getfilesystemencoding(): the return value is "the user’s preference
+    # according to the result of nl_langinfo(CODESET), or None if the
+    # nl_langinfo(CODESET) failed."
+    _fsencoding = sys.getfilesystemencoding() or 'utf-8'
+    if _fsencoding == 'mbcs':
+        _fserrors = 'strict'
+    else:
+        _fserrors = 'surrogateescape'
+
+    def fsencode(filename):
+        if isinstance(filename, bytes):
+            return filename
+        elif isinstance(filename, text_type):
+            return filename.encode(_fsencoding, _fserrors)
+        else:
+            raise TypeError("expect bytes or str, not %s" %
+                            type(filename).__name__)
+
+    def fsdecode(filename):
+        if isinstance(filename, text_type):
+            return filename
+        elif isinstance(filename, bytes):
+            return filename.decode(_fsencoding, _fserrors)
+        else:
+            raise TypeError("expect bytes or str, not %s" %
+                            type(filename).__name__)
+
+try:
+    from tokenize import detect_encoding
+except ImportError: # pragma: no cover
+    from codecs import BOM_UTF8, lookup
+    import re
+
+    cookie_re = re.compile(r"coding[:=]\s*([-\w.]+)")
+
+    def _get_normal_name(orig_enc):
+        """Imitates get_normal_name in tokenizer.c."""
+        # Only care about the first 12 characters.
+        enc = orig_enc[:12].lower().replace("_", "-")
+        if enc == "utf-8" or enc.startswith("utf-8-"):
+            return "utf-8"
+        if enc in ("latin-1", "iso-8859-1", "iso-latin-1") or \
+           enc.startswith(("latin-1-", "iso-8859-1-", "iso-latin-1-")):
+            return "iso-8859-1"
+        return orig_enc
+
+    def detect_encoding(readline):
+        """
+        The detect_encoding() function is used to detect the encoding that should
+        be used to decode a Python source file.  It requires one argument, readline,
+        in the same way as the tokenize() generator.
+
+        It will call readline a maximum of twice, and return the encoding used
+        (as a string) and a list of any lines (left as bytes) it has read in.
+
+        It detects the encoding from the presence of a utf-8 bom or an encoding
+        cookie as specified in pep-0263.  If both a bom and a cookie are present,
+        but disagree, a SyntaxError will be raised.  If the encoding cookie is an
+        invalid charset, raise a SyntaxError.  Note that if a utf-8 bom is found,
+        'utf-8-sig' is returned.
+
+        If no encoding is specified, then the default of 'utf-8' will be returned.
+        """
+        try:
+            filename = readline.__self__.name
+        except AttributeError:
+            filename = None
+        bom_found = False
+        encoding = None
+        default = 'utf-8'
+        def read_or_stop():
+            try:
+                return readline()
+            except StopIteration:
+                return b''
+
+        def find_cookie(line):
+            try:
+                # Decode as UTF-8. Either the line is an encoding declaration,
+                # in which case it should be pure ASCII, or it must be UTF-8
+                # per default encoding.
+                line_string = line.decode('utf-8')
+            except UnicodeDecodeError:
+                msg = "invalid or missing encoding declaration"
+                if filename is not None:
+                    msg = '{} for {!r}'.format(msg, filename)
+                raise SyntaxError(msg)
+
+            matches = cookie_re.findall(line_string)
+            if not matches:
+                return None
+            encoding = _get_normal_name(matches[0])
+            try:
+                codec = lookup(encoding)
+            except LookupError:
+                # This behaviour mimics the Python interpreter
+                if filename is None:
+                    msg = "unknown encoding: " + encoding
+                else:
+                    msg = "unknown encoding for {!r}: {}".format(filename,
+                            encoding)
+                raise SyntaxError(msg)
+
+            if bom_found:
+                if codec.name != 'utf-8':
+                    # This behaviour mimics the Python interpreter
+                    if filename is None:
+                        msg = 'encoding problem: utf-8'
+                    else:
+                        msg = 'encoding problem for {!r}: utf-8'.format(filename)
+                    raise SyntaxError(msg)
+                encoding += '-sig'
+            return encoding
+
+        first = read_or_stop()
+        if first.startswith(BOM_UTF8):
+            bom_found = True
+            first = first[3:]
+            default = 'utf-8-sig'
+        if not first:
+            return default, []
+
+        encoding = find_cookie(first)
+        if encoding:
+            return encoding, [first]
+
+        second = read_or_stop()
+        if not second:
+            return default, [first]
+
+        encoding = find_cookie(second)
+        if encoding:
+            return encoding, [first, second]
+
+        return default, [first, second]
+
+# For converting & <-> &amp; etc.
+try:
+    from html import escape
+except ImportError:
+    from cgi import escape
+if sys.version_info[:2] < (3, 4):
+    unescape = HTMLParser().unescape
+else:
+    from html import unescape
+
+try:
+    from collections import ChainMap
+except ImportError: # pragma: no cover
+    from collections import MutableMapping
+
+    try:
+        from reprlib import recursive_repr as _recursive_repr
+    except ImportError:
+        def _recursive_repr(fillvalue='...'):
+            '''
+            Decorator to make a repr function return fillvalue for a recursive
+            call
+            '''
+
+            def decorating_function(user_function):
+                repr_running = set()
+
+                def wrapper(self):
+                    key = id(self), get_ident()
+                    if key in repr_running:
+                        return fillvalue
+                    repr_running.add(key)
+                    try:
+                        result = user_function(self)
+                    finally:
+                        repr_running.discard(key)
+                    return result
+
+                # Can't use functools.wraps() here because of bootstrap issues
+                wrapper.__module__ = getattr(user_function, '__module__')
+                wrapper.__doc__ = getattr(user_function, '__doc__')
+                wrapper.__name__ = getattr(user_function, '__name__')
+                wrapper.__annotations__ = getattr(user_function, '__annotations__', {})
+                return wrapper
+
+            return decorating_function
+
+    class ChainMap(MutableMapping):
+        ''' A ChainMap groups multiple dicts (or other mappings) together
+        to create a single, updateable view.
+
+        The underlying mappings are stored in a list.  That list is public and can
+        accessed or updated using the *maps* attribute.  There is no other state.
+
+        Lookups search the underlying mappings successively until a key is found.
+        In contrast, writes, updates, and deletions only operate on the first
+        mapping.
+
+        '''
+
+        def __init__(self, *maps):
+            '''Initialize a ChainMap by setting *maps* to the given mappings.
+            If no mappings are provided, a single empty dictionary is used.
+
+            '''
+            self.maps = list(maps) or [{}]          # always at least one map
+
+        def __missing__(self, key):
+            raise KeyError(key)
+
+        def __getitem__(self, key):
+            for mapping in self.maps:
+                try:
+                    return mapping[key]             # can't use 'key in mapping' with defaultdict
+                except KeyError:
+                    pass
+            return self.__missing__(key)            # support subclasses that define __missing__
+
+        def get(self, key, default=None):
+            return self[key] if key in self else default
+
+        def __len__(self):
+            return len(set().union(*self.maps))     # reuses stored hash values if possible
+
+        def __iter__(self):
+            return iter(set().union(*self.maps))
+
+        def __contains__(self, key):
+            return any(key in m for m in self.maps)
+
+        def __bool__(self):
+            return any(self.maps)
+
+        @_recursive_repr()
+        def __repr__(self):
+            return '{0.__class__.__name__}({1})'.format(
+                self, ', '.join(map(repr, self.maps)))
+
+        @classmethod
+        def fromkeys(cls, iterable, *args):
+            'Create a ChainMap with a single dict created from the iterable.'
+            return cls(dict.fromkeys(iterable, *args))
+
+        def copy(self):
+            'New ChainMap or subclass with a new copy of maps[0] and refs to maps[1:]'
+            return self.__class__(self.maps[0].copy(), *self.maps[1:])
+
+        __copy__ = copy
+
+        def new_child(self):                        # like Django's Context.push()
+            'New ChainMap with a new dict followed by all previous maps.'
+            return self.__class__({}, *self.maps)
+
+        @property
+        def parents(self):                          # like Django's Context.pop()
+            'New ChainMap from maps[1:].'
+            return self.__class__(*self.maps[1:])
+
+        def __setitem__(self, key, value):
+            self.maps[0][key] = value
+
+        def __delitem__(self, key):
+            try:
+                del self.maps[0][key]
+            except KeyError:
+                raise KeyError('Key not found in the first mapping: {!r}'.format(key))
+
+        def popitem(self):
+            'Remove and return an item pair from maps[0]. Raise KeyError is maps[0] is empty.'
+            try:
+                return self.maps[0].popitem()
+            except KeyError:
+                raise KeyError('No keys found in the first mapping.')
+
+        def pop(self, key, *args):
+            'Remove *key* from maps[0] and return its value. Raise KeyError if *key* not in maps[0].'
+            try:
+                return self.maps[0].pop(key, *args)
+            except KeyError:
+                raise KeyError('Key not found in the first mapping: {!r}'.format(key))
+
+        def clear(self):
+            'Clear maps[0], leaving maps[1:] intact.'
+            self.maps[0].clear()
+
+try:
+    from importlib.util import cache_from_source  # Python >= 3.4
+except ImportError:  # pragma: no cover
+    try:
+        from imp import cache_from_source
+    except ImportError:  # pragma: no cover
+        def cache_from_source(path, debug_override=None):
+            assert path.endswith('.py')
+            if debug_override is None:
+                debug_override = __debug__
+            if debug_override:
+                suffix = 'c'
+            else:
+                suffix = 'o'
+            return path + suffix
+
+try:
+    from collections import OrderedDict
+except ImportError: # pragma: no cover
+## {{{ http://code.activestate.com/recipes/576693/ (r9)
+# Backport of OrderedDict() class that runs on Python 2.4, 2.5, 2.6, 2.7 and pypy.
+# Passes Python2.7's test suite and incorporates all the latest updates.
+    try:
+        from thread import get_ident as _get_ident
+    except ImportError:
+        from dummy_thread import get_ident as _get_ident
+
+    try:
+        from _abcoll import KeysView, ValuesView, ItemsView
+    except ImportError:
+        pass
+
+
+    class OrderedDict(dict):
+        'Dictionary that remembers insertion order'
+        # An inherited dict maps keys to values.
+        # The inherited dict provides __getitem__, __len__, __contains__, and get.
+        # The remaining methods are order-aware.
+        # Big-O running times for all methods are the same as for regular dictionaries.
+
+        # The internal self.__map dictionary maps keys to links in a doubly linked list.
+        # The circular doubly linked list starts and ends with a sentinel element.
+        # The sentinel element never gets deleted (this simplifies the algorithm).
+        # Each link is stored as a list of length three:  [PREV, NEXT, KEY].
+
+        def __init__(self, *args, **kwds):
+            '''Initialize an ordered dictionary.  Signature is the same as for
+            regular dictionaries, but keyword arguments are not recommended
+            because their insertion order is arbitrary.
+
+            '''
+            if len(args) > 1:
+                raise TypeError('expected at most 1 arguments, got %d' % len(args))
+            try:
+                self.__root
+            except AttributeError:
+                self.__root = root = []                     # sentinel node
+                root[:] = [root, root, None]
+                self.__map = {}
+            self.__update(*args, **kwds)
+
+        def __setitem__(self, key, value, dict_setitem=dict.__setitem__):
+            'od.__setitem__(i, y) <==> od[i]=y'
+            # Setting a new item creates a new link which goes at the end of the linked
+            # list, and the inherited dictionary is updated with the new key/value pair.
+            if key not in self:
+                root = self.__root
+                last = root[0]
+                last[1] = root[0] = self.__map[key] = [last, root, key]
+            dict_setitem(self, key, value)
+
+        def __delitem__(self, key, dict_delitem=dict.__delitem__):
+            'od.__delitem__(y) <==> del od[y]'
+            # Deleting an existing item uses self.__map to find the link which is
+            # then removed by updating the links in the predecessor and successor nodes.
+            dict_delitem(self, key)
+            link_prev, link_next, key = self.__map.pop(key)
+            link_prev[1] = link_next
+            link_next[0] = link_prev
+
+        def __iter__(self):
+            'od.__iter__() <==> iter(od)'
+            root = self.__root
+            curr = root[1]
+            while curr is not root:
+                yield curr[2]
+                curr = curr[1]
+
+        def __reversed__(self):
+            'od.__reversed__() <==> reversed(od)'
+            root = self.__root
+            curr = root[0]
+            while curr is not root:
+                yield curr[2]
+                curr = curr[0]
+
+        def clear(self):
+            'od.clear() -> None.  Remove all items from od.'
+            try:
+                for node in self.__map.itervalues():
+                    del node[:]
+                root = self.__root
+                root[:] = [root, root, None]
+                self.__map.clear()
+            except AttributeError:
+                pass
+            dict.clear(self)
+
+        def popitem(self, last=True):
+            '''od.popitem() -> (k, v), return and remove a (key, value) pair.
+            Pairs are returned in LIFO order if last is true or FIFO order if false.
+
+            '''
+            if not self:
+                raise KeyError('dictionary is empty')
+            root = self.__root
+            if last:
+                link = root[0]
+                link_prev = link[0]
+                link_prev[1] = root
+                root[0] = link_prev
+            else:
+                link = root[1]
+                link_next = link[1]
+                root[1] = link_next
+                link_next[0] = root
+            key = link[2]
+            del self.__map[key]
+            value = dict.pop(self, key)
+            return key, value
+
+        # -- the following methods do not depend on the internal structure --
+
+        def keys(self):
+            'od.keys() -> list of keys in od'
+            return list(self)
+
+        def values(self):
+            'od.values() -> list of values in od'
+            return [self[key] for key in self]
+
+        def items(self):
+            'od.items() -> list of (key, value) pairs in od'
+            return [(key, self[key]) for key in self]
+
+        def iterkeys(self):
+            'od.iterkeys() -> an iterator over the keys in od'
+            return iter(self)
+
+        def itervalues(self):
+            'od.itervalues -> an iterator over the values in od'
+            for k in self:
+                yield self[k]
+
+        def iteritems(self):
+            'od.iteritems -> an iterator over the (key, value) items in od'
+            for k in self:
+                yield (k, self[k])
+
+        def update(*args, **kwds):
+            '''od.update(E, **F) -> None.  Update od from dict/iterable E and F.
+
+            If E is a dict instance, does:           for k in E: od[k] = E[k]
+            If E has a .keys() method, does:         for k in E.keys(): od[k] = E[k]
+            Or if E is an iterable of items, does:   for k, v in E: od[k] = v
+            In either case, this is followed by:     for k, v in F.items(): od[k] = v
+
+            '''
+            if len(args) > 2:
+                raise TypeError('update() takes at most 2 positional '
+                                'arguments (%d given)' % (len(args),))
+            elif not args:
+                raise TypeError('update() takes at least 1 argument (0 given)')
+            self = args[0]
+            # Make progressively weaker assumptions about "other"
+            other = ()
+            if len(args) == 2:
+                other = args[1]
+            if isinstance(other, dict):
+                for key in other:
+                    self[key] = other[key]
+            elif hasattr(other, 'keys'):
+                for key in other.keys():
+                    self[key] = other[key]
+            else:
+                for key, value in other:
+                    self[key] = value
+            for key, value in kwds.items():
+                self[key] = value
+
+        __update = update  # let subclasses override update without breaking __init__
+
+        __marker = object()
+
+        def pop(self, key, default=__marker):
+            '''od.pop(k[,d]) -> v, remove specified key and return the corresponding value.
+            If key is not found, d is returned if given, otherwise KeyError is raised.
+
+            '''
+            if key in self:
+                result = self[key]
+                del self[key]
+                return result
+            if default is self.__marker:
+                raise KeyError(key)
+            return default
+
+        def setdefault(self, key, default=None):
+            'od.setdefault(k[,d]) -> od.get(k,d), also set od[k]=d if k not in od'
+            if key in self:
+                return self[key]
+            self[key] = default
+            return default
+
+        def __repr__(self, _repr_running=None):
+            'od.__repr__() <==> repr(od)'
+            if not _repr_running: _repr_running = {}
+            call_key = id(self), _get_ident()
+            if call_key in _repr_running:
+                return '...'
+            _repr_running[call_key] = 1
+            try:
+                if not self:
+                    return '%s()' % (self.__class__.__name__,)
+                return '%s(%r)' % (self.__class__.__name__, self.items())
+            finally:
+                del _repr_running[call_key]
+
+        def __reduce__(self):
+            'Return state information for pickling'
+            items = [[k, self[k]] for k in self]
+            inst_dict = vars(self).copy()
+            for k in vars(OrderedDict()):
+                inst_dict.pop(k, None)
+            if inst_dict:
+                return (self.__class__, (items,), inst_dict)
+            return self.__class__, (items,)
+
+        def copy(self):
+            'od.copy() -> a shallow copy of od'
+            return self.__class__(self)
+
+        @classmethod
+        def fromkeys(cls, iterable, value=None):
+            '''OD.fromkeys(S[, v]) -> New ordered dictionary with keys from S
+            and values equal to v (which defaults to None).
+
+            '''
+            d = cls()
+            for key in iterable:
+                d[key] = value
+            return d
+
+        def __eq__(self, other):
+            '''od.__eq__(y) <==> od==y.  Comparison to another OD is order-sensitive
+            while comparison to a regular mapping is order-insensitive.
+
+            '''
+            if isinstance(other, OrderedDict):
+                return len(self)==len(other) and self.items() == other.items()
+            return dict.__eq__(self, other)
+
+        def __ne__(self, other):
+            return not self == other
+
+        # -- the following methods are only used in Python 2.7 --
+
+        def viewkeys(self):
+            "od.viewkeys() -> a set-like object providing a view on od's keys"
+            return KeysView(self)
+
+        def viewvalues(self):
+            "od.viewvalues() -> an object providing a view on od's values"
+            return ValuesView(self)
+
+        def viewitems(self):
+            "od.viewitems() -> a set-like object providing a view on od's items"
+            return ItemsView(self)
+
+try:
+    from logging.config import BaseConfigurator, valid_ident
+except ImportError: # pragma: no cover
+    IDENTIFIER = re.compile('^[a-z_][a-z0-9_]*$', re.I)
+
+
+    def valid_ident(s):
+        m = IDENTIFIER.match(s)
+        if not m:
+            raise ValueError('Not a valid Python identifier: %r' % s)
+        return True
+
+
+    # The ConvertingXXX classes are wrappers around standard Python containers,
+    # and they serve to convert any suitable values in the container. The
+    # conversion converts base dicts, lists and tuples to their wrapped
+    # equivalents, whereas strings which match a conversion format are converted
+    # appropriately.
+    #
+    # Each wrapper should have a configurator attribute holding the actual
+    # configurator to use for conversion.
+
+    class ConvertingDict(dict):
+        """A converting dictionary wrapper."""
+
+        def __getitem__(self, key):
+            value = dict.__getitem__(self, key)
+            result = self.configurator.convert(value)
+            #If the converted value is different, save for next time
+            if value is not result:
+                self[key] = result
+                if type(result) in (ConvertingDict, ConvertingList,
+                                    ConvertingTuple):
+                    result.parent = self
+                    result.key = key
+            return result
+
+        def get(self, key, default=None):
+            value = dict.get(self, key, default)
+            result = self.configurator.convert(value)
+            #If the converted value is different, save for next time
+            if value is not result:
+                self[key] = result
+                if type(result) in (ConvertingDict, ConvertingList,
+                                    ConvertingTuple):
+                    result.parent = self
+                    result.key = key
+            return result
+
+    def pop(self, key, default=None):
+        value = dict.pop(self, key, default)
+        result = self.configurator.convert(value)
+        if value is not result:
+            if type(result) in (ConvertingDict, ConvertingList,
+                                ConvertingTuple):
+                result.parent = self
+                result.key = key
+        return result
+
+    class ConvertingList(list):
+        """A converting list wrapper."""
+        def __getitem__(self, key):
+            value = list.__getitem__(self, key)
+            result = self.configurator.convert(value)
+            #If the converted value is different, save for next time
+            if value is not result:
+                self[key] = result
+                if type(result) in (ConvertingDict, ConvertingList,
+                                    ConvertingTuple):
+                    result.parent = self
+                    result.key = key
+            return result
+
+        def pop(self, idx=-1):
+            value = list.pop(self, idx)
+            result = self.configurator.convert(value)
+            if value is not result:
+                if type(result) in (ConvertingDict, ConvertingList,
+                                    ConvertingTuple):
+                    result.parent = self
+            return result
+
+    class ConvertingTuple(tuple):
+        """A converting tuple wrapper."""
+        def __getitem__(self, key):
+            value = tuple.__getitem__(self, key)
+            result = self.configurator.convert(value)
+            if value is not result:
+                if type(result) in (ConvertingDict, ConvertingList,
+                                    ConvertingTuple):
+                    result.parent = self
+                    result.key = key
+            return result
+
+    class BaseConfigurator(object):
+        """
+        The configurator base class which defines some useful defaults.
+        """
+
+        CONVERT_PATTERN = re.compile(r'^(?P<prefix>[a-z]+)://(?P<suffix>.*)$')
+
+        WORD_PATTERN = re.compile(r'^\s*(\w+)\s*')
+        DOT_PATTERN = re.compile(r'^\.\s*(\w+)\s*')
+        INDEX_PATTERN = re.compile(r'^\[\s*(\w+)\s*\]\s*')
+        DIGIT_PATTERN = re.compile(r'^\d+$')
+
+        value_converters = {
+            'ext' : 'ext_convert',
+            'cfg' : 'cfg_convert',
+        }
+
+        # We might want to use a different one, e.g. importlib
+        importer = staticmethod(__import__)
+
+        def __init__(self, config):
+            self.config = ConvertingDict(config)
+            self.config.configurator = self
+
+        def resolve(self, s):
+            """
+            Resolve strings to objects using standard import and attribute
+            syntax.
+            """
+            name = s.split('.')
+            used = name.pop(0)
+            try:
+                found = self.importer(used)
+                for frag in name:
+                    used += '.' + frag
+                    try:
+                        found = getattr(found, frag)
+                    except AttributeError:
+                        self.importer(used)
+                        found = getattr(found, frag)
+                return found
+            except ImportError:
+                e, tb = sys.exc_info()[1:]
+                v = ValueError('Cannot resolve %r: %s' % (s, e))
+                v.__cause__, v.__traceback__ = e, tb
+                raise v
+
+        def ext_convert(self, value):
+            """Default converter for the ext:// protocol."""
+            return self.resolve(value)
+
+        def cfg_convert(self, value):
+            """Default converter for the cfg:// protocol."""
+            rest = value
+            m = self.WORD_PATTERN.match(rest)
+            if m is None:
+                raise ValueError("Unable to convert %r" % value)
+            else:
+                rest = rest[m.end():]
+                d = self.config[m.groups()[0]]
+                #print d, rest
+                while rest:
+                    m = self.DOT_PATTERN.match(rest)
+                    if m:
+                        d = d[m.groups()[0]]
+                    else:
+                        m = self.INDEX_PATTERN.match(rest)
+                        if m:
+                            idx = m.groups()[0]
+                            if not self.DIGIT_PATTERN.match(idx):
+                                d = d[idx]
+                            else:
+                                try:
+                                    n = int(idx) # try as number first (most likely)
+                                    d = d[n]
+                                except TypeError:
+                                    d = d[idx]
+                    if m:
+                        rest = rest[m.end():]
+                    else:
+                        raise ValueError('Unable to convert '
+                                         '%r at %r' % (value, rest))
+            #rest should be empty
+            return d
+
+        def convert(self, value):
+            """
+            Convert values to an appropriate type. dicts, lists and tuples are
+            replaced by their converting alternatives. Strings are checked to
+            see if they have a conversion format and are converted if they do.
+            """
+            if not isinstance(value, ConvertingDict) and isinstance(value, dict):
+                value = ConvertingDict(value)
+                value.configurator = self
+            elif not isinstance(value, ConvertingList) and isinstance(value, list):
+                value = ConvertingList(value)
+                value.configurator = self
+            elif not isinstance(value, ConvertingTuple) and\
+                     isinstance(value, tuple):
+                value = ConvertingTuple(value)
+                value.configurator = self
+            elif isinstance(value, string_types):
+                m = self.CONVERT_PATTERN.match(value)
+                if m:
+                    d = m.groupdict()
+                    prefix = d['prefix']
+                    converter = self.value_converters.get(prefix, None)
+                    if converter:
+                        suffix = d['suffix']
+                        converter = getattr(self, converter)
+                        value = converter(suffix)
+            return value
+
+        def configure_custom(self, config):
+            """Configure an object with a user-supplied factory."""
+            c = config.pop('()')
+            if not callable(c):
+                c = self.resolve(c)
+            props = config.pop('.', None)
+            # Check for valid identifiers
+            kwargs = dict([(k, config[k]) for k in config if valid_ident(k)])
+            result = c(**kwargs)
+            if props:
+                for name, value in props.items():
+                    setattr(result, name, value)
+            return result
+
+        def as_tuple(self, value):
+            """Utility function which converts lists to tuples."""
+            if isinstance(value, list):
+                value = tuple(value)
+            return value
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/database.py b/venv/Lib/site-packages/pip/_vendor/distlib/database.py
new file mode 100644
index 000000000..0a90c300b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/database.py
@@ -0,0 +1,1339 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2017 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""PEP 376 implementation."""
+
+from __future__ import unicode_literals
+
+import base64
+import codecs
+import contextlib
+import hashlib
+import logging
+import os
+import posixpath
+import sys
+import zipimport
+
+from . import DistlibException, resources
+from .compat import StringIO
+from .version import get_scheme, UnsupportedVersionError
+from .metadata import (Metadata, METADATA_FILENAME, WHEEL_METADATA_FILENAME,
+                       LEGACY_METADATA_FILENAME)
+from .util import (parse_requirement, cached_property, parse_name_and_version,
+                   read_exports, write_exports, CSVReader, CSVWriter)
+
+
+__all__ = ['Distribution', 'BaseInstalledDistribution',
+           'InstalledDistribution', 'EggInfoDistribution',
+           'DistributionPath']
+
+
+logger = logging.getLogger(__name__)
+
+EXPORTS_FILENAME = 'pydist-exports.json'
+COMMANDS_FILENAME = 'pydist-commands.json'
+
+DIST_FILES = ('INSTALLER', METADATA_FILENAME, 'RECORD', 'REQUESTED',
+              'RESOURCES', EXPORTS_FILENAME, 'SHARED')
+
+DISTINFO_EXT = '.dist-info'
+
+
+class _Cache(object):
+    """
+    A simple cache mapping names and .dist-info paths to distributions
+    """
+    def __init__(self):
+        """
+        Initialise an instance. There is normally one for each DistributionPath.
+        """
+        self.name = {}
+        self.path = {}
+        self.generated = False
+
+    def clear(self):
+        """
+        Clear the cache, setting it to its initial state.
+        """
+        self.name.clear()
+        self.path.clear()
+        self.generated = False
+
+    def add(self, dist):
+        """
+        Add a distribution to the cache.
+        :param dist: The distribution to add.
+        """
+        if dist.path not in self.path:
+            self.path[dist.path] = dist
+            self.name.setdefault(dist.key, []).append(dist)
+
+
+class DistributionPath(object):
+    """
+    Represents a set of distributions installed on a path (typically sys.path).
+    """
+    def __init__(self, path=None, include_egg=False):
+        """
+        Create an instance from a path, optionally including legacy (distutils/
+        setuptools/distribute) distributions.
+        :param path: The path to use, as a list of directories. If not specified,
+                     sys.path is used.
+        :param include_egg: If True, this instance will look for and return legacy
+                            distributions as well as those based on PEP 376.
+        """
+        if path is None:
+            path = sys.path
+        self.path = path
+        self._include_dist = True
+        self._include_egg = include_egg
+
+        self._cache = _Cache()
+        self._cache_egg = _Cache()
+        self._cache_enabled = True
+        self._scheme = get_scheme('default')
+
+    def _get_cache_enabled(self):
+        return self._cache_enabled
+
+    def _set_cache_enabled(self, value):
+        self._cache_enabled = value
+
+    cache_enabled = property(_get_cache_enabled, _set_cache_enabled)
+
+    def clear_cache(self):
+        """
+        Clears the internal cache.
+        """
+        self._cache.clear()
+        self._cache_egg.clear()
+
+
+    def _yield_distributions(self):
+        """
+        Yield .dist-info and/or .egg(-info) distributions.
+        """
+        # We need to check if we've seen some resources already, because on
+        # some Linux systems (e.g. some Debian/Ubuntu variants) there are
+        # symlinks which alias other files in the environment.
+        seen = set()
+        for path in self.path:
+            finder = resources.finder_for_path(path)
+            if finder is None:
+                continue
+            r = finder.find('')
+            if not r or not r.is_container:
+                continue
+            rset = sorted(r.resources)
+            for entry in rset:
+                r = finder.find(entry)
+                if not r or r.path in seen:
+                    continue
+                if self._include_dist and entry.endswith(DISTINFO_EXT):
+                    possible_filenames = [METADATA_FILENAME,
+                                          WHEEL_METADATA_FILENAME,
+                                          LEGACY_METADATA_FILENAME]
+                    for metadata_filename in possible_filenames:
+                        metadata_path = posixpath.join(entry, metadata_filename)
+                        pydist = finder.find(metadata_path)
+                        if pydist:
+                            break
+                    else:
+                        continue
+
+                    with contextlib.closing(pydist.as_stream()) as stream:
+                        metadata = Metadata(fileobj=stream, scheme='legacy')
+                    logger.debug('Found %s', r.path)
+                    seen.add(r.path)
+                    yield new_dist_class(r.path, metadata=metadata,
+                                         env=self)
+                elif self._include_egg and entry.endswith(('.egg-info',
+                                                          '.egg')):
+                    logger.debug('Found %s', r.path)
+                    seen.add(r.path)
+                    yield old_dist_class(r.path, self)
+
+    def _generate_cache(self):
+        """
+        Scan the path for distributions and populate the cache with
+        those that are found.
+        """
+        gen_dist = not self._cache.generated
+        gen_egg = self._include_egg and not self._cache_egg.generated
+        if gen_dist or gen_egg:
+            for dist in self._yield_distributions():
+                if isinstance(dist, InstalledDistribution):
+                    self._cache.add(dist)
+                else:
+                    self._cache_egg.add(dist)
+
+            if gen_dist:
+                self._cache.generated = True
+            if gen_egg:
+                self._cache_egg.generated = True
+
+    @classmethod
+    def distinfo_dirname(cls, name, version):
+        """
+        The *name* and *version* parameters are converted into their
+        filename-escaped form, i.e. any ``'-'`` characters are replaced
+        with ``'_'`` other than the one in ``'dist-info'`` and the one
+        separating the name from the version number.
+
+        :parameter name: is converted to a standard distribution name by replacing
+                         any runs of non- alphanumeric characters with a single
+                         ``'-'``.
+        :type name: string
+        :parameter version: is converted to a standard version string. Spaces
+                            become dots, and all other non-alphanumeric characters
+                            (except dots) become dashes, with runs of multiple
+                            dashes condensed to a single dash.
+        :type version: string
+        :returns: directory name
+        :rtype: string"""
+        name = name.replace('-', '_')
+        return '-'.join([name, version]) + DISTINFO_EXT
+
+    def get_distributions(self):
+        """
+        Provides an iterator that looks for distributions and returns
+        :class:`InstalledDistribution` or
+        :class:`EggInfoDistribution` instances for each one of them.
+
+        :rtype: iterator of :class:`InstalledDistribution` and
+                :class:`EggInfoDistribution` instances
+        """
+        if not self._cache_enabled:
+            for dist in self._yield_distributions():
+                yield dist
+        else:
+            self._generate_cache()
+
+            for dist in self._cache.path.values():
+                yield dist
+
+            if self._include_egg:
+                for dist in self._cache_egg.path.values():
+                    yield dist
+
+    def get_distribution(self, name):
+        """
+        Looks for a named distribution on the path.
+
+        This function only returns the first result found, as no more than one
+        value is expected. If nothing is found, ``None`` is returned.
+
+        :rtype: :class:`InstalledDistribution`, :class:`EggInfoDistribution`
+                or ``None``
+        """
+        result = None
+        name = name.lower()
+        if not self._cache_enabled:
+            for dist in self._yield_distributions():
+                if dist.key == name:
+                    result = dist
+                    break
+        else:
+            self._generate_cache()
+
+            if name in self._cache.name:
+                result = self._cache.name[name][0]
+            elif self._include_egg and name in self._cache_egg.name:
+                result = self._cache_egg.name[name][0]
+        return result
+
+    def provides_distribution(self, name, version=None):
+        """
+        Iterates over all distributions to find which distributions provide *name*.
+        If a *version* is provided, it will be used to filter the results.
+
+        This function only returns the first result found, since no more than
+        one values are expected. If the directory is not found, returns ``None``.
+
+        :parameter version: a version specifier that indicates the version
+                            required, conforming to the format in ``PEP-345``
+
+        :type name: string
+        :type version: string
+        """
+        matcher = None
+        if version is not None:
+            try:
+                matcher = self._scheme.matcher('%s (%s)' % (name, version))
+            except ValueError:
+                raise DistlibException('invalid name or version: %r, %r' %
+                                      (name, version))
+
+        for dist in self.get_distributions():
+            # We hit a problem on Travis where enum34 was installed and doesn't
+            # have a provides attribute ...
+            if not hasattr(dist, 'provides'):
+                logger.debug('No "provides": %s', dist)
+            else:
+                provided = dist.provides
+
+                for p in provided:
+                    p_name, p_ver = parse_name_and_version(p)
+                    if matcher is None:
+                        if p_name == name:
+                            yield dist
+                            break
+                    else:
+                        if p_name == name and matcher.match(p_ver):
+                            yield dist
+                            break
+
+    def get_file_path(self, name, relative_path):
+        """
+        Return the path to a resource file.
+        """
+        dist = self.get_distribution(name)
+        if dist is None:
+            raise LookupError('no distribution named %r found' % name)
+        return dist.get_resource_path(relative_path)
+
+    def get_exported_entries(self, category, name=None):
+        """
+        Return all of the exported entries in a particular category.
+
+        :param category: The category to search for entries.
+        :param name: If specified, only entries with that name are returned.
+        """
+        for dist in self.get_distributions():
+            r = dist.exports
+            if category in r:
+                d = r[category]
+                if name is not None:
+                    if name in d:
+                        yield d[name]
+                else:
+                    for v in d.values():
+                        yield v
+
+
+class Distribution(object):
+    """
+    A base class for distributions, whether installed or from indexes.
+    Either way, it must have some metadata, so that's all that's needed
+    for construction.
+    """
+
+    build_time_dependency = False
+    """
+    Set to True if it's known to be only a build-time dependency (i.e.
+    not needed after installation).
+    """
+
+    requested = False
+    """A boolean that indicates whether the ``REQUESTED`` metadata file is
+    present (in other words, whether the package was installed by user
+    request or it was installed as a dependency)."""
+
+    def __init__(self, metadata):
+        """
+        Initialise an instance.
+        :param metadata: The instance of :class:`Metadata` describing this
+        distribution.
+        """
+        self.metadata = metadata
+        self.name = metadata.name
+        self.key = self.name.lower()    # for case-insensitive comparisons
+        self.version = metadata.version
+        self.locator = None
+        self.digest = None
+        self.extras = None      # additional features requested
+        self.context = None     # environment marker overrides
+        self.download_urls = set()
+        self.digests = {}
+
+    @property
+    def source_url(self):
+        """
+        The source archive download URL for this distribution.
+        """
+        return self.metadata.source_url
+
+    download_url = source_url   # Backward compatibility
+
+    @property
+    def name_and_version(self):
+        """
+        A utility property which displays the name and version in parentheses.
+        """
+        return '%s (%s)' % (self.name, self.version)
+
+    @property
+    def provides(self):
+        """
+        A set of distribution names and versions provided by this distribution.
+        :return: A set of "name (version)" strings.
+        """
+        plist = self.metadata.provides
+        s = '%s (%s)' % (self.name, self.version)
+        if s not in plist:
+            plist.append(s)
+        return plist
+
+    def _get_requirements(self, req_attr):
+        md = self.metadata
+        logger.debug('Getting requirements from metadata %r', md.todict())
+        reqts = getattr(md, req_attr)
+        return set(md.get_requirements(reqts, extras=self.extras,
+                                       env=self.context))
+
+    @property
+    def run_requires(self):
+        return self._get_requirements('run_requires')
+
+    @property
+    def meta_requires(self):
+        return self._get_requirements('meta_requires')
+
+    @property
+    def build_requires(self):
+        return self._get_requirements('build_requires')
+
+    @property
+    def test_requires(self):
+        return self._get_requirements('test_requires')
+
+    @property
+    def dev_requires(self):
+        return self._get_requirements('dev_requires')
+
+    def matches_requirement(self, req):
+        """
+        Say if this instance matches (fulfills) a requirement.
+        :param req: The requirement to match.
+        :rtype req: str
+        :return: True if it matches, else False.
+        """
+        # Requirement may contain extras - parse to lose those
+        # from what's passed to the matcher
+        r = parse_requirement(req)
+        scheme = get_scheme(self.metadata.scheme)
+        try:
+            matcher = scheme.matcher(r.requirement)
+        except UnsupportedVersionError:
+            # XXX compat-mode if cannot read the version
+            logger.warning('could not read version %r - using name only',
+                           req)
+            name = req.split()[0]
+            matcher = scheme.matcher(name)
+
+        name = matcher.key   # case-insensitive
+
+        result = False
+        for p in self.provides:
+            p_name, p_ver = parse_name_and_version(p)
+            if p_name != name:
+                continue
+            try:
+                result = matcher.match(p_ver)
+                break
+            except UnsupportedVersionError:
+                pass
+        return result
+
+    def __repr__(self):
+        """
+        Return a textual representation of this instance,
+        """
+        if self.source_url:
+            suffix = ' [%s]' % self.source_url
+        else:
+            suffix = ''
+        return '<Distribution %s (%s)%s>' % (self.name, self.version, suffix)
+
+    def __eq__(self, other):
+        """
+        See if this distribution is the same as another.
+        :param other: The distribution to compare with. To be equal to one
+                      another. distributions must have the same type, name,
+                      version and source_url.
+        :return: True if it is the same, else False.
+        """
+        if type(other) is not type(self):
+            result = False
+        else:
+            result = (self.name == other.name and
+                      self.version == other.version and
+                      self.source_url == other.source_url)
+        return result
+
+    def __hash__(self):
+        """
+        Compute hash in a way which matches the equality test.
+        """
+        return hash(self.name) + hash(self.version) + hash(self.source_url)
+
+
+class BaseInstalledDistribution(Distribution):
+    """
+    This is the base class for installed distributions (whether PEP 376 or
+    legacy).
+    """
+
+    hasher = None
+
+    def __init__(self, metadata, path, env=None):
+        """
+        Initialise an instance.
+        :param metadata: An instance of :class:`Metadata` which describes the
+                         distribution. This will normally have been initialised
+                         from a metadata file in the ``path``.
+        :param path:     The path of the ``.dist-info`` or ``.egg-info``
+                         directory for the distribution.
+        :param env:      This is normally the :class:`DistributionPath`
+                         instance where this distribution was found.
+        """
+        super(BaseInstalledDistribution, self).__init__(metadata)
+        self.path = path
+        self.dist_path = env
+
+    def get_hash(self, data, hasher=None):
+        """
+        Get the hash of some data, using a particular hash algorithm, if
+        specified.
+
+        :param data: The data to be hashed.
+        :type data: bytes
+        :param hasher: The name of a hash implementation, supported by hashlib,
+                       or ``None``. Examples of valid values are ``'sha1'``,
+                       ``'sha224'``, ``'sha384'``, '``sha256'``, ``'md5'`` and
+                       ``'sha512'``. If no hasher is specified, the ``hasher``
+                       attribute of the :class:`InstalledDistribution` instance
+                       is used. If the hasher is determined to be ``None``, MD5
+                       is used as the hashing algorithm.
+        :returns: The hash of the data. If a hasher was explicitly specified,
+                  the returned hash will be prefixed with the specified hasher
+                  followed by '='.
+        :rtype: str
+        """
+        if hasher is None:
+            hasher = self.hasher
+        if hasher is None:
+            hasher = hashlib.md5
+            prefix = ''
+        else:
+            hasher = getattr(hashlib, hasher)
+            prefix = '%s=' % self.hasher
+        digest = hasher(data).digest()
+        digest = base64.urlsafe_b64encode(digest).rstrip(b'=').decode('ascii')
+        return '%s%s' % (prefix, digest)
+
+
+class InstalledDistribution(BaseInstalledDistribution):
+    """
+    Created with the *path* of the ``.dist-info`` directory provided to the
+    constructor. It reads the metadata contained in ``pydist.json`` when it is
+    instantiated., or uses a passed in Metadata instance (useful for when
+    dry-run mode is being used).
+    """
+
+    hasher = 'sha256'
+
+    def __init__(self, path, metadata=None, env=None):
+        self.modules = []
+        self.finder = finder = resources.finder_for_path(path)
+        if finder is None:
+            raise ValueError('finder unavailable for %s' % path)
+        if env and env._cache_enabled and path in env._cache.path:
+            metadata = env._cache.path[path].metadata
+        elif metadata is None:
+            r = finder.find(METADATA_FILENAME)
+            # Temporary - for Wheel 0.23 support
+            if r is None:
+                r = finder.find(WHEEL_METADATA_FILENAME)
+            # Temporary - for legacy support
+            if r is None:
+                r = finder.find(LEGACY_METADATA_FILENAME)
+            if r is None:
+                raise ValueError('no %s found in %s' % (METADATA_FILENAME,
+                                                        path))
+            with contextlib.closing(r.as_stream()) as stream:
+                metadata = Metadata(fileobj=stream, scheme='legacy')
+
+        super(InstalledDistribution, self).__init__(metadata, path, env)
+
+        if env and env._cache_enabled:
+            env._cache.add(self)
+
+        r = finder.find('REQUESTED')
+        self.requested = r is not None
+        p  = os.path.join(path, 'top_level.txt')
+        if os.path.exists(p):
+            with open(p, 'rb') as f:
+                data = f.read().decode('utf-8')
+            self.modules = data.splitlines()
+
+    def __repr__(self):
+        return '<InstalledDistribution %r %s at %r>' % (
+            self.name, self.version, self.path)
+
+    def __str__(self):
+        return "%s %s" % (self.name, self.version)
+
+    def _get_records(self):
+        """
+        Get the list of installed files for the distribution
+        :return: A list of tuples of path, hash and size. Note that hash and
+                 size might be ``None`` for some entries. The path is exactly
+                 as stored in the file (which is as in PEP 376).
+        """
+        results = []
+        r = self.get_distinfo_resource('RECORD')
+        with contextlib.closing(r.as_stream()) as stream:
+            with CSVReader(stream=stream) as record_reader:
+                # Base location is parent dir of .dist-info dir
+                #base_location = os.path.dirname(self.path)
+                #base_location = os.path.abspath(base_location)
+                for row in record_reader:
+                    missing = [None for i in range(len(row), 3)]
+                    path, checksum, size = row + missing
+                    #if not os.path.isabs(path):
+                    #    path = path.replace('/', os.sep)
+                    #    path = os.path.join(base_location, path)
+                    results.append((path, checksum, size))
+        return results
+
+    @cached_property
+    def exports(self):
+        """
+        Return the information exported by this distribution.
+        :return: A dictionary of exports, mapping an export category to a dict
+                 of :class:`ExportEntry` instances describing the individual
+                 export entries, and keyed by name.
+        """
+        result = {}
+        r = self.get_distinfo_resource(EXPORTS_FILENAME)
+        if r:
+            result = self.read_exports()
+        return result
+
+    def read_exports(self):
+        """
+        Read exports data from a file in .ini format.
+
+        :return: A dictionary of exports, mapping an export category to a list
+                 of :class:`ExportEntry` instances describing the individual
+                 export entries.
+        """
+        result = {}
+        r = self.get_distinfo_resource(EXPORTS_FILENAME)
+        if r:
+            with contextlib.closing(r.as_stream()) as stream:
+                result = read_exports(stream)
+        return result
+
+    def write_exports(self, exports):
+        """
+        Write a dictionary of exports to a file in .ini format.
+        :param exports: A dictionary of exports, mapping an export category to
+                        a list of :class:`ExportEntry` instances describing the
+                        individual export entries.
+        """
+        rf = self.get_distinfo_file(EXPORTS_FILENAME)
+        with open(rf, 'w') as f:
+            write_exports(exports, f)
+
+    def get_resource_path(self, relative_path):
+        """
+        NOTE: This API may change in the future.
+
+        Return the absolute path to a resource file with the given relative
+        path.
+
+        :param relative_path: The path, relative to .dist-info, of the resource
+                              of interest.
+        :return: The absolute path where the resource is to be found.
+        """
+        r = self.get_distinfo_resource('RESOURCES')
+        with contextlib.closing(r.as_stream()) as stream:
+            with CSVReader(stream=stream) as resources_reader:
+                for relative, destination in resources_reader:
+                    if relative == relative_path:
+                        return destination
+        raise KeyError('no resource file with relative path %r '
+                       'is installed' % relative_path)
+
+    def list_installed_files(self):
+        """
+        Iterates over the ``RECORD`` entries and returns a tuple
+        ``(path, hash, size)`` for each line.
+
+        :returns: iterator of (path, hash, size)
+        """
+        for result in self._get_records():
+            yield result
+
+    def write_installed_files(self, paths, prefix, dry_run=False):
+        """
+        Writes the ``RECORD`` file, using the ``paths`` iterable passed in. Any
+        existing ``RECORD`` file is silently overwritten.
+
+        prefix is used to determine when to write absolute paths.
+        """
+        prefix = os.path.join(prefix, '')
+        base = os.path.dirname(self.path)
+        base_under_prefix = base.startswith(prefix)
+        base = os.path.join(base, '')
+        record_path = self.get_distinfo_file('RECORD')
+        logger.info('creating %s', record_path)
+        if dry_run:
+            return None
+        with CSVWriter(record_path) as writer:
+            for path in paths:
+                if os.path.isdir(path) or path.endswith(('.pyc', '.pyo')):
+                    # do not put size and hash, as in PEP-376
+                    hash_value = size = ''
+                else:
+                    size = '%d' % os.path.getsize(path)
+                    with open(path, 'rb') as fp:
+                        hash_value = self.get_hash(fp.read())
+                if path.startswith(base) or (base_under_prefix and
+                                             path.startswith(prefix)):
+                    path = os.path.relpath(path, base)
+                writer.writerow((path, hash_value, size))
+
+            # add the RECORD file itself
+            if record_path.startswith(base):
+                record_path = os.path.relpath(record_path, base)
+            writer.writerow((record_path, '', ''))
+        return record_path
+
+    def check_installed_files(self):
+        """
+        Checks that the hashes and sizes of the files in ``RECORD`` are
+        matched by the files themselves. Returns a (possibly empty) list of
+        mismatches. Each entry in the mismatch list will be a tuple consisting
+        of the path, 'exists', 'size' or 'hash' according to what didn't match
+        (existence is checked first, then size, then hash), the expected
+        value and the actual value.
+        """
+        mismatches = []
+        base = os.path.dirname(self.path)
+        record_path = self.get_distinfo_file('RECORD')
+        for path, hash_value, size in self.list_installed_files():
+            if not os.path.isabs(path):
+                path = os.path.join(base, path)
+            if path == record_path:
+                continue
+            if not os.path.exists(path):
+                mismatches.append((path, 'exists', True, False))
+            elif os.path.isfile(path):
+                actual_size = str(os.path.getsize(path))
+                if size and actual_size != size:
+                    mismatches.append((path, 'size', size, actual_size))
+                elif hash_value:
+                    if '=' in hash_value:
+                        hasher = hash_value.split('=', 1)[0]
+                    else:
+                        hasher = None
+
+                    with open(path, 'rb') as f:
+                        actual_hash = self.get_hash(f.read(), hasher)
+                        if actual_hash != hash_value:
+                            mismatches.append((path, 'hash', hash_value, actual_hash))
+        return mismatches
+
+    @cached_property
+    def shared_locations(self):
+        """
+        A dictionary of shared locations whose keys are in the set 'prefix',
+        'purelib', 'platlib', 'scripts', 'headers', 'data' and 'namespace'.
+        The corresponding value is the absolute path of that category for
+        this distribution, and takes into account any paths selected by the
+        user at installation time (e.g. via command-line arguments). In the
+        case of the 'namespace' key, this would be a list of absolute paths
+        for the roots of namespace packages in this distribution.
+
+        The first time this property is accessed, the relevant information is
+        read from the SHARED file in the .dist-info directory.
+        """
+        result = {}
+        shared_path = os.path.join(self.path, 'SHARED')
+        if os.path.isfile(shared_path):
+            with codecs.open(shared_path, 'r', encoding='utf-8') as f:
+                lines = f.read().splitlines()
+            for line in lines:
+                key, value = line.split('=', 1)
+                if key == 'namespace':
+                    result.setdefault(key, []).append(value)
+                else:
+                    result[key] = value
+        return result
+
+    def write_shared_locations(self, paths, dry_run=False):
+        """
+        Write shared location information to the SHARED file in .dist-info.
+        :param paths: A dictionary as described in the documentation for
+        :meth:`shared_locations`.
+        :param dry_run: If True, the action is logged but no file is actually
+                        written.
+        :return: The path of the file written to.
+        """
+        shared_path = os.path.join(self.path, 'SHARED')
+        logger.info('creating %s', shared_path)
+        if dry_run:
+            return None
+        lines = []
+        for key in ('prefix', 'lib', 'headers', 'scripts', 'data'):
+            path = paths[key]
+            if os.path.isdir(paths[key]):
+                lines.append('%s=%s' % (key,  path))
+        for ns in paths.get('namespace', ()):
+            lines.append('namespace=%s' % ns)
+
+        with codecs.open(shared_path, 'w', encoding='utf-8') as f:
+            f.write('\n'.join(lines))
+        return shared_path
+
+    def get_distinfo_resource(self, path):
+        if path not in DIST_FILES:
+            raise DistlibException('invalid path for a dist-info file: '
+                                   '%r at %r' % (path, self.path))
+        finder = resources.finder_for_path(self.path)
+        if finder is None:
+            raise DistlibException('Unable to get a finder for %s' % self.path)
+        return finder.find(path)
+
+    def get_distinfo_file(self, path):
+        """
+        Returns a path located under the ``.dist-info`` directory. Returns a
+        string representing the path.
+
+        :parameter path: a ``'/'``-separated path relative to the
+                         ``.dist-info`` directory or an absolute path;
+                         If *path* is an absolute path and doesn't start
+                         with the ``.dist-info`` directory path,
+                         a :class:`DistlibException` is raised
+        :type path: str
+        :rtype: str
+        """
+        # Check if it is an absolute path  # XXX use relpath, add tests
+        if path.find(os.sep) >= 0:
+            # it's an absolute path?
+            distinfo_dirname, path = path.split(os.sep)[-2:]
+            if distinfo_dirname != self.path.split(os.sep)[-1]:
+                raise DistlibException(
+                    'dist-info file %r does not belong to the %r %s '
+                    'distribution' % (path, self.name, self.version))
+
+        # The file must be relative
+        if path not in DIST_FILES:
+            raise DistlibException('invalid path for a dist-info file: '
+                                   '%r at %r' % (path, self.path))
+
+        return os.path.join(self.path, path)
+
+    def list_distinfo_files(self):
+        """
+        Iterates over the ``RECORD`` entries and returns paths for each line if
+        the path is pointing to a file located in the ``.dist-info`` directory
+        or one of its subdirectories.
+
+        :returns: iterator of paths
+        """
+        base = os.path.dirname(self.path)
+        for path, checksum, size in self._get_records():
+            # XXX add separator or use real relpath algo
+            if not os.path.isabs(path):
+                path = os.path.join(base, path)
+            if path.startswith(self.path):
+                yield path
+
+    def __eq__(self, other):
+        return (isinstance(other, InstalledDistribution) and
+                self.path == other.path)
+
+    # See http://docs.python.org/reference/datamodel#object.__hash__
+    __hash__ = object.__hash__
+
+
+class EggInfoDistribution(BaseInstalledDistribution):
+    """Created with the *path* of the ``.egg-info`` directory or file provided
+    to the constructor. It reads the metadata contained in the file itself, or
+    if the given path happens to be a directory, the metadata is read from the
+    file ``PKG-INFO`` under that directory."""
+
+    requested = True    # as we have no way of knowing, assume it was
+    shared_locations = {}
+
+    def __init__(self, path, env=None):
+        def set_name_and_version(s, n, v):
+            s.name = n
+            s.key = n.lower()   # for case-insensitive comparisons
+            s.version = v
+
+        self.path = path
+        self.dist_path = env
+        if env and env._cache_enabled and path in env._cache_egg.path:
+            metadata = env._cache_egg.path[path].metadata
+            set_name_and_version(self, metadata.name, metadata.version)
+        else:
+            metadata = self._get_metadata(path)
+
+            # Need to be set before caching
+            set_name_and_version(self, metadata.name, metadata.version)
+
+            if env and env._cache_enabled:
+                env._cache_egg.add(self)
+        super(EggInfoDistribution, self).__init__(metadata, path, env)
+
+    def _get_metadata(self, path):
+        requires = None
+
+        def parse_requires_data(data):
+            """Create a list of dependencies from a requires.txt file.
+
+            *data*: the contents of a setuptools-produced requires.txt file.
+            """
+            reqs = []
+            lines = data.splitlines()
+            for line in lines:
+                line = line.strip()
+                if line.startswith('['):
+                    logger.warning('Unexpected line: quitting requirement scan: %r',
+                                   line)
+                    break
+                r = parse_requirement(line)
+                if not r:
+                    logger.warning('Not recognised as a requirement: %r', line)
+                    continue
+                if r.extras:
+                    logger.warning('extra requirements in requires.txt are '
+                                   'not supported')
+                if not r.constraints:
+                    reqs.append(r.name)
+                else:
+                    cons = ', '.join('%s%s' % c for c in r.constraints)
+                    reqs.append('%s (%s)' % (r.name, cons))
+            return reqs
+
+        def parse_requires_path(req_path):
+            """Create a list of dependencies from a requires.txt file.
+
+            *req_path*: the path to a setuptools-produced requires.txt file.
+            """
+
+            reqs = []
+            try:
+                with codecs.open(req_path, 'r', 'utf-8') as fp:
+                    reqs = parse_requires_data(fp.read())
+            except IOError:
+                pass
+            return reqs
+
+        tl_path = tl_data = None
+        if path.endswith('.egg'):
+            if os.path.isdir(path):
+                p = os.path.join(path, 'EGG-INFO')
+                meta_path = os.path.join(p, 'PKG-INFO')
+                metadata = Metadata(path=meta_path, scheme='legacy')
+                req_path = os.path.join(p, 'requires.txt')
+                tl_path = os.path.join(p, 'top_level.txt')
+                requires = parse_requires_path(req_path)
+            else:
+                # FIXME handle the case where zipfile is not available
+                zipf = zipimport.zipimporter(path)
+                fileobj = StringIO(
+                    zipf.get_data('EGG-INFO/PKG-INFO').decode('utf8'))
+                metadata = Metadata(fileobj=fileobj, scheme='legacy')
+                try:
+                    data = zipf.get_data('EGG-INFO/requires.txt')
+                    tl_data = zipf.get_data('EGG-INFO/top_level.txt').decode('utf-8')
+                    requires = parse_requires_data(data.decode('utf-8'))
+                except IOError:
+                    requires = None
+        elif path.endswith('.egg-info'):
+            if os.path.isdir(path):
+                req_path = os.path.join(path, 'requires.txt')
+                requires = parse_requires_path(req_path)
+                path = os.path.join(path, 'PKG-INFO')
+                tl_path = os.path.join(path, 'top_level.txt')
+            metadata = Metadata(path=path, scheme='legacy')
+        else:
+            raise DistlibException('path must end with .egg-info or .egg, '
+                                   'got %r' % path)
+
+        if requires:
+            metadata.add_requirements(requires)
+        # look for top-level modules in top_level.txt, if present
+        if tl_data is None:
+            if tl_path is not None and os.path.exists(tl_path):
+                with open(tl_path, 'rb') as f:
+                    tl_data = f.read().decode('utf-8')
+        if not tl_data:
+            tl_data = []
+        else:
+            tl_data = tl_data.splitlines()
+        self.modules = tl_data
+        return metadata
+
+    def __repr__(self):
+        return '<EggInfoDistribution %r %s at %r>' % (
+            self.name, self.version, self.path)
+
+    def __str__(self):
+        return "%s %s" % (self.name, self.version)
+
+    def check_installed_files(self):
+        """
+        Checks that the hashes and sizes of the files in ``RECORD`` are
+        matched by the files themselves. Returns a (possibly empty) list of
+        mismatches. Each entry in the mismatch list will be a tuple consisting
+        of the path, 'exists', 'size' or 'hash' according to what didn't match
+        (existence is checked first, then size, then hash), the expected
+        value and the actual value.
+        """
+        mismatches = []
+        record_path = os.path.join(self.path, 'installed-files.txt')
+        if os.path.exists(record_path):
+            for path, _, _ in self.list_installed_files():
+                if path == record_path:
+                    continue
+                if not os.path.exists(path):
+                    mismatches.append((path, 'exists', True, False))
+        return mismatches
+
+    def list_installed_files(self):
+        """
+        Iterates over the ``installed-files.txt`` entries and returns a tuple
+        ``(path, hash, size)`` for each line.
+
+        :returns: a list of (path, hash, size)
+        """
+
+        def _md5(path):
+            f = open(path, 'rb')
+            try:
+                content = f.read()
+            finally:
+                f.close()
+            return hashlib.md5(content).hexdigest()
+
+        def _size(path):
+            return os.stat(path).st_size
+
+        record_path = os.path.join(self.path, 'installed-files.txt')
+        result = []
+        if os.path.exists(record_path):
+            with codecs.open(record_path, 'r', encoding='utf-8') as f:
+                for line in f:
+                    line = line.strip()
+                    p = os.path.normpath(os.path.join(self.path, line))
+                    # "./" is present as a marker between installed files
+                    # and installation metadata files
+                    if not os.path.exists(p):
+                        logger.warning('Non-existent file: %s', p)
+                        if p.endswith(('.pyc', '.pyo')):
+                            continue
+                        #otherwise fall through and fail
+                    if not os.path.isdir(p):
+                        result.append((p, _md5(p), _size(p)))
+            result.append((record_path, None, None))
+        return result
+
+    def list_distinfo_files(self, absolute=False):
+        """
+        Iterates over the ``installed-files.txt`` entries and returns paths for
+        each line if the path is pointing to a file located in the
+        ``.egg-info`` directory or one of its subdirectories.
+
+        :parameter absolute: If *absolute* is ``True``, each returned path is
+                          transformed into a local absolute path. Otherwise the
+                          raw value from ``installed-files.txt`` is returned.
+        :type absolute: boolean
+        :returns: iterator of paths
+        """
+        record_path = os.path.join(self.path, 'installed-files.txt')
+        if os.path.exists(record_path):
+            skip = True
+            with codecs.open(record_path, 'r', encoding='utf-8') as f:
+                for line in f:
+                    line = line.strip()
+                    if line == './':
+                        skip = False
+                        continue
+                    if not skip:
+                        p = os.path.normpath(os.path.join(self.path, line))
+                        if p.startswith(self.path):
+                            if absolute:
+                                yield p
+                            else:
+                                yield line
+
+    def __eq__(self, other):
+        return (isinstance(other, EggInfoDistribution) and
+                self.path == other.path)
+
+    # See http://docs.python.org/reference/datamodel#object.__hash__
+    __hash__ = object.__hash__
+
+new_dist_class = InstalledDistribution
+old_dist_class = EggInfoDistribution
+
+
+class DependencyGraph(object):
+    """
+    Represents a dependency graph between distributions.
+
+    The dependency relationships are stored in an ``adjacency_list`` that maps
+    distributions to a list of ``(other, label)`` tuples where  ``other``
+    is a distribution and the edge is labeled with ``label`` (i.e. the version
+    specifier, if such was provided). Also, for more efficient traversal, for
+    every distribution ``x``, a list of predecessors is kept in
+    ``reverse_list[x]``. An edge from distribution ``a`` to
+    distribution ``b`` means that ``a`` depends on ``b``. If any missing
+    dependencies are found, they are stored in ``missing``, which is a
+    dictionary that maps distributions to a list of requirements that were not
+    provided by any other distributions.
+    """
+
+    def __init__(self):
+        self.adjacency_list = {}
+        self.reverse_list = {}
+        self.missing = {}
+
+    def add_distribution(self, distribution):
+        """Add the *distribution* to the graph.
+
+        :type distribution: :class:`distutils2.database.InstalledDistribution`
+                            or :class:`distutils2.database.EggInfoDistribution`
+        """
+        self.adjacency_list[distribution] = []
+        self.reverse_list[distribution] = []
+        #self.missing[distribution] = []
+
+    def add_edge(self, x, y, label=None):
+        """Add an edge from distribution *x* to distribution *y* with the given
+        *label*.
+
+        :type x: :class:`distutils2.database.InstalledDistribution` or
+                 :class:`distutils2.database.EggInfoDistribution`
+        :type y: :class:`distutils2.database.InstalledDistribution` or
+                 :class:`distutils2.database.EggInfoDistribution`
+        :type label: ``str`` or ``None``
+        """
+        self.adjacency_list[x].append((y, label))
+        # multiple edges are allowed, so be careful
+        if x not in self.reverse_list[y]:
+            self.reverse_list[y].append(x)
+
+    def add_missing(self, distribution, requirement):
+        """
+        Add a missing *requirement* for the given *distribution*.
+
+        :type distribution: :class:`distutils2.database.InstalledDistribution`
+                            or :class:`distutils2.database.EggInfoDistribution`
+        :type requirement: ``str``
+        """
+        logger.debug('%s missing %r', distribution, requirement)
+        self.missing.setdefault(distribution, []).append(requirement)
+
+    def _repr_dist(self, dist):
+        return '%s %s' % (dist.name, dist.version)
+
+    def repr_node(self, dist, level=1):
+        """Prints only a subgraph"""
+        output = [self._repr_dist(dist)]
+        for other, label in self.adjacency_list[dist]:
+            dist = self._repr_dist(other)
+            if label is not None:
+                dist = '%s [%s]' % (dist, label)
+            output.append('    ' * level + str(dist))
+            suboutput = self.repr_node(other, level + 1)
+            subs = suboutput.split('\n')
+            output.extend(subs[1:])
+        return '\n'.join(output)
+
+    def to_dot(self, f, skip_disconnected=True):
+        """Writes a DOT output for the graph to the provided file *f*.
+
+        If *skip_disconnected* is set to ``True``, then all distributions
+        that are not dependent on any other distribution are skipped.
+
+        :type f: has to support ``file``-like operations
+        :type skip_disconnected: ``bool``
+        """
+        disconnected = []
+
+        f.write("digraph dependencies {\n")
+        for dist, adjs in self.adjacency_list.items():
+            if len(adjs) == 0 and not skip_disconnected:
+                disconnected.append(dist)
+            for other, label in adjs:
+                if not label is None:
+                    f.write('"%s" -> "%s" [label="%s"]\n' %
+                            (dist.name, other.name, label))
+                else:
+                    f.write('"%s" -> "%s"\n' % (dist.name, other.name))
+        if not skip_disconnected and len(disconnected) > 0:
+            f.write('subgraph disconnected {\n')
+            f.write('label = "Disconnected"\n')
+            f.write('bgcolor = red\n')
+
+            for dist in disconnected:
+                f.write('"%s"' % dist.name)
+                f.write('\n')
+            f.write('}\n')
+        f.write('}\n')
+
+    def topological_sort(self):
+        """
+        Perform a topological sort of the graph.
+        :return: A tuple, the first element of which is a topologically sorted
+                 list of distributions, and the second element of which is a
+                 list of distributions that cannot be sorted because they have
+                 circular dependencies and so form a cycle.
+        """
+        result = []
+        # Make a shallow copy of the adjacency list
+        alist = {}
+        for k, v in self.adjacency_list.items():
+            alist[k] = v[:]
+        while True:
+            # See what we can remove in this run
+            to_remove = []
+            for k, v in list(alist.items())[:]:
+                if not v:
+                    to_remove.append(k)
+                    del alist[k]
+            if not to_remove:
+                # What's left in alist (if anything) is a cycle.
+                break
+            # Remove from the adjacency list of others
+            for k, v in alist.items():
+                alist[k] = [(d, r) for d, r in v if d not in to_remove]
+            logger.debug('Moving to result: %s',
+                         ['%s (%s)' % (d.name, d.version) for d in to_remove])
+            result.extend(to_remove)
+        return result, list(alist.keys())
+
+    def __repr__(self):
+        """Representation of the graph"""
+        output = []
+        for dist, adjs in self.adjacency_list.items():
+            output.append(self.repr_node(dist))
+        return '\n'.join(output)
+
+
+def make_graph(dists, scheme='default'):
+    """Makes a dependency graph from the given distributions.
+
+    :parameter dists: a list of distributions
+    :type dists: list of :class:`distutils2.database.InstalledDistribution` and
+                 :class:`distutils2.database.EggInfoDistribution` instances
+    :rtype: a :class:`DependencyGraph` instance
+    """
+    scheme = get_scheme(scheme)
+    graph = DependencyGraph()
+    provided = {}  # maps names to lists of (version, dist) tuples
+
+    # first, build the graph and find out what's provided
+    for dist in dists:
+        graph.add_distribution(dist)
+
+        for p in dist.provides:
+            name, version = parse_name_and_version(p)
+            logger.debug('Add to provided: %s, %s, %s', name, version, dist)
+            provided.setdefault(name, []).append((version, dist))
+
+    # now make the edges
+    for dist in dists:
+        requires = (dist.run_requires | dist.meta_requires |
+                    dist.build_requires | dist.dev_requires)
+        for req in requires:
+            try:
+                matcher = scheme.matcher(req)
+            except UnsupportedVersionError:
+                # XXX compat-mode if cannot read the version
+                logger.warning('could not read version %r - using name only',
+                               req)
+                name = req.split()[0]
+                matcher = scheme.matcher(name)
+
+            name = matcher.key   # case-insensitive
+
+            matched = False
+            if name in provided:
+                for version, provider in provided[name]:
+                    try:
+                        match = matcher.match(version)
+                    except UnsupportedVersionError:
+                        match = False
+
+                    if match:
+                        graph.add_edge(dist, provider, req)
+                        matched = True
+                        break
+            if not matched:
+                graph.add_missing(dist, req)
+    return graph
+
+
+def get_dependent_dists(dists, dist):
+    """Recursively generate a list of distributions from *dists* that are
+    dependent on *dist*.
+
+    :param dists: a list of distributions
+    :param dist: a distribution, member of *dists* for which we are interested
+    """
+    if dist not in dists:
+        raise DistlibException('given distribution %r is not a member '
+                               'of the list' % dist.name)
+    graph = make_graph(dists)
+
+    dep = [dist]  # dependent distributions
+    todo = graph.reverse_list[dist]  # list of nodes we should inspect
+
+    while todo:
+        d = todo.pop()
+        dep.append(d)
+        for succ in graph.reverse_list[d]:
+            if succ not in dep:
+                todo.append(succ)
+
+    dep.pop(0)  # remove dist from dep, was there to prevent infinite loops
+    return dep
+
+
+def get_required_dists(dists, dist):
+    """Recursively generate a list of distributions from *dists* that are
+    required by *dist*.
+
+    :param dists: a list of distributions
+    :param dist: a distribution, member of *dists* for which we are interested
+    """
+    if dist not in dists:
+        raise DistlibException('given distribution %r is not a member '
+                               'of the list' % dist.name)
+    graph = make_graph(dists)
+
+    req = []  # required distributions
+    todo = graph.adjacency_list[dist]  # list of nodes we should inspect
+
+    while todo:
+        d = todo.pop()[0]
+        req.append(d)
+        for pred in graph.adjacency_list[d]:
+            if pred not in req:
+                todo.append(pred)
+
+    return req
+
+
+def make_dist(name, version, **kwargs):
+    """
+    A convenience method for making a dist given just a name and version.
+    """
+    summary = kwargs.pop('summary', 'Placeholder for summary')
+    md = Metadata(**kwargs)
+    md.name = name
+    md.version = version
+    md.summary = summary or 'Placeholder for summary'
+    return Distribution(md)
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/index.py b/venv/Lib/site-packages/pip/_vendor/distlib/index.py
new file mode 100644
index 000000000..7a87cdcf7
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/index.py
@@ -0,0 +1,516 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2013 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+import hashlib
+import logging
+import os
+import shutil
+import subprocess
+import tempfile
+try:
+    from threading import Thread
+except ImportError:
+    from dummy_threading import Thread
+
+from . import DistlibException
+from .compat import (HTTPBasicAuthHandler, Request, HTTPPasswordMgr,
+                     urlparse, build_opener, string_types)
+from .util import cached_property, zip_dir, ServerProxy
+
+logger = logging.getLogger(__name__)
+
+DEFAULT_INDEX = 'https://pypi.org/pypi'
+DEFAULT_REALM = 'pypi'
+
+class PackageIndex(object):
+    """
+    This class represents a package index compatible with PyPI, the Python
+    Package Index.
+    """
+
+    boundary = b'----------ThIs_Is_tHe_distlib_index_bouNdaRY_$'
+
+    def __init__(self, url=None):
+        """
+        Initialise an instance.
+
+        :param url: The URL of the index. If not specified, the URL for PyPI is
+                    used.
+        """
+        self.url = url or DEFAULT_INDEX
+        self.read_configuration()
+        scheme, netloc, path, params, query, frag = urlparse(self.url)
+        if params or query or frag or scheme not in ('http', 'https'):
+            raise DistlibException('invalid repository: %s' % self.url)
+        self.password_handler = None
+        self.ssl_verifier = None
+        self.gpg = None
+        self.gpg_home = None
+        with open(os.devnull, 'w') as sink:
+            # Use gpg by default rather than gpg2, as gpg2 insists on
+            # prompting for passwords
+            for s in ('gpg', 'gpg2'):
+                try:
+                    rc = subprocess.check_call([s, '--version'], stdout=sink,
+                                               stderr=sink)
+                    if rc == 0:
+                        self.gpg = s
+                        break
+                except OSError:
+                    pass
+
+    def _get_pypirc_command(self):
+        """
+        Get the distutils command for interacting with PyPI configurations.
+        :return: the command.
+        """
+        from distutils.core import Distribution
+        from distutils.config import PyPIRCCommand
+        d = Distribution()
+        return PyPIRCCommand(d)
+
+    def read_configuration(self):
+        """
+        Read the PyPI access configuration as supported by distutils, getting
+        PyPI to do the actual work. This populates ``username``, ``password``,
+        ``realm`` and ``url`` attributes from the configuration.
+        """
+        # get distutils to do the work
+        c = self._get_pypirc_command()
+        c.repository = self.url
+        cfg = c._read_pypirc()
+        self.username = cfg.get('username')
+        self.password = cfg.get('password')
+        self.realm = cfg.get('realm', 'pypi')
+        self.url = cfg.get('repository', self.url)
+
+    def save_configuration(self):
+        """
+        Save the PyPI access configuration. You must have set ``username`` and
+        ``password`` attributes before calling this method.
+
+        Again, distutils is used to do the actual work.
+        """
+        self.check_credentials()
+        # get distutils to do the work
+        c = self._get_pypirc_command()
+        c._store_pypirc(self.username, self.password)
+
+    def check_credentials(self):
+        """
+        Check that ``username`` and ``password`` have been set, and raise an
+        exception if not.
+        """
+        if self.username is None or self.password is None:
+            raise DistlibException('username and password must be set')
+        pm = HTTPPasswordMgr()
+        _, netloc, _, _, _, _ = urlparse(self.url)
+        pm.add_password(self.realm, netloc, self.username, self.password)
+        self.password_handler = HTTPBasicAuthHandler(pm)
+
+    def register(self, metadata):
+        """
+        Register a distribution on PyPI, using the provided metadata.
+
+        :param metadata: A :class:`Metadata` instance defining at least a name
+                         and version number for the distribution to be
+                         registered.
+        :return: The HTTP response received from PyPI upon submission of the
+                request.
+        """
+        self.check_credentials()
+        metadata.validate()
+        d = metadata.todict()
+        d[':action'] = 'verify'
+        request = self.encode_request(d.items(), [])
+        response = self.send_request(request)
+        d[':action'] = 'submit'
+        request = self.encode_request(d.items(), [])
+        return self.send_request(request)
+
+    def _reader(self, name, stream, outbuf):
+        """
+        Thread runner for reading lines of from a subprocess into a buffer.
+
+        :param name: The logical name of the stream (used for logging only).
+        :param stream: The stream to read from. This will typically a pipe
+                       connected to the output stream of a subprocess.
+        :param outbuf: The list to append the read lines to.
+        """
+        while True:
+            s = stream.readline()
+            if not s:
+                break
+            s = s.decode('utf-8').rstrip()
+            outbuf.append(s)
+            logger.debug('%s: %s' % (name, s))
+        stream.close()
+
+    def get_sign_command(self, filename, signer, sign_password,
+                         keystore=None):
+        """
+        Return a suitable command for signing a file.
+
+        :param filename: The pathname to the file to be signed.
+        :param signer: The identifier of the signer of the file.
+        :param sign_password: The passphrase for the signer's
+                              private key used for signing.
+        :param keystore: The path to a directory which contains the keys
+                         used in verification. If not specified, the
+                         instance's ``gpg_home`` attribute is used instead.
+        :return: The signing command as a list suitable to be
+                 passed to :class:`subprocess.Popen`.
+        """
+        cmd = [self.gpg, '--status-fd', '2', '--no-tty']
+        if keystore is None:
+            keystore = self.gpg_home
+        if keystore:
+            cmd.extend(['--homedir', keystore])
+        if sign_password is not None:
+            cmd.extend(['--batch', '--passphrase-fd', '0'])
+        td = tempfile.mkdtemp()
+        sf = os.path.join(td, os.path.basename(filename) + '.asc')
+        cmd.extend(['--detach-sign', '--armor', '--local-user',
+                    signer, '--output', sf, filename])
+        logger.debug('invoking: %s', ' '.join(cmd))
+        return cmd, sf
+
+    def run_command(self, cmd, input_data=None):
+        """
+        Run a command in a child process , passing it any input data specified.
+
+        :param cmd: The command to run.
+        :param input_data: If specified, this must be a byte string containing
+                           data to be sent to the child process.
+        :return: A tuple consisting of the subprocess' exit code, a list of
+                 lines read from the subprocess' ``stdout``, and a list of
+                 lines read from the subprocess' ``stderr``.
+        """
+        kwargs = {
+            'stdout': subprocess.PIPE,
+            'stderr': subprocess.PIPE,
+        }
+        if input_data is not None:
+            kwargs['stdin'] = subprocess.PIPE
+        stdout = []
+        stderr = []
+        p = subprocess.Popen(cmd, **kwargs)
+        # We don't use communicate() here because we may need to
+        # get clever with interacting with the command
+        t1 = Thread(target=self._reader, args=('stdout', p.stdout, stdout))
+        t1.start()
+        t2 = Thread(target=self._reader, args=('stderr', p.stderr, stderr))
+        t2.start()
+        if input_data is not None:
+            p.stdin.write(input_data)
+            p.stdin.close()
+
+        p.wait()
+        t1.join()
+        t2.join()
+        return p.returncode, stdout, stderr
+
+    def sign_file(self, filename, signer, sign_password, keystore=None):
+        """
+        Sign a file.
+
+        :param filename: The pathname to the file to be signed.
+        :param signer: The identifier of the signer of the file.
+        :param sign_password: The passphrase for the signer's
+                              private key used for signing.
+        :param keystore: The path to a directory which contains the keys
+                         used in signing. If not specified, the instance's
+                         ``gpg_home`` attribute is used instead.
+        :return: The absolute pathname of the file where the signature is
+                 stored.
+        """
+        cmd, sig_file = self.get_sign_command(filename, signer, sign_password,
+                                              keystore)
+        rc, stdout, stderr = self.run_command(cmd,
+                                              sign_password.encode('utf-8'))
+        if rc != 0:
+            raise DistlibException('sign command failed with error '
+                                   'code %s' % rc)
+        return sig_file
+
+    def upload_file(self, metadata, filename, signer=None, sign_password=None,
+                    filetype='sdist', pyversion='source', keystore=None):
+        """
+        Upload a release file to the index.
+
+        :param metadata: A :class:`Metadata` instance defining at least a name
+                         and version number for the file to be uploaded.
+        :param filename: The pathname of the file to be uploaded.
+        :param signer: The identifier of the signer of the file.
+        :param sign_password: The passphrase for the signer's
+                              private key used for signing.
+        :param filetype: The type of the file being uploaded. This is the
+                        distutils command which produced that file, e.g.
+                        ``sdist`` or ``bdist_wheel``.
+        :param pyversion: The version of Python which the release relates
+                          to. For code compatible with any Python, this would
+                          be ``source``, otherwise it would be e.g. ``3.2``.
+        :param keystore: The path to a directory which contains the keys
+                         used in signing. If not specified, the instance's
+                         ``gpg_home`` attribute is used instead.
+        :return: The HTTP response received from PyPI upon submission of the
+                request.
+        """
+        self.check_credentials()
+        if not os.path.exists(filename):
+            raise DistlibException('not found: %s' % filename)
+        metadata.validate()
+        d = metadata.todict()
+        sig_file = None
+        if signer:
+            if not self.gpg:
+                logger.warning('no signing program available - not signed')
+            else:
+                sig_file = self.sign_file(filename, signer, sign_password,
+                                          keystore)
+        with open(filename, 'rb') as f:
+            file_data = f.read()
+        md5_digest = hashlib.md5(file_data).hexdigest()
+        sha256_digest = hashlib.sha256(file_data).hexdigest()
+        d.update({
+            ':action': 'file_upload',
+            'protocol_version': '1',
+            'filetype': filetype,
+            'pyversion': pyversion,
+            'md5_digest': md5_digest,
+            'sha256_digest': sha256_digest,
+        })
+        files = [('content', os.path.basename(filename), file_data)]
+        if sig_file:
+            with open(sig_file, 'rb') as f:
+                sig_data = f.read()
+            files.append(('gpg_signature', os.path.basename(sig_file),
+                         sig_data))
+            shutil.rmtree(os.path.dirname(sig_file))
+        request = self.encode_request(d.items(), files)
+        return self.send_request(request)
+
+    def upload_documentation(self, metadata, doc_dir):
+        """
+        Upload documentation to the index.
+
+        :param metadata: A :class:`Metadata` instance defining at least a name
+                         and version number for the documentation to be
+                         uploaded.
+        :param doc_dir: The pathname of the directory which contains the
+                        documentation. This should be the directory that
+                        contains the ``index.html`` for the documentation.
+        :return: The HTTP response received from PyPI upon submission of the
+                request.
+        """
+        self.check_credentials()
+        if not os.path.isdir(doc_dir):
+            raise DistlibException('not a directory: %r' % doc_dir)
+        fn = os.path.join(doc_dir, 'index.html')
+        if not os.path.exists(fn):
+            raise DistlibException('not found: %r' % fn)
+        metadata.validate()
+        name, version = metadata.name, metadata.version
+        zip_data = zip_dir(doc_dir).getvalue()
+        fields = [(':action', 'doc_upload'),
+                  ('name', name), ('version', version)]
+        files = [('content', name, zip_data)]
+        request = self.encode_request(fields, files)
+        return self.send_request(request)
+
+    def get_verify_command(self, signature_filename, data_filename,
+                           keystore=None):
+        """
+        Return a suitable command for verifying a file.
+
+        :param signature_filename: The pathname to the file containing the
+                                   signature.
+        :param data_filename: The pathname to the file containing the
+                              signed data.
+        :param keystore: The path to a directory which contains the keys
+                         used in verification. If not specified, the
+                         instance's ``gpg_home`` attribute is used instead.
+        :return: The verifying command as a list suitable to be
+                 passed to :class:`subprocess.Popen`.
+        """
+        cmd = [self.gpg, '--status-fd', '2', '--no-tty']
+        if keystore is None:
+            keystore = self.gpg_home
+        if keystore:
+            cmd.extend(['--homedir', keystore])
+        cmd.extend(['--verify', signature_filename, data_filename])
+        logger.debug('invoking: %s', ' '.join(cmd))
+        return cmd
+
+    def verify_signature(self, signature_filename, data_filename,
+                         keystore=None):
+        """
+        Verify a signature for a file.
+
+        :param signature_filename: The pathname to the file containing the
+                                   signature.
+        :param data_filename: The pathname to the file containing the
+                              signed data.
+        :param keystore: The path to a directory which contains the keys
+                         used in verification. If not specified, the
+                         instance's ``gpg_home`` attribute is used instead.
+        :return: True if the signature was verified, else False.
+        """
+        if not self.gpg:
+            raise DistlibException('verification unavailable because gpg '
+                                   'unavailable')
+        cmd = self.get_verify_command(signature_filename, data_filename,
+                                      keystore)
+        rc, stdout, stderr = self.run_command(cmd)
+        if rc not in (0, 1):
+            raise DistlibException('verify command failed with error '
+                             'code %s' % rc)
+        return rc == 0
+
+    def download_file(self, url, destfile, digest=None, reporthook=None):
+        """
+        This is a convenience method for downloading a file from an URL.
+        Normally, this will be a file from the index, though currently
+        no check is made for this (i.e. a file can be downloaded from
+        anywhere).
+
+        The method is just like the :func:`urlretrieve` function in the
+        standard library, except that it allows digest computation to be
+        done during download and checking that the downloaded data
+        matched any expected value.
+
+        :param url: The URL of the file to be downloaded (assumed to be
+                    available via an HTTP GET request).
+        :param destfile: The pathname where the downloaded file is to be
+                         saved.
+        :param digest: If specified, this must be a (hasher, value)
+                       tuple, where hasher is the algorithm used (e.g.
+                       ``'md5'``) and ``value`` is the expected value.
+        :param reporthook: The same as for :func:`urlretrieve` in the
+                           standard library.
+        """
+        if digest is None:
+            digester = None
+            logger.debug('No digest specified')
+        else:
+            if isinstance(digest, (list, tuple)):
+                hasher, digest = digest
+            else:
+                hasher = 'md5'
+            digester = getattr(hashlib, hasher)()
+            logger.debug('Digest specified: %s' % digest)
+        # The following code is equivalent to urlretrieve.
+        # We need to do it this way so that we can compute the
+        # digest of the file as we go.
+        with open(destfile, 'wb') as dfp:
+            # addinfourl is not a context manager on 2.x
+            # so we have to use try/finally
+            sfp = self.send_request(Request(url))
+            try:
+                headers = sfp.info()
+                blocksize = 8192
+                size = -1
+                read = 0
+                blocknum = 0
+                if "content-length" in headers:
+                    size = int(headers["Content-Length"])
+                if reporthook:
+                    reporthook(blocknum, blocksize, size)
+                while True:
+                    block = sfp.read(blocksize)
+                    if not block:
+                        break
+                    read += len(block)
+                    dfp.write(block)
+                    if digester:
+                        digester.update(block)
+                    blocknum += 1
+                    if reporthook:
+                        reporthook(blocknum, blocksize, size)
+            finally:
+                sfp.close()
+
+        # check that we got the whole file, if we can
+        if size >= 0 and read < size:
+            raise DistlibException(
+                'retrieval incomplete: got only %d out of %d bytes'
+                % (read, size))
+        # if we have a digest, it must match.
+        if digester:
+            actual = digester.hexdigest()
+            if digest != actual:
+                raise DistlibException('%s digest mismatch for %s: expected '
+                                       '%s, got %s' % (hasher, destfile,
+                                                       digest, actual))
+            logger.debug('Digest verified: %s', digest)
+
+    def send_request(self, req):
+        """
+        Send a standard library :class:`Request` to PyPI and return its
+        response.
+
+        :param req: The request to send.
+        :return: The HTTP response from PyPI (a standard library HTTPResponse).
+        """
+        handlers = []
+        if self.password_handler:
+            handlers.append(self.password_handler)
+        if self.ssl_verifier:
+            handlers.append(self.ssl_verifier)
+        opener = build_opener(*handlers)
+        return opener.open(req)
+
+    def encode_request(self, fields, files):
+        """
+        Encode fields and files for posting to an HTTP server.
+
+        :param fields: The fields to send as a list of (fieldname, value)
+                       tuples.
+        :param files: The files to send as a list of (fieldname, filename,
+                      file_bytes) tuple.
+        """
+        # Adapted from packaging, which in turn was adapted from
+        # http://code.activestate.com/recipes/146306
+
+        parts = []
+        boundary = self.boundary
+        for k, values in fields:
+            if not isinstance(values, (list, tuple)):
+                values = [values]
+
+            for v in values:
+                parts.extend((
+                    b'--' + boundary,
+                    ('Content-Disposition: form-data; name="%s"' %
+                     k).encode('utf-8'),
+                    b'',
+                    v.encode('utf-8')))
+        for key, filename, value in files:
+            parts.extend((
+                b'--' + boundary,
+                ('Content-Disposition: form-data; name="%s"; filename="%s"' %
+                 (key, filename)).encode('utf-8'),
+                b'',
+                value))
+
+        parts.extend((b'--' + boundary + b'--', b''))
+
+        body = b'\r\n'.join(parts)
+        ct = b'multipart/form-data; boundary=' + boundary
+        headers = {
+            'Content-type': ct,
+            'Content-length': str(len(body))
+        }
+        return Request(self.url, body, headers)
+
+    def search(self, terms, operator=None):
+        if isinstance(terms, string_types):
+            terms = {'name': terms}
+        rpc_proxy = ServerProxy(self.url, timeout=3.0)
+        try:
+            return rpc_proxy.search(terms, operator or 'and')
+        finally:
+            rpc_proxy('close')()
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/locators.py b/venv/Lib/site-packages/pip/_vendor/distlib/locators.py
new file mode 100644
index 000000000..12a1d0635
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/locators.py
@@ -0,0 +1,1302 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2015 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+
+import gzip
+from io import BytesIO
+import json
+import logging
+import os
+import posixpath
+import re
+try:
+    import threading
+except ImportError:  # pragma: no cover
+    import dummy_threading as threading
+import zlib
+
+from . import DistlibException
+from .compat import (urljoin, urlparse, urlunparse, url2pathname, pathname2url,
+                     queue, quote, unescape, string_types, build_opener,
+                     HTTPRedirectHandler as BaseRedirectHandler, text_type,
+                     Request, HTTPError, URLError)
+from .database import Distribution, DistributionPath, make_dist
+from .metadata import Metadata, MetadataInvalidError
+from .util import (cached_property, parse_credentials, ensure_slash,
+                   split_filename, get_project_data, parse_requirement,
+                   parse_name_and_version, ServerProxy, normalize_name)
+from .version import get_scheme, UnsupportedVersionError
+from .wheel import Wheel, is_compatible
+
+logger = logging.getLogger(__name__)
+
+HASHER_HASH = re.compile(r'^(\w+)=([a-f0-9]+)')
+CHARSET = re.compile(r';\s*charset\s*=\s*(.*)\s*$', re.I)
+HTML_CONTENT_TYPE = re.compile('text/html|application/x(ht)?ml')
+DEFAULT_INDEX = 'https://pypi.org/pypi'
+
+def get_all_distribution_names(url=None):
+    """
+    Return all distribution names known by an index.
+    :param url: The URL of the index.
+    :return: A list of all known distribution names.
+    """
+    if url is None:
+        url = DEFAULT_INDEX
+    client = ServerProxy(url, timeout=3.0)
+    try:
+        return client.list_packages()
+    finally:
+        client('close')()
+
+class RedirectHandler(BaseRedirectHandler):
+    """
+    A class to work around a bug in some Python 3.2.x releases.
+    """
+    # There's a bug in the base version for some 3.2.x
+    # (e.g. 3.2.2 on Ubuntu Oneiric). If a Location header
+    # returns e.g. /abc, it bails because it says the scheme ''
+    # is bogus, when actually it should use the request's
+    # URL for the scheme. See Python issue #13696.
+    def http_error_302(self, req, fp, code, msg, headers):
+        # Some servers (incorrectly) return multiple Location headers
+        # (so probably same goes for URI).  Use first header.
+        newurl = None
+        for key in ('location', 'uri'):
+            if key in headers:
+                newurl = headers[key]
+                break
+        if newurl is None:  # pragma: no cover
+            return
+        urlparts = urlparse(newurl)
+        if urlparts.scheme == '':
+            newurl = urljoin(req.get_full_url(), newurl)
+            if hasattr(headers, 'replace_header'):
+                headers.replace_header(key, newurl)
+            else:
+                headers[key] = newurl
+        return BaseRedirectHandler.http_error_302(self, req, fp, code, msg,
+                                                  headers)
+
+    http_error_301 = http_error_303 = http_error_307 = http_error_302
+
+class Locator(object):
+    """
+    A base class for locators - things that locate distributions.
+    """
+    source_extensions = ('.tar.gz', '.tar.bz2', '.tar', '.zip', '.tgz', '.tbz')
+    binary_extensions = ('.egg', '.exe', '.whl')
+    excluded_extensions = ('.pdf',)
+
+    # A list of tags indicating which wheels you want to match. The default
+    # value of None matches against the tags compatible with the running
+    # Python. If you want to match other values, set wheel_tags on a locator
+    # instance to a list of tuples (pyver, abi, arch) which you want to match.
+    wheel_tags = None
+
+    downloadable_extensions = source_extensions + ('.whl',)
+
+    def __init__(self, scheme='default'):
+        """
+        Initialise an instance.
+        :param scheme: Because locators look for most recent versions, they
+                       need to know the version scheme to use. This specifies
+                       the current PEP-recommended scheme - use ``'legacy'``
+                       if you need to support existing distributions on PyPI.
+        """
+        self._cache = {}
+        self.scheme = scheme
+        # Because of bugs in some of the handlers on some of the platforms,
+        # we use our own opener rather than just using urlopen.
+        self.opener = build_opener(RedirectHandler())
+        # If get_project() is called from locate(), the matcher instance
+        # is set from the requirement passed to locate(). See issue #18 for
+        # why this can be useful to know.
+        self.matcher = None
+        self.errors = queue.Queue()
+
+    def get_errors(self):
+        """
+        Return any errors which have occurred.
+        """
+        result = []
+        while not self.errors.empty():  # pragma: no cover
+            try:
+                e = self.errors.get(False)
+                result.append(e)
+            except self.errors.Empty:
+                continue
+            self.errors.task_done()
+        return result
+
+    def clear_errors(self):
+        """
+        Clear any errors which may have been logged.
+        """
+        # Just get the errors and throw them away
+        self.get_errors()
+
+    def clear_cache(self):
+        self._cache.clear()
+
+    def _get_scheme(self):
+        return self._scheme
+
+    def _set_scheme(self, value):
+        self._scheme = value
+
+    scheme = property(_get_scheme, _set_scheme)
+
+    def _get_project(self, name):
+        """
+        For a given project, get a dictionary mapping available versions to Distribution
+        instances.
+
+        This should be implemented in subclasses.
+
+        If called from a locate() request, self.matcher will be set to a
+        matcher for the requirement to satisfy, otherwise it will be None.
+        """
+        raise NotImplementedError('Please implement in the subclass')
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        raise NotImplementedError('Please implement in the subclass')
+
+    def get_project(self, name):
+        """
+        For a given project, get a dictionary mapping available versions to Distribution
+        instances.
+
+        This calls _get_project to do all the work, and just implements a caching layer on top.
+        """
+        if self._cache is None:  # pragma: no cover
+            result = self._get_project(name)
+        elif name in self._cache:
+            result = self._cache[name]
+        else:
+            self.clear_errors()
+            result = self._get_project(name)
+            self._cache[name] = result
+        return result
+
+    def score_url(self, url):
+        """
+        Give an url a score which can be used to choose preferred URLs
+        for a given project release.
+        """
+        t = urlparse(url)
+        basename = posixpath.basename(t.path)
+        compatible = True
+        is_wheel = basename.endswith('.whl')
+        is_downloadable = basename.endswith(self.downloadable_extensions)
+        if is_wheel:
+            compatible = is_compatible(Wheel(basename), self.wheel_tags)
+        return (t.scheme == 'https', 'pypi.org' in t.netloc,
+                is_downloadable, is_wheel, compatible, basename)
+
+    def prefer_url(self, url1, url2):
+        """
+        Choose one of two URLs where both are candidates for distribution
+        archives for the same version of a distribution (for example,
+        .tar.gz vs. zip).
+
+        The current implementation favours https:// URLs over http://, archives
+        from PyPI over those from other locations, wheel compatibility (if a
+        wheel) and then the archive name.
+        """
+        result = url2
+        if url1:
+            s1 = self.score_url(url1)
+            s2 = self.score_url(url2)
+            if s1 > s2:
+                result = url1
+            if result != url2:
+                logger.debug('Not replacing %r with %r', url1, url2)
+            else:
+                logger.debug('Replacing %r with %r', url1, url2)
+        return result
+
+    def split_filename(self, filename, project_name):
+        """
+        Attempt to split a filename in project name, version and Python version.
+        """
+        return split_filename(filename, project_name)
+
+    def convert_url_to_download_info(self, url, project_name):
+        """
+        See if a URL is a candidate for a download URL for a project (the URL
+        has typically been scraped from an HTML page).
+
+        If it is, a dictionary is returned with keys "name", "version",
+        "filename" and "url"; otherwise, None is returned.
+        """
+        def same_project(name1, name2):
+            return normalize_name(name1) == normalize_name(name2)
+
+        result = None
+        scheme, netloc, path, params, query, frag = urlparse(url)
+        if frag.lower().startswith('egg='):  # pragma: no cover
+            logger.debug('%s: version hint in fragment: %r',
+                         project_name, frag)
+        m = HASHER_HASH.match(frag)
+        if m:
+            algo, digest = m.groups()
+        else:
+            algo, digest = None, None
+        origpath = path
+        if path and path[-1] == '/':  # pragma: no cover
+            path = path[:-1]
+        if path.endswith('.whl'):
+            try:
+                wheel = Wheel(path)
+                if not is_compatible(wheel, self.wheel_tags):
+                    logger.debug('Wheel not compatible: %s', path)
+                else:
+                    if project_name is None:
+                        include = True
+                    else:
+                        include = same_project(wheel.name, project_name)
+                    if include:
+                        result = {
+                            'name': wheel.name,
+                            'version': wheel.version,
+                            'filename': wheel.filename,
+                            'url': urlunparse((scheme, netloc, origpath,
+                                               params, query, '')),
+                            'python-version': ', '.join(
+                                ['.'.join(list(v[2:])) for v in wheel.pyver]),
+                        }
+            except Exception as e:  # pragma: no cover
+                logger.warning('invalid path for wheel: %s', path)
+        elif not path.endswith(self.downloadable_extensions):  # pragma: no cover
+            logger.debug('Not downloadable: %s', path)
+        else:  # downloadable extension
+            path = filename = posixpath.basename(path)
+            for ext in self.downloadable_extensions:
+                if path.endswith(ext):
+                    path = path[:-len(ext)]
+                    t = self.split_filename(path, project_name)
+                    if not t:  # pragma: no cover
+                        logger.debug('No match for project/version: %s', path)
+                    else:
+                        name, version, pyver = t
+                        if not project_name or same_project(project_name, name):
+                            result = {
+                                'name': name,
+                                'version': version,
+                                'filename': filename,
+                                'url': urlunparse((scheme, netloc, origpath,
+                                                   params, query, '')),
+                                #'packagetype': 'sdist',
+                            }
+                            if pyver:  # pragma: no cover
+                                result['python-version'] = pyver
+                    break
+        if result and algo:
+            result['%s_digest' % algo] = digest
+        return result
+
+    def _get_digest(self, info):
+        """
+        Get a digest from a dictionary by looking at a "digests" dictionary
+        or keys of the form 'algo_digest'.
+
+        Returns a 2-tuple (algo, digest) if found, else None. Currently
+        looks only for SHA256, then MD5.
+        """
+        result = None
+        if 'digests' in info:
+            digests = info['digests']
+            for algo in ('sha256', 'md5'):
+                if algo in digests:
+                    result = (algo, digests[algo])
+                    break
+        if not result:
+            for algo in ('sha256', 'md5'):
+                key = '%s_digest' % algo
+                if key in info:
+                    result = (algo, info[key])
+                    break
+        return result
+
+    def _update_version_data(self, result, info):
+        """
+        Update a result dictionary (the final result from _get_project) with a
+        dictionary for a specific version, which typically holds information
+        gleaned from a filename or URL for an archive for the distribution.
+        """
+        name = info.pop('name')
+        version = info.pop('version')
+        if version in result:
+            dist = result[version]
+            md = dist.metadata
+        else:
+            dist = make_dist(name, version, scheme=self.scheme)
+            md = dist.metadata
+        dist.digest = digest = self._get_digest(info)
+        url = info['url']
+        result['digests'][url] = digest
+        if md.source_url != info['url']:
+            md.source_url = self.prefer_url(md.source_url, url)
+            result['urls'].setdefault(version, set()).add(url)
+        dist.locator = self
+        result[version] = dist
+
+    def locate(self, requirement, prereleases=False):
+        """
+        Find the most recent distribution which matches the given
+        requirement.
+
+        :param requirement: A requirement of the form 'foo (1.0)' or perhaps
+                            'foo (>= 1.0, < 2.0, != 1.3)'
+        :param prereleases: If ``True``, allow pre-release versions
+                            to be located. Otherwise, pre-release versions
+                            are not returned.
+        :return: A :class:`Distribution` instance, or ``None`` if no such
+                 distribution could be located.
+        """
+        result = None
+        r = parse_requirement(requirement)
+        if r is None:  # pragma: no cover
+            raise DistlibException('Not a valid requirement: %r' % requirement)
+        scheme = get_scheme(self.scheme)
+        self.matcher = matcher = scheme.matcher(r.requirement)
+        logger.debug('matcher: %s (%s)', matcher, type(matcher).__name__)
+        versions = self.get_project(r.name)
+        if len(versions) > 2:   # urls and digests keys are present
+            # sometimes, versions are invalid
+            slist = []
+            vcls = matcher.version_class
+            for k in versions:
+                if k in ('urls', 'digests'):
+                    continue
+                try:
+                    if not matcher.match(k):
+                        logger.debug('%s did not match %r', matcher, k)
+                    else:
+                        if prereleases or not vcls(k).is_prerelease:
+                            slist.append(k)
+                        else:
+                            logger.debug('skipping pre-release '
+                                         'version %s of %s', k, matcher.name)
+                except Exception:  # pragma: no cover
+                    logger.warning('error matching %s with %r', matcher, k)
+                    pass # slist.append(k)
+            if len(slist) > 1:
+                slist = sorted(slist, key=scheme.key)
+            if slist:
+                logger.debug('sorted list: %s', slist)
+                version = slist[-1]
+                result = versions[version]
+        if result:
+            if r.extras:
+                result.extras = r.extras
+            result.download_urls = versions.get('urls', {}).get(version, set())
+            d = {}
+            sd = versions.get('digests', {})
+            for url in result.download_urls:
+                if url in sd:  # pragma: no cover
+                    d[url] = sd[url]
+            result.digests = d
+        self.matcher = None
+        return result
+
+
+class PyPIRPCLocator(Locator):
+    """
+    This locator uses XML-RPC to locate distributions. It therefore
+    cannot be used with simple mirrors (that only mirror file content).
+    """
+    def __init__(self, url, **kwargs):
+        """
+        Initialise an instance.
+
+        :param url: The URL to use for XML-RPC.
+        :param kwargs: Passed to the superclass constructor.
+        """
+        super(PyPIRPCLocator, self).__init__(**kwargs)
+        self.base_url = url
+        self.client = ServerProxy(url, timeout=3.0)
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        return set(self.client.list_packages())
+
+    def _get_project(self, name):
+        result = {'urls': {}, 'digests': {}}
+        versions = self.client.package_releases(name, True)
+        for v in versions:
+            urls = self.client.release_urls(name, v)
+            data = self.client.release_data(name, v)
+            metadata = Metadata(scheme=self.scheme)
+            metadata.name = data['name']
+            metadata.version = data['version']
+            metadata.license = data.get('license')
+            metadata.keywords = data.get('keywords', [])
+            metadata.summary = data.get('summary')
+            dist = Distribution(metadata)
+            if urls:
+                info = urls[0]
+                metadata.source_url = info['url']
+                dist.digest = self._get_digest(info)
+                dist.locator = self
+                result[v] = dist
+                for info in urls:
+                    url = info['url']
+                    digest = self._get_digest(info)
+                    result['urls'].setdefault(v, set()).add(url)
+                    result['digests'][url] = digest
+        return result
+
+class PyPIJSONLocator(Locator):
+    """
+    This locator uses PyPI's JSON interface. It's very limited in functionality
+    and probably not worth using.
+    """
+    def __init__(self, url, **kwargs):
+        super(PyPIJSONLocator, self).__init__(**kwargs)
+        self.base_url = ensure_slash(url)
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        raise NotImplementedError('Not available from this locator')
+
+    def _get_project(self, name):
+        result = {'urls': {}, 'digests': {}}
+        url = urljoin(self.base_url, '%s/json' % quote(name))
+        try:
+            resp = self.opener.open(url)
+            data = resp.read().decode() # for now
+            d = json.loads(data)
+            md = Metadata(scheme=self.scheme)
+            data = d['info']
+            md.name = data['name']
+            md.version = data['version']
+            md.license = data.get('license')
+            md.keywords = data.get('keywords', [])
+            md.summary = data.get('summary')
+            dist = Distribution(md)
+            dist.locator = self
+            urls = d['urls']
+            result[md.version] = dist
+            for info in d['urls']:
+                url = info['url']
+                dist.download_urls.add(url)
+                dist.digests[url] = self._get_digest(info)
+                result['urls'].setdefault(md.version, set()).add(url)
+                result['digests'][url] = self._get_digest(info)
+            # Now get other releases
+            for version, infos in d['releases'].items():
+                if version == md.version:
+                    continue    # already done
+                omd = Metadata(scheme=self.scheme)
+                omd.name = md.name
+                omd.version = version
+                odist = Distribution(omd)
+                odist.locator = self
+                result[version] = odist
+                for info in infos:
+                    url = info['url']
+                    odist.download_urls.add(url)
+                    odist.digests[url] = self._get_digest(info)
+                    result['urls'].setdefault(version, set()).add(url)
+                    result['digests'][url] = self._get_digest(info)
+#            for info in urls:
+#                md.source_url = info['url']
+#                dist.digest = self._get_digest(info)
+#                dist.locator = self
+#                for info in urls:
+#                    url = info['url']
+#                    result['urls'].setdefault(md.version, set()).add(url)
+#                    result['digests'][url] = self._get_digest(info)
+        except Exception as e:
+            self.errors.put(text_type(e))
+            logger.exception('JSON fetch failed: %s', e)
+        return result
+
+
+class Page(object):
+    """
+    This class represents a scraped HTML page.
+    """
+    # The following slightly hairy-looking regex just looks for the contents of
+    # an anchor link, which has an attribute "href" either immediately preceded
+    # or immediately followed by a "rel" attribute. The attribute values can be
+    # declared with double quotes, single quotes or no quotes - which leads to
+    # the length of the expression.
+    _href = re.compile("""
+(rel\\s*=\\s*(?:"(?P<rel1>[^"]*)"|'(?P<rel2>[^']*)'|(?P<rel3>[^>\\s\n]*))\\s+)?
+href\\s*=\\s*(?:"(?P<url1>[^"]*)"|'(?P<url2>[^']*)'|(?P<url3>[^>\\s\n]*))
+(\\s+rel\\s*=\\s*(?:"(?P<rel4>[^"]*)"|'(?P<rel5>[^']*)'|(?P<rel6>[^>\\s\n]*)))?
+""", re.I | re.S | re.X)
+    _base = re.compile(r"""<base\s+href\s*=\s*['"]?([^'">]+)""", re.I | re.S)
+
+    def __init__(self, data, url):
+        """
+        Initialise an instance with the Unicode page contents and the URL they
+        came from.
+        """
+        self.data = data
+        self.base_url = self.url = url
+        m = self._base.search(self.data)
+        if m:
+            self.base_url = m.group(1)
+
+    _clean_re = re.compile(r'[^a-z0-9$&+,/:;=?@.#%_\\|-]', re.I)
+
+    @cached_property
+    def links(self):
+        """
+        Return the URLs of all the links on a page together with information
+        about their "rel" attribute, for determining which ones to treat as
+        downloads and which ones to queue for further scraping.
+        """
+        def clean(url):
+            "Tidy up an URL."
+            scheme, netloc, path, params, query, frag = urlparse(url)
+            return urlunparse((scheme, netloc, quote(path),
+                               params, query, frag))
+
+        result = set()
+        for match in self._href.finditer(self.data):
+            d = match.groupdict('')
+            rel = (d['rel1'] or d['rel2'] or d['rel3'] or
+                   d['rel4'] or d['rel5'] or d['rel6'])
+            url = d['url1'] or d['url2'] or d['url3']
+            url = urljoin(self.base_url, url)
+            url = unescape(url)
+            url = self._clean_re.sub(lambda m: '%%%2x' % ord(m.group(0)), url)
+            result.add((url, rel))
+        # We sort the result, hoping to bring the most recent versions
+        # to the front
+        result = sorted(result, key=lambda t: t[0], reverse=True)
+        return result
+
+
+class SimpleScrapingLocator(Locator):
+    """
+    A locator which scrapes HTML pages to locate downloads for a distribution.
+    This runs multiple threads to do the I/O; performance is at least as good
+    as pip's PackageFinder, which works in an analogous fashion.
+    """
+
+    # These are used to deal with various Content-Encoding schemes.
+    decoders = {
+        'deflate': zlib.decompress,
+        'gzip': lambda b: gzip.GzipFile(fileobj=BytesIO(d)).read(),
+        'none': lambda b: b,
+    }
+
+    def __init__(self, url, timeout=None, num_workers=10, **kwargs):
+        """
+        Initialise an instance.
+        :param url: The root URL to use for scraping.
+        :param timeout: The timeout, in seconds, to be applied to requests.
+                        This defaults to ``None`` (no timeout specified).
+        :param num_workers: The number of worker threads you want to do I/O,
+                            This defaults to 10.
+        :param kwargs: Passed to the superclass.
+        """
+        super(SimpleScrapingLocator, self).__init__(**kwargs)
+        self.base_url = ensure_slash(url)
+        self.timeout = timeout
+        self._page_cache = {}
+        self._seen = set()
+        self._to_fetch = queue.Queue()
+        self._bad_hosts = set()
+        self.skip_externals = False
+        self.num_workers = num_workers
+        self._lock = threading.RLock()
+        # See issue #45: we need to be resilient when the locator is used
+        # in a thread, e.g. with concurrent.futures. We can't use self._lock
+        # as it is for coordinating our internal threads - the ones created
+        # in _prepare_threads.
+        self._gplock = threading.RLock()
+        self.platform_check = False  # See issue #112
+
+    def _prepare_threads(self):
+        """
+        Threads are created only when get_project is called, and terminate
+        before it returns. They are there primarily to parallelise I/O (i.e.
+        fetching web pages).
+        """
+        self._threads = []
+        for i in range(self.num_workers):
+            t = threading.Thread(target=self._fetch)
+            t.setDaemon(True)
+            t.start()
+            self._threads.append(t)
+
+    def _wait_threads(self):
+        """
+        Tell all the threads to terminate (by sending a sentinel value) and
+        wait for them to do so.
+        """
+        # Note that you need two loops, since you can't say which
+        # thread will get each sentinel
+        for t in self._threads:
+            self._to_fetch.put(None)    # sentinel
+        for t in self._threads:
+            t.join()
+        self._threads = []
+
+    def _get_project(self, name):
+        result = {'urls': {}, 'digests': {}}
+        with self._gplock:
+            self.result = result
+            self.project_name = name
+            url = urljoin(self.base_url, '%s/' % quote(name))
+            self._seen.clear()
+            self._page_cache.clear()
+            self._prepare_threads()
+            try:
+                logger.debug('Queueing %s', url)
+                self._to_fetch.put(url)
+                self._to_fetch.join()
+            finally:
+                self._wait_threads()
+            del self.result
+        return result
+
+    platform_dependent = re.compile(r'\b(linux_(i\d86|x86_64|arm\w+)|'
+                                    r'win(32|_amd64)|macosx_?\d+)\b', re.I)
+
+    def _is_platform_dependent(self, url):
+        """
+        Does an URL refer to a platform-specific download?
+        """
+        return self.platform_dependent.search(url)
+
+    def _process_download(self, url):
+        """
+        See if an URL is a suitable download for a project.
+
+        If it is, register information in the result dictionary (for
+        _get_project) about the specific version it's for.
+
+        Note that the return value isn't actually used other than as a boolean
+        value.
+        """
+        if self.platform_check and self._is_platform_dependent(url):
+            info = None
+        else:
+            info = self.convert_url_to_download_info(url, self.project_name)
+        logger.debug('process_download: %s -> %s', url, info)
+        if info:
+            with self._lock:    # needed because self.result is shared
+                self._update_version_data(self.result, info)
+        return info
+
+    def _should_queue(self, link, referrer, rel):
+        """
+        Determine whether a link URL from a referring page and with a
+        particular "rel" attribute should be queued for scraping.
+        """
+        scheme, netloc, path, _, _, _ = urlparse(link)
+        if path.endswith(self.source_extensions + self.binary_extensions +
+                         self.excluded_extensions):
+            result = False
+        elif self.skip_externals and not link.startswith(self.base_url):
+            result = False
+        elif not referrer.startswith(self.base_url):
+            result = False
+        elif rel not in ('homepage', 'download'):
+            result = False
+        elif scheme not in ('http', 'https', 'ftp'):
+            result = False
+        elif self._is_platform_dependent(link):
+            result = False
+        else:
+            host = netloc.split(':', 1)[0]
+            if host.lower() == 'localhost':
+                result = False
+            else:
+                result = True
+        logger.debug('should_queue: %s (%s) from %s -> %s', link, rel,
+                     referrer, result)
+        return result
+
+    def _fetch(self):
+        """
+        Get a URL to fetch from the work queue, get the HTML page, examine its
+        links for download candidates and candidates for further scraping.
+
+        This is a handy method to run in a thread.
+        """
+        while True:
+            url = self._to_fetch.get()
+            try:
+                if url:
+                    page = self.get_page(url)
+                    if page is None:    # e.g. after an error
+                        continue
+                    for link, rel in page.links:
+                        if link not in self._seen:
+                            try:
+                                self._seen.add(link)
+                                if (not self._process_download(link) and
+                                    self._should_queue(link, url, rel)):
+                                    logger.debug('Queueing %s from %s', link, url)
+                                    self._to_fetch.put(link)
+                            except MetadataInvalidError:  # e.g. invalid versions
+                                pass
+            except Exception as e:  # pragma: no cover
+                self.errors.put(text_type(e))
+            finally:
+                # always do this, to avoid hangs :-)
+                self._to_fetch.task_done()
+            if not url:
+                #logger.debug('Sentinel seen, quitting.')
+                break
+
+    def get_page(self, url):
+        """
+        Get the HTML for an URL, possibly from an in-memory cache.
+
+        XXX TODO Note: this cache is never actually cleared. It's assumed that
+        the data won't get stale over the lifetime of a locator instance (not
+        necessarily true for the default_locator).
+        """
+        # http://peak.telecommunity.com/DevCenter/EasyInstall#package-index-api
+        scheme, netloc, path, _, _, _ = urlparse(url)
+        if scheme == 'file' and os.path.isdir(url2pathname(path)):
+            url = urljoin(ensure_slash(url), 'index.html')
+
+        if url in self._page_cache:
+            result = self._page_cache[url]
+            logger.debug('Returning %s from cache: %s', url, result)
+        else:
+            host = netloc.split(':', 1)[0]
+            result = None
+            if host in self._bad_hosts:
+                logger.debug('Skipping %s due to bad host %s', url, host)
+            else:
+                req = Request(url, headers={'Accept-encoding': 'identity'})
+                try:
+                    logger.debug('Fetching %s', url)
+                    resp = self.opener.open(req, timeout=self.timeout)
+                    logger.debug('Fetched %s', url)
+                    headers = resp.info()
+                    content_type = headers.get('Content-Type', '')
+                    if HTML_CONTENT_TYPE.match(content_type):
+                        final_url = resp.geturl()
+                        data = resp.read()
+                        encoding = headers.get('Content-Encoding')
+                        if encoding:
+                            decoder = self.decoders[encoding]   # fail if not found
+                            data = decoder(data)
+                        encoding = 'utf-8'
+                        m = CHARSET.search(content_type)
+                        if m:
+                            encoding = m.group(1)
+                        try:
+                            data = data.decode(encoding)
+                        except UnicodeError:  # pragma: no cover
+                            data = data.decode('latin-1')    # fallback
+                        result = Page(data, final_url)
+                        self._page_cache[final_url] = result
+                except HTTPError as e:
+                    if e.code != 404:
+                        logger.exception('Fetch failed: %s: %s', url, e)
+                except URLError as e:  # pragma: no cover
+                    logger.exception('Fetch failed: %s: %s', url, e)
+                    with self._lock:
+                        self._bad_hosts.add(host)
+                except Exception as e:  # pragma: no cover
+                    logger.exception('Fetch failed: %s: %s', url, e)
+                finally:
+                    self._page_cache[url] = result   # even if None (failure)
+        return result
+
+    _distname_re = re.compile('<a href=[^>]*>([^<]+)<')
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        result = set()
+        page = self.get_page(self.base_url)
+        if not page:
+            raise DistlibException('Unable to get %s' % self.base_url)
+        for match in self._distname_re.finditer(page.data):
+            result.add(match.group(1))
+        return result
+
+class DirectoryLocator(Locator):
+    """
+    This class locates distributions in a directory tree.
+    """
+
+    def __init__(self, path, **kwargs):
+        """
+        Initialise an instance.
+        :param path: The root of the directory tree to search.
+        :param kwargs: Passed to the superclass constructor,
+                       except for:
+                       * recursive - if True (the default), subdirectories are
+                         recursed into. If False, only the top-level directory
+                         is searched,
+        """
+        self.recursive = kwargs.pop('recursive', True)
+        super(DirectoryLocator, self).__init__(**kwargs)
+        path = os.path.abspath(path)
+        if not os.path.isdir(path):  # pragma: no cover
+            raise DistlibException('Not a directory: %r' % path)
+        self.base_dir = path
+
+    def should_include(self, filename, parent):
+        """
+        Should a filename be considered as a candidate for a distribution
+        archive? As well as the filename, the directory which contains it
+        is provided, though not used by the current implementation.
+        """
+        return filename.endswith(self.downloadable_extensions)
+
+    def _get_project(self, name):
+        result = {'urls': {}, 'digests': {}}
+        for root, dirs, files in os.walk(self.base_dir):
+            for fn in files:
+                if self.should_include(fn, root):
+                    fn = os.path.join(root, fn)
+                    url = urlunparse(('file', '',
+                                      pathname2url(os.path.abspath(fn)),
+                                      '', '', ''))
+                    info = self.convert_url_to_download_info(url, name)
+                    if info:
+                        self._update_version_data(result, info)
+            if not self.recursive:
+                break
+        return result
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        result = set()
+        for root, dirs, files in os.walk(self.base_dir):
+            for fn in files:
+                if self.should_include(fn, root):
+                    fn = os.path.join(root, fn)
+                    url = urlunparse(('file', '',
+                                      pathname2url(os.path.abspath(fn)),
+                                      '', '', ''))
+                    info = self.convert_url_to_download_info(url, None)
+                    if info:
+                        result.add(info['name'])
+            if not self.recursive:
+                break
+        return result
+
+class JSONLocator(Locator):
+    """
+    This locator uses special extended metadata (not available on PyPI) and is
+    the basis of performant dependency resolution in distlib. Other locators
+    require archive downloads before dependencies can be determined! As you
+    might imagine, that can be slow.
+    """
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        raise NotImplementedError('Not available from this locator')
+
+    def _get_project(self, name):
+        result = {'urls': {}, 'digests': {}}
+        data = get_project_data(name)
+        if data:
+            for info in data.get('files', []):
+                if info['ptype'] != 'sdist' or info['pyversion'] != 'source':
+                    continue
+                # We don't store summary in project metadata as it makes
+                # the data bigger for no benefit during dependency
+                # resolution
+                dist = make_dist(data['name'], info['version'],
+                                 summary=data.get('summary',
+                                                  'Placeholder for summary'),
+                                 scheme=self.scheme)
+                md = dist.metadata
+                md.source_url = info['url']
+                # TODO SHA256 digest
+                if 'digest' in info and info['digest']:
+                    dist.digest = ('md5', info['digest'])
+                md.dependencies = info.get('requirements', {})
+                dist.exports = info.get('exports', {})
+                result[dist.version] = dist
+                result['urls'].setdefault(dist.version, set()).add(info['url'])
+        return result
+
+class DistPathLocator(Locator):
+    """
+    This locator finds installed distributions in a path. It can be useful for
+    adding to an :class:`AggregatingLocator`.
+    """
+    def __init__(self, distpath, **kwargs):
+        """
+        Initialise an instance.
+
+        :param distpath: A :class:`DistributionPath` instance to search.
+        """
+        super(DistPathLocator, self).__init__(**kwargs)
+        assert isinstance(distpath, DistributionPath)
+        self.distpath = distpath
+
+    def _get_project(self, name):
+        dist = self.distpath.get_distribution(name)
+        if dist is None:
+            result = {'urls': {}, 'digests': {}}
+        else:
+            result = {
+                dist.version: dist,
+                'urls': {dist.version: set([dist.source_url])},
+                'digests': {dist.version: set([None])}
+            }
+        return result
+
+
+class AggregatingLocator(Locator):
+    """
+    This class allows you to chain and/or merge a list of locators.
+    """
+    def __init__(self, *locators, **kwargs):
+        """
+        Initialise an instance.
+
+        :param locators: The list of locators to search.
+        :param kwargs: Passed to the superclass constructor,
+                       except for:
+                       * merge - if False (the default), the first successful
+                         search from any of the locators is returned. If True,
+                         the results from all locators are merged (this can be
+                         slow).
+        """
+        self.merge = kwargs.pop('merge', False)
+        self.locators = locators
+        super(AggregatingLocator, self).__init__(**kwargs)
+
+    def clear_cache(self):
+        super(AggregatingLocator, self).clear_cache()
+        for locator in self.locators:
+            locator.clear_cache()
+
+    def _set_scheme(self, value):
+        self._scheme = value
+        for locator in self.locators:
+            locator.scheme = value
+
+    scheme = property(Locator.scheme.fget, _set_scheme)
+
+    def _get_project(self, name):
+        result = {}
+        for locator in self.locators:
+            d = locator.get_project(name)
+            if d:
+                if self.merge:
+                    files = result.get('urls', {})
+                    digests = result.get('digests', {})
+                    # next line could overwrite result['urls'], result['digests']
+                    result.update(d)
+                    df = result.get('urls')
+                    if files and df:
+                        for k, v in files.items():
+                            if k in df:
+                                df[k] |= v
+                            else:
+                                df[k] = v
+                    dd = result.get('digests')
+                    if digests and dd:
+                        dd.update(digests)
+                else:
+                    # See issue #18. If any dists are found and we're looking
+                    # for specific constraints, we only return something if
+                    # a match is found. For example, if a DirectoryLocator
+                    # returns just foo (1.0) while we're looking for
+                    # foo (>= 2.0), we'll pretend there was nothing there so
+                    # that subsequent locators can be queried. Otherwise we
+                    # would just return foo (1.0) which would then lead to a
+                    # failure to find foo (>= 2.0), because other locators
+                    # weren't searched. Note that this only matters when
+                    # merge=False.
+                    if self.matcher is None:
+                        found = True
+                    else:
+                        found = False
+                        for k in d:
+                            if self.matcher.match(k):
+                                found = True
+                                break
+                    if found:
+                        result = d
+                        break
+        return result
+
+    def get_distribution_names(self):
+        """
+        Return all the distribution names known to this locator.
+        """
+        result = set()
+        for locator in self.locators:
+            try:
+                result |= locator.get_distribution_names()
+            except NotImplementedError:
+                pass
+        return result
+
+
+# We use a legacy scheme simply because most of the dists on PyPI use legacy
+# versions which don't conform to PEP 426 / PEP 440.
+default_locator = AggregatingLocator(
+                    JSONLocator(),
+                    SimpleScrapingLocator('https://pypi.org/simple/',
+                                          timeout=3.0),
+                    scheme='legacy')
+
+locate = default_locator.locate
+
+NAME_VERSION_RE = re.compile(r'(?P<name>[\w-]+)\s*'
+                             r'\(\s*(==\s*)?(?P<ver>[^)]+)\)$')
+
+class DependencyFinder(object):
+    """
+    Locate dependencies for distributions.
+    """
+
+    def __init__(self, locator=None):
+        """
+        Initialise an instance, using the specified locator
+        to locate distributions.
+        """
+        self.locator = locator or default_locator
+        self.scheme = get_scheme(self.locator.scheme)
+
+    def add_distribution(self, dist):
+        """
+        Add a distribution to the finder. This will update internal information
+        about who provides what.
+        :param dist: The distribution to add.
+        """
+        logger.debug('adding distribution %s', dist)
+        name = dist.key
+        self.dists_by_name[name] = dist
+        self.dists[(name, dist.version)] = dist
+        for p in dist.provides:
+            name, version = parse_name_and_version(p)
+            logger.debug('Add to provided: %s, %s, %s', name, version, dist)
+            self.provided.setdefault(name, set()).add((version, dist))
+
+    def remove_distribution(self, dist):
+        """
+        Remove a distribution from the finder. This will update internal
+        information about who provides what.
+        :param dist: The distribution to remove.
+        """
+        logger.debug('removing distribution %s', dist)
+        name = dist.key
+        del self.dists_by_name[name]
+        del self.dists[(name, dist.version)]
+        for p in dist.provides:
+            name, version = parse_name_and_version(p)
+            logger.debug('Remove from provided: %s, %s, %s', name, version, dist)
+            s = self.provided[name]
+            s.remove((version, dist))
+            if not s:
+                del self.provided[name]
+
+    def get_matcher(self, reqt):
+        """
+        Get a version matcher for a requirement.
+        :param reqt: The requirement
+        :type reqt: str
+        :return: A version matcher (an instance of
+                 :class:`distlib.version.Matcher`).
+        """
+        try:
+            matcher = self.scheme.matcher(reqt)
+        except UnsupportedVersionError:  # pragma: no cover
+            # XXX compat-mode if cannot read the version
+            name = reqt.split()[0]
+            matcher = self.scheme.matcher(name)
+        return matcher
+
+    def find_providers(self, reqt):
+        """
+        Find the distributions which can fulfill a requirement.
+
+        :param reqt: The requirement.
+         :type reqt: str
+        :return: A set of distribution which can fulfill the requirement.
+        """
+        matcher = self.get_matcher(reqt)
+        name = matcher.key   # case-insensitive
+        result = set()
+        provided = self.provided
+        if name in provided:
+            for version, provider in provided[name]:
+                try:
+                    match = matcher.match(version)
+                except UnsupportedVersionError:
+                    match = False
+
+                if match:
+                    result.add(provider)
+                    break
+        return result
+
+    def try_to_replace(self, provider, other, problems):
+        """
+        Attempt to replace one provider with another. This is typically used
+        when resolving dependencies from multiple sources, e.g. A requires
+        (B >= 1.0) while C requires (B >= 1.1).
+
+        For successful replacement, ``provider`` must meet all the requirements
+        which ``other`` fulfills.
+
+        :param provider: The provider we are trying to replace with.
+        :param other: The provider we're trying to replace.
+        :param problems: If False is returned, this will contain what
+                         problems prevented replacement. This is currently
+                         a tuple of the literal string 'cantreplace',
+                         ``provider``, ``other``  and the set of requirements
+                         that ``provider`` couldn't fulfill.
+        :return: True if we can replace ``other`` with ``provider``, else
+                 False.
+        """
+        rlist = self.reqts[other]
+        unmatched = set()
+        for s in rlist:
+            matcher = self.get_matcher(s)
+            if not matcher.match(provider.version):
+                unmatched.add(s)
+        if unmatched:
+            # can't replace other with provider
+            problems.add(('cantreplace', provider, other,
+                          frozenset(unmatched)))
+            result = False
+        else:
+            # can replace other with provider
+            self.remove_distribution(other)
+            del self.reqts[other]
+            for s in rlist:
+                self.reqts.setdefault(provider, set()).add(s)
+            self.add_distribution(provider)
+            result = True
+        return result
+
+    def find(self, requirement, meta_extras=None, prereleases=False):
+        """
+        Find a distribution and all distributions it depends on.
+
+        :param requirement: The requirement specifying the distribution to
+                            find, or a Distribution instance.
+        :param meta_extras: A list of meta extras such as :test:, :build: and
+                            so on.
+        :param prereleases: If ``True``, allow pre-release versions to be
+                            returned - otherwise, don't return prereleases
+                            unless they're all that's available.
+
+        Return a set of :class:`Distribution` instances and a set of
+        problems.
+
+        The distributions returned should be such that they have the
+        :attr:`required` attribute set to ``True`` if they were
+        from the ``requirement`` passed to ``find()``, and they have the
+        :attr:`build_time_dependency` attribute set to ``True`` unless they
+        are post-installation dependencies of the ``requirement``.
+
+        The problems should be a tuple consisting of the string
+        ``'unsatisfied'`` and the requirement which couldn't be satisfied
+        by any distribution known to the locator.
+        """
+
+        self.provided = {}
+        self.dists = {}
+        self.dists_by_name = {}
+        self.reqts = {}
+
+        meta_extras = set(meta_extras or [])
+        if ':*:' in meta_extras:
+            meta_extras.remove(':*:')
+            # :meta: and :run: are implicitly included
+            meta_extras |= set([':test:', ':build:', ':dev:'])
+
+        if isinstance(requirement, Distribution):
+            dist = odist = requirement
+            logger.debug('passed %s as requirement', odist)
+        else:
+            dist = odist = self.locator.locate(requirement,
+                                               prereleases=prereleases)
+            if dist is None:
+                raise DistlibException('Unable to locate %r' % requirement)
+            logger.debug('located %s', odist)
+        dist.requested = True
+        problems = set()
+        todo = set([dist])
+        install_dists = set([odist])
+        while todo:
+            dist = todo.pop()
+            name = dist.key     # case-insensitive
+            if name not in self.dists_by_name:
+                self.add_distribution(dist)
+            else:
+                #import pdb; pdb.set_trace()
+                other = self.dists_by_name[name]
+                if other != dist:
+                    self.try_to_replace(dist, other, problems)
+
+            ireqts = dist.run_requires | dist.meta_requires
+            sreqts = dist.build_requires
+            ereqts = set()
+            if meta_extras and dist in install_dists:
+                for key in ('test', 'build', 'dev'):
+                    e = ':%s:' % key
+                    if e in meta_extras:
+                        ereqts |= getattr(dist, '%s_requires' % key)
+            all_reqts = ireqts | sreqts | ereqts
+            for r in all_reqts:
+                providers = self.find_providers(r)
+                if not providers:
+                    logger.debug('No providers found for %r', r)
+                    provider = self.locator.locate(r, prereleases=prereleases)
+                    # If no provider is found and we didn't consider
+                    # prereleases, consider them now.
+                    if provider is None and not prereleases:
+                        provider = self.locator.locate(r, prereleases=True)
+                    if provider is None:
+                        logger.debug('Cannot satisfy %r', r)
+                        problems.add(('unsatisfied', r))
+                    else:
+                        n, v = provider.key, provider.version
+                        if (n, v) not in self.dists:
+                            todo.add(provider)
+                        providers.add(provider)
+                        if r in ireqts and dist in install_dists:
+                            install_dists.add(provider)
+                            logger.debug('Adding %s to install_dists',
+                                         provider.name_and_version)
+                for p in providers:
+                    name = p.key
+                    if name not in self.dists_by_name:
+                        self.reqts.setdefault(p, set()).add(r)
+                    else:
+                        other = self.dists_by_name[name]
+                        if other != p:
+                            # see if other can be replaced by p
+                            self.try_to_replace(p, other, problems)
+
+        dists = set(self.dists.values())
+        for dist in dists:
+            dist.build_time_dependency = dist not in install_dists
+            if dist.build_time_dependency:
+                logger.debug('%s is a build-time dependency only.',
+                             dist.name_and_version)
+        logger.debug('find done for %s', odist)
+        return dists, problems
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/manifest.py b/venv/Lib/site-packages/pip/_vendor/distlib/manifest.py
new file mode 100644
index 000000000..ca0fe442d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/manifest.py
@@ -0,0 +1,393 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2013 Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""
+Class representing the list of files in a distribution.
+
+Equivalent to distutils.filelist, but fixes some problems.
+"""
+import fnmatch
+import logging
+import os
+import re
+import sys
+
+from . import DistlibException
+from .compat import fsdecode
+from .util import convert_path
+
+
+__all__ = ['Manifest']
+
+logger = logging.getLogger(__name__)
+
+# a \ followed by some spaces + EOL
+_COLLAPSE_PATTERN = re.compile('\\\\w*\n', re.M)
+_COMMENTED_LINE = re.compile('#.*?(?=\n)|\n(?=$)', re.M | re.S)
+
+#
+# Due to the different results returned by fnmatch.translate, we need
+# to do slightly different processing for Python 2.7 and 3.2 ... this needed
+# to be brought in for Python 3.6 onwards.
+#
+_PYTHON_VERSION = sys.version_info[:2]
+
+class Manifest(object):
+    """A list of files built by on exploring the filesystem and filtered by
+    applying various patterns to what we find there.
+    """
+
+    def __init__(self, base=None):
+        """
+        Initialise an instance.
+
+        :param base: The base directory to explore under.
+        """
+        self.base = os.path.abspath(os.path.normpath(base or os.getcwd()))
+        self.prefix = self.base + os.sep
+        self.allfiles = None
+        self.files = set()
+
+    #
+    # Public API
+    #
+
+    def findall(self):
+        """Find all files under the base and set ``allfiles`` to the absolute
+        pathnames of files found.
+        """
+        from stat import S_ISREG, S_ISDIR, S_ISLNK
+
+        self.allfiles = allfiles = []
+        root = self.base
+        stack = [root]
+        pop = stack.pop
+        push = stack.append
+
+        while stack:
+            root = pop()
+            names = os.listdir(root)
+
+            for name in names:
+                fullname = os.path.join(root, name)
+
+                # Avoid excess stat calls -- just one will do, thank you!
+                stat = os.stat(fullname)
+                mode = stat.st_mode
+                if S_ISREG(mode):
+                    allfiles.append(fsdecode(fullname))
+                elif S_ISDIR(mode) and not S_ISLNK(mode):
+                    push(fullname)
+
+    def add(self, item):
+        """
+        Add a file to the manifest.
+
+        :param item: The pathname to add. This can be relative to the base.
+        """
+        if not item.startswith(self.prefix):
+            item = os.path.join(self.base, item)
+        self.files.add(os.path.normpath(item))
+
+    def add_many(self, items):
+        """
+        Add a list of files to the manifest.
+
+        :param items: The pathnames to add. These can be relative to the base.
+        """
+        for item in items:
+            self.add(item)
+
+    def sorted(self, wantdirs=False):
+        """
+        Return sorted files in directory order
+        """
+
+        def add_dir(dirs, d):
+            dirs.add(d)
+            logger.debug('add_dir added %s', d)
+            if d != self.base:
+                parent, _ = os.path.split(d)
+                assert parent not in ('', '/')
+                add_dir(dirs, parent)
+
+        result = set(self.files)    # make a copy!
+        if wantdirs:
+            dirs = set()
+            for f in result:
+                add_dir(dirs, os.path.dirname(f))
+            result |= dirs
+        return [os.path.join(*path_tuple) for path_tuple in
+                sorted(os.path.split(path) for path in result)]
+
+    def clear(self):
+        """Clear all collected files."""
+        self.files = set()
+        self.allfiles = []
+
+    def process_directive(self, directive):
+        """
+        Process a directive which either adds some files from ``allfiles`` to
+        ``files``, or removes some files from ``files``.
+
+        :param directive: The directive to process. This should be in a format
+                     compatible with distutils ``MANIFEST.in`` files:
+
+                     http://docs.python.org/distutils/sourcedist.html#commands
+        """
+        # Parse the line: split it up, make sure the right number of words
+        # is there, and return the relevant words.  'action' is always
+        # defined: it's the first word of the line.  Which of the other
+        # three are defined depends on the action; it'll be either
+        # patterns, (dir and patterns), or (dirpattern).
+        action, patterns, thedir, dirpattern = self._parse_directive(directive)
+
+        # OK, now we know that the action is valid and we have the
+        # right number of words on the line for that action -- so we
+        # can proceed with minimal error-checking.
+        if action == 'include':
+            for pattern in patterns:
+                if not self._include_pattern(pattern, anchor=True):
+                    logger.warning('no files found matching %r', pattern)
+
+        elif action == 'exclude':
+            for pattern in patterns:
+                found = self._exclude_pattern(pattern, anchor=True)
+                #if not found:
+                #    logger.warning('no previously-included files '
+                #                   'found matching %r', pattern)
+
+        elif action == 'global-include':
+            for pattern in patterns:
+                if not self._include_pattern(pattern, anchor=False):
+                    logger.warning('no files found matching %r '
+                                   'anywhere in distribution', pattern)
+
+        elif action == 'global-exclude':
+            for pattern in patterns:
+                found = self._exclude_pattern(pattern, anchor=False)
+                #if not found:
+                #    logger.warning('no previously-included files '
+                #                   'matching %r found anywhere in '
+                #                   'distribution', pattern)
+
+        elif action == 'recursive-include':
+            for pattern in patterns:
+                if not self._include_pattern(pattern, prefix=thedir):
+                    logger.warning('no files found matching %r '
+                                   'under directory %r', pattern, thedir)
+
+        elif action == 'recursive-exclude':
+            for pattern in patterns:
+                found = self._exclude_pattern(pattern, prefix=thedir)
+                #if not found:
+                #    logger.warning('no previously-included files '
+                #                   'matching %r found under directory %r',
+                #                   pattern, thedir)
+
+        elif action == 'graft':
+            if not self._include_pattern(None, prefix=dirpattern):
+                logger.warning('no directories found matching %r',
+                               dirpattern)
+
+        elif action == 'prune':
+            if not self._exclude_pattern(None, prefix=dirpattern):
+                logger.warning('no previously-included directories found '
+                               'matching %r', dirpattern)
+        else:   # pragma: no cover
+            # This should never happen, as it should be caught in
+            # _parse_template_line
+            raise DistlibException(
+                'invalid action %r' % action)
+
+    #
+    # Private API
+    #
+
+    def _parse_directive(self, directive):
+        """
+        Validate a directive.
+        :param directive: The directive to validate.
+        :return: A tuple of action, patterns, thedir, dir_patterns
+        """
+        words = directive.split()
+        if len(words) == 1 and words[0] not in ('include', 'exclude',
+                                                'global-include',
+                                                'global-exclude',
+                                                'recursive-include',
+                                                'recursive-exclude',
+                                                'graft', 'prune'):
+            # no action given, let's use the default 'include'
+            words.insert(0, 'include')
+
+        action = words[0]
+        patterns = thedir = dir_pattern = None
+
+        if action in ('include', 'exclude',
+                      'global-include', 'global-exclude'):
+            if len(words) < 2:
+                raise DistlibException(
+                    '%r expects <pattern1> <pattern2> ...' % action)
+
+            patterns = [convert_path(word) for word in words[1:]]
+
+        elif action in ('recursive-include', 'recursive-exclude'):
+            if len(words) < 3:
+                raise DistlibException(
+                    '%r expects <dir> <pattern1> <pattern2> ...' % action)
+
+            thedir = convert_path(words[1])
+            patterns = [convert_path(word) for word in words[2:]]
+
+        elif action in ('graft', 'prune'):
+            if len(words) != 2:
+                raise DistlibException(
+                    '%r expects a single <dir_pattern>' % action)
+
+            dir_pattern = convert_path(words[1])
+
+        else:
+            raise DistlibException('unknown action %r' % action)
+
+        return action, patterns, thedir, dir_pattern
+
+    def _include_pattern(self, pattern, anchor=True, prefix=None,
+                         is_regex=False):
+        """Select strings (presumably filenames) from 'self.files' that
+        match 'pattern', a Unix-style wildcard (glob) pattern.
+
+        Patterns are not quite the same as implemented by the 'fnmatch'
+        module: '*' and '?'  match non-special characters, where "special"
+        is platform-dependent: slash on Unix; colon, slash, and backslash on
+        DOS/Windows; and colon on Mac OS.
+
+        If 'anchor' is true (the default), then the pattern match is more
+        stringent: "*.py" will match "foo.py" but not "foo/bar.py".  If
+        'anchor' is false, both of these will match.
+
+        If 'prefix' is supplied, then only filenames starting with 'prefix'
+        (itself a pattern) and ending with 'pattern', with anything in between
+        them, will match.  'anchor' is ignored in this case.
+
+        If 'is_regex' is true, 'anchor' and 'prefix' are ignored, and
+        'pattern' is assumed to be either a string containing a regex or a
+        regex object -- no translation is done, the regex is just compiled
+        and used as-is.
+
+        Selected strings will be added to self.files.
+
+        Return True if files are found.
+        """
+        # XXX docstring lying about what the special chars are?
+        found = False
+        pattern_re = self._translate_pattern(pattern, anchor, prefix, is_regex)
+
+        # delayed loading of allfiles list
+        if self.allfiles is None:
+            self.findall()
+
+        for name in self.allfiles:
+            if pattern_re.search(name):
+                self.files.add(name)
+                found = True
+        return found
+
+    def _exclude_pattern(self, pattern, anchor=True, prefix=None,
+                         is_regex=False):
+        """Remove strings (presumably filenames) from 'files' that match
+        'pattern'.
+
+        Other parameters are the same as for 'include_pattern()', above.
+        The list 'self.files' is modified in place. Return True if files are
+        found.
+
+        This API is public to allow e.g. exclusion of SCM subdirs, e.g. when
+        packaging source distributions
+        """
+        found = False
+        pattern_re = self._translate_pattern(pattern, anchor, prefix, is_regex)
+        for f in list(self.files):
+            if pattern_re.search(f):
+                self.files.remove(f)
+                found = True
+        return found
+
+    def _translate_pattern(self, pattern, anchor=True, prefix=None,
+                           is_regex=False):
+        """Translate a shell-like wildcard pattern to a compiled regular
+        expression.
+
+        Return the compiled regex.  If 'is_regex' true,
+        then 'pattern' is directly compiled to a regex (if it's a string)
+        or just returned as-is (assumes it's a regex object).
+        """
+        if is_regex:
+            if isinstance(pattern, str):
+                return re.compile(pattern)
+            else:
+                return pattern
+
+        if _PYTHON_VERSION > (3, 2):
+            # ditch start and end characters
+            start, _, end = self._glob_to_re('_').partition('_')
+
+        if pattern:
+            pattern_re = self._glob_to_re(pattern)
+            if _PYTHON_VERSION > (3, 2):
+                assert pattern_re.startswith(start) and pattern_re.endswith(end)
+        else:
+            pattern_re = ''
+
+        base = re.escape(os.path.join(self.base, ''))
+        if prefix is not None:
+            # ditch end of pattern character
+            if _PYTHON_VERSION <= (3, 2):
+                empty_pattern = self._glob_to_re('')
+                prefix_re = self._glob_to_re(prefix)[:-len(empty_pattern)]
+            else:
+                prefix_re = self._glob_to_re(prefix)
+                assert prefix_re.startswith(start) and prefix_re.endswith(end)
+                prefix_re = prefix_re[len(start): len(prefix_re) - len(end)]
+            sep = os.sep
+            if os.sep == '\\':
+                sep = r'\\'
+            if _PYTHON_VERSION <= (3, 2):
+                pattern_re = '^' + base + sep.join((prefix_re,
+                                                    '.*' + pattern_re))
+            else:
+                pattern_re = pattern_re[len(start): len(pattern_re) - len(end)]
+                pattern_re = r'%s%s%s%s.*%s%s' % (start, base, prefix_re, sep,
+                                                  pattern_re, end)
+        else:  # no prefix -- respect anchor flag
+            if anchor:
+                if _PYTHON_VERSION <= (3, 2):
+                    pattern_re = '^' + base + pattern_re
+                else:
+                    pattern_re = r'%s%s%s' % (start, base, pattern_re[len(start):])
+
+        return re.compile(pattern_re)
+
+    def _glob_to_re(self, pattern):
+        """Translate a shell-like glob pattern to a regular expression.
+
+        Return a string containing the regex.  Differs from
+        'fnmatch.translate()' in that '*' does not match "special characters"
+        (which are platform-specific).
+        """
+        pattern_re = fnmatch.translate(pattern)
+
+        # '?' and '*' in the glob pattern become '.' and '.*' in the RE, which
+        # IMHO is wrong -- '?' and '*' aren't supposed to match slash in Unix,
+        # and by extension they shouldn't match such "special characters" under
+        # any OS.  So change all non-escaped dots in the RE to match any
+        # character except the special characters (currently: just os.sep).
+        sep = os.sep
+        if os.sep == '\\':
+            # we're using a regex to manipulate a regex, so we need
+            # to escape the backslash twice
+            sep = r'\\\\'
+        escaped = r'\1[^%s]' % sep
+        pattern_re = re.sub(r'((?<!\\)(\\\\)*)\.', escaped, pattern_re)
+        return pattern_re
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/markers.py b/venv/Lib/site-packages/pip/_vendor/distlib/markers.py
new file mode 100644
index 000000000..ee1f3e236
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/markers.py
@@ -0,0 +1,131 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2017 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""
+Parser for the environment markers micro-language defined in PEP 508.
+"""
+
+# Note: In PEP 345, the micro-language was Python compatible, so the ast
+# module could be used to parse it. However, PEP 508 introduced operators such
+# as ~= and === which aren't in Python, necessitating a different approach.
+
+import os
+import sys
+import platform
+import re
+
+from .compat import python_implementation, urlparse, string_types
+from .util import in_venv, parse_marker
+
+__all__ = ['interpret']
+
+def _is_literal(o):
+    if not isinstance(o, string_types) or not o:
+        return False
+    return o[0] in '\'"'
+
+class Evaluator(object):
+    """
+    This class is used to evaluate marker expessions.
+    """
+
+    operations = {
+        '==': lambda x, y: x == y,
+        '===': lambda x, y: x == y,
+        '~=': lambda x, y: x == y or x > y,
+        '!=': lambda x, y: x != y,
+        '<':  lambda x, y: x < y,
+        '<=':  lambda x, y: x == y or x < y,
+        '>':  lambda x, y: x > y,
+        '>=':  lambda x, y: x == y or x > y,
+        'and': lambda x, y: x and y,
+        'or': lambda x, y: x or y,
+        'in': lambda x, y: x in y,
+        'not in': lambda x, y: x not in y,
+    }
+
+    def evaluate(self, expr, context):
+        """
+        Evaluate a marker expression returned by the :func:`parse_requirement`
+        function in the specified context.
+        """
+        if isinstance(expr, string_types):
+            if expr[0] in '\'"':
+                result = expr[1:-1]
+            else:
+                if expr not in context:
+                    raise SyntaxError('unknown variable: %s' % expr)
+                result = context[expr]
+        else:
+            assert isinstance(expr, dict)
+            op = expr['op']
+            if op not in self.operations:
+                raise NotImplementedError('op not implemented: %s' % op)
+            elhs = expr['lhs']
+            erhs = expr['rhs']
+            if _is_literal(expr['lhs']) and _is_literal(expr['rhs']):
+                raise SyntaxError('invalid comparison: %s %s %s' % (elhs, op, erhs))
+
+            lhs = self.evaluate(elhs, context)
+            rhs = self.evaluate(erhs, context)
+            result = self.operations[op](lhs, rhs)
+        return result
+
+def default_context():
+    def format_full_version(info):
+        version = '%s.%s.%s' % (info.major, info.minor, info.micro)
+        kind = info.releaselevel
+        if kind != 'final':
+            version += kind[0] + str(info.serial)
+        return version
+
+    if hasattr(sys, 'implementation'):
+        implementation_version = format_full_version(sys.implementation.version)
+        implementation_name = sys.implementation.name
+    else:
+        implementation_version = '0'
+        implementation_name = ''
+
+    result = {
+        'implementation_name': implementation_name,
+        'implementation_version': implementation_version,
+        'os_name': os.name,
+        'platform_machine': platform.machine(),
+        'platform_python_implementation': platform.python_implementation(),
+        'platform_release': platform.release(),
+        'platform_system': platform.system(),
+        'platform_version': platform.version(),
+        'platform_in_venv': str(in_venv()),
+        'python_full_version': platform.python_version(),
+        'python_version': platform.python_version()[:3],
+        'sys_platform': sys.platform,
+    }
+    return result
+
+DEFAULT_CONTEXT = default_context()
+del default_context
+
+evaluator = Evaluator()
+
+def interpret(marker, execution_context=None):
+    """
+    Interpret a marker and return a result depending on environment.
+
+    :param marker: The marker to interpret.
+    :type marker: str
+    :param execution_context: The context used for name lookup.
+    :type execution_context: mapping
+    """
+    try:
+        expr, rest = parse_marker(marker)
+    except Exception as e:
+        raise SyntaxError('Unable to interpret marker syntax: %s: %s' % (marker, e))
+    if rest and rest[0] != '#':
+        raise SyntaxError('unexpected trailing data in marker: %s: %s' % (marker, rest))
+    context = dict(DEFAULT_CONTEXT)
+    if execution_context:
+        context.update(execution_context)
+    return evaluator.evaluate(expr, context)
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/metadata.py b/venv/Lib/site-packages/pip/_vendor/distlib/metadata.py
new file mode 100644
index 000000000..6d5e23609
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/metadata.py
@@ -0,0 +1,1056 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""Implementation of the Metadata for Python packages PEPs.
+
+Supports all metadata formats (1.0, 1.1, 1.2, 1.3/2.1 and withdrawn 2.0).
+"""
+from __future__ import unicode_literals
+
+import codecs
+from email import message_from_file
+import json
+import logging
+import re
+
+
+from . import DistlibException, __version__
+from .compat import StringIO, string_types, text_type
+from .markers import interpret
+from .util import extract_by_key, get_extras
+from .version import get_scheme, PEP440_VERSION_RE
+
+logger = logging.getLogger(__name__)
+
+
+class MetadataMissingError(DistlibException):
+    """A required metadata is missing"""
+
+
+class MetadataConflictError(DistlibException):
+    """Attempt to read or write metadata fields that are conflictual."""
+
+
+class MetadataUnrecognizedVersionError(DistlibException):
+    """Unknown metadata version number."""
+
+
+class MetadataInvalidError(DistlibException):
+    """A metadata value is invalid"""
+
+# public API of this module
+__all__ = ['Metadata', 'PKG_INFO_ENCODING', 'PKG_INFO_PREFERRED_VERSION']
+
+# Encoding used for the PKG-INFO files
+PKG_INFO_ENCODING = 'utf-8'
+
+# preferred version. Hopefully will be changed
+# to 1.2 once PEP 345 is supported everywhere
+PKG_INFO_PREFERRED_VERSION = '1.1'
+
+_LINE_PREFIX_1_2 = re.compile('\n       \\|')
+_LINE_PREFIX_PRE_1_2 = re.compile('\n        ')
+_241_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
+               'Summary', 'Description',
+               'Keywords', 'Home-page', 'Author', 'Author-email',
+               'License')
+
+_314_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
+               'Supported-Platform', 'Summary', 'Description',
+               'Keywords', 'Home-page', 'Author', 'Author-email',
+               'License', 'Classifier', 'Download-URL', 'Obsoletes',
+               'Provides', 'Requires')
+
+_314_MARKERS = ('Obsoletes', 'Provides', 'Requires', 'Classifier',
+                'Download-URL')
+
+_345_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
+               'Supported-Platform', 'Summary', 'Description',
+               'Keywords', 'Home-page', 'Author', 'Author-email',
+               'Maintainer', 'Maintainer-email', 'License',
+               'Classifier', 'Download-URL', 'Obsoletes-Dist',
+               'Project-URL', 'Provides-Dist', 'Requires-Dist',
+               'Requires-Python', 'Requires-External')
+
+_345_MARKERS = ('Provides-Dist', 'Requires-Dist', 'Requires-Python',
+                'Obsoletes-Dist', 'Requires-External', 'Maintainer',
+                'Maintainer-email', 'Project-URL')
+
+_426_FIELDS = ('Metadata-Version', 'Name', 'Version', 'Platform',
+               'Supported-Platform', 'Summary', 'Description',
+               'Keywords', 'Home-page', 'Author', 'Author-email',
+               'Maintainer', 'Maintainer-email', 'License',
+               'Classifier', 'Download-URL', 'Obsoletes-Dist',
+               'Project-URL', 'Provides-Dist', 'Requires-Dist',
+               'Requires-Python', 'Requires-External', 'Private-Version',
+               'Obsoleted-By', 'Setup-Requires-Dist', 'Extension',
+               'Provides-Extra')
+
+_426_MARKERS = ('Private-Version', 'Provides-Extra', 'Obsoleted-By',
+                'Setup-Requires-Dist', 'Extension')
+
+# See issue #106: Sometimes 'Requires' and 'Provides' occur wrongly in
+# the metadata. Include them in the tuple literal below to allow them
+# (for now).
+_566_FIELDS = _426_FIELDS + ('Description-Content-Type',
+                             'Requires', 'Provides')
+
+_566_MARKERS = ('Description-Content-Type',)
+
+_ALL_FIELDS = set()
+_ALL_FIELDS.update(_241_FIELDS)
+_ALL_FIELDS.update(_314_FIELDS)
+_ALL_FIELDS.update(_345_FIELDS)
+_ALL_FIELDS.update(_426_FIELDS)
+_ALL_FIELDS.update(_566_FIELDS)
+
+EXTRA_RE = re.compile(r'''extra\s*==\s*("([^"]+)"|'([^']+)')''')
+
+
+def _version2fieldlist(version):
+    if version == '1.0':
+        return _241_FIELDS
+    elif version == '1.1':
+        return _314_FIELDS
+    elif version == '1.2':
+        return _345_FIELDS
+    elif version in ('1.3', '2.1'):
+        return _345_FIELDS + _566_FIELDS
+    elif version == '2.0':
+        return _426_FIELDS
+    raise MetadataUnrecognizedVersionError(version)
+
+
+def _best_version(fields):
+    """Detect the best version depending on the fields used."""
+    def _has_marker(keys, markers):
+        for marker in markers:
+            if marker in keys:
+                return True
+        return False
+
+    keys = []
+    for key, value in fields.items():
+        if value in ([], 'UNKNOWN', None):
+            continue
+        keys.append(key)
+
+    possible_versions = ['1.0', '1.1', '1.2', '1.3', '2.0', '2.1']
+
+    # first let's try to see if a field is not part of one of the version
+    for key in keys:
+        if key not in _241_FIELDS and '1.0' in possible_versions:
+            possible_versions.remove('1.0')
+            logger.debug('Removed 1.0 due to %s', key)
+        if key not in _314_FIELDS and '1.1' in possible_versions:
+            possible_versions.remove('1.1')
+            logger.debug('Removed 1.1 due to %s', key)
+        if key not in _345_FIELDS and '1.2' in possible_versions:
+            possible_versions.remove('1.2')
+            logger.debug('Removed 1.2 due to %s', key)
+        if key not in _566_FIELDS and '1.3' in possible_versions:
+            possible_versions.remove('1.3')
+            logger.debug('Removed 1.3 due to %s', key)
+        if key not in _566_FIELDS and '2.1' in possible_versions:
+            if key != 'Description':  # In 2.1, description allowed after headers
+                possible_versions.remove('2.1')
+                logger.debug('Removed 2.1 due to %s', key)
+        if key not in _426_FIELDS and '2.0' in possible_versions:
+            possible_versions.remove('2.0')
+            logger.debug('Removed 2.0 due to %s', key)
+
+    # possible_version contains qualified versions
+    if len(possible_versions) == 1:
+        return possible_versions[0]   # found !
+    elif len(possible_versions) == 0:
+        logger.debug('Out of options - unknown metadata set: %s', fields)
+        raise MetadataConflictError('Unknown metadata set')
+
+    # let's see if one unique marker is found
+    is_1_1 = '1.1' in possible_versions and _has_marker(keys, _314_MARKERS)
+    is_1_2 = '1.2' in possible_versions and _has_marker(keys, _345_MARKERS)
+    is_2_1 = '2.1' in possible_versions and _has_marker(keys, _566_MARKERS)
+    is_2_0 = '2.0' in possible_versions and _has_marker(keys, _426_MARKERS)
+    if int(is_1_1) + int(is_1_2) + int(is_2_1) + int(is_2_0) > 1:
+        raise MetadataConflictError('You used incompatible 1.1/1.2/2.0/2.1 fields')
+
+    # we have the choice, 1.0, or 1.2, or 2.0
+    #   - 1.0 has a broken Summary field but works with all tools
+    #   - 1.1 is to avoid
+    #   - 1.2 fixes Summary but has little adoption
+    #   - 2.0 adds more features and is very new
+    if not is_1_1 and not is_1_2 and not is_2_1 and not is_2_0:
+        # we couldn't find any specific marker
+        if PKG_INFO_PREFERRED_VERSION in possible_versions:
+            return PKG_INFO_PREFERRED_VERSION
+    if is_1_1:
+        return '1.1'
+    if is_1_2:
+        return '1.2'
+    if is_2_1:
+        return '2.1'
+
+    return '2.0'
+
+# This follows the rules about transforming keys as described in
+# https://www.python.org/dev/peps/pep-0566/#id17
+_ATTR2FIELD = {
+    name.lower().replace("-", "_"): name for name in _ALL_FIELDS
+}
+_FIELD2ATTR = {field: attr for attr, field in _ATTR2FIELD.items()}
+
+_PREDICATE_FIELDS = ('Requires-Dist', 'Obsoletes-Dist', 'Provides-Dist')
+_VERSIONS_FIELDS = ('Requires-Python',)
+_VERSION_FIELDS = ('Version',)
+_LISTFIELDS = ('Platform', 'Classifier', 'Obsoletes',
+               'Requires', 'Provides', 'Obsoletes-Dist',
+               'Provides-Dist', 'Requires-Dist', 'Requires-External',
+               'Project-URL', 'Supported-Platform', 'Setup-Requires-Dist',
+               'Provides-Extra', 'Extension')
+_LISTTUPLEFIELDS = ('Project-URL',)
+
+_ELEMENTSFIELD = ('Keywords',)
+
+_UNICODEFIELDS = ('Author', 'Maintainer', 'Summary', 'Description')
+
+_MISSING = object()
+
+_FILESAFE = re.compile('[^A-Za-z0-9.]+')
+
+
+def _get_name_and_version(name, version, for_filename=False):
+    """Return the distribution name with version.
+
+    If for_filename is true, return a filename-escaped form."""
+    if for_filename:
+        # For both name and version any runs of non-alphanumeric or '.'
+        # characters are replaced with a single '-'.  Additionally any
+        # spaces in the version string become '.'
+        name = _FILESAFE.sub('-', name)
+        version = _FILESAFE.sub('-', version.replace(' ', '.'))
+    return '%s-%s' % (name, version)
+
+
+class LegacyMetadata(object):
+    """The legacy metadata of a release.
+
+    Supports versions 1.0, 1.1, 1.2, 2.0 and 1.3/2.1 (auto-detected). You can
+    instantiate the class with one of these arguments (or none):
+    - *path*, the path to a metadata file
+    - *fileobj* give a file-like object with metadata as content
+    - *mapping* is a dict-like object
+    - *scheme* is a version scheme name
+    """
+    # TODO document the mapping API and UNKNOWN default key
+
+    def __init__(self, path=None, fileobj=None, mapping=None,
+                 scheme='default'):
+        if [path, fileobj, mapping].count(None) < 2:
+            raise TypeError('path, fileobj and mapping are exclusive')
+        self._fields = {}
+        self.requires_files = []
+        self._dependencies = None
+        self.scheme = scheme
+        if path is not None:
+            self.read(path)
+        elif fileobj is not None:
+            self.read_file(fileobj)
+        elif mapping is not None:
+            self.update(mapping)
+            self.set_metadata_version()
+
+    def set_metadata_version(self):
+        self._fields['Metadata-Version'] = _best_version(self._fields)
+
+    def _write_field(self, fileobj, name, value):
+        fileobj.write('%s: %s\n' % (name, value))
+
+    def __getitem__(self, name):
+        return self.get(name)
+
+    def __setitem__(self, name, value):
+        return self.set(name, value)
+
+    def __delitem__(self, name):
+        field_name = self._convert_name(name)
+        try:
+            del self._fields[field_name]
+        except KeyError:
+            raise KeyError(name)
+
+    def __contains__(self, name):
+        return (name in self._fields or
+                self._convert_name(name) in self._fields)
+
+    def _convert_name(self, name):
+        if name in _ALL_FIELDS:
+            return name
+        name = name.replace('-', '_').lower()
+        return _ATTR2FIELD.get(name, name)
+
+    def _default_value(self, name):
+        if name in _LISTFIELDS or name in _ELEMENTSFIELD:
+            return []
+        return 'UNKNOWN'
+
+    def _remove_line_prefix(self, value):
+        if self.metadata_version in ('1.0', '1.1'):
+            return _LINE_PREFIX_PRE_1_2.sub('\n', value)
+        else:
+            return _LINE_PREFIX_1_2.sub('\n', value)
+
+    def __getattr__(self, name):
+        if name in _ATTR2FIELD:
+            return self[name]
+        raise AttributeError(name)
+
+    #
+    # Public API
+    #
+
+#    dependencies = property(_get_dependencies, _set_dependencies)
+
+    def get_fullname(self, filesafe=False):
+        """Return the distribution name with version.
+
+        If filesafe is true, return a filename-escaped form."""
+        return _get_name_and_version(self['Name'], self['Version'], filesafe)
+
+    def is_field(self, name):
+        """return True if name is a valid metadata key"""
+        name = self._convert_name(name)
+        return name in _ALL_FIELDS
+
+    def is_multi_field(self, name):
+        name = self._convert_name(name)
+        return name in _LISTFIELDS
+
+    def read(self, filepath):
+        """Read the metadata values from a file path."""
+        fp = codecs.open(filepath, 'r', encoding='utf-8')
+        try:
+            self.read_file(fp)
+        finally:
+            fp.close()
+
+    def read_file(self, fileob):
+        """Read the metadata values from a file object."""
+        msg = message_from_file(fileob)
+        self._fields['Metadata-Version'] = msg['metadata-version']
+
+        # When reading, get all the fields we can
+        for field in _ALL_FIELDS:
+            if field not in msg:
+                continue
+            if field in _LISTFIELDS:
+                # we can have multiple lines
+                values = msg.get_all(field)
+                if field in _LISTTUPLEFIELDS and values is not None:
+                    values = [tuple(value.split(',')) for value in values]
+                self.set(field, values)
+            else:
+                # single line
+                value = msg[field]
+                if value is not None and value != 'UNKNOWN':
+                    self.set(field, value)
+
+        # PEP 566 specifies that the body be used for the description, if
+        # available
+        body = msg.get_payload()
+        self["Description"] = body if body else self["Description"]
+        # logger.debug('Attempting to set metadata for %s', self)
+        # self.set_metadata_version()
+
+    def write(self, filepath, skip_unknown=False):
+        """Write the metadata fields to filepath."""
+        fp = codecs.open(filepath, 'w', encoding='utf-8')
+        try:
+            self.write_file(fp, skip_unknown)
+        finally:
+            fp.close()
+
+    def write_file(self, fileobject, skip_unknown=False):
+        """Write the PKG-INFO format data to a file object."""
+        self.set_metadata_version()
+
+        for field in _version2fieldlist(self['Metadata-Version']):
+            values = self.get(field)
+            if skip_unknown and values in ('UNKNOWN', [], ['UNKNOWN']):
+                continue
+            if field in _ELEMENTSFIELD:
+                self._write_field(fileobject, field, ','.join(values))
+                continue
+            if field not in _LISTFIELDS:
+                if field == 'Description':
+                    if self.metadata_version in ('1.0', '1.1'):
+                        values = values.replace('\n', '\n        ')
+                    else:
+                        values = values.replace('\n', '\n       |')
+                values = [values]
+
+            if field in _LISTTUPLEFIELDS:
+                values = [','.join(value) for value in values]
+
+            for value in values:
+                self._write_field(fileobject, field, value)
+
+    def update(self, other=None, **kwargs):
+        """Set metadata values from the given iterable `other` and kwargs.
+
+        Behavior is like `dict.update`: If `other` has a ``keys`` method,
+        they are looped over and ``self[key]`` is assigned ``other[key]``.
+        Else, ``other`` is an iterable of ``(key, value)`` iterables.
+
+        Keys that don't match a metadata field or that have an empty value are
+        dropped.
+        """
+        def _set(key, value):
+            if key in _ATTR2FIELD and value:
+                self.set(self._convert_name(key), value)
+
+        if not other:
+            # other is None or empty container
+            pass
+        elif hasattr(other, 'keys'):
+            for k in other.keys():
+                _set(k, other[k])
+        else:
+            for k, v in other:
+                _set(k, v)
+
+        if kwargs:
+            for k, v in kwargs.items():
+                _set(k, v)
+
+    def set(self, name, value):
+        """Control then set a metadata field."""
+        name = self._convert_name(name)
+
+        if ((name in _ELEMENTSFIELD or name == 'Platform') and
+            not isinstance(value, (list, tuple))):
+            if isinstance(value, string_types):
+                value = [v.strip() for v in value.split(',')]
+            else:
+                value = []
+        elif (name in _LISTFIELDS and
+              not isinstance(value, (list, tuple))):
+            if isinstance(value, string_types):
+                value = [value]
+            else:
+                value = []
+
+        if logger.isEnabledFor(logging.WARNING):
+            project_name = self['Name']
+
+            scheme = get_scheme(self.scheme)
+            if name in _PREDICATE_FIELDS and value is not None:
+                for v in value:
+                    # check that the values are valid
+                    if not scheme.is_valid_matcher(v.split(';')[0]):
+                        logger.warning(
+                            "'%s': '%s' is not valid (field '%s')",
+                            project_name, v, name)
+            # FIXME this rejects UNKNOWN, is that right?
+            elif name in _VERSIONS_FIELDS and value is not None:
+                if not scheme.is_valid_constraint_list(value):
+                    logger.warning("'%s': '%s' is not a valid version (field '%s')",
+                                   project_name, value, name)
+            elif name in _VERSION_FIELDS and value is not None:
+                if not scheme.is_valid_version(value):
+                    logger.warning("'%s': '%s' is not a valid version (field '%s')",
+                                   project_name, value, name)
+
+        if name in _UNICODEFIELDS:
+            if name == 'Description':
+                value = self._remove_line_prefix(value)
+
+        self._fields[name] = value
+
+    def get(self, name, default=_MISSING):
+        """Get a metadata field."""
+        name = self._convert_name(name)
+        if name not in self._fields:
+            if default is _MISSING:
+                default = self._default_value(name)
+            return default
+        if name in _UNICODEFIELDS:
+            value = self._fields[name]
+            return value
+        elif name in _LISTFIELDS:
+            value = self._fields[name]
+            if value is None:
+                return []
+            res = []
+            for val in value:
+                if name not in _LISTTUPLEFIELDS:
+                    res.append(val)
+                else:
+                    # That's for Project-URL
+                    res.append((val[0], val[1]))
+            return res
+
+        elif name in _ELEMENTSFIELD:
+            value = self._fields[name]
+            if isinstance(value, string_types):
+                return value.split(',')
+        return self._fields[name]
+
+    def check(self, strict=False):
+        """Check if the metadata is compliant. If strict is True then raise if
+        no Name or Version are provided"""
+        self.set_metadata_version()
+
+        # XXX should check the versions (if the file was loaded)
+        missing, warnings = [], []
+
+        for attr in ('Name', 'Version'):  # required by PEP 345
+            if attr not in self:
+                missing.append(attr)
+
+        if strict and missing != []:
+            msg = 'missing required metadata: %s' % ', '.join(missing)
+            raise MetadataMissingError(msg)
+
+        for attr in ('Home-page', 'Author'):
+            if attr not in self:
+                missing.append(attr)
+
+        # checking metadata 1.2 (XXX needs to check 1.1, 1.0)
+        if self['Metadata-Version'] != '1.2':
+            return missing, warnings
+
+        scheme = get_scheme(self.scheme)
+
+        def are_valid_constraints(value):
+            for v in value:
+                if not scheme.is_valid_matcher(v.split(';')[0]):
+                    return False
+            return True
+
+        for fields, controller in ((_PREDICATE_FIELDS, are_valid_constraints),
+                                   (_VERSIONS_FIELDS,
+                                    scheme.is_valid_constraint_list),
+                                   (_VERSION_FIELDS,
+                                    scheme.is_valid_version)):
+            for field in fields:
+                value = self.get(field, None)
+                if value is not None and not controller(value):
+                    warnings.append("Wrong value for '%s': %s" % (field, value))
+
+        return missing, warnings
+
+    def todict(self, skip_missing=False):
+        """Return fields as a dict.
+
+        Field names will be converted to use the underscore-lowercase style
+        instead of hyphen-mixed case (i.e. home_page instead of Home-page).
+        This is as per https://www.python.org/dev/peps/pep-0566/#id17.
+        """
+        self.set_metadata_version()
+
+        fields = _version2fieldlist(self['Metadata-Version'])
+
+        data = {}
+
+        for field_name in fields:
+            if not skip_missing or field_name in self._fields:
+                key = _FIELD2ATTR[field_name]
+                if key != 'project_url':
+                    data[key] = self[field_name]
+                else:
+                    data[key] = [','.join(u) for u in self[field_name]]
+
+        return data
+
+    def add_requirements(self, requirements):
+        if self['Metadata-Version'] == '1.1':
+            # we can't have 1.1 metadata *and* Setuptools requires
+            for field in ('Obsoletes', 'Requires', 'Provides'):
+                if field in self:
+                    del self[field]
+        self['Requires-Dist'] += requirements
+
+    # Mapping API
+    # TODO could add iter* variants
+
+    def keys(self):
+        return list(_version2fieldlist(self['Metadata-Version']))
+
+    def __iter__(self):
+        for key in self.keys():
+            yield key
+
+    def values(self):
+        return [self[key] for key in self.keys()]
+
+    def items(self):
+        return [(key, self[key]) for key in self.keys()]
+
+    def __repr__(self):
+        return '<%s %s %s>' % (self.__class__.__name__, self.name,
+                               self.version)
+
+
+METADATA_FILENAME = 'pydist.json'
+WHEEL_METADATA_FILENAME = 'metadata.json'
+LEGACY_METADATA_FILENAME = 'METADATA'
+
+
+class Metadata(object):
+    """
+    The metadata of a release. This implementation uses 2.0 (JSON)
+    metadata where possible. If not possible, it wraps a LegacyMetadata
+    instance which handles the key-value metadata format.
+    """
+
+    METADATA_VERSION_MATCHER = re.compile(r'^\d+(\.\d+)*$')
+
+    NAME_MATCHER = re.compile('^[0-9A-Z]([0-9A-Z_.-]*[0-9A-Z])?$', re.I)
+
+    VERSION_MATCHER = PEP440_VERSION_RE
+
+    SUMMARY_MATCHER = re.compile('.{1,2047}')
+
+    METADATA_VERSION = '2.0'
+
+    GENERATOR = 'distlib (%s)' % __version__
+
+    MANDATORY_KEYS = {
+        'name': (),
+        'version': (),
+        'summary': ('legacy',),
+    }
+
+    INDEX_KEYS = ('name version license summary description author '
+                  'author_email keywords platform home_page classifiers '
+                  'download_url')
+
+    DEPENDENCY_KEYS = ('extras run_requires test_requires build_requires '
+                       'dev_requires provides meta_requires obsoleted_by '
+                       'supports_environments')
+
+    SYNTAX_VALIDATORS = {
+        'metadata_version': (METADATA_VERSION_MATCHER, ()),
+        'name': (NAME_MATCHER, ('legacy',)),
+        'version': (VERSION_MATCHER, ('legacy',)),
+        'summary': (SUMMARY_MATCHER, ('legacy',)),
+    }
+
+    __slots__ = ('_legacy', '_data', 'scheme')
+
+    def __init__(self, path=None, fileobj=None, mapping=None,
+                 scheme='default'):
+        if [path, fileobj, mapping].count(None) < 2:
+            raise TypeError('path, fileobj and mapping are exclusive')
+        self._legacy = None
+        self._data = None
+        self.scheme = scheme
+        #import pdb; pdb.set_trace()
+        if mapping is not None:
+            try:
+                self._validate_mapping(mapping, scheme)
+                self._data = mapping
+            except MetadataUnrecognizedVersionError:
+                self._legacy = LegacyMetadata(mapping=mapping, scheme=scheme)
+                self.validate()
+        else:
+            data = None
+            if path:
+                with open(path, 'rb') as f:
+                    data = f.read()
+            elif fileobj:
+                data = fileobj.read()
+            if data is None:
+                # Initialised with no args - to be added
+                self._data = {
+                    'metadata_version': self.METADATA_VERSION,
+                    'generator': self.GENERATOR,
+                }
+            else:
+                if not isinstance(data, text_type):
+                    data = data.decode('utf-8')
+                try:
+                    self._data = json.loads(data)
+                    self._validate_mapping(self._data, scheme)
+                except ValueError:
+                    # Note: MetadataUnrecognizedVersionError does not
+                    # inherit from ValueError (it's a DistlibException,
+                    # which should not inherit from ValueError).
+                    # The ValueError comes from the json.load - if that
+                    # succeeds and we get a validation error, we want
+                    # that to propagate
+                    self._legacy = LegacyMetadata(fileobj=StringIO(data),
+                                                  scheme=scheme)
+                    self.validate()
+
+    common_keys = set(('name', 'version', 'license', 'keywords', 'summary'))
+
+    none_list = (None, list)
+    none_dict = (None, dict)
+
+    mapped_keys = {
+        'run_requires': ('Requires-Dist', list),
+        'build_requires': ('Setup-Requires-Dist', list),
+        'dev_requires': none_list,
+        'test_requires': none_list,
+        'meta_requires': none_list,
+        'extras': ('Provides-Extra', list),
+        'modules': none_list,
+        'namespaces': none_list,
+        'exports': none_dict,
+        'commands': none_dict,
+        'classifiers': ('Classifier', list),
+        'source_url': ('Download-URL', None),
+        'metadata_version': ('Metadata-Version', None),
+    }
+
+    del none_list, none_dict
+
+    def __getattribute__(self, key):
+        common = object.__getattribute__(self, 'common_keys')
+        mapped = object.__getattribute__(self, 'mapped_keys')
+        if key in mapped:
+            lk, maker = mapped[key]
+            if self._legacy:
+                if lk is None:
+                    result = None if maker is None else maker()
+                else:
+                    result = self._legacy.get(lk)
+            else:
+                value = None if maker is None else maker()
+                if key not in ('commands', 'exports', 'modules', 'namespaces',
+                               'classifiers'):
+                    result = self._data.get(key, value)
+                else:
+                    # special cases for PEP 459
+                    sentinel = object()
+                    result = sentinel
+                    d = self._data.get('extensions')
+                    if d:
+                        if key == 'commands':
+                            result = d.get('python.commands', value)
+                        elif key == 'classifiers':
+                            d = d.get('python.details')
+                            if d:
+                                result = d.get(key, value)
+                        else:
+                            d = d.get('python.exports')
+                            if not d:
+                                d = self._data.get('python.exports')
+                            if d:
+                                result = d.get(key, value)
+                    if result is sentinel:
+                        result = value
+        elif key not in common:
+            result = object.__getattribute__(self, key)
+        elif self._legacy:
+            result = self._legacy.get(key)
+        else:
+            result = self._data.get(key)
+        return result
+
+    def _validate_value(self, key, value, scheme=None):
+        if key in self.SYNTAX_VALIDATORS:
+            pattern, exclusions = self.SYNTAX_VALIDATORS[key]
+            if (scheme or self.scheme) not in exclusions:
+                m = pattern.match(value)
+                if not m:
+                    raise MetadataInvalidError("'%s' is an invalid value for "
+                                               "the '%s' property" % (value,
+                                                                    key))
+
+    def __setattr__(self, key, value):
+        self._validate_value(key, value)
+        common = object.__getattribute__(self, 'common_keys')
+        mapped = object.__getattribute__(self, 'mapped_keys')
+        if key in mapped:
+            lk, _ = mapped[key]
+            if self._legacy:
+                if lk is None:
+                    raise NotImplementedError
+                self._legacy[lk] = value
+            elif key not in ('commands', 'exports', 'modules', 'namespaces',
+                             'classifiers'):
+                self._data[key] = value
+            else:
+                # special cases for PEP 459
+                d = self._data.setdefault('extensions', {})
+                if key == 'commands':
+                    d['python.commands'] = value
+                elif key == 'classifiers':
+                    d = d.setdefault('python.details', {})
+                    d[key] = value
+                else:
+                    d = d.setdefault('python.exports', {})
+                    d[key] = value
+        elif key not in common:
+            object.__setattr__(self, key, value)
+        else:
+            if key == 'keywords':
+                if isinstance(value, string_types):
+                    value = value.strip()
+                    if value:
+                        value = value.split()
+                    else:
+                        value = []
+            if self._legacy:
+                self._legacy[key] = value
+            else:
+                self._data[key] = value
+
+    @property
+    def name_and_version(self):
+        return _get_name_and_version(self.name, self.version, True)
+
+    @property
+    def provides(self):
+        if self._legacy:
+            result = self._legacy['Provides-Dist']
+        else:
+            result = self._data.setdefault('provides', [])
+        s = '%s (%s)' % (self.name, self.version)
+        if s not in result:
+            result.append(s)
+        return result
+
+    @provides.setter
+    def provides(self, value):
+        if self._legacy:
+            self._legacy['Provides-Dist'] = value
+        else:
+            self._data['provides'] = value
+
+    def get_requirements(self, reqts, extras=None, env=None):
+        """
+        Base method to get dependencies, given a set of extras
+        to satisfy and an optional environment context.
+        :param reqts: A list of sometimes-wanted dependencies,
+                      perhaps dependent on extras and environment.
+        :param extras: A list of optional components being requested.
+        :param env: An optional environment for marker evaluation.
+        """
+        if self._legacy:
+            result = reqts
+        else:
+            result = []
+            extras = get_extras(extras or [], self.extras)
+            for d in reqts:
+                if 'extra' not in d and 'environment' not in d:
+                    # unconditional
+                    include = True
+                else:
+                    if 'extra' not in d:
+                        # Not extra-dependent - only environment-dependent
+                        include = True
+                    else:
+                        include = d.get('extra') in extras
+                    if include:
+                        # Not excluded because of extras, check environment
+                        marker = d.get('environment')
+                        if marker:
+                            include = interpret(marker, env)
+                if include:
+                    result.extend(d['requires'])
+            for key in ('build', 'dev', 'test'):
+                e = ':%s:' % key
+                if e in extras:
+                    extras.remove(e)
+                    # A recursive call, but it should terminate since 'test'
+                    # has been removed from the extras
+                    reqts = self._data.get('%s_requires' % key, [])
+                    result.extend(self.get_requirements(reqts, extras=extras,
+                                                        env=env))
+        return result
+
+    @property
+    def dictionary(self):
+        if self._legacy:
+            return self._from_legacy()
+        return self._data
+
+    @property
+    def dependencies(self):
+        if self._legacy:
+            raise NotImplementedError
+        else:
+            return extract_by_key(self._data, self.DEPENDENCY_KEYS)
+
+    @dependencies.setter
+    def dependencies(self, value):
+        if self._legacy:
+            raise NotImplementedError
+        else:
+            self._data.update(value)
+
+    def _validate_mapping(self, mapping, scheme):
+        if mapping.get('metadata_version') != self.METADATA_VERSION:
+            raise MetadataUnrecognizedVersionError()
+        missing = []
+        for key, exclusions in self.MANDATORY_KEYS.items():
+            if key not in mapping:
+                if scheme not in exclusions:
+                    missing.append(key)
+        if missing:
+            msg = 'Missing metadata items: %s' % ', '.join(missing)
+            raise MetadataMissingError(msg)
+        for k, v in mapping.items():
+            self._validate_value(k, v, scheme)
+
+    def validate(self):
+        if self._legacy:
+            missing, warnings = self._legacy.check(True)
+            if missing or warnings:
+                logger.warning('Metadata: missing: %s, warnings: %s',
+                               missing, warnings)
+        else:
+            self._validate_mapping(self._data, self.scheme)
+
+    def todict(self):
+        if self._legacy:
+            return self._legacy.todict(True)
+        else:
+            result = extract_by_key(self._data, self.INDEX_KEYS)
+            return result
+
+    def _from_legacy(self):
+        assert self._legacy and not self._data
+        result = {
+            'metadata_version': self.METADATA_VERSION,
+            'generator': self.GENERATOR,
+        }
+        lmd = self._legacy.todict(True)     # skip missing ones
+        for k in ('name', 'version', 'license', 'summary', 'description',
+                  'classifier'):
+            if k in lmd:
+                if k == 'classifier':
+                    nk = 'classifiers'
+                else:
+                    nk = k
+                result[nk] = lmd[k]
+        kw = lmd.get('Keywords', [])
+        if kw == ['']:
+            kw = []
+        result['keywords'] = kw
+        keys = (('requires_dist', 'run_requires'),
+                ('setup_requires_dist', 'build_requires'))
+        for ok, nk in keys:
+            if ok in lmd and lmd[ok]:
+                result[nk] = [{'requires': lmd[ok]}]
+        result['provides'] = self.provides
+        author = {}
+        maintainer = {}
+        return result
+
+    LEGACY_MAPPING = {
+        'name': 'Name',
+        'version': 'Version',
+        ('extensions', 'python.details', 'license'): 'License',
+        'summary': 'Summary',
+        'description': 'Description',
+        ('extensions', 'python.project', 'project_urls', 'Home'): 'Home-page',
+        ('extensions', 'python.project', 'contacts', 0, 'name'): 'Author',
+        ('extensions', 'python.project', 'contacts', 0, 'email'): 'Author-email',
+        'source_url': 'Download-URL',
+        ('extensions', 'python.details', 'classifiers'): 'Classifier',
+    }
+
+    def _to_legacy(self):
+        def process_entries(entries):
+            reqts = set()
+            for e in entries:
+                extra = e.get('extra')
+                env = e.get('environment')
+                rlist = e['requires']
+                for r in rlist:
+                    if not env and not extra:
+                        reqts.add(r)
+                    else:
+                        marker = ''
+                        if extra:
+                            marker = 'extra == "%s"' % extra
+                        if env:
+                            if marker:
+                                marker = '(%s) and %s' % (env, marker)
+                            else:
+                                marker = env
+                        reqts.add(';'.join((r, marker)))
+            return reqts
+
+        assert self._data and not self._legacy
+        result = LegacyMetadata()
+        nmd = self._data
+        # import pdb; pdb.set_trace()
+        for nk, ok in self.LEGACY_MAPPING.items():
+            if not isinstance(nk, tuple):
+                if nk in nmd:
+                    result[ok] = nmd[nk]
+            else:
+                d = nmd
+                found = True
+                for k in nk:
+                    try:
+                        d = d[k]
+                    except (KeyError, IndexError):
+                        found = False
+                        break
+                if found:
+                    result[ok] = d
+        r1 = process_entries(self.run_requires + self.meta_requires)
+        r2 = process_entries(self.build_requires + self.dev_requires)
+        if self.extras:
+            result['Provides-Extra'] = sorted(self.extras)
+        result['Requires-Dist'] = sorted(r1)
+        result['Setup-Requires-Dist'] = sorted(r2)
+        # TODO: any other fields wanted
+        return result
+
+    def write(self, path=None, fileobj=None, legacy=False, skip_unknown=True):
+        if [path, fileobj].count(None) != 1:
+            raise ValueError('Exactly one of path and fileobj is needed')
+        self.validate()
+        if legacy:
+            if self._legacy:
+                legacy_md = self._legacy
+            else:
+                legacy_md = self._to_legacy()
+            if path:
+                legacy_md.write(path, skip_unknown=skip_unknown)
+            else:
+                legacy_md.write_file(fileobj, skip_unknown=skip_unknown)
+        else:
+            if self._legacy:
+                d = self._from_legacy()
+            else:
+                d = self._data
+            if fileobj:
+                json.dump(d, fileobj, ensure_ascii=True, indent=2,
+                          sort_keys=True)
+            else:
+                with codecs.open(path, 'w', 'utf-8') as f:
+                    json.dump(d, f, ensure_ascii=True, indent=2,
+                              sort_keys=True)
+
+    def add_requirements(self, requirements):
+        if self._legacy:
+            self._legacy.add_requirements(requirements)
+        else:
+            run_requires = self._data.setdefault('run_requires', [])
+            always = None
+            for entry in run_requires:
+                if 'environment' not in entry and 'extra' not in entry:
+                    always = entry
+                    break
+            if always is None:
+                always = { 'requires': requirements }
+                run_requires.insert(0, always)
+            else:
+                rset = set(always['requires']) | set(requirements)
+                always['requires'] = sorted(rset)
+
+    def __repr__(self):
+        name = self.name or '(no name)'
+        version = self.version or 'no version'
+        return '<%s %s %s (%s)>' % (self.__class__.__name__,
+                                    self.metadata_version, name, version)
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/resources.py b/venv/Lib/site-packages/pip/_vendor/distlib/resources.py
new file mode 100644
index 000000000..18840167a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/resources.py
@@ -0,0 +1,355 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2013-2017 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+from __future__ import unicode_literals
+
+import bisect
+import io
+import logging
+import os
+import pkgutil
+import shutil
+import sys
+import types
+import zipimport
+
+from . import DistlibException
+from .util import cached_property, get_cache_base, path_to_cache_dir, Cache
+
+logger = logging.getLogger(__name__)
+
+
+cache = None    # created when needed
+
+
+class ResourceCache(Cache):
+    def __init__(self, base=None):
+        if base is None:
+            # Use native string to avoid issues on 2.x: see Python #20140.
+            base = os.path.join(get_cache_base(), str('resource-cache'))
+        super(ResourceCache, self).__init__(base)
+
+    def is_stale(self, resource, path):
+        """
+        Is the cache stale for the given resource?
+
+        :param resource: The :class:`Resource` being cached.
+        :param path: The path of the resource in the cache.
+        :return: True if the cache is stale.
+        """
+        # Cache invalidation is a hard problem :-)
+        return True
+
+    def get(self, resource):
+        """
+        Get a resource into the cache,
+
+        :param resource: A :class:`Resource` instance.
+        :return: The pathname of the resource in the cache.
+        """
+        prefix, path = resource.finder.get_cache_info(resource)
+        if prefix is None:
+            result = path
+        else:
+            result = os.path.join(self.base, self.prefix_to_dir(prefix), path)
+            dirname = os.path.dirname(result)
+            if not os.path.isdir(dirname):
+                os.makedirs(dirname)
+            if not os.path.exists(result):
+                stale = True
+            else:
+                stale = self.is_stale(resource, path)
+            if stale:
+                # write the bytes of the resource to the cache location
+                with open(result, 'wb') as f:
+                    f.write(resource.bytes)
+        return result
+
+
+class ResourceBase(object):
+    def __init__(self, finder, name):
+        self.finder = finder
+        self.name = name
+
+
+class Resource(ResourceBase):
+    """
+    A class representing an in-package resource, such as a data file. This is
+    not normally instantiated by user code, but rather by a
+    :class:`ResourceFinder` which manages the resource.
+    """
+    is_container = False        # Backwards compatibility
+
+    def as_stream(self):
+        """
+        Get the resource as a stream.
+
+        This is not a property to make it obvious that it returns a new stream
+        each time.
+        """
+        return self.finder.get_stream(self)
+
+    @cached_property
+    def file_path(self):
+        global cache
+        if cache is None:
+            cache = ResourceCache()
+        return cache.get(self)
+
+    @cached_property
+    def bytes(self):
+        return self.finder.get_bytes(self)
+
+    @cached_property
+    def size(self):
+        return self.finder.get_size(self)
+
+
+class ResourceContainer(ResourceBase):
+    is_container = True     # Backwards compatibility
+
+    @cached_property
+    def resources(self):
+        return self.finder.get_resources(self)
+
+
+class ResourceFinder(object):
+    """
+    Resource finder for file system resources.
+    """
+
+    if sys.platform.startswith('java'):
+        skipped_extensions = ('.pyc', '.pyo', '.class')
+    else:
+        skipped_extensions = ('.pyc', '.pyo')
+
+    def __init__(self, module):
+        self.module = module
+        self.loader = getattr(module, '__loader__', None)
+        self.base = os.path.dirname(getattr(module, '__file__', ''))
+
+    def _adjust_path(self, path):
+        return os.path.realpath(path)
+
+    def _make_path(self, resource_name):
+        # Issue #50: need to preserve type of path on Python 2.x
+        # like os.path._get_sep
+        if isinstance(resource_name, bytes):    # should only happen on 2.x
+            sep = b'/'
+        else:
+            sep = '/'
+        parts = resource_name.split(sep)
+        parts.insert(0, self.base)
+        result = os.path.join(*parts)
+        return self._adjust_path(result)
+
+    def _find(self, path):
+        return os.path.exists(path)
+
+    def get_cache_info(self, resource):
+        return None, resource.path
+
+    def find(self, resource_name):
+        path = self._make_path(resource_name)
+        if not self._find(path):
+            result = None
+        else:
+            if self._is_directory(path):
+                result = ResourceContainer(self, resource_name)
+            else:
+                result = Resource(self, resource_name)
+            result.path = path
+        return result
+
+    def get_stream(self, resource):
+        return open(resource.path, 'rb')
+
+    def get_bytes(self, resource):
+        with open(resource.path, 'rb') as f:
+            return f.read()
+
+    def get_size(self, resource):
+        return os.path.getsize(resource.path)
+
+    def get_resources(self, resource):
+        def allowed(f):
+            return (f != '__pycache__' and not
+                    f.endswith(self.skipped_extensions))
+        return set([f for f in os.listdir(resource.path) if allowed(f)])
+
+    def is_container(self, resource):
+        return self._is_directory(resource.path)
+
+    _is_directory = staticmethod(os.path.isdir)
+
+    def iterator(self, resource_name):
+        resource = self.find(resource_name)
+        if resource is not None:
+            todo = [resource]
+            while todo:
+                resource = todo.pop(0)
+                yield resource
+                if resource.is_container:
+                    rname = resource.name
+                    for name in resource.resources:
+                        if not rname:
+                            new_name = name
+                        else:
+                            new_name = '/'.join([rname, name])
+                        child = self.find(new_name)
+                        if child.is_container:
+                            todo.append(child)
+                        else:
+                            yield child
+
+
+class ZipResourceFinder(ResourceFinder):
+    """
+    Resource finder for resources in .zip files.
+    """
+    def __init__(self, module):
+        super(ZipResourceFinder, self).__init__(module)
+        archive = self.loader.archive
+        self.prefix_len = 1 + len(archive)
+        # PyPy doesn't have a _files attr on zipimporter, and you can't set one
+        if hasattr(self.loader, '_files'):
+            self._files = self.loader._files
+        else:
+            self._files = zipimport._zip_directory_cache[archive]
+        self.index = sorted(self._files)
+
+    def _adjust_path(self, path):
+        return path
+
+    def _find(self, path):
+        path = path[self.prefix_len:]
+        if path in self._files:
+            result = True
+        else:
+            if path and path[-1] != os.sep:
+                path = path + os.sep
+            i = bisect.bisect(self.index, path)
+            try:
+                result = self.index[i].startswith(path)
+            except IndexError:
+                result = False
+        if not result:
+            logger.debug('_find failed: %r %r', path, self.loader.prefix)
+        else:
+            logger.debug('_find worked: %r %r', path, self.loader.prefix)
+        return result
+
+    def get_cache_info(self, resource):
+        prefix = self.loader.archive
+        path = resource.path[1 + len(prefix):]
+        return prefix, path
+
+    def get_bytes(self, resource):
+        return self.loader.get_data(resource.path)
+
+    def get_stream(self, resource):
+        return io.BytesIO(self.get_bytes(resource))
+
+    def get_size(self, resource):
+        path = resource.path[self.prefix_len:]
+        return self._files[path][3]
+
+    def get_resources(self, resource):
+        path = resource.path[self.prefix_len:]
+        if path and path[-1] != os.sep:
+            path += os.sep
+        plen = len(path)
+        result = set()
+        i = bisect.bisect(self.index, path)
+        while i < len(self.index):
+            if not self.index[i].startswith(path):
+                break
+            s = self.index[i][plen:]
+            result.add(s.split(os.sep, 1)[0])   # only immediate children
+            i += 1
+        return result
+
+    def _is_directory(self, path):
+        path = path[self.prefix_len:]
+        if path and path[-1] != os.sep:
+            path += os.sep
+        i = bisect.bisect(self.index, path)
+        try:
+            result = self.index[i].startswith(path)
+        except IndexError:
+            result = False
+        return result
+
+_finder_registry = {
+    type(None): ResourceFinder,
+    zipimport.zipimporter: ZipResourceFinder
+}
+
+try:
+    # In Python 3.6, _frozen_importlib -> _frozen_importlib_external
+    try:
+        import _frozen_importlib_external as _fi
+    except ImportError:
+        import _frozen_importlib as _fi
+    _finder_registry[_fi.SourceFileLoader] = ResourceFinder
+    _finder_registry[_fi.FileFinder] = ResourceFinder
+    del _fi
+except (ImportError, AttributeError):
+    pass
+
+
+def register_finder(loader, finder_maker):
+    _finder_registry[type(loader)] = finder_maker
+
+_finder_cache = {}
+
+
+def finder(package):
+    """
+    Return a resource finder for a package.
+    :param package: The name of the package.
+    :return: A :class:`ResourceFinder` instance for the package.
+    """
+    if package in _finder_cache:
+        result = _finder_cache[package]
+    else:
+        if package not in sys.modules:
+            __import__(package)
+        module = sys.modules[package]
+        path = getattr(module, '__path__', None)
+        if path is None:
+            raise DistlibException('You cannot get a finder for a module, '
+                                   'only for a package')
+        loader = getattr(module, '__loader__', None)
+        finder_maker = _finder_registry.get(type(loader))
+        if finder_maker is None:
+            raise DistlibException('Unable to locate finder for %r' % package)
+        result = finder_maker(module)
+        _finder_cache[package] = result
+    return result
+
+
+_dummy_module = types.ModuleType(str('__dummy__'))
+
+
+def finder_for_path(path):
+    """
+    Return a resource finder for a path, which should represent a container.
+
+    :param path: The path.
+    :return: A :class:`ResourceFinder` instance for the path.
+    """
+    result = None
+    # calls any path hooks, gets importer into cache
+    pkgutil.get_importer(path)
+    loader = sys.path_importer_cache.get(path)
+    finder = _finder_registry.get(type(loader))
+    if finder:
+        module = _dummy_module
+        module.__file__ = os.path.join(path, '')
+        module.__loader__ = loader
+        result = finder(module)
+    return result
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/scripts.py b/venv/Lib/site-packages/pip/_vendor/distlib/scripts.py
new file mode 100644
index 000000000..03f8f21e0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/scripts.py
@@ -0,0 +1,419 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2013-2015 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+from io import BytesIO
+import logging
+import os
+import re
+import struct
+import sys
+
+from .compat import sysconfig, detect_encoding, ZipFile
+from .resources import finder
+from .util import (FileOperator, get_export_entry, convert_path,
+                   get_executable, in_venv)
+
+logger = logging.getLogger(__name__)
+
+_DEFAULT_MANIFEST = '''
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
+ <assemblyIdentity version="1.0.0.0"
+ processorArchitecture="X86"
+ name="%s"
+ type="win32"/>
+
+ <!-- Identify the application security requirements. -->
+ <trustInfo xmlns="urn:schemas-microsoft-com:asm.v3">
+ <security>
+ <requestedPrivileges>
+ <requestedExecutionLevel level="asInvoker" uiAccess="false"/>
+ </requestedPrivileges>
+ </security>
+ </trustInfo>
+</assembly>'''.strip()
+
+# check if Python is called on the first line with this expression
+FIRST_LINE_RE = re.compile(b'^#!.*pythonw?[0-9.]*([ \t].*)?$')
+SCRIPT_TEMPLATE = r'''# -*- coding: utf-8 -*-
+import re
+import sys
+from %(module)s import %(import_name)s
+if __name__ == '__main__':
+    sys.argv[0] = re.sub(r'(-script\.pyw|\.exe)?$', '', sys.argv[0])
+    sys.exit(%(func)s())
+'''
+
+
+def enquote_executable(executable):
+    if ' ' in executable:
+        # make sure we quote only the executable in case of env
+        # for example /usr/bin/env "/dir with spaces/bin/jython"
+        # instead of "/usr/bin/env /dir with spaces/bin/jython"
+        # otherwise whole
+        if executable.startswith('/usr/bin/env '):
+            env, _executable = executable.split(' ', 1)
+            if ' ' in _executable and not _executable.startswith('"'):
+                executable = '%s "%s"' % (env, _executable)
+        else:
+            if not executable.startswith('"'):
+                executable = '"%s"' % executable
+    return executable
+
+# Keep the old name around (for now), as there is at least one project using it!
+_enquote_executable = enquote_executable
+
+class ScriptMaker(object):
+    """
+    A class to copy or create scripts from source scripts or callable
+    specifications.
+    """
+    script_template = SCRIPT_TEMPLATE
+
+    executable = None  # for shebangs
+
+    def __init__(self, source_dir, target_dir, add_launchers=True,
+                 dry_run=False, fileop=None):
+        self.source_dir = source_dir
+        self.target_dir = target_dir
+        self.add_launchers = add_launchers
+        self.force = False
+        self.clobber = False
+        # It only makes sense to set mode bits on POSIX.
+        self.set_mode = (os.name == 'posix') or (os.name == 'java' and
+                                                 os._name == 'posix')
+        self.variants = set(('', 'X.Y'))
+        self._fileop = fileop or FileOperator(dry_run)
+
+        self._is_nt = os.name == 'nt' or (
+            os.name == 'java' and os._name == 'nt')
+        self.version_info = sys.version_info
+
+    def _get_alternate_executable(self, executable, options):
+        if options.get('gui', False) and self._is_nt:  # pragma: no cover
+            dn, fn = os.path.split(executable)
+            fn = fn.replace('python', 'pythonw')
+            executable = os.path.join(dn, fn)
+        return executable
+
+    if sys.platform.startswith('java'):  # pragma: no cover
+        def _is_shell(self, executable):
+            """
+            Determine if the specified executable is a script
+            (contains a #! line)
+            """
+            try:
+                with open(executable) as fp:
+                    return fp.read(2) == '#!'
+            except (OSError, IOError):
+                logger.warning('Failed to open %s', executable)
+                return False
+
+        def _fix_jython_executable(self, executable):
+            if self._is_shell(executable):
+                # Workaround for Jython is not needed on Linux systems.
+                import java
+
+                if java.lang.System.getProperty('os.name') == 'Linux':
+                    return executable
+            elif executable.lower().endswith('jython.exe'):
+                # Use wrapper exe for Jython on Windows
+                return executable
+            return '/usr/bin/env %s' % executable
+
+    def _build_shebang(self, executable, post_interp):
+        """
+        Build a shebang line. In the simple case (on Windows, or a shebang line
+        which is not too long or contains spaces) use a simple formulation for
+        the shebang. Otherwise, use /bin/sh as the executable, with a contrived
+        shebang which allows the script to run either under Python or sh, using
+        suitable quoting. Thanks to Harald Nordgren for his input.
+
+        See also: http://www.in-ulm.de/~mascheck/various/shebang/#length
+                  https://hg.mozilla.org/mozilla-central/file/tip/mach
+        """
+        if os.name != 'posix':
+            simple_shebang = True
+        else:
+            # Add 3 for '#!' prefix and newline suffix.
+            shebang_length = len(executable) + len(post_interp) + 3
+            if sys.platform == 'darwin':
+                max_shebang_length = 512
+            else:
+                max_shebang_length = 127
+            simple_shebang = ((b' ' not in executable) and
+                              (shebang_length <= max_shebang_length))
+
+        if simple_shebang:
+            result = b'#!' + executable + post_interp + b'\n'
+        else:
+            result = b'#!/bin/sh\n'
+            result += b"'''exec' " + executable + post_interp + b' "$0" "$@"\n'
+            result += b"' '''"
+        return result
+
+    def _get_shebang(self, encoding, post_interp=b'', options=None):
+        enquote = True
+        if self.executable:
+            executable = self.executable
+            enquote = False     # assume this will be taken care of
+        elif not sysconfig.is_python_build():
+            executable = get_executable()
+        elif in_venv():  # pragma: no cover
+            executable = os.path.join(sysconfig.get_path('scripts'),
+                            'python%s' % sysconfig.get_config_var('EXE'))
+        else:  # pragma: no cover
+            executable = os.path.join(
+                sysconfig.get_config_var('BINDIR'),
+               'python%s%s' % (sysconfig.get_config_var('VERSION'),
+                               sysconfig.get_config_var('EXE')))
+        if options:
+            executable = self._get_alternate_executable(executable, options)
+
+        if sys.platform.startswith('java'):  # pragma: no cover
+            executable = self._fix_jython_executable(executable)
+
+        # Normalise case for Windows - COMMENTED OUT
+        # executable = os.path.normcase(executable)
+        # N.B. The normalising operation above has been commented out: See
+        # issue #124. Although paths in Windows are generally case-insensitive,
+        # they aren't always. For example, a path containing a ẞ (which is a
+        # LATIN CAPITAL LETTER SHARP S - U+1E9E) is normcased to ß (which is a
+        # LATIN SMALL LETTER SHARP S' - U+00DF). The two are not considered by
+        # Windows as equivalent in path names.
+
+        # If the user didn't specify an executable, it may be necessary to
+        # cater for executable paths with spaces (not uncommon on Windows)
+        if enquote:
+            executable = enquote_executable(executable)
+        # Issue #51: don't use fsencode, since we later try to
+        # check that the shebang is decodable using utf-8.
+        executable = executable.encode('utf-8')
+        # in case of IronPython, play safe and enable frames support
+        if (sys.platform == 'cli' and '-X:Frames' not in post_interp
+            and '-X:FullFrames' not in post_interp):  # pragma: no cover
+            post_interp += b' -X:Frames'
+        shebang = self._build_shebang(executable, post_interp)
+        # Python parser starts to read a script using UTF-8 until
+        # it gets a #coding:xxx cookie. The shebang has to be the
+        # first line of a file, the #coding:xxx cookie cannot be
+        # written before. So the shebang has to be decodable from
+        # UTF-8.
+        try:
+            shebang.decode('utf-8')
+        except UnicodeDecodeError:  # pragma: no cover
+            raise ValueError(
+                'The shebang (%r) is not decodable from utf-8' % shebang)
+        # If the script is encoded to a custom encoding (use a
+        # #coding:xxx cookie), the shebang has to be decodable from
+        # the script encoding too.
+        if encoding != 'utf-8':
+            try:
+                shebang.decode(encoding)
+            except UnicodeDecodeError:  # pragma: no cover
+                raise ValueError(
+                    'The shebang (%r) is not decodable '
+                    'from the script encoding (%r)' % (shebang, encoding))
+        return shebang
+
+    def _get_script_text(self, entry):
+        return self.script_template % dict(module=entry.prefix,
+                                           import_name=entry.suffix.split('.')[0],
+                                           func=entry.suffix)
+
+    manifest = _DEFAULT_MANIFEST
+
+    def get_manifest(self, exename):
+        base = os.path.basename(exename)
+        return self.manifest % base
+
+    def _write_script(self, names, shebang, script_bytes, filenames, ext):
+        use_launcher = self.add_launchers and self._is_nt
+        linesep = os.linesep.encode('utf-8')
+        if not shebang.endswith(linesep):
+            shebang += linesep
+        if not use_launcher:
+            script_bytes = shebang + script_bytes
+        else:  # pragma: no cover
+            if ext == 'py':
+                launcher = self._get_launcher('t')
+            else:
+                launcher = self._get_launcher('w')
+            stream = BytesIO()
+            with ZipFile(stream, 'w') as zf:
+                zf.writestr('__main__.py', script_bytes)
+            zip_data = stream.getvalue()
+            script_bytes = launcher + shebang + zip_data
+        for name in names:
+            outname = os.path.join(self.target_dir, name)
+            if use_launcher:  # pragma: no cover
+                n, e = os.path.splitext(outname)
+                if e.startswith('.py'):
+                    outname = n
+                outname = '%s.exe' % outname
+                try:
+                    self._fileop.write_binary_file(outname, script_bytes)
+                except Exception:
+                    # Failed writing an executable - it might be in use.
+                    logger.warning('Failed to write executable - trying to '
+                                   'use .deleteme logic')
+                    dfname = '%s.deleteme' % outname
+                    if os.path.exists(dfname):
+                        os.remove(dfname)       # Not allowed to fail here
+                    os.rename(outname, dfname)  # nor here
+                    self._fileop.write_binary_file(outname, script_bytes)
+                    logger.debug('Able to replace executable using '
+                                 '.deleteme logic')
+                    try:
+                        os.remove(dfname)
+                    except Exception:
+                        pass    # still in use - ignore error
+            else:
+                if self._is_nt and not outname.endswith('.' + ext):  # pragma: no cover
+                    outname = '%s.%s' % (outname, ext)
+                if os.path.exists(outname) and not self.clobber:
+                    logger.warning('Skipping existing file %s', outname)
+                    continue
+                self._fileop.write_binary_file(outname, script_bytes)
+                if self.set_mode:
+                    self._fileop.set_executable_mode([outname])
+            filenames.append(outname)
+
+    def _make_script(self, entry, filenames, options=None):
+        post_interp = b''
+        if options:
+            args = options.get('interpreter_args', [])
+            if args:
+                args = ' %s' % ' '.join(args)
+                post_interp = args.encode('utf-8')
+        shebang = self._get_shebang('utf-8', post_interp, options=options)
+        script = self._get_script_text(entry).encode('utf-8')
+        name = entry.name
+        scriptnames = set()
+        if '' in self.variants:
+            scriptnames.add(name)
+        if 'X' in self.variants:
+            scriptnames.add('%s%s' % (name, self.version_info[0]))
+        if 'X.Y' in self.variants:
+            scriptnames.add('%s-%s.%s' % (name, self.version_info[0],
+                                          self.version_info[1]))
+        if options and options.get('gui', False):
+            ext = 'pyw'
+        else:
+            ext = 'py'
+        self._write_script(scriptnames, shebang, script, filenames, ext)
+
+    def _copy_script(self, script, filenames):
+        adjust = False
+        script = os.path.join(self.source_dir, convert_path(script))
+        outname = os.path.join(self.target_dir, os.path.basename(script))
+        if not self.force and not self._fileop.newer(script, outname):
+            logger.debug('not copying %s (up-to-date)', script)
+            return
+
+        # Always open the file, but ignore failures in dry-run mode --
+        # that way, we'll get accurate feedback if we can read the
+        # script.
+        try:
+            f = open(script, 'rb')
+        except IOError:  # pragma: no cover
+            if not self.dry_run:
+                raise
+            f = None
+        else:
+            first_line = f.readline()
+            if not first_line:  # pragma: no cover
+                logger.warning('%s: %s is an empty file (skipping)',
+                               self.get_command_name(),  script)
+                return
+
+            match = FIRST_LINE_RE.match(first_line.replace(b'\r\n', b'\n'))
+            if match:
+                adjust = True
+                post_interp = match.group(1) or b''
+
+        if not adjust:
+            if f:
+                f.close()
+            self._fileop.copy_file(script, outname)
+            if self.set_mode:
+                self._fileop.set_executable_mode([outname])
+            filenames.append(outname)
+        else:
+            logger.info('copying and adjusting %s -> %s', script,
+                        self.target_dir)
+            if not self._fileop.dry_run:
+                encoding, lines = detect_encoding(f.readline)
+                f.seek(0)
+                shebang = self._get_shebang(encoding, post_interp)
+                if b'pythonw' in first_line:  # pragma: no cover
+                    ext = 'pyw'
+                else:
+                    ext = 'py'
+                n = os.path.basename(outname)
+                self._write_script([n], shebang, f.read(), filenames, ext)
+            if f:
+                f.close()
+
+    @property
+    def dry_run(self):
+        return self._fileop.dry_run
+
+    @dry_run.setter
+    def dry_run(self, value):
+        self._fileop.dry_run = value
+
+    if os.name == 'nt' or (os.name == 'java' and os._name == 'nt'):  # pragma: no cover
+        # Executable launcher support.
+        # Launchers are from https://bitbucket.org/vinay.sajip/simple_launcher/
+
+        def _get_launcher(self, kind):
+            if struct.calcsize('P') == 8:   # 64-bit
+                bits = '64'
+            else:
+                bits = '32'
+            name = '%s%s.exe' % (kind, bits)
+            # Issue 31: don't hardcode an absolute package name, but
+            # determine it relative to the current package
+            distlib_package = __name__.rsplit('.', 1)[0]
+            resource = finder(distlib_package).find(name)
+            if not resource:
+                msg = ('Unable to find resource %s in package %s' % (name,
+                       distlib_package))
+                raise ValueError(msg)
+            return resource.bytes
+
+    # Public API follows
+
+    def make(self, specification, options=None):
+        """
+        Make a script.
+
+        :param specification: The specification, which is either a valid export
+                              entry specification (to make a script from a
+                              callable) or a filename (to make a script by
+                              copying from a source location).
+        :param options: A dictionary of options controlling script generation.
+        :return: A list of all absolute pathnames written to.
+        """
+        filenames = []
+        entry = get_export_entry(specification)
+        if entry is None:
+            self._copy_script(specification, filenames)
+        else:
+            self._make_script(entry, filenames, options=options)
+        return filenames
+
+    def make_multiple(self, specifications, options=None):
+        """
+        Take a list of specifications and make scripts from them,
+        :param specifications: A list of specifications.
+        :return: A list of all absolute pathnames written to,
+        """
+        filenames = []
+        for specification in specifications:
+            filenames.extend(self.make(specification, options))
+        return filenames
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/t32.exe b/venv/Lib/site-packages/pip/_vendor/distlib/t32.exe
new file mode 100644
index 000000000..8932a18e4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/t32.exe differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/t64.exe b/venv/Lib/site-packages/pip/_vendor/distlib/t64.exe
new file mode 100644
index 000000000..325b8057c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/t64.exe differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/util.py b/venv/Lib/site-packages/pip/_vendor/distlib/util.py
new file mode 100644
index 000000000..01324eae4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/util.py
@@ -0,0 +1,1761 @@
+#
+# Copyright (C) 2012-2017 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+import codecs
+from collections import deque
+import contextlib
+import csv
+from glob import iglob as std_iglob
+import io
+import json
+import logging
+import os
+import py_compile
+import re
+import socket
+try:
+    import ssl
+except ImportError:  # pragma: no cover
+    ssl = None
+import subprocess
+import sys
+import tarfile
+import tempfile
+import textwrap
+
+try:
+    import threading
+except ImportError:  # pragma: no cover
+    import dummy_threading as threading
+import time
+
+from . import DistlibException
+from .compat import (string_types, text_type, shutil, raw_input, StringIO,
+                     cache_from_source, urlopen, urljoin, httplib, xmlrpclib,
+                     splittype, HTTPHandler, BaseConfigurator, valid_ident,
+                     Container, configparser, URLError, ZipFile, fsdecode,
+                     unquote, urlparse)
+
+logger = logging.getLogger(__name__)
+
+#
+# Requirement parsing code as per PEP 508
+#
+
+IDENTIFIER = re.compile(r'^([\w\.-]+)\s*')
+VERSION_IDENTIFIER = re.compile(r'^([\w\.*+-]+)\s*')
+COMPARE_OP = re.compile(r'^(<=?|>=?|={2,3}|[~!]=)\s*')
+MARKER_OP = re.compile(r'^((<=?)|(>=?)|={2,3}|[~!]=|in|not\s+in)\s*')
+OR = re.compile(r'^or\b\s*')
+AND = re.compile(r'^and\b\s*')
+NON_SPACE = re.compile(r'(\S+)\s*')
+STRING_CHUNK = re.compile(r'([\s\w\.{}()*+#:;,/?!~`@$%^&=|<>\[\]-]+)')
+
+
+def parse_marker(marker_string):
+    """
+    Parse a marker string and return a dictionary containing a marker expression.
+
+    The dictionary will contain keys "op", "lhs" and "rhs" for non-terminals in
+    the expression grammar, or strings. A string contained in quotes is to be
+    interpreted as a literal string, and a string not contained in quotes is a
+    variable (such as os_name).
+    """
+    def marker_var(remaining):
+        # either identifier, or literal string
+        m = IDENTIFIER.match(remaining)
+        if m:
+            result = m.groups()[0]
+            remaining = remaining[m.end():]
+        elif not remaining:
+            raise SyntaxError('unexpected end of input')
+        else:
+            q = remaining[0]
+            if q not in '\'"':
+                raise SyntaxError('invalid expression: %s' % remaining)
+            oq = '\'"'.replace(q, '')
+            remaining = remaining[1:]
+            parts = [q]
+            while remaining:
+                # either a string chunk, or oq, or q to terminate
+                if remaining[0] == q:
+                    break
+                elif remaining[0] == oq:
+                    parts.append(oq)
+                    remaining = remaining[1:]
+                else:
+                    m = STRING_CHUNK.match(remaining)
+                    if not m:
+                        raise SyntaxError('error in string literal: %s' % remaining)
+                    parts.append(m.groups()[0])
+                    remaining = remaining[m.end():]
+            else:
+                s = ''.join(parts)
+                raise SyntaxError('unterminated string: %s' % s)
+            parts.append(q)
+            result = ''.join(parts)
+            remaining = remaining[1:].lstrip() # skip past closing quote
+        return result, remaining
+
+    def marker_expr(remaining):
+        if remaining and remaining[0] == '(':
+            result, remaining = marker(remaining[1:].lstrip())
+            if remaining[0] != ')':
+                raise SyntaxError('unterminated parenthesis: %s' % remaining)
+            remaining = remaining[1:].lstrip()
+        else:
+            lhs, remaining = marker_var(remaining)
+            while remaining:
+                m = MARKER_OP.match(remaining)
+                if not m:
+                    break
+                op = m.groups()[0]
+                remaining = remaining[m.end():]
+                rhs, remaining = marker_var(remaining)
+                lhs = {'op': op, 'lhs': lhs, 'rhs': rhs}
+            result = lhs
+        return result, remaining
+
+    def marker_and(remaining):
+        lhs, remaining = marker_expr(remaining)
+        while remaining:
+            m = AND.match(remaining)
+            if not m:
+                break
+            remaining = remaining[m.end():]
+            rhs, remaining = marker_expr(remaining)
+            lhs = {'op': 'and', 'lhs': lhs, 'rhs': rhs}
+        return lhs, remaining
+
+    def marker(remaining):
+        lhs, remaining = marker_and(remaining)
+        while remaining:
+            m = OR.match(remaining)
+            if not m:
+                break
+            remaining = remaining[m.end():]
+            rhs, remaining = marker_and(remaining)
+            lhs = {'op': 'or', 'lhs': lhs, 'rhs': rhs}
+        return lhs, remaining
+
+    return marker(marker_string)
+
+
+def parse_requirement(req):
+    """
+    Parse a requirement passed in as a string. Return a Container
+    whose attributes contain the various parts of the requirement.
+    """
+    remaining = req.strip()
+    if not remaining or remaining.startswith('#'):
+        return None
+    m = IDENTIFIER.match(remaining)
+    if not m:
+        raise SyntaxError('name expected: %s' % remaining)
+    distname = m.groups()[0]
+    remaining = remaining[m.end():]
+    extras = mark_expr = versions = uri = None
+    if remaining and remaining[0] == '[':
+        i = remaining.find(']', 1)
+        if i < 0:
+            raise SyntaxError('unterminated extra: %s' % remaining)
+        s = remaining[1:i]
+        remaining = remaining[i + 1:].lstrip()
+        extras = []
+        while s:
+            m = IDENTIFIER.match(s)
+            if not m:
+                raise SyntaxError('malformed extra: %s' % s)
+            extras.append(m.groups()[0])
+            s = s[m.end():]
+            if not s:
+                break
+            if s[0] != ',':
+                raise SyntaxError('comma expected in extras: %s' % s)
+            s = s[1:].lstrip()
+        if not extras:
+            extras = None
+    if remaining:
+        if remaining[0] == '@':
+            # it's a URI
+            remaining = remaining[1:].lstrip()
+            m = NON_SPACE.match(remaining)
+            if not m:
+                raise SyntaxError('invalid URI: %s' % remaining)
+            uri = m.groups()[0]
+            t = urlparse(uri)
+            # there are issues with Python and URL parsing, so this test
+            # is a bit crude. See bpo-20271, bpo-23505. Python doesn't
+            # always parse invalid URLs correctly - it should raise
+            # exceptions for malformed URLs
+            if not (t.scheme and t.netloc):
+                raise SyntaxError('Invalid URL: %s' % uri)
+            remaining = remaining[m.end():].lstrip()
+        else:
+
+            def get_versions(ver_remaining):
+                """
+                Return a list of operator, version tuples if any are
+                specified, else None.
+                """
+                m = COMPARE_OP.match(ver_remaining)
+                versions = None
+                if m:
+                    versions = []
+                    while True:
+                        op = m.groups()[0]
+                        ver_remaining = ver_remaining[m.end():]
+                        m = VERSION_IDENTIFIER.match(ver_remaining)
+                        if not m:
+                            raise SyntaxError('invalid version: %s' % ver_remaining)
+                        v = m.groups()[0]
+                        versions.append((op, v))
+                        ver_remaining = ver_remaining[m.end():]
+                        if not ver_remaining or ver_remaining[0] != ',':
+                            break
+                        ver_remaining = ver_remaining[1:].lstrip()
+                        m = COMPARE_OP.match(ver_remaining)
+                        if not m:
+                            raise SyntaxError('invalid constraint: %s' % ver_remaining)
+                    if not versions:
+                        versions = None
+                return versions, ver_remaining
+
+            if remaining[0] != '(':
+                versions, remaining = get_versions(remaining)
+            else:
+                i = remaining.find(')', 1)
+                if i < 0:
+                    raise SyntaxError('unterminated parenthesis: %s' % remaining)
+                s = remaining[1:i]
+                remaining = remaining[i + 1:].lstrip()
+                # As a special diversion from PEP 508, allow a version number
+                # a.b.c in parentheses as a synonym for ~= a.b.c (because this
+                # is allowed in earlier PEPs)
+                if COMPARE_OP.match(s):
+                    versions, _ = get_versions(s)
+                else:
+                    m = VERSION_IDENTIFIER.match(s)
+                    if not m:
+                        raise SyntaxError('invalid constraint: %s' % s)
+                    v = m.groups()[0]
+                    s = s[m.end():].lstrip()
+                    if s:
+                        raise SyntaxError('invalid constraint: %s' % s)
+                    versions = [('~=', v)]
+
+    if remaining:
+        if remaining[0] != ';':
+            raise SyntaxError('invalid requirement: %s' % remaining)
+        remaining = remaining[1:].lstrip()
+
+        mark_expr, remaining = parse_marker(remaining)
+
+    if remaining and remaining[0] != '#':
+        raise SyntaxError('unexpected trailing data: %s' % remaining)
+
+    if not versions:
+        rs = distname
+    else:
+        rs = '%s %s' % (distname, ', '.join(['%s %s' % con for con in versions]))
+    return Container(name=distname, extras=extras, constraints=versions,
+                     marker=mark_expr, url=uri, requirement=rs)
+
+
+def get_resources_dests(resources_root, rules):
+    """Find destinations for resources files"""
+
+    def get_rel_path(root, path):
+        # normalizes and returns a lstripped-/-separated path
+        root = root.replace(os.path.sep, '/')
+        path = path.replace(os.path.sep, '/')
+        assert path.startswith(root)
+        return path[len(root):].lstrip('/')
+
+    destinations = {}
+    for base, suffix, dest in rules:
+        prefix = os.path.join(resources_root, base)
+        for abs_base in iglob(prefix):
+            abs_glob = os.path.join(abs_base, suffix)
+            for abs_path in iglob(abs_glob):
+                resource_file = get_rel_path(resources_root, abs_path)
+                if dest is None:  # remove the entry if it was here
+                    destinations.pop(resource_file, None)
+                else:
+                    rel_path = get_rel_path(abs_base, abs_path)
+                    rel_dest = dest.replace(os.path.sep, '/').rstrip('/')
+                    destinations[resource_file] = rel_dest + '/' + rel_path
+    return destinations
+
+
+def in_venv():
+    if hasattr(sys, 'real_prefix'):
+        # virtualenv venvs
+        result = True
+    else:
+        # PEP 405 venvs
+        result = sys.prefix != getattr(sys, 'base_prefix', sys.prefix)
+    return result
+
+
+def get_executable():
+# The __PYVENV_LAUNCHER__ dance is apparently no longer needed, as
+# changes to the stub launcher mean that sys.executable always points
+# to the stub on OS X
+#    if sys.platform == 'darwin' and ('__PYVENV_LAUNCHER__'
+#                                     in os.environ):
+#        result =  os.environ['__PYVENV_LAUNCHER__']
+#    else:
+#        result = sys.executable
+#    return result
+    result = os.path.normcase(sys.executable)
+    if not isinstance(result, text_type):
+        result = fsdecode(result)
+    return result
+
+
+def proceed(prompt, allowed_chars, error_prompt=None, default=None):
+    p = prompt
+    while True:
+        s = raw_input(p)
+        p = prompt
+        if not s and default:
+            s = default
+        if s:
+            c = s[0].lower()
+            if c in allowed_chars:
+                break
+            if error_prompt:
+                p = '%c: %s\n%s' % (c, error_prompt, prompt)
+    return c
+
+
+def extract_by_key(d, keys):
+    if isinstance(keys, string_types):
+        keys = keys.split()
+    result = {}
+    for key in keys:
+        if key in d:
+            result[key] = d[key]
+    return result
+
+def read_exports(stream):
+    if sys.version_info[0] >= 3:
+        # needs to be a text stream
+        stream = codecs.getreader('utf-8')(stream)
+    # Try to load as JSON, falling back on legacy format
+    data = stream.read()
+    stream = StringIO(data)
+    try:
+        jdata = json.load(stream)
+        result = jdata['extensions']['python.exports']['exports']
+        for group, entries in result.items():
+            for k, v in entries.items():
+                s = '%s = %s' % (k, v)
+                entry = get_export_entry(s)
+                assert entry is not None
+                entries[k] = entry
+        return result
+    except Exception:
+        stream.seek(0, 0)
+
+    def read_stream(cp, stream):
+        if hasattr(cp, 'read_file'):
+            cp.read_file(stream)
+        else:
+            cp.readfp(stream)
+
+    cp = configparser.ConfigParser()
+    try:
+        read_stream(cp, stream)
+    except configparser.MissingSectionHeaderError:
+        stream.close()
+        data = textwrap.dedent(data)
+        stream = StringIO(data)
+        read_stream(cp, stream)
+
+    result = {}
+    for key in cp.sections():
+        result[key] = entries = {}
+        for name, value in cp.items(key):
+            s = '%s = %s' % (name, value)
+            entry = get_export_entry(s)
+            assert entry is not None
+            #entry.dist = self
+            entries[name] = entry
+    return result
+
+
+def write_exports(exports, stream):
+    if sys.version_info[0] >= 3:
+        # needs to be a text stream
+        stream = codecs.getwriter('utf-8')(stream)
+    cp = configparser.ConfigParser()
+    for k, v in exports.items():
+        # TODO check k, v for valid values
+        cp.add_section(k)
+        for entry in v.values():
+            if entry.suffix is None:
+                s = entry.prefix
+            else:
+                s = '%s:%s' % (entry.prefix, entry.suffix)
+            if entry.flags:
+                s = '%s [%s]' % (s, ', '.join(entry.flags))
+            cp.set(k, entry.name, s)
+    cp.write(stream)
+
+
+@contextlib.contextmanager
+def tempdir():
+    td = tempfile.mkdtemp()
+    try:
+        yield td
+    finally:
+        shutil.rmtree(td)
+
+@contextlib.contextmanager
+def chdir(d):
+    cwd = os.getcwd()
+    try:
+        os.chdir(d)
+        yield
+    finally:
+        os.chdir(cwd)
+
+
+@contextlib.contextmanager
+def socket_timeout(seconds=15):
+    cto = socket.getdefaulttimeout()
+    try:
+        socket.setdefaulttimeout(seconds)
+        yield
+    finally:
+        socket.setdefaulttimeout(cto)
+
+
+class cached_property(object):
+    def __init__(self, func):
+        self.func = func
+        #for attr in ('__name__', '__module__', '__doc__'):
+        #    setattr(self, attr, getattr(func, attr, None))
+
+    def __get__(self, obj, cls=None):
+        if obj is None:
+            return self
+        value = self.func(obj)
+        object.__setattr__(obj, self.func.__name__, value)
+        #obj.__dict__[self.func.__name__] = value = self.func(obj)
+        return value
+
+def convert_path(pathname):
+    """Return 'pathname' as a name that will work on the native filesystem.
+
+    The path is split on '/' and put back together again using the current
+    directory separator.  Needed because filenames in the setup script are
+    always supplied in Unix style, and have to be converted to the local
+    convention before we can actually use them in the filesystem.  Raises
+    ValueError on non-Unix-ish systems if 'pathname' either starts or
+    ends with a slash.
+    """
+    if os.sep == '/':
+        return pathname
+    if not pathname:
+        return pathname
+    if pathname[0] == '/':
+        raise ValueError("path '%s' cannot be absolute" % pathname)
+    if pathname[-1] == '/':
+        raise ValueError("path '%s' cannot end with '/'" % pathname)
+
+    paths = pathname.split('/')
+    while os.curdir in paths:
+        paths.remove(os.curdir)
+    if not paths:
+        return os.curdir
+    return os.path.join(*paths)
+
+
+class FileOperator(object):
+    def __init__(self, dry_run=False):
+        self.dry_run = dry_run
+        self.ensured = set()
+        self._init_record()
+
+    def _init_record(self):
+        self.record = False
+        self.files_written = set()
+        self.dirs_created = set()
+
+    def record_as_written(self, path):
+        if self.record:
+            self.files_written.add(path)
+
+    def newer(self, source, target):
+        """Tell if the target is newer than the source.
+
+        Returns true if 'source' exists and is more recently modified than
+        'target', or if 'source' exists and 'target' doesn't.
+
+        Returns false if both exist and 'target' is the same age or younger
+        than 'source'. Raise PackagingFileError if 'source' does not exist.
+
+        Note that this test is not very accurate: files created in the same
+        second will have the same "age".
+        """
+        if not os.path.exists(source):
+            raise DistlibException("file '%r' does not exist" %
+                                   os.path.abspath(source))
+        if not os.path.exists(target):
+            return True
+
+        return os.stat(source).st_mtime > os.stat(target).st_mtime
+
+    def copy_file(self, infile, outfile, check=True):
+        """Copy a file respecting dry-run and force flags.
+        """
+        self.ensure_dir(os.path.dirname(outfile))
+        logger.info('Copying %s to %s', infile, outfile)
+        if not self.dry_run:
+            msg = None
+            if check:
+                if os.path.islink(outfile):
+                    msg = '%s is a symlink' % outfile
+                elif os.path.exists(outfile) and not os.path.isfile(outfile):
+                    msg = '%s is a non-regular file' % outfile
+            if msg:
+                raise ValueError(msg + ' which would be overwritten')
+            shutil.copyfile(infile, outfile)
+        self.record_as_written(outfile)
+
+    def copy_stream(self, instream, outfile, encoding=None):
+        assert not os.path.isdir(outfile)
+        self.ensure_dir(os.path.dirname(outfile))
+        logger.info('Copying stream %s to %s', instream, outfile)
+        if not self.dry_run:
+            if encoding is None:
+                outstream = open(outfile, 'wb')
+            else:
+                outstream = codecs.open(outfile, 'w', encoding=encoding)
+            try:
+                shutil.copyfileobj(instream, outstream)
+            finally:
+                outstream.close()
+        self.record_as_written(outfile)
+
+    def write_binary_file(self, path, data):
+        self.ensure_dir(os.path.dirname(path))
+        if not self.dry_run:
+            if os.path.exists(path):
+                os.remove(path)
+            with open(path, 'wb') as f:
+                f.write(data)
+        self.record_as_written(path)
+
+    def write_text_file(self, path, data, encoding):
+        self.write_binary_file(path, data.encode(encoding))
+
+    def set_mode(self, bits, mask, files):
+        if os.name == 'posix' or (os.name == 'java' and os._name == 'posix'):
+            # Set the executable bits (owner, group, and world) on
+            # all the files specified.
+            for f in files:
+                if self.dry_run:
+                    logger.info("changing mode of %s", f)
+                else:
+                    mode = (os.stat(f).st_mode | bits) & mask
+                    logger.info("changing mode of %s to %o", f, mode)
+                    os.chmod(f, mode)
+
+    set_executable_mode = lambda s, f: s.set_mode(0o555, 0o7777, f)
+
+    def ensure_dir(self, path):
+        path = os.path.abspath(path)
+        if path not in self.ensured and not os.path.exists(path):
+            self.ensured.add(path)
+            d, f = os.path.split(path)
+            self.ensure_dir(d)
+            logger.info('Creating %s' % path)
+            if not self.dry_run:
+                os.mkdir(path)
+            if self.record:
+                self.dirs_created.add(path)
+
+    def byte_compile(self, path, optimize=False, force=False, prefix=None, hashed_invalidation=False):
+        dpath = cache_from_source(path, not optimize)
+        logger.info('Byte-compiling %s to %s', path, dpath)
+        if not self.dry_run:
+            if force or self.newer(path, dpath):
+                if not prefix:
+                    diagpath = None
+                else:
+                    assert path.startswith(prefix)
+                    diagpath = path[len(prefix):]
+            compile_kwargs = {}
+            if hashed_invalidation and hasattr(py_compile, 'PycInvalidationMode'):
+                compile_kwargs['invalidation_mode'] = py_compile.PycInvalidationMode.CHECKED_HASH
+            py_compile.compile(path, dpath, diagpath, True, **compile_kwargs)     # raise error
+        self.record_as_written(dpath)
+        return dpath
+
+    def ensure_removed(self, path):
+        if os.path.exists(path):
+            if os.path.isdir(path) and not os.path.islink(path):
+                logger.debug('Removing directory tree at %s', path)
+                if not self.dry_run:
+                    shutil.rmtree(path)
+                if self.record:
+                    if path in self.dirs_created:
+                        self.dirs_created.remove(path)
+            else:
+                if os.path.islink(path):
+                    s = 'link'
+                else:
+                    s = 'file'
+                logger.debug('Removing %s %s', s, path)
+                if not self.dry_run:
+                    os.remove(path)
+                if self.record:
+                    if path in self.files_written:
+                        self.files_written.remove(path)
+
+    def is_writable(self, path):
+        result = False
+        while not result:
+            if os.path.exists(path):
+                result = os.access(path, os.W_OK)
+                break
+            parent = os.path.dirname(path)
+            if parent == path:
+                break
+            path = parent
+        return result
+
+    def commit(self):
+        """
+        Commit recorded changes, turn off recording, return
+        changes.
+        """
+        assert self.record
+        result = self.files_written, self.dirs_created
+        self._init_record()
+        return result
+
+    def rollback(self):
+        if not self.dry_run:
+            for f in list(self.files_written):
+                if os.path.exists(f):
+                    os.remove(f)
+            # dirs should all be empty now, except perhaps for
+            # __pycache__ subdirs
+            # reverse so that subdirs appear before their parents
+            dirs = sorted(self.dirs_created, reverse=True)
+            for d in dirs:
+                flist = os.listdir(d)
+                if flist:
+                    assert flist == ['__pycache__']
+                    sd = os.path.join(d, flist[0])
+                    os.rmdir(sd)
+                os.rmdir(d)     # should fail if non-empty
+        self._init_record()
+
+def resolve(module_name, dotted_path):
+    if module_name in sys.modules:
+        mod = sys.modules[module_name]
+    else:
+        mod = __import__(module_name)
+    if dotted_path is None:
+        result = mod
+    else:
+        parts = dotted_path.split('.')
+        result = getattr(mod, parts.pop(0))
+        for p in parts:
+            result = getattr(result, p)
+    return result
+
+
+class ExportEntry(object):
+    def __init__(self, name, prefix, suffix, flags):
+        self.name = name
+        self.prefix = prefix
+        self.suffix = suffix
+        self.flags = flags
+
+    @cached_property
+    def value(self):
+        return resolve(self.prefix, self.suffix)
+
+    def __repr__(self):  # pragma: no cover
+        return '<ExportEntry %s = %s:%s %s>' % (self.name, self.prefix,
+                                                self.suffix, self.flags)
+
+    def __eq__(self, other):
+        if not isinstance(other, ExportEntry):
+            result = False
+        else:
+            result = (self.name == other.name and
+                      self.prefix == other.prefix and
+                      self.suffix == other.suffix and
+                      self.flags == other.flags)
+        return result
+
+    __hash__ = object.__hash__
+
+
+ENTRY_RE = re.compile(r'''(?P<name>(\w|[-.+])+)
+                      \s*=\s*(?P<callable>(\w+)([:\.]\w+)*)
+                      \s*(\[\s*(?P<flags>[\w-]+(=\w+)?(,\s*\w+(=\w+)?)*)\s*\])?
+                      ''', re.VERBOSE)
+
+def get_export_entry(specification):
+    m = ENTRY_RE.search(specification)
+    if not m:
+        result = None
+        if '[' in specification or ']' in specification:
+            raise DistlibException("Invalid specification "
+                                   "'%s'" % specification)
+    else:
+        d = m.groupdict()
+        name = d['name']
+        path = d['callable']
+        colons = path.count(':')
+        if colons == 0:
+            prefix, suffix = path, None
+        else:
+            if colons != 1:
+                raise DistlibException("Invalid specification "
+                                       "'%s'" % specification)
+            prefix, suffix = path.split(':')
+        flags = d['flags']
+        if flags is None:
+            if '[' in specification or ']' in specification:
+                raise DistlibException("Invalid specification "
+                                       "'%s'" % specification)
+            flags = []
+        else:
+            flags = [f.strip() for f in flags.split(',')]
+        result = ExportEntry(name, prefix, suffix, flags)
+    return result
+
+
+def get_cache_base(suffix=None):
+    """
+    Return the default base location for distlib caches. If the directory does
+    not exist, it is created. Use the suffix provided for the base directory,
+    and default to '.distlib' if it isn't provided.
+
+    On Windows, if LOCALAPPDATA is defined in the environment, then it is
+    assumed to be a directory, and will be the parent directory of the result.
+    On POSIX, and on Windows if LOCALAPPDATA is not defined, the user's home
+    directory - using os.expanduser('~') - will be the parent directory of
+    the result.
+
+    The result is just the directory '.distlib' in the parent directory as
+    determined above, or with the name specified with ``suffix``.
+    """
+    if suffix is None:
+        suffix = '.distlib'
+    if os.name == 'nt' and 'LOCALAPPDATA' in os.environ:
+        result = os.path.expandvars('$localappdata')
+    else:
+        # Assume posix, or old Windows
+        result = os.path.expanduser('~')
+    # we use 'isdir' instead of 'exists', because we want to
+    # fail if there's a file with that name
+    if os.path.isdir(result):
+        usable = os.access(result, os.W_OK)
+        if not usable:
+            logger.warning('Directory exists but is not writable: %s', result)
+    else:
+        try:
+            os.makedirs(result)
+            usable = True
+        except OSError:
+            logger.warning('Unable to create %s', result, exc_info=True)
+            usable = False
+    if not usable:
+        result = tempfile.mkdtemp()
+        logger.warning('Default location unusable, using %s', result)
+    return os.path.join(result, suffix)
+
+
+def path_to_cache_dir(path):
+    """
+    Convert an absolute path to a directory name for use in a cache.
+
+    The algorithm used is:
+
+    #. On Windows, any ``':'`` in the drive is replaced with ``'---'``.
+    #. Any occurrence of ``os.sep`` is replaced with ``'--'``.
+    #. ``'.cache'`` is appended.
+    """
+    d, p = os.path.splitdrive(os.path.abspath(path))
+    if d:
+        d = d.replace(':', '---')
+    p = p.replace(os.sep, '--')
+    return d + p + '.cache'
+
+
+def ensure_slash(s):
+    if not s.endswith('/'):
+        return s + '/'
+    return s
+
+
+def parse_credentials(netloc):
+    username = password = None
+    if '@' in netloc:
+        prefix, netloc = netloc.rsplit('@', 1)
+        if ':' not in prefix:
+            username = prefix
+        else:
+            username, password = prefix.split(':', 1)
+    if username:
+        username = unquote(username)
+    if password:
+        password = unquote(password)
+    return username, password, netloc
+
+
+def get_process_umask():
+    result = os.umask(0o22)
+    os.umask(result)
+    return result
+
+def is_string_sequence(seq):
+    result = True
+    i = None
+    for i, s in enumerate(seq):
+        if not isinstance(s, string_types):
+            result = False
+            break
+    assert i is not None
+    return result
+
+PROJECT_NAME_AND_VERSION = re.compile('([a-z0-9_]+([.-][a-z_][a-z0-9_]*)*)-'
+                                      '([a-z0-9_.+-]+)', re.I)
+PYTHON_VERSION = re.compile(r'-py(\d\.?\d?)')
+
+
+def split_filename(filename, project_name=None):
+    """
+    Extract name, version, python version from a filename (no extension)
+
+    Return name, version, pyver or None
+    """
+    result = None
+    pyver = None
+    filename = unquote(filename).replace(' ', '-')
+    m = PYTHON_VERSION.search(filename)
+    if m:
+        pyver = m.group(1)
+        filename = filename[:m.start()]
+    if project_name and len(filename) > len(project_name) + 1:
+        m = re.match(re.escape(project_name) + r'\b', filename)
+        if m:
+            n = m.end()
+            result = filename[:n], filename[n + 1:], pyver
+    if result is None:
+        m = PROJECT_NAME_AND_VERSION.match(filename)
+        if m:
+            result = m.group(1), m.group(3), pyver
+    return result
+
+# Allow spaces in name because of legacy dists like "Twisted Core"
+NAME_VERSION_RE = re.compile(r'(?P<name>[\w .-]+)\s*'
+                             r'\(\s*(?P<ver>[^\s)]+)\)$')
+
+def parse_name_and_version(p):
+    """
+    A utility method used to get name and version from a string.
+
+    From e.g. a Provides-Dist value.
+
+    :param p: A value in a form 'foo (1.0)'
+    :return: The name and version as a tuple.
+    """
+    m = NAME_VERSION_RE.match(p)
+    if not m:
+        raise DistlibException('Ill-formed name/version string: \'%s\'' % p)
+    d = m.groupdict()
+    return d['name'].strip().lower(), d['ver']
+
+def get_extras(requested, available):
+    result = set()
+    requested = set(requested or [])
+    available = set(available or [])
+    if '*' in requested:
+        requested.remove('*')
+        result |= available
+    for r in requested:
+        if r == '-':
+            result.add(r)
+        elif r.startswith('-'):
+            unwanted = r[1:]
+            if unwanted not in available:
+                logger.warning('undeclared extra: %s' % unwanted)
+            if unwanted in result:
+                result.remove(unwanted)
+        else:
+            if r not in available:
+                logger.warning('undeclared extra: %s' % r)
+            result.add(r)
+    return result
+#
+# Extended metadata functionality
+#
+
+def _get_external_data(url):
+    result = {}
+    try:
+        # urlopen might fail if it runs into redirections,
+        # because of Python issue #13696. Fixed in locators
+        # using a custom redirect handler.
+        resp = urlopen(url)
+        headers = resp.info()
+        ct = headers.get('Content-Type')
+        if not ct.startswith('application/json'):
+            logger.debug('Unexpected response for JSON request: %s', ct)
+        else:
+            reader = codecs.getreader('utf-8')(resp)
+            #data = reader.read().decode('utf-8')
+            #result = json.loads(data)
+            result = json.load(reader)
+    except Exception as e:
+        logger.exception('Failed to get external data for %s: %s', url, e)
+    return result
+
+_external_data_base_url = 'https://www.red-dove.com/pypi/projects/'
+
+def get_project_data(name):
+    url = '%s/%s/project.json' % (name[0].upper(), name)
+    url = urljoin(_external_data_base_url, url)
+    result = _get_external_data(url)
+    return result
+
+def get_package_data(name, version):
+    url = '%s/%s/package-%s.json' % (name[0].upper(), name, version)
+    url = urljoin(_external_data_base_url, url)
+    return _get_external_data(url)
+
+
+class Cache(object):
+    """
+    A class implementing a cache for resources that need to live in the file system
+    e.g. shared libraries. This class was moved from resources to here because it
+    could be used by other modules, e.g. the wheel module.
+    """
+
+    def __init__(self, base):
+        """
+        Initialise an instance.
+
+        :param base: The base directory where the cache should be located.
+        """
+        # we use 'isdir' instead of 'exists', because we want to
+        # fail if there's a file with that name
+        if not os.path.isdir(base):  # pragma: no cover
+            os.makedirs(base)
+        if (os.stat(base).st_mode & 0o77) != 0:
+            logger.warning('Directory \'%s\' is not private', base)
+        self.base = os.path.abspath(os.path.normpath(base))
+
+    def prefix_to_dir(self, prefix):
+        """
+        Converts a resource prefix to a directory name in the cache.
+        """
+        return path_to_cache_dir(prefix)
+
+    def clear(self):
+        """
+        Clear the cache.
+        """
+        not_removed = []
+        for fn in os.listdir(self.base):
+            fn = os.path.join(self.base, fn)
+            try:
+                if os.path.islink(fn) or os.path.isfile(fn):
+                    os.remove(fn)
+                elif os.path.isdir(fn):
+                    shutil.rmtree(fn)
+            except Exception:
+                not_removed.append(fn)
+        return not_removed
+
+
+class EventMixin(object):
+    """
+    A very simple publish/subscribe system.
+    """
+    def __init__(self):
+        self._subscribers = {}
+
+    def add(self, event, subscriber, append=True):
+        """
+        Add a subscriber for an event.
+
+        :param event: The name of an event.
+        :param subscriber: The subscriber to be added (and called when the
+                           event is published).
+        :param append: Whether to append or prepend the subscriber to an
+                       existing subscriber list for the event.
+        """
+        subs = self._subscribers
+        if event not in subs:
+            subs[event] = deque([subscriber])
+        else:
+            sq = subs[event]
+            if append:
+                sq.append(subscriber)
+            else:
+                sq.appendleft(subscriber)
+
+    def remove(self, event, subscriber):
+        """
+        Remove a subscriber for an event.
+
+        :param event: The name of an event.
+        :param subscriber: The subscriber to be removed.
+        """
+        subs = self._subscribers
+        if event not in subs:
+            raise ValueError('No subscribers: %r' % event)
+        subs[event].remove(subscriber)
+
+    def get_subscribers(self, event):
+        """
+        Return an iterator for the subscribers for an event.
+        :param event: The event to return subscribers for.
+        """
+        return iter(self._subscribers.get(event, ()))
+
+    def publish(self, event, *args, **kwargs):
+        """
+        Publish a event and return a list of values returned by its
+        subscribers.
+
+        :param event: The event to publish.
+        :param args: The positional arguments to pass to the event's
+                     subscribers.
+        :param kwargs: The keyword arguments to pass to the event's
+                       subscribers.
+        """
+        result = []
+        for subscriber in self.get_subscribers(event):
+            try:
+                value = subscriber(event, *args, **kwargs)
+            except Exception:
+                logger.exception('Exception during event publication')
+                value = None
+            result.append(value)
+        logger.debug('publish %s: args = %s, kwargs = %s, result = %s',
+                     event, args, kwargs, result)
+        return result
+
+#
+# Simple sequencing
+#
+class Sequencer(object):
+    def __init__(self):
+        self._preds = {}
+        self._succs = {}
+        self._nodes = set()     # nodes with no preds/succs
+
+    def add_node(self, node):
+        self._nodes.add(node)
+
+    def remove_node(self, node, edges=False):
+        if node in self._nodes:
+            self._nodes.remove(node)
+        if edges:
+            for p in set(self._preds.get(node, ())):
+                self.remove(p, node)
+            for s in set(self._succs.get(node, ())):
+                self.remove(node, s)
+            # Remove empties
+            for k, v in list(self._preds.items()):
+                if not v:
+                    del self._preds[k]
+            for k, v in list(self._succs.items()):
+                if not v:
+                    del self._succs[k]
+
+    def add(self, pred, succ):
+        assert pred != succ
+        self._preds.setdefault(succ, set()).add(pred)
+        self._succs.setdefault(pred, set()).add(succ)
+
+    def remove(self, pred, succ):
+        assert pred != succ
+        try:
+            preds = self._preds[succ]
+            succs = self._succs[pred]
+        except KeyError:  # pragma: no cover
+            raise ValueError('%r not a successor of anything' % succ)
+        try:
+            preds.remove(pred)
+            succs.remove(succ)
+        except KeyError:  # pragma: no cover
+            raise ValueError('%r not a successor of %r' % (succ, pred))
+
+    def is_step(self, step):
+        return (step in self._preds or step in self._succs or
+                step in self._nodes)
+
+    def get_steps(self, final):
+        if not self.is_step(final):
+            raise ValueError('Unknown: %r' % final)
+        result = []
+        todo = []
+        seen = set()
+        todo.append(final)
+        while todo:
+            step = todo.pop(0)
+            if step in seen:
+                # if a step was already seen,
+                # move it to the end (so it will appear earlier
+                # when reversed on return) ... but not for the
+                # final step, as that would be confusing for
+                # users
+                if step != final:
+                    result.remove(step)
+                    result.append(step)
+            else:
+                seen.add(step)
+                result.append(step)
+                preds = self._preds.get(step, ())
+                todo.extend(preds)
+        return reversed(result)
+
+    @property
+    def strong_connections(self):
+        #http://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
+        index_counter = [0]
+        stack = []
+        lowlinks = {}
+        index = {}
+        result = []
+
+        graph = self._succs
+
+        def strongconnect(node):
+            # set the depth index for this node to the smallest unused index
+            index[node] = index_counter[0]
+            lowlinks[node] = index_counter[0]
+            index_counter[0] += 1
+            stack.append(node)
+
+            # Consider successors
+            try:
+                successors = graph[node]
+            except Exception:
+                successors = []
+            for successor in successors:
+                if successor not in lowlinks:
+                    # Successor has not yet been visited
+                    strongconnect(successor)
+                    lowlinks[node] = min(lowlinks[node],lowlinks[successor])
+                elif successor in stack:
+                    # the successor is in the stack and hence in the current
+                    # strongly connected component (SCC)
+                    lowlinks[node] = min(lowlinks[node],index[successor])
+
+            # If `node` is a root node, pop the stack and generate an SCC
+            if lowlinks[node] == index[node]:
+                connected_component = []
+
+                while True:
+                    successor = stack.pop()
+                    connected_component.append(successor)
+                    if successor == node: break
+                component = tuple(connected_component)
+                # storing the result
+                result.append(component)
+
+        for node in graph:
+            if node not in lowlinks:
+                strongconnect(node)
+
+        return result
+
+    @property
+    def dot(self):
+        result = ['digraph G {']
+        for succ in self._preds:
+            preds = self._preds[succ]
+            for pred in preds:
+                result.append('  %s -> %s;' % (pred, succ))
+        for node in self._nodes:
+            result.append('  %s;' % node)
+        result.append('}')
+        return '\n'.join(result)
+
+#
+# Unarchiving functionality for zip, tar, tgz, tbz, whl
+#
+
+ARCHIVE_EXTENSIONS = ('.tar.gz', '.tar.bz2', '.tar', '.zip',
+                      '.tgz', '.tbz', '.whl')
+
+def unarchive(archive_filename, dest_dir, format=None, check=True):
+
+    def check_path(path):
+        if not isinstance(path, text_type):
+            path = path.decode('utf-8')
+        p = os.path.abspath(os.path.join(dest_dir, path))
+        if not p.startswith(dest_dir) or p[plen] != os.sep:
+            raise ValueError('path outside destination: %r' % p)
+
+    dest_dir = os.path.abspath(dest_dir)
+    plen = len(dest_dir)
+    archive = None
+    if format is None:
+        if archive_filename.endswith(('.zip', '.whl')):
+            format = 'zip'
+        elif archive_filename.endswith(('.tar.gz', '.tgz')):
+            format = 'tgz'
+            mode = 'r:gz'
+        elif archive_filename.endswith(('.tar.bz2', '.tbz')):
+            format = 'tbz'
+            mode = 'r:bz2'
+        elif archive_filename.endswith('.tar'):
+            format = 'tar'
+            mode = 'r'
+        else:  # pragma: no cover
+            raise ValueError('Unknown format for %r' % archive_filename)
+    try:
+        if format == 'zip':
+            archive = ZipFile(archive_filename, 'r')
+            if check:
+                names = archive.namelist()
+                for name in names:
+                    check_path(name)
+        else:
+            archive = tarfile.open(archive_filename, mode)
+            if check:
+                names = archive.getnames()
+                for name in names:
+                    check_path(name)
+        if format != 'zip' and sys.version_info[0] < 3:
+            # See Python issue 17153. If the dest path contains Unicode,
+            # tarfile extraction fails on Python 2.x if a member path name
+            # contains non-ASCII characters - it leads to an implicit
+            # bytes -> unicode conversion using ASCII to decode.
+            for tarinfo in archive.getmembers():
+                if not isinstance(tarinfo.name, text_type):
+                    tarinfo.name = tarinfo.name.decode('utf-8')
+        archive.extractall(dest_dir)
+
+    finally:
+        if archive:
+            archive.close()
+
+
+def zip_dir(directory):
+    """zip a directory tree into a BytesIO object"""
+    result = io.BytesIO()
+    dlen = len(directory)
+    with ZipFile(result, "w") as zf:
+        for root, dirs, files in os.walk(directory):
+            for name in files:
+                full = os.path.join(root, name)
+                rel = root[dlen:]
+                dest = os.path.join(rel, name)
+                zf.write(full, dest)
+    return result
+
+#
+# Simple progress bar
+#
+
+UNITS = ('', 'K', 'M', 'G','T','P')
+
+
+class Progress(object):
+    unknown = 'UNKNOWN'
+
+    def __init__(self, minval=0, maxval=100):
+        assert maxval is None or maxval >= minval
+        self.min = self.cur = minval
+        self.max = maxval
+        self.started = None
+        self.elapsed = 0
+        self.done = False
+
+    def update(self, curval):
+        assert self.min <= curval
+        assert self.max is None or curval <= self.max
+        self.cur = curval
+        now = time.time()
+        if self.started is None:
+            self.started = now
+        else:
+            self.elapsed = now - self.started
+
+    def increment(self, incr):
+        assert incr >= 0
+        self.update(self.cur + incr)
+
+    def start(self):
+        self.update(self.min)
+        return self
+
+    def stop(self):
+        if self.max is not None:
+            self.update(self.max)
+        self.done = True
+
+    @property
+    def maximum(self):
+        return self.unknown if self.max is None else self.max
+
+    @property
+    def percentage(self):
+        if self.done:
+            result = '100 %'
+        elif self.max is None:
+            result = ' ?? %'
+        else:
+            v = 100.0 * (self.cur - self.min) / (self.max - self.min)
+            result = '%3d %%' % v
+        return result
+
+    def format_duration(self, duration):
+        if (duration <= 0) and self.max is None or self.cur == self.min:
+            result = '??:??:??'
+        #elif duration < 1:
+        #    result = '--:--:--'
+        else:
+            result = time.strftime('%H:%M:%S', time.gmtime(duration))
+        return result
+
+    @property
+    def ETA(self):
+        if self.done:
+            prefix = 'Done'
+            t = self.elapsed
+            #import pdb; pdb.set_trace()
+        else:
+            prefix = 'ETA '
+            if self.max is None:
+                t = -1
+            elif self.elapsed == 0 or (self.cur == self.min):
+                t = 0
+            else:
+                #import pdb; pdb.set_trace()
+                t = float(self.max - self.min)
+                t /= self.cur - self.min
+                t = (t - 1) * self.elapsed
+        return '%s: %s' % (prefix, self.format_duration(t))
+
+    @property
+    def speed(self):
+        if self.elapsed == 0:
+            result = 0.0
+        else:
+            result = (self.cur - self.min) / self.elapsed
+        for unit in UNITS:
+            if result < 1000:
+                break
+            result /= 1000.0
+        return '%d %sB/s' % (result, unit)
+
+#
+# Glob functionality
+#
+
+RICH_GLOB = re.compile(r'\{([^}]*)\}')
+_CHECK_RECURSIVE_GLOB = re.compile(r'[^/\\,{]\*\*|\*\*[^/\\,}]')
+_CHECK_MISMATCH_SET = re.compile(r'^[^{]*\}|\{[^}]*$')
+
+
+def iglob(path_glob):
+    """Extended globbing function that supports ** and {opt1,opt2,opt3}."""
+    if _CHECK_RECURSIVE_GLOB.search(path_glob):
+        msg = """invalid glob %r: recursive glob "**" must be used alone"""
+        raise ValueError(msg % path_glob)
+    if _CHECK_MISMATCH_SET.search(path_glob):
+        msg = """invalid glob %r: mismatching set marker '{' or '}'"""
+        raise ValueError(msg % path_glob)
+    return _iglob(path_glob)
+
+
+def _iglob(path_glob):
+    rich_path_glob = RICH_GLOB.split(path_glob, 1)
+    if len(rich_path_glob) > 1:
+        assert len(rich_path_glob) == 3, rich_path_glob
+        prefix, set, suffix = rich_path_glob
+        for item in set.split(','):
+            for path in _iglob(''.join((prefix, item, suffix))):
+                yield path
+    else:
+        if '**' not in path_glob:
+            for item in std_iglob(path_glob):
+                yield item
+        else:
+            prefix, radical = path_glob.split('**', 1)
+            if prefix == '':
+                prefix = '.'
+            if radical == '':
+                radical = '*'
+            else:
+                # we support both
+                radical = radical.lstrip('/')
+                radical = radical.lstrip('\\')
+            for path, dir, files in os.walk(prefix):
+                path = os.path.normpath(path)
+                for fn in _iglob(os.path.join(path, radical)):
+                    yield fn
+
+if ssl:
+    from .compat import (HTTPSHandler as BaseHTTPSHandler, match_hostname,
+                         CertificateError)
+
+
+#
+# HTTPSConnection which verifies certificates/matches domains
+#
+
+    class HTTPSConnection(httplib.HTTPSConnection):
+        ca_certs = None # set this to the path to the certs file (.pem)
+        check_domain = True # only used if ca_certs is not None
+
+        # noinspection PyPropertyAccess
+        def connect(self):
+            sock = socket.create_connection((self.host, self.port), self.timeout)
+            if getattr(self, '_tunnel_host', False):
+                self.sock = sock
+                self._tunnel()
+
+            if not hasattr(ssl, 'SSLContext'):
+                # For 2.x
+                if self.ca_certs:
+                    cert_reqs = ssl.CERT_REQUIRED
+                else:
+                    cert_reqs = ssl.CERT_NONE
+                self.sock = ssl.wrap_socket(sock, self.key_file, self.cert_file,
+                                            cert_reqs=cert_reqs,
+                                            ssl_version=ssl.PROTOCOL_SSLv23,
+                                            ca_certs=self.ca_certs)
+            else:  # pragma: no cover
+                context = ssl.SSLContext(ssl.PROTOCOL_SSLv23)
+                if hasattr(ssl, 'OP_NO_SSLv2'):
+                    context.options |= ssl.OP_NO_SSLv2
+                if self.cert_file:
+                    context.load_cert_chain(self.cert_file, self.key_file)
+                kwargs = {}
+                if self.ca_certs:
+                    context.verify_mode = ssl.CERT_REQUIRED
+                    context.load_verify_locations(cafile=self.ca_certs)
+                    if getattr(ssl, 'HAS_SNI', False):
+                        kwargs['server_hostname'] = self.host
+                self.sock = context.wrap_socket(sock, **kwargs)
+            if self.ca_certs and self.check_domain:
+                try:
+                    match_hostname(self.sock.getpeercert(), self.host)
+                    logger.debug('Host verified: %s', self.host)
+                except CertificateError:  # pragma: no cover
+                    self.sock.shutdown(socket.SHUT_RDWR)
+                    self.sock.close()
+                    raise
+
+    class HTTPSHandler(BaseHTTPSHandler):
+        def __init__(self, ca_certs, check_domain=True):
+            BaseHTTPSHandler.__init__(self)
+            self.ca_certs = ca_certs
+            self.check_domain = check_domain
+
+        def _conn_maker(self, *args, **kwargs):
+            """
+            This is called to create a connection instance. Normally you'd
+            pass a connection class to do_open, but it doesn't actually check for
+            a class, and just expects a callable. As long as we behave just as a
+            constructor would have, we should be OK. If it ever changes so that
+            we *must* pass a class, we'll create an UnsafeHTTPSConnection class
+            which just sets check_domain to False in the class definition, and
+            choose which one to pass to do_open.
+            """
+            result = HTTPSConnection(*args, **kwargs)
+            if self.ca_certs:
+                result.ca_certs = self.ca_certs
+                result.check_domain = self.check_domain
+            return result
+
+        def https_open(self, req):
+            try:
+                return self.do_open(self._conn_maker, req)
+            except URLError as e:
+                if 'certificate verify failed' in str(e.reason):
+                    raise CertificateError('Unable to verify server certificate '
+                                           'for %s' % req.host)
+                else:
+                    raise
+
+    #
+    # To prevent against mixing HTTP traffic with HTTPS (examples: A Man-In-The-
+    # Middle proxy using HTTP listens on port 443, or an index mistakenly serves
+    # HTML containing a http://xyz link when it should be https://xyz),
+    # you can use the following handler class, which does not allow HTTP traffic.
+    #
+    # It works by inheriting from HTTPHandler - so build_opener won't add a
+    # handler for HTTP itself.
+    #
+    class HTTPSOnlyHandler(HTTPSHandler, HTTPHandler):
+        def http_open(self, req):
+            raise URLError('Unexpected HTTP request on what should be a secure '
+                           'connection: %s' % req)
+
+#
+# XML-RPC with timeouts
+#
+
+_ver_info = sys.version_info[:2]
+
+if _ver_info == (2, 6):
+    class HTTP(httplib.HTTP):
+        def __init__(self, host='', port=None, **kwargs):
+            if port == 0:   # 0 means use port 0, not the default port
+                port = None
+            self._setup(self._connection_class(host, port, **kwargs))
+
+
+    if ssl:
+        class HTTPS(httplib.HTTPS):
+            def __init__(self, host='', port=None, **kwargs):
+                if port == 0:   # 0 means use port 0, not the default port
+                    port = None
+                self._setup(self._connection_class(host, port, **kwargs))
+
+
+class Transport(xmlrpclib.Transport):
+    def __init__(self, timeout, use_datetime=0):
+        self.timeout = timeout
+        xmlrpclib.Transport.__init__(self, use_datetime)
+
+    def make_connection(self, host):
+        h, eh, x509 = self.get_host_info(host)
+        if _ver_info == (2, 6):
+            result = HTTP(h, timeout=self.timeout)
+        else:
+            if not self._connection or host != self._connection[0]:
+                self._extra_headers = eh
+                self._connection = host, httplib.HTTPConnection(h)
+            result = self._connection[1]
+        return result
+
+if ssl:
+    class SafeTransport(xmlrpclib.SafeTransport):
+        def __init__(self, timeout, use_datetime=0):
+            self.timeout = timeout
+            xmlrpclib.SafeTransport.__init__(self, use_datetime)
+
+        def make_connection(self, host):
+            h, eh, kwargs = self.get_host_info(host)
+            if not kwargs:
+                kwargs = {}
+            kwargs['timeout'] = self.timeout
+            if _ver_info == (2, 6):
+                result = HTTPS(host, None, **kwargs)
+            else:
+                if not self._connection or host != self._connection[0]:
+                    self._extra_headers = eh
+                    self._connection = host, httplib.HTTPSConnection(h, None,
+                                                                     **kwargs)
+                result = self._connection[1]
+            return result
+
+
+class ServerProxy(xmlrpclib.ServerProxy):
+    def __init__(self, uri, **kwargs):
+        self.timeout = timeout = kwargs.pop('timeout', None)
+        # The above classes only come into play if a timeout
+        # is specified
+        if timeout is not None:
+            scheme, _ = splittype(uri)
+            use_datetime = kwargs.get('use_datetime', 0)
+            if scheme == 'https':
+                tcls = SafeTransport
+            else:
+                tcls = Transport
+            kwargs['transport'] = t = tcls(timeout, use_datetime=use_datetime)
+            self.transport = t
+        xmlrpclib.ServerProxy.__init__(self, uri, **kwargs)
+
+#
+# CSV functionality. This is provided because on 2.x, the csv module can't
+# handle Unicode. However, we need to deal with Unicode in e.g. RECORD files.
+#
+
+def _csv_open(fn, mode, **kwargs):
+    if sys.version_info[0] < 3:
+        mode += 'b'
+    else:
+        kwargs['newline'] = ''
+        # Python 3 determines encoding from locale. Force 'utf-8'
+        # file encoding to match other forced utf-8 encoding
+        kwargs['encoding'] = 'utf-8'
+    return open(fn, mode, **kwargs)
+
+
+class CSVBase(object):
+    defaults = {
+        'delimiter': str(','),      # The strs are used because we need native
+        'quotechar': str('"'),      # str in the csv API (2.x won't take
+        'lineterminator': str('\n') # Unicode)
+    }
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, *exc_info):
+        self.stream.close()
+
+
+class CSVReader(CSVBase):
+    def __init__(self, **kwargs):
+        if 'stream' in kwargs:
+            stream = kwargs['stream']
+            if sys.version_info[0] >= 3:
+                # needs to be a text stream
+                stream = codecs.getreader('utf-8')(stream)
+            self.stream = stream
+        else:
+            self.stream = _csv_open(kwargs['path'], 'r')
+        self.reader = csv.reader(self.stream, **self.defaults)
+
+    def __iter__(self):
+        return self
+
+    def next(self):
+        result = next(self.reader)
+        if sys.version_info[0] < 3:
+            for i, item in enumerate(result):
+                if not isinstance(item, text_type):
+                    result[i] = item.decode('utf-8')
+        return result
+
+    __next__ = next
+
+class CSVWriter(CSVBase):
+    def __init__(self, fn, **kwargs):
+        self.stream = _csv_open(fn, 'w')
+        self.writer = csv.writer(self.stream, **self.defaults)
+
+    def writerow(self, row):
+        if sys.version_info[0] < 3:
+            r = []
+            for item in row:
+                if isinstance(item, text_type):
+                    item = item.encode('utf-8')
+                r.append(item)
+            row = r
+        self.writer.writerow(row)
+
+#
+#   Configurator functionality
+#
+
+class Configurator(BaseConfigurator):
+
+    value_converters = dict(BaseConfigurator.value_converters)
+    value_converters['inc'] = 'inc_convert'
+
+    def __init__(self, config, base=None):
+        super(Configurator, self).__init__(config)
+        self.base = base or os.getcwd()
+
+    def configure_custom(self, config):
+        def convert(o):
+            if isinstance(o, (list, tuple)):
+                result = type(o)([convert(i) for i in o])
+            elif isinstance(o, dict):
+                if '()' in o:
+                    result = self.configure_custom(o)
+                else:
+                    result = {}
+                    for k in o:
+                        result[k] = convert(o[k])
+            else:
+                result = self.convert(o)
+            return result
+
+        c = config.pop('()')
+        if not callable(c):
+            c = self.resolve(c)
+        props = config.pop('.', None)
+        # Check for valid identifiers
+        args = config.pop('[]', ())
+        if args:
+            args = tuple([convert(o) for o in args])
+        items = [(k, convert(config[k])) for k in config if valid_ident(k)]
+        kwargs = dict(items)
+        result = c(*args, **kwargs)
+        if props:
+            for n, v in props.items():
+                setattr(result, n, convert(v))
+        return result
+
+    def __getitem__(self, key):
+        result = self.config[key]
+        if isinstance(result, dict) and '()' in result:
+            self.config[key] = result = self.configure_custom(result)
+        return result
+
+    def inc_convert(self, value):
+        """Default converter for the inc:// protocol."""
+        if not os.path.isabs(value):
+            value = os.path.join(self.base, value)
+        with codecs.open(value, 'r', encoding='utf-8') as f:
+            result = json.load(f)
+        return result
+
+
+class SubprocessMixin(object):
+    """
+    Mixin for running subprocesses and capturing their output
+    """
+    def __init__(self, verbose=False, progress=None):
+        self.verbose = verbose
+        self.progress = progress
+
+    def reader(self, stream, context):
+        """
+        Read lines from a subprocess' output stream and either pass to a progress
+        callable (if specified) or write progress information to sys.stderr.
+        """
+        progress = self.progress
+        verbose = self.verbose
+        while True:
+            s = stream.readline()
+            if not s:
+                break
+            if progress is not None:
+                progress(s, context)
+            else:
+                if not verbose:
+                    sys.stderr.write('.')
+                else:
+                    sys.stderr.write(s.decode('utf-8'))
+                sys.stderr.flush()
+        stream.close()
+
+    def run_command(self, cmd, **kwargs):
+        p = subprocess.Popen(cmd, stdout=subprocess.PIPE,
+                             stderr=subprocess.PIPE, **kwargs)
+        t1 = threading.Thread(target=self.reader, args=(p.stdout, 'stdout'))
+        t1.start()
+        t2 = threading.Thread(target=self.reader, args=(p.stderr, 'stderr'))
+        t2.start()
+        p.wait()
+        t1.join()
+        t2.join()
+        if self.progress is not None:
+            self.progress('done.', 'main')
+        elif self.verbose:
+            sys.stderr.write('done.\n')
+        return p
+
+
+def normalize_name(name):
+    """Normalize a python package name a la PEP 503"""
+    # https://www.python.org/dev/peps/pep-0503/#normalized-names
+    return re.sub('[-_.]+', '-', name).lower()
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/version.py b/venv/Lib/site-packages/pip/_vendor/distlib/version.py
new file mode 100644
index 000000000..3eebe18ee
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/version.py
@@ -0,0 +1,736 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2012-2017 The Python Software Foundation.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+"""
+Implementation of a flexible versioning scheme providing support for PEP-440,
+setuptools-compatible and semantic versioning.
+"""
+
+import logging
+import re
+
+from .compat import string_types
+from .util import parse_requirement
+
+__all__ = ['NormalizedVersion', 'NormalizedMatcher',
+           'LegacyVersion', 'LegacyMatcher',
+           'SemanticVersion', 'SemanticMatcher',
+           'UnsupportedVersionError', 'get_scheme']
+
+logger = logging.getLogger(__name__)
+
+
+class UnsupportedVersionError(ValueError):
+    """This is an unsupported version."""
+    pass
+
+
+class Version(object):
+    def __init__(self, s):
+        self._string = s = s.strip()
+        self._parts = parts = self.parse(s)
+        assert isinstance(parts, tuple)
+        assert len(parts) > 0
+
+    def parse(self, s):
+        raise NotImplementedError('please implement in a subclass')
+
+    def _check_compatible(self, other):
+        if type(self) != type(other):
+            raise TypeError('cannot compare %r and %r' % (self, other))
+
+    def __eq__(self, other):
+        self._check_compatible(other)
+        return self._parts == other._parts
+
+    def __ne__(self, other):
+        return not self.__eq__(other)
+
+    def __lt__(self, other):
+        self._check_compatible(other)
+        return self._parts < other._parts
+
+    def __gt__(self, other):
+        return not (self.__lt__(other) or self.__eq__(other))
+
+    def __le__(self, other):
+        return self.__lt__(other) or self.__eq__(other)
+
+    def __ge__(self, other):
+        return self.__gt__(other) or self.__eq__(other)
+
+    # See http://docs.python.org/reference/datamodel#object.__hash__
+    def __hash__(self):
+        return hash(self._parts)
+
+    def __repr__(self):
+        return "%s('%s')" % (self.__class__.__name__, self._string)
+
+    def __str__(self):
+        return self._string
+
+    @property
+    def is_prerelease(self):
+        raise NotImplementedError('Please implement in subclasses.')
+
+
+class Matcher(object):
+    version_class = None
+
+    # value is either a callable or the name of a method
+    _operators = {
+        '<': lambda v, c, p: v < c,
+        '>': lambda v, c, p: v > c,
+        '<=': lambda v, c, p: v == c or v < c,
+        '>=': lambda v, c, p: v == c or v > c,
+        '==': lambda v, c, p: v == c,
+        '===': lambda v, c, p: v == c,
+        # by default, compatible => >=.
+        '~=': lambda v, c, p: v == c or v > c,
+        '!=': lambda v, c, p: v != c,
+    }
+
+    # this is a method only to support alternative implementations
+    # via overriding
+    def parse_requirement(self, s):
+        return parse_requirement(s)
+
+    def __init__(self, s):
+        if self.version_class is None:
+            raise ValueError('Please specify a version class')
+        self._string = s = s.strip()
+        r = self.parse_requirement(s)
+        if not r:
+            raise ValueError('Not valid: %r' % s)
+        self.name = r.name
+        self.key = self.name.lower()    # for case-insensitive comparisons
+        clist = []
+        if r.constraints:
+            # import pdb; pdb.set_trace()
+            for op, s in r.constraints:
+                if s.endswith('.*'):
+                    if op not in ('==', '!='):
+                        raise ValueError('\'.*\' not allowed for '
+                                         '%r constraints' % op)
+                    # Could be a partial version (e.g. for '2.*') which
+                    # won't parse as a version, so keep it as a string
+                    vn, prefix = s[:-2], True
+                    # Just to check that vn is a valid version
+                    self.version_class(vn)
+                else:
+                    # Should parse as a version, so we can create an
+                    # instance for the comparison
+                    vn, prefix = self.version_class(s), False
+                clist.append((op, vn, prefix))
+        self._parts = tuple(clist)
+
+    def match(self, version):
+        """
+        Check if the provided version matches the constraints.
+
+        :param version: The version to match against this instance.
+        :type version: String or :class:`Version` instance.
+        """
+        if isinstance(version, string_types):
+            version = self.version_class(version)
+        for operator, constraint, prefix in self._parts:
+            f = self._operators.get(operator)
+            if isinstance(f, string_types):
+                f = getattr(self, f)
+            if not f:
+                msg = ('%r not implemented '
+                       'for %s' % (operator, self.__class__.__name__))
+                raise NotImplementedError(msg)
+            if not f(version, constraint, prefix):
+                return False
+        return True
+
+    @property
+    def exact_version(self):
+        result = None
+        if len(self._parts) == 1 and self._parts[0][0] in ('==', '==='):
+            result = self._parts[0][1]
+        return result
+
+    def _check_compatible(self, other):
+        if type(self) != type(other) or self.name != other.name:
+            raise TypeError('cannot compare %s and %s' % (self, other))
+
+    def __eq__(self, other):
+        self._check_compatible(other)
+        return self.key == other.key and self._parts == other._parts
+
+    def __ne__(self, other):
+        return not self.__eq__(other)
+
+    # See http://docs.python.org/reference/datamodel#object.__hash__
+    def __hash__(self):
+        return hash(self.key) + hash(self._parts)
+
+    def __repr__(self):
+        return "%s(%r)" % (self.__class__.__name__, self._string)
+
+    def __str__(self):
+        return self._string
+
+
+PEP440_VERSION_RE = re.compile(r'^v?(\d+!)?(\d+(\.\d+)*)((a|b|c|rc)(\d+))?'
+                               r'(\.(post)(\d+))?(\.(dev)(\d+))?'
+                               r'(\+([a-zA-Z\d]+(\.[a-zA-Z\d]+)?))?$')
+
+
+def _pep_440_key(s):
+    s = s.strip()
+    m = PEP440_VERSION_RE.match(s)
+    if not m:
+        raise UnsupportedVersionError('Not a valid version: %s' % s)
+    groups = m.groups()
+    nums = tuple(int(v) for v in groups[1].split('.'))
+    while len(nums) > 1 and nums[-1] == 0:
+        nums = nums[:-1]
+
+    if not groups[0]:
+        epoch = 0
+    else:
+        epoch = int(groups[0])
+    pre = groups[4:6]
+    post = groups[7:9]
+    dev = groups[10:12]
+    local = groups[13]
+    if pre == (None, None):
+        pre = ()
+    else:
+        pre = pre[0], int(pre[1])
+    if post == (None, None):
+        post = ()
+    else:
+        post = post[0], int(post[1])
+    if dev == (None, None):
+        dev = ()
+    else:
+        dev = dev[0], int(dev[1])
+    if local is None:
+        local = ()
+    else:
+        parts = []
+        for part in local.split('.'):
+            # to ensure that numeric compares as > lexicographic, avoid
+            # comparing them directly, but encode a tuple which ensures
+            # correct sorting
+            if part.isdigit():
+                part = (1, int(part))
+            else:
+                part = (0, part)
+            parts.append(part)
+        local = tuple(parts)
+    if not pre:
+        # either before pre-release, or final release and after
+        if not post and dev:
+            # before pre-release
+            pre = ('a', -1)     # to sort before a0
+        else:
+            pre = ('z',)        # to sort after all pre-releases
+    # now look at the state of post and dev.
+    if not post:
+        post = ('_',)   # sort before 'a'
+    if not dev:
+        dev = ('final',)
+
+    #print('%s -> %s' % (s, m.groups()))
+    return epoch, nums, pre, post, dev, local
+
+
+_normalized_key = _pep_440_key
+
+
+class NormalizedVersion(Version):
+    """A rational version.
+
+    Good:
+        1.2         # equivalent to "1.2.0"
+        1.2.0
+        1.2a1
+        1.2.3a2
+        1.2.3b1
+        1.2.3c1
+        1.2.3.4
+        TODO: fill this out
+
+    Bad:
+        1           # minimum two numbers
+        1.2a        # release level must have a release serial
+        1.2.3b
+    """
+    def parse(self, s):
+        result = _normalized_key(s)
+        # _normalized_key loses trailing zeroes in the release
+        # clause, since that's needed to ensure that X.Y == X.Y.0 == X.Y.0.0
+        # However, PEP 440 prefix matching needs it: for example,
+        # (~= 1.4.5.0) matches differently to (~= 1.4.5.0.0).
+        m = PEP440_VERSION_RE.match(s)      # must succeed
+        groups = m.groups()
+        self._release_clause = tuple(int(v) for v in groups[1].split('.'))
+        return result
+
+    PREREL_TAGS = set(['a', 'b', 'c', 'rc', 'dev'])
+
+    @property
+    def is_prerelease(self):
+        return any(t[0] in self.PREREL_TAGS for t in self._parts if t)
+
+
+def _match_prefix(x, y):
+    x = str(x)
+    y = str(y)
+    if x == y:
+        return True
+    if not x.startswith(y):
+        return False
+    n = len(y)
+    return x[n] == '.'
+
+
+class NormalizedMatcher(Matcher):
+    version_class = NormalizedVersion
+
+    # value is either a callable or the name of a method
+    _operators = {
+        '~=': '_match_compatible',
+        '<': '_match_lt',
+        '>': '_match_gt',
+        '<=': '_match_le',
+        '>=': '_match_ge',
+        '==': '_match_eq',
+        '===': '_match_arbitrary',
+        '!=': '_match_ne',
+    }
+
+    def _adjust_local(self, version, constraint, prefix):
+        if prefix:
+            strip_local = '+' not in constraint and version._parts[-1]
+        else:
+            # both constraint and version are
+            # NormalizedVersion instances.
+            # If constraint does not have a local component,
+            # ensure the version doesn't, either.
+            strip_local = not constraint._parts[-1] and version._parts[-1]
+        if strip_local:
+            s = version._string.split('+', 1)[0]
+            version = self.version_class(s)
+        return version, constraint
+
+    def _match_lt(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        if version >= constraint:
+            return False
+        release_clause = constraint._release_clause
+        pfx = '.'.join([str(i) for i in release_clause])
+        return not _match_prefix(version, pfx)
+
+    def _match_gt(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        if version <= constraint:
+            return False
+        release_clause = constraint._release_clause
+        pfx = '.'.join([str(i) for i in release_clause])
+        return not _match_prefix(version, pfx)
+
+    def _match_le(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        return version <= constraint
+
+    def _match_ge(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        return version >= constraint
+
+    def _match_eq(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        if not prefix:
+            result = (version == constraint)
+        else:
+            result = _match_prefix(version, constraint)
+        return result
+
+    def _match_arbitrary(self, version, constraint, prefix):
+        return str(version) == str(constraint)
+
+    def _match_ne(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        if not prefix:
+            result = (version != constraint)
+        else:
+            result = not _match_prefix(version, constraint)
+        return result
+
+    def _match_compatible(self, version, constraint, prefix):
+        version, constraint = self._adjust_local(version, constraint, prefix)
+        if version == constraint:
+            return True
+        if version < constraint:
+            return False
+#        if not prefix:
+#            return True
+        release_clause = constraint._release_clause
+        if len(release_clause) > 1:
+            release_clause = release_clause[:-1]
+        pfx = '.'.join([str(i) for i in release_clause])
+        return _match_prefix(version, pfx)
+
+_REPLACEMENTS = (
+    (re.compile('[.+-]$'), ''),                     # remove trailing puncts
+    (re.compile(r'^[.](\d)'), r'0.\1'),             # .N -> 0.N at start
+    (re.compile('^[.-]'), ''),                      # remove leading puncts
+    (re.compile(r'^\((.*)\)$'), r'\1'),             # remove parentheses
+    (re.compile(r'^v(ersion)?\s*(\d+)'), r'\2'),    # remove leading v(ersion)
+    (re.compile(r'^r(ev)?\s*(\d+)'), r'\2'),        # remove leading v(ersion)
+    (re.compile('[.]{2,}'), '.'),                   # multiple runs of '.'
+    (re.compile(r'\b(alfa|apha)\b'), 'alpha'),      # misspelt alpha
+    (re.compile(r'\b(pre-alpha|prealpha)\b'),
+                'pre.alpha'),                       # standardise
+    (re.compile(r'\(beta\)$'), 'beta'),             # remove parentheses
+)
+
+_SUFFIX_REPLACEMENTS = (
+    (re.compile('^[:~._+-]+'), ''),                   # remove leading puncts
+    (re.compile('[,*")([\\]]'), ''),                  # remove unwanted chars
+    (re.compile('[~:+_ -]'), '.'),                    # replace illegal chars
+    (re.compile('[.]{2,}'), '.'),                   # multiple runs of '.'
+    (re.compile(r'\.$'), ''),                       # trailing '.'
+)
+
+_NUMERIC_PREFIX = re.compile(r'(\d+(\.\d+)*)')
+
+
+def _suggest_semantic_version(s):
+    """
+    Try to suggest a semantic form for a version for which
+    _suggest_normalized_version couldn't come up with anything.
+    """
+    result = s.strip().lower()
+    for pat, repl in _REPLACEMENTS:
+        result = pat.sub(repl, result)
+    if not result:
+        result = '0.0.0'
+
+    # Now look for numeric prefix, and separate it out from
+    # the rest.
+    #import pdb; pdb.set_trace()
+    m = _NUMERIC_PREFIX.match(result)
+    if not m:
+        prefix = '0.0.0'
+        suffix = result
+    else:
+        prefix = m.groups()[0].split('.')
+        prefix = [int(i) for i in prefix]
+        while len(prefix) < 3:
+            prefix.append(0)
+        if len(prefix) == 3:
+            suffix = result[m.end():]
+        else:
+            suffix = '.'.join([str(i) for i in prefix[3:]]) + result[m.end():]
+            prefix = prefix[:3]
+        prefix = '.'.join([str(i) for i in prefix])
+        suffix = suffix.strip()
+    if suffix:
+        #import pdb; pdb.set_trace()
+        # massage the suffix.
+        for pat, repl in _SUFFIX_REPLACEMENTS:
+            suffix = pat.sub(repl, suffix)
+
+    if not suffix:
+        result = prefix
+    else:
+        sep = '-' if 'dev' in suffix else '+'
+        result = prefix + sep + suffix
+    if not is_semver(result):
+        result = None
+    return result
+
+
+def _suggest_normalized_version(s):
+    """Suggest a normalized version close to the given version string.
+
+    If you have a version string that isn't rational (i.e. NormalizedVersion
+    doesn't like it) then you might be able to get an equivalent (or close)
+    rational version from this function.
+
+    This does a number of simple normalizations to the given string, based
+    on observation of versions currently in use on PyPI. Given a dump of
+    those version during PyCon 2009, 4287 of them:
+    - 2312 (53.93%) match NormalizedVersion without change
+      with the automatic suggestion
+    - 3474 (81.04%) match when using this suggestion method
+
+    @param s {str} An irrational version string.
+    @returns A rational version string, or None, if couldn't determine one.
+    """
+    try:
+        _normalized_key(s)
+        return s   # already rational
+    except UnsupportedVersionError:
+        pass
+
+    rs = s.lower()
+
+    # part of this could use maketrans
+    for orig, repl in (('-alpha', 'a'), ('-beta', 'b'), ('alpha', 'a'),
+                       ('beta', 'b'), ('rc', 'c'), ('-final', ''),
+                       ('-pre', 'c'),
+                       ('-release', ''), ('.release', ''), ('-stable', ''),
+                       ('+', '.'), ('_', '.'), (' ', ''), ('.final', ''),
+                       ('final', '')):
+        rs = rs.replace(orig, repl)
+
+    # if something ends with dev or pre, we add a 0
+    rs = re.sub(r"pre$", r"pre0", rs)
+    rs = re.sub(r"dev$", r"dev0", rs)
+
+    # if we have something like "b-2" or "a.2" at the end of the
+    # version, that is probably beta, alpha, etc
+    # let's remove the dash or dot
+    rs = re.sub(r"([abc]|rc)[\-\.](\d+)$", r"\1\2", rs)
+
+    # 1.0-dev-r371 -> 1.0.dev371
+    # 0.1-dev-r79 -> 0.1.dev79
+    rs = re.sub(r"[\-\.](dev)[\-\.]?r?(\d+)$", r".\1\2", rs)
+
+    # Clean: 2.0.a.3, 2.0.b1, 0.9.0~c1
+    rs = re.sub(r"[.~]?([abc])\.?", r"\1", rs)
+
+    # Clean: v0.3, v1.0
+    if rs.startswith('v'):
+        rs = rs[1:]
+
+    # Clean leading '0's on numbers.
+    #TODO: unintended side-effect on, e.g., "2003.05.09"
+    # PyPI stats: 77 (~2%) better
+    rs = re.sub(r"\b0+(\d+)(?!\d)", r"\1", rs)
+
+    # Clean a/b/c with no version. E.g. "1.0a" -> "1.0a0". Setuptools infers
+    # zero.
+    # PyPI stats: 245 (7.56%) better
+    rs = re.sub(r"(\d+[abc])$", r"\g<1>0", rs)
+
+    # the 'dev-rNNN' tag is a dev tag
+    rs = re.sub(r"\.?(dev-r|dev\.r)\.?(\d+)$", r".dev\2", rs)
+
+    # clean the - when used as a pre delimiter
+    rs = re.sub(r"-(a|b|c)(\d+)$", r"\1\2", rs)
+
+    # a terminal "dev" or "devel" can be changed into ".dev0"
+    rs = re.sub(r"[\.\-](dev|devel)$", r".dev0", rs)
+
+    # a terminal "dev" can be changed into ".dev0"
+    rs = re.sub(r"(?![\.\-])dev$", r".dev0", rs)
+
+    # a terminal "final" or "stable" can be removed
+    rs = re.sub(r"(final|stable)$", "", rs)
+
+    # The 'r' and the '-' tags are post release tags
+    #   0.4a1.r10       ->  0.4a1.post10
+    #   0.9.33-17222    ->  0.9.33.post17222
+    #   0.9.33-r17222   ->  0.9.33.post17222
+    rs = re.sub(r"\.?(r|-|-r)\.?(\d+)$", r".post\2", rs)
+
+    # Clean 'r' instead of 'dev' usage:
+    #   0.9.33+r17222   ->  0.9.33.dev17222
+    #   1.0dev123       ->  1.0.dev123
+    #   1.0.git123      ->  1.0.dev123
+    #   1.0.bzr123      ->  1.0.dev123
+    #   0.1a0dev.123    ->  0.1a0.dev123
+    # PyPI stats:  ~150 (~4%) better
+    rs = re.sub(r"\.?(dev|git|bzr)\.?(\d+)$", r".dev\2", rs)
+
+    # Clean '.pre' (normalized from '-pre' above) instead of 'c' usage:
+    #   0.2.pre1        ->  0.2c1
+    #   0.2-c1         ->  0.2c1
+    #   1.0preview123   ->  1.0c123
+    # PyPI stats: ~21 (0.62%) better
+    rs = re.sub(r"\.?(pre|preview|-c)(\d+)$", r"c\g<2>", rs)
+
+    # Tcl/Tk uses "px" for their post release markers
+    rs = re.sub(r"p(\d+)$", r".post\1", rs)
+
+    try:
+        _normalized_key(rs)
+    except UnsupportedVersionError:
+        rs = None
+    return rs
+
+#
+#   Legacy version processing (distribute-compatible)
+#
+
+_VERSION_PART = re.compile(r'([a-z]+|\d+|[\.-])', re.I)
+_VERSION_REPLACE = {
+    'pre': 'c',
+    'preview': 'c',
+    '-': 'final-',
+    'rc': 'c',
+    'dev': '@',
+    '': None,
+    '.': None,
+}
+
+
+def _legacy_key(s):
+    def get_parts(s):
+        result = []
+        for p in _VERSION_PART.split(s.lower()):
+            p = _VERSION_REPLACE.get(p, p)
+            if p:
+                if '0' <= p[:1] <= '9':
+                    p = p.zfill(8)
+                else:
+                    p = '*' + p
+                result.append(p)
+        result.append('*final')
+        return result
+
+    result = []
+    for p in get_parts(s):
+        if p.startswith('*'):
+            if p < '*final':
+                while result and result[-1] == '*final-':
+                    result.pop()
+            while result and result[-1] == '00000000':
+                result.pop()
+        result.append(p)
+    return tuple(result)
+
+
+class LegacyVersion(Version):
+    def parse(self, s):
+        return _legacy_key(s)
+
+    @property
+    def is_prerelease(self):
+        result = False
+        for x in self._parts:
+            if (isinstance(x, string_types) and x.startswith('*') and
+                x < '*final'):
+                result = True
+                break
+        return result
+
+
+class LegacyMatcher(Matcher):
+    version_class = LegacyVersion
+
+    _operators = dict(Matcher._operators)
+    _operators['~='] = '_match_compatible'
+
+    numeric_re = re.compile(r'^(\d+(\.\d+)*)')
+
+    def _match_compatible(self, version, constraint, prefix):
+        if version < constraint:
+            return False
+        m = self.numeric_re.match(str(constraint))
+        if not m:
+            logger.warning('Cannot compute compatible match for version %s '
+                           ' and constraint %s', version, constraint)
+            return True
+        s = m.groups()[0]
+        if '.' in s:
+            s = s.rsplit('.', 1)[0]
+        return _match_prefix(version, s)
+
+#
+#   Semantic versioning
+#
+
+_SEMVER_RE = re.compile(r'^(\d+)\.(\d+)\.(\d+)'
+                        r'(-[a-z0-9]+(\.[a-z0-9-]+)*)?'
+                        r'(\+[a-z0-9]+(\.[a-z0-9-]+)*)?$', re.I)
+
+
+def is_semver(s):
+    return _SEMVER_RE.match(s)
+
+
+def _semantic_key(s):
+    def make_tuple(s, absent):
+        if s is None:
+            result = (absent,)
+        else:
+            parts = s[1:].split('.')
+            # We can't compare ints and strings on Python 3, so fudge it
+            # by zero-filling numeric values so simulate a numeric comparison
+            result = tuple([p.zfill(8) if p.isdigit() else p for p in parts])
+        return result
+
+    m = is_semver(s)
+    if not m:
+        raise UnsupportedVersionError(s)
+    groups = m.groups()
+    major, minor, patch = [int(i) for i in groups[:3]]
+    # choose the '|' and '*' so that versions sort correctly
+    pre, build = make_tuple(groups[3], '|'), make_tuple(groups[5], '*')
+    return (major, minor, patch), pre, build
+
+
+class SemanticVersion(Version):
+    def parse(self, s):
+        return _semantic_key(s)
+
+    @property
+    def is_prerelease(self):
+        return self._parts[1][0] != '|'
+
+
+class SemanticMatcher(Matcher):
+    version_class = SemanticVersion
+
+
+class VersionScheme(object):
+    def __init__(self, key, matcher, suggester=None):
+        self.key = key
+        self.matcher = matcher
+        self.suggester = suggester
+
+    def is_valid_version(self, s):
+        try:
+            self.matcher.version_class(s)
+            result = True
+        except UnsupportedVersionError:
+            result = False
+        return result
+
+    def is_valid_matcher(self, s):
+        try:
+            self.matcher(s)
+            result = True
+        except UnsupportedVersionError:
+            result = False
+        return result
+
+    def is_valid_constraint_list(self, s):
+        """
+        Used for processing some metadata fields
+        """
+        return self.is_valid_matcher('dummy_name (%s)' % s)
+
+    def suggest(self, s):
+        if self.suggester is None:
+            result = None
+        else:
+            result = self.suggester(s)
+        return result
+
+_SCHEMES = {
+    'normalized': VersionScheme(_normalized_key, NormalizedMatcher,
+                                _suggest_normalized_version),
+    'legacy': VersionScheme(_legacy_key, LegacyMatcher, lambda self, s: s),
+    'semantic': VersionScheme(_semantic_key, SemanticMatcher,
+                              _suggest_semantic_version),
+}
+
+_SCHEMES['default'] = _SCHEMES['normalized']
+
+
+def get_scheme(name):
+    if name not in _SCHEMES:
+        raise ValueError('unknown scheme name: %r' % name)
+    return _SCHEMES[name]
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/w32.exe b/venv/Lib/site-packages/pip/_vendor/distlib/w32.exe
new file mode 100644
index 000000000..e6439e9e4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/w32.exe differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/w64.exe b/venv/Lib/site-packages/pip/_vendor/distlib/w64.exe
new file mode 100644
index 000000000..46139dbf9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/distlib/w64.exe differ
diff --git a/venv/Lib/site-packages/pip/_vendor/distlib/wheel.py b/venv/Lib/site-packages/pip/_vendor/distlib/wheel.py
new file mode 100644
index 000000000..1e2c7a020
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distlib/wheel.py
@@ -0,0 +1,1018 @@
+# -*- coding: utf-8 -*-
+#
+# Copyright (C) 2013-2017 Vinay Sajip.
+# Licensed to the Python Software Foundation under a contributor agreement.
+# See LICENSE.txt and CONTRIBUTORS.txt.
+#
+from __future__ import unicode_literals
+
+import base64
+import codecs
+import datetime
+import distutils.util
+from email import message_from_file
+import hashlib
+import imp
+import json
+import logging
+import os
+import posixpath
+import re
+import shutil
+import sys
+import tempfile
+import zipfile
+
+from . import __version__, DistlibException
+from .compat import sysconfig, ZipFile, fsdecode, text_type, filter
+from .database import InstalledDistribution
+from .metadata import (Metadata, METADATA_FILENAME, WHEEL_METADATA_FILENAME,
+                       LEGACY_METADATA_FILENAME)
+from .util import (FileOperator, convert_path, CSVReader, CSVWriter, Cache,
+                   cached_property, get_cache_base, read_exports, tempdir)
+from .version import NormalizedVersion, UnsupportedVersionError
+
+logger = logging.getLogger(__name__)
+
+cache = None    # created when needed
+
+if hasattr(sys, 'pypy_version_info'):  # pragma: no cover
+    IMP_PREFIX = 'pp'
+elif sys.platform.startswith('java'):  # pragma: no cover
+    IMP_PREFIX = 'jy'
+elif sys.platform == 'cli':  # pragma: no cover
+    IMP_PREFIX = 'ip'
+else:
+    IMP_PREFIX = 'cp'
+
+VER_SUFFIX = sysconfig.get_config_var('py_version_nodot')
+if not VER_SUFFIX:   # pragma: no cover
+    VER_SUFFIX = '%s%s' % sys.version_info[:2]
+PYVER = 'py' + VER_SUFFIX
+IMPVER = IMP_PREFIX + VER_SUFFIX
+
+ARCH = distutils.util.get_platform().replace('-', '_').replace('.', '_')
+
+ABI = sysconfig.get_config_var('SOABI')
+if ABI and ABI.startswith('cpython-'):
+    ABI = ABI.replace('cpython-', 'cp')
+else:
+    def _derive_abi():
+        parts = ['cp', VER_SUFFIX]
+        if sysconfig.get_config_var('Py_DEBUG'):
+            parts.append('d')
+        if sysconfig.get_config_var('WITH_PYMALLOC'):
+            parts.append('m')
+        if sysconfig.get_config_var('Py_UNICODE_SIZE') == 4:
+            parts.append('u')
+        return ''.join(parts)
+    ABI = _derive_abi()
+    del _derive_abi
+
+FILENAME_RE = re.compile(r'''
+(?P<nm>[^-]+)
+-(?P<vn>\d+[^-]*)
+(-(?P<bn>\d+[^-]*))?
+-(?P<py>\w+\d+(\.\w+\d+)*)
+-(?P<bi>\w+)
+-(?P<ar>\w+(\.\w+)*)
+\.whl$
+''', re.IGNORECASE | re.VERBOSE)
+
+NAME_VERSION_RE = re.compile(r'''
+(?P<nm>[^-]+)
+-(?P<vn>\d+[^-]*)
+(-(?P<bn>\d+[^-]*))?$
+''', re.IGNORECASE | re.VERBOSE)
+
+SHEBANG_RE = re.compile(br'\s*#![^\r\n]*')
+SHEBANG_DETAIL_RE = re.compile(br'^(\s*#!("[^"]+"|\S+))\s+(.*)$')
+SHEBANG_PYTHON = b'#!python'
+SHEBANG_PYTHONW = b'#!pythonw'
+
+if os.sep == '/':
+    to_posix = lambda o: o
+else:
+    to_posix = lambda o: o.replace(os.sep, '/')
+
+
+class Mounter(object):
+    def __init__(self):
+        self.impure_wheels = {}
+        self.libs = {}
+
+    def add(self, pathname, extensions):
+        self.impure_wheels[pathname] = extensions
+        self.libs.update(extensions)
+
+    def remove(self, pathname):
+        extensions = self.impure_wheels.pop(pathname)
+        for k, v in extensions:
+            if k in self.libs:
+                del self.libs[k]
+
+    def find_module(self, fullname, path=None):
+        if fullname in self.libs:
+            result = self
+        else:
+            result = None
+        return result
+
+    def load_module(self, fullname):
+        if fullname in sys.modules:
+            result = sys.modules[fullname]
+        else:
+            if fullname not in self.libs:
+                raise ImportError('unable to find extension for %s' % fullname)
+            result = imp.load_dynamic(fullname, self.libs[fullname])
+            result.__loader__ = self
+            parts = fullname.rsplit('.', 1)
+            if len(parts) > 1:
+                result.__package__ = parts[0]
+        return result
+
+_hook = Mounter()
+
+
+class Wheel(object):
+    """
+    Class to build and install from Wheel files (PEP 427).
+    """
+
+    wheel_version = (1, 1)
+    hash_kind = 'sha256'
+
+    def __init__(self, filename=None, sign=False, verify=False):
+        """
+        Initialise an instance using a (valid) filename.
+        """
+        self.sign = sign
+        self.should_verify = verify
+        self.buildver = ''
+        self.pyver = [PYVER]
+        self.abi = ['none']
+        self.arch = ['any']
+        self.dirname = os.getcwd()
+        if filename is None:
+            self.name = 'dummy'
+            self.version = '0.1'
+            self._filename = self.filename
+        else:
+            m = NAME_VERSION_RE.match(filename)
+            if m:
+                info = m.groupdict('')
+                self.name = info['nm']
+                # Reinstate the local version separator
+                self.version = info['vn'].replace('_', '-')
+                self.buildver = info['bn']
+                self._filename = self.filename
+            else:
+                dirname, filename = os.path.split(filename)
+                m = FILENAME_RE.match(filename)
+                if not m:
+                    raise DistlibException('Invalid name or '
+                                           'filename: %r' % filename)
+                if dirname:
+                    self.dirname = os.path.abspath(dirname)
+                self._filename = filename
+                info = m.groupdict('')
+                self.name = info['nm']
+                self.version = info['vn']
+                self.buildver = info['bn']
+                self.pyver = info['py'].split('.')
+                self.abi = info['bi'].split('.')
+                self.arch = info['ar'].split('.')
+
+    @property
+    def filename(self):
+        """
+        Build and return a filename from the various components.
+        """
+        if self.buildver:
+            buildver = '-' + self.buildver
+        else:
+            buildver = ''
+        pyver = '.'.join(self.pyver)
+        abi = '.'.join(self.abi)
+        arch = '.'.join(self.arch)
+        # replace - with _ as a local version separator
+        version = self.version.replace('-', '_')
+        return '%s-%s%s-%s-%s-%s.whl' % (self.name, version, buildver,
+                                         pyver, abi, arch)
+
+    @property
+    def exists(self):
+        path = os.path.join(self.dirname, self.filename)
+        return os.path.isfile(path)
+
+    @property
+    def tags(self):
+        for pyver in self.pyver:
+            for abi in self.abi:
+                for arch in self.arch:
+                    yield pyver, abi, arch
+
+    @cached_property
+    def metadata(self):
+        pathname = os.path.join(self.dirname, self.filename)
+        name_ver = '%s-%s' % (self.name, self.version)
+        info_dir = '%s.dist-info' % name_ver
+        wrapper = codecs.getreader('utf-8')
+        with ZipFile(pathname, 'r') as zf:
+            wheel_metadata = self.get_wheel_metadata(zf)
+            wv = wheel_metadata['Wheel-Version'].split('.', 1)
+            file_version = tuple([int(i) for i in wv])
+            # if file_version < (1, 1):
+                # fns = [WHEEL_METADATA_FILENAME, METADATA_FILENAME,
+                       # LEGACY_METADATA_FILENAME]
+            # else:
+                # fns = [WHEEL_METADATA_FILENAME, METADATA_FILENAME]
+            fns = [WHEEL_METADATA_FILENAME, LEGACY_METADATA_FILENAME]
+            result = None
+            for fn in fns:
+                try:
+                    metadata_filename = posixpath.join(info_dir, fn)
+                    with zf.open(metadata_filename) as bf:
+                        wf = wrapper(bf)
+                        result = Metadata(fileobj=wf)
+                        if result:
+                            break
+                except KeyError:
+                    pass
+            if not result:
+                raise ValueError('Invalid wheel, because metadata is '
+                                 'missing: looked in %s' % ', '.join(fns))
+        return result
+
+    def get_wheel_metadata(self, zf):
+        name_ver = '%s-%s' % (self.name, self.version)
+        info_dir = '%s.dist-info' % name_ver
+        metadata_filename = posixpath.join(info_dir, 'WHEEL')
+        with zf.open(metadata_filename) as bf:
+            wf = codecs.getreader('utf-8')(bf)
+            message = message_from_file(wf)
+        return dict(message)
+
+    @cached_property
+    def info(self):
+        pathname = os.path.join(self.dirname, self.filename)
+        with ZipFile(pathname, 'r') as zf:
+            result = self.get_wheel_metadata(zf)
+        return result
+
+    def process_shebang(self, data):
+        m = SHEBANG_RE.match(data)
+        if m:
+            end = m.end()
+            shebang, data_after_shebang = data[:end], data[end:]
+            # Preserve any arguments after the interpreter
+            if b'pythonw' in shebang.lower():
+                shebang_python = SHEBANG_PYTHONW
+            else:
+                shebang_python = SHEBANG_PYTHON
+            m = SHEBANG_DETAIL_RE.match(shebang)
+            if m:
+                args = b' ' + m.groups()[-1]
+            else:
+                args = b''
+            shebang = shebang_python + args
+            data = shebang + data_after_shebang
+        else:
+            cr = data.find(b'\r')
+            lf = data.find(b'\n')
+            if cr < 0 or cr > lf:
+                term = b'\n'
+            else:
+                if data[cr:cr + 2] == b'\r\n':
+                    term = b'\r\n'
+                else:
+                    term = b'\r'
+            data = SHEBANG_PYTHON + term + data
+        return data
+
+    def get_hash(self, data, hash_kind=None):
+        if hash_kind is None:
+            hash_kind = self.hash_kind
+        try:
+            hasher = getattr(hashlib, hash_kind)
+        except AttributeError:
+            raise DistlibException('Unsupported hash algorithm: %r' % hash_kind)
+        result = hasher(data).digest()
+        result = base64.urlsafe_b64encode(result).rstrip(b'=').decode('ascii')
+        return hash_kind, result
+
+    def write_record(self, records, record_path, base):
+        records = list(records) # make a copy, as mutated
+        p = to_posix(os.path.relpath(record_path, base))
+        records.append((p, '', ''))
+        with CSVWriter(record_path) as writer:
+            for row in records:
+                writer.writerow(row)
+
+    def write_records(self, info, libdir, archive_paths):
+        records = []
+        distinfo, info_dir = info
+        hasher = getattr(hashlib, self.hash_kind)
+        for ap, p in archive_paths:
+            with open(p, 'rb') as f:
+                data = f.read()
+            digest = '%s=%s' % self.get_hash(data)
+            size = os.path.getsize(p)
+            records.append((ap, digest, size))
+
+        p = os.path.join(distinfo, 'RECORD')
+        self.write_record(records, p, libdir)
+        ap = to_posix(os.path.join(info_dir, 'RECORD'))
+        archive_paths.append((ap, p))
+
+    def build_zip(self, pathname, archive_paths):
+        with ZipFile(pathname, 'w', zipfile.ZIP_DEFLATED) as zf:
+            for ap, p in archive_paths:
+                logger.debug('Wrote %s to %s in wheel', p, ap)
+                zf.write(p, ap)
+
+    def build(self, paths, tags=None, wheel_version=None):
+        """
+        Build a wheel from files in specified paths, and use any specified tags
+        when determining the name of the wheel.
+        """
+        if tags is None:
+            tags = {}
+
+        libkey = list(filter(lambda o: o in paths, ('purelib', 'platlib')))[0]
+        if libkey == 'platlib':
+            is_pure = 'false'
+            default_pyver = [IMPVER]
+            default_abi = [ABI]
+            default_arch = [ARCH]
+        else:
+            is_pure = 'true'
+            default_pyver = [PYVER]
+            default_abi = ['none']
+            default_arch = ['any']
+
+        self.pyver = tags.get('pyver', default_pyver)
+        self.abi = tags.get('abi', default_abi)
+        self.arch = tags.get('arch', default_arch)
+
+        libdir = paths[libkey]
+
+        name_ver = '%s-%s' % (self.name, self.version)
+        data_dir = '%s.data' % name_ver
+        info_dir = '%s.dist-info' % name_ver
+
+        archive_paths = []
+
+        # First, stuff which is not in site-packages
+        for key in ('data', 'headers', 'scripts'):
+            if key not in paths:
+                continue
+            path = paths[key]
+            if os.path.isdir(path):
+                for root, dirs, files in os.walk(path):
+                    for fn in files:
+                        p = fsdecode(os.path.join(root, fn))
+                        rp = os.path.relpath(p, path)
+                        ap = to_posix(os.path.join(data_dir, key, rp))
+                        archive_paths.append((ap, p))
+                        if key == 'scripts' and not p.endswith('.exe'):
+                            with open(p, 'rb') as f:
+                                data = f.read()
+                            data = self.process_shebang(data)
+                            with open(p, 'wb') as f:
+                                f.write(data)
+
+        # Now, stuff which is in site-packages, other than the
+        # distinfo stuff.
+        path = libdir
+        distinfo = None
+        for root, dirs, files in os.walk(path):
+            if root == path:
+                # At the top level only, save distinfo for later
+                # and skip it for now
+                for i, dn in enumerate(dirs):
+                    dn = fsdecode(dn)
+                    if dn.endswith('.dist-info'):
+                        distinfo = os.path.join(root, dn)
+                        del dirs[i]
+                        break
+                assert distinfo, '.dist-info directory expected, not found'
+
+            for fn in files:
+                # comment out next suite to leave .pyc files in
+                if fsdecode(fn).endswith(('.pyc', '.pyo')):
+                    continue
+                p = os.path.join(root, fn)
+                rp = to_posix(os.path.relpath(p, path))
+                archive_paths.append((rp, p))
+
+        # Now distinfo. Assumed to be flat, i.e. os.listdir is enough.
+        files = os.listdir(distinfo)
+        for fn in files:
+            if fn not in ('RECORD', 'INSTALLER', 'SHARED', 'WHEEL'):
+                p = fsdecode(os.path.join(distinfo, fn))
+                ap = to_posix(os.path.join(info_dir, fn))
+                archive_paths.append((ap, p))
+
+        wheel_metadata = [
+            'Wheel-Version: %d.%d' % (wheel_version or self.wheel_version),
+            'Generator: distlib %s' % __version__,
+            'Root-Is-Purelib: %s' % is_pure,
+        ]
+        for pyver, abi, arch in self.tags:
+            wheel_metadata.append('Tag: %s-%s-%s' % (pyver, abi, arch))
+        p = os.path.join(distinfo, 'WHEEL')
+        with open(p, 'w') as f:
+            f.write('\n'.join(wheel_metadata))
+        ap = to_posix(os.path.join(info_dir, 'WHEEL'))
+        archive_paths.append((ap, p))
+
+        # sort the entries by archive path. Not needed by any spec, but it
+        # keeps the archive listing and RECORD tidier than they would otherwise
+        # be. Use the number of path segments to keep directory entries together,
+        # and keep the dist-info stuff at the end.
+        def sorter(t):
+            ap = t[0]
+            n = ap.count('/')
+            if '.dist-info' in ap:
+                n += 10000
+            return (n, ap)
+        archive_paths = sorted(archive_paths, key=sorter)
+
+        # Now, at last, RECORD.
+        # Paths in here are archive paths - nothing else makes sense.
+        self.write_records((distinfo, info_dir), libdir, archive_paths)
+        # Now, ready to build the zip file
+        pathname = os.path.join(self.dirname, self.filename)
+        self.build_zip(pathname, archive_paths)
+        return pathname
+
+    def skip_entry(self, arcname):
+        """
+        Determine whether an archive entry should be skipped when verifying
+        or installing.
+        """
+        # The signature file won't be in RECORD,
+        # and we  don't currently don't do anything with it
+        # We also skip directories, as they won't be in RECORD
+        # either. See:
+        #
+        # https://github.com/pypa/wheel/issues/294
+        # https://github.com/pypa/wheel/issues/287
+        # https://github.com/pypa/wheel/pull/289
+        #
+        return arcname.endswith(('/', '/RECORD.jws'))
+
+    def install(self, paths, maker, **kwargs):
+        """
+        Install a wheel to the specified paths. If kwarg ``warner`` is
+        specified, it should be a callable, which will be called with two
+        tuples indicating the wheel version of this software and the wheel
+        version in the file, if there is a discrepancy in the versions.
+        This can be used to issue any warnings to raise any exceptions.
+        If kwarg ``lib_only`` is True, only the purelib/platlib files are
+        installed, and the headers, scripts, data and dist-info metadata are
+        not written. If kwarg ``bytecode_hashed_invalidation`` is True, written
+        bytecode will try to use file-hash based invalidation (PEP-552) on
+        supported interpreter versions (CPython 2.7+).
+
+        The return value is a :class:`InstalledDistribution` instance unless
+        ``options.lib_only`` is True, in which case the return value is ``None``.
+        """
+
+        dry_run = maker.dry_run
+        warner = kwargs.get('warner')
+        lib_only = kwargs.get('lib_only', False)
+        bc_hashed_invalidation = kwargs.get('bytecode_hashed_invalidation', False)
+
+        pathname = os.path.join(self.dirname, self.filename)
+        name_ver = '%s-%s' % (self.name, self.version)
+        data_dir = '%s.data' % name_ver
+        info_dir = '%s.dist-info' % name_ver
+
+        metadata_name = posixpath.join(info_dir, LEGACY_METADATA_FILENAME)
+        wheel_metadata_name = posixpath.join(info_dir, 'WHEEL')
+        record_name = posixpath.join(info_dir, 'RECORD')
+
+        wrapper = codecs.getreader('utf-8')
+
+        with ZipFile(pathname, 'r') as zf:
+            with zf.open(wheel_metadata_name) as bwf:
+                wf = wrapper(bwf)
+                message = message_from_file(wf)
+            wv = message['Wheel-Version'].split('.', 1)
+            file_version = tuple([int(i) for i in wv])
+            if (file_version != self.wheel_version) and warner:
+                warner(self.wheel_version, file_version)
+
+            if message['Root-Is-Purelib'] == 'true':
+                libdir = paths['purelib']
+            else:
+                libdir = paths['platlib']
+
+            records = {}
+            with zf.open(record_name) as bf:
+                with CSVReader(stream=bf) as reader:
+                    for row in reader:
+                        p = row[0]
+                        records[p] = row
+
+            data_pfx = posixpath.join(data_dir, '')
+            info_pfx = posixpath.join(info_dir, '')
+            script_pfx = posixpath.join(data_dir, 'scripts', '')
+
+            # make a new instance rather than a copy of maker's,
+            # as we mutate it
+            fileop = FileOperator(dry_run=dry_run)
+            fileop.record = True    # so we can rollback if needed
+
+            bc = not sys.dont_write_bytecode    # Double negatives. Lovely!
+
+            outfiles = []   # for RECORD writing
+
+            # for script copying/shebang processing
+            workdir = tempfile.mkdtemp()
+            # set target dir later
+            # we default add_launchers to False, as the
+            # Python Launcher should be used instead
+            maker.source_dir = workdir
+            maker.target_dir = None
+            try:
+                for zinfo in zf.infolist():
+                    arcname = zinfo.filename
+                    if isinstance(arcname, text_type):
+                        u_arcname = arcname
+                    else:
+                        u_arcname = arcname.decode('utf-8')
+                    if self.skip_entry(u_arcname):
+                        continue
+                    row = records[u_arcname]
+                    if row[2] and str(zinfo.file_size) != row[2]:
+                        raise DistlibException('size mismatch for '
+                                               '%s' % u_arcname)
+                    if row[1]:
+                        kind, value = row[1].split('=', 1)
+                        with zf.open(arcname) as bf:
+                            data = bf.read()
+                        _, digest = self.get_hash(data, kind)
+                        if digest != value:
+                            raise DistlibException('digest mismatch for '
+                                                   '%s' % arcname)
+
+                    if lib_only and u_arcname.startswith((info_pfx, data_pfx)):
+                        logger.debug('lib_only: skipping %s', u_arcname)
+                        continue
+                    is_script = (u_arcname.startswith(script_pfx)
+                                 and not u_arcname.endswith('.exe'))
+
+                    if u_arcname.startswith(data_pfx):
+                        _, where, rp = u_arcname.split('/', 2)
+                        outfile = os.path.join(paths[where], convert_path(rp))
+                    else:
+                        # meant for site-packages.
+                        if u_arcname in (wheel_metadata_name, record_name):
+                            continue
+                        outfile = os.path.join(libdir, convert_path(u_arcname))
+                    if not is_script:
+                        with zf.open(arcname) as bf:
+                            fileop.copy_stream(bf, outfile)
+                        outfiles.append(outfile)
+                        # Double check the digest of the written file
+                        if not dry_run and row[1]:
+                            with open(outfile, 'rb') as bf:
+                                data = bf.read()
+                                _, newdigest = self.get_hash(data, kind)
+                                if newdigest != digest:
+                                    raise DistlibException('digest mismatch '
+                                                           'on write for '
+                                                           '%s' % outfile)
+                        if bc and outfile.endswith('.py'):
+                            try:
+                                pyc = fileop.byte_compile(outfile,
+                                                          hashed_invalidation=bc_hashed_invalidation)
+                                outfiles.append(pyc)
+                            except Exception:
+                                # Don't give up if byte-compilation fails,
+                                # but log it and perhaps warn the user
+                                logger.warning('Byte-compilation failed',
+                                               exc_info=True)
+                    else:
+                        fn = os.path.basename(convert_path(arcname))
+                        workname = os.path.join(workdir, fn)
+                        with zf.open(arcname) as bf:
+                            fileop.copy_stream(bf, workname)
+
+                        dn, fn = os.path.split(outfile)
+                        maker.target_dir = dn
+                        filenames = maker.make(fn)
+                        fileop.set_executable_mode(filenames)
+                        outfiles.extend(filenames)
+
+                if lib_only:
+                    logger.debug('lib_only: returning None')
+                    dist = None
+                else:
+                    # Generate scripts
+
+                    # Try to get pydist.json so we can see if there are
+                    # any commands to generate. If this fails (e.g. because
+                    # of a legacy wheel), log a warning but don't give up.
+                    commands = None
+                    file_version = self.info['Wheel-Version']
+                    if file_version == '1.0':
+                        # Use legacy info
+                        ep = posixpath.join(info_dir, 'entry_points.txt')
+                        try:
+                            with zf.open(ep) as bwf:
+                                epdata = read_exports(bwf)
+                            commands = {}
+                            for key in ('console', 'gui'):
+                                k = '%s_scripts' % key
+                                if k in epdata:
+                                    commands['wrap_%s' % key] = d = {}
+                                    for v in epdata[k].values():
+                                        s = '%s:%s' % (v.prefix, v.suffix)
+                                        if v.flags:
+                                            s += ' [%s]' % ','.join(v.flags)
+                                        d[v.name] = s
+                        except Exception:
+                            logger.warning('Unable to read legacy script '
+                                           'metadata, so cannot generate '
+                                           'scripts')
+                    else:
+                        try:
+                            with zf.open(metadata_name) as bwf:
+                                wf = wrapper(bwf)
+                                commands = json.load(wf).get('extensions')
+                                if commands:
+                                    commands = commands.get('python.commands')
+                        except Exception:
+                            logger.warning('Unable to read JSON metadata, so '
+                                           'cannot generate scripts')
+                    if commands:
+                        console_scripts = commands.get('wrap_console', {})
+                        gui_scripts = commands.get('wrap_gui', {})
+                        if console_scripts or gui_scripts:
+                            script_dir = paths.get('scripts', '')
+                            if not os.path.isdir(script_dir):
+                                raise ValueError('Valid script path not '
+                                                 'specified')
+                            maker.target_dir = script_dir
+                            for k, v in console_scripts.items():
+                                script = '%s = %s' % (k, v)
+                                filenames = maker.make(script)
+                                fileop.set_executable_mode(filenames)
+
+                            if gui_scripts:
+                                options = {'gui': True }
+                                for k, v in gui_scripts.items():
+                                    script = '%s = %s' % (k, v)
+                                    filenames = maker.make(script, options)
+                                    fileop.set_executable_mode(filenames)
+
+                    p = os.path.join(libdir, info_dir)
+                    dist = InstalledDistribution(p)
+
+                    # Write SHARED
+                    paths = dict(paths)     # don't change passed in dict
+                    del paths['purelib']
+                    del paths['platlib']
+                    paths['lib'] = libdir
+                    p = dist.write_shared_locations(paths, dry_run)
+                    if p:
+                        outfiles.append(p)
+
+                    # Write RECORD
+                    dist.write_installed_files(outfiles, paths['prefix'],
+                                               dry_run)
+                return dist
+            except Exception:  # pragma: no cover
+                logger.exception('installation failed.')
+                fileop.rollback()
+                raise
+            finally:
+                shutil.rmtree(workdir)
+
+    def _get_dylib_cache(self):
+        global cache
+        if cache is None:
+            # Use native string to avoid issues on 2.x: see Python #20140.
+            base = os.path.join(get_cache_base(), str('dylib-cache'),
+                                '%s.%s' % sys.version_info[:2])
+            cache = Cache(base)
+        return cache
+
+    def _get_extensions(self):
+        pathname = os.path.join(self.dirname, self.filename)
+        name_ver = '%s-%s' % (self.name, self.version)
+        info_dir = '%s.dist-info' % name_ver
+        arcname = posixpath.join(info_dir, 'EXTENSIONS')
+        wrapper = codecs.getreader('utf-8')
+        result = []
+        with ZipFile(pathname, 'r') as zf:
+            try:
+                with zf.open(arcname) as bf:
+                    wf = wrapper(bf)
+                    extensions = json.load(wf)
+                    cache = self._get_dylib_cache()
+                    prefix = cache.prefix_to_dir(pathname)
+                    cache_base = os.path.join(cache.base, prefix)
+                    if not os.path.isdir(cache_base):
+                        os.makedirs(cache_base)
+                    for name, relpath in extensions.items():
+                        dest = os.path.join(cache_base, convert_path(relpath))
+                        if not os.path.exists(dest):
+                            extract = True
+                        else:
+                            file_time = os.stat(dest).st_mtime
+                            file_time = datetime.datetime.fromtimestamp(file_time)
+                            info = zf.getinfo(relpath)
+                            wheel_time = datetime.datetime(*info.date_time)
+                            extract = wheel_time > file_time
+                        if extract:
+                            zf.extract(relpath, cache_base)
+                        result.append((name, dest))
+            except KeyError:
+                pass
+        return result
+
+    def is_compatible(self):
+        """
+        Determine if a wheel is compatible with the running system.
+        """
+        return is_compatible(self)
+
+    def is_mountable(self):
+        """
+        Determine if a wheel is asserted as mountable by its metadata.
+        """
+        return True # for now - metadata details TBD
+
+    def mount(self, append=False):
+        pathname = os.path.abspath(os.path.join(self.dirname, self.filename))
+        if not self.is_compatible():
+            msg = 'Wheel %s not compatible with this Python.' % pathname
+            raise DistlibException(msg)
+        if not self.is_mountable():
+            msg = 'Wheel %s is marked as not mountable.' % pathname
+            raise DistlibException(msg)
+        if pathname in sys.path:
+            logger.debug('%s already in path', pathname)
+        else:
+            if append:
+                sys.path.append(pathname)
+            else:
+                sys.path.insert(0, pathname)
+            extensions = self._get_extensions()
+            if extensions:
+                if _hook not in sys.meta_path:
+                    sys.meta_path.append(_hook)
+                _hook.add(pathname, extensions)
+
+    def unmount(self):
+        pathname = os.path.abspath(os.path.join(self.dirname, self.filename))
+        if pathname not in sys.path:
+            logger.debug('%s not in path', pathname)
+        else:
+            sys.path.remove(pathname)
+            if pathname in _hook.impure_wheels:
+                _hook.remove(pathname)
+            if not _hook.impure_wheels:
+                if _hook in sys.meta_path:
+                    sys.meta_path.remove(_hook)
+
+    def verify(self):
+        pathname = os.path.join(self.dirname, self.filename)
+        name_ver = '%s-%s' % (self.name, self.version)
+        data_dir = '%s.data' % name_ver
+        info_dir = '%s.dist-info' % name_ver
+
+        metadata_name = posixpath.join(info_dir, LEGACY_METADATA_FILENAME)
+        wheel_metadata_name = posixpath.join(info_dir, 'WHEEL')
+        record_name = posixpath.join(info_dir, 'RECORD')
+
+        wrapper = codecs.getreader('utf-8')
+
+        with ZipFile(pathname, 'r') as zf:
+            with zf.open(wheel_metadata_name) as bwf:
+                wf = wrapper(bwf)
+                message = message_from_file(wf)
+            wv = message['Wheel-Version'].split('.', 1)
+            file_version = tuple([int(i) for i in wv])
+            # TODO version verification
+
+            records = {}
+            with zf.open(record_name) as bf:
+                with CSVReader(stream=bf) as reader:
+                    for row in reader:
+                        p = row[0]
+                        records[p] = row
+
+            for zinfo in zf.infolist():
+                arcname = zinfo.filename
+                if isinstance(arcname, text_type):
+                    u_arcname = arcname
+                else:
+                    u_arcname = arcname.decode('utf-8')
+                # See issue #115: some wheels have .. in their entries, but
+                # in the filename ... e.g. __main__..py ! So the check is
+                # updated to look for .. in the directory portions
+                p = u_arcname.split('/')
+                if '..' in p:
+                    raise DistlibException('invalid entry in '
+                                           'wheel: %r' % u_arcname)
+
+                if self.skip_entry(u_arcname):
+                    continue
+                row = records[u_arcname]
+                if row[2] and str(zinfo.file_size) != row[2]:
+                    raise DistlibException('size mismatch for '
+                                           '%s' % u_arcname)
+                if row[1]:
+                    kind, value = row[1].split('=', 1)
+                    with zf.open(arcname) as bf:
+                        data = bf.read()
+                    _, digest = self.get_hash(data, kind)
+                    if digest != value:
+                        raise DistlibException('digest mismatch for '
+                                               '%s' % arcname)
+
+    def update(self, modifier, dest_dir=None, **kwargs):
+        """
+        Update the contents of a wheel in a generic way. The modifier should
+        be a callable which expects a dictionary argument: its keys are
+        archive-entry paths, and its values are absolute filesystem paths
+        where the contents the corresponding archive entries can be found. The
+        modifier is free to change the contents of the files pointed to, add
+        new entries and remove entries, before returning. This method will
+        extract the entire contents of the wheel to a temporary location, call
+        the modifier, and then use the passed (and possibly updated)
+        dictionary to write a new wheel. If ``dest_dir`` is specified, the new
+        wheel is written there -- otherwise, the original wheel is overwritten.
+
+        The modifier should return True if it updated the wheel, else False.
+        This method returns the same value the modifier returns.
+        """
+
+        def get_version(path_map, info_dir):
+            version = path = None
+            key = '%s/%s' % (info_dir, LEGACY_METADATA_FILENAME)
+            if key not in path_map:
+                key = '%s/PKG-INFO' % info_dir
+            if key in path_map:
+                path = path_map[key]
+                version = Metadata(path=path).version
+            return version, path
+
+        def update_version(version, path):
+            updated = None
+            try:
+                v = NormalizedVersion(version)
+                i = version.find('-')
+                if i < 0:
+                    updated = '%s+1' % version
+                else:
+                    parts = [int(s) for s in version[i + 1:].split('.')]
+                    parts[-1] += 1
+                    updated = '%s+%s' % (version[:i],
+                                         '.'.join(str(i) for i in parts))
+            except UnsupportedVersionError:
+                logger.debug('Cannot update non-compliant (PEP-440) '
+                             'version %r', version)
+            if updated:
+                md = Metadata(path=path)
+                md.version = updated
+                legacy = path.endswith(LEGACY_METADATA_FILENAME)
+                md.write(path=path, legacy=legacy)
+                logger.debug('Version updated from %r to %r', version,
+                             updated)
+
+        pathname = os.path.join(self.dirname, self.filename)
+        name_ver = '%s-%s' % (self.name, self.version)
+        info_dir = '%s.dist-info' % name_ver
+        record_name = posixpath.join(info_dir, 'RECORD')
+        with tempdir() as workdir:
+            with ZipFile(pathname, 'r') as zf:
+                path_map = {}
+                for zinfo in zf.infolist():
+                    arcname = zinfo.filename
+                    if isinstance(arcname, text_type):
+                        u_arcname = arcname
+                    else:
+                        u_arcname = arcname.decode('utf-8')
+                    if u_arcname == record_name:
+                        continue
+                    if '..' in u_arcname:
+                        raise DistlibException('invalid entry in '
+                                               'wheel: %r' % u_arcname)
+                    zf.extract(zinfo, workdir)
+                    path = os.path.join(workdir, convert_path(u_arcname))
+                    path_map[u_arcname] = path
+
+            # Remember the version.
+            original_version, _ = get_version(path_map, info_dir)
+            # Files extracted. Call the modifier.
+            modified = modifier(path_map, **kwargs)
+            if modified:
+                # Something changed - need to build a new wheel.
+                current_version, path = get_version(path_map, info_dir)
+                if current_version and (current_version == original_version):
+                    # Add or update local version to signify changes.
+                    update_version(current_version, path)
+                # Decide where the new wheel goes.
+                if dest_dir is None:
+                    fd, newpath = tempfile.mkstemp(suffix='.whl',
+                                                   prefix='wheel-update-',
+                                                   dir=workdir)
+                    os.close(fd)
+                else:
+                    if not os.path.isdir(dest_dir):
+                        raise DistlibException('Not a directory: %r' % dest_dir)
+                    newpath = os.path.join(dest_dir, self.filename)
+                archive_paths = list(path_map.items())
+                distinfo = os.path.join(workdir, info_dir)
+                info = distinfo, info_dir
+                self.write_records(info, workdir, archive_paths)
+                self.build_zip(newpath, archive_paths)
+                if dest_dir is None:
+                    shutil.copyfile(newpath, pathname)
+        return modified
+
+def compatible_tags():
+    """
+    Return (pyver, abi, arch) tuples compatible with this Python.
+    """
+    versions = [VER_SUFFIX]
+    major = VER_SUFFIX[0]
+    for minor in range(sys.version_info[1] - 1, - 1, -1):
+        versions.append(''.join([major, str(minor)]))
+
+    abis = []
+    for suffix, _, _ in imp.get_suffixes():
+        if suffix.startswith('.abi'):
+            abis.append(suffix.split('.', 2)[1])
+    abis.sort()
+    if ABI != 'none':
+        abis.insert(0, ABI)
+    abis.append('none')
+    result = []
+
+    arches = [ARCH]
+    if sys.platform == 'darwin':
+        m = re.match(r'(\w+)_(\d+)_(\d+)_(\w+)$', ARCH)
+        if m:
+            name, major, minor, arch = m.groups()
+            minor = int(minor)
+            matches = [arch]
+            if arch in ('i386', 'ppc'):
+                matches.append('fat')
+            if arch in ('i386', 'ppc', 'x86_64'):
+                matches.append('fat3')
+            if arch in ('ppc64', 'x86_64'):
+                matches.append('fat64')
+            if arch in ('i386', 'x86_64'):
+                matches.append('intel')
+            if arch in ('i386', 'x86_64', 'intel', 'ppc', 'ppc64'):
+                matches.append('universal')
+            while minor >= 0:
+                for match in matches:
+                    s = '%s_%s_%s_%s' % (name, major, minor, match)
+                    if s != ARCH:   # already there
+                        arches.append(s)
+                minor -= 1
+
+    # Most specific - our Python version, ABI and arch
+    for abi in abis:
+        for arch in arches:
+            result.append((''.join((IMP_PREFIX, versions[0])), abi, arch))
+
+    # where no ABI / arch dependency, but IMP_PREFIX dependency
+    for i, version in enumerate(versions):
+        result.append((''.join((IMP_PREFIX, version)), 'none', 'any'))
+        if i == 0:
+            result.append((''.join((IMP_PREFIX, version[0])), 'none', 'any'))
+
+    # no IMP_PREFIX, ABI or arch dependency
+    for i, version in enumerate(versions):
+        result.append((''.join(('py', version)), 'none', 'any'))
+        if i == 0:
+            result.append((''.join(('py', version[0])), 'none', 'any'))
+    return set(result)
+
+
+COMPATIBLE_TAGS = compatible_tags()
+
+del compatible_tags
+
+
+def is_compatible(wheel, tags=None):
+    if not isinstance(wheel, Wheel):
+        wheel = Wheel(wheel)    # assume it's a filename
+    result = False
+    if tags is None:
+        tags = COMPATIBLE_TAGS
+    for ver, abi, arch in tags:
+        if ver in wheel.pyver and abi in wheel.abi and arch in wheel.arch:
+            result = True
+            break
+    return result
diff --git a/venv/Lib/site-packages/pip/_vendor/distro.py b/venv/Lib/site-packages/pip/_vendor/distro.py
new file mode 100644
index 000000000..0611b62a3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/distro.py
@@ -0,0 +1,1230 @@
+# Copyright 2015,2016,2017 Nir Cohen
+#
+# 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.
+
+"""
+The ``distro`` package (``distro`` stands for Linux Distribution) provides
+information about the Linux distribution it runs on, such as a reliable
+machine-readable distro ID, or version information.
+
+It is the recommended replacement for Python's original
+:py:func:`platform.linux_distribution` function, but it provides much more
+functionality. An alternative implementation became necessary because Python
+3.5 deprecated this function, and Python 3.8 will remove it altogether.
+Its predecessor function :py:func:`platform.dist` was already
+deprecated since Python 2.6 and will also be removed in Python 3.8.
+Still, there are many cases in which access to OS distribution information
+is needed. See `Python issue 1322 <https://bugs.python.org/issue1322>`_ for
+more information.
+"""
+
+import os
+import re
+import sys
+import json
+import shlex
+import logging
+import argparse
+import subprocess
+
+
+_UNIXCONFDIR = os.environ.get('UNIXCONFDIR', '/etc')
+_OS_RELEASE_BASENAME = 'os-release'
+
+#: Translation table for normalizing the "ID" attribute defined in os-release
+#: files, for use by the :func:`distro.id` method.
+#:
+#: * Key: Value as defined in the os-release file, translated to lower case,
+#:   with blanks translated to underscores.
+#:
+#: * Value: Normalized value.
+NORMALIZED_OS_ID = {
+    'ol': 'oracle',  # Oracle Linux
+}
+
+#: Translation table for normalizing the "Distributor ID" attribute returned by
+#: the lsb_release command, for use by the :func:`distro.id` method.
+#:
+#: * Key: Value as returned by the lsb_release command, translated to lower
+#:   case, with blanks translated to underscores.
+#:
+#: * Value: Normalized value.
+NORMALIZED_LSB_ID = {
+    'enterpriseenterpriseas': 'oracle',  # Oracle Enterprise Linux 4
+    'enterpriseenterpriseserver': 'oracle',  # Oracle Linux 5
+    'redhatenterpriseworkstation': 'rhel',  # RHEL 6, 7 Workstation
+    'redhatenterpriseserver': 'rhel',  # RHEL 6, 7 Server
+    'redhatenterprisecomputenode': 'rhel',  # RHEL 6 ComputeNode
+}
+
+#: Translation table for normalizing the distro ID derived from the file name
+#: of distro release files, for use by the :func:`distro.id` method.
+#:
+#: * Key: Value as derived from the file name of a distro release file,
+#:   translated to lower case, with blanks translated to underscores.
+#:
+#: * Value: Normalized value.
+NORMALIZED_DISTRO_ID = {
+    'redhat': 'rhel',  # RHEL 6.x, 7.x
+}
+
+# Pattern for content of distro release file (reversed)
+_DISTRO_RELEASE_CONTENT_REVERSED_PATTERN = re.compile(
+    r'(?:[^)]*\)(.*)\()? *(?:STL )?([\d.+\-a-z]*\d) *(?:esaeler *)?(.+)')
+
+# Pattern for base file name of distro release file
+_DISTRO_RELEASE_BASENAME_PATTERN = re.compile(
+    r'(\w+)[-_](release|version)$')
+
+# Base file names to be ignored when searching for distro release file
+_DISTRO_RELEASE_IGNORE_BASENAMES = (
+    'debian_version',
+    'lsb-release',
+    'oem-release',
+    _OS_RELEASE_BASENAME,
+    'system-release',
+    'plesk-release',
+)
+
+
+def linux_distribution(full_distribution_name=True):
+    """
+    Return information about the current OS distribution as a tuple
+    ``(id_name, version, codename)`` with items as follows:
+
+    * ``id_name``:  If *full_distribution_name* is false, the result of
+      :func:`distro.id`. Otherwise, the result of :func:`distro.name`.
+
+    * ``version``:  The result of :func:`distro.version`.
+
+    * ``codename``:  The result of :func:`distro.codename`.
+
+    The interface of this function is compatible with the original
+    :py:func:`platform.linux_distribution` function, supporting a subset of
+    its parameters.
+
+    The data it returns may not exactly be the same, because it uses more data
+    sources than the original function, and that may lead to different data if
+    the OS distribution is not consistent across multiple data sources it
+    provides (there are indeed such distributions ...).
+
+    Another reason for differences is the fact that the :func:`distro.id`
+    method normalizes the distro ID string to a reliable machine-readable value
+    for a number of popular OS distributions.
+    """
+    return _distro.linux_distribution(full_distribution_name)
+
+
+def id():
+    """
+    Return the distro ID of the current distribution, as a
+    machine-readable string.
+
+    For a number of OS distributions, the returned distro ID value is
+    *reliable*, in the sense that it is documented and that it does not change
+    across releases of the distribution.
+
+    This package maintains the following reliable distro ID values:
+
+    ==============  =========================================
+    Distro ID       Distribution
+    ==============  =========================================
+    "ubuntu"        Ubuntu
+    "debian"        Debian
+    "rhel"          RedHat Enterprise Linux
+    "centos"        CentOS
+    "fedora"        Fedora
+    "sles"          SUSE Linux Enterprise Server
+    "opensuse"      openSUSE
+    "amazon"        Amazon Linux
+    "arch"          Arch Linux
+    "cloudlinux"    CloudLinux OS
+    "exherbo"       Exherbo Linux
+    "gentoo"        GenToo Linux
+    "ibm_powerkvm"  IBM PowerKVM
+    "kvmibm"        KVM for IBM z Systems
+    "linuxmint"     Linux Mint
+    "mageia"        Mageia
+    "mandriva"      Mandriva Linux
+    "parallels"     Parallels
+    "pidora"        Pidora
+    "raspbian"      Raspbian
+    "oracle"        Oracle Linux (and Oracle Enterprise Linux)
+    "scientific"    Scientific Linux
+    "slackware"     Slackware
+    "xenserver"     XenServer
+    "openbsd"       OpenBSD
+    "netbsd"        NetBSD
+    "freebsd"       FreeBSD
+    "midnightbsd"   MidnightBSD
+    ==============  =========================================
+
+    If you have a need to get distros for reliable IDs added into this set,
+    or if you find that the :func:`distro.id` function returns a different
+    distro ID for one of the listed distros, please create an issue in the
+    `distro issue tracker`_.
+
+    **Lookup hierarchy and transformations:**
+
+    First, the ID is obtained from the following sources, in the specified
+    order. The first available and non-empty value is used:
+
+    * the value of the "ID" attribute of the os-release file,
+
+    * the value of the "Distributor ID" attribute returned by the lsb_release
+      command,
+
+    * the first part of the file name of the distro release file,
+
+    The so determined ID value then passes the following transformations,
+    before it is returned by this method:
+
+    * it is translated to lower case,
+
+    * blanks (which should not be there anyway) are translated to underscores,
+
+    * a normalization of the ID is performed, based upon
+      `normalization tables`_. The purpose of this normalization is to ensure
+      that the ID is as reliable as possible, even across incompatible changes
+      in the OS distributions. A common reason for an incompatible change is
+      the addition of an os-release file, or the addition of the lsb_release
+      command, with ID values that differ from what was previously determined
+      from the distro release file name.
+    """
+    return _distro.id()
+
+
+def name(pretty=False):
+    """
+    Return the name of the current OS distribution, as a human-readable
+    string.
+
+    If *pretty* is false, the name is returned without version or codename.
+    (e.g. "CentOS Linux")
+
+    If *pretty* is true, the version and codename are appended.
+    (e.g. "CentOS Linux 7.1.1503 (Core)")
+
+    **Lookup hierarchy:**
+
+    The name is obtained from the following sources, in the specified order.
+    The first available and non-empty value is used:
+
+    * If *pretty* is false:
+
+      - the value of the "NAME" attribute of the os-release file,
+
+      - the value of the "Distributor ID" attribute returned by the lsb_release
+        command,
+
+      - the value of the "<name>" field of the distro release file.
+
+    * If *pretty* is true:
+
+      - the value of the "PRETTY_NAME" attribute of the os-release file,
+
+      - the value of the "Description" attribute returned by the lsb_release
+        command,
+
+      - the value of the "<name>" field of the distro release file, appended
+        with the value of the pretty version ("<version_id>" and "<codename>"
+        fields) of the distro release file, if available.
+    """
+    return _distro.name(pretty)
+
+
+def version(pretty=False, best=False):
+    """
+    Return the version of the current OS distribution, as a human-readable
+    string.
+
+    If *pretty* is false, the version is returned without codename (e.g.
+    "7.0").
+
+    If *pretty* is true, the codename in parenthesis is appended, if the
+    codename is non-empty (e.g. "7.0 (Maipo)").
+
+    Some distributions provide version numbers with different precisions in
+    the different sources of distribution information. Examining the different
+    sources in a fixed priority order does not always yield the most precise
+    version (e.g. for Debian 8.2, or CentOS 7.1).
+
+    The *best* parameter can be used to control the approach for the returned
+    version:
+
+    If *best* is false, the first non-empty version number in priority order of
+    the examined sources is returned.
+
+    If *best* is true, the most precise version number out of all examined
+    sources is returned.
+
+    **Lookup hierarchy:**
+
+    In all cases, the version number is obtained from the following sources.
+    If *best* is false, this order represents the priority order:
+
+    * the value of the "VERSION_ID" attribute of the os-release file,
+    * the value of the "Release" attribute returned by the lsb_release
+      command,
+    * the version number parsed from the "<version_id>" field of the first line
+      of the distro release file,
+    * the version number parsed from the "PRETTY_NAME" attribute of the
+      os-release file, if it follows the format of the distro release files.
+    * the version number parsed from the "Description" attribute returned by
+      the lsb_release command, if it follows the format of the distro release
+      files.
+    """
+    return _distro.version(pretty, best)
+
+
+def version_parts(best=False):
+    """
+    Return the version of the current OS distribution as a tuple
+    ``(major, minor, build_number)`` with items as follows:
+
+    * ``major``:  The result of :func:`distro.major_version`.
+
+    * ``minor``:  The result of :func:`distro.minor_version`.
+
+    * ``build_number``:  The result of :func:`distro.build_number`.
+
+    For a description of the *best* parameter, see the :func:`distro.version`
+    method.
+    """
+    return _distro.version_parts(best)
+
+
+def major_version(best=False):
+    """
+    Return the major version of the current OS distribution, as a string,
+    if provided.
+    Otherwise, the empty string is returned. The major version is the first
+    part of the dot-separated version string.
+
+    For a description of the *best* parameter, see the :func:`distro.version`
+    method.
+    """
+    return _distro.major_version(best)
+
+
+def minor_version(best=False):
+    """
+    Return the minor version of the current OS distribution, as a string,
+    if provided.
+    Otherwise, the empty string is returned. The minor version is the second
+    part of the dot-separated version string.
+
+    For a description of the *best* parameter, see the :func:`distro.version`
+    method.
+    """
+    return _distro.minor_version(best)
+
+
+def build_number(best=False):
+    """
+    Return the build number of the current OS distribution, as a string,
+    if provided.
+    Otherwise, the empty string is returned. The build number is the third part
+    of the dot-separated version string.
+
+    For a description of the *best* parameter, see the :func:`distro.version`
+    method.
+    """
+    return _distro.build_number(best)
+
+
+def like():
+    """
+    Return a space-separated list of distro IDs of distributions that are
+    closely related to the current OS distribution in regards to packaging
+    and programming interfaces, for example distributions the current
+    distribution is a derivative from.
+
+    **Lookup hierarchy:**
+
+    This information item is only provided by the os-release file.
+    For details, see the description of the "ID_LIKE" attribute in the
+    `os-release man page
+    <http://www.freedesktop.org/software/systemd/man/os-release.html>`_.
+    """
+    return _distro.like()
+
+
+def codename():
+    """
+    Return the codename for the release of the current OS distribution,
+    as a string.
+
+    If the distribution does not have a codename, an empty string is returned.
+
+    Note that the returned codename is not always really a codename. For
+    example, openSUSE returns "x86_64". This function does not handle such
+    cases in any special way and just returns the string it finds, if any.
+
+    **Lookup hierarchy:**
+
+    * the codename within the "VERSION" attribute of the os-release file, if
+      provided,
+
+    * the value of the "Codename" attribute returned by the lsb_release
+      command,
+
+    * the value of the "<codename>" field of the distro release file.
+    """
+    return _distro.codename()
+
+
+def info(pretty=False, best=False):
+    """
+    Return certain machine-readable information items about the current OS
+    distribution in a dictionary, as shown in the following example:
+
+    .. sourcecode:: python
+
+        {
+            'id': 'rhel',
+            'version': '7.0',
+            'version_parts': {
+                'major': '7',
+                'minor': '0',
+                'build_number': ''
+            },
+            'like': 'fedora',
+            'codename': 'Maipo'
+        }
+
+    The dictionary structure and keys are always the same, regardless of which
+    information items are available in the underlying data sources. The values
+    for the various keys are as follows:
+
+    * ``id``:  The result of :func:`distro.id`.
+
+    * ``version``:  The result of :func:`distro.version`.
+
+    * ``version_parts -> major``:  The result of :func:`distro.major_version`.
+
+    * ``version_parts -> minor``:  The result of :func:`distro.minor_version`.
+
+    * ``version_parts -> build_number``:  The result of
+      :func:`distro.build_number`.
+
+    * ``like``:  The result of :func:`distro.like`.
+
+    * ``codename``:  The result of :func:`distro.codename`.
+
+    For a description of the *pretty* and *best* parameters, see the
+    :func:`distro.version` method.
+    """
+    return _distro.info(pretty, best)
+
+
+def os_release_info():
+    """
+    Return a dictionary containing key-value pairs for the information items
+    from the os-release file data source of the current OS distribution.
+
+    See `os-release file`_ for details about these information items.
+    """
+    return _distro.os_release_info()
+
+
+def lsb_release_info():
+    """
+    Return a dictionary containing key-value pairs for the information items
+    from the lsb_release command data source of the current OS distribution.
+
+    See `lsb_release command output`_ for details about these information
+    items.
+    """
+    return _distro.lsb_release_info()
+
+
+def distro_release_info():
+    """
+    Return a dictionary containing key-value pairs for the information items
+    from the distro release file data source of the current OS distribution.
+
+    See `distro release file`_ for details about these information items.
+    """
+    return _distro.distro_release_info()
+
+
+def uname_info():
+    """
+    Return a dictionary containing key-value pairs for the information items
+    from the distro release file data source of the current OS distribution.
+    """
+    return _distro.uname_info()
+
+
+def os_release_attr(attribute):
+    """
+    Return a single named information item from the os-release file data source
+    of the current OS distribution.
+
+    Parameters:
+
+    * ``attribute`` (string): Key of the information item.
+
+    Returns:
+
+    * (string): Value of the information item, if the item exists.
+      The empty string, if the item does not exist.
+
+    See `os-release file`_ for details about these information items.
+    """
+    return _distro.os_release_attr(attribute)
+
+
+def lsb_release_attr(attribute):
+    """
+    Return a single named information item from the lsb_release command output
+    data source of the current OS distribution.
+
+    Parameters:
+
+    * ``attribute`` (string): Key of the information item.
+
+    Returns:
+
+    * (string): Value of the information item, if the item exists.
+      The empty string, if the item does not exist.
+
+    See `lsb_release command output`_ for details about these information
+    items.
+    """
+    return _distro.lsb_release_attr(attribute)
+
+
+def distro_release_attr(attribute):
+    """
+    Return a single named information item from the distro release file
+    data source of the current OS distribution.
+
+    Parameters:
+
+    * ``attribute`` (string): Key of the information item.
+
+    Returns:
+
+    * (string): Value of the information item, if the item exists.
+      The empty string, if the item does not exist.
+
+    See `distro release file`_ for details about these information items.
+    """
+    return _distro.distro_release_attr(attribute)
+
+
+def uname_attr(attribute):
+    """
+    Return a single named information item from the distro release file
+    data source of the current OS distribution.
+
+    Parameters:
+
+    * ``attribute`` (string): Key of the information item.
+
+    Returns:
+
+    * (string): Value of the information item, if the item exists.
+                The empty string, if the item does not exist.
+    """
+    return _distro.uname_attr(attribute)
+
+
+class cached_property(object):
+    """A version of @property which caches the value.  On access, it calls the
+    underlying function and sets the value in `__dict__` so future accesses
+    will not re-call the property.
+    """
+    def __init__(self, f):
+        self._fname = f.__name__
+        self._f = f
+
+    def __get__(self, obj, owner):
+        assert obj is not None, 'call {} on an instance'.format(self._fname)
+        ret = obj.__dict__[self._fname] = self._f(obj)
+        return ret
+
+
+class LinuxDistribution(object):
+    """
+    Provides information about a OS distribution.
+
+    This package creates a private module-global instance of this class with
+    default initialization arguments, that is used by the
+    `consolidated accessor functions`_ and `single source accessor functions`_.
+    By using default initialization arguments, that module-global instance
+    returns data about the current OS distribution (i.e. the distro this
+    package runs on).
+
+    Normally, it is not necessary to create additional instances of this class.
+    However, in situations where control is needed over the exact data sources
+    that are used, instances of this class can be created with a specific
+    distro release file, or a specific os-release file, or without invoking the
+    lsb_release command.
+    """
+
+    def __init__(self,
+                 include_lsb=True,
+                 os_release_file='',
+                 distro_release_file='',
+                 include_uname=True):
+        """
+        The initialization method of this class gathers information from the
+        available data sources, and stores that in private instance attributes.
+        Subsequent access to the information items uses these private instance
+        attributes, so that the data sources are read only once.
+
+        Parameters:
+
+        * ``include_lsb`` (bool): Controls whether the
+          `lsb_release command output`_ is included as a data source.
+
+          If the lsb_release command is not available in the program execution
+          path, the data source for the lsb_release command will be empty.
+
+        * ``os_release_file`` (string): The path name of the
+          `os-release file`_ that is to be used as a data source.
+
+          An empty string (the default) will cause the default path name to
+          be used (see `os-release file`_ for details).
+
+          If the specified or defaulted os-release file does not exist, the
+          data source for the os-release file will be empty.
+
+        * ``distro_release_file`` (string): The path name of the
+          `distro release file`_ that is to be used as a data source.
+
+          An empty string (the default) will cause a default search algorithm
+          to be used (see `distro release file`_ for details).
+
+          If the specified distro release file does not exist, or if no default
+          distro release file can be found, the data source for the distro
+          release file will be empty.
+
+        * ``include_uname`` (bool): Controls whether uname command output is
+          included as a data source. If the uname command is not available in
+          the program execution path the data source for the uname command will
+          be empty.
+
+        Public instance attributes:
+
+        * ``os_release_file`` (string): The path name of the
+          `os-release file`_ that is actually used as a data source. The
+          empty string if no distro release file is used as a data source.
+
+        * ``distro_release_file`` (string): The path name of the
+          `distro release file`_ that is actually used as a data source. The
+          empty string if no distro release file is used as a data source.
+
+        * ``include_lsb`` (bool): The result of the ``include_lsb`` parameter.
+          This controls whether the lsb information will be loaded.
+
+        * ``include_uname`` (bool): The result of the ``include_uname``
+          parameter. This controls whether the uname information will
+          be loaded.
+
+        Raises:
+
+        * :py:exc:`IOError`: Some I/O issue with an os-release file or distro
+          release file.
+
+        * :py:exc:`subprocess.CalledProcessError`: The lsb_release command had
+          some issue (other than not being available in the program execution
+          path).
+
+        * :py:exc:`UnicodeError`: A data source has unexpected characters or
+          uses an unexpected encoding.
+        """
+        self.os_release_file = os_release_file or \
+            os.path.join(_UNIXCONFDIR, _OS_RELEASE_BASENAME)
+        self.distro_release_file = distro_release_file or ''  # updated later
+        self.include_lsb = include_lsb
+        self.include_uname = include_uname
+
+    def __repr__(self):
+        """Return repr of all info
+        """
+        return \
+            "LinuxDistribution(" \
+            "os_release_file={self.os_release_file!r}, " \
+            "distro_release_file={self.distro_release_file!r}, " \
+            "include_lsb={self.include_lsb!r}, " \
+            "include_uname={self.include_uname!r}, " \
+            "_os_release_info={self._os_release_info!r}, " \
+            "_lsb_release_info={self._lsb_release_info!r}, " \
+            "_distro_release_info={self._distro_release_info!r}, " \
+            "_uname_info={self._uname_info!r})".format(
+                self=self)
+
+    def linux_distribution(self, full_distribution_name=True):
+        """
+        Return information about the OS distribution that is compatible
+        with Python's :func:`platform.linux_distribution`, supporting a subset
+        of its parameters.
+
+        For details, see :func:`distro.linux_distribution`.
+        """
+        return (
+            self.name() if full_distribution_name else self.id(),
+            self.version(),
+            self.codename()
+        )
+
+    def id(self):
+        """Return the distro ID of the OS distribution, as a string.
+
+        For details, see :func:`distro.id`.
+        """
+        def normalize(distro_id, table):
+            distro_id = distro_id.lower().replace(' ', '_')
+            return table.get(distro_id, distro_id)
+
+        distro_id = self.os_release_attr('id')
+        if distro_id:
+            return normalize(distro_id, NORMALIZED_OS_ID)
+
+        distro_id = self.lsb_release_attr('distributor_id')
+        if distro_id:
+            return normalize(distro_id, NORMALIZED_LSB_ID)
+
+        distro_id = self.distro_release_attr('id')
+        if distro_id:
+            return normalize(distro_id, NORMALIZED_DISTRO_ID)
+
+        distro_id = self.uname_attr('id')
+        if distro_id:
+            return normalize(distro_id, NORMALIZED_DISTRO_ID)
+
+        return ''
+
+    def name(self, pretty=False):
+        """
+        Return the name of the OS distribution, as a string.
+
+        For details, see :func:`distro.name`.
+        """
+        name = self.os_release_attr('name') \
+            or self.lsb_release_attr('distributor_id') \
+            or self.distro_release_attr('name') \
+            or self.uname_attr('name')
+        if pretty:
+            name = self.os_release_attr('pretty_name') \
+                or self.lsb_release_attr('description')
+            if not name:
+                name = self.distro_release_attr('name') \
+                       or self.uname_attr('name')
+                version = self.version(pretty=True)
+                if version:
+                    name = name + ' ' + version
+        return name or ''
+
+    def version(self, pretty=False, best=False):
+        """
+        Return the version of the OS distribution, as a string.
+
+        For details, see :func:`distro.version`.
+        """
+        versions = [
+            self.os_release_attr('version_id'),
+            self.lsb_release_attr('release'),
+            self.distro_release_attr('version_id'),
+            self._parse_distro_release_content(
+                self.os_release_attr('pretty_name')).get('version_id', ''),
+            self._parse_distro_release_content(
+                self.lsb_release_attr('description')).get('version_id', ''),
+            self.uname_attr('release')
+        ]
+        version = ''
+        if best:
+            # This algorithm uses the last version in priority order that has
+            # the best precision. If the versions are not in conflict, that
+            # does not matter; otherwise, using the last one instead of the
+            # first one might be considered a surprise.
+            for v in versions:
+                if v.count(".") > version.count(".") or version == '':
+                    version = v
+        else:
+            for v in versions:
+                if v != '':
+                    version = v
+                    break
+        if pretty and version and self.codename():
+            version = '{0} ({1})'.format(version, self.codename())
+        return version
+
+    def version_parts(self, best=False):
+        """
+        Return the version of the OS distribution, as a tuple of version
+        numbers.
+
+        For details, see :func:`distro.version_parts`.
+        """
+        version_str = self.version(best=best)
+        if version_str:
+            version_regex = re.compile(r'(\d+)\.?(\d+)?\.?(\d+)?')
+            matches = version_regex.match(version_str)
+            if matches:
+                major, minor, build_number = matches.groups()
+                return major, minor or '', build_number or ''
+        return '', '', ''
+
+    def major_version(self, best=False):
+        """
+        Return the major version number of the current distribution.
+
+        For details, see :func:`distro.major_version`.
+        """
+        return self.version_parts(best)[0]
+
+    def minor_version(self, best=False):
+        """
+        Return the minor version number of the current distribution.
+
+        For details, see :func:`distro.minor_version`.
+        """
+        return self.version_parts(best)[1]
+
+    def build_number(self, best=False):
+        """
+        Return the build number of the current distribution.
+
+        For details, see :func:`distro.build_number`.
+        """
+        return self.version_parts(best)[2]
+
+    def like(self):
+        """
+        Return the IDs of distributions that are like the OS distribution.
+
+        For details, see :func:`distro.like`.
+        """
+        return self.os_release_attr('id_like') or ''
+
+    def codename(self):
+        """
+        Return the codename of the OS distribution.
+
+        For details, see :func:`distro.codename`.
+        """
+        try:
+            # Handle os_release specially since distros might purposefully set
+            # this to empty string to have no codename
+            return self._os_release_info['codename']
+        except KeyError:
+            return self.lsb_release_attr('codename') \
+                or self.distro_release_attr('codename') \
+                or ''
+
+    def info(self, pretty=False, best=False):
+        """
+        Return certain machine-readable information about the OS
+        distribution.
+
+        For details, see :func:`distro.info`.
+        """
+        return dict(
+            id=self.id(),
+            version=self.version(pretty, best),
+            version_parts=dict(
+                major=self.major_version(best),
+                minor=self.minor_version(best),
+                build_number=self.build_number(best)
+            ),
+            like=self.like(),
+            codename=self.codename(),
+        )
+
+    def os_release_info(self):
+        """
+        Return a dictionary containing key-value pairs for the information
+        items from the os-release file data source of the OS distribution.
+
+        For details, see :func:`distro.os_release_info`.
+        """
+        return self._os_release_info
+
+    def lsb_release_info(self):
+        """
+        Return a dictionary containing key-value pairs for the information
+        items from the lsb_release command data source of the OS
+        distribution.
+
+        For details, see :func:`distro.lsb_release_info`.
+        """
+        return self._lsb_release_info
+
+    def distro_release_info(self):
+        """
+        Return a dictionary containing key-value pairs for the information
+        items from the distro release file data source of the OS
+        distribution.
+
+        For details, see :func:`distro.distro_release_info`.
+        """
+        return self._distro_release_info
+
+    def uname_info(self):
+        """
+        Return a dictionary containing key-value pairs for the information
+        items from the uname command data source of the OS distribution.
+
+        For details, see :func:`distro.uname_info`.
+        """
+        return self._uname_info
+
+    def os_release_attr(self, attribute):
+        """
+        Return a single named information item from the os-release file data
+        source of the OS distribution.
+
+        For details, see :func:`distro.os_release_attr`.
+        """
+        return self._os_release_info.get(attribute, '')
+
+    def lsb_release_attr(self, attribute):
+        """
+        Return a single named information item from the lsb_release command
+        output data source of the OS distribution.
+
+        For details, see :func:`distro.lsb_release_attr`.
+        """
+        return self._lsb_release_info.get(attribute, '')
+
+    def distro_release_attr(self, attribute):
+        """
+        Return a single named information item from the distro release file
+        data source of the OS distribution.
+
+        For details, see :func:`distro.distro_release_attr`.
+        """
+        return self._distro_release_info.get(attribute, '')
+
+    def uname_attr(self, attribute):
+        """
+        Return a single named information item from the uname command
+        output data source of the OS distribution.
+
+        For details, see :func:`distro.uname_release_attr`.
+        """
+        return self._uname_info.get(attribute, '')
+
+    @cached_property
+    def _os_release_info(self):
+        """
+        Get the information items from the specified os-release file.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        if os.path.isfile(self.os_release_file):
+            with open(self.os_release_file) as release_file:
+                return self._parse_os_release_content(release_file)
+        return {}
+
+    @staticmethod
+    def _parse_os_release_content(lines):
+        """
+        Parse the lines of an os-release file.
+
+        Parameters:
+
+        * lines: Iterable through the lines in the os-release file.
+                 Each line must be a unicode string or a UTF-8 encoded byte
+                 string.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        props = {}
+        lexer = shlex.shlex(lines, posix=True)
+        lexer.whitespace_split = True
+
+        # The shlex module defines its `wordchars` variable using literals,
+        # making it dependent on the encoding of the Python source file.
+        # In Python 2.6 and 2.7, the shlex source file is encoded in
+        # 'iso-8859-1', and the `wordchars` variable is defined as a byte
+        # string. This causes a UnicodeDecodeError to be raised when the
+        # parsed content is a unicode object. The following fix resolves that
+        # (... but it should be fixed in shlex...):
+        if sys.version_info[0] == 2 and isinstance(lexer.wordchars, bytes):
+            lexer.wordchars = lexer.wordchars.decode('iso-8859-1')
+
+        tokens = list(lexer)
+        for token in tokens:
+            # At this point, all shell-like parsing has been done (i.e.
+            # comments processed, quotes and backslash escape sequences
+            # processed, multi-line values assembled, trailing newlines
+            # stripped, etc.), so the tokens are now either:
+            # * variable assignments: var=value
+            # * commands or their arguments (not allowed in os-release)
+            if '=' in token:
+                k, v = token.split('=', 1)
+                props[k.lower()] = v
+            else:
+                # Ignore any tokens that are not variable assignments
+                pass
+
+        if 'version_codename' in props:
+            # os-release added a version_codename field.  Use that in
+            # preference to anything else Note that some distros purposefully
+            # do not have code names.  They should be setting
+            # version_codename=""
+            props['codename'] = props['version_codename']
+        elif 'ubuntu_codename' in props:
+            # Same as above but a non-standard field name used on older Ubuntus
+            props['codename'] = props['ubuntu_codename']
+        elif 'version' in props:
+            # If there is no version_codename, parse it from the version
+            codename = re.search(r'(\(\D+\))|,(\s+)?\D+', props['version'])
+            if codename:
+                codename = codename.group()
+                codename = codename.strip('()')
+                codename = codename.strip(',')
+                codename = codename.strip()
+                # codename appears within paranthese.
+                props['codename'] = codename
+
+        return props
+
+    @cached_property
+    def _lsb_release_info(self):
+        """
+        Get the information items from the lsb_release command output.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        if not self.include_lsb:
+            return {}
+        with open(os.devnull, 'w') as devnull:
+            try:
+                cmd = ('lsb_release', '-a')
+                stdout = subprocess.check_output(cmd, stderr=devnull)
+            except OSError:  # Command not found
+                return {}
+        content = self._to_str(stdout).splitlines()
+        return self._parse_lsb_release_content(content)
+
+    @staticmethod
+    def _parse_lsb_release_content(lines):
+        """
+        Parse the output of the lsb_release command.
+
+        Parameters:
+
+        * lines: Iterable through the lines of the lsb_release output.
+                 Each line must be a unicode string or a UTF-8 encoded byte
+                 string.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        props = {}
+        for line in lines:
+            kv = line.strip('\n').split(':', 1)
+            if len(kv) != 2:
+                # Ignore lines without colon.
+                continue
+            k, v = kv
+            props.update({k.replace(' ', '_').lower(): v.strip()})
+        return props
+
+    @cached_property
+    def _uname_info(self):
+        with open(os.devnull, 'w') as devnull:
+            try:
+                cmd = ('uname', '-rs')
+                stdout = subprocess.check_output(cmd, stderr=devnull)
+            except OSError:
+                return {}
+        content = self._to_str(stdout).splitlines()
+        return self._parse_uname_content(content)
+
+    @staticmethod
+    def _parse_uname_content(lines):
+        props = {}
+        match = re.search(r'^([^\s]+)\s+([\d\.]+)', lines[0].strip())
+        if match:
+            name, version = match.groups()
+
+            # This is to prevent the Linux kernel version from
+            # appearing as the 'best' version on otherwise
+            # identifiable distributions.
+            if name == 'Linux':
+                return {}
+            props['id'] = name.lower()
+            props['name'] = name
+            props['release'] = version
+        return props
+
+    @staticmethod
+    def _to_str(text):
+        encoding = sys.getfilesystemencoding()
+        encoding = 'utf-8' if encoding == 'ascii' else encoding
+
+        if sys.version_info[0] >= 3:
+            if isinstance(text, bytes):
+                return text.decode(encoding)
+        else:
+            if isinstance(text, unicode):  # noqa
+                return text.encode(encoding)
+
+        return text
+
+    @cached_property
+    def _distro_release_info(self):
+        """
+        Get the information items from the specified distro release file.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        if self.distro_release_file:
+            # If it was specified, we use it and parse what we can, even if
+            # its file name or content does not match the expected pattern.
+            distro_info = self._parse_distro_release_file(
+                self.distro_release_file)
+            basename = os.path.basename(self.distro_release_file)
+            # The file name pattern for user-specified distro release files
+            # is somewhat more tolerant (compared to when searching for the
+            # file), because we want to use what was specified as best as
+            # possible.
+            match = _DISTRO_RELEASE_BASENAME_PATTERN.match(basename)
+            if 'name' in distro_info \
+               and 'cloudlinux' in distro_info['name'].lower():
+                distro_info['id'] = 'cloudlinux'
+            elif match:
+                distro_info['id'] = match.group(1)
+            return distro_info
+        else:
+            try:
+                basenames = os.listdir(_UNIXCONFDIR)
+                # We sort for repeatability in cases where there are multiple
+                # distro specific files; e.g. CentOS, Oracle, Enterprise all
+                # containing `redhat-release` on top of their own.
+                basenames.sort()
+            except OSError:
+                # This may occur when /etc is not readable but we can't be
+                # sure about the *-release files. Check common entries of
+                # /etc for information. If they turn out to not be there the
+                # error is handled in `_parse_distro_release_file()`.
+                basenames = ['SuSE-release',
+                             'arch-release',
+                             'base-release',
+                             'centos-release',
+                             'fedora-release',
+                             'gentoo-release',
+                             'mageia-release',
+                             'mandrake-release',
+                             'mandriva-release',
+                             'mandrivalinux-release',
+                             'manjaro-release',
+                             'oracle-release',
+                             'redhat-release',
+                             'sl-release',
+                             'slackware-version']
+            for basename in basenames:
+                if basename in _DISTRO_RELEASE_IGNORE_BASENAMES:
+                    continue
+                match = _DISTRO_RELEASE_BASENAME_PATTERN.match(basename)
+                if match:
+                    filepath = os.path.join(_UNIXCONFDIR, basename)
+                    distro_info = self._parse_distro_release_file(filepath)
+                    if 'name' in distro_info:
+                        # The name is always present if the pattern matches
+                        self.distro_release_file = filepath
+                        distro_info['id'] = match.group(1)
+                        if 'cloudlinux' in distro_info['name'].lower():
+                            distro_info['id'] = 'cloudlinux'
+                        return distro_info
+            return {}
+
+    def _parse_distro_release_file(self, filepath):
+        """
+        Parse a distro release file.
+
+        Parameters:
+
+        * filepath: Path name of the distro release file.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        try:
+            with open(filepath) as fp:
+                # Only parse the first line. For instance, on SLES there
+                # are multiple lines. We don't want them...
+                return self._parse_distro_release_content(fp.readline())
+        except (OSError, IOError):
+            # Ignore not being able to read a specific, seemingly version
+            # related file.
+            # See https://github.com/nir0s/distro/issues/162
+            return {}
+
+    @staticmethod
+    def _parse_distro_release_content(line):
+        """
+        Parse a line from a distro release file.
+
+        Parameters:
+        * line: Line from the distro release file. Must be a unicode string
+                or a UTF-8 encoded byte string.
+
+        Returns:
+            A dictionary containing all information items.
+        """
+        matches = _DISTRO_RELEASE_CONTENT_REVERSED_PATTERN.match(
+            line.strip()[::-1])
+        distro_info = {}
+        if matches:
+            # regexp ensures non-None
+            distro_info['name'] = matches.group(3)[::-1]
+            if matches.group(2):
+                distro_info['version_id'] = matches.group(2)[::-1]
+            if matches.group(1):
+                distro_info['codename'] = matches.group(1)[::-1]
+        elif line:
+            distro_info['name'] = line.strip()
+        return distro_info
+
+
+_distro = LinuxDistribution()
+
+
+def main():
+    logger = logging.getLogger(__name__)
+    logger.setLevel(logging.DEBUG)
+    logger.addHandler(logging.StreamHandler(sys.stdout))
+
+    parser = argparse.ArgumentParser(description="OS distro info tool")
+    parser.add_argument(
+        '--json',
+        '-j',
+        help="Output in machine readable format",
+        action="store_true")
+    args = parser.parse_args()
+
+    if args.json:
+        logger.info(json.dumps(info(), indent=4, sort_keys=True))
+    else:
+        logger.info('Name: %s', name(pretty=True))
+        distribution_version = version(pretty=True)
+        logger.info('Version: %s', distribution_version)
+        distribution_codename = codename()
+        logger.info('Codename: %s', distribution_codename)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/__init__.py
new file mode 100644
index 000000000..d1d82f157
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/__init__.py
@@ -0,0 +1,35 @@
+"""
+HTML parsing library based on the `WHATWG HTML specification
+<https://whatwg.org/html>`_. The parser is designed to be compatible with
+existing HTML found in the wild and implements well-defined error recovery that
+is largely compatible with modern desktop web browsers.
+
+Example usage::
+
+    from pip._vendor import html5lib
+    with open("my_document.html", "rb") as f:
+        tree = html5lib.parse(f)
+
+For convenience, this module re-exports the following names:
+
+* :func:`~.html5parser.parse`
+* :func:`~.html5parser.parseFragment`
+* :class:`~.html5parser.HTMLParser`
+* :func:`~.treebuilders.getTreeBuilder`
+* :func:`~.treewalkers.getTreeWalker`
+* :func:`~.serializer.serialize`
+"""
+
+from __future__ import absolute_import, division, unicode_literals
+
+from .html5parser import HTMLParser, parse, parseFragment
+from .treebuilders import getTreeBuilder
+from .treewalkers import getTreeWalker
+from .serializer import serialize
+
+__all__ = ["HTMLParser", "parse", "parseFragment", "getTreeBuilder",
+           "getTreeWalker", "serialize"]
+
+# this has to be at the top level, see how setup.py parses this
+#: Distribution version number.
+__version__ = "1.1"
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..de08add99
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc
new file mode 100644
index 000000000..312b71202
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_ihatexml.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc
new file mode 100644
index 000000000..f3f55146e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_inputstream.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc
new file mode 100644
index 000000000..0fb2238fb
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_tokenizer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc
new file mode 100644
index 000000000..d01b90bac
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc
new file mode 100644
index 000000000..e0b8a17b9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/constants.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc
new file mode 100644
index 000000000..94f6297ba
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/html5parser.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc
new file mode 100644
index 000000000..2091ee8c9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/__pycache__/serializer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_ihatexml.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_ihatexml.py
new file mode 100644
index 000000000..3ff803c19
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_ihatexml.py
@@ -0,0 +1,289 @@
+from __future__ import absolute_import, division, unicode_literals
+
+import re
+import warnings
+
+from .constants import DataLossWarning
+
+baseChar = """
+[#x0041-#x005A] | [#x0061-#x007A] | [#x00C0-#x00D6] | [#x00D8-#x00F6] |
+[#x00F8-#x00FF] | [#x0100-#x0131] | [#x0134-#x013E] | [#x0141-#x0148] |
+[#x014A-#x017E] | [#x0180-#x01C3] | [#x01CD-#x01F0] | [#x01F4-#x01F5] |
+[#x01FA-#x0217] | [#x0250-#x02A8] | [#x02BB-#x02C1] | #x0386 |
+[#x0388-#x038A] | #x038C | [#x038E-#x03A1] | [#x03A3-#x03CE] |
+[#x03D0-#x03D6] | #x03DA | #x03DC | #x03DE | #x03E0 | [#x03E2-#x03F3] |
+[#x0401-#x040C] | [#x040E-#x044F] | [#x0451-#x045C] | [#x045E-#x0481] |
+[#x0490-#x04C4] | [#x04C7-#x04C8] | [#x04CB-#x04CC] | [#x04D0-#x04EB] |
+[#x04EE-#x04F5] | [#x04F8-#x04F9] | [#x0531-#x0556] | #x0559 |
+[#x0561-#x0586] | [#x05D0-#x05EA] | [#x05F0-#x05F2] | [#x0621-#x063A] |
+[#x0641-#x064A] | [#x0671-#x06B7] | [#x06BA-#x06BE] | [#x06C0-#x06CE] |
+[#x06D0-#x06D3] | #x06D5 | [#x06E5-#x06E6] | [#x0905-#x0939] | #x093D |
+[#x0958-#x0961] | [#x0985-#x098C] | [#x098F-#x0990] | [#x0993-#x09A8] |
+[#x09AA-#x09B0] | #x09B2 | [#x09B6-#x09B9] | [#x09DC-#x09DD] |
+[#x09DF-#x09E1] | [#x09F0-#x09F1] | [#x0A05-#x0A0A] | [#x0A0F-#x0A10] |
+[#x0A13-#x0A28] | [#x0A2A-#x0A30] | [#x0A32-#x0A33] | [#x0A35-#x0A36] |
+[#x0A38-#x0A39] | [#x0A59-#x0A5C] | #x0A5E | [#x0A72-#x0A74] |
+[#x0A85-#x0A8B] | #x0A8D | [#x0A8F-#x0A91] | [#x0A93-#x0AA8] |
+[#x0AAA-#x0AB0] | [#x0AB2-#x0AB3] | [#x0AB5-#x0AB9] | #x0ABD | #x0AE0 |
+[#x0B05-#x0B0C] | [#x0B0F-#x0B10] | [#x0B13-#x0B28] | [#x0B2A-#x0B30] |
+[#x0B32-#x0B33] | [#x0B36-#x0B39] | #x0B3D | [#x0B5C-#x0B5D] |
+[#x0B5F-#x0B61] | [#x0B85-#x0B8A] | [#x0B8E-#x0B90] | [#x0B92-#x0B95] |
+[#x0B99-#x0B9A] | #x0B9C | [#x0B9E-#x0B9F] | [#x0BA3-#x0BA4] |
+[#x0BA8-#x0BAA] | [#x0BAE-#x0BB5] | [#x0BB7-#x0BB9] | [#x0C05-#x0C0C] |
+[#x0C0E-#x0C10] | [#x0C12-#x0C28] | [#x0C2A-#x0C33] | [#x0C35-#x0C39] |
+[#x0C60-#x0C61] | [#x0C85-#x0C8C] | [#x0C8E-#x0C90] | [#x0C92-#x0CA8] |
+[#x0CAA-#x0CB3] | [#x0CB5-#x0CB9] | #x0CDE | [#x0CE0-#x0CE1] |
+[#x0D05-#x0D0C] | [#x0D0E-#x0D10] | [#x0D12-#x0D28] | [#x0D2A-#x0D39] |
+[#x0D60-#x0D61] | [#x0E01-#x0E2E] | #x0E30 | [#x0E32-#x0E33] |
+[#x0E40-#x0E45] | [#x0E81-#x0E82] | #x0E84 | [#x0E87-#x0E88] | #x0E8A |
+#x0E8D | [#x0E94-#x0E97] | [#x0E99-#x0E9F] | [#x0EA1-#x0EA3] | #x0EA5 |
+#x0EA7 | [#x0EAA-#x0EAB] | [#x0EAD-#x0EAE] | #x0EB0 | [#x0EB2-#x0EB3] |
+#x0EBD | [#x0EC0-#x0EC4] | [#x0F40-#x0F47] | [#x0F49-#x0F69] |
+[#x10A0-#x10C5] | [#x10D0-#x10F6] | #x1100 | [#x1102-#x1103] |
+[#x1105-#x1107] | #x1109 | [#x110B-#x110C] | [#x110E-#x1112] | #x113C |
+#x113E | #x1140 | #x114C | #x114E | #x1150 | [#x1154-#x1155] | #x1159 |
+[#x115F-#x1161] | #x1163 | #x1165 | #x1167 | #x1169 | [#x116D-#x116E] |
+[#x1172-#x1173] | #x1175 | #x119E | #x11A8 | #x11AB | [#x11AE-#x11AF] |
+[#x11B7-#x11B8] | #x11BA | [#x11BC-#x11C2] | #x11EB | #x11F0 | #x11F9 |
+[#x1E00-#x1E9B] | [#x1EA0-#x1EF9] | [#x1F00-#x1F15] | [#x1F18-#x1F1D] |
+[#x1F20-#x1F45] | [#x1F48-#x1F4D] | [#x1F50-#x1F57] | #x1F59 | #x1F5B |
+#x1F5D | [#x1F5F-#x1F7D] | [#x1F80-#x1FB4] | [#x1FB6-#x1FBC] | #x1FBE |
+[#x1FC2-#x1FC4] | [#x1FC6-#x1FCC] | [#x1FD0-#x1FD3] | [#x1FD6-#x1FDB] |
+[#x1FE0-#x1FEC] | [#x1FF2-#x1FF4] | [#x1FF6-#x1FFC] | #x2126 |
+[#x212A-#x212B] | #x212E | [#x2180-#x2182] | [#x3041-#x3094] |
+[#x30A1-#x30FA] | [#x3105-#x312C] | [#xAC00-#xD7A3]"""
+
+ideographic = """[#x4E00-#x9FA5] | #x3007 | [#x3021-#x3029]"""
+
+combiningCharacter = """
+[#x0300-#x0345] | [#x0360-#x0361] | [#x0483-#x0486] | [#x0591-#x05A1] |
+[#x05A3-#x05B9] | [#x05BB-#x05BD] | #x05BF | [#x05C1-#x05C2] | #x05C4 |
+[#x064B-#x0652] | #x0670 | [#x06D6-#x06DC] | [#x06DD-#x06DF] |
+[#x06E0-#x06E4] | [#x06E7-#x06E8] | [#x06EA-#x06ED] | [#x0901-#x0903] |
+#x093C | [#x093E-#x094C] | #x094D | [#x0951-#x0954] | [#x0962-#x0963] |
+[#x0981-#x0983] | #x09BC | #x09BE | #x09BF | [#x09C0-#x09C4] |
+[#x09C7-#x09C8] | [#x09CB-#x09CD] | #x09D7 | [#x09E2-#x09E3] | #x0A02 |
+#x0A3C | #x0A3E | #x0A3F | [#x0A40-#x0A42] | [#x0A47-#x0A48] |
+[#x0A4B-#x0A4D] | [#x0A70-#x0A71] | [#x0A81-#x0A83] | #x0ABC |
+[#x0ABE-#x0AC5] | [#x0AC7-#x0AC9] | [#x0ACB-#x0ACD] | [#x0B01-#x0B03] |
+#x0B3C | [#x0B3E-#x0B43] | [#x0B47-#x0B48] | [#x0B4B-#x0B4D] |
+[#x0B56-#x0B57] | [#x0B82-#x0B83] | [#x0BBE-#x0BC2] | [#x0BC6-#x0BC8] |
+[#x0BCA-#x0BCD] | #x0BD7 | [#x0C01-#x0C03] | [#x0C3E-#x0C44] |
+[#x0C46-#x0C48] | [#x0C4A-#x0C4D] | [#x0C55-#x0C56] | [#x0C82-#x0C83] |
+[#x0CBE-#x0CC4] | [#x0CC6-#x0CC8] | [#x0CCA-#x0CCD] | [#x0CD5-#x0CD6] |
+[#x0D02-#x0D03] | [#x0D3E-#x0D43] | [#x0D46-#x0D48] | [#x0D4A-#x0D4D] |
+#x0D57 | #x0E31 | [#x0E34-#x0E3A] | [#x0E47-#x0E4E] | #x0EB1 |
+[#x0EB4-#x0EB9] | [#x0EBB-#x0EBC] | [#x0EC8-#x0ECD] | [#x0F18-#x0F19] |
+#x0F35 | #x0F37 | #x0F39 | #x0F3E | #x0F3F | [#x0F71-#x0F84] |
+[#x0F86-#x0F8B] | [#x0F90-#x0F95] | #x0F97 | [#x0F99-#x0FAD] |
+[#x0FB1-#x0FB7] | #x0FB9 | [#x20D0-#x20DC] | #x20E1 | [#x302A-#x302F] |
+#x3099 | #x309A"""
+
+digit = """
+[#x0030-#x0039] | [#x0660-#x0669] | [#x06F0-#x06F9] | [#x0966-#x096F] |
+[#x09E6-#x09EF] | [#x0A66-#x0A6F] | [#x0AE6-#x0AEF] | [#x0B66-#x0B6F] |
+[#x0BE7-#x0BEF] | [#x0C66-#x0C6F] | [#x0CE6-#x0CEF] | [#x0D66-#x0D6F] |
+[#x0E50-#x0E59] | [#x0ED0-#x0ED9] | [#x0F20-#x0F29]"""
+
+extender = """
+#x00B7 | #x02D0 | #x02D1 | #x0387 | #x0640 | #x0E46 | #x0EC6 | #x3005 |
+#[#x3031-#x3035] | [#x309D-#x309E] | [#x30FC-#x30FE]"""
+
+letter = " | ".join([baseChar, ideographic])
+
+# Without the
+name = " | ".join([letter, digit, ".", "-", "_", combiningCharacter,
+                   extender])
+nameFirst = " | ".join([letter, "_"])
+
+reChar = re.compile(r"#x([\d|A-F]{4,4})")
+reCharRange = re.compile(r"\[#x([\d|A-F]{4,4})-#x([\d|A-F]{4,4})\]")
+
+
+def charStringToList(chars):
+    charRanges = [item.strip() for item in chars.split(" | ")]
+    rv = []
+    for item in charRanges:
+        foundMatch = False
+        for regexp in (reChar, reCharRange):
+            match = regexp.match(item)
+            if match is not None:
+                rv.append([hexToInt(item) for item in match.groups()])
+                if len(rv[-1]) == 1:
+                    rv[-1] = rv[-1] * 2
+                foundMatch = True
+                break
+        if not foundMatch:
+            assert len(item) == 1
+
+            rv.append([ord(item)] * 2)
+    rv = normaliseCharList(rv)
+    return rv
+
+
+def normaliseCharList(charList):
+    charList = sorted(charList)
+    for item in charList:
+        assert item[1] >= item[0]
+    rv = []
+    i = 0
+    while i < len(charList):
+        j = 1
+        rv.append(charList[i])
+        while i + j < len(charList) and charList[i + j][0] <= rv[-1][1] + 1:
+            rv[-1][1] = charList[i + j][1]
+            j += 1
+        i += j
+    return rv
+
+
+# We don't really support characters above the BMP :(
+max_unicode = int("FFFF", 16)
+
+
+def missingRanges(charList):
+    rv = []
+    if charList[0] != 0:
+        rv.append([0, charList[0][0] - 1])
+    for i, item in enumerate(charList[:-1]):
+        rv.append([item[1] + 1, charList[i + 1][0] - 1])
+    if charList[-1][1] != max_unicode:
+        rv.append([charList[-1][1] + 1, max_unicode])
+    return rv
+
+
+def listToRegexpStr(charList):
+    rv = []
+    for item in charList:
+        if item[0] == item[1]:
+            rv.append(escapeRegexp(chr(item[0])))
+        else:
+            rv.append(escapeRegexp(chr(item[0])) + "-" +
+                      escapeRegexp(chr(item[1])))
+    return "[%s]" % "".join(rv)
+
+
+def hexToInt(hex_str):
+    return int(hex_str, 16)
+
+
+def escapeRegexp(string):
+    specialCharacters = (".", "^", "$", "*", "+", "?", "{", "}",
+                         "[", "]", "|", "(", ")", "-")
+    for char in specialCharacters:
+        string = string.replace(char, "\\" + char)
+
+    return string
+
+# output from the above
+nonXmlNameBMPRegexp = re.compile('[\x00-,/:-@\\[-\\^`\\{-\xb6\xb8-\xbf\xd7\xf7\u0132-\u0133\u013f-\u0140\u0149\u017f\u01c4-\u01cc\u01f1-\u01f3\u01f6-\u01f9\u0218-\u024f\u02a9-\u02ba\u02c2-\u02cf\u02d2-\u02ff\u0346-\u035f\u0362-\u0385\u038b\u038d\u03a2\u03cf\u03d7-\u03d9\u03db\u03dd\u03df\u03e1\u03f4-\u0400\u040d\u0450\u045d\u0482\u0487-\u048f\u04c5-\u04c6\u04c9-\u04ca\u04cd-\u04cf\u04ec-\u04ed\u04f6-\u04f7\u04fa-\u0530\u0557-\u0558\u055a-\u0560\u0587-\u0590\u05a2\u05ba\u05be\u05c0\u05c3\u05c5-\u05cf\u05eb-\u05ef\u05f3-\u0620\u063b-\u063f\u0653-\u065f\u066a-\u066f\u06b8-\u06b9\u06bf\u06cf\u06d4\u06e9\u06ee-\u06ef\u06fa-\u0900\u0904\u093a-\u093b\u094e-\u0950\u0955-\u0957\u0964-\u0965\u0970-\u0980\u0984\u098d-\u098e\u0991-\u0992\u09a9\u09b1\u09b3-\u09b5\u09ba-\u09bb\u09bd\u09c5-\u09c6\u09c9-\u09ca\u09ce-\u09d6\u09d8-\u09db\u09de\u09e4-\u09e5\u09f2-\u0a01\u0a03-\u0a04\u0a0b-\u0a0e\u0a11-\u0a12\u0a29\u0a31\u0a34\u0a37\u0a3a-\u0a3b\u0a3d\u0a43-\u0a46\u0a49-\u0a4a\u0a4e-\u0a58\u0a5d\u0a5f-\u0a65\u0a75-\u0a80\u0a84\u0a8c\u0a8e\u0a92\u0aa9\u0ab1\u0ab4\u0aba-\u0abb\u0ac6\u0aca\u0ace-\u0adf\u0ae1-\u0ae5\u0af0-\u0b00\u0b04\u0b0d-\u0b0e\u0b11-\u0b12\u0b29\u0b31\u0b34-\u0b35\u0b3a-\u0b3b\u0b44-\u0b46\u0b49-\u0b4a\u0b4e-\u0b55\u0b58-\u0b5b\u0b5e\u0b62-\u0b65\u0b70-\u0b81\u0b84\u0b8b-\u0b8d\u0b91\u0b96-\u0b98\u0b9b\u0b9d\u0ba0-\u0ba2\u0ba5-\u0ba7\u0bab-\u0bad\u0bb6\u0bba-\u0bbd\u0bc3-\u0bc5\u0bc9\u0bce-\u0bd6\u0bd8-\u0be6\u0bf0-\u0c00\u0c04\u0c0d\u0c11\u0c29\u0c34\u0c3a-\u0c3d\u0c45\u0c49\u0c4e-\u0c54\u0c57-\u0c5f\u0c62-\u0c65\u0c70-\u0c81\u0c84\u0c8d\u0c91\u0ca9\u0cb4\u0cba-\u0cbd\u0cc5\u0cc9\u0cce-\u0cd4\u0cd7-\u0cdd\u0cdf\u0ce2-\u0ce5\u0cf0-\u0d01\u0d04\u0d0d\u0d11\u0d29\u0d3a-\u0d3d\u0d44-\u0d45\u0d49\u0d4e-\u0d56\u0d58-\u0d5f\u0d62-\u0d65\u0d70-\u0e00\u0e2f\u0e3b-\u0e3f\u0e4f\u0e5a-\u0e80\u0e83\u0e85-\u0e86\u0e89\u0e8b-\u0e8c\u0e8e-\u0e93\u0e98\u0ea0\u0ea4\u0ea6\u0ea8-\u0ea9\u0eac\u0eaf\u0eba\u0ebe-\u0ebf\u0ec5\u0ec7\u0ece-\u0ecf\u0eda-\u0f17\u0f1a-\u0f1f\u0f2a-\u0f34\u0f36\u0f38\u0f3a-\u0f3d\u0f48\u0f6a-\u0f70\u0f85\u0f8c-\u0f8f\u0f96\u0f98\u0fae-\u0fb0\u0fb8\u0fba-\u109f\u10c6-\u10cf\u10f7-\u10ff\u1101\u1104\u1108\u110a\u110d\u1113-\u113b\u113d\u113f\u1141-\u114b\u114d\u114f\u1151-\u1153\u1156-\u1158\u115a-\u115e\u1162\u1164\u1166\u1168\u116a-\u116c\u116f-\u1171\u1174\u1176-\u119d\u119f-\u11a7\u11a9-\u11aa\u11ac-\u11ad\u11b0-\u11b6\u11b9\u11bb\u11c3-\u11ea\u11ec-\u11ef\u11f1-\u11f8\u11fa-\u1dff\u1e9c-\u1e9f\u1efa-\u1eff\u1f16-\u1f17\u1f1e-\u1f1f\u1f46-\u1f47\u1f4e-\u1f4f\u1f58\u1f5a\u1f5c\u1f5e\u1f7e-\u1f7f\u1fb5\u1fbd\u1fbf-\u1fc1\u1fc5\u1fcd-\u1fcf\u1fd4-\u1fd5\u1fdc-\u1fdf\u1fed-\u1ff1\u1ff5\u1ffd-\u20cf\u20dd-\u20e0\u20e2-\u2125\u2127-\u2129\u212c-\u212d\u212f-\u217f\u2183-\u3004\u3006\u3008-\u3020\u3030\u3036-\u3040\u3095-\u3098\u309b-\u309c\u309f-\u30a0\u30fb\u30ff-\u3104\u312d-\u4dff\u9fa6-\uabff\ud7a4-\uffff]')  # noqa
+
+nonXmlNameFirstBMPRegexp = re.compile('[\x00-@\\[-\\^`\\{-\xbf\xd7\xf7\u0132-\u0133\u013f-\u0140\u0149\u017f\u01c4-\u01cc\u01f1-\u01f3\u01f6-\u01f9\u0218-\u024f\u02a9-\u02ba\u02c2-\u0385\u0387\u038b\u038d\u03a2\u03cf\u03d7-\u03d9\u03db\u03dd\u03df\u03e1\u03f4-\u0400\u040d\u0450\u045d\u0482-\u048f\u04c5-\u04c6\u04c9-\u04ca\u04cd-\u04cf\u04ec-\u04ed\u04f6-\u04f7\u04fa-\u0530\u0557-\u0558\u055a-\u0560\u0587-\u05cf\u05eb-\u05ef\u05f3-\u0620\u063b-\u0640\u064b-\u0670\u06b8-\u06b9\u06bf\u06cf\u06d4\u06d6-\u06e4\u06e7-\u0904\u093a-\u093c\u093e-\u0957\u0962-\u0984\u098d-\u098e\u0991-\u0992\u09a9\u09b1\u09b3-\u09b5\u09ba-\u09db\u09de\u09e2-\u09ef\u09f2-\u0a04\u0a0b-\u0a0e\u0a11-\u0a12\u0a29\u0a31\u0a34\u0a37\u0a3a-\u0a58\u0a5d\u0a5f-\u0a71\u0a75-\u0a84\u0a8c\u0a8e\u0a92\u0aa9\u0ab1\u0ab4\u0aba-\u0abc\u0abe-\u0adf\u0ae1-\u0b04\u0b0d-\u0b0e\u0b11-\u0b12\u0b29\u0b31\u0b34-\u0b35\u0b3a-\u0b3c\u0b3e-\u0b5b\u0b5e\u0b62-\u0b84\u0b8b-\u0b8d\u0b91\u0b96-\u0b98\u0b9b\u0b9d\u0ba0-\u0ba2\u0ba5-\u0ba7\u0bab-\u0bad\u0bb6\u0bba-\u0c04\u0c0d\u0c11\u0c29\u0c34\u0c3a-\u0c5f\u0c62-\u0c84\u0c8d\u0c91\u0ca9\u0cb4\u0cba-\u0cdd\u0cdf\u0ce2-\u0d04\u0d0d\u0d11\u0d29\u0d3a-\u0d5f\u0d62-\u0e00\u0e2f\u0e31\u0e34-\u0e3f\u0e46-\u0e80\u0e83\u0e85-\u0e86\u0e89\u0e8b-\u0e8c\u0e8e-\u0e93\u0e98\u0ea0\u0ea4\u0ea6\u0ea8-\u0ea9\u0eac\u0eaf\u0eb1\u0eb4-\u0ebc\u0ebe-\u0ebf\u0ec5-\u0f3f\u0f48\u0f6a-\u109f\u10c6-\u10cf\u10f7-\u10ff\u1101\u1104\u1108\u110a\u110d\u1113-\u113b\u113d\u113f\u1141-\u114b\u114d\u114f\u1151-\u1153\u1156-\u1158\u115a-\u115e\u1162\u1164\u1166\u1168\u116a-\u116c\u116f-\u1171\u1174\u1176-\u119d\u119f-\u11a7\u11a9-\u11aa\u11ac-\u11ad\u11b0-\u11b6\u11b9\u11bb\u11c3-\u11ea\u11ec-\u11ef\u11f1-\u11f8\u11fa-\u1dff\u1e9c-\u1e9f\u1efa-\u1eff\u1f16-\u1f17\u1f1e-\u1f1f\u1f46-\u1f47\u1f4e-\u1f4f\u1f58\u1f5a\u1f5c\u1f5e\u1f7e-\u1f7f\u1fb5\u1fbd\u1fbf-\u1fc1\u1fc5\u1fcd-\u1fcf\u1fd4-\u1fd5\u1fdc-\u1fdf\u1fed-\u1ff1\u1ff5\u1ffd-\u2125\u2127-\u2129\u212c-\u212d\u212f-\u217f\u2183-\u3006\u3008-\u3020\u302a-\u3040\u3095-\u30a0\u30fb-\u3104\u312d-\u4dff\u9fa6-\uabff\ud7a4-\uffff]')  # noqa
+
+# Simpler things
+nonPubidCharRegexp = re.compile("[^\x20\x0D\x0Aa-zA-Z0-9\\-'()+,./:=?;!*#@$_%]")
+
+
+class InfosetFilter(object):
+    replacementRegexp = re.compile(r"U[\dA-F]{5,5}")
+
+    def __init__(self,
+                 dropXmlnsLocalName=False,
+                 dropXmlnsAttrNs=False,
+                 preventDoubleDashComments=False,
+                 preventDashAtCommentEnd=False,
+                 replaceFormFeedCharacters=True,
+                 preventSingleQuotePubid=False):
+
+        self.dropXmlnsLocalName = dropXmlnsLocalName
+        self.dropXmlnsAttrNs = dropXmlnsAttrNs
+
+        self.preventDoubleDashComments = preventDoubleDashComments
+        self.preventDashAtCommentEnd = preventDashAtCommentEnd
+
+        self.replaceFormFeedCharacters = replaceFormFeedCharacters
+
+        self.preventSingleQuotePubid = preventSingleQuotePubid
+
+        self.replaceCache = {}
+
+    def coerceAttribute(self, name, namespace=None):
+        if self.dropXmlnsLocalName and name.startswith("xmlns:"):
+            warnings.warn("Attributes cannot begin with xmlns", DataLossWarning)
+            return None
+        elif (self.dropXmlnsAttrNs and
+              namespace == "http://www.w3.org/2000/xmlns/"):
+            warnings.warn("Attributes cannot be in the xml namespace", DataLossWarning)
+            return None
+        else:
+            return self.toXmlName(name)
+
+    def coerceElement(self, name):
+        return self.toXmlName(name)
+
+    def coerceComment(self, data):
+        if self.preventDoubleDashComments:
+            while "--" in data:
+                warnings.warn("Comments cannot contain adjacent dashes", DataLossWarning)
+                data = data.replace("--", "- -")
+            if data.endswith("-"):
+                warnings.warn("Comments cannot end in a dash", DataLossWarning)
+                data += " "
+        return data
+
+    def coerceCharacters(self, data):
+        if self.replaceFormFeedCharacters:
+            for _ in range(data.count("\x0C")):
+                warnings.warn("Text cannot contain U+000C", DataLossWarning)
+            data = data.replace("\x0C", " ")
+        # Other non-xml characters
+        return data
+
+    def coercePubid(self, data):
+        dataOutput = data
+        for char in nonPubidCharRegexp.findall(data):
+            warnings.warn("Coercing non-XML pubid", DataLossWarning)
+            replacement = self.getReplacementCharacter(char)
+            dataOutput = dataOutput.replace(char, replacement)
+        if self.preventSingleQuotePubid and dataOutput.find("'") >= 0:
+            warnings.warn("Pubid cannot contain single quote", DataLossWarning)
+            dataOutput = dataOutput.replace("'", self.getReplacementCharacter("'"))
+        return dataOutput
+
+    def toXmlName(self, name):
+        nameFirst = name[0]
+        nameRest = name[1:]
+        m = nonXmlNameFirstBMPRegexp.match(nameFirst)
+        if m:
+            warnings.warn("Coercing non-XML name: %s" % name, DataLossWarning)
+            nameFirstOutput = self.getReplacementCharacter(nameFirst)
+        else:
+            nameFirstOutput = nameFirst
+
+        nameRestOutput = nameRest
+        replaceChars = set(nonXmlNameBMPRegexp.findall(nameRest))
+        for char in replaceChars:
+            warnings.warn("Coercing non-XML name: %s" % name, DataLossWarning)
+            replacement = self.getReplacementCharacter(char)
+            nameRestOutput = nameRestOutput.replace(char, replacement)
+        return nameFirstOutput + nameRestOutput
+
+    def getReplacementCharacter(self, char):
+        if char in self.replaceCache:
+            replacement = self.replaceCache[char]
+        else:
+            replacement = self.escapeChar(char)
+        return replacement
+
+    def fromXmlName(self, name):
+        for item in set(self.replacementRegexp.findall(name)):
+            name = name.replace(item, self.unescapeChar(item))
+        return name
+
+    def escapeChar(self, char):
+        replacement = "U%05X" % ord(char)
+        self.replaceCache[char] = replacement
+        return replacement
+
+    def unescapeChar(self, charcode):
+        return chr(int(charcode[1:], 16))
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_inputstream.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_inputstream.py
new file mode 100644
index 000000000..e0bb37602
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_inputstream.py
@@ -0,0 +1,918 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from pip._vendor.six import text_type
+from pip._vendor.six.moves import http_client, urllib
+
+import codecs
+import re
+from io import BytesIO, StringIO
+
+from pip._vendor import webencodings
+
+from .constants import EOF, spaceCharacters, asciiLetters, asciiUppercase
+from .constants import _ReparseException
+from . import _utils
+
+# Non-unicode versions of constants for use in the pre-parser
+spaceCharactersBytes = frozenset([item.encode("ascii") for item in spaceCharacters])
+asciiLettersBytes = frozenset([item.encode("ascii") for item in asciiLetters])
+asciiUppercaseBytes = frozenset([item.encode("ascii") for item in asciiUppercase])
+spacesAngleBrackets = spaceCharactersBytes | frozenset([b">", b"<"])
+
+
+invalid_unicode_no_surrogate = "[\u0001-\u0008\u000B\u000E-\u001F\u007F-\u009F\uFDD0-\uFDEF\uFFFE\uFFFF\U0001FFFE\U0001FFFF\U0002FFFE\U0002FFFF\U0003FFFE\U0003FFFF\U0004FFFE\U0004FFFF\U0005FFFE\U0005FFFF\U0006FFFE\U0006FFFF\U0007FFFE\U0007FFFF\U0008FFFE\U0008FFFF\U0009FFFE\U0009FFFF\U000AFFFE\U000AFFFF\U000BFFFE\U000BFFFF\U000CFFFE\U000CFFFF\U000DFFFE\U000DFFFF\U000EFFFE\U000EFFFF\U000FFFFE\U000FFFFF\U0010FFFE\U0010FFFF]"  # noqa
+
+if _utils.supports_lone_surrogates:
+    # Use one extra step of indirection and create surrogates with
+    # eval. Not using this indirection would introduce an illegal
+    # unicode literal on platforms not supporting such lone
+    # surrogates.
+    assert invalid_unicode_no_surrogate[-1] == "]" and invalid_unicode_no_surrogate.count("]") == 1
+    invalid_unicode_re = re.compile(invalid_unicode_no_surrogate[:-1] +
+                                    eval('"\\uD800-\\uDFFF"') +  # pylint:disable=eval-used
+                                    "]")
+else:
+    invalid_unicode_re = re.compile(invalid_unicode_no_surrogate)
+
+non_bmp_invalid_codepoints = {0x1FFFE, 0x1FFFF, 0x2FFFE, 0x2FFFF, 0x3FFFE,
+                              0x3FFFF, 0x4FFFE, 0x4FFFF, 0x5FFFE, 0x5FFFF,
+                              0x6FFFE, 0x6FFFF, 0x7FFFE, 0x7FFFF, 0x8FFFE,
+                              0x8FFFF, 0x9FFFE, 0x9FFFF, 0xAFFFE, 0xAFFFF,
+                              0xBFFFE, 0xBFFFF, 0xCFFFE, 0xCFFFF, 0xDFFFE,
+                              0xDFFFF, 0xEFFFE, 0xEFFFF, 0xFFFFE, 0xFFFFF,
+                              0x10FFFE, 0x10FFFF}
+
+ascii_punctuation_re = re.compile("[\u0009-\u000D\u0020-\u002F\u003A-\u0040\u005C\u005B-\u0060\u007B-\u007E]")
+
+# Cache for charsUntil()
+charsUntilRegEx = {}
+
+
+class BufferedStream(object):
+    """Buffering for streams that do not have buffering of their own
+
+    The buffer is implemented as a list of chunks on the assumption that
+    joining many strings will be slow since it is O(n**2)
+    """
+
+    def __init__(self, stream):
+        self.stream = stream
+        self.buffer = []
+        self.position = [-1, 0]  # chunk number, offset
+
+    def tell(self):
+        pos = 0
+        for chunk in self.buffer[:self.position[0]]:
+            pos += len(chunk)
+        pos += self.position[1]
+        return pos
+
+    def seek(self, pos):
+        assert pos <= self._bufferedBytes()
+        offset = pos
+        i = 0
+        while len(self.buffer[i]) < offset:
+            offset -= len(self.buffer[i])
+            i += 1
+        self.position = [i, offset]
+
+    def read(self, bytes):
+        if not self.buffer:
+            return self._readStream(bytes)
+        elif (self.position[0] == len(self.buffer) and
+              self.position[1] == len(self.buffer[-1])):
+            return self._readStream(bytes)
+        else:
+            return self._readFromBuffer(bytes)
+
+    def _bufferedBytes(self):
+        return sum([len(item) for item in self.buffer])
+
+    def _readStream(self, bytes):
+        data = self.stream.read(bytes)
+        self.buffer.append(data)
+        self.position[0] += 1
+        self.position[1] = len(data)
+        return data
+
+    def _readFromBuffer(self, bytes):
+        remainingBytes = bytes
+        rv = []
+        bufferIndex = self.position[0]
+        bufferOffset = self.position[1]
+        while bufferIndex < len(self.buffer) and remainingBytes != 0:
+            assert remainingBytes > 0
+            bufferedData = self.buffer[bufferIndex]
+
+            if remainingBytes <= len(bufferedData) - bufferOffset:
+                bytesToRead = remainingBytes
+                self.position = [bufferIndex, bufferOffset + bytesToRead]
+            else:
+                bytesToRead = len(bufferedData) - bufferOffset
+                self.position = [bufferIndex, len(bufferedData)]
+                bufferIndex += 1
+            rv.append(bufferedData[bufferOffset:bufferOffset + bytesToRead])
+            remainingBytes -= bytesToRead
+
+            bufferOffset = 0
+
+        if remainingBytes:
+            rv.append(self._readStream(remainingBytes))
+
+        return b"".join(rv)
+
+
+def HTMLInputStream(source, **kwargs):
+    # Work around Python bug #20007: read(0) closes the connection.
+    # http://bugs.python.org/issue20007
+    if (isinstance(source, http_client.HTTPResponse) or
+        # Also check for addinfourl wrapping HTTPResponse
+        (isinstance(source, urllib.response.addbase) and
+         isinstance(source.fp, http_client.HTTPResponse))):
+        isUnicode = False
+    elif hasattr(source, "read"):
+        isUnicode = isinstance(source.read(0), text_type)
+    else:
+        isUnicode = isinstance(source, text_type)
+
+    if isUnicode:
+        encodings = [x for x in kwargs if x.endswith("_encoding")]
+        if encodings:
+            raise TypeError("Cannot set an encoding with a unicode input, set %r" % encodings)
+
+        return HTMLUnicodeInputStream(source, **kwargs)
+    else:
+        return HTMLBinaryInputStream(source, **kwargs)
+
+
+class HTMLUnicodeInputStream(object):
+    """Provides a unicode stream of characters to the HTMLTokenizer.
+
+    This class takes care of character encoding and removing or replacing
+    incorrect byte-sequences and also provides column and line tracking.
+
+    """
+
+    _defaultChunkSize = 10240
+
+    def __init__(self, source):
+        """Initialises the HTMLInputStream.
+
+        HTMLInputStream(source, [encoding]) -> Normalized stream from source
+        for use by html5lib.
+
+        source can be either a file-object, local filename or a string.
+
+        The optional encoding parameter must be a string that indicates
+        the encoding.  If specified, that encoding will be used,
+        regardless of any BOM or later declaration (such as in a meta
+        element)
+
+        """
+
+        if not _utils.supports_lone_surrogates:
+            # Such platforms will have already checked for such
+            # surrogate errors, so no need to do this checking.
+            self.reportCharacterErrors = None
+        elif len("\U0010FFFF") == 1:
+            self.reportCharacterErrors = self.characterErrorsUCS4
+        else:
+            self.reportCharacterErrors = self.characterErrorsUCS2
+
+        # List of where new lines occur
+        self.newLines = [0]
+
+        self.charEncoding = (lookupEncoding("utf-8"), "certain")
+        self.dataStream = self.openStream(source)
+
+        self.reset()
+
+    def reset(self):
+        self.chunk = ""
+        self.chunkSize = 0
+        self.chunkOffset = 0
+        self.errors = []
+
+        # number of (complete) lines in previous chunks
+        self.prevNumLines = 0
+        # number of columns in the last line of the previous chunk
+        self.prevNumCols = 0
+
+        # Deal with CR LF and surrogates split over chunk boundaries
+        self._bufferedCharacter = None
+
+    def openStream(self, source):
+        """Produces a file object from source.
+
+        source can be either a file object, local filename or a string.
+
+        """
+        # Already a file object
+        if hasattr(source, 'read'):
+            stream = source
+        else:
+            stream = StringIO(source)
+
+        return stream
+
+    def _position(self, offset):
+        chunk = self.chunk
+        nLines = chunk.count('\n', 0, offset)
+        positionLine = self.prevNumLines + nLines
+        lastLinePos = chunk.rfind('\n', 0, offset)
+        if lastLinePos == -1:
+            positionColumn = self.prevNumCols + offset
+        else:
+            positionColumn = offset - (lastLinePos + 1)
+        return (positionLine, positionColumn)
+
+    def position(self):
+        """Returns (line, col) of the current position in the stream."""
+        line, col = self._position(self.chunkOffset)
+        return (line + 1, col)
+
+    def char(self):
+        """ Read one character from the stream or queue if available. Return
+            EOF when EOF is reached.
+        """
+        # Read a new chunk from the input stream if necessary
+        if self.chunkOffset >= self.chunkSize:
+            if not self.readChunk():
+                return EOF
+
+        chunkOffset = self.chunkOffset
+        char = self.chunk[chunkOffset]
+        self.chunkOffset = chunkOffset + 1
+
+        return char
+
+    def readChunk(self, chunkSize=None):
+        if chunkSize is None:
+            chunkSize = self._defaultChunkSize
+
+        self.prevNumLines, self.prevNumCols = self._position(self.chunkSize)
+
+        self.chunk = ""
+        self.chunkSize = 0
+        self.chunkOffset = 0
+
+        data = self.dataStream.read(chunkSize)
+
+        # Deal with CR LF and surrogates broken across chunks
+        if self._bufferedCharacter:
+            data = self._bufferedCharacter + data
+            self._bufferedCharacter = None
+        elif not data:
+            # We have no more data, bye-bye stream
+            return False
+
+        if len(data) > 1:
+            lastv = ord(data[-1])
+            if lastv == 0x0D or 0xD800 <= lastv <= 0xDBFF:
+                self._bufferedCharacter = data[-1]
+                data = data[:-1]
+
+        if self.reportCharacterErrors:
+            self.reportCharacterErrors(data)
+
+        # Replace invalid characters
+        data = data.replace("\r\n", "\n")
+        data = data.replace("\r", "\n")
+
+        self.chunk = data
+        self.chunkSize = len(data)
+
+        return True
+
+    def characterErrorsUCS4(self, data):
+        for _ in range(len(invalid_unicode_re.findall(data))):
+            self.errors.append("invalid-codepoint")
+
+    def characterErrorsUCS2(self, data):
+        # Someone picked the wrong compile option
+        # You lose
+        skip = False
+        for match in invalid_unicode_re.finditer(data):
+            if skip:
+                continue
+            codepoint = ord(match.group())
+            pos = match.start()
+            # Pretty sure there should be endianness issues here
+            if _utils.isSurrogatePair(data[pos:pos + 2]):
+                # We have a surrogate pair!
+                char_val = _utils.surrogatePairToCodepoint(data[pos:pos + 2])
+                if char_val in non_bmp_invalid_codepoints:
+                    self.errors.append("invalid-codepoint")
+                skip = True
+            elif (codepoint >= 0xD800 and codepoint <= 0xDFFF and
+                  pos == len(data) - 1):
+                self.errors.append("invalid-codepoint")
+            else:
+                skip = False
+                self.errors.append("invalid-codepoint")
+
+    def charsUntil(self, characters, opposite=False):
+        """ Returns a string of characters from the stream up to but not
+        including any character in 'characters' or EOF. 'characters' must be
+        a container that supports the 'in' method and iteration over its
+        characters.
+        """
+
+        # Use a cache of regexps to find the required characters
+        try:
+            chars = charsUntilRegEx[(characters, opposite)]
+        except KeyError:
+            if __debug__:
+                for c in characters:
+                    assert(ord(c) < 128)
+            regex = "".join(["\\x%02x" % ord(c) for c in characters])
+            if not opposite:
+                regex = "^%s" % regex
+            chars = charsUntilRegEx[(characters, opposite)] = re.compile("[%s]+" % regex)
+
+        rv = []
+
+        while True:
+            # Find the longest matching prefix
+            m = chars.match(self.chunk, self.chunkOffset)
+            if m is None:
+                # If nothing matched, and it wasn't because we ran out of chunk,
+                # then stop
+                if self.chunkOffset != self.chunkSize:
+                    break
+            else:
+                end = m.end()
+                # If not the whole chunk matched, return everything
+                # up to the part that didn't match
+                if end != self.chunkSize:
+                    rv.append(self.chunk[self.chunkOffset:end])
+                    self.chunkOffset = end
+                    break
+            # If the whole remainder of the chunk matched,
+            # use it all and read the next chunk
+            rv.append(self.chunk[self.chunkOffset:])
+            if not self.readChunk():
+                # Reached EOF
+                break
+
+        r = "".join(rv)
+        return r
+
+    def unget(self, char):
+        # Only one character is allowed to be ungotten at once - it must
+        # be consumed again before any further call to unget
+        if char is not EOF:
+            if self.chunkOffset == 0:
+                # unget is called quite rarely, so it's a good idea to do
+                # more work here if it saves a bit of work in the frequently
+                # called char and charsUntil.
+                # So, just prepend the ungotten character onto the current
+                # chunk:
+                self.chunk = char + self.chunk
+                self.chunkSize += 1
+            else:
+                self.chunkOffset -= 1
+                assert self.chunk[self.chunkOffset] == char
+
+
+class HTMLBinaryInputStream(HTMLUnicodeInputStream):
+    """Provides a unicode stream of characters to the HTMLTokenizer.
+
+    This class takes care of character encoding and removing or replacing
+    incorrect byte-sequences and also provides column and line tracking.
+
+    """
+
+    def __init__(self, source, override_encoding=None, transport_encoding=None,
+                 same_origin_parent_encoding=None, likely_encoding=None,
+                 default_encoding="windows-1252", useChardet=True):
+        """Initialises the HTMLInputStream.
+
+        HTMLInputStream(source, [encoding]) -> Normalized stream from source
+        for use by html5lib.
+
+        source can be either a file-object, local filename or a string.
+
+        The optional encoding parameter must be a string that indicates
+        the encoding.  If specified, that encoding will be used,
+        regardless of any BOM or later declaration (such as in a meta
+        element)
+
+        """
+        # Raw Stream - for unicode objects this will encode to utf-8 and set
+        #              self.charEncoding as appropriate
+        self.rawStream = self.openStream(source)
+
+        HTMLUnicodeInputStream.__init__(self, self.rawStream)
+
+        # Encoding Information
+        # Number of bytes to use when looking for a meta element with
+        # encoding information
+        self.numBytesMeta = 1024
+        # Number of bytes to use when using detecting encoding using chardet
+        self.numBytesChardet = 100
+        # Things from args
+        self.override_encoding = override_encoding
+        self.transport_encoding = transport_encoding
+        self.same_origin_parent_encoding = same_origin_parent_encoding
+        self.likely_encoding = likely_encoding
+        self.default_encoding = default_encoding
+
+        # Determine encoding
+        self.charEncoding = self.determineEncoding(useChardet)
+        assert self.charEncoding[0] is not None
+
+        # Call superclass
+        self.reset()
+
+    def reset(self):
+        self.dataStream = self.charEncoding[0].codec_info.streamreader(self.rawStream, 'replace')
+        HTMLUnicodeInputStream.reset(self)
+
+    def openStream(self, source):
+        """Produces a file object from source.
+
+        source can be either a file object, local filename or a string.
+
+        """
+        # Already a file object
+        if hasattr(source, 'read'):
+            stream = source
+        else:
+            stream = BytesIO(source)
+
+        try:
+            stream.seek(stream.tell())
+        except Exception:
+            stream = BufferedStream(stream)
+
+        return stream
+
+    def determineEncoding(self, chardet=True):
+        # BOMs take precedence over everything
+        # This will also read past the BOM if present
+        charEncoding = self.detectBOM(), "certain"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # If we've been overridden, we've been overridden
+        charEncoding = lookupEncoding(self.override_encoding), "certain"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # Now check the transport layer
+        charEncoding = lookupEncoding(self.transport_encoding), "certain"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # Look for meta elements with encoding information
+        charEncoding = self.detectEncodingMeta(), "tentative"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # Parent document encoding
+        charEncoding = lookupEncoding(self.same_origin_parent_encoding), "tentative"
+        if charEncoding[0] is not None and not charEncoding[0].name.startswith("utf-16"):
+            return charEncoding
+
+        # "likely" encoding
+        charEncoding = lookupEncoding(self.likely_encoding), "tentative"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # Guess with chardet, if available
+        if chardet:
+            try:
+                from pip._vendor.chardet.universaldetector import UniversalDetector
+            except ImportError:
+                pass
+            else:
+                buffers = []
+                detector = UniversalDetector()
+                while not detector.done:
+                    buffer = self.rawStream.read(self.numBytesChardet)
+                    assert isinstance(buffer, bytes)
+                    if not buffer:
+                        break
+                    buffers.append(buffer)
+                    detector.feed(buffer)
+                detector.close()
+                encoding = lookupEncoding(detector.result['encoding'])
+                self.rawStream.seek(0)
+                if encoding is not None:
+                    return encoding, "tentative"
+
+        # Try the default encoding
+        charEncoding = lookupEncoding(self.default_encoding), "tentative"
+        if charEncoding[0] is not None:
+            return charEncoding
+
+        # Fallback to html5lib's default if even that hasn't worked
+        return lookupEncoding("windows-1252"), "tentative"
+
+    def changeEncoding(self, newEncoding):
+        assert self.charEncoding[1] != "certain"
+        newEncoding = lookupEncoding(newEncoding)
+        if newEncoding is None:
+            return
+        if newEncoding.name in ("utf-16be", "utf-16le"):
+            newEncoding = lookupEncoding("utf-8")
+            assert newEncoding is not None
+        elif newEncoding == self.charEncoding[0]:
+            self.charEncoding = (self.charEncoding[0], "certain")
+        else:
+            self.rawStream.seek(0)
+            self.charEncoding = (newEncoding, "certain")
+            self.reset()
+            raise _ReparseException("Encoding changed from %s to %s" % (self.charEncoding[0], newEncoding))
+
+    def detectBOM(self):
+        """Attempts to detect at BOM at the start of the stream. If
+        an encoding can be determined from the BOM return the name of the
+        encoding otherwise return None"""
+        bomDict = {
+            codecs.BOM_UTF8: 'utf-8',
+            codecs.BOM_UTF16_LE: 'utf-16le', codecs.BOM_UTF16_BE: 'utf-16be',
+            codecs.BOM_UTF32_LE: 'utf-32le', codecs.BOM_UTF32_BE: 'utf-32be'
+        }
+
+        # Go to beginning of file and read in 4 bytes
+        string = self.rawStream.read(4)
+        assert isinstance(string, bytes)
+
+        # Try detecting the BOM using bytes from the string
+        encoding = bomDict.get(string[:3])         # UTF-8
+        seek = 3
+        if not encoding:
+            # Need to detect UTF-32 before UTF-16
+            encoding = bomDict.get(string)         # UTF-32
+            seek = 4
+            if not encoding:
+                encoding = bomDict.get(string[:2])  # UTF-16
+                seek = 2
+
+        # Set the read position past the BOM if one was found, otherwise
+        # set it to the start of the stream
+        if encoding:
+            self.rawStream.seek(seek)
+            return lookupEncoding(encoding)
+        else:
+            self.rawStream.seek(0)
+            return None
+
+    def detectEncodingMeta(self):
+        """Report the encoding declared by the meta element
+        """
+        buffer = self.rawStream.read(self.numBytesMeta)
+        assert isinstance(buffer, bytes)
+        parser = EncodingParser(buffer)
+        self.rawStream.seek(0)
+        encoding = parser.getEncoding()
+
+        if encoding is not None and encoding.name in ("utf-16be", "utf-16le"):
+            encoding = lookupEncoding("utf-8")
+
+        return encoding
+
+
+class EncodingBytes(bytes):
+    """String-like object with an associated position and various extra methods
+    If the position is ever greater than the string length then an exception is
+    raised"""
+    def __new__(self, value):
+        assert isinstance(value, bytes)
+        return bytes.__new__(self, value.lower())
+
+    def __init__(self, value):
+        # pylint:disable=unused-argument
+        self._position = -1
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        p = self._position = self._position + 1
+        if p >= len(self):
+            raise StopIteration
+        elif p < 0:
+            raise TypeError
+        return self[p:p + 1]
+
+    def next(self):
+        # Py2 compat
+        return self.__next__()
+
+    def previous(self):
+        p = self._position
+        if p >= len(self):
+            raise StopIteration
+        elif p < 0:
+            raise TypeError
+        self._position = p = p - 1
+        return self[p:p + 1]
+
+    def setPosition(self, position):
+        if self._position >= len(self):
+            raise StopIteration
+        self._position = position
+
+    def getPosition(self):
+        if self._position >= len(self):
+            raise StopIteration
+        if self._position >= 0:
+            return self._position
+        else:
+            return None
+
+    position = property(getPosition, setPosition)
+
+    def getCurrentByte(self):
+        return self[self.position:self.position + 1]
+
+    currentByte = property(getCurrentByte)
+
+    def skip(self, chars=spaceCharactersBytes):
+        """Skip past a list of characters"""
+        p = self.position               # use property for the error-checking
+        while p < len(self):
+            c = self[p:p + 1]
+            if c not in chars:
+                self._position = p
+                return c
+            p += 1
+        self._position = p
+        return None
+
+    def skipUntil(self, chars):
+        p = self.position
+        while p < len(self):
+            c = self[p:p + 1]
+            if c in chars:
+                self._position = p
+                return c
+            p += 1
+        self._position = p
+        return None
+
+    def matchBytes(self, bytes):
+        """Look for a sequence of bytes at the start of a string. If the bytes
+        are found return True and advance the position to the byte after the
+        match. Otherwise return False and leave the position alone"""
+        rv = self.startswith(bytes, self.position)
+        if rv:
+            self.position += len(bytes)
+        return rv
+
+    def jumpTo(self, bytes):
+        """Look for the next sequence of bytes matching a given sequence. If
+        a match is found advance the position to the last byte of the match"""
+        try:
+            self._position = self.index(bytes, self.position) + len(bytes) - 1
+        except ValueError:
+            raise StopIteration
+        return True
+
+
+class EncodingParser(object):
+    """Mini parser for detecting character encoding from meta elements"""
+
+    def __init__(self, data):
+        """string - the data to work on for encoding detection"""
+        self.data = EncodingBytes(data)
+        self.encoding = None
+
+    def getEncoding(self):
+        if b"<meta" not in self.data:
+            return None
+
+        methodDispatch = (
+            (b"<!--", self.handleComment),
+            (b"<meta", self.handleMeta),
+            (b"</", self.handlePossibleEndTag),
+            (b"<!", self.handleOther),
+            (b"<?", self.handleOther),
+            (b"<", self.handlePossibleStartTag))
+        for _ in self.data:
+            keepParsing = True
+            try:
+                self.data.jumpTo(b"<")
+            except StopIteration:
+                break
+            for key, method in methodDispatch:
+                if self.data.matchBytes(key):
+                    try:
+                        keepParsing = method()
+                        break
+                    except StopIteration:
+                        keepParsing = False
+                        break
+            if not keepParsing:
+                break
+
+        return self.encoding
+
+    def handleComment(self):
+        """Skip over comments"""
+        return self.data.jumpTo(b"-->")
+
+    def handleMeta(self):
+        if self.data.currentByte not in spaceCharactersBytes:
+            # if we have <meta not followed by a space so just keep going
+            return True
+        # We have a valid meta element we want to search for attributes
+        hasPragma = False
+        pendingEncoding = None
+        while True:
+            # Try to find the next attribute after the current position
+            attr = self.getAttribute()
+            if attr is None:
+                return True
+            else:
+                if attr[0] == b"http-equiv":
+                    hasPragma = attr[1] == b"content-type"
+                    if hasPragma and pendingEncoding is not None:
+                        self.encoding = pendingEncoding
+                        return False
+                elif attr[0] == b"charset":
+                    tentativeEncoding = attr[1]
+                    codec = lookupEncoding(tentativeEncoding)
+                    if codec is not None:
+                        self.encoding = codec
+                        return False
+                elif attr[0] == b"content":
+                    contentParser = ContentAttrParser(EncodingBytes(attr[1]))
+                    tentativeEncoding = contentParser.parse()
+                    if tentativeEncoding is not None:
+                        codec = lookupEncoding(tentativeEncoding)
+                        if codec is not None:
+                            if hasPragma:
+                                self.encoding = codec
+                                return False
+                            else:
+                                pendingEncoding = codec
+
+    def handlePossibleStartTag(self):
+        return self.handlePossibleTag(False)
+
+    def handlePossibleEndTag(self):
+        next(self.data)
+        return self.handlePossibleTag(True)
+
+    def handlePossibleTag(self, endTag):
+        data = self.data
+        if data.currentByte not in asciiLettersBytes:
+            # If the next byte is not an ascii letter either ignore this
+            # fragment (possible start tag case) or treat it according to
+            # handleOther
+            if endTag:
+                data.previous()
+                self.handleOther()
+            return True
+
+        c = data.skipUntil(spacesAngleBrackets)
+        if c == b"<":
+            # return to the first step in the overall "two step" algorithm
+            # reprocessing the < byte
+            data.previous()
+        else:
+            # Read all attributes
+            attr = self.getAttribute()
+            while attr is not None:
+                attr = self.getAttribute()
+        return True
+
+    def handleOther(self):
+        return self.data.jumpTo(b">")
+
+    def getAttribute(self):
+        """Return a name,value pair for the next attribute in the stream,
+        if one is found, or None"""
+        data = self.data
+        # Step 1 (skip chars)
+        c = data.skip(spaceCharactersBytes | frozenset([b"/"]))
+        assert c is None or len(c) == 1
+        # Step 2
+        if c in (b">", None):
+            return None
+        # Step 3
+        attrName = []
+        attrValue = []
+        # Step 4 attribute name
+        while True:
+            if c == b"=" and attrName:
+                break
+            elif c in spaceCharactersBytes:
+                # Step 6!
+                c = data.skip()
+                break
+            elif c in (b"/", b">"):
+                return b"".join(attrName), b""
+            elif c in asciiUppercaseBytes:
+                attrName.append(c.lower())
+            elif c is None:
+                return None
+            else:
+                attrName.append(c)
+            # Step 5
+            c = next(data)
+        # Step 7
+        if c != b"=":
+            data.previous()
+            return b"".join(attrName), b""
+        # Step 8
+        next(data)
+        # Step 9
+        c = data.skip()
+        # Step 10
+        if c in (b"'", b'"'):
+            # 10.1
+            quoteChar = c
+            while True:
+                # 10.2
+                c = next(data)
+                # 10.3
+                if c == quoteChar:
+                    next(data)
+                    return b"".join(attrName), b"".join(attrValue)
+                # 10.4
+                elif c in asciiUppercaseBytes:
+                    attrValue.append(c.lower())
+                # 10.5
+                else:
+                    attrValue.append(c)
+        elif c == b">":
+            return b"".join(attrName), b""
+        elif c in asciiUppercaseBytes:
+            attrValue.append(c.lower())
+        elif c is None:
+            return None
+        else:
+            attrValue.append(c)
+        # Step 11
+        while True:
+            c = next(data)
+            if c in spacesAngleBrackets:
+                return b"".join(attrName), b"".join(attrValue)
+            elif c in asciiUppercaseBytes:
+                attrValue.append(c.lower())
+            elif c is None:
+                return None
+            else:
+                attrValue.append(c)
+
+
+class ContentAttrParser(object):
+    def __init__(self, data):
+        assert isinstance(data, bytes)
+        self.data = data
+
+    def parse(self):
+        try:
+            # Check if the attr name is charset
+            # otherwise return
+            self.data.jumpTo(b"charset")
+            self.data.position += 1
+            self.data.skip()
+            if not self.data.currentByte == b"=":
+                # If there is no = sign keep looking for attrs
+                return None
+            self.data.position += 1
+            self.data.skip()
+            # Look for an encoding between matching quote marks
+            if self.data.currentByte in (b'"', b"'"):
+                quoteMark = self.data.currentByte
+                self.data.position += 1
+                oldPosition = self.data.position
+                if self.data.jumpTo(quoteMark):
+                    return self.data[oldPosition:self.data.position]
+                else:
+                    return None
+            else:
+                # Unquoted value
+                oldPosition = self.data.position
+                try:
+                    self.data.skipUntil(spaceCharactersBytes)
+                    return self.data[oldPosition:self.data.position]
+                except StopIteration:
+                    # Return the whole remaining value
+                    return self.data[oldPosition:]
+        except StopIteration:
+            return None
+
+
+def lookupEncoding(encoding):
+    """Return the python codec name corresponding to an encoding or None if the
+    string doesn't correspond to a valid encoding."""
+    if isinstance(encoding, bytes):
+        try:
+            encoding = encoding.decode("ascii")
+        except UnicodeDecodeError:
+            return None
+
+    if encoding is not None:
+        try:
+            return webencodings.lookup(encoding)
+        except AttributeError:
+            return None
+    else:
+        return None
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_tokenizer.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_tokenizer.py
new file mode 100644
index 000000000..5f00253e2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_tokenizer.py
@@ -0,0 +1,1735 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from pip._vendor.six import unichr as chr
+
+from collections import deque, OrderedDict
+from sys import version_info
+
+from .constants import spaceCharacters
+from .constants import entities
+from .constants import asciiLetters, asciiUpper2Lower
+from .constants import digits, hexDigits, EOF
+from .constants import tokenTypes, tagTokenTypes
+from .constants import replacementCharacters
+
+from ._inputstream import HTMLInputStream
+
+from ._trie import Trie
+
+entitiesTrie = Trie(entities)
+
+if version_info >= (3, 7):
+    attributeMap = dict
+else:
+    attributeMap = OrderedDict
+
+
+class HTMLTokenizer(object):
+    """ This class takes care of tokenizing HTML.
+
+    * self.currentToken
+      Holds the token that is currently being processed.
+
+    * self.state
+      Holds a reference to the method to be invoked... XXX
+
+    * self.stream
+      Points to HTMLInputStream object.
+    """
+
+    def __init__(self, stream, parser=None, **kwargs):
+
+        self.stream = HTMLInputStream(stream, **kwargs)
+        self.parser = parser
+
+        # Setup the initial tokenizer state
+        self.escapeFlag = False
+        self.lastFourChars = []
+        self.state = self.dataState
+        self.escape = False
+
+        # The current token being created
+        self.currentToken = None
+        super(HTMLTokenizer, self).__init__()
+
+    def __iter__(self):
+        """ This is where the magic happens.
+
+        We do our usually processing through the states and when we have a token
+        to return we yield the token which pauses processing until the next token
+        is requested.
+        """
+        self.tokenQueue = deque([])
+        # Start processing. When EOF is reached self.state will return False
+        # instead of True and the loop will terminate.
+        while self.state():
+            while self.stream.errors:
+                yield {"type": tokenTypes["ParseError"], "data": self.stream.errors.pop(0)}
+            while self.tokenQueue:
+                yield self.tokenQueue.popleft()
+
+    def consumeNumberEntity(self, isHex):
+        """This function returns either U+FFFD or the character based on the
+        decimal or hexadecimal representation. It also discards ";" if present.
+        If not present self.tokenQueue.append({"type": tokenTypes["ParseError"]}) is invoked.
+        """
+
+        allowed = digits
+        radix = 10
+        if isHex:
+            allowed = hexDigits
+            radix = 16
+
+        charStack = []
+
+        # Consume all the characters that are in range while making sure we
+        # don't hit an EOF.
+        c = self.stream.char()
+        while c in allowed and c is not EOF:
+            charStack.append(c)
+            c = self.stream.char()
+
+        # Convert the set of characters consumed to an int.
+        charAsInt = int("".join(charStack), radix)
+
+        # Certain characters get replaced with others
+        if charAsInt in replacementCharacters:
+            char = replacementCharacters[charAsInt]
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "illegal-codepoint-for-numeric-entity",
+                                    "datavars": {"charAsInt": charAsInt}})
+        elif ((0xD800 <= charAsInt <= 0xDFFF) or
+              (charAsInt > 0x10FFFF)):
+            char = "\uFFFD"
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "illegal-codepoint-for-numeric-entity",
+                                    "datavars": {"charAsInt": charAsInt}})
+        else:
+            # Should speed up this check somehow (e.g. move the set to a constant)
+            if ((0x0001 <= charAsInt <= 0x0008) or
+                (0x000E <= charAsInt <= 0x001F) or
+                (0x007F <= charAsInt <= 0x009F) or
+                (0xFDD0 <= charAsInt <= 0xFDEF) or
+                charAsInt in frozenset([0x000B, 0xFFFE, 0xFFFF, 0x1FFFE,
+                                        0x1FFFF, 0x2FFFE, 0x2FFFF, 0x3FFFE,
+                                        0x3FFFF, 0x4FFFE, 0x4FFFF, 0x5FFFE,
+                                        0x5FFFF, 0x6FFFE, 0x6FFFF, 0x7FFFE,
+                                        0x7FFFF, 0x8FFFE, 0x8FFFF, 0x9FFFE,
+                                        0x9FFFF, 0xAFFFE, 0xAFFFF, 0xBFFFE,
+                                        0xBFFFF, 0xCFFFE, 0xCFFFF, 0xDFFFE,
+                                        0xDFFFF, 0xEFFFE, 0xEFFFF, 0xFFFFE,
+                                        0xFFFFF, 0x10FFFE, 0x10FFFF])):
+                self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                        "data":
+                                        "illegal-codepoint-for-numeric-entity",
+                                        "datavars": {"charAsInt": charAsInt}})
+            try:
+                # Try/except needed as UCS-2 Python builds' unichar only works
+                # within the BMP.
+                char = chr(charAsInt)
+            except ValueError:
+                v = charAsInt - 0x10000
+                char = chr(0xD800 | (v >> 10)) + chr(0xDC00 | (v & 0x3FF))
+
+        # Discard the ; if present. Otherwise, put it back on the queue and
+        # invoke parseError on parser.
+        if c != ";":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "numeric-entity-without-semicolon"})
+            self.stream.unget(c)
+
+        return char
+
+    def consumeEntity(self, allowedChar=None, fromAttribute=False):
+        # Initialise to the default output for when no entity is matched
+        output = "&"
+
+        charStack = [self.stream.char()]
+        if (charStack[0] in spaceCharacters or charStack[0] in (EOF, "<", "&") or
+                (allowedChar is not None and allowedChar == charStack[0])):
+            self.stream.unget(charStack[0])
+
+        elif charStack[0] == "#":
+            # Read the next character to see if it's hex or decimal
+            hex = False
+            charStack.append(self.stream.char())
+            if charStack[-1] in ("x", "X"):
+                hex = True
+                charStack.append(self.stream.char())
+
+            # charStack[-1] should be the first digit
+            if (hex and charStack[-1] in hexDigits) \
+                    or (not hex and charStack[-1] in digits):
+                # At least one digit found, so consume the whole number
+                self.stream.unget(charStack[-1])
+                output = self.consumeNumberEntity(hex)
+            else:
+                # No digits found
+                self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                        "data": "expected-numeric-entity"})
+                self.stream.unget(charStack.pop())
+                output = "&" + "".join(charStack)
+
+        else:
+            # At this point in the process might have named entity. Entities
+            # are stored in the global variable "entities".
+            #
+            # Consume characters and compare to these to a substring of the
+            # entity names in the list until the substring no longer matches.
+            while (charStack[-1] is not EOF):
+                if not entitiesTrie.has_keys_with_prefix("".join(charStack)):
+                    break
+                charStack.append(self.stream.char())
+
+            # At this point we have a string that starts with some characters
+            # that may match an entity
+            # Try to find the longest entity the string will match to take care
+            # of &noti for instance.
+            try:
+                entityName = entitiesTrie.longest_prefix("".join(charStack[:-1]))
+                entityLength = len(entityName)
+            except KeyError:
+                entityName = None
+
+            if entityName is not None:
+                if entityName[-1] != ";":
+                    self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                            "named-entity-without-semicolon"})
+                if (entityName[-1] != ";" and fromAttribute and
+                    (charStack[entityLength] in asciiLetters or
+                     charStack[entityLength] in digits or
+                     charStack[entityLength] == "=")):
+                    self.stream.unget(charStack.pop())
+                    output = "&" + "".join(charStack)
+                else:
+                    output = entities[entityName]
+                    self.stream.unget(charStack.pop())
+                    output += "".join(charStack[entityLength:])
+            else:
+                self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                        "expected-named-entity"})
+                self.stream.unget(charStack.pop())
+                output = "&" + "".join(charStack)
+
+        if fromAttribute:
+            self.currentToken["data"][-1][1] += output
+        else:
+            if output in spaceCharacters:
+                tokenType = "SpaceCharacters"
+            else:
+                tokenType = "Characters"
+            self.tokenQueue.append({"type": tokenTypes[tokenType], "data": output})
+
+    def processEntityInAttribute(self, allowedChar):
+        """This method replaces the need for "entityInAttributeValueState".
+        """
+        self.consumeEntity(allowedChar=allowedChar, fromAttribute=True)
+
+    def emitCurrentToken(self):
+        """This method is a generic handler for emitting the tags. It also sets
+        the state to "data" because that's what's needed after a token has been
+        emitted.
+        """
+        token = self.currentToken
+        # Add token to the queue to be yielded
+        if (token["type"] in tagTokenTypes):
+            token["name"] = token["name"].translate(asciiUpper2Lower)
+            if token["type"] == tokenTypes["StartTag"]:
+                raw = token["data"]
+                data = attributeMap(raw)
+                if len(raw) > len(data):
+                    # we had some duplicated attribute, fix so first wins
+                    data.update(raw[::-1])
+                token["data"] = data
+
+            if token["type"] == tokenTypes["EndTag"]:
+                if token["data"]:
+                    self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                            "data": "attributes-in-end-tag"})
+                if token["selfClosing"]:
+                    self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                            "data": "self-closing-flag-on-end-tag"})
+        self.tokenQueue.append(token)
+        self.state = self.dataState
+
+    # Below are the various tokenizer states worked out.
+    def dataState(self):
+        data = self.stream.char()
+        if data == "&":
+            self.state = self.entityDataState
+        elif data == "<":
+            self.state = self.tagOpenState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\u0000"})
+        elif data is EOF:
+            # Tokenization ends.
+            return False
+        elif data in spaceCharacters:
+            # Directly after emitting a token you switch back to the "data
+            # state". At that point spaceCharacters are important so they are
+            # emitted separately.
+            self.tokenQueue.append({"type": tokenTypes["SpaceCharacters"], "data":
+                                    data + self.stream.charsUntil(spaceCharacters, True)})
+            # No need to update lastFourChars here, since the first space will
+            # have already been appended to lastFourChars and will have broken
+            # any <!-- or --> sequences
+        else:
+            chars = self.stream.charsUntil(("&", "<", "\u0000"))
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + chars})
+        return True
+
+    def entityDataState(self):
+        self.consumeEntity()
+        self.state = self.dataState
+        return True
+
+    def rcdataState(self):
+        data = self.stream.char()
+        if data == "&":
+            self.state = self.characterReferenceInRcdata
+        elif data == "<":
+            self.state = self.rcdataLessThanSignState
+        elif data == EOF:
+            # Tokenization ends.
+            return False
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        elif data in spaceCharacters:
+            # Directly after emitting a token you switch back to the "data
+            # state". At that point spaceCharacters are important so they are
+            # emitted separately.
+            self.tokenQueue.append({"type": tokenTypes["SpaceCharacters"], "data":
+                                    data + self.stream.charsUntil(spaceCharacters, True)})
+            # No need to update lastFourChars here, since the first space will
+            # have already been appended to lastFourChars and will have broken
+            # any <!-- or --> sequences
+        else:
+            chars = self.stream.charsUntil(("&", "<", "\u0000"))
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + chars})
+        return True
+
+    def characterReferenceInRcdata(self):
+        self.consumeEntity()
+        self.state = self.rcdataState
+        return True
+
+    def rawtextState(self):
+        data = self.stream.char()
+        if data == "<":
+            self.state = self.rawtextLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        elif data == EOF:
+            # Tokenization ends.
+            return False
+        else:
+            chars = self.stream.charsUntil(("<", "\u0000"))
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + chars})
+        return True
+
+    def scriptDataState(self):
+        data = self.stream.char()
+        if data == "<":
+            self.state = self.scriptDataLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        elif data == EOF:
+            # Tokenization ends.
+            return False
+        else:
+            chars = self.stream.charsUntil(("<", "\u0000"))
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + chars})
+        return True
+
+    def plaintextState(self):
+        data = self.stream.char()
+        if data == EOF:
+            # Tokenization ends.
+            return False
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + self.stream.charsUntil("\u0000")})
+        return True
+
+    def tagOpenState(self):
+        data = self.stream.char()
+        if data == "!":
+            self.state = self.markupDeclarationOpenState
+        elif data == "/":
+            self.state = self.closeTagOpenState
+        elif data in asciiLetters:
+            self.currentToken = {"type": tokenTypes["StartTag"],
+                                 "name": data, "data": [],
+                                 "selfClosing": False,
+                                 "selfClosingAcknowledged": False}
+            self.state = self.tagNameState
+        elif data == ">":
+            # XXX In theory it could be something besides a tag name. But
+            # do we really care?
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-tag-name-but-got-right-bracket"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<>"})
+            self.state = self.dataState
+        elif data == "?":
+            # XXX In theory it could be something besides a tag name. But
+            # do we really care?
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-tag-name-but-got-question-mark"})
+            self.stream.unget(data)
+            self.state = self.bogusCommentState
+        else:
+            # XXX
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-tag-name"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.stream.unget(data)
+            self.state = self.dataState
+        return True
+
+    def closeTagOpenState(self):
+        data = self.stream.char()
+        if data in asciiLetters:
+            self.currentToken = {"type": tokenTypes["EndTag"], "name": data,
+                                 "data": [], "selfClosing": False}
+            self.state = self.tagNameState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-closing-tag-but-got-right-bracket"})
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-closing-tag-but-got-eof"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
+            self.state = self.dataState
+        else:
+            # XXX data can be _'_...
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-closing-tag-but-got-char",
+                                    "datavars": {"data": data}})
+            self.stream.unget(data)
+            self.state = self.bogusCommentState
+        return True
+
+    def tagNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeAttributeNameState
+        elif data == ">":
+            self.emitCurrentToken()
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-tag-name"})
+            self.state = self.dataState
+        elif data == "/":
+            self.state = self.selfClosingStartTagState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["name"] += "\uFFFD"
+        else:
+            self.currentToken["name"] += data
+            # (Don't use charsUntil here, because tag names are
+            # very short and it's faster to not do anything fancy)
+        return True
+
+    def rcdataLessThanSignState(self):
+        data = self.stream.char()
+        if data == "/":
+            self.temporaryBuffer = ""
+            self.state = self.rcdataEndTagOpenState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.stream.unget(data)
+            self.state = self.rcdataState
+        return True
+
+    def rcdataEndTagOpenState(self):
+        data = self.stream.char()
+        if data in asciiLetters:
+            self.temporaryBuffer += data
+            self.state = self.rcdataEndTagNameState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
+            self.stream.unget(data)
+            self.state = self.rcdataState
+        return True
+
+    def rcdataEndTagNameState(self):
+        appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
+        data = self.stream.char()
+        if data in spaceCharacters and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.beforeAttributeNameState
+        elif data == "/" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.selfClosingStartTagState
+        elif data == ">" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.emitCurrentToken()
+            self.state = self.dataState
+        elif data in asciiLetters:
+            self.temporaryBuffer += data
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "</" + self.temporaryBuffer})
+            self.stream.unget(data)
+            self.state = self.rcdataState
+        return True
+
+    def rawtextLessThanSignState(self):
+        data = self.stream.char()
+        if data == "/":
+            self.temporaryBuffer = ""
+            self.state = self.rawtextEndTagOpenState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.stream.unget(data)
+            self.state = self.rawtextState
+        return True
+
+    def rawtextEndTagOpenState(self):
+        data = self.stream.char()
+        if data in asciiLetters:
+            self.temporaryBuffer += data
+            self.state = self.rawtextEndTagNameState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
+            self.stream.unget(data)
+            self.state = self.rawtextState
+        return True
+
+    def rawtextEndTagNameState(self):
+        appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
+        data = self.stream.char()
+        if data in spaceCharacters and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.beforeAttributeNameState
+        elif data == "/" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.selfClosingStartTagState
+        elif data == ">" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.emitCurrentToken()
+            self.state = self.dataState
+        elif data in asciiLetters:
+            self.temporaryBuffer += data
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "</" + self.temporaryBuffer})
+            self.stream.unget(data)
+            self.state = self.rawtextState
+        return True
+
+    def scriptDataLessThanSignState(self):
+        data = self.stream.char()
+        if data == "/":
+            self.temporaryBuffer = ""
+            self.state = self.scriptDataEndTagOpenState
+        elif data == "!":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<!"})
+            self.state = self.scriptDataEscapeStartState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.stream.unget(data)
+            self.state = self.scriptDataState
+        return True
+
+    def scriptDataEndTagOpenState(self):
+        data = self.stream.char()
+        if data in asciiLetters:
+            self.temporaryBuffer += data
+            self.state = self.scriptDataEndTagNameState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
+            self.stream.unget(data)
+            self.state = self.scriptDataState
+        return True
+
+    def scriptDataEndTagNameState(self):
+        appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
+        data = self.stream.char()
+        if data in spaceCharacters and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.beforeAttributeNameState
+        elif data == "/" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.selfClosingStartTagState
+        elif data == ">" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.emitCurrentToken()
+            self.state = self.dataState
+        elif data in asciiLetters:
+            self.temporaryBuffer += data
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "</" + self.temporaryBuffer})
+            self.stream.unget(data)
+            self.state = self.scriptDataState
+        return True
+
+    def scriptDataEscapeStartState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataEscapeStartDashState
+        else:
+            self.stream.unget(data)
+            self.state = self.scriptDataState
+        return True
+
+    def scriptDataEscapeStartDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataEscapedDashDashState
+        else:
+            self.stream.unget(data)
+            self.state = self.scriptDataState
+        return True
+
+    def scriptDataEscapedState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataEscapedDashState
+        elif data == "<":
+            self.state = self.scriptDataEscapedLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        elif data == EOF:
+            self.state = self.dataState
+        else:
+            chars = self.stream.charsUntil(("<", "-", "\u0000"))
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data":
+                                    data + chars})
+        return True
+
+    def scriptDataEscapedDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataEscapedDashDashState
+        elif data == "<":
+            self.state = self.scriptDataEscapedLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+            self.state = self.scriptDataEscapedState
+        elif data == EOF:
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataEscapedDashDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+        elif data == "<":
+            self.state = self.scriptDataEscapedLessThanSignState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": ">"})
+            self.state = self.scriptDataState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+            self.state = self.scriptDataEscapedState
+        elif data == EOF:
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataEscapedLessThanSignState(self):
+        data = self.stream.char()
+        if data == "/":
+            self.temporaryBuffer = ""
+            self.state = self.scriptDataEscapedEndTagOpenState
+        elif data in asciiLetters:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<" + data})
+            self.temporaryBuffer = data
+            self.state = self.scriptDataDoubleEscapeStartState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.stream.unget(data)
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataEscapedEndTagOpenState(self):
+        data = self.stream.char()
+        if data in asciiLetters:
+            self.temporaryBuffer = data
+            self.state = self.scriptDataEscapedEndTagNameState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "</"})
+            self.stream.unget(data)
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataEscapedEndTagNameState(self):
+        appropriate = self.currentToken and self.currentToken["name"].lower() == self.temporaryBuffer.lower()
+        data = self.stream.char()
+        if data in spaceCharacters and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.beforeAttributeNameState
+        elif data == "/" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.state = self.selfClosingStartTagState
+        elif data == ">" and appropriate:
+            self.currentToken = {"type": tokenTypes["EndTag"],
+                                 "name": self.temporaryBuffer,
+                                 "data": [], "selfClosing": False}
+            self.emitCurrentToken()
+            self.state = self.dataState
+        elif data in asciiLetters:
+            self.temporaryBuffer += data
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "</" + self.temporaryBuffer})
+            self.stream.unget(data)
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataDoubleEscapeStartState(self):
+        data = self.stream.char()
+        if data in (spaceCharacters | frozenset(("/", ">"))):
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            if self.temporaryBuffer.lower() == "script":
+                self.state = self.scriptDataDoubleEscapedState
+            else:
+                self.state = self.scriptDataEscapedState
+        elif data in asciiLetters:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.temporaryBuffer += data
+        else:
+            self.stream.unget(data)
+            self.state = self.scriptDataEscapedState
+        return True
+
+    def scriptDataDoubleEscapedState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataDoubleEscapedDashState
+        elif data == "<":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.state = self.scriptDataDoubleEscapedLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+        elif data == EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-script-in-script"})
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+        return True
+
+    def scriptDataDoubleEscapedDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+            self.state = self.scriptDataDoubleEscapedDashDashState
+        elif data == "<":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.state = self.scriptDataDoubleEscapedLessThanSignState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+            self.state = self.scriptDataDoubleEscapedState
+        elif data == EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-script-in-script"})
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.state = self.scriptDataDoubleEscapedState
+        return True
+
+    def scriptDataDoubleEscapedDashDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "-"})
+        elif data == "<":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "<"})
+            self.state = self.scriptDataDoubleEscapedLessThanSignState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": ">"})
+            self.state = self.scriptDataState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": "\uFFFD"})
+            self.state = self.scriptDataDoubleEscapedState
+        elif data == EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-script-in-script"})
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.state = self.scriptDataDoubleEscapedState
+        return True
+
+    def scriptDataDoubleEscapedLessThanSignState(self):
+        data = self.stream.char()
+        if data == "/":
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": "/"})
+            self.temporaryBuffer = ""
+            self.state = self.scriptDataDoubleEscapeEndState
+        else:
+            self.stream.unget(data)
+            self.state = self.scriptDataDoubleEscapedState
+        return True
+
+    def scriptDataDoubleEscapeEndState(self):
+        data = self.stream.char()
+        if data in (spaceCharacters | frozenset(("/", ">"))):
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            if self.temporaryBuffer.lower() == "script":
+                self.state = self.scriptDataEscapedState
+            else:
+                self.state = self.scriptDataDoubleEscapedState
+        elif data in asciiLetters:
+            self.tokenQueue.append({"type": tokenTypes["Characters"], "data": data})
+            self.temporaryBuffer += data
+        else:
+            self.stream.unget(data)
+            self.state = self.scriptDataDoubleEscapedState
+        return True
+
+    def beforeAttributeNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.stream.charsUntil(spaceCharacters, True)
+        elif data in asciiLetters:
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        elif data == ">":
+            self.emitCurrentToken()
+        elif data == "/":
+            self.state = self.selfClosingStartTagState
+        elif data in ("'", '"', "=", "<"):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "invalid-character-in-attribute-name"})
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"].append(["\uFFFD", ""])
+            self.state = self.attributeNameState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-attribute-name-but-got-eof"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        return True
+
+    def attributeNameState(self):
+        data = self.stream.char()
+        leavingThisState = True
+        emitToken = False
+        if data == "=":
+            self.state = self.beforeAttributeValueState
+        elif data in asciiLetters:
+            self.currentToken["data"][-1][0] += data +\
+                self.stream.charsUntil(asciiLetters, True)
+            leavingThisState = False
+        elif data == ">":
+            # XXX If we emit here the attributes are converted to a dict
+            # without being checked and when the code below runs we error
+            # because data is a dict not a list
+            emitToken = True
+        elif data in spaceCharacters:
+            self.state = self.afterAttributeNameState
+        elif data == "/":
+            self.state = self.selfClosingStartTagState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"][-1][0] += "\uFFFD"
+            leavingThisState = False
+        elif data in ("'", '"', "<"):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data":
+                                    "invalid-character-in-attribute-name"})
+            self.currentToken["data"][-1][0] += data
+            leavingThisState = False
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "eof-in-attribute-name"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"][-1][0] += data
+            leavingThisState = False
+
+        if leavingThisState:
+            # Attributes are not dropped at this stage. That happens when the
+            # start tag token is emitted so values can still be safely appended
+            # to attributes, but we do want to report the parse error in time.
+            self.currentToken["data"][-1][0] = (
+                self.currentToken["data"][-1][0].translate(asciiUpper2Lower))
+            for name, _ in self.currentToken["data"][:-1]:
+                if self.currentToken["data"][-1][0] == name:
+                    self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                            "duplicate-attribute"})
+                    break
+            # XXX Fix for above XXX
+            if emitToken:
+                self.emitCurrentToken()
+        return True
+
+    def afterAttributeNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.stream.charsUntil(spaceCharacters, True)
+        elif data == "=":
+            self.state = self.beforeAttributeValueState
+        elif data == ">":
+            self.emitCurrentToken()
+        elif data in asciiLetters:
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        elif data == "/":
+            self.state = self.selfClosingStartTagState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"].append(["\uFFFD", ""])
+            self.state = self.attributeNameState
+        elif data in ("'", '"', "<"):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "invalid-character-after-attribute-name"})
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-end-of-tag-but-got-eof"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"].append([data, ""])
+            self.state = self.attributeNameState
+        return True
+
+    def beforeAttributeValueState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.stream.charsUntil(spaceCharacters, True)
+        elif data == "\"":
+            self.state = self.attributeValueDoubleQuotedState
+        elif data == "&":
+            self.state = self.attributeValueUnQuotedState
+            self.stream.unget(data)
+        elif data == "'":
+            self.state = self.attributeValueSingleQuotedState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-attribute-value-but-got-right-bracket"})
+            self.emitCurrentToken()
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"][-1][1] += "\uFFFD"
+            self.state = self.attributeValueUnQuotedState
+        elif data in ("=", "<", "`"):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "equals-in-unquoted-attribute-value"})
+            self.currentToken["data"][-1][1] += data
+            self.state = self.attributeValueUnQuotedState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-attribute-value-but-got-eof"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"][-1][1] += data
+            self.state = self.attributeValueUnQuotedState
+        return True
+
+    def attributeValueDoubleQuotedState(self):
+        data = self.stream.char()
+        if data == "\"":
+            self.state = self.afterAttributeValueState
+        elif data == "&":
+            self.processEntityInAttribute('"')
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"][-1][1] += "\uFFFD"
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-attribute-value-double-quote"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"][-1][1] += data +\
+                self.stream.charsUntil(("\"", "&", "\u0000"))
+        return True
+
+    def attributeValueSingleQuotedState(self):
+        data = self.stream.char()
+        if data == "'":
+            self.state = self.afterAttributeValueState
+        elif data == "&":
+            self.processEntityInAttribute("'")
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"][-1][1] += "\uFFFD"
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-attribute-value-single-quote"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"][-1][1] += data +\
+                self.stream.charsUntil(("'", "&", "\u0000"))
+        return True
+
+    def attributeValueUnQuotedState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeAttributeNameState
+        elif data == "&":
+            self.processEntityInAttribute(">")
+        elif data == ">":
+            self.emitCurrentToken()
+        elif data in ('"', "'", "=", "<", "`"):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-character-in-unquoted-attribute-value"})
+            self.currentToken["data"][-1][1] += data
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"][-1][1] += "\uFFFD"
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-attribute-value-no-quotes"})
+            self.state = self.dataState
+        else:
+            self.currentToken["data"][-1][1] += data + self.stream.charsUntil(
+                frozenset(("&", ">", '"', "'", "=", "<", "`", "\u0000")) | spaceCharacters)
+        return True
+
+    def afterAttributeValueState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeAttributeNameState
+        elif data == ">":
+            self.emitCurrentToken()
+        elif data == "/":
+            self.state = self.selfClosingStartTagState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-EOF-after-attribute-value"})
+            self.stream.unget(data)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-character-after-attribute-value"})
+            self.stream.unget(data)
+            self.state = self.beforeAttributeNameState
+        return True
+
+    def selfClosingStartTagState(self):
+        data = self.stream.char()
+        if data == ">":
+            self.currentToken["selfClosing"] = True
+            self.emitCurrentToken()
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data":
+                                    "unexpected-EOF-after-solidus-in-tag"})
+            self.stream.unget(data)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-character-after-solidus-in-tag"})
+            self.stream.unget(data)
+            self.state = self.beforeAttributeNameState
+        return True
+
+    def bogusCommentState(self):
+        # Make a new comment token and give it as value all the characters
+        # until the first > or EOF (charsUntil checks for EOF automatically)
+        # and emit it.
+        data = self.stream.charsUntil(">")
+        data = data.replace("\u0000", "\uFFFD")
+        self.tokenQueue.append(
+            {"type": tokenTypes["Comment"], "data": data})
+
+        # Eat the character directly after the bogus comment which is either a
+        # ">" or an EOF.
+        self.stream.char()
+        self.state = self.dataState
+        return True
+
+    def markupDeclarationOpenState(self):
+        charStack = [self.stream.char()]
+        if charStack[-1] == "-":
+            charStack.append(self.stream.char())
+            if charStack[-1] == "-":
+                self.currentToken = {"type": tokenTypes["Comment"], "data": ""}
+                self.state = self.commentStartState
+                return True
+        elif charStack[-1] in ('d', 'D'):
+            matched = True
+            for expected in (('o', 'O'), ('c', 'C'), ('t', 'T'),
+                             ('y', 'Y'), ('p', 'P'), ('e', 'E')):
+                charStack.append(self.stream.char())
+                if charStack[-1] not in expected:
+                    matched = False
+                    break
+            if matched:
+                self.currentToken = {"type": tokenTypes["Doctype"],
+                                     "name": "",
+                                     "publicId": None, "systemId": None,
+                                     "correct": True}
+                self.state = self.doctypeState
+                return True
+        elif (charStack[-1] == "[" and
+              self.parser is not None and
+              self.parser.tree.openElements and
+              self.parser.tree.openElements[-1].namespace != self.parser.tree.defaultNamespace):
+            matched = True
+            for expected in ["C", "D", "A", "T", "A", "["]:
+                charStack.append(self.stream.char())
+                if charStack[-1] != expected:
+                    matched = False
+                    break
+            if matched:
+                self.state = self.cdataSectionState
+                return True
+
+        self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                "expected-dashes-or-doctype"})
+
+        while charStack:
+            self.stream.unget(charStack.pop())
+        self.state = self.bogusCommentState
+        return True
+
+    def commentStartState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.state = self.commentStartDashState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "incorrect-comment"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-comment"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["data"] += data
+            self.state = self.commentState
+        return True
+
+    def commentStartDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.state = self.commentEndState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "-\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "incorrect-comment"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-comment"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["data"] += "-" + data
+            self.state = self.commentState
+        return True
+
+    def commentState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.state = self.commentEndDashState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "\uFFFD"
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "eof-in-comment"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["data"] += data + \
+                self.stream.charsUntil(("-", "\u0000"))
+        return True
+
+    def commentEndDashState(self):
+        data = self.stream.char()
+        if data == "-":
+            self.state = self.commentEndState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "-\uFFFD"
+            self.state = self.commentState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-comment-end-dash"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["data"] += "-" + data
+            self.state = self.commentState
+        return True
+
+    def commentEndState(self):
+        data = self.stream.char()
+        if data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "--\uFFFD"
+            self.state = self.commentState
+        elif data == "!":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-bang-after-double-dash-in-comment"})
+            self.state = self.commentEndBangState
+        elif data == "-":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-dash-after-double-dash-in-comment"})
+            self.currentToken["data"] += data
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-comment-double-dash"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            # XXX
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-comment"})
+            self.currentToken["data"] += "--" + data
+            self.state = self.commentState
+        return True
+
+    def commentEndBangState(self):
+        data = self.stream.char()
+        if data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == "-":
+            self.currentToken["data"] += "--!"
+            self.state = self.commentEndDashState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["data"] += "--!\uFFFD"
+            self.state = self.commentState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-comment-end-bang-state"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["data"] += "--!" + data
+            self.state = self.commentState
+        return True
+
+    def doctypeState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeDoctypeNameState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-doctype-name-but-got-eof"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "need-space-after-doctype"})
+            self.stream.unget(data)
+            self.state = self.beforeDoctypeNameState
+        return True
+
+    def beforeDoctypeNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-doctype-name-but-got-right-bracket"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["name"] = "\uFFFD"
+            self.state = self.doctypeNameState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-doctype-name-but-got-eof"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["name"] = data
+            self.state = self.doctypeNameState
+        return True
+
+    def doctypeNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
+            self.state = self.afterDoctypeNameState
+        elif data == ">":
+            self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["name"] += "\uFFFD"
+            self.state = self.doctypeNameState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype-name"})
+            self.currentToken["correct"] = False
+            self.currentToken["name"] = self.currentToken["name"].translate(asciiUpper2Lower)
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["name"] += data
+        return True
+
+    def afterDoctypeNameState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.currentToken["correct"] = False
+            self.stream.unget(data)
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            if data in ("p", "P"):
+                matched = True
+                for expected in (("u", "U"), ("b", "B"), ("l", "L"),
+                                 ("i", "I"), ("c", "C")):
+                    data = self.stream.char()
+                    if data not in expected:
+                        matched = False
+                        break
+                if matched:
+                    self.state = self.afterDoctypePublicKeywordState
+                    return True
+            elif data in ("s", "S"):
+                matched = True
+                for expected in (("y", "Y"), ("s", "S"), ("t", "T"),
+                                 ("e", "E"), ("m", "M")):
+                    data = self.stream.char()
+                    if data not in expected:
+                        matched = False
+                        break
+                if matched:
+                    self.state = self.afterDoctypeSystemKeywordState
+                    return True
+
+            # All the characters read before the current 'data' will be
+            # [a-zA-Z], so they're garbage in the bogus doctype and can be
+            # discarded; only the latest character might be '>' or EOF
+            # and needs to be ungetted
+            self.stream.unget(data)
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "expected-space-or-right-bracket-in-doctype", "datavars":
+                                    {"data": data}})
+            self.currentToken["correct"] = False
+            self.state = self.bogusDoctypeState
+
+        return True
+
+    def afterDoctypePublicKeywordState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeDoctypePublicIdentifierState
+        elif data in ("'", '"'):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.stream.unget(data)
+            self.state = self.beforeDoctypePublicIdentifierState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.stream.unget(data)
+            self.state = self.beforeDoctypePublicIdentifierState
+        return True
+
+    def beforeDoctypePublicIdentifierState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == "\"":
+            self.currentToken["publicId"] = ""
+            self.state = self.doctypePublicIdentifierDoubleQuotedState
+        elif data == "'":
+            self.currentToken["publicId"] = ""
+            self.state = self.doctypePublicIdentifierSingleQuotedState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-end-of-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["correct"] = False
+            self.state = self.bogusDoctypeState
+        return True
+
+    def doctypePublicIdentifierDoubleQuotedState(self):
+        data = self.stream.char()
+        if data == "\"":
+            self.state = self.afterDoctypePublicIdentifierState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["publicId"] += "\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-end-of-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["publicId"] += data
+        return True
+
+    def doctypePublicIdentifierSingleQuotedState(self):
+        data = self.stream.char()
+        if data == "'":
+            self.state = self.afterDoctypePublicIdentifierState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["publicId"] += "\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-end-of-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["publicId"] += data
+        return True
+
+    def afterDoctypePublicIdentifierState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.betweenDoctypePublicAndSystemIdentifiersState
+        elif data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == '"':
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierDoubleQuotedState
+        elif data == "'":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierSingleQuotedState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["correct"] = False
+            self.state = self.bogusDoctypeState
+        return True
+
+    def betweenDoctypePublicAndSystemIdentifiersState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data == '"':
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierDoubleQuotedState
+        elif data == "'":
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierSingleQuotedState
+        elif data == EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["correct"] = False
+            self.state = self.bogusDoctypeState
+        return True
+
+    def afterDoctypeSystemKeywordState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            self.state = self.beforeDoctypeSystemIdentifierState
+        elif data in ("'", '"'):
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.stream.unget(data)
+            self.state = self.beforeDoctypeSystemIdentifierState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.stream.unget(data)
+            self.state = self.beforeDoctypeSystemIdentifierState
+        return True
+
+    def beforeDoctypeSystemIdentifierState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == "\"":
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierDoubleQuotedState
+        elif data == "'":
+            self.currentToken["systemId"] = ""
+            self.state = self.doctypeSystemIdentifierSingleQuotedState
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.currentToken["correct"] = False
+            self.state = self.bogusDoctypeState
+        return True
+
+    def doctypeSystemIdentifierDoubleQuotedState(self):
+        data = self.stream.char()
+        if data == "\"":
+            self.state = self.afterDoctypeSystemIdentifierState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["systemId"] += "\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-end-of-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["systemId"] += data
+        return True
+
+    def doctypeSystemIdentifierSingleQuotedState(self):
+        data = self.stream.char()
+        if data == "'":
+            self.state = self.afterDoctypeSystemIdentifierState
+        elif data == "\u0000":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                    "data": "invalid-codepoint"})
+            self.currentToken["systemId"] += "\uFFFD"
+        elif data == ">":
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-end-of-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.currentToken["systemId"] += data
+        return True
+
+    def afterDoctypeSystemIdentifierState(self):
+        data = self.stream.char()
+        if data in spaceCharacters:
+            pass
+        elif data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "eof-in-doctype"})
+            self.currentToken["correct"] = False
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            self.tokenQueue.append({"type": tokenTypes["ParseError"], "data":
+                                    "unexpected-char-in-doctype"})
+            self.state = self.bogusDoctypeState
+        return True
+
+    def bogusDoctypeState(self):
+        data = self.stream.char()
+        if data == ">":
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        elif data is EOF:
+            # XXX EMIT
+            self.stream.unget(data)
+            self.tokenQueue.append(self.currentToken)
+            self.state = self.dataState
+        else:
+            pass
+        return True
+
+    def cdataSectionState(self):
+        data = []
+        while True:
+            data.append(self.stream.charsUntil("]"))
+            data.append(self.stream.charsUntil(">"))
+            char = self.stream.char()
+            if char == EOF:
+                break
+            else:
+                assert char == ">"
+                if data[-1][-2:] == "]]":
+                    data[-1] = data[-1][:-2]
+                    break
+                else:
+                    data.append(char)
+
+        data = "".join(data)  # pylint:disable=redefined-variable-type
+        # Deal with null here rather than in the parser
+        nullCount = data.count("\u0000")
+        if nullCount > 0:
+            for _ in range(nullCount):
+                self.tokenQueue.append({"type": tokenTypes["ParseError"],
+                                        "data": "invalid-codepoint"})
+            data = data.replace("\u0000", "\uFFFD")
+        if data:
+            self.tokenQueue.append({"type": tokenTypes["Characters"],
+                                    "data": data})
+        self.state = self.dataState
+        return True
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__init__.py
new file mode 100644
index 000000000..07bad5d31
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__init__.py
@@ -0,0 +1,5 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from .py import Trie
+
+__all__ = ["Trie"]
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..fcac444ea
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc
new file mode 100644
index 000000000..fde13988d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/_base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc
new file mode 100644
index 000000000..c85ed89e2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/__pycache__/py.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/_base.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/_base.py
new file mode 100644
index 000000000..6b71975f0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/_base.py
@@ -0,0 +1,40 @@
+from __future__ import absolute_import, division, unicode_literals
+
+try:
+    from collections.abc import Mapping
+except ImportError:  # Python 2.7
+    from collections import Mapping
+
+
+class Trie(Mapping):
+    """Abstract base class for tries"""
+
+    def keys(self, prefix=None):
+        # pylint:disable=arguments-differ
+        keys = super(Trie, self).keys()
+
+        if prefix is None:
+            return set(keys)
+
+        return {x for x in keys if x.startswith(prefix)}
+
+    def has_keys_with_prefix(self, prefix):
+        for key in self.keys():
+            if key.startswith(prefix):
+                return True
+
+        return False
+
+    def longest_prefix(self, prefix):
+        if prefix in self:
+            return prefix
+
+        for i in range(1, len(prefix) + 1):
+            if prefix[:-i] in self:
+                return prefix[:-i]
+
+        raise KeyError(prefix)
+
+    def longest_prefix_item(self, prefix):
+        lprefix = self.longest_prefix(prefix)
+        return (lprefix, self[lprefix])
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/py.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/py.py
new file mode 100644
index 000000000..c178b219d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_trie/py.py
@@ -0,0 +1,67 @@
+from __future__ import absolute_import, division, unicode_literals
+from pip._vendor.six import text_type
+
+from bisect import bisect_left
+
+from ._base import Trie as ABCTrie
+
+
+class Trie(ABCTrie):
+    def __init__(self, data):
+        if not all(isinstance(x, text_type) for x in data.keys()):
+            raise TypeError("All keys must be strings")
+
+        self._data = data
+        self._keys = sorted(data.keys())
+        self._cachestr = ""
+        self._cachepoints = (0, len(data))
+
+    def __contains__(self, key):
+        return key in self._data
+
+    def __len__(self):
+        return len(self._data)
+
+    def __iter__(self):
+        return iter(self._data)
+
+    def __getitem__(self, key):
+        return self._data[key]
+
+    def keys(self, prefix=None):
+        if prefix is None or prefix == "" or not self._keys:
+            return set(self._keys)
+
+        if prefix.startswith(self._cachestr):
+            lo, hi = self._cachepoints
+            start = i = bisect_left(self._keys, prefix, lo, hi)
+        else:
+            start = i = bisect_left(self._keys, prefix)
+
+        keys = set()
+        if start == len(self._keys):
+            return keys
+
+        while self._keys[i].startswith(prefix):
+            keys.add(self._keys[i])
+            i += 1
+
+        self._cachestr = prefix
+        self._cachepoints = (start, i)
+
+        return keys
+
+    def has_keys_with_prefix(self, prefix):
+        if prefix in self._data:
+            return True
+
+        if prefix.startswith(self._cachestr):
+            lo, hi = self._cachepoints
+            i = bisect_left(self._keys, prefix, lo, hi)
+        else:
+            i = bisect_left(self._keys, prefix)
+
+        if i == len(self._keys):
+            return False
+
+        return self._keys[i].startswith(prefix)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/_utils.py b/venv/Lib/site-packages/pip/_vendor/html5lib/_utils.py
new file mode 100644
index 000000000..d7c4926af
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/_utils.py
@@ -0,0 +1,159 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from types import ModuleType
+
+try:
+    from collections.abc import Mapping
+except ImportError:
+    from collections import Mapping
+
+from pip._vendor.six import text_type, PY3
+
+if PY3:
+    import xml.etree.ElementTree as default_etree
+else:
+    try:
+        import xml.etree.cElementTree as default_etree
+    except ImportError:
+        import xml.etree.ElementTree as default_etree
+
+
+__all__ = ["default_etree", "MethodDispatcher", "isSurrogatePair",
+           "surrogatePairToCodepoint", "moduleFactoryFactory",
+           "supports_lone_surrogates"]
+
+
+# Platforms not supporting lone surrogates (\uD800-\uDFFF) should be
+# caught by the below test. In general this would be any platform
+# using UTF-16 as its encoding of unicode strings, such as
+# Jython. This is because UTF-16 itself is based on the use of such
+# surrogates, and there is no mechanism to further escape such
+# escapes.
+try:
+    _x = eval('"\\uD800"')  # pylint:disable=eval-used
+    if not isinstance(_x, text_type):
+        # We need this with u"" because of http://bugs.jython.org/issue2039
+        _x = eval('u"\\uD800"')  # pylint:disable=eval-used
+        assert isinstance(_x, text_type)
+except Exception:
+    supports_lone_surrogates = False
+else:
+    supports_lone_surrogates = True
+
+
+class MethodDispatcher(dict):
+    """Dict with 2 special properties:
+
+    On initiation, keys that are lists, sets or tuples are converted to
+    multiple keys so accessing any one of the items in the original
+    list-like object returns the matching value
+
+    md = MethodDispatcher({("foo", "bar"):"baz"})
+    md["foo"] == "baz"
+
+    A default value which can be set through the default attribute.
+    """
+
+    def __init__(self, items=()):
+        _dictEntries = []
+        for name, value in items:
+            if isinstance(name, (list, tuple, frozenset, set)):
+                for item in name:
+                    _dictEntries.append((item, value))
+            else:
+                _dictEntries.append((name, value))
+        dict.__init__(self, _dictEntries)
+        assert len(self) == len(_dictEntries)
+        self.default = None
+
+    def __getitem__(self, key):
+        return dict.get(self, key, self.default)
+
+    def __get__(self, instance, owner=None):
+        return BoundMethodDispatcher(instance, self)
+
+
+class BoundMethodDispatcher(Mapping):
+    """Wraps a MethodDispatcher, binding its return values to `instance`"""
+    def __init__(self, instance, dispatcher):
+        self.instance = instance
+        self.dispatcher = dispatcher
+
+    def __getitem__(self, key):
+        # see https://docs.python.org/3/reference/datamodel.html#object.__get__
+        # on a function, __get__ is used to bind a function to an instance as a bound method
+        return self.dispatcher[key].__get__(self.instance)
+
+    def get(self, key, default):
+        if key in self.dispatcher:
+            return self[key]
+        else:
+            return default
+
+    def __iter__(self):
+        return iter(self.dispatcher)
+
+    def __len__(self):
+        return len(self.dispatcher)
+
+    def __contains__(self, key):
+        return key in self.dispatcher
+
+
+# Some utility functions to deal with weirdness around UCS2 vs UCS4
+# python builds
+
+def isSurrogatePair(data):
+    return (len(data) == 2 and
+            ord(data[0]) >= 0xD800 and ord(data[0]) <= 0xDBFF and
+            ord(data[1]) >= 0xDC00 and ord(data[1]) <= 0xDFFF)
+
+
+def surrogatePairToCodepoint(data):
+    char_val = (0x10000 + (ord(data[0]) - 0xD800) * 0x400 +
+                (ord(data[1]) - 0xDC00))
+    return char_val
+
+# Module Factory Factory (no, this isn't Java, I know)
+# Here to stop this being duplicated all over the place.
+
+
+def moduleFactoryFactory(factory):
+    moduleCache = {}
+
+    def moduleFactory(baseModule, *args, **kwargs):
+        if isinstance(ModuleType.__name__, type("")):
+            name = "_%s_factory" % baseModule.__name__
+        else:
+            name = b"_%s_factory" % baseModule.__name__
+
+        kwargs_tuple = tuple(kwargs.items())
+
+        try:
+            return moduleCache[name][args][kwargs_tuple]
+        except KeyError:
+            mod = ModuleType(name)
+            objs = factory(baseModule, *args, **kwargs)
+            mod.__dict__.update(objs)
+            if "name" not in moduleCache:
+                moduleCache[name] = {}
+            if "args" not in moduleCache[name]:
+                moduleCache[name][args] = {}
+            if "kwargs" not in moduleCache[name][args]:
+                moduleCache[name][args][kwargs_tuple] = {}
+            moduleCache[name][args][kwargs_tuple] = mod
+            return mod
+
+    return moduleFactory
+
+
+def memoize(func):
+    cache = {}
+
+    def wrapped(*args, **kwargs):
+        key = (tuple(args), tuple(kwargs.items()))
+        if key not in cache:
+            cache[key] = func(*args, **kwargs)
+        return cache[key]
+
+    return wrapped
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/constants.py b/venv/Lib/site-packages/pip/_vendor/html5lib/constants.py
new file mode 100644
index 000000000..fe3e237cd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/constants.py
@@ -0,0 +1,2946 @@
+from __future__ import absolute_import, division, unicode_literals
+
+import string
+
+EOF = None
+
+E = {
+    "null-character":
+        "Null character in input stream, replaced with U+FFFD.",
+    "invalid-codepoint":
+        "Invalid codepoint in stream.",
+    "incorrectly-placed-solidus":
+        "Solidus (/) incorrectly placed in tag.",
+    "incorrect-cr-newline-entity":
+        "Incorrect CR newline entity, replaced with LF.",
+    "illegal-windows-1252-entity":
+        "Entity used with illegal number (windows-1252 reference).",
+    "cant-convert-numeric-entity":
+        "Numeric entity couldn't be converted to character "
+        "(codepoint U+%(charAsInt)08x).",
+    "illegal-codepoint-for-numeric-entity":
+        "Numeric entity represents an illegal codepoint: "
+        "U+%(charAsInt)08x.",
+    "numeric-entity-without-semicolon":
+        "Numeric entity didn't end with ';'.",
+    "expected-numeric-entity-but-got-eof":
+        "Numeric entity expected. Got end of file instead.",
+    "expected-numeric-entity":
+        "Numeric entity expected but none found.",
+    "named-entity-without-semicolon":
+        "Named entity didn't end with ';'.",
+    "expected-named-entity":
+        "Named entity expected. Got none.",
+    "attributes-in-end-tag":
+        "End tag contains unexpected attributes.",
+    'self-closing-flag-on-end-tag':
+        "End tag contains unexpected self-closing flag.",
+    "expected-tag-name-but-got-right-bracket":
+        "Expected tag name. Got '>' instead.",
+    "expected-tag-name-but-got-question-mark":
+        "Expected tag name. Got '?' instead. (HTML doesn't "
+        "support processing instructions.)",
+    "expected-tag-name":
+        "Expected tag name. Got something else instead",
+    "expected-closing-tag-but-got-right-bracket":
+        "Expected closing tag. Got '>' instead. Ignoring '</>'.",
+    "expected-closing-tag-but-got-eof":
+        "Expected closing tag. Unexpected end of file.",
+    "expected-closing-tag-but-got-char":
+        "Expected closing tag. Unexpected character '%(data)s' found.",
+    "eof-in-tag-name":
+        "Unexpected end of file in the tag name.",
+    "expected-attribute-name-but-got-eof":
+        "Unexpected end of file. Expected attribute name instead.",
+    "eof-in-attribute-name":
+        "Unexpected end of file in attribute name.",
+    "invalid-character-in-attribute-name":
+        "Invalid character in attribute name",
+    "duplicate-attribute":
+        "Dropped duplicate attribute on tag.",
+    "expected-end-of-tag-name-but-got-eof":
+        "Unexpected end of file. Expected = or end of tag.",
+    "expected-attribute-value-but-got-eof":
+        "Unexpected end of file. Expected attribute value.",
+    "expected-attribute-value-but-got-right-bracket":
+        "Expected attribute value. Got '>' instead.",
+    'equals-in-unquoted-attribute-value':
+        "Unexpected = in unquoted attribute",
+    'unexpected-character-in-unquoted-attribute-value':
+        "Unexpected character in unquoted attribute",
+    "invalid-character-after-attribute-name":
+        "Unexpected character after attribute name.",
+    "unexpected-character-after-attribute-value":
+        "Unexpected character after attribute value.",
+    "eof-in-attribute-value-double-quote":
+        "Unexpected end of file in attribute value (\").",
+    "eof-in-attribute-value-single-quote":
+        "Unexpected end of file in attribute value (').",
+    "eof-in-attribute-value-no-quotes":
+        "Unexpected end of file in attribute value.",
+    "unexpected-EOF-after-solidus-in-tag":
+        "Unexpected end of file in tag. Expected >",
+    "unexpected-character-after-solidus-in-tag":
+        "Unexpected character after / in tag. Expected >",
+    "expected-dashes-or-doctype":
+        "Expected '--' or 'DOCTYPE'. Not found.",
+    "unexpected-bang-after-double-dash-in-comment":
+        "Unexpected ! after -- in comment",
+    "unexpected-space-after-double-dash-in-comment":
+        "Unexpected space after -- in comment",
+    "incorrect-comment":
+        "Incorrect comment.",
+    "eof-in-comment":
+        "Unexpected end of file in comment.",
+    "eof-in-comment-end-dash":
+        "Unexpected end of file in comment (-)",
+    "unexpected-dash-after-double-dash-in-comment":
+        "Unexpected '-' after '--' found in comment.",
+    "eof-in-comment-double-dash":
+        "Unexpected end of file in comment (--).",
+    "eof-in-comment-end-space-state":
+        "Unexpected end of file in comment.",
+    "eof-in-comment-end-bang-state":
+        "Unexpected end of file in comment.",
+    "unexpected-char-in-comment":
+        "Unexpected character in comment found.",
+    "need-space-after-doctype":
+        "No space after literal string 'DOCTYPE'.",
+    "expected-doctype-name-but-got-right-bracket":
+        "Unexpected > character. Expected DOCTYPE name.",
+    "expected-doctype-name-but-got-eof":
+        "Unexpected end of file. Expected DOCTYPE name.",
+    "eof-in-doctype-name":
+        "Unexpected end of file in DOCTYPE name.",
+    "eof-in-doctype":
+        "Unexpected end of file in DOCTYPE.",
+    "expected-space-or-right-bracket-in-doctype":
+        "Expected space or '>'. Got '%(data)s'",
+    "unexpected-end-of-doctype":
+        "Unexpected end of DOCTYPE.",
+    "unexpected-char-in-doctype":
+        "Unexpected character in DOCTYPE.",
+    "eof-in-innerhtml":
+        "XXX innerHTML EOF",
+    "unexpected-doctype":
+        "Unexpected DOCTYPE. Ignored.",
+    "non-html-root":
+        "html needs to be the first start tag.",
+    "expected-doctype-but-got-eof":
+        "Unexpected End of file. Expected DOCTYPE.",
+    "unknown-doctype":
+        "Erroneous DOCTYPE.",
+    "expected-doctype-but-got-chars":
+        "Unexpected non-space characters. Expected DOCTYPE.",
+    "expected-doctype-but-got-start-tag":
+        "Unexpected start tag (%(name)s). Expected DOCTYPE.",
+    "expected-doctype-but-got-end-tag":
+        "Unexpected end tag (%(name)s). Expected DOCTYPE.",
+    "end-tag-after-implied-root":
+        "Unexpected end tag (%(name)s) after the (implied) root element.",
+    "expected-named-closing-tag-but-got-eof":
+        "Unexpected end of file. Expected end tag (%(name)s).",
+    "two-heads-are-not-better-than-one":
+        "Unexpected start tag head in existing head. Ignored.",
+    "unexpected-end-tag":
+        "Unexpected end tag (%(name)s). Ignored.",
+    "unexpected-start-tag-out-of-my-head":
+        "Unexpected start tag (%(name)s) that can be in head. Moved.",
+    "unexpected-start-tag":
+        "Unexpected start tag (%(name)s).",
+    "missing-end-tag":
+        "Missing end tag (%(name)s).",
+    "missing-end-tags":
+        "Missing end tags (%(name)s).",
+    "unexpected-start-tag-implies-end-tag":
+        "Unexpected start tag (%(startName)s) "
+        "implies end tag (%(endName)s).",
+    "unexpected-start-tag-treated-as":
+        "Unexpected start tag (%(originalName)s). Treated as %(newName)s.",
+    "deprecated-tag":
+        "Unexpected start tag %(name)s. Don't use it!",
+    "unexpected-start-tag-ignored":
+        "Unexpected start tag %(name)s. Ignored.",
+    "expected-one-end-tag-but-got-another":
+        "Unexpected end tag (%(gotName)s). "
+        "Missing end tag (%(expectedName)s).",
+    "end-tag-too-early":
+        "End tag (%(name)s) seen too early. Expected other end tag.",
+    "end-tag-too-early-named":
+        "Unexpected end tag (%(gotName)s). Expected end tag (%(expectedName)s).",
+    "end-tag-too-early-ignored":
+        "End tag (%(name)s) seen too early. Ignored.",
+    "adoption-agency-1.1":
+        "End tag (%(name)s) violates step 1, "
+        "paragraph 1 of the adoption agency algorithm.",
+    "adoption-agency-1.2":
+        "End tag (%(name)s) violates step 1, "
+        "paragraph 2 of the adoption agency algorithm.",
+    "adoption-agency-1.3":
+        "End tag (%(name)s) violates step 1, "
+        "paragraph 3 of the adoption agency algorithm.",
+    "adoption-agency-4.4":
+        "End tag (%(name)s) violates step 4, "
+        "paragraph 4 of the adoption agency algorithm.",
+    "unexpected-end-tag-treated-as":
+        "Unexpected end tag (%(originalName)s). Treated as %(newName)s.",
+    "no-end-tag":
+        "This element (%(name)s) has no end tag.",
+    "unexpected-implied-end-tag-in-table":
+        "Unexpected implied end tag (%(name)s) in the table phase.",
+    "unexpected-implied-end-tag-in-table-body":
+        "Unexpected implied end tag (%(name)s) in the table body phase.",
+    "unexpected-char-implies-table-voodoo":
+        "Unexpected non-space characters in "
+        "table context caused voodoo mode.",
+    "unexpected-hidden-input-in-table":
+        "Unexpected input with type hidden in table context.",
+    "unexpected-form-in-table":
+        "Unexpected form in table context.",
+    "unexpected-start-tag-implies-table-voodoo":
+        "Unexpected start tag (%(name)s) in "
+        "table context caused voodoo mode.",
+    "unexpected-end-tag-implies-table-voodoo":
+        "Unexpected end tag (%(name)s) in "
+        "table context caused voodoo mode.",
+    "unexpected-cell-in-table-body":
+        "Unexpected table cell start tag (%(name)s) "
+        "in the table body phase.",
+    "unexpected-cell-end-tag":
+        "Got table cell end tag (%(name)s) "
+        "while required end tags are missing.",
+    "unexpected-end-tag-in-table-body":
+        "Unexpected end tag (%(name)s) in the table body phase. Ignored.",
+    "unexpected-implied-end-tag-in-table-row":
+        "Unexpected implied end tag (%(name)s) in the table row phase.",
+    "unexpected-end-tag-in-table-row":
+        "Unexpected end tag (%(name)s) in the table row phase. Ignored.",
+    "unexpected-select-in-select":
+        "Unexpected select start tag in the select phase "
+        "treated as select end tag.",
+    "unexpected-input-in-select":
+        "Unexpected input start tag in the select phase.",
+    "unexpected-start-tag-in-select":
+        "Unexpected start tag token (%(name)s in the select phase. "
+        "Ignored.",
+    "unexpected-end-tag-in-select":
+        "Unexpected end tag (%(name)s) in the select phase. Ignored.",
+    "unexpected-table-element-start-tag-in-select-in-table":
+        "Unexpected table element start tag (%(name)s) in the select in table phase.",
+    "unexpected-table-element-end-tag-in-select-in-table":
+        "Unexpected table element end tag (%(name)s) in the select in table phase.",
+    "unexpected-char-after-body":
+        "Unexpected non-space characters in the after body phase.",
+    "unexpected-start-tag-after-body":
+        "Unexpected start tag token (%(name)s)"
+        " in the after body phase.",
+    "unexpected-end-tag-after-body":
+        "Unexpected end tag token (%(name)s)"
+        " in the after body phase.",
+    "unexpected-char-in-frameset":
+        "Unexpected characters in the frameset phase. Characters ignored.",
+    "unexpected-start-tag-in-frameset":
+        "Unexpected start tag token (%(name)s)"
+        " in the frameset phase. Ignored.",
+    "unexpected-frameset-in-frameset-innerhtml":
+        "Unexpected end tag token (frameset) "
+        "in the frameset phase (innerHTML).",
+    "unexpected-end-tag-in-frameset":
+        "Unexpected end tag token (%(name)s)"
+        " in the frameset phase. Ignored.",
+    "unexpected-char-after-frameset":
+        "Unexpected non-space characters in the "
+        "after frameset phase. Ignored.",
+    "unexpected-start-tag-after-frameset":
+        "Unexpected start tag (%(name)s)"
+        " in the after frameset phase. Ignored.",
+    "unexpected-end-tag-after-frameset":
+        "Unexpected end tag (%(name)s)"
+        " in the after frameset phase. Ignored.",
+    "unexpected-end-tag-after-body-innerhtml":
+        "Unexpected end tag after body(innerHtml)",
+    "expected-eof-but-got-char":
+        "Unexpected non-space characters. Expected end of file.",
+    "expected-eof-but-got-start-tag":
+        "Unexpected start tag (%(name)s)"
+        ". Expected end of file.",
+    "expected-eof-but-got-end-tag":
+        "Unexpected end tag (%(name)s)"
+        ". Expected end of file.",
+    "eof-in-table":
+        "Unexpected end of file. Expected table content.",
+    "eof-in-select":
+        "Unexpected end of file. Expected select content.",
+    "eof-in-frameset":
+        "Unexpected end of file. Expected frameset content.",
+    "eof-in-script-in-script":
+        "Unexpected end of file. Expected script content.",
+    "eof-in-foreign-lands":
+        "Unexpected end of file. Expected foreign content",
+    "non-void-element-with-trailing-solidus":
+        "Trailing solidus not allowed on element %(name)s",
+    "unexpected-html-element-in-foreign-content":
+        "Element %(name)s not allowed in a non-html context",
+    "unexpected-end-tag-before-html":
+        "Unexpected end tag (%(name)s) before html.",
+    "unexpected-inhead-noscript-tag":
+        "Element %(name)s not allowed in a inhead-noscript context",
+    "eof-in-head-noscript":
+        "Unexpected end of file. Expected inhead-noscript content",
+    "char-in-head-noscript":
+        "Unexpected non-space character. Expected inhead-noscript content",
+    "XXX-undefined-error":
+        "Undefined error (this sucks and should be fixed)",
+}
+
+namespaces = {
+    "html": "http://www.w3.org/1999/xhtml",
+    "mathml": "http://www.w3.org/1998/Math/MathML",
+    "svg": "http://www.w3.org/2000/svg",
+    "xlink": "http://www.w3.org/1999/xlink",
+    "xml": "http://www.w3.org/XML/1998/namespace",
+    "xmlns": "http://www.w3.org/2000/xmlns/"
+}
+
+scopingElements = frozenset([
+    (namespaces["html"], "applet"),
+    (namespaces["html"], "caption"),
+    (namespaces["html"], "html"),
+    (namespaces["html"], "marquee"),
+    (namespaces["html"], "object"),
+    (namespaces["html"], "table"),
+    (namespaces["html"], "td"),
+    (namespaces["html"], "th"),
+    (namespaces["mathml"], "mi"),
+    (namespaces["mathml"], "mo"),
+    (namespaces["mathml"], "mn"),
+    (namespaces["mathml"], "ms"),
+    (namespaces["mathml"], "mtext"),
+    (namespaces["mathml"], "annotation-xml"),
+    (namespaces["svg"], "foreignObject"),
+    (namespaces["svg"], "desc"),
+    (namespaces["svg"], "title"),
+])
+
+formattingElements = frozenset([
+    (namespaces["html"], "a"),
+    (namespaces["html"], "b"),
+    (namespaces["html"], "big"),
+    (namespaces["html"], "code"),
+    (namespaces["html"], "em"),
+    (namespaces["html"], "font"),
+    (namespaces["html"], "i"),
+    (namespaces["html"], "nobr"),
+    (namespaces["html"], "s"),
+    (namespaces["html"], "small"),
+    (namespaces["html"], "strike"),
+    (namespaces["html"], "strong"),
+    (namespaces["html"], "tt"),
+    (namespaces["html"], "u")
+])
+
+specialElements = frozenset([
+    (namespaces["html"], "address"),
+    (namespaces["html"], "applet"),
+    (namespaces["html"], "area"),
+    (namespaces["html"], "article"),
+    (namespaces["html"], "aside"),
+    (namespaces["html"], "base"),
+    (namespaces["html"], "basefont"),
+    (namespaces["html"], "bgsound"),
+    (namespaces["html"], "blockquote"),
+    (namespaces["html"], "body"),
+    (namespaces["html"], "br"),
+    (namespaces["html"], "button"),
+    (namespaces["html"], "caption"),
+    (namespaces["html"], "center"),
+    (namespaces["html"], "col"),
+    (namespaces["html"], "colgroup"),
+    (namespaces["html"], "command"),
+    (namespaces["html"], "dd"),
+    (namespaces["html"], "details"),
+    (namespaces["html"], "dir"),
+    (namespaces["html"], "div"),
+    (namespaces["html"], "dl"),
+    (namespaces["html"], "dt"),
+    (namespaces["html"], "embed"),
+    (namespaces["html"], "fieldset"),
+    (namespaces["html"], "figure"),
+    (namespaces["html"], "footer"),
+    (namespaces["html"], "form"),
+    (namespaces["html"], "frame"),
+    (namespaces["html"], "frameset"),
+    (namespaces["html"], "h1"),
+    (namespaces["html"], "h2"),
+    (namespaces["html"], "h3"),
+    (namespaces["html"], "h4"),
+    (namespaces["html"], "h5"),
+    (namespaces["html"], "h6"),
+    (namespaces["html"], "head"),
+    (namespaces["html"], "header"),
+    (namespaces["html"], "hr"),
+    (namespaces["html"], "html"),
+    (namespaces["html"], "iframe"),
+    # Note that image is commented out in the spec as "this isn't an
+    # element that can end up on the stack, so it doesn't matter,"
+    (namespaces["html"], "image"),
+    (namespaces["html"], "img"),
+    (namespaces["html"], "input"),
+    (namespaces["html"], "isindex"),
+    (namespaces["html"], "li"),
+    (namespaces["html"], "link"),
+    (namespaces["html"], "listing"),
+    (namespaces["html"], "marquee"),
+    (namespaces["html"], "menu"),
+    (namespaces["html"], "meta"),
+    (namespaces["html"], "nav"),
+    (namespaces["html"], "noembed"),
+    (namespaces["html"], "noframes"),
+    (namespaces["html"], "noscript"),
+    (namespaces["html"], "object"),
+    (namespaces["html"], "ol"),
+    (namespaces["html"], "p"),
+    (namespaces["html"], "param"),
+    (namespaces["html"], "plaintext"),
+    (namespaces["html"], "pre"),
+    (namespaces["html"], "script"),
+    (namespaces["html"], "section"),
+    (namespaces["html"], "select"),
+    (namespaces["html"], "style"),
+    (namespaces["html"], "table"),
+    (namespaces["html"], "tbody"),
+    (namespaces["html"], "td"),
+    (namespaces["html"], "textarea"),
+    (namespaces["html"], "tfoot"),
+    (namespaces["html"], "th"),
+    (namespaces["html"], "thead"),
+    (namespaces["html"], "title"),
+    (namespaces["html"], "tr"),
+    (namespaces["html"], "ul"),
+    (namespaces["html"], "wbr"),
+    (namespaces["html"], "xmp"),
+    (namespaces["svg"], "foreignObject")
+])
+
+htmlIntegrationPointElements = frozenset([
+    (namespaces["mathml"], "annotation-xml"),
+    (namespaces["svg"], "foreignObject"),
+    (namespaces["svg"], "desc"),
+    (namespaces["svg"], "title")
+])
+
+mathmlTextIntegrationPointElements = frozenset([
+    (namespaces["mathml"], "mi"),
+    (namespaces["mathml"], "mo"),
+    (namespaces["mathml"], "mn"),
+    (namespaces["mathml"], "ms"),
+    (namespaces["mathml"], "mtext")
+])
+
+adjustSVGAttributes = {
+    "attributename": "attributeName",
+    "attributetype": "attributeType",
+    "basefrequency": "baseFrequency",
+    "baseprofile": "baseProfile",
+    "calcmode": "calcMode",
+    "clippathunits": "clipPathUnits",
+    "contentscripttype": "contentScriptType",
+    "contentstyletype": "contentStyleType",
+    "diffuseconstant": "diffuseConstant",
+    "edgemode": "edgeMode",
+    "externalresourcesrequired": "externalResourcesRequired",
+    "filterres": "filterRes",
+    "filterunits": "filterUnits",
+    "glyphref": "glyphRef",
+    "gradienttransform": "gradientTransform",
+    "gradientunits": "gradientUnits",
+    "kernelmatrix": "kernelMatrix",
+    "kernelunitlength": "kernelUnitLength",
+    "keypoints": "keyPoints",
+    "keysplines": "keySplines",
+    "keytimes": "keyTimes",
+    "lengthadjust": "lengthAdjust",
+    "limitingconeangle": "limitingConeAngle",
+    "markerheight": "markerHeight",
+    "markerunits": "markerUnits",
+    "markerwidth": "markerWidth",
+    "maskcontentunits": "maskContentUnits",
+    "maskunits": "maskUnits",
+    "numoctaves": "numOctaves",
+    "pathlength": "pathLength",
+    "patterncontentunits": "patternContentUnits",
+    "patterntransform": "patternTransform",
+    "patternunits": "patternUnits",
+    "pointsatx": "pointsAtX",
+    "pointsaty": "pointsAtY",
+    "pointsatz": "pointsAtZ",
+    "preservealpha": "preserveAlpha",
+    "preserveaspectratio": "preserveAspectRatio",
+    "primitiveunits": "primitiveUnits",
+    "refx": "refX",
+    "refy": "refY",
+    "repeatcount": "repeatCount",
+    "repeatdur": "repeatDur",
+    "requiredextensions": "requiredExtensions",
+    "requiredfeatures": "requiredFeatures",
+    "specularconstant": "specularConstant",
+    "specularexponent": "specularExponent",
+    "spreadmethod": "spreadMethod",
+    "startoffset": "startOffset",
+    "stddeviation": "stdDeviation",
+    "stitchtiles": "stitchTiles",
+    "surfacescale": "surfaceScale",
+    "systemlanguage": "systemLanguage",
+    "tablevalues": "tableValues",
+    "targetx": "targetX",
+    "targety": "targetY",
+    "textlength": "textLength",
+    "viewbox": "viewBox",
+    "viewtarget": "viewTarget",
+    "xchannelselector": "xChannelSelector",
+    "ychannelselector": "yChannelSelector",
+    "zoomandpan": "zoomAndPan"
+}
+
+adjustMathMLAttributes = {"definitionurl": "definitionURL"}
+
+adjustForeignAttributes = {
+    "xlink:actuate": ("xlink", "actuate", namespaces["xlink"]),
+    "xlink:arcrole": ("xlink", "arcrole", namespaces["xlink"]),
+    "xlink:href": ("xlink", "href", namespaces["xlink"]),
+    "xlink:role": ("xlink", "role", namespaces["xlink"]),
+    "xlink:show": ("xlink", "show", namespaces["xlink"]),
+    "xlink:title": ("xlink", "title", namespaces["xlink"]),
+    "xlink:type": ("xlink", "type", namespaces["xlink"]),
+    "xml:base": ("xml", "base", namespaces["xml"]),
+    "xml:lang": ("xml", "lang", namespaces["xml"]),
+    "xml:space": ("xml", "space", namespaces["xml"]),
+    "xmlns": (None, "xmlns", namespaces["xmlns"]),
+    "xmlns:xlink": ("xmlns", "xlink", namespaces["xmlns"])
+}
+
+unadjustForeignAttributes = {(ns, local): qname for qname, (prefix, local, ns) in
+                             adjustForeignAttributes.items()}
+
+spaceCharacters = frozenset([
+    "\t",
+    "\n",
+    "\u000C",
+    " ",
+    "\r"
+])
+
+tableInsertModeElements = frozenset([
+    "table",
+    "tbody",
+    "tfoot",
+    "thead",
+    "tr"
+])
+
+asciiLowercase = frozenset(string.ascii_lowercase)
+asciiUppercase = frozenset(string.ascii_uppercase)
+asciiLetters = frozenset(string.ascii_letters)
+digits = frozenset(string.digits)
+hexDigits = frozenset(string.hexdigits)
+
+asciiUpper2Lower = {ord(c): ord(c.lower()) for c in string.ascii_uppercase}
+
+# Heading elements need to be ordered
+headingElements = (
+    "h1",
+    "h2",
+    "h3",
+    "h4",
+    "h5",
+    "h6"
+)
+
+voidElements = frozenset([
+    "base",
+    "command",
+    "event-source",
+    "link",
+    "meta",
+    "hr",
+    "br",
+    "img",
+    "embed",
+    "param",
+    "area",
+    "col",
+    "input",
+    "source",
+    "track"
+])
+
+cdataElements = frozenset(['title', 'textarea'])
+
+rcdataElements = frozenset([
+    'style',
+    'script',
+    'xmp',
+    'iframe',
+    'noembed',
+    'noframes',
+    'noscript'
+])
+
+booleanAttributes = {
+    "": frozenset(["irrelevant", "itemscope"]),
+    "style": frozenset(["scoped"]),
+    "img": frozenset(["ismap"]),
+    "audio": frozenset(["autoplay", "controls"]),
+    "video": frozenset(["autoplay", "controls"]),
+    "script": frozenset(["defer", "async"]),
+    "details": frozenset(["open"]),
+    "datagrid": frozenset(["multiple", "disabled"]),
+    "command": frozenset(["hidden", "disabled", "checked", "default"]),
+    "hr": frozenset(["noshade"]),
+    "menu": frozenset(["autosubmit"]),
+    "fieldset": frozenset(["disabled", "readonly"]),
+    "option": frozenset(["disabled", "readonly", "selected"]),
+    "optgroup": frozenset(["disabled", "readonly"]),
+    "button": frozenset(["disabled", "autofocus"]),
+    "input": frozenset(["disabled", "readonly", "required", "autofocus", "checked", "ismap"]),
+    "select": frozenset(["disabled", "readonly", "autofocus", "multiple"]),
+    "output": frozenset(["disabled", "readonly"]),
+    "iframe": frozenset(["seamless"]),
+}
+
+# entitiesWindows1252 has to be _ordered_ and needs to have an index. It
+# therefore can't be a frozenset.
+entitiesWindows1252 = (
+    8364,   # 0x80  0x20AC  EURO SIGN
+    65533,  # 0x81          UNDEFINED
+    8218,   # 0x82  0x201A  SINGLE LOW-9 QUOTATION MARK
+    402,    # 0x83  0x0192  LATIN SMALL LETTER F WITH HOOK
+    8222,   # 0x84  0x201E  DOUBLE LOW-9 QUOTATION MARK
+    8230,   # 0x85  0x2026  HORIZONTAL ELLIPSIS
+    8224,   # 0x86  0x2020  DAGGER
+    8225,   # 0x87  0x2021  DOUBLE DAGGER
+    710,    # 0x88  0x02C6  MODIFIER LETTER CIRCUMFLEX ACCENT
+    8240,   # 0x89  0x2030  PER MILLE SIGN
+    352,    # 0x8A  0x0160  LATIN CAPITAL LETTER S WITH CARON
+    8249,   # 0x8B  0x2039  SINGLE LEFT-POINTING ANGLE QUOTATION MARK
+    338,    # 0x8C  0x0152  LATIN CAPITAL LIGATURE OE
+    65533,  # 0x8D          UNDEFINED
+    381,    # 0x8E  0x017D  LATIN CAPITAL LETTER Z WITH CARON
+    65533,  # 0x8F          UNDEFINED
+    65533,  # 0x90          UNDEFINED
+    8216,   # 0x91  0x2018  LEFT SINGLE QUOTATION MARK
+    8217,   # 0x92  0x2019  RIGHT SINGLE QUOTATION MARK
+    8220,   # 0x93  0x201C  LEFT DOUBLE QUOTATION MARK
+    8221,   # 0x94  0x201D  RIGHT DOUBLE QUOTATION MARK
+    8226,   # 0x95  0x2022  BULLET
+    8211,   # 0x96  0x2013  EN DASH
+    8212,   # 0x97  0x2014  EM DASH
+    732,    # 0x98  0x02DC  SMALL TILDE
+    8482,   # 0x99  0x2122  TRADE MARK SIGN
+    353,    # 0x9A  0x0161  LATIN SMALL LETTER S WITH CARON
+    8250,   # 0x9B  0x203A  SINGLE RIGHT-POINTING ANGLE QUOTATION MARK
+    339,    # 0x9C  0x0153  LATIN SMALL LIGATURE OE
+    65533,  # 0x9D          UNDEFINED
+    382,    # 0x9E  0x017E  LATIN SMALL LETTER Z WITH CARON
+    376     # 0x9F  0x0178  LATIN CAPITAL LETTER Y WITH DIAERESIS
+)
+
+xmlEntities = frozenset(['lt;', 'gt;', 'amp;', 'apos;', 'quot;'])
+
+entities = {
+    "AElig": "\xc6",
+    "AElig;": "\xc6",
+    "AMP": "&",
+    "AMP;": "&",
+    "Aacute": "\xc1",
+    "Aacute;": "\xc1",
+    "Abreve;": "\u0102",
+    "Acirc": "\xc2",
+    "Acirc;": "\xc2",
+    "Acy;": "\u0410",
+    "Afr;": "\U0001d504",
+    "Agrave": "\xc0",
+    "Agrave;": "\xc0",
+    "Alpha;": "\u0391",
+    "Amacr;": "\u0100",
+    "And;": "\u2a53",
+    "Aogon;": "\u0104",
+    "Aopf;": "\U0001d538",
+    "ApplyFunction;": "\u2061",
+    "Aring": "\xc5",
+    "Aring;": "\xc5",
+    "Ascr;": "\U0001d49c",
+    "Assign;": "\u2254",
+    "Atilde": "\xc3",
+    "Atilde;": "\xc3",
+    "Auml": "\xc4",
+    "Auml;": "\xc4",
+    "Backslash;": "\u2216",
+    "Barv;": "\u2ae7",
+    "Barwed;": "\u2306",
+    "Bcy;": "\u0411",
+    "Because;": "\u2235",
+    "Bernoullis;": "\u212c",
+    "Beta;": "\u0392",
+    "Bfr;": "\U0001d505",
+    "Bopf;": "\U0001d539",
+    "Breve;": "\u02d8",
+    "Bscr;": "\u212c",
+    "Bumpeq;": "\u224e",
+    "CHcy;": "\u0427",
+    "COPY": "\xa9",
+    "COPY;": "\xa9",
+    "Cacute;": "\u0106",
+    "Cap;": "\u22d2",
+    "CapitalDifferentialD;": "\u2145",
+    "Cayleys;": "\u212d",
+    "Ccaron;": "\u010c",
+    "Ccedil": "\xc7",
+    "Ccedil;": "\xc7",
+    "Ccirc;": "\u0108",
+    "Cconint;": "\u2230",
+    "Cdot;": "\u010a",
+    "Cedilla;": "\xb8",
+    "CenterDot;": "\xb7",
+    "Cfr;": "\u212d",
+    "Chi;": "\u03a7",
+    "CircleDot;": "\u2299",
+    "CircleMinus;": "\u2296",
+    "CirclePlus;": "\u2295",
+    "CircleTimes;": "\u2297",
+    "ClockwiseContourIntegral;": "\u2232",
+    "CloseCurlyDoubleQuote;": "\u201d",
+    "CloseCurlyQuote;": "\u2019",
+    "Colon;": "\u2237",
+    "Colone;": "\u2a74",
+    "Congruent;": "\u2261",
+    "Conint;": "\u222f",
+    "ContourIntegral;": "\u222e",
+    "Copf;": "\u2102",
+    "Coproduct;": "\u2210",
+    "CounterClockwiseContourIntegral;": "\u2233",
+    "Cross;": "\u2a2f",
+    "Cscr;": "\U0001d49e",
+    "Cup;": "\u22d3",
+    "CupCap;": "\u224d",
+    "DD;": "\u2145",
+    "DDotrahd;": "\u2911",
+    "DJcy;": "\u0402",
+    "DScy;": "\u0405",
+    "DZcy;": "\u040f",
+    "Dagger;": "\u2021",
+    "Darr;": "\u21a1",
+    "Dashv;": "\u2ae4",
+    "Dcaron;": "\u010e",
+    "Dcy;": "\u0414",
+    "Del;": "\u2207",
+    "Delta;": "\u0394",
+    "Dfr;": "\U0001d507",
+    "DiacriticalAcute;": "\xb4",
+    "DiacriticalDot;": "\u02d9",
+    "DiacriticalDoubleAcute;": "\u02dd",
+    "DiacriticalGrave;": "`",
+    "DiacriticalTilde;": "\u02dc",
+    "Diamond;": "\u22c4",
+    "DifferentialD;": "\u2146",
+    "Dopf;": "\U0001d53b",
+    "Dot;": "\xa8",
+    "DotDot;": "\u20dc",
+    "DotEqual;": "\u2250",
+    "DoubleContourIntegral;": "\u222f",
+    "DoubleDot;": "\xa8",
+    "DoubleDownArrow;": "\u21d3",
+    "DoubleLeftArrow;": "\u21d0",
+    "DoubleLeftRightArrow;": "\u21d4",
+    "DoubleLeftTee;": "\u2ae4",
+    "DoubleLongLeftArrow;": "\u27f8",
+    "DoubleLongLeftRightArrow;": "\u27fa",
+    "DoubleLongRightArrow;": "\u27f9",
+    "DoubleRightArrow;": "\u21d2",
+    "DoubleRightTee;": "\u22a8",
+    "DoubleUpArrow;": "\u21d1",
+    "DoubleUpDownArrow;": "\u21d5",
+    "DoubleVerticalBar;": "\u2225",
+    "DownArrow;": "\u2193",
+    "DownArrowBar;": "\u2913",
+    "DownArrowUpArrow;": "\u21f5",
+    "DownBreve;": "\u0311",
+    "DownLeftRightVector;": "\u2950",
+    "DownLeftTeeVector;": "\u295e",
+    "DownLeftVector;": "\u21bd",
+    "DownLeftVectorBar;": "\u2956",
+    "DownRightTeeVector;": "\u295f",
+    "DownRightVector;": "\u21c1",
+    "DownRightVectorBar;": "\u2957",
+    "DownTee;": "\u22a4",
+    "DownTeeArrow;": "\u21a7",
+    "Downarrow;": "\u21d3",
+    "Dscr;": "\U0001d49f",
+    "Dstrok;": "\u0110",
+    "ENG;": "\u014a",
+    "ETH": "\xd0",
+    "ETH;": "\xd0",
+    "Eacute": "\xc9",
+    "Eacute;": "\xc9",
+    "Ecaron;": "\u011a",
+    "Ecirc": "\xca",
+    "Ecirc;": "\xca",
+    "Ecy;": "\u042d",
+    "Edot;": "\u0116",
+    "Efr;": "\U0001d508",
+    "Egrave": "\xc8",
+    "Egrave;": "\xc8",
+    "Element;": "\u2208",
+    "Emacr;": "\u0112",
+    "EmptySmallSquare;": "\u25fb",
+    "EmptyVerySmallSquare;": "\u25ab",
+    "Eogon;": "\u0118",
+    "Eopf;": "\U0001d53c",
+    "Epsilon;": "\u0395",
+    "Equal;": "\u2a75",
+    "EqualTilde;": "\u2242",
+    "Equilibrium;": "\u21cc",
+    "Escr;": "\u2130",
+    "Esim;": "\u2a73",
+    "Eta;": "\u0397",
+    "Euml": "\xcb",
+    "Euml;": "\xcb",
+    "Exists;": "\u2203",
+    "ExponentialE;": "\u2147",
+    "Fcy;": "\u0424",
+    "Ffr;": "\U0001d509",
+    "FilledSmallSquare;": "\u25fc",
+    "FilledVerySmallSquare;": "\u25aa",
+    "Fopf;": "\U0001d53d",
+    "ForAll;": "\u2200",
+    "Fouriertrf;": "\u2131",
+    "Fscr;": "\u2131",
+    "GJcy;": "\u0403",
+    "GT": ">",
+    "GT;": ">",
+    "Gamma;": "\u0393",
+    "Gammad;": "\u03dc",
+    "Gbreve;": "\u011e",
+    "Gcedil;": "\u0122",
+    "Gcirc;": "\u011c",
+    "Gcy;": "\u0413",
+    "Gdot;": "\u0120",
+    "Gfr;": "\U0001d50a",
+    "Gg;": "\u22d9",
+    "Gopf;": "\U0001d53e",
+    "GreaterEqual;": "\u2265",
+    "GreaterEqualLess;": "\u22db",
+    "GreaterFullEqual;": "\u2267",
+    "GreaterGreater;": "\u2aa2",
+    "GreaterLess;": "\u2277",
+    "GreaterSlantEqual;": "\u2a7e",
+    "GreaterTilde;": "\u2273",
+    "Gscr;": "\U0001d4a2",
+    "Gt;": "\u226b",
+    "HARDcy;": "\u042a",
+    "Hacek;": "\u02c7",
+    "Hat;": "^",
+    "Hcirc;": "\u0124",
+    "Hfr;": "\u210c",
+    "HilbertSpace;": "\u210b",
+    "Hopf;": "\u210d",
+    "HorizontalLine;": "\u2500",
+    "Hscr;": "\u210b",
+    "Hstrok;": "\u0126",
+    "HumpDownHump;": "\u224e",
+    "HumpEqual;": "\u224f",
+    "IEcy;": "\u0415",
+    "IJlig;": "\u0132",
+    "IOcy;": "\u0401",
+    "Iacute": "\xcd",
+    "Iacute;": "\xcd",
+    "Icirc": "\xce",
+    "Icirc;": "\xce",
+    "Icy;": "\u0418",
+    "Idot;": "\u0130",
+    "Ifr;": "\u2111",
+    "Igrave": "\xcc",
+    "Igrave;": "\xcc",
+    "Im;": "\u2111",
+    "Imacr;": "\u012a",
+    "ImaginaryI;": "\u2148",
+    "Implies;": "\u21d2",
+    "Int;": "\u222c",
+    "Integral;": "\u222b",
+    "Intersection;": "\u22c2",
+    "InvisibleComma;": "\u2063",
+    "InvisibleTimes;": "\u2062",
+    "Iogon;": "\u012e",
+    "Iopf;": "\U0001d540",
+    "Iota;": "\u0399",
+    "Iscr;": "\u2110",
+    "Itilde;": "\u0128",
+    "Iukcy;": "\u0406",
+    "Iuml": "\xcf",
+    "Iuml;": "\xcf",
+    "Jcirc;": "\u0134",
+    "Jcy;": "\u0419",
+    "Jfr;": "\U0001d50d",
+    "Jopf;": "\U0001d541",
+    "Jscr;": "\U0001d4a5",
+    "Jsercy;": "\u0408",
+    "Jukcy;": "\u0404",
+    "KHcy;": "\u0425",
+    "KJcy;": "\u040c",
+    "Kappa;": "\u039a",
+    "Kcedil;": "\u0136",
+    "Kcy;": "\u041a",
+    "Kfr;": "\U0001d50e",
+    "Kopf;": "\U0001d542",
+    "Kscr;": "\U0001d4a6",
+    "LJcy;": "\u0409",
+    "LT": "<",
+    "LT;": "<",
+    "Lacute;": "\u0139",
+    "Lambda;": "\u039b",
+    "Lang;": "\u27ea",
+    "Laplacetrf;": "\u2112",
+    "Larr;": "\u219e",
+    "Lcaron;": "\u013d",
+    "Lcedil;": "\u013b",
+    "Lcy;": "\u041b",
+    "LeftAngleBracket;": "\u27e8",
+    "LeftArrow;": "\u2190",
+    "LeftArrowBar;": "\u21e4",
+    "LeftArrowRightArrow;": "\u21c6",
+    "LeftCeiling;": "\u2308",
+    "LeftDoubleBracket;": "\u27e6",
+    "LeftDownTeeVector;": "\u2961",
+    "LeftDownVector;": "\u21c3",
+    "LeftDownVectorBar;": "\u2959",
+    "LeftFloor;": "\u230a",
+    "LeftRightArrow;": "\u2194",
+    "LeftRightVector;": "\u294e",
+    "LeftTee;": "\u22a3",
+    "LeftTeeArrow;": "\u21a4",
+    "LeftTeeVector;": "\u295a",
+    "LeftTriangle;": "\u22b2",
+    "LeftTriangleBar;": "\u29cf",
+    "LeftTriangleEqual;": "\u22b4",
+    "LeftUpDownVector;": "\u2951",
+    "LeftUpTeeVector;": "\u2960",
+    "LeftUpVector;": "\u21bf",
+    "LeftUpVectorBar;": "\u2958",
+    "LeftVector;": "\u21bc",
+    "LeftVectorBar;": "\u2952",
+    "Leftarrow;": "\u21d0",
+    "Leftrightarrow;": "\u21d4",
+    "LessEqualGreater;": "\u22da",
+    "LessFullEqual;": "\u2266",
+    "LessGreater;": "\u2276",
+    "LessLess;": "\u2aa1",
+    "LessSlantEqual;": "\u2a7d",
+    "LessTilde;": "\u2272",
+    "Lfr;": "\U0001d50f",
+    "Ll;": "\u22d8",
+    "Lleftarrow;": "\u21da",
+    "Lmidot;": "\u013f",
+    "LongLeftArrow;": "\u27f5",
+    "LongLeftRightArrow;": "\u27f7",
+    "LongRightArrow;": "\u27f6",
+    "Longleftarrow;": "\u27f8",
+    "Longleftrightarrow;": "\u27fa",
+    "Longrightarrow;": "\u27f9",
+    "Lopf;": "\U0001d543",
+    "LowerLeftArrow;": "\u2199",
+    "LowerRightArrow;": "\u2198",
+    "Lscr;": "\u2112",
+    "Lsh;": "\u21b0",
+    "Lstrok;": "\u0141",
+    "Lt;": "\u226a",
+    "Map;": "\u2905",
+    "Mcy;": "\u041c",
+    "MediumSpace;": "\u205f",
+    "Mellintrf;": "\u2133",
+    "Mfr;": "\U0001d510",
+    "MinusPlus;": "\u2213",
+    "Mopf;": "\U0001d544",
+    "Mscr;": "\u2133",
+    "Mu;": "\u039c",
+    "NJcy;": "\u040a",
+    "Nacute;": "\u0143",
+    "Ncaron;": "\u0147",
+    "Ncedil;": "\u0145",
+    "Ncy;": "\u041d",
+    "NegativeMediumSpace;": "\u200b",
+    "NegativeThickSpace;": "\u200b",
+    "NegativeThinSpace;": "\u200b",
+    "NegativeVeryThinSpace;": "\u200b",
+    "NestedGreaterGreater;": "\u226b",
+    "NestedLessLess;": "\u226a",
+    "NewLine;": "\n",
+    "Nfr;": "\U0001d511",
+    "NoBreak;": "\u2060",
+    "NonBreakingSpace;": "\xa0",
+    "Nopf;": "\u2115",
+    "Not;": "\u2aec",
+    "NotCongruent;": "\u2262",
+    "NotCupCap;": "\u226d",
+    "NotDoubleVerticalBar;": "\u2226",
+    "NotElement;": "\u2209",
+    "NotEqual;": "\u2260",
+    "NotEqualTilde;": "\u2242\u0338",
+    "NotExists;": "\u2204",
+    "NotGreater;": "\u226f",
+    "NotGreaterEqual;": "\u2271",
+    "NotGreaterFullEqual;": "\u2267\u0338",
+    "NotGreaterGreater;": "\u226b\u0338",
+    "NotGreaterLess;": "\u2279",
+    "NotGreaterSlantEqual;": "\u2a7e\u0338",
+    "NotGreaterTilde;": "\u2275",
+    "NotHumpDownHump;": "\u224e\u0338",
+    "NotHumpEqual;": "\u224f\u0338",
+    "NotLeftTriangle;": "\u22ea",
+    "NotLeftTriangleBar;": "\u29cf\u0338",
+    "NotLeftTriangleEqual;": "\u22ec",
+    "NotLess;": "\u226e",
+    "NotLessEqual;": "\u2270",
+    "NotLessGreater;": "\u2278",
+    "NotLessLess;": "\u226a\u0338",
+    "NotLessSlantEqual;": "\u2a7d\u0338",
+    "NotLessTilde;": "\u2274",
+    "NotNestedGreaterGreater;": "\u2aa2\u0338",
+    "NotNestedLessLess;": "\u2aa1\u0338",
+    "NotPrecedes;": "\u2280",
+    "NotPrecedesEqual;": "\u2aaf\u0338",
+    "NotPrecedesSlantEqual;": "\u22e0",
+    "NotReverseElement;": "\u220c",
+    "NotRightTriangle;": "\u22eb",
+    "NotRightTriangleBar;": "\u29d0\u0338",
+    "NotRightTriangleEqual;": "\u22ed",
+    "NotSquareSubset;": "\u228f\u0338",
+    "NotSquareSubsetEqual;": "\u22e2",
+    "NotSquareSuperset;": "\u2290\u0338",
+    "NotSquareSupersetEqual;": "\u22e3",
+    "NotSubset;": "\u2282\u20d2",
+    "NotSubsetEqual;": "\u2288",
+    "NotSucceeds;": "\u2281",
+    "NotSucceedsEqual;": "\u2ab0\u0338",
+    "NotSucceedsSlantEqual;": "\u22e1",
+    "NotSucceedsTilde;": "\u227f\u0338",
+    "NotSuperset;": "\u2283\u20d2",
+    "NotSupersetEqual;": "\u2289",
+    "NotTilde;": "\u2241",
+    "NotTildeEqual;": "\u2244",
+    "NotTildeFullEqual;": "\u2247",
+    "NotTildeTilde;": "\u2249",
+    "NotVerticalBar;": "\u2224",
+    "Nscr;": "\U0001d4a9",
+    "Ntilde": "\xd1",
+    "Ntilde;": "\xd1",
+    "Nu;": "\u039d",
+    "OElig;": "\u0152",
+    "Oacute": "\xd3",
+    "Oacute;": "\xd3",
+    "Ocirc": "\xd4",
+    "Ocirc;": "\xd4",
+    "Ocy;": "\u041e",
+    "Odblac;": "\u0150",
+    "Ofr;": "\U0001d512",
+    "Ograve": "\xd2",
+    "Ograve;": "\xd2",
+    "Omacr;": "\u014c",
+    "Omega;": "\u03a9",
+    "Omicron;": "\u039f",
+    "Oopf;": "\U0001d546",
+    "OpenCurlyDoubleQuote;": "\u201c",
+    "OpenCurlyQuote;": "\u2018",
+    "Or;": "\u2a54",
+    "Oscr;": "\U0001d4aa",
+    "Oslash": "\xd8",
+    "Oslash;": "\xd8",
+    "Otilde": "\xd5",
+    "Otilde;": "\xd5",
+    "Otimes;": "\u2a37",
+    "Ouml": "\xd6",
+    "Ouml;": "\xd6",
+    "OverBar;": "\u203e",
+    "OverBrace;": "\u23de",
+    "OverBracket;": "\u23b4",
+    "OverParenthesis;": "\u23dc",
+    "PartialD;": "\u2202",
+    "Pcy;": "\u041f",
+    "Pfr;": "\U0001d513",
+    "Phi;": "\u03a6",
+    "Pi;": "\u03a0",
+    "PlusMinus;": "\xb1",
+    "Poincareplane;": "\u210c",
+    "Popf;": "\u2119",
+    "Pr;": "\u2abb",
+    "Precedes;": "\u227a",
+    "PrecedesEqual;": "\u2aaf",
+    "PrecedesSlantEqual;": "\u227c",
+    "PrecedesTilde;": "\u227e",
+    "Prime;": "\u2033",
+    "Product;": "\u220f",
+    "Proportion;": "\u2237",
+    "Proportional;": "\u221d",
+    "Pscr;": "\U0001d4ab",
+    "Psi;": "\u03a8",
+    "QUOT": "\"",
+    "QUOT;": "\"",
+    "Qfr;": "\U0001d514",
+    "Qopf;": "\u211a",
+    "Qscr;": "\U0001d4ac",
+    "RBarr;": "\u2910",
+    "REG": "\xae",
+    "REG;": "\xae",
+    "Racute;": "\u0154",
+    "Rang;": "\u27eb",
+    "Rarr;": "\u21a0",
+    "Rarrtl;": "\u2916",
+    "Rcaron;": "\u0158",
+    "Rcedil;": "\u0156",
+    "Rcy;": "\u0420",
+    "Re;": "\u211c",
+    "ReverseElement;": "\u220b",
+    "ReverseEquilibrium;": "\u21cb",
+    "ReverseUpEquilibrium;": "\u296f",
+    "Rfr;": "\u211c",
+    "Rho;": "\u03a1",
+    "RightAngleBracket;": "\u27e9",
+    "RightArrow;": "\u2192",
+    "RightArrowBar;": "\u21e5",
+    "RightArrowLeftArrow;": "\u21c4",
+    "RightCeiling;": "\u2309",
+    "RightDoubleBracket;": "\u27e7",
+    "RightDownTeeVector;": "\u295d",
+    "RightDownVector;": "\u21c2",
+    "RightDownVectorBar;": "\u2955",
+    "RightFloor;": "\u230b",
+    "RightTee;": "\u22a2",
+    "RightTeeArrow;": "\u21a6",
+    "RightTeeVector;": "\u295b",
+    "RightTriangle;": "\u22b3",
+    "RightTriangleBar;": "\u29d0",
+    "RightTriangleEqual;": "\u22b5",
+    "RightUpDownVector;": "\u294f",
+    "RightUpTeeVector;": "\u295c",
+    "RightUpVector;": "\u21be",
+    "RightUpVectorBar;": "\u2954",
+    "RightVector;": "\u21c0",
+    "RightVectorBar;": "\u2953",
+    "Rightarrow;": "\u21d2",
+    "Ropf;": "\u211d",
+    "RoundImplies;": "\u2970",
+    "Rrightarrow;": "\u21db",
+    "Rscr;": "\u211b",
+    "Rsh;": "\u21b1",
+    "RuleDelayed;": "\u29f4",
+    "SHCHcy;": "\u0429",
+    "SHcy;": "\u0428",
+    "SOFTcy;": "\u042c",
+    "Sacute;": "\u015a",
+    "Sc;": "\u2abc",
+    "Scaron;": "\u0160",
+    "Scedil;": "\u015e",
+    "Scirc;": "\u015c",
+    "Scy;": "\u0421",
+    "Sfr;": "\U0001d516",
+    "ShortDownArrow;": "\u2193",
+    "ShortLeftArrow;": "\u2190",
+    "ShortRightArrow;": "\u2192",
+    "ShortUpArrow;": "\u2191",
+    "Sigma;": "\u03a3",
+    "SmallCircle;": "\u2218",
+    "Sopf;": "\U0001d54a",
+    "Sqrt;": "\u221a",
+    "Square;": "\u25a1",
+    "SquareIntersection;": "\u2293",
+    "SquareSubset;": "\u228f",
+    "SquareSubsetEqual;": "\u2291",
+    "SquareSuperset;": "\u2290",
+    "SquareSupersetEqual;": "\u2292",
+    "SquareUnion;": "\u2294",
+    "Sscr;": "\U0001d4ae",
+    "Star;": "\u22c6",
+    "Sub;": "\u22d0",
+    "Subset;": "\u22d0",
+    "SubsetEqual;": "\u2286",
+    "Succeeds;": "\u227b",
+    "SucceedsEqual;": "\u2ab0",
+    "SucceedsSlantEqual;": "\u227d",
+    "SucceedsTilde;": "\u227f",
+    "SuchThat;": "\u220b",
+    "Sum;": "\u2211",
+    "Sup;": "\u22d1",
+    "Superset;": "\u2283",
+    "SupersetEqual;": "\u2287",
+    "Supset;": "\u22d1",
+    "THORN": "\xde",
+    "THORN;": "\xde",
+    "TRADE;": "\u2122",
+    "TSHcy;": "\u040b",
+    "TScy;": "\u0426",
+    "Tab;": "\t",
+    "Tau;": "\u03a4",
+    "Tcaron;": "\u0164",
+    "Tcedil;": "\u0162",
+    "Tcy;": "\u0422",
+    "Tfr;": "\U0001d517",
+    "Therefore;": "\u2234",
+    "Theta;": "\u0398",
+    "ThickSpace;": "\u205f\u200a",
+    "ThinSpace;": "\u2009",
+    "Tilde;": "\u223c",
+    "TildeEqual;": "\u2243",
+    "TildeFullEqual;": "\u2245",
+    "TildeTilde;": "\u2248",
+    "Topf;": "\U0001d54b",
+    "TripleDot;": "\u20db",
+    "Tscr;": "\U0001d4af",
+    "Tstrok;": "\u0166",
+    "Uacute": "\xda",
+    "Uacute;": "\xda",
+    "Uarr;": "\u219f",
+    "Uarrocir;": "\u2949",
+    "Ubrcy;": "\u040e",
+    "Ubreve;": "\u016c",
+    "Ucirc": "\xdb",
+    "Ucirc;": "\xdb",
+    "Ucy;": "\u0423",
+    "Udblac;": "\u0170",
+    "Ufr;": "\U0001d518",
+    "Ugrave": "\xd9",
+    "Ugrave;": "\xd9",
+    "Umacr;": "\u016a",
+    "UnderBar;": "_",
+    "UnderBrace;": "\u23df",
+    "UnderBracket;": "\u23b5",
+    "UnderParenthesis;": "\u23dd",
+    "Union;": "\u22c3",
+    "UnionPlus;": "\u228e",
+    "Uogon;": "\u0172",
+    "Uopf;": "\U0001d54c",
+    "UpArrow;": "\u2191",
+    "UpArrowBar;": "\u2912",
+    "UpArrowDownArrow;": "\u21c5",
+    "UpDownArrow;": "\u2195",
+    "UpEquilibrium;": "\u296e",
+    "UpTee;": "\u22a5",
+    "UpTeeArrow;": "\u21a5",
+    "Uparrow;": "\u21d1",
+    "Updownarrow;": "\u21d5",
+    "UpperLeftArrow;": "\u2196",
+    "UpperRightArrow;": "\u2197",
+    "Upsi;": "\u03d2",
+    "Upsilon;": "\u03a5",
+    "Uring;": "\u016e",
+    "Uscr;": "\U0001d4b0",
+    "Utilde;": "\u0168",
+    "Uuml": "\xdc",
+    "Uuml;": "\xdc",
+    "VDash;": "\u22ab",
+    "Vbar;": "\u2aeb",
+    "Vcy;": "\u0412",
+    "Vdash;": "\u22a9",
+    "Vdashl;": "\u2ae6",
+    "Vee;": "\u22c1",
+    "Verbar;": "\u2016",
+    "Vert;": "\u2016",
+    "VerticalBar;": "\u2223",
+    "VerticalLine;": "|",
+    "VerticalSeparator;": "\u2758",
+    "VerticalTilde;": "\u2240",
+    "VeryThinSpace;": "\u200a",
+    "Vfr;": "\U0001d519",
+    "Vopf;": "\U0001d54d",
+    "Vscr;": "\U0001d4b1",
+    "Vvdash;": "\u22aa",
+    "Wcirc;": "\u0174",
+    "Wedge;": "\u22c0",
+    "Wfr;": "\U0001d51a",
+    "Wopf;": "\U0001d54e",
+    "Wscr;": "\U0001d4b2",
+    "Xfr;": "\U0001d51b",
+    "Xi;": "\u039e",
+    "Xopf;": "\U0001d54f",
+    "Xscr;": "\U0001d4b3",
+    "YAcy;": "\u042f",
+    "YIcy;": "\u0407",
+    "YUcy;": "\u042e",
+    "Yacute": "\xdd",
+    "Yacute;": "\xdd",
+    "Ycirc;": "\u0176",
+    "Ycy;": "\u042b",
+    "Yfr;": "\U0001d51c",
+    "Yopf;": "\U0001d550",
+    "Yscr;": "\U0001d4b4",
+    "Yuml;": "\u0178",
+    "ZHcy;": "\u0416",
+    "Zacute;": "\u0179",
+    "Zcaron;": "\u017d",
+    "Zcy;": "\u0417",
+    "Zdot;": "\u017b",
+    "ZeroWidthSpace;": "\u200b",
+    "Zeta;": "\u0396",
+    "Zfr;": "\u2128",
+    "Zopf;": "\u2124",
+    "Zscr;": "\U0001d4b5",
+    "aacute": "\xe1",
+    "aacute;": "\xe1",
+    "abreve;": "\u0103",
+    "ac;": "\u223e",
+    "acE;": "\u223e\u0333",
+    "acd;": "\u223f",
+    "acirc": "\xe2",
+    "acirc;": "\xe2",
+    "acute": "\xb4",
+    "acute;": "\xb4",
+    "acy;": "\u0430",
+    "aelig": "\xe6",
+    "aelig;": "\xe6",
+    "af;": "\u2061",
+    "afr;": "\U0001d51e",
+    "agrave": "\xe0",
+    "agrave;": "\xe0",
+    "alefsym;": "\u2135",
+    "aleph;": "\u2135",
+    "alpha;": "\u03b1",
+    "amacr;": "\u0101",
+    "amalg;": "\u2a3f",
+    "amp": "&",
+    "amp;": "&",
+    "and;": "\u2227",
+    "andand;": "\u2a55",
+    "andd;": "\u2a5c",
+    "andslope;": "\u2a58",
+    "andv;": "\u2a5a",
+    "ang;": "\u2220",
+    "ange;": "\u29a4",
+    "angle;": "\u2220",
+    "angmsd;": "\u2221",
+    "angmsdaa;": "\u29a8",
+    "angmsdab;": "\u29a9",
+    "angmsdac;": "\u29aa",
+    "angmsdad;": "\u29ab",
+    "angmsdae;": "\u29ac",
+    "angmsdaf;": "\u29ad",
+    "angmsdag;": "\u29ae",
+    "angmsdah;": "\u29af",
+    "angrt;": "\u221f",
+    "angrtvb;": "\u22be",
+    "angrtvbd;": "\u299d",
+    "angsph;": "\u2222",
+    "angst;": "\xc5",
+    "angzarr;": "\u237c",
+    "aogon;": "\u0105",
+    "aopf;": "\U0001d552",
+    "ap;": "\u2248",
+    "apE;": "\u2a70",
+    "apacir;": "\u2a6f",
+    "ape;": "\u224a",
+    "apid;": "\u224b",
+    "apos;": "'",
+    "approx;": "\u2248",
+    "approxeq;": "\u224a",
+    "aring": "\xe5",
+    "aring;": "\xe5",
+    "ascr;": "\U0001d4b6",
+    "ast;": "*",
+    "asymp;": "\u2248",
+    "asympeq;": "\u224d",
+    "atilde": "\xe3",
+    "atilde;": "\xe3",
+    "auml": "\xe4",
+    "auml;": "\xe4",
+    "awconint;": "\u2233",
+    "awint;": "\u2a11",
+    "bNot;": "\u2aed",
+    "backcong;": "\u224c",
+    "backepsilon;": "\u03f6",
+    "backprime;": "\u2035",
+    "backsim;": "\u223d",
+    "backsimeq;": "\u22cd",
+    "barvee;": "\u22bd",
+    "barwed;": "\u2305",
+    "barwedge;": "\u2305",
+    "bbrk;": "\u23b5",
+    "bbrktbrk;": "\u23b6",
+    "bcong;": "\u224c",
+    "bcy;": "\u0431",
+    "bdquo;": "\u201e",
+    "becaus;": "\u2235",
+    "because;": "\u2235",
+    "bemptyv;": "\u29b0",
+    "bepsi;": "\u03f6",
+    "bernou;": "\u212c",
+    "beta;": "\u03b2",
+    "beth;": "\u2136",
+    "between;": "\u226c",
+    "bfr;": "\U0001d51f",
+    "bigcap;": "\u22c2",
+    "bigcirc;": "\u25ef",
+    "bigcup;": "\u22c3",
+    "bigodot;": "\u2a00",
+    "bigoplus;": "\u2a01",
+    "bigotimes;": "\u2a02",
+    "bigsqcup;": "\u2a06",
+    "bigstar;": "\u2605",
+    "bigtriangledown;": "\u25bd",
+    "bigtriangleup;": "\u25b3",
+    "biguplus;": "\u2a04",
+    "bigvee;": "\u22c1",
+    "bigwedge;": "\u22c0",
+    "bkarow;": "\u290d",
+    "blacklozenge;": "\u29eb",
+    "blacksquare;": "\u25aa",
+    "blacktriangle;": "\u25b4",
+    "blacktriangledown;": "\u25be",
+    "blacktriangleleft;": "\u25c2",
+    "blacktriangleright;": "\u25b8",
+    "blank;": "\u2423",
+    "blk12;": "\u2592",
+    "blk14;": "\u2591",
+    "blk34;": "\u2593",
+    "block;": "\u2588",
+    "bne;": "=\u20e5",
+    "bnequiv;": "\u2261\u20e5",
+    "bnot;": "\u2310",
+    "bopf;": "\U0001d553",
+    "bot;": "\u22a5",
+    "bottom;": "\u22a5",
+    "bowtie;": "\u22c8",
+    "boxDL;": "\u2557",
+    "boxDR;": "\u2554",
+    "boxDl;": "\u2556",
+    "boxDr;": "\u2553",
+    "boxH;": "\u2550",
+    "boxHD;": "\u2566",
+    "boxHU;": "\u2569",
+    "boxHd;": "\u2564",
+    "boxHu;": "\u2567",
+    "boxUL;": "\u255d",
+    "boxUR;": "\u255a",
+    "boxUl;": "\u255c",
+    "boxUr;": "\u2559",
+    "boxV;": "\u2551",
+    "boxVH;": "\u256c",
+    "boxVL;": "\u2563",
+    "boxVR;": "\u2560",
+    "boxVh;": "\u256b",
+    "boxVl;": "\u2562",
+    "boxVr;": "\u255f",
+    "boxbox;": "\u29c9",
+    "boxdL;": "\u2555",
+    "boxdR;": "\u2552",
+    "boxdl;": "\u2510",
+    "boxdr;": "\u250c",
+    "boxh;": "\u2500",
+    "boxhD;": "\u2565",
+    "boxhU;": "\u2568",
+    "boxhd;": "\u252c",
+    "boxhu;": "\u2534",
+    "boxminus;": "\u229f",
+    "boxplus;": "\u229e",
+    "boxtimes;": "\u22a0",
+    "boxuL;": "\u255b",
+    "boxuR;": "\u2558",
+    "boxul;": "\u2518",
+    "boxur;": "\u2514",
+    "boxv;": "\u2502",
+    "boxvH;": "\u256a",
+    "boxvL;": "\u2561",
+    "boxvR;": "\u255e",
+    "boxvh;": "\u253c",
+    "boxvl;": "\u2524",
+    "boxvr;": "\u251c",
+    "bprime;": "\u2035",
+    "breve;": "\u02d8",
+    "brvbar": "\xa6",
+    "brvbar;": "\xa6",
+    "bscr;": "\U0001d4b7",
+    "bsemi;": "\u204f",
+    "bsim;": "\u223d",
+    "bsime;": "\u22cd",
+    "bsol;": "\\",
+    "bsolb;": "\u29c5",
+    "bsolhsub;": "\u27c8",
+    "bull;": "\u2022",
+    "bullet;": "\u2022",
+    "bump;": "\u224e",
+    "bumpE;": "\u2aae",
+    "bumpe;": "\u224f",
+    "bumpeq;": "\u224f",
+    "cacute;": "\u0107",
+    "cap;": "\u2229",
+    "capand;": "\u2a44",
+    "capbrcup;": "\u2a49",
+    "capcap;": "\u2a4b",
+    "capcup;": "\u2a47",
+    "capdot;": "\u2a40",
+    "caps;": "\u2229\ufe00",
+    "caret;": "\u2041",
+    "caron;": "\u02c7",
+    "ccaps;": "\u2a4d",
+    "ccaron;": "\u010d",
+    "ccedil": "\xe7",
+    "ccedil;": "\xe7",
+    "ccirc;": "\u0109",
+    "ccups;": "\u2a4c",
+    "ccupssm;": "\u2a50",
+    "cdot;": "\u010b",
+    "cedil": "\xb8",
+    "cedil;": "\xb8",
+    "cemptyv;": "\u29b2",
+    "cent": "\xa2",
+    "cent;": "\xa2",
+    "centerdot;": "\xb7",
+    "cfr;": "\U0001d520",
+    "chcy;": "\u0447",
+    "check;": "\u2713",
+    "checkmark;": "\u2713",
+    "chi;": "\u03c7",
+    "cir;": "\u25cb",
+    "cirE;": "\u29c3",
+    "circ;": "\u02c6",
+    "circeq;": "\u2257",
+    "circlearrowleft;": "\u21ba",
+    "circlearrowright;": "\u21bb",
+    "circledR;": "\xae",
+    "circledS;": "\u24c8",
+    "circledast;": "\u229b",
+    "circledcirc;": "\u229a",
+    "circleddash;": "\u229d",
+    "cire;": "\u2257",
+    "cirfnint;": "\u2a10",
+    "cirmid;": "\u2aef",
+    "cirscir;": "\u29c2",
+    "clubs;": "\u2663",
+    "clubsuit;": "\u2663",
+    "colon;": ":",
+    "colone;": "\u2254",
+    "coloneq;": "\u2254",
+    "comma;": ",",
+    "commat;": "@",
+    "comp;": "\u2201",
+    "compfn;": "\u2218",
+    "complement;": "\u2201",
+    "complexes;": "\u2102",
+    "cong;": "\u2245",
+    "congdot;": "\u2a6d",
+    "conint;": "\u222e",
+    "copf;": "\U0001d554",
+    "coprod;": "\u2210",
+    "copy": "\xa9",
+    "copy;": "\xa9",
+    "copysr;": "\u2117",
+    "crarr;": "\u21b5",
+    "cross;": "\u2717",
+    "cscr;": "\U0001d4b8",
+    "csub;": "\u2acf",
+    "csube;": "\u2ad1",
+    "csup;": "\u2ad0",
+    "csupe;": "\u2ad2",
+    "ctdot;": "\u22ef",
+    "cudarrl;": "\u2938",
+    "cudarrr;": "\u2935",
+    "cuepr;": "\u22de",
+    "cuesc;": "\u22df",
+    "cularr;": "\u21b6",
+    "cularrp;": "\u293d",
+    "cup;": "\u222a",
+    "cupbrcap;": "\u2a48",
+    "cupcap;": "\u2a46",
+    "cupcup;": "\u2a4a",
+    "cupdot;": "\u228d",
+    "cupor;": "\u2a45",
+    "cups;": "\u222a\ufe00",
+    "curarr;": "\u21b7",
+    "curarrm;": "\u293c",
+    "curlyeqprec;": "\u22de",
+    "curlyeqsucc;": "\u22df",
+    "curlyvee;": "\u22ce",
+    "curlywedge;": "\u22cf",
+    "curren": "\xa4",
+    "curren;": "\xa4",
+    "curvearrowleft;": "\u21b6",
+    "curvearrowright;": "\u21b7",
+    "cuvee;": "\u22ce",
+    "cuwed;": "\u22cf",
+    "cwconint;": "\u2232",
+    "cwint;": "\u2231",
+    "cylcty;": "\u232d",
+    "dArr;": "\u21d3",
+    "dHar;": "\u2965",
+    "dagger;": "\u2020",
+    "daleth;": "\u2138",
+    "darr;": "\u2193",
+    "dash;": "\u2010",
+    "dashv;": "\u22a3",
+    "dbkarow;": "\u290f",
+    "dblac;": "\u02dd",
+    "dcaron;": "\u010f",
+    "dcy;": "\u0434",
+    "dd;": "\u2146",
+    "ddagger;": "\u2021",
+    "ddarr;": "\u21ca",
+    "ddotseq;": "\u2a77",
+    "deg": "\xb0",
+    "deg;": "\xb0",
+    "delta;": "\u03b4",
+    "demptyv;": "\u29b1",
+    "dfisht;": "\u297f",
+    "dfr;": "\U0001d521",
+    "dharl;": "\u21c3",
+    "dharr;": "\u21c2",
+    "diam;": "\u22c4",
+    "diamond;": "\u22c4",
+    "diamondsuit;": "\u2666",
+    "diams;": "\u2666",
+    "die;": "\xa8",
+    "digamma;": "\u03dd",
+    "disin;": "\u22f2",
+    "div;": "\xf7",
+    "divide": "\xf7",
+    "divide;": "\xf7",
+    "divideontimes;": "\u22c7",
+    "divonx;": "\u22c7",
+    "djcy;": "\u0452",
+    "dlcorn;": "\u231e",
+    "dlcrop;": "\u230d",
+    "dollar;": "$",
+    "dopf;": "\U0001d555",
+    "dot;": "\u02d9",
+    "doteq;": "\u2250",
+    "doteqdot;": "\u2251",
+    "dotminus;": "\u2238",
+    "dotplus;": "\u2214",
+    "dotsquare;": "\u22a1",
+    "doublebarwedge;": "\u2306",
+    "downarrow;": "\u2193",
+    "downdownarrows;": "\u21ca",
+    "downharpoonleft;": "\u21c3",
+    "downharpoonright;": "\u21c2",
+    "drbkarow;": "\u2910",
+    "drcorn;": "\u231f",
+    "drcrop;": "\u230c",
+    "dscr;": "\U0001d4b9",
+    "dscy;": "\u0455",
+    "dsol;": "\u29f6",
+    "dstrok;": "\u0111",
+    "dtdot;": "\u22f1",
+    "dtri;": "\u25bf",
+    "dtrif;": "\u25be",
+    "duarr;": "\u21f5",
+    "duhar;": "\u296f",
+    "dwangle;": "\u29a6",
+    "dzcy;": "\u045f",
+    "dzigrarr;": "\u27ff",
+    "eDDot;": "\u2a77",
+    "eDot;": "\u2251",
+    "eacute": "\xe9",
+    "eacute;": "\xe9",
+    "easter;": "\u2a6e",
+    "ecaron;": "\u011b",
+    "ecir;": "\u2256",
+    "ecirc": "\xea",
+    "ecirc;": "\xea",
+    "ecolon;": "\u2255",
+    "ecy;": "\u044d",
+    "edot;": "\u0117",
+    "ee;": "\u2147",
+    "efDot;": "\u2252",
+    "efr;": "\U0001d522",
+    "eg;": "\u2a9a",
+    "egrave": "\xe8",
+    "egrave;": "\xe8",
+    "egs;": "\u2a96",
+    "egsdot;": "\u2a98",
+    "el;": "\u2a99",
+    "elinters;": "\u23e7",
+    "ell;": "\u2113",
+    "els;": "\u2a95",
+    "elsdot;": "\u2a97",
+    "emacr;": "\u0113",
+    "empty;": "\u2205",
+    "emptyset;": "\u2205",
+    "emptyv;": "\u2205",
+    "emsp13;": "\u2004",
+    "emsp14;": "\u2005",
+    "emsp;": "\u2003",
+    "eng;": "\u014b",
+    "ensp;": "\u2002",
+    "eogon;": "\u0119",
+    "eopf;": "\U0001d556",
+    "epar;": "\u22d5",
+    "eparsl;": "\u29e3",
+    "eplus;": "\u2a71",
+    "epsi;": "\u03b5",
+    "epsilon;": "\u03b5",
+    "epsiv;": "\u03f5",
+    "eqcirc;": "\u2256",
+    "eqcolon;": "\u2255",
+    "eqsim;": "\u2242",
+    "eqslantgtr;": "\u2a96",
+    "eqslantless;": "\u2a95",
+    "equals;": "=",
+    "equest;": "\u225f",
+    "equiv;": "\u2261",
+    "equivDD;": "\u2a78",
+    "eqvparsl;": "\u29e5",
+    "erDot;": "\u2253",
+    "erarr;": "\u2971",
+    "escr;": "\u212f",
+    "esdot;": "\u2250",
+    "esim;": "\u2242",
+    "eta;": "\u03b7",
+    "eth": "\xf0",
+    "eth;": "\xf0",
+    "euml": "\xeb",
+    "euml;": "\xeb",
+    "euro;": "\u20ac",
+    "excl;": "!",
+    "exist;": "\u2203",
+    "expectation;": "\u2130",
+    "exponentiale;": "\u2147",
+    "fallingdotseq;": "\u2252",
+    "fcy;": "\u0444",
+    "female;": "\u2640",
+    "ffilig;": "\ufb03",
+    "fflig;": "\ufb00",
+    "ffllig;": "\ufb04",
+    "ffr;": "\U0001d523",
+    "filig;": "\ufb01",
+    "fjlig;": "fj",
+    "flat;": "\u266d",
+    "fllig;": "\ufb02",
+    "fltns;": "\u25b1",
+    "fnof;": "\u0192",
+    "fopf;": "\U0001d557",
+    "forall;": "\u2200",
+    "fork;": "\u22d4",
+    "forkv;": "\u2ad9",
+    "fpartint;": "\u2a0d",
+    "frac12": "\xbd",
+    "frac12;": "\xbd",
+    "frac13;": "\u2153",
+    "frac14": "\xbc",
+    "frac14;": "\xbc",
+    "frac15;": "\u2155",
+    "frac16;": "\u2159",
+    "frac18;": "\u215b",
+    "frac23;": "\u2154",
+    "frac25;": "\u2156",
+    "frac34": "\xbe",
+    "frac34;": "\xbe",
+    "frac35;": "\u2157",
+    "frac38;": "\u215c",
+    "frac45;": "\u2158",
+    "frac56;": "\u215a",
+    "frac58;": "\u215d",
+    "frac78;": "\u215e",
+    "frasl;": "\u2044",
+    "frown;": "\u2322",
+    "fscr;": "\U0001d4bb",
+    "gE;": "\u2267",
+    "gEl;": "\u2a8c",
+    "gacute;": "\u01f5",
+    "gamma;": "\u03b3",
+    "gammad;": "\u03dd",
+    "gap;": "\u2a86",
+    "gbreve;": "\u011f",
+    "gcirc;": "\u011d",
+    "gcy;": "\u0433",
+    "gdot;": "\u0121",
+    "ge;": "\u2265",
+    "gel;": "\u22db",
+    "geq;": "\u2265",
+    "geqq;": "\u2267",
+    "geqslant;": "\u2a7e",
+    "ges;": "\u2a7e",
+    "gescc;": "\u2aa9",
+    "gesdot;": "\u2a80",
+    "gesdoto;": "\u2a82",
+    "gesdotol;": "\u2a84",
+    "gesl;": "\u22db\ufe00",
+    "gesles;": "\u2a94",
+    "gfr;": "\U0001d524",
+    "gg;": "\u226b",
+    "ggg;": "\u22d9",
+    "gimel;": "\u2137",
+    "gjcy;": "\u0453",
+    "gl;": "\u2277",
+    "glE;": "\u2a92",
+    "gla;": "\u2aa5",
+    "glj;": "\u2aa4",
+    "gnE;": "\u2269",
+    "gnap;": "\u2a8a",
+    "gnapprox;": "\u2a8a",
+    "gne;": "\u2a88",
+    "gneq;": "\u2a88",
+    "gneqq;": "\u2269",
+    "gnsim;": "\u22e7",
+    "gopf;": "\U0001d558",
+    "grave;": "`",
+    "gscr;": "\u210a",
+    "gsim;": "\u2273",
+    "gsime;": "\u2a8e",
+    "gsiml;": "\u2a90",
+    "gt": ">",
+    "gt;": ">",
+    "gtcc;": "\u2aa7",
+    "gtcir;": "\u2a7a",
+    "gtdot;": "\u22d7",
+    "gtlPar;": "\u2995",
+    "gtquest;": "\u2a7c",
+    "gtrapprox;": "\u2a86",
+    "gtrarr;": "\u2978",
+    "gtrdot;": "\u22d7",
+    "gtreqless;": "\u22db",
+    "gtreqqless;": "\u2a8c",
+    "gtrless;": "\u2277",
+    "gtrsim;": "\u2273",
+    "gvertneqq;": "\u2269\ufe00",
+    "gvnE;": "\u2269\ufe00",
+    "hArr;": "\u21d4",
+    "hairsp;": "\u200a",
+    "half;": "\xbd",
+    "hamilt;": "\u210b",
+    "hardcy;": "\u044a",
+    "harr;": "\u2194",
+    "harrcir;": "\u2948",
+    "harrw;": "\u21ad",
+    "hbar;": "\u210f",
+    "hcirc;": "\u0125",
+    "hearts;": "\u2665",
+    "heartsuit;": "\u2665",
+    "hellip;": "\u2026",
+    "hercon;": "\u22b9",
+    "hfr;": "\U0001d525",
+    "hksearow;": "\u2925",
+    "hkswarow;": "\u2926",
+    "hoarr;": "\u21ff",
+    "homtht;": "\u223b",
+    "hookleftarrow;": "\u21a9",
+    "hookrightarrow;": "\u21aa",
+    "hopf;": "\U0001d559",
+    "horbar;": "\u2015",
+    "hscr;": "\U0001d4bd",
+    "hslash;": "\u210f",
+    "hstrok;": "\u0127",
+    "hybull;": "\u2043",
+    "hyphen;": "\u2010",
+    "iacute": "\xed",
+    "iacute;": "\xed",
+    "ic;": "\u2063",
+    "icirc": "\xee",
+    "icirc;": "\xee",
+    "icy;": "\u0438",
+    "iecy;": "\u0435",
+    "iexcl": "\xa1",
+    "iexcl;": "\xa1",
+    "iff;": "\u21d4",
+    "ifr;": "\U0001d526",
+    "igrave": "\xec",
+    "igrave;": "\xec",
+    "ii;": "\u2148",
+    "iiiint;": "\u2a0c",
+    "iiint;": "\u222d",
+    "iinfin;": "\u29dc",
+    "iiota;": "\u2129",
+    "ijlig;": "\u0133",
+    "imacr;": "\u012b",
+    "image;": "\u2111",
+    "imagline;": "\u2110",
+    "imagpart;": "\u2111",
+    "imath;": "\u0131",
+    "imof;": "\u22b7",
+    "imped;": "\u01b5",
+    "in;": "\u2208",
+    "incare;": "\u2105",
+    "infin;": "\u221e",
+    "infintie;": "\u29dd",
+    "inodot;": "\u0131",
+    "int;": "\u222b",
+    "intcal;": "\u22ba",
+    "integers;": "\u2124",
+    "intercal;": "\u22ba",
+    "intlarhk;": "\u2a17",
+    "intprod;": "\u2a3c",
+    "iocy;": "\u0451",
+    "iogon;": "\u012f",
+    "iopf;": "\U0001d55a",
+    "iota;": "\u03b9",
+    "iprod;": "\u2a3c",
+    "iquest": "\xbf",
+    "iquest;": "\xbf",
+    "iscr;": "\U0001d4be",
+    "isin;": "\u2208",
+    "isinE;": "\u22f9",
+    "isindot;": "\u22f5",
+    "isins;": "\u22f4",
+    "isinsv;": "\u22f3",
+    "isinv;": "\u2208",
+    "it;": "\u2062",
+    "itilde;": "\u0129",
+    "iukcy;": "\u0456",
+    "iuml": "\xef",
+    "iuml;": "\xef",
+    "jcirc;": "\u0135",
+    "jcy;": "\u0439",
+    "jfr;": "\U0001d527",
+    "jmath;": "\u0237",
+    "jopf;": "\U0001d55b",
+    "jscr;": "\U0001d4bf",
+    "jsercy;": "\u0458",
+    "jukcy;": "\u0454",
+    "kappa;": "\u03ba",
+    "kappav;": "\u03f0",
+    "kcedil;": "\u0137",
+    "kcy;": "\u043a",
+    "kfr;": "\U0001d528",
+    "kgreen;": "\u0138",
+    "khcy;": "\u0445",
+    "kjcy;": "\u045c",
+    "kopf;": "\U0001d55c",
+    "kscr;": "\U0001d4c0",
+    "lAarr;": "\u21da",
+    "lArr;": "\u21d0",
+    "lAtail;": "\u291b",
+    "lBarr;": "\u290e",
+    "lE;": "\u2266",
+    "lEg;": "\u2a8b",
+    "lHar;": "\u2962",
+    "lacute;": "\u013a",
+    "laemptyv;": "\u29b4",
+    "lagran;": "\u2112",
+    "lambda;": "\u03bb",
+    "lang;": "\u27e8",
+    "langd;": "\u2991",
+    "langle;": "\u27e8",
+    "lap;": "\u2a85",
+    "laquo": "\xab",
+    "laquo;": "\xab",
+    "larr;": "\u2190",
+    "larrb;": "\u21e4",
+    "larrbfs;": "\u291f",
+    "larrfs;": "\u291d",
+    "larrhk;": "\u21a9",
+    "larrlp;": "\u21ab",
+    "larrpl;": "\u2939",
+    "larrsim;": "\u2973",
+    "larrtl;": "\u21a2",
+    "lat;": "\u2aab",
+    "latail;": "\u2919",
+    "late;": "\u2aad",
+    "lates;": "\u2aad\ufe00",
+    "lbarr;": "\u290c",
+    "lbbrk;": "\u2772",
+    "lbrace;": "{",
+    "lbrack;": "[",
+    "lbrke;": "\u298b",
+    "lbrksld;": "\u298f",
+    "lbrkslu;": "\u298d",
+    "lcaron;": "\u013e",
+    "lcedil;": "\u013c",
+    "lceil;": "\u2308",
+    "lcub;": "{",
+    "lcy;": "\u043b",
+    "ldca;": "\u2936",
+    "ldquo;": "\u201c",
+    "ldquor;": "\u201e",
+    "ldrdhar;": "\u2967",
+    "ldrushar;": "\u294b",
+    "ldsh;": "\u21b2",
+    "le;": "\u2264",
+    "leftarrow;": "\u2190",
+    "leftarrowtail;": "\u21a2",
+    "leftharpoondown;": "\u21bd",
+    "leftharpoonup;": "\u21bc",
+    "leftleftarrows;": "\u21c7",
+    "leftrightarrow;": "\u2194",
+    "leftrightarrows;": "\u21c6",
+    "leftrightharpoons;": "\u21cb",
+    "leftrightsquigarrow;": "\u21ad",
+    "leftthreetimes;": "\u22cb",
+    "leg;": "\u22da",
+    "leq;": "\u2264",
+    "leqq;": "\u2266",
+    "leqslant;": "\u2a7d",
+    "les;": "\u2a7d",
+    "lescc;": "\u2aa8",
+    "lesdot;": "\u2a7f",
+    "lesdoto;": "\u2a81",
+    "lesdotor;": "\u2a83",
+    "lesg;": "\u22da\ufe00",
+    "lesges;": "\u2a93",
+    "lessapprox;": "\u2a85",
+    "lessdot;": "\u22d6",
+    "lesseqgtr;": "\u22da",
+    "lesseqqgtr;": "\u2a8b",
+    "lessgtr;": "\u2276",
+    "lesssim;": "\u2272",
+    "lfisht;": "\u297c",
+    "lfloor;": "\u230a",
+    "lfr;": "\U0001d529",
+    "lg;": "\u2276",
+    "lgE;": "\u2a91",
+    "lhard;": "\u21bd",
+    "lharu;": "\u21bc",
+    "lharul;": "\u296a",
+    "lhblk;": "\u2584",
+    "ljcy;": "\u0459",
+    "ll;": "\u226a",
+    "llarr;": "\u21c7",
+    "llcorner;": "\u231e",
+    "llhard;": "\u296b",
+    "lltri;": "\u25fa",
+    "lmidot;": "\u0140",
+    "lmoust;": "\u23b0",
+    "lmoustache;": "\u23b0",
+    "lnE;": "\u2268",
+    "lnap;": "\u2a89",
+    "lnapprox;": "\u2a89",
+    "lne;": "\u2a87",
+    "lneq;": "\u2a87",
+    "lneqq;": "\u2268",
+    "lnsim;": "\u22e6",
+    "loang;": "\u27ec",
+    "loarr;": "\u21fd",
+    "lobrk;": "\u27e6",
+    "longleftarrow;": "\u27f5",
+    "longleftrightarrow;": "\u27f7",
+    "longmapsto;": "\u27fc",
+    "longrightarrow;": "\u27f6",
+    "looparrowleft;": "\u21ab",
+    "looparrowright;": "\u21ac",
+    "lopar;": "\u2985",
+    "lopf;": "\U0001d55d",
+    "loplus;": "\u2a2d",
+    "lotimes;": "\u2a34",
+    "lowast;": "\u2217",
+    "lowbar;": "_",
+    "loz;": "\u25ca",
+    "lozenge;": "\u25ca",
+    "lozf;": "\u29eb",
+    "lpar;": "(",
+    "lparlt;": "\u2993",
+    "lrarr;": "\u21c6",
+    "lrcorner;": "\u231f",
+    "lrhar;": "\u21cb",
+    "lrhard;": "\u296d",
+    "lrm;": "\u200e",
+    "lrtri;": "\u22bf",
+    "lsaquo;": "\u2039",
+    "lscr;": "\U0001d4c1",
+    "lsh;": "\u21b0",
+    "lsim;": "\u2272",
+    "lsime;": "\u2a8d",
+    "lsimg;": "\u2a8f",
+    "lsqb;": "[",
+    "lsquo;": "\u2018",
+    "lsquor;": "\u201a",
+    "lstrok;": "\u0142",
+    "lt": "<",
+    "lt;": "<",
+    "ltcc;": "\u2aa6",
+    "ltcir;": "\u2a79",
+    "ltdot;": "\u22d6",
+    "lthree;": "\u22cb",
+    "ltimes;": "\u22c9",
+    "ltlarr;": "\u2976",
+    "ltquest;": "\u2a7b",
+    "ltrPar;": "\u2996",
+    "ltri;": "\u25c3",
+    "ltrie;": "\u22b4",
+    "ltrif;": "\u25c2",
+    "lurdshar;": "\u294a",
+    "luruhar;": "\u2966",
+    "lvertneqq;": "\u2268\ufe00",
+    "lvnE;": "\u2268\ufe00",
+    "mDDot;": "\u223a",
+    "macr": "\xaf",
+    "macr;": "\xaf",
+    "male;": "\u2642",
+    "malt;": "\u2720",
+    "maltese;": "\u2720",
+    "map;": "\u21a6",
+    "mapsto;": "\u21a6",
+    "mapstodown;": "\u21a7",
+    "mapstoleft;": "\u21a4",
+    "mapstoup;": "\u21a5",
+    "marker;": "\u25ae",
+    "mcomma;": "\u2a29",
+    "mcy;": "\u043c",
+    "mdash;": "\u2014",
+    "measuredangle;": "\u2221",
+    "mfr;": "\U0001d52a",
+    "mho;": "\u2127",
+    "micro": "\xb5",
+    "micro;": "\xb5",
+    "mid;": "\u2223",
+    "midast;": "*",
+    "midcir;": "\u2af0",
+    "middot": "\xb7",
+    "middot;": "\xb7",
+    "minus;": "\u2212",
+    "minusb;": "\u229f",
+    "minusd;": "\u2238",
+    "minusdu;": "\u2a2a",
+    "mlcp;": "\u2adb",
+    "mldr;": "\u2026",
+    "mnplus;": "\u2213",
+    "models;": "\u22a7",
+    "mopf;": "\U0001d55e",
+    "mp;": "\u2213",
+    "mscr;": "\U0001d4c2",
+    "mstpos;": "\u223e",
+    "mu;": "\u03bc",
+    "multimap;": "\u22b8",
+    "mumap;": "\u22b8",
+    "nGg;": "\u22d9\u0338",
+    "nGt;": "\u226b\u20d2",
+    "nGtv;": "\u226b\u0338",
+    "nLeftarrow;": "\u21cd",
+    "nLeftrightarrow;": "\u21ce",
+    "nLl;": "\u22d8\u0338",
+    "nLt;": "\u226a\u20d2",
+    "nLtv;": "\u226a\u0338",
+    "nRightarrow;": "\u21cf",
+    "nVDash;": "\u22af",
+    "nVdash;": "\u22ae",
+    "nabla;": "\u2207",
+    "nacute;": "\u0144",
+    "nang;": "\u2220\u20d2",
+    "nap;": "\u2249",
+    "napE;": "\u2a70\u0338",
+    "napid;": "\u224b\u0338",
+    "napos;": "\u0149",
+    "napprox;": "\u2249",
+    "natur;": "\u266e",
+    "natural;": "\u266e",
+    "naturals;": "\u2115",
+    "nbsp": "\xa0",
+    "nbsp;": "\xa0",
+    "nbump;": "\u224e\u0338",
+    "nbumpe;": "\u224f\u0338",
+    "ncap;": "\u2a43",
+    "ncaron;": "\u0148",
+    "ncedil;": "\u0146",
+    "ncong;": "\u2247",
+    "ncongdot;": "\u2a6d\u0338",
+    "ncup;": "\u2a42",
+    "ncy;": "\u043d",
+    "ndash;": "\u2013",
+    "ne;": "\u2260",
+    "neArr;": "\u21d7",
+    "nearhk;": "\u2924",
+    "nearr;": "\u2197",
+    "nearrow;": "\u2197",
+    "nedot;": "\u2250\u0338",
+    "nequiv;": "\u2262",
+    "nesear;": "\u2928",
+    "nesim;": "\u2242\u0338",
+    "nexist;": "\u2204",
+    "nexists;": "\u2204",
+    "nfr;": "\U0001d52b",
+    "ngE;": "\u2267\u0338",
+    "nge;": "\u2271",
+    "ngeq;": "\u2271",
+    "ngeqq;": "\u2267\u0338",
+    "ngeqslant;": "\u2a7e\u0338",
+    "nges;": "\u2a7e\u0338",
+    "ngsim;": "\u2275",
+    "ngt;": "\u226f",
+    "ngtr;": "\u226f",
+    "nhArr;": "\u21ce",
+    "nharr;": "\u21ae",
+    "nhpar;": "\u2af2",
+    "ni;": "\u220b",
+    "nis;": "\u22fc",
+    "nisd;": "\u22fa",
+    "niv;": "\u220b",
+    "njcy;": "\u045a",
+    "nlArr;": "\u21cd",
+    "nlE;": "\u2266\u0338",
+    "nlarr;": "\u219a",
+    "nldr;": "\u2025",
+    "nle;": "\u2270",
+    "nleftarrow;": "\u219a",
+    "nleftrightarrow;": "\u21ae",
+    "nleq;": "\u2270",
+    "nleqq;": "\u2266\u0338",
+    "nleqslant;": "\u2a7d\u0338",
+    "nles;": "\u2a7d\u0338",
+    "nless;": "\u226e",
+    "nlsim;": "\u2274",
+    "nlt;": "\u226e",
+    "nltri;": "\u22ea",
+    "nltrie;": "\u22ec",
+    "nmid;": "\u2224",
+    "nopf;": "\U0001d55f",
+    "not": "\xac",
+    "not;": "\xac",
+    "notin;": "\u2209",
+    "notinE;": "\u22f9\u0338",
+    "notindot;": "\u22f5\u0338",
+    "notinva;": "\u2209",
+    "notinvb;": "\u22f7",
+    "notinvc;": "\u22f6",
+    "notni;": "\u220c",
+    "notniva;": "\u220c",
+    "notnivb;": "\u22fe",
+    "notnivc;": "\u22fd",
+    "npar;": "\u2226",
+    "nparallel;": "\u2226",
+    "nparsl;": "\u2afd\u20e5",
+    "npart;": "\u2202\u0338",
+    "npolint;": "\u2a14",
+    "npr;": "\u2280",
+    "nprcue;": "\u22e0",
+    "npre;": "\u2aaf\u0338",
+    "nprec;": "\u2280",
+    "npreceq;": "\u2aaf\u0338",
+    "nrArr;": "\u21cf",
+    "nrarr;": "\u219b",
+    "nrarrc;": "\u2933\u0338",
+    "nrarrw;": "\u219d\u0338",
+    "nrightarrow;": "\u219b",
+    "nrtri;": "\u22eb",
+    "nrtrie;": "\u22ed",
+    "nsc;": "\u2281",
+    "nsccue;": "\u22e1",
+    "nsce;": "\u2ab0\u0338",
+    "nscr;": "\U0001d4c3",
+    "nshortmid;": "\u2224",
+    "nshortparallel;": "\u2226",
+    "nsim;": "\u2241",
+    "nsime;": "\u2244",
+    "nsimeq;": "\u2244",
+    "nsmid;": "\u2224",
+    "nspar;": "\u2226",
+    "nsqsube;": "\u22e2",
+    "nsqsupe;": "\u22e3",
+    "nsub;": "\u2284",
+    "nsubE;": "\u2ac5\u0338",
+    "nsube;": "\u2288",
+    "nsubset;": "\u2282\u20d2",
+    "nsubseteq;": "\u2288",
+    "nsubseteqq;": "\u2ac5\u0338",
+    "nsucc;": "\u2281",
+    "nsucceq;": "\u2ab0\u0338",
+    "nsup;": "\u2285",
+    "nsupE;": "\u2ac6\u0338",
+    "nsupe;": "\u2289",
+    "nsupset;": "\u2283\u20d2",
+    "nsupseteq;": "\u2289",
+    "nsupseteqq;": "\u2ac6\u0338",
+    "ntgl;": "\u2279",
+    "ntilde": "\xf1",
+    "ntilde;": "\xf1",
+    "ntlg;": "\u2278",
+    "ntriangleleft;": "\u22ea",
+    "ntrianglelefteq;": "\u22ec",
+    "ntriangleright;": "\u22eb",
+    "ntrianglerighteq;": "\u22ed",
+    "nu;": "\u03bd",
+    "num;": "#",
+    "numero;": "\u2116",
+    "numsp;": "\u2007",
+    "nvDash;": "\u22ad",
+    "nvHarr;": "\u2904",
+    "nvap;": "\u224d\u20d2",
+    "nvdash;": "\u22ac",
+    "nvge;": "\u2265\u20d2",
+    "nvgt;": ">\u20d2",
+    "nvinfin;": "\u29de",
+    "nvlArr;": "\u2902",
+    "nvle;": "\u2264\u20d2",
+    "nvlt;": "<\u20d2",
+    "nvltrie;": "\u22b4\u20d2",
+    "nvrArr;": "\u2903",
+    "nvrtrie;": "\u22b5\u20d2",
+    "nvsim;": "\u223c\u20d2",
+    "nwArr;": "\u21d6",
+    "nwarhk;": "\u2923",
+    "nwarr;": "\u2196",
+    "nwarrow;": "\u2196",
+    "nwnear;": "\u2927",
+    "oS;": "\u24c8",
+    "oacute": "\xf3",
+    "oacute;": "\xf3",
+    "oast;": "\u229b",
+    "ocir;": "\u229a",
+    "ocirc": "\xf4",
+    "ocirc;": "\xf4",
+    "ocy;": "\u043e",
+    "odash;": "\u229d",
+    "odblac;": "\u0151",
+    "odiv;": "\u2a38",
+    "odot;": "\u2299",
+    "odsold;": "\u29bc",
+    "oelig;": "\u0153",
+    "ofcir;": "\u29bf",
+    "ofr;": "\U0001d52c",
+    "ogon;": "\u02db",
+    "ograve": "\xf2",
+    "ograve;": "\xf2",
+    "ogt;": "\u29c1",
+    "ohbar;": "\u29b5",
+    "ohm;": "\u03a9",
+    "oint;": "\u222e",
+    "olarr;": "\u21ba",
+    "olcir;": "\u29be",
+    "olcross;": "\u29bb",
+    "oline;": "\u203e",
+    "olt;": "\u29c0",
+    "omacr;": "\u014d",
+    "omega;": "\u03c9",
+    "omicron;": "\u03bf",
+    "omid;": "\u29b6",
+    "ominus;": "\u2296",
+    "oopf;": "\U0001d560",
+    "opar;": "\u29b7",
+    "operp;": "\u29b9",
+    "oplus;": "\u2295",
+    "or;": "\u2228",
+    "orarr;": "\u21bb",
+    "ord;": "\u2a5d",
+    "order;": "\u2134",
+    "orderof;": "\u2134",
+    "ordf": "\xaa",
+    "ordf;": "\xaa",
+    "ordm": "\xba",
+    "ordm;": "\xba",
+    "origof;": "\u22b6",
+    "oror;": "\u2a56",
+    "orslope;": "\u2a57",
+    "orv;": "\u2a5b",
+    "oscr;": "\u2134",
+    "oslash": "\xf8",
+    "oslash;": "\xf8",
+    "osol;": "\u2298",
+    "otilde": "\xf5",
+    "otilde;": "\xf5",
+    "otimes;": "\u2297",
+    "otimesas;": "\u2a36",
+    "ouml": "\xf6",
+    "ouml;": "\xf6",
+    "ovbar;": "\u233d",
+    "par;": "\u2225",
+    "para": "\xb6",
+    "para;": "\xb6",
+    "parallel;": "\u2225",
+    "parsim;": "\u2af3",
+    "parsl;": "\u2afd",
+    "part;": "\u2202",
+    "pcy;": "\u043f",
+    "percnt;": "%",
+    "period;": ".",
+    "permil;": "\u2030",
+    "perp;": "\u22a5",
+    "pertenk;": "\u2031",
+    "pfr;": "\U0001d52d",
+    "phi;": "\u03c6",
+    "phiv;": "\u03d5",
+    "phmmat;": "\u2133",
+    "phone;": "\u260e",
+    "pi;": "\u03c0",
+    "pitchfork;": "\u22d4",
+    "piv;": "\u03d6",
+    "planck;": "\u210f",
+    "planckh;": "\u210e",
+    "plankv;": "\u210f",
+    "plus;": "+",
+    "plusacir;": "\u2a23",
+    "plusb;": "\u229e",
+    "pluscir;": "\u2a22",
+    "plusdo;": "\u2214",
+    "plusdu;": "\u2a25",
+    "pluse;": "\u2a72",
+    "plusmn": "\xb1",
+    "plusmn;": "\xb1",
+    "plussim;": "\u2a26",
+    "plustwo;": "\u2a27",
+    "pm;": "\xb1",
+    "pointint;": "\u2a15",
+    "popf;": "\U0001d561",
+    "pound": "\xa3",
+    "pound;": "\xa3",
+    "pr;": "\u227a",
+    "prE;": "\u2ab3",
+    "prap;": "\u2ab7",
+    "prcue;": "\u227c",
+    "pre;": "\u2aaf",
+    "prec;": "\u227a",
+    "precapprox;": "\u2ab7",
+    "preccurlyeq;": "\u227c",
+    "preceq;": "\u2aaf",
+    "precnapprox;": "\u2ab9",
+    "precneqq;": "\u2ab5",
+    "precnsim;": "\u22e8",
+    "precsim;": "\u227e",
+    "prime;": "\u2032",
+    "primes;": "\u2119",
+    "prnE;": "\u2ab5",
+    "prnap;": "\u2ab9",
+    "prnsim;": "\u22e8",
+    "prod;": "\u220f",
+    "profalar;": "\u232e",
+    "profline;": "\u2312",
+    "profsurf;": "\u2313",
+    "prop;": "\u221d",
+    "propto;": "\u221d",
+    "prsim;": "\u227e",
+    "prurel;": "\u22b0",
+    "pscr;": "\U0001d4c5",
+    "psi;": "\u03c8",
+    "puncsp;": "\u2008",
+    "qfr;": "\U0001d52e",
+    "qint;": "\u2a0c",
+    "qopf;": "\U0001d562",
+    "qprime;": "\u2057",
+    "qscr;": "\U0001d4c6",
+    "quaternions;": "\u210d",
+    "quatint;": "\u2a16",
+    "quest;": "?",
+    "questeq;": "\u225f",
+    "quot": "\"",
+    "quot;": "\"",
+    "rAarr;": "\u21db",
+    "rArr;": "\u21d2",
+    "rAtail;": "\u291c",
+    "rBarr;": "\u290f",
+    "rHar;": "\u2964",
+    "race;": "\u223d\u0331",
+    "racute;": "\u0155",
+    "radic;": "\u221a",
+    "raemptyv;": "\u29b3",
+    "rang;": "\u27e9",
+    "rangd;": "\u2992",
+    "range;": "\u29a5",
+    "rangle;": "\u27e9",
+    "raquo": "\xbb",
+    "raquo;": "\xbb",
+    "rarr;": "\u2192",
+    "rarrap;": "\u2975",
+    "rarrb;": "\u21e5",
+    "rarrbfs;": "\u2920",
+    "rarrc;": "\u2933",
+    "rarrfs;": "\u291e",
+    "rarrhk;": "\u21aa",
+    "rarrlp;": "\u21ac",
+    "rarrpl;": "\u2945",
+    "rarrsim;": "\u2974",
+    "rarrtl;": "\u21a3",
+    "rarrw;": "\u219d",
+    "ratail;": "\u291a",
+    "ratio;": "\u2236",
+    "rationals;": "\u211a",
+    "rbarr;": "\u290d",
+    "rbbrk;": "\u2773",
+    "rbrace;": "}",
+    "rbrack;": "]",
+    "rbrke;": "\u298c",
+    "rbrksld;": "\u298e",
+    "rbrkslu;": "\u2990",
+    "rcaron;": "\u0159",
+    "rcedil;": "\u0157",
+    "rceil;": "\u2309",
+    "rcub;": "}",
+    "rcy;": "\u0440",
+    "rdca;": "\u2937",
+    "rdldhar;": "\u2969",
+    "rdquo;": "\u201d",
+    "rdquor;": "\u201d",
+    "rdsh;": "\u21b3",
+    "real;": "\u211c",
+    "realine;": "\u211b",
+    "realpart;": "\u211c",
+    "reals;": "\u211d",
+    "rect;": "\u25ad",
+    "reg": "\xae",
+    "reg;": "\xae",
+    "rfisht;": "\u297d",
+    "rfloor;": "\u230b",
+    "rfr;": "\U0001d52f",
+    "rhard;": "\u21c1",
+    "rharu;": "\u21c0",
+    "rharul;": "\u296c",
+    "rho;": "\u03c1",
+    "rhov;": "\u03f1",
+    "rightarrow;": "\u2192",
+    "rightarrowtail;": "\u21a3",
+    "rightharpoondown;": "\u21c1",
+    "rightharpoonup;": "\u21c0",
+    "rightleftarrows;": "\u21c4",
+    "rightleftharpoons;": "\u21cc",
+    "rightrightarrows;": "\u21c9",
+    "rightsquigarrow;": "\u219d",
+    "rightthreetimes;": "\u22cc",
+    "ring;": "\u02da",
+    "risingdotseq;": "\u2253",
+    "rlarr;": "\u21c4",
+    "rlhar;": "\u21cc",
+    "rlm;": "\u200f",
+    "rmoust;": "\u23b1",
+    "rmoustache;": "\u23b1",
+    "rnmid;": "\u2aee",
+    "roang;": "\u27ed",
+    "roarr;": "\u21fe",
+    "robrk;": "\u27e7",
+    "ropar;": "\u2986",
+    "ropf;": "\U0001d563",
+    "roplus;": "\u2a2e",
+    "rotimes;": "\u2a35",
+    "rpar;": ")",
+    "rpargt;": "\u2994",
+    "rppolint;": "\u2a12",
+    "rrarr;": "\u21c9",
+    "rsaquo;": "\u203a",
+    "rscr;": "\U0001d4c7",
+    "rsh;": "\u21b1",
+    "rsqb;": "]",
+    "rsquo;": "\u2019",
+    "rsquor;": "\u2019",
+    "rthree;": "\u22cc",
+    "rtimes;": "\u22ca",
+    "rtri;": "\u25b9",
+    "rtrie;": "\u22b5",
+    "rtrif;": "\u25b8",
+    "rtriltri;": "\u29ce",
+    "ruluhar;": "\u2968",
+    "rx;": "\u211e",
+    "sacute;": "\u015b",
+    "sbquo;": "\u201a",
+    "sc;": "\u227b",
+    "scE;": "\u2ab4",
+    "scap;": "\u2ab8",
+    "scaron;": "\u0161",
+    "sccue;": "\u227d",
+    "sce;": "\u2ab0",
+    "scedil;": "\u015f",
+    "scirc;": "\u015d",
+    "scnE;": "\u2ab6",
+    "scnap;": "\u2aba",
+    "scnsim;": "\u22e9",
+    "scpolint;": "\u2a13",
+    "scsim;": "\u227f",
+    "scy;": "\u0441",
+    "sdot;": "\u22c5",
+    "sdotb;": "\u22a1",
+    "sdote;": "\u2a66",
+    "seArr;": "\u21d8",
+    "searhk;": "\u2925",
+    "searr;": "\u2198",
+    "searrow;": "\u2198",
+    "sect": "\xa7",
+    "sect;": "\xa7",
+    "semi;": ";",
+    "seswar;": "\u2929",
+    "setminus;": "\u2216",
+    "setmn;": "\u2216",
+    "sext;": "\u2736",
+    "sfr;": "\U0001d530",
+    "sfrown;": "\u2322",
+    "sharp;": "\u266f",
+    "shchcy;": "\u0449",
+    "shcy;": "\u0448",
+    "shortmid;": "\u2223",
+    "shortparallel;": "\u2225",
+    "shy": "\xad",
+    "shy;": "\xad",
+    "sigma;": "\u03c3",
+    "sigmaf;": "\u03c2",
+    "sigmav;": "\u03c2",
+    "sim;": "\u223c",
+    "simdot;": "\u2a6a",
+    "sime;": "\u2243",
+    "simeq;": "\u2243",
+    "simg;": "\u2a9e",
+    "simgE;": "\u2aa0",
+    "siml;": "\u2a9d",
+    "simlE;": "\u2a9f",
+    "simne;": "\u2246",
+    "simplus;": "\u2a24",
+    "simrarr;": "\u2972",
+    "slarr;": "\u2190",
+    "smallsetminus;": "\u2216",
+    "smashp;": "\u2a33",
+    "smeparsl;": "\u29e4",
+    "smid;": "\u2223",
+    "smile;": "\u2323",
+    "smt;": "\u2aaa",
+    "smte;": "\u2aac",
+    "smtes;": "\u2aac\ufe00",
+    "softcy;": "\u044c",
+    "sol;": "/",
+    "solb;": "\u29c4",
+    "solbar;": "\u233f",
+    "sopf;": "\U0001d564",
+    "spades;": "\u2660",
+    "spadesuit;": "\u2660",
+    "spar;": "\u2225",
+    "sqcap;": "\u2293",
+    "sqcaps;": "\u2293\ufe00",
+    "sqcup;": "\u2294",
+    "sqcups;": "\u2294\ufe00",
+    "sqsub;": "\u228f",
+    "sqsube;": "\u2291",
+    "sqsubset;": "\u228f",
+    "sqsubseteq;": "\u2291",
+    "sqsup;": "\u2290",
+    "sqsupe;": "\u2292",
+    "sqsupset;": "\u2290",
+    "sqsupseteq;": "\u2292",
+    "squ;": "\u25a1",
+    "square;": "\u25a1",
+    "squarf;": "\u25aa",
+    "squf;": "\u25aa",
+    "srarr;": "\u2192",
+    "sscr;": "\U0001d4c8",
+    "ssetmn;": "\u2216",
+    "ssmile;": "\u2323",
+    "sstarf;": "\u22c6",
+    "star;": "\u2606",
+    "starf;": "\u2605",
+    "straightepsilon;": "\u03f5",
+    "straightphi;": "\u03d5",
+    "strns;": "\xaf",
+    "sub;": "\u2282",
+    "subE;": "\u2ac5",
+    "subdot;": "\u2abd",
+    "sube;": "\u2286",
+    "subedot;": "\u2ac3",
+    "submult;": "\u2ac1",
+    "subnE;": "\u2acb",
+    "subne;": "\u228a",
+    "subplus;": "\u2abf",
+    "subrarr;": "\u2979",
+    "subset;": "\u2282",
+    "subseteq;": "\u2286",
+    "subseteqq;": "\u2ac5",
+    "subsetneq;": "\u228a",
+    "subsetneqq;": "\u2acb",
+    "subsim;": "\u2ac7",
+    "subsub;": "\u2ad5",
+    "subsup;": "\u2ad3",
+    "succ;": "\u227b",
+    "succapprox;": "\u2ab8",
+    "succcurlyeq;": "\u227d",
+    "succeq;": "\u2ab0",
+    "succnapprox;": "\u2aba",
+    "succneqq;": "\u2ab6",
+    "succnsim;": "\u22e9",
+    "succsim;": "\u227f",
+    "sum;": "\u2211",
+    "sung;": "\u266a",
+    "sup1": "\xb9",
+    "sup1;": "\xb9",
+    "sup2": "\xb2",
+    "sup2;": "\xb2",
+    "sup3": "\xb3",
+    "sup3;": "\xb3",
+    "sup;": "\u2283",
+    "supE;": "\u2ac6",
+    "supdot;": "\u2abe",
+    "supdsub;": "\u2ad8",
+    "supe;": "\u2287",
+    "supedot;": "\u2ac4",
+    "suphsol;": "\u27c9",
+    "suphsub;": "\u2ad7",
+    "suplarr;": "\u297b",
+    "supmult;": "\u2ac2",
+    "supnE;": "\u2acc",
+    "supne;": "\u228b",
+    "supplus;": "\u2ac0",
+    "supset;": "\u2283",
+    "supseteq;": "\u2287",
+    "supseteqq;": "\u2ac6",
+    "supsetneq;": "\u228b",
+    "supsetneqq;": "\u2acc",
+    "supsim;": "\u2ac8",
+    "supsub;": "\u2ad4",
+    "supsup;": "\u2ad6",
+    "swArr;": "\u21d9",
+    "swarhk;": "\u2926",
+    "swarr;": "\u2199",
+    "swarrow;": "\u2199",
+    "swnwar;": "\u292a",
+    "szlig": "\xdf",
+    "szlig;": "\xdf",
+    "target;": "\u2316",
+    "tau;": "\u03c4",
+    "tbrk;": "\u23b4",
+    "tcaron;": "\u0165",
+    "tcedil;": "\u0163",
+    "tcy;": "\u0442",
+    "tdot;": "\u20db",
+    "telrec;": "\u2315",
+    "tfr;": "\U0001d531",
+    "there4;": "\u2234",
+    "therefore;": "\u2234",
+    "theta;": "\u03b8",
+    "thetasym;": "\u03d1",
+    "thetav;": "\u03d1",
+    "thickapprox;": "\u2248",
+    "thicksim;": "\u223c",
+    "thinsp;": "\u2009",
+    "thkap;": "\u2248",
+    "thksim;": "\u223c",
+    "thorn": "\xfe",
+    "thorn;": "\xfe",
+    "tilde;": "\u02dc",
+    "times": "\xd7",
+    "times;": "\xd7",
+    "timesb;": "\u22a0",
+    "timesbar;": "\u2a31",
+    "timesd;": "\u2a30",
+    "tint;": "\u222d",
+    "toea;": "\u2928",
+    "top;": "\u22a4",
+    "topbot;": "\u2336",
+    "topcir;": "\u2af1",
+    "topf;": "\U0001d565",
+    "topfork;": "\u2ada",
+    "tosa;": "\u2929",
+    "tprime;": "\u2034",
+    "trade;": "\u2122",
+    "triangle;": "\u25b5",
+    "triangledown;": "\u25bf",
+    "triangleleft;": "\u25c3",
+    "trianglelefteq;": "\u22b4",
+    "triangleq;": "\u225c",
+    "triangleright;": "\u25b9",
+    "trianglerighteq;": "\u22b5",
+    "tridot;": "\u25ec",
+    "trie;": "\u225c",
+    "triminus;": "\u2a3a",
+    "triplus;": "\u2a39",
+    "trisb;": "\u29cd",
+    "tritime;": "\u2a3b",
+    "trpezium;": "\u23e2",
+    "tscr;": "\U0001d4c9",
+    "tscy;": "\u0446",
+    "tshcy;": "\u045b",
+    "tstrok;": "\u0167",
+    "twixt;": "\u226c",
+    "twoheadleftarrow;": "\u219e",
+    "twoheadrightarrow;": "\u21a0",
+    "uArr;": "\u21d1",
+    "uHar;": "\u2963",
+    "uacute": "\xfa",
+    "uacute;": "\xfa",
+    "uarr;": "\u2191",
+    "ubrcy;": "\u045e",
+    "ubreve;": "\u016d",
+    "ucirc": "\xfb",
+    "ucirc;": "\xfb",
+    "ucy;": "\u0443",
+    "udarr;": "\u21c5",
+    "udblac;": "\u0171",
+    "udhar;": "\u296e",
+    "ufisht;": "\u297e",
+    "ufr;": "\U0001d532",
+    "ugrave": "\xf9",
+    "ugrave;": "\xf9",
+    "uharl;": "\u21bf",
+    "uharr;": "\u21be",
+    "uhblk;": "\u2580",
+    "ulcorn;": "\u231c",
+    "ulcorner;": "\u231c",
+    "ulcrop;": "\u230f",
+    "ultri;": "\u25f8",
+    "umacr;": "\u016b",
+    "uml": "\xa8",
+    "uml;": "\xa8",
+    "uogon;": "\u0173",
+    "uopf;": "\U0001d566",
+    "uparrow;": "\u2191",
+    "updownarrow;": "\u2195",
+    "upharpoonleft;": "\u21bf",
+    "upharpoonright;": "\u21be",
+    "uplus;": "\u228e",
+    "upsi;": "\u03c5",
+    "upsih;": "\u03d2",
+    "upsilon;": "\u03c5",
+    "upuparrows;": "\u21c8",
+    "urcorn;": "\u231d",
+    "urcorner;": "\u231d",
+    "urcrop;": "\u230e",
+    "uring;": "\u016f",
+    "urtri;": "\u25f9",
+    "uscr;": "\U0001d4ca",
+    "utdot;": "\u22f0",
+    "utilde;": "\u0169",
+    "utri;": "\u25b5",
+    "utrif;": "\u25b4",
+    "uuarr;": "\u21c8",
+    "uuml": "\xfc",
+    "uuml;": "\xfc",
+    "uwangle;": "\u29a7",
+    "vArr;": "\u21d5",
+    "vBar;": "\u2ae8",
+    "vBarv;": "\u2ae9",
+    "vDash;": "\u22a8",
+    "vangrt;": "\u299c",
+    "varepsilon;": "\u03f5",
+    "varkappa;": "\u03f0",
+    "varnothing;": "\u2205",
+    "varphi;": "\u03d5",
+    "varpi;": "\u03d6",
+    "varpropto;": "\u221d",
+    "varr;": "\u2195",
+    "varrho;": "\u03f1",
+    "varsigma;": "\u03c2",
+    "varsubsetneq;": "\u228a\ufe00",
+    "varsubsetneqq;": "\u2acb\ufe00",
+    "varsupsetneq;": "\u228b\ufe00",
+    "varsupsetneqq;": "\u2acc\ufe00",
+    "vartheta;": "\u03d1",
+    "vartriangleleft;": "\u22b2",
+    "vartriangleright;": "\u22b3",
+    "vcy;": "\u0432",
+    "vdash;": "\u22a2",
+    "vee;": "\u2228",
+    "veebar;": "\u22bb",
+    "veeeq;": "\u225a",
+    "vellip;": "\u22ee",
+    "verbar;": "|",
+    "vert;": "|",
+    "vfr;": "\U0001d533",
+    "vltri;": "\u22b2",
+    "vnsub;": "\u2282\u20d2",
+    "vnsup;": "\u2283\u20d2",
+    "vopf;": "\U0001d567",
+    "vprop;": "\u221d",
+    "vrtri;": "\u22b3",
+    "vscr;": "\U0001d4cb",
+    "vsubnE;": "\u2acb\ufe00",
+    "vsubne;": "\u228a\ufe00",
+    "vsupnE;": "\u2acc\ufe00",
+    "vsupne;": "\u228b\ufe00",
+    "vzigzag;": "\u299a",
+    "wcirc;": "\u0175",
+    "wedbar;": "\u2a5f",
+    "wedge;": "\u2227",
+    "wedgeq;": "\u2259",
+    "weierp;": "\u2118",
+    "wfr;": "\U0001d534",
+    "wopf;": "\U0001d568",
+    "wp;": "\u2118",
+    "wr;": "\u2240",
+    "wreath;": "\u2240",
+    "wscr;": "\U0001d4cc",
+    "xcap;": "\u22c2",
+    "xcirc;": "\u25ef",
+    "xcup;": "\u22c3",
+    "xdtri;": "\u25bd",
+    "xfr;": "\U0001d535",
+    "xhArr;": "\u27fa",
+    "xharr;": "\u27f7",
+    "xi;": "\u03be",
+    "xlArr;": "\u27f8",
+    "xlarr;": "\u27f5",
+    "xmap;": "\u27fc",
+    "xnis;": "\u22fb",
+    "xodot;": "\u2a00",
+    "xopf;": "\U0001d569",
+    "xoplus;": "\u2a01",
+    "xotime;": "\u2a02",
+    "xrArr;": "\u27f9",
+    "xrarr;": "\u27f6",
+    "xscr;": "\U0001d4cd",
+    "xsqcup;": "\u2a06",
+    "xuplus;": "\u2a04",
+    "xutri;": "\u25b3",
+    "xvee;": "\u22c1",
+    "xwedge;": "\u22c0",
+    "yacute": "\xfd",
+    "yacute;": "\xfd",
+    "yacy;": "\u044f",
+    "ycirc;": "\u0177",
+    "ycy;": "\u044b",
+    "yen": "\xa5",
+    "yen;": "\xa5",
+    "yfr;": "\U0001d536",
+    "yicy;": "\u0457",
+    "yopf;": "\U0001d56a",
+    "yscr;": "\U0001d4ce",
+    "yucy;": "\u044e",
+    "yuml": "\xff",
+    "yuml;": "\xff",
+    "zacute;": "\u017a",
+    "zcaron;": "\u017e",
+    "zcy;": "\u0437",
+    "zdot;": "\u017c",
+    "zeetrf;": "\u2128",
+    "zeta;": "\u03b6",
+    "zfr;": "\U0001d537",
+    "zhcy;": "\u0436",
+    "zigrarr;": "\u21dd",
+    "zopf;": "\U0001d56b",
+    "zscr;": "\U0001d4cf",
+    "zwj;": "\u200d",
+    "zwnj;": "\u200c",
+}
+
+replacementCharacters = {
+    0x0: "\uFFFD",
+    0x0d: "\u000D",
+    0x80: "\u20AC",
+    0x81: "\u0081",
+    0x82: "\u201A",
+    0x83: "\u0192",
+    0x84: "\u201E",
+    0x85: "\u2026",
+    0x86: "\u2020",
+    0x87: "\u2021",
+    0x88: "\u02C6",
+    0x89: "\u2030",
+    0x8A: "\u0160",
+    0x8B: "\u2039",
+    0x8C: "\u0152",
+    0x8D: "\u008D",
+    0x8E: "\u017D",
+    0x8F: "\u008F",
+    0x90: "\u0090",
+    0x91: "\u2018",
+    0x92: "\u2019",
+    0x93: "\u201C",
+    0x94: "\u201D",
+    0x95: "\u2022",
+    0x96: "\u2013",
+    0x97: "\u2014",
+    0x98: "\u02DC",
+    0x99: "\u2122",
+    0x9A: "\u0161",
+    0x9B: "\u203A",
+    0x9C: "\u0153",
+    0x9D: "\u009D",
+    0x9E: "\u017E",
+    0x9F: "\u0178",
+}
+
+tokenTypes = {
+    "Doctype": 0,
+    "Characters": 1,
+    "SpaceCharacters": 2,
+    "StartTag": 3,
+    "EndTag": 4,
+    "EmptyTag": 5,
+    "Comment": 6,
+    "ParseError": 7
+}
+
+tagTokenTypes = frozenset([tokenTypes["StartTag"], tokenTypes["EndTag"],
+                           tokenTypes["EmptyTag"]])
+
+
+prefixes = {v: k for k, v in namespaces.items()}
+prefixes["http://www.w3.org/1998/Math/MathML"] = "math"
+
+
+class DataLossWarning(UserWarning):
+    """Raised when the current tree is unable to represent the input data"""
+    pass
+
+
+class _ReparseException(Exception):
+    pass
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..398b778bf
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc
new file mode 100644
index 000000000..bb15393cb
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/alphabeticalattributes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..83f1f7ff6
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc
new file mode 100644
index 000000000..bc2e993f2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/inject_meta_charset.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc
new file mode 100644
index 000000000..85673a27c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/lint.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc
new file mode 100644
index 000000000..e8fa56694
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/optionaltags.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc
new file mode 100644
index 000000000..bafa39def
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/sanitizer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc
new file mode 100644
index 000000000..54e386957
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/__pycache__/whitespace.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/alphabeticalattributes.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/alphabeticalattributes.py
new file mode 100644
index 000000000..5ba926e3b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/alphabeticalattributes.py
@@ -0,0 +1,29 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from . import base
+
+from collections import OrderedDict
+
+
+def _attr_key(attr):
+    """Return an appropriate key for an attribute for sorting
+
+    Attributes have a namespace that can be either ``None`` or a string. We
+    can't compare the two because they're different types, so we convert
+    ``None`` to an empty string first.
+
+    """
+    return (attr[0][0] or ''), attr[0][1]
+
+
+class Filter(base.Filter):
+    """Alphabetizes attributes for elements"""
+    def __iter__(self):
+        for token in base.Filter.__iter__(self):
+            if token["type"] in ("StartTag", "EmptyTag"):
+                attrs = OrderedDict()
+                for name, value in sorted(token["data"].items(),
+                                          key=_attr_key):
+                    attrs[name] = value
+                token["data"] = attrs
+            yield token
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/base.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/base.py
new file mode 100644
index 000000000..c7dbaed0f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/base.py
@@ -0,0 +1,12 @@
+from __future__ import absolute_import, division, unicode_literals
+
+
+class Filter(object):
+    def __init__(self, source):
+        self.source = source
+
+    def __iter__(self):
+        return iter(self.source)
+
+    def __getattr__(self, name):
+        return getattr(self.source, name)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/inject_meta_charset.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/inject_meta_charset.py
new file mode 100644
index 000000000..aefb5c842
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/inject_meta_charset.py
@@ -0,0 +1,73 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from . import base
+
+
+class Filter(base.Filter):
+    """Injects ``<meta charset=ENCODING>`` tag into head of document"""
+    def __init__(self, source, encoding):
+        """Creates a Filter
+
+        :arg source: the source token stream
+
+        :arg encoding: the encoding to set
+
+        """
+        base.Filter.__init__(self, source)
+        self.encoding = encoding
+
+    def __iter__(self):
+        state = "pre_head"
+        meta_found = (self.encoding is None)
+        pending = []
+
+        for token in base.Filter.__iter__(self):
+            type = token["type"]
+            if type == "StartTag":
+                if token["name"].lower() == "head":
+                    state = "in_head"
+
+            elif type == "EmptyTag":
+                if token["name"].lower() == "meta":
+                    # replace charset with actual encoding
+                    has_http_equiv_content_type = False
+                    for (namespace, name), value in token["data"].items():
+                        if namespace is not None:
+                            continue
+                        elif name.lower() == 'charset':
+                            token["data"][(namespace, name)] = self.encoding
+                            meta_found = True
+                            break
+                        elif name == 'http-equiv' and value.lower() == 'content-type':
+                            has_http_equiv_content_type = True
+                    else:
+                        if has_http_equiv_content_type and (None, "content") in token["data"]:
+                            token["data"][(None, "content")] = 'text/html; charset=%s' % self.encoding
+                            meta_found = True
+
+                elif token["name"].lower() == "head" and not meta_found:
+                    # insert meta into empty head
+                    yield {"type": "StartTag", "name": "head",
+                           "data": token["data"]}
+                    yield {"type": "EmptyTag", "name": "meta",
+                           "data": {(None, "charset"): self.encoding}}
+                    yield {"type": "EndTag", "name": "head"}
+                    meta_found = True
+                    continue
+
+            elif type == "EndTag":
+                if token["name"].lower() == "head" and pending:
+                    # insert meta into head (if necessary) and flush pending queue
+                    yield pending.pop(0)
+                    if not meta_found:
+                        yield {"type": "EmptyTag", "name": "meta",
+                               "data": {(None, "charset"): self.encoding}}
+                    while pending:
+                        yield pending.pop(0)
+                    meta_found = True
+                    state = "post_head"
+
+            if state == "in_head":
+                pending.append(token)
+            else:
+                yield token
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/lint.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/lint.py
new file mode 100644
index 000000000..fcc07eec5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/lint.py
@@ -0,0 +1,93 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from pip._vendor.six import text_type
+
+from . import base
+from ..constants import namespaces, voidElements
+
+from ..constants import spaceCharacters
+spaceCharacters = "".join(spaceCharacters)
+
+
+class Filter(base.Filter):
+    """Lints the token stream for errors
+
+    If it finds any errors, it'll raise an ``AssertionError``.
+
+    """
+    def __init__(self, source, require_matching_tags=True):
+        """Creates a Filter
+
+        :arg source: the source token stream
+
+        :arg require_matching_tags: whether or not to require matching tags
+
+        """
+        super(Filter, self).__init__(source)
+        self.require_matching_tags = require_matching_tags
+
+    def __iter__(self):
+        open_elements = []
+        for token in base.Filter.__iter__(self):
+            type = token["type"]
+            if type in ("StartTag", "EmptyTag"):
+                namespace = token["namespace"]
+                name = token["name"]
+                assert namespace is None or isinstance(namespace, text_type)
+                assert namespace != ""
+                assert isinstance(name, text_type)
+                assert name != ""
+                assert isinstance(token["data"], dict)
+                if (not namespace or namespace == namespaces["html"]) and name in voidElements:
+                    assert type == "EmptyTag"
+                else:
+                    assert type == "StartTag"
+                if type == "StartTag" and self.require_matching_tags:
+                    open_elements.append((namespace, name))
+                for (namespace, name), value in token["data"].items():
+                    assert namespace is None or isinstance(namespace, text_type)
+                    assert namespace != ""
+                    assert isinstance(name, text_type)
+                    assert name != ""
+                    assert isinstance(value, text_type)
+
+            elif type == "EndTag":
+                namespace = token["namespace"]
+                name = token["name"]
+                assert namespace is None or isinstance(namespace, text_type)
+                assert namespace != ""
+                assert isinstance(name, text_type)
+                assert name != ""
+                if (not namespace or namespace == namespaces["html"]) and name in voidElements:
+                    assert False, "Void element reported as EndTag token: %(tag)s" % {"tag": name}
+                elif self.require_matching_tags:
+                    start = open_elements.pop()
+                    assert start == (namespace, name)
+
+            elif type == "Comment":
+                data = token["data"]
+                assert isinstance(data, text_type)
+
+            elif type in ("Characters", "SpaceCharacters"):
+                data = token["data"]
+                assert isinstance(data, text_type)
+                assert data != ""
+                if type == "SpaceCharacters":
+                    assert data.strip(spaceCharacters) == ""
+
+            elif type == "Doctype":
+                name = token["name"]
+                assert name is None or isinstance(name, text_type)
+                assert token["publicId"] is None or isinstance(name, text_type)
+                assert token["systemId"] is None or isinstance(name, text_type)
+
+            elif type == "Entity":
+                assert isinstance(token["name"], text_type)
+
+            elif type == "SerializerError":
+                assert isinstance(token["data"], text_type)
+
+            else:
+                assert False, "Unknown token type: %(type)s" % {"type": type}
+
+            yield token
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/optionaltags.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/optionaltags.py
new file mode 100644
index 000000000..4a865012c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/optionaltags.py
@@ -0,0 +1,207 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from . import base
+
+
+class Filter(base.Filter):
+    """Removes optional tags from the token stream"""
+    def slider(self):
+        previous1 = previous2 = None
+        for token in self.source:
+            if previous1 is not None:
+                yield previous2, previous1, token
+            previous2 = previous1
+            previous1 = token
+        if previous1 is not None:
+            yield previous2, previous1, None
+
+    def __iter__(self):
+        for previous, token, next in self.slider():
+            type = token["type"]
+            if type == "StartTag":
+                if (token["data"] or
+                        not self.is_optional_start(token["name"], previous, next)):
+                    yield token
+            elif type == "EndTag":
+                if not self.is_optional_end(token["name"], next):
+                    yield token
+            else:
+                yield token
+
+    def is_optional_start(self, tagname, previous, next):
+        type = next and next["type"] or None
+        if tagname in 'html':
+            # An html element's start tag may be omitted if the first thing
+            # inside the html element is not a space character or a comment.
+            return type not in ("Comment", "SpaceCharacters")
+        elif tagname == 'head':
+            # A head element's start tag may be omitted if the first thing
+            # inside the head element is an element.
+            # XXX: we also omit the start tag if the head element is empty
+            if type in ("StartTag", "EmptyTag"):
+                return True
+            elif type == "EndTag":
+                return next["name"] == "head"
+        elif tagname == 'body':
+            # A body element's start tag may be omitted if the first thing
+            # inside the body element is not a space character or a comment,
+            # except if the first thing inside the body element is a script
+            # or style element and the node immediately preceding the body
+            # element is a head element whose end tag has been omitted.
+            if type in ("Comment", "SpaceCharacters"):
+                return False
+            elif type == "StartTag":
+                # XXX: we do not look at the preceding event, so we never omit
+                # the body element's start tag if it's followed by a script or
+                # a style element.
+                return next["name"] not in ('script', 'style')
+            else:
+                return True
+        elif tagname == 'colgroup':
+            # A colgroup element's start tag may be omitted if the first thing
+            # inside the colgroup element is a col element, and if the element
+            # is not immediately preceded by another colgroup element whose
+            # end tag has been omitted.
+            if type in ("StartTag", "EmptyTag"):
+                # XXX: we do not look at the preceding event, so instead we never
+                # omit the colgroup element's end tag when it is immediately
+                # followed by another colgroup element. See is_optional_end.
+                return next["name"] == "col"
+            else:
+                return False
+        elif tagname == 'tbody':
+            # A tbody element's start tag may be omitted if the first thing
+            # inside the tbody element is a tr element, and if the element is
+            # not immediately preceded by a tbody, thead, or tfoot element
+            # whose end tag has been omitted.
+            if type == "StartTag":
+                # omit the thead and tfoot elements' end tag when they are
+                # immediately followed by a tbody element. See is_optional_end.
+                if previous and previous['type'] == 'EndTag' and \
+                        previous['name'] in ('tbody', 'thead', 'tfoot'):
+                    return False
+                return next["name"] == 'tr'
+            else:
+                return False
+        return False
+
+    def is_optional_end(self, tagname, next):
+        type = next and next["type"] or None
+        if tagname in ('html', 'head', 'body'):
+            # An html element's end tag may be omitted if the html element
+            # is not immediately followed by a space character or a comment.
+            return type not in ("Comment", "SpaceCharacters")
+        elif tagname in ('li', 'optgroup', 'tr'):
+            # A li element's end tag may be omitted if the li element is
+            # immediately followed by another li element or if there is
+            # no more content in the parent element.
+            # An optgroup element's end tag may be omitted if the optgroup
+            # element is immediately followed by another optgroup element,
+            # or if there is no more content in the parent element.
+            # A tr element's end tag may be omitted if the tr element is
+            # immediately followed by another tr element, or if there is
+            # no more content in the parent element.
+            if type == "StartTag":
+                return next["name"] == tagname
+            else:
+                return type == "EndTag" or type is None
+        elif tagname in ('dt', 'dd'):
+            # A dt element's end tag may be omitted if the dt element is
+            # immediately followed by another dt element or a dd element.
+            # A dd element's end tag may be omitted if the dd element is
+            # immediately followed by another dd element or a dt element,
+            # or if there is no more content in the parent element.
+            if type == "StartTag":
+                return next["name"] in ('dt', 'dd')
+            elif tagname == 'dd':
+                return type == "EndTag" or type is None
+            else:
+                return False
+        elif tagname == 'p':
+            # A p element's end tag may be omitted if the p element is
+            # immediately followed by an address, article, aside,
+            # blockquote, datagrid, dialog, dir, div, dl, fieldset,
+            # footer, form, h1, h2, h3, h4, h5, h6, header, hr, menu,
+            # nav, ol, p, pre, section, table, or ul, element, or if
+            # there is no more content in the parent element.
+            if type in ("StartTag", "EmptyTag"):
+                return next["name"] in ('address', 'article', 'aside',
+                                        'blockquote', 'datagrid', 'dialog',
+                                        'dir', 'div', 'dl', 'fieldset', 'footer',
+                                        'form', 'h1', 'h2', 'h3', 'h4', 'h5', 'h6',
+                                        'header', 'hr', 'menu', 'nav', 'ol',
+                                        'p', 'pre', 'section', 'table', 'ul')
+            else:
+                return type == "EndTag" or type is None
+        elif tagname == 'option':
+            # An option element's end tag may be omitted if the option
+            # element is immediately followed by another option element,
+            # or if it is immediately followed by an <code>optgroup</code>
+            # element, or if there is no more content in the parent
+            # element.
+            if type == "StartTag":
+                return next["name"] in ('option', 'optgroup')
+            else:
+                return type == "EndTag" or type is None
+        elif tagname in ('rt', 'rp'):
+            # An rt element's end tag may be omitted if the rt element is
+            # immediately followed by an rt or rp element, or if there is
+            # no more content in the parent element.
+            # An rp element's end tag may be omitted if the rp element is
+            # immediately followed by an rt or rp element, or if there is
+            # no more content in the parent element.
+            if type == "StartTag":
+                return next["name"] in ('rt', 'rp')
+            else:
+                return type == "EndTag" or type is None
+        elif tagname == 'colgroup':
+            # A colgroup element's end tag may be omitted if the colgroup
+            # element is not immediately followed by a space character or
+            # a comment.
+            if type in ("Comment", "SpaceCharacters"):
+                return False
+            elif type == "StartTag":
+                # XXX: we also look for an immediately following colgroup
+                # element. See is_optional_start.
+                return next["name"] != 'colgroup'
+            else:
+                return True
+        elif tagname in ('thead', 'tbody'):
+            # A thead element's end tag may be omitted if the thead element
+            # is immediately followed by a tbody or tfoot element.
+            # A tbody element's end tag may be omitted if the tbody element
+            # is immediately followed by a tbody or tfoot element, or if
+            # there is no more content in the parent element.
+            # A tfoot element's end tag may be omitted if the tfoot element
+            # is immediately followed by a tbody element, or if there is no
+            # more content in the parent element.
+            # XXX: we never omit the end tag when the following element is
+            # a tbody. See is_optional_start.
+            if type == "StartTag":
+                return next["name"] in ['tbody', 'tfoot']
+            elif tagname == 'tbody':
+                return type == "EndTag" or type is None
+            else:
+                return False
+        elif tagname == 'tfoot':
+            # A tfoot element's end tag may be omitted if the tfoot element
+            # is immediately followed by a tbody element, or if there is no
+            # more content in the parent element.
+            # XXX: we never omit the end tag when the following element is
+            # a tbody. See is_optional_start.
+            if type == "StartTag":
+                return next["name"] == 'tbody'
+            else:
+                return type == "EndTag" or type is None
+        elif tagname in ('td', 'th'):
+            # A td element's end tag may be omitted if the td element is
+            # immediately followed by a td or th element, or if there is
+            # no more content in the parent element.
+            # A th element's end tag may be omitted if the th element is
+            # immediately followed by a td or th element, or if there is
+            # no more content in the parent element.
+            if type == "StartTag":
+                return next["name"] in ('td', 'th')
+            else:
+                return type == "EndTag" or type is None
+        return False
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/sanitizer.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/sanitizer.py
new file mode 100644
index 000000000..aa7431d13
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/sanitizer.py
@@ -0,0 +1,916 @@
+"""Deprecated from html5lib 1.1.
+
+See `here <https://github.com/html5lib/html5lib-python/issues/443>`_ for
+information about its deprecation; `Bleach <https://github.com/mozilla/bleach>`_
+is recommended as a replacement. Please let us know in the aforementioned issue
+if Bleach is unsuitable for your needs.
+
+"""
+from __future__ import absolute_import, division, unicode_literals
+
+import re
+import warnings
+from xml.sax.saxutils import escape, unescape
+
+from pip._vendor.six.moves import urllib_parse as urlparse
+
+from . import base
+from ..constants import namespaces, prefixes
+
+__all__ = ["Filter"]
+
+
+_deprecation_msg = (
+    "html5lib's sanitizer is deprecated; see " +
+    "https://github.com/html5lib/html5lib-python/issues/443 and please let " +
+    "us know if Bleach is unsuitable for your needs"
+)
+
+warnings.warn(_deprecation_msg, DeprecationWarning)
+
+allowed_elements = frozenset((
+    (namespaces['html'], 'a'),
+    (namespaces['html'], 'abbr'),
+    (namespaces['html'], 'acronym'),
+    (namespaces['html'], 'address'),
+    (namespaces['html'], 'area'),
+    (namespaces['html'], 'article'),
+    (namespaces['html'], 'aside'),
+    (namespaces['html'], 'audio'),
+    (namespaces['html'], 'b'),
+    (namespaces['html'], 'big'),
+    (namespaces['html'], 'blockquote'),
+    (namespaces['html'], 'br'),
+    (namespaces['html'], 'button'),
+    (namespaces['html'], 'canvas'),
+    (namespaces['html'], 'caption'),
+    (namespaces['html'], 'center'),
+    (namespaces['html'], 'cite'),
+    (namespaces['html'], 'code'),
+    (namespaces['html'], 'col'),
+    (namespaces['html'], 'colgroup'),
+    (namespaces['html'], 'command'),
+    (namespaces['html'], 'datagrid'),
+    (namespaces['html'], 'datalist'),
+    (namespaces['html'], 'dd'),
+    (namespaces['html'], 'del'),
+    (namespaces['html'], 'details'),
+    (namespaces['html'], 'dfn'),
+    (namespaces['html'], 'dialog'),
+    (namespaces['html'], 'dir'),
+    (namespaces['html'], 'div'),
+    (namespaces['html'], 'dl'),
+    (namespaces['html'], 'dt'),
+    (namespaces['html'], 'em'),
+    (namespaces['html'], 'event-source'),
+    (namespaces['html'], 'fieldset'),
+    (namespaces['html'], 'figcaption'),
+    (namespaces['html'], 'figure'),
+    (namespaces['html'], 'footer'),
+    (namespaces['html'], 'font'),
+    (namespaces['html'], 'form'),
+    (namespaces['html'], 'header'),
+    (namespaces['html'], 'h1'),
+    (namespaces['html'], 'h2'),
+    (namespaces['html'], 'h3'),
+    (namespaces['html'], 'h4'),
+    (namespaces['html'], 'h5'),
+    (namespaces['html'], 'h6'),
+    (namespaces['html'], 'hr'),
+    (namespaces['html'], 'i'),
+    (namespaces['html'], 'img'),
+    (namespaces['html'], 'input'),
+    (namespaces['html'], 'ins'),
+    (namespaces['html'], 'keygen'),
+    (namespaces['html'], 'kbd'),
+    (namespaces['html'], 'label'),
+    (namespaces['html'], 'legend'),
+    (namespaces['html'], 'li'),
+    (namespaces['html'], 'm'),
+    (namespaces['html'], 'map'),
+    (namespaces['html'], 'menu'),
+    (namespaces['html'], 'meter'),
+    (namespaces['html'], 'multicol'),
+    (namespaces['html'], 'nav'),
+    (namespaces['html'], 'nextid'),
+    (namespaces['html'], 'ol'),
+    (namespaces['html'], 'output'),
+    (namespaces['html'], 'optgroup'),
+    (namespaces['html'], 'option'),
+    (namespaces['html'], 'p'),
+    (namespaces['html'], 'pre'),
+    (namespaces['html'], 'progress'),
+    (namespaces['html'], 'q'),
+    (namespaces['html'], 's'),
+    (namespaces['html'], 'samp'),
+    (namespaces['html'], 'section'),
+    (namespaces['html'], 'select'),
+    (namespaces['html'], 'small'),
+    (namespaces['html'], 'sound'),
+    (namespaces['html'], 'source'),
+    (namespaces['html'], 'spacer'),
+    (namespaces['html'], 'span'),
+    (namespaces['html'], 'strike'),
+    (namespaces['html'], 'strong'),
+    (namespaces['html'], 'sub'),
+    (namespaces['html'], 'sup'),
+    (namespaces['html'], 'table'),
+    (namespaces['html'], 'tbody'),
+    (namespaces['html'], 'td'),
+    (namespaces['html'], 'textarea'),
+    (namespaces['html'], 'time'),
+    (namespaces['html'], 'tfoot'),
+    (namespaces['html'], 'th'),
+    (namespaces['html'], 'thead'),
+    (namespaces['html'], 'tr'),
+    (namespaces['html'], 'tt'),
+    (namespaces['html'], 'u'),
+    (namespaces['html'], 'ul'),
+    (namespaces['html'], 'var'),
+    (namespaces['html'], 'video'),
+    (namespaces['mathml'], 'maction'),
+    (namespaces['mathml'], 'math'),
+    (namespaces['mathml'], 'merror'),
+    (namespaces['mathml'], 'mfrac'),
+    (namespaces['mathml'], 'mi'),
+    (namespaces['mathml'], 'mmultiscripts'),
+    (namespaces['mathml'], 'mn'),
+    (namespaces['mathml'], 'mo'),
+    (namespaces['mathml'], 'mover'),
+    (namespaces['mathml'], 'mpadded'),
+    (namespaces['mathml'], 'mphantom'),
+    (namespaces['mathml'], 'mprescripts'),
+    (namespaces['mathml'], 'mroot'),
+    (namespaces['mathml'], 'mrow'),
+    (namespaces['mathml'], 'mspace'),
+    (namespaces['mathml'], 'msqrt'),
+    (namespaces['mathml'], 'mstyle'),
+    (namespaces['mathml'], 'msub'),
+    (namespaces['mathml'], 'msubsup'),
+    (namespaces['mathml'], 'msup'),
+    (namespaces['mathml'], 'mtable'),
+    (namespaces['mathml'], 'mtd'),
+    (namespaces['mathml'], 'mtext'),
+    (namespaces['mathml'], 'mtr'),
+    (namespaces['mathml'], 'munder'),
+    (namespaces['mathml'], 'munderover'),
+    (namespaces['mathml'], 'none'),
+    (namespaces['svg'], 'a'),
+    (namespaces['svg'], 'animate'),
+    (namespaces['svg'], 'animateColor'),
+    (namespaces['svg'], 'animateMotion'),
+    (namespaces['svg'], 'animateTransform'),
+    (namespaces['svg'], 'clipPath'),
+    (namespaces['svg'], 'circle'),
+    (namespaces['svg'], 'defs'),
+    (namespaces['svg'], 'desc'),
+    (namespaces['svg'], 'ellipse'),
+    (namespaces['svg'], 'font-face'),
+    (namespaces['svg'], 'font-face-name'),
+    (namespaces['svg'], 'font-face-src'),
+    (namespaces['svg'], 'g'),
+    (namespaces['svg'], 'glyph'),
+    (namespaces['svg'], 'hkern'),
+    (namespaces['svg'], 'linearGradient'),
+    (namespaces['svg'], 'line'),
+    (namespaces['svg'], 'marker'),
+    (namespaces['svg'], 'metadata'),
+    (namespaces['svg'], 'missing-glyph'),
+    (namespaces['svg'], 'mpath'),
+    (namespaces['svg'], 'path'),
+    (namespaces['svg'], 'polygon'),
+    (namespaces['svg'], 'polyline'),
+    (namespaces['svg'], 'radialGradient'),
+    (namespaces['svg'], 'rect'),
+    (namespaces['svg'], 'set'),
+    (namespaces['svg'], 'stop'),
+    (namespaces['svg'], 'svg'),
+    (namespaces['svg'], 'switch'),
+    (namespaces['svg'], 'text'),
+    (namespaces['svg'], 'title'),
+    (namespaces['svg'], 'tspan'),
+    (namespaces['svg'], 'use'),
+))
+
+allowed_attributes = frozenset((
+    # HTML attributes
+    (None, 'abbr'),
+    (None, 'accept'),
+    (None, 'accept-charset'),
+    (None, 'accesskey'),
+    (None, 'action'),
+    (None, 'align'),
+    (None, 'alt'),
+    (None, 'autocomplete'),
+    (None, 'autofocus'),
+    (None, 'axis'),
+    (None, 'background'),
+    (None, 'balance'),
+    (None, 'bgcolor'),
+    (None, 'bgproperties'),
+    (None, 'border'),
+    (None, 'bordercolor'),
+    (None, 'bordercolordark'),
+    (None, 'bordercolorlight'),
+    (None, 'bottompadding'),
+    (None, 'cellpadding'),
+    (None, 'cellspacing'),
+    (None, 'ch'),
+    (None, 'challenge'),
+    (None, 'char'),
+    (None, 'charoff'),
+    (None, 'choff'),
+    (None, 'charset'),
+    (None, 'checked'),
+    (None, 'cite'),
+    (None, 'class'),
+    (None, 'clear'),
+    (None, 'color'),
+    (None, 'cols'),
+    (None, 'colspan'),
+    (None, 'compact'),
+    (None, 'contenteditable'),
+    (None, 'controls'),
+    (None, 'coords'),
+    (None, 'data'),
+    (None, 'datafld'),
+    (None, 'datapagesize'),
+    (None, 'datasrc'),
+    (None, 'datetime'),
+    (None, 'default'),
+    (None, 'delay'),
+    (None, 'dir'),
+    (None, 'disabled'),
+    (None, 'draggable'),
+    (None, 'dynsrc'),
+    (None, 'enctype'),
+    (None, 'end'),
+    (None, 'face'),
+    (None, 'for'),
+    (None, 'form'),
+    (None, 'frame'),
+    (None, 'galleryimg'),
+    (None, 'gutter'),
+    (None, 'headers'),
+    (None, 'height'),
+    (None, 'hidefocus'),
+    (None, 'hidden'),
+    (None, 'high'),
+    (None, 'href'),
+    (None, 'hreflang'),
+    (None, 'hspace'),
+    (None, 'icon'),
+    (None, 'id'),
+    (None, 'inputmode'),
+    (None, 'ismap'),
+    (None, 'keytype'),
+    (None, 'label'),
+    (None, 'leftspacing'),
+    (None, 'lang'),
+    (None, 'list'),
+    (None, 'longdesc'),
+    (None, 'loop'),
+    (None, 'loopcount'),
+    (None, 'loopend'),
+    (None, 'loopstart'),
+    (None, 'low'),
+    (None, 'lowsrc'),
+    (None, 'max'),
+    (None, 'maxlength'),
+    (None, 'media'),
+    (None, 'method'),
+    (None, 'min'),
+    (None, 'multiple'),
+    (None, 'name'),
+    (None, 'nohref'),
+    (None, 'noshade'),
+    (None, 'nowrap'),
+    (None, 'open'),
+    (None, 'optimum'),
+    (None, 'pattern'),
+    (None, 'ping'),
+    (None, 'point-size'),
+    (None, 'poster'),
+    (None, 'pqg'),
+    (None, 'preload'),
+    (None, 'prompt'),
+    (None, 'radiogroup'),
+    (None, 'readonly'),
+    (None, 'rel'),
+    (None, 'repeat-max'),
+    (None, 'repeat-min'),
+    (None, 'replace'),
+    (None, 'required'),
+    (None, 'rev'),
+    (None, 'rightspacing'),
+    (None, 'rows'),
+    (None, 'rowspan'),
+    (None, 'rules'),
+    (None, 'scope'),
+    (None, 'selected'),
+    (None, 'shape'),
+    (None, 'size'),
+    (None, 'span'),
+    (None, 'src'),
+    (None, 'start'),
+    (None, 'step'),
+    (None, 'style'),
+    (None, 'summary'),
+    (None, 'suppress'),
+    (None, 'tabindex'),
+    (None, 'target'),
+    (None, 'template'),
+    (None, 'title'),
+    (None, 'toppadding'),
+    (None, 'type'),
+    (None, 'unselectable'),
+    (None, 'usemap'),
+    (None, 'urn'),
+    (None, 'valign'),
+    (None, 'value'),
+    (None, 'variable'),
+    (None, 'volume'),
+    (None, 'vspace'),
+    (None, 'vrml'),
+    (None, 'width'),
+    (None, 'wrap'),
+    (namespaces['xml'], 'lang'),
+    # MathML attributes
+    (None, 'actiontype'),
+    (None, 'align'),
+    (None, 'columnalign'),
+    (None, 'columnalign'),
+    (None, 'columnalign'),
+    (None, 'columnlines'),
+    (None, 'columnspacing'),
+    (None, 'columnspan'),
+    (None, 'depth'),
+    (None, 'display'),
+    (None, 'displaystyle'),
+    (None, 'equalcolumns'),
+    (None, 'equalrows'),
+    (None, 'fence'),
+    (None, 'fontstyle'),
+    (None, 'fontweight'),
+    (None, 'frame'),
+    (None, 'height'),
+    (None, 'linethickness'),
+    (None, 'lspace'),
+    (None, 'mathbackground'),
+    (None, 'mathcolor'),
+    (None, 'mathvariant'),
+    (None, 'mathvariant'),
+    (None, 'maxsize'),
+    (None, 'minsize'),
+    (None, 'other'),
+    (None, 'rowalign'),
+    (None, 'rowalign'),
+    (None, 'rowalign'),
+    (None, 'rowlines'),
+    (None, 'rowspacing'),
+    (None, 'rowspan'),
+    (None, 'rspace'),
+    (None, 'scriptlevel'),
+    (None, 'selection'),
+    (None, 'separator'),
+    (None, 'stretchy'),
+    (None, 'width'),
+    (None, 'width'),
+    (namespaces['xlink'], 'href'),
+    (namespaces['xlink'], 'show'),
+    (namespaces['xlink'], 'type'),
+    # SVG attributes
+    (None, 'accent-height'),
+    (None, 'accumulate'),
+    (None, 'additive'),
+    (None, 'alphabetic'),
+    (None, 'arabic-form'),
+    (None, 'ascent'),
+    (None, 'attributeName'),
+    (None, 'attributeType'),
+    (None, 'baseProfile'),
+    (None, 'bbox'),
+    (None, 'begin'),
+    (None, 'by'),
+    (None, 'calcMode'),
+    (None, 'cap-height'),
+    (None, 'class'),
+    (None, 'clip-path'),
+    (None, 'color'),
+    (None, 'color-rendering'),
+    (None, 'content'),
+    (None, 'cx'),
+    (None, 'cy'),
+    (None, 'd'),
+    (None, 'dx'),
+    (None, 'dy'),
+    (None, 'descent'),
+    (None, 'display'),
+    (None, 'dur'),
+    (None, 'end'),
+    (None, 'fill'),
+    (None, 'fill-opacity'),
+    (None, 'fill-rule'),
+    (None, 'font-family'),
+    (None, 'font-size'),
+    (None, 'font-stretch'),
+    (None, 'font-style'),
+    (None, 'font-variant'),
+    (None, 'font-weight'),
+    (None, 'from'),
+    (None, 'fx'),
+    (None, 'fy'),
+    (None, 'g1'),
+    (None, 'g2'),
+    (None, 'glyph-name'),
+    (None, 'gradientUnits'),
+    (None, 'hanging'),
+    (None, 'height'),
+    (None, 'horiz-adv-x'),
+    (None, 'horiz-origin-x'),
+    (None, 'id'),
+    (None, 'ideographic'),
+    (None, 'k'),
+    (None, 'keyPoints'),
+    (None, 'keySplines'),
+    (None, 'keyTimes'),
+    (None, 'lang'),
+    (None, 'marker-end'),
+    (None, 'marker-mid'),
+    (None, 'marker-start'),
+    (None, 'markerHeight'),
+    (None, 'markerUnits'),
+    (None, 'markerWidth'),
+    (None, 'mathematical'),
+    (None, 'max'),
+    (None, 'min'),
+    (None, 'name'),
+    (None, 'offset'),
+    (None, 'opacity'),
+    (None, 'orient'),
+    (None, 'origin'),
+    (None, 'overline-position'),
+    (None, 'overline-thickness'),
+    (None, 'panose-1'),
+    (None, 'path'),
+    (None, 'pathLength'),
+    (None, 'points'),
+    (None, 'preserveAspectRatio'),
+    (None, 'r'),
+    (None, 'refX'),
+    (None, 'refY'),
+    (None, 'repeatCount'),
+    (None, 'repeatDur'),
+    (None, 'requiredExtensions'),
+    (None, 'requiredFeatures'),
+    (None, 'restart'),
+    (None, 'rotate'),
+    (None, 'rx'),
+    (None, 'ry'),
+    (None, 'slope'),
+    (None, 'stemh'),
+    (None, 'stemv'),
+    (None, 'stop-color'),
+    (None, 'stop-opacity'),
+    (None, 'strikethrough-position'),
+    (None, 'strikethrough-thickness'),
+    (None, 'stroke'),
+    (None, 'stroke-dasharray'),
+    (None, 'stroke-dashoffset'),
+    (None, 'stroke-linecap'),
+    (None, 'stroke-linejoin'),
+    (None, 'stroke-miterlimit'),
+    (None, 'stroke-opacity'),
+    (None, 'stroke-width'),
+    (None, 'systemLanguage'),
+    (None, 'target'),
+    (None, 'text-anchor'),
+    (None, 'to'),
+    (None, 'transform'),
+    (None, 'type'),
+    (None, 'u1'),
+    (None, 'u2'),
+    (None, 'underline-position'),
+    (None, 'underline-thickness'),
+    (None, 'unicode'),
+    (None, 'unicode-range'),
+    (None, 'units-per-em'),
+    (None, 'values'),
+    (None, 'version'),
+    (None, 'viewBox'),
+    (None, 'visibility'),
+    (None, 'width'),
+    (None, 'widths'),
+    (None, 'x'),
+    (None, 'x-height'),
+    (None, 'x1'),
+    (None, 'x2'),
+    (namespaces['xlink'], 'actuate'),
+    (namespaces['xlink'], 'arcrole'),
+    (namespaces['xlink'], 'href'),
+    (namespaces['xlink'], 'role'),
+    (namespaces['xlink'], 'show'),
+    (namespaces['xlink'], 'title'),
+    (namespaces['xlink'], 'type'),
+    (namespaces['xml'], 'base'),
+    (namespaces['xml'], 'lang'),
+    (namespaces['xml'], 'space'),
+    (None, 'y'),
+    (None, 'y1'),
+    (None, 'y2'),
+    (None, 'zoomAndPan'),
+))
+
+attr_val_is_uri = frozenset((
+    (None, 'href'),
+    (None, 'src'),
+    (None, 'cite'),
+    (None, 'action'),
+    (None, 'longdesc'),
+    (None, 'poster'),
+    (None, 'background'),
+    (None, 'datasrc'),
+    (None, 'dynsrc'),
+    (None, 'lowsrc'),
+    (None, 'ping'),
+    (namespaces['xlink'], 'href'),
+    (namespaces['xml'], 'base'),
+))
+
+svg_attr_val_allows_ref = frozenset((
+    (None, 'clip-path'),
+    (None, 'color-profile'),
+    (None, 'cursor'),
+    (None, 'fill'),
+    (None, 'filter'),
+    (None, 'marker'),
+    (None, 'marker-start'),
+    (None, 'marker-mid'),
+    (None, 'marker-end'),
+    (None, 'mask'),
+    (None, 'stroke'),
+))
+
+svg_allow_local_href = frozenset((
+    (None, 'altGlyph'),
+    (None, 'animate'),
+    (None, 'animateColor'),
+    (None, 'animateMotion'),
+    (None, 'animateTransform'),
+    (None, 'cursor'),
+    (None, 'feImage'),
+    (None, 'filter'),
+    (None, 'linearGradient'),
+    (None, 'pattern'),
+    (None, 'radialGradient'),
+    (None, 'textpath'),
+    (None, 'tref'),
+    (None, 'set'),
+    (None, 'use')
+))
+
+allowed_css_properties = frozenset((
+    'azimuth',
+    'background-color',
+    'border-bottom-color',
+    'border-collapse',
+    'border-color',
+    'border-left-color',
+    'border-right-color',
+    'border-top-color',
+    'clear',
+    'color',
+    'cursor',
+    'direction',
+    'display',
+    'elevation',
+    'float',
+    'font',
+    'font-family',
+    'font-size',
+    'font-style',
+    'font-variant',
+    'font-weight',
+    'height',
+    'letter-spacing',
+    'line-height',
+    'overflow',
+    'pause',
+    'pause-after',
+    'pause-before',
+    'pitch',
+    'pitch-range',
+    'richness',
+    'speak',
+    'speak-header',
+    'speak-numeral',
+    'speak-punctuation',
+    'speech-rate',
+    'stress',
+    'text-align',
+    'text-decoration',
+    'text-indent',
+    'unicode-bidi',
+    'vertical-align',
+    'voice-family',
+    'volume',
+    'white-space',
+    'width',
+))
+
+allowed_css_keywords = frozenset((
+    'auto',
+    'aqua',
+    'black',
+    'block',
+    'blue',
+    'bold',
+    'both',
+    'bottom',
+    'brown',
+    'center',
+    'collapse',
+    'dashed',
+    'dotted',
+    'fuchsia',
+    'gray',
+    'green',
+    '!important',
+    'italic',
+    'left',
+    'lime',
+    'maroon',
+    'medium',
+    'none',
+    'navy',
+    'normal',
+    'nowrap',
+    'olive',
+    'pointer',
+    'purple',
+    'red',
+    'right',
+    'solid',
+    'silver',
+    'teal',
+    'top',
+    'transparent',
+    'underline',
+    'white',
+    'yellow',
+))
+
+allowed_svg_properties = frozenset((
+    'fill',
+    'fill-opacity',
+    'fill-rule',
+    'stroke',
+    'stroke-width',
+    'stroke-linecap',
+    'stroke-linejoin',
+    'stroke-opacity',
+))
+
+allowed_protocols = frozenset((
+    'ed2k',
+    'ftp',
+    'http',
+    'https',
+    'irc',
+    'mailto',
+    'news',
+    'gopher',
+    'nntp',
+    'telnet',
+    'webcal',
+    'xmpp',
+    'callto',
+    'feed',
+    'urn',
+    'aim',
+    'rsync',
+    'tag',
+    'ssh',
+    'sftp',
+    'rtsp',
+    'afs',
+    'data',
+))
+
+allowed_content_types = frozenset((
+    'image/png',
+    'image/jpeg',
+    'image/gif',
+    'image/webp',
+    'image/bmp',
+    'text/plain',
+))
+
+
+data_content_type = re.compile(r'''
+                                ^
+                                # Match a content type <application>/<type>
+                                (?P<content_type>[-a-zA-Z0-9.]+/[-a-zA-Z0-9.]+)
+                                # Match any character set and encoding
+                                (?:(?:;charset=(?:[-a-zA-Z0-9]+)(?:;(?:base64))?)
+                                  |(?:;(?:base64))?(?:;charset=(?:[-a-zA-Z0-9]+))?)
+                                # Assume the rest is data
+                                ,.*
+                                $
+                                ''',
+                               re.VERBOSE)
+
+
+class Filter(base.Filter):
+    """Sanitizes token stream of XHTML+MathML+SVG and of inline style attributes"""
+    def __init__(self,
+                 source,
+                 allowed_elements=allowed_elements,
+                 allowed_attributes=allowed_attributes,
+                 allowed_css_properties=allowed_css_properties,
+                 allowed_css_keywords=allowed_css_keywords,
+                 allowed_svg_properties=allowed_svg_properties,
+                 allowed_protocols=allowed_protocols,
+                 allowed_content_types=allowed_content_types,
+                 attr_val_is_uri=attr_val_is_uri,
+                 svg_attr_val_allows_ref=svg_attr_val_allows_ref,
+                 svg_allow_local_href=svg_allow_local_href):
+        """Creates a Filter
+
+        :arg allowed_elements: set of elements to allow--everything else will
+            be escaped
+
+        :arg allowed_attributes: set of attributes to allow in
+            elements--everything else will be stripped
+
+        :arg allowed_css_properties: set of CSS properties to allow--everything
+            else will be stripped
+
+        :arg allowed_css_keywords: set of CSS keywords to allow--everything
+            else will be stripped
+
+        :arg allowed_svg_properties: set of SVG properties to allow--everything
+            else will be removed
+
+        :arg allowed_protocols: set of allowed protocols for URIs
+
+        :arg allowed_content_types: set of allowed content types for ``data`` URIs.
+
+        :arg attr_val_is_uri: set of attributes that have URI values--values
+            that have a scheme not listed in ``allowed_protocols`` are removed
+
+        :arg svg_attr_val_allows_ref: set of SVG attributes that can have
+            references
+
+        :arg svg_allow_local_href: set of SVG elements that can have local
+            hrefs--these are removed
+
+        """
+        super(Filter, self).__init__(source)
+
+        warnings.warn(_deprecation_msg, DeprecationWarning)
+
+        self.allowed_elements = allowed_elements
+        self.allowed_attributes = allowed_attributes
+        self.allowed_css_properties = allowed_css_properties
+        self.allowed_css_keywords = allowed_css_keywords
+        self.allowed_svg_properties = allowed_svg_properties
+        self.allowed_protocols = allowed_protocols
+        self.allowed_content_types = allowed_content_types
+        self.attr_val_is_uri = attr_val_is_uri
+        self.svg_attr_val_allows_ref = svg_attr_val_allows_ref
+        self.svg_allow_local_href = svg_allow_local_href
+
+    def __iter__(self):
+        for token in base.Filter.__iter__(self):
+            token = self.sanitize_token(token)
+            if token:
+                yield token
+
+    # Sanitize the +html+, escaping all elements not in ALLOWED_ELEMENTS, and
+    # stripping out all attributes not in ALLOWED_ATTRIBUTES. Style attributes
+    # are parsed, and a restricted set, specified by ALLOWED_CSS_PROPERTIES and
+    # ALLOWED_CSS_KEYWORDS, are allowed through. attributes in ATTR_VAL_IS_URI
+    # are scanned, and only URI schemes specified in ALLOWED_PROTOCOLS are
+    # allowed.
+    #
+    #   sanitize_html('<script> do_nasty_stuff() </script>')
+    #    => &lt;script> do_nasty_stuff() &lt;/script>
+    #   sanitize_html('<a href="javascript: sucker();">Click here for $100</a>')
+    #    => <a>Click here for $100</a>
+    def sanitize_token(self, token):
+
+        # accommodate filters which use token_type differently
+        token_type = token["type"]
+        if token_type in ("StartTag", "EndTag", "EmptyTag"):
+            name = token["name"]
+            namespace = token["namespace"]
+            if ((namespace, name) in self.allowed_elements or
+                (namespace is None and
+                 (namespaces["html"], name) in self.allowed_elements)):
+                return self.allowed_token(token)
+            else:
+                return self.disallowed_token(token)
+        elif token_type == "Comment":
+            pass
+        else:
+            return token
+
+    def allowed_token(self, token):
+        if "data" in token:
+            attrs = token["data"]
+            attr_names = set(attrs.keys())
+
+            # Remove forbidden attributes
+            for to_remove in (attr_names - self.allowed_attributes):
+                del token["data"][to_remove]
+                attr_names.remove(to_remove)
+
+            # Remove attributes with disallowed URL values
+            for attr in (attr_names & self.attr_val_is_uri):
+                assert attr in attrs
+                # I don't have a clue where this regexp comes from or why it matches those
+                # characters, nor why we call unescape. I just know it's always been here.
+                # Should you be worried by this comment in a sanitizer? Yes. On the other hand, all
+                # this will do is remove *more* than it otherwise would.
+                val_unescaped = re.sub("[`\x00-\x20\x7f-\xa0\\s]+", '',
+                                       unescape(attrs[attr])).lower()
+                # remove replacement characters from unescaped characters
+                val_unescaped = val_unescaped.replace("\ufffd", "")
+                try:
+                    uri = urlparse.urlparse(val_unescaped)
+                except ValueError:
+                    uri = None
+                    del attrs[attr]
+                if uri and uri.scheme:
+                    if uri.scheme not in self.allowed_protocols:
+                        del attrs[attr]
+                    if uri.scheme == 'data':
+                        m = data_content_type.match(uri.path)
+                        if not m:
+                            del attrs[attr]
+                        elif m.group('content_type') not in self.allowed_content_types:
+                            del attrs[attr]
+
+            for attr in self.svg_attr_val_allows_ref:
+                if attr in attrs:
+                    attrs[attr] = re.sub(r'url\s*\(\s*[^#\s][^)]+?\)',
+                                         ' ',
+                                         unescape(attrs[attr]))
+            if (token["name"] in self.svg_allow_local_href and
+                (namespaces['xlink'], 'href') in attrs and re.search(r'^\s*[^#\s].*',
+                                                                     attrs[(namespaces['xlink'], 'href')])):
+                del attrs[(namespaces['xlink'], 'href')]
+            if (None, 'style') in attrs:
+                attrs[(None, 'style')] = self.sanitize_css(attrs[(None, 'style')])
+            token["data"] = attrs
+        return token
+
+    def disallowed_token(self, token):
+        token_type = token["type"]
+        if token_type == "EndTag":
+            token["data"] = "</%s>" % token["name"]
+        elif token["data"]:
+            assert token_type in ("StartTag", "EmptyTag")
+            attrs = []
+            for (ns, name), v in token["data"].items():
+                attrs.append(' %s="%s"' % (name if ns is None else "%s:%s" % (prefixes[ns], name), escape(v)))
+            token["data"] = "<%s%s>" % (token["name"], ''.join(attrs))
+        else:
+            token["data"] = "<%s>" % token["name"]
+        if token.get("selfClosing"):
+            token["data"] = token["data"][:-1] + "/>"
+
+        token["type"] = "Characters"
+
+        del token["name"]
+        return token
+
+    def sanitize_css(self, style):
+        # disallow urls
+        style = re.compile(r'url\s*\(\s*[^\s)]+?\s*\)\s*').sub(' ', style)
+
+        # gauntlet
+        if not re.match(r"""^([:,;#%.\sa-zA-Z0-9!]|\w-\w|'[\s\w]+'|"[\s\w]+"|\([\d,\s]+\))*$""", style):
+            return ''
+        if not re.match(r"^\s*([-\w]+\s*:[^:;]*(;\s*|$))*$", style):
+            return ''
+
+        clean = []
+        for prop, value in re.findall(r"([-\w]+)\s*:\s*([^:;]*)", style):
+            if not value:
+                continue
+            if prop.lower() in self.allowed_css_properties:
+                clean.append(prop + ': ' + value + ';')
+            elif prop.split('-')[0].lower() in ['background', 'border', 'margin',
+                                                'padding']:
+                for keyword in value.split():
+                    if keyword not in self.allowed_css_keywords and \
+                            not re.match(r"^(#[0-9a-fA-F]+|rgb\(\d+%?,\d*%?,?\d*%?\)?|\d{0,2}\.?\d{0,2}(cm|em|ex|in|mm|pc|pt|px|%|,|\))?)$", keyword):  # noqa
+                        break
+                else:
+                    clean.append(prop + ': ' + value + ';')
+            elif prop.lower() in self.allowed_svg_properties:
+                clean.append(prop + ': ' + value + ';')
+
+        return ' '.join(clean)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/filters/whitespace.py b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/whitespace.py
new file mode 100644
index 000000000..0d12584b4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/filters/whitespace.py
@@ -0,0 +1,38 @@
+from __future__ import absolute_import, division, unicode_literals
+
+import re
+
+from . import base
+from ..constants import rcdataElements, spaceCharacters
+spaceCharacters = "".join(spaceCharacters)
+
+SPACES_REGEX = re.compile("[%s]+" % spaceCharacters)
+
+
+class Filter(base.Filter):
+    """Collapses whitespace except in pre, textarea, and script elements"""
+    spacePreserveElements = frozenset(["pre", "textarea"] + list(rcdataElements))
+
+    def __iter__(self):
+        preserve = 0
+        for token in base.Filter.__iter__(self):
+            type = token["type"]
+            if type == "StartTag" \
+                    and (preserve or token["name"] in self.spacePreserveElements):
+                preserve += 1
+
+            elif type == "EndTag" and preserve:
+                preserve -= 1
+
+            elif not preserve and type == "SpaceCharacters" and token["data"]:
+                # Test on token["data"] above to not introduce spaces where there were not
+                token["data"] = " "
+
+            elif not preserve and type == "Characters":
+                token["data"] = collapse_spaces(token["data"])
+
+            yield token
+
+
+def collapse_spaces(text):
+    return SPACES_REGEX.sub(' ', text)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/html5parser.py b/venv/Lib/site-packages/pip/_vendor/html5lib/html5parser.py
new file mode 100644
index 000000000..d06784f3d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/html5parser.py
@@ -0,0 +1,2795 @@
+from __future__ import absolute_import, division, unicode_literals
+from pip._vendor.six import with_metaclass, viewkeys
+
+import types
+
+from . import _inputstream
+from . import _tokenizer
+
+from . import treebuilders
+from .treebuilders.base import Marker
+
+from . import _utils
+from .constants import (
+    spaceCharacters, asciiUpper2Lower,
+    specialElements, headingElements, cdataElements, rcdataElements,
+    tokenTypes, tagTokenTypes,
+    namespaces,
+    htmlIntegrationPointElements, mathmlTextIntegrationPointElements,
+    adjustForeignAttributes as adjustForeignAttributesMap,
+    adjustMathMLAttributes, adjustSVGAttributes,
+    E,
+    _ReparseException
+)
+
+
+def parse(doc, treebuilder="etree", namespaceHTMLElements=True, **kwargs):
+    """Parse an HTML document as a string or file-like object into a tree
+
+    :arg doc: the document to parse as a string or file-like object
+
+    :arg treebuilder: the treebuilder to use when parsing
+
+    :arg namespaceHTMLElements: whether or not to namespace HTML elements
+
+    :returns: parsed tree
+
+    Example:
+
+    >>> from html5lib.html5parser import parse
+    >>> parse('<html><body><p>This is a doc</p></body></html>')
+    <Element u'{http://www.w3.org/1999/xhtml}html' at 0x7feac4909db0>
+
+    """
+    tb = treebuilders.getTreeBuilder(treebuilder)
+    p = HTMLParser(tb, namespaceHTMLElements=namespaceHTMLElements)
+    return p.parse(doc, **kwargs)
+
+
+def parseFragment(doc, container="div", treebuilder="etree", namespaceHTMLElements=True, **kwargs):
+    """Parse an HTML fragment as a string or file-like object into a tree
+
+    :arg doc: the fragment to parse as a string or file-like object
+
+    :arg container: the container context to parse the fragment in
+
+    :arg treebuilder: the treebuilder to use when parsing
+
+    :arg namespaceHTMLElements: whether or not to namespace HTML elements
+
+    :returns: parsed tree
+
+    Example:
+
+    >>> from html5lib.html5libparser import parseFragment
+    >>> parseFragment('<b>this is a fragment</b>')
+    <Element u'DOCUMENT_FRAGMENT' at 0x7feac484b090>
+
+    """
+    tb = treebuilders.getTreeBuilder(treebuilder)
+    p = HTMLParser(tb, namespaceHTMLElements=namespaceHTMLElements)
+    return p.parseFragment(doc, container=container, **kwargs)
+
+
+def method_decorator_metaclass(function):
+    class Decorated(type):
+        def __new__(meta, classname, bases, classDict):
+            for attributeName, attribute in classDict.items():
+                if isinstance(attribute, types.FunctionType):
+                    attribute = function(attribute)
+
+                classDict[attributeName] = attribute
+            return type.__new__(meta, classname, bases, classDict)
+    return Decorated
+
+
+class HTMLParser(object):
+    """HTML parser
+
+    Generates a tree structure from a stream of (possibly malformed) HTML.
+
+    """
+
+    def __init__(self, tree=None, strict=False, namespaceHTMLElements=True, debug=False):
+        """
+        :arg tree: a treebuilder class controlling the type of tree that will be
+            returned. Built in treebuilders can be accessed through
+            html5lib.treebuilders.getTreeBuilder(treeType)
+
+        :arg strict: raise an exception when a parse error is encountered
+
+        :arg namespaceHTMLElements: whether or not to namespace HTML elements
+
+        :arg debug: whether or not to enable debug mode which logs things
+
+        Example:
+
+        >>> from html5lib.html5parser import HTMLParser
+        >>> parser = HTMLParser()                     # generates parser with etree builder
+        >>> parser = HTMLParser('lxml', strict=True)  # generates parser with lxml builder which is strict
+
+        """
+
+        # Raise an exception on the first error encountered
+        self.strict = strict
+
+        if tree is None:
+            tree = treebuilders.getTreeBuilder("etree")
+        self.tree = tree(namespaceHTMLElements)
+        self.errors = []
+
+        self.phases = {name: cls(self, self.tree) for name, cls in
+                       getPhases(debug).items()}
+
+    def _parse(self, stream, innerHTML=False, container="div", scripting=False, **kwargs):
+
+        self.innerHTMLMode = innerHTML
+        self.container = container
+        self.scripting = scripting
+        self.tokenizer = _tokenizer.HTMLTokenizer(stream, parser=self, **kwargs)
+        self.reset()
+
+        try:
+            self.mainLoop()
+        except _ReparseException:
+            self.reset()
+            self.mainLoop()
+
+    def reset(self):
+        self.tree.reset()
+        self.firstStartTag = False
+        self.errors = []
+        self.log = []  # only used with debug mode
+        # "quirks" / "limited quirks" / "no quirks"
+        self.compatMode = "no quirks"
+
+        if self.innerHTMLMode:
+            self.innerHTML = self.container.lower()
+
+            if self.innerHTML in cdataElements:
+                self.tokenizer.state = self.tokenizer.rcdataState
+            elif self.innerHTML in rcdataElements:
+                self.tokenizer.state = self.tokenizer.rawtextState
+            elif self.innerHTML == 'plaintext':
+                self.tokenizer.state = self.tokenizer.plaintextState
+            else:
+                # state already is data state
+                # self.tokenizer.state = self.tokenizer.dataState
+                pass
+            self.phase = self.phases["beforeHtml"]
+            self.phase.insertHtmlElement()
+            self.resetInsertionMode()
+        else:
+            self.innerHTML = False  # pylint:disable=redefined-variable-type
+            self.phase = self.phases["initial"]
+
+        self.lastPhase = None
+
+        self.beforeRCDataPhase = None
+
+        self.framesetOK = True
+
+    @property
+    def documentEncoding(self):
+        """Name of the character encoding that was used to decode the input stream, or
+        :obj:`None` if that is not determined yet
+
+        """
+        if not hasattr(self, 'tokenizer'):
+            return None
+        return self.tokenizer.stream.charEncoding[0].name
+
+    def isHTMLIntegrationPoint(self, element):
+        if (element.name == "annotation-xml" and
+                element.namespace == namespaces["mathml"]):
+            return ("encoding" in element.attributes and
+                    element.attributes["encoding"].translate(
+                        asciiUpper2Lower) in
+                    ("text/html", "application/xhtml+xml"))
+        else:
+            return (element.namespace, element.name) in htmlIntegrationPointElements
+
+    def isMathMLTextIntegrationPoint(self, element):
+        return (element.namespace, element.name) in mathmlTextIntegrationPointElements
+
+    def mainLoop(self):
+        CharactersToken = tokenTypes["Characters"]
+        SpaceCharactersToken = tokenTypes["SpaceCharacters"]
+        StartTagToken = tokenTypes["StartTag"]
+        EndTagToken = tokenTypes["EndTag"]
+        CommentToken = tokenTypes["Comment"]
+        DoctypeToken = tokenTypes["Doctype"]
+        ParseErrorToken = tokenTypes["ParseError"]
+
+        for token in self.tokenizer:
+            prev_token = None
+            new_token = token
+            while new_token is not None:
+                prev_token = new_token
+                currentNode = self.tree.openElements[-1] if self.tree.openElements else None
+                currentNodeNamespace = currentNode.namespace if currentNode else None
+                currentNodeName = currentNode.name if currentNode else None
+
+                type = new_token["type"]
+
+                if type == ParseErrorToken:
+                    self.parseError(new_token["data"], new_token.get("datavars", {}))
+                    new_token = None
+                else:
+                    if (len(self.tree.openElements) == 0 or
+                        currentNodeNamespace == self.tree.defaultNamespace or
+                        (self.isMathMLTextIntegrationPoint(currentNode) and
+                         ((type == StartTagToken and
+                           token["name"] not in frozenset(["mglyph", "malignmark"])) or
+                          type in (CharactersToken, SpaceCharactersToken))) or
+                        (currentNodeNamespace == namespaces["mathml"] and
+                         currentNodeName == "annotation-xml" and
+                         type == StartTagToken and
+                         token["name"] == "svg") or
+                        (self.isHTMLIntegrationPoint(currentNode) and
+                         type in (StartTagToken, CharactersToken, SpaceCharactersToken))):
+                        phase = self.phase
+                    else:
+                        phase = self.phases["inForeignContent"]
+
+                    if type == CharactersToken:
+                        new_token = phase.processCharacters(new_token)
+                    elif type == SpaceCharactersToken:
+                        new_token = phase.processSpaceCharacters(new_token)
+                    elif type == StartTagToken:
+                        new_token = phase.processStartTag(new_token)
+                    elif type == EndTagToken:
+                        new_token = phase.processEndTag(new_token)
+                    elif type == CommentToken:
+                        new_token = phase.processComment(new_token)
+                    elif type == DoctypeToken:
+                        new_token = phase.processDoctype(new_token)
+
+            if (type == StartTagToken and prev_token["selfClosing"] and
+                    not prev_token["selfClosingAcknowledged"]):
+                self.parseError("non-void-element-with-trailing-solidus",
+                                {"name": prev_token["name"]})
+
+        # When the loop finishes it's EOF
+        reprocess = True
+        phases = []
+        while reprocess:
+            phases.append(self.phase)
+            reprocess = self.phase.processEOF()
+            if reprocess:
+                assert self.phase not in phases
+
+    def parse(self, stream, *args, **kwargs):
+        """Parse a HTML document into a well-formed tree
+
+        :arg stream: a file-like object or string containing the HTML to be parsed
+
+            The optional encoding parameter must be a string that indicates
+            the encoding.  If specified, that encoding will be used,
+            regardless of any BOM or later declaration (such as in a meta
+            element).
+
+        :arg scripting: treat noscript elements as if JavaScript was turned on
+
+        :returns: parsed tree
+
+        Example:
+
+        >>> from html5lib.html5parser import HTMLParser
+        >>> parser = HTMLParser()
+        >>> parser.parse('<html><body><p>This is a doc</p></body></html>')
+        <Element u'{http://www.w3.org/1999/xhtml}html' at 0x7feac4909db0>
+
+        """
+        self._parse(stream, False, None, *args, **kwargs)
+        return self.tree.getDocument()
+
+    def parseFragment(self, stream, *args, **kwargs):
+        """Parse a HTML fragment into a well-formed tree fragment
+
+        :arg container: name of the element we're setting the innerHTML
+            property if set to None, default to 'div'
+
+        :arg stream: a file-like object or string containing the HTML to be parsed
+
+            The optional encoding parameter must be a string that indicates
+            the encoding.  If specified, that encoding will be used,
+            regardless of any BOM or later declaration (such as in a meta
+            element)
+
+        :arg scripting: treat noscript elements as if JavaScript was turned on
+
+        :returns: parsed tree
+
+        Example:
+
+        >>> from html5lib.html5libparser import HTMLParser
+        >>> parser = HTMLParser()
+        >>> parser.parseFragment('<b>this is a fragment</b>')
+        <Element u'DOCUMENT_FRAGMENT' at 0x7feac484b090>
+
+        """
+        self._parse(stream, True, *args, **kwargs)
+        return self.tree.getFragment()
+
+    def parseError(self, errorcode="XXX-undefined-error", datavars=None):
+        # XXX The idea is to make errorcode mandatory.
+        if datavars is None:
+            datavars = {}
+        self.errors.append((self.tokenizer.stream.position(), errorcode, datavars))
+        if self.strict:
+            raise ParseError(E[errorcode] % datavars)
+
+    def adjustMathMLAttributes(self, token):
+        adjust_attributes(token, adjustMathMLAttributes)
+
+    def adjustSVGAttributes(self, token):
+        adjust_attributes(token, adjustSVGAttributes)
+
+    def adjustForeignAttributes(self, token):
+        adjust_attributes(token, adjustForeignAttributesMap)
+
+    def reparseTokenNormal(self, token):
+        # pylint:disable=unused-argument
+        self.parser.phase()
+
+    def resetInsertionMode(self):
+        # The name of this method is mostly historical. (It's also used in the
+        # specification.)
+        last = False
+        newModes = {
+            "select": "inSelect",
+            "td": "inCell",
+            "th": "inCell",
+            "tr": "inRow",
+            "tbody": "inTableBody",
+            "thead": "inTableBody",
+            "tfoot": "inTableBody",
+            "caption": "inCaption",
+            "colgroup": "inColumnGroup",
+            "table": "inTable",
+            "head": "inBody",
+            "body": "inBody",
+            "frameset": "inFrameset",
+            "html": "beforeHead"
+        }
+        for node in self.tree.openElements[::-1]:
+            nodeName = node.name
+            new_phase = None
+            if node == self.tree.openElements[0]:
+                assert self.innerHTML
+                last = True
+                nodeName = self.innerHTML
+            # Check for conditions that should only happen in the innerHTML
+            # case
+            if nodeName in ("select", "colgroup", "head", "html"):
+                assert self.innerHTML
+
+            if not last and node.namespace != self.tree.defaultNamespace:
+                continue
+
+            if nodeName in newModes:
+                new_phase = self.phases[newModes[nodeName]]
+                break
+            elif last:
+                new_phase = self.phases["inBody"]
+                break
+
+        self.phase = new_phase
+
+    def parseRCDataRawtext(self, token, contentType):
+        # Generic RCDATA/RAWTEXT Parsing algorithm
+        assert contentType in ("RAWTEXT", "RCDATA")
+
+        self.tree.insertElement(token)
+
+        if contentType == "RAWTEXT":
+            self.tokenizer.state = self.tokenizer.rawtextState
+        else:
+            self.tokenizer.state = self.tokenizer.rcdataState
+
+        self.originalPhase = self.phase
+
+        self.phase = self.phases["text"]
+
+
+@_utils.memoize
+def getPhases(debug):
+    def log(function):
+        """Logger that records which phase processes each token"""
+        type_names = {value: key for key, value in tokenTypes.items()}
+
+        def wrapped(self, *args, **kwargs):
+            if function.__name__.startswith("process") and len(args) > 0:
+                token = args[0]
+                info = {"type": type_names[token['type']]}
+                if token['type'] in tagTokenTypes:
+                    info["name"] = token['name']
+
+                self.parser.log.append((self.parser.tokenizer.state.__name__,
+                                        self.parser.phase.__class__.__name__,
+                                        self.__class__.__name__,
+                                        function.__name__,
+                                        info))
+                return function(self, *args, **kwargs)
+            else:
+                return function(self, *args, **kwargs)
+        return wrapped
+
+    def getMetaclass(use_metaclass, metaclass_func):
+        if use_metaclass:
+            return method_decorator_metaclass(metaclass_func)
+        else:
+            return type
+
+    # pylint:disable=unused-argument
+    class Phase(with_metaclass(getMetaclass(debug, log))):
+        """Base class for helper object that implements each phase of processing
+        """
+        __slots__ = ("parser", "tree", "__startTagCache", "__endTagCache")
+
+        def __init__(self, parser, tree):
+            self.parser = parser
+            self.tree = tree
+            self.__startTagCache = {}
+            self.__endTagCache = {}
+
+        def processEOF(self):
+            raise NotImplementedError
+
+        def processComment(self, token):
+            # For most phases the following is correct. Where it's not it will be
+            # overridden.
+            self.tree.insertComment(token, self.tree.openElements[-1])
+
+        def processDoctype(self, token):
+            self.parser.parseError("unexpected-doctype")
+
+        def processCharacters(self, token):
+            self.tree.insertText(token["data"])
+
+        def processSpaceCharacters(self, token):
+            self.tree.insertText(token["data"])
+
+        def processStartTag(self, token):
+            # Note the caching is done here rather than BoundMethodDispatcher as doing it there
+            # requires a circular reference to the Phase, and this ends up with a significant
+            # (CPython 2.7, 3.8) GC cost when parsing many short inputs
+            name = token["name"]
+            # In Py2, using `in` is quicker in general than try/except KeyError
+            # In Py3, `in` is quicker when there are few cache hits (typically short inputs)
+            if name in self.__startTagCache:
+                func = self.__startTagCache[name]
+            else:
+                func = self.__startTagCache[name] = self.startTagHandler[name]
+                # bound the cache size in case we get loads of unknown tags
+                while len(self.__startTagCache) > len(self.startTagHandler) * 1.1:
+                    # this makes the eviction policy random on Py < 3.7 and FIFO >= 3.7
+                    self.__startTagCache.pop(next(iter(self.__startTagCache)))
+            return func(token)
+
+        def startTagHtml(self, token):
+            if not self.parser.firstStartTag and token["name"] == "html":
+                self.parser.parseError("non-html-root")
+            # XXX Need a check here to see if the first start tag token emitted is
+            # this token... If it's not, invoke self.parser.parseError().
+            for attr, value in token["data"].items():
+                if attr not in self.tree.openElements[0].attributes:
+                    self.tree.openElements[0].attributes[attr] = value
+            self.parser.firstStartTag = False
+
+        def processEndTag(self, token):
+            # Note the caching is done here rather than BoundMethodDispatcher as doing it there
+            # requires a circular reference to the Phase, and this ends up with a significant
+            # (CPython 2.7, 3.8) GC cost when parsing many short inputs
+            name = token["name"]
+            # In Py2, using `in` is quicker in general than try/except KeyError
+            # In Py3, `in` is quicker when there are few cache hits (typically short inputs)
+            if name in self.__endTagCache:
+                func = self.__endTagCache[name]
+            else:
+                func = self.__endTagCache[name] = self.endTagHandler[name]
+                # bound the cache size in case we get loads of unknown tags
+                while len(self.__endTagCache) > len(self.endTagHandler) * 1.1:
+                    # this makes the eviction policy random on Py < 3.7 and FIFO >= 3.7
+                    self.__endTagCache.pop(next(iter(self.__endTagCache)))
+            return func(token)
+
+    class InitialPhase(Phase):
+        __slots__ = tuple()
+
+        def processSpaceCharacters(self, token):
+            pass
+
+        def processComment(self, token):
+            self.tree.insertComment(token, self.tree.document)
+
+        def processDoctype(self, token):
+            name = token["name"]
+            publicId = token["publicId"]
+            systemId = token["systemId"]
+            correct = token["correct"]
+
+            if (name != "html" or publicId is not None or
+                    systemId is not None and systemId != "about:legacy-compat"):
+                self.parser.parseError("unknown-doctype")
+
+            if publicId is None:
+                publicId = ""
+
+            self.tree.insertDoctype(token)
+
+            if publicId != "":
+                publicId = publicId.translate(asciiUpper2Lower)
+
+            if (not correct or token["name"] != "html" or
+                    publicId.startswith(
+                        ("+//silmaril//dtd html pro v0r11 19970101//",
+                         "-//advasoft ltd//dtd html 3.0 aswedit + extensions//",
+                         "-//as//dtd html 3.0 aswedit + extensions//",
+                         "-//ietf//dtd html 2.0 level 1//",
+                         "-//ietf//dtd html 2.0 level 2//",
+                         "-//ietf//dtd html 2.0 strict level 1//",
+                         "-//ietf//dtd html 2.0 strict level 2//",
+                         "-//ietf//dtd html 2.0 strict//",
+                         "-//ietf//dtd html 2.0//",
+                         "-//ietf//dtd html 2.1e//",
+                         "-//ietf//dtd html 3.0//",
+                         "-//ietf//dtd html 3.2 final//",
+                         "-//ietf//dtd html 3.2//",
+                         "-//ietf//dtd html 3//",
+                         "-//ietf//dtd html level 0//",
+                         "-//ietf//dtd html level 1//",
+                         "-//ietf//dtd html level 2//",
+                         "-//ietf//dtd html level 3//",
+                         "-//ietf//dtd html strict level 0//",
+                         "-//ietf//dtd html strict level 1//",
+                         "-//ietf//dtd html strict level 2//",
+                         "-//ietf//dtd html strict level 3//",
+                         "-//ietf//dtd html strict//",
+                         "-//ietf//dtd html//",
+                         "-//metrius//dtd metrius presentational//",
+                         "-//microsoft//dtd internet explorer 2.0 html strict//",
+                         "-//microsoft//dtd internet explorer 2.0 html//",
+                         "-//microsoft//dtd internet explorer 2.0 tables//",
+                         "-//microsoft//dtd internet explorer 3.0 html strict//",
+                         "-//microsoft//dtd internet explorer 3.0 html//",
+                         "-//microsoft//dtd internet explorer 3.0 tables//",
+                         "-//netscape comm. corp.//dtd html//",
+                         "-//netscape comm. corp.//dtd strict html//",
+                         "-//o'reilly and associates//dtd html 2.0//",
+                         "-//o'reilly and associates//dtd html extended 1.0//",
+                         "-//o'reilly and associates//dtd html extended relaxed 1.0//",
+                         "-//softquad software//dtd hotmetal pro 6.0::19990601::extensions to html 4.0//",
+                         "-//softquad//dtd hotmetal pro 4.0::19971010::extensions to html 4.0//",
+                         "-//spyglass//dtd html 2.0 extended//",
+                         "-//sq//dtd html 2.0 hotmetal + extensions//",
+                         "-//sun microsystems corp.//dtd hotjava html//",
+                         "-//sun microsystems corp.//dtd hotjava strict html//",
+                         "-//w3c//dtd html 3 1995-03-24//",
+                         "-//w3c//dtd html 3.2 draft//",
+                         "-//w3c//dtd html 3.2 final//",
+                         "-//w3c//dtd html 3.2//",
+                         "-//w3c//dtd html 3.2s draft//",
+                         "-//w3c//dtd html 4.0 frameset//",
+                         "-//w3c//dtd html 4.0 transitional//",
+                         "-//w3c//dtd html experimental 19960712//",
+                         "-//w3c//dtd html experimental 970421//",
+                         "-//w3c//dtd w3 html//",
+                         "-//w3o//dtd w3 html 3.0//",
+                         "-//webtechs//dtd mozilla html 2.0//",
+                         "-//webtechs//dtd mozilla html//")) or
+                    publicId in ("-//w3o//dtd w3 html strict 3.0//en//",
+                                 "-/w3c/dtd html 4.0 transitional/en",
+                                 "html") or
+                    publicId.startswith(
+                        ("-//w3c//dtd html 4.01 frameset//",
+                         "-//w3c//dtd html 4.01 transitional//")) and
+                    systemId is None or
+                    systemId and systemId.lower() == "http://www.ibm.com/data/dtd/v11/ibmxhtml1-transitional.dtd"):
+                self.parser.compatMode = "quirks"
+            elif (publicId.startswith(
+                    ("-//w3c//dtd xhtml 1.0 frameset//",
+                     "-//w3c//dtd xhtml 1.0 transitional//")) or
+                  publicId.startswith(
+                      ("-//w3c//dtd html 4.01 frameset//",
+                       "-//w3c//dtd html 4.01 transitional//")) and
+                  systemId is not None):
+                self.parser.compatMode = "limited quirks"
+
+            self.parser.phase = self.parser.phases["beforeHtml"]
+
+        def anythingElse(self):
+            self.parser.compatMode = "quirks"
+            self.parser.phase = self.parser.phases["beforeHtml"]
+
+        def processCharacters(self, token):
+            self.parser.parseError("expected-doctype-but-got-chars")
+            self.anythingElse()
+            return token
+
+        def processStartTag(self, token):
+            self.parser.parseError("expected-doctype-but-got-start-tag",
+                                   {"name": token["name"]})
+            self.anythingElse()
+            return token
+
+        def processEndTag(self, token):
+            self.parser.parseError("expected-doctype-but-got-end-tag",
+                                   {"name": token["name"]})
+            self.anythingElse()
+            return token
+
+        def processEOF(self):
+            self.parser.parseError("expected-doctype-but-got-eof")
+            self.anythingElse()
+            return True
+
+    class BeforeHtmlPhase(Phase):
+        __slots__ = tuple()
+
+        # helper methods
+        def insertHtmlElement(self):
+            self.tree.insertRoot(impliedTagToken("html", "StartTag"))
+            self.parser.phase = self.parser.phases["beforeHead"]
+
+        # other
+        def processEOF(self):
+            self.insertHtmlElement()
+            return True
+
+        def processComment(self, token):
+            self.tree.insertComment(token, self.tree.document)
+
+        def processSpaceCharacters(self, token):
+            pass
+
+        def processCharacters(self, token):
+            self.insertHtmlElement()
+            return token
+
+        def processStartTag(self, token):
+            if token["name"] == "html":
+                self.parser.firstStartTag = True
+            self.insertHtmlElement()
+            return token
+
+        def processEndTag(self, token):
+            if token["name"] not in ("head", "body", "html", "br"):
+                self.parser.parseError("unexpected-end-tag-before-html",
+                                       {"name": token["name"]})
+            else:
+                self.insertHtmlElement()
+                return token
+
+    class BeforeHeadPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            self.startTagHead(impliedTagToken("head", "StartTag"))
+            return True
+
+        def processSpaceCharacters(self, token):
+            pass
+
+        def processCharacters(self, token):
+            self.startTagHead(impliedTagToken("head", "StartTag"))
+            return token
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagHead(self, token):
+            self.tree.insertElement(token)
+            self.tree.headPointer = self.tree.openElements[-1]
+            self.parser.phase = self.parser.phases["inHead"]
+
+        def startTagOther(self, token):
+            self.startTagHead(impliedTagToken("head", "StartTag"))
+            return token
+
+        def endTagImplyHead(self, token):
+            self.startTagHead(impliedTagToken("head", "StartTag"))
+            return token
+
+        def endTagOther(self, token):
+            self.parser.parseError("end-tag-after-implied-root",
+                                   {"name": token["name"]})
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml),
+            ("head", startTagHead)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            (("head", "body", "html", "br"), endTagImplyHead)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InHeadPhase(Phase):
+        __slots__ = tuple()
+
+        # the real thing
+        def processEOF(self):
+            self.anythingElse()
+            return True
+
+        def processCharacters(self, token):
+            self.anythingElse()
+            return token
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagHead(self, token):
+            self.parser.parseError("two-heads-are-not-better-than-one")
+
+        def startTagBaseLinkCommand(self, token):
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+
+        def startTagMeta(self, token):
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+
+            attributes = token["data"]
+            if self.parser.tokenizer.stream.charEncoding[1] == "tentative":
+                if "charset" in attributes:
+                    self.parser.tokenizer.stream.changeEncoding(attributes["charset"])
+                elif ("content" in attributes and
+                      "http-equiv" in attributes and
+                      attributes["http-equiv"].lower() == "content-type"):
+                    # Encoding it as UTF-8 here is a hack, as really we should pass
+                    # the abstract Unicode string, and just use the
+                    # ContentAttrParser on that, but using UTF-8 allows all chars
+                    # to be encoded and as a ASCII-superset works.
+                    data = _inputstream.EncodingBytes(attributes["content"].encode("utf-8"))
+                    parser = _inputstream.ContentAttrParser(data)
+                    codec = parser.parse()
+                    self.parser.tokenizer.stream.changeEncoding(codec)
+
+        def startTagTitle(self, token):
+            self.parser.parseRCDataRawtext(token, "RCDATA")
+
+        def startTagNoFramesStyle(self, token):
+            # Need to decide whether to implement the scripting-disabled case
+            self.parser.parseRCDataRawtext(token, "RAWTEXT")
+
+        def startTagNoscript(self, token):
+            if self.parser.scripting:
+                self.parser.parseRCDataRawtext(token, "RAWTEXT")
+            else:
+                self.tree.insertElement(token)
+                self.parser.phase = self.parser.phases["inHeadNoscript"]
+
+        def startTagScript(self, token):
+            self.tree.insertElement(token)
+            self.parser.tokenizer.state = self.parser.tokenizer.scriptDataState
+            self.parser.originalPhase = self.parser.phase
+            self.parser.phase = self.parser.phases["text"]
+
+        def startTagOther(self, token):
+            self.anythingElse()
+            return token
+
+        def endTagHead(self, token):
+            node = self.parser.tree.openElements.pop()
+            assert node.name == "head", "Expected head got %s" % node.name
+            self.parser.phase = self.parser.phases["afterHead"]
+
+        def endTagHtmlBodyBr(self, token):
+            self.anythingElse()
+            return token
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def anythingElse(self):
+            self.endTagHead(impliedTagToken("head"))
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml),
+            ("title", startTagTitle),
+            (("noframes", "style"), startTagNoFramesStyle),
+            ("noscript", startTagNoscript),
+            ("script", startTagScript),
+            (("base", "basefont", "bgsound", "command", "link"),
+             startTagBaseLinkCommand),
+            ("meta", startTagMeta),
+            ("head", startTagHead)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("head", endTagHead),
+            (("br", "html", "body"), endTagHtmlBodyBr)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InHeadNoscriptPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            self.parser.parseError("eof-in-head-noscript")
+            self.anythingElse()
+            return True
+
+        def processComment(self, token):
+            return self.parser.phases["inHead"].processComment(token)
+
+        def processCharacters(self, token):
+            self.parser.parseError("char-in-head-noscript")
+            self.anythingElse()
+            return token
+
+        def processSpaceCharacters(self, token):
+            return self.parser.phases["inHead"].processSpaceCharacters(token)
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagBaseLinkCommand(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagHeadNoscript(self, token):
+            self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-inhead-noscript-tag", {"name": token["name"]})
+            self.anythingElse()
+            return token
+
+        def endTagNoscript(self, token):
+            node = self.parser.tree.openElements.pop()
+            assert node.name == "noscript", "Expected noscript got %s" % node.name
+            self.parser.phase = self.parser.phases["inHead"]
+
+        def endTagBr(self, token):
+            self.parser.parseError("unexpected-inhead-noscript-tag", {"name": token["name"]})
+            self.anythingElse()
+            return token
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def anythingElse(self):
+            # Caller must raise parse error first!
+            self.endTagNoscript(impliedTagToken("noscript"))
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml),
+            (("basefont", "bgsound", "link", "meta", "noframes", "style"), startTagBaseLinkCommand),
+            (("head", "noscript"), startTagHeadNoscript),
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("noscript", endTagNoscript),
+            ("br", endTagBr),
+        ])
+        endTagHandler.default = endTagOther
+
+    class AfterHeadPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            self.anythingElse()
+            return True
+
+        def processCharacters(self, token):
+            self.anythingElse()
+            return token
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagBody(self, token):
+            self.parser.framesetOK = False
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inBody"]
+
+        def startTagFrameset(self, token):
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inFrameset"]
+
+        def startTagFromHead(self, token):
+            self.parser.parseError("unexpected-start-tag-out-of-my-head",
+                                   {"name": token["name"]})
+            self.tree.openElements.append(self.tree.headPointer)
+            self.parser.phases["inHead"].processStartTag(token)
+            for node in self.tree.openElements[::-1]:
+                if node.name == "head":
+                    self.tree.openElements.remove(node)
+                    break
+
+        def startTagHead(self, token):
+            self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
+
+        def startTagOther(self, token):
+            self.anythingElse()
+            return token
+
+        def endTagHtmlBodyBr(self, token):
+            self.anythingElse()
+            return token
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def anythingElse(self):
+            self.tree.insertElement(impliedTagToken("body", "StartTag"))
+            self.parser.phase = self.parser.phases["inBody"]
+            self.parser.framesetOK = True
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml),
+            ("body", startTagBody),
+            ("frameset", startTagFrameset),
+            (("base", "basefont", "bgsound", "link", "meta", "noframes", "script",
+              "style", "title"),
+             startTagFromHead),
+            ("head", startTagHead)
+        ])
+        startTagHandler.default = startTagOther
+        endTagHandler = _utils.MethodDispatcher([(("body", "html", "br"),
+                                                  endTagHtmlBodyBr)])
+        endTagHandler.default = endTagOther
+
+    class InBodyPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#parsing-main-inbody
+        # the really-really-really-very crazy mode
+        __slots__ = ("processSpaceCharacters",)
+
+        def __init__(self, *args, **kwargs):
+            super(InBodyPhase, self).__init__(*args, **kwargs)
+            # Set this to the default handler
+            self.processSpaceCharacters = self.processSpaceCharactersNonPre
+
+        def isMatchingFormattingElement(self, node1, node2):
+            return (node1.name == node2.name and
+                    node1.namespace == node2.namespace and
+                    node1.attributes == node2.attributes)
+
+        # helper
+        def addFormattingElement(self, token):
+            self.tree.insertElement(token)
+            element = self.tree.openElements[-1]
+
+            matchingElements = []
+            for node in self.tree.activeFormattingElements[::-1]:
+                if node is Marker:
+                    break
+                elif self.isMatchingFormattingElement(node, element):
+                    matchingElements.append(node)
+
+            assert len(matchingElements) <= 3
+            if len(matchingElements) == 3:
+                self.tree.activeFormattingElements.remove(matchingElements[-1])
+            self.tree.activeFormattingElements.append(element)
+
+        # the real deal
+        def processEOF(self):
+            allowed_elements = frozenset(("dd", "dt", "li", "p", "tbody", "td",
+                                          "tfoot", "th", "thead", "tr", "body",
+                                          "html"))
+            for node in self.tree.openElements[::-1]:
+                if node.name not in allowed_elements:
+                    self.parser.parseError("expected-closing-tag-but-got-eof")
+                    break
+            # Stop parsing
+
+        def processSpaceCharactersDropNewline(self, token):
+            # Sometimes (start of <pre>, <listing>, and <textarea> blocks) we
+            # want to drop leading newlines
+            data = token["data"]
+            self.processSpaceCharacters = self.processSpaceCharactersNonPre
+            if (data.startswith("\n") and
+                self.tree.openElements[-1].name in ("pre", "listing", "textarea") and
+                    not self.tree.openElements[-1].hasContent()):
+                data = data[1:]
+            if data:
+                self.tree.reconstructActiveFormattingElements()
+                self.tree.insertText(data)
+
+        def processCharacters(self, token):
+            if token["data"] == "\u0000":
+                # The tokenizer should always emit null on its own
+                return
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertText(token["data"])
+            # This must be bad for performance
+            if (self.parser.framesetOK and
+                any([char not in spaceCharacters
+                     for char in token["data"]])):
+                self.parser.framesetOK = False
+
+        def processSpaceCharactersNonPre(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertText(token["data"])
+
+        def startTagProcessInHead(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagBody(self, token):
+            self.parser.parseError("unexpected-start-tag", {"name": "body"})
+            if (len(self.tree.openElements) == 1 or
+                    self.tree.openElements[1].name != "body"):
+                assert self.parser.innerHTML
+            else:
+                self.parser.framesetOK = False
+                for attr, value in token["data"].items():
+                    if attr not in self.tree.openElements[1].attributes:
+                        self.tree.openElements[1].attributes[attr] = value
+
+        def startTagFrameset(self, token):
+            self.parser.parseError("unexpected-start-tag", {"name": "frameset"})
+            if (len(self.tree.openElements) == 1 or self.tree.openElements[1].name != "body"):
+                assert self.parser.innerHTML
+            elif not self.parser.framesetOK:
+                pass
+            else:
+                if self.tree.openElements[1].parent:
+                    self.tree.openElements[1].parent.removeChild(self.tree.openElements[1])
+                while self.tree.openElements[-1].name != "html":
+                    self.tree.openElements.pop()
+                self.tree.insertElement(token)
+                self.parser.phase = self.parser.phases["inFrameset"]
+
+        def startTagCloseP(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            self.tree.insertElement(token)
+
+        def startTagPreListing(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            self.tree.insertElement(token)
+            self.parser.framesetOK = False
+            self.processSpaceCharacters = self.processSpaceCharactersDropNewline
+
+        def startTagForm(self, token):
+            if self.tree.formPointer:
+                self.parser.parseError("unexpected-start-tag", {"name": "form"})
+            else:
+                if self.tree.elementInScope("p", variant="button"):
+                    self.endTagP(impliedTagToken("p"))
+                self.tree.insertElement(token)
+                self.tree.formPointer = self.tree.openElements[-1]
+
+        def startTagListItem(self, token):
+            self.parser.framesetOK = False
+
+            stopNamesMap = {"li": ["li"],
+                            "dt": ["dt", "dd"],
+                            "dd": ["dt", "dd"]}
+            stopNames = stopNamesMap[token["name"]]
+            for node in reversed(self.tree.openElements):
+                if node.name in stopNames:
+                    self.parser.phase.processEndTag(
+                        impliedTagToken(node.name, "EndTag"))
+                    break
+                if (node.nameTuple in specialElements and
+                        node.name not in ("address", "div", "p")):
+                    break
+
+            if self.tree.elementInScope("p", variant="button"):
+                self.parser.phase.processEndTag(
+                    impliedTagToken("p", "EndTag"))
+
+            self.tree.insertElement(token)
+
+        def startTagPlaintext(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            self.tree.insertElement(token)
+            self.parser.tokenizer.state = self.parser.tokenizer.plaintextState
+
+        def startTagHeading(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            if self.tree.openElements[-1].name in headingElements:
+                self.parser.parseError("unexpected-start-tag", {"name": token["name"]})
+                self.tree.openElements.pop()
+            self.tree.insertElement(token)
+
+        def startTagA(self, token):
+            afeAElement = self.tree.elementInActiveFormattingElements("a")
+            if afeAElement:
+                self.parser.parseError("unexpected-start-tag-implies-end-tag",
+                                       {"startName": "a", "endName": "a"})
+                self.endTagFormatting(impliedTagToken("a"))
+                if afeAElement in self.tree.openElements:
+                    self.tree.openElements.remove(afeAElement)
+                if afeAElement in self.tree.activeFormattingElements:
+                    self.tree.activeFormattingElements.remove(afeAElement)
+            self.tree.reconstructActiveFormattingElements()
+            self.addFormattingElement(token)
+
+        def startTagFormatting(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.addFormattingElement(token)
+
+        def startTagNobr(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            if self.tree.elementInScope("nobr"):
+                self.parser.parseError("unexpected-start-tag-implies-end-tag",
+                                       {"startName": "nobr", "endName": "nobr"})
+                self.processEndTag(impliedTagToken("nobr"))
+                # XXX Need tests that trigger the following
+                self.tree.reconstructActiveFormattingElements()
+            self.addFormattingElement(token)
+
+        def startTagButton(self, token):
+            if self.tree.elementInScope("button"):
+                self.parser.parseError("unexpected-start-tag-implies-end-tag",
+                                       {"startName": "button", "endName": "button"})
+                self.processEndTag(impliedTagToken("button"))
+                return token
+            else:
+                self.tree.reconstructActiveFormattingElements()
+                self.tree.insertElement(token)
+                self.parser.framesetOK = False
+
+        def startTagAppletMarqueeObject(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertElement(token)
+            self.tree.activeFormattingElements.append(Marker)
+            self.parser.framesetOK = False
+
+        def startTagXmp(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            self.tree.reconstructActiveFormattingElements()
+            self.parser.framesetOK = False
+            self.parser.parseRCDataRawtext(token, "RAWTEXT")
+
+        def startTagTable(self, token):
+            if self.parser.compatMode != "quirks":
+                if self.tree.elementInScope("p", variant="button"):
+                    self.processEndTag(impliedTagToken("p"))
+            self.tree.insertElement(token)
+            self.parser.framesetOK = False
+            self.parser.phase = self.parser.phases["inTable"]
+
+        def startTagVoidFormatting(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+            self.parser.framesetOK = False
+
+        def startTagInput(self, token):
+            framesetOK = self.parser.framesetOK
+            self.startTagVoidFormatting(token)
+            if ("type" in token["data"] and
+                    token["data"]["type"].translate(asciiUpper2Lower) == "hidden"):
+                # input type=hidden doesn't change framesetOK
+                self.parser.framesetOK = framesetOK
+
+        def startTagParamSource(self, token):
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+
+        def startTagHr(self, token):
+            if self.tree.elementInScope("p", variant="button"):
+                self.endTagP(impliedTagToken("p"))
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+            self.parser.framesetOK = False
+
+        def startTagImage(self, token):
+            # No really...
+            self.parser.parseError("unexpected-start-tag-treated-as",
+                                   {"originalName": "image", "newName": "img"})
+            self.processStartTag(impliedTagToken("img", "StartTag",
+                                                 attributes=token["data"],
+                                                 selfClosing=token["selfClosing"]))
+
+        def startTagIsIndex(self, token):
+            self.parser.parseError("deprecated-tag", {"name": "isindex"})
+            if self.tree.formPointer:
+                return
+            form_attrs = {}
+            if "action" in token["data"]:
+                form_attrs["action"] = token["data"]["action"]
+            self.processStartTag(impliedTagToken("form", "StartTag",
+                                                 attributes=form_attrs))
+            self.processStartTag(impliedTagToken("hr", "StartTag"))
+            self.processStartTag(impliedTagToken("label", "StartTag"))
+            # XXX Localization ...
+            if "prompt" in token["data"]:
+                prompt = token["data"]["prompt"]
+            else:
+                prompt = "This is a searchable index. Enter search keywords: "
+            self.processCharacters(
+                {"type": tokenTypes["Characters"], "data": prompt})
+            attributes = token["data"].copy()
+            if "action" in attributes:
+                del attributes["action"]
+            if "prompt" in attributes:
+                del attributes["prompt"]
+            attributes["name"] = "isindex"
+            self.processStartTag(impliedTagToken("input", "StartTag",
+                                                 attributes=attributes,
+                                                 selfClosing=token["selfClosing"]))
+            self.processEndTag(impliedTagToken("label"))
+            self.processStartTag(impliedTagToken("hr", "StartTag"))
+            self.processEndTag(impliedTagToken("form"))
+
+        def startTagTextarea(self, token):
+            self.tree.insertElement(token)
+            self.parser.tokenizer.state = self.parser.tokenizer.rcdataState
+            self.processSpaceCharacters = self.processSpaceCharactersDropNewline
+            self.parser.framesetOK = False
+
+        def startTagIFrame(self, token):
+            self.parser.framesetOK = False
+            self.startTagRawtext(token)
+
+        def startTagNoscript(self, token):
+            if self.parser.scripting:
+                self.startTagRawtext(token)
+            else:
+                self.startTagOther(token)
+
+        def startTagRawtext(self, token):
+            """iframe, noembed noframes, noscript(if scripting enabled)"""
+            self.parser.parseRCDataRawtext(token, "RAWTEXT")
+
+        def startTagOpt(self, token):
+            if self.tree.openElements[-1].name == "option":
+                self.parser.phase.processEndTag(impliedTagToken("option"))
+            self.tree.reconstructActiveFormattingElements()
+            self.parser.tree.insertElement(token)
+
+        def startTagSelect(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertElement(token)
+            self.parser.framesetOK = False
+            if self.parser.phase in (self.parser.phases["inTable"],
+                                     self.parser.phases["inCaption"],
+                                     self.parser.phases["inColumnGroup"],
+                                     self.parser.phases["inTableBody"],
+                                     self.parser.phases["inRow"],
+                                     self.parser.phases["inCell"]):
+                self.parser.phase = self.parser.phases["inSelectInTable"]
+            else:
+                self.parser.phase = self.parser.phases["inSelect"]
+
+        def startTagRpRt(self, token):
+            if self.tree.elementInScope("ruby"):
+                self.tree.generateImpliedEndTags()
+                if self.tree.openElements[-1].name != "ruby":
+                    self.parser.parseError()
+            self.tree.insertElement(token)
+
+        def startTagMath(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.parser.adjustMathMLAttributes(token)
+            self.parser.adjustForeignAttributes(token)
+            token["namespace"] = namespaces["mathml"]
+            self.tree.insertElement(token)
+            # Need to get the parse error right for the case where the token
+            # has a namespace not equal to the xmlns attribute
+            if token["selfClosing"]:
+                self.tree.openElements.pop()
+                token["selfClosingAcknowledged"] = True
+
+        def startTagSvg(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.parser.adjustSVGAttributes(token)
+            self.parser.adjustForeignAttributes(token)
+            token["namespace"] = namespaces["svg"]
+            self.tree.insertElement(token)
+            # Need to get the parse error right for the case where the token
+            # has a namespace not equal to the xmlns attribute
+            if token["selfClosing"]:
+                self.tree.openElements.pop()
+                token["selfClosingAcknowledged"] = True
+
+        def startTagMisplaced(self, token):
+            """ Elements that should be children of other elements that have a
+            different insertion mode; here they are ignored
+            "caption", "col", "colgroup", "frame", "frameset", "head",
+            "option", "optgroup", "tbody", "td", "tfoot", "th", "thead",
+            "tr", "noscript"
+            """
+            self.parser.parseError("unexpected-start-tag-ignored", {"name": token["name"]})
+
+        def startTagOther(self, token):
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertElement(token)
+
+        def endTagP(self, token):
+            if not self.tree.elementInScope("p", variant="button"):
+                self.startTagCloseP(impliedTagToken("p", "StartTag"))
+                self.parser.parseError("unexpected-end-tag", {"name": "p"})
+                self.endTagP(impliedTagToken("p", "EndTag"))
+            else:
+                self.tree.generateImpliedEndTags("p")
+                if self.tree.openElements[-1].name != "p":
+                    self.parser.parseError("unexpected-end-tag", {"name": "p"})
+                node = self.tree.openElements.pop()
+                while node.name != "p":
+                    node = self.tree.openElements.pop()
+
+        def endTagBody(self, token):
+            if not self.tree.elementInScope("body"):
+                self.parser.parseError()
+                return
+            elif self.tree.openElements[-1].name != "body":
+                for node in self.tree.openElements[2:]:
+                    if node.name not in frozenset(("dd", "dt", "li", "optgroup",
+                                                   "option", "p", "rp", "rt",
+                                                   "tbody", "td", "tfoot",
+                                                   "th", "thead", "tr", "body",
+                                                   "html")):
+                        # Not sure this is the correct name for the parse error
+                        self.parser.parseError(
+                            "expected-one-end-tag-but-got-another",
+                            {"gotName": "body", "expectedName": node.name})
+                        break
+            self.parser.phase = self.parser.phases["afterBody"]
+
+        def endTagHtml(self, token):
+            # We repeat the test for the body end tag token being ignored here
+            if self.tree.elementInScope("body"):
+                self.endTagBody(impliedTagToken("body"))
+                return token
+
+        def endTagBlock(self, token):
+            # Put us back in the right whitespace handling mode
+            if token["name"] == "pre":
+                self.processSpaceCharacters = self.processSpaceCharactersNonPre
+            inScope = self.tree.elementInScope(token["name"])
+            if inScope:
+                self.tree.generateImpliedEndTags()
+            if self.tree.openElements[-1].name != token["name"]:
+                self.parser.parseError("end-tag-too-early", {"name": token["name"]})
+            if inScope:
+                node = self.tree.openElements.pop()
+                while node.name != token["name"]:
+                    node = self.tree.openElements.pop()
+
+        def endTagForm(self, token):
+            node = self.tree.formPointer
+            self.tree.formPointer = None
+            if node is None or not self.tree.elementInScope(node):
+                self.parser.parseError("unexpected-end-tag",
+                                       {"name": "form"})
+            else:
+                self.tree.generateImpliedEndTags()
+                if self.tree.openElements[-1] != node:
+                    self.parser.parseError("end-tag-too-early-ignored",
+                                           {"name": "form"})
+                self.tree.openElements.remove(node)
+
+        def endTagListItem(self, token):
+            if token["name"] == "li":
+                variant = "list"
+            else:
+                variant = None
+            if not self.tree.elementInScope(token["name"], variant=variant):
+                self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+            else:
+                self.tree.generateImpliedEndTags(exclude=token["name"])
+                if self.tree.openElements[-1].name != token["name"]:
+                    self.parser.parseError(
+                        "end-tag-too-early",
+                        {"name": token["name"]})
+                node = self.tree.openElements.pop()
+                while node.name != token["name"]:
+                    node = self.tree.openElements.pop()
+
+        def endTagHeading(self, token):
+            for item in headingElements:
+                if self.tree.elementInScope(item):
+                    self.tree.generateImpliedEndTags()
+                    break
+            if self.tree.openElements[-1].name != token["name"]:
+                self.parser.parseError("end-tag-too-early", {"name": token["name"]})
+
+            for item in headingElements:
+                if self.tree.elementInScope(item):
+                    item = self.tree.openElements.pop()
+                    while item.name not in headingElements:
+                        item = self.tree.openElements.pop()
+                    break
+
+        def endTagFormatting(self, token):
+            """The much-feared adoption agency algorithm"""
+            # http://svn.whatwg.org/webapps/complete.html#adoptionAgency revision 7867
+            # XXX Better parseError messages appreciated.
+
+            # Step 1
+            outerLoopCounter = 0
+
+            # Step 2
+            while outerLoopCounter < 8:
+
+                # Step 3
+                outerLoopCounter += 1
+
+                # Step 4:
+
+                # Let the formatting element be the last element in
+                # the list of active formatting elements that:
+                # - is between the end of the list and the last scope
+                # marker in the list, if any, or the start of the list
+                # otherwise, and
+                # - has the same tag name as the token.
+                formattingElement = self.tree.elementInActiveFormattingElements(
+                    token["name"])
+                if (not formattingElement or
+                    (formattingElement in self.tree.openElements and
+                     not self.tree.elementInScope(formattingElement.name))):
+                    # If there is no such node, then abort these steps
+                    # and instead act as described in the "any other
+                    # end tag" entry below.
+                    self.endTagOther(token)
+                    return
+
+                # Otherwise, if there is such a node, but that node is
+                # not in the stack of open elements, then this is a
+                # parse error; remove the element from the list, and
+                # abort these steps.
+                elif formattingElement not in self.tree.openElements:
+                    self.parser.parseError("adoption-agency-1.2", {"name": token["name"]})
+                    self.tree.activeFormattingElements.remove(formattingElement)
+                    return
+
+                # Otherwise, if there is such a node, and that node is
+                # also in the stack of open elements, but the element
+                # is not in scope, then this is a parse error; ignore
+                # the token, and abort these steps.
+                elif not self.tree.elementInScope(formattingElement.name):
+                    self.parser.parseError("adoption-agency-4.4", {"name": token["name"]})
+                    return
+
+                # Otherwise, there is a formatting element and that
+                # element is in the stack and is in scope. If the
+                # element is not the current node, this is a parse
+                # error. In any case, proceed with the algorithm as
+                # written in the following steps.
+                else:
+                    if formattingElement != self.tree.openElements[-1]:
+                        self.parser.parseError("adoption-agency-1.3", {"name": token["name"]})
+
+                # Step 5:
+
+                # Let the furthest block be the topmost node in the
+                # stack of open elements that is lower in the stack
+                # than the formatting element, and is an element in
+                # the special category. There might not be one.
+                afeIndex = self.tree.openElements.index(formattingElement)
+                furthestBlock = None
+                for element in self.tree.openElements[afeIndex:]:
+                    if element.nameTuple in specialElements:
+                        furthestBlock = element
+                        break
+
+                # Step 6:
+
+                # If there is no furthest block, then the UA must
+                # first pop all the nodes from the bottom of the stack
+                # of open elements, from the current node up to and
+                # including the formatting element, then remove the
+                # formatting element from the list of active
+                # formatting elements, and finally abort these steps.
+                if furthestBlock is None:
+                    element = self.tree.openElements.pop()
+                    while element != formattingElement:
+                        element = self.tree.openElements.pop()
+                    self.tree.activeFormattingElements.remove(element)
+                    return
+
+                # Step 7
+                commonAncestor = self.tree.openElements[afeIndex - 1]
+
+                # Step 8:
+                # The bookmark is supposed to help us identify where to reinsert
+                # nodes in step 15. We have to ensure that we reinsert nodes after
+                # the node before the active formatting element. Note the bookmark
+                # can move in step 9.7
+                bookmark = self.tree.activeFormattingElements.index(formattingElement)
+
+                # Step 9
+                lastNode = node = furthestBlock
+                innerLoopCounter = 0
+
+                index = self.tree.openElements.index(node)
+                while innerLoopCounter < 3:
+                    innerLoopCounter += 1
+                    # Node is element before node in open elements
+                    index -= 1
+                    node = self.tree.openElements[index]
+                    if node not in self.tree.activeFormattingElements:
+                        self.tree.openElements.remove(node)
+                        continue
+                    # Step 9.6
+                    if node == formattingElement:
+                        break
+                    # Step 9.7
+                    if lastNode == furthestBlock:
+                        bookmark = self.tree.activeFormattingElements.index(node) + 1
+                    # Step 9.8
+                    clone = node.cloneNode()
+                    # Replace node with clone
+                    self.tree.activeFormattingElements[
+                        self.tree.activeFormattingElements.index(node)] = clone
+                    self.tree.openElements[
+                        self.tree.openElements.index(node)] = clone
+                    node = clone
+                    # Step 9.9
+                    # Remove lastNode from its parents, if any
+                    if lastNode.parent:
+                        lastNode.parent.removeChild(lastNode)
+                    node.appendChild(lastNode)
+                    # Step 9.10
+                    lastNode = node
+
+                # Step 10
+                # Foster parent lastNode if commonAncestor is a
+                # table, tbody, tfoot, thead, or tr we need to foster
+                # parent the lastNode
+                if lastNode.parent:
+                    lastNode.parent.removeChild(lastNode)
+
+                if commonAncestor.name in frozenset(("table", "tbody", "tfoot", "thead", "tr")):
+                    parent, insertBefore = self.tree.getTableMisnestedNodePosition()
+                    parent.insertBefore(lastNode, insertBefore)
+                else:
+                    commonAncestor.appendChild(lastNode)
+
+                # Step 11
+                clone = formattingElement.cloneNode()
+
+                # Step 12
+                furthestBlock.reparentChildren(clone)
+
+                # Step 13
+                furthestBlock.appendChild(clone)
+
+                # Step 14
+                self.tree.activeFormattingElements.remove(formattingElement)
+                self.tree.activeFormattingElements.insert(bookmark, clone)
+
+                # Step 15
+                self.tree.openElements.remove(formattingElement)
+                self.tree.openElements.insert(
+                    self.tree.openElements.index(furthestBlock) + 1, clone)
+
+        def endTagAppletMarqueeObject(self, token):
+            if self.tree.elementInScope(token["name"]):
+                self.tree.generateImpliedEndTags()
+            if self.tree.openElements[-1].name != token["name"]:
+                self.parser.parseError("end-tag-too-early", {"name": token["name"]})
+
+            if self.tree.elementInScope(token["name"]):
+                element = self.tree.openElements.pop()
+                while element.name != token["name"]:
+                    element = self.tree.openElements.pop()
+                self.tree.clearActiveFormattingElements()
+
+        def endTagBr(self, token):
+            self.parser.parseError("unexpected-end-tag-treated-as",
+                                   {"originalName": "br", "newName": "br element"})
+            self.tree.reconstructActiveFormattingElements()
+            self.tree.insertElement(impliedTagToken("br", "StartTag"))
+            self.tree.openElements.pop()
+
+        def endTagOther(self, token):
+            for node in self.tree.openElements[::-1]:
+                if node.name == token["name"]:
+                    self.tree.generateImpliedEndTags(exclude=token["name"])
+                    if self.tree.openElements[-1].name != token["name"]:
+                        self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+                    while self.tree.openElements.pop() != node:
+                        pass
+                    break
+                else:
+                    if node.nameTuple in specialElements:
+                        self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+                        break
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            (("base", "basefont", "bgsound", "command", "link", "meta",
+              "script", "style", "title"),
+             startTagProcessInHead),
+            ("body", startTagBody),
+            ("frameset", startTagFrameset),
+            (("address", "article", "aside", "blockquote", "center", "details",
+              "dir", "div", "dl", "fieldset", "figcaption", "figure",
+              "footer", "header", "hgroup", "main", "menu", "nav", "ol", "p",
+              "section", "summary", "ul"),
+             startTagCloseP),
+            (headingElements, startTagHeading),
+            (("pre", "listing"), startTagPreListing),
+            ("form", startTagForm),
+            (("li", "dd", "dt"), startTagListItem),
+            ("plaintext", startTagPlaintext),
+            ("a", startTagA),
+            (("b", "big", "code", "em", "font", "i", "s", "small", "strike",
+              "strong", "tt", "u"), startTagFormatting),
+            ("nobr", startTagNobr),
+            ("button", startTagButton),
+            (("applet", "marquee", "object"), startTagAppletMarqueeObject),
+            ("xmp", startTagXmp),
+            ("table", startTagTable),
+            (("area", "br", "embed", "img", "keygen", "wbr"),
+             startTagVoidFormatting),
+            (("param", "source", "track"), startTagParamSource),
+            ("input", startTagInput),
+            ("hr", startTagHr),
+            ("image", startTagImage),
+            ("isindex", startTagIsIndex),
+            ("textarea", startTagTextarea),
+            ("iframe", startTagIFrame),
+            ("noscript", startTagNoscript),
+            (("noembed", "noframes"), startTagRawtext),
+            ("select", startTagSelect),
+            (("rp", "rt"), startTagRpRt),
+            (("option", "optgroup"), startTagOpt),
+            (("math"), startTagMath),
+            (("svg"), startTagSvg),
+            (("caption", "col", "colgroup", "frame", "head",
+              "tbody", "td", "tfoot", "th", "thead",
+              "tr"), startTagMisplaced)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("body", endTagBody),
+            ("html", endTagHtml),
+            (("address", "article", "aside", "blockquote", "button", "center",
+              "details", "dialog", "dir", "div", "dl", "fieldset", "figcaption", "figure",
+              "footer", "header", "hgroup", "listing", "main", "menu", "nav", "ol", "pre",
+              "section", "summary", "ul"), endTagBlock),
+            ("form", endTagForm),
+            ("p", endTagP),
+            (("dd", "dt", "li"), endTagListItem),
+            (headingElements, endTagHeading),
+            (("a", "b", "big", "code", "em", "font", "i", "nobr", "s", "small",
+              "strike", "strong", "tt", "u"), endTagFormatting),
+            (("applet", "marquee", "object"), endTagAppletMarqueeObject),
+            ("br", endTagBr),
+        ])
+        endTagHandler.default = endTagOther
+
+    class TextPhase(Phase):
+        __slots__ = tuple()
+
+        def processCharacters(self, token):
+            self.tree.insertText(token["data"])
+
+        def processEOF(self):
+            self.parser.parseError("expected-named-closing-tag-but-got-eof",
+                                   {"name": self.tree.openElements[-1].name})
+            self.tree.openElements.pop()
+            self.parser.phase = self.parser.originalPhase
+            return True
+
+        def startTagOther(self, token):
+            assert False, "Tried to process start tag %s in RCDATA/RAWTEXT mode" % token['name']
+
+        def endTagScript(self, token):
+            node = self.tree.openElements.pop()
+            assert node.name == "script"
+            self.parser.phase = self.parser.originalPhase
+            # The rest of this method is all stuff that only happens if
+            # document.write works
+
+        def endTagOther(self, token):
+            self.tree.openElements.pop()
+            self.parser.phase = self.parser.originalPhase
+
+        startTagHandler = _utils.MethodDispatcher([])
+        startTagHandler.default = startTagOther
+        endTagHandler = _utils.MethodDispatcher([
+            ("script", endTagScript)])
+        endTagHandler.default = endTagOther
+
+    class InTablePhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-table
+        __slots__ = tuple()
+
+        # helper methods
+        def clearStackToTableContext(self):
+            # "clear the stack back to a table context"
+            while self.tree.openElements[-1].name not in ("table", "html"):
+                # self.parser.parseError("unexpected-implied-end-tag-in-table",
+                #  {"name":  self.tree.openElements[-1].name})
+                self.tree.openElements.pop()
+            # When the current node is <html> it's an innerHTML case
+
+        # processing methods
+        def processEOF(self):
+            if self.tree.openElements[-1].name != "html":
+                self.parser.parseError("eof-in-table")
+            else:
+                assert self.parser.innerHTML
+            # Stop parsing
+
+        def processSpaceCharacters(self, token):
+            originalPhase = self.parser.phase
+            self.parser.phase = self.parser.phases["inTableText"]
+            self.parser.phase.originalPhase = originalPhase
+            self.parser.phase.processSpaceCharacters(token)
+
+        def processCharacters(self, token):
+            originalPhase = self.parser.phase
+            self.parser.phase = self.parser.phases["inTableText"]
+            self.parser.phase.originalPhase = originalPhase
+            self.parser.phase.processCharacters(token)
+
+        def insertText(self, token):
+            # If we get here there must be at least one non-whitespace character
+            # Do the table magic!
+            self.tree.insertFromTable = True
+            self.parser.phases["inBody"].processCharacters(token)
+            self.tree.insertFromTable = False
+
+        def startTagCaption(self, token):
+            self.clearStackToTableContext()
+            self.tree.activeFormattingElements.append(Marker)
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inCaption"]
+
+        def startTagColgroup(self, token):
+            self.clearStackToTableContext()
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inColumnGroup"]
+
+        def startTagCol(self, token):
+            self.startTagColgroup(impliedTagToken("colgroup", "StartTag"))
+            return token
+
+        def startTagRowGroup(self, token):
+            self.clearStackToTableContext()
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inTableBody"]
+
+        def startTagImplyTbody(self, token):
+            self.startTagRowGroup(impliedTagToken("tbody", "StartTag"))
+            return token
+
+        def startTagTable(self, token):
+            self.parser.parseError("unexpected-start-tag-implies-end-tag",
+                                   {"startName": "table", "endName": "table"})
+            self.parser.phase.processEndTag(impliedTagToken("table"))
+            if not self.parser.innerHTML:
+                return token
+
+        def startTagStyleScript(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagInput(self, token):
+            if ("type" in token["data"] and
+                    token["data"]["type"].translate(asciiUpper2Lower) == "hidden"):
+                self.parser.parseError("unexpected-hidden-input-in-table")
+                self.tree.insertElement(token)
+                # XXX associate with form
+                self.tree.openElements.pop()
+            else:
+                self.startTagOther(token)
+
+        def startTagForm(self, token):
+            self.parser.parseError("unexpected-form-in-table")
+            if self.tree.formPointer is None:
+                self.tree.insertElement(token)
+                self.tree.formPointer = self.tree.openElements[-1]
+                self.tree.openElements.pop()
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-start-tag-implies-table-voodoo", {"name": token["name"]})
+            # Do the table magic!
+            self.tree.insertFromTable = True
+            self.parser.phases["inBody"].processStartTag(token)
+            self.tree.insertFromTable = False
+
+        def endTagTable(self, token):
+            if self.tree.elementInScope("table", variant="table"):
+                self.tree.generateImpliedEndTags()
+                if self.tree.openElements[-1].name != "table":
+                    self.parser.parseError("end-tag-too-early-named",
+                                           {"gotName": "table",
+                                            "expectedName": self.tree.openElements[-1].name})
+                while self.tree.openElements[-1].name != "table":
+                    self.tree.openElements.pop()
+                self.tree.openElements.pop()
+                self.parser.resetInsertionMode()
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def endTagIgnore(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag-implies-table-voodoo", {"name": token["name"]})
+            # Do the table magic!
+            self.tree.insertFromTable = True
+            self.parser.phases["inBody"].processEndTag(token)
+            self.tree.insertFromTable = False
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("caption", startTagCaption),
+            ("colgroup", startTagColgroup),
+            ("col", startTagCol),
+            (("tbody", "tfoot", "thead"), startTagRowGroup),
+            (("td", "th", "tr"), startTagImplyTbody),
+            ("table", startTagTable),
+            (("style", "script"), startTagStyleScript),
+            ("input", startTagInput),
+            ("form", startTagForm)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("table", endTagTable),
+            (("body", "caption", "col", "colgroup", "html", "tbody", "td",
+              "tfoot", "th", "thead", "tr"), endTagIgnore)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InTableTextPhase(Phase):
+        __slots__ = ("originalPhase", "characterTokens")
+
+        def __init__(self, *args, **kwargs):
+            super(InTableTextPhase, self).__init__(*args, **kwargs)
+            self.originalPhase = None
+            self.characterTokens = []
+
+        def flushCharacters(self):
+            data = "".join([item["data"] for item in self.characterTokens])
+            if any([item not in spaceCharacters for item in data]):
+                token = {"type": tokenTypes["Characters"], "data": data}
+                self.parser.phases["inTable"].insertText(token)
+            elif data:
+                self.tree.insertText(data)
+            self.characterTokens = []
+
+        def processComment(self, token):
+            self.flushCharacters()
+            self.parser.phase = self.originalPhase
+            return token
+
+        def processEOF(self):
+            self.flushCharacters()
+            self.parser.phase = self.originalPhase
+            return True
+
+        def processCharacters(self, token):
+            if token["data"] == "\u0000":
+                return
+            self.characterTokens.append(token)
+
+        def processSpaceCharacters(self, token):
+            # pretty sure we should never reach here
+            self.characterTokens.append(token)
+    #        assert False
+
+        def processStartTag(self, token):
+            self.flushCharacters()
+            self.parser.phase = self.originalPhase
+            return token
+
+        def processEndTag(self, token):
+            self.flushCharacters()
+            self.parser.phase = self.originalPhase
+            return token
+
+    class InCaptionPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-caption
+        __slots__ = tuple()
+
+        def ignoreEndTagCaption(self):
+            return not self.tree.elementInScope("caption", variant="table")
+
+        def processEOF(self):
+            self.parser.phases["inBody"].processEOF()
+
+        def processCharacters(self, token):
+            return self.parser.phases["inBody"].processCharacters(token)
+
+        def startTagTableElement(self, token):
+            self.parser.parseError()
+            # XXX Have to duplicate logic here to find out if the tag is ignored
+            ignoreEndTag = self.ignoreEndTagCaption()
+            self.parser.phase.processEndTag(impliedTagToken("caption"))
+            if not ignoreEndTag:
+                return token
+
+        def startTagOther(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def endTagCaption(self, token):
+            if not self.ignoreEndTagCaption():
+                # AT this code is quite similar to endTagTable in "InTable"
+                self.tree.generateImpliedEndTags()
+                if self.tree.openElements[-1].name != "caption":
+                    self.parser.parseError("expected-one-end-tag-but-got-another",
+                                           {"gotName": "caption",
+                                            "expectedName": self.tree.openElements[-1].name})
+                while self.tree.openElements[-1].name != "caption":
+                    self.tree.openElements.pop()
+                self.tree.openElements.pop()
+                self.tree.clearActiveFormattingElements()
+                self.parser.phase = self.parser.phases["inTable"]
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def endTagTable(self, token):
+            self.parser.parseError()
+            ignoreEndTag = self.ignoreEndTagCaption()
+            self.parser.phase.processEndTag(impliedTagToken("caption"))
+            if not ignoreEndTag:
+                return token
+
+        def endTagIgnore(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def endTagOther(self, token):
+            return self.parser.phases["inBody"].processEndTag(token)
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            (("caption", "col", "colgroup", "tbody", "td", "tfoot", "th",
+              "thead", "tr"), startTagTableElement)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("caption", endTagCaption),
+            ("table", endTagTable),
+            (("body", "col", "colgroup", "html", "tbody", "td", "tfoot", "th",
+              "thead", "tr"), endTagIgnore)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InColumnGroupPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-column
+        __slots__ = tuple()
+
+        def ignoreEndTagColgroup(self):
+            return self.tree.openElements[-1].name == "html"
+
+        def processEOF(self):
+            if self.tree.openElements[-1].name == "html":
+                assert self.parser.innerHTML
+                return
+            else:
+                ignoreEndTag = self.ignoreEndTagColgroup()
+                self.endTagColgroup(impliedTagToken("colgroup"))
+                if not ignoreEndTag:
+                    return True
+
+        def processCharacters(self, token):
+            ignoreEndTag = self.ignoreEndTagColgroup()
+            self.endTagColgroup(impliedTagToken("colgroup"))
+            if not ignoreEndTag:
+                return token
+
+        def startTagCol(self, token):
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+            token["selfClosingAcknowledged"] = True
+
+        def startTagOther(self, token):
+            ignoreEndTag = self.ignoreEndTagColgroup()
+            self.endTagColgroup(impliedTagToken("colgroup"))
+            if not ignoreEndTag:
+                return token
+
+        def endTagColgroup(self, token):
+            if self.ignoreEndTagColgroup():
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+            else:
+                self.tree.openElements.pop()
+                self.parser.phase = self.parser.phases["inTable"]
+
+        def endTagCol(self, token):
+            self.parser.parseError("no-end-tag", {"name": "col"})
+
+        def endTagOther(self, token):
+            ignoreEndTag = self.ignoreEndTagColgroup()
+            self.endTagColgroup(impliedTagToken("colgroup"))
+            if not ignoreEndTag:
+                return token
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("col", startTagCol)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("colgroup", endTagColgroup),
+            ("col", endTagCol)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InTableBodyPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-table0
+        __slots__ = tuple()
+
+        # helper methods
+        def clearStackToTableBodyContext(self):
+            while self.tree.openElements[-1].name not in ("tbody", "tfoot",
+                                                          "thead", "html"):
+                # self.parser.parseError("unexpected-implied-end-tag-in-table",
+                #  {"name": self.tree.openElements[-1].name})
+                self.tree.openElements.pop()
+            if self.tree.openElements[-1].name == "html":
+                assert self.parser.innerHTML
+
+        # the rest
+        def processEOF(self):
+            self.parser.phases["inTable"].processEOF()
+
+        def processSpaceCharacters(self, token):
+            return self.parser.phases["inTable"].processSpaceCharacters(token)
+
+        def processCharacters(self, token):
+            return self.parser.phases["inTable"].processCharacters(token)
+
+        def startTagTr(self, token):
+            self.clearStackToTableBodyContext()
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inRow"]
+
+        def startTagTableCell(self, token):
+            self.parser.parseError("unexpected-cell-in-table-body",
+                                   {"name": token["name"]})
+            self.startTagTr(impliedTagToken("tr", "StartTag"))
+            return token
+
+        def startTagTableOther(self, token):
+            # XXX AT Any ideas on how to share this with endTagTable?
+            if (self.tree.elementInScope("tbody", variant="table") or
+                self.tree.elementInScope("thead", variant="table") or
+                    self.tree.elementInScope("tfoot", variant="table")):
+                self.clearStackToTableBodyContext()
+                self.endTagTableRowGroup(
+                    impliedTagToken(self.tree.openElements[-1].name))
+                return token
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def startTagOther(self, token):
+            return self.parser.phases["inTable"].processStartTag(token)
+
+        def endTagTableRowGroup(self, token):
+            if self.tree.elementInScope(token["name"], variant="table"):
+                self.clearStackToTableBodyContext()
+                self.tree.openElements.pop()
+                self.parser.phase = self.parser.phases["inTable"]
+            else:
+                self.parser.parseError("unexpected-end-tag-in-table-body",
+                                       {"name": token["name"]})
+
+        def endTagTable(self, token):
+            if (self.tree.elementInScope("tbody", variant="table") or
+                self.tree.elementInScope("thead", variant="table") or
+                    self.tree.elementInScope("tfoot", variant="table")):
+                self.clearStackToTableBodyContext()
+                self.endTagTableRowGroup(
+                    impliedTagToken(self.tree.openElements[-1].name))
+                return token
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def endTagIgnore(self, token):
+            self.parser.parseError("unexpected-end-tag-in-table-body",
+                                   {"name": token["name"]})
+
+        def endTagOther(self, token):
+            return self.parser.phases["inTable"].processEndTag(token)
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("tr", startTagTr),
+            (("td", "th"), startTagTableCell),
+            (("caption", "col", "colgroup", "tbody", "tfoot", "thead"),
+             startTagTableOther)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            (("tbody", "tfoot", "thead"), endTagTableRowGroup),
+            ("table", endTagTable),
+            (("body", "caption", "col", "colgroup", "html", "td", "th",
+              "tr"), endTagIgnore)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InRowPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-row
+        __slots__ = tuple()
+
+        # helper methods (XXX unify this with other table helper methods)
+        def clearStackToTableRowContext(self):
+            while self.tree.openElements[-1].name not in ("tr", "html"):
+                self.parser.parseError("unexpected-implied-end-tag-in-table-row",
+                                       {"name": self.tree.openElements[-1].name})
+                self.tree.openElements.pop()
+
+        def ignoreEndTagTr(self):
+            return not self.tree.elementInScope("tr", variant="table")
+
+        # the rest
+        def processEOF(self):
+            self.parser.phases["inTable"].processEOF()
+
+        def processSpaceCharacters(self, token):
+            return self.parser.phases["inTable"].processSpaceCharacters(token)
+
+        def processCharacters(self, token):
+            return self.parser.phases["inTable"].processCharacters(token)
+
+        def startTagTableCell(self, token):
+            self.clearStackToTableRowContext()
+            self.tree.insertElement(token)
+            self.parser.phase = self.parser.phases["inCell"]
+            self.tree.activeFormattingElements.append(Marker)
+
+        def startTagTableOther(self, token):
+            ignoreEndTag = self.ignoreEndTagTr()
+            self.endTagTr(impliedTagToken("tr"))
+            # XXX how are we sure it's always ignored in the innerHTML case?
+            if not ignoreEndTag:
+                return token
+
+        def startTagOther(self, token):
+            return self.parser.phases["inTable"].processStartTag(token)
+
+        def endTagTr(self, token):
+            if not self.ignoreEndTagTr():
+                self.clearStackToTableRowContext()
+                self.tree.openElements.pop()
+                self.parser.phase = self.parser.phases["inTableBody"]
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def endTagTable(self, token):
+            ignoreEndTag = self.ignoreEndTagTr()
+            self.endTagTr(impliedTagToken("tr"))
+            # Reprocess the current tag if the tr end tag was not ignored
+            # XXX how are we sure it's always ignored in the innerHTML case?
+            if not ignoreEndTag:
+                return token
+
+        def endTagTableRowGroup(self, token):
+            if self.tree.elementInScope(token["name"], variant="table"):
+                self.endTagTr(impliedTagToken("tr"))
+                return token
+            else:
+                self.parser.parseError()
+
+        def endTagIgnore(self, token):
+            self.parser.parseError("unexpected-end-tag-in-table-row",
+                                   {"name": token["name"]})
+
+        def endTagOther(self, token):
+            return self.parser.phases["inTable"].processEndTag(token)
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            (("td", "th"), startTagTableCell),
+            (("caption", "col", "colgroup", "tbody", "tfoot", "thead",
+              "tr"), startTagTableOther)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("tr", endTagTr),
+            ("table", endTagTable),
+            (("tbody", "tfoot", "thead"), endTagTableRowGroup),
+            (("body", "caption", "col", "colgroup", "html", "td", "th"),
+             endTagIgnore)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InCellPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-cell
+        __slots__ = tuple()
+
+        # helper
+        def closeCell(self):
+            if self.tree.elementInScope("td", variant="table"):
+                self.endTagTableCell(impliedTagToken("td"))
+            elif self.tree.elementInScope("th", variant="table"):
+                self.endTagTableCell(impliedTagToken("th"))
+
+        # the rest
+        def processEOF(self):
+            self.parser.phases["inBody"].processEOF()
+
+        def processCharacters(self, token):
+            return self.parser.phases["inBody"].processCharacters(token)
+
+        def startTagTableOther(self, token):
+            if (self.tree.elementInScope("td", variant="table") or
+                    self.tree.elementInScope("th", variant="table")):
+                self.closeCell()
+                return token
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def startTagOther(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def endTagTableCell(self, token):
+            if self.tree.elementInScope(token["name"], variant="table"):
+                self.tree.generateImpliedEndTags(token["name"])
+                if self.tree.openElements[-1].name != token["name"]:
+                    self.parser.parseError("unexpected-cell-end-tag",
+                                           {"name": token["name"]})
+                    while True:
+                        node = self.tree.openElements.pop()
+                        if node.name == token["name"]:
+                            break
+                else:
+                    self.tree.openElements.pop()
+                self.tree.clearActiveFormattingElements()
+                self.parser.phase = self.parser.phases["inRow"]
+            else:
+                self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def endTagIgnore(self, token):
+            self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+        def endTagImply(self, token):
+            if self.tree.elementInScope(token["name"], variant="table"):
+                self.closeCell()
+                return token
+            else:
+                # sometimes innerHTML case
+                self.parser.parseError()
+
+        def endTagOther(self, token):
+            return self.parser.phases["inBody"].processEndTag(token)
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            (("caption", "col", "colgroup", "tbody", "td", "tfoot", "th",
+              "thead", "tr"), startTagTableOther)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            (("td", "th"), endTagTableCell),
+            (("body", "caption", "col", "colgroup", "html"), endTagIgnore),
+            (("table", "tbody", "tfoot", "thead", "tr"), endTagImply)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InSelectPhase(Phase):
+        __slots__ = tuple()
+
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-select
+        def processEOF(self):
+            if self.tree.openElements[-1].name != "html":
+                self.parser.parseError("eof-in-select")
+            else:
+                assert self.parser.innerHTML
+
+        def processCharacters(self, token):
+            if token["data"] == "\u0000":
+                return
+            self.tree.insertText(token["data"])
+
+        def startTagOption(self, token):
+            # We need to imply </option> if <option> is the current node.
+            if self.tree.openElements[-1].name == "option":
+                self.tree.openElements.pop()
+            self.tree.insertElement(token)
+
+        def startTagOptgroup(self, token):
+            if self.tree.openElements[-1].name == "option":
+                self.tree.openElements.pop()
+            if self.tree.openElements[-1].name == "optgroup":
+                self.tree.openElements.pop()
+            self.tree.insertElement(token)
+
+        def startTagSelect(self, token):
+            self.parser.parseError("unexpected-select-in-select")
+            self.endTagSelect(impliedTagToken("select"))
+
+        def startTagInput(self, token):
+            self.parser.parseError("unexpected-input-in-select")
+            if self.tree.elementInScope("select", variant="select"):
+                self.endTagSelect(impliedTagToken("select"))
+                return token
+            else:
+                assert self.parser.innerHTML
+
+        def startTagScript(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-start-tag-in-select",
+                                   {"name": token["name"]})
+
+        def endTagOption(self, token):
+            if self.tree.openElements[-1].name == "option":
+                self.tree.openElements.pop()
+            else:
+                self.parser.parseError("unexpected-end-tag-in-select",
+                                       {"name": "option"})
+
+        def endTagOptgroup(self, token):
+            # </optgroup> implicitly closes <option>
+            if (self.tree.openElements[-1].name == "option" and
+                    self.tree.openElements[-2].name == "optgroup"):
+                self.tree.openElements.pop()
+            # It also closes </optgroup>
+            if self.tree.openElements[-1].name == "optgroup":
+                self.tree.openElements.pop()
+            # But nothing else
+            else:
+                self.parser.parseError("unexpected-end-tag-in-select",
+                                       {"name": "optgroup"})
+
+        def endTagSelect(self, token):
+            if self.tree.elementInScope("select", variant="select"):
+                node = self.tree.openElements.pop()
+                while node.name != "select":
+                    node = self.tree.openElements.pop()
+                self.parser.resetInsertionMode()
+            else:
+                # innerHTML case
+                assert self.parser.innerHTML
+                self.parser.parseError()
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag-in-select",
+                                   {"name": token["name"]})
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("option", startTagOption),
+            ("optgroup", startTagOptgroup),
+            ("select", startTagSelect),
+            (("input", "keygen", "textarea"), startTagInput),
+            ("script", startTagScript)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("option", endTagOption),
+            ("optgroup", endTagOptgroup),
+            ("select", endTagSelect)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InSelectInTablePhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            self.parser.phases["inSelect"].processEOF()
+
+        def processCharacters(self, token):
+            return self.parser.phases["inSelect"].processCharacters(token)
+
+        def startTagTable(self, token):
+            self.parser.parseError("unexpected-table-element-start-tag-in-select-in-table", {"name": token["name"]})
+            self.endTagOther(impliedTagToken("select"))
+            return token
+
+        def startTagOther(self, token):
+            return self.parser.phases["inSelect"].processStartTag(token)
+
+        def endTagTable(self, token):
+            self.parser.parseError("unexpected-table-element-end-tag-in-select-in-table", {"name": token["name"]})
+            if self.tree.elementInScope(token["name"], variant="table"):
+                self.endTagOther(impliedTagToken("select"))
+                return token
+
+        def endTagOther(self, token):
+            return self.parser.phases["inSelect"].processEndTag(token)
+
+        startTagHandler = _utils.MethodDispatcher([
+            (("caption", "table", "tbody", "tfoot", "thead", "tr", "td", "th"),
+             startTagTable)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            (("caption", "table", "tbody", "tfoot", "thead", "tr", "td", "th"),
+             endTagTable)
+        ])
+        endTagHandler.default = endTagOther
+
+    class InForeignContentPhase(Phase):
+        __slots__ = tuple()
+
+        breakoutElements = frozenset(["b", "big", "blockquote", "body", "br",
+                                      "center", "code", "dd", "div", "dl", "dt",
+                                      "em", "embed", "h1", "h2", "h3",
+                                      "h4", "h5", "h6", "head", "hr", "i", "img",
+                                      "li", "listing", "menu", "meta", "nobr",
+                                      "ol", "p", "pre", "ruby", "s", "small",
+                                      "span", "strong", "strike", "sub", "sup",
+                                      "table", "tt", "u", "ul", "var"])
+
+        def adjustSVGTagNames(self, token):
+            replacements = {"altglyph": "altGlyph",
+                            "altglyphdef": "altGlyphDef",
+                            "altglyphitem": "altGlyphItem",
+                            "animatecolor": "animateColor",
+                            "animatemotion": "animateMotion",
+                            "animatetransform": "animateTransform",
+                            "clippath": "clipPath",
+                            "feblend": "feBlend",
+                            "fecolormatrix": "feColorMatrix",
+                            "fecomponenttransfer": "feComponentTransfer",
+                            "fecomposite": "feComposite",
+                            "feconvolvematrix": "feConvolveMatrix",
+                            "fediffuselighting": "feDiffuseLighting",
+                            "fedisplacementmap": "feDisplacementMap",
+                            "fedistantlight": "feDistantLight",
+                            "feflood": "feFlood",
+                            "fefunca": "feFuncA",
+                            "fefuncb": "feFuncB",
+                            "fefuncg": "feFuncG",
+                            "fefuncr": "feFuncR",
+                            "fegaussianblur": "feGaussianBlur",
+                            "feimage": "feImage",
+                            "femerge": "feMerge",
+                            "femergenode": "feMergeNode",
+                            "femorphology": "feMorphology",
+                            "feoffset": "feOffset",
+                            "fepointlight": "fePointLight",
+                            "fespecularlighting": "feSpecularLighting",
+                            "fespotlight": "feSpotLight",
+                            "fetile": "feTile",
+                            "feturbulence": "feTurbulence",
+                            "foreignobject": "foreignObject",
+                            "glyphref": "glyphRef",
+                            "lineargradient": "linearGradient",
+                            "radialgradient": "radialGradient",
+                            "textpath": "textPath"}
+
+            if token["name"] in replacements:
+                token["name"] = replacements[token["name"]]
+
+        def processCharacters(self, token):
+            if token["data"] == "\u0000":
+                token["data"] = "\uFFFD"
+            elif (self.parser.framesetOK and
+                  any(char not in spaceCharacters for char in token["data"])):
+                self.parser.framesetOK = False
+            Phase.processCharacters(self, token)
+
+        def processStartTag(self, token):
+            currentNode = self.tree.openElements[-1]
+            if (token["name"] in self.breakoutElements or
+                (token["name"] == "font" and
+                 set(token["data"].keys()) & {"color", "face", "size"})):
+                self.parser.parseError("unexpected-html-element-in-foreign-content",
+                                       {"name": token["name"]})
+                while (self.tree.openElements[-1].namespace !=
+                       self.tree.defaultNamespace and
+                       not self.parser.isHTMLIntegrationPoint(self.tree.openElements[-1]) and
+                       not self.parser.isMathMLTextIntegrationPoint(self.tree.openElements[-1])):
+                    self.tree.openElements.pop()
+                return token
+
+            else:
+                if currentNode.namespace == namespaces["mathml"]:
+                    self.parser.adjustMathMLAttributes(token)
+                elif currentNode.namespace == namespaces["svg"]:
+                    self.adjustSVGTagNames(token)
+                    self.parser.adjustSVGAttributes(token)
+                self.parser.adjustForeignAttributes(token)
+                token["namespace"] = currentNode.namespace
+                self.tree.insertElement(token)
+                if token["selfClosing"]:
+                    self.tree.openElements.pop()
+                    token["selfClosingAcknowledged"] = True
+
+        def processEndTag(self, token):
+            nodeIndex = len(self.tree.openElements) - 1
+            node = self.tree.openElements[-1]
+            if node.name.translate(asciiUpper2Lower) != token["name"]:
+                self.parser.parseError("unexpected-end-tag", {"name": token["name"]})
+
+            while True:
+                if node.name.translate(asciiUpper2Lower) == token["name"]:
+                    # XXX this isn't in the spec but it seems necessary
+                    if self.parser.phase == self.parser.phases["inTableText"]:
+                        self.parser.phase.flushCharacters()
+                        self.parser.phase = self.parser.phase.originalPhase
+                    while self.tree.openElements.pop() != node:
+                        assert self.tree.openElements
+                    new_token = None
+                    break
+                nodeIndex -= 1
+
+                node = self.tree.openElements[nodeIndex]
+                if node.namespace != self.tree.defaultNamespace:
+                    continue
+                else:
+                    new_token = self.parser.phase.processEndTag(token)
+                    break
+            return new_token
+
+    class AfterBodyPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            # Stop parsing
+            pass
+
+        def processComment(self, token):
+            # This is needed because data is to be appended to the <html> element
+            # here and not to whatever is currently open.
+            self.tree.insertComment(token, self.tree.openElements[0])
+
+        def processCharacters(self, token):
+            self.parser.parseError("unexpected-char-after-body")
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-start-tag-after-body",
+                                   {"name": token["name"]})
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        def endTagHtml(self, name):
+            if self.parser.innerHTML:
+                self.parser.parseError("unexpected-end-tag-after-body-innerhtml")
+            else:
+                self.parser.phase = self.parser.phases["afterAfterBody"]
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag-after-body",
+                                   {"name": token["name"]})
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([("html", endTagHtml)])
+        endTagHandler.default = endTagOther
+
+    class InFramesetPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#in-frameset
+        __slots__ = tuple()
+
+        def processEOF(self):
+            if self.tree.openElements[-1].name != "html":
+                self.parser.parseError("eof-in-frameset")
+            else:
+                assert self.parser.innerHTML
+
+        def processCharacters(self, token):
+            self.parser.parseError("unexpected-char-in-frameset")
+
+        def startTagFrameset(self, token):
+            self.tree.insertElement(token)
+
+        def startTagFrame(self, token):
+            self.tree.insertElement(token)
+            self.tree.openElements.pop()
+
+        def startTagNoframes(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-start-tag-in-frameset",
+                                   {"name": token["name"]})
+
+        def endTagFrameset(self, token):
+            if self.tree.openElements[-1].name == "html":
+                # innerHTML case
+                self.parser.parseError("unexpected-frameset-in-frameset-innerhtml")
+            else:
+                self.tree.openElements.pop()
+            if (not self.parser.innerHTML and
+                    self.tree.openElements[-1].name != "frameset"):
+                # If we're not in innerHTML mode and the current node is not a
+                # "frameset" element (anymore) then switch.
+                self.parser.phase = self.parser.phases["afterFrameset"]
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag-in-frameset",
+                                   {"name": token["name"]})
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("frameset", startTagFrameset),
+            ("frame", startTagFrame),
+            ("noframes", startTagNoframes)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("frameset", endTagFrameset)
+        ])
+        endTagHandler.default = endTagOther
+
+    class AfterFramesetPhase(Phase):
+        # http://www.whatwg.org/specs/web-apps/current-work/#after3
+        __slots__ = tuple()
+
+        def processEOF(self):
+            # Stop parsing
+            pass
+
+        def processCharacters(self, token):
+            self.parser.parseError("unexpected-char-after-frameset")
+
+        def startTagNoframes(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("unexpected-start-tag-after-frameset",
+                                   {"name": token["name"]})
+
+        def endTagHtml(self, token):
+            self.parser.phase = self.parser.phases["afterAfterFrameset"]
+
+        def endTagOther(self, token):
+            self.parser.parseError("unexpected-end-tag-after-frameset",
+                                   {"name": token["name"]})
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", Phase.startTagHtml),
+            ("noframes", startTagNoframes)
+        ])
+        startTagHandler.default = startTagOther
+
+        endTagHandler = _utils.MethodDispatcher([
+            ("html", endTagHtml)
+        ])
+        endTagHandler.default = endTagOther
+
+    class AfterAfterBodyPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            pass
+
+        def processComment(self, token):
+            self.tree.insertComment(token, self.tree.document)
+
+        def processSpaceCharacters(self, token):
+            return self.parser.phases["inBody"].processSpaceCharacters(token)
+
+        def processCharacters(self, token):
+            self.parser.parseError("expected-eof-but-got-char")
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("expected-eof-but-got-start-tag",
+                                   {"name": token["name"]})
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        def processEndTag(self, token):
+            self.parser.parseError("expected-eof-but-got-end-tag",
+                                   {"name": token["name"]})
+            self.parser.phase = self.parser.phases["inBody"]
+            return token
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml)
+        ])
+        startTagHandler.default = startTagOther
+
+    class AfterAfterFramesetPhase(Phase):
+        __slots__ = tuple()
+
+        def processEOF(self):
+            pass
+
+        def processComment(self, token):
+            self.tree.insertComment(token, self.tree.document)
+
+        def processSpaceCharacters(self, token):
+            return self.parser.phases["inBody"].processSpaceCharacters(token)
+
+        def processCharacters(self, token):
+            self.parser.parseError("expected-eof-but-got-char")
+
+        def startTagHtml(self, token):
+            return self.parser.phases["inBody"].processStartTag(token)
+
+        def startTagNoFrames(self, token):
+            return self.parser.phases["inHead"].processStartTag(token)
+
+        def startTagOther(self, token):
+            self.parser.parseError("expected-eof-but-got-start-tag",
+                                   {"name": token["name"]})
+
+        def processEndTag(self, token):
+            self.parser.parseError("expected-eof-but-got-end-tag",
+                                   {"name": token["name"]})
+
+        startTagHandler = _utils.MethodDispatcher([
+            ("html", startTagHtml),
+            ("noframes", startTagNoFrames)
+        ])
+        startTagHandler.default = startTagOther
+
+    # pylint:enable=unused-argument
+
+    return {
+        "initial": InitialPhase,
+        "beforeHtml": BeforeHtmlPhase,
+        "beforeHead": BeforeHeadPhase,
+        "inHead": InHeadPhase,
+        "inHeadNoscript": InHeadNoscriptPhase,
+        "afterHead": AfterHeadPhase,
+        "inBody": InBodyPhase,
+        "text": TextPhase,
+        "inTable": InTablePhase,
+        "inTableText": InTableTextPhase,
+        "inCaption": InCaptionPhase,
+        "inColumnGroup": InColumnGroupPhase,
+        "inTableBody": InTableBodyPhase,
+        "inRow": InRowPhase,
+        "inCell": InCellPhase,
+        "inSelect": InSelectPhase,
+        "inSelectInTable": InSelectInTablePhase,
+        "inForeignContent": InForeignContentPhase,
+        "afterBody": AfterBodyPhase,
+        "inFrameset": InFramesetPhase,
+        "afterFrameset": AfterFramesetPhase,
+        "afterAfterBody": AfterAfterBodyPhase,
+        "afterAfterFrameset": AfterAfterFramesetPhase,
+        # XXX after after frameset
+    }
+
+
+def adjust_attributes(token, replacements):
+    needs_adjustment = viewkeys(token['data']) & viewkeys(replacements)
+    if needs_adjustment:
+        token['data'] = type(token['data'])((replacements.get(k, k), v)
+                                            for k, v in token['data'].items())
+
+
+def impliedTagToken(name, type="EndTag", attributes=None,
+                    selfClosing=False):
+    if attributes is None:
+        attributes = {}
+    return {"type": tokenTypes[type], "name": name, "data": attributes,
+            "selfClosing": selfClosing}
+
+
+class ParseError(Exception):
+    """Error in parsed document"""
+    pass
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/serializer.py b/venv/Lib/site-packages/pip/_vendor/html5lib/serializer.py
new file mode 100644
index 000000000..d5669d8c1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/serializer.py
@@ -0,0 +1,409 @@
+from __future__ import absolute_import, division, unicode_literals
+from pip._vendor.six import text_type
+
+import re
+
+from codecs import register_error, xmlcharrefreplace_errors
+
+from .constants import voidElements, booleanAttributes, spaceCharacters
+from .constants import rcdataElements, entities, xmlEntities
+from . import treewalkers, _utils
+from xml.sax.saxutils import escape
+
+_quoteAttributeSpecChars = "".join(spaceCharacters) + "\"'=<>`"
+_quoteAttributeSpec = re.compile("[" + _quoteAttributeSpecChars + "]")
+_quoteAttributeLegacy = re.compile("[" + _quoteAttributeSpecChars +
+                                   "\x00\x01\x02\x03\x04\x05\x06\x07\x08\t\n"
+                                   "\x0b\x0c\r\x0e\x0f\x10\x11\x12\x13\x14\x15"
+                                   "\x16\x17\x18\x19\x1a\x1b\x1c\x1d\x1e\x1f"
+                                   "\x20\x2f\x60\xa0\u1680\u180e\u180f\u2000"
+                                   "\u2001\u2002\u2003\u2004\u2005\u2006\u2007"
+                                   "\u2008\u2009\u200a\u2028\u2029\u202f\u205f"
+                                   "\u3000]")
+
+
+_encode_entity_map = {}
+_is_ucs4 = len("\U0010FFFF") == 1
+for k, v in list(entities.items()):
+    # skip multi-character entities
+    if ((_is_ucs4 and len(v) > 1) or
+            (not _is_ucs4 and len(v) > 2)):
+        continue
+    if v != "&":
+        if len(v) == 2:
+            v = _utils.surrogatePairToCodepoint(v)
+        else:
+            v = ord(v)
+        if v not in _encode_entity_map or k.islower():
+            # prefer &lt; over &LT; and similarly for &amp;, &gt;, etc.
+            _encode_entity_map[v] = k
+
+
+def htmlentityreplace_errors(exc):
+    if isinstance(exc, (UnicodeEncodeError, UnicodeTranslateError)):
+        res = []
+        codepoints = []
+        skip = False
+        for i, c in enumerate(exc.object[exc.start:exc.end]):
+            if skip:
+                skip = False
+                continue
+            index = i + exc.start
+            if _utils.isSurrogatePair(exc.object[index:min([exc.end, index + 2])]):
+                codepoint = _utils.surrogatePairToCodepoint(exc.object[index:index + 2])
+                skip = True
+            else:
+                codepoint = ord(c)
+            codepoints.append(codepoint)
+        for cp in codepoints:
+            e = _encode_entity_map.get(cp)
+            if e:
+                res.append("&")
+                res.append(e)
+                if not e.endswith(";"):
+                    res.append(";")
+            else:
+                res.append("&#x%s;" % (hex(cp)[2:]))
+        return ("".join(res), exc.end)
+    else:
+        return xmlcharrefreplace_errors(exc)
+
+
+register_error("htmlentityreplace", htmlentityreplace_errors)
+
+
+def serialize(input, tree="etree", encoding=None, **serializer_opts):
+    """Serializes the input token stream using the specified treewalker
+
+    :arg input: the token stream to serialize
+
+    :arg tree: the treewalker to use
+
+    :arg encoding: the encoding to use
+
+    :arg serializer_opts: any options to pass to the
+        :py:class:`html5lib.serializer.HTMLSerializer` that gets created
+
+    :returns: the tree serialized as a string
+
+    Example:
+
+    >>> from html5lib.html5parser import parse
+    >>> from html5lib.serializer import serialize
+    >>> token_stream = parse('<html><body><p>Hi!</p></body></html>')
+    >>> serialize(token_stream, omit_optional_tags=False)
+    '<html><head></head><body><p>Hi!</p></body></html>'
+
+    """
+    # XXX: Should we cache this?
+    walker = treewalkers.getTreeWalker(tree)
+    s = HTMLSerializer(**serializer_opts)
+    return s.render(walker(input), encoding)
+
+
+class HTMLSerializer(object):
+
+    # attribute quoting options
+    quote_attr_values = "legacy"  # be secure by default
+    quote_char = '"'
+    use_best_quote_char = True
+
+    # tag syntax options
+    omit_optional_tags = True
+    minimize_boolean_attributes = True
+    use_trailing_solidus = False
+    space_before_trailing_solidus = True
+
+    # escaping options
+    escape_lt_in_attrs = False
+    escape_rcdata = False
+    resolve_entities = True
+
+    # miscellaneous options
+    alphabetical_attributes = False
+    inject_meta_charset = True
+    strip_whitespace = False
+    sanitize = False
+
+    options = ("quote_attr_values", "quote_char", "use_best_quote_char",
+               "omit_optional_tags", "minimize_boolean_attributes",
+               "use_trailing_solidus", "space_before_trailing_solidus",
+               "escape_lt_in_attrs", "escape_rcdata", "resolve_entities",
+               "alphabetical_attributes", "inject_meta_charset",
+               "strip_whitespace", "sanitize")
+
+    def __init__(self, **kwargs):
+        """Initialize HTMLSerializer
+
+        :arg inject_meta_charset: Whether or not to inject the meta charset.
+
+            Defaults to ``True``.
+
+        :arg quote_attr_values: Whether to quote attribute values that don't
+            require quoting per legacy browser behavior (``"legacy"``), when
+            required by the standard (``"spec"``), or always (``"always"``).
+
+            Defaults to ``"legacy"``.
+
+        :arg quote_char: Use given quote character for attribute quoting.
+
+            Defaults to ``"`` which will use double quotes unless attribute
+            value contains a double quote, in which case single quotes are
+            used.
+
+        :arg escape_lt_in_attrs: Whether or not to escape ``<`` in attribute
+            values.
+
+            Defaults to ``False``.
+
+        :arg escape_rcdata: Whether to escape characters that need to be
+            escaped within normal elements within rcdata elements such as
+            style.
+
+            Defaults to ``False``.
+
+        :arg resolve_entities: Whether to resolve named character entities that
+            appear in the source tree. The XML predefined entities &lt; &gt;
+            &amp; &quot; &apos; are unaffected by this setting.
+
+            Defaults to ``True``.
+
+        :arg strip_whitespace: Whether to remove semantically meaningless
+            whitespace. (This compresses all whitespace to a single space
+            except within ``pre``.)
+
+            Defaults to ``False``.
+
+        :arg minimize_boolean_attributes: Shortens boolean attributes to give
+            just the attribute value, for example::
+
+              <input disabled="disabled">
+
+            becomes::
+
+              <input disabled>
+
+            Defaults to ``True``.
+
+        :arg use_trailing_solidus: Includes a close-tag slash at the end of the
+            start tag of void elements (empty elements whose end tag is
+            forbidden). E.g. ``<hr/>``.
+
+            Defaults to ``False``.
+
+        :arg space_before_trailing_solidus: Places a space immediately before
+            the closing slash in a tag using a trailing solidus. E.g.
+            ``<hr />``. Requires ``use_trailing_solidus=True``.
+
+            Defaults to ``True``.
+
+        :arg sanitize: Strip all unsafe or unknown constructs from output.
+            See :py:class:`html5lib.filters.sanitizer.Filter`.
+
+            Defaults to ``False``.
+
+        :arg omit_optional_tags: Omit start/end tags that are optional.
+
+            Defaults to ``True``.
+
+        :arg alphabetical_attributes: Reorder attributes to be in alphabetical order.
+
+            Defaults to ``False``.
+
+        """
+        unexpected_args = frozenset(kwargs) - frozenset(self.options)
+        if len(unexpected_args) > 0:
+            raise TypeError("__init__() got an unexpected keyword argument '%s'" % next(iter(unexpected_args)))
+        if 'quote_char' in kwargs:
+            self.use_best_quote_char = False
+        for attr in self.options:
+            setattr(self, attr, kwargs.get(attr, getattr(self, attr)))
+        self.errors = []
+        self.strict = False
+
+    def encode(self, string):
+        assert(isinstance(string, text_type))
+        if self.encoding:
+            return string.encode(self.encoding, "htmlentityreplace")
+        else:
+            return string
+
+    def encodeStrict(self, string):
+        assert(isinstance(string, text_type))
+        if self.encoding:
+            return string.encode(self.encoding, "strict")
+        else:
+            return string
+
+    def serialize(self, treewalker, encoding=None):
+        # pylint:disable=too-many-nested-blocks
+        self.encoding = encoding
+        in_cdata = False
+        self.errors = []
+
+        if encoding and self.inject_meta_charset:
+            from .filters.inject_meta_charset import Filter
+            treewalker = Filter(treewalker, encoding)
+        # Alphabetical attributes is here under the assumption that none of
+        # the later filters add or change order of attributes; it needs to be
+        # before the sanitizer so escaped elements come out correctly
+        if self.alphabetical_attributes:
+            from .filters.alphabeticalattributes import Filter
+            treewalker = Filter(treewalker)
+        # WhitespaceFilter should be used before OptionalTagFilter
+        # for maximum efficiently of this latter filter
+        if self.strip_whitespace:
+            from .filters.whitespace import Filter
+            treewalker = Filter(treewalker)
+        if self.sanitize:
+            from .filters.sanitizer import Filter
+            treewalker = Filter(treewalker)
+        if self.omit_optional_tags:
+            from .filters.optionaltags import Filter
+            treewalker = Filter(treewalker)
+
+        for token in treewalker:
+            type = token["type"]
+            if type == "Doctype":
+                doctype = "<!DOCTYPE %s" % token["name"]
+
+                if token["publicId"]:
+                    doctype += ' PUBLIC "%s"' % token["publicId"]
+                elif token["systemId"]:
+                    doctype += " SYSTEM"
+                if token["systemId"]:
+                    if token["systemId"].find('"') >= 0:
+                        if token["systemId"].find("'") >= 0:
+                            self.serializeError("System identifier contains both single and double quote characters")
+                        quote_char = "'"
+                    else:
+                        quote_char = '"'
+                    doctype += " %s%s%s" % (quote_char, token["systemId"], quote_char)
+
+                doctype += ">"
+                yield self.encodeStrict(doctype)
+
+            elif type in ("Characters", "SpaceCharacters"):
+                if type == "SpaceCharacters" or in_cdata:
+                    if in_cdata and token["data"].find("</") >= 0:
+                        self.serializeError("Unexpected </ in CDATA")
+                    yield self.encode(token["data"])
+                else:
+                    yield self.encode(escape(token["data"]))
+
+            elif type in ("StartTag", "EmptyTag"):
+                name = token["name"]
+                yield self.encodeStrict("<%s" % name)
+                if name in rcdataElements and not self.escape_rcdata:
+                    in_cdata = True
+                elif in_cdata:
+                    self.serializeError("Unexpected child element of a CDATA element")
+                for (_, attr_name), attr_value in token["data"].items():
+                    # TODO: Add namespace support here
+                    k = attr_name
+                    v = attr_value
+                    yield self.encodeStrict(' ')
+
+                    yield self.encodeStrict(k)
+                    if not self.minimize_boolean_attributes or \
+                        (k not in booleanAttributes.get(name, tuple()) and
+                         k not in booleanAttributes.get("", tuple())):
+                        yield self.encodeStrict("=")
+                        if self.quote_attr_values == "always" or len(v) == 0:
+                            quote_attr = True
+                        elif self.quote_attr_values == "spec":
+                            quote_attr = _quoteAttributeSpec.search(v) is not None
+                        elif self.quote_attr_values == "legacy":
+                            quote_attr = _quoteAttributeLegacy.search(v) is not None
+                        else:
+                            raise ValueError("quote_attr_values must be one of: "
+                                             "'always', 'spec', or 'legacy'")
+                        v = v.replace("&", "&amp;")
+                        if self.escape_lt_in_attrs:
+                            v = v.replace("<", "&lt;")
+                        if quote_attr:
+                            quote_char = self.quote_char
+                            if self.use_best_quote_char:
+                                if "'" in v and '"' not in v:
+                                    quote_char = '"'
+                                elif '"' in v and "'" not in v:
+                                    quote_char = "'"
+                            if quote_char == "'":
+                                v = v.replace("'", "&#39;")
+                            else:
+                                v = v.replace('"', "&quot;")
+                            yield self.encodeStrict(quote_char)
+                            yield self.encode(v)
+                            yield self.encodeStrict(quote_char)
+                        else:
+                            yield self.encode(v)
+                if name in voidElements and self.use_trailing_solidus:
+                    if self.space_before_trailing_solidus:
+                        yield self.encodeStrict(" /")
+                    else:
+                        yield self.encodeStrict("/")
+                yield self.encode(">")
+
+            elif type == "EndTag":
+                name = token["name"]
+                if name in rcdataElements:
+                    in_cdata = False
+                elif in_cdata:
+                    self.serializeError("Unexpected child element of a CDATA element")
+                yield self.encodeStrict("</%s>" % name)
+
+            elif type == "Comment":
+                data = token["data"]
+                if data.find("--") >= 0:
+                    self.serializeError("Comment contains --")
+                yield self.encodeStrict("<!--%s-->" % token["data"])
+
+            elif type == "Entity":
+                name = token["name"]
+                key = name + ";"
+                if key not in entities:
+                    self.serializeError("Entity %s not recognized" % name)
+                if self.resolve_entities and key not in xmlEntities:
+                    data = entities[key]
+                else:
+                    data = "&%s;" % name
+                yield self.encodeStrict(data)
+
+            else:
+                self.serializeError(token["data"])
+
+    def render(self, treewalker, encoding=None):
+        """Serializes the stream from the treewalker into a string
+
+        :arg treewalker: the treewalker to serialize
+
+        :arg encoding: the string encoding to use
+
+        :returns: the serialized tree
+
+        Example:
+
+        >>> from html5lib import parse, getTreeWalker
+        >>> from html5lib.serializer import HTMLSerializer
+        >>> token_stream = parse('<html><body>Hi!</body></html>')
+        >>> walker = getTreeWalker('etree')
+        >>> serializer = HTMLSerializer(omit_optional_tags=False)
+        >>> serializer.render(walker(token_stream))
+        '<html><head></head><body>Hi!</body></html>'
+
+        """
+        if encoding:
+            return b"".join(list(self.serialize(treewalker, encoding)))
+        else:
+            return "".join(list(self.serialize(treewalker)))
+
+    def serializeError(self, data="XXX ERROR MESSAGE NEEDED"):
+        # XXX The idea is to make data mandatory.
+        self.errors.append(data)
+        if self.strict:
+            raise SerializeError
+
+
+class SerializeError(Exception):
+    """Error in serialized tree"""
+    pass
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__init__.py
new file mode 100644
index 000000000..7ef59590c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__init__.py
@@ -0,0 +1,30 @@
+"""Tree adapters let you convert from one tree structure to another
+
+Example:
+
+.. code-block:: python
+
+   from pip._vendor import html5lib
+   from pip._vendor.html5lib.treeadapters import genshi
+
+   doc = '<html><body>Hi!</body></html>'
+   treebuilder = html5lib.getTreeBuilder('etree')
+   parser = html5lib.HTMLParser(tree=treebuilder)
+   tree = parser.parse(doc)
+   TreeWalker = html5lib.getTreeWalker('etree')
+
+   genshi_tree = genshi.to_genshi(TreeWalker(tree))
+
+"""
+from __future__ import absolute_import, division, unicode_literals
+
+from . import sax
+
+__all__ = ["sax"]
+
+try:
+    from . import genshi  # noqa
+except ImportError:
+    pass
+else:
+    __all__.append("genshi")
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..d308f9be1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc
new file mode 100644
index 000000000..47ed75fd7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/genshi.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc
new file mode 100644
index 000000000..7dcfb5a67
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/__pycache__/sax.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/genshi.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/genshi.py
new file mode 100644
index 000000000..61d5fb6ac
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/genshi.py
@@ -0,0 +1,54 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from genshi.core import QName, Attrs
+from genshi.core import START, END, TEXT, COMMENT, DOCTYPE
+
+
+def to_genshi(walker):
+    """Convert a tree to a genshi tree
+
+    :arg walker: the treewalker to use to walk the tree to convert it
+
+    :returns: generator of genshi nodes
+
+    """
+    text = []
+    for token in walker:
+        type = token["type"]
+        if type in ("Characters", "SpaceCharacters"):
+            text.append(token["data"])
+        elif text:
+            yield TEXT, "".join(text), (None, -1, -1)
+            text = []
+
+        if type in ("StartTag", "EmptyTag"):
+            if token["namespace"]:
+                name = "{%s}%s" % (token["namespace"], token["name"])
+            else:
+                name = token["name"]
+            attrs = Attrs([(QName("{%s}%s" % attr if attr[0] is not None else attr[1]), value)
+                           for attr, value in token["data"].items()])
+            yield (START, (QName(name), attrs), (None, -1, -1))
+            if type == "EmptyTag":
+                type = "EndTag"
+
+        if type == "EndTag":
+            if token["namespace"]:
+                name = "{%s}%s" % (token["namespace"], token["name"])
+            else:
+                name = token["name"]
+
+            yield END, QName(name), (None, -1, -1)
+
+        elif type == "Comment":
+            yield COMMENT, token["data"], (None, -1, -1)
+
+        elif type == "Doctype":
+            yield DOCTYPE, (token["name"], token["publicId"],
+                            token["systemId"]), (None, -1, -1)
+
+        else:
+            pass  # FIXME: What to do?
+
+    if text:
+        yield TEXT, "".join(text), (None, -1, -1)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/sax.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/sax.py
new file mode 100644
index 000000000..f4ccea5a2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treeadapters/sax.py
@@ -0,0 +1,50 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from xml.sax.xmlreader import AttributesNSImpl
+
+from ..constants import adjustForeignAttributes, unadjustForeignAttributes
+
+prefix_mapping = {}
+for prefix, localName, namespace in adjustForeignAttributes.values():
+    if prefix is not None:
+        prefix_mapping[prefix] = namespace
+
+
+def to_sax(walker, handler):
+    """Call SAX-like content handler based on treewalker walker
+
+    :arg walker: the treewalker to use to walk the tree to convert it
+
+    :arg handler: SAX handler to use
+
+    """
+    handler.startDocument()
+    for prefix, namespace in prefix_mapping.items():
+        handler.startPrefixMapping(prefix, namespace)
+
+    for token in walker:
+        type = token["type"]
+        if type == "Doctype":
+            continue
+        elif type in ("StartTag", "EmptyTag"):
+            attrs = AttributesNSImpl(token["data"],
+                                     unadjustForeignAttributes)
+            handler.startElementNS((token["namespace"], token["name"]),
+                                   token["name"],
+                                   attrs)
+            if type == "EmptyTag":
+                handler.endElementNS((token["namespace"], token["name"]),
+                                     token["name"])
+        elif type == "EndTag":
+            handler.endElementNS((token["namespace"], token["name"]),
+                                 token["name"])
+        elif type in ("Characters", "SpaceCharacters"):
+            handler.characters(token["data"])
+        elif type == "Comment":
+            pass
+        else:
+            assert False, "Unknown token type"
+
+    for prefix, namespace in prefix_mapping.items():
+        handler.endPrefixMapping(prefix)
+    handler.endDocument()
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__init__.py
new file mode 100644
index 000000000..d44447eaf
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__init__.py
@@ -0,0 +1,88 @@
+"""A collection of modules for building different kinds of trees from HTML
+documents.
+
+To create a treebuilder for a new type of tree, you need to do
+implement several things:
+
+1. A set of classes for various types of elements: Document, Doctype, Comment,
+   Element. These must implement the interface of ``base.treebuilders.Node``
+   (although comment nodes have a different signature for their constructor,
+   see ``treebuilders.etree.Comment``) Textual content may also be implemented
+   as another node type, or not, as your tree implementation requires.
+
+2. A treebuilder object (called ``TreeBuilder`` by convention) that inherits
+   from ``treebuilders.base.TreeBuilder``. This has 4 required attributes:
+
+   * ``documentClass`` - the class to use for the bottommost node of a document
+   * ``elementClass`` - the class to use for HTML Elements
+   * ``commentClass`` - the class to use for comments
+   * ``doctypeClass`` - the class to use for doctypes
+
+   It also has one required method:
+
+   * ``getDocument`` - Returns the root node of the complete document tree
+
+3. If you wish to run the unit tests, you must also create a ``testSerializer``
+   method on your treebuilder which accepts a node and returns a string
+   containing Node and its children serialized according to the format used in
+   the unittests
+
+"""
+
+from __future__ import absolute_import, division, unicode_literals
+
+from .._utils import default_etree
+
+treeBuilderCache = {}
+
+
+def getTreeBuilder(treeType, implementation=None, **kwargs):
+    """Get a TreeBuilder class for various types of trees with built-in support
+
+    :arg treeType: the name of the tree type required (case-insensitive). Supported
+        values are:
+
+        * "dom" - A generic builder for DOM implementations, defaulting to a
+          xml.dom.minidom based implementation.
+        * "etree" - A generic builder for tree implementations exposing an
+          ElementTree-like interface, defaulting to xml.etree.cElementTree if
+          available and xml.etree.ElementTree if not.
+        * "lxml" - A etree-based builder for lxml.etree, handling limitations
+          of lxml's implementation.
+
+    :arg implementation: (Currently applies to the "etree" and "dom" tree
+        types). A module implementing the tree type e.g. xml.etree.ElementTree
+        or xml.etree.cElementTree.
+
+    :arg kwargs: Any additional options to pass to the TreeBuilder when
+        creating it.
+
+    Example:
+
+    >>> from html5lib.treebuilders import getTreeBuilder
+    >>> builder = getTreeBuilder('etree')
+
+    """
+
+    treeType = treeType.lower()
+    if treeType not in treeBuilderCache:
+        if treeType == "dom":
+            from . import dom
+            # Come up with a sane default (pref. from the stdlib)
+            if implementation is None:
+                from xml.dom import minidom
+                implementation = minidom
+            # NEVER cache here, caching is done in the dom submodule
+            return dom.getDomModule(implementation, **kwargs).TreeBuilder
+        elif treeType == "lxml":
+            from . import etree_lxml
+            treeBuilderCache[treeType] = etree_lxml.TreeBuilder
+        elif treeType == "etree":
+            from . import etree
+            if implementation is None:
+                implementation = default_etree
+            # NEVER cache here, caching is done in the etree submodule
+            return etree.getETreeModule(implementation, **kwargs).TreeBuilder
+        else:
+            raise ValueError("""Unrecognised treebuilder "%s" """ % treeType)
+    return treeBuilderCache.get(treeType)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..a4530e679
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..2fe99fc78
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc
new file mode 100644
index 000000000..1e8f2fd14
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/dom.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc
new file mode 100644
index 000000000..59a68b5db
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc
new file mode 100644
index 000000000..c8c7c55e8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/__pycache__/etree_lxml.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/base.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/base.py
new file mode 100644
index 000000000..965fce29d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/base.py
@@ -0,0 +1,417 @@
+from __future__ import absolute_import, division, unicode_literals
+from pip._vendor.six import text_type
+
+from ..constants import scopingElements, tableInsertModeElements, namespaces
+
+# The scope markers are inserted when entering object elements,
+# marquees, table cells, and table captions, and are used to prevent formatting
+# from "leaking" into tables, object elements, and marquees.
+Marker = None
+
+listElementsMap = {
+    None: (frozenset(scopingElements), False),
+    "button": (frozenset(scopingElements | {(namespaces["html"], "button")}), False),
+    "list": (frozenset(scopingElements | {(namespaces["html"], "ol"),
+                                          (namespaces["html"], "ul")}), False),
+    "table": (frozenset([(namespaces["html"], "html"),
+                         (namespaces["html"], "table")]), False),
+    "select": (frozenset([(namespaces["html"], "optgroup"),
+                          (namespaces["html"], "option")]), True)
+}
+
+
+class Node(object):
+    """Represents an item in the tree"""
+    def __init__(self, name):
+        """Creates a Node
+
+        :arg name: The tag name associated with the node
+
+        """
+        # The tag name associated with the node
+        self.name = name
+        # The parent of the current node (or None for the document node)
+        self.parent = None
+        # The value of the current node (applies to text nodes and comments)
+        self.value = None
+        # A dict holding name -> value pairs for attributes of the node
+        self.attributes = {}
+        # A list of child nodes of the current node. This must include all
+        # elements but not necessarily other node types.
+        self.childNodes = []
+        # A list of miscellaneous flags that can be set on the node.
+        self._flags = []
+
+    def __str__(self):
+        attributesStr = " ".join(["%s=\"%s\"" % (name, value)
+                                  for name, value in
+                                  self.attributes.items()])
+        if attributesStr:
+            return "<%s %s>" % (self.name, attributesStr)
+        else:
+            return "<%s>" % (self.name)
+
+    def __repr__(self):
+        return "<%s>" % (self.name)
+
+    def appendChild(self, node):
+        """Insert node as a child of the current node
+
+        :arg node: the node to insert
+
+        """
+        raise NotImplementedError
+
+    def insertText(self, data, insertBefore=None):
+        """Insert data as text in the current node, positioned before the
+        start of node insertBefore or to the end of the node's text.
+
+        :arg data: the data to insert
+
+        :arg insertBefore: True if you want to insert the text before the node
+            and False if you want to insert it after the node
+
+        """
+        raise NotImplementedError
+
+    def insertBefore(self, node, refNode):
+        """Insert node as a child of the current node, before refNode in the
+        list of child nodes. Raises ValueError if refNode is not a child of
+        the current node
+
+        :arg node: the node to insert
+
+        :arg refNode: the child node to insert the node before
+
+        """
+        raise NotImplementedError
+
+    def removeChild(self, node):
+        """Remove node from the children of the current node
+
+        :arg node: the child node to remove
+
+        """
+        raise NotImplementedError
+
+    def reparentChildren(self, newParent):
+        """Move all the children of the current node to newParent.
+        This is needed so that trees that don't store text as nodes move the
+        text in the correct way
+
+        :arg newParent: the node to move all this node's children to
+
+        """
+        # XXX - should this method be made more general?
+        for child in self.childNodes:
+            newParent.appendChild(child)
+        self.childNodes = []
+
+    def cloneNode(self):
+        """Return a shallow copy of the current node i.e. a node with the same
+        name and attributes but with no parent or child nodes
+        """
+        raise NotImplementedError
+
+    def hasContent(self):
+        """Return true if the node has children or text, false otherwise
+        """
+        raise NotImplementedError
+
+
+class ActiveFormattingElements(list):
+    def append(self, node):
+        equalCount = 0
+        if node != Marker:
+            for element in self[::-1]:
+                if element == Marker:
+                    break
+                if self.nodesEqual(element, node):
+                    equalCount += 1
+                if equalCount == 3:
+                    self.remove(element)
+                    break
+        list.append(self, node)
+
+    def nodesEqual(self, node1, node2):
+        if not node1.nameTuple == node2.nameTuple:
+            return False
+
+        if not node1.attributes == node2.attributes:
+            return False
+
+        return True
+
+
+class TreeBuilder(object):
+    """Base treebuilder implementation
+
+    * documentClass - the class to use for the bottommost node of a document
+    * elementClass - the class to use for HTML Elements
+    * commentClass - the class to use for comments
+    * doctypeClass - the class to use for doctypes
+
+    """
+    # pylint:disable=not-callable
+
+    # Document class
+    documentClass = None
+
+    # The class to use for creating a node
+    elementClass = None
+
+    # The class to use for creating comments
+    commentClass = None
+
+    # The class to use for creating doctypes
+    doctypeClass = None
+
+    # Fragment class
+    fragmentClass = None
+
+    def __init__(self, namespaceHTMLElements):
+        """Create a TreeBuilder
+
+        :arg namespaceHTMLElements: whether or not to namespace HTML elements
+
+        """
+        if namespaceHTMLElements:
+            self.defaultNamespace = "http://www.w3.org/1999/xhtml"
+        else:
+            self.defaultNamespace = None
+        self.reset()
+
+    def reset(self):
+        self.openElements = []
+        self.activeFormattingElements = ActiveFormattingElements()
+
+        # XXX - rename these to headElement, formElement
+        self.headPointer = None
+        self.formPointer = None
+
+        self.insertFromTable = False
+
+        self.document = self.documentClass()
+
+    def elementInScope(self, target, variant=None):
+
+        # If we pass a node in we match that. if we pass a string
+        # match any node with that name
+        exactNode = hasattr(target, "nameTuple")
+        if not exactNode:
+            if isinstance(target, text_type):
+                target = (namespaces["html"], target)
+            assert isinstance(target, tuple)
+
+        listElements, invert = listElementsMap[variant]
+
+        for node in reversed(self.openElements):
+            if exactNode and node == target:
+                return True
+            elif not exactNode and node.nameTuple == target:
+                return True
+            elif (invert ^ (node.nameTuple in listElements)):
+                return False
+
+        assert False  # We should never reach this point
+
+    def reconstructActiveFormattingElements(self):
+        # Within this algorithm the order of steps described in the
+        # specification is not quite the same as the order of steps in the
+        # code. It should still do the same though.
+
+        # Step 1: stop the algorithm when there's nothing to do.
+        if not self.activeFormattingElements:
+            return
+
+        # Step 2 and step 3: we start with the last element. So i is -1.
+        i = len(self.activeFormattingElements) - 1
+        entry = self.activeFormattingElements[i]
+        if entry == Marker or entry in self.openElements:
+            return
+
+        # Step 6
+        while entry != Marker and entry not in self.openElements:
+            if i == 0:
+                # This will be reset to 0 below
+                i = -1
+                break
+            i -= 1
+            # Step 5: let entry be one earlier in the list.
+            entry = self.activeFormattingElements[i]
+
+        while True:
+            # Step 7
+            i += 1
+
+            # Step 8
+            entry = self.activeFormattingElements[i]
+            clone = entry.cloneNode()  # Mainly to get a new copy of the attributes
+
+            # Step 9
+            element = self.insertElement({"type": "StartTag",
+                                          "name": clone.name,
+                                          "namespace": clone.namespace,
+                                          "data": clone.attributes})
+
+            # Step 10
+            self.activeFormattingElements[i] = element
+
+            # Step 11
+            if element == self.activeFormattingElements[-1]:
+                break
+
+    def clearActiveFormattingElements(self):
+        entry = self.activeFormattingElements.pop()
+        while self.activeFormattingElements and entry != Marker:
+            entry = self.activeFormattingElements.pop()
+
+    def elementInActiveFormattingElements(self, name):
+        """Check if an element exists between the end of the active
+        formatting elements and the last marker. If it does, return it, else
+        return false"""
+
+        for item in self.activeFormattingElements[::-1]:
+            # Check for Marker first because if it's a Marker it doesn't have a
+            # name attribute.
+            if item == Marker:
+                break
+            elif item.name == name:
+                return item
+        return False
+
+    def insertRoot(self, token):
+        element = self.createElement(token)
+        self.openElements.append(element)
+        self.document.appendChild(element)
+
+    def insertDoctype(self, token):
+        name = token["name"]
+        publicId = token["publicId"]
+        systemId = token["systemId"]
+
+        doctype = self.doctypeClass(name, publicId, systemId)
+        self.document.appendChild(doctype)
+
+    def insertComment(self, token, parent=None):
+        if parent is None:
+            parent = self.openElements[-1]
+        parent.appendChild(self.commentClass(token["data"]))
+
+    def createElement(self, token):
+        """Create an element but don't insert it anywhere"""
+        name = token["name"]
+        namespace = token.get("namespace", self.defaultNamespace)
+        element = self.elementClass(name, namespace)
+        element.attributes = token["data"]
+        return element
+
+    def _getInsertFromTable(self):
+        return self._insertFromTable
+
+    def _setInsertFromTable(self, value):
+        """Switch the function used to insert an element from the
+        normal one to the misnested table one and back again"""
+        self._insertFromTable = value
+        if value:
+            self.insertElement = self.insertElementTable
+        else:
+            self.insertElement = self.insertElementNormal
+
+    insertFromTable = property(_getInsertFromTable, _setInsertFromTable)
+
+    def insertElementNormal(self, token):
+        name = token["name"]
+        assert isinstance(name, text_type), "Element %s not unicode" % name
+        namespace = token.get("namespace", self.defaultNamespace)
+        element = self.elementClass(name, namespace)
+        element.attributes = token["data"]
+        self.openElements[-1].appendChild(element)
+        self.openElements.append(element)
+        return element
+
+    def insertElementTable(self, token):
+        """Create an element and insert it into the tree"""
+        element = self.createElement(token)
+        if self.openElements[-1].name not in tableInsertModeElements:
+            return self.insertElementNormal(token)
+        else:
+            # We should be in the InTable mode. This means we want to do
+            # special magic element rearranging
+            parent, insertBefore = self.getTableMisnestedNodePosition()
+            if insertBefore is None:
+                parent.appendChild(element)
+            else:
+                parent.insertBefore(element, insertBefore)
+            self.openElements.append(element)
+        return element
+
+    def insertText(self, data, parent=None):
+        """Insert text data."""
+        if parent is None:
+            parent = self.openElements[-1]
+
+        if (not self.insertFromTable or (self.insertFromTable and
+                                         self.openElements[-1].name
+                                         not in tableInsertModeElements)):
+            parent.insertText(data)
+        else:
+            # We should be in the InTable mode. This means we want to do
+            # special magic element rearranging
+            parent, insertBefore = self.getTableMisnestedNodePosition()
+            parent.insertText(data, insertBefore)
+
+    def getTableMisnestedNodePosition(self):
+        """Get the foster parent element, and sibling to insert before
+        (or None) when inserting a misnested table node"""
+        # The foster parent element is the one which comes before the most
+        # recently opened table element
+        # XXX - this is really inelegant
+        lastTable = None
+        fosterParent = None
+        insertBefore = None
+        for elm in self.openElements[::-1]:
+            if elm.name == "table":
+                lastTable = elm
+                break
+        if lastTable:
+            # XXX - we should really check that this parent is actually a
+            # node here
+            if lastTable.parent:
+                fosterParent = lastTable.parent
+                insertBefore = lastTable
+            else:
+                fosterParent = self.openElements[
+                    self.openElements.index(lastTable) - 1]
+        else:
+            fosterParent = self.openElements[0]
+        return fosterParent, insertBefore
+
+    def generateImpliedEndTags(self, exclude=None):
+        name = self.openElements[-1].name
+        # XXX td, th and tr are not actually needed
+        if (name in frozenset(("dd", "dt", "li", "option", "optgroup", "p", "rp", "rt")) and
+                name != exclude):
+            self.openElements.pop()
+            # XXX This is not entirely what the specification says. We should
+            # investigate it more closely.
+            self.generateImpliedEndTags(exclude)
+
+    def getDocument(self):
+        """Return the final tree"""
+        return self.document
+
+    def getFragment(self):
+        """Return the final fragment"""
+        # assert self.innerHTML
+        fragment = self.fragmentClass()
+        self.openElements[0].reparentChildren(fragment)
+        return fragment
+
+    def testSerializer(self, node):
+        """Serialize the subtree of node in the format required by unit tests
+
+        :arg node: the node from which to start serializing
+
+        """
+        raise NotImplementedError
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/dom.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/dom.py
new file mode 100644
index 000000000..d8b530046
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/dom.py
@@ -0,0 +1,239 @@
+from __future__ import absolute_import, division, unicode_literals
+
+
+try:
+    from collections.abc import MutableMapping
+except ImportError:  # Python 2.7
+    from collections import MutableMapping
+from xml.dom import minidom, Node
+import weakref
+
+from . import base
+from .. import constants
+from ..constants import namespaces
+from .._utils import moduleFactoryFactory
+
+
+def getDomBuilder(DomImplementation):
+    Dom = DomImplementation
+
+    class AttrList(MutableMapping):
+        def __init__(self, element):
+            self.element = element
+
+        def __iter__(self):
+            return iter(self.element.attributes.keys())
+
+        def __setitem__(self, name, value):
+            if isinstance(name, tuple):
+                raise NotImplementedError
+            else:
+                attr = self.element.ownerDocument.createAttribute(name)
+                attr.value = value
+                self.element.attributes[name] = attr
+
+        def __len__(self):
+            return len(self.element.attributes)
+
+        def items(self):
+            return list(self.element.attributes.items())
+
+        def values(self):
+            return list(self.element.attributes.values())
+
+        def __getitem__(self, name):
+            if isinstance(name, tuple):
+                raise NotImplementedError
+            else:
+                return self.element.attributes[name].value
+
+        def __delitem__(self, name):
+            if isinstance(name, tuple):
+                raise NotImplementedError
+            else:
+                del self.element.attributes[name]
+
+    class NodeBuilder(base.Node):
+        def __init__(self, element):
+            base.Node.__init__(self, element.nodeName)
+            self.element = element
+
+        namespace = property(lambda self: hasattr(self.element, "namespaceURI") and
+                             self.element.namespaceURI or None)
+
+        def appendChild(self, node):
+            node.parent = self
+            self.element.appendChild(node.element)
+
+        def insertText(self, data, insertBefore=None):
+            text = self.element.ownerDocument.createTextNode(data)
+            if insertBefore:
+                self.element.insertBefore(text, insertBefore.element)
+            else:
+                self.element.appendChild(text)
+
+        def insertBefore(self, node, refNode):
+            self.element.insertBefore(node.element, refNode.element)
+            node.parent = self
+
+        def removeChild(self, node):
+            if node.element.parentNode == self.element:
+                self.element.removeChild(node.element)
+            node.parent = None
+
+        def reparentChildren(self, newParent):
+            while self.element.hasChildNodes():
+                child = self.element.firstChild
+                self.element.removeChild(child)
+                newParent.element.appendChild(child)
+            self.childNodes = []
+
+        def getAttributes(self):
+            return AttrList(self.element)
+
+        def setAttributes(self, attributes):
+            if attributes:
+                for name, value in list(attributes.items()):
+                    if isinstance(name, tuple):
+                        if name[0] is not None:
+                            qualifiedName = (name[0] + ":" + name[1])
+                        else:
+                            qualifiedName = name[1]
+                        self.element.setAttributeNS(name[2], qualifiedName,
+                                                    value)
+                    else:
+                        self.element.setAttribute(
+                            name, value)
+        attributes = property(getAttributes, setAttributes)
+
+        def cloneNode(self):
+            return NodeBuilder(self.element.cloneNode(False))
+
+        def hasContent(self):
+            return self.element.hasChildNodes()
+
+        def getNameTuple(self):
+            if self.namespace is None:
+                return namespaces["html"], self.name
+            else:
+                return self.namespace, self.name
+
+        nameTuple = property(getNameTuple)
+
+    class TreeBuilder(base.TreeBuilder):  # pylint:disable=unused-variable
+        def documentClass(self):
+            self.dom = Dom.getDOMImplementation().createDocument(None, None, None)
+            return weakref.proxy(self)
+
+        def insertDoctype(self, token):
+            name = token["name"]
+            publicId = token["publicId"]
+            systemId = token["systemId"]
+
+            domimpl = Dom.getDOMImplementation()
+            doctype = domimpl.createDocumentType(name, publicId, systemId)
+            self.document.appendChild(NodeBuilder(doctype))
+            if Dom == minidom:
+                doctype.ownerDocument = self.dom
+
+        def elementClass(self, name, namespace=None):
+            if namespace is None and self.defaultNamespace is None:
+                node = self.dom.createElement(name)
+            else:
+                node = self.dom.createElementNS(namespace, name)
+
+            return NodeBuilder(node)
+
+        def commentClass(self, data):
+            return NodeBuilder(self.dom.createComment(data))
+
+        def fragmentClass(self):
+            return NodeBuilder(self.dom.createDocumentFragment())
+
+        def appendChild(self, node):
+            self.dom.appendChild(node.element)
+
+        def testSerializer(self, element):
+            return testSerializer(element)
+
+        def getDocument(self):
+            return self.dom
+
+        def getFragment(self):
+            return base.TreeBuilder.getFragment(self).element
+
+        def insertText(self, data, parent=None):
+            data = data
+            if parent != self:
+                base.TreeBuilder.insertText(self, data, parent)
+            else:
+                # HACK: allow text nodes as children of the document node
+                if hasattr(self.dom, '_child_node_types'):
+                    # pylint:disable=protected-access
+                    if Node.TEXT_NODE not in self.dom._child_node_types:
+                        self.dom._child_node_types = list(self.dom._child_node_types)
+                        self.dom._child_node_types.append(Node.TEXT_NODE)
+                self.dom.appendChild(self.dom.createTextNode(data))
+
+        implementation = DomImplementation
+        name = None
+
+    def testSerializer(element):
+        element.normalize()
+        rv = []
+
+        def serializeElement(element, indent=0):
+            if element.nodeType == Node.DOCUMENT_TYPE_NODE:
+                if element.name:
+                    if element.publicId or element.systemId:
+                        publicId = element.publicId or ""
+                        systemId = element.systemId or ""
+                        rv.append("""|%s<!DOCTYPE %s "%s" "%s">""" %
+                                  (' ' * indent, element.name, publicId, systemId))
+                    else:
+                        rv.append("|%s<!DOCTYPE %s>" % (' ' * indent, element.name))
+                else:
+                    rv.append("|%s<!DOCTYPE >" % (' ' * indent,))
+            elif element.nodeType == Node.DOCUMENT_NODE:
+                rv.append("#document")
+            elif element.nodeType == Node.DOCUMENT_FRAGMENT_NODE:
+                rv.append("#document-fragment")
+            elif element.nodeType == Node.COMMENT_NODE:
+                rv.append("|%s<!-- %s -->" % (' ' * indent, element.nodeValue))
+            elif element.nodeType == Node.TEXT_NODE:
+                rv.append("|%s\"%s\"" % (' ' * indent, element.nodeValue))
+            else:
+                if (hasattr(element, "namespaceURI") and
+                        element.namespaceURI is not None):
+                    name = "%s %s" % (constants.prefixes[element.namespaceURI],
+                                      element.nodeName)
+                else:
+                    name = element.nodeName
+                rv.append("|%s<%s>" % (' ' * indent, name))
+                if element.hasAttributes():
+                    attributes = []
+                    for i in range(len(element.attributes)):
+                        attr = element.attributes.item(i)
+                        name = attr.nodeName
+                        value = attr.value
+                        ns = attr.namespaceURI
+                        if ns:
+                            name = "%s %s" % (constants.prefixes[ns], attr.localName)
+                        else:
+                            name = attr.nodeName
+                        attributes.append((name, value))
+
+                    for name, value in sorted(attributes):
+                        rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
+            indent += 2
+            for child in element.childNodes:
+                serializeElement(child, indent)
+        serializeElement(element, 0)
+
+        return "\n".join(rv)
+
+    return locals()
+
+
+# The actual means to get a module!
+getDomModule = moduleFactoryFactory(getDomBuilder)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree.py
new file mode 100644
index 000000000..ea92dc301
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree.py
@@ -0,0 +1,343 @@
+from __future__ import absolute_import, division, unicode_literals
+# pylint:disable=protected-access
+
+from pip._vendor.six import text_type
+
+import re
+
+from copy import copy
+
+from . import base
+from .. import _ihatexml
+from .. import constants
+from ..constants import namespaces
+from .._utils import moduleFactoryFactory
+
+tag_regexp = re.compile("{([^}]*)}(.*)")
+
+
+def getETreeBuilder(ElementTreeImplementation, fullTree=False):
+    ElementTree = ElementTreeImplementation
+    ElementTreeCommentType = ElementTree.Comment("asd").tag
+
+    class Element(base.Node):
+        def __init__(self, name, namespace=None):
+            self._name = name
+            self._namespace = namespace
+            self._element = ElementTree.Element(self._getETreeTag(name,
+                                                                  namespace))
+            if namespace is None:
+                self.nameTuple = namespaces["html"], self._name
+            else:
+                self.nameTuple = self._namespace, self._name
+            self.parent = None
+            self._childNodes = []
+            self._flags = []
+
+        def _getETreeTag(self, name, namespace):
+            if namespace is None:
+                etree_tag = name
+            else:
+                etree_tag = "{%s}%s" % (namespace, name)
+            return etree_tag
+
+        def _setName(self, name):
+            self._name = name
+            self._element.tag = self._getETreeTag(self._name, self._namespace)
+
+        def _getName(self):
+            return self._name
+
+        name = property(_getName, _setName)
+
+        def _setNamespace(self, namespace):
+            self._namespace = namespace
+            self._element.tag = self._getETreeTag(self._name, self._namespace)
+
+        def _getNamespace(self):
+            return self._namespace
+
+        namespace = property(_getNamespace, _setNamespace)
+
+        def _getAttributes(self):
+            return self._element.attrib
+
+        def _setAttributes(self, attributes):
+            el_attrib = self._element.attrib
+            el_attrib.clear()
+            if attributes:
+                # calling .items _always_ allocates, and the above truthy check is cheaper than the
+                # allocation on average
+                for key, value in attributes.items():
+                    if isinstance(key, tuple):
+                        name = "{%s}%s" % (key[2], key[1])
+                    else:
+                        name = key
+                    el_attrib[name] = value
+
+        attributes = property(_getAttributes, _setAttributes)
+
+        def _getChildNodes(self):
+            return self._childNodes
+
+        def _setChildNodes(self, value):
+            del self._element[:]
+            self._childNodes = []
+            for element in value:
+                self.insertChild(element)
+
+        childNodes = property(_getChildNodes, _setChildNodes)
+
+        def hasContent(self):
+            """Return true if the node has children or text"""
+            return bool(self._element.text or len(self._element))
+
+        def appendChild(self, node):
+            self._childNodes.append(node)
+            self._element.append(node._element)
+            node.parent = self
+
+        def insertBefore(self, node, refNode):
+            index = list(self._element).index(refNode._element)
+            self._element.insert(index, node._element)
+            node.parent = self
+
+        def removeChild(self, node):
+            self._childNodes.remove(node)
+            self._element.remove(node._element)
+            node.parent = None
+
+        def insertText(self, data, insertBefore=None):
+            if not(len(self._element)):
+                if not self._element.text:
+                    self._element.text = ""
+                self._element.text += data
+            elif insertBefore is None:
+                # Insert the text as the tail of the last child element
+                if not self._element[-1].tail:
+                    self._element[-1].tail = ""
+                self._element[-1].tail += data
+            else:
+                # Insert the text before the specified node
+                children = list(self._element)
+                index = children.index(insertBefore._element)
+                if index > 0:
+                    if not self._element[index - 1].tail:
+                        self._element[index - 1].tail = ""
+                    self._element[index - 1].tail += data
+                else:
+                    if not self._element.text:
+                        self._element.text = ""
+                    self._element.text += data
+
+        def cloneNode(self):
+            element = type(self)(self.name, self.namespace)
+            if self._element.attrib:
+                element._element.attrib = copy(self._element.attrib)
+            return element
+
+        def reparentChildren(self, newParent):
+            if newParent.childNodes:
+                newParent.childNodes[-1]._element.tail += self._element.text
+            else:
+                if not newParent._element.text:
+                    newParent._element.text = ""
+                if self._element.text is not None:
+                    newParent._element.text += self._element.text
+            self._element.text = ""
+            base.Node.reparentChildren(self, newParent)
+
+    class Comment(Element):
+        def __init__(self, data):
+            # Use the superclass constructor to set all properties on the
+            # wrapper element
+            self._element = ElementTree.Comment(data)
+            self.parent = None
+            self._childNodes = []
+            self._flags = []
+
+        def _getData(self):
+            return self._element.text
+
+        def _setData(self, value):
+            self._element.text = value
+
+        data = property(_getData, _setData)
+
+    class DocumentType(Element):
+        def __init__(self, name, publicId, systemId):
+            Element.__init__(self, "<!DOCTYPE>")
+            self._element.text = name
+            self.publicId = publicId
+            self.systemId = systemId
+
+        def _getPublicId(self):
+            return self._element.get("publicId", "")
+
+        def _setPublicId(self, value):
+            if value is not None:
+                self._element.set("publicId", value)
+
+        publicId = property(_getPublicId, _setPublicId)
+
+        def _getSystemId(self):
+            return self._element.get("systemId", "")
+
+        def _setSystemId(self, value):
+            if value is not None:
+                self._element.set("systemId", value)
+
+        systemId = property(_getSystemId, _setSystemId)
+
+    class Document(Element):
+        def __init__(self):
+            Element.__init__(self, "DOCUMENT_ROOT")
+
+    class DocumentFragment(Element):
+        def __init__(self):
+            Element.__init__(self, "DOCUMENT_FRAGMENT")
+
+    def testSerializer(element):
+        rv = []
+
+        def serializeElement(element, indent=0):
+            if not(hasattr(element, "tag")):
+                element = element.getroot()
+            if element.tag == "<!DOCTYPE>":
+                if element.get("publicId") or element.get("systemId"):
+                    publicId = element.get("publicId") or ""
+                    systemId = element.get("systemId") or ""
+                    rv.append("""<!DOCTYPE %s "%s" "%s">""" %
+                              (element.text, publicId, systemId))
+                else:
+                    rv.append("<!DOCTYPE %s>" % (element.text,))
+            elif element.tag == "DOCUMENT_ROOT":
+                rv.append("#document")
+                if element.text is not None:
+                    rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
+                if element.tail is not None:
+                    raise TypeError("Document node cannot have tail")
+                if hasattr(element, "attrib") and len(element.attrib):
+                    raise TypeError("Document node cannot have attributes")
+            elif element.tag == ElementTreeCommentType:
+                rv.append("|%s<!-- %s -->" % (' ' * indent, element.text))
+            else:
+                assert isinstance(element.tag, text_type), \
+                    "Expected unicode, got %s, %s" % (type(element.tag), element.tag)
+                nsmatch = tag_regexp.match(element.tag)
+
+                if nsmatch is None:
+                    name = element.tag
+                else:
+                    ns, name = nsmatch.groups()
+                    prefix = constants.prefixes[ns]
+                    name = "%s %s" % (prefix, name)
+                rv.append("|%s<%s>" % (' ' * indent, name))
+
+                if hasattr(element, "attrib"):
+                    attributes = []
+                    for name, value in element.attrib.items():
+                        nsmatch = tag_regexp.match(name)
+                        if nsmatch is not None:
+                            ns, name = nsmatch.groups()
+                            prefix = constants.prefixes[ns]
+                            attr_string = "%s %s" % (prefix, name)
+                        else:
+                            attr_string = name
+                        attributes.append((attr_string, value))
+
+                    for name, value in sorted(attributes):
+                        rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
+                if element.text:
+                    rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
+            indent += 2
+            for child in element:
+                serializeElement(child, indent)
+            if element.tail:
+                rv.append("|%s\"%s\"" % (' ' * (indent - 2), element.tail))
+        serializeElement(element, 0)
+
+        return "\n".join(rv)
+
+    def tostring(element):  # pylint:disable=unused-variable
+        """Serialize an element and its child nodes to a string"""
+        rv = []
+        filter = _ihatexml.InfosetFilter()
+
+        def serializeElement(element):
+            if isinstance(element, ElementTree.ElementTree):
+                element = element.getroot()
+
+            if element.tag == "<!DOCTYPE>":
+                if element.get("publicId") or element.get("systemId"):
+                    publicId = element.get("publicId") or ""
+                    systemId = element.get("systemId") or ""
+                    rv.append("""<!DOCTYPE %s PUBLIC "%s" "%s">""" %
+                              (element.text, publicId, systemId))
+                else:
+                    rv.append("<!DOCTYPE %s>" % (element.text,))
+            elif element.tag == "DOCUMENT_ROOT":
+                if element.text is not None:
+                    rv.append(element.text)
+                if element.tail is not None:
+                    raise TypeError("Document node cannot have tail")
+                if hasattr(element, "attrib") and len(element.attrib):
+                    raise TypeError("Document node cannot have attributes")
+
+                for child in element:
+                    serializeElement(child)
+
+            elif element.tag == ElementTreeCommentType:
+                rv.append("<!--%s-->" % (element.text,))
+            else:
+                # This is assumed to be an ordinary element
+                if not element.attrib:
+                    rv.append("<%s>" % (filter.fromXmlName(element.tag),))
+                else:
+                    attr = " ".join(["%s=\"%s\"" % (
+                        filter.fromXmlName(name), value)
+                        for name, value in element.attrib.items()])
+                    rv.append("<%s %s>" % (element.tag, attr))
+                if element.text:
+                    rv.append(element.text)
+
+                for child in element:
+                    serializeElement(child)
+
+                rv.append("</%s>" % (element.tag,))
+
+            if element.tail:
+                rv.append(element.tail)
+
+        serializeElement(element)
+
+        return "".join(rv)
+
+    class TreeBuilder(base.TreeBuilder):  # pylint:disable=unused-variable
+        documentClass = Document
+        doctypeClass = DocumentType
+        elementClass = Element
+        commentClass = Comment
+        fragmentClass = DocumentFragment
+        implementation = ElementTreeImplementation
+
+        def testSerializer(self, element):
+            return testSerializer(element)
+
+        def getDocument(self):
+            if fullTree:
+                return self.document._element
+            else:
+                if self.defaultNamespace is not None:
+                    return self.document._element.find(
+                        "{%s}html" % self.defaultNamespace)
+                else:
+                    return self.document._element.find("html")
+
+        def getFragment(self):
+            return base.TreeBuilder.getFragment(self)._element
+
+    return locals()
+
+
+getETreeModule = moduleFactoryFactory(getETreeBuilder)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree_lxml.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree_lxml.py
new file mode 100644
index 000000000..f037759f4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treebuilders/etree_lxml.py
@@ -0,0 +1,392 @@
+"""Module for supporting the lxml.etree library. The idea here is to use as much
+of the native library as possible, without using fragile hacks like custom element
+names that break between releases. The downside of this is that we cannot represent
+all possible trees; specifically the following are known to cause problems:
+
+Text or comments as siblings of the root element
+Docypes with no name
+
+When any of these things occur, we emit a DataLossWarning
+"""
+
+from __future__ import absolute_import, division, unicode_literals
+# pylint:disable=protected-access
+
+import warnings
+import re
+import sys
+
+try:
+    from collections.abc import MutableMapping
+except ImportError:
+    from collections import MutableMapping
+
+from . import base
+from ..constants import DataLossWarning
+from .. import constants
+from . import etree as etree_builders
+from .. import _ihatexml
+
+import lxml.etree as etree
+from pip._vendor.six import PY3, binary_type
+
+
+fullTree = True
+tag_regexp = re.compile("{([^}]*)}(.*)")
+
+comment_type = etree.Comment("asd").tag
+
+
+class DocumentType(object):
+    def __init__(self, name, publicId, systemId):
+        self.name = name
+        self.publicId = publicId
+        self.systemId = systemId
+
+
+class Document(object):
+    def __init__(self):
+        self._elementTree = None
+        self._childNodes = []
+
+    def appendChild(self, element):
+        last = self._elementTree.getroot()
+        for last in self._elementTree.getroot().itersiblings():
+            pass
+
+        last.addnext(element._element)
+
+    def _getChildNodes(self):
+        return self._childNodes
+
+    childNodes = property(_getChildNodes)
+
+
+def testSerializer(element):
+    rv = []
+    infosetFilter = _ihatexml.InfosetFilter(preventDoubleDashComments=True)
+
+    def serializeElement(element, indent=0):
+        if not hasattr(element, "tag"):
+            if hasattr(element, "getroot"):
+                # Full tree case
+                rv.append("#document")
+                if element.docinfo.internalDTD:
+                    if not (element.docinfo.public_id or
+                            element.docinfo.system_url):
+                        dtd_str = "<!DOCTYPE %s>" % element.docinfo.root_name
+                    else:
+                        dtd_str = """<!DOCTYPE %s "%s" "%s">""" % (
+                            element.docinfo.root_name,
+                            element.docinfo.public_id,
+                            element.docinfo.system_url)
+                    rv.append("|%s%s" % (' ' * (indent + 2), dtd_str))
+                next_element = element.getroot()
+                while next_element.getprevious() is not None:
+                    next_element = next_element.getprevious()
+                while next_element is not None:
+                    serializeElement(next_element, indent + 2)
+                    next_element = next_element.getnext()
+            elif isinstance(element, str) or isinstance(element, bytes):
+                # Text in a fragment
+                assert isinstance(element, str) or sys.version_info[0] == 2
+                rv.append("|%s\"%s\"" % (' ' * indent, element))
+            else:
+                # Fragment case
+                rv.append("#document-fragment")
+                for next_element in element:
+                    serializeElement(next_element, indent + 2)
+        elif element.tag == comment_type:
+            rv.append("|%s<!-- %s -->" % (' ' * indent, element.text))
+            if hasattr(element, "tail") and element.tail:
+                rv.append("|%s\"%s\"" % (' ' * indent, element.tail))
+        else:
+            assert isinstance(element, etree._Element)
+            nsmatch = etree_builders.tag_regexp.match(element.tag)
+            if nsmatch is not None:
+                ns = nsmatch.group(1)
+                tag = nsmatch.group(2)
+                prefix = constants.prefixes[ns]
+                rv.append("|%s<%s %s>" % (' ' * indent, prefix,
+                                          infosetFilter.fromXmlName(tag)))
+            else:
+                rv.append("|%s<%s>" % (' ' * indent,
+                                       infosetFilter.fromXmlName(element.tag)))
+
+            if hasattr(element, "attrib"):
+                attributes = []
+                for name, value in element.attrib.items():
+                    nsmatch = tag_regexp.match(name)
+                    if nsmatch is not None:
+                        ns, name = nsmatch.groups()
+                        name = infosetFilter.fromXmlName(name)
+                        prefix = constants.prefixes[ns]
+                        attr_string = "%s %s" % (prefix, name)
+                    else:
+                        attr_string = infosetFilter.fromXmlName(name)
+                    attributes.append((attr_string, value))
+
+                for name, value in sorted(attributes):
+                    rv.append('|%s%s="%s"' % (' ' * (indent + 2), name, value))
+
+            if element.text:
+                rv.append("|%s\"%s\"" % (' ' * (indent + 2), element.text))
+            indent += 2
+            for child in element:
+                serializeElement(child, indent)
+            if hasattr(element, "tail") and element.tail:
+                rv.append("|%s\"%s\"" % (' ' * (indent - 2), element.tail))
+    serializeElement(element, 0)
+
+    return "\n".join(rv)
+
+
+def tostring(element):
+    """Serialize an element and its child nodes to a string"""
+    rv = []
+
+    def serializeElement(element):
+        if not hasattr(element, "tag"):
+            if element.docinfo.internalDTD:
+                if element.docinfo.doctype:
+                    dtd_str = element.docinfo.doctype
+                else:
+                    dtd_str = "<!DOCTYPE %s>" % element.docinfo.root_name
+                rv.append(dtd_str)
+            serializeElement(element.getroot())
+
+        elif element.tag == comment_type:
+            rv.append("<!--%s-->" % (element.text,))
+
+        else:
+            # This is assumed to be an ordinary element
+            if not element.attrib:
+                rv.append("<%s>" % (element.tag,))
+            else:
+                attr = " ".join(["%s=\"%s\"" % (name, value)
+                                 for name, value in element.attrib.items()])
+                rv.append("<%s %s>" % (element.tag, attr))
+            if element.text:
+                rv.append(element.text)
+
+            for child in element:
+                serializeElement(child)
+
+            rv.append("</%s>" % (element.tag,))
+
+        if hasattr(element, "tail") and element.tail:
+            rv.append(element.tail)
+
+    serializeElement(element)
+
+    return "".join(rv)
+
+
+class TreeBuilder(base.TreeBuilder):
+    documentClass = Document
+    doctypeClass = DocumentType
+    elementClass = None
+    commentClass = None
+    fragmentClass = Document
+    implementation = etree
+
+    def __init__(self, namespaceHTMLElements, fullTree=False):
+        builder = etree_builders.getETreeModule(etree, fullTree=fullTree)
+        infosetFilter = self.infosetFilter = _ihatexml.InfosetFilter(preventDoubleDashComments=True)
+        self.namespaceHTMLElements = namespaceHTMLElements
+
+        class Attributes(MutableMapping):
+            def __init__(self, element):
+                self._element = element
+
+            def _coerceKey(self, key):
+                if isinstance(key, tuple):
+                    name = "{%s}%s" % (key[2], infosetFilter.coerceAttribute(key[1]))
+                else:
+                    name = infosetFilter.coerceAttribute(key)
+                return name
+
+            def __getitem__(self, key):
+                value = self._element._element.attrib[self._coerceKey(key)]
+                if not PY3 and isinstance(value, binary_type):
+                    value = value.decode("ascii")
+                return value
+
+            def __setitem__(self, key, value):
+                self._element._element.attrib[self._coerceKey(key)] = value
+
+            def __delitem__(self, key):
+                del self._element._element.attrib[self._coerceKey(key)]
+
+            def __iter__(self):
+                return iter(self._element._element.attrib)
+
+            def __len__(self):
+                return len(self._element._element.attrib)
+
+            def clear(self):
+                return self._element._element.attrib.clear()
+
+        class Element(builder.Element):
+            def __init__(self, name, namespace):
+                name = infosetFilter.coerceElement(name)
+                builder.Element.__init__(self, name, namespace=namespace)
+                self._attributes = Attributes(self)
+
+            def _setName(self, name):
+                self._name = infosetFilter.coerceElement(name)
+                self._element.tag = self._getETreeTag(
+                    self._name, self._namespace)
+
+            def _getName(self):
+                return infosetFilter.fromXmlName(self._name)
+
+            name = property(_getName, _setName)
+
+            def _getAttributes(self):
+                return self._attributes
+
+            def _setAttributes(self, value):
+                attributes = self.attributes
+                attributes.clear()
+                attributes.update(value)
+
+            attributes = property(_getAttributes, _setAttributes)
+
+            def insertText(self, data, insertBefore=None):
+                data = infosetFilter.coerceCharacters(data)
+                builder.Element.insertText(self, data, insertBefore)
+
+            def cloneNode(self):
+                element = type(self)(self.name, self.namespace)
+                if self._element.attrib:
+                    element._element.attrib.update(self._element.attrib)
+                return element
+
+        class Comment(builder.Comment):
+            def __init__(self, data):
+                data = infosetFilter.coerceComment(data)
+                builder.Comment.__init__(self, data)
+
+            def _setData(self, data):
+                data = infosetFilter.coerceComment(data)
+                self._element.text = data
+
+            def _getData(self):
+                return self._element.text
+
+            data = property(_getData, _setData)
+
+        self.elementClass = Element
+        self.commentClass = Comment
+        # self.fragmentClass = builder.DocumentFragment
+        base.TreeBuilder.__init__(self, namespaceHTMLElements)
+
+    def reset(self):
+        base.TreeBuilder.reset(self)
+        self.insertComment = self.insertCommentInitial
+        self.initial_comments = []
+        self.doctype = None
+
+    def testSerializer(self, element):
+        return testSerializer(element)
+
+    def getDocument(self):
+        if fullTree:
+            return self.document._elementTree
+        else:
+            return self.document._elementTree.getroot()
+
+    def getFragment(self):
+        fragment = []
+        element = self.openElements[0]._element
+        if element.text:
+            fragment.append(element.text)
+        fragment.extend(list(element))
+        if element.tail:
+            fragment.append(element.tail)
+        return fragment
+
+    def insertDoctype(self, token):
+        name = token["name"]
+        publicId = token["publicId"]
+        systemId = token["systemId"]
+
+        if not name:
+            warnings.warn("lxml cannot represent empty doctype", DataLossWarning)
+            self.doctype = None
+        else:
+            coercedName = self.infosetFilter.coerceElement(name)
+            if coercedName != name:
+                warnings.warn("lxml cannot represent non-xml doctype", DataLossWarning)
+
+            doctype = self.doctypeClass(coercedName, publicId, systemId)
+            self.doctype = doctype
+
+    def insertCommentInitial(self, data, parent=None):
+        assert parent is None or parent is self.document
+        assert self.document._elementTree is None
+        self.initial_comments.append(data)
+
+    def insertCommentMain(self, data, parent=None):
+        if (parent == self.document and
+                self.document._elementTree.getroot()[-1].tag == comment_type):
+            warnings.warn("lxml cannot represent adjacent comments beyond the root elements", DataLossWarning)
+        super(TreeBuilder, self).insertComment(data, parent)
+
+    def insertRoot(self, token):
+        # Because of the way libxml2 works, it doesn't seem to be possible to
+        # alter information like the doctype after the tree has been parsed.
+        # Therefore we need to use the built-in parser to create our initial
+        # tree, after which we can add elements like normal
+        docStr = ""
+        if self.doctype:
+            assert self.doctype.name
+            docStr += "<!DOCTYPE %s" % self.doctype.name
+            if (self.doctype.publicId is not None or
+                    self.doctype.systemId is not None):
+                docStr += (' PUBLIC "%s" ' %
+                           (self.infosetFilter.coercePubid(self.doctype.publicId or "")))
+                if self.doctype.systemId:
+                    sysid = self.doctype.systemId
+                    if sysid.find("'") >= 0 and sysid.find('"') >= 0:
+                        warnings.warn("DOCTYPE system cannot contain single and double quotes", DataLossWarning)
+                        sysid = sysid.replace("'", 'U00027')
+                    if sysid.find("'") >= 0:
+                        docStr += '"%s"' % sysid
+                    else:
+                        docStr += "'%s'" % sysid
+                else:
+                    docStr += "''"
+            docStr += ">"
+            if self.doctype.name != token["name"]:
+                warnings.warn("lxml cannot represent doctype with a different name to the root element", DataLossWarning)
+        docStr += "<THIS_SHOULD_NEVER_APPEAR_PUBLICLY/>"
+        root = etree.fromstring(docStr)
+
+        # Append the initial comments:
+        for comment_token in self.initial_comments:
+            comment = self.commentClass(comment_token["data"])
+            root.addprevious(comment._element)
+
+        # Create the root document and add the ElementTree to it
+        self.document = self.documentClass()
+        self.document._elementTree = root.getroottree()
+
+        # Give the root element the right name
+        name = token["name"]
+        namespace = token.get("namespace", self.defaultNamespace)
+        if namespace is None:
+            etree_tag = name
+        else:
+            etree_tag = "{%s}%s" % (namespace, name)
+        root.tag = etree_tag
+
+        # Add the root element to the internal child/open data structures
+        root_element = self.elementClass(name, namespace)
+        root_element._element = root
+        self.document._childNodes.append(root_element)
+        self.openElements.append(root_element)
+
+        # Reset to the default insert comment function
+        self.insertComment = self.insertCommentMain
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__init__.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__init__.py
new file mode 100644
index 000000000..b2d3aac31
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__init__.py
@@ -0,0 +1,154 @@
+"""A collection of modules for iterating through different kinds of
+tree, generating tokens identical to those produced by the tokenizer
+module.
+
+To create a tree walker for a new type of tree, you need to
+implement a tree walker object (called TreeWalker by convention) that
+implements a 'serialize' method which takes a tree as sole argument and
+returns an iterator which generates tokens.
+"""
+
+from __future__ import absolute_import, division, unicode_literals
+
+from .. import constants
+from .._utils import default_etree
+
+__all__ = ["getTreeWalker", "pprint"]
+
+treeWalkerCache = {}
+
+
+def getTreeWalker(treeType, implementation=None, **kwargs):
+    """Get a TreeWalker class for various types of tree with built-in support
+
+    :arg str treeType: the name of the tree type required (case-insensitive).
+        Supported values are:
+
+        * "dom": The xml.dom.minidom DOM implementation
+        * "etree": A generic walker for tree implementations exposing an
+          elementtree-like interface (known to work with ElementTree,
+          cElementTree and lxml.etree).
+        * "lxml": Optimized walker for lxml.etree
+        * "genshi": a Genshi stream
+
+    :arg implementation: A module implementing the tree type e.g.
+        xml.etree.ElementTree or cElementTree (Currently applies to the "etree"
+        tree type only).
+
+    :arg kwargs: keyword arguments passed to the etree walker--for other
+        walkers, this has no effect
+
+    :returns: a TreeWalker class
+
+    """
+
+    treeType = treeType.lower()
+    if treeType not in treeWalkerCache:
+        if treeType == "dom":
+            from . import dom
+            treeWalkerCache[treeType] = dom.TreeWalker
+        elif treeType == "genshi":
+            from . import genshi
+            treeWalkerCache[treeType] = genshi.TreeWalker
+        elif treeType == "lxml":
+            from . import etree_lxml
+            treeWalkerCache[treeType] = etree_lxml.TreeWalker
+        elif treeType == "etree":
+            from . import etree
+            if implementation is None:
+                implementation = default_etree
+            # XXX: NEVER cache here, caching is done in the etree submodule
+            return etree.getETreeModule(implementation, **kwargs).TreeWalker
+    return treeWalkerCache.get(treeType)
+
+
+def concatenateCharacterTokens(tokens):
+    pendingCharacters = []
+    for token in tokens:
+        type = token["type"]
+        if type in ("Characters", "SpaceCharacters"):
+            pendingCharacters.append(token["data"])
+        else:
+            if pendingCharacters:
+                yield {"type": "Characters", "data": "".join(pendingCharacters)}
+                pendingCharacters = []
+            yield token
+    if pendingCharacters:
+        yield {"type": "Characters", "data": "".join(pendingCharacters)}
+
+
+def pprint(walker):
+    """Pretty printer for tree walkers
+
+    Takes a TreeWalker instance and pretty prints the output of walking the tree.
+
+    :arg walker: a TreeWalker instance
+
+    """
+    output = []
+    indent = 0
+    for token in concatenateCharacterTokens(walker):
+        type = token["type"]
+        if type in ("StartTag", "EmptyTag"):
+            # tag name
+            if token["namespace"] and token["namespace"] != constants.namespaces["html"]:
+                if token["namespace"] in constants.prefixes:
+                    ns = constants.prefixes[token["namespace"]]
+                else:
+                    ns = token["namespace"]
+                name = "%s %s" % (ns, token["name"])
+            else:
+                name = token["name"]
+            output.append("%s<%s>" % (" " * indent, name))
+            indent += 2
+            # attributes (sorted for consistent ordering)
+            attrs = token["data"]
+            for (namespace, localname), value in sorted(attrs.items()):
+                if namespace:
+                    if namespace in constants.prefixes:
+                        ns = constants.prefixes[namespace]
+                    else:
+                        ns = namespace
+                    name = "%s %s" % (ns, localname)
+                else:
+                    name = localname
+                output.append("%s%s=\"%s\"" % (" " * indent, name, value))
+            # self-closing
+            if type == "EmptyTag":
+                indent -= 2
+
+        elif type == "EndTag":
+            indent -= 2
+
+        elif type == "Comment":
+            output.append("%s<!-- %s -->" % (" " * indent, token["data"]))
+
+        elif type == "Doctype":
+            if token["name"]:
+                if token["publicId"]:
+                    output.append("""%s<!DOCTYPE %s "%s" "%s">""" %
+                                  (" " * indent,
+                                   token["name"],
+                                   token["publicId"],
+                                   token["systemId"] if token["systemId"] else ""))
+                elif token["systemId"]:
+                    output.append("""%s<!DOCTYPE %s "" "%s">""" %
+                                  (" " * indent,
+                                   token["name"],
+                                   token["systemId"]))
+                else:
+                    output.append("%s<!DOCTYPE %s>" % (" " * indent,
+                                                       token["name"]))
+            else:
+                output.append("%s<!DOCTYPE >" % (" " * indent,))
+
+        elif type == "Characters":
+            output.append("%s\"%s\"" % (" " * indent, token["data"]))
+
+        elif type == "SpaceCharacters":
+            assert False, "concatenateCharacterTokens should have got rid of all Space tokens"
+
+        else:
+            raise ValueError("Unknown token type, %s" % type)
+
+    return "\n".join(output)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..82c62693b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc
new file mode 100644
index 000000000..79cda3829
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/base.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc
new file mode 100644
index 000000000..f033b0f4a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/dom.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc
new file mode 100644
index 000000000..eeb23f40d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc
new file mode 100644
index 000000000..d94e5ae07
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/etree_lxml.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc
new file mode 100644
index 000000000..309765ee5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/__pycache__/genshi.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/base.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/base.py
new file mode 100644
index 000000000..80c474c4e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/base.py
@@ -0,0 +1,252 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from xml.dom import Node
+from ..constants import namespaces, voidElements, spaceCharacters
+
+__all__ = ["DOCUMENT", "DOCTYPE", "TEXT", "ELEMENT", "COMMENT", "ENTITY", "UNKNOWN",
+           "TreeWalker", "NonRecursiveTreeWalker"]
+
+DOCUMENT = Node.DOCUMENT_NODE
+DOCTYPE = Node.DOCUMENT_TYPE_NODE
+TEXT = Node.TEXT_NODE
+ELEMENT = Node.ELEMENT_NODE
+COMMENT = Node.COMMENT_NODE
+ENTITY = Node.ENTITY_NODE
+UNKNOWN = "<#UNKNOWN#>"
+
+spaceCharacters = "".join(spaceCharacters)
+
+
+class TreeWalker(object):
+    """Walks a tree yielding tokens
+
+    Tokens are dicts that all have a ``type`` field specifying the type of the
+    token.
+
+    """
+    def __init__(self, tree):
+        """Creates a TreeWalker
+
+        :arg tree: the tree to walk
+
+        """
+        self.tree = tree
+
+    def __iter__(self):
+        raise NotImplementedError
+
+    def error(self, msg):
+        """Generates an error token with the given message
+
+        :arg msg: the error message
+
+        :returns: SerializeError token
+
+        """
+        return {"type": "SerializeError", "data": msg}
+
+    def emptyTag(self, namespace, name, attrs, hasChildren=False):
+        """Generates an EmptyTag token
+
+        :arg namespace: the namespace of the token--can be ``None``
+
+        :arg name: the name of the element
+
+        :arg attrs: the attributes of the element as a dict
+
+        :arg hasChildren: whether or not to yield a SerializationError because
+            this tag shouldn't have children
+
+        :returns: EmptyTag token
+
+        """
+        yield {"type": "EmptyTag", "name": name,
+               "namespace": namespace,
+               "data": attrs}
+        if hasChildren:
+            yield self.error("Void element has children")
+
+    def startTag(self, namespace, name, attrs):
+        """Generates a StartTag token
+
+        :arg namespace: the namespace of the token--can be ``None``
+
+        :arg name: the name of the element
+
+        :arg attrs: the attributes of the element as a dict
+
+        :returns: StartTag token
+
+        """
+        return {"type": "StartTag",
+                "name": name,
+                "namespace": namespace,
+                "data": attrs}
+
+    def endTag(self, namespace, name):
+        """Generates an EndTag token
+
+        :arg namespace: the namespace of the token--can be ``None``
+
+        :arg name: the name of the element
+
+        :returns: EndTag token
+
+        """
+        return {"type": "EndTag",
+                "name": name,
+                "namespace": namespace}
+
+    def text(self, data):
+        """Generates SpaceCharacters and Characters tokens
+
+        Depending on what's in the data, this generates one or more
+        ``SpaceCharacters`` and ``Characters`` tokens.
+
+        For example:
+
+            >>> from html5lib.treewalkers.base import TreeWalker
+            >>> # Give it an empty tree just so it instantiates
+            >>> walker = TreeWalker([])
+            >>> list(walker.text(''))
+            []
+            >>> list(walker.text('  '))
+            [{u'data': '  ', u'type': u'SpaceCharacters'}]
+            >>> list(walker.text(' abc '))  # doctest: +NORMALIZE_WHITESPACE
+            [{u'data': ' ', u'type': u'SpaceCharacters'},
+            {u'data': u'abc', u'type': u'Characters'},
+            {u'data': u' ', u'type': u'SpaceCharacters'}]
+
+        :arg data: the text data
+
+        :returns: one or more ``SpaceCharacters`` and ``Characters`` tokens
+
+        """
+        data = data
+        middle = data.lstrip(spaceCharacters)
+        left = data[:len(data) - len(middle)]
+        if left:
+            yield {"type": "SpaceCharacters", "data": left}
+        data = middle
+        middle = data.rstrip(spaceCharacters)
+        right = data[len(middle):]
+        if middle:
+            yield {"type": "Characters", "data": middle}
+        if right:
+            yield {"type": "SpaceCharacters", "data": right}
+
+    def comment(self, data):
+        """Generates a Comment token
+
+        :arg data: the comment
+
+        :returns: Comment token
+
+        """
+        return {"type": "Comment", "data": data}
+
+    def doctype(self, name, publicId=None, systemId=None):
+        """Generates a Doctype token
+
+        :arg name:
+
+        :arg publicId:
+
+        :arg systemId:
+
+        :returns: the Doctype token
+
+        """
+        return {"type": "Doctype",
+                "name": name,
+                "publicId": publicId,
+                "systemId": systemId}
+
+    def entity(self, name):
+        """Generates an Entity token
+
+        :arg name: the entity name
+
+        :returns: an Entity token
+
+        """
+        return {"type": "Entity", "name": name}
+
+    def unknown(self, nodeType):
+        """Handles unknown node types"""
+        return self.error("Unknown node type: " + nodeType)
+
+
+class NonRecursiveTreeWalker(TreeWalker):
+    def getNodeDetails(self, node):
+        raise NotImplementedError
+
+    def getFirstChild(self, node):
+        raise NotImplementedError
+
+    def getNextSibling(self, node):
+        raise NotImplementedError
+
+    def getParentNode(self, node):
+        raise NotImplementedError
+
+    def __iter__(self):
+        currentNode = self.tree
+        while currentNode is not None:
+            details = self.getNodeDetails(currentNode)
+            type, details = details[0], details[1:]
+            hasChildren = False
+
+            if type == DOCTYPE:
+                yield self.doctype(*details)
+
+            elif type == TEXT:
+                for token in self.text(*details):
+                    yield token
+
+            elif type == ELEMENT:
+                namespace, name, attributes, hasChildren = details
+                if (not namespace or namespace == namespaces["html"]) and name in voidElements:
+                    for token in self.emptyTag(namespace, name, attributes,
+                                               hasChildren):
+                        yield token
+                    hasChildren = False
+                else:
+                    yield self.startTag(namespace, name, attributes)
+
+            elif type == COMMENT:
+                yield self.comment(details[0])
+
+            elif type == ENTITY:
+                yield self.entity(details[0])
+
+            elif type == DOCUMENT:
+                hasChildren = True
+
+            else:
+                yield self.unknown(details[0])
+
+            if hasChildren:
+                firstChild = self.getFirstChild(currentNode)
+            else:
+                firstChild = None
+
+            if firstChild is not None:
+                currentNode = firstChild
+            else:
+                while currentNode is not None:
+                    details = self.getNodeDetails(currentNode)
+                    type, details = details[0], details[1:]
+                    if type == ELEMENT:
+                        namespace, name, attributes, hasChildren = details
+                        if (namespace and namespace != namespaces["html"]) or name not in voidElements:
+                            yield self.endTag(namespace, name)
+                    if self.tree is currentNode:
+                        currentNode = None
+                        break
+                    nextSibling = self.getNextSibling(currentNode)
+                    if nextSibling is not None:
+                        currentNode = nextSibling
+                        break
+                    else:
+                        currentNode = self.getParentNode(currentNode)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/dom.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/dom.py
new file mode 100644
index 000000000..b0c89b001
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/dom.py
@@ -0,0 +1,43 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from xml.dom import Node
+
+from . import base
+
+
+class TreeWalker(base.NonRecursiveTreeWalker):
+    def getNodeDetails(self, node):
+        if node.nodeType == Node.DOCUMENT_TYPE_NODE:
+            return base.DOCTYPE, node.name, node.publicId, node.systemId
+
+        elif node.nodeType in (Node.TEXT_NODE, Node.CDATA_SECTION_NODE):
+            return base.TEXT, node.nodeValue
+
+        elif node.nodeType == Node.ELEMENT_NODE:
+            attrs = {}
+            for attr in list(node.attributes.keys()):
+                attr = node.getAttributeNode(attr)
+                if attr.namespaceURI:
+                    attrs[(attr.namespaceURI, attr.localName)] = attr.value
+                else:
+                    attrs[(None, attr.name)] = attr.value
+            return (base.ELEMENT, node.namespaceURI, node.nodeName,
+                    attrs, node.hasChildNodes())
+
+        elif node.nodeType == Node.COMMENT_NODE:
+            return base.COMMENT, node.nodeValue
+
+        elif node.nodeType in (Node.DOCUMENT_NODE, Node.DOCUMENT_FRAGMENT_NODE):
+            return (base.DOCUMENT,)
+
+        else:
+            return base.UNKNOWN, node.nodeType
+
+    def getFirstChild(self, node):
+        return node.firstChild
+
+    def getNextSibling(self, node):
+        return node.nextSibling
+
+    def getParentNode(self, node):
+        return node.parentNode
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree.py
new file mode 100644
index 000000000..837b27ec4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree.py
@@ -0,0 +1,131 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from collections import OrderedDict
+import re
+
+from pip._vendor.six import string_types
+
+from . import base
+from .._utils import moduleFactoryFactory
+
+tag_regexp = re.compile("{([^}]*)}(.*)")
+
+
+def getETreeBuilder(ElementTreeImplementation):
+    ElementTree = ElementTreeImplementation
+    ElementTreeCommentType = ElementTree.Comment("asd").tag
+
+    class TreeWalker(base.NonRecursiveTreeWalker):  # pylint:disable=unused-variable
+        """Given the particular ElementTree representation, this implementation,
+        to avoid using recursion, returns "nodes" as tuples with the following
+        content:
+
+        1. The current element
+
+        2. The index of the element relative to its parent
+
+        3. A stack of ancestor elements
+
+        4. A flag "text", "tail" or None to indicate if the current node is a
+           text node; either the text or tail of the current element (1)
+        """
+        def getNodeDetails(self, node):
+            if isinstance(node, tuple):  # It might be the root Element
+                elt, _, _, flag = node
+                if flag in ("text", "tail"):
+                    return base.TEXT, getattr(elt, flag)
+                else:
+                    node = elt
+
+            if not(hasattr(node, "tag")):
+                node = node.getroot()
+
+            if node.tag in ("DOCUMENT_ROOT", "DOCUMENT_FRAGMENT"):
+                return (base.DOCUMENT,)
+
+            elif node.tag == "<!DOCTYPE>":
+                return (base.DOCTYPE, node.text,
+                        node.get("publicId"), node.get("systemId"))
+
+            elif node.tag == ElementTreeCommentType:
+                return base.COMMENT, node.text
+
+            else:
+                assert isinstance(node.tag, string_types), type(node.tag)
+                # This is assumed to be an ordinary element
+                match = tag_regexp.match(node.tag)
+                if match:
+                    namespace, tag = match.groups()
+                else:
+                    namespace = None
+                    tag = node.tag
+                attrs = OrderedDict()
+                for name, value in list(node.attrib.items()):
+                    match = tag_regexp.match(name)
+                    if match:
+                        attrs[(match.group(1), match.group(2))] = value
+                    else:
+                        attrs[(None, name)] = value
+                return (base.ELEMENT, namespace, tag,
+                        attrs, len(node) or node.text)
+
+        def getFirstChild(self, node):
+            if isinstance(node, tuple):
+                element, key, parents, flag = node
+            else:
+                element, key, parents, flag = node, None, [], None
+
+            if flag in ("text", "tail"):
+                return None
+            else:
+                if element.text:
+                    return element, key, parents, "text"
+                elif len(element):
+                    parents.append(element)
+                    return element[0], 0, parents, None
+                else:
+                    return None
+
+        def getNextSibling(self, node):
+            if isinstance(node, tuple):
+                element, key, parents, flag = node
+            else:
+                return None
+
+            if flag == "text":
+                if len(element):
+                    parents.append(element)
+                    return element[0], 0, parents, None
+                else:
+                    return None
+            else:
+                if element.tail and flag != "tail":
+                    return element, key, parents, "tail"
+                elif key < len(parents[-1]) - 1:
+                    return parents[-1][key + 1], key + 1, parents, None
+                else:
+                    return None
+
+        def getParentNode(self, node):
+            if isinstance(node, tuple):
+                element, key, parents, flag = node
+            else:
+                return None
+
+            if flag == "text":
+                if not parents:
+                    return element
+                else:
+                    return element, key, parents, None
+            else:
+                parent = parents.pop()
+                if not parents:
+                    return parent
+                else:
+                    assert list(parents[-1]).count(parent) == 1
+                    return parent, list(parents[-1]).index(parent), parents, None
+
+    return locals()
+
+
+getETreeModule = moduleFactoryFactory(getETreeBuilder)
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree_lxml.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree_lxml.py
new file mode 100644
index 000000000..c56af390f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/etree_lxml.py
@@ -0,0 +1,215 @@
+from __future__ import absolute_import, division, unicode_literals
+from pip._vendor.six import text_type
+
+from collections import OrderedDict
+
+from lxml import etree
+from ..treebuilders.etree import tag_regexp
+
+from . import base
+
+from .. import _ihatexml
+
+
+def ensure_str(s):
+    if s is None:
+        return None
+    elif isinstance(s, text_type):
+        return s
+    else:
+        return s.decode("ascii", "strict")
+
+
+class Root(object):
+    def __init__(self, et):
+        self.elementtree = et
+        self.children = []
+
+        try:
+            if et.docinfo.internalDTD:
+                self.children.append(Doctype(self,
+                                             ensure_str(et.docinfo.root_name),
+                                             ensure_str(et.docinfo.public_id),
+                                             ensure_str(et.docinfo.system_url)))
+        except AttributeError:
+            pass
+
+        try:
+            node = et.getroot()
+        except AttributeError:
+            node = et
+
+        while node.getprevious() is not None:
+            node = node.getprevious()
+        while node is not None:
+            self.children.append(node)
+            node = node.getnext()
+
+        self.text = None
+        self.tail = None
+
+    def __getitem__(self, key):
+        return self.children[key]
+
+    def getnext(self):
+        return None
+
+    def __len__(self):
+        return 1
+
+
+class Doctype(object):
+    def __init__(self, root_node, name, public_id, system_id):
+        self.root_node = root_node
+        self.name = name
+        self.public_id = public_id
+        self.system_id = system_id
+
+        self.text = None
+        self.tail = None
+
+    def getnext(self):
+        return self.root_node.children[1]
+
+
+class FragmentRoot(Root):
+    def __init__(self, children):
+        self.children = [FragmentWrapper(self, child) for child in children]
+        self.text = self.tail = None
+
+    def getnext(self):
+        return None
+
+
+class FragmentWrapper(object):
+    def __init__(self, fragment_root, obj):
+        self.root_node = fragment_root
+        self.obj = obj
+        if hasattr(self.obj, 'text'):
+            self.text = ensure_str(self.obj.text)
+        else:
+            self.text = None
+        if hasattr(self.obj, 'tail'):
+            self.tail = ensure_str(self.obj.tail)
+        else:
+            self.tail = None
+
+    def __getattr__(self, name):
+        return getattr(self.obj, name)
+
+    def getnext(self):
+        siblings = self.root_node.children
+        idx = siblings.index(self)
+        if idx < len(siblings) - 1:
+            return siblings[idx + 1]
+        else:
+            return None
+
+    def __getitem__(self, key):
+        return self.obj[key]
+
+    def __bool__(self):
+        return bool(self.obj)
+
+    def getparent(self):
+        return None
+
+    def __str__(self):
+        return str(self.obj)
+
+    def __unicode__(self):
+        return str(self.obj)
+
+    def __len__(self):
+        return len(self.obj)
+
+
+class TreeWalker(base.NonRecursiveTreeWalker):
+    def __init__(self, tree):
+        # pylint:disable=redefined-variable-type
+        if isinstance(tree, list):
+            self.fragmentChildren = set(tree)
+            tree = FragmentRoot(tree)
+        else:
+            self.fragmentChildren = set()
+            tree = Root(tree)
+        base.NonRecursiveTreeWalker.__init__(self, tree)
+        self.filter = _ihatexml.InfosetFilter()
+
+    def getNodeDetails(self, node):
+        if isinstance(node, tuple):  # Text node
+            node, key = node
+            assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
+            return base.TEXT, ensure_str(getattr(node, key))
+
+        elif isinstance(node, Root):
+            return (base.DOCUMENT,)
+
+        elif isinstance(node, Doctype):
+            return base.DOCTYPE, node.name, node.public_id, node.system_id
+
+        elif isinstance(node, FragmentWrapper) and not hasattr(node, "tag"):
+            return base.TEXT, ensure_str(node.obj)
+
+        elif node.tag == etree.Comment:
+            return base.COMMENT, ensure_str(node.text)
+
+        elif node.tag == etree.Entity:
+            return base.ENTITY, ensure_str(node.text)[1:-1]  # strip &;
+
+        else:
+            # This is assumed to be an ordinary element
+            match = tag_regexp.match(ensure_str(node.tag))
+            if match:
+                namespace, tag = match.groups()
+            else:
+                namespace = None
+                tag = ensure_str(node.tag)
+            attrs = OrderedDict()
+            for name, value in list(node.attrib.items()):
+                name = ensure_str(name)
+                value = ensure_str(value)
+                match = tag_regexp.match(name)
+                if match:
+                    attrs[(match.group(1), match.group(2))] = value
+                else:
+                    attrs[(None, name)] = value
+            return (base.ELEMENT, namespace, self.filter.fromXmlName(tag),
+                    attrs, len(node) > 0 or node.text)
+
+    def getFirstChild(self, node):
+        assert not isinstance(node, tuple), "Text nodes have no children"
+
+        assert len(node) or node.text, "Node has no children"
+        if node.text:
+            return (node, "text")
+        else:
+            return node[0]
+
+    def getNextSibling(self, node):
+        if isinstance(node, tuple):  # Text node
+            node, key = node
+            assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
+            if key == "text":
+                # XXX: we cannot use a "bool(node) and node[0] or None" construct here
+                # because node[0] might evaluate to False if it has no child element
+                if len(node):
+                    return node[0]
+                else:
+                    return None
+            else:  # tail
+                return node.getnext()
+
+        return (node, "tail") if node.tail else node.getnext()
+
+    def getParentNode(self, node):
+        if isinstance(node, tuple):  # Text node
+            node, key = node
+            assert key in ("text", "tail"), "Text nodes are text or tail, found %s" % key
+            if key == "text":
+                return node
+            # else: fallback to "normal" processing
+        elif node in self.fragmentChildren:
+            return None
+
+        return node.getparent()
diff --git a/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/genshi.py b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/genshi.py
new file mode 100644
index 000000000..7483be27d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/html5lib/treewalkers/genshi.py
@@ -0,0 +1,69 @@
+from __future__ import absolute_import, division, unicode_literals
+
+from genshi.core import QName
+from genshi.core import START, END, XML_NAMESPACE, DOCTYPE, TEXT
+from genshi.core import START_NS, END_NS, START_CDATA, END_CDATA, PI, COMMENT
+
+from . import base
+
+from ..constants import voidElements, namespaces
+
+
+class TreeWalker(base.TreeWalker):
+    def __iter__(self):
+        # Buffer the events so we can pass in the following one
+        previous = None
+        for event in self.tree:
+            if previous is not None:
+                for token in self.tokens(previous, event):
+                    yield token
+            previous = event
+
+        # Don't forget the final event!
+        if previous is not None:
+            for token in self.tokens(previous, None):
+                yield token
+
+    def tokens(self, event, next):
+        kind, data, _ = event
+        if kind == START:
+            tag, attribs = data
+            name = tag.localname
+            namespace = tag.namespace
+            converted_attribs = {}
+            for k, v in attribs:
+                if isinstance(k, QName):
+                    converted_attribs[(k.namespace, k.localname)] = v
+                else:
+                    converted_attribs[(None, k)] = v
+
+            if namespace == namespaces["html"] and name in voidElements:
+                for token in self.emptyTag(namespace, name, converted_attribs,
+                                           not next or next[0] != END or
+                                           next[1] != tag):
+                    yield token
+            else:
+                yield self.startTag(namespace, name, converted_attribs)
+
+        elif kind == END:
+            name = data.localname
+            namespace = data.namespace
+            if namespace != namespaces["html"] or name not in voidElements:
+                yield self.endTag(namespace, name)
+
+        elif kind == COMMENT:
+            yield self.comment(data)
+
+        elif kind == TEXT:
+            for token in self.text(data):
+                yield token
+
+        elif kind == DOCTYPE:
+            yield self.doctype(*data)
+
+        elif kind in (XML_NAMESPACE, DOCTYPE, START_NS, END_NS,
+                      START_CDATA, END_CDATA, PI):
+            pass
+
+        else:
+            yield self.unknown(kind)
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__init__.py b/venv/Lib/site-packages/pip/_vendor/idna/__init__.py
new file mode 100644
index 000000000..847bf9354
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/__init__.py
@@ -0,0 +1,2 @@
+from .package_data import __version__
+from .core import *
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..adcf73b25
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/codec.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/codec.cpython-36.pyc
new file mode 100644
index 000000000..bec8062d7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/codec.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..a563b0fd5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/core.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/core.cpython-36.pyc
new file mode 100644
index 000000000..814235aea
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/idnadata.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/idnadata.cpython-36.pyc
new file mode 100644
index 000000000..09b10b8c9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/idnadata.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/intranges.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/intranges.cpython-36.pyc
new file mode 100644
index 000000000..0b06143b8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/intranges.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/package_data.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/package_data.cpython-36.pyc
new file mode 100644
index 000000000..deb267c29
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/package_data.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/uts46data.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/uts46data.cpython-36.pyc
new file mode 100644
index 000000000..96740707c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/idna/__pycache__/uts46data.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/codec.py b/venv/Lib/site-packages/pip/_vendor/idna/codec.py
new file mode 100644
index 000000000..98c65ead1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/codec.py
@@ -0,0 +1,118 @@
+from .core import encode, decode, alabel, ulabel, IDNAError
+import codecs
+import re
+
+_unicode_dots_re = re.compile(u'[\u002e\u3002\uff0e\uff61]')
+
+class Codec(codecs.Codec):
+
+    def encode(self, data, errors='strict'):
+
+        if errors != 'strict':
+            raise IDNAError("Unsupported error handling \"{0}\"".format(errors))
+
+        if not data:
+            return "", 0
+
+        return encode(data), len(data)
+
+    def decode(self, data, errors='strict'):
+
+        if errors != 'strict':
+            raise IDNAError("Unsupported error handling \"{0}\"".format(errors))
+
+        if not data:
+            return u"", 0
+
+        return decode(data), len(data)
+
+class IncrementalEncoder(codecs.BufferedIncrementalEncoder):
+    def _buffer_encode(self, data, errors, final):
+        if errors != 'strict':
+            raise IDNAError("Unsupported error handling \"{0}\"".format(errors))
+
+        if not data:
+            return ("", 0)
+
+        labels = _unicode_dots_re.split(data)
+        trailing_dot = u''
+        if labels:
+            if not labels[-1]:
+                trailing_dot = '.'
+                del labels[-1]
+            elif not final:
+                # Keep potentially unfinished label until the next call
+                del labels[-1]
+                if labels:
+                    trailing_dot = '.'
+
+        result = []
+        size = 0
+        for label in labels:
+            result.append(alabel(label))
+            if size:
+                size += 1
+            size += len(label)
+
+        # Join with U+002E
+        result = ".".join(result) + trailing_dot
+        size += len(trailing_dot)
+        return (result, size)
+
+class IncrementalDecoder(codecs.BufferedIncrementalDecoder):
+    def _buffer_decode(self, data, errors, final):
+        if errors != 'strict':
+            raise IDNAError("Unsupported error handling \"{0}\"".format(errors))
+
+        if not data:
+            return (u"", 0)
+
+        # IDNA allows decoding to operate on Unicode strings, too.
+        if isinstance(data, unicode):
+            labels = _unicode_dots_re.split(data)
+        else:
+            # Must be ASCII string
+            data = str(data)
+            unicode(data, "ascii")
+            labels = data.split(".")
+
+        trailing_dot = u''
+        if labels:
+            if not labels[-1]:
+                trailing_dot = u'.'
+                del labels[-1]
+            elif not final:
+                # Keep potentially unfinished label until the next call
+                del labels[-1]
+                if labels:
+                    trailing_dot = u'.'
+
+        result = []
+        size = 0
+        for label in labels:
+            result.append(ulabel(label))
+            if size:
+                size += 1
+            size += len(label)
+
+        result = u".".join(result) + trailing_dot
+        size += len(trailing_dot)
+        return (result, size)
+
+
+class StreamWriter(Codec, codecs.StreamWriter):
+    pass
+
+class StreamReader(Codec, codecs.StreamReader):
+    pass
+
+def getregentry():
+    return codecs.CodecInfo(
+        name='idna',
+        encode=Codec().encode,
+        decode=Codec().decode,
+        incrementalencoder=IncrementalEncoder,
+        incrementaldecoder=IncrementalDecoder,
+        streamwriter=StreamWriter,
+        streamreader=StreamReader,
+    )
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/compat.py b/venv/Lib/site-packages/pip/_vendor/idna/compat.py
new file mode 100644
index 000000000..4d47f336d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/compat.py
@@ -0,0 +1,12 @@
+from .core import *
+from .codec import *
+
+def ToASCII(label):
+    return encode(label)
+
+def ToUnicode(label):
+    return decode(label)
+
+def nameprep(s):
+    raise NotImplementedError("IDNA 2008 does not utilise nameprep protocol")
+
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/core.py b/venv/Lib/site-packages/pip/_vendor/idna/core.py
new file mode 100644
index 000000000..41ec5c711
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/core.py
@@ -0,0 +1,400 @@
+from . import idnadata
+import bisect
+import unicodedata
+import re
+import sys
+from .intranges import intranges_contain
+
+_virama_combining_class = 9
+_alabel_prefix = b'xn--'
+_unicode_dots_re = re.compile(u'[\u002e\u3002\uff0e\uff61]')
+
+if sys.version_info[0] >= 3:
+    unicode = str
+    unichr = chr
+
+class IDNAError(UnicodeError):
+    """ Base exception for all IDNA-encoding related problems """
+    pass
+
+
+class IDNABidiError(IDNAError):
+    """ Exception when bidirectional requirements are not satisfied """
+    pass
+
+
+class InvalidCodepoint(IDNAError):
+    """ Exception when a disallowed or unallocated codepoint is used """
+    pass
+
+
+class InvalidCodepointContext(IDNAError):
+    """ Exception when the codepoint is not valid in the context it is used """
+    pass
+
+
+def _combining_class(cp):
+    v = unicodedata.combining(unichr(cp))
+    if v == 0:
+        if not unicodedata.name(unichr(cp)):
+            raise ValueError("Unknown character in unicodedata")
+    return v
+
+def _is_script(cp, script):
+    return intranges_contain(ord(cp), idnadata.scripts[script])
+
+def _punycode(s):
+    return s.encode('punycode')
+
+def _unot(s):
+    return 'U+{0:04X}'.format(s)
+
+
+def valid_label_length(label):
+
+    if len(label) > 63:
+        return False
+    return True
+
+
+def valid_string_length(label, trailing_dot):
+
+    if len(label) > (254 if trailing_dot else 253):
+        return False
+    return True
+
+
+def check_bidi(label, check_ltr=False):
+
+    # Bidi rules should only be applied if string contains RTL characters
+    bidi_label = False
+    for (idx, cp) in enumerate(label, 1):
+        direction = unicodedata.bidirectional(cp)
+        if direction == '':
+            # String likely comes from a newer version of Unicode
+            raise IDNABidiError('Unknown directionality in label {0} at position {1}'.format(repr(label), idx))
+        if direction in ['R', 'AL', 'AN']:
+            bidi_label = True
+    if not bidi_label and not check_ltr:
+        return True
+
+    # Bidi rule 1
+    direction = unicodedata.bidirectional(label[0])
+    if direction in ['R', 'AL']:
+        rtl = True
+    elif direction == 'L':
+        rtl = False
+    else:
+        raise IDNABidiError('First codepoint in label {0} must be directionality L, R or AL'.format(repr(label)))
+
+    valid_ending = False
+    number_type = False
+    for (idx, cp) in enumerate(label, 1):
+        direction = unicodedata.bidirectional(cp)
+
+        if rtl:
+            # Bidi rule 2
+            if not direction in ['R', 'AL', 'AN', 'EN', 'ES', 'CS', 'ET', 'ON', 'BN', 'NSM']:
+                raise IDNABidiError('Invalid direction for codepoint at position {0} in a right-to-left label'.format(idx))
+            # Bidi rule 3
+            if direction in ['R', 'AL', 'EN', 'AN']:
+                valid_ending = True
+            elif direction != 'NSM':
+                valid_ending = False
+            # Bidi rule 4
+            if direction in ['AN', 'EN']:
+                if not number_type:
+                    number_type = direction
+                else:
+                    if number_type != direction:
+                        raise IDNABidiError('Can not mix numeral types in a right-to-left label')
+        else:
+            # Bidi rule 5
+            if not direction in ['L', 'EN', 'ES', 'CS', 'ET', 'ON', 'BN', 'NSM']:
+                raise IDNABidiError('Invalid direction for codepoint at position {0} in a left-to-right label'.format(idx))
+            # Bidi rule 6
+            if direction in ['L', 'EN']:
+                valid_ending = True
+            elif direction != 'NSM':
+                valid_ending = False
+
+    if not valid_ending:
+        raise IDNABidiError('Label ends with illegal codepoint directionality')
+
+    return True
+
+
+def check_initial_combiner(label):
+
+    if unicodedata.category(label[0])[0] == 'M':
+        raise IDNAError('Label begins with an illegal combining character')
+    return True
+
+
+def check_hyphen_ok(label):
+
+    if label[2:4] == '--':
+        raise IDNAError('Label has disallowed hyphens in 3rd and 4th position')
+    if label[0] == '-' or label[-1] == '-':
+        raise IDNAError('Label must not start or end with a hyphen')
+    return True
+
+
+def check_nfc(label):
+
+    if unicodedata.normalize('NFC', label) != label:
+        raise IDNAError('Label must be in Normalization Form C')
+
+
+def valid_contextj(label, pos):
+
+    cp_value = ord(label[pos])
+
+    if cp_value == 0x200c:
+
+        if pos > 0:
+            if _combining_class(ord(label[pos - 1])) == _virama_combining_class:
+                return True
+
+        ok = False
+        for i in range(pos-1, -1, -1):
+            joining_type = idnadata.joining_types.get(ord(label[i]))
+            if joining_type == ord('T'):
+                continue
+            if joining_type in [ord('L'), ord('D')]:
+                ok = True
+                break
+
+        if not ok:
+            return False
+
+        ok = False
+        for i in range(pos+1, len(label)):
+            joining_type = idnadata.joining_types.get(ord(label[i]))
+            if joining_type == ord('T'):
+                continue
+            if joining_type in [ord('R'), ord('D')]:
+                ok = True
+                break
+        return ok
+
+    if cp_value == 0x200d:
+
+        if pos > 0:
+            if _combining_class(ord(label[pos - 1])) == _virama_combining_class:
+                return True
+        return False
+
+    else:
+
+        return False
+
+
+def valid_contexto(label, pos, exception=False):
+
+    cp_value = ord(label[pos])
+
+    if cp_value == 0x00b7:
+        if 0 < pos < len(label)-1:
+            if ord(label[pos - 1]) == 0x006c and ord(label[pos + 1]) == 0x006c:
+                return True
+        return False
+
+    elif cp_value == 0x0375:
+        if pos < len(label)-1 and len(label) > 1:
+            return _is_script(label[pos + 1], 'Greek')
+        return False
+
+    elif cp_value == 0x05f3 or cp_value == 0x05f4:
+        if pos > 0:
+            return _is_script(label[pos - 1], 'Hebrew')
+        return False
+
+    elif cp_value == 0x30fb:
+        for cp in label:
+            if cp == u'\u30fb':
+                continue
+            if _is_script(cp, 'Hiragana') or _is_script(cp, 'Katakana') or _is_script(cp, 'Han'):
+                return True
+        return False
+
+    elif 0x660 <= cp_value <= 0x669:
+        for cp in label:
+            if 0x6f0 <= ord(cp) <= 0x06f9:
+                return False
+        return True
+
+    elif 0x6f0 <= cp_value <= 0x6f9:
+        for cp in label:
+            if 0x660 <= ord(cp) <= 0x0669:
+                return False
+        return True
+
+
+def check_label(label):
+
+    if isinstance(label, (bytes, bytearray)):
+        label = label.decode('utf-8')
+    if len(label) == 0:
+        raise IDNAError('Empty Label')
+
+    check_nfc(label)
+    check_hyphen_ok(label)
+    check_initial_combiner(label)
+
+    for (pos, cp) in enumerate(label):
+        cp_value = ord(cp)
+        if intranges_contain(cp_value, idnadata.codepoint_classes['PVALID']):
+            continue
+        elif intranges_contain(cp_value, idnadata.codepoint_classes['CONTEXTJ']):
+            try:
+                if not valid_contextj(label, pos):
+                    raise InvalidCodepointContext('Joiner {0} not allowed at position {1} in {2}'.format(
+                        _unot(cp_value), pos+1, repr(label)))
+            except ValueError:
+                raise IDNAError('Unknown codepoint adjacent to joiner {0} at position {1} in {2}'.format(
+                    _unot(cp_value), pos+1, repr(label)))
+        elif intranges_contain(cp_value, idnadata.codepoint_classes['CONTEXTO']):
+            if not valid_contexto(label, pos):
+                raise InvalidCodepointContext('Codepoint {0} not allowed at position {1} in {2}'.format(_unot(cp_value), pos+1, repr(label)))
+        else:
+            raise InvalidCodepoint('Codepoint {0} at position {1} of {2} not allowed'.format(_unot(cp_value), pos+1, repr(label)))
+
+    check_bidi(label)
+
+
+def alabel(label):
+
+    try:
+        label = label.encode('ascii')
+        ulabel(label)
+        if not valid_label_length(label):
+            raise IDNAError('Label too long')
+        return label
+    except UnicodeEncodeError:
+        pass
+
+    if not label:
+        raise IDNAError('No Input')
+
+    label = unicode(label)
+    check_label(label)
+    label = _punycode(label)
+    label = _alabel_prefix + label
+
+    if not valid_label_length(label):
+        raise IDNAError('Label too long')
+
+    return label
+
+
+def ulabel(label):
+
+    if not isinstance(label, (bytes, bytearray)):
+        try:
+            label = label.encode('ascii')
+        except UnicodeEncodeError:
+            check_label(label)
+            return label
+
+    label = label.lower()
+    if label.startswith(_alabel_prefix):
+        label = label[len(_alabel_prefix):]
+        if not label:
+            raise IDNAError('Malformed A-label, no Punycode eligible content found')
+        if label.decode('ascii')[-1] == '-':
+            raise IDNAError('A-label must not end with a hyphen')
+    else:
+        check_label(label)
+        return label.decode('ascii')
+
+    label = label.decode('punycode')
+    check_label(label)
+    return label
+
+
+def uts46_remap(domain, std3_rules=True, transitional=False):
+    """Re-map the characters in the string according to UTS46 processing."""
+    from .uts46data import uts46data
+    output = u""
+    try:
+        for pos, char in enumerate(domain):
+            code_point = ord(char)
+            uts46row = uts46data[code_point if code_point < 256 else
+                bisect.bisect_left(uts46data, (code_point, "Z")) - 1]
+            status = uts46row[1]
+            replacement = uts46row[2] if len(uts46row) == 3 else None
+            if (status == "V" or
+                    (status == "D" and not transitional) or
+                    (status == "3" and not std3_rules and replacement is None)):
+                output += char
+            elif replacement is not None and (status == "M" or
+                    (status == "3" and not std3_rules) or
+                    (status == "D" and transitional)):
+                output += replacement
+            elif status != "I":
+                raise IndexError()
+        return unicodedata.normalize("NFC", output)
+    except IndexError:
+        raise InvalidCodepoint(
+            "Codepoint {0} not allowed at position {1} in {2}".format(
+            _unot(code_point), pos + 1, repr(domain)))
+
+
+def encode(s, strict=False, uts46=False, std3_rules=False, transitional=False):
+
+    if isinstance(s, (bytes, bytearray)):
+        s = s.decode("ascii")
+    if uts46:
+        s = uts46_remap(s, std3_rules, transitional)
+    trailing_dot = False
+    result = []
+    if strict:
+        labels = s.split('.')
+    else:
+        labels = _unicode_dots_re.split(s)
+    if not labels or labels == ['']:
+        raise IDNAError('Empty domain')
+    if labels[-1] == '':
+        del labels[-1]
+        trailing_dot = True
+    for label in labels:
+        s = alabel(label)
+        if s:
+            result.append(s)
+        else:
+            raise IDNAError('Empty label')
+    if trailing_dot:
+        result.append(b'')
+    s = b'.'.join(result)
+    if not valid_string_length(s, trailing_dot):
+        raise IDNAError('Domain too long')
+    return s
+
+
+def decode(s, strict=False, uts46=False, std3_rules=False):
+
+    if isinstance(s, (bytes, bytearray)):
+        s = s.decode("ascii")
+    if uts46:
+        s = uts46_remap(s, std3_rules, False)
+    trailing_dot = False
+    result = []
+    if not strict:
+        labels = _unicode_dots_re.split(s)
+    else:
+        labels = s.split(u'.')
+    if not labels or labels == ['']:
+        raise IDNAError('Empty domain')
+    if not labels[-1]:
+        del labels[-1]
+        trailing_dot = True
+    for label in labels:
+        s = ulabel(label)
+        if s:
+            result.append(s)
+        else:
+            raise IDNAError('Empty label')
+    if trailing_dot:
+        result.append(u'')
+    return u'.'.join(result)
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/idnadata.py b/venv/Lib/site-packages/pip/_vendor/idna/idnadata.py
new file mode 100644
index 000000000..a284e4c84
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/idnadata.py
@@ -0,0 +1,2050 @@
+# This file is automatically generated by tools/idna-data
+
+__version__ = "13.0.0"
+scripts = {
+    'Greek': (
+        0x37000000374,
+        0x37500000378,
+        0x37a0000037e,
+        0x37f00000380,
+        0x38400000385,
+        0x38600000387,
+        0x3880000038b,
+        0x38c0000038d,
+        0x38e000003a2,
+        0x3a3000003e2,
+        0x3f000000400,
+        0x1d2600001d2b,
+        0x1d5d00001d62,
+        0x1d6600001d6b,
+        0x1dbf00001dc0,
+        0x1f0000001f16,
+        0x1f1800001f1e,
+        0x1f2000001f46,
+        0x1f4800001f4e,
+        0x1f5000001f58,
+        0x1f5900001f5a,
+        0x1f5b00001f5c,
+        0x1f5d00001f5e,
+        0x1f5f00001f7e,
+        0x1f8000001fb5,
+        0x1fb600001fc5,
+        0x1fc600001fd4,
+        0x1fd600001fdc,
+        0x1fdd00001ff0,
+        0x1ff200001ff5,
+        0x1ff600001fff,
+        0x212600002127,
+        0xab650000ab66,
+        0x101400001018f,
+        0x101a0000101a1,
+        0x1d2000001d246,
+    ),
+    'Han': (
+        0x2e8000002e9a,
+        0x2e9b00002ef4,
+        0x2f0000002fd6,
+        0x300500003006,
+        0x300700003008,
+        0x30210000302a,
+        0x30380000303c,
+        0x340000004dc0,
+        0x4e0000009ffd,
+        0xf9000000fa6e,
+        0xfa700000fada,
+        0x16ff000016ff2,
+        0x200000002a6de,
+        0x2a7000002b735,
+        0x2b7400002b81e,
+        0x2b8200002cea2,
+        0x2ceb00002ebe1,
+        0x2f8000002fa1e,
+        0x300000003134b,
+    ),
+    'Hebrew': (
+        0x591000005c8,
+        0x5d0000005eb,
+        0x5ef000005f5,
+        0xfb1d0000fb37,
+        0xfb380000fb3d,
+        0xfb3e0000fb3f,
+        0xfb400000fb42,
+        0xfb430000fb45,
+        0xfb460000fb50,
+    ),
+    'Hiragana': (
+        0x304100003097,
+        0x309d000030a0,
+        0x1b0010001b11f,
+        0x1b1500001b153,
+        0x1f2000001f201,
+    ),
+    'Katakana': (
+        0x30a1000030fb,
+        0x30fd00003100,
+        0x31f000003200,
+        0x32d0000032ff,
+        0x330000003358,
+        0xff660000ff70,
+        0xff710000ff9e,
+        0x1b0000001b001,
+        0x1b1640001b168,
+    ),
+}
+joining_types = {
+    0x600: 85,
+    0x601: 85,
+    0x602: 85,
+    0x603: 85,
+    0x604: 85,
+    0x605: 85,
+    0x608: 85,
+    0x60b: 85,
+    0x620: 68,
+    0x621: 85,
+    0x622: 82,
+    0x623: 82,
+    0x624: 82,
+    0x625: 82,
+    0x626: 68,
+    0x627: 82,
+    0x628: 68,
+    0x629: 82,
+    0x62a: 68,
+    0x62b: 68,
+    0x62c: 68,
+    0x62d: 68,
+    0x62e: 68,
+    0x62f: 82,
+    0x630: 82,
+    0x631: 82,
+    0x632: 82,
+    0x633: 68,
+    0x634: 68,
+    0x635: 68,
+    0x636: 68,
+    0x637: 68,
+    0x638: 68,
+    0x639: 68,
+    0x63a: 68,
+    0x63b: 68,
+    0x63c: 68,
+    0x63d: 68,
+    0x63e: 68,
+    0x63f: 68,
+    0x640: 67,
+    0x641: 68,
+    0x642: 68,
+    0x643: 68,
+    0x644: 68,
+    0x645: 68,
+    0x646: 68,
+    0x647: 68,
+    0x648: 82,
+    0x649: 68,
+    0x64a: 68,
+    0x66e: 68,
+    0x66f: 68,
+    0x671: 82,
+    0x672: 82,
+    0x673: 82,
+    0x674: 85,
+    0x675: 82,
+    0x676: 82,
+    0x677: 82,
+    0x678: 68,
+    0x679: 68,
+    0x67a: 68,
+    0x67b: 68,
+    0x67c: 68,
+    0x67d: 68,
+    0x67e: 68,
+    0x67f: 68,
+    0x680: 68,
+    0x681: 68,
+    0x682: 68,
+    0x683: 68,
+    0x684: 68,
+    0x685: 68,
+    0x686: 68,
+    0x687: 68,
+    0x688: 82,
+    0x689: 82,
+    0x68a: 82,
+    0x68b: 82,
+    0x68c: 82,
+    0x68d: 82,
+    0x68e: 82,
+    0x68f: 82,
+    0x690: 82,
+    0x691: 82,
+    0x692: 82,
+    0x693: 82,
+    0x694: 82,
+    0x695: 82,
+    0x696: 82,
+    0x697: 82,
+    0x698: 82,
+    0x699: 82,
+    0x69a: 68,
+    0x69b: 68,
+    0x69c: 68,
+    0x69d: 68,
+    0x69e: 68,
+    0x69f: 68,
+    0x6a0: 68,
+    0x6a1: 68,
+    0x6a2: 68,
+    0x6a3: 68,
+    0x6a4: 68,
+    0x6a5: 68,
+    0x6a6: 68,
+    0x6a7: 68,
+    0x6a8: 68,
+    0x6a9: 68,
+    0x6aa: 68,
+    0x6ab: 68,
+    0x6ac: 68,
+    0x6ad: 68,
+    0x6ae: 68,
+    0x6af: 68,
+    0x6b0: 68,
+    0x6b1: 68,
+    0x6b2: 68,
+    0x6b3: 68,
+    0x6b4: 68,
+    0x6b5: 68,
+    0x6b6: 68,
+    0x6b7: 68,
+    0x6b8: 68,
+    0x6b9: 68,
+    0x6ba: 68,
+    0x6bb: 68,
+    0x6bc: 68,
+    0x6bd: 68,
+    0x6be: 68,
+    0x6bf: 68,
+    0x6c0: 82,
+    0x6c1: 68,
+    0x6c2: 68,
+    0x6c3: 82,
+    0x6c4: 82,
+    0x6c5: 82,
+    0x6c6: 82,
+    0x6c7: 82,
+    0x6c8: 82,
+    0x6c9: 82,
+    0x6ca: 82,
+    0x6cb: 82,
+    0x6cc: 68,
+    0x6cd: 82,
+    0x6ce: 68,
+    0x6cf: 82,
+    0x6d0: 68,
+    0x6d1: 68,
+    0x6d2: 82,
+    0x6d3: 82,
+    0x6d5: 82,
+    0x6dd: 85,
+    0x6ee: 82,
+    0x6ef: 82,
+    0x6fa: 68,
+    0x6fb: 68,
+    0x6fc: 68,
+    0x6ff: 68,
+    0x70f: 84,
+    0x710: 82,
+    0x712: 68,
+    0x713: 68,
+    0x714: 68,
+    0x715: 82,
+    0x716: 82,
+    0x717: 82,
+    0x718: 82,
+    0x719: 82,
+    0x71a: 68,
+    0x71b: 68,
+    0x71c: 68,
+    0x71d: 68,
+    0x71e: 82,
+    0x71f: 68,
+    0x720: 68,
+    0x721: 68,
+    0x722: 68,
+    0x723: 68,
+    0x724: 68,
+    0x725: 68,
+    0x726: 68,
+    0x727: 68,
+    0x728: 82,
+    0x729: 68,
+    0x72a: 82,
+    0x72b: 68,
+    0x72c: 82,
+    0x72d: 68,
+    0x72e: 68,
+    0x72f: 82,
+    0x74d: 82,
+    0x74e: 68,
+    0x74f: 68,
+    0x750: 68,
+    0x751: 68,
+    0x752: 68,
+    0x753: 68,
+    0x754: 68,
+    0x755: 68,
+    0x756: 68,
+    0x757: 68,
+    0x758: 68,
+    0x759: 82,
+    0x75a: 82,
+    0x75b: 82,
+    0x75c: 68,
+    0x75d: 68,
+    0x75e: 68,
+    0x75f: 68,
+    0x760: 68,
+    0x761: 68,
+    0x762: 68,
+    0x763: 68,
+    0x764: 68,
+    0x765: 68,
+    0x766: 68,
+    0x767: 68,
+    0x768: 68,
+    0x769: 68,
+    0x76a: 68,
+    0x76b: 82,
+    0x76c: 82,
+    0x76d: 68,
+    0x76e: 68,
+    0x76f: 68,
+    0x770: 68,
+    0x771: 82,
+    0x772: 68,
+    0x773: 82,
+    0x774: 82,
+    0x775: 68,
+    0x776: 68,
+    0x777: 68,
+    0x778: 82,
+    0x779: 82,
+    0x77a: 68,
+    0x77b: 68,
+    0x77c: 68,
+    0x77d: 68,
+    0x77e: 68,
+    0x77f: 68,
+    0x7ca: 68,
+    0x7cb: 68,
+    0x7cc: 68,
+    0x7cd: 68,
+    0x7ce: 68,
+    0x7cf: 68,
+    0x7d0: 68,
+    0x7d1: 68,
+    0x7d2: 68,
+    0x7d3: 68,
+    0x7d4: 68,
+    0x7d5: 68,
+    0x7d6: 68,
+    0x7d7: 68,
+    0x7d8: 68,
+    0x7d9: 68,
+    0x7da: 68,
+    0x7db: 68,
+    0x7dc: 68,
+    0x7dd: 68,
+    0x7de: 68,
+    0x7df: 68,
+    0x7e0: 68,
+    0x7e1: 68,
+    0x7e2: 68,
+    0x7e3: 68,
+    0x7e4: 68,
+    0x7e5: 68,
+    0x7e6: 68,
+    0x7e7: 68,
+    0x7e8: 68,
+    0x7e9: 68,
+    0x7ea: 68,
+    0x7fa: 67,
+    0x840: 82,
+    0x841: 68,
+    0x842: 68,
+    0x843: 68,
+    0x844: 68,
+    0x845: 68,
+    0x846: 82,
+    0x847: 82,
+    0x848: 68,
+    0x849: 82,
+    0x84a: 68,
+    0x84b: 68,
+    0x84c: 68,
+    0x84d: 68,
+    0x84e: 68,
+    0x84f: 68,
+    0x850: 68,
+    0x851: 68,
+    0x852: 68,
+    0x853: 68,
+    0x854: 82,
+    0x855: 68,
+    0x856: 82,
+    0x857: 82,
+    0x858: 82,
+    0x860: 68,
+    0x861: 85,
+    0x862: 68,
+    0x863: 68,
+    0x864: 68,
+    0x865: 68,
+    0x866: 85,
+    0x867: 82,
+    0x868: 68,
+    0x869: 82,
+    0x86a: 82,
+    0x8a0: 68,
+    0x8a1: 68,
+    0x8a2: 68,
+    0x8a3: 68,
+    0x8a4: 68,
+    0x8a5: 68,
+    0x8a6: 68,
+    0x8a7: 68,
+    0x8a8: 68,
+    0x8a9: 68,
+    0x8aa: 82,
+    0x8ab: 82,
+    0x8ac: 82,
+    0x8ad: 85,
+    0x8ae: 82,
+    0x8af: 68,
+    0x8b0: 68,
+    0x8b1: 82,
+    0x8b2: 82,
+    0x8b3: 68,
+    0x8b4: 68,
+    0x8b6: 68,
+    0x8b7: 68,
+    0x8b8: 68,
+    0x8b9: 82,
+    0x8ba: 68,
+    0x8bb: 68,
+    0x8bc: 68,
+    0x8bd: 68,
+    0x8be: 68,
+    0x8bf: 68,
+    0x8c0: 68,
+    0x8c1: 68,
+    0x8c2: 68,
+    0x8c3: 68,
+    0x8c4: 68,
+    0x8c5: 68,
+    0x8c6: 68,
+    0x8c7: 68,
+    0x8e2: 85,
+    0x1806: 85,
+    0x1807: 68,
+    0x180a: 67,
+    0x180e: 85,
+    0x1820: 68,
+    0x1821: 68,
+    0x1822: 68,
+    0x1823: 68,
+    0x1824: 68,
+    0x1825: 68,
+    0x1826: 68,
+    0x1827: 68,
+    0x1828: 68,
+    0x1829: 68,
+    0x182a: 68,
+    0x182b: 68,
+    0x182c: 68,
+    0x182d: 68,
+    0x182e: 68,
+    0x182f: 68,
+    0x1830: 68,
+    0x1831: 68,
+    0x1832: 68,
+    0x1833: 68,
+    0x1834: 68,
+    0x1835: 68,
+    0x1836: 68,
+    0x1837: 68,
+    0x1838: 68,
+    0x1839: 68,
+    0x183a: 68,
+    0x183b: 68,
+    0x183c: 68,
+    0x183d: 68,
+    0x183e: 68,
+    0x183f: 68,
+    0x1840: 68,
+    0x1841: 68,
+    0x1842: 68,
+    0x1843: 68,
+    0x1844: 68,
+    0x1845: 68,
+    0x1846: 68,
+    0x1847: 68,
+    0x1848: 68,
+    0x1849: 68,
+    0x184a: 68,
+    0x184b: 68,
+    0x184c: 68,
+    0x184d: 68,
+    0x184e: 68,
+    0x184f: 68,
+    0x1850: 68,
+    0x1851: 68,
+    0x1852: 68,
+    0x1853: 68,
+    0x1854: 68,
+    0x1855: 68,
+    0x1856: 68,
+    0x1857: 68,
+    0x1858: 68,
+    0x1859: 68,
+    0x185a: 68,
+    0x185b: 68,
+    0x185c: 68,
+    0x185d: 68,
+    0x185e: 68,
+    0x185f: 68,
+    0x1860: 68,
+    0x1861: 68,
+    0x1862: 68,
+    0x1863: 68,
+    0x1864: 68,
+    0x1865: 68,
+    0x1866: 68,
+    0x1867: 68,
+    0x1868: 68,
+    0x1869: 68,
+    0x186a: 68,
+    0x186b: 68,
+    0x186c: 68,
+    0x186d: 68,
+    0x186e: 68,
+    0x186f: 68,
+    0x1870: 68,
+    0x1871: 68,
+    0x1872: 68,
+    0x1873: 68,
+    0x1874: 68,
+    0x1875: 68,
+    0x1876: 68,
+    0x1877: 68,
+    0x1878: 68,
+    0x1880: 85,
+    0x1881: 85,
+    0x1882: 85,
+    0x1883: 85,
+    0x1884: 85,
+    0x1885: 84,
+    0x1886: 84,
+    0x1887: 68,
+    0x1888: 68,
+    0x1889: 68,
+    0x188a: 68,
+    0x188b: 68,
+    0x188c: 68,
+    0x188d: 68,
+    0x188e: 68,
+    0x188f: 68,
+    0x1890: 68,
+    0x1891: 68,
+    0x1892: 68,
+    0x1893: 68,
+    0x1894: 68,
+    0x1895: 68,
+    0x1896: 68,
+    0x1897: 68,
+    0x1898: 68,
+    0x1899: 68,
+    0x189a: 68,
+    0x189b: 68,
+    0x189c: 68,
+    0x189d: 68,
+    0x189e: 68,
+    0x189f: 68,
+    0x18a0: 68,
+    0x18a1: 68,
+    0x18a2: 68,
+    0x18a3: 68,
+    0x18a4: 68,
+    0x18a5: 68,
+    0x18a6: 68,
+    0x18a7: 68,
+    0x18a8: 68,
+    0x18aa: 68,
+    0x200c: 85,
+    0x200d: 67,
+    0x202f: 85,
+    0x2066: 85,
+    0x2067: 85,
+    0x2068: 85,
+    0x2069: 85,
+    0xa840: 68,
+    0xa841: 68,
+    0xa842: 68,
+    0xa843: 68,
+    0xa844: 68,
+    0xa845: 68,
+    0xa846: 68,
+    0xa847: 68,
+    0xa848: 68,
+    0xa849: 68,
+    0xa84a: 68,
+    0xa84b: 68,
+    0xa84c: 68,
+    0xa84d: 68,
+    0xa84e: 68,
+    0xa84f: 68,
+    0xa850: 68,
+    0xa851: 68,
+    0xa852: 68,
+    0xa853: 68,
+    0xa854: 68,
+    0xa855: 68,
+    0xa856: 68,
+    0xa857: 68,
+    0xa858: 68,
+    0xa859: 68,
+    0xa85a: 68,
+    0xa85b: 68,
+    0xa85c: 68,
+    0xa85d: 68,
+    0xa85e: 68,
+    0xa85f: 68,
+    0xa860: 68,
+    0xa861: 68,
+    0xa862: 68,
+    0xa863: 68,
+    0xa864: 68,
+    0xa865: 68,
+    0xa866: 68,
+    0xa867: 68,
+    0xa868: 68,
+    0xa869: 68,
+    0xa86a: 68,
+    0xa86b: 68,
+    0xa86c: 68,
+    0xa86d: 68,
+    0xa86e: 68,
+    0xa86f: 68,
+    0xa870: 68,
+    0xa871: 68,
+    0xa872: 76,
+    0xa873: 85,
+    0x10ac0: 68,
+    0x10ac1: 68,
+    0x10ac2: 68,
+    0x10ac3: 68,
+    0x10ac4: 68,
+    0x10ac5: 82,
+    0x10ac6: 85,
+    0x10ac7: 82,
+    0x10ac8: 85,
+    0x10ac9: 82,
+    0x10aca: 82,
+    0x10acb: 85,
+    0x10acc: 85,
+    0x10acd: 76,
+    0x10ace: 82,
+    0x10acf: 82,
+    0x10ad0: 82,
+    0x10ad1: 82,
+    0x10ad2: 82,
+    0x10ad3: 68,
+    0x10ad4: 68,
+    0x10ad5: 68,
+    0x10ad6: 68,
+    0x10ad7: 76,
+    0x10ad8: 68,
+    0x10ad9: 68,
+    0x10ada: 68,
+    0x10adb: 68,
+    0x10adc: 68,
+    0x10add: 82,
+    0x10ade: 68,
+    0x10adf: 68,
+    0x10ae0: 68,
+    0x10ae1: 82,
+    0x10ae2: 85,
+    0x10ae3: 85,
+    0x10ae4: 82,
+    0x10aeb: 68,
+    0x10aec: 68,
+    0x10aed: 68,
+    0x10aee: 68,
+    0x10aef: 82,
+    0x10b80: 68,
+    0x10b81: 82,
+    0x10b82: 68,
+    0x10b83: 82,
+    0x10b84: 82,
+    0x10b85: 82,
+    0x10b86: 68,
+    0x10b87: 68,
+    0x10b88: 68,
+    0x10b89: 82,
+    0x10b8a: 68,
+    0x10b8b: 68,
+    0x10b8c: 82,
+    0x10b8d: 68,
+    0x10b8e: 82,
+    0x10b8f: 82,
+    0x10b90: 68,
+    0x10b91: 82,
+    0x10ba9: 82,
+    0x10baa: 82,
+    0x10bab: 82,
+    0x10bac: 82,
+    0x10bad: 68,
+    0x10bae: 68,
+    0x10baf: 85,
+    0x10d00: 76,
+    0x10d01: 68,
+    0x10d02: 68,
+    0x10d03: 68,
+    0x10d04: 68,
+    0x10d05: 68,
+    0x10d06: 68,
+    0x10d07: 68,
+    0x10d08: 68,
+    0x10d09: 68,
+    0x10d0a: 68,
+    0x10d0b: 68,
+    0x10d0c: 68,
+    0x10d0d: 68,
+    0x10d0e: 68,
+    0x10d0f: 68,
+    0x10d10: 68,
+    0x10d11: 68,
+    0x10d12: 68,
+    0x10d13: 68,
+    0x10d14: 68,
+    0x10d15: 68,
+    0x10d16: 68,
+    0x10d17: 68,
+    0x10d18: 68,
+    0x10d19: 68,
+    0x10d1a: 68,
+    0x10d1b: 68,
+    0x10d1c: 68,
+    0x10d1d: 68,
+    0x10d1e: 68,
+    0x10d1f: 68,
+    0x10d20: 68,
+    0x10d21: 68,
+    0x10d22: 82,
+    0x10d23: 68,
+    0x10f30: 68,
+    0x10f31: 68,
+    0x10f32: 68,
+    0x10f33: 82,
+    0x10f34: 68,
+    0x10f35: 68,
+    0x10f36: 68,
+    0x10f37: 68,
+    0x10f38: 68,
+    0x10f39: 68,
+    0x10f3a: 68,
+    0x10f3b: 68,
+    0x10f3c: 68,
+    0x10f3d: 68,
+    0x10f3e: 68,
+    0x10f3f: 68,
+    0x10f40: 68,
+    0x10f41: 68,
+    0x10f42: 68,
+    0x10f43: 68,
+    0x10f44: 68,
+    0x10f45: 85,
+    0x10f51: 68,
+    0x10f52: 68,
+    0x10f53: 68,
+    0x10f54: 82,
+    0x10fb0: 68,
+    0x10fb1: 85,
+    0x10fb2: 68,
+    0x10fb3: 68,
+    0x10fb4: 82,
+    0x10fb5: 82,
+    0x10fb6: 82,
+    0x10fb7: 85,
+    0x10fb8: 68,
+    0x10fb9: 82,
+    0x10fba: 82,
+    0x10fbb: 68,
+    0x10fbc: 68,
+    0x10fbd: 82,
+    0x10fbe: 68,
+    0x10fbf: 68,
+    0x10fc0: 85,
+    0x10fc1: 68,
+    0x10fc2: 82,
+    0x10fc3: 82,
+    0x10fc4: 68,
+    0x10fc5: 85,
+    0x10fc6: 85,
+    0x10fc7: 85,
+    0x10fc8: 85,
+    0x10fc9: 82,
+    0x10fca: 68,
+    0x10fcb: 76,
+    0x110bd: 85,
+    0x110cd: 85,
+    0x1e900: 68,
+    0x1e901: 68,
+    0x1e902: 68,
+    0x1e903: 68,
+    0x1e904: 68,
+    0x1e905: 68,
+    0x1e906: 68,
+    0x1e907: 68,
+    0x1e908: 68,
+    0x1e909: 68,
+    0x1e90a: 68,
+    0x1e90b: 68,
+    0x1e90c: 68,
+    0x1e90d: 68,
+    0x1e90e: 68,
+    0x1e90f: 68,
+    0x1e910: 68,
+    0x1e911: 68,
+    0x1e912: 68,
+    0x1e913: 68,
+    0x1e914: 68,
+    0x1e915: 68,
+    0x1e916: 68,
+    0x1e917: 68,
+    0x1e918: 68,
+    0x1e919: 68,
+    0x1e91a: 68,
+    0x1e91b: 68,
+    0x1e91c: 68,
+    0x1e91d: 68,
+    0x1e91e: 68,
+    0x1e91f: 68,
+    0x1e920: 68,
+    0x1e921: 68,
+    0x1e922: 68,
+    0x1e923: 68,
+    0x1e924: 68,
+    0x1e925: 68,
+    0x1e926: 68,
+    0x1e927: 68,
+    0x1e928: 68,
+    0x1e929: 68,
+    0x1e92a: 68,
+    0x1e92b: 68,
+    0x1e92c: 68,
+    0x1e92d: 68,
+    0x1e92e: 68,
+    0x1e92f: 68,
+    0x1e930: 68,
+    0x1e931: 68,
+    0x1e932: 68,
+    0x1e933: 68,
+    0x1e934: 68,
+    0x1e935: 68,
+    0x1e936: 68,
+    0x1e937: 68,
+    0x1e938: 68,
+    0x1e939: 68,
+    0x1e93a: 68,
+    0x1e93b: 68,
+    0x1e93c: 68,
+    0x1e93d: 68,
+    0x1e93e: 68,
+    0x1e93f: 68,
+    0x1e940: 68,
+    0x1e941: 68,
+    0x1e942: 68,
+    0x1e943: 68,
+    0x1e94b: 84,
+}
+codepoint_classes = {
+    'PVALID': (
+        0x2d0000002e,
+        0x300000003a,
+        0x610000007b,
+        0xdf000000f7,
+        0xf800000100,
+        0x10100000102,
+        0x10300000104,
+        0x10500000106,
+        0x10700000108,
+        0x1090000010a,
+        0x10b0000010c,
+        0x10d0000010e,
+        0x10f00000110,
+        0x11100000112,
+        0x11300000114,
+        0x11500000116,
+        0x11700000118,
+        0x1190000011a,
+        0x11b0000011c,
+        0x11d0000011e,
+        0x11f00000120,
+        0x12100000122,
+        0x12300000124,
+        0x12500000126,
+        0x12700000128,
+        0x1290000012a,
+        0x12b0000012c,
+        0x12d0000012e,
+        0x12f00000130,
+        0x13100000132,
+        0x13500000136,
+        0x13700000139,
+        0x13a0000013b,
+        0x13c0000013d,
+        0x13e0000013f,
+        0x14200000143,
+        0x14400000145,
+        0x14600000147,
+        0x14800000149,
+        0x14b0000014c,
+        0x14d0000014e,
+        0x14f00000150,
+        0x15100000152,
+        0x15300000154,
+        0x15500000156,
+        0x15700000158,
+        0x1590000015a,
+        0x15b0000015c,
+        0x15d0000015e,
+        0x15f00000160,
+        0x16100000162,
+        0x16300000164,
+        0x16500000166,
+        0x16700000168,
+        0x1690000016a,
+        0x16b0000016c,
+        0x16d0000016e,
+        0x16f00000170,
+        0x17100000172,
+        0x17300000174,
+        0x17500000176,
+        0x17700000178,
+        0x17a0000017b,
+        0x17c0000017d,
+        0x17e0000017f,
+        0x18000000181,
+        0x18300000184,
+        0x18500000186,
+        0x18800000189,
+        0x18c0000018e,
+        0x19200000193,
+        0x19500000196,
+        0x1990000019c,
+        0x19e0000019f,
+        0x1a1000001a2,
+        0x1a3000001a4,
+        0x1a5000001a6,
+        0x1a8000001a9,
+        0x1aa000001ac,
+        0x1ad000001ae,
+        0x1b0000001b1,
+        0x1b4000001b5,
+        0x1b6000001b7,
+        0x1b9000001bc,
+        0x1bd000001c4,
+        0x1ce000001cf,
+        0x1d0000001d1,
+        0x1d2000001d3,
+        0x1d4000001d5,
+        0x1d6000001d7,
+        0x1d8000001d9,
+        0x1da000001db,
+        0x1dc000001de,
+        0x1df000001e0,
+        0x1e1000001e2,
+        0x1e3000001e4,
+        0x1e5000001e6,
+        0x1e7000001e8,
+        0x1e9000001ea,
+        0x1eb000001ec,
+        0x1ed000001ee,
+        0x1ef000001f1,
+        0x1f5000001f6,
+        0x1f9000001fa,
+        0x1fb000001fc,
+        0x1fd000001fe,
+        0x1ff00000200,
+        0x20100000202,
+        0x20300000204,
+        0x20500000206,
+        0x20700000208,
+        0x2090000020a,
+        0x20b0000020c,
+        0x20d0000020e,
+        0x20f00000210,
+        0x21100000212,
+        0x21300000214,
+        0x21500000216,
+        0x21700000218,
+        0x2190000021a,
+        0x21b0000021c,
+        0x21d0000021e,
+        0x21f00000220,
+        0x22100000222,
+        0x22300000224,
+        0x22500000226,
+        0x22700000228,
+        0x2290000022a,
+        0x22b0000022c,
+        0x22d0000022e,
+        0x22f00000230,
+        0x23100000232,
+        0x2330000023a,
+        0x23c0000023d,
+        0x23f00000241,
+        0x24200000243,
+        0x24700000248,
+        0x2490000024a,
+        0x24b0000024c,
+        0x24d0000024e,
+        0x24f000002b0,
+        0x2b9000002c2,
+        0x2c6000002d2,
+        0x2ec000002ed,
+        0x2ee000002ef,
+        0x30000000340,
+        0x34200000343,
+        0x3460000034f,
+        0x35000000370,
+        0x37100000372,
+        0x37300000374,
+        0x37700000378,
+        0x37b0000037e,
+        0x39000000391,
+        0x3ac000003cf,
+        0x3d7000003d8,
+        0x3d9000003da,
+        0x3db000003dc,
+        0x3dd000003de,
+        0x3df000003e0,
+        0x3e1000003e2,
+        0x3e3000003e4,
+        0x3e5000003e6,
+        0x3e7000003e8,
+        0x3e9000003ea,
+        0x3eb000003ec,
+        0x3ed000003ee,
+        0x3ef000003f0,
+        0x3f3000003f4,
+        0x3f8000003f9,
+        0x3fb000003fd,
+        0x43000000460,
+        0x46100000462,
+        0x46300000464,
+        0x46500000466,
+        0x46700000468,
+        0x4690000046a,
+        0x46b0000046c,
+        0x46d0000046e,
+        0x46f00000470,
+        0x47100000472,
+        0x47300000474,
+        0x47500000476,
+        0x47700000478,
+        0x4790000047a,
+        0x47b0000047c,
+        0x47d0000047e,
+        0x47f00000480,
+        0x48100000482,
+        0x48300000488,
+        0x48b0000048c,
+        0x48d0000048e,
+        0x48f00000490,
+        0x49100000492,
+        0x49300000494,
+        0x49500000496,
+        0x49700000498,
+        0x4990000049a,
+        0x49b0000049c,
+        0x49d0000049e,
+        0x49f000004a0,
+        0x4a1000004a2,
+        0x4a3000004a4,
+        0x4a5000004a6,
+        0x4a7000004a8,
+        0x4a9000004aa,
+        0x4ab000004ac,
+        0x4ad000004ae,
+        0x4af000004b0,
+        0x4b1000004b2,
+        0x4b3000004b4,
+        0x4b5000004b6,
+        0x4b7000004b8,
+        0x4b9000004ba,
+        0x4bb000004bc,
+        0x4bd000004be,
+        0x4bf000004c0,
+        0x4c2000004c3,
+        0x4c4000004c5,
+        0x4c6000004c7,
+        0x4c8000004c9,
+        0x4ca000004cb,
+        0x4cc000004cd,
+        0x4ce000004d0,
+        0x4d1000004d2,
+        0x4d3000004d4,
+        0x4d5000004d6,
+        0x4d7000004d8,
+        0x4d9000004da,
+        0x4db000004dc,
+        0x4dd000004de,
+        0x4df000004e0,
+        0x4e1000004e2,
+        0x4e3000004e4,
+        0x4e5000004e6,
+        0x4e7000004e8,
+        0x4e9000004ea,
+        0x4eb000004ec,
+        0x4ed000004ee,
+        0x4ef000004f0,
+        0x4f1000004f2,
+        0x4f3000004f4,
+        0x4f5000004f6,
+        0x4f7000004f8,
+        0x4f9000004fa,
+        0x4fb000004fc,
+        0x4fd000004fe,
+        0x4ff00000500,
+        0x50100000502,
+        0x50300000504,
+        0x50500000506,
+        0x50700000508,
+        0x5090000050a,
+        0x50b0000050c,
+        0x50d0000050e,
+        0x50f00000510,
+        0x51100000512,
+        0x51300000514,
+        0x51500000516,
+        0x51700000518,
+        0x5190000051a,
+        0x51b0000051c,
+        0x51d0000051e,
+        0x51f00000520,
+        0x52100000522,
+        0x52300000524,
+        0x52500000526,
+        0x52700000528,
+        0x5290000052a,
+        0x52b0000052c,
+        0x52d0000052e,
+        0x52f00000530,
+        0x5590000055a,
+        0x56000000587,
+        0x58800000589,
+        0x591000005be,
+        0x5bf000005c0,
+        0x5c1000005c3,
+        0x5c4000005c6,
+        0x5c7000005c8,
+        0x5d0000005eb,
+        0x5ef000005f3,
+        0x6100000061b,
+        0x62000000640,
+        0x64100000660,
+        0x66e00000675,
+        0x679000006d4,
+        0x6d5000006dd,
+        0x6df000006e9,
+        0x6ea000006f0,
+        0x6fa00000700,
+        0x7100000074b,
+        0x74d000007b2,
+        0x7c0000007f6,
+        0x7fd000007fe,
+        0x8000000082e,
+        0x8400000085c,
+        0x8600000086b,
+        0x8a0000008b5,
+        0x8b6000008c8,
+        0x8d3000008e2,
+        0x8e300000958,
+        0x96000000964,
+        0x96600000970,
+        0x97100000984,
+        0x9850000098d,
+        0x98f00000991,
+        0x993000009a9,
+        0x9aa000009b1,
+        0x9b2000009b3,
+        0x9b6000009ba,
+        0x9bc000009c5,
+        0x9c7000009c9,
+        0x9cb000009cf,
+        0x9d7000009d8,
+        0x9e0000009e4,
+        0x9e6000009f2,
+        0x9fc000009fd,
+        0x9fe000009ff,
+        0xa0100000a04,
+        0xa0500000a0b,
+        0xa0f00000a11,
+        0xa1300000a29,
+        0xa2a00000a31,
+        0xa3200000a33,
+        0xa3500000a36,
+        0xa3800000a3a,
+        0xa3c00000a3d,
+        0xa3e00000a43,
+        0xa4700000a49,
+        0xa4b00000a4e,
+        0xa5100000a52,
+        0xa5c00000a5d,
+        0xa6600000a76,
+        0xa8100000a84,
+        0xa8500000a8e,
+        0xa8f00000a92,
+        0xa9300000aa9,
+        0xaaa00000ab1,
+        0xab200000ab4,
+        0xab500000aba,
+        0xabc00000ac6,
+        0xac700000aca,
+        0xacb00000ace,
+        0xad000000ad1,
+        0xae000000ae4,
+        0xae600000af0,
+        0xaf900000b00,
+        0xb0100000b04,
+        0xb0500000b0d,
+        0xb0f00000b11,
+        0xb1300000b29,
+        0xb2a00000b31,
+        0xb3200000b34,
+        0xb3500000b3a,
+        0xb3c00000b45,
+        0xb4700000b49,
+        0xb4b00000b4e,
+        0xb5500000b58,
+        0xb5f00000b64,
+        0xb6600000b70,
+        0xb7100000b72,
+        0xb8200000b84,
+        0xb8500000b8b,
+        0xb8e00000b91,
+        0xb9200000b96,
+        0xb9900000b9b,
+        0xb9c00000b9d,
+        0xb9e00000ba0,
+        0xba300000ba5,
+        0xba800000bab,
+        0xbae00000bba,
+        0xbbe00000bc3,
+        0xbc600000bc9,
+        0xbca00000bce,
+        0xbd000000bd1,
+        0xbd700000bd8,
+        0xbe600000bf0,
+        0xc0000000c0d,
+        0xc0e00000c11,
+        0xc1200000c29,
+        0xc2a00000c3a,
+        0xc3d00000c45,
+        0xc4600000c49,
+        0xc4a00000c4e,
+        0xc5500000c57,
+        0xc5800000c5b,
+        0xc6000000c64,
+        0xc6600000c70,
+        0xc8000000c84,
+        0xc8500000c8d,
+        0xc8e00000c91,
+        0xc9200000ca9,
+        0xcaa00000cb4,
+        0xcb500000cba,
+        0xcbc00000cc5,
+        0xcc600000cc9,
+        0xcca00000cce,
+        0xcd500000cd7,
+        0xcde00000cdf,
+        0xce000000ce4,
+        0xce600000cf0,
+        0xcf100000cf3,
+        0xd0000000d0d,
+        0xd0e00000d11,
+        0xd1200000d45,
+        0xd4600000d49,
+        0xd4a00000d4f,
+        0xd5400000d58,
+        0xd5f00000d64,
+        0xd6600000d70,
+        0xd7a00000d80,
+        0xd8100000d84,
+        0xd8500000d97,
+        0xd9a00000db2,
+        0xdb300000dbc,
+        0xdbd00000dbe,
+        0xdc000000dc7,
+        0xdca00000dcb,
+        0xdcf00000dd5,
+        0xdd600000dd7,
+        0xdd800000de0,
+        0xde600000df0,
+        0xdf200000df4,
+        0xe0100000e33,
+        0xe3400000e3b,
+        0xe4000000e4f,
+        0xe5000000e5a,
+        0xe8100000e83,
+        0xe8400000e85,
+        0xe8600000e8b,
+        0xe8c00000ea4,
+        0xea500000ea6,
+        0xea700000eb3,
+        0xeb400000ebe,
+        0xec000000ec5,
+        0xec600000ec7,
+        0xec800000ece,
+        0xed000000eda,
+        0xede00000ee0,
+        0xf0000000f01,
+        0xf0b00000f0c,
+        0xf1800000f1a,
+        0xf2000000f2a,
+        0xf3500000f36,
+        0xf3700000f38,
+        0xf3900000f3a,
+        0xf3e00000f43,
+        0xf4400000f48,
+        0xf4900000f4d,
+        0xf4e00000f52,
+        0xf5300000f57,
+        0xf5800000f5c,
+        0xf5d00000f69,
+        0xf6a00000f6d,
+        0xf7100000f73,
+        0xf7400000f75,
+        0xf7a00000f81,
+        0xf8200000f85,
+        0xf8600000f93,
+        0xf9400000f98,
+        0xf9900000f9d,
+        0xf9e00000fa2,
+        0xfa300000fa7,
+        0xfa800000fac,
+        0xfad00000fb9,
+        0xfba00000fbd,
+        0xfc600000fc7,
+        0x10000000104a,
+        0x10500000109e,
+        0x10d0000010fb,
+        0x10fd00001100,
+        0x120000001249,
+        0x124a0000124e,
+        0x125000001257,
+        0x125800001259,
+        0x125a0000125e,
+        0x126000001289,
+        0x128a0000128e,
+        0x1290000012b1,
+        0x12b2000012b6,
+        0x12b8000012bf,
+        0x12c0000012c1,
+        0x12c2000012c6,
+        0x12c8000012d7,
+        0x12d800001311,
+        0x131200001316,
+        0x13180000135b,
+        0x135d00001360,
+        0x138000001390,
+        0x13a0000013f6,
+        0x14010000166d,
+        0x166f00001680,
+        0x16810000169b,
+        0x16a0000016eb,
+        0x16f1000016f9,
+        0x17000000170d,
+        0x170e00001715,
+        0x172000001735,
+        0x174000001754,
+        0x17600000176d,
+        0x176e00001771,
+        0x177200001774,
+        0x1780000017b4,
+        0x17b6000017d4,
+        0x17d7000017d8,
+        0x17dc000017de,
+        0x17e0000017ea,
+        0x18100000181a,
+        0x182000001879,
+        0x1880000018ab,
+        0x18b0000018f6,
+        0x19000000191f,
+        0x19200000192c,
+        0x19300000193c,
+        0x19460000196e,
+        0x197000001975,
+        0x1980000019ac,
+        0x19b0000019ca,
+        0x19d0000019da,
+        0x1a0000001a1c,
+        0x1a2000001a5f,
+        0x1a6000001a7d,
+        0x1a7f00001a8a,
+        0x1a9000001a9a,
+        0x1aa700001aa8,
+        0x1ab000001abe,
+        0x1abf00001ac1,
+        0x1b0000001b4c,
+        0x1b5000001b5a,
+        0x1b6b00001b74,
+        0x1b8000001bf4,
+        0x1c0000001c38,
+        0x1c4000001c4a,
+        0x1c4d00001c7e,
+        0x1cd000001cd3,
+        0x1cd400001cfb,
+        0x1d0000001d2c,
+        0x1d2f00001d30,
+        0x1d3b00001d3c,
+        0x1d4e00001d4f,
+        0x1d6b00001d78,
+        0x1d7900001d9b,
+        0x1dc000001dfa,
+        0x1dfb00001e00,
+        0x1e0100001e02,
+        0x1e0300001e04,
+        0x1e0500001e06,
+        0x1e0700001e08,
+        0x1e0900001e0a,
+        0x1e0b00001e0c,
+        0x1e0d00001e0e,
+        0x1e0f00001e10,
+        0x1e1100001e12,
+        0x1e1300001e14,
+        0x1e1500001e16,
+        0x1e1700001e18,
+        0x1e1900001e1a,
+        0x1e1b00001e1c,
+        0x1e1d00001e1e,
+        0x1e1f00001e20,
+        0x1e2100001e22,
+        0x1e2300001e24,
+        0x1e2500001e26,
+        0x1e2700001e28,
+        0x1e2900001e2a,
+        0x1e2b00001e2c,
+        0x1e2d00001e2e,
+        0x1e2f00001e30,
+        0x1e3100001e32,
+        0x1e3300001e34,
+        0x1e3500001e36,
+        0x1e3700001e38,
+        0x1e3900001e3a,
+        0x1e3b00001e3c,
+        0x1e3d00001e3e,
+        0x1e3f00001e40,
+        0x1e4100001e42,
+        0x1e4300001e44,
+        0x1e4500001e46,
+        0x1e4700001e48,
+        0x1e4900001e4a,
+        0x1e4b00001e4c,
+        0x1e4d00001e4e,
+        0x1e4f00001e50,
+        0x1e5100001e52,
+        0x1e5300001e54,
+        0x1e5500001e56,
+        0x1e5700001e58,
+        0x1e5900001e5a,
+        0x1e5b00001e5c,
+        0x1e5d00001e5e,
+        0x1e5f00001e60,
+        0x1e6100001e62,
+        0x1e6300001e64,
+        0x1e6500001e66,
+        0x1e6700001e68,
+        0x1e6900001e6a,
+        0x1e6b00001e6c,
+        0x1e6d00001e6e,
+        0x1e6f00001e70,
+        0x1e7100001e72,
+        0x1e7300001e74,
+        0x1e7500001e76,
+        0x1e7700001e78,
+        0x1e7900001e7a,
+        0x1e7b00001e7c,
+        0x1e7d00001e7e,
+        0x1e7f00001e80,
+        0x1e8100001e82,
+        0x1e8300001e84,
+        0x1e8500001e86,
+        0x1e8700001e88,
+        0x1e8900001e8a,
+        0x1e8b00001e8c,
+        0x1e8d00001e8e,
+        0x1e8f00001e90,
+        0x1e9100001e92,
+        0x1e9300001e94,
+        0x1e9500001e9a,
+        0x1e9c00001e9e,
+        0x1e9f00001ea0,
+        0x1ea100001ea2,
+        0x1ea300001ea4,
+        0x1ea500001ea6,
+        0x1ea700001ea8,
+        0x1ea900001eaa,
+        0x1eab00001eac,
+        0x1ead00001eae,
+        0x1eaf00001eb0,
+        0x1eb100001eb2,
+        0x1eb300001eb4,
+        0x1eb500001eb6,
+        0x1eb700001eb8,
+        0x1eb900001eba,
+        0x1ebb00001ebc,
+        0x1ebd00001ebe,
+        0x1ebf00001ec0,
+        0x1ec100001ec2,
+        0x1ec300001ec4,
+        0x1ec500001ec6,
+        0x1ec700001ec8,
+        0x1ec900001eca,
+        0x1ecb00001ecc,
+        0x1ecd00001ece,
+        0x1ecf00001ed0,
+        0x1ed100001ed2,
+        0x1ed300001ed4,
+        0x1ed500001ed6,
+        0x1ed700001ed8,
+        0x1ed900001eda,
+        0x1edb00001edc,
+        0x1edd00001ede,
+        0x1edf00001ee0,
+        0x1ee100001ee2,
+        0x1ee300001ee4,
+        0x1ee500001ee6,
+        0x1ee700001ee8,
+        0x1ee900001eea,
+        0x1eeb00001eec,
+        0x1eed00001eee,
+        0x1eef00001ef0,
+        0x1ef100001ef2,
+        0x1ef300001ef4,
+        0x1ef500001ef6,
+        0x1ef700001ef8,
+        0x1ef900001efa,
+        0x1efb00001efc,
+        0x1efd00001efe,
+        0x1eff00001f08,
+        0x1f1000001f16,
+        0x1f2000001f28,
+        0x1f3000001f38,
+        0x1f4000001f46,
+        0x1f5000001f58,
+        0x1f6000001f68,
+        0x1f7000001f71,
+        0x1f7200001f73,
+        0x1f7400001f75,
+        0x1f7600001f77,
+        0x1f7800001f79,
+        0x1f7a00001f7b,
+        0x1f7c00001f7d,
+        0x1fb000001fb2,
+        0x1fb600001fb7,
+        0x1fc600001fc7,
+        0x1fd000001fd3,
+        0x1fd600001fd8,
+        0x1fe000001fe3,
+        0x1fe400001fe8,
+        0x1ff600001ff7,
+        0x214e0000214f,
+        0x218400002185,
+        0x2c3000002c5f,
+        0x2c6100002c62,
+        0x2c6500002c67,
+        0x2c6800002c69,
+        0x2c6a00002c6b,
+        0x2c6c00002c6d,
+        0x2c7100002c72,
+        0x2c7300002c75,
+        0x2c7600002c7c,
+        0x2c8100002c82,
+        0x2c8300002c84,
+        0x2c8500002c86,
+        0x2c8700002c88,
+        0x2c8900002c8a,
+        0x2c8b00002c8c,
+        0x2c8d00002c8e,
+        0x2c8f00002c90,
+        0x2c9100002c92,
+        0x2c9300002c94,
+        0x2c9500002c96,
+        0x2c9700002c98,
+        0x2c9900002c9a,
+        0x2c9b00002c9c,
+        0x2c9d00002c9e,
+        0x2c9f00002ca0,
+        0x2ca100002ca2,
+        0x2ca300002ca4,
+        0x2ca500002ca6,
+        0x2ca700002ca8,
+        0x2ca900002caa,
+        0x2cab00002cac,
+        0x2cad00002cae,
+        0x2caf00002cb0,
+        0x2cb100002cb2,
+        0x2cb300002cb4,
+        0x2cb500002cb6,
+        0x2cb700002cb8,
+        0x2cb900002cba,
+        0x2cbb00002cbc,
+        0x2cbd00002cbe,
+        0x2cbf00002cc0,
+        0x2cc100002cc2,
+        0x2cc300002cc4,
+        0x2cc500002cc6,
+        0x2cc700002cc8,
+        0x2cc900002cca,
+        0x2ccb00002ccc,
+        0x2ccd00002cce,
+        0x2ccf00002cd0,
+        0x2cd100002cd2,
+        0x2cd300002cd4,
+        0x2cd500002cd6,
+        0x2cd700002cd8,
+        0x2cd900002cda,
+        0x2cdb00002cdc,
+        0x2cdd00002cde,
+        0x2cdf00002ce0,
+        0x2ce100002ce2,
+        0x2ce300002ce5,
+        0x2cec00002ced,
+        0x2cee00002cf2,
+        0x2cf300002cf4,
+        0x2d0000002d26,
+        0x2d2700002d28,
+        0x2d2d00002d2e,
+        0x2d3000002d68,
+        0x2d7f00002d97,
+        0x2da000002da7,
+        0x2da800002daf,
+        0x2db000002db7,
+        0x2db800002dbf,
+        0x2dc000002dc7,
+        0x2dc800002dcf,
+        0x2dd000002dd7,
+        0x2dd800002ddf,
+        0x2de000002e00,
+        0x2e2f00002e30,
+        0x300500003008,
+        0x302a0000302e,
+        0x303c0000303d,
+        0x304100003097,
+        0x30990000309b,
+        0x309d0000309f,
+        0x30a1000030fb,
+        0x30fc000030ff,
+        0x310500003130,
+        0x31a0000031c0,
+        0x31f000003200,
+        0x340000004dc0,
+        0x4e0000009ffd,
+        0xa0000000a48d,
+        0xa4d00000a4fe,
+        0xa5000000a60d,
+        0xa6100000a62c,
+        0xa6410000a642,
+        0xa6430000a644,
+        0xa6450000a646,
+        0xa6470000a648,
+        0xa6490000a64a,
+        0xa64b0000a64c,
+        0xa64d0000a64e,
+        0xa64f0000a650,
+        0xa6510000a652,
+        0xa6530000a654,
+        0xa6550000a656,
+        0xa6570000a658,
+        0xa6590000a65a,
+        0xa65b0000a65c,
+        0xa65d0000a65e,
+        0xa65f0000a660,
+        0xa6610000a662,
+        0xa6630000a664,
+        0xa6650000a666,
+        0xa6670000a668,
+        0xa6690000a66a,
+        0xa66b0000a66c,
+        0xa66d0000a670,
+        0xa6740000a67e,
+        0xa67f0000a680,
+        0xa6810000a682,
+        0xa6830000a684,
+        0xa6850000a686,
+        0xa6870000a688,
+        0xa6890000a68a,
+        0xa68b0000a68c,
+        0xa68d0000a68e,
+        0xa68f0000a690,
+        0xa6910000a692,
+        0xa6930000a694,
+        0xa6950000a696,
+        0xa6970000a698,
+        0xa6990000a69a,
+        0xa69b0000a69c,
+        0xa69e0000a6e6,
+        0xa6f00000a6f2,
+        0xa7170000a720,
+        0xa7230000a724,
+        0xa7250000a726,
+        0xa7270000a728,
+        0xa7290000a72a,
+        0xa72b0000a72c,
+        0xa72d0000a72e,
+        0xa72f0000a732,
+        0xa7330000a734,
+        0xa7350000a736,
+        0xa7370000a738,
+        0xa7390000a73a,
+        0xa73b0000a73c,
+        0xa73d0000a73e,
+        0xa73f0000a740,
+        0xa7410000a742,
+        0xa7430000a744,
+        0xa7450000a746,
+        0xa7470000a748,
+        0xa7490000a74a,
+        0xa74b0000a74c,
+        0xa74d0000a74e,
+        0xa74f0000a750,
+        0xa7510000a752,
+        0xa7530000a754,
+        0xa7550000a756,
+        0xa7570000a758,
+        0xa7590000a75a,
+        0xa75b0000a75c,
+        0xa75d0000a75e,
+        0xa75f0000a760,
+        0xa7610000a762,
+        0xa7630000a764,
+        0xa7650000a766,
+        0xa7670000a768,
+        0xa7690000a76a,
+        0xa76b0000a76c,
+        0xa76d0000a76e,
+        0xa76f0000a770,
+        0xa7710000a779,
+        0xa77a0000a77b,
+        0xa77c0000a77d,
+        0xa77f0000a780,
+        0xa7810000a782,
+        0xa7830000a784,
+        0xa7850000a786,
+        0xa7870000a789,
+        0xa78c0000a78d,
+        0xa78e0000a790,
+        0xa7910000a792,
+        0xa7930000a796,
+        0xa7970000a798,
+        0xa7990000a79a,
+        0xa79b0000a79c,
+        0xa79d0000a79e,
+        0xa79f0000a7a0,
+        0xa7a10000a7a2,
+        0xa7a30000a7a4,
+        0xa7a50000a7a6,
+        0xa7a70000a7a8,
+        0xa7a90000a7aa,
+        0xa7af0000a7b0,
+        0xa7b50000a7b6,
+        0xa7b70000a7b8,
+        0xa7b90000a7ba,
+        0xa7bb0000a7bc,
+        0xa7bd0000a7be,
+        0xa7bf0000a7c0,
+        0xa7c30000a7c4,
+        0xa7c80000a7c9,
+        0xa7ca0000a7cb,
+        0xa7f60000a7f8,
+        0xa7fa0000a828,
+        0xa82c0000a82d,
+        0xa8400000a874,
+        0xa8800000a8c6,
+        0xa8d00000a8da,
+        0xa8e00000a8f8,
+        0xa8fb0000a8fc,
+        0xa8fd0000a92e,
+        0xa9300000a954,
+        0xa9800000a9c1,
+        0xa9cf0000a9da,
+        0xa9e00000a9ff,
+        0xaa000000aa37,
+        0xaa400000aa4e,
+        0xaa500000aa5a,
+        0xaa600000aa77,
+        0xaa7a0000aac3,
+        0xaadb0000aade,
+        0xaae00000aaf0,
+        0xaaf20000aaf7,
+        0xab010000ab07,
+        0xab090000ab0f,
+        0xab110000ab17,
+        0xab200000ab27,
+        0xab280000ab2f,
+        0xab300000ab5b,
+        0xab600000ab6a,
+        0xabc00000abeb,
+        0xabec0000abee,
+        0xabf00000abfa,
+        0xac000000d7a4,
+        0xfa0e0000fa10,
+        0xfa110000fa12,
+        0xfa130000fa15,
+        0xfa1f0000fa20,
+        0xfa210000fa22,
+        0xfa230000fa25,
+        0xfa270000fa2a,
+        0xfb1e0000fb1f,
+        0xfe200000fe30,
+        0xfe730000fe74,
+        0x100000001000c,
+        0x1000d00010027,
+        0x100280001003b,
+        0x1003c0001003e,
+        0x1003f0001004e,
+        0x100500001005e,
+        0x10080000100fb,
+        0x101fd000101fe,
+        0x102800001029d,
+        0x102a0000102d1,
+        0x102e0000102e1,
+        0x1030000010320,
+        0x1032d00010341,
+        0x103420001034a,
+        0x103500001037b,
+        0x103800001039e,
+        0x103a0000103c4,
+        0x103c8000103d0,
+        0x104280001049e,
+        0x104a0000104aa,
+        0x104d8000104fc,
+        0x1050000010528,
+        0x1053000010564,
+        0x1060000010737,
+        0x1074000010756,
+        0x1076000010768,
+        0x1080000010806,
+        0x1080800010809,
+        0x1080a00010836,
+        0x1083700010839,
+        0x1083c0001083d,
+        0x1083f00010856,
+        0x1086000010877,
+        0x108800001089f,
+        0x108e0000108f3,
+        0x108f4000108f6,
+        0x1090000010916,
+        0x109200001093a,
+        0x10980000109b8,
+        0x109be000109c0,
+        0x10a0000010a04,
+        0x10a0500010a07,
+        0x10a0c00010a14,
+        0x10a1500010a18,
+        0x10a1900010a36,
+        0x10a3800010a3b,
+        0x10a3f00010a40,
+        0x10a6000010a7d,
+        0x10a8000010a9d,
+        0x10ac000010ac8,
+        0x10ac900010ae7,
+        0x10b0000010b36,
+        0x10b4000010b56,
+        0x10b6000010b73,
+        0x10b8000010b92,
+        0x10c0000010c49,
+        0x10cc000010cf3,
+        0x10d0000010d28,
+        0x10d3000010d3a,
+        0x10e8000010eaa,
+        0x10eab00010ead,
+        0x10eb000010eb2,
+        0x10f0000010f1d,
+        0x10f2700010f28,
+        0x10f3000010f51,
+        0x10fb000010fc5,
+        0x10fe000010ff7,
+        0x1100000011047,
+        0x1106600011070,
+        0x1107f000110bb,
+        0x110d0000110e9,
+        0x110f0000110fa,
+        0x1110000011135,
+        0x1113600011140,
+        0x1114400011148,
+        0x1115000011174,
+        0x1117600011177,
+        0x11180000111c5,
+        0x111c9000111cd,
+        0x111ce000111db,
+        0x111dc000111dd,
+        0x1120000011212,
+        0x1121300011238,
+        0x1123e0001123f,
+        0x1128000011287,
+        0x1128800011289,
+        0x1128a0001128e,
+        0x1128f0001129e,
+        0x1129f000112a9,
+        0x112b0000112eb,
+        0x112f0000112fa,
+        0x1130000011304,
+        0x113050001130d,
+        0x1130f00011311,
+        0x1131300011329,
+        0x1132a00011331,
+        0x1133200011334,
+        0x113350001133a,
+        0x1133b00011345,
+        0x1134700011349,
+        0x1134b0001134e,
+        0x1135000011351,
+        0x1135700011358,
+        0x1135d00011364,
+        0x113660001136d,
+        0x1137000011375,
+        0x114000001144b,
+        0x114500001145a,
+        0x1145e00011462,
+        0x11480000114c6,
+        0x114c7000114c8,
+        0x114d0000114da,
+        0x11580000115b6,
+        0x115b8000115c1,
+        0x115d8000115de,
+        0x1160000011641,
+        0x1164400011645,
+        0x116500001165a,
+        0x11680000116b9,
+        0x116c0000116ca,
+        0x117000001171b,
+        0x1171d0001172c,
+        0x117300001173a,
+        0x118000001183b,
+        0x118c0000118ea,
+        0x118ff00011907,
+        0x119090001190a,
+        0x1190c00011914,
+        0x1191500011917,
+        0x1191800011936,
+        0x1193700011939,
+        0x1193b00011944,
+        0x119500001195a,
+        0x119a0000119a8,
+        0x119aa000119d8,
+        0x119da000119e2,
+        0x119e3000119e5,
+        0x11a0000011a3f,
+        0x11a4700011a48,
+        0x11a5000011a9a,
+        0x11a9d00011a9e,
+        0x11ac000011af9,
+        0x11c0000011c09,
+        0x11c0a00011c37,
+        0x11c3800011c41,
+        0x11c5000011c5a,
+        0x11c7200011c90,
+        0x11c9200011ca8,
+        0x11ca900011cb7,
+        0x11d0000011d07,
+        0x11d0800011d0a,
+        0x11d0b00011d37,
+        0x11d3a00011d3b,
+        0x11d3c00011d3e,
+        0x11d3f00011d48,
+        0x11d5000011d5a,
+        0x11d6000011d66,
+        0x11d6700011d69,
+        0x11d6a00011d8f,
+        0x11d9000011d92,
+        0x11d9300011d99,
+        0x11da000011daa,
+        0x11ee000011ef7,
+        0x11fb000011fb1,
+        0x120000001239a,
+        0x1248000012544,
+        0x130000001342f,
+        0x1440000014647,
+        0x1680000016a39,
+        0x16a4000016a5f,
+        0x16a6000016a6a,
+        0x16ad000016aee,
+        0x16af000016af5,
+        0x16b0000016b37,
+        0x16b4000016b44,
+        0x16b5000016b5a,
+        0x16b6300016b78,
+        0x16b7d00016b90,
+        0x16e6000016e80,
+        0x16f0000016f4b,
+        0x16f4f00016f88,
+        0x16f8f00016fa0,
+        0x16fe000016fe2,
+        0x16fe300016fe5,
+        0x16ff000016ff2,
+        0x17000000187f8,
+        0x1880000018cd6,
+        0x18d0000018d09,
+        0x1b0000001b11f,
+        0x1b1500001b153,
+        0x1b1640001b168,
+        0x1b1700001b2fc,
+        0x1bc000001bc6b,
+        0x1bc700001bc7d,
+        0x1bc800001bc89,
+        0x1bc900001bc9a,
+        0x1bc9d0001bc9f,
+        0x1da000001da37,
+        0x1da3b0001da6d,
+        0x1da750001da76,
+        0x1da840001da85,
+        0x1da9b0001daa0,
+        0x1daa10001dab0,
+        0x1e0000001e007,
+        0x1e0080001e019,
+        0x1e01b0001e022,
+        0x1e0230001e025,
+        0x1e0260001e02b,
+        0x1e1000001e12d,
+        0x1e1300001e13e,
+        0x1e1400001e14a,
+        0x1e14e0001e14f,
+        0x1e2c00001e2fa,
+        0x1e8000001e8c5,
+        0x1e8d00001e8d7,
+        0x1e9220001e94c,
+        0x1e9500001e95a,
+        0x1fbf00001fbfa,
+        0x200000002a6de,
+        0x2a7000002b735,
+        0x2b7400002b81e,
+        0x2b8200002cea2,
+        0x2ceb00002ebe1,
+        0x300000003134b,
+    ),
+    'CONTEXTJ': (
+        0x200c0000200e,
+    ),
+    'CONTEXTO': (
+        0xb7000000b8,
+        0x37500000376,
+        0x5f3000005f5,
+        0x6600000066a,
+        0x6f0000006fa,
+        0x30fb000030fc,
+    ),
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/intranges.py b/venv/Lib/site-packages/pip/_vendor/idna/intranges.py
new file mode 100644
index 000000000..fa8a73566
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/intranges.py
@@ -0,0 +1,53 @@
+"""
+Given a list of integers, made up of (hopefully) a small number of long runs
+of consecutive integers, compute a representation of the form
+((start1, end1), (start2, end2) ...). Then answer the question "was x present
+in the original list?" in time O(log(# runs)).
+"""
+
+import bisect
+
+def intranges_from_list(list_):
+    """Represent a list of integers as a sequence of ranges:
+    ((start_0, end_0), (start_1, end_1), ...), such that the original
+    integers are exactly those x such that start_i <= x < end_i for some i.
+
+    Ranges are encoded as single integers (start << 32 | end), not as tuples.
+    """
+
+    sorted_list = sorted(list_)
+    ranges = []
+    last_write = -1
+    for i in range(len(sorted_list)):
+        if i+1 < len(sorted_list):
+            if sorted_list[i] == sorted_list[i+1]-1:
+                continue
+        current_range = sorted_list[last_write+1:i+1]
+        ranges.append(_encode_range(current_range[0], current_range[-1] + 1))
+        last_write = i
+
+    return tuple(ranges)
+
+def _encode_range(start, end):
+    return (start << 32) | end
+
+def _decode_range(r):
+    return (r >> 32), (r & ((1 << 32) - 1))
+
+
+def intranges_contain(int_, ranges):
+    """Determine if `int_` falls into one of the ranges in `ranges`."""
+    tuple_ = _encode_range(int_, 0)
+    pos = bisect.bisect_left(ranges, tuple_)
+    # we could be immediately ahead of a tuple (start, end)
+    # with start < int_ <= end
+    if pos > 0:
+        left, right = _decode_range(ranges[pos-1])
+        if left <= int_ < right:
+            return True
+    # or we could be immediately behind a tuple (int_, end)
+    if pos < len(ranges):
+        left, _ = _decode_range(ranges[pos])
+        if left == int_:
+            return True
+    return False
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/package_data.py b/venv/Lib/site-packages/pip/_vendor/idna/package_data.py
new file mode 100644
index 000000000..ce1c521d2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/package_data.py
@@ -0,0 +1,2 @@
+__version__ = '2.10'
+
diff --git a/venv/Lib/site-packages/pip/_vendor/idna/uts46data.py b/venv/Lib/site-packages/pip/_vendor/idna/uts46data.py
new file mode 100644
index 000000000..3766dd49f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/idna/uts46data.py
@@ -0,0 +1,8357 @@
+# This file is automatically generated by tools/idna-data
+# vim: set fileencoding=utf-8 :
+
+"""IDNA Mapping Table from UTS46."""
+
+
+__version__ = "13.0.0"
+def _seg_0():
+    return [
+    (0x0, '3'),
+    (0x1, '3'),
+    (0x2, '3'),
+    (0x3, '3'),
+    (0x4, '3'),
+    (0x5, '3'),
+    (0x6, '3'),
+    (0x7, '3'),
+    (0x8, '3'),
+    (0x9, '3'),
+    (0xA, '3'),
+    (0xB, '3'),
+    (0xC, '3'),
+    (0xD, '3'),
+    (0xE, '3'),
+    (0xF, '3'),
+    (0x10, '3'),
+    (0x11, '3'),
+    (0x12, '3'),
+    (0x13, '3'),
+    (0x14, '3'),
+    (0x15, '3'),
+    (0x16, '3'),
+    (0x17, '3'),
+    (0x18, '3'),
+    (0x19, '3'),
+    (0x1A, '3'),
+    (0x1B, '3'),
+    (0x1C, '3'),
+    (0x1D, '3'),
+    (0x1E, '3'),
+    (0x1F, '3'),
+    (0x20, '3'),
+    (0x21, '3'),
+    (0x22, '3'),
+    (0x23, '3'),
+    (0x24, '3'),
+    (0x25, '3'),
+    (0x26, '3'),
+    (0x27, '3'),
+    (0x28, '3'),
+    (0x29, '3'),
+    (0x2A, '3'),
+    (0x2B, '3'),
+    (0x2C, '3'),
+    (0x2D, 'V'),
+    (0x2E, 'V'),
+    (0x2F, '3'),
+    (0x30, 'V'),
+    (0x31, 'V'),
+    (0x32, 'V'),
+    (0x33, 'V'),
+    (0x34, 'V'),
+    (0x35, 'V'),
+    (0x36, 'V'),
+    (0x37, 'V'),
+    (0x38, 'V'),
+    (0x39, 'V'),
+    (0x3A, '3'),
+    (0x3B, '3'),
+    (0x3C, '3'),
+    (0x3D, '3'),
+    (0x3E, '3'),
+    (0x3F, '3'),
+    (0x40, '3'),
+    (0x41, 'M', u'a'),
+    (0x42, 'M', u'b'),
+    (0x43, 'M', u'c'),
+    (0x44, 'M', u'd'),
+    (0x45, 'M', u'e'),
+    (0x46, 'M', u'f'),
+    (0x47, 'M', u'g'),
+    (0x48, 'M', u'h'),
+    (0x49, 'M', u'i'),
+    (0x4A, 'M', u'j'),
+    (0x4B, 'M', u'k'),
+    (0x4C, 'M', u'l'),
+    (0x4D, 'M', u'm'),
+    (0x4E, 'M', u'n'),
+    (0x4F, 'M', u'o'),
+    (0x50, 'M', u'p'),
+    (0x51, 'M', u'q'),
+    (0x52, 'M', u'r'),
+    (0x53, 'M', u's'),
+    (0x54, 'M', u't'),
+    (0x55, 'M', u'u'),
+    (0x56, 'M', u'v'),
+    (0x57, 'M', u'w'),
+    (0x58, 'M', u'x'),
+    (0x59, 'M', u'y'),
+    (0x5A, 'M', u'z'),
+    (0x5B, '3'),
+    (0x5C, '3'),
+    (0x5D, '3'),
+    (0x5E, '3'),
+    (0x5F, '3'),
+    (0x60, '3'),
+    (0x61, 'V'),
+    (0x62, 'V'),
+    (0x63, 'V'),
+    ]
+
+def _seg_1():
+    return [
+    (0x64, 'V'),
+    (0x65, 'V'),
+    (0x66, 'V'),
+    (0x67, 'V'),
+    (0x68, 'V'),
+    (0x69, 'V'),
+    (0x6A, 'V'),
+    (0x6B, 'V'),
+    (0x6C, 'V'),
+    (0x6D, 'V'),
+    (0x6E, 'V'),
+    (0x6F, 'V'),
+    (0x70, 'V'),
+    (0x71, 'V'),
+    (0x72, 'V'),
+    (0x73, 'V'),
+    (0x74, 'V'),
+    (0x75, 'V'),
+    (0x76, 'V'),
+    (0x77, 'V'),
+    (0x78, 'V'),
+    (0x79, 'V'),
+    (0x7A, 'V'),
+    (0x7B, '3'),
+    (0x7C, '3'),
+    (0x7D, '3'),
+    (0x7E, '3'),
+    (0x7F, '3'),
+    (0x80, 'X'),
+    (0x81, 'X'),
+    (0x82, 'X'),
+    (0x83, 'X'),
+    (0x84, 'X'),
+    (0x85, 'X'),
+    (0x86, 'X'),
+    (0x87, 'X'),
+    (0x88, 'X'),
+    (0x89, 'X'),
+    (0x8A, 'X'),
+    (0x8B, 'X'),
+    (0x8C, 'X'),
+    (0x8D, 'X'),
+    (0x8E, 'X'),
+    (0x8F, 'X'),
+    (0x90, 'X'),
+    (0x91, 'X'),
+    (0x92, 'X'),
+    (0x93, 'X'),
+    (0x94, 'X'),
+    (0x95, 'X'),
+    (0x96, 'X'),
+    (0x97, 'X'),
+    (0x98, 'X'),
+    (0x99, 'X'),
+    (0x9A, 'X'),
+    (0x9B, 'X'),
+    (0x9C, 'X'),
+    (0x9D, 'X'),
+    (0x9E, 'X'),
+    (0x9F, 'X'),
+    (0xA0, '3', u' '),
+    (0xA1, 'V'),
+    (0xA2, 'V'),
+    (0xA3, 'V'),
+    (0xA4, 'V'),
+    (0xA5, 'V'),
+    (0xA6, 'V'),
+    (0xA7, 'V'),
+    (0xA8, '3', u' ̈'),
+    (0xA9, 'V'),
+    (0xAA, 'M', u'a'),
+    (0xAB, 'V'),
+    (0xAC, 'V'),
+    (0xAD, 'I'),
+    (0xAE, 'V'),
+    (0xAF, '3', u' ̄'),
+    (0xB0, 'V'),
+    (0xB1, 'V'),
+    (0xB2, 'M', u'2'),
+    (0xB3, 'M', u'3'),
+    (0xB4, '3', u' ́'),
+    (0xB5, 'M', u'μ'),
+    (0xB6, 'V'),
+    (0xB7, 'V'),
+    (0xB8, '3', u' ̧'),
+    (0xB9, 'M', u'1'),
+    (0xBA, 'M', u'o'),
+    (0xBB, 'V'),
+    (0xBC, 'M', u'1⁄4'),
+    (0xBD, 'M', u'1⁄2'),
+    (0xBE, 'M', u'3⁄4'),
+    (0xBF, 'V'),
+    (0xC0, 'M', u'à'),
+    (0xC1, 'M', u'á'),
+    (0xC2, 'M', u'â'),
+    (0xC3, 'M', u'ã'),
+    (0xC4, 'M', u'ä'),
+    (0xC5, 'M', u'å'),
+    (0xC6, 'M', u'æ'),
+    (0xC7, 'M', u'ç'),
+    ]
+
+def _seg_2():
+    return [
+    (0xC8, 'M', u'è'),
+    (0xC9, 'M', u'é'),
+    (0xCA, 'M', u'ê'),
+    (0xCB, 'M', u'ë'),
+    (0xCC, 'M', u'ì'),
+    (0xCD, 'M', u'í'),
+    (0xCE, 'M', u'î'),
+    (0xCF, 'M', u'ï'),
+    (0xD0, 'M', u'ð'),
+    (0xD1, 'M', u'ñ'),
+    (0xD2, 'M', u'ò'),
+    (0xD3, 'M', u'ó'),
+    (0xD4, 'M', u'ô'),
+    (0xD5, 'M', u'õ'),
+    (0xD6, 'M', u'ö'),
+    (0xD7, 'V'),
+    (0xD8, 'M', u'ø'),
+    (0xD9, 'M', u'ù'),
+    (0xDA, 'M', u'ú'),
+    (0xDB, 'M', u'û'),
+    (0xDC, 'M', u'ü'),
+    (0xDD, 'M', u'ý'),
+    (0xDE, 'M', u'þ'),
+    (0xDF, 'D', u'ss'),
+    (0xE0, 'V'),
+    (0xE1, 'V'),
+    (0xE2, 'V'),
+    (0xE3, 'V'),
+    (0xE4, 'V'),
+    (0xE5, 'V'),
+    (0xE6, 'V'),
+    (0xE7, 'V'),
+    (0xE8, 'V'),
+    (0xE9, 'V'),
+    (0xEA, 'V'),
+    (0xEB, 'V'),
+    (0xEC, 'V'),
+    (0xED, 'V'),
+    (0xEE, 'V'),
+    (0xEF, 'V'),
+    (0xF0, 'V'),
+    (0xF1, 'V'),
+    (0xF2, 'V'),
+    (0xF3, 'V'),
+    (0xF4, 'V'),
+    (0xF5, 'V'),
+    (0xF6, 'V'),
+    (0xF7, 'V'),
+    (0xF8, 'V'),
+    (0xF9, 'V'),
+    (0xFA, 'V'),
+    (0xFB, 'V'),
+    (0xFC, 'V'),
+    (0xFD, 'V'),
+    (0xFE, 'V'),
+    (0xFF, 'V'),
+    (0x100, 'M', u'ā'),
+    (0x101, 'V'),
+    (0x102, 'M', u'ă'),
+    (0x103, 'V'),
+    (0x104, 'M', u'ą'),
+    (0x105, 'V'),
+    (0x106, 'M', u'ć'),
+    (0x107, 'V'),
+    (0x108, 'M', u'ĉ'),
+    (0x109, 'V'),
+    (0x10A, 'M', u'ċ'),
+    (0x10B, 'V'),
+    (0x10C, 'M', u'č'),
+    (0x10D, 'V'),
+    (0x10E, 'M', u'ď'),
+    (0x10F, 'V'),
+    (0x110, 'M', u'đ'),
+    (0x111, 'V'),
+    (0x112, 'M', u'ē'),
+    (0x113, 'V'),
+    (0x114, 'M', u'ĕ'),
+    (0x115, 'V'),
+    (0x116, 'M', u'ė'),
+    (0x117, 'V'),
+    (0x118, 'M', u'ę'),
+    (0x119, 'V'),
+    (0x11A, 'M', u'ě'),
+    (0x11B, 'V'),
+    (0x11C, 'M', u'ĝ'),
+    (0x11D, 'V'),
+    (0x11E, 'M', u'ğ'),
+    (0x11F, 'V'),
+    (0x120, 'M', u'ġ'),
+    (0x121, 'V'),
+    (0x122, 'M', u'ģ'),
+    (0x123, 'V'),
+    (0x124, 'M', u'ĥ'),
+    (0x125, 'V'),
+    (0x126, 'M', u'ħ'),
+    (0x127, 'V'),
+    (0x128, 'M', u'ĩ'),
+    (0x129, 'V'),
+    (0x12A, 'M', u'ī'),
+    (0x12B, 'V'),
+    ]
+
+def _seg_3():
+    return [
+    (0x12C, 'M', u'ĭ'),
+    (0x12D, 'V'),
+    (0x12E, 'M', u'į'),
+    (0x12F, 'V'),
+    (0x130, 'M', u'i̇'),
+    (0x131, 'V'),
+    (0x132, 'M', u'ij'),
+    (0x134, 'M', u'ĵ'),
+    (0x135, 'V'),
+    (0x136, 'M', u'ķ'),
+    (0x137, 'V'),
+    (0x139, 'M', u'ĺ'),
+    (0x13A, 'V'),
+    (0x13B, 'M', u'ļ'),
+    (0x13C, 'V'),
+    (0x13D, 'M', u'ľ'),
+    (0x13E, 'V'),
+    (0x13F, 'M', u'l·'),
+    (0x141, 'M', u'ł'),
+    (0x142, 'V'),
+    (0x143, 'M', u'ń'),
+    (0x144, 'V'),
+    (0x145, 'M', u'ņ'),
+    (0x146, 'V'),
+    (0x147, 'M', u'ň'),
+    (0x148, 'V'),
+    (0x149, 'M', u'ʼn'),
+    (0x14A, 'M', u'ŋ'),
+    (0x14B, 'V'),
+    (0x14C, 'M', u'ō'),
+    (0x14D, 'V'),
+    (0x14E, 'M', u'ŏ'),
+    (0x14F, 'V'),
+    (0x150, 'M', u'ő'),
+    (0x151, 'V'),
+    (0x152, 'M', u'œ'),
+    (0x153, 'V'),
+    (0x154, 'M', u'ŕ'),
+    (0x155, 'V'),
+    (0x156, 'M', u'ŗ'),
+    (0x157, 'V'),
+    (0x158, 'M', u'ř'),
+    (0x159, 'V'),
+    (0x15A, 'M', u'ś'),
+    (0x15B, 'V'),
+    (0x15C, 'M', u'ŝ'),
+    (0x15D, 'V'),
+    (0x15E, 'M', u'ş'),
+    (0x15F, 'V'),
+    (0x160, 'M', u'š'),
+    (0x161, 'V'),
+    (0x162, 'M', u'ţ'),
+    (0x163, 'V'),
+    (0x164, 'M', u'ť'),
+    (0x165, 'V'),
+    (0x166, 'M', u'ŧ'),
+    (0x167, 'V'),
+    (0x168, 'M', u'ũ'),
+    (0x169, 'V'),
+    (0x16A, 'M', u'ū'),
+    (0x16B, 'V'),
+    (0x16C, 'M', u'ŭ'),
+    (0x16D, 'V'),
+    (0x16E, 'M', u'ů'),
+    (0x16F, 'V'),
+    (0x170, 'M', u'ű'),
+    (0x171, 'V'),
+    (0x172, 'M', u'ų'),
+    (0x173, 'V'),
+    (0x174, 'M', u'ŵ'),
+    (0x175, 'V'),
+    (0x176, 'M', u'ŷ'),
+    (0x177, 'V'),
+    (0x178, 'M', u'ÿ'),
+    (0x179, 'M', u'ź'),
+    (0x17A, 'V'),
+    (0x17B, 'M', u'ż'),
+    (0x17C, 'V'),
+    (0x17D, 'M', u'ž'),
+    (0x17E, 'V'),
+    (0x17F, 'M', u's'),
+    (0x180, 'V'),
+    (0x181, 'M', u'ɓ'),
+    (0x182, 'M', u'ƃ'),
+    (0x183, 'V'),
+    (0x184, 'M', u'ƅ'),
+    (0x185, 'V'),
+    (0x186, 'M', u'ɔ'),
+    (0x187, 'M', u'ƈ'),
+    (0x188, 'V'),
+    (0x189, 'M', u'ɖ'),
+    (0x18A, 'M', u'ɗ'),
+    (0x18B, 'M', u'ƌ'),
+    (0x18C, 'V'),
+    (0x18E, 'M', u'ǝ'),
+    (0x18F, 'M', u'ə'),
+    (0x190, 'M', u'ɛ'),
+    (0x191, 'M', u'ƒ'),
+    (0x192, 'V'),
+    (0x193, 'M', u'ɠ'),
+    ]
+
+def _seg_4():
+    return [
+    (0x194, 'M', u'ɣ'),
+    (0x195, 'V'),
+    (0x196, 'M', u'ɩ'),
+    (0x197, 'M', u'ɨ'),
+    (0x198, 'M', u'ƙ'),
+    (0x199, 'V'),
+    (0x19C, 'M', u'ɯ'),
+    (0x19D, 'M', u'ɲ'),
+    (0x19E, 'V'),
+    (0x19F, 'M', u'ɵ'),
+    (0x1A0, 'M', u'ơ'),
+    (0x1A1, 'V'),
+    (0x1A2, 'M', u'ƣ'),
+    (0x1A3, 'V'),
+    (0x1A4, 'M', u'ƥ'),
+    (0x1A5, 'V'),
+    (0x1A6, 'M', u'ʀ'),
+    (0x1A7, 'M', u'ƨ'),
+    (0x1A8, 'V'),
+    (0x1A9, 'M', u'ʃ'),
+    (0x1AA, 'V'),
+    (0x1AC, 'M', u'ƭ'),
+    (0x1AD, 'V'),
+    (0x1AE, 'M', u'ʈ'),
+    (0x1AF, 'M', u'ư'),
+    (0x1B0, 'V'),
+    (0x1B1, 'M', u'ʊ'),
+    (0x1B2, 'M', u'ʋ'),
+    (0x1B3, 'M', u'ƴ'),
+    (0x1B4, 'V'),
+    (0x1B5, 'M', u'ƶ'),
+    (0x1B6, 'V'),
+    (0x1B7, 'M', u'ʒ'),
+    (0x1B8, 'M', u'ƹ'),
+    (0x1B9, 'V'),
+    (0x1BC, 'M', u'ƽ'),
+    (0x1BD, 'V'),
+    (0x1C4, 'M', u'dž'),
+    (0x1C7, 'M', u'lj'),
+    (0x1CA, 'M', u'nj'),
+    (0x1CD, 'M', u'ǎ'),
+    (0x1CE, 'V'),
+    (0x1CF, 'M', u'ǐ'),
+    (0x1D0, 'V'),
+    (0x1D1, 'M', u'ǒ'),
+    (0x1D2, 'V'),
+    (0x1D3, 'M', u'ǔ'),
+    (0x1D4, 'V'),
+    (0x1D5, 'M', u'ǖ'),
+    (0x1D6, 'V'),
+    (0x1D7, 'M', u'ǘ'),
+    (0x1D8, 'V'),
+    (0x1D9, 'M', u'ǚ'),
+    (0x1DA, 'V'),
+    (0x1DB, 'M', u'ǜ'),
+    (0x1DC, 'V'),
+    (0x1DE, 'M', u'ǟ'),
+    (0x1DF, 'V'),
+    (0x1E0, 'M', u'ǡ'),
+    (0x1E1, 'V'),
+    (0x1E2, 'M', u'ǣ'),
+    (0x1E3, 'V'),
+    (0x1E4, 'M', u'ǥ'),
+    (0x1E5, 'V'),
+    (0x1E6, 'M', u'ǧ'),
+    (0x1E7, 'V'),
+    (0x1E8, 'M', u'ǩ'),
+    (0x1E9, 'V'),
+    (0x1EA, 'M', u'ǫ'),
+    (0x1EB, 'V'),
+    (0x1EC, 'M', u'ǭ'),
+    (0x1ED, 'V'),
+    (0x1EE, 'M', u'ǯ'),
+    (0x1EF, 'V'),
+    (0x1F1, 'M', u'dz'),
+    (0x1F4, 'M', u'ǵ'),
+    (0x1F5, 'V'),
+    (0x1F6, 'M', u'ƕ'),
+    (0x1F7, 'M', u'ƿ'),
+    (0x1F8, 'M', u'ǹ'),
+    (0x1F9, 'V'),
+    (0x1FA, 'M', u'ǻ'),
+    (0x1FB, 'V'),
+    (0x1FC, 'M', u'ǽ'),
+    (0x1FD, 'V'),
+    (0x1FE, 'M', u'ǿ'),
+    (0x1FF, 'V'),
+    (0x200, 'M', u'ȁ'),
+    (0x201, 'V'),
+    (0x202, 'M', u'ȃ'),
+    (0x203, 'V'),
+    (0x204, 'M', u'ȅ'),
+    (0x205, 'V'),
+    (0x206, 'M', u'ȇ'),
+    (0x207, 'V'),
+    (0x208, 'M', u'ȉ'),
+    (0x209, 'V'),
+    (0x20A, 'M', u'ȋ'),
+    (0x20B, 'V'),
+    (0x20C, 'M', u'ȍ'),
+    ]
+
+def _seg_5():
+    return [
+    (0x20D, 'V'),
+    (0x20E, 'M', u'ȏ'),
+    (0x20F, 'V'),
+    (0x210, 'M', u'ȑ'),
+    (0x211, 'V'),
+    (0x212, 'M', u'ȓ'),
+    (0x213, 'V'),
+    (0x214, 'M', u'ȕ'),
+    (0x215, 'V'),
+    (0x216, 'M', u'ȗ'),
+    (0x217, 'V'),
+    (0x218, 'M', u'ș'),
+    (0x219, 'V'),
+    (0x21A, 'M', u'ț'),
+    (0x21B, 'V'),
+    (0x21C, 'M', u'ȝ'),
+    (0x21D, 'V'),
+    (0x21E, 'M', u'ȟ'),
+    (0x21F, 'V'),
+    (0x220, 'M', u'ƞ'),
+    (0x221, 'V'),
+    (0x222, 'M', u'ȣ'),
+    (0x223, 'V'),
+    (0x224, 'M', u'ȥ'),
+    (0x225, 'V'),
+    (0x226, 'M', u'ȧ'),
+    (0x227, 'V'),
+    (0x228, 'M', u'ȩ'),
+    (0x229, 'V'),
+    (0x22A, 'M', u'ȫ'),
+    (0x22B, 'V'),
+    (0x22C, 'M', u'ȭ'),
+    (0x22D, 'V'),
+    (0x22E, 'M', u'ȯ'),
+    (0x22F, 'V'),
+    (0x230, 'M', u'ȱ'),
+    (0x231, 'V'),
+    (0x232, 'M', u'ȳ'),
+    (0x233, 'V'),
+    (0x23A, 'M', u'ⱥ'),
+    (0x23B, 'M', u'ȼ'),
+    (0x23C, 'V'),
+    (0x23D, 'M', u'ƚ'),
+    (0x23E, 'M', u'ⱦ'),
+    (0x23F, 'V'),
+    (0x241, 'M', u'ɂ'),
+    (0x242, 'V'),
+    (0x243, 'M', u'ƀ'),
+    (0x244, 'M', u'ʉ'),
+    (0x245, 'M', u'ʌ'),
+    (0x246, 'M', u'ɇ'),
+    (0x247, 'V'),
+    (0x248, 'M', u'ɉ'),
+    (0x249, 'V'),
+    (0x24A, 'M', u'ɋ'),
+    (0x24B, 'V'),
+    (0x24C, 'M', u'ɍ'),
+    (0x24D, 'V'),
+    (0x24E, 'M', u'ɏ'),
+    (0x24F, 'V'),
+    (0x2B0, 'M', u'h'),
+    (0x2B1, 'M', u'ɦ'),
+    (0x2B2, 'M', u'j'),
+    (0x2B3, 'M', u'r'),
+    (0x2B4, 'M', u'ɹ'),
+    (0x2B5, 'M', u'ɻ'),
+    (0x2B6, 'M', u'ʁ'),
+    (0x2B7, 'M', u'w'),
+    (0x2B8, 'M', u'y'),
+    (0x2B9, 'V'),
+    (0x2D8, '3', u' ̆'),
+    (0x2D9, '3', u' ̇'),
+    (0x2DA, '3', u' ̊'),
+    (0x2DB, '3', u' ̨'),
+    (0x2DC, '3', u' ̃'),
+    (0x2DD, '3', u' ̋'),
+    (0x2DE, 'V'),
+    (0x2E0, 'M', u'ɣ'),
+    (0x2E1, 'M', u'l'),
+    (0x2E2, 'M', u's'),
+    (0x2E3, 'M', u'x'),
+    (0x2E4, 'M', u'ʕ'),
+    (0x2E5, 'V'),
+    (0x340, 'M', u'̀'),
+    (0x341, 'M', u'́'),
+    (0x342, 'V'),
+    (0x343, 'M', u'̓'),
+    (0x344, 'M', u'̈́'),
+    (0x345, 'M', u'ι'),
+    (0x346, 'V'),
+    (0x34F, 'I'),
+    (0x350, 'V'),
+    (0x370, 'M', u'ͱ'),
+    (0x371, 'V'),
+    (0x372, 'M', u'ͳ'),
+    (0x373, 'V'),
+    (0x374, 'M', u'ʹ'),
+    (0x375, 'V'),
+    (0x376, 'M', u'ͷ'),
+    (0x377, 'V'),
+    ]
+
+def _seg_6():
+    return [
+    (0x378, 'X'),
+    (0x37A, '3', u' ι'),
+    (0x37B, 'V'),
+    (0x37E, '3', u';'),
+    (0x37F, 'M', u'ϳ'),
+    (0x380, 'X'),
+    (0x384, '3', u' ́'),
+    (0x385, '3', u' ̈́'),
+    (0x386, 'M', u'ά'),
+    (0x387, 'M', u'·'),
+    (0x388, 'M', u'έ'),
+    (0x389, 'M', u'ή'),
+    (0x38A, 'M', u'ί'),
+    (0x38B, 'X'),
+    (0x38C, 'M', u'ό'),
+    (0x38D, 'X'),
+    (0x38E, 'M', u'ύ'),
+    (0x38F, 'M', u'ώ'),
+    (0x390, 'V'),
+    (0x391, 'M', u'α'),
+    (0x392, 'M', u'β'),
+    (0x393, 'M', u'γ'),
+    (0x394, 'M', u'δ'),
+    (0x395, 'M', u'ε'),
+    (0x396, 'M', u'ζ'),
+    (0x397, 'M', u'η'),
+    (0x398, 'M', u'θ'),
+    (0x399, 'M', u'ι'),
+    (0x39A, 'M', u'κ'),
+    (0x39B, 'M', u'λ'),
+    (0x39C, 'M', u'μ'),
+    (0x39D, 'M', u'ν'),
+    (0x39E, 'M', u'ξ'),
+    (0x39F, 'M', u'ο'),
+    (0x3A0, 'M', u'π'),
+    (0x3A1, 'M', u'ρ'),
+    (0x3A2, 'X'),
+    (0x3A3, 'M', u'σ'),
+    (0x3A4, 'M', u'τ'),
+    (0x3A5, 'M', u'υ'),
+    (0x3A6, 'M', u'φ'),
+    (0x3A7, 'M', u'χ'),
+    (0x3A8, 'M', u'ψ'),
+    (0x3A9, 'M', u'ω'),
+    (0x3AA, 'M', u'ϊ'),
+    (0x3AB, 'M', u'ϋ'),
+    (0x3AC, 'V'),
+    (0x3C2, 'D', u'σ'),
+    (0x3C3, 'V'),
+    (0x3CF, 'M', u'ϗ'),
+    (0x3D0, 'M', u'β'),
+    (0x3D1, 'M', u'θ'),
+    (0x3D2, 'M', u'υ'),
+    (0x3D3, 'M', u'ύ'),
+    (0x3D4, 'M', u'ϋ'),
+    (0x3D5, 'M', u'φ'),
+    (0x3D6, 'M', u'π'),
+    (0x3D7, 'V'),
+    (0x3D8, 'M', u'ϙ'),
+    (0x3D9, 'V'),
+    (0x3DA, 'M', u'ϛ'),
+    (0x3DB, 'V'),
+    (0x3DC, 'M', u'ϝ'),
+    (0x3DD, 'V'),
+    (0x3DE, 'M', u'ϟ'),
+    (0x3DF, 'V'),
+    (0x3E0, 'M', u'ϡ'),
+    (0x3E1, 'V'),
+    (0x3E2, 'M', u'ϣ'),
+    (0x3E3, 'V'),
+    (0x3E4, 'M', u'ϥ'),
+    (0x3E5, 'V'),
+    (0x3E6, 'M', u'ϧ'),
+    (0x3E7, 'V'),
+    (0x3E8, 'M', u'ϩ'),
+    (0x3E9, 'V'),
+    (0x3EA, 'M', u'ϫ'),
+    (0x3EB, 'V'),
+    (0x3EC, 'M', u'ϭ'),
+    (0x3ED, 'V'),
+    (0x3EE, 'M', u'ϯ'),
+    (0x3EF, 'V'),
+    (0x3F0, 'M', u'κ'),
+    (0x3F1, 'M', u'ρ'),
+    (0x3F2, 'M', u'σ'),
+    (0x3F3, 'V'),
+    (0x3F4, 'M', u'θ'),
+    (0x3F5, 'M', u'ε'),
+    (0x3F6, 'V'),
+    (0x3F7, 'M', u'ϸ'),
+    (0x3F8, 'V'),
+    (0x3F9, 'M', u'σ'),
+    (0x3FA, 'M', u'ϻ'),
+    (0x3FB, 'V'),
+    (0x3FD, 'M', u'ͻ'),
+    (0x3FE, 'M', u'ͼ'),
+    (0x3FF, 'M', u'ͽ'),
+    (0x400, 'M', u'ѐ'),
+    (0x401, 'M', u'ё'),
+    (0x402, 'M', u'ђ'),
+    ]
+
+def _seg_7():
+    return [
+    (0x403, 'M', u'ѓ'),
+    (0x404, 'M', u'є'),
+    (0x405, 'M', u'ѕ'),
+    (0x406, 'M', u'і'),
+    (0x407, 'M', u'ї'),
+    (0x408, 'M', u'ј'),
+    (0x409, 'M', u'љ'),
+    (0x40A, 'M', u'њ'),
+    (0x40B, 'M', u'ћ'),
+    (0x40C, 'M', u'ќ'),
+    (0x40D, 'M', u'ѝ'),
+    (0x40E, 'M', u'ў'),
+    (0x40F, 'M', u'џ'),
+    (0x410, 'M', u'а'),
+    (0x411, 'M', u'б'),
+    (0x412, 'M', u'в'),
+    (0x413, 'M', u'г'),
+    (0x414, 'M', u'д'),
+    (0x415, 'M', u'е'),
+    (0x416, 'M', u'ж'),
+    (0x417, 'M', u'з'),
+    (0x418, 'M', u'и'),
+    (0x419, 'M', u'й'),
+    (0x41A, 'M', u'к'),
+    (0x41B, 'M', u'л'),
+    (0x41C, 'M', u'м'),
+    (0x41D, 'M', u'н'),
+    (0x41E, 'M', u'о'),
+    (0x41F, 'M', u'п'),
+    (0x420, 'M', u'р'),
+    (0x421, 'M', u'с'),
+    (0x422, 'M', u'т'),
+    (0x423, 'M', u'у'),
+    (0x424, 'M', u'ф'),
+    (0x425, 'M', u'х'),
+    (0x426, 'M', u'ц'),
+    (0x427, 'M', u'ч'),
+    (0x428, 'M', u'ш'),
+    (0x429, 'M', u'щ'),
+    (0x42A, 'M', u'ъ'),
+    (0x42B, 'M', u'ы'),
+    (0x42C, 'M', u'ь'),
+    (0x42D, 'M', u'э'),
+    (0x42E, 'M', u'ю'),
+    (0x42F, 'M', u'я'),
+    (0x430, 'V'),
+    (0x460, 'M', u'ѡ'),
+    (0x461, 'V'),
+    (0x462, 'M', u'ѣ'),
+    (0x463, 'V'),
+    (0x464, 'M', u'ѥ'),
+    (0x465, 'V'),
+    (0x466, 'M', u'ѧ'),
+    (0x467, 'V'),
+    (0x468, 'M', u'ѩ'),
+    (0x469, 'V'),
+    (0x46A, 'M', u'ѫ'),
+    (0x46B, 'V'),
+    (0x46C, 'M', u'ѭ'),
+    (0x46D, 'V'),
+    (0x46E, 'M', u'ѯ'),
+    (0x46F, 'V'),
+    (0x470, 'M', u'ѱ'),
+    (0x471, 'V'),
+    (0x472, 'M', u'ѳ'),
+    (0x473, 'V'),
+    (0x474, 'M', u'ѵ'),
+    (0x475, 'V'),
+    (0x476, 'M', u'ѷ'),
+    (0x477, 'V'),
+    (0x478, 'M', u'ѹ'),
+    (0x479, 'V'),
+    (0x47A, 'M', u'ѻ'),
+    (0x47B, 'V'),
+    (0x47C, 'M', u'ѽ'),
+    (0x47D, 'V'),
+    (0x47E, 'M', u'ѿ'),
+    (0x47F, 'V'),
+    (0x480, 'M', u'ҁ'),
+    (0x481, 'V'),
+    (0x48A, 'M', u'ҋ'),
+    (0x48B, 'V'),
+    (0x48C, 'M', u'ҍ'),
+    (0x48D, 'V'),
+    (0x48E, 'M', u'ҏ'),
+    (0x48F, 'V'),
+    (0x490, 'M', u'ґ'),
+    (0x491, 'V'),
+    (0x492, 'M', u'ғ'),
+    (0x493, 'V'),
+    (0x494, 'M', u'ҕ'),
+    (0x495, 'V'),
+    (0x496, 'M', u'җ'),
+    (0x497, 'V'),
+    (0x498, 'M', u'ҙ'),
+    (0x499, 'V'),
+    (0x49A, 'M', u'қ'),
+    (0x49B, 'V'),
+    (0x49C, 'M', u'ҝ'),
+    (0x49D, 'V'),
+    ]
+
+def _seg_8():
+    return [
+    (0x49E, 'M', u'ҟ'),
+    (0x49F, 'V'),
+    (0x4A0, 'M', u'ҡ'),
+    (0x4A1, 'V'),
+    (0x4A2, 'M', u'ң'),
+    (0x4A3, 'V'),
+    (0x4A4, 'M', u'ҥ'),
+    (0x4A5, 'V'),
+    (0x4A6, 'M', u'ҧ'),
+    (0x4A7, 'V'),
+    (0x4A8, 'M', u'ҩ'),
+    (0x4A9, 'V'),
+    (0x4AA, 'M', u'ҫ'),
+    (0x4AB, 'V'),
+    (0x4AC, 'M', u'ҭ'),
+    (0x4AD, 'V'),
+    (0x4AE, 'M', u'ү'),
+    (0x4AF, 'V'),
+    (0x4B0, 'M', u'ұ'),
+    (0x4B1, 'V'),
+    (0x4B2, 'M', u'ҳ'),
+    (0x4B3, 'V'),
+    (0x4B4, 'M', u'ҵ'),
+    (0x4B5, 'V'),
+    (0x4B6, 'M', u'ҷ'),
+    (0x4B7, 'V'),
+    (0x4B8, 'M', u'ҹ'),
+    (0x4B9, 'V'),
+    (0x4BA, 'M', u'һ'),
+    (0x4BB, 'V'),
+    (0x4BC, 'M', u'ҽ'),
+    (0x4BD, 'V'),
+    (0x4BE, 'M', u'ҿ'),
+    (0x4BF, 'V'),
+    (0x4C0, 'X'),
+    (0x4C1, 'M', u'ӂ'),
+    (0x4C2, 'V'),
+    (0x4C3, 'M', u'ӄ'),
+    (0x4C4, 'V'),
+    (0x4C5, 'M', u'ӆ'),
+    (0x4C6, 'V'),
+    (0x4C7, 'M', u'ӈ'),
+    (0x4C8, 'V'),
+    (0x4C9, 'M', u'ӊ'),
+    (0x4CA, 'V'),
+    (0x4CB, 'M', u'ӌ'),
+    (0x4CC, 'V'),
+    (0x4CD, 'M', u'ӎ'),
+    (0x4CE, 'V'),
+    (0x4D0, 'M', u'ӑ'),
+    (0x4D1, 'V'),
+    (0x4D2, 'M', u'ӓ'),
+    (0x4D3, 'V'),
+    (0x4D4, 'M', u'ӕ'),
+    (0x4D5, 'V'),
+    (0x4D6, 'M', u'ӗ'),
+    (0x4D7, 'V'),
+    (0x4D8, 'M', u'ә'),
+    (0x4D9, 'V'),
+    (0x4DA, 'M', u'ӛ'),
+    (0x4DB, 'V'),
+    (0x4DC, 'M', u'ӝ'),
+    (0x4DD, 'V'),
+    (0x4DE, 'M', u'ӟ'),
+    (0x4DF, 'V'),
+    (0x4E0, 'M', u'ӡ'),
+    (0x4E1, 'V'),
+    (0x4E2, 'M', u'ӣ'),
+    (0x4E3, 'V'),
+    (0x4E4, 'M', u'ӥ'),
+    (0x4E5, 'V'),
+    (0x4E6, 'M', u'ӧ'),
+    (0x4E7, 'V'),
+    (0x4E8, 'M', u'ө'),
+    (0x4E9, 'V'),
+    (0x4EA, 'M', u'ӫ'),
+    (0x4EB, 'V'),
+    (0x4EC, 'M', u'ӭ'),
+    (0x4ED, 'V'),
+    (0x4EE, 'M', u'ӯ'),
+    (0x4EF, 'V'),
+    (0x4F0, 'M', u'ӱ'),
+    (0x4F1, 'V'),
+    (0x4F2, 'M', u'ӳ'),
+    (0x4F3, 'V'),
+    (0x4F4, 'M', u'ӵ'),
+    (0x4F5, 'V'),
+    (0x4F6, 'M', u'ӷ'),
+    (0x4F7, 'V'),
+    (0x4F8, 'M', u'ӹ'),
+    (0x4F9, 'V'),
+    (0x4FA, 'M', u'ӻ'),
+    (0x4FB, 'V'),
+    (0x4FC, 'M', u'ӽ'),
+    (0x4FD, 'V'),
+    (0x4FE, 'M', u'ӿ'),
+    (0x4FF, 'V'),
+    (0x500, 'M', u'ԁ'),
+    (0x501, 'V'),
+    (0x502, 'M', u'ԃ'),
+    ]
+
+def _seg_9():
+    return [
+    (0x503, 'V'),
+    (0x504, 'M', u'ԅ'),
+    (0x505, 'V'),
+    (0x506, 'M', u'ԇ'),
+    (0x507, 'V'),
+    (0x508, 'M', u'ԉ'),
+    (0x509, 'V'),
+    (0x50A, 'M', u'ԋ'),
+    (0x50B, 'V'),
+    (0x50C, 'M', u'ԍ'),
+    (0x50D, 'V'),
+    (0x50E, 'M', u'ԏ'),
+    (0x50F, 'V'),
+    (0x510, 'M', u'ԑ'),
+    (0x511, 'V'),
+    (0x512, 'M', u'ԓ'),
+    (0x513, 'V'),
+    (0x514, 'M', u'ԕ'),
+    (0x515, 'V'),
+    (0x516, 'M', u'ԗ'),
+    (0x517, 'V'),
+    (0x518, 'M', u'ԙ'),
+    (0x519, 'V'),
+    (0x51A, 'M', u'ԛ'),
+    (0x51B, 'V'),
+    (0x51C, 'M', u'ԝ'),
+    (0x51D, 'V'),
+    (0x51E, 'M', u'ԟ'),
+    (0x51F, 'V'),
+    (0x520, 'M', u'ԡ'),
+    (0x521, 'V'),
+    (0x522, 'M', u'ԣ'),
+    (0x523, 'V'),
+    (0x524, 'M', u'ԥ'),
+    (0x525, 'V'),
+    (0x526, 'M', u'ԧ'),
+    (0x527, 'V'),
+    (0x528, 'M', u'ԩ'),
+    (0x529, 'V'),
+    (0x52A, 'M', u'ԫ'),
+    (0x52B, 'V'),
+    (0x52C, 'M', u'ԭ'),
+    (0x52D, 'V'),
+    (0x52E, 'M', u'ԯ'),
+    (0x52F, 'V'),
+    (0x530, 'X'),
+    (0x531, 'M', u'ա'),
+    (0x532, 'M', u'բ'),
+    (0x533, 'M', u'գ'),
+    (0x534, 'M', u'դ'),
+    (0x535, 'M', u'ե'),
+    (0x536, 'M', u'զ'),
+    (0x537, 'M', u'է'),
+    (0x538, 'M', u'ը'),
+    (0x539, 'M', u'թ'),
+    (0x53A, 'M', u'ժ'),
+    (0x53B, 'M', u'ի'),
+    (0x53C, 'M', u'լ'),
+    (0x53D, 'M', u'խ'),
+    (0x53E, 'M', u'ծ'),
+    (0x53F, 'M', u'կ'),
+    (0x540, 'M', u'հ'),
+    (0x541, 'M', u'ձ'),
+    (0x542, 'M', u'ղ'),
+    (0x543, 'M', u'ճ'),
+    (0x544, 'M', u'մ'),
+    (0x545, 'M', u'յ'),
+    (0x546, 'M', u'ն'),
+    (0x547, 'M', u'շ'),
+    (0x548, 'M', u'ո'),
+    (0x549, 'M', u'չ'),
+    (0x54A, 'M', u'պ'),
+    (0x54B, 'M', u'ջ'),
+    (0x54C, 'M', u'ռ'),
+    (0x54D, 'M', u'ս'),
+    (0x54E, 'M', u'վ'),
+    (0x54F, 'M', u'տ'),
+    (0x550, 'M', u'ր'),
+    (0x551, 'M', u'ց'),
+    (0x552, 'M', u'ւ'),
+    (0x553, 'M', u'փ'),
+    (0x554, 'M', u'ք'),
+    (0x555, 'M', u'օ'),
+    (0x556, 'M', u'ֆ'),
+    (0x557, 'X'),
+    (0x559, 'V'),
+    (0x587, 'M', u'եւ'),
+    (0x588, 'V'),
+    (0x58B, 'X'),
+    (0x58D, 'V'),
+    (0x590, 'X'),
+    (0x591, 'V'),
+    (0x5C8, 'X'),
+    (0x5D0, 'V'),
+    (0x5EB, 'X'),
+    (0x5EF, 'V'),
+    (0x5F5, 'X'),
+    (0x606, 'V'),
+    (0x61C, 'X'),
+    (0x61E, 'V'),
+    ]
+
+def _seg_10():
+    return [
+    (0x675, 'M', u'اٴ'),
+    (0x676, 'M', u'وٴ'),
+    (0x677, 'M', u'ۇٴ'),
+    (0x678, 'M', u'يٴ'),
+    (0x679, 'V'),
+    (0x6DD, 'X'),
+    (0x6DE, 'V'),
+    (0x70E, 'X'),
+    (0x710, 'V'),
+    (0x74B, 'X'),
+    (0x74D, 'V'),
+    (0x7B2, 'X'),
+    (0x7C0, 'V'),
+    (0x7FB, 'X'),
+    (0x7FD, 'V'),
+    (0x82E, 'X'),
+    (0x830, 'V'),
+    (0x83F, 'X'),
+    (0x840, 'V'),
+    (0x85C, 'X'),
+    (0x85E, 'V'),
+    (0x85F, 'X'),
+    (0x860, 'V'),
+    (0x86B, 'X'),
+    (0x8A0, 'V'),
+    (0x8B5, 'X'),
+    (0x8B6, 'V'),
+    (0x8C8, 'X'),
+    (0x8D3, 'V'),
+    (0x8E2, 'X'),
+    (0x8E3, 'V'),
+    (0x958, 'M', u'क़'),
+    (0x959, 'M', u'ख़'),
+    (0x95A, 'M', u'ग़'),
+    (0x95B, 'M', u'ज़'),
+    (0x95C, 'M', u'ड़'),
+    (0x95D, 'M', u'ढ़'),
+    (0x95E, 'M', u'फ़'),
+    (0x95F, 'M', u'य़'),
+    (0x960, 'V'),
+    (0x984, 'X'),
+    (0x985, 'V'),
+    (0x98D, 'X'),
+    (0x98F, 'V'),
+    (0x991, 'X'),
+    (0x993, 'V'),
+    (0x9A9, 'X'),
+    (0x9AA, 'V'),
+    (0x9B1, 'X'),
+    (0x9B2, 'V'),
+    (0x9B3, 'X'),
+    (0x9B6, 'V'),
+    (0x9BA, 'X'),
+    (0x9BC, 'V'),
+    (0x9C5, 'X'),
+    (0x9C7, 'V'),
+    (0x9C9, 'X'),
+    (0x9CB, 'V'),
+    (0x9CF, 'X'),
+    (0x9D7, 'V'),
+    (0x9D8, 'X'),
+    (0x9DC, 'M', u'ড়'),
+    (0x9DD, 'M', u'ঢ়'),
+    (0x9DE, 'X'),
+    (0x9DF, 'M', u'য়'),
+    (0x9E0, 'V'),
+    (0x9E4, 'X'),
+    (0x9E6, 'V'),
+    (0x9FF, 'X'),
+    (0xA01, 'V'),
+    (0xA04, 'X'),
+    (0xA05, 'V'),
+    (0xA0B, 'X'),
+    (0xA0F, 'V'),
+    (0xA11, 'X'),
+    (0xA13, 'V'),
+    (0xA29, 'X'),
+    (0xA2A, 'V'),
+    (0xA31, 'X'),
+    (0xA32, 'V'),
+    (0xA33, 'M', u'ਲ਼'),
+    (0xA34, 'X'),
+    (0xA35, 'V'),
+    (0xA36, 'M', u'ਸ਼'),
+    (0xA37, 'X'),
+    (0xA38, 'V'),
+    (0xA3A, 'X'),
+    (0xA3C, 'V'),
+    (0xA3D, 'X'),
+    (0xA3E, 'V'),
+    (0xA43, 'X'),
+    (0xA47, 'V'),
+    (0xA49, 'X'),
+    (0xA4B, 'V'),
+    (0xA4E, 'X'),
+    (0xA51, 'V'),
+    (0xA52, 'X'),
+    (0xA59, 'M', u'ਖ਼'),
+    (0xA5A, 'M', u'ਗ਼'),
+    (0xA5B, 'M', u'ਜ਼'),
+    ]
+
+def _seg_11():
+    return [
+    (0xA5C, 'V'),
+    (0xA5D, 'X'),
+    (0xA5E, 'M', u'ਫ਼'),
+    (0xA5F, 'X'),
+    (0xA66, 'V'),
+    (0xA77, 'X'),
+    (0xA81, 'V'),
+    (0xA84, 'X'),
+    (0xA85, 'V'),
+    (0xA8E, 'X'),
+    (0xA8F, 'V'),
+    (0xA92, 'X'),
+    (0xA93, 'V'),
+    (0xAA9, 'X'),
+    (0xAAA, 'V'),
+    (0xAB1, 'X'),
+    (0xAB2, 'V'),
+    (0xAB4, 'X'),
+    (0xAB5, 'V'),
+    (0xABA, 'X'),
+    (0xABC, 'V'),
+    (0xAC6, 'X'),
+    (0xAC7, 'V'),
+    (0xACA, 'X'),
+    (0xACB, 'V'),
+    (0xACE, 'X'),
+    (0xAD0, 'V'),
+    (0xAD1, 'X'),
+    (0xAE0, 'V'),
+    (0xAE4, 'X'),
+    (0xAE6, 'V'),
+    (0xAF2, 'X'),
+    (0xAF9, 'V'),
+    (0xB00, 'X'),
+    (0xB01, 'V'),
+    (0xB04, 'X'),
+    (0xB05, 'V'),
+    (0xB0D, 'X'),
+    (0xB0F, 'V'),
+    (0xB11, 'X'),
+    (0xB13, 'V'),
+    (0xB29, 'X'),
+    (0xB2A, 'V'),
+    (0xB31, 'X'),
+    (0xB32, 'V'),
+    (0xB34, 'X'),
+    (0xB35, 'V'),
+    (0xB3A, 'X'),
+    (0xB3C, 'V'),
+    (0xB45, 'X'),
+    (0xB47, 'V'),
+    (0xB49, 'X'),
+    (0xB4B, 'V'),
+    (0xB4E, 'X'),
+    (0xB55, 'V'),
+    (0xB58, 'X'),
+    (0xB5C, 'M', u'ଡ଼'),
+    (0xB5D, 'M', u'ଢ଼'),
+    (0xB5E, 'X'),
+    (0xB5F, 'V'),
+    (0xB64, 'X'),
+    (0xB66, 'V'),
+    (0xB78, 'X'),
+    (0xB82, 'V'),
+    (0xB84, 'X'),
+    (0xB85, 'V'),
+    (0xB8B, 'X'),
+    (0xB8E, 'V'),
+    (0xB91, 'X'),
+    (0xB92, 'V'),
+    (0xB96, 'X'),
+    (0xB99, 'V'),
+    (0xB9B, 'X'),
+    (0xB9C, 'V'),
+    (0xB9D, 'X'),
+    (0xB9E, 'V'),
+    (0xBA0, 'X'),
+    (0xBA3, 'V'),
+    (0xBA5, 'X'),
+    (0xBA8, 'V'),
+    (0xBAB, 'X'),
+    (0xBAE, 'V'),
+    (0xBBA, 'X'),
+    (0xBBE, 'V'),
+    (0xBC3, 'X'),
+    (0xBC6, 'V'),
+    (0xBC9, 'X'),
+    (0xBCA, 'V'),
+    (0xBCE, 'X'),
+    (0xBD0, 'V'),
+    (0xBD1, 'X'),
+    (0xBD7, 'V'),
+    (0xBD8, 'X'),
+    (0xBE6, 'V'),
+    (0xBFB, 'X'),
+    (0xC00, 'V'),
+    (0xC0D, 'X'),
+    (0xC0E, 'V'),
+    (0xC11, 'X'),
+    (0xC12, 'V'),
+    ]
+
+def _seg_12():
+    return [
+    (0xC29, 'X'),
+    (0xC2A, 'V'),
+    (0xC3A, 'X'),
+    (0xC3D, 'V'),
+    (0xC45, 'X'),
+    (0xC46, 'V'),
+    (0xC49, 'X'),
+    (0xC4A, 'V'),
+    (0xC4E, 'X'),
+    (0xC55, 'V'),
+    (0xC57, 'X'),
+    (0xC58, 'V'),
+    (0xC5B, 'X'),
+    (0xC60, 'V'),
+    (0xC64, 'X'),
+    (0xC66, 'V'),
+    (0xC70, 'X'),
+    (0xC77, 'V'),
+    (0xC8D, 'X'),
+    (0xC8E, 'V'),
+    (0xC91, 'X'),
+    (0xC92, 'V'),
+    (0xCA9, 'X'),
+    (0xCAA, 'V'),
+    (0xCB4, 'X'),
+    (0xCB5, 'V'),
+    (0xCBA, 'X'),
+    (0xCBC, 'V'),
+    (0xCC5, 'X'),
+    (0xCC6, 'V'),
+    (0xCC9, 'X'),
+    (0xCCA, 'V'),
+    (0xCCE, 'X'),
+    (0xCD5, 'V'),
+    (0xCD7, 'X'),
+    (0xCDE, 'V'),
+    (0xCDF, 'X'),
+    (0xCE0, 'V'),
+    (0xCE4, 'X'),
+    (0xCE6, 'V'),
+    (0xCF0, 'X'),
+    (0xCF1, 'V'),
+    (0xCF3, 'X'),
+    (0xD00, 'V'),
+    (0xD0D, 'X'),
+    (0xD0E, 'V'),
+    (0xD11, 'X'),
+    (0xD12, 'V'),
+    (0xD45, 'X'),
+    (0xD46, 'V'),
+    (0xD49, 'X'),
+    (0xD4A, 'V'),
+    (0xD50, 'X'),
+    (0xD54, 'V'),
+    (0xD64, 'X'),
+    (0xD66, 'V'),
+    (0xD80, 'X'),
+    (0xD81, 'V'),
+    (0xD84, 'X'),
+    (0xD85, 'V'),
+    (0xD97, 'X'),
+    (0xD9A, 'V'),
+    (0xDB2, 'X'),
+    (0xDB3, 'V'),
+    (0xDBC, 'X'),
+    (0xDBD, 'V'),
+    (0xDBE, 'X'),
+    (0xDC0, 'V'),
+    (0xDC7, 'X'),
+    (0xDCA, 'V'),
+    (0xDCB, 'X'),
+    (0xDCF, 'V'),
+    (0xDD5, 'X'),
+    (0xDD6, 'V'),
+    (0xDD7, 'X'),
+    (0xDD8, 'V'),
+    (0xDE0, 'X'),
+    (0xDE6, 'V'),
+    (0xDF0, 'X'),
+    (0xDF2, 'V'),
+    (0xDF5, 'X'),
+    (0xE01, 'V'),
+    (0xE33, 'M', u'ํา'),
+    (0xE34, 'V'),
+    (0xE3B, 'X'),
+    (0xE3F, 'V'),
+    (0xE5C, 'X'),
+    (0xE81, 'V'),
+    (0xE83, 'X'),
+    (0xE84, 'V'),
+    (0xE85, 'X'),
+    (0xE86, 'V'),
+    (0xE8B, 'X'),
+    (0xE8C, 'V'),
+    (0xEA4, 'X'),
+    (0xEA5, 'V'),
+    (0xEA6, 'X'),
+    (0xEA7, 'V'),
+    (0xEB3, 'M', u'ໍາ'),
+    (0xEB4, 'V'),
+    ]
+
+def _seg_13():
+    return [
+    (0xEBE, 'X'),
+    (0xEC0, 'V'),
+    (0xEC5, 'X'),
+    (0xEC6, 'V'),
+    (0xEC7, 'X'),
+    (0xEC8, 'V'),
+    (0xECE, 'X'),
+    (0xED0, 'V'),
+    (0xEDA, 'X'),
+    (0xEDC, 'M', u'ຫນ'),
+    (0xEDD, 'M', u'ຫມ'),
+    (0xEDE, 'V'),
+    (0xEE0, 'X'),
+    (0xF00, 'V'),
+    (0xF0C, 'M', u'་'),
+    (0xF0D, 'V'),
+    (0xF43, 'M', u'གྷ'),
+    (0xF44, 'V'),
+    (0xF48, 'X'),
+    (0xF49, 'V'),
+    (0xF4D, 'M', u'ཌྷ'),
+    (0xF4E, 'V'),
+    (0xF52, 'M', u'དྷ'),
+    (0xF53, 'V'),
+    (0xF57, 'M', u'བྷ'),
+    (0xF58, 'V'),
+    (0xF5C, 'M', u'ཛྷ'),
+    (0xF5D, 'V'),
+    (0xF69, 'M', u'ཀྵ'),
+    (0xF6A, 'V'),
+    (0xF6D, 'X'),
+    (0xF71, 'V'),
+    (0xF73, 'M', u'ཱི'),
+    (0xF74, 'V'),
+    (0xF75, 'M', u'ཱུ'),
+    (0xF76, 'M', u'ྲྀ'),
+    (0xF77, 'M', u'ྲཱྀ'),
+    (0xF78, 'M', u'ླྀ'),
+    (0xF79, 'M', u'ླཱྀ'),
+    (0xF7A, 'V'),
+    (0xF81, 'M', u'ཱྀ'),
+    (0xF82, 'V'),
+    (0xF93, 'M', u'ྒྷ'),
+    (0xF94, 'V'),
+    (0xF98, 'X'),
+    (0xF99, 'V'),
+    (0xF9D, 'M', u'ྜྷ'),
+    (0xF9E, 'V'),
+    (0xFA2, 'M', u'ྡྷ'),
+    (0xFA3, 'V'),
+    (0xFA7, 'M', u'ྦྷ'),
+    (0xFA8, 'V'),
+    (0xFAC, 'M', u'ྫྷ'),
+    (0xFAD, 'V'),
+    (0xFB9, 'M', u'ྐྵ'),
+    (0xFBA, 'V'),
+    (0xFBD, 'X'),
+    (0xFBE, 'V'),
+    (0xFCD, 'X'),
+    (0xFCE, 'V'),
+    (0xFDB, 'X'),
+    (0x1000, 'V'),
+    (0x10A0, 'X'),
+    (0x10C7, 'M', u'ⴧ'),
+    (0x10C8, 'X'),
+    (0x10CD, 'M', u'ⴭ'),
+    (0x10CE, 'X'),
+    (0x10D0, 'V'),
+    (0x10FC, 'M', u'ნ'),
+    (0x10FD, 'V'),
+    (0x115F, 'X'),
+    (0x1161, 'V'),
+    (0x1249, 'X'),
+    (0x124A, 'V'),
+    (0x124E, 'X'),
+    (0x1250, 'V'),
+    (0x1257, 'X'),
+    (0x1258, 'V'),
+    (0x1259, 'X'),
+    (0x125A, 'V'),
+    (0x125E, 'X'),
+    (0x1260, 'V'),
+    (0x1289, 'X'),
+    (0x128A, 'V'),
+    (0x128E, 'X'),
+    (0x1290, 'V'),
+    (0x12B1, 'X'),
+    (0x12B2, 'V'),
+    (0x12B6, 'X'),
+    (0x12B8, 'V'),
+    (0x12BF, 'X'),
+    (0x12C0, 'V'),
+    (0x12C1, 'X'),
+    (0x12C2, 'V'),
+    (0x12C6, 'X'),
+    (0x12C8, 'V'),
+    (0x12D7, 'X'),
+    (0x12D8, 'V'),
+    (0x1311, 'X'),
+    (0x1312, 'V'),
+    ]
+
+def _seg_14():
+    return [
+    (0x1316, 'X'),
+    (0x1318, 'V'),
+    (0x135B, 'X'),
+    (0x135D, 'V'),
+    (0x137D, 'X'),
+    (0x1380, 'V'),
+    (0x139A, 'X'),
+    (0x13A0, 'V'),
+    (0x13F6, 'X'),
+    (0x13F8, 'M', u'Ᏸ'),
+    (0x13F9, 'M', u'Ᏹ'),
+    (0x13FA, 'M', u'Ᏺ'),
+    (0x13FB, 'M', u'Ᏻ'),
+    (0x13FC, 'M', u'Ᏼ'),
+    (0x13FD, 'M', u'Ᏽ'),
+    (0x13FE, 'X'),
+    (0x1400, 'V'),
+    (0x1680, 'X'),
+    (0x1681, 'V'),
+    (0x169D, 'X'),
+    (0x16A0, 'V'),
+    (0x16F9, 'X'),
+    (0x1700, 'V'),
+    (0x170D, 'X'),
+    (0x170E, 'V'),
+    (0x1715, 'X'),
+    (0x1720, 'V'),
+    (0x1737, 'X'),
+    (0x1740, 'V'),
+    (0x1754, 'X'),
+    (0x1760, 'V'),
+    (0x176D, 'X'),
+    (0x176E, 'V'),
+    (0x1771, 'X'),
+    (0x1772, 'V'),
+    (0x1774, 'X'),
+    (0x1780, 'V'),
+    (0x17B4, 'X'),
+    (0x17B6, 'V'),
+    (0x17DE, 'X'),
+    (0x17E0, 'V'),
+    (0x17EA, 'X'),
+    (0x17F0, 'V'),
+    (0x17FA, 'X'),
+    (0x1800, 'V'),
+    (0x1806, 'X'),
+    (0x1807, 'V'),
+    (0x180B, 'I'),
+    (0x180E, 'X'),
+    (0x1810, 'V'),
+    (0x181A, 'X'),
+    (0x1820, 'V'),
+    (0x1879, 'X'),
+    (0x1880, 'V'),
+    (0x18AB, 'X'),
+    (0x18B0, 'V'),
+    (0x18F6, 'X'),
+    (0x1900, 'V'),
+    (0x191F, 'X'),
+    (0x1920, 'V'),
+    (0x192C, 'X'),
+    (0x1930, 'V'),
+    (0x193C, 'X'),
+    (0x1940, 'V'),
+    (0x1941, 'X'),
+    (0x1944, 'V'),
+    (0x196E, 'X'),
+    (0x1970, 'V'),
+    (0x1975, 'X'),
+    (0x1980, 'V'),
+    (0x19AC, 'X'),
+    (0x19B0, 'V'),
+    (0x19CA, 'X'),
+    (0x19D0, 'V'),
+    (0x19DB, 'X'),
+    (0x19DE, 'V'),
+    (0x1A1C, 'X'),
+    (0x1A1E, 'V'),
+    (0x1A5F, 'X'),
+    (0x1A60, 'V'),
+    (0x1A7D, 'X'),
+    (0x1A7F, 'V'),
+    (0x1A8A, 'X'),
+    (0x1A90, 'V'),
+    (0x1A9A, 'X'),
+    (0x1AA0, 'V'),
+    (0x1AAE, 'X'),
+    (0x1AB0, 'V'),
+    (0x1AC1, 'X'),
+    (0x1B00, 'V'),
+    (0x1B4C, 'X'),
+    (0x1B50, 'V'),
+    (0x1B7D, 'X'),
+    (0x1B80, 'V'),
+    (0x1BF4, 'X'),
+    (0x1BFC, 'V'),
+    (0x1C38, 'X'),
+    (0x1C3B, 'V'),
+    (0x1C4A, 'X'),
+    (0x1C4D, 'V'),
+    ]
+
+def _seg_15():
+    return [
+    (0x1C80, 'M', u'в'),
+    (0x1C81, 'M', u'д'),
+    (0x1C82, 'M', u'о'),
+    (0x1C83, 'M', u'с'),
+    (0x1C84, 'M', u'т'),
+    (0x1C86, 'M', u'ъ'),
+    (0x1C87, 'M', u'ѣ'),
+    (0x1C88, 'M', u'ꙋ'),
+    (0x1C89, 'X'),
+    (0x1C90, 'M', u'ა'),
+    (0x1C91, 'M', u'ბ'),
+    (0x1C92, 'M', u'გ'),
+    (0x1C93, 'M', u'დ'),
+    (0x1C94, 'M', u'ე'),
+    (0x1C95, 'M', u'ვ'),
+    (0x1C96, 'M', u'ზ'),
+    (0x1C97, 'M', u'თ'),
+    (0x1C98, 'M', u'ი'),
+    (0x1C99, 'M', u'კ'),
+    (0x1C9A, 'M', u'ლ'),
+    (0x1C9B, 'M', u'მ'),
+    (0x1C9C, 'M', u'ნ'),
+    (0x1C9D, 'M', u'ო'),
+    (0x1C9E, 'M', u'პ'),
+    (0x1C9F, 'M', u'ჟ'),
+    (0x1CA0, 'M', u'რ'),
+    (0x1CA1, 'M', u'ს'),
+    (0x1CA2, 'M', u'ტ'),
+    (0x1CA3, 'M', u'უ'),
+    (0x1CA4, 'M', u'ფ'),
+    (0x1CA5, 'M', u'ქ'),
+    (0x1CA6, 'M', u'ღ'),
+    (0x1CA7, 'M', u'ყ'),
+    (0x1CA8, 'M', u'შ'),
+    (0x1CA9, 'M', u'ჩ'),
+    (0x1CAA, 'M', u'ც'),
+    (0x1CAB, 'M', u'ძ'),
+    (0x1CAC, 'M', u'წ'),
+    (0x1CAD, 'M', u'ჭ'),
+    (0x1CAE, 'M', u'ხ'),
+    (0x1CAF, 'M', u'ჯ'),
+    (0x1CB0, 'M', u'ჰ'),
+    (0x1CB1, 'M', u'ჱ'),
+    (0x1CB2, 'M', u'ჲ'),
+    (0x1CB3, 'M', u'ჳ'),
+    (0x1CB4, 'M', u'ჴ'),
+    (0x1CB5, 'M', u'ჵ'),
+    (0x1CB6, 'M', u'ჶ'),
+    (0x1CB7, 'M', u'ჷ'),
+    (0x1CB8, 'M', u'ჸ'),
+    (0x1CB9, 'M', u'ჹ'),
+    (0x1CBA, 'M', u'ჺ'),
+    (0x1CBB, 'X'),
+    (0x1CBD, 'M', u'ჽ'),
+    (0x1CBE, 'M', u'ჾ'),
+    (0x1CBF, 'M', u'ჿ'),
+    (0x1CC0, 'V'),
+    (0x1CC8, 'X'),
+    (0x1CD0, 'V'),
+    (0x1CFB, 'X'),
+    (0x1D00, 'V'),
+    (0x1D2C, 'M', u'a'),
+    (0x1D2D, 'M', u'æ'),
+    (0x1D2E, 'M', u'b'),
+    (0x1D2F, 'V'),
+    (0x1D30, 'M', u'd'),
+    (0x1D31, 'M', u'e'),
+    (0x1D32, 'M', u'ǝ'),
+    (0x1D33, 'M', u'g'),
+    (0x1D34, 'M', u'h'),
+    (0x1D35, 'M', u'i'),
+    (0x1D36, 'M', u'j'),
+    (0x1D37, 'M', u'k'),
+    (0x1D38, 'M', u'l'),
+    (0x1D39, 'M', u'm'),
+    (0x1D3A, 'M', u'n'),
+    (0x1D3B, 'V'),
+    (0x1D3C, 'M', u'o'),
+    (0x1D3D, 'M', u'ȣ'),
+    (0x1D3E, 'M', u'p'),
+    (0x1D3F, 'M', u'r'),
+    (0x1D40, 'M', u't'),
+    (0x1D41, 'M', u'u'),
+    (0x1D42, 'M', u'w'),
+    (0x1D43, 'M', u'a'),
+    (0x1D44, 'M', u'ɐ'),
+    (0x1D45, 'M', u'ɑ'),
+    (0x1D46, 'M', u'ᴂ'),
+    (0x1D47, 'M', u'b'),
+    (0x1D48, 'M', u'd'),
+    (0x1D49, 'M', u'e'),
+    (0x1D4A, 'M', u'ə'),
+    (0x1D4B, 'M', u'ɛ'),
+    (0x1D4C, 'M', u'ɜ'),
+    (0x1D4D, 'M', u'g'),
+    (0x1D4E, 'V'),
+    (0x1D4F, 'M', u'k'),
+    (0x1D50, 'M', u'm'),
+    (0x1D51, 'M', u'ŋ'),
+    (0x1D52, 'M', u'o'),
+    ]
+
+def _seg_16():
+    return [
+    (0x1D53, 'M', u'ɔ'),
+    (0x1D54, 'M', u'ᴖ'),
+    (0x1D55, 'M', u'ᴗ'),
+    (0x1D56, 'M', u'p'),
+    (0x1D57, 'M', u't'),
+    (0x1D58, 'M', u'u'),
+    (0x1D59, 'M', u'ᴝ'),
+    (0x1D5A, 'M', u'ɯ'),
+    (0x1D5B, 'M', u'v'),
+    (0x1D5C, 'M', u'ᴥ'),
+    (0x1D5D, 'M', u'β'),
+    (0x1D5E, 'M', u'γ'),
+    (0x1D5F, 'M', u'δ'),
+    (0x1D60, 'M', u'φ'),
+    (0x1D61, 'M', u'χ'),
+    (0x1D62, 'M', u'i'),
+    (0x1D63, 'M', u'r'),
+    (0x1D64, 'M', u'u'),
+    (0x1D65, 'M', u'v'),
+    (0x1D66, 'M', u'β'),
+    (0x1D67, 'M', u'γ'),
+    (0x1D68, 'M', u'ρ'),
+    (0x1D69, 'M', u'φ'),
+    (0x1D6A, 'M', u'χ'),
+    (0x1D6B, 'V'),
+    (0x1D78, 'M', u'н'),
+    (0x1D79, 'V'),
+    (0x1D9B, 'M', u'ɒ'),
+    (0x1D9C, 'M', u'c'),
+    (0x1D9D, 'M', u'ɕ'),
+    (0x1D9E, 'M', u'ð'),
+    (0x1D9F, 'M', u'ɜ'),
+    (0x1DA0, 'M', u'f'),
+    (0x1DA1, 'M', u'ɟ'),
+    (0x1DA2, 'M', u'ɡ'),
+    (0x1DA3, 'M', u'ɥ'),
+    (0x1DA4, 'M', u'ɨ'),
+    (0x1DA5, 'M', u'ɩ'),
+    (0x1DA6, 'M', u'ɪ'),
+    (0x1DA7, 'M', u'ᵻ'),
+    (0x1DA8, 'M', u'ʝ'),
+    (0x1DA9, 'M', u'ɭ'),
+    (0x1DAA, 'M', u'ᶅ'),
+    (0x1DAB, 'M', u'ʟ'),
+    (0x1DAC, 'M', u'ɱ'),
+    (0x1DAD, 'M', u'ɰ'),
+    (0x1DAE, 'M', u'ɲ'),
+    (0x1DAF, 'M', u'ɳ'),
+    (0x1DB0, 'M', u'ɴ'),
+    (0x1DB1, 'M', u'ɵ'),
+    (0x1DB2, 'M', u'ɸ'),
+    (0x1DB3, 'M', u'ʂ'),
+    (0x1DB4, 'M', u'ʃ'),
+    (0x1DB5, 'M', u'ƫ'),
+    (0x1DB6, 'M', u'ʉ'),
+    (0x1DB7, 'M', u'ʊ'),
+    (0x1DB8, 'M', u'ᴜ'),
+    (0x1DB9, 'M', u'ʋ'),
+    (0x1DBA, 'M', u'ʌ'),
+    (0x1DBB, 'M', u'z'),
+    (0x1DBC, 'M', u'ʐ'),
+    (0x1DBD, 'M', u'ʑ'),
+    (0x1DBE, 'M', u'ʒ'),
+    (0x1DBF, 'M', u'θ'),
+    (0x1DC0, 'V'),
+    (0x1DFA, 'X'),
+    (0x1DFB, 'V'),
+    (0x1E00, 'M', u'ḁ'),
+    (0x1E01, 'V'),
+    (0x1E02, 'M', u'ḃ'),
+    (0x1E03, 'V'),
+    (0x1E04, 'M', u'ḅ'),
+    (0x1E05, 'V'),
+    (0x1E06, 'M', u'ḇ'),
+    (0x1E07, 'V'),
+    (0x1E08, 'M', u'ḉ'),
+    (0x1E09, 'V'),
+    (0x1E0A, 'M', u'ḋ'),
+    (0x1E0B, 'V'),
+    (0x1E0C, 'M', u'ḍ'),
+    (0x1E0D, 'V'),
+    (0x1E0E, 'M', u'ḏ'),
+    (0x1E0F, 'V'),
+    (0x1E10, 'M', u'ḑ'),
+    (0x1E11, 'V'),
+    (0x1E12, 'M', u'ḓ'),
+    (0x1E13, 'V'),
+    (0x1E14, 'M', u'ḕ'),
+    (0x1E15, 'V'),
+    (0x1E16, 'M', u'ḗ'),
+    (0x1E17, 'V'),
+    (0x1E18, 'M', u'ḙ'),
+    (0x1E19, 'V'),
+    (0x1E1A, 'M', u'ḛ'),
+    (0x1E1B, 'V'),
+    (0x1E1C, 'M', u'ḝ'),
+    (0x1E1D, 'V'),
+    (0x1E1E, 'M', u'ḟ'),
+    (0x1E1F, 'V'),
+    (0x1E20, 'M', u'ḡ'),
+    ]
+
+def _seg_17():
+    return [
+    (0x1E21, 'V'),
+    (0x1E22, 'M', u'ḣ'),
+    (0x1E23, 'V'),
+    (0x1E24, 'M', u'ḥ'),
+    (0x1E25, 'V'),
+    (0x1E26, 'M', u'ḧ'),
+    (0x1E27, 'V'),
+    (0x1E28, 'M', u'ḩ'),
+    (0x1E29, 'V'),
+    (0x1E2A, 'M', u'ḫ'),
+    (0x1E2B, 'V'),
+    (0x1E2C, 'M', u'ḭ'),
+    (0x1E2D, 'V'),
+    (0x1E2E, 'M', u'ḯ'),
+    (0x1E2F, 'V'),
+    (0x1E30, 'M', u'ḱ'),
+    (0x1E31, 'V'),
+    (0x1E32, 'M', u'ḳ'),
+    (0x1E33, 'V'),
+    (0x1E34, 'M', u'ḵ'),
+    (0x1E35, 'V'),
+    (0x1E36, 'M', u'ḷ'),
+    (0x1E37, 'V'),
+    (0x1E38, 'M', u'ḹ'),
+    (0x1E39, 'V'),
+    (0x1E3A, 'M', u'ḻ'),
+    (0x1E3B, 'V'),
+    (0x1E3C, 'M', u'ḽ'),
+    (0x1E3D, 'V'),
+    (0x1E3E, 'M', u'ḿ'),
+    (0x1E3F, 'V'),
+    (0x1E40, 'M', u'ṁ'),
+    (0x1E41, 'V'),
+    (0x1E42, 'M', u'ṃ'),
+    (0x1E43, 'V'),
+    (0x1E44, 'M', u'ṅ'),
+    (0x1E45, 'V'),
+    (0x1E46, 'M', u'ṇ'),
+    (0x1E47, 'V'),
+    (0x1E48, 'M', u'ṉ'),
+    (0x1E49, 'V'),
+    (0x1E4A, 'M', u'ṋ'),
+    (0x1E4B, 'V'),
+    (0x1E4C, 'M', u'ṍ'),
+    (0x1E4D, 'V'),
+    (0x1E4E, 'M', u'ṏ'),
+    (0x1E4F, 'V'),
+    (0x1E50, 'M', u'ṑ'),
+    (0x1E51, 'V'),
+    (0x1E52, 'M', u'ṓ'),
+    (0x1E53, 'V'),
+    (0x1E54, 'M', u'ṕ'),
+    (0x1E55, 'V'),
+    (0x1E56, 'M', u'ṗ'),
+    (0x1E57, 'V'),
+    (0x1E58, 'M', u'ṙ'),
+    (0x1E59, 'V'),
+    (0x1E5A, 'M', u'ṛ'),
+    (0x1E5B, 'V'),
+    (0x1E5C, 'M', u'ṝ'),
+    (0x1E5D, 'V'),
+    (0x1E5E, 'M', u'ṟ'),
+    (0x1E5F, 'V'),
+    (0x1E60, 'M', u'ṡ'),
+    (0x1E61, 'V'),
+    (0x1E62, 'M', u'ṣ'),
+    (0x1E63, 'V'),
+    (0x1E64, 'M', u'ṥ'),
+    (0x1E65, 'V'),
+    (0x1E66, 'M', u'ṧ'),
+    (0x1E67, 'V'),
+    (0x1E68, 'M', u'ṩ'),
+    (0x1E69, 'V'),
+    (0x1E6A, 'M', u'ṫ'),
+    (0x1E6B, 'V'),
+    (0x1E6C, 'M', u'ṭ'),
+    (0x1E6D, 'V'),
+    (0x1E6E, 'M', u'ṯ'),
+    (0x1E6F, 'V'),
+    (0x1E70, 'M', u'ṱ'),
+    (0x1E71, 'V'),
+    (0x1E72, 'M', u'ṳ'),
+    (0x1E73, 'V'),
+    (0x1E74, 'M', u'ṵ'),
+    (0x1E75, 'V'),
+    (0x1E76, 'M', u'ṷ'),
+    (0x1E77, 'V'),
+    (0x1E78, 'M', u'ṹ'),
+    (0x1E79, 'V'),
+    (0x1E7A, 'M', u'ṻ'),
+    (0x1E7B, 'V'),
+    (0x1E7C, 'M', u'ṽ'),
+    (0x1E7D, 'V'),
+    (0x1E7E, 'M', u'ṿ'),
+    (0x1E7F, 'V'),
+    (0x1E80, 'M', u'ẁ'),
+    (0x1E81, 'V'),
+    (0x1E82, 'M', u'ẃ'),
+    (0x1E83, 'V'),
+    (0x1E84, 'M', u'ẅ'),
+    ]
+
+def _seg_18():
+    return [
+    (0x1E85, 'V'),
+    (0x1E86, 'M', u'ẇ'),
+    (0x1E87, 'V'),
+    (0x1E88, 'M', u'ẉ'),
+    (0x1E89, 'V'),
+    (0x1E8A, 'M', u'ẋ'),
+    (0x1E8B, 'V'),
+    (0x1E8C, 'M', u'ẍ'),
+    (0x1E8D, 'V'),
+    (0x1E8E, 'M', u'ẏ'),
+    (0x1E8F, 'V'),
+    (0x1E90, 'M', u'ẑ'),
+    (0x1E91, 'V'),
+    (0x1E92, 'M', u'ẓ'),
+    (0x1E93, 'V'),
+    (0x1E94, 'M', u'ẕ'),
+    (0x1E95, 'V'),
+    (0x1E9A, 'M', u'aʾ'),
+    (0x1E9B, 'M', u'ṡ'),
+    (0x1E9C, 'V'),
+    (0x1E9E, 'M', u'ss'),
+    (0x1E9F, 'V'),
+    (0x1EA0, 'M', u'ạ'),
+    (0x1EA1, 'V'),
+    (0x1EA2, 'M', u'ả'),
+    (0x1EA3, 'V'),
+    (0x1EA4, 'M', u'ấ'),
+    (0x1EA5, 'V'),
+    (0x1EA6, 'M', u'ầ'),
+    (0x1EA7, 'V'),
+    (0x1EA8, 'M', u'ẩ'),
+    (0x1EA9, 'V'),
+    (0x1EAA, 'M', u'ẫ'),
+    (0x1EAB, 'V'),
+    (0x1EAC, 'M', u'ậ'),
+    (0x1EAD, 'V'),
+    (0x1EAE, 'M', u'ắ'),
+    (0x1EAF, 'V'),
+    (0x1EB0, 'M', u'ằ'),
+    (0x1EB1, 'V'),
+    (0x1EB2, 'M', u'ẳ'),
+    (0x1EB3, 'V'),
+    (0x1EB4, 'M', u'ẵ'),
+    (0x1EB5, 'V'),
+    (0x1EB6, 'M', u'ặ'),
+    (0x1EB7, 'V'),
+    (0x1EB8, 'M', u'ẹ'),
+    (0x1EB9, 'V'),
+    (0x1EBA, 'M', u'ẻ'),
+    (0x1EBB, 'V'),
+    (0x1EBC, 'M', u'ẽ'),
+    (0x1EBD, 'V'),
+    (0x1EBE, 'M', u'ế'),
+    (0x1EBF, 'V'),
+    (0x1EC0, 'M', u'ề'),
+    (0x1EC1, 'V'),
+    (0x1EC2, 'M', u'ể'),
+    (0x1EC3, 'V'),
+    (0x1EC4, 'M', u'ễ'),
+    (0x1EC5, 'V'),
+    (0x1EC6, 'M', u'ệ'),
+    (0x1EC7, 'V'),
+    (0x1EC8, 'M', u'ỉ'),
+    (0x1EC9, 'V'),
+    (0x1ECA, 'M', u'ị'),
+    (0x1ECB, 'V'),
+    (0x1ECC, 'M', u'ọ'),
+    (0x1ECD, 'V'),
+    (0x1ECE, 'M', u'ỏ'),
+    (0x1ECF, 'V'),
+    (0x1ED0, 'M', u'ố'),
+    (0x1ED1, 'V'),
+    (0x1ED2, 'M', u'ồ'),
+    (0x1ED3, 'V'),
+    (0x1ED4, 'M', u'ổ'),
+    (0x1ED5, 'V'),
+    (0x1ED6, 'M', u'ỗ'),
+    (0x1ED7, 'V'),
+    (0x1ED8, 'M', u'ộ'),
+    (0x1ED9, 'V'),
+    (0x1EDA, 'M', u'ớ'),
+    (0x1EDB, 'V'),
+    (0x1EDC, 'M', u'ờ'),
+    (0x1EDD, 'V'),
+    (0x1EDE, 'M', u'ở'),
+    (0x1EDF, 'V'),
+    (0x1EE0, 'M', u'ỡ'),
+    (0x1EE1, 'V'),
+    (0x1EE2, 'M', u'ợ'),
+    (0x1EE3, 'V'),
+    (0x1EE4, 'M', u'ụ'),
+    (0x1EE5, 'V'),
+    (0x1EE6, 'M', u'ủ'),
+    (0x1EE7, 'V'),
+    (0x1EE8, 'M', u'ứ'),
+    (0x1EE9, 'V'),
+    (0x1EEA, 'M', u'ừ'),
+    (0x1EEB, 'V'),
+    (0x1EEC, 'M', u'ử'),
+    (0x1EED, 'V'),
+    ]
+
+def _seg_19():
+    return [
+    (0x1EEE, 'M', u'ữ'),
+    (0x1EEF, 'V'),
+    (0x1EF0, 'M', u'ự'),
+    (0x1EF1, 'V'),
+    (0x1EF2, 'M', u'ỳ'),
+    (0x1EF3, 'V'),
+    (0x1EF4, 'M', u'ỵ'),
+    (0x1EF5, 'V'),
+    (0x1EF6, 'M', u'ỷ'),
+    (0x1EF7, 'V'),
+    (0x1EF8, 'M', u'ỹ'),
+    (0x1EF9, 'V'),
+    (0x1EFA, 'M', u'ỻ'),
+    (0x1EFB, 'V'),
+    (0x1EFC, 'M', u'ỽ'),
+    (0x1EFD, 'V'),
+    (0x1EFE, 'M', u'ỿ'),
+    (0x1EFF, 'V'),
+    (0x1F08, 'M', u'ἀ'),
+    (0x1F09, 'M', u'ἁ'),
+    (0x1F0A, 'M', u'ἂ'),
+    (0x1F0B, 'M', u'ἃ'),
+    (0x1F0C, 'M', u'ἄ'),
+    (0x1F0D, 'M', u'ἅ'),
+    (0x1F0E, 'M', u'ἆ'),
+    (0x1F0F, 'M', u'ἇ'),
+    (0x1F10, 'V'),
+    (0x1F16, 'X'),
+    (0x1F18, 'M', u'ἐ'),
+    (0x1F19, 'M', u'ἑ'),
+    (0x1F1A, 'M', u'ἒ'),
+    (0x1F1B, 'M', u'ἓ'),
+    (0x1F1C, 'M', u'ἔ'),
+    (0x1F1D, 'M', u'ἕ'),
+    (0x1F1E, 'X'),
+    (0x1F20, 'V'),
+    (0x1F28, 'M', u'ἠ'),
+    (0x1F29, 'M', u'ἡ'),
+    (0x1F2A, 'M', u'ἢ'),
+    (0x1F2B, 'M', u'ἣ'),
+    (0x1F2C, 'M', u'ἤ'),
+    (0x1F2D, 'M', u'ἥ'),
+    (0x1F2E, 'M', u'ἦ'),
+    (0x1F2F, 'M', u'ἧ'),
+    (0x1F30, 'V'),
+    (0x1F38, 'M', u'ἰ'),
+    (0x1F39, 'M', u'ἱ'),
+    (0x1F3A, 'M', u'ἲ'),
+    (0x1F3B, 'M', u'ἳ'),
+    (0x1F3C, 'M', u'ἴ'),
+    (0x1F3D, 'M', u'ἵ'),
+    (0x1F3E, 'M', u'ἶ'),
+    (0x1F3F, 'M', u'ἷ'),
+    (0x1F40, 'V'),
+    (0x1F46, 'X'),
+    (0x1F48, 'M', u'ὀ'),
+    (0x1F49, 'M', u'ὁ'),
+    (0x1F4A, 'M', u'ὂ'),
+    (0x1F4B, 'M', u'ὃ'),
+    (0x1F4C, 'M', u'ὄ'),
+    (0x1F4D, 'M', u'ὅ'),
+    (0x1F4E, 'X'),
+    (0x1F50, 'V'),
+    (0x1F58, 'X'),
+    (0x1F59, 'M', u'ὑ'),
+    (0x1F5A, 'X'),
+    (0x1F5B, 'M', u'ὓ'),
+    (0x1F5C, 'X'),
+    (0x1F5D, 'M', u'ὕ'),
+    (0x1F5E, 'X'),
+    (0x1F5F, 'M', u'ὗ'),
+    (0x1F60, 'V'),
+    (0x1F68, 'M', u'ὠ'),
+    (0x1F69, 'M', u'ὡ'),
+    (0x1F6A, 'M', u'ὢ'),
+    (0x1F6B, 'M', u'ὣ'),
+    (0x1F6C, 'M', u'ὤ'),
+    (0x1F6D, 'M', u'ὥ'),
+    (0x1F6E, 'M', u'ὦ'),
+    (0x1F6F, 'M', u'ὧ'),
+    (0x1F70, 'V'),
+    (0x1F71, 'M', u'ά'),
+    (0x1F72, 'V'),
+    (0x1F73, 'M', u'έ'),
+    (0x1F74, 'V'),
+    (0x1F75, 'M', u'ή'),
+    (0x1F76, 'V'),
+    (0x1F77, 'M', u'ί'),
+    (0x1F78, 'V'),
+    (0x1F79, 'M', u'ό'),
+    (0x1F7A, 'V'),
+    (0x1F7B, 'M', u'ύ'),
+    (0x1F7C, 'V'),
+    (0x1F7D, 'M', u'ώ'),
+    (0x1F7E, 'X'),
+    (0x1F80, 'M', u'ἀι'),
+    (0x1F81, 'M', u'ἁι'),
+    (0x1F82, 'M', u'ἂι'),
+    (0x1F83, 'M', u'ἃι'),
+    (0x1F84, 'M', u'ἄι'),
+    ]
+
+def _seg_20():
+    return [
+    (0x1F85, 'M', u'ἅι'),
+    (0x1F86, 'M', u'ἆι'),
+    (0x1F87, 'M', u'ἇι'),
+    (0x1F88, 'M', u'ἀι'),
+    (0x1F89, 'M', u'ἁι'),
+    (0x1F8A, 'M', u'ἂι'),
+    (0x1F8B, 'M', u'ἃι'),
+    (0x1F8C, 'M', u'ἄι'),
+    (0x1F8D, 'M', u'ἅι'),
+    (0x1F8E, 'M', u'ἆι'),
+    (0x1F8F, 'M', u'ἇι'),
+    (0x1F90, 'M', u'ἠι'),
+    (0x1F91, 'M', u'ἡι'),
+    (0x1F92, 'M', u'ἢι'),
+    (0x1F93, 'M', u'ἣι'),
+    (0x1F94, 'M', u'ἤι'),
+    (0x1F95, 'M', u'ἥι'),
+    (0x1F96, 'M', u'ἦι'),
+    (0x1F97, 'M', u'ἧι'),
+    (0x1F98, 'M', u'ἠι'),
+    (0x1F99, 'M', u'ἡι'),
+    (0x1F9A, 'M', u'ἢι'),
+    (0x1F9B, 'M', u'ἣι'),
+    (0x1F9C, 'M', u'ἤι'),
+    (0x1F9D, 'M', u'ἥι'),
+    (0x1F9E, 'M', u'ἦι'),
+    (0x1F9F, 'M', u'ἧι'),
+    (0x1FA0, 'M', u'ὠι'),
+    (0x1FA1, 'M', u'ὡι'),
+    (0x1FA2, 'M', u'ὢι'),
+    (0x1FA3, 'M', u'ὣι'),
+    (0x1FA4, 'M', u'ὤι'),
+    (0x1FA5, 'M', u'ὥι'),
+    (0x1FA6, 'M', u'ὦι'),
+    (0x1FA7, 'M', u'ὧι'),
+    (0x1FA8, 'M', u'ὠι'),
+    (0x1FA9, 'M', u'ὡι'),
+    (0x1FAA, 'M', u'ὢι'),
+    (0x1FAB, 'M', u'ὣι'),
+    (0x1FAC, 'M', u'ὤι'),
+    (0x1FAD, 'M', u'ὥι'),
+    (0x1FAE, 'M', u'ὦι'),
+    (0x1FAF, 'M', u'ὧι'),
+    (0x1FB0, 'V'),
+    (0x1FB2, 'M', u'ὰι'),
+    (0x1FB3, 'M', u'αι'),
+    (0x1FB4, 'M', u'άι'),
+    (0x1FB5, 'X'),
+    (0x1FB6, 'V'),
+    (0x1FB7, 'M', u'ᾶι'),
+    (0x1FB8, 'M', u'ᾰ'),
+    (0x1FB9, 'M', u'ᾱ'),
+    (0x1FBA, 'M', u'ὰ'),
+    (0x1FBB, 'M', u'ά'),
+    (0x1FBC, 'M', u'αι'),
+    (0x1FBD, '3', u' ̓'),
+    (0x1FBE, 'M', u'ι'),
+    (0x1FBF, '3', u' ̓'),
+    (0x1FC0, '3', u' ͂'),
+    (0x1FC1, '3', u' ̈͂'),
+    (0x1FC2, 'M', u'ὴι'),
+    (0x1FC3, 'M', u'ηι'),
+    (0x1FC4, 'M', u'ήι'),
+    (0x1FC5, 'X'),
+    (0x1FC6, 'V'),
+    (0x1FC7, 'M', u'ῆι'),
+    (0x1FC8, 'M', u'ὲ'),
+    (0x1FC9, 'M', u'έ'),
+    (0x1FCA, 'M', u'ὴ'),
+    (0x1FCB, 'M', u'ή'),
+    (0x1FCC, 'M', u'ηι'),
+    (0x1FCD, '3', u' ̓̀'),
+    (0x1FCE, '3', u' ̓́'),
+    (0x1FCF, '3', u' ̓͂'),
+    (0x1FD0, 'V'),
+    (0x1FD3, 'M', u'ΐ'),
+    (0x1FD4, 'X'),
+    (0x1FD6, 'V'),
+    (0x1FD8, 'M', u'ῐ'),
+    (0x1FD9, 'M', u'ῑ'),
+    (0x1FDA, 'M', u'ὶ'),
+    (0x1FDB, 'M', u'ί'),
+    (0x1FDC, 'X'),
+    (0x1FDD, '3', u' ̔̀'),
+    (0x1FDE, '3', u' ̔́'),
+    (0x1FDF, '3', u' ̔͂'),
+    (0x1FE0, 'V'),
+    (0x1FE3, 'M', u'ΰ'),
+    (0x1FE4, 'V'),
+    (0x1FE8, 'M', u'ῠ'),
+    (0x1FE9, 'M', u'ῡ'),
+    (0x1FEA, 'M', u'ὺ'),
+    (0x1FEB, 'M', u'ύ'),
+    (0x1FEC, 'M', u'ῥ'),
+    (0x1FED, '3', u' ̈̀'),
+    (0x1FEE, '3', u' ̈́'),
+    (0x1FEF, '3', u'`'),
+    (0x1FF0, 'X'),
+    (0x1FF2, 'M', u'ὼι'),
+    (0x1FF3, 'M', u'ωι'),
+    ]
+
+def _seg_21():
+    return [
+    (0x1FF4, 'M', u'ώι'),
+    (0x1FF5, 'X'),
+    (0x1FF6, 'V'),
+    (0x1FF7, 'M', u'ῶι'),
+    (0x1FF8, 'M', u'ὸ'),
+    (0x1FF9, 'M', u'ό'),
+    (0x1FFA, 'M', u'ὼ'),
+    (0x1FFB, 'M', u'ώ'),
+    (0x1FFC, 'M', u'ωι'),
+    (0x1FFD, '3', u' ́'),
+    (0x1FFE, '3', u' ̔'),
+    (0x1FFF, 'X'),
+    (0x2000, '3', u' '),
+    (0x200B, 'I'),
+    (0x200C, 'D', u''),
+    (0x200E, 'X'),
+    (0x2010, 'V'),
+    (0x2011, 'M', u'‐'),
+    (0x2012, 'V'),
+    (0x2017, '3', u' ̳'),
+    (0x2018, 'V'),
+    (0x2024, 'X'),
+    (0x2027, 'V'),
+    (0x2028, 'X'),
+    (0x202F, '3', u' '),
+    (0x2030, 'V'),
+    (0x2033, 'M', u'′′'),
+    (0x2034, 'M', u'′′′'),
+    (0x2035, 'V'),
+    (0x2036, 'M', u'‵‵'),
+    (0x2037, 'M', u'‵‵‵'),
+    (0x2038, 'V'),
+    (0x203C, '3', u'!!'),
+    (0x203D, 'V'),
+    (0x203E, '3', u' ̅'),
+    (0x203F, 'V'),
+    (0x2047, '3', u'??'),
+    (0x2048, '3', u'?!'),
+    (0x2049, '3', u'!?'),
+    (0x204A, 'V'),
+    (0x2057, 'M', u'′′′′'),
+    (0x2058, 'V'),
+    (0x205F, '3', u' '),
+    (0x2060, 'I'),
+    (0x2061, 'X'),
+    (0x2064, 'I'),
+    (0x2065, 'X'),
+    (0x2070, 'M', u'0'),
+    (0x2071, 'M', u'i'),
+    (0x2072, 'X'),
+    (0x2074, 'M', u'4'),
+    (0x2075, 'M', u'5'),
+    (0x2076, 'M', u'6'),
+    (0x2077, 'M', u'7'),
+    (0x2078, 'M', u'8'),
+    (0x2079, 'M', u'9'),
+    (0x207A, '3', u'+'),
+    (0x207B, 'M', u'−'),
+    (0x207C, '3', u'='),
+    (0x207D, '3', u'('),
+    (0x207E, '3', u')'),
+    (0x207F, 'M', u'n'),
+    (0x2080, 'M', u'0'),
+    (0x2081, 'M', u'1'),
+    (0x2082, 'M', u'2'),
+    (0x2083, 'M', u'3'),
+    (0x2084, 'M', u'4'),
+    (0x2085, 'M', u'5'),
+    (0x2086, 'M', u'6'),
+    (0x2087, 'M', u'7'),
+    (0x2088, 'M', u'8'),
+    (0x2089, 'M', u'9'),
+    (0x208A, '3', u'+'),
+    (0x208B, 'M', u'−'),
+    (0x208C, '3', u'='),
+    (0x208D, '3', u'('),
+    (0x208E, '3', u')'),
+    (0x208F, 'X'),
+    (0x2090, 'M', u'a'),
+    (0x2091, 'M', u'e'),
+    (0x2092, 'M', u'o'),
+    (0x2093, 'M', u'x'),
+    (0x2094, 'M', u'ə'),
+    (0x2095, 'M', u'h'),
+    (0x2096, 'M', u'k'),
+    (0x2097, 'M', u'l'),
+    (0x2098, 'M', u'm'),
+    (0x2099, 'M', u'n'),
+    (0x209A, 'M', u'p'),
+    (0x209B, 'M', u's'),
+    (0x209C, 'M', u't'),
+    (0x209D, 'X'),
+    (0x20A0, 'V'),
+    (0x20A8, 'M', u'rs'),
+    (0x20A9, 'V'),
+    (0x20C0, 'X'),
+    (0x20D0, 'V'),
+    (0x20F1, 'X'),
+    (0x2100, '3', u'a/c'),
+    (0x2101, '3', u'a/s'),
+    ]
+
+def _seg_22():
+    return [
+    (0x2102, 'M', u'c'),
+    (0x2103, 'M', u'°c'),
+    (0x2104, 'V'),
+    (0x2105, '3', u'c/o'),
+    (0x2106, '3', u'c/u'),
+    (0x2107, 'M', u'ɛ'),
+    (0x2108, 'V'),
+    (0x2109, 'M', u'°f'),
+    (0x210A, 'M', u'g'),
+    (0x210B, 'M', u'h'),
+    (0x210F, 'M', u'ħ'),
+    (0x2110, 'M', u'i'),
+    (0x2112, 'M', u'l'),
+    (0x2114, 'V'),
+    (0x2115, 'M', u'n'),
+    (0x2116, 'M', u'no'),
+    (0x2117, 'V'),
+    (0x2119, 'M', u'p'),
+    (0x211A, 'M', u'q'),
+    (0x211B, 'M', u'r'),
+    (0x211E, 'V'),
+    (0x2120, 'M', u'sm'),
+    (0x2121, 'M', u'tel'),
+    (0x2122, 'M', u'tm'),
+    (0x2123, 'V'),
+    (0x2124, 'M', u'z'),
+    (0x2125, 'V'),
+    (0x2126, 'M', u'ω'),
+    (0x2127, 'V'),
+    (0x2128, 'M', u'z'),
+    (0x2129, 'V'),
+    (0x212A, 'M', u'k'),
+    (0x212B, 'M', u'å'),
+    (0x212C, 'M', u'b'),
+    (0x212D, 'M', u'c'),
+    (0x212E, 'V'),
+    (0x212F, 'M', u'e'),
+    (0x2131, 'M', u'f'),
+    (0x2132, 'X'),
+    (0x2133, 'M', u'm'),
+    (0x2134, 'M', u'o'),
+    (0x2135, 'M', u'א'),
+    (0x2136, 'M', u'ב'),
+    (0x2137, 'M', u'ג'),
+    (0x2138, 'M', u'ד'),
+    (0x2139, 'M', u'i'),
+    (0x213A, 'V'),
+    (0x213B, 'M', u'fax'),
+    (0x213C, 'M', u'π'),
+    (0x213D, 'M', u'γ'),
+    (0x213F, 'M', u'π'),
+    (0x2140, 'M', u'∑'),
+    (0x2141, 'V'),
+    (0x2145, 'M', u'd'),
+    (0x2147, 'M', u'e'),
+    (0x2148, 'M', u'i'),
+    (0x2149, 'M', u'j'),
+    (0x214A, 'V'),
+    (0x2150, 'M', u'1⁄7'),
+    (0x2151, 'M', u'1⁄9'),
+    (0x2152, 'M', u'1⁄10'),
+    (0x2153, 'M', u'1⁄3'),
+    (0x2154, 'M', u'2⁄3'),
+    (0x2155, 'M', u'1⁄5'),
+    (0x2156, 'M', u'2⁄5'),
+    (0x2157, 'M', u'3⁄5'),
+    (0x2158, 'M', u'4⁄5'),
+    (0x2159, 'M', u'1⁄6'),
+    (0x215A, 'M', u'5⁄6'),
+    (0x215B, 'M', u'1⁄8'),
+    (0x215C, 'M', u'3⁄8'),
+    (0x215D, 'M', u'5⁄8'),
+    (0x215E, 'M', u'7⁄8'),
+    (0x215F, 'M', u'1⁄'),
+    (0x2160, 'M', u'i'),
+    (0x2161, 'M', u'ii'),
+    (0x2162, 'M', u'iii'),
+    (0x2163, 'M', u'iv'),
+    (0x2164, 'M', u'v'),
+    (0x2165, 'M', u'vi'),
+    (0x2166, 'M', u'vii'),
+    (0x2167, 'M', u'viii'),
+    (0x2168, 'M', u'ix'),
+    (0x2169, 'M', u'x'),
+    (0x216A, 'M', u'xi'),
+    (0x216B, 'M', u'xii'),
+    (0x216C, 'M', u'l'),
+    (0x216D, 'M', u'c'),
+    (0x216E, 'M', u'd'),
+    (0x216F, 'M', u'm'),
+    (0x2170, 'M', u'i'),
+    (0x2171, 'M', u'ii'),
+    (0x2172, 'M', u'iii'),
+    (0x2173, 'M', u'iv'),
+    (0x2174, 'M', u'v'),
+    (0x2175, 'M', u'vi'),
+    (0x2176, 'M', u'vii'),
+    (0x2177, 'M', u'viii'),
+    (0x2178, 'M', u'ix'),
+    (0x2179, 'M', u'x'),
+    ]
+
+def _seg_23():
+    return [
+    (0x217A, 'M', u'xi'),
+    (0x217B, 'M', u'xii'),
+    (0x217C, 'M', u'l'),
+    (0x217D, 'M', u'c'),
+    (0x217E, 'M', u'd'),
+    (0x217F, 'M', u'm'),
+    (0x2180, 'V'),
+    (0x2183, 'X'),
+    (0x2184, 'V'),
+    (0x2189, 'M', u'0⁄3'),
+    (0x218A, 'V'),
+    (0x218C, 'X'),
+    (0x2190, 'V'),
+    (0x222C, 'M', u'∫∫'),
+    (0x222D, 'M', u'∫∫∫'),
+    (0x222E, 'V'),
+    (0x222F, 'M', u'∮∮'),
+    (0x2230, 'M', u'∮∮∮'),
+    (0x2231, 'V'),
+    (0x2260, '3'),
+    (0x2261, 'V'),
+    (0x226E, '3'),
+    (0x2270, 'V'),
+    (0x2329, 'M', u'〈'),
+    (0x232A, 'M', u'〉'),
+    (0x232B, 'V'),
+    (0x2427, 'X'),
+    (0x2440, 'V'),
+    (0x244B, 'X'),
+    (0x2460, 'M', u'1'),
+    (0x2461, 'M', u'2'),
+    (0x2462, 'M', u'3'),
+    (0x2463, 'M', u'4'),
+    (0x2464, 'M', u'5'),
+    (0x2465, 'M', u'6'),
+    (0x2466, 'M', u'7'),
+    (0x2467, 'M', u'8'),
+    (0x2468, 'M', u'9'),
+    (0x2469, 'M', u'10'),
+    (0x246A, 'M', u'11'),
+    (0x246B, 'M', u'12'),
+    (0x246C, 'M', u'13'),
+    (0x246D, 'M', u'14'),
+    (0x246E, 'M', u'15'),
+    (0x246F, 'M', u'16'),
+    (0x2470, 'M', u'17'),
+    (0x2471, 'M', u'18'),
+    (0x2472, 'M', u'19'),
+    (0x2473, 'M', u'20'),
+    (0x2474, '3', u'(1)'),
+    (0x2475, '3', u'(2)'),
+    (0x2476, '3', u'(3)'),
+    (0x2477, '3', u'(4)'),
+    (0x2478, '3', u'(5)'),
+    (0x2479, '3', u'(6)'),
+    (0x247A, '3', u'(7)'),
+    (0x247B, '3', u'(8)'),
+    (0x247C, '3', u'(9)'),
+    (0x247D, '3', u'(10)'),
+    (0x247E, '3', u'(11)'),
+    (0x247F, '3', u'(12)'),
+    (0x2480, '3', u'(13)'),
+    (0x2481, '3', u'(14)'),
+    (0x2482, '3', u'(15)'),
+    (0x2483, '3', u'(16)'),
+    (0x2484, '3', u'(17)'),
+    (0x2485, '3', u'(18)'),
+    (0x2486, '3', u'(19)'),
+    (0x2487, '3', u'(20)'),
+    (0x2488, 'X'),
+    (0x249C, '3', u'(a)'),
+    (0x249D, '3', u'(b)'),
+    (0x249E, '3', u'(c)'),
+    (0x249F, '3', u'(d)'),
+    (0x24A0, '3', u'(e)'),
+    (0x24A1, '3', u'(f)'),
+    (0x24A2, '3', u'(g)'),
+    (0x24A3, '3', u'(h)'),
+    (0x24A4, '3', u'(i)'),
+    (0x24A5, '3', u'(j)'),
+    (0x24A6, '3', u'(k)'),
+    (0x24A7, '3', u'(l)'),
+    (0x24A8, '3', u'(m)'),
+    (0x24A9, '3', u'(n)'),
+    (0x24AA, '3', u'(o)'),
+    (0x24AB, '3', u'(p)'),
+    (0x24AC, '3', u'(q)'),
+    (0x24AD, '3', u'(r)'),
+    (0x24AE, '3', u'(s)'),
+    (0x24AF, '3', u'(t)'),
+    (0x24B0, '3', u'(u)'),
+    (0x24B1, '3', u'(v)'),
+    (0x24B2, '3', u'(w)'),
+    (0x24B3, '3', u'(x)'),
+    (0x24B4, '3', u'(y)'),
+    (0x24B5, '3', u'(z)'),
+    (0x24B6, 'M', u'a'),
+    (0x24B7, 'M', u'b'),
+    (0x24B8, 'M', u'c'),
+    (0x24B9, 'M', u'd'),
+    ]
+
+def _seg_24():
+    return [
+    (0x24BA, 'M', u'e'),
+    (0x24BB, 'M', u'f'),
+    (0x24BC, 'M', u'g'),
+    (0x24BD, 'M', u'h'),
+    (0x24BE, 'M', u'i'),
+    (0x24BF, 'M', u'j'),
+    (0x24C0, 'M', u'k'),
+    (0x24C1, 'M', u'l'),
+    (0x24C2, 'M', u'm'),
+    (0x24C3, 'M', u'n'),
+    (0x24C4, 'M', u'o'),
+    (0x24C5, 'M', u'p'),
+    (0x24C6, 'M', u'q'),
+    (0x24C7, 'M', u'r'),
+    (0x24C8, 'M', u's'),
+    (0x24C9, 'M', u't'),
+    (0x24CA, 'M', u'u'),
+    (0x24CB, 'M', u'v'),
+    (0x24CC, 'M', u'w'),
+    (0x24CD, 'M', u'x'),
+    (0x24CE, 'M', u'y'),
+    (0x24CF, 'M', u'z'),
+    (0x24D0, 'M', u'a'),
+    (0x24D1, 'M', u'b'),
+    (0x24D2, 'M', u'c'),
+    (0x24D3, 'M', u'd'),
+    (0x24D4, 'M', u'e'),
+    (0x24D5, 'M', u'f'),
+    (0x24D6, 'M', u'g'),
+    (0x24D7, 'M', u'h'),
+    (0x24D8, 'M', u'i'),
+    (0x24D9, 'M', u'j'),
+    (0x24DA, 'M', u'k'),
+    (0x24DB, 'M', u'l'),
+    (0x24DC, 'M', u'm'),
+    (0x24DD, 'M', u'n'),
+    (0x24DE, 'M', u'o'),
+    (0x24DF, 'M', u'p'),
+    (0x24E0, 'M', u'q'),
+    (0x24E1, 'M', u'r'),
+    (0x24E2, 'M', u's'),
+    (0x24E3, 'M', u't'),
+    (0x24E4, 'M', u'u'),
+    (0x24E5, 'M', u'v'),
+    (0x24E6, 'M', u'w'),
+    (0x24E7, 'M', u'x'),
+    (0x24E8, 'M', u'y'),
+    (0x24E9, 'M', u'z'),
+    (0x24EA, 'M', u'0'),
+    (0x24EB, 'V'),
+    (0x2A0C, 'M', u'∫∫∫∫'),
+    (0x2A0D, 'V'),
+    (0x2A74, '3', u'::='),
+    (0x2A75, '3', u'=='),
+    (0x2A76, '3', u'==='),
+    (0x2A77, 'V'),
+    (0x2ADC, 'M', u'⫝̸'),
+    (0x2ADD, 'V'),
+    (0x2B74, 'X'),
+    (0x2B76, 'V'),
+    (0x2B96, 'X'),
+    (0x2B97, 'V'),
+    (0x2C00, 'M', u'ⰰ'),
+    (0x2C01, 'M', u'ⰱ'),
+    (0x2C02, 'M', u'ⰲ'),
+    (0x2C03, 'M', u'ⰳ'),
+    (0x2C04, 'M', u'ⰴ'),
+    (0x2C05, 'M', u'ⰵ'),
+    (0x2C06, 'M', u'ⰶ'),
+    (0x2C07, 'M', u'ⰷ'),
+    (0x2C08, 'M', u'ⰸ'),
+    (0x2C09, 'M', u'ⰹ'),
+    (0x2C0A, 'M', u'ⰺ'),
+    (0x2C0B, 'M', u'ⰻ'),
+    (0x2C0C, 'M', u'ⰼ'),
+    (0x2C0D, 'M', u'ⰽ'),
+    (0x2C0E, 'M', u'ⰾ'),
+    (0x2C0F, 'M', u'ⰿ'),
+    (0x2C10, 'M', u'ⱀ'),
+    (0x2C11, 'M', u'ⱁ'),
+    (0x2C12, 'M', u'ⱂ'),
+    (0x2C13, 'M', u'ⱃ'),
+    (0x2C14, 'M', u'ⱄ'),
+    (0x2C15, 'M', u'ⱅ'),
+    (0x2C16, 'M', u'ⱆ'),
+    (0x2C17, 'M', u'ⱇ'),
+    (0x2C18, 'M', u'ⱈ'),
+    (0x2C19, 'M', u'ⱉ'),
+    (0x2C1A, 'M', u'ⱊ'),
+    (0x2C1B, 'M', u'ⱋ'),
+    (0x2C1C, 'M', u'ⱌ'),
+    (0x2C1D, 'M', u'ⱍ'),
+    (0x2C1E, 'M', u'ⱎ'),
+    (0x2C1F, 'M', u'ⱏ'),
+    (0x2C20, 'M', u'ⱐ'),
+    (0x2C21, 'M', u'ⱑ'),
+    (0x2C22, 'M', u'ⱒ'),
+    (0x2C23, 'M', u'ⱓ'),
+    (0x2C24, 'M', u'ⱔ'),
+    (0x2C25, 'M', u'ⱕ'),
+    ]
+
+def _seg_25():
+    return [
+    (0x2C26, 'M', u'ⱖ'),
+    (0x2C27, 'M', u'ⱗ'),
+    (0x2C28, 'M', u'ⱘ'),
+    (0x2C29, 'M', u'ⱙ'),
+    (0x2C2A, 'M', u'ⱚ'),
+    (0x2C2B, 'M', u'ⱛ'),
+    (0x2C2C, 'M', u'ⱜ'),
+    (0x2C2D, 'M', u'ⱝ'),
+    (0x2C2E, 'M', u'ⱞ'),
+    (0x2C2F, 'X'),
+    (0x2C30, 'V'),
+    (0x2C5F, 'X'),
+    (0x2C60, 'M', u'ⱡ'),
+    (0x2C61, 'V'),
+    (0x2C62, 'M', u'ɫ'),
+    (0x2C63, 'M', u'ᵽ'),
+    (0x2C64, 'M', u'ɽ'),
+    (0x2C65, 'V'),
+    (0x2C67, 'M', u'ⱨ'),
+    (0x2C68, 'V'),
+    (0x2C69, 'M', u'ⱪ'),
+    (0x2C6A, 'V'),
+    (0x2C6B, 'M', u'ⱬ'),
+    (0x2C6C, 'V'),
+    (0x2C6D, 'M', u'ɑ'),
+    (0x2C6E, 'M', u'ɱ'),
+    (0x2C6F, 'M', u'ɐ'),
+    (0x2C70, 'M', u'ɒ'),
+    (0x2C71, 'V'),
+    (0x2C72, 'M', u'ⱳ'),
+    (0x2C73, 'V'),
+    (0x2C75, 'M', u'ⱶ'),
+    (0x2C76, 'V'),
+    (0x2C7C, 'M', u'j'),
+    (0x2C7D, 'M', u'v'),
+    (0x2C7E, 'M', u'ȿ'),
+    (0x2C7F, 'M', u'ɀ'),
+    (0x2C80, 'M', u'ⲁ'),
+    (0x2C81, 'V'),
+    (0x2C82, 'M', u'ⲃ'),
+    (0x2C83, 'V'),
+    (0x2C84, 'M', u'ⲅ'),
+    (0x2C85, 'V'),
+    (0x2C86, 'M', u'ⲇ'),
+    (0x2C87, 'V'),
+    (0x2C88, 'M', u'ⲉ'),
+    (0x2C89, 'V'),
+    (0x2C8A, 'M', u'ⲋ'),
+    (0x2C8B, 'V'),
+    (0x2C8C, 'M', u'ⲍ'),
+    (0x2C8D, 'V'),
+    (0x2C8E, 'M', u'ⲏ'),
+    (0x2C8F, 'V'),
+    (0x2C90, 'M', u'ⲑ'),
+    (0x2C91, 'V'),
+    (0x2C92, 'M', u'ⲓ'),
+    (0x2C93, 'V'),
+    (0x2C94, 'M', u'ⲕ'),
+    (0x2C95, 'V'),
+    (0x2C96, 'M', u'ⲗ'),
+    (0x2C97, 'V'),
+    (0x2C98, 'M', u'ⲙ'),
+    (0x2C99, 'V'),
+    (0x2C9A, 'M', u'ⲛ'),
+    (0x2C9B, 'V'),
+    (0x2C9C, 'M', u'ⲝ'),
+    (0x2C9D, 'V'),
+    (0x2C9E, 'M', u'ⲟ'),
+    (0x2C9F, 'V'),
+    (0x2CA0, 'M', u'ⲡ'),
+    (0x2CA1, 'V'),
+    (0x2CA2, 'M', u'ⲣ'),
+    (0x2CA3, 'V'),
+    (0x2CA4, 'M', u'ⲥ'),
+    (0x2CA5, 'V'),
+    (0x2CA6, 'M', u'ⲧ'),
+    (0x2CA7, 'V'),
+    (0x2CA8, 'M', u'ⲩ'),
+    (0x2CA9, 'V'),
+    (0x2CAA, 'M', u'ⲫ'),
+    (0x2CAB, 'V'),
+    (0x2CAC, 'M', u'ⲭ'),
+    (0x2CAD, 'V'),
+    (0x2CAE, 'M', u'ⲯ'),
+    (0x2CAF, 'V'),
+    (0x2CB0, 'M', u'ⲱ'),
+    (0x2CB1, 'V'),
+    (0x2CB2, 'M', u'ⲳ'),
+    (0x2CB3, 'V'),
+    (0x2CB4, 'M', u'ⲵ'),
+    (0x2CB5, 'V'),
+    (0x2CB6, 'M', u'ⲷ'),
+    (0x2CB7, 'V'),
+    (0x2CB8, 'M', u'ⲹ'),
+    (0x2CB9, 'V'),
+    (0x2CBA, 'M', u'ⲻ'),
+    (0x2CBB, 'V'),
+    (0x2CBC, 'M', u'ⲽ'),
+    (0x2CBD, 'V'),
+    (0x2CBE, 'M', u'ⲿ'),
+    ]
+
+def _seg_26():
+    return [
+    (0x2CBF, 'V'),
+    (0x2CC0, 'M', u'ⳁ'),
+    (0x2CC1, 'V'),
+    (0x2CC2, 'M', u'ⳃ'),
+    (0x2CC3, 'V'),
+    (0x2CC4, 'M', u'ⳅ'),
+    (0x2CC5, 'V'),
+    (0x2CC6, 'M', u'ⳇ'),
+    (0x2CC7, 'V'),
+    (0x2CC8, 'M', u'ⳉ'),
+    (0x2CC9, 'V'),
+    (0x2CCA, 'M', u'ⳋ'),
+    (0x2CCB, 'V'),
+    (0x2CCC, 'M', u'ⳍ'),
+    (0x2CCD, 'V'),
+    (0x2CCE, 'M', u'ⳏ'),
+    (0x2CCF, 'V'),
+    (0x2CD0, 'M', u'ⳑ'),
+    (0x2CD1, 'V'),
+    (0x2CD2, 'M', u'ⳓ'),
+    (0x2CD3, 'V'),
+    (0x2CD4, 'M', u'ⳕ'),
+    (0x2CD5, 'V'),
+    (0x2CD6, 'M', u'ⳗ'),
+    (0x2CD7, 'V'),
+    (0x2CD8, 'M', u'ⳙ'),
+    (0x2CD9, 'V'),
+    (0x2CDA, 'M', u'ⳛ'),
+    (0x2CDB, 'V'),
+    (0x2CDC, 'M', u'ⳝ'),
+    (0x2CDD, 'V'),
+    (0x2CDE, 'M', u'ⳟ'),
+    (0x2CDF, 'V'),
+    (0x2CE0, 'M', u'ⳡ'),
+    (0x2CE1, 'V'),
+    (0x2CE2, 'M', u'ⳣ'),
+    (0x2CE3, 'V'),
+    (0x2CEB, 'M', u'ⳬ'),
+    (0x2CEC, 'V'),
+    (0x2CED, 'M', u'ⳮ'),
+    (0x2CEE, 'V'),
+    (0x2CF2, 'M', u'ⳳ'),
+    (0x2CF3, 'V'),
+    (0x2CF4, 'X'),
+    (0x2CF9, 'V'),
+    (0x2D26, 'X'),
+    (0x2D27, 'V'),
+    (0x2D28, 'X'),
+    (0x2D2D, 'V'),
+    (0x2D2E, 'X'),
+    (0x2D30, 'V'),
+    (0x2D68, 'X'),
+    (0x2D6F, 'M', u'ⵡ'),
+    (0x2D70, 'V'),
+    (0x2D71, 'X'),
+    (0x2D7F, 'V'),
+    (0x2D97, 'X'),
+    (0x2DA0, 'V'),
+    (0x2DA7, 'X'),
+    (0x2DA8, 'V'),
+    (0x2DAF, 'X'),
+    (0x2DB0, 'V'),
+    (0x2DB7, 'X'),
+    (0x2DB8, 'V'),
+    (0x2DBF, 'X'),
+    (0x2DC0, 'V'),
+    (0x2DC7, 'X'),
+    (0x2DC8, 'V'),
+    (0x2DCF, 'X'),
+    (0x2DD0, 'V'),
+    (0x2DD7, 'X'),
+    (0x2DD8, 'V'),
+    (0x2DDF, 'X'),
+    (0x2DE0, 'V'),
+    (0x2E53, 'X'),
+    (0x2E80, 'V'),
+    (0x2E9A, 'X'),
+    (0x2E9B, 'V'),
+    (0x2E9F, 'M', u'母'),
+    (0x2EA0, 'V'),
+    (0x2EF3, 'M', u'龟'),
+    (0x2EF4, 'X'),
+    (0x2F00, 'M', u'一'),
+    (0x2F01, 'M', u'丨'),
+    (0x2F02, 'M', u'丶'),
+    (0x2F03, 'M', u'丿'),
+    (0x2F04, 'M', u'乙'),
+    (0x2F05, 'M', u'亅'),
+    (0x2F06, 'M', u'二'),
+    (0x2F07, 'M', u'亠'),
+    (0x2F08, 'M', u'人'),
+    (0x2F09, 'M', u'儿'),
+    (0x2F0A, 'M', u'入'),
+    (0x2F0B, 'M', u'八'),
+    (0x2F0C, 'M', u'冂'),
+    (0x2F0D, 'M', u'冖'),
+    (0x2F0E, 'M', u'冫'),
+    (0x2F0F, 'M', u'几'),
+    (0x2F10, 'M', u'凵'),
+    (0x2F11, 'M', u'刀'),
+    ]
+
+def _seg_27():
+    return [
+    (0x2F12, 'M', u'力'),
+    (0x2F13, 'M', u'勹'),
+    (0x2F14, 'M', u'匕'),
+    (0x2F15, 'M', u'匚'),
+    (0x2F16, 'M', u'匸'),
+    (0x2F17, 'M', u'十'),
+    (0x2F18, 'M', u'卜'),
+    (0x2F19, 'M', u'卩'),
+    (0x2F1A, 'M', u'厂'),
+    (0x2F1B, 'M', u'厶'),
+    (0x2F1C, 'M', u'又'),
+    (0x2F1D, 'M', u'口'),
+    (0x2F1E, 'M', u'囗'),
+    (0x2F1F, 'M', u'土'),
+    (0x2F20, 'M', u'士'),
+    (0x2F21, 'M', u'夂'),
+    (0x2F22, 'M', u'夊'),
+    (0x2F23, 'M', u'夕'),
+    (0x2F24, 'M', u'大'),
+    (0x2F25, 'M', u'女'),
+    (0x2F26, 'M', u'子'),
+    (0x2F27, 'M', u'宀'),
+    (0x2F28, 'M', u'寸'),
+    (0x2F29, 'M', u'小'),
+    (0x2F2A, 'M', u'尢'),
+    (0x2F2B, 'M', u'尸'),
+    (0x2F2C, 'M', u'屮'),
+    (0x2F2D, 'M', u'山'),
+    (0x2F2E, 'M', u'巛'),
+    (0x2F2F, 'M', u'工'),
+    (0x2F30, 'M', u'己'),
+    (0x2F31, 'M', u'巾'),
+    (0x2F32, 'M', u'干'),
+    (0x2F33, 'M', u'幺'),
+    (0x2F34, 'M', u'广'),
+    (0x2F35, 'M', u'廴'),
+    (0x2F36, 'M', u'廾'),
+    (0x2F37, 'M', u'弋'),
+    (0x2F38, 'M', u'弓'),
+    (0x2F39, 'M', u'彐'),
+    (0x2F3A, 'M', u'彡'),
+    (0x2F3B, 'M', u'彳'),
+    (0x2F3C, 'M', u'心'),
+    (0x2F3D, 'M', u'戈'),
+    (0x2F3E, 'M', u'戶'),
+    (0x2F3F, 'M', u'手'),
+    (0x2F40, 'M', u'支'),
+    (0x2F41, 'M', u'攴'),
+    (0x2F42, 'M', u'文'),
+    (0x2F43, 'M', u'斗'),
+    (0x2F44, 'M', u'斤'),
+    (0x2F45, 'M', u'方'),
+    (0x2F46, 'M', u'无'),
+    (0x2F47, 'M', u'日'),
+    (0x2F48, 'M', u'曰'),
+    (0x2F49, 'M', u'月'),
+    (0x2F4A, 'M', u'木'),
+    (0x2F4B, 'M', u'欠'),
+    (0x2F4C, 'M', u'止'),
+    (0x2F4D, 'M', u'歹'),
+    (0x2F4E, 'M', u'殳'),
+    (0x2F4F, 'M', u'毋'),
+    (0x2F50, 'M', u'比'),
+    (0x2F51, 'M', u'毛'),
+    (0x2F52, 'M', u'氏'),
+    (0x2F53, 'M', u'气'),
+    (0x2F54, 'M', u'水'),
+    (0x2F55, 'M', u'火'),
+    (0x2F56, 'M', u'爪'),
+    (0x2F57, 'M', u'父'),
+    (0x2F58, 'M', u'爻'),
+    (0x2F59, 'M', u'爿'),
+    (0x2F5A, 'M', u'片'),
+    (0x2F5B, 'M', u'牙'),
+    (0x2F5C, 'M', u'牛'),
+    (0x2F5D, 'M', u'犬'),
+    (0x2F5E, 'M', u'玄'),
+    (0x2F5F, 'M', u'玉'),
+    (0x2F60, 'M', u'瓜'),
+    (0x2F61, 'M', u'瓦'),
+    (0x2F62, 'M', u'甘'),
+    (0x2F63, 'M', u'生'),
+    (0x2F64, 'M', u'用'),
+    (0x2F65, 'M', u'田'),
+    (0x2F66, 'M', u'疋'),
+    (0x2F67, 'M', u'疒'),
+    (0x2F68, 'M', u'癶'),
+    (0x2F69, 'M', u'白'),
+    (0x2F6A, 'M', u'皮'),
+    (0x2F6B, 'M', u'皿'),
+    (0x2F6C, 'M', u'目'),
+    (0x2F6D, 'M', u'矛'),
+    (0x2F6E, 'M', u'矢'),
+    (0x2F6F, 'M', u'石'),
+    (0x2F70, 'M', u'示'),
+    (0x2F71, 'M', u'禸'),
+    (0x2F72, 'M', u'禾'),
+    (0x2F73, 'M', u'穴'),
+    (0x2F74, 'M', u'立'),
+    (0x2F75, 'M', u'竹'),
+    ]
+
+def _seg_28():
+    return [
+    (0x2F76, 'M', u'米'),
+    (0x2F77, 'M', u'糸'),
+    (0x2F78, 'M', u'缶'),
+    (0x2F79, 'M', u'网'),
+    (0x2F7A, 'M', u'羊'),
+    (0x2F7B, 'M', u'羽'),
+    (0x2F7C, 'M', u'老'),
+    (0x2F7D, 'M', u'而'),
+    (0x2F7E, 'M', u'耒'),
+    (0x2F7F, 'M', u'耳'),
+    (0x2F80, 'M', u'聿'),
+    (0x2F81, 'M', u'肉'),
+    (0x2F82, 'M', u'臣'),
+    (0x2F83, 'M', u'自'),
+    (0x2F84, 'M', u'至'),
+    (0x2F85, 'M', u'臼'),
+    (0x2F86, 'M', u'舌'),
+    (0x2F87, 'M', u'舛'),
+    (0x2F88, 'M', u'舟'),
+    (0x2F89, 'M', u'艮'),
+    (0x2F8A, 'M', u'色'),
+    (0x2F8B, 'M', u'艸'),
+    (0x2F8C, 'M', u'虍'),
+    (0x2F8D, 'M', u'虫'),
+    (0x2F8E, 'M', u'血'),
+    (0x2F8F, 'M', u'行'),
+    (0x2F90, 'M', u'衣'),
+    (0x2F91, 'M', u'襾'),
+    (0x2F92, 'M', u'見'),
+    (0x2F93, 'M', u'角'),
+    (0x2F94, 'M', u'言'),
+    (0x2F95, 'M', u'谷'),
+    (0x2F96, 'M', u'豆'),
+    (0x2F97, 'M', u'豕'),
+    (0x2F98, 'M', u'豸'),
+    (0x2F99, 'M', u'貝'),
+    (0x2F9A, 'M', u'赤'),
+    (0x2F9B, 'M', u'走'),
+    (0x2F9C, 'M', u'足'),
+    (0x2F9D, 'M', u'身'),
+    (0x2F9E, 'M', u'車'),
+    (0x2F9F, 'M', u'辛'),
+    (0x2FA0, 'M', u'辰'),
+    (0x2FA1, 'M', u'辵'),
+    (0x2FA2, 'M', u'邑'),
+    (0x2FA3, 'M', u'酉'),
+    (0x2FA4, 'M', u'釆'),
+    (0x2FA5, 'M', u'里'),
+    (0x2FA6, 'M', u'金'),
+    (0x2FA7, 'M', u'長'),
+    (0x2FA8, 'M', u'門'),
+    (0x2FA9, 'M', u'阜'),
+    (0x2FAA, 'M', u'隶'),
+    (0x2FAB, 'M', u'隹'),
+    (0x2FAC, 'M', u'雨'),
+    (0x2FAD, 'M', u'靑'),
+    (0x2FAE, 'M', u'非'),
+    (0x2FAF, 'M', u'面'),
+    (0x2FB0, 'M', u'革'),
+    (0x2FB1, 'M', u'韋'),
+    (0x2FB2, 'M', u'韭'),
+    (0x2FB3, 'M', u'音'),
+    (0x2FB4, 'M', u'頁'),
+    (0x2FB5, 'M', u'風'),
+    (0x2FB6, 'M', u'飛'),
+    (0x2FB7, 'M', u'食'),
+    (0x2FB8, 'M', u'首'),
+    (0x2FB9, 'M', u'香'),
+    (0x2FBA, 'M', u'馬'),
+    (0x2FBB, 'M', u'骨'),
+    (0x2FBC, 'M', u'高'),
+    (0x2FBD, 'M', u'髟'),
+    (0x2FBE, 'M', u'鬥'),
+    (0x2FBF, 'M', u'鬯'),
+    (0x2FC0, 'M', u'鬲'),
+    (0x2FC1, 'M', u'鬼'),
+    (0x2FC2, 'M', u'魚'),
+    (0x2FC3, 'M', u'鳥'),
+    (0x2FC4, 'M', u'鹵'),
+    (0x2FC5, 'M', u'鹿'),
+    (0x2FC6, 'M', u'麥'),
+    (0x2FC7, 'M', u'麻'),
+    (0x2FC8, 'M', u'黃'),
+    (0x2FC9, 'M', u'黍'),
+    (0x2FCA, 'M', u'黑'),
+    (0x2FCB, 'M', u'黹'),
+    (0x2FCC, 'M', u'黽'),
+    (0x2FCD, 'M', u'鼎'),
+    (0x2FCE, 'M', u'鼓'),
+    (0x2FCF, 'M', u'鼠'),
+    (0x2FD0, 'M', u'鼻'),
+    (0x2FD1, 'M', u'齊'),
+    (0x2FD2, 'M', u'齒'),
+    (0x2FD3, 'M', u'龍'),
+    (0x2FD4, 'M', u'龜'),
+    (0x2FD5, 'M', u'龠'),
+    (0x2FD6, 'X'),
+    (0x3000, '3', u' '),
+    (0x3001, 'V'),
+    (0x3002, 'M', u'.'),
+    ]
+
+def _seg_29():
+    return [
+    (0x3003, 'V'),
+    (0x3036, 'M', u'〒'),
+    (0x3037, 'V'),
+    (0x3038, 'M', u'十'),
+    (0x3039, 'M', u'卄'),
+    (0x303A, 'M', u'卅'),
+    (0x303B, 'V'),
+    (0x3040, 'X'),
+    (0x3041, 'V'),
+    (0x3097, 'X'),
+    (0x3099, 'V'),
+    (0x309B, '3', u' ゙'),
+    (0x309C, '3', u' ゚'),
+    (0x309D, 'V'),
+    (0x309F, 'M', u'より'),
+    (0x30A0, 'V'),
+    (0x30FF, 'M', u'コト'),
+    (0x3100, 'X'),
+    (0x3105, 'V'),
+    (0x3130, 'X'),
+    (0x3131, 'M', u'ᄀ'),
+    (0x3132, 'M', u'ᄁ'),
+    (0x3133, 'M', u'ᆪ'),
+    (0x3134, 'M', u'ᄂ'),
+    (0x3135, 'M', u'ᆬ'),
+    (0x3136, 'M', u'ᆭ'),
+    (0x3137, 'M', u'ᄃ'),
+    (0x3138, 'M', u'ᄄ'),
+    (0x3139, 'M', u'ᄅ'),
+    (0x313A, 'M', u'ᆰ'),
+    (0x313B, 'M', u'ᆱ'),
+    (0x313C, 'M', u'ᆲ'),
+    (0x313D, 'M', u'ᆳ'),
+    (0x313E, 'M', u'ᆴ'),
+    (0x313F, 'M', u'ᆵ'),
+    (0x3140, 'M', u'ᄚ'),
+    (0x3141, 'M', u'ᄆ'),
+    (0x3142, 'M', u'ᄇ'),
+    (0x3143, 'M', u'ᄈ'),
+    (0x3144, 'M', u'ᄡ'),
+    (0x3145, 'M', u'ᄉ'),
+    (0x3146, 'M', u'ᄊ'),
+    (0x3147, 'M', u'ᄋ'),
+    (0x3148, 'M', u'ᄌ'),
+    (0x3149, 'M', u'ᄍ'),
+    (0x314A, 'M', u'ᄎ'),
+    (0x314B, 'M', u'ᄏ'),
+    (0x314C, 'M', u'ᄐ'),
+    (0x314D, 'M', u'ᄑ'),
+    (0x314E, 'M', u'ᄒ'),
+    (0x314F, 'M', u'ᅡ'),
+    (0x3150, 'M', u'ᅢ'),
+    (0x3151, 'M', u'ᅣ'),
+    (0x3152, 'M', u'ᅤ'),
+    (0x3153, 'M', u'ᅥ'),
+    (0x3154, 'M', u'ᅦ'),
+    (0x3155, 'M', u'ᅧ'),
+    (0x3156, 'M', u'ᅨ'),
+    (0x3157, 'M', u'ᅩ'),
+    (0x3158, 'M', u'ᅪ'),
+    (0x3159, 'M', u'ᅫ'),
+    (0x315A, 'M', u'ᅬ'),
+    (0x315B, 'M', u'ᅭ'),
+    (0x315C, 'M', u'ᅮ'),
+    (0x315D, 'M', u'ᅯ'),
+    (0x315E, 'M', u'ᅰ'),
+    (0x315F, 'M', u'ᅱ'),
+    (0x3160, 'M', u'ᅲ'),
+    (0x3161, 'M', u'ᅳ'),
+    (0x3162, 'M', u'ᅴ'),
+    (0x3163, 'M', u'ᅵ'),
+    (0x3164, 'X'),
+    (0x3165, 'M', u'ᄔ'),
+    (0x3166, 'M', u'ᄕ'),
+    (0x3167, 'M', u'ᇇ'),
+    (0x3168, 'M', u'ᇈ'),
+    (0x3169, 'M', u'ᇌ'),
+    (0x316A, 'M', u'ᇎ'),
+    (0x316B, 'M', u'ᇓ'),
+    (0x316C, 'M', u'ᇗ'),
+    (0x316D, 'M', u'ᇙ'),
+    (0x316E, 'M', u'ᄜ'),
+    (0x316F, 'M', u'ᇝ'),
+    (0x3170, 'M', u'ᇟ'),
+    (0x3171, 'M', u'ᄝ'),
+    (0x3172, 'M', u'ᄞ'),
+    (0x3173, 'M', u'ᄠ'),
+    (0x3174, 'M', u'ᄢ'),
+    (0x3175, 'M', u'ᄣ'),
+    (0x3176, 'M', u'ᄧ'),
+    (0x3177, 'M', u'ᄩ'),
+    (0x3178, 'M', u'ᄫ'),
+    (0x3179, 'M', u'ᄬ'),
+    (0x317A, 'M', u'ᄭ'),
+    (0x317B, 'M', u'ᄮ'),
+    (0x317C, 'M', u'ᄯ'),
+    (0x317D, 'M', u'ᄲ'),
+    (0x317E, 'M', u'ᄶ'),
+    (0x317F, 'M', u'ᅀ'),
+    (0x3180, 'M', u'ᅇ'),
+    ]
+
+def _seg_30():
+    return [
+    (0x3181, 'M', u'ᅌ'),
+    (0x3182, 'M', u'ᇱ'),
+    (0x3183, 'M', u'ᇲ'),
+    (0x3184, 'M', u'ᅗ'),
+    (0x3185, 'M', u'ᅘ'),
+    (0x3186, 'M', u'ᅙ'),
+    (0x3187, 'M', u'ᆄ'),
+    (0x3188, 'M', u'ᆅ'),
+    (0x3189, 'M', u'ᆈ'),
+    (0x318A, 'M', u'ᆑ'),
+    (0x318B, 'M', u'ᆒ'),
+    (0x318C, 'M', u'ᆔ'),
+    (0x318D, 'M', u'ᆞ'),
+    (0x318E, 'M', u'ᆡ'),
+    (0x318F, 'X'),
+    (0x3190, 'V'),
+    (0x3192, 'M', u'一'),
+    (0x3193, 'M', u'二'),
+    (0x3194, 'M', u'三'),
+    (0x3195, 'M', u'四'),
+    (0x3196, 'M', u'上'),
+    (0x3197, 'M', u'中'),
+    (0x3198, 'M', u'下'),
+    (0x3199, 'M', u'甲'),
+    (0x319A, 'M', u'乙'),
+    (0x319B, 'M', u'丙'),
+    (0x319C, 'M', u'丁'),
+    (0x319D, 'M', u'天'),
+    (0x319E, 'M', u'地'),
+    (0x319F, 'M', u'人'),
+    (0x31A0, 'V'),
+    (0x31E4, 'X'),
+    (0x31F0, 'V'),
+    (0x3200, '3', u'(ᄀ)'),
+    (0x3201, '3', u'(ᄂ)'),
+    (0x3202, '3', u'(ᄃ)'),
+    (0x3203, '3', u'(ᄅ)'),
+    (0x3204, '3', u'(ᄆ)'),
+    (0x3205, '3', u'(ᄇ)'),
+    (0x3206, '3', u'(ᄉ)'),
+    (0x3207, '3', u'(ᄋ)'),
+    (0x3208, '3', u'(ᄌ)'),
+    (0x3209, '3', u'(ᄎ)'),
+    (0x320A, '3', u'(ᄏ)'),
+    (0x320B, '3', u'(ᄐ)'),
+    (0x320C, '3', u'(ᄑ)'),
+    (0x320D, '3', u'(ᄒ)'),
+    (0x320E, '3', u'(가)'),
+    (0x320F, '3', u'(나)'),
+    (0x3210, '3', u'(다)'),
+    (0x3211, '3', u'(라)'),
+    (0x3212, '3', u'(마)'),
+    (0x3213, '3', u'(바)'),
+    (0x3214, '3', u'(사)'),
+    (0x3215, '3', u'(아)'),
+    (0x3216, '3', u'(자)'),
+    (0x3217, '3', u'(차)'),
+    (0x3218, '3', u'(카)'),
+    (0x3219, '3', u'(타)'),
+    (0x321A, '3', u'(파)'),
+    (0x321B, '3', u'(하)'),
+    (0x321C, '3', u'(주)'),
+    (0x321D, '3', u'(오전)'),
+    (0x321E, '3', u'(오후)'),
+    (0x321F, 'X'),
+    (0x3220, '3', u'(一)'),
+    (0x3221, '3', u'(二)'),
+    (0x3222, '3', u'(三)'),
+    (0x3223, '3', u'(四)'),
+    (0x3224, '3', u'(五)'),
+    (0x3225, '3', u'(六)'),
+    (0x3226, '3', u'(七)'),
+    (0x3227, '3', u'(八)'),
+    (0x3228, '3', u'(九)'),
+    (0x3229, '3', u'(十)'),
+    (0x322A, '3', u'(月)'),
+    (0x322B, '3', u'(火)'),
+    (0x322C, '3', u'(水)'),
+    (0x322D, '3', u'(木)'),
+    (0x322E, '3', u'(金)'),
+    (0x322F, '3', u'(土)'),
+    (0x3230, '3', u'(日)'),
+    (0x3231, '3', u'(株)'),
+    (0x3232, '3', u'(有)'),
+    (0x3233, '3', u'(社)'),
+    (0x3234, '3', u'(名)'),
+    (0x3235, '3', u'(特)'),
+    (0x3236, '3', u'(財)'),
+    (0x3237, '3', u'(祝)'),
+    (0x3238, '3', u'(労)'),
+    (0x3239, '3', u'(代)'),
+    (0x323A, '3', u'(呼)'),
+    (0x323B, '3', u'(学)'),
+    (0x323C, '3', u'(監)'),
+    (0x323D, '3', u'(企)'),
+    (0x323E, '3', u'(資)'),
+    (0x323F, '3', u'(協)'),
+    (0x3240, '3', u'(祭)'),
+    (0x3241, '3', u'(休)'),
+    (0x3242, '3', u'(自)'),
+    ]
+
+def _seg_31():
+    return [
+    (0x3243, '3', u'(至)'),
+    (0x3244, 'M', u'問'),
+    (0x3245, 'M', u'幼'),
+    (0x3246, 'M', u'文'),
+    (0x3247, 'M', u'箏'),
+    (0x3248, 'V'),
+    (0x3250, 'M', u'pte'),
+    (0x3251, 'M', u'21'),
+    (0x3252, 'M', u'22'),
+    (0x3253, 'M', u'23'),
+    (0x3254, 'M', u'24'),
+    (0x3255, 'M', u'25'),
+    (0x3256, 'M', u'26'),
+    (0x3257, 'M', u'27'),
+    (0x3258, 'M', u'28'),
+    (0x3259, 'M', u'29'),
+    (0x325A, 'M', u'30'),
+    (0x325B, 'M', u'31'),
+    (0x325C, 'M', u'32'),
+    (0x325D, 'M', u'33'),
+    (0x325E, 'M', u'34'),
+    (0x325F, 'M', u'35'),
+    (0x3260, 'M', u'ᄀ'),
+    (0x3261, 'M', u'ᄂ'),
+    (0x3262, 'M', u'ᄃ'),
+    (0x3263, 'M', u'ᄅ'),
+    (0x3264, 'M', u'ᄆ'),
+    (0x3265, 'M', u'ᄇ'),
+    (0x3266, 'M', u'ᄉ'),
+    (0x3267, 'M', u'ᄋ'),
+    (0x3268, 'M', u'ᄌ'),
+    (0x3269, 'M', u'ᄎ'),
+    (0x326A, 'M', u'ᄏ'),
+    (0x326B, 'M', u'ᄐ'),
+    (0x326C, 'M', u'ᄑ'),
+    (0x326D, 'M', u'ᄒ'),
+    (0x326E, 'M', u'가'),
+    (0x326F, 'M', u'나'),
+    (0x3270, 'M', u'다'),
+    (0x3271, 'M', u'라'),
+    (0x3272, 'M', u'마'),
+    (0x3273, 'M', u'바'),
+    (0x3274, 'M', u'사'),
+    (0x3275, 'M', u'아'),
+    (0x3276, 'M', u'자'),
+    (0x3277, 'M', u'차'),
+    (0x3278, 'M', u'카'),
+    (0x3279, 'M', u'타'),
+    (0x327A, 'M', u'파'),
+    (0x327B, 'M', u'하'),
+    (0x327C, 'M', u'참고'),
+    (0x327D, 'M', u'주의'),
+    (0x327E, 'M', u'우'),
+    (0x327F, 'V'),
+    (0x3280, 'M', u'一'),
+    (0x3281, 'M', u'二'),
+    (0x3282, 'M', u'三'),
+    (0x3283, 'M', u'四'),
+    (0x3284, 'M', u'五'),
+    (0x3285, 'M', u'六'),
+    (0x3286, 'M', u'七'),
+    (0x3287, 'M', u'八'),
+    (0x3288, 'M', u'九'),
+    (0x3289, 'M', u'十'),
+    (0x328A, 'M', u'月'),
+    (0x328B, 'M', u'火'),
+    (0x328C, 'M', u'水'),
+    (0x328D, 'M', u'木'),
+    (0x328E, 'M', u'金'),
+    (0x328F, 'M', u'土'),
+    (0x3290, 'M', u'日'),
+    (0x3291, 'M', u'株'),
+    (0x3292, 'M', u'有'),
+    (0x3293, 'M', u'社'),
+    (0x3294, 'M', u'名'),
+    (0x3295, 'M', u'特'),
+    (0x3296, 'M', u'財'),
+    (0x3297, 'M', u'祝'),
+    (0x3298, 'M', u'労'),
+    (0x3299, 'M', u'秘'),
+    (0x329A, 'M', u'男'),
+    (0x329B, 'M', u'女'),
+    (0x329C, 'M', u'適'),
+    (0x329D, 'M', u'優'),
+    (0x329E, 'M', u'印'),
+    (0x329F, 'M', u'注'),
+    (0x32A0, 'M', u'項'),
+    (0x32A1, 'M', u'休'),
+    (0x32A2, 'M', u'写'),
+    (0x32A3, 'M', u'正'),
+    (0x32A4, 'M', u'上'),
+    (0x32A5, 'M', u'中'),
+    (0x32A6, 'M', u'下'),
+    (0x32A7, 'M', u'左'),
+    (0x32A8, 'M', u'右'),
+    (0x32A9, 'M', u'医'),
+    (0x32AA, 'M', u'宗'),
+    (0x32AB, 'M', u'学'),
+    (0x32AC, 'M', u'監'),
+    (0x32AD, 'M', u'企'),
+    ]
+
+def _seg_32():
+    return [
+    (0x32AE, 'M', u'資'),
+    (0x32AF, 'M', u'協'),
+    (0x32B0, 'M', u'夜'),
+    (0x32B1, 'M', u'36'),
+    (0x32B2, 'M', u'37'),
+    (0x32B3, 'M', u'38'),
+    (0x32B4, 'M', u'39'),
+    (0x32B5, 'M', u'40'),
+    (0x32B6, 'M', u'41'),
+    (0x32B7, 'M', u'42'),
+    (0x32B8, 'M', u'43'),
+    (0x32B9, 'M', u'44'),
+    (0x32BA, 'M', u'45'),
+    (0x32BB, 'M', u'46'),
+    (0x32BC, 'M', u'47'),
+    (0x32BD, 'M', u'48'),
+    (0x32BE, 'M', u'49'),
+    (0x32BF, 'M', u'50'),
+    (0x32C0, 'M', u'1月'),
+    (0x32C1, 'M', u'2月'),
+    (0x32C2, 'M', u'3月'),
+    (0x32C3, 'M', u'4月'),
+    (0x32C4, 'M', u'5月'),
+    (0x32C5, 'M', u'6月'),
+    (0x32C6, 'M', u'7月'),
+    (0x32C7, 'M', u'8月'),
+    (0x32C8, 'M', u'9月'),
+    (0x32C9, 'M', u'10月'),
+    (0x32CA, 'M', u'11月'),
+    (0x32CB, 'M', u'12月'),
+    (0x32CC, 'M', u'hg'),
+    (0x32CD, 'M', u'erg'),
+    (0x32CE, 'M', u'ev'),
+    (0x32CF, 'M', u'ltd'),
+    (0x32D0, 'M', u'ア'),
+    (0x32D1, 'M', u'イ'),
+    (0x32D2, 'M', u'ウ'),
+    (0x32D3, 'M', u'エ'),
+    (0x32D4, 'M', u'オ'),
+    (0x32D5, 'M', u'カ'),
+    (0x32D6, 'M', u'キ'),
+    (0x32D7, 'M', u'ク'),
+    (0x32D8, 'M', u'ケ'),
+    (0x32D9, 'M', u'コ'),
+    (0x32DA, 'M', u'サ'),
+    (0x32DB, 'M', u'シ'),
+    (0x32DC, 'M', u'ス'),
+    (0x32DD, 'M', u'セ'),
+    (0x32DE, 'M', u'ソ'),
+    (0x32DF, 'M', u'タ'),
+    (0x32E0, 'M', u'チ'),
+    (0x32E1, 'M', u'ツ'),
+    (0x32E2, 'M', u'テ'),
+    (0x32E3, 'M', u'ト'),
+    (0x32E4, 'M', u'ナ'),
+    (0x32E5, 'M', u'ニ'),
+    (0x32E6, 'M', u'ヌ'),
+    (0x32E7, 'M', u'ネ'),
+    (0x32E8, 'M', u'ノ'),
+    (0x32E9, 'M', u'ハ'),
+    (0x32EA, 'M', u'ヒ'),
+    (0x32EB, 'M', u'フ'),
+    (0x32EC, 'M', u'ヘ'),
+    (0x32ED, 'M', u'ホ'),
+    (0x32EE, 'M', u'マ'),
+    (0x32EF, 'M', u'ミ'),
+    (0x32F0, 'M', u'ム'),
+    (0x32F1, 'M', u'メ'),
+    (0x32F2, 'M', u'モ'),
+    (0x32F3, 'M', u'ヤ'),
+    (0x32F4, 'M', u'ユ'),
+    (0x32F5, 'M', u'ヨ'),
+    (0x32F6, 'M', u'ラ'),
+    (0x32F7, 'M', u'リ'),
+    (0x32F8, 'M', u'ル'),
+    (0x32F9, 'M', u'レ'),
+    (0x32FA, 'M', u'ロ'),
+    (0x32FB, 'M', u'ワ'),
+    (0x32FC, 'M', u'ヰ'),
+    (0x32FD, 'M', u'ヱ'),
+    (0x32FE, 'M', u'ヲ'),
+    (0x32FF, 'M', u'令和'),
+    (0x3300, 'M', u'アパート'),
+    (0x3301, 'M', u'アルファ'),
+    (0x3302, 'M', u'アンペア'),
+    (0x3303, 'M', u'アール'),
+    (0x3304, 'M', u'イニング'),
+    (0x3305, 'M', u'インチ'),
+    (0x3306, 'M', u'ウォン'),
+    (0x3307, 'M', u'エスクード'),
+    (0x3308, 'M', u'エーカー'),
+    (0x3309, 'M', u'オンス'),
+    (0x330A, 'M', u'オーム'),
+    (0x330B, 'M', u'カイリ'),
+    (0x330C, 'M', u'カラット'),
+    (0x330D, 'M', u'カロリー'),
+    (0x330E, 'M', u'ガロン'),
+    (0x330F, 'M', u'ガンマ'),
+    (0x3310, 'M', u'ギガ'),
+    (0x3311, 'M', u'ギニー'),
+    ]
+
+def _seg_33():
+    return [
+    (0x3312, 'M', u'キュリー'),
+    (0x3313, 'M', u'ギルダー'),
+    (0x3314, 'M', u'キロ'),
+    (0x3315, 'M', u'キログラム'),
+    (0x3316, 'M', u'キロメートル'),
+    (0x3317, 'M', u'キロワット'),
+    (0x3318, 'M', u'グラム'),
+    (0x3319, 'M', u'グラムトン'),
+    (0x331A, 'M', u'クルゼイロ'),
+    (0x331B, 'M', u'クローネ'),
+    (0x331C, 'M', u'ケース'),
+    (0x331D, 'M', u'コルナ'),
+    (0x331E, 'M', u'コーポ'),
+    (0x331F, 'M', u'サイクル'),
+    (0x3320, 'M', u'サンチーム'),
+    (0x3321, 'M', u'シリング'),
+    (0x3322, 'M', u'センチ'),
+    (0x3323, 'M', u'セント'),
+    (0x3324, 'M', u'ダース'),
+    (0x3325, 'M', u'デシ'),
+    (0x3326, 'M', u'ドル'),
+    (0x3327, 'M', u'トン'),
+    (0x3328, 'M', u'ナノ'),
+    (0x3329, 'M', u'ノット'),
+    (0x332A, 'M', u'ハイツ'),
+    (0x332B, 'M', u'パーセント'),
+    (0x332C, 'M', u'パーツ'),
+    (0x332D, 'M', u'バーレル'),
+    (0x332E, 'M', u'ピアストル'),
+    (0x332F, 'M', u'ピクル'),
+    (0x3330, 'M', u'ピコ'),
+    (0x3331, 'M', u'ビル'),
+    (0x3332, 'M', u'ファラッド'),
+    (0x3333, 'M', u'フィート'),
+    (0x3334, 'M', u'ブッシェル'),
+    (0x3335, 'M', u'フラン'),
+    (0x3336, 'M', u'ヘクタール'),
+    (0x3337, 'M', u'ペソ'),
+    (0x3338, 'M', u'ペニヒ'),
+    (0x3339, 'M', u'ヘルツ'),
+    (0x333A, 'M', u'ペンス'),
+    (0x333B, 'M', u'ページ'),
+    (0x333C, 'M', u'ベータ'),
+    (0x333D, 'M', u'ポイント'),
+    (0x333E, 'M', u'ボルト'),
+    (0x333F, 'M', u'ホン'),
+    (0x3340, 'M', u'ポンド'),
+    (0x3341, 'M', u'ホール'),
+    (0x3342, 'M', u'ホーン'),
+    (0x3343, 'M', u'マイクロ'),
+    (0x3344, 'M', u'マイル'),
+    (0x3345, 'M', u'マッハ'),
+    (0x3346, 'M', u'マルク'),
+    (0x3347, 'M', u'マンション'),
+    (0x3348, 'M', u'ミクロン'),
+    (0x3349, 'M', u'ミリ'),
+    (0x334A, 'M', u'ミリバール'),
+    (0x334B, 'M', u'メガ'),
+    (0x334C, 'M', u'メガトン'),
+    (0x334D, 'M', u'メートル'),
+    (0x334E, 'M', u'ヤード'),
+    (0x334F, 'M', u'ヤール'),
+    (0x3350, 'M', u'ユアン'),
+    (0x3351, 'M', u'リットル'),
+    (0x3352, 'M', u'リラ'),
+    (0x3353, 'M', u'ルピー'),
+    (0x3354, 'M', u'ルーブル'),
+    (0x3355, 'M', u'レム'),
+    (0x3356, 'M', u'レントゲン'),
+    (0x3357, 'M', u'ワット'),
+    (0x3358, 'M', u'0点'),
+    (0x3359, 'M', u'1点'),
+    (0x335A, 'M', u'2点'),
+    (0x335B, 'M', u'3点'),
+    (0x335C, 'M', u'4点'),
+    (0x335D, 'M', u'5点'),
+    (0x335E, 'M', u'6点'),
+    (0x335F, 'M', u'7点'),
+    (0x3360, 'M', u'8点'),
+    (0x3361, 'M', u'9点'),
+    (0x3362, 'M', u'10点'),
+    (0x3363, 'M', u'11点'),
+    (0x3364, 'M', u'12点'),
+    (0x3365, 'M', u'13点'),
+    (0x3366, 'M', u'14点'),
+    (0x3367, 'M', u'15点'),
+    (0x3368, 'M', u'16点'),
+    (0x3369, 'M', u'17点'),
+    (0x336A, 'M', u'18点'),
+    (0x336B, 'M', u'19点'),
+    (0x336C, 'M', u'20点'),
+    (0x336D, 'M', u'21点'),
+    (0x336E, 'M', u'22点'),
+    (0x336F, 'M', u'23点'),
+    (0x3370, 'M', u'24点'),
+    (0x3371, 'M', u'hpa'),
+    (0x3372, 'M', u'da'),
+    (0x3373, 'M', u'au'),
+    (0x3374, 'M', u'bar'),
+    (0x3375, 'M', u'ov'),
+    ]
+
+def _seg_34():
+    return [
+    (0x3376, 'M', u'pc'),
+    (0x3377, 'M', u'dm'),
+    (0x3378, 'M', u'dm2'),
+    (0x3379, 'M', u'dm3'),
+    (0x337A, 'M', u'iu'),
+    (0x337B, 'M', u'平成'),
+    (0x337C, 'M', u'昭和'),
+    (0x337D, 'M', u'大正'),
+    (0x337E, 'M', u'明治'),
+    (0x337F, 'M', u'株式会社'),
+    (0x3380, 'M', u'pa'),
+    (0x3381, 'M', u'na'),
+    (0x3382, 'M', u'μa'),
+    (0x3383, 'M', u'ma'),
+    (0x3384, 'M', u'ka'),
+    (0x3385, 'M', u'kb'),
+    (0x3386, 'M', u'mb'),
+    (0x3387, 'M', u'gb'),
+    (0x3388, 'M', u'cal'),
+    (0x3389, 'M', u'kcal'),
+    (0x338A, 'M', u'pf'),
+    (0x338B, 'M', u'nf'),
+    (0x338C, 'M', u'μf'),
+    (0x338D, 'M', u'μg'),
+    (0x338E, 'M', u'mg'),
+    (0x338F, 'M', u'kg'),
+    (0x3390, 'M', u'hz'),
+    (0x3391, 'M', u'khz'),
+    (0x3392, 'M', u'mhz'),
+    (0x3393, 'M', u'ghz'),
+    (0x3394, 'M', u'thz'),
+    (0x3395, 'M', u'μl'),
+    (0x3396, 'M', u'ml'),
+    (0x3397, 'M', u'dl'),
+    (0x3398, 'M', u'kl'),
+    (0x3399, 'M', u'fm'),
+    (0x339A, 'M', u'nm'),
+    (0x339B, 'M', u'μm'),
+    (0x339C, 'M', u'mm'),
+    (0x339D, 'M', u'cm'),
+    (0x339E, 'M', u'km'),
+    (0x339F, 'M', u'mm2'),
+    (0x33A0, 'M', u'cm2'),
+    (0x33A1, 'M', u'm2'),
+    (0x33A2, 'M', u'km2'),
+    (0x33A3, 'M', u'mm3'),
+    (0x33A4, 'M', u'cm3'),
+    (0x33A5, 'M', u'm3'),
+    (0x33A6, 'M', u'km3'),
+    (0x33A7, 'M', u'm∕s'),
+    (0x33A8, 'M', u'm∕s2'),
+    (0x33A9, 'M', u'pa'),
+    (0x33AA, 'M', u'kpa'),
+    (0x33AB, 'M', u'mpa'),
+    (0x33AC, 'M', u'gpa'),
+    (0x33AD, 'M', u'rad'),
+    (0x33AE, 'M', u'rad∕s'),
+    (0x33AF, 'M', u'rad∕s2'),
+    (0x33B0, 'M', u'ps'),
+    (0x33B1, 'M', u'ns'),
+    (0x33B2, 'M', u'μs'),
+    (0x33B3, 'M', u'ms'),
+    (0x33B4, 'M', u'pv'),
+    (0x33B5, 'M', u'nv'),
+    (0x33B6, 'M', u'μv'),
+    (0x33B7, 'M', u'mv'),
+    (0x33B8, 'M', u'kv'),
+    (0x33B9, 'M', u'mv'),
+    (0x33BA, 'M', u'pw'),
+    (0x33BB, 'M', u'nw'),
+    (0x33BC, 'M', u'μw'),
+    (0x33BD, 'M', u'mw'),
+    (0x33BE, 'M', u'kw'),
+    (0x33BF, 'M', u'mw'),
+    (0x33C0, 'M', u'kω'),
+    (0x33C1, 'M', u'mω'),
+    (0x33C2, 'X'),
+    (0x33C3, 'M', u'bq'),
+    (0x33C4, 'M', u'cc'),
+    (0x33C5, 'M', u'cd'),
+    (0x33C6, 'M', u'c∕kg'),
+    (0x33C7, 'X'),
+    (0x33C8, 'M', u'db'),
+    (0x33C9, 'M', u'gy'),
+    (0x33CA, 'M', u'ha'),
+    (0x33CB, 'M', u'hp'),
+    (0x33CC, 'M', u'in'),
+    (0x33CD, 'M', u'kk'),
+    (0x33CE, 'M', u'km'),
+    (0x33CF, 'M', u'kt'),
+    (0x33D0, 'M', u'lm'),
+    (0x33D1, 'M', u'ln'),
+    (0x33D2, 'M', u'log'),
+    (0x33D3, 'M', u'lx'),
+    (0x33D4, 'M', u'mb'),
+    (0x33D5, 'M', u'mil'),
+    (0x33D6, 'M', u'mol'),
+    (0x33D7, 'M', u'ph'),
+    (0x33D8, 'X'),
+    (0x33D9, 'M', u'ppm'),
+    ]
+
+def _seg_35():
+    return [
+    (0x33DA, 'M', u'pr'),
+    (0x33DB, 'M', u'sr'),
+    (0x33DC, 'M', u'sv'),
+    (0x33DD, 'M', u'wb'),
+    (0x33DE, 'M', u'v∕m'),
+    (0x33DF, 'M', u'a∕m'),
+    (0x33E0, 'M', u'1日'),
+    (0x33E1, 'M', u'2日'),
+    (0x33E2, 'M', u'3日'),
+    (0x33E3, 'M', u'4日'),
+    (0x33E4, 'M', u'5日'),
+    (0x33E5, 'M', u'6日'),
+    (0x33E6, 'M', u'7日'),
+    (0x33E7, 'M', u'8日'),
+    (0x33E8, 'M', u'9日'),
+    (0x33E9, 'M', u'10日'),
+    (0x33EA, 'M', u'11日'),
+    (0x33EB, 'M', u'12日'),
+    (0x33EC, 'M', u'13日'),
+    (0x33ED, 'M', u'14日'),
+    (0x33EE, 'M', u'15日'),
+    (0x33EF, 'M', u'16日'),
+    (0x33F0, 'M', u'17日'),
+    (0x33F1, 'M', u'18日'),
+    (0x33F2, 'M', u'19日'),
+    (0x33F3, 'M', u'20日'),
+    (0x33F4, 'M', u'21日'),
+    (0x33F5, 'M', u'22日'),
+    (0x33F6, 'M', u'23日'),
+    (0x33F7, 'M', u'24日'),
+    (0x33F8, 'M', u'25日'),
+    (0x33F9, 'M', u'26日'),
+    (0x33FA, 'M', u'27日'),
+    (0x33FB, 'M', u'28日'),
+    (0x33FC, 'M', u'29日'),
+    (0x33FD, 'M', u'30日'),
+    (0x33FE, 'M', u'31日'),
+    (0x33FF, 'M', u'gal'),
+    (0x3400, 'V'),
+    (0x9FFD, 'X'),
+    (0xA000, 'V'),
+    (0xA48D, 'X'),
+    (0xA490, 'V'),
+    (0xA4C7, 'X'),
+    (0xA4D0, 'V'),
+    (0xA62C, 'X'),
+    (0xA640, 'M', u'ꙁ'),
+    (0xA641, 'V'),
+    (0xA642, 'M', u'ꙃ'),
+    (0xA643, 'V'),
+    (0xA644, 'M', u'ꙅ'),
+    (0xA645, 'V'),
+    (0xA646, 'M', u'ꙇ'),
+    (0xA647, 'V'),
+    (0xA648, 'M', u'ꙉ'),
+    (0xA649, 'V'),
+    (0xA64A, 'M', u'ꙋ'),
+    (0xA64B, 'V'),
+    (0xA64C, 'M', u'ꙍ'),
+    (0xA64D, 'V'),
+    (0xA64E, 'M', u'ꙏ'),
+    (0xA64F, 'V'),
+    (0xA650, 'M', u'ꙑ'),
+    (0xA651, 'V'),
+    (0xA652, 'M', u'ꙓ'),
+    (0xA653, 'V'),
+    (0xA654, 'M', u'ꙕ'),
+    (0xA655, 'V'),
+    (0xA656, 'M', u'ꙗ'),
+    (0xA657, 'V'),
+    (0xA658, 'M', u'ꙙ'),
+    (0xA659, 'V'),
+    (0xA65A, 'M', u'ꙛ'),
+    (0xA65B, 'V'),
+    (0xA65C, 'M', u'ꙝ'),
+    (0xA65D, 'V'),
+    (0xA65E, 'M', u'ꙟ'),
+    (0xA65F, 'V'),
+    (0xA660, 'M', u'ꙡ'),
+    (0xA661, 'V'),
+    (0xA662, 'M', u'ꙣ'),
+    (0xA663, 'V'),
+    (0xA664, 'M', u'ꙥ'),
+    (0xA665, 'V'),
+    (0xA666, 'M', u'ꙧ'),
+    (0xA667, 'V'),
+    (0xA668, 'M', u'ꙩ'),
+    (0xA669, 'V'),
+    (0xA66A, 'M', u'ꙫ'),
+    (0xA66B, 'V'),
+    (0xA66C, 'M', u'ꙭ'),
+    (0xA66D, 'V'),
+    (0xA680, 'M', u'ꚁ'),
+    (0xA681, 'V'),
+    (0xA682, 'M', u'ꚃ'),
+    (0xA683, 'V'),
+    (0xA684, 'M', u'ꚅ'),
+    (0xA685, 'V'),
+    (0xA686, 'M', u'ꚇ'),
+    (0xA687, 'V'),
+    ]
+
+def _seg_36():
+    return [
+    (0xA688, 'M', u'ꚉ'),
+    (0xA689, 'V'),
+    (0xA68A, 'M', u'ꚋ'),
+    (0xA68B, 'V'),
+    (0xA68C, 'M', u'ꚍ'),
+    (0xA68D, 'V'),
+    (0xA68E, 'M', u'ꚏ'),
+    (0xA68F, 'V'),
+    (0xA690, 'M', u'ꚑ'),
+    (0xA691, 'V'),
+    (0xA692, 'M', u'ꚓ'),
+    (0xA693, 'V'),
+    (0xA694, 'M', u'ꚕ'),
+    (0xA695, 'V'),
+    (0xA696, 'M', u'ꚗ'),
+    (0xA697, 'V'),
+    (0xA698, 'M', u'ꚙ'),
+    (0xA699, 'V'),
+    (0xA69A, 'M', u'ꚛ'),
+    (0xA69B, 'V'),
+    (0xA69C, 'M', u'ъ'),
+    (0xA69D, 'M', u'ь'),
+    (0xA69E, 'V'),
+    (0xA6F8, 'X'),
+    (0xA700, 'V'),
+    (0xA722, 'M', u'ꜣ'),
+    (0xA723, 'V'),
+    (0xA724, 'M', u'ꜥ'),
+    (0xA725, 'V'),
+    (0xA726, 'M', u'ꜧ'),
+    (0xA727, 'V'),
+    (0xA728, 'M', u'ꜩ'),
+    (0xA729, 'V'),
+    (0xA72A, 'M', u'ꜫ'),
+    (0xA72B, 'V'),
+    (0xA72C, 'M', u'ꜭ'),
+    (0xA72D, 'V'),
+    (0xA72E, 'M', u'ꜯ'),
+    (0xA72F, 'V'),
+    (0xA732, 'M', u'ꜳ'),
+    (0xA733, 'V'),
+    (0xA734, 'M', u'ꜵ'),
+    (0xA735, 'V'),
+    (0xA736, 'M', u'ꜷ'),
+    (0xA737, 'V'),
+    (0xA738, 'M', u'ꜹ'),
+    (0xA739, 'V'),
+    (0xA73A, 'M', u'ꜻ'),
+    (0xA73B, 'V'),
+    (0xA73C, 'M', u'ꜽ'),
+    (0xA73D, 'V'),
+    (0xA73E, 'M', u'ꜿ'),
+    (0xA73F, 'V'),
+    (0xA740, 'M', u'ꝁ'),
+    (0xA741, 'V'),
+    (0xA742, 'M', u'ꝃ'),
+    (0xA743, 'V'),
+    (0xA744, 'M', u'ꝅ'),
+    (0xA745, 'V'),
+    (0xA746, 'M', u'ꝇ'),
+    (0xA747, 'V'),
+    (0xA748, 'M', u'ꝉ'),
+    (0xA749, 'V'),
+    (0xA74A, 'M', u'ꝋ'),
+    (0xA74B, 'V'),
+    (0xA74C, 'M', u'ꝍ'),
+    (0xA74D, 'V'),
+    (0xA74E, 'M', u'ꝏ'),
+    (0xA74F, 'V'),
+    (0xA750, 'M', u'ꝑ'),
+    (0xA751, 'V'),
+    (0xA752, 'M', u'ꝓ'),
+    (0xA753, 'V'),
+    (0xA754, 'M', u'ꝕ'),
+    (0xA755, 'V'),
+    (0xA756, 'M', u'ꝗ'),
+    (0xA757, 'V'),
+    (0xA758, 'M', u'ꝙ'),
+    (0xA759, 'V'),
+    (0xA75A, 'M', u'ꝛ'),
+    (0xA75B, 'V'),
+    (0xA75C, 'M', u'ꝝ'),
+    (0xA75D, 'V'),
+    (0xA75E, 'M', u'ꝟ'),
+    (0xA75F, 'V'),
+    (0xA760, 'M', u'ꝡ'),
+    (0xA761, 'V'),
+    (0xA762, 'M', u'ꝣ'),
+    (0xA763, 'V'),
+    (0xA764, 'M', u'ꝥ'),
+    (0xA765, 'V'),
+    (0xA766, 'M', u'ꝧ'),
+    (0xA767, 'V'),
+    (0xA768, 'M', u'ꝩ'),
+    (0xA769, 'V'),
+    (0xA76A, 'M', u'ꝫ'),
+    (0xA76B, 'V'),
+    (0xA76C, 'M', u'ꝭ'),
+    (0xA76D, 'V'),
+    (0xA76E, 'M', u'ꝯ'),
+    ]
+
+def _seg_37():
+    return [
+    (0xA76F, 'V'),
+    (0xA770, 'M', u'ꝯ'),
+    (0xA771, 'V'),
+    (0xA779, 'M', u'ꝺ'),
+    (0xA77A, 'V'),
+    (0xA77B, 'M', u'ꝼ'),
+    (0xA77C, 'V'),
+    (0xA77D, 'M', u'ᵹ'),
+    (0xA77E, 'M', u'ꝿ'),
+    (0xA77F, 'V'),
+    (0xA780, 'M', u'ꞁ'),
+    (0xA781, 'V'),
+    (0xA782, 'M', u'ꞃ'),
+    (0xA783, 'V'),
+    (0xA784, 'M', u'ꞅ'),
+    (0xA785, 'V'),
+    (0xA786, 'M', u'ꞇ'),
+    (0xA787, 'V'),
+    (0xA78B, 'M', u'ꞌ'),
+    (0xA78C, 'V'),
+    (0xA78D, 'M', u'ɥ'),
+    (0xA78E, 'V'),
+    (0xA790, 'M', u'ꞑ'),
+    (0xA791, 'V'),
+    (0xA792, 'M', u'ꞓ'),
+    (0xA793, 'V'),
+    (0xA796, 'M', u'ꞗ'),
+    (0xA797, 'V'),
+    (0xA798, 'M', u'ꞙ'),
+    (0xA799, 'V'),
+    (0xA79A, 'M', u'ꞛ'),
+    (0xA79B, 'V'),
+    (0xA79C, 'M', u'ꞝ'),
+    (0xA79D, 'V'),
+    (0xA79E, 'M', u'ꞟ'),
+    (0xA79F, 'V'),
+    (0xA7A0, 'M', u'ꞡ'),
+    (0xA7A1, 'V'),
+    (0xA7A2, 'M', u'ꞣ'),
+    (0xA7A3, 'V'),
+    (0xA7A4, 'M', u'ꞥ'),
+    (0xA7A5, 'V'),
+    (0xA7A6, 'M', u'ꞧ'),
+    (0xA7A7, 'V'),
+    (0xA7A8, 'M', u'ꞩ'),
+    (0xA7A9, 'V'),
+    (0xA7AA, 'M', u'ɦ'),
+    (0xA7AB, 'M', u'ɜ'),
+    (0xA7AC, 'M', u'ɡ'),
+    (0xA7AD, 'M', u'ɬ'),
+    (0xA7AE, 'M', u'ɪ'),
+    (0xA7AF, 'V'),
+    (0xA7B0, 'M', u'ʞ'),
+    (0xA7B1, 'M', u'ʇ'),
+    (0xA7B2, 'M', u'ʝ'),
+    (0xA7B3, 'M', u'ꭓ'),
+    (0xA7B4, 'M', u'ꞵ'),
+    (0xA7B5, 'V'),
+    (0xA7B6, 'M', u'ꞷ'),
+    (0xA7B7, 'V'),
+    (0xA7B8, 'M', u'ꞹ'),
+    (0xA7B9, 'V'),
+    (0xA7BA, 'M', u'ꞻ'),
+    (0xA7BB, 'V'),
+    (0xA7BC, 'M', u'ꞽ'),
+    (0xA7BD, 'V'),
+    (0xA7BE, 'M', u'ꞿ'),
+    (0xA7BF, 'V'),
+    (0xA7C0, 'X'),
+    (0xA7C2, 'M', u'ꟃ'),
+    (0xA7C3, 'V'),
+    (0xA7C4, 'M', u'ꞔ'),
+    (0xA7C5, 'M', u'ʂ'),
+    (0xA7C6, 'M', u'ᶎ'),
+    (0xA7C7, 'M', u'ꟈ'),
+    (0xA7C8, 'V'),
+    (0xA7C9, 'M', u'ꟊ'),
+    (0xA7CA, 'V'),
+    (0xA7CB, 'X'),
+    (0xA7F5, 'M', u'ꟶ'),
+    (0xA7F6, 'V'),
+    (0xA7F8, 'M', u'ħ'),
+    (0xA7F9, 'M', u'œ'),
+    (0xA7FA, 'V'),
+    (0xA82D, 'X'),
+    (0xA830, 'V'),
+    (0xA83A, 'X'),
+    (0xA840, 'V'),
+    (0xA878, 'X'),
+    (0xA880, 'V'),
+    (0xA8C6, 'X'),
+    (0xA8CE, 'V'),
+    (0xA8DA, 'X'),
+    (0xA8E0, 'V'),
+    (0xA954, 'X'),
+    (0xA95F, 'V'),
+    (0xA97D, 'X'),
+    (0xA980, 'V'),
+    (0xA9CE, 'X'),
+    (0xA9CF, 'V'),
+    ]
+
+def _seg_38():
+    return [
+    (0xA9DA, 'X'),
+    (0xA9DE, 'V'),
+    (0xA9FF, 'X'),
+    (0xAA00, 'V'),
+    (0xAA37, 'X'),
+    (0xAA40, 'V'),
+    (0xAA4E, 'X'),
+    (0xAA50, 'V'),
+    (0xAA5A, 'X'),
+    (0xAA5C, 'V'),
+    (0xAAC3, 'X'),
+    (0xAADB, 'V'),
+    (0xAAF7, 'X'),
+    (0xAB01, 'V'),
+    (0xAB07, 'X'),
+    (0xAB09, 'V'),
+    (0xAB0F, 'X'),
+    (0xAB11, 'V'),
+    (0xAB17, 'X'),
+    (0xAB20, 'V'),
+    (0xAB27, 'X'),
+    (0xAB28, 'V'),
+    (0xAB2F, 'X'),
+    (0xAB30, 'V'),
+    (0xAB5C, 'M', u'ꜧ'),
+    (0xAB5D, 'M', u'ꬷ'),
+    (0xAB5E, 'M', u'ɫ'),
+    (0xAB5F, 'M', u'ꭒ'),
+    (0xAB60, 'V'),
+    (0xAB69, 'M', u'ʍ'),
+    (0xAB6A, 'V'),
+    (0xAB6C, 'X'),
+    (0xAB70, 'M', u'Ꭰ'),
+    (0xAB71, 'M', u'Ꭱ'),
+    (0xAB72, 'M', u'Ꭲ'),
+    (0xAB73, 'M', u'Ꭳ'),
+    (0xAB74, 'M', u'Ꭴ'),
+    (0xAB75, 'M', u'Ꭵ'),
+    (0xAB76, 'M', u'Ꭶ'),
+    (0xAB77, 'M', u'Ꭷ'),
+    (0xAB78, 'M', u'Ꭸ'),
+    (0xAB79, 'M', u'Ꭹ'),
+    (0xAB7A, 'M', u'Ꭺ'),
+    (0xAB7B, 'M', u'Ꭻ'),
+    (0xAB7C, 'M', u'Ꭼ'),
+    (0xAB7D, 'M', u'Ꭽ'),
+    (0xAB7E, 'M', u'Ꭾ'),
+    (0xAB7F, 'M', u'Ꭿ'),
+    (0xAB80, 'M', u'Ꮀ'),
+    (0xAB81, 'M', u'Ꮁ'),
+    (0xAB82, 'M', u'Ꮂ'),
+    (0xAB83, 'M', u'Ꮃ'),
+    (0xAB84, 'M', u'Ꮄ'),
+    (0xAB85, 'M', u'Ꮅ'),
+    (0xAB86, 'M', u'Ꮆ'),
+    (0xAB87, 'M', u'Ꮇ'),
+    (0xAB88, 'M', u'Ꮈ'),
+    (0xAB89, 'M', u'Ꮉ'),
+    (0xAB8A, 'M', u'Ꮊ'),
+    (0xAB8B, 'M', u'Ꮋ'),
+    (0xAB8C, 'M', u'Ꮌ'),
+    (0xAB8D, 'M', u'Ꮍ'),
+    (0xAB8E, 'M', u'Ꮎ'),
+    (0xAB8F, 'M', u'Ꮏ'),
+    (0xAB90, 'M', u'Ꮐ'),
+    (0xAB91, 'M', u'Ꮑ'),
+    (0xAB92, 'M', u'Ꮒ'),
+    (0xAB93, 'M', u'Ꮓ'),
+    (0xAB94, 'M', u'Ꮔ'),
+    (0xAB95, 'M', u'Ꮕ'),
+    (0xAB96, 'M', u'Ꮖ'),
+    (0xAB97, 'M', u'Ꮗ'),
+    (0xAB98, 'M', u'Ꮘ'),
+    (0xAB99, 'M', u'Ꮙ'),
+    (0xAB9A, 'M', u'Ꮚ'),
+    (0xAB9B, 'M', u'Ꮛ'),
+    (0xAB9C, 'M', u'Ꮜ'),
+    (0xAB9D, 'M', u'Ꮝ'),
+    (0xAB9E, 'M', u'Ꮞ'),
+    (0xAB9F, 'M', u'Ꮟ'),
+    (0xABA0, 'M', u'Ꮠ'),
+    (0xABA1, 'M', u'Ꮡ'),
+    (0xABA2, 'M', u'Ꮢ'),
+    (0xABA3, 'M', u'Ꮣ'),
+    (0xABA4, 'M', u'Ꮤ'),
+    (0xABA5, 'M', u'Ꮥ'),
+    (0xABA6, 'M', u'Ꮦ'),
+    (0xABA7, 'M', u'Ꮧ'),
+    (0xABA8, 'M', u'Ꮨ'),
+    (0xABA9, 'M', u'Ꮩ'),
+    (0xABAA, 'M', u'Ꮪ'),
+    (0xABAB, 'M', u'Ꮫ'),
+    (0xABAC, 'M', u'Ꮬ'),
+    (0xABAD, 'M', u'Ꮭ'),
+    (0xABAE, 'M', u'Ꮮ'),
+    (0xABAF, 'M', u'Ꮯ'),
+    (0xABB0, 'M', u'Ꮰ'),
+    (0xABB1, 'M', u'Ꮱ'),
+    (0xABB2, 'M', u'Ꮲ'),
+    (0xABB3, 'M', u'Ꮳ'),
+    ]
+
+def _seg_39():
+    return [
+    (0xABB4, 'M', u'Ꮴ'),
+    (0xABB5, 'M', u'Ꮵ'),
+    (0xABB6, 'M', u'Ꮶ'),
+    (0xABB7, 'M', u'Ꮷ'),
+    (0xABB8, 'M', u'Ꮸ'),
+    (0xABB9, 'M', u'Ꮹ'),
+    (0xABBA, 'M', u'Ꮺ'),
+    (0xABBB, 'M', u'Ꮻ'),
+    (0xABBC, 'M', u'Ꮼ'),
+    (0xABBD, 'M', u'Ꮽ'),
+    (0xABBE, 'M', u'Ꮾ'),
+    (0xABBF, 'M', u'Ꮿ'),
+    (0xABC0, 'V'),
+    (0xABEE, 'X'),
+    (0xABF0, 'V'),
+    (0xABFA, 'X'),
+    (0xAC00, 'V'),
+    (0xD7A4, 'X'),
+    (0xD7B0, 'V'),
+    (0xD7C7, 'X'),
+    (0xD7CB, 'V'),
+    (0xD7FC, 'X'),
+    (0xF900, 'M', u'豈'),
+    (0xF901, 'M', u'更'),
+    (0xF902, 'M', u'車'),
+    (0xF903, 'M', u'賈'),
+    (0xF904, 'M', u'滑'),
+    (0xF905, 'M', u'串'),
+    (0xF906, 'M', u'句'),
+    (0xF907, 'M', u'龜'),
+    (0xF909, 'M', u'契'),
+    (0xF90A, 'M', u'金'),
+    (0xF90B, 'M', u'喇'),
+    (0xF90C, 'M', u'奈'),
+    (0xF90D, 'M', u'懶'),
+    (0xF90E, 'M', u'癩'),
+    (0xF90F, 'M', u'羅'),
+    (0xF910, 'M', u'蘿'),
+    (0xF911, 'M', u'螺'),
+    (0xF912, 'M', u'裸'),
+    (0xF913, 'M', u'邏'),
+    (0xF914, 'M', u'樂'),
+    (0xF915, 'M', u'洛'),
+    (0xF916, 'M', u'烙'),
+    (0xF917, 'M', u'珞'),
+    (0xF918, 'M', u'落'),
+    (0xF919, 'M', u'酪'),
+    (0xF91A, 'M', u'駱'),
+    (0xF91B, 'M', u'亂'),
+    (0xF91C, 'M', u'卵'),
+    (0xF91D, 'M', u'欄'),
+    (0xF91E, 'M', u'爛'),
+    (0xF91F, 'M', u'蘭'),
+    (0xF920, 'M', u'鸞'),
+    (0xF921, 'M', u'嵐'),
+    (0xF922, 'M', u'濫'),
+    (0xF923, 'M', u'藍'),
+    (0xF924, 'M', u'襤'),
+    (0xF925, 'M', u'拉'),
+    (0xF926, 'M', u'臘'),
+    (0xF927, 'M', u'蠟'),
+    (0xF928, 'M', u'廊'),
+    (0xF929, 'M', u'朗'),
+    (0xF92A, 'M', u'浪'),
+    (0xF92B, 'M', u'狼'),
+    (0xF92C, 'M', u'郎'),
+    (0xF92D, 'M', u'來'),
+    (0xF92E, 'M', u'冷'),
+    (0xF92F, 'M', u'勞'),
+    (0xF930, 'M', u'擄'),
+    (0xF931, 'M', u'櫓'),
+    (0xF932, 'M', u'爐'),
+    (0xF933, 'M', u'盧'),
+    (0xF934, 'M', u'老'),
+    (0xF935, 'M', u'蘆'),
+    (0xF936, 'M', u'虜'),
+    (0xF937, 'M', u'路'),
+    (0xF938, 'M', u'露'),
+    (0xF939, 'M', u'魯'),
+    (0xF93A, 'M', u'鷺'),
+    (0xF93B, 'M', u'碌'),
+    (0xF93C, 'M', u'祿'),
+    (0xF93D, 'M', u'綠'),
+    (0xF93E, 'M', u'菉'),
+    (0xF93F, 'M', u'錄'),
+    (0xF940, 'M', u'鹿'),
+    (0xF941, 'M', u'論'),
+    (0xF942, 'M', u'壟'),
+    (0xF943, 'M', u'弄'),
+    (0xF944, 'M', u'籠'),
+    (0xF945, 'M', u'聾'),
+    (0xF946, 'M', u'牢'),
+    (0xF947, 'M', u'磊'),
+    (0xF948, 'M', u'賂'),
+    (0xF949, 'M', u'雷'),
+    (0xF94A, 'M', u'壘'),
+    (0xF94B, 'M', u'屢'),
+    (0xF94C, 'M', u'樓'),
+    (0xF94D, 'M', u'淚'),
+    (0xF94E, 'M', u'漏'),
+    ]
+
+def _seg_40():
+    return [
+    (0xF94F, 'M', u'累'),
+    (0xF950, 'M', u'縷'),
+    (0xF951, 'M', u'陋'),
+    (0xF952, 'M', u'勒'),
+    (0xF953, 'M', u'肋'),
+    (0xF954, 'M', u'凜'),
+    (0xF955, 'M', u'凌'),
+    (0xF956, 'M', u'稜'),
+    (0xF957, 'M', u'綾'),
+    (0xF958, 'M', u'菱'),
+    (0xF959, 'M', u'陵'),
+    (0xF95A, 'M', u'讀'),
+    (0xF95B, 'M', u'拏'),
+    (0xF95C, 'M', u'樂'),
+    (0xF95D, 'M', u'諾'),
+    (0xF95E, 'M', u'丹'),
+    (0xF95F, 'M', u'寧'),
+    (0xF960, 'M', u'怒'),
+    (0xF961, 'M', u'率'),
+    (0xF962, 'M', u'異'),
+    (0xF963, 'M', u'北'),
+    (0xF964, 'M', u'磻'),
+    (0xF965, 'M', u'便'),
+    (0xF966, 'M', u'復'),
+    (0xF967, 'M', u'不'),
+    (0xF968, 'M', u'泌'),
+    (0xF969, 'M', u'數'),
+    (0xF96A, 'M', u'索'),
+    (0xF96B, 'M', u'參'),
+    (0xF96C, 'M', u'塞'),
+    (0xF96D, 'M', u'省'),
+    (0xF96E, 'M', u'葉'),
+    (0xF96F, 'M', u'說'),
+    (0xF970, 'M', u'殺'),
+    (0xF971, 'M', u'辰'),
+    (0xF972, 'M', u'沈'),
+    (0xF973, 'M', u'拾'),
+    (0xF974, 'M', u'若'),
+    (0xF975, 'M', u'掠'),
+    (0xF976, 'M', u'略'),
+    (0xF977, 'M', u'亮'),
+    (0xF978, 'M', u'兩'),
+    (0xF979, 'M', u'凉'),
+    (0xF97A, 'M', u'梁'),
+    (0xF97B, 'M', u'糧'),
+    (0xF97C, 'M', u'良'),
+    (0xF97D, 'M', u'諒'),
+    (0xF97E, 'M', u'量'),
+    (0xF97F, 'M', u'勵'),
+    (0xF980, 'M', u'呂'),
+    (0xF981, 'M', u'女'),
+    (0xF982, 'M', u'廬'),
+    (0xF983, 'M', u'旅'),
+    (0xF984, 'M', u'濾'),
+    (0xF985, 'M', u'礪'),
+    (0xF986, 'M', u'閭'),
+    (0xF987, 'M', u'驪'),
+    (0xF988, 'M', u'麗'),
+    (0xF989, 'M', u'黎'),
+    (0xF98A, 'M', u'力'),
+    (0xF98B, 'M', u'曆'),
+    (0xF98C, 'M', u'歷'),
+    (0xF98D, 'M', u'轢'),
+    (0xF98E, 'M', u'年'),
+    (0xF98F, 'M', u'憐'),
+    (0xF990, 'M', u'戀'),
+    (0xF991, 'M', u'撚'),
+    (0xF992, 'M', u'漣'),
+    (0xF993, 'M', u'煉'),
+    (0xF994, 'M', u'璉'),
+    (0xF995, 'M', u'秊'),
+    (0xF996, 'M', u'練'),
+    (0xF997, 'M', u'聯'),
+    (0xF998, 'M', u'輦'),
+    (0xF999, 'M', u'蓮'),
+    (0xF99A, 'M', u'連'),
+    (0xF99B, 'M', u'鍊'),
+    (0xF99C, 'M', u'列'),
+    (0xF99D, 'M', u'劣'),
+    (0xF99E, 'M', u'咽'),
+    (0xF99F, 'M', u'烈'),
+    (0xF9A0, 'M', u'裂'),
+    (0xF9A1, 'M', u'說'),
+    (0xF9A2, 'M', u'廉'),
+    (0xF9A3, 'M', u'念'),
+    (0xF9A4, 'M', u'捻'),
+    (0xF9A5, 'M', u'殮'),
+    (0xF9A6, 'M', u'簾'),
+    (0xF9A7, 'M', u'獵'),
+    (0xF9A8, 'M', u'令'),
+    (0xF9A9, 'M', u'囹'),
+    (0xF9AA, 'M', u'寧'),
+    (0xF9AB, 'M', u'嶺'),
+    (0xF9AC, 'M', u'怜'),
+    (0xF9AD, 'M', u'玲'),
+    (0xF9AE, 'M', u'瑩'),
+    (0xF9AF, 'M', u'羚'),
+    (0xF9B0, 'M', u'聆'),
+    (0xF9B1, 'M', u'鈴'),
+    (0xF9B2, 'M', u'零'),
+    ]
+
+def _seg_41():
+    return [
+    (0xF9B3, 'M', u'靈'),
+    (0xF9B4, 'M', u'領'),
+    (0xF9B5, 'M', u'例'),
+    (0xF9B6, 'M', u'禮'),
+    (0xF9B7, 'M', u'醴'),
+    (0xF9B8, 'M', u'隸'),
+    (0xF9B9, 'M', u'惡'),
+    (0xF9BA, 'M', u'了'),
+    (0xF9BB, 'M', u'僚'),
+    (0xF9BC, 'M', u'寮'),
+    (0xF9BD, 'M', u'尿'),
+    (0xF9BE, 'M', u'料'),
+    (0xF9BF, 'M', u'樂'),
+    (0xF9C0, 'M', u'燎'),
+    (0xF9C1, 'M', u'療'),
+    (0xF9C2, 'M', u'蓼'),
+    (0xF9C3, 'M', u'遼'),
+    (0xF9C4, 'M', u'龍'),
+    (0xF9C5, 'M', u'暈'),
+    (0xF9C6, 'M', u'阮'),
+    (0xF9C7, 'M', u'劉'),
+    (0xF9C8, 'M', u'杻'),
+    (0xF9C9, 'M', u'柳'),
+    (0xF9CA, 'M', u'流'),
+    (0xF9CB, 'M', u'溜'),
+    (0xF9CC, 'M', u'琉'),
+    (0xF9CD, 'M', u'留'),
+    (0xF9CE, 'M', u'硫'),
+    (0xF9CF, 'M', u'紐'),
+    (0xF9D0, 'M', u'類'),
+    (0xF9D1, 'M', u'六'),
+    (0xF9D2, 'M', u'戮'),
+    (0xF9D3, 'M', u'陸'),
+    (0xF9D4, 'M', u'倫'),
+    (0xF9D5, 'M', u'崙'),
+    (0xF9D6, 'M', u'淪'),
+    (0xF9D7, 'M', u'輪'),
+    (0xF9D8, 'M', u'律'),
+    (0xF9D9, 'M', u'慄'),
+    (0xF9DA, 'M', u'栗'),
+    (0xF9DB, 'M', u'率'),
+    (0xF9DC, 'M', u'隆'),
+    (0xF9DD, 'M', u'利'),
+    (0xF9DE, 'M', u'吏'),
+    (0xF9DF, 'M', u'履'),
+    (0xF9E0, 'M', u'易'),
+    (0xF9E1, 'M', u'李'),
+    (0xF9E2, 'M', u'梨'),
+    (0xF9E3, 'M', u'泥'),
+    (0xF9E4, 'M', u'理'),
+    (0xF9E5, 'M', u'痢'),
+    (0xF9E6, 'M', u'罹'),
+    (0xF9E7, 'M', u'裏'),
+    (0xF9E8, 'M', u'裡'),
+    (0xF9E9, 'M', u'里'),
+    (0xF9EA, 'M', u'離'),
+    (0xF9EB, 'M', u'匿'),
+    (0xF9EC, 'M', u'溺'),
+    (0xF9ED, 'M', u'吝'),
+    (0xF9EE, 'M', u'燐'),
+    (0xF9EF, 'M', u'璘'),
+    (0xF9F0, 'M', u'藺'),
+    (0xF9F1, 'M', u'隣'),
+    (0xF9F2, 'M', u'鱗'),
+    (0xF9F3, 'M', u'麟'),
+    (0xF9F4, 'M', u'林'),
+    (0xF9F5, 'M', u'淋'),
+    (0xF9F6, 'M', u'臨'),
+    (0xF9F7, 'M', u'立'),
+    (0xF9F8, 'M', u'笠'),
+    (0xF9F9, 'M', u'粒'),
+    (0xF9FA, 'M', u'狀'),
+    (0xF9FB, 'M', u'炙'),
+    (0xF9FC, 'M', u'識'),
+    (0xF9FD, 'M', u'什'),
+    (0xF9FE, 'M', u'茶'),
+    (0xF9FF, 'M', u'刺'),
+    (0xFA00, 'M', u'切'),
+    (0xFA01, 'M', u'度'),
+    (0xFA02, 'M', u'拓'),
+    (0xFA03, 'M', u'糖'),
+    (0xFA04, 'M', u'宅'),
+    (0xFA05, 'M', u'洞'),
+    (0xFA06, 'M', u'暴'),
+    (0xFA07, 'M', u'輻'),
+    (0xFA08, 'M', u'行'),
+    (0xFA09, 'M', u'降'),
+    (0xFA0A, 'M', u'見'),
+    (0xFA0B, 'M', u'廓'),
+    (0xFA0C, 'M', u'兀'),
+    (0xFA0D, 'M', u'嗀'),
+    (0xFA0E, 'V'),
+    (0xFA10, 'M', u'塚'),
+    (0xFA11, 'V'),
+    (0xFA12, 'M', u'晴'),
+    (0xFA13, 'V'),
+    (0xFA15, 'M', u'凞'),
+    (0xFA16, 'M', u'猪'),
+    (0xFA17, 'M', u'益'),
+    (0xFA18, 'M', u'礼'),
+    ]
+
+def _seg_42():
+    return [
+    (0xFA19, 'M', u'神'),
+    (0xFA1A, 'M', u'祥'),
+    (0xFA1B, 'M', u'福'),
+    (0xFA1C, 'M', u'靖'),
+    (0xFA1D, 'M', u'精'),
+    (0xFA1E, 'M', u'羽'),
+    (0xFA1F, 'V'),
+    (0xFA20, 'M', u'蘒'),
+    (0xFA21, 'V'),
+    (0xFA22, 'M', u'諸'),
+    (0xFA23, 'V'),
+    (0xFA25, 'M', u'逸'),
+    (0xFA26, 'M', u'都'),
+    (0xFA27, 'V'),
+    (0xFA2A, 'M', u'飯'),
+    (0xFA2B, 'M', u'飼'),
+    (0xFA2C, 'M', u'館'),
+    (0xFA2D, 'M', u'鶴'),
+    (0xFA2E, 'M', u'郞'),
+    (0xFA2F, 'M', u'隷'),
+    (0xFA30, 'M', u'侮'),
+    (0xFA31, 'M', u'僧'),
+    (0xFA32, 'M', u'免'),
+    (0xFA33, 'M', u'勉'),
+    (0xFA34, 'M', u'勤'),
+    (0xFA35, 'M', u'卑'),
+    (0xFA36, 'M', u'喝'),
+    (0xFA37, 'M', u'嘆'),
+    (0xFA38, 'M', u'器'),
+    (0xFA39, 'M', u'塀'),
+    (0xFA3A, 'M', u'墨'),
+    (0xFA3B, 'M', u'層'),
+    (0xFA3C, 'M', u'屮'),
+    (0xFA3D, 'M', u'悔'),
+    (0xFA3E, 'M', u'慨'),
+    (0xFA3F, 'M', u'憎'),
+    (0xFA40, 'M', u'懲'),
+    (0xFA41, 'M', u'敏'),
+    (0xFA42, 'M', u'既'),
+    (0xFA43, 'M', u'暑'),
+    (0xFA44, 'M', u'梅'),
+    (0xFA45, 'M', u'海'),
+    (0xFA46, 'M', u'渚'),
+    (0xFA47, 'M', u'漢'),
+    (0xFA48, 'M', u'煮'),
+    (0xFA49, 'M', u'爫'),
+    (0xFA4A, 'M', u'琢'),
+    (0xFA4B, 'M', u'碑'),
+    (0xFA4C, 'M', u'社'),
+    (0xFA4D, 'M', u'祉'),
+    (0xFA4E, 'M', u'祈'),
+    (0xFA4F, 'M', u'祐'),
+    (0xFA50, 'M', u'祖'),
+    (0xFA51, 'M', u'祝'),
+    (0xFA52, 'M', u'禍'),
+    (0xFA53, 'M', u'禎'),
+    (0xFA54, 'M', u'穀'),
+    (0xFA55, 'M', u'突'),
+    (0xFA56, 'M', u'節'),
+    (0xFA57, 'M', u'練'),
+    (0xFA58, 'M', u'縉'),
+    (0xFA59, 'M', u'繁'),
+    (0xFA5A, 'M', u'署'),
+    (0xFA5B, 'M', u'者'),
+    (0xFA5C, 'M', u'臭'),
+    (0xFA5D, 'M', u'艹'),
+    (0xFA5F, 'M', u'著'),
+    (0xFA60, 'M', u'褐'),
+    (0xFA61, 'M', u'視'),
+    (0xFA62, 'M', u'謁'),
+    (0xFA63, 'M', u'謹'),
+    (0xFA64, 'M', u'賓'),
+    (0xFA65, 'M', u'贈'),
+    (0xFA66, 'M', u'辶'),
+    (0xFA67, 'M', u'逸'),
+    (0xFA68, 'M', u'難'),
+    (0xFA69, 'M', u'響'),
+    (0xFA6A, 'M', u'頻'),
+    (0xFA6B, 'M', u'恵'),
+    (0xFA6C, 'M', u'𤋮'),
+    (0xFA6D, 'M', u'舘'),
+    (0xFA6E, 'X'),
+    (0xFA70, 'M', u'並'),
+    (0xFA71, 'M', u'况'),
+    (0xFA72, 'M', u'全'),
+    (0xFA73, 'M', u'侀'),
+    (0xFA74, 'M', u'充'),
+    (0xFA75, 'M', u'冀'),
+    (0xFA76, 'M', u'勇'),
+    (0xFA77, 'M', u'勺'),
+    (0xFA78, 'M', u'喝'),
+    (0xFA79, 'M', u'啕'),
+    (0xFA7A, 'M', u'喙'),
+    (0xFA7B, 'M', u'嗢'),
+    (0xFA7C, 'M', u'塚'),
+    (0xFA7D, 'M', u'墳'),
+    (0xFA7E, 'M', u'奄'),
+    (0xFA7F, 'M', u'奔'),
+    (0xFA80, 'M', u'婢'),
+    (0xFA81, 'M', u'嬨'),
+    ]
+
+def _seg_43():
+    return [
+    (0xFA82, 'M', u'廒'),
+    (0xFA83, 'M', u'廙'),
+    (0xFA84, 'M', u'彩'),
+    (0xFA85, 'M', u'徭'),
+    (0xFA86, 'M', u'惘'),
+    (0xFA87, 'M', u'慎'),
+    (0xFA88, 'M', u'愈'),
+    (0xFA89, 'M', u'憎'),
+    (0xFA8A, 'M', u'慠'),
+    (0xFA8B, 'M', u'懲'),
+    (0xFA8C, 'M', u'戴'),
+    (0xFA8D, 'M', u'揄'),
+    (0xFA8E, 'M', u'搜'),
+    (0xFA8F, 'M', u'摒'),
+    (0xFA90, 'M', u'敖'),
+    (0xFA91, 'M', u'晴'),
+    (0xFA92, 'M', u'朗'),
+    (0xFA93, 'M', u'望'),
+    (0xFA94, 'M', u'杖'),
+    (0xFA95, 'M', u'歹'),
+    (0xFA96, 'M', u'殺'),
+    (0xFA97, 'M', u'流'),
+    (0xFA98, 'M', u'滛'),
+    (0xFA99, 'M', u'滋'),
+    (0xFA9A, 'M', u'漢'),
+    (0xFA9B, 'M', u'瀞'),
+    (0xFA9C, 'M', u'煮'),
+    (0xFA9D, 'M', u'瞧'),
+    (0xFA9E, 'M', u'爵'),
+    (0xFA9F, 'M', u'犯'),
+    (0xFAA0, 'M', u'猪'),
+    (0xFAA1, 'M', u'瑱'),
+    (0xFAA2, 'M', u'甆'),
+    (0xFAA3, 'M', u'画'),
+    (0xFAA4, 'M', u'瘝'),
+    (0xFAA5, 'M', u'瘟'),
+    (0xFAA6, 'M', u'益'),
+    (0xFAA7, 'M', u'盛'),
+    (0xFAA8, 'M', u'直'),
+    (0xFAA9, 'M', u'睊'),
+    (0xFAAA, 'M', u'着'),
+    (0xFAAB, 'M', u'磌'),
+    (0xFAAC, 'M', u'窱'),
+    (0xFAAD, 'M', u'節'),
+    (0xFAAE, 'M', u'类'),
+    (0xFAAF, 'M', u'絛'),
+    (0xFAB0, 'M', u'練'),
+    (0xFAB1, 'M', u'缾'),
+    (0xFAB2, 'M', u'者'),
+    (0xFAB3, 'M', u'荒'),
+    (0xFAB4, 'M', u'華'),
+    (0xFAB5, 'M', u'蝹'),
+    (0xFAB6, 'M', u'襁'),
+    (0xFAB7, 'M', u'覆'),
+    (0xFAB8, 'M', u'視'),
+    (0xFAB9, 'M', u'調'),
+    (0xFABA, 'M', u'諸'),
+    (0xFABB, 'M', u'請'),
+    (0xFABC, 'M', u'謁'),
+    (0xFABD, 'M', u'諾'),
+    (0xFABE, 'M', u'諭'),
+    (0xFABF, 'M', u'謹'),
+    (0xFAC0, 'M', u'變'),
+    (0xFAC1, 'M', u'贈'),
+    (0xFAC2, 'M', u'輸'),
+    (0xFAC3, 'M', u'遲'),
+    (0xFAC4, 'M', u'醙'),
+    (0xFAC5, 'M', u'鉶'),
+    (0xFAC6, 'M', u'陼'),
+    (0xFAC7, 'M', u'難'),
+    (0xFAC8, 'M', u'靖'),
+    (0xFAC9, 'M', u'韛'),
+    (0xFACA, 'M', u'響'),
+    (0xFACB, 'M', u'頋'),
+    (0xFACC, 'M', u'頻'),
+    (0xFACD, 'M', u'鬒'),
+    (0xFACE, 'M', u'龜'),
+    (0xFACF, 'M', u'𢡊'),
+    (0xFAD0, 'M', u'𢡄'),
+    (0xFAD1, 'M', u'𣏕'),
+    (0xFAD2, 'M', u'㮝'),
+    (0xFAD3, 'M', u'䀘'),
+    (0xFAD4, 'M', u'䀹'),
+    (0xFAD5, 'M', u'𥉉'),
+    (0xFAD6, 'M', u'𥳐'),
+    (0xFAD7, 'M', u'𧻓'),
+    (0xFAD8, 'M', u'齃'),
+    (0xFAD9, 'M', u'龎'),
+    (0xFADA, 'X'),
+    (0xFB00, 'M', u'ff'),
+    (0xFB01, 'M', u'fi'),
+    (0xFB02, 'M', u'fl'),
+    (0xFB03, 'M', u'ffi'),
+    (0xFB04, 'M', u'ffl'),
+    (0xFB05, 'M', u'st'),
+    (0xFB07, 'X'),
+    (0xFB13, 'M', u'մն'),
+    (0xFB14, 'M', u'մե'),
+    (0xFB15, 'M', u'մի'),
+    (0xFB16, 'M', u'վն'),
+    ]
+
+def _seg_44():
+    return [
+    (0xFB17, 'M', u'մխ'),
+    (0xFB18, 'X'),
+    (0xFB1D, 'M', u'יִ'),
+    (0xFB1E, 'V'),
+    (0xFB1F, 'M', u'ײַ'),
+    (0xFB20, 'M', u'ע'),
+    (0xFB21, 'M', u'א'),
+    (0xFB22, 'M', u'ד'),
+    (0xFB23, 'M', u'ה'),
+    (0xFB24, 'M', u'כ'),
+    (0xFB25, 'M', u'ל'),
+    (0xFB26, 'M', u'ם'),
+    (0xFB27, 'M', u'ר'),
+    (0xFB28, 'M', u'ת'),
+    (0xFB29, '3', u'+'),
+    (0xFB2A, 'M', u'שׁ'),
+    (0xFB2B, 'M', u'שׂ'),
+    (0xFB2C, 'M', u'שּׁ'),
+    (0xFB2D, 'M', u'שּׂ'),
+    (0xFB2E, 'M', u'אַ'),
+    (0xFB2F, 'M', u'אָ'),
+    (0xFB30, 'M', u'אּ'),
+    (0xFB31, 'M', u'בּ'),
+    (0xFB32, 'M', u'גּ'),
+    (0xFB33, 'M', u'דּ'),
+    (0xFB34, 'M', u'הּ'),
+    (0xFB35, 'M', u'וּ'),
+    (0xFB36, 'M', u'זּ'),
+    (0xFB37, 'X'),
+    (0xFB38, 'M', u'טּ'),
+    (0xFB39, 'M', u'יּ'),
+    (0xFB3A, 'M', u'ךּ'),
+    (0xFB3B, 'M', u'כּ'),
+    (0xFB3C, 'M', u'לּ'),
+    (0xFB3D, 'X'),
+    (0xFB3E, 'M', u'מּ'),
+    (0xFB3F, 'X'),
+    (0xFB40, 'M', u'נּ'),
+    (0xFB41, 'M', u'סּ'),
+    (0xFB42, 'X'),
+    (0xFB43, 'M', u'ףּ'),
+    (0xFB44, 'M', u'פּ'),
+    (0xFB45, 'X'),
+    (0xFB46, 'M', u'צּ'),
+    (0xFB47, 'M', u'קּ'),
+    (0xFB48, 'M', u'רּ'),
+    (0xFB49, 'M', u'שּ'),
+    (0xFB4A, 'M', u'תּ'),
+    (0xFB4B, 'M', u'וֹ'),
+    (0xFB4C, 'M', u'בֿ'),
+    (0xFB4D, 'M', u'כֿ'),
+    (0xFB4E, 'M', u'פֿ'),
+    (0xFB4F, 'M', u'אל'),
+    (0xFB50, 'M', u'ٱ'),
+    (0xFB52, 'M', u'ٻ'),
+    (0xFB56, 'M', u'پ'),
+    (0xFB5A, 'M', u'ڀ'),
+    (0xFB5E, 'M', u'ٺ'),
+    (0xFB62, 'M', u'ٿ'),
+    (0xFB66, 'M', u'ٹ'),
+    (0xFB6A, 'M', u'ڤ'),
+    (0xFB6E, 'M', u'ڦ'),
+    (0xFB72, 'M', u'ڄ'),
+    (0xFB76, 'M', u'ڃ'),
+    (0xFB7A, 'M', u'چ'),
+    (0xFB7E, 'M', u'ڇ'),
+    (0xFB82, 'M', u'ڍ'),
+    (0xFB84, 'M', u'ڌ'),
+    (0xFB86, 'M', u'ڎ'),
+    (0xFB88, 'M', u'ڈ'),
+    (0xFB8A, 'M', u'ژ'),
+    (0xFB8C, 'M', u'ڑ'),
+    (0xFB8E, 'M', u'ک'),
+    (0xFB92, 'M', u'گ'),
+    (0xFB96, 'M', u'ڳ'),
+    (0xFB9A, 'M', u'ڱ'),
+    (0xFB9E, 'M', u'ں'),
+    (0xFBA0, 'M', u'ڻ'),
+    (0xFBA4, 'M', u'ۀ'),
+    (0xFBA6, 'M', u'ہ'),
+    (0xFBAA, 'M', u'ھ'),
+    (0xFBAE, 'M', u'ے'),
+    (0xFBB0, 'M', u'ۓ'),
+    (0xFBB2, 'V'),
+    (0xFBC2, 'X'),
+    (0xFBD3, 'M', u'ڭ'),
+    (0xFBD7, 'M', u'ۇ'),
+    (0xFBD9, 'M', u'ۆ'),
+    (0xFBDB, 'M', u'ۈ'),
+    (0xFBDD, 'M', u'ۇٴ'),
+    (0xFBDE, 'M', u'ۋ'),
+    (0xFBE0, 'M', u'ۅ'),
+    (0xFBE2, 'M', u'ۉ'),
+    (0xFBE4, 'M', u'ې'),
+    (0xFBE8, 'M', u'ى'),
+    (0xFBEA, 'M', u'ئا'),
+    (0xFBEC, 'M', u'ئە'),
+    (0xFBEE, 'M', u'ئو'),
+    (0xFBF0, 'M', u'ئۇ'),
+    (0xFBF2, 'M', u'ئۆ'),
+    ]
+
+def _seg_45():
+    return [
+    (0xFBF4, 'M', u'ئۈ'),
+    (0xFBF6, 'M', u'ئې'),
+    (0xFBF9, 'M', u'ئى'),
+    (0xFBFC, 'M', u'ی'),
+    (0xFC00, 'M', u'ئج'),
+    (0xFC01, 'M', u'ئح'),
+    (0xFC02, 'M', u'ئم'),
+    (0xFC03, 'M', u'ئى'),
+    (0xFC04, 'M', u'ئي'),
+    (0xFC05, 'M', u'بج'),
+    (0xFC06, 'M', u'بح'),
+    (0xFC07, 'M', u'بخ'),
+    (0xFC08, 'M', u'بم'),
+    (0xFC09, 'M', u'بى'),
+    (0xFC0A, 'M', u'بي'),
+    (0xFC0B, 'M', u'تج'),
+    (0xFC0C, 'M', u'تح'),
+    (0xFC0D, 'M', u'تخ'),
+    (0xFC0E, 'M', u'تم'),
+    (0xFC0F, 'M', u'تى'),
+    (0xFC10, 'M', u'تي'),
+    (0xFC11, 'M', u'ثج'),
+    (0xFC12, 'M', u'ثم'),
+    (0xFC13, 'M', u'ثى'),
+    (0xFC14, 'M', u'ثي'),
+    (0xFC15, 'M', u'جح'),
+    (0xFC16, 'M', u'جم'),
+    (0xFC17, 'M', u'حج'),
+    (0xFC18, 'M', u'حم'),
+    (0xFC19, 'M', u'خج'),
+    (0xFC1A, 'M', u'خح'),
+    (0xFC1B, 'M', u'خم'),
+    (0xFC1C, 'M', u'سج'),
+    (0xFC1D, 'M', u'سح'),
+    (0xFC1E, 'M', u'سخ'),
+    (0xFC1F, 'M', u'سم'),
+    (0xFC20, 'M', u'صح'),
+    (0xFC21, 'M', u'صم'),
+    (0xFC22, 'M', u'ضج'),
+    (0xFC23, 'M', u'ضح'),
+    (0xFC24, 'M', u'ضخ'),
+    (0xFC25, 'M', u'ضم'),
+    (0xFC26, 'M', u'طح'),
+    (0xFC27, 'M', u'طم'),
+    (0xFC28, 'M', u'ظم'),
+    (0xFC29, 'M', u'عج'),
+    (0xFC2A, 'M', u'عم'),
+    (0xFC2B, 'M', u'غج'),
+    (0xFC2C, 'M', u'غم'),
+    (0xFC2D, 'M', u'فج'),
+    (0xFC2E, 'M', u'فح'),
+    (0xFC2F, 'M', u'فخ'),
+    (0xFC30, 'M', u'فم'),
+    (0xFC31, 'M', u'فى'),
+    (0xFC32, 'M', u'في'),
+    (0xFC33, 'M', u'قح'),
+    (0xFC34, 'M', u'قم'),
+    (0xFC35, 'M', u'قى'),
+    (0xFC36, 'M', u'قي'),
+    (0xFC37, 'M', u'كا'),
+    (0xFC38, 'M', u'كج'),
+    (0xFC39, 'M', u'كح'),
+    (0xFC3A, 'M', u'كخ'),
+    (0xFC3B, 'M', u'كل'),
+    (0xFC3C, 'M', u'كم'),
+    (0xFC3D, 'M', u'كى'),
+    (0xFC3E, 'M', u'كي'),
+    (0xFC3F, 'M', u'لج'),
+    (0xFC40, 'M', u'لح'),
+    (0xFC41, 'M', u'لخ'),
+    (0xFC42, 'M', u'لم'),
+    (0xFC43, 'M', u'لى'),
+    (0xFC44, 'M', u'لي'),
+    (0xFC45, 'M', u'مج'),
+    (0xFC46, 'M', u'مح'),
+    (0xFC47, 'M', u'مخ'),
+    (0xFC48, 'M', u'مم'),
+    (0xFC49, 'M', u'مى'),
+    (0xFC4A, 'M', u'مي'),
+    (0xFC4B, 'M', u'نج'),
+    (0xFC4C, 'M', u'نح'),
+    (0xFC4D, 'M', u'نخ'),
+    (0xFC4E, 'M', u'نم'),
+    (0xFC4F, 'M', u'نى'),
+    (0xFC50, 'M', u'ني'),
+    (0xFC51, 'M', u'هج'),
+    (0xFC52, 'M', u'هم'),
+    (0xFC53, 'M', u'هى'),
+    (0xFC54, 'M', u'هي'),
+    (0xFC55, 'M', u'يج'),
+    (0xFC56, 'M', u'يح'),
+    (0xFC57, 'M', u'يخ'),
+    (0xFC58, 'M', u'يم'),
+    (0xFC59, 'M', u'يى'),
+    (0xFC5A, 'M', u'يي'),
+    (0xFC5B, 'M', u'ذٰ'),
+    (0xFC5C, 'M', u'رٰ'),
+    (0xFC5D, 'M', u'ىٰ'),
+    (0xFC5E, '3', u' ٌّ'),
+    (0xFC5F, '3', u' ٍّ'),
+    ]
+
+def _seg_46():
+    return [
+    (0xFC60, '3', u' َّ'),
+    (0xFC61, '3', u' ُّ'),
+    (0xFC62, '3', u' ِّ'),
+    (0xFC63, '3', u' ّٰ'),
+    (0xFC64, 'M', u'ئر'),
+    (0xFC65, 'M', u'ئز'),
+    (0xFC66, 'M', u'ئم'),
+    (0xFC67, 'M', u'ئن'),
+    (0xFC68, 'M', u'ئى'),
+    (0xFC69, 'M', u'ئي'),
+    (0xFC6A, 'M', u'بر'),
+    (0xFC6B, 'M', u'بز'),
+    (0xFC6C, 'M', u'بم'),
+    (0xFC6D, 'M', u'بن'),
+    (0xFC6E, 'M', u'بى'),
+    (0xFC6F, 'M', u'بي'),
+    (0xFC70, 'M', u'تر'),
+    (0xFC71, 'M', u'تز'),
+    (0xFC72, 'M', u'تم'),
+    (0xFC73, 'M', u'تن'),
+    (0xFC74, 'M', u'تى'),
+    (0xFC75, 'M', u'تي'),
+    (0xFC76, 'M', u'ثر'),
+    (0xFC77, 'M', u'ثز'),
+    (0xFC78, 'M', u'ثم'),
+    (0xFC79, 'M', u'ثن'),
+    (0xFC7A, 'M', u'ثى'),
+    (0xFC7B, 'M', u'ثي'),
+    (0xFC7C, 'M', u'فى'),
+    (0xFC7D, 'M', u'في'),
+    (0xFC7E, 'M', u'قى'),
+    (0xFC7F, 'M', u'قي'),
+    (0xFC80, 'M', u'كا'),
+    (0xFC81, 'M', u'كل'),
+    (0xFC82, 'M', u'كم'),
+    (0xFC83, 'M', u'كى'),
+    (0xFC84, 'M', u'كي'),
+    (0xFC85, 'M', u'لم'),
+    (0xFC86, 'M', u'لى'),
+    (0xFC87, 'M', u'لي'),
+    (0xFC88, 'M', u'ما'),
+    (0xFC89, 'M', u'مم'),
+    (0xFC8A, 'M', u'نر'),
+    (0xFC8B, 'M', u'نز'),
+    (0xFC8C, 'M', u'نم'),
+    (0xFC8D, 'M', u'نن'),
+    (0xFC8E, 'M', u'نى'),
+    (0xFC8F, 'M', u'ني'),
+    (0xFC90, 'M', u'ىٰ'),
+    (0xFC91, 'M', u'ير'),
+    (0xFC92, 'M', u'يز'),
+    (0xFC93, 'M', u'يم'),
+    (0xFC94, 'M', u'ين'),
+    (0xFC95, 'M', u'يى'),
+    (0xFC96, 'M', u'يي'),
+    (0xFC97, 'M', u'ئج'),
+    (0xFC98, 'M', u'ئح'),
+    (0xFC99, 'M', u'ئخ'),
+    (0xFC9A, 'M', u'ئم'),
+    (0xFC9B, 'M', u'ئه'),
+    (0xFC9C, 'M', u'بج'),
+    (0xFC9D, 'M', u'بح'),
+    (0xFC9E, 'M', u'بخ'),
+    (0xFC9F, 'M', u'بم'),
+    (0xFCA0, 'M', u'به'),
+    (0xFCA1, 'M', u'تج'),
+    (0xFCA2, 'M', u'تح'),
+    (0xFCA3, 'M', u'تخ'),
+    (0xFCA4, 'M', u'تم'),
+    (0xFCA5, 'M', u'ته'),
+    (0xFCA6, 'M', u'ثم'),
+    (0xFCA7, 'M', u'جح'),
+    (0xFCA8, 'M', u'جم'),
+    (0xFCA9, 'M', u'حج'),
+    (0xFCAA, 'M', u'حم'),
+    (0xFCAB, 'M', u'خج'),
+    (0xFCAC, 'M', u'خم'),
+    (0xFCAD, 'M', u'سج'),
+    (0xFCAE, 'M', u'سح'),
+    (0xFCAF, 'M', u'سخ'),
+    (0xFCB0, 'M', u'سم'),
+    (0xFCB1, 'M', u'صح'),
+    (0xFCB2, 'M', u'صخ'),
+    (0xFCB3, 'M', u'صم'),
+    (0xFCB4, 'M', u'ضج'),
+    (0xFCB5, 'M', u'ضح'),
+    (0xFCB6, 'M', u'ضخ'),
+    (0xFCB7, 'M', u'ضم'),
+    (0xFCB8, 'M', u'طح'),
+    (0xFCB9, 'M', u'ظم'),
+    (0xFCBA, 'M', u'عج'),
+    (0xFCBB, 'M', u'عم'),
+    (0xFCBC, 'M', u'غج'),
+    (0xFCBD, 'M', u'غم'),
+    (0xFCBE, 'M', u'فج'),
+    (0xFCBF, 'M', u'فح'),
+    (0xFCC0, 'M', u'فخ'),
+    (0xFCC1, 'M', u'فم'),
+    (0xFCC2, 'M', u'قح'),
+    (0xFCC3, 'M', u'قم'),
+    ]
+
+def _seg_47():
+    return [
+    (0xFCC4, 'M', u'كج'),
+    (0xFCC5, 'M', u'كح'),
+    (0xFCC6, 'M', u'كخ'),
+    (0xFCC7, 'M', u'كل'),
+    (0xFCC8, 'M', u'كم'),
+    (0xFCC9, 'M', u'لج'),
+    (0xFCCA, 'M', u'لح'),
+    (0xFCCB, 'M', u'لخ'),
+    (0xFCCC, 'M', u'لم'),
+    (0xFCCD, 'M', u'له'),
+    (0xFCCE, 'M', u'مج'),
+    (0xFCCF, 'M', u'مح'),
+    (0xFCD0, 'M', u'مخ'),
+    (0xFCD1, 'M', u'مم'),
+    (0xFCD2, 'M', u'نج'),
+    (0xFCD3, 'M', u'نح'),
+    (0xFCD4, 'M', u'نخ'),
+    (0xFCD5, 'M', u'نم'),
+    (0xFCD6, 'M', u'نه'),
+    (0xFCD7, 'M', u'هج'),
+    (0xFCD8, 'M', u'هم'),
+    (0xFCD9, 'M', u'هٰ'),
+    (0xFCDA, 'M', u'يج'),
+    (0xFCDB, 'M', u'يح'),
+    (0xFCDC, 'M', u'يخ'),
+    (0xFCDD, 'M', u'يم'),
+    (0xFCDE, 'M', u'يه'),
+    (0xFCDF, 'M', u'ئم'),
+    (0xFCE0, 'M', u'ئه'),
+    (0xFCE1, 'M', u'بم'),
+    (0xFCE2, 'M', u'به'),
+    (0xFCE3, 'M', u'تم'),
+    (0xFCE4, 'M', u'ته'),
+    (0xFCE5, 'M', u'ثم'),
+    (0xFCE6, 'M', u'ثه'),
+    (0xFCE7, 'M', u'سم'),
+    (0xFCE8, 'M', u'سه'),
+    (0xFCE9, 'M', u'شم'),
+    (0xFCEA, 'M', u'شه'),
+    (0xFCEB, 'M', u'كل'),
+    (0xFCEC, 'M', u'كم'),
+    (0xFCED, 'M', u'لم'),
+    (0xFCEE, 'M', u'نم'),
+    (0xFCEF, 'M', u'نه'),
+    (0xFCF0, 'M', u'يم'),
+    (0xFCF1, 'M', u'يه'),
+    (0xFCF2, 'M', u'ـَّ'),
+    (0xFCF3, 'M', u'ـُّ'),
+    (0xFCF4, 'M', u'ـِّ'),
+    (0xFCF5, 'M', u'طى'),
+    (0xFCF6, 'M', u'طي'),
+    (0xFCF7, 'M', u'عى'),
+    (0xFCF8, 'M', u'عي'),
+    (0xFCF9, 'M', u'غى'),
+    (0xFCFA, 'M', u'غي'),
+    (0xFCFB, 'M', u'سى'),
+    (0xFCFC, 'M', u'سي'),
+    (0xFCFD, 'M', u'شى'),
+    (0xFCFE, 'M', u'شي'),
+    (0xFCFF, 'M', u'حى'),
+    (0xFD00, 'M', u'حي'),
+    (0xFD01, 'M', u'جى'),
+    (0xFD02, 'M', u'جي'),
+    (0xFD03, 'M', u'خى'),
+    (0xFD04, 'M', u'خي'),
+    (0xFD05, 'M', u'صى'),
+    (0xFD06, 'M', u'صي'),
+    (0xFD07, 'M', u'ضى'),
+    (0xFD08, 'M', u'ضي'),
+    (0xFD09, 'M', u'شج'),
+    (0xFD0A, 'M', u'شح'),
+    (0xFD0B, 'M', u'شخ'),
+    (0xFD0C, 'M', u'شم'),
+    (0xFD0D, 'M', u'شر'),
+    (0xFD0E, 'M', u'سر'),
+    (0xFD0F, 'M', u'صر'),
+    (0xFD10, 'M', u'ضر'),
+    (0xFD11, 'M', u'طى'),
+    (0xFD12, 'M', u'طي'),
+    (0xFD13, 'M', u'عى'),
+    (0xFD14, 'M', u'عي'),
+    (0xFD15, 'M', u'غى'),
+    (0xFD16, 'M', u'غي'),
+    (0xFD17, 'M', u'سى'),
+    (0xFD18, 'M', u'سي'),
+    (0xFD19, 'M', u'شى'),
+    (0xFD1A, 'M', u'شي'),
+    (0xFD1B, 'M', u'حى'),
+    (0xFD1C, 'M', u'حي'),
+    (0xFD1D, 'M', u'جى'),
+    (0xFD1E, 'M', u'جي'),
+    (0xFD1F, 'M', u'خى'),
+    (0xFD20, 'M', u'خي'),
+    (0xFD21, 'M', u'صى'),
+    (0xFD22, 'M', u'صي'),
+    (0xFD23, 'M', u'ضى'),
+    (0xFD24, 'M', u'ضي'),
+    (0xFD25, 'M', u'شج'),
+    (0xFD26, 'M', u'شح'),
+    (0xFD27, 'M', u'شخ'),
+    ]
+
+def _seg_48():
+    return [
+    (0xFD28, 'M', u'شم'),
+    (0xFD29, 'M', u'شر'),
+    (0xFD2A, 'M', u'سر'),
+    (0xFD2B, 'M', u'صر'),
+    (0xFD2C, 'M', u'ضر'),
+    (0xFD2D, 'M', u'شج'),
+    (0xFD2E, 'M', u'شح'),
+    (0xFD2F, 'M', u'شخ'),
+    (0xFD30, 'M', u'شم'),
+    (0xFD31, 'M', u'سه'),
+    (0xFD32, 'M', u'شه'),
+    (0xFD33, 'M', u'طم'),
+    (0xFD34, 'M', u'سج'),
+    (0xFD35, 'M', u'سح'),
+    (0xFD36, 'M', u'سخ'),
+    (0xFD37, 'M', u'شج'),
+    (0xFD38, 'M', u'شح'),
+    (0xFD39, 'M', u'شخ'),
+    (0xFD3A, 'M', u'طم'),
+    (0xFD3B, 'M', u'ظم'),
+    (0xFD3C, 'M', u'اً'),
+    (0xFD3E, 'V'),
+    (0xFD40, 'X'),
+    (0xFD50, 'M', u'تجم'),
+    (0xFD51, 'M', u'تحج'),
+    (0xFD53, 'M', u'تحم'),
+    (0xFD54, 'M', u'تخم'),
+    (0xFD55, 'M', u'تمج'),
+    (0xFD56, 'M', u'تمح'),
+    (0xFD57, 'M', u'تمخ'),
+    (0xFD58, 'M', u'جمح'),
+    (0xFD5A, 'M', u'حمي'),
+    (0xFD5B, 'M', u'حمى'),
+    (0xFD5C, 'M', u'سحج'),
+    (0xFD5D, 'M', u'سجح'),
+    (0xFD5E, 'M', u'سجى'),
+    (0xFD5F, 'M', u'سمح'),
+    (0xFD61, 'M', u'سمج'),
+    (0xFD62, 'M', u'سمم'),
+    (0xFD64, 'M', u'صحح'),
+    (0xFD66, 'M', u'صمم'),
+    (0xFD67, 'M', u'شحم'),
+    (0xFD69, 'M', u'شجي'),
+    (0xFD6A, 'M', u'شمخ'),
+    (0xFD6C, 'M', u'شمم'),
+    (0xFD6E, 'M', u'ضحى'),
+    (0xFD6F, 'M', u'ضخم'),
+    (0xFD71, 'M', u'طمح'),
+    (0xFD73, 'M', u'طمم'),
+    (0xFD74, 'M', u'طمي'),
+    (0xFD75, 'M', u'عجم'),
+    (0xFD76, 'M', u'عمم'),
+    (0xFD78, 'M', u'عمى'),
+    (0xFD79, 'M', u'غمم'),
+    (0xFD7A, 'M', u'غمي'),
+    (0xFD7B, 'M', u'غمى'),
+    (0xFD7C, 'M', u'فخم'),
+    (0xFD7E, 'M', u'قمح'),
+    (0xFD7F, 'M', u'قمم'),
+    (0xFD80, 'M', u'لحم'),
+    (0xFD81, 'M', u'لحي'),
+    (0xFD82, 'M', u'لحى'),
+    (0xFD83, 'M', u'لجج'),
+    (0xFD85, 'M', u'لخم'),
+    (0xFD87, 'M', u'لمح'),
+    (0xFD89, 'M', u'محج'),
+    (0xFD8A, 'M', u'محم'),
+    (0xFD8B, 'M', u'محي'),
+    (0xFD8C, 'M', u'مجح'),
+    (0xFD8D, 'M', u'مجم'),
+    (0xFD8E, 'M', u'مخج'),
+    (0xFD8F, 'M', u'مخم'),
+    (0xFD90, 'X'),
+    (0xFD92, 'M', u'مجخ'),
+    (0xFD93, 'M', u'همج'),
+    (0xFD94, 'M', u'همم'),
+    (0xFD95, 'M', u'نحم'),
+    (0xFD96, 'M', u'نحى'),
+    (0xFD97, 'M', u'نجم'),
+    (0xFD99, 'M', u'نجى'),
+    (0xFD9A, 'M', u'نمي'),
+    (0xFD9B, 'M', u'نمى'),
+    (0xFD9C, 'M', u'يمم'),
+    (0xFD9E, 'M', u'بخي'),
+    (0xFD9F, 'M', u'تجي'),
+    (0xFDA0, 'M', u'تجى'),
+    (0xFDA1, 'M', u'تخي'),
+    (0xFDA2, 'M', u'تخى'),
+    (0xFDA3, 'M', u'تمي'),
+    (0xFDA4, 'M', u'تمى'),
+    (0xFDA5, 'M', u'جمي'),
+    (0xFDA6, 'M', u'جحى'),
+    (0xFDA7, 'M', u'جمى'),
+    (0xFDA8, 'M', u'سخى'),
+    (0xFDA9, 'M', u'صحي'),
+    (0xFDAA, 'M', u'شحي'),
+    (0xFDAB, 'M', u'ضحي'),
+    (0xFDAC, 'M', u'لجي'),
+    (0xFDAD, 'M', u'لمي'),
+    (0xFDAE, 'M', u'يحي'),
+    ]
+
+def _seg_49():
+    return [
+    (0xFDAF, 'M', u'يجي'),
+    (0xFDB0, 'M', u'يمي'),
+    (0xFDB1, 'M', u'ممي'),
+    (0xFDB2, 'M', u'قمي'),
+    (0xFDB3, 'M', u'نحي'),
+    (0xFDB4, 'M', u'قمح'),
+    (0xFDB5, 'M', u'لحم'),
+    (0xFDB6, 'M', u'عمي'),
+    (0xFDB7, 'M', u'كمي'),
+    (0xFDB8, 'M', u'نجح'),
+    (0xFDB9, 'M', u'مخي'),
+    (0xFDBA, 'M', u'لجم'),
+    (0xFDBB, 'M', u'كمم'),
+    (0xFDBC, 'M', u'لجم'),
+    (0xFDBD, 'M', u'نجح'),
+    (0xFDBE, 'M', u'جحي'),
+    (0xFDBF, 'M', u'حجي'),
+    (0xFDC0, 'M', u'مجي'),
+    (0xFDC1, 'M', u'فمي'),
+    (0xFDC2, 'M', u'بحي'),
+    (0xFDC3, 'M', u'كمم'),
+    (0xFDC4, 'M', u'عجم'),
+    (0xFDC5, 'M', u'صمم'),
+    (0xFDC6, 'M', u'سخي'),
+    (0xFDC7, 'M', u'نجي'),
+    (0xFDC8, 'X'),
+    (0xFDF0, 'M', u'صلے'),
+    (0xFDF1, 'M', u'قلے'),
+    (0xFDF2, 'M', u'الله'),
+    (0xFDF3, 'M', u'اكبر'),
+    (0xFDF4, 'M', u'محمد'),
+    (0xFDF5, 'M', u'صلعم'),
+    (0xFDF6, 'M', u'رسول'),
+    (0xFDF7, 'M', u'عليه'),
+    (0xFDF8, 'M', u'وسلم'),
+    (0xFDF9, 'M', u'صلى'),
+    (0xFDFA, '3', u'صلى الله عليه وسلم'),
+    (0xFDFB, '3', u'جل جلاله'),
+    (0xFDFC, 'M', u'ریال'),
+    (0xFDFD, 'V'),
+    (0xFDFE, 'X'),
+    (0xFE00, 'I'),
+    (0xFE10, '3', u','),
+    (0xFE11, 'M', u'、'),
+    (0xFE12, 'X'),
+    (0xFE13, '3', u':'),
+    (0xFE14, '3', u';'),
+    (0xFE15, '3', u'!'),
+    (0xFE16, '3', u'?'),
+    (0xFE17, 'M', u'〖'),
+    (0xFE18, 'M', u'〗'),
+    (0xFE19, 'X'),
+    (0xFE20, 'V'),
+    (0xFE30, 'X'),
+    (0xFE31, 'M', u'—'),
+    (0xFE32, 'M', u'–'),
+    (0xFE33, '3', u'_'),
+    (0xFE35, '3', u'('),
+    (0xFE36, '3', u')'),
+    (0xFE37, '3', u'{'),
+    (0xFE38, '3', u'}'),
+    (0xFE39, 'M', u'〔'),
+    (0xFE3A, 'M', u'〕'),
+    (0xFE3B, 'M', u'【'),
+    (0xFE3C, 'M', u'】'),
+    (0xFE3D, 'M', u'《'),
+    (0xFE3E, 'M', u'》'),
+    (0xFE3F, 'M', u'〈'),
+    (0xFE40, 'M', u'〉'),
+    (0xFE41, 'M', u'「'),
+    (0xFE42, 'M', u'」'),
+    (0xFE43, 'M', u'『'),
+    (0xFE44, 'M', u'』'),
+    (0xFE45, 'V'),
+    (0xFE47, '3', u'['),
+    (0xFE48, '3', u']'),
+    (0xFE49, '3', u' ̅'),
+    (0xFE4D, '3', u'_'),
+    (0xFE50, '3', u','),
+    (0xFE51, 'M', u'、'),
+    (0xFE52, 'X'),
+    (0xFE54, '3', u';'),
+    (0xFE55, '3', u':'),
+    (0xFE56, '3', u'?'),
+    (0xFE57, '3', u'!'),
+    (0xFE58, 'M', u'—'),
+    (0xFE59, '3', u'('),
+    (0xFE5A, '3', u')'),
+    (0xFE5B, '3', u'{'),
+    (0xFE5C, '3', u'}'),
+    (0xFE5D, 'M', u'〔'),
+    (0xFE5E, 'M', u'〕'),
+    (0xFE5F, '3', u'#'),
+    (0xFE60, '3', u'&'),
+    (0xFE61, '3', u'*'),
+    (0xFE62, '3', u'+'),
+    (0xFE63, 'M', u'-'),
+    (0xFE64, '3', u'<'),
+    (0xFE65, '3', u'>'),
+    (0xFE66, '3', u'='),
+    ]
+
+def _seg_50():
+    return [
+    (0xFE67, 'X'),
+    (0xFE68, '3', u'\\'),
+    (0xFE69, '3', u'$'),
+    (0xFE6A, '3', u'%'),
+    (0xFE6B, '3', u'@'),
+    (0xFE6C, 'X'),
+    (0xFE70, '3', u' ً'),
+    (0xFE71, 'M', u'ـً'),
+    (0xFE72, '3', u' ٌ'),
+    (0xFE73, 'V'),
+    (0xFE74, '3', u' ٍ'),
+    (0xFE75, 'X'),
+    (0xFE76, '3', u' َ'),
+    (0xFE77, 'M', u'ـَ'),
+    (0xFE78, '3', u' ُ'),
+    (0xFE79, 'M', u'ـُ'),
+    (0xFE7A, '3', u' ِ'),
+    (0xFE7B, 'M', u'ـِ'),
+    (0xFE7C, '3', u' ّ'),
+    (0xFE7D, 'M', u'ـّ'),
+    (0xFE7E, '3', u' ْ'),
+    (0xFE7F, 'M', u'ـْ'),
+    (0xFE80, 'M', u'ء'),
+    (0xFE81, 'M', u'آ'),
+    (0xFE83, 'M', u'أ'),
+    (0xFE85, 'M', u'ؤ'),
+    (0xFE87, 'M', u'إ'),
+    (0xFE89, 'M', u'ئ'),
+    (0xFE8D, 'M', u'ا'),
+    (0xFE8F, 'M', u'ب'),
+    (0xFE93, 'M', u'ة'),
+    (0xFE95, 'M', u'ت'),
+    (0xFE99, 'M', u'ث'),
+    (0xFE9D, 'M', u'ج'),
+    (0xFEA1, 'M', u'ح'),
+    (0xFEA5, 'M', u'خ'),
+    (0xFEA9, 'M', u'د'),
+    (0xFEAB, 'M', u'ذ'),
+    (0xFEAD, 'M', u'ر'),
+    (0xFEAF, 'M', u'ز'),
+    (0xFEB1, 'M', u'س'),
+    (0xFEB5, 'M', u'ش'),
+    (0xFEB9, 'M', u'ص'),
+    (0xFEBD, 'M', u'ض'),
+    (0xFEC1, 'M', u'ط'),
+    (0xFEC5, 'M', u'ظ'),
+    (0xFEC9, 'M', u'ع'),
+    (0xFECD, 'M', u'غ'),
+    (0xFED1, 'M', u'ف'),
+    (0xFED5, 'M', u'ق'),
+    (0xFED9, 'M', u'ك'),
+    (0xFEDD, 'M', u'ل'),
+    (0xFEE1, 'M', u'م'),
+    (0xFEE5, 'M', u'ن'),
+    (0xFEE9, 'M', u'ه'),
+    (0xFEED, 'M', u'و'),
+    (0xFEEF, 'M', u'ى'),
+    (0xFEF1, 'M', u'ي'),
+    (0xFEF5, 'M', u'لآ'),
+    (0xFEF7, 'M', u'لأ'),
+    (0xFEF9, 'M', u'لإ'),
+    (0xFEFB, 'M', u'لا'),
+    (0xFEFD, 'X'),
+    (0xFEFF, 'I'),
+    (0xFF00, 'X'),
+    (0xFF01, '3', u'!'),
+    (0xFF02, '3', u'"'),
+    (0xFF03, '3', u'#'),
+    (0xFF04, '3', u'$'),
+    (0xFF05, '3', u'%'),
+    (0xFF06, '3', u'&'),
+    (0xFF07, '3', u'\''),
+    (0xFF08, '3', u'('),
+    (0xFF09, '3', u')'),
+    (0xFF0A, '3', u'*'),
+    (0xFF0B, '3', u'+'),
+    (0xFF0C, '3', u','),
+    (0xFF0D, 'M', u'-'),
+    (0xFF0E, 'M', u'.'),
+    (0xFF0F, '3', u'/'),
+    (0xFF10, 'M', u'0'),
+    (0xFF11, 'M', u'1'),
+    (0xFF12, 'M', u'2'),
+    (0xFF13, 'M', u'3'),
+    (0xFF14, 'M', u'4'),
+    (0xFF15, 'M', u'5'),
+    (0xFF16, 'M', u'6'),
+    (0xFF17, 'M', u'7'),
+    (0xFF18, 'M', u'8'),
+    (0xFF19, 'M', u'9'),
+    (0xFF1A, '3', u':'),
+    (0xFF1B, '3', u';'),
+    (0xFF1C, '3', u'<'),
+    (0xFF1D, '3', u'='),
+    (0xFF1E, '3', u'>'),
+    (0xFF1F, '3', u'?'),
+    (0xFF20, '3', u'@'),
+    (0xFF21, 'M', u'a'),
+    (0xFF22, 'M', u'b'),
+    (0xFF23, 'M', u'c'),
+    ]
+
+def _seg_51():
+    return [
+    (0xFF24, 'M', u'd'),
+    (0xFF25, 'M', u'e'),
+    (0xFF26, 'M', u'f'),
+    (0xFF27, 'M', u'g'),
+    (0xFF28, 'M', u'h'),
+    (0xFF29, 'M', u'i'),
+    (0xFF2A, 'M', u'j'),
+    (0xFF2B, 'M', u'k'),
+    (0xFF2C, 'M', u'l'),
+    (0xFF2D, 'M', u'm'),
+    (0xFF2E, 'M', u'n'),
+    (0xFF2F, 'M', u'o'),
+    (0xFF30, 'M', u'p'),
+    (0xFF31, 'M', u'q'),
+    (0xFF32, 'M', u'r'),
+    (0xFF33, 'M', u's'),
+    (0xFF34, 'M', u't'),
+    (0xFF35, 'M', u'u'),
+    (0xFF36, 'M', u'v'),
+    (0xFF37, 'M', u'w'),
+    (0xFF38, 'M', u'x'),
+    (0xFF39, 'M', u'y'),
+    (0xFF3A, 'M', u'z'),
+    (0xFF3B, '3', u'['),
+    (0xFF3C, '3', u'\\'),
+    (0xFF3D, '3', u']'),
+    (0xFF3E, '3', u'^'),
+    (0xFF3F, '3', u'_'),
+    (0xFF40, '3', u'`'),
+    (0xFF41, 'M', u'a'),
+    (0xFF42, 'M', u'b'),
+    (0xFF43, 'M', u'c'),
+    (0xFF44, 'M', u'd'),
+    (0xFF45, 'M', u'e'),
+    (0xFF46, 'M', u'f'),
+    (0xFF47, 'M', u'g'),
+    (0xFF48, 'M', u'h'),
+    (0xFF49, 'M', u'i'),
+    (0xFF4A, 'M', u'j'),
+    (0xFF4B, 'M', u'k'),
+    (0xFF4C, 'M', u'l'),
+    (0xFF4D, 'M', u'm'),
+    (0xFF4E, 'M', u'n'),
+    (0xFF4F, 'M', u'o'),
+    (0xFF50, 'M', u'p'),
+    (0xFF51, 'M', u'q'),
+    (0xFF52, 'M', u'r'),
+    (0xFF53, 'M', u's'),
+    (0xFF54, 'M', u't'),
+    (0xFF55, 'M', u'u'),
+    (0xFF56, 'M', u'v'),
+    (0xFF57, 'M', u'w'),
+    (0xFF58, 'M', u'x'),
+    (0xFF59, 'M', u'y'),
+    (0xFF5A, 'M', u'z'),
+    (0xFF5B, '3', u'{'),
+    (0xFF5C, '3', u'|'),
+    (0xFF5D, '3', u'}'),
+    (0xFF5E, '3', u'~'),
+    (0xFF5F, 'M', u'⦅'),
+    (0xFF60, 'M', u'⦆'),
+    (0xFF61, 'M', u'.'),
+    (0xFF62, 'M', u'「'),
+    (0xFF63, 'M', u'」'),
+    (0xFF64, 'M', u'、'),
+    (0xFF65, 'M', u'・'),
+    (0xFF66, 'M', u'ヲ'),
+    (0xFF67, 'M', u'ァ'),
+    (0xFF68, 'M', u'ィ'),
+    (0xFF69, 'M', u'ゥ'),
+    (0xFF6A, 'M', u'ェ'),
+    (0xFF6B, 'M', u'ォ'),
+    (0xFF6C, 'M', u'ャ'),
+    (0xFF6D, 'M', u'ュ'),
+    (0xFF6E, 'M', u'ョ'),
+    (0xFF6F, 'M', u'ッ'),
+    (0xFF70, 'M', u'ー'),
+    (0xFF71, 'M', u'ア'),
+    (0xFF72, 'M', u'イ'),
+    (0xFF73, 'M', u'ウ'),
+    (0xFF74, 'M', u'エ'),
+    (0xFF75, 'M', u'オ'),
+    (0xFF76, 'M', u'カ'),
+    (0xFF77, 'M', u'キ'),
+    (0xFF78, 'M', u'ク'),
+    (0xFF79, 'M', u'ケ'),
+    (0xFF7A, 'M', u'コ'),
+    (0xFF7B, 'M', u'サ'),
+    (0xFF7C, 'M', u'シ'),
+    (0xFF7D, 'M', u'ス'),
+    (0xFF7E, 'M', u'セ'),
+    (0xFF7F, 'M', u'ソ'),
+    (0xFF80, 'M', u'タ'),
+    (0xFF81, 'M', u'チ'),
+    (0xFF82, 'M', u'ツ'),
+    (0xFF83, 'M', u'テ'),
+    (0xFF84, 'M', u'ト'),
+    (0xFF85, 'M', u'ナ'),
+    (0xFF86, 'M', u'ニ'),
+    (0xFF87, 'M', u'ヌ'),
+    ]
+
+def _seg_52():
+    return [
+    (0xFF88, 'M', u'ネ'),
+    (0xFF89, 'M', u'ノ'),
+    (0xFF8A, 'M', u'ハ'),
+    (0xFF8B, 'M', u'ヒ'),
+    (0xFF8C, 'M', u'フ'),
+    (0xFF8D, 'M', u'ヘ'),
+    (0xFF8E, 'M', u'ホ'),
+    (0xFF8F, 'M', u'マ'),
+    (0xFF90, 'M', u'ミ'),
+    (0xFF91, 'M', u'ム'),
+    (0xFF92, 'M', u'メ'),
+    (0xFF93, 'M', u'モ'),
+    (0xFF94, 'M', u'ヤ'),
+    (0xFF95, 'M', u'ユ'),
+    (0xFF96, 'M', u'ヨ'),
+    (0xFF97, 'M', u'ラ'),
+    (0xFF98, 'M', u'リ'),
+    (0xFF99, 'M', u'ル'),
+    (0xFF9A, 'M', u'レ'),
+    (0xFF9B, 'M', u'ロ'),
+    (0xFF9C, 'M', u'ワ'),
+    (0xFF9D, 'M', u'ン'),
+    (0xFF9E, 'M', u'゙'),
+    (0xFF9F, 'M', u'゚'),
+    (0xFFA0, 'X'),
+    (0xFFA1, 'M', u'ᄀ'),
+    (0xFFA2, 'M', u'ᄁ'),
+    (0xFFA3, 'M', u'ᆪ'),
+    (0xFFA4, 'M', u'ᄂ'),
+    (0xFFA5, 'M', u'ᆬ'),
+    (0xFFA6, 'M', u'ᆭ'),
+    (0xFFA7, 'M', u'ᄃ'),
+    (0xFFA8, 'M', u'ᄄ'),
+    (0xFFA9, 'M', u'ᄅ'),
+    (0xFFAA, 'M', u'ᆰ'),
+    (0xFFAB, 'M', u'ᆱ'),
+    (0xFFAC, 'M', u'ᆲ'),
+    (0xFFAD, 'M', u'ᆳ'),
+    (0xFFAE, 'M', u'ᆴ'),
+    (0xFFAF, 'M', u'ᆵ'),
+    (0xFFB0, 'M', u'ᄚ'),
+    (0xFFB1, 'M', u'ᄆ'),
+    (0xFFB2, 'M', u'ᄇ'),
+    (0xFFB3, 'M', u'ᄈ'),
+    (0xFFB4, 'M', u'ᄡ'),
+    (0xFFB5, 'M', u'ᄉ'),
+    (0xFFB6, 'M', u'ᄊ'),
+    (0xFFB7, 'M', u'ᄋ'),
+    (0xFFB8, 'M', u'ᄌ'),
+    (0xFFB9, 'M', u'ᄍ'),
+    (0xFFBA, 'M', u'ᄎ'),
+    (0xFFBB, 'M', u'ᄏ'),
+    (0xFFBC, 'M', u'ᄐ'),
+    (0xFFBD, 'M', u'ᄑ'),
+    (0xFFBE, 'M', u'ᄒ'),
+    (0xFFBF, 'X'),
+    (0xFFC2, 'M', u'ᅡ'),
+    (0xFFC3, 'M', u'ᅢ'),
+    (0xFFC4, 'M', u'ᅣ'),
+    (0xFFC5, 'M', u'ᅤ'),
+    (0xFFC6, 'M', u'ᅥ'),
+    (0xFFC7, 'M', u'ᅦ'),
+    (0xFFC8, 'X'),
+    (0xFFCA, 'M', u'ᅧ'),
+    (0xFFCB, 'M', u'ᅨ'),
+    (0xFFCC, 'M', u'ᅩ'),
+    (0xFFCD, 'M', u'ᅪ'),
+    (0xFFCE, 'M', u'ᅫ'),
+    (0xFFCF, 'M', u'ᅬ'),
+    (0xFFD0, 'X'),
+    (0xFFD2, 'M', u'ᅭ'),
+    (0xFFD3, 'M', u'ᅮ'),
+    (0xFFD4, 'M', u'ᅯ'),
+    (0xFFD5, 'M', u'ᅰ'),
+    (0xFFD6, 'M', u'ᅱ'),
+    (0xFFD7, 'M', u'ᅲ'),
+    (0xFFD8, 'X'),
+    (0xFFDA, 'M', u'ᅳ'),
+    (0xFFDB, 'M', u'ᅴ'),
+    (0xFFDC, 'M', u'ᅵ'),
+    (0xFFDD, 'X'),
+    (0xFFE0, 'M', u'¢'),
+    (0xFFE1, 'M', u'£'),
+    (0xFFE2, 'M', u'¬'),
+    (0xFFE3, '3', u' ̄'),
+    (0xFFE4, 'M', u'¦'),
+    (0xFFE5, 'M', u'¥'),
+    (0xFFE6, 'M', u'₩'),
+    (0xFFE7, 'X'),
+    (0xFFE8, 'M', u'│'),
+    (0xFFE9, 'M', u'←'),
+    (0xFFEA, 'M', u'↑'),
+    (0xFFEB, 'M', u'→'),
+    (0xFFEC, 'M', u'↓'),
+    (0xFFED, 'M', u'■'),
+    (0xFFEE, 'M', u'○'),
+    (0xFFEF, 'X'),
+    (0x10000, 'V'),
+    (0x1000C, 'X'),
+    (0x1000D, 'V'),
+    ]
+
+def _seg_53():
+    return [
+    (0x10027, 'X'),
+    (0x10028, 'V'),
+    (0x1003B, 'X'),
+    (0x1003C, 'V'),
+    (0x1003E, 'X'),
+    (0x1003F, 'V'),
+    (0x1004E, 'X'),
+    (0x10050, 'V'),
+    (0x1005E, 'X'),
+    (0x10080, 'V'),
+    (0x100FB, 'X'),
+    (0x10100, 'V'),
+    (0x10103, 'X'),
+    (0x10107, 'V'),
+    (0x10134, 'X'),
+    (0x10137, 'V'),
+    (0x1018F, 'X'),
+    (0x10190, 'V'),
+    (0x1019D, 'X'),
+    (0x101A0, 'V'),
+    (0x101A1, 'X'),
+    (0x101D0, 'V'),
+    (0x101FE, 'X'),
+    (0x10280, 'V'),
+    (0x1029D, 'X'),
+    (0x102A0, 'V'),
+    (0x102D1, 'X'),
+    (0x102E0, 'V'),
+    (0x102FC, 'X'),
+    (0x10300, 'V'),
+    (0x10324, 'X'),
+    (0x1032D, 'V'),
+    (0x1034B, 'X'),
+    (0x10350, 'V'),
+    (0x1037B, 'X'),
+    (0x10380, 'V'),
+    (0x1039E, 'X'),
+    (0x1039F, 'V'),
+    (0x103C4, 'X'),
+    (0x103C8, 'V'),
+    (0x103D6, 'X'),
+    (0x10400, 'M', u'𐐨'),
+    (0x10401, 'M', u'𐐩'),
+    (0x10402, 'M', u'𐐪'),
+    (0x10403, 'M', u'𐐫'),
+    (0x10404, 'M', u'𐐬'),
+    (0x10405, 'M', u'𐐭'),
+    (0x10406, 'M', u'𐐮'),
+    (0x10407, 'M', u'𐐯'),
+    (0x10408, 'M', u'𐐰'),
+    (0x10409, 'M', u'𐐱'),
+    (0x1040A, 'M', u'𐐲'),
+    (0x1040B, 'M', u'𐐳'),
+    (0x1040C, 'M', u'𐐴'),
+    (0x1040D, 'M', u'𐐵'),
+    (0x1040E, 'M', u'𐐶'),
+    (0x1040F, 'M', u'𐐷'),
+    (0x10410, 'M', u'𐐸'),
+    (0x10411, 'M', u'𐐹'),
+    (0x10412, 'M', u'𐐺'),
+    (0x10413, 'M', u'𐐻'),
+    (0x10414, 'M', u'𐐼'),
+    (0x10415, 'M', u'𐐽'),
+    (0x10416, 'M', u'𐐾'),
+    (0x10417, 'M', u'𐐿'),
+    (0x10418, 'M', u'𐑀'),
+    (0x10419, 'M', u'𐑁'),
+    (0x1041A, 'M', u'𐑂'),
+    (0x1041B, 'M', u'𐑃'),
+    (0x1041C, 'M', u'𐑄'),
+    (0x1041D, 'M', u'𐑅'),
+    (0x1041E, 'M', u'𐑆'),
+    (0x1041F, 'M', u'𐑇'),
+    (0x10420, 'M', u'𐑈'),
+    (0x10421, 'M', u'𐑉'),
+    (0x10422, 'M', u'𐑊'),
+    (0x10423, 'M', u'𐑋'),
+    (0x10424, 'M', u'𐑌'),
+    (0x10425, 'M', u'𐑍'),
+    (0x10426, 'M', u'𐑎'),
+    (0x10427, 'M', u'𐑏'),
+    (0x10428, 'V'),
+    (0x1049E, 'X'),
+    (0x104A0, 'V'),
+    (0x104AA, 'X'),
+    (0x104B0, 'M', u'𐓘'),
+    (0x104B1, 'M', u'𐓙'),
+    (0x104B2, 'M', u'𐓚'),
+    (0x104B3, 'M', u'𐓛'),
+    (0x104B4, 'M', u'𐓜'),
+    (0x104B5, 'M', u'𐓝'),
+    (0x104B6, 'M', u'𐓞'),
+    (0x104B7, 'M', u'𐓟'),
+    (0x104B8, 'M', u'𐓠'),
+    (0x104B9, 'M', u'𐓡'),
+    (0x104BA, 'M', u'𐓢'),
+    (0x104BB, 'M', u'𐓣'),
+    (0x104BC, 'M', u'𐓤'),
+    (0x104BD, 'M', u'𐓥'),
+    (0x104BE, 'M', u'𐓦'),
+    ]
+
+def _seg_54():
+    return [
+    (0x104BF, 'M', u'𐓧'),
+    (0x104C0, 'M', u'𐓨'),
+    (0x104C1, 'M', u'𐓩'),
+    (0x104C2, 'M', u'𐓪'),
+    (0x104C3, 'M', u'𐓫'),
+    (0x104C4, 'M', u'𐓬'),
+    (0x104C5, 'M', u'𐓭'),
+    (0x104C6, 'M', u'𐓮'),
+    (0x104C7, 'M', u'𐓯'),
+    (0x104C8, 'M', u'𐓰'),
+    (0x104C9, 'M', u'𐓱'),
+    (0x104CA, 'M', u'𐓲'),
+    (0x104CB, 'M', u'𐓳'),
+    (0x104CC, 'M', u'𐓴'),
+    (0x104CD, 'M', u'𐓵'),
+    (0x104CE, 'M', u'𐓶'),
+    (0x104CF, 'M', u'𐓷'),
+    (0x104D0, 'M', u'𐓸'),
+    (0x104D1, 'M', u'𐓹'),
+    (0x104D2, 'M', u'𐓺'),
+    (0x104D3, 'M', u'𐓻'),
+    (0x104D4, 'X'),
+    (0x104D8, 'V'),
+    (0x104FC, 'X'),
+    (0x10500, 'V'),
+    (0x10528, 'X'),
+    (0x10530, 'V'),
+    (0x10564, 'X'),
+    (0x1056F, 'V'),
+    (0x10570, 'X'),
+    (0x10600, 'V'),
+    (0x10737, 'X'),
+    (0x10740, 'V'),
+    (0x10756, 'X'),
+    (0x10760, 'V'),
+    (0x10768, 'X'),
+    (0x10800, 'V'),
+    (0x10806, 'X'),
+    (0x10808, 'V'),
+    (0x10809, 'X'),
+    (0x1080A, 'V'),
+    (0x10836, 'X'),
+    (0x10837, 'V'),
+    (0x10839, 'X'),
+    (0x1083C, 'V'),
+    (0x1083D, 'X'),
+    (0x1083F, 'V'),
+    (0x10856, 'X'),
+    (0x10857, 'V'),
+    (0x1089F, 'X'),
+    (0x108A7, 'V'),
+    (0x108B0, 'X'),
+    (0x108E0, 'V'),
+    (0x108F3, 'X'),
+    (0x108F4, 'V'),
+    (0x108F6, 'X'),
+    (0x108FB, 'V'),
+    (0x1091C, 'X'),
+    (0x1091F, 'V'),
+    (0x1093A, 'X'),
+    (0x1093F, 'V'),
+    (0x10940, 'X'),
+    (0x10980, 'V'),
+    (0x109B8, 'X'),
+    (0x109BC, 'V'),
+    (0x109D0, 'X'),
+    (0x109D2, 'V'),
+    (0x10A04, 'X'),
+    (0x10A05, 'V'),
+    (0x10A07, 'X'),
+    (0x10A0C, 'V'),
+    (0x10A14, 'X'),
+    (0x10A15, 'V'),
+    (0x10A18, 'X'),
+    (0x10A19, 'V'),
+    (0x10A36, 'X'),
+    (0x10A38, 'V'),
+    (0x10A3B, 'X'),
+    (0x10A3F, 'V'),
+    (0x10A49, 'X'),
+    (0x10A50, 'V'),
+    (0x10A59, 'X'),
+    (0x10A60, 'V'),
+    (0x10AA0, 'X'),
+    (0x10AC0, 'V'),
+    (0x10AE7, 'X'),
+    (0x10AEB, 'V'),
+    (0x10AF7, 'X'),
+    (0x10B00, 'V'),
+    (0x10B36, 'X'),
+    (0x10B39, 'V'),
+    (0x10B56, 'X'),
+    (0x10B58, 'V'),
+    (0x10B73, 'X'),
+    (0x10B78, 'V'),
+    (0x10B92, 'X'),
+    (0x10B99, 'V'),
+    (0x10B9D, 'X'),
+    (0x10BA9, 'V'),
+    (0x10BB0, 'X'),
+    ]
+
+def _seg_55():
+    return [
+    (0x10C00, 'V'),
+    (0x10C49, 'X'),
+    (0x10C80, 'M', u'𐳀'),
+    (0x10C81, 'M', u'𐳁'),
+    (0x10C82, 'M', u'𐳂'),
+    (0x10C83, 'M', u'𐳃'),
+    (0x10C84, 'M', u'𐳄'),
+    (0x10C85, 'M', u'𐳅'),
+    (0x10C86, 'M', u'𐳆'),
+    (0x10C87, 'M', u'𐳇'),
+    (0x10C88, 'M', u'𐳈'),
+    (0x10C89, 'M', u'𐳉'),
+    (0x10C8A, 'M', u'𐳊'),
+    (0x10C8B, 'M', u'𐳋'),
+    (0x10C8C, 'M', u'𐳌'),
+    (0x10C8D, 'M', u'𐳍'),
+    (0x10C8E, 'M', u'𐳎'),
+    (0x10C8F, 'M', u'𐳏'),
+    (0x10C90, 'M', u'𐳐'),
+    (0x10C91, 'M', u'𐳑'),
+    (0x10C92, 'M', u'𐳒'),
+    (0x10C93, 'M', u'𐳓'),
+    (0x10C94, 'M', u'𐳔'),
+    (0x10C95, 'M', u'𐳕'),
+    (0x10C96, 'M', u'𐳖'),
+    (0x10C97, 'M', u'𐳗'),
+    (0x10C98, 'M', u'𐳘'),
+    (0x10C99, 'M', u'𐳙'),
+    (0x10C9A, 'M', u'𐳚'),
+    (0x10C9B, 'M', u'𐳛'),
+    (0x10C9C, 'M', u'𐳜'),
+    (0x10C9D, 'M', u'𐳝'),
+    (0x10C9E, 'M', u'𐳞'),
+    (0x10C9F, 'M', u'𐳟'),
+    (0x10CA0, 'M', u'𐳠'),
+    (0x10CA1, 'M', u'𐳡'),
+    (0x10CA2, 'M', u'𐳢'),
+    (0x10CA3, 'M', u'𐳣'),
+    (0x10CA4, 'M', u'𐳤'),
+    (0x10CA5, 'M', u'𐳥'),
+    (0x10CA6, 'M', u'𐳦'),
+    (0x10CA7, 'M', u'𐳧'),
+    (0x10CA8, 'M', u'𐳨'),
+    (0x10CA9, 'M', u'𐳩'),
+    (0x10CAA, 'M', u'𐳪'),
+    (0x10CAB, 'M', u'𐳫'),
+    (0x10CAC, 'M', u'𐳬'),
+    (0x10CAD, 'M', u'𐳭'),
+    (0x10CAE, 'M', u'𐳮'),
+    (0x10CAF, 'M', u'𐳯'),
+    (0x10CB0, 'M', u'𐳰'),
+    (0x10CB1, 'M', u'𐳱'),
+    (0x10CB2, 'M', u'𐳲'),
+    (0x10CB3, 'X'),
+    (0x10CC0, 'V'),
+    (0x10CF3, 'X'),
+    (0x10CFA, 'V'),
+    (0x10D28, 'X'),
+    (0x10D30, 'V'),
+    (0x10D3A, 'X'),
+    (0x10E60, 'V'),
+    (0x10E7F, 'X'),
+    (0x10E80, 'V'),
+    (0x10EAA, 'X'),
+    (0x10EAB, 'V'),
+    (0x10EAE, 'X'),
+    (0x10EB0, 'V'),
+    (0x10EB2, 'X'),
+    (0x10F00, 'V'),
+    (0x10F28, 'X'),
+    (0x10F30, 'V'),
+    (0x10F5A, 'X'),
+    (0x10FB0, 'V'),
+    (0x10FCC, 'X'),
+    (0x10FE0, 'V'),
+    (0x10FF7, 'X'),
+    (0x11000, 'V'),
+    (0x1104E, 'X'),
+    (0x11052, 'V'),
+    (0x11070, 'X'),
+    (0x1107F, 'V'),
+    (0x110BD, 'X'),
+    (0x110BE, 'V'),
+    (0x110C2, 'X'),
+    (0x110D0, 'V'),
+    (0x110E9, 'X'),
+    (0x110F0, 'V'),
+    (0x110FA, 'X'),
+    (0x11100, 'V'),
+    (0x11135, 'X'),
+    (0x11136, 'V'),
+    (0x11148, 'X'),
+    (0x11150, 'V'),
+    (0x11177, 'X'),
+    (0x11180, 'V'),
+    (0x111E0, 'X'),
+    (0x111E1, 'V'),
+    (0x111F5, 'X'),
+    (0x11200, 'V'),
+    (0x11212, 'X'),
+    ]
+
+def _seg_56():
+    return [
+    (0x11213, 'V'),
+    (0x1123F, 'X'),
+    (0x11280, 'V'),
+    (0x11287, 'X'),
+    (0x11288, 'V'),
+    (0x11289, 'X'),
+    (0x1128A, 'V'),
+    (0x1128E, 'X'),
+    (0x1128F, 'V'),
+    (0x1129E, 'X'),
+    (0x1129F, 'V'),
+    (0x112AA, 'X'),
+    (0x112B0, 'V'),
+    (0x112EB, 'X'),
+    (0x112F0, 'V'),
+    (0x112FA, 'X'),
+    (0x11300, 'V'),
+    (0x11304, 'X'),
+    (0x11305, 'V'),
+    (0x1130D, 'X'),
+    (0x1130F, 'V'),
+    (0x11311, 'X'),
+    (0x11313, 'V'),
+    (0x11329, 'X'),
+    (0x1132A, 'V'),
+    (0x11331, 'X'),
+    (0x11332, 'V'),
+    (0x11334, 'X'),
+    (0x11335, 'V'),
+    (0x1133A, 'X'),
+    (0x1133B, 'V'),
+    (0x11345, 'X'),
+    (0x11347, 'V'),
+    (0x11349, 'X'),
+    (0x1134B, 'V'),
+    (0x1134E, 'X'),
+    (0x11350, 'V'),
+    (0x11351, 'X'),
+    (0x11357, 'V'),
+    (0x11358, 'X'),
+    (0x1135D, 'V'),
+    (0x11364, 'X'),
+    (0x11366, 'V'),
+    (0x1136D, 'X'),
+    (0x11370, 'V'),
+    (0x11375, 'X'),
+    (0x11400, 'V'),
+    (0x1145C, 'X'),
+    (0x1145D, 'V'),
+    (0x11462, 'X'),
+    (0x11480, 'V'),
+    (0x114C8, 'X'),
+    (0x114D0, 'V'),
+    (0x114DA, 'X'),
+    (0x11580, 'V'),
+    (0x115B6, 'X'),
+    (0x115B8, 'V'),
+    (0x115DE, 'X'),
+    (0x11600, 'V'),
+    (0x11645, 'X'),
+    (0x11650, 'V'),
+    (0x1165A, 'X'),
+    (0x11660, 'V'),
+    (0x1166D, 'X'),
+    (0x11680, 'V'),
+    (0x116B9, 'X'),
+    (0x116C0, 'V'),
+    (0x116CA, 'X'),
+    (0x11700, 'V'),
+    (0x1171B, 'X'),
+    (0x1171D, 'V'),
+    (0x1172C, 'X'),
+    (0x11730, 'V'),
+    (0x11740, 'X'),
+    (0x11800, 'V'),
+    (0x1183C, 'X'),
+    (0x118A0, 'M', u'𑣀'),
+    (0x118A1, 'M', u'𑣁'),
+    (0x118A2, 'M', u'𑣂'),
+    (0x118A3, 'M', u'𑣃'),
+    (0x118A4, 'M', u'𑣄'),
+    (0x118A5, 'M', u'𑣅'),
+    (0x118A6, 'M', u'𑣆'),
+    (0x118A7, 'M', u'𑣇'),
+    (0x118A8, 'M', u'𑣈'),
+    (0x118A9, 'M', u'𑣉'),
+    (0x118AA, 'M', u'𑣊'),
+    (0x118AB, 'M', u'𑣋'),
+    (0x118AC, 'M', u'𑣌'),
+    (0x118AD, 'M', u'𑣍'),
+    (0x118AE, 'M', u'𑣎'),
+    (0x118AF, 'M', u'𑣏'),
+    (0x118B0, 'M', u'𑣐'),
+    (0x118B1, 'M', u'𑣑'),
+    (0x118B2, 'M', u'𑣒'),
+    (0x118B3, 'M', u'𑣓'),
+    (0x118B4, 'M', u'𑣔'),
+    (0x118B5, 'M', u'𑣕'),
+    (0x118B6, 'M', u'𑣖'),
+    (0x118B7, 'M', u'𑣗'),
+    ]
+
+def _seg_57():
+    return [
+    (0x118B8, 'M', u'𑣘'),
+    (0x118B9, 'M', u'𑣙'),
+    (0x118BA, 'M', u'𑣚'),
+    (0x118BB, 'M', u'𑣛'),
+    (0x118BC, 'M', u'𑣜'),
+    (0x118BD, 'M', u'𑣝'),
+    (0x118BE, 'M', u'𑣞'),
+    (0x118BF, 'M', u'𑣟'),
+    (0x118C0, 'V'),
+    (0x118F3, 'X'),
+    (0x118FF, 'V'),
+    (0x11907, 'X'),
+    (0x11909, 'V'),
+    (0x1190A, 'X'),
+    (0x1190C, 'V'),
+    (0x11914, 'X'),
+    (0x11915, 'V'),
+    (0x11917, 'X'),
+    (0x11918, 'V'),
+    (0x11936, 'X'),
+    (0x11937, 'V'),
+    (0x11939, 'X'),
+    (0x1193B, 'V'),
+    (0x11947, 'X'),
+    (0x11950, 'V'),
+    (0x1195A, 'X'),
+    (0x119A0, 'V'),
+    (0x119A8, 'X'),
+    (0x119AA, 'V'),
+    (0x119D8, 'X'),
+    (0x119DA, 'V'),
+    (0x119E5, 'X'),
+    (0x11A00, 'V'),
+    (0x11A48, 'X'),
+    (0x11A50, 'V'),
+    (0x11AA3, 'X'),
+    (0x11AC0, 'V'),
+    (0x11AF9, 'X'),
+    (0x11C00, 'V'),
+    (0x11C09, 'X'),
+    (0x11C0A, 'V'),
+    (0x11C37, 'X'),
+    (0x11C38, 'V'),
+    (0x11C46, 'X'),
+    (0x11C50, 'V'),
+    (0x11C6D, 'X'),
+    (0x11C70, 'V'),
+    (0x11C90, 'X'),
+    (0x11C92, 'V'),
+    (0x11CA8, 'X'),
+    (0x11CA9, 'V'),
+    (0x11CB7, 'X'),
+    (0x11D00, 'V'),
+    (0x11D07, 'X'),
+    (0x11D08, 'V'),
+    (0x11D0A, 'X'),
+    (0x11D0B, 'V'),
+    (0x11D37, 'X'),
+    (0x11D3A, 'V'),
+    (0x11D3B, 'X'),
+    (0x11D3C, 'V'),
+    (0x11D3E, 'X'),
+    (0x11D3F, 'V'),
+    (0x11D48, 'X'),
+    (0x11D50, 'V'),
+    (0x11D5A, 'X'),
+    (0x11D60, 'V'),
+    (0x11D66, 'X'),
+    (0x11D67, 'V'),
+    (0x11D69, 'X'),
+    (0x11D6A, 'V'),
+    (0x11D8F, 'X'),
+    (0x11D90, 'V'),
+    (0x11D92, 'X'),
+    (0x11D93, 'V'),
+    (0x11D99, 'X'),
+    (0x11DA0, 'V'),
+    (0x11DAA, 'X'),
+    (0x11EE0, 'V'),
+    (0x11EF9, 'X'),
+    (0x11FB0, 'V'),
+    (0x11FB1, 'X'),
+    (0x11FC0, 'V'),
+    (0x11FF2, 'X'),
+    (0x11FFF, 'V'),
+    (0x1239A, 'X'),
+    (0x12400, 'V'),
+    (0x1246F, 'X'),
+    (0x12470, 'V'),
+    (0x12475, 'X'),
+    (0x12480, 'V'),
+    (0x12544, 'X'),
+    (0x13000, 'V'),
+    (0x1342F, 'X'),
+    (0x14400, 'V'),
+    (0x14647, 'X'),
+    (0x16800, 'V'),
+    (0x16A39, 'X'),
+    (0x16A40, 'V'),
+    (0x16A5F, 'X'),
+    ]
+
+def _seg_58():
+    return [
+    (0x16A60, 'V'),
+    (0x16A6A, 'X'),
+    (0x16A6E, 'V'),
+    (0x16A70, 'X'),
+    (0x16AD0, 'V'),
+    (0x16AEE, 'X'),
+    (0x16AF0, 'V'),
+    (0x16AF6, 'X'),
+    (0x16B00, 'V'),
+    (0x16B46, 'X'),
+    (0x16B50, 'V'),
+    (0x16B5A, 'X'),
+    (0x16B5B, 'V'),
+    (0x16B62, 'X'),
+    (0x16B63, 'V'),
+    (0x16B78, 'X'),
+    (0x16B7D, 'V'),
+    (0x16B90, 'X'),
+    (0x16E40, 'M', u'𖹠'),
+    (0x16E41, 'M', u'𖹡'),
+    (0x16E42, 'M', u'𖹢'),
+    (0x16E43, 'M', u'𖹣'),
+    (0x16E44, 'M', u'𖹤'),
+    (0x16E45, 'M', u'𖹥'),
+    (0x16E46, 'M', u'𖹦'),
+    (0x16E47, 'M', u'𖹧'),
+    (0x16E48, 'M', u'𖹨'),
+    (0x16E49, 'M', u'𖹩'),
+    (0x16E4A, 'M', u'𖹪'),
+    (0x16E4B, 'M', u'𖹫'),
+    (0x16E4C, 'M', u'𖹬'),
+    (0x16E4D, 'M', u'𖹭'),
+    (0x16E4E, 'M', u'𖹮'),
+    (0x16E4F, 'M', u'𖹯'),
+    (0x16E50, 'M', u'𖹰'),
+    (0x16E51, 'M', u'𖹱'),
+    (0x16E52, 'M', u'𖹲'),
+    (0x16E53, 'M', u'𖹳'),
+    (0x16E54, 'M', u'𖹴'),
+    (0x16E55, 'M', u'𖹵'),
+    (0x16E56, 'M', u'𖹶'),
+    (0x16E57, 'M', u'𖹷'),
+    (0x16E58, 'M', u'𖹸'),
+    (0x16E59, 'M', u'𖹹'),
+    (0x16E5A, 'M', u'𖹺'),
+    (0x16E5B, 'M', u'𖹻'),
+    (0x16E5C, 'M', u'𖹼'),
+    (0x16E5D, 'M', u'𖹽'),
+    (0x16E5E, 'M', u'𖹾'),
+    (0x16E5F, 'M', u'𖹿'),
+    (0x16E60, 'V'),
+    (0x16E9B, 'X'),
+    (0x16F00, 'V'),
+    (0x16F4B, 'X'),
+    (0x16F4F, 'V'),
+    (0x16F88, 'X'),
+    (0x16F8F, 'V'),
+    (0x16FA0, 'X'),
+    (0x16FE0, 'V'),
+    (0x16FE5, 'X'),
+    (0x16FF0, 'V'),
+    (0x16FF2, 'X'),
+    (0x17000, 'V'),
+    (0x187F8, 'X'),
+    (0x18800, 'V'),
+    (0x18CD6, 'X'),
+    (0x18D00, 'V'),
+    (0x18D09, 'X'),
+    (0x1B000, 'V'),
+    (0x1B11F, 'X'),
+    (0x1B150, 'V'),
+    (0x1B153, 'X'),
+    (0x1B164, 'V'),
+    (0x1B168, 'X'),
+    (0x1B170, 'V'),
+    (0x1B2FC, 'X'),
+    (0x1BC00, 'V'),
+    (0x1BC6B, 'X'),
+    (0x1BC70, 'V'),
+    (0x1BC7D, 'X'),
+    (0x1BC80, 'V'),
+    (0x1BC89, 'X'),
+    (0x1BC90, 'V'),
+    (0x1BC9A, 'X'),
+    (0x1BC9C, 'V'),
+    (0x1BCA0, 'I'),
+    (0x1BCA4, 'X'),
+    (0x1D000, 'V'),
+    (0x1D0F6, 'X'),
+    (0x1D100, 'V'),
+    (0x1D127, 'X'),
+    (0x1D129, 'V'),
+    (0x1D15E, 'M', u'𝅗𝅥'),
+    (0x1D15F, 'M', u'𝅘𝅥'),
+    (0x1D160, 'M', u'𝅘𝅥𝅮'),
+    (0x1D161, 'M', u'𝅘𝅥𝅯'),
+    (0x1D162, 'M', u'𝅘𝅥𝅰'),
+    (0x1D163, 'M', u'𝅘𝅥𝅱'),
+    (0x1D164, 'M', u'𝅘𝅥𝅲'),
+    (0x1D165, 'V'),
+    ]
+
+def _seg_59():
+    return [
+    (0x1D173, 'X'),
+    (0x1D17B, 'V'),
+    (0x1D1BB, 'M', u'𝆹𝅥'),
+    (0x1D1BC, 'M', u'𝆺𝅥'),
+    (0x1D1BD, 'M', u'𝆹𝅥𝅮'),
+    (0x1D1BE, 'M', u'𝆺𝅥𝅮'),
+    (0x1D1BF, 'M', u'𝆹𝅥𝅯'),
+    (0x1D1C0, 'M', u'𝆺𝅥𝅯'),
+    (0x1D1C1, 'V'),
+    (0x1D1E9, 'X'),
+    (0x1D200, 'V'),
+    (0x1D246, 'X'),
+    (0x1D2E0, 'V'),
+    (0x1D2F4, 'X'),
+    (0x1D300, 'V'),
+    (0x1D357, 'X'),
+    (0x1D360, 'V'),
+    (0x1D379, 'X'),
+    (0x1D400, 'M', u'a'),
+    (0x1D401, 'M', u'b'),
+    (0x1D402, 'M', u'c'),
+    (0x1D403, 'M', u'd'),
+    (0x1D404, 'M', u'e'),
+    (0x1D405, 'M', u'f'),
+    (0x1D406, 'M', u'g'),
+    (0x1D407, 'M', u'h'),
+    (0x1D408, 'M', u'i'),
+    (0x1D409, 'M', u'j'),
+    (0x1D40A, 'M', u'k'),
+    (0x1D40B, 'M', u'l'),
+    (0x1D40C, 'M', u'm'),
+    (0x1D40D, 'M', u'n'),
+    (0x1D40E, 'M', u'o'),
+    (0x1D40F, 'M', u'p'),
+    (0x1D410, 'M', u'q'),
+    (0x1D411, 'M', u'r'),
+    (0x1D412, 'M', u's'),
+    (0x1D413, 'M', u't'),
+    (0x1D414, 'M', u'u'),
+    (0x1D415, 'M', u'v'),
+    (0x1D416, 'M', u'w'),
+    (0x1D417, 'M', u'x'),
+    (0x1D418, 'M', u'y'),
+    (0x1D419, 'M', u'z'),
+    (0x1D41A, 'M', u'a'),
+    (0x1D41B, 'M', u'b'),
+    (0x1D41C, 'M', u'c'),
+    (0x1D41D, 'M', u'd'),
+    (0x1D41E, 'M', u'e'),
+    (0x1D41F, 'M', u'f'),
+    (0x1D420, 'M', u'g'),
+    (0x1D421, 'M', u'h'),
+    (0x1D422, 'M', u'i'),
+    (0x1D423, 'M', u'j'),
+    (0x1D424, 'M', u'k'),
+    (0x1D425, 'M', u'l'),
+    (0x1D426, 'M', u'm'),
+    (0x1D427, 'M', u'n'),
+    (0x1D428, 'M', u'o'),
+    (0x1D429, 'M', u'p'),
+    (0x1D42A, 'M', u'q'),
+    (0x1D42B, 'M', u'r'),
+    (0x1D42C, 'M', u's'),
+    (0x1D42D, 'M', u't'),
+    (0x1D42E, 'M', u'u'),
+    (0x1D42F, 'M', u'v'),
+    (0x1D430, 'M', u'w'),
+    (0x1D431, 'M', u'x'),
+    (0x1D432, 'M', u'y'),
+    (0x1D433, 'M', u'z'),
+    (0x1D434, 'M', u'a'),
+    (0x1D435, 'M', u'b'),
+    (0x1D436, 'M', u'c'),
+    (0x1D437, 'M', u'd'),
+    (0x1D438, 'M', u'e'),
+    (0x1D439, 'M', u'f'),
+    (0x1D43A, 'M', u'g'),
+    (0x1D43B, 'M', u'h'),
+    (0x1D43C, 'M', u'i'),
+    (0x1D43D, 'M', u'j'),
+    (0x1D43E, 'M', u'k'),
+    (0x1D43F, 'M', u'l'),
+    (0x1D440, 'M', u'm'),
+    (0x1D441, 'M', u'n'),
+    (0x1D442, 'M', u'o'),
+    (0x1D443, 'M', u'p'),
+    (0x1D444, 'M', u'q'),
+    (0x1D445, 'M', u'r'),
+    (0x1D446, 'M', u's'),
+    (0x1D447, 'M', u't'),
+    (0x1D448, 'M', u'u'),
+    (0x1D449, 'M', u'v'),
+    (0x1D44A, 'M', u'w'),
+    (0x1D44B, 'M', u'x'),
+    (0x1D44C, 'M', u'y'),
+    (0x1D44D, 'M', u'z'),
+    (0x1D44E, 'M', u'a'),
+    (0x1D44F, 'M', u'b'),
+    (0x1D450, 'M', u'c'),
+    (0x1D451, 'M', u'd'),
+    ]
+
+def _seg_60():
+    return [
+    (0x1D452, 'M', u'e'),
+    (0x1D453, 'M', u'f'),
+    (0x1D454, 'M', u'g'),
+    (0x1D455, 'X'),
+    (0x1D456, 'M', u'i'),
+    (0x1D457, 'M', u'j'),
+    (0x1D458, 'M', u'k'),
+    (0x1D459, 'M', u'l'),
+    (0x1D45A, 'M', u'm'),
+    (0x1D45B, 'M', u'n'),
+    (0x1D45C, 'M', u'o'),
+    (0x1D45D, 'M', u'p'),
+    (0x1D45E, 'M', u'q'),
+    (0x1D45F, 'M', u'r'),
+    (0x1D460, 'M', u's'),
+    (0x1D461, 'M', u't'),
+    (0x1D462, 'M', u'u'),
+    (0x1D463, 'M', u'v'),
+    (0x1D464, 'M', u'w'),
+    (0x1D465, 'M', u'x'),
+    (0x1D466, 'M', u'y'),
+    (0x1D467, 'M', u'z'),
+    (0x1D468, 'M', u'a'),
+    (0x1D469, 'M', u'b'),
+    (0x1D46A, 'M', u'c'),
+    (0x1D46B, 'M', u'd'),
+    (0x1D46C, 'M', u'e'),
+    (0x1D46D, 'M', u'f'),
+    (0x1D46E, 'M', u'g'),
+    (0x1D46F, 'M', u'h'),
+    (0x1D470, 'M', u'i'),
+    (0x1D471, 'M', u'j'),
+    (0x1D472, 'M', u'k'),
+    (0x1D473, 'M', u'l'),
+    (0x1D474, 'M', u'm'),
+    (0x1D475, 'M', u'n'),
+    (0x1D476, 'M', u'o'),
+    (0x1D477, 'M', u'p'),
+    (0x1D478, 'M', u'q'),
+    (0x1D479, 'M', u'r'),
+    (0x1D47A, 'M', u's'),
+    (0x1D47B, 'M', u't'),
+    (0x1D47C, 'M', u'u'),
+    (0x1D47D, 'M', u'v'),
+    (0x1D47E, 'M', u'w'),
+    (0x1D47F, 'M', u'x'),
+    (0x1D480, 'M', u'y'),
+    (0x1D481, 'M', u'z'),
+    (0x1D482, 'M', u'a'),
+    (0x1D483, 'M', u'b'),
+    (0x1D484, 'M', u'c'),
+    (0x1D485, 'M', u'd'),
+    (0x1D486, 'M', u'e'),
+    (0x1D487, 'M', u'f'),
+    (0x1D488, 'M', u'g'),
+    (0x1D489, 'M', u'h'),
+    (0x1D48A, 'M', u'i'),
+    (0x1D48B, 'M', u'j'),
+    (0x1D48C, 'M', u'k'),
+    (0x1D48D, 'M', u'l'),
+    (0x1D48E, 'M', u'm'),
+    (0x1D48F, 'M', u'n'),
+    (0x1D490, 'M', u'o'),
+    (0x1D491, 'M', u'p'),
+    (0x1D492, 'M', u'q'),
+    (0x1D493, 'M', u'r'),
+    (0x1D494, 'M', u's'),
+    (0x1D495, 'M', u't'),
+    (0x1D496, 'M', u'u'),
+    (0x1D497, 'M', u'v'),
+    (0x1D498, 'M', u'w'),
+    (0x1D499, 'M', u'x'),
+    (0x1D49A, 'M', u'y'),
+    (0x1D49B, 'M', u'z'),
+    (0x1D49C, 'M', u'a'),
+    (0x1D49D, 'X'),
+    (0x1D49E, 'M', u'c'),
+    (0x1D49F, 'M', u'd'),
+    (0x1D4A0, 'X'),
+    (0x1D4A2, 'M', u'g'),
+    (0x1D4A3, 'X'),
+    (0x1D4A5, 'M', u'j'),
+    (0x1D4A6, 'M', u'k'),
+    (0x1D4A7, 'X'),
+    (0x1D4A9, 'M', u'n'),
+    (0x1D4AA, 'M', u'o'),
+    (0x1D4AB, 'M', u'p'),
+    (0x1D4AC, 'M', u'q'),
+    (0x1D4AD, 'X'),
+    (0x1D4AE, 'M', u's'),
+    (0x1D4AF, 'M', u't'),
+    (0x1D4B0, 'M', u'u'),
+    (0x1D4B1, 'M', u'v'),
+    (0x1D4B2, 'M', u'w'),
+    (0x1D4B3, 'M', u'x'),
+    (0x1D4B4, 'M', u'y'),
+    (0x1D4B5, 'M', u'z'),
+    (0x1D4B6, 'M', u'a'),
+    (0x1D4B7, 'M', u'b'),
+    (0x1D4B8, 'M', u'c'),
+    ]
+
+def _seg_61():
+    return [
+    (0x1D4B9, 'M', u'd'),
+    (0x1D4BA, 'X'),
+    (0x1D4BB, 'M', u'f'),
+    (0x1D4BC, 'X'),
+    (0x1D4BD, 'M', u'h'),
+    (0x1D4BE, 'M', u'i'),
+    (0x1D4BF, 'M', u'j'),
+    (0x1D4C0, 'M', u'k'),
+    (0x1D4C1, 'M', u'l'),
+    (0x1D4C2, 'M', u'm'),
+    (0x1D4C3, 'M', u'n'),
+    (0x1D4C4, 'X'),
+    (0x1D4C5, 'M', u'p'),
+    (0x1D4C6, 'M', u'q'),
+    (0x1D4C7, 'M', u'r'),
+    (0x1D4C8, 'M', u's'),
+    (0x1D4C9, 'M', u't'),
+    (0x1D4CA, 'M', u'u'),
+    (0x1D4CB, 'M', u'v'),
+    (0x1D4CC, 'M', u'w'),
+    (0x1D4CD, 'M', u'x'),
+    (0x1D4CE, 'M', u'y'),
+    (0x1D4CF, 'M', u'z'),
+    (0x1D4D0, 'M', u'a'),
+    (0x1D4D1, 'M', u'b'),
+    (0x1D4D2, 'M', u'c'),
+    (0x1D4D3, 'M', u'd'),
+    (0x1D4D4, 'M', u'e'),
+    (0x1D4D5, 'M', u'f'),
+    (0x1D4D6, 'M', u'g'),
+    (0x1D4D7, 'M', u'h'),
+    (0x1D4D8, 'M', u'i'),
+    (0x1D4D9, 'M', u'j'),
+    (0x1D4DA, 'M', u'k'),
+    (0x1D4DB, 'M', u'l'),
+    (0x1D4DC, 'M', u'm'),
+    (0x1D4DD, 'M', u'n'),
+    (0x1D4DE, 'M', u'o'),
+    (0x1D4DF, 'M', u'p'),
+    (0x1D4E0, 'M', u'q'),
+    (0x1D4E1, 'M', u'r'),
+    (0x1D4E2, 'M', u's'),
+    (0x1D4E3, 'M', u't'),
+    (0x1D4E4, 'M', u'u'),
+    (0x1D4E5, 'M', u'v'),
+    (0x1D4E6, 'M', u'w'),
+    (0x1D4E7, 'M', u'x'),
+    (0x1D4E8, 'M', u'y'),
+    (0x1D4E9, 'M', u'z'),
+    (0x1D4EA, 'M', u'a'),
+    (0x1D4EB, 'M', u'b'),
+    (0x1D4EC, 'M', u'c'),
+    (0x1D4ED, 'M', u'd'),
+    (0x1D4EE, 'M', u'e'),
+    (0x1D4EF, 'M', u'f'),
+    (0x1D4F0, 'M', u'g'),
+    (0x1D4F1, 'M', u'h'),
+    (0x1D4F2, 'M', u'i'),
+    (0x1D4F3, 'M', u'j'),
+    (0x1D4F4, 'M', u'k'),
+    (0x1D4F5, 'M', u'l'),
+    (0x1D4F6, 'M', u'm'),
+    (0x1D4F7, 'M', u'n'),
+    (0x1D4F8, 'M', u'o'),
+    (0x1D4F9, 'M', u'p'),
+    (0x1D4FA, 'M', u'q'),
+    (0x1D4FB, 'M', u'r'),
+    (0x1D4FC, 'M', u's'),
+    (0x1D4FD, 'M', u't'),
+    (0x1D4FE, 'M', u'u'),
+    (0x1D4FF, 'M', u'v'),
+    (0x1D500, 'M', u'w'),
+    (0x1D501, 'M', u'x'),
+    (0x1D502, 'M', u'y'),
+    (0x1D503, 'M', u'z'),
+    (0x1D504, 'M', u'a'),
+    (0x1D505, 'M', u'b'),
+    (0x1D506, 'X'),
+    (0x1D507, 'M', u'd'),
+    (0x1D508, 'M', u'e'),
+    (0x1D509, 'M', u'f'),
+    (0x1D50A, 'M', u'g'),
+    (0x1D50B, 'X'),
+    (0x1D50D, 'M', u'j'),
+    (0x1D50E, 'M', u'k'),
+    (0x1D50F, 'M', u'l'),
+    (0x1D510, 'M', u'm'),
+    (0x1D511, 'M', u'n'),
+    (0x1D512, 'M', u'o'),
+    (0x1D513, 'M', u'p'),
+    (0x1D514, 'M', u'q'),
+    (0x1D515, 'X'),
+    (0x1D516, 'M', u's'),
+    (0x1D517, 'M', u't'),
+    (0x1D518, 'M', u'u'),
+    (0x1D519, 'M', u'v'),
+    (0x1D51A, 'M', u'w'),
+    (0x1D51B, 'M', u'x'),
+    (0x1D51C, 'M', u'y'),
+    (0x1D51D, 'X'),
+    ]
+
+def _seg_62():
+    return [
+    (0x1D51E, 'M', u'a'),
+    (0x1D51F, 'M', u'b'),
+    (0x1D520, 'M', u'c'),
+    (0x1D521, 'M', u'd'),
+    (0x1D522, 'M', u'e'),
+    (0x1D523, 'M', u'f'),
+    (0x1D524, 'M', u'g'),
+    (0x1D525, 'M', u'h'),
+    (0x1D526, 'M', u'i'),
+    (0x1D527, 'M', u'j'),
+    (0x1D528, 'M', u'k'),
+    (0x1D529, 'M', u'l'),
+    (0x1D52A, 'M', u'm'),
+    (0x1D52B, 'M', u'n'),
+    (0x1D52C, 'M', u'o'),
+    (0x1D52D, 'M', u'p'),
+    (0x1D52E, 'M', u'q'),
+    (0x1D52F, 'M', u'r'),
+    (0x1D530, 'M', u's'),
+    (0x1D531, 'M', u't'),
+    (0x1D532, 'M', u'u'),
+    (0x1D533, 'M', u'v'),
+    (0x1D534, 'M', u'w'),
+    (0x1D535, 'M', u'x'),
+    (0x1D536, 'M', u'y'),
+    (0x1D537, 'M', u'z'),
+    (0x1D538, 'M', u'a'),
+    (0x1D539, 'M', u'b'),
+    (0x1D53A, 'X'),
+    (0x1D53B, 'M', u'd'),
+    (0x1D53C, 'M', u'e'),
+    (0x1D53D, 'M', u'f'),
+    (0x1D53E, 'M', u'g'),
+    (0x1D53F, 'X'),
+    (0x1D540, 'M', u'i'),
+    (0x1D541, 'M', u'j'),
+    (0x1D542, 'M', u'k'),
+    (0x1D543, 'M', u'l'),
+    (0x1D544, 'M', u'm'),
+    (0x1D545, 'X'),
+    (0x1D546, 'M', u'o'),
+    (0x1D547, 'X'),
+    (0x1D54A, 'M', u's'),
+    (0x1D54B, 'M', u't'),
+    (0x1D54C, 'M', u'u'),
+    (0x1D54D, 'M', u'v'),
+    (0x1D54E, 'M', u'w'),
+    (0x1D54F, 'M', u'x'),
+    (0x1D550, 'M', u'y'),
+    (0x1D551, 'X'),
+    (0x1D552, 'M', u'a'),
+    (0x1D553, 'M', u'b'),
+    (0x1D554, 'M', u'c'),
+    (0x1D555, 'M', u'd'),
+    (0x1D556, 'M', u'e'),
+    (0x1D557, 'M', u'f'),
+    (0x1D558, 'M', u'g'),
+    (0x1D559, 'M', u'h'),
+    (0x1D55A, 'M', u'i'),
+    (0x1D55B, 'M', u'j'),
+    (0x1D55C, 'M', u'k'),
+    (0x1D55D, 'M', u'l'),
+    (0x1D55E, 'M', u'm'),
+    (0x1D55F, 'M', u'n'),
+    (0x1D560, 'M', u'o'),
+    (0x1D561, 'M', u'p'),
+    (0x1D562, 'M', u'q'),
+    (0x1D563, 'M', u'r'),
+    (0x1D564, 'M', u's'),
+    (0x1D565, 'M', u't'),
+    (0x1D566, 'M', u'u'),
+    (0x1D567, 'M', u'v'),
+    (0x1D568, 'M', u'w'),
+    (0x1D569, 'M', u'x'),
+    (0x1D56A, 'M', u'y'),
+    (0x1D56B, 'M', u'z'),
+    (0x1D56C, 'M', u'a'),
+    (0x1D56D, 'M', u'b'),
+    (0x1D56E, 'M', u'c'),
+    (0x1D56F, 'M', u'd'),
+    (0x1D570, 'M', u'e'),
+    (0x1D571, 'M', u'f'),
+    (0x1D572, 'M', u'g'),
+    (0x1D573, 'M', u'h'),
+    (0x1D574, 'M', u'i'),
+    (0x1D575, 'M', u'j'),
+    (0x1D576, 'M', u'k'),
+    (0x1D577, 'M', u'l'),
+    (0x1D578, 'M', u'm'),
+    (0x1D579, 'M', u'n'),
+    (0x1D57A, 'M', u'o'),
+    (0x1D57B, 'M', u'p'),
+    (0x1D57C, 'M', u'q'),
+    (0x1D57D, 'M', u'r'),
+    (0x1D57E, 'M', u's'),
+    (0x1D57F, 'M', u't'),
+    (0x1D580, 'M', u'u'),
+    (0x1D581, 'M', u'v'),
+    (0x1D582, 'M', u'w'),
+    (0x1D583, 'M', u'x'),
+    ]
+
+def _seg_63():
+    return [
+    (0x1D584, 'M', u'y'),
+    (0x1D585, 'M', u'z'),
+    (0x1D586, 'M', u'a'),
+    (0x1D587, 'M', u'b'),
+    (0x1D588, 'M', u'c'),
+    (0x1D589, 'M', u'd'),
+    (0x1D58A, 'M', u'e'),
+    (0x1D58B, 'M', u'f'),
+    (0x1D58C, 'M', u'g'),
+    (0x1D58D, 'M', u'h'),
+    (0x1D58E, 'M', u'i'),
+    (0x1D58F, 'M', u'j'),
+    (0x1D590, 'M', u'k'),
+    (0x1D591, 'M', u'l'),
+    (0x1D592, 'M', u'm'),
+    (0x1D593, 'M', u'n'),
+    (0x1D594, 'M', u'o'),
+    (0x1D595, 'M', u'p'),
+    (0x1D596, 'M', u'q'),
+    (0x1D597, 'M', u'r'),
+    (0x1D598, 'M', u's'),
+    (0x1D599, 'M', u't'),
+    (0x1D59A, 'M', u'u'),
+    (0x1D59B, 'M', u'v'),
+    (0x1D59C, 'M', u'w'),
+    (0x1D59D, 'M', u'x'),
+    (0x1D59E, 'M', u'y'),
+    (0x1D59F, 'M', u'z'),
+    (0x1D5A0, 'M', u'a'),
+    (0x1D5A1, 'M', u'b'),
+    (0x1D5A2, 'M', u'c'),
+    (0x1D5A3, 'M', u'd'),
+    (0x1D5A4, 'M', u'e'),
+    (0x1D5A5, 'M', u'f'),
+    (0x1D5A6, 'M', u'g'),
+    (0x1D5A7, 'M', u'h'),
+    (0x1D5A8, 'M', u'i'),
+    (0x1D5A9, 'M', u'j'),
+    (0x1D5AA, 'M', u'k'),
+    (0x1D5AB, 'M', u'l'),
+    (0x1D5AC, 'M', u'm'),
+    (0x1D5AD, 'M', u'n'),
+    (0x1D5AE, 'M', u'o'),
+    (0x1D5AF, 'M', u'p'),
+    (0x1D5B0, 'M', u'q'),
+    (0x1D5B1, 'M', u'r'),
+    (0x1D5B2, 'M', u's'),
+    (0x1D5B3, 'M', u't'),
+    (0x1D5B4, 'M', u'u'),
+    (0x1D5B5, 'M', u'v'),
+    (0x1D5B6, 'M', u'w'),
+    (0x1D5B7, 'M', u'x'),
+    (0x1D5B8, 'M', u'y'),
+    (0x1D5B9, 'M', u'z'),
+    (0x1D5BA, 'M', u'a'),
+    (0x1D5BB, 'M', u'b'),
+    (0x1D5BC, 'M', u'c'),
+    (0x1D5BD, 'M', u'd'),
+    (0x1D5BE, 'M', u'e'),
+    (0x1D5BF, 'M', u'f'),
+    (0x1D5C0, 'M', u'g'),
+    (0x1D5C1, 'M', u'h'),
+    (0x1D5C2, 'M', u'i'),
+    (0x1D5C3, 'M', u'j'),
+    (0x1D5C4, 'M', u'k'),
+    (0x1D5C5, 'M', u'l'),
+    (0x1D5C6, 'M', u'm'),
+    (0x1D5C7, 'M', u'n'),
+    (0x1D5C8, 'M', u'o'),
+    (0x1D5C9, 'M', u'p'),
+    (0x1D5CA, 'M', u'q'),
+    (0x1D5CB, 'M', u'r'),
+    (0x1D5CC, 'M', u's'),
+    (0x1D5CD, 'M', u't'),
+    (0x1D5CE, 'M', u'u'),
+    (0x1D5CF, 'M', u'v'),
+    (0x1D5D0, 'M', u'w'),
+    (0x1D5D1, 'M', u'x'),
+    (0x1D5D2, 'M', u'y'),
+    (0x1D5D3, 'M', u'z'),
+    (0x1D5D4, 'M', u'a'),
+    (0x1D5D5, 'M', u'b'),
+    (0x1D5D6, 'M', u'c'),
+    (0x1D5D7, 'M', u'd'),
+    (0x1D5D8, 'M', u'e'),
+    (0x1D5D9, 'M', u'f'),
+    (0x1D5DA, 'M', u'g'),
+    (0x1D5DB, 'M', u'h'),
+    (0x1D5DC, 'M', u'i'),
+    (0x1D5DD, 'M', u'j'),
+    (0x1D5DE, 'M', u'k'),
+    (0x1D5DF, 'M', u'l'),
+    (0x1D5E0, 'M', u'm'),
+    (0x1D5E1, 'M', u'n'),
+    (0x1D5E2, 'M', u'o'),
+    (0x1D5E3, 'M', u'p'),
+    (0x1D5E4, 'M', u'q'),
+    (0x1D5E5, 'M', u'r'),
+    (0x1D5E6, 'M', u's'),
+    (0x1D5E7, 'M', u't'),
+    ]
+
+def _seg_64():
+    return [
+    (0x1D5E8, 'M', u'u'),
+    (0x1D5E9, 'M', u'v'),
+    (0x1D5EA, 'M', u'w'),
+    (0x1D5EB, 'M', u'x'),
+    (0x1D5EC, 'M', u'y'),
+    (0x1D5ED, 'M', u'z'),
+    (0x1D5EE, 'M', u'a'),
+    (0x1D5EF, 'M', u'b'),
+    (0x1D5F0, 'M', u'c'),
+    (0x1D5F1, 'M', u'd'),
+    (0x1D5F2, 'M', u'e'),
+    (0x1D5F3, 'M', u'f'),
+    (0x1D5F4, 'M', u'g'),
+    (0x1D5F5, 'M', u'h'),
+    (0x1D5F6, 'M', u'i'),
+    (0x1D5F7, 'M', u'j'),
+    (0x1D5F8, 'M', u'k'),
+    (0x1D5F9, 'M', u'l'),
+    (0x1D5FA, 'M', u'm'),
+    (0x1D5FB, 'M', u'n'),
+    (0x1D5FC, 'M', u'o'),
+    (0x1D5FD, 'M', u'p'),
+    (0x1D5FE, 'M', u'q'),
+    (0x1D5FF, 'M', u'r'),
+    (0x1D600, 'M', u's'),
+    (0x1D601, 'M', u't'),
+    (0x1D602, 'M', u'u'),
+    (0x1D603, 'M', u'v'),
+    (0x1D604, 'M', u'w'),
+    (0x1D605, 'M', u'x'),
+    (0x1D606, 'M', u'y'),
+    (0x1D607, 'M', u'z'),
+    (0x1D608, 'M', u'a'),
+    (0x1D609, 'M', u'b'),
+    (0x1D60A, 'M', u'c'),
+    (0x1D60B, 'M', u'd'),
+    (0x1D60C, 'M', u'e'),
+    (0x1D60D, 'M', u'f'),
+    (0x1D60E, 'M', u'g'),
+    (0x1D60F, 'M', u'h'),
+    (0x1D610, 'M', u'i'),
+    (0x1D611, 'M', u'j'),
+    (0x1D612, 'M', u'k'),
+    (0x1D613, 'M', u'l'),
+    (0x1D614, 'M', u'm'),
+    (0x1D615, 'M', u'n'),
+    (0x1D616, 'M', u'o'),
+    (0x1D617, 'M', u'p'),
+    (0x1D618, 'M', u'q'),
+    (0x1D619, 'M', u'r'),
+    (0x1D61A, 'M', u's'),
+    (0x1D61B, 'M', u't'),
+    (0x1D61C, 'M', u'u'),
+    (0x1D61D, 'M', u'v'),
+    (0x1D61E, 'M', u'w'),
+    (0x1D61F, 'M', u'x'),
+    (0x1D620, 'M', u'y'),
+    (0x1D621, 'M', u'z'),
+    (0x1D622, 'M', u'a'),
+    (0x1D623, 'M', u'b'),
+    (0x1D624, 'M', u'c'),
+    (0x1D625, 'M', u'd'),
+    (0x1D626, 'M', u'e'),
+    (0x1D627, 'M', u'f'),
+    (0x1D628, 'M', u'g'),
+    (0x1D629, 'M', u'h'),
+    (0x1D62A, 'M', u'i'),
+    (0x1D62B, 'M', u'j'),
+    (0x1D62C, 'M', u'k'),
+    (0x1D62D, 'M', u'l'),
+    (0x1D62E, 'M', u'm'),
+    (0x1D62F, 'M', u'n'),
+    (0x1D630, 'M', u'o'),
+    (0x1D631, 'M', u'p'),
+    (0x1D632, 'M', u'q'),
+    (0x1D633, 'M', u'r'),
+    (0x1D634, 'M', u's'),
+    (0x1D635, 'M', u't'),
+    (0x1D636, 'M', u'u'),
+    (0x1D637, 'M', u'v'),
+    (0x1D638, 'M', u'w'),
+    (0x1D639, 'M', u'x'),
+    (0x1D63A, 'M', u'y'),
+    (0x1D63B, 'M', u'z'),
+    (0x1D63C, 'M', u'a'),
+    (0x1D63D, 'M', u'b'),
+    (0x1D63E, 'M', u'c'),
+    (0x1D63F, 'M', u'd'),
+    (0x1D640, 'M', u'e'),
+    (0x1D641, 'M', u'f'),
+    (0x1D642, 'M', u'g'),
+    (0x1D643, 'M', u'h'),
+    (0x1D644, 'M', u'i'),
+    (0x1D645, 'M', u'j'),
+    (0x1D646, 'M', u'k'),
+    (0x1D647, 'M', u'l'),
+    (0x1D648, 'M', u'm'),
+    (0x1D649, 'M', u'n'),
+    (0x1D64A, 'M', u'o'),
+    (0x1D64B, 'M', u'p'),
+    ]
+
+def _seg_65():
+    return [
+    (0x1D64C, 'M', u'q'),
+    (0x1D64D, 'M', u'r'),
+    (0x1D64E, 'M', u's'),
+    (0x1D64F, 'M', u't'),
+    (0x1D650, 'M', u'u'),
+    (0x1D651, 'M', u'v'),
+    (0x1D652, 'M', u'w'),
+    (0x1D653, 'M', u'x'),
+    (0x1D654, 'M', u'y'),
+    (0x1D655, 'M', u'z'),
+    (0x1D656, 'M', u'a'),
+    (0x1D657, 'M', u'b'),
+    (0x1D658, 'M', u'c'),
+    (0x1D659, 'M', u'd'),
+    (0x1D65A, 'M', u'e'),
+    (0x1D65B, 'M', u'f'),
+    (0x1D65C, 'M', u'g'),
+    (0x1D65D, 'M', u'h'),
+    (0x1D65E, 'M', u'i'),
+    (0x1D65F, 'M', u'j'),
+    (0x1D660, 'M', u'k'),
+    (0x1D661, 'M', u'l'),
+    (0x1D662, 'M', u'm'),
+    (0x1D663, 'M', u'n'),
+    (0x1D664, 'M', u'o'),
+    (0x1D665, 'M', u'p'),
+    (0x1D666, 'M', u'q'),
+    (0x1D667, 'M', u'r'),
+    (0x1D668, 'M', u's'),
+    (0x1D669, 'M', u't'),
+    (0x1D66A, 'M', u'u'),
+    (0x1D66B, 'M', u'v'),
+    (0x1D66C, 'M', u'w'),
+    (0x1D66D, 'M', u'x'),
+    (0x1D66E, 'M', u'y'),
+    (0x1D66F, 'M', u'z'),
+    (0x1D670, 'M', u'a'),
+    (0x1D671, 'M', u'b'),
+    (0x1D672, 'M', u'c'),
+    (0x1D673, 'M', u'd'),
+    (0x1D674, 'M', u'e'),
+    (0x1D675, 'M', u'f'),
+    (0x1D676, 'M', u'g'),
+    (0x1D677, 'M', u'h'),
+    (0x1D678, 'M', u'i'),
+    (0x1D679, 'M', u'j'),
+    (0x1D67A, 'M', u'k'),
+    (0x1D67B, 'M', u'l'),
+    (0x1D67C, 'M', u'm'),
+    (0x1D67D, 'M', u'n'),
+    (0x1D67E, 'M', u'o'),
+    (0x1D67F, 'M', u'p'),
+    (0x1D680, 'M', u'q'),
+    (0x1D681, 'M', u'r'),
+    (0x1D682, 'M', u's'),
+    (0x1D683, 'M', u't'),
+    (0x1D684, 'M', u'u'),
+    (0x1D685, 'M', u'v'),
+    (0x1D686, 'M', u'w'),
+    (0x1D687, 'M', u'x'),
+    (0x1D688, 'M', u'y'),
+    (0x1D689, 'M', u'z'),
+    (0x1D68A, 'M', u'a'),
+    (0x1D68B, 'M', u'b'),
+    (0x1D68C, 'M', u'c'),
+    (0x1D68D, 'M', u'd'),
+    (0x1D68E, 'M', u'e'),
+    (0x1D68F, 'M', u'f'),
+    (0x1D690, 'M', u'g'),
+    (0x1D691, 'M', u'h'),
+    (0x1D692, 'M', u'i'),
+    (0x1D693, 'M', u'j'),
+    (0x1D694, 'M', u'k'),
+    (0x1D695, 'M', u'l'),
+    (0x1D696, 'M', u'm'),
+    (0x1D697, 'M', u'n'),
+    (0x1D698, 'M', u'o'),
+    (0x1D699, 'M', u'p'),
+    (0x1D69A, 'M', u'q'),
+    (0x1D69B, 'M', u'r'),
+    (0x1D69C, 'M', u's'),
+    (0x1D69D, 'M', u't'),
+    (0x1D69E, 'M', u'u'),
+    (0x1D69F, 'M', u'v'),
+    (0x1D6A0, 'M', u'w'),
+    (0x1D6A1, 'M', u'x'),
+    (0x1D6A2, 'M', u'y'),
+    (0x1D6A3, 'M', u'z'),
+    (0x1D6A4, 'M', u'ı'),
+    (0x1D6A5, 'M', u'ȷ'),
+    (0x1D6A6, 'X'),
+    (0x1D6A8, 'M', u'α'),
+    (0x1D6A9, 'M', u'β'),
+    (0x1D6AA, 'M', u'γ'),
+    (0x1D6AB, 'M', u'δ'),
+    (0x1D6AC, 'M', u'ε'),
+    (0x1D6AD, 'M', u'ζ'),
+    (0x1D6AE, 'M', u'η'),
+    (0x1D6AF, 'M', u'θ'),
+    (0x1D6B0, 'M', u'ι'),
+    ]
+
+def _seg_66():
+    return [
+    (0x1D6B1, 'M', u'κ'),
+    (0x1D6B2, 'M', u'λ'),
+    (0x1D6B3, 'M', u'μ'),
+    (0x1D6B4, 'M', u'ν'),
+    (0x1D6B5, 'M', u'ξ'),
+    (0x1D6B6, 'M', u'ο'),
+    (0x1D6B7, 'M', u'π'),
+    (0x1D6B8, 'M', u'ρ'),
+    (0x1D6B9, 'M', u'θ'),
+    (0x1D6BA, 'M', u'σ'),
+    (0x1D6BB, 'M', u'τ'),
+    (0x1D6BC, 'M', u'υ'),
+    (0x1D6BD, 'M', u'φ'),
+    (0x1D6BE, 'M', u'χ'),
+    (0x1D6BF, 'M', u'ψ'),
+    (0x1D6C0, 'M', u'ω'),
+    (0x1D6C1, 'M', u'∇'),
+    (0x1D6C2, 'M', u'α'),
+    (0x1D6C3, 'M', u'β'),
+    (0x1D6C4, 'M', u'γ'),
+    (0x1D6C5, 'M', u'δ'),
+    (0x1D6C6, 'M', u'ε'),
+    (0x1D6C7, 'M', u'ζ'),
+    (0x1D6C8, 'M', u'η'),
+    (0x1D6C9, 'M', u'θ'),
+    (0x1D6CA, 'M', u'ι'),
+    (0x1D6CB, 'M', u'κ'),
+    (0x1D6CC, 'M', u'λ'),
+    (0x1D6CD, 'M', u'μ'),
+    (0x1D6CE, 'M', u'ν'),
+    (0x1D6CF, 'M', u'ξ'),
+    (0x1D6D0, 'M', u'ο'),
+    (0x1D6D1, 'M', u'π'),
+    (0x1D6D2, 'M', u'ρ'),
+    (0x1D6D3, 'M', u'σ'),
+    (0x1D6D5, 'M', u'τ'),
+    (0x1D6D6, 'M', u'υ'),
+    (0x1D6D7, 'M', u'φ'),
+    (0x1D6D8, 'M', u'χ'),
+    (0x1D6D9, 'M', u'ψ'),
+    (0x1D6DA, 'M', u'ω'),
+    (0x1D6DB, 'M', u'∂'),
+    (0x1D6DC, 'M', u'ε'),
+    (0x1D6DD, 'M', u'θ'),
+    (0x1D6DE, 'M', u'κ'),
+    (0x1D6DF, 'M', u'φ'),
+    (0x1D6E0, 'M', u'ρ'),
+    (0x1D6E1, 'M', u'π'),
+    (0x1D6E2, 'M', u'α'),
+    (0x1D6E3, 'M', u'β'),
+    (0x1D6E4, 'M', u'γ'),
+    (0x1D6E5, 'M', u'δ'),
+    (0x1D6E6, 'M', u'ε'),
+    (0x1D6E7, 'M', u'ζ'),
+    (0x1D6E8, 'M', u'η'),
+    (0x1D6E9, 'M', u'θ'),
+    (0x1D6EA, 'M', u'ι'),
+    (0x1D6EB, 'M', u'κ'),
+    (0x1D6EC, 'M', u'λ'),
+    (0x1D6ED, 'M', u'μ'),
+    (0x1D6EE, 'M', u'ν'),
+    (0x1D6EF, 'M', u'ξ'),
+    (0x1D6F0, 'M', u'ο'),
+    (0x1D6F1, 'M', u'π'),
+    (0x1D6F2, 'M', u'ρ'),
+    (0x1D6F3, 'M', u'θ'),
+    (0x1D6F4, 'M', u'σ'),
+    (0x1D6F5, 'M', u'τ'),
+    (0x1D6F6, 'M', u'υ'),
+    (0x1D6F7, 'M', u'φ'),
+    (0x1D6F8, 'M', u'χ'),
+    (0x1D6F9, 'M', u'ψ'),
+    (0x1D6FA, 'M', u'ω'),
+    (0x1D6FB, 'M', u'∇'),
+    (0x1D6FC, 'M', u'α'),
+    (0x1D6FD, 'M', u'β'),
+    (0x1D6FE, 'M', u'γ'),
+    (0x1D6FF, 'M', u'δ'),
+    (0x1D700, 'M', u'ε'),
+    (0x1D701, 'M', u'ζ'),
+    (0x1D702, 'M', u'η'),
+    (0x1D703, 'M', u'θ'),
+    (0x1D704, 'M', u'ι'),
+    (0x1D705, 'M', u'κ'),
+    (0x1D706, 'M', u'λ'),
+    (0x1D707, 'M', u'μ'),
+    (0x1D708, 'M', u'ν'),
+    (0x1D709, 'M', u'ξ'),
+    (0x1D70A, 'M', u'ο'),
+    (0x1D70B, 'M', u'π'),
+    (0x1D70C, 'M', u'ρ'),
+    (0x1D70D, 'M', u'σ'),
+    (0x1D70F, 'M', u'τ'),
+    (0x1D710, 'M', u'υ'),
+    (0x1D711, 'M', u'φ'),
+    (0x1D712, 'M', u'χ'),
+    (0x1D713, 'M', u'ψ'),
+    (0x1D714, 'M', u'ω'),
+    (0x1D715, 'M', u'∂'),
+    (0x1D716, 'M', u'ε'),
+    ]
+
+def _seg_67():
+    return [
+    (0x1D717, 'M', u'θ'),
+    (0x1D718, 'M', u'κ'),
+    (0x1D719, 'M', u'φ'),
+    (0x1D71A, 'M', u'ρ'),
+    (0x1D71B, 'M', u'π'),
+    (0x1D71C, 'M', u'α'),
+    (0x1D71D, 'M', u'β'),
+    (0x1D71E, 'M', u'γ'),
+    (0x1D71F, 'M', u'δ'),
+    (0x1D720, 'M', u'ε'),
+    (0x1D721, 'M', u'ζ'),
+    (0x1D722, 'M', u'η'),
+    (0x1D723, 'M', u'θ'),
+    (0x1D724, 'M', u'ι'),
+    (0x1D725, 'M', u'κ'),
+    (0x1D726, 'M', u'λ'),
+    (0x1D727, 'M', u'μ'),
+    (0x1D728, 'M', u'ν'),
+    (0x1D729, 'M', u'ξ'),
+    (0x1D72A, 'M', u'ο'),
+    (0x1D72B, 'M', u'π'),
+    (0x1D72C, 'M', u'ρ'),
+    (0x1D72D, 'M', u'θ'),
+    (0x1D72E, 'M', u'σ'),
+    (0x1D72F, 'M', u'τ'),
+    (0x1D730, 'M', u'υ'),
+    (0x1D731, 'M', u'φ'),
+    (0x1D732, 'M', u'χ'),
+    (0x1D733, 'M', u'ψ'),
+    (0x1D734, 'M', u'ω'),
+    (0x1D735, 'M', u'∇'),
+    (0x1D736, 'M', u'α'),
+    (0x1D737, 'M', u'β'),
+    (0x1D738, 'M', u'γ'),
+    (0x1D739, 'M', u'δ'),
+    (0x1D73A, 'M', u'ε'),
+    (0x1D73B, 'M', u'ζ'),
+    (0x1D73C, 'M', u'η'),
+    (0x1D73D, 'M', u'θ'),
+    (0x1D73E, 'M', u'ι'),
+    (0x1D73F, 'M', u'κ'),
+    (0x1D740, 'M', u'λ'),
+    (0x1D741, 'M', u'μ'),
+    (0x1D742, 'M', u'ν'),
+    (0x1D743, 'M', u'ξ'),
+    (0x1D744, 'M', u'ο'),
+    (0x1D745, 'M', u'π'),
+    (0x1D746, 'M', u'ρ'),
+    (0x1D747, 'M', u'σ'),
+    (0x1D749, 'M', u'τ'),
+    (0x1D74A, 'M', u'υ'),
+    (0x1D74B, 'M', u'φ'),
+    (0x1D74C, 'M', u'χ'),
+    (0x1D74D, 'M', u'ψ'),
+    (0x1D74E, 'M', u'ω'),
+    (0x1D74F, 'M', u'∂'),
+    (0x1D750, 'M', u'ε'),
+    (0x1D751, 'M', u'θ'),
+    (0x1D752, 'M', u'κ'),
+    (0x1D753, 'M', u'φ'),
+    (0x1D754, 'M', u'ρ'),
+    (0x1D755, 'M', u'π'),
+    (0x1D756, 'M', u'α'),
+    (0x1D757, 'M', u'β'),
+    (0x1D758, 'M', u'γ'),
+    (0x1D759, 'M', u'δ'),
+    (0x1D75A, 'M', u'ε'),
+    (0x1D75B, 'M', u'ζ'),
+    (0x1D75C, 'M', u'η'),
+    (0x1D75D, 'M', u'θ'),
+    (0x1D75E, 'M', u'ι'),
+    (0x1D75F, 'M', u'κ'),
+    (0x1D760, 'M', u'λ'),
+    (0x1D761, 'M', u'μ'),
+    (0x1D762, 'M', u'ν'),
+    (0x1D763, 'M', u'ξ'),
+    (0x1D764, 'M', u'ο'),
+    (0x1D765, 'M', u'π'),
+    (0x1D766, 'M', u'ρ'),
+    (0x1D767, 'M', u'θ'),
+    (0x1D768, 'M', u'σ'),
+    (0x1D769, 'M', u'τ'),
+    (0x1D76A, 'M', u'υ'),
+    (0x1D76B, 'M', u'φ'),
+    (0x1D76C, 'M', u'χ'),
+    (0x1D76D, 'M', u'ψ'),
+    (0x1D76E, 'M', u'ω'),
+    (0x1D76F, 'M', u'∇'),
+    (0x1D770, 'M', u'α'),
+    (0x1D771, 'M', u'β'),
+    (0x1D772, 'M', u'γ'),
+    (0x1D773, 'M', u'δ'),
+    (0x1D774, 'M', u'ε'),
+    (0x1D775, 'M', u'ζ'),
+    (0x1D776, 'M', u'η'),
+    (0x1D777, 'M', u'θ'),
+    (0x1D778, 'M', u'ι'),
+    (0x1D779, 'M', u'κ'),
+    (0x1D77A, 'M', u'λ'),
+    (0x1D77B, 'M', u'μ'),
+    ]
+
+def _seg_68():
+    return [
+    (0x1D77C, 'M', u'ν'),
+    (0x1D77D, 'M', u'ξ'),
+    (0x1D77E, 'M', u'ο'),
+    (0x1D77F, 'M', u'π'),
+    (0x1D780, 'M', u'ρ'),
+    (0x1D781, 'M', u'σ'),
+    (0x1D783, 'M', u'τ'),
+    (0x1D784, 'M', u'υ'),
+    (0x1D785, 'M', u'φ'),
+    (0x1D786, 'M', u'χ'),
+    (0x1D787, 'M', u'ψ'),
+    (0x1D788, 'M', u'ω'),
+    (0x1D789, 'M', u'∂'),
+    (0x1D78A, 'M', u'ε'),
+    (0x1D78B, 'M', u'θ'),
+    (0x1D78C, 'M', u'κ'),
+    (0x1D78D, 'M', u'φ'),
+    (0x1D78E, 'M', u'ρ'),
+    (0x1D78F, 'M', u'π'),
+    (0x1D790, 'M', u'α'),
+    (0x1D791, 'M', u'β'),
+    (0x1D792, 'M', u'γ'),
+    (0x1D793, 'M', u'δ'),
+    (0x1D794, 'M', u'ε'),
+    (0x1D795, 'M', u'ζ'),
+    (0x1D796, 'M', u'η'),
+    (0x1D797, 'M', u'θ'),
+    (0x1D798, 'M', u'ι'),
+    (0x1D799, 'M', u'κ'),
+    (0x1D79A, 'M', u'λ'),
+    (0x1D79B, 'M', u'μ'),
+    (0x1D79C, 'M', u'ν'),
+    (0x1D79D, 'M', u'ξ'),
+    (0x1D79E, 'M', u'ο'),
+    (0x1D79F, 'M', u'π'),
+    (0x1D7A0, 'M', u'ρ'),
+    (0x1D7A1, 'M', u'θ'),
+    (0x1D7A2, 'M', u'σ'),
+    (0x1D7A3, 'M', u'τ'),
+    (0x1D7A4, 'M', u'υ'),
+    (0x1D7A5, 'M', u'φ'),
+    (0x1D7A6, 'M', u'χ'),
+    (0x1D7A7, 'M', u'ψ'),
+    (0x1D7A8, 'M', u'ω'),
+    (0x1D7A9, 'M', u'∇'),
+    (0x1D7AA, 'M', u'α'),
+    (0x1D7AB, 'M', u'β'),
+    (0x1D7AC, 'M', u'γ'),
+    (0x1D7AD, 'M', u'δ'),
+    (0x1D7AE, 'M', u'ε'),
+    (0x1D7AF, 'M', u'ζ'),
+    (0x1D7B0, 'M', u'η'),
+    (0x1D7B1, 'M', u'θ'),
+    (0x1D7B2, 'M', u'ι'),
+    (0x1D7B3, 'M', u'κ'),
+    (0x1D7B4, 'M', u'λ'),
+    (0x1D7B5, 'M', u'μ'),
+    (0x1D7B6, 'M', u'ν'),
+    (0x1D7B7, 'M', u'ξ'),
+    (0x1D7B8, 'M', u'ο'),
+    (0x1D7B9, 'M', u'π'),
+    (0x1D7BA, 'M', u'ρ'),
+    (0x1D7BB, 'M', u'σ'),
+    (0x1D7BD, 'M', u'τ'),
+    (0x1D7BE, 'M', u'υ'),
+    (0x1D7BF, 'M', u'φ'),
+    (0x1D7C0, 'M', u'χ'),
+    (0x1D7C1, 'M', u'ψ'),
+    (0x1D7C2, 'M', u'ω'),
+    (0x1D7C3, 'M', u'∂'),
+    (0x1D7C4, 'M', u'ε'),
+    (0x1D7C5, 'M', u'θ'),
+    (0x1D7C6, 'M', u'κ'),
+    (0x1D7C7, 'M', u'φ'),
+    (0x1D7C8, 'M', u'ρ'),
+    (0x1D7C9, 'M', u'π'),
+    (0x1D7CA, 'M', u'ϝ'),
+    (0x1D7CC, 'X'),
+    (0x1D7CE, 'M', u'0'),
+    (0x1D7CF, 'M', u'1'),
+    (0x1D7D0, 'M', u'2'),
+    (0x1D7D1, 'M', u'3'),
+    (0x1D7D2, 'M', u'4'),
+    (0x1D7D3, 'M', u'5'),
+    (0x1D7D4, 'M', u'6'),
+    (0x1D7D5, 'M', u'7'),
+    (0x1D7D6, 'M', u'8'),
+    (0x1D7D7, 'M', u'9'),
+    (0x1D7D8, 'M', u'0'),
+    (0x1D7D9, 'M', u'1'),
+    (0x1D7DA, 'M', u'2'),
+    (0x1D7DB, 'M', u'3'),
+    (0x1D7DC, 'M', u'4'),
+    (0x1D7DD, 'M', u'5'),
+    (0x1D7DE, 'M', u'6'),
+    (0x1D7DF, 'M', u'7'),
+    (0x1D7E0, 'M', u'8'),
+    (0x1D7E1, 'M', u'9'),
+    (0x1D7E2, 'M', u'0'),
+    (0x1D7E3, 'M', u'1'),
+    ]
+
+def _seg_69():
+    return [
+    (0x1D7E4, 'M', u'2'),
+    (0x1D7E5, 'M', u'3'),
+    (0x1D7E6, 'M', u'4'),
+    (0x1D7E7, 'M', u'5'),
+    (0x1D7E8, 'M', u'6'),
+    (0x1D7E9, 'M', u'7'),
+    (0x1D7EA, 'M', u'8'),
+    (0x1D7EB, 'M', u'9'),
+    (0x1D7EC, 'M', u'0'),
+    (0x1D7ED, 'M', u'1'),
+    (0x1D7EE, 'M', u'2'),
+    (0x1D7EF, 'M', u'3'),
+    (0x1D7F0, 'M', u'4'),
+    (0x1D7F1, 'M', u'5'),
+    (0x1D7F2, 'M', u'6'),
+    (0x1D7F3, 'M', u'7'),
+    (0x1D7F4, 'M', u'8'),
+    (0x1D7F5, 'M', u'9'),
+    (0x1D7F6, 'M', u'0'),
+    (0x1D7F7, 'M', u'1'),
+    (0x1D7F8, 'M', u'2'),
+    (0x1D7F9, 'M', u'3'),
+    (0x1D7FA, 'M', u'4'),
+    (0x1D7FB, 'M', u'5'),
+    (0x1D7FC, 'M', u'6'),
+    (0x1D7FD, 'M', u'7'),
+    (0x1D7FE, 'M', u'8'),
+    (0x1D7FF, 'M', u'9'),
+    (0x1D800, 'V'),
+    (0x1DA8C, 'X'),
+    (0x1DA9B, 'V'),
+    (0x1DAA0, 'X'),
+    (0x1DAA1, 'V'),
+    (0x1DAB0, 'X'),
+    (0x1E000, 'V'),
+    (0x1E007, 'X'),
+    (0x1E008, 'V'),
+    (0x1E019, 'X'),
+    (0x1E01B, 'V'),
+    (0x1E022, 'X'),
+    (0x1E023, 'V'),
+    (0x1E025, 'X'),
+    (0x1E026, 'V'),
+    (0x1E02B, 'X'),
+    (0x1E100, 'V'),
+    (0x1E12D, 'X'),
+    (0x1E130, 'V'),
+    (0x1E13E, 'X'),
+    (0x1E140, 'V'),
+    (0x1E14A, 'X'),
+    (0x1E14E, 'V'),
+    (0x1E150, 'X'),
+    (0x1E2C0, 'V'),
+    (0x1E2FA, 'X'),
+    (0x1E2FF, 'V'),
+    (0x1E300, 'X'),
+    (0x1E800, 'V'),
+    (0x1E8C5, 'X'),
+    (0x1E8C7, 'V'),
+    (0x1E8D7, 'X'),
+    (0x1E900, 'M', u'𞤢'),
+    (0x1E901, 'M', u'𞤣'),
+    (0x1E902, 'M', u'𞤤'),
+    (0x1E903, 'M', u'𞤥'),
+    (0x1E904, 'M', u'𞤦'),
+    (0x1E905, 'M', u'𞤧'),
+    (0x1E906, 'M', u'𞤨'),
+    (0x1E907, 'M', u'𞤩'),
+    (0x1E908, 'M', u'𞤪'),
+    (0x1E909, 'M', u'𞤫'),
+    (0x1E90A, 'M', u'𞤬'),
+    (0x1E90B, 'M', u'𞤭'),
+    (0x1E90C, 'M', u'𞤮'),
+    (0x1E90D, 'M', u'𞤯'),
+    (0x1E90E, 'M', u'𞤰'),
+    (0x1E90F, 'M', u'𞤱'),
+    (0x1E910, 'M', u'𞤲'),
+    (0x1E911, 'M', u'𞤳'),
+    (0x1E912, 'M', u'𞤴'),
+    (0x1E913, 'M', u'𞤵'),
+    (0x1E914, 'M', u'𞤶'),
+    (0x1E915, 'M', u'𞤷'),
+    (0x1E916, 'M', u'𞤸'),
+    (0x1E917, 'M', u'𞤹'),
+    (0x1E918, 'M', u'𞤺'),
+    (0x1E919, 'M', u'𞤻'),
+    (0x1E91A, 'M', u'𞤼'),
+    (0x1E91B, 'M', u'𞤽'),
+    (0x1E91C, 'M', u'𞤾'),
+    (0x1E91D, 'M', u'𞤿'),
+    (0x1E91E, 'M', u'𞥀'),
+    (0x1E91F, 'M', u'𞥁'),
+    (0x1E920, 'M', u'𞥂'),
+    (0x1E921, 'M', u'𞥃'),
+    (0x1E922, 'V'),
+    (0x1E94C, 'X'),
+    (0x1E950, 'V'),
+    (0x1E95A, 'X'),
+    (0x1E95E, 'V'),
+    (0x1E960, 'X'),
+    ]
+
+def _seg_70():
+    return [
+    (0x1EC71, 'V'),
+    (0x1ECB5, 'X'),
+    (0x1ED01, 'V'),
+    (0x1ED3E, 'X'),
+    (0x1EE00, 'M', u'ا'),
+    (0x1EE01, 'M', u'ب'),
+    (0x1EE02, 'M', u'ج'),
+    (0x1EE03, 'M', u'د'),
+    (0x1EE04, 'X'),
+    (0x1EE05, 'M', u'و'),
+    (0x1EE06, 'M', u'ز'),
+    (0x1EE07, 'M', u'ح'),
+    (0x1EE08, 'M', u'ط'),
+    (0x1EE09, 'M', u'ي'),
+    (0x1EE0A, 'M', u'ك'),
+    (0x1EE0B, 'M', u'ل'),
+    (0x1EE0C, 'M', u'م'),
+    (0x1EE0D, 'M', u'ن'),
+    (0x1EE0E, 'M', u'س'),
+    (0x1EE0F, 'M', u'ع'),
+    (0x1EE10, 'M', u'ف'),
+    (0x1EE11, 'M', u'ص'),
+    (0x1EE12, 'M', u'ق'),
+    (0x1EE13, 'M', u'ر'),
+    (0x1EE14, 'M', u'ش'),
+    (0x1EE15, 'M', u'ت'),
+    (0x1EE16, 'M', u'ث'),
+    (0x1EE17, 'M', u'خ'),
+    (0x1EE18, 'M', u'ذ'),
+    (0x1EE19, 'M', u'ض'),
+    (0x1EE1A, 'M', u'ظ'),
+    (0x1EE1B, 'M', u'غ'),
+    (0x1EE1C, 'M', u'ٮ'),
+    (0x1EE1D, 'M', u'ں'),
+    (0x1EE1E, 'M', u'ڡ'),
+    (0x1EE1F, 'M', u'ٯ'),
+    (0x1EE20, 'X'),
+    (0x1EE21, 'M', u'ب'),
+    (0x1EE22, 'M', u'ج'),
+    (0x1EE23, 'X'),
+    (0x1EE24, 'M', u'ه'),
+    (0x1EE25, 'X'),
+    (0x1EE27, 'M', u'ح'),
+    (0x1EE28, 'X'),
+    (0x1EE29, 'M', u'ي'),
+    (0x1EE2A, 'M', u'ك'),
+    (0x1EE2B, 'M', u'ل'),
+    (0x1EE2C, 'M', u'م'),
+    (0x1EE2D, 'M', u'ن'),
+    (0x1EE2E, 'M', u'س'),
+    (0x1EE2F, 'M', u'ع'),
+    (0x1EE30, 'M', u'ف'),
+    (0x1EE31, 'M', u'ص'),
+    (0x1EE32, 'M', u'ق'),
+    (0x1EE33, 'X'),
+    (0x1EE34, 'M', u'ش'),
+    (0x1EE35, 'M', u'ت'),
+    (0x1EE36, 'M', u'ث'),
+    (0x1EE37, 'M', u'خ'),
+    (0x1EE38, 'X'),
+    (0x1EE39, 'M', u'ض'),
+    (0x1EE3A, 'X'),
+    (0x1EE3B, 'M', u'غ'),
+    (0x1EE3C, 'X'),
+    (0x1EE42, 'M', u'ج'),
+    (0x1EE43, 'X'),
+    (0x1EE47, 'M', u'ح'),
+    (0x1EE48, 'X'),
+    (0x1EE49, 'M', u'ي'),
+    (0x1EE4A, 'X'),
+    (0x1EE4B, 'M', u'ل'),
+    (0x1EE4C, 'X'),
+    (0x1EE4D, 'M', u'ن'),
+    (0x1EE4E, 'M', u'س'),
+    (0x1EE4F, 'M', u'ع'),
+    (0x1EE50, 'X'),
+    (0x1EE51, 'M', u'ص'),
+    (0x1EE52, 'M', u'ق'),
+    (0x1EE53, 'X'),
+    (0x1EE54, 'M', u'ش'),
+    (0x1EE55, 'X'),
+    (0x1EE57, 'M', u'خ'),
+    (0x1EE58, 'X'),
+    (0x1EE59, 'M', u'ض'),
+    (0x1EE5A, 'X'),
+    (0x1EE5B, 'M', u'غ'),
+    (0x1EE5C, 'X'),
+    (0x1EE5D, 'M', u'ں'),
+    (0x1EE5E, 'X'),
+    (0x1EE5F, 'M', u'ٯ'),
+    (0x1EE60, 'X'),
+    (0x1EE61, 'M', u'ب'),
+    (0x1EE62, 'M', u'ج'),
+    (0x1EE63, 'X'),
+    (0x1EE64, 'M', u'ه'),
+    (0x1EE65, 'X'),
+    (0x1EE67, 'M', u'ح'),
+    (0x1EE68, 'M', u'ط'),
+    (0x1EE69, 'M', u'ي'),
+    (0x1EE6A, 'M', u'ك'),
+    ]
+
+def _seg_71():
+    return [
+    (0x1EE6B, 'X'),
+    (0x1EE6C, 'M', u'م'),
+    (0x1EE6D, 'M', u'ن'),
+    (0x1EE6E, 'M', u'س'),
+    (0x1EE6F, 'M', u'ع'),
+    (0x1EE70, 'M', u'ف'),
+    (0x1EE71, 'M', u'ص'),
+    (0x1EE72, 'M', u'ق'),
+    (0x1EE73, 'X'),
+    (0x1EE74, 'M', u'ش'),
+    (0x1EE75, 'M', u'ت'),
+    (0x1EE76, 'M', u'ث'),
+    (0x1EE77, 'M', u'خ'),
+    (0x1EE78, 'X'),
+    (0x1EE79, 'M', u'ض'),
+    (0x1EE7A, 'M', u'ظ'),
+    (0x1EE7B, 'M', u'غ'),
+    (0x1EE7C, 'M', u'ٮ'),
+    (0x1EE7D, 'X'),
+    (0x1EE7E, 'M', u'ڡ'),
+    (0x1EE7F, 'X'),
+    (0x1EE80, 'M', u'ا'),
+    (0x1EE81, 'M', u'ب'),
+    (0x1EE82, 'M', u'ج'),
+    (0x1EE83, 'M', u'د'),
+    (0x1EE84, 'M', u'ه'),
+    (0x1EE85, 'M', u'و'),
+    (0x1EE86, 'M', u'ز'),
+    (0x1EE87, 'M', u'ح'),
+    (0x1EE88, 'M', u'ط'),
+    (0x1EE89, 'M', u'ي'),
+    (0x1EE8A, 'X'),
+    (0x1EE8B, 'M', u'ل'),
+    (0x1EE8C, 'M', u'م'),
+    (0x1EE8D, 'M', u'ن'),
+    (0x1EE8E, 'M', u'س'),
+    (0x1EE8F, 'M', u'ع'),
+    (0x1EE90, 'M', u'ف'),
+    (0x1EE91, 'M', u'ص'),
+    (0x1EE92, 'M', u'ق'),
+    (0x1EE93, 'M', u'ر'),
+    (0x1EE94, 'M', u'ش'),
+    (0x1EE95, 'M', u'ت'),
+    (0x1EE96, 'M', u'ث'),
+    (0x1EE97, 'M', u'خ'),
+    (0x1EE98, 'M', u'ذ'),
+    (0x1EE99, 'M', u'ض'),
+    (0x1EE9A, 'M', u'ظ'),
+    (0x1EE9B, 'M', u'غ'),
+    (0x1EE9C, 'X'),
+    (0x1EEA1, 'M', u'ب'),
+    (0x1EEA2, 'M', u'ج'),
+    (0x1EEA3, 'M', u'د'),
+    (0x1EEA4, 'X'),
+    (0x1EEA5, 'M', u'و'),
+    (0x1EEA6, 'M', u'ز'),
+    (0x1EEA7, 'M', u'ح'),
+    (0x1EEA8, 'M', u'ط'),
+    (0x1EEA9, 'M', u'ي'),
+    (0x1EEAA, 'X'),
+    (0x1EEAB, 'M', u'ل'),
+    (0x1EEAC, 'M', u'م'),
+    (0x1EEAD, 'M', u'ن'),
+    (0x1EEAE, 'M', u'س'),
+    (0x1EEAF, 'M', u'ع'),
+    (0x1EEB0, 'M', u'ف'),
+    (0x1EEB1, 'M', u'ص'),
+    (0x1EEB2, 'M', u'ق'),
+    (0x1EEB3, 'M', u'ر'),
+    (0x1EEB4, 'M', u'ش'),
+    (0x1EEB5, 'M', u'ت'),
+    (0x1EEB6, 'M', u'ث'),
+    (0x1EEB7, 'M', u'خ'),
+    (0x1EEB8, 'M', u'ذ'),
+    (0x1EEB9, 'M', u'ض'),
+    (0x1EEBA, 'M', u'ظ'),
+    (0x1EEBB, 'M', u'غ'),
+    (0x1EEBC, 'X'),
+    (0x1EEF0, 'V'),
+    (0x1EEF2, 'X'),
+    (0x1F000, 'V'),
+    (0x1F02C, 'X'),
+    (0x1F030, 'V'),
+    (0x1F094, 'X'),
+    (0x1F0A0, 'V'),
+    (0x1F0AF, 'X'),
+    (0x1F0B1, 'V'),
+    (0x1F0C0, 'X'),
+    (0x1F0C1, 'V'),
+    (0x1F0D0, 'X'),
+    (0x1F0D1, 'V'),
+    (0x1F0F6, 'X'),
+    (0x1F101, '3', u'0,'),
+    (0x1F102, '3', u'1,'),
+    (0x1F103, '3', u'2,'),
+    (0x1F104, '3', u'3,'),
+    (0x1F105, '3', u'4,'),
+    (0x1F106, '3', u'5,'),
+    (0x1F107, '3', u'6,'),
+    (0x1F108, '3', u'7,'),
+    ]
+
+def _seg_72():
+    return [
+    (0x1F109, '3', u'8,'),
+    (0x1F10A, '3', u'9,'),
+    (0x1F10B, 'V'),
+    (0x1F110, '3', u'(a)'),
+    (0x1F111, '3', u'(b)'),
+    (0x1F112, '3', u'(c)'),
+    (0x1F113, '3', u'(d)'),
+    (0x1F114, '3', u'(e)'),
+    (0x1F115, '3', u'(f)'),
+    (0x1F116, '3', u'(g)'),
+    (0x1F117, '3', u'(h)'),
+    (0x1F118, '3', u'(i)'),
+    (0x1F119, '3', u'(j)'),
+    (0x1F11A, '3', u'(k)'),
+    (0x1F11B, '3', u'(l)'),
+    (0x1F11C, '3', u'(m)'),
+    (0x1F11D, '3', u'(n)'),
+    (0x1F11E, '3', u'(o)'),
+    (0x1F11F, '3', u'(p)'),
+    (0x1F120, '3', u'(q)'),
+    (0x1F121, '3', u'(r)'),
+    (0x1F122, '3', u'(s)'),
+    (0x1F123, '3', u'(t)'),
+    (0x1F124, '3', u'(u)'),
+    (0x1F125, '3', u'(v)'),
+    (0x1F126, '3', u'(w)'),
+    (0x1F127, '3', u'(x)'),
+    (0x1F128, '3', u'(y)'),
+    (0x1F129, '3', u'(z)'),
+    (0x1F12A, 'M', u'〔s〕'),
+    (0x1F12B, 'M', u'c'),
+    (0x1F12C, 'M', u'r'),
+    (0x1F12D, 'M', u'cd'),
+    (0x1F12E, 'M', u'wz'),
+    (0x1F12F, 'V'),
+    (0x1F130, 'M', u'a'),
+    (0x1F131, 'M', u'b'),
+    (0x1F132, 'M', u'c'),
+    (0x1F133, 'M', u'd'),
+    (0x1F134, 'M', u'e'),
+    (0x1F135, 'M', u'f'),
+    (0x1F136, 'M', u'g'),
+    (0x1F137, 'M', u'h'),
+    (0x1F138, 'M', u'i'),
+    (0x1F139, 'M', u'j'),
+    (0x1F13A, 'M', u'k'),
+    (0x1F13B, 'M', u'l'),
+    (0x1F13C, 'M', u'm'),
+    (0x1F13D, 'M', u'n'),
+    (0x1F13E, 'M', u'o'),
+    (0x1F13F, 'M', u'p'),
+    (0x1F140, 'M', u'q'),
+    (0x1F141, 'M', u'r'),
+    (0x1F142, 'M', u's'),
+    (0x1F143, 'M', u't'),
+    (0x1F144, 'M', u'u'),
+    (0x1F145, 'M', u'v'),
+    (0x1F146, 'M', u'w'),
+    (0x1F147, 'M', u'x'),
+    (0x1F148, 'M', u'y'),
+    (0x1F149, 'M', u'z'),
+    (0x1F14A, 'M', u'hv'),
+    (0x1F14B, 'M', u'mv'),
+    (0x1F14C, 'M', u'sd'),
+    (0x1F14D, 'M', u'ss'),
+    (0x1F14E, 'M', u'ppv'),
+    (0x1F14F, 'M', u'wc'),
+    (0x1F150, 'V'),
+    (0x1F16A, 'M', u'mc'),
+    (0x1F16B, 'M', u'md'),
+    (0x1F16C, 'M', u'mr'),
+    (0x1F16D, 'V'),
+    (0x1F190, 'M', u'dj'),
+    (0x1F191, 'V'),
+    (0x1F1AE, 'X'),
+    (0x1F1E6, 'V'),
+    (0x1F200, 'M', u'ほか'),
+    (0x1F201, 'M', u'ココ'),
+    (0x1F202, 'M', u'サ'),
+    (0x1F203, 'X'),
+    (0x1F210, 'M', u'手'),
+    (0x1F211, 'M', u'字'),
+    (0x1F212, 'M', u'双'),
+    (0x1F213, 'M', u'デ'),
+    (0x1F214, 'M', u'二'),
+    (0x1F215, 'M', u'多'),
+    (0x1F216, 'M', u'解'),
+    (0x1F217, 'M', u'天'),
+    (0x1F218, 'M', u'交'),
+    (0x1F219, 'M', u'映'),
+    (0x1F21A, 'M', u'無'),
+    (0x1F21B, 'M', u'料'),
+    (0x1F21C, 'M', u'前'),
+    (0x1F21D, 'M', u'後'),
+    (0x1F21E, 'M', u'再'),
+    (0x1F21F, 'M', u'新'),
+    (0x1F220, 'M', u'初'),
+    (0x1F221, 'M', u'終'),
+    (0x1F222, 'M', u'生'),
+    (0x1F223, 'M', u'販'),
+    ]
+
+def _seg_73():
+    return [
+    (0x1F224, 'M', u'声'),
+    (0x1F225, 'M', u'吹'),
+    (0x1F226, 'M', u'演'),
+    (0x1F227, 'M', u'投'),
+    (0x1F228, 'M', u'捕'),
+    (0x1F229, 'M', u'一'),
+    (0x1F22A, 'M', u'三'),
+    (0x1F22B, 'M', u'遊'),
+    (0x1F22C, 'M', u'左'),
+    (0x1F22D, 'M', u'中'),
+    (0x1F22E, 'M', u'右'),
+    (0x1F22F, 'M', u'指'),
+    (0x1F230, 'M', u'走'),
+    (0x1F231, 'M', u'打'),
+    (0x1F232, 'M', u'禁'),
+    (0x1F233, 'M', u'空'),
+    (0x1F234, 'M', u'合'),
+    (0x1F235, 'M', u'満'),
+    (0x1F236, 'M', u'有'),
+    (0x1F237, 'M', u'月'),
+    (0x1F238, 'M', u'申'),
+    (0x1F239, 'M', u'割'),
+    (0x1F23A, 'M', u'営'),
+    (0x1F23B, 'M', u'配'),
+    (0x1F23C, 'X'),
+    (0x1F240, 'M', u'〔本〕'),
+    (0x1F241, 'M', u'〔三〕'),
+    (0x1F242, 'M', u'〔二〕'),
+    (0x1F243, 'M', u'〔安〕'),
+    (0x1F244, 'M', u'〔点〕'),
+    (0x1F245, 'M', u'〔打〕'),
+    (0x1F246, 'M', u'〔盗〕'),
+    (0x1F247, 'M', u'〔勝〕'),
+    (0x1F248, 'M', u'〔敗〕'),
+    (0x1F249, 'X'),
+    (0x1F250, 'M', u'得'),
+    (0x1F251, 'M', u'可'),
+    (0x1F252, 'X'),
+    (0x1F260, 'V'),
+    (0x1F266, 'X'),
+    (0x1F300, 'V'),
+    (0x1F6D8, 'X'),
+    (0x1F6E0, 'V'),
+    (0x1F6ED, 'X'),
+    (0x1F6F0, 'V'),
+    (0x1F6FD, 'X'),
+    (0x1F700, 'V'),
+    (0x1F774, 'X'),
+    (0x1F780, 'V'),
+    (0x1F7D9, 'X'),
+    (0x1F7E0, 'V'),
+    (0x1F7EC, 'X'),
+    (0x1F800, 'V'),
+    (0x1F80C, 'X'),
+    (0x1F810, 'V'),
+    (0x1F848, 'X'),
+    (0x1F850, 'V'),
+    (0x1F85A, 'X'),
+    (0x1F860, 'V'),
+    (0x1F888, 'X'),
+    (0x1F890, 'V'),
+    (0x1F8AE, 'X'),
+    (0x1F8B0, 'V'),
+    (0x1F8B2, 'X'),
+    (0x1F900, 'V'),
+    (0x1F979, 'X'),
+    (0x1F97A, 'V'),
+    (0x1F9CC, 'X'),
+    (0x1F9CD, 'V'),
+    (0x1FA54, 'X'),
+    (0x1FA60, 'V'),
+    (0x1FA6E, 'X'),
+    (0x1FA70, 'V'),
+    (0x1FA75, 'X'),
+    (0x1FA78, 'V'),
+    (0x1FA7B, 'X'),
+    (0x1FA80, 'V'),
+    (0x1FA87, 'X'),
+    (0x1FA90, 'V'),
+    (0x1FAA9, 'X'),
+    (0x1FAB0, 'V'),
+    (0x1FAB7, 'X'),
+    (0x1FAC0, 'V'),
+    (0x1FAC3, 'X'),
+    (0x1FAD0, 'V'),
+    (0x1FAD7, 'X'),
+    (0x1FB00, 'V'),
+    (0x1FB93, 'X'),
+    (0x1FB94, 'V'),
+    (0x1FBCB, 'X'),
+    (0x1FBF0, 'M', u'0'),
+    (0x1FBF1, 'M', u'1'),
+    (0x1FBF2, 'M', u'2'),
+    (0x1FBF3, 'M', u'3'),
+    (0x1FBF4, 'M', u'4'),
+    (0x1FBF5, 'M', u'5'),
+    (0x1FBF6, 'M', u'6'),
+    (0x1FBF7, 'M', u'7'),
+    (0x1FBF8, 'M', u'8'),
+    (0x1FBF9, 'M', u'9'),
+    ]
+
+def _seg_74():
+    return [
+    (0x1FBFA, 'X'),
+    (0x20000, 'V'),
+    (0x2A6DE, 'X'),
+    (0x2A700, 'V'),
+    (0x2B735, 'X'),
+    (0x2B740, 'V'),
+    (0x2B81E, 'X'),
+    (0x2B820, 'V'),
+    (0x2CEA2, 'X'),
+    (0x2CEB0, 'V'),
+    (0x2EBE1, 'X'),
+    (0x2F800, 'M', u'丽'),
+    (0x2F801, 'M', u'丸'),
+    (0x2F802, 'M', u'乁'),
+    (0x2F803, 'M', u'𠄢'),
+    (0x2F804, 'M', u'你'),
+    (0x2F805, 'M', u'侮'),
+    (0x2F806, 'M', u'侻'),
+    (0x2F807, 'M', u'倂'),
+    (0x2F808, 'M', u'偺'),
+    (0x2F809, 'M', u'備'),
+    (0x2F80A, 'M', u'僧'),
+    (0x2F80B, 'M', u'像'),
+    (0x2F80C, 'M', u'㒞'),
+    (0x2F80D, 'M', u'𠘺'),
+    (0x2F80E, 'M', u'免'),
+    (0x2F80F, 'M', u'兔'),
+    (0x2F810, 'M', u'兤'),
+    (0x2F811, 'M', u'具'),
+    (0x2F812, 'M', u'𠔜'),
+    (0x2F813, 'M', u'㒹'),
+    (0x2F814, 'M', u'內'),
+    (0x2F815, 'M', u'再'),
+    (0x2F816, 'M', u'𠕋'),
+    (0x2F817, 'M', u'冗'),
+    (0x2F818, 'M', u'冤'),
+    (0x2F819, 'M', u'仌'),
+    (0x2F81A, 'M', u'冬'),
+    (0x2F81B, 'M', u'况'),
+    (0x2F81C, 'M', u'𩇟'),
+    (0x2F81D, 'M', u'凵'),
+    (0x2F81E, 'M', u'刃'),
+    (0x2F81F, 'M', u'㓟'),
+    (0x2F820, 'M', u'刻'),
+    (0x2F821, 'M', u'剆'),
+    (0x2F822, 'M', u'割'),
+    (0x2F823, 'M', u'剷'),
+    (0x2F824, 'M', u'㔕'),
+    (0x2F825, 'M', u'勇'),
+    (0x2F826, 'M', u'勉'),
+    (0x2F827, 'M', u'勤'),
+    (0x2F828, 'M', u'勺'),
+    (0x2F829, 'M', u'包'),
+    (0x2F82A, 'M', u'匆'),
+    (0x2F82B, 'M', u'北'),
+    (0x2F82C, 'M', u'卉'),
+    (0x2F82D, 'M', u'卑'),
+    (0x2F82E, 'M', u'博'),
+    (0x2F82F, 'M', u'即'),
+    (0x2F830, 'M', u'卽'),
+    (0x2F831, 'M', u'卿'),
+    (0x2F834, 'M', u'𠨬'),
+    (0x2F835, 'M', u'灰'),
+    (0x2F836, 'M', u'及'),
+    (0x2F837, 'M', u'叟'),
+    (0x2F838, 'M', u'𠭣'),
+    (0x2F839, 'M', u'叫'),
+    (0x2F83A, 'M', u'叱'),
+    (0x2F83B, 'M', u'吆'),
+    (0x2F83C, 'M', u'咞'),
+    (0x2F83D, 'M', u'吸'),
+    (0x2F83E, 'M', u'呈'),
+    (0x2F83F, 'M', u'周'),
+    (0x2F840, 'M', u'咢'),
+    (0x2F841, 'M', u'哶'),
+    (0x2F842, 'M', u'唐'),
+    (0x2F843, 'M', u'啓'),
+    (0x2F844, 'M', u'啣'),
+    (0x2F845, 'M', u'善'),
+    (0x2F847, 'M', u'喙'),
+    (0x2F848, 'M', u'喫'),
+    (0x2F849, 'M', u'喳'),
+    (0x2F84A, 'M', u'嗂'),
+    (0x2F84B, 'M', u'圖'),
+    (0x2F84C, 'M', u'嘆'),
+    (0x2F84D, 'M', u'圗'),
+    (0x2F84E, 'M', u'噑'),
+    (0x2F84F, 'M', u'噴'),
+    (0x2F850, 'M', u'切'),
+    (0x2F851, 'M', u'壮'),
+    (0x2F852, 'M', u'城'),
+    (0x2F853, 'M', u'埴'),
+    (0x2F854, 'M', u'堍'),
+    (0x2F855, 'M', u'型'),
+    (0x2F856, 'M', u'堲'),
+    (0x2F857, 'M', u'報'),
+    (0x2F858, 'M', u'墬'),
+    (0x2F859, 'M', u'𡓤'),
+    (0x2F85A, 'M', u'売'),
+    (0x2F85B, 'M', u'壷'),
+    ]
+
+def _seg_75():
+    return [
+    (0x2F85C, 'M', u'夆'),
+    (0x2F85D, 'M', u'多'),
+    (0x2F85E, 'M', u'夢'),
+    (0x2F85F, 'M', u'奢'),
+    (0x2F860, 'M', u'𡚨'),
+    (0x2F861, 'M', u'𡛪'),
+    (0x2F862, 'M', u'姬'),
+    (0x2F863, 'M', u'娛'),
+    (0x2F864, 'M', u'娧'),
+    (0x2F865, 'M', u'姘'),
+    (0x2F866, 'M', u'婦'),
+    (0x2F867, 'M', u'㛮'),
+    (0x2F868, 'X'),
+    (0x2F869, 'M', u'嬈'),
+    (0x2F86A, 'M', u'嬾'),
+    (0x2F86C, 'M', u'𡧈'),
+    (0x2F86D, 'M', u'寃'),
+    (0x2F86E, 'M', u'寘'),
+    (0x2F86F, 'M', u'寧'),
+    (0x2F870, 'M', u'寳'),
+    (0x2F871, 'M', u'𡬘'),
+    (0x2F872, 'M', u'寿'),
+    (0x2F873, 'M', u'将'),
+    (0x2F874, 'X'),
+    (0x2F875, 'M', u'尢'),
+    (0x2F876, 'M', u'㞁'),
+    (0x2F877, 'M', u'屠'),
+    (0x2F878, 'M', u'屮'),
+    (0x2F879, 'M', u'峀'),
+    (0x2F87A, 'M', u'岍'),
+    (0x2F87B, 'M', u'𡷤'),
+    (0x2F87C, 'M', u'嵃'),
+    (0x2F87D, 'M', u'𡷦'),
+    (0x2F87E, 'M', u'嵮'),
+    (0x2F87F, 'M', u'嵫'),
+    (0x2F880, 'M', u'嵼'),
+    (0x2F881, 'M', u'巡'),
+    (0x2F882, 'M', u'巢'),
+    (0x2F883, 'M', u'㠯'),
+    (0x2F884, 'M', u'巽'),
+    (0x2F885, 'M', u'帨'),
+    (0x2F886, 'M', u'帽'),
+    (0x2F887, 'M', u'幩'),
+    (0x2F888, 'M', u'㡢'),
+    (0x2F889, 'M', u'𢆃'),
+    (0x2F88A, 'M', u'㡼'),
+    (0x2F88B, 'M', u'庰'),
+    (0x2F88C, 'M', u'庳'),
+    (0x2F88D, 'M', u'庶'),
+    (0x2F88E, 'M', u'廊'),
+    (0x2F88F, 'M', u'𪎒'),
+    (0x2F890, 'M', u'廾'),
+    (0x2F891, 'M', u'𢌱'),
+    (0x2F893, 'M', u'舁'),
+    (0x2F894, 'M', u'弢'),
+    (0x2F896, 'M', u'㣇'),
+    (0x2F897, 'M', u'𣊸'),
+    (0x2F898, 'M', u'𦇚'),
+    (0x2F899, 'M', u'形'),
+    (0x2F89A, 'M', u'彫'),
+    (0x2F89B, 'M', u'㣣'),
+    (0x2F89C, 'M', u'徚'),
+    (0x2F89D, 'M', u'忍'),
+    (0x2F89E, 'M', u'志'),
+    (0x2F89F, 'M', u'忹'),
+    (0x2F8A0, 'M', u'悁'),
+    (0x2F8A1, 'M', u'㤺'),
+    (0x2F8A2, 'M', u'㤜'),
+    (0x2F8A3, 'M', u'悔'),
+    (0x2F8A4, 'M', u'𢛔'),
+    (0x2F8A5, 'M', u'惇'),
+    (0x2F8A6, 'M', u'慈'),
+    (0x2F8A7, 'M', u'慌'),
+    (0x2F8A8, 'M', u'慎'),
+    (0x2F8A9, 'M', u'慌'),
+    (0x2F8AA, 'M', u'慺'),
+    (0x2F8AB, 'M', u'憎'),
+    (0x2F8AC, 'M', u'憲'),
+    (0x2F8AD, 'M', u'憤'),
+    (0x2F8AE, 'M', u'憯'),
+    (0x2F8AF, 'M', u'懞'),
+    (0x2F8B0, 'M', u'懲'),
+    (0x2F8B1, 'M', u'懶'),
+    (0x2F8B2, 'M', u'成'),
+    (0x2F8B3, 'M', u'戛'),
+    (0x2F8B4, 'M', u'扝'),
+    (0x2F8B5, 'M', u'抱'),
+    (0x2F8B6, 'M', u'拔'),
+    (0x2F8B7, 'M', u'捐'),
+    (0x2F8B8, 'M', u'𢬌'),
+    (0x2F8B9, 'M', u'挽'),
+    (0x2F8BA, 'M', u'拼'),
+    (0x2F8BB, 'M', u'捨'),
+    (0x2F8BC, 'M', u'掃'),
+    (0x2F8BD, 'M', u'揤'),
+    (0x2F8BE, 'M', u'𢯱'),
+    (0x2F8BF, 'M', u'搢'),
+    (0x2F8C0, 'M', u'揅'),
+    (0x2F8C1, 'M', u'掩'),
+    (0x2F8C2, 'M', u'㨮'),
+    ]
+
+def _seg_76():
+    return [
+    (0x2F8C3, 'M', u'摩'),
+    (0x2F8C4, 'M', u'摾'),
+    (0x2F8C5, 'M', u'撝'),
+    (0x2F8C6, 'M', u'摷'),
+    (0x2F8C7, 'M', u'㩬'),
+    (0x2F8C8, 'M', u'敏'),
+    (0x2F8C9, 'M', u'敬'),
+    (0x2F8CA, 'M', u'𣀊'),
+    (0x2F8CB, 'M', u'旣'),
+    (0x2F8CC, 'M', u'書'),
+    (0x2F8CD, 'M', u'晉'),
+    (0x2F8CE, 'M', u'㬙'),
+    (0x2F8CF, 'M', u'暑'),
+    (0x2F8D0, 'M', u'㬈'),
+    (0x2F8D1, 'M', u'㫤'),
+    (0x2F8D2, 'M', u'冒'),
+    (0x2F8D3, 'M', u'冕'),
+    (0x2F8D4, 'M', u'最'),
+    (0x2F8D5, 'M', u'暜'),
+    (0x2F8D6, 'M', u'肭'),
+    (0x2F8D7, 'M', u'䏙'),
+    (0x2F8D8, 'M', u'朗'),
+    (0x2F8D9, 'M', u'望'),
+    (0x2F8DA, 'M', u'朡'),
+    (0x2F8DB, 'M', u'杞'),
+    (0x2F8DC, 'M', u'杓'),
+    (0x2F8DD, 'M', u'𣏃'),
+    (0x2F8DE, 'M', u'㭉'),
+    (0x2F8DF, 'M', u'柺'),
+    (0x2F8E0, 'M', u'枅'),
+    (0x2F8E1, 'M', u'桒'),
+    (0x2F8E2, 'M', u'梅'),
+    (0x2F8E3, 'M', u'𣑭'),
+    (0x2F8E4, 'M', u'梎'),
+    (0x2F8E5, 'M', u'栟'),
+    (0x2F8E6, 'M', u'椔'),
+    (0x2F8E7, 'M', u'㮝'),
+    (0x2F8E8, 'M', u'楂'),
+    (0x2F8E9, 'M', u'榣'),
+    (0x2F8EA, 'M', u'槪'),
+    (0x2F8EB, 'M', u'檨'),
+    (0x2F8EC, 'M', u'𣚣'),
+    (0x2F8ED, 'M', u'櫛'),
+    (0x2F8EE, 'M', u'㰘'),
+    (0x2F8EF, 'M', u'次'),
+    (0x2F8F0, 'M', u'𣢧'),
+    (0x2F8F1, 'M', u'歔'),
+    (0x2F8F2, 'M', u'㱎'),
+    (0x2F8F3, 'M', u'歲'),
+    (0x2F8F4, 'M', u'殟'),
+    (0x2F8F5, 'M', u'殺'),
+    (0x2F8F6, 'M', u'殻'),
+    (0x2F8F7, 'M', u'𣪍'),
+    (0x2F8F8, 'M', u'𡴋'),
+    (0x2F8F9, 'M', u'𣫺'),
+    (0x2F8FA, 'M', u'汎'),
+    (0x2F8FB, 'M', u'𣲼'),
+    (0x2F8FC, 'M', u'沿'),
+    (0x2F8FD, 'M', u'泍'),
+    (0x2F8FE, 'M', u'汧'),
+    (0x2F8FF, 'M', u'洖'),
+    (0x2F900, 'M', u'派'),
+    (0x2F901, 'M', u'海'),
+    (0x2F902, 'M', u'流'),
+    (0x2F903, 'M', u'浩'),
+    (0x2F904, 'M', u'浸'),
+    (0x2F905, 'M', u'涅'),
+    (0x2F906, 'M', u'𣴞'),
+    (0x2F907, 'M', u'洴'),
+    (0x2F908, 'M', u'港'),
+    (0x2F909, 'M', u'湮'),
+    (0x2F90A, 'M', u'㴳'),
+    (0x2F90B, 'M', u'滋'),
+    (0x2F90C, 'M', u'滇'),
+    (0x2F90D, 'M', u'𣻑'),
+    (0x2F90E, 'M', u'淹'),
+    (0x2F90F, 'M', u'潮'),
+    (0x2F910, 'M', u'𣽞'),
+    (0x2F911, 'M', u'𣾎'),
+    (0x2F912, 'M', u'濆'),
+    (0x2F913, 'M', u'瀹'),
+    (0x2F914, 'M', u'瀞'),
+    (0x2F915, 'M', u'瀛'),
+    (0x2F916, 'M', u'㶖'),
+    (0x2F917, 'M', u'灊'),
+    (0x2F918, 'M', u'災'),
+    (0x2F919, 'M', u'灷'),
+    (0x2F91A, 'M', u'炭'),
+    (0x2F91B, 'M', u'𠔥'),
+    (0x2F91C, 'M', u'煅'),
+    (0x2F91D, 'M', u'𤉣'),
+    (0x2F91E, 'M', u'熜'),
+    (0x2F91F, 'X'),
+    (0x2F920, 'M', u'爨'),
+    (0x2F921, 'M', u'爵'),
+    (0x2F922, 'M', u'牐'),
+    (0x2F923, 'M', u'𤘈'),
+    (0x2F924, 'M', u'犀'),
+    (0x2F925, 'M', u'犕'),
+    (0x2F926, 'M', u'𤜵'),
+    ]
+
+def _seg_77():
+    return [
+    (0x2F927, 'M', u'𤠔'),
+    (0x2F928, 'M', u'獺'),
+    (0x2F929, 'M', u'王'),
+    (0x2F92A, 'M', u'㺬'),
+    (0x2F92B, 'M', u'玥'),
+    (0x2F92C, 'M', u'㺸'),
+    (0x2F92E, 'M', u'瑇'),
+    (0x2F92F, 'M', u'瑜'),
+    (0x2F930, 'M', u'瑱'),
+    (0x2F931, 'M', u'璅'),
+    (0x2F932, 'M', u'瓊'),
+    (0x2F933, 'M', u'㼛'),
+    (0x2F934, 'M', u'甤'),
+    (0x2F935, 'M', u'𤰶'),
+    (0x2F936, 'M', u'甾'),
+    (0x2F937, 'M', u'𤲒'),
+    (0x2F938, 'M', u'異'),
+    (0x2F939, 'M', u'𢆟'),
+    (0x2F93A, 'M', u'瘐'),
+    (0x2F93B, 'M', u'𤾡'),
+    (0x2F93C, 'M', u'𤾸'),
+    (0x2F93D, 'M', u'𥁄'),
+    (0x2F93E, 'M', u'㿼'),
+    (0x2F93F, 'M', u'䀈'),
+    (0x2F940, 'M', u'直'),
+    (0x2F941, 'M', u'𥃳'),
+    (0x2F942, 'M', u'𥃲'),
+    (0x2F943, 'M', u'𥄙'),
+    (0x2F944, 'M', u'𥄳'),
+    (0x2F945, 'M', u'眞'),
+    (0x2F946, 'M', u'真'),
+    (0x2F948, 'M', u'睊'),
+    (0x2F949, 'M', u'䀹'),
+    (0x2F94A, 'M', u'瞋'),
+    (0x2F94B, 'M', u'䁆'),
+    (0x2F94C, 'M', u'䂖'),
+    (0x2F94D, 'M', u'𥐝'),
+    (0x2F94E, 'M', u'硎'),
+    (0x2F94F, 'M', u'碌'),
+    (0x2F950, 'M', u'磌'),
+    (0x2F951, 'M', u'䃣'),
+    (0x2F952, 'M', u'𥘦'),
+    (0x2F953, 'M', u'祖'),
+    (0x2F954, 'M', u'𥚚'),
+    (0x2F955, 'M', u'𥛅'),
+    (0x2F956, 'M', u'福'),
+    (0x2F957, 'M', u'秫'),
+    (0x2F958, 'M', u'䄯'),
+    (0x2F959, 'M', u'穀'),
+    (0x2F95A, 'M', u'穊'),
+    (0x2F95B, 'M', u'穏'),
+    (0x2F95C, 'M', u'𥥼'),
+    (0x2F95D, 'M', u'𥪧'),
+    (0x2F95F, 'X'),
+    (0x2F960, 'M', u'䈂'),
+    (0x2F961, 'M', u'𥮫'),
+    (0x2F962, 'M', u'篆'),
+    (0x2F963, 'M', u'築'),
+    (0x2F964, 'M', u'䈧'),
+    (0x2F965, 'M', u'𥲀'),
+    (0x2F966, 'M', u'糒'),
+    (0x2F967, 'M', u'䊠'),
+    (0x2F968, 'M', u'糨'),
+    (0x2F969, 'M', u'糣'),
+    (0x2F96A, 'M', u'紀'),
+    (0x2F96B, 'M', u'𥾆'),
+    (0x2F96C, 'M', u'絣'),
+    (0x2F96D, 'M', u'䌁'),
+    (0x2F96E, 'M', u'緇'),
+    (0x2F96F, 'M', u'縂'),
+    (0x2F970, 'M', u'繅'),
+    (0x2F971, 'M', u'䌴'),
+    (0x2F972, 'M', u'𦈨'),
+    (0x2F973, 'M', u'𦉇'),
+    (0x2F974, 'M', u'䍙'),
+    (0x2F975, 'M', u'𦋙'),
+    (0x2F976, 'M', u'罺'),
+    (0x2F977, 'M', u'𦌾'),
+    (0x2F978, 'M', u'羕'),
+    (0x2F979, 'M', u'翺'),
+    (0x2F97A, 'M', u'者'),
+    (0x2F97B, 'M', u'𦓚'),
+    (0x2F97C, 'M', u'𦔣'),
+    (0x2F97D, 'M', u'聠'),
+    (0x2F97E, 'M', u'𦖨'),
+    (0x2F97F, 'M', u'聰'),
+    (0x2F980, 'M', u'𣍟'),
+    (0x2F981, 'M', u'䏕'),
+    (0x2F982, 'M', u'育'),
+    (0x2F983, 'M', u'脃'),
+    (0x2F984, 'M', u'䐋'),
+    (0x2F985, 'M', u'脾'),
+    (0x2F986, 'M', u'媵'),
+    (0x2F987, 'M', u'𦞧'),
+    (0x2F988, 'M', u'𦞵'),
+    (0x2F989, 'M', u'𣎓'),
+    (0x2F98A, 'M', u'𣎜'),
+    (0x2F98B, 'M', u'舁'),
+    (0x2F98C, 'M', u'舄'),
+    (0x2F98D, 'M', u'辞'),
+    ]
+
+def _seg_78():
+    return [
+    (0x2F98E, 'M', u'䑫'),
+    (0x2F98F, 'M', u'芑'),
+    (0x2F990, 'M', u'芋'),
+    (0x2F991, 'M', u'芝'),
+    (0x2F992, 'M', u'劳'),
+    (0x2F993, 'M', u'花'),
+    (0x2F994, 'M', u'芳'),
+    (0x2F995, 'M', u'芽'),
+    (0x2F996, 'M', u'苦'),
+    (0x2F997, 'M', u'𦬼'),
+    (0x2F998, 'M', u'若'),
+    (0x2F999, 'M', u'茝'),
+    (0x2F99A, 'M', u'荣'),
+    (0x2F99B, 'M', u'莭'),
+    (0x2F99C, 'M', u'茣'),
+    (0x2F99D, 'M', u'莽'),
+    (0x2F99E, 'M', u'菧'),
+    (0x2F99F, 'M', u'著'),
+    (0x2F9A0, 'M', u'荓'),
+    (0x2F9A1, 'M', u'菊'),
+    (0x2F9A2, 'M', u'菌'),
+    (0x2F9A3, 'M', u'菜'),
+    (0x2F9A4, 'M', u'𦰶'),
+    (0x2F9A5, 'M', u'𦵫'),
+    (0x2F9A6, 'M', u'𦳕'),
+    (0x2F9A7, 'M', u'䔫'),
+    (0x2F9A8, 'M', u'蓱'),
+    (0x2F9A9, 'M', u'蓳'),
+    (0x2F9AA, 'M', u'蔖'),
+    (0x2F9AB, 'M', u'𧏊'),
+    (0x2F9AC, 'M', u'蕤'),
+    (0x2F9AD, 'M', u'𦼬'),
+    (0x2F9AE, 'M', u'䕝'),
+    (0x2F9AF, 'M', u'䕡'),
+    (0x2F9B0, 'M', u'𦾱'),
+    (0x2F9B1, 'M', u'𧃒'),
+    (0x2F9B2, 'M', u'䕫'),
+    (0x2F9B3, 'M', u'虐'),
+    (0x2F9B4, 'M', u'虜'),
+    (0x2F9B5, 'M', u'虧'),
+    (0x2F9B6, 'M', u'虩'),
+    (0x2F9B7, 'M', u'蚩'),
+    (0x2F9B8, 'M', u'蚈'),
+    (0x2F9B9, 'M', u'蜎'),
+    (0x2F9BA, 'M', u'蛢'),
+    (0x2F9BB, 'M', u'蝹'),
+    (0x2F9BC, 'M', u'蜨'),
+    (0x2F9BD, 'M', u'蝫'),
+    (0x2F9BE, 'M', u'螆'),
+    (0x2F9BF, 'X'),
+    (0x2F9C0, 'M', u'蟡'),
+    (0x2F9C1, 'M', u'蠁'),
+    (0x2F9C2, 'M', u'䗹'),
+    (0x2F9C3, 'M', u'衠'),
+    (0x2F9C4, 'M', u'衣'),
+    (0x2F9C5, 'M', u'𧙧'),
+    (0x2F9C6, 'M', u'裗'),
+    (0x2F9C7, 'M', u'裞'),
+    (0x2F9C8, 'M', u'䘵'),
+    (0x2F9C9, 'M', u'裺'),
+    (0x2F9CA, 'M', u'㒻'),
+    (0x2F9CB, 'M', u'𧢮'),
+    (0x2F9CC, 'M', u'𧥦'),
+    (0x2F9CD, 'M', u'䚾'),
+    (0x2F9CE, 'M', u'䛇'),
+    (0x2F9CF, 'M', u'誠'),
+    (0x2F9D0, 'M', u'諭'),
+    (0x2F9D1, 'M', u'變'),
+    (0x2F9D2, 'M', u'豕'),
+    (0x2F9D3, 'M', u'𧲨'),
+    (0x2F9D4, 'M', u'貫'),
+    (0x2F9D5, 'M', u'賁'),
+    (0x2F9D6, 'M', u'贛'),
+    (0x2F9D7, 'M', u'起'),
+    (0x2F9D8, 'M', u'𧼯'),
+    (0x2F9D9, 'M', u'𠠄'),
+    (0x2F9DA, 'M', u'跋'),
+    (0x2F9DB, 'M', u'趼'),
+    (0x2F9DC, 'M', u'跰'),
+    (0x2F9DD, 'M', u'𠣞'),
+    (0x2F9DE, 'M', u'軔'),
+    (0x2F9DF, 'M', u'輸'),
+    (0x2F9E0, 'M', u'𨗒'),
+    (0x2F9E1, 'M', u'𨗭'),
+    (0x2F9E2, 'M', u'邔'),
+    (0x2F9E3, 'M', u'郱'),
+    (0x2F9E4, 'M', u'鄑'),
+    (0x2F9E5, 'M', u'𨜮'),
+    (0x2F9E6, 'M', u'鄛'),
+    (0x2F9E7, 'M', u'鈸'),
+    (0x2F9E8, 'M', u'鋗'),
+    (0x2F9E9, 'M', u'鋘'),
+    (0x2F9EA, 'M', u'鉼'),
+    (0x2F9EB, 'M', u'鏹'),
+    (0x2F9EC, 'M', u'鐕'),
+    (0x2F9ED, 'M', u'𨯺'),
+    (0x2F9EE, 'M', u'開'),
+    (0x2F9EF, 'M', u'䦕'),
+    (0x2F9F0, 'M', u'閷'),
+    (0x2F9F1, 'M', u'𨵷'),
+    ]
+
+def _seg_79():
+    return [
+    (0x2F9F2, 'M', u'䧦'),
+    (0x2F9F3, 'M', u'雃'),
+    (0x2F9F4, 'M', u'嶲'),
+    (0x2F9F5, 'M', u'霣'),
+    (0x2F9F6, 'M', u'𩅅'),
+    (0x2F9F7, 'M', u'𩈚'),
+    (0x2F9F8, 'M', u'䩮'),
+    (0x2F9F9, 'M', u'䩶'),
+    (0x2F9FA, 'M', u'韠'),
+    (0x2F9FB, 'M', u'𩐊'),
+    (0x2F9FC, 'M', u'䪲'),
+    (0x2F9FD, 'M', u'𩒖'),
+    (0x2F9FE, 'M', u'頋'),
+    (0x2FA00, 'M', u'頩'),
+    (0x2FA01, 'M', u'𩖶'),
+    (0x2FA02, 'M', u'飢'),
+    (0x2FA03, 'M', u'䬳'),
+    (0x2FA04, 'M', u'餩'),
+    (0x2FA05, 'M', u'馧'),
+    (0x2FA06, 'M', u'駂'),
+    (0x2FA07, 'M', u'駾'),
+    (0x2FA08, 'M', u'䯎'),
+    (0x2FA09, 'M', u'𩬰'),
+    (0x2FA0A, 'M', u'鬒'),
+    (0x2FA0B, 'M', u'鱀'),
+    (0x2FA0C, 'M', u'鳽'),
+    (0x2FA0D, 'M', u'䳎'),
+    (0x2FA0E, 'M', u'䳭'),
+    (0x2FA0F, 'M', u'鵧'),
+    (0x2FA10, 'M', u'𪃎'),
+    (0x2FA11, 'M', u'䳸'),
+    (0x2FA12, 'M', u'𪄅'),
+    (0x2FA13, 'M', u'𪈎'),
+    (0x2FA14, 'M', u'𪊑'),
+    (0x2FA15, 'M', u'麻'),
+    (0x2FA16, 'M', u'䵖'),
+    (0x2FA17, 'M', u'黹'),
+    (0x2FA18, 'M', u'黾'),
+    (0x2FA19, 'M', u'鼅'),
+    (0x2FA1A, 'M', u'鼏'),
+    (0x2FA1B, 'M', u'鼖'),
+    (0x2FA1C, 'M', u'鼻'),
+    (0x2FA1D, 'M', u'𪘀'),
+    (0x2FA1E, 'X'),
+    (0x30000, 'V'),
+    (0x3134B, 'X'),
+    (0xE0100, 'I'),
+    (0xE01F0, 'X'),
+    ]
+
+uts46data = tuple(
+    _seg_0()
+    + _seg_1()
+    + _seg_2()
+    + _seg_3()
+    + _seg_4()
+    + _seg_5()
+    + _seg_6()
+    + _seg_7()
+    + _seg_8()
+    + _seg_9()
+    + _seg_10()
+    + _seg_11()
+    + _seg_12()
+    + _seg_13()
+    + _seg_14()
+    + _seg_15()
+    + _seg_16()
+    + _seg_17()
+    + _seg_18()
+    + _seg_19()
+    + _seg_20()
+    + _seg_21()
+    + _seg_22()
+    + _seg_23()
+    + _seg_24()
+    + _seg_25()
+    + _seg_26()
+    + _seg_27()
+    + _seg_28()
+    + _seg_29()
+    + _seg_30()
+    + _seg_31()
+    + _seg_32()
+    + _seg_33()
+    + _seg_34()
+    + _seg_35()
+    + _seg_36()
+    + _seg_37()
+    + _seg_38()
+    + _seg_39()
+    + _seg_40()
+    + _seg_41()
+    + _seg_42()
+    + _seg_43()
+    + _seg_44()
+    + _seg_45()
+    + _seg_46()
+    + _seg_47()
+    + _seg_48()
+    + _seg_49()
+    + _seg_50()
+    + _seg_51()
+    + _seg_52()
+    + _seg_53()
+    + _seg_54()
+    + _seg_55()
+    + _seg_56()
+    + _seg_57()
+    + _seg_58()
+    + _seg_59()
+    + _seg_60()
+    + _seg_61()
+    + _seg_62()
+    + _seg_63()
+    + _seg_64()
+    + _seg_65()
+    + _seg_66()
+    + _seg_67()
+    + _seg_68()
+    + _seg_69()
+    + _seg_70()
+    + _seg_71()
+    + _seg_72()
+    + _seg_73()
+    + _seg_74()
+    + _seg_75()
+    + _seg_76()
+    + _seg_77()
+    + _seg_78()
+    + _seg_79()
+)
diff --git a/venv/Lib/site-packages/pip/_vendor/ipaddress.py b/venv/Lib/site-packages/pip/_vendor/ipaddress.py
new file mode 100644
index 000000000..3e6f9e499
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/ipaddress.py
@@ -0,0 +1,2420 @@
+# Copyright 2007 Google Inc.
+#  Licensed to PSF under a Contributor Agreement.
+
+"""A fast, lightweight IPv4/IPv6 manipulation library in Python.
+
+This library is used to create/poke/manipulate IPv4 and IPv6 addresses
+and networks.
+
+"""
+
+from __future__ import unicode_literals
+
+
+import itertools
+import struct
+
+__version__ = '1.0.23'
+
+# Compatibility functions
+_compat_int_types = (int,)
+try:
+    _compat_int_types = (int, long)
+except NameError:
+    pass
+try:
+    _compat_str = unicode
+except NameError:
+    _compat_str = str
+    assert bytes != str
+if b'\0'[0] == 0:  # Python 3 semantics
+    def _compat_bytes_to_byte_vals(byt):
+        return byt
+else:
+    def _compat_bytes_to_byte_vals(byt):
+        return [struct.unpack(b'!B', b)[0] for b in byt]
+try:
+    _compat_int_from_byte_vals = int.from_bytes
+except AttributeError:
+    def _compat_int_from_byte_vals(bytvals, endianess):
+        assert endianess == 'big'
+        res = 0
+        for bv in bytvals:
+            assert isinstance(bv, _compat_int_types)
+            res = (res << 8) + bv
+        return res
+
+
+def _compat_to_bytes(intval, length, endianess):
+    assert isinstance(intval, _compat_int_types)
+    assert endianess == 'big'
+    if length == 4:
+        if intval < 0 or intval >= 2 ** 32:
+            raise struct.error("integer out of range for 'I' format code")
+        return struct.pack(b'!I', intval)
+    elif length == 16:
+        if intval < 0 or intval >= 2 ** 128:
+            raise struct.error("integer out of range for 'QQ' format code")
+        return struct.pack(b'!QQ', intval >> 64, intval & 0xffffffffffffffff)
+    else:
+        raise NotImplementedError()
+
+
+if hasattr(int, 'bit_length'):
+    # Not int.bit_length , since that won't work in 2.7 where long exists
+    def _compat_bit_length(i):
+        return i.bit_length()
+else:
+    def _compat_bit_length(i):
+        for res in itertools.count():
+            if i >> res == 0:
+                return res
+
+
+def _compat_range(start, end, step=1):
+    assert step > 0
+    i = start
+    while i < end:
+        yield i
+        i += step
+
+
+class _TotalOrderingMixin(object):
+    __slots__ = ()
+
+    # Helper that derives the other comparison operations from
+    # __lt__ and __eq__
+    # We avoid functools.total_ordering because it doesn't handle
+    # NotImplemented correctly yet (http://bugs.python.org/issue10042)
+    def __eq__(self, other):
+        raise NotImplementedError
+
+    def __ne__(self, other):
+        equal = self.__eq__(other)
+        if equal is NotImplemented:
+            return NotImplemented
+        return not equal
+
+    def __lt__(self, other):
+        raise NotImplementedError
+
+    def __le__(self, other):
+        less = self.__lt__(other)
+        if less is NotImplemented or not less:
+            return self.__eq__(other)
+        return less
+
+    def __gt__(self, other):
+        less = self.__lt__(other)
+        if less is NotImplemented:
+            return NotImplemented
+        equal = self.__eq__(other)
+        if equal is NotImplemented:
+            return NotImplemented
+        return not (less or equal)
+
+    def __ge__(self, other):
+        less = self.__lt__(other)
+        if less is NotImplemented:
+            return NotImplemented
+        return not less
+
+
+IPV4LENGTH = 32
+IPV6LENGTH = 128
+
+
+class AddressValueError(ValueError):
+    """A Value Error related to the address."""
+
+
+class NetmaskValueError(ValueError):
+    """A Value Error related to the netmask."""
+
+
+def ip_address(address):
+    """Take an IP string/int and return an object of the correct type.
+
+    Args:
+        address: A string or integer, the IP address.  Either IPv4 or
+          IPv6 addresses may be supplied; integers less than 2**32 will
+          be considered to be IPv4 by default.
+
+    Returns:
+        An IPv4Address or IPv6Address object.
+
+    Raises:
+        ValueError: if the *address* passed isn't either a v4 or a v6
+          address
+
+    """
+    try:
+        return IPv4Address(address)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    try:
+        return IPv6Address(address)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    if isinstance(address, bytes):
+        raise AddressValueError(
+            '%r does not appear to be an IPv4 or IPv6 address. '
+            'Did you pass in a bytes (str in Python 2) instead of'
+            ' a unicode object?' % address)
+
+    raise ValueError('%r does not appear to be an IPv4 or IPv6 address' %
+                     address)
+
+
+def ip_network(address, strict=True):
+    """Take an IP string/int and return an object of the correct type.
+
+    Args:
+        address: A string or integer, the IP network.  Either IPv4 or
+          IPv6 networks may be supplied; integers less than 2**32 will
+          be considered to be IPv4 by default.
+
+    Returns:
+        An IPv4Network or IPv6Network object.
+
+    Raises:
+        ValueError: if the string passed isn't either a v4 or a v6
+          address. Or if the network has host bits set.
+
+    """
+    try:
+        return IPv4Network(address, strict)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    try:
+        return IPv6Network(address, strict)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    if isinstance(address, bytes):
+        raise AddressValueError(
+            '%r does not appear to be an IPv4 or IPv6 network. '
+            'Did you pass in a bytes (str in Python 2) instead of'
+            ' a unicode object?' % address)
+
+    raise ValueError('%r does not appear to be an IPv4 or IPv6 network' %
+                     address)
+
+
+def ip_interface(address):
+    """Take an IP string/int and return an object of the correct type.
+
+    Args:
+        address: A string or integer, the IP address.  Either IPv4 or
+          IPv6 addresses may be supplied; integers less than 2**32 will
+          be considered to be IPv4 by default.
+
+    Returns:
+        An IPv4Interface or IPv6Interface object.
+
+    Raises:
+        ValueError: if the string passed isn't either a v4 or a v6
+          address.
+
+    Notes:
+        The IPv?Interface classes describe an Address on a particular
+        Network, so they're basically a combination of both the Address
+        and Network classes.
+
+    """
+    try:
+        return IPv4Interface(address)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    try:
+        return IPv6Interface(address)
+    except (AddressValueError, NetmaskValueError):
+        pass
+
+    raise ValueError('%r does not appear to be an IPv4 or IPv6 interface' %
+                     address)
+
+
+def v4_int_to_packed(address):
+    """Represent an address as 4 packed bytes in network (big-endian) order.
+
+    Args:
+        address: An integer representation of an IPv4 IP address.
+
+    Returns:
+        The integer address packed as 4 bytes in network (big-endian) order.
+
+    Raises:
+        ValueError: If the integer is negative or too large to be an
+          IPv4 IP address.
+
+    """
+    try:
+        return _compat_to_bytes(address, 4, 'big')
+    except (struct.error, OverflowError):
+        raise ValueError("Address negative or too large for IPv4")
+
+
+def v6_int_to_packed(address):
+    """Represent an address as 16 packed bytes in network (big-endian) order.
+
+    Args:
+        address: An integer representation of an IPv6 IP address.
+
+    Returns:
+        The integer address packed as 16 bytes in network (big-endian) order.
+
+    """
+    try:
+        return _compat_to_bytes(address, 16, 'big')
+    except (struct.error, OverflowError):
+        raise ValueError("Address negative or too large for IPv6")
+
+
+def _split_optional_netmask(address):
+    """Helper to split the netmask and raise AddressValueError if needed"""
+    addr = _compat_str(address).split('/')
+    if len(addr) > 2:
+        raise AddressValueError("Only one '/' permitted in %r" % address)
+    return addr
+
+
+def _find_address_range(addresses):
+    """Find a sequence of sorted deduplicated IPv#Address.
+
+    Args:
+        addresses: a list of IPv#Address objects.
+
+    Yields:
+        A tuple containing the first and last IP addresses in the sequence.
+
+    """
+    it = iter(addresses)
+    first = last = next(it)
+    for ip in it:
+        if ip._ip != last._ip + 1:
+            yield first, last
+            first = ip
+        last = ip
+    yield first, last
+
+
+def _count_righthand_zero_bits(number, bits):
+    """Count the number of zero bits on the right hand side.
+
+    Args:
+        number: an integer.
+        bits: maximum number of bits to count.
+
+    Returns:
+        The number of zero bits on the right hand side of the number.
+
+    """
+    if number == 0:
+        return bits
+    return min(bits, _compat_bit_length(~number & (number - 1)))
+
+
+def summarize_address_range(first, last):
+    """Summarize a network range given the first and last IP addresses.
+
+    Example:
+        >>> list(summarize_address_range(IPv4Address('192.0.2.0'),
+        ...                              IPv4Address('192.0.2.130')))
+        ...                                #doctest: +NORMALIZE_WHITESPACE
+        [IPv4Network('192.0.2.0/25'), IPv4Network('192.0.2.128/31'),
+         IPv4Network('192.0.2.130/32')]
+
+    Args:
+        first: the first IPv4Address or IPv6Address in the range.
+        last: the last IPv4Address or IPv6Address in the range.
+
+    Returns:
+        An iterator of the summarized IPv(4|6) network objects.
+
+    Raise:
+        TypeError:
+            If the first and last objects are not IP addresses.
+            If the first and last objects are not the same version.
+        ValueError:
+            If the last object is not greater than the first.
+            If the version of the first address is not 4 or 6.
+
+    """
+    if (not (isinstance(first, _BaseAddress) and
+             isinstance(last, _BaseAddress))):
+        raise TypeError('first and last must be IP addresses, not networks')
+    if first.version != last.version:
+        raise TypeError("%s and %s are not of the same version" % (
+                        first, last))
+    if first > last:
+        raise ValueError('last IP address must be greater than first')
+
+    if first.version == 4:
+        ip = IPv4Network
+    elif first.version == 6:
+        ip = IPv6Network
+    else:
+        raise ValueError('unknown IP version')
+
+    ip_bits = first._max_prefixlen
+    first_int = first._ip
+    last_int = last._ip
+    while first_int <= last_int:
+        nbits = min(_count_righthand_zero_bits(first_int, ip_bits),
+                    _compat_bit_length(last_int - first_int + 1) - 1)
+        net = ip((first_int, ip_bits - nbits))
+        yield net
+        first_int += 1 << nbits
+        if first_int - 1 == ip._ALL_ONES:
+            break
+
+
+def _collapse_addresses_internal(addresses):
+    """Loops through the addresses, collapsing concurrent netblocks.
+
+    Example:
+
+        ip1 = IPv4Network('192.0.2.0/26')
+        ip2 = IPv4Network('192.0.2.64/26')
+        ip3 = IPv4Network('192.0.2.128/26')
+        ip4 = IPv4Network('192.0.2.192/26')
+
+        _collapse_addresses_internal([ip1, ip2, ip3, ip4]) ->
+          [IPv4Network('192.0.2.0/24')]
+
+        This shouldn't be called directly; it is called via
+          collapse_addresses([]).
+
+    Args:
+        addresses: A list of IPv4Network's or IPv6Network's
+
+    Returns:
+        A list of IPv4Network's or IPv6Network's depending on what we were
+        passed.
+
+    """
+    # First merge
+    to_merge = list(addresses)
+    subnets = {}
+    while to_merge:
+        net = to_merge.pop()
+        supernet = net.supernet()
+        existing = subnets.get(supernet)
+        if existing is None:
+            subnets[supernet] = net
+        elif existing != net:
+            # Merge consecutive subnets
+            del subnets[supernet]
+            to_merge.append(supernet)
+    # Then iterate over resulting networks, skipping subsumed subnets
+    last = None
+    for net in sorted(subnets.values()):
+        if last is not None:
+            # Since they are sorted,
+            # last.network_address <= net.network_address is a given.
+            if last.broadcast_address >= net.broadcast_address:
+                continue
+        yield net
+        last = net
+
+
+def collapse_addresses(addresses):
+    """Collapse a list of IP objects.
+
+    Example:
+        collapse_addresses([IPv4Network('192.0.2.0/25'),
+                            IPv4Network('192.0.2.128/25')]) ->
+                           [IPv4Network('192.0.2.0/24')]
+
+    Args:
+        addresses: An iterator of IPv4Network or IPv6Network objects.
+
+    Returns:
+        An iterator of the collapsed IPv(4|6)Network objects.
+
+    Raises:
+        TypeError: If passed a list of mixed version objects.
+
+    """
+    addrs = []
+    ips = []
+    nets = []
+
+    # split IP addresses and networks
+    for ip in addresses:
+        if isinstance(ip, _BaseAddress):
+            if ips and ips[-1]._version != ip._version:
+                raise TypeError("%s and %s are not of the same version" % (
+                                ip, ips[-1]))
+            ips.append(ip)
+        elif ip._prefixlen == ip._max_prefixlen:
+            if ips and ips[-1]._version != ip._version:
+                raise TypeError("%s and %s are not of the same version" % (
+                                ip, ips[-1]))
+            try:
+                ips.append(ip.ip)
+            except AttributeError:
+                ips.append(ip.network_address)
+        else:
+            if nets and nets[-1]._version != ip._version:
+                raise TypeError("%s and %s are not of the same version" % (
+                                ip, nets[-1]))
+            nets.append(ip)
+
+    # sort and dedup
+    ips = sorted(set(ips))
+
+    # find consecutive address ranges in the sorted sequence and summarize them
+    if ips:
+        for first, last in _find_address_range(ips):
+            addrs.extend(summarize_address_range(first, last))
+
+    return _collapse_addresses_internal(addrs + nets)
+
+
+def get_mixed_type_key(obj):
+    """Return a key suitable for sorting between networks and addresses.
+
+    Address and Network objects are not sortable by default; they're
+    fundamentally different so the expression
+
+        IPv4Address('192.0.2.0') <= IPv4Network('192.0.2.0/24')
+
+    doesn't make any sense.  There are some times however, where you may wish
+    to have ipaddress sort these for you anyway. If you need to do this, you
+    can use this function as the key= argument to sorted().
+
+    Args:
+      obj: either a Network or Address object.
+    Returns:
+      appropriate key.
+
+    """
+    if isinstance(obj, _BaseNetwork):
+        return obj._get_networks_key()
+    elif isinstance(obj, _BaseAddress):
+        return obj._get_address_key()
+    return NotImplemented
+
+
+class _IPAddressBase(_TotalOrderingMixin):
+
+    """The mother class."""
+
+    __slots__ = ()
+
+    @property
+    def exploded(self):
+        """Return the longhand version of the IP address as a string."""
+        return self._explode_shorthand_ip_string()
+
+    @property
+    def compressed(self):
+        """Return the shorthand version of the IP address as a string."""
+        return _compat_str(self)
+
+    @property
+    def reverse_pointer(self):
+        """The name of the reverse DNS pointer for the IP address, e.g.:
+            >>> ipaddress.ip_address("127.0.0.1").reverse_pointer
+            '1.0.0.127.in-addr.arpa'
+            >>> ipaddress.ip_address("2001:db8::1").reverse_pointer
+            '1.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.0.8.b.d.0.1.0.0.2.ip6.arpa'
+
+        """
+        return self._reverse_pointer()
+
+    @property
+    def version(self):
+        msg = '%200s has no version specified' % (type(self),)
+        raise NotImplementedError(msg)
+
+    def _check_int_address(self, address):
+        if address < 0:
+            msg = "%d (< 0) is not permitted as an IPv%d address"
+            raise AddressValueError(msg % (address, self._version))
+        if address > self._ALL_ONES:
+            msg = "%d (>= 2**%d) is not permitted as an IPv%d address"
+            raise AddressValueError(msg % (address, self._max_prefixlen,
+                                           self._version))
+
+    def _check_packed_address(self, address, expected_len):
+        address_len = len(address)
+        if address_len != expected_len:
+            msg = (
+                '%r (len %d != %d) is not permitted as an IPv%d address. '
+                'Did you pass in a bytes (str in Python 2) instead of'
+                ' a unicode object?')
+            raise AddressValueError(msg % (address, address_len,
+                                           expected_len, self._version))
+
+    @classmethod
+    def _ip_int_from_prefix(cls, prefixlen):
+        """Turn the prefix length into a bitwise netmask
+
+        Args:
+            prefixlen: An integer, the prefix length.
+
+        Returns:
+            An integer.
+
+        """
+        return cls._ALL_ONES ^ (cls._ALL_ONES >> prefixlen)
+
+    @classmethod
+    def _prefix_from_ip_int(cls, ip_int):
+        """Return prefix length from the bitwise netmask.
+
+        Args:
+            ip_int: An integer, the netmask in expanded bitwise format
+
+        Returns:
+            An integer, the prefix length.
+
+        Raises:
+            ValueError: If the input intermingles zeroes & ones
+        """
+        trailing_zeroes = _count_righthand_zero_bits(ip_int,
+                                                     cls._max_prefixlen)
+        prefixlen = cls._max_prefixlen - trailing_zeroes
+        leading_ones = ip_int >> trailing_zeroes
+        all_ones = (1 << prefixlen) - 1
+        if leading_ones != all_ones:
+            byteslen = cls._max_prefixlen // 8
+            details = _compat_to_bytes(ip_int, byteslen, 'big')
+            msg = 'Netmask pattern %r mixes zeroes & ones'
+            raise ValueError(msg % details)
+        return prefixlen
+
+    @classmethod
+    def _report_invalid_netmask(cls, netmask_str):
+        msg = '%r is not a valid netmask' % netmask_str
+        raise NetmaskValueError(msg)
+
+    @classmethod
+    def _prefix_from_prefix_string(cls, prefixlen_str):
+        """Return prefix length from a numeric string
+
+        Args:
+            prefixlen_str: The string to be converted
+
+        Returns:
+            An integer, the prefix length.
+
+        Raises:
+            NetmaskValueError: If the input is not a valid netmask
+        """
+        # int allows a leading +/- as well as surrounding whitespace,
+        # so we ensure that isn't the case
+        if not _BaseV4._DECIMAL_DIGITS.issuperset(prefixlen_str):
+            cls._report_invalid_netmask(prefixlen_str)
+        try:
+            prefixlen = int(prefixlen_str)
+        except ValueError:
+            cls._report_invalid_netmask(prefixlen_str)
+        if not (0 <= prefixlen <= cls._max_prefixlen):
+            cls._report_invalid_netmask(prefixlen_str)
+        return prefixlen
+
+    @classmethod
+    def _prefix_from_ip_string(cls, ip_str):
+        """Turn a netmask/hostmask string into a prefix length
+
+        Args:
+            ip_str: The netmask/hostmask to be converted
+
+        Returns:
+            An integer, the prefix length.
+
+        Raises:
+            NetmaskValueError: If the input is not a valid netmask/hostmask
+        """
+        # Parse the netmask/hostmask like an IP address.
+        try:
+            ip_int = cls._ip_int_from_string(ip_str)
+        except AddressValueError:
+            cls._report_invalid_netmask(ip_str)
+
+        # Try matching a netmask (this would be /1*0*/ as a bitwise regexp).
+        # Note that the two ambiguous cases (all-ones and all-zeroes) are
+        # treated as netmasks.
+        try:
+            return cls._prefix_from_ip_int(ip_int)
+        except ValueError:
+            pass
+
+        # Invert the bits, and try matching a /0+1+/ hostmask instead.
+        ip_int ^= cls._ALL_ONES
+        try:
+            return cls._prefix_from_ip_int(ip_int)
+        except ValueError:
+            cls._report_invalid_netmask(ip_str)
+
+    def __reduce__(self):
+        return self.__class__, (_compat_str(self),)
+
+
+class _BaseAddress(_IPAddressBase):
+
+    """A generic IP object.
+
+    This IP class contains the version independent methods which are
+    used by single IP addresses.
+    """
+
+    __slots__ = ()
+
+    def __int__(self):
+        return self._ip
+
+    def __eq__(self, other):
+        try:
+            return (self._ip == other._ip and
+                    self._version == other._version)
+        except AttributeError:
+            return NotImplemented
+
+    def __lt__(self, other):
+        if not isinstance(other, _IPAddressBase):
+            return NotImplemented
+        if not isinstance(other, _BaseAddress):
+            raise TypeError('%s and %s are not of the same type' % (
+                self, other))
+        if self._version != other._version:
+            raise TypeError('%s and %s are not of the same version' % (
+                self, other))
+        if self._ip != other._ip:
+            return self._ip < other._ip
+        return False
+
+    # Shorthand for Integer addition and subtraction. This is not
+    # meant to ever support addition/subtraction of addresses.
+    def __add__(self, other):
+        if not isinstance(other, _compat_int_types):
+            return NotImplemented
+        return self.__class__(int(self) + other)
+
+    def __sub__(self, other):
+        if not isinstance(other, _compat_int_types):
+            return NotImplemented
+        return self.__class__(int(self) - other)
+
+    def __repr__(self):
+        return '%s(%r)' % (self.__class__.__name__, _compat_str(self))
+
+    def __str__(self):
+        return _compat_str(self._string_from_ip_int(self._ip))
+
+    def __hash__(self):
+        return hash(hex(int(self._ip)))
+
+    def _get_address_key(self):
+        return (self._version, self)
+
+    def __reduce__(self):
+        return self.__class__, (self._ip,)
+
+
+class _BaseNetwork(_IPAddressBase):
+
+    """A generic IP network object.
+
+    This IP class contains the version independent methods which are
+    used by networks.
+
+    """
+    def __init__(self, address):
+        self._cache = {}
+
+    def __repr__(self):
+        return '%s(%r)' % (self.__class__.__name__, _compat_str(self))
+
+    def __str__(self):
+        return '%s/%d' % (self.network_address, self.prefixlen)
+
+    def hosts(self):
+        """Generate Iterator over usable hosts in a network.
+
+        This is like __iter__ except it doesn't return the network
+        or broadcast addresses.
+
+        """
+        network = int(self.network_address)
+        broadcast = int(self.broadcast_address)
+        for x in _compat_range(network + 1, broadcast):
+            yield self._address_class(x)
+
+    def __iter__(self):
+        network = int(self.network_address)
+        broadcast = int(self.broadcast_address)
+        for x in _compat_range(network, broadcast + 1):
+            yield self._address_class(x)
+
+    def __getitem__(self, n):
+        network = int(self.network_address)
+        broadcast = int(self.broadcast_address)
+        if n >= 0:
+            if network + n > broadcast:
+                raise IndexError('address out of range')
+            return self._address_class(network + n)
+        else:
+            n += 1
+            if broadcast + n < network:
+                raise IndexError('address out of range')
+            return self._address_class(broadcast + n)
+
+    def __lt__(self, other):
+        if not isinstance(other, _IPAddressBase):
+            return NotImplemented
+        if not isinstance(other, _BaseNetwork):
+            raise TypeError('%s and %s are not of the same type' % (
+                            self, other))
+        if self._version != other._version:
+            raise TypeError('%s and %s are not of the same version' % (
+                            self, other))
+        if self.network_address != other.network_address:
+            return self.network_address < other.network_address
+        if self.netmask != other.netmask:
+            return self.netmask < other.netmask
+        return False
+
+    def __eq__(self, other):
+        try:
+            return (self._version == other._version and
+                    self.network_address == other.network_address and
+                    int(self.netmask) == int(other.netmask))
+        except AttributeError:
+            return NotImplemented
+
+    def __hash__(self):
+        return hash(int(self.network_address) ^ int(self.netmask))
+
+    def __contains__(self, other):
+        # always false if one is v4 and the other is v6.
+        if self._version != other._version:
+            return False
+        # dealing with another network.
+        if isinstance(other, _BaseNetwork):
+            return False
+        # dealing with another address
+        else:
+            # address
+            return (int(self.network_address) <= int(other._ip) <=
+                    int(self.broadcast_address))
+
+    def overlaps(self, other):
+        """Tell if self is partly contained in other."""
+        return self.network_address in other or (
+            self.broadcast_address in other or (
+                other.network_address in self or (
+                    other.broadcast_address in self)))
+
+    @property
+    def broadcast_address(self):
+        x = self._cache.get('broadcast_address')
+        if x is None:
+            x = self._address_class(int(self.network_address) |
+                                    int(self.hostmask))
+            self._cache['broadcast_address'] = x
+        return x
+
+    @property
+    def hostmask(self):
+        x = self._cache.get('hostmask')
+        if x is None:
+            x = self._address_class(int(self.netmask) ^ self._ALL_ONES)
+            self._cache['hostmask'] = x
+        return x
+
+    @property
+    def with_prefixlen(self):
+        return '%s/%d' % (self.network_address, self._prefixlen)
+
+    @property
+    def with_netmask(self):
+        return '%s/%s' % (self.network_address, self.netmask)
+
+    @property
+    def with_hostmask(self):
+        return '%s/%s' % (self.network_address, self.hostmask)
+
+    @property
+    def num_addresses(self):
+        """Number of hosts in the current subnet."""
+        return int(self.broadcast_address) - int(self.network_address) + 1
+
+    @property
+    def _address_class(self):
+        # Returning bare address objects (rather than interfaces) allows for
+        # more consistent behaviour across the network address, broadcast
+        # address and individual host addresses.
+        msg = '%200s has no associated address class' % (type(self),)
+        raise NotImplementedError(msg)
+
+    @property
+    def prefixlen(self):
+        return self._prefixlen
+
+    def address_exclude(self, other):
+        """Remove an address from a larger block.
+
+        For example:
+
+            addr1 = ip_network('192.0.2.0/28')
+            addr2 = ip_network('192.0.2.1/32')
+            list(addr1.address_exclude(addr2)) =
+                [IPv4Network('192.0.2.0/32'), IPv4Network('192.0.2.2/31'),
+                 IPv4Network('192.0.2.4/30'), IPv4Network('192.0.2.8/29')]
+
+        or IPv6:
+
+            addr1 = ip_network('2001:db8::1/32')
+            addr2 = ip_network('2001:db8::1/128')
+            list(addr1.address_exclude(addr2)) =
+                [ip_network('2001:db8::1/128'),
+                 ip_network('2001:db8::2/127'),
+                 ip_network('2001:db8::4/126'),
+                 ip_network('2001:db8::8/125'),
+                 ...
+                 ip_network('2001:db8:8000::/33')]
+
+        Args:
+            other: An IPv4Network or IPv6Network object of the same type.
+
+        Returns:
+            An iterator of the IPv(4|6)Network objects which is self
+            minus other.
+
+        Raises:
+            TypeError: If self and other are of differing address
+              versions, or if other is not a network object.
+            ValueError: If other is not completely contained by self.
+
+        """
+        if not self._version == other._version:
+            raise TypeError("%s and %s are not of the same version" % (
+                            self, other))
+
+        if not isinstance(other, _BaseNetwork):
+            raise TypeError("%s is not a network object" % other)
+
+        if not other.subnet_of(self):
+            raise ValueError('%s not contained in %s' % (other, self))
+        if other == self:
+            return
+
+        # Make sure we're comparing the network of other.
+        other = other.__class__('%s/%s' % (other.network_address,
+                                           other.prefixlen))
+
+        s1, s2 = self.subnets()
+        while s1 != other and s2 != other:
+            if other.subnet_of(s1):
+                yield s2
+                s1, s2 = s1.subnets()
+            elif other.subnet_of(s2):
+                yield s1
+                s1, s2 = s2.subnets()
+            else:
+                # If we got here, there's a bug somewhere.
+                raise AssertionError('Error performing exclusion: '
+                                     's1: %s s2: %s other: %s' %
+                                     (s1, s2, other))
+        if s1 == other:
+            yield s2
+        elif s2 == other:
+            yield s1
+        else:
+            # If we got here, there's a bug somewhere.
+            raise AssertionError('Error performing exclusion: '
+                                 's1: %s s2: %s other: %s' %
+                                 (s1, s2, other))
+
+    def compare_networks(self, other):
+        """Compare two IP objects.
+
+        This is only concerned about the comparison of the integer
+        representation of the network addresses.  This means that the
+        host bits aren't considered at all in this method.  If you want
+        to compare host bits, you can easily enough do a
+        'HostA._ip < HostB._ip'
+
+        Args:
+            other: An IP object.
+
+        Returns:
+            If the IP versions of self and other are the same, returns:
+
+            -1 if self < other:
+              eg: IPv4Network('192.0.2.0/25') < IPv4Network('192.0.2.128/25')
+              IPv6Network('2001:db8::1000/124') <
+                  IPv6Network('2001:db8::2000/124')
+            0 if self == other
+              eg: IPv4Network('192.0.2.0/24') == IPv4Network('192.0.2.0/24')
+              IPv6Network('2001:db8::1000/124') ==
+                  IPv6Network('2001:db8::1000/124')
+            1 if self > other
+              eg: IPv4Network('192.0.2.128/25') > IPv4Network('192.0.2.0/25')
+                  IPv6Network('2001:db8::2000/124') >
+                      IPv6Network('2001:db8::1000/124')
+
+          Raises:
+              TypeError if the IP versions are different.
+
+        """
+        # does this need to raise a ValueError?
+        if self._version != other._version:
+            raise TypeError('%s and %s are not of the same type' % (
+                            self, other))
+        # self._version == other._version below here:
+        if self.network_address < other.network_address:
+            return -1
+        if self.network_address > other.network_address:
+            return 1
+        # self.network_address == other.network_address below here:
+        if self.netmask < other.netmask:
+            return -1
+        if self.netmask > other.netmask:
+            return 1
+        return 0
+
+    def _get_networks_key(self):
+        """Network-only key function.
+
+        Returns an object that identifies this address' network and
+        netmask. This function is a suitable "key" argument for sorted()
+        and list.sort().
+
+        """
+        return (self._version, self.network_address, self.netmask)
+
+    def subnets(self, prefixlen_diff=1, new_prefix=None):
+        """The subnets which join to make the current subnet.
+
+        In the case that self contains only one IP
+        (self._prefixlen == 32 for IPv4 or self._prefixlen == 128
+        for IPv6), yield an iterator with just ourself.
+
+        Args:
+            prefixlen_diff: An integer, the amount the prefix length
+              should be increased by. This should not be set if
+              new_prefix is also set.
+            new_prefix: The desired new prefix length. This must be a
+              larger number (smaller prefix) than the existing prefix.
+              This should not be set if prefixlen_diff is also set.
+
+        Returns:
+            An iterator of IPv(4|6) objects.
+
+        Raises:
+            ValueError: The prefixlen_diff is too small or too large.
+                OR
+            prefixlen_diff and new_prefix are both set or new_prefix
+              is a smaller number than the current prefix (smaller
+              number means a larger network)
+
+        """
+        if self._prefixlen == self._max_prefixlen:
+            yield self
+            return
+
+        if new_prefix is not None:
+            if new_prefix < self._prefixlen:
+                raise ValueError('new prefix must be longer')
+            if prefixlen_diff != 1:
+                raise ValueError('cannot set prefixlen_diff and new_prefix')
+            prefixlen_diff = new_prefix - self._prefixlen
+
+        if prefixlen_diff < 0:
+            raise ValueError('prefix length diff must be > 0')
+        new_prefixlen = self._prefixlen + prefixlen_diff
+
+        if new_prefixlen > self._max_prefixlen:
+            raise ValueError(
+                'prefix length diff %d is invalid for netblock %s' % (
+                    new_prefixlen, self))
+
+        start = int(self.network_address)
+        end = int(self.broadcast_address) + 1
+        step = (int(self.hostmask) + 1) >> prefixlen_diff
+        for new_addr in _compat_range(start, end, step):
+            current = self.__class__((new_addr, new_prefixlen))
+            yield current
+
+    def supernet(self, prefixlen_diff=1, new_prefix=None):
+        """The supernet containing the current network.
+
+        Args:
+            prefixlen_diff: An integer, the amount the prefix length of
+              the network should be decreased by.  For example, given a
+              /24 network and a prefixlen_diff of 3, a supernet with a
+              /21 netmask is returned.
+
+        Returns:
+            An IPv4 network object.
+
+        Raises:
+            ValueError: If self.prefixlen - prefixlen_diff < 0. I.e., you have
+              a negative prefix length.
+                OR
+            If prefixlen_diff and new_prefix are both set or new_prefix is a
+              larger number than the current prefix (larger number means a
+              smaller network)
+
+        """
+        if self._prefixlen == 0:
+            return self
+
+        if new_prefix is not None:
+            if new_prefix > self._prefixlen:
+                raise ValueError('new prefix must be shorter')
+            if prefixlen_diff != 1:
+                raise ValueError('cannot set prefixlen_diff and new_prefix')
+            prefixlen_diff = self._prefixlen - new_prefix
+
+        new_prefixlen = self.prefixlen - prefixlen_diff
+        if new_prefixlen < 0:
+            raise ValueError(
+                'current prefixlen is %d, cannot have a prefixlen_diff of %d' %
+                (self.prefixlen, prefixlen_diff))
+        return self.__class__((
+            int(self.network_address) & (int(self.netmask) << prefixlen_diff),
+            new_prefixlen))
+
+    @property
+    def is_multicast(self):
+        """Test if the address is reserved for multicast use.
+
+        Returns:
+            A boolean, True if the address is a multicast address.
+            See RFC 2373 2.7 for details.
+
+        """
+        return (self.network_address.is_multicast and
+                self.broadcast_address.is_multicast)
+
+    @staticmethod
+    def _is_subnet_of(a, b):
+        try:
+            # Always false if one is v4 and the other is v6.
+            if a._version != b._version:
+                raise TypeError(
+                    "%s and %s are not of the same version" % (a, b))
+            return (b.network_address <= a.network_address and
+                    b.broadcast_address >= a.broadcast_address)
+        except AttributeError:
+            raise TypeError("Unable to test subnet containment "
+                            "between %s and %s" % (a, b))
+
+    def subnet_of(self, other):
+        """Return True if this network is a subnet of other."""
+        return self._is_subnet_of(self, other)
+
+    def supernet_of(self, other):
+        """Return True if this network is a supernet of other."""
+        return self._is_subnet_of(other, self)
+
+    @property
+    def is_reserved(self):
+        """Test if the address is otherwise IETF reserved.
+
+        Returns:
+            A boolean, True if the address is within one of the
+            reserved IPv6 Network ranges.
+
+        """
+        return (self.network_address.is_reserved and
+                self.broadcast_address.is_reserved)
+
+    @property
+    def is_link_local(self):
+        """Test if the address is reserved for link-local.
+
+        Returns:
+            A boolean, True if the address is reserved per RFC 4291.
+
+        """
+        return (self.network_address.is_link_local and
+                self.broadcast_address.is_link_local)
+
+    @property
+    def is_private(self):
+        """Test if this address is allocated for private networks.
+
+        Returns:
+            A boolean, True if the address is reserved per
+            iana-ipv4-special-registry or iana-ipv6-special-registry.
+
+        """
+        return (self.network_address.is_private and
+                self.broadcast_address.is_private)
+
+    @property
+    def is_global(self):
+        """Test if this address is allocated for public networks.
+
+        Returns:
+            A boolean, True if the address is not reserved per
+            iana-ipv4-special-registry or iana-ipv6-special-registry.
+
+        """
+        return not self.is_private
+
+    @property
+    def is_unspecified(self):
+        """Test if the address is unspecified.
+
+        Returns:
+            A boolean, True if this is the unspecified address as defined in
+            RFC 2373 2.5.2.
+
+        """
+        return (self.network_address.is_unspecified and
+                self.broadcast_address.is_unspecified)
+
+    @property
+    def is_loopback(self):
+        """Test if the address is a loopback address.
+
+        Returns:
+            A boolean, True if the address is a loopback address as defined in
+            RFC 2373 2.5.3.
+
+        """
+        return (self.network_address.is_loopback and
+                self.broadcast_address.is_loopback)
+
+
+class _BaseV4(object):
+
+    """Base IPv4 object.
+
+    The following methods are used by IPv4 objects in both single IP
+    addresses and networks.
+
+    """
+
+    __slots__ = ()
+    _version = 4
+    # Equivalent to 255.255.255.255 or 32 bits of 1's.
+    _ALL_ONES = (2 ** IPV4LENGTH) - 1
+    _DECIMAL_DIGITS = frozenset('0123456789')
+
+    # the valid octets for host and netmasks. only useful for IPv4.
+    _valid_mask_octets = frozenset([255, 254, 252, 248, 240, 224, 192, 128, 0])
+
+    _max_prefixlen = IPV4LENGTH
+    # There are only a handful of valid v4 netmasks, so we cache them all
+    # when constructed (see _make_netmask()).
+    _netmask_cache = {}
+
+    def _explode_shorthand_ip_string(self):
+        return _compat_str(self)
+
+    @classmethod
+    def _make_netmask(cls, arg):
+        """Make a (netmask, prefix_len) tuple from the given argument.
+
+        Argument can be:
+        - an integer (the prefix length)
+        - a string representing the prefix length (e.g. "24")
+        - a string representing the prefix netmask (e.g. "255.255.255.0")
+        """
+        if arg not in cls._netmask_cache:
+            if isinstance(arg, _compat_int_types):
+                prefixlen = arg
+            else:
+                try:
+                    # Check for a netmask in prefix length form
+                    prefixlen = cls._prefix_from_prefix_string(arg)
+                except NetmaskValueError:
+                    # Check for a netmask or hostmask in dotted-quad form.
+                    # This may raise NetmaskValueError.
+                    prefixlen = cls._prefix_from_ip_string(arg)
+            netmask = IPv4Address(cls._ip_int_from_prefix(prefixlen))
+            cls._netmask_cache[arg] = netmask, prefixlen
+        return cls._netmask_cache[arg]
+
+    @classmethod
+    def _ip_int_from_string(cls, ip_str):
+        """Turn the given IP string into an integer for comparison.
+
+        Args:
+            ip_str: A string, the IP ip_str.
+
+        Returns:
+            The IP ip_str as an integer.
+
+        Raises:
+            AddressValueError: if ip_str isn't a valid IPv4 Address.
+
+        """
+        if not ip_str:
+            raise AddressValueError('Address cannot be empty')
+
+        octets = ip_str.split('.')
+        if len(octets) != 4:
+            raise AddressValueError("Expected 4 octets in %r" % ip_str)
+
+        try:
+            return _compat_int_from_byte_vals(
+                map(cls._parse_octet, octets), 'big')
+        except ValueError as exc:
+            raise AddressValueError("%s in %r" % (exc, ip_str))
+
+    @classmethod
+    def _parse_octet(cls, octet_str):
+        """Convert a decimal octet into an integer.
+
+        Args:
+            octet_str: A string, the number to parse.
+
+        Returns:
+            The octet as an integer.
+
+        Raises:
+            ValueError: if the octet isn't strictly a decimal from [0..255].
+
+        """
+        if not octet_str:
+            raise ValueError("Empty octet not permitted")
+        # Whitelist the characters, since int() allows a lot of bizarre stuff.
+        if not cls._DECIMAL_DIGITS.issuperset(octet_str):
+            msg = "Only decimal digits permitted in %r"
+            raise ValueError(msg % octet_str)
+        # We do the length check second, since the invalid character error
+        # is likely to be more informative for the user
+        if len(octet_str) > 3:
+            msg = "At most 3 characters permitted in %r"
+            raise ValueError(msg % octet_str)
+        # Convert to integer (we know digits are legal)
+        octet_int = int(octet_str, 10)
+        # Any octets that look like they *might* be written in octal,
+        # and which don't look exactly the same in both octal and
+        # decimal are rejected as ambiguous
+        if octet_int > 7 and octet_str[0] == '0':
+            msg = "Ambiguous (octal/decimal) value in %r not permitted"
+            raise ValueError(msg % octet_str)
+        if octet_int > 255:
+            raise ValueError("Octet %d (> 255) not permitted" % octet_int)
+        return octet_int
+
+    @classmethod
+    def _string_from_ip_int(cls, ip_int):
+        """Turns a 32-bit integer into dotted decimal notation.
+
+        Args:
+            ip_int: An integer, the IP address.
+
+        Returns:
+            The IP address as a string in dotted decimal notation.
+
+        """
+        return '.'.join(_compat_str(struct.unpack(b'!B', b)[0]
+                                    if isinstance(b, bytes)
+                                    else b)
+                        for b in _compat_to_bytes(ip_int, 4, 'big'))
+
+    def _is_hostmask(self, ip_str):
+        """Test if the IP string is a hostmask (rather than a netmask).
+
+        Args:
+            ip_str: A string, the potential hostmask.
+
+        Returns:
+            A boolean, True if the IP string is a hostmask.
+
+        """
+        bits = ip_str.split('.')
+        try:
+            parts = [x for x in map(int, bits) if x in self._valid_mask_octets]
+        except ValueError:
+            return False
+        if len(parts) != len(bits):
+            return False
+        if parts[0] < parts[-1]:
+            return True
+        return False
+
+    def _reverse_pointer(self):
+        """Return the reverse DNS pointer name for the IPv4 address.
+
+        This implements the method described in RFC1035 3.5.
+
+        """
+        reverse_octets = _compat_str(self).split('.')[::-1]
+        return '.'.join(reverse_octets) + '.in-addr.arpa'
+
+    @property
+    def max_prefixlen(self):
+        return self._max_prefixlen
+
+    @property
+    def version(self):
+        return self._version
+
+
+class IPv4Address(_BaseV4, _BaseAddress):
+
+    """Represent and manipulate single IPv4 Addresses."""
+
+    __slots__ = ('_ip', '__weakref__')
+
+    def __init__(self, address):
+
+        """
+        Args:
+            address: A string or integer representing the IP
+
+              Additionally, an integer can be passed, so
+              IPv4Address('192.0.2.1') == IPv4Address(3221225985).
+              or, more generally
+              IPv4Address(int(IPv4Address('192.0.2.1'))) ==
+                IPv4Address('192.0.2.1')
+
+        Raises:
+            AddressValueError: If ipaddress isn't a valid IPv4 address.
+
+        """
+        # Efficient constructor from integer.
+        if isinstance(address, _compat_int_types):
+            self._check_int_address(address)
+            self._ip = address
+            return
+
+        # Constructing from a packed address
+        if isinstance(address, bytes):
+            self._check_packed_address(address, 4)
+            bvs = _compat_bytes_to_byte_vals(address)
+            self._ip = _compat_int_from_byte_vals(bvs, 'big')
+            return
+
+        # Assume input argument to be string or any object representation
+        # which converts into a formatted IP string.
+        addr_str = _compat_str(address)
+        if '/' in addr_str:
+            raise AddressValueError("Unexpected '/' in %r" % address)
+        self._ip = self._ip_int_from_string(addr_str)
+
+    @property
+    def packed(self):
+        """The binary representation of this address."""
+        return v4_int_to_packed(self._ip)
+
+    @property
+    def is_reserved(self):
+        """Test if the address is otherwise IETF reserved.
+
+         Returns:
+             A boolean, True if the address is within the
+             reserved IPv4 Network range.
+
+        """
+        return self in self._constants._reserved_network
+
+    @property
+    def is_private(self):
+        """Test if this address is allocated for private networks.
+
+        Returns:
+            A boolean, True if the address is reserved per
+            iana-ipv4-special-registry.
+
+        """
+        return any(self in net for net in self._constants._private_networks)
+
+    @property
+    def is_global(self):
+        return (
+            self not in self._constants._public_network and
+            not self.is_private)
+
+    @property
+    def is_multicast(self):
+        """Test if the address is reserved for multicast use.
+
+        Returns:
+            A boolean, True if the address is multicast.
+            See RFC 3171 for details.
+
+        """
+        return self in self._constants._multicast_network
+
+    @property
+    def is_unspecified(self):
+        """Test if the address is unspecified.
+
+        Returns:
+            A boolean, True if this is the unspecified address as defined in
+            RFC 5735 3.
+
+        """
+        return self == self._constants._unspecified_address
+
+    @property
+    def is_loopback(self):
+        """Test if the address is a loopback address.
+
+        Returns:
+            A boolean, True if the address is a loopback per RFC 3330.
+
+        """
+        return self in self._constants._loopback_network
+
+    @property
+    def is_link_local(self):
+        """Test if the address is reserved for link-local.
+
+        Returns:
+            A boolean, True if the address is link-local per RFC 3927.
+
+        """
+        return self in self._constants._linklocal_network
+
+
+class IPv4Interface(IPv4Address):
+
+    def __init__(self, address):
+        if isinstance(address, (bytes, _compat_int_types)):
+            IPv4Address.__init__(self, address)
+            self.network = IPv4Network(self._ip)
+            self._prefixlen = self._max_prefixlen
+            return
+
+        if isinstance(address, tuple):
+            IPv4Address.__init__(self, address[0])
+            if len(address) > 1:
+                self._prefixlen = int(address[1])
+            else:
+                self._prefixlen = self._max_prefixlen
+
+            self.network = IPv4Network(address, strict=False)
+            self.netmask = self.network.netmask
+            self.hostmask = self.network.hostmask
+            return
+
+        addr = _split_optional_netmask(address)
+        IPv4Address.__init__(self, addr[0])
+
+        self.network = IPv4Network(address, strict=False)
+        self._prefixlen = self.network._prefixlen
+
+        self.netmask = self.network.netmask
+        self.hostmask = self.network.hostmask
+
+    def __str__(self):
+        return '%s/%d' % (self._string_from_ip_int(self._ip),
+                          self.network.prefixlen)
+
+    def __eq__(self, other):
+        address_equal = IPv4Address.__eq__(self, other)
+        if not address_equal or address_equal is NotImplemented:
+            return address_equal
+        try:
+            return self.network == other.network
+        except AttributeError:
+            # An interface with an associated network is NOT the
+            # same as an unassociated address. That's why the hash
+            # takes the extra info into account.
+            return False
+
+    def __lt__(self, other):
+        address_less = IPv4Address.__lt__(self, other)
+        if address_less is NotImplemented:
+            return NotImplemented
+        try:
+            return (self.network < other.network or
+                    self.network == other.network and address_less)
+        except AttributeError:
+            # We *do* allow addresses and interfaces to be sorted. The
+            # unassociated address is considered less than all interfaces.
+            return False
+
+    def __hash__(self):
+        return self._ip ^ self._prefixlen ^ int(self.network.network_address)
+
+    __reduce__ = _IPAddressBase.__reduce__
+
+    @property
+    def ip(self):
+        return IPv4Address(self._ip)
+
+    @property
+    def with_prefixlen(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self._prefixlen)
+
+    @property
+    def with_netmask(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self.netmask)
+
+    @property
+    def with_hostmask(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self.hostmask)
+
+
+class IPv4Network(_BaseV4, _BaseNetwork):
+
+    """This class represents and manipulates 32-bit IPv4 network + addresses..
+
+    Attributes: [examples for IPv4Network('192.0.2.0/27')]
+        .network_address: IPv4Address('192.0.2.0')
+        .hostmask: IPv4Address('0.0.0.31')
+        .broadcast_address: IPv4Address('192.0.2.32')
+        .netmask: IPv4Address('255.255.255.224')
+        .prefixlen: 27
+
+    """
+    # Class to use when creating address objects
+    _address_class = IPv4Address
+
+    def __init__(self, address, strict=True):
+
+        """Instantiate a new IPv4 network object.
+
+        Args:
+            address: A string or integer representing the IP [& network].
+              '192.0.2.0/24'
+              '192.0.2.0/255.255.255.0'
+              '192.0.0.2/0.0.0.255'
+              are all functionally the same in IPv4. Similarly,
+              '192.0.2.1'
+              '192.0.2.1/255.255.255.255'
+              '192.0.2.1/32'
+              are also functionally equivalent. That is to say, failing to
+              provide a subnetmask will create an object with a mask of /32.
+
+              If the mask (portion after the / in the argument) is given in
+              dotted quad form, it is treated as a netmask if it starts with a
+              non-zero field (e.g. /255.0.0.0 == /8) and as a hostmask if it
+              starts with a zero field (e.g. 0.255.255.255 == /8), with the
+              single exception of an all-zero mask which is treated as a
+              netmask == /0. If no mask is given, a default of /32 is used.
+
+              Additionally, an integer can be passed, so
+              IPv4Network('192.0.2.1') == IPv4Network(3221225985)
+              or, more generally
+              IPv4Interface(int(IPv4Interface('192.0.2.1'))) ==
+                IPv4Interface('192.0.2.1')
+
+        Raises:
+            AddressValueError: If ipaddress isn't a valid IPv4 address.
+            NetmaskValueError: If the netmask isn't valid for
+              an IPv4 address.
+            ValueError: If strict is True and a network address is not
+              supplied.
+
+        """
+        _BaseNetwork.__init__(self, address)
+
+        # Constructing from a packed address or integer
+        if isinstance(address, (_compat_int_types, bytes)):
+            self.network_address = IPv4Address(address)
+            self.netmask, self._prefixlen = self._make_netmask(
+                self._max_prefixlen)
+            # fixme: address/network test here.
+            return
+
+        if isinstance(address, tuple):
+            if len(address) > 1:
+                arg = address[1]
+            else:
+                # We weren't given an address[1]
+                arg = self._max_prefixlen
+            self.network_address = IPv4Address(address[0])
+            self.netmask, self._prefixlen = self._make_netmask(arg)
+            packed = int(self.network_address)
+            if packed & int(self.netmask) != packed:
+                if strict:
+                    raise ValueError('%s has host bits set' % self)
+                else:
+                    self.network_address = IPv4Address(packed &
+                                                       int(self.netmask))
+            return
+
+        # Assume input argument to be string or any object representation
+        # which converts into a formatted IP prefix string.
+        addr = _split_optional_netmask(address)
+        self.network_address = IPv4Address(self._ip_int_from_string(addr[0]))
+
+        if len(addr) == 2:
+            arg = addr[1]
+        else:
+            arg = self._max_prefixlen
+        self.netmask, self._prefixlen = self._make_netmask(arg)
+
+        if strict:
+            if (IPv4Address(int(self.network_address) & int(self.netmask)) !=
+                    self.network_address):
+                raise ValueError('%s has host bits set' % self)
+        self.network_address = IPv4Address(int(self.network_address) &
+                                           int(self.netmask))
+
+        if self._prefixlen == (self._max_prefixlen - 1):
+            self.hosts = self.__iter__
+
+    @property
+    def is_global(self):
+        """Test if this address is allocated for public networks.
+
+        Returns:
+            A boolean, True if the address is not reserved per
+            iana-ipv4-special-registry.
+
+        """
+        return (not (self.network_address in IPv4Network('100.64.0.0/10') and
+                self.broadcast_address in IPv4Network('100.64.0.0/10')) and
+                not self.is_private)
+
+
+class _IPv4Constants(object):
+
+    _linklocal_network = IPv4Network('169.254.0.0/16')
+
+    _loopback_network = IPv4Network('127.0.0.0/8')
+
+    _multicast_network = IPv4Network('224.0.0.0/4')
+
+    _public_network = IPv4Network('100.64.0.0/10')
+
+    _private_networks = [
+        IPv4Network('0.0.0.0/8'),
+        IPv4Network('10.0.0.0/8'),
+        IPv4Network('127.0.0.0/8'),
+        IPv4Network('169.254.0.0/16'),
+        IPv4Network('172.16.0.0/12'),
+        IPv4Network('192.0.0.0/29'),
+        IPv4Network('192.0.0.170/31'),
+        IPv4Network('192.0.2.0/24'),
+        IPv4Network('192.168.0.0/16'),
+        IPv4Network('198.18.0.0/15'),
+        IPv4Network('198.51.100.0/24'),
+        IPv4Network('203.0.113.0/24'),
+        IPv4Network('240.0.0.0/4'),
+        IPv4Network('255.255.255.255/32'),
+    ]
+
+    _reserved_network = IPv4Network('240.0.0.0/4')
+
+    _unspecified_address = IPv4Address('0.0.0.0')
+
+
+IPv4Address._constants = _IPv4Constants
+
+
+class _BaseV6(object):
+
+    """Base IPv6 object.
+
+    The following methods are used by IPv6 objects in both single IP
+    addresses and networks.
+
+    """
+
+    __slots__ = ()
+    _version = 6
+    _ALL_ONES = (2 ** IPV6LENGTH) - 1
+    _HEXTET_COUNT = 8
+    _HEX_DIGITS = frozenset('0123456789ABCDEFabcdef')
+    _max_prefixlen = IPV6LENGTH
+
+    # There are only a bunch of valid v6 netmasks, so we cache them all
+    # when constructed (see _make_netmask()).
+    _netmask_cache = {}
+
+    @classmethod
+    def _make_netmask(cls, arg):
+        """Make a (netmask, prefix_len) tuple from the given argument.
+
+        Argument can be:
+        - an integer (the prefix length)
+        - a string representing the prefix length (e.g. "24")
+        - a string representing the prefix netmask (e.g. "255.255.255.0")
+        """
+        if arg not in cls._netmask_cache:
+            if isinstance(arg, _compat_int_types):
+                prefixlen = arg
+            else:
+                prefixlen = cls._prefix_from_prefix_string(arg)
+            netmask = IPv6Address(cls._ip_int_from_prefix(prefixlen))
+            cls._netmask_cache[arg] = netmask, prefixlen
+        return cls._netmask_cache[arg]
+
+    @classmethod
+    def _ip_int_from_string(cls, ip_str):
+        """Turn an IPv6 ip_str into an integer.
+
+        Args:
+            ip_str: A string, the IPv6 ip_str.
+
+        Returns:
+            An int, the IPv6 address
+
+        Raises:
+            AddressValueError: if ip_str isn't a valid IPv6 Address.
+
+        """
+        if not ip_str:
+            raise AddressValueError('Address cannot be empty')
+
+        parts = ip_str.split(':')
+
+        # An IPv6 address needs at least 2 colons (3 parts).
+        _min_parts = 3
+        if len(parts) < _min_parts:
+            msg = "At least %d parts expected in %r" % (_min_parts, ip_str)
+            raise AddressValueError(msg)
+
+        # If the address has an IPv4-style suffix, convert it to hexadecimal.
+        if '.' in parts[-1]:
+            try:
+                ipv4_int = IPv4Address(parts.pop())._ip
+            except AddressValueError as exc:
+                raise AddressValueError("%s in %r" % (exc, ip_str))
+            parts.append('%x' % ((ipv4_int >> 16) & 0xFFFF))
+            parts.append('%x' % (ipv4_int & 0xFFFF))
+
+        # An IPv6 address can't have more than 8 colons (9 parts).
+        # The extra colon comes from using the "::" notation for a single
+        # leading or trailing zero part.
+        _max_parts = cls._HEXTET_COUNT + 1
+        if len(parts) > _max_parts:
+            msg = "At most %d colons permitted in %r" % (
+                _max_parts - 1, ip_str)
+            raise AddressValueError(msg)
+
+        # Disregarding the endpoints, find '::' with nothing in between.
+        # This indicates that a run of zeroes has been skipped.
+        skip_index = None
+        for i in _compat_range(1, len(parts) - 1):
+            if not parts[i]:
+                if skip_index is not None:
+                    # Can't have more than one '::'
+                    msg = "At most one '::' permitted in %r" % ip_str
+                    raise AddressValueError(msg)
+                skip_index = i
+
+        # parts_hi is the number of parts to copy from above/before the '::'
+        # parts_lo is the number of parts to copy from below/after the '::'
+        if skip_index is not None:
+            # If we found a '::', then check if it also covers the endpoints.
+            parts_hi = skip_index
+            parts_lo = len(parts) - skip_index - 1
+            if not parts[0]:
+                parts_hi -= 1
+                if parts_hi:
+                    msg = "Leading ':' only permitted as part of '::' in %r"
+                    raise AddressValueError(msg % ip_str)  # ^: requires ^::
+            if not parts[-1]:
+                parts_lo -= 1
+                if parts_lo:
+                    msg = "Trailing ':' only permitted as part of '::' in %r"
+                    raise AddressValueError(msg % ip_str)  # :$ requires ::$
+            parts_skipped = cls._HEXTET_COUNT - (parts_hi + parts_lo)
+            if parts_skipped < 1:
+                msg = "Expected at most %d other parts with '::' in %r"
+                raise AddressValueError(msg % (cls._HEXTET_COUNT - 1, ip_str))
+        else:
+            # Otherwise, allocate the entire address to parts_hi.  The
+            # endpoints could still be empty, but _parse_hextet() will check
+            # for that.
+            if len(parts) != cls._HEXTET_COUNT:
+                msg = "Exactly %d parts expected without '::' in %r"
+                raise AddressValueError(msg % (cls._HEXTET_COUNT, ip_str))
+            if not parts[0]:
+                msg = "Leading ':' only permitted as part of '::' in %r"
+                raise AddressValueError(msg % ip_str)  # ^: requires ^::
+            if not parts[-1]:
+                msg = "Trailing ':' only permitted as part of '::' in %r"
+                raise AddressValueError(msg % ip_str)  # :$ requires ::$
+            parts_hi = len(parts)
+            parts_lo = 0
+            parts_skipped = 0
+
+        try:
+            # Now, parse the hextets into a 128-bit integer.
+            ip_int = 0
+            for i in range(parts_hi):
+                ip_int <<= 16
+                ip_int |= cls._parse_hextet(parts[i])
+            ip_int <<= 16 * parts_skipped
+            for i in range(-parts_lo, 0):
+                ip_int <<= 16
+                ip_int |= cls._parse_hextet(parts[i])
+            return ip_int
+        except ValueError as exc:
+            raise AddressValueError("%s in %r" % (exc, ip_str))
+
+    @classmethod
+    def _parse_hextet(cls, hextet_str):
+        """Convert an IPv6 hextet string into an integer.
+
+        Args:
+            hextet_str: A string, the number to parse.
+
+        Returns:
+            The hextet as an integer.
+
+        Raises:
+            ValueError: if the input isn't strictly a hex number from
+              [0..FFFF].
+
+        """
+        # Whitelist the characters, since int() allows a lot of bizarre stuff.
+        if not cls._HEX_DIGITS.issuperset(hextet_str):
+            raise ValueError("Only hex digits permitted in %r" % hextet_str)
+        # We do the length check second, since the invalid character error
+        # is likely to be more informative for the user
+        if len(hextet_str) > 4:
+            msg = "At most 4 characters permitted in %r"
+            raise ValueError(msg % hextet_str)
+        # Length check means we can skip checking the integer value
+        return int(hextet_str, 16)
+
+    @classmethod
+    def _compress_hextets(cls, hextets):
+        """Compresses a list of hextets.
+
+        Compresses a list of strings, replacing the longest continuous
+        sequence of "0" in the list with "" and adding empty strings at
+        the beginning or at the end of the string such that subsequently
+        calling ":".join(hextets) will produce the compressed version of
+        the IPv6 address.
+
+        Args:
+            hextets: A list of strings, the hextets to compress.
+
+        Returns:
+            A list of strings.
+
+        """
+        best_doublecolon_start = -1
+        best_doublecolon_len = 0
+        doublecolon_start = -1
+        doublecolon_len = 0
+        for index, hextet in enumerate(hextets):
+            if hextet == '0':
+                doublecolon_len += 1
+                if doublecolon_start == -1:
+                    # Start of a sequence of zeros.
+                    doublecolon_start = index
+                if doublecolon_len > best_doublecolon_len:
+                    # This is the longest sequence of zeros so far.
+                    best_doublecolon_len = doublecolon_len
+                    best_doublecolon_start = doublecolon_start
+            else:
+                doublecolon_len = 0
+                doublecolon_start = -1
+
+        if best_doublecolon_len > 1:
+            best_doublecolon_end = (best_doublecolon_start +
+                                    best_doublecolon_len)
+            # For zeros at the end of the address.
+            if best_doublecolon_end == len(hextets):
+                hextets += ['']
+            hextets[best_doublecolon_start:best_doublecolon_end] = ['']
+            # For zeros at the beginning of the address.
+            if best_doublecolon_start == 0:
+                hextets = [''] + hextets
+
+        return hextets
+
+    @classmethod
+    def _string_from_ip_int(cls, ip_int=None):
+        """Turns a 128-bit integer into hexadecimal notation.
+
+        Args:
+            ip_int: An integer, the IP address.
+
+        Returns:
+            A string, the hexadecimal representation of the address.
+
+        Raises:
+            ValueError: The address is bigger than 128 bits of all ones.
+
+        """
+        if ip_int is None:
+            ip_int = int(cls._ip)
+
+        if ip_int > cls._ALL_ONES:
+            raise ValueError('IPv6 address is too large')
+
+        hex_str = '%032x' % ip_int
+        hextets = ['%x' % int(hex_str[x:x + 4], 16) for x in range(0, 32, 4)]
+
+        hextets = cls._compress_hextets(hextets)
+        return ':'.join(hextets)
+
+    def _explode_shorthand_ip_string(self):
+        """Expand a shortened IPv6 address.
+
+        Args:
+            ip_str: A string, the IPv6 address.
+
+        Returns:
+            A string, the expanded IPv6 address.
+
+        """
+        if isinstance(self, IPv6Network):
+            ip_str = _compat_str(self.network_address)
+        elif isinstance(self, IPv6Interface):
+            ip_str = _compat_str(self.ip)
+        else:
+            ip_str = _compat_str(self)
+
+        ip_int = self._ip_int_from_string(ip_str)
+        hex_str = '%032x' % ip_int
+        parts = [hex_str[x:x + 4] for x in range(0, 32, 4)]
+        if isinstance(self, (_BaseNetwork, IPv6Interface)):
+            return '%s/%d' % (':'.join(parts), self._prefixlen)
+        return ':'.join(parts)
+
+    def _reverse_pointer(self):
+        """Return the reverse DNS pointer name for the IPv6 address.
+
+        This implements the method described in RFC3596 2.5.
+
+        """
+        reverse_chars = self.exploded[::-1].replace(':', '')
+        return '.'.join(reverse_chars) + '.ip6.arpa'
+
+    @property
+    def max_prefixlen(self):
+        return self._max_prefixlen
+
+    @property
+    def version(self):
+        return self._version
+
+
+class IPv6Address(_BaseV6, _BaseAddress):
+
+    """Represent and manipulate single IPv6 Addresses."""
+
+    __slots__ = ('_ip', '__weakref__')
+
+    def __init__(self, address):
+        """Instantiate a new IPv6 address object.
+
+        Args:
+            address: A string or integer representing the IP
+
+              Additionally, an integer can be passed, so
+              IPv6Address('2001:db8::') ==
+                IPv6Address(42540766411282592856903984951653826560)
+              or, more generally
+              IPv6Address(int(IPv6Address('2001:db8::'))) ==
+                IPv6Address('2001:db8::')
+
+        Raises:
+            AddressValueError: If address isn't a valid IPv6 address.
+
+        """
+        # Efficient constructor from integer.
+        if isinstance(address, _compat_int_types):
+            self._check_int_address(address)
+            self._ip = address
+            return
+
+        # Constructing from a packed address
+        if isinstance(address, bytes):
+            self._check_packed_address(address, 16)
+            bvs = _compat_bytes_to_byte_vals(address)
+            self._ip = _compat_int_from_byte_vals(bvs, 'big')
+            return
+
+        # Assume input argument to be string or any object representation
+        # which converts into a formatted IP string.
+        addr_str = _compat_str(address)
+        if '/' in addr_str:
+            raise AddressValueError("Unexpected '/' in %r" % address)
+        self._ip = self._ip_int_from_string(addr_str)
+
+    @property
+    def packed(self):
+        """The binary representation of this address."""
+        return v6_int_to_packed(self._ip)
+
+    @property
+    def is_multicast(self):
+        """Test if the address is reserved for multicast use.
+
+        Returns:
+            A boolean, True if the address is a multicast address.
+            See RFC 2373 2.7 for details.
+
+        """
+        return self in self._constants._multicast_network
+
+    @property
+    def is_reserved(self):
+        """Test if the address is otherwise IETF reserved.
+
+        Returns:
+            A boolean, True if the address is within one of the
+            reserved IPv6 Network ranges.
+
+        """
+        return any(self in x for x in self._constants._reserved_networks)
+
+    @property
+    def is_link_local(self):
+        """Test if the address is reserved for link-local.
+
+        Returns:
+            A boolean, True if the address is reserved per RFC 4291.
+
+        """
+        return self in self._constants._linklocal_network
+
+    @property
+    def is_site_local(self):
+        """Test if the address is reserved for site-local.
+
+        Note that the site-local address space has been deprecated by RFC 3879.
+        Use is_private to test if this address is in the space of unique local
+        addresses as defined by RFC 4193.
+
+        Returns:
+            A boolean, True if the address is reserved per RFC 3513 2.5.6.
+
+        """
+        return self in self._constants._sitelocal_network
+
+    @property
+    def is_private(self):
+        """Test if this address is allocated for private networks.
+
+        Returns:
+            A boolean, True if the address is reserved per
+            iana-ipv6-special-registry.
+
+        """
+        return any(self in net for net in self._constants._private_networks)
+
+    @property
+    def is_global(self):
+        """Test if this address is allocated for public networks.
+
+        Returns:
+            A boolean, true if the address is not reserved per
+            iana-ipv6-special-registry.
+
+        """
+        return not self.is_private
+
+    @property
+    def is_unspecified(self):
+        """Test if the address is unspecified.
+
+        Returns:
+            A boolean, True if this is the unspecified address as defined in
+            RFC 2373 2.5.2.
+
+        """
+        return self._ip == 0
+
+    @property
+    def is_loopback(self):
+        """Test if the address is a loopback address.
+
+        Returns:
+            A boolean, True if the address is a loopback address as defined in
+            RFC 2373 2.5.3.
+
+        """
+        return self._ip == 1
+
+    @property
+    def ipv4_mapped(self):
+        """Return the IPv4 mapped address.
+
+        Returns:
+            If the IPv6 address is a v4 mapped address, return the
+            IPv4 mapped address. Return None otherwise.
+
+        """
+        if (self._ip >> 32) != 0xFFFF:
+            return None
+        return IPv4Address(self._ip & 0xFFFFFFFF)
+
+    @property
+    def teredo(self):
+        """Tuple of embedded teredo IPs.
+
+        Returns:
+            Tuple of the (server, client) IPs or None if the address
+            doesn't appear to be a teredo address (doesn't start with
+            2001::/32)
+
+        """
+        if (self._ip >> 96) != 0x20010000:
+            return None
+        return (IPv4Address((self._ip >> 64) & 0xFFFFFFFF),
+                IPv4Address(~self._ip & 0xFFFFFFFF))
+
+    @property
+    def sixtofour(self):
+        """Return the IPv4 6to4 embedded address.
+
+        Returns:
+            The IPv4 6to4-embedded address if present or None if the
+            address doesn't appear to contain a 6to4 embedded address.
+
+        """
+        if (self._ip >> 112) != 0x2002:
+            return None
+        return IPv4Address((self._ip >> 80) & 0xFFFFFFFF)
+
+
+class IPv6Interface(IPv6Address):
+
+    def __init__(self, address):
+        if isinstance(address, (bytes, _compat_int_types)):
+            IPv6Address.__init__(self, address)
+            self.network = IPv6Network(self._ip)
+            self._prefixlen = self._max_prefixlen
+            return
+        if isinstance(address, tuple):
+            IPv6Address.__init__(self, address[0])
+            if len(address) > 1:
+                self._prefixlen = int(address[1])
+            else:
+                self._prefixlen = self._max_prefixlen
+            self.network = IPv6Network(address, strict=False)
+            self.netmask = self.network.netmask
+            self.hostmask = self.network.hostmask
+            return
+
+        addr = _split_optional_netmask(address)
+        IPv6Address.__init__(self, addr[0])
+        self.network = IPv6Network(address, strict=False)
+        self.netmask = self.network.netmask
+        self._prefixlen = self.network._prefixlen
+        self.hostmask = self.network.hostmask
+
+    def __str__(self):
+        return '%s/%d' % (self._string_from_ip_int(self._ip),
+                          self.network.prefixlen)
+
+    def __eq__(self, other):
+        address_equal = IPv6Address.__eq__(self, other)
+        if not address_equal or address_equal is NotImplemented:
+            return address_equal
+        try:
+            return self.network == other.network
+        except AttributeError:
+            # An interface with an associated network is NOT the
+            # same as an unassociated address. That's why the hash
+            # takes the extra info into account.
+            return False
+
+    def __lt__(self, other):
+        address_less = IPv6Address.__lt__(self, other)
+        if address_less is NotImplemented:
+            return NotImplemented
+        try:
+            return (self.network < other.network or
+                    self.network == other.network and address_less)
+        except AttributeError:
+            # We *do* allow addresses and interfaces to be sorted. The
+            # unassociated address is considered less than all interfaces.
+            return False
+
+    def __hash__(self):
+        return self._ip ^ self._prefixlen ^ int(self.network.network_address)
+
+    __reduce__ = _IPAddressBase.__reduce__
+
+    @property
+    def ip(self):
+        return IPv6Address(self._ip)
+
+    @property
+    def with_prefixlen(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self._prefixlen)
+
+    @property
+    def with_netmask(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self.netmask)
+
+    @property
+    def with_hostmask(self):
+        return '%s/%s' % (self._string_from_ip_int(self._ip),
+                          self.hostmask)
+
+    @property
+    def is_unspecified(self):
+        return self._ip == 0 and self.network.is_unspecified
+
+    @property
+    def is_loopback(self):
+        return self._ip == 1 and self.network.is_loopback
+
+
+class IPv6Network(_BaseV6, _BaseNetwork):
+
+    """This class represents and manipulates 128-bit IPv6 networks.
+
+    Attributes: [examples for IPv6('2001:db8::1000/124')]
+        .network_address: IPv6Address('2001:db8::1000')
+        .hostmask: IPv6Address('::f')
+        .broadcast_address: IPv6Address('2001:db8::100f')
+        .netmask: IPv6Address('ffff:ffff:ffff:ffff:ffff:ffff:ffff:fff0')
+        .prefixlen: 124
+
+    """
+
+    # Class to use when creating address objects
+    _address_class = IPv6Address
+
+    def __init__(self, address, strict=True):
+        """Instantiate a new IPv6 Network object.
+
+        Args:
+            address: A string or integer representing the IPv6 network or the
+              IP and prefix/netmask.
+              '2001:db8::/128'
+              '2001:db8:0000:0000:0000:0000:0000:0000/128'
+              '2001:db8::'
+              are all functionally the same in IPv6.  That is to say,
+              failing to provide a subnetmask will create an object with
+              a mask of /128.
+
+              Additionally, an integer can be passed, so
+              IPv6Network('2001:db8::') ==
+                IPv6Network(42540766411282592856903984951653826560)
+              or, more generally
+              IPv6Network(int(IPv6Network('2001:db8::'))) ==
+                IPv6Network('2001:db8::')
+
+            strict: A boolean. If true, ensure that we have been passed
+              A true network address, eg, 2001:db8::1000/124 and not an
+              IP address on a network, eg, 2001:db8::1/124.
+
+        Raises:
+            AddressValueError: If address isn't a valid IPv6 address.
+            NetmaskValueError: If the netmask isn't valid for
+              an IPv6 address.
+            ValueError: If strict was True and a network address was not
+              supplied.
+
+        """
+        _BaseNetwork.__init__(self, address)
+
+        # Efficient constructor from integer or packed address
+        if isinstance(address, (bytes, _compat_int_types)):
+            self.network_address = IPv6Address(address)
+            self.netmask, self._prefixlen = self._make_netmask(
+                self._max_prefixlen)
+            return
+
+        if isinstance(address, tuple):
+            if len(address) > 1:
+                arg = address[1]
+            else:
+                arg = self._max_prefixlen
+            self.netmask, self._prefixlen = self._make_netmask(arg)
+            self.network_address = IPv6Address(address[0])
+            packed = int(self.network_address)
+            if packed & int(self.netmask) != packed:
+                if strict:
+                    raise ValueError('%s has host bits set' % self)
+                else:
+                    self.network_address = IPv6Address(packed &
+                                                       int(self.netmask))
+            return
+
+        # Assume input argument to be string or any object representation
+        # which converts into a formatted IP prefix string.
+        addr = _split_optional_netmask(address)
+
+        self.network_address = IPv6Address(self._ip_int_from_string(addr[0]))
+
+        if len(addr) == 2:
+            arg = addr[1]
+        else:
+            arg = self._max_prefixlen
+        self.netmask, self._prefixlen = self._make_netmask(arg)
+
+        if strict:
+            if (IPv6Address(int(self.network_address) & int(self.netmask)) !=
+                    self.network_address):
+                raise ValueError('%s has host bits set' % self)
+        self.network_address = IPv6Address(int(self.network_address) &
+                                           int(self.netmask))
+
+        if self._prefixlen == (self._max_prefixlen - 1):
+            self.hosts = self.__iter__
+
+    def hosts(self):
+        """Generate Iterator over usable hosts in a network.
+
+          This is like __iter__ except it doesn't return the
+          Subnet-Router anycast address.
+
+        """
+        network = int(self.network_address)
+        broadcast = int(self.broadcast_address)
+        for x in _compat_range(network + 1, broadcast + 1):
+            yield self._address_class(x)
+
+    @property
+    def is_site_local(self):
+        """Test if the address is reserved for site-local.
+
+        Note that the site-local address space has been deprecated by RFC 3879.
+        Use is_private to test if this address is in the space of unique local
+        addresses as defined by RFC 4193.
+
+        Returns:
+            A boolean, True if the address is reserved per RFC 3513 2.5.6.
+
+        """
+        return (self.network_address.is_site_local and
+                self.broadcast_address.is_site_local)
+
+
+class _IPv6Constants(object):
+
+    _linklocal_network = IPv6Network('fe80::/10')
+
+    _multicast_network = IPv6Network('ff00::/8')
+
+    _private_networks = [
+        IPv6Network('::1/128'),
+        IPv6Network('::/128'),
+        IPv6Network('::ffff:0:0/96'),
+        IPv6Network('100::/64'),
+        IPv6Network('2001::/23'),
+        IPv6Network('2001:2::/48'),
+        IPv6Network('2001:db8::/32'),
+        IPv6Network('2001:10::/28'),
+        IPv6Network('fc00::/7'),
+        IPv6Network('fe80::/10'),
+    ]
+
+    _reserved_networks = [
+        IPv6Network('::/8'), IPv6Network('100::/8'),
+        IPv6Network('200::/7'), IPv6Network('400::/6'),
+        IPv6Network('800::/5'), IPv6Network('1000::/4'),
+        IPv6Network('4000::/3'), IPv6Network('6000::/3'),
+        IPv6Network('8000::/3'), IPv6Network('A000::/3'),
+        IPv6Network('C000::/3'), IPv6Network('E000::/4'),
+        IPv6Network('F000::/5'), IPv6Network('F800::/6'),
+        IPv6Network('FE00::/9'),
+    ]
+
+    _sitelocal_network = IPv6Network('fec0::/10')
+
+
+IPv6Address._constants = _IPv6Constants
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__init__.py b/venv/Lib/site-packages/pip/_vendor/msgpack/__init__.py
new file mode 100644
index 000000000..d6705e22b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/msgpack/__init__.py
@@ -0,0 +1,54 @@
+# coding: utf-8
+from ._version import version
+from .exceptions import *
+from .ext import ExtType, Timestamp
+
+import os
+import sys
+
+
+if os.environ.get("MSGPACK_PUREPYTHON") or sys.version_info[0] == 2:
+    from .fallback import Packer, unpackb, Unpacker
+else:
+    try:
+        from ._cmsgpack import Packer, unpackb, Unpacker
+    except ImportError:
+        from .fallback import Packer, unpackb, Unpacker
+
+
+def pack(o, stream, **kwargs):
+    """
+    Pack object `o` and write it to `stream`
+
+    See :class:`Packer` for options.
+    """
+    packer = Packer(**kwargs)
+    stream.write(packer.pack(o))
+
+
+def packb(o, **kwargs):
+    """
+    Pack object `o` and return packed bytes
+
+    See :class:`Packer` for options.
+    """
+    return Packer(**kwargs).pack(o)
+
+
+def unpack(stream, **kwargs):
+    """
+    Unpack an object from `stream`.
+
+    Raises `ExtraData` when `stream` contains extra bytes.
+    See :class:`Unpacker` for options.
+    """
+    data = stream.read()
+    return unpackb(data, **kwargs)
+
+
+# alias for compatibility to simplejson/marshal/pickle.
+load = unpack
+loads = unpackb
+
+dump = pack
+dumps = packb
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..be23adf75
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/_version.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/_version.cpython-36.pyc
new file mode 100644
index 000000000..f344ad587
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/_version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/exceptions.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/exceptions.cpython-36.pyc
new file mode 100644
index 000000000..f19023df7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/ext.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/ext.cpython-36.pyc
new file mode 100644
index 000000000..1f442c8b8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/ext.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/fallback.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/fallback.cpython-36.pyc
new file mode 100644
index 000000000..b3ef34032
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/msgpack/__pycache__/fallback.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/_version.py b/venv/Lib/site-packages/pip/_vendor/msgpack/_version.py
new file mode 100644
index 000000000..9f55cf50d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/msgpack/_version.py
@@ -0,0 +1 @@
+version = (1, 0, 0)
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/exceptions.py b/venv/Lib/site-packages/pip/_vendor/msgpack/exceptions.py
new file mode 100644
index 000000000..d6d2615cf
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/msgpack/exceptions.py
@@ -0,0 +1,48 @@
+class UnpackException(Exception):
+    """Base class for some exceptions raised while unpacking.
+
+    NOTE: unpack may raise exception other than subclass of
+    UnpackException.  If you want to catch all error, catch
+    Exception instead.
+    """
+
+
+class BufferFull(UnpackException):
+    pass
+
+
+class OutOfData(UnpackException):
+    pass
+
+
+class FormatError(ValueError, UnpackException):
+    """Invalid msgpack format"""
+
+
+class StackError(ValueError, UnpackException):
+    """Too nested"""
+
+
+# Deprecated.  Use ValueError instead
+UnpackValueError = ValueError
+
+
+class ExtraData(UnpackValueError):
+    """ExtraData is raised when there is trailing data.
+
+    This exception is raised while only one-shot (not streaming)
+    unpack.
+    """
+
+    def __init__(self, unpacked, extra):
+        self.unpacked = unpacked
+        self.extra = extra
+
+    def __str__(self):
+        return "unpack(b) received extra data."
+
+
+# Deprecated.  Use Exception instead to catch all exception during packing.
+PackException = Exception
+PackValueError = ValueError
+PackOverflowError = OverflowError
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/ext.py b/venv/Lib/site-packages/pip/_vendor/msgpack/ext.py
new file mode 100644
index 000000000..8341c68b8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/msgpack/ext.py
@@ -0,0 +1,191 @@
+# coding: utf-8
+from collections import namedtuple
+import datetime
+import sys
+import struct
+
+
+PY2 = sys.version_info[0] == 2
+
+if PY2:
+    int_types = (int, long)
+    _utc = None
+else:
+    int_types = int
+    try:
+        _utc = datetime.timezone.utc
+    except AttributeError:
+        _utc = datetime.timezone(datetime.timedelta(0))
+
+
+class ExtType(namedtuple("ExtType", "code data")):
+    """ExtType represents ext type in msgpack."""
+
+    def __new__(cls, code, data):
+        if not isinstance(code, int):
+            raise TypeError("code must be int")
+        if not isinstance(data, bytes):
+            raise TypeError("data must be bytes")
+        if not 0 <= code <= 127:
+            raise ValueError("code must be 0~127")
+        return super(ExtType, cls).__new__(cls, code, data)
+
+
+class Timestamp(object):
+    """Timestamp represents the Timestamp extension type in msgpack.
+
+    When built with Cython, msgpack uses C methods to pack and unpack `Timestamp`. When using pure-Python
+    msgpack, :func:`to_bytes` and :func:`from_bytes` are used to pack and unpack `Timestamp`.
+
+    This class is immutable: Do not override seconds and nanoseconds.
+    """
+
+    __slots__ = ["seconds", "nanoseconds"]
+
+    def __init__(self, seconds, nanoseconds=0):
+        """Initialize a Timestamp object.
+
+        :param int seconds:
+            Number of seconds since the UNIX epoch (00:00:00 UTC Jan 1 1970, minus leap seconds).
+            May be negative.
+
+        :param int nanoseconds:
+            Number of nanoseconds to add to `seconds` to get fractional time.
+            Maximum is 999_999_999.  Default is 0.
+
+        Note: Negative times (before the UNIX epoch) are represented as negative seconds + positive ns.
+        """
+        if not isinstance(seconds, int_types):
+            raise TypeError("seconds must be an interger")
+        if not isinstance(nanoseconds, int_types):
+            raise TypeError("nanoseconds must be an integer")
+        if not (0 <= nanoseconds < 10 ** 9):
+            raise ValueError(
+                "nanoseconds must be a non-negative integer less than 999999999."
+            )
+        self.seconds = seconds
+        self.nanoseconds = nanoseconds
+
+    def __repr__(self):
+        """String representation of Timestamp."""
+        return "Timestamp(seconds={0}, nanoseconds={1})".format(
+            self.seconds, self.nanoseconds
+        )
+
+    def __eq__(self, other):
+        """Check for equality with another Timestamp object"""
+        if type(other) is self.__class__:
+            return (
+                self.seconds == other.seconds and self.nanoseconds == other.nanoseconds
+            )
+        return False
+
+    def __ne__(self, other):
+        """not-equals method (see :func:`__eq__()`)"""
+        return not self.__eq__(other)
+
+    def __hash__(self):
+        return hash((self.seconds, self.nanoseconds))
+
+    @staticmethod
+    def from_bytes(b):
+        """Unpack bytes into a `Timestamp` object.
+
+        Used for pure-Python msgpack unpacking.
+
+        :param b: Payload from msgpack ext message with code -1
+        :type b: bytes
+
+        :returns: Timestamp object unpacked from msgpack ext payload
+        :rtype: Timestamp
+        """
+        if len(b) == 4:
+            seconds = struct.unpack("!L", b)[0]
+            nanoseconds = 0
+        elif len(b) == 8:
+            data64 = struct.unpack("!Q", b)[0]
+            seconds = data64 & 0x00000003FFFFFFFF
+            nanoseconds = data64 >> 34
+        elif len(b) == 12:
+            nanoseconds, seconds = struct.unpack("!Iq", b)
+        else:
+            raise ValueError(
+                "Timestamp type can only be created from 32, 64, or 96-bit byte objects"
+            )
+        return Timestamp(seconds, nanoseconds)
+
+    def to_bytes(self):
+        """Pack this Timestamp object into bytes.
+
+        Used for pure-Python msgpack packing.
+
+        :returns data: Payload for EXT message with code -1 (timestamp type)
+        :rtype: bytes
+        """
+        if (self.seconds >> 34) == 0:  # seconds is non-negative and fits in 34 bits
+            data64 = self.nanoseconds << 34 | self.seconds
+            if data64 & 0xFFFFFFFF00000000 == 0:
+                # nanoseconds is zero and seconds < 2**32, so timestamp 32
+                data = struct.pack("!L", data64)
+            else:
+                # timestamp 64
+                data = struct.pack("!Q", data64)
+        else:
+            # timestamp 96
+            data = struct.pack("!Iq", self.nanoseconds, self.seconds)
+        return data
+
+    @staticmethod
+    def from_unix(unix_sec):
+        """Create a Timestamp from posix timestamp in seconds.
+
+        :param unix_float: Posix timestamp in seconds.
+        :type unix_float: int or float.
+        """
+        seconds = int(unix_sec // 1)
+        nanoseconds = int((unix_sec % 1) * 10 ** 9)
+        return Timestamp(seconds, nanoseconds)
+
+    def to_unix(self):
+        """Get the timestamp as a floating-point value.
+
+        :returns: posix timestamp
+        :rtype: float
+        """
+        return self.seconds + self.nanoseconds / 1e9
+
+    @staticmethod
+    def from_unix_nano(unix_ns):
+        """Create a Timestamp from posix timestamp in nanoseconds.
+
+        :param int unix_ns: Posix timestamp in nanoseconds.
+        :rtype: Timestamp
+        """
+        return Timestamp(*divmod(unix_ns, 10 ** 9))
+
+    def to_unix_nano(self):
+        """Get the timestamp as a unixtime in nanoseconds.
+
+        :returns: posix timestamp in nanoseconds
+        :rtype: int
+        """
+        return self.seconds * 10 ** 9 + self.nanoseconds
+
+    def to_datetime(self):
+        """Get the timestamp as a UTC datetime.
+
+        Python 2 is not supported.
+
+        :rtype: datetime.
+        """
+        return datetime.datetime.fromtimestamp(self.to_unix(), _utc)
+
+    @staticmethod
+    def from_datetime(dt):
+        """Create a Timestamp from datetime with tzinfo.
+
+        Python 2 is not supported.
+
+        :rtype: Timestamp
+        """
+        return Timestamp.from_unix(dt.timestamp())
diff --git a/venv/Lib/site-packages/pip/_vendor/msgpack/fallback.py b/venv/Lib/site-packages/pip/_vendor/msgpack/fallback.py
new file mode 100644
index 000000000..9f6665b3e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/msgpack/fallback.py
@@ -0,0 +1,1063 @@
+"""Fallback pure Python implementation of msgpack"""
+
+from datetime import datetime as _DateTime
+import sys
+import struct
+
+
+PY2 = sys.version_info[0] == 2
+if PY2:
+    int_types = (int, long)
+
+    def dict_iteritems(d):
+        return d.iteritems()
+
+
+else:
+    int_types = int
+    unicode = str
+    xrange = range
+
+    def dict_iteritems(d):
+        return d.items()
+
+
+if sys.version_info < (3, 5):
+    # Ugly hack...
+    RecursionError = RuntimeError
+
+    def _is_recursionerror(e):
+        return (
+            len(e.args) == 1
+            and isinstance(e.args[0], str)
+            and e.args[0].startswith("maximum recursion depth exceeded")
+        )
+
+
+else:
+
+    def _is_recursionerror(e):
+        return True
+
+
+if hasattr(sys, "pypy_version_info"):
+    # StringIO is slow on PyPy, StringIO is faster.  However: PyPy's own
+    # StringBuilder is fastest.
+    from __pypy__ import newlist_hint
+
+    try:
+        from __pypy__.builders import BytesBuilder as StringBuilder
+    except ImportError:
+        from __pypy__.builders import StringBuilder
+    USING_STRINGBUILDER = True
+
+    class StringIO(object):
+        def __init__(self, s=b""):
+            if s:
+                self.builder = StringBuilder(len(s))
+                self.builder.append(s)
+            else:
+                self.builder = StringBuilder()
+
+        def write(self, s):
+            if isinstance(s, memoryview):
+                s = s.tobytes()
+            elif isinstance(s, bytearray):
+                s = bytes(s)
+            self.builder.append(s)
+
+        def getvalue(self):
+            return self.builder.build()
+
+
+else:
+    USING_STRINGBUILDER = False
+    from io import BytesIO as StringIO
+
+    newlist_hint = lambda size: []
+
+
+from .exceptions import BufferFull, OutOfData, ExtraData, FormatError, StackError
+
+from .ext import ExtType, Timestamp
+
+
+EX_SKIP = 0
+EX_CONSTRUCT = 1
+EX_READ_ARRAY_HEADER = 2
+EX_READ_MAP_HEADER = 3
+
+TYPE_IMMEDIATE = 0
+TYPE_ARRAY = 1
+TYPE_MAP = 2
+TYPE_RAW = 3
+TYPE_BIN = 4
+TYPE_EXT = 5
+
+DEFAULT_RECURSE_LIMIT = 511
+
+
+def _check_type_strict(obj, t, type=type, tuple=tuple):
+    if type(t) is tuple:
+        return type(obj) in t
+    else:
+        return type(obj) is t
+
+
+def _get_data_from_buffer(obj):
+    view = memoryview(obj)
+    if view.itemsize != 1:
+        raise ValueError("cannot unpack from multi-byte object")
+    return view
+
+
+def unpackb(packed, **kwargs):
+    """
+    Unpack an object from `packed`.
+
+    Raises ``ExtraData`` when *packed* contains extra bytes.
+    Raises ``ValueError`` when *packed* is incomplete.
+    Raises ``FormatError`` when *packed* is not valid msgpack.
+    Raises ``StackError`` when *packed* contains too nested.
+    Other exceptions can be raised during unpacking.
+
+    See :class:`Unpacker` for options.
+    """
+    unpacker = Unpacker(None, max_buffer_size=len(packed), **kwargs)
+    unpacker.feed(packed)
+    try:
+        ret = unpacker._unpack()
+    except OutOfData:
+        raise ValueError("Unpack failed: incomplete input")
+    except RecursionError as e:
+        if _is_recursionerror(e):
+            raise StackError
+        raise
+    if unpacker._got_extradata():
+        raise ExtraData(ret, unpacker._get_extradata())
+    return ret
+
+
+if sys.version_info < (2, 7, 6):
+
+    def _unpack_from(f, b, o=0):
+        """Explicit type cast for legacy struct.unpack_from"""
+        return struct.unpack_from(f, bytes(b), o)
+
+
+else:
+    _unpack_from = struct.unpack_from
+
+
+class Unpacker(object):
+    """Streaming unpacker.
+
+    Arguments:
+
+    :param file_like:
+        File-like object having `.read(n)` method.
+        If specified, unpacker reads serialized data from it and :meth:`feed()` is not usable.
+
+    :param int read_size:
+        Used as `file_like.read(read_size)`. (default: `min(16*1024, max_buffer_size)`)
+
+    :param bool use_list:
+        If true, unpack msgpack array to Python list.
+        Otherwise, unpack to Python tuple. (default: True)
+
+    :param bool raw:
+        If true, unpack msgpack raw to Python bytes.
+        Otherwise, unpack to Python str by decoding with UTF-8 encoding (default).
+
+    :param int timestamp:
+        Control how timestamp type is unpacked:
+
+            0 - Timestamp
+            1 - float  (Seconds from the EPOCH)
+            2 - int  (Nanoseconds from the EPOCH)
+            3 - datetime.datetime  (UTC).  Python 2 is not supported.
+
+    :param bool strict_map_key:
+        If true (default), only str or bytes are accepted for map (dict) keys.
+
+    :param callable object_hook:
+        When specified, it should be callable.
+        Unpacker calls it with a dict argument after unpacking msgpack map.
+        (See also simplejson)
+
+    :param callable object_pairs_hook:
+        When specified, it should be callable.
+        Unpacker calls it with a list of key-value pairs after unpacking msgpack map.
+        (See also simplejson)
+
+    :param str unicode_errors:
+        The error handler for decoding unicode. (default: 'strict')
+        This option should be used only when you have msgpack data which
+        contains invalid UTF-8 string.
+
+    :param int max_buffer_size:
+        Limits size of data waiting unpacked.  0 means 2**32-1.
+        The default value is 100*1024*1024 (100MiB).
+        Raises `BufferFull` exception when it is insufficient.
+        You should set this parameter when unpacking data from untrusted source.
+
+    :param int max_str_len:
+        Deprecated, use *max_buffer_size* instead.
+        Limits max length of str. (default: max_buffer_size)
+
+    :param int max_bin_len:
+        Deprecated, use *max_buffer_size* instead.
+        Limits max length of bin. (default: max_buffer_size)
+
+    :param int max_array_len:
+        Limits max length of array.
+        (default: max_buffer_size)
+
+    :param int max_map_len:
+        Limits max length of map.
+        (default: max_buffer_size//2)
+
+    :param int max_ext_len:
+        Deprecated, use *max_buffer_size* instead.
+        Limits max size of ext type.  (default: max_buffer_size)
+
+    Example of streaming deserialize from file-like object::
+
+        unpacker = Unpacker(file_like)
+        for o in unpacker:
+            process(o)
+
+    Example of streaming deserialize from socket::
+
+        unpacker = Unpacker(max_buffer_size)
+        while True:
+            buf = sock.recv(1024**2)
+            if not buf:
+                break
+            unpacker.feed(buf)
+            for o in unpacker:
+                process(o)
+
+    Raises ``ExtraData`` when *packed* contains extra bytes.
+    Raises ``OutOfData`` when *packed* is incomplete.
+    Raises ``FormatError`` when *packed* is not valid msgpack.
+    Raises ``StackError`` when *packed* contains too nested.
+    Other exceptions can be raised during unpacking.
+    """
+
+    def __init__(
+        self,
+        file_like=None,
+        read_size=0,
+        use_list=True,
+        raw=False,
+        timestamp=0,
+        strict_map_key=True,
+        object_hook=None,
+        object_pairs_hook=None,
+        list_hook=None,
+        unicode_errors=None,
+        max_buffer_size=100 * 1024 * 1024,
+        ext_hook=ExtType,
+        max_str_len=-1,
+        max_bin_len=-1,
+        max_array_len=-1,
+        max_map_len=-1,
+        max_ext_len=-1,
+    ):
+        if unicode_errors is None:
+            unicode_errors = "strict"
+
+        if file_like is None:
+            self._feeding = True
+        else:
+            if not callable(file_like.read):
+                raise TypeError("`file_like.read` must be callable")
+            self.file_like = file_like
+            self._feeding = False
+
+        #: array of bytes fed.
+        self._buffer = bytearray()
+        #: Which position we currently reads
+        self._buff_i = 0
+
+        # When Unpacker is used as an iterable, between the calls to next(),
+        # the buffer is not "consumed" completely, for efficiency sake.
+        # Instead, it is done sloppily.  To make sure we raise BufferFull at
+        # the correct moments, we have to keep track of how sloppy we were.
+        # Furthermore, when the buffer is incomplete (that is: in the case
+        # we raise an OutOfData) we need to rollback the buffer to the correct
+        # state, which _buf_checkpoint records.
+        self._buf_checkpoint = 0
+
+        if not max_buffer_size:
+            max_buffer_size = 2 ** 31 - 1
+        if max_str_len == -1:
+            max_str_len = max_buffer_size
+        if max_bin_len == -1:
+            max_bin_len = max_buffer_size
+        if max_array_len == -1:
+            max_array_len = max_buffer_size
+        if max_map_len == -1:
+            max_map_len = max_buffer_size // 2
+        if max_ext_len == -1:
+            max_ext_len = max_buffer_size
+
+        self._max_buffer_size = max_buffer_size
+        if read_size > self._max_buffer_size:
+            raise ValueError("read_size must be smaller than max_buffer_size")
+        self._read_size = read_size or min(self._max_buffer_size, 16 * 1024)
+        self._raw = bool(raw)
+        self._strict_map_key = bool(strict_map_key)
+        self._unicode_errors = unicode_errors
+        self._use_list = use_list
+        if not (0 <= timestamp <= 3):
+            raise ValueError("timestamp must be 0..3")
+        self._timestamp = timestamp
+        self._list_hook = list_hook
+        self._object_hook = object_hook
+        self._object_pairs_hook = object_pairs_hook
+        self._ext_hook = ext_hook
+        self._max_str_len = max_str_len
+        self._max_bin_len = max_bin_len
+        self._max_array_len = max_array_len
+        self._max_map_len = max_map_len
+        self._max_ext_len = max_ext_len
+        self._stream_offset = 0
+
+        if list_hook is not None and not callable(list_hook):
+            raise TypeError("`list_hook` is not callable")
+        if object_hook is not None and not callable(object_hook):
+            raise TypeError("`object_hook` is not callable")
+        if object_pairs_hook is not None and not callable(object_pairs_hook):
+            raise TypeError("`object_pairs_hook` is not callable")
+        if object_hook is not None and object_pairs_hook is not None:
+            raise TypeError(
+                "object_pairs_hook and object_hook are mutually " "exclusive"
+            )
+        if not callable(ext_hook):
+            raise TypeError("`ext_hook` is not callable")
+
+    def feed(self, next_bytes):
+        assert self._feeding
+        view = _get_data_from_buffer(next_bytes)
+        if len(self._buffer) - self._buff_i + len(view) > self._max_buffer_size:
+            raise BufferFull
+
+        # Strip buffer before checkpoint before reading file.
+        if self._buf_checkpoint > 0:
+            del self._buffer[: self._buf_checkpoint]
+            self._buff_i -= self._buf_checkpoint
+            self._buf_checkpoint = 0
+
+        # Use extend here: INPLACE_ADD += doesn't reliably typecast memoryview in jython
+        self._buffer.extend(view)
+
+    def _consume(self):
+        """ Gets rid of the used parts of the buffer. """
+        self._stream_offset += self._buff_i - self._buf_checkpoint
+        self._buf_checkpoint = self._buff_i
+
+    def _got_extradata(self):
+        return self._buff_i < len(self._buffer)
+
+    def _get_extradata(self):
+        return self._buffer[self._buff_i :]
+
+    def read_bytes(self, n):
+        ret = self._read(n)
+        self._consume()
+        return ret
+
+    def _read(self, n):
+        # (int) -> bytearray
+        self._reserve(n)
+        i = self._buff_i
+        self._buff_i = i + n
+        return self._buffer[i : i + n]
+
+    def _reserve(self, n):
+        remain_bytes = len(self._buffer) - self._buff_i - n
+
+        # Fast path: buffer has n bytes already
+        if remain_bytes >= 0:
+            return
+
+        if self._feeding:
+            self._buff_i = self._buf_checkpoint
+            raise OutOfData
+
+        # Strip buffer before checkpoint before reading file.
+        if self._buf_checkpoint > 0:
+            del self._buffer[: self._buf_checkpoint]
+            self._buff_i -= self._buf_checkpoint
+            self._buf_checkpoint = 0
+
+        # Read from file
+        remain_bytes = -remain_bytes
+        while remain_bytes > 0:
+            to_read_bytes = max(self._read_size, remain_bytes)
+            read_data = self.file_like.read(to_read_bytes)
+            if not read_data:
+                break
+            assert isinstance(read_data, bytes)
+            self._buffer += read_data
+            remain_bytes -= len(read_data)
+
+        if len(self._buffer) < n + self._buff_i:
+            self._buff_i = 0  # rollback
+            raise OutOfData
+
+    def _read_header(self, execute=EX_CONSTRUCT):
+        typ = TYPE_IMMEDIATE
+        n = 0
+        obj = None
+        self._reserve(1)
+        b = self._buffer[self._buff_i]
+        self._buff_i += 1
+        if b & 0b10000000 == 0:
+            obj = b
+        elif b & 0b11100000 == 0b11100000:
+            obj = -1 - (b ^ 0xFF)
+        elif b & 0b11100000 == 0b10100000:
+            n = b & 0b00011111
+            typ = TYPE_RAW
+            if n > self._max_str_len:
+                raise ValueError("%s exceeds max_str_len(%s)", n, self._max_str_len)
+            obj = self._read(n)
+        elif b & 0b11110000 == 0b10010000:
+            n = b & 0b00001111
+            typ = TYPE_ARRAY
+            if n > self._max_array_len:
+                raise ValueError("%s exceeds max_array_len(%s)", n, self._max_array_len)
+        elif b & 0b11110000 == 0b10000000:
+            n = b & 0b00001111
+            typ = TYPE_MAP
+            if n > self._max_map_len:
+                raise ValueError("%s exceeds max_map_len(%s)", n, self._max_map_len)
+        elif b == 0xC0:
+            obj = None
+        elif b == 0xC2:
+            obj = False
+        elif b == 0xC3:
+            obj = True
+        elif b == 0xC4:
+            typ = TYPE_BIN
+            self._reserve(1)
+            n = self._buffer[self._buff_i]
+            self._buff_i += 1
+            if n > self._max_bin_len:
+                raise ValueError("%s exceeds max_bin_len(%s)" % (n, self._max_bin_len))
+            obj = self._read(n)
+        elif b == 0xC5:
+            typ = TYPE_BIN
+            self._reserve(2)
+            n = _unpack_from(">H", self._buffer, self._buff_i)[0]
+            self._buff_i += 2
+            if n > self._max_bin_len:
+                raise ValueError("%s exceeds max_bin_len(%s)" % (n, self._max_bin_len))
+            obj = self._read(n)
+        elif b == 0xC6:
+            typ = TYPE_BIN
+            self._reserve(4)
+            n = _unpack_from(">I", self._buffer, self._buff_i)[0]
+            self._buff_i += 4
+            if n > self._max_bin_len:
+                raise ValueError("%s exceeds max_bin_len(%s)" % (n, self._max_bin_len))
+            obj = self._read(n)
+        elif b == 0xC7:  # ext 8
+            typ = TYPE_EXT
+            self._reserve(2)
+            L, n = _unpack_from("Bb", self._buffer, self._buff_i)
+            self._buff_i += 2
+            if L > self._max_ext_len:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (L, self._max_ext_len))
+            obj = self._read(L)
+        elif b == 0xC8:  # ext 16
+            typ = TYPE_EXT
+            self._reserve(3)
+            L, n = _unpack_from(">Hb", self._buffer, self._buff_i)
+            self._buff_i += 3
+            if L > self._max_ext_len:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (L, self._max_ext_len))
+            obj = self._read(L)
+        elif b == 0xC9:  # ext 32
+            typ = TYPE_EXT
+            self._reserve(5)
+            L, n = _unpack_from(">Ib", self._buffer, self._buff_i)
+            self._buff_i += 5
+            if L > self._max_ext_len:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (L, self._max_ext_len))
+            obj = self._read(L)
+        elif b == 0xCA:
+            self._reserve(4)
+            obj = _unpack_from(">f", self._buffer, self._buff_i)[0]
+            self._buff_i += 4
+        elif b == 0xCB:
+            self._reserve(8)
+            obj = _unpack_from(">d", self._buffer, self._buff_i)[0]
+            self._buff_i += 8
+        elif b == 0xCC:
+            self._reserve(1)
+            obj = self._buffer[self._buff_i]
+            self._buff_i += 1
+        elif b == 0xCD:
+            self._reserve(2)
+            obj = _unpack_from(">H", self._buffer, self._buff_i)[0]
+            self._buff_i += 2
+        elif b == 0xCE:
+            self._reserve(4)
+            obj = _unpack_from(">I", self._buffer, self._buff_i)[0]
+            self._buff_i += 4
+        elif b == 0xCF:
+            self._reserve(8)
+            obj = _unpack_from(">Q", self._buffer, self._buff_i)[0]
+            self._buff_i += 8
+        elif b == 0xD0:
+            self._reserve(1)
+            obj = _unpack_from("b", self._buffer, self._buff_i)[0]
+            self._buff_i += 1
+        elif b == 0xD1:
+            self._reserve(2)
+            obj = _unpack_from(">h", self._buffer, self._buff_i)[0]
+            self._buff_i += 2
+        elif b == 0xD2:
+            self._reserve(4)
+            obj = _unpack_from(">i", self._buffer, self._buff_i)[0]
+            self._buff_i += 4
+        elif b == 0xD3:
+            self._reserve(8)
+            obj = _unpack_from(">q", self._buffer, self._buff_i)[0]
+            self._buff_i += 8
+        elif b == 0xD4:  # fixext 1
+            typ = TYPE_EXT
+            if self._max_ext_len < 1:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (1, self._max_ext_len))
+            self._reserve(2)
+            n, obj = _unpack_from("b1s", self._buffer, self._buff_i)
+            self._buff_i += 2
+        elif b == 0xD5:  # fixext 2
+            typ = TYPE_EXT
+            if self._max_ext_len < 2:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (2, self._max_ext_len))
+            self._reserve(3)
+            n, obj = _unpack_from("b2s", self._buffer, self._buff_i)
+            self._buff_i += 3
+        elif b == 0xD6:  # fixext 4
+            typ = TYPE_EXT
+            if self._max_ext_len < 4:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (4, self._max_ext_len))
+            self._reserve(5)
+            n, obj = _unpack_from("b4s", self._buffer, self._buff_i)
+            self._buff_i += 5
+        elif b == 0xD7:  # fixext 8
+            typ = TYPE_EXT
+            if self._max_ext_len < 8:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (8, self._max_ext_len))
+            self._reserve(9)
+            n, obj = _unpack_from("b8s", self._buffer, self._buff_i)
+            self._buff_i += 9
+        elif b == 0xD8:  # fixext 16
+            typ = TYPE_EXT
+            if self._max_ext_len < 16:
+                raise ValueError("%s exceeds max_ext_len(%s)" % (16, self._max_ext_len))
+            self._reserve(17)
+            n, obj = _unpack_from("b16s", self._buffer, self._buff_i)
+            self._buff_i += 17
+        elif b == 0xD9:
+            typ = TYPE_RAW
+            self._reserve(1)
+            n = self._buffer[self._buff_i]
+            self._buff_i += 1
+            if n > self._max_str_len:
+                raise ValueError("%s exceeds max_str_len(%s)", n, self._max_str_len)
+            obj = self._read(n)
+        elif b == 0xDA:
+            typ = TYPE_RAW
+            self._reserve(2)
+            (n,) = _unpack_from(">H", self._buffer, self._buff_i)
+            self._buff_i += 2
+            if n > self._max_str_len:
+                raise ValueError("%s exceeds max_str_len(%s)", n, self._max_str_len)
+            obj = self._read(n)
+        elif b == 0xDB:
+            typ = TYPE_RAW
+            self._reserve(4)
+            (n,) = _unpack_from(">I", self._buffer, self._buff_i)
+            self._buff_i += 4
+            if n > self._max_str_len:
+                raise ValueError("%s exceeds max_str_len(%s)", n, self._max_str_len)
+            obj = self._read(n)
+        elif b == 0xDC:
+            typ = TYPE_ARRAY
+            self._reserve(2)
+            (n,) = _unpack_from(">H", self._buffer, self._buff_i)
+            self._buff_i += 2
+            if n > self._max_array_len:
+                raise ValueError("%s exceeds max_array_len(%s)", n, self._max_array_len)
+        elif b == 0xDD:
+            typ = TYPE_ARRAY
+            self._reserve(4)
+            (n,) = _unpack_from(">I", self._buffer, self._buff_i)
+            self._buff_i += 4
+            if n > self._max_array_len:
+                raise ValueError("%s exceeds max_array_len(%s)", n, self._max_array_len)
+        elif b == 0xDE:
+            self._reserve(2)
+            (n,) = _unpack_from(">H", self._buffer, self._buff_i)
+            self._buff_i += 2
+            if n > self._max_map_len:
+                raise ValueError("%s exceeds max_map_len(%s)", n, self._max_map_len)
+            typ = TYPE_MAP
+        elif b == 0xDF:
+            self._reserve(4)
+            (n,) = _unpack_from(">I", self._buffer, self._buff_i)
+            self._buff_i += 4
+            if n > self._max_map_len:
+                raise ValueError("%s exceeds max_map_len(%s)", n, self._max_map_len)
+            typ = TYPE_MAP
+        else:
+            raise FormatError("Unknown header: 0x%x" % b)
+        return typ, n, obj
+
+    def _unpack(self, execute=EX_CONSTRUCT):
+        typ, n, obj = self._read_header(execute)
+
+        if execute == EX_READ_ARRAY_HEADER:
+            if typ != TYPE_ARRAY:
+                raise ValueError("Expected array")
+            return n
+        if execute == EX_READ_MAP_HEADER:
+            if typ != TYPE_MAP:
+                raise ValueError("Expected map")
+            return n
+        # TODO should we eliminate the recursion?
+        if typ == TYPE_ARRAY:
+            if execute == EX_SKIP:
+                for i in xrange(n):
+                    # TODO check whether we need to call `list_hook`
+                    self._unpack(EX_SKIP)
+                return
+            ret = newlist_hint(n)
+            for i in xrange(n):
+                ret.append(self._unpack(EX_CONSTRUCT))
+            if self._list_hook is not None:
+                ret = self._list_hook(ret)
+            # TODO is the interaction between `list_hook` and `use_list` ok?
+            return ret if self._use_list else tuple(ret)
+        if typ == TYPE_MAP:
+            if execute == EX_SKIP:
+                for i in xrange(n):
+                    # TODO check whether we need to call hooks
+                    self._unpack(EX_SKIP)
+                    self._unpack(EX_SKIP)
+                return
+            if self._object_pairs_hook is not None:
+                ret = self._object_pairs_hook(
+                    (self._unpack(EX_CONSTRUCT), self._unpack(EX_CONSTRUCT))
+                    for _ in xrange(n)
+                )
+            else:
+                ret = {}
+                for _ in xrange(n):
+                    key = self._unpack(EX_CONSTRUCT)
+                    if self._strict_map_key and type(key) not in (unicode, bytes):
+                        raise ValueError(
+                            "%s is not allowed for map key" % str(type(key))
+                        )
+                    if not PY2 and type(key) is str:
+                        key = sys.intern(key)
+                    ret[key] = self._unpack(EX_CONSTRUCT)
+                if self._object_hook is not None:
+                    ret = self._object_hook(ret)
+            return ret
+        if execute == EX_SKIP:
+            return
+        if typ == TYPE_RAW:
+            if self._raw:
+                obj = bytes(obj)
+            else:
+                obj = obj.decode("utf_8", self._unicode_errors)
+            return obj
+        if typ == TYPE_BIN:
+            return bytes(obj)
+        if typ == TYPE_EXT:
+            if n == -1:  # timestamp
+                ts = Timestamp.from_bytes(bytes(obj))
+                if self._timestamp == 1:
+                    return ts.to_unix()
+                elif self._timestamp == 2:
+                    return ts.to_unix_nano()
+                elif self._timestamp == 3:
+                    return ts.to_datetime()
+                else:
+                    return ts
+            else:
+                return self._ext_hook(n, bytes(obj))
+        assert typ == TYPE_IMMEDIATE
+        return obj
+
+    def __iter__(self):
+        return self
+
+    def __next__(self):
+        try:
+            ret = self._unpack(EX_CONSTRUCT)
+            self._consume()
+            return ret
+        except OutOfData:
+            self._consume()
+            raise StopIteration
+        except RecursionError:
+            raise StackError
+
+    next = __next__
+
+    def skip(self):
+        self._unpack(EX_SKIP)
+        self._consume()
+
+    def unpack(self):
+        try:
+            ret = self._unpack(EX_CONSTRUCT)
+        except RecursionError:
+            raise StackError
+        self._consume()
+        return ret
+
+    def read_array_header(self):
+        ret = self._unpack(EX_READ_ARRAY_HEADER)
+        self._consume()
+        return ret
+
+    def read_map_header(self):
+        ret = self._unpack(EX_READ_MAP_HEADER)
+        self._consume()
+        return ret
+
+    def tell(self):
+        return self._stream_offset
+
+
+class Packer(object):
+    """
+    MessagePack Packer
+
+    Usage:
+
+        packer = Packer()
+        astream.write(packer.pack(a))
+        astream.write(packer.pack(b))
+
+    Packer's constructor has some keyword arguments:
+
+    :param callable default:
+        Convert user type to builtin type that Packer supports.
+        See also simplejson's document.
+
+    :param bool use_single_float:
+        Use single precision float type for float. (default: False)
+
+    :param bool autoreset:
+        Reset buffer after each pack and return its content as `bytes`. (default: True).
+        If set this to false, use `bytes()` to get content and `.reset()` to clear buffer.
+
+    :param bool use_bin_type:
+        Use bin type introduced in msgpack spec 2.0 for bytes.
+        It also enables str8 type for unicode. (default: True)
+
+    :param bool strict_types:
+        If set to true, types will be checked to be exact. Derived classes
+        from serializable types will not be serialized and will be
+        treated as unsupported type and forwarded to default.
+        Additionally tuples will not be serialized as lists.
+        This is useful when trying to implement accurate serialization
+        for python types.
+
+    :param bool datetime:
+        If set to true, datetime with tzinfo is packed into Timestamp type.
+        Note that the tzinfo is stripped in the timestamp.
+        You can get UTC datetime with `timestamp=3` option of the Unpacker.
+        (Python 2 is not supported).
+
+    :param str unicode_errors:
+        The error handler for encoding unicode. (default: 'strict')
+        DO NOT USE THIS!!  This option is kept for very specific usage.
+    """
+
+    def __init__(
+        self,
+        default=None,
+        use_single_float=False,
+        autoreset=True,
+        use_bin_type=True,
+        strict_types=False,
+        datetime=False,
+        unicode_errors=None,
+    ):
+        self._strict_types = strict_types
+        self._use_float = use_single_float
+        self._autoreset = autoreset
+        self._use_bin_type = use_bin_type
+        self._buffer = StringIO()
+        if PY2 and datetime:
+            raise ValueError("datetime is not supported in Python 2")
+        self._datetime = bool(datetime)
+        self._unicode_errors = unicode_errors or "strict"
+        if default is not None:
+            if not callable(default):
+                raise TypeError("default must be callable")
+        self._default = default
+
+    def _pack(
+        self,
+        obj,
+        nest_limit=DEFAULT_RECURSE_LIMIT,
+        check=isinstance,
+        check_type_strict=_check_type_strict,
+    ):
+        default_used = False
+        if self._strict_types:
+            check = check_type_strict
+            list_types = list
+        else:
+            list_types = (list, tuple)
+        while True:
+            if nest_limit < 0:
+                raise ValueError("recursion limit exceeded")
+            if obj is None:
+                return self._buffer.write(b"\xc0")
+            if check(obj, bool):
+                if obj:
+                    return self._buffer.write(b"\xc3")
+                return self._buffer.write(b"\xc2")
+            if check(obj, int_types):
+                if 0 <= obj < 0x80:
+                    return self._buffer.write(struct.pack("B", obj))
+                if -0x20 <= obj < 0:
+                    return self._buffer.write(struct.pack("b", obj))
+                if 0x80 <= obj <= 0xFF:
+                    return self._buffer.write(struct.pack("BB", 0xCC, obj))
+                if -0x80 <= obj < 0:
+                    return self._buffer.write(struct.pack(">Bb", 0xD0, obj))
+                if 0xFF < obj <= 0xFFFF:
+                    return self._buffer.write(struct.pack(">BH", 0xCD, obj))
+                if -0x8000 <= obj < -0x80:
+                    return self._buffer.write(struct.pack(">Bh", 0xD1, obj))
+                if 0xFFFF < obj <= 0xFFFFFFFF:
+                    return self._buffer.write(struct.pack(">BI", 0xCE, obj))
+                if -0x80000000 <= obj < -0x8000:
+                    return self._buffer.write(struct.pack(">Bi", 0xD2, obj))
+                if 0xFFFFFFFF < obj <= 0xFFFFFFFFFFFFFFFF:
+                    return self._buffer.write(struct.pack(">BQ", 0xCF, obj))
+                if -0x8000000000000000 <= obj < -0x80000000:
+                    return self._buffer.write(struct.pack(">Bq", 0xD3, obj))
+                if not default_used and self._default is not None:
+                    obj = self._default(obj)
+                    default_used = True
+                    continue
+                raise OverflowError("Integer value out of range")
+            if check(obj, (bytes, bytearray)):
+                n = len(obj)
+                if n >= 2 ** 32:
+                    raise ValueError("%s is too large" % type(obj).__name__)
+                self._pack_bin_header(n)
+                return self._buffer.write(obj)
+            if check(obj, unicode):
+                obj = obj.encode("utf-8", self._unicode_errors)
+                n = len(obj)
+                if n >= 2 ** 32:
+                    raise ValueError("String is too large")
+                self._pack_raw_header(n)
+                return self._buffer.write(obj)
+            if check(obj, memoryview):
+                n = len(obj) * obj.itemsize
+                if n >= 2 ** 32:
+                    raise ValueError("Memoryview is too large")
+                self._pack_bin_header(n)
+                return self._buffer.write(obj)
+            if check(obj, float):
+                if self._use_float:
+                    return self._buffer.write(struct.pack(">Bf", 0xCA, obj))
+                return self._buffer.write(struct.pack(">Bd", 0xCB, obj))
+            if check(obj, (ExtType, Timestamp)):
+                if check(obj, Timestamp):
+                    code = -1
+                    data = obj.to_bytes()
+                else:
+                    code = obj.code
+                    data = obj.data
+                assert isinstance(code, int)
+                assert isinstance(data, bytes)
+                L = len(data)
+                if L == 1:
+                    self._buffer.write(b"\xd4")
+                elif L == 2:
+                    self._buffer.write(b"\xd5")
+                elif L == 4:
+                    self._buffer.write(b"\xd6")
+                elif L == 8:
+                    self._buffer.write(b"\xd7")
+                elif L == 16:
+                    self._buffer.write(b"\xd8")
+                elif L <= 0xFF:
+                    self._buffer.write(struct.pack(">BB", 0xC7, L))
+                elif L <= 0xFFFF:
+                    self._buffer.write(struct.pack(">BH", 0xC8, L))
+                else:
+                    self._buffer.write(struct.pack(">BI", 0xC9, L))
+                self._buffer.write(struct.pack("b", code))
+                self._buffer.write(data)
+                return
+            if check(obj, list_types):
+                n = len(obj)
+                self._pack_array_header(n)
+                for i in xrange(n):
+                    self._pack(obj[i], nest_limit - 1)
+                return
+            if check(obj, dict):
+                return self._pack_map_pairs(
+                    len(obj), dict_iteritems(obj), nest_limit - 1
+                )
+
+            if self._datetime and check(obj, _DateTime):
+                obj = Timestamp.from_datetime(obj)
+                default_used = 1
+                continue
+
+            if not default_used and self._default is not None:
+                obj = self._default(obj)
+                default_used = 1
+                continue
+            raise TypeError("Cannot serialize %r" % (obj,))
+
+    def pack(self, obj):
+        try:
+            self._pack(obj)
+        except:
+            self._buffer = StringIO()  # force reset
+            raise
+        if self._autoreset:
+            ret = self._buffer.getvalue()
+            self._buffer = StringIO()
+            return ret
+
+    def pack_map_pairs(self, pairs):
+        self._pack_map_pairs(len(pairs), pairs)
+        if self._autoreset:
+            ret = self._buffer.getvalue()
+            self._buffer = StringIO()
+            return ret
+
+    def pack_array_header(self, n):
+        if n >= 2 ** 32:
+            raise ValueError
+        self._pack_array_header(n)
+        if self._autoreset:
+            ret = self._buffer.getvalue()
+            self._buffer = StringIO()
+            return ret
+
+    def pack_map_header(self, n):
+        if n >= 2 ** 32:
+            raise ValueError
+        self._pack_map_header(n)
+        if self._autoreset:
+            ret = self._buffer.getvalue()
+            self._buffer = StringIO()
+            return ret
+
+    def pack_ext_type(self, typecode, data):
+        if not isinstance(typecode, int):
+            raise TypeError("typecode must have int type.")
+        if not 0 <= typecode <= 127:
+            raise ValueError("typecode should be 0-127")
+        if not isinstance(data, bytes):
+            raise TypeError("data must have bytes type")
+        L = len(data)
+        if L > 0xFFFFFFFF:
+            raise ValueError("Too large data")
+        if L == 1:
+            self._buffer.write(b"\xd4")
+        elif L == 2:
+            self._buffer.write(b"\xd5")
+        elif L == 4:
+            self._buffer.write(b"\xd6")
+        elif L == 8:
+            self._buffer.write(b"\xd7")
+        elif L == 16:
+            self._buffer.write(b"\xd8")
+        elif L <= 0xFF:
+            self._buffer.write(b"\xc7" + struct.pack("B", L))
+        elif L <= 0xFFFF:
+            self._buffer.write(b"\xc8" + struct.pack(">H", L))
+        else:
+            self._buffer.write(b"\xc9" + struct.pack(">I", L))
+        self._buffer.write(struct.pack("B", typecode))
+        self._buffer.write(data)
+
+    def _pack_array_header(self, n):
+        if n <= 0x0F:
+            return self._buffer.write(struct.pack("B", 0x90 + n))
+        if n <= 0xFFFF:
+            return self._buffer.write(struct.pack(">BH", 0xDC, n))
+        if n <= 0xFFFFFFFF:
+            return self._buffer.write(struct.pack(">BI", 0xDD, n))
+        raise ValueError("Array is too large")
+
+    def _pack_map_header(self, n):
+        if n <= 0x0F:
+            return self._buffer.write(struct.pack("B", 0x80 + n))
+        if n <= 0xFFFF:
+            return self._buffer.write(struct.pack(">BH", 0xDE, n))
+        if n <= 0xFFFFFFFF:
+            return self._buffer.write(struct.pack(">BI", 0xDF, n))
+        raise ValueError("Dict is too large")
+
+    def _pack_map_pairs(self, n, pairs, nest_limit=DEFAULT_RECURSE_LIMIT):
+        self._pack_map_header(n)
+        for (k, v) in pairs:
+            self._pack(k, nest_limit - 1)
+            self._pack(v, nest_limit - 1)
+
+    def _pack_raw_header(self, n):
+        if n <= 0x1F:
+            self._buffer.write(struct.pack("B", 0xA0 + n))
+        elif self._use_bin_type and n <= 0xFF:
+            self._buffer.write(struct.pack(">BB", 0xD9, n))
+        elif n <= 0xFFFF:
+            self._buffer.write(struct.pack(">BH", 0xDA, n))
+        elif n <= 0xFFFFFFFF:
+            self._buffer.write(struct.pack(">BI", 0xDB, n))
+        else:
+            raise ValueError("Raw is too large")
+
+    def _pack_bin_header(self, n):
+        if not self._use_bin_type:
+            return self._pack_raw_header(n)
+        elif n <= 0xFF:
+            return self._buffer.write(struct.pack(">BB", 0xC4, n))
+        elif n <= 0xFFFF:
+            return self._buffer.write(struct.pack(">BH", 0xC5, n))
+        elif n <= 0xFFFFFFFF:
+            return self._buffer.write(struct.pack(">BI", 0xC6, n))
+        else:
+            raise ValueError("Bin is too large")
+
+    def bytes(self):
+        """Return internal buffer contents as bytes object"""
+        return self._buffer.getvalue()
+
+    def reset(self):
+        """Reset internal buffer.
+
+        This method is useful only when autoreset=False.
+        """
+        self._buffer = StringIO()
+
+    def getbuffer(self):
+        """Return view of internal buffer."""
+        if USING_STRINGBUILDER or PY2:
+            return memoryview(self.bytes())
+        else:
+            return self._buffer.getbuffer()
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__about__.py b/venv/Lib/site-packages/pip/_vendor/packaging/__about__.py
new file mode 100644
index 000000000..4d998578d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/__about__.py
@@ -0,0 +1,27 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
+
+__title__ = "packaging"
+__summary__ = "Core utilities for Python packages"
+__uri__ = "https://github.com/pypa/packaging"
+
+__version__ = "20.4"
+
+__author__ = "Donald Stufft and individual contributors"
+__email__ = "donald@stufft.io"
+
+__license__ = "BSD-2-Clause or Apache-2.0"
+__copyright__ = "Copyright 2014-2019 %s" % __author__
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__init__.py b/venv/Lib/site-packages/pip/_vendor/packaging/__init__.py
new file mode 100644
index 000000000..a0cf67df5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/__init__.py
@@ -0,0 +1,26 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+from .__about__ import (
+    __author__,
+    __copyright__,
+    __email__,
+    __license__,
+    __summary__,
+    __title__,
+    __uri__,
+    __version__,
+)
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc
new file mode 100644
index 000000000..78016cc26
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__about__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..b3f0120a3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc
new file mode 100644
index 000000000..4743d507f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc
new file mode 100644
index 000000000..c6cf10522
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_structures.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_typing.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_typing.cpython-36.pyc
new file mode 100644
index 000000000..eee45d720
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/_typing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc
new file mode 100644
index 000000000..6704ed3df
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/markers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc
new file mode 100644
index 000000000..96b014f1e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/requirements.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc
new file mode 100644
index 000000000..722062925
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/tags.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/tags.cpython-36.pyc
new file mode 100644
index 000000000..8c82ca186
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/tags.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..5c02badfd
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..29de12eb9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/packaging/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/_compat.py b/venv/Lib/site-packages/pip/_vendor/packaging/_compat.py
new file mode 100644
index 000000000..e54bd4ede
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/_compat.py
@@ -0,0 +1,38 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import sys
+
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Dict, Tuple, Type
+
+
+PY2 = sys.version_info[0] == 2
+PY3 = sys.version_info[0] == 3
+
+# flake8: noqa
+
+if PY3:
+    string_types = (str,)
+else:
+    string_types = (basestring,)
+
+
+def with_metaclass(meta, *bases):
+    # type: (Type[Any], Tuple[Type[Any], ...]) -> Any
+    """
+    Create a base class with a metaclass.
+    """
+    # This requires a bit of explanation: the basic idea is to make a dummy
+    # metaclass for one level of class instantiation that replaces itself with
+    # the actual metaclass.
+    class metaclass(meta):  # type: ignore
+        def __new__(cls, name, this_bases, d):
+            # type: (Type[Any], str, Tuple[Any], Dict[Any, Any]) -> Any
+            return meta(name, bases, d)
+
+    return type.__new__(metaclass, "temporary_class", (), {})
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/_structures.py b/venv/Lib/site-packages/pip/_vendor/packaging/_structures.py
new file mode 100644
index 000000000..800d5c558
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/_structures.py
@@ -0,0 +1,86 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+
+class InfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __neg__(self):
+        # type: (object) -> NegativeInfinityType
+        return NegativeInfinity
+
+
+Infinity = InfinityType()
+
+
+class NegativeInfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "-Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __neg__(self):
+        # type: (object) -> InfinityType
+        return Infinity
+
+
+NegativeInfinity = NegativeInfinityType()
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/_typing.py b/venv/Lib/site-packages/pip/_vendor/packaging/_typing.py
new file mode 100644
index 000000000..2846133bd
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/_typing.py
@@ -0,0 +1,48 @@
+"""For neatly implementing static typing in packaging.
+
+`mypy` - the static type analysis tool we use - uses the `typing` module, which
+provides core functionality fundamental to mypy's functioning.
+
+Generally, `typing` would be imported at runtime and used in that fashion -
+it acts as a no-op at runtime and does not have any run-time overhead by
+design.
+
+As it turns out, `typing` is not vendorable - it uses separate sources for
+Python 2/Python 3. Thus, this codebase can not expect it to be present.
+To work around this, mypy allows the typing import to be behind a False-y
+optional to prevent it from running at runtime and type-comments can be used
+to remove the need for the types to be accessible directly during runtime.
+
+This module provides the False-y guard in a nicely named fashion so that a
+curious maintainer can reach here to read this.
+
+In packaging, all static-typing related imports should be guarded as follows:
+
+    from pip._vendor.packaging._typing import TYPE_CHECKING
+
+    if TYPE_CHECKING:
+        from typing import ...
+
+Ref: https://github.com/python/mypy/issues/3216
+"""
+
+__all__ = ["TYPE_CHECKING", "cast"]
+
+# The TYPE_CHECKING constant defined by the typing module is False at runtime
+# but True while type checking.
+if False:  # pragma: no cover
+    from typing import TYPE_CHECKING
+else:
+    TYPE_CHECKING = False
+
+# typing's cast syntax requires calling typing.cast at runtime, but we don't
+# want to import typing at runtime. Here, we inform the type checkers that
+# we're importing `typing.cast` as `cast` and re-implement typing.cast's
+# runtime behavior in a block that is ignored by type checkers.
+if TYPE_CHECKING:  # pragma: no cover
+    # not executed at runtime
+    from typing import cast
+else:
+    # executed at runtime
+    def cast(type_, value):  # noqa
+        return value
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/markers.py b/venv/Lib/site-packages/pip/_vendor/packaging/markers.py
new file mode 100644
index 000000000..ed642b01f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/markers.py
@@ -0,0 +1,328 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import operator
+import os
+import platform
+import sys
+
+from pip._vendor.pyparsing import ParseException, ParseResults, stringStart, stringEnd
+from pip._vendor.pyparsing import ZeroOrMore, Group, Forward, QuotedString
+from pip._vendor.pyparsing import Literal as L  # noqa
+
+from ._compat import string_types
+from ._typing import TYPE_CHECKING
+from .specifiers import Specifier, InvalidSpecifier
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Callable, Dict, List, Optional, Tuple, Union
+
+    Operator = Callable[[str, str], bool]
+
+
+__all__ = [
+    "InvalidMarker",
+    "UndefinedComparison",
+    "UndefinedEnvironmentName",
+    "Marker",
+    "default_environment",
+]
+
+
+class InvalidMarker(ValueError):
+    """
+    An invalid marker was found, users should refer to PEP 508.
+    """
+
+
+class UndefinedComparison(ValueError):
+    """
+    An invalid operation was attempted on a value that doesn't support it.
+    """
+
+
+class UndefinedEnvironmentName(ValueError):
+    """
+    A name was attempted to be used that does not exist inside of the
+    environment.
+    """
+
+
+class Node(object):
+    def __init__(self, value):
+        # type: (Any) -> None
+        self.value = value
+
+    def __str__(self):
+        # type: () -> str
+        return str(self.value)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{0}({1!r})>".format(self.__class__.__name__, str(self))
+
+    def serialize(self):
+        # type: () -> str
+        raise NotImplementedError
+
+
+class Variable(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+class Value(Node):
+    def serialize(self):
+        # type: () -> str
+        return '"{0}"'.format(self)
+
+
+class Op(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+VARIABLE = (
+    L("implementation_version")
+    | L("platform_python_implementation")
+    | L("implementation_name")
+    | L("python_full_version")
+    | L("platform_release")
+    | L("platform_version")
+    | L("platform_machine")
+    | L("platform_system")
+    | L("python_version")
+    | L("sys_platform")
+    | L("os_name")
+    | L("os.name")  # PEP-345
+    | L("sys.platform")  # PEP-345
+    | L("platform.version")  # PEP-345
+    | L("platform.machine")  # PEP-345
+    | L("platform.python_implementation")  # PEP-345
+    | L("python_implementation")  # undocumented setuptools legacy
+    | L("extra")  # PEP-508
+)
+ALIASES = {
+    "os.name": "os_name",
+    "sys.platform": "sys_platform",
+    "platform.version": "platform_version",
+    "platform.machine": "platform_machine",
+    "platform.python_implementation": "platform_python_implementation",
+    "python_implementation": "platform_python_implementation",
+}
+VARIABLE.setParseAction(lambda s, l, t: Variable(ALIASES.get(t[0], t[0])))
+
+VERSION_CMP = (
+    L("===") | L("==") | L(">=") | L("<=") | L("!=") | L("~=") | L(">") | L("<")
+)
+
+MARKER_OP = VERSION_CMP | L("not in") | L("in")
+MARKER_OP.setParseAction(lambda s, l, t: Op(t[0]))
+
+MARKER_VALUE = QuotedString("'") | QuotedString('"')
+MARKER_VALUE.setParseAction(lambda s, l, t: Value(t[0]))
+
+BOOLOP = L("and") | L("or")
+
+MARKER_VAR = VARIABLE | MARKER_VALUE
+
+MARKER_ITEM = Group(MARKER_VAR + MARKER_OP + MARKER_VAR)
+MARKER_ITEM.setParseAction(lambda s, l, t: tuple(t[0]))
+
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+
+MARKER_EXPR = Forward()
+MARKER_ATOM = MARKER_ITEM | Group(LPAREN + MARKER_EXPR + RPAREN)
+MARKER_EXPR << MARKER_ATOM + ZeroOrMore(BOOLOP + MARKER_EXPR)
+
+MARKER = stringStart + MARKER_EXPR + stringEnd
+
+
+def _coerce_parse_result(results):
+    # type: (Union[ParseResults, List[Any]]) -> List[Any]
+    if isinstance(results, ParseResults):
+        return [_coerce_parse_result(i) for i in results]
+    else:
+        return results
+
+
+def _format_marker(marker, first=True):
+    # type: (Union[List[str], Tuple[Node, ...], str], Optional[bool]) -> str
+
+    assert isinstance(marker, (list, tuple, string_types))
+
+    # Sometimes we have a structure like [[...]] which is a single item list
+    # where the single item is itself it's own list. In that case we want skip
+    # the rest of this function so that we don't get extraneous () on the
+    # outside.
+    if (
+        isinstance(marker, list)
+        and len(marker) == 1
+        and isinstance(marker[0], (list, tuple))
+    ):
+        return _format_marker(marker[0])
+
+    if isinstance(marker, list):
+        inner = (_format_marker(m, first=False) for m in marker)
+        if first:
+            return " ".join(inner)
+        else:
+            return "(" + " ".join(inner) + ")"
+    elif isinstance(marker, tuple):
+        return " ".join([m.serialize() for m in marker])
+    else:
+        return marker
+
+
+_operators = {
+    "in": lambda lhs, rhs: lhs in rhs,
+    "not in": lambda lhs, rhs: lhs not in rhs,
+    "<": operator.lt,
+    "<=": operator.le,
+    "==": operator.eq,
+    "!=": operator.ne,
+    ">=": operator.ge,
+    ">": operator.gt,
+}  # type: Dict[str, Operator]
+
+
+def _eval_op(lhs, op, rhs):
+    # type: (str, Op, str) -> bool
+    try:
+        spec = Specifier("".join([op.serialize(), rhs]))
+    except InvalidSpecifier:
+        pass
+    else:
+        return spec.contains(lhs)
+
+    oper = _operators.get(op.serialize())  # type: Optional[Operator]
+    if oper is None:
+        raise UndefinedComparison(
+            "Undefined {0!r} on {1!r} and {2!r}.".format(op, lhs, rhs)
+        )
+
+    return oper(lhs, rhs)
+
+
+class Undefined(object):
+    pass
+
+
+_undefined = Undefined()
+
+
+def _get_env(environment, name):
+    # type: (Dict[str, str], str) -> str
+    value = environment.get(name, _undefined)  # type: Union[str, Undefined]
+
+    if isinstance(value, Undefined):
+        raise UndefinedEnvironmentName(
+            "{0!r} does not exist in evaluation environment.".format(name)
+        )
+
+    return value
+
+
+def _evaluate_markers(markers, environment):
+    # type: (List[Any], Dict[str, str]) -> bool
+    groups = [[]]  # type: List[List[bool]]
+
+    for marker in markers:
+        assert isinstance(marker, (list, tuple, string_types))
+
+        if isinstance(marker, list):
+            groups[-1].append(_evaluate_markers(marker, environment))
+        elif isinstance(marker, tuple):
+            lhs, op, rhs = marker
+
+            if isinstance(lhs, Variable):
+                lhs_value = _get_env(environment, lhs.value)
+                rhs_value = rhs.value
+            else:
+                lhs_value = lhs.value
+                rhs_value = _get_env(environment, rhs.value)
+
+            groups[-1].append(_eval_op(lhs_value, op, rhs_value))
+        else:
+            assert marker in ["and", "or"]
+            if marker == "or":
+                groups.append([])
+
+    return any(all(item) for item in groups)
+
+
+def format_full_version(info):
+    # type: (sys._version_info) -> str
+    version = "{0.major}.{0.minor}.{0.micro}".format(info)
+    kind = info.releaselevel
+    if kind != "final":
+        version += kind[0] + str(info.serial)
+    return version
+
+
+def default_environment():
+    # type: () -> Dict[str, str]
+    if hasattr(sys, "implementation"):
+        # Ignoring the `sys.implementation` reference for type checking due to
+        # mypy not liking that the attribute doesn't exist in Python 2.7 when
+        # run with the `--py27` flag.
+        iver = format_full_version(sys.implementation.version)  # type: ignore
+        implementation_name = sys.implementation.name  # type: ignore
+    else:
+        iver = "0"
+        implementation_name = ""
+
+    return {
+        "implementation_name": implementation_name,
+        "implementation_version": iver,
+        "os_name": os.name,
+        "platform_machine": platform.machine(),
+        "platform_release": platform.release(),
+        "platform_system": platform.system(),
+        "platform_version": platform.version(),
+        "python_full_version": platform.python_version(),
+        "platform_python_implementation": platform.python_implementation(),
+        "python_version": ".".join(platform.python_version_tuple()[:2]),
+        "sys_platform": sys.platform,
+    }
+
+
+class Marker(object):
+    def __init__(self, marker):
+        # type: (str) -> None
+        try:
+            self._markers = _coerce_parse_result(MARKER.parseString(marker))
+        except ParseException as e:
+            err_str = "Invalid marker: {0!r}, parse error at {1!r}".format(
+                marker, marker[e.loc : e.loc + 8]
+            )
+            raise InvalidMarker(err_str)
+
+    def __str__(self):
+        # type: () -> str
+        return _format_marker(self._markers)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Marker({0!r})>".format(str(self))
+
+    def evaluate(self, environment=None):
+        # type: (Optional[Dict[str, str]]) -> bool
+        """Evaluate a marker.
+
+        Return the boolean from evaluating the given marker against the
+        environment. environment is an optional argument to override all or
+        part of the determined environment.
+
+        The environment is determined from the current Python process.
+        """
+        current_environment = default_environment()
+        if environment is not None:
+            current_environment.update(environment)
+
+        return _evaluate_markers(self._markers, current_environment)
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/requirements.py b/venv/Lib/site-packages/pip/_vendor/packaging/requirements.py
new file mode 100644
index 000000000..5e64101c4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/requirements.py
@@ -0,0 +1,145 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import string
+import re
+
+from pip._vendor.pyparsing import stringStart, stringEnd, originalTextFor, ParseException
+from pip._vendor.pyparsing import ZeroOrMore, Word, Optional, Regex, Combine
+from pip._vendor.pyparsing import Literal as L  # noqa
+from pip._vendor.six.moves.urllib import parse as urlparse
+
+from ._typing import TYPE_CHECKING
+from .markers import MARKER_EXPR, Marker
+from .specifiers import LegacySpecifier, Specifier, SpecifierSet
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import List
+
+
+class InvalidRequirement(ValueError):
+    """
+    An invalid requirement was found, users should refer to PEP 508.
+    """
+
+
+ALPHANUM = Word(string.ascii_letters + string.digits)
+
+LBRACKET = L("[").suppress()
+RBRACKET = L("]").suppress()
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+COMMA = L(",").suppress()
+SEMICOLON = L(";").suppress()
+AT = L("@").suppress()
+
+PUNCTUATION = Word("-_.")
+IDENTIFIER_END = ALPHANUM | (ZeroOrMore(PUNCTUATION) + ALPHANUM)
+IDENTIFIER = Combine(ALPHANUM + ZeroOrMore(IDENTIFIER_END))
+
+NAME = IDENTIFIER("name")
+EXTRA = IDENTIFIER
+
+URI = Regex(r"[^ ]+")("url")
+URL = AT + URI
+
+EXTRAS_LIST = EXTRA + ZeroOrMore(COMMA + EXTRA)
+EXTRAS = (LBRACKET + Optional(EXTRAS_LIST) + RBRACKET)("extras")
+
+VERSION_PEP440 = Regex(Specifier._regex_str, re.VERBOSE | re.IGNORECASE)
+VERSION_LEGACY = Regex(LegacySpecifier._regex_str, re.VERBOSE | re.IGNORECASE)
+
+VERSION_ONE = VERSION_PEP440 ^ VERSION_LEGACY
+VERSION_MANY = Combine(
+    VERSION_ONE + ZeroOrMore(COMMA + VERSION_ONE), joinString=",", adjacent=False
+)("_raw_spec")
+_VERSION_SPEC = Optional(((LPAREN + VERSION_MANY + RPAREN) | VERSION_MANY))
+_VERSION_SPEC.setParseAction(lambda s, l, t: t._raw_spec or "")
+
+VERSION_SPEC = originalTextFor(_VERSION_SPEC)("specifier")
+VERSION_SPEC.setParseAction(lambda s, l, t: t[1])
+
+MARKER_EXPR = originalTextFor(MARKER_EXPR())("marker")
+MARKER_EXPR.setParseAction(
+    lambda s, l, t: Marker(s[t._original_start : t._original_end])
+)
+MARKER_SEPARATOR = SEMICOLON
+MARKER = MARKER_SEPARATOR + MARKER_EXPR
+
+VERSION_AND_MARKER = VERSION_SPEC + Optional(MARKER)
+URL_AND_MARKER = URL + Optional(MARKER)
+
+NAMED_REQUIREMENT = NAME + Optional(EXTRAS) + (URL_AND_MARKER | VERSION_AND_MARKER)
+
+REQUIREMENT = stringStart + NAMED_REQUIREMENT + stringEnd
+# pyparsing isn't thread safe during initialization, so we do it eagerly, see
+# issue #104
+REQUIREMENT.parseString("x[]")
+
+
+class Requirement(object):
+    """Parse a requirement.
+
+    Parse a given requirement string into its parts, such as name, specifier,
+    URL, and extras. Raises InvalidRequirement on a badly-formed requirement
+    string.
+    """
+
+    # TODO: Can we test whether something is contained within a requirement?
+    #       If so how do we do that? Do we need to test against the _name_ of
+    #       the thing as well as the version? What about the markers?
+    # TODO: Can we normalize the name and extra name?
+
+    def __init__(self, requirement_string):
+        # type: (str) -> None
+        try:
+            req = REQUIREMENT.parseString(requirement_string)
+        except ParseException as e:
+            raise InvalidRequirement(
+                'Parse error at "{0!r}": {1}'.format(
+                    requirement_string[e.loc : e.loc + 8], e.msg
+                )
+            )
+
+        self.name = req.name
+        if req.url:
+            parsed_url = urlparse.urlparse(req.url)
+            if parsed_url.scheme == "file":
+                if urlparse.urlunparse(parsed_url) != req.url:
+                    raise InvalidRequirement("Invalid URL given")
+            elif not (parsed_url.scheme and parsed_url.netloc) or (
+                not parsed_url.scheme and not parsed_url.netloc
+            ):
+                raise InvalidRequirement("Invalid URL: {0}".format(req.url))
+            self.url = req.url
+        else:
+            self.url = None
+        self.extras = set(req.extras.asList() if req.extras else [])
+        self.specifier = SpecifierSet(req.specifier)
+        self.marker = req.marker if req.marker else None
+
+    def __str__(self):
+        # type: () -> str
+        parts = [self.name]  # type: List[str]
+
+        if self.extras:
+            parts.append("[{0}]".format(",".join(sorted(self.extras))))
+
+        if self.specifier:
+            parts.append(str(self.specifier))
+
+        if self.url:
+            parts.append("@ {0}".format(self.url))
+            if self.marker:
+                parts.append(" ")
+
+        if self.marker:
+            parts.append("; {0}".format(self.marker))
+
+        return "".join(parts)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Requirement({0!r})>".format(str(self))
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/specifiers.py b/venv/Lib/site-packages/pip/_vendor/packaging/specifiers.py
new file mode 100644
index 000000000..fe09bb1db
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/specifiers.py
@@ -0,0 +1,863 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import abc
+import functools
+import itertools
+import re
+
+from ._compat import string_types, with_metaclass
+from ._typing import TYPE_CHECKING
+from .utils import canonicalize_version
+from .version import Version, LegacyVersion, parse
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        List,
+        Dict,
+        Union,
+        Iterable,
+        Iterator,
+        Optional,
+        Callable,
+        Tuple,
+        FrozenSet,
+    )
+
+    ParsedVersion = Union[Version, LegacyVersion]
+    UnparsedVersion = Union[Version, LegacyVersion, str]
+    CallableOperator = Callable[[ParsedVersion, str], bool]
+
+
+class InvalidSpecifier(ValueError):
+    """
+    An invalid specifier was found, users should refer to PEP 440.
+    """
+
+
+class BaseSpecifier(with_metaclass(abc.ABCMeta, object)):  # type: ignore
+    @abc.abstractmethod
+    def __str__(self):
+        # type: () -> str
+        """
+        Returns the str representation of this Specifier like object. This
+        should be representative of the Specifier itself.
+        """
+
+    @abc.abstractmethod
+    def __hash__(self):
+        # type: () -> int
+        """
+        Returns a hash value for this Specifier like object.
+        """
+
+    @abc.abstractmethod
+    def __eq__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are equal.
+        """
+
+    @abc.abstractmethod
+    def __ne__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are not equal.
+        """
+
+    @abc.abstractproperty
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        """
+        Returns whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        """
+        Sets whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @abc.abstractmethod
+    def contains(self, item, prereleases=None):
+        # type: (str, Optional[bool]) -> bool
+        """
+        Determines if the given item is contained within this specifier.
+        """
+
+    @abc.abstractmethod
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+        """
+        Takes an iterable of items and filters them so that only items which
+        are contained within this specifier are allowed in it.
+        """
+
+
+class _IndividualSpecifier(BaseSpecifier):
+
+    _operators = {}  # type: Dict[str, str]
+
+    def __init__(self, spec="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+        match = self._regex.search(spec)
+        if not match:
+            raise InvalidSpecifier("Invalid specifier: '{0}'".format(spec))
+
+        self._spec = (
+            match.group("operator").strip(),
+            match.group("version").strip(),
+        )  # type: Tuple[str, str]
+
+        # Store whether or not this Specifier should accept prereleases
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<{0}({1!r}{2})>".format(self.__class__.__name__, str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return "{0}{1}".format(*self._spec)
+
+    @property
+    def _canonical_spec(self):
+        # type: () -> Tuple[str, Union[Version, str]]
+        return self._spec[0], canonicalize_version(self._spec[1])
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._canonical_spec)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._canonical_spec == other._canonical_spec
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._spec != other._spec
+
+    def _get_operator(self, op):
+        # type: (str) -> CallableOperator
+        operator_callable = getattr(
+            self, "_compare_{0}".format(self._operators[op])
+        )  # type: CallableOperator
+        return operator_callable
+
+    def _coerce_version(self, version):
+        # type: (UnparsedVersion) -> ParsedVersion
+        if not isinstance(version, (LegacyVersion, Version)):
+            version = parse(version)
+        return version
+
+    @property
+    def operator(self):
+        # type: () -> str
+        return self._spec[0]
+
+    @property
+    def version(self):
+        # type: () -> str
+        return self._spec[1]
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        return self._prereleases
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (str) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (UnparsedVersion, Optional[bool]) -> bool
+
+        # Determine if prereleases are to be allowed or not.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # Normalize item to a Version or LegacyVersion, this allows us to have
+        # a shortcut for ``"2.0" in Specifier(">=2")
+        normalized_item = self._coerce_version(item)
+
+        # Determine if we should be supporting prereleases in this specifier
+        # or not, if we do not support prereleases than we can short circuit
+        # logic if this version is a prereleases.
+        if normalized_item.is_prerelease and not prereleases:
+            return False
+
+        # Actually do the comparison to determine if this item is contained
+        # within this Specifier or not.
+        operator_callable = self._get_operator(self.operator)  # type: CallableOperator
+        return operator_callable(normalized_item, self.version)
+
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+
+        yielded = False
+        found_prereleases = []
+
+        kw = {"prereleases": prereleases if prereleases is not None else True}
+
+        # Attempt to iterate over all the values in the iterable and if any of
+        # them match, yield them.
+        for version in iterable:
+            parsed_version = self._coerce_version(version)
+
+            if self.contains(parsed_version, **kw):
+                # If our version is a prerelease, and we were not set to allow
+                # prereleases, then we'll store it for later incase nothing
+                # else matches this specifier.
+                if parsed_version.is_prerelease and not (
+                    prereleases or self.prereleases
+                ):
+                    found_prereleases.append(version)
+                # Either this is not a prerelease, or we should have been
+                # accepting prereleases from the beginning.
+                else:
+                    yielded = True
+                    yield version
+
+        # Now that we've iterated over everything, determine if we've yielded
+        # any values, and if we have not and we have any prereleases stored up
+        # then we will go ahead and yield the prereleases.
+        if not yielded and found_prereleases:
+            for version in found_prereleases:
+                yield version
+
+
+class LegacySpecifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(==|!=|<=|>=|<|>))
+        \s*
+        (?P<version>
+            [^,;\s)]* # Since this is a "legacy" specifier, and the version
+                      # string can be just about anything, we match everything
+                      # except for whitespace, a semi-colon for marker support,
+                      # a closing paren since versions can be enclosed in
+                      # them, and a comma since it's a version separator.
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+    }
+
+    def _coerce_version(self, version):
+        # type: (Union[ParsedVersion, str]) -> LegacyVersion
+        if not isinstance(version, LegacyVersion):
+            version = LegacyVersion(str(version))
+        return version
+
+    def _compare_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective == self._coerce_version(spec)
+
+    def _compare_not_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective != self._coerce_version(spec)
+
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective <= self._coerce_version(spec)
+
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective >= self._coerce_version(spec)
+
+    def _compare_less_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective < self._coerce_version(spec)
+
+    def _compare_greater_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective > self._coerce_version(spec)
+
+
+def _require_version_compare(
+    fn  # type: (Callable[[Specifier, ParsedVersion, str], bool])
+):
+    # type: (...) -> Callable[[Specifier, ParsedVersion, str], bool]
+    @functools.wraps(fn)
+    def wrapped(self, prospective, spec):
+        # type: (Specifier, ParsedVersion, str) -> bool
+        if not isinstance(prospective, Version):
+            return False
+        return fn(self, prospective, spec)
+
+    return wrapped
+
+
+class Specifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(~=|==|!=|<=|>=|<|>|===))
+        (?P<version>
+            (?:
+                # The identity operators allow for an escape hatch that will
+                # do an exact string match of the version you wish to install.
+                # This will not be parsed by PEP 440 and we cannot determine
+                # any semantic meaning from it. This operator is discouraged
+                # but included entirely as an escape hatch.
+                (?<====)  # Only match for the identity operator
+                \s*
+                [^\s]*    # We just match everything, except for whitespace
+                          # since we are only testing for strict identity.
+            )
+            |
+            (?:
+                # The (non)equality operators allow for wild card and local
+                # versions to be specified so we have to define these two
+                # operators separately to enable that.
+                (?<===|!=)            # Only match for equals and not equals
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+
+                # You cannot use a wild card and a dev or local version
+                # together so group them with a | and make them optional.
+                (?:
+                    (?:[-_\.]?dev[-_\.]?[0-9]*)?         # dev release
+                    (?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
+                    |
+                    \.\*  # Wild card syntax of .*
+                )?
+            )
+            |
+            (?:
+                # The compatible operator requires at least two digits in the
+                # release segment.
+                (?<=~=)               # Only match for the compatible operator
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)+   # release  (We have a + instead of a *)
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+            |
+            (?:
+                # All other operators only allow a sub set of what the
+                # (non)equality operators do. Specifically they do not allow
+                # local versions to be specified nor do they allow the prefix
+                # matching wild cards.
+                (?<!==|!=|~=)         # We have special cases for these
+                                      # operators so we want to make sure they
+                                      # don't match here.
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "~=": "compatible",
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+        "===": "arbitrary",
+    }
+
+    @_require_version_compare
+    def _compare_compatible(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # Compatible releases have an equivalent combination of >= and ==. That
+        # is that ~=2.2 is equivalent to >=2.2,==2.*. This allows us to
+        # implement this in terms of the other specifiers instead of
+        # implementing it ourselves. The only thing we need to do is construct
+        # the other specifiers.
+
+        # We want everything but the last item in the version, but we want to
+        # ignore post and dev releases and we want to treat the pre-release as
+        # it's own separate segment.
+        prefix = ".".join(
+            list(
+                itertools.takewhile(
+                    lambda x: (not x.startswith("post") and not x.startswith("dev")),
+                    _version_split(spec),
+                )
+            )[:-1]
+        )
+
+        # Add the prefix notation to the end of our string
+        prefix += ".*"
+
+        return self._get_operator(">=")(prospective, spec) and self._get_operator("==")(
+            prospective, prefix
+        )
+
+    @_require_version_compare
+    def _compare_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # We need special logic to handle prefix matching
+        if spec.endswith(".*"):
+            # In the case of prefix matching we want to ignore local segment.
+            prospective = Version(prospective.public)
+            # Split the spec out by dots, and pretend that there is an implicit
+            # dot in between a release segment and a pre-release segment.
+            split_spec = _version_split(spec[:-2])  # Remove the trailing .*
+
+            # Split the prospective version out by dots, and pretend that there
+            # is an implicit dot in between a release segment and a pre-release
+            # segment.
+            split_prospective = _version_split(str(prospective))
+
+            # Shorten the prospective version to be the same length as the spec
+            # so that we can determine if the specifier is a prefix of the
+            # prospective version or not.
+            shortened_prospective = split_prospective[: len(split_spec)]
+
+            # Pad out our two sides with zeros so that they both equal the same
+            # length.
+            padded_spec, padded_prospective = _pad_version(
+                split_spec, shortened_prospective
+            )
+
+            return padded_prospective == padded_spec
+        else:
+            # Convert our spec string into a Version
+            spec_version = Version(spec)
+
+            # If the specifier does not have a local segment, then we want to
+            # act as if the prospective version also does not have a local
+            # segment.
+            if not spec_version.local:
+                prospective = Version(prospective.public)
+
+            return prospective == spec_version
+
+    @_require_version_compare
+    def _compare_not_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+        return not self._compare_equal(prospective, spec)
+
+    @_require_version_compare
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) <= Version(spec)
+
+    @_require_version_compare
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) >= Version(spec)
+
+    @_require_version_compare
+    def _compare_less_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is less than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective < spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a pre-release version, that we do not accept pre-release
+        # versions for the version mentioned in the specifier (e.g. <3.1 should
+        # not match 3.1.dev0, but should match 3.0.dev0).
+        if not spec.is_prerelease and prospective.is_prerelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # less than the spec version *and* it's not a pre-release of the same
+        # version in the spec.
+        return True
+
+    @_require_version_compare
+    def _compare_greater_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is greater than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective > spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a post-release version, that we do not accept
+        # post-release versions for the version mentioned in the specifier
+        # (e.g. >3.1 should not match 3.0.post0, but should match 3.2.post0).
+        if not spec.is_postrelease and prospective.is_postrelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # Ensure that we do not allow a local version of the version mentioned
+        # in the specifier, which is technically greater than, to match.
+        if prospective.local is not None:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # greater than the spec version *and* it's not a pre-release of the
+        # same version in the spec.
+        return True
+
+    def _compare_arbitrary(self, prospective, spec):
+        # type: (Version, str) -> bool
+        return str(prospective).lower() == str(spec).lower()
+
+    @property
+    def prereleases(self):
+        # type: () -> bool
+
+        # If there is an explicit prereleases set for this, then we'll just
+        # blindly use that.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # Look at all of our specifiers and determine if they are inclusive
+        # operators, and if they are if they are including an explicit
+        # prerelease.
+        operator, version = self._spec
+        if operator in ["==", ">=", "<=", "~=", "==="]:
+            # The == specifier can include a trailing .*, if it does we
+            # want to remove before parsing.
+            if operator == "==" and version.endswith(".*"):
+                version = version[:-2]
+
+            # Parse the version, and if it is a pre-release than this
+            # specifier allows pre-releases.
+            if parse(version).is_prerelease:
+                return True
+
+        return False
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+
+_prefix_regex = re.compile(r"^([0-9]+)((?:a|b|c|rc)[0-9]+)$")
+
+
+def _version_split(version):
+    # type: (str) -> List[str]
+    result = []  # type: List[str]
+    for item in version.split("."):
+        match = _prefix_regex.search(item)
+        if match:
+            result.extend(match.groups())
+        else:
+            result.append(item)
+    return result
+
+
+def _pad_version(left, right):
+    # type: (List[str], List[str]) -> Tuple[List[str], List[str]]
+    left_split, right_split = [], []
+
+    # Get the release segment of our versions
+    left_split.append(list(itertools.takewhile(lambda x: x.isdigit(), left)))
+    right_split.append(list(itertools.takewhile(lambda x: x.isdigit(), right)))
+
+    # Get the rest of our versions
+    left_split.append(left[len(left_split[0]) :])
+    right_split.append(right[len(right_split[0]) :])
+
+    # Insert our padding
+    left_split.insert(1, ["0"] * max(0, len(right_split[0]) - len(left_split[0])))
+    right_split.insert(1, ["0"] * max(0, len(left_split[0]) - len(right_split[0])))
+
+    return (list(itertools.chain(*left_split)), list(itertools.chain(*right_split)))
+
+
+class SpecifierSet(BaseSpecifier):
+    def __init__(self, specifiers="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+
+        # Split on , to break each individual specifier into it's own item, and
+        # strip each item to remove leading/trailing whitespace.
+        split_specifiers = [s.strip() for s in specifiers.split(",") if s.strip()]
+
+        # Parsed each individual specifier, attempting first to make it a
+        # Specifier and falling back to a LegacySpecifier.
+        parsed = set()
+        for specifier in split_specifiers:
+            try:
+                parsed.add(Specifier(specifier))
+            except InvalidSpecifier:
+                parsed.add(LegacySpecifier(specifier))
+
+        # Turn our parsed specifiers into a frozen set and save them for later.
+        self._specs = frozenset(parsed)
+
+        # Store our prereleases value so we can use it later to determine if
+        # we accept prereleases or not.
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<SpecifierSet({0!r}{1})>".format(str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return ",".join(sorted(str(s) for s in self._specs))
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._specs)
+
+    def __and__(self, other):
+        # type: (Union[SpecifierSet, str]) -> SpecifierSet
+        if isinstance(other, string_types):
+            other = SpecifierSet(other)
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        specifier = SpecifierSet()
+        specifier._specs = frozenset(self._specs | other._specs)
+
+        if self._prereleases is None and other._prereleases is not None:
+            specifier._prereleases = other._prereleases
+        elif self._prereleases is not None and other._prereleases is None:
+            specifier._prereleases = self._prereleases
+        elif self._prereleases == other._prereleases:
+            specifier._prereleases = self._prereleases
+        else:
+            raise ValueError(
+                "Cannot combine SpecifierSets with True and False prerelease "
+                "overrides."
+            )
+
+        return specifier
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs == other._specs
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs != other._specs
+
+    def __len__(self):
+        # type: () -> int
+        return len(self._specs)
+
+    def __iter__(self):
+        # type: () -> Iterator[FrozenSet[_IndividualSpecifier]]
+        return iter(self._specs)
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+
+        # If we have been given an explicit prerelease modifier, then we'll
+        # pass that through here.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # If we don't have any specifiers, and we don't have a forced value,
+        # then we'll just return None since we don't know if this should have
+        # pre-releases or not.
+        if not self._specs:
+            return None
+
+        # Otherwise we'll see if any of the given specifiers accept
+        # prereleases, if any of them do we'll return True, otherwise False.
+        return any(s.prereleases for s in self._specs)
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (Union[ParsedVersion, str]) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (Union[ParsedVersion, str], Optional[bool]) -> bool
+
+        # Ensure that our item is a Version or LegacyVersion instance.
+        if not isinstance(item, (LegacyVersion, Version)):
+            item = parse(item)
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # We can determine if we're going to allow pre-releases by looking to
+        # see if any of the underlying items supports them. If none of them do
+        # and this item is a pre-release then we do not allow it and we can
+        # short circuit that here.
+        # Note: This means that 1.0.dev1 would not be contained in something
+        #       like >=1.0.devabc however it would be in >=1.0.debabc,>0.0.dev0
+        if not prereleases and item.is_prerelease:
+            return False
+
+        # We simply dispatch to the underlying specs here to make sure that the
+        # given version is contained within all of them.
+        # Note: This use of all() here means that an empty set of specifiers
+        #       will always return True, this is an explicit design decision.
+        return all(s.contains(item, prereleases=prereleases) for s in self._specs)
+
+    def filter(
+        self,
+        iterable,  # type: Iterable[Union[ParsedVersion, str]]
+        prereleases=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> Iterable[Union[ParsedVersion, str]]
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # If we have any specifiers, then we want to wrap our iterable in the
+        # filter method for each one, this will act as a logical AND amongst
+        # each specifier.
+        if self._specs:
+            for spec in self._specs:
+                iterable = spec.filter(iterable, prereleases=bool(prereleases))
+            return iterable
+        # If we do not have any specifiers, then we need to have a rough filter
+        # which will filter out any pre-releases, unless there are no final
+        # releases, and which will filter out LegacyVersion in general.
+        else:
+            filtered = []  # type: List[Union[ParsedVersion, str]]
+            found_prereleases = []  # type: List[Union[ParsedVersion, str]]
+
+            for item in iterable:
+                # Ensure that we some kind of Version class for this item.
+                if not isinstance(item, (LegacyVersion, Version)):
+                    parsed_version = parse(item)
+                else:
+                    parsed_version = item
+
+                # Filter out any item which is parsed as a LegacyVersion
+                if isinstance(parsed_version, LegacyVersion):
+                    continue
+
+                # Store any item which is a pre-release for later unless we've
+                # already found a final version or we are accepting prereleases
+                if parsed_version.is_prerelease and not prereleases:
+                    if not filtered:
+                        found_prereleases.append(item)
+                else:
+                    filtered.append(item)
+
+            # If we've found no items except for pre-releases, then we'll go
+            # ahead and use the pre-releases
+            if not filtered and found_prereleases and prereleases is None:
+                return found_prereleases
+
+            return filtered
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/tags.py b/venv/Lib/site-packages/pip/_vendor/packaging/tags.py
new file mode 100644
index 000000000..9064910b8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/tags.py
@@ -0,0 +1,751 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+
+from __future__ import absolute_import
+
+import distutils.util
+
+try:
+    from importlib.machinery import EXTENSION_SUFFIXES
+except ImportError:  # pragma: no cover
+    import imp
+
+    EXTENSION_SUFFIXES = [x[0] for x in imp.get_suffixes()]
+    del imp
+import logging
+import os
+import platform
+import re
+import struct
+import sys
+import sysconfig
+import warnings
+
+from ._typing import TYPE_CHECKING, cast
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        Dict,
+        FrozenSet,
+        IO,
+        Iterable,
+        Iterator,
+        List,
+        Optional,
+        Sequence,
+        Tuple,
+        Union,
+    )
+
+    PythonVersion = Sequence[int]
+    MacVersion = Tuple[int, int]
+    GlibcVersion = Tuple[int, int]
+
+
+logger = logging.getLogger(__name__)
+
+INTERPRETER_SHORT_NAMES = {
+    "python": "py",  # Generic.
+    "cpython": "cp",
+    "pypy": "pp",
+    "ironpython": "ip",
+    "jython": "jy",
+}  # type: Dict[str, str]
+
+
+_32_BIT_INTERPRETER = sys.maxsize <= 2 ** 32
+
+
+class Tag(object):
+    """
+    A representation of the tag triple for a wheel.
+
+    Instances are considered immutable and thus are hashable. Equality checking
+    is also supported.
+    """
+
+    __slots__ = ["_interpreter", "_abi", "_platform"]
+
+    def __init__(self, interpreter, abi, platform):
+        # type: (str, str, str) -> None
+        self._interpreter = interpreter.lower()
+        self._abi = abi.lower()
+        self._platform = platform.lower()
+
+    @property
+    def interpreter(self):
+        # type: () -> str
+        return self._interpreter
+
+    @property
+    def abi(self):
+        # type: () -> str
+        return self._abi
+
+    @property
+    def platform(self):
+        # type: () -> str
+        return self._platform
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if not isinstance(other, Tag):
+            return NotImplemented
+
+        return (
+            (self.platform == other.platform)
+            and (self.abi == other.abi)
+            and (self.interpreter == other.interpreter)
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self._interpreter, self._abi, self._platform))
+
+    def __str__(self):
+        # type: () -> str
+        return "{}-{}-{}".format(self._interpreter, self._abi, self._platform)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{self} @ {self_id}>".format(self=self, self_id=id(self))
+
+
+def parse_tag(tag):
+    # type: (str) -> FrozenSet[Tag]
+    """
+    Parses the provided tag (e.g. `py3-none-any`) into a frozenset of Tag instances.
+
+    Returning a set is required due to the possibility that the tag is a
+    compressed tag set.
+    """
+    tags = set()
+    interpreters, abis, platforms = tag.split("-")
+    for interpreter in interpreters.split("."):
+        for abi in abis.split("."):
+            for platform_ in platforms.split("."):
+                tags.add(Tag(interpreter, abi, platform_))
+    return frozenset(tags)
+
+
+def _warn_keyword_parameter(func_name, kwargs):
+    # type: (str, Dict[str, bool]) -> bool
+    """
+    Backwards-compatibility with Python 2.7 to allow treating 'warn' as keyword-only.
+    """
+    if not kwargs:
+        return False
+    elif len(kwargs) > 1 or "warn" not in kwargs:
+        kwargs.pop("warn", None)
+        arg = next(iter(kwargs.keys()))
+        raise TypeError(
+            "{}() got an unexpected keyword argument {!r}".format(func_name, arg)
+        )
+    return kwargs["warn"]
+
+
+def _get_config_var(name, warn=False):
+    # type: (str, bool) -> Union[int, str, None]
+    value = sysconfig.get_config_var(name)
+    if value is None and warn:
+        logger.debug(
+            "Config variable '%s' is unset, Python ABI tag may be incorrect", name
+        )
+    return value
+
+
+def _normalize_string(string):
+    # type: (str) -> str
+    return string.replace(".", "_").replace("-", "_")
+
+
+def _abi3_applies(python_version):
+    # type: (PythonVersion) -> bool
+    """
+    Determine if the Python version supports abi3.
+
+    PEP 384 was first implemented in Python 3.2.
+    """
+    return len(python_version) > 1 and tuple(python_version) >= (3, 2)
+
+
+def _cpython_abis(py_version, warn=False):
+    # type: (PythonVersion, bool) -> List[str]
+    py_version = tuple(py_version)  # To allow for version comparison.
+    abis = []
+    version = _version_nodot(py_version[:2])
+    debug = pymalloc = ucs4 = ""
+    with_debug = _get_config_var("Py_DEBUG", warn)
+    has_refcount = hasattr(sys, "gettotalrefcount")
+    # Windows doesn't set Py_DEBUG, so checking for support of debug-compiled
+    # extension modules is the best option.
+    # https://github.com/pypa/pip/issues/3383#issuecomment-173267692
+    has_ext = "_d.pyd" in EXTENSION_SUFFIXES
+    if with_debug or (with_debug is None and (has_refcount or has_ext)):
+        debug = "d"
+    if py_version < (3, 8):
+        with_pymalloc = _get_config_var("WITH_PYMALLOC", warn)
+        if with_pymalloc or with_pymalloc is None:
+            pymalloc = "m"
+        if py_version < (3, 3):
+            unicode_size = _get_config_var("Py_UNICODE_SIZE", warn)
+            if unicode_size == 4 or (
+                unicode_size is None and sys.maxunicode == 0x10FFFF
+            ):
+                ucs4 = "u"
+    elif debug:
+        # Debug builds can also load "normal" extension modules.
+        # We can also assume no UCS-4 or pymalloc requirement.
+        abis.append("cp{version}".format(version=version))
+    abis.insert(
+        0,
+        "cp{version}{debug}{pymalloc}{ucs4}".format(
+            version=version, debug=debug, pymalloc=pymalloc, ucs4=ucs4
+        ),
+    )
+    return abis
+
+
+def cpython_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a CPython interpreter.
+
+    The tags consist of:
+    - cp<python_version>-<abi>-<platform>
+    - cp<python_version>-abi3-<platform>
+    - cp<python_version>-none-<platform>
+    - cp<less than python_version>-abi3-<platform>  # Older Python versions down to 3.2.
+
+    If python_version only specifies a major version then user-provided ABIs and
+    the 'none' ABItag will be used.
+
+    If 'abi3' or 'none' are specified in 'abis' then they will be yielded at
+    their normal position and not at the beginning.
+    """
+    warn = _warn_keyword_parameter("cpython_tags", kwargs)
+    if not python_version:
+        python_version = sys.version_info[:2]
+
+    interpreter = "cp{}".format(_version_nodot(python_version[:2]))
+
+    if abis is None:
+        if len(python_version) > 1:
+            abis = _cpython_abis(python_version, warn)
+        else:
+            abis = []
+    abis = list(abis)
+    # 'abi3' and 'none' are explicitly handled later.
+    for explicit_abi in ("abi3", "none"):
+        try:
+            abis.remove(explicit_abi)
+        except ValueError:
+            pass
+
+    platforms = list(platforms or _platform_tags())
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+    if _abi3_applies(python_version):
+        for tag in (Tag(interpreter, "abi3", platform_) for platform_ in platforms):
+            yield tag
+    for tag in (Tag(interpreter, "none", platform_) for platform_ in platforms):
+        yield tag
+
+    if _abi3_applies(python_version):
+        for minor_version in range(python_version[1] - 1, 1, -1):
+            for platform_ in platforms:
+                interpreter = "cp{version}".format(
+                    version=_version_nodot((python_version[0], minor_version))
+                )
+                yield Tag(interpreter, "abi3", platform_)
+
+
+def _generic_abi():
+    # type: () -> Iterator[str]
+    abi = sysconfig.get_config_var("SOABI")
+    if abi:
+        yield _normalize_string(abi)
+
+
+def generic_tags(
+    interpreter=None,  # type: Optional[str]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a generic interpreter.
+
+    The tags consist of:
+    - <interpreter>-<abi>-<platform>
+
+    The "none" ABI will be added if it was not explicitly provided.
+    """
+    warn = _warn_keyword_parameter("generic_tags", kwargs)
+    if not interpreter:
+        interp_name = interpreter_name()
+        interp_version = interpreter_version(warn=warn)
+        interpreter = "".join([interp_name, interp_version])
+    if abis is None:
+        abis = _generic_abi()
+    platforms = list(platforms or _platform_tags())
+    abis = list(abis)
+    if "none" not in abis:
+        abis.append("none")
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+
+
+def _py_interpreter_range(py_version):
+    # type: (PythonVersion) -> Iterator[str]
+    """
+    Yields Python versions in descending order.
+
+    After the latest version, the major-only version will be yielded, and then
+    all previous versions of that major version.
+    """
+    if len(py_version) > 1:
+        yield "py{version}".format(version=_version_nodot(py_version[:2]))
+    yield "py{major}".format(major=py_version[0])
+    if len(py_version) > 1:
+        for minor in range(py_version[1] - 1, -1, -1):
+            yield "py{version}".format(version=_version_nodot((py_version[0], minor)))
+
+
+def compatible_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    interpreter=None,  # type: Optional[str]
+    platforms=None,  # type: Optional[Iterable[str]]
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the sequence of tags that are compatible with a specific version of Python.
+
+    The tags consist of:
+    - py*-none-<platform>
+    - <interpreter>-none-any  # ... if `interpreter` is provided.
+    - py*-none-any
+    """
+    if not python_version:
+        python_version = sys.version_info[:2]
+    platforms = list(platforms or _platform_tags())
+    for version in _py_interpreter_range(python_version):
+        for platform_ in platforms:
+            yield Tag(version, "none", platform_)
+    if interpreter:
+        yield Tag(interpreter, "none", "any")
+    for version in _py_interpreter_range(python_version):
+        yield Tag(version, "none", "any")
+
+
+def _mac_arch(arch, is_32bit=_32_BIT_INTERPRETER):
+    # type: (str, bool) -> str
+    if not is_32bit:
+        return arch
+
+    if arch.startswith("ppc"):
+        return "ppc"
+
+    return "i386"
+
+
+def _mac_binary_formats(version, cpu_arch):
+    # type: (MacVersion, str) -> List[str]
+    formats = [cpu_arch]
+    if cpu_arch == "x86_64":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat64", "fat32"])
+
+    elif cpu_arch == "i386":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat32", "fat"])
+
+    elif cpu_arch == "ppc64":
+        # TODO: Need to care about 32-bit PPC for ppc64 through 10.2?
+        if version > (10, 5) or version < (10, 4):
+            return []
+        formats.append("fat64")
+
+    elif cpu_arch == "ppc":
+        if version > (10, 6):
+            return []
+        formats.extend(["fat32", "fat"])
+
+    formats.append("universal")
+    return formats
+
+
+def mac_platforms(version=None, arch=None):
+    # type: (Optional[MacVersion], Optional[str]) -> Iterator[str]
+    """
+    Yields the platform tags for a macOS system.
+
+    The `version` parameter is a two-item tuple specifying the macOS version to
+    generate platform tags for. The `arch` parameter is the CPU architecture to
+    generate platform tags for. Both parameters default to the appropriate value
+    for the current system.
+    """
+    version_str, _, cpu_arch = platform.mac_ver()  # type: ignore
+    if version is None:
+        version = cast("MacVersion", tuple(map(int, version_str.split(".")[:2])))
+    else:
+        version = version
+    if arch is None:
+        arch = _mac_arch(cpu_arch)
+    else:
+        arch = arch
+    for minor_version in range(version[1], -1, -1):
+        compat_version = version[0], minor_version
+        binary_formats = _mac_binary_formats(compat_version, arch)
+        for binary_format in binary_formats:
+            yield "macosx_{major}_{minor}_{binary_format}".format(
+                major=compat_version[0],
+                minor=compat_version[1],
+                binary_format=binary_format,
+            )
+
+
+# From PEP 513.
+def _is_manylinux_compatible(name, glibc_version):
+    # type: (str, GlibcVersion) -> bool
+    # Check for presence of _manylinux module.
+    try:
+        import _manylinux  # noqa
+
+        return bool(getattr(_manylinux, name + "_compatible"))
+    except (ImportError, AttributeError):
+        # Fall through to heuristic check below.
+        pass
+
+    return _have_compatible_glibc(*glibc_version)
+
+
+def _glibc_version_string():
+    # type: () -> Optional[str]
+    # Returns glibc version string, or None if not using glibc.
+    return _glibc_version_string_confstr() or _glibc_version_string_ctypes()
+
+
+def _glibc_version_string_confstr():
+    # type: () -> Optional[str]
+    """
+    Primary implementation of glibc_version_string using os.confstr.
+    """
+    # os.confstr is quite a bit faster than ctypes.DLL. It's also less likely
+    # to be broken or missing. This strategy is used in the standard library
+    # platform module.
+    # https://github.com/python/cpython/blob/fcf1d003bf4f0100c9d0921ff3d70e1127ca1b71/Lib/platform.py#L175-L183
+    try:
+        # os.confstr("CS_GNU_LIBC_VERSION") returns a string like "glibc 2.17".
+        version_string = os.confstr(  # type: ignore[attr-defined] # noqa: F821
+            "CS_GNU_LIBC_VERSION"
+        )
+        assert version_string is not None
+        _, version = version_string.split()  # type: Tuple[str, str]
+    except (AssertionError, AttributeError, OSError, ValueError):
+        # os.confstr() or CS_GNU_LIBC_VERSION not available (or a bad value)...
+        return None
+    return version
+
+
+def _glibc_version_string_ctypes():
+    # type: () -> Optional[str]
+    """
+    Fallback implementation of glibc_version_string using ctypes.
+    """
+    try:
+        import ctypes
+    except ImportError:
+        return None
+
+    # ctypes.CDLL(None) internally calls dlopen(NULL), and as the dlopen
+    # manpage says, "If filename is NULL, then the returned handle is for the
+    # main program". This way we can let the linker do the work to figure out
+    # which libc our process is actually using.
+    #
+    # Note: typeshed is wrong here so we are ignoring this line.
+    process_namespace = ctypes.CDLL(None)  # type: ignore
+    try:
+        gnu_get_libc_version = process_namespace.gnu_get_libc_version
+    except AttributeError:
+        # Symbol doesn't exist -> therefore, we are not linked to
+        # glibc.
+        return None
+
+    # Call gnu_get_libc_version, which returns a string like "2.5"
+    gnu_get_libc_version.restype = ctypes.c_char_p
+    version_str = gnu_get_libc_version()  # type: str
+    # py2 / py3 compatibility:
+    if not isinstance(version_str, str):
+        version_str = version_str.decode("ascii")
+
+    return version_str
+
+
+# Separated out from have_compatible_glibc for easier unit testing.
+def _check_glibc_version(version_str, required_major, minimum_minor):
+    # type: (str, int, int) -> bool
+    # Parse string and check against requested version.
+    #
+    # We use a regexp instead of str.split because we want to discard any
+    # random junk that might come after the minor version -- this might happen
+    # in patched/forked versions of glibc (e.g. Linaro's version of glibc
+    # uses version strings like "2.20-2014.11"). See gh-3588.
+    m = re.match(r"(?P<major>[0-9]+)\.(?P<minor>[0-9]+)", version_str)
+    if not m:
+        warnings.warn(
+            "Expected glibc version with 2 components major.minor,"
+            " got: %s" % version_str,
+            RuntimeWarning,
+        )
+        return False
+    return (
+        int(m.group("major")) == required_major
+        and int(m.group("minor")) >= minimum_minor
+    )
+
+
+def _have_compatible_glibc(required_major, minimum_minor):
+    # type: (int, int) -> bool
+    version_str = _glibc_version_string()
+    if version_str is None:
+        return False
+    return _check_glibc_version(version_str, required_major, minimum_minor)
+
+
+# Python does not provide platform information at sufficient granularity to
+# identify the architecture of the running executable in some cases, so we
+# determine it dynamically by reading the information from the running
+# process. This only applies on Linux, which uses the ELF format.
+class _ELFFileHeader(object):
+    # https://en.wikipedia.org/wiki/Executable_and_Linkable_Format#File_header
+    class _InvalidELFFileHeader(ValueError):
+        """
+        An invalid ELF file header was found.
+        """
+
+    ELF_MAGIC_NUMBER = 0x7F454C46
+    ELFCLASS32 = 1
+    ELFCLASS64 = 2
+    ELFDATA2LSB = 1
+    ELFDATA2MSB = 2
+    EM_386 = 3
+    EM_S390 = 22
+    EM_ARM = 40
+    EM_X86_64 = 62
+    EF_ARM_ABIMASK = 0xFF000000
+    EF_ARM_ABI_VER5 = 0x05000000
+    EF_ARM_ABI_FLOAT_HARD = 0x00000400
+
+    def __init__(self, file):
+        # type: (IO[bytes]) -> None
+        def unpack(fmt):
+            # type: (str) -> int
+            try:
+                (result,) = struct.unpack(
+                    fmt, file.read(struct.calcsize(fmt))
+                )  # type: (int, )
+            except struct.error:
+                raise _ELFFileHeader._InvalidELFFileHeader()
+            return result
+
+        self.e_ident_magic = unpack(">I")
+        if self.e_ident_magic != self.ELF_MAGIC_NUMBER:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_class = unpack("B")
+        if self.e_ident_class not in {self.ELFCLASS32, self.ELFCLASS64}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_data = unpack("B")
+        if self.e_ident_data not in {self.ELFDATA2LSB, self.ELFDATA2MSB}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_version = unpack("B")
+        self.e_ident_osabi = unpack("B")
+        self.e_ident_abiversion = unpack("B")
+        self.e_ident_pad = file.read(7)
+        format_h = "<H" if self.e_ident_data == self.ELFDATA2LSB else ">H"
+        format_i = "<I" if self.e_ident_data == self.ELFDATA2LSB else ">I"
+        format_q = "<Q" if self.e_ident_data == self.ELFDATA2LSB else ">Q"
+        format_p = format_i if self.e_ident_class == self.ELFCLASS32 else format_q
+        self.e_type = unpack(format_h)
+        self.e_machine = unpack(format_h)
+        self.e_version = unpack(format_i)
+        self.e_entry = unpack(format_p)
+        self.e_phoff = unpack(format_p)
+        self.e_shoff = unpack(format_p)
+        self.e_flags = unpack(format_i)
+        self.e_ehsize = unpack(format_h)
+        self.e_phentsize = unpack(format_h)
+        self.e_phnum = unpack(format_h)
+        self.e_shentsize = unpack(format_h)
+        self.e_shnum = unpack(format_h)
+        self.e_shstrndx = unpack(format_h)
+
+
+def _get_elf_header():
+    # type: () -> Optional[_ELFFileHeader]
+    try:
+        with open(sys.executable, "rb") as f:
+            elf_header = _ELFFileHeader(f)
+    except (IOError, OSError, TypeError, _ELFFileHeader._InvalidELFFileHeader):
+        return None
+    return elf_header
+
+
+def _is_linux_armhf():
+    # type: () -> bool
+    # hard-float ABI can be detected from the ELF header of the running
+    # process
+    # https://static.docs.arm.com/ihi0044/g/aaelf32.pdf
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_ARM
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABIMASK
+    ) == elf_header.EF_ARM_ABI_VER5
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABI_FLOAT_HARD
+    ) == elf_header.EF_ARM_ABI_FLOAT_HARD
+    return result
+
+
+def _is_linux_i686():
+    # type: () -> bool
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_386
+    return result
+
+
+def _have_compatible_manylinux_abi(arch):
+    # type: (str) -> bool
+    if arch == "armv7l":
+        return _is_linux_armhf()
+    if arch == "i686":
+        return _is_linux_i686()
+    return True
+
+
+def _linux_platforms(is_32bit=_32_BIT_INTERPRETER):
+    # type: (bool) -> Iterator[str]
+    linux = _normalize_string(distutils.util.get_platform())
+    if is_32bit:
+        if linux == "linux_x86_64":
+            linux = "linux_i686"
+        elif linux == "linux_aarch64":
+            linux = "linux_armv7l"
+    manylinux_support = []
+    _, arch = linux.split("_", 1)
+    if _have_compatible_manylinux_abi(arch):
+        if arch in {"x86_64", "i686", "aarch64", "armv7l", "ppc64", "ppc64le", "s390x"}:
+            manylinux_support.append(
+                ("manylinux2014", (2, 17))
+            )  # CentOS 7 w/ glibc 2.17 (PEP 599)
+        if arch in {"x86_64", "i686"}:
+            manylinux_support.append(
+                ("manylinux2010", (2, 12))
+            )  # CentOS 6 w/ glibc 2.12 (PEP 571)
+            manylinux_support.append(
+                ("manylinux1", (2, 5))
+            )  # CentOS 5 w/ glibc 2.5 (PEP 513)
+    manylinux_support_iter = iter(manylinux_support)
+    for name, glibc_version in manylinux_support_iter:
+        if _is_manylinux_compatible(name, glibc_version):
+            yield linux.replace("linux", name)
+            break
+    # Support for a later manylinux implies support for an earlier version.
+    for name, _ in manylinux_support_iter:
+        yield linux.replace("linux", name)
+    yield linux
+
+
+def _generic_platforms():
+    # type: () -> Iterator[str]
+    yield _normalize_string(distutils.util.get_platform())
+
+
+def _platform_tags():
+    # type: () -> Iterator[str]
+    """
+    Provides the platform tags for this installation.
+    """
+    if platform.system() == "Darwin":
+        return mac_platforms()
+    elif platform.system() == "Linux":
+        return _linux_platforms()
+    else:
+        return _generic_platforms()
+
+
+def interpreter_name():
+    # type: () -> str
+    """
+    Returns the name of the running interpreter.
+    """
+    try:
+        name = sys.implementation.name  # type: ignore
+    except AttributeError:  # pragma: no cover
+        # Python 2.7 compatibility.
+        name = platform.python_implementation().lower()
+    return INTERPRETER_SHORT_NAMES.get(name) or name
+
+
+def interpreter_version(**kwargs):
+    # type: (bool) -> str
+    """
+    Returns the version of the running interpreter.
+    """
+    warn = _warn_keyword_parameter("interpreter_version", kwargs)
+    version = _get_config_var("py_version_nodot", warn=warn)
+    if version:
+        version = str(version)
+    else:
+        version = _version_nodot(sys.version_info[:2])
+    return version
+
+
+def _version_nodot(version):
+    # type: (PythonVersion) -> str
+    if any(v >= 10 for v in version):
+        sep = "_"
+    else:
+        sep = ""
+    return sep.join(map(str, version))
+
+
+def sys_tags(**kwargs):
+    # type: (bool) -> Iterator[Tag]
+    """
+    Returns the sequence of tag triples for the running interpreter.
+
+    The order of the sequence corresponds to priority order for the
+    interpreter, from most to least important.
+    """
+    warn = _warn_keyword_parameter("sys_tags", kwargs)
+
+    interp_name = interpreter_name()
+    if interp_name == "cp":
+        for tag in cpython_tags(warn=warn):
+            yield tag
+    else:
+        for tag in generic_tags():
+            yield tag
+
+    for tag in compatible_tags():
+        yield tag
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/utils.py b/venv/Lib/site-packages/pip/_vendor/packaging/utils.py
new file mode 100644
index 000000000..19579c1a0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/utils.py
@@ -0,0 +1,65 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import re
+
+from ._typing import TYPE_CHECKING, cast
+from .version import InvalidVersion, Version
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import NewType, Union
+
+    NormalizedName = NewType("NormalizedName", str)
+
+_canonicalize_regex = re.compile(r"[-_.]+")
+
+
+def canonicalize_name(name):
+    # type: (str) -> NormalizedName
+    # This is taken from PEP 503.
+    value = _canonicalize_regex.sub("-", name).lower()
+    return cast("NormalizedName", value)
+
+
+def canonicalize_version(_version):
+    # type: (str) -> Union[Version, str]
+    """
+    This is very similar to Version.__str__, but has one subtle difference
+    with the way it handles the release segment.
+    """
+
+    try:
+        version = Version(_version)
+    except InvalidVersion:
+        # Legacy versions cannot be normalized
+        return _version
+
+    parts = []
+
+    # Epoch
+    if version.epoch != 0:
+        parts.append("{0}!".format(version.epoch))
+
+    # Release segment
+    # NB: This strips trailing '.0's to normalize
+    parts.append(re.sub(r"(\.0)+$", "", ".".join(str(x) for x in version.release)))
+
+    # Pre-release
+    if version.pre is not None:
+        parts.append("".join(str(x) for x in version.pre))
+
+    # Post-release
+    if version.post is not None:
+        parts.append(".post{0}".format(version.post))
+
+    # Development release
+    if version.dev is not None:
+        parts.append(".dev{0}".format(version.dev))
+
+    # Local version segment
+    if version.local is not None:
+        parts.append("+{0}".format(version.local))
+
+    return "".join(parts)
diff --git a/venv/Lib/site-packages/pip/_vendor/packaging/version.py b/venv/Lib/site-packages/pip/_vendor/packaging/version.py
new file mode 100644
index 000000000..00371e86a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/packaging/version.py
@@ -0,0 +1,535 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import collections
+import itertools
+import re
+
+from ._structures import Infinity, NegativeInfinity
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Callable, Iterator, List, Optional, SupportsInt, Tuple, Union
+
+    from ._structures import InfinityType, NegativeInfinityType
+
+    InfiniteTypes = Union[InfinityType, NegativeInfinityType]
+    PrePostDevType = Union[InfiniteTypes, Tuple[str, int]]
+    SubLocalType = Union[InfiniteTypes, int, str]
+    LocalType = Union[
+        NegativeInfinityType,
+        Tuple[
+            Union[
+                SubLocalType,
+                Tuple[SubLocalType, str],
+                Tuple[NegativeInfinityType, SubLocalType],
+            ],
+            ...,
+        ],
+    ]
+    CmpKey = Tuple[
+        int, Tuple[int, ...], PrePostDevType, PrePostDevType, PrePostDevType, LocalType
+    ]
+    LegacyCmpKey = Tuple[int, Tuple[str, ...]]
+    VersionComparisonMethod = Callable[
+        [Union[CmpKey, LegacyCmpKey], Union[CmpKey, LegacyCmpKey]], bool
+    ]
+
+__all__ = ["parse", "Version", "LegacyVersion", "InvalidVersion", "VERSION_PATTERN"]
+
+
+_Version = collections.namedtuple(
+    "_Version", ["epoch", "release", "dev", "pre", "post", "local"]
+)
+
+
+def parse(version):
+    # type: (str) -> Union[LegacyVersion, Version]
+    """
+    Parse the given version string and return either a :class:`Version` object
+    or a :class:`LegacyVersion` object depending on if the given version is
+    a valid PEP 440 version or a legacy version.
+    """
+    try:
+        return Version(version)
+    except InvalidVersion:
+        return LegacyVersion(version)
+
+
+class InvalidVersion(ValueError):
+    """
+    An invalid version was found, users should refer to PEP 440.
+    """
+
+
+class _BaseVersion(object):
+    _key = None  # type: Union[CmpKey, LegacyCmpKey]
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._key)
+
+    def __lt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s < o)
+
+    def __le__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s <= o)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s == o)
+
+    def __ge__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s >= o)
+
+    def __gt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s > o)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s != o)
+
+    def _compare(self, other, method):
+        # type: (object, VersionComparisonMethod) -> Union[bool, NotImplemented]
+        if not isinstance(other, _BaseVersion):
+            return NotImplemented
+
+        return method(self._key, other._key)
+
+
+class LegacyVersion(_BaseVersion):
+    def __init__(self, version):
+        # type: (str) -> None
+        self._version = str(version)
+        self._key = _legacy_cmpkey(self._version)
+
+    def __str__(self):
+        # type: () -> str
+        return self._version
+
+    def __repr__(self):
+        # type: () -> str
+        return "<LegacyVersion({0})>".format(repr(str(self)))
+
+    @property
+    def public(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        return -1
+
+    @property
+    def release(self):
+        # type: () -> None
+        return None
+
+    @property
+    def pre(self):
+        # type: () -> None
+        return None
+
+    @property
+    def post(self):
+        # type: () -> None
+        return None
+
+    @property
+    def dev(self):
+        # type: () -> None
+        return None
+
+    @property
+    def local(self):
+        # type: () -> None
+        return None
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return False
+
+
+_legacy_version_component_re = re.compile(r"(\d+ | [a-z]+ | \.| -)", re.VERBOSE)
+
+_legacy_version_replacement_map = {
+    "pre": "c",
+    "preview": "c",
+    "-": "final-",
+    "rc": "c",
+    "dev": "@",
+}
+
+
+def _parse_version_parts(s):
+    # type: (str) -> Iterator[str]
+    for part in _legacy_version_component_re.split(s):
+        part = _legacy_version_replacement_map.get(part, part)
+
+        if not part or part == ".":
+            continue
+
+        if part[:1] in "0123456789":
+            # pad for numeric comparison
+            yield part.zfill(8)
+        else:
+            yield "*" + part
+
+    # ensure that alpha/beta/candidate are before final
+    yield "*final"
+
+
+def _legacy_cmpkey(version):
+    # type: (str) -> LegacyCmpKey
+
+    # We hardcode an epoch of -1 here. A PEP 440 version can only have a epoch
+    # greater than or equal to 0. This will effectively put the LegacyVersion,
+    # which uses the defacto standard originally implemented by setuptools,
+    # as before all PEP 440 versions.
+    epoch = -1
+
+    # This scheme is taken from pkg_resources.parse_version setuptools prior to
+    # it's adoption of the packaging library.
+    parts = []  # type: List[str]
+    for part in _parse_version_parts(version.lower()):
+        if part.startswith("*"):
+            # remove "-" before a prerelease tag
+            if part < "*final":
+                while parts and parts[-1] == "*final-":
+                    parts.pop()
+
+            # remove trailing zeros from each series of numeric parts
+            while parts and parts[-1] == "00000000":
+                parts.pop()
+
+        parts.append(part)
+
+    return epoch, tuple(parts)
+
+
+# Deliberately not anchored to the start and end of the string, to make it
+# easier for 3rd party code to reuse
+VERSION_PATTERN = r"""
+    v?
+    (?:
+        (?:(?P<epoch>[0-9]+)!)?                           # epoch
+        (?P<release>[0-9]+(?:\.[0-9]+)*)                  # release segment
+        (?P<pre>                                          # pre-release
+            [-_\.]?
+            (?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
+            [-_\.]?
+            (?P<pre_n>[0-9]+)?
+        )?
+        (?P<post>                                         # post release
+            (?:-(?P<post_n1>[0-9]+))
+            |
+            (?:
+                [-_\.]?
+                (?P<post_l>post|rev|r)
+                [-_\.]?
+                (?P<post_n2>[0-9]+)?
+            )
+        )?
+        (?P<dev>                                          # dev release
+            [-_\.]?
+            (?P<dev_l>dev)
+            [-_\.]?
+            (?P<dev_n>[0-9]+)?
+        )?
+    )
+    (?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))?       # local version
+"""
+
+
+class Version(_BaseVersion):
+
+    _regex = re.compile(r"^\s*" + VERSION_PATTERN + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    def __init__(self, version):
+        # type: (str) -> None
+
+        # Validate the version and parse it into pieces
+        match = self._regex.search(version)
+        if not match:
+            raise InvalidVersion("Invalid version: '{0}'".format(version))
+
+        # Store the parsed out pieces of the version
+        self._version = _Version(
+            epoch=int(match.group("epoch")) if match.group("epoch") else 0,
+            release=tuple(int(i) for i in match.group("release").split(".")),
+            pre=_parse_letter_version(match.group("pre_l"), match.group("pre_n")),
+            post=_parse_letter_version(
+                match.group("post_l"), match.group("post_n1") or match.group("post_n2")
+            ),
+            dev=_parse_letter_version(match.group("dev_l"), match.group("dev_n")),
+            local=_parse_local_version(match.group("local")),
+        )
+
+        # Generate a key which will be used for sorting
+        self._key = _cmpkey(
+            self._version.epoch,
+            self._version.release,
+            self._version.pre,
+            self._version.post,
+            self._version.dev,
+            self._version.local,
+        )
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Version({0})>".format(repr(str(self)))
+
+    def __str__(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        # Pre-release
+        if self.pre is not None:
+            parts.append("".join(str(x) for x in self.pre))
+
+        # Post-release
+        if self.post is not None:
+            parts.append(".post{0}".format(self.post))
+
+        # Development release
+        if self.dev is not None:
+            parts.append(".dev{0}".format(self.dev))
+
+        # Local version segment
+        if self.local is not None:
+            parts.append("+{0}".format(self.local))
+
+        return "".join(parts)
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        _epoch = self._version.epoch  # type: int
+        return _epoch
+
+    @property
+    def release(self):
+        # type: () -> Tuple[int, ...]
+        _release = self._version.release  # type: Tuple[int, ...]
+        return _release
+
+    @property
+    def pre(self):
+        # type: () -> Optional[Tuple[str, int]]
+        _pre = self._version.pre  # type: Optional[Tuple[str, int]]
+        return _pre
+
+    @property
+    def post(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.post[1] if self._version.post else None
+
+    @property
+    def dev(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.dev[1] if self._version.dev else None
+
+    @property
+    def local(self):
+        # type: () -> Optional[str]
+        if self._version.local:
+            return ".".join(str(x) for x in self._version.local)
+        else:
+            return None
+
+    @property
+    def public(self):
+        # type: () -> str
+        return str(self).split("+", 1)[0]
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        return "".join(parts)
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return self.dev is not None or self.pre is not None
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return self.post is not None
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return self.dev is not None
+
+    @property
+    def major(self):
+        # type: () -> int
+        return self.release[0] if len(self.release) >= 1 else 0
+
+    @property
+    def minor(self):
+        # type: () -> int
+        return self.release[1] if len(self.release) >= 2 else 0
+
+    @property
+    def micro(self):
+        # type: () -> int
+        return self.release[2] if len(self.release) >= 3 else 0
+
+
+def _parse_letter_version(
+    letter,  # type: str
+    number,  # type: Union[str, bytes, SupportsInt]
+):
+    # type: (...) -> Optional[Tuple[str, int]]
+
+    if letter:
+        # We consider there to be an implicit 0 in a pre-release if there is
+        # not a numeral associated with it.
+        if number is None:
+            number = 0
+
+        # We normalize any letters to their lower case form
+        letter = letter.lower()
+
+        # We consider some words to be alternate spellings of other words and
+        # in those cases we want to normalize the spellings to our preferred
+        # spelling.
+        if letter == "alpha":
+            letter = "a"
+        elif letter == "beta":
+            letter = "b"
+        elif letter in ["c", "pre", "preview"]:
+            letter = "rc"
+        elif letter in ["rev", "r"]:
+            letter = "post"
+
+        return letter, int(number)
+    if not letter and number:
+        # We assume if we are given a number, but we are not given a letter
+        # then this is using the implicit post release syntax (e.g. 1.0-1)
+        letter = "post"
+
+        return letter, int(number)
+
+    return None
+
+
+_local_version_separators = re.compile(r"[\._-]")
+
+
+def _parse_local_version(local):
+    # type: (str) -> Optional[LocalType]
+    """
+    Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
+    """
+    if local is not None:
+        return tuple(
+            part.lower() if not part.isdigit() else int(part)
+            for part in _local_version_separators.split(local)
+        )
+    return None
+
+
+def _cmpkey(
+    epoch,  # type: int
+    release,  # type: Tuple[int, ...]
+    pre,  # type: Optional[Tuple[str, int]]
+    post,  # type: Optional[Tuple[str, int]]
+    dev,  # type: Optional[Tuple[str, int]]
+    local,  # type: Optional[Tuple[SubLocalType]]
+):
+    # type: (...) -> CmpKey
+
+    # When we compare a release version, we want to compare it with all of the
+    # trailing zeros removed. So we'll use a reverse the list, drop all the now
+    # leading zeros until we come to something non zero, then take the rest
+    # re-reverse it back into the correct order and make it a tuple and use
+    # that for our sorting key.
+    _release = tuple(
+        reversed(list(itertools.dropwhile(lambda x: x == 0, reversed(release))))
+    )
+
+    # We need to "trick" the sorting algorithm to put 1.0.dev0 before 1.0a0.
+    # We'll do this by abusing the pre segment, but we _only_ want to do this
+    # if there is not a pre or a post segment. If we have one of those then
+    # the normal sorting rules will handle this case correctly.
+    if pre is None and post is None and dev is not None:
+        _pre = NegativeInfinity  # type: PrePostDevType
+    # Versions without a pre-release (except as noted above) should sort after
+    # those with one.
+    elif pre is None:
+        _pre = Infinity
+    else:
+        _pre = pre
+
+    # Versions without a post segment should sort before those with one.
+    if post is None:
+        _post = NegativeInfinity  # type: PrePostDevType
+
+    else:
+        _post = post
+
+    # Versions without a development segment should sort after those with one.
+    if dev is None:
+        _dev = Infinity  # type: PrePostDevType
+
+    else:
+        _dev = dev
+
+    if local is None:
+        # Versions without a local segment should sort before those with one.
+        _local = NegativeInfinity  # type: LocalType
+    else:
+        # Versions with a local segment need that segment parsed to implement
+        # the sorting rules in PEP440.
+        # - Alpha numeric segments sort before numeric segments
+        # - Alpha numeric segments sort lexicographically
+        # - Numeric segments sort numerically
+        # - Shorter versions sort before longer versions when the prefixes
+        #   match exactly
+        _local = tuple(
+            (i, "") if isinstance(i, int) else (NegativeInfinity, i) for i in local
+        )
+
+    return epoch, _release, _pre, _post, _dev, _local
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__init__.py b/venv/Lib/site-packages/pip/_vendor/pep517/__init__.py
new file mode 100644
index 000000000..7355b68a2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/__init__.py
@@ -0,0 +1,4 @@
+"""Wrappers to build Python packages using PEP 517 hooks
+"""
+
+__version__ = '0.8.2'
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..abb174d51
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/_in_process.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/_in_process.cpython-36.pyc
new file mode 100644
index 000000000..730ae27db
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/_in_process.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/build.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/build.cpython-36.pyc
new file mode 100644
index 000000000..e801b82b8
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/build.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/check.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/check.cpython-36.pyc
new file mode 100644
index 000000000..5c21bda36
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/colorlog.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/colorlog.cpython-36.pyc
new file mode 100644
index 000000000..fdbdc191e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/colorlog.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..6b1ef776e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/dirtools.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/dirtools.cpython-36.pyc
new file mode 100644
index 000000000..22297251c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/dirtools.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/envbuild.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/envbuild.cpython-36.pyc
new file mode 100644
index 000000000..62f53450b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/envbuild.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/meta.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/meta.cpython-36.pyc
new file mode 100644
index 000000000..0fa2c1ba1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/meta.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/wrappers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/wrappers.cpython-36.pyc
new file mode 100644
index 000000000..4e0b8bd2d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pep517/__pycache__/wrappers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/_in_process.py b/venv/Lib/site-packages/pip/_vendor/pep517/_in_process.py
new file mode 100644
index 000000000..a536b03e6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/_in_process.py
@@ -0,0 +1,280 @@
+"""This is invoked in a subprocess to call the build backend hooks.
+
+It expects:
+- Command line args: hook_name, control_dir
+- Environment variables:
+      PEP517_BUILD_BACKEND=entry.point:spec
+      PEP517_BACKEND_PATH=paths (separated with os.pathsep)
+- control_dir/input.json:
+  - {"kwargs": {...}}
+
+Results:
+- control_dir/output.json
+  - {"return_val": ...}
+"""
+from glob import glob
+from importlib import import_module
+import json
+import os
+import os.path
+from os.path import join as pjoin
+import re
+import shutil
+import sys
+import traceback
+
+# This file is run as a script, and `import compat` is not zip-safe, so we
+# include write_json() and read_json() from compat.py.
+#
+# Handle reading and writing JSON in UTF-8, on Python 3 and 2.
+
+if sys.version_info[0] >= 3:
+    # Python 3
+    def write_json(obj, path, **kwargs):
+        with open(path, 'w', encoding='utf-8') as f:
+            json.dump(obj, f, **kwargs)
+
+    def read_json(path):
+        with open(path, 'r', encoding='utf-8') as f:
+            return json.load(f)
+
+else:
+    # Python 2
+    def write_json(obj, path, **kwargs):
+        with open(path, 'wb') as f:
+            json.dump(obj, f, encoding='utf-8', **kwargs)
+
+    def read_json(path):
+        with open(path, 'rb') as f:
+            return json.load(f)
+
+
+class BackendUnavailable(Exception):
+    """Raised if we cannot import the backend"""
+    def __init__(self, traceback):
+        self.traceback = traceback
+
+
+class BackendInvalid(Exception):
+    """Raised if the backend is invalid"""
+    def __init__(self, message):
+        self.message = message
+
+
+class HookMissing(Exception):
+    """Raised if a hook is missing and we are not executing the fallback"""
+
+
+def contained_in(filename, directory):
+    """Test if a file is located within the given directory."""
+    filename = os.path.normcase(os.path.abspath(filename))
+    directory = os.path.normcase(os.path.abspath(directory))
+    return os.path.commonprefix([filename, directory]) == directory
+
+
+def _build_backend():
+    """Find and load the build backend"""
+    # Add in-tree backend directories to the front of sys.path.
+    backend_path = os.environ.get('PEP517_BACKEND_PATH')
+    if backend_path:
+        extra_pathitems = backend_path.split(os.pathsep)
+        sys.path[:0] = extra_pathitems
+
+    ep = os.environ['PEP517_BUILD_BACKEND']
+    mod_path, _, obj_path = ep.partition(':')
+    try:
+        obj = import_module(mod_path)
+    except ImportError:
+        raise BackendUnavailable(traceback.format_exc())
+
+    if backend_path:
+        if not any(
+            contained_in(obj.__file__, path)
+            for path in extra_pathitems
+        ):
+            raise BackendInvalid("Backend was not loaded from backend-path")
+
+    if obj_path:
+        for path_part in obj_path.split('.'):
+            obj = getattr(obj, path_part)
+    return obj
+
+
+def get_requires_for_build_wheel(config_settings):
+    """Invoke the optional get_requires_for_build_wheel hook
+
+    Returns [] if the hook is not defined.
+    """
+    backend = _build_backend()
+    try:
+        hook = backend.get_requires_for_build_wheel
+    except AttributeError:
+        return []
+    else:
+        return hook(config_settings)
+
+
+def prepare_metadata_for_build_wheel(
+        metadata_directory, config_settings, _allow_fallback):
+    """Invoke optional prepare_metadata_for_build_wheel
+
+    Implements a fallback by building a wheel if the hook isn't defined,
+    unless _allow_fallback is False in which case HookMissing is raised.
+    """
+    backend = _build_backend()
+    try:
+        hook = backend.prepare_metadata_for_build_wheel
+    except AttributeError:
+        if not _allow_fallback:
+            raise HookMissing()
+        return _get_wheel_metadata_from_wheel(backend, metadata_directory,
+                                              config_settings)
+    else:
+        return hook(metadata_directory, config_settings)
+
+
+WHEEL_BUILT_MARKER = 'PEP517_ALREADY_BUILT_WHEEL'
+
+
+def _dist_info_files(whl_zip):
+    """Identify the .dist-info folder inside a wheel ZipFile."""
+    res = []
+    for path in whl_zip.namelist():
+        m = re.match(r'[^/\\]+-[^/\\]+\.dist-info/', path)
+        if m:
+            res.append(path)
+    if res:
+        return res
+    raise Exception("No .dist-info folder found in wheel")
+
+
+def _get_wheel_metadata_from_wheel(
+        backend, metadata_directory, config_settings):
+    """Build a wheel and extract the metadata from it.
+
+    Fallback for when the build backend does not
+    define the 'get_wheel_metadata' hook.
+    """
+    from zipfile import ZipFile
+    whl_basename = backend.build_wheel(metadata_directory, config_settings)
+    with open(os.path.join(metadata_directory, WHEEL_BUILT_MARKER), 'wb'):
+        pass  # Touch marker file
+
+    whl_file = os.path.join(metadata_directory, whl_basename)
+    with ZipFile(whl_file) as zipf:
+        dist_info = _dist_info_files(zipf)
+        zipf.extractall(path=metadata_directory, members=dist_info)
+    return dist_info[0].split('/')[0]
+
+
+def _find_already_built_wheel(metadata_directory):
+    """Check for a wheel already built during the get_wheel_metadata hook.
+    """
+    if not metadata_directory:
+        return None
+    metadata_parent = os.path.dirname(metadata_directory)
+    if not os.path.isfile(pjoin(metadata_parent, WHEEL_BUILT_MARKER)):
+        return None
+
+    whl_files = glob(os.path.join(metadata_parent, '*.whl'))
+    if not whl_files:
+        print('Found wheel built marker, but no .whl files')
+        return None
+    if len(whl_files) > 1:
+        print('Found multiple .whl files; unspecified behaviour. '
+              'Will call build_wheel.')
+        return None
+
+    # Exactly one .whl file
+    return whl_files[0]
+
+
+def build_wheel(wheel_directory, config_settings, metadata_directory=None):
+    """Invoke the mandatory build_wheel hook.
+
+    If a wheel was already built in the
+    prepare_metadata_for_build_wheel fallback, this
+    will copy it rather than rebuilding the wheel.
+    """
+    prebuilt_whl = _find_already_built_wheel(metadata_directory)
+    if prebuilt_whl:
+        shutil.copy2(prebuilt_whl, wheel_directory)
+        return os.path.basename(prebuilt_whl)
+
+    return _build_backend().build_wheel(wheel_directory, config_settings,
+                                        metadata_directory)
+
+
+def get_requires_for_build_sdist(config_settings):
+    """Invoke the optional get_requires_for_build_wheel hook
+
+    Returns [] if the hook is not defined.
+    """
+    backend = _build_backend()
+    try:
+        hook = backend.get_requires_for_build_sdist
+    except AttributeError:
+        return []
+    else:
+        return hook(config_settings)
+
+
+class _DummyException(Exception):
+    """Nothing should ever raise this exception"""
+
+
+class GotUnsupportedOperation(Exception):
+    """For internal use when backend raises UnsupportedOperation"""
+    def __init__(self, traceback):
+        self.traceback = traceback
+
+
+def build_sdist(sdist_directory, config_settings):
+    """Invoke the mandatory build_sdist hook."""
+    backend = _build_backend()
+    try:
+        return backend.build_sdist(sdist_directory, config_settings)
+    except getattr(backend, 'UnsupportedOperation', _DummyException):
+        raise GotUnsupportedOperation(traceback.format_exc())
+
+
+HOOK_NAMES = {
+    'get_requires_for_build_wheel',
+    'prepare_metadata_for_build_wheel',
+    'build_wheel',
+    'get_requires_for_build_sdist',
+    'build_sdist',
+}
+
+
+def main():
+    if len(sys.argv) < 3:
+        sys.exit("Needs args: hook_name, control_dir")
+    hook_name = sys.argv[1]
+    control_dir = sys.argv[2]
+    if hook_name not in HOOK_NAMES:
+        sys.exit("Unknown hook: %s" % hook_name)
+    hook = globals()[hook_name]
+
+    hook_input = read_json(pjoin(control_dir, 'input.json'))
+
+    json_out = {'unsupported': False, 'return_val': None}
+    try:
+        json_out['return_val'] = hook(**hook_input['kwargs'])
+    except BackendUnavailable as e:
+        json_out['no_backend'] = True
+        json_out['traceback'] = e.traceback
+    except BackendInvalid as e:
+        json_out['backend_invalid'] = True
+        json_out['backend_error'] = e.message
+    except GotUnsupportedOperation as e:
+        json_out['unsupported'] = True
+        json_out['traceback'] = e.traceback
+    except HookMissing:
+        json_out['hook_missing'] = True
+
+    write_json(json_out, pjoin(control_dir, 'output.json'), indent=2)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/build.py b/venv/Lib/site-packages/pip/_vendor/pep517/build.py
new file mode 100644
index 000000000..264301447
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/build.py
@@ -0,0 +1,124 @@
+"""Build a project using PEP 517 hooks.
+"""
+import argparse
+import logging
+import os
+from pip._vendor import toml
+import shutil
+
+from .envbuild import BuildEnvironment
+from .wrappers import Pep517HookCaller
+from .dirtools import tempdir, mkdir_p
+from .compat import FileNotFoundError
+
+log = logging.getLogger(__name__)
+
+
+def validate_system(system):
+    """
+    Ensure build system has the requisite fields.
+    """
+    required = {'requires', 'build-backend'}
+    if not (required <= set(system)):
+        message = "Missing required fields: {missing}".format(
+            missing=required-set(system),
+        )
+        raise ValueError(message)
+
+
+def load_system(source_dir):
+    """
+    Load the build system from a source dir (pyproject.toml).
+    """
+    pyproject = os.path.join(source_dir, 'pyproject.toml')
+    with open(pyproject) as f:
+        pyproject_data = toml.load(f)
+    return pyproject_data['build-system']
+
+
+def compat_system(source_dir):
+    """
+    Given a source dir, attempt to get a build system backend
+    and requirements from pyproject.toml. Fallback to
+    setuptools but only if the file was not found or a build
+    system was not indicated.
+    """
+    try:
+        system = load_system(source_dir)
+    except (FileNotFoundError, KeyError):
+        system = {}
+    system.setdefault(
+        'build-backend',
+        'setuptools.build_meta:__legacy__',
+    )
+    system.setdefault('requires', ['setuptools', 'wheel'])
+    return system
+
+
+def _do_build(hooks, env, dist, dest):
+    get_requires_name = 'get_requires_for_build_{dist}'.format(**locals())
+    get_requires = getattr(hooks, get_requires_name)
+    reqs = get_requires({})
+    log.info('Got build requires: %s', reqs)
+
+    env.pip_install(reqs)
+    log.info('Installed dynamic build dependencies')
+
+    with tempdir() as td:
+        log.info('Trying to build %s in %s', dist, td)
+        build_name = 'build_{dist}'.format(**locals())
+        build = getattr(hooks, build_name)
+        filename = build(td, {})
+        source = os.path.join(td, filename)
+        shutil.move(source, os.path.join(dest, os.path.basename(filename)))
+
+
+def build(source_dir, dist, dest=None, system=None):
+    system = system or load_system(source_dir)
+    dest = os.path.join(source_dir, dest or 'dist')
+    mkdir_p(dest)
+
+    validate_system(system)
+    hooks = Pep517HookCaller(
+        source_dir, system['build-backend'], system.get('backend-path')
+    )
+
+    with BuildEnvironment() as env:
+        env.pip_install(system['requires'])
+        _do_build(hooks, env, dist, dest)
+
+
+parser = argparse.ArgumentParser()
+parser.add_argument(
+    'source_dir',
+    help="A directory containing pyproject.toml",
+)
+parser.add_argument(
+    '--binary', '-b',
+    action='store_true',
+    default=False,
+)
+parser.add_argument(
+    '--source', '-s',
+    action='store_true',
+    default=False,
+)
+parser.add_argument(
+    '--out-dir', '-o',
+    help="Destination in which to save the builds relative to source dir",
+)
+
+
+def main(args):
+    # determine which dists to build
+    dists = list(filter(None, (
+        'sdist' if args.source or not args.binary else None,
+        'wheel' if args.binary or not args.source else None,
+    )))
+
+    for dist in dists:
+        build(args.source_dir, dist, args.out_dir)
+
+
+if __name__ == '__main__':
+    main(parser.parse_args())
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/check.py b/venv/Lib/site-packages/pip/_vendor/pep517/check.py
new file mode 100644
index 000000000..13e722a37
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/check.py
@@ -0,0 +1,203 @@
+"""Check a project and backend by attempting to build using PEP 517 hooks.
+"""
+import argparse
+import logging
+import os
+from os.path import isfile, join as pjoin
+from pip._vendor.toml import TomlDecodeError, load as toml_load
+import shutil
+from subprocess import CalledProcessError
+import sys
+import tarfile
+from tempfile import mkdtemp
+import zipfile
+
+from .colorlog import enable_colourful_output
+from .envbuild import BuildEnvironment
+from .wrappers import Pep517HookCaller
+
+log = logging.getLogger(__name__)
+
+
+def check_build_sdist(hooks, build_sys_requires):
+    with BuildEnvironment() as env:
+        try:
+            env.pip_install(build_sys_requires)
+            log.info('Installed static build dependencies')
+        except CalledProcessError:
+            log.error('Failed to install static build dependencies')
+            return False
+
+        try:
+            reqs = hooks.get_requires_for_build_sdist({})
+            log.info('Got build requires: %s', reqs)
+        except Exception:
+            log.error('Failure in get_requires_for_build_sdist', exc_info=True)
+            return False
+
+        try:
+            env.pip_install(reqs)
+            log.info('Installed dynamic build dependencies')
+        except CalledProcessError:
+            log.error('Failed to install dynamic build dependencies')
+            return False
+
+        td = mkdtemp()
+        log.info('Trying to build sdist in %s', td)
+        try:
+            try:
+                filename = hooks.build_sdist(td, {})
+                log.info('build_sdist returned %r', filename)
+            except Exception:
+                log.info('Failure in build_sdist', exc_info=True)
+                return False
+
+            if not filename.endswith('.tar.gz'):
+                log.error(
+                    "Filename %s doesn't have .tar.gz extension", filename)
+                return False
+
+            path = pjoin(td, filename)
+            if isfile(path):
+                log.info("Output file %s exists", path)
+            else:
+                log.error("Output file %s does not exist", path)
+                return False
+
+            if tarfile.is_tarfile(path):
+                log.info("Output file is a tar file")
+            else:
+                log.error("Output file is not a tar file")
+                return False
+
+        finally:
+            shutil.rmtree(td)
+
+        return True
+
+
+def check_build_wheel(hooks, build_sys_requires):
+    with BuildEnvironment() as env:
+        try:
+            env.pip_install(build_sys_requires)
+            log.info('Installed static build dependencies')
+        except CalledProcessError:
+            log.error('Failed to install static build dependencies')
+            return False
+
+        try:
+            reqs = hooks.get_requires_for_build_wheel({})
+            log.info('Got build requires: %s', reqs)
+        except Exception:
+            log.error('Failure in get_requires_for_build_sdist', exc_info=True)
+            return False
+
+        try:
+            env.pip_install(reqs)
+            log.info('Installed dynamic build dependencies')
+        except CalledProcessError:
+            log.error('Failed to install dynamic build dependencies')
+            return False
+
+        td = mkdtemp()
+        log.info('Trying to build wheel in %s', td)
+        try:
+            try:
+                filename = hooks.build_wheel(td, {})
+                log.info('build_wheel returned %r', filename)
+            except Exception:
+                log.info('Failure in build_wheel', exc_info=True)
+                return False
+
+            if not filename.endswith('.whl'):
+                log.error("Filename %s doesn't have .whl extension", filename)
+                return False
+
+            path = pjoin(td, filename)
+            if isfile(path):
+                log.info("Output file %s exists", path)
+            else:
+                log.error("Output file %s does not exist", path)
+                return False
+
+            if zipfile.is_zipfile(path):
+                log.info("Output file is a zip file")
+            else:
+                log.error("Output file is not a zip file")
+                return False
+
+        finally:
+            shutil.rmtree(td)
+
+        return True
+
+
+def check(source_dir):
+    pyproject = pjoin(source_dir, 'pyproject.toml')
+    if isfile(pyproject):
+        log.info('Found pyproject.toml')
+    else:
+        log.error('Missing pyproject.toml')
+        return False
+
+    try:
+        with open(pyproject) as f:
+            pyproject_data = toml_load(f)
+        # Ensure the mandatory data can be loaded
+        buildsys = pyproject_data['build-system']
+        requires = buildsys['requires']
+        backend = buildsys['build-backend']
+        backend_path = buildsys.get('backend-path')
+        log.info('Loaded pyproject.toml')
+    except (TomlDecodeError, KeyError):
+        log.error("Invalid pyproject.toml", exc_info=True)
+        return False
+
+    hooks = Pep517HookCaller(source_dir, backend, backend_path)
+
+    sdist_ok = check_build_sdist(hooks, requires)
+    wheel_ok = check_build_wheel(hooks, requires)
+
+    if not sdist_ok:
+        log.warning('Sdist checks failed; scroll up to see')
+    if not wheel_ok:
+        log.warning('Wheel checks failed')
+
+    return sdist_ok
+
+
+def main(argv=None):
+    ap = argparse.ArgumentParser()
+    ap.add_argument(
+        'source_dir',
+        help="A directory containing pyproject.toml")
+    args = ap.parse_args(argv)
+
+    enable_colourful_output()
+
+    ok = check(args.source_dir)
+
+    if ok:
+        print(ansi('Checks passed', 'green'))
+    else:
+        print(ansi('Checks failed', 'red'))
+        sys.exit(1)
+
+
+ansi_codes = {
+    'reset': '\x1b[0m',
+    'bold': '\x1b[1m',
+    'red': '\x1b[31m',
+    'green': '\x1b[32m',
+}
+
+
+def ansi(s, attr):
+    if os.name != 'nt' and sys.stdout.isatty():
+        return ansi_codes[attr] + str(s) + ansi_codes['reset']
+    else:
+        return str(s)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/colorlog.py b/venv/Lib/site-packages/pip/_vendor/pep517/colorlog.py
new file mode 100644
index 000000000..69c8a59d3
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/colorlog.py
@@ -0,0 +1,115 @@
+"""Nicer log formatting with colours.
+
+Code copied from Tornado, Apache licensed.
+"""
+# Copyright 2012 Facebook
+#
+# 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.
+
+import logging
+import sys
+
+try:
+    import curses
+except ImportError:
+    curses = None
+
+
+def _stderr_supports_color():
+    color = False
+    if curses and hasattr(sys.stderr, 'isatty') and sys.stderr.isatty():
+        try:
+            curses.setupterm()
+            if curses.tigetnum("colors") > 0:
+                color = True
+        except Exception:
+            pass
+    return color
+
+
+class LogFormatter(logging.Formatter):
+    """Log formatter with colour support
+    """
+    DEFAULT_COLORS = {
+        logging.INFO: 2,  # Green
+        logging.WARNING: 3,  # Yellow
+        logging.ERROR: 1,  # Red
+        logging.CRITICAL: 1,
+    }
+
+    def __init__(self, color=True, datefmt=None):
+        r"""
+        :arg bool color: Enables color support.
+        :arg string fmt: Log message format.
+        It will be applied to the attributes dict of log records. The
+        text between ``%(color)s`` and ``%(end_color)s`` will be colored
+        depending on the level if color support is on.
+        :arg dict colors: color mappings from logging level to terminal color
+        code
+        :arg string datefmt: Datetime format.
+        Used for formatting ``(asctime)`` placeholder in ``prefix_fmt``.
+        .. versionchanged:: 3.2
+        Added ``fmt`` and ``datefmt`` arguments.
+        """
+        logging.Formatter.__init__(self, datefmt=datefmt)
+        self._colors = {}
+        if color and _stderr_supports_color():
+            # The curses module has some str/bytes confusion in
+            # python3. Until version 3.2.3, most methods return
+            # bytes, but only accept strings. In addition, we want to
+            # output these strings with the logging module, which
+            # works with unicode strings. The explicit calls to
+            # unicode() below are harmless in python2 but will do the
+            # right conversion in python 3.
+            fg_color = (curses.tigetstr("setaf") or
+                        curses.tigetstr("setf") or "")
+            if (3, 0) < sys.version_info < (3, 2, 3):
+                fg_color = str(fg_color, "ascii")
+
+            for levelno, code in self.DEFAULT_COLORS.items():
+                self._colors[levelno] = str(
+                    curses.tparm(fg_color, code), "ascii")
+            self._normal = str(curses.tigetstr("sgr0"), "ascii")
+
+            scr = curses.initscr()
+            self.termwidth = scr.getmaxyx()[1]
+            curses.endwin()
+        else:
+            self._normal = ''
+            # Default width is usually 80, but too wide is
+            # worse than too narrow
+            self.termwidth = 70
+
+    def formatMessage(self, record):
+        mlen = len(record.message)
+        right_text = '{initial}-{name}'.format(initial=record.levelname[0],
+                                               name=record.name)
+        if mlen + len(right_text) < self.termwidth:
+            space = ' ' * (self.termwidth - (mlen + len(right_text)))
+        else:
+            space = '  '
+
+        if record.levelno in self._colors:
+            start_color = self._colors[record.levelno]
+            end_color = self._normal
+        else:
+            start_color = end_color = ''
+
+        return record.message + space + start_color + right_text + end_color
+
+
+def enable_colourful_output(level=logging.INFO):
+    handler = logging.StreamHandler()
+    handler.setFormatter(LogFormatter())
+    logging.root.addHandler(handler)
+    logging.root.setLevel(level)
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/compat.py b/venv/Lib/site-packages/pip/_vendor/pep517/compat.py
new file mode 100644
index 000000000..8432acb73
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/compat.py
@@ -0,0 +1,34 @@
+"""Python 2/3 compatibility"""
+import json
+import sys
+
+
+# Handle reading and writing JSON in UTF-8, on Python 3 and 2.
+
+if sys.version_info[0] >= 3:
+    # Python 3
+    def write_json(obj, path, **kwargs):
+        with open(path, 'w', encoding='utf-8') as f:
+            json.dump(obj, f, **kwargs)
+
+    def read_json(path):
+        with open(path, 'r', encoding='utf-8') as f:
+            return json.load(f)
+
+else:
+    # Python 2
+    def write_json(obj, path, **kwargs):
+        with open(path, 'wb') as f:
+            json.dump(obj, f, encoding='utf-8', **kwargs)
+
+    def read_json(path):
+        with open(path, 'rb') as f:
+            return json.load(f)
+
+
+# FileNotFoundError
+
+try:
+    FileNotFoundError = FileNotFoundError
+except NameError:
+    FileNotFoundError = IOError
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/dirtools.py b/venv/Lib/site-packages/pip/_vendor/pep517/dirtools.py
new file mode 100644
index 000000000..58c6ca0c5
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/dirtools.py
@@ -0,0 +1,44 @@
+import os
+import io
+import contextlib
+import tempfile
+import shutil
+import errno
+import zipfile
+
+
+@contextlib.contextmanager
+def tempdir():
+    """Create a temporary directory in a context manager."""
+    td = tempfile.mkdtemp()
+    try:
+        yield td
+    finally:
+        shutil.rmtree(td)
+
+
+def mkdir_p(*args, **kwargs):
+    """Like `mkdir`, but does not raise an exception if the
+    directory already exists.
+    """
+    try:
+        return os.mkdir(*args, **kwargs)
+    except OSError as exc:
+        if exc.errno != errno.EEXIST:
+            raise
+
+
+def dir_to_zipfile(root):
+    """Construct an in-memory zip file for a directory."""
+    buffer = io.BytesIO()
+    zip_file = zipfile.ZipFile(buffer, 'w')
+    for root, dirs, files in os.walk(root):
+        for path in dirs:
+            fs_path = os.path.join(root, path)
+            rel_path = os.path.relpath(fs_path, root)
+            zip_file.writestr(rel_path + '/', '')
+        for path in files:
+            fs_path = os.path.join(root, path)
+            rel_path = os.path.relpath(fs_path, root)
+            zip_file.write(fs_path, rel_path)
+    return zip_file
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/envbuild.py b/venv/Lib/site-packages/pip/_vendor/pep517/envbuild.py
new file mode 100644
index 000000000..4088dcdb4
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/envbuild.py
@@ -0,0 +1,167 @@
+"""Build wheels/sdists by installing build deps to a temporary environment.
+"""
+
+import os
+import logging
+from pip._vendor import toml
+import shutil
+from subprocess import check_call
+import sys
+from sysconfig import get_paths
+from tempfile import mkdtemp
+
+from .wrappers import Pep517HookCaller, LoggerWrapper
+
+log = logging.getLogger(__name__)
+
+
+def _load_pyproject(source_dir):
+    with open(os.path.join(source_dir, 'pyproject.toml')) as f:
+        pyproject_data = toml.load(f)
+    buildsys = pyproject_data['build-system']
+    return (
+        buildsys['requires'],
+        buildsys['build-backend'],
+        buildsys.get('backend-path'),
+    )
+
+
+class BuildEnvironment(object):
+    """Context manager to install build deps in a simple temporary environment
+
+    Based on code I wrote for pip, which is MIT licensed.
+    """
+    # Copyright (c) 2008-2016 The pip developers (see AUTHORS.txt file)
+    #
+    # Permission is hereby granted, free of charge, to any person obtaining
+    # a copy of this software and associated documentation files (the
+    # "Software"), to deal in the Software without restriction, including
+    # without limitation the rights to use, copy, modify, merge, publish,
+    # distribute, sublicense, and/or sell copies of the Software, and to
+    # permit persons to whom the Software is furnished to do so, subject to
+    # the following conditions:
+    #
+    # The above copyright notice and this permission notice shall be
+    # included in all copies or substantial portions of the Software.
+    #
+    # THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+    # EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+    # MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
+    # NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
+    # LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
+    # OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
+    # WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+
+    path = None
+
+    def __init__(self, cleanup=True):
+        self._cleanup = cleanup
+
+    def __enter__(self):
+        self.path = mkdtemp(prefix='pep517-build-env-')
+        log.info('Temporary build environment: %s', self.path)
+
+        self.save_path = os.environ.get('PATH', None)
+        self.save_pythonpath = os.environ.get('PYTHONPATH', None)
+
+        install_scheme = 'nt' if (os.name == 'nt') else 'posix_prefix'
+        install_dirs = get_paths(install_scheme, vars={
+            'base': self.path,
+            'platbase': self.path,
+        })
+
+        scripts = install_dirs['scripts']
+        if self.save_path:
+            os.environ['PATH'] = scripts + os.pathsep + self.save_path
+        else:
+            os.environ['PATH'] = scripts + os.pathsep + os.defpath
+
+        if install_dirs['purelib'] == install_dirs['platlib']:
+            lib_dirs = install_dirs['purelib']
+        else:
+            lib_dirs = install_dirs['purelib'] + os.pathsep + \
+                install_dirs['platlib']
+        if self.save_pythonpath:
+            os.environ['PYTHONPATH'] = lib_dirs + os.pathsep + \
+                self.save_pythonpath
+        else:
+            os.environ['PYTHONPATH'] = lib_dirs
+
+        return self
+
+    def pip_install(self, reqs):
+        """Install dependencies into this env by calling pip in a subprocess"""
+        if not reqs:
+            return
+        log.info('Calling pip to install %s', reqs)
+        cmd = [
+            sys.executable, '-m', 'pip', 'install', '--ignore-installed',
+            '--prefix', self.path] + list(reqs)
+        check_call(
+            cmd,
+            stdout=LoggerWrapper(log, logging.INFO),
+            stderr=LoggerWrapper(log, logging.ERROR),
+        )
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        needs_cleanup = (
+            self._cleanup and
+            self.path is not None and
+            os.path.isdir(self.path)
+        )
+        if needs_cleanup:
+            shutil.rmtree(self.path)
+
+        if self.save_path is None:
+            os.environ.pop('PATH', None)
+        else:
+            os.environ['PATH'] = self.save_path
+
+        if self.save_pythonpath is None:
+            os.environ.pop('PYTHONPATH', None)
+        else:
+            os.environ['PYTHONPATH'] = self.save_pythonpath
+
+
+def build_wheel(source_dir, wheel_dir, config_settings=None):
+    """Build a wheel from a source directory using PEP 517 hooks.
+
+    :param str source_dir: Source directory containing pyproject.toml
+    :param str wheel_dir: Target directory to create wheel in
+    :param dict config_settings: Options to pass to build backend
+
+    This is a blocking function which will run pip in a subprocess to install
+    build requirements.
+    """
+    if config_settings is None:
+        config_settings = {}
+    requires, backend, backend_path = _load_pyproject(source_dir)
+    hooks = Pep517HookCaller(source_dir, backend, backend_path)
+
+    with BuildEnvironment() as env:
+        env.pip_install(requires)
+        reqs = hooks.get_requires_for_build_wheel(config_settings)
+        env.pip_install(reqs)
+        return hooks.build_wheel(wheel_dir, config_settings)
+
+
+def build_sdist(source_dir, sdist_dir, config_settings=None):
+    """Build an sdist from a source directory using PEP 517 hooks.
+
+    :param str source_dir: Source directory containing pyproject.toml
+    :param str sdist_dir: Target directory to place sdist in
+    :param dict config_settings: Options to pass to build backend
+
+    This is a blocking function which will run pip in a subprocess to install
+    build requirements.
+    """
+    if config_settings is None:
+        config_settings = {}
+    requires, backend, backend_path = _load_pyproject(source_dir)
+    hooks = Pep517HookCaller(source_dir, backend, backend_path)
+
+    with BuildEnvironment() as env:
+        env.pip_install(requires)
+        reqs = hooks.get_requires_for_build_sdist(config_settings)
+        env.pip_install(reqs)
+        return hooks.build_sdist(sdist_dir, config_settings)
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/meta.py b/venv/Lib/site-packages/pip/_vendor/pep517/meta.py
new file mode 100644
index 000000000..d525de5c6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/meta.py
@@ -0,0 +1,92 @@
+"""Build metadata for a project using PEP 517 hooks.
+"""
+import argparse
+import logging
+import os
+import shutil
+import functools
+
+try:
+    import importlib.metadata as imp_meta
+except ImportError:
+    import importlib_metadata as imp_meta
+
+try:
+    from zipfile import Path
+except ImportError:
+    from zipp import Path
+
+from .envbuild import BuildEnvironment
+from .wrappers import Pep517HookCaller, quiet_subprocess_runner
+from .dirtools import tempdir, mkdir_p, dir_to_zipfile
+from .build import validate_system, load_system, compat_system
+
+log = logging.getLogger(__name__)
+
+
+def _prep_meta(hooks, env, dest):
+    reqs = hooks.get_requires_for_build_wheel({})
+    log.info('Got build requires: %s', reqs)
+
+    env.pip_install(reqs)
+    log.info('Installed dynamic build dependencies')
+
+    with tempdir() as td:
+        log.info('Trying to build metadata in %s', td)
+        filename = hooks.prepare_metadata_for_build_wheel(td, {})
+        source = os.path.join(td, filename)
+        shutil.move(source, os.path.join(dest, os.path.basename(filename)))
+
+
+def build(source_dir='.', dest=None, system=None):
+    system = system or load_system(source_dir)
+    dest = os.path.join(source_dir, dest or 'dist')
+    mkdir_p(dest)
+    validate_system(system)
+    hooks = Pep517HookCaller(
+        source_dir, system['build-backend'], system.get('backend-path')
+    )
+
+    with hooks.subprocess_runner(quiet_subprocess_runner):
+        with BuildEnvironment() as env:
+            env.pip_install(system['requires'])
+            _prep_meta(hooks, env, dest)
+
+
+def build_as_zip(builder=build):
+    with tempdir() as out_dir:
+        builder(dest=out_dir)
+        return dir_to_zipfile(out_dir)
+
+
+def load(root):
+    """
+    Given a source directory (root) of a package,
+    return an importlib.metadata.Distribution object
+    with metadata build from that package.
+    """
+    root = os.path.expanduser(root)
+    system = compat_system(root)
+    builder = functools.partial(build, source_dir=root, system=system)
+    path = Path(build_as_zip(builder))
+    return imp_meta.PathDistribution(path)
+
+
+parser = argparse.ArgumentParser()
+parser.add_argument(
+    'source_dir',
+    help="A directory containing pyproject.toml",
+)
+parser.add_argument(
+    '--out-dir', '-o',
+    help="Destination in which to save the builds relative to source dir",
+)
+
+
+def main():
+    args = parser.parse_args()
+    build(args.source_dir, args.out_dir)
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/pep517/wrappers.py b/venv/Lib/site-packages/pip/_vendor/pep517/wrappers.py
new file mode 100644
index 000000000..00a3d1a78
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pep517/wrappers.py
@@ -0,0 +1,308 @@
+import threading
+from contextlib import contextmanager
+import os
+from os.path import dirname, abspath, join as pjoin
+import shutil
+from subprocess import check_call, check_output, STDOUT
+import sys
+from tempfile import mkdtemp
+
+from . import compat
+
+
+try:
+    import importlib.resources as resources
+
+    def _in_proc_script_path():
+        return resources.path(__package__, '_in_process.py')
+except ImportError:
+    @contextmanager
+    def _in_proc_script_path():
+        yield pjoin(dirname(abspath(__file__)), '_in_process.py')
+
+
+@contextmanager
+def tempdir():
+    td = mkdtemp()
+    try:
+        yield td
+    finally:
+        shutil.rmtree(td)
+
+
+class BackendUnavailable(Exception):
+    """Will be raised if the backend cannot be imported in the hook process."""
+    def __init__(self, traceback):
+        self.traceback = traceback
+
+
+class BackendInvalid(Exception):
+    """Will be raised if the backend is invalid."""
+    def __init__(self, backend_name, backend_path, message):
+        self.backend_name = backend_name
+        self.backend_path = backend_path
+        self.message = message
+
+
+class HookMissing(Exception):
+    """Will be raised on missing hooks."""
+    def __init__(self, hook_name):
+        super(HookMissing, self).__init__(hook_name)
+        self.hook_name = hook_name
+
+
+class UnsupportedOperation(Exception):
+    """May be raised by build_sdist if the backend indicates that it can't."""
+    def __init__(self, traceback):
+        self.traceback = traceback
+
+
+def default_subprocess_runner(cmd, cwd=None, extra_environ=None):
+    """The default method of calling the wrapper subprocess."""
+    env = os.environ.copy()
+    if extra_environ:
+        env.update(extra_environ)
+
+    check_call(cmd, cwd=cwd, env=env)
+
+
+def quiet_subprocess_runner(cmd, cwd=None, extra_environ=None):
+    """A method of calling the wrapper subprocess while suppressing output."""
+    env = os.environ.copy()
+    if extra_environ:
+        env.update(extra_environ)
+
+    check_output(cmd, cwd=cwd, env=env, stderr=STDOUT)
+
+
+def norm_and_check(source_tree, requested):
+    """Normalise and check a backend path.
+
+    Ensure that the requested backend path is specified as a relative path,
+    and resolves to a location under the given source tree.
+
+    Return an absolute version of the requested path.
+    """
+    if os.path.isabs(requested):
+        raise ValueError("paths must be relative")
+
+    abs_source = os.path.abspath(source_tree)
+    abs_requested = os.path.normpath(os.path.join(abs_source, requested))
+    # We have to use commonprefix for Python 2.7 compatibility. So we
+    # normalise case to avoid problems because commonprefix is a character
+    # based comparison :-(
+    norm_source = os.path.normcase(abs_source)
+    norm_requested = os.path.normcase(abs_requested)
+    if os.path.commonprefix([norm_source, norm_requested]) != norm_source:
+        raise ValueError("paths must be inside source tree")
+
+    return abs_requested
+
+
+class Pep517HookCaller(object):
+    """A wrapper around a source directory to be built with a PEP 517 backend.
+
+    source_dir : The path to the source directory, containing pyproject.toml.
+    build_backend : The build backend spec, as per PEP 517, from
+        pyproject.toml.
+    backend_path : The backend path, as per PEP 517, from pyproject.toml.
+    runner : A callable that invokes the wrapper subprocess.
+
+    The 'runner', if provided, must expect the following:
+        cmd : a list of strings representing the command and arguments to
+            execute, as would be passed to e.g. 'subprocess.check_call'.
+        cwd : a string representing the working directory that must be
+            used for the subprocess. Corresponds to the provided source_dir.
+        extra_environ : a dict mapping environment variable names to values
+            which must be set for the subprocess execution.
+    """
+    def __init__(
+            self,
+            source_dir,
+            build_backend,
+            backend_path=None,
+            runner=None,
+    ):
+        if runner is None:
+            runner = default_subprocess_runner
+
+        self.source_dir = abspath(source_dir)
+        self.build_backend = build_backend
+        if backend_path:
+            backend_path = [
+                norm_and_check(self.source_dir, p) for p in backend_path
+            ]
+        self.backend_path = backend_path
+        self._subprocess_runner = runner
+
+    @contextmanager
+    def subprocess_runner(self, runner):
+        """A context manager for temporarily overriding the default subprocess
+        runner.
+        """
+        prev = self._subprocess_runner
+        self._subprocess_runner = runner
+        try:
+            yield
+        finally:
+            self._subprocess_runner = prev
+
+    def get_requires_for_build_wheel(self, config_settings=None):
+        """Identify packages required for building a wheel
+
+        Returns a list of dependency specifications, e.g.:
+            ["wheel >= 0.25", "setuptools"]
+
+        This does not include requirements specified in pyproject.toml.
+        It returns the result of calling the equivalently named hook in a
+        subprocess.
+        """
+        return self._call_hook('get_requires_for_build_wheel', {
+            'config_settings': config_settings
+        })
+
+    def prepare_metadata_for_build_wheel(
+            self, metadata_directory, config_settings=None,
+            _allow_fallback=True):
+        """Prepare a *.dist-info folder with metadata for this project.
+
+        Returns the name of the newly created folder.
+
+        If the build backend defines a hook with this name, it will be called
+        in a subprocess. If not, the backend will be asked to build a wheel,
+        and the dist-info extracted from that (unless _allow_fallback is
+        False).
+        """
+        return self._call_hook('prepare_metadata_for_build_wheel', {
+            'metadata_directory': abspath(metadata_directory),
+            'config_settings': config_settings,
+            '_allow_fallback': _allow_fallback,
+        })
+
+    def build_wheel(
+            self, wheel_directory, config_settings=None,
+            metadata_directory=None):
+        """Build a wheel from this project.
+
+        Returns the name of the newly created file.
+
+        In general, this will call the 'build_wheel' hook in the backend.
+        However, if that was previously called by
+        'prepare_metadata_for_build_wheel', and the same metadata_directory is
+        used, the previously built wheel will be copied to wheel_directory.
+        """
+        if metadata_directory is not None:
+            metadata_directory = abspath(metadata_directory)
+        return self._call_hook('build_wheel', {
+            'wheel_directory': abspath(wheel_directory),
+            'config_settings': config_settings,
+            'metadata_directory': metadata_directory,
+        })
+
+    def get_requires_for_build_sdist(self, config_settings=None):
+        """Identify packages required for building a wheel
+
+        Returns a list of dependency specifications, e.g.:
+            ["setuptools >= 26"]
+
+        This does not include requirements specified in pyproject.toml.
+        It returns the result of calling the equivalently named hook in a
+        subprocess.
+        """
+        return self._call_hook('get_requires_for_build_sdist', {
+            'config_settings': config_settings
+        })
+
+    def build_sdist(self, sdist_directory, config_settings=None):
+        """Build an sdist from this project.
+
+        Returns the name of the newly created file.
+
+        This calls the 'build_sdist' backend hook in a subprocess.
+        """
+        return self._call_hook('build_sdist', {
+            'sdist_directory': abspath(sdist_directory),
+            'config_settings': config_settings,
+        })
+
+    def _call_hook(self, hook_name, kwargs):
+        # On Python 2, pytoml returns Unicode values (which is correct) but the
+        # environment passed to check_call needs to contain string values. We
+        # convert here by encoding using ASCII (the backend can only contain
+        # letters, digits and _, . and : characters, and will be used as a
+        # Python identifier, so non-ASCII content is wrong on Python 2 in
+        # any case).
+        # For backend_path, we use sys.getfilesystemencoding.
+        if sys.version_info[0] == 2:
+            build_backend = self.build_backend.encode('ASCII')
+        else:
+            build_backend = self.build_backend
+        extra_environ = {'PEP517_BUILD_BACKEND': build_backend}
+
+        if self.backend_path:
+            backend_path = os.pathsep.join(self.backend_path)
+            if sys.version_info[0] == 2:
+                backend_path = backend_path.encode(sys.getfilesystemencoding())
+            extra_environ['PEP517_BACKEND_PATH'] = backend_path
+
+        with tempdir() as td:
+            hook_input = {'kwargs': kwargs}
+            compat.write_json(hook_input, pjoin(td, 'input.json'),
+                              indent=2)
+
+            # Run the hook in a subprocess
+            with _in_proc_script_path() as script:
+                self._subprocess_runner(
+                    [sys.executable, str(script), hook_name, td],
+                    cwd=self.source_dir,
+                    extra_environ=extra_environ
+                )
+
+            data = compat.read_json(pjoin(td, 'output.json'))
+            if data.get('unsupported'):
+                raise UnsupportedOperation(data.get('traceback', ''))
+            if data.get('no_backend'):
+                raise BackendUnavailable(data.get('traceback', ''))
+            if data.get('backend_invalid'):
+                raise BackendInvalid(
+                    backend_name=self.build_backend,
+                    backend_path=self.backend_path,
+                    message=data.get('backend_error', '')
+                )
+            if data.get('hook_missing'):
+                raise HookMissing(hook_name)
+            return data['return_val']
+
+
+class LoggerWrapper(threading.Thread):
+    """
+    Read messages from a pipe and redirect them
+    to a logger (see python's logging module).
+    """
+
+    def __init__(self, logger, level):
+        threading.Thread.__init__(self)
+        self.daemon = True
+
+        self.logger = logger
+        self.level = level
+
+        # create the pipe and reader
+        self.fd_read, self.fd_write = os.pipe()
+        self.reader = os.fdopen(self.fd_read)
+
+        self.start()
+
+    def fileno(self):
+        return self.fd_write
+
+    @staticmethod
+    def remove_newline(msg):
+        return msg[:-1] if msg.endswith(os.linesep) else msg
+
+    def run(self):
+        for line in self.reader:
+            self._write(self.remove_newline(line))
+
+    def _write(self, message):
+        self.logger.log(self.level, message)
diff --git a/venv/Lib/site-packages/pip/_vendor/pkg_resources/__init__.py b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__init__.py
new file mode 100644
index 000000000..a457ff27e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__init__.py
@@ -0,0 +1,3296 @@
+# coding: utf-8
+"""
+Package resource API
+--------------------
+
+A resource is a logical file contained within a package, or a logical
+subdirectory thereof.  The package resource API expects resource names
+to have their path parts separated with ``/``, *not* whatever the local
+path separator is.  Do not use os.path operations to manipulate resource
+names being passed into the API.
+
+The package resource API is designed to work with normal filesystem packages,
+.egg files, and unpacked .egg files.  It can also work in a limited way with
+.zip files and with custom PEP 302 loaders that support the ``get_data()``
+method.
+"""
+
+from __future__ import absolute_import
+
+import sys
+import os
+import io
+import time
+import re
+import types
+import zipfile
+import zipimport
+import warnings
+import stat
+import functools
+import pkgutil
+import operator
+import platform
+import collections
+import plistlib
+import email.parser
+import errno
+import tempfile
+import textwrap
+import itertools
+import inspect
+import ntpath
+import posixpath
+from pkgutil import get_importer
+
+try:
+    import _imp
+except ImportError:
+    # Python 3.2 compatibility
+    import imp as _imp
+
+try:
+    FileExistsError
+except NameError:
+    FileExistsError = OSError
+
+from pip._vendor import six
+from pip._vendor.six.moves import urllib, map, filter
+
+# capture these to bypass sandboxing
+from os import utime
+try:
+    from os import mkdir, rename, unlink
+    WRITE_SUPPORT = True
+except ImportError:
+    # no write support, probably under GAE
+    WRITE_SUPPORT = False
+
+from os import open as os_open
+from os.path import isdir, split
+
+try:
+    import importlib.machinery as importlib_machinery
+    # access attribute to force import under delayed import mechanisms.
+    importlib_machinery.__name__
+except ImportError:
+    importlib_machinery = None
+
+from . import py31compat
+from pip._vendor import appdirs
+from pip._vendor import packaging
+__import__('pip._vendor.packaging.version')
+__import__('pip._vendor.packaging.specifiers')
+__import__('pip._vendor.packaging.requirements')
+__import__('pip._vendor.packaging.markers')
+
+
+__metaclass__ = type
+
+
+if (3, 0) < sys.version_info < (3, 5):
+    raise RuntimeError("Python 3.5 or later is required")
+
+if six.PY2:
+    # Those builtin exceptions are only defined in Python 3
+    PermissionError = None
+    NotADirectoryError = None
+
+# declare some globals that will be defined later to
+# satisfy the linters.
+require = None
+working_set = None
+add_activation_listener = None
+resources_stream = None
+cleanup_resources = None
+resource_dir = None
+resource_stream = None
+set_extraction_path = None
+resource_isdir = None
+resource_string = None
+iter_entry_points = None
+resource_listdir = None
+resource_filename = None
+resource_exists = None
+_distribution_finders = None
+_namespace_handlers = None
+_namespace_packages = None
+
+
+class PEP440Warning(RuntimeWarning):
+    """
+    Used when there is an issue with a version or specifier not complying with
+    PEP 440.
+    """
+
+
+def parse_version(v):
+    try:
+        return packaging.version.Version(v)
+    except packaging.version.InvalidVersion:
+        return packaging.version.LegacyVersion(v)
+
+
+_state_vars = {}
+
+
+def _declare_state(vartype, **kw):
+    globals().update(kw)
+    _state_vars.update(dict.fromkeys(kw, vartype))
+
+
+def __getstate__():
+    state = {}
+    g = globals()
+    for k, v in _state_vars.items():
+        state[k] = g['_sget_' + v](g[k])
+    return state
+
+
+def __setstate__(state):
+    g = globals()
+    for k, v in state.items():
+        g['_sset_' + _state_vars[k]](k, g[k], v)
+    return state
+
+
+def _sget_dict(val):
+    return val.copy()
+
+
+def _sset_dict(key, ob, state):
+    ob.clear()
+    ob.update(state)
+
+
+def _sget_object(val):
+    return val.__getstate__()
+
+
+def _sset_object(key, ob, state):
+    ob.__setstate__(state)
+
+
+_sget_none = _sset_none = lambda *args: None
+
+
+def get_supported_platform():
+    """Return this platform's maximum compatible version.
+
+    distutils.util.get_platform() normally reports the minimum version
+    of Mac OS X that would be required to *use* extensions produced by
+    distutils.  But what we want when checking compatibility is to know the
+    version of Mac OS X that we are *running*.  To allow usage of packages that
+    explicitly require a newer version of Mac OS X, we must also know the
+    current version of the OS.
+
+    If this condition occurs for any other platform with a version in its
+    platform strings, this function should be extended accordingly.
+    """
+    plat = get_build_platform()
+    m = macosVersionString.match(plat)
+    if m is not None and sys.platform == "darwin":
+        try:
+            plat = 'macosx-%s-%s' % ('.'.join(_macosx_vers()[:2]), m.group(3))
+        except ValueError:
+            # not Mac OS X
+            pass
+    return plat
+
+
+__all__ = [
+    # Basic resource access and distribution/entry point discovery
+    'require', 'run_script', 'get_provider', 'get_distribution',
+    'load_entry_point', 'get_entry_map', 'get_entry_info',
+    'iter_entry_points',
+    'resource_string', 'resource_stream', 'resource_filename',
+    'resource_listdir', 'resource_exists', 'resource_isdir',
+
+    # Environmental control
+    'declare_namespace', 'working_set', 'add_activation_listener',
+    'find_distributions', 'set_extraction_path', 'cleanup_resources',
+    'get_default_cache',
+
+    # Primary implementation classes
+    'Environment', 'WorkingSet', 'ResourceManager',
+    'Distribution', 'Requirement', 'EntryPoint',
+
+    # Exceptions
+    'ResolutionError', 'VersionConflict', 'DistributionNotFound',
+    'UnknownExtra', 'ExtractionError',
+
+    # Warnings
+    'PEP440Warning',
+
+    # Parsing functions and string utilities
+    'parse_requirements', 'parse_version', 'safe_name', 'safe_version',
+    'get_platform', 'compatible_platforms', 'yield_lines', 'split_sections',
+    'safe_extra', 'to_filename', 'invalid_marker', 'evaluate_marker',
+
+    # filesystem utilities
+    'ensure_directory', 'normalize_path',
+
+    # Distribution "precedence" constants
+    'EGG_DIST', 'BINARY_DIST', 'SOURCE_DIST', 'CHECKOUT_DIST', 'DEVELOP_DIST',
+
+    # "Provider" interfaces, implementations, and registration/lookup APIs
+    'IMetadataProvider', 'IResourceProvider', 'FileMetadata',
+    'PathMetadata', 'EggMetadata', 'EmptyProvider', 'empty_provider',
+    'NullProvider', 'EggProvider', 'DefaultProvider', 'ZipProvider',
+    'register_finder', 'register_namespace_handler', 'register_loader_type',
+    'fixup_namespace_packages', 'get_importer',
+
+    # Warnings
+    'PkgResourcesDeprecationWarning',
+
+    # Deprecated/backward compatibility only
+    'run_main', 'AvailableDistributions',
+]
+
+
+class ResolutionError(Exception):
+    """Abstract base for dependency resolution errors"""
+
+    def __repr__(self):
+        return self.__class__.__name__ + repr(self.args)
+
+
+class VersionConflict(ResolutionError):
+    """
+    An already-installed version conflicts with the requested version.
+
+    Should be initialized with the installed Distribution and the requested
+    Requirement.
+    """
+
+    _template = "{self.dist} is installed but {self.req} is required"
+
+    @property
+    def dist(self):
+        return self.args[0]
+
+    @property
+    def req(self):
+        return self.args[1]
+
+    def report(self):
+        return self._template.format(**locals())
+
+    def with_context(self, required_by):
+        """
+        If required_by is non-empty, return a version of self that is a
+        ContextualVersionConflict.
+        """
+        if not required_by:
+            return self
+        args = self.args + (required_by,)
+        return ContextualVersionConflict(*args)
+
+
+class ContextualVersionConflict(VersionConflict):
+    """
+    A VersionConflict that accepts a third parameter, the set of the
+    requirements that required the installed Distribution.
+    """
+
+    _template = VersionConflict._template + ' by {self.required_by}'
+
+    @property
+    def required_by(self):
+        return self.args[2]
+
+
+class DistributionNotFound(ResolutionError):
+    """A requested distribution was not found"""
+
+    _template = ("The '{self.req}' distribution was not found "
+                 "and is required by {self.requirers_str}")
+
+    @property
+    def req(self):
+        return self.args[0]
+
+    @property
+    def requirers(self):
+        return self.args[1]
+
+    @property
+    def requirers_str(self):
+        if not self.requirers:
+            return 'the application'
+        return ', '.join(self.requirers)
+
+    def report(self):
+        return self._template.format(**locals())
+
+    def __str__(self):
+        return self.report()
+
+
+class UnknownExtra(ResolutionError):
+    """Distribution doesn't have an "extra feature" of the given name"""
+
+
+_provider_factories = {}
+
+PY_MAJOR = '{}.{}'.format(*sys.version_info)
+EGG_DIST = 3
+BINARY_DIST = 2
+SOURCE_DIST = 1
+CHECKOUT_DIST = 0
+DEVELOP_DIST = -1
+
+
+def register_loader_type(loader_type, provider_factory):
+    """Register `provider_factory` to make providers for `loader_type`
+
+    `loader_type` is the type or class of a PEP 302 ``module.__loader__``,
+    and `provider_factory` is a function that, passed a *module* object,
+    returns an ``IResourceProvider`` for that module.
+    """
+    _provider_factories[loader_type] = provider_factory
+
+
+def get_provider(moduleOrReq):
+    """Return an IResourceProvider for the named module or requirement"""
+    if isinstance(moduleOrReq, Requirement):
+        return working_set.find(moduleOrReq) or require(str(moduleOrReq))[0]
+    try:
+        module = sys.modules[moduleOrReq]
+    except KeyError:
+        __import__(moduleOrReq)
+        module = sys.modules[moduleOrReq]
+    loader = getattr(module, '__loader__', None)
+    return _find_adapter(_provider_factories, loader)(module)
+
+
+def _macosx_vers(_cache=[]):
+    if not _cache:
+        version = platform.mac_ver()[0]
+        # fallback for MacPorts
+        if version == '':
+            plist = '/System/Library/CoreServices/SystemVersion.plist'
+            if os.path.exists(plist):
+                if hasattr(plistlib, 'readPlist'):
+                    plist_content = plistlib.readPlist(plist)
+                    if 'ProductVersion' in plist_content:
+                        version = plist_content['ProductVersion']
+
+        _cache.append(version.split('.'))
+    return _cache[0]
+
+
+def _macosx_arch(machine):
+    return {'PowerPC': 'ppc', 'Power_Macintosh': 'ppc'}.get(machine, machine)
+
+
+def get_build_platform():
+    """Return this platform's string for platform-specific distributions
+
+    XXX Currently this is the same as ``distutils.util.get_platform()``, but it
+    needs some hacks for Linux and Mac OS X.
+    """
+    from sysconfig import get_platform
+
+    plat = get_platform()
+    if sys.platform == "darwin" and not plat.startswith('macosx-'):
+        try:
+            version = _macosx_vers()
+            machine = os.uname()[4].replace(" ", "_")
+            return "macosx-%d.%d-%s" % (
+                int(version[0]), int(version[1]),
+                _macosx_arch(machine),
+            )
+        except ValueError:
+            # if someone is running a non-Mac darwin system, this will fall
+            # through to the default implementation
+            pass
+    return plat
+
+
+macosVersionString = re.compile(r"macosx-(\d+)\.(\d+)-(.*)")
+darwinVersionString = re.compile(r"darwin-(\d+)\.(\d+)\.(\d+)-(.*)")
+# XXX backward compat
+get_platform = get_build_platform
+
+
+def compatible_platforms(provided, required):
+    """Can code for the `provided` platform run on the `required` platform?
+
+    Returns true if either platform is ``None``, or the platforms are equal.
+
+    XXX Needs compatibility checks for Linux and other unixy OSes.
+    """
+    if provided is None or required is None or provided == required:
+        # easy case
+        return True
+
+    # Mac OS X special cases
+    reqMac = macosVersionString.match(required)
+    if reqMac:
+        provMac = macosVersionString.match(provided)
+
+        # is this a Mac package?
+        if not provMac:
+            # this is backwards compatibility for packages built before
+            # setuptools 0.6. All packages built after this point will
+            # use the new macosx designation.
+            provDarwin = darwinVersionString.match(provided)
+            if provDarwin:
+                dversion = int(provDarwin.group(1))
+                macosversion = "%s.%s" % (reqMac.group(1), reqMac.group(2))
+                if dversion == 7 and macosversion >= "10.3" or \
+                        dversion == 8 and macosversion >= "10.4":
+                    return True
+            # egg isn't macosx or legacy darwin
+            return False
+
+        # are they the same major version and machine type?
+        if provMac.group(1) != reqMac.group(1) or \
+                provMac.group(3) != reqMac.group(3):
+            return False
+
+        # is the required OS major update >= the provided one?
+        if int(provMac.group(2)) > int(reqMac.group(2)):
+            return False
+
+        return True
+
+    # XXX Linux and other platforms' special cases should go here
+    return False
+
+
+def run_script(dist_spec, script_name):
+    """Locate distribution `dist_spec` and run its `script_name` script"""
+    ns = sys._getframe(1).f_globals
+    name = ns['__name__']
+    ns.clear()
+    ns['__name__'] = name
+    require(dist_spec)[0].run_script(script_name, ns)
+
+
+# backward compatibility
+run_main = run_script
+
+
+def get_distribution(dist):
+    """Return a current distribution object for a Requirement or string"""
+    if isinstance(dist, six.string_types):
+        dist = Requirement.parse(dist)
+    if isinstance(dist, Requirement):
+        dist = get_provider(dist)
+    if not isinstance(dist, Distribution):
+        raise TypeError("Expected string, Requirement, or Distribution", dist)
+    return dist
+
+
+def load_entry_point(dist, group, name):
+    """Return `name` entry point of `group` for `dist` or raise ImportError"""
+    return get_distribution(dist).load_entry_point(group, name)
+
+
+def get_entry_map(dist, group=None):
+    """Return the entry point map for `group`, or the full entry map"""
+    return get_distribution(dist).get_entry_map(group)
+
+
+def get_entry_info(dist, group, name):
+    """Return the EntryPoint object for `group`+`name`, or ``None``"""
+    return get_distribution(dist).get_entry_info(group, name)
+
+
+class IMetadataProvider:
+    def has_metadata(name):
+        """Does the package's distribution contain the named metadata?"""
+
+    def get_metadata(name):
+        """The named metadata resource as a string"""
+
+    def get_metadata_lines(name):
+        """Yield named metadata resource as list of non-blank non-comment lines
+
+       Leading and trailing whitespace is stripped from each line, and lines
+       with ``#`` as the first non-blank character are omitted."""
+
+    def metadata_isdir(name):
+        """Is the named metadata a directory?  (like ``os.path.isdir()``)"""
+
+    def metadata_listdir(name):
+        """List of metadata names in the directory (like ``os.listdir()``)"""
+
+    def run_script(script_name, namespace):
+        """Execute the named script in the supplied namespace dictionary"""
+
+
+class IResourceProvider(IMetadataProvider):
+    """An object that provides access to package resources"""
+
+    def get_resource_filename(manager, resource_name):
+        """Return a true filesystem path for `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def get_resource_stream(manager, resource_name):
+        """Return a readable file-like object for `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def get_resource_string(manager, resource_name):
+        """Return a string containing the contents of `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def has_resource(resource_name):
+        """Does the package contain the named resource?"""
+
+    def resource_isdir(resource_name):
+        """Is the named resource a directory?  (like ``os.path.isdir()``)"""
+
+    def resource_listdir(resource_name):
+        """List of resource names in the directory (like ``os.listdir()``)"""
+
+
+class WorkingSet:
+    """A collection of active distributions on sys.path (or a similar list)"""
+
+    def __init__(self, entries=None):
+        """Create working set from list of path entries (default=sys.path)"""
+        self.entries = []
+        self.entry_keys = {}
+        self.by_key = {}
+        self.callbacks = []
+
+        if entries is None:
+            entries = sys.path
+
+        for entry in entries:
+            self.add_entry(entry)
+
+    @classmethod
+    def _build_master(cls):
+        """
+        Prepare the master working set.
+        """
+        ws = cls()
+        try:
+            from __main__ import __requires__
+        except ImportError:
+            # The main program does not list any requirements
+            return ws
+
+        # ensure the requirements are met
+        try:
+            ws.require(__requires__)
+        except VersionConflict:
+            return cls._build_from_requirements(__requires__)
+
+        return ws
+
+    @classmethod
+    def _build_from_requirements(cls, req_spec):
+        """
+        Build a working set from a requirement spec. Rewrites sys.path.
+        """
+        # try it without defaults already on sys.path
+        # by starting with an empty path
+        ws = cls([])
+        reqs = parse_requirements(req_spec)
+        dists = ws.resolve(reqs, Environment())
+        for dist in dists:
+            ws.add(dist)
+
+        # add any missing entries from sys.path
+        for entry in sys.path:
+            if entry not in ws.entries:
+                ws.add_entry(entry)
+
+        # then copy back to sys.path
+        sys.path[:] = ws.entries
+        return ws
+
+    def add_entry(self, entry):
+        """Add a path item to ``.entries``, finding any distributions on it
+
+        ``find_distributions(entry, True)`` is used to find distributions
+        corresponding to the path entry, and they are added.  `entry` is
+        always appended to ``.entries``, even if it is already present.
+        (This is because ``sys.path`` can contain the same value more than
+        once, and the ``.entries`` of the ``sys.path`` WorkingSet should always
+        equal ``sys.path``.)
+        """
+        self.entry_keys.setdefault(entry, [])
+        self.entries.append(entry)
+        for dist in find_distributions(entry, True):
+            self.add(dist, entry, False)
+
+    def __contains__(self, dist):
+        """True if `dist` is the active distribution for its project"""
+        return self.by_key.get(dist.key) == dist
+
+    def find(self, req):
+        """Find a distribution matching requirement `req`
+
+        If there is an active distribution for the requested project, this
+        returns it as long as it meets the version requirement specified by
+        `req`.  But, if there is an active distribution for the project and it
+        does *not* meet the `req` requirement, ``VersionConflict`` is raised.
+        If there is no active distribution for the requested project, ``None``
+        is returned.
+        """
+        dist = self.by_key.get(req.key)
+        if dist is not None and dist not in req:
+            # XXX add more info
+            raise VersionConflict(dist, req)
+        return dist
+
+    def iter_entry_points(self, group, name=None):
+        """Yield entry point objects from `group` matching `name`
+
+        If `name` is None, yields all entry points in `group` from all
+        distributions in the working set, otherwise only ones matching
+        both `group` and `name` are yielded (in distribution order).
+        """
+        return (
+            entry
+            for dist in self
+            for entry in dist.get_entry_map(group).values()
+            if name is None or name == entry.name
+        )
+
+    def run_script(self, requires, script_name):
+        """Locate distribution for `requires` and run `script_name` script"""
+        ns = sys._getframe(1).f_globals
+        name = ns['__name__']
+        ns.clear()
+        ns['__name__'] = name
+        self.require(requires)[0].run_script(script_name, ns)
+
+    def __iter__(self):
+        """Yield distributions for non-duplicate projects in the working set
+
+        The yield order is the order in which the items' path entries were
+        added to the working set.
+        """
+        seen = {}
+        for item in self.entries:
+            if item not in self.entry_keys:
+                # workaround a cache issue
+                continue
+
+            for key in self.entry_keys[item]:
+                if key not in seen:
+                    seen[key] = 1
+                    yield self.by_key[key]
+
+    def add(self, dist, entry=None, insert=True, replace=False):
+        """Add `dist` to working set, associated with `entry`
+
+        If `entry` is unspecified, it defaults to the ``.location`` of `dist`.
+        On exit from this routine, `entry` is added to the end of the working
+        set's ``.entries`` (if it wasn't already present).
+
+        `dist` is only added to the working set if it's for a project that
+        doesn't already have a distribution in the set, unless `replace=True`.
+        If it's added, any callbacks registered with the ``subscribe()`` method
+        will be called.
+        """
+        if insert:
+            dist.insert_on(self.entries, entry, replace=replace)
+
+        if entry is None:
+            entry = dist.location
+        keys = self.entry_keys.setdefault(entry, [])
+        keys2 = self.entry_keys.setdefault(dist.location, [])
+        if not replace and dist.key in self.by_key:
+            # ignore hidden distros
+            return
+
+        self.by_key[dist.key] = dist
+        if dist.key not in keys:
+            keys.append(dist.key)
+        if dist.key not in keys2:
+            keys2.append(dist.key)
+        self._added_new(dist)
+
+    def resolve(self, requirements, env=None, installer=None,
+                replace_conflicting=False, extras=None):
+        """List all distributions needed to (recursively) meet `requirements`
+
+        `requirements` must be a sequence of ``Requirement`` objects.  `env`,
+        if supplied, should be an ``Environment`` instance.  If
+        not supplied, it defaults to all distributions available within any
+        entry or distribution in the working set.  `installer`, if supplied,
+        will be invoked with each requirement that cannot be met by an
+        already-installed distribution; it should return a ``Distribution`` or
+        ``None``.
+
+        Unless `replace_conflicting=True`, raises a VersionConflict exception
+        if
+        any requirements are found on the path that have the correct name but
+        the wrong version.  Otherwise, if an `installer` is supplied it will be
+        invoked to obtain the correct version of the requirement and activate
+        it.
+
+        `extras` is a list of the extras to be used with these requirements.
+        This is important because extra requirements may look like `my_req;
+        extra = "my_extra"`, which would otherwise be interpreted as a purely
+        optional requirement.  Instead, we want to be able to assert that these
+        requirements are truly required.
+        """
+
+        # set up the stack
+        requirements = list(requirements)[::-1]
+        # set of processed requirements
+        processed = {}
+        # key -> dist
+        best = {}
+        to_activate = []
+
+        req_extras = _ReqExtras()
+
+        # Mapping of requirement to set of distributions that required it;
+        # useful for reporting info about conflicts.
+        required_by = collections.defaultdict(set)
+
+        while requirements:
+            # process dependencies breadth-first
+            req = requirements.pop(0)
+            if req in processed:
+                # Ignore cyclic or redundant dependencies
+                continue
+
+            if not req_extras.markers_pass(req, extras):
+                continue
+
+            dist = best.get(req.key)
+            if dist is None:
+                # Find the best distribution and add it to the map
+                dist = self.by_key.get(req.key)
+                if dist is None or (dist not in req and replace_conflicting):
+                    ws = self
+                    if env is None:
+                        if dist is None:
+                            env = Environment(self.entries)
+                        else:
+                            # Use an empty environment and workingset to avoid
+                            # any further conflicts with the conflicting
+                            # distribution
+                            env = Environment([])
+                            ws = WorkingSet([])
+                    dist = best[req.key] = env.best_match(
+                        req, ws, installer,
+                        replace_conflicting=replace_conflicting
+                    )
+                    if dist is None:
+                        requirers = required_by.get(req, None)
+                        raise DistributionNotFound(req, requirers)
+                to_activate.append(dist)
+            if dist not in req:
+                # Oops, the "best" so far conflicts with a dependency
+                dependent_req = required_by[req]
+                raise VersionConflict(dist, req).with_context(dependent_req)
+
+            # push the new requirements onto the stack
+            new_requirements = dist.requires(req.extras)[::-1]
+            requirements.extend(new_requirements)
+
+            # Register the new requirements needed by req
+            for new_requirement in new_requirements:
+                required_by[new_requirement].add(req.project_name)
+                req_extras[new_requirement] = req.extras
+
+            processed[req] = True
+
+        # return list of distros to activate
+        return to_activate
+
+    def find_plugins(
+            self, plugin_env, full_env=None, installer=None, fallback=True):
+        """Find all activatable distributions in `plugin_env`
+
+        Example usage::
+
+            distributions, errors = working_set.find_plugins(
+                Environment(plugin_dirlist)
+            )
+            # add plugins+libs to sys.path
+            map(working_set.add, distributions)
+            # display errors
+            print('Could not load', errors)
+
+        The `plugin_env` should be an ``Environment`` instance that contains
+        only distributions that are in the project's "plugin directory" or
+        directories. The `full_env`, if supplied, should be an ``Environment``
+        contains all currently-available distributions.  If `full_env` is not
+        supplied, one is created automatically from the ``WorkingSet`` this
+        method is called on, which will typically mean that every directory on
+        ``sys.path`` will be scanned for distributions.
+
+        `installer` is a standard installer callback as used by the
+        ``resolve()`` method. The `fallback` flag indicates whether we should
+        attempt to resolve older versions of a plugin if the newest version
+        cannot be resolved.
+
+        This method returns a 2-tuple: (`distributions`, `error_info`), where
+        `distributions` is a list of the distributions found in `plugin_env`
+        that were loadable, along with any other distributions that are needed
+        to resolve their dependencies.  `error_info` is a dictionary mapping
+        unloadable plugin distributions to an exception instance describing the
+        error that occurred. Usually this will be a ``DistributionNotFound`` or
+        ``VersionConflict`` instance.
+        """
+
+        plugin_projects = list(plugin_env)
+        # scan project names in alphabetic order
+        plugin_projects.sort()
+
+        error_info = {}
+        distributions = {}
+
+        if full_env is None:
+            env = Environment(self.entries)
+            env += plugin_env
+        else:
+            env = full_env + plugin_env
+
+        shadow_set = self.__class__([])
+        # put all our entries in shadow_set
+        list(map(shadow_set.add, self))
+
+        for project_name in plugin_projects:
+
+            for dist in plugin_env[project_name]:
+
+                req = [dist.as_requirement()]
+
+                try:
+                    resolvees = shadow_set.resolve(req, env, installer)
+
+                except ResolutionError as v:
+                    # save error info
+                    error_info[dist] = v
+                    if fallback:
+                        # try the next older version of project
+                        continue
+                    else:
+                        # give up on this project, keep going
+                        break
+
+                else:
+                    list(map(shadow_set.add, resolvees))
+                    distributions.update(dict.fromkeys(resolvees))
+
+                    # success, no need to try any more versions of this project
+                    break
+
+        distributions = list(distributions)
+        distributions.sort()
+
+        return distributions, error_info
+
+    def require(self, *requirements):
+        """Ensure that distributions matching `requirements` are activated
+
+        `requirements` must be a string or a (possibly-nested) sequence
+        thereof, specifying the distributions and versions required.  The
+        return value is a sequence of the distributions that needed to be
+        activated to fulfill the requirements; all relevant distributions are
+        included, even if they were already activated in this working set.
+        """
+        needed = self.resolve(parse_requirements(requirements))
+
+        for dist in needed:
+            self.add(dist)
+
+        return needed
+
+    def subscribe(self, callback, existing=True):
+        """Invoke `callback` for all distributions
+
+        If `existing=True` (default),
+        call on all existing ones, as well.
+        """
+        if callback in self.callbacks:
+            return
+        self.callbacks.append(callback)
+        if not existing:
+            return
+        for dist in self:
+            callback(dist)
+
+    def _added_new(self, dist):
+        for callback in self.callbacks:
+            callback(dist)
+
+    def __getstate__(self):
+        return (
+            self.entries[:], self.entry_keys.copy(), self.by_key.copy(),
+            self.callbacks[:]
+        )
+
+    def __setstate__(self, e_k_b_c):
+        entries, keys, by_key, callbacks = e_k_b_c
+        self.entries = entries[:]
+        self.entry_keys = keys.copy()
+        self.by_key = by_key.copy()
+        self.callbacks = callbacks[:]
+
+
+class _ReqExtras(dict):
+    """
+    Map each requirement to the extras that demanded it.
+    """
+
+    def markers_pass(self, req, extras=None):
+        """
+        Evaluate markers for req against each extra that
+        demanded it.
+
+        Return False if the req has a marker and fails
+        evaluation. Otherwise, return True.
+        """
+        extra_evals = (
+            req.marker.evaluate({'extra': extra})
+            for extra in self.get(req, ()) + (extras or (None,))
+        )
+        return not req.marker or any(extra_evals)
+
+
+class Environment:
+    """Searchable snapshot of distributions on a search path"""
+
+    def __init__(
+            self, search_path=None, platform=get_supported_platform(),
+            python=PY_MAJOR):
+        """Snapshot distributions available on a search path
+
+        Any distributions found on `search_path` are added to the environment.
+        `search_path` should be a sequence of ``sys.path`` items.  If not
+        supplied, ``sys.path`` is used.
+
+        `platform` is an optional string specifying the name of the platform
+        that platform-specific distributions must be compatible with.  If
+        unspecified, it defaults to the current platform.  `python` is an
+        optional string naming the desired version of Python (e.g. ``'3.6'``);
+        it defaults to the current version.
+
+        You may explicitly set `platform` (and/or `python`) to ``None`` if you
+        wish to map *all* distributions, not just those compatible with the
+        running platform or Python version.
+        """
+        self._distmap = {}
+        self.platform = platform
+        self.python = python
+        self.scan(search_path)
+
+    def can_add(self, dist):
+        """Is distribution `dist` acceptable for this environment?
+
+        The distribution must match the platform and python version
+        requirements specified when this environment was created, or False
+        is returned.
+        """
+        py_compat = (
+            self.python is None
+            or dist.py_version is None
+            or dist.py_version == self.python
+        )
+        return py_compat and compatible_platforms(dist.platform, self.platform)
+
+    def remove(self, dist):
+        """Remove `dist` from the environment"""
+        self._distmap[dist.key].remove(dist)
+
+    def scan(self, search_path=None):
+        """Scan `search_path` for distributions usable in this environment
+
+        Any distributions found are added to the environment.
+        `search_path` should be a sequence of ``sys.path`` items.  If not
+        supplied, ``sys.path`` is used.  Only distributions conforming to
+        the platform/python version defined at initialization are added.
+        """
+        if search_path is None:
+            search_path = sys.path
+
+        for item in search_path:
+            for dist in find_distributions(item):
+                self.add(dist)
+
+    def __getitem__(self, project_name):
+        """Return a newest-to-oldest list of distributions for `project_name`
+
+        Uses case-insensitive `project_name` comparison, assuming all the
+        project's distributions use their project's name converted to all
+        lowercase as their key.
+
+        """
+        distribution_key = project_name.lower()
+        return self._distmap.get(distribution_key, [])
+
+    def add(self, dist):
+        """Add `dist` if we ``can_add()`` it and it has not already been added
+        """
+        if self.can_add(dist) and dist.has_version():
+            dists = self._distmap.setdefault(dist.key, [])
+            if dist not in dists:
+                dists.append(dist)
+                dists.sort(key=operator.attrgetter('hashcmp'), reverse=True)
+
+    def best_match(
+            self, req, working_set, installer=None, replace_conflicting=False):
+        """Find distribution best matching `req` and usable on `working_set`
+
+        This calls the ``find(req)`` method of the `working_set` to see if a
+        suitable distribution is already active.  (This may raise
+        ``VersionConflict`` if an unsuitable version of the project is already
+        active in the specified `working_set`.)  If a suitable distribution
+        isn't active, this method returns the newest distribution in the
+        environment that meets the ``Requirement`` in `req`.  If no suitable
+        distribution is found, and `installer` is supplied, then the result of
+        calling the environment's ``obtain(req, installer)`` method will be
+        returned.
+        """
+        try:
+            dist = working_set.find(req)
+        except VersionConflict:
+            if not replace_conflicting:
+                raise
+            dist = None
+        if dist is not None:
+            return dist
+        for dist in self[req.key]:
+            if dist in req:
+                return dist
+        # try to download/install
+        return self.obtain(req, installer)
+
+    def obtain(self, requirement, installer=None):
+        """Obtain a distribution matching `requirement` (e.g. via download)
+
+        Obtain a distro that matches requirement (e.g. via download).  In the
+        base ``Environment`` class, this routine just returns
+        ``installer(requirement)``, unless `installer` is None, in which case
+        None is returned instead.  This method is a hook that allows subclasses
+        to attempt other ways of obtaining a distribution before falling back
+        to the `installer` argument."""
+        if installer is not None:
+            return installer(requirement)
+
+    def __iter__(self):
+        """Yield the unique project names of the available distributions"""
+        for key in self._distmap.keys():
+            if self[key]:
+                yield key
+
+    def __iadd__(self, other):
+        """In-place addition of a distribution or environment"""
+        if isinstance(other, Distribution):
+            self.add(other)
+        elif isinstance(other, Environment):
+            for project in other:
+                for dist in other[project]:
+                    self.add(dist)
+        else:
+            raise TypeError("Can't add %r to environment" % (other,))
+        return self
+
+    def __add__(self, other):
+        """Add an environment or distribution to an environment"""
+        new = self.__class__([], platform=None, python=None)
+        for env in self, other:
+            new += env
+        return new
+
+
+# XXX backward compatibility
+AvailableDistributions = Environment
+
+
+class ExtractionError(RuntimeError):
+    """An error occurred extracting a resource
+
+    The following attributes are available from instances of this exception:
+
+    manager
+        The resource manager that raised this exception
+
+    cache_path
+        The base directory for resource extraction
+
+    original_error
+        The exception instance that caused extraction to fail
+    """
+
+
+class ResourceManager:
+    """Manage resource extraction and packages"""
+    extraction_path = None
+
+    def __init__(self):
+        self.cached_files = {}
+
+    def resource_exists(self, package_or_requirement, resource_name):
+        """Does the named resource exist?"""
+        return get_provider(package_or_requirement).has_resource(resource_name)
+
+    def resource_isdir(self, package_or_requirement, resource_name):
+        """Is the named resource an existing directory?"""
+        return get_provider(package_or_requirement).resource_isdir(
+            resource_name
+        )
+
+    def resource_filename(self, package_or_requirement, resource_name):
+        """Return a true filesystem path for specified resource"""
+        return get_provider(package_or_requirement).get_resource_filename(
+            self, resource_name
+        )
+
+    def resource_stream(self, package_or_requirement, resource_name):
+        """Return a readable file-like object for specified resource"""
+        return get_provider(package_or_requirement).get_resource_stream(
+            self, resource_name
+        )
+
+    def resource_string(self, package_or_requirement, resource_name):
+        """Return specified resource as a string"""
+        return get_provider(package_or_requirement).get_resource_string(
+            self, resource_name
+        )
+
+    def resource_listdir(self, package_or_requirement, resource_name):
+        """List the contents of the named resource directory"""
+        return get_provider(package_or_requirement).resource_listdir(
+            resource_name
+        )
+
+    def extraction_error(self):
+        """Give an error message for problems extracting file(s)"""
+
+        old_exc = sys.exc_info()[1]
+        cache_path = self.extraction_path or get_default_cache()
+
+        tmpl = textwrap.dedent("""
+            Can't extract file(s) to egg cache
+
+            The following error occurred while trying to extract file(s)
+            to the Python egg cache:
+
+              {old_exc}
+
+            The Python egg cache directory is currently set to:
+
+              {cache_path}
+
+            Perhaps your account does not have write access to this directory?
+            You can change the cache directory by setting the PYTHON_EGG_CACHE
+            environment variable to point to an accessible directory.
+            """).lstrip()
+        err = ExtractionError(tmpl.format(**locals()))
+        err.manager = self
+        err.cache_path = cache_path
+        err.original_error = old_exc
+        raise err
+
+    def get_cache_path(self, archive_name, names=()):
+        """Return absolute location in cache for `archive_name` and `names`
+
+        The parent directory of the resulting path will be created if it does
+        not already exist.  `archive_name` should be the base filename of the
+        enclosing egg (which may not be the name of the enclosing zipfile!),
+        including its ".egg" extension.  `names`, if provided, should be a
+        sequence of path name parts "under" the egg's extraction location.
+
+        This method should only be called by resource providers that need to
+        obtain an extraction location, and only for names they intend to
+        extract, as it tracks the generated names for possible cleanup later.
+        """
+        extract_path = self.extraction_path or get_default_cache()
+        target_path = os.path.join(extract_path, archive_name + '-tmp', *names)
+        try:
+            _bypass_ensure_directory(target_path)
+        except Exception:
+            self.extraction_error()
+
+        self._warn_unsafe_extraction_path(extract_path)
+
+        self.cached_files[target_path] = 1
+        return target_path
+
+    @staticmethod
+    def _warn_unsafe_extraction_path(path):
+        """
+        If the default extraction path is overridden and set to an insecure
+        location, such as /tmp, it opens up an opportunity for an attacker to
+        replace an extracted file with an unauthorized payload. Warn the user
+        if a known insecure location is used.
+
+        See Distribute #375 for more details.
+        """
+        if os.name == 'nt' and not path.startswith(os.environ['windir']):
+            # On Windows, permissions are generally restrictive by default
+            #  and temp directories are not writable by other users, so
+            #  bypass the warning.
+            return
+        mode = os.stat(path).st_mode
+        if mode & stat.S_IWOTH or mode & stat.S_IWGRP:
+            msg = (
+                "%s is writable by group/others and vulnerable to attack "
+                "when "
+                "used with get_resource_filename. Consider a more secure "
+                "location (set with .set_extraction_path or the "
+                "PYTHON_EGG_CACHE environment variable)." % path
+            )
+            warnings.warn(msg, UserWarning)
+
+    def postprocess(self, tempname, filename):
+        """Perform any platform-specific postprocessing of `tempname`
+
+        This is where Mac header rewrites should be done; other platforms don't
+        have anything special they should do.
+
+        Resource providers should call this method ONLY after successfully
+        extracting a compressed resource.  They must NOT call it on resources
+        that are already in the filesystem.
+
+        `tempname` is the current (temporary) name of the file, and `filename`
+        is the name it will be renamed to by the caller after this routine
+        returns.
+        """
+
+        if os.name == 'posix':
+            # Make the resource executable
+            mode = ((os.stat(tempname).st_mode) | 0o555) & 0o7777
+            os.chmod(tempname, mode)
+
+    def set_extraction_path(self, path):
+        """Set the base path where resources will be extracted to, if needed.
+
+        If you do not call this routine before any extractions take place, the
+        path defaults to the return value of ``get_default_cache()``.  (Which
+        is based on the ``PYTHON_EGG_CACHE`` environment variable, with various
+        platform-specific fallbacks.  See that routine's documentation for more
+        details.)
+
+        Resources are extracted to subdirectories of this path based upon
+        information given by the ``IResourceProvider``.  You may set this to a
+        temporary directory, but then you must call ``cleanup_resources()`` to
+        delete the extracted files when done.  There is no guarantee that
+        ``cleanup_resources()`` will be able to remove all extracted files.
+
+        (Note: you may not change the extraction path for a given resource
+        manager once resources have been extracted, unless you first call
+        ``cleanup_resources()``.)
+        """
+        if self.cached_files:
+            raise ValueError(
+                "Can't change extraction path, files already extracted"
+            )
+
+        self.extraction_path = path
+
+    def cleanup_resources(self, force=False):
+        """
+        Delete all extracted resource files and directories, returning a list
+        of the file and directory names that could not be successfully removed.
+        This function does not have any concurrency protection, so it should
+        generally only be called when the extraction path is a temporary
+        directory exclusive to a single process.  This method is not
+        automatically called; you must call it explicitly or register it as an
+        ``atexit`` function if you wish to ensure cleanup of a temporary
+        directory used for extractions.
+        """
+        # XXX
+
+
+def get_default_cache():
+    """
+    Return the ``PYTHON_EGG_CACHE`` environment variable
+    or a platform-relevant user cache dir for an app
+    named "Python-Eggs".
+    """
+    return (
+        os.environ.get('PYTHON_EGG_CACHE')
+        or appdirs.user_cache_dir(appname='Python-Eggs')
+    )
+
+
+def safe_name(name):
+    """Convert an arbitrary string to a standard distribution name
+
+    Any runs of non-alphanumeric/. characters are replaced with a single '-'.
+    """
+    return re.sub('[^A-Za-z0-9.]+', '-', name)
+
+
+def safe_version(version):
+    """
+    Convert an arbitrary string to a standard version string
+    """
+    try:
+        # normalize the version
+        return str(packaging.version.Version(version))
+    except packaging.version.InvalidVersion:
+        version = version.replace(' ', '.')
+        return re.sub('[^A-Za-z0-9.]+', '-', version)
+
+
+def safe_extra(extra):
+    """Convert an arbitrary string to a standard 'extra' name
+
+    Any runs of non-alphanumeric characters are replaced with a single '_',
+    and the result is always lowercased.
+    """
+    return re.sub('[^A-Za-z0-9.-]+', '_', extra).lower()
+
+
+def to_filename(name):
+    """Convert a project or version name to its filename-escaped form
+
+    Any '-' characters are currently replaced with '_'.
+    """
+    return name.replace('-', '_')
+
+
+def invalid_marker(text):
+    """
+    Validate text as a PEP 508 environment marker; return an exception
+    if invalid or False otherwise.
+    """
+    try:
+        evaluate_marker(text)
+    except SyntaxError as e:
+        e.filename = None
+        e.lineno = None
+        return e
+    return False
+
+
+def evaluate_marker(text, extra=None):
+    """
+    Evaluate a PEP 508 environment marker.
+    Return a boolean indicating the marker result in this environment.
+    Raise SyntaxError if marker is invalid.
+
+    This implementation uses the 'pyparsing' module.
+    """
+    try:
+        marker = packaging.markers.Marker(text)
+        return marker.evaluate()
+    except packaging.markers.InvalidMarker as e:
+        raise SyntaxError(e)
+
+
+class NullProvider:
+    """Try to implement resources and metadata for arbitrary PEP 302 loaders"""
+
+    egg_name = None
+    egg_info = None
+    loader = None
+
+    def __init__(self, module):
+        self.loader = getattr(module, '__loader__', None)
+        self.module_path = os.path.dirname(getattr(module, '__file__', ''))
+
+    def get_resource_filename(self, manager, resource_name):
+        return self._fn(self.module_path, resource_name)
+
+    def get_resource_stream(self, manager, resource_name):
+        return io.BytesIO(self.get_resource_string(manager, resource_name))
+
+    def get_resource_string(self, manager, resource_name):
+        return self._get(self._fn(self.module_path, resource_name))
+
+    def has_resource(self, resource_name):
+        return self._has(self._fn(self.module_path, resource_name))
+
+    def _get_metadata_path(self, name):
+        return self._fn(self.egg_info, name)
+
+    def has_metadata(self, name):
+        if not self.egg_info:
+            return self.egg_info
+
+        path = self._get_metadata_path(name)
+        return self._has(path)
+
+    def get_metadata(self, name):
+        if not self.egg_info:
+            return ""
+        path = self._get_metadata_path(name)
+        value = self._get(path)
+        if six.PY2:
+            return value
+        try:
+            return value.decode('utf-8')
+        except UnicodeDecodeError as exc:
+            # Include the path in the error message to simplify
+            # troubleshooting, and without changing the exception type.
+            exc.reason += ' in {} file at path: {}'.format(name, path)
+            raise
+
+    def get_metadata_lines(self, name):
+        return yield_lines(self.get_metadata(name))
+
+    def resource_isdir(self, resource_name):
+        return self._isdir(self._fn(self.module_path, resource_name))
+
+    def metadata_isdir(self, name):
+        return self.egg_info and self._isdir(self._fn(self.egg_info, name))
+
+    def resource_listdir(self, resource_name):
+        return self._listdir(self._fn(self.module_path, resource_name))
+
+    def metadata_listdir(self, name):
+        if self.egg_info:
+            return self._listdir(self._fn(self.egg_info, name))
+        return []
+
+    def run_script(self, script_name, namespace):
+        script = 'scripts/' + script_name
+        if not self.has_metadata(script):
+            raise ResolutionError(
+                "Script {script!r} not found in metadata at {self.egg_info!r}"
+                .format(**locals()),
+            )
+        script_text = self.get_metadata(script).replace('\r\n', '\n')
+        script_text = script_text.replace('\r', '\n')
+        script_filename = self._fn(self.egg_info, script)
+        namespace['__file__'] = script_filename
+        if os.path.exists(script_filename):
+            source = open(script_filename).read()
+            code = compile(source, script_filename, 'exec')
+            exec(code, namespace, namespace)
+        else:
+            from linecache import cache
+            cache[script_filename] = (
+                len(script_text), 0, script_text.split('\n'), script_filename
+            )
+            script_code = compile(script_text, script_filename, 'exec')
+            exec(script_code, namespace, namespace)
+
+    def _has(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _isdir(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _listdir(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _fn(self, base, resource_name):
+        self._validate_resource_path(resource_name)
+        if resource_name:
+            return os.path.join(base, *resource_name.split('/'))
+        return base
+
+    @staticmethod
+    def _validate_resource_path(path):
+        """
+        Validate the resource paths according to the docs.
+        https://setuptools.readthedocs.io/en/latest/pkg_resources.html#basic-resource-access
+
+        >>> warned = getfixture('recwarn')
+        >>> warnings.simplefilter('always')
+        >>> vrp = NullProvider._validate_resource_path
+        >>> vrp('foo/bar.txt')
+        >>> bool(warned)
+        False
+        >>> vrp('../foo/bar.txt')
+        >>> bool(warned)
+        True
+        >>> warned.clear()
+        >>> vrp('/foo/bar.txt')
+        >>> bool(warned)
+        True
+        >>> vrp('foo/../../bar.txt')
+        >>> bool(warned)
+        True
+        >>> warned.clear()
+        >>> vrp('foo/f../bar.txt')
+        >>> bool(warned)
+        False
+
+        Windows path separators are straight-up disallowed.
+        >>> vrp(r'\\foo/bar.txt')
+        Traceback (most recent call last):
+        ...
+        ValueError: Use of .. or absolute path in a resource path \
+is not allowed.
+
+        >>> vrp(r'C:\\foo/bar.txt')
+        Traceback (most recent call last):
+        ...
+        ValueError: Use of .. or absolute path in a resource path \
+is not allowed.
+
+        Blank values are allowed
+
+        >>> vrp('')
+        >>> bool(warned)
+        False
+
+        Non-string values are not.
+
+        >>> vrp(None)
+        Traceback (most recent call last):
+        ...
+        AttributeError: ...
+        """
+        invalid = (
+            os.path.pardir in path.split(posixpath.sep) or
+            posixpath.isabs(path) or
+            ntpath.isabs(path)
+        )
+        if not invalid:
+            return
+
+        msg = "Use of .. or absolute path in a resource path is not allowed."
+
+        # Aggressively disallow Windows absolute paths
+        if ntpath.isabs(path) and not posixpath.isabs(path):
+            raise ValueError(msg)
+
+        # for compatibility, warn; in future
+        # raise ValueError(msg)
+        warnings.warn(
+            msg[:-1] + " and will raise exceptions in a future release.",
+            DeprecationWarning,
+            stacklevel=4,
+        )
+
+    def _get(self, path):
+        if hasattr(self.loader, 'get_data'):
+            return self.loader.get_data(path)
+        raise NotImplementedError(
+            "Can't perform this operation for loaders without 'get_data()'"
+        )
+
+
+register_loader_type(object, NullProvider)
+
+
+class EggProvider(NullProvider):
+    """Provider based on a virtual filesystem"""
+
+    def __init__(self, module):
+        NullProvider.__init__(self, module)
+        self._setup_prefix()
+
+    def _setup_prefix(self):
+        # we assume here that our metadata may be nested inside a "basket"
+        # of multiple eggs; that's why we use module_path instead of .archive
+        path = self.module_path
+        old = None
+        while path != old:
+            if _is_egg_path(path):
+                self.egg_name = os.path.basename(path)
+                self.egg_info = os.path.join(path, 'EGG-INFO')
+                self.egg_root = path
+                break
+            old = path
+            path, base = os.path.split(path)
+
+
+class DefaultProvider(EggProvider):
+    """Provides access to package resources in the filesystem"""
+
+    def _has(self, path):
+        return os.path.exists(path)
+
+    def _isdir(self, path):
+        return os.path.isdir(path)
+
+    def _listdir(self, path):
+        return os.listdir(path)
+
+    def get_resource_stream(self, manager, resource_name):
+        return open(self._fn(self.module_path, resource_name), 'rb')
+
+    def _get(self, path):
+        with open(path, 'rb') as stream:
+            return stream.read()
+
+    @classmethod
+    def _register(cls):
+        loader_names = 'SourceFileLoader', 'SourcelessFileLoader',
+        for name in loader_names:
+            loader_cls = getattr(importlib_machinery, name, type(None))
+            register_loader_type(loader_cls, cls)
+
+
+DefaultProvider._register()
+
+
+class EmptyProvider(NullProvider):
+    """Provider that returns nothing for all requests"""
+
+    module_path = None
+
+    _isdir = _has = lambda self, path: False
+
+    def _get(self, path):
+        return ''
+
+    def _listdir(self, path):
+        return []
+
+    def __init__(self):
+        pass
+
+
+empty_provider = EmptyProvider()
+
+
+class ZipManifests(dict):
+    """
+    zip manifest builder
+    """
+
+    @classmethod
+    def build(cls, path):
+        """
+        Build a dictionary similar to the zipimport directory
+        caches, except instead of tuples, store ZipInfo objects.
+
+        Use a platform-specific path separator (os.sep) for the path keys
+        for compatibility with pypy on Windows.
+        """
+        with zipfile.ZipFile(path) as zfile:
+            items = (
+                (
+                    name.replace('/', os.sep),
+                    zfile.getinfo(name),
+                )
+                for name in zfile.namelist()
+            )
+            return dict(items)
+
+    load = build
+
+
+class MemoizedZipManifests(ZipManifests):
+    """
+    Memoized zipfile manifests.
+    """
+    manifest_mod = collections.namedtuple('manifest_mod', 'manifest mtime')
+
+    def load(self, path):
+        """
+        Load a manifest at path or return a suitable manifest already loaded.
+        """
+        path = os.path.normpath(path)
+        mtime = os.stat(path).st_mtime
+
+        if path not in self or self[path].mtime != mtime:
+            manifest = self.build(path)
+            self[path] = self.manifest_mod(manifest, mtime)
+
+        return self[path].manifest
+
+
+class ZipProvider(EggProvider):
+    """Resource support for zips and eggs"""
+
+    eagers = None
+    _zip_manifests = MemoizedZipManifests()
+
+    def __init__(self, module):
+        EggProvider.__init__(self, module)
+        self.zip_pre = self.loader.archive + os.sep
+
+    def _zipinfo_name(self, fspath):
+        # Convert a virtual filename (full path to file) into a zipfile subpath
+        # usable with the zipimport directory cache for our target archive
+        fspath = fspath.rstrip(os.sep)
+        if fspath == self.loader.archive:
+            return ''
+        if fspath.startswith(self.zip_pre):
+            return fspath[len(self.zip_pre):]
+        raise AssertionError(
+            "%s is not a subpath of %s" % (fspath, self.zip_pre)
+        )
+
+    def _parts(self, zip_path):
+        # Convert a zipfile subpath into an egg-relative path part list.
+        # pseudo-fs path
+        fspath = self.zip_pre + zip_path
+        if fspath.startswith(self.egg_root + os.sep):
+            return fspath[len(self.egg_root) + 1:].split(os.sep)
+        raise AssertionError(
+            "%s is not a subpath of %s" % (fspath, self.egg_root)
+        )
+
+    @property
+    def zipinfo(self):
+        return self._zip_manifests.load(self.loader.archive)
+
+    def get_resource_filename(self, manager, resource_name):
+        if not self.egg_name:
+            raise NotImplementedError(
+                "resource_filename() only supported for .egg, not .zip"
+            )
+        # no need to lock for extraction, since we use temp names
+        zip_path = self._resource_to_zip(resource_name)
+        eagers = self._get_eager_resources()
+        if '/'.join(self._parts(zip_path)) in eagers:
+            for name in eagers:
+                self._extract_resource(manager, self._eager_to_zip(name))
+        return self._extract_resource(manager, zip_path)
+
+    @staticmethod
+    def _get_date_and_size(zip_stat):
+        size = zip_stat.file_size
+        # ymdhms+wday, yday, dst
+        date_time = zip_stat.date_time + (0, 0, -1)
+        # 1980 offset already done
+        timestamp = time.mktime(date_time)
+        return timestamp, size
+
+    def _extract_resource(self, manager, zip_path):
+
+        if zip_path in self._index():
+            for name in self._index()[zip_path]:
+                last = self._extract_resource(
+                    manager, os.path.join(zip_path, name)
+                )
+            # return the extracted directory name
+            return os.path.dirname(last)
+
+        timestamp, size = self._get_date_and_size(self.zipinfo[zip_path])
+
+        if not WRITE_SUPPORT:
+            raise IOError('"os.rename" and "os.unlink" are not supported '
+                          'on this platform')
+        try:
+
+            real_path = manager.get_cache_path(
+                self.egg_name, self._parts(zip_path)
+            )
+
+            if self._is_current(real_path, zip_path):
+                return real_path
+
+            outf, tmpnam = _mkstemp(
+                ".$extract",
+                dir=os.path.dirname(real_path),
+            )
+            os.write(outf, self.loader.get_data(zip_path))
+            os.close(outf)
+            utime(tmpnam, (timestamp, timestamp))
+            manager.postprocess(tmpnam, real_path)
+
+            try:
+                rename(tmpnam, real_path)
+
+            except os.error:
+                if os.path.isfile(real_path):
+                    if self._is_current(real_path, zip_path):
+                        # the file became current since it was checked above,
+                        #  so proceed.
+                        return real_path
+                    # Windows, del old file and retry
+                    elif os.name == 'nt':
+                        unlink(real_path)
+                        rename(tmpnam, real_path)
+                        return real_path
+                raise
+
+        except os.error:
+            # report a user-friendly error
+            manager.extraction_error()
+
+        return real_path
+
+    def _is_current(self, file_path, zip_path):
+        """
+        Return True if the file_path is current for this zip_path
+        """
+        timestamp, size = self._get_date_and_size(self.zipinfo[zip_path])
+        if not os.path.isfile(file_path):
+            return False
+        stat = os.stat(file_path)
+        if stat.st_size != size or stat.st_mtime != timestamp:
+            return False
+        # check that the contents match
+        zip_contents = self.loader.get_data(zip_path)
+        with open(file_path, 'rb') as f:
+            file_contents = f.read()
+        return zip_contents == file_contents
+
+    def _get_eager_resources(self):
+        if self.eagers is None:
+            eagers = []
+            for name in ('native_libs.txt', 'eager_resources.txt'):
+                if self.has_metadata(name):
+                    eagers.extend(self.get_metadata_lines(name))
+            self.eagers = eagers
+        return self.eagers
+
+    def _index(self):
+        try:
+            return self._dirindex
+        except AttributeError:
+            ind = {}
+            for path in self.zipinfo:
+                parts = path.split(os.sep)
+                while parts:
+                    parent = os.sep.join(parts[:-1])
+                    if parent in ind:
+                        ind[parent].append(parts[-1])
+                        break
+                    else:
+                        ind[parent] = [parts.pop()]
+            self._dirindex = ind
+            return ind
+
+    def _has(self, fspath):
+        zip_path = self._zipinfo_name(fspath)
+        return zip_path in self.zipinfo or zip_path in self._index()
+
+    def _isdir(self, fspath):
+        return self._zipinfo_name(fspath) in self._index()
+
+    def _listdir(self, fspath):
+        return list(self._index().get(self._zipinfo_name(fspath), ()))
+
+    def _eager_to_zip(self, resource_name):
+        return self._zipinfo_name(self._fn(self.egg_root, resource_name))
+
+    def _resource_to_zip(self, resource_name):
+        return self._zipinfo_name(self._fn(self.module_path, resource_name))
+
+
+register_loader_type(zipimport.zipimporter, ZipProvider)
+
+
+class FileMetadata(EmptyProvider):
+    """Metadata handler for standalone PKG-INFO files
+
+    Usage::
+
+        metadata = FileMetadata("/path/to/PKG-INFO")
+
+    This provider rejects all data and metadata requests except for PKG-INFO,
+    which is treated as existing, and will be the contents of the file at
+    the provided location.
+    """
+
+    def __init__(self, path):
+        self.path = path
+
+    def _get_metadata_path(self, name):
+        return self.path
+
+    def has_metadata(self, name):
+        return name == 'PKG-INFO' and os.path.isfile(self.path)
+
+    def get_metadata(self, name):
+        if name != 'PKG-INFO':
+            raise KeyError("No metadata except PKG-INFO is available")
+
+        with io.open(self.path, encoding='utf-8', errors="replace") as f:
+            metadata = f.read()
+        self._warn_on_replacement(metadata)
+        return metadata
+
+    def _warn_on_replacement(self, metadata):
+        # Python 2.7 compat for: replacement_char = '�'
+        replacement_char = b'\xef\xbf\xbd'.decode('utf-8')
+        if replacement_char in metadata:
+            tmpl = "{self.path} could not be properly decoded in UTF-8"
+            msg = tmpl.format(**locals())
+            warnings.warn(msg)
+
+    def get_metadata_lines(self, name):
+        return yield_lines(self.get_metadata(name))
+
+
+class PathMetadata(DefaultProvider):
+    """Metadata provider for egg directories
+
+    Usage::
+
+        # Development eggs:
+
+        egg_info = "/path/to/PackageName.egg-info"
+        base_dir = os.path.dirname(egg_info)
+        metadata = PathMetadata(base_dir, egg_info)
+        dist_name = os.path.splitext(os.path.basename(egg_info))[0]
+        dist = Distribution(basedir, project_name=dist_name, metadata=metadata)
+
+        # Unpacked egg directories:
+
+        egg_path = "/path/to/PackageName-ver-pyver-etc.egg"
+        metadata = PathMetadata(egg_path, os.path.join(egg_path,'EGG-INFO'))
+        dist = Distribution.from_filename(egg_path, metadata=metadata)
+    """
+
+    def __init__(self, path, egg_info):
+        self.module_path = path
+        self.egg_info = egg_info
+
+
+class EggMetadata(ZipProvider):
+    """Metadata provider for .egg files"""
+
+    def __init__(self, importer):
+        """Create a metadata provider from a zipimporter"""
+
+        self.zip_pre = importer.archive + os.sep
+        self.loader = importer
+        if importer.prefix:
+            self.module_path = os.path.join(importer.archive, importer.prefix)
+        else:
+            self.module_path = importer.archive
+        self._setup_prefix()
+
+
+_declare_state('dict', _distribution_finders={})
+
+
+def register_finder(importer_type, distribution_finder):
+    """Register `distribution_finder` to find distributions in sys.path items
+
+    `importer_type` is the type or class of a PEP 302 "Importer" (sys.path item
+    handler), and `distribution_finder` is a callable that, passed a path
+    item and the importer instance, yields ``Distribution`` instances found on
+    that path item.  See ``pkg_resources.find_on_path`` for an example."""
+    _distribution_finders[importer_type] = distribution_finder
+
+
+def find_distributions(path_item, only=False):
+    """Yield distributions accessible via `path_item`"""
+    importer = get_importer(path_item)
+    finder = _find_adapter(_distribution_finders, importer)
+    return finder(importer, path_item, only)
+
+
+def find_eggs_in_zip(importer, path_item, only=False):
+    """
+    Find eggs in zip files; possibly multiple nested eggs.
+    """
+    if importer.archive.endswith('.whl'):
+        # wheels are not supported with this finder
+        # they don't have PKG-INFO metadata, and won't ever contain eggs
+        return
+    metadata = EggMetadata(importer)
+    if metadata.has_metadata('PKG-INFO'):
+        yield Distribution.from_filename(path_item, metadata=metadata)
+    if only:
+        # don't yield nested distros
+        return
+    for subitem in metadata.resource_listdir(''):
+        if _is_egg_path(subitem):
+            subpath = os.path.join(path_item, subitem)
+            dists = find_eggs_in_zip(zipimport.zipimporter(subpath), subpath)
+            for dist in dists:
+                yield dist
+        elif subitem.lower().endswith('.dist-info'):
+            subpath = os.path.join(path_item, subitem)
+            submeta = EggMetadata(zipimport.zipimporter(subpath))
+            submeta.egg_info = subpath
+            yield Distribution.from_location(path_item, subitem, submeta)
+
+
+register_finder(zipimport.zipimporter, find_eggs_in_zip)
+
+
+def find_nothing(importer, path_item, only=False):
+    return ()
+
+
+register_finder(object, find_nothing)
+
+
+def _by_version_descending(names):
+    """
+    Given a list of filenames, return them in descending order
+    by version number.
+
+    >>> names = 'bar', 'foo', 'Python-2.7.10.egg', 'Python-2.7.2.egg'
+    >>> _by_version_descending(names)
+    ['Python-2.7.10.egg', 'Python-2.7.2.egg', 'foo', 'bar']
+    >>> names = 'Setuptools-1.2.3b1.egg', 'Setuptools-1.2.3.egg'
+    >>> _by_version_descending(names)
+    ['Setuptools-1.2.3.egg', 'Setuptools-1.2.3b1.egg']
+    >>> names = 'Setuptools-1.2.3b1.egg', 'Setuptools-1.2.3.post1.egg'
+    >>> _by_version_descending(names)
+    ['Setuptools-1.2.3.post1.egg', 'Setuptools-1.2.3b1.egg']
+    """
+    def _by_version(name):
+        """
+        Parse each component of the filename
+        """
+        name, ext = os.path.splitext(name)
+        parts = itertools.chain(name.split('-'), [ext])
+        return [packaging.version.parse(part) for part in parts]
+
+    return sorted(names, key=_by_version, reverse=True)
+
+
+def find_on_path(importer, path_item, only=False):
+    """Yield distributions accessible on a sys.path directory"""
+    path_item = _normalize_cached(path_item)
+
+    if _is_unpacked_egg(path_item):
+        yield Distribution.from_filename(
+            path_item, metadata=PathMetadata(
+                path_item, os.path.join(path_item, 'EGG-INFO')
+            )
+        )
+        return
+
+    entries = safe_listdir(path_item)
+
+    # for performance, before sorting by version,
+    # screen entries for only those that will yield
+    # distributions
+    filtered = (
+        entry
+        for entry in entries
+        if dist_factory(path_item, entry, only)
+    )
+
+    # scan for .egg and .egg-info in directory
+    path_item_entries = _by_version_descending(filtered)
+    for entry in path_item_entries:
+        fullpath = os.path.join(path_item, entry)
+        factory = dist_factory(path_item, entry, only)
+        for dist in factory(fullpath):
+            yield dist
+
+
+def dist_factory(path_item, entry, only):
+    """
+    Return a dist_factory for a path_item and entry
+    """
+    lower = entry.lower()
+    is_meta = any(map(lower.endswith, ('.egg-info', '.dist-info')))
+    return (
+        distributions_from_metadata
+        if is_meta else
+        find_distributions
+        if not only and _is_egg_path(entry) else
+        resolve_egg_link
+        if not only and lower.endswith('.egg-link') else
+        NoDists()
+    )
+
+
+class NoDists:
+    """
+    >>> bool(NoDists())
+    False
+
+    >>> list(NoDists()('anything'))
+    []
+    """
+    def __bool__(self):
+        return False
+    if six.PY2:
+        __nonzero__ = __bool__
+
+    def __call__(self, fullpath):
+        return iter(())
+
+
+def safe_listdir(path):
+    """
+    Attempt to list contents of path, but suppress some exceptions.
+    """
+    try:
+        return os.listdir(path)
+    except (PermissionError, NotADirectoryError):
+        pass
+    except OSError as e:
+        # Ignore the directory if does not exist, not a directory or
+        # permission denied
+        ignorable = (
+            e.errno in (errno.ENOTDIR, errno.EACCES, errno.ENOENT)
+            # Python 2 on Windows needs to be handled this way :(
+            or getattr(e, "winerror", None) == 267
+        )
+        if not ignorable:
+            raise
+    return ()
+
+
+def distributions_from_metadata(path):
+    root = os.path.dirname(path)
+    if os.path.isdir(path):
+        if len(os.listdir(path)) == 0:
+            # empty metadata dir; skip
+            return
+        metadata = PathMetadata(root, path)
+    else:
+        metadata = FileMetadata(path)
+    entry = os.path.basename(path)
+    yield Distribution.from_location(
+        root, entry, metadata, precedence=DEVELOP_DIST,
+    )
+
+
+def non_empty_lines(path):
+    """
+    Yield non-empty lines from file at path
+    """
+    with open(path) as f:
+        for line in f:
+            line = line.strip()
+            if line:
+                yield line
+
+
+def resolve_egg_link(path):
+    """
+    Given a path to an .egg-link, resolve distributions
+    present in the referenced path.
+    """
+    referenced_paths = non_empty_lines(path)
+    resolved_paths = (
+        os.path.join(os.path.dirname(path), ref)
+        for ref in referenced_paths
+    )
+    dist_groups = map(find_distributions, resolved_paths)
+    return next(dist_groups, ())
+
+
+register_finder(pkgutil.ImpImporter, find_on_path)
+
+if hasattr(importlib_machinery, 'FileFinder'):
+    register_finder(importlib_machinery.FileFinder, find_on_path)
+
+_declare_state('dict', _namespace_handlers={})
+_declare_state('dict', _namespace_packages={})
+
+
+def register_namespace_handler(importer_type, namespace_handler):
+    """Register `namespace_handler` to declare namespace packages
+
+    `importer_type` is the type or class of a PEP 302 "Importer" (sys.path item
+    handler), and `namespace_handler` is a callable like this::
+
+        def namespace_handler(importer, path_entry, moduleName, module):
+            # return a path_entry to use for child packages
+
+    Namespace handlers are only called if the importer object has already
+    agreed that it can handle the relevant path item, and they should only
+    return a subpath if the module __path__ does not already contain an
+    equivalent subpath.  For an example namespace handler, see
+    ``pkg_resources.file_ns_handler``.
+    """
+    _namespace_handlers[importer_type] = namespace_handler
+
+
+def _handle_ns(packageName, path_item):
+    """Ensure that named package includes a subpath of path_item (if needed)"""
+
+    importer = get_importer(path_item)
+    if importer is None:
+        return None
+
+    # capture warnings due to #1111
+    with warnings.catch_warnings():
+        warnings.simplefilter("ignore")
+        loader = importer.find_module(packageName)
+
+    if loader is None:
+        return None
+    module = sys.modules.get(packageName)
+    if module is None:
+        module = sys.modules[packageName] = types.ModuleType(packageName)
+        module.__path__ = []
+        _set_parent_ns(packageName)
+    elif not hasattr(module, '__path__'):
+        raise TypeError("Not a package:", packageName)
+    handler = _find_adapter(_namespace_handlers, importer)
+    subpath = handler(importer, path_item, packageName, module)
+    if subpath is not None:
+        path = module.__path__
+        path.append(subpath)
+        loader.load_module(packageName)
+        _rebuild_mod_path(path, packageName, module)
+    return subpath
+
+
+def _rebuild_mod_path(orig_path, package_name, module):
+    """
+    Rebuild module.__path__ ensuring that all entries are ordered
+    corresponding to their sys.path order
+    """
+    sys_path = [_normalize_cached(p) for p in sys.path]
+
+    def safe_sys_path_index(entry):
+        """
+        Workaround for #520 and #513.
+        """
+        try:
+            return sys_path.index(entry)
+        except ValueError:
+            return float('inf')
+
+    def position_in_sys_path(path):
+        """
+        Return the ordinal of the path based on its position in sys.path
+        """
+        path_parts = path.split(os.sep)
+        module_parts = package_name.count('.') + 1
+        parts = path_parts[:-module_parts]
+        return safe_sys_path_index(_normalize_cached(os.sep.join(parts)))
+
+    new_path = sorted(orig_path, key=position_in_sys_path)
+    new_path = [_normalize_cached(p) for p in new_path]
+
+    if isinstance(module.__path__, list):
+        module.__path__[:] = new_path
+    else:
+        module.__path__ = new_path
+
+
+def declare_namespace(packageName):
+    """Declare that package 'packageName' is a namespace package"""
+
+    _imp.acquire_lock()
+    try:
+        if packageName in _namespace_packages:
+            return
+
+        path = sys.path
+        parent, _, _ = packageName.rpartition('.')
+
+        if parent:
+            declare_namespace(parent)
+            if parent not in _namespace_packages:
+                __import__(parent)
+            try:
+                path = sys.modules[parent].__path__
+            except AttributeError:
+                raise TypeError("Not a package:", parent)
+
+        # Track what packages are namespaces, so when new path items are added,
+        # they can be updated
+        _namespace_packages.setdefault(parent or None, []).append(packageName)
+        _namespace_packages.setdefault(packageName, [])
+
+        for path_item in path:
+            # Ensure all the parent's path items are reflected in the child,
+            # if they apply
+            _handle_ns(packageName, path_item)
+
+    finally:
+        _imp.release_lock()
+
+
+def fixup_namespace_packages(path_item, parent=None):
+    """Ensure that previously-declared namespace packages include path_item"""
+    _imp.acquire_lock()
+    try:
+        for package in _namespace_packages.get(parent, ()):
+            subpath = _handle_ns(package, path_item)
+            if subpath:
+                fixup_namespace_packages(subpath, package)
+    finally:
+        _imp.release_lock()
+
+
+def file_ns_handler(importer, path_item, packageName, module):
+    """Compute an ns-package subpath for a filesystem or zipfile importer"""
+
+    subpath = os.path.join(path_item, packageName.split('.')[-1])
+    normalized = _normalize_cached(subpath)
+    for item in module.__path__:
+        if _normalize_cached(item) == normalized:
+            break
+    else:
+        # Only return the path if it's not already there
+        return subpath
+
+
+register_namespace_handler(pkgutil.ImpImporter, file_ns_handler)
+register_namespace_handler(zipimport.zipimporter, file_ns_handler)
+
+if hasattr(importlib_machinery, 'FileFinder'):
+    register_namespace_handler(importlib_machinery.FileFinder, file_ns_handler)
+
+
+def null_ns_handler(importer, path_item, packageName, module):
+    return None
+
+
+register_namespace_handler(object, null_ns_handler)
+
+
+def normalize_path(filename):
+    """Normalize a file/dir name for comparison purposes"""
+    return os.path.normcase(os.path.realpath(os.path.normpath(_cygwin_patch(filename))))
+
+
+def _cygwin_patch(filename):  # pragma: nocover
+    """
+    Contrary to POSIX 2008, on Cygwin, getcwd (3) contains
+    symlink components. Using
+    os.path.abspath() works around this limitation. A fix in os.getcwd()
+    would probably better, in Cygwin even more so, except
+    that this seems to be by design...
+    """
+    return os.path.abspath(filename) if sys.platform == 'cygwin' else filename
+
+
+def _normalize_cached(filename, _cache={}):
+    try:
+        return _cache[filename]
+    except KeyError:
+        _cache[filename] = result = normalize_path(filename)
+        return result
+
+
+def _is_egg_path(path):
+    """
+    Determine if given path appears to be an egg.
+    """
+    return path.lower().endswith('.egg')
+
+
+def _is_unpacked_egg(path):
+    """
+    Determine if given path appears to be an unpacked egg.
+    """
+    return (
+        _is_egg_path(path) and
+        os.path.isfile(os.path.join(path, 'EGG-INFO', 'PKG-INFO'))
+    )
+
+
+def _set_parent_ns(packageName):
+    parts = packageName.split('.')
+    name = parts.pop()
+    if parts:
+        parent = '.'.join(parts)
+        setattr(sys.modules[parent], name, sys.modules[packageName])
+
+
+def yield_lines(strs):
+    """Yield non-empty/non-comment lines of a string or sequence"""
+    if isinstance(strs, six.string_types):
+        for s in strs.splitlines():
+            s = s.strip()
+            # skip blank lines/comments
+            if s and not s.startswith('#'):
+                yield s
+    else:
+        for ss in strs:
+            for s in yield_lines(ss):
+                yield s
+
+
+MODULE = re.compile(r"\w+(\.\w+)*$").match
+EGG_NAME = re.compile(
+    r"""
+    (?P<name>[^-]+) (
+        -(?P<ver>[^-]+) (
+            -py(?P<pyver>[^-]+) (
+                -(?P<plat>.+)
+            )?
+        )?
+    )?
+    """,
+    re.VERBOSE | re.IGNORECASE,
+).match
+
+
+class EntryPoint:
+    """Object representing an advertised importable object"""
+
+    def __init__(self, name, module_name, attrs=(), extras=(), dist=None):
+        if not MODULE(module_name):
+            raise ValueError("Invalid module name", module_name)
+        self.name = name
+        self.module_name = module_name
+        self.attrs = tuple(attrs)
+        self.extras = tuple(extras)
+        self.dist = dist
+
+    def __str__(self):
+        s = "%s = %s" % (self.name, self.module_name)
+        if self.attrs:
+            s += ':' + '.'.join(self.attrs)
+        if self.extras:
+            s += ' [%s]' % ','.join(self.extras)
+        return s
+
+    def __repr__(self):
+        return "EntryPoint.parse(%r)" % str(self)
+
+    def load(self, require=True, *args, **kwargs):
+        """
+        Require packages for this EntryPoint, then resolve it.
+        """
+        if not require or args or kwargs:
+            warnings.warn(
+                "Parameters to load are deprecated.  Call .resolve and "
+                ".require separately.",
+                PkgResourcesDeprecationWarning,
+                stacklevel=2,
+            )
+        if require:
+            self.require(*args, **kwargs)
+        return self.resolve()
+
+    def resolve(self):
+        """
+        Resolve the entry point from its module and attrs.
+        """
+        module = __import__(self.module_name, fromlist=['__name__'], level=0)
+        try:
+            return functools.reduce(getattr, self.attrs, module)
+        except AttributeError as exc:
+            raise ImportError(str(exc))
+
+    def require(self, env=None, installer=None):
+        if self.extras and not self.dist:
+            raise UnknownExtra("Can't require() without a distribution", self)
+
+        # Get the requirements for this entry point with all its extras and
+        # then resolve them. We have to pass `extras` along when resolving so
+        # that the working set knows what extras we want. Otherwise, for
+        # dist-info distributions, the working set will assume that the
+        # requirements for that extra are purely optional and skip over them.
+        reqs = self.dist.requires(self.extras)
+        items = working_set.resolve(reqs, env, installer, extras=self.extras)
+        list(map(working_set.add, items))
+
+    pattern = re.compile(
+        r'\s*'
+        r'(?P<name>.+?)\s*'
+        r'=\s*'
+        r'(?P<module>[\w.]+)\s*'
+        r'(:\s*(?P<attr>[\w.]+))?\s*'
+        r'(?P<extras>\[.*\])?\s*$'
+    )
+
+    @classmethod
+    def parse(cls, src, dist=None):
+        """Parse a single entry point from string `src`
+
+        Entry point syntax follows the form::
+
+            name = some.module:some.attr [extra1, extra2]
+
+        The entry name and module name are required, but the ``:attrs`` and
+        ``[extras]`` parts are optional
+        """
+        m = cls.pattern.match(src)
+        if not m:
+            msg = "EntryPoint must be in 'name=module:attrs [extras]' format"
+            raise ValueError(msg, src)
+        res = m.groupdict()
+        extras = cls._parse_extras(res['extras'])
+        attrs = res['attr'].split('.') if res['attr'] else ()
+        return cls(res['name'], res['module'], attrs, extras, dist)
+
+    @classmethod
+    def _parse_extras(cls, extras_spec):
+        if not extras_spec:
+            return ()
+        req = Requirement.parse('x' + extras_spec)
+        if req.specs:
+            raise ValueError()
+        return req.extras
+
+    @classmethod
+    def parse_group(cls, group, lines, dist=None):
+        """Parse an entry point group"""
+        if not MODULE(group):
+            raise ValueError("Invalid group name", group)
+        this = {}
+        for line in yield_lines(lines):
+            ep = cls.parse(line, dist)
+            if ep.name in this:
+                raise ValueError("Duplicate entry point", group, ep.name)
+            this[ep.name] = ep
+        return this
+
+    @classmethod
+    def parse_map(cls, data, dist=None):
+        """Parse a map of entry point groups"""
+        if isinstance(data, dict):
+            data = data.items()
+        else:
+            data = split_sections(data)
+        maps = {}
+        for group, lines in data:
+            if group is None:
+                if not lines:
+                    continue
+                raise ValueError("Entry points must be listed in groups")
+            group = group.strip()
+            if group in maps:
+                raise ValueError("Duplicate group name", group)
+            maps[group] = cls.parse_group(group, lines, dist)
+        return maps
+
+
+def _remove_md5_fragment(location):
+    if not location:
+        return ''
+    parsed = urllib.parse.urlparse(location)
+    if parsed[-1].startswith('md5='):
+        return urllib.parse.urlunparse(parsed[:-1] + ('',))
+    return location
+
+
+def _version_from_file(lines):
+    """
+    Given an iterable of lines from a Metadata file, return
+    the value of the Version field, if present, or None otherwise.
+    """
+    def is_version_line(line):
+        return line.lower().startswith('version:')
+    version_lines = filter(is_version_line, lines)
+    line = next(iter(version_lines), '')
+    _, _, value = line.partition(':')
+    return safe_version(value.strip()) or None
+
+
+class Distribution:
+    """Wrap an actual or potential sys.path entry w/metadata"""
+    PKG_INFO = 'PKG-INFO'
+
+    def __init__(
+            self, location=None, metadata=None, project_name=None,
+            version=None, py_version=PY_MAJOR, platform=None,
+            precedence=EGG_DIST):
+        self.project_name = safe_name(project_name or 'Unknown')
+        if version is not None:
+            self._version = safe_version(version)
+        self.py_version = py_version
+        self.platform = platform
+        self.location = location
+        self.precedence = precedence
+        self._provider = metadata or empty_provider
+
+    @classmethod
+    def from_location(cls, location, basename, metadata=None, **kw):
+        project_name, version, py_version, platform = [None] * 4
+        basename, ext = os.path.splitext(basename)
+        if ext.lower() in _distributionImpl:
+            cls = _distributionImpl[ext.lower()]
+
+            match = EGG_NAME(basename)
+            if match:
+                project_name, version, py_version, platform = match.group(
+                    'name', 'ver', 'pyver', 'plat'
+                )
+        return cls(
+            location, metadata, project_name=project_name, version=version,
+            py_version=py_version, platform=platform, **kw
+        )._reload_version()
+
+    def _reload_version(self):
+        return self
+
+    @property
+    def hashcmp(self):
+        return (
+            self.parsed_version,
+            self.precedence,
+            self.key,
+            _remove_md5_fragment(self.location),
+            self.py_version or '',
+            self.platform or '',
+        )
+
+    def __hash__(self):
+        return hash(self.hashcmp)
+
+    def __lt__(self, other):
+        return self.hashcmp < other.hashcmp
+
+    def __le__(self, other):
+        return self.hashcmp <= other.hashcmp
+
+    def __gt__(self, other):
+        return self.hashcmp > other.hashcmp
+
+    def __ge__(self, other):
+        return self.hashcmp >= other.hashcmp
+
+    def __eq__(self, other):
+        if not isinstance(other, self.__class__):
+            # It's not a Distribution, so they are not equal
+            return False
+        return self.hashcmp == other.hashcmp
+
+    def __ne__(self, other):
+        return not self == other
+
+    # These properties have to be lazy so that we don't have to load any
+    # metadata until/unless it's actually needed.  (i.e., some distributions
+    # may not know their name or version without loading PKG-INFO)
+
+    @property
+    def key(self):
+        try:
+            return self._key
+        except AttributeError:
+            self._key = key = self.project_name.lower()
+            return key
+
+    @property
+    def parsed_version(self):
+        if not hasattr(self, "_parsed_version"):
+            self._parsed_version = parse_version(self.version)
+
+        return self._parsed_version
+
+    def _warn_legacy_version(self):
+        LV = packaging.version.LegacyVersion
+        is_legacy = isinstance(self._parsed_version, LV)
+        if not is_legacy:
+            return
+
+        # While an empty version is technically a legacy version and
+        # is not a valid PEP 440 version, it's also unlikely to
+        # actually come from someone and instead it is more likely that
+        # it comes from setuptools attempting to parse a filename and
+        # including it in the list. So for that we'll gate this warning
+        # on if the version is anything at all or not.
+        if not self.version:
+            return
+
+        tmpl = textwrap.dedent("""
+            '{project_name} ({version})' is being parsed as a legacy,
+            non PEP 440,
+            version. You may find odd behavior and sort order.
+            In particular it will be sorted as less than 0.0. It
+            is recommended to migrate to PEP 440 compatible
+            versions.
+            """).strip().replace('\n', ' ')
+
+        warnings.warn(tmpl.format(**vars(self)), PEP440Warning)
+
+    @property
+    def version(self):
+        try:
+            return self._version
+        except AttributeError:
+            version = self._get_version()
+            if version is None:
+                path = self._get_metadata_path_for_display(self.PKG_INFO)
+                msg = (
+                    "Missing 'Version:' header and/or {} file at path: {}"
+                ).format(self.PKG_INFO, path)
+                raise ValueError(msg, self)
+
+            return version
+
+    @property
+    def _dep_map(self):
+        """
+        A map of extra to its list of (direct) requirements
+        for this distribution, including the null extra.
+        """
+        try:
+            return self.__dep_map
+        except AttributeError:
+            self.__dep_map = self._filter_extras(self._build_dep_map())
+        return self.__dep_map
+
+    @staticmethod
+    def _filter_extras(dm):
+        """
+        Given a mapping of extras to dependencies, strip off
+        environment markers and filter out any dependencies
+        not matching the markers.
+        """
+        for extra in list(filter(None, dm)):
+            new_extra = extra
+            reqs = dm.pop(extra)
+            new_extra, _, marker = extra.partition(':')
+            fails_marker = marker and (
+                invalid_marker(marker)
+                or not evaluate_marker(marker)
+            )
+            if fails_marker:
+                reqs = []
+            new_extra = safe_extra(new_extra) or None
+
+            dm.setdefault(new_extra, []).extend(reqs)
+        return dm
+
+    def _build_dep_map(self):
+        dm = {}
+        for name in 'requires.txt', 'depends.txt':
+            for extra, reqs in split_sections(self._get_metadata(name)):
+                dm.setdefault(extra, []).extend(parse_requirements(reqs))
+        return dm
+
+    def requires(self, extras=()):
+        """List of Requirements needed for this distro if `extras` are used"""
+        dm = self._dep_map
+        deps = []
+        deps.extend(dm.get(None, ()))
+        for ext in extras:
+            try:
+                deps.extend(dm[safe_extra(ext)])
+            except KeyError:
+                raise UnknownExtra(
+                    "%s has no such extra feature %r" % (self, ext)
+                )
+        return deps
+
+    def _get_metadata_path_for_display(self, name):
+        """
+        Return the path to the given metadata file, if available.
+        """
+        try:
+            # We need to access _get_metadata_path() on the provider object
+            # directly rather than through this class's __getattr__()
+            # since _get_metadata_path() is marked private.
+            path = self._provider._get_metadata_path(name)
+
+        # Handle exceptions e.g. in case the distribution's metadata
+        # provider doesn't support _get_metadata_path().
+        except Exception:
+            return '[could not detect]'
+
+        return path
+
+    def _get_metadata(self, name):
+        if self.has_metadata(name):
+            for line in self.get_metadata_lines(name):
+                yield line
+
+    def _get_version(self):
+        lines = self._get_metadata(self.PKG_INFO)
+        version = _version_from_file(lines)
+
+        return version
+
+    def activate(self, path=None, replace=False):
+        """Ensure distribution is importable on `path` (default=sys.path)"""
+        if path is None:
+            path = sys.path
+        self.insert_on(path, replace=replace)
+        if path is sys.path:
+            fixup_namespace_packages(self.location)
+            for pkg in self._get_metadata('namespace_packages.txt'):
+                if pkg in sys.modules:
+                    declare_namespace(pkg)
+
+    def egg_name(self):
+        """Return what this distribution's standard .egg filename should be"""
+        filename = "%s-%s-py%s" % (
+            to_filename(self.project_name), to_filename(self.version),
+            self.py_version or PY_MAJOR
+        )
+
+        if self.platform:
+            filename += '-' + self.platform
+        return filename
+
+    def __repr__(self):
+        if self.location:
+            return "%s (%s)" % (self, self.location)
+        else:
+            return str(self)
+
+    def __str__(self):
+        try:
+            version = getattr(self, 'version', None)
+        except ValueError:
+            version = None
+        version = version or "[unknown version]"
+        return "%s %s" % (self.project_name, version)
+
+    def __getattr__(self, attr):
+        """Delegate all unrecognized public attributes to .metadata provider"""
+        if attr.startswith('_'):
+            raise AttributeError(attr)
+        return getattr(self._provider, attr)
+
+    def __dir__(self):
+        return list(
+            set(super(Distribution, self).__dir__())
+            | set(
+                attr for attr in self._provider.__dir__()
+                if not attr.startswith('_')
+            )
+        )
+
+    if not hasattr(object, '__dir__'):
+        # python 2.7 not supported
+        del __dir__
+
+    @classmethod
+    def from_filename(cls, filename, metadata=None, **kw):
+        return cls.from_location(
+            _normalize_cached(filename), os.path.basename(filename), metadata,
+            **kw
+        )
+
+    def as_requirement(self):
+        """Return a ``Requirement`` that matches this distribution exactly"""
+        if isinstance(self.parsed_version, packaging.version.Version):
+            spec = "%s==%s" % (self.project_name, self.parsed_version)
+        else:
+            spec = "%s===%s" % (self.project_name, self.parsed_version)
+
+        return Requirement.parse(spec)
+
+    def load_entry_point(self, group, name):
+        """Return the `name` entry point of `group` or raise ImportError"""
+        ep = self.get_entry_info(group, name)
+        if ep is None:
+            raise ImportError("Entry point %r not found" % ((group, name),))
+        return ep.load()
+
+    def get_entry_map(self, group=None):
+        """Return the entry point map for `group`, or the full entry map"""
+        try:
+            ep_map = self._ep_map
+        except AttributeError:
+            ep_map = self._ep_map = EntryPoint.parse_map(
+                self._get_metadata('entry_points.txt'), self
+            )
+        if group is not None:
+            return ep_map.get(group, {})
+        return ep_map
+
+    def get_entry_info(self, group, name):
+        """Return the EntryPoint object for `group`+`name`, or ``None``"""
+        return self.get_entry_map(group).get(name)
+
+    def insert_on(self, path, loc=None, replace=False):
+        """Ensure self.location is on path
+
+        If replace=False (default):
+            - If location is already in path anywhere, do nothing.
+            - Else:
+              - If it's an egg and its parent directory is on path,
+                insert just ahead of the parent.
+              - Else: add to the end of path.
+        If replace=True:
+            - If location is already on path anywhere (not eggs)
+              or higher priority than its parent (eggs)
+              do nothing.
+            - Else:
+              - If it's an egg and its parent directory is on path,
+                insert just ahead of the parent,
+                removing any lower-priority entries.
+              - Else: add it to the front of path.
+        """
+
+        loc = loc or self.location
+        if not loc:
+            return
+
+        nloc = _normalize_cached(loc)
+        bdir = os.path.dirname(nloc)
+        npath = [(p and _normalize_cached(p) or p) for p in path]
+
+        for p, item in enumerate(npath):
+            if item == nloc:
+                if replace:
+                    break
+                else:
+                    # don't modify path (even removing duplicates) if
+                    # found and not replace
+                    return
+            elif item == bdir and self.precedence == EGG_DIST:
+                # if it's an .egg, give it precedence over its directory
+                # UNLESS it's already been added to sys.path and replace=False
+                if (not replace) and nloc in npath[p:]:
+                    return
+                if path is sys.path:
+                    self.check_version_conflict()
+                path.insert(p, loc)
+                npath.insert(p, nloc)
+                break
+        else:
+            if path is sys.path:
+                self.check_version_conflict()
+            if replace:
+                path.insert(0, loc)
+            else:
+                path.append(loc)
+            return
+
+        # p is the spot where we found or inserted loc; now remove duplicates
+        while True:
+            try:
+                np = npath.index(nloc, p + 1)
+            except ValueError:
+                break
+            else:
+                del npath[np], path[np]
+                # ha!
+                p = np
+
+        return
+
+    def check_version_conflict(self):
+        if self.key == 'setuptools':
+            # ignore the inevitable setuptools self-conflicts  :(
+            return
+
+        nsp = dict.fromkeys(self._get_metadata('namespace_packages.txt'))
+        loc = normalize_path(self.location)
+        for modname in self._get_metadata('top_level.txt'):
+            if (modname not in sys.modules or modname in nsp
+                    or modname in _namespace_packages):
+                continue
+            if modname in ('pkg_resources', 'setuptools', 'site'):
+                continue
+            fn = getattr(sys.modules[modname], '__file__', None)
+            if fn and (normalize_path(fn).startswith(loc) or
+                       fn.startswith(self.location)):
+                continue
+            issue_warning(
+                "Module %s was already imported from %s, but %s is being added"
+                " to sys.path" % (modname, fn, self.location),
+            )
+
+    def has_version(self):
+        try:
+            self.version
+        except ValueError:
+            issue_warning("Unbuilt egg for " + repr(self))
+            return False
+        return True
+
+    def clone(self, **kw):
+        """Copy this distribution, substituting in any changed keyword args"""
+        names = 'project_name version py_version platform location precedence'
+        for attr in names.split():
+            kw.setdefault(attr, getattr(self, attr, None))
+        kw.setdefault('metadata', self._provider)
+        return self.__class__(**kw)
+
+    @property
+    def extras(self):
+        return [dep for dep in self._dep_map if dep]
+
+
+class EggInfoDistribution(Distribution):
+    def _reload_version(self):
+        """
+        Packages installed by distutils (e.g. numpy or scipy),
+        which uses an old safe_version, and so
+        their version numbers can get mangled when
+        converted to filenames (e.g., 1.11.0.dev0+2329eae to
+        1.11.0.dev0_2329eae). These distributions will not be
+        parsed properly
+        downstream by Distribution and safe_version, so
+        take an extra step and try to get the version number from
+        the metadata file itself instead of the filename.
+        """
+        md_version = self._get_version()
+        if md_version:
+            self._version = md_version
+        return self
+
+
+class DistInfoDistribution(Distribution):
+    """
+    Wrap an actual or potential sys.path entry
+    w/metadata, .dist-info style.
+    """
+    PKG_INFO = 'METADATA'
+    EQEQ = re.compile(r"([\(,])\s*(\d.*?)\s*([,\)])")
+
+    @property
+    def _parsed_pkg_info(self):
+        """Parse and cache metadata"""
+        try:
+            return self._pkg_info
+        except AttributeError:
+            metadata = self.get_metadata(self.PKG_INFO)
+            self._pkg_info = email.parser.Parser().parsestr(metadata)
+            return self._pkg_info
+
+    @property
+    def _dep_map(self):
+        try:
+            return self.__dep_map
+        except AttributeError:
+            self.__dep_map = self._compute_dependencies()
+            return self.__dep_map
+
+    def _compute_dependencies(self):
+        """Recompute this distribution's dependencies."""
+        dm = self.__dep_map = {None: []}
+
+        reqs = []
+        # Including any condition expressions
+        for req in self._parsed_pkg_info.get_all('Requires-Dist') or []:
+            reqs.extend(parse_requirements(req))
+
+        def reqs_for_extra(extra):
+            for req in reqs:
+                if not req.marker or req.marker.evaluate({'extra': extra}):
+                    yield req
+
+        common = frozenset(reqs_for_extra(None))
+        dm[None].extend(common)
+
+        for extra in self._parsed_pkg_info.get_all('Provides-Extra') or []:
+            s_extra = safe_extra(extra.strip())
+            dm[s_extra] = list(frozenset(reqs_for_extra(extra)) - common)
+
+        return dm
+
+
+_distributionImpl = {
+    '.egg': Distribution,
+    '.egg-info': EggInfoDistribution,
+    '.dist-info': DistInfoDistribution,
+}
+
+
+def issue_warning(*args, **kw):
+    level = 1
+    g = globals()
+    try:
+        # find the first stack frame that is *not* code in
+        # the pkg_resources module, to use for the warning
+        while sys._getframe(level).f_globals is g:
+            level += 1
+    except ValueError:
+        pass
+    warnings.warn(stacklevel=level + 1, *args, **kw)
+
+
+class RequirementParseError(ValueError):
+    def __str__(self):
+        return ' '.join(self.args)
+
+
+def parse_requirements(strs):
+    """Yield ``Requirement`` objects for each specification in `strs`
+
+    `strs` must be a string, or a (possibly-nested) iterable thereof.
+    """
+    # create a steppable iterator, so we can handle \-continuations
+    lines = iter(yield_lines(strs))
+
+    for line in lines:
+        # Drop comments -- a hash without a space may be in a URL.
+        if ' #' in line:
+            line = line[:line.find(' #')]
+        # If there is a line continuation, drop it, and append the next line.
+        if line.endswith('\\'):
+            line = line[:-2].strip()
+            try:
+                line += next(lines)
+            except StopIteration:
+                return
+        yield Requirement(line)
+
+
+class Requirement(packaging.requirements.Requirement):
+    def __init__(self, requirement_string):
+        """DO NOT CALL THIS UNDOCUMENTED METHOD; use Requirement.parse()!"""
+        try:
+            super(Requirement, self).__init__(requirement_string)
+        except packaging.requirements.InvalidRequirement as e:
+            raise RequirementParseError(str(e))
+        self.unsafe_name = self.name
+        project_name = safe_name(self.name)
+        self.project_name, self.key = project_name, project_name.lower()
+        self.specs = [
+            (spec.operator, spec.version) for spec in self.specifier]
+        self.extras = tuple(map(safe_extra, self.extras))
+        self.hashCmp = (
+            self.key,
+            self.url,
+            self.specifier,
+            frozenset(self.extras),
+            str(self.marker) if self.marker else None,
+        )
+        self.__hash = hash(self.hashCmp)
+
+    def __eq__(self, other):
+        return (
+            isinstance(other, Requirement) and
+            self.hashCmp == other.hashCmp
+        )
+
+    def __ne__(self, other):
+        return not self == other
+
+    def __contains__(self, item):
+        if isinstance(item, Distribution):
+            if item.key != self.key:
+                return False
+
+            item = item.version
+
+        # Allow prereleases always in order to match the previous behavior of
+        # this method. In the future this should be smarter and follow PEP 440
+        # more accurately.
+        return self.specifier.contains(item, prereleases=True)
+
+    def __hash__(self):
+        return self.__hash
+
+    def __repr__(self):
+        return "Requirement.parse(%r)" % str(self)
+
+    @staticmethod
+    def parse(s):
+        req, = parse_requirements(s)
+        return req
+
+
+def _always_object(classes):
+    """
+    Ensure object appears in the mro even
+    for old-style classes.
+    """
+    if object not in classes:
+        return classes + (object,)
+    return classes
+
+
+def _find_adapter(registry, ob):
+    """Return an adapter factory for `ob` from `registry`"""
+    types = _always_object(inspect.getmro(getattr(ob, '__class__', type(ob))))
+    for t in types:
+        if t in registry:
+            return registry[t]
+
+
+def ensure_directory(path):
+    """Ensure that the parent directory of `path` exists"""
+    dirname = os.path.dirname(path)
+    py31compat.makedirs(dirname, exist_ok=True)
+
+
+def _bypass_ensure_directory(path):
+    """Sandbox-bypassing version of ensure_directory()"""
+    if not WRITE_SUPPORT:
+        raise IOError('"os.mkdir" not supported on this platform.')
+    dirname, filename = split(path)
+    if dirname and filename and not isdir(dirname):
+        _bypass_ensure_directory(dirname)
+        try:
+            mkdir(dirname, 0o755)
+        except FileExistsError:
+            pass
+
+
+def split_sections(s):
+    """Split a string or iterable thereof into (section, content) pairs
+
+    Each ``section`` is a stripped version of the section header ("[section]")
+    and each ``content`` is a list of stripped lines excluding blank lines and
+    comment-only lines.  If there are any such lines before the first section
+    header, they're returned in a first ``section`` of ``None``.
+    """
+    section = None
+    content = []
+    for line in yield_lines(s):
+        if line.startswith("["):
+            if line.endswith("]"):
+                if section or content:
+                    yield section, content
+                section = line[1:-1].strip()
+                content = []
+            else:
+                raise ValueError("Invalid section heading", line)
+        else:
+            content.append(line)
+
+    # wrap up last segment
+    yield section, content
+
+
+def _mkstemp(*args, **kw):
+    old_open = os.open
+    try:
+        # temporarily bypass sandboxing
+        os.open = os_open
+        return tempfile.mkstemp(*args, **kw)
+    finally:
+        # and then put it back
+        os.open = old_open
+
+
+# Silence the PEP440Warning by default, so that end users don't get hit by it
+# randomly just because they use pkg_resources. We want to append the rule
+# because we want earlier uses of filterwarnings to take precedence over this
+# one.
+warnings.filterwarnings("ignore", category=PEP440Warning, append=True)
+
+
+# from jaraco.functools 1.3
+def _call_aside(f, *args, **kwargs):
+    f(*args, **kwargs)
+    return f
+
+
+@_call_aside
+def _initialize(g=globals()):
+    "Set up global resource manager (deliberately not state-saved)"
+    manager = ResourceManager()
+    g['_manager'] = manager
+    g.update(
+        (name, getattr(manager, name))
+        for name in dir(manager)
+        if not name.startswith('_')
+    )
+
+
+@_call_aside
+def _initialize_master_working_set():
+    """
+    Prepare the master working set and make the ``require()``
+    API available.
+
+    This function has explicit effects on the global state
+    of pkg_resources. It is intended to be invoked once at
+    the initialization of this module.
+
+    Invocation by other packages is unsupported and done
+    at their own risk.
+    """
+    working_set = WorkingSet._build_master()
+    _declare_state('object', working_set=working_set)
+
+    require = working_set.require
+    iter_entry_points = working_set.iter_entry_points
+    add_activation_listener = working_set.subscribe
+    run_script = working_set.run_script
+    # backward compatibility
+    run_main = run_script
+    # Activate all distributions already on sys.path with replace=False and
+    # ensure that all distributions added to the working set in the future
+    # (e.g. by calling ``require()``) will get activated as well,
+    # with higher priority (replace=True).
+    tuple(
+        dist.activate(replace=False)
+        for dist in working_set
+    )
+    add_activation_listener(
+        lambda dist: dist.activate(replace=True),
+        existing=False,
+    )
+    working_set.entries = []
+    # match order
+    list(map(working_set.add_entry, sys.path))
+    globals().update(locals())
+
+class PkgResourcesDeprecationWarning(Warning):
+    """
+    Base class for warning about deprecations in ``pkg_resources``
+
+    This class is not derived from ``DeprecationWarning``, and as such is
+    visible by default.
+    """
diff --git a/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..bfd6f87e6
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/py31compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/py31compat.cpython-36.pyc
new file mode 100644
index 000000000..7bb2f7014
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/pkg_resources/__pycache__/py31compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/pkg_resources/py31compat.py b/venv/Lib/site-packages/pip/_vendor/pkg_resources/py31compat.py
new file mode 100644
index 000000000..a2d3007ce
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pkg_resources/py31compat.py
@@ -0,0 +1,23 @@
+import os
+import errno
+import sys
+
+from pip._vendor import six
+
+
+def _makedirs_31(path, exist_ok=False):
+    try:
+        os.makedirs(path)
+    except OSError as exc:
+        if not exist_ok or exc.errno != errno.EEXIST:
+            raise
+
+
+# rely on compatibility behavior until mode considerations
+#  and exists_ok considerations are disentangled.
+# See https://github.com/pypa/setuptools/pull/1083#issuecomment-315168663
+needs_makedirs = (
+    six.PY2 or
+    (3, 4) <= sys.version_info < (3, 4, 1)
+)
+makedirs = _makedirs_31 if needs_makedirs else os.makedirs
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/__init__.py b/venv/Lib/site-packages/pip/_vendor/progress/__init__.py
new file mode 100644
index 000000000..e434c257f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/progress/__init__.py
@@ -0,0 +1,177 @@
+# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
+#
+# Permission to use, copy, modify, and distribute this software for any
+# purpose with or without fee is hereby granted, provided that the above
+# copyright notice and this permission notice appear in all copies.
+#
+# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+from __future__ import division, print_function
+
+from collections import deque
+from datetime import timedelta
+from math import ceil
+from sys import stderr
+try:
+    from time import monotonic
+except ImportError:
+    from time import time as monotonic
+
+
+__version__ = '1.5'
+
+HIDE_CURSOR = '\x1b[?25l'
+SHOW_CURSOR = '\x1b[?25h'
+
+
+class Infinite(object):
+    file = stderr
+    sma_window = 10         # Simple Moving Average window
+    check_tty = True
+    hide_cursor = True
+
+    def __init__(self, message='', **kwargs):
+        self.index = 0
+        self.start_ts = monotonic()
+        self.avg = 0
+        self._avg_update_ts = self.start_ts
+        self._ts = self.start_ts
+        self._xput = deque(maxlen=self.sma_window)
+        for key, val in kwargs.items():
+            setattr(self, key, val)
+
+        self._width = 0
+        self.message = message
+
+        if self.file and self.is_tty():
+            if self.hide_cursor:
+                print(HIDE_CURSOR, end='', file=self.file)
+            print(self.message, end='', file=self.file)
+            self.file.flush()
+
+    def __getitem__(self, key):
+        if key.startswith('_'):
+            return None
+        return getattr(self, key, None)
+
+    @property
+    def elapsed(self):
+        return int(monotonic() - self.start_ts)
+
+    @property
+    def elapsed_td(self):
+        return timedelta(seconds=self.elapsed)
+
+    def update_avg(self, n, dt):
+        if n > 0:
+            xput_len = len(self._xput)
+            self._xput.append(dt / n)
+            now = monotonic()
+            # update when we're still filling _xput, then after every second
+            if (xput_len < self.sma_window or
+                    now - self._avg_update_ts > 1):
+                self.avg = sum(self._xput) / len(self._xput)
+                self._avg_update_ts = now
+
+    def update(self):
+        pass
+
+    def start(self):
+        pass
+
+    def clearln(self):
+        if self.file and self.is_tty():
+            print('\r\x1b[K', end='', file=self.file)
+
+    def write(self, s):
+        if self.file and self.is_tty():
+            line = self.message + s.ljust(self._width)
+            print('\r' + line, end='', file=self.file)
+            self._width = max(self._width, len(s))
+            self.file.flush()
+
+    def writeln(self, line):
+        if self.file and self.is_tty():
+            self.clearln()
+            print(line, end='', file=self.file)
+            self.file.flush()
+
+    def finish(self):
+        if self.file and self.is_tty():
+            print(file=self.file)
+            if self.hide_cursor:
+                print(SHOW_CURSOR, end='', file=self.file)
+
+    def is_tty(self):
+        return self.file.isatty() if self.check_tty else True
+
+    def next(self, n=1):
+        now = monotonic()
+        dt = now - self._ts
+        self.update_avg(n, dt)
+        self._ts = now
+        self.index = self.index + n
+        self.update()
+
+    def iter(self, it):
+        with self:
+            for x in it:
+                yield x
+                self.next()
+
+    def __enter__(self):
+        self.start()
+        return self
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        self.finish()
+
+
+class Progress(Infinite):
+    def __init__(self, *args, **kwargs):
+        super(Progress, self).__init__(*args, **kwargs)
+        self.max = kwargs.get('max', 100)
+
+    @property
+    def eta(self):
+        return int(ceil(self.avg * self.remaining))
+
+    @property
+    def eta_td(self):
+        return timedelta(seconds=self.eta)
+
+    @property
+    def percent(self):
+        return self.progress * 100
+
+    @property
+    def progress(self):
+        return min(1, self.index / self.max)
+
+    @property
+    def remaining(self):
+        return max(self.max - self.index, 0)
+
+    def start(self):
+        self.update()
+
+    def goto(self, index):
+        incr = index - self.index
+        self.next(incr)
+
+    def iter(self, it):
+        try:
+            self.max = len(it)
+        except TypeError:
+            pass
+
+        with self:
+            for x in it:
+                yield x
+                self.next()
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..83c7c1027
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/bar.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/bar.cpython-36.pyc
new file mode 100644
index 000000000..b00a9bd81
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/bar.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/counter.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/counter.cpython-36.pyc
new file mode 100644
index 000000000..2fa645040
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/counter.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc
new file mode 100644
index 000000000..83ea63078
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/progress/__pycache__/spinner.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/bar.py b/venv/Lib/site-packages/pip/_vendor/progress/bar.py
new file mode 100644
index 000000000..8819efda6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/progress/bar.py
@@ -0,0 +1,91 @@
+# -*- coding: utf-8 -*-
+
+# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
+#
+# Permission to use, copy, modify, and distribute this software for any
+# purpose with or without fee is hereby granted, provided that the above
+# copyright notice and this permission notice appear in all copies.
+#
+# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+from __future__ import unicode_literals
+
+import sys
+
+from . import Progress
+
+
+class Bar(Progress):
+    width = 32
+    suffix = '%(index)d/%(max)d'
+    bar_prefix = ' |'
+    bar_suffix = '| '
+    empty_fill = ' '
+    fill = '#'
+
+    def update(self):
+        filled_length = int(self.width * self.progress)
+        empty_length = self.width - filled_length
+
+        message = self.message % self
+        bar = self.fill * filled_length
+        empty = self.empty_fill * empty_length
+        suffix = self.suffix % self
+        line = ''.join([message, self.bar_prefix, bar, empty, self.bar_suffix,
+                        suffix])
+        self.writeln(line)
+
+
+class ChargingBar(Bar):
+    suffix = '%(percent)d%%'
+    bar_prefix = ' '
+    bar_suffix = ' '
+    empty_fill = '∙'
+    fill = '█'
+
+
+class FillingSquaresBar(ChargingBar):
+    empty_fill = '▢'
+    fill = '▣'
+
+
+class FillingCirclesBar(ChargingBar):
+    empty_fill = '◯'
+    fill = '◉'
+
+
+class IncrementalBar(Bar):
+    if sys.platform.startswith('win'):
+        phases = (u' ', u'▌', u'█')
+    else:
+        phases = (' ', '▏', '▎', '▍', '▌', '▋', '▊', '▉', '█')
+
+    def update(self):
+        nphases = len(self.phases)
+        filled_len = self.width * self.progress
+        nfull = int(filled_len)                      # Number of full chars
+        phase = int((filled_len - nfull) * nphases)  # Phase of last char
+        nempty = self.width - nfull                  # Number of empty chars
+
+        message = self.message % self
+        bar = self.phases[-1] * nfull
+        current = self.phases[phase] if phase > 0 else ''
+        empty = self.empty_fill * max(0, nempty - len(current))
+        suffix = self.suffix % self
+        line = ''.join([message, self.bar_prefix, bar, current, empty,
+                        self.bar_suffix, suffix])
+        self.writeln(line)
+
+
+class PixelBar(IncrementalBar):
+    phases = ('⡀', '⡄', '⡆', '⡇', '⣇', '⣧', '⣷', '⣿')
+
+
+class ShadyBar(IncrementalBar):
+    phases = (' ', '░', '▒', '▓', '█')
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/counter.py b/venv/Lib/site-packages/pip/_vendor/progress/counter.py
new file mode 100644
index 000000000..d955ca477
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/progress/counter.py
@@ -0,0 +1,41 @@
+# -*- coding: utf-8 -*-
+
+# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
+#
+# Permission to use, copy, modify, and distribute this software for any
+# purpose with or without fee is hereby granted, provided that the above
+# copyright notice and this permission notice appear in all copies.
+#
+# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+from __future__ import unicode_literals
+from . import Infinite, Progress
+
+
+class Counter(Infinite):
+    def update(self):
+        self.write(str(self.index))
+
+
+class Countdown(Progress):
+    def update(self):
+        self.write(str(self.remaining))
+
+
+class Stack(Progress):
+    phases = (' ', '▁', '▂', '▃', '▄', '▅', '▆', '▇', '█')
+
+    def update(self):
+        nphases = len(self.phases)
+        i = min(nphases - 1, int(self.progress * nphases))
+        self.write(self.phases[i])
+
+
+class Pie(Stack):
+    phases = ('○', '◔', '◑', '◕', '●')
diff --git a/venv/Lib/site-packages/pip/_vendor/progress/spinner.py b/venv/Lib/site-packages/pip/_vendor/progress/spinner.py
new file mode 100644
index 000000000..4e100cabb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/progress/spinner.py
@@ -0,0 +1,43 @@
+# -*- coding: utf-8 -*-
+
+# Copyright (c) 2012 Giorgos Verigakis <verigak@gmail.com>
+#
+# Permission to use, copy, modify, and distribute this software for any
+# purpose with or without fee is hereby granted, provided that the above
+# copyright notice and this permission notice appear in all copies.
+#
+# THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES
+# WITH REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF
+# MERCHANTABILITY AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR
+# ANY SPECIAL, DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES
+# WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, WHETHER IN AN
+# ACTION OF CONTRACT, NEGLIGENCE OR OTHER TORTIOUS ACTION, ARISING OUT OF
+# OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE.
+
+from __future__ import unicode_literals
+from . import Infinite
+
+
+class Spinner(Infinite):
+    phases = ('-', '\\', '|', '/')
+    hide_cursor = True
+
+    def update(self):
+        i = self.index % len(self.phases)
+        self.write(self.phases[i])
+
+
+class PieSpinner(Spinner):
+    phases = ['◷', '◶', '◵', '◴']
+
+
+class MoonSpinner(Spinner):
+    phases = ['◑', '◒', '◐', '◓']
+
+
+class LineSpinner(Spinner):
+    phases = ['⎺', '⎻', '⎼', '⎽', '⎼', '⎻']
+
+
+class PixelSpinner(Spinner):
+    phases = ['⣾', '⣷', '⣯', '⣟', '⡿', '⢿', '⣻', '⣽']
diff --git a/venv/Lib/site-packages/pip/_vendor/pyparsing.py b/venv/Lib/site-packages/pip/_vendor/pyparsing.py
new file mode 100644
index 000000000..7ebc7eb99
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/pyparsing.py
@@ -0,0 +1,7107 @@
+# -*- coding: utf-8 -*-
+# module pyparsing.py
+#
+# Copyright (c) 2003-2019  Paul T. McGuire
+#
+# Permission is hereby granted, free of charge, to any person obtaining
+# a copy of this software and associated documentation files (the
+# "Software"), to deal in the Software without restriction, including
+# without limitation the rights to use, copy, modify, merge, publish,
+# distribute, sublicense, and/or sell copies of the Software, and to
+# permit persons to whom the Software is furnished to do so, subject to
+# the following conditions:
+#
+# The above copyright notice and this permission notice shall be
+# included in all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+
+__doc__ = \
+"""
+pyparsing module - Classes and methods to define and execute parsing grammars
+=============================================================================
+
+The pyparsing module is an alternative approach to creating and
+executing simple grammars, vs. the traditional lex/yacc approach, or the
+use of regular expressions.  With pyparsing, you don't need to learn
+a new syntax for defining grammars or matching expressions - the parsing
+module provides a library of classes that you use to construct the
+grammar directly in Python.
+
+Here is a program to parse "Hello, World!" (or any greeting of the form
+``"<salutation>, <addressee>!"``), built up using :class:`Word`,
+:class:`Literal`, and :class:`And` elements
+(the :class:`'+'<ParserElement.__add__>` operators create :class:`And` expressions,
+and the strings are auto-converted to :class:`Literal` expressions)::
+
+    from pip._vendor.pyparsing import Word, alphas
+
+    # define grammar of a greeting
+    greet = Word(alphas) + "," + Word(alphas) + "!"
+
+    hello = "Hello, World!"
+    print (hello, "->", greet.parseString(hello))
+
+The program outputs the following::
+
+    Hello, World! -> ['Hello', ',', 'World', '!']
+
+The Python representation of the grammar is quite readable, owing to the
+self-explanatory class names, and the use of '+', '|' and '^' operators.
+
+The :class:`ParseResults` object returned from
+:class:`ParserElement.parseString` can be
+accessed as a nested list, a dictionary, or an object with named
+attributes.
+
+The pyparsing module handles some of the problems that are typically
+vexing when writing text parsers:
+
+  - extra or missing whitespace (the above program will also handle
+    "Hello,World!", "Hello  ,  World  !", etc.)
+  - quoted strings
+  - embedded comments
+
+
+Getting Started -
+-----------------
+Visit the classes :class:`ParserElement` and :class:`ParseResults` to
+see the base classes that most other pyparsing
+classes inherit from. Use the docstrings for examples of how to:
+
+ - construct literal match expressions from :class:`Literal` and
+   :class:`CaselessLiteral` classes
+ - construct character word-group expressions using the :class:`Word`
+   class
+ - see how to create repetitive expressions using :class:`ZeroOrMore`
+   and :class:`OneOrMore` classes
+ - use :class:`'+'<And>`, :class:`'|'<MatchFirst>`, :class:`'^'<Or>`,
+   and :class:`'&'<Each>` operators to combine simple expressions into
+   more complex ones
+ - associate names with your parsed results using
+   :class:`ParserElement.setResultsName`
+ - access the parsed data, which is returned as a :class:`ParseResults`
+   object
+ - find some helpful expression short-cuts like :class:`delimitedList`
+   and :class:`oneOf`
+ - find more useful common expressions in the :class:`pyparsing_common`
+   namespace class
+"""
+
+__version__ = "2.4.7"
+__versionTime__ = "30 Mar 2020 00:43 UTC"
+__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
+
+import string
+from weakref import ref as wkref
+import copy
+import sys
+import warnings
+import re
+import sre_constants
+import collections
+import pprint
+import traceback
+import types
+from datetime import datetime
+from operator import itemgetter
+import itertools
+from functools import wraps
+from contextlib import contextmanager
+
+try:
+    # Python 3
+    from itertools import filterfalse
+except ImportError:
+    from itertools import ifilterfalse as filterfalse
+
+try:
+    from _thread import RLock
+except ImportError:
+    from threading import RLock
+
+try:
+    # Python 3
+    from collections.abc import Iterable
+    from collections.abc import MutableMapping, Mapping
+except ImportError:
+    # Python 2.7
+    from collections import Iterable
+    from collections import MutableMapping, Mapping
+
+try:
+    from collections import OrderedDict as _OrderedDict
+except ImportError:
+    try:
+        from ordereddict import OrderedDict as _OrderedDict
+    except ImportError:
+        _OrderedDict = None
+
+try:
+    from types import SimpleNamespace
+except ImportError:
+    class SimpleNamespace: pass
+
+# version compatibility configuration
+__compat__ = SimpleNamespace()
+__compat__.__doc__ = """
+    A cross-version compatibility configuration for pyparsing features that will be
+    released in a future version. By setting values in this configuration to True,
+    those features can be enabled in prior versions for compatibility development
+    and testing.
+
+     - collect_all_And_tokens - flag to enable fix for Issue #63 that fixes erroneous grouping
+       of results names when an And expression is nested within an Or or MatchFirst; set to
+       True to enable bugfix released in pyparsing 2.3.0, or False to preserve
+       pre-2.3.0 handling of named results
+"""
+__compat__.collect_all_And_tokens = True
+
+__diag__ = SimpleNamespace()
+__diag__.__doc__ = """
+Diagnostic configuration (all default to False)
+     - warn_multiple_tokens_in_named_alternation - flag to enable warnings when a results
+       name is defined on a MatchFirst or Or expression with one or more And subexpressions
+       (only warns if __compat__.collect_all_And_tokens is False)
+     - warn_ungrouped_named_tokens_in_collection - flag to enable warnings when a results
+       name is defined on a containing expression with ungrouped subexpressions that also
+       have results names
+     - warn_name_set_on_empty_Forward - flag to enable warnings whan a Forward is defined
+       with a results name, but has no contents defined
+     - warn_on_multiple_string_args_to_oneof - flag to enable warnings whan oneOf is
+       incorrectly called with multiple str arguments
+     - enable_debug_on_named_expressions - flag to auto-enable debug on all subsequent
+       calls to ParserElement.setName()
+"""
+__diag__.warn_multiple_tokens_in_named_alternation = False
+__diag__.warn_ungrouped_named_tokens_in_collection = False
+__diag__.warn_name_set_on_empty_Forward = False
+__diag__.warn_on_multiple_string_args_to_oneof = False
+__diag__.enable_debug_on_named_expressions = False
+__diag__._all_names = [nm for nm in vars(__diag__) if nm.startswith("enable_") or nm.startswith("warn_")]
+
+def _enable_all_warnings():
+    __diag__.warn_multiple_tokens_in_named_alternation = True
+    __diag__.warn_ungrouped_named_tokens_in_collection = True
+    __diag__.warn_name_set_on_empty_Forward = True
+    __diag__.warn_on_multiple_string_args_to_oneof = True
+__diag__.enable_all_warnings = _enable_all_warnings
+
+
+__all__ = ['__version__', '__versionTime__', '__author__', '__compat__', '__diag__',
+           'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
+           'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
+           'PrecededBy', 'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
+           'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
+           'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
+           'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter',
+           'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore', 'Char',
+           'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
+           'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
+           'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
+           'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
+           'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
+           'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
+           'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity',
+           'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
+           'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
+           'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation', 'locatedExpr', 'withClass',
+           'CloseMatch', 'tokenMap', 'pyparsing_common', 'pyparsing_unicode', 'unicode_set',
+           'conditionAsParseAction', 're',
+           ]
+
+system_version = tuple(sys.version_info)[:3]
+PY_3 = system_version[0] == 3
+if PY_3:
+    _MAX_INT = sys.maxsize
+    basestring = str
+    unichr = chr
+    unicode = str
+    _ustr = str
+
+    # build list of single arg builtins, that can be used as parse actions
+    singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
+
+else:
+    _MAX_INT = sys.maxint
+    range = xrange
+
+    def _ustr(obj):
+        """Drop-in replacement for str(obj) that tries to be Unicode
+        friendly. It first tries str(obj). If that fails with
+        a UnicodeEncodeError, then it tries unicode(obj). It then
+        < returns the unicode object | encodes it with the default
+        encoding | ... >.
+        """
+        if isinstance(obj, unicode):
+            return obj
+
+        try:
+            # If this works, then _ustr(obj) has the same behaviour as str(obj), so
+            # it won't break any existing code.
+            return str(obj)
+
+        except UnicodeEncodeError:
+            # Else encode it
+            ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
+            xmlcharref = Regex(r'&#\d+;')
+            xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
+            return xmlcharref.transformString(ret)
+
+    # build list of single arg builtins, tolerant of Python version, that can be used as parse actions
+    singleArgBuiltins = []
+    import __builtin__
+
+    for fname in "sum len sorted reversed list tuple set any all min max".split():
+        try:
+            singleArgBuiltins.append(getattr(__builtin__, fname))
+        except AttributeError:
+            continue
+
+_generatorType = type((y for y in range(1)))
+
+def _xml_escape(data):
+    """Escape &, <, >, ", ', etc. in a string of data."""
+
+    # ampersand must be replaced first
+    from_symbols = '&><"\''
+    to_symbols = ('&' + s + ';' for s in "amp gt lt quot apos".split())
+    for from_, to_ in zip(from_symbols, to_symbols):
+        data = data.replace(from_, to_)
+    return data
+
+alphas = string.ascii_uppercase + string.ascii_lowercase
+nums = "0123456789"
+hexnums = nums + "ABCDEFabcdef"
+alphanums = alphas + nums
+_bslash = chr(92)
+printables = "".join(c for c in string.printable if c not in string.whitespace)
+
+
+def conditionAsParseAction(fn, message=None, fatal=False):
+    msg = message if message is not None else "failed user-defined condition"
+    exc_type = ParseFatalException if fatal else ParseException
+    fn = _trim_arity(fn)
+
+    @wraps(fn)
+    def pa(s, l, t):
+        if not bool(fn(s, l, t)):
+            raise exc_type(s, l, msg)
+
+    return pa
+
+class ParseBaseException(Exception):
+    """base exception class for all parsing runtime exceptions"""
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__(self, pstr, loc=0, msg=None, elem=None):
+        self.loc = loc
+        if msg is None:
+            self.msg = pstr
+            self.pstr = ""
+        else:
+            self.msg = msg
+            self.pstr = pstr
+        self.parserElement = elem
+        self.args = (pstr, loc, msg)
+
+    @classmethod
+    def _from_exception(cls, pe):
+        """
+        internal factory method to simplify creating one type of ParseException
+        from another - avoids having __init__ signature conflicts among subclasses
+        """
+        return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
+
+    def __getattr__(self, aname):
+        """supported attributes by name are:
+           - lineno - returns the line number of the exception text
+           - col - returns the column number of the exception text
+           - line - returns the line containing the exception text
+        """
+        if aname == "lineno":
+            return lineno(self.loc, self.pstr)
+        elif aname in ("col", "column"):
+            return col(self.loc, self.pstr)
+        elif aname == "line":
+            return line(self.loc, self.pstr)
+        else:
+            raise AttributeError(aname)
+
+    def __str__(self):
+        if self.pstr:
+            if self.loc >= len(self.pstr):
+                foundstr = ', found end of text'
+            else:
+                foundstr = (', found %r' % self.pstr[self.loc:self.loc + 1]).replace(r'\\', '\\')
+        else:
+            foundstr = ''
+        return ("%s%s  (at char %d), (line:%d, col:%d)" %
+                   (self.msg, foundstr, self.loc, self.lineno, self.column))
+    def __repr__(self):
+        return _ustr(self)
+    def markInputline(self, markerString=">!<"):
+        """Extracts the exception line from the input string, and marks
+           the location of the exception with a special symbol.
+        """
+        line_str = self.line
+        line_column = self.column - 1
+        if markerString:
+            line_str = "".join((line_str[:line_column],
+                                markerString, line_str[line_column:]))
+        return line_str.strip()
+    def __dir__(self):
+        return "lineno col line".split() + dir(type(self))
+
+class ParseException(ParseBaseException):
+    """
+    Exception thrown when parse expressions don't match class;
+    supported attributes by name are:
+    - lineno - returns the line number of the exception text
+    - col - returns the column number of the exception text
+    - line - returns the line containing the exception text
+
+    Example::
+
+        try:
+            Word(nums).setName("integer").parseString("ABC")
+        except ParseException as pe:
+            print(pe)
+            print("column: {}".format(pe.col))
+
+    prints::
+
+       Expected integer (at char 0), (line:1, col:1)
+        column: 1
+
+    """
+
+    @staticmethod
+    def explain(exc, depth=16):
+        """
+        Method to take an exception and translate the Python internal traceback into a list
+        of the pyparsing expressions that caused the exception to be raised.
+
+        Parameters:
+
+         - exc - exception raised during parsing (need not be a ParseException, in support
+           of Python exceptions that might be raised in a parse action)
+         - depth (default=16) - number of levels back in the stack trace to list expression
+           and function names; if None, the full stack trace names will be listed; if 0, only
+           the failing input line, marker, and exception string will be shown
+
+        Returns a multi-line string listing the ParserElements and/or function names in the
+        exception's stack trace.
+
+        Note: the diagnostic output will include string representations of the expressions
+        that failed to parse. These representations will be more helpful if you use `setName` to
+        give identifiable names to your expressions. Otherwise they will use the default string
+        forms, which may be cryptic to read.
+
+        explain() is only supported under Python 3.
+        """
+        import inspect
+
+        if depth is None:
+            depth = sys.getrecursionlimit()
+        ret = []
+        if isinstance(exc, ParseBaseException):
+            ret.append(exc.line)
+            ret.append(' ' * (exc.col - 1) + '^')
+        ret.append("{0}: {1}".format(type(exc).__name__, exc))
+
+        if depth > 0:
+            callers = inspect.getinnerframes(exc.__traceback__, context=depth)
+            seen = set()
+            for i, ff in enumerate(callers[-depth:]):
+                frm = ff[0]
+
+                f_self = frm.f_locals.get('self', None)
+                if isinstance(f_self, ParserElement):
+                    if frm.f_code.co_name not in ('parseImpl', '_parseNoCache'):
+                        continue
+                    if f_self in seen:
+                        continue
+                    seen.add(f_self)
+
+                    self_type = type(f_self)
+                    ret.append("{0}.{1} - {2}".format(self_type.__module__,
+                                                      self_type.__name__,
+                                                      f_self))
+                elif f_self is not None:
+                    self_type = type(f_self)
+                    ret.append("{0}.{1}".format(self_type.__module__,
+                                                self_type.__name__))
+                else:
+                    code = frm.f_code
+                    if code.co_name in ('wrapper', '<module>'):
+                        continue
+
+                    ret.append("{0}".format(code.co_name))
+
+                depth -= 1
+                if not depth:
+                    break
+
+        return '\n'.join(ret)
+
+
+class ParseFatalException(ParseBaseException):
+    """user-throwable exception thrown when inconsistent parse content
+       is found; stops all parsing immediately"""
+    pass
+
+class ParseSyntaxException(ParseFatalException):
+    """just like :class:`ParseFatalException`, but thrown internally
+    when an :class:`ErrorStop<And._ErrorStop>` ('-' operator) indicates
+    that parsing is to stop immediately because an unbacktrackable
+    syntax error has been found.
+    """
+    pass
+
+#~ class ReparseException(ParseBaseException):
+    #~ """Experimental class - parse actions can raise this exception to cause
+       #~ pyparsing to reparse the input string:
+        #~ - with a modified input string, and/or
+        #~ - with a modified start location
+       #~ Set the values of the ReparseException in the constructor, and raise the
+       #~ exception in a parse action to cause pyparsing to use the new string/location.
+       #~ Setting the values as None causes no change to be made.
+       #~ """
+    #~ def __init_( self, newstring, restartLoc ):
+        #~ self.newParseText = newstring
+        #~ self.reparseLoc = restartLoc
+
+class RecursiveGrammarException(Exception):
+    """exception thrown by :class:`ParserElement.validate` if the
+    grammar could be improperly recursive
+    """
+    def __init__(self, parseElementList):
+        self.parseElementTrace = parseElementList
+
+    def __str__(self):
+        return "RecursiveGrammarException: %s" % self.parseElementTrace
+
+class _ParseResultsWithOffset(object):
+    def __init__(self, p1, p2):
+        self.tup = (p1, p2)
+    def __getitem__(self, i):
+        return self.tup[i]
+    def __repr__(self):
+        return repr(self.tup[0])
+    def setOffset(self, i):
+        self.tup = (self.tup[0], i)
+
+class ParseResults(object):
+    """Structured parse results, to provide multiple means of access to
+    the parsed data:
+
+       - as a list (``len(results)``)
+       - by list index (``results[0], results[1]``, etc.)
+       - by attribute (``results.<resultsName>`` - see :class:`ParserElement.setResultsName`)
+
+    Example::
+
+        integer = Word(nums)
+        date_str = (integer.setResultsName("year") + '/'
+                        + integer.setResultsName("month") + '/'
+                        + integer.setResultsName("day"))
+        # equivalent form:
+        # date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+        # parseString returns a ParseResults object
+        result = date_str.parseString("1999/12/31")
+
+        def test(s, fn=repr):
+            print("%s -> %s" % (s, fn(eval(s))))
+        test("list(result)")
+        test("result[0]")
+        test("result['month']")
+        test("result.day")
+        test("'month' in result")
+        test("'minutes' in result")
+        test("result.dump()", str)
+
+    prints::
+
+        list(result) -> ['1999', '/', '12', '/', '31']
+        result[0] -> '1999'
+        result['month'] -> '12'
+        result.day -> '31'
+        'month' in result -> True
+        'minutes' in result -> False
+        result.dump() -> ['1999', '/', '12', '/', '31']
+        - day: 31
+        - month: 12
+        - year: 1999
+    """
+    def __new__(cls, toklist=None, name=None, asList=True, modal=True):
+        if isinstance(toklist, cls):
+            return toklist
+        retobj = object.__new__(cls)
+        retobj.__doinit = True
+        return retobj
+
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__(self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance):
+        if self.__doinit:
+            self.__doinit = False
+            self.__name = None
+            self.__parent = None
+            self.__accumNames = {}
+            self.__asList = asList
+            self.__modal = modal
+            if toklist is None:
+                toklist = []
+            if isinstance(toklist, list):
+                self.__toklist = toklist[:]
+            elif isinstance(toklist, _generatorType):
+                self.__toklist = list(toklist)
+            else:
+                self.__toklist = [toklist]
+            self.__tokdict = dict()
+
+        if name is not None and name:
+            if not modal:
+                self.__accumNames[name] = 0
+            if isinstance(name, int):
+                name = _ustr(name)  # will always return a str, but use _ustr for consistency
+            self.__name = name
+            if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None, '', [])):
+                if isinstance(toklist, basestring):
+                    toklist = [toklist]
+                if asList:
+                    if isinstance(toklist, ParseResults):
+                        self[name] = _ParseResultsWithOffset(ParseResults(toklist.__toklist), 0)
+                    else:
+                        self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]), 0)
+                    self[name].__name = name
+                else:
+                    try:
+                        self[name] = toklist[0]
+                    except (KeyError, TypeError, IndexError):
+                        self[name] = toklist
+
+    def __getitem__(self, i):
+        if isinstance(i, (int, slice)):
+            return self.__toklist[i]
+        else:
+            if i not in self.__accumNames:
+                return self.__tokdict[i][-1][0]
+            else:
+                return ParseResults([v[0] for v in self.__tokdict[i]])
+
+    def __setitem__(self, k, v, isinstance=isinstance):
+        if isinstance(v, _ParseResultsWithOffset):
+            self.__tokdict[k] = self.__tokdict.get(k, list()) + [v]
+            sub = v[0]
+        elif isinstance(k, (int, slice)):
+            self.__toklist[k] = v
+            sub = v
+        else:
+            self.__tokdict[k] = self.__tokdict.get(k, list()) + [_ParseResultsWithOffset(v, 0)]
+            sub = v
+        if isinstance(sub, ParseResults):
+            sub.__parent = wkref(self)
+
+    def __delitem__(self, i):
+        if isinstance(i, (int, slice)):
+            mylen = len(self.__toklist)
+            del self.__toklist[i]
+
+            # convert int to slice
+            if isinstance(i, int):
+                if i < 0:
+                    i += mylen
+                i = slice(i, i + 1)
+            # get removed indices
+            removed = list(range(*i.indices(mylen)))
+            removed.reverse()
+            # fixup indices in token dictionary
+            for name, occurrences in self.__tokdict.items():
+                for j in removed:
+                    for k, (value, position) in enumerate(occurrences):
+                        occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
+        else:
+            del self.__tokdict[i]
+
+    def __contains__(self, k):
+        return k in self.__tokdict
+
+    def __len__(self):
+        return len(self.__toklist)
+
+    def __bool__(self):
+        return (not not self.__toklist)
+    __nonzero__ = __bool__
+
+    def __iter__(self):
+        return iter(self.__toklist)
+
+    def __reversed__(self):
+        return iter(self.__toklist[::-1])
+
+    def _iterkeys(self):
+        if hasattr(self.__tokdict, "iterkeys"):
+            return self.__tokdict.iterkeys()
+        else:
+            return iter(self.__tokdict)
+
+    def _itervalues(self):
+        return (self[k] for k in self._iterkeys())
+
+    def _iteritems(self):
+        return ((k, self[k]) for k in self._iterkeys())
+
+    if PY_3:
+        keys = _iterkeys
+        """Returns an iterator of all named result keys."""
+
+        values = _itervalues
+        """Returns an iterator of all named result values."""
+
+        items = _iteritems
+        """Returns an iterator of all named result key-value tuples."""
+
+    else:
+        iterkeys = _iterkeys
+        """Returns an iterator of all named result keys (Python 2.x only)."""
+
+        itervalues = _itervalues
+        """Returns an iterator of all named result values (Python 2.x only)."""
+
+        iteritems = _iteritems
+        """Returns an iterator of all named result key-value tuples (Python 2.x only)."""
+
+        def keys(self):
+            """Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iterkeys())
+
+        def values(self):
+            """Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.itervalues())
+
+        def items(self):
+            """Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iteritems())
+
+    def haskeys(self):
+        """Since keys() returns an iterator, this method is helpful in bypassing
+           code that looks for the existence of any defined results names."""
+        return bool(self.__tokdict)
+
+    def pop(self, *args, **kwargs):
+        """
+        Removes and returns item at specified index (default= ``last``).
+        Supports both ``list`` and ``dict`` semantics for ``pop()``. If
+        passed no argument or an integer argument, it will use ``list``
+        semantics and pop tokens from the list of parsed tokens. If passed
+        a non-integer argument (most likely a string), it will use ``dict``
+        semantics and pop the corresponding value from any defined results
+        names. A second default return value argument is supported, just as in
+        ``dict.pop()``.
+
+        Example::
+
+            def remove_first(tokens):
+                tokens.pop(0)
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+            print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
+
+            label = Word(alphas)
+            patt = label("LABEL") + OneOrMore(Word(nums))
+            print(patt.parseString("AAB 123 321").dump())
+
+            # Use pop() in a parse action to remove named result (note that corresponding value is not
+            # removed from list form of results)
+            def remove_LABEL(tokens):
+                tokens.pop("LABEL")
+                return tokens
+            patt.addParseAction(remove_LABEL)
+            print(patt.parseString("AAB 123 321").dump())
+
+        prints::
+
+            ['AAB', '123', '321']
+            - LABEL: AAB
+
+            ['AAB', '123', '321']
+        """
+        if not args:
+            args = [-1]
+        for k, v in kwargs.items():
+            if k == 'default':
+                args = (args[0], v)
+            else:
+                raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
+        if (isinstance(args[0], int)
+                or len(args) == 1
+                or args[0] in self):
+            index = args[0]
+            ret = self[index]
+            del self[index]
+            return ret
+        else:
+            defaultvalue = args[1]
+            return defaultvalue
+
+    def get(self, key, defaultValue=None):
+        """
+        Returns named result matching the given key, or if there is no
+        such name, then returns the given ``defaultValue`` or ``None`` if no
+        ``defaultValue`` is specified.
+
+        Similar to ``dict.get()``.
+
+        Example::
+
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+            result = date_str.parseString("1999/12/31")
+            print(result.get("year")) # -> '1999'
+            print(result.get("hour", "not specified")) # -> 'not specified'
+            print(result.get("hour")) # -> None
+        """
+        if key in self:
+            return self[key]
+        else:
+            return defaultValue
+
+    def insert(self, index, insStr):
+        """
+        Inserts new element at location index in the list of parsed tokens.
+
+        Similar to ``list.insert()``.
+
+        Example::
+
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+
+            # use a parse action to insert the parse location in the front of the parsed results
+            def insert_locn(locn, tokens):
+                tokens.insert(0, locn)
+            print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
+        """
+        self.__toklist.insert(index, insStr)
+        # fixup indices in token dictionary
+        for name, occurrences in self.__tokdict.items():
+            for k, (value, position) in enumerate(occurrences):
+                occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
+
+    def append(self, item):
+        """
+        Add single element to end of ParseResults list of elements.
+
+        Example::
+
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+
+            # use a parse action to compute the sum of the parsed integers, and add it to the end
+            def append_sum(tokens):
+                tokens.append(sum(map(int, tokens)))
+            print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
+        """
+        self.__toklist.append(item)
+
+    def extend(self, itemseq):
+        """
+        Add sequence of elements to end of ParseResults list of elements.
+
+        Example::
+
+            patt = OneOrMore(Word(alphas))
+
+            # use a parse action to append the reverse of the matched strings, to make a palindrome
+            def make_palindrome(tokens):
+                tokens.extend(reversed([t[::-1] for t in tokens]))
+                return ''.join(tokens)
+            print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
+        """
+        if isinstance(itemseq, ParseResults):
+            self.__iadd__(itemseq)
+        else:
+            self.__toklist.extend(itemseq)
+
+    def clear(self):
+        """
+        Clear all elements and results names.
+        """
+        del self.__toklist[:]
+        self.__tokdict.clear()
+
+    def __getattr__(self, name):
+        try:
+            return self[name]
+        except KeyError:
+            return ""
+
+    def __add__(self, other):
+        ret = self.copy()
+        ret += other
+        return ret
+
+    def __iadd__(self, other):
+        if other.__tokdict:
+            offset = len(self.__toklist)
+            addoffset = lambda a: offset if a < 0 else a + offset
+            otheritems = other.__tokdict.items()
+            otherdictitems = [(k, _ParseResultsWithOffset(v[0], addoffset(v[1])))
+                              for k, vlist in otheritems for v in vlist]
+            for k, v in otherdictitems:
+                self[k] = v
+                if isinstance(v[0], ParseResults):
+                    v[0].__parent = wkref(self)
+
+        self.__toklist += other.__toklist
+        self.__accumNames.update(other.__accumNames)
+        return self
+
+    def __radd__(self, other):
+        if isinstance(other, int) and other == 0:
+            # useful for merging many ParseResults using sum() builtin
+            return self.copy()
+        else:
+            # this may raise a TypeError - so be it
+            return other + self
+
+    def __repr__(self):
+        return "(%s, %s)" % (repr(self.__toklist), repr(self.__tokdict))
+
+    def __str__(self):
+        return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
+
+    def _asStringList(self, sep=''):
+        out = []
+        for item in self.__toklist:
+            if out and sep:
+                out.append(sep)
+            if isinstance(item, ParseResults):
+                out += item._asStringList()
+            else:
+                out.append(_ustr(item))
+        return out
+
+    def asList(self):
+        """
+        Returns the parse results as a nested list of matching tokens, all converted to strings.
+
+        Example::
+
+            patt = OneOrMore(Word(alphas))
+            result = patt.parseString("sldkj lsdkj sldkj")
+            # even though the result prints in string-like form, it is actually a pyparsing ParseResults
+            print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
+
+            # Use asList() to create an actual list
+            result_list = result.asList()
+            print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
+        """
+        return [res.asList() if isinstance(res, ParseResults) else res for res in self.__toklist]
+
+    def asDict(self):
+        """
+        Returns the named parse results as a nested dictionary.
+
+        Example::
+
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+            result = date_str.parseString('12/31/1999')
+            print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
+
+            result_dict = result.asDict()
+            print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
+
+            # even though a ParseResults supports dict-like access, sometime you just need to have a dict
+            import json
+            print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
+            print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
+        """
+        if PY_3:
+            item_fn = self.items
+        else:
+            item_fn = self.iteritems
+
+        def toItem(obj):
+            if isinstance(obj, ParseResults):
+                if obj.haskeys():
+                    return obj.asDict()
+                else:
+                    return [toItem(v) for v in obj]
+            else:
+                return obj
+
+        return dict((k, toItem(v)) for k, v in item_fn())
+
+    def copy(self):
+        """
+        Returns a new copy of a :class:`ParseResults` object.
+        """
+        ret = ParseResults(self.__toklist)
+        ret.__tokdict = dict(self.__tokdict.items())
+        ret.__parent = self.__parent
+        ret.__accumNames.update(self.__accumNames)
+        ret.__name = self.__name
+        return ret
+
+    def asXML(self, doctag=None, namedItemsOnly=False, indent="", formatted=True):
+        """
+        (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
+        """
+        nl = "\n"
+        out = []
+        namedItems = dict((v[1], k) for (k, vlist) in self.__tokdict.items()
+                          for v in vlist)
+        nextLevelIndent = indent + "  "
+
+        # collapse out indents if formatting is not desired
+        if not formatted:
+            indent = ""
+            nextLevelIndent = ""
+            nl = ""
+
+        selfTag = None
+        if doctag is not None:
+            selfTag = doctag
+        else:
+            if self.__name:
+                selfTag = self.__name
+
+        if not selfTag:
+            if namedItemsOnly:
+                return ""
+            else:
+                selfTag = "ITEM"
+
+        out += [nl, indent, "<", selfTag, ">"]
+
+        for i, res in enumerate(self.__toklist):
+            if isinstance(res, ParseResults):
+                if i in namedItems:
+                    out += [res.asXML(namedItems[i],
+                                      namedItemsOnly and doctag is None,
+                                      nextLevelIndent,
+                                      formatted)]
+                else:
+                    out += [res.asXML(None,
+                                      namedItemsOnly and doctag is None,
+                                      nextLevelIndent,
+                                      formatted)]
+            else:
+                # individual token, see if there is a name for it
+                resTag = None
+                if i in namedItems:
+                    resTag = namedItems[i]
+                if not resTag:
+                    if namedItemsOnly:
+                        continue
+                    else:
+                        resTag = "ITEM"
+                xmlBodyText = _xml_escape(_ustr(res))
+                out += [nl, nextLevelIndent, "<", resTag, ">",
+                        xmlBodyText,
+                                                "</", resTag, ">"]
+
+        out += [nl, indent, "</", selfTag, ">"]
+        return "".join(out)
+
+    def __lookup(self, sub):
+        for k, vlist in self.__tokdict.items():
+            for v, loc in vlist:
+                if sub is v:
+                    return k
+        return None
+
+    def getName(self):
+        r"""
+        Returns the results name for this token expression. Useful when several
+        different expressions might match at a particular location.
+
+        Example::
+
+            integer = Word(nums)
+            ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
+            house_number_expr = Suppress('#') + Word(nums, alphanums)
+            user_data = (Group(house_number_expr)("house_number")
+                        | Group(ssn_expr)("ssn")
+                        | Group(integer)("age"))
+            user_info = OneOrMore(user_data)
+
+            result = user_info.parseString("22 111-22-3333 #221B")
+            for item in result:
+                print(item.getName(), ':', item[0])
+
+        prints::
+
+            age : 22
+            ssn : 111-22-3333
+            house_number : 221B
+        """
+        if self.__name:
+            return self.__name
+        elif self.__parent:
+            par = self.__parent()
+            if par:
+                return par.__lookup(self)
+            else:
+                return None
+        elif (len(self) == 1
+              and len(self.__tokdict) == 1
+              and next(iter(self.__tokdict.values()))[0][1] in (0, -1)):
+            return next(iter(self.__tokdict.keys()))
+        else:
+            return None
+
+    def dump(self, indent='', full=True, include_list=True, _depth=0):
+        """
+        Diagnostic method for listing out the contents of
+        a :class:`ParseResults`. Accepts an optional ``indent`` argument so
+        that this string can be embedded in a nested display of other data.
+
+        Example::
+
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+            result = date_str.parseString('12/31/1999')
+            print(result.dump())
+
+        prints::
+
+            ['12', '/', '31', '/', '1999']
+            - day: 1999
+            - month: 31
+            - year: 12
+        """
+        out = []
+        NL = '\n'
+        if include_list:
+            out.append(indent + _ustr(self.asList()))
+        else:
+            out.append('')
+
+        if full:
+            if self.haskeys():
+                items = sorted((str(k), v) for k, v in self.items())
+                for k, v in items:
+                    if out:
+                        out.append(NL)
+                    out.append("%s%s- %s: " % (indent, ('  ' * _depth), k))
+                    if isinstance(v, ParseResults):
+                        if v:
+                            out.append(v.dump(indent=indent, full=full, include_list=include_list, _depth=_depth + 1))
+                        else:
+                            out.append(_ustr(v))
+                    else:
+                        out.append(repr(v))
+            elif any(isinstance(vv, ParseResults) for vv in self):
+                v = self
+                for i, vv in enumerate(v):
+                    if isinstance(vv, ParseResults):
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,
+                                                            ('  ' * (_depth)),
+                                                            i,
+                                                            indent,
+                                                            ('  ' * (_depth + 1)),
+                                                            vv.dump(indent=indent,
+                                                                    full=full,
+                                                                    include_list=include_list,
+                                                                    _depth=_depth + 1)))
+                    else:
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,
+                                                            ('  ' * (_depth)),
+                                                            i,
+                                                            indent,
+                                                            ('  ' * (_depth + 1)),
+                                                            _ustr(vv)))
+
+        return "".join(out)
+
+    def pprint(self, *args, **kwargs):
+        """
+        Pretty-printer for parsed results as a list, using the
+        `pprint <https://docs.python.org/3/library/pprint.html>`_ module.
+        Accepts additional positional or keyword args as defined for
+        `pprint.pprint <https://docs.python.org/3/library/pprint.html#pprint.pprint>`_ .
+
+        Example::
+
+            ident = Word(alphas, alphanums)
+            num = Word(nums)
+            func = Forward()
+            term = ident | num | Group('(' + func + ')')
+            func <<= ident + Group(Optional(delimitedList(term)))
+            result = func.parseString("fna a,b,(fnb c,d,200),100")
+            result.pprint(width=40)
+
+        prints::
+
+            ['fna',
+             ['a',
+              'b',
+              ['(', 'fnb', ['c', 'd', '200'], ')'],
+              '100']]
+        """
+        pprint.pprint(self.asList(), *args, **kwargs)
+
+    # add support for pickle protocol
+    def __getstate__(self):
+        return (self.__toklist,
+                (self.__tokdict.copy(),
+                 self.__parent is not None and self.__parent() or None,
+                 self.__accumNames,
+                 self.__name))
+
+    def __setstate__(self, state):
+        self.__toklist = state[0]
+        self.__tokdict, par, inAccumNames, self.__name = state[1]
+        self.__accumNames = {}
+        self.__accumNames.update(inAccumNames)
+        if par is not None:
+            self.__parent = wkref(par)
+        else:
+            self.__parent = None
+
+    def __getnewargs__(self):
+        return self.__toklist, self.__name, self.__asList, self.__modal
+
+    def __dir__(self):
+        return dir(type(self)) + list(self.keys())
+
+    @classmethod
+    def from_dict(cls, other, name=None):
+        """
+        Helper classmethod to construct a ParseResults from a dict, preserving the
+        name-value relations as results names. If an optional 'name' argument is
+        given, a nested ParseResults will be returned
+        """
+        def is_iterable(obj):
+            try:
+                iter(obj)
+            except Exception:
+                return False
+            else:
+                if PY_3:
+                    return not isinstance(obj, (str, bytes))
+                else:
+                    return not isinstance(obj, basestring)
+
+        ret = cls([])
+        for k, v in other.items():
+            if isinstance(v, Mapping):
+                ret += cls.from_dict(v, name=k)
+            else:
+                ret += cls([v], name=k, asList=is_iterable(v))
+        if name is not None:
+            ret = cls([ret], name=name)
+        return ret
+
+MutableMapping.register(ParseResults)
+
+def col (loc, strg):
+    """Returns current column within a string, counting newlines as line separators.
+   The first column is number 1.
+
+   Note: the default parsing behavior is to expand tabs in the input string
+   before starting the parsing process.  See
+   :class:`ParserElement.parseString` for more
+   information on parsing strings containing ``<TAB>`` s, and suggested
+   methods to maintain a consistent view of the parsed string, the parse
+   location, and line and column positions within the parsed string.
+   """
+    s = strg
+    return 1 if 0 < loc < len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
+
+def lineno(loc, strg):
+    """Returns current line number within a string, counting newlines as line separators.
+    The first line is number 1.
+
+    Note - the default parsing behavior is to expand tabs in the input string
+    before starting the parsing process.  See :class:`ParserElement.parseString`
+    for more information on parsing strings containing ``<TAB>`` s, and
+    suggested methods to maintain a consistent view of the parsed string, the
+    parse location, and line and column positions within the parsed string.
+    """
+    return strg.count("\n", 0, loc) + 1
+
+def line(loc, strg):
+    """Returns the line of text containing loc within a string, counting newlines as line separators.
+       """
+    lastCR = strg.rfind("\n", 0, loc)
+    nextCR = strg.find("\n", loc)
+    if nextCR >= 0:
+        return strg[lastCR + 1:nextCR]
+    else:
+        return strg[lastCR + 1:]
+
+def _defaultStartDebugAction(instring, loc, expr):
+    print(("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % (lineno(loc, instring), col(loc, instring))))
+
+def _defaultSuccessDebugAction(instring, startloc, endloc, expr, toks):
+    print("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
+
+def _defaultExceptionDebugAction(instring, loc, expr, exc):
+    print("Exception raised:" + _ustr(exc))
+
+def nullDebugAction(*args):
+    """'Do-nothing' debug action, to suppress debugging output during parsing."""
+    pass
+
+# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
+#~ 'decorator to trim function calls to match the arity of the target'
+#~ def _trim_arity(func, maxargs=3):
+    #~ if func in singleArgBuiltins:
+        #~ return lambda s,l,t: func(t)
+    #~ limit = 0
+    #~ foundArity = False
+    #~ def wrapper(*args):
+        #~ nonlocal limit,foundArity
+        #~ while 1:
+            #~ try:
+                #~ ret = func(*args[limit:])
+                #~ foundArity = True
+                #~ return ret
+            #~ except TypeError:
+                #~ if limit == maxargs or foundArity:
+                    #~ raise
+                #~ limit += 1
+                #~ continue
+    #~ return wrapper
+
+# this version is Python 2.x-3.x cross-compatible
+'decorator to trim function calls to match the arity of the target'
+def _trim_arity(func, maxargs=2):
+    if func in singleArgBuiltins:
+        return lambda s, l, t: func(t)
+    limit = [0]
+    foundArity = [False]
+
+    # traceback return data structure changed in Py3.5 - normalize back to plain tuples
+    if system_version[:2] >= (3, 5):
+        def extract_stack(limit=0):
+            # special handling for Python 3.5.0 - extra deep call stack by 1
+            offset = -3 if system_version == (3, 5, 0) else -2
+            frame_summary = traceback.extract_stack(limit=-offset + limit - 1)[offset]
+            return [frame_summary[:2]]
+        def extract_tb(tb, limit=0):
+            frames = traceback.extract_tb(tb, limit=limit)
+            frame_summary = frames[-1]
+            return [frame_summary[:2]]
+    else:
+        extract_stack = traceback.extract_stack
+        extract_tb = traceback.extract_tb
+
+    # synthesize what would be returned by traceback.extract_stack at the call to
+    # user's parse action 'func', so that we don't incur call penalty at parse time
+
+    LINE_DIFF = 6
+    # IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND
+    # THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
+    this_line = extract_stack(limit=2)[-1]
+    pa_call_line_synth = (this_line[0], this_line[1] + LINE_DIFF)
+
+    def wrapper(*args):
+        while 1:
+            try:
+                ret = func(*args[limit[0]:])
+                foundArity[0] = True
+                return ret
+            except TypeError:
+                # re-raise TypeErrors if they did not come from our arity testing
+                if foundArity[0]:
+                    raise
+                else:
+                    try:
+                        tb = sys.exc_info()[-1]
+                        if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
+                            raise
+                    finally:
+                        try:
+                            del tb
+                        except NameError:
+                            pass
+
+                if limit[0] <= maxargs:
+                    limit[0] += 1
+                    continue
+                raise
+
+    # copy func name to wrapper for sensible debug output
+    func_name = "<parse action>"
+    try:
+        func_name = getattr(func, '__name__',
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    wrapper.__name__ = func_name
+
+    return wrapper
+
+
+class ParserElement(object):
+    """Abstract base level parser element class."""
+    DEFAULT_WHITE_CHARS = " \n\t\r"
+    verbose_stacktrace = False
+
+    @staticmethod
+    def setDefaultWhitespaceChars(chars):
+        r"""
+        Overrides the default whitespace chars
+
+        Example::
+
+            # default whitespace chars are space, <TAB> and newline
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def', 'ghi', 'jkl']
+
+            # change to just treat newline as significant
+            ParserElement.setDefaultWhitespaceChars(" \t")
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def']
+        """
+        ParserElement.DEFAULT_WHITE_CHARS = chars
+
+    @staticmethod
+    def inlineLiteralsUsing(cls):
+        """
+        Set class to be used for inclusion of string literals into a parser.
+
+        Example::
+
+            # default literal class used is Literal
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+
+            # change to Suppress
+            ParserElement.inlineLiteralsUsing(Suppress)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '12', '31']
+        """
+        ParserElement._literalStringClass = cls
+
+    @classmethod
+    def _trim_traceback(cls, tb):
+        while tb.tb_next:
+            tb = tb.tb_next
+        return tb
+
+    def __init__(self, savelist=False):
+        self.parseAction = list()
+        self.failAction = None
+        # ~ self.name = "<unknown>"  # don't define self.name, let subclasses try/except upcall
+        self.strRepr = None
+        self.resultsName = None
+        self.saveAsList = savelist
+        self.skipWhitespace = True
+        self.whiteChars = set(ParserElement.DEFAULT_WHITE_CHARS)
+        self.copyDefaultWhiteChars = True
+        self.mayReturnEmpty = False # used when checking for left-recursion
+        self.keepTabs = False
+        self.ignoreExprs = list()
+        self.debug = False
+        self.streamlined = False
+        self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
+        self.errmsg = ""
+        self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
+        self.debugActions = (None, None, None)  # custom debug actions
+        self.re = None
+        self.callPreparse = True # used to avoid redundant calls to preParse
+        self.callDuringTry = False
+
+    def copy(self):
+        """
+        Make a copy of this :class:`ParserElement`.  Useful for defining
+        different parse actions for the same parsing pattern, using copies of
+        the original parse element.
+
+        Example::
+
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            integerK = integer.copy().addParseAction(lambda toks: toks[0] * 1024) + Suppress("K")
+            integerM = integer.copy().addParseAction(lambda toks: toks[0] * 1024 * 1024) + Suppress("M")
+
+            print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
+
+        prints::
+
+            [5120, 100, 655360, 268435456]
+
+        Equivalent form of ``expr.copy()`` is just ``expr()``::
+
+            integerM = integer().addParseAction(lambda toks: toks[0] * 1024 * 1024) + Suppress("M")
+        """
+        cpy = copy.copy(self)
+        cpy.parseAction = self.parseAction[:]
+        cpy.ignoreExprs = self.ignoreExprs[:]
+        if self.copyDefaultWhiteChars:
+            cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
+        return cpy
+
+    def setName(self, name):
+        """
+        Define name for this expression, makes debugging and exception messages clearer.
+
+        Example::
+
+            Word(nums).parseString("ABC")  # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
+            Word(nums).setName("integer").parseString("ABC")  # -> Exception: Expected integer (at char 0), (line:1, col:1)
+        """
+        self.name = name
+        self.errmsg = "Expected " + self.name
+        if __diag__.enable_debug_on_named_expressions:
+            self.setDebug()
+        return self
+
+    def setResultsName(self, name, listAllMatches=False):
+        """
+        Define name for referencing matching tokens as a nested attribute
+        of the returned parse results.
+        NOTE: this returns a *copy* of the original :class:`ParserElement` object;
+        this is so that the client can define a basic element, such as an
+        integer, and reference it in multiple places with different names.
+
+        You can also set results names using the abbreviated syntax,
+        ``expr("name")`` in place of ``expr.setResultsName("name")``
+        - see :class:`__call__`.
+
+        Example::
+
+            date_str = (integer.setResultsName("year") + '/'
+                        + integer.setResultsName("month") + '/'
+                        + integer.setResultsName("day"))
+
+            # equivalent form:
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+        """
+        return self._setResultsName(name, listAllMatches)
+
+    def _setResultsName(self, name, listAllMatches=False):
+        newself = self.copy()
+        if name.endswith("*"):
+            name = name[:-1]
+            listAllMatches = True
+        newself.resultsName = name
+        newself.modalResults = not listAllMatches
+        return newself
+
+    def setBreak(self, breakFlag=True):
+        """Method to invoke the Python pdb debugger when this element is
+           about to be parsed. Set ``breakFlag`` to True to enable, False to
+           disable.
+        """
+        if breakFlag:
+            _parseMethod = self._parse
+            def breaker(instring, loc, doActions=True, callPreParse=True):
+                import pdb
+                # this call to pdb.set_trace() is intentional, not a checkin error
+                pdb.set_trace()
+                return _parseMethod(instring, loc, doActions, callPreParse)
+            breaker._originalParseMethod = _parseMethod
+            self._parse = breaker
+        else:
+            if hasattr(self._parse, "_originalParseMethod"):
+                self._parse = self._parse._originalParseMethod
+        return self
+
+    def setParseAction(self, *fns, **kwargs):
+        """
+        Define one or more actions to perform when successfully matching parse element definition.
+        Parse action fn is a callable method with 0-3 arguments, called as ``fn(s, loc, toks)`` ,
+        ``fn(loc, toks)`` , ``fn(toks)`` , or just ``fn()`` , where:
+
+        - s   = the original string being parsed (see note below)
+        - loc = the location of the matching substring
+        - toks = a list of the matched tokens, packaged as a :class:`ParseResults` object
+
+        If the functions in fns modify the tokens, they can return them as the return
+        value from fn, and the modified list of tokens will replace the original.
+        Otherwise, fn does not need to return any value.
+
+        If None is passed as the parse action, all previously added parse actions for this
+        expression are cleared.
+
+        Optional keyword arguments:
+        - callDuringTry = (default= ``False``) indicate if parse action should be run during lookaheads and alternate testing
+
+        Note: the default parsing behavior is to expand tabs in the input string
+        before starting the parsing process.  See :class:`parseString for more
+        information on parsing strings containing ``<TAB>`` s, and suggested
+        methods to maintain a consistent view of the parsed string, the parse
+        location, and line and column positions within the parsed string.
+
+        Example::
+
+            integer = Word(nums)
+            date_str = integer + '/' + integer + '/' + integer
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+            # use parse action to convert to ints at parse time
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            date_str = integer + '/' + integer + '/' + integer
+
+            # note that integer fields are now ints, not strings
+            date_str.parseString("1999/12/31")  # -> [1999, '/', 12, '/', 31]
+        """
+        if list(fns) == [None,]:
+            self.parseAction = []
+        else:
+            if not all(callable(fn) for fn in fns):
+                raise TypeError("parse actions must be callable")
+            self.parseAction = list(map(_trim_arity, list(fns)))
+            self.callDuringTry = kwargs.get("callDuringTry", False)
+        return self
+
+    def addParseAction(self, *fns, **kwargs):
+        """
+        Add one or more parse actions to expression's list of parse actions. See :class:`setParseAction`.
+
+        See examples in :class:`copy`.
+        """
+        self.parseAction += list(map(_trim_arity, list(fns)))
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def addCondition(self, *fns, **kwargs):
+        """Add a boolean predicate function to expression's list of parse actions. See
+        :class:`setParseAction` for function call signatures. Unlike ``setParseAction``,
+        functions passed to ``addCondition`` need to return boolean success/fail of the condition.
+
+        Optional keyword arguments:
+        - message = define a custom message to be used in the raised exception
+        - fatal   = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
+
+        Example::
+
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            year_int = integer.copy()
+            year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
+            date_str = year_int + '/' + integer + '/' + integer
+
+            result = date_str.parseString("1999/12/31")  # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
+        """
+        for fn in fns:
+            self.parseAction.append(conditionAsParseAction(fn, message=kwargs.get('message'),
+                                                           fatal=kwargs.get('fatal', False)))
+
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def setFailAction(self, fn):
+        """Define action to perform if parsing fails at this expression.
+           Fail acton fn is a callable function that takes the arguments
+           ``fn(s, loc, expr, err)`` where:
+           - s = string being parsed
+           - loc = location where expression match was attempted and failed
+           - expr = the parse expression that failed
+           - err = the exception thrown
+           The function returns no value.  It may throw :class:`ParseFatalException`
+           if it is desired to stop parsing immediately."""
+        self.failAction = fn
+        return self
+
+    def _skipIgnorables(self, instring, loc):
+        exprsFound = True
+        while exprsFound:
+            exprsFound = False
+            for e in self.ignoreExprs:
+                try:
+                    while 1:
+                        loc, dummy = e._parse(instring, loc)
+                        exprsFound = True
+                except ParseException:
+                    pass
+        return loc
+
+    def preParse(self, instring, loc):
+        if self.ignoreExprs:
+            loc = self._skipIgnorables(instring, loc)
+
+        if self.skipWhitespace:
+            wt = self.whiteChars
+            instrlen = len(instring)
+            while loc < instrlen and instring[loc] in wt:
+                loc += 1
+
+        return loc
+
+    def parseImpl(self, instring, loc, doActions=True):
+        return loc, []
+
+    def postParse(self, instring, loc, tokenlist):
+        return tokenlist
+
+    # ~ @profile
+    def _parseNoCache(self, instring, loc, doActions=True, callPreParse=True):
+        TRY, MATCH, FAIL = 0, 1, 2
+        debugging = (self.debug)  # and doActions)
+
+        if debugging or self.failAction:
+            # ~ print ("Match", self, "at loc", loc, "(%d, %d)" % (lineno(loc, instring), col(loc, instring)))
+            if self.debugActions[TRY]:
+                self.debugActions[TRY](instring, loc, self)
+            try:
+                if callPreParse and self.callPreparse:
+                    preloc = self.preParse(instring, loc)
+                else:
+                    preloc = loc
+                tokensStart = preloc
+                if self.mayIndexError or preloc >= len(instring):
+                    try:
+                        loc, tokens = self.parseImpl(instring, preloc, doActions)
+                    except IndexError:
+                        raise ParseException(instring, len(instring), self.errmsg, self)
+                else:
+                    loc, tokens = self.parseImpl(instring, preloc, doActions)
+            except Exception as err:
+                # ~ print ("Exception raised:", err)
+                if self.debugActions[FAIL]:
+                    self.debugActions[FAIL](instring, tokensStart, self, err)
+                if self.failAction:
+                    self.failAction(instring, tokensStart, self, err)
+                raise
+        else:
+            if callPreParse and self.callPreparse:
+                preloc = self.preParse(instring, loc)
+            else:
+                preloc = loc
+            tokensStart = preloc
+            if self.mayIndexError or preloc >= len(instring):
+                try:
+                    loc, tokens = self.parseImpl(instring, preloc, doActions)
+                except IndexError:
+                    raise ParseException(instring, len(instring), self.errmsg, self)
+            else:
+                loc, tokens = self.parseImpl(instring, preloc, doActions)
+
+        tokens = self.postParse(instring, loc, tokens)
+
+        retTokens = ParseResults(tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults)
+        if self.parseAction and (doActions or self.callDuringTry):
+            if debugging:
+                try:
+                    for fn in self.parseAction:
+                        try:
+                            tokens = fn(instring, tokensStart, retTokens)
+                        except IndexError as parse_action_exc:
+                            exc = ParseException("exception raised in parse action")
+                            exc.__cause__ = parse_action_exc
+                            raise exc
+
+                        if tokens is not None and tokens is not retTokens:
+                            retTokens = ParseResults(tokens,
+                                                      self.resultsName,
+                                                      asList=self.saveAsList and isinstance(tokens, (ParseResults, list)),
+                                                      modal=self.modalResults)
+                except Exception as err:
+                    # ~ print "Exception raised in user parse action:", err
+                    if self.debugActions[FAIL]:
+                        self.debugActions[FAIL](instring, tokensStart, self, err)
+                    raise
+            else:
+                for fn in self.parseAction:
+                    try:
+                        tokens = fn(instring, tokensStart, retTokens)
+                    except IndexError as parse_action_exc:
+                        exc = ParseException("exception raised in parse action")
+                        exc.__cause__ = parse_action_exc
+                        raise exc
+
+                    if tokens is not None and tokens is not retTokens:
+                        retTokens = ParseResults(tokens,
+                                                  self.resultsName,
+                                                  asList=self.saveAsList and isinstance(tokens, (ParseResults, list)),
+                                                  modal=self.modalResults)
+        if debugging:
+            # ~ print ("Matched", self, "->", retTokens.asList())
+            if self.debugActions[MATCH]:
+                self.debugActions[MATCH](instring, tokensStart, loc, self, retTokens)
+
+        return loc, retTokens
+
+    def tryParse(self, instring, loc):
+        try:
+            return self._parse(instring, loc, doActions=False)[0]
+        except ParseFatalException:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+    def canParseNext(self, instring, loc):
+        try:
+            self.tryParse(instring, loc)
+        except (ParseException, IndexError):
+            return False
+        else:
+            return True
+
+    class _UnboundedCache(object):
+        def __init__(self):
+            cache = {}
+            self.not_in_cache = not_in_cache = object()
+
+            def get(self, key):
+                return cache.get(key, not_in_cache)
+
+            def set(self, key, value):
+                cache[key] = value
+
+            def clear(self):
+                cache.clear()
+
+            def cache_len(self):
+                return len(cache)
+
+            self.get = types.MethodType(get, self)
+            self.set = types.MethodType(set, self)
+            self.clear = types.MethodType(clear, self)
+            self.__len__ = types.MethodType(cache_len, self)
+
+    if _OrderedDict is not None:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = _OrderedDict()
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(cache) > size:
+                        try:
+                            cache.popitem(False)
+                        except KeyError:
+                            pass
+
+                def clear(self):
+                    cache.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    else:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = {}
+                key_fifo = collections.deque([], size)
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(key_fifo) > size:
+                        cache.pop(key_fifo.popleft(), None)
+                    key_fifo.append(key)
+
+                def clear(self):
+                    cache.clear()
+                    key_fifo.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    # argument cache for optimizing repeated calls when backtracking through recursive expressions
+    packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
+    packrat_cache_lock = RLock()
+    packrat_cache_stats = [0, 0]
+
+    # this method gets repeatedly called during backtracking with the same arguments -
+    # we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
+    def _parseCache(self, instring, loc, doActions=True, callPreParse=True):
+        HIT, MISS = 0, 1
+        lookup = (self, instring, loc, callPreParse, doActions)
+        with ParserElement.packrat_cache_lock:
+            cache = ParserElement.packrat_cache
+            value = cache.get(lookup)
+            if value is cache.not_in_cache:
+                ParserElement.packrat_cache_stats[MISS] += 1
+                try:
+                    value = self._parseNoCache(instring, loc, doActions, callPreParse)
+                except ParseBaseException as pe:
+                    # cache a copy of the exception, without the traceback
+                    cache.set(lookup, pe.__class__(*pe.args))
+                    raise
+                else:
+                    cache.set(lookup, (value[0], value[1].copy()))
+                    return value
+            else:
+                ParserElement.packrat_cache_stats[HIT] += 1
+                if isinstance(value, Exception):
+                    raise value
+                return value[0], value[1].copy()
+
+    _parse = _parseNoCache
+
+    @staticmethod
+    def resetCache():
+        ParserElement.packrat_cache.clear()
+        ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
+
+    _packratEnabled = False
+    @staticmethod
+    def enablePackrat(cache_size_limit=128):
+        """Enables "packrat" parsing, which adds memoizing to the parsing logic.
+           Repeated parse attempts at the same string location (which happens
+           often in many complex grammars) can immediately return a cached value,
+           instead of re-executing parsing/validating code.  Memoizing is done of
+           both valid results and parsing exceptions.
+
+           Parameters:
+
+           - cache_size_limit - (default= ``128``) - if an integer value is provided
+             will limit the size of the packrat cache; if None is passed, then
+             the cache size will be unbounded; if 0 is passed, the cache will
+             be effectively disabled.
+
+           This speedup may break existing programs that use parse actions that
+           have side-effects.  For this reason, packrat parsing is disabled when
+           you first import pyparsing.  To activate the packrat feature, your
+           program must call the class method :class:`ParserElement.enablePackrat`.
+           For best results, call ``enablePackrat()`` immediately after
+           importing pyparsing.
+
+           Example::
+
+               from pip._vendor import pyparsing
+               pyparsing.ParserElement.enablePackrat()
+        """
+        if not ParserElement._packratEnabled:
+            ParserElement._packratEnabled = True
+            if cache_size_limit is None:
+                ParserElement.packrat_cache = ParserElement._UnboundedCache()
+            else:
+                ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
+            ParserElement._parse = ParserElement._parseCache
+
+    def parseString(self, instring, parseAll=False):
+        """
+        Execute the parse expression with the given string.
+        This is the main interface to the client code, once the complete
+        expression has been built.
+
+        Returns the parsed data as a :class:`ParseResults` object, which may be
+        accessed as a list, or as a dict or object with attributes if the given parser
+        includes results names.
+
+        If you want the grammar to require that the entire input string be
+        successfully parsed, then set ``parseAll`` to True (equivalent to ending
+        the grammar with ``StringEnd()``).
+
+        Note: ``parseString`` implicitly calls ``expandtabs()`` on the input string,
+        in order to report proper column numbers in parse actions.
+        If the input string contains tabs and
+        the grammar uses parse actions that use the ``loc`` argument to index into the
+        string being parsed, you can ensure you have a consistent view of the input
+        string by:
+
+        - calling ``parseWithTabs`` on your grammar before calling ``parseString``
+          (see :class:`parseWithTabs`)
+        - define your parse action using the full ``(s, loc, toks)`` signature, and
+          reference the input string using the parse action's ``s`` argument
+        - explictly expand the tabs in your input string before calling
+          ``parseString``
+
+        Example::
+
+            Word('a').parseString('aaaaabaaa')  # -> ['aaaaa']
+            Word('a').parseString('aaaaabaaa', parseAll=True)  # -> Exception: Expected end of text
+        """
+        ParserElement.resetCache()
+        if not self.streamlined:
+            self.streamline()
+            # ~ self.saveAsList = True
+        for e in self.ignoreExprs:
+            e.streamline()
+        if not self.keepTabs:
+            instring = instring.expandtabs()
+        try:
+            loc, tokens = self._parse(instring, 0)
+            if parseAll:
+                loc = self.preParse(instring, loc)
+                se = Empty() + StringEnd()
+                se._parse(instring, loc)
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clearing out pyparsing internal stack trace
+                if getattr(exc, '__traceback__', None) is not None:
+                    exc.__traceback__ = self._trim_traceback(exc.__traceback__)
+                raise exc
+        else:
+            return tokens
+
+    def scanString(self, instring, maxMatches=_MAX_INT, overlap=False):
+        """
+        Scan the input string for expression matches.  Each match will return the
+        matching tokens, start location, and end location.  May be called with optional
+        ``maxMatches`` argument, to clip scanning after 'n' matches are found.  If
+        ``overlap`` is specified, then overlapping matches will be reported.
+
+        Note that the start and end locations are reported relative to the string
+        being parsed.  See :class:`parseString` for more information on parsing
+        strings with embedded tabs.
+
+        Example::
+
+            source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
+            print(source)
+            for tokens, start, end in Word(alphas).scanString(source):
+                print(' '*start + '^'*(end-start))
+                print(' '*start + tokens[0])
+
+        prints::
+
+            sldjf123lsdjjkf345sldkjf879lkjsfd987
+            ^^^^^
+            sldjf
+                    ^^^^^^^
+                    lsdjjkf
+                              ^^^^^^
+                              sldkjf
+                                       ^^^^^^
+                                       lkjsfd
+        """
+        if not self.streamlined:
+            self.streamline()
+        for e in self.ignoreExprs:
+            e.streamline()
+
+        if not self.keepTabs:
+            instring = _ustr(instring).expandtabs()
+        instrlen = len(instring)
+        loc = 0
+        preparseFn = self.preParse
+        parseFn = self._parse
+        ParserElement.resetCache()
+        matches = 0
+        try:
+            while loc <= instrlen and matches < maxMatches:
+                try:
+                    preloc = preparseFn(instring, loc)
+                    nextLoc, tokens = parseFn(instring, preloc, callPreParse=False)
+                except ParseException:
+                    loc = preloc + 1
+                else:
+                    if nextLoc > loc:
+                        matches += 1
+                        yield tokens, preloc, nextLoc
+                        if overlap:
+                            nextloc = preparseFn(instring, loc)
+                            if nextloc > loc:
+                                loc = nextLoc
+                            else:
+                                loc += 1
+                        else:
+                            loc = nextLoc
+                    else:
+                        loc = preloc + 1
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clearing out pyparsing internal stack trace
+                if getattr(exc, '__traceback__', None) is not None:
+                    exc.__traceback__ = self._trim_traceback(exc.__traceback__)
+                raise exc
+
+    def transformString(self, instring):
+        """
+        Extension to :class:`scanString`, to modify matching text with modified tokens that may
+        be returned from a parse action.  To use ``transformString``, define a grammar and
+        attach a parse action to it that modifies the returned token list.
+        Invoking ``transformString()`` on a target string will then scan for matches,
+        and replace the matched text patterns according to the logic in the parse
+        action.  ``transformString()`` returns the resulting transformed string.
+
+        Example::
+
+            wd = Word(alphas)
+            wd.setParseAction(lambda toks: toks[0].title())
+
+            print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
+
+        prints::
+
+            Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
+        """
+        out = []
+        lastE = 0
+        # force preservation of <TAB>s, to minimize unwanted transformation of string, and to
+        # keep string locs straight between transformString and scanString
+        self.keepTabs = True
+        try:
+            for t, s, e in self.scanString(instring):
+                out.append(instring[lastE:s])
+                if t:
+                    if isinstance(t, ParseResults):
+                        out += t.asList()
+                    elif isinstance(t, list):
+                        out += t
+                    else:
+                        out.append(t)
+                lastE = e
+            out.append(instring[lastE:])
+            out = [o for o in out if o]
+            return "".join(map(_ustr, _flatten(out)))
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clearing out pyparsing internal stack trace
+                if getattr(exc, '__traceback__', None) is not None:
+                    exc.__traceback__ = self._trim_traceback(exc.__traceback__)
+                raise exc
+
+    def searchString(self, instring, maxMatches=_MAX_INT):
+        """
+        Another extension to :class:`scanString`, simplifying the access to the tokens found
+        to match the given parse expression.  May be called with optional
+        ``maxMatches`` argument, to clip searching after 'n' matches are found.
+
+        Example::
+
+            # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
+            cap_word = Word(alphas.upper(), alphas.lower())
+
+            print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
+
+            # the sum() builtin can be used to merge results into a single ParseResults object
+            print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
+
+        prints::
+
+            [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
+            ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
+        """
+        try:
+            return ParseResults([t for t, s, e in self.scanString(instring, maxMatches)])
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clearing out pyparsing internal stack trace
+                if getattr(exc, '__traceback__', None) is not None:
+                    exc.__traceback__ = self._trim_traceback(exc.__traceback__)
+                raise exc
+
+    def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
+        """
+        Generator method to split a string using the given expression as a separator.
+        May be called with optional ``maxsplit`` argument, to limit the number of splits;
+        and the optional ``includeSeparators`` argument (default= ``False``), if the separating
+        matching text should be included in the split results.
+
+        Example::
+
+            punc = oneOf(list(".,;:/-!?"))
+            print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
+
+        prints::
+
+            ['This', ' this', '', ' this sentence', ' is badly punctuated', '']
+        """
+        splits = 0
+        last = 0
+        for t, s, e in self.scanString(instring, maxMatches=maxsplit):
+            yield instring[last:s]
+            if includeSeparators:
+                yield t[0]
+            last = e
+        yield instring[last:]
+
+    def __add__(self, other):
+        """
+        Implementation of + operator - returns :class:`And`. Adding strings to a ParserElement
+        converts them to :class:`Literal`s by default.
+
+        Example::
+
+            greet = Word(alphas) + "," + Word(alphas) + "!"
+            hello = "Hello, World!"
+            print (hello, "->", greet.parseString(hello))
+
+        prints::
+
+            Hello, World! -> ['Hello', ',', 'World', '!']
+
+        ``...`` may be used as a parse expression as a short form of :class:`SkipTo`.
+
+            Literal('start') + ... + Literal('end')
+
+        is equivalent to:
+
+            Literal('start') + SkipTo('end')("_skipped*") + Literal('end')
+
+        Note that the skipped text is returned with '_skipped' as a results name,
+        and to support having multiple skips in the same parser, the value returned is
+        a list of all skipped text.
+        """
+        if other is Ellipsis:
+            return _PendingSkip(self)
+
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return And([self, other])
+
+    def __radd__(self, other):
+        """
+        Implementation of + operator when left operand is not a :class:`ParserElement`
+        """
+        if other is Ellipsis:
+            return SkipTo(self)("_skipped*") + self
+
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return other + self
+
+    def __sub__(self, other):
+        """
+        Implementation of - operator, returns :class:`And` with error stop
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return self + And._ErrorStop() + other
+
+    def __rsub__(self, other):
+        """
+        Implementation of - operator when left operand is not a :class:`ParserElement`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return other - self
+
+    def __mul__(self, other):
+        """
+        Implementation of * operator, allows use of ``expr * 3`` in place of
+        ``expr + expr + expr``.  Expressions may also me multiplied by a 2-integer
+        tuple, similar to ``{min, max}`` multipliers in regular expressions.  Tuples
+        may also include ``None`` as in:
+         - ``expr*(n, None)`` or ``expr*(n, )`` is equivalent
+              to ``expr*n + ZeroOrMore(expr)``
+              (read as "at least n instances of ``expr``")
+         - ``expr*(None, n)`` is equivalent to ``expr*(0, n)``
+              (read as "0 to n instances of ``expr``")
+         - ``expr*(None, None)`` is equivalent to ``ZeroOrMore(expr)``
+         - ``expr*(1, None)`` is equivalent to ``OneOrMore(expr)``
+
+        Note that ``expr*(None, n)`` does not raise an exception if
+        more than n exprs exist in the input stream; that is,
+        ``expr*(None, n)`` does not enforce a maximum number of expr
+        occurrences.  If this behavior is desired, then write
+        ``expr*(None, n) + ~expr``
+        """
+        if other is Ellipsis:
+            other = (0, None)
+        elif isinstance(other, tuple) and other[:1] == (Ellipsis,):
+            other = ((0, ) + other[1:] + (None,))[:2]
+
+        if isinstance(other, int):
+            minElements, optElements = other, 0
+        elif isinstance(other, tuple):
+            other = tuple(o if o is not Ellipsis else None for o in other)
+            other = (other + (None, None))[:2]
+            if other[0] is None:
+                other = (0, other[1])
+            if isinstance(other[0], int) and other[1] is None:
+                if other[0] == 0:
+                    return ZeroOrMore(self)
+                if other[0] == 1:
+                    return OneOrMore(self)
+                else:
+                    return self * other[0] + ZeroOrMore(self)
+            elif isinstance(other[0], int) and isinstance(other[1], int):
+                minElements, optElements = other
+                optElements -= minElements
+            else:
+                raise TypeError("cannot multiply 'ParserElement' and ('%s', '%s') objects", type(other[0]), type(other[1]))
+        else:
+            raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
+
+        if minElements < 0:
+            raise ValueError("cannot multiply ParserElement by negative value")
+        if optElements < 0:
+            raise ValueError("second tuple value must be greater or equal to first tuple value")
+        if minElements == optElements == 0:
+            raise ValueError("cannot multiply ParserElement by 0 or (0, 0)")
+
+        if optElements:
+            def makeOptionalList(n):
+                if n > 1:
+                    return Optional(self + makeOptionalList(n - 1))
+                else:
+                    return Optional(self)
+            if minElements:
+                if minElements == 1:
+                    ret = self + makeOptionalList(optElements)
+                else:
+                    ret = And([self] * minElements) + makeOptionalList(optElements)
+            else:
+                ret = makeOptionalList(optElements)
+        else:
+            if minElements == 1:
+                ret = self
+            else:
+                ret = And([self] * minElements)
+        return ret
+
+    def __rmul__(self, other):
+        return self.__mul__(other)
+
+    def __or__(self, other):
+        """
+        Implementation of | operator - returns :class:`MatchFirst`
+        """
+        if other is Ellipsis:
+            return _PendingSkip(self, must_skip=True)
+
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return MatchFirst([self, other])
+
+    def __ror__(self, other):
+        """
+        Implementation of | operator when left operand is not a :class:`ParserElement`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return other | self
+
+    def __xor__(self, other):
+        """
+        Implementation of ^ operator - returns :class:`Or`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return Or([self, other])
+
+    def __rxor__(self, other):
+        """
+        Implementation of ^ operator when left operand is not a :class:`ParserElement`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return other ^ self
+
+    def __and__(self, other):
+        """
+        Implementation of & operator - returns :class:`Each`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return Each([self, other])
+
+    def __rand__(self, other):
+        """
+        Implementation of & operator when left operand is not a :class:`ParserElement`
+        """
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        if not isinstance(other, ParserElement):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                          SyntaxWarning, stacklevel=2)
+            return None
+        return other & self
+
+    def __invert__(self):
+        """
+        Implementation of ~ operator - returns :class:`NotAny`
+        """
+        return NotAny(self)
+
+    def __iter__(self):
+        # must implement __iter__ to override legacy use of sequential access to __getitem__ to
+        # iterate over a sequence
+        raise TypeError('%r object is not iterable' % self.__class__.__name__)
+
+    def __getitem__(self, key):
+        """
+        use ``[]`` indexing notation as a short form for expression repetition:
+         - ``expr[n]`` is equivalent to ``expr*n``
+         - ``expr[m, n]`` is equivalent to ``expr*(m, n)``
+         - ``expr[n, ...]`` or ``expr[n,]`` is equivalent
+              to ``expr*n + ZeroOrMore(expr)``
+              (read as "at least n instances of ``expr``")
+         - ``expr[..., n]`` is equivalent to ``expr*(0, n)``
+              (read as "0 to n instances of ``expr``")
+         - ``expr[...]`` and ``expr[0, ...]`` are equivalent to ``ZeroOrMore(expr)``
+         - ``expr[1, ...]`` is equivalent to ``OneOrMore(expr)``
+         ``None`` may be used in place of ``...``.
+
+        Note that ``expr[..., n]`` and ``expr[m, n]``do not raise an exception
+        if more than ``n`` ``expr``s exist in the input stream.  If this behavior is
+        desired, then write ``expr[..., n] + ~expr``.
+       """
+
+        # convert single arg keys to tuples
+        try:
+            if isinstance(key, str):
+                key = (key,)
+            iter(key)
+        except TypeError:
+            key = (key, key)
+
+        if len(key) > 2:
+            warnings.warn("only 1 or 2 index arguments supported ({0}{1})".format(key[:5],
+                                                                                '... [{0}]'.format(len(key))
+                                                                                if len(key) > 5 else ''))
+
+        # clip to 2 elements
+        ret = self * tuple(key[:2])
+        return ret
+
+    def __call__(self, name=None):
+        """
+        Shortcut for :class:`setResultsName`, with ``listAllMatches=False``.
+
+        If ``name`` is given with a trailing ``'*'`` character, then ``listAllMatches`` will be
+        passed as ``True``.
+
+        If ``name` is omitted, same as calling :class:`copy`.
+
+        Example::
+
+            # these are equivalent
+            userdata = Word(alphas).setResultsName("name") + Word(nums + "-").setResultsName("socsecno")
+            userdata = Word(alphas)("name") + Word(nums + "-")("socsecno")
+        """
+        if name is not None:
+            return self._setResultsName(name)
+        else:
+            return self.copy()
+
+    def suppress(self):
+        """
+        Suppresses the output of this :class:`ParserElement`; useful to keep punctuation from
+        cluttering up returned output.
+        """
+        return Suppress(self)
+
+    def leaveWhitespace(self):
+        """
+        Disables the skipping of whitespace before matching the characters in the
+        :class:`ParserElement`'s defined pattern.  This is normally only used internally by
+        the pyparsing module, but may be needed in some whitespace-sensitive grammars.
+        """
+        self.skipWhitespace = False
+        return self
+
+    def setWhitespaceChars(self, chars):
+        """
+        Overrides the default whitespace chars
+        """
+        self.skipWhitespace = True
+        self.whiteChars = chars
+        self.copyDefaultWhiteChars = False
+        return self
+
+    def parseWithTabs(self):
+        """
+        Overrides default behavior to expand ``<TAB>``s to spaces before parsing the input string.
+        Must be called before ``parseString`` when the input grammar contains elements that
+        match ``<TAB>`` characters.
+        """
+        self.keepTabs = True
+        return self
+
+    def ignore(self, other):
+        """
+        Define expression to be ignored (e.g., comments) while doing pattern
+        matching; may be called repeatedly, to define multiple comment or other
+        ignorable patterns.
+
+        Example::
+
+            patt = OneOrMore(Word(alphas))
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
+
+            patt.ignore(cStyleComment)
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
+        """
+        if isinstance(other, basestring):
+            other = Suppress(other)
+
+        if isinstance(other, Suppress):
+            if other not in self.ignoreExprs:
+                self.ignoreExprs.append(other)
+        else:
+            self.ignoreExprs.append(Suppress(other.copy()))
+        return self
+
+    def setDebugActions(self, startAction, successAction, exceptionAction):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        """
+        self.debugActions = (startAction or _defaultStartDebugAction,
+                             successAction or _defaultSuccessDebugAction,
+                             exceptionAction or _defaultExceptionDebugAction)
+        self.debug = True
+        return self
+
+    def setDebug(self, flag=True):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        Set ``flag`` to True to enable, False to disable.
+
+        Example::
+
+            wd = Word(alphas).setName("alphaword")
+            integer = Word(nums).setName("numword")
+            term = wd | integer
+
+            # turn on debugging for wd
+            wd.setDebug()
+
+            OneOrMore(term).parseString("abc 123 xyz 890")
+
+        prints::
+
+            Match alphaword at loc 0(1,1)
+            Matched alphaword -> ['abc']
+            Match alphaword at loc 3(1,4)
+            Exception raised:Expected alphaword (at char 4), (line:1, col:5)
+            Match alphaword at loc 7(1,8)
+            Matched alphaword -> ['xyz']
+            Match alphaword at loc 11(1,12)
+            Exception raised:Expected alphaword (at char 12), (line:1, col:13)
+            Match alphaword at loc 15(1,16)
+            Exception raised:Expected alphaword (at char 15), (line:1, col:16)
+
+        The output shown is that produced by the default debug actions - custom debug actions can be
+        specified using :class:`setDebugActions`. Prior to attempting
+        to match the ``wd`` expression, the debugging message ``"Match <exprname> at loc <n>(<line>,<col>)"``
+        is shown. Then if the parse succeeds, a ``"Matched"`` message is shown, or an ``"Exception raised"``
+        message is shown. Also note the use of :class:`setName` to assign a human-readable name to the expression,
+        which makes debugging and exception messages easier to understand - for instance, the default
+        name created for the :class:`Word` expression without calling ``setName`` is ``"W:(ABCD...)"``.
+        """
+        if flag:
+            self.setDebugActions(_defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction)
+        else:
+            self.debug = False
+        return self
+
+    def __str__(self):
+        return self.name
+
+    def __repr__(self):
+        return _ustr(self)
+
+    def streamline(self):
+        self.streamlined = True
+        self.strRepr = None
+        return self
+
+    def checkRecursion(self, parseElementList):
+        pass
+
+    def validate(self, validateTrace=None):
+        """
+        Check defined expressions for valid structure, check for infinite recursive definitions.
+        """
+        self.checkRecursion([])
+
+    def parseFile(self, file_or_filename, parseAll=False):
+        """
+        Execute the parse expression on the given file or filename.
+        If a filename is specified (instead of a file object),
+        the entire file is opened, read, and closed before parsing.
+        """
+        try:
+            file_contents = file_or_filename.read()
+        except AttributeError:
+            with open(file_or_filename, "r") as f:
+                file_contents = f.read()
+        try:
+            return self.parseString(file_contents, parseAll)
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clearing out pyparsing internal stack trace
+                if getattr(exc, '__traceback__', None) is not None:
+                    exc.__traceback__ = self._trim_traceback(exc.__traceback__)
+                raise exc
+
+    def __eq__(self, other):
+        if self is other:
+            return True
+        elif isinstance(other, basestring):
+            return self.matches(other)
+        elif isinstance(other, ParserElement):
+            return vars(self) == vars(other)
+        return False
+
+    def __ne__(self, other):
+        return not (self == other)
+
+    def __hash__(self):
+        return id(self)
+
+    def __req__(self, other):
+        return self == other
+
+    def __rne__(self, other):
+        return not (self == other)
+
+    def matches(self, testString, parseAll=True):
+        """
+        Method for quick testing of a parser against a test string. Good for simple
+        inline microtests of sub expressions while building up larger parser.
+
+        Parameters:
+         - testString - to test against this expression for a match
+         - parseAll - (default= ``True``) - flag to pass to :class:`parseString` when running tests
+
+        Example::
+
+            expr = Word(nums)
+            assert expr.matches("100")
+        """
+        try:
+            self.parseString(_ustr(testString), parseAll=parseAll)
+            return True
+        except ParseBaseException:
+            return False
+
+    def runTests(self, tests, parseAll=True, comment='#',
+                 fullDump=True, printResults=True, failureTests=False, postParse=None,
+                 file=None):
+        """
+        Execute the parse expression on a series of test strings, showing each
+        test, the parsed results or where the parse failed. Quick and easy way to
+        run a parse expression against a list of sample strings.
+
+        Parameters:
+         - tests - a list of separate test strings, or a multiline string of test strings
+         - parseAll - (default= ``True``) - flag to pass to :class:`parseString` when running tests
+         - comment - (default= ``'#'``) - expression for indicating embedded comments in the test
+              string; pass None to disable comment filtering
+         - fullDump - (default= ``True``) - dump results as list followed by results names in nested outline;
+              if False, only dump nested list
+         - printResults - (default= ``True``) prints test output to stdout
+         - failureTests - (default= ``False``) indicates if these tests are expected to fail parsing
+         - postParse - (default= ``None``) optional callback for successful parse results; called as
+              `fn(test_string, parse_results)` and returns a string to be added to the test output
+         - file - (default=``None``) optional file-like object to which test output will be written;
+              if None, will default to ``sys.stdout``
+
+        Returns: a (success, results) tuple, where success indicates that all tests succeeded
+        (or failed if ``failureTests`` is True), and the results contain a list of lines of each
+        test's output
+
+        Example::
+
+            number_expr = pyparsing_common.number.copy()
+
+            result = number_expr.runTests('''
+                # unsigned integer
+                100
+                # negative integer
+                -100
+                # float with scientific notation
+                6.02e23
+                # integer with scientific notation
+                1e-12
+                ''')
+            print("Success" if result[0] else "Failed!")
+
+            result = number_expr.runTests('''
+                # stray character
+                100Z
+                # missing leading digit before '.'
+                -.100
+                # too many '.'
+                3.14.159
+                ''', failureTests=True)
+            print("Success" if result[0] else "Failed!")
+
+        prints::
+
+            # unsigned integer
+            100
+            [100]
+
+            # negative integer
+            -100
+            [-100]
+
+            # float with scientific notation
+            6.02e23
+            [6.02e+23]
+
+            # integer with scientific notation
+            1e-12
+            [1e-12]
+
+            Success
+
+            # stray character
+            100Z
+               ^
+            FAIL: Expected end of text (at char 3), (line:1, col:4)
+
+            # missing leading digit before '.'
+            -.100
+            ^
+            FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
+
+            # too many '.'
+            3.14.159
+                ^
+            FAIL: Expected end of text (at char 4), (line:1, col:5)
+
+            Success
+
+        Each test string must be on a single line. If you want to test a string that spans multiple
+        lines, create a test like this::
+
+            expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
+
+        (Note that this is a raw string literal, you must include the leading 'r'.)
+        """
+        if isinstance(tests, basestring):
+            tests = list(map(str.strip, tests.rstrip().splitlines()))
+        if isinstance(comment, basestring):
+            comment = Literal(comment)
+        if file is None:
+            file = sys.stdout
+        print_ = file.write
+
+        allResults = []
+        comments = []
+        success = True
+        NL = Literal(r'\n').addParseAction(replaceWith('\n')).ignore(quotedString)
+        BOM = u'\ufeff'
+        for t in tests:
+            if comment is not None and comment.matches(t, False) or comments and not t:
+                comments.append(t)
+                continue
+            if not t:
+                continue
+            out = ['\n' + '\n'.join(comments) if comments else '', t]
+            comments = []
+            try:
+                # convert newline marks to actual newlines, and strip leading BOM if present
+                t = NL.transformString(t.lstrip(BOM))
+                result = self.parseString(t, parseAll=parseAll)
+            except ParseBaseException as pe:
+                fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
+                if '\n' in t:
+                    out.append(line(pe.loc, t))
+                    out.append(' ' * (col(pe.loc, t) - 1) + '^' + fatal)
+                else:
+                    out.append(' ' * pe.loc + '^' + fatal)
+                out.append("FAIL: " + str(pe))
+                success = success and failureTests
+                result = pe
+            except Exception as exc:
+                out.append("FAIL-EXCEPTION: " + str(exc))
+                success = success and failureTests
+                result = exc
+            else:
+                success = success and not failureTests
+                if postParse is not None:
+                    try:
+                        pp_value = postParse(t, result)
+                        if pp_value is not None:
+                            if isinstance(pp_value, ParseResults):
+                                out.append(pp_value.dump())
+                            else:
+                                out.append(str(pp_value))
+                        else:
+                            out.append(result.dump())
+                    except Exception as e:
+                        out.append(result.dump(full=fullDump))
+                        out.append("{0} failed: {1}: {2}".format(postParse.__name__, type(e).__name__, e))
+                else:
+                    out.append(result.dump(full=fullDump))
+
+            if printResults:
+                if fullDump:
+                    out.append('')
+                print_('\n'.join(out))
+
+            allResults.append((t, result))
+
+        return success, allResults
+
+
+class _PendingSkip(ParserElement):
+    # internal placeholder class to hold a place were '...' is added to a parser element,
+    # once another ParserElement is added, this placeholder will be replaced with a SkipTo
+    def __init__(self, expr, must_skip=False):
+        super(_PendingSkip, self).__init__()
+        self.strRepr = str(expr + Empty()).replace('Empty', '...')
+        self.name = self.strRepr
+        self.anchor = expr
+        self.must_skip = must_skip
+
+    def __add__(self, other):
+        skipper = SkipTo(other).setName("...")("_skipped*")
+        if self.must_skip:
+            def must_skip(t):
+                if not t._skipped or t._skipped.asList() == ['']:
+                    del t[0]
+                    t.pop("_skipped", None)
+            def show_skip(t):
+                if t._skipped.asList()[-1:] == ['']:
+                    skipped = t.pop('_skipped')
+                    t['_skipped'] = 'missing <' + repr(self.anchor) + '>'
+            return (self.anchor + skipper().addParseAction(must_skip)
+                    | skipper().addParseAction(show_skip)) + other
+
+        return self.anchor + skipper + other
+
+    def __repr__(self):
+        return self.strRepr
+
+    def parseImpl(self, *args):
+        raise Exception("use of `...` expression without following SkipTo target expression")
+
+
+class Token(ParserElement):
+    """Abstract :class:`ParserElement` subclass, for defining atomic
+    matching patterns.
+    """
+    def __init__(self):
+        super(Token, self).__init__(savelist=False)
+
+
+class Empty(Token):
+    """An empty token, will always match.
+    """
+    def __init__(self):
+        super(Empty, self).__init__()
+        self.name = "Empty"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+
+class NoMatch(Token):
+    """A token that will never match.
+    """
+    def __init__(self):
+        super(NoMatch, self).__init__()
+        self.name = "NoMatch"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.errmsg = "Unmatchable token"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Literal(Token):
+    """Token to exactly match a specified string.
+
+    Example::
+
+        Literal('blah').parseString('blah')  # -> ['blah']
+        Literal('blah').parseString('blahfooblah')  # -> ['blah']
+        Literal('blah').parseString('bla')  # -> Exception: Expected "blah"
+
+    For case-insensitive matching, use :class:`CaselessLiteral`.
+
+    For keyword matching (force word break before and after the matched string),
+    use :class:`Keyword` or :class:`CaselessKeyword`.
+    """
+    def __init__(self, matchString):
+        super(Literal, self).__init__()
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Literal; use Empty() instead",
+                            SyntaxWarning, stacklevel=2)
+            self.__class__ = Empty
+        self.name = '"%s"' % _ustr(self.match)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+
+        # Performance tuning: modify __class__ to select
+        # a parseImpl optimized for single-character check
+        if self.matchLen == 1 and type(self) is Literal:
+            self.__class__ = _SingleCharLiteral
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc] == self.firstMatchChar and instring.startswith(self.match, loc):
+            return loc + self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class _SingleCharLiteral(Literal):
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc] == self.firstMatchChar:
+            return loc + 1, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+_L = Literal
+ParserElement._literalStringClass = Literal
+
+class Keyword(Token):
+    """Token to exactly match a specified string as a keyword, that is,
+    it must be immediately followed by a non-keyword character.  Compare
+    with :class:`Literal`:
+
+     - ``Literal("if")`` will match the leading ``'if'`` in
+       ``'ifAndOnlyIf'``.
+     - ``Keyword("if")`` will not; it will only match the leading
+       ``'if'`` in ``'if x=1'``, or ``'if(y==2)'``
+
+    Accepts two optional constructor arguments in addition to the
+    keyword string:
+
+     - ``identChars`` is a string of characters that would be valid
+       identifier characters, defaulting to all alphanumerics + "_" and
+       "$"
+     - ``caseless`` allows case-insensitive matching, default is ``False``.
+
+    Example::
+
+        Keyword("start").parseString("start")  # -> ['start']
+        Keyword("start").parseString("starting")  # -> Exception
+
+    For case-insensitive matching, use :class:`CaselessKeyword`.
+    """
+    DEFAULT_KEYWORD_CHARS = alphanums + "_$"
+
+    def __init__(self, matchString, identChars=None, caseless=False):
+        super(Keyword, self).__init__()
+        if identChars is None:
+            identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Keyword; use Empty() instead",
+                          SyntaxWarning, stacklevel=2)
+        self.name = '"%s"' % self.match
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+        self.caseless = caseless
+        if caseless:
+            self.caselessmatch = matchString.upper()
+            identChars = identChars.upper()
+        self.identChars = set(identChars)
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if self.caseless:
+            if ((instring[loc:loc + self.matchLen].upper() == self.caselessmatch)
+                    and (loc >= len(instring) - self.matchLen
+                         or instring[loc + self.matchLen].upper() not in self.identChars)
+                    and (loc == 0
+                         or instring[loc - 1].upper() not in self.identChars)):
+                return loc + self.matchLen, self.match
+
+        else:
+            if instring[loc] == self.firstMatchChar:
+                if ((self.matchLen == 1 or instring.startswith(self.match, loc))
+                        and (loc >= len(instring) - self.matchLen
+                             or instring[loc + self.matchLen] not in self.identChars)
+                        and (loc == 0 or instring[loc - 1] not in self.identChars)):
+                    return loc + self.matchLen, self.match
+
+        raise ParseException(instring, loc, self.errmsg, self)
+
+    def copy(self):
+        c = super(Keyword, self).copy()
+        c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        return c
+
+    @staticmethod
+    def setDefaultKeywordChars(chars):
+        """Overrides the default Keyword chars
+        """
+        Keyword.DEFAULT_KEYWORD_CHARS = chars
+
+class CaselessLiteral(Literal):
+    """Token to match a specified string, ignoring case of letters.
+    Note: the matched results will always be in the case of the given
+    match string, NOT the case of the input text.
+
+    Example::
+
+        OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
+
+    (Contrast with example for :class:`CaselessKeyword`.)
+    """
+    def __init__(self, matchString):
+        super(CaselessLiteral, self).__init__(matchString.upper())
+        # Preserve the defining literal.
+        self.returnString = matchString
+        self.name = "'%s'" % self.returnString
+        self.errmsg = "Expected " + self.name
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc:loc + self.matchLen].upper() == self.match:
+            return loc + self.matchLen, self.returnString
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class CaselessKeyword(Keyword):
+    """
+    Caseless version of :class:`Keyword`.
+
+    Example::
+
+        OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
+
+    (Contrast with example for :class:`CaselessLiteral`.)
+    """
+    def __init__(self, matchString, identChars=None):
+        super(CaselessKeyword, self).__init__(matchString, identChars, caseless=True)
+
+class CloseMatch(Token):
+    """A variation on :class:`Literal` which matches "close" matches,
+    that is, strings with at most 'n' mismatching characters.
+    :class:`CloseMatch` takes parameters:
+
+     - ``match_string`` - string to be matched
+     - ``maxMismatches`` - (``default=1``) maximum number of
+       mismatches allowed to count as a match
+
+    The results from a successful parse will contain the matched text
+    from the input string and the following named results:
+
+     - ``mismatches`` - a list of the positions within the
+       match_string where mismatches were found
+     - ``original`` - the original match_string used to compare
+       against the input string
+
+    If ``mismatches`` is an empty list, then the match was an exact
+    match.
+
+    Example::
+
+        patt = CloseMatch("ATCATCGAATGGA")
+        patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
+        patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
+
+        # exact match
+        patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
+
+        # close match allowing up to 2 mismatches
+        patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
+        patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
+    """
+    def __init__(self, match_string, maxMismatches=1):
+        super(CloseMatch, self).__init__()
+        self.name = match_string
+        self.match_string = match_string
+        self.maxMismatches = maxMismatches
+        self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
+        self.mayIndexError = False
+        self.mayReturnEmpty = False
+
+    def parseImpl(self, instring, loc, doActions=True):
+        start = loc
+        instrlen = len(instring)
+        maxloc = start + len(self.match_string)
+
+        if maxloc <= instrlen:
+            match_string = self.match_string
+            match_stringloc = 0
+            mismatches = []
+            maxMismatches = self.maxMismatches
+
+            for match_stringloc, s_m in enumerate(zip(instring[loc:maxloc], match_string)):
+                src, mat = s_m
+                if src != mat:
+                    mismatches.append(match_stringloc)
+                    if len(mismatches) > maxMismatches:
+                        break
+            else:
+                loc = match_stringloc + 1
+                results = ParseResults([instring[start:loc]])
+                results['original'] = match_string
+                results['mismatches'] = mismatches
+                return loc, results
+
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Word(Token):
+    """Token for matching words composed of allowed character sets.
+    Defined with string containing all allowed initial characters, an
+    optional string containing allowed body characters (if omitted,
+    defaults to the initial character set), and an optional minimum,
+    maximum, and/or exact length.  The default value for ``min`` is
+    1 (a minimum value < 1 is not valid); the default values for
+    ``max`` and ``exact`` are 0, meaning no maximum or exact
+    length restriction. An optional ``excludeChars`` parameter can
+    list characters that might be found in the input ``bodyChars``
+    string; useful to define a word of all printables except for one or
+    two characters, for instance.
+
+    :class:`srange` is useful for defining custom character set strings
+    for defining ``Word`` expressions, using range notation from
+    regular expression character sets.
+
+    A common mistake is to use :class:`Word` to match a specific literal
+    string, as in ``Word("Address")``. Remember that :class:`Word`
+    uses the string argument to define *sets* of matchable characters.
+    This expression would match "Add", "AAA", "dAred", or any other word
+    made up of the characters 'A', 'd', 'r', 'e', and 's'. To match an
+    exact literal string, use :class:`Literal` or :class:`Keyword`.
+
+    pyparsing includes helper strings for building Words:
+
+     - :class:`alphas`
+     - :class:`nums`
+     - :class:`alphanums`
+     - :class:`hexnums`
+     - :class:`alphas8bit` (alphabetic characters in ASCII range 128-255
+       - accented, tilded, umlauted, etc.)
+     - :class:`punc8bit` (non-alphabetic characters in ASCII range
+       128-255 - currency, symbols, superscripts, diacriticals, etc.)
+     - :class:`printables` (any non-whitespace character)
+
+    Example::
+
+        # a word composed of digits
+        integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
+
+        # a word with a leading capital, and zero or more lowercase
+        capital_word = Word(alphas.upper(), alphas.lower())
+
+        # hostnames are alphanumeric, with leading alpha, and '-'
+        hostname = Word(alphas, alphanums + '-')
+
+        # roman numeral (not a strict parser, accepts invalid mix of characters)
+        roman = Word("IVXLCDM")
+
+        # any string of non-whitespace characters, except for ','
+        csv_value = Word(printables, excludeChars=",")
+    """
+    def __init__(self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None):
+        super(Word, self).__init__()
+        if excludeChars:
+            excludeChars = set(excludeChars)
+            initChars = ''.join(c for c in initChars if c not in excludeChars)
+            if bodyChars:
+                bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
+        self.initCharsOrig = initChars
+        self.initChars = set(initChars)
+        if bodyChars:
+            self.bodyCharsOrig = bodyChars
+            self.bodyChars = set(bodyChars)
+        else:
+            self.bodyCharsOrig = initChars
+            self.bodyChars = set(initChars)
+
+        self.maxSpecified = max > 0
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.asKeyword = asKeyword
+
+        if ' ' not in self.initCharsOrig + self.bodyCharsOrig and (min == 1 and max == 0 and exact == 0):
+            if self.bodyCharsOrig == self.initCharsOrig:
+                self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
+            elif len(self.initCharsOrig) == 1:
+                self.reString = "%s[%s]*" % (re.escape(self.initCharsOrig),
+                                             _escapeRegexRangeChars(self.bodyCharsOrig),)
+            else:
+                self.reString = "[%s][%s]*" % (_escapeRegexRangeChars(self.initCharsOrig),
+                                               _escapeRegexRangeChars(self.bodyCharsOrig),)
+            if self.asKeyword:
+                self.reString = r"\b" + self.reString + r"\b"
+
+            try:
+                self.re = re.compile(self.reString)
+            except Exception:
+                self.re = None
+            else:
+                self.re_match = self.re.match
+                self.__class__ = _WordRegex
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc] not in self.initChars:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        instrlen = len(instring)
+        bodychars = self.bodyChars
+        maxloc = start + self.maxLen
+        maxloc = min(maxloc, instrlen)
+        while loc < maxloc and instring[loc] in bodychars:
+            loc += 1
+
+        throwException = False
+        if loc - start < self.minLen:
+            throwException = True
+        elif self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
+            throwException = True
+        elif self.asKeyword:
+            if (start > 0 and instring[start - 1] in bodychars
+                    or loc < instrlen and instring[loc] in bodychars):
+                throwException = True
+
+        if throwException:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__(self):
+        try:
+            return super(Word, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+
+            def charsAsStr(s):
+                if len(s) > 4:
+                    return s[:4] + "..."
+                else:
+                    return s
+
+            if self.initCharsOrig != self.bodyCharsOrig:
+                self.strRepr = "W:(%s, %s)" % (charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig))
+            else:
+                self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
+
+        return self.strRepr
+
+class _WordRegex(Word):
+    def parseImpl(self, instring, loc, doActions=True):
+        result = self.re_match(instring, loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        return loc, result.group()
+
+
+class Char(_WordRegex):
+    """A short-cut class for defining ``Word(characters, exact=1)``,
+    when defining a match of any single character in a string of
+    characters.
+    """
+    def __init__(self, charset, asKeyword=False, excludeChars=None):
+        super(Char, self).__init__(charset, exact=1, asKeyword=asKeyword, excludeChars=excludeChars)
+        self.reString = "[%s]" % _escapeRegexRangeChars(''.join(self.initChars))
+        if asKeyword:
+            self.reString = r"\b%s\b" % self.reString
+        self.re = re.compile(self.reString)
+        self.re_match = self.re.match
+
+
+class Regex(Token):
+    r"""Token for matching strings that match a given regular
+    expression. Defined with string specifying the regular expression in
+    a form recognized by the stdlib Python  `re module <https://docs.python.org/3/library/re.html>`_.
+    If the given regex contains named groups (defined using ``(?P<name>...)``),
+    these will be preserved as named parse results.
+
+    If instead of the Python stdlib re module you wish to use a different RE module
+    (such as the `regex` module), you can replace it by either building your
+    Regex object with a compiled RE that was compiled using regex:
+
+    Example::
+
+        realnum = Regex(r"[+-]?\d+\.\d*")
+        date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
+        # ref: https://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
+        roman = Regex(r"M{0,4}(CM|CD|D?{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
+
+        # use regex module instead of stdlib re module to construct a Regex using
+        # a compiled regular expression
+        import regex
+        parser = pp.Regex(regex.compile(r'[0-9]'))
+
+    """
+    def __init__(self, pattern, flags=0, asGroupList=False, asMatch=False):
+        """The parameters ``pattern`` and ``flags`` are passed
+        to the ``re.compile()`` function as-is. See the Python
+        `re module <https://docs.python.org/3/library/re.html>`_ module for an
+        explanation of the acceptable patterns and flags.
+        """
+        super(Regex, self).__init__()
+
+        if isinstance(pattern, basestring):
+            if not pattern:
+                warnings.warn("null string passed to Regex; use Empty() instead",
+                              SyntaxWarning, stacklevel=2)
+
+            self.pattern = pattern
+            self.flags = flags
+
+            try:
+                self.re = re.compile(self.pattern, self.flags)
+                self.reString = self.pattern
+            except sre_constants.error:
+                warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
+                              SyntaxWarning, stacklevel=2)
+                raise
+
+        elif hasattr(pattern, 'pattern') and hasattr(pattern, 'match'):
+            self.re = pattern
+            self.pattern = self.reString = pattern.pattern
+            self.flags = flags
+
+        else:
+            raise TypeError("Regex may only be constructed with a string or a compiled RE object")
+
+        self.re_match = self.re.match
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = self.re_match("") is not None
+        self.asGroupList = asGroupList
+        self.asMatch = asMatch
+        if self.asGroupList:
+            self.parseImpl = self.parseImplAsGroupList
+        if self.asMatch:
+            self.parseImpl = self.parseImplAsMatch
+
+    def parseImpl(self, instring, loc, doActions=True):
+        result = self.re_match(instring, loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = ParseResults(result.group())
+        d = result.groupdict()
+        if d:
+            for k, v in d.items():
+                ret[k] = v
+        return loc, ret
+
+    def parseImplAsGroupList(self, instring, loc, doActions=True):
+        result = self.re_match(instring, loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = result.groups()
+        return loc, ret
+
+    def parseImplAsMatch(self, instring, loc, doActions=True):
+        result = self.re_match(instring, loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = result
+        return loc, ret
+
+    def __str__(self):
+        try:
+            return super(Regex, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "Re:(%s)" % repr(self.pattern)
+
+        return self.strRepr
+
+    def sub(self, repl):
+        r"""
+        Return Regex with an attached parse action to transform the parsed
+        result as if called using `re.sub(expr, repl, string) <https://docs.python.org/3/library/re.html#re.sub>`_.
+
+        Example::
+
+            make_html = Regex(r"(\w+):(.*?):").sub(r"<\1>\2</\1>")
+            print(make_html.transformString("h1:main title:"))
+            # prints "<h1>main title</h1>"
+        """
+        if self.asGroupList:
+            warnings.warn("cannot use sub() with Regex(asGroupList=True)",
+                          SyntaxWarning, stacklevel=2)
+            raise SyntaxError()
+
+        if self.asMatch and callable(repl):
+            warnings.warn("cannot use sub() with a callable with Regex(asMatch=True)",
+                          SyntaxWarning, stacklevel=2)
+            raise SyntaxError()
+
+        if self.asMatch:
+            def pa(tokens):
+                return tokens[0].expand(repl)
+        else:
+            def pa(tokens):
+                return self.re.sub(repl, tokens[0])
+        return self.addParseAction(pa)
+
+class QuotedString(Token):
+    r"""
+    Token for matching strings that are delimited by quoting characters.
+
+    Defined with the following parameters:
+
+        - quoteChar - string of one or more characters defining the
+          quote delimiting string
+        - escChar - character to escape quotes, typically backslash
+          (default= ``None``)
+        - escQuote - special quote sequence to escape an embedded quote
+          string (such as SQL's ``""`` to escape an embedded ``"``)
+          (default= ``None``)
+        - multiline - boolean indicating whether quotes can span
+          multiple lines (default= ``False``)
+        - unquoteResults - boolean indicating whether the matched text
+          should be unquoted (default= ``True``)
+        - endQuoteChar - string of one or more characters defining the
+          end of the quote delimited string (default= ``None``  => same as
+          quoteChar)
+        - convertWhitespaceEscapes - convert escaped whitespace
+          (``'\t'``, ``'\n'``, etc.) to actual whitespace
+          (default= ``True``)
+
+    Example::
+
+        qs = QuotedString('"')
+        print(qs.searchString('lsjdf "This is the quote" sldjf'))
+        complex_qs = QuotedString('{{', endQuoteChar='}}')
+        print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
+        sql_qs = QuotedString('"', escQuote='""')
+        print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
+
+    prints::
+
+        [['This is the quote']]
+        [['This is the "quote"']]
+        [['This is the quote with "embedded" quotes']]
+    """
+    def __init__(self, quoteChar, escChar=None, escQuote=None, multiline=False,
+                 unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
+        super(QuotedString, self).__init__()
+
+        # remove white space from quote chars - wont work anyway
+        quoteChar = quoteChar.strip()
+        if not quoteChar:
+            warnings.warn("quoteChar cannot be the empty string", SyntaxWarning, stacklevel=2)
+            raise SyntaxError()
+
+        if endQuoteChar is None:
+            endQuoteChar = quoteChar
+        else:
+            endQuoteChar = endQuoteChar.strip()
+            if not endQuoteChar:
+                warnings.warn("endQuoteChar cannot be the empty string", SyntaxWarning, stacklevel=2)
+                raise SyntaxError()
+
+        self.quoteChar = quoteChar
+        self.quoteCharLen = len(quoteChar)
+        self.firstQuoteChar = quoteChar[0]
+        self.endQuoteChar = endQuoteChar
+        self.endQuoteCharLen = len(endQuoteChar)
+        self.escChar = escChar
+        self.escQuote = escQuote
+        self.unquoteResults = unquoteResults
+        self.convertWhitespaceEscapes = convertWhitespaceEscapes
+
+        if multiline:
+            self.flags = re.MULTILINE | re.DOTALL
+            self.pattern = r'%s(?:[^%s%s]' % (re.escape(self.quoteChar),
+                                              _escapeRegexRangeChars(self.endQuoteChar[0]),
+                                              (escChar is not None and _escapeRegexRangeChars(escChar) or ''))
+        else:
+            self.flags = 0
+            self.pattern = r'%s(?:[^%s\n\r%s]' % (re.escape(self.quoteChar),
+                                                  _escapeRegexRangeChars(self.endQuoteChar[0]),
+                                                  (escChar is not None and _escapeRegexRangeChars(escChar) or ''))
+        if len(self.endQuoteChar) > 1:
+            self.pattern += (
+                '|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
+                                                   _escapeRegexRangeChars(self.endQuoteChar[i]))
+                                      for i in range(len(self.endQuoteChar) - 1, 0, -1)) + ')')
+
+        if escQuote:
+            self.pattern += (r'|(?:%s)' % re.escape(escQuote))
+        if escChar:
+            self.pattern += (r'|(?:%s.)' % re.escape(escChar))
+            self.escCharReplacePattern = re.escape(self.escChar) + "(.)"
+        self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
+
+        try:
+            self.re = re.compile(self.pattern, self.flags)
+            self.reString = self.pattern
+            self.re_match = self.re.match
+        except sre_constants.error:
+            warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
+                          SyntaxWarning, stacklevel=2)
+            raise
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = True
+
+    def parseImpl(self, instring, loc, doActions=True):
+        result = instring[loc] == self.firstQuoteChar and self.re_match(instring, loc) or None
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = result.group()
+
+        if self.unquoteResults:
+
+            # strip off quotes
+            ret = ret[self.quoteCharLen: -self.endQuoteCharLen]
+
+            if isinstance(ret, basestring):
+                # replace escaped whitespace
+                if '\\' in ret and self.convertWhitespaceEscapes:
+                    ws_map = {
+                        r'\t': '\t',
+                        r'\n': '\n',
+                        r'\f': '\f',
+                        r'\r': '\r',
+                    }
+                    for wslit, wschar in ws_map.items():
+                        ret = ret.replace(wslit, wschar)
+
+                # replace escaped characters
+                if self.escChar:
+                    ret = re.sub(self.escCharReplacePattern, r"\g<1>", ret)
+
+                # replace escaped quotes
+                if self.escQuote:
+                    ret = ret.replace(self.escQuote, self.endQuoteChar)
+
+        return loc, ret
+
+    def __str__(self):
+        try:
+            return super(QuotedString, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
+
+        return self.strRepr
+
+
+class CharsNotIn(Token):
+    """Token for matching words composed of characters *not* in a given
+    set (will include whitespace in matched characters if not listed in
+    the provided exclusion set - see example). Defined with string
+    containing all disallowed characters, and an optional minimum,
+    maximum, and/or exact length.  The default value for ``min`` is
+    1 (a minimum value < 1 is not valid); the default values for
+    ``max`` and ``exact`` are 0, meaning no maximum or exact
+    length restriction.
+
+    Example::
+
+        # define a comma-separated-value as anything that is not a ','
+        csv_value = CharsNotIn(',')
+        print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
+
+    prints::
+
+        ['dkls', 'lsdkjf', 's12 34', '@!#', '213']
+    """
+    def __init__(self, notChars, min=1, max=0, exact=0):
+        super(CharsNotIn, self).__init__()
+        self.skipWhitespace = False
+        self.notChars = notChars
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use "
+                             "Optional(CharsNotIn()) if zero-length char group is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = (self.minLen == 0)
+        self.mayIndexError = False
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc] in self.notChars:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        notchars = self.notChars
+        maxlen = min(start + self.maxLen, len(instring))
+        while loc < maxlen and instring[loc] not in notchars:
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__(self):
+        try:
+            return super(CharsNotIn, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            if len(self.notChars) > 4:
+                self.strRepr = "!W:(%s...)" % self.notChars[:4]
+            else:
+                self.strRepr = "!W:(%s)" % self.notChars
+
+        return self.strRepr
+
+class White(Token):
+    """Special matching class for matching whitespace.  Normally,
+    whitespace is ignored by pyparsing grammars.  This class is included
+    when some whitespace structures are significant.  Define with
+    a string containing the whitespace characters to be matched; default
+    is ``" \\t\\r\\n"``.  Also takes optional ``min``,
+    ``max``, and ``exact`` arguments, as defined for the
+    :class:`Word` class.
+    """
+    whiteStrs = {
+        ' ' : '<SP>',
+        '\t': '<TAB>',
+        '\n': '<LF>',
+        '\r': '<CR>',
+        '\f': '<FF>',
+        u'\u00A0': '<NBSP>',
+        u'\u1680': '<OGHAM_SPACE_MARK>',
+        u'\u180E': '<MONGOLIAN_VOWEL_SEPARATOR>',
+        u'\u2000': '<EN_QUAD>',
+        u'\u2001': '<EM_QUAD>',
+        u'\u2002': '<EN_SPACE>',
+        u'\u2003': '<EM_SPACE>',
+        u'\u2004': '<THREE-PER-EM_SPACE>',
+        u'\u2005': '<FOUR-PER-EM_SPACE>',
+        u'\u2006': '<SIX-PER-EM_SPACE>',
+        u'\u2007': '<FIGURE_SPACE>',
+        u'\u2008': '<PUNCTUATION_SPACE>',
+        u'\u2009': '<THIN_SPACE>',
+        u'\u200A': '<HAIR_SPACE>',
+        u'\u200B': '<ZERO_WIDTH_SPACE>',
+        u'\u202F': '<NNBSP>',
+        u'\u205F': '<MMSP>',
+        u'\u3000': '<IDEOGRAPHIC_SPACE>',
+        }
+    def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
+        super(White, self).__init__()
+        self.matchWhite = ws
+        self.setWhitespaceChars("".join(c for c in self.whiteChars if c not in self.matchWhite))
+        # ~ self.leaveWhitespace()
+        self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
+        self.mayReturnEmpty = True
+        self.errmsg = "Expected " + self.name
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if instring[loc] not in self.matchWhite:
+            raise ParseException(instring, loc, self.errmsg, self)
+        start = loc
+        loc += 1
+        maxloc = start + self.maxLen
+        maxloc = min(maxloc, len(instring))
+        while loc < maxloc and instring[loc] in self.matchWhite:
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+
+class _PositionToken(Token):
+    def __init__(self):
+        super(_PositionToken, self).__init__()
+        self.name = self.__class__.__name__
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+class GoToColumn(_PositionToken):
+    """Token to advance to a specific column of input text; useful for
+    tabular report scraping.
+    """
+    def __init__(self, colno):
+        super(GoToColumn, self).__init__()
+        self.col = colno
+
+    def preParse(self, instring, loc):
+        if col(loc, instring) != self.col:
+            instrlen = len(instring)
+            if self.ignoreExprs:
+                loc = self._skipIgnorables(instring, loc)
+            while loc < instrlen and instring[loc].isspace() and col(loc, instring) != self.col:
+                loc += 1
+        return loc
+
+    def parseImpl(self, instring, loc, doActions=True):
+        thiscol = col(loc, instring)
+        if thiscol > self.col:
+            raise ParseException(instring, loc, "Text not in expected column", self)
+        newloc = loc + self.col - thiscol
+        ret = instring[loc: newloc]
+        return newloc, ret
+
+
+class LineStart(_PositionToken):
+    r"""Matches if current position is at the beginning of a line within
+    the parse string
+
+    Example::
+
+        test = '''\
+        AAA this line
+        AAA and this line
+          AAA but not this one
+        B AAA and definitely not this one
+        '''
+
+        for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
+            print(t)
+
+    prints::
+
+        ['AAA', ' this line']
+        ['AAA', ' and this line']
+
+    """
+    def __init__(self):
+        super(LineStart, self).__init__()
+        self.errmsg = "Expected start of line"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if col(loc, instring) == 1:
+            return loc, []
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class LineEnd(_PositionToken):
+    """Matches if current position is at the end of a line within the
+    parse string
+    """
+    def __init__(self):
+        super(LineEnd, self).__init__()
+        self.setWhitespaceChars(ParserElement.DEFAULT_WHITE_CHARS.replace("\n", ""))
+        self.errmsg = "Expected end of line"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if loc < len(instring):
+            if instring[loc] == "\n":
+                return loc + 1, "\n"
+            else:
+                raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc + 1, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class StringStart(_PositionToken):
+    """Matches if current position is at the beginning of the parse
+    string
+    """
+    def __init__(self):
+        super(StringStart, self).__init__()
+        self.errmsg = "Expected start of text"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if loc != 0:
+            # see if entire string up to here is just whitespace and ignoreables
+            if loc != self.preParse(instring, 0):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class StringEnd(_PositionToken):
+    """Matches if current position is at the end of the parse string
+    """
+    def __init__(self):
+        super(StringEnd, self).__init__()
+        self.errmsg = "Expected end of text"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if loc < len(instring):
+            raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc + 1, []
+        elif loc > len(instring):
+            return loc, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class WordStart(_PositionToken):
+    """Matches if the current position is at the beginning of a Word,
+    and is not preceded by any character in a given set of
+    ``wordChars`` (default= ``printables``). To emulate the
+    ``\b`` behavior of regular expressions, use
+    ``WordStart(alphanums)``. ``WordStart`` will also match at
+    the beginning of the string being parsed, or at the beginning of
+    a line.
+    """
+    def __init__(self, wordChars=printables):
+        super(WordStart, self).__init__()
+        self.wordChars = set(wordChars)
+        self.errmsg = "Not at the start of a word"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if loc != 0:
+            if (instring[loc - 1] in self.wordChars
+                    or instring[loc] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class WordEnd(_PositionToken):
+    """Matches if the current position is at the end of a Word, and is
+    not followed by any character in a given set of ``wordChars``
+    (default= ``printables``). To emulate the ``\b`` behavior of
+    regular expressions, use ``WordEnd(alphanums)``. ``WordEnd``
+    will also match at the end of the string being parsed, or at the end
+    of a line.
+    """
+    def __init__(self, wordChars=printables):
+        super(WordEnd, self).__init__()
+        self.wordChars = set(wordChars)
+        self.skipWhitespace = False
+        self.errmsg = "Not at the end of a word"
+
+    def parseImpl(self, instring, loc, doActions=True):
+        instrlen = len(instring)
+        if instrlen > 0 and loc < instrlen:
+            if (instring[loc] in self.wordChars or
+                    instring[loc - 1] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+
+class ParseExpression(ParserElement):
+    """Abstract subclass of ParserElement, for combining and
+    post-processing parsed tokens.
+    """
+    def __init__(self, exprs, savelist=False):
+        super(ParseExpression, self).__init__(savelist)
+        if isinstance(exprs, _generatorType):
+            exprs = list(exprs)
+
+        if isinstance(exprs, basestring):
+            self.exprs = [self._literalStringClass(exprs)]
+        elif isinstance(exprs, ParserElement):
+            self.exprs = [exprs]
+        elif isinstance(exprs, Iterable):
+            exprs = list(exprs)
+            # if sequence of strings provided, wrap with Literal
+            if any(isinstance(expr, basestring) for expr in exprs):
+                exprs = (self._literalStringClass(e) if isinstance(e, basestring) else e for e in exprs)
+            self.exprs = list(exprs)
+        else:
+            try:
+                self.exprs = list(exprs)
+            except TypeError:
+                self.exprs = [exprs]
+        self.callPreparse = False
+
+    def append(self, other):
+        self.exprs.append(other)
+        self.strRepr = None
+        return self
+
+    def leaveWhitespace(self):
+        """Extends ``leaveWhitespace`` defined in base class, and also invokes ``leaveWhitespace`` on
+           all contained expressions."""
+        self.skipWhitespace = False
+        self.exprs = [e.copy() for e in self.exprs]
+        for e in self.exprs:
+            e.leaveWhitespace()
+        return self
+
+    def ignore(self, other):
+        if isinstance(other, Suppress):
+            if other not in self.ignoreExprs:
+                super(ParseExpression, self).ignore(other)
+                for e in self.exprs:
+                    e.ignore(self.ignoreExprs[-1])
+        else:
+            super(ParseExpression, self).ignore(other)
+            for e in self.exprs:
+                e.ignore(self.ignoreExprs[-1])
+        return self
+
+    def __str__(self):
+        try:
+            return super(ParseExpression, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "%s:(%s)" % (self.__class__.__name__, _ustr(self.exprs))
+        return self.strRepr
+
+    def streamline(self):
+        super(ParseExpression, self).streamline()
+
+        for e in self.exprs:
+            e.streamline()
+
+        # collapse nested And's of the form And(And(And(a, b), c), d) to And(a, b, c, d)
+        # but only if there are no parse actions or resultsNames on the nested And's
+        # (likewise for Or's and MatchFirst's)
+        if len(self.exprs) == 2:
+            other = self.exprs[0]
+            if (isinstance(other, self.__class__)
+                    and not other.parseAction
+                    and other.resultsName is None
+                    and not other.debug):
+                self.exprs = other.exprs[:] + [self.exprs[1]]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+            other = self.exprs[-1]
+            if (isinstance(other, self.__class__)
+                    and not other.parseAction
+                    and other.resultsName is None
+                    and not other.debug):
+                self.exprs = self.exprs[:-1] + other.exprs[:]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+        self.errmsg = "Expected " + _ustr(self)
+
+        return self
+
+    def validate(self, validateTrace=None):
+        tmp = (validateTrace if validateTrace is not None else [])[:] + [self]
+        for e in self.exprs:
+            e.validate(tmp)
+        self.checkRecursion([])
+
+    def copy(self):
+        ret = super(ParseExpression, self).copy()
+        ret.exprs = [e.copy() for e in self.exprs]
+        return ret
+
+    def _setResultsName(self, name, listAllMatches=False):
+        if __diag__.warn_ungrouped_named_tokens_in_collection:
+            for e in self.exprs:
+                if isinstance(e, ParserElement) and e.resultsName:
+                    warnings.warn("{0}: setting results name {1!r} on {2} expression "
+                                  "collides with {3!r} on contained expression".format("warn_ungrouped_named_tokens_in_collection",
+                                                                                       name,
+                                                                                       type(self).__name__,
+                                                                                       e.resultsName),
+                                  stacklevel=3)
+
+        return super(ParseExpression, self)._setResultsName(name, listAllMatches)
+
+
+class And(ParseExpression):
+    """
+    Requires all given :class:`ParseExpression` s to be found in the given order.
+    Expressions may be separated by whitespace.
+    May be constructed using the ``'+'`` operator.
+    May also be constructed using the ``'-'`` operator, which will
+    suppress backtracking.
+
+    Example::
+
+        integer = Word(nums)
+        name_expr = OneOrMore(Word(alphas))
+
+        expr = And([integer("id"), name_expr("name"), integer("age")])
+        # more easily written as:
+        expr = integer("id") + name_expr("name") + integer("age")
+    """
+
+    class _ErrorStop(Empty):
+        def __init__(self, *args, **kwargs):
+            super(And._ErrorStop, self).__init__(*args, **kwargs)
+            self.name = '-'
+            self.leaveWhitespace()
+
+    def __init__(self, exprs, savelist=True):
+        exprs = list(exprs)
+        if exprs and Ellipsis in exprs:
+            tmp = []
+            for i, expr in enumerate(exprs):
+                if expr is Ellipsis:
+                    if i < len(exprs) - 1:
+                        skipto_arg = (Empty() + exprs[i + 1]).exprs[-1]
+                        tmp.append(SkipTo(skipto_arg)("_skipped*"))
+                    else:
+                        raise Exception("cannot construct And with sequence ending in ...")
+                else:
+                    tmp.append(expr)
+            exprs[:] = tmp
+        super(And, self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.setWhitespaceChars(self.exprs[0].whiteChars)
+        self.skipWhitespace = self.exprs[0].skipWhitespace
+        self.callPreparse = True
+
+    def streamline(self):
+        # collapse any _PendingSkip's
+        if self.exprs:
+            if any(isinstance(e, ParseExpression) and e.exprs and isinstance(e.exprs[-1], _PendingSkip)
+                   for e in self.exprs[:-1]):
+                for i, e in enumerate(self.exprs[:-1]):
+                    if e is None:
+                        continue
+                    if (isinstance(e, ParseExpression)
+                            and e.exprs and isinstance(e.exprs[-1], _PendingSkip)):
+                        e.exprs[-1] = e.exprs[-1] + self.exprs[i + 1]
+                        self.exprs[i + 1] = None
+                self.exprs = [e for e in self.exprs if e is not None]
+
+        super(And, self).streamline()
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        return self
+
+    def parseImpl(self, instring, loc, doActions=True):
+        # pass False as last arg to _parse for first element, since we already
+        # pre-parsed the string as part of our And pre-parsing
+        loc, resultlist = self.exprs[0]._parse(instring, loc, doActions, callPreParse=False)
+        errorStop = False
+        for e in self.exprs[1:]:
+            if isinstance(e, And._ErrorStop):
+                errorStop = True
+                continue
+            if errorStop:
+                try:
+                    loc, exprtokens = e._parse(instring, loc, doActions)
+                except ParseSyntaxException:
+                    raise
+                except ParseBaseException as pe:
+                    pe.__traceback__ = None
+                    raise ParseSyntaxException._from_exception(pe)
+                except IndexError:
+                    raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
+            else:
+                loc, exprtokens = e._parse(instring, loc, doActions)
+            if exprtokens or exprtokens.haskeys():
+                resultlist += exprtokens
+        return loc, resultlist
+
+    def __iadd__(self, other):
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        return self.append(other)  # And([self, other])
+
+    def checkRecursion(self, parseElementList):
+        subRecCheckList = parseElementList[:] + [self]
+        for e in self.exprs:
+            e.checkRecursion(subRecCheckList)
+            if not e.mayReturnEmpty:
+                break
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+
+class Or(ParseExpression):
+    """Requires that at least one :class:`ParseExpression` is found. If
+    two expressions match, the expression that matches the longest
+    string will be used. May be constructed using the ``'^'``
+    operator.
+
+    Example::
+
+        # construct Or using '^' operator
+
+        number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789"))
+
+    prints::
+
+        [['123'], ['3.1416'], ['789']]
+    """
+    def __init__(self, exprs, savelist=False):
+        super(Or, self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def streamline(self):
+        super(Or, self).streamline()
+        if __compat__.collect_all_And_tokens:
+            self.saveAsList = any(e.saveAsList for e in self.exprs)
+        return self
+
+    def parseImpl(self, instring, loc, doActions=True):
+        maxExcLoc = -1
+        maxException = None
+        matches = []
+        for e in self.exprs:
+            try:
+                loc2 = e.tryParse(instring, loc)
+            except ParseException as err:
+                err.__traceback__ = None
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring, len(instring), e.errmsg, self)
+                    maxExcLoc = len(instring)
+            else:
+                # save match among all matches, to retry longest to shortest
+                matches.append((loc2, e))
+
+        if matches:
+            # re-evaluate all matches in descending order of length of match, in case attached actions
+            # might change whether or how much they match of the input.
+            matches.sort(key=itemgetter(0), reverse=True)
+
+            if not doActions:
+                # no further conditions or parse actions to change the selection of
+                # alternative, so the first match will be the best match
+                best_expr = matches[0][1]
+                return best_expr._parse(instring, loc, doActions)
+
+            longest = -1, None
+            for loc1, expr1 in matches:
+                if loc1 <= longest[0]:
+                    # already have a longer match than this one will deliver, we are done
+                    return longest
+
+                try:
+                    loc2, toks = expr1._parse(instring, loc, doActions)
+                except ParseException as err:
+                    err.__traceback__ = None
+                    if err.loc > maxExcLoc:
+                        maxException = err
+                        maxExcLoc = err.loc
+                else:
+                    if loc2 >= loc1:
+                        return loc2, toks
+                    # didn't match as much as before
+                    elif loc2 > longest[0]:
+                        longest = loc2, toks
+
+            if longest != (-1, None):
+                return longest
+
+        if maxException is not None:
+            maxException.msg = self.errmsg
+            raise maxException
+        else:
+            raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+
+    def __ixor__(self, other):
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        return self.append(other)  # Or([self, other])
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion(self, parseElementList):
+        subRecCheckList = parseElementList[:] + [self]
+        for e in self.exprs:
+            e.checkRecursion(subRecCheckList)
+
+    def _setResultsName(self, name, listAllMatches=False):
+        if (not __compat__.collect_all_And_tokens
+                and __diag__.warn_multiple_tokens_in_named_alternation):
+            if any(isinstance(e, And) for e in self.exprs):
+                warnings.warn("{0}: setting results name {1!r} on {2} expression "
+                              "may only return a single token for an And alternative, "
+                              "in future will return the full list of tokens".format(
+                    "warn_multiple_tokens_in_named_alternation", name, type(self).__name__),
+                    stacklevel=3)
+
+        return super(Or, self)._setResultsName(name, listAllMatches)
+
+
+class MatchFirst(ParseExpression):
+    """Requires that at least one :class:`ParseExpression` is found. If
+    two expressions match, the first one listed is the one that will
+    match. May be constructed using the ``'|'`` operator.
+
+    Example::
+
+        # construct MatchFirst using '|' operator
+
+        # watch the order of expressions to match
+        number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789")) #  Fail! -> [['123'], ['3'], ['1416'], ['789']]
+
+        # put more selective expression first
+        number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
+        print(number.searchString("123 3.1416 789")) #  Better -> [['123'], ['3.1416'], ['789']]
+    """
+    def __init__(self, exprs, savelist=False):
+        super(MatchFirst, self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def streamline(self):
+        super(MatchFirst, self).streamline()
+        if __compat__.collect_all_And_tokens:
+            self.saveAsList = any(e.saveAsList for e in self.exprs)
+        return self
+
+    def parseImpl(self, instring, loc, doActions=True):
+        maxExcLoc = -1
+        maxException = None
+        for e in self.exprs:
+            try:
+                ret = e._parse(instring, loc, doActions)
+                return ret
+            except ParseException as err:
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring, len(instring), e.errmsg, self)
+                    maxExcLoc = len(instring)
+
+        # only got here if no expression matched, raise exception for match that made it the furthest
+        else:
+            if maxException is not None:
+                maxException.msg = self.errmsg
+                raise maxException
+            else:
+                raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+    def __ior__(self, other):
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        return self.append(other)  # MatchFirst([self, other])
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion(self, parseElementList):
+        subRecCheckList = parseElementList[:] + [self]
+        for e in self.exprs:
+            e.checkRecursion(subRecCheckList)
+
+    def _setResultsName(self, name, listAllMatches=False):
+        if (not __compat__.collect_all_And_tokens
+                and __diag__.warn_multiple_tokens_in_named_alternation):
+            if any(isinstance(e, And) for e in self.exprs):
+                warnings.warn("{0}: setting results name {1!r} on {2} expression "
+                              "may only return a single token for an And alternative, "
+                              "in future will return the full list of tokens".format(
+                    "warn_multiple_tokens_in_named_alternation", name, type(self).__name__),
+                    stacklevel=3)
+
+        return super(MatchFirst, self)._setResultsName(name, listAllMatches)
+
+
+class Each(ParseExpression):
+    """Requires all given :class:`ParseExpression` s to be found, but in
+    any order. Expressions may be separated by whitespace.
+
+    May be constructed using the ``'&'`` operator.
+
+    Example::
+
+        color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
+        shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
+        integer = Word(nums)
+        shape_attr = "shape:" + shape_type("shape")
+        posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
+        color_attr = "color:" + color("color")
+        size_attr = "size:" + integer("size")
+
+        # use Each (using operator '&') to accept attributes in any order
+        # (shape and posn are required, color and size are optional)
+        shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
+
+        shape_spec.runTests('''
+            shape: SQUARE color: BLACK posn: 100, 120
+            shape: CIRCLE size: 50 color: BLUE posn: 50,80
+            color:GREEN size:20 shape:TRIANGLE posn:20,40
+            '''
+            )
+
+    prints::
+
+        shape: SQUARE color: BLACK posn: 100, 120
+        ['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
+        - color: BLACK
+        - posn: ['100', ',', '120']
+          - x: 100
+          - y: 120
+        - shape: SQUARE
+
+
+        shape: CIRCLE size: 50 color: BLUE posn: 50,80
+        ['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
+        - color: BLUE
+        - posn: ['50', ',', '80']
+          - x: 50
+          - y: 80
+        - shape: CIRCLE
+        - size: 50
+
+
+        color: GREEN size: 20 shape: TRIANGLE posn: 20,40
+        ['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
+        - color: GREEN
+        - posn: ['20', ',', '40']
+          - x: 20
+          - y: 40
+        - shape: TRIANGLE
+        - size: 20
+    """
+    def __init__(self, exprs, savelist=True):
+        super(Each, self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.skipWhitespace = True
+        self.initExprGroups = True
+        self.saveAsList = True
+
+    def streamline(self):
+        super(Each, self).streamline()
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        return self
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if self.initExprGroups:
+            self.opt1map = dict((id(e.expr), e) for e in self.exprs if isinstance(e, Optional))
+            opt1 = [e.expr for e in self.exprs if isinstance(e, Optional)]
+            opt2 = [e for e in self.exprs if e.mayReturnEmpty and not isinstance(e, (Optional, Regex))]
+            self.optionals = opt1 + opt2
+            self.multioptionals = [e.expr for e in self.exprs if isinstance(e, ZeroOrMore)]
+            self.multirequired = [e.expr for e in self.exprs if isinstance(e, OneOrMore)]
+            self.required = [e for e in self.exprs if not isinstance(e, (Optional, ZeroOrMore, OneOrMore))]
+            self.required += self.multirequired
+            self.initExprGroups = False
+        tmpLoc = loc
+        tmpReqd = self.required[:]
+        tmpOpt  = self.optionals[:]
+        matchOrder = []
+
+        keepMatching = True
+        while keepMatching:
+            tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
+            failed = []
+            for e in tmpExprs:
+                try:
+                    tmpLoc = e.tryParse(instring, tmpLoc)
+                except ParseException:
+                    failed.append(e)
+                else:
+                    matchOrder.append(self.opt1map.get(id(e), e))
+                    if e in tmpReqd:
+                        tmpReqd.remove(e)
+                    elif e in tmpOpt:
+                        tmpOpt.remove(e)
+            if len(failed) == len(tmpExprs):
+                keepMatching = False
+
+        if tmpReqd:
+            missing = ", ".join(_ustr(e) for e in tmpReqd)
+            raise ParseException(instring, loc, "Missing one or more required elements (%s)" % missing)
+
+        # add any unmatched Optionals, in case they have default values defined
+        matchOrder += [e for e in self.exprs if isinstance(e, Optional) and e.expr in tmpOpt]
+
+        resultlist = []
+        for e in matchOrder:
+            loc, results = e._parse(instring, loc, doActions)
+            resultlist.append(results)
+
+        finalResults = sum(resultlist, ParseResults([]))
+        return loc, finalResults
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion(self, parseElementList):
+        subRecCheckList = parseElementList[:] + [self]
+        for e in self.exprs:
+            e.checkRecursion(subRecCheckList)
+
+
+class ParseElementEnhance(ParserElement):
+    """Abstract subclass of :class:`ParserElement`, for combining and
+    post-processing parsed tokens.
+    """
+    def __init__(self, expr, savelist=False):
+        super(ParseElementEnhance, self).__init__(savelist)
+        if isinstance(expr, basestring):
+            if issubclass(self._literalStringClass, Token):
+                expr = self._literalStringClass(expr)
+            else:
+                expr = self._literalStringClass(Literal(expr))
+        self.expr = expr
+        self.strRepr = None
+        if expr is not None:
+            self.mayIndexError = expr.mayIndexError
+            self.mayReturnEmpty = expr.mayReturnEmpty
+            self.setWhitespaceChars(expr.whiteChars)
+            self.skipWhitespace = expr.skipWhitespace
+            self.saveAsList = expr.saveAsList
+            self.callPreparse = expr.callPreparse
+            self.ignoreExprs.extend(expr.ignoreExprs)
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if self.expr is not None:
+            return self.expr._parse(instring, loc, doActions, callPreParse=False)
+        else:
+            raise ParseException("", loc, self.errmsg, self)
+
+    def leaveWhitespace(self):
+        self.skipWhitespace = False
+        self.expr = self.expr.copy()
+        if self.expr is not None:
+            self.expr.leaveWhitespace()
+        return self
+
+    def ignore(self, other):
+        if isinstance(other, Suppress):
+            if other not in self.ignoreExprs:
+                super(ParseElementEnhance, self).ignore(other)
+                if self.expr is not None:
+                    self.expr.ignore(self.ignoreExprs[-1])
+        else:
+            super(ParseElementEnhance, self).ignore(other)
+            if self.expr is not None:
+                self.expr.ignore(self.ignoreExprs[-1])
+        return self
+
+    def streamline(self):
+        super(ParseElementEnhance, self).streamline()
+        if self.expr is not None:
+            self.expr.streamline()
+        return self
+
+    def checkRecursion(self, parseElementList):
+        if self in parseElementList:
+            raise RecursiveGrammarException(parseElementList + [self])
+        subRecCheckList = parseElementList[:] + [self]
+        if self.expr is not None:
+            self.expr.checkRecursion(subRecCheckList)
+
+    def validate(self, validateTrace=None):
+        if validateTrace is None:
+            validateTrace = []
+        tmp = validateTrace[:] + [self]
+        if self.expr is not None:
+            self.expr.validate(tmp)
+        self.checkRecursion([])
+
+    def __str__(self):
+        try:
+            return super(ParseElementEnhance, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None and self.expr is not None:
+            self.strRepr = "%s:(%s)" % (self.__class__.__name__, _ustr(self.expr))
+        return self.strRepr
+
+
+class FollowedBy(ParseElementEnhance):
+    """Lookahead matching of the given parse expression.
+    ``FollowedBy`` does *not* advance the parsing position within
+    the input string, it only verifies that the specified parse
+    expression matches at the current position.  ``FollowedBy``
+    always returns a null token list. If any results names are defined
+    in the lookahead expression, those *will* be returned for access by
+    name.
+
+    Example::
+
+        # use FollowedBy to match a label only if it is followed by a ':'
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+
+        OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
+
+    prints::
+
+        [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
+    """
+    def __init__(self, expr):
+        super(FollowedBy, self).__init__(expr)
+        self.mayReturnEmpty = True
+
+    def parseImpl(self, instring, loc, doActions=True):
+        # by using self._expr.parse and deleting the contents of the returned ParseResults list
+        # we keep any named results that were defined in the FollowedBy expression
+        _, ret = self.expr._parse(instring, loc, doActions=doActions)
+        del ret[:]
+
+        return loc, ret
+
+
+class PrecededBy(ParseElementEnhance):
+    """Lookbehind matching of the given parse expression.
+    ``PrecededBy`` does not advance the parsing position within the
+    input string, it only verifies that the specified parse expression
+    matches prior to the current position.  ``PrecededBy`` always
+    returns a null token list, but if a results name is defined on the
+    given expression, it is returned.
+
+    Parameters:
+
+     - expr - expression that must match prior to the current parse
+       location
+     - retreat - (default= ``None``) - (int) maximum number of characters
+       to lookbehind prior to the current parse location
+
+    If the lookbehind expression is a string, Literal, Keyword, or
+    a Word or CharsNotIn with a specified exact or maximum length, then
+    the retreat parameter is not required. Otherwise, retreat must be
+    specified to give a maximum number of characters to look back from
+    the current parse position for a lookbehind match.
+
+    Example::
+
+        # VB-style variable names with type prefixes
+        int_var = PrecededBy("#") + pyparsing_common.identifier
+        str_var = PrecededBy("$") + pyparsing_common.identifier
+
+    """
+    def __init__(self, expr, retreat=None):
+        super(PrecededBy, self).__init__(expr)
+        self.expr = self.expr().leaveWhitespace()
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.exact = False
+        if isinstance(expr, str):
+            retreat = len(expr)
+            self.exact = True
+        elif isinstance(expr, (Literal, Keyword)):
+            retreat = expr.matchLen
+            self.exact = True
+        elif isinstance(expr, (Word, CharsNotIn)) and expr.maxLen != _MAX_INT:
+            retreat = expr.maxLen
+            self.exact = True
+        elif isinstance(expr, _PositionToken):
+            retreat = 0
+            self.exact = True
+        self.retreat = retreat
+        self.errmsg = "not preceded by " + str(expr)
+        self.skipWhitespace = False
+        self.parseAction.append(lambda s, l, t: t.__delitem__(slice(None, None)))
+
+    def parseImpl(self, instring, loc=0, doActions=True):
+        if self.exact:
+            if loc < self.retreat:
+                raise ParseException(instring, loc, self.errmsg)
+            start = loc - self.retreat
+            _, ret = self.expr._parse(instring, start)
+        else:
+            # retreat specified a maximum lookbehind window, iterate
+            test_expr = self.expr + StringEnd()
+            instring_slice = instring[max(0, loc - self.retreat):loc]
+            last_expr = ParseException(instring, loc, self.errmsg)
+            for offset in range(1, min(loc, self.retreat + 1)+1):
+                try:
+                    # print('trying', offset, instring_slice, repr(instring_slice[loc - offset:]))
+                    _, ret = test_expr._parse(instring_slice, len(instring_slice) - offset)
+                except ParseBaseException as pbe:
+                    last_expr = pbe
+                else:
+                    break
+            else:
+                raise last_expr
+        return loc, ret
+
+
+class NotAny(ParseElementEnhance):
+    """Lookahead to disallow matching with the given parse expression.
+    ``NotAny`` does *not* advance the parsing position within the
+    input string, it only verifies that the specified parse expression
+    does *not* match at the current position.  Also, ``NotAny`` does
+    *not* skip over leading whitespace. ``NotAny`` always returns
+    a null token list.  May be constructed using the '~' operator.
+
+    Example::
+
+        AND, OR, NOT = map(CaselessKeyword, "AND OR NOT".split())
+
+        # take care not to mistake keywords for identifiers
+        ident = ~(AND | OR | NOT) + Word(alphas)
+        boolean_term = Optional(NOT) + ident
+
+        # very crude boolean expression - to support parenthesis groups and
+        # operation hierarchy, use infixNotation
+        boolean_expr = boolean_term + ZeroOrMore((AND | OR) + boolean_term)
+
+        # integers that are followed by "." are actually floats
+        integer = Word(nums) + ~Char(".")
+    """
+    def __init__(self, expr):
+        super(NotAny, self).__init__(expr)
+        # ~ self.leaveWhitespace()
+        self.skipWhitespace = False  # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
+        self.mayReturnEmpty = True
+        self.errmsg = "Found unwanted token, " + _ustr(self.expr)
+
+    def parseImpl(self, instring, loc, doActions=True):
+        if self.expr.canParseNext(instring, loc):
+            raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "~{" + _ustr(self.expr) + "}"
+
+        return self.strRepr
+
+class _MultipleMatch(ParseElementEnhance):
+    def __init__(self, expr, stopOn=None):
+        super(_MultipleMatch, self).__init__(expr)
+        self.saveAsList = True
+        ender = stopOn
+        if isinstance(ender, basestring):
+            ender = self._literalStringClass(ender)
+        self.stopOn(ender)
+
+    def stopOn(self, ender):
+        if isinstance(ender, basestring):
+            ender = self._literalStringClass(ender)
+        self.not_ender = ~ender if ender is not None else None
+        return self
+
+    def parseImpl(self, instring, loc, doActions=True):
+        self_expr_parse = self.expr._parse
+        self_skip_ignorables = self._skipIgnorables
+        check_ender = self.not_ender is not None
+        if check_ender:
+            try_not_ender = self.not_ender.tryParse
+
+        # must be at least one (but first see if we are the stopOn sentinel;
+        # if so, fail)
+        if check_ender:
+            try_not_ender(instring, loc)
+        loc, tokens = self_expr_parse(instring, loc, doActions, callPreParse=False)
+        try:
+            hasIgnoreExprs = (not not self.ignoreExprs)
+            while 1:
+                if check_ender:
+                    try_not_ender(instring, loc)
+                if hasIgnoreExprs:
+                    preloc = self_skip_ignorables(instring, loc)
+                else:
+                    preloc = loc
+                loc, tmptokens = self_expr_parse(instring, preloc, doActions)
+                if tmptokens or tmptokens.haskeys():
+                    tokens += tmptokens
+        except (ParseException, IndexError):
+            pass
+
+        return loc, tokens
+
+    def _setResultsName(self, name, listAllMatches=False):
+        if __diag__.warn_ungrouped_named_tokens_in_collection:
+            for e in [self.expr] + getattr(self.expr, 'exprs', []):
+                if isinstance(e, ParserElement) and e.resultsName:
+                    warnings.warn("{0}: setting results name {1!r} on {2} expression "
+                                  "collides with {3!r} on contained expression".format("warn_ungrouped_named_tokens_in_collection",
+                                                                                       name,
+                                                                                       type(self).__name__,
+                                                                                       e.resultsName),
+                                  stacklevel=3)
+
+        return super(_MultipleMatch, self)._setResultsName(name, listAllMatches)
+
+
+class OneOrMore(_MultipleMatch):
+    """Repetition of one or more of the given expression.
+
+    Parameters:
+     - expr - expression that must match one or more times
+     - stopOn - (default= ``None``) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition
+          expression)
+
+    Example::
+
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: BLACK"
+        OneOrMore(attr_expr).parseString(text).pprint()  # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
+
+        # use stopOn attribute for OneOrMore to avoid reading label string as part of the data
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
+
+        # could also be written as
+        (attr_expr * (1,)).parseString(text).pprint()
+    """
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + _ustr(self.expr) + "}..."
+
+        return self.strRepr
+
+class ZeroOrMore(_MultipleMatch):
+    """Optional repetition of zero or more of the given expression.
+
+    Parameters:
+     - expr - expression that must match zero or more times
+     - stopOn - (default= ``None``) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition
+          expression)
+
+    Example: similar to :class:`OneOrMore`
+    """
+    def __init__(self, expr, stopOn=None):
+        super(ZeroOrMore, self).__init__(expr, stopOn=stopOn)
+        self.mayReturnEmpty = True
+
+    def parseImpl(self, instring, loc, doActions=True):
+        try:
+            return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
+        except (ParseException, IndexError):
+            return loc, []
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]..."
+
+        return self.strRepr
+
+
+class _NullToken(object):
+    def __bool__(self):
+        return False
+    __nonzero__ = __bool__
+    def __str__(self):
+        return ""
+
+class Optional(ParseElementEnhance):
+    """Optional matching of the given expression.
+
+    Parameters:
+     - expr - expression that must match zero or more times
+     - default (optional) - value to be returned if the optional expression is not found.
+
+    Example::
+
+        # US postal code can be a 5-digit zip, plus optional 4-digit qualifier
+        zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
+        zip.runTests('''
+            # traditional ZIP code
+            12345
+
+            # ZIP+4 form
+            12101-0001
+
+            # invalid ZIP
+            98765-
+            ''')
+
+    prints::
+
+        # traditional ZIP code
+        12345
+        ['12345']
+
+        # ZIP+4 form
+        12101-0001
+        ['12101-0001']
+
+        # invalid ZIP
+        98765-
+             ^
+        FAIL: Expected end of text (at char 5), (line:1, col:6)
+    """
+    __optionalNotMatched = _NullToken()
+
+    def __init__(self, expr, default=__optionalNotMatched):
+        super(Optional, self).__init__(expr, savelist=False)
+        self.saveAsList = self.expr.saveAsList
+        self.defaultValue = default
+        self.mayReturnEmpty = True
+
+    def parseImpl(self, instring, loc, doActions=True):
+        try:
+            loc, tokens = self.expr._parse(instring, loc, doActions, callPreParse=False)
+        except (ParseException, IndexError):
+            if self.defaultValue is not self.__optionalNotMatched:
+                if self.expr.resultsName:
+                    tokens = ParseResults([self.defaultValue])
+                    tokens[self.expr.resultsName] = self.defaultValue
+                else:
+                    tokens = [self.defaultValue]
+            else:
+                tokens = []
+        return loc, tokens
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]"
+
+        return self.strRepr
+
+class SkipTo(ParseElementEnhance):
+    """Token for skipping over all undefined text until the matched
+    expression is found.
+
+    Parameters:
+     - expr - target expression marking the end of the data to be skipped
+     - include - (default= ``False``) if True, the target expression is also parsed
+          (the skipped text and target expression are returned as a 2-element list).
+     - ignore - (default= ``None``) used to define grammars (typically quoted strings and
+          comments) that might contain false matches to the target expression
+     - failOn - (default= ``None``) define expressions that are not allowed to be
+          included in the skipped test; if found before the target expression is found,
+          the SkipTo is not a match
+
+    Example::
+
+        report = '''
+            Outstanding Issues Report - 1 Jan 2000
+
+               # | Severity | Description                               |  Days Open
+            -----+----------+-------------------------------------------+-----------
+             101 | Critical | Intermittent system crash                 |          6
+              94 | Cosmetic | Spelling error on Login ('log|n')         |         14
+              79 | Minor    | System slow when running too many reports |         47
+            '''
+        integer = Word(nums)
+        SEP = Suppress('|')
+        # use SkipTo to simply match everything up until the next SEP
+        # - ignore quoted strings, so that a '|' character inside a quoted string does not match
+        # - parse action will call token.strip() for each matched token, i.e., the description body
+        string_data = SkipTo(SEP, ignore=quotedString)
+        string_data.setParseAction(tokenMap(str.strip))
+        ticket_expr = (integer("issue_num") + SEP
+                      + string_data("sev") + SEP
+                      + string_data("desc") + SEP
+                      + integer("days_open"))
+
+        for tkt in ticket_expr.searchString(report):
+            print tkt.dump()
+
+    prints::
+
+        ['101', 'Critical', 'Intermittent system crash', '6']
+        - days_open: 6
+        - desc: Intermittent system crash
+        - issue_num: 101
+        - sev: Critical
+        ['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
+        - days_open: 14
+        - desc: Spelling error on Login ('log|n')
+        - issue_num: 94
+        - sev: Cosmetic
+        ['79', 'Minor', 'System slow when running too many reports', '47']
+        - days_open: 47
+        - desc: System slow when running too many reports
+        - issue_num: 79
+        - sev: Minor
+    """
+    def __init__(self, other, include=False, ignore=None, failOn=None):
+        super(SkipTo, self).__init__(other)
+        self.ignoreExpr = ignore
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.includeMatch = include
+        self.saveAsList = False
+        if isinstance(failOn, basestring):
+            self.failOn = self._literalStringClass(failOn)
+        else:
+            self.failOn = failOn
+        self.errmsg = "No match found for " + _ustr(self.expr)
+
+    def parseImpl(self, instring, loc, doActions=True):
+        startloc = loc
+        instrlen = len(instring)
+        expr = self.expr
+        expr_parse = self.expr._parse
+        self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
+        self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
+
+        tmploc = loc
+        while tmploc <= instrlen:
+            if self_failOn_canParseNext is not None:
+                # break if failOn expression matches
+                if self_failOn_canParseNext(instring, tmploc):
+                    break
+
+            if self_ignoreExpr_tryParse is not None:
+                # advance past ignore expressions
+                while 1:
+                    try:
+                        tmploc = self_ignoreExpr_tryParse(instring, tmploc)
+                    except ParseBaseException:
+                        break
+
+            try:
+                expr_parse(instring, tmploc, doActions=False, callPreParse=False)
+            except (ParseException, IndexError):
+                # no match, advance loc in string
+                tmploc += 1
+            else:
+                # matched skipto expr, done
+                break
+
+        else:
+            # ran off the end of the input string without matching skipto expr, fail
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        # build up return values
+        loc = tmploc
+        skiptext = instring[startloc:loc]
+        skipresult = ParseResults(skiptext)
+
+        if self.includeMatch:
+            loc, mat = expr_parse(instring, loc, doActions, callPreParse=False)
+            skipresult += mat
+
+        return loc, skipresult
+
+class Forward(ParseElementEnhance):
+    """Forward declaration of an expression to be defined later -
+    used for recursive grammars, such as algebraic infix notation.
+    When the expression is known, it is assigned to the ``Forward``
+    variable using the '<<' operator.
+
+    Note: take care when assigning to ``Forward`` not to overlook
+    precedence of operators.
+
+    Specifically, '|' has a lower precedence than '<<', so that::
+
+        fwdExpr << a | b | c
+
+    will actually be evaluated as::
+
+        (fwdExpr << a) | b | c
+
+    thereby leaving b and c out as parseable alternatives.  It is recommended that you
+    explicitly group the values inserted into the ``Forward``::
+
+        fwdExpr << (a | b | c)
+
+    Converting to use the '<<=' operator instead will avoid this problem.
+
+    See :class:`ParseResults.pprint` for an example of a recursive
+    parser created using ``Forward``.
+    """
+    def __init__(self, other=None):
+        super(Forward, self).__init__(other, savelist=False)
+
+    def __lshift__(self, other):
+        if isinstance(other, basestring):
+            other = self._literalStringClass(other)
+        self.expr = other
+        self.strRepr = None
+        self.mayIndexError = self.expr.mayIndexError
+        self.mayReturnEmpty = self.expr.mayReturnEmpty
+        self.setWhitespaceChars(self.expr.whiteChars)
+        self.skipWhitespace = self.expr.skipWhitespace
+        self.saveAsList = self.expr.saveAsList
+        self.ignoreExprs.extend(self.expr.ignoreExprs)
+        return self
+
+    def __ilshift__(self, other):
+        return self << other
+
+    def leaveWhitespace(self):
+        self.skipWhitespace = False
+        return self
+
+    def streamline(self):
+        if not self.streamlined:
+            self.streamlined = True
+            if self.expr is not None:
+                self.expr.streamline()
+        return self
+
+    def validate(self, validateTrace=None):
+        if validateTrace is None:
+            validateTrace = []
+
+        if self not in validateTrace:
+            tmp = validateTrace[:] + [self]
+            if self.expr is not None:
+                self.expr.validate(tmp)
+        self.checkRecursion([])
+
+    def __str__(self):
+        if hasattr(self, "name"):
+            return self.name
+        if self.strRepr is not None:
+            return self.strRepr
+
+        # Avoid infinite recursion by setting a temporary strRepr
+        self.strRepr = ": ..."
+
+        # Use the string representation of main expression.
+        retString = '...'
+        try:
+            if self.expr is not None:
+                retString = _ustr(self.expr)[:1000]
+            else:
+                retString = "None"
+        finally:
+            self.strRepr = self.__class__.__name__ + ": " + retString
+        return self.strRepr
+
+    def copy(self):
+        if self.expr is not None:
+            return super(Forward, self).copy()
+        else:
+            ret = Forward()
+            ret <<= self
+            return ret
+
+    def _setResultsName(self, name, listAllMatches=False):
+        if __diag__.warn_name_set_on_empty_Forward:
+            if self.expr is None:
+                warnings.warn("{0}: setting results name {0!r} on {1} expression "
+                              "that has no contained expression".format("warn_name_set_on_empty_Forward",
+                                                                        name,
+                                                                        type(self).__name__),
+                              stacklevel=3)
+
+        return super(Forward, self)._setResultsName(name, listAllMatches)
+
+class TokenConverter(ParseElementEnhance):
+    """
+    Abstract subclass of :class:`ParseExpression`, for converting parsed results.
+    """
+    def __init__(self, expr, savelist=False):
+        super(TokenConverter, self).__init__(expr)  # , savelist)
+        self.saveAsList = False
+
+class Combine(TokenConverter):
+    """Converter to concatenate all matching tokens to a single string.
+    By default, the matching patterns must also be contiguous in the
+    input string; this can be disabled by specifying
+    ``'adjacent=False'`` in the constructor.
+
+    Example::
+
+        real = Word(nums) + '.' + Word(nums)
+        print(real.parseString('3.1416')) # -> ['3', '.', '1416']
+        # will also erroneously match the following
+        print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
+
+        real = Combine(Word(nums) + '.' + Word(nums))
+        print(real.parseString('3.1416')) # -> ['3.1416']
+        # no match when there are internal spaces
+        print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
+    """
+    def __init__(self, expr, joinString="", adjacent=True):
+        super(Combine, self).__init__(expr)
+        # suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
+        if adjacent:
+            self.leaveWhitespace()
+        self.adjacent = adjacent
+        self.skipWhitespace = True
+        self.joinString = joinString
+        self.callPreparse = True
+
+    def ignore(self, other):
+        if self.adjacent:
+            ParserElement.ignore(self, other)
+        else:
+            super(Combine, self).ignore(other)
+        return self
+
+    def postParse(self, instring, loc, tokenlist):
+        retToks = tokenlist.copy()
+        del retToks[:]
+        retToks += ParseResults(["".join(tokenlist._asStringList(self.joinString))], modal=self.modalResults)
+
+        if self.resultsName and retToks.haskeys():
+            return [retToks]
+        else:
+            return retToks
+
+class Group(TokenConverter):
+    """Converter to return the matched tokens as a list - useful for
+    returning tokens of :class:`ZeroOrMore` and :class:`OneOrMore` expressions.
+
+    Example::
+
+        ident = Word(alphas)
+        num = Word(nums)
+        term = ident | num
+        func = ident + Optional(delimitedList(term))
+        print(func.parseString("fn a, b, 100"))  # -> ['fn', 'a', 'b', '100']
+
+        func = ident + Group(Optional(delimitedList(term)))
+        print(func.parseString("fn a, b, 100"))  # -> ['fn', ['a', 'b', '100']]
+    """
+    def __init__(self, expr):
+        super(Group, self).__init__(expr)
+        self.saveAsList = True
+
+    def postParse(self, instring, loc, tokenlist):
+        return [tokenlist]
+
+class Dict(TokenConverter):
+    """Converter to return a repetitive expression as a list, but also
+    as a dictionary. Each element can also be referenced using the first
+    token in the expression as its key. Useful for tabular report
+    scraping when the first column can be used as a item key.
+
+    Example::
+
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+
+        # print attributes as plain groups
+        print(OneOrMore(attr_expr).parseString(text).dump())
+
+        # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
+        result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
+        print(result.dump())
+
+        # access named fields as dict entries, or output as dict
+        print(result['shape'])
+        print(result.asDict())
+
+    prints::
+
+        ['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        {'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
+
+    See more examples at :class:`ParseResults` of accessing fields by results name.
+    """
+    def __init__(self, expr):
+        super(Dict, self).__init__(expr)
+        self.saveAsList = True
+
+    def postParse(self, instring, loc, tokenlist):
+        for i, tok in enumerate(tokenlist):
+            if len(tok) == 0:
+                continue
+            ikey = tok[0]
+            if isinstance(ikey, int):
+                ikey = _ustr(tok[0]).strip()
+            if len(tok) == 1:
+                tokenlist[ikey] = _ParseResultsWithOffset("", i)
+            elif len(tok) == 2 and not isinstance(tok[1], ParseResults):
+                tokenlist[ikey] = _ParseResultsWithOffset(tok[1], i)
+            else:
+                dictvalue = tok.copy()  # ParseResults(i)
+                del dictvalue[0]
+                if len(dictvalue) != 1 or (isinstance(dictvalue, ParseResults) and dictvalue.haskeys()):
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue, i)
+                else:
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0], i)
+
+        if self.resultsName:
+            return [tokenlist]
+        else:
+            return tokenlist
+
+
+class Suppress(TokenConverter):
+    """Converter for ignoring the results of a parsed expression.
+
+    Example::
+
+        source = "a, b, c,d"
+        wd = Word(alphas)
+        wd_list1 = wd + ZeroOrMore(',' + wd)
+        print(wd_list1.parseString(source))
+
+        # often, delimiters that are useful during parsing are just in the
+        # way afterward - use Suppress to keep them out of the parsed output
+        wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
+        print(wd_list2.parseString(source))
+
+    prints::
+
+        ['a', ',', 'b', ',', 'c', ',', 'd']
+        ['a', 'b', 'c', 'd']
+
+    (See also :class:`delimitedList`.)
+    """
+    def postParse(self, instring, loc, tokenlist):
+        return []
+
+    def suppress(self):
+        return self
+
+
+class OnlyOnce(object):
+    """Wrapper for parse actions, to ensure they are only called once.
+    """
+    def __init__(self, methodCall):
+        self.callable = _trim_arity(methodCall)
+        self.called = False
+    def __call__(self, s, l, t):
+        if not self.called:
+            results = self.callable(s, l, t)
+            self.called = True
+            return results
+        raise ParseException(s, l, "")
+    def reset(self):
+        self.called = False
+
+def traceParseAction(f):
+    """Decorator for debugging parse actions.
+
+    When the parse action is called, this decorator will print
+    ``">> entering method-name(line:<current_source_line>, <parse_location>, <matched_tokens>)"``.
+    When the parse action completes, the decorator will print
+    ``"<<"`` followed by the returned value, or any exception that the parse action raised.
+
+    Example::
+
+        wd = Word(alphas)
+
+        @traceParseAction
+        def remove_duplicate_chars(tokens):
+            return ''.join(sorted(set(''.join(tokens))))
+
+        wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
+        print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
+
+    prints::
+
+        >>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
+        <<leaving remove_duplicate_chars (ret: 'dfjkls')
+        ['dfjkls']
+    """
+    f = _trim_arity(f)
+    def z(*paArgs):
+        thisFunc = f.__name__
+        s, l, t = paArgs[-3:]
+        if len(paArgs) > 3:
+            thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
+        sys.stderr.write(">>entering %s(line: '%s', %d, %r)\n" % (thisFunc, line(l, s), l, t))
+        try:
+            ret = f(*paArgs)
+        except Exception as exc:
+            sys.stderr.write("<<leaving %s (exception: %s)\n" % (thisFunc, exc))
+            raise
+        sys.stderr.write("<<leaving %s (ret: %r)\n" % (thisFunc, ret))
+        return ret
+    try:
+        z.__name__ = f.__name__
+    except AttributeError:
+        pass
+    return z
+
+#
+# global helpers
+#
+def delimitedList(expr, delim=",", combine=False):
+    """Helper to define a delimited list of expressions - the delimiter
+    defaults to ','. By default, the list elements and delimiters can
+    have intervening whitespace, and comments, but this can be
+    overridden by passing ``combine=True`` in the constructor. If
+    ``combine`` is set to ``True``, the matching tokens are
+    returned as a single token string, with the delimiters included;
+    otherwise, the matching tokens are returned as a list of tokens,
+    with the delimiters suppressed.
+
+    Example::
+
+        delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
+        delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
+    """
+    dlName = _ustr(expr) + " [" + _ustr(delim) + " " + _ustr(expr) + "]..."
+    if combine:
+        return Combine(expr + ZeroOrMore(delim + expr)).setName(dlName)
+    else:
+        return (expr + ZeroOrMore(Suppress(delim) + expr)).setName(dlName)
+
+def countedArray(expr, intExpr=None):
+    """Helper to define a counted list of expressions.
+
+    This helper defines a pattern of the form::
+
+        integer expr expr expr...
+
+    where the leading integer tells how many expr expressions follow.
+    The matched tokens returns the array of expr tokens as a list - the
+    leading count token is suppressed.
+
+    If ``intExpr`` is specified, it should be a pyparsing expression
+    that produces an integer value.
+
+    Example::
+
+        countedArray(Word(alphas)).parseString('2 ab cd ef')  # -> ['ab', 'cd']
+
+        # in this parser, the leading integer value is given in binary,
+        # '10' indicating that 2 values are in the array
+        binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
+        countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef')  # -> ['ab', 'cd']
+    """
+    arrayExpr = Forward()
+    def countFieldParseAction(s, l, t):
+        n = t[0]
+        arrayExpr << (n and Group(And([expr] * n)) or Group(empty))
+        return []
+    if intExpr is None:
+        intExpr = Word(nums).setParseAction(lambda t: int(t[0]))
+    else:
+        intExpr = intExpr.copy()
+    intExpr.setName("arrayLen")
+    intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
+    return (intExpr + arrayExpr).setName('(len) ' + _ustr(expr) + '...')
+
+def _flatten(L):
+    ret = []
+    for i in L:
+        if isinstance(i, list):
+            ret.extend(_flatten(i))
+        else:
+            ret.append(i)
+    return ret
+
+def matchPreviousLiteral(expr):
+    """Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks for
+    a 'repeat' of a previous expression.  For example::
+
+        first = Word(nums)
+        second = matchPreviousLiteral(first)
+        matchExpr = first + ":" + second
+
+    will match ``"1:1"``, but not ``"1:2"``.  Because this
+    matches a previous literal, will also match the leading
+    ``"1:1"`` in ``"1:10"``. If this is not desired, use
+    :class:`matchPreviousExpr`. Do *not* use with packrat parsing
+    enabled.
+    """
+    rep = Forward()
+    def copyTokenToRepeater(s, l, t):
+        if t:
+            if len(t) == 1:
+                rep << t[0]
+            else:
+                # flatten t tokens
+                tflat = _flatten(t.asList())
+                rep << And(Literal(tt) for tt in tflat)
+        else:
+            rep << Empty()
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def matchPreviousExpr(expr):
+    """Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks for
+    a 'repeat' of a previous expression.  For example::
+
+        first = Word(nums)
+        second = matchPreviousExpr(first)
+        matchExpr = first + ":" + second
+
+    will match ``"1:1"``, but not ``"1:2"``.  Because this
+    matches by expressions, will *not* match the leading ``"1:1"``
+    in ``"1:10"``; the expressions are evaluated first, and then
+    compared, so ``"1"`` is compared with ``"10"``. Do *not* use
+    with packrat parsing enabled.
+    """
+    rep = Forward()
+    e2 = expr.copy()
+    rep <<= e2
+    def copyTokenToRepeater(s, l, t):
+        matchTokens = _flatten(t.asList())
+        def mustMatchTheseTokens(s, l, t):
+            theseTokens = _flatten(t.asList())
+            if theseTokens != matchTokens:
+                raise ParseException('', 0, '')
+        rep.setParseAction(mustMatchTheseTokens, callDuringTry=True)
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def _escapeRegexRangeChars(s):
+    # ~  escape these chars: ^-[]
+    for c in r"\^-[]":
+        s = s.replace(c, _bslash + c)
+    s = s.replace("\n", r"\n")
+    s = s.replace("\t", r"\t")
+    return _ustr(s)
+
+def oneOf(strs, caseless=False, useRegex=True, asKeyword=False):
+    """Helper to quickly define a set of alternative Literals, and makes
+    sure to do longest-first testing when there is a conflict,
+    regardless of the input order, but returns
+    a :class:`MatchFirst` for best performance.
+
+    Parameters:
+
+     - strs - a string of space-delimited literals, or a collection of
+       string literals
+     - caseless - (default= ``False``) - treat all literals as
+       caseless
+     - useRegex - (default= ``True``) - as an optimization, will
+       generate a Regex object; otherwise, will generate
+       a :class:`MatchFirst` object (if ``caseless=True`` or ``asKeyword=True``, or if
+       creating a :class:`Regex` raises an exception)
+     - asKeyword - (default=``False``) - enforce Keyword-style matching on the
+       generated expressions
+
+    Example::
+
+        comp_oper = oneOf("< = > <= >= !=")
+        var = Word(alphas)
+        number = Word(nums)
+        term = var | number
+        comparison_expr = term + comp_oper + term
+        print(comparison_expr.searchString("B = 12  AA=23 B<=AA AA>12"))
+
+    prints::
+
+        [['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
+    """
+    if isinstance(caseless, basestring):
+        warnings.warn("More than one string argument passed to oneOf, pass "
+                      "choices as a list or space-delimited string", stacklevel=2)
+
+    if caseless:
+        isequal = (lambda a, b: a.upper() == b.upper())
+        masks = (lambda a, b: b.upper().startswith(a.upper()))
+        parseElementClass = CaselessKeyword if asKeyword else CaselessLiteral
+    else:
+        isequal = (lambda a, b: a == b)
+        masks = (lambda a, b: b.startswith(a))
+        parseElementClass = Keyword if asKeyword else Literal
+
+    symbols = []
+    if isinstance(strs, basestring):
+        symbols = strs.split()
+    elif isinstance(strs, Iterable):
+        symbols = list(strs)
+    else:
+        warnings.warn("Invalid argument to oneOf, expected string or iterable",
+                      SyntaxWarning, stacklevel=2)
+    if not symbols:
+        return NoMatch()
+
+    if not asKeyword:
+        # if not producing keywords, need to reorder to take care to avoid masking
+        # longer choices with shorter ones
+        i = 0
+        while i < len(symbols) - 1:
+            cur = symbols[i]
+            for j, other in enumerate(symbols[i + 1:]):
+                if isequal(other, cur):
+                    del symbols[i + j + 1]
+                    break
+                elif masks(cur, other):
+                    del symbols[i + j + 1]
+                    symbols.insert(i, other)
+                    break
+            else:
+                i += 1
+
+    if not (caseless or asKeyword) and useRegex:
+        # ~ print (strs, "->", "|".join([_escapeRegexChars(sym) for sym in symbols]))
+        try:
+            if len(symbols) == len("".join(symbols)):
+                return Regex("[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols)).setName(' | '.join(symbols))
+            else:
+                return Regex("|".join(re.escape(sym) for sym in symbols)).setName(' | '.join(symbols))
+        except Exception:
+            warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
+                    SyntaxWarning, stacklevel=2)
+
+    # last resort, just use MatchFirst
+    return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
+
+def dictOf(key, value):
+    """Helper to easily and clearly define a dictionary by specifying
+    the respective patterns for the key and value.  Takes care of
+    defining the :class:`Dict`, :class:`ZeroOrMore`, and
+    :class:`Group` tokens in the proper order.  The key pattern
+    can include delimiting markers or punctuation, as long as they are
+    suppressed, thereby leaving the significant key text.  The value
+    pattern can include named results, so that the :class:`Dict` results
+    can include named token fields.
+
+    Example::
+
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        print(OneOrMore(attr_expr).parseString(text).dump())
+
+        attr_label = label
+        attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
+
+        # similar to Dict, but simpler call format
+        result = dictOf(attr_label, attr_value).parseString(text)
+        print(result.dump())
+        print(result['shape'])
+        print(result.shape)  # object attribute access works too
+        print(result.asDict())
+
+    prints::
+
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        SQUARE
+        {'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
+    """
+    return Dict(OneOrMore(Group(key + value)))
+
+def originalTextFor(expr, asString=True):
+    """Helper to return the original, untokenized text for a given
+    expression.  Useful to restore the parsed fields of an HTML start
+    tag into the raw tag text itself, or to revert separate tokens with
+    intervening whitespace back to the original matching input text. By
+    default, returns astring containing the original parsed text.
+
+    If the optional ``asString`` argument is passed as
+    ``False``, then the return value is
+    a :class:`ParseResults` containing any results names that
+    were originally matched, and a single token containing the original
+    matched text from the input string.  So if the expression passed to
+    :class:`originalTextFor` contains expressions with defined
+    results names, you must set ``asString`` to ``False`` if you
+    want to preserve those results name values.
+
+    Example::
+
+        src = "this is test <b> bold <i>text</i> </b> normal text "
+        for tag in ("b", "i"):
+            opener, closer = makeHTMLTags(tag)
+            patt = originalTextFor(opener + SkipTo(closer) + closer)
+            print(patt.searchString(src)[0])
+
+    prints::
+
+        ['<b> bold <i>text</i> </b>']
+        ['<i>text</i>']
+    """
+    locMarker = Empty().setParseAction(lambda s, loc, t: loc)
+    endlocMarker = locMarker.copy()
+    endlocMarker.callPreparse = False
+    matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
+    if asString:
+        extractText = lambda s, l, t: s[t._original_start: t._original_end]
+    else:
+        def extractText(s, l, t):
+            t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
+    matchExpr.setParseAction(extractText)
+    matchExpr.ignoreExprs = expr.ignoreExprs
+    return matchExpr
+
+def ungroup(expr):
+    """Helper to undo pyparsing's default grouping of And expressions,
+    even if all but one are non-empty.
+    """
+    return TokenConverter(expr).addParseAction(lambda t: t[0])
+
+def locatedExpr(expr):
+    """Helper to decorate a returned token with its starting and ending
+    locations in the input string.
+
+    This helper adds the following results names:
+
+     - locn_start = location where matched expression begins
+     - locn_end = location where matched expression ends
+     - value = the actual parsed results
+
+    Be careful if the input text contains ``<TAB>`` characters, you
+    may want to call :class:`ParserElement.parseWithTabs`
+
+    Example::
+
+        wd = Word(alphas)
+        for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
+            print(match)
+
+    prints::
+
+        [[0, 'ljsdf', 5]]
+        [[8, 'lksdjjf', 15]]
+        [[18, 'lkkjj', 23]]
+    """
+    locator = Empty().setParseAction(lambda s, l, t: l)
+    return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
+
+
+# convenience constants for positional expressions
+empty       = Empty().setName("empty")
+lineStart   = LineStart().setName("lineStart")
+lineEnd     = LineEnd().setName("lineEnd")
+stringStart = StringStart().setName("stringStart")
+stringEnd   = StringEnd().setName("stringEnd")
+
+_escapedPunc = Word(_bslash, r"\[]-*.$+^?()~ ", exact=2).setParseAction(lambda s, l, t: t[0][1])
+_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s, l, t: unichr(int(t[0].lstrip(r'\0x'), 16)))
+_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s, l, t: unichr(int(t[0][1:], 8)))
+_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | CharsNotIn(r'\]', exact=1)
+_charRange = Group(_singleChar + Suppress("-") + _singleChar)
+_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group(OneOrMore(_charRange | _singleChar)).setResultsName("body") + "]"
+
+def srange(s):
+    r"""Helper to easily define string ranges for use in Word
+    construction. Borrows syntax from regexp '[]' string range
+    definitions::
+
+        srange("[0-9]")   -> "0123456789"
+        srange("[a-z]")   -> "abcdefghijklmnopqrstuvwxyz"
+        srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
+
+    The input string must be enclosed in []'s, and the returned string
+    is the expanded character set joined into a single string. The
+    values enclosed in the []'s may be:
+
+     - a single character
+     - an escaped character with a leading backslash (such as ``\-``
+       or ``\]``)
+     - an escaped hex character with a leading ``'\x'``
+       (``\x21``, which is a ``'!'`` character) (``\0x##``
+       is also supported for backwards compatibility)
+     - an escaped octal character with a leading ``'\0'``
+       (``\041``, which is a ``'!'`` character)
+     - a range of any of the above, separated by a dash (``'a-z'``,
+       etc.)
+     - any combination of the above (``'aeiouy'``,
+       ``'a-zA-Z0-9_$'``, etc.)
+    """
+    _expanded = lambda p: p if not isinstance(p, ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]), ord(p[1]) + 1))
+    try:
+        return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
+    except Exception:
+        return ""
+
+def matchOnlyAtCol(n):
+    """Helper method for defining parse actions that require matching at
+    a specific column in the input text.
+    """
+    def verifyCol(strg, locn, toks):
+        if col(locn, strg) != n:
+            raise ParseException(strg, locn, "matched token not at column %d" % n)
+    return verifyCol
+
+def replaceWith(replStr):
+    """Helper method for common parse actions that simply return
+    a literal value.  Especially useful when used with
+    :class:`transformString<ParserElement.transformString>` ().
+
+    Example::
+
+        num = Word(nums).setParseAction(lambda toks: int(toks[0]))
+        na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
+        term = na | num
+
+        OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
+    """
+    return lambda s, l, t: [replStr]
+
+def removeQuotes(s, l, t):
+    """Helper parse action for removing quotation marks from parsed
+    quoted strings.
+
+    Example::
+
+        # by default, quotation marks are included in parsed results
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
+
+        # use removeQuotes to strip quotation marks from parsed results
+        quotedString.setParseAction(removeQuotes)
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
+    """
+    return t[0][1:-1]
+
+def tokenMap(func, *args):
+    """Helper to define a parse action by mapping a function to all
+    elements of a ParseResults list. If any additional args are passed,
+    they are forwarded to the given function as additional arguments
+    after the token, as in
+    ``hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))``,
+    which will convert the parsed data to an integer using base 16.
+
+    Example (compare the last to example in :class:`ParserElement.transformString`::
+
+        hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
+        hex_ints.runTests('''
+            00 11 22 aa FF 0a 0d 1a
+            ''')
+
+        upperword = Word(alphas).setParseAction(tokenMap(str.upper))
+        OneOrMore(upperword).runTests('''
+            my kingdom for a horse
+            ''')
+
+        wd = Word(alphas).setParseAction(tokenMap(str.title))
+        OneOrMore(wd).setParseAction(' '.join).runTests('''
+            now is the winter of our discontent made glorious summer by this sun of york
+            ''')
+
+    prints::
+
+        00 11 22 aa FF 0a 0d 1a
+        [0, 17, 34, 170, 255, 10, 13, 26]
+
+        my kingdom for a horse
+        ['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
+
+        now is the winter of our discontent made glorious summer by this sun of york
+        ['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
+    """
+    def pa(s, l, t):
+        return [func(tokn, *args) for tokn in t]
+
+    try:
+        func_name = getattr(func, '__name__',
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    pa.__name__ = func_name
+
+    return pa
+
+upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
+"""(Deprecated) Helper parse action to convert tokens to upper case.
+Deprecated in favor of :class:`pyparsing_common.upcaseTokens`"""
+
+downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
+"""(Deprecated) Helper parse action to convert tokens to lower case.
+Deprecated in favor of :class:`pyparsing_common.downcaseTokens`"""
+
+def _makeTags(tagStr, xml,
+              suppress_LT=Suppress("<"),
+              suppress_GT=Suppress(">")):
+    """Internal helper to construct opening and closing tag expressions, given a tag name"""
+    if isinstance(tagStr, basestring):
+        resname = tagStr
+        tagStr = Keyword(tagStr, caseless=not xml)
+    else:
+        resname = tagStr.name
+
+    tagAttrName = Word(alphas, alphanums + "_-:")
+    if xml:
+        tagAttrValue = dblQuotedString.copy().setParseAction(removeQuotes)
+        openTag = (suppress_LT
+                   + tagStr("tag")
+                   + Dict(ZeroOrMore(Group(tagAttrName + Suppress("=") + tagAttrValue)))
+                   + Optional("/", default=[False])("empty").setParseAction(lambda s, l, t: t[0] == '/')
+                   + suppress_GT)
+    else:
+        tagAttrValue = quotedString.copy().setParseAction(removeQuotes) | Word(printables, excludeChars=">")
+        openTag = (suppress_LT
+                   + tagStr("tag")
+                   + Dict(ZeroOrMore(Group(tagAttrName.setParseAction(downcaseTokens)
+                                           + Optional(Suppress("=") + tagAttrValue))))
+                   + Optional("/", default=[False])("empty").setParseAction(lambda s, l, t: t[0] == '/')
+                   + suppress_GT)
+    closeTag = Combine(_L("</") + tagStr + ">", adjacent=False)
+
+    openTag.setName("<%s>" % resname)
+    # add start<tagname> results name in parse action now that ungrouped names are not reported at two levels
+    openTag.addParseAction(lambda t: t.__setitem__("start" + "".join(resname.replace(":", " ").title().split()), t.copy()))
+    closeTag = closeTag("end" + "".join(resname.replace(":", " ").title().split())).setName("</%s>" % resname)
+    openTag.tag = resname
+    closeTag.tag = resname
+    openTag.tag_body = SkipTo(closeTag())
+    return openTag, closeTag
+
+def makeHTMLTags(tagStr):
+    """Helper to construct opening and closing tag expressions for HTML,
+    given a tag name. Matches tags in either upper or lower case,
+    attributes with namespaces and with quoted or unquoted values.
+
+    Example::
+
+        text = '<td>More info at the <a href="https://github.com/pyparsing/pyparsing/wiki">pyparsing</a> wiki page</td>'
+        # makeHTMLTags returns pyparsing expressions for the opening and
+        # closing tags as a 2-tuple
+        a, a_end = makeHTMLTags("A")
+        link_expr = a + SkipTo(a_end)("link_text") + a_end
+
+        for link in link_expr.searchString(text):
+            # attributes in the <A> tag (like "href" shown here) are
+            # also accessible as named results
+            print(link.link_text, '->', link.href)
+
+    prints::
+
+        pyparsing -> https://github.com/pyparsing/pyparsing/wiki
+    """
+    return _makeTags(tagStr, False)
+
+def makeXMLTags(tagStr):
+    """Helper to construct opening and closing tag expressions for XML,
+    given a tag name. Matches tags only in the given upper/lower case.
+
+    Example: similar to :class:`makeHTMLTags`
+    """
+    return _makeTags(tagStr, True)
+
+def withAttribute(*args, **attrDict):
+    """Helper to create a validating parse action to be used with start
+    tags created with :class:`makeXMLTags` or
+    :class:`makeHTMLTags`. Use ``withAttribute`` to qualify
+    a starting tag with a required attribute value, to avoid false
+    matches on common tags such as ``<TD>`` or ``<DIV>``.
+
+    Call ``withAttribute`` with a series of attribute names and
+    values. Specify the list of filter attributes names and values as:
+
+     - keyword arguments, as in ``(align="right")``, or
+     - as an explicit dict with ``**`` operator, when an attribute
+       name is also a Python reserved word, as in ``**{"class":"Customer", "align":"right"}``
+     - a list of name-value tuples, as in ``(("ns1:class", "Customer"), ("ns2:align", "right"))``
+
+    For attribute names with a namespace prefix, you must use the second
+    form.  Attribute names are matched insensitive to upper/lower case.
+
+    If just testing for ``class`` (with or without a namespace), use
+    :class:`withClass`.
+
+    To verify that the attribute exists, but without specifying a value,
+    pass ``withAttribute.ANY_VALUE`` as the value.
+
+    Example::
+
+        html = '''
+            <div>
+            Some text
+            <div type="grid">1 4 0 1 0</div>
+            <div type="graph">1,3 2,3 1,1</div>
+            <div>this has no type</div>
+            </div>
+
+        '''
+        div,div_end = makeHTMLTags("div")
+
+        # only match div tag having a type attribute with value "grid"
+        div_grid = div().setParseAction(withAttribute(type="grid"))
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+
+        # construct a match with any div tag having a type attribute, regardless of the value
+        div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+
+    prints::
+
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    if args:
+        attrs = args[:]
+    else:
+        attrs = attrDict.items()
+    attrs = [(k, v) for k, v in attrs]
+    def pa(s, l, tokens):
+        for attrName, attrValue in attrs:
+            if attrName not in tokens:
+                raise ParseException(s, l, "no matching attribute " + attrName)
+            if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
+                raise ParseException(s, l, "attribute '%s' has value '%s', must be '%s'" %
+                                            (attrName, tokens[attrName], attrValue))
+    return pa
+withAttribute.ANY_VALUE = object()
+
+def withClass(classname, namespace=''):
+    """Simplified version of :class:`withAttribute` when
+    matching on a div class - made difficult because ``class`` is
+    a reserved word in Python.
+
+    Example::
+
+        html = '''
+            <div>
+            Some text
+            <div class="grid">1 4 0 1 0</div>
+            <div class="graph">1,3 2,3 1,1</div>
+            <div>this &lt;div&gt; has no class</div>
+            </div>
+
+        '''
+        div,div_end = makeHTMLTags("div")
+        div_grid = div().setParseAction(withClass("grid"))
+
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+
+        div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+
+    prints::
+
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    classattr = "%s:class" % namespace if namespace else "class"
+    return withAttribute(**{classattr: classname})
+
+opAssoc = SimpleNamespace()
+opAssoc.LEFT = object()
+opAssoc.RIGHT = object()
+
+def infixNotation(baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')')):
+    """Helper method for constructing grammars of expressions made up of
+    operators working in a precedence hierarchy.  Operators may be unary
+    or binary, left- or right-associative.  Parse actions can also be
+    attached to operator expressions. The generated parser will also
+    recognize the use of parentheses to override operator precedences
+    (see example below).
+
+    Note: if you define a deep operator list, you may see performance
+    issues when using infixNotation. See
+    :class:`ParserElement.enablePackrat` for a mechanism to potentially
+    improve your parser performance.
+
+    Parameters:
+     - baseExpr - expression representing the most basic element for the
+       nested
+     - opList - list of tuples, one for each operator precedence level
+       in the expression grammar; each tuple is of the form ``(opExpr,
+       numTerms, rightLeftAssoc, parseAction)``, where:
+
+       - opExpr is the pyparsing expression for the operator; may also
+         be a string, which will be converted to a Literal; if numTerms
+         is 3, opExpr is a tuple of two expressions, for the two
+         operators separating the 3 terms
+       - numTerms is the number of terms for this operator (must be 1,
+         2, or 3)
+       - rightLeftAssoc is the indicator whether the operator is right
+         or left associative, using the pyparsing-defined constants
+         ``opAssoc.RIGHT`` and ``opAssoc.LEFT``.
+       - parseAction is the parse action to be associated with
+         expressions matching this operator expression (the parse action
+         tuple member may be omitted); if the parse action is passed
+         a tuple or list of functions, this is equivalent to calling
+         ``setParseAction(*fn)``
+         (:class:`ParserElement.setParseAction`)
+     - lpar - expression for matching left-parentheses
+       (default= ``Suppress('(')``)
+     - rpar - expression for matching right-parentheses
+       (default= ``Suppress(')')``)
+
+    Example::
+
+        # simple example of four-function arithmetic with ints and
+        # variable names
+        integer = pyparsing_common.signed_integer
+        varname = pyparsing_common.identifier
+
+        arith_expr = infixNotation(integer | varname,
+            [
+            ('-', 1, opAssoc.RIGHT),
+            (oneOf('* /'), 2, opAssoc.LEFT),
+            (oneOf('+ -'), 2, opAssoc.LEFT),
+            ])
+
+        arith_expr.runTests('''
+            5+3*6
+            (5+3)*6
+            -2--11
+            ''', fullDump=False)
+
+    prints::
+
+        5+3*6
+        [[5, '+', [3, '*', 6]]]
+
+        (5+3)*6
+        [[[5, '+', 3], '*', 6]]
+
+        -2--11
+        [[['-', 2], '-', ['-', 11]]]
+    """
+    # captive version of FollowedBy that does not do parse actions or capture results names
+    class _FB(FollowedBy):
+        def parseImpl(self, instring, loc, doActions=True):
+            self.expr.tryParse(instring, loc)
+            return loc, []
+
+    ret = Forward()
+    lastExpr = baseExpr | (lpar + ret + rpar)
+    for i, operDef in enumerate(opList):
+        opExpr, arity, rightLeftAssoc, pa = (operDef + (None, ))[:4]
+        termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
+        if arity == 3:
+            if opExpr is None or len(opExpr) != 2:
+                raise ValueError(
+                    "if numterms=3, opExpr must be a tuple or list of two expressions")
+            opExpr1, opExpr2 = opExpr
+        thisExpr = Forward().setName(termName)
+        if rightLeftAssoc == opAssoc.LEFT:
+            if arity == 1:
+                matchExpr = _FB(lastExpr + opExpr) + Group(lastExpr + OneOrMore(opExpr))
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = _FB(lastExpr + opExpr + lastExpr) + Group(lastExpr + OneOrMore(opExpr + lastExpr))
+                else:
+                    matchExpr = _FB(lastExpr + lastExpr) + Group(lastExpr + OneOrMore(lastExpr))
+            elif arity == 3:
+                matchExpr = (_FB(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr)
+                             + Group(lastExpr + OneOrMore(opExpr1 + lastExpr + opExpr2 + lastExpr)))
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        elif rightLeftAssoc == opAssoc.RIGHT:
+            if arity == 1:
+                # try to avoid LR with this extra test
+                if not isinstance(opExpr, Optional):
+                    opExpr = Optional(opExpr)
+                matchExpr = _FB(opExpr.expr + thisExpr) + Group(opExpr + thisExpr)
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = _FB(lastExpr + opExpr + thisExpr) + Group(lastExpr + OneOrMore(opExpr + thisExpr))
+                else:
+                    matchExpr = _FB(lastExpr + thisExpr) + Group(lastExpr + OneOrMore(thisExpr))
+            elif arity == 3:
+                matchExpr = (_FB(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr)
+                             + Group(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr))
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        else:
+            raise ValueError("operator must indicate right or left associativity")
+        if pa:
+            if isinstance(pa, (tuple, list)):
+                matchExpr.setParseAction(*pa)
+            else:
+                matchExpr.setParseAction(pa)
+        thisExpr <<= (matchExpr.setName(termName) | lastExpr)
+        lastExpr = thisExpr
+    ret <<= lastExpr
+    return ret
+
+operatorPrecedence = infixNotation
+"""(Deprecated) Former name of :class:`infixNotation`, will be
+dropped in a future release."""
+
+dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*') + '"').setName("string enclosed in double quotes")
+sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*") + "'").setName("string enclosed in single quotes")
+quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*') + '"'
+                       | Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*") + "'").setName("quotedString using single or double quotes")
+unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
+
+def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
+    """Helper method for defining nested lists enclosed in opening and
+    closing delimiters ("(" and ")" are the default).
+
+    Parameters:
+     - opener - opening character for a nested list
+       (default= ``"("``); can also be a pyparsing expression
+     - closer - closing character for a nested list
+       (default= ``")"``); can also be a pyparsing expression
+     - content - expression for items within the nested lists
+       (default= ``None``)
+     - ignoreExpr - expression for ignoring opening and closing
+       delimiters (default= :class:`quotedString`)
+
+    If an expression is not provided for the content argument, the
+    nested expression will capture all whitespace-delimited content
+    between delimiters as a list of separate values.
+
+    Use the ``ignoreExpr`` argument to define expressions that may
+    contain opening or closing characters that should not be treated as
+    opening or closing characters for nesting, such as quotedString or
+    a comment expression.  Specify multiple expressions using an
+    :class:`Or` or :class:`MatchFirst`. The default is
+    :class:`quotedString`, but if no expressions are to be ignored, then
+    pass ``None`` for this argument.
+
+    Example::
+
+        data_type = oneOf("void int short long char float double")
+        decl_data_type = Combine(data_type + Optional(Word('*')))
+        ident = Word(alphas+'_', alphanums+'_')
+        number = pyparsing_common.number
+        arg = Group(decl_data_type + ident)
+        LPAR, RPAR = map(Suppress, "()")
+
+        code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
+
+        c_function = (decl_data_type("type")
+                      + ident("name")
+                      + LPAR + Optional(delimitedList(arg), [])("args") + RPAR
+                      + code_body("body"))
+        c_function.ignore(cStyleComment)
+
+        source_code = '''
+            int is_odd(int x) {
+                return (x%2);
+            }
+
+            int dec_to_hex(char hchar) {
+                if (hchar >= '0' && hchar <= '9') {
+                    return (ord(hchar)-ord('0'));
+                } else {
+                    return (10+ord(hchar)-ord('A'));
+                }
+            }
+        '''
+        for func in c_function.searchString(source_code):
+            print("%(name)s (%(type)s) args: %(args)s" % func)
+
+
+    prints::
+
+        is_odd (int) args: [['int', 'x']]
+        dec_to_hex (int) args: [['char', 'hchar']]
+    """
+    if opener == closer:
+        raise ValueError("opening and closing strings cannot be the same")
+    if content is None:
+        if isinstance(opener, basestring) and isinstance(closer, basestring):
+            if len(opener) == 1 and len(closer) == 1:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr
+                                                 + CharsNotIn(opener
+                                                              + closer
+                                                              + ParserElement.DEFAULT_WHITE_CHARS, exact=1)
+                                                 )
+                                       ).setParseAction(lambda t: t[0].strip()))
+                else:
+                    content = (empty.copy() + CharsNotIn(opener
+                                                         + closer
+                                                         + ParserElement.DEFAULT_WHITE_CHARS
+                                                         ).setParseAction(lambda t: t[0].strip()))
+            else:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr
+                                                 + ~Literal(opener)
+                                                 + ~Literal(closer)
+                                                 + CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS, exact=1))
+                                       ).setParseAction(lambda t: t[0].strip()))
+                else:
+                    content = (Combine(OneOrMore(~Literal(opener)
+                                                 + ~Literal(closer)
+                                                 + CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS, exact=1))
+                                       ).setParseAction(lambda t: t[0].strip()))
+        else:
+            raise ValueError("opening and closing arguments must be strings if no content expression is given")
+    ret = Forward()
+    if ignoreExpr is not None:
+        ret <<= Group(Suppress(opener) + ZeroOrMore(ignoreExpr | ret | content) + Suppress(closer))
+    else:
+        ret <<= Group(Suppress(opener) + ZeroOrMore(ret | content)  + Suppress(closer))
+    ret.setName('nested %s%s expression' % (opener, closer))
+    return ret
+
+def indentedBlock(blockStatementExpr, indentStack, indent=True):
+    """Helper method for defining space-delimited indentation blocks,
+    such as those used to define block statements in Python source code.
+
+    Parameters:
+
+     - blockStatementExpr - expression defining syntax of statement that
+       is repeated within the indented block
+     - indentStack - list created by caller to manage indentation stack
+       (multiple statementWithIndentedBlock expressions within a single
+       grammar should share a common indentStack)
+     - indent - boolean indicating whether block must be indented beyond
+       the current level; set to False for block of left-most
+       statements (default= ``True``)
+
+    A valid block must contain at least one ``blockStatement``.
+
+    Example::
+
+        data = '''
+        def A(z):
+          A1
+          B = 100
+          G = A2
+          A2
+          A3
+        B
+        def BB(a,b,c):
+          BB1
+          def BBA():
+            bba1
+            bba2
+            bba3
+        C
+        D
+        def spam(x,y):
+             def eggs(z):
+                 pass
+        '''
+
+
+        indentStack = [1]
+        stmt = Forward()
+
+        identifier = Word(alphas, alphanums)
+        funcDecl = ("def" + identifier + Group("(" + Optional(delimitedList(identifier)) + ")") + ":")
+        func_body = indentedBlock(stmt, indentStack)
+        funcDef = Group(funcDecl + func_body)
+
+        rvalue = Forward()
+        funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
+        rvalue << (funcCall | identifier | Word(nums))
+        assignment = Group(identifier + "=" + rvalue)
+        stmt << (funcDef | assignment | identifier)
+
+        module_body = OneOrMore(stmt)
+
+        parseTree = module_body.parseString(data)
+        parseTree.pprint()
+
+    prints::
+
+        [['def',
+          'A',
+          ['(', 'z', ')'],
+          ':',
+          [['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
+         'B',
+         ['def',
+          'BB',
+          ['(', 'a', 'b', 'c', ')'],
+          ':',
+          [['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
+         'C',
+         'D',
+         ['def',
+          'spam',
+          ['(', 'x', 'y', ')'],
+          ':',
+          [[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]]
+    """
+    backup_stack = indentStack[:]
+
+    def reset_stack():
+        indentStack[:] = backup_stack
+
+    def checkPeerIndent(s, l, t):
+        if l >= len(s): return
+        curCol = col(l, s)
+        if curCol != indentStack[-1]:
+            if curCol > indentStack[-1]:
+                raise ParseException(s, l, "illegal nesting")
+            raise ParseException(s, l, "not a peer entry")
+
+    def checkSubIndent(s, l, t):
+        curCol = col(l, s)
+        if curCol > indentStack[-1]:
+            indentStack.append(curCol)
+        else:
+            raise ParseException(s, l, "not a subentry")
+
+    def checkUnindent(s, l, t):
+        if l >= len(s): return
+        curCol = col(l, s)
+        if not(indentStack and curCol in indentStack):
+            raise ParseException(s, l, "not an unindent")
+        if curCol < indentStack[-1]:
+            indentStack.pop()
+
+    NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress(), stopOn=StringEnd())
+    INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
+    PEER   = Empty().setParseAction(checkPeerIndent).setName('')
+    UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
+    if indent:
+        smExpr = Group(Optional(NL)
+                       + INDENT
+                       + OneOrMore(PEER + Group(blockStatementExpr) + Optional(NL), stopOn=StringEnd())
+                       + UNDENT)
+    else:
+        smExpr = Group(Optional(NL)
+                       + OneOrMore(PEER + Group(blockStatementExpr) + Optional(NL), stopOn=StringEnd())
+                       + UNDENT)
+    smExpr.setFailAction(lambda a, b, c, d: reset_stack())
+    blockStatementExpr.ignore(_bslash + LineEnd())
+    return smExpr.setName('indented block')
+
+alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
+punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
+
+anyOpenTag, anyCloseTag = makeHTMLTags(Word(alphas, alphanums + "_:").setName('any tag'))
+_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(), '><& "\''))
+commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
+def replaceHTMLEntity(t):
+    """Helper parser action to replace common HTML entities with their special characters"""
+    return _htmlEntityMap.get(t.entity)
+
+# it's easy to get these comment structures wrong - they're very common, so may as well make them available
+cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
+"Comment of the form ``/* ... */``"
+
+htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
+"Comment of the form ``<!-- ... -->``"
+
+restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
+dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
+"Comment of the form ``// ... (to end of line)``"
+
+cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/' | dblSlashComment).setName("C++ style comment")
+"Comment of either form :class:`cStyleComment` or :class:`dblSlashComment`"
+
+javaStyleComment = cppStyleComment
+"Same as :class:`cppStyleComment`"
+
+pythonStyleComment = Regex(r"#.*").setName("Python style comment")
+"Comment of the form ``# ... (to end of line)``"
+
+_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',')
+                                  + Optional(Word(" \t")
+                                             + ~Literal(",") + ~LineEnd()))).streamline().setName("commaItem")
+commaSeparatedList = delimitedList(Optional(quotedString.copy() | _commasepitem, default="")).setName("commaSeparatedList")
+"""(Deprecated) Predefined expression of 1 or more printable words or
+quoted strings, separated by commas.
+
+This expression is deprecated in favor of :class:`pyparsing_common.comma_separated_list`.
+"""
+
+# some other useful expressions - using lower-case class name since we are really using this as a namespace
+class pyparsing_common:
+    """Here are some common low-level expressions that may be useful in
+    jump-starting parser development:
+
+     - numeric forms (:class:`integers<integer>`, :class:`reals<real>`,
+       :class:`scientific notation<sci_real>`)
+     - common :class:`programming identifiers<identifier>`
+     - network addresses (:class:`MAC<mac_address>`,
+       :class:`IPv4<ipv4_address>`, :class:`IPv6<ipv6_address>`)
+     - ISO8601 :class:`dates<iso8601_date>` and
+       :class:`datetime<iso8601_datetime>`
+     - :class:`UUID<uuid>`
+     - :class:`comma-separated list<comma_separated_list>`
+
+    Parse actions:
+
+     - :class:`convertToInteger`
+     - :class:`convertToFloat`
+     - :class:`convertToDate`
+     - :class:`convertToDatetime`
+     - :class:`stripHTMLTags`
+     - :class:`upcaseTokens`
+     - :class:`downcaseTokens`
+
+    Example::
+
+        pyparsing_common.number.runTests('''
+            # any int or real number, returned as the appropriate type
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.fnumber.runTests('''
+            # any int or real number, returned as float
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.hex_integer.runTests('''
+            # hex numbers
+            100
+            FF
+            ''')
+
+        pyparsing_common.fraction.runTests('''
+            # fractions
+            1/2
+            -3/4
+            ''')
+
+        pyparsing_common.mixed_integer.runTests('''
+            # mixed fractions
+            1
+            1/2
+            -3/4
+            1-3/4
+            ''')
+
+        import uuid
+        pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+        pyparsing_common.uuid.runTests('''
+            # uuid
+            12345678-1234-5678-1234-567812345678
+            ''')
+
+    prints::
+
+        # any int or real number, returned as the appropriate type
+        100
+        [100]
+
+        -100
+        [-100]
+
+        +100
+        [100]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # any int or real number, returned as float
+        100
+        [100.0]
+
+        -100
+        [-100.0]
+
+        +100
+        [100.0]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # hex numbers
+        100
+        [256]
+
+        FF
+        [255]
+
+        # fractions
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        # mixed fractions
+        1
+        [1]
+
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        1-3/4
+        [1.75]
+
+        # uuid
+        12345678-1234-5678-1234-567812345678
+        [UUID('12345678-1234-5678-1234-567812345678')]
+    """
+
+    convertToInteger = tokenMap(int)
+    """
+    Parse action for converting parsed integers to Python int
+    """
+
+    convertToFloat = tokenMap(float)
+    """
+    Parse action for converting parsed numbers to Python float
+    """
+
+    integer = Word(nums).setName("integer").setParseAction(convertToInteger)
+    """expression that parses an unsigned integer, returns an int"""
+
+    hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int, 16))
+    """expression that parses a hexadecimal integer, returns an int"""
+
+    signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
+    """expression that parses an integer with optional leading sign, returns an int"""
+
+    fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
+    """fractional expression of an integer divided by an integer, returns a float"""
+    fraction.addParseAction(lambda t: t[0]/t[-1])
+
+    mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
+    """mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
+    mixed_integer.addParseAction(sum)
+
+    real = Regex(r'[+-]?(?:\d+\.\d*|\.\d+)').setName("real number").setParseAction(convertToFloat)
+    """expression that parses a floating point number and returns a float"""
+
+    sci_real = Regex(r'[+-]?(?:\d+(?:[eE][+-]?\d+)|(?:\d+\.\d*|\.\d+)(?:[eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
+    """expression that parses a floating point number with optional
+    scientific notation and returns a float"""
+
+    # streamlining this expression makes the docs nicer-looking
+    number = (sci_real | real | signed_integer).streamline()
+    """any numeric expression, returns the corresponding Python type"""
+
+    fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
+    """any int or real number, returned as float"""
+
+    identifier = Word(alphas + '_', alphanums + '_').setName("identifier")
+    """typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
+
+    ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
+    "IPv4 address (``0.0.0.0 - 255.255.255.255``)"
+
+    _ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
+    _full_ipv6_address = (_ipv6_part + (':' + _ipv6_part) * 7).setName("full IPv6 address")
+    _short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part) * (0, 6))
+                           + "::"
+                           + Optional(_ipv6_part + (':' + _ipv6_part) * (0, 6))
+                           ).setName("short IPv6 address")
+    _short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
+    _mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
+    ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
+    "IPv6 address (long, short, or mixed form)"
+
+    mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
+    "MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
+
+    @staticmethod
+    def convertToDate(fmt="%Y-%m-%d"):
+        """
+        Helper to create a parse action for converting parsed date string to Python datetime.date
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default= ``"%Y-%m-%d"``)
+
+        Example::
+
+            date_expr = pyparsing_common.iso8601_date.copy()
+            date_expr.setParseAction(pyparsing_common.convertToDate())
+            print(date_expr.parseString("1999-12-31"))
+
+        prints::
+
+            [datetime.date(1999, 12, 31)]
+        """
+        def cvt_fn(s, l, t):
+            try:
+                return datetime.strptime(t[0], fmt).date()
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    @staticmethod
+    def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
+        """Helper to create a parse action for converting parsed
+        datetime string to Python datetime.datetime
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default= ``"%Y-%m-%dT%H:%M:%S.%f"``)
+
+        Example::
+
+            dt_expr = pyparsing_common.iso8601_datetime.copy()
+            dt_expr.setParseAction(pyparsing_common.convertToDatetime())
+            print(dt_expr.parseString("1999-12-31T23:59:59.999"))
+
+        prints::
+
+            [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
+        """
+        def cvt_fn(s, l, t):
+            try:
+                return datetime.strptime(t[0], fmt)
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
+    "ISO8601 date (``yyyy-mm-dd``)"
+
+    iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
+    "ISO8601 datetime (``yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)``) - trailing seconds, milliseconds, and timezone optional; accepts separating ``'T'`` or ``' '``"
+
+    uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
+    "UUID (``xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx``)"
+
+    _html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
+    @staticmethod
+    def stripHTMLTags(s, l, tokens):
+        """Parse action to remove HTML tags from web page HTML source
+
+        Example::
+
+            # strip HTML links from normal text
+            text = '<td>More info at the <a href="https://github.com/pyparsing/pyparsing/wiki">pyparsing</a> wiki page</td>'
+            td, td_end = makeHTMLTags("TD")
+            table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
+            print(table_text.parseString(text).body)
+
+        Prints::
+
+            More info at the pyparsing wiki page
+        """
+        return pyparsing_common._html_stripper.transformString(tokens[0])
+
+    _commasepitem = Combine(OneOrMore(~Literal(",")
+                                      + ~LineEnd()
+                                      + Word(printables, excludeChars=',')
+                                      + Optional(White(" \t")))).streamline().setName("commaItem")
+    comma_separated_list = delimitedList(Optional(quotedString.copy()
+                                                  | _commasepitem, default='')
+                                         ).setName("comma separated list")
+    """Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
+
+    upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
+    """Parse action to convert tokens to upper case."""
+
+    downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
+    """Parse action to convert tokens to lower case."""
+
+
+class _lazyclassproperty(object):
+    def __init__(self, fn):
+        self.fn = fn
+        self.__doc__ = fn.__doc__
+        self.__name__ = fn.__name__
+
+    def __get__(self, obj, cls):
+        if cls is None:
+            cls = type(obj)
+        if not hasattr(cls, '_intern') or any(cls._intern is getattr(superclass, '_intern', [])
+                                              for superclass in cls.__mro__[1:]):
+            cls._intern = {}
+        attrname = self.fn.__name__
+        if attrname not in cls._intern:
+            cls._intern[attrname] = self.fn(cls)
+        return cls._intern[attrname]
+
+
+class unicode_set(object):
+    """
+    A set of Unicode characters, for language-specific strings for
+    ``alphas``, ``nums``, ``alphanums``, and ``printables``.
+    A unicode_set is defined by a list of ranges in the Unicode character
+    set, in a class attribute ``_ranges``, such as::
+
+        _ranges = [(0x0020, 0x007e), (0x00a0, 0x00ff),]
+
+    A unicode set can also be defined using multiple inheritance of other unicode sets::
+
+        class CJK(Chinese, Japanese, Korean):
+            pass
+    """
+    _ranges = []
+
+    @classmethod
+    def _get_chars_for_ranges(cls):
+        ret = []
+        for cc in cls.__mro__:
+            if cc is unicode_set:
+                break
+            for rr in cc._ranges:
+                ret.extend(range(rr[0], rr[-1] + 1))
+        return [unichr(c) for c in sorted(set(ret))]
+
+    @_lazyclassproperty
+    def printables(cls):
+        "all non-whitespace characters in this range"
+        return u''.join(filterfalse(unicode.isspace, cls._get_chars_for_ranges()))
+
+    @_lazyclassproperty
+    def alphas(cls):
+        "all alphabetic characters in this range"
+        return u''.join(filter(unicode.isalpha, cls._get_chars_for_ranges()))
+
+    @_lazyclassproperty
+    def nums(cls):
+        "all numeric digit characters in this range"
+        return u''.join(filter(unicode.isdigit, cls._get_chars_for_ranges()))
+
+    @_lazyclassproperty
+    def alphanums(cls):
+        "all alphanumeric characters in this range"
+        return cls.alphas + cls.nums
+
+
+class pyparsing_unicode(unicode_set):
+    """
+    A namespace class for defining common language unicode_sets.
+    """
+    _ranges = [(32, sys.maxunicode)]
+
+    class Latin1(unicode_set):
+        "Unicode set for Latin-1 Unicode Character Range"
+        _ranges = [(0x0020, 0x007e), (0x00a0, 0x00ff),]
+
+    class LatinA(unicode_set):
+        "Unicode set for Latin-A Unicode Character Range"
+        _ranges = [(0x0100, 0x017f),]
+
+    class LatinB(unicode_set):
+        "Unicode set for Latin-B Unicode Character Range"
+        _ranges = [(0x0180, 0x024f),]
+
+    class Greek(unicode_set):
+        "Unicode set for Greek Unicode Character Ranges"
+        _ranges = [
+            (0x0370, 0x03ff), (0x1f00, 0x1f15), (0x1f18, 0x1f1d), (0x1f20, 0x1f45), (0x1f48, 0x1f4d),
+            (0x1f50, 0x1f57), (0x1f59,), (0x1f5b,), (0x1f5d,), (0x1f5f, 0x1f7d), (0x1f80, 0x1fb4), (0x1fb6, 0x1fc4),
+            (0x1fc6, 0x1fd3), (0x1fd6, 0x1fdb), (0x1fdd, 0x1fef), (0x1ff2, 0x1ff4), (0x1ff6, 0x1ffe),
+        ]
+
+    class Cyrillic(unicode_set):
+        "Unicode set for Cyrillic Unicode Character Range"
+        _ranges = [(0x0400, 0x04ff)]
+
+    class Chinese(unicode_set):
+        "Unicode set for Chinese Unicode Character Range"
+        _ranges = [(0x4e00, 0x9fff), (0x3000, 0x303f),]
+
+    class Japanese(unicode_set):
+        "Unicode set for Japanese Unicode Character Range, combining Kanji, Hiragana, and Katakana ranges"
+        _ranges = []
+
+        class Kanji(unicode_set):
+            "Unicode set for Kanji Unicode Character Range"
+            _ranges = [(0x4E00, 0x9Fbf), (0x3000, 0x303f),]
+
+        class Hiragana(unicode_set):
+            "Unicode set for Hiragana Unicode Character Range"
+            _ranges = [(0x3040, 0x309f),]
+
+        class Katakana(unicode_set):
+            "Unicode set for Katakana  Unicode Character Range"
+            _ranges = [(0x30a0, 0x30ff),]
+
+    class Korean(unicode_set):
+        "Unicode set for Korean Unicode Character Range"
+        _ranges = [(0xac00, 0xd7af), (0x1100, 0x11ff), (0x3130, 0x318f), (0xa960, 0xa97f), (0xd7b0, 0xd7ff), (0x3000, 0x303f),]
+
+    class CJK(Chinese, Japanese, Korean):
+        "Unicode set for combined Chinese, Japanese, and Korean (CJK) Unicode Character Range"
+        pass
+
+    class Thai(unicode_set):
+        "Unicode set for Thai Unicode Character Range"
+        _ranges = [(0x0e01, 0x0e3a), (0x0e3f, 0x0e5b),]
+
+    class Arabic(unicode_set):
+        "Unicode set for Arabic Unicode Character Range"
+        _ranges = [(0x0600, 0x061b), (0x061e, 0x06ff), (0x0700, 0x077f),]
+
+    class Hebrew(unicode_set):
+        "Unicode set for Hebrew Unicode Character Range"
+        _ranges = [(0x0590, 0x05ff),]
+
+    class Devanagari(unicode_set):
+        "Unicode set for Devanagari Unicode Character Range"
+        _ranges = [(0x0900, 0x097f), (0xa8e0, 0xa8ff)]
+
+pyparsing_unicode.Japanese._ranges = (pyparsing_unicode.Japanese.Kanji._ranges
+                                      + pyparsing_unicode.Japanese.Hiragana._ranges
+                                      + pyparsing_unicode.Japanese.Katakana._ranges)
+
+# define ranges in language character sets
+if PY_3:
+    setattr(pyparsing_unicode, u"العربية", pyparsing_unicode.Arabic)
+    setattr(pyparsing_unicode, u"中文", pyparsing_unicode.Chinese)
+    setattr(pyparsing_unicode, u"кириллица", pyparsing_unicode.Cyrillic)
+    setattr(pyparsing_unicode, u"Ελληνικά", pyparsing_unicode.Greek)
+    setattr(pyparsing_unicode, u"עִברִית", pyparsing_unicode.Hebrew)
+    setattr(pyparsing_unicode, u"日本語", pyparsing_unicode.Japanese)
+    setattr(pyparsing_unicode.Japanese, u"漢字", pyparsing_unicode.Japanese.Kanji)
+    setattr(pyparsing_unicode.Japanese, u"カタカナ", pyparsing_unicode.Japanese.Katakana)
+    setattr(pyparsing_unicode.Japanese, u"ひらがな", pyparsing_unicode.Japanese.Hiragana)
+    setattr(pyparsing_unicode, u"한국어", pyparsing_unicode.Korean)
+    setattr(pyparsing_unicode, u"ไทย", pyparsing_unicode.Thai)
+    setattr(pyparsing_unicode, u"देवनागरी", pyparsing_unicode.Devanagari)
+
+
+class pyparsing_test:
+    """
+    namespace class for classes useful in writing unit tests
+    """
+
+    class reset_pyparsing_context:
+        """
+        Context manager to be used when writing unit tests that modify pyparsing config values:
+         - packrat parsing
+         - default whitespace characters.
+         - default keyword characters
+         - literal string auto-conversion class
+         - __diag__ settings
+
+        Example:
+            with reset_pyparsing_context():
+                # test that literals used to construct a grammar are automatically suppressed
+                ParserElement.inlineLiteralsUsing(Suppress)
+
+                term = Word(alphas) | Word(nums)
+                group = Group('(' + term[...] + ')')
+
+                # assert that the '()' characters are not included in the parsed tokens
+                self.assertParseAndCheckLisst(group, "(abc 123 def)", ['abc', '123', 'def'])
+
+            # after exiting context manager, literals are converted to Literal expressions again
+        """
+
+        def __init__(self):
+            self._save_context = {}
+
+        def save(self):
+            self._save_context["default_whitespace"] = ParserElement.DEFAULT_WHITE_CHARS
+            self._save_context["default_keyword_chars"] = Keyword.DEFAULT_KEYWORD_CHARS
+            self._save_context[
+                "literal_string_class"
+            ] = ParserElement._literalStringClass
+            self._save_context["packrat_enabled"] = ParserElement._packratEnabled
+            self._save_context["packrat_parse"] = ParserElement._parse
+            self._save_context["__diag__"] = {
+                name: getattr(__diag__, name) for name in __diag__._all_names
+            }
+            self._save_context["__compat__"] = {
+                "collect_all_And_tokens": __compat__.collect_all_And_tokens
+            }
+            return self
+
+        def restore(self):
+            # reset pyparsing global state
+            if (
+                ParserElement.DEFAULT_WHITE_CHARS
+                != self._save_context["default_whitespace"]
+            ):
+                ParserElement.setDefaultWhitespaceChars(
+                    self._save_context["default_whitespace"]
+                )
+            Keyword.DEFAULT_KEYWORD_CHARS = self._save_context["default_keyword_chars"]
+            ParserElement.inlineLiteralsUsing(
+                self._save_context["literal_string_class"]
+            )
+            for name, value in self._save_context["__diag__"].items():
+                setattr(__diag__, name, value)
+            ParserElement._packratEnabled = self._save_context["packrat_enabled"]
+            ParserElement._parse = self._save_context["packrat_parse"]
+            __compat__.collect_all_And_tokens = self._save_context["__compat__"]
+
+        def __enter__(self):
+            return self.save()
+
+        def __exit__(self, *args):
+            return self.restore()
+
+    class TestParseResultsAsserts:
+        """
+        A mixin class to add parse results assertion methods to normal unittest.TestCase classes.
+        """
+        def assertParseResultsEquals(
+            self, result, expected_list=None, expected_dict=None, msg=None
+        ):
+            """
+            Unit test assertion to compare a ParseResults object with an optional expected_list,
+            and compare any defined results names with an optional expected_dict.
+            """
+            if expected_list is not None:
+                self.assertEqual(expected_list, result.asList(), msg=msg)
+            if expected_dict is not None:
+                self.assertEqual(expected_dict, result.asDict(), msg=msg)
+
+        def assertParseAndCheckList(
+            self, expr, test_string, expected_list, msg=None, verbose=True
+        ):
+            """
+            Convenience wrapper assert to test a parser element and input string, and assert that
+            the resulting ParseResults.asList() is equal to the expected_list.
+            """
+            result = expr.parseString(test_string, parseAll=True)
+            if verbose:
+                print(result.dump())
+            self.assertParseResultsEquals(result, expected_list=expected_list, msg=msg)
+
+        def assertParseAndCheckDict(
+            self, expr, test_string, expected_dict, msg=None, verbose=True
+        ):
+            """
+            Convenience wrapper assert to test a parser element and input string, and assert that
+            the resulting ParseResults.asDict() is equal to the expected_dict.
+            """
+            result = expr.parseString(test_string, parseAll=True)
+            if verbose:
+                print(result.dump())
+            self.assertParseResultsEquals(result, expected_dict=expected_dict, msg=msg)
+
+        def assertRunTestResults(
+            self, run_tests_report, expected_parse_results=None, msg=None
+        ):
+            """
+            Unit test assertion to evaluate output of ParserElement.runTests(). If a list of
+            list-dict tuples is given as the expected_parse_results argument, then these are zipped
+            with the report tuples returned by runTests and evaluated using assertParseResultsEquals.
+            Finally, asserts that the overall runTests() success value is True.
+
+            :param run_tests_report: tuple(bool, [tuple(str, ParseResults or Exception)]) returned from runTests
+            :param expected_parse_results (optional): [tuple(str, list, dict, Exception)]
+            """
+            run_test_success, run_test_results = run_tests_report
+
+            if expected_parse_results is not None:
+                merged = [
+                    (rpt[0], rpt[1], expected)
+                    for rpt, expected in zip(run_test_results, expected_parse_results)
+                ]
+                for test_string, result, expected in merged:
+                    # expected should be a tuple containing a list and/or a dict or an exception,
+                    # and optional failure message string
+                    # an empty tuple will skip any result validation
+                    fail_msg = next(
+                        (exp for exp in expected if isinstance(exp, str)), None
+                    )
+                    expected_exception = next(
+                        (
+                            exp
+                            for exp in expected
+                            if isinstance(exp, type) and issubclass(exp, Exception)
+                        ),
+                        None,
+                    )
+                    if expected_exception is not None:
+                        with self.assertRaises(
+                            expected_exception=expected_exception, msg=fail_msg or msg
+                        ):
+                            if isinstance(result, Exception):
+                                raise result
+                    else:
+                        expected_list = next(
+                            (exp for exp in expected if isinstance(exp, list)), None
+                        )
+                        expected_dict = next(
+                            (exp for exp in expected if isinstance(exp, dict)), None
+                        )
+                        if (expected_list, expected_dict) != (None, None):
+                            self.assertParseResultsEquals(
+                                result,
+                                expected_list=expected_list,
+                                expected_dict=expected_dict,
+                                msg=fail_msg or msg,
+                            )
+                        else:
+                            # warning here maybe?
+                            print("no validation for {!r}".format(test_string))
+
+            # do this last, in case some specific test results can be reported instead
+            self.assertTrue(
+                run_test_success, msg=msg if msg is not None else "failed runTests"
+            )
+
+        @contextmanager
+        def assertRaisesParseException(self, exc_type=ParseException, msg=None):
+            with self.assertRaises(exc_type, msg=msg):
+                yield
+
+
+if __name__ == "__main__":
+
+    selectToken    = CaselessLiteral("select")
+    fromToken      = CaselessLiteral("from")
+
+    ident          = Word(alphas, alphanums + "_$")
+
+    columnName     = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    columnNameList = Group(delimitedList(columnName)).setName("columns")
+    columnSpec     = ('*' | columnNameList)
+
+    tableName      = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    tableNameList  = Group(delimitedList(tableName)).setName("tables")
+
+    simpleSQL      = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
+
+    # demo runTests method, including embedded comments in test string
+    simpleSQL.runTests("""
+        # '*' as column list and dotted table name
+        select * from SYS.XYZZY
+
+        # caseless match on "SELECT", and casts back to "select"
+        SELECT * from XYZZY, ABC
+
+        # list of column names, and mixed case SELECT keyword
+        Select AA,BB,CC from Sys.dual
+
+        # multiple tables
+        Select A, B, C from Sys.dual, Table2
+
+        # invalid SELECT keyword - should fail
+        Xelect A, B, C from Sys.dual
+
+        # incomplete command - should fail
+        Select
+
+        # invalid column name - should fail
+        Select ^^^ frox Sys.dual
+
+        """)
+
+    pyparsing_common.number.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    # any int or real number, returned as float
+    pyparsing_common.fnumber.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    pyparsing_common.hex_integer.runTests("""
+        100
+        FF
+        """)
+
+    import uuid
+    pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+    pyparsing_common.uuid.runTests("""
+        12345678-1234-5678-1234-567812345678
+        """)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__init__.py b/venv/Lib/site-packages/pip/_vendor/requests/__init__.py
new file mode 100644
index 000000000..517458b5a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/__init__.py
@@ -0,0 +1,144 @@
+# -*- coding: utf-8 -*-
+
+#   __
+#  /__)  _  _     _   _ _/   _
+# / (   (- (/ (/ (- _)  /  _)
+#          /
+
+"""
+Requests HTTP Library
+~~~~~~~~~~~~~~~~~~~~~
+
+Requests is an HTTP library, written in Python, for human beings.
+Basic GET usage:
+
+   >>> import requests
+   >>> r = requests.get('https://www.python.org')
+   >>> r.status_code
+   200
+   >>> b'Python is a programming language' in r.content
+   True
+
+... or POST:
+
+   >>> payload = dict(key1='value1', key2='value2')
+   >>> r = requests.post('https://httpbin.org/post', data=payload)
+   >>> print(r.text)
+   {
+     ...
+     "form": {
+       "key1": "value1",
+       "key2": "value2"
+     },
+     ...
+   }
+
+The other HTTP methods are supported - see `requests.api`. Full documentation
+is at <https://requests.readthedocs.io>.
+
+:copyright: (c) 2017 by Kenneth Reitz.
+:license: Apache 2.0, see LICENSE for more details.
+"""
+
+from pip._vendor import urllib3
+from pip._vendor import chardet
+import warnings
+from .exceptions import RequestsDependencyWarning
+
+
+def check_compatibility(urllib3_version, chardet_version):
+    urllib3_version = urllib3_version.split('.')
+    assert urllib3_version != ['dev']  # Verify urllib3 isn't installed from git.
+
+    # Sometimes, urllib3 only reports its version as 16.1.
+    if len(urllib3_version) == 2:
+        urllib3_version.append('0')
+
+    # Check urllib3 for compatibility.
+    major, minor, patch = urllib3_version  # noqa: F811
+    major, minor, patch = int(major), int(minor), int(patch)
+    # urllib3 >= 1.21.1, <= 1.25
+    assert major == 1
+    assert minor >= 21
+    assert minor <= 25
+
+    # Check chardet for compatibility.
+    major, minor, patch = chardet_version.split('.')[:3]
+    major, minor, patch = int(major), int(minor), int(patch)
+    # chardet >= 3.0.2, < 3.1.0
+    assert major == 3
+    assert minor < 1
+    assert patch >= 2
+
+
+def _check_cryptography(cryptography_version):
+    # cryptography < 1.3.4
+    try:
+        cryptography_version = list(map(int, cryptography_version.split('.')))
+    except ValueError:
+        return
+
+    if cryptography_version < [1, 3, 4]:
+        warning = 'Old version of cryptography ({}) may cause slowdown.'.format(cryptography_version)
+        warnings.warn(warning, RequestsDependencyWarning)
+
+# Check imported dependencies for compatibility.
+try:
+    check_compatibility(urllib3.__version__, chardet.__version__)
+except (AssertionError, ValueError):
+    warnings.warn("urllib3 ({}) or chardet ({}) doesn't match a supported "
+                  "version!".format(urllib3.__version__, chardet.__version__),
+                  RequestsDependencyWarning)
+
+# Attempt to enable urllib3's fallback for SNI support
+# if the standard library doesn't support SNI or the
+# 'ssl' library isn't available.
+try:
+    # Note: This logic prevents upgrading cryptography on Windows, if imported
+    #       as part of pip.
+    from pip._internal.utils.compat import WINDOWS
+    if not WINDOWS:
+        raise ImportError("pip internals: don't import cryptography on Windows")
+    try:
+        import ssl
+    except ImportError:
+        ssl = None
+
+    if not getattr(ssl, "HAS_SNI", False):
+        from pip._vendor.urllib3.contrib import pyopenssl
+        pyopenssl.inject_into_urllib3()
+
+        # Check cryptography version
+        from cryptography import __version__ as cryptography_version
+        _check_cryptography(cryptography_version)
+except ImportError:
+    pass
+
+# urllib3's DependencyWarnings should be silenced.
+from pip._vendor.urllib3.exceptions import DependencyWarning
+warnings.simplefilter('ignore', DependencyWarning)
+
+from .__version__ import __title__, __description__, __url__, __version__
+from .__version__ import __build__, __author__, __author_email__, __license__
+from .__version__ import __copyright__, __cake__
+
+from . import utils
+from . import packages
+from .models import Request, Response, PreparedRequest
+from .api import request, get, head, post, patch, put, delete, options
+from .sessions import session, Session
+from .status_codes import codes
+from .exceptions import (
+    RequestException, Timeout, URLRequired,
+    TooManyRedirects, HTTPError, ConnectionError,
+    FileModeWarning, ConnectTimeout, ReadTimeout
+)
+
+# Set default logging handler to avoid "No handler found" warnings.
+import logging
+from logging import NullHandler
+
+logging.getLogger(__name__).addHandler(NullHandler())
+
+# FileModeWarnings go off per the default.
+warnings.simplefilter('default', FileModeWarning, append=True)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..f4384297c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__version__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__version__.cpython-36.pyc
new file mode 100644
index 000000000..8c528c7b0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/__version__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/_internal_utils.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/_internal_utils.cpython-36.pyc
new file mode 100644
index 000000000..699a97632
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/_internal_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/adapters.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/adapters.cpython-36.pyc
new file mode 100644
index 000000000..a9d9dda86
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/adapters.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/api.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/api.cpython-36.pyc
new file mode 100644
index 000000000..142914e3a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/api.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/auth.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/auth.cpython-36.pyc
new file mode 100644
index 000000000..f668b3759
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/auth.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/certs.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/certs.cpython-36.pyc
new file mode 100644
index 000000000..2f76118a5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/certs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/compat.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/compat.cpython-36.pyc
new file mode 100644
index 000000000..5708649e0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/cookies.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/cookies.cpython-36.pyc
new file mode 100644
index 000000000..8f322ecf2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/cookies.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/exceptions.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/exceptions.cpython-36.pyc
new file mode 100644
index 000000000..a4bbc0c2e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/help.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/help.cpython-36.pyc
new file mode 100644
index 000000000..d944c45e9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/help.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/hooks.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/hooks.cpython-36.pyc
new file mode 100644
index 000000000..e4da040fb
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/hooks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/models.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/models.cpython-36.pyc
new file mode 100644
index 000000000..14f70fa80
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/models.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/packages.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/packages.cpython-36.pyc
new file mode 100644
index 000000000..da9c60776
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/packages.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/sessions.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/sessions.cpython-36.pyc
new file mode 100644
index 000000000..e7e731d9a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/sessions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/status_codes.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/status_codes.cpython-36.pyc
new file mode 100644
index 000000000..8c91dc9e4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/status_codes.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/structures.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/structures.cpython-36.pyc
new file mode 100644
index 000000000..340aaaa5c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/structures.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..280074a43
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/requests/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/__version__.py b/venv/Lib/site-packages/pip/_vendor/requests/__version__.py
new file mode 100644
index 000000000..531e26ceb
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/__version__.py
@@ -0,0 +1,14 @@
+# .-. .-. .-. . . .-. .-. .-. .-.
+# |(  |-  |.| | | |-  `-.  |  `-.
+# ' ' `-' `-`.`-' `-' `-'  '  `-'
+
+__title__ = 'requests'
+__description__ = 'Python HTTP for Humans.'
+__url__ = 'https://requests.readthedocs.io'
+__version__ = '2.24.0'
+__build__ = 0x022400
+__author__ = 'Kenneth Reitz'
+__author_email__ = 'me@kennethreitz.org'
+__license__ = 'Apache 2.0'
+__copyright__ = 'Copyright 2020 Kenneth Reitz'
+__cake__ = u'\u2728 \U0001f370 \u2728'
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/_internal_utils.py b/venv/Lib/site-packages/pip/_vendor/requests/_internal_utils.py
new file mode 100644
index 000000000..759d9a56b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/_internal_utils.py
@@ -0,0 +1,42 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests._internal_utils
+~~~~~~~~~~~~~~
+
+Provides utility functions that are consumed internally by Requests
+which depend on extremely few external helpers (such as compat)
+"""
+
+from .compat import is_py2, builtin_str, str
+
+
+def to_native_string(string, encoding='ascii'):
+    """Given a string object, regardless of type, returns a representation of
+    that string in the native string type, encoding and decoding where
+    necessary. This assumes ASCII unless told otherwise.
+    """
+    if isinstance(string, builtin_str):
+        out = string
+    else:
+        if is_py2:
+            out = string.encode(encoding)
+        else:
+            out = string.decode(encoding)
+
+    return out
+
+
+def unicode_is_ascii(u_string):
+    """Determine if unicode string only contains ASCII characters.
+
+    :param str u_string: unicode string to check. Must be unicode
+        and not Python 2 `str`.
+    :rtype: bool
+    """
+    assert isinstance(u_string, str)
+    try:
+        u_string.encode('ascii')
+        return True
+    except UnicodeEncodeError:
+        return False
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/adapters.py b/venv/Lib/site-packages/pip/_vendor/requests/adapters.py
new file mode 100644
index 000000000..c30e7c92d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/adapters.py
@@ -0,0 +1,533 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.adapters
+~~~~~~~~~~~~~~~~~
+
+This module contains the transport adapters that Requests uses to define
+and maintain connections.
+"""
+
+import os.path
+import socket
+
+from pip._vendor.urllib3.poolmanager import PoolManager, proxy_from_url
+from pip._vendor.urllib3.response import HTTPResponse
+from pip._vendor.urllib3.util import parse_url
+from pip._vendor.urllib3.util import Timeout as TimeoutSauce
+from pip._vendor.urllib3.util.retry import Retry
+from pip._vendor.urllib3.exceptions import ClosedPoolError
+from pip._vendor.urllib3.exceptions import ConnectTimeoutError
+from pip._vendor.urllib3.exceptions import HTTPError as _HTTPError
+from pip._vendor.urllib3.exceptions import MaxRetryError
+from pip._vendor.urllib3.exceptions import NewConnectionError
+from pip._vendor.urllib3.exceptions import ProxyError as _ProxyError
+from pip._vendor.urllib3.exceptions import ProtocolError
+from pip._vendor.urllib3.exceptions import ReadTimeoutError
+from pip._vendor.urllib3.exceptions import SSLError as _SSLError
+from pip._vendor.urllib3.exceptions import ResponseError
+from pip._vendor.urllib3.exceptions import LocationValueError
+
+from .models import Response
+from .compat import urlparse, basestring
+from .utils import (DEFAULT_CA_BUNDLE_PATH, extract_zipped_paths,
+                    get_encoding_from_headers, prepend_scheme_if_needed,
+                    get_auth_from_url, urldefragauth, select_proxy)
+from .structures import CaseInsensitiveDict
+from .cookies import extract_cookies_to_jar
+from .exceptions import (ConnectionError, ConnectTimeout, ReadTimeout, SSLError,
+                         ProxyError, RetryError, InvalidSchema, InvalidProxyURL,
+                         InvalidURL)
+from .auth import _basic_auth_str
+
+try:
+    from pip._vendor.urllib3.contrib.socks import SOCKSProxyManager
+except ImportError:
+    def SOCKSProxyManager(*args, **kwargs):
+        raise InvalidSchema("Missing dependencies for SOCKS support.")
+
+DEFAULT_POOLBLOCK = False
+DEFAULT_POOLSIZE = 10
+DEFAULT_RETRIES = 0
+DEFAULT_POOL_TIMEOUT = None
+
+
+class BaseAdapter(object):
+    """The Base Transport Adapter"""
+
+    def __init__(self):
+        super(BaseAdapter, self).__init__()
+
+    def send(self, request, stream=False, timeout=None, verify=True,
+             cert=None, proxies=None):
+        """Sends PreparedRequest object. Returns Response object.
+
+        :param request: The :class:`PreparedRequest <PreparedRequest>` being sent.
+        :param stream: (optional) Whether to stream the request content.
+        :param timeout: (optional) How long to wait for the server to send
+            data before giving up, as a float, or a :ref:`(connect timeout,
+            read timeout) <timeouts>` tuple.
+        :type timeout: float or tuple
+        :param verify: (optional) Either a boolean, in which case it controls whether we verify
+            the server's TLS certificate, or a string, in which case it must be a path
+            to a CA bundle to use
+        :param cert: (optional) Any user-provided SSL certificate to be trusted.
+        :param proxies: (optional) The proxies dictionary to apply to the request.
+        """
+        raise NotImplementedError
+
+    def close(self):
+        """Cleans up adapter specific items."""
+        raise NotImplementedError
+
+
+class HTTPAdapter(BaseAdapter):
+    """The built-in HTTP Adapter for urllib3.
+
+    Provides a general-case interface for Requests sessions to contact HTTP and
+    HTTPS urls by implementing the Transport Adapter interface. This class will
+    usually be created by the :class:`Session <Session>` class under the
+    covers.
+
+    :param pool_connections: The number of urllib3 connection pools to cache.
+    :param pool_maxsize: The maximum number of connections to save in the pool.
+    :param max_retries: The maximum number of retries each connection
+        should attempt. Note, this applies only to failed DNS lookups, socket
+        connections and connection timeouts, never to requests where data has
+        made it to the server. By default, Requests does not retry failed
+        connections. If you need granular control over the conditions under
+        which we retry a request, import urllib3's ``Retry`` class and pass
+        that instead.
+    :param pool_block: Whether the connection pool should block for connections.
+
+    Usage::
+
+      >>> import requests
+      >>> s = requests.Session()
+      >>> a = requests.adapters.HTTPAdapter(max_retries=3)
+      >>> s.mount('http://', a)
+    """
+    __attrs__ = ['max_retries', 'config', '_pool_connections', '_pool_maxsize',
+                 '_pool_block']
+
+    def __init__(self, pool_connections=DEFAULT_POOLSIZE,
+                 pool_maxsize=DEFAULT_POOLSIZE, max_retries=DEFAULT_RETRIES,
+                 pool_block=DEFAULT_POOLBLOCK):
+        if max_retries == DEFAULT_RETRIES:
+            self.max_retries = Retry(0, read=False)
+        else:
+            self.max_retries = Retry.from_int(max_retries)
+        self.config = {}
+        self.proxy_manager = {}
+
+        super(HTTPAdapter, self).__init__()
+
+        self._pool_connections = pool_connections
+        self._pool_maxsize = pool_maxsize
+        self._pool_block = pool_block
+
+        self.init_poolmanager(pool_connections, pool_maxsize, block=pool_block)
+
+    def __getstate__(self):
+        return {attr: getattr(self, attr, None) for attr in self.__attrs__}
+
+    def __setstate__(self, state):
+        # Can't handle by adding 'proxy_manager' to self.__attrs__ because
+        # self.poolmanager uses a lambda function, which isn't pickleable.
+        self.proxy_manager = {}
+        self.config = {}
+
+        for attr, value in state.items():
+            setattr(self, attr, value)
+
+        self.init_poolmanager(self._pool_connections, self._pool_maxsize,
+                              block=self._pool_block)
+
+    def init_poolmanager(self, connections, maxsize, block=DEFAULT_POOLBLOCK, **pool_kwargs):
+        """Initializes a urllib3 PoolManager.
+
+        This method should not be called from user code, and is only
+        exposed for use when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param connections: The number of urllib3 connection pools to cache.
+        :param maxsize: The maximum number of connections to save in the pool.
+        :param block: Block when no free connections are available.
+        :param pool_kwargs: Extra keyword arguments used to initialize the Pool Manager.
+        """
+        # save these values for pickling
+        self._pool_connections = connections
+        self._pool_maxsize = maxsize
+        self._pool_block = block
+
+        self.poolmanager = PoolManager(num_pools=connections, maxsize=maxsize,
+                                       block=block, strict=True, **pool_kwargs)
+
+    def proxy_manager_for(self, proxy, **proxy_kwargs):
+        """Return urllib3 ProxyManager for the given proxy.
+
+        This method should not be called from user code, and is only
+        exposed for use when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param proxy: The proxy to return a urllib3 ProxyManager for.
+        :param proxy_kwargs: Extra keyword arguments used to configure the Proxy Manager.
+        :returns: ProxyManager
+        :rtype: urllib3.ProxyManager
+        """
+        if proxy in self.proxy_manager:
+            manager = self.proxy_manager[proxy]
+        elif proxy.lower().startswith('socks'):
+            username, password = get_auth_from_url(proxy)
+            manager = self.proxy_manager[proxy] = SOCKSProxyManager(
+                proxy,
+                username=username,
+                password=password,
+                num_pools=self._pool_connections,
+                maxsize=self._pool_maxsize,
+                block=self._pool_block,
+                **proxy_kwargs
+            )
+        else:
+            proxy_headers = self.proxy_headers(proxy)
+            manager = self.proxy_manager[proxy] = proxy_from_url(
+                proxy,
+                proxy_headers=proxy_headers,
+                num_pools=self._pool_connections,
+                maxsize=self._pool_maxsize,
+                block=self._pool_block,
+                **proxy_kwargs)
+
+        return manager
+
+    def cert_verify(self, conn, url, verify, cert):
+        """Verify a SSL certificate. This method should not be called from user
+        code, and is only exposed for use when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param conn: The urllib3 connection object associated with the cert.
+        :param url: The requested URL.
+        :param verify: Either a boolean, in which case it controls whether we verify
+            the server's TLS certificate, or a string, in which case it must be a path
+            to a CA bundle to use
+        :param cert: The SSL certificate to verify.
+        """
+        if url.lower().startswith('https') and verify:
+
+            cert_loc = None
+
+            # Allow self-specified cert location.
+            if verify is not True:
+                cert_loc = verify
+
+            if not cert_loc:
+                cert_loc = extract_zipped_paths(DEFAULT_CA_BUNDLE_PATH)
+
+            if not cert_loc or not os.path.exists(cert_loc):
+                raise IOError("Could not find a suitable TLS CA certificate bundle, "
+                              "invalid path: {}".format(cert_loc))
+
+            conn.cert_reqs = 'CERT_REQUIRED'
+
+            if not os.path.isdir(cert_loc):
+                conn.ca_certs = cert_loc
+            else:
+                conn.ca_cert_dir = cert_loc
+        else:
+            conn.cert_reqs = 'CERT_NONE'
+            conn.ca_certs = None
+            conn.ca_cert_dir = None
+
+        if cert:
+            if not isinstance(cert, basestring):
+                conn.cert_file = cert[0]
+                conn.key_file = cert[1]
+            else:
+                conn.cert_file = cert
+                conn.key_file = None
+            if conn.cert_file and not os.path.exists(conn.cert_file):
+                raise IOError("Could not find the TLS certificate file, "
+                              "invalid path: {}".format(conn.cert_file))
+            if conn.key_file and not os.path.exists(conn.key_file):
+                raise IOError("Could not find the TLS key file, "
+                              "invalid path: {}".format(conn.key_file))
+
+    def build_response(self, req, resp):
+        """Builds a :class:`Response <requests.Response>` object from a urllib3
+        response. This should not be called from user code, and is only exposed
+        for use when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`
+
+        :param req: The :class:`PreparedRequest <PreparedRequest>` used to generate the response.
+        :param resp: The urllib3 response object.
+        :rtype: requests.Response
+        """
+        response = Response()
+
+        # Fallback to None if there's no status_code, for whatever reason.
+        response.status_code = getattr(resp, 'status', None)
+
+        # Make headers case-insensitive.
+        response.headers = CaseInsensitiveDict(getattr(resp, 'headers', {}))
+
+        # Set encoding.
+        response.encoding = get_encoding_from_headers(response.headers)
+        response.raw = resp
+        response.reason = response.raw.reason
+
+        if isinstance(req.url, bytes):
+            response.url = req.url.decode('utf-8')
+        else:
+            response.url = req.url
+
+        # Add new cookies from the server.
+        extract_cookies_to_jar(response.cookies, req, resp)
+
+        # Give the Response some context.
+        response.request = req
+        response.connection = self
+
+        return response
+
+    def get_connection(self, url, proxies=None):
+        """Returns a urllib3 connection for the given URL. This should not be
+        called from user code, and is only exposed for use when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param url: The URL to connect to.
+        :param proxies: (optional) A Requests-style dictionary of proxies used on this request.
+        :rtype: urllib3.ConnectionPool
+        """
+        proxy = select_proxy(url, proxies)
+
+        if proxy:
+            proxy = prepend_scheme_if_needed(proxy, 'http')
+            proxy_url = parse_url(proxy)
+            if not proxy_url.host:
+                raise InvalidProxyURL("Please check proxy URL. It is malformed"
+                                      " and could be missing the host.")
+            proxy_manager = self.proxy_manager_for(proxy)
+            conn = proxy_manager.connection_from_url(url)
+        else:
+            # Only scheme should be lower case
+            parsed = urlparse(url)
+            url = parsed.geturl()
+            conn = self.poolmanager.connection_from_url(url)
+
+        return conn
+
+    def close(self):
+        """Disposes of any internal state.
+
+        Currently, this closes the PoolManager and any active ProxyManager,
+        which closes any pooled connections.
+        """
+        self.poolmanager.clear()
+        for proxy in self.proxy_manager.values():
+            proxy.clear()
+
+    def request_url(self, request, proxies):
+        """Obtain the url to use when making the final request.
+
+        If the message is being sent through a HTTP proxy, the full URL has to
+        be used. Otherwise, we should only use the path portion of the URL.
+
+        This should not be called from user code, and is only exposed for use
+        when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param request: The :class:`PreparedRequest <PreparedRequest>` being sent.
+        :param proxies: A dictionary of schemes or schemes and hosts to proxy URLs.
+        :rtype: str
+        """
+        proxy = select_proxy(request.url, proxies)
+        scheme = urlparse(request.url).scheme
+
+        is_proxied_http_request = (proxy and scheme != 'https')
+        using_socks_proxy = False
+        if proxy:
+            proxy_scheme = urlparse(proxy).scheme.lower()
+            using_socks_proxy = proxy_scheme.startswith('socks')
+
+        url = request.path_url
+        if is_proxied_http_request and not using_socks_proxy:
+            url = urldefragauth(request.url)
+
+        return url
+
+    def add_headers(self, request, **kwargs):
+        """Add any headers needed by the connection. As of v2.0 this does
+        nothing by default, but is left for overriding by users that subclass
+        the :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        This should not be called from user code, and is only exposed for use
+        when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param request: The :class:`PreparedRequest <PreparedRequest>` to add headers to.
+        :param kwargs: The keyword arguments from the call to send().
+        """
+        pass
+
+    def proxy_headers(self, proxy):
+        """Returns a dictionary of the headers to add to any request sent
+        through a proxy. This works with urllib3 magic to ensure that they are
+        correctly sent to the proxy, rather than in a tunnelled request if
+        CONNECT is being used.
+
+        This should not be called from user code, and is only exposed for use
+        when subclassing the
+        :class:`HTTPAdapter <requests.adapters.HTTPAdapter>`.
+
+        :param proxy: The url of the proxy being used for this request.
+        :rtype: dict
+        """
+        headers = {}
+        username, password = get_auth_from_url(proxy)
+
+        if username:
+            headers['Proxy-Authorization'] = _basic_auth_str(username,
+                                                             password)
+
+        return headers
+
+    def send(self, request, stream=False, timeout=None, verify=True, cert=None, proxies=None):
+        """Sends PreparedRequest object. Returns Response object.
+
+        :param request: The :class:`PreparedRequest <PreparedRequest>` being sent.
+        :param stream: (optional) Whether to stream the request content.
+        :param timeout: (optional) How long to wait for the server to send
+            data before giving up, as a float, or a :ref:`(connect timeout,
+            read timeout) <timeouts>` tuple.
+        :type timeout: float or tuple or urllib3 Timeout object
+        :param verify: (optional) Either a boolean, in which case it controls whether
+            we verify the server's TLS certificate, or a string, in which case it
+            must be a path to a CA bundle to use
+        :param cert: (optional) Any user-provided SSL certificate to be trusted.
+        :param proxies: (optional) The proxies dictionary to apply to the request.
+        :rtype: requests.Response
+        """
+
+        try:
+            conn = self.get_connection(request.url, proxies)
+        except LocationValueError as e:
+            raise InvalidURL(e, request=request)
+
+        self.cert_verify(conn, request.url, verify, cert)
+        url = self.request_url(request, proxies)
+        self.add_headers(request, stream=stream, timeout=timeout, verify=verify, cert=cert, proxies=proxies)
+
+        chunked = not (request.body is None or 'Content-Length' in request.headers)
+
+        if isinstance(timeout, tuple):
+            try:
+                connect, read = timeout
+                timeout = TimeoutSauce(connect=connect, read=read)
+            except ValueError as e:
+                # this may raise a string formatting error.
+                err = ("Invalid timeout {}. Pass a (connect, read) "
+                       "timeout tuple, or a single float to set "
+                       "both timeouts to the same value".format(timeout))
+                raise ValueError(err)
+        elif isinstance(timeout, TimeoutSauce):
+            pass
+        else:
+            timeout = TimeoutSauce(connect=timeout, read=timeout)
+
+        try:
+            if not chunked:
+                resp = conn.urlopen(
+                    method=request.method,
+                    url=url,
+                    body=request.body,
+                    headers=request.headers,
+                    redirect=False,
+                    assert_same_host=False,
+                    preload_content=False,
+                    decode_content=False,
+                    retries=self.max_retries,
+                    timeout=timeout
+                )
+
+            # Send the request.
+            else:
+                if hasattr(conn, 'proxy_pool'):
+                    conn = conn.proxy_pool
+
+                low_conn = conn._get_conn(timeout=DEFAULT_POOL_TIMEOUT)
+
+                try:
+                    low_conn.putrequest(request.method,
+                                        url,
+                                        skip_accept_encoding=True)
+
+                    for header, value in request.headers.items():
+                        low_conn.putheader(header, value)
+
+                    low_conn.endheaders()
+
+                    for i in request.body:
+                        low_conn.send(hex(len(i))[2:].encode('utf-8'))
+                        low_conn.send(b'\r\n')
+                        low_conn.send(i)
+                        low_conn.send(b'\r\n')
+                    low_conn.send(b'0\r\n\r\n')
+
+                    # Receive the response from the server
+                    try:
+                        # For Python 2.7, use buffering of HTTP responses
+                        r = low_conn.getresponse(buffering=True)
+                    except TypeError:
+                        # For compatibility with Python 3.3+
+                        r = low_conn.getresponse()
+
+                    resp = HTTPResponse.from_httplib(
+                        r,
+                        pool=conn,
+                        connection=low_conn,
+                        preload_content=False,
+                        decode_content=False
+                    )
+                except:
+                    # If we hit any problems here, clean up the connection.
+                    # Then, reraise so that we can handle the actual exception.
+                    low_conn.close()
+                    raise
+
+        except (ProtocolError, socket.error) as err:
+            raise ConnectionError(err, request=request)
+
+        except MaxRetryError as e:
+            if isinstance(e.reason, ConnectTimeoutError):
+                # TODO: Remove this in 3.0.0: see #2811
+                if not isinstance(e.reason, NewConnectionError):
+                    raise ConnectTimeout(e, request=request)
+
+            if isinstance(e.reason, ResponseError):
+                raise RetryError(e, request=request)
+
+            if isinstance(e.reason, _ProxyError):
+                raise ProxyError(e, request=request)
+
+            if isinstance(e.reason, _SSLError):
+                # This branch is for urllib3 v1.22 and later.
+                raise SSLError(e, request=request)
+
+            raise ConnectionError(e, request=request)
+
+        except ClosedPoolError as e:
+            raise ConnectionError(e, request=request)
+
+        except _ProxyError as e:
+            raise ProxyError(e)
+
+        except (_SSLError, _HTTPError) as e:
+            if isinstance(e, _SSLError):
+                # This branch is for urllib3 versions earlier than v1.22
+                raise SSLError(e, request=request)
+            elif isinstance(e, ReadTimeoutError):
+                raise ReadTimeout(e, request=request)
+            else:
+                raise
+
+        return self.build_response(request, resp)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/api.py b/venv/Lib/site-packages/pip/_vendor/requests/api.py
new file mode 100644
index 000000000..e978e2031
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/api.py
@@ -0,0 +1,161 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.api
+~~~~~~~~~~~~
+
+This module implements the Requests API.
+
+:copyright: (c) 2012 by Kenneth Reitz.
+:license: Apache2, see LICENSE for more details.
+"""
+
+from . import sessions
+
+
+def request(method, url, **kwargs):
+    """Constructs and sends a :class:`Request <Request>`.
+
+    :param method: method for the new :class:`Request` object: ``GET``, ``OPTIONS``, ``HEAD``, ``POST``, ``PUT``, ``PATCH``, or ``DELETE``.
+    :param url: URL for the new :class:`Request` object.
+    :param params: (optional) Dictionary, list of tuples or bytes to send
+        in the query string for the :class:`Request`.
+    :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+        object to send in the body of the :class:`Request`.
+    :param json: (optional) A JSON serializable Python object to send in the body of the :class:`Request`.
+    :param headers: (optional) Dictionary of HTTP Headers to send with the :class:`Request`.
+    :param cookies: (optional) Dict or CookieJar object to send with the :class:`Request`.
+    :param files: (optional) Dictionary of ``'name': file-like-objects`` (or ``{'name': file-tuple}``) for multipart encoding upload.
+        ``file-tuple`` can be a 2-tuple ``('filename', fileobj)``, 3-tuple ``('filename', fileobj, 'content_type')``
+        or a 4-tuple ``('filename', fileobj, 'content_type', custom_headers)``, where ``'content-type'`` is a string
+        defining the content type of the given file and ``custom_headers`` a dict-like object containing additional headers
+        to add for the file.
+    :param auth: (optional) Auth tuple to enable Basic/Digest/Custom HTTP Auth.
+    :param timeout: (optional) How many seconds to wait for the server to send data
+        before giving up, as a float, or a :ref:`(connect timeout, read
+        timeout) <timeouts>` tuple.
+    :type timeout: float or tuple
+    :param allow_redirects: (optional) Boolean. Enable/disable GET/OPTIONS/POST/PUT/PATCH/DELETE/HEAD redirection. Defaults to ``True``.
+    :type allow_redirects: bool
+    :param proxies: (optional) Dictionary mapping protocol to the URL of the proxy.
+    :param verify: (optional) Either a boolean, in which case it controls whether we verify
+            the server's TLS certificate, or a string, in which case it must be a path
+            to a CA bundle to use. Defaults to ``True``.
+    :param stream: (optional) if ``False``, the response content will be immediately downloaded.
+    :param cert: (optional) if String, path to ssl client cert file (.pem). If Tuple, ('cert', 'key') pair.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+
+    Usage::
+
+      >>> import requests
+      >>> req = requests.request('GET', 'https://httpbin.org/get')
+      >>> req
+      <Response [200]>
+    """
+
+    # By using the 'with' statement we are sure the session is closed, thus we
+    # avoid leaving sockets open which can trigger a ResourceWarning in some
+    # cases, and look like a memory leak in others.
+    with sessions.Session() as session:
+        return session.request(method=method, url=url, **kwargs)
+
+
+def get(url, params=None, **kwargs):
+    r"""Sends a GET request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param params: (optional) Dictionary, list of tuples or bytes to send
+        in the query string for the :class:`Request`.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    kwargs.setdefault('allow_redirects', True)
+    return request('get', url, params=params, **kwargs)
+
+
+def options(url, **kwargs):
+    r"""Sends an OPTIONS request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    kwargs.setdefault('allow_redirects', True)
+    return request('options', url, **kwargs)
+
+
+def head(url, **kwargs):
+    r"""Sends a HEAD request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param \*\*kwargs: Optional arguments that ``request`` takes. If
+        `allow_redirects` is not provided, it will be set to `False` (as
+        opposed to the default :meth:`request` behavior).
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    kwargs.setdefault('allow_redirects', False)
+    return request('head', url, **kwargs)
+
+
+def post(url, data=None, json=None, **kwargs):
+    r"""Sends a POST request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+        object to send in the body of the :class:`Request`.
+    :param json: (optional) json data to send in the body of the :class:`Request`.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    return request('post', url, data=data, json=json, **kwargs)
+
+
+def put(url, data=None, **kwargs):
+    r"""Sends a PUT request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+        object to send in the body of the :class:`Request`.
+    :param json: (optional) json data to send in the body of the :class:`Request`.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    return request('put', url, data=data, **kwargs)
+
+
+def patch(url, data=None, **kwargs):
+    r"""Sends a PATCH request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+        object to send in the body of the :class:`Request`.
+    :param json: (optional) json data to send in the body of the :class:`Request`.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    return request('patch', url, data=data, **kwargs)
+
+
+def delete(url, **kwargs):
+    r"""Sends a DELETE request.
+
+    :param url: URL for the new :class:`Request` object.
+    :param \*\*kwargs: Optional arguments that ``request`` takes.
+    :return: :class:`Response <Response>` object
+    :rtype: requests.Response
+    """
+
+    return request('delete', url, **kwargs)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/auth.py b/venv/Lib/site-packages/pip/_vendor/requests/auth.py
new file mode 100644
index 000000000..eeface39a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/auth.py
@@ -0,0 +1,305 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.auth
+~~~~~~~~~~~~~
+
+This module contains the authentication handlers for Requests.
+"""
+
+import os
+import re
+import time
+import hashlib
+import threading
+import warnings
+
+from base64 import b64encode
+
+from .compat import urlparse, str, basestring
+from .cookies import extract_cookies_to_jar
+from ._internal_utils import to_native_string
+from .utils import parse_dict_header
+
+CONTENT_TYPE_FORM_URLENCODED = 'application/x-www-form-urlencoded'
+CONTENT_TYPE_MULTI_PART = 'multipart/form-data'
+
+
+def _basic_auth_str(username, password):
+    """Returns a Basic Auth string."""
+
+    # "I want us to put a big-ol' comment on top of it that
+    # says that this behaviour is dumb but we need to preserve
+    # it because people are relying on it."
+    #    - Lukasa
+    #
+    # These are here solely to maintain backwards compatibility
+    # for things like ints. This will be removed in 3.0.0.
+    if not isinstance(username, basestring):
+        warnings.warn(
+            "Non-string usernames will no longer be supported in Requests "
+            "3.0.0. Please convert the object you've passed in ({!r}) to "
+            "a string or bytes object in the near future to avoid "
+            "problems.".format(username),
+            category=DeprecationWarning,
+        )
+        username = str(username)
+
+    if not isinstance(password, basestring):
+        warnings.warn(
+            "Non-string passwords will no longer be supported in Requests "
+            "3.0.0. Please convert the object you've passed in ({!r}) to "
+            "a string or bytes object in the near future to avoid "
+            "problems.".format(type(password)),
+            category=DeprecationWarning,
+        )
+        password = str(password)
+    # -- End Removal --
+
+    if isinstance(username, str):
+        username = username.encode('latin1')
+
+    if isinstance(password, str):
+        password = password.encode('latin1')
+
+    authstr = 'Basic ' + to_native_string(
+        b64encode(b':'.join((username, password))).strip()
+    )
+
+    return authstr
+
+
+class AuthBase(object):
+    """Base class that all auth implementations derive from"""
+
+    def __call__(self, r):
+        raise NotImplementedError('Auth hooks must be callable.')
+
+
+class HTTPBasicAuth(AuthBase):
+    """Attaches HTTP Basic Authentication to the given Request object."""
+
+    def __init__(self, username, password):
+        self.username = username
+        self.password = password
+
+    def __eq__(self, other):
+        return all([
+            self.username == getattr(other, 'username', None),
+            self.password == getattr(other, 'password', None)
+        ])
+
+    def __ne__(self, other):
+        return not self == other
+
+    def __call__(self, r):
+        r.headers['Authorization'] = _basic_auth_str(self.username, self.password)
+        return r
+
+
+class HTTPProxyAuth(HTTPBasicAuth):
+    """Attaches HTTP Proxy Authentication to a given Request object."""
+
+    def __call__(self, r):
+        r.headers['Proxy-Authorization'] = _basic_auth_str(self.username, self.password)
+        return r
+
+
+class HTTPDigestAuth(AuthBase):
+    """Attaches HTTP Digest Authentication to the given Request object."""
+
+    def __init__(self, username, password):
+        self.username = username
+        self.password = password
+        # Keep state in per-thread local storage
+        self._thread_local = threading.local()
+
+    def init_per_thread_state(self):
+        # Ensure state is initialized just once per-thread
+        if not hasattr(self._thread_local, 'init'):
+            self._thread_local.init = True
+            self._thread_local.last_nonce = ''
+            self._thread_local.nonce_count = 0
+            self._thread_local.chal = {}
+            self._thread_local.pos = None
+            self._thread_local.num_401_calls = None
+
+    def build_digest_header(self, method, url):
+        """
+        :rtype: str
+        """
+
+        realm = self._thread_local.chal['realm']
+        nonce = self._thread_local.chal['nonce']
+        qop = self._thread_local.chal.get('qop')
+        algorithm = self._thread_local.chal.get('algorithm')
+        opaque = self._thread_local.chal.get('opaque')
+        hash_utf8 = None
+
+        if algorithm is None:
+            _algorithm = 'MD5'
+        else:
+            _algorithm = algorithm.upper()
+        # lambdas assume digest modules are imported at the top level
+        if _algorithm == 'MD5' or _algorithm == 'MD5-SESS':
+            def md5_utf8(x):
+                if isinstance(x, str):
+                    x = x.encode('utf-8')
+                return hashlib.md5(x).hexdigest()
+            hash_utf8 = md5_utf8
+        elif _algorithm == 'SHA':
+            def sha_utf8(x):
+                if isinstance(x, str):
+                    x = x.encode('utf-8')
+                return hashlib.sha1(x).hexdigest()
+            hash_utf8 = sha_utf8
+        elif _algorithm == 'SHA-256':
+            def sha256_utf8(x):
+                if isinstance(x, str):
+                    x = x.encode('utf-8')
+                return hashlib.sha256(x).hexdigest()
+            hash_utf8 = sha256_utf8
+        elif _algorithm == 'SHA-512':
+            def sha512_utf8(x):
+                if isinstance(x, str):
+                    x = x.encode('utf-8')
+                return hashlib.sha512(x).hexdigest()
+            hash_utf8 = sha512_utf8
+
+        KD = lambda s, d: hash_utf8("%s:%s" % (s, d))
+
+        if hash_utf8 is None:
+            return None
+
+        # XXX not implemented yet
+        entdig = None
+        p_parsed = urlparse(url)
+        #: path is request-uri defined in RFC 2616 which should not be empty
+        path = p_parsed.path or "/"
+        if p_parsed.query:
+            path += '?' + p_parsed.query
+
+        A1 = '%s:%s:%s' % (self.username, realm, self.password)
+        A2 = '%s:%s' % (method, path)
+
+        HA1 = hash_utf8(A1)
+        HA2 = hash_utf8(A2)
+
+        if nonce == self._thread_local.last_nonce:
+            self._thread_local.nonce_count += 1
+        else:
+            self._thread_local.nonce_count = 1
+        ncvalue = '%08x' % self._thread_local.nonce_count
+        s = str(self._thread_local.nonce_count).encode('utf-8')
+        s += nonce.encode('utf-8')
+        s += time.ctime().encode('utf-8')
+        s += os.urandom(8)
+
+        cnonce = (hashlib.sha1(s).hexdigest()[:16])
+        if _algorithm == 'MD5-SESS':
+            HA1 = hash_utf8('%s:%s:%s' % (HA1, nonce, cnonce))
+
+        if not qop:
+            respdig = KD(HA1, "%s:%s" % (nonce, HA2))
+        elif qop == 'auth' or 'auth' in qop.split(','):
+            noncebit = "%s:%s:%s:%s:%s" % (
+                nonce, ncvalue, cnonce, 'auth', HA2
+            )
+            respdig = KD(HA1, noncebit)
+        else:
+            # XXX handle auth-int.
+            return None
+
+        self._thread_local.last_nonce = nonce
+
+        # XXX should the partial digests be encoded too?
+        base = 'username="%s", realm="%s", nonce="%s", uri="%s", ' \
+               'response="%s"' % (self.username, realm, nonce, path, respdig)
+        if opaque:
+            base += ', opaque="%s"' % opaque
+        if algorithm:
+            base += ', algorithm="%s"' % algorithm
+        if entdig:
+            base += ', digest="%s"' % entdig
+        if qop:
+            base += ', qop="auth", nc=%s, cnonce="%s"' % (ncvalue, cnonce)
+
+        return 'Digest %s' % (base)
+
+    def handle_redirect(self, r, **kwargs):
+        """Reset num_401_calls counter on redirects."""
+        if r.is_redirect:
+            self._thread_local.num_401_calls = 1
+
+    def handle_401(self, r, **kwargs):
+        """
+        Takes the given response and tries digest-auth, if needed.
+
+        :rtype: requests.Response
+        """
+
+        # If response is not 4xx, do not auth
+        # See https://github.com/psf/requests/issues/3772
+        if not 400 <= r.status_code < 500:
+            self._thread_local.num_401_calls = 1
+            return r
+
+        if self._thread_local.pos is not None:
+            # Rewind the file position indicator of the body to where
+            # it was to resend the request.
+            r.request.body.seek(self._thread_local.pos)
+        s_auth = r.headers.get('www-authenticate', '')
+
+        if 'digest' in s_auth.lower() and self._thread_local.num_401_calls < 2:
+
+            self._thread_local.num_401_calls += 1
+            pat = re.compile(r'digest ', flags=re.IGNORECASE)
+            self._thread_local.chal = parse_dict_header(pat.sub('', s_auth, count=1))
+
+            # Consume content and release the original connection
+            # to allow our new request to reuse the same one.
+            r.content
+            r.close()
+            prep = r.request.copy()
+            extract_cookies_to_jar(prep._cookies, r.request, r.raw)
+            prep.prepare_cookies(prep._cookies)
+
+            prep.headers['Authorization'] = self.build_digest_header(
+                prep.method, prep.url)
+            _r = r.connection.send(prep, **kwargs)
+            _r.history.append(r)
+            _r.request = prep
+
+            return _r
+
+        self._thread_local.num_401_calls = 1
+        return r
+
+    def __call__(self, r):
+        # Initialize per-thread state, if needed
+        self.init_per_thread_state()
+        # If we have a saved nonce, skip the 401
+        if self._thread_local.last_nonce:
+            r.headers['Authorization'] = self.build_digest_header(r.method, r.url)
+        try:
+            self._thread_local.pos = r.body.tell()
+        except AttributeError:
+            # In the case of HTTPDigestAuth being reused and the body of
+            # the previous request was a file-like object, pos has the
+            # file position of the previous body. Ensure it's set to
+            # None.
+            self._thread_local.pos = None
+        r.register_hook('response', self.handle_401)
+        r.register_hook('response', self.handle_redirect)
+        self._thread_local.num_401_calls = 1
+
+        return r
+
+    def __eq__(self, other):
+        return all([
+            self.username == getattr(other, 'username', None),
+            self.password == getattr(other, 'password', None)
+        ])
+
+    def __ne__(self, other):
+        return not self == other
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/certs.py b/venv/Lib/site-packages/pip/_vendor/requests/certs.py
new file mode 100644
index 000000000..06a594e58
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/certs.py
@@ -0,0 +1,18 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+
+"""
+requests.certs
+~~~~~~~~~~~~~~
+
+This module returns the preferred default CA certificate bundle. There is
+only one — the one from the certifi package.
+
+If you are packaging Requests, e.g., for a Linux distribution or a managed
+environment, you can change the definition of where() to return a separately
+packaged CA bundle.
+"""
+from pip._vendor.certifi import where
+
+if __name__ == '__main__':
+    print(where())
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/compat.py b/venv/Lib/site-packages/pip/_vendor/requests/compat.py
new file mode 100644
index 000000000..9e2937167
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/compat.py
@@ -0,0 +1,76 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.compat
+~~~~~~~~~~~~~~~
+
+This module handles import compatibility issues between Python 2 and
+Python 3.
+"""
+
+from pip._vendor import chardet
+
+import sys
+
+# -------
+# Pythons
+# -------
+
+# Syntax sugar.
+_ver = sys.version_info
+
+#: Python 2.x?
+is_py2 = (_ver[0] == 2)
+
+#: Python 3.x?
+is_py3 = (_ver[0] == 3)
+
+# Note: We've patched out simplejson support in pip because it prevents
+#       upgrading simplejson on Windows.
+# try:
+#     import simplejson as json
+# except (ImportError, SyntaxError):
+#     # simplejson does not support Python 3.2, it throws a SyntaxError
+#     # because of u'...' Unicode literals.
+import json
+
+# ---------
+# Specifics
+# ---------
+
+if is_py2:
+    from urllib import (
+        quote, unquote, quote_plus, unquote_plus, urlencode, getproxies,
+        proxy_bypass, proxy_bypass_environment, getproxies_environment)
+    from urlparse import urlparse, urlunparse, urljoin, urlsplit, urldefrag
+    from urllib2 import parse_http_list
+    import cookielib
+    from Cookie import Morsel
+    from StringIO import StringIO
+    # Keep OrderedDict for backwards compatibility.
+    from collections import Callable, Mapping, MutableMapping, OrderedDict
+
+
+    builtin_str = str
+    bytes = str
+    str = unicode
+    basestring = basestring
+    numeric_types = (int, long, float)
+    integer_types = (int, long)
+
+elif is_py3:
+    from urllib.parse import urlparse, urlunparse, urljoin, urlsplit, urlencode, quote, unquote, quote_plus, unquote_plus, urldefrag
+    from urllib.request import parse_http_list, getproxies, proxy_bypass, proxy_bypass_environment, getproxies_environment
+    from http import cookiejar as cookielib
+    from http.cookies import Morsel
+    from io import StringIO
+    # Keep OrderedDict for backwards compatibility.
+    from collections import OrderedDict
+    from collections.abc import Callable, Mapping, MutableMapping
+
+    builtin_str = str
+    str = str
+    bytes = bytes
+    basestring = (str, bytes)
+    numeric_types = (int, float)
+    integer_types = (int,)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/cookies.py b/venv/Lib/site-packages/pip/_vendor/requests/cookies.py
new file mode 100644
index 000000000..56fccd9c2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/cookies.py
@@ -0,0 +1,549 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.cookies
+~~~~~~~~~~~~~~~~
+
+Compatibility code to be able to use `cookielib.CookieJar` with requests.
+
+requests.utils imports from here, so be careful with imports.
+"""
+
+import copy
+import time
+import calendar
+
+from ._internal_utils import to_native_string
+from .compat import cookielib, urlparse, urlunparse, Morsel, MutableMapping
+
+try:
+    import threading
+except ImportError:
+    import dummy_threading as threading
+
+
+class MockRequest(object):
+    """Wraps a `requests.Request` to mimic a `urllib2.Request`.
+
+    The code in `cookielib.CookieJar` expects this interface in order to correctly
+    manage cookie policies, i.e., determine whether a cookie can be set, given the
+    domains of the request and the cookie.
+
+    The original request object is read-only. The client is responsible for collecting
+    the new headers via `get_new_headers()` and interpreting them appropriately. You
+    probably want `get_cookie_header`, defined below.
+    """
+
+    def __init__(self, request):
+        self._r = request
+        self._new_headers = {}
+        self.type = urlparse(self._r.url).scheme
+
+    def get_type(self):
+        return self.type
+
+    def get_host(self):
+        return urlparse(self._r.url).netloc
+
+    def get_origin_req_host(self):
+        return self.get_host()
+
+    def get_full_url(self):
+        # Only return the response's URL if the user hadn't set the Host
+        # header
+        if not self._r.headers.get('Host'):
+            return self._r.url
+        # If they did set it, retrieve it and reconstruct the expected domain
+        host = to_native_string(self._r.headers['Host'], encoding='utf-8')
+        parsed = urlparse(self._r.url)
+        # Reconstruct the URL as we expect it
+        return urlunparse([
+            parsed.scheme, host, parsed.path, parsed.params, parsed.query,
+            parsed.fragment
+        ])
+
+    def is_unverifiable(self):
+        return True
+
+    def has_header(self, name):
+        return name in self._r.headers or name in self._new_headers
+
+    def get_header(self, name, default=None):
+        return self._r.headers.get(name, self._new_headers.get(name, default))
+
+    def add_header(self, key, val):
+        """cookielib has no legitimate use for this method; add it back if you find one."""
+        raise NotImplementedError("Cookie headers should be added with add_unredirected_header()")
+
+    def add_unredirected_header(self, name, value):
+        self._new_headers[name] = value
+
+    def get_new_headers(self):
+        return self._new_headers
+
+    @property
+    def unverifiable(self):
+        return self.is_unverifiable()
+
+    @property
+    def origin_req_host(self):
+        return self.get_origin_req_host()
+
+    @property
+    def host(self):
+        return self.get_host()
+
+
+class MockResponse(object):
+    """Wraps a `httplib.HTTPMessage` to mimic a `urllib.addinfourl`.
+
+    ...what? Basically, expose the parsed HTTP headers from the server response
+    the way `cookielib` expects to see them.
+    """
+
+    def __init__(self, headers):
+        """Make a MockResponse for `cookielib` to read.
+
+        :param headers: a httplib.HTTPMessage or analogous carrying the headers
+        """
+        self._headers = headers
+
+    def info(self):
+        return self._headers
+
+    def getheaders(self, name):
+        self._headers.getheaders(name)
+
+
+def extract_cookies_to_jar(jar, request, response):
+    """Extract the cookies from the response into a CookieJar.
+
+    :param jar: cookielib.CookieJar (not necessarily a RequestsCookieJar)
+    :param request: our own requests.Request object
+    :param response: urllib3.HTTPResponse object
+    """
+    if not (hasattr(response, '_original_response') and
+            response._original_response):
+        return
+    # the _original_response field is the wrapped httplib.HTTPResponse object,
+    req = MockRequest(request)
+    # pull out the HTTPMessage with the headers and put it in the mock:
+    res = MockResponse(response._original_response.msg)
+    jar.extract_cookies(res, req)
+
+
+def get_cookie_header(jar, request):
+    """
+    Produce an appropriate Cookie header string to be sent with `request`, or None.
+
+    :rtype: str
+    """
+    r = MockRequest(request)
+    jar.add_cookie_header(r)
+    return r.get_new_headers().get('Cookie')
+
+
+def remove_cookie_by_name(cookiejar, name, domain=None, path=None):
+    """Unsets a cookie by name, by default over all domains and paths.
+
+    Wraps CookieJar.clear(), is O(n).
+    """
+    clearables = []
+    for cookie in cookiejar:
+        if cookie.name != name:
+            continue
+        if domain is not None and domain != cookie.domain:
+            continue
+        if path is not None and path != cookie.path:
+            continue
+        clearables.append((cookie.domain, cookie.path, cookie.name))
+
+    for domain, path, name in clearables:
+        cookiejar.clear(domain, path, name)
+
+
+class CookieConflictError(RuntimeError):
+    """There are two cookies that meet the criteria specified in the cookie jar.
+    Use .get and .set and include domain and path args in order to be more specific.
+    """
+
+
+class RequestsCookieJar(cookielib.CookieJar, MutableMapping):
+    """Compatibility class; is a cookielib.CookieJar, but exposes a dict
+    interface.
+
+    This is the CookieJar we create by default for requests and sessions that
+    don't specify one, since some clients may expect response.cookies and
+    session.cookies to support dict operations.
+
+    Requests does not use the dict interface internally; it's just for
+    compatibility with external client code. All requests code should work
+    out of the box with externally provided instances of ``CookieJar``, e.g.
+    ``LWPCookieJar`` and ``FileCookieJar``.
+
+    Unlike a regular CookieJar, this class is pickleable.
+
+    .. warning:: dictionary operations that are normally O(1) may be O(n).
+    """
+
+    def get(self, name, default=None, domain=None, path=None):
+        """Dict-like get() that also supports optional domain and path args in
+        order to resolve naming collisions from using one cookie jar over
+        multiple domains.
+
+        .. warning:: operation is O(n), not O(1).
+        """
+        try:
+            return self._find_no_duplicates(name, domain, path)
+        except KeyError:
+            return default
+
+    def set(self, name, value, **kwargs):
+        """Dict-like set() that also supports optional domain and path args in
+        order to resolve naming collisions from using one cookie jar over
+        multiple domains.
+        """
+        # support client code that unsets cookies by assignment of a None value:
+        if value is None:
+            remove_cookie_by_name(self, name, domain=kwargs.get('domain'), path=kwargs.get('path'))
+            return
+
+        if isinstance(value, Morsel):
+            c = morsel_to_cookie(value)
+        else:
+            c = create_cookie(name, value, **kwargs)
+        self.set_cookie(c)
+        return c
+
+    def iterkeys(self):
+        """Dict-like iterkeys() that returns an iterator of names of cookies
+        from the jar.
+
+        .. seealso:: itervalues() and iteritems().
+        """
+        for cookie in iter(self):
+            yield cookie.name
+
+    def keys(self):
+        """Dict-like keys() that returns a list of names of cookies from the
+        jar.
+
+        .. seealso:: values() and items().
+        """
+        return list(self.iterkeys())
+
+    def itervalues(self):
+        """Dict-like itervalues() that returns an iterator of values of cookies
+        from the jar.
+
+        .. seealso:: iterkeys() and iteritems().
+        """
+        for cookie in iter(self):
+            yield cookie.value
+
+    def values(self):
+        """Dict-like values() that returns a list of values of cookies from the
+        jar.
+
+        .. seealso:: keys() and items().
+        """
+        return list(self.itervalues())
+
+    def iteritems(self):
+        """Dict-like iteritems() that returns an iterator of name-value tuples
+        from the jar.
+
+        .. seealso:: iterkeys() and itervalues().
+        """
+        for cookie in iter(self):
+            yield cookie.name, cookie.value
+
+    def items(self):
+        """Dict-like items() that returns a list of name-value tuples from the
+        jar. Allows client-code to call ``dict(RequestsCookieJar)`` and get a
+        vanilla python dict of key value pairs.
+
+        .. seealso:: keys() and values().
+        """
+        return list(self.iteritems())
+
+    def list_domains(self):
+        """Utility method to list all the domains in the jar."""
+        domains = []
+        for cookie in iter(self):
+            if cookie.domain not in domains:
+                domains.append(cookie.domain)
+        return domains
+
+    def list_paths(self):
+        """Utility method to list all the paths in the jar."""
+        paths = []
+        for cookie in iter(self):
+            if cookie.path not in paths:
+                paths.append(cookie.path)
+        return paths
+
+    def multiple_domains(self):
+        """Returns True if there are multiple domains in the jar.
+        Returns False otherwise.
+
+        :rtype: bool
+        """
+        domains = []
+        for cookie in iter(self):
+            if cookie.domain is not None and cookie.domain in domains:
+                return True
+            domains.append(cookie.domain)
+        return False  # there is only one domain in jar
+
+    def get_dict(self, domain=None, path=None):
+        """Takes as an argument an optional domain and path and returns a plain
+        old Python dict of name-value pairs of cookies that meet the
+        requirements.
+
+        :rtype: dict
+        """
+        dictionary = {}
+        for cookie in iter(self):
+            if (
+                (domain is None or cookie.domain == domain) and
+                (path is None or cookie.path == path)
+            ):
+                dictionary[cookie.name] = cookie.value
+        return dictionary
+
+    def __contains__(self, name):
+        try:
+            return super(RequestsCookieJar, self).__contains__(name)
+        except CookieConflictError:
+            return True
+
+    def __getitem__(self, name):
+        """Dict-like __getitem__() for compatibility with client code. Throws
+        exception if there are more than one cookie with name. In that case,
+        use the more explicit get() method instead.
+
+        .. warning:: operation is O(n), not O(1).
+        """
+        return self._find_no_duplicates(name)
+
+    def __setitem__(self, name, value):
+        """Dict-like __setitem__ for compatibility with client code. Throws
+        exception if there is already a cookie of that name in the jar. In that
+        case, use the more explicit set() method instead.
+        """
+        self.set(name, value)
+
+    def __delitem__(self, name):
+        """Deletes a cookie given a name. Wraps ``cookielib.CookieJar``'s
+        ``remove_cookie_by_name()``.
+        """
+        remove_cookie_by_name(self, name)
+
+    def set_cookie(self, cookie, *args, **kwargs):
+        if hasattr(cookie.value, 'startswith') and cookie.value.startswith('"') and cookie.value.endswith('"'):
+            cookie.value = cookie.value.replace('\\"', '')
+        return super(RequestsCookieJar, self).set_cookie(cookie, *args, **kwargs)
+
+    def update(self, other):
+        """Updates this jar with cookies from another CookieJar or dict-like"""
+        if isinstance(other, cookielib.CookieJar):
+            for cookie in other:
+                self.set_cookie(copy.copy(cookie))
+        else:
+            super(RequestsCookieJar, self).update(other)
+
+    def _find(self, name, domain=None, path=None):
+        """Requests uses this method internally to get cookie values.
+
+        If there are conflicting cookies, _find arbitrarily chooses one.
+        See _find_no_duplicates if you want an exception thrown if there are
+        conflicting cookies.
+
+        :param name: a string containing name of cookie
+        :param domain: (optional) string containing domain of cookie
+        :param path: (optional) string containing path of cookie
+        :return: cookie.value
+        """
+        for cookie in iter(self):
+            if cookie.name == name:
+                if domain is None or cookie.domain == domain:
+                    if path is None or cookie.path == path:
+                        return cookie.value
+
+        raise KeyError('name=%r, domain=%r, path=%r' % (name, domain, path))
+
+    def _find_no_duplicates(self, name, domain=None, path=None):
+        """Both ``__get_item__`` and ``get`` call this function: it's never
+        used elsewhere in Requests.
+
+        :param name: a string containing name of cookie
+        :param domain: (optional) string containing domain of cookie
+        :param path: (optional) string containing path of cookie
+        :raises KeyError: if cookie is not found
+        :raises CookieConflictError: if there are multiple cookies
+            that match name and optionally domain and path
+        :return: cookie.value
+        """
+        toReturn = None
+        for cookie in iter(self):
+            if cookie.name == name:
+                if domain is None or cookie.domain == domain:
+                    if path is None or cookie.path == path:
+                        if toReturn is not None:  # if there are multiple cookies that meet passed in criteria
+                            raise CookieConflictError('There are multiple cookies with name, %r' % (name))
+                        toReturn = cookie.value  # we will eventually return this as long as no cookie conflict
+
+        if toReturn:
+            return toReturn
+        raise KeyError('name=%r, domain=%r, path=%r' % (name, domain, path))
+
+    def __getstate__(self):
+        """Unlike a normal CookieJar, this class is pickleable."""
+        state = self.__dict__.copy()
+        # remove the unpickleable RLock object
+        state.pop('_cookies_lock')
+        return state
+
+    def __setstate__(self, state):
+        """Unlike a normal CookieJar, this class is pickleable."""
+        self.__dict__.update(state)
+        if '_cookies_lock' not in self.__dict__:
+            self._cookies_lock = threading.RLock()
+
+    def copy(self):
+        """Return a copy of this RequestsCookieJar."""
+        new_cj = RequestsCookieJar()
+        new_cj.set_policy(self.get_policy())
+        new_cj.update(self)
+        return new_cj
+
+    def get_policy(self):
+        """Return the CookiePolicy instance used."""
+        return self._policy
+
+
+def _copy_cookie_jar(jar):
+    if jar is None:
+        return None
+
+    if hasattr(jar, 'copy'):
+        # We're dealing with an instance of RequestsCookieJar
+        return jar.copy()
+    # We're dealing with a generic CookieJar instance
+    new_jar = copy.copy(jar)
+    new_jar.clear()
+    for cookie in jar:
+        new_jar.set_cookie(copy.copy(cookie))
+    return new_jar
+
+
+def create_cookie(name, value, **kwargs):
+    """Make a cookie from underspecified parameters.
+
+    By default, the pair of `name` and `value` will be set for the domain ''
+    and sent on every request (this is sometimes called a "supercookie").
+    """
+    result = {
+        'version': 0,
+        'name': name,
+        'value': value,
+        'port': None,
+        'domain': '',
+        'path': '/',
+        'secure': False,
+        'expires': None,
+        'discard': True,
+        'comment': None,
+        'comment_url': None,
+        'rest': {'HttpOnly': None},
+        'rfc2109': False,
+    }
+
+    badargs = set(kwargs) - set(result)
+    if badargs:
+        err = 'create_cookie() got unexpected keyword arguments: %s'
+        raise TypeError(err % list(badargs))
+
+    result.update(kwargs)
+    result['port_specified'] = bool(result['port'])
+    result['domain_specified'] = bool(result['domain'])
+    result['domain_initial_dot'] = result['domain'].startswith('.')
+    result['path_specified'] = bool(result['path'])
+
+    return cookielib.Cookie(**result)
+
+
+def morsel_to_cookie(morsel):
+    """Convert a Morsel object into a Cookie containing the one k/v pair."""
+
+    expires = None
+    if morsel['max-age']:
+        try:
+            expires = int(time.time() + int(morsel['max-age']))
+        except ValueError:
+            raise TypeError('max-age: %s must be integer' % morsel['max-age'])
+    elif morsel['expires']:
+        time_template = '%a, %d-%b-%Y %H:%M:%S GMT'
+        expires = calendar.timegm(
+            time.strptime(morsel['expires'], time_template)
+        )
+    return create_cookie(
+        comment=morsel['comment'],
+        comment_url=bool(morsel['comment']),
+        discard=False,
+        domain=morsel['domain'],
+        expires=expires,
+        name=morsel.key,
+        path=morsel['path'],
+        port=None,
+        rest={'HttpOnly': morsel['httponly']},
+        rfc2109=False,
+        secure=bool(morsel['secure']),
+        value=morsel.value,
+        version=morsel['version'] or 0,
+    )
+
+
+def cookiejar_from_dict(cookie_dict, cookiejar=None, overwrite=True):
+    """Returns a CookieJar from a key/value dictionary.
+
+    :param cookie_dict: Dict of key/values to insert into CookieJar.
+    :param cookiejar: (optional) A cookiejar to add the cookies to.
+    :param overwrite: (optional) If False, will not replace cookies
+        already in the jar with new ones.
+    :rtype: CookieJar
+    """
+    if cookiejar is None:
+        cookiejar = RequestsCookieJar()
+
+    if cookie_dict is not None:
+        names_from_jar = [cookie.name for cookie in cookiejar]
+        for name in cookie_dict:
+            if overwrite or (name not in names_from_jar):
+                cookiejar.set_cookie(create_cookie(name, cookie_dict[name]))
+
+    return cookiejar
+
+
+def merge_cookies(cookiejar, cookies):
+    """Add cookies to cookiejar and returns a merged CookieJar.
+
+    :param cookiejar: CookieJar object to add the cookies to.
+    :param cookies: Dictionary or CookieJar object to be added.
+    :rtype: CookieJar
+    """
+    if not isinstance(cookiejar, cookielib.CookieJar):
+        raise ValueError('You can only merge into CookieJar')
+
+    if isinstance(cookies, dict):
+        cookiejar = cookiejar_from_dict(
+            cookies, cookiejar=cookiejar, overwrite=False)
+    elif isinstance(cookies, cookielib.CookieJar):
+        try:
+            cookiejar.update(cookies)
+        except AttributeError:
+            for cookie_in_jar in cookies:
+                cookiejar.set_cookie(cookie_in_jar)
+
+    return cookiejar
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/exceptions.py b/venv/Lib/site-packages/pip/_vendor/requests/exceptions.py
new file mode 100644
index 000000000..9ef9e6e97
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/exceptions.py
@@ -0,0 +1,123 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.exceptions
+~~~~~~~~~~~~~~~~~~~
+
+This module contains the set of Requests' exceptions.
+"""
+from pip._vendor.urllib3.exceptions import HTTPError as BaseHTTPError
+
+
+class RequestException(IOError):
+    """There was an ambiguous exception that occurred while handling your
+    request.
+    """
+
+    def __init__(self, *args, **kwargs):
+        """Initialize RequestException with `request` and `response` objects."""
+        response = kwargs.pop('response', None)
+        self.response = response
+        self.request = kwargs.pop('request', None)
+        if (response is not None and not self.request and
+                hasattr(response, 'request')):
+            self.request = self.response.request
+        super(RequestException, self).__init__(*args, **kwargs)
+
+
+class HTTPError(RequestException):
+    """An HTTP error occurred."""
+
+
+class ConnectionError(RequestException):
+    """A Connection error occurred."""
+
+
+class ProxyError(ConnectionError):
+    """A proxy error occurred."""
+
+
+class SSLError(ConnectionError):
+    """An SSL error occurred."""
+
+
+class Timeout(RequestException):
+    """The request timed out.
+
+    Catching this error will catch both
+    :exc:`~requests.exceptions.ConnectTimeout` and
+    :exc:`~requests.exceptions.ReadTimeout` errors.
+    """
+
+
+class ConnectTimeout(ConnectionError, Timeout):
+    """The request timed out while trying to connect to the remote server.
+
+    Requests that produced this error are safe to retry.
+    """
+
+
+class ReadTimeout(Timeout):
+    """The server did not send any data in the allotted amount of time."""
+
+
+class URLRequired(RequestException):
+    """A valid URL is required to make a request."""
+
+
+class TooManyRedirects(RequestException):
+    """Too many redirects."""
+
+
+class MissingSchema(RequestException, ValueError):
+    """The URL schema (e.g. http or https) is missing."""
+
+
+class InvalidSchema(RequestException, ValueError):
+    """See defaults.py for valid schemas."""
+
+
+class InvalidURL(RequestException, ValueError):
+    """The URL provided was somehow invalid."""
+
+
+class InvalidHeader(RequestException, ValueError):
+    """The header value provided was somehow invalid."""
+
+
+class InvalidProxyURL(InvalidURL):
+    """The proxy URL provided is invalid."""
+
+
+class ChunkedEncodingError(RequestException):
+    """The server declared chunked encoding but sent an invalid chunk."""
+
+
+class ContentDecodingError(RequestException, BaseHTTPError):
+    """Failed to decode response content."""
+
+
+class StreamConsumedError(RequestException, TypeError):
+    """The content for this response was already consumed."""
+
+
+class RetryError(RequestException):
+    """Custom retries logic failed"""
+
+
+class UnrewindableBodyError(RequestException):
+    """Requests encountered an error when trying to rewind a body."""
+
+# Warnings
+
+
+class RequestsWarning(Warning):
+    """Base warning for Requests."""
+
+
+class FileModeWarning(RequestsWarning, DeprecationWarning):
+    """A file was opened in text mode, but Requests determined its binary length."""
+
+
+class RequestsDependencyWarning(RequestsWarning):
+    """An imported dependency doesn't match the expected version range."""
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/help.py b/venv/Lib/site-packages/pip/_vendor/requests/help.py
new file mode 100644
index 000000000..3c3072ba1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/help.py
@@ -0,0 +1,119 @@
+"""Module containing bug report helper(s)."""
+from __future__ import print_function
+
+import json
+import platform
+import sys
+import ssl
+
+from pip._vendor import idna
+from pip._vendor import urllib3
+from pip._vendor import chardet
+
+from . import __version__ as requests_version
+
+try:
+    from pip._vendor.urllib3.contrib import pyopenssl
+except ImportError:
+    pyopenssl = None
+    OpenSSL = None
+    cryptography = None
+else:
+    import OpenSSL
+    import cryptography
+
+
+def _implementation():
+    """Return a dict with the Python implementation and version.
+
+    Provide both the name and the version of the Python implementation
+    currently running. For example, on CPython 2.7.5 it will return
+    {'name': 'CPython', 'version': '2.7.5'}.
+
+    This function works best on CPython and PyPy: in particular, it probably
+    doesn't work for Jython or IronPython. Future investigation should be done
+    to work out the correct shape of the code for those platforms.
+    """
+    implementation = platform.python_implementation()
+
+    if implementation == 'CPython':
+        implementation_version = platform.python_version()
+    elif implementation == 'PyPy':
+        implementation_version = '%s.%s.%s' % (sys.pypy_version_info.major,
+                                               sys.pypy_version_info.minor,
+                                               sys.pypy_version_info.micro)
+        if sys.pypy_version_info.releaselevel != 'final':
+            implementation_version = ''.join([
+                implementation_version, sys.pypy_version_info.releaselevel
+            ])
+    elif implementation == 'Jython':
+        implementation_version = platform.python_version()  # Complete Guess
+    elif implementation == 'IronPython':
+        implementation_version = platform.python_version()  # Complete Guess
+    else:
+        implementation_version = 'Unknown'
+
+    return {'name': implementation, 'version': implementation_version}
+
+
+def info():
+    """Generate information for a bug report."""
+    try:
+        platform_info = {
+            'system': platform.system(),
+            'release': platform.release(),
+        }
+    except IOError:
+        platform_info = {
+            'system': 'Unknown',
+            'release': 'Unknown',
+        }
+
+    implementation_info = _implementation()
+    urllib3_info = {'version': urllib3.__version__}
+    chardet_info = {'version': chardet.__version__}
+
+    pyopenssl_info = {
+        'version': None,
+        'openssl_version': '',
+    }
+    if OpenSSL:
+        pyopenssl_info = {
+            'version': OpenSSL.__version__,
+            'openssl_version': '%x' % OpenSSL.SSL.OPENSSL_VERSION_NUMBER,
+        }
+    cryptography_info = {
+        'version': getattr(cryptography, '__version__', ''),
+    }
+    idna_info = {
+        'version': getattr(idna, '__version__', ''),
+    }
+
+    system_ssl = ssl.OPENSSL_VERSION_NUMBER
+    system_ssl_info = {
+        'version': '%x' % system_ssl if system_ssl is not None else ''
+    }
+
+    return {
+        'platform': platform_info,
+        'implementation': implementation_info,
+        'system_ssl': system_ssl_info,
+        'using_pyopenssl': pyopenssl is not None,
+        'pyOpenSSL': pyopenssl_info,
+        'urllib3': urllib3_info,
+        'chardet': chardet_info,
+        'cryptography': cryptography_info,
+        'idna': idna_info,
+        'requests': {
+            'version': requests_version,
+        },
+    }
+
+
+def main():
+    """Pretty-print the bug information as JSON."""
+    print(json.dumps(info(), sort_keys=True, indent=2))
+
+
+if __name__ == '__main__':
+    main()
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/hooks.py b/venv/Lib/site-packages/pip/_vendor/requests/hooks.py
new file mode 100644
index 000000000..7a51f212c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/hooks.py
@@ -0,0 +1,34 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.hooks
+~~~~~~~~~~~~~~
+
+This module provides the capabilities for the Requests hooks system.
+
+Available hooks:
+
+``response``:
+    The response generated from a Request.
+"""
+HOOKS = ['response']
+
+
+def default_hooks():
+    return {event: [] for event in HOOKS}
+
+# TODO: response is the only one
+
+
+def dispatch_hook(key, hooks, hook_data, **kwargs):
+    """Dispatches a hook dictionary on a given piece of data."""
+    hooks = hooks or {}
+    hooks = hooks.get(key)
+    if hooks:
+        if hasattr(hooks, '__call__'):
+            hooks = [hooks]
+        for hook in hooks:
+            _hook_data = hook(hook_data, **kwargs)
+            if _hook_data is not None:
+                hook_data = _hook_data
+    return hook_data
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/models.py b/venv/Lib/site-packages/pip/_vendor/requests/models.py
new file mode 100644
index 000000000..015e715da
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/models.py
@@ -0,0 +1,954 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.models
+~~~~~~~~~~~~~~~
+
+This module contains the primary objects that power Requests.
+"""
+
+import datetime
+import sys
+
+# Import encoding now, to avoid implicit import later.
+# Implicit import within threads may cause LookupError when standard library is in a ZIP,
+# such as in Embedded Python. See https://github.com/psf/requests/issues/3578.
+import encodings.idna
+
+from pip._vendor.urllib3.fields import RequestField
+from pip._vendor.urllib3.filepost import encode_multipart_formdata
+from pip._vendor.urllib3.util import parse_url
+from pip._vendor.urllib3.exceptions import (
+    DecodeError, ReadTimeoutError, ProtocolError, LocationParseError)
+
+from io import UnsupportedOperation
+from .hooks import default_hooks
+from .structures import CaseInsensitiveDict
+
+from .auth import HTTPBasicAuth
+from .cookies import cookiejar_from_dict, get_cookie_header, _copy_cookie_jar
+from .exceptions import (
+    HTTPError, MissingSchema, InvalidURL, ChunkedEncodingError,
+    ContentDecodingError, ConnectionError, StreamConsumedError)
+from ._internal_utils import to_native_string, unicode_is_ascii
+from .utils import (
+    guess_filename, get_auth_from_url, requote_uri,
+    stream_decode_response_unicode, to_key_val_list, parse_header_links,
+    iter_slices, guess_json_utf, super_len, check_header_validity)
+from .compat import (
+    Callable, Mapping,
+    cookielib, urlunparse, urlsplit, urlencode, str, bytes,
+    is_py2, chardet, builtin_str, basestring)
+from .compat import json as complexjson
+from .status_codes import codes
+
+#: The set of HTTP status codes that indicate an automatically
+#: processable redirect.
+REDIRECT_STATI = (
+    codes.moved,               # 301
+    codes.found,               # 302
+    codes.other,               # 303
+    codes.temporary_redirect,  # 307
+    codes.permanent_redirect,  # 308
+)
+
+DEFAULT_REDIRECT_LIMIT = 30
+CONTENT_CHUNK_SIZE = 10 * 1024
+ITER_CHUNK_SIZE = 512
+
+
+class RequestEncodingMixin(object):
+    @property
+    def path_url(self):
+        """Build the path URL to use."""
+
+        url = []
+
+        p = urlsplit(self.url)
+
+        path = p.path
+        if not path:
+            path = '/'
+
+        url.append(path)
+
+        query = p.query
+        if query:
+            url.append('?')
+            url.append(query)
+
+        return ''.join(url)
+
+    @staticmethod
+    def _encode_params(data):
+        """Encode parameters in a piece of data.
+
+        Will successfully encode parameters when passed as a dict or a list of
+        2-tuples. Order is retained if data is a list of 2-tuples but arbitrary
+        if parameters are supplied as a dict.
+        """
+
+        if isinstance(data, (str, bytes)):
+            return data
+        elif hasattr(data, 'read'):
+            return data
+        elif hasattr(data, '__iter__'):
+            result = []
+            for k, vs in to_key_val_list(data):
+                if isinstance(vs, basestring) or not hasattr(vs, '__iter__'):
+                    vs = [vs]
+                for v in vs:
+                    if v is not None:
+                        result.append(
+                            (k.encode('utf-8') if isinstance(k, str) else k,
+                             v.encode('utf-8') if isinstance(v, str) else v))
+            return urlencode(result, doseq=True)
+        else:
+            return data
+
+    @staticmethod
+    def _encode_files(files, data):
+        """Build the body for a multipart/form-data request.
+
+        Will successfully encode files when passed as a dict or a list of
+        tuples. Order is retained if data is a list of tuples but arbitrary
+        if parameters are supplied as a dict.
+        The tuples may be 2-tuples (filename, fileobj), 3-tuples (filename, fileobj, contentype)
+        or 4-tuples (filename, fileobj, contentype, custom_headers).
+        """
+        if (not files):
+            raise ValueError("Files must be provided.")
+        elif isinstance(data, basestring):
+            raise ValueError("Data must not be a string.")
+
+        new_fields = []
+        fields = to_key_val_list(data or {})
+        files = to_key_val_list(files or {})
+
+        for field, val in fields:
+            if isinstance(val, basestring) or not hasattr(val, '__iter__'):
+                val = [val]
+            for v in val:
+                if v is not None:
+                    # Don't call str() on bytestrings: in Py3 it all goes wrong.
+                    if not isinstance(v, bytes):
+                        v = str(v)
+
+                    new_fields.append(
+                        (field.decode('utf-8') if isinstance(field, bytes) else field,
+                         v.encode('utf-8') if isinstance(v, str) else v))
+
+        for (k, v) in files:
+            # support for explicit filename
+            ft = None
+            fh = None
+            if isinstance(v, (tuple, list)):
+                if len(v) == 2:
+                    fn, fp = v
+                elif len(v) == 3:
+                    fn, fp, ft = v
+                else:
+                    fn, fp, ft, fh = v
+            else:
+                fn = guess_filename(v) or k
+                fp = v
+
+            if isinstance(fp, (str, bytes, bytearray)):
+                fdata = fp
+            elif hasattr(fp, 'read'):
+                fdata = fp.read()
+            elif fp is None:
+                continue
+            else:
+                fdata = fp
+
+            rf = RequestField(name=k, data=fdata, filename=fn, headers=fh)
+            rf.make_multipart(content_type=ft)
+            new_fields.append(rf)
+
+        body, content_type = encode_multipart_formdata(new_fields)
+
+        return body, content_type
+
+
+class RequestHooksMixin(object):
+    def register_hook(self, event, hook):
+        """Properly register a hook."""
+
+        if event not in self.hooks:
+            raise ValueError('Unsupported event specified, with event name "%s"' % (event))
+
+        if isinstance(hook, Callable):
+            self.hooks[event].append(hook)
+        elif hasattr(hook, '__iter__'):
+            self.hooks[event].extend(h for h in hook if isinstance(h, Callable))
+
+    def deregister_hook(self, event, hook):
+        """Deregister a previously registered hook.
+        Returns True if the hook existed, False if not.
+        """
+
+        try:
+            self.hooks[event].remove(hook)
+            return True
+        except ValueError:
+            return False
+
+
+class Request(RequestHooksMixin):
+    """A user-created :class:`Request <Request>` object.
+
+    Used to prepare a :class:`PreparedRequest <PreparedRequest>`, which is sent to the server.
+
+    :param method: HTTP method to use.
+    :param url: URL to send.
+    :param headers: dictionary of headers to send.
+    :param files: dictionary of {filename: fileobject} files to multipart upload.
+    :param data: the body to attach to the request. If a dictionary or
+        list of tuples ``[(key, value)]`` is provided, form-encoding will
+        take place.
+    :param json: json for the body to attach to the request (if files or data is not specified).
+    :param params: URL parameters to append to the URL. If a dictionary or
+        list of tuples ``[(key, value)]`` is provided, form-encoding will
+        take place.
+    :param auth: Auth handler or (user, pass) tuple.
+    :param cookies: dictionary or CookieJar of cookies to attach to this request.
+    :param hooks: dictionary of callback hooks, for internal usage.
+
+    Usage::
+
+      >>> import requests
+      >>> req = requests.Request('GET', 'https://httpbin.org/get')
+      >>> req.prepare()
+      <PreparedRequest [GET]>
+    """
+
+    def __init__(self,
+            method=None, url=None, headers=None, files=None, data=None,
+            params=None, auth=None, cookies=None, hooks=None, json=None):
+
+        # Default empty dicts for dict params.
+        data = [] if data is None else data
+        files = [] if files is None else files
+        headers = {} if headers is None else headers
+        params = {} if params is None else params
+        hooks = {} if hooks is None else hooks
+
+        self.hooks = default_hooks()
+        for (k, v) in list(hooks.items()):
+            self.register_hook(event=k, hook=v)
+
+        self.method = method
+        self.url = url
+        self.headers = headers
+        self.files = files
+        self.data = data
+        self.json = json
+        self.params = params
+        self.auth = auth
+        self.cookies = cookies
+
+    def __repr__(self):
+        return '<Request [%s]>' % (self.method)
+
+    def prepare(self):
+        """Constructs a :class:`PreparedRequest <PreparedRequest>` for transmission and returns it."""
+        p = PreparedRequest()
+        p.prepare(
+            method=self.method,
+            url=self.url,
+            headers=self.headers,
+            files=self.files,
+            data=self.data,
+            json=self.json,
+            params=self.params,
+            auth=self.auth,
+            cookies=self.cookies,
+            hooks=self.hooks,
+        )
+        return p
+
+
+class PreparedRequest(RequestEncodingMixin, RequestHooksMixin):
+    """The fully mutable :class:`PreparedRequest <PreparedRequest>` object,
+    containing the exact bytes that will be sent to the server.
+
+    Generated from either a :class:`Request <Request>` object or manually.
+
+    Usage::
+
+      >>> import requests
+      >>> req = requests.Request('GET', 'https://httpbin.org/get')
+      >>> r = req.prepare()
+      >>> r
+      <PreparedRequest [GET]>
+
+      >>> s = requests.Session()
+      >>> s.send(r)
+      <Response [200]>
+    """
+
+    def __init__(self):
+        #: HTTP verb to send to the server.
+        self.method = None
+        #: HTTP URL to send the request to.
+        self.url = None
+        #: dictionary of HTTP headers.
+        self.headers = None
+        # The `CookieJar` used to create the Cookie header will be stored here
+        # after prepare_cookies is called
+        self._cookies = None
+        #: request body to send to the server.
+        self.body = None
+        #: dictionary of callback hooks, for internal usage.
+        self.hooks = default_hooks()
+        #: integer denoting starting position of a readable file-like body.
+        self._body_position = None
+
+    def prepare(self,
+            method=None, url=None, headers=None, files=None, data=None,
+            params=None, auth=None, cookies=None, hooks=None, json=None):
+        """Prepares the entire request with the given parameters."""
+
+        self.prepare_method(method)
+        self.prepare_url(url, params)
+        self.prepare_headers(headers)
+        self.prepare_cookies(cookies)
+        self.prepare_body(data, files, json)
+        self.prepare_auth(auth, url)
+
+        # Note that prepare_auth must be last to enable authentication schemes
+        # such as OAuth to work on a fully prepared request.
+
+        # This MUST go after prepare_auth. Authenticators could add a hook
+        self.prepare_hooks(hooks)
+
+    def __repr__(self):
+        return '<PreparedRequest [%s]>' % (self.method)
+
+    def copy(self):
+        p = PreparedRequest()
+        p.method = self.method
+        p.url = self.url
+        p.headers = self.headers.copy() if self.headers is not None else None
+        p._cookies = _copy_cookie_jar(self._cookies)
+        p.body = self.body
+        p.hooks = self.hooks
+        p._body_position = self._body_position
+        return p
+
+    def prepare_method(self, method):
+        """Prepares the given HTTP method."""
+        self.method = method
+        if self.method is not None:
+            self.method = to_native_string(self.method.upper())
+
+    @staticmethod
+    def _get_idna_encoded_host(host):
+        from pip._vendor import idna
+
+        try:
+            host = idna.encode(host, uts46=True).decode('utf-8')
+        except idna.IDNAError:
+            raise UnicodeError
+        return host
+
+    def prepare_url(self, url, params):
+        """Prepares the given HTTP URL."""
+        #: Accept objects that have string representations.
+        #: We're unable to blindly call unicode/str functions
+        #: as this will include the bytestring indicator (b'')
+        #: on python 3.x.
+        #: https://github.com/psf/requests/pull/2238
+        if isinstance(url, bytes):
+            url = url.decode('utf8')
+        else:
+            url = unicode(url) if is_py2 else str(url)
+
+        # Remove leading whitespaces from url
+        url = url.lstrip()
+
+        # Don't do any URL preparation for non-HTTP schemes like `mailto`,
+        # `data` etc to work around exceptions from `url_parse`, which
+        # handles RFC 3986 only.
+        if ':' in url and not url.lower().startswith('http'):
+            self.url = url
+            return
+
+        # Support for unicode domain names and paths.
+        try:
+            scheme, auth, host, port, path, query, fragment = parse_url(url)
+        except LocationParseError as e:
+            raise InvalidURL(*e.args)
+
+        if not scheme:
+            error = ("Invalid URL {0!r}: No schema supplied. Perhaps you meant http://{0}?")
+            error = error.format(to_native_string(url, 'utf8'))
+
+            raise MissingSchema(error)
+
+        if not host:
+            raise InvalidURL("Invalid URL %r: No host supplied" % url)
+
+        # In general, we want to try IDNA encoding the hostname if the string contains
+        # non-ASCII characters. This allows users to automatically get the correct IDNA
+        # behaviour. For strings containing only ASCII characters, we need to also verify
+        # it doesn't start with a wildcard (*), before allowing the unencoded hostname.
+        if not unicode_is_ascii(host):
+            try:
+                host = self._get_idna_encoded_host(host)
+            except UnicodeError:
+                raise InvalidURL('URL has an invalid label.')
+        elif host.startswith(u'*'):
+            raise InvalidURL('URL has an invalid label.')
+
+        # Carefully reconstruct the network location
+        netloc = auth or ''
+        if netloc:
+            netloc += '@'
+        netloc += host
+        if port:
+            netloc += ':' + str(port)
+
+        # Bare domains aren't valid URLs.
+        if not path:
+            path = '/'
+
+        if is_py2:
+            if isinstance(scheme, str):
+                scheme = scheme.encode('utf-8')
+            if isinstance(netloc, str):
+                netloc = netloc.encode('utf-8')
+            if isinstance(path, str):
+                path = path.encode('utf-8')
+            if isinstance(query, str):
+                query = query.encode('utf-8')
+            if isinstance(fragment, str):
+                fragment = fragment.encode('utf-8')
+
+        if isinstance(params, (str, bytes)):
+            params = to_native_string(params)
+
+        enc_params = self._encode_params(params)
+        if enc_params:
+            if query:
+                query = '%s&%s' % (query, enc_params)
+            else:
+                query = enc_params
+
+        url = requote_uri(urlunparse([scheme, netloc, path, None, query, fragment]))
+        self.url = url
+
+    def prepare_headers(self, headers):
+        """Prepares the given HTTP headers."""
+
+        self.headers = CaseInsensitiveDict()
+        if headers:
+            for header in headers.items():
+                # Raise exception on invalid header value.
+                check_header_validity(header)
+                name, value = header
+                self.headers[to_native_string(name)] = value
+
+    def prepare_body(self, data, files, json=None):
+        """Prepares the given HTTP body data."""
+
+        # Check if file, fo, generator, iterator.
+        # If not, run through normal process.
+
+        # Nottin' on you.
+        body = None
+        content_type = None
+
+        if not data and json is not None:
+            # urllib3 requires a bytes-like body. Python 2's json.dumps
+            # provides this natively, but Python 3 gives a Unicode string.
+            content_type = 'application/json'
+            body = complexjson.dumps(json)
+            if not isinstance(body, bytes):
+                body = body.encode('utf-8')
+
+        is_stream = all([
+            hasattr(data, '__iter__'),
+            not isinstance(data, (basestring, list, tuple, Mapping))
+        ])
+
+        if is_stream:
+            try:
+                length = super_len(data)
+            except (TypeError, AttributeError, UnsupportedOperation):
+                length = None
+
+            body = data
+
+            if getattr(body, 'tell', None) is not None:
+                # Record the current file position before reading.
+                # This will allow us to rewind a file in the event
+                # of a redirect.
+                try:
+                    self._body_position = body.tell()
+                except (IOError, OSError):
+                    # This differentiates from None, allowing us to catch
+                    # a failed `tell()` later when trying to rewind the body
+                    self._body_position = object()
+
+            if files:
+                raise NotImplementedError('Streamed bodies and files are mutually exclusive.')
+
+            if length:
+                self.headers['Content-Length'] = builtin_str(length)
+            else:
+                self.headers['Transfer-Encoding'] = 'chunked'
+        else:
+            # Multi-part file uploads.
+            if files:
+                (body, content_type) = self._encode_files(files, data)
+            else:
+                if data:
+                    body = self._encode_params(data)
+                    if isinstance(data, basestring) or hasattr(data, 'read'):
+                        content_type = None
+                    else:
+                        content_type = 'application/x-www-form-urlencoded'
+
+            self.prepare_content_length(body)
+
+            # Add content-type if it wasn't explicitly provided.
+            if content_type and ('content-type' not in self.headers):
+                self.headers['Content-Type'] = content_type
+
+        self.body = body
+
+    def prepare_content_length(self, body):
+        """Prepare Content-Length header based on request method and body"""
+        if body is not None:
+            length = super_len(body)
+            if length:
+                # If length exists, set it. Otherwise, we fallback
+                # to Transfer-Encoding: chunked.
+                self.headers['Content-Length'] = builtin_str(length)
+        elif self.method not in ('GET', 'HEAD') and self.headers.get('Content-Length') is None:
+            # Set Content-Length to 0 for methods that can have a body
+            # but don't provide one. (i.e. not GET or HEAD)
+            self.headers['Content-Length'] = '0'
+
+    def prepare_auth(self, auth, url=''):
+        """Prepares the given HTTP auth data."""
+
+        # If no Auth is explicitly provided, extract it from the URL first.
+        if auth is None:
+            url_auth = get_auth_from_url(self.url)
+            auth = url_auth if any(url_auth) else None
+
+        if auth:
+            if isinstance(auth, tuple) and len(auth) == 2:
+                # special-case basic HTTP auth
+                auth = HTTPBasicAuth(*auth)
+
+            # Allow auth to make its changes.
+            r = auth(self)
+
+            # Update self to reflect the auth changes.
+            self.__dict__.update(r.__dict__)
+
+            # Recompute Content-Length
+            self.prepare_content_length(self.body)
+
+    def prepare_cookies(self, cookies):
+        """Prepares the given HTTP cookie data.
+
+        This function eventually generates a ``Cookie`` header from the
+        given cookies using cookielib. Due to cookielib's design, the header
+        will not be regenerated if it already exists, meaning this function
+        can only be called once for the life of the
+        :class:`PreparedRequest <PreparedRequest>` object. Any subsequent calls
+        to ``prepare_cookies`` will have no actual effect, unless the "Cookie"
+        header is removed beforehand.
+        """
+        if isinstance(cookies, cookielib.CookieJar):
+            self._cookies = cookies
+        else:
+            self._cookies = cookiejar_from_dict(cookies)
+
+        cookie_header = get_cookie_header(self._cookies, self)
+        if cookie_header is not None:
+            self.headers['Cookie'] = cookie_header
+
+    def prepare_hooks(self, hooks):
+        """Prepares the given hooks."""
+        # hooks can be passed as None to the prepare method and to this
+        # method. To prevent iterating over None, simply use an empty list
+        # if hooks is False-y
+        hooks = hooks or []
+        for event in hooks:
+            self.register_hook(event, hooks[event])
+
+
+class Response(object):
+    """The :class:`Response <Response>` object, which contains a
+    server's response to an HTTP request.
+    """
+
+    __attrs__ = [
+        '_content', 'status_code', 'headers', 'url', 'history',
+        'encoding', 'reason', 'cookies', 'elapsed', 'request'
+    ]
+
+    def __init__(self):
+        self._content = False
+        self._content_consumed = False
+        self._next = None
+
+        #: Integer Code of responded HTTP Status, e.g. 404 or 200.
+        self.status_code = None
+
+        #: Case-insensitive Dictionary of Response Headers.
+        #: For example, ``headers['content-encoding']`` will return the
+        #: value of a ``'Content-Encoding'`` response header.
+        self.headers = CaseInsensitiveDict()
+
+        #: File-like object representation of response (for advanced usage).
+        #: Use of ``raw`` requires that ``stream=True`` be set on the request.
+        #: This requirement does not apply for use internally to Requests.
+        self.raw = None
+
+        #: Final URL location of Response.
+        self.url = None
+
+        #: Encoding to decode with when accessing r.text.
+        self.encoding = None
+
+        #: A list of :class:`Response <Response>` objects from
+        #: the history of the Request. Any redirect responses will end
+        #: up here. The list is sorted from the oldest to the most recent request.
+        self.history = []
+
+        #: Textual reason of responded HTTP Status, e.g. "Not Found" or "OK".
+        self.reason = None
+
+        #: A CookieJar of Cookies the server sent back.
+        self.cookies = cookiejar_from_dict({})
+
+        #: The amount of time elapsed between sending the request
+        #: and the arrival of the response (as a timedelta).
+        #: This property specifically measures the time taken between sending
+        #: the first byte of the request and finishing parsing the headers. It
+        #: is therefore unaffected by consuming the response content or the
+        #: value of the ``stream`` keyword argument.
+        self.elapsed = datetime.timedelta(0)
+
+        #: The :class:`PreparedRequest <PreparedRequest>` object to which this
+        #: is a response.
+        self.request = None
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, *args):
+        self.close()
+
+    def __getstate__(self):
+        # Consume everything; accessing the content attribute makes
+        # sure the content has been fully read.
+        if not self._content_consumed:
+            self.content
+
+        return {attr: getattr(self, attr, None) for attr in self.__attrs__}
+
+    def __setstate__(self, state):
+        for name, value in state.items():
+            setattr(self, name, value)
+
+        # pickled objects do not have .raw
+        setattr(self, '_content_consumed', True)
+        setattr(self, 'raw', None)
+
+    def __repr__(self):
+        return '<Response [%s]>' % (self.status_code)
+
+    def __bool__(self):
+        """Returns True if :attr:`status_code` is less than 400.
+
+        This attribute checks if the status code of the response is between
+        400 and 600 to see if there was a client error or a server error. If
+        the status code, is between 200 and 400, this will return True. This
+        is **not** a check to see if the response code is ``200 OK``.
+        """
+        return self.ok
+
+    def __nonzero__(self):
+        """Returns True if :attr:`status_code` is less than 400.
+
+        This attribute checks if the status code of the response is between
+        400 and 600 to see if there was a client error or a server error. If
+        the status code, is between 200 and 400, this will return True. This
+        is **not** a check to see if the response code is ``200 OK``.
+        """
+        return self.ok
+
+    def __iter__(self):
+        """Allows you to use a response as an iterator."""
+        return self.iter_content(128)
+
+    @property
+    def ok(self):
+        """Returns True if :attr:`status_code` is less than 400, False if not.
+
+        This attribute checks if the status code of the response is between
+        400 and 600 to see if there was a client error or a server error. If
+        the status code is between 200 and 400, this will return True. This
+        is **not** a check to see if the response code is ``200 OK``.
+        """
+        try:
+            self.raise_for_status()
+        except HTTPError:
+            return False
+        return True
+
+    @property
+    def is_redirect(self):
+        """True if this Response is a well-formed HTTP redirect that could have
+        been processed automatically (by :meth:`Session.resolve_redirects`).
+        """
+        return ('location' in self.headers and self.status_code in REDIRECT_STATI)
+
+    @property
+    def is_permanent_redirect(self):
+        """True if this Response one of the permanent versions of redirect."""
+        return ('location' in self.headers and self.status_code in (codes.moved_permanently, codes.permanent_redirect))
+
+    @property
+    def next(self):
+        """Returns a PreparedRequest for the next request in a redirect chain, if there is one."""
+        return self._next
+
+    @property
+    def apparent_encoding(self):
+        """The apparent encoding, provided by the chardet library."""
+        return chardet.detect(self.content)['encoding']
+
+    def iter_content(self, chunk_size=1, decode_unicode=False):
+        """Iterates over the response data.  When stream=True is set on the
+        request, this avoids reading the content at once into memory for
+        large responses.  The chunk size is the number of bytes it should
+        read into memory.  This is not necessarily the length of each item
+        returned as decoding can take place.
+
+        chunk_size must be of type int or None. A value of None will
+        function differently depending on the value of `stream`.
+        stream=True will read data as it arrives in whatever size the
+        chunks are received. If stream=False, data is returned as
+        a single chunk.
+
+        If decode_unicode is True, content will be decoded using the best
+        available encoding based on the response.
+        """
+
+        def generate():
+            # Special case for urllib3.
+            if hasattr(self.raw, 'stream'):
+                try:
+                    for chunk in self.raw.stream(chunk_size, decode_content=True):
+                        yield chunk
+                except ProtocolError as e:
+                    raise ChunkedEncodingError(e)
+                except DecodeError as e:
+                    raise ContentDecodingError(e)
+                except ReadTimeoutError as e:
+                    raise ConnectionError(e)
+            else:
+                # Standard file-like object.
+                while True:
+                    chunk = self.raw.read(chunk_size)
+                    if not chunk:
+                        break
+                    yield chunk
+
+            self._content_consumed = True
+
+        if self._content_consumed and isinstance(self._content, bool):
+            raise StreamConsumedError()
+        elif chunk_size is not None and not isinstance(chunk_size, int):
+            raise TypeError("chunk_size must be an int, it is instead a %s." % type(chunk_size))
+        # simulate reading small chunks of the content
+        reused_chunks = iter_slices(self._content, chunk_size)
+
+        stream_chunks = generate()
+
+        chunks = reused_chunks if self._content_consumed else stream_chunks
+
+        if decode_unicode:
+            chunks = stream_decode_response_unicode(chunks, self)
+
+        return chunks
+
+    def iter_lines(self, chunk_size=ITER_CHUNK_SIZE, decode_unicode=False, delimiter=None):
+        """Iterates over the response data, one line at a time.  When
+        stream=True is set on the request, this avoids reading the
+        content at once into memory for large responses.
+
+        .. note:: This method is not reentrant safe.
+        """
+
+        pending = None
+
+        for chunk in self.iter_content(chunk_size=chunk_size, decode_unicode=decode_unicode):
+
+            if pending is not None:
+                chunk = pending + chunk
+
+            if delimiter:
+                lines = chunk.split(delimiter)
+            else:
+                lines = chunk.splitlines()
+
+            if lines and lines[-1] and chunk and lines[-1][-1] == chunk[-1]:
+                pending = lines.pop()
+            else:
+                pending = None
+
+            for line in lines:
+                yield line
+
+        if pending is not None:
+            yield pending
+
+    @property
+    def content(self):
+        """Content of the response, in bytes."""
+
+        if self._content is False:
+            # Read the contents.
+            if self._content_consumed:
+                raise RuntimeError(
+                    'The content for this response was already consumed')
+
+            if self.status_code == 0 or self.raw is None:
+                self._content = None
+            else:
+                self._content = b''.join(self.iter_content(CONTENT_CHUNK_SIZE)) or b''
+
+        self._content_consumed = True
+        # don't need to release the connection; that's been handled by urllib3
+        # since we exhausted the data.
+        return self._content
+
+    @property
+    def text(self):
+        """Content of the response, in unicode.
+
+        If Response.encoding is None, encoding will be guessed using
+        ``chardet``.
+
+        The encoding of the response content is determined based solely on HTTP
+        headers, following RFC 2616 to the letter. If you can take advantage of
+        non-HTTP knowledge to make a better guess at the encoding, you should
+        set ``r.encoding`` appropriately before accessing this property.
+        """
+
+        # Try charset from content-type
+        content = None
+        encoding = self.encoding
+
+        if not self.content:
+            return str('')
+
+        # Fallback to auto-detected encoding.
+        if self.encoding is None:
+            encoding = self.apparent_encoding
+
+        # Decode unicode from given encoding.
+        try:
+            content = str(self.content, encoding, errors='replace')
+        except (LookupError, TypeError):
+            # A LookupError is raised if the encoding was not found which could
+            # indicate a misspelling or similar mistake.
+            #
+            # A TypeError can be raised if encoding is None
+            #
+            # So we try blindly encoding.
+            content = str(self.content, errors='replace')
+
+        return content
+
+    def json(self, **kwargs):
+        r"""Returns the json-encoded content of a response, if any.
+
+        :param \*\*kwargs: Optional arguments that ``json.loads`` takes.
+        :raises ValueError: If the response body does not contain valid json.
+        """
+
+        if not self.encoding and self.content and len(self.content) > 3:
+            # No encoding set. JSON RFC 4627 section 3 states we should expect
+            # UTF-8, -16 or -32. Detect which one to use; If the detection or
+            # decoding fails, fall back to `self.text` (using chardet to make
+            # a best guess).
+            encoding = guess_json_utf(self.content)
+            if encoding is not None:
+                try:
+                    return complexjson.loads(
+                        self.content.decode(encoding), **kwargs
+                    )
+                except UnicodeDecodeError:
+                    # Wrong UTF codec detected; usually because it's not UTF-8
+                    # but some other 8-bit codec.  This is an RFC violation,
+                    # and the server didn't bother to tell us what codec *was*
+                    # used.
+                    pass
+        return complexjson.loads(self.text, **kwargs)
+
+    @property
+    def links(self):
+        """Returns the parsed header links of the response, if any."""
+
+        header = self.headers.get('link')
+
+        # l = MultiDict()
+        l = {}
+
+        if header:
+            links = parse_header_links(header)
+
+            for link in links:
+                key = link.get('rel') or link.get('url')
+                l[key] = link
+
+        return l
+
+    def raise_for_status(self):
+        """Raises :class:`HTTPError`, if one occurred."""
+
+        http_error_msg = ''
+        if isinstance(self.reason, bytes):
+            # We attempt to decode utf-8 first because some servers
+            # choose to localize their reason strings. If the string
+            # isn't utf-8, we fall back to iso-8859-1 for all other
+            # encodings. (See PR #3538)
+            try:
+                reason = self.reason.decode('utf-8')
+            except UnicodeDecodeError:
+                reason = self.reason.decode('iso-8859-1')
+        else:
+            reason = self.reason
+
+        if 400 <= self.status_code < 500:
+            http_error_msg = u'%s Client Error: %s for url: %s' % (self.status_code, reason, self.url)
+
+        elif 500 <= self.status_code < 600:
+            http_error_msg = u'%s Server Error: %s for url: %s' % (self.status_code, reason, self.url)
+
+        if http_error_msg:
+            raise HTTPError(http_error_msg, response=self)
+
+    def close(self):
+        """Releases the connection back to the pool. Once this method has been
+        called the underlying ``raw`` object must not be accessed again.
+
+        *Note: Should not normally need to be called explicitly.*
+        """
+        if not self._content_consumed:
+            self.raw.close()
+
+        release_conn = getattr(self.raw, 'release_conn', None)
+        if release_conn is not None:
+            release_conn()
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/packages.py b/venv/Lib/site-packages/pip/_vendor/requests/packages.py
new file mode 100644
index 000000000..9582fa730
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/packages.py
@@ -0,0 +1,16 @@
+import sys
+
+# This code exists for backwards compatibility reasons.
+# I don't like it either. Just look the other way. :)
+
+for package in ('urllib3', 'idna', 'chardet'):
+    vendored_package = "pip._vendor." + package
+    locals()[package] = __import__(vendored_package)
+    # This traversal is apparently necessary such that the identities are
+    # preserved (requests.packages.urllib3.* is urllib3.*)
+    for mod in list(sys.modules):
+        if mod == vendored_package or mod.startswith(vendored_package + '.'):
+            unprefixed_mod = mod[len("pip._vendor."):]
+            sys.modules['pip._vendor.requests.packages.' + unprefixed_mod] = sys.modules[mod]
+
+# Kinda cool, though, right?
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/sessions.py b/venv/Lib/site-packages/pip/_vendor/requests/sessions.py
new file mode 100644
index 000000000..e8e2d609a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/sessions.py
@@ -0,0 +1,769 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.session
+~~~~~~~~~~~~~~~~
+
+This module provides a Session object to manage and persist settings across
+requests (cookies, auth, proxies).
+"""
+import os
+import sys
+import time
+from datetime import timedelta
+from collections import OrderedDict
+
+from .auth import _basic_auth_str
+from .compat import cookielib, is_py3, urljoin, urlparse, Mapping
+from .cookies import (
+    cookiejar_from_dict, extract_cookies_to_jar, RequestsCookieJar, merge_cookies)
+from .models import Request, PreparedRequest, DEFAULT_REDIRECT_LIMIT
+from .hooks import default_hooks, dispatch_hook
+from ._internal_utils import to_native_string
+from .utils import to_key_val_list, default_headers, DEFAULT_PORTS
+from .exceptions import (
+    TooManyRedirects, InvalidSchema, ChunkedEncodingError, ContentDecodingError)
+
+from .structures import CaseInsensitiveDict
+from .adapters import HTTPAdapter
+
+from .utils import (
+    requote_uri, get_environ_proxies, get_netrc_auth, should_bypass_proxies,
+    get_auth_from_url, rewind_body
+)
+
+from .status_codes import codes
+
+# formerly defined here, reexposed here for backward compatibility
+from .models import REDIRECT_STATI
+
+# Preferred clock, based on which one is more accurate on a given system.
+if sys.platform == 'win32':
+    try:  # Python 3.4+
+        preferred_clock = time.perf_counter
+    except AttributeError:  # Earlier than Python 3.
+        preferred_clock = time.clock
+else:
+    preferred_clock = time.time
+
+
+def merge_setting(request_setting, session_setting, dict_class=OrderedDict):
+    """Determines appropriate setting for a given request, taking into account
+    the explicit setting on that request, and the setting in the session. If a
+    setting is a dictionary, they will be merged together using `dict_class`
+    """
+
+    if session_setting is None:
+        return request_setting
+
+    if request_setting is None:
+        return session_setting
+
+    # Bypass if not a dictionary (e.g. verify)
+    if not (
+            isinstance(session_setting, Mapping) and
+            isinstance(request_setting, Mapping)
+    ):
+        return request_setting
+
+    merged_setting = dict_class(to_key_val_list(session_setting))
+    merged_setting.update(to_key_val_list(request_setting))
+
+    # Remove keys that are set to None. Extract keys first to avoid altering
+    # the dictionary during iteration.
+    none_keys = [k for (k, v) in merged_setting.items() if v is None]
+    for key in none_keys:
+        del merged_setting[key]
+
+    return merged_setting
+
+
+def merge_hooks(request_hooks, session_hooks, dict_class=OrderedDict):
+    """Properly merges both requests and session hooks.
+
+    This is necessary because when request_hooks == {'response': []}, the
+    merge breaks Session hooks entirely.
+    """
+    if session_hooks is None or session_hooks.get('response') == []:
+        return request_hooks
+
+    if request_hooks is None or request_hooks.get('response') == []:
+        return session_hooks
+
+    return merge_setting(request_hooks, session_hooks, dict_class)
+
+
+class SessionRedirectMixin(object):
+
+    def get_redirect_target(self, resp):
+        """Receives a Response. Returns a redirect URI or ``None``"""
+        # Due to the nature of how requests processes redirects this method will
+        # be called at least once upon the original response and at least twice
+        # on each subsequent redirect response (if any).
+        # If a custom mixin is used to handle this logic, it may be advantageous
+        # to cache the redirect location onto the response object as a private
+        # attribute.
+        if resp.is_redirect:
+            location = resp.headers['location']
+            # Currently the underlying http module on py3 decode headers
+            # in latin1, but empirical evidence suggests that latin1 is very
+            # rarely used with non-ASCII characters in HTTP headers.
+            # It is more likely to get UTF8 header rather than latin1.
+            # This causes incorrect handling of UTF8 encoded location headers.
+            # To solve this, we re-encode the location in latin1.
+            if is_py3:
+                location = location.encode('latin1')
+            return to_native_string(location, 'utf8')
+        return None
+
+    def should_strip_auth(self, old_url, new_url):
+        """Decide whether Authorization header should be removed when redirecting"""
+        old_parsed = urlparse(old_url)
+        new_parsed = urlparse(new_url)
+        if old_parsed.hostname != new_parsed.hostname:
+            return True
+        # Special case: allow http -> https redirect when using the standard
+        # ports. This isn't specified by RFC 7235, but is kept to avoid
+        # breaking backwards compatibility with older versions of requests
+        # that allowed any redirects on the same host.
+        if (old_parsed.scheme == 'http' and old_parsed.port in (80, None)
+                and new_parsed.scheme == 'https' and new_parsed.port in (443, None)):
+            return False
+
+        # Handle default port usage corresponding to scheme.
+        changed_port = old_parsed.port != new_parsed.port
+        changed_scheme = old_parsed.scheme != new_parsed.scheme
+        default_port = (DEFAULT_PORTS.get(old_parsed.scheme, None), None)
+        if (not changed_scheme and old_parsed.port in default_port
+                and new_parsed.port in default_port):
+            return False
+
+        # Standard case: root URI must match
+        return changed_port or changed_scheme
+
+    def resolve_redirects(self, resp, req, stream=False, timeout=None,
+                          verify=True, cert=None, proxies=None, yield_requests=False, **adapter_kwargs):
+        """Receives a Response. Returns a generator of Responses or Requests."""
+
+        hist = []  # keep track of history
+
+        url = self.get_redirect_target(resp)
+        previous_fragment = urlparse(req.url).fragment
+        while url:
+            prepared_request = req.copy()
+
+            # Update history and keep track of redirects.
+            # resp.history must ignore the original request in this loop
+            hist.append(resp)
+            resp.history = hist[1:]
+
+            try:
+                resp.content  # Consume socket so it can be released
+            except (ChunkedEncodingError, ContentDecodingError, RuntimeError):
+                resp.raw.read(decode_content=False)
+
+            if len(resp.history) >= self.max_redirects:
+                raise TooManyRedirects('Exceeded {} redirects.'.format(self.max_redirects), response=resp)
+
+            # Release the connection back into the pool.
+            resp.close()
+
+            # Handle redirection without scheme (see: RFC 1808 Section 4)
+            if url.startswith('//'):
+                parsed_rurl = urlparse(resp.url)
+                url = ':'.join([to_native_string(parsed_rurl.scheme), url])
+
+            # Normalize url case and attach previous fragment if needed (RFC 7231 7.1.2)
+            parsed = urlparse(url)
+            if parsed.fragment == '' and previous_fragment:
+                parsed = parsed._replace(fragment=previous_fragment)
+            elif parsed.fragment:
+                previous_fragment = parsed.fragment
+            url = parsed.geturl()
+
+            # Facilitate relative 'location' headers, as allowed by RFC 7231.
+            # (e.g. '/path/to/resource' instead of 'http://domain.tld/path/to/resource')
+            # Compliant with RFC3986, we percent encode the url.
+            if not parsed.netloc:
+                url = urljoin(resp.url, requote_uri(url))
+            else:
+                url = requote_uri(url)
+
+            prepared_request.url = to_native_string(url)
+
+            self.rebuild_method(prepared_request, resp)
+
+            # https://github.com/psf/requests/issues/1084
+            if resp.status_code not in (codes.temporary_redirect, codes.permanent_redirect):
+                # https://github.com/psf/requests/issues/3490
+                purged_headers = ('Content-Length', 'Content-Type', 'Transfer-Encoding')
+                for header in purged_headers:
+                    prepared_request.headers.pop(header, None)
+                prepared_request.body = None
+
+            headers = prepared_request.headers
+            headers.pop('Cookie', None)
+
+            # Extract any cookies sent on the response to the cookiejar
+            # in the new request. Because we've mutated our copied prepared
+            # request, use the old one that we haven't yet touched.
+            extract_cookies_to_jar(prepared_request._cookies, req, resp.raw)
+            merge_cookies(prepared_request._cookies, self.cookies)
+            prepared_request.prepare_cookies(prepared_request._cookies)
+
+            # Rebuild auth and proxy information.
+            proxies = self.rebuild_proxies(prepared_request, proxies)
+            self.rebuild_auth(prepared_request, resp)
+
+            # A failed tell() sets `_body_position` to `object()`. This non-None
+            # value ensures `rewindable` will be True, allowing us to raise an
+            # UnrewindableBodyError, instead of hanging the connection.
+            rewindable = (
+                prepared_request._body_position is not None and
+                ('Content-Length' in headers or 'Transfer-Encoding' in headers)
+            )
+
+            # Attempt to rewind consumed file-like object.
+            if rewindable:
+                rewind_body(prepared_request)
+
+            # Override the original request.
+            req = prepared_request
+
+            if yield_requests:
+                yield req
+            else:
+
+                resp = self.send(
+                    req,
+                    stream=stream,
+                    timeout=timeout,
+                    verify=verify,
+                    cert=cert,
+                    proxies=proxies,
+                    allow_redirects=False,
+                    **adapter_kwargs
+                )
+
+                extract_cookies_to_jar(self.cookies, prepared_request, resp.raw)
+
+                # extract redirect url, if any, for the next loop
+                url = self.get_redirect_target(resp)
+                yield resp
+
+    def rebuild_auth(self, prepared_request, response):
+        """When being redirected we may want to strip authentication from the
+        request to avoid leaking credentials. This method intelligently removes
+        and reapplies authentication where possible to avoid credential loss.
+        """
+        headers = prepared_request.headers
+        url = prepared_request.url
+
+        if 'Authorization' in headers and self.should_strip_auth(response.request.url, url):
+            # If we get redirected to a new host, we should strip out any
+            # authentication headers.
+            del headers['Authorization']
+
+        # .netrc might have more auth for us on our new host.
+        new_auth = get_netrc_auth(url) if self.trust_env else None
+        if new_auth is not None:
+            prepared_request.prepare_auth(new_auth)
+
+
+    def rebuild_proxies(self, prepared_request, proxies):
+        """This method re-evaluates the proxy configuration by considering the
+        environment variables. If we are redirected to a URL covered by
+        NO_PROXY, we strip the proxy configuration. Otherwise, we set missing
+        proxy keys for this URL (in case they were stripped by a previous
+        redirect).
+
+        This method also replaces the Proxy-Authorization header where
+        necessary.
+
+        :rtype: dict
+        """
+        proxies = proxies if proxies is not None else {}
+        headers = prepared_request.headers
+        url = prepared_request.url
+        scheme = urlparse(url).scheme
+        new_proxies = proxies.copy()
+        no_proxy = proxies.get('no_proxy')
+
+        bypass_proxy = should_bypass_proxies(url, no_proxy=no_proxy)
+        if self.trust_env and not bypass_proxy:
+            environ_proxies = get_environ_proxies(url, no_proxy=no_proxy)
+
+            proxy = environ_proxies.get(scheme, environ_proxies.get('all'))
+
+            if proxy:
+                new_proxies.setdefault(scheme, proxy)
+
+        if 'Proxy-Authorization' in headers:
+            del headers['Proxy-Authorization']
+
+        try:
+            username, password = get_auth_from_url(new_proxies[scheme])
+        except KeyError:
+            username, password = None, None
+
+        if username and password:
+            headers['Proxy-Authorization'] = _basic_auth_str(username, password)
+
+        return new_proxies
+
+    def rebuild_method(self, prepared_request, response):
+        """When being redirected we may want to change the method of the request
+        based on certain specs or browser behavior.
+        """
+        method = prepared_request.method
+
+        # https://tools.ietf.org/html/rfc7231#section-6.4.4
+        if response.status_code == codes.see_other and method != 'HEAD':
+            method = 'GET'
+
+        # Do what the browsers do, despite standards...
+        # First, turn 302s into GETs.
+        if response.status_code == codes.found and method != 'HEAD':
+            method = 'GET'
+
+        # Second, if a POST is responded to with a 301, turn it into a GET.
+        # This bizarre behaviour is explained in Issue 1704.
+        if response.status_code == codes.moved and method == 'POST':
+            method = 'GET'
+
+        prepared_request.method = method
+
+
+class Session(SessionRedirectMixin):
+    """A Requests session.
+
+    Provides cookie persistence, connection-pooling, and configuration.
+
+    Basic Usage::
+
+      >>> import requests
+      >>> s = requests.Session()
+      >>> s.get('https://httpbin.org/get')
+      <Response [200]>
+
+    Or as a context manager::
+
+      >>> with requests.Session() as s:
+      ...     s.get('https://httpbin.org/get')
+      <Response [200]>
+    """
+
+    __attrs__ = [
+        'headers', 'cookies', 'auth', 'proxies', 'hooks', 'params', 'verify',
+        'cert', 'adapters', 'stream', 'trust_env',
+        'max_redirects',
+    ]
+
+    def __init__(self):
+
+        #: A case-insensitive dictionary of headers to be sent on each
+        #: :class:`Request <Request>` sent from this
+        #: :class:`Session <Session>`.
+        self.headers = default_headers()
+
+        #: Default Authentication tuple or object to attach to
+        #: :class:`Request <Request>`.
+        self.auth = None
+
+        #: Dictionary mapping protocol or protocol and host to the URL of the proxy
+        #: (e.g. {'http': 'foo.bar:3128', 'http://host.name': 'foo.bar:4012'}) to
+        #: be used on each :class:`Request <Request>`.
+        self.proxies = {}
+
+        #: Event-handling hooks.
+        self.hooks = default_hooks()
+
+        #: Dictionary of querystring data to attach to each
+        #: :class:`Request <Request>`. The dictionary values may be lists for
+        #: representing multivalued query parameters.
+        self.params = {}
+
+        #: Stream response content default.
+        self.stream = False
+
+        #: SSL Verification default.
+        self.verify = True
+
+        #: SSL client certificate default, if String, path to ssl client
+        #: cert file (.pem). If Tuple, ('cert', 'key') pair.
+        self.cert = None
+
+        #: Maximum number of redirects allowed. If the request exceeds this
+        #: limit, a :class:`TooManyRedirects` exception is raised.
+        #: This defaults to requests.models.DEFAULT_REDIRECT_LIMIT, which is
+        #: 30.
+        self.max_redirects = DEFAULT_REDIRECT_LIMIT
+
+        #: Trust environment settings for proxy configuration, default
+        #: authentication and similar.
+        self.trust_env = True
+
+        #: A CookieJar containing all currently outstanding cookies set on this
+        #: session. By default it is a
+        #: :class:`RequestsCookieJar <requests.cookies.RequestsCookieJar>`, but
+        #: may be any other ``cookielib.CookieJar`` compatible object.
+        self.cookies = cookiejar_from_dict({})
+
+        # Default connection adapters.
+        self.adapters = OrderedDict()
+        self.mount('https://', HTTPAdapter())
+        self.mount('http://', HTTPAdapter())
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, *args):
+        self.close()
+
+    def prepare_request(self, request):
+        """Constructs a :class:`PreparedRequest <PreparedRequest>` for
+        transmission and returns it. The :class:`PreparedRequest` has settings
+        merged from the :class:`Request <Request>` instance and those of the
+        :class:`Session`.
+
+        :param request: :class:`Request` instance to prepare with this
+            session's settings.
+        :rtype: requests.PreparedRequest
+        """
+        cookies = request.cookies or {}
+
+        # Bootstrap CookieJar.
+        if not isinstance(cookies, cookielib.CookieJar):
+            cookies = cookiejar_from_dict(cookies)
+
+        # Merge with session cookies
+        merged_cookies = merge_cookies(
+            merge_cookies(RequestsCookieJar(), self.cookies), cookies)
+
+        # Set environment's basic authentication if not explicitly set.
+        auth = request.auth
+        if self.trust_env and not auth and not self.auth:
+            auth = get_netrc_auth(request.url)
+
+        p = PreparedRequest()
+        p.prepare(
+            method=request.method.upper(),
+            url=request.url,
+            files=request.files,
+            data=request.data,
+            json=request.json,
+            headers=merge_setting(request.headers, self.headers, dict_class=CaseInsensitiveDict),
+            params=merge_setting(request.params, self.params),
+            auth=merge_setting(auth, self.auth),
+            cookies=merged_cookies,
+            hooks=merge_hooks(request.hooks, self.hooks),
+        )
+        return p
+
+    def request(self, method, url,
+            params=None, data=None, headers=None, cookies=None, files=None,
+            auth=None, timeout=None, allow_redirects=True, proxies=None,
+            hooks=None, stream=None, verify=None, cert=None, json=None):
+        """Constructs a :class:`Request <Request>`, prepares it and sends it.
+        Returns :class:`Response <Response>` object.
+
+        :param method: method for the new :class:`Request` object.
+        :param url: URL for the new :class:`Request` object.
+        :param params: (optional) Dictionary or bytes to be sent in the query
+            string for the :class:`Request`.
+        :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+            object to send in the body of the :class:`Request`.
+        :param json: (optional) json to send in the body of the
+            :class:`Request`.
+        :param headers: (optional) Dictionary of HTTP Headers to send with the
+            :class:`Request`.
+        :param cookies: (optional) Dict or CookieJar object to send with the
+            :class:`Request`.
+        :param files: (optional) Dictionary of ``'filename': file-like-objects``
+            for multipart encoding upload.
+        :param auth: (optional) Auth tuple or callable to enable
+            Basic/Digest/Custom HTTP Auth.
+        :param timeout: (optional) How long to wait for the server to send
+            data before giving up, as a float, or a :ref:`(connect timeout,
+            read timeout) <timeouts>` tuple.
+        :type timeout: float or tuple
+        :param allow_redirects: (optional) Set to True by default.
+        :type allow_redirects: bool
+        :param proxies: (optional) Dictionary mapping protocol or protocol and
+            hostname to the URL of the proxy.
+        :param stream: (optional) whether to immediately download the response
+            content. Defaults to ``False``.
+        :param verify: (optional) Either a boolean, in which case it controls whether we verify
+            the server's TLS certificate, or a string, in which case it must be a path
+            to a CA bundle to use. Defaults to ``True``.
+        :param cert: (optional) if String, path to ssl client cert file (.pem).
+            If Tuple, ('cert', 'key') pair.
+        :rtype: requests.Response
+        """
+        # Create the Request.
+        req = Request(
+            method=method.upper(),
+            url=url,
+            headers=headers,
+            files=files,
+            data=data or {},
+            json=json,
+            params=params or {},
+            auth=auth,
+            cookies=cookies,
+            hooks=hooks,
+        )
+        prep = self.prepare_request(req)
+
+        proxies = proxies or {}
+
+        settings = self.merge_environment_settings(
+            prep.url, proxies, stream, verify, cert
+        )
+
+        # Send the request.
+        send_kwargs = {
+            'timeout': timeout,
+            'allow_redirects': allow_redirects,
+        }
+        send_kwargs.update(settings)
+        resp = self.send(prep, **send_kwargs)
+
+        return resp
+
+    def get(self, url, **kwargs):
+        r"""Sends a GET request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        kwargs.setdefault('allow_redirects', True)
+        return self.request('GET', url, **kwargs)
+
+    def options(self, url, **kwargs):
+        r"""Sends a OPTIONS request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        kwargs.setdefault('allow_redirects', True)
+        return self.request('OPTIONS', url, **kwargs)
+
+    def head(self, url, **kwargs):
+        r"""Sends a HEAD request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        kwargs.setdefault('allow_redirects', False)
+        return self.request('HEAD', url, **kwargs)
+
+    def post(self, url, data=None, json=None, **kwargs):
+        r"""Sends a POST request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+            object to send in the body of the :class:`Request`.
+        :param json: (optional) json to send in the body of the :class:`Request`.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        return self.request('POST', url, data=data, json=json, **kwargs)
+
+    def put(self, url, data=None, **kwargs):
+        r"""Sends a PUT request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+            object to send in the body of the :class:`Request`.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        return self.request('PUT', url, data=data, **kwargs)
+
+    def patch(self, url, data=None, **kwargs):
+        r"""Sends a PATCH request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param data: (optional) Dictionary, list of tuples, bytes, or file-like
+            object to send in the body of the :class:`Request`.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        return self.request('PATCH', url, data=data, **kwargs)
+
+    def delete(self, url, **kwargs):
+        r"""Sends a DELETE request. Returns :class:`Response` object.
+
+        :param url: URL for the new :class:`Request` object.
+        :param \*\*kwargs: Optional arguments that ``request`` takes.
+        :rtype: requests.Response
+        """
+
+        return self.request('DELETE', url, **kwargs)
+
+    def send(self, request, **kwargs):
+        """Send a given PreparedRequest.
+
+        :rtype: requests.Response
+        """
+        # Set defaults that the hooks can utilize to ensure they always have
+        # the correct parameters to reproduce the previous request.
+        kwargs.setdefault('stream', self.stream)
+        kwargs.setdefault('verify', self.verify)
+        kwargs.setdefault('cert', self.cert)
+        kwargs.setdefault('proxies', self.proxies)
+
+        # It's possible that users might accidentally send a Request object.
+        # Guard against that specific failure case.
+        if isinstance(request, Request):
+            raise ValueError('You can only send PreparedRequests.')
+
+        # Set up variables needed for resolve_redirects and dispatching of hooks
+        allow_redirects = kwargs.pop('allow_redirects', True)
+        stream = kwargs.get('stream')
+        hooks = request.hooks
+
+        # Get the appropriate adapter to use
+        adapter = self.get_adapter(url=request.url)
+
+        # Start time (approximately) of the request
+        start = preferred_clock()
+
+        # Send the request
+        r = adapter.send(request, **kwargs)
+
+        # Total elapsed time of the request (approximately)
+        elapsed = preferred_clock() - start
+        r.elapsed = timedelta(seconds=elapsed)
+
+        # Response manipulation hooks
+        r = dispatch_hook('response', hooks, r, **kwargs)
+
+        # Persist cookies
+        if r.history:
+
+            # If the hooks create history then we want those cookies too
+            for resp in r.history:
+                extract_cookies_to_jar(self.cookies, resp.request, resp.raw)
+
+        extract_cookies_to_jar(self.cookies, request, r.raw)
+
+        # Resolve redirects if allowed.
+        if allow_redirects:
+            # Redirect resolving generator.
+            gen = self.resolve_redirects(r, request, **kwargs)
+            history = [resp for resp in gen]
+        else:
+            history = []
+
+        # Shuffle things around if there's history.
+        if history:
+            # Insert the first (original) request at the start
+            history.insert(0, r)
+            # Get the last request made
+            r = history.pop()
+            r.history = history
+
+        # If redirects aren't being followed, store the response on the Request for Response.next().
+        if not allow_redirects:
+            try:
+                r._next = next(self.resolve_redirects(r, request, yield_requests=True, **kwargs))
+            except StopIteration:
+                pass
+
+        if not stream:
+            r.content
+
+        return r
+
+    def merge_environment_settings(self, url, proxies, stream, verify, cert):
+        """
+        Check the environment and merge it with some settings.
+
+        :rtype: dict
+        """
+        # Gather clues from the surrounding environment.
+        if self.trust_env:
+            # Set environment's proxies.
+            no_proxy = proxies.get('no_proxy') if proxies is not None else None
+            env_proxies = get_environ_proxies(url, no_proxy=no_proxy)
+            for (k, v) in env_proxies.items():
+                proxies.setdefault(k, v)
+
+            # Look for requests environment configuration and be compatible
+            # with cURL.
+            if verify is True or verify is None:
+                verify = (os.environ.get('REQUESTS_CA_BUNDLE') or
+                          os.environ.get('CURL_CA_BUNDLE'))
+
+        # Merge all the kwargs.
+        proxies = merge_setting(proxies, self.proxies)
+        stream = merge_setting(stream, self.stream)
+        verify = merge_setting(verify, self.verify)
+        cert = merge_setting(cert, self.cert)
+
+        return {'verify': verify, 'proxies': proxies, 'stream': stream,
+                'cert': cert}
+
+    def get_adapter(self, url):
+        """
+        Returns the appropriate connection adapter for the given URL.
+
+        :rtype: requests.adapters.BaseAdapter
+        """
+        for (prefix, adapter) in self.adapters.items():
+
+            if url.lower().startswith(prefix.lower()):
+                return adapter
+
+        # Nothing matches :-/
+        raise InvalidSchema("No connection adapters were found for {!r}".format(url))
+
+    def close(self):
+        """Closes all adapters and as such the session"""
+        for v in self.adapters.values():
+            v.close()
+
+    def mount(self, prefix, adapter):
+        """Registers a connection adapter to a prefix.
+
+        Adapters are sorted in descending order by prefix length.
+        """
+        self.adapters[prefix] = adapter
+        keys_to_move = [k for k in self.adapters if len(k) < len(prefix)]
+
+        for key in keys_to_move:
+            self.adapters[key] = self.adapters.pop(key)
+
+    def __getstate__(self):
+        state = {attr: getattr(self, attr, None) for attr in self.__attrs__}
+        return state
+
+    def __setstate__(self, state):
+        for attr, value in state.items():
+            setattr(self, attr, value)
+
+
+def session():
+    """
+    Returns a :class:`Session` for context-management.
+
+    .. deprecated:: 1.0.0
+
+        This method has been deprecated since version 1.0.0 and is only kept for
+        backwards compatibility. New code should use :class:`~requests.sessions.Session`
+        to create a session. This may be removed at a future date.
+
+    :rtype: Session
+    """
+    return Session()
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/status_codes.py b/venv/Lib/site-packages/pip/_vendor/requests/status_codes.py
new file mode 100644
index 000000000..d80a7cd4d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/status_codes.py
@@ -0,0 +1,123 @@
+# -*- coding: utf-8 -*-
+
+r"""
+The ``codes`` object defines a mapping from common names for HTTP statuses
+to their numerical codes, accessible either as attributes or as dictionary
+items.
+
+Example::
+
+    >>> import requests
+    >>> requests.codes['temporary_redirect']
+    307
+    >>> requests.codes.teapot
+    418
+    >>> requests.codes['\o/']
+    200
+
+Some codes have multiple names, and both upper- and lower-case versions of
+the names are allowed. For example, ``codes.ok``, ``codes.OK``, and
+``codes.okay`` all correspond to the HTTP status code 200.
+"""
+
+from .structures import LookupDict
+
+_codes = {
+
+    # Informational.
+    100: ('continue',),
+    101: ('switching_protocols',),
+    102: ('processing',),
+    103: ('checkpoint',),
+    122: ('uri_too_long', 'request_uri_too_long'),
+    200: ('ok', 'okay', 'all_ok', 'all_okay', 'all_good', '\\o/', '✓'),
+    201: ('created',),
+    202: ('accepted',),
+    203: ('non_authoritative_info', 'non_authoritative_information'),
+    204: ('no_content',),
+    205: ('reset_content', 'reset'),
+    206: ('partial_content', 'partial'),
+    207: ('multi_status', 'multiple_status', 'multi_stati', 'multiple_stati'),
+    208: ('already_reported',),
+    226: ('im_used',),
+
+    # Redirection.
+    300: ('multiple_choices',),
+    301: ('moved_permanently', 'moved', '\\o-'),
+    302: ('found',),
+    303: ('see_other', 'other'),
+    304: ('not_modified',),
+    305: ('use_proxy',),
+    306: ('switch_proxy',),
+    307: ('temporary_redirect', 'temporary_moved', 'temporary'),
+    308: ('permanent_redirect',
+          'resume_incomplete', 'resume',),  # These 2 to be removed in 3.0
+
+    # Client Error.
+    400: ('bad_request', 'bad'),
+    401: ('unauthorized',),
+    402: ('payment_required', 'payment'),
+    403: ('forbidden',),
+    404: ('not_found', '-o-'),
+    405: ('method_not_allowed', 'not_allowed'),
+    406: ('not_acceptable',),
+    407: ('proxy_authentication_required', 'proxy_auth', 'proxy_authentication'),
+    408: ('request_timeout', 'timeout'),
+    409: ('conflict',),
+    410: ('gone',),
+    411: ('length_required',),
+    412: ('precondition_failed', 'precondition'),
+    413: ('request_entity_too_large',),
+    414: ('request_uri_too_large',),
+    415: ('unsupported_media_type', 'unsupported_media', 'media_type'),
+    416: ('requested_range_not_satisfiable', 'requested_range', 'range_not_satisfiable'),
+    417: ('expectation_failed',),
+    418: ('im_a_teapot', 'teapot', 'i_am_a_teapot'),
+    421: ('misdirected_request',),
+    422: ('unprocessable_entity', 'unprocessable'),
+    423: ('locked',),
+    424: ('failed_dependency', 'dependency'),
+    425: ('unordered_collection', 'unordered'),
+    426: ('upgrade_required', 'upgrade'),
+    428: ('precondition_required', 'precondition'),
+    429: ('too_many_requests', 'too_many'),
+    431: ('header_fields_too_large', 'fields_too_large'),
+    444: ('no_response', 'none'),
+    449: ('retry_with', 'retry'),
+    450: ('blocked_by_windows_parental_controls', 'parental_controls'),
+    451: ('unavailable_for_legal_reasons', 'legal_reasons'),
+    499: ('client_closed_request',),
+
+    # Server Error.
+    500: ('internal_server_error', 'server_error', '/o\\', '✗'),
+    501: ('not_implemented',),
+    502: ('bad_gateway',),
+    503: ('service_unavailable', 'unavailable'),
+    504: ('gateway_timeout',),
+    505: ('http_version_not_supported', 'http_version'),
+    506: ('variant_also_negotiates',),
+    507: ('insufficient_storage',),
+    509: ('bandwidth_limit_exceeded', 'bandwidth'),
+    510: ('not_extended',),
+    511: ('network_authentication_required', 'network_auth', 'network_authentication'),
+}
+
+codes = LookupDict(name='status_codes')
+
+def _init():
+    for code, titles in _codes.items():
+        for title in titles:
+            setattr(codes, title, code)
+            if not title.startswith(('\\', '/')):
+                setattr(codes, title.upper(), code)
+
+    def doc(code):
+        names = ', '.join('``%s``' % n for n in _codes[code])
+        return '* %d: %s' % (code, names)
+
+    global __doc__
+    __doc__ = (__doc__ + '\n' +
+               '\n'.join(doc(code) for code in sorted(_codes))
+               if __doc__ is not None else None)
+
+_init()
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/structures.py b/venv/Lib/site-packages/pip/_vendor/requests/structures.py
new file mode 100644
index 000000000..8ee0ba7a0
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/structures.py
@@ -0,0 +1,105 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.structures
+~~~~~~~~~~~~~~~~~~~
+
+Data structures that power Requests.
+"""
+
+from collections import OrderedDict
+
+from .compat import Mapping, MutableMapping
+
+
+class CaseInsensitiveDict(MutableMapping):
+    """A case-insensitive ``dict``-like object.
+
+    Implements all methods and operations of
+    ``MutableMapping`` as well as dict's ``copy``. Also
+    provides ``lower_items``.
+
+    All keys are expected to be strings. The structure remembers the
+    case of the last key to be set, and ``iter(instance)``,
+    ``keys()``, ``items()``, ``iterkeys()``, and ``iteritems()``
+    will contain case-sensitive keys. However, querying and contains
+    testing is case insensitive::
+
+        cid = CaseInsensitiveDict()
+        cid['Accept'] = 'application/json'
+        cid['aCCEPT'] == 'application/json'  # True
+        list(cid) == ['Accept']  # True
+
+    For example, ``headers['content-encoding']`` will return the
+    value of a ``'Content-Encoding'`` response header, regardless
+    of how the header name was originally stored.
+
+    If the constructor, ``.update``, or equality comparison
+    operations are given keys that have equal ``.lower()``s, the
+    behavior is undefined.
+    """
+
+    def __init__(self, data=None, **kwargs):
+        self._store = OrderedDict()
+        if data is None:
+            data = {}
+        self.update(data, **kwargs)
+
+    def __setitem__(self, key, value):
+        # Use the lowercased key for lookups, but store the actual
+        # key alongside the value.
+        self._store[key.lower()] = (key, value)
+
+    def __getitem__(self, key):
+        return self._store[key.lower()][1]
+
+    def __delitem__(self, key):
+        del self._store[key.lower()]
+
+    def __iter__(self):
+        return (casedkey for casedkey, mappedvalue in self._store.values())
+
+    def __len__(self):
+        return len(self._store)
+
+    def lower_items(self):
+        """Like iteritems(), but with all lowercase keys."""
+        return (
+            (lowerkey, keyval[1])
+            for (lowerkey, keyval)
+            in self._store.items()
+        )
+
+    def __eq__(self, other):
+        if isinstance(other, Mapping):
+            other = CaseInsensitiveDict(other)
+        else:
+            return NotImplemented
+        # Compare insensitively
+        return dict(self.lower_items()) == dict(other.lower_items())
+
+    # Copy is required
+    def copy(self):
+        return CaseInsensitiveDict(self._store.values())
+
+    def __repr__(self):
+        return str(dict(self.items()))
+
+
+class LookupDict(dict):
+    """Dictionary lookup object."""
+
+    def __init__(self, name=None):
+        self.name = name
+        super(LookupDict, self).__init__()
+
+    def __repr__(self):
+        return '<lookup \'%s\'>' % (self.name)
+
+    def __getitem__(self, key):
+        # We allow fall-through here, so values default to None
+
+        return self.__dict__.get(key, None)
+
+    def get(self, key, default=None):
+        return self.__dict__.get(key, default)
diff --git a/venv/Lib/site-packages/pip/_vendor/requests/utils.py b/venv/Lib/site-packages/pip/_vendor/requests/utils.py
new file mode 100644
index 000000000..c1700d7fe
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/requests/utils.py
@@ -0,0 +1,982 @@
+# -*- coding: utf-8 -*-
+
+"""
+requests.utils
+~~~~~~~~~~~~~~
+
+This module provides utility functions that are used within Requests
+that are also useful for external consumption.
+"""
+
+import codecs
+import contextlib
+import io
+import os
+import re
+import socket
+import struct
+import sys
+import tempfile
+import warnings
+import zipfile
+from collections import OrderedDict
+
+from .__version__ import __version__
+from . import certs
+# to_native_string is unused here, but imported here for backwards compatibility
+from ._internal_utils import to_native_string
+from .compat import parse_http_list as _parse_list_header
+from .compat import (
+    quote, urlparse, bytes, str, unquote, getproxies,
+    proxy_bypass, urlunparse, basestring, integer_types, is_py3,
+    proxy_bypass_environment, getproxies_environment, Mapping)
+from .cookies import cookiejar_from_dict
+from .structures import CaseInsensitiveDict
+from .exceptions import (
+    InvalidURL, InvalidHeader, FileModeWarning, UnrewindableBodyError)
+
+NETRC_FILES = ('.netrc', '_netrc')
+
+DEFAULT_CA_BUNDLE_PATH = certs.where()
+
+DEFAULT_PORTS = {'http': 80, 'https': 443}
+
+
+if sys.platform == 'win32':
+    # provide a proxy_bypass version on Windows without DNS lookups
+
+    def proxy_bypass_registry(host):
+        try:
+            if is_py3:
+                import winreg
+            else:
+                import _winreg as winreg
+        except ImportError:
+            return False
+
+        try:
+            internetSettings = winreg.OpenKey(winreg.HKEY_CURRENT_USER,
+                r'Software\Microsoft\Windows\CurrentVersion\Internet Settings')
+            # ProxyEnable could be REG_SZ or REG_DWORD, normalizing it
+            proxyEnable = int(winreg.QueryValueEx(internetSettings,
+                                              'ProxyEnable')[0])
+            # ProxyOverride is almost always a string
+            proxyOverride = winreg.QueryValueEx(internetSettings,
+                                                'ProxyOverride')[0]
+        except OSError:
+            return False
+        if not proxyEnable or not proxyOverride:
+            return False
+
+        # make a check value list from the registry entry: replace the
+        # '<local>' string by the localhost entry and the corresponding
+        # canonical entry.
+        proxyOverride = proxyOverride.split(';')
+        # now check if we match one of the registry values.
+        for test in proxyOverride:
+            if test == '<local>':
+                if '.' not in host:
+                    return True
+            test = test.replace(".", r"\.")     # mask dots
+            test = test.replace("*", r".*")     # change glob sequence
+            test = test.replace("?", r".")      # change glob char
+            if re.match(test, host, re.I):
+                return True
+        return False
+
+    def proxy_bypass(host):  # noqa
+        """Return True, if the host should be bypassed.
+
+        Checks proxy settings gathered from the environment, if specified,
+        or the registry.
+        """
+        if getproxies_environment():
+            return proxy_bypass_environment(host)
+        else:
+            return proxy_bypass_registry(host)
+
+
+def dict_to_sequence(d):
+    """Returns an internal sequence dictionary update."""
+
+    if hasattr(d, 'items'):
+        d = d.items()
+
+    return d
+
+
+def super_len(o):
+    total_length = None
+    current_position = 0
+
+    if hasattr(o, '__len__'):
+        total_length = len(o)
+
+    elif hasattr(o, 'len'):
+        total_length = o.len
+
+    elif hasattr(o, 'fileno'):
+        try:
+            fileno = o.fileno()
+        except io.UnsupportedOperation:
+            pass
+        else:
+            total_length = os.fstat(fileno).st_size
+
+            # Having used fstat to determine the file length, we need to
+            # confirm that this file was opened up in binary mode.
+            if 'b' not in o.mode:
+                warnings.warn((
+                    "Requests has determined the content-length for this "
+                    "request using the binary size of the file: however, the "
+                    "file has been opened in text mode (i.e. without the 'b' "
+                    "flag in the mode). This may lead to an incorrect "
+                    "content-length. In Requests 3.0, support will be removed "
+                    "for files in text mode."),
+                    FileModeWarning
+                )
+
+    if hasattr(o, 'tell'):
+        try:
+            current_position = o.tell()
+        except (OSError, IOError):
+            # This can happen in some weird situations, such as when the file
+            # is actually a special file descriptor like stdin. In this
+            # instance, we don't know what the length is, so set it to zero and
+            # let requests chunk it instead.
+            if total_length is not None:
+                current_position = total_length
+        else:
+            if hasattr(o, 'seek') and total_length is None:
+                # StringIO and BytesIO have seek but no useable fileno
+                try:
+                    # seek to end of file
+                    o.seek(0, 2)
+                    total_length = o.tell()
+
+                    # seek back to current position to support
+                    # partially read file-like objects
+                    o.seek(current_position or 0)
+                except (OSError, IOError):
+                    total_length = 0
+
+    if total_length is None:
+        total_length = 0
+
+    return max(0, total_length - current_position)
+
+
+def get_netrc_auth(url, raise_errors=False):
+    """Returns the Requests tuple auth for a given url from netrc."""
+
+    try:
+        from netrc import netrc, NetrcParseError
+
+        netrc_path = None
+
+        for f in NETRC_FILES:
+            try:
+                loc = os.path.expanduser('~/{}'.format(f))
+            except KeyError:
+                # os.path.expanduser can fail when $HOME is undefined and
+                # getpwuid fails. See https://bugs.python.org/issue20164 &
+                # https://github.com/psf/requests/issues/1846
+                return
+
+            if os.path.exists(loc):
+                netrc_path = loc
+                break
+
+        # Abort early if there isn't one.
+        if netrc_path is None:
+            return
+
+        ri = urlparse(url)
+
+        # Strip port numbers from netloc. This weird `if...encode`` dance is
+        # used for Python 3.2, which doesn't support unicode literals.
+        splitstr = b':'
+        if isinstance(url, str):
+            splitstr = splitstr.decode('ascii')
+        host = ri.netloc.split(splitstr)[0]
+
+        try:
+            _netrc = netrc(netrc_path).authenticators(host)
+            if _netrc:
+                # Return with login / password
+                login_i = (0 if _netrc[0] else 1)
+                return (_netrc[login_i], _netrc[2])
+        except (NetrcParseError, IOError):
+            # If there was a parsing error or a permissions issue reading the file,
+            # we'll just skip netrc auth unless explicitly asked to raise errors.
+            if raise_errors:
+                raise
+
+    # AppEngine hackiness.
+    except (ImportError, AttributeError):
+        pass
+
+
+def guess_filename(obj):
+    """Tries to guess the filename of the given object."""
+    name = getattr(obj, 'name', None)
+    if (name and isinstance(name, basestring) and name[0] != '<' and
+            name[-1] != '>'):
+        return os.path.basename(name)
+
+
+def extract_zipped_paths(path):
+    """Replace nonexistent paths that look like they refer to a member of a zip
+    archive with the location of an extracted copy of the target, or else
+    just return the provided path unchanged.
+    """
+    if os.path.exists(path):
+        # this is already a valid path, no need to do anything further
+        return path
+
+    # find the first valid part of the provided path and treat that as a zip archive
+    # assume the rest of the path is the name of a member in the archive
+    archive, member = os.path.split(path)
+    while archive and not os.path.exists(archive):
+        archive, prefix = os.path.split(archive)
+        member = '/'.join([prefix, member])
+
+    if not zipfile.is_zipfile(archive):
+        return path
+
+    zip_file = zipfile.ZipFile(archive)
+    if member not in zip_file.namelist():
+        return path
+
+    # we have a valid zip archive and a valid member of that archive
+    tmp = tempfile.gettempdir()
+    extracted_path = os.path.join(tmp, *member.split('/'))
+    if not os.path.exists(extracted_path):
+        extracted_path = zip_file.extract(member, path=tmp)
+
+    return extracted_path
+
+
+def from_key_val_list(value):
+    """Take an object and test to see if it can be represented as a
+    dictionary. Unless it can not be represented as such, return an
+    OrderedDict, e.g.,
+
+    ::
+
+        >>> from_key_val_list([('key', 'val')])
+        OrderedDict([('key', 'val')])
+        >>> from_key_val_list('string')
+        Traceback (most recent call last):
+        ...
+        ValueError: cannot encode objects that are not 2-tuples
+        >>> from_key_val_list({'key': 'val'})
+        OrderedDict([('key', 'val')])
+
+    :rtype: OrderedDict
+    """
+    if value is None:
+        return None
+
+    if isinstance(value, (str, bytes, bool, int)):
+        raise ValueError('cannot encode objects that are not 2-tuples')
+
+    return OrderedDict(value)
+
+
+def to_key_val_list(value):
+    """Take an object and test to see if it can be represented as a
+    dictionary. If it can be, return a list of tuples, e.g.,
+
+    ::
+
+        >>> to_key_val_list([('key', 'val')])
+        [('key', 'val')]
+        >>> to_key_val_list({'key': 'val'})
+        [('key', 'val')]
+        >>> to_key_val_list('string')
+        Traceback (most recent call last):
+        ...
+        ValueError: cannot encode objects that are not 2-tuples
+
+    :rtype: list
+    """
+    if value is None:
+        return None
+
+    if isinstance(value, (str, bytes, bool, int)):
+        raise ValueError('cannot encode objects that are not 2-tuples')
+
+    if isinstance(value, Mapping):
+        value = value.items()
+
+    return list(value)
+
+
+# From mitsuhiko/werkzeug (used with permission).
+def parse_list_header(value):
+    """Parse lists as described by RFC 2068 Section 2.
+
+    In particular, parse comma-separated lists where the elements of
+    the list may include quoted-strings.  A quoted-string could
+    contain a comma.  A non-quoted string could have quotes in the
+    middle.  Quotes are removed automatically after parsing.
+
+    It basically works like :func:`parse_set_header` just that items
+    may appear multiple times and case sensitivity is preserved.
+
+    The return value is a standard :class:`list`:
+
+    >>> parse_list_header('token, "quoted value"')
+    ['token', 'quoted value']
+
+    To create a header from the :class:`list` again, use the
+    :func:`dump_header` function.
+
+    :param value: a string with a list header.
+    :return: :class:`list`
+    :rtype: list
+    """
+    result = []
+    for item in _parse_list_header(value):
+        if item[:1] == item[-1:] == '"':
+            item = unquote_header_value(item[1:-1])
+        result.append(item)
+    return result
+
+
+# From mitsuhiko/werkzeug (used with permission).
+def parse_dict_header(value):
+    """Parse lists of key, value pairs as described by RFC 2068 Section 2 and
+    convert them into a python dict:
+
+    >>> d = parse_dict_header('foo="is a fish", bar="as well"')
+    >>> type(d) is dict
+    True
+    >>> sorted(d.items())
+    [('bar', 'as well'), ('foo', 'is a fish')]
+
+    If there is no value for a key it will be `None`:
+
+    >>> parse_dict_header('key_without_value')
+    {'key_without_value': None}
+
+    To create a header from the :class:`dict` again, use the
+    :func:`dump_header` function.
+
+    :param value: a string with a dict header.
+    :return: :class:`dict`
+    :rtype: dict
+    """
+    result = {}
+    for item in _parse_list_header(value):
+        if '=' not in item:
+            result[item] = None
+            continue
+        name, value = item.split('=', 1)
+        if value[:1] == value[-1:] == '"':
+            value = unquote_header_value(value[1:-1])
+        result[name] = value
+    return result
+
+
+# From mitsuhiko/werkzeug (used with permission).
+def unquote_header_value(value, is_filename=False):
+    r"""Unquotes a header value.  (Reversal of :func:`quote_header_value`).
+    This does not use the real unquoting but what browsers are actually
+    using for quoting.
+
+    :param value: the header value to unquote.
+    :rtype: str
+    """
+    if value and value[0] == value[-1] == '"':
+        # this is not the real unquoting, but fixing this so that the
+        # RFC is met will result in bugs with internet explorer and
+        # probably some other browsers as well.  IE for example is
+        # uploading files with "C:\foo\bar.txt" as filename
+        value = value[1:-1]
+
+        # if this is a filename and the starting characters look like
+        # a UNC path, then just return the value without quotes.  Using the
+        # replace sequence below on a UNC path has the effect of turning
+        # the leading double slash into a single slash and then
+        # _fix_ie_filename() doesn't work correctly.  See #458.
+        if not is_filename or value[:2] != '\\\\':
+            return value.replace('\\\\', '\\').replace('\\"', '"')
+    return value
+
+
+def dict_from_cookiejar(cj):
+    """Returns a key/value dictionary from a CookieJar.
+
+    :param cj: CookieJar object to extract cookies from.
+    :rtype: dict
+    """
+
+    cookie_dict = {}
+
+    for cookie in cj:
+        cookie_dict[cookie.name] = cookie.value
+
+    return cookie_dict
+
+
+def add_dict_to_cookiejar(cj, cookie_dict):
+    """Returns a CookieJar from a key/value dictionary.
+
+    :param cj: CookieJar to insert cookies into.
+    :param cookie_dict: Dict of key/values to insert into CookieJar.
+    :rtype: CookieJar
+    """
+
+    return cookiejar_from_dict(cookie_dict, cj)
+
+
+def get_encodings_from_content(content):
+    """Returns encodings from given content string.
+
+    :param content: bytestring to extract encodings from.
+    """
+    warnings.warn((
+        'In requests 3.0, get_encodings_from_content will be removed. For '
+        'more information, please see the discussion on issue #2266. (This'
+        ' warning should only appear once.)'),
+        DeprecationWarning)
+
+    charset_re = re.compile(r'<meta.*?charset=["\']*(.+?)["\'>]', flags=re.I)
+    pragma_re = re.compile(r'<meta.*?content=["\']*;?charset=(.+?)["\'>]', flags=re.I)
+    xml_re = re.compile(r'^<\?xml.*?encoding=["\']*(.+?)["\'>]')
+
+    return (charset_re.findall(content) +
+            pragma_re.findall(content) +
+            xml_re.findall(content))
+
+
+def _parse_content_type_header(header):
+    """Returns content type and parameters from given header
+
+    :param header: string
+    :return: tuple containing content type and dictionary of
+         parameters
+    """
+
+    tokens = header.split(';')
+    content_type, params = tokens[0].strip(), tokens[1:]
+    params_dict = {}
+    items_to_strip = "\"' "
+
+    for param in params:
+        param = param.strip()
+        if param:
+            key, value = param, True
+            index_of_equals = param.find("=")
+            if index_of_equals != -1:
+                key = param[:index_of_equals].strip(items_to_strip)
+                value = param[index_of_equals + 1:].strip(items_to_strip)
+            params_dict[key.lower()] = value
+    return content_type, params_dict
+
+
+def get_encoding_from_headers(headers):
+    """Returns encodings from given HTTP Header Dict.
+
+    :param headers: dictionary to extract encoding from.
+    :rtype: str
+    """
+
+    content_type = headers.get('content-type')
+
+    if not content_type:
+        return None
+
+    content_type, params = _parse_content_type_header(content_type)
+
+    if 'charset' in params:
+        return params['charset'].strip("'\"")
+
+    if 'text' in content_type:
+        return 'ISO-8859-1'
+
+
+def stream_decode_response_unicode(iterator, r):
+    """Stream decodes a iterator."""
+
+    if r.encoding is None:
+        for item in iterator:
+            yield item
+        return
+
+    decoder = codecs.getincrementaldecoder(r.encoding)(errors='replace')
+    for chunk in iterator:
+        rv = decoder.decode(chunk)
+        if rv:
+            yield rv
+    rv = decoder.decode(b'', final=True)
+    if rv:
+        yield rv
+
+
+def iter_slices(string, slice_length):
+    """Iterate over slices of a string."""
+    pos = 0
+    if slice_length is None or slice_length <= 0:
+        slice_length = len(string)
+    while pos < len(string):
+        yield string[pos:pos + slice_length]
+        pos += slice_length
+
+
+def get_unicode_from_response(r):
+    """Returns the requested content back in unicode.
+
+    :param r: Response object to get unicode content from.
+
+    Tried:
+
+    1. charset from content-type
+    2. fall back and replace all unicode characters
+
+    :rtype: str
+    """
+    warnings.warn((
+        'In requests 3.0, get_unicode_from_response will be removed. For '
+        'more information, please see the discussion on issue #2266. (This'
+        ' warning should only appear once.)'),
+        DeprecationWarning)
+
+    tried_encodings = []
+
+    # Try charset from content-type
+    encoding = get_encoding_from_headers(r.headers)
+
+    if encoding:
+        try:
+            return str(r.content, encoding)
+        except UnicodeError:
+            tried_encodings.append(encoding)
+
+    # Fall back:
+    try:
+        return str(r.content, encoding, errors='replace')
+    except TypeError:
+        return r.content
+
+
+# The unreserved URI characters (RFC 3986)
+UNRESERVED_SET = frozenset(
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" + "0123456789-._~")
+
+
+def unquote_unreserved(uri):
+    """Un-escape any percent-escape sequences in a URI that are unreserved
+    characters. This leaves all reserved, illegal and non-ASCII bytes encoded.
+
+    :rtype: str
+    """
+    parts = uri.split('%')
+    for i in range(1, len(parts)):
+        h = parts[i][0:2]
+        if len(h) == 2 and h.isalnum():
+            try:
+                c = chr(int(h, 16))
+            except ValueError:
+                raise InvalidURL("Invalid percent-escape sequence: '%s'" % h)
+
+            if c in UNRESERVED_SET:
+                parts[i] = c + parts[i][2:]
+            else:
+                parts[i] = '%' + parts[i]
+        else:
+            parts[i] = '%' + parts[i]
+    return ''.join(parts)
+
+
+def requote_uri(uri):
+    """Re-quote the given URI.
+
+    This function passes the given URI through an unquote/quote cycle to
+    ensure that it is fully and consistently quoted.
+
+    :rtype: str
+    """
+    safe_with_percent = "!#$%&'()*+,/:;=?@[]~"
+    safe_without_percent = "!#$&'()*+,/:;=?@[]~"
+    try:
+        # Unquote only the unreserved characters
+        # Then quote only illegal characters (do not quote reserved,
+        # unreserved, or '%')
+        return quote(unquote_unreserved(uri), safe=safe_with_percent)
+    except InvalidURL:
+        # We couldn't unquote the given URI, so let's try quoting it, but
+        # there may be unquoted '%'s in the URI. We need to make sure they're
+        # properly quoted so they do not cause issues elsewhere.
+        return quote(uri, safe=safe_without_percent)
+
+
+def address_in_network(ip, net):
+    """This function allows you to check if an IP belongs to a network subnet
+
+    Example: returns True if ip = 192.168.1.1 and net = 192.168.1.0/24
+             returns False if ip = 192.168.1.1 and net = 192.168.100.0/24
+
+    :rtype: bool
+    """
+    ipaddr = struct.unpack('=L', socket.inet_aton(ip))[0]
+    netaddr, bits = net.split('/')
+    netmask = struct.unpack('=L', socket.inet_aton(dotted_netmask(int(bits))))[0]
+    network = struct.unpack('=L', socket.inet_aton(netaddr))[0] & netmask
+    return (ipaddr & netmask) == (network & netmask)
+
+
+def dotted_netmask(mask):
+    """Converts mask from /xx format to xxx.xxx.xxx.xxx
+
+    Example: if mask is 24 function returns 255.255.255.0
+
+    :rtype: str
+    """
+    bits = 0xffffffff ^ (1 << 32 - mask) - 1
+    return socket.inet_ntoa(struct.pack('>I', bits))
+
+
+def is_ipv4_address(string_ip):
+    """
+    :rtype: bool
+    """
+    try:
+        socket.inet_aton(string_ip)
+    except socket.error:
+        return False
+    return True
+
+
+def is_valid_cidr(string_network):
+    """
+    Very simple check of the cidr format in no_proxy variable.
+
+    :rtype: bool
+    """
+    if string_network.count('/') == 1:
+        try:
+            mask = int(string_network.split('/')[1])
+        except ValueError:
+            return False
+
+        if mask < 1 or mask > 32:
+            return False
+
+        try:
+            socket.inet_aton(string_network.split('/')[0])
+        except socket.error:
+            return False
+    else:
+        return False
+    return True
+
+
+@contextlib.contextmanager
+def set_environ(env_name, value):
+    """Set the environment variable 'env_name' to 'value'
+
+    Save previous value, yield, and then restore the previous value stored in
+    the environment variable 'env_name'.
+
+    If 'value' is None, do nothing"""
+    value_changed = value is not None
+    if value_changed:
+        old_value = os.environ.get(env_name)
+        os.environ[env_name] = value
+    try:
+        yield
+    finally:
+        if value_changed:
+            if old_value is None:
+                del os.environ[env_name]
+            else:
+                os.environ[env_name] = old_value
+
+
+def should_bypass_proxies(url, no_proxy):
+    """
+    Returns whether we should bypass proxies or not.
+
+    :rtype: bool
+    """
+    # Prioritize lowercase environment variables over uppercase
+    # to keep a consistent behaviour with other http projects (curl, wget).
+    get_proxy = lambda k: os.environ.get(k) or os.environ.get(k.upper())
+
+    # First check whether no_proxy is defined. If it is, check that the URL
+    # we're getting isn't in the no_proxy list.
+    no_proxy_arg = no_proxy
+    if no_proxy is None:
+        no_proxy = get_proxy('no_proxy')
+    parsed = urlparse(url)
+
+    if parsed.hostname is None:
+        # URLs don't always have hostnames, e.g. file:/// urls.
+        return True
+
+    if no_proxy:
+        # We need to check whether we match here. We need to see if we match
+        # the end of the hostname, both with and without the port.
+        no_proxy = (
+            host for host in no_proxy.replace(' ', '').split(',') if host
+        )
+
+        if is_ipv4_address(parsed.hostname):
+            for proxy_ip in no_proxy:
+                if is_valid_cidr(proxy_ip):
+                    if address_in_network(parsed.hostname, proxy_ip):
+                        return True
+                elif parsed.hostname == proxy_ip:
+                    # If no_proxy ip was defined in plain IP notation instead of cidr notation &
+                    # matches the IP of the index
+                    return True
+        else:
+            host_with_port = parsed.hostname
+            if parsed.port:
+                host_with_port += ':{}'.format(parsed.port)
+
+            for host in no_proxy:
+                if parsed.hostname.endswith(host) or host_with_port.endswith(host):
+                    # The URL does match something in no_proxy, so we don't want
+                    # to apply the proxies on this URL.
+                    return True
+
+    with set_environ('no_proxy', no_proxy_arg):
+        # parsed.hostname can be `None` in cases such as a file URI.
+        try:
+            bypass = proxy_bypass(parsed.hostname)
+        except (TypeError, socket.gaierror):
+            bypass = False
+
+    if bypass:
+        return True
+
+    return False
+
+
+def get_environ_proxies(url, no_proxy=None):
+    """
+    Return a dict of environment proxies.
+
+    :rtype: dict
+    """
+    if should_bypass_proxies(url, no_proxy=no_proxy):
+        return {}
+    else:
+        return getproxies()
+
+
+def select_proxy(url, proxies):
+    """Select a proxy for the url, if applicable.
+
+    :param url: The url being for the request
+    :param proxies: A dictionary of schemes or schemes and hosts to proxy URLs
+    """
+    proxies = proxies or {}
+    urlparts = urlparse(url)
+    if urlparts.hostname is None:
+        return proxies.get(urlparts.scheme, proxies.get('all'))
+
+    proxy_keys = [
+        urlparts.scheme + '://' + urlparts.hostname,
+        urlparts.scheme,
+        'all://' + urlparts.hostname,
+        'all',
+    ]
+    proxy = None
+    for proxy_key in proxy_keys:
+        if proxy_key in proxies:
+            proxy = proxies[proxy_key]
+            break
+
+    return proxy
+
+
+def default_user_agent(name="python-requests"):
+    """
+    Return a string representing the default user agent.
+
+    :rtype: str
+    """
+    return '%s/%s' % (name, __version__)
+
+
+def default_headers():
+    """
+    :rtype: requests.structures.CaseInsensitiveDict
+    """
+    return CaseInsensitiveDict({
+        'User-Agent': default_user_agent(),
+        'Accept-Encoding': ', '.join(('gzip', 'deflate')),
+        'Accept': '*/*',
+        'Connection': 'keep-alive',
+    })
+
+
+def parse_header_links(value):
+    """Return a list of parsed link headers proxies.
+
+    i.e. Link: <http:/.../front.jpeg>; rel=front; type="image/jpeg",<http://.../back.jpeg>; rel=back;type="image/jpeg"
+
+    :rtype: list
+    """
+
+    links = []
+
+    replace_chars = ' \'"'
+
+    value = value.strip(replace_chars)
+    if not value:
+        return links
+
+    for val in re.split(', *<', value):
+        try:
+            url, params = val.split(';', 1)
+        except ValueError:
+            url, params = val, ''
+
+        link = {'url': url.strip('<> \'"')}
+
+        for param in params.split(';'):
+            try:
+                key, value = param.split('=')
+            except ValueError:
+                break
+
+            link[key.strip(replace_chars)] = value.strip(replace_chars)
+
+        links.append(link)
+
+    return links
+
+
+# Null bytes; no need to recreate these on each call to guess_json_utf
+_null = '\x00'.encode('ascii')  # encoding to ASCII for Python 3
+_null2 = _null * 2
+_null3 = _null * 3
+
+
+def guess_json_utf(data):
+    """
+    :rtype: str
+    """
+    # JSON always starts with two ASCII characters, so detection is as
+    # easy as counting the nulls and from their location and count
+    # determine the encoding. Also detect a BOM, if present.
+    sample = data[:4]
+    if sample in (codecs.BOM_UTF32_LE, codecs.BOM_UTF32_BE):
+        return 'utf-32'     # BOM included
+    if sample[:3] == codecs.BOM_UTF8:
+        return 'utf-8-sig'  # BOM included, MS style (discouraged)
+    if sample[:2] in (codecs.BOM_UTF16_LE, codecs.BOM_UTF16_BE):
+        return 'utf-16'     # BOM included
+    nullcount = sample.count(_null)
+    if nullcount == 0:
+        return 'utf-8'
+    if nullcount == 2:
+        if sample[::2] == _null2:   # 1st and 3rd are null
+            return 'utf-16-be'
+        if sample[1::2] == _null2:  # 2nd and 4th are null
+            return 'utf-16-le'
+        # Did not detect 2 valid UTF-16 ascii-range characters
+    if nullcount == 3:
+        if sample[:3] == _null3:
+            return 'utf-32-be'
+        if sample[1:] == _null3:
+            return 'utf-32-le'
+        # Did not detect a valid UTF-32 ascii-range character
+    return None
+
+
+def prepend_scheme_if_needed(url, new_scheme):
+    """Given a URL that may or may not have a scheme, prepend the given scheme.
+    Does not replace a present scheme with the one provided as an argument.
+
+    :rtype: str
+    """
+    scheme, netloc, path, params, query, fragment = urlparse(url, new_scheme)
+
+    # urlparse is a finicky beast, and sometimes decides that there isn't a
+    # netloc present. Assume that it's being over-cautious, and switch netloc
+    # and path if urlparse decided there was no netloc.
+    if not netloc:
+        netloc, path = path, netloc
+
+    return urlunparse((scheme, netloc, path, params, query, fragment))
+
+
+def get_auth_from_url(url):
+    """Given a url with authentication components, extract them into a tuple of
+    username,password.
+
+    :rtype: (str,str)
+    """
+    parsed = urlparse(url)
+
+    try:
+        auth = (unquote(parsed.username), unquote(parsed.password))
+    except (AttributeError, TypeError):
+        auth = ('', '')
+
+    return auth
+
+
+# Moved outside of function to avoid recompile every call
+_CLEAN_HEADER_REGEX_BYTE = re.compile(b'^\\S[^\\r\\n]*$|^$')
+_CLEAN_HEADER_REGEX_STR = re.compile(r'^\S[^\r\n]*$|^$')
+
+
+def check_header_validity(header):
+    """Verifies that header value is a string which doesn't contain
+    leading whitespace or return characters. This prevents unintended
+    header injection.
+
+    :param header: tuple, in the format (name, value).
+    """
+    name, value = header
+
+    if isinstance(value, bytes):
+        pat = _CLEAN_HEADER_REGEX_BYTE
+    else:
+        pat = _CLEAN_HEADER_REGEX_STR
+    try:
+        if not pat.match(value):
+            raise InvalidHeader("Invalid return character or leading space in header: %s" % name)
+    except TypeError:
+        raise InvalidHeader("Value for header {%s: %s} must be of type str or "
+                            "bytes, not %s" % (name, value, type(value)))
+
+
+def urldefragauth(url):
+    """
+    Given a url remove the fragment and the authentication part.
+
+    :rtype: str
+    """
+    scheme, netloc, path, params, query, fragment = urlparse(url)
+
+    # see func:`prepend_scheme_if_needed`
+    if not netloc:
+        netloc, path = path, netloc
+
+    netloc = netloc.rsplit('@', 1)[-1]
+
+    return urlunparse((scheme, netloc, path, params, query, ''))
+
+
+def rewind_body(prepared_request):
+    """Move file pointer back to its recorded starting position
+    so it can be read again on redirect.
+    """
+    body_seek = getattr(prepared_request.body, 'seek', None)
+    if body_seek is not None and isinstance(prepared_request._body_position, integer_types):
+        try:
+            body_seek(prepared_request._body_position)
+        except (IOError, OSError):
+            raise UnrewindableBodyError("An error occurred when rewinding request "
+                                        "body for redirect.")
+    else:
+        raise UnrewindableBodyError("Unable to rewind request body for redirect.")
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__init__.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/__init__.py
new file mode 100644
index 000000000..3b444545d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/__init__.py
@@ -0,0 +1,26 @@
+__all__ = [
+    "__version__",
+    "AbstractProvider",
+    "AbstractResolver",
+    "BaseReporter",
+    "InconsistentCandidate",
+    "Resolver",
+    "RequirementsConflicted",
+    "ResolutionError",
+    "ResolutionImpossible",
+    "ResolutionTooDeep",
+]
+
+__version__ = "0.4.0"
+
+
+from .providers import AbstractProvider, AbstractResolver
+from .reporters import BaseReporter
+from .resolvers import (
+    InconsistentCandidate,
+    RequirementsConflicted,
+    Resolver,
+    ResolutionError,
+    ResolutionImpossible,
+    ResolutionTooDeep,
+)
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..bce8553c5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/providers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/providers.cpython-36.pyc
new file mode 100644
index 000000000..1cdf66cce
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/providers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/reporters.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/reporters.cpython-36.pyc
new file mode 100644
index 000000000..e46ce736c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/reporters.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/resolvers.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/resolvers.cpython-36.pyc
new file mode 100644
index 000000000..3d7449c16
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/resolvers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/structs.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/structs.cpython-36.pyc
new file mode 100644
index 000000000..26e7b3d42
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/__pycache__/structs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__init__.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..6bd7584a5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/collections_abc.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/collections_abc.cpython-36.pyc
new file mode 100644
index 000000000..95318e97c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/__pycache__/collections_abc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/collections_abc.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/collections_abc.py
new file mode 100644
index 000000000..366cc5e2e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/compat/collections_abc.py
@@ -0,0 +1,6 @@
+__all__ = ["Sequence"]
+
+try:
+    from collections.abc import Sequence
+except ImportError:
+    from collections import Sequence
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/providers.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/providers.py
new file mode 100644
index 000000000..68b7290df
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/providers.py
@@ -0,0 +1,109 @@
+class AbstractProvider(object):
+    """Delegate class to provide requirement interface for the resolver.
+    """
+
+    def identify(self, dependency):
+        """Given a dependency, return an identifier for it.
+
+        This is used in many places to identify the dependency, e.g. whether
+        two requirements should have their specifier parts merged, whether
+        two specifications would conflict with each other (because they the
+        same name but different versions).
+        """
+        raise NotImplementedError
+
+    def get_preference(self, resolution, candidates, information):
+        """Produce a sort key for given specification based on preference.
+
+        The preference is defined as "I think this requirement should be
+        resolved first". The lower the return value is, the more preferred
+        this group of arguments is.
+
+        :param resolution: Currently pinned candidate, or `None`.
+        :param candidates: A list of possible candidates.
+        :param information: A list of requirement information.
+
+        Each information instance is a named tuple with two entries:
+
+        * `requirement` specifies a requirement contributing to the current
+          candidate list
+        * `parent` specifies the candidate that provides (dependend on) the
+          requirement, or `None` to indicate a root requirement.
+
+        The preference could depend on a various of issues, including (not
+        necessarily in this order):
+
+        * Is this package pinned in the current resolution result?
+        * How relaxed is the requirement? Stricter ones should probably be
+          worked on first? (I don't know, actually.)
+        * How many possibilities are there to satisfy this requirement? Those
+          with few left should likely be worked on first, I guess?
+        * Are there any known conflicts for this requirement? We should
+          probably work on those with the most known conflicts.
+
+        A sortable value should be returned (this will be used as the `key`
+        parameter of the built-in sorting function). The smaller the value is,
+        the more preferred this specification is (i.e. the sorting function
+        is called with `reverse=False`).
+        """
+        raise NotImplementedError
+
+    def find_matches(self, requirements):
+        """Find all possible candidates that satisfy the given requirements.
+
+        This should try to get candidates based on the requirements' types.
+        For VCS, local, and archive requirements, the one-and-only match is
+        returned, and for a "named" requirement, the index(es) should be
+        consulted to find concrete candidates for this requirement.
+
+        :param requirements: A collection of requirements which all of the the
+            returned candidates must match. All requirements are guaranteed to
+            have the same identifier. The collection is never empty.
+        :returns: An iterable that orders candidates by preference, e.g. the
+            most preferred candidate should come first.
+        """
+        raise NotImplementedError
+
+    def is_satisfied_by(self, requirement, candidate):
+        """Whether the given requirement can be satisfied by a candidate.
+
+        The candidate is guarenteed to have been generated from the
+        requirement.
+
+        A boolean should be returned to indicate whether `candidate` is a
+        viable solution to the requirement.
+        """
+        raise NotImplementedError
+
+    def get_dependencies(self, candidate):
+        """Get dependencies of a candidate.
+
+        This should return a collection of requirements that `candidate`
+        specifies as its dependencies.
+        """
+        raise NotImplementedError
+
+
+class AbstractResolver(object):
+    """The thing that performs the actual resolution work.
+    """
+
+    base_exception = Exception
+
+    def __init__(self, provider, reporter):
+        self.provider = provider
+        self.reporter = reporter
+
+    def resolve(self, requirements, **kwargs):
+        """Take a collection of constraints, spit out the resolution result.
+
+        This returns a representation of the final resolution state, with one
+        guarenteed attribute ``mapping`` that contains resolved candidates as
+        values. The keys are their respective identifiers.
+
+        :param requirements: A collection of constraints.
+        :param kwargs: Additional keyword arguments that subclasses may accept.
+
+        :raises: ``self.base_exception`` or its subclass.
+        """
+        raise NotImplementedError
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/reporters.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/reporters.py
new file mode 100644
index 000000000..a0a2a4588
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/reporters.py
@@ -0,0 +1,42 @@
+class BaseReporter(object):
+    """Delegate class to provider progress reporting for the resolver.
+    """
+
+    def starting(self):
+        """Called before the resolution actually starts.
+        """
+
+    def starting_round(self, index):
+        """Called before each round of resolution starts.
+
+        The index is zero-based.
+        """
+
+    def ending_round(self, index, state):
+        """Called before each round of resolution ends.
+
+        This is NOT called if the resolution ends at this round. Use `ending`
+        if you want to report finalization. The index is zero-based.
+        """
+
+    def ending(self, state):
+        """Called before the resolution ends successfully.
+        """
+
+    def adding_requirement(self, requirement, parent):
+        """Called when adding a new requirement into the resolve criteria.
+
+        :param requirement: The additional requirement to be applied to filter
+            the available candidaites.
+        :param parent: The candidate that requires ``requirement`` as a
+            dependency, or None if ``requirement`` is one of the root
+            requirements passed in from ``Resolver.resolve()``.
+        """
+
+    def backtracking(self, candidate):
+        """Called when rejecting a candidate during backtracking.
+        """
+
+    def pinning(self, candidate):
+        """Called when adding a candidate to the potential solution.
+        """
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/resolvers.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/resolvers.py
new file mode 100644
index 000000000..4497f976a
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/resolvers.py
@@ -0,0 +1,428 @@
+import collections
+
+from .compat import collections_abc
+from .providers import AbstractResolver
+from .structs import DirectedGraph
+
+
+RequirementInformation = collections.namedtuple(
+    "RequirementInformation", ["requirement", "parent"]
+)
+
+
+class ResolverException(Exception):
+    """A base class for all exceptions raised by this module.
+
+    Exceptions derived by this class should all be handled in this module. Any
+    bubbling pass the resolver should be treated as a bug.
+    """
+
+
+class RequirementsConflicted(ResolverException):
+    def __init__(self, criterion):
+        super(RequirementsConflicted, self).__init__(criterion)
+        self.criterion = criterion
+
+    def __str__(self):
+        return "Requirements conflict: {}".format(
+            ", ".join(repr(r) for r in self.criterion.iter_requirement()),
+        )
+
+
+class InconsistentCandidate(ResolverException):
+    def __init__(self, candidate, criterion):
+        super(InconsistentCandidate, self).__init__(candidate, criterion)
+        self.candidate = candidate
+        self.criterion = criterion
+
+    def __str__(self):
+        return "Provided candidate {!r} does not satisfy {}".format(
+            self.candidate,
+            ", ".join(repr(r) for r in self.criterion.iter_requirement()),
+        )
+
+
+class Criterion(object):
+    """Representation of possible resolution results of a package.
+
+    This holds three attributes:
+
+    * `information` is a collection of `RequirementInformation` pairs.
+      Each pair is a requirement contributing to this criterion, and the
+      candidate that provides the requirement.
+    * `incompatibilities` is a collection of all known not-to-work candidates
+      to exclude from consideration.
+    * `candidates` is a collection containing all possible candidates deducted
+      from the union of contributing requirements and known incompatibilities.
+      It should never be empty, except when the criterion is an attribute of a
+      raised `RequirementsConflicted` (in which case it is always empty).
+
+    .. note::
+        This class is intended to be externally immutable. **Do not** mutate
+        any of its attribute containers.
+    """
+
+    def __init__(self, candidates, information, incompatibilities):
+        self.candidates = candidates
+        self.information = information
+        self.incompatibilities = incompatibilities
+
+    def __repr__(self):
+        requirements = ", ".join(
+            "({!r}, via={!r})".format(req, parent)
+            for req, parent in self.information
+        )
+        return "Criterion({})".format(requirements)
+
+    @classmethod
+    def from_requirement(cls, provider, requirement, parent):
+        """Build an instance from a requirement.
+        """
+        candidates = provider.find_matches([requirement])
+        if not isinstance(candidates, collections_abc.Sequence):
+            candidates = list(candidates)
+        criterion = cls(
+            candidates=candidates,
+            information=[RequirementInformation(requirement, parent)],
+            incompatibilities=[],
+        )
+        if not candidates:
+            raise RequirementsConflicted(criterion)
+        return criterion
+
+    def iter_requirement(self):
+        return (i.requirement for i in self.information)
+
+    def iter_parent(self):
+        return (i.parent for i in self.information)
+
+    def merged_with(self, provider, requirement, parent):
+        """Build a new instance from this and a new requirement.
+        """
+        infos = list(self.information)
+        infos.append(RequirementInformation(requirement, parent))
+        candidates = provider.find_matches([r for r, _ in infos])
+        if not isinstance(candidates, collections_abc.Sequence):
+            candidates = list(candidates)
+        criterion = type(self)(candidates, infos, list(self.incompatibilities))
+        if not candidates:
+            raise RequirementsConflicted(criterion)
+        return criterion
+
+    def excluded_of(self, candidate):
+        """Build a new instance from this, but excluding specified candidate.
+
+        Returns the new instance, or None if we still have no valid candidates.
+        """
+        incompats = list(self.incompatibilities)
+        incompats.append(candidate)
+        candidates = [c for c in self.candidates if c != candidate]
+        if not candidates:
+            return None
+        criterion = type(self)(candidates, list(self.information), incompats)
+        return criterion
+
+
+class ResolutionError(ResolverException):
+    pass
+
+
+class ResolutionImpossible(ResolutionError):
+    def __init__(self, causes):
+        super(ResolutionImpossible, self).__init__(causes)
+        # causes is a list of RequirementInformation objects
+        self.causes = causes
+
+
+class ResolutionTooDeep(ResolutionError):
+    def __init__(self, round_count):
+        super(ResolutionTooDeep, self).__init__(round_count)
+        self.round_count = round_count
+
+
+# Resolution state in a round.
+State = collections.namedtuple("State", "mapping criteria")
+
+
+class Resolution(object):
+    """Stateful resolution object.
+
+    This is designed as a one-off object that holds information to kick start
+    the resolution process, and holds the results afterwards.
+    """
+
+    def __init__(self, provider, reporter):
+        self._p = provider
+        self._r = reporter
+        self._states = []
+
+    @property
+    def state(self):
+        try:
+            return self._states[-1]
+        except IndexError:
+            raise AttributeError("state")
+
+    def _push_new_state(self):
+        """Push a new state into history.
+
+        This new state will be used to hold resolution results of the next
+        coming round.
+        """
+        try:
+            base = self._states[-1]
+        except IndexError:
+            state = State(mapping=collections.OrderedDict(), criteria={})
+        else:
+            state = State(
+                mapping=base.mapping.copy(), criteria=base.criteria.copy(),
+            )
+        self._states.append(state)
+
+    def _merge_into_criterion(self, requirement, parent):
+        self._r.adding_requirement(requirement, parent)
+        name = self._p.identify(requirement)
+        try:
+            crit = self.state.criteria[name]
+        except KeyError:
+            crit = Criterion.from_requirement(self._p, requirement, parent)
+        else:
+            crit = crit.merged_with(self._p, requirement, parent)
+        return name, crit
+
+    def _get_criterion_item_preference(self, item):
+        name, criterion = item
+        try:
+            pinned = self.state.mapping[name]
+        except KeyError:
+            pinned = None
+        return self._p.get_preference(
+            pinned, criterion.candidates, criterion.information,
+        )
+
+    def _is_current_pin_satisfying(self, name, criterion):
+        try:
+            current_pin = self.state.mapping[name]
+        except KeyError:
+            return False
+        return all(
+            self._p.is_satisfied_by(r, current_pin)
+            for r in criterion.iter_requirement()
+        )
+
+    def _get_criteria_to_update(self, candidate):
+        criteria = {}
+        for r in self._p.get_dependencies(candidate):
+            name, crit = self._merge_into_criterion(r, parent=candidate)
+            criteria[name] = crit
+        return criteria
+
+    def _attempt_to_pin_criterion(self, name, criterion):
+        causes = []
+        for candidate in criterion.candidates:
+            try:
+                criteria = self._get_criteria_to_update(candidate)
+            except RequirementsConflicted as e:
+                causes.append(e.criterion)
+                continue
+
+            # Check the newly-pinned candidate actually works. This should
+            # always pass under normal circumstances, but in the case of a
+            # faulty provider, we will raise an error to notify the implementer
+            # to fix find_matches() and/or is_satisfied_by().
+            satisfied = all(
+                self._p.is_satisfied_by(r, candidate)
+                for r in criterion.iter_requirement()
+            )
+            if not satisfied:
+                raise InconsistentCandidate(candidate, criterion)
+
+            # Put newly-pinned candidate at the end. This is essential because
+            # backtracking looks at this mapping to get the last pin.
+            self._r.pinning(candidate)
+            self.state.mapping.pop(name, None)
+            self.state.mapping[name] = candidate
+            self.state.criteria.update(criteria)
+
+            return []
+
+        # All candidates tried, nothing works. This criterion is a dead
+        # end, signal for backtracking.
+        return causes
+
+    def _backtrack(self):
+        # Drop the current state, it's known not to work.
+        del self._states[-1]
+
+        # We need at least 2 states here:
+        # (a) One to backtrack to.
+        # (b) One to restore state (a) to its state prior to candidate-pinning,
+        #     so we can pin another one instead.
+
+        while len(self._states) >= 2:
+            # Retract the last candidate pin.
+            prev_state = self._states.pop()
+            try:
+                name, candidate = prev_state.mapping.popitem()
+            except KeyError:
+                continue
+            self._r.backtracking(candidate)
+
+            # Create a new state to work on, with the newly known not-working
+            # candidate excluded.
+            self._push_new_state()
+
+            # Mark the retracted candidate as incompatible.
+            criterion = self.state.criteria[name].excluded_of(candidate)
+            if criterion is None:
+                # This state still does not work. Try the still previous state.
+                del self._states[-1]
+                continue
+            self.state.criteria[name] = criterion
+
+            return True
+
+        return False
+
+    def resolve(self, requirements, max_rounds):
+        if self._states:
+            raise RuntimeError("already resolved")
+
+        self._push_new_state()
+        for r in requirements:
+            try:
+                name, crit = self._merge_into_criterion(r, parent=None)
+            except RequirementsConflicted as e:
+                raise ResolutionImpossible(e.criterion.information)
+            self.state.criteria[name] = crit
+
+        self._r.starting()
+
+        for round_index in range(max_rounds):
+            self._r.starting_round(round_index)
+
+            self._push_new_state()
+            curr = self.state
+
+            unsatisfied_criterion_items = [
+                item
+                for item in self.state.criteria.items()
+                if not self._is_current_pin_satisfying(*item)
+            ]
+
+            # All criteria are accounted for. Nothing more to pin, we are done!
+            if not unsatisfied_criterion_items:
+                del self._states[-1]
+                self._r.ending(curr)
+                return self.state
+
+            # Choose the most preferred unpinned criterion to try.
+            name, criterion = min(
+                unsatisfied_criterion_items,
+                key=self._get_criterion_item_preference,
+            )
+            failure_causes = self._attempt_to_pin_criterion(name, criterion)
+
+            # Backtrack if pinning fails.
+            if failure_causes:
+                result = self._backtrack()
+                if not result:
+                    causes = [
+                        i for crit in failure_causes for i in crit.information
+                    ]
+                    raise ResolutionImpossible(causes)
+
+            self._r.ending_round(round_index, curr)
+
+        raise ResolutionTooDeep(max_rounds)
+
+
+def _has_route_to_root(criteria, key, all_keys, connected):
+    if key in connected:
+        return True
+    if key not in criteria:
+        return False
+    for p in criteria[key].iter_parent():
+        try:
+            pkey = all_keys[id(p)]
+        except KeyError:
+            continue
+        if pkey in connected:
+            connected.add(key)
+            return True
+        if _has_route_to_root(criteria, pkey, all_keys, connected):
+            connected.add(key)
+            return True
+    return False
+
+
+Result = collections.namedtuple("Result", "mapping graph criteria")
+
+
+def _build_result(state):
+    mapping = state.mapping
+    all_keys = {id(v): k for k, v in mapping.items()}
+    all_keys[id(None)] = None
+
+    graph = DirectedGraph()
+    graph.add(None)  # Sentinel as root dependencies' parent.
+
+    connected = {None}
+    for key, criterion in state.criteria.items():
+        if not _has_route_to_root(state.criteria, key, all_keys, connected):
+            continue
+        if key not in graph:
+            graph.add(key)
+        for p in criterion.iter_parent():
+            try:
+                pkey = all_keys[id(p)]
+            except KeyError:
+                continue
+            if pkey not in graph:
+                graph.add(pkey)
+            graph.connect(pkey, key)
+
+    return Result(
+        mapping={k: v for k, v in mapping.items() if k in connected},
+        graph=graph,
+        criteria=state.criteria,
+    )
+
+
+class Resolver(AbstractResolver):
+    """The thing that performs the actual resolution work.
+    """
+
+    base_exception = ResolverException
+
+    def resolve(self, requirements, max_rounds=100):
+        """Take a collection of constraints, spit out the resolution result.
+
+        The return value is a representation to the final resolution result. It
+        is a tuple subclass with three public members:
+
+        * `mapping`: A dict of resolved candidates. Each key is an identifier
+            of a requirement (as returned by the provider's `identify` method),
+            and the value is the resolved candidate.
+        * `graph`: A `DirectedGraph` instance representing the dependency tree.
+            The vertices are keys of `mapping`, and each edge represents *why*
+            a particular package is included. A special vertex `None` is
+            included to represent parents of user-supplied requirements.
+        * `criteria`: A dict of "criteria" that hold detailed information on
+            how edges in the graph are derived. Each key is an identifier of a
+            requirement, and the value is a `Criterion` instance.
+
+        The following exceptions may be raised if a resolution cannot be found:
+
+        * `ResolutionImpossible`: A resolution cannot be found for the given
+            combination of requirements. The `causes` attribute of the
+            exception is a list of (requirement, parent), giving the
+            requirements that could not be satisfied.
+        * `ResolutionTooDeep`: The dependency tree is too deeply nested and
+            the resolver gave up. This is usually caused by a circular
+            dependency, but you can try to resolve this by increasing the
+            `max_rounds` argument.
+        """
+        resolution = Resolution(self.provider, self.reporter)
+        state = resolution.resolve(requirements, max_rounds=max_rounds)
+        return _build_result(state)
diff --git a/venv/Lib/site-packages/pip/_vendor/resolvelib/structs.py b/venv/Lib/site-packages/pip/_vendor/resolvelib/structs.py
new file mode 100644
index 000000000..1eee08b38
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/resolvelib/structs.py
@@ -0,0 +1,68 @@
+class DirectedGraph(object):
+    """A graph structure with directed edges.
+    """
+
+    def __init__(self):
+        self._vertices = set()
+        self._forwards = {}  # <key> -> Set[<key>]
+        self._backwards = {}  # <key> -> Set[<key>]
+
+    def __iter__(self):
+        return iter(self._vertices)
+
+    def __len__(self):
+        return len(self._vertices)
+
+    def __contains__(self, key):
+        return key in self._vertices
+
+    def copy(self):
+        """Return a shallow copy of this graph.
+        """
+        other = DirectedGraph()
+        other._vertices = set(self._vertices)
+        other._forwards = {k: set(v) for k, v in self._forwards.items()}
+        other._backwards = {k: set(v) for k, v in self._backwards.items()}
+        return other
+
+    def add(self, key):
+        """Add a new vertex to the graph.
+        """
+        if key in self._vertices:
+            raise ValueError("vertex exists")
+        self._vertices.add(key)
+        self._forwards[key] = set()
+        self._backwards[key] = set()
+
+    def remove(self, key):
+        """Remove a vertex from the graph, disconnecting all edges from/to it.
+        """
+        self._vertices.remove(key)
+        for f in self._forwards.pop(key):
+            self._backwards[f].remove(key)
+        for t in self._backwards.pop(key):
+            self._forwards[t].remove(key)
+
+    def connected(self, f, t):
+        return f in self._backwards[t] and t in self._forwards[f]
+
+    def connect(self, f, t):
+        """Connect two existing vertices.
+
+        Nothing happens if the vertices are already connected.
+        """
+        if t not in self._vertices:
+            raise KeyError(t)
+        self._forwards[f].add(t)
+        self._backwards[t].add(f)
+
+    def iter_edges(self):
+        for f, children in self._forwards.items():
+            for t in children:
+                yield f, t
+
+    def iter_children(self, key):
+        return iter(self._forwards[key])
+
+    def iter_parents(self, key):
+        return iter(self._backwards[key])
diff --git a/venv/Lib/site-packages/pip/_vendor/retrying.py b/venv/Lib/site-packages/pip/_vendor/retrying.py
new file mode 100644
index 000000000..6d1e627aa
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/retrying.py
@@ -0,0 +1,267 @@
+## Copyright 2013-2014 Ray Holder
+##
+## 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.
+
+import random
+from pip._vendor import six
+import sys
+import time
+import traceback
+
+
+# sys.maxint / 2, since Python 3.2 doesn't have a sys.maxint...
+MAX_WAIT = 1073741823
+
+
+def retry(*dargs, **dkw):
+    """
+    Decorator function that instantiates the Retrying object
+    @param *dargs: positional arguments passed to Retrying object
+    @param **dkw: keyword arguments passed to the Retrying object
+    """
+    # support both @retry and @retry() as valid syntax
+    if len(dargs) == 1 and callable(dargs[0]):
+        def wrap_simple(f):
+
+            @six.wraps(f)
+            def wrapped_f(*args, **kw):
+                return Retrying().call(f, *args, **kw)
+
+            return wrapped_f
+
+        return wrap_simple(dargs[0])
+
+    else:
+        def wrap(f):
+
+            @six.wraps(f)
+            def wrapped_f(*args, **kw):
+                return Retrying(*dargs, **dkw).call(f, *args, **kw)
+
+            return wrapped_f
+
+        return wrap
+
+
+class Retrying(object):
+
+    def __init__(self,
+                 stop=None, wait=None,
+                 stop_max_attempt_number=None,
+                 stop_max_delay=None,
+                 wait_fixed=None,
+                 wait_random_min=None, wait_random_max=None,
+                 wait_incrementing_start=None, wait_incrementing_increment=None,
+                 wait_exponential_multiplier=None, wait_exponential_max=None,
+                 retry_on_exception=None,
+                 retry_on_result=None,
+                 wrap_exception=False,
+                 stop_func=None,
+                 wait_func=None,
+                 wait_jitter_max=None):
+
+        self._stop_max_attempt_number = 5 if stop_max_attempt_number is None else stop_max_attempt_number
+        self._stop_max_delay = 100 if stop_max_delay is None else stop_max_delay
+        self._wait_fixed = 1000 if wait_fixed is None else wait_fixed
+        self._wait_random_min = 0 if wait_random_min is None else wait_random_min
+        self._wait_random_max = 1000 if wait_random_max is None else wait_random_max
+        self._wait_incrementing_start = 0 if wait_incrementing_start is None else wait_incrementing_start
+        self._wait_incrementing_increment = 100 if wait_incrementing_increment is None else wait_incrementing_increment
+        self._wait_exponential_multiplier = 1 if wait_exponential_multiplier is None else wait_exponential_multiplier
+        self._wait_exponential_max = MAX_WAIT if wait_exponential_max is None else wait_exponential_max
+        self._wait_jitter_max = 0 if wait_jitter_max is None else wait_jitter_max
+
+        # TODO add chaining of stop behaviors
+        # stop behavior
+        stop_funcs = []
+        if stop_max_attempt_number is not None:
+            stop_funcs.append(self.stop_after_attempt)
+
+        if stop_max_delay is not None:
+            stop_funcs.append(self.stop_after_delay)
+
+        if stop_func is not None:
+            self.stop = stop_func
+
+        elif stop is None:
+            self.stop = lambda attempts, delay: any(f(attempts, delay) for f in stop_funcs)
+
+        else:
+            self.stop = getattr(self, stop)
+
+        # TODO add chaining of wait behaviors
+        # wait behavior
+        wait_funcs = [lambda *args, **kwargs: 0]
+        if wait_fixed is not None:
+            wait_funcs.append(self.fixed_sleep)
+
+        if wait_random_min is not None or wait_random_max is not None:
+            wait_funcs.append(self.random_sleep)
+
+        if wait_incrementing_start is not None or wait_incrementing_increment is not None:
+            wait_funcs.append(self.incrementing_sleep)
+
+        if wait_exponential_multiplier is not None or wait_exponential_max is not None:
+            wait_funcs.append(self.exponential_sleep)
+
+        if wait_func is not None:
+            self.wait = wait_func
+
+        elif wait is None:
+            self.wait = lambda attempts, delay: max(f(attempts, delay) for f in wait_funcs)
+
+        else:
+            self.wait = getattr(self, wait)
+
+        # retry on exception filter
+        if retry_on_exception is None:
+            self._retry_on_exception = self.always_reject
+        else:
+            self._retry_on_exception = retry_on_exception
+
+        # TODO simplify retrying by Exception types
+        # retry on result filter
+        if retry_on_result is None:
+            self._retry_on_result = self.never_reject
+        else:
+            self._retry_on_result = retry_on_result
+
+        self._wrap_exception = wrap_exception
+
+    def stop_after_attempt(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """Stop after the previous attempt >= stop_max_attempt_number."""
+        return previous_attempt_number >= self._stop_max_attempt_number
+
+    def stop_after_delay(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """Stop after the time from the first attempt >= stop_max_delay."""
+        return delay_since_first_attempt_ms >= self._stop_max_delay
+
+    def no_sleep(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """Don't sleep at all before retrying."""
+        return 0
+
+    def fixed_sleep(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """Sleep a fixed amount of time between each retry."""
+        return self._wait_fixed
+
+    def random_sleep(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """Sleep a random amount of time between wait_random_min and wait_random_max"""
+        return random.randint(self._wait_random_min, self._wait_random_max)
+
+    def incrementing_sleep(self, previous_attempt_number, delay_since_first_attempt_ms):
+        """
+        Sleep an incremental amount of time after each attempt, starting at
+        wait_incrementing_start and incrementing by wait_incrementing_increment
+        """
+        result = self._wait_incrementing_start + (self._wait_incrementing_increment * (previous_attempt_number - 1))
+        if result < 0:
+            result = 0
+        return result
+
+    def exponential_sleep(self, previous_attempt_number, delay_since_first_attempt_ms):
+        exp = 2 ** previous_attempt_number
+        result = self._wait_exponential_multiplier * exp
+        if result > self._wait_exponential_max:
+            result = self._wait_exponential_max
+        if result < 0:
+            result = 0
+        return result
+
+    def never_reject(self, result):
+        return False
+
+    def always_reject(self, result):
+        return True
+
+    def should_reject(self, attempt):
+        reject = False
+        if attempt.has_exception:
+            reject |= self._retry_on_exception(attempt.value[1])
+        else:
+            reject |= self._retry_on_result(attempt.value)
+
+        return reject
+
+    def call(self, fn, *args, **kwargs):
+        start_time = int(round(time.time() * 1000))
+        attempt_number = 1
+        while True:
+            try:
+                attempt = Attempt(fn(*args, **kwargs), attempt_number, False)
+            except:
+                tb = sys.exc_info()
+                attempt = Attempt(tb, attempt_number, True)
+
+            if not self.should_reject(attempt):
+                return attempt.get(self._wrap_exception)
+
+            delay_since_first_attempt_ms = int(round(time.time() * 1000)) - start_time
+            if self.stop(attempt_number, delay_since_first_attempt_ms):
+                if not self._wrap_exception and attempt.has_exception:
+                    # get() on an attempt with an exception should cause it to be raised, but raise just in case
+                    raise attempt.get()
+                else:
+                    raise RetryError(attempt)
+            else:
+                sleep = self.wait(attempt_number, delay_since_first_attempt_ms)
+                if self._wait_jitter_max:
+                    jitter = random.random() * self._wait_jitter_max
+                    sleep = sleep + max(0, jitter)
+                time.sleep(sleep / 1000.0)
+
+            attempt_number += 1
+
+
+class Attempt(object):
+    """
+    An Attempt encapsulates a call to a target function that may end as a
+    normal return value from the function or an Exception depending on what
+    occurred during the execution.
+    """
+
+    def __init__(self, value, attempt_number, has_exception):
+        self.value = value
+        self.attempt_number = attempt_number
+        self.has_exception = has_exception
+
+    def get(self, wrap_exception=False):
+        """
+        Return the return value of this Attempt instance or raise an Exception.
+        If wrap_exception is true, this Attempt is wrapped inside of a
+        RetryError before being raised.
+        """
+        if self.has_exception:
+            if wrap_exception:
+                raise RetryError(self)
+            else:
+                six.reraise(self.value[0], self.value[1], self.value[2])
+        else:
+            return self.value
+
+    def __repr__(self):
+        if self.has_exception:
+            return "Attempts: {0}, Error:\n{1}".format(self.attempt_number, "".join(traceback.format_tb(self.value[2])))
+        else:
+            return "Attempts: {0}, Value: {1}".format(self.attempt_number, self.value)
+
+
+class RetryError(Exception):
+    """
+    A RetryError encapsulates the last Attempt instance right before giving up.
+    """
+
+    def __init__(self, last_attempt):
+        self.last_attempt = last_attempt
+
+    def __str__(self):
+        return "RetryError[{0}]".format(self.last_attempt)
diff --git a/venv/Lib/site-packages/pip/_vendor/six.py b/venv/Lib/site-packages/pip/_vendor/six.py
new file mode 100644
index 000000000..83f69783d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/six.py
@@ -0,0 +1,982 @@
+# Copyright (c) 2010-2020 Benjamin Peterson
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to deal
+# in the Software without restriction, including without limitation the rights
+# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in all
+# copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+# SOFTWARE.
+
+"""Utilities for writing code that runs on Python 2 and 3"""
+
+from __future__ import absolute_import
+
+import functools
+import itertools
+import operator
+import sys
+import types
+
+__author__ = "Benjamin Peterson <benjamin@python.org>"
+__version__ = "1.15.0"
+
+
+# Useful for very coarse version differentiation.
+PY2 = sys.version_info[0] == 2
+PY3 = sys.version_info[0] == 3
+PY34 = sys.version_info[0:2] >= (3, 4)
+
+if PY3:
+    string_types = str,
+    integer_types = int,
+    class_types = type,
+    text_type = str
+    binary_type = bytes
+
+    MAXSIZE = sys.maxsize
+else:
+    string_types = basestring,
+    integer_types = (int, long)
+    class_types = (type, types.ClassType)
+    text_type = unicode
+    binary_type = str
+
+    if sys.platform.startswith("java"):
+        # Jython always uses 32 bits.
+        MAXSIZE = int((1 << 31) - 1)
+    else:
+        # It's possible to have sizeof(long) != sizeof(Py_ssize_t).
+        class X(object):
+
+            def __len__(self):
+                return 1 << 31
+        try:
+            len(X())
+        except OverflowError:
+            # 32-bit
+            MAXSIZE = int((1 << 31) - 1)
+        else:
+            # 64-bit
+            MAXSIZE = int((1 << 63) - 1)
+        del X
+
+
+def _add_doc(func, doc):
+    """Add documentation to a function."""
+    func.__doc__ = doc
+
+
+def _import_module(name):
+    """Import module, returning the module after the last dot."""
+    __import__(name)
+    return sys.modules[name]
+
+
+class _LazyDescr(object):
+
+    def __init__(self, name):
+        self.name = name
+
+    def __get__(self, obj, tp):
+        result = self._resolve()
+        setattr(obj, self.name, result)  # Invokes __set__.
+        try:
+            # This is a bit ugly, but it avoids running this again by
+            # removing this descriptor.
+            delattr(obj.__class__, self.name)
+        except AttributeError:
+            pass
+        return result
+
+
+class MovedModule(_LazyDescr):
+
+    def __init__(self, name, old, new=None):
+        super(MovedModule, self).__init__(name)
+        if PY3:
+            if new is None:
+                new = name
+            self.mod = new
+        else:
+            self.mod = old
+
+    def _resolve(self):
+        return _import_module(self.mod)
+
+    def __getattr__(self, attr):
+        _module = self._resolve()
+        value = getattr(_module, attr)
+        setattr(self, attr, value)
+        return value
+
+
+class _LazyModule(types.ModuleType):
+
+    def __init__(self, name):
+        super(_LazyModule, self).__init__(name)
+        self.__doc__ = self.__class__.__doc__
+
+    def __dir__(self):
+        attrs = ["__doc__", "__name__"]
+        attrs += [attr.name for attr in self._moved_attributes]
+        return attrs
+
+    # Subclasses should override this
+    _moved_attributes = []
+
+
+class MovedAttribute(_LazyDescr):
+
+    def __init__(self, name, old_mod, new_mod, old_attr=None, new_attr=None):
+        super(MovedAttribute, self).__init__(name)
+        if PY3:
+            if new_mod is None:
+                new_mod = name
+            self.mod = new_mod
+            if new_attr is None:
+                if old_attr is None:
+                    new_attr = name
+                else:
+                    new_attr = old_attr
+            self.attr = new_attr
+        else:
+            self.mod = old_mod
+            if old_attr is None:
+                old_attr = name
+            self.attr = old_attr
+
+    def _resolve(self):
+        module = _import_module(self.mod)
+        return getattr(module, self.attr)
+
+
+class _SixMetaPathImporter(object):
+
+    """
+    A meta path importer to import six.moves and its submodules.
+
+    This class implements a PEP302 finder and loader. It should be compatible
+    with Python 2.5 and all existing versions of Python3
+    """
+
+    def __init__(self, six_module_name):
+        self.name = six_module_name
+        self.known_modules = {}
+
+    def _add_module(self, mod, *fullnames):
+        for fullname in fullnames:
+            self.known_modules[self.name + "." + fullname] = mod
+
+    def _get_module(self, fullname):
+        return self.known_modules[self.name + "." + fullname]
+
+    def find_module(self, fullname, path=None):
+        if fullname in self.known_modules:
+            return self
+        return None
+
+    def __get_module(self, fullname):
+        try:
+            return self.known_modules[fullname]
+        except KeyError:
+            raise ImportError("This loader does not know module " + fullname)
+
+    def load_module(self, fullname):
+        try:
+            # in case of a reload
+            return sys.modules[fullname]
+        except KeyError:
+            pass
+        mod = self.__get_module(fullname)
+        if isinstance(mod, MovedModule):
+            mod = mod._resolve()
+        else:
+            mod.__loader__ = self
+        sys.modules[fullname] = mod
+        return mod
+
+    def is_package(self, fullname):
+        """
+        Return true, if the named module is a package.
+
+        We need this method to get correct spec objects with
+        Python 3.4 (see PEP451)
+        """
+        return hasattr(self.__get_module(fullname), "__path__")
+
+    def get_code(self, fullname):
+        """Return None
+
+        Required, if is_package is implemented"""
+        self.__get_module(fullname)  # eventually raises ImportError
+        return None
+    get_source = get_code  # same as get_code
+
+_importer = _SixMetaPathImporter(__name__)
+
+
+class _MovedItems(_LazyModule):
+
+    """Lazy loading of moved objects"""
+    __path__ = []  # mark as package
+
+
+_moved_attributes = [
+    MovedAttribute("cStringIO", "cStringIO", "io", "StringIO"),
+    MovedAttribute("filter", "itertools", "builtins", "ifilter", "filter"),
+    MovedAttribute("filterfalse", "itertools", "itertools", "ifilterfalse", "filterfalse"),
+    MovedAttribute("input", "__builtin__", "builtins", "raw_input", "input"),
+    MovedAttribute("intern", "__builtin__", "sys"),
+    MovedAttribute("map", "itertools", "builtins", "imap", "map"),
+    MovedAttribute("getcwd", "os", "os", "getcwdu", "getcwd"),
+    MovedAttribute("getcwdb", "os", "os", "getcwd", "getcwdb"),
+    MovedAttribute("getoutput", "commands", "subprocess"),
+    MovedAttribute("range", "__builtin__", "builtins", "xrange", "range"),
+    MovedAttribute("reload_module", "__builtin__", "importlib" if PY34 else "imp", "reload"),
+    MovedAttribute("reduce", "__builtin__", "functools"),
+    MovedAttribute("shlex_quote", "pipes", "shlex", "quote"),
+    MovedAttribute("StringIO", "StringIO", "io"),
+    MovedAttribute("UserDict", "UserDict", "collections"),
+    MovedAttribute("UserList", "UserList", "collections"),
+    MovedAttribute("UserString", "UserString", "collections"),
+    MovedAttribute("xrange", "__builtin__", "builtins", "xrange", "range"),
+    MovedAttribute("zip", "itertools", "builtins", "izip", "zip"),
+    MovedAttribute("zip_longest", "itertools", "itertools", "izip_longest", "zip_longest"),
+    MovedModule("builtins", "__builtin__"),
+    MovedModule("configparser", "ConfigParser"),
+    MovedModule("collections_abc", "collections", "collections.abc" if sys.version_info >= (3, 3) else "collections"),
+    MovedModule("copyreg", "copy_reg"),
+    MovedModule("dbm_gnu", "gdbm", "dbm.gnu"),
+    MovedModule("dbm_ndbm", "dbm", "dbm.ndbm"),
+    MovedModule("_dummy_thread", "dummy_thread", "_dummy_thread" if sys.version_info < (3, 9) else "_thread"),
+    MovedModule("http_cookiejar", "cookielib", "http.cookiejar"),
+    MovedModule("http_cookies", "Cookie", "http.cookies"),
+    MovedModule("html_entities", "htmlentitydefs", "html.entities"),
+    MovedModule("html_parser", "HTMLParser", "html.parser"),
+    MovedModule("http_client", "httplib", "http.client"),
+    MovedModule("email_mime_base", "email.MIMEBase", "email.mime.base"),
+    MovedModule("email_mime_image", "email.MIMEImage", "email.mime.image"),
+    MovedModule("email_mime_multipart", "email.MIMEMultipart", "email.mime.multipart"),
+    MovedModule("email_mime_nonmultipart", "email.MIMENonMultipart", "email.mime.nonmultipart"),
+    MovedModule("email_mime_text", "email.MIMEText", "email.mime.text"),
+    MovedModule("BaseHTTPServer", "BaseHTTPServer", "http.server"),
+    MovedModule("CGIHTTPServer", "CGIHTTPServer", "http.server"),
+    MovedModule("SimpleHTTPServer", "SimpleHTTPServer", "http.server"),
+    MovedModule("cPickle", "cPickle", "pickle"),
+    MovedModule("queue", "Queue"),
+    MovedModule("reprlib", "repr"),
+    MovedModule("socketserver", "SocketServer"),
+    MovedModule("_thread", "thread", "_thread"),
+    MovedModule("tkinter", "Tkinter"),
+    MovedModule("tkinter_dialog", "Dialog", "tkinter.dialog"),
+    MovedModule("tkinter_filedialog", "FileDialog", "tkinter.filedialog"),
+    MovedModule("tkinter_scrolledtext", "ScrolledText", "tkinter.scrolledtext"),
+    MovedModule("tkinter_simpledialog", "SimpleDialog", "tkinter.simpledialog"),
+    MovedModule("tkinter_tix", "Tix", "tkinter.tix"),
+    MovedModule("tkinter_ttk", "ttk", "tkinter.ttk"),
+    MovedModule("tkinter_constants", "Tkconstants", "tkinter.constants"),
+    MovedModule("tkinter_dnd", "Tkdnd", "tkinter.dnd"),
+    MovedModule("tkinter_colorchooser", "tkColorChooser",
+                "tkinter.colorchooser"),
+    MovedModule("tkinter_commondialog", "tkCommonDialog",
+                "tkinter.commondialog"),
+    MovedModule("tkinter_tkfiledialog", "tkFileDialog", "tkinter.filedialog"),
+    MovedModule("tkinter_font", "tkFont", "tkinter.font"),
+    MovedModule("tkinter_messagebox", "tkMessageBox", "tkinter.messagebox"),
+    MovedModule("tkinter_tksimpledialog", "tkSimpleDialog",
+                "tkinter.simpledialog"),
+    MovedModule("urllib_parse", __name__ + ".moves.urllib_parse", "urllib.parse"),
+    MovedModule("urllib_error", __name__ + ".moves.urllib_error", "urllib.error"),
+    MovedModule("urllib", __name__ + ".moves.urllib", __name__ + ".moves.urllib"),
+    MovedModule("urllib_robotparser", "robotparser", "urllib.robotparser"),
+    MovedModule("xmlrpc_client", "xmlrpclib", "xmlrpc.client"),
+    MovedModule("xmlrpc_server", "SimpleXMLRPCServer", "xmlrpc.server"),
+]
+# Add windows specific modules.
+if sys.platform == "win32":
+    _moved_attributes += [
+        MovedModule("winreg", "_winreg"),
+    ]
+
+for attr in _moved_attributes:
+    setattr(_MovedItems, attr.name, attr)
+    if isinstance(attr, MovedModule):
+        _importer._add_module(attr, "moves." + attr.name)
+del attr
+
+_MovedItems._moved_attributes = _moved_attributes
+
+moves = _MovedItems(__name__ + ".moves")
+_importer._add_module(moves, "moves")
+
+
+class Module_six_moves_urllib_parse(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_parse"""
+
+
+_urllib_parse_moved_attributes = [
+    MovedAttribute("ParseResult", "urlparse", "urllib.parse"),
+    MovedAttribute("SplitResult", "urlparse", "urllib.parse"),
+    MovedAttribute("parse_qs", "urlparse", "urllib.parse"),
+    MovedAttribute("parse_qsl", "urlparse", "urllib.parse"),
+    MovedAttribute("urldefrag", "urlparse", "urllib.parse"),
+    MovedAttribute("urljoin", "urlparse", "urllib.parse"),
+    MovedAttribute("urlparse", "urlparse", "urllib.parse"),
+    MovedAttribute("urlsplit", "urlparse", "urllib.parse"),
+    MovedAttribute("urlunparse", "urlparse", "urllib.parse"),
+    MovedAttribute("urlunsplit", "urlparse", "urllib.parse"),
+    MovedAttribute("quote", "urllib", "urllib.parse"),
+    MovedAttribute("quote_plus", "urllib", "urllib.parse"),
+    MovedAttribute("unquote", "urllib", "urllib.parse"),
+    MovedAttribute("unquote_plus", "urllib", "urllib.parse"),
+    MovedAttribute("unquote_to_bytes", "urllib", "urllib.parse", "unquote", "unquote_to_bytes"),
+    MovedAttribute("urlencode", "urllib", "urllib.parse"),
+    MovedAttribute("splitquery", "urllib", "urllib.parse"),
+    MovedAttribute("splittag", "urllib", "urllib.parse"),
+    MovedAttribute("splituser", "urllib", "urllib.parse"),
+    MovedAttribute("splitvalue", "urllib", "urllib.parse"),
+    MovedAttribute("uses_fragment", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_netloc", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_params", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_query", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_relative", "urlparse", "urllib.parse"),
+]
+for attr in _urllib_parse_moved_attributes:
+    setattr(Module_six_moves_urllib_parse, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_parse._moved_attributes = _urllib_parse_moved_attributes
+
+_importer._add_module(Module_six_moves_urllib_parse(__name__ + ".moves.urllib_parse"),
+                      "moves.urllib_parse", "moves.urllib.parse")
+
+
+class Module_six_moves_urllib_error(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_error"""
+
+
+_urllib_error_moved_attributes = [
+    MovedAttribute("URLError", "urllib2", "urllib.error"),
+    MovedAttribute("HTTPError", "urllib2", "urllib.error"),
+    MovedAttribute("ContentTooShortError", "urllib", "urllib.error"),
+]
+for attr in _urllib_error_moved_attributes:
+    setattr(Module_six_moves_urllib_error, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_error._moved_attributes = _urllib_error_moved_attributes
+
+_importer._add_module(Module_six_moves_urllib_error(__name__ + ".moves.urllib.error"),
+                      "moves.urllib_error", "moves.urllib.error")
+
+
+class Module_six_moves_urllib_request(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_request"""
+
+
+_urllib_request_moved_attributes = [
+    MovedAttribute("urlopen", "urllib2", "urllib.request"),
+    MovedAttribute("install_opener", "urllib2", "urllib.request"),
+    MovedAttribute("build_opener", "urllib2", "urllib.request"),
+    MovedAttribute("pathname2url", "urllib", "urllib.request"),
+    MovedAttribute("url2pathname", "urllib", "urllib.request"),
+    MovedAttribute("getproxies", "urllib", "urllib.request"),
+    MovedAttribute("Request", "urllib2", "urllib.request"),
+    MovedAttribute("OpenerDirector", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPDefaultErrorHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPRedirectHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPCookieProcessor", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyHandler", "urllib2", "urllib.request"),
+    MovedAttribute("BaseHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPPasswordMgr", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPPasswordMgrWithDefaultRealm", "urllib2", "urllib.request"),
+    MovedAttribute("AbstractBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("AbstractDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPSHandler", "urllib2", "urllib.request"),
+    MovedAttribute("FileHandler", "urllib2", "urllib.request"),
+    MovedAttribute("FTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("CacheFTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("UnknownHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPErrorProcessor", "urllib2", "urllib.request"),
+    MovedAttribute("urlretrieve", "urllib", "urllib.request"),
+    MovedAttribute("urlcleanup", "urllib", "urllib.request"),
+    MovedAttribute("URLopener", "urllib", "urllib.request"),
+    MovedAttribute("FancyURLopener", "urllib", "urllib.request"),
+    MovedAttribute("proxy_bypass", "urllib", "urllib.request"),
+    MovedAttribute("parse_http_list", "urllib2", "urllib.request"),
+    MovedAttribute("parse_keqv_list", "urllib2", "urllib.request"),
+]
+for attr in _urllib_request_moved_attributes:
+    setattr(Module_six_moves_urllib_request, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_request._moved_attributes = _urllib_request_moved_attributes
+
+_importer._add_module(Module_six_moves_urllib_request(__name__ + ".moves.urllib.request"),
+                      "moves.urllib_request", "moves.urllib.request")
+
+
+class Module_six_moves_urllib_response(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_response"""
+
+
+_urllib_response_moved_attributes = [
+    MovedAttribute("addbase", "urllib", "urllib.response"),
+    MovedAttribute("addclosehook", "urllib", "urllib.response"),
+    MovedAttribute("addinfo", "urllib", "urllib.response"),
+    MovedAttribute("addinfourl", "urllib", "urllib.response"),
+]
+for attr in _urllib_response_moved_attributes:
+    setattr(Module_six_moves_urllib_response, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_response._moved_attributes = _urllib_response_moved_attributes
+
+_importer._add_module(Module_six_moves_urllib_response(__name__ + ".moves.urllib.response"),
+                      "moves.urllib_response", "moves.urllib.response")
+
+
+class Module_six_moves_urllib_robotparser(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_robotparser"""
+
+
+_urllib_robotparser_moved_attributes = [
+    MovedAttribute("RobotFileParser", "robotparser", "urllib.robotparser"),
+]
+for attr in _urllib_robotparser_moved_attributes:
+    setattr(Module_six_moves_urllib_robotparser, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_robotparser._moved_attributes = _urllib_robotparser_moved_attributes
+
+_importer._add_module(Module_six_moves_urllib_robotparser(__name__ + ".moves.urllib.robotparser"),
+                      "moves.urllib_robotparser", "moves.urllib.robotparser")
+
+
+class Module_six_moves_urllib(types.ModuleType):
+
+    """Create a six.moves.urllib namespace that resembles the Python 3 namespace"""
+    __path__ = []  # mark as package
+    parse = _importer._get_module("moves.urllib_parse")
+    error = _importer._get_module("moves.urllib_error")
+    request = _importer._get_module("moves.urllib_request")
+    response = _importer._get_module("moves.urllib_response")
+    robotparser = _importer._get_module("moves.urllib_robotparser")
+
+    def __dir__(self):
+        return ['parse', 'error', 'request', 'response', 'robotparser']
+
+_importer._add_module(Module_six_moves_urllib(__name__ + ".moves.urllib"),
+                      "moves.urllib")
+
+
+def add_move(move):
+    """Add an item to six.moves."""
+    setattr(_MovedItems, move.name, move)
+
+
+def remove_move(name):
+    """Remove item from six.moves."""
+    try:
+        delattr(_MovedItems, name)
+    except AttributeError:
+        try:
+            del moves.__dict__[name]
+        except KeyError:
+            raise AttributeError("no such move, %r" % (name,))
+
+
+if PY3:
+    _meth_func = "__func__"
+    _meth_self = "__self__"
+
+    _func_closure = "__closure__"
+    _func_code = "__code__"
+    _func_defaults = "__defaults__"
+    _func_globals = "__globals__"
+else:
+    _meth_func = "im_func"
+    _meth_self = "im_self"
+
+    _func_closure = "func_closure"
+    _func_code = "func_code"
+    _func_defaults = "func_defaults"
+    _func_globals = "func_globals"
+
+
+try:
+    advance_iterator = next
+except NameError:
+    def advance_iterator(it):
+        return it.next()
+next = advance_iterator
+
+
+try:
+    callable = callable
+except NameError:
+    def callable(obj):
+        return any("__call__" in klass.__dict__ for klass in type(obj).__mro__)
+
+
+if PY3:
+    def get_unbound_function(unbound):
+        return unbound
+
+    create_bound_method = types.MethodType
+
+    def create_unbound_method(func, cls):
+        return func
+
+    Iterator = object
+else:
+    def get_unbound_function(unbound):
+        return unbound.im_func
+
+    def create_bound_method(func, obj):
+        return types.MethodType(func, obj, obj.__class__)
+
+    def create_unbound_method(func, cls):
+        return types.MethodType(func, None, cls)
+
+    class Iterator(object):
+
+        def next(self):
+            return type(self).__next__(self)
+
+    callable = callable
+_add_doc(get_unbound_function,
+         """Get the function out of a possibly unbound function""")
+
+
+get_method_function = operator.attrgetter(_meth_func)
+get_method_self = operator.attrgetter(_meth_self)
+get_function_closure = operator.attrgetter(_func_closure)
+get_function_code = operator.attrgetter(_func_code)
+get_function_defaults = operator.attrgetter(_func_defaults)
+get_function_globals = operator.attrgetter(_func_globals)
+
+
+if PY3:
+    def iterkeys(d, **kw):
+        return iter(d.keys(**kw))
+
+    def itervalues(d, **kw):
+        return iter(d.values(**kw))
+
+    def iteritems(d, **kw):
+        return iter(d.items(**kw))
+
+    def iterlists(d, **kw):
+        return iter(d.lists(**kw))
+
+    viewkeys = operator.methodcaller("keys")
+
+    viewvalues = operator.methodcaller("values")
+
+    viewitems = operator.methodcaller("items")
+else:
+    def iterkeys(d, **kw):
+        return d.iterkeys(**kw)
+
+    def itervalues(d, **kw):
+        return d.itervalues(**kw)
+
+    def iteritems(d, **kw):
+        return d.iteritems(**kw)
+
+    def iterlists(d, **kw):
+        return d.iterlists(**kw)
+
+    viewkeys = operator.methodcaller("viewkeys")
+
+    viewvalues = operator.methodcaller("viewvalues")
+
+    viewitems = operator.methodcaller("viewitems")
+
+_add_doc(iterkeys, "Return an iterator over the keys of a dictionary.")
+_add_doc(itervalues, "Return an iterator over the values of a dictionary.")
+_add_doc(iteritems,
+         "Return an iterator over the (key, value) pairs of a dictionary.")
+_add_doc(iterlists,
+         "Return an iterator over the (key, [values]) pairs of a dictionary.")
+
+
+if PY3:
+    def b(s):
+        return s.encode("latin-1")
+
+    def u(s):
+        return s
+    unichr = chr
+    import struct
+    int2byte = struct.Struct(">B").pack
+    del struct
+    byte2int = operator.itemgetter(0)
+    indexbytes = operator.getitem
+    iterbytes = iter
+    import io
+    StringIO = io.StringIO
+    BytesIO = io.BytesIO
+    del io
+    _assertCountEqual = "assertCountEqual"
+    if sys.version_info[1] <= 1:
+        _assertRaisesRegex = "assertRaisesRegexp"
+        _assertRegex = "assertRegexpMatches"
+        _assertNotRegex = "assertNotRegexpMatches"
+    else:
+        _assertRaisesRegex = "assertRaisesRegex"
+        _assertRegex = "assertRegex"
+        _assertNotRegex = "assertNotRegex"
+else:
+    def b(s):
+        return s
+    # Workaround for standalone backslash
+
+    def u(s):
+        return unicode(s.replace(r'\\', r'\\\\'), "unicode_escape")
+    unichr = unichr
+    int2byte = chr
+
+    def byte2int(bs):
+        return ord(bs[0])
+
+    def indexbytes(buf, i):
+        return ord(buf[i])
+    iterbytes = functools.partial(itertools.imap, ord)
+    import StringIO
+    StringIO = BytesIO = StringIO.StringIO
+    _assertCountEqual = "assertItemsEqual"
+    _assertRaisesRegex = "assertRaisesRegexp"
+    _assertRegex = "assertRegexpMatches"
+    _assertNotRegex = "assertNotRegexpMatches"
+_add_doc(b, """Byte literal""")
+_add_doc(u, """Text literal""")
+
+
+def assertCountEqual(self, *args, **kwargs):
+    return getattr(self, _assertCountEqual)(*args, **kwargs)
+
+
+def assertRaisesRegex(self, *args, **kwargs):
+    return getattr(self, _assertRaisesRegex)(*args, **kwargs)
+
+
+def assertRegex(self, *args, **kwargs):
+    return getattr(self, _assertRegex)(*args, **kwargs)
+
+
+def assertNotRegex(self, *args, **kwargs):
+    return getattr(self, _assertNotRegex)(*args, **kwargs)
+
+
+if PY3:
+    exec_ = getattr(moves.builtins, "exec")
+
+    def reraise(tp, value, tb=None):
+        try:
+            if value is None:
+                value = tp()
+            if value.__traceback__ is not tb:
+                raise value.with_traceback(tb)
+            raise value
+        finally:
+            value = None
+            tb = None
+
+else:
+    def exec_(_code_, _globs_=None, _locs_=None):
+        """Execute code in a namespace."""
+        if _globs_ is None:
+            frame = sys._getframe(1)
+            _globs_ = frame.f_globals
+            if _locs_ is None:
+                _locs_ = frame.f_locals
+            del frame
+        elif _locs_ is None:
+            _locs_ = _globs_
+        exec("""exec _code_ in _globs_, _locs_""")
+
+    exec_("""def reraise(tp, value, tb=None):
+    try:
+        raise tp, value, tb
+    finally:
+        tb = None
+""")
+
+
+if sys.version_info[:2] > (3,):
+    exec_("""def raise_from(value, from_value):
+    try:
+        raise value from from_value
+    finally:
+        value = None
+""")
+else:
+    def raise_from(value, from_value):
+        raise value
+
+
+print_ = getattr(moves.builtins, "print", None)
+if print_ is None:
+    def print_(*args, **kwargs):
+        """The new-style print function for Python 2.4 and 2.5."""
+        fp = kwargs.pop("file", sys.stdout)
+        if fp is None:
+            return
+
+        def write(data):
+            if not isinstance(data, basestring):
+                data = str(data)
+            # If the file has an encoding, encode unicode with it.
+            if (isinstance(fp, file) and
+                    isinstance(data, unicode) and
+                    fp.encoding is not None):
+                errors = getattr(fp, "errors", None)
+                if errors is None:
+                    errors = "strict"
+                data = data.encode(fp.encoding, errors)
+            fp.write(data)
+        want_unicode = False
+        sep = kwargs.pop("sep", None)
+        if sep is not None:
+            if isinstance(sep, unicode):
+                want_unicode = True
+            elif not isinstance(sep, str):
+                raise TypeError("sep must be None or a string")
+        end = kwargs.pop("end", None)
+        if end is not None:
+            if isinstance(end, unicode):
+                want_unicode = True
+            elif not isinstance(end, str):
+                raise TypeError("end must be None or a string")
+        if kwargs:
+            raise TypeError("invalid keyword arguments to print()")
+        if not want_unicode:
+            for arg in args:
+                if isinstance(arg, unicode):
+                    want_unicode = True
+                    break
+        if want_unicode:
+            newline = unicode("\n")
+            space = unicode(" ")
+        else:
+            newline = "\n"
+            space = " "
+        if sep is None:
+            sep = space
+        if end is None:
+            end = newline
+        for i, arg in enumerate(args):
+            if i:
+                write(sep)
+            write(arg)
+        write(end)
+if sys.version_info[:2] < (3, 3):
+    _print = print_
+
+    def print_(*args, **kwargs):
+        fp = kwargs.get("file", sys.stdout)
+        flush = kwargs.pop("flush", False)
+        _print(*args, **kwargs)
+        if flush and fp is not None:
+            fp.flush()
+
+_add_doc(reraise, """Reraise an exception.""")
+
+if sys.version_info[0:2] < (3, 4):
+    # This does exactly the same what the :func:`py3:functools.update_wrapper`
+    # function does on Python versions after 3.2. It sets the ``__wrapped__``
+    # attribute on ``wrapper`` object and it doesn't raise an error if any of
+    # the attributes mentioned in ``assigned`` and ``updated`` are missing on
+    # ``wrapped`` object.
+    def _update_wrapper(wrapper, wrapped,
+                        assigned=functools.WRAPPER_ASSIGNMENTS,
+                        updated=functools.WRAPPER_UPDATES):
+        for attr in assigned:
+            try:
+                value = getattr(wrapped, attr)
+            except AttributeError:
+                continue
+            else:
+                setattr(wrapper, attr, value)
+        for attr in updated:
+            getattr(wrapper, attr).update(getattr(wrapped, attr, {}))
+        wrapper.__wrapped__ = wrapped
+        return wrapper
+    _update_wrapper.__doc__ = functools.update_wrapper.__doc__
+
+    def wraps(wrapped, assigned=functools.WRAPPER_ASSIGNMENTS,
+              updated=functools.WRAPPER_UPDATES):
+        return functools.partial(_update_wrapper, wrapped=wrapped,
+                                 assigned=assigned, updated=updated)
+    wraps.__doc__ = functools.wraps.__doc__
+
+else:
+    wraps = functools.wraps
+
+
+def with_metaclass(meta, *bases):
+    """Create a base class with a metaclass."""
+    # This requires a bit of explanation: the basic idea is to make a dummy
+    # metaclass for one level of class instantiation that replaces itself with
+    # the actual metaclass.
+    class metaclass(type):
+
+        def __new__(cls, name, this_bases, d):
+            if sys.version_info[:2] >= (3, 7):
+                # This version introduced PEP 560 that requires a bit
+                # of extra care (we mimic what is done by __build_class__).
+                resolved_bases = types.resolve_bases(bases)
+                if resolved_bases is not bases:
+                    d['__orig_bases__'] = bases
+            else:
+                resolved_bases = bases
+            return meta(name, resolved_bases, d)
+
+        @classmethod
+        def __prepare__(cls, name, this_bases):
+            return meta.__prepare__(name, bases)
+    return type.__new__(metaclass, 'temporary_class', (), {})
+
+
+def add_metaclass(metaclass):
+    """Class decorator for creating a class with a metaclass."""
+    def wrapper(cls):
+        orig_vars = cls.__dict__.copy()
+        slots = orig_vars.get('__slots__')
+        if slots is not None:
+            if isinstance(slots, str):
+                slots = [slots]
+            for slots_var in slots:
+                orig_vars.pop(slots_var)
+        orig_vars.pop('__dict__', None)
+        orig_vars.pop('__weakref__', None)
+        if hasattr(cls, '__qualname__'):
+            orig_vars['__qualname__'] = cls.__qualname__
+        return metaclass(cls.__name__, cls.__bases__, orig_vars)
+    return wrapper
+
+
+def ensure_binary(s, encoding='utf-8', errors='strict'):
+    """Coerce **s** to six.binary_type.
+
+    For Python 2:
+      - `unicode` -> encoded to `str`
+      - `str` -> `str`
+
+    For Python 3:
+      - `str` -> encoded to `bytes`
+      - `bytes` -> `bytes`
+    """
+    if isinstance(s, binary_type):
+        return s
+    if isinstance(s, text_type):
+        return s.encode(encoding, errors)
+    raise TypeError("not expecting type '%s'" % type(s))
+
+
+def ensure_str(s, encoding='utf-8', errors='strict'):
+    """Coerce *s* to `str`.
+
+    For Python 2:
+      - `unicode` -> encoded to `str`
+      - `str` -> `str`
+
+    For Python 3:
+      - `str` -> `str`
+      - `bytes` -> decoded to `str`
+    """
+    # Optimization: Fast return for the common case.
+    if type(s) is str:
+        return s
+    if PY2 and isinstance(s, text_type):
+        return s.encode(encoding, errors)
+    elif PY3 and isinstance(s, binary_type):
+        return s.decode(encoding, errors)
+    elif not isinstance(s, (text_type, binary_type)):
+        raise TypeError("not expecting type '%s'" % type(s))
+    return s
+
+
+def ensure_text(s, encoding='utf-8', errors='strict'):
+    """Coerce *s* to six.text_type.
+
+    For Python 2:
+      - `unicode` -> `unicode`
+      - `str` -> `unicode`
+
+    For Python 3:
+      - `str` -> `str`
+      - `bytes` -> decoded to `str`
+    """
+    if isinstance(s, binary_type):
+        return s.decode(encoding, errors)
+    elif isinstance(s, text_type):
+        return s
+    else:
+        raise TypeError("not expecting type '%s'" % type(s))
+
+
+def python_2_unicode_compatible(klass):
+    """
+    A class decorator that defines __unicode__ and __str__ methods under Python 2.
+    Under Python 3 it does nothing.
+
+    To support Python 2 and 3 with a single code base, define a __str__ method
+    returning text and apply this decorator to the class.
+    """
+    if PY2:
+        if '__str__' not in klass.__dict__:
+            raise ValueError("@python_2_unicode_compatible cannot be applied "
+                             "to %s because it doesn't define __str__()." %
+                             klass.__name__)
+        klass.__unicode__ = klass.__str__
+        klass.__str__ = lambda self: self.__unicode__().encode('utf-8')
+    return klass
+
+
+# Complete the moves implementation.
+# This code is at the end of this module to speed up module loading.
+# Turn this module into a package.
+__path__ = []  # required for PEP 302 and PEP 451
+__package__ = __name__  # see PEP 366 @ReservedAssignment
+if globals().get("__spec__") is not None:
+    __spec__.submodule_search_locations = []  # PEP 451 @UndefinedVariable
+# Remove other six meta path importers, since they cause problems. This can
+# happen if six is removed from sys.modules and then reloaded. (Setuptools does
+# this for some reason.)
+if sys.meta_path:
+    for i, importer in enumerate(sys.meta_path):
+        # Here's some real nastiness: Another "instance" of the six module might
+        # be floating around. Therefore, we can't use isinstance() to check for
+        # the six meta path importer, since the other six instance will have
+        # inserted an importer with different class.
+        if (type(importer).__name__ == "_SixMetaPathImporter" and
+                importer.name == __name__):
+            del sys.meta_path[i]
+            break
+    del i, importer
+# Finally, add the importer to the meta path import hook.
+sys.meta_path.append(_importer)
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__init__.py b/venv/Lib/site-packages/pip/_vendor/toml/__init__.py
new file mode 100644
index 000000000..7a08fe725
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/__init__.py
@@ -0,0 +1,25 @@
+"""Python module which parses and emits TOML.
+
+Released under the MIT license.
+"""
+
+from pip._vendor.toml import encoder
+from pip._vendor.toml import decoder
+
+__version__ = "0.10.1"
+_spec_ = "0.5.0"
+
+load = decoder.load
+loads = decoder.loads
+TomlDecoder = decoder.TomlDecoder
+TomlDecodeError = decoder.TomlDecodeError
+TomlPreserveCommentDecoder = decoder.TomlPreserveCommentDecoder
+
+dump = encoder.dump
+dumps = encoder.dumps
+TomlEncoder = encoder.TomlEncoder
+TomlArraySeparatorEncoder = encoder.TomlArraySeparatorEncoder
+TomlPreserveInlineDictEncoder = encoder.TomlPreserveInlineDictEncoder
+TomlNumpyEncoder = encoder.TomlNumpyEncoder
+TomlPreserveCommentEncoder = encoder.TomlPreserveCommentEncoder
+TomlPathlibEncoder = encoder.TomlPathlibEncoder
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..c9e48d1bc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/common.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/common.cpython-36.pyc
new file mode 100644
index 000000000..dd5c73ff2
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/common.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/decoder.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/decoder.cpython-36.pyc
new file mode 100644
index 000000000..d89a1fdc0
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/decoder.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/encoder.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/encoder.cpython-36.pyc
new file mode 100644
index 000000000..9582940d3
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/encoder.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/ordered.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/ordered.cpython-36.pyc
new file mode 100644
index 000000000..e00fc05c1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/ordered.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/tz.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/tz.cpython-36.pyc
new file mode 100644
index 000000000..64ee04ecb
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/toml/__pycache__/tz.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/common.py b/venv/Lib/site-packages/pip/_vendor/toml/common.py
new file mode 100644
index 000000000..a5d673dac
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/common.py
@@ -0,0 +1,6 @@
+# content after the \
+escapes = ['0', 'b', 'f', 'n', 'r', 't', '"']
+# What it should be replaced by
+escapedchars = ['\0', '\b', '\f', '\n', '\r', '\t', '\"']
+# Used for substitution
+escape_to_escapedchars = dict(zip(_escapes, _escapedchars))
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/decoder.py b/venv/Lib/site-packages/pip/_vendor/toml/decoder.py
new file mode 100644
index 000000000..e4887770c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/decoder.py
@@ -0,0 +1,1052 @@
+import datetime
+import io
+from os import linesep
+import re
+import sys
+
+from pip._vendor.toml.tz import TomlTz
+
+if sys.version_info < (3,):
+    _range = xrange  # noqa: F821
+else:
+    unicode = str
+    _range = range
+    basestring = str
+    unichr = chr
+
+
+def _detect_pathlib_path(p):
+    if (3, 4) <= sys.version_info:
+        import pathlib
+        if isinstance(p, pathlib.PurePath):
+            return True
+    return False
+
+
+def _ispath(p):
+    if isinstance(p, (bytes, basestring)):
+        return True
+    return _detect_pathlib_path(p)
+
+
+def _getpath(p):
+    if (3, 6) <= sys.version_info:
+        import os
+        return os.fspath(p)
+    if _detect_pathlib_path(p):
+        return str(p)
+    return p
+
+
+try:
+    FNFError = FileNotFoundError
+except NameError:
+    FNFError = IOError
+
+
+TIME_RE = re.compile(r"([0-9]{2}):([0-9]{2}):([0-9]{2})(\.([0-9]{3,6}))?")
+
+
+class TomlDecodeError(ValueError):
+    """Base toml Exception / Error."""
+
+    def __init__(self, msg, doc, pos):
+        lineno = doc.count('\n', 0, pos) + 1
+        colno = pos - doc.rfind('\n', 0, pos)
+        emsg = '{} (line {} column {} char {})'.format(msg, lineno, colno, pos)
+        ValueError.__init__(self, emsg)
+        self.msg = msg
+        self.doc = doc
+        self.pos = pos
+        self.lineno = lineno
+        self.colno = colno
+
+
+# Matches a TOML number, which allows underscores for readability
+_number_with_underscores = re.compile('([0-9])(_([0-9]))*')
+
+
+class CommentValue(object):
+    def __init__(self, val, comment, beginline, _dict):
+        self.val = val
+        separator = "\n" if beginline else " "
+        self.comment = separator + comment
+        self._dict = _dict
+
+    def __getitem__(self, key):
+        return self.val[key]
+
+    def __setitem__(self, key, value):
+        self.val[key] = value
+
+    def dump(self, dump_value_func):
+        retstr = dump_value_func(self.val)
+        if isinstance(self.val, self._dict):
+            return self.comment + "\n" + unicode(retstr)
+        else:
+            return unicode(retstr) + self.comment
+
+
+def _strictly_valid_num(n):
+    n = n.strip()
+    if not n:
+        return False
+    if n[0] == '_':
+        return False
+    if n[-1] == '_':
+        return False
+    if "_." in n or "._" in n:
+        return False
+    if len(n) == 1:
+        return True
+    if n[0] == '0' and n[1] not in ['.', 'o', 'b', 'x']:
+        return False
+    if n[0] == '+' or n[0] == '-':
+        n = n[1:]
+        if len(n) > 1 and n[0] == '0' and n[1] != '.':
+            return False
+    if '__' in n:
+        return False
+    return True
+
+
+def load(f, _dict=dict, decoder=None):
+    """Parses named file or files as toml and returns a dictionary
+
+    Args:
+        f: Path to the file to open, array of files to read into single dict
+           or a file descriptor
+        _dict: (optional) Specifies the class of the returned toml dictionary
+        decoder: The decoder to use
+
+    Returns:
+        Parsed toml file represented as a dictionary
+
+    Raises:
+        TypeError -- When f is invalid type
+        TomlDecodeError: Error while decoding toml
+        IOError / FileNotFoundError -- When an array with no valid (existing)
+        (Python 2 / Python 3)          file paths is passed
+    """
+
+    if _ispath(f):
+        with io.open(_getpath(f), encoding='utf-8') as ffile:
+            return loads(ffile.read(), _dict, decoder)
+    elif isinstance(f, list):
+        from os import path as op
+        from warnings import warn
+        if not [path for path in f if op.exists(path)]:
+            error_msg = "Load expects a list to contain filenames only."
+            error_msg += linesep
+            error_msg += ("The list needs to contain the path of at least one "
+                          "existing file.")
+            raise FNFError(error_msg)
+        if decoder is None:
+            decoder = TomlDecoder(_dict)
+        d = decoder.get_empty_table()
+        for l in f:  # noqa: E741
+            if op.exists(l):
+                d.update(load(l, _dict, decoder))
+            else:
+                warn("Non-existent filename in list with at least one valid "
+                     "filename")
+        return d
+    else:
+        try:
+            return loads(f.read(), _dict, decoder)
+        except AttributeError:
+            raise TypeError("You can only load a file descriptor, filename or "
+                            "list")
+
+
+_groupname_re = re.compile(r'^[A-Za-z0-9_-]+$')
+
+
+def loads(s, _dict=dict, decoder=None):
+    """Parses string as toml
+
+    Args:
+        s: String to be parsed
+        _dict: (optional) Specifies the class of the returned toml dictionary
+
+    Returns:
+        Parsed toml file represented as a dictionary
+
+    Raises:
+        TypeError: When a non-string is passed
+        TomlDecodeError: Error while decoding toml
+    """
+
+    implicitgroups = []
+    if decoder is None:
+        decoder = TomlDecoder(_dict)
+    retval = decoder.get_empty_table()
+    currentlevel = retval
+    if not isinstance(s, basestring):
+        raise TypeError("Expecting something like a string")
+
+    if not isinstance(s, unicode):
+        s = s.decode('utf8')
+
+    original = s
+    sl = list(s)
+    openarr = 0
+    openstring = False
+    openstrchar = ""
+    multilinestr = False
+    arrayoftables = False
+    beginline = True
+    keygroup = False
+    dottedkey = False
+    keyname = 0
+    key = ''
+    prev_key = ''
+    line_no = 1
+
+    for i, item in enumerate(sl):
+        if item == '\r' and sl[i + 1] == '\n':
+            sl[i] = ' '
+            continue
+        if keyname:
+            key += item
+            if item == '\n':
+                raise TomlDecodeError("Key name found without value."
+                                      " Reached end of line.", original, i)
+            if openstring:
+                if item == openstrchar:
+                    oddbackslash = False
+                    k = 1
+                    while i >= k and sl[i - k] == '\\':
+                        oddbackslash = not oddbackslash
+                        k += 1
+                    if not oddbackslash:
+                        keyname = 2
+                        openstring = False
+                        openstrchar = ""
+                continue
+            elif keyname == 1:
+                if item.isspace():
+                    keyname = 2
+                    continue
+                elif item == '.':
+                    dottedkey = True
+                    continue
+                elif item.isalnum() or item == '_' or item == '-':
+                    continue
+                elif (dottedkey and sl[i - 1] == '.' and
+                      (item == '"' or item == "'")):
+                    openstring = True
+                    openstrchar = item
+                    continue
+            elif keyname == 2:
+                if item.isspace():
+                    if dottedkey:
+                        nextitem = sl[i + 1]
+                        if not nextitem.isspace() and nextitem != '.':
+                            keyname = 1
+                    continue
+                if item == '.':
+                    dottedkey = True
+                    nextitem = sl[i + 1]
+                    if not nextitem.isspace() and nextitem != '.':
+                        keyname = 1
+                    continue
+            if item == '=':
+                keyname = 0
+                prev_key = key[:-1].rstrip()
+                key = ''
+                dottedkey = False
+            else:
+                raise TomlDecodeError("Found invalid character in key name: '" +
+                                      item + "'. Try quoting the key name.",
+                                      original, i)
+        if item == "'" and openstrchar != '"':
+            k = 1
+            try:
+                while sl[i - k] == "'":
+                    k += 1
+                    if k == 3:
+                        break
+            except IndexError:
+                pass
+            if k == 3:
+                multilinestr = not multilinestr
+                openstring = multilinestr
+            else:
+                openstring = not openstring
+            if openstring:
+                openstrchar = "'"
+            else:
+                openstrchar = ""
+        if item == '"' and openstrchar != "'":
+            oddbackslash = False
+            k = 1
+            tripquote = False
+            try:
+                while sl[i - k] == '"':
+                    k += 1
+                    if k == 3:
+                        tripquote = True
+                        break
+                if k == 1 or (k == 3 and tripquote):
+                    while sl[i - k] == '\\':
+                        oddbackslash = not oddbackslash
+                        k += 1
+            except IndexError:
+                pass
+            if not oddbackslash:
+                if tripquote:
+                    multilinestr = not multilinestr
+                    openstring = multilinestr
+                else:
+                    openstring = not openstring
+            if openstring:
+                openstrchar = '"'
+            else:
+                openstrchar = ""
+        if item == '#' and (not openstring and not keygroup and
+                            not arrayoftables):
+            j = i
+            comment = ""
+            try:
+                while sl[j] != '\n':
+                    comment += s[j]
+                    sl[j] = ' '
+                    j += 1
+            except IndexError:
+                break
+            if not openarr:
+                decoder.preserve_comment(line_no, prev_key, comment, beginline)
+        if item == '[' and (not openstring and not keygroup and
+                            not arrayoftables):
+            if beginline:
+                if len(sl) > i + 1 and sl[i + 1] == '[':
+                    arrayoftables = True
+                else:
+                    keygroup = True
+            else:
+                openarr += 1
+        if item == ']' and not openstring:
+            if keygroup:
+                keygroup = False
+            elif arrayoftables:
+                if sl[i - 1] == ']':
+                    arrayoftables = False
+            else:
+                openarr -= 1
+        if item == '\n':
+            if openstring or multilinestr:
+                if not multilinestr:
+                    raise TomlDecodeError("Unbalanced quotes", original, i)
+                if ((sl[i - 1] == "'" or sl[i - 1] == '"') and (
+                        sl[i - 2] == sl[i - 1])):
+                    sl[i] = sl[i - 1]
+                    if sl[i - 3] == sl[i - 1]:
+                        sl[i - 3] = ' '
+            elif openarr:
+                sl[i] = ' '
+            else:
+                beginline = True
+            line_no += 1
+        elif beginline and sl[i] != ' ' and sl[i] != '\t':
+            beginline = False
+            if not keygroup and not arrayoftables:
+                if sl[i] == '=':
+                    raise TomlDecodeError("Found empty keyname. ", original, i)
+                keyname = 1
+                key += item
+    if keyname:
+        raise TomlDecodeError("Key name found without value."
+                              " Reached end of file.", original, len(s))
+    if openstring:  # reached EOF and have an unterminated string
+        raise TomlDecodeError("Unterminated string found."
+                              " Reached end of file.", original, len(s))
+    s = ''.join(sl)
+    s = s.split('\n')
+    multikey = None
+    multilinestr = ""
+    multibackslash = False
+    pos = 0
+    for idx, line in enumerate(s):
+        if idx > 0:
+            pos += len(s[idx - 1]) + 1
+
+        decoder.embed_comments(idx, currentlevel)
+
+        if not multilinestr or multibackslash or '\n' not in multilinestr:
+            line = line.strip()
+        if line == "" and (not multikey or multibackslash):
+            continue
+        if multikey:
+            if multibackslash:
+                multilinestr += line
+            else:
+                multilinestr += line
+            multibackslash = False
+            closed = False
+            if multilinestr[0] == '[':
+                closed = line[-1] == ']'
+            elif len(line) > 2:
+                closed = (line[-1] == multilinestr[0] and
+                          line[-2] == multilinestr[0] and
+                          line[-3] == multilinestr[0])
+            if closed:
+                try:
+                    value, vtype = decoder.load_value(multilinestr)
+                except ValueError as err:
+                    raise TomlDecodeError(str(err), original, pos)
+                currentlevel[multikey] = value
+                multikey = None
+                multilinestr = ""
+            else:
+                k = len(multilinestr) - 1
+                while k > -1 and multilinestr[k] == '\\':
+                    multibackslash = not multibackslash
+                    k -= 1
+                if multibackslash:
+                    multilinestr = multilinestr[:-1]
+                else:
+                    multilinestr += "\n"
+            continue
+        if line[0] == '[':
+            arrayoftables = False
+            if len(line) == 1:
+                raise TomlDecodeError("Opening key group bracket on line by "
+                                      "itself.", original, pos)
+            if line[1] == '[':
+                arrayoftables = True
+                line = line[2:]
+                splitstr = ']]'
+            else:
+                line = line[1:]
+                splitstr = ']'
+            i = 1
+            quotesplits = decoder._get_split_on_quotes(line)
+            quoted = False
+            for quotesplit in quotesplits:
+                if not quoted and splitstr in quotesplit:
+                    break
+                i += quotesplit.count(splitstr)
+                quoted = not quoted
+            line = line.split(splitstr, i)
+            if len(line) < i + 1 or line[-1].strip() != "":
+                raise TomlDecodeError("Key group not on a line by itself.",
+                                      original, pos)
+            groups = splitstr.join(line[:-1]).split('.')
+            i = 0
+            while i < len(groups):
+                groups[i] = groups[i].strip()
+                if len(groups[i]) > 0 and (groups[i][0] == '"' or
+                                           groups[i][0] == "'"):
+                    groupstr = groups[i]
+                    j = i + 1
+                    while not groupstr[0] == groupstr[-1]:
+                        j += 1
+                        if j > len(groups) + 2:
+                            raise TomlDecodeError("Invalid group name '" +
+                                                  groupstr + "' Something " +
+                                                  "went wrong.", original, pos)
+                        groupstr = '.'.join(groups[i:j]).strip()
+                    groups[i] = groupstr[1:-1]
+                    groups[i + 1:j] = []
+                else:
+                    if not _groupname_re.match(groups[i]):
+                        raise TomlDecodeError("Invalid group name '" +
+                                              groups[i] + "'. Try quoting it.",
+                                              original, pos)
+                i += 1
+            currentlevel = retval
+            for i in _range(len(groups)):
+                group = groups[i]
+                if group == "":
+                    raise TomlDecodeError("Can't have a keygroup with an empty "
+                                          "name", original, pos)
+                try:
+                    currentlevel[group]
+                    if i == len(groups) - 1:
+                        if group in implicitgroups:
+                            implicitgroups.remove(group)
+                            if arrayoftables:
+                                raise TomlDecodeError("An implicitly defined "
+                                                      "table can't be an array",
+                                                      original, pos)
+                        elif arrayoftables:
+                            currentlevel[group].append(decoder.get_empty_table()
+                                                       )
+                        else:
+                            raise TomlDecodeError("What? " + group +
+                                                  " already exists?" +
+                                                  str(currentlevel),
+                                                  original, pos)
+                except TypeError:
+                    currentlevel = currentlevel[-1]
+                    if group not in currentlevel:
+                        currentlevel[group] = decoder.get_empty_table()
+                        if i == len(groups) - 1 and arrayoftables:
+                            currentlevel[group] = [decoder.get_empty_table()]
+                except KeyError:
+                    if i != len(groups) - 1:
+                        implicitgroups.append(group)
+                    currentlevel[group] = decoder.get_empty_table()
+                    if i == len(groups) - 1 and arrayoftables:
+                        currentlevel[group] = [decoder.get_empty_table()]
+                currentlevel = currentlevel[group]
+                if arrayoftables:
+                    try:
+                        currentlevel = currentlevel[-1]
+                    except KeyError:
+                        pass
+        elif line[0] == "{":
+            if line[-1] != "}":
+                raise TomlDecodeError("Line breaks are not allowed in inline"
+                                      "objects", original, pos)
+            try:
+                decoder.load_inline_object(line, currentlevel, multikey,
+                                           multibackslash)
+            except ValueError as err:
+                raise TomlDecodeError(str(err), original, pos)
+        elif "=" in line:
+            try:
+                ret = decoder.load_line(line, currentlevel, multikey,
+                                        multibackslash)
+            except ValueError as err:
+                raise TomlDecodeError(str(err), original, pos)
+            if ret is not None:
+                multikey, multilinestr, multibackslash = ret
+    return retval
+
+
+def _load_date(val):
+    microsecond = 0
+    tz = None
+    try:
+        if len(val) > 19:
+            if val[19] == '.':
+                if val[-1].upper() == 'Z':
+                    subsecondval = val[20:-1]
+                    tzval = "Z"
+                else:
+                    subsecondvalandtz = val[20:]
+                    if '+' in subsecondvalandtz:
+                        splitpoint = subsecondvalandtz.index('+')
+                        subsecondval = subsecondvalandtz[:splitpoint]
+                        tzval = subsecondvalandtz[splitpoint:]
+                    elif '-' in subsecondvalandtz:
+                        splitpoint = subsecondvalandtz.index('-')
+                        subsecondval = subsecondvalandtz[:splitpoint]
+                        tzval = subsecondvalandtz[splitpoint:]
+                    else:
+                        tzval = None
+                        subsecondval = subsecondvalandtz
+                if tzval is not None:
+                    tz = TomlTz(tzval)
+                microsecond = int(int(subsecondval) *
+                                  (10 ** (6 - len(subsecondval))))
+            else:
+                tz = TomlTz(val[19:])
+    except ValueError:
+        tz = None
+    if "-" not in val[1:]:
+        return None
+    try:
+        if len(val) == 10:
+            d = datetime.date(
+                int(val[:4]), int(val[5:7]),
+                int(val[8:10]))
+        else:
+            d = datetime.datetime(
+                int(val[:4]), int(val[5:7]),
+                int(val[8:10]), int(val[11:13]),
+                int(val[14:16]), int(val[17:19]), microsecond, tz)
+    except ValueError:
+        return None
+    return d
+
+
+def _load_unicode_escapes(v, hexbytes, prefix):
+    skip = False
+    i = len(v) - 1
+    while i > -1 and v[i] == '\\':
+        skip = not skip
+        i -= 1
+    for hx in hexbytes:
+        if skip:
+            skip = False
+            i = len(hx) - 1
+            while i > -1 and hx[i] == '\\':
+                skip = not skip
+                i -= 1
+            v += prefix
+            v += hx
+            continue
+        hxb = ""
+        i = 0
+        hxblen = 4
+        if prefix == "\\U":
+            hxblen = 8
+        hxb = ''.join(hx[i:i + hxblen]).lower()
+        if hxb.strip('0123456789abcdef'):
+            raise ValueError("Invalid escape sequence: " + hxb)
+        if hxb[0] == "d" and hxb[1].strip('01234567'):
+            raise ValueError("Invalid escape sequence: " + hxb +
+                             ". Only scalar unicode points are allowed.")
+        v += unichr(int(hxb, 16))
+        v += unicode(hx[len(hxb):])
+    return v
+
+
+# Unescape TOML string values.
+
+# content after the \
+_escapes = ['0', 'b', 'f', 'n', 'r', 't', '"']
+# What it should be replaced by
+_escapedchars = ['\0', '\b', '\f', '\n', '\r', '\t', '\"']
+# Used for substitution
+_escape_to_escapedchars = dict(zip(_escapes, _escapedchars))
+
+
+def _unescape(v):
+    """Unescape characters in a TOML string."""
+    i = 0
+    backslash = False
+    while i < len(v):
+        if backslash:
+            backslash = False
+            if v[i] in _escapes:
+                v = v[:i - 1] + _escape_to_escapedchars[v[i]] + v[i + 1:]
+            elif v[i] == '\\':
+                v = v[:i - 1] + v[i:]
+            elif v[i] == 'u' or v[i] == 'U':
+                i += 1
+            else:
+                raise ValueError("Reserved escape sequence used")
+            continue
+        elif v[i] == '\\':
+            backslash = True
+        i += 1
+    return v
+
+
+class InlineTableDict(object):
+    """Sentinel subclass of dict for inline tables."""
+
+
+class TomlDecoder(object):
+
+    def __init__(self, _dict=dict):
+        self._dict = _dict
+
+    def get_empty_table(self):
+        return self._dict()
+
+    def get_empty_inline_table(self):
+        class DynamicInlineTableDict(self._dict, InlineTableDict):
+            """Concrete sentinel subclass for inline tables.
+            It is a subclass of _dict which is passed in dynamically at load
+            time
+
+            It is also a subclass of InlineTableDict
+            """
+
+        return DynamicInlineTableDict()
+
+    def load_inline_object(self, line, currentlevel, multikey=False,
+                           multibackslash=False):
+        candidate_groups = line[1:-1].split(",")
+        groups = []
+        if len(candidate_groups) == 1 and not candidate_groups[0].strip():
+            candidate_groups.pop()
+        while len(candidate_groups) > 0:
+            candidate_group = candidate_groups.pop(0)
+            try:
+                _, value = candidate_group.split('=', 1)
+            except ValueError:
+                raise ValueError("Invalid inline table encountered")
+            value = value.strip()
+            if ((value[0] == value[-1] and value[0] in ('"', "'")) or (
+                    value[0] in '-0123456789' or
+                    value in ('true', 'false') or
+                    (value[0] == "[" and value[-1] == "]") or
+                    (value[0] == '{' and value[-1] == '}'))):
+                groups.append(candidate_group)
+            elif len(candidate_groups) > 0:
+                candidate_groups[0] = (candidate_group + "," +
+                                       candidate_groups[0])
+            else:
+                raise ValueError("Invalid inline table value encountered")
+        for group in groups:
+            status = self.load_line(group, currentlevel, multikey,
+                                    multibackslash)
+            if status is not None:
+                break
+
+    def _get_split_on_quotes(self, line):
+        doublequotesplits = line.split('"')
+        quoted = False
+        quotesplits = []
+        if len(doublequotesplits) > 1 and "'" in doublequotesplits[0]:
+            singlequotesplits = doublequotesplits[0].split("'")
+            doublequotesplits = doublequotesplits[1:]
+            while len(singlequotesplits) % 2 == 0 and len(doublequotesplits):
+                singlequotesplits[-1] += '"' + doublequotesplits[0]
+                doublequotesplits = doublequotesplits[1:]
+                if "'" in singlequotesplits[-1]:
+                    singlequotesplits = (singlequotesplits[:-1] +
+                                         singlequotesplits[-1].split("'"))
+            quotesplits += singlequotesplits
+        for doublequotesplit in doublequotesplits:
+            if quoted:
+                quotesplits.append(doublequotesplit)
+            else:
+                quotesplits += doublequotesplit.split("'")
+                quoted = not quoted
+        return quotesplits
+
+    def load_line(self, line, currentlevel, multikey, multibackslash):
+        i = 1
+        quotesplits = self._get_split_on_quotes(line)
+        quoted = False
+        for quotesplit in quotesplits:
+            if not quoted and '=' in quotesplit:
+                break
+            i += quotesplit.count('=')
+            quoted = not quoted
+        pair = line.split('=', i)
+        strictly_valid = _strictly_valid_num(pair[-1])
+        if _number_with_underscores.match(pair[-1]):
+            pair[-1] = pair[-1].replace('_', '')
+        while len(pair[-1]) and (pair[-1][0] != ' ' and pair[-1][0] != '\t' and
+                                 pair[-1][0] != "'" and pair[-1][0] != '"' and
+                                 pair[-1][0] != '[' and pair[-1][0] != '{' and
+                                 pair[-1].strip() != 'true' and
+                                 pair[-1].strip() != 'false'):
+            try:
+                float(pair[-1])
+                break
+            except ValueError:
+                pass
+            if _load_date(pair[-1]) is not None:
+                break
+            if TIME_RE.match(pair[-1]):
+                break
+            i += 1
+            prev_val = pair[-1]
+            pair = line.split('=', i)
+            if prev_val == pair[-1]:
+                raise ValueError("Invalid date or number")
+            if strictly_valid:
+                strictly_valid = _strictly_valid_num(pair[-1])
+        pair = ['='.join(pair[:-1]).strip(), pair[-1].strip()]
+        if '.' in pair[0]:
+            if '"' in pair[0] or "'" in pair[0]:
+                quotesplits = self._get_split_on_quotes(pair[0])
+                quoted = False
+                levels = []
+                for quotesplit in quotesplits:
+                    if quoted:
+                        levels.append(quotesplit)
+                    else:
+                        levels += [level.strip() for level in
+                                   quotesplit.split('.')]
+                    quoted = not quoted
+            else:
+                levels = pair[0].split('.')
+            while levels[-1] == "":
+                levels = levels[:-1]
+            for level in levels[:-1]:
+                if level == "":
+                    continue
+                if level not in currentlevel:
+                    currentlevel[level] = self.get_empty_table()
+                currentlevel = currentlevel[level]
+            pair[0] = levels[-1].strip()
+        elif (pair[0][0] == '"' or pair[0][0] == "'") and \
+                (pair[0][-1] == pair[0][0]):
+            pair[0] = _unescape(pair[0][1:-1])
+        k, koffset = self._load_line_multiline_str(pair[1])
+        if k > -1:
+            while k > -1 and pair[1][k + koffset] == '\\':
+                multibackslash = not multibackslash
+                k -= 1
+            if multibackslash:
+                multilinestr = pair[1][:-1]
+            else:
+                multilinestr = pair[1] + "\n"
+            multikey = pair[0]
+        else:
+            value, vtype = self.load_value(pair[1], strictly_valid)
+        try:
+            currentlevel[pair[0]]
+            raise ValueError("Duplicate keys!")
+        except TypeError:
+            raise ValueError("Duplicate keys!")
+        except KeyError:
+            if multikey:
+                return multikey, multilinestr, multibackslash
+            else:
+                currentlevel[pair[0]] = value
+
+    def _load_line_multiline_str(self, p):
+        poffset = 0
+        if len(p) < 3:
+            return -1, poffset
+        if p[0] == '[' and (p.strip()[-1] != ']' and
+                            self._load_array_isstrarray(p)):
+            newp = p[1:].strip().split(',')
+            while len(newp) > 1 and newp[-1][0] != '"' and newp[-1][0] != "'":
+                newp = newp[:-2] + [newp[-2] + ',' + newp[-1]]
+            newp = newp[-1]
+            poffset = len(p) - len(newp)
+            p = newp
+        if p[0] != '"' and p[0] != "'":
+            return -1, poffset
+        if p[1] != p[0] or p[2] != p[0]:
+            return -1, poffset
+        if len(p) > 5 and p[-1] == p[0] and p[-2] == p[0] and p[-3] == p[0]:
+            return -1, poffset
+        return len(p) - 1, poffset
+
+    def load_value(self, v, strictly_valid=True):
+        if not v:
+            raise ValueError("Empty value is invalid")
+        if v == 'true':
+            return (True, "bool")
+        elif v == 'false':
+            return (False, "bool")
+        elif v[0] == '"' or v[0] == "'":
+            quotechar = v[0]
+            testv = v[1:].split(quotechar)
+            triplequote = False
+            triplequotecount = 0
+            if len(testv) > 1 and testv[0] == '' and testv[1] == '':
+                testv = testv[2:]
+                triplequote = True
+            closed = False
+            for tv in testv:
+                if tv == '':
+                    if triplequote:
+                        triplequotecount += 1
+                    else:
+                        closed = True
+                else:
+                    oddbackslash = False
+                    try:
+                        i = -1
+                        j = tv[i]
+                        while j == '\\':
+                            oddbackslash = not oddbackslash
+                            i -= 1
+                            j = tv[i]
+                    except IndexError:
+                        pass
+                    if not oddbackslash:
+                        if closed:
+                            raise ValueError("Found tokens after a closed " +
+                                             "string. Invalid TOML.")
+                        else:
+                            if not triplequote or triplequotecount > 1:
+                                closed = True
+                            else:
+                                triplequotecount = 0
+            if quotechar == '"':
+                escapeseqs = v.split('\\')[1:]
+                backslash = False
+                for i in escapeseqs:
+                    if i == '':
+                        backslash = not backslash
+                    else:
+                        if i[0] not in _escapes and (i[0] != 'u' and
+                                                     i[0] != 'U' and
+                                                     not backslash):
+                            raise ValueError("Reserved escape sequence used")
+                        if backslash:
+                            backslash = False
+                for prefix in ["\\u", "\\U"]:
+                    if prefix in v:
+                        hexbytes = v.split(prefix)
+                        v = _load_unicode_escapes(hexbytes[0], hexbytes[1:],
+                                                  prefix)
+                v = _unescape(v)
+            if len(v) > 1 and v[1] == quotechar and (len(v) < 3 or
+                                                     v[1] == v[2]):
+                v = v[2:-2]
+            return (v[1:-1], "str")
+        elif v[0] == '[':
+            return (self.load_array(v), "array")
+        elif v[0] == '{':
+            inline_object = self.get_empty_inline_table()
+            self.load_inline_object(v, inline_object)
+            return (inline_object, "inline_object")
+        elif TIME_RE.match(v):
+            h, m, s, _, ms = TIME_RE.match(v).groups()
+            time = datetime.time(int(h), int(m), int(s), int(ms) if ms else 0)
+            return (time, "time")
+        else:
+            parsed_date = _load_date(v)
+            if parsed_date is not None:
+                return (parsed_date, "date")
+            if not strictly_valid:
+                raise ValueError("Weirdness with leading zeroes or "
+                                 "underscores in your number.")
+            itype = "int"
+            neg = False
+            if v[0] == '-':
+                neg = True
+                v = v[1:]
+            elif v[0] == '+':
+                v = v[1:]
+            v = v.replace('_', '')
+            lowerv = v.lower()
+            if '.' in v or ('x' not in v and ('e' in v or 'E' in v)):
+                if '.' in v and v.split('.', 1)[1] == '':
+                    raise ValueError("This float is missing digits after "
+                                     "the point")
+                if v[0] not in '0123456789':
+                    raise ValueError("This float doesn't have a leading "
+                                     "digit")
+                v = float(v)
+                itype = "float"
+            elif len(lowerv) == 3 and (lowerv == 'inf' or lowerv == 'nan'):
+                v = float(v)
+                itype = "float"
+            if itype == "int":
+                v = int(v, 0)
+            if neg:
+                return (0 - v, itype)
+            return (v, itype)
+
+    def bounded_string(self, s):
+        if len(s) == 0:
+            return True
+        if s[-1] != s[0]:
+            return False
+        i = -2
+        backslash = False
+        while len(s) + i > 0:
+            if s[i] == "\\":
+                backslash = not backslash
+                i -= 1
+            else:
+                break
+        return not backslash
+
+    def _load_array_isstrarray(self, a):
+        a = a[1:-1].strip()
+        if a != '' and (a[0] == '"' or a[0] == "'"):
+            return True
+        return False
+
+    def load_array(self, a):
+        atype = None
+        retval = []
+        a = a.strip()
+        if '[' not in a[1:-1] or "" != a[1:-1].split('[')[0].strip():
+            strarray = self._load_array_isstrarray(a)
+            if not a[1:-1].strip().startswith('{'):
+                a = a[1:-1].split(',')
+            else:
+                # a is an inline object, we must find the matching parenthesis
+                # to define groups
+                new_a = []
+                start_group_index = 1
+                end_group_index = 2
+                open_bracket_count = 1 if a[start_group_index] == '{' else 0
+                in_str = False
+                while end_group_index < len(a[1:]):
+                    if a[end_group_index] == '"' or a[end_group_index] == "'":
+                        if in_str:
+                            backslash_index = end_group_index - 1
+                            while (backslash_index > -1 and
+                                   a[backslash_index] == '\\'):
+                                in_str = not in_str
+                                backslash_index -= 1
+                        in_str = not in_str
+                    if not in_str and a[end_group_index] == '{':
+                        open_bracket_count += 1
+                    if in_str or a[end_group_index] != '}':
+                        end_group_index += 1
+                        continue
+                    elif a[end_group_index] == '}' and open_bracket_count > 1:
+                        open_bracket_count -= 1
+                        end_group_index += 1
+                        continue
+
+                    # Increase end_group_index by 1 to get the closing bracket
+                    end_group_index += 1
+
+                    new_a.append(a[start_group_index:end_group_index])
+
+                    # The next start index is at least after the closing
+                    # bracket, a closing bracket can be followed by a comma
+                    # since we are in an array.
+                    start_group_index = end_group_index + 1
+                    while (start_group_index < len(a[1:]) and
+                           a[start_group_index] != '{'):
+                        start_group_index += 1
+                    end_group_index = start_group_index + 1
+                a = new_a
+            b = 0
+            if strarray:
+                while b < len(a) - 1:
+                    ab = a[b].strip()
+                    while (not self.bounded_string(ab) or
+                           (len(ab) > 2 and
+                            ab[0] == ab[1] == ab[2] and
+                            ab[-2] != ab[0] and
+                            ab[-3] != ab[0])):
+                        a[b] = a[b] + ',' + a[b + 1]
+                        ab = a[b].strip()
+                        if b < len(a) - 2:
+                            a = a[:b + 1] + a[b + 2:]
+                        else:
+                            a = a[:b + 1]
+                    b += 1
+        else:
+            al = list(a[1:-1])
+            a = []
+            openarr = 0
+            j = 0
+            for i in _range(len(al)):
+                if al[i] == '[':
+                    openarr += 1
+                elif al[i] == ']':
+                    openarr -= 1
+                elif al[i] == ',' and not openarr:
+                    a.append(''.join(al[j:i]))
+                    j = i + 1
+            a.append(''.join(al[j:]))
+        for i in _range(len(a)):
+            a[i] = a[i].strip()
+            if a[i] != '':
+                nval, ntype = self.load_value(a[i])
+                if atype:
+                    if ntype != atype:
+                        raise ValueError("Not a homogeneous array")
+                else:
+                    atype = ntype
+                retval.append(nval)
+        return retval
+
+    def preserve_comment(self, line_no, key, comment, beginline):
+        pass
+
+    def embed_comments(self, idx, currentlevel):
+        pass
+
+
+class TomlPreserveCommentDecoder(TomlDecoder):
+
+    def __init__(self, _dict=dict):
+        self.saved_comments = {}
+        super(TomlPreserveCommentDecoder, self).__init__(_dict)
+
+    def preserve_comment(self, line_no, key, comment, beginline):
+        self.saved_comments[line_no] = (key, comment, beginline)
+
+    def embed_comments(self, idx, currentlevel):
+        if idx not in self.saved_comments:
+            return
+
+        key, comment, beginline = self.saved_comments[idx]
+        currentlevel[key] = CommentValue(currentlevel[key], comment, beginline,
+                                         self._dict)
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/encoder.py b/venv/Lib/site-packages/pip/_vendor/toml/encoder.py
new file mode 100644
index 000000000..a8b03c7be
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/encoder.py
@@ -0,0 +1,304 @@
+import datetime
+import re
+import sys
+from decimal import Decimal
+
+from pip._vendor.toml.decoder import InlineTableDict
+
+if sys.version_info >= (3,):
+    unicode = str
+
+
+def dump(o, f, encoder=None):
+    """Writes out dict as toml to a file
+
+    Args:
+        o: Object to dump into toml
+        f: File descriptor where the toml should be stored
+        encoder: The ``TomlEncoder`` to use for constructing the output string
+
+    Returns:
+        String containing the toml corresponding to dictionary
+
+    Raises:
+        TypeError: When anything other than file descriptor is passed
+    """
+
+    if not f.write:
+        raise TypeError("You can only dump an object to a file descriptor")
+    d = dumps(o, encoder=encoder)
+    f.write(d)
+    return d
+
+
+def dumps(o, encoder=None):
+    """Stringifies input dict as toml
+
+    Args:
+        o: Object to dump into toml
+        encoder: The ``TomlEncoder`` to use for constructing the output string
+
+    Returns:
+        String containing the toml corresponding to dict
+
+    Examples:
+        ```python
+        >>> import toml
+        >>> output = {
+        ... 'a': "I'm a string",
+        ... 'b': ["I'm", "a", "list"],
+        ... 'c': 2400
+        ... }
+        >>> toml.dumps(output)
+        'a = "I\'m a string"\nb = [ "I\'m", "a", "list",]\nc = 2400\n'
+        ```
+    """
+
+    retval = ""
+    if encoder is None:
+        encoder = TomlEncoder(o.__class__)
+    addtoretval, sections = encoder.dump_sections(o, "")
+    retval += addtoretval
+    outer_objs = [id(o)]
+    while sections:
+        section_ids = [id(section) for section in sections]
+        for outer_obj in outer_objs:
+            if outer_obj in section_ids:
+                raise ValueError("Circular reference detected")
+        outer_objs += section_ids
+        newsections = encoder.get_empty_table()
+        for section in sections:
+            addtoretval, addtosections = encoder.dump_sections(
+                sections[section], section)
+
+            if addtoretval or (not addtoretval and not addtosections):
+                if retval and retval[-2:] != "\n\n":
+                    retval += "\n"
+                retval += "[" + section + "]\n"
+                if addtoretval:
+                    retval += addtoretval
+            for s in addtosections:
+                newsections[section + "." + s] = addtosections[s]
+        sections = newsections
+    return retval
+
+
+def _dump_str(v):
+    if sys.version_info < (3,) and hasattr(v, 'decode') and isinstance(v, str):
+        v = v.decode('utf-8')
+    v = "%r" % v
+    if v[0] == 'u':
+        v = v[1:]
+    singlequote = v.startswith("'")
+    if singlequote or v.startswith('"'):
+        v = v[1:-1]
+    if singlequote:
+        v = v.replace("\\'", "'")
+        v = v.replace('"', '\\"')
+    v = v.split("\\x")
+    while len(v) > 1:
+        i = -1
+        if not v[0]:
+            v = v[1:]
+        v[0] = v[0].replace("\\\\", "\\")
+        # No, I don't know why != works and == breaks
+        joinx = v[0][i] != "\\"
+        while v[0][:i] and v[0][i] == "\\":
+            joinx = not joinx
+            i -= 1
+        if joinx:
+            joiner = "x"
+        else:
+            joiner = "u00"
+        v = [v[0] + joiner + v[1]] + v[2:]
+    return unicode('"' + v[0] + '"')
+
+
+def _dump_float(v):
+    return "{}".format(v).replace("e+0", "e+").replace("e-0", "e-")
+
+
+def _dump_time(v):
+    utcoffset = v.utcoffset()
+    if utcoffset is None:
+        return v.isoformat()
+    # The TOML norm specifies that it's local time thus we drop the offset
+    return v.isoformat()[:-6]
+
+
+class TomlEncoder(object):
+
+    def __init__(self, _dict=dict, preserve=False):
+        self._dict = _dict
+        self.preserve = preserve
+        self.dump_funcs = {
+            str: _dump_str,
+            unicode: _dump_str,
+            list: self.dump_list,
+            bool: lambda v: unicode(v).lower(),
+            int: lambda v: v,
+            float: _dump_float,
+            Decimal: _dump_float,
+            datetime.datetime: lambda v: v.isoformat().replace('+00:00', 'Z'),
+            datetime.time: _dump_time,
+            datetime.date: lambda v: v.isoformat()
+        }
+
+    def get_empty_table(self):
+        return self._dict()
+
+    def dump_list(self, v):
+        retval = "["
+        for u in v:
+            retval += " " + unicode(self.dump_value(u)) + ","
+        retval += "]"
+        return retval
+
+    def dump_inline_table(self, section):
+        """Preserve inline table in its compact syntax instead of expanding
+        into subsection.
+
+        https://github.com/toml-lang/toml#user-content-inline-table
+        """
+        retval = ""
+        if isinstance(section, dict):
+            val_list = []
+            for k, v in section.items():
+                val = self.dump_inline_table(v)
+                val_list.append(k + " = " + val)
+            retval += "{ " + ", ".join(val_list) + " }\n"
+            return retval
+        else:
+            return unicode(self.dump_value(section))
+
+    def dump_value(self, v):
+        # Lookup function corresponding to v's type
+        dump_fn = self.dump_funcs.get(type(v))
+        if dump_fn is None and hasattr(v, '__iter__'):
+            dump_fn = self.dump_funcs[list]
+        # Evaluate function (if it exists) else return v
+        return dump_fn(v) if dump_fn is not None else self.dump_funcs[str](v)
+
+    def dump_sections(self, o, sup):
+        retstr = ""
+        if sup != "" and sup[-1] != ".":
+            sup += '.'
+        retdict = self._dict()
+        arraystr = ""
+        for section in o:
+            section = unicode(section)
+            qsection = section
+            if not re.match(r'^[A-Za-z0-9_-]+$', section):
+                qsection = _dump_str(section)
+            if not isinstance(o[section], dict):
+                arrayoftables = False
+                if isinstance(o[section], list):
+                    for a in o[section]:
+                        if isinstance(a, dict):
+                            arrayoftables = True
+                if arrayoftables:
+                    for a in o[section]:
+                        arraytabstr = "\n"
+                        arraystr += "[[" + sup + qsection + "]]\n"
+                        s, d = self.dump_sections(a, sup + qsection)
+                        if s:
+                            if s[0] == "[":
+                                arraytabstr += s
+                            else:
+                                arraystr += s
+                        while d:
+                            newd = self._dict()
+                            for dsec in d:
+                                s1, d1 = self.dump_sections(d[dsec], sup +
+                                                            qsection + "." +
+                                                            dsec)
+                                if s1:
+                                    arraytabstr += ("[" + sup + qsection +
+                                                    "." + dsec + "]\n")
+                                    arraytabstr += s1
+                                for s1 in d1:
+                                    newd[dsec + "." + s1] = d1[s1]
+                            d = newd
+                        arraystr += arraytabstr
+                else:
+                    if o[section] is not None:
+                        retstr += (qsection + " = " +
+                                   unicode(self.dump_value(o[section])) + '\n')
+            elif self.preserve and isinstance(o[section], InlineTableDict):
+                retstr += (qsection + " = " +
+                           self.dump_inline_table(o[section]))
+            else:
+                retdict[qsection] = o[section]
+        retstr += arraystr
+        return (retstr, retdict)
+
+
+class TomlPreserveInlineDictEncoder(TomlEncoder):
+
+    def __init__(self, _dict=dict):
+        super(TomlPreserveInlineDictEncoder, self).__init__(_dict, True)
+
+
+class TomlArraySeparatorEncoder(TomlEncoder):
+
+    def __init__(self, _dict=dict, preserve=False, separator=","):
+        super(TomlArraySeparatorEncoder, self).__init__(_dict, preserve)
+        if separator.strip() == "":
+            separator = "," + separator
+        elif separator.strip(' \t\n\r,'):
+            raise ValueError("Invalid separator for arrays")
+        self.separator = separator
+
+    def dump_list(self, v):
+        t = []
+        retval = "["
+        for u in v:
+            t.append(self.dump_value(u))
+        while t != []:
+            s = []
+            for u in t:
+                if isinstance(u, list):
+                    for r in u:
+                        s.append(r)
+                else:
+                    retval += " " + unicode(u) + self.separator
+            t = s
+        retval += "]"
+        return retval
+
+
+class TomlNumpyEncoder(TomlEncoder):
+
+    def __init__(self, _dict=dict, preserve=False):
+        import numpy as np
+        super(TomlNumpyEncoder, self).__init__(_dict, preserve)
+        self.dump_funcs[np.float16] = _dump_float
+        self.dump_funcs[np.float32] = _dump_float
+        self.dump_funcs[np.float64] = _dump_float
+        self.dump_funcs[np.int16] = self._dump_int
+        self.dump_funcs[np.int32] = self._dump_int
+        self.dump_funcs[np.int64] = self._dump_int
+
+    def _dump_int(self, v):
+        return "{}".format(int(v))
+
+
+class TomlPreserveCommentEncoder(TomlEncoder):
+
+    def __init__(self, _dict=dict, preserve=False):
+        from pip._vendor.toml.decoder import CommentValue
+        super(TomlPreserveCommentEncoder, self).__init__(_dict, preserve)
+        self.dump_funcs[CommentValue] = lambda v: v.dump(self.dump_value)
+
+
+class TomlPathlibEncoder(TomlEncoder):
+
+    def _dump_pathlib_path(self, v):
+        return _dump_str(str(v))
+
+    def dump_value(self, v):
+        if (3, 4) <= sys.version_info:
+            import pathlib
+            if isinstance(v, pathlib.PurePath):
+                v = str(v)
+        return super(TomlPathlibEncoder, self).dump_value(v)
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/ordered.py b/venv/Lib/site-packages/pip/_vendor/toml/ordered.py
new file mode 100644
index 000000000..6052016e8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/ordered.py
@@ -0,0 +1,15 @@
+from collections import OrderedDict
+from pip._vendor.toml import TomlEncoder
+from pip._vendor.toml import TomlDecoder
+
+
+class TomlOrderedDecoder(TomlDecoder):
+
+    def __init__(self):
+        super(self.__class__, self).__init__(_dict=OrderedDict)
+
+
+class TomlOrderedEncoder(TomlEncoder):
+
+    def __init__(self):
+        super(self.__class__, self).__init__(_dict=OrderedDict)
diff --git a/venv/Lib/site-packages/pip/_vendor/toml/tz.py b/venv/Lib/site-packages/pip/_vendor/toml/tz.py
new file mode 100644
index 000000000..93c3c8ad2
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/toml/tz.py
@@ -0,0 +1,21 @@
+from datetime import tzinfo, timedelta
+
+
+class TomlTz(tzinfo):
+    def __init__(self, toml_offset):
+        if toml_offset == "Z":
+            self._raw_offset = "+00:00"
+        else:
+            self._raw_offset = toml_offset
+        self._sign = -1 if self._raw_offset[0] == '-' else 1
+        self._hours = int(self._raw_offset[1:3])
+        self._minutes = int(self._raw_offset[4:6])
+
+    def tzname(self, dt):
+        return "UTC" + self._raw_offset
+
+    def utcoffset(self, dt):
+        return self._sign * timedelta(hours=self._hours, minutes=self._minutes)
+
+    def dst(self, dt):
+        return timedelta(0)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/__init__.py
new file mode 100644
index 000000000..667e9bce9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/__init__.py
@@ -0,0 +1,86 @@
+"""
+urllib3 - Thread-safe connection pooling and re-using.
+"""
+from __future__ import absolute_import
+import warnings
+
+from .connectionpool import HTTPConnectionPool, HTTPSConnectionPool, connection_from_url
+
+from . import exceptions
+from .filepost import encode_multipart_formdata
+from .poolmanager import PoolManager, ProxyManager, proxy_from_url
+from .response import HTTPResponse
+from .util.request import make_headers
+from .util.url import get_host
+from .util.timeout import Timeout
+from .util.retry import Retry
+
+
+# Set default logging handler to avoid "No handler found" warnings.
+import logging
+from logging import NullHandler
+
+__author__ = "Andrey Petrov (andrey.petrov@shazow.net)"
+__license__ = "MIT"
+__version__ = "1.25.9"
+
+__all__ = (
+    "HTTPConnectionPool",
+    "HTTPSConnectionPool",
+    "PoolManager",
+    "ProxyManager",
+    "HTTPResponse",
+    "Retry",
+    "Timeout",
+    "add_stderr_logger",
+    "connection_from_url",
+    "disable_warnings",
+    "encode_multipart_formdata",
+    "get_host",
+    "make_headers",
+    "proxy_from_url",
+)
+
+logging.getLogger(__name__).addHandler(NullHandler())
+
+
+def add_stderr_logger(level=logging.DEBUG):
+    """
+    Helper for quickly adding a StreamHandler to the logger. Useful for
+    debugging.
+
+    Returns the handler after adding it.
+    """
+    # This method needs to be in this __init__.py to get the __name__ correct
+    # even if urllib3 is vendored within another package.
+    logger = logging.getLogger(__name__)
+    handler = logging.StreamHandler()
+    handler.setFormatter(logging.Formatter("%(asctime)s %(levelname)s %(message)s"))
+    logger.addHandler(handler)
+    logger.setLevel(level)
+    logger.debug("Added a stderr logging handler to logger: %s", __name__)
+    return handler
+
+
+# ... Clean up.
+del NullHandler
+
+
+# All warning filters *must* be appended unless you're really certain that they
+# shouldn't be: otherwise, it's very hard for users to use most Python
+# mechanisms to silence them.
+# SecurityWarning's always go off by default.
+warnings.simplefilter("always", exceptions.SecurityWarning, append=True)
+# SubjectAltNameWarning's should go off once per host
+warnings.simplefilter("default", exceptions.SubjectAltNameWarning, append=True)
+# InsecurePlatformWarning's don't vary between requests, so we keep it default.
+warnings.simplefilter("default", exceptions.InsecurePlatformWarning, append=True)
+# SNIMissingWarnings should go off only once.
+warnings.simplefilter("default", exceptions.SNIMissingWarning, append=True)
+
+
+def disable_warnings(category=exceptions.HTTPWarning):
+    """
+    Helper for quickly disabling all urllib3 warnings.
+    """
+    warnings.simplefilter("ignore", category)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..e31a6b00f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc
new file mode 100644
index 000000000..39102c519
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/_collections.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc
new file mode 100644
index 000000000..5a066dc86
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connection.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc
new file mode 100644
index 000000000..b90cf2f7d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/connectionpool.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc
new file mode 100644
index 000000000..a16f0903f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/exceptions.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc
new file mode 100644
index 000000000..8cf11375c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/fields.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc
new file mode 100644
index 000000000..4f44ef4cc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/filepost.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc
new file mode 100644
index 000000000..3af55d3fc
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/poolmanager.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc
new file mode 100644
index 000000000..21e965147
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/request.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc
new file mode 100644
index 000000000..ff898542e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/__pycache__/response.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/_collections.py b/venv/Lib/site-packages/pip/_vendor/urllib3/_collections.py
new file mode 100644
index 000000000..019d1511d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/_collections.py
@@ -0,0 +1,336 @@
+from __future__ import absolute_import
+
+try:
+    from collections.abc import Mapping, MutableMapping
+except ImportError:
+    from collections import Mapping, MutableMapping
+try:
+    from threading import RLock
+except ImportError:  # Platform-specific: No threads available
+
+    class RLock:
+        def __enter__(self):
+            pass
+
+        def __exit__(self, exc_type, exc_value, traceback):
+            pass
+
+
+from collections import OrderedDict
+from .exceptions import InvalidHeader
+from .packages.six import iterkeys, itervalues, PY3
+
+
+__all__ = ["RecentlyUsedContainer", "HTTPHeaderDict"]
+
+
+_Null = object()
+
+
+class RecentlyUsedContainer(MutableMapping):
+    """
+    Provides a thread-safe dict-like container which maintains up to
+    ``maxsize`` keys while throwing away the least-recently-used keys beyond
+    ``maxsize``.
+
+    :param maxsize:
+        Maximum number of recent elements to retain.
+
+    :param dispose_func:
+        Every time an item is evicted from the container,
+        ``dispose_func(value)`` is called.  Callback which will get called
+    """
+
+    ContainerCls = OrderedDict
+
+    def __init__(self, maxsize=10, dispose_func=None):
+        self._maxsize = maxsize
+        self.dispose_func = dispose_func
+
+        self._container = self.ContainerCls()
+        self.lock = RLock()
+
+    def __getitem__(self, key):
+        # Re-insert the item, moving it to the end of the eviction line.
+        with self.lock:
+            item = self._container.pop(key)
+            self._container[key] = item
+            return item
+
+    def __setitem__(self, key, value):
+        evicted_value = _Null
+        with self.lock:
+            # Possibly evict the existing value of 'key'
+            evicted_value = self._container.get(key, _Null)
+            self._container[key] = value
+
+            # If we didn't evict an existing value, we might have to evict the
+            # least recently used item from the beginning of the container.
+            if len(self._container) > self._maxsize:
+                _key, evicted_value = self._container.popitem(last=False)
+
+        if self.dispose_func and evicted_value is not _Null:
+            self.dispose_func(evicted_value)
+
+    def __delitem__(self, key):
+        with self.lock:
+            value = self._container.pop(key)
+
+        if self.dispose_func:
+            self.dispose_func(value)
+
+    def __len__(self):
+        with self.lock:
+            return len(self._container)
+
+    def __iter__(self):
+        raise NotImplementedError(
+            "Iteration over this class is unlikely to be threadsafe."
+        )
+
+    def clear(self):
+        with self.lock:
+            # Copy pointers to all values, then wipe the mapping
+            values = list(itervalues(self._container))
+            self._container.clear()
+
+        if self.dispose_func:
+            for value in values:
+                self.dispose_func(value)
+
+    def keys(self):
+        with self.lock:
+            return list(iterkeys(self._container))
+
+
+class HTTPHeaderDict(MutableMapping):
+    """
+    :param headers:
+        An iterable of field-value pairs. Must not contain multiple field names
+        when compared case-insensitively.
+
+    :param kwargs:
+        Additional field-value pairs to pass in to ``dict.update``.
+
+    A ``dict`` like container for storing HTTP Headers.
+
+    Field names are stored and compared case-insensitively in compliance with
+    RFC 7230. Iteration provides the first case-sensitive key seen for each
+    case-insensitive pair.
+
+    Using ``__setitem__`` syntax overwrites fields that compare equal
+    case-insensitively in order to maintain ``dict``'s api. For fields that
+    compare equal, instead create a new ``HTTPHeaderDict`` and use ``.add``
+    in a loop.
+
+    If multiple fields that are equal case-insensitively are passed to the
+    constructor or ``.update``, the behavior is undefined and some will be
+    lost.
+
+    >>> headers = HTTPHeaderDict()
+    >>> headers.add('Set-Cookie', 'foo=bar')
+    >>> headers.add('set-cookie', 'baz=quxx')
+    >>> headers['content-length'] = '7'
+    >>> headers['SET-cookie']
+    'foo=bar, baz=quxx'
+    >>> headers['Content-Length']
+    '7'
+    """
+
+    def __init__(self, headers=None, **kwargs):
+        super(HTTPHeaderDict, self).__init__()
+        self._container = OrderedDict()
+        if headers is not None:
+            if isinstance(headers, HTTPHeaderDict):
+                self._copy_from(headers)
+            else:
+                self.extend(headers)
+        if kwargs:
+            self.extend(kwargs)
+
+    def __setitem__(self, key, val):
+        self._container[key.lower()] = [key, val]
+        return self._container[key.lower()]
+
+    def __getitem__(self, key):
+        val = self._container[key.lower()]
+        return ", ".join(val[1:])
+
+    def __delitem__(self, key):
+        del self._container[key.lower()]
+
+    def __contains__(self, key):
+        return key.lower() in self._container
+
+    def __eq__(self, other):
+        if not isinstance(other, Mapping) and not hasattr(other, "keys"):
+            return False
+        if not isinstance(other, type(self)):
+            other = type(self)(other)
+        return dict((k.lower(), v) for k, v in self.itermerged()) == dict(
+            (k.lower(), v) for k, v in other.itermerged()
+        )
+
+    def __ne__(self, other):
+        return not self.__eq__(other)
+
+    if not PY3:  # Python 2
+        iterkeys = MutableMapping.iterkeys
+        itervalues = MutableMapping.itervalues
+
+    __marker = object()
+
+    def __len__(self):
+        return len(self._container)
+
+    def __iter__(self):
+        # Only provide the originally cased names
+        for vals in self._container.values():
+            yield vals[0]
+
+    def pop(self, key, default=__marker):
+        """D.pop(k[,d]) -> v, remove specified key and return the corresponding value.
+          If key is not found, d is returned if given, otherwise KeyError is raised.
+        """
+        # Using the MutableMapping function directly fails due to the private marker.
+        # Using ordinary dict.pop would expose the internal structures.
+        # So let's reinvent the wheel.
+        try:
+            value = self[key]
+        except KeyError:
+            if default is self.__marker:
+                raise
+            return default
+        else:
+            del self[key]
+            return value
+
+    def discard(self, key):
+        try:
+            del self[key]
+        except KeyError:
+            pass
+
+    def add(self, key, val):
+        """Adds a (name, value) pair, doesn't overwrite the value if it already
+        exists.
+
+        >>> headers = HTTPHeaderDict(foo='bar')
+        >>> headers.add('Foo', 'baz')
+        >>> headers['foo']
+        'bar, baz'
+        """
+        key_lower = key.lower()
+        new_vals = [key, val]
+        # Keep the common case aka no item present as fast as possible
+        vals = self._container.setdefault(key_lower, new_vals)
+        if new_vals is not vals:
+            vals.append(val)
+
+    def extend(self, *args, **kwargs):
+        """Generic import function for any type of header-like object.
+        Adapted version of MutableMapping.update in order to insert items
+        with self.add instead of self.__setitem__
+        """
+        if len(args) > 1:
+            raise TypeError(
+                "extend() takes at most 1 positional "
+                "arguments ({0} given)".format(len(args))
+            )
+        other = args[0] if len(args) >= 1 else ()
+
+        if isinstance(other, HTTPHeaderDict):
+            for key, val in other.iteritems():
+                self.add(key, val)
+        elif isinstance(other, Mapping):
+            for key in other:
+                self.add(key, other[key])
+        elif hasattr(other, "keys"):
+            for key in other.keys():
+                self.add(key, other[key])
+        else:
+            for key, value in other:
+                self.add(key, value)
+
+        for key, value in kwargs.items():
+            self.add(key, value)
+
+    def getlist(self, key, default=__marker):
+        """Returns a list of all the values for the named field. Returns an
+        empty list if the key doesn't exist."""
+        try:
+            vals = self._container[key.lower()]
+        except KeyError:
+            if default is self.__marker:
+                return []
+            return default
+        else:
+            return vals[1:]
+
+    # Backwards compatibility for httplib
+    getheaders = getlist
+    getallmatchingheaders = getlist
+    iget = getlist
+
+    # Backwards compatibility for http.cookiejar
+    get_all = getlist
+
+    def __repr__(self):
+        return "%s(%s)" % (type(self).__name__, dict(self.itermerged()))
+
+    def _copy_from(self, other):
+        for key in other:
+            val = other.getlist(key)
+            if isinstance(val, list):
+                # Don't need to convert tuples
+                val = list(val)
+            self._container[key.lower()] = [key] + val
+
+    def copy(self):
+        clone = type(self)()
+        clone._copy_from(self)
+        return clone
+
+    def iteritems(self):
+        """Iterate over all header lines, including duplicate ones."""
+        for key in self:
+            vals = self._container[key.lower()]
+            for val in vals[1:]:
+                yield vals[0], val
+
+    def itermerged(self):
+        """Iterate over all headers, merging duplicate ones together."""
+        for key in self:
+            val = self._container[key.lower()]
+            yield val[0], ", ".join(val[1:])
+
+    def items(self):
+        return list(self.iteritems())
+
+    @classmethod
+    def from_httplib(cls, message):  # Python 2
+        """Read headers from a Python 2 httplib message object."""
+        # python2.7 does not expose a proper API for exporting multiheaders
+        # efficiently. This function re-reads raw lines from the message
+        # object and extracts the multiheaders properly.
+        obs_fold_continued_leaders = (" ", "\t")
+        headers = []
+
+        for line in message.headers:
+            if line.startswith(obs_fold_continued_leaders):
+                if not headers:
+                    # We received a header line that starts with OWS as described
+                    # in RFC-7230 S3.2.4. This indicates a multiline header, but
+                    # there exists no previous header to which we can attach it.
+                    raise InvalidHeader(
+                        "Header continuation with no previous header: %s" % line
+                    )
+                else:
+                    key, value = headers[-1]
+                    headers[-1] = (key, value + " " + line.strip())
+                    continue
+
+            key, value = line.split(":", 1)
+            headers.append((key, value.strip()))
+
+        return cls(headers)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/connection.py b/venv/Lib/site-packages/pip/_vendor/urllib3/connection.py
new file mode 100644
index 000000000..6da1cf4b6
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/connection.py
@@ -0,0 +1,423 @@
+from __future__ import absolute_import
+import re
+import datetime
+import logging
+import os
+import socket
+from socket import error as SocketError, timeout as SocketTimeout
+import warnings
+from .packages import six
+from .packages.six.moves.http_client import HTTPConnection as _HTTPConnection
+from .packages.six.moves.http_client import HTTPException  # noqa: F401
+
+try:  # Compiled with SSL?
+    import ssl
+
+    BaseSSLError = ssl.SSLError
+except (ImportError, AttributeError):  # Platform-specific: No SSL.
+    ssl = None
+
+    class BaseSSLError(BaseException):
+        pass
+
+
+try:
+    # Python 3: not a no-op, we're adding this to the namespace so it can be imported.
+    ConnectionError = ConnectionError
+except NameError:
+    # Python 2
+    class ConnectionError(Exception):
+        pass
+
+
+from .exceptions import (
+    NewConnectionError,
+    ConnectTimeoutError,
+    SubjectAltNameWarning,
+    SystemTimeWarning,
+)
+from .packages.ssl_match_hostname import match_hostname, CertificateError
+
+from .util.ssl_ import (
+    resolve_cert_reqs,
+    resolve_ssl_version,
+    assert_fingerprint,
+    create_urllib3_context,
+    ssl_wrap_socket,
+)
+
+
+from .util import connection
+
+from ._collections import HTTPHeaderDict
+
+log = logging.getLogger(__name__)
+
+port_by_scheme = {"http": 80, "https": 443}
+
+# When it comes time to update this value as a part of regular maintenance
+# (ie test_recent_date is failing) update it to ~6 months before the current date.
+RECENT_DATE = datetime.date(2019, 1, 1)
+
+_CONTAINS_CONTROL_CHAR_RE = re.compile(r"[^-!#$%&'*+.^_`|~0-9a-zA-Z]")
+
+
+class DummyConnection(object):
+    """Used to detect a failed ConnectionCls import."""
+
+    pass
+
+
+class HTTPConnection(_HTTPConnection, object):
+    """
+    Based on httplib.HTTPConnection but provides an extra constructor
+    backwards-compatibility layer between older and newer Pythons.
+
+    Additional keyword parameters are used to configure attributes of the connection.
+    Accepted parameters include:
+
+      - ``strict``: See the documentation on :class:`urllib3.connectionpool.HTTPConnectionPool`
+      - ``source_address``: Set the source address for the current connection.
+      - ``socket_options``: Set specific options on the underlying socket. If not specified, then
+        defaults are loaded from ``HTTPConnection.default_socket_options`` which includes disabling
+        Nagle's algorithm (sets TCP_NODELAY to 1) unless the connection is behind a proxy.
+
+        For example, if you wish to enable TCP Keep Alive in addition to the defaults,
+        you might pass::
+
+            HTTPConnection.default_socket_options + [
+                (socket.SOL_SOCKET, socket.SO_KEEPALIVE, 1),
+            ]
+
+        Or you may want to disable the defaults by passing an empty list (e.g., ``[]``).
+    """
+
+    default_port = port_by_scheme["http"]
+
+    #: Disable Nagle's algorithm by default.
+    #: ``[(socket.IPPROTO_TCP, socket.TCP_NODELAY, 1)]``
+    default_socket_options = [(socket.IPPROTO_TCP, socket.TCP_NODELAY, 1)]
+
+    #: Whether this connection verifies the host's certificate.
+    is_verified = False
+
+    def __init__(self, *args, **kw):
+        if not six.PY2:
+            kw.pop("strict", None)
+
+        # Pre-set source_address.
+        self.source_address = kw.get("source_address")
+
+        #: The socket options provided by the user. If no options are
+        #: provided, we use the default options.
+        self.socket_options = kw.pop("socket_options", self.default_socket_options)
+
+        _HTTPConnection.__init__(self, *args, **kw)
+
+    @property
+    def host(self):
+        """
+        Getter method to remove any trailing dots that indicate the hostname is an FQDN.
+
+        In general, SSL certificates don't include the trailing dot indicating a
+        fully-qualified domain name, and thus, they don't validate properly when
+        checked against a domain name that includes the dot. In addition, some
+        servers may not expect to receive the trailing dot when provided.
+
+        However, the hostname with trailing dot is critical to DNS resolution; doing a
+        lookup with the trailing dot will properly only resolve the appropriate FQDN,
+        whereas a lookup without a trailing dot will search the system's search domain
+        list. Thus, it's important to keep the original host around for use only in
+        those cases where it's appropriate (i.e., when doing DNS lookup to establish the
+        actual TCP connection across which we're going to send HTTP requests).
+        """
+        return self._dns_host.rstrip(".")
+
+    @host.setter
+    def host(self, value):
+        """
+        Setter for the `host` property.
+
+        We assume that only urllib3 uses the _dns_host attribute; httplib itself
+        only uses `host`, and it seems reasonable that other libraries follow suit.
+        """
+        self._dns_host = value
+
+    def _new_conn(self):
+        """ Establish a socket connection and set nodelay settings on it.
+
+        :return: New socket connection.
+        """
+        extra_kw = {}
+        if self.source_address:
+            extra_kw["source_address"] = self.source_address
+
+        if self.socket_options:
+            extra_kw["socket_options"] = self.socket_options
+
+        try:
+            conn = connection.create_connection(
+                (self._dns_host, self.port), self.timeout, **extra_kw
+            )
+
+        except SocketTimeout:
+            raise ConnectTimeoutError(
+                self,
+                "Connection to %s timed out. (connect timeout=%s)"
+                % (self.host, self.timeout),
+            )
+
+        except SocketError as e:
+            raise NewConnectionError(
+                self, "Failed to establish a new connection: %s" % e
+            )
+
+        return conn
+
+    def _prepare_conn(self, conn):
+        self.sock = conn
+        # Google App Engine's httplib does not define _tunnel_host
+        if getattr(self, "_tunnel_host", None):
+            # TODO: Fix tunnel so it doesn't depend on self.sock state.
+            self._tunnel()
+            # Mark this connection as not reusable
+            self.auto_open = 0
+
+    def connect(self):
+        conn = self._new_conn()
+        self._prepare_conn(conn)
+
+    def putrequest(self, method, url, *args, **kwargs):
+        """Send a request to the server"""
+        match = _CONTAINS_CONTROL_CHAR_RE.search(method)
+        if match:
+            raise ValueError(
+                "Method cannot contain non-token characters %r (found at least %r)"
+                % (method, match.group())
+            )
+
+        return _HTTPConnection.putrequest(self, method, url, *args, **kwargs)
+
+    def request_chunked(self, method, url, body=None, headers=None):
+        """
+        Alternative to the common request method, which sends the
+        body with chunked encoding and not as one block
+        """
+        headers = HTTPHeaderDict(headers if headers is not None else {})
+        skip_accept_encoding = "accept-encoding" in headers
+        skip_host = "host" in headers
+        self.putrequest(
+            method, url, skip_accept_encoding=skip_accept_encoding, skip_host=skip_host
+        )
+        for header, value in headers.items():
+            self.putheader(header, value)
+        if "transfer-encoding" not in headers:
+            self.putheader("Transfer-Encoding", "chunked")
+        self.endheaders()
+
+        if body is not None:
+            stringish_types = six.string_types + (bytes,)
+            if isinstance(body, stringish_types):
+                body = (body,)
+            for chunk in body:
+                if not chunk:
+                    continue
+                if not isinstance(chunk, bytes):
+                    chunk = chunk.encode("utf8")
+                len_str = hex(len(chunk))[2:]
+                self.send(len_str.encode("utf-8"))
+                self.send(b"\r\n")
+                self.send(chunk)
+                self.send(b"\r\n")
+
+        # After the if clause, to always have a closed body
+        self.send(b"0\r\n\r\n")
+
+
+class HTTPSConnection(HTTPConnection):
+    default_port = port_by_scheme["https"]
+
+    cert_reqs = None
+    ca_certs = None
+    ca_cert_dir = None
+    ca_cert_data = None
+    ssl_version = None
+    assert_fingerprint = None
+
+    def __init__(
+        self,
+        host,
+        port=None,
+        key_file=None,
+        cert_file=None,
+        key_password=None,
+        strict=None,
+        timeout=socket._GLOBAL_DEFAULT_TIMEOUT,
+        ssl_context=None,
+        server_hostname=None,
+        **kw
+    ):
+
+        HTTPConnection.__init__(self, host, port, strict=strict, timeout=timeout, **kw)
+
+        self.key_file = key_file
+        self.cert_file = cert_file
+        self.key_password = key_password
+        self.ssl_context = ssl_context
+        self.server_hostname = server_hostname
+
+        # Required property for Google AppEngine 1.9.0 which otherwise causes
+        # HTTPS requests to go out as HTTP. (See Issue #356)
+        self._protocol = "https"
+
+    def set_cert(
+        self,
+        key_file=None,
+        cert_file=None,
+        cert_reqs=None,
+        key_password=None,
+        ca_certs=None,
+        assert_hostname=None,
+        assert_fingerprint=None,
+        ca_cert_dir=None,
+        ca_cert_data=None,
+    ):
+        """
+        This method should only be called once, before the connection is used.
+        """
+        # If cert_reqs is not provided we'll assume CERT_REQUIRED unless we also
+        # have an SSLContext object in which case we'll use its verify_mode.
+        if cert_reqs is None:
+            if self.ssl_context is not None:
+                cert_reqs = self.ssl_context.verify_mode
+            else:
+                cert_reqs = resolve_cert_reqs(None)
+
+        self.key_file = key_file
+        self.cert_file = cert_file
+        self.cert_reqs = cert_reqs
+        self.key_password = key_password
+        self.assert_hostname = assert_hostname
+        self.assert_fingerprint = assert_fingerprint
+        self.ca_certs = ca_certs and os.path.expanduser(ca_certs)
+        self.ca_cert_dir = ca_cert_dir and os.path.expanduser(ca_cert_dir)
+        self.ca_cert_data = ca_cert_data
+
+    def connect(self):
+        # Add certificate verification
+        conn = self._new_conn()
+        hostname = self.host
+
+        # Google App Engine's httplib does not define _tunnel_host
+        if getattr(self, "_tunnel_host", None):
+            self.sock = conn
+            # Calls self._set_hostport(), so self.host is
+            # self._tunnel_host below.
+            self._tunnel()
+            # Mark this connection as not reusable
+            self.auto_open = 0
+
+            # Override the host with the one we're requesting data from.
+            hostname = self._tunnel_host
+
+        server_hostname = hostname
+        if self.server_hostname is not None:
+            server_hostname = self.server_hostname
+
+        is_time_off = datetime.date.today() < RECENT_DATE
+        if is_time_off:
+            warnings.warn(
+                (
+                    "System time is way off (before {0}). This will probably "
+                    "lead to SSL verification errors"
+                ).format(RECENT_DATE),
+                SystemTimeWarning,
+            )
+
+        # Wrap socket using verification with the root certs in
+        # trusted_root_certs
+        default_ssl_context = False
+        if self.ssl_context is None:
+            default_ssl_context = True
+            self.ssl_context = create_urllib3_context(
+                ssl_version=resolve_ssl_version(self.ssl_version),
+                cert_reqs=resolve_cert_reqs(self.cert_reqs),
+            )
+
+        context = self.ssl_context
+        context.verify_mode = resolve_cert_reqs(self.cert_reqs)
+
+        # Try to load OS default certs if none are given.
+        # Works well on Windows (requires Python3.4+)
+        if (
+            not self.ca_certs
+            and not self.ca_cert_dir
+            and not self.ca_cert_data
+            and default_ssl_context
+            and hasattr(context, "load_default_certs")
+        ):
+            context.load_default_certs()
+
+        self.sock = ssl_wrap_socket(
+            sock=conn,
+            keyfile=self.key_file,
+            certfile=self.cert_file,
+            key_password=self.key_password,
+            ca_certs=self.ca_certs,
+            ca_cert_dir=self.ca_cert_dir,
+            ca_cert_data=self.ca_cert_data,
+            server_hostname=server_hostname,
+            ssl_context=context,
+        )
+
+        if self.assert_fingerprint:
+            assert_fingerprint(
+                self.sock.getpeercert(binary_form=True), self.assert_fingerprint
+            )
+        elif (
+            context.verify_mode != ssl.CERT_NONE
+            and not getattr(context, "check_hostname", False)
+            and self.assert_hostname is not False
+        ):
+            # While urllib3 attempts to always turn off hostname matching from
+            # the TLS library, this cannot always be done. So we check whether
+            # the TLS Library still thinks it's matching hostnames.
+            cert = self.sock.getpeercert()
+            if not cert.get("subjectAltName", ()):
+                warnings.warn(
+                    (
+                        "Certificate for {0} has no `subjectAltName`, falling back to check for a "
+                        "`commonName` for now. This feature is being removed by major browsers and "
+                        "deprecated by RFC 2818. (See https://github.com/urllib3/urllib3/issues/497 "
+                        "for details.)".format(hostname)
+                    ),
+                    SubjectAltNameWarning,
+                )
+            _match_hostname(cert, self.assert_hostname or server_hostname)
+
+        self.is_verified = (
+            context.verify_mode == ssl.CERT_REQUIRED
+            or self.assert_fingerprint is not None
+        )
+
+
+def _match_hostname(cert, asserted_hostname):
+    try:
+        match_hostname(cert, asserted_hostname)
+    except CertificateError as e:
+        log.warning(
+            "Certificate did not match expected hostname: %s. Certificate: %s",
+            asserted_hostname,
+            cert,
+        )
+        # Add cert to exception and reraise so client code can inspect
+        # the cert when catching the exception, if they want to
+        e._peer_cert = cert
+        raise
+
+
+if not ssl:
+    HTTPSConnection = DummyConnection  # noqa: F811
+
+
+VerifiedHTTPSConnection = HTTPSConnection
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/connectionpool.py b/venv/Lib/site-packages/pip/_vendor/urllib3/connectionpool.py
new file mode 100644
index 000000000..5f044dbd9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/connectionpool.py
@@ -0,0 +1,1033 @@
+from __future__ import absolute_import
+import errno
+import logging
+import sys
+import warnings
+
+from socket import error as SocketError, timeout as SocketTimeout
+import socket
+
+
+from .exceptions import (
+    ClosedPoolError,
+    ProtocolError,
+    EmptyPoolError,
+    HeaderParsingError,
+    HostChangedError,
+    LocationValueError,
+    MaxRetryError,
+    ProxyError,
+    ReadTimeoutError,
+    SSLError,
+    TimeoutError,
+    InsecureRequestWarning,
+    NewConnectionError,
+)
+from .packages.ssl_match_hostname import CertificateError
+from .packages import six
+from .packages.six.moves import queue
+from .connection import (
+    port_by_scheme,
+    DummyConnection,
+    HTTPConnection,
+    HTTPSConnection,
+    VerifiedHTTPSConnection,
+    HTTPException,
+    BaseSSLError,
+)
+from .request import RequestMethods
+from .response import HTTPResponse
+
+from .util.connection import is_connection_dropped
+from .util.request import set_file_position
+from .util.response import assert_header_parsing
+from .util.retry import Retry
+from .util.timeout import Timeout
+from .util.url import (
+    get_host,
+    parse_url,
+    Url,
+    _normalize_host as normalize_host,
+    _encode_target,
+)
+from .util.queue import LifoQueue
+
+
+xrange = six.moves.xrange
+
+log = logging.getLogger(__name__)
+
+_Default = object()
+
+
+# Pool objects
+class ConnectionPool(object):
+    """
+    Base class for all connection pools, such as
+    :class:`.HTTPConnectionPool` and :class:`.HTTPSConnectionPool`.
+
+    .. note::
+       ConnectionPool.urlopen() does not normalize or percent-encode target URIs
+       which is useful if your target server doesn't support percent-encoded
+       target URIs.
+    """
+
+    scheme = None
+    QueueCls = LifoQueue
+
+    def __init__(self, host, port=None):
+        if not host:
+            raise LocationValueError("No host specified.")
+
+        self.host = _normalize_host(host, scheme=self.scheme)
+        self._proxy_host = host.lower()
+        self.port = port
+
+    def __str__(self):
+        return "%s(host=%r, port=%r)" % (type(self).__name__, self.host, self.port)
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        self.close()
+        # Return False to re-raise any potential exceptions
+        return False
+
+    def close(self):
+        """
+        Close all pooled connections and disable the pool.
+        """
+        pass
+
+
+# This is taken from http://hg.python.org/cpython/file/7aaba721ebc0/Lib/socket.py#l252
+_blocking_errnos = {errno.EAGAIN, errno.EWOULDBLOCK}
+
+
+class HTTPConnectionPool(ConnectionPool, RequestMethods):
+    """
+    Thread-safe connection pool for one host.
+
+    :param host:
+        Host used for this HTTP Connection (e.g. "localhost"), passed into
+        :class:`httplib.HTTPConnection`.
+
+    :param port:
+        Port used for this HTTP Connection (None is equivalent to 80), passed
+        into :class:`httplib.HTTPConnection`.
+
+    :param strict:
+        Causes BadStatusLine to be raised if the status line can't be parsed
+        as a valid HTTP/1.0 or 1.1 status line, passed into
+        :class:`httplib.HTTPConnection`.
+
+        .. note::
+           Only works in Python 2. This parameter is ignored in Python 3.
+
+    :param timeout:
+        Socket timeout in seconds for each individual connection. This can
+        be a float or integer, which sets the timeout for the HTTP request,
+        or an instance of :class:`urllib3.util.Timeout` which gives you more
+        fine-grained control over request timeouts. After the constructor has
+        been parsed, this is always a `urllib3.util.Timeout` object.
+
+    :param maxsize:
+        Number of connections to save that can be reused. More than 1 is useful
+        in multithreaded situations. If ``block`` is set to False, more
+        connections will be created but they will not be saved once they've
+        been used.
+
+    :param block:
+        If set to True, no more than ``maxsize`` connections will be used at
+        a time. When no free connections are available, the call will block
+        until a connection has been released. This is a useful side effect for
+        particular multithreaded situations where one does not want to use more
+        than maxsize connections per host to prevent flooding.
+
+    :param headers:
+        Headers to include with all requests, unless other headers are given
+        explicitly.
+
+    :param retries:
+        Retry configuration to use by default with requests in this pool.
+
+    :param _proxy:
+        Parsed proxy URL, should not be used directly, instead, see
+        :class:`urllib3.connectionpool.ProxyManager`"
+
+    :param _proxy_headers:
+        A dictionary with proxy headers, should not be used directly,
+        instead, see :class:`urllib3.connectionpool.ProxyManager`"
+
+    :param \\**conn_kw:
+        Additional parameters are used to create fresh :class:`urllib3.connection.HTTPConnection`,
+        :class:`urllib3.connection.HTTPSConnection` instances.
+    """
+
+    scheme = "http"
+    ConnectionCls = HTTPConnection
+    ResponseCls = HTTPResponse
+
+    def __init__(
+        self,
+        host,
+        port=None,
+        strict=False,
+        timeout=Timeout.DEFAULT_TIMEOUT,
+        maxsize=1,
+        block=False,
+        headers=None,
+        retries=None,
+        _proxy=None,
+        _proxy_headers=None,
+        **conn_kw
+    ):
+        ConnectionPool.__init__(self, host, port)
+        RequestMethods.__init__(self, headers)
+
+        self.strict = strict
+
+        if not isinstance(timeout, Timeout):
+            timeout = Timeout.from_float(timeout)
+
+        if retries is None:
+            retries = Retry.DEFAULT
+
+        self.timeout = timeout
+        self.retries = retries
+
+        self.pool = self.QueueCls(maxsize)
+        self.block = block
+
+        self.proxy = _proxy
+        self.proxy_headers = _proxy_headers or {}
+
+        # Fill the queue up so that doing get() on it will block properly
+        for _ in xrange(maxsize):
+            self.pool.put(None)
+
+        # These are mostly for testing and debugging purposes.
+        self.num_connections = 0
+        self.num_requests = 0
+        self.conn_kw = conn_kw
+
+        if self.proxy:
+            # Enable Nagle's algorithm for proxies, to avoid packet fragmentation.
+            # We cannot know if the user has added default socket options, so we cannot replace the
+            # list.
+            self.conn_kw.setdefault("socket_options", [])
+
+    def _new_conn(self):
+        """
+        Return a fresh :class:`HTTPConnection`.
+        """
+        self.num_connections += 1
+        log.debug(
+            "Starting new HTTP connection (%d): %s:%s",
+            self.num_connections,
+            self.host,
+            self.port or "80",
+        )
+
+        conn = self.ConnectionCls(
+            host=self.host,
+            port=self.port,
+            timeout=self.timeout.connect_timeout,
+            strict=self.strict,
+            **self.conn_kw
+        )
+        return conn
+
+    def _get_conn(self, timeout=None):
+        """
+        Get a connection. Will return a pooled connection if one is available.
+
+        If no connections are available and :prop:`.block` is ``False``, then a
+        fresh connection is returned.
+
+        :param timeout:
+            Seconds to wait before giving up and raising
+            :class:`urllib3.exceptions.EmptyPoolError` if the pool is empty and
+            :prop:`.block` is ``True``.
+        """
+        conn = None
+        try:
+            conn = self.pool.get(block=self.block, timeout=timeout)
+
+        except AttributeError:  # self.pool is None
+            raise ClosedPoolError(self, "Pool is closed.")
+
+        except queue.Empty:
+            if self.block:
+                raise EmptyPoolError(
+                    self,
+                    "Pool reached maximum size and no more connections are allowed.",
+                )
+            pass  # Oh well, we'll create a new connection then
+
+        # If this is a persistent connection, check if it got disconnected
+        if conn and is_connection_dropped(conn):
+            log.debug("Resetting dropped connection: %s", self.host)
+            conn.close()
+            if getattr(conn, "auto_open", 1) == 0:
+                # This is a proxied connection that has been mutated by
+                # httplib._tunnel() and cannot be reused (since it would
+                # attempt to bypass the proxy)
+                conn = None
+
+        return conn or self._new_conn()
+
+    def _put_conn(self, conn):
+        """
+        Put a connection back into the pool.
+
+        :param conn:
+            Connection object for the current host and port as returned by
+            :meth:`._new_conn` or :meth:`._get_conn`.
+
+        If the pool is already full, the connection is closed and discarded
+        because we exceeded maxsize. If connections are discarded frequently,
+        then maxsize should be increased.
+
+        If the pool is closed, then the connection will be closed and discarded.
+        """
+        try:
+            self.pool.put(conn, block=False)
+            return  # Everything is dandy, done.
+        except AttributeError:
+            # self.pool is None.
+            pass
+        except queue.Full:
+            # This should never happen if self.block == True
+            log.warning("Connection pool is full, discarding connection: %s", self.host)
+
+        # Connection never got put back into the pool, close it.
+        if conn:
+            conn.close()
+
+    def _validate_conn(self, conn):
+        """
+        Called right before a request is made, after the socket is created.
+        """
+        pass
+
+    def _prepare_proxy(self, conn):
+        # Nothing to do for HTTP connections.
+        pass
+
+    def _get_timeout(self, timeout):
+        """ Helper that always returns a :class:`urllib3.util.Timeout` """
+        if timeout is _Default:
+            return self.timeout.clone()
+
+        if isinstance(timeout, Timeout):
+            return timeout.clone()
+        else:
+            # User passed us an int/float. This is for backwards compatibility,
+            # can be removed later
+            return Timeout.from_float(timeout)
+
+    def _raise_timeout(self, err, url, timeout_value):
+        """Is the error actually a timeout? Will raise a ReadTimeout or pass"""
+
+        if isinstance(err, SocketTimeout):
+            raise ReadTimeoutError(
+                self, url, "Read timed out. (read timeout=%s)" % timeout_value
+            )
+
+        # See the above comment about EAGAIN in Python 3. In Python 2 we have
+        # to specifically catch it and throw the timeout error
+        if hasattr(err, "errno") and err.errno in _blocking_errnos:
+            raise ReadTimeoutError(
+                self, url, "Read timed out. (read timeout=%s)" % timeout_value
+            )
+
+        # Catch possible read timeouts thrown as SSL errors. If not the
+        # case, rethrow the original. We need to do this because of:
+        # http://bugs.python.org/issue10272
+        if "timed out" in str(err) or "did not complete (read)" in str(
+            err
+        ):  # Python < 2.7.4
+            raise ReadTimeoutError(
+                self, url, "Read timed out. (read timeout=%s)" % timeout_value
+            )
+
+    def _make_request(
+        self, conn, method, url, timeout=_Default, chunked=False, **httplib_request_kw
+    ):
+        """
+        Perform a request on a given urllib connection object taken from our
+        pool.
+
+        :param conn:
+            a connection from one of our connection pools
+
+        :param timeout:
+            Socket timeout in seconds for the request. This can be a
+            float or integer, which will set the same timeout value for
+            the socket connect and the socket read, or an instance of
+            :class:`urllib3.util.Timeout`, which gives you more fine-grained
+            control over your timeouts.
+        """
+        self.num_requests += 1
+
+        timeout_obj = self._get_timeout(timeout)
+        timeout_obj.start_connect()
+        conn.timeout = timeout_obj.connect_timeout
+
+        # Trigger any extra validation we need to do.
+        try:
+            self._validate_conn(conn)
+        except (SocketTimeout, BaseSSLError) as e:
+            # Py2 raises this as a BaseSSLError, Py3 raises it as socket timeout.
+            self._raise_timeout(err=e, url=url, timeout_value=conn.timeout)
+            raise
+
+        # conn.request() calls httplib.*.request, not the method in
+        # urllib3.request. It also calls makefile (recv) on the socket.
+        if chunked:
+            conn.request_chunked(method, url, **httplib_request_kw)
+        else:
+            conn.request(method, url, **httplib_request_kw)
+
+        # Reset the timeout for the recv() on the socket
+        read_timeout = timeout_obj.read_timeout
+
+        # App Engine doesn't have a sock attr
+        if getattr(conn, "sock", None):
+            # In Python 3 socket.py will catch EAGAIN and return None when you
+            # try and read into the file pointer created by http.client, which
+            # instead raises a BadStatusLine exception. Instead of catching
+            # the exception and assuming all BadStatusLine exceptions are read
+            # timeouts, check for a zero timeout before making the request.
+            if read_timeout == 0:
+                raise ReadTimeoutError(
+                    self, url, "Read timed out. (read timeout=%s)" % read_timeout
+                )
+            if read_timeout is Timeout.DEFAULT_TIMEOUT:
+                conn.sock.settimeout(socket.getdefaulttimeout())
+            else:  # None or a value
+                conn.sock.settimeout(read_timeout)
+
+        # Receive the response from the server
+        try:
+            try:
+                # Python 2.7, use buffering of HTTP responses
+                httplib_response = conn.getresponse(buffering=True)
+            except TypeError:
+                # Python 3
+                try:
+                    httplib_response = conn.getresponse()
+                except BaseException as e:
+                    # Remove the TypeError from the exception chain in
+                    # Python 3 (including for exceptions like SystemExit).
+                    # Otherwise it looks like a bug in the code.
+                    six.raise_from(e, None)
+        except (SocketTimeout, BaseSSLError, SocketError) as e:
+            self._raise_timeout(err=e, url=url, timeout_value=read_timeout)
+            raise
+
+        # AppEngine doesn't have a version attr.
+        http_version = getattr(conn, "_http_vsn_str", "HTTP/?")
+        log.debug(
+            '%s://%s:%s "%s %s %s" %s %s',
+            self.scheme,
+            self.host,
+            self.port,
+            method,
+            url,
+            http_version,
+            httplib_response.status,
+            httplib_response.length,
+        )
+
+        try:
+            assert_header_parsing(httplib_response.msg)
+        except (HeaderParsingError, TypeError) as hpe:  # Platform-specific: Python 3
+            log.warning(
+                "Failed to parse headers (url=%s): %s",
+                self._absolute_url(url),
+                hpe,
+                exc_info=True,
+            )
+
+        return httplib_response
+
+    def _absolute_url(self, path):
+        return Url(scheme=self.scheme, host=self.host, port=self.port, path=path).url
+
+    def close(self):
+        """
+        Close all pooled connections and disable the pool.
+        """
+        if self.pool is None:
+            return
+        # Disable access to the pool
+        old_pool, self.pool = self.pool, None
+
+        try:
+            while True:
+                conn = old_pool.get(block=False)
+                if conn:
+                    conn.close()
+
+        except queue.Empty:
+            pass  # Done.
+
+    def is_same_host(self, url):
+        """
+        Check if the given ``url`` is a member of the same host as this
+        connection pool.
+        """
+        if url.startswith("/"):
+            return True
+
+        # TODO: Add optional support for socket.gethostbyname checking.
+        scheme, host, port = get_host(url)
+        if host is not None:
+            host = _normalize_host(host, scheme=scheme)
+
+        # Use explicit default port for comparison when none is given
+        if self.port and not port:
+            port = port_by_scheme.get(scheme)
+        elif not self.port and port == port_by_scheme.get(scheme):
+            port = None
+
+        return (scheme, host, port) == (self.scheme, self.host, self.port)
+
+    def urlopen(
+        self,
+        method,
+        url,
+        body=None,
+        headers=None,
+        retries=None,
+        redirect=True,
+        assert_same_host=True,
+        timeout=_Default,
+        pool_timeout=None,
+        release_conn=None,
+        chunked=False,
+        body_pos=None,
+        **response_kw
+    ):
+        """
+        Get a connection from the pool and perform an HTTP request. This is the
+        lowest level call for making a request, so you'll need to specify all
+        the raw details.
+
+        .. note::
+
+           More commonly, it's appropriate to use a convenience method provided
+           by :class:`.RequestMethods`, such as :meth:`request`.
+
+        .. note::
+
+           `release_conn` will only behave as expected if
+           `preload_content=False` because we want to make
+           `preload_content=False` the default behaviour someday soon without
+           breaking backwards compatibility.
+
+        :param method:
+            HTTP request method (such as GET, POST, PUT, etc.)
+
+        :param body:
+            Data to send in the request body (useful for creating
+            POST requests, see HTTPConnectionPool.post_url for
+            more convenience).
+
+        :param headers:
+            Dictionary of custom headers to send, such as User-Agent,
+            If-None-Match, etc. If None, pool headers are used. If provided,
+            these headers completely replace any pool-specific headers.
+
+        :param retries:
+            Configure the number of retries to allow before raising a
+            :class:`~urllib3.exceptions.MaxRetryError` exception.
+
+            Pass ``None`` to retry until you receive a response. Pass a
+            :class:`~urllib3.util.retry.Retry` object for fine-grained control
+            over different types of retries.
+            Pass an integer number to retry connection errors that many times,
+            but no other types of errors. Pass zero to never retry.
+
+            If ``False``, then retries are disabled and any exception is raised
+            immediately. Also, instead of raising a MaxRetryError on redirects,
+            the redirect response will be returned.
+
+        :type retries: :class:`~urllib3.util.retry.Retry`, False, or an int.
+
+        :param redirect:
+            If True, automatically handle redirects (status codes 301, 302,
+            303, 307, 308). Each redirect counts as a retry. Disabling retries
+            will disable redirect, too.
+
+        :param assert_same_host:
+            If ``True``, will make sure that the host of the pool requests is
+            consistent else will raise HostChangedError. When False, you can
+            use the pool on an HTTP proxy and request foreign hosts.
+
+        :param timeout:
+            If specified, overrides the default timeout for this one
+            request. It may be a float (in seconds) or an instance of
+            :class:`urllib3.util.Timeout`.
+
+        :param pool_timeout:
+            If set and the pool is set to block=True, then this method will
+            block for ``pool_timeout`` seconds and raise EmptyPoolError if no
+            connection is available within the time period.
+
+        :param release_conn:
+            If False, then the urlopen call will not release the connection
+            back into the pool once a response is received (but will release if
+            you read the entire contents of the response such as when
+            `preload_content=True`). This is useful if you're not preloading
+            the response's content immediately. You will need to call
+            ``r.release_conn()`` on the response ``r`` to return the connection
+            back into the pool. If None, it takes the value of
+            ``response_kw.get('preload_content', True)``.
+
+        :param chunked:
+            If True, urllib3 will send the body using chunked transfer
+            encoding. Otherwise, urllib3 will send the body using the standard
+            content-length form. Defaults to False.
+
+        :param int body_pos:
+            Position to seek to in file-like body in the event of a retry or
+            redirect. Typically this won't need to be set because urllib3 will
+            auto-populate the value when needed.
+
+        :param \\**response_kw:
+            Additional parameters are passed to
+            :meth:`urllib3.response.HTTPResponse.from_httplib`
+        """
+        if headers is None:
+            headers = self.headers
+
+        if not isinstance(retries, Retry):
+            retries = Retry.from_int(retries, redirect=redirect, default=self.retries)
+
+        if release_conn is None:
+            release_conn = response_kw.get("preload_content", True)
+
+        # Check host
+        if assert_same_host and not self.is_same_host(url):
+            raise HostChangedError(self, url, retries)
+
+        # Ensure that the URL we're connecting to is properly encoded
+        if url.startswith("/"):
+            url = six.ensure_str(_encode_target(url))
+        else:
+            url = six.ensure_str(parse_url(url).url)
+
+        conn = None
+
+        # Track whether `conn` needs to be released before
+        # returning/raising/recursing. Update this variable if necessary, and
+        # leave `release_conn` constant throughout the function. That way, if
+        # the function recurses, the original value of `release_conn` will be
+        # passed down into the recursive call, and its value will be respected.
+        #
+        # See issue #651 [1] for details.
+        #
+        # [1] <https://github.com/urllib3/urllib3/issues/651>
+        release_this_conn = release_conn
+
+        # Merge the proxy headers. Only do this in HTTP. We have to copy the
+        # headers dict so we can safely change it without those changes being
+        # reflected in anyone else's copy.
+        if self.scheme == "http":
+            headers = headers.copy()
+            headers.update(self.proxy_headers)
+
+        # Must keep the exception bound to a separate variable or else Python 3
+        # complains about UnboundLocalError.
+        err = None
+
+        # Keep track of whether we cleanly exited the except block. This
+        # ensures we do proper cleanup in finally.
+        clean_exit = False
+
+        # Rewind body position, if needed. Record current position
+        # for future rewinds in the event of a redirect/retry.
+        body_pos = set_file_position(body, body_pos)
+
+        try:
+            # Request a connection from the queue.
+            timeout_obj = self._get_timeout(timeout)
+            conn = self._get_conn(timeout=pool_timeout)
+
+            conn.timeout = timeout_obj.connect_timeout
+
+            is_new_proxy_conn = self.proxy is not None and not getattr(
+                conn, "sock", None
+            )
+            if is_new_proxy_conn:
+                self._prepare_proxy(conn)
+
+            # Make the request on the httplib connection object.
+            httplib_response = self._make_request(
+                conn,
+                method,
+                url,
+                timeout=timeout_obj,
+                body=body,
+                headers=headers,
+                chunked=chunked,
+            )
+
+            # If we're going to release the connection in ``finally:``, then
+            # the response doesn't need to know about the connection. Otherwise
+            # it will also try to release it and we'll have a double-release
+            # mess.
+            response_conn = conn if not release_conn else None
+
+            # Pass method to Response for length checking
+            response_kw["request_method"] = method
+
+            # Import httplib's response into our own wrapper object
+            response = self.ResponseCls.from_httplib(
+                httplib_response,
+                pool=self,
+                connection=response_conn,
+                retries=retries,
+                **response_kw
+            )
+
+            # Everything went great!
+            clean_exit = True
+
+        except queue.Empty:
+            # Timed out by queue.
+            raise EmptyPoolError(self, "No pool connections are available.")
+
+        except (
+            TimeoutError,
+            HTTPException,
+            SocketError,
+            ProtocolError,
+            BaseSSLError,
+            SSLError,
+            CertificateError,
+        ) as e:
+            # Discard the connection for these exceptions. It will be
+            # replaced during the next _get_conn() call.
+            clean_exit = False
+            if isinstance(e, (BaseSSLError, CertificateError)):
+                e = SSLError(e)
+            elif isinstance(e, (SocketError, NewConnectionError)) and self.proxy:
+                e = ProxyError("Cannot connect to proxy.", e)
+            elif isinstance(e, (SocketError, HTTPException)):
+                e = ProtocolError("Connection aborted.", e)
+
+            retries = retries.increment(
+                method, url, error=e, _pool=self, _stacktrace=sys.exc_info()[2]
+            )
+            retries.sleep()
+
+            # Keep track of the error for the retry warning.
+            err = e
+
+        finally:
+            if not clean_exit:
+                # We hit some kind of exception, handled or otherwise. We need
+                # to throw the connection away unless explicitly told not to.
+                # Close the connection, set the variable to None, and make sure
+                # we put the None back in the pool to avoid leaking it.
+                conn = conn and conn.close()
+                release_this_conn = True
+
+            if release_this_conn:
+                # Put the connection back to be reused. If the connection is
+                # expired then it will be None, which will get replaced with a
+                # fresh connection during _get_conn.
+                self._put_conn(conn)
+
+        if not conn:
+            # Try again
+            log.warning(
+                "Retrying (%r) after connection broken by '%r': %s", retries, err, url
+            )
+            return self.urlopen(
+                method,
+                url,
+                body,
+                headers,
+                retries,
+                redirect,
+                assert_same_host,
+                timeout=timeout,
+                pool_timeout=pool_timeout,
+                release_conn=release_conn,
+                chunked=chunked,
+                body_pos=body_pos,
+                **response_kw
+            )
+
+        # Handle redirect?
+        redirect_location = redirect and response.get_redirect_location()
+        if redirect_location:
+            if response.status == 303:
+                method = "GET"
+
+            try:
+                retries = retries.increment(method, url, response=response, _pool=self)
+            except MaxRetryError:
+                if retries.raise_on_redirect:
+                    response.drain_conn()
+                    raise
+                return response
+
+            response.drain_conn()
+            retries.sleep_for_retry(response)
+            log.debug("Redirecting %s -> %s", url, redirect_location)
+            return self.urlopen(
+                method,
+                redirect_location,
+                body,
+                headers,
+                retries=retries,
+                redirect=redirect,
+                assert_same_host=assert_same_host,
+                timeout=timeout,
+                pool_timeout=pool_timeout,
+                release_conn=release_conn,
+                chunked=chunked,
+                body_pos=body_pos,
+                **response_kw
+            )
+
+        # Check if we should retry the HTTP response.
+        has_retry_after = bool(response.getheader("Retry-After"))
+        if retries.is_retry(method, response.status, has_retry_after):
+            try:
+                retries = retries.increment(method, url, response=response, _pool=self)
+            except MaxRetryError:
+                if retries.raise_on_status:
+                    response.drain_conn()
+                    raise
+                return response
+
+            response.drain_conn()
+            retries.sleep(response)
+            log.debug("Retry: %s", url)
+            return self.urlopen(
+                method,
+                url,
+                body,
+                headers,
+                retries=retries,
+                redirect=redirect,
+                assert_same_host=assert_same_host,
+                timeout=timeout,
+                pool_timeout=pool_timeout,
+                release_conn=release_conn,
+                chunked=chunked,
+                body_pos=body_pos,
+                **response_kw
+            )
+
+        return response
+
+
+class HTTPSConnectionPool(HTTPConnectionPool):
+    """
+    Same as :class:`.HTTPConnectionPool`, but HTTPS.
+
+    When Python is compiled with the :mod:`ssl` module, then
+    :class:`.VerifiedHTTPSConnection` is used, which *can* verify certificates,
+    instead of :class:`.HTTPSConnection`.
+
+    :class:`.VerifiedHTTPSConnection` uses one of ``assert_fingerprint``,
+    ``assert_hostname`` and ``host`` in this order to verify connections.
+    If ``assert_hostname`` is False, no verification is done.
+
+    The ``key_file``, ``cert_file``, ``cert_reqs``, ``ca_certs``,
+    ``ca_cert_dir``, ``ssl_version``, ``key_password`` are only used if :mod:`ssl`
+    is available and are fed into :meth:`urllib3.util.ssl_wrap_socket` to upgrade
+    the connection socket into an SSL socket.
+    """
+
+    scheme = "https"
+    ConnectionCls = HTTPSConnection
+
+    def __init__(
+        self,
+        host,
+        port=None,
+        strict=False,
+        timeout=Timeout.DEFAULT_TIMEOUT,
+        maxsize=1,
+        block=False,
+        headers=None,
+        retries=None,
+        _proxy=None,
+        _proxy_headers=None,
+        key_file=None,
+        cert_file=None,
+        cert_reqs=None,
+        key_password=None,
+        ca_certs=None,
+        ssl_version=None,
+        assert_hostname=None,
+        assert_fingerprint=None,
+        ca_cert_dir=None,
+        **conn_kw
+    ):
+
+        HTTPConnectionPool.__init__(
+            self,
+            host,
+            port,
+            strict,
+            timeout,
+            maxsize,
+            block,
+            headers,
+            retries,
+            _proxy,
+            _proxy_headers,
+            **conn_kw
+        )
+
+        self.key_file = key_file
+        self.cert_file = cert_file
+        self.cert_reqs = cert_reqs
+        self.key_password = key_password
+        self.ca_certs = ca_certs
+        self.ca_cert_dir = ca_cert_dir
+        self.ssl_version = ssl_version
+        self.assert_hostname = assert_hostname
+        self.assert_fingerprint = assert_fingerprint
+
+    def _prepare_conn(self, conn):
+        """
+        Prepare the ``connection`` for :meth:`urllib3.util.ssl_wrap_socket`
+        and establish the tunnel if proxy is used.
+        """
+
+        if isinstance(conn, VerifiedHTTPSConnection):
+            conn.set_cert(
+                key_file=self.key_file,
+                key_password=self.key_password,
+                cert_file=self.cert_file,
+                cert_reqs=self.cert_reqs,
+                ca_certs=self.ca_certs,
+                ca_cert_dir=self.ca_cert_dir,
+                assert_hostname=self.assert_hostname,
+                assert_fingerprint=self.assert_fingerprint,
+            )
+            conn.ssl_version = self.ssl_version
+        return conn
+
+    def _prepare_proxy(self, conn):
+        """
+        Establish tunnel connection early, because otherwise httplib
+        would improperly set Host: header to proxy's IP:port.
+        """
+        conn.set_tunnel(self._proxy_host, self.port, self.proxy_headers)
+        conn.connect()
+
+    def _new_conn(self):
+        """
+        Return a fresh :class:`httplib.HTTPSConnection`.
+        """
+        self.num_connections += 1
+        log.debug(
+            "Starting new HTTPS connection (%d): %s:%s",
+            self.num_connections,
+            self.host,
+            self.port or "443",
+        )
+
+        if not self.ConnectionCls or self.ConnectionCls is DummyConnection:
+            raise SSLError(
+                "Can't connect to HTTPS URL because the SSL module is not available."
+            )
+
+        actual_host = self.host
+        actual_port = self.port
+        if self.proxy is not None:
+            actual_host = self.proxy.host
+            actual_port = self.proxy.port
+
+        conn = self.ConnectionCls(
+            host=actual_host,
+            port=actual_port,
+            timeout=self.timeout.connect_timeout,
+            strict=self.strict,
+            cert_file=self.cert_file,
+            key_file=self.key_file,
+            key_password=self.key_password,
+            **self.conn_kw
+        )
+
+        return self._prepare_conn(conn)
+
+    def _validate_conn(self, conn):
+        """
+        Called right before a request is made, after the socket is created.
+        """
+        super(HTTPSConnectionPool, self)._validate_conn(conn)
+
+        # Force connect early to allow us to validate the connection.
+        if not getattr(conn, "sock", None):  # AppEngine might not have  `.sock`
+            conn.connect()
+
+        if not conn.is_verified:
+            warnings.warn(
+                (
+                    "Unverified HTTPS request is being made to host '%s'. "
+                    "Adding certificate verification is strongly advised. See: "
+                    "https://urllib3.readthedocs.io/en/latest/advanced-usage.html"
+                    "#ssl-warnings" % conn.host
+                ),
+                InsecureRequestWarning,
+            )
+
+
+def connection_from_url(url, **kw):
+    """
+    Given a url, return an :class:`.ConnectionPool` instance of its host.
+
+    This is a shortcut for not having to parse out the scheme, host, and port
+    of the url before creating an :class:`.ConnectionPool` instance.
+
+    :param url:
+        Absolute URL string that must include the scheme. Port is optional.
+
+    :param \\**kw:
+        Passes additional parameters to the constructor of the appropriate
+        :class:`.ConnectionPool`. Useful for specifying things like
+        timeout, maxsize, headers, etc.
+
+    Example::
+
+        >>> conn = connection_from_url('http://google.com/')
+        >>> r = conn.request('GET', '/')
+    """
+    scheme, host, port = get_host(url)
+    port = port or port_by_scheme.get(scheme, 80)
+    if scheme == "https":
+        return HTTPSConnectionPool(host, port=port, **kw)
+    else:
+        return HTTPConnectionPool(host, port=port, **kw)
+
+
+def _normalize_host(host, scheme):
+    """
+    Normalize hosts for comparisons and use with sockets.
+    """
+
+    host = normalize_host(host, scheme)
+
+    # httplib doesn't like it when we include brackets in IPv6 addresses
+    # Specifically, if we include brackets but also pass the port then
+    # httplib crazily doubles up the square brackets on the Host header.
+    # Instead, we need to make sure we never pass ``None`` as the port.
+    # However, for backward compatibility reasons we can't actually
+    # *assert* that.  See http://bugs.python.org/issue28539
+    if host.startswith("[") and host.endswith("]"):
+        host = host[1:-1]
+    return host
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..453202594
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/_appengine_environ.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/_appengine_environ.cpython-36.pyc
new file mode 100644
index 000000000..560a82d82
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/_appengine_environ.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc
new file mode 100644
index 000000000..9608a76a6
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/appengine.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc
new file mode 100644
index 000000000..3cf04945e
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/ntlmpool.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc
new file mode 100644
index 000000000..48ab72a9a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/pyopenssl.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc
new file mode 100644
index 000000000..3aa430504
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/securetransport.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc
new file mode 100644
index 000000000..35f425ce5
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/__pycache__/socks.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_appengine_environ.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_appengine_environ.py
new file mode 100644
index 000000000..8765b907d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_appengine_environ.py
@@ -0,0 +1,36 @@
+"""
+This module provides means to detect the App Engine environment.
+"""
+
+import os
+
+
+def is_appengine():
+    return is_local_appengine() or is_prod_appengine()
+
+
+def is_appengine_sandbox():
+    """Reports if the app is running in the first generation sandbox.
+
+    The second generation runtimes are technically still in a sandbox, but it
+    is much less restrictive, so generally you shouldn't need to check for it.
+    see https://cloud.google.com/appengine/docs/standard/runtimes
+    """
+    return is_appengine() and os.environ["APPENGINE_RUNTIME"] == "python27"
+
+
+def is_local_appengine():
+    return "APPENGINE_RUNTIME" in os.environ and os.environ.get(
+        "SERVER_SOFTWARE", ""
+    ).startswith("Development/")
+
+
+def is_prod_appengine():
+    return "APPENGINE_RUNTIME" in os.environ and os.environ.get(
+        "SERVER_SOFTWARE", ""
+    ).startswith("Google App Engine/")
+
+
+def is_prod_appengine_mvms():
+    """Deprecated."""
+    return False
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..2a99c4d19
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc
new file mode 100644
index 000000000..d850b2a91
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/bindings.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc
new file mode 100644
index 000000000..2808fc0db
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/__pycache__/low_level.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/bindings.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/bindings.py
new file mode 100644
index 000000000..d9b673331
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/bindings.py
@@ -0,0 +1,493 @@
+"""
+This module uses ctypes to bind a whole bunch of functions and constants from
+SecureTransport. The goal here is to provide the low-level API to
+SecureTransport. These are essentially the C-level functions and constants, and
+they're pretty gross to work with.
+
+This code is a bastardised version of the code found in Will Bond's oscrypto
+library. An enormous debt is owed to him for blazing this trail for us. For
+that reason, this code should be considered to be covered both by urllib3's
+license and by oscrypto's:
+
+    Copyright (c) 2015-2016 Will Bond <will@wbond.net>
+
+    Permission is hereby granted, free of charge, to any person obtaining a
+    copy of this software and associated documentation files (the "Software"),
+    to deal in the Software without restriction, including without limitation
+    the rights to use, copy, modify, merge, publish, distribute, sublicense,
+    and/or sell copies of the Software, and to permit persons to whom the
+    Software is furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in
+    all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+    DEALINGS IN THE SOFTWARE.
+"""
+from __future__ import absolute_import
+
+import platform
+from ctypes.util import find_library
+from ctypes import (
+    c_void_p,
+    c_int32,
+    c_char_p,
+    c_size_t,
+    c_byte,
+    c_uint32,
+    c_ulong,
+    c_long,
+    c_bool,
+)
+from ctypes import CDLL, POINTER, CFUNCTYPE
+
+
+security_path = find_library("Security")
+if not security_path:
+    raise ImportError("The library Security could not be found")
+
+
+core_foundation_path = find_library("CoreFoundation")
+if not core_foundation_path:
+    raise ImportError("The library CoreFoundation could not be found")
+
+
+version = platform.mac_ver()[0]
+version_info = tuple(map(int, version.split(".")))
+if version_info < (10, 8):
+    raise OSError(
+        "Only OS X 10.8 and newer are supported, not %s.%s"
+        % (version_info[0], version_info[1])
+    )
+
+Security = CDLL(security_path, use_errno=True)
+CoreFoundation = CDLL(core_foundation_path, use_errno=True)
+
+Boolean = c_bool
+CFIndex = c_long
+CFStringEncoding = c_uint32
+CFData = c_void_p
+CFString = c_void_p
+CFArray = c_void_p
+CFMutableArray = c_void_p
+CFDictionary = c_void_p
+CFError = c_void_p
+CFType = c_void_p
+CFTypeID = c_ulong
+
+CFTypeRef = POINTER(CFType)
+CFAllocatorRef = c_void_p
+
+OSStatus = c_int32
+
+CFDataRef = POINTER(CFData)
+CFStringRef = POINTER(CFString)
+CFArrayRef = POINTER(CFArray)
+CFMutableArrayRef = POINTER(CFMutableArray)
+CFDictionaryRef = POINTER(CFDictionary)
+CFArrayCallBacks = c_void_p
+CFDictionaryKeyCallBacks = c_void_p
+CFDictionaryValueCallBacks = c_void_p
+
+SecCertificateRef = POINTER(c_void_p)
+SecExternalFormat = c_uint32
+SecExternalItemType = c_uint32
+SecIdentityRef = POINTER(c_void_p)
+SecItemImportExportFlags = c_uint32
+SecItemImportExportKeyParameters = c_void_p
+SecKeychainRef = POINTER(c_void_p)
+SSLProtocol = c_uint32
+SSLCipherSuite = c_uint32
+SSLContextRef = POINTER(c_void_p)
+SecTrustRef = POINTER(c_void_p)
+SSLConnectionRef = c_uint32
+SecTrustResultType = c_uint32
+SecTrustOptionFlags = c_uint32
+SSLProtocolSide = c_uint32
+SSLConnectionType = c_uint32
+SSLSessionOption = c_uint32
+
+
+try:
+    Security.SecItemImport.argtypes = [
+        CFDataRef,
+        CFStringRef,
+        POINTER(SecExternalFormat),
+        POINTER(SecExternalItemType),
+        SecItemImportExportFlags,
+        POINTER(SecItemImportExportKeyParameters),
+        SecKeychainRef,
+        POINTER(CFArrayRef),
+    ]
+    Security.SecItemImport.restype = OSStatus
+
+    Security.SecCertificateGetTypeID.argtypes = []
+    Security.SecCertificateGetTypeID.restype = CFTypeID
+
+    Security.SecIdentityGetTypeID.argtypes = []
+    Security.SecIdentityGetTypeID.restype = CFTypeID
+
+    Security.SecKeyGetTypeID.argtypes = []
+    Security.SecKeyGetTypeID.restype = CFTypeID
+
+    Security.SecCertificateCreateWithData.argtypes = [CFAllocatorRef, CFDataRef]
+    Security.SecCertificateCreateWithData.restype = SecCertificateRef
+
+    Security.SecCertificateCopyData.argtypes = [SecCertificateRef]
+    Security.SecCertificateCopyData.restype = CFDataRef
+
+    Security.SecCopyErrorMessageString.argtypes = [OSStatus, c_void_p]
+    Security.SecCopyErrorMessageString.restype = CFStringRef
+
+    Security.SecIdentityCreateWithCertificate.argtypes = [
+        CFTypeRef,
+        SecCertificateRef,
+        POINTER(SecIdentityRef),
+    ]
+    Security.SecIdentityCreateWithCertificate.restype = OSStatus
+
+    Security.SecKeychainCreate.argtypes = [
+        c_char_p,
+        c_uint32,
+        c_void_p,
+        Boolean,
+        c_void_p,
+        POINTER(SecKeychainRef),
+    ]
+    Security.SecKeychainCreate.restype = OSStatus
+
+    Security.SecKeychainDelete.argtypes = [SecKeychainRef]
+    Security.SecKeychainDelete.restype = OSStatus
+
+    Security.SecPKCS12Import.argtypes = [
+        CFDataRef,
+        CFDictionaryRef,
+        POINTER(CFArrayRef),
+    ]
+    Security.SecPKCS12Import.restype = OSStatus
+
+    SSLReadFunc = CFUNCTYPE(OSStatus, SSLConnectionRef, c_void_p, POINTER(c_size_t))
+    SSLWriteFunc = CFUNCTYPE(
+        OSStatus, SSLConnectionRef, POINTER(c_byte), POINTER(c_size_t)
+    )
+
+    Security.SSLSetIOFuncs.argtypes = [SSLContextRef, SSLReadFunc, SSLWriteFunc]
+    Security.SSLSetIOFuncs.restype = OSStatus
+
+    Security.SSLSetPeerID.argtypes = [SSLContextRef, c_char_p, c_size_t]
+    Security.SSLSetPeerID.restype = OSStatus
+
+    Security.SSLSetCertificate.argtypes = [SSLContextRef, CFArrayRef]
+    Security.SSLSetCertificate.restype = OSStatus
+
+    Security.SSLSetCertificateAuthorities.argtypes = [SSLContextRef, CFTypeRef, Boolean]
+    Security.SSLSetCertificateAuthorities.restype = OSStatus
+
+    Security.SSLSetConnection.argtypes = [SSLContextRef, SSLConnectionRef]
+    Security.SSLSetConnection.restype = OSStatus
+
+    Security.SSLSetPeerDomainName.argtypes = [SSLContextRef, c_char_p, c_size_t]
+    Security.SSLSetPeerDomainName.restype = OSStatus
+
+    Security.SSLHandshake.argtypes = [SSLContextRef]
+    Security.SSLHandshake.restype = OSStatus
+
+    Security.SSLRead.argtypes = [SSLContextRef, c_char_p, c_size_t, POINTER(c_size_t)]
+    Security.SSLRead.restype = OSStatus
+
+    Security.SSLWrite.argtypes = [SSLContextRef, c_char_p, c_size_t, POINTER(c_size_t)]
+    Security.SSLWrite.restype = OSStatus
+
+    Security.SSLClose.argtypes = [SSLContextRef]
+    Security.SSLClose.restype = OSStatus
+
+    Security.SSLGetNumberSupportedCiphers.argtypes = [SSLContextRef, POINTER(c_size_t)]
+    Security.SSLGetNumberSupportedCiphers.restype = OSStatus
+
+    Security.SSLGetSupportedCiphers.argtypes = [
+        SSLContextRef,
+        POINTER(SSLCipherSuite),
+        POINTER(c_size_t),
+    ]
+    Security.SSLGetSupportedCiphers.restype = OSStatus
+
+    Security.SSLSetEnabledCiphers.argtypes = [
+        SSLContextRef,
+        POINTER(SSLCipherSuite),
+        c_size_t,
+    ]
+    Security.SSLSetEnabledCiphers.restype = OSStatus
+
+    Security.SSLGetNumberEnabledCiphers.argtype = [SSLContextRef, POINTER(c_size_t)]
+    Security.SSLGetNumberEnabledCiphers.restype = OSStatus
+
+    Security.SSLGetEnabledCiphers.argtypes = [
+        SSLContextRef,
+        POINTER(SSLCipherSuite),
+        POINTER(c_size_t),
+    ]
+    Security.SSLGetEnabledCiphers.restype = OSStatus
+
+    Security.SSLGetNegotiatedCipher.argtypes = [SSLContextRef, POINTER(SSLCipherSuite)]
+    Security.SSLGetNegotiatedCipher.restype = OSStatus
+
+    Security.SSLGetNegotiatedProtocolVersion.argtypes = [
+        SSLContextRef,
+        POINTER(SSLProtocol),
+    ]
+    Security.SSLGetNegotiatedProtocolVersion.restype = OSStatus
+
+    Security.SSLCopyPeerTrust.argtypes = [SSLContextRef, POINTER(SecTrustRef)]
+    Security.SSLCopyPeerTrust.restype = OSStatus
+
+    Security.SecTrustSetAnchorCertificates.argtypes = [SecTrustRef, CFArrayRef]
+    Security.SecTrustSetAnchorCertificates.restype = OSStatus
+
+    Security.SecTrustSetAnchorCertificatesOnly.argstypes = [SecTrustRef, Boolean]
+    Security.SecTrustSetAnchorCertificatesOnly.restype = OSStatus
+
+    Security.SecTrustEvaluate.argtypes = [SecTrustRef, POINTER(SecTrustResultType)]
+    Security.SecTrustEvaluate.restype = OSStatus
+
+    Security.SecTrustGetCertificateCount.argtypes = [SecTrustRef]
+    Security.SecTrustGetCertificateCount.restype = CFIndex
+
+    Security.SecTrustGetCertificateAtIndex.argtypes = [SecTrustRef, CFIndex]
+    Security.SecTrustGetCertificateAtIndex.restype = SecCertificateRef
+
+    Security.SSLCreateContext.argtypes = [
+        CFAllocatorRef,
+        SSLProtocolSide,
+        SSLConnectionType,
+    ]
+    Security.SSLCreateContext.restype = SSLContextRef
+
+    Security.SSLSetSessionOption.argtypes = [SSLContextRef, SSLSessionOption, Boolean]
+    Security.SSLSetSessionOption.restype = OSStatus
+
+    Security.SSLSetProtocolVersionMin.argtypes = [SSLContextRef, SSLProtocol]
+    Security.SSLSetProtocolVersionMin.restype = OSStatus
+
+    Security.SSLSetProtocolVersionMax.argtypes = [SSLContextRef, SSLProtocol]
+    Security.SSLSetProtocolVersionMax.restype = OSStatus
+
+    Security.SecCopyErrorMessageString.argtypes = [OSStatus, c_void_p]
+    Security.SecCopyErrorMessageString.restype = CFStringRef
+
+    Security.SSLReadFunc = SSLReadFunc
+    Security.SSLWriteFunc = SSLWriteFunc
+    Security.SSLContextRef = SSLContextRef
+    Security.SSLProtocol = SSLProtocol
+    Security.SSLCipherSuite = SSLCipherSuite
+    Security.SecIdentityRef = SecIdentityRef
+    Security.SecKeychainRef = SecKeychainRef
+    Security.SecTrustRef = SecTrustRef
+    Security.SecTrustResultType = SecTrustResultType
+    Security.SecExternalFormat = SecExternalFormat
+    Security.OSStatus = OSStatus
+
+    Security.kSecImportExportPassphrase = CFStringRef.in_dll(
+        Security, "kSecImportExportPassphrase"
+    )
+    Security.kSecImportItemIdentity = CFStringRef.in_dll(
+        Security, "kSecImportItemIdentity"
+    )
+
+    # CoreFoundation time!
+    CoreFoundation.CFRetain.argtypes = [CFTypeRef]
+    CoreFoundation.CFRetain.restype = CFTypeRef
+
+    CoreFoundation.CFRelease.argtypes = [CFTypeRef]
+    CoreFoundation.CFRelease.restype = None
+
+    CoreFoundation.CFGetTypeID.argtypes = [CFTypeRef]
+    CoreFoundation.CFGetTypeID.restype = CFTypeID
+
+    CoreFoundation.CFStringCreateWithCString.argtypes = [
+        CFAllocatorRef,
+        c_char_p,
+        CFStringEncoding,
+    ]
+    CoreFoundation.CFStringCreateWithCString.restype = CFStringRef
+
+    CoreFoundation.CFStringGetCStringPtr.argtypes = [CFStringRef, CFStringEncoding]
+    CoreFoundation.CFStringGetCStringPtr.restype = c_char_p
+
+    CoreFoundation.CFStringGetCString.argtypes = [
+        CFStringRef,
+        c_char_p,
+        CFIndex,
+        CFStringEncoding,
+    ]
+    CoreFoundation.CFStringGetCString.restype = c_bool
+
+    CoreFoundation.CFDataCreate.argtypes = [CFAllocatorRef, c_char_p, CFIndex]
+    CoreFoundation.CFDataCreate.restype = CFDataRef
+
+    CoreFoundation.CFDataGetLength.argtypes = [CFDataRef]
+    CoreFoundation.CFDataGetLength.restype = CFIndex
+
+    CoreFoundation.CFDataGetBytePtr.argtypes = [CFDataRef]
+    CoreFoundation.CFDataGetBytePtr.restype = c_void_p
+
+    CoreFoundation.CFDictionaryCreate.argtypes = [
+        CFAllocatorRef,
+        POINTER(CFTypeRef),
+        POINTER(CFTypeRef),
+        CFIndex,
+        CFDictionaryKeyCallBacks,
+        CFDictionaryValueCallBacks,
+    ]
+    CoreFoundation.CFDictionaryCreate.restype = CFDictionaryRef
+
+    CoreFoundation.CFDictionaryGetValue.argtypes = [CFDictionaryRef, CFTypeRef]
+    CoreFoundation.CFDictionaryGetValue.restype = CFTypeRef
+
+    CoreFoundation.CFArrayCreate.argtypes = [
+        CFAllocatorRef,
+        POINTER(CFTypeRef),
+        CFIndex,
+        CFArrayCallBacks,
+    ]
+    CoreFoundation.CFArrayCreate.restype = CFArrayRef
+
+    CoreFoundation.CFArrayCreateMutable.argtypes = [
+        CFAllocatorRef,
+        CFIndex,
+        CFArrayCallBacks,
+    ]
+    CoreFoundation.CFArrayCreateMutable.restype = CFMutableArrayRef
+
+    CoreFoundation.CFArrayAppendValue.argtypes = [CFMutableArrayRef, c_void_p]
+    CoreFoundation.CFArrayAppendValue.restype = None
+
+    CoreFoundation.CFArrayGetCount.argtypes = [CFArrayRef]
+    CoreFoundation.CFArrayGetCount.restype = CFIndex
+
+    CoreFoundation.CFArrayGetValueAtIndex.argtypes = [CFArrayRef, CFIndex]
+    CoreFoundation.CFArrayGetValueAtIndex.restype = c_void_p
+
+    CoreFoundation.kCFAllocatorDefault = CFAllocatorRef.in_dll(
+        CoreFoundation, "kCFAllocatorDefault"
+    )
+    CoreFoundation.kCFTypeArrayCallBacks = c_void_p.in_dll(
+        CoreFoundation, "kCFTypeArrayCallBacks"
+    )
+    CoreFoundation.kCFTypeDictionaryKeyCallBacks = c_void_p.in_dll(
+        CoreFoundation, "kCFTypeDictionaryKeyCallBacks"
+    )
+    CoreFoundation.kCFTypeDictionaryValueCallBacks = c_void_p.in_dll(
+        CoreFoundation, "kCFTypeDictionaryValueCallBacks"
+    )
+
+    CoreFoundation.CFTypeRef = CFTypeRef
+    CoreFoundation.CFArrayRef = CFArrayRef
+    CoreFoundation.CFStringRef = CFStringRef
+    CoreFoundation.CFDictionaryRef = CFDictionaryRef
+
+except (AttributeError):
+    raise ImportError("Error initializing ctypes")
+
+
+class CFConst(object):
+    """
+    A class object that acts as essentially a namespace for CoreFoundation
+    constants.
+    """
+
+    kCFStringEncodingUTF8 = CFStringEncoding(0x08000100)
+
+
+class SecurityConst(object):
+    """
+    A class object that acts as essentially a namespace for Security constants.
+    """
+
+    kSSLSessionOptionBreakOnServerAuth = 0
+
+    kSSLProtocol2 = 1
+    kSSLProtocol3 = 2
+    kTLSProtocol1 = 4
+    kTLSProtocol11 = 7
+    kTLSProtocol12 = 8
+    # SecureTransport does not support TLS 1.3 even if there's a constant for it
+    kTLSProtocol13 = 10
+    kTLSProtocolMaxSupported = 999
+
+    kSSLClientSide = 1
+    kSSLStreamType = 0
+
+    kSecFormatPEMSequence = 10
+
+    kSecTrustResultInvalid = 0
+    kSecTrustResultProceed = 1
+    # This gap is present on purpose: this was kSecTrustResultConfirm, which
+    # is deprecated.
+    kSecTrustResultDeny = 3
+    kSecTrustResultUnspecified = 4
+    kSecTrustResultRecoverableTrustFailure = 5
+    kSecTrustResultFatalTrustFailure = 6
+    kSecTrustResultOtherError = 7
+
+    errSSLProtocol = -9800
+    errSSLWouldBlock = -9803
+    errSSLClosedGraceful = -9805
+    errSSLClosedNoNotify = -9816
+    errSSLClosedAbort = -9806
+
+    errSSLXCertChainInvalid = -9807
+    errSSLCrypto = -9809
+    errSSLInternal = -9810
+    errSSLCertExpired = -9814
+    errSSLCertNotYetValid = -9815
+    errSSLUnknownRootCert = -9812
+    errSSLNoRootCert = -9813
+    errSSLHostNameMismatch = -9843
+    errSSLPeerHandshakeFail = -9824
+    errSSLPeerUserCancelled = -9839
+    errSSLWeakPeerEphemeralDHKey = -9850
+    errSSLServerAuthCompleted = -9841
+    errSSLRecordOverflow = -9847
+
+    errSecVerifyFailed = -67808
+    errSecNoTrustSettings = -25263
+    errSecItemNotFound = -25300
+    errSecInvalidTrustSettings = -25262
+
+    # Cipher suites. We only pick the ones our default cipher string allows.
+    # Source: https://developer.apple.com/documentation/security/1550981-ssl_cipher_suite_values
+    TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384 = 0xC02C
+    TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384 = 0xC030
+    TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256 = 0xC02B
+    TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256 = 0xC02F
+    TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256 = 0xCCA9
+    TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256 = 0xCCA8
+    TLS_DHE_RSA_WITH_AES_256_GCM_SHA384 = 0x009F
+    TLS_DHE_RSA_WITH_AES_128_GCM_SHA256 = 0x009E
+    TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384 = 0xC024
+    TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384 = 0xC028
+    TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA = 0xC00A
+    TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA = 0xC014
+    TLS_DHE_RSA_WITH_AES_256_CBC_SHA256 = 0x006B
+    TLS_DHE_RSA_WITH_AES_256_CBC_SHA = 0x0039
+    TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256 = 0xC023
+    TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256 = 0xC027
+    TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA = 0xC009
+    TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA = 0xC013
+    TLS_DHE_RSA_WITH_AES_128_CBC_SHA256 = 0x0067
+    TLS_DHE_RSA_WITH_AES_128_CBC_SHA = 0x0033
+    TLS_RSA_WITH_AES_256_GCM_SHA384 = 0x009D
+    TLS_RSA_WITH_AES_128_GCM_SHA256 = 0x009C
+    TLS_RSA_WITH_AES_256_CBC_SHA256 = 0x003D
+    TLS_RSA_WITH_AES_128_CBC_SHA256 = 0x003C
+    TLS_RSA_WITH_AES_256_CBC_SHA = 0x0035
+    TLS_RSA_WITH_AES_128_CBC_SHA = 0x002F
+    TLS_AES_128_GCM_SHA256 = 0x1301
+    TLS_AES_256_GCM_SHA384 = 0x1302
+    TLS_AES_128_CCM_8_SHA256 = 0x1305
+    TLS_AES_128_CCM_SHA256 = 0x1304
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/low_level.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/low_level.py
new file mode 100644
index 000000000..e60168cac
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/_securetransport/low_level.py
@@ -0,0 +1,328 @@
+"""
+Low-level helpers for the SecureTransport bindings.
+
+These are Python functions that are not directly related to the high-level APIs
+but are necessary to get them to work. They include a whole bunch of low-level
+CoreFoundation messing about and memory management. The concerns in this module
+are almost entirely about trying to avoid memory leaks and providing
+appropriate and useful assistance to the higher-level code.
+"""
+import base64
+import ctypes
+import itertools
+import re
+import os
+import ssl
+import tempfile
+
+from .bindings import Security, CoreFoundation, CFConst
+
+
+# This regular expression is used to grab PEM data out of a PEM bundle.
+_PEM_CERTS_RE = re.compile(
+    b"-----BEGIN CERTIFICATE-----\n(.*?)\n-----END CERTIFICATE-----", re.DOTALL
+)
+
+
+def _cf_data_from_bytes(bytestring):
+    """
+    Given a bytestring, create a CFData object from it. This CFData object must
+    be CFReleased by the caller.
+    """
+    return CoreFoundation.CFDataCreate(
+        CoreFoundation.kCFAllocatorDefault, bytestring, len(bytestring)
+    )
+
+
+def _cf_dictionary_from_tuples(tuples):
+    """
+    Given a list of Python tuples, create an associated CFDictionary.
+    """
+    dictionary_size = len(tuples)
+
+    # We need to get the dictionary keys and values out in the same order.
+    keys = (t[0] for t in tuples)
+    values = (t[1] for t in tuples)
+    cf_keys = (CoreFoundation.CFTypeRef * dictionary_size)(*keys)
+    cf_values = (CoreFoundation.CFTypeRef * dictionary_size)(*values)
+
+    return CoreFoundation.CFDictionaryCreate(
+        CoreFoundation.kCFAllocatorDefault,
+        cf_keys,
+        cf_values,
+        dictionary_size,
+        CoreFoundation.kCFTypeDictionaryKeyCallBacks,
+        CoreFoundation.kCFTypeDictionaryValueCallBacks,
+    )
+
+
+def _cf_string_to_unicode(value):
+    """
+    Creates a Unicode string from a CFString object. Used entirely for error
+    reporting.
+
+    Yes, it annoys me quite a lot that this function is this complex.
+    """
+    value_as_void_p = ctypes.cast(value, ctypes.POINTER(ctypes.c_void_p))
+
+    string = CoreFoundation.CFStringGetCStringPtr(
+        value_as_void_p, CFConst.kCFStringEncodingUTF8
+    )
+    if string is None:
+        buffer = ctypes.create_string_buffer(1024)
+        result = CoreFoundation.CFStringGetCString(
+            value_as_void_p, buffer, 1024, CFConst.kCFStringEncodingUTF8
+        )
+        if not result:
+            raise OSError("Error copying C string from CFStringRef")
+        string = buffer.value
+    if string is not None:
+        string = string.decode("utf-8")
+    return string
+
+
+def _assert_no_error(error, exception_class=None):
+    """
+    Checks the return code and throws an exception if there is an error to
+    report
+    """
+    if error == 0:
+        return
+
+    cf_error_string = Security.SecCopyErrorMessageString(error, None)
+    output = _cf_string_to_unicode(cf_error_string)
+    CoreFoundation.CFRelease(cf_error_string)
+
+    if output is None or output == u"":
+        output = u"OSStatus %s" % error
+
+    if exception_class is None:
+        exception_class = ssl.SSLError
+
+    raise exception_class(output)
+
+
+def _cert_array_from_pem(pem_bundle):
+    """
+    Given a bundle of certs in PEM format, turns them into a CFArray of certs
+    that can be used to validate a cert chain.
+    """
+    # Normalize the PEM bundle's line endings.
+    pem_bundle = pem_bundle.replace(b"\r\n", b"\n")
+
+    der_certs = [
+        base64.b64decode(match.group(1)) for match in _PEM_CERTS_RE.finditer(pem_bundle)
+    ]
+    if not der_certs:
+        raise ssl.SSLError("No root certificates specified")
+
+    cert_array = CoreFoundation.CFArrayCreateMutable(
+        CoreFoundation.kCFAllocatorDefault,
+        0,
+        ctypes.byref(CoreFoundation.kCFTypeArrayCallBacks),
+    )
+    if not cert_array:
+        raise ssl.SSLError("Unable to allocate memory!")
+
+    try:
+        for der_bytes in der_certs:
+            certdata = _cf_data_from_bytes(der_bytes)
+            if not certdata:
+                raise ssl.SSLError("Unable to allocate memory!")
+            cert = Security.SecCertificateCreateWithData(
+                CoreFoundation.kCFAllocatorDefault, certdata
+            )
+            CoreFoundation.CFRelease(certdata)
+            if not cert:
+                raise ssl.SSLError("Unable to build cert object!")
+
+            CoreFoundation.CFArrayAppendValue(cert_array, cert)
+            CoreFoundation.CFRelease(cert)
+    except Exception:
+        # We need to free the array before the exception bubbles further.
+        # We only want to do that if an error occurs: otherwise, the caller
+        # should free.
+        CoreFoundation.CFRelease(cert_array)
+
+    return cert_array
+
+
+def _is_cert(item):
+    """
+    Returns True if a given CFTypeRef is a certificate.
+    """
+    expected = Security.SecCertificateGetTypeID()
+    return CoreFoundation.CFGetTypeID(item) == expected
+
+
+def _is_identity(item):
+    """
+    Returns True if a given CFTypeRef is an identity.
+    """
+    expected = Security.SecIdentityGetTypeID()
+    return CoreFoundation.CFGetTypeID(item) == expected
+
+
+def _temporary_keychain():
+    """
+    This function creates a temporary Mac keychain that we can use to work with
+    credentials. This keychain uses a one-time password and a temporary file to
+    store the data. We expect to have one keychain per socket. The returned
+    SecKeychainRef must be freed by the caller, including calling
+    SecKeychainDelete.
+
+    Returns a tuple of the SecKeychainRef and the path to the temporary
+    directory that contains it.
+    """
+    # Unfortunately, SecKeychainCreate requires a path to a keychain. This
+    # means we cannot use mkstemp to use a generic temporary file. Instead,
+    # we're going to create a temporary directory and a filename to use there.
+    # This filename will be 8 random bytes expanded into base64. We also need
+    # some random bytes to password-protect the keychain we're creating, so we
+    # ask for 40 random bytes.
+    random_bytes = os.urandom(40)
+    filename = base64.b16encode(random_bytes[:8]).decode("utf-8")
+    password = base64.b16encode(random_bytes[8:])  # Must be valid UTF-8
+    tempdirectory = tempfile.mkdtemp()
+
+    keychain_path = os.path.join(tempdirectory, filename).encode("utf-8")
+
+    # We now want to create the keychain itself.
+    keychain = Security.SecKeychainRef()
+    status = Security.SecKeychainCreate(
+        keychain_path, len(password), password, False, None, ctypes.byref(keychain)
+    )
+    _assert_no_error(status)
+
+    # Having created the keychain, we want to pass it off to the caller.
+    return keychain, tempdirectory
+
+
+def _load_items_from_file(keychain, path):
+    """
+    Given a single file, loads all the trust objects from it into arrays and
+    the keychain.
+    Returns a tuple of lists: the first list is a list of identities, the
+    second a list of certs.
+    """
+    certificates = []
+    identities = []
+    result_array = None
+
+    with open(path, "rb") as f:
+        raw_filedata = f.read()
+
+    try:
+        filedata = CoreFoundation.CFDataCreate(
+            CoreFoundation.kCFAllocatorDefault, raw_filedata, len(raw_filedata)
+        )
+        result_array = CoreFoundation.CFArrayRef()
+        result = Security.SecItemImport(
+            filedata,  # cert data
+            None,  # Filename, leaving it out for now
+            None,  # What the type of the file is, we don't care
+            None,  # what's in the file, we don't care
+            0,  # import flags
+            None,  # key params, can include passphrase in the future
+            keychain,  # The keychain to insert into
+            ctypes.byref(result_array),  # Results
+        )
+        _assert_no_error(result)
+
+        # A CFArray is not very useful to us as an intermediary
+        # representation, so we are going to extract the objects we want
+        # and then free the array. We don't need to keep hold of keys: the
+        # keychain already has them!
+        result_count = CoreFoundation.CFArrayGetCount(result_array)
+        for index in range(result_count):
+            item = CoreFoundation.CFArrayGetValueAtIndex(result_array, index)
+            item = ctypes.cast(item, CoreFoundation.CFTypeRef)
+
+            if _is_cert(item):
+                CoreFoundation.CFRetain(item)
+                certificates.append(item)
+            elif _is_identity(item):
+                CoreFoundation.CFRetain(item)
+                identities.append(item)
+    finally:
+        if result_array:
+            CoreFoundation.CFRelease(result_array)
+
+        CoreFoundation.CFRelease(filedata)
+
+    return (identities, certificates)
+
+
+def _load_client_cert_chain(keychain, *paths):
+    """
+    Load certificates and maybe keys from a number of files. Has the end goal
+    of returning a CFArray containing one SecIdentityRef, and then zero or more
+    SecCertificateRef objects, suitable for use as a client certificate trust
+    chain.
+    """
+    # Ok, the strategy.
+    #
+    # This relies on knowing that macOS will not give you a SecIdentityRef
+    # unless you have imported a key into a keychain. This is a somewhat
+    # artificial limitation of macOS (for example, it doesn't necessarily
+    # affect iOS), but there is nothing inside Security.framework that lets you
+    # get a SecIdentityRef without having a key in a keychain.
+    #
+    # So the policy here is we take all the files and iterate them in order.
+    # Each one will use SecItemImport to have one or more objects loaded from
+    # it. We will also point at a keychain that macOS can use to work with the
+    # private key.
+    #
+    # Once we have all the objects, we'll check what we actually have. If we
+    # already have a SecIdentityRef in hand, fab: we'll use that. Otherwise,
+    # we'll take the first certificate (which we assume to be our leaf) and
+    # ask the keychain to give us a SecIdentityRef with that cert's associated
+    # key.
+    #
+    # We'll then return a CFArray containing the trust chain: one
+    # SecIdentityRef and then zero-or-more SecCertificateRef objects. The
+    # responsibility for freeing this CFArray will be with the caller. This
+    # CFArray must remain alive for the entire connection, so in practice it
+    # will be stored with a single SSLSocket, along with the reference to the
+    # keychain.
+    certificates = []
+    identities = []
+
+    # Filter out bad paths.
+    paths = (path for path in paths if path)
+
+    try:
+        for file_path in paths:
+            new_identities, new_certs = _load_items_from_file(keychain, file_path)
+            identities.extend(new_identities)
+            certificates.extend(new_certs)
+
+        # Ok, we have everything. The question is: do we have an identity? If
+        # not, we want to grab one from the first cert we have.
+        if not identities:
+            new_identity = Security.SecIdentityRef()
+            status = Security.SecIdentityCreateWithCertificate(
+                keychain, certificates[0], ctypes.byref(new_identity)
+            )
+            _assert_no_error(status)
+            identities.append(new_identity)
+
+            # We now want to release the original certificate, as we no longer
+            # need it.
+            CoreFoundation.CFRelease(certificates.pop(0))
+
+        # We now need to build a new CFArray that holds the trust chain.
+        trust_chain = CoreFoundation.CFArrayCreateMutable(
+            CoreFoundation.kCFAllocatorDefault,
+            0,
+            ctypes.byref(CoreFoundation.kCFTypeArrayCallBacks),
+        )
+        for item in itertools.chain(identities, certificates):
+            # ArrayAppendValue does a CFRetain on the item. That's fine,
+            # because the finally block will release our other refs to them.
+            CoreFoundation.CFArrayAppendValue(trust_chain, item)
+
+        return trust_chain
+    finally:
+        for obj in itertools.chain(identities, certificates):
+            CoreFoundation.CFRelease(obj)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/appengine.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/appengine.py
new file mode 100644
index 000000000..d09d2be64
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/appengine.py
@@ -0,0 +1,314 @@
+"""
+This module provides a pool manager that uses Google App Engine's
+`URLFetch Service <https://cloud.google.com/appengine/docs/python/urlfetch>`_.
+
+Example usage::
+
+    from pip._vendor.urllib3 import PoolManager
+    from pip._vendor.urllib3.contrib.appengine import AppEngineManager, is_appengine_sandbox
+
+    if is_appengine_sandbox():
+        # AppEngineManager uses AppEngine's URLFetch API behind the scenes
+        http = AppEngineManager()
+    else:
+        # PoolManager uses a socket-level API behind the scenes
+        http = PoolManager()
+
+    r = http.request('GET', 'https://google.com/')
+
+There are `limitations <https://cloud.google.com/appengine/docs/python/\
+urlfetch/#Python_Quotas_and_limits>`_ to the URLFetch service and it may not be
+the best choice for your application. There are three options for using
+urllib3 on Google App Engine:
+
+1. You can use :class:`AppEngineManager` with URLFetch. URLFetch is
+   cost-effective in many circumstances as long as your usage is within the
+   limitations.
+2. You can use a normal :class:`~urllib3.PoolManager` by enabling sockets.
+   Sockets also have `limitations and restrictions
+   <https://cloud.google.com/appengine/docs/python/sockets/\
+   #limitations-and-restrictions>`_ and have a lower free quota than URLFetch.
+   To use sockets, be sure to specify the following in your ``app.yaml``::
+
+        env_variables:
+            GAE_USE_SOCKETS_HTTPLIB : 'true'
+
+3. If you are using `App Engine Flexible
+<https://cloud.google.com/appengine/docs/flexible/>`_, you can use the standard
+:class:`PoolManager` without any configuration or special environment variables.
+"""
+
+from __future__ import absolute_import
+import io
+import logging
+import warnings
+from ..packages.six.moves.urllib.parse import urljoin
+
+from ..exceptions import (
+    HTTPError,
+    HTTPWarning,
+    MaxRetryError,
+    ProtocolError,
+    TimeoutError,
+    SSLError,
+)
+
+from ..request import RequestMethods
+from ..response import HTTPResponse
+from ..util.timeout import Timeout
+from ..util.retry import Retry
+from . import _appengine_environ
+
+try:
+    from google.appengine.api import urlfetch
+except ImportError:
+    urlfetch = None
+
+
+log = logging.getLogger(__name__)
+
+
+class AppEnginePlatformWarning(HTTPWarning):
+    pass
+
+
+class AppEnginePlatformError(HTTPError):
+    pass
+
+
+class AppEngineManager(RequestMethods):
+    """
+    Connection manager for Google App Engine sandbox applications.
+
+    This manager uses the URLFetch service directly instead of using the
+    emulated httplib, and is subject to URLFetch limitations as described in
+    the App Engine documentation `here
+    <https://cloud.google.com/appengine/docs/python/urlfetch>`_.
+
+    Notably it will raise an :class:`AppEnginePlatformError` if:
+        * URLFetch is not available.
+        * If you attempt to use this on App Engine Flexible, as full socket
+          support is available.
+        * If a request size is more than 10 megabytes.
+        * If a response size is more than 32 megabtyes.
+        * If you use an unsupported request method such as OPTIONS.
+
+    Beyond those cases, it will raise normal urllib3 errors.
+    """
+
+    def __init__(
+        self,
+        headers=None,
+        retries=None,
+        validate_certificate=True,
+        urlfetch_retries=True,
+    ):
+        if not urlfetch:
+            raise AppEnginePlatformError(
+                "URLFetch is not available in this environment."
+            )
+
+        warnings.warn(
+            "urllib3 is using URLFetch on Google App Engine sandbox instead "
+            "of sockets. To use sockets directly instead of URLFetch see "
+            "https://urllib3.readthedocs.io/en/latest/reference/urllib3.contrib.html.",
+            AppEnginePlatformWarning,
+        )
+
+        RequestMethods.__init__(self, headers)
+        self.validate_certificate = validate_certificate
+        self.urlfetch_retries = urlfetch_retries
+
+        self.retries = retries or Retry.DEFAULT
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        # Return False to re-raise any potential exceptions
+        return False
+
+    def urlopen(
+        self,
+        method,
+        url,
+        body=None,
+        headers=None,
+        retries=None,
+        redirect=True,
+        timeout=Timeout.DEFAULT_TIMEOUT,
+        **response_kw
+    ):
+
+        retries = self._get_retries(retries, redirect)
+
+        try:
+            follow_redirects = redirect and retries.redirect != 0 and retries.total
+            response = urlfetch.fetch(
+                url,
+                payload=body,
+                method=method,
+                headers=headers or {},
+                allow_truncated=False,
+                follow_redirects=self.urlfetch_retries and follow_redirects,
+                deadline=self._get_absolute_timeout(timeout),
+                validate_certificate=self.validate_certificate,
+            )
+        except urlfetch.DeadlineExceededError as e:
+            raise TimeoutError(self, e)
+
+        except urlfetch.InvalidURLError as e:
+            if "too large" in str(e):
+                raise AppEnginePlatformError(
+                    "URLFetch request too large, URLFetch only "
+                    "supports requests up to 10mb in size.",
+                    e,
+                )
+            raise ProtocolError(e)
+
+        except urlfetch.DownloadError as e:
+            if "Too many redirects" in str(e):
+                raise MaxRetryError(self, url, reason=e)
+            raise ProtocolError(e)
+
+        except urlfetch.ResponseTooLargeError as e:
+            raise AppEnginePlatformError(
+                "URLFetch response too large, URLFetch only supports"
+                "responses up to 32mb in size.",
+                e,
+            )
+
+        except urlfetch.SSLCertificateError as e:
+            raise SSLError(e)
+
+        except urlfetch.InvalidMethodError as e:
+            raise AppEnginePlatformError(
+                "URLFetch does not support method: %s" % method, e
+            )
+
+        http_response = self._urlfetch_response_to_http_response(
+            response, retries=retries, **response_kw
+        )
+
+        # Handle redirect?
+        redirect_location = redirect and http_response.get_redirect_location()
+        if redirect_location:
+            # Check for redirect response
+            if self.urlfetch_retries and retries.raise_on_redirect:
+                raise MaxRetryError(self, url, "too many redirects")
+            else:
+                if http_response.status == 303:
+                    method = "GET"
+
+                try:
+                    retries = retries.increment(
+                        method, url, response=http_response, _pool=self
+                    )
+                except MaxRetryError:
+                    if retries.raise_on_redirect:
+                        raise MaxRetryError(self, url, "too many redirects")
+                    return http_response
+
+                retries.sleep_for_retry(http_response)
+                log.debug("Redirecting %s -> %s", url, redirect_location)
+                redirect_url = urljoin(url, redirect_location)
+                return self.urlopen(
+                    method,
+                    redirect_url,
+                    body,
+                    headers,
+                    retries=retries,
+                    redirect=redirect,
+                    timeout=timeout,
+                    **response_kw
+                )
+
+        # Check if we should retry the HTTP response.
+        has_retry_after = bool(http_response.getheader("Retry-After"))
+        if retries.is_retry(method, http_response.status, has_retry_after):
+            retries = retries.increment(method, url, response=http_response, _pool=self)
+            log.debug("Retry: %s", url)
+            retries.sleep(http_response)
+            return self.urlopen(
+                method,
+                url,
+                body=body,
+                headers=headers,
+                retries=retries,
+                redirect=redirect,
+                timeout=timeout,
+                **response_kw
+            )
+
+        return http_response
+
+    def _urlfetch_response_to_http_response(self, urlfetch_resp, **response_kw):
+
+        if is_prod_appengine():
+            # Production GAE handles deflate encoding automatically, but does
+            # not remove the encoding header.
+            content_encoding = urlfetch_resp.headers.get("content-encoding")
+
+            if content_encoding == "deflate":
+                del urlfetch_resp.headers["content-encoding"]
+
+        transfer_encoding = urlfetch_resp.headers.get("transfer-encoding")
+        # We have a full response's content,
+        # so let's make sure we don't report ourselves as chunked data.
+        if transfer_encoding == "chunked":
+            encodings = transfer_encoding.split(",")
+            encodings.remove("chunked")
+            urlfetch_resp.headers["transfer-encoding"] = ",".join(encodings)
+
+        original_response = HTTPResponse(
+            # In order for decoding to work, we must present the content as
+            # a file-like object.
+            body=io.BytesIO(urlfetch_resp.content),
+            msg=urlfetch_resp.header_msg,
+            headers=urlfetch_resp.headers,
+            status=urlfetch_resp.status_code,
+            **response_kw
+        )
+
+        return HTTPResponse(
+            body=io.BytesIO(urlfetch_resp.content),
+            headers=urlfetch_resp.headers,
+            status=urlfetch_resp.status_code,
+            original_response=original_response,
+            **response_kw
+        )
+
+    def _get_absolute_timeout(self, timeout):
+        if timeout is Timeout.DEFAULT_TIMEOUT:
+            return None  # Defer to URLFetch's default.
+        if isinstance(timeout, Timeout):
+            if timeout._read is not None or timeout._connect is not None:
+                warnings.warn(
+                    "URLFetch does not support granular timeout settings, "
+                    "reverting to total or default URLFetch timeout.",
+                    AppEnginePlatformWarning,
+                )
+            return timeout.total
+        return timeout
+
+    def _get_retries(self, retries, redirect):
+        if not isinstance(retries, Retry):
+            retries = Retry.from_int(retries, redirect=redirect, default=self.retries)
+
+        if retries.connect or retries.read or retries.redirect:
+            warnings.warn(
+                "URLFetch only supports total retries and does not "
+                "recognize connect, read, or redirect retry parameters.",
+                AppEnginePlatformWarning,
+            )
+
+        return retries
+
+
+# Alias methods from _appengine_environ to maintain public API interface.
+
+is_appengine = _appengine_environ.is_appengine
+is_appengine_sandbox = _appengine_environ.is_appengine_sandbox
+is_local_appengine = _appengine_environ.is_local_appengine
+is_prod_appengine = _appengine_environ.is_prod_appengine
+is_prod_appengine_mvms = _appengine_environ.is_prod_appengine_mvms
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/ntlmpool.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/ntlmpool.py
new file mode 100644
index 000000000..1fd242a6e
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/ntlmpool.py
@@ -0,0 +1,121 @@
+"""
+NTLM authenticating pool, contributed by erikcederstran
+
+Issue #10, see: http://code.google.com/p/urllib3/issues/detail?id=10
+"""
+from __future__ import absolute_import
+
+from logging import getLogger
+from ntlm import ntlm
+
+from .. import HTTPSConnectionPool
+from ..packages.six.moves.http_client import HTTPSConnection
+
+
+log = getLogger(__name__)
+
+
+class NTLMConnectionPool(HTTPSConnectionPool):
+    """
+    Implements an NTLM authentication version of an urllib3 connection pool
+    """
+
+    scheme = "https"
+
+    def __init__(self, user, pw, authurl, *args, **kwargs):
+        """
+        authurl is a random URL on the server that is protected by NTLM.
+        user is the Windows user, probably in the DOMAIN\\username format.
+        pw is the password for the user.
+        """
+        super(NTLMConnectionPool, self).__init__(*args, **kwargs)
+        self.authurl = authurl
+        self.rawuser = user
+        user_parts = user.split("\\", 1)
+        self.domain = user_parts[0].upper()
+        self.user = user_parts[1]
+        self.pw = pw
+
+    def _new_conn(self):
+        # Performs the NTLM handshake that secures the connection. The socket
+        # must be kept open while requests are performed.
+        self.num_connections += 1
+        log.debug(
+            "Starting NTLM HTTPS connection no. %d: https://%s%s",
+            self.num_connections,
+            self.host,
+            self.authurl,
+        )
+
+        headers = {"Connection": "Keep-Alive"}
+        req_header = "Authorization"
+        resp_header = "www-authenticate"
+
+        conn = HTTPSConnection(host=self.host, port=self.port)
+
+        # Send negotiation message
+        headers[req_header] = "NTLM %s" % ntlm.create_NTLM_NEGOTIATE_MESSAGE(
+            self.rawuser
+        )
+        log.debug("Request headers: %s", headers)
+        conn.request("GET", self.authurl, None, headers)
+        res = conn.getresponse()
+        reshdr = dict(res.getheaders())
+        log.debug("Response status: %s %s", res.status, res.reason)
+        log.debug("Response headers: %s", reshdr)
+        log.debug("Response data: %s [...]", res.read(100))
+
+        # Remove the reference to the socket, so that it can not be closed by
+        # the response object (we want to keep the socket open)
+        res.fp = None
+
+        # Server should respond with a challenge message
+        auth_header_values = reshdr[resp_header].split(", ")
+        auth_header_value = None
+        for s in auth_header_values:
+            if s[:5] == "NTLM ":
+                auth_header_value = s[5:]
+        if auth_header_value is None:
+            raise Exception(
+                "Unexpected %s response header: %s" % (resp_header, reshdr[resp_header])
+            )
+
+        # Send authentication message
+        ServerChallenge, NegotiateFlags = ntlm.parse_NTLM_CHALLENGE_MESSAGE(
+            auth_header_value
+        )
+        auth_msg = ntlm.create_NTLM_AUTHENTICATE_MESSAGE(
+            ServerChallenge, self.user, self.domain, self.pw, NegotiateFlags
+        )
+        headers[req_header] = "NTLM %s" % auth_msg
+        log.debug("Request headers: %s", headers)
+        conn.request("GET", self.authurl, None, headers)
+        res = conn.getresponse()
+        log.debug("Response status: %s %s", res.status, res.reason)
+        log.debug("Response headers: %s", dict(res.getheaders()))
+        log.debug("Response data: %s [...]", res.read()[:100])
+        if res.status != 200:
+            if res.status == 401:
+                raise Exception("Server rejected request: wrong username or password")
+            raise Exception("Wrong server response: %s %s" % (res.status, res.reason))
+
+        res.fp = None
+        log.debug("Connection established")
+        return conn
+
+    def urlopen(
+        self,
+        method,
+        url,
+        body=None,
+        headers=None,
+        retries=3,
+        redirect=True,
+        assert_same_host=True,
+    ):
+        if headers is None:
+            headers = {}
+        headers["Connection"] = "Keep-Alive"
+        return super(NTLMConnectionPool, self).urlopen(
+            method, url, body, headers, retries, redirect, assert_same_host
+        )
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/pyopenssl.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/pyopenssl.py
new file mode 100644
index 000000000..d8fe0629c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/pyopenssl.py
@@ -0,0 +1,501 @@
+"""
+SSL with SNI_-support for Python 2. Follow these instructions if you would
+like to verify SSL certificates in Python 2. Note, the default libraries do
+*not* do certificate checking; you need to do additional work to validate
+certificates yourself.
+
+This needs the following packages installed:
+
+* pyOpenSSL (tested with 16.0.0)
+* cryptography (minimum 1.3.4, from pyopenssl)
+* idna (minimum 2.0, from cryptography)
+
+However, pyopenssl depends on cryptography, which depends on idna, so while we
+use all three directly here we end up having relatively few packages required.
+
+You can install them with the following command:
+
+    pip install pyopenssl cryptography idna
+
+To activate certificate checking, call
+:func:`~urllib3.contrib.pyopenssl.inject_into_urllib3` from your Python code
+before you begin making HTTP requests. This can be done in a ``sitecustomize``
+module, or at any other time before your application begins using ``urllib3``,
+like this::
+
+    try:
+        import urllib3.contrib.pyopenssl
+        urllib3.contrib.pyopenssl.inject_into_urllib3()
+    except ImportError:
+        pass
+
+Now you can use :mod:`urllib3` as you normally would, and it will support SNI
+when the required modules are installed.
+
+Activating this module also has the positive side effect of disabling SSL/TLS
+compression in Python 2 (see `CRIME attack`_).
+
+If you want to configure the default list of supported cipher suites, you can
+set the ``urllib3.contrib.pyopenssl.DEFAULT_SSL_CIPHER_LIST`` variable.
+
+.. _sni: https://en.wikipedia.org/wiki/Server_Name_Indication
+.. _crime attack: https://en.wikipedia.org/wiki/CRIME_(security_exploit)
+"""
+from __future__ import absolute_import
+
+import OpenSSL.SSL
+from cryptography import x509
+from cryptography.hazmat.backends.openssl import backend as openssl_backend
+from cryptography.hazmat.backends.openssl.x509 import _Certificate
+
+try:
+    from cryptography.x509 import UnsupportedExtension
+except ImportError:
+    # UnsupportedExtension is gone in cryptography >= 2.1.0
+    class UnsupportedExtension(Exception):
+        pass
+
+
+from socket import timeout, error as SocketError
+from io import BytesIO
+
+try:  # Platform-specific: Python 2
+    from socket import _fileobject
+except ImportError:  # Platform-specific: Python 3
+    _fileobject = None
+    from ..packages.backports.makefile import backport_makefile
+
+import logging
+import ssl
+from ..packages import six
+import sys
+
+from .. import util
+
+
+__all__ = ["inject_into_urllib3", "extract_from_urllib3"]
+
+# SNI always works.
+HAS_SNI = True
+
+# Map from urllib3 to PyOpenSSL compatible parameter-values.
+_openssl_versions = {
+    util.PROTOCOL_TLS: OpenSSL.SSL.SSLv23_METHOD,
+    ssl.PROTOCOL_TLSv1: OpenSSL.SSL.TLSv1_METHOD,
+}
+
+if hasattr(ssl, "PROTOCOL_SSLv3") and hasattr(OpenSSL.SSL, "SSLv3_METHOD"):
+    _openssl_versions[ssl.PROTOCOL_SSLv3] = OpenSSL.SSL.SSLv3_METHOD
+
+if hasattr(ssl, "PROTOCOL_TLSv1_1") and hasattr(OpenSSL.SSL, "TLSv1_1_METHOD"):
+    _openssl_versions[ssl.PROTOCOL_TLSv1_1] = OpenSSL.SSL.TLSv1_1_METHOD
+
+if hasattr(ssl, "PROTOCOL_TLSv1_2") and hasattr(OpenSSL.SSL, "TLSv1_2_METHOD"):
+    _openssl_versions[ssl.PROTOCOL_TLSv1_2] = OpenSSL.SSL.TLSv1_2_METHOD
+
+
+_stdlib_to_openssl_verify = {
+    ssl.CERT_NONE: OpenSSL.SSL.VERIFY_NONE,
+    ssl.CERT_OPTIONAL: OpenSSL.SSL.VERIFY_PEER,
+    ssl.CERT_REQUIRED: OpenSSL.SSL.VERIFY_PEER
+    + OpenSSL.SSL.VERIFY_FAIL_IF_NO_PEER_CERT,
+}
+_openssl_to_stdlib_verify = dict((v, k) for k, v in _stdlib_to_openssl_verify.items())
+
+# OpenSSL will only write 16K at a time
+SSL_WRITE_BLOCKSIZE = 16384
+
+orig_util_HAS_SNI = util.HAS_SNI
+orig_util_SSLContext = util.ssl_.SSLContext
+
+
+log = logging.getLogger(__name__)
+
+
+def inject_into_urllib3():
+    "Monkey-patch urllib3 with PyOpenSSL-backed SSL-support."
+
+    _validate_dependencies_met()
+
+    util.SSLContext = PyOpenSSLContext
+    util.ssl_.SSLContext = PyOpenSSLContext
+    util.HAS_SNI = HAS_SNI
+    util.ssl_.HAS_SNI = HAS_SNI
+    util.IS_PYOPENSSL = True
+    util.ssl_.IS_PYOPENSSL = True
+
+
+def extract_from_urllib3():
+    "Undo monkey-patching by :func:`inject_into_urllib3`."
+
+    util.SSLContext = orig_util_SSLContext
+    util.ssl_.SSLContext = orig_util_SSLContext
+    util.HAS_SNI = orig_util_HAS_SNI
+    util.ssl_.HAS_SNI = orig_util_HAS_SNI
+    util.IS_PYOPENSSL = False
+    util.ssl_.IS_PYOPENSSL = False
+
+
+def _validate_dependencies_met():
+    """
+    Verifies that PyOpenSSL's package-level dependencies have been met.
+    Throws `ImportError` if they are not met.
+    """
+    # Method added in `cryptography==1.1`; not available in older versions
+    from cryptography.x509.extensions import Extensions
+
+    if getattr(Extensions, "get_extension_for_class", None) is None:
+        raise ImportError(
+            "'cryptography' module missing required functionality.  "
+            "Try upgrading to v1.3.4 or newer."
+        )
+
+    # pyOpenSSL 0.14 and above use cryptography for OpenSSL bindings. The _x509
+    # attribute is only present on those versions.
+    from OpenSSL.crypto import X509
+
+    x509 = X509()
+    if getattr(x509, "_x509", None) is None:
+        raise ImportError(
+            "'pyOpenSSL' module missing required functionality. "
+            "Try upgrading to v0.14 or newer."
+        )
+
+
+def _dnsname_to_stdlib(name):
+    """
+    Converts a dNSName SubjectAlternativeName field to the form used by the
+    standard library on the given Python version.
+
+    Cryptography produces a dNSName as a unicode string that was idna-decoded
+    from ASCII bytes. We need to idna-encode that string to get it back, and
+    then on Python 3 we also need to convert to unicode via UTF-8 (the stdlib
+    uses PyUnicode_FromStringAndSize on it, which decodes via UTF-8).
+
+    If the name cannot be idna-encoded then we return None signalling that
+    the name given should be skipped.
+    """
+
+    def idna_encode(name):
+        """
+        Borrowed wholesale from the Python Cryptography Project. It turns out
+        that we can't just safely call `idna.encode`: it can explode for
+        wildcard names. This avoids that problem.
+        """
+        from pip._vendor import idna
+
+        try:
+            for prefix in [u"*.", u"."]:
+                if name.startswith(prefix):
+                    name = name[len(prefix) :]
+                    return prefix.encode("ascii") + idna.encode(name)
+            return idna.encode(name)
+        except idna.core.IDNAError:
+            return None
+
+    # Don't send IPv6 addresses through the IDNA encoder.
+    if ":" in name:
+        return name
+
+    name = idna_encode(name)
+    if name is None:
+        return None
+    elif sys.version_info >= (3, 0):
+        name = name.decode("utf-8")
+    return name
+
+
+def get_subj_alt_name(peer_cert):
+    """
+    Given an PyOpenSSL certificate, provides all the subject alternative names.
+    """
+    # Pass the cert to cryptography, which has much better APIs for this.
+    if hasattr(peer_cert, "to_cryptography"):
+        cert = peer_cert.to_cryptography()
+    else:
+        # This is technically using private APIs, but should work across all
+        # relevant versions before PyOpenSSL got a proper API for this.
+        cert = _Certificate(openssl_backend, peer_cert._x509)
+
+    # We want to find the SAN extension. Ask Cryptography to locate it (it's
+    # faster than looping in Python)
+    try:
+        ext = cert.extensions.get_extension_for_class(x509.SubjectAlternativeName).value
+    except x509.ExtensionNotFound:
+        # No such extension, return the empty list.
+        return []
+    except (
+        x509.DuplicateExtension,
+        UnsupportedExtension,
+        x509.UnsupportedGeneralNameType,
+        UnicodeError,
+    ) as e:
+        # A problem has been found with the quality of the certificate. Assume
+        # no SAN field is present.
+        log.warning(
+            "A problem was encountered with the certificate that prevented "
+            "urllib3 from finding the SubjectAlternativeName field. This can "
+            "affect certificate validation. The error was %s",
+            e,
+        )
+        return []
+
+    # We want to return dNSName and iPAddress fields. We need to cast the IPs
+    # back to strings because the match_hostname function wants them as
+    # strings.
+    # Sadly the DNS names need to be idna encoded and then, on Python 3, UTF-8
+    # decoded. This is pretty frustrating, but that's what the standard library
+    # does with certificates, and so we need to attempt to do the same.
+    # We also want to skip over names which cannot be idna encoded.
+    names = [
+        ("DNS", name)
+        for name in map(_dnsname_to_stdlib, ext.get_values_for_type(x509.DNSName))
+        if name is not None
+    ]
+    names.extend(
+        ("IP Address", str(name)) for name in ext.get_values_for_type(x509.IPAddress)
+    )
+
+    return names
+
+
+class WrappedSocket(object):
+    """API-compatibility wrapper for Python OpenSSL's Connection-class.
+
+    Note: _makefile_refs, _drop() and _reuse() are needed for the garbage
+    collector of pypy.
+    """
+
+    def __init__(self, connection, socket, suppress_ragged_eofs=True):
+        self.connection = connection
+        self.socket = socket
+        self.suppress_ragged_eofs = suppress_ragged_eofs
+        self._makefile_refs = 0
+        self._closed = False
+
+    def fileno(self):
+        return self.socket.fileno()
+
+    # Copy-pasted from Python 3.5 source code
+    def _decref_socketios(self):
+        if self._makefile_refs > 0:
+            self._makefile_refs -= 1
+        if self._closed:
+            self.close()
+
+    def recv(self, *args, **kwargs):
+        try:
+            data = self.connection.recv(*args, **kwargs)
+        except OpenSSL.SSL.SysCallError as e:
+            if self.suppress_ragged_eofs and e.args == (-1, "Unexpected EOF"):
+                return b""
+            else:
+                raise SocketError(str(e))
+        except OpenSSL.SSL.ZeroReturnError:
+            if self.connection.get_shutdown() == OpenSSL.SSL.RECEIVED_SHUTDOWN:
+                return b""
+            else:
+                raise
+        except OpenSSL.SSL.WantReadError:
+            if not util.wait_for_read(self.socket, self.socket.gettimeout()):
+                raise timeout("The read operation timed out")
+            else:
+                return self.recv(*args, **kwargs)
+
+        # TLS 1.3 post-handshake authentication
+        except OpenSSL.SSL.Error as e:
+            raise ssl.SSLError("read error: %r" % e)
+        else:
+            return data
+
+    def recv_into(self, *args, **kwargs):
+        try:
+            return self.connection.recv_into(*args, **kwargs)
+        except OpenSSL.SSL.SysCallError as e:
+            if self.suppress_ragged_eofs and e.args == (-1, "Unexpected EOF"):
+                return 0
+            else:
+                raise SocketError(str(e))
+        except OpenSSL.SSL.ZeroReturnError:
+            if self.connection.get_shutdown() == OpenSSL.SSL.RECEIVED_SHUTDOWN:
+                return 0
+            else:
+                raise
+        except OpenSSL.SSL.WantReadError:
+            if not util.wait_for_read(self.socket, self.socket.gettimeout()):
+                raise timeout("The read operation timed out")
+            else:
+                return self.recv_into(*args, **kwargs)
+
+        # TLS 1.3 post-handshake authentication
+        except OpenSSL.SSL.Error as e:
+            raise ssl.SSLError("read error: %r" % e)
+
+    def settimeout(self, timeout):
+        return self.socket.settimeout(timeout)
+
+    def _send_until_done(self, data):
+        while True:
+            try:
+                return self.connection.send(data)
+            except OpenSSL.SSL.WantWriteError:
+                if not util.wait_for_write(self.socket, self.socket.gettimeout()):
+                    raise timeout()
+                continue
+            except OpenSSL.SSL.SysCallError as e:
+                raise SocketError(str(e))
+
+    def sendall(self, data):
+        total_sent = 0
+        while total_sent < len(data):
+            sent = self._send_until_done(
+                data[total_sent : total_sent + SSL_WRITE_BLOCKSIZE]
+            )
+            total_sent += sent
+
+    def shutdown(self):
+        # FIXME rethrow compatible exceptions should we ever use this
+        self.connection.shutdown()
+
+    def close(self):
+        if self._makefile_refs < 1:
+            try:
+                self._closed = True
+                return self.connection.close()
+            except OpenSSL.SSL.Error:
+                return
+        else:
+            self._makefile_refs -= 1
+
+    def getpeercert(self, binary_form=False):
+        x509 = self.connection.get_peer_certificate()
+
+        if not x509:
+            return x509
+
+        if binary_form:
+            return OpenSSL.crypto.dump_certificate(OpenSSL.crypto.FILETYPE_ASN1, x509)
+
+        return {
+            "subject": ((("commonName", x509.get_subject().CN),),),
+            "subjectAltName": get_subj_alt_name(x509),
+        }
+
+    def version(self):
+        return self.connection.get_protocol_version_name()
+
+    def _reuse(self):
+        self._makefile_refs += 1
+
+    def _drop(self):
+        if self._makefile_refs < 1:
+            self.close()
+        else:
+            self._makefile_refs -= 1
+
+
+if _fileobject:  # Platform-specific: Python 2
+
+    def makefile(self, mode, bufsize=-1):
+        self._makefile_refs += 1
+        return _fileobject(self, mode, bufsize, close=True)
+
+
+else:  # Platform-specific: Python 3
+    makefile = backport_makefile
+
+WrappedSocket.makefile = makefile
+
+
+class PyOpenSSLContext(object):
+    """
+    I am a wrapper class for the PyOpenSSL ``Context`` object. I am responsible
+    for translating the interface of the standard library ``SSLContext`` object
+    to calls into PyOpenSSL.
+    """
+
+    def __init__(self, protocol):
+        self.protocol = _openssl_versions[protocol]
+        self._ctx = OpenSSL.SSL.Context(self.protocol)
+        self._options = 0
+        self.check_hostname = False
+
+    @property
+    def options(self):
+        return self._options
+
+    @options.setter
+    def options(self, value):
+        self._options = value
+        self._ctx.set_options(value)
+
+    @property
+    def verify_mode(self):
+        return _openssl_to_stdlib_verify[self._ctx.get_verify_mode()]
+
+    @verify_mode.setter
+    def verify_mode(self, value):
+        self._ctx.set_verify(_stdlib_to_openssl_verify[value], _verify_callback)
+
+    def set_default_verify_paths(self):
+        self._ctx.set_default_verify_paths()
+
+    def set_ciphers(self, ciphers):
+        if isinstance(ciphers, six.text_type):
+            ciphers = ciphers.encode("utf-8")
+        self._ctx.set_cipher_list(ciphers)
+
+    def load_verify_locations(self, cafile=None, capath=None, cadata=None):
+        if cafile is not None:
+            cafile = cafile.encode("utf-8")
+        if capath is not None:
+            capath = capath.encode("utf-8")
+        try:
+            self._ctx.load_verify_locations(cafile, capath)
+            if cadata is not None:
+                self._ctx.load_verify_locations(BytesIO(cadata))
+        except OpenSSL.SSL.Error as e:
+            raise ssl.SSLError("unable to load trusted certificates: %r" % e)
+
+    def load_cert_chain(self, certfile, keyfile=None, password=None):
+        self._ctx.use_certificate_chain_file(certfile)
+        if password is not None:
+            if not isinstance(password, six.binary_type):
+                password = password.encode("utf-8")
+            self._ctx.set_passwd_cb(lambda *_: password)
+        self._ctx.use_privatekey_file(keyfile or certfile)
+
+    def wrap_socket(
+        self,
+        sock,
+        server_side=False,
+        do_handshake_on_connect=True,
+        suppress_ragged_eofs=True,
+        server_hostname=None,
+    ):
+        cnx = OpenSSL.SSL.Connection(self._ctx, sock)
+
+        if isinstance(server_hostname, six.text_type):  # Platform-specific: Python 3
+            server_hostname = server_hostname.encode("utf-8")
+
+        if server_hostname is not None:
+            cnx.set_tlsext_host_name(server_hostname)
+
+        cnx.set_connect_state()
+
+        while True:
+            try:
+                cnx.do_handshake()
+            except OpenSSL.SSL.WantReadError:
+                if not util.wait_for_read(sock, sock.gettimeout()):
+                    raise timeout("select timed out")
+                continue
+            except OpenSSL.SSL.Error as e:
+                raise ssl.SSLError("bad handshake: %r" % e)
+            break
+
+        return WrappedSocket(cnx, sock)
+
+
+def _verify_callback(cnx, x509, err_no, err_depth, return_code):
+    return err_no == 0
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/securetransport.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/securetransport.py
new file mode 100644
index 000000000..a6b7e94ad
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/securetransport.py
@@ -0,0 +1,864 @@
+"""
+SecureTranport support for urllib3 via ctypes.
+
+This makes platform-native TLS available to urllib3 users on macOS without the
+use of a compiler. This is an important feature because the Python Package
+Index is moving to become a TLSv1.2-or-higher server, and the default OpenSSL
+that ships with macOS is not capable of doing TLSv1.2. The only way to resolve
+this is to give macOS users an alternative solution to the problem, and that
+solution is to use SecureTransport.
+
+We use ctypes here because this solution must not require a compiler. That's
+because pip is not allowed to require a compiler either.
+
+This is not intended to be a seriously long-term solution to this problem.
+The hope is that PEP 543 will eventually solve this issue for us, at which
+point we can retire this contrib module. But in the short term, we need to
+solve the impending tire fire that is Python on Mac without this kind of
+contrib module. So...here we are.
+
+To use this module, simply import and inject it::
+
+    import urllib3.contrib.securetransport
+    urllib3.contrib.securetransport.inject_into_urllib3()
+
+Happy TLSing!
+
+This code is a bastardised version of the code found in Will Bond's oscrypto
+library. An enormous debt is owed to him for blazing this trail for us. For
+that reason, this code should be considered to be covered both by urllib3's
+license and by oscrypto's:
+
+    Copyright (c) 2015-2016 Will Bond <will@wbond.net>
+
+    Permission is hereby granted, free of charge, to any person obtaining a
+    copy of this software and associated documentation files (the "Software"),
+    to deal in the Software without restriction, including without limitation
+    the rights to use, copy, modify, merge, publish, distribute, sublicense,
+    and/or sell copies of the Software, and to permit persons to whom the
+    Software is furnished to do so, subject to the following conditions:
+
+    The above copyright notice and this permission notice shall be included in
+    all copies or substantial portions of the Software.
+
+    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+    AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+    DEALINGS IN THE SOFTWARE.
+"""
+from __future__ import absolute_import
+
+import contextlib
+import ctypes
+import errno
+import os.path
+import shutil
+import socket
+import ssl
+import threading
+import weakref
+
+from .. import util
+from ._securetransport.bindings import Security, SecurityConst, CoreFoundation
+from ._securetransport.low_level import (
+    _assert_no_error,
+    _cert_array_from_pem,
+    _temporary_keychain,
+    _load_client_cert_chain,
+)
+
+try:  # Platform-specific: Python 2
+    from socket import _fileobject
+except ImportError:  # Platform-specific: Python 3
+    _fileobject = None
+    from ..packages.backports.makefile import backport_makefile
+
+__all__ = ["inject_into_urllib3", "extract_from_urllib3"]
+
+# SNI always works
+HAS_SNI = True
+
+orig_util_HAS_SNI = util.HAS_SNI
+orig_util_SSLContext = util.ssl_.SSLContext
+
+# This dictionary is used by the read callback to obtain a handle to the
+# calling wrapped socket. This is a pretty silly approach, but for now it'll
+# do. I feel like I should be able to smuggle a handle to the wrapped socket
+# directly in the SSLConnectionRef, but for now this approach will work I
+# guess.
+#
+# We need to lock around this structure for inserts, but we don't do it for
+# reads/writes in the callbacks. The reasoning here goes as follows:
+#
+#    1. It is not possible to call into the callbacks before the dictionary is
+#       populated, so once in the callback the id must be in the dictionary.
+#    2. The callbacks don't mutate the dictionary, they only read from it, and
+#       so cannot conflict with any of the insertions.
+#
+# This is good: if we had to lock in the callbacks we'd drastically slow down
+# the performance of this code.
+_connection_refs = weakref.WeakValueDictionary()
+_connection_ref_lock = threading.Lock()
+
+# Limit writes to 16kB. This is OpenSSL's limit, but we'll cargo-cult it over
+# for no better reason than we need *a* limit, and this one is right there.
+SSL_WRITE_BLOCKSIZE = 16384
+
+# This is our equivalent of util.ssl_.DEFAULT_CIPHERS, but expanded out to
+# individual cipher suites. We need to do this because this is how
+# SecureTransport wants them.
+CIPHER_SUITES = [
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_GCM_SHA384,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_GCM_SHA256,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_GCM_SHA384,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_GCM_SHA256,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_CHACHA20_POLY1305_SHA256,
+    SecurityConst.TLS_ECDHE_RSA_WITH_CHACHA20_POLY1305_SHA256,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_256_GCM_SHA384,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_128_GCM_SHA256,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA384,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_256_CBC_SHA,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA256,
+    SecurityConst.TLS_ECDHE_ECDSA_WITH_AES_128_CBC_SHA,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA384,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_256_CBC_SHA,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA256,
+    SecurityConst.TLS_ECDHE_RSA_WITH_AES_128_CBC_SHA,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_256_CBC_SHA256,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_256_CBC_SHA,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_128_CBC_SHA256,
+    SecurityConst.TLS_DHE_RSA_WITH_AES_128_CBC_SHA,
+    SecurityConst.TLS_AES_256_GCM_SHA384,
+    SecurityConst.TLS_AES_128_GCM_SHA256,
+    SecurityConst.TLS_RSA_WITH_AES_256_GCM_SHA384,
+    SecurityConst.TLS_RSA_WITH_AES_128_GCM_SHA256,
+    SecurityConst.TLS_AES_128_CCM_8_SHA256,
+    SecurityConst.TLS_AES_128_CCM_SHA256,
+    SecurityConst.TLS_RSA_WITH_AES_256_CBC_SHA256,
+    SecurityConst.TLS_RSA_WITH_AES_128_CBC_SHA256,
+    SecurityConst.TLS_RSA_WITH_AES_256_CBC_SHA,
+    SecurityConst.TLS_RSA_WITH_AES_128_CBC_SHA,
+]
+
+# Basically this is simple: for PROTOCOL_SSLv23 we turn it into a low of
+# TLSv1 and a high of TLSv1.2. For everything else, we pin to that version.
+# TLSv1 to 1.2 are supported on macOS 10.8+
+_protocol_to_min_max = {
+    util.PROTOCOL_TLS: (SecurityConst.kTLSProtocol1, SecurityConst.kTLSProtocol12)
+}
+
+if hasattr(ssl, "PROTOCOL_SSLv2"):
+    _protocol_to_min_max[ssl.PROTOCOL_SSLv2] = (
+        SecurityConst.kSSLProtocol2,
+        SecurityConst.kSSLProtocol2,
+    )
+if hasattr(ssl, "PROTOCOL_SSLv3"):
+    _protocol_to_min_max[ssl.PROTOCOL_SSLv3] = (
+        SecurityConst.kSSLProtocol3,
+        SecurityConst.kSSLProtocol3,
+    )
+if hasattr(ssl, "PROTOCOL_TLSv1"):
+    _protocol_to_min_max[ssl.PROTOCOL_TLSv1] = (
+        SecurityConst.kTLSProtocol1,
+        SecurityConst.kTLSProtocol1,
+    )
+if hasattr(ssl, "PROTOCOL_TLSv1_1"):
+    _protocol_to_min_max[ssl.PROTOCOL_TLSv1_1] = (
+        SecurityConst.kTLSProtocol11,
+        SecurityConst.kTLSProtocol11,
+    )
+if hasattr(ssl, "PROTOCOL_TLSv1_2"):
+    _protocol_to_min_max[ssl.PROTOCOL_TLSv1_2] = (
+        SecurityConst.kTLSProtocol12,
+        SecurityConst.kTLSProtocol12,
+    )
+
+
+def inject_into_urllib3():
+    """
+    Monkey-patch urllib3 with SecureTransport-backed SSL-support.
+    """
+    util.SSLContext = SecureTransportContext
+    util.ssl_.SSLContext = SecureTransportContext
+    util.HAS_SNI = HAS_SNI
+    util.ssl_.HAS_SNI = HAS_SNI
+    util.IS_SECURETRANSPORT = True
+    util.ssl_.IS_SECURETRANSPORT = True
+
+
+def extract_from_urllib3():
+    """
+    Undo monkey-patching by :func:`inject_into_urllib3`.
+    """
+    util.SSLContext = orig_util_SSLContext
+    util.ssl_.SSLContext = orig_util_SSLContext
+    util.HAS_SNI = orig_util_HAS_SNI
+    util.ssl_.HAS_SNI = orig_util_HAS_SNI
+    util.IS_SECURETRANSPORT = False
+    util.ssl_.IS_SECURETRANSPORT = False
+
+
+def _read_callback(connection_id, data_buffer, data_length_pointer):
+    """
+    SecureTransport read callback. This is called by ST to request that data
+    be returned from the socket.
+    """
+    wrapped_socket = None
+    try:
+        wrapped_socket = _connection_refs.get(connection_id)
+        if wrapped_socket is None:
+            return SecurityConst.errSSLInternal
+        base_socket = wrapped_socket.socket
+
+        requested_length = data_length_pointer[0]
+
+        timeout = wrapped_socket.gettimeout()
+        error = None
+        read_count = 0
+
+        try:
+            while read_count < requested_length:
+                if timeout is None or timeout >= 0:
+                    if not util.wait_for_read(base_socket, timeout):
+                        raise socket.error(errno.EAGAIN, "timed out")
+
+                remaining = requested_length - read_count
+                buffer = (ctypes.c_char * remaining).from_address(
+                    data_buffer + read_count
+                )
+                chunk_size = base_socket.recv_into(buffer, remaining)
+                read_count += chunk_size
+                if not chunk_size:
+                    if not read_count:
+                        return SecurityConst.errSSLClosedGraceful
+                    break
+        except (socket.error) as e:
+            error = e.errno
+
+            if error is not None and error != errno.EAGAIN:
+                data_length_pointer[0] = read_count
+                if error == errno.ECONNRESET or error == errno.EPIPE:
+                    return SecurityConst.errSSLClosedAbort
+                raise
+
+        data_length_pointer[0] = read_count
+
+        if read_count != requested_length:
+            return SecurityConst.errSSLWouldBlock
+
+        return 0
+    except Exception as e:
+        if wrapped_socket is not None:
+            wrapped_socket._exception = e
+        return SecurityConst.errSSLInternal
+
+
+def _write_callback(connection_id, data_buffer, data_length_pointer):
+    """
+    SecureTransport write callback. This is called by ST to request that data
+    actually be sent on the network.
+    """
+    wrapped_socket = None
+    try:
+        wrapped_socket = _connection_refs.get(connection_id)
+        if wrapped_socket is None:
+            return SecurityConst.errSSLInternal
+        base_socket = wrapped_socket.socket
+
+        bytes_to_write = data_length_pointer[0]
+        data = ctypes.string_at(data_buffer, bytes_to_write)
+
+        timeout = wrapped_socket.gettimeout()
+        error = None
+        sent = 0
+
+        try:
+            while sent < bytes_to_write:
+                if timeout is None or timeout >= 0:
+                    if not util.wait_for_write(base_socket, timeout):
+                        raise socket.error(errno.EAGAIN, "timed out")
+                chunk_sent = base_socket.send(data)
+                sent += chunk_sent
+
+                # This has some needless copying here, but I'm not sure there's
+                # much value in optimising this data path.
+                data = data[chunk_sent:]
+        except (socket.error) as e:
+            error = e.errno
+
+            if error is not None and error != errno.EAGAIN:
+                data_length_pointer[0] = sent
+                if error == errno.ECONNRESET or error == errno.EPIPE:
+                    return SecurityConst.errSSLClosedAbort
+                raise
+
+        data_length_pointer[0] = sent
+
+        if sent != bytes_to_write:
+            return SecurityConst.errSSLWouldBlock
+
+        return 0
+    except Exception as e:
+        if wrapped_socket is not None:
+            wrapped_socket._exception = e
+        return SecurityConst.errSSLInternal
+
+
+# We need to keep these two objects references alive: if they get GC'd while
+# in use then SecureTransport could attempt to call a function that is in freed
+# memory. That would be...uh...bad. Yeah, that's the word. Bad.
+_read_callback_pointer = Security.SSLReadFunc(_read_callback)
+_write_callback_pointer = Security.SSLWriteFunc(_write_callback)
+
+
+class WrappedSocket(object):
+    """
+    API-compatibility wrapper for Python's OpenSSL wrapped socket object.
+
+    Note: _makefile_refs, _drop(), and _reuse() are needed for the garbage
+    collector of PyPy.
+    """
+
+    def __init__(self, socket):
+        self.socket = socket
+        self.context = None
+        self._makefile_refs = 0
+        self._closed = False
+        self._exception = None
+        self._keychain = None
+        self._keychain_dir = None
+        self._client_cert_chain = None
+
+        # We save off the previously-configured timeout and then set it to
+        # zero. This is done because we use select and friends to handle the
+        # timeouts, but if we leave the timeout set on the lower socket then
+        # Python will "kindly" call select on that socket again for us. Avoid
+        # that by forcing the timeout to zero.
+        self._timeout = self.socket.gettimeout()
+        self.socket.settimeout(0)
+
+    @contextlib.contextmanager
+    def _raise_on_error(self):
+        """
+        A context manager that can be used to wrap calls that do I/O from
+        SecureTransport. If any of the I/O callbacks hit an exception, this
+        context manager will correctly propagate the exception after the fact.
+        This avoids silently swallowing those exceptions.
+
+        It also correctly forces the socket closed.
+        """
+        self._exception = None
+
+        # We explicitly don't catch around this yield because in the unlikely
+        # event that an exception was hit in the block we don't want to swallow
+        # it.
+        yield
+        if self._exception is not None:
+            exception, self._exception = self._exception, None
+            self.close()
+            raise exception
+
+    def _set_ciphers(self):
+        """
+        Sets up the allowed ciphers. By default this matches the set in
+        util.ssl_.DEFAULT_CIPHERS, at least as supported by macOS. This is done
+        custom and doesn't allow changing at this time, mostly because parsing
+        OpenSSL cipher strings is going to be a freaking nightmare.
+        """
+        ciphers = (Security.SSLCipherSuite * len(CIPHER_SUITES))(*CIPHER_SUITES)
+        result = Security.SSLSetEnabledCiphers(
+            self.context, ciphers, len(CIPHER_SUITES)
+        )
+        _assert_no_error(result)
+
+    def _custom_validate(self, verify, trust_bundle):
+        """
+        Called when we have set custom validation. We do this in two cases:
+        first, when cert validation is entirely disabled; and second, when
+        using a custom trust DB.
+        """
+        # If we disabled cert validation, just say: cool.
+        if not verify:
+            return
+
+        # We want data in memory, so load it up.
+        if os.path.isfile(trust_bundle):
+            with open(trust_bundle, "rb") as f:
+                trust_bundle = f.read()
+
+        cert_array = None
+        trust = Security.SecTrustRef()
+
+        try:
+            # Get a CFArray that contains the certs we want.
+            cert_array = _cert_array_from_pem(trust_bundle)
+
+            # Ok, now the hard part. We want to get the SecTrustRef that ST has
+            # created for this connection, shove our CAs into it, tell ST to
+            # ignore everything else it knows, and then ask if it can build a
+            # chain. This is a buuuunch of code.
+            result = Security.SSLCopyPeerTrust(self.context, ctypes.byref(trust))
+            _assert_no_error(result)
+            if not trust:
+                raise ssl.SSLError("Failed to copy trust reference")
+
+            result = Security.SecTrustSetAnchorCertificates(trust, cert_array)
+            _assert_no_error(result)
+
+            result = Security.SecTrustSetAnchorCertificatesOnly(trust, True)
+            _assert_no_error(result)
+
+            trust_result = Security.SecTrustResultType()
+            result = Security.SecTrustEvaluate(trust, ctypes.byref(trust_result))
+            _assert_no_error(result)
+        finally:
+            if trust:
+                CoreFoundation.CFRelease(trust)
+
+            if cert_array is not None:
+                CoreFoundation.CFRelease(cert_array)
+
+        # Ok, now we can look at what the result was.
+        successes = (
+            SecurityConst.kSecTrustResultUnspecified,
+            SecurityConst.kSecTrustResultProceed,
+        )
+        if trust_result.value not in successes:
+            raise ssl.SSLError(
+                "certificate verify failed, error code: %d" % trust_result.value
+            )
+
+    def handshake(
+        self,
+        server_hostname,
+        verify,
+        trust_bundle,
+        min_version,
+        max_version,
+        client_cert,
+        client_key,
+        client_key_passphrase,
+    ):
+        """
+        Actually performs the TLS handshake. This is run automatically by
+        wrapped socket, and shouldn't be needed in user code.
+        """
+        # First, we do the initial bits of connection setup. We need to create
+        # a context, set its I/O funcs, and set the connection reference.
+        self.context = Security.SSLCreateContext(
+            None, SecurityConst.kSSLClientSide, SecurityConst.kSSLStreamType
+        )
+        result = Security.SSLSetIOFuncs(
+            self.context, _read_callback_pointer, _write_callback_pointer
+        )
+        _assert_no_error(result)
+
+        # Here we need to compute the handle to use. We do this by taking the
+        # id of self modulo 2**31 - 1. If this is already in the dictionary, we
+        # just keep incrementing by one until we find a free space.
+        with _connection_ref_lock:
+            handle = id(self) % 2147483647
+            while handle in _connection_refs:
+                handle = (handle + 1) % 2147483647
+            _connection_refs[handle] = self
+
+        result = Security.SSLSetConnection(self.context, handle)
+        _assert_no_error(result)
+
+        # If we have a server hostname, we should set that too.
+        if server_hostname:
+            if not isinstance(server_hostname, bytes):
+                server_hostname = server_hostname.encode("utf-8")
+
+            result = Security.SSLSetPeerDomainName(
+                self.context, server_hostname, len(server_hostname)
+            )
+            _assert_no_error(result)
+
+        # Setup the ciphers.
+        self._set_ciphers()
+
+        # Set the minimum and maximum TLS versions.
+        result = Security.SSLSetProtocolVersionMin(self.context, min_version)
+        _assert_no_error(result)
+
+        result = Security.SSLSetProtocolVersionMax(self.context, max_version)
+        _assert_no_error(result)
+
+        # If there's a trust DB, we need to use it. We do that by telling
+        # SecureTransport to break on server auth. We also do that if we don't
+        # want to validate the certs at all: we just won't actually do any
+        # authing in that case.
+        if not verify or trust_bundle is not None:
+            result = Security.SSLSetSessionOption(
+                self.context, SecurityConst.kSSLSessionOptionBreakOnServerAuth, True
+            )
+            _assert_no_error(result)
+
+        # If there's a client cert, we need to use it.
+        if client_cert:
+            self._keychain, self._keychain_dir = _temporary_keychain()
+            self._client_cert_chain = _load_client_cert_chain(
+                self._keychain, client_cert, client_key
+            )
+            result = Security.SSLSetCertificate(self.context, self._client_cert_chain)
+            _assert_no_error(result)
+
+        while True:
+            with self._raise_on_error():
+                result = Security.SSLHandshake(self.context)
+
+                if result == SecurityConst.errSSLWouldBlock:
+                    raise socket.timeout("handshake timed out")
+                elif result == SecurityConst.errSSLServerAuthCompleted:
+                    self._custom_validate(verify, trust_bundle)
+                    continue
+                else:
+                    _assert_no_error(result)
+                    break
+
+    def fileno(self):
+        return self.socket.fileno()
+
+    # Copy-pasted from Python 3.5 source code
+    def _decref_socketios(self):
+        if self._makefile_refs > 0:
+            self._makefile_refs -= 1
+        if self._closed:
+            self.close()
+
+    def recv(self, bufsiz):
+        buffer = ctypes.create_string_buffer(bufsiz)
+        bytes_read = self.recv_into(buffer, bufsiz)
+        data = buffer[:bytes_read]
+        return data
+
+    def recv_into(self, buffer, nbytes=None):
+        # Read short on EOF.
+        if self._closed:
+            return 0
+
+        if nbytes is None:
+            nbytes = len(buffer)
+
+        buffer = (ctypes.c_char * nbytes).from_buffer(buffer)
+        processed_bytes = ctypes.c_size_t(0)
+
+        with self._raise_on_error():
+            result = Security.SSLRead(
+                self.context, buffer, nbytes, ctypes.byref(processed_bytes)
+            )
+
+        # There are some result codes that we want to treat as "not always
+        # errors". Specifically, those are errSSLWouldBlock,
+        # errSSLClosedGraceful, and errSSLClosedNoNotify.
+        if result == SecurityConst.errSSLWouldBlock:
+            # If we didn't process any bytes, then this was just a time out.
+            # However, we can get errSSLWouldBlock in situations when we *did*
+            # read some data, and in those cases we should just read "short"
+            # and return.
+            if processed_bytes.value == 0:
+                # Timed out, no data read.
+                raise socket.timeout("recv timed out")
+        elif result in (
+            SecurityConst.errSSLClosedGraceful,
+            SecurityConst.errSSLClosedNoNotify,
+        ):
+            # The remote peer has closed this connection. We should do so as
+            # well. Note that we don't actually return here because in
+            # principle this could actually be fired along with return data.
+            # It's unlikely though.
+            self.close()
+        else:
+            _assert_no_error(result)
+
+        # Ok, we read and probably succeeded. We should return whatever data
+        # was actually read.
+        return processed_bytes.value
+
+    def settimeout(self, timeout):
+        self._timeout = timeout
+
+    def gettimeout(self):
+        return self._timeout
+
+    def send(self, data):
+        processed_bytes = ctypes.c_size_t(0)
+
+        with self._raise_on_error():
+            result = Security.SSLWrite(
+                self.context, data, len(data), ctypes.byref(processed_bytes)
+            )
+
+        if result == SecurityConst.errSSLWouldBlock and processed_bytes.value == 0:
+            # Timed out
+            raise socket.timeout("send timed out")
+        else:
+            _assert_no_error(result)
+
+        # We sent, and probably succeeded. Tell them how much we sent.
+        return processed_bytes.value
+
+    def sendall(self, data):
+        total_sent = 0
+        while total_sent < len(data):
+            sent = self.send(data[total_sent : total_sent + SSL_WRITE_BLOCKSIZE])
+            total_sent += sent
+
+    def shutdown(self):
+        with self._raise_on_error():
+            Security.SSLClose(self.context)
+
+    def close(self):
+        # TODO: should I do clean shutdown here? Do I have to?
+        if self._makefile_refs < 1:
+            self._closed = True
+            if self.context:
+                CoreFoundation.CFRelease(self.context)
+                self.context = None
+            if self._client_cert_chain:
+                CoreFoundation.CFRelease(self._client_cert_chain)
+                self._client_cert_chain = None
+            if self._keychain:
+                Security.SecKeychainDelete(self._keychain)
+                CoreFoundation.CFRelease(self._keychain)
+                shutil.rmtree(self._keychain_dir)
+                self._keychain = self._keychain_dir = None
+            return self.socket.close()
+        else:
+            self._makefile_refs -= 1
+
+    def getpeercert(self, binary_form=False):
+        # Urgh, annoying.
+        #
+        # Here's how we do this:
+        #
+        # 1. Call SSLCopyPeerTrust to get hold of the trust object for this
+        #    connection.
+        # 2. Call SecTrustGetCertificateAtIndex for index 0 to get the leaf.
+        # 3. To get the CN, call SecCertificateCopyCommonName and process that
+        #    string so that it's of the appropriate type.
+        # 4. To get the SAN, we need to do something a bit more complex:
+        #    a. Call SecCertificateCopyValues to get the data, requesting
+        #       kSecOIDSubjectAltName.
+        #    b. Mess about with this dictionary to try to get the SANs out.
+        #
+        # This is gross. Really gross. It's going to be a few hundred LoC extra
+        # just to repeat something that SecureTransport can *already do*. So my
+        # operating assumption at this time is that what we want to do is
+        # instead to just flag to urllib3 that it shouldn't do its own hostname
+        # validation when using SecureTransport.
+        if not binary_form:
+            raise ValueError("SecureTransport only supports dumping binary certs")
+        trust = Security.SecTrustRef()
+        certdata = None
+        der_bytes = None
+
+        try:
+            # Grab the trust store.
+            result = Security.SSLCopyPeerTrust(self.context, ctypes.byref(trust))
+            _assert_no_error(result)
+            if not trust:
+                # Probably we haven't done the handshake yet. No biggie.
+                return None
+
+            cert_count = Security.SecTrustGetCertificateCount(trust)
+            if not cert_count:
+                # Also a case that might happen if we haven't handshaked.
+                # Handshook? Handshaken?
+                return None
+
+            leaf = Security.SecTrustGetCertificateAtIndex(trust, 0)
+            assert leaf
+
+            # Ok, now we want the DER bytes.
+            certdata = Security.SecCertificateCopyData(leaf)
+            assert certdata
+
+            data_length = CoreFoundation.CFDataGetLength(certdata)
+            data_buffer = CoreFoundation.CFDataGetBytePtr(certdata)
+            der_bytes = ctypes.string_at(data_buffer, data_length)
+        finally:
+            if certdata:
+                CoreFoundation.CFRelease(certdata)
+            if trust:
+                CoreFoundation.CFRelease(trust)
+
+        return der_bytes
+
+    def version(self):
+        protocol = Security.SSLProtocol()
+        result = Security.SSLGetNegotiatedProtocolVersion(
+            self.context, ctypes.byref(protocol)
+        )
+        _assert_no_error(result)
+        if protocol.value == SecurityConst.kTLSProtocol13:
+            raise ssl.SSLError("SecureTransport does not support TLS 1.3")
+        elif protocol.value == SecurityConst.kTLSProtocol12:
+            return "TLSv1.2"
+        elif protocol.value == SecurityConst.kTLSProtocol11:
+            return "TLSv1.1"
+        elif protocol.value == SecurityConst.kTLSProtocol1:
+            return "TLSv1"
+        elif protocol.value == SecurityConst.kSSLProtocol3:
+            return "SSLv3"
+        elif protocol.value == SecurityConst.kSSLProtocol2:
+            return "SSLv2"
+        else:
+            raise ssl.SSLError("Unknown TLS version: %r" % protocol)
+
+    def _reuse(self):
+        self._makefile_refs += 1
+
+    def _drop(self):
+        if self._makefile_refs < 1:
+            self.close()
+        else:
+            self._makefile_refs -= 1
+
+
+if _fileobject:  # Platform-specific: Python 2
+
+    def makefile(self, mode, bufsize=-1):
+        self._makefile_refs += 1
+        return _fileobject(self, mode, bufsize, close=True)
+
+
+else:  # Platform-specific: Python 3
+
+    def makefile(self, mode="r", buffering=None, *args, **kwargs):
+        # We disable buffering with SecureTransport because it conflicts with
+        # the buffering that ST does internally (see issue #1153 for more).
+        buffering = 0
+        return backport_makefile(self, mode, buffering, *args, **kwargs)
+
+
+WrappedSocket.makefile = makefile
+
+
+class SecureTransportContext(object):
+    """
+    I am a wrapper class for the SecureTransport library, to translate the
+    interface of the standard library ``SSLContext`` object to calls into
+    SecureTransport.
+    """
+
+    def __init__(self, protocol):
+        self._min_version, self._max_version = _protocol_to_min_max[protocol]
+        self._options = 0
+        self._verify = False
+        self._trust_bundle = None
+        self._client_cert = None
+        self._client_key = None
+        self._client_key_passphrase = None
+
+    @property
+    def check_hostname(self):
+        """
+        SecureTransport cannot have its hostname checking disabled. For more,
+        see the comment on getpeercert() in this file.
+        """
+        return True
+
+    @check_hostname.setter
+    def check_hostname(self, value):
+        """
+        SecureTransport cannot have its hostname checking disabled. For more,
+        see the comment on getpeercert() in this file.
+        """
+        pass
+
+    @property
+    def options(self):
+        # TODO: Well, crap.
+        #
+        # So this is the bit of the code that is the most likely to cause us
+        # trouble. Essentially we need to enumerate all of the SSL options that
+        # users might want to use and try to see if we can sensibly translate
+        # them, or whether we should just ignore them.
+        return self._options
+
+    @options.setter
+    def options(self, value):
+        # TODO: Update in line with above.
+        self._options = value
+
+    @property
+    def verify_mode(self):
+        return ssl.CERT_REQUIRED if self._verify else ssl.CERT_NONE
+
+    @verify_mode.setter
+    def verify_mode(self, value):
+        self._verify = True if value == ssl.CERT_REQUIRED else False
+
+    def set_default_verify_paths(self):
+        # So, this has to do something a bit weird. Specifically, what it does
+        # is nothing.
+        #
+        # This means that, if we had previously had load_verify_locations
+        # called, this does not undo that. We need to do that because it turns
+        # out that the rest of the urllib3 code will attempt to load the
+        # default verify paths if it hasn't been told about any paths, even if
+        # the context itself was sometime earlier. We resolve that by just
+        # ignoring it.
+        pass
+
+    def load_default_certs(self):
+        return self.set_default_verify_paths()
+
+    def set_ciphers(self, ciphers):
+        # For now, we just require the default cipher string.
+        if ciphers != util.ssl_.DEFAULT_CIPHERS:
+            raise ValueError("SecureTransport doesn't support custom cipher strings")
+
+    def load_verify_locations(self, cafile=None, capath=None, cadata=None):
+        # OK, we only really support cadata and cafile.
+        if capath is not None:
+            raise ValueError("SecureTransport does not support cert directories")
+
+        # Raise if cafile does not exist.
+        if cafile is not None:
+            with open(cafile):
+                pass
+
+        self._trust_bundle = cafile or cadata
+
+    def load_cert_chain(self, certfile, keyfile=None, password=None):
+        self._client_cert = certfile
+        self._client_key = keyfile
+        self._client_cert_passphrase = password
+
+    def wrap_socket(
+        self,
+        sock,
+        server_side=False,
+        do_handshake_on_connect=True,
+        suppress_ragged_eofs=True,
+        server_hostname=None,
+    ):
+        # So, what do we do here? Firstly, we assert some properties. This is a
+        # stripped down shim, so there is some functionality we don't support.
+        # See PEP 543 for the real deal.
+        assert not server_side
+        assert do_handshake_on_connect
+        assert suppress_ragged_eofs
+
+        # Ok, we're good to go. Now we want to create the wrapped socket object
+        # and store it in the appropriate place.
+        wrapped_socket = WrappedSocket(sock)
+
+        # Now we can handshake
+        wrapped_socket.handshake(
+            server_hostname,
+            self._verify,
+            self._trust_bundle,
+            self._min_version,
+            self._max_version,
+            self._client_cert,
+            self._client_key,
+            self._client_key_passphrase,
+        )
+        return wrapped_socket
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/socks.py b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/socks.py
new file mode 100644
index 000000000..9e97f7aa9
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/contrib/socks.py
@@ -0,0 +1,210 @@
+# -*- coding: utf-8 -*-
+"""
+This module contains provisional support for SOCKS proxies from within
+urllib3. This module supports SOCKS4, SOCKS4A (an extension of SOCKS4), and
+SOCKS5. To enable its functionality, either install PySocks or install this
+module with the ``socks`` extra.
+
+The SOCKS implementation supports the full range of urllib3 features. It also
+supports the following SOCKS features:
+
+- SOCKS4A (``proxy_url='socks4a://...``)
+- SOCKS4 (``proxy_url='socks4://...``)
+- SOCKS5 with remote DNS (``proxy_url='socks5h://...``)
+- SOCKS5 with local DNS (``proxy_url='socks5://...``)
+- Usernames and passwords for the SOCKS proxy
+
+ .. note::
+    It is recommended to use ``socks5h://`` or ``socks4a://`` schemes in
+    your ``proxy_url`` to ensure that DNS resolution is done from the remote
+    server instead of client-side when connecting to a domain name.
+
+SOCKS4 supports IPv4 and domain names with the SOCKS4A extension. SOCKS5
+supports IPv4, IPv6, and domain names.
+
+When connecting to a SOCKS4 proxy the ``username`` portion of the ``proxy_url``
+will be sent as the ``userid`` section of the SOCKS request::
+
+    proxy_url="socks4a://<userid>@proxy-host"
+
+When connecting to a SOCKS5 proxy the ``username`` and ``password`` portion
+of the ``proxy_url`` will be sent as the username/password to authenticate
+with the proxy::
+
+    proxy_url="socks5h://<username>:<password>@proxy-host"
+
+"""
+from __future__ import absolute_import
+
+try:
+    import socks
+except ImportError:
+    import warnings
+    from ..exceptions import DependencyWarning
+
+    warnings.warn(
+        (
+            "SOCKS support in urllib3 requires the installation of optional "
+            "dependencies: specifically, PySocks.  For more information, see "
+            "https://urllib3.readthedocs.io/en/latest/contrib.html#socks-proxies"
+        ),
+        DependencyWarning,
+    )
+    raise
+
+from socket import error as SocketError, timeout as SocketTimeout
+
+from ..connection import HTTPConnection, HTTPSConnection
+from ..connectionpool import HTTPConnectionPool, HTTPSConnectionPool
+from ..exceptions import ConnectTimeoutError, NewConnectionError
+from ..poolmanager import PoolManager
+from ..util.url import parse_url
+
+try:
+    import ssl
+except ImportError:
+    ssl = None
+
+
+class SOCKSConnection(HTTPConnection):
+    """
+    A plain-text HTTP connection that connects via a SOCKS proxy.
+    """
+
+    def __init__(self, *args, **kwargs):
+        self._socks_options = kwargs.pop("_socks_options")
+        super(SOCKSConnection, self).__init__(*args, **kwargs)
+
+    def _new_conn(self):
+        """
+        Establish a new connection via the SOCKS proxy.
+        """
+        extra_kw = {}
+        if self.source_address:
+            extra_kw["source_address"] = self.source_address
+
+        if self.socket_options:
+            extra_kw["socket_options"] = self.socket_options
+
+        try:
+            conn = socks.create_connection(
+                (self.host, self.port),
+                proxy_type=self._socks_options["socks_version"],
+                proxy_addr=self._socks_options["proxy_host"],
+                proxy_port=self._socks_options["proxy_port"],
+                proxy_username=self._socks_options["username"],
+                proxy_password=self._socks_options["password"],
+                proxy_rdns=self._socks_options["rdns"],
+                timeout=self.timeout,
+                **extra_kw
+            )
+
+        except SocketTimeout:
+            raise ConnectTimeoutError(
+                self,
+                "Connection to %s timed out. (connect timeout=%s)"
+                % (self.host, self.timeout),
+            )
+
+        except socks.ProxyError as e:
+            # This is fragile as hell, but it seems to be the only way to raise
+            # useful errors here.
+            if e.socket_err:
+                error = e.socket_err
+                if isinstance(error, SocketTimeout):
+                    raise ConnectTimeoutError(
+                        self,
+                        "Connection to %s timed out. (connect timeout=%s)"
+                        % (self.host, self.timeout),
+                    )
+                else:
+                    raise NewConnectionError(
+                        self, "Failed to establish a new connection: %s" % error
+                    )
+            else:
+                raise NewConnectionError(
+                    self, "Failed to establish a new connection: %s" % e
+                )
+
+        except SocketError as e:  # Defensive: PySocks should catch all these.
+            raise NewConnectionError(
+                self, "Failed to establish a new connection: %s" % e
+            )
+
+        return conn
+
+
+# We don't need to duplicate the Verified/Unverified distinction from
+# urllib3/connection.py here because the HTTPSConnection will already have been
+# correctly set to either the Verified or Unverified form by that module. This
+# means the SOCKSHTTPSConnection will automatically be the correct type.
+class SOCKSHTTPSConnection(SOCKSConnection, HTTPSConnection):
+    pass
+
+
+class SOCKSHTTPConnectionPool(HTTPConnectionPool):
+    ConnectionCls = SOCKSConnection
+
+
+class SOCKSHTTPSConnectionPool(HTTPSConnectionPool):
+    ConnectionCls = SOCKSHTTPSConnection
+
+
+class SOCKSProxyManager(PoolManager):
+    """
+    A version of the urllib3 ProxyManager that routes connections via the
+    defined SOCKS proxy.
+    """
+
+    pool_classes_by_scheme = {
+        "http": SOCKSHTTPConnectionPool,
+        "https": SOCKSHTTPSConnectionPool,
+    }
+
+    def __init__(
+        self,
+        proxy_url,
+        username=None,
+        password=None,
+        num_pools=10,
+        headers=None,
+        **connection_pool_kw
+    ):
+        parsed = parse_url(proxy_url)
+
+        if username is None and password is None and parsed.auth is not None:
+            split = parsed.auth.split(":")
+            if len(split) == 2:
+                username, password = split
+        if parsed.scheme == "socks5":
+            socks_version = socks.PROXY_TYPE_SOCKS5
+            rdns = False
+        elif parsed.scheme == "socks5h":
+            socks_version = socks.PROXY_TYPE_SOCKS5
+            rdns = True
+        elif parsed.scheme == "socks4":
+            socks_version = socks.PROXY_TYPE_SOCKS4
+            rdns = False
+        elif parsed.scheme == "socks4a":
+            socks_version = socks.PROXY_TYPE_SOCKS4
+            rdns = True
+        else:
+            raise ValueError("Unable to determine SOCKS version from %s" % proxy_url)
+
+        self.proxy_url = proxy_url
+
+        socks_options = {
+            "socks_version": socks_version,
+            "proxy_host": parsed.host,
+            "proxy_port": parsed.port,
+            "username": username,
+            "password": password,
+            "rdns": rdns,
+        }
+        connection_pool_kw["_socks_options"] = socks_options
+
+        super(SOCKSProxyManager, self).__init__(
+            num_pools, headers, **connection_pool_kw
+        )
+
+        self.pool_classes_by_scheme = SOCKSProxyManager.pool_classes_by_scheme
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/exceptions.py b/venv/Lib/site-packages/pip/_vendor/urllib3/exceptions.py
new file mode 100644
index 000000000..5cc4d8a4f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/exceptions.py
@@ -0,0 +1,272 @@
+from __future__ import absolute_import
+from .packages.six.moves.http_client import IncompleteRead as httplib_IncompleteRead
+
+# Base Exceptions
+
+
+class HTTPError(Exception):
+    "Base exception used by this module."
+    pass
+
+
+class HTTPWarning(Warning):
+    "Base warning used by this module."
+    pass
+
+
+class PoolError(HTTPError):
+    "Base exception for errors caused within a pool."
+
+    def __init__(self, pool, message):
+        self.pool = pool
+        HTTPError.__init__(self, "%s: %s" % (pool, message))
+
+    def __reduce__(self):
+        # For pickling purposes.
+        return self.__class__, (None, None)
+
+
+class RequestError(PoolError):
+    "Base exception for PoolErrors that have associated URLs."
+
+    def __init__(self, pool, url, message):
+        self.url = url
+        PoolError.__init__(self, pool, message)
+
+    def __reduce__(self):
+        # For pickling purposes.
+        return self.__class__, (None, self.url, None)
+
+
+class SSLError(HTTPError):
+    "Raised when SSL certificate fails in an HTTPS connection."
+    pass
+
+
+class ProxyError(HTTPError):
+    "Raised when the connection to a proxy fails."
+
+    def __init__(self, message, error, *args):
+        super(ProxyError, self).__init__(message, error, *args)
+        self.original_error = error
+
+
+class DecodeError(HTTPError):
+    "Raised when automatic decoding based on Content-Type fails."
+    pass
+
+
+class ProtocolError(HTTPError):
+    "Raised when something unexpected happens mid-request/response."
+    pass
+
+
+#: Renamed to ProtocolError but aliased for backwards compatibility.
+ConnectionError = ProtocolError
+
+
+# Leaf Exceptions
+
+
+class MaxRetryError(RequestError):
+    """Raised when the maximum number of retries is exceeded.
+
+    :param pool: The connection pool
+    :type pool: :class:`~urllib3.connectionpool.HTTPConnectionPool`
+    :param string url: The requested Url
+    :param exceptions.Exception reason: The underlying error
+
+    """
+
+    def __init__(self, pool, url, reason=None):
+        self.reason = reason
+
+        message = "Max retries exceeded with url: %s (Caused by %r)" % (url, reason)
+
+        RequestError.__init__(self, pool, url, message)
+
+
+class HostChangedError(RequestError):
+    "Raised when an existing pool gets a request for a foreign host."
+
+    def __init__(self, pool, url, retries=3):
+        message = "Tried to open a foreign host with url: %s" % url
+        RequestError.__init__(self, pool, url, message)
+        self.retries = retries
+
+
+class TimeoutStateError(HTTPError):
+    """ Raised when passing an invalid state to a timeout """
+
+    pass
+
+
+class TimeoutError(HTTPError):
+    """ Raised when a socket timeout error occurs.
+
+    Catching this error will catch both :exc:`ReadTimeoutErrors
+    <ReadTimeoutError>` and :exc:`ConnectTimeoutErrors <ConnectTimeoutError>`.
+    """
+
+    pass
+
+
+class ReadTimeoutError(TimeoutError, RequestError):
+    "Raised when a socket timeout occurs while receiving data from a server"
+    pass
+
+
+# This timeout error does not have a URL attached and needs to inherit from the
+# base HTTPError
+class ConnectTimeoutError(TimeoutError):
+    "Raised when a socket timeout occurs while connecting to a server"
+    pass
+
+
+class NewConnectionError(ConnectTimeoutError, PoolError):
+    "Raised when we fail to establish a new connection. Usually ECONNREFUSED."
+    pass
+
+
+class EmptyPoolError(PoolError):
+    "Raised when a pool runs out of connections and no more are allowed."
+    pass
+
+
+class ClosedPoolError(PoolError):
+    "Raised when a request enters a pool after the pool has been closed."
+    pass
+
+
+class LocationValueError(ValueError, HTTPError):
+    "Raised when there is something wrong with a given URL input."
+    pass
+
+
+class LocationParseError(LocationValueError):
+    "Raised when get_host or similar fails to parse the URL input."
+
+    def __init__(self, location):
+        message = "Failed to parse: %s" % location
+        HTTPError.__init__(self, message)
+
+        self.location = location
+
+
+class ResponseError(HTTPError):
+    "Used as a container for an error reason supplied in a MaxRetryError."
+    GENERIC_ERROR = "too many error responses"
+    SPECIFIC_ERROR = "too many {status_code} error responses"
+
+
+class SecurityWarning(HTTPWarning):
+    "Warned when performing security reducing actions"
+    pass
+
+
+class SubjectAltNameWarning(SecurityWarning):
+    "Warned when connecting to a host with a certificate missing a SAN."
+    pass
+
+
+class InsecureRequestWarning(SecurityWarning):
+    "Warned when making an unverified HTTPS request."
+    pass
+
+
+class SystemTimeWarning(SecurityWarning):
+    "Warned when system time is suspected to be wrong"
+    pass
+
+
+class InsecurePlatformWarning(SecurityWarning):
+    "Warned when certain SSL configuration is not available on a platform."
+    pass
+
+
+class SNIMissingWarning(HTTPWarning):
+    "Warned when making a HTTPS request without SNI available."
+    pass
+
+
+class DependencyWarning(HTTPWarning):
+    """
+    Warned when an attempt is made to import a module with missing optional
+    dependencies.
+    """
+
+    pass
+
+
+class InvalidProxyConfigurationWarning(HTTPWarning):
+    """
+    Warned when using an HTTPS proxy and an HTTPS URL. Currently
+    urllib3 doesn't support HTTPS proxies and the proxy will be
+    contacted via HTTP instead. This warning can be fixed by
+    changing your HTTPS proxy URL into an HTTP proxy URL.
+
+    If you encounter this warning read this:
+    https://github.com/urllib3/urllib3/issues/1850
+    """
+
+    pass
+
+
+class ResponseNotChunked(ProtocolError, ValueError):
+    "Response needs to be chunked in order to read it as chunks."
+    pass
+
+
+class BodyNotHttplibCompatible(HTTPError):
+    """
+    Body should be httplib.HTTPResponse like (have an fp attribute which
+    returns raw chunks) for read_chunked().
+    """
+
+    pass
+
+
+class IncompleteRead(HTTPError, httplib_IncompleteRead):
+    """
+    Response length doesn't match expected Content-Length
+
+    Subclass of http_client.IncompleteRead to allow int value
+    for `partial` to avoid creating large objects on streamed
+    reads.
+    """
+
+    def __init__(self, partial, expected):
+        super(IncompleteRead, self).__init__(partial, expected)
+
+    def __repr__(self):
+        return "IncompleteRead(%i bytes read, %i more expected)" % (
+            self.partial,
+            self.expected,
+        )
+
+
+class InvalidHeader(HTTPError):
+    "The header provided was somehow invalid."
+    pass
+
+
+class ProxySchemeUnknown(AssertionError, ValueError):
+    "ProxyManager does not support the supplied scheme"
+    # TODO(t-8ch): Stop inheriting from AssertionError in v2.0.
+
+    def __init__(self, scheme):
+        message = "Not supported proxy scheme %s" % scheme
+        super(ProxySchemeUnknown, self).__init__(message)
+
+
+class HeaderParsingError(HTTPError):
+    "Raised by assert_header_parsing, but we convert it to a log.warning statement."
+
+    def __init__(self, defects, unparsed_data):
+        message = "%s, unparsed data: %r" % (defects or "Unknown", unparsed_data)
+        super(HeaderParsingError, self).__init__(message)
+
+
+class UnrewindableBodyError(HTTPError):
+    "urllib3 encountered an error when trying to rewind a body"
+    pass
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/fields.py b/venv/Lib/site-packages/pip/_vendor/urllib3/fields.py
new file mode 100644
index 000000000..8715b2202
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/fields.py
@@ -0,0 +1,273 @@
+from __future__ import absolute_import
+import email.utils
+import mimetypes
+import re
+
+from .packages import six
+
+
+def guess_content_type(filename, default="application/octet-stream"):
+    """
+    Guess the "Content-Type" of a file.
+
+    :param filename:
+        The filename to guess the "Content-Type" of using :mod:`mimetypes`.
+    :param default:
+        If no "Content-Type" can be guessed, default to `default`.
+    """
+    if filename:
+        return mimetypes.guess_type(filename)[0] or default
+    return default
+
+
+def format_header_param_rfc2231(name, value):
+    """
+    Helper function to format and quote a single header parameter using the
+    strategy defined in RFC 2231.
+
+    Particularly useful for header parameters which might contain
+    non-ASCII values, like file names. This follows RFC 2388 Section 4.4.
+
+    :param name:
+        The name of the parameter, a string expected to be ASCII only.
+    :param value:
+        The value of the parameter, provided as ``bytes`` or `str``.
+    :ret:
+        An RFC-2231-formatted unicode string.
+    """
+    if isinstance(value, six.binary_type):
+        value = value.decode("utf-8")
+
+    if not any(ch in value for ch in '"\\\r\n'):
+        result = u'%s="%s"' % (name, value)
+        try:
+            result.encode("ascii")
+        except (UnicodeEncodeError, UnicodeDecodeError):
+            pass
+        else:
+            return result
+
+    if six.PY2:  # Python 2:
+        value = value.encode("utf-8")
+
+    # encode_rfc2231 accepts an encoded string and returns an ascii-encoded
+    # string in Python 2 but accepts and returns unicode strings in Python 3
+    value = email.utils.encode_rfc2231(value, "utf-8")
+    value = "%s*=%s" % (name, value)
+
+    if six.PY2:  # Python 2:
+        value = value.decode("utf-8")
+
+    return value
+
+
+_HTML5_REPLACEMENTS = {
+    u"\u0022": u"%22",
+    # Replace "\" with "\\".
+    u"\u005C": u"\u005C\u005C",
+    u"\u005C": u"\u005C\u005C",
+}
+
+# All control characters from 0x00 to 0x1F *except* 0x1B.
+_HTML5_REPLACEMENTS.update(
+    {
+        six.unichr(cc): u"%{:02X}".format(cc)
+        for cc in range(0x00, 0x1F + 1)
+        if cc not in (0x1B,)
+    }
+)
+
+
+def _replace_multiple(value, needles_and_replacements):
+    def replacer(match):
+        return needles_and_replacements[match.group(0)]
+
+    pattern = re.compile(
+        r"|".join([re.escape(needle) for needle in needles_and_replacements.keys()])
+    )
+
+    result = pattern.sub(replacer, value)
+
+    return result
+
+
+def format_header_param_html5(name, value):
+    """
+    Helper function to format and quote a single header parameter using the
+    HTML5 strategy.
+
+    Particularly useful for header parameters which might contain
+    non-ASCII values, like file names. This follows the `HTML5 Working Draft
+    Section 4.10.22.7`_ and matches the behavior of curl and modern browsers.
+
+    .. _HTML5 Working Draft Section 4.10.22.7:
+        https://w3c.github.io/html/sec-forms.html#multipart-form-data
+
+    :param name:
+        The name of the parameter, a string expected to be ASCII only.
+    :param value:
+        The value of the parameter, provided as ``bytes`` or `str``.
+    :ret:
+        A unicode string, stripped of troublesome characters.
+    """
+    if isinstance(value, six.binary_type):
+        value = value.decode("utf-8")
+
+    value = _replace_multiple(value, _HTML5_REPLACEMENTS)
+
+    return u'%s="%s"' % (name, value)
+
+
+# For backwards-compatibility.
+format_header_param = format_header_param_html5
+
+
+class RequestField(object):
+    """
+    A data container for request body parameters.
+
+    :param name:
+        The name of this request field. Must be unicode.
+    :param data:
+        The data/value body.
+    :param filename:
+        An optional filename of the request field. Must be unicode.
+    :param headers:
+        An optional dict-like object of headers to initially use for the field.
+    :param header_formatter:
+        An optional callable that is used to encode and format the headers. By
+        default, this is :func:`format_header_param_html5`.
+    """
+
+    def __init__(
+        self,
+        name,
+        data,
+        filename=None,
+        headers=None,
+        header_formatter=format_header_param_html5,
+    ):
+        self._name = name
+        self._filename = filename
+        self.data = data
+        self.headers = {}
+        if headers:
+            self.headers = dict(headers)
+        self.header_formatter = header_formatter
+
+    @classmethod
+    def from_tuples(cls, fieldname, value, header_formatter=format_header_param_html5):
+        """
+        A :class:`~urllib3.fields.RequestField` factory from old-style tuple parameters.
+
+        Supports constructing :class:`~urllib3.fields.RequestField` from
+        parameter of key/value strings AND key/filetuple. A filetuple is a
+        (filename, data, MIME type) tuple where the MIME type is optional.
+        For example::
+
+            'foo': 'bar',
+            'fakefile': ('foofile.txt', 'contents of foofile'),
+            'realfile': ('barfile.txt', open('realfile').read()),
+            'typedfile': ('bazfile.bin', open('bazfile').read(), 'image/jpeg'),
+            'nonamefile': 'contents of nonamefile field',
+
+        Field names and filenames must be unicode.
+        """
+        if isinstance(value, tuple):
+            if len(value) == 3:
+                filename, data, content_type = value
+            else:
+                filename, data = value
+                content_type = guess_content_type(filename)
+        else:
+            filename = None
+            content_type = None
+            data = value
+
+        request_param = cls(
+            fieldname, data, filename=filename, header_formatter=header_formatter
+        )
+        request_param.make_multipart(content_type=content_type)
+
+        return request_param
+
+    def _render_part(self, name, value):
+        """
+        Overridable helper function to format a single header parameter. By
+        default, this calls ``self.header_formatter``.
+
+        :param name:
+            The name of the parameter, a string expected to be ASCII only.
+        :param value:
+            The value of the parameter, provided as a unicode string.
+        """
+
+        return self.header_formatter(name, value)
+
+    def _render_parts(self, header_parts):
+        """
+        Helper function to format and quote a single header.
+
+        Useful for single headers that are composed of multiple items. E.g.,
+        'Content-Disposition' fields.
+
+        :param header_parts:
+            A sequence of (k, v) tuples or a :class:`dict` of (k, v) to format
+            as `k1="v1"; k2="v2"; ...`.
+        """
+        parts = []
+        iterable = header_parts
+        if isinstance(header_parts, dict):
+            iterable = header_parts.items()
+
+        for name, value in iterable:
+            if value is not None:
+                parts.append(self._render_part(name, value))
+
+        return u"; ".join(parts)
+
+    def render_headers(self):
+        """
+        Renders the headers for this request field.
+        """
+        lines = []
+
+        sort_keys = ["Content-Disposition", "Content-Type", "Content-Location"]
+        for sort_key in sort_keys:
+            if self.headers.get(sort_key, False):
+                lines.append(u"%s: %s" % (sort_key, self.headers[sort_key]))
+
+        for header_name, header_value in self.headers.items():
+            if header_name not in sort_keys:
+                if header_value:
+                    lines.append(u"%s: %s" % (header_name, header_value))
+
+        lines.append(u"\r\n")
+        return u"\r\n".join(lines)
+
+    def make_multipart(
+        self, content_disposition=None, content_type=None, content_location=None
+    ):
+        """
+        Makes this request field into a multipart request field.
+
+        This method overrides "Content-Disposition", "Content-Type" and
+        "Content-Location" headers to the request parameter.
+
+        :param content_type:
+            The 'Content-Type' of the request body.
+        :param content_location:
+            The 'Content-Location' of the request body.
+
+        """
+        self.headers["Content-Disposition"] = content_disposition or u"form-data"
+        self.headers["Content-Disposition"] += u"; ".join(
+            [
+                u"",
+                self._render_parts(
+                    ((u"name", self._name), (u"filename", self._filename))
+                ),
+            ]
+        )
+        self.headers["Content-Type"] = content_type
+        self.headers["Content-Location"] = content_location
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/filepost.py b/venv/Lib/site-packages/pip/_vendor/urllib3/filepost.py
new file mode 100644
index 000000000..b7b00992c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/filepost.py
@@ -0,0 +1,98 @@
+from __future__ import absolute_import
+import binascii
+import codecs
+import os
+
+from io import BytesIO
+
+from .packages import six
+from .packages.six import b
+from .fields import RequestField
+
+writer = codecs.lookup("utf-8")[3]
+
+
+def choose_boundary():
+    """
+    Our embarrassingly-simple replacement for mimetools.choose_boundary.
+    """
+    boundary = binascii.hexlify(os.urandom(16))
+    if not six.PY2:
+        boundary = boundary.decode("ascii")
+    return boundary
+
+
+def iter_field_objects(fields):
+    """
+    Iterate over fields.
+
+    Supports list of (k, v) tuples and dicts, and lists of
+    :class:`~urllib3.fields.RequestField`.
+
+    """
+    if isinstance(fields, dict):
+        i = six.iteritems(fields)
+    else:
+        i = iter(fields)
+
+    for field in i:
+        if isinstance(field, RequestField):
+            yield field
+        else:
+            yield RequestField.from_tuples(*field)
+
+
+def iter_fields(fields):
+    """
+    .. deprecated:: 1.6
+
+    Iterate over fields.
+
+    The addition of :class:`~urllib3.fields.RequestField` makes this function
+    obsolete. Instead, use :func:`iter_field_objects`, which returns
+    :class:`~urllib3.fields.RequestField` objects.
+
+    Supports list of (k, v) tuples and dicts.
+    """
+    if isinstance(fields, dict):
+        return ((k, v) for k, v in six.iteritems(fields))
+
+    return ((k, v) for k, v in fields)
+
+
+def encode_multipart_formdata(fields, boundary=None):
+    """
+    Encode a dictionary of ``fields`` using the multipart/form-data MIME format.
+
+    :param fields:
+        Dictionary of fields or list of (key, :class:`~urllib3.fields.RequestField`).
+
+    :param boundary:
+        If not specified, then a random boundary will be generated using
+        :func:`urllib3.filepost.choose_boundary`.
+    """
+    body = BytesIO()
+    if boundary is None:
+        boundary = choose_boundary()
+
+    for field in iter_field_objects(fields):
+        body.write(b("--%s\r\n" % (boundary)))
+
+        writer(body).write(field.render_headers())
+        data = field.data
+
+        if isinstance(data, int):
+            data = str(data)  # Backwards compatibility
+
+        if isinstance(data, six.text_type):
+            writer(body).write(data)
+        else:
+            body.write(data)
+
+        body.write(b"\r\n")
+
+    body.write(b("--%s--\r\n" % (boundary)))
+
+    content_type = str("multipart/form-data; boundary=%s" % boundary)
+
+    return body.getvalue(), content_type
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__init__.py
new file mode 100644
index 000000000..fce4caa65
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__init__.py
@@ -0,0 +1,5 @@
+from __future__ import absolute_import
+
+from . import ssl_match_hostname
+
+__all__ = ("ssl_match_hostname",)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..fb458fa5b
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc
new file mode 100644
index 000000000..8770f8de7
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/__pycache__/six.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4741a7b4a
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc
new file mode 100644
index 000000000..bede97f9d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/__pycache__/makefile.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/makefile.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/makefile.py
new file mode 100644
index 000000000..a3156a69c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/backports/makefile.py
@@ -0,0 +1,52 @@
+# -*- coding: utf-8 -*-
+"""
+backports.makefile
+~~~~~~~~~~~~~~~~~~
+
+Backports the Python 3 ``socket.makefile`` method for use with anything that
+wants to create a "fake" socket object.
+"""
+import io
+
+from socket import SocketIO
+
+
+def backport_makefile(
+    self, mode="r", buffering=None, encoding=None, errors=None, newline=None
+):
+    """
+    Backport of ``socket.makefile`` from Python 3.5.
+    """
+    if not set(mode) <= {"r", "w", "b"}:
+        raise ValueError("invalid mode %r (only r, w, b allowed)" % (mode,))
+    writing = "w" in mode
+    reading = "r" in mode or not writing
+    assert reading or writing
+    binary = "b" in mode
+    rawmode = ""
+    if reading:
+        rawmode += "r"
+    if writing:
+        rawmode += "w"
+    raw = SocketIO(self, rawmode)
+    self._makefile_refs += 1
+    if buffering is None:
+        buffering = -1
+    if buffering < 0:
+        buffering = io.DEFAULT_BUFFER_SIZE
+    if buffering == 0:
+        if not binary:
+            raise ValueError("unbuffered streams must be binary")
+        return raw
+    if reading and writing:
+        buffer = io.BufferedRWPair(raw, raw, buffering)
+    elif reading:
+        buffer = io.BufferedReader(raw, buffering)
+    else:
+        assert writing
+        buffer = io.BufferedWriter(raw, buffering)
+    if binary:
+        return buffer
+    text = io.TextIOWrapper(buffer, encoding, errors, newline)
+    text.mode = mode
+    return text
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/six.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/six.py
new file mode 100644
index 000000000..314424099
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/six.py
@@ -0,0 +1,1021 @@
+# Copyright (c) 2010-2019 Benjamin Peterson
+#
+# Permission is hereby granted, free of charge, to any person obtaining a copy
+# of this software and associated documentation files (the "Software"), to deal
+# in the Software without restriction, including without limitation the rights
+# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+# copies of the Software, and to permit persons to whom the Software is
+# furnished to do so, subject to the following conditions:
+#
+# The above copyright notice and this permission notice shall be included in all
+# copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+# SOFTWARE.
+
+"""Utilities for writing code that runs on Python 2 and 3"""
+
+from __future__ import absolute_import
+
+import functools
+import itertools
+import operator
+import sys
+import types
+
+__author__ = "Benjamin Peterson <benjamin@python.org>"
+__version__ = "1.12.0"
+
+
+# Useful for very coarse version differentiation.
+PY2 = sys.version_info[0] == 2
+PY3 = sys.version_info[0] == 3
+PY34 = sys.version_info[0:2] >= (3, 4)
+
+if PY3:
+    string_types = (str,)
+    integer_types = (int,)
+    class_types = (type,)
+    text_type = str
+    binary_type = bytes
+
+    MAXSIZE = sys.maxsize
+else:
+    string_types = (basestring,)
+    integer_types = (int, long)
+    class_types = (type, types.ClassType)
+    text_type = unicode
+    binary_type = str
+
+    if sys.platform.startswith("java"):
+        # Jython always uses 32 bits.
+        MAXSIZE = int((1 << 31) - 1)
+    else:
+        # It's possible to have sizeof(long) != sizeof(Py_ssize_t).
+        class X(object):
+            def __len__(self):
+                return 1 << 31
+
+        try:
+            len(X())
+        except OverflowError:
+            # 32-bit
+            MAXSIZE = int((1 << 31) - 1)
+        else:
+            # 64-bit
+            MAXSIZE = int((1 << 63) - 1)
+        del X
+
+
+def _add_doc(func, doc):
+    """Add documentation to a function."""
+    func.__doc__ = doc
+
+
+def _import_module(name):
+    """Import module, returning the module after the last dot."""
+    __import__(name)
+    return sys.modules[name]
+
+
+class _LazyDescr(object):
+    def __init__(self, name):
+        self.name = name
+
+    def __get__(self, obj, tp):
+        result = self._resolve()
+        setattr(obj, self.name, result)  # Invokes __set__.
+        try:
+            # This is a bit ugly, but it avoids running this again by
+            # removing this descriptor.
+            delattr(obj.__class__, self.name)
+        except AttributeError:
+            pass
+        return result
+
+
+class MovedModule(_LazyDescr):
+    def __init__(self, name, old, new=None):
+        super(MovedModule, self).__init__(name)
+        if PY3:
+            if new is None:
+                new = name
+            self.mod = new
+        else:
+            self.mod = old
+
+    def _resolve(self):
+        return _import_module(self.mod)
+
+    def __getattr__(self, attr):
+        _module = self._resolve()
+        value = getattr(_module, attr)
+        setattr(self, attr, value)
+        return value
+
+
+class _LazyModule(types.ModuleType):
+    def __init__(self, name):
+        super(_LazyModule, self).__init__(name)
+        self.__doc__ = self.__class__.__doc__
+
+    def __dir__(self):
+        attrs = ["__doc__", "__name__"]
+        attrs += [attr.name for attr in self._moved_attributes]
+        return attrs
+
+    # Subclasses should override this
+    _moved_attributes = []
+
+
+class MovedAttribute(_LazyDescr):
+    def __init__(self, name, old_mod, new_mod, old_attr=None, new_attr=None):
+        super(MovedAttribute, self).__init__(name)
+        if PY3:
+            if new_mod is None:
+                new_mod = name
+            self.mod = new_mod
+            if new_attr is None:
+                if old_attr is None:
+                    new_attr = name
+                else:
+                    new_attr = old_attr
+            self.attr = new_attr
+        else:
+            self.mod = old_mod
+            if old_attr is None:
+                old_attr = name
+            self.attr = old_attr
+
+    def _resolve(self):
+        module = _import_module(self.mod)
+        return getattr(module, self.attr)
+
+
+class _SixMetaPathImporter(object):
+
+    """
+    A meta path importer to import six.moves and its submodules.
+
+    This class implements a PEP302 finder and loader. It should be compatible
+    with Python 2.5 and all existing versions of Python3
+    """
+
+    def __init__(self, six_module_name):
+        self.name = six_module_name
+        self.known_modules = {}
+
+    def _add_module(self, mod, *fullnames):
+        for fullname in fullnames:
+            self.known_modules[self.name + "." + fullname] = mod
+
+    def _get_module(self, fullname):
+        return self.known_modules[self.name + "." + fullname]
+
+    def find_module(self, fullname, path=None):
+        if fullname in self.known_modules:
+            return self
+        return None
+
+    def __get_module(self, fullname):
+        try:
+            return self.known_modules[fullname]
+        except KeyError:
+            raise ImportError("This loader does not know module " + fullname)
+
+    def load_module(self, fullname):
+        try:
+            # in case of a reload
+            return sys.modules[fullname]
+        except KeyError:
+            pass
+        mod = self.__get_module(fullname)
+        if isinstance(mod, MovedModule):
+            mod = mod._resolve()
+        else:
+            mod.__loader__ = self
+        sys.modules[fullname] = mod
+        return mod
+
+    def is_package(self, fullname):
+        """
+        Return true, if the named module is a package.
+
+        We need this method to get correct spec objects with
+        Python 3.4 (see PEP451)
+        """
+        return hasattr(self.__get_module(fullname), "__path__")
+
+    def get_code(self, fullname):
+        """Return None
+
+        Required, if is_package is implemented"""
+        self.__get_module(fullname)  # eventually raises ImportError
+        return None
+
+    get_source = get_code  # same as get_code
+
+
+_importer = _SixMetaPathImporter(__name__)
+
+
+class _MovedItems(_LazyModule):
+
+    """Lazy loading of moved objects"""
+
+    __path__ = []  # mark as package
+
+
+_moved_attributes = [
+    MovedAttribute("cStringIO", "cStringIO", "io", "StringIO"),
+    MovedAttribute("filter", "itertools", "builtins", "ifilter", "filter"),
+    MovedAttribute(
+        "filterfalse", "itertools", "itertools", "ifilterfalse", "filterfalse"
+    ),
+    MovedAttribute("input", "__builtin__", "builtins", "raw_input", "input"),
+    MovedAttribute("intern", "__builtin__", "sys"),
+    MovedAttribute("map", "itertools", "builtins", "imap", "map"),
+    MovedAttribute("getcwd", "os", "os", "getcwdu", "getcwd"),
+    MovedAttribute("getcwdb", "os", "os", "getcwd", "getcwdb"),
+    MovedAttribute("getoutput", "commands", "subprocess"),
+    MovedAttribute("range", "__builtin__", "builtins", "xrange", "range"),
+    MovedAttribute(
+        "reload_module", "__builtin__", "importlib" if PY34 else "imp", "reload"
+    ),
+    MovedAttribute("reduce", "__builtin__", "functools"),
+    MovedAttribute("shlex_quote", "pipes", "shlex", "quote"),
+    MovedAttribute("StringIO", "StringIO", "io"),
+    MovedAttribute("UserDict", "UserDict", "collections"),
+    MovedAttribute("UserList", "UserList", "collections"),
+    MovedAttribute("UserString", "UserString", "collections"),
+    MovedAttribute("xrange", "__builtin__", "builtins", "xrange", "range"),
+    MovedAttribute("zip", "itertools", "builtins", "izip", "zip"),
+    MovedAttribute(
+        "zip_longest", "itertools", "itertools", "izip_longest", "zip_longest"
+    ),
+    MovedModule("builtins", "__builtin__"),
+    MovedModule("configparser", "ConfigParser"),
+    MovedModule("copyreg", "copy_reg"),
+    MovedModule("dbm_gnu", "gdbm", "dbm.gnu"),
+    MovedModule("_dummy_thread", "dummy_thread", "_dummy_thread"),
+    MovedModule("http_cookiejar", "cookielib", "http.cookiejar"),
+    MovedModule("http_cookies", "Cookie", "http.cookies"),
+    MovedModule("html_entities", "htmlentitydefs", "html.entities"),
+    MovedModule("html_parser", "HTMLParser", "html.parser"),
+    MovedModule("http_client", "httplib", "http.client"),
+    MovedModule("email_mime_base", "email.MIMEBase", "email.mime.base"),
+    MovedModule("email_mime_image", "email.MIMEImage", "email.mime.image"),
+    MovedModule("email_mime_multipart", "email.MIMEMultipart", "email.mime.multipart"),
+    MovedModule(
+        "email_mime_nonmultipart", "email.MIMENonMultipart", "email.mime.nonmultipart"
+    ),
+    MovedModule("email_mime_text", "email.MIMEText", "email.mime.text"),
+    MovedModule("BaseHTTPServer", "BaseHTTPServer", "http.server"),
+    MovedModule("CGIHTTPServer", "CGIHTTPServer", "http.server"),
+    MovedModule("SimpleHTTPServer", "SimpleHTTPServer", "http.server"),
+    MovedModule("cPickle", "cPickle", "pickle"),
+    MovedModule("queue", "Queue"),
+    MovedModule("reprlib", "repr"),
+    MovedModule("socketserver", "SocketServer"),
+    MovedModule("_thread", "thread", "_thread"),
+    MovedModule("tkinter", "Tkinter"),
+    MovedModule("tkinter_dialog", "Dialog", "tkinter.dialog"),
+    MovedModule("tkinter_filedialog", "FileDialog", "tkinter.filedialog"),
+    MovedModule("tkinter_scrolledtext", "ScrolledText", "tkinter.scrolledtext"),
+    MovedModule("tkinter_simpledialog", "SimpleDialog", "tkinter.simpledialog"),
+    MovedModule("tkinter_tix", "Tix", "tkinter.tix"),
+    MovedModule("tkinter_ttk", "ttk", "tkinter.ttk"),
+    MovedModule("tkinter_constants", "Tkconstants", "tkinter.constants"),
+    MovedModule("tkinter_dnd", "Tkdnd", "tkinter.dnd"),
+    MovedModule("tkinter_colorchooser", "tkColorChooser", "tkinter.colorchooser"),
+    MovedModule("tkinter_commondialog", "tkCommonDialog", "tkinter.commondialog"),
+    MovedModule("tkinter_tkfiledialog", "tkFileDialog", "tkinter.filedialog"),
+    MovedModule("tkinter_font", "tkFont", "tkinter.font"),
+    MovedModule("tkinter_messagebox", "tkMessageBox", "tkinter.messagebox"),
+    MovedModule("tkinter_tksimpledialog", "tkSimpleDialog", "tkinter.simpledialog"),
+    MovedModule("urllib_parse", __name__ + ".moves.urllib_parse", "urllib.parse"),
+    MovedModule("urllib_error", __name__ + ".moves.urllib_error", "urllib.error"),
+    MovedModule("urllib", __name__ + ".moves.urllib", __name__ + ".moves.urllib"),
+    MovedModule("urllib_robotparser", "robotparser", "urllib.robotparser"),
+    MovedModule("xmlrpc_client", "xmlrpclib", "xmlrpc.client"),
+    MovedModule("xmlrpc_server", "SimpleXMLRPCServer", "xmlrpc.server"),
+]
+# Add windows specific modules.
+if sys.platform == "win32":
+    _moved_attributes += [MovedModule("winreg", "_winreg")]
+
+for attr in _moved_attributes:
+    setattr(_MovedItems, attr.name, attr)
+    if isinstance(attr, MovedModule):
+        _importer._add_module(attr, "moves." + attr.name)
+del attr
+
+_MovedItems._moved_attributes = _moved_attributes
+
+moves = _MovedItems(__name__ + ".moves")
+_importer._add_module(moves, "moves")
+
+
+class Module_six_moves_urllib_parse(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_parse"""
+
+
+_urllib_parse_moved_attributes = [
+    MovedAttribute("ParseResult", "urlparse", "urllib.parse"),
+    MovedAttribute("SplitResult", "urlparse", "urllib.parse"),
+    MovedAttribute("parse_qs", "urlparse", "urllib.parse"),
+    MovedAttribute("parse_qsl", "urlparse", "urllib.parse"),
+    MovedAttribute("urldefrag", "urlparse", "urllib.parse"),
+    MovedAttribute("urljoin", "urlparse", "urllib.parse"),
+    MovedAttribute("urlparse", "urlparse", "urllib.parse"),
+    MovedAttribute("urlsplit", "urlparse", "urllib.parse"),
+    MovedAttribute("urlunparse", "urlparse", "urllib.parse"),
+    MovedAttribute("urlunsplit", "urlparse", "urllib.parse"),
+    MovedAttribute("quote", "urllib", "urllib.parse"),
+    MovedAttribute("quote_plus", "urllib", "urllib.parse"),
+    MovedAttribute("unquote", "urllib", "urllib.parse"),
+    MovedAttribute("unquote_plus", "urllib", "urllib.parse"),
+    MovedAttribute(
+        "unquote_to_bytes", "urllib", "urllib.parse", "unquote", "unquote_to_bytes"
+    ),
+    MovedAttribute("urlencode", "urllib", "urllib.parse"),
+    MovedAttribute("splitquery", "urllib", "urllib.parse"),
+    MovedAttribute("splittag", "urllib", "urllib.parse"),
+    MovedAttribute("splituser", "urllib", "urllib.parse"),
+    MovedAttribute("splitvalue", "urllib", "urllib.parse"),
+    MovedAttribute("uses_fragment", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_netloc", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_params", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_query", "urlparse", "urllib.parse"),
+    MovedAttribute("uses_relative", "urlparse", "urllib.parse"),
+]
+for attr in _urllib_parse_moved_attributes:
+    setattr(Module_six_moves_urllib_parse, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_parse._moved_attributes = _urllib_parse_moved_attributes
+
+_importer._add_module(
+    Module_six_moves_urllib_parse(__name__ + ".moves.urllib_parse"),
+    "moves.urllib_parse",
+    "moves.urllib.parse",
+)
+
+
+class Module_six_moves_urllib_error(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_error"""
+
+
+_urllib_error_moved_attributes = [
+    MovedAttribute("URLError", "urllib2", "urllib.error"),
+    MovedAttribute("HTTPError", "urllib2", "urllib.error"),
+    MovedAttribute("ContentTooShortError", "urllib", "urllib.error"),
+]
+for attr in _urllib_error_moved_attributes:
+    setattr(Module_six_moves_urllib_error, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_error._moved_attributes = _urllib_error_moved_attributes
+
+_importer._add_module(
+    Module_six_moves_urllib_error(__name__ + ".moves.urllib.error"),
+    "moves.urllib_error",
+    "moves.urllib.error",
+)
+
+
+class Module_six_moves_urllib_request(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_request"""
+
+
+_urllib_request_moved_attributes = [
+    MovedAttribute("urlopen", "urllib2", "urllib.request"),
+    MovedAttribute("install_opener", "urllib2", "urllib.request"),
+    MovedAttribute("build_opener", "urllib2", "urllib.request"),
+    MovedAttribute("pathname2url", "urllib", "urllib.request"),
+    MovedAttribute("url2pathname", "urllib", "urllib.request"),
+    MovedAttribute("getproxies", "urllib", "urllib.request"),
+    MovedAttribute("Request", "urllib2", "urllib.request"),
+    MovedAttribute("OpenerDirector", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPDefaultErrorHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPRedirectHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPCookieProcessor", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyHandler", "urllib2", "urllib.request"),
+    MovedAttribute("BaseHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPPasswordMgr", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPPasswordMgrWithDefaultRealm", "urllib2", "urllib.request"),
+    MovedAttribute("AbstractBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyBasicAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("AbstractDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("ProxyDigestAuthHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPSHandler", "urllib2", "urllib.request"),
+    MovedAttribute("FileHandler", "urllib2", "urllib.request"),
+    MovedAttribute("FTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("CacheFTPHandler", "urllib2", "urllib.request"),
+    MovedAttribute("UnknownHandler", "urllib2", "urllib.request"),
+    MovedAttribute("HTTPErrorProcessor", "urllib2", "urllib.request"),
+    MovedAttribute("urlretrieve", "urllib", "urllib.request"),
+    MovedAttribute("urlcleanup", "urllib", "urllib.request"),
+    MovedAttribute("URLopener", "urllib", "urllib.request"),
+    MovedAttribute("FancyURLopener", "urllib", "urllib.request"),
+    MovedAttribute("proxy_bypass", "urllib", "urllib.request"),
+    MovedAttribute("parse_http_list", "urllib2", "urllib.request"),
+    MovedAttribute("parse_keqv_list", "urllib2", "urllib.request"),
+]
+for attr in _urllib_request_moved_attributes:
+    setattr(Module_six_moves_urllib_request, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_request._moved_attributes = _urllib_request_moved_attributes
+
+_importer._add_module(
+    Module_six_moves_urllib_request(__name__ + ".moves.urllib.request"),
+    "moves.urllib_request",
+    "moves.urllib.request",
+)
+
+
+class Module_six_moves_urllib_response(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_response"""
+
+
+_urllib_response_moved_attributes = [
+    MovedAttribute("addbase", "urllib", "urllib.response"),
+    MovedAttribute("addclosehook", "urllib", "urllib.response"),
+    MovedAttribute("addinfo", "urllib", "urllib.response"),
+    MovedAttribute("addinfourl", "urllib", "urllib.response"),
+]
+for attr in _urllib_response_moved_attributes:
+    setattr(Module_six_moves_urllib_response, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_response._moved_attributes = _urllib_response_moved_attributes
+
+_importer._add_module(
+    Module_six_moves_urllib_response(__name__ + ".moves.urllib.response"),
+    "moves.urllib_response",
+    "moves.urllib.response",
+)
+
+
+class Module_six_moves_urllib_robotparser(_LazyModule):
+
+    """Lazy loading of moved objects in six.moves.urllib_robotparser"""
+
+
+_urllib_robotparser_moved_attributes = [
+    MovedAttribute("RobotFileParser", "robotparser", "urllib.robotparser")
+]
+for attr in _urllib_robotparser_moved_attributes:
+    setattr(Module_six_moves_urllib_robotparser, attr.name, attr)
+del attr
+
+Module_six_moves_urllib_robotparser._moved_attributes = (
+    _urllib_robotparser_moved_attributes
+)
+
+_importer._add_module(
+    Module_six_moves_urllib_robotparser(__name__ + ".moves.urllib.robotparser"),
+    "moves.urllib_robotparser",
+    "moves.urllib.robotparser",
+)
+
+
+class Module_six_moves_urllib(types.ModuleType):
+
+    """Create a six.moves.urllib namespace that resembles the Python 3 namespace"""
+
+    __path__ = []  # mark as package
+    parse = _importer._get_module("moves.urllib_parse")
+    error = _importer._get_module("moves.urllib_error")
+    request = _importer._get_module("moves.urllib_request")
+    response = _importer._get_module("moves.urllib_response")
+    robotparser = _importer._get_module("moves.urllib_robotparser")
+
+    def __dir__(self):
+        return ["parse", "error", "request", "response", "robotparser"]
+
+
+_importer._add_module(
+    Module_six_moves_urllib(__name__ + ".moves.urllib"), "moves.urllib"
+)
+
+
+def add_move(move):
+    """Add an item to six.moves."""
+    setattr(_MovedItems, move.name, move)
+
+
+def remove_move(name):
+    """Remove item from six.moves."""
+    try:
+        delattr(_MovedItems, name)
+    except AttributeError:
+        try:
+            del moves.__dict__[name]
+        except KeyError:
+            raise AttributeError("no such move, %r" % (name,))
+
+
+if PY3:
+    _meth_func = "__func__"
+    _meth_self = "__self__"
+
+    _func_closure = "__closure__"
+    _func_code = "__code__"
+    _func_defaults = "__defaults__"
+    _func_globals = "__globals__"
+else:
+    _meth_func = "im_func"
+    _meth_self = "im_self"
+
+    _func_closure = "func_closure"
+    _func_code = "func_code"
+    _func_defaults = "func_defaults"
+    _func_globals = "func_globals"
+
+
+try:
+    advance_iterator = next
+except NameError:
+
+    def advance_iterator(it):
+        return it.next()
+
+
+next = advance_iterator
+
+
+try:
+    callable = callable
+except NameError:
+
+    def callable(obj):
+        return any("__call__" in klass.__dict__ for klass in type(obj).__mro__)
+
+
+if PY3:
+
+    def get_unbound_function(unbound):
+        return unbound
+
+    create_bound_method = types.MethodType
+
+    def create_unbound_method(func, cls):
+        return func
+
+    Iterator = object
+else:
+
+    def get_unbound_function(unbound):
+        return unbound.im_func
+
+    def create_bound_method(func, obj):
+        return types.MethodType(func, obj, obj.__class__)
+
+    def create_unbound_method(func, cls):
+        return types.MethodType(func, None, cls)
+
+    class Iterator(object):
+        def next(self):
+            return type(self).__next__(self)
+
+    callable = callable
+_add_doc(
+    get_unbound_function, """Get the function out of a possibly unbound function"""
+)
+
+
+get_method_function = operator.attrgetter(_meth_func)
+get_method_self = operator.attrgetter(_meth_self)
+get_function_closure = operator.attrgetter(_func_closure)
+get_function_code = operator.attrgetter(_func_code)
+get_function_defaults = operator.attrgetter(_func_defaults)
+get_function_globals = operator.attrgetter(_func_globals)
+
+
+if PY3:
+
+    def iterkeys(d, **kw):
+        return iter(d.keys(**kw))
+
+    def itervalues(d, **kw):
+        return iter(d.values(**kw))
+
+    def iteritems(d, **kw):
+        return iter(d.items(**kw))
+
+    def iterlists(d, **kw):
+        return iter(d.lists(**kw))
+
+    viewkeys = operator.methodcaller("keys")
+
+    viewvalues = operator.methodcaller("values")
+
+    viewitems = operator.methodcaller("items")
+else:
+
+    def iterkeys(d, **kw):
+        return d.iterkeys(**kw)
+
+    def itervalues(d, **kw):
+        return d.itervalues(**kw)
+
+    def iteritems(d, **kw):
+        return d.iteritems(**kw)
+
+    def iterlists(d, **kw):
+        return d.iterlists(**kw)
+
+    viewkeys = operator.methodcaller("viewkeys")
+
+    viewvalues = operator.methodcaller("viewvalues")
+
+    viewitems = operator.methodcaller("viewitems")
+
+_add_doc(iterkeys, "Return an iterator over the keys of a dictionary.")
+_add_doc(itervalues, "Return an iterator over the values of a dictionary.")
+_add_doc(iteritems, "Return an iterator over the (key, value) pairs of a dictionary.")
+_add_doc(
+    iterlists, "Return an iterator over the (key, [values]) pairs of a dictionary."
+)
+
+
+if PY3:
+
+    def b(s):
+        return s.encode("latin-1")
+
+    def u(s):
+        return s
+
+    unichr = chr
+    import struct
+
+    int2byte = struct.Struct(">B").pack
+    del struct
+    byte2int = operator.itemgetter(0)
+    indexbytes = operator.getitem
+    iterbytes = iter
+    import io
+
+    StringIO = io.StringIO
+    BytesIO = io.BytesIO
+    del io
+    _assertCountEqual = "assertCountEqual"
+    if sys.version_info[1] <= 1:
+        _assertRaisesRegex = "assertRaisesRegexp"
+        _assertRegex = "assertRegexpMatches"
+    else:
+        _assertRaisesRegex = "assertRaisesRegex"
+        _assertRegex = "assertRegex"
+else:
+
+    def b(s):
+        return s
+
+    # Workaround for standalone backslash
+
+    def u(s):
+        return unicode(s.replace(r"\\", r"\\\\"), "unicode_escape")
+
+    unichr = unichr
+    int2byte = chr
+
+    def byte2int(bs):
+        return ord(bs[0])
+
+    def indexbytes(buf, i):
+        return ord(buf[i])
+
+    iterbytes = functools.partial(itertools.imap, ord)
+    import StringIO
+
+    StringIO = BytesIO = StringIO.StringIO
+    _assertCountEqual = "assertItemsEqual"
+    _assertRaisesRegex = "assertRaisesRegexp"
+    _assertRegex = "assertRegexpMatches"
+_add_doc(b, """Byte literal""")
+_add_doc(u, """Text literal""")
+
+
+def assertCountEqual(self, *args, **kwargs):
+    return getattr(self, _assertCountEqual)(*args, **kwargs)
+
+
+def assertRaisesRegex(self, *args, **kwargs):
+    return getattr(self, _assertRaisesRegex)(*args, **kwargs)
+
+
+def assertRegex(self, *args, **kwargs):
+    return getattr(self, _assertRegex)(*args, **kwargs)
+
+
+if PY3:
+    exec_ = getattr(moves.builtins, "exec")
+
+    def reraise(tp, value, tb=None):
+        try:
+            if value is None:
+                value = tp()
+            if value.__traceback__ is not tb:
+                raise value.with_traceback(tb)
+            raise value
+        finally:
+            value = None
+            tb = None
+
+
+else:
+
+    def exec_(_code_, _globs_=None, _locs_=None):
+        """Execute code in a namespace."""
+        if _globs_ is None:
+            frame = sys._getframe(1)
+            _globs_ = frame.f_globals
+            if _locs_ is None:
+                _locs_ = frame.f_locals
+            del frame
+        elif _locs_ is None:
+            _locs_ = _globs_
+        exec("""exec _code_ in _globs_, _locs_""")
+
+    exec_(
+        """def reraise(tp, value, tb=None):
+    try:
+        raise tp, value, tb
+    finally:
+        tb = None
+"""
+    )
+
+
+if sys.version_info[:2] == (3, 2):
+    exec_(
+        """def raise_from(value, from_value):
+    try:
+        if from_value is None:
+            raise value
+        raise value from from_value
+    finally:
+        value = None
+"""
+    )
+elif sys.version_info[:2] > (3, 2):
+    exec_(
+        """def raise_from(value, from_value):
+    try:
+        raise value from from_value
+    finally:
+        value = None
+"""
+    )
+else:
+
+    def raise_from(value, from_value):
+        raise value
+
+
+print_ = getattr(moves.builtins, "print", None)
+if print_ is None:
+
+    def print_(*args, **kwargs):
+        """The new-style print function for Python 2.4 and 2.5."""
+        fp = kwargs.pop("file", sys.stdout)
+        if fp is None:
+            return
+
+        def write(data):
+            if not isinstance(data, basestring):
+                data = str(data)
+            # If the file has an encoding, encode unicode with it.
+            if (
+                isinstance(fp, file)
+                and isinstance(data, unicode)
+                and fp.encoding is not None
+            ):
+                errors = getattr(fp, "errors", None)
+                if errors is None:
+                    errors = "strict"
+                data = data.encode(fp.encoding, errors)
+            fp.write(data)
+
+        want_unicode = False
+        sep = kwargs.pop("sep", None)
+        if sep is not None:
+            if isinstance(sep, unicode):
+                want_unicode = True
+            elif not isinstance(sep, str):
+                raise TypeError("sep must be None or a string")
+        end = kwargs.pop("end", None)
+        if end is not None:
+            if isinstance(end, unicode):
+                want_unicode = True
+            elif not isinstance(end, str):
+                raise TypeError("end must be None or a string")
+        if kwargs:
+            raise TypeError("invalid keyword arguments to print()")
+        if not want_unicode:
+            for arg in args:
+                if isinstance(arg, unicode):
+                    want_unicode = True
+                    break
+        if want_unicode:
+            newline = unicode("\n")
+            space = unicode(" ")
+        else:
+            newline = "\n"
+            space = " "
+        if sep is None:
+            sep = space
+        if end is None:
+            end = newline
+        for i, arg in enumerate(args):
+            if i:
+                write(sep)
+            write(arg)
+        write(end)
+
+
+if sys.version_info[:2] < (3, 3):
+    _print = print_
+
+    def print_(*args, **kwargs):
+        fp = kwargs.get("file", sys.stdout)
+        flush = kwargs.pop("flush", False)
+        _print(*args, **kwargs)
+        if flush and fp is not None:
+            fp.flush()
+
+
+_add_doc(reraise, """Reraise an exception.""")
+
+if sys.version_info[0:2] < (3, 4):
+
+    def wraps(
+        wrapped,
+        assigned=functools.WRAPPER_ASSIGNMENTS,
+        updated=functools.WRAPPER_UPDATES,
+    ):
+        def wrapper(f):
+            f = functools.wraps(wrapped, assigned, updated)(f)
+            f.__wrapped__ = wrapped
+            return f
+
+        return wrapper
+
+
+else:
+    wraps = functools.wraps
+
+
+def with_metaclass(meta, *bases):
+    """Create a base class with a metaclass."""
+    # This requires a bit of explanation: the basic idea is to make a dummy
+    # metaclass for one level of class instantiation that replaces itself with
+    # the actual metaclass.
+    class metaclass(type):
+        def __new__(cls, name, this_bases, d):
+            return meta(name, bases, d)
+
+        @classmethod
+        def __prepare__(cls, name, this_bases):
+            return meta.__prepare__(name, bases)
+
+    return type.__new__(metaclass, "temporary_class", (), {})
+
+
+def add_metaclass(metaclass):
+    """Class decorator for creating a class with a metaclass."""
+
+    def wrapper(cls):
+        orig_vars = cls.__dict__.copy()
+        slots = orig_vars.get("__slots__")
+        if slots is not None:
+            if isinstance(slots, str):
+                slots = [slots]
+            for slots_var in slots:
+                orig_vars.pop(slots_var)
+        orig_vars.pop("__dict__", None)
+        orig_vars.pop("__weakref__", None)
+        if hasattr(cls, "__qualname__"):
+            orig_vars["__qualname__"] = cls.__qualname__
+        return metaclass(cls.__name__, cls.__bases__, orig_vars)
+
+    return wrapper
+
+
+def ensure_binary(s, encoding="utf-8", errors="strict"):
+    """Coerce **s** to six.binary_type.
+
+    For Python 2:
+      - `unicode` -> encoded to `str`
+      - `str` -> `str`
+
+    For Python 3:
+      - `str` -> encoded to `bytes`
+      - `bytes` -> `bytes`
+    """
+    if isinstance(s, text_type):
+        return s.encode(encoding, errors)
+    elif isinstance(s, binary_type):
+        return s
+    else:
+        raise TypeError("not expecting type '%s'" % type(s))
+
+
+def ensure_str(s, encoding="utf-8", errors="strict"):
+    """Coerce *s* to `str`.
+
+    For Python 2:
+      - `unicode` -> encoded to `str`
+      - `str` -> `str`
+
+    For Python 3:
+      - `str` -> `str`
+      - `bytes` -> decoded to `str`
+    """
+    if not isinstance(s, (text_type, binary_type)):
+        raise TypeError("not expecting type '%s'" % type(s))
+    if PY2 and isinstance(s, text_type):
+        s = s.encode(encoding, errors)
+    elif PY3 and isinstance(s, binary_type):
+        s = s.decode(encoding, errors)
+    return s
+
+
+def ensure_text(s, encoding="utf-8", errors="strict"):
+    """Coerce *s* to six.text_type.
+
+    For Python 2:
+      - `unicode` -> `unicode`
+      - `str` -> `unicode`
+
+    For Python 3:
+      - `str` -> `str`
+      - `bytes` -> decoded to `str`
+    """
+    if isinstance(s, binary_type):
+        return s.decode(encoding, errors)
+    elif isinstance(s, text_type):
+        return s
+    else:
+        raise TypeError("not expecting type '%s'" % type(s))
+
+
+def python_2_unicode_compatible(klass):
+    """
+    A decorator that defines __unicode__ and __str__ methods under Python 2.
+    Under Python 3 it does nothing.
+
+    To support Python 2 and 3 with a single code base, define a __str__ method
+    returning text and apply this decorator to the class.
+    """
+    if PY2:
+        if "__str__" not in klass.__dict__:
+            raise ValueError(
+                "@python_2_unicode_compatible cannot be applied "
+                "to %s because it doesn't define __str__()." % klass.__name__
+            )
+        klass.__unicode__ = klass.__str__
+        klass.__str__ = lambda self: self.__unicode__().encode("utf-8")
+    return klass
+
+
+# Complete the moves implementation.
+# This code is at the end of this module to speed up module loading.
+# Turn this module into a package.
+__path__ = []  # required for PEP 302 and PEP 451
+__package__ = __name__  # see PEP 366 @ReservedAssignment
+if globals().get("__spec__") is not None:
+    __spec__.submodule_search_locations = []  # PEP 451 @UndefinedVariable
+# Remove other six meta path importers, since they cause problems. This can
+# happen if six is removed from sys.modules and then reloaded. (Setuptools does
+# this for some reason.)
+if sys.meta_path:
+    for i, importer in enumerate(sys.meta_path):
+        # Here's some real nastiness: Another "instance" of the six module might
+        # be floating around. Therefore, we can't use isinstance() to check for
+        # the six meta path importer, since the other six instance will have
+        # inserted an importer with different class.
+        if (
+            type(importer).__name__ == "_SixMetaPathImporter"
+            and importer.name == __name__
+        ):
+            del sys.meta_path[i]
+            break
+    del i, importer
+# Finally, add the importer to the meta path import hook.
+sys.meta_path.append(_importer)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py
new file mode 100644
index 000000000..75b6bb1cf
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__init__.py
@@ -0,0 +1,19 @@
+import sys
+
+try:
+    # Our match_hostname function is the same as 3.5's, so we only want to
+    # import the match_hostname function if it's at least that good.
+    if sys.version_info < (3, 5):
+        raise ImportError("Fallback to vendored code")
+
+    from ssl import CertificateError, match_hostname
+except ImportError:
+    try:
+        # Backport of the function from a pypi module
+        from backports.ssl_match_hostname import CertificateError, match_hostname
+    except ImportError:
+        # Our vendored copy
+        from ._implementation import CertificateError, match_hostname
+
+# Not needed, but documenting what we provide.
+__all__ = ("CertificateError", "match_hostname")
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..17fdd7e14
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc
new file mode 100644
index 000000000..59d650662
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/__pycache__/_implementation.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py
new file mode 100644
index 000000000..5831c2e01
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/packages/ssl_match_hostname/_implementation.py
@@ -0,0 +1,160 @@
+"""The match_hostname() function from Python 3.3.3, essential when using SSL."""
+
+# Note: This file is under the PSF license as the code comes from the python
+# stdlib.   http://docs.python.org/3/license.html
+
+import re
+import sys
+
+# ipaddress has been backported to 2.6+ in pypi.  If it is installed on the
+# system, use it to handle IPAddress ServerAltnames (this was added in
+# python-3.5) otherwise only do DNS matching.  This allows
+# backports.ssl_match_hostname to continue to be used in Python 2.7.
+try:
+    from pip._vendor import ipaddress
+except ImportError:
+    ipaddress = None
+
+__version__ = "3.5.0.1"
+
+
+class CertificateError(ValueError):
+    pass
+
+
+def _dnsname_match(dn, hostname, max_wildcards=1):
+    """Matching according to RFC 6125, section 6.4.3
+
+    http://tools.ietf.org/html/rfc6125#section-6.4.3
+    """
+    pats = []
+    if not dn:
+        return False
+
+    # Ported from python3-syntax:
+    # leftmost, *remainder = dn.split(r'.')
+    parts = dn.split(r".")
+    leftmost = parts[0]
+    remainder = parts[1:]
+
+    wildcards = leftmost.count("*")
+    if wildcards > max_wildcards:
+        # Issue #17980: avoid denials of service by refusing more
+        # than one wildcard per fragment.  A survey of established
+        # policy among SSL implementations showed it to be a
+        # reasonable choice.
+        raise CertificateError(
+            "too many wildcards in certificate DNS name: " + repr(dn)
+        )
+
+    # speed up common case w/o wildcards
+    if not wildcards:
+        return dn.lower() == hostname.lower()
+
+    # RFC 6125, section 6.4.3, subitem 1.
+    # The client SHOULD NOT attempt to match a presented identifier in which
+    # the wildcard character comprises a label other than the left-most label.
+    if leftmost == "*":
+        # When '*' is a fragment by itself, it matches a non-empty dotless
+        # fragment.
+        pats.append("[^.]+")
+    elif leftmost.startswith("xn--") or hostname.startswith("xn--"):
+        # RFC 6125, section 6.4.3, subitem 3.
+        # The client SHOULD NOT attempt to match a presented identifier
+        # where the wildcard character is embedded within an A-label or
+        # U-label of an internationalized domain name.
+        pats.append(re.escape(leftmost))
+    else:
+        # Otherwise, '*' matches any dotless string, e.g. www*
+        pats.append(re.escape(leftmost).replace(r"\*", "[^.]*"))
+
+    # add the remaining fragments, ignore any wildcards
+    for frag in remainder:
+        pats.append(re.escape(frag))
+
+    pat = re.compile(r"\A" + r"\.".join(pats) + r"\Z", re.IGNORECASE)
+    return pat.match(hostname)
+
+
+def _to_unicode(obj):
+    if isinstance(obj, str) and sys.version_info < (3,):
+        obj = unicode(obj, encoding="ascii", errors="strict")
+    return obj
+
+
+def _ipaddress_match(ipname, host_ip):
+    """Exact matching of IP addresses.
+
+    RFC 6125 explicitly doesn't define an algorithm for this
+    (section 1.7.2 - "Out of Scope").
+    """
+    # OpenSSL may add a trailing newline to a subjectAltName's IP address
+    # Divergence from upstream: ipaddress can't handle byte str
+    ip = ipaddress.ip_address(_to_unicode(ipname).rstrip())
+    return ip == host_ip
+
+
+def match_hostname(cert, hostname):
+    """Verify that *cert* (in decoded format as returned by
+    SSLSocket.getpeercert()) matches the *hostname*.  RFC 2818 and RFC 6125
+    rules are followed, but IP addresses are not accepted for *hostname*.
+
+    CertificateError is raised on failure. On success, the function
+    returns nothing.
+    """
+    if not cert:
+        raise ValueError(
+            "empty or no certificate, match_hostname needs a "
+            "SSL socket or SSL context with either "
+            "CERT_OPTIONAL or CERT_REQUIRED"
+        )
+    try:
+        # Divergence from upstream: ipaddress can't handle byte str
+        host_ip = ipaddress.ip_address(_to_unicode(hostname))
+    except ValueError:
+        # Not an IP address (common case)
+        host_ip = None
+    except UnicodeError:
+        # Divergence from upstream: Have to deal with ipaddress not taking
+        # byte strings.  addresses should be all ascii, so we consider it not
+        # an ipaddress in this case
+        host_ip = None
+    except AttributeError:
+        # Divergence from upstream: Make ipaddress library optional
+        if ipaddress is None:
+            host_ip = None
+        else:
+            raise
+    dnsnames = []
+    san = cert.get("subjectAltName", ())
+    for key, value in san:
+        if key == "DNS":
+            if host_ip is None and _dnsname_match(value, hostname):
+                return
+            dnsnames.append(value)
+        elif key == "IP Address":
+            if host_ip is not None and _ipaddress_match(value, host_ip):
+                return
+            dnsnames.append(value)
+    if not dnsnames:
+        # The subject is only checked when there is no dNSName entry
+        # in subjectAltName
+        for sub in cert.get("subject", ()):
+            for key, value in sub:
+                # XXX according to RFC 2818, the most specific Common Name
+                # must be used.
+                if key == "commonName":
+                    if _dnsname_match(value, hostname):
+                        return
+                    dnsnames.append(value)
+    if len(dnsnames) > 1:
+        raise CertificateError(
+            "hostname %r "
+            "doesn't match either of %s" % (hostname, ", ".join(map(repr, dnsnames)))
+        )
+    elif len(dnsnames) == 1:
+        raise CertificateError("hostname %r doesn't match %r" % (hostname, dnsnames[0]))
+    else:
+        raise CertificateError(
+            "no appropriate commonName or subjectAltName fields were found"
+        )
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/poolmanager.py b/venv/Lib/site-packages/pip/_vendor/urllib3/poolmanager.py
new file mode 100644
index 000000000..e2bd3bd8d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/poolmanager.py
@@ -0,0 +1,492 @@
+from __future__ import absolute_import
+import collections
+import functools
+import logging
+import warnings
+
+from ._collections import RecentlyUsedContainer
+from .connectionpool import HTTPConnectionPool, HTTPSConnectionPool
+from .connectionpool import port_by_scheme
+from .exceptions import (
+    LocationValueError,
+    MaxRetryError,
+    ProxySchemeUnknown,
+    InvalidProxyConfigurationWarning,
+)
+from .packages import six
+from .packages.six.moves.urllib.parse import urljoin
+from .request import RequestMethods
+from .util.url import parse_url
+from .util.retry import Retry
+
+
+__all__ = ["PoolManager", "ProxyManager", "proxy_from_url"]
+
+
+log = logging.getLogger(__name__)
+
+SSL_KEYWORDS = (
+    "key_file",
+    "cert_file",
+    "cert_reqs",
+    "ca_certs",
+    "ssl_version",
+    "ca_cert_dir",
+    "ssl_context",
+    "key_password",
+)
+
+# All known keyword arguments that could be provided to the pool manager, its
+# pools, or the underlying connections. This is used to construct a pool key.
+_key_fields = (
+    "key_scheme",  # str
+    "key_host",  # str
+    "key_port",  # int
+    "key_timeout",  # int or float or Timeout
+    "key_retries",  # int or Retry
+    "key_strict",  # bool
+    "key_block",  # bool
+    "key_source_address",  # str
+    "key_key_file",  # str
+    "key_key_password",  # str
+    "key_cert_file",  # str
+    "key_cert_reqs",  # str
+    "key_ca_certs",  # str
+    "key_ssl_version",  # str
+    "key_ca_cert_dir",  # str
+    "key_ssl_context",  # instance of ssl.SSLContext or urllib3.util.ssl_.SSLContext
+    "key_maxsize",  # int
+    "key_headers",  # dict
+    "key__proxy",  # parsed proxy url
+    "key__proxy_headers",  # dict
+    "key_socket_options",  # list of (level (int), optname (int), value (int or str)) tuples
+    "key__socks_options",  # dict
+    "key_assert_hostname",  # bool or string
+    "key_assert_fingerprint",  # str
+    "key_server_hostname",  # str
+)
+
+#: The namedtuple class used to construct keys for the connection pool.
+#: All custom key schemes should include the fields in this key at a minimum.
+PoolKey = collections.namedtuple("PoolKey", _key_fields)
+
+
+def _default_key_normalizer(key_class, request_context):
+    """
+    Create a pool key out of a request context dictionary.
+
+    According to RFC 3986, both the scheme and host are case-insensitive.
+    Therefore, this function normalizes both before constructing the pool
+    key for an HTTPS request. If you wish to change this behaviour, provide
+    alternate callables to ``key_fn_by_scheme``.
+
+    :param key_class:
+        The class to use when constructing the key. This should be a namedtuple
+        with the ``scheme`` and ``host`` keys at a minimum.
+    :type  key_class: namedtuple
+    :param request_context:
+        A dictionary-like object that contain the context for a request.
+    :type  request_context: dict
+
+    :return: A namedtuple that can be used as a connection pool key.
+    :rtype:  PoolKey
+    """
+    # Since we mutate the dictionary, make a copy first
+    context = request_context.copy()
+    context["scheme"] = context["scheme"].lower()
+    context["host"] = context["host"].lower()
+
+    # These are both dictionaries and need to be transformed into frozensets
+    for key in ("headers", "_proxy_headers", "_socks_options"):
+        if key in context and context[key] is not None:
+            context[key] = frozenset(context[key].items())
+
+    # The socket_options key may be a list and needs to be transformed into a
+    # tuple.
+    socket_opts = context.get("socket_options")
+    if socket_opts is not None:
+        context["socket_options"] = tuple(socket_opts)
+
+    # Map the kwargs to the names in the namedtuple - this is necessary since
+    # namedtuples can't have fields starting with '_'.
+    for key in list(context.keys()):
+        context["key_" + key] = context.pop(key)
+
+    # Default to ``None`` for keys missing from the context
+    for field in key_class._fields:
+        if field not in context:
+            context[field] = None
+
+    return key_class(**context)
+
+
+#: A dictionary that maps a scheme to a callable that creates a pool key.
+#: This can be used to alter the way pool keys are constructed, if desired.
+#: Each PoolManager makes a copy of this dictionary so they can be configured
+#: globally here, or individually on the instance.
+key_fn_by_scheme = {
+    "http": functools.partial(_default_key_normalizer, PoolKey),
+    "https": functools.partial(_default_key_normalizer, PoolKey),
+}
+
+pool_classes_by_scheme = {"http": HTTPConnectionPool, "https": HTTPSConnectionPool}
+
+
+class PoolManager(RequestMethods):
+    """
+    Allows for arbitrary requests while transparently keeping track of
+    necessary connection pools for you.
+
+    :param num_pools:
+        Number of connection pools to cache before discarding the least
+        recently used pool.
+
+    :param headers:
+        Headers to include with all requests, unless other headers are given
+        explicitly.
+
+    :param \\**connection_pool_kw:
+        Additional parameters are used to create fresh
+        :class:`urllib3.connectionpool.ConnectionPool` instances.
+
+    Example::
+
+        >>> manager = PoolManager(num_pools=2)
+        >>> r = manager.request('GET', 'http://google.com/')
+        >>> r = manager.request('GET', 'http://google.com/mail')
+        >>> r = manager.request('GET', 'http://yahoo.com/')
+        >>> len(manager.pools)
+        2
+
+    """
+
+    proxy = None
+
+    def __init__(self, num_pools=10, headers=None, **connection_pool_kw):
+        RequestMethods.__init__(self, headers)
+        self.connection_pool_kw = connection_pool_kw
+        self.pools = RecentlyUsedContainer(num_pools, dispose_func=lambda p: p.close())
+
+        # Locally set the pool classes and keys so other PoolManagers can
+        # override them.
+        self.pool_classes_by_scheme = pool_classes_by_scheme
+        self.key_fn_by_scheme = key_fn_by_scheme.copy()
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, exc_type, exc_val, exc_tb):
+        self.clear()
+        # Return False to re-raise any potential exceptions
+        return False
+
+    def _new_pool(self, scheme, host, port, request_context=None):
+        """
+        Create a new :class:`ConnectionPool` based on host, port, scheme, and
+        any additional pool keyword arguments.
+
+        If ``request_context`` is provided, it is provided as keyword arguments
+        to the pool class used. This method is used to actually create the
+        connection pools handed out by :meth:`connection_from_url` and
+        companion methods. It is intended to be overridden for customization.
+        """
+        pool_cls = self.pool_classes_by_scheme[scheme]
+        if request_context is None:
+            request_context = self.connection_pool_kw.copy()
+
+        # Although the context has everything necessary to create the pool,
+        # this function has historically only used the scheme, host, and port
+        # in the positional args. When an API change is acceptable these can
+        # be removed.
+        for key in ("scheme", "host", "port"):
+            request_context.pop(key, None)
+
+        if scheme == "http":
+            for kw in SSL_KEYWORDS:
+                request_context.pop(kw, None)
+
+        return pool_cls(host, port, **request_context)
+
+    def clear(self):
+        """
+        Empty our store of pools and direct them all to close.
+
+        This will not affect in-flight connections, but they will not be
+        re-used after completion.
+        """
+        self.pools.clear()
+
+    def connection_from_host(self, host, port=None, scheme="http", pool_kwargs=None):
+        """
+        Get a :class:`ConnectionPool` based on the host, port, and scheme.
+
+        If ``port`` isn't given, it will be derived from the ``scheme`` using
+        ``urllib3.connectionpool.port_by_scheme``. If ``pool_kwargs`` is
+        provided, it is merged with the instance's ``connection_pool_kw``
+        variable and used to create the new connection pool, if one is
+        needed.
+        """
+
+        if not host:
+            raise LocationValueError("No host specified.")
+
+        request_context = self._merge_pool_kwargs(pool_kwargs)
+        request_context["scheme"] = scheme or "http"
+        if not port:
+            port = port_by_scheme.get(request_context["scheme"].lower(), 80)
+        request_context["port"] = port
+        request_context["host"] = host
+
+        return self.connection_from_context(request_context)
+
+    def connection_from_context(self, request_context):
+        """
+        Get a :class:`ConnectionPool` based on the request context.
+
+        ``request_context`` must at least contain the ``scheme`` key and its
+        value must be a key in ``key_fn_by_scheme`` instance variable.
+        """
+        scheme = request_context["scheme"].lower()
+        pool_key_constructor = self.key_fn_by_scheme[scheme]
+        pool_key = pool_key_constructor(request_context)
+
+        return self.connection_from_pool_key(pool_key, request_context=request_context)
+
+    def connection_from_pool_key(self, pool_key, request_context=None):
+        """
+        Get a :class:`ConnectionPool` based on the provided pool key.
+
+        ``pool_key`` should be a namedtuple that only contains immutable
+        objects. At a minimum it must have the ``scheme``, ``host``, and
+        ``port`` fields.
+        """
+        with self.pools.lock:
+            # If the scheme, host, or port doesn't match existing open
+            # connections, open a new ConnectionPool.
+            pool = self.pools.get(pool_key)
+            if pool:
+                return pool
+
+            # Make a fresh ConnectionPool of the desired type
+            scheme = request_context["scheme"]
+            host = request_context["host"]
+            port = request_context["port"]
+            pool = self._new_pool(scheme, host, port, request_context=request_context)
+            self.pools[pool_key] = pool
+
+        return pool
+
+    def connection_from_url(self, url, pool_kwargs=None):
+        """
+        Similar to :func:`urllib3.connectionpool.connection_from_url`.
+
+        If ``pool_kwargs`` is not provided and a new pool needs to be
+        constructed, ``self.connection_pool_kw`` is used to initialize
+        the :class:`urllib3.connectionpool.ConnectionPool`. If ``pool_kwargs``
+        is provided, it is used instead. Note that if a new pool does not
+        need to be created for the request, the provided ``pool_kwargs`` are
+        not used.
+        """
+        u = parse_url(url)
+        return self.connection_from_host(
+            u.host, port=u.port, scheme=u.scheme, pool_kwargs=pool_kwargs
+        )
+
+    def _merge_pool_kwargs(self, override):
+        """
+        Merge a dictionary of override values for self.connection_pool_kw.
+
+        This does not modify self.connection_pool_kw and returns a new dict.
+        Any keys in the override dictionary with a value of ``None`` are
+        removed from the merged dictionary.
+        """
+        base_pool_kwargs = self.connection_pool_kw.copy()
+        if override:
+            for key, value in override.items():
+                if value is None:
+                    try:
+                        del base_pool_kwargs[key]
+                    except KeyError:
+                        pass
+                else:
+                    base_pool_kwargs[key] = value
+        return base_pool_kwargs
+
+    def urlopen(self, method, url, redirect=True, **kw):
+        """
+        Same as :meth:`urllib3.connectionpool.HTTPConnectionPool.urlopen`
+        with custom cross-host redirect logic and only sends the request-uri
+        portion of the ``url``.
+
+        The given ``url`` parameter must be absolute, such that an appropriate
+        :class:`urllib3.connectionpool.ConnectionPool` can be chosen for it.
+        """
+        u = parse_url(url)
+        conn = self.connection_from_host(u.host, port=u.port, scheme=u.scheme)
+
+        kw["assert_same_host"] = False
+        kw["redirect"] = False
+
+        if "headers" not in kw:
+            kw["headers"] = self.headers.copy()
+
+        if self.proxy is not None and u.scheme == "http":
+            response = conn.urlopen(method, url, **kw)
+        else:
+            response = conn.urlopen(method, u.request_uri, **kw)
+
+        redirect_location = redirect and response.get_redirect_location()
+        if not redirect_location:
+            return response
+
+        # Support relative URLs for redirecting.
+        redirect_location = urljoin(url, redirect_location)
+
+        # RFC 7231, Section 6.4.4
+        if response.status == 303:
+            method = "GET"
+
+        retries = kw.get("retries")
+        if not isinstance(retries, Retry):
+            retries = Retry.from_int(retries, redirect=redirect)
+
+        # Strip headers marked as unsafe to forward to the redirected location.
+        # Check remove_headers_on_redirect to avoid a potential network call within
+        # conn.is_same_host() which may use socket.gethostbyname() in the future.
+        if retries.remove_headers_on_redirect and not conn.is_same_host(
+            redirect_location
+        ):
+            headers = list(six.iterkeys(kw["headers"]))
+            for header in headers:
+                if header.lower() in retries.remove_headers_on_redirect:
+                    kw["headers"].pop(header, None)
+
+        try:
+            retries = retries.increment(method, url, response=response, _pool=conn)
+        except MaxRetryError:
+            if retries.raise_on_redirect:
+                response.drain_conn()
+                raise
+            return response
+
+        kw["retries"] = retries
+        kw["redirect"] = redirect
+
+        log.info("Redirecting %s -> %s", url, redirect_location)
+
+        response.drain_conn()
+        return self.urlopen(method, redirect_location, **kw)
+
+
+class ProxyManager(PoolManager):
+    """
+    Behaves just like :class:`PoolManager`, but sends all requests through
+    the defined proxy, using the CONNECT method for HTTPS URLs.
+
+    :param proxy_url:
+        The URL of the proxy to be used.
+
+    :param proxy_headers:
+        A dictionary containing headers that will be sent to the proxy. In case
+        of HTTP they are being sent with each request, while in the
+        HTTPS/CONNECT case they are sent only once. Could be used for proxy
+        authentication.
+
+    Example:
+        >>> proxy = urllib3.ProxyManager('http://localhost:3128/')
+        >>> r1 = proxy.request('GET', 'http://google.com/')
+        >>> r2 = proxy.request('GET', 'http://httpbin.org/')
+        >>> len(proxy.pools)
+        1
+        >>> r3 = proxy.request('GET', 'https://httpbin.org/')
+        >>> r4 = proxy.request('GET', 'https://twitter.com/')
+        >>> len(proxy.pools)
+        3
+
+    """
+
+    def __init__(
+        self,
+        proxy_url,
+        num_pools=10,
+        headers=None,
+        proxy_headers=None,
+        **connection_pool_kw
+    ):
+
+        if isinstance(proxy_url, HTTPConnectionPool):
+            proxy_url = "%s://%s:%i" % (
+                proxy_url.scheme,
+                proxy_url.host,
+                proxy_url.port,
+            )
+        proxy = parse_url(proxy_url)
+        if not proxy.port:
+            port = port_by_scheme.get(proxy.scheme, 80)
+            proxy = proxy._replace(port=port)
+
+        if proxy.scheme not in ("http", "https"):
+            raise ProxySchemeUnknown(proxy.scheme)
+
+        self.proxy = proxy
+        self.proxy_headers = proxy_headers or {}
+
+        connection_pool_kw["_proxy"] = self.proxy
+        connection_pool_kw["_proxy_headers"] = self.proxy_headers
+
+        super(ProxyManager, self).__init__(num_pools, headers, **connection_pool_kw)
+
+    def connection_from_host(self, host, port=None, scheme="http", pool_kwargs=None):
+        if scheme == "https":
+            return super(ProxyManager, self).connection_from_host(
+                host, port, scheme, pool_kwargs=pool_kwargs
+            )
+
+        return super(ProxyManager, self).connection_from_host(
+            self.proxy.host, self.proxy.port, self.proxy.scheme, pool_kwargs=pool_kwargs
+        )
+
+    def _set_proxy_headers(self, url, headers=None):
+        """
+        Sets headers needed by proxies: specifically, the Accept and Host
+        headers. Only sets headers not provided by the user.
+        """
+        headers_ = {"Accept": "*/*"}
+
+        netloc = parse_url(url).netloc
+        if netloc:
+            headers_["Host"] = netloc
+
+        if headers:
+            headers_.update(headers)
+        return headers_
+
+    def _validate_proxy_scheme_url_selection(self, url_scheme):
+        if url_scheme == "https" and self.proxy.scheme == "https":
+            warnings.warn(
+                "Your proxy configuration specified an HTTPS scheme for the proxy. "
+                "Are you sure you want to use HTTPS to contact the proxy? "
+                "This most likely indicates an error in your configuration. "
+                "Read this issue for more info: "
+                "https://github.com/urllib3/urllib3/issues/1850",
+                InvalidProxyConfigurationWarning,
+                stacklevel=3,
+            )
+
+    def urlopen(self, method, url, redirect=True, **kw):
+        "Same as HTTP(S)ConnectionPool.urlopen, ``url`` must be absolute."
+        u = parse_url(url)
+        self._validate_proxy_scheme_url_selection(u.scheme)
+
+        if u.scheme == "http":
+            # For proxied HTTPS requests, httplib sets the necessary headers
+            # on the CONNECT to the proxy. For HTTP, we'll definitely
+            # need to set 'Host' at the very least.
+            headers = kw.get("headers", self.headers)
+            kw["headers"] = self._set_proxy_headers(url, headers)
+
+        return super(ProxyManager, self).urlopen(method, url, redirect=redirect, **kw)
+
+
+def proxy_from_url(url, **kw):
+    return ProxyManager(proxy_url=url, **kw)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/request.py b/venv/Lib/site-packages/pip/_vendor/urllib3/request.py
new file mode 100644
index 000000000..55f160bbf
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/request.py
@@ -0,0 +1,171 @@
+from __future__ import absolute_import
+
+from .filepost import encode_multipart_formdata
+from .packages.six.moves.urllib.parse import urlencode
+
+
+__all__ = ["RequestMethods"]
+
+
+class RequestMethods(object):
+    """
+    Convenience mixin for classes who implement a :meth:`urlopen` method, such
+    as :class:`~urllib3.connectionpool.HTTPConnectionPool` and
+    :class:`~urllib3.poolmanager.PoolManager`.
+
+    Provides behavior for making common types of HTTP request methods and
+    decides which type of request field encoding to use.
+
+    Specifically,
+
+    :meth:`.request_encode_url` is for sending requests whose fields are
+    encoded in the URL (such as GET, HEAD, DELETE).
+
+    :meth:`.request_encode_body` is for sending requests whose fields are
+    encoded in the *body* of the request using multipart or www-form-urlencoded
+    (such as for POST, PUT, PATCH).
+
+    :meth:`.request` is for making any kind of request, it will look up the
+    appropriate encoding format and use one of the above two methods to make
+    the request.
+
+    Initializer parameters:
+
+    :param headers:
+        Headers to include with all requests, unless other headers are given
+        explicitly.
+    """
+
+    _encode_url_methods = {"DELETE", "GET", "HEAD", "OPTIONS"}
+
+    def __init__(self, headers=None):
+        self.headers = headers or {}
+
+    def urlopen(
+        self,
+        method,
+        url,
+        body=None,
+        headers=None,
+        encode_multipart=True,
+        multipart_boundary=None,
+        **kw
+    ):  # Abstract
+        raise NotImplementedError(
+            "Classes extending RequestMethods must implement "
+            "their own ``urlopen`` method."
+        )
+
+    def request(self, method, url, fields=None, headers=None, **urlopen_kw):
+        """
+        Make a request using :meth:`urlopen` with the appropriate encoding of
+        ``fields`` based on the ``method`` used.
+
+        This is a convenience method that requires the least amount of manual
+        effort. It can be used in most situations, while still having the
+        option to drop down to more specific methods when necessary, such as
+        :meth:`request_encode_url`, :meth:`request_encode_body`,
+        or even the lowest level :meth:`urlopen`.
+        """
+        method = method.upper()
+
+        urlopen_kw["request_url"] = url
+
+        if method in self._encode_url_methods:
+            return self.request_encode_url(
+                method, url, fields=fields, headers=headers, **urlopen_kw
+            )
+        else:
+            return self.request_encode_body(
+                method, url, fields=fields, headers=headers, **urlopen_kw
+            )
+
+    def request_encode_url(self, method, url, fields=None, headers=None, **urlopen_kw):
+        """
+        Make a request using :meth:`urlopen` with the ``fields`` encoded in
+        the url. This is useful for request methods like GET, HEAD, DELETE, etc.
+        """
+        if headers is None:
+            headers = self.headers
+
+        extra_kw = {"headers": headers}
+        extra_kw.update(urlopen_kw)
+
+        if fields:
+            url += "?" + urlencode(fields)
+
+        return self.urlopen(method, url, **extra_kw)
+
+    def request_encode_body(
+        self,
+        method,
+        url,
+        fields=None,
+        headers=None,
+        encode_multipart=True,
+        multipart_boundary=None,
+        **urlopen_kw
+    ):
+        """
+        Make a request using :meth:`urlopen` with the ``fields`` encoded in
+        the body. This is useful for request methods like POST, PUT, PATCH, etc.
+
+        When ``encode_multipart=True`` (default), then
+        :meth:`urllib3.filepost.encode_multipart_formdata` is used to encode
+        the payload with the appropriate content type. Otherwise
+        :meth:`urllib.urlencode` is used with the
+        'application/x-www-form-urlencoded' content type.
+
+        Multipart encoding must be used when posting files, and it's reasonably
+        safe to use it in other times too. However, it may break request
+        signing, such as with OAuth.
+
+        Supports an optional ``fields`` parameter of key/value strings AND
+        key/filetuple. A filetuple is a (filename, data, MIME type) tuple where
+        the MIME type is optional. For example::
+
+            fields = {
+                'foo': 'bar',
+                'fakefile': ('foofile.txt', 'contents of foofile'),
+                'realfile': ('barfile.txt', open('realfile').read()),
+                'typedfile': ('bazfile.bin', open('bazfile').read(),
+                              'image/jpeg'),
+                'nonamefile': 'contents of nonamefile field',
+            }
+
+        When uploading a file, providing a filename (the first parameter of the
+        tuple) is optional but recommended to best mimic behavior of browsers.
+
+        Note that if ``headers`` are supplied, the 'Content-Type' header will
+        be overwritten because it depends on the dynamic random boundary string
+        which is used to compose the body of the request. The random boundary
+        string can be explicitly set with the ``multipart_boundary`` parameter.
+        """
+        if headers is None:
+            headers = self.headers
+
+        extra_kw = {"headers": {}}
+
+        if fields:
+            if "body" in urlopen_kw:
+                raise TypeError(
+                    "request got values for both 'fields' and 'body', can only specify one."
+                )
+
+            if encode_multipart:
+                body, content_type = encode_multipart_formdata(
+                    fields, boundary=multipart_boundary
+                )
+            else:
+                body, content_type = (
+                    urlencode(fields),
+                    "application/x-www-form-urlencoded",
+                )
+
+            extra_kw["body"] = body
+            extra_kw["headers"] = {"Content-Type": content_type}
+
+        extra_kw["headers"].update(headers)
+        extra_kw.update(urlopen_kw)
+
+        return self.urlopen(method, url, **extra_kw)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/response.py b/venv/Lib/site-packages/pip/_vendor/urllib3/response.py
new file mode 100644
index 000000000..7dc9b93ca
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/response.py
@@ -0,0 +1,821 @@
+from __future__ import absolute_import
+from contextlib import contextmanager
+import zlib
+import io
+import logging
+from socket import timeout as SocketTimeout
+from socket import error as SocketError
+
+try:
+    import brotli
+except ImportError:
+    brotli = None
+
+from ._collections import HTTPHeaderDict
+from .exceptions import (
+    BodyNotHttplibCompatible,
+    ProtocolError,
+    DecodeError,
+    ReadTimeoutError,
+    ResponseNotChunked,
+    IncompleteRead,
+    InvalidHeader,
+    HTTPError,
+)
+from .packages.six import string_types as basestring, PY3
+from .packages.six.moves import http_client as httplib
+from .connection import HTTPException, BaseSSLError
+from .util.response import is_fp_closed, is_response_to_head
+
+log = logging.getLogger(__name__)
+
+
+class DeflateDecoder(object):
+    def __init__(self):
+        self._first_try = True
+        self._data = b""
+        self._obj = zlib.decompressobj()
+
+    def __getattr__(self, name):
+        return getattr(self._obj, name)
+
+    def decompress(self, data):
+        if not data:
+            return data
+
+        if not self._first_try:
+            return self._obj.decompress(data)
+
+        self._data += data
+        try:
+            decompressed = self._obj.decompress(data)
+            if decompressed:
+                self._first_try = False
+                self._data = None
+            return decompressed
+        except zlib.error:
+            self._first_try = False
+            self._obj = zlib.decompressobj(-zlib.MAX_WBITS)
+            try:
+                return self.decompress(self._data)
+            finally:
+                self._data = None
+
+
+class GzipDecoderState(object):
+
+    FIRST_MEMBER = 0
+    OTHER_MEMBERS = 1
+    SWALLOW_DATA = 2
+
+
+class GzipDecoder(object):
+    def __init__(self):
+        self._obj = zlib.decompressobj(16 + zlib.MAX_WBITS)
+        self._state = GzipDecoderState.FIRST_MEMBER
+
+    def __getattr__(self, name):
+        return getattr(self._obj, name)
+
+    def decompress(self, data):
+        ret = bytearray()
+        if self._state == GzipDecoderState.SWALLOW_DATA or not data:
+            return bytes(ret)
+        while True:
+            try:
+                ret += self._obj.decompress(data)
+            except zlib.error:
+                previous_state = self._state
+                # Ignore data after the first error
+                self._state = GzipDecoderState.SWALLOW_DATA
+                if previous_state == GzipDecoderState.OTHER_MEMBERS:
+                    # Allow trailing garbage acceptable in other gzip clients
+                    return bytes(ret)
+                raise
+            data = self._obj.unused_data
+            if not data:
+                return bytes(ret)
+            self._state = GzipDecoderState.OTHER_MEMBERS
+            self._obj = zlib.decompressobj(16 + zlib.MAX_WBITS)
+
+
+if brotli is not None:
+
+    class BrotliDecoder(object):
+        # Supports both 'brotlipy' and 'Brotli' packages
+        # since they share an import name. The top branches
+        # are for 'brotlipy' and bottom branches for 'Brotli'
+        def __init__(self):
+            self._obj = brotli.Decompressor()
+
+        def decompress(self, data):
+            if hasattr(self._obj, "decompress"):
+                return self._obj.decompress(data)
+            return self._obj.process(data)
+
+        def flush(self):
+            if hasattr(self._obj, "flush"):
+                return self._obj.flush()
+            return b""
+
+
+class MultiDecoder(object):
+    """
+    From RFC7231:
+        If one or more encodings have been applied to a representation, the
+        sender that applied the encodings MUST generate a Content-Encoding
+        header field that lists the content codings in the order in which
+        they were applied.
+    """
+
+    def __init__(self, modes):
+        self._decoders = [_get_decoder(m.strip()) for m in modes.split(",")]
+
+    def flush(self):
+        return self._decoders[0].flush()
+
+    def decompress(self, data):
+        for d in reversed(self._decoders):
+            data = d.decompress(data)
+        return data
+
+
+def _get_decoder(mode):
+    if "," in mode:
+        return MultiDecoder(mode)
+
+    if mode == "gzip":
+        return GzipDecoder()
+
+    if brotli is not None and mode == "br":
+        return BrotliDecoder()
+
+    return DeflateDecoder()
+
+
+class HTTPResponse(io.IOBase):
+    """
+    HTTP Response container.
+
+    Backwards-compatible to httplib's HTTPResponse but the response ``body`` is
+    loaded and decoded on-demand when the ``data`` property is accessed.  This
+    class is also compatible with the Python standard library's :mod:`io`
+    module, and can hence be treated as a readable object in the context of that
+    framework.
+
+    Extra parameters for behaviour not present in httplib.HTTPResponse:
+
+    :param preload_content:
+        If True, the response's body will be preloaded during construction.
+
+    :param decode_content:
+        If True, will attempt to decode the body based on the
+        'content-encoding' header.
+
+    :param original_response:
+        When this HTTPResponse wrapper is generated from an httplib.HTTPResponse
+        object, it's convenient to include the original for debug purposes. It's
+        otherwise unused.
+
+    :param retries:
+        The retries contains the last :class:`~urllib3.util.retry.Retry` that
+        was used during the request.
+
+    :param enforce_content_length:
+        Enforce content length checking. Body returned by server must match
+        value of Content-Length header, if present. Otherwise, raise error.
+    """
+
+    CONTENT_DECODERS = ["gzip", "deflate"]
+    if brotli is not None:
+        CONTENT_DECODERS += ["br"]
+    REDIRECT_STATUSES = [301, 302, 303, 307, 308]
+
+    def __init__(
+        self,
+        body="",
+        headers=None,
+        status=0,
+        version=0,
+        reason=None,
+        strict=0,
+        preload_content=True,
+        decode_content=True,
+        original_response=None,
+        pool=None,
+        connection=None,
+        msg=None,
+        retries=None,
+        enforce_content_length=False,
+        request_method=None,
+        request_url=None,
+        auto_close=True,
+    ):
+
+        if isinstance(headers, HTTPHeaderDict):
+            self.headers = headers
+        else:
+            self.headers = HTTPHeaderDict(headers)
+        self.status = status
+        self.version = version
+        self.reason = reason
+        self.strict = strict
+        self.decode_content = decode_content
+        self.retries = retries
+        self.enforce_content_length = enforce_content_length
+        self.auto_close = auto_close
+
+        self._decoder = None
+        self._body = None
+        self._fp = None
+        self._original_response = original_response
+        self._fp_bytes_read = 0
+        self.msg = msg
+        self._request_url = request_url
+
+        if body and isinstance(body, (basestring, bytes)):
+            self._body = body
+
+        self._pool = pool
+        self._connection = connection
+
+        if hasattr(body, "read"):
+            self._fp = body
+
+        # Are we using the chunked-style of transfer encoding?
+        self.chunked = False
+        self.chunk_left = None
+        tr_enc = self.headers.get("transfer-encoding", "").lower()
+        # Don't incur the penalty of creating a list and then discarding it
+        encodings = (enc.strip() for enc in tr_enc.split(","))
+        if "chunked" in encodings:
+            self.chunked = True
+
+        # Determine length of response
+        self.length_remaining = self._init_length(request_method)
+
+        # If requested, preload the body.
+        if preload_content and not self._body:
+            self._body = self.read(decode_content=decode_content)
+
+    def get_redirect_location(self):
+        """
+        Should we redirect and where to?
+
+        :returns: Truthy redirect location string if we got a redirect status
+            code and valid location. ``None`` if redirect status and no
+            location. ``False`` if not a redirect status code.
+        """
+        if self.status in self.REDIRECT_STATUSES:
+            return self.headers.get("location")
+
+        return False
+
+    def release_conn(self):
+        if not self._pool or not self._connection:
+            return
+
+        self._pool._put_conn(self._connection)
+        self._connection = None
+
+    def drain_conn(self):
+        """
+        Read and discard any remaining HTTP response data in the response connection.
+
+        Unread data in the HTTPResponse connection blocks the connection from being released back to the pool.
+        """
+        try:
+            self.read()
+        except (HTTPError, SocketError, BaseSSLError, HTTPException):
+            pass
+
+    @property
+    def data(self):
+        # For backwords-compat with earlier urllib3 0.4 and earlier.
+        if self._body:
+            return self._body
+
+        if self._fp:
+            return self.read(cache_content=True)
+
+    @property
+    def connection(self):
+        return self._connection
+
+    def isclosed(self):
+        return is_fp_closed(self._fp)
+
+    def tell(self):
+        """
+        Obtain the number of bytes pulled over the wire so far. May differ from
+        the amount of content returned by :meth:``HTTPResponse.read`` if bytes
+        are encoded on the wire (e.g, compressed).
+        """
+        return self._fp_bytes_read
+
+    def _init_length(self, request_method):
+        """
+        Set initial length value for Response content if available.
+        """
+        length = self.headers.get("content-length")
+
+        if length is not None:
+            if self.chunked:
+                # This Response will fail with an IncompleteRead if it can't be
+                # received as chunked. This method falls back to attempt reading
+                # the response before raising an exception.
+                log.warning(
+                    "Received response with both Content-Length and "
+                    "Transfer-Encoding set. This is expressly forbidden "
+                    "by RFC 7230 sec 3.3.2. Ignoring Content-Length and "
+                    "attempting to process response as Transfer-Encoding: "
+                    "chunked."
+                )
+                return None
+
+            try:
+                # RFC 7230 section 3.3.2 specifies multiple content lengths can
+                # be sent in a single Content-Length header
+                # (e.g. Content-Length: 42, 42). This line ensures the values
+                # are all valid ints and that as long as the `set` length is 1,
+                # all values are the same. Otherwise, the header is invalid.
+                lengths = set([int(val) for val in length.split(",")])
+                if len(lengths) > 1:
+                    raise InvalidHeader(
+                        "Content-Length contained multiple "
+                        "unmatching values (%s)" % length
+                    )
+                length = lengths.pop()
+            except ValueError:
+                length = None
+            else:
+                if length < 0:
+                    length = None
+
+        # Convert status to int for comparison
+        # In some cases, httplib returns a status of "_UNKNOWN"
+        try:
+            status = int(self.status)
+        except ValueError:
+            status = 0
+
+        # Check for responses that shouldn't include a body
+        if status in (204, 304) or 100 <= status < 200 or request_method == "HEAD":
+            length = 0
+
+        return length
+
+    def _init_decoder(self):
+        """
+        Set-up the _decoder attribute if necessary.
+        """
+        # Note: content-encoding value should be case-insensitive, per RFC 7230
+        # Section 3.2
+        content_encoding = self.headers.get("content-encoding", "").lower()
+        if self._decoder is None:
+            if content_encoding in self.CONTENT_DECODERS:
+                self._decoder = _get_decoder(content_encoding)
+            elif "," in content_encoding:
+                encodings = [
+                    e.strip()
+                    for e in content_encoding.split(",")
+                    if e.strip() in self.CONTENT_DECODERS
+                ]
+                if len(encodings):
+                    self._decoder = _get_decoder(content_encoding)
+
+    DECODER_ERROR_CLASSES = (IOError, zlib.error)
+    if brotli is not None:
+        DECODER_ERROR_CLASSES += (brotli.error,)
+
+    def _decode(self, data, decode_content, flush_decoder):
+        """
+        Decode the data passed in and potentially flush the decoder.
+        """
+        if not decode_content:
+            return data
+
+        try:
+            if self._decoder:
+                data = self._decoder.decompress(data)
+        except self.DECODER_ERROR_CLASSES as e:
+            content_encoding = self.headers.get("content-encoding", "").lower()
+            raise DecodeError(
+                "Received response with content-encoding: %s, but "
+                "failed to decode it." % content_encoding,
+                e,
+            )
+        if flush_decoder:
+            data += self._flush_decoder()
+
+        return data
+
+    def _flush_decoder(self):
+        """
+        Flushes the decoder. Should only be called if the decoder is actually
+        being used.
+        """
+        if self._decoder:
+            buf = self._decoder.decompress(b"")
+            return buf + self._decoder.flush()
+
+        return b""
+
+    @contextmanager
+    def _error_catcher(self):
+        """
+        Catch low-level python exceptions, instead re-raising urllib3
+        variants, so that low-level exceptions are not leaked in the
+        high-level api.
+
+        On exit, release the connection back to the pool.
+        """
+        clean_exit = False
+
+        try:
+            try:
+                yield
+
+            except SocketTimeout:
+                # FIXME: Ideally we'd like to include the url in the ReadTimeoutError but
+                # there is yet no clean way to get at it from this context.
+                raise ReadTimeoutError(self._pool, None, "Read timed out.")
+
+            except BaseSSLError as e:
+                # FIXME: Is there a better way to differentiate between SSLErrors?
+                if "read operation timed out" not in str(e):  # Defensive:
+                    # This shouldn't happen but just in case we're missing an edge
+                    # case, let's avoid swallowing SSL errors.
+                    raise
+
+                raise ReadTimeoutError(self._pool, None, "Read timed out.")
+
+            except (HTTPException, SocketError) as e:
+                # This includes IncompleteRead.
+                raise ProtocolError("Connection broken: %r" % e, e)
+
+            # If no exception is thrown, we should avoid cleaning up
+            # unnecessarily.
+            clean_exit = True
+        finally:
+            # If we didn't terminate cleanly, we need to throw away our
+            # connection.
+            if not clean_exit:
+                # The response may not be closed but we're not going to use it
+                # anymore so close it now to ensure that the connection is
+                # released back to the pool.
+                if self._original_response:
+                    self._original_response.close()
+
+                # Closing the response may not actually be sufficient to close
+                # everything, so if we have a hold of the connection close that
+                # too.
+                if self._connection:
+                    self._connection.close()
+
+            # If we hold the original response but it's closed now, we should
+            # return the connection back to the pool.
+            if self._original_response and self._original_response.isclosed():
+                self.release_conn()
+
+    def read(self, amt=None, decode_content=None, cache_content=False):
+        """
+        Similar to :meth:`httplib.HTTPResponse.read`, but with two additional
+        parameters: ``decode_content`` and ``cache_content``.
+
+        :param amt:
+            How much of the content to read. If specified, caching is skipped
+            because it doesn't make sense to cache partial content as the full
+            response.
+
+        :param decode_content:
+            If True, will attempt to decode the body based on the
+            'content-encoding' header.
+
+        :param cache_content:
+            If True, will save the returned data such that the same result is
+            returned despite of the state of the underlying file object. This
+            is useful if you want the ``.data`` property to continue working
+            after having ``.read()`` the file object. (Overridden if ``amt`` is
+            set.)
+        """
+        self._init_decoder()
+        if decode_content is None:
+            decode_content = self.decode_content
+
+        if self._fp is None:
+            return
+
+        flush_decoder = False
+        fp_closed = getattr(self._fp, "closed", False)
+
+        with self._error_catcher():
+            if amt is None:
+                # cStringIO doesn't like amt=None
+                data = self._fp.read() if not fp_closed else b""
+                flush_decoder = True
+            else:
+                cache_content = False
+                data = self._fp.read(amt) if not fp_closed else b""
+                if (
+                    amt != 0 and not data
+                ):  # Platform-specific: Buggy versions of Python.
+                    # Close the connection when no data is returned
+                    #
+                    # This is redundant to what httplib/http.client _should_
+                    # already do.  However, versions of python released before
+                    # December 15, 2012 (http://bugs.python.org/issue16298) do
+                    # not properly close the connection in all cases. There is
+                    # no harm in redundantly calling close.
+                    self._fp.close()
+                    flush_decoder = True
+                    if self.enforce_content_length and self.length_remaining not in (
+                        0,
+                        None,
+                    ):
+                        # This is an edge case that httplib failed to cover due
+                        # to concerns of backward compatibility. We're
+                        # addressing it here to make sure IncompleteRead is
+                        # raised during streaming, so all calls with incorrect
+                        # Content-Length are caught.
+                        raise IncompleteRead(self._fp_bytes_read, self.length_remaining)
+
+        if data:
+            self._fp_bytes_read += len(data)
+            if self.length_remaining is not None:
+                self.length_remaining -= len(data)
+
+            data = self._decode(data, decode_content, flush_decoder)
+
+            if cache_content:
+                self._body = data
+
+        return data
+
+    def stream(self, amt=2 ** 16, decode_content=None):
+        """
+        A generator wrapper for the read() method. A call will block until
+        ``amt`` bytes have been read from the connection or until the
+        connection is closed.
+
+        :param amt:
+            How much of the content to read. The generator will return up to
+            much data per iteration, but may return less. This is particularly
+            likely when using compressed data. However, the empty string will
+            never be returned.
+
+        :param decode_content:
+            If True, will attempt to decode the body based on the
+            'content-encoding' header.
+        """
+        if self.chunked and self.supports_chunked_reads():
+            for line in self.read_chunked(amt, decode_content=decode_content):
+                yield line
+        else:
+            while not is_fp_closed(self._fp):
+                data = self.read(amt=amt, decode_content=decode_content)
+
+                if data:
+                    yield data
+
+    @classmethod
+    def from_httplib(ResponseCls, r, **response_kw):
+        """
+        Given an :class:`httplib.HTTPResponse` instance ``r``, return a
+        corresponding :class:`urllib3.response.HTTPResponse` object.
+
+        Remaining parameters are passed to the HTTPResponse constructor, along
+        with ``original_response=r``.
+        """
+        headers = r.msg
+
+        if not isinstance(headers, HTTPHeaderDict):
+            if PY3:
+                headers = HTTPHeaderDict(headers.items())
+            else:
+                # Python 2.7
+                headers = HTTPHeaderDict.from_httplib(headers)
+
+        # HTTPResponse objects in Python 3 don't have a .strict attribute
+        strict = getattr(r, "strict", 0)
+        resp = ResponseCls(
+            body=r,
+            headers=headers,
+            status=r.status,
+            version=r.version,
+            reason=r.reason,
+            strict=strict,
+            original_response=r,
+            **response_kw
+        )
+        return resp
+
+    # Backwards-compatibility methods for httplib.HTTPResponse
+    def getheaders(self):
+        return self.headers
+
+    def getheader(self, name, default=None):
+        return self.headers.get(name, default)
+
+    # Backwards compatibility for http.cookiejar
+    def info(self):
+        return self.headers
+
+    # Overrides from io.IOBase
+    def close(self):
+        if not self.closed:
+            self._fp.close()
+
+        if self._connection:
+            self._connection.close()
+
+        if not self.auto_close:
+            io.IOBase.close(self)
+
+    @property
+    def closed(self):
+        if not self.auto_close:
+            return io.IOBase.closed.__get__(self)
+        elif self._fp is None:
+            return True
+        elif hasattr(self._fp, "isclosed"):
+            return self._fp.isclosed()
+        elif hasattr(self._fp, "closed"):
+            return self._fp.closed
+        else:
+            return True
+
+    def fileno(self):
+        if self._fp is None:
+            raise IOError("HTTPResponse has no file to get a fileno from")
+        elif hasattr(self._fp, "fileno"):
+            return self._fp.fileno()
+        else:
+            raise IOError(
+                "The file-like object this HTTPResponse is wrapped "
+                "around has no file descriptor"
+            )
+
+    def flush(self):
+        if (
+            self._fp is not None
+            and hasattr(self._fp, "flush")
+            and not getattr(self._fp, "closed", False)
+        ):
+            return self._fp.flush()
+
+    def readable(self):
+        # This method is required for `io` module compatibility.
+        return True
+
+    def readinto(self, b):
+        # This method is required for `io` module compatibility.
+        temp = self.read(len(b))
+        if len(temp) == 0:
+            return 0
+        else:
+            b[: len(temp)] = temp
+            return len(temp)
+
+    def supports_chunked_reads(self):
+        """
+        Checks if the underlying file-like object looks like a
+        httplib.HTTPResponse object. We do this by testing for the fp
+        attribute. If it is present we assume it returns raw chunks as
+        processed by read_chunked().
+        """
+        return hasattr(self._fp, "fp")
+
+    def _update_chunk_length(self):
+        # First, we'll figure out length of a chunk and then
+        # we'll try to read it from socket.
+        if self.chunk_left is not None:
+            return
+        line = self._fp.fp.readline()
+        line = line.split(b";", 1)[0]
+        try:
+            self.chunk_left = int(line, 16)
+        except ValueError:
+            # Invalid chunked protocol response, abort.
+            self.close()
+            raise httplib.IncompleteRead(line)
+
+    def _handle_chunk(self, amt):
+        returned_chunk = None
+        if amt is None:
+            chunk = self._fp._safe_read(self.chunk_left)
+            returned_chunk = chunk
+            self._fp._safe_read(2)  # Toss the CRLF at the end of the chunk.
+            self.chunk_left = None
+        elif amt < self.chunk_left:
+            value = self._fp._safe_read(amt)
+            self.chunk_left = self.chunk_left - amt
+            returned_chunk = value
+        elif amt == self.chunk_left:
+            value = self._fp._safe_read(amt)
+            self._fp._safe_read(2)  # Toss the CRLF at the end of the chunk.
+            self.chunk_left = None
+            returned_chunk = value
+        else:  # amt > self.chunk_left
+            returned_chunk = self._fp._safe_read(self.chunk_left)
+            self._fp._safe_read(2)  # Toss the CRLF at the end of the chunk.
+            self.chunk_left = None
+        return returned_chunk
+
+    def read_chunked(self, amt=None, decode_content=None):
+        """
+        Similar to :meth:`HTTPResponse.read`, but with an additional
+        parameter: ``decode_content``.
+
+        :param amt:
+            How much of the content to read. If specified, caching is skipped
+            because it doesn't make sense to cache partial content as the full
+            response.
+
+        :param decode_content:
+            If True, will attempt to decode the body based on the
+            'content-encoding' header.
+        """
+        self._init_decoder()
+        # FIXME: Rewrite this method and make it a class with a better structured logic.
+        if not self.chunked:
+            raise ResponseNotChunked(
+                "Response is not chunked. "
+                "Header 'transfer-encoding: chunked' is missing."
+            )
+        if not self.supports_chunked_reads():
+            raise BodyNotHttplibCompatible(
+                "Body should be httplib.HTTPResponse like. "
+                "It should have have an fp attribute which returns raw chunks."
+            )
+
+        with self._error_catcher():
+            # Don't bother reading the body of a HEAD request.
+            if self._original_response and is_response_to_head(self._original_response):
+                self._original_response.close()
+                return
+
+            # If a response is already read and closed
+            # then return immediately.
+            if self._fp.fp is None:
+                return
+
+            while True:
+                self._update_chunk_length()
+                if self.chunk_left == 0:
+                    break
+                chunk = self._handle_chunk(amt)
+                decoded = self._decode(
+                    chunk, decode_content=decode_content, flush_decoder=False
+                )
+                if decoded:
+                    yield decoded
+
+            if decode_content:
+                # On CPython and PyPy, we should never need to flush the
+                # decoder. However, on Jython we *might* need to, so
+                # lets defensively do it anyway.
+                decoded = self._flush_decoder()
+                if decoded:  # Platform-specific: Jython.
+                    yield decoded
+
+            # Chunk content ends with \r\n: discard it.
+            while True:
+                line = self._fp.fp.readline()
+                if not line:
+                    # Some sites may not end with '\r\n'.
+                    break
+                if line == b"\r\n":
+                    break
+
+            # We read everything; close the "file".
+            if self._original_response:
+                self._original_response.close()
+
+    def geturl(self):
+        """
+        Returns the URL that was the source of this response.
+        If the request that generated this response redirected, this method
+        will return the final redirect location.
+        """
+        if self.retries is not None and len(self.retries.history):
+            return self.retries.history[-1].redirect_location
+        else:
+            return self._request_url
+
+    def __iter__(self):
+        buffer = []
+        for chunk in self.stream(decode_content=True):
+            if b"\n" in chunk:
+                chunk = chunk.split(b"\n")
+                yield b"".join(buffer) + chunk[0] + b"\n"
+                for x in chunk[1:-1]:
+                    yield x + b"\n"
+                if chunk[-1]:
+                    buffer = [chunk[-1]]
+                else:
+                    buffer = []
+            else:
+                buffer.append(chunk)
+        if buffer:
+            yield b"".join(buffer)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__init__.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__init__.py
new file mode 100644
index 000000000..a96c73a9d
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__init__.py
@@ -0,0 +1,46 @@
+from __future__ import absolute_import
+
+# For backwards compatibility, provide imports that used to be here.
+from .connection import is_connection_dropped
+from .request import make_headers
+from .response import is_fp_closed
+from .ssl_ import (
+    SSLContext,
+    HAS_SNI,
+    IS_PYOPENSSL,
+    IS_SECURETRANSPORT,
+    assert_fingerprint,
+    resolve_cert_reqs,
+    resolve_ssl_version,
+    ssl_wrap_socket,
+    PROTOCOL_TLS,
+)
+from .timeout import current_time, Timeout
+
+from .retry import Retry
+from .url import get_host, parse_url, split_first, Url
+from .wait import wait_for_read, wait_for_write
+
+__all__ = (
+    "HAS_SNI",
+    "IS_PYOPENSSL",
+    "IS_SECURETRANSPORT",
+    "SSLContext",
+    "PROTOCOL_TLS",
+    "Retry",
+    "Timeout",
+    "Url",
+    "assert_fingerprint",
+    "current_time",
+    "is_connection_dropped",
+    "is_fp_closed",
+    "get_host",
+    "parse_url",
+    "make_headers",
+    "resolve_cert_reqs",
+    "resolve_ssl_version",
+    "split_first",
+    "ssl_wrap_socket",
+    "wait_for_read",
+    "wait_for_write",
+)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..51416b9da
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc
new file mode 100644
index 000000000..2edd5c634
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/connection.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/queue.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/queue.cpython-36.pyc
new file mode 100644
index 000000000..b6b2bd3b9
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/queue.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc
new file mode 100644
index 000000000..4dbdec018
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/request.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc
new file mode 100644
index 000000000..86b156dfd
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/response.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc
new file mode 100644
index 000000000..324f2555d
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/retry.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc
new file mode 100644
index 000000000..e50a4b521
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/ssl_.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc
new file mode 100644
index 000000000..8ef89521c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/timeout.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc
new file mode 100644
index 000000000..695b4ca1c
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/url.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc
new file mode 100644
index 000000000..61a086a09
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/urllib3/util/__pycache__/wait.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/connection.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/connection.py
new file mode 100644
index 000000000..86f0a3b00
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/connection.py
@@ -0,0 +1,138 @@
+from __future__ import absolute_import
+import socket
+from .wait import NoWayToWaitForSocketError, wait_for_read
+from ..contrib import _appengine_environ
+
+
+def is_connection_dropped(conn):  # Platform-specific
+    """
+    Returns True if the connection is dropped and should be closed.
+
+    :param conn:
+        :class:`httplib.HTTPConnection` object.
+
+    Note: For platforms like AppEngine, this will always return ``False`` to
+    let the platform handle connection recycling transparently for us.
+    """
+    sock = getattr(conn, "sock", False)
+    if sock is False:  # Platform-specific: AppEngine
+        return False
+    if sock is None:  # Connection already closed (such as by httplib).
+        return True
+    try:
+        # Returns True if readable, which here means it's been dropped
+        return wait_for_read(sock, timeout=0.0)
+    except NoWayToWaitForSocketError:  # Platform-specific: AppEngine
+        return False
+
+
+# This function is copied from socket.py in the Python 2.7 standard
+# library test suite. Added to its signature is only `socket_options`.
+# One additional modification is that we avoid binding to IPv6 servers
+# discovered in DNS if the system doesn't have IPv6 functionality.
+def create_connection(
+    address,
+    timeout=socket._GLOBAL_DEFAULT_TIMEOUT,
+    source_address=None,
+    socket_options=None,
+):
+    """Connect to *address* and return the socket object.
+
+    Convenience function.  Connect to *address* (a 2-tuple ``(host,
+    port)``) and return the socket object.  Passing the optional
+    *timeout* parameter will set the timeout on the socket instance
+    before attempting to connect.  If no *timeout* is supplied, the
+    global default timeout setting returned by :func:`getdefaulttimeout`
+    is used.  If *source_address* is set it must be a tuple of (host, port)
+    for the socket to bind as a source address before making the connection.
+    An host of '' or port 0 tells the OS to use the default.
+    """
+
+    host, port = address
+    if host.startswith("["):
+        host = host.strip("[]")
+    err = None
+
+    # Using the value from allowed_gai_family() in the context of getaddrinfo lets
+    # us select whether to work with IPv4 DNS records, IPv6 records, or both.
+    # The original create_connection function always returns all records.
+    family = allowed_gai_family()
+
+    for res in socket.getaddrinfo(host, port, family, socket.SOCK_STREAM):
+        af, socktype, proto, canonname, sa = res
+        sock = None
+        try:
+            sock = socket.socket(af, socktype, proto)
+
+            # If provided, set socket level options before connecting.
+            _set_socket_options(sock, socket_options)
+
+            if timeout is not socket._GLOBAL_DEFAULT_TIMEOUT:
+                sock.settimeout(timeout)
+            if source_address:
+                sock.bind(source_address)
+            sock.connect(sa)
+            return sock
+
+        except socket.error as e:
+            err = e
+            if sock is not None:
+                sock.close()
+                sock = None
+
+    if err is not None:
+        raise err
+
+    raise socket.error("getaddrinfo returns an empty list")
+
+
+def _set_socket_options(sock, options):
+    if options is None:
+        return
+
+    for opt in options:
+        sock.setsockopt(*opt)
+
+
+def allowed_gai_family():
+    """This function is designed to work in the context of
+    getaddrinfo, where family=socket.AF_UNSPEC is the default and
+    will perform a DNS search for both IPv6 and IPv4 records."""
+
+    family = socket.AF_INET
+    if HAS_IPV6:
+        family = socket.AF_UNSPEC
+    return family
+
+
+def _has_ipv6(host):
+    """ Returns True if the system can bind an IPv6 address. """
+    sock = None
+    has_ipv6 = False
+
+    # App Engine doesn't support IPV6 sockets and actually has a quota on the
+    # number of sockets that can be used, so just early out here instead of
+    # creating a socket needlessly.
+    # See https://github.com/urllib3/urllib3/issues/1446
+    if _appengine_environ.is_appengine_sandbox():
+        return False
+
+    if socket.has_ipv6:
+        # has_ipv6 returns true if cPython was compiled with IPv6 support.
+        # It does not tell us if the system has IPv6 support enabled. To
+        # determine that we must bind to an IPv6 address.
+        # https://github.com/urllib3/urllib3/pull/611
+        # https://bugs.python.org/issue658327
+        try:
+            sock = socket.socket(socket.AF_INET6)
+            sock.bind((host, 0))
+            has_ipv6 = True
+        except Exception:
+            pass
+
+    if sock:
+        sock.close()
+    return has_ipv6
+
+
+HAS_IPV6 = _has_ipv6("::1")
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/queue.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/queue.py
new file mode 100644
index 000000000..d3d379a19
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/queue.py
@@ -0,0 +1,21 @@
+import collections
+from ..packages import six
+from ..packages.six.moves import queue
+
+if six.PY2:
+    # Queue is imported for side effects on MS Windows. See issue #229.
+    import Queue as _unused_module_Queue  # noqa: F401
+
+
+class LifoQueue(queue.Queue):
+    def _init(self, _):
+        self.queue = collections.deque()
+
+    def _qsize(self, len=len):
+        return len(self.queue)
+
+    def _put(self, item):
+        self.queue.append(item)
+
+    def _get(self):
+        return self.queue.pop()
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/request.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/request.py
new file mode 100644
index 000000000..3b7bb54da
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/request.py
@@ -0,0 +1,135 @@
+from __future__ import absolute_import
+from base64 import b64encode
+
+from ..packages.six import b, integer_types
+from ..exceptions import UnrewindableBodyError
+
+ACCEPT_ENCODING = "gzip,deflate"
+try:
+    import brotli as _unused_module_brotli  # noqa: F401
+except ImportError:
+    pass
+else:
+    ACCEPT_ENCODING += ",br"
+
+_FAILEDTELL = object()
+
+
+def make_headers(
+    keep_alive=None,
+    accept_encoding=None,
+    user_agent=None,
+    basic_auth=None,
+    proxy_basic_auth=None,
+    disable_cache=None,
+):
+    """
+    Shortcuts for generating request headers.
+
+    :param keep_alive:
+        If ``True``, adds 'connection: keep-alive' header.
+
+    :param accept_encoding:
+        Can be a boolean, list, or string.
+        ``True`` translates to 'gzip,deflate'.
+        List will get joined by comma.
+        String will be used as provided.
+
+    :param user_agent:
+        String representing the user-agent you want, such as
+        "python-urllib3/0.6"
+
+    :param basic_auth:
+        Colon-separated username:password string for 'authorization: basic ...'
+        auth header.
+
+    :param proxy_basic_auth:
+        Colon-separated username:password string for 'proxy-authorization: basic ...'
+        auth header.
+
+    :param disable_cache:
+        If ``True``, adds 'cache-control: no-cache' header.
+
+    Example::
+
+        >>> make_headers(keep_alive=True, user_agent="Batman/1.0")
+        {'connection': 'keep-alive', 'user-agent': 'Batman/1.0'}
+        >>> make_headers(accept_encoding=True)
+        {'accept-encoding': 'gzip,deflate'}
+    """
+    headers = {}
+    if accept_encoding:
+        if isinstance(accept_encoding, str):
+            pass
+        elif isinstance(accept_encoding, list):
+            accept_encoding = ",".join(accept_encoding)
+        else:
+            accept_encoding = ACCEPT_ENCODING
+        headers["accept-encoding"] = accept_encoding
+
+    if user_agent:
+        headers["user-agent"] = user_agent
+
+    if keep_alive:
+        headers["connection"] = "keep-alive"
+
+    if basic_auth:
+        headers["authorization"] = "Basic " + b64encode(b(basic_auth)).decode("utf-8")
+
+    if proxy_basic_auth:
+        headers["proxy-authorization"] = "Basic " + b64encode(
+            b(proxy_basic_auth)
+        ).decode("utf-8")
+
+    if disable_cache:
+        headers["cache-control"] = "no-cache"
+
+    return headers
+
+
+def set_file_position(body, pos):
+    """
+    If a position is provided, move file to that point.
+    Otherwise, we'll attempt to record a position for future use.
+    """
+    if pos is not None:
+        rewind_body(body, pos)
+    elif getattr(body, "tell", None) is not None:
+        try:
+            pos = body.tell()
+        except (IOError, OSError):
+            # This differentiates from None, allowing us to catch
+            # a failed `tell()` later when trying to rewind the body.
+            pos = _FAILEDTELL
+
+    return pos
+
+
+def rewind_body(body, body_pos):
+    """
+    Attempt to rewind body to a certain position.
+    Primarily used for request redirects and retries.
+
+    :param body:
+        File-like object that supports seek.
+
+    :param int pos:
+        Position to seek to in file.
+    """
+    body_seek = getattr(body, "seek", None)
+    if body_seek is not None and isinstance(body_pos, integer_types):
+        try:
+            body_seek(body_pos)
+        except (IOError, OSError):
+            raise UnrewindableBodyError(
+                "An error occurred when rewinding request body for redirect/retry."
+            )
+    elif body_pos is _FAILEDTELL:
+        raise UnrewindableBodyError(
+            "Unable to record file position for rewinding "
+            "request body during a redirect/retry."
+        )
+    else:
+        raise ValueError(
+            "body_pos must be of type integer, instead it was %s." % type(body_pos)
+        )
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/response.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/response.py
new file mode 100644
index 000000000..715868dd1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/response.py
@@ -0,0 +1,86 @@
+from __future__ import absolute_import
+from ..packages.six.moves import http_client as httplib
+
+from ..exceptions import HeaderParsingError
+
+
+def is_fp_closed(obj):
+    """
+    Checks whether a given file-like object is closed.
+
+    :param obj:
+        The file-like object to check.
+    """
+
+    try:
+        # Check `isclosed()` first, in case Python3 doesn't set `closed`.
+        # GH Issue #928
+        return obj.isclosed()
+    except AttributeError:
+        pass
+
+    try:
+        # Check via the official file-like-object way.
+        return obj.closed
+    except AttributeError:
+        pass
+
+    try:
+        # Check if the object is a container for another file-like object that
+        # gets released on exhaustion (e.g. HTTPResponse).
+        return obj.fp is None
+    except AttributeError:
+        pass
+
+    raise ValueError("Unable to determine whether fp is closed.")
+
+
+def assert_header_parsing(headers):
+    """
+    Asserts whether all headers have been successfully parsed.
+    Extracts encountered errors from the result of parsing headers.
+
+    Only works on Python 3.
+
+    :param headers: Headers to verify.
+    :type headers: `httplib.HTTPMessage`.
+
+    :raises urllib3.exceptions.HeaderParsingError:
+        If parsing errors are found.
+    """
+
+    # This will fail silently if we pass in the wrong kind of parameter.
+    # To make debugging easier add an explicit check.
+    if not isinstance(headers, httplib.HTTPMessage):
+        raise TypeError("expected httplib.Message, got {0}.".format(type(headers)))
+
+    defects = getattr(headers, "defects", None)
+    get_payload = getattr(headers, "get_payload", None)
+
+    unparsed_data = None
+    if get_payload:
+        # get_payload is actually email.message.Message.get_payload;
+        # we're only interested in the result if it's not a multipart message
+        if not headers.is_multipart():
+            payload = get_payload()
+
+            if isinstance(payload, (bytes, str)):
+                unparsed_data = payload
+
+    if defects or unparsed_data:
+        raise HeaderParsingError(defects=defects, unparsed_data=unparsed_data)
+
+
+def is_response_to_head(response):
+    """
+    Checks whether the request of a response has been a HEAD-request.
+    Handles the quirks of AppEngine.
+
+    :param conn:
+    :type conn: :class:`httplib.HTTPResponse`
+    """
+    # FIXME: Can we do this somehow without accessing private httplib _method?
+    method = response._method
+    if isinstance(method, int):  # Platform-specific: Appengine
+        return method == 3
+    return method.upper() == "HEAD"
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/retry.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/retry.py
new file mode 100644
index 000000000..ee30c91b1
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/retry.py
@@ -0,0 +1,453 @@
+from __future__ import absolute_import
+import time
+import logging
+from collections import namedtuple
+from itertools import takewhile
+import email
+import re
+
+from ..exceptions import (
+    ConnectTimeoutError,
+    MaxRetryError,
+    ProtocolError,
+    ReadTimeoutError,
+    ResponseError,
+    InvalidHeader,
+    ProxyError,
+)
+from ..packages import six
+
+
+log = logging.getLogger(__name__)
+
+
+# Data structure for representing the metadata of requests that result in a retry.
+RequestHistory = namedtuple(
+    "RequestHistory", ["method", "url", "error", "status", "redirect_location"]
+)
+
+
+class Retry(object):
+    """ Retry configuration.
+
+    Each retry attempt will create a new Retry object with updated values, so
+    they can be safely reused.
+
+    Retries can be defined as a default for a pool::
+
+        retries = Retry(connect=5, read=2, redirect=5)
+        http = PoolManager(retries=retries)
+        response = http.request('GET', 'http://example.com/')
+
+    Or per-request (which overrides the default for the pool)::
+
+        response = http.request('GET', 'http://example.com/', retries=Retry(10))
+
+    Retries can be disabled by passing ``False``::
+
+        response = http.request('GET', 'http://example.com/', retries=False)
+
+    Errors will be wrapped in :class:`~urllib3.exceptions.MaxRetryError` unless
+    retries are disabled, in which case the causing exception will be raised.
+
+    :param int total:
+        Total number of retries to allow. Takes precedence over other counts.
+
+        Set to ``None`` to remove this constraint and fall back on other
+        counts. It's a good idea to set this to some sensibly-high value to
+        account for unexpected edge cases and avoid infinite retry loops.
+
+        Set to ``0`` to fail on the first retry.
+
+        Set to ``False`` to disable and imply ``raise_on_redirect=False``.
+
+    :param int connect:
+        How many connection-related errors to retry on.
+
+        These are errors raised before the request is sent to the remote server,
+        which we assume has not triggered the server to process the request.
+
+        Set to ``0`` to fail on the first retry of this type.
+
+    :param int read:
+        How many times to retry on read errors.
+
+        These errors are raised after the request was sent to the server, so the
+        request may have side-effects.
+
+        Set to ``0`` to fail on the first retry of this type.
+
+    :param int redirect:
+        How many redirects to perform. Limit this to avoid infinite redirect
+        loops.
+
+        A redirect is a HTTP response with a status code 301, 302, 303, 307 or
+        308.
+
+        Set to ``0`` to fail on the first retry of this type.
+
+        Set to ``False`` to disable and imply ``raise_on_redirect=False``.
+
+    :param int status:
+        How many times to retry on bad status codes.
+
+        These are retries made on responses, where status code matches
+        ``status_forcelist``.
+
+        Set to ``0`` to fail on the first retry of this type.
+
+    :param iterable method_whitelist:
+        Set of uppercased HTTP method verbs that we should retry on.
+
+        By default, we only retry on methods which are considered to be
+        idempotent (multiple requests with the same parameters end with the
+        same state). See :attr:`Retry.DEFAULT_METHOD_WHITELIST`.
+
+        Set to a ``False`` value to retry on any verb.
+
+    :param iterable status_forcelist:
+        A set of integer HTTP status codes that we should force a retry on.
+        A retry is initiated if the request method is in ``method_whitelist``
+        and the response status code is in ``status_forcelist``.
+
+        By default, this is disabled with ``None``.
+
+    :param float backoff_factor:
+        A backoff factor to apply between attempts after the second try
+        (most errors are resolved immediately by a second try without a
+        delay). urllib3 will sleep for::
+
+            {backoff factor} * (2 ** ({number of total retries} - 1))
+
+        seconds. If the backoff_factor is 0.1, then :func:`.sleep` will sleep
+        for [0.0s, 0.2s, 0.4s, ...] between retries. It will never be longer
+        than :attr:`Retry.BACKOFF_MAX`.
+
+        By default, backoff is disabled (set to 0).
+
+    :param bool raise_on_redirect: Whether, if the number of redirects is
+        exhausted, to raise a MaxRetryError, or to return a response with a
+        response code in the 3xx range.
+
+    :param bool raise_on_status: Similar meaning to ``raise_on_redirect``:
+        whether we should raise an exception, or return a response,
+        if status falls in ``status_forcelist`` range and retries have
+        been exhausted.
+
+    :param tuple history: The history of the request encountered during
+        each call to :meth:`~Retry.increment`. The list is in the order
+        the requests occurred. Each list item is of class :class:`RequestHistory`.
+
+    :param bool respect_retry_after_header:
+        Whether to respect Retry-After header on status codes defined as
+        :attr:`Retry.RETRY_AFTER_STATUS_CODES` or not.
+
+    :param iterable remove_headers_on_redirect:
+        Sequence of headers to remove from the request when a response
+        indicating a redirect is returned before firing off the redirected
+        request.
+    """
+
+    DEFAULT_METHOD_WHITELIST = frozenset(
+        ["HEAD", "GET", "PUT", "DELETE", "OPTIONS", "TRACE"]
+    )
+
+    RETRY_AFTER_STATUS_CODES = frozenset([413, 429, 503])
+
+    DEFAULT_REDIRECT_HEADERS_BLACKLIST = frozenset(["Authorization"])
+
+    #: Maximum backoff time.
+    BACKOFF_MAX = 120
+
+    def __init__(
+        self,
+        total=10,
+        connect=None,
+        read=None,
+        redirect=None,
+        status=None,
+        method_whitelist=DEFAULT_METHOD_WHITELIST,
+        status_forcelist=None,
+        backoff_factor=0,
+        raise_on_redirect=True,
+        raise_on_status=True,
+        history=None,
+        respect_retry_after_header=True,
+        remove_headers_on_redirect=DEFAULT_REDIRECT_HEADERS_BLACKLIST,
+    ):
+
+        self.total = total
+        self.connect = connect
+        self.read = read
+        self.status = status
+
+        if redirect is False or total is False:
+            redirect = 0
+            raise_on_redirect = False
+
+        self.redirect = redirect
+        self.status_forcelist = status_forcelist or set()
+        self.method_whitelist = method_whitelist
+        self.backoff_factor = backoff_factor
+        self.raise_on_redirect = raise_on_redirect
+        self.raise_on_status = raise_on_status
+        self.history = history or tuple()
+        self.respect_retry_after_header = respect_retry_after_header
+        self.remove_headers_on_redirect = frozenset(
+            [h.lower() for h in remove_headers_on_redirect]
+        )
+
+    def new(self, **kw):
+        params = dict(
+            total=self.total,
+            connect=self.connect,
+            read=self.read,
+            redirect=self.redirect,
+            status=self.status,
+            method_whitelist=self.method_whitelist,
+            status_forcelist=self.status_forcelist,
+            backoff_factor=self.backoff_factor,
+            raise_on_redirect=self.raise_on_redirect,
+            raise_on_status=self.raise_on_status,
+            history=self.history,
+            remove_headers_on_redirect=self.remove_headers_on_redirect,
+            respect_retry_after_header=self.respect_retry_after_header,
+        )
+        params.update(kw)
+        return type(self)(**params)
+
+    @classmethod
+    def from_int(cls, retries, redirect=True, default=None):
+        """ Backwards-compatibility for the old retries format."""
+        if retries is None:
+            retries = default if default is not None else cls.DEFAULT
+
+        if isinstance(retries, Retry):
+            return retries
+
+        redirect = bool(redirect) and None
+        new_retries = cls(retries, redirect=redirect)
+        log.debug("Converted retries value: %r -> %r", retries, new_retries)
+        return new_retries
+
+    def get_backoff_time(self):
+        """ Formula for computing the current backoff
+
+        :rtype: float
+        """
+        # We want to consider only the last consecutive errors sequence (Ignore redirects).
+        consecutive_errors_len = len(
+            list(
+                takewhile(lambda x: x.redirect_location is None, reversed(self.history))
+            )
+        )
+        if consecutive_errors_len <= 1:
+            return 0
+
+        backoff_value = self.backoff_factor * (2 ** (consecutive_errors_len - 1))
+        return min(self.BACKOFF_MAX, backoff_value)
+
+    def parse_retry_after(self, retry_after):
+        # Whitespace: https://tools.ietf.org/html/rfc7230#section-3.2.4
+        if re.match(r"^\s*[0-9]+\s*$", retry_after):
+            seconds = int(retry_after)
+        else:
+            retry_date_tuple = email.utils.parsedate(retry_after)
+            if retry_date_tuple is None:
+                raise InvalidHeader("Invalid Retry-After header: %s" % retry_after)
+            retry_date = time.mktime(retry_date_tuple)
+            seconds = retry_date - time.time()
+
+        if seconds < 0:
+            seconds = 0
+
+        return seconds
+
+    def get_retry_after(self, response):
+        """ Get the value of Retry-After in seconds. """
+
+        retry_after = response.getheader("Retry-After")
+
+        if retry_after is None:
+            return None
+
+        return self.parse_retry_after(retry_after)
+
+    def sleep_for_retry(self, response=None):
+        retry_after = self.get_retry_after(response)
+        if retry_after:
+            time.sleep(retry_after)
+            return True
+
+        return False
+
+    def _sleep_backoff(self):
+        backoff = self.get_backoff_time()
+        if backoff <= 0:
+            return
+        time.sleep(backoff)
+
+    def sleep(self, response=None):
+        """ Sleep between retry attempts.
+
+        This method will respect a server's ``Retry-After`` response header
+        and sleep the duration of the time requested. If that is not present, it
+        will use an exponential backoff. By default, the backoff factor is 0 and
+        this method will return immediately.
+        """
+
+        if self.respect_retry_after_header and response:
+            slept = self.sleep_for_retry(response)
+            if slept:
+                return
+
+        self._sleep_backoff()
+
+    def _is_connection_error(self, err):
+        """ Errors when we're fairly sure that the server did not receive the
+        request, so it should be safe to retry.
+        """
+        if isinstance(err, ProxyError):
+            err = err.original_error
+        return isinstance(err, ConnectTimeoutError)
+
+    def _is_read_error(self, err):
+        """ Errors that occur after the request has been started, so we should
+        assume that the server began processing it.
+        """
+        return isinstance(err, (ReadTimeoutError, ProtocolError))
+
+    def _is_method_retryable(self, method):
+        """ Checks if a given HTTP method should be retried upon, depending if
+        it is included on the method whitelist.
+        """
+        if self.method_whitelist and method.upper() not in self.method_whitelist:
+            return False
+
+        return True
+
+    def is_retry(self, method, status_code, has_retry_after=False):
+        """ Is this method/status code retryable? (Based on whitelists and control
+        variables such as the number of total retries to allow, whether to
+        respect the Retry-After header, whether this header is present, and
+        whether the returned status code is on the list of status codes to
+        be retried upon on the presence of the aforementioned header)
+        """
+        if not self._is_method_retryable(method):
+            return False
+
+        if self.status_forcelist and status_code in self.status_forcelist:
+            return True
+
+        return (
+            self.total
+            and self.respect_retry_after_header
+            and has_retry_after
+            and (status_code in self.RETRY_AFTER_STATUS_CODES)
+        )
+
+    def is_exhausted(self):
+        """ Are we out of retries? """
+        retry_counts = (self.total, self.connect, self.read, self.redirect, self.status)
+        retry_counts = list(filter(None, retry_counts))
+        if not retry_counts:
+            return False
+
+        return min(retry_counts) < 0
+
+    def increment(
+        self,
+        method=None,
+        url=None,
+        response=None,
+        error=None,
+        _pool=None,
+        _stacktrace=None,
+    ):
+        """ Return a new Retry object with incremented retry counters.
+
+        :param response: A response object, or None, if the server did not
+            return a response.
+        :type response: :class:`~urllib3.response.HTTPResponse`
+        :param Exception error: An error encountered during the request, or
+            None if the response was received successfully.
+
+        :return: A new ``Retry`` object.
+        """
+        if self.total is False and error:
+            # Disabled, indicate to re-raise the error.
+            raise six.reraise(type(error), error, _stacktrace)
+
+        total = self.total
+        if total is not None:
+            total -= 1
+
+        connect = self.connect
+        read = self.read
+        redirect = self.redirect
+        status_count = self.status
+        cause = "unknown"
+        status = None
+        redirect_location = None
+
+        if error and self._is_connection_error(error):
+            # Connect retry?
+            if connect is False:
+                raise six.reraise(type(error), error, _stacktrace)
+            elif connect is not None:
+                connect -= 1
+
+        elif error and self._is_read_error(error):
+            # Read retry?
+            if read is False or not self._is_method_retryable(method):
+                raise six.reraise(type(error), error, _stacktrace)
+            elif read is not None:
+                read -= 1
+
+        elif response and response.get_redirect_location():
+            # Redirect retry?
+            if redirect is not None:
+                redirect -= 1
+            cause = "too many redirects"
+            redirect_location = response.get_redirect_location()
+            status = response.status
+
+        else:
+            # Incrementing because of a server error like a 500 in
+            # status_forcelist and a the given method is in the whitelist
+            cause = ResponseError.GENERIC_ERROR
+            if response and response.status:
+                if status_count is not None:
+                    status_count -= 1
+                cause = ResponseError.SPECIFIC_ERROR.format(status_code=response.status)
+                status = response.status
+
+        history = self.history + (
+            RequestHistory(method, url, error, status, redirect_location),
+        )
+
+        new_retry = self.new(
+            total=total,
+            connect=connect,
+            read=read,
+            redirect=redirect,
+            status=status_count,
+            history=history,
+        )
+
+        if new_retry.is_exhausted():
+            raise MaxRetryError(_pool, url, error or ResponseError(cause))
+
+        log.debug("Incremented Retry for (url='%s'): %r", url, new_retry)
+
+        return new_retry
+
+    def __repr__(self):
+        return (
+            "{cls.__name__}(total={self.total}, connect={self.connect}, "
+            "read={self.read}, redirect={self.redirect}, status={self.status})"
+        ).format(cls=type(self), self=self)
+
+
+# For backwards compatibility (equivalent to pre-v1.9):
+Retry.DEFAULT = Retry(3)
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/ssl_.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/ssl_.py
new file mode 100644
index 000000000..d3b463d49
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/ssl_.py
@@ -0,0 +1,414 @@
+from __future__ import absolute_import
+import errno
+import warnings
+import hmac
+import sys
+
+from binascii import hexlify, unhexlify
+from hashlib import md5, sha1, sha256
+
+from .url import IPV4_RE, BRACELESS_IPV6_ADDRZ_RE
+from ..exceptions import SSLError, InsecurePlatformWarning, SNIMissingWarning
+from ..packages import six
+
+
+SSLContext = None
+HAS_SNI = False
+IS_PYOPENSSL = False
+IS_SECURETRANSPORT = False
+
+# Maps the length of a digest to a possible hash function producing this digest
+HASHFUNC_MAP = {32: md5, 40: sha1, 64: sha256}
+
+
+def _const_compare_digest_backport(a, b):
+    """
+    Compare two digests of equal length in constant time.
+
+    The digests must be of type str/bytes.
+    Returns True if the digests match, and False otherwise.
+    """
+    result = abs(len(a) - len(b))
+    for l, r in zip(bytearray(a), bytearray(b)):
+        result |= l ^ r
+    return result == 0
+
+
+_const_compare_digest = getattr(hmac, "compare_digest", _const_compare_digest_backport)
+
+try:  # Test for SSL features
+    import ssl
+    from ssl import wrap_socket, CERT_REQUIRED
+    from ssl import HAS_SNI  # Has SNI?
+except ImportError:
+    pass
+
+try:  # Platform-specific: Python 3.6
+    from ssl import PROTOCOL_TLS
+
+    PROTOCOL_SSLv23 = PROTOCOL_TLS
+except ImportError:
+    try:
+        from ssl import PROTOCOL_SSLv23 as PROTOCOL_TLS
+
+        PROTOCOL_SSLv23 = PROTOCOL_TLS
+    except ImportError:
+        PROTOCOL_SSLv23 = PROTOCOL_TLS = 2
+
+
+try:
+    from ssl import OP_NO_SSLv2, OP_NO_SSLv3, OP_NO_COMPRESSION
+except ImportError:
+    OP_NO_SSLv2, OP_NO_SSLv3 = 0x1000000, 0x2000000
+    OP_NO_COMPRESSION = 0x20000
+
+
+# A secure default.
+# Sources for more information on TLS ciphers:
+#
+# - https://wiki.mozilla.org/Security/Server_Side_TLS
+# - https://www.ssllabs.com/projects/best-practices/index.html
+# - https://hynek.me/articles/hardening-your-web-servers-ssl-ciphers/
+#
+# The general intent is:
+# - prefer cipher suites that offer perfect forward secrecy (DHE/ECDHE),
+# - prefer ECDHE over DHE for better performance,
+# - prefer any AES-GCM and ChaCha20 over any AES-CBC for better performance and
+#   security,
+# - prefer AES-GCM over ChaCha20 because hardware-accelerated AES is common,
+# - disable NULL authentication, MD5 MACs, DSS, and other
+#   insecure ciphers for security reasons.
+# - NOTE: TLS 1.3 cipher suites are managed through a different interface
+#   not exposed by CPython (yet!) and are enabled by default if they're available.
+DEFAULT_CIPHERS = ":".join(
+    [
+        "ECDHE+AESGCM",
+        "ECDHE+CHACHA20",
+        "DHE+AESGCM",
+        "DHE+CHACHA20",
+        "ECDH+AESGCM",
+        "DH+AESGCM",
+        "ECDH+AES",
+        "DH+AES",
+        "RSA+AESGCM",
+        "RSA+AES",
+        "!aNULL",
+        "!eNULL",
+        "!MD5",
+        "!DSS",
+    ]
+)
+
+try:
+    from ssl import SSLContext  # Modern SSL?
+except ImportError:
+
+    class SSLContext(object):  # Platform-specific: Python 2
+        def __init__(self, protocol_version):
+            self.protocol = protocol_version
+            # Use default values from a real SSLContext
+            self.check_hostname = False
+            self.verify_mode = ssl.CERT_NONE
+            self.ca_certs = None
+            self.options = 0
+            self.certfile = None
+            self.keyfile = None
+            self.ciphers = None
+
+        def load_cert_chain(self, certfile, keyfile):
+            self.certfile = certfile
+            self.keyfile = keyfile
+
+        def load_verify_locations(self, cafile=None, capath=None, cadata=None):
+            self.ca_certs = cafile
+
+            if capath is not None:
+                raise SSLError("CA directories not supported in older Pythons")
+
+            if cadata is not None:
+                raise SSLError("CA data not supported in older Pythons")
+
+        def set_ciphers(self, cipher_suite):
+            self.ciphers = cipher_suite
+
+        def wrap_socket(self, socket, server_hostname=None, server_side=False):
+            warnings.warn(
+                "A true SSLContext object is not available. This prevents "
+                "urllib3 from configuring SSL appropriately and may cause "
+                "certain SSL connections to fail. You can upgrade to a newer "
+                "version of Python to solve this. For more information, see "
+                "https://urllib3.readthedocs.io/en/latest/advanced-usage.html"
+                "#ssl-warnings",
+                InsecurePlatformWarning,
+            )
+            kwargs = {
+                "keyfile": self.keyfile,
+                "certfile": self.certfile,
+                "ca_certs": self.ca_certs,
+                "cert_reqs": self.verify_mode,
+                "ssl_version": self.protocol,
+                "server_side": server_side,
+            }
+            return wrap_socket(socket, ciphers=self.ciphers, **kwargs)
+
+
+def assert_fingerprint(cert, fingerprint):
+    """
+    Checks if given fingerprint matches the supplied certificate.
+
+    :param cert:
+        Certificate as bytes object.
+    :param fingerprint:
+        Fingerprint as string of hexdigits, can be interspersed by colons.
+    """
+
+    fingerprint = fingerprint.replace(":", "").lower()
+    digest_length = len(fingerprint)
+    hashfunc = HASHFUNC_MAP.get(digest_length)
+    if not hashfunc:
+        raise SSLError("Fingerprint of invalid length: {0}".format(fingerprint))
+
+    # We need encode() here for py32; works on py2 and p33.
+    fingerprint_bytes = unhexlify(fingerprint.encode())
+
+    cert_digest = hashfunc(cert).digest()
+
+    if not _const_compare_digest(cert_digest, fingerprint_bytes):
+        raise SSLError(
+            'Fingerprints did not match. Expected "{0}", got "{1}".'.format(
+                fingerprint, hexlify(cert_digest)
+            )
+        )
+
+
+def resolve_cert_reqs(candidate):
+    """
+    Resolves the argument to a numeric constant, which can be passed to
+    the wrap_socket function/method from the ssl module.
+    Defaults to :data:`ssl.CERT_REQUIRED`.
+    If given a string it is assumed to be the name of the constant in the
+    :mod:`ssl` module or its abbreviation.
+    (So you can specify `REQUIRED` instead of `CERT_REQUIRED`.
+    If it's neither `None` nor a string we assume it is already the numeric
+    constant which can directly be passed to wrap_socket.
+    """
+    if candidate is None:
+        return CERT_REQUIRED
+
+    if isinstance(candidate, str):
+        res = getattr(ssl, candidate, None)
+        if res is None:
+            res = getattr(ssl, "CERT_" + candidate)
+        return res
+
+    return candidate
+
+
+def resolve_ssl_version(candidate):
+    """
+    like resolve_cert_reqs
+    """
+    if candidate is None:
+        return PROTOCOL_TLS
+
+    if isinstance(candidate, str):
+        res = getattr(ssl, candidate, None)
+        if res is None:
+            res = getattr(ssl, "PROTOCOL_" + candidate)
+        return res
+
+    return candidate
+
+
+def create_urllib3_context(
+    ssl_version=None, cert_reqs=None, options=None, ciphers=None
+):
+    """All arguments have the same meaning as ``ssl_wrap_socket``.
+
+    By default, this function does a lot of the same work that
+    ``ssl.create_default_context`` does on Python 3.4+. It:
+
+    - Disables SSLv2, SSLv3, and compression
+    - Sets a restricted set of server ciphers
+
+    If you wish to enable SSLv3, you can do::
+
+        from pip._vendor.urllib3.util import ssl_
+        context = ssl_.create_urllib3_context()
+        context.options &= ~ssl_.OP_NO_SSLv3
+
+    You can do the same to enable compression (substituting ``COMPRESSION``
+    for ``SSLv3`` in the last line above).
+
+    :param ssl_version:
+        The desired protocol version to use. This will default to
+        PROTOCOL_SSLv23 which will negotiate the highest protocol that both
+        the server and your installation of OpenSSL support.
+    :param cert_reqs:
+        Whether to require the certificate verification. This defaults to
+        ``ssl.CERT_REQUIRED``.
+    :param options:
+        Specific OpenSSL options. These default to ``ssl.OP_NO_SSLv2``,
+        ``ssl.OP_NO_SSLv3``, ``ssl.OP_NO_COMPRESSION``.
+    :param ciphers:
+        Which cipher suites to allow the server to select.
+    :returns:
+        Constructed SSLContext object with specified options
+    :rtype: SSLContext
+    """
+    context = SSLContext(ssl_version or PROTOCOL_TLS)
+
+    context.set_ciphers(ciphers or DEFAULT_CIPHERS)
+
+    # Setting the default here, as we may have no ssl module on import
+    cert_reqs = ssl.CERT_REQUIRED if cert_reqs is None else cert_reqs
+
+    if options is None:
+        options = 0
+        # SSLv2 is easily broken and is considered harmful and dangerous
+        options |= OP_NO_SSLv2
+        # SSLv3 has several problems and is now dangerous
+        options |= OP_NO_SSLv3
+        # Disable compression to prevent CRIME attacks for OpenSSL 1.0+
+        # (issue #309)
+        options |= OP_NO_COMPRESSION
+
+    context.options |= options
+
+    # Enable post-handshake authentication for TLS 1.3, see GH #1634. PHA is
+    # necessary for conditional client cert authentication with TLS 1.3.
+    # The attribute is None for OpenSSL <= 1.1.0 or does not exist in older
+    # versions of Python.  We only enable on Python 3.7.4+ or if certificate
+    # verification is enabled to work around Python issue #37428
+    # See: https://bugs.python.org/issue37428
+    if (cert_reqs == ssl.CERT_REQUIRED or sys.version_info >= (3, 7, 4)) and getattr(
+        context, "post_handshake_auth", None
+    ) is not None:
+        context.post_handshake_auth = True
+
+    context.verify_mode = cert_reqs
+    if (
+        getattr(context, "check_hostname", None) is not None
+    ):  # Platform-specific: Python 3.2
+        # We do our own verification, including fingerprints and alternative
+        # hostnames. So disable it here
+        context.check_hostname = False
+    return context
+
+
+def ssl_wrap_socket(
+    sock,
+    keyfile=None,
+    certfile=None,
+    cert_reqs=None,
+    ca_certs=None,
+    server_hostname=None,
+    ssl_version=None,
+    ciphers=None,
+    ssl_context=None,
+    ca_cert_dir=None,
+    key_password=None,
+    ca_cert_data=None,
+):
+    """
+    All arguments except for server_hostname, ssl_context, and ca_cert_dir have
+    the same meaning as they do when using :func:`ssl.wrap_socket`.
+
+    :param server_hostname:
+        When SNI is supported, the expected hostname of the certificate
+    :param ssl_context:
+        A pre-made :class:`SSLContext` object. If none is provided, one will
+        be created using :func:`create_urllib3_context`.
+    :param ciphers:
+        A string of ciphers we wish the client to support.
+    :param ca_cert_dir:
+        A directory containing CA certificates in multiple separate files, as
+        supported by OpenSSL's -CApath flag or the capath argument to
+        SSLContext.load_verify_locations().
+    :param key_password:
+        Optional password if the keyfile is encrypted.
+    :param ca_cert_data:
+        Optional string containing CA certificates in PEM format suitable for
+        passing as the cadata parameter to SSLContext.load_verify_locations()
+    """
+    context = ssl_context
+    if context is None:
+        # Note: This branch of code and all the variables in it are no longer
+        # used by urllib3 itself. We should consider deprecating and removing
+        # this code.
+        context = create_urllib3_context(ssl_version, cert_reqs, ciphers=ciphers)
+
+    if ca_certs or ca_cert_dir or ca_cert_data:
+        try:
+            context.load_verify_locations(ca_certs, ca_cert_dir, ca_cert_data)
+        except IOError as e:  # Platform-specific: Python 2.7
+            raise SSLError(e)
+        # Py33 raises FileNotFoundError which subclasses OSError
+        # These are not equivalent unless we check the errno attribute
+        except OSError as e:  # Platform-specific: Python 3.3 and beyond
+            if e.errno == errno.ENOENT:
+                raise SSLError(e)
+            raise
+
+    elif ssl_context is None and hasattr(context, "load_default_certs"):
+        # try to load OS default certs; works well on Windows (require Python3.4+)
+        context.load_default_certs()
+
+    # Attempt to detect if we get the goofy behavior of the
+    # keyfile being encrypted and OpenSSL asking for the
+    # passphrase via the terminal and instead error out.
+    if keyfile and key_password is None and _is_key_file_encrypted(keyfile):
+        raise SSLError("Client private key is encrypted, password is required")
+
+    if certfile:
+        if key_password is None:
+            context.load_cert_chain(certfile, keyfile)
+        else:
+            context.load_cert_chain(certfile, keyfile, key_password)
+
+    # If we detect server_hostname is an IP address then the SNI
+    # extension should not be used according to RFC3546 Section 3.1
+    # We shouldn't warn the user if SNI isn't available but we would
+    # not be using SNI anyways due to IP address for server_hostname.
+    if (
+        server_hostname is not None and not is_ipaddress(server_hostname)
+    ) or IS_SECURETRANSPORT:
+        if HAS_SNI and server_hostname is not None:
+            return context.wrap_socket(sock, server_hostname=server_hostname)
+
+        warnings.warn(
+            "An HTTPS request has been made, but the SNI (Server Name "
+            "Indication) extension to TLS is not available on this platform. "
+            "This may cause the server to present an incorrect TLS "
+            "certificate, which can cause validation failures. You can upgrade to "
+            "a newer version of Python to solve this. For more information, see "
+            "https://urllib3.readthedocs.io/en/latest/advanced-usage.html"
+            "#ssl-warnings",
+            SNIMissingWarning,
+        )
+
+    return context.wrap_socket(sock)
+
+
+def is_ipaddress(hostname):
+    """Detects whether the hostname given is an IPv4 or IPv6 address.
+    Also detects IPv6 addresses with Zone IDs.
+
+    :param str hostname: Hostname to examine.
+    :return: True if the hostname is an IP address, False otherwise.
+    """
+    if not six.PY2 and isinstance(hostname, bytes):
+        # IDN A-label bytes are ASCII compatible.
+        hostname = hostname.decode("ascii")
+    return bool(IPV4_RE.match(hostname) or BRACELESS_IPV6_ADDRZ_RE.match(hostname))
+
+
+def _is_key_file_encrypted(key_file):
+    """Detects if a key file is encrypted or not."""
+    with open(key_file, "r") as f:
+        for line in f:
+            # Look for Proc-Type: 4,ENCRYPTED
+            if "ENCRYPTED" in line:
+                return True
+
+    return False
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/timeout.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/timeout.py
new file mode 100644
index 000000000..b61fea75c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/timeout.py
@@ -0,0 +1,261 @@
+from __future__ import absolute_import
+
+# The default socket timeout, used by httplib to indicate that no timeout was
+# specified by the user
+from socket import _GLOBAL_DEFAULT_TIMEOUT
+import time
+
+from ..exceptions import TimeoutStateError
+
+# A sentinel value to indicate that no timeout was specified by the user in
+# urllib3
+_Default = object()
+
+
+# Use time.monotonic if available.
+current_time = getattr(time, "monotonic", time.time)
+
+
+class Timeout(object):
+    """ Timeout configuration.
+
+    Timeouts can be defined as a default for a pool::
+
+        timeout = Timeout(connect=2.0, read=7.0)
+        http = PoolManager(timeout=timeout)
+        response = http.request('GET', 'http://example.com/')
+
+    Or per-request (which overrides the default for the pool)::
+
+        response = http.request('GET', 'http://example.com/', timeout=Timeout(10))
+
+    Timeouts can be disabled by setting all the parameters to ``None``::
+
+        no_timeout = Timeout(connect=None, read=None)
+        response = http.request('GET', 'http://example.com/, timeout=no_timeout)
+
+
+    :param total:
+        This combines the connect and read timeouts into one; the read timeout
+        will be set to the time leftover from the connect attempt. In the
+        event that both a connect timeout and a total are specified, or a read
+        timeout and a total are specified, the shorter timeout will be applied.
+
+        Defaults to None.
+
+    :type total: integer, float, or None
+
+    :param connect:
+        The maximum amount of time (in seconds) to wait for a connection
+        attempt to a server to succeed. Omitting the parameter will default the
+        connect timeout to the system default, probably `the global default
+        timeout in socket.py
+        <http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
+        None will set an infinite timeout for connection attempts.
+
+    :type connect: integer, float, or None
+
+    :param read:
+        The maximum amount of time (in seconds) to wait between consecutive
+        read operations for a response from the server. Omitting the parameter
+        will default the read timeout to the system default, probably `the
+        global default timeout in socket.py
+        <http://hg.python.org/cpython/file/603b4d593758/Lib/socket.py#l535>`_.
+        None will set an infinite timeout.
+
+    :type read: integer, float, or None
+
+    .. note::
+
+        Many factors can affect the total amount of time for urllib3 to return
+        an HTTP response.
+
+        For example, Python's DNS resolver does not obey the timeout specified
+        on the socket. Other factors that can affect total request time include
+        high CPU load, high swap, the program running at a low priority level,
+        or other behaviors.
+
+        In addition, the read and total timeouts only measure the time between
+        read operations on the socket connecting the client and the server,
+        not the total amount of time for the request to return a complete
+        response. For most requests, the timeout is raised because the server
+        has not sent the first byte in the specified time. This is not always
+        the case; if a server streams one byte every fifteen seconds, a timeout
+        of 20 seconds will not trigger, even though the request will take
+        several minutes to complete.
+
+        If your goal is to cut off any request after a set amount of wall clock
+        time, consider having a second "watcher" thread to cut off a slow
+        request.
+    """
+
+    #: A sentinel object representing the default timeout value
+    DEFAULT_TIMEOUT = _GLOBAL_DEFAULT_TIMEOUT
+
+    def __init__(self, total=None, connect=_Default, read=_Default):
+        self._connect = self._validate_timeout(connect, "connect")
+        self._read = self._validate_timeout(read, "read")
+        self.total = self._validate_timeout(total, "total")
+        self._start_connect = None
+
+    def __repr__(self):
+        return "%s(connect=%r, read=%r, total=%r)" % (
+            type(self).__name__,
+            self._connect,
+            self._read,
+            self.total,
+        )
+
+    # __str__ provided for backwards compatibility
+    __str__ = __repr__
+
+    @classmethod
+    def _validate_timeout(cls, value, name):
+        """ Check that a timeout attribute is valid.
+
+        :param value: The timeout value to validate
+        :param name: The name of the timeout attribute to validate. This is
+            used to specify in error messages.
+        :return: The validated and casted version of the given value.
+        :raises ValueError: If it is a numeric value less than or equal to
+            zero, or the type is not an integer, float, or None.
+        """
+        if value is _Default:
+            return cls.DEFAULT_TIMEOUT
+
+        if value is None or value is cls.DEFAULT_TIMEOUT:
+            return value
+
+        if isinstance(value, bool):
+            raise ValueError(
+                "Timeout cannot be a boolean value. It must "
+                "be an int, float or None."
+            )
+        try:
+            float(value)
+        except (TypeError, ValueError):
+            raise ValueError(
+                "Timeout value %s was %s, but it must be an "
+                "int, float or None." % (name, value)
+            )
+
+        try:
+            if value <= 0:
+                raise ValueError(
+                    "Attempted to set %s timeout to %s, but the "
+                    "timeout cannot be set to a value less "
+                    "than or equal to 0." % (name, value)
+                )
+        except TypeError:
+            # Python 3
+            raise ValueError(
+                "Timeout value %s was %s, but it must be an "
+                "int, float or None." % (name, value)
+            )
+
+        return value
+
+    @classmethod
+    def from_float(cls, timeout):
+        """ Create a new Timeout from a legacy timeout value.
+
+        The timeout value used by httplib.py sets the same timeout on the
+        connect(), and recv() socket requests. This creates a :class:`Timeout`
+        object that sets the individual timeouts to the ``timeout`` value
+        passed to this function.
+
+        :param timeout: The legacy timeout value.
+        :type timeout: integer, float, sentinel default object, or None
+        :return: Timeout object
+        :rtype: :class:`Timeout`
+        """
+        return Timeout(read=timeout, connect=timeout)
+
+    def clone(self):
+        """ Create a copy of the timeout object
+
+        Timeout properties are stored per-pool but each request needs a fresh
+        Timeout object to ensure each one has its own start/stop configured.
+
+        :return: a copy of the timeout object
+        :rtype: :class:`Timeout`
+        """
+        # We can't use copy.deepcopy because that will also create a new object
+        # for _GLOBAL_DEFAULT_TIMEOUT, which socket.py uses as a sentinel to
+        # detect the user default.
+        return Timeout(connect=self._connect, read=self._read, total=self.total)
+
+    def start_connect(self):
+        """ Start the timeout clock, used during a connect() attempt
+
+        :raises urllib3.exceptions.TimeoutStateError: if you attempt
+            to start a timer that has been started already.
+        """
+        if self._start_connect is not None:
+            raise TimeoutStateError("Timeout timer has already been started.")
+        self._start_connect = current_time()
+        return self._start_connect
+
+    def get_connect_duration(self):
+        """ Gets the time elapsed since the call to :meth:`start_connect`.
+
+        :return: Elapsed time in seconds.
+        :rtype: float
+        :raises urllib3.exceptions.TimeoutStateError: if you attempt
+            to get duration for a timer that hasn't been started.
+        """
+        if self._start_connect is None:
+            raise TimeoutStateError(
+                "Can't get connect duration for timer that has not started."
+            )
+        return current_time() - self._start_connect
+
+    @property
+    def connect_timeout(self):
+        """ Get the value to use when setting a connection timeout.
+
+        This will be a positive float or integer, the value None
+        (never timeout), or the default system timeout.
+
+        :return: Connect timeout.
+        :rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
+        """
+        if self.total is None:
+            return self._connect
+
+        if self._connect is None or self._connect is self.DEFAULT_TIMEOUT:
+            return self.total
+
+        return min(self._connect, self.total)
+
+    @property
+    def read_timeout(self):
+        """ Get the value for the read timeout.
+
+        This assumes some time has elapsed in the connection timeout and
+        computes the read timeout appropriately.
+
+        If self.total is set, the read timeout is dependent on the amount of
+        time taken by the connect timeout. If the connection time has not been
+        established, a :exc:`~urllib3.exceptions.TimeoutStateError` will be
+        raised.
+
+        :return: Value to use for the read timeout.
+        :rtype: int, float, :attr:`Timeout.DEFAULT_TIMEOUT` or None
+        :raises urllib3.exceptions.TimeoutStateError: If :meth:`start_connect`
+            has not yet been called on this object.
+        """
+        if (
+            self.total is not None
+            and self.total is not self.DEFAULT_TIMEOUT
+            and self._read is not None
+            and self._read is not self.DEFAULT_TIMEOUT
+        ):
+            # In case the connect timeout has not yet been established.
+            if self._start_connect is None:
+                return self._read
+            return max(0, min(self.total - self.get_connect_duration(), self._read))
+        elif self.total is not None and self.total is not self.DEFAULT_TIMEOUT:
+            return max(0, self.total - self.get_connect_duration())
+        else:
+            return self._read
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/url.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/url.py
new file mode 100644
index 000000000..0eb0b6a8c
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/url.py
@@ -0,0 +1,430 @@
+from __future__ import absolute_import
+import re
+from collections import namedtuple
+
+from ..exceptions import LocationParseError
+from ..packages import six
+
+
+url_attrs = ["scheme", "auth", "host", "port", "path", "query", "fragment"]
+
+# We only want to normalize urls with an HTTP(S) scheme.
+# urllib3 infers URLs without a scheme (None) to be http.
+NORMALIZABLE_SCHEMES = ("http", "https", None)
+
+# Almost all of these patterns were derived from the
+# 'rfc3986' module: https://github.com/python-hyper/rfc3986
+PERCENT_RE = re.compile(r"%[a-fA-F0-9]{2}")
+SCHEME_RE = re.compile(r"^(?:[a-zA-Z][a-zA-Z0-9+-]*:|/)")
+URI_RE = re.compile(
+    r"^(?:([a-zA-Z][a-zA-Z0-9+.-]*):)?"
+    r"(?://([^\\/?#]*))?"
+    r"([^?#]*)"
+    r"(?:\?([^#]*))?"
+    r"(?:#(.*))?$",
+    re.UNICODE | re.DOTALL,
+)
+
+IPV4_PAT = r"(?:[0-9]{1,3}\.){3}[0-9]{1,3}"
+HEX_PAT = "[0-9A-Fa-f]{1,4}"
+LS32_PAT = "(?:{hex}:{hex}|{ipv4})".format(hex=HEX_PAT, ipv4=IPV4_PAT)
+_subs = {"hex": HEX_PAT, "ls32": LS32_PAT}
+_variations = [
+    #                            6( h16 ":" ) ls32
+    "(?:%(hex)s:){6}%(ls32)s",
+    #                       "::" 5( h16 ":" ) ls32
+    "::(?:%(hex)s:){5}%(ls32)s",
+    # [               h16 ] "::" 4( h16 ":" ) ls32
+    "(?:%(hex)s)?::(?:%(hex)s:){4}%(ls32)s",
+    # [ *1( h16 ":" ) h16 ] "::" 3( h16 ":" ) ls32
+    "(?:(?:%(hex)s:)?%(hex)s)?::(?:%(hex)s:){3}%(ls32)s",
+    # [ *2( h16 ":" ) h16 ] "::" 2( h16 ":" ) ls32
+    "(?:(?:%(hex)s:){0,2}%(hex)s)?::(?:%(hex)s:){2}%(ls32)s",
+    # [ *3( h16 ":" ) h16 ] "::"    h16 ":"   ls32
+    "(?:(?:%(hex)s:){0,3}%(hex)s)?::%(hex)s:%(ls32)s",
+    # [ *4( h16 ":" ) h16 ] "::"              ls32
+    "(?:(?:%(hex)s:){0,4}%(hex)s)?::%(ls32)s",
+    # [ *5( h16 ":" ) h16 ] "::"              h16
+    "(?:(?:%(hex)s:){0,5}%(hex)s)?::%(hex)s",
+    # [ *6( h16 ":" ) h16 ] "::"
+    "(?:(?:%(hex)s:){0,6}%(hex)s)?::",
+]
+
+UNRESERVED_PAT = r"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789._!\-~"
+IPV6_PAT = "(?:" + "|".join([x % _subs for x in _variations]) + ")"
+ZONE_ID_PAT = "(?:%25|%)(?:[" + UNRESERVED_PAT + "]|%[a-fA-F0-9]{2})+"
+IPV6_ADDRZ_PAT = r"\[" + IPV6_PAT + r"(?:" + ZONE_ID_PAT + r")?\]"
+REG_NAME_PAT = r"(?:[^\[\]%:/?#]|%[a-fA-F0-9]{2})*"
+TARGET_RE = re.compile(r"^(/[^?#]*)(?:\?([^#]*))?(?:#.*)?$")
+
+IPV4_RE = re.compile("^" + IPV4_PAT + "$")
+IPV6_RE = re.compile("^" + IPV6_PAT + "$")
+IPV6_ADDRZ_RE = re.compile("^" + IPV6_ADDRZ_PAT + "$")
+BRACELESS_IPV6_ADDRZ_RE = re.compile("^" + IPV6_ADDRZ_PAT[2:-2] + "$")
+ZONE_ID_RE = re.compile("(" + ZONE_ID_PAT + r")\]$")
+
+SUBAUTHORITY_PAT = (u"^(?:(.*)@)?(%s|%s|%s)(?::([0-9]{0,5}))?$") % (
+    REG_NAME_PAT,
+    IPV4_PAT,
+    IPV6_ADDRZ_PAT,
+)
+SUBAUTHORITY_RE = re.compile(SUBAUTHORITY_PAT, re.UNICODE | re.DOTALL)
+
+UNRESERVED_CHARS = set(
+    "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789._-~"
+)
+SUB_DELIM_CHARS = set("!$&'()*+,;=")
+USERINFO_CHARS = UNRESERVED_CHARS | SUB_DELIM_CHARS | {":"}
+PATH_CHARS = USERINFO_CHARS | {"@", "/"}
+QUERY_CHARS = FRAGMENT_CHARS = PATH_CHARS | {"?"}
+
+
+class Url(namedtuple("Url", url_attrs)):
+    """
+    Data structure for representing an HTTP URL. Used as a return value for
+    :func:`parse_url`. Both the scheme and host are normalized as they are
+    both case-insensitive according to RFC 3986.
+    """
+
+    __slots__ = ()
+
+    def __new__(
+        cls,
+        scheme=None,
+        auth=None,
+        host=None,
+        port=None,
+        path=None,
+        query=None,
+        fragment=None,
+    ):
+        if path and not path.startswith("/"):
+            path = "/" + path
+        if scheme is not None:
+            scheme = scheme.lower()
+        return super(Url, cls).__new__(
+            cls, scheme, auth, host, port, path, query, fragment
+        )
+
+    @property
+    def hostname(self):
+        """For backwards-compatibility with urlparse. We're nice like that."""
+        return self.host
+
+    @property
+    def request_uri(self):
+        """Absolute path including the query string."""
+        uri = self.path or "/"
+
+        if self.query is not None:
+            uri += "?" + self.query
+
+        return uri
+
+    @property
+    def netloc(self):
+        """Network location including host and port"""
+        if self.port:
+            return "%s:%d" % (self.host, self.port)
+        return self.host
+
+    @property
+    def url(self):
+        """
+        Convert self into a url
+
+        This function should more or less round-trip with :func:`.parse_url`. The
+        returned url may not be exactly the same as the url inputted to
+        :func:`.parse_url`, but it should be equivalent by the RFC (e.g., urls
+        with a blank port will have : removed).
+
+        Example: ::
+
+            >>> U = parse_url('http://google.com/mail/')
+            >>> U.url
+            'http://google.com/mail/'
+            >>> Url('http', 'username:password', 'host.com', 80,
+            ... '/path', 'query', 'fragment').url
+            'http://username:password@host.com:80/path?query#fragment'
+        """
+        scheme, auth, host, port, path, query, fragment = self
+        url = u""
+
+        # We use "is not None" we want things to happen with empty strings (or 0 port)
+        if scheme is not None:
+            url += scheme + u"://"
+        if auth is not None:
+            url += auth + u"@"
+        if host is not None:
+            url += host
+        if port is not None:
+            url += u":" + str(port)
+        if path is not None:
+            url += path
+        if query is not None:
+            url += u"?" + query
+        if fragment is not None:
+            url += u"#" + fragment
+
+        return url
+
+    def __str__(self):
+        return self.url
+
+
+def split_first(s, delims):
+    """
+    .. deprecated:: 1.25
+
+    Given a string and an iterable of delimiters, split on the first found
+    delimiter. Return two split parts and the matched delimiter.
+
+    If not found, then the first part is the full input string.
+
+    Example::
+
+        >>> split_first('foo/bar?baz', '?/=')
+        ('foo', 'bar?baz', '/')
+        >>> split_first('foo/bar?baz', '123')
+        ('foo/bar?baz', '', None)
+
+    Scales linearly with number of delims. Not ideal for large number of delims.
+    """
+    min_idx = None
+    min_delim = None
+    for d in delims:
+        idx = s.find(d)
+        if idx < 0:
+            continue
+
+        if min_idx is None or idx < min_idx:
+            min_idx = idx
+            min_delim = d
+
+    if min_idx is None or min_idx < 0:
+        return s, "", None
+
+    return s[:min_idx], s[min_idx + 1 :], min_delim
+
+
+def _encode_invalid_chars(component, allowed_chars, encoding="utf-8"):
+    """Percent-encodes a URI component without reapplying
+    onto an already percent-encoded component.
+    """
+    if component is None:
+        return component
+
+    component = six.ensure_text(component)
+
+    # Normalize existing percent-encoded bytes.
+    # Try to see if the component we're encoding is already percent-encoded
+    # so we can skip all '%' characters but still encode all others.
+    component, percent_encodings = PERCENT_RE.subn(
+        lambda match: match.group(0).upper(), component
+    )
+
+    uri_bytes = component.encode("utf-8", "surrogatepass")
+    is_percent_encoded = percent_encodings == uri_bytes.count(b"%")
+    encoded_component = bytearray()
+
+    for i in range(0, len(uri_bytes)):
+        # Will return a single character bytestring on both Python 2 & 3
+        byte = uri_bytes[i : i + 1]
+        byte_ord = ord(byte)
+        if (is_percent_encoded and byte == b"%") or (
+            byte_ord < 128 and byte.decode() in allowed_chars
+        ):
+            encoded_component += byte
+            continue
+        encoded_component.extend(b"%" + (hex(byte_ord)[2:].encode().zfill(2).upper()))
+
+    return encoded_component.decode(encoding)
+
+
+def _remove_path_dot_segments(path):
+    # See http://tools.ietf.org/html/rfc3986#section-5.2.4 for pseudo-code
+    segments = path.split("/")  # Turn the path into a list of segments
+    output = []  # Initialize the variable to use to store output
+
+    for segment in segments:
+        # '.' is the current directory, so ignore it, it is superfluous
+        if segment == ".":
+            continue
+        # Anything other than '..', should be appended to the output
+        elif segment != "..":
+            output.append(segment)
+        # In this case segment == '..', if we can, we should pop the last
+        # element
+        elif output:
+            output.pop()
+
+    # If the path starts with '/' and the output is empty or the first string
+    # is non-empty
+    if path.startswith("/") and (not output or output[0]):
+        output.insert(0, "")
+
+    # If the path starts with '/.' or '/..' ensure we add one more empty
+    # string to add a trailing '/'
+    if path.endswith(("/.", "/..")):
+        output.append("")
+
+    return "/".join(output)
+
+
+def _normalize_host(host, scheme):
+    if host:
+        if isinstance(host, six.binary_type):
+            host = six.ensure_str(host)
+
+        if scheme in NORMALIZABLE_SCHEMES:
+            is_ipv6 = IPV6_ADDRZ_RE.match(host)
+            if is_ipv6:
+                match = ZONE_ID_RE.search(host)
+                if match:
+                    start, end = match.span(1)
+                    zone_id = host[start:end]
+
+                    if zone_id.startswith("%25") and zone_id != "%25":
+                        zone_id = zone_id[3:]
+                    else:
+                        zone_id = zone_id[1:]
+                    zone_id = "%" + _encode_invalid_chars(zone_id, UNRESERVED_CHARS)
+                    return host[:start].lower() + zone_id + host[end:]
+                else:
+                    return host.lower()
+            elif not IPV4_RE.match(host):
+                return six.ensure_str(
+                    b".".join([_idna_encode(label) for label in host.split(".")])
+                )
+    return host
+
+
+def _idna_encode(name):
+    if name and any([ord(x) > 128 for x in name]):
+        try:
+            from pip._vendor import idna
+        except ImportError:
+            six.raise_from(
+                LocationParseError("Unable to parse URL without the 'idna' module"),
+                None,
+            )
+        try:
+            return idna.encode(name.lower(), strict=True, std3_rules=True)
+        except idna.IDNAError:
+            six.raise_from(
+                LocationParseError(u"Name '%s' is not a valid IDNA label" % name), None
+            )
+    return name.lower().encode("ascii")
+
+
+def _encode_target(target):
+    """Percent-encodes a request target so that there are no invalid characters"""
+    path, query = TARGET_RE.match(target).groups()
+    target = _encode_invalid_chars(path, PATH_CHARS)
+    query = _encode_invalid_chars(query, QUERY_CHARS)
+    if query is not None:
+        target += "?" + query
+    return target
+
+
+def parse_url(url):
+    """
+    Given a url, return a parsed :class:`.Url` namedtuple. Best-effort is
+    performed to parse incomplete urls. Fields not provided will be None.
+    This parser is RFC 3986 compliant.
+
+    The parser logic and helper functions are based heavily on
+    work done in the ``rfc3986`` module.
+
+    :param str url: URL to parse into a :class:`.Url` namedtuple.
+
+    Partly backwards-compatible with :mod:`urlparse`.
+
+    Example::
+
+        >>> parse_url('http://google.com/mail/')
+        Url(scheme='http', host='google.com', port=None, path='/mail/', ...)
+        >>> parse_url('google.com:80')
+        Url(scheme=None, host='google.com', port=80, path=None, ...)
+        >>> parse_url('/foo?bar')
+        Url(scheme=None, host=None, port=None, path='/foo', query='bar', ...)
+    """
+    if not url:
+        # Empty
+        return Url()
+
+    source_url = url
+    if not SCHEME_RE.search(url):
+        url = "//" + url
+
+    try:
+        scheme, authority, path, query, fragment = URI_RE.match(url).groups()
+        normalize_uri = scheme is None or scheme.lower() in NORMALIZABLE_SCHEMES
+
+        if scheme:
+            scheme = scheme.lower()
+
+        if authority:
+            auth, host, port = SUBAUTHORITY_RE.match(authority).groups()
+            if auth and normalize_uri:
+                auth = _encode_invalid_chars(auth, USERINFO_CHARS)
+            if port == "":
+                port = None
+        else:
+            auth, host, port = None, None, None
+
+        if port is not None:
+            port = int(port)
+            if not (0 <= port <= 65535):
+                raise LocationParseError(url)
+
+        host = _normalize_host(host, scheme)
+
+        if normalize_uri and path:
+            path = _remove_path_dot_segments(path)
+            path = _encode_invalid_chars(path, PATH_CHARS)
+        if normalize_uri and query:
+            query = _encode_invalid_chars(query, QUERY_CHARS)
+        if normalize_uri and fragment:
+            fragment = _encode_invalid_chars(fragment, FRAGMENT_CHARS)
+
+    except (ValueError, AttributeError):
+        return six.raise_from(LocationParseError(source_url), None)
+
+    # For the sake of backwards compatibility we put empty
+    # string values for path if there are any defined values
+    # beyond the path in the URL.
+    # TODO: Remove this when we break backwards compatibility.
+    if not path:
+        if query is not None or fragment is not None:
+            path = ""
+        else:
+            path = None
+
+    # Ensure that each part of the URL is a `str` for
+    # backwards compatibility.
+    if isinstance(url, six.text_type):
+        ensure_func = six.ensure_text
+    else:
+        ensure_func = six.ensure_str
+
+    def ensure_type(x):
+        return x if x is None else ensure_func(x)
+
+    return Url(
+        scheme=ensure_type(scheme),
+        auth=ensure_type(auth),
+        host=ensure_type(host),
+        port=port,
+        path=ensure_type(path),
+        query=ensure_type(query),
+        fragment=ensure_type(fragment),
+    )
+
+
+def get_host(url):
+    """
+    Deprecated. Use :func:`parse_url` instead.
+    """
+    p = parse_url(url)
+    return p.scheme or "http", p.hostname, p.port
diff --git a/venv/Lib/site-packages/pip/_vendor/urllib3/util/wait.py b/venv/Lib/site-packages/pip/_vendor/urllib3/util/wait.py
new file mode 100644
index 000000000..d71d2fd72
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/urllib3/util/wait.py
@@ -0,0 +1,153 @@
+import errno
+from functools import partial
+import select
+import sys
+
+try:
+    from time import monotonic
+except ImportError:
+    from time import time as monotonic
+
+__all__ = ["NoWayToWaitForSocketError", "wait_for_read", "wait_for_write"]
+
+
+class NoWayToWaitForSocketError(Exception):
+    pass
+
+
+# How should we wait on sockets?
+#
+# There are two types of APIs you can use for waiting on sockets: the fancy
+# modern stateful APIs like epoll/kqueue, and the older stateless APIs like
+# select/poll. The stateful APIs are more efficient when you have a lots of
+# sockets to keep track of, because you can set them up once and then use them
+# lots of times. But we only ever want to wait on a single socket at a time
+# and don't want to keep track of state, so the stateless APIs are actually
+# more efficient. So we want to use select() or poll().
+#
+# Now, how do we choose between select() and poll()? On traditional Unixes,
+# select() has a strange calling convention that makes it slow, or fail
+# altogether, for high-numbered file descriptors. The point of poll() is to fix
+# that, so on Unixes, we prefer poll().
+#
+# On Windows, there is no poll() (or at least Python doesn't provide a wrapper
+# for it), but that's OK, because on Windows, select() doesn't have this
+# strange calling convention; plain select() works fine.
+#
+# So: on Windows we use select(), and everywhere else we use poll(). We also
+# fall back to select() in case poll() is somehow broken or missing.
+
+if sys.version_info >= (3, 5):
+    # Modern Python, that retries syscalls by default
+    def _retry_on_intr(fn, timeout):
+        return fn(timeout)
+
+
+else:
+    # Old and broken Pythons.
+    def _retry_on_intr(fn, timeout):
+        if timeout is None:
+            deadline = float("inf")
+        else:
+            deadline = monotonic() + timeout
+
+        while True:
+            try:
+                return fn(timeout)
+            # OSError for 3 <= pyver < 3.5, select.error for pyver <= 2.7
+            except (OSError, select.error) as e:
+                # 'e.args[0]' incantation works for both OSError and select.error
+                if e.args[0] != errno.EINTR:
+                    raise
+                else:
+                    timeout = deadline - monotonic()
+                    if timeout < 0:
+                        timeout = 0
+                    if timeout == float("inf"):
+                        timeout = None
+                    continue
+
+
+def select_wait_for_socket(sock, read=False, write=False, timeout=None):
+    if not read and not write:
+        raise RuntimeError("must specify at least one of read=True, write=True")
+    rcheck = []
+    wcheck = []
+    if read:
+        rcheck.append(sock)
+    if write:
+        wcheck.append(sock)
+    # When doing a non-blocking connect, most systems signal success by
+    # marking the socket writable. Windows, though, signals success by marked
+    # it as "exceptional". We paper over the difference by checking the write
+    # sockets for both conditions. (The stdlib selectors module does the same
+    # thing.)
+    fn = partial(select.select, rcheck, wcheck, wcheck)
+    rready, wready, xready = _retry_on_intr(fn, timeout)
+    return bool(rready or wready or xready)
+
+
+def poll_wait_for_socket(sock, read=False, write=False, timeout=None):
+    if not read and not write:
+        raise RuntimeError("must specify at least one of read=True, write=True")
+    mask = 0
+    if read:
+        mask |= select.POLLIN
+    if write:
+        mask |= select.POLLOUT
+    poll_obj = select.poll()
+    poll_obj.register(sock, mask)
+
+    # For some reason, poll() takes timeout in milliseconds
+    def do_poll(t):
+        if t is not None:
+            t *= 1000
+        return poll_obj.poll(t)
+
+    return bool(_retry_on_intr(do_poll, timeout))
+
+
+def null_wait_for_socket(*args, **kwargs):
+    raise NoWayToWaitForSocketError("no select-equivalent available")
+
+
+def _have_working_poll():
+    # Apparently some systems have a select.poll that fails as soon as you try
+    # to use it, either due to strange configuration or broken monkeypatching
+    # from libraries like eventlet/greenlet.
+    try:
+        poll_obj = select.poll()
+        _retry_on_intr(poll_obj.poll, 0)
+    except (AttributeError, OSError):
+        return False
+    else:
+        return True
+
+
+def wait_for_socket(*args, **kwargs):
+    # We delay choosing which implementation to use until the first time we're
+    # called. We could do it at import time, but then we might make the wrong
+    # decision if someone goes wild with monkeypatching select.poll after
+    # we're imported.
+    global wait_for_socket
+    if _have_working_poll():
+        wait_for_socket = poll_wait_for_socket
+    elif hasattr(select, "select"):
+        wait_for_socket = select_wait_for_socket
+    else:  # Platform-specific: Appengine.
+        wait_for_socket = null_wait_for_socket
+    return wait_for_socket(*args, **kwargs)
+
+
+def wait_for_read(sock, timeout=None):
+    """ Waits for reading to be available on a given socket.
+    Returns True if the socket is readable, or False if the timeout expired.
+    """
+    return wait_for_socket(sock, read=True, timeout=timeout)
+
+
+def wait_for_write(sock, timeout=None):
+    """ Waits for writing to be available on a given socket.
+    Returns True if the socket is readable, or False if the timeout expired.
+    """
+    return wait_for_socket(sock, write=True, timeout=timeout)
diff --git a/venv/Lib/site-packages/pip/_vendor/vendor.txt b/venv/Lib/site-packages/pip/_vendor/vendor.txt
new file mode 100644
index 000000000..06fa1358f
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/vendor.txt
@@ -0,0 +1,24 @@
+appdirs==1.4.4
+CacheControl==0.12.6
+colorama==0.4.3
+contextlib2==0.6.0.post1
+distlib==0.3.1
+distro==1.5.0
+html5lib==1.1
+ipaddress==1.0.23  # Only needed on 2.6 and 2.7
+msgpack==1.0.0
+packaging==20.4
+pep517==0.8.2
+progress==1.5
+pyparsing==2.4.7
+requests==2.24.0
+    certifi==2020.06.20
+    chardet==3.0.4
+    idna==2.10
+    urllib3==1.25.9
+resolvelib==0.4.0
+retrying==1.3.3
+setuptools==44.0.0
+six==1.15.0
+toml==0.10.1
+webencodings==0.5.1
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__init__.py b/venv/Lib/site-packages/pip/_vendor/webencodings/__init__.py
new file mode 100644
index 000000000..d21d697c8
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/webencodings/__init__.py
@@ -0,0 +1,342 @@
+# coding: utf-8
+"""
+
+    webencodings
+    ~~~~~~~~~~~~
+
+    This is a Python implementation of the `WHATWG Encoding standard
+    <http://encoding.spec.whatwg.org/>`. See README for details.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+from __future__ import unicode_literals
+
+import codecs
+
+from .labels import LABELS
+
+
+VERSION = '0.5.1'
+
+
+# Some names in Encoding are not valid Python aliases. Remap these.
+PYTHON_NAMES = {
+    'iso-8859-8-i': 'iso-8859-8',
+    'x-mac-cyrillic': 'mac-cyrillic',
+    'macintosh': 'mac-roman',
+    'windows-874': 'cp874'}
+
+CACHE = {}
+
+
+def ascii_lower(string):
+    r"""Transform (only) ASCII letters to lower case: A-Z is mapped to a-z.
+
+    :param string: An Unicode string.
+    :returns: A new Unicode string.
+
+    This is used for `ASCII case-insensitive
+    <http://encoding.spec.whatwg.org/#ascii-case-insensitive>`_
+    matching of encoding labels.
+    The same matching is also used, among other things,
+    for `CSS keywords <http://dev.w3.org/csswg/css-values/#keywords>`_.
+
+    This is different from the :meth:`~py:str.lower` method of Unicode strings
+    which also affect non-ASCII characters,
+    sometimes mapping them into the ASCII range:
+
+        >>> keyword = u'Bac\N{KELVIN SIGN}ground'
+        >>> assert keyword.lower() == u'background'
+        >>> assert ascii_lower(keyword) != keyword.lower()
+        >>> assert ascii_lower(keyword) == u'bac\N{KELVIN SIGN}ground'
+
+    """
+    # This turns out to be faster than unicode.translate()
+    return string.encode('utf8').lower().decode('utf8')
+
+
+def lookup(label):
+    """
+    Look for an encoding by its label.
+    This is the spec’s `get an encoding
+    <http://encoding.spec.whatwg.org/#concept-encoding-get>`_ algorithm.
+    Supported labels are listed there.
+
+    :param label: A string.
+    :returns:
+        An :class:`Encoding` object, or :obj:`None` for an unknown label.
+
+    """
+    # Only strip ASCII whitespace: U+0009, U+000A, U+000C, U+000D, and U+0020.
+    label = ascii_lower(label.strip('\t\n\f\r '))
+    name = LABELS.get(label)
+    if name is None:
+        return None
+    encoding = CACHE.get(name)
+    if encoding is None:
+        if name == 'x-user-defined':
+            from .x_user_defined import codec_info
+        else:
+            python_name = PYTHON_NAMES.get(name, name)
+            # Any python_name value that gets to here should be valid.
+            codec_info = codecs.lookup(python_name)
+        encoding = Encoding(name, codec_info)
+        CACHE[name] = encoding
+    return encoding
+
+
+def _get_encoding(encoding_or_label):
+    """
+    Accept either an encoding object or label.
+
+    :param encoding: An :class:`Encoding` object or a label string.
+    :returns: An :class:`Encoding` object.
+    :raises: :exc:`~exceptions.LookupError` for an unknown label.
+
+    """
+    if hasattr(encoding_or_label, 'codec_info'):
+        return encoding_or_label
+
+    encoding = lookup(encoding_or_label)
+    if encoding is None:
+        raise LookupError('Unknown encoding label: %r' % encoding_or_label)
+    return encoding
+
+
+class Encoding(object):
+    """Reresents a character encoding such as UTF-8,
+    that can be used for decoding or encoding.
+
+    .. attribute:: name
+
+        Canonical name of the encoding
+
+    .. attribute:: codec_info
+
+        The actual implementation of the encoding,
+        a stdlib :class:`~codecs.CodecInfo` object.
+        See :func:`codecs.register`.
+
+    """
+    def __init__(self, name, codec_info):
+        self.name = name
+        self.codec_info = codec_info
+
+    def __repr__(self):
+        return '<Encoding %s>' % self.name
+
+
+#: The UTF-8 encoding. Should be used for new content and formats.
+UTF8 = lookup('utf-8')
+
+_UTF16LE = lookup('utf-16le')
+_UTF16BE = lookup('utf-16be')
+
+
+def decode(input, fallback_encoding, errors='replace'):
+    """
+    Decode a single string.
+
+    :param input: A byte string
+    :param fallback_encoding:
+        An :class:`Encoding` object or a label string.
+        The encoding to use if :obj:`input` does note have a BOM.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+    :return:
+        A ``(output, encoding)`` tuple of an Unicode string
+        and an :obj:`Encoding`.
+
+    """
+    # Fail early if `encoding` is an invalid label.
+    fallback_encoding = _get_encoding(fallback_encoding)
+    bom_encoding, input = _detect_bom(input)
+    encoding = bom_encoding or fallback_encoding
+    return encoding.codec_info.decode(input, errors)[0], encoding
+
+
+def _detect_bom(input):
+    """Return (bom_encoding, input), with any BOM removed from the input."""
+    if input.startswith(b'\xFF\xFE'):
+        return _UTF16LE, input[2:]
+    if input.startswith(b'\xFE\xFF'):
+        return _UTF16BE, input[2:]
+    if input.startswith(b'\xEF\xBB\xBF'):
+        return UTF8, input[3:]
+    return None, input
+
+
+def encode(input, encoding=UTF8, errors='strict'):
+    """
+    Encode a single string.
+
+    :param input: An Unicode string.
+    :param encoding: An :class:`Encoding` object or a label string.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+    :return: A byte string.
+
+    """
+    return _get_encoding(encoding).codec_info.encode(input, errors)[0]
+
+
+def iter_decode(input, fallback_encoding, errors='replace'):
+    """
+    "Pull"-based decoder.
+
+    :param input:
+        An iterable of byte strings.
+
+        The input is first consumed just enough to determine the encoding
+        based on the precense of a BOM,
+        then consumed on demand when the return value is.
+    :param fallback_encoding:
+        An :class:`Encoding` object or a label string.
+        The encoding to use if :obj:`input` does note have a BOM.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+    :returns:
+        An ``(output, encoding)`` tuple.
+        :obj:`output` is an iterable of Unicode strings,
+        :obj:`encoding` is the :obj:`Encoding` that is being used.
+
+    """
+
+    decoder = IncrementalDecoder(fallback_encoding, errors)
+    generator = _iter_decode_generator(input, decoder)
+    encoding = next(generator)
+    return generator, encoding
+
+
+def _iter_decode_generator(input, decoder):
+    """Return a generator that first yields the :obj:`Encoding`,
+    then yields output chukns as Unicode strings.
+
+    """
+    decode = decoder.decode
+    input = iter(input)
+    for chunck in input:
+        output = decode(chunck)
+        if output:
+            assert decoder.encoding is not None
+            yield decoder.encoding
+            yield output
+            break
+    else:
+        # Input exhausted without determining the encoding
+        output = decode(b'', final=True)
+        assert decoder.encoding is not None
+        yield decoder.encoding
+        if output:
+            yield output
+        return
+
+    for chunck in input:
+        output = decode(chunck)
+        if output:
+            yield output
+    output = decode(b'', final=True)
+    if output:
+        yield output
+
+
+def iter_encode(input, encoding=UTF8, errors='strict'):
+    """
+    “Pull”-based encoder.
+
+    :param input: An iterable of Unicode strings.
+    :param encoding: An :class:`Encoding` object or a label string.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+    :returns: An iterable of byte strings.
+
+    """
+    # Fail early if `encoding` is an invalid label.
+    encode = IncrementalEncoder(encoding, errors).encode
+    return _iter_encode_generator(input, encode)
+
+
+def _iter_encode_generator(input, encode):
+    for chunck in input:
+        output = encode(chunck)
+        if output:
+            yield output
+    output = encode('', final=True)
+    if output:
+        yield output
+
+
+class IncrementalDecoder(object):
+    """
+    “Push”-based decoder.
+
+    :param fallback_encoding:
+        An :class:`Encoding` object or a label string.
+        The encoding to use if :obj:`input` does note have a BOM.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+
+    """
+    def __init__(self, fallback_encoding, errors='replace'):
+        # Fail early if `encoding` is an invalid label.
+        self._fallback_encoding = _get_encoding(fallback_encoding)
+        self._errors = errors
+        self._buffer = b''
+        self._decoder = None
+        #: The actual :class:`Encoding` that is being used,
+        #: or :obj:`None` if that is not determined yet.
+        #: (Ie. if there is not enough input yet to determine
+        #: if there is a BOM.)
+        self.encoding = None  # Not known yet.
+
+    def decode(self, input, final=False):
+        """Decode one chunk of the input.
+
+        :param input: A byte string.
+        :param final:
+            Indicate that no more input is available.
+            Must be :obj:`True` if this is the last call.
+        :returns: An Unicode string.
+
+        """
+        decoder = self._decoder
+        if decoder is not None:
+            return decoder(input, final)
+
+        input = self._buffer + input
+        encoding, input = _detect_bom(input)
+        if encoding is None:
+            if len(input) < 3 and not final:  # Not enough data yet.
+                self._buffer = input
+                return ''
+            else:  # No BOM
+                encoding = self._fallback_encoding
+        decoder = encoding.codec_info.incrementaldecoder(self._errors).decode
+        self._decoder = decoder
+        self.encoding = encoding
+        return decoder(input, final)
+
+
+class IncrementalEncoder(object):
+    """
+    “Push”-based encoder.
+
+    :param encoding: An :class:`Encoding` object or a label string.
+    :param errors: Type of error handling. See :func:`codecs.register`.
+    :raises: :exc:`~exceptions.LookupError` for an unknown encoding label.
+
+    .. method:: encode(input, final=False)
+
+        :param input: An Unicode string.
+        :param final:
+            Indicate that no more input is available.
+            Must be :obj:`True` if this is the last call.
+        :returns: A byte string.
+
+    """
+    def __init__(self, encoding=UTF8, errors='strict'):
+        encoding = _get_encoding(encoding)
+        self.encode = encoding.codec_info.incrementalencoder(errors).encode
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..6493e18c4
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc
new file mode 100644
index 000000000..bb001604f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/labels.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc
new file mode 100644
index 000000000..c65eeccd1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/mklabels.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc
new file mode 100644
index 000000000..8fb71e5d1
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/tests.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc
new file mode 100644
index 000000000..7bb85dc9f
Binary files /dev/null and b/venv/Lib/site-packages/pip/_vendor/webencodings/__pycache__/x_user_defined.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/labels.py b/venv/Lib/site-packages/pip/_vendor/webencodings/labels.py
new file mode 100644
index 000000000..29cbf91ef
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/webencodings/labels.py
@@ -0,0 +1,231 @@
+"""
+
+    webencodings.labels
+    ~~~~~~~~~~~~~~~~~~~
+
+    Map encoding labels to their name.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+# XXX Do not edit!
+# This file is automatically generated by mklabels.py
+
+LABELS = {
+    'unicode-1-1-utf-8':   'utf-8',
+    'utf-8':               'utf-8',
+    'utf8':                'utf-8',
+    '866':                 'ibm866',
+    'cp866':               'ibm866',
+    'csibm866':            'ibm866',
+    'ibm866':              'ibm866',
+    'csisolatin2':         'iso-8859-2',
+    'iso-8859-2':          'iso-8859-2',
+    'iso-ir-101':          'iso-8859-2',
+    'iso8859-2':           'iso-8859-2',
+    'iso88592':            'iso-8859-2',
+    'iso_8859-2':          'iso-8859-2',
+    'iso_8859-2:1987':     'iso-8859-2',
+    'l2':                  'iso-8859-2',
+    'latin2':              'iso-8859-2',
+    'csisolatin3':         'iso-8859-3',
+    'iso-8859-3':          'iso-8859-3',
+    'iso-ir-109':          'iso-8859-3',
+    'iso8859-3':           'iso-8859-3',
+    'iso88593':            'iso-8859-3',
+    'iso_8859-3':          'iso-8859-3',
+    'iso_8859-3:1988':     'iso-8859-3',
+    'l3':                  'iso-8859-3',
+    'latin3':              'iso-8859-3',
+    'csisolatin4':         'iso-8859-4',
+    'iso-8859-4':          'iso-8859-4',
+    'iso-ir-110':          'iso-8859-4',
+    'iso8859-4':           'iso-8859-4',
+    'iso88594':            'iso-8859-4',
+    'iso_8859-4':          'iso-8859-4',
+    'iso_8859-4:1988':     'iso-8859-4',
+    'l4':                  'iso-8859-4',
+    'latin4':              'iso-8859-4',
+    'csisolatincyrillic':  'iso-8859-5',
+    'cyrillic':            'iso-8859-5',
+    'iso-8859-5':          'iso-8859-5',
+    'iso-ir-144':          'iso-8859-5',
+    'iso8859-5':           'iso-8859-5',
+    'iso88595':            'iso-8859-5',
+    'iso_8859-5':          'iso-8859-5',
+    'iso_8859-5:1988':     'iso-8859-5',
+    'arabic':              'iso-8859-6',
+    'asmo-708':            'iso-8859-6',
+    'csiso88596e':         'iso-8859-6',
+    'csiso88596i':         'iso-8859-6',
+    'csisolatinarabic':    'iso-8859-6',
+    'ecma-114':            'iso-8859-6',
+    'iso-8859-6':          'iso-8859-6',
+    'iso-8859-6-e':        'iso-8859-6',
+    'iso-8859-6-i':        'iso-8859-6',
+    'iso-ir-127':          'iso-8859-6',
+    'iso8859-6':           'iso-8859-6',
+    'iso88596':            'iso-8859-6',
+    'iso_8859-6':          'iso-8859-6',
+    'iso_8859-6:1987':     'iso-8859-6',
+    'csisolatingreek':     'iso-8859-7',
+    'ecma-118':            'iso-8859-7',
+    'elot_928':            'iso-8859-7',
+    'greek':               'iso-8859-7',
+    'greek8':              'iso-8859-7',
+    'iso-8859-7':          'iso-8859-7',
+    'iso-ir-126':          'iso-8859-7',
+    'iso8859-7':           'iso-8859-7',
+    'iso88597':            'iso-8859-7',
+    'iso_8859-7':          'iso-8859-7',
+    'iso_8859-7:1987':     'iso-8859-7',
+    'sun_eu_greek':        'iso-8859-7',
+    'csiso88598e':         'iso-8859-8',
+    'csisolatinhebrew':    'iso-8859-8',
+    'hebrew':              'iso-8859-8',
+    'iso-8859-8':          'iso-8859-8',
+    'iso-8859-8-e':        'iso-8859-8',
+    'iso-ir-138':          'iso-8859-8',
+    'iso8859-8':           'iso-8859-8',
+    'iso88598':            'iso-8859-8',
+    'iso_8859-8':          'iso-8859-8',
+    'iso_8859-8:1988':     'iso-8859-8',
+    'visual':              'iso-8859-8',
+    'csiso88598i':         'iso-8859-8-i',
+    'iso-8859-8-i':        'iso-8859-8-i',
+    'logical':             'iso-8859-8-i',
+    'csisolatin6':         'iso-8859-10',
+    'iso-8859-10':         'iso-8859-10',
+    'iso-ir-157':          'iso-8859-10',
+    'iso8859-10':          'iso-8859-10',
+    'iso885910':           'iso-8859-10',
+    'l6':                  'iso-8859-10',
+    'latin6':              'iso-8859-10',
+    'iso-8859-13':         'iso-8859-13',
+    'iso8859-13':          'iso-8859-13',
+    'iso885913':           'iso-8859-13',
+    'iso-8859-14':         'iso-8859-14',
+    'iso8859-14':          'iso-8859-14',
+    'iso885914':           'iso-8859-14',
+    'csisolatin9':         'iso-8859-15',
+    'iso-8859-15':         'iso-8859-15',
+    'iso8859-15':          'iso-8859-15',
+    'iso885915':           'iso-8859-15',
+    'iso_8859-15':         'iso-8859-15',
+    'l9':                  'iso-8859-15',
+    'iso-8859-16':         'iso-8859-16',
+    'cskoi8r':             'koi8-r',
+    'koi':                 'koi8-r',
+    'koi8':                'koi8-r',
+    'koi8-r':              'koi8-r',
+    'koi8_r':              'koi8-r',
+    'koi8-u':              'koi8-u',
+    'csmacintosh':         'macintosh',
+    'mac':                 'macintosh',
+    'macintosh':           'macintosh',
+    'x-mac-roman':         'macintosh',
+    'dos-874':             'windows-874',
+    'iso-8859-11':         'windows-874',
+    'iso8859-11':          'windows-874',
+    'iso885911':           'windows-874',
+    'tis-620':             'windows-874',
+    'windows-874':         'windows-874',
+    'cp1250':              'windows-1250',
+    'windows-1250':        'windows-1250',
+    'x-cp1250':            'windows-1250',
+    'cp1251':              'windows-1251',
+    'windows-1251':        'windows-1251',
+    'x-cp1251':            'windows-1251',
+    'ansi_x3.4-1968':      'windows-1252',
+    'ascii':               'windows-1252',
+    'cp1252':              'windows-1252',
+    'cp819':               'windows-1252',
+    'csisolatin1':         'windows-1252',
+    'ibm819':              'windows-1252',
+    'iso-8859-1':          'windows-1252',
+    'iso-ir-100':          'windows-1252',
+    'iso8859-1':           'windows-1252',
+    'iso88591':            'windows-1252',
+    'iso_8859-1':          'windows-1252',
+    'iso_8859-1:1987':     'windows-1252',
+    'l1':                  'windows-1252',
+    'latin1':              'windows-1252',
+    'us-ascii':            'windows-1252',
+    'windows-1252':        'windows-1252',
+    'x-cp1252':            'windows-1252',
+    'cp1253':              'windows-1253',
+    'windows-1253':        'windows-1253',
+    'x-cp1253':            'windows-1253',
+    'cp1254':              'windows-1254',
+    'csisolatin5':         'windows-1254',
+    'iso-8859-9':          'windows-1254',
+    'iso-ir-148':          'windows-1254',
+    'iso8859-9':           'windows-1254',
+    'iso88599':            'windows-1254',
+    'iso_8859-9':          'windows-1254',
+    'iso_8859-9:1989':     'windows-1254',
+    'l5':                  'windows-1254',
+    'latin5':              'windows-1254',
+    'windows-1254':        'windows-1254',
+    'x-cp1254':            'windows-1254',
+    'cp1255':              'windows-1255',
+    'windows-1255':        'windows-1255',
+    'x-cp1255':            'windows-1255',
+    'cp1256':              'windows-1256',
+    'windows-1256':        'windows-1256',
+    'x-cp1256':            'windows-1256',
+    'cp1257':              'windows-1257',
+    'windows-1257':        'windows-1257',
+    'x-cp1257':            'windows-1257',
+    'cp1258':              'windows-1258',
+    'windows-1258':        'windows-1258',
+    'x-cp1258':            'windows-1258',
+    'x-mac-cyrillic':      'x-mac-cyrillic',
+    'x-mac-ukrainian':     'x-mac-cyrillic',
+    'chinese':             'gbk',
+    'csgb2312':            'gbk',
+    'csiso58gb231280':     'gbk',
+    'gb2312':              'gbk',
+    'gb_2312':             'gbk',
+    'gb_2312-80':          'gbk',
+    'gbk':                 'gbk',
+    'iso-ir-58':           'gbk',
+    'x-gbk':               'gbk',
+    'gb18030':             'gb18030',
+    'hz-gb-2312':          'hz-gb-2312',
+    'big5':                'big5',
+    'big5-hkscs':          'big5',
+    'cn-big5':             'big5',
+    'csbig5':              'big5',
+    'x-x-big5':            'big5',
+    'cseucpkdfmtjapanese': 'euc-jp',
+    'euc-jp':              'euc-jp',
+    'x-euc-jp':            'euc-jp',
+    'csiso2022jp':         'iso-2022-jp',
+    'iso-2022-jp':         'iso-2022-jp',
+    'csshiftjis':          'shift_jis',
+    'ms_kanji':            'shift_jis',
+    'shift-jis':           'shift_jis',
+    'shift_jis':           'shift_jis',
+    'sjis':                'shift_jis',
+    'windows-31j':         'shift_jis',
+    'x-sjis':              'shift_jis',
+    'cseuckr':             'euc-kr',
+    'csksc56011987':       'euc-kr',
+    'euc-kr':              'euc-kr',
+    'iso-ir-149':          'euc-kr',
+    'korean':              'euc-kr',
+    'ks_c_5601-1987':      'euc-kr',
+    'ks_c_5601-1989':      'euc-kr',
+    'ksc5601':             'euc-kr',
+    'ksc_5601':            'euc-kr',
+    'windows-949':         'euc-kr',
+    'csiso2022kr':         'iso-2022-kr',
+    'iso-2022-kr':         'iso-2022-kr',
+    'utf-16be':            'utf-16be',
+    'utf-16':              'utf-16le',
+    'utf-16le':            'utf-16le',
+    'x-user-defined':      'x-user-defined',
+}
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/mklabels.py b/venv/Lib/site-packages/pip/_vendor/webencodings/mklabels.py
new file mode 100644
index 000000000..295dc928b
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/webencodings/mklabels.py
@@ -0,0 +1,59 @@
+"""
+
+    webencodings.mklabels
+    ~~~~~~~~~~~~~~~~~~~~~
+
+    Regenarate the webencodings.labels module.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+import json
+try:
+    from urllib import urlopen
+except ImportError:
+    from urllib.request import urlopen
+
+
+def assert_lower(string):
+    assert string == string.lower()
+    return string
+
+
+def generate(url):
+    parts = ['''\
+"""
+
+    webencodings.labels
+    ~~~~~~~~~~~~~~~~~~~
+
+    Map encoding labels to their name.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+# XXX Do not edit!
+# This file is automatically generated by mklabels.py
+
+LABELS = {
+''']
+    labels = [
+        (repr(assert_lower(label)).lstrip('u'),
+         repr(encoding['name']).lstrip('u'))
+        for category in json.loads(urlopen(url).read().decode('ascii'))
+        for encoding in category['encodings']
+        for label in encoding['labels']]
+    max_len = max(len(label) for label, name in labels)
+    parts.extend(
+        '    %s:%s %s,\n' % (label, ' ' * (max_len - len(label)), name)
+        for label, name in labels)
+    parts.append('}')
+    return ''.join(parts)
+
+
+if __name__ == '__main__':
+    print(generate('http://encoding.spec.whatwg.org/encodings.json'))
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/tests.py b/venv/Lib/site-packages/pip/_vendor/webencodings/tests.py
new file mode 100644
index 000000000..e12c10d03
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/webencodings/tests.py
@@ -0,0 +1,153 @@
+# coding: utf-8
+"""
+
+    webencodings.tests
+    ~~~~~~~~~~~~~~~~~~
+
+    A basic test suite for Encoding.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+from __future__ import unicode_literals
+
+from . import (lookup, LABELS, decode, encode, iter_decode, iter_encode,
+               IncrementalDecoder, IncrementalEncoder, UTF8)
+
+
+def assert_raises(exception, function, *args, **kwargs):
+    try:
+        function(*args, **kwargs)
+    except exception:
+        return
+    else:  # pragma: no cover
+        raise AssertionError('Did not raise %s.' % exception)
+
+
+def test_labels():
+    assert lookup('utf-8').name == 'utf-8'
+    assert lookup('Utf-8').name == 'utf-8'
+    assert lookup('UTF-8').name == 'utf-8'
+    assert lookup('utf8').name == 'utf-8'
+    assert lookup('utf8').name == 'utf-8'
+    assert lookup('utf8 ').name == 'utf-8'
+    assert lookup(' \r\nutf8\t').name == 'utf-8'
+    assert lookup('u8') is None  # Python label.
+    assert lookup('utf-8 ') is None  # Non-ASCII white space.
+
+    assert lookup('US-ASCII').name == 'windows-1252'
+    assert lookup('iso-8859-1').name == 'windows-1252'
+    assert lookup('latin1').name == 'windows-1252'
+    assert lookup('LATIN1').name == 'windows-1252'
+    assert lookup('latin-1') is None
+    assert lookup('LATİN1') is None  # ASCII-only case insensitivity.
+
+
+def test_all_labels():
+    for label in LABELS:
+        assert decode(b'', label) == ('', lookup(label))
+        assert encode('', label) == b''
+        for repeat in [0, 1, 12]:
+            output, _ = iter_decode([b''] * repeat, label)
+            assert list(output) == []
+            assert list(iter_encode([''] * repeat, label)) == []
+        decoder = IncrementalDecoder(label)
+        assert decoder.decode(b'') == ''
+        assert decoder.decode(b'', final=True) == ''
+        encoder = IncrementalEncoder(label)
+        assert encoder.encode('') == b''
+        assert encoder.encode('', final=True) == b''
+    # All encoding names are valid labels too:
+    for name in set(LABELS.values()):
+        assert lookup(name).name == name
+
+
+def test_invalid_label():
+    assert_raises(LookupError, decode, b'\xEF\xBB\xBF\xc3\xa9', 'invalid')
+    assert_raises(LookupError, encode, 'é', 'invalid')
+    assert_raises(LookupError, iter_decode, [], 'invalid')
+    assert_raises(LookupError, iter_encode, [], 'invalid')
+    assert_raises(LookupError, IncrementalDecoder, 'invalid')
+    assert_raises(LookupError, IncrementalEncoder, 'invalid')
+
+
+def test_decode():
+    assert decode(b'\x80', 'latin1') == ('€', lookup('latin1'))
+    assert decode(b'\x80', lookup('latin1')) == ('€', lookup('latin1'))
+    assert decode(b'\xc3\xa9', 'utf8') == ('é', lookup('utf8'))
+    assert decode(b'\xc3\xa9', UTF8) == ('é', lookup('utf8'))
+    assert decode(b'\xc3\xa9', 'ascii') == ('é', lookup('ascii'))
+    assert decode(b'\xEF\xBB\xBF\xc3\xa9', 'ascii') == ('é', lookup('utf8'))  # UTF-8 with BOM
+
+    assert decode(b'\xFE\xFF\x00\xe9', 'ascii') == ('é', lookup('utf-16be'))  # UTF-16-BE with BOM
+    assert decode(b'\xFF\xFE\xe9\x00', 'ascii') == ('é', lookup('utf-16le'))  # UTF-16-LE with BOM
+    assert decode(b'\xFE\xFF\xe9\x00', 'ascii') == ('\ue900', lookup('utf-16be'))
+    assert decode(b'\xFF\xFE\x00\xe9', 'ascii') == ('\ue900', lookup('utf-16le'))
+
+    assert decode(b'\x00\xe9', 'UTF-16BE') == ('é', lookup('utf-16be'))
+    assert decode(b'\xe9\x00', 'UTF-16LE') == ('é', lookup('utf-16le'))
+    assert decode(b'\xe9\x00', 'UTF-16') == ('é', lookup('utf-16le'))
+
+    assert decode(b'\xe9\x00', 'UTF-16BE') == ('\ue900', lookup('utf-16be'))
+    assert decode(b'\x00\xe9', 'UTF-16LE') == ('\ue900', lookup('utf-16le'))
+    assert decode(b'\x00\xe9', 'UTF-16') == ('\ue900', lookup('utf-16le'))
+
+
+def test_encode():
+    assert encode('é', 'latin1') == b'\xe9'
+    assert encode('é', 'utf8') == b'\xc3\xa9'
+    assert encode('é', 'utf8') == b'\xc3\xa9'
+    assert encode('é', 'utf-16') == b'\xe9\x00'
+    assert encode('é', 'utf-16le') == b'\xe9\x00'
+    assert encode('é', 'utf-16be') == b'\x00\xe9'
+
+
+def test_iter_decode():
+    def iter_decode_to_string(input, fallback_encoding):
+        output, _encoding = iter_decode(input, fallback_encoding)
+        return ''.join(output)
+    assert iter_decode_to_string([], 'latin1') == ''
+    assert iter_decode_to_string([b''], 'latin1') == ''
+    assert iter_decode_to_string([b'\xe9'], 'latin1') == 'é'
+    assert iter_decode_to_string([b'hello'], 'latin1') == 'hello'
+    assert iter_decode_to_string([b'he', b'llo'], 'latin1') == 'hello'
+    assert iter_decode_to_string([b'hell', b'o'], 'latin1') == 'hello'
+    assert iter_decode_to_string([b'\xc3\xa9'], 'latin1') == 'é'
+    assert iter_decode_to_string([b'\xEF\xBB\xBF\xc3\xa9'], 'latin1') == 'é'
+    assert iter_decode_to_string([
+        b'\xEF\xBB\xBF', b'\xc3', b'\xa9'], 'latin1') == 'é'
+    assert iter_decode_to_string([
+        b'\xEF\xBB\xBF', b'a', b'\xc3'], 'latin1') == 'a\uFFFD'
+    assert iter_decode_to_string([
+        b'', b'\xEF', b'', b'', b'\xBB\xBF\xc3', b'\xa9'], 'latin1') == 'é'
+    assert iter_decode_to_string([b'\xEF\xBB\xBF'], 'latin1') == ''
+    assert iter_decode_to_string([b'\xEF\xBB'], 'latin1') == 'ï»'
+    assert iter_decode_to_string([b'\xFE\xFF\x00\xe9'], 'latin1') == 'é'
+    assert iter_decode_to_string([b'\xFF\xFE\xe9\x00'], 'latin1') == 'é'
+    assert iter_decode_to_string([
+        b'', b'\xFF', b'', b'', b'\xFE\xe9', b'\x00'], 'latin1') == 'é'
+    assert iter_decode_to_string([
+        b'', b'h\xe9', b'llo'], 'x-user-defined') == 'h\uF7E9llo'
+
+
+def test_iter_encode():
+    assert b''.join(iter_encode([], 'latin1')) == b''
+    assert b''.join(iter_encode([''], 'latin1')) == b''
+    assert b''.join(iter_encode(['é'], 'latin1')) == b'\xe9'
+    assert b''.join(iter_encode(['', 'é', '', ''], 'latin1')) == b'\xe9'
+    assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16')) == b'\xe9\x00'
+    assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16le')) == b'\xe9\x00'
+    assert b''.join(iter_encode(['', 'é', '', ''], 'utf-16be')) == b'\x00\xe9'
+    assert b''.join(iter_encode([
+        '', 'h\uF7E9', '', 'llo'], 'x-user-defined')) == b'h\xe9llo'
+
+
+def test_x_user_defined():
+    encoded = b'2,\x0c\x0b\x1aO\xd9#\xcb\x0f\xc9\xbbt\xcf\xa8\xca'
+    decoded = '2,\x0c\x0b\x1aO\uf7d9#\uf7cb\x0f\uf7c9\uf7bbt\uf7cf\uf7a8\uf7ca'
+    encoded = b'aa'
+    decoded = 'aa'
+    assert decode(encoded, 'x-user-defined') == (decoded, lookup('x-user-defined'))
+    assert encode(decoded, 'x-user-defined') == encoded
diff --git a/venv/Lib/site-packages/pip/_vendor/webencodings/x_user_defined.py b/venv/Lib/site-packages/pip/_vendor/webencodings/x_user_defined.py
new file mode 100644
index 000000000..d16e32602
--- /dev/null
+++ b/venv/Lib/site-packages/pip/_vendor/webencodings/x_user_defined.py
@@ -0,0 +1,325 @@
+# coding: utf-8
+"""
+
+    webencodings.x_user_defined
+    ~~~~~~~~~~~~~~~~~~~~~~~~~~~
+
+    An implementation of the x-user-defined encoding.
+
+    :copyright: Copyright 2012 by Simon Sapin
+    :license: BSD, see LICENSE for details.
+
+"""
+
+from __future__ import unicode_literals
+
+import codecs
+
+
+### Codec APIs
+
+class Codec(codecs.Codec):
+
+    def encode(self, input, errors='strict'):
+        return codecs.charmap_encode(input, errors, encoding_table)
+
+    def decode(self, input, errors='strict'):
+        return codecs.charmap_decode(input, errors, decoding_table)
+
+
+class IncrementalEncoder(codecs.IncrementalEncoder):
+    def encode(self, input, final=False):
+        return codecs.charmap_encode(input, self.errors, encoding_table)[0]
+
+
+class IncrementalDecoder(codecs.IncrementalDecoder):
+    def decode(self, input, final=False):
+        return codecs.charmap_decode(input, self.errors, decoding_table)[0]
+
+
+class StreamWriter(Codec, codecs.StreamWriter):
+    pass
+
+
+class StreamReader(Codec, codecs.StreamReader):
+    pass
+
+
+### encodings module API
+
+codec_info = codecs.CodecInfo(
+    name='x-user-defined',
+    encode=Codec().encode,
+    decode=Codec().decode,
+    incrementalencoder=IncrementalEncoder,
+    incrementaldecoder=IncrementalDecoder,
+    streamreader=StreamReader,
+    streamwriter=StreamWriter,
+)
+
+
+### Decoding Table
+
+# Python 3:
+# for c in range(256): print('    %r' % chr(c if c < 128 else c + 0xF700))
+decoding_table = (
+    '\x00'
+    '\x01'
+    '\x02'
+    '\x03'
+    '\x04'
+    '\x05'
+    '\x06'
+    '\x07'
+    '\x08'
+    '\t'
+    '\n'
+    '\x0b'
+    '\x0c'
+    '\r'
+    '\x0e'
+    '\x0f'
+    '\x10'
+    '\x11'
+    '\x12'
+    '\x13'
+    '\x14'
+    '\x15'
+    '\x16'
+    '\x17'
+    '\x18'
+    '\x19'
+    '\x1a'
+    '\x1b'
+    '\x1c'
+    '\x1d'
+    '\x1e'
+    '\x1f'
+    ' '
+    '!'
+    '"'
+    '#'
+    '$'
+    '%'
+    '&'
+    "'"
+    '('
+    ')'
+    '*'
+    '+'
+    ','
+    '-'
+    '.'
+    '/'
+    '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'
+    'd'
+    'e'
+    'f'
+    'g'
+    'h'
+    'i'
+    'j'
+    'k'
+    'l'
+    'm'
+    'n'
+    'o'
+    'p'
+    'q'
+    'r'
+    's'
+    't'
+    'u'
+    'v'
+    'w'
+    'x'
+    'y'
+    'z'
+    '{'
+    '|'
+    '}'
+    '~'
+    '\x7f'
+    '\uf780'
+    '\uf781'
+    '\uf782'
+    '\uf783'
+    '\uf784'
+    '\uf785'
+    '\uf786'
+    '\uf787'
+    '\uf788'
+    '\uf789'
+    '\uf78a'
+    '\uf78b'
+    '\uf78c'
+    '\uf78d'
+    '\uf78e'
+    '\uf78f'
+    '\uf790'
+    '\uf791'
+    '\uf792'
+    '\uf793'
+    '\uf794'
+    '\uf795'
+    '\uf796'
+    '\uf797'
+    '\uf798'
+    '\uf799'
+    '\uf79a'
+    '\uf79b'
+    '\uf79c'
+    '\uf79d'
+    '\uf79e'
+    '\uf79f'
+    '\uf7a0'
+    '\uf7a1'
+    '\uf7a2'
+    '\uf7a3'
+    '\uf7a4'
+    '\uf7a5'
+    '\uf7a6'
+    '\uf7a7'
+    '\uf7a8'
+    '\uf7a9'
+    '\uf7aa'
+    '\uf7ab'
+    '\uf7ac'
+    '\uf7ad'
+    '\uf7ae'
+    '\uf7af'
+    '\uf7b0'
+    '\uf7b1'
+    '\uf7b2'
+    '\uf7b3'
+    '\uf7b4'
+    '\uf7b5'
+    '\uf7b6'
+    '\uf7b7'
+    '\uf7b8'
+    '\uf7b9'
+    '\uf7ba'
+    '\uf7bb'
+    '\uf7bc'
+    '\uf7bd'
+    '\uf7be'
+    '\uf7bf'
+    '\uf7c0'
+    '\uf7c1'
+    '\uf7c2'
+    '\uf7c3'
+    '\uf7c4'
+    '\uf7c5'
+    '\uf7c6'
+    '\uf7c7'
+    '\uf7c8'
+    '\uf7c9'
+    '\uf7ca'
+    '\uf7cb'
+    '\uf7cc'
+    '\uf7cd'
+    '\uf7ce'
+    '\uf7cf'
+    '\uf7d0'
+    '\uf7d1'
+    '\uf7d2'
+    '\uf7d3'
+    '\uf7d4'
+    '\uf7d5'
+    '\uf7d6'
+    '\uf7d7'
+    '\uf7d8'
+    '\uf7d9'
+    '\uf7da'
+    '\uf7db'
+    '\uf7dc'
+    '\uf7dd'
+    '\uf7de'
+    '\uf7df'
+    '\uf7e0'
+    '\uf7e1'
+    '\uf7e2'
+    '\uf7e3'
+    '\uf7e4'
+    '\uf7e5'
+    '\uf7e6'
+    '\uf7e7'
+    '\uf7e8'
+    '\uf7e9'
+    '\uf7ea'
+    '\uf7eb'
+    '\uf7ec'
+    '\uf7ed'
+    '\uf7ee'
+    '\uf7ef'
+    '\uf7f0'
+    '\uf7f1'
+    '\uf7f2'
+    '\uf7f3'
+    '\uf7f4'
+    '\uf7f5'
+    '\uf7f6'
+    '\uf7f7'
+    '\uf7f8'
+    '\uf7f9'
+    '\uf7fa'
+    '\uf7fb'
+    '\uf7fc'
+    '\uf7fd'
+    '\uf7fe'
+    '\uf7ff'
+)
+
+### Encoding table
+encoding_table = codecs.charmap_build(decoding_table)
diff --git a/venv/Lib/site-packages/pkg_resources/__init__.py b/venv/Lib/site-packages/pkg_resources/__init__.py
new file mode 100644
index 000000000..737f4d5fa
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/__init__.py
@@ -0,0 +1,3284 @@
+"""
+Package resource API
+--------------------
+
+A resource is a logical file contained within a package, or a logical
+subdirectory thereof.  The package resource API expects resource names
+to have their path parts separated with ``/``, *not* whatever the local
+path separator is.  Do not use os.path operations to manipulate resource
+names being passed into the API.
+
+The package resource API is designed to work with normal filesystem packages,
+.egg files, and unpacked .egg files.  It can also work in a limited way with
+.zip files and with custom PEP 302 loaders that support the ``get_data()``
+method.
+"""
+
+import sys
+import os
+import io
+import time
+import re
+import types
+import zipfile
+import zipimport
+import warnings
+import stat
+import functools
+import pkgutil
+import operator
+import platform
+import collections
+import plistlib
+import email.parser
+import errno
+import tempfile
+import textwrap
+import itertools
+import inspect
+import ntpath
+import posixpath
+from pkgutil import get_importer
+
+try:
+    import _imp
+except ImportError:
+    # Python 3.2 compatibility
+    import imp as _imp
+
+try:
+    FileExistsError
+except NameError:
+    FileExistsError = OSError
+
+# capture these to bypass sandboxing
+from os import utime
+try:
+    from os import mkdir, rename, unlink
+    WRITE_SUPPORT = True
+except ImportError:
+    # no write support, probably under GAE
+    WRITE_SUPPORT = False
+
+from os import open as os_open
+from os.path import isdir, split
+
+try:
+    import importlib.machinery as importlib_machinery
+    # access attribute to force import under delayed import mechanisms.
+    importlib_machinery.__name__
+except ImportError:
+    importlib_machinery = None
+
+from pkg_resources.extern import appdirs
+from pkg_resources.extern import packaging
+__import__('pkg_resources.extern.packaging.version')
+__import__('pkg_resources.extern.packaging.specifiers')
+__import__('pkg_resources.extern.packaging.requirements')
+__import__('pkg_resources.extern.packaging.markers')
+
+if sys.version_info < (3, 5):
+    raise RuntimeError("Python 3.5 or later is required")
+
+# declare some globals that will be defined later to
+# satisfy the linters.
+require = None
+working_set = None
+add_activation_listener = None
+resources_stream = None
+cleanup_resources = None
+resource_dir = None
+resource_stream = None
+set_extraction_path = None
+resource_isdir = None
+resource_string = None
+iter_entry_points = None
+resource_listdir = None
+resource_filename = None
+resource_exists = None
+_distribution_finders = None
+_namespace_handlers = None
+_namespace_packages = None
+
+
+class PEP440Warning(RuntimeWarning):
+    """
+    Used when there is an issue with a version or specifier not complying with
+    PEP 440.
+    """
+
+
+def parse_version(v):
+    try:
+        return packaging.version.Version(v)
+    except packaging.version.InvalidVersion:
+        return packaging.version.LegacyVersion(v)
+
+
+_state_vars = {}
+
+
+def _declare_state(vartype, **kw):
+    globals().update(kw)
+    _state_vars.update(dict.fromkeys(kw, vartype))
+
+
+def __getstate__():
+    state = {}
+    g = globals()
+    for k, v in _state_vars.items():
+        state[k] = g['_sget_' + v](g[k])
+    return state
+
+
+def __setstate__(state):
+    g = globals()
+    for k, v in state.items():
+        g['_sset_' + _state_vars[k]](k, g[k], v)
+    return state
+
+
+def _sget_dict(val):
+    return val.copy()
+
+
+def _sset_dict(key, ob, state):
+    ob.clear()
+    ob.update(state)
+
+
+def _sget_object(val):
+    return val.__getstate__()
+
+
+def _sset_object(key, ob, state):
+    ob.__setstate__(state)
+
+
+_sget_none = _sset_none = lambda *args: None
+
+
+def get_supported_platform():
+    """Return this platform's maximum compatible version.
+
+    distutils.util.get_platform() normally reports the minimum version
+    of macOS that would be required to *use* extensions produced by
+    distutils.  But what we want when checking compatibility is to know the
+    version of macOS that we are *running*.  To allow usage of packages that
+    explicitly require a newer version of macOS, we must also know the
+    current version of the OS.
+
+    If this condition occurs for any other platform with a version in its
+    platform strings, this function should be extended accordingly.
+    """
+    plat = get_build_platform()
+    m = macosVersionString.match(plat)
+    if m is not None and sys.platform == "darwin":
+        try:
+            plat = 'macosx-%s-%s' % ('.'.join(_macos_vers()[:2]), m.group(3))
+        except ValueError:
+            # not macOS
+            pass
+    return plat
+
+
+__all__ = [
+    # Basic resource access and distribution/entry point discovery
+    'require', 'run_script', 'get_provider', 'get_distribution',
+    'load_entry_point', 'get_entry_map', 'get_entry_info',
+    'iter_entry_points',
+    'resource_string', 'resource_stream', 'resource_filename',
+    'resource_listdir', 'resource_exists', 'resource_isdir',
+
+    # Environmental control
+    'declare_namespace', 'working_set', 'add_activation_listener',
+    'find_distributions', 'set_extraction_path', 'cleanup_resources',
+    'get_default_cache',
+
+    # Primary implementation classes
+    'Environment', 'WorkingSet', 'ResourceManager',
+    'Distribution', 'Requirement', 'EntryPoint',
+
+    # Exceptions
+    'ResolutionError', 'VersionConflict', 'DistributionNotFound',
+    'UnknownExtra', 'ExtractionError',
+
+    # Warnings
+    'PEP440Warning',
+
+    # Parsing functions and string utilities
+    'parse_requirements', 'parse_version', 'safe_name', 'safe_version',
+    'get_platform', 'compatible_platforms', 'yield_lines', 'split_sections',
+    'safe_extra', 'to_filename', 'invalid_marker', 'evaluate_marker',
+
+    # filesystem utilities
+    'ensure_directory', 'normalize_path',
+
+    # Distribution "precedence" constants
+    'EGG_DIST', 'BINARY_DIST', 'SOURCE_DIST', 'CHECKOUT_DIST', 'DEVELOP_DIST',
+
+    # "Provider" interfaces, implementations, and registration/lookup APIs
+    'IMetadataProvider', 'IResourceProvider', 'FileMetadata',
+    'PathMetadata', 'EggMetadata', 'EmptyProvider', 'empty_provider',
+    'NullProvider', 'EggProvider', 'DefaultProvider', 'ZipProvider',
+    'register_finder', 'register_namespace_handler', 'register_loader_type',
+    'fixup_namespace_packages', 'get_importer',
+
+    # Warnings
+    'PkgResourcesDeprecationWarning',
+
+    # Deprecated/backward compatibility only
+    'run_main', 'AvailableDistributions',
+]
+
+
+class ResolutionError(Exception):
+    """Abstract base for dependency resolution errors"""
+
+    def __repr__(self):
+        return self.__class__.__name__ + repr(self.args)
+
+
+class VersionConflict(ResolutionError):
+    """
+    An already-installed version conflicts with the requested version.
+
+    Should be initialized with the installed Distribution and the requested
+    Requirement.
+    """
+
+    _template = "{self.dist} is installed but {self.req} is required"
+
+    @property
+    def dist(self):
+        return self.args[0]
+
+    @property
+    def req(self):
+        return self.args[1]
+
+    def report(self):
+        return self._template.format(**locals())
+
+    def with_context(self, required_by):
+        """
+        If required_by is non-empty, return a version of self that is a
+        ContextualVersionConflict.
+        """
+        if not required_by:
+            return self
+        args = self.args + (required_by,)
+        return ContextualVersionConflict(*args)
+
+
+class ContextualVersionConflict(VersionConflict):
+    """
+    A VersionConflict that accepts a third parameter, the set of the
+    requirements that required the installed Distribution.
+    """
+
+    _template = VersionConflict._template + ' by {self.required_by}'
+
+    @property
+    def required_by(self):
+        return self.args[2]
+
+
+class DistributionNotFound(ResolutionError):
+    """A requested distribution was not found"""
+
+    _template = ("The '{self.req}' distribution was not found "
+                 "and is required by {self.requirers_str}")
+
+    @property
+    def req(self):
+        return self.args[0]
+
+    @property
+    def requirers(self):
+        return self.args[1]
+
+    @property
+    def requirers_str(self):
+        if not self.requirers:
+            return 'the application'
+        return ', '.join(self.requirers)
+
+    def report(self):
+        return self._template.format(**locals())
+
+    def __str__(self):
+        return self.report()
+
+
+class UnknownExtra(ResolutionError):
+    """Distribution doesn't have an "extra feature" of the given name"""
+
+
+_provider_factories = {}
+
+PY_MAJOR = '{}.{}'.format(*sys.version_info)
+EGG_DIST = 3
+BINARY_DIST = 2
+SOURCE_DIST = 1
+CHECKOUT_DIST = 0
+DEVELOP_DIST = -1
+
+
+def register_loader_type(loader_type, provider_factory):
+    """Register `provider_factory` to make providers for `loader_type`
+
+    `loader_type` is the type or class of a PEP 302 ``module.__loader__``,
+    and `provider_factory` is a function that, passed a *module* object,
+    returns an ``IResourceProvider`` for that module.
+    """
+    _provider_factories[loader_type] = provider_factory
+
+
+def get_provider(moduleOrReq):
+    """Return an IResourceProvider for the named module or requirement"""
+    if isinstance(moduleOrReq, Requirement):
+        return working_set.find(moduleOrReq) or require(str(moduleOrReq))[0]
+    try:
+        module = sys.modules[moduleOrReq]
+    except KeyError:
+        __import__(moduleOrReq)
+        module = sys.modules[moduleOrReq]
+    loader = getattr(module, '__loader__', None)
+    return _find_adapter(_provider_factories, loader)(module)
+
+
+def _macos_vers(_cache=[]):
+    if not _cache:
+        version = platform.mac_ver()[0]
+        # fallback for MacPorts
+        if version == '':
+            plist = '/System/Library/CoreServices/SystemVersion.plist'
+            if os.path.exists(plist):
+                if hasattr(plistlib, 'readPlist'):
+                    plist_content = plistlib.readPlist(plist)
+                    if 'ProductVersion' in plist_content:
+                        version = plist_content['ProductVersion']
+
+        _cache.append(version.split('.'))
+    return _cache[0]
+
+
+def _macos_arch(machine):
+    return {'PowerPC': 'ppc', 'Power_Macintosh': 'ppc'}.get(machine, machine)
+
+
+def get_build_platform():
+    """Return this platform's string for platform-specific distributions
+
+    XXX Currently this is the same as ``distutils.util.get_platform()``, but it
+    needs some hacks for Linux and macOS.
+    """
+    from sysconfig import get_platform
+
+    plat = get_platform()
+    if sys.platform == "darwin" and not plat.startswith('macosx-'):
+        try:
+            version = _macos_vers()
+            machine = os.uname()[4].replace(" ", "_")
+            return "macosx-%d.%d-%s" % (
+                int(version[0]), int(version[1]),
+                _macos_arch(machine),
+            )
+        except ValueError:
+            # if someone is running a non-Mac darwin system, this will fall
+            # through to the default implementation
+            pass
+    return plat
+
+
+macosVersionString = re.compile(r"macosx-(\d+)\.(\d+)-(.*)")
+darwinVersionString = re.compile(r"darwin-(\d+)\.(\d+)\.(\d+)-(.*)")
+# XXX backward compat
+get_platform = get_build_platform
+
+
+def compatible_platforms(provided, required):
+    """Can code for the `provided` platform run on the `required` platform?
+
+    Returns true if either platform is ``None``, or the platforms are equal.
+
+    XXX Needs compatibility checks for Linux and other unixy OSes.
+    """
+    if provided is None or required is None or provided == required:
+        # easy case
+        return True
+
+    # macOS special cases
+    reqMac = macosVersionString.match(required)
+    if reqMac:
+        provMac = macosVersionString.match(provided)
+
+        # is this a Mac package?
+        if not provMac:
+            # this is backwards compatibility for packages built before
+            # setuptools 0.6. All packages built after this point will
+            # use the new macOS designation.
+            provDarwin = darwinVersionString.match(provided)
+            if provDarwin:
+                dversion = int(provDarwin.group(1))
+                macosversion = "%s.%s" % (reqMac.group(1), reqMac.group(2))
+                if dversion == 7 and macosversion >= "10.3" or \
+                        dversion == 8 and macosversion >= "10.4":
+                    return True
+            # egg isn't macOS or legacy darwin
+            return False
+
+        # are they the same major version and machine type?
+        if provMac.group(1) != reqMac.group(1) or \
+                provMac.group(3) != reqMac.group(3):
+            return False
+
+        # is the required OS major update >= the provided one?
+        if int(provMac.group(2)) > int(reqMac.group(2)):
+            return False
+
+        return True
+
+    # XXX Linux and other platforms' special cases should go here
+    return False
+
+
+def run_script(dist_spec, script_name):
+    """Locate distribution `dist_spec` and run its `script_name` script"""
+    ns = sys._getframe(1).f_globals
+    name = ns['__name__']
+    ns.clear()
+    ns['__name__'] = name
+    require(dist_spec)[0].run_script(script_name, ns)
+
+
+# backward compatibility
+run_main = run_script
+
+
+def get_distribution(dist):
+    """Return a current distribution object for a Requirement or string"""
+    if isinstance(dist, str):
+        dist = Requirement.parse(dist)
+    if isinstance(dist, Requirement):
+        dist = get_provider(dist)
+    if not isinstance(dist, Distribution):
+        raise TypeError("Expected string, Requirement, or Distribution", dist)
+    return dist
+
+
+def load_entry_point(dist, group, name):
+    """Return `name` entry point of `group` for `dist` or raise ImportError"""
+    return get_distribution(dist).load_entry_point(group, name)
+
+
+def get_entry_map(dist, group=None):
+    """Return the entry point map for `group`, or the full entry map"""
+    return get_distribution(dist).get_entry_map(group)
+
+
+def get_entry_info(dist, group, name):
+    """Return the EntryPoint object for `group`+`name`, or ``None``"""
+    return get_distribution(dist).get_entry_info(group, name)
+
+
+class IMetadataProvider:
+    def has_metadata(name):
+        """Does the package's distribution contain the named metadata?"""
+
+    def get_metadata(name):
+        """The named metadata resource as a string"""
+
+    def get_metadata_lines(name):
+        """Yield named metadata resource as list of non-blank non-comment lines
+
+       Leading and trailing whitespace is stripped from each line, and lines
+       with ``#`` as the first non-blank character are omitted."""
+
+    def metadata_isdir(name):
+        """Is the named metadata a directory?  (like ``os.path.isdir()``)"""
+
+    def metadata_listdir(name):
+        """List of metadata names in the directory (like ``os.listdir()``)"""
+
+    def run_script(script_name, namespace):
+        """Execute the named script in the supplied namespace dictionary"""
+
+
+class IResourceProvider(IMetadataProvider):
+    """An object that provides access to package resources"""
+
+    def get_resource_filename(manager, resource_name):
+        """Return a true filesystem path for `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def get_resource_stream(manager, resource_name):
+        """Return a readable file-like object for `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def get_resource_string(manager, resource_name):
+        """Return a string containing the contents of `resource_name`
+
+        `manager` must be an ``IResourceManager``"""
+
+    def has_resource(resource_name):
+        """Does the package contain the named resource?"""
+
+    def resource_isdir(resource_name):
+        """Is the named resource a directory?  (like ``os.path.isdir()``)"""
+
+    def resource_listdir(resource_name):
+        """List of resource names in the directory (like ``os.listdir()``)"""
+
+
+class WorkingSet:
+    """A collection of active distributions on sys.path (or a similar list)"""
+
+    def __init__(self, entries=None):
+        """Create working set from list of path entries (default=sys.path)"""
+        self.entries = []
+        self.entry_keys = {}
+        self.by_key = {}
+        self.callbacks = []
+
+        if entries is None:
+            entries = sys.path
+
+        for entry in entries:
+            self.add_entry(entry)
+
+    @classmethod
+    def _build_master(cls):
+        """
+        Prepare the master working set.
+        """
+        ws = cls()
+        try:
+            from __main__ import __requires__
+        except ImportError:
+            # The main program does not list any requirements
+            return ws
+
+        # ensure the requirements are met
+        try:
+            ws.require(__requires__)
+        except VersionConflict:
+            return cls._build_from_requirements(__requires__)
+
+        return ws
+
+    @classmethod
+    def _build_from_requirements(cls, req_spec):
+        """
+        Build a working set from a requirement spec. Rewrites sys.path.
+        """
+        # try it without defaults already on sys.path
+        # by starting with an empty path
+        ws = cls([])
+        reqs = parse_requirements(req_spec)
+        dists = ws.resolve(reqs, Environment())
+        for dist in dists:
+            ws.add(dist)
+
+        # add any missing entries from sys.path
+        for entry in sys.path:
+            if entry not in ws.entries:
+                ws.add_entry(entry)
+
+        # then copy back to sys.path
+        sys.path[:] = ws.entries
+        return ws
+
+    def add_entry(self, entry):
+        """Add a path item to ``.entries``, finding any distributions on it
+
+        ``find_distributions(entry, True)`` is used to find distributions
+        corresponding to the path entry, and they are added.  `entry` is
+        always appended to ``.entries``, even if it is already present.
+        (This is because ``sys.path`` can contain the same value more than
+        once, and the ``.entries`` of the ``sys.path`` WorkingSet should always
+        equal ``sys.path``.)
+        """
+        self.entry_keys.setdefault(entry, [])
+        self.entries.append(entry)
+        for dist in find_distributions(entry, True):
+            self.add(dist, entry, False)
+
+    def __contains__(self, dist):
+        """True if `dist` is the active distribution for its project"""
+        return self.by_key.get(dist.key) == dist
+
+    def find(self, req):
+        """Find a distribution matching requirement `req`
+
+        If there is an active distribution for the requested project, this
+        returns it as long as it meets the version requirement specified by
+        `req`.  But, if there is an active distribution for the project and it
+        does *not* meet the `req` requirement, ``VersionConflict`` is raised.
+        If there is no active distribution for the requested project, ``None``
+        is returned.
+        """
+        dist = self.by_key.get(req.key)
+        if dist is not None and dist not in req:
+            # XXX add more info
+            raise VersionConflict(dist, req)
+        return dist
+
+    def iter_entry_points(self, group, name=None):
+        """Yield entry point objects from `group` matching `name`
+
+        If `name` is None, yields all entry points in `group` from all
+        distributions in the working set, otherwise only ones matching
+        both `group` and `name` are yielded (in distribution order).
+        """
+        return (
+            entry
+            for dist in self
+            for entry in dist.get_entry_map(group).values()
+            if name is None or name == entry.name
+        )
+
+    def run_script(self, requires, script_name):
+        """Locate distribution for `requires` and run `script_name` script"""
+        ns = sys._getframe(1).f_globals
+        name = ns['__name__']
+        ns.clear()
+        ns['__name__'] = name
+        self.require(requires)[0].run_script(script_name, ns)
+
+    def __iter__(self):
+        """Yield distributions for non-duplicate projects in the working set
+
+        The yield order is the order in which the items' path entries were
+        added to the working set.
+        """
+        seen = {}
+        for item in self.entries:
+            if item not in self.entry_keys:
+                # workaround a cache issue
+                continue
+
+            for key in self.entry_keys[item]:
+                if key not in seen:
+                    seen[key] = 1
+                    yield self.by_key[key]
+
+    def add(self, dist, entry=None, insert=True, replace=False):
+        """Add `dist` to working set, associated with `entry`
+
+        If `entry` is unspecified, it defaults to the ``.location`` of `dist`.
+        On exit from this routine, `entry` is added to the end of the working
+        set's ``.entries`` (if it wasn't already present).
+
+        `dist` is only added to the working set if it's for a project that
+        doesn't already have a distribution in the set, unless `replace=True`.
+        If it's added, any callbacks registered with the ``subscribe()`` method
+        will be called.
+        """
+        if insert:
+            dist.insert_on(self.entries, entry, replace=replace)
+
+        if entry is None:
+            entry = dist.location
+        keys = self.entry_keys.setdefault(entry, [])
+        keys2 = self.entry_keys.setdefault(dist.location, [])
+        if not replace and dist.key in self.by_key:
+            # ignore hidden distros
+            return
+
+        self.by_key[dist.key] = dist
+        if dist.key not in keys:
+            keys.append(dist.key)
+        if dist.key not in keys2:
+            keys2.append(dist.key)
+        self._added_new(dist)
+
+    def resolve(self, requirements, env=None, installer=None,
+                replace_conflicting=False, extras=None):
+        """List all distributions needed to (recursively) meet `requirements`
+
+        `requirements` must be a sequence of ``Requirement`` objects.  `env`,
+        if supplied, should be an ``Environment`` instance.  If
+        not supplied, it defaults to all distributions available within any
+        entry or distribution in the working set.  `installer`, if supplied,
+        will be invoked with each requirement that cannot be met by an
+        already-installed distribution; it should return a ``Distribution`` or
+        ``None``.
+
+        Unless `replace_conflicting=True`, raises a VersionConflict exception
+        if
+        any requirements are found on the path that have the correct name but
+        the wrong version.  Otherwise, if an `installer` is supplied it will be
+        invoked to obtain the correct version of the requirement and activate
+        it.
+
+        `extras` is a list of the extras to be used with these requirements.
+        This is important because extra requirements may look like `my_req;
+        extra = "my_extra"`, which would otherwise be interpreted as a purely
+        optional requirement.  Instead, we want to be able to assert that these
+        requirements are truly required.
+        """
+
+        # set up the stack
+        requirements = list(requirements)[::-1]
+        # set of processed requirements
+        processed = {}
+        # key -> dist
+        best = {}
+        to_activate = []
+
+        req_extras = _ReqExtras()
+
+        # Mapping of requirement to set of distributions that required it;
+        # useful for reporting info about conflicts.
+        required_by = collections.defaultdict(set)
+
+        while requirements:
+            # process dependencies breadth-first
+            req = requirements.pop(0)
+            if req in processed:
+                # Ignore cyclic or redundant dependencies
+                continue
+
+            if not req_extras.markers_pass(req, extras):
+                continue
+
+            dist = best.get(req.key)
+            if dist is None:
+                # Find the best distribution and add it to the map
+                dist = self.by_key.get(req.key)
+                if dist is None or (dist not in req and replace_conflicting):
+                    ws = self
+                    if env is None:
+                        if dist is None:
+                            env = Environment(self.entries)
+                        else:
+                            # Use an empty environment and workingset to avoid
+                            # any further conflicts with the conflicting
+                            # distribution
+                            env = Environment([])
+                            ws = WorkingSet([])
+                    dist = best[req.key] = env.best_match(
+                        req, ws, installer,
+                        replace_conflicting=replace_conflicting
+                    )
+                    if dist is None:
+                        requirers = required_by.get(req, None)
+                        raise DistributionNotFound(req, requirers)
+                to_activate.append(dist)
+            if dist not in req:
+                # Oops, the "best" so far conflicts with a dependency
+                dependent_req = required_by[req]
+                raise VersionConflict(dist, req).with_context(dependent_req)
+
+            # push the new requirements onto the stack
+            new_requirements = dist.requires(req.extras)[::-1]
+            requirements.extend(new_requirements)
+
+            # Register the new requirements needed by req
+            for new_requirement in new_requirements:
+                required_by[new_requirement].add(req.project_name)
+                req_extras[new_requirement] = req.extras
+
+            processed[req] = True
+
+        # return list of distros to activate
+        return to_activate
+
+    def find_plugins(
+            self, plugin_env, full_env=None, installer=None, fallback=True):
+        """Find all activatable distributions in `plugin_env`
+
+        Example usage::
+
+            distributions, errors = working_set.find_plugins(
+                Environment(plugin_dirlist)
+            )
+            # add plugins+libs to sys.path
+            map(working_set.add, distributions)
+            # display errors
+            print('Could not load', errors)
+
+        The `plugin_env` should be an ``Environment`` instance that contains
+        only distributions that are in the project's "plugin directory" or
+        directories. The `full_env`, if supplied, should be an ``Environment``
+        contains all currently-available distributions.  If `full_env` is not
+        supplied, one is created automatically from the ``WorkingSet`` this
+        method is called on, which will typically mean that every directory on
+        ``sys.path`` will be scanned for distributions.
+
+        `installer` is a standard installer callback as used by the
+        ``resolve()`` method. The `fallback` flag indicates whether we should
+        attempt to resolve older versions of a plugin if the newest version
+        cannot be resolved.
+
+        This method returns a 2-tuple: (`distributions`, `error_info`), where
+        `distributions` is a list of the distributions found in `plugin_env`
+        that were loadable, along with any other distributions that are needed
+        to resolve their dependencies.  `error_info` is a dictionary mapping
+        unloadable plugin distributions to an exception instance describing the
+        error that occurred. Usually this will be a ``DistributionNotFound`` or
+        ``VersionConflict`` instance.
+        """
+
+        plugin_projects = list(plugin_env)
+        # scan project names in alphabetic order
+        plugin_projects.sort()
+
+        error_info = {}
+        distributions = {}
+
+        if full_env is None:
+            env = Environment(self.entries)
+            env += plugin_env
+        else:
+            env = full_env + plugin_env
+
+        shadow_set = self.__class__([])
+        # put all our entries in shadow_set
+        list(map(shadow_set.add, self))
+
+        for project_name in plugin_projects:
+
+            for dist in plugin_env[project_name]:
+
+                req = [dist.as_requirement()]
+
+                try:
+                    resolvees = shadow_set.resolve(req, env, installer)
+
+                except ResolutionError as v:
+                    # save error info
+                    error_info[dist] = v
+                    if fallback:
+                        # try the next older version of project
+                        continue
+                    else:
+                        # give up on this project, keep going
+                        break
+
+                else:
+                    list(map(shadow_set.add, resolvees))
+                    distributions.update(dict.fromkeys(resolvees))
+
+                    # success, no need to try any more versions of this project
+                    break
+
+        distributions = list(distributions)
+        distributions.sort()
+
+        return distributions, error_info
+
+    def require(self, *requirements):
+        """Ensure that distributions matching `requirements` are activated
+
+        `requirements` must be a string or a (possibly-nested) sequence
+        thereof, specifying the distributions and versions required.  The
+        return value is a sequence of the distributions that needed to be
+        activated to fulfill the requirements; all relevant distributions are
+        included, even if they were already activated in this working set.
+        """
+        needed = self.resolve(parse_requirements(requirements))
+
+        for dist in needed:
+            self.add(dist)
+
+        return needed
+
+    def subscribe(self, callback, existing=True):
+        """Invoke `callback` for all distributions
+
+        If `existing=True` (default),
+        call on all existing ones, as well.
+        """
+        if callback in self.callbacks:
+            return
+        self.callbacks.append(callback)
+        if not existing:
+            return
+        for dist in self:
+            callback(dist)
+
+    def _added_new(self, dist):
+        for callback in self.callbacks:
+            callback(dist)
+
+    def __getstate__(self):
+        return (
+            self.entries[:], self.entry_keys.copy(), self.by_key.copy(),
+            self.callbacks[:]
+        )
+
+    def __setstate__(self, e_k_b_c):
+        entries, keys, by_key, callbacks = e_k_b_c
+        self.entries = entries[:]
+        self.entry_keys = keys.copy()
+        self.by_key = by_key.copy()
+        self.callbacks = callbacks[:]
+
+
+class _ReqExtras(dict):
+    """
+    Map each requirement to the extras that demanded it.
+    """
+
+    def markers_pass(self, req, extras=None):
+        """
+        Evaluate markers for req against each extra that
+        demanded it.
+
+        Return False if the req has a marker and fails
+        evaluation. Otherwise, return True.
+        """
+        extra_evals = (
+            req.marker.evaluate({'extra': extra})
+            for extra in self.get(req, ()) + (extras or (None,))
+        )
+        return not req.marker or any(extra_evals)
+
+
+class Environment:
+    """Searchable snapshot of distributions on a search path"""
+
+    def __init__(
+            self, search_path=None, platform=get_supported_platform(),
+            python=PY_MAJOR):
+        """Snapshot distributions available on a search path
+
+        Any distributions found on `search_path` are added to the environment.
+        `search_path` should be a sequence of ``sys.path`` items.  If not
+        supplied, ``sys.path`` is used.
+
+        `platform` is an optional string specifying the name of the platform
+        that platform-specific distributions must be compatible with.  If
+        unspecified, it defaults to the current platform.  `python` is an
+        optional string naming the desired version of Python (e.g. ``'3.6'``);
+        it defaults to the current version.
+
+        You may explicitly set `platform` (and/or `python`) to ``None`` if you
+        wish to map *all* distributions, not just those compatible with the
+        running platform or Python version.
+        """
+        self._distmap = {}
+        self.platform = platform
+        self.python = python
+        self.scan(search_path)
+
+    def can_add(self, dist):
+        """Is distribution `dist` acceptable for this environment?
+
+        The distribution must match the platform and python version
+        requirements specified when this environment was created, or False
+        is returned.
+        """
+        py_compat = (
+            self.python is None
+            or dist.py_version is None
+            or dist.py_version == self.python
+        )
+        return py_compat and compatible_platforms(dist.platform, self.platform)
+
+    def remove(self, dist):
+        """Remove `dist` from the environment"""
+        self._distmap[dist.key].remove(dist)
+
+    def scan(self, search_path=None):
+        """Scan `search_path` for distributions usable in this environment
+
+        Any distributions found are added to the environment.
+        `search_path` should be a sequence of ``sys.path`` items.  If not
+        supplied, ``sys.path`` is used.  Only distributions conforming to
+        the platform/python version defined at initialization are added.
+        """
+        if search_path is None:
+            search_path = sys.path
+
+        for item in search_path:
+            for dist in find_distributions(item):
+                self.add(dist)
+
+    def __getitem__(self, project_name):
+        """Return a newest-to-oldest list of distributions for `project_name`
+
+        Uses case-insensitive `project_name` comparison, assuming all the
+        project's distributions use their project's name converted to all
+        lowercase as their key.
+
+        """
+        distribution_key = project_name.lower()
+        return self._distmap.get(distribution_key, [])
+
+    def add(self, dist):
+        """Add `dist` if we ``can_add()`` it and it has not already been added
+        """
+        if self.can_add(dist) and dist.has_version():
+            dists = self._distmap.setdefault(dist.key, [])
+            if dist not in dists:
+                dists.append(dist)
+                dists.sort(key=operator.attrgetter('hashcmp'), reverse=True)
+
+    def best_match(
+            self, req, working_set, installer=None, replace_conflicting=False):
+        """Find distribution best matching `req` and usable on `working_set`
+
+        This calls the ``find(req)`` method of the `working_set` to see if a
+        suitable distribution is already active.  (This may raise
+        ``VersionConflict`` if an unsuitable version of the project is already
+        active in the specified `working_set`.)  If a suitable distribution
+        isn't active, this method returns the newest distribution in the
+        environment that meets the ``Requirement`` in `req`.  If no suitable
+        distribution is found, and `installer` is supplied, then the result of
+        calling the environment's ``obtain(req, installer)`` method will be
+        returned.
+        """
+        try:
+            dist = working_set.find(req)
+        except VersionConflict:
+            if not replace_conflicting:
+                raise
+            dist = None
+        if dist is not None:
+            return dist
+        for dist in self[req.key]:
+            if dist in req:
+                return dist
+        # try to download/install
+        return self.obtain(req, installer)
+
+    def obtain(self, requirement, installer=None):
+        """Obtain a distribution matching `requirement` (e.g. via download)
+
+        Obtain a distro that matches requirement (e.g. via download).  In the
+        base ``Environment`` class, this routine just returns
+        ``installer(requirement)``, unless `installer` is None, in which case
+        None is returned instead.  This method is a hook that allows subclasses
+        to attempt other ways of obtaining a distribution before falling back
+        to the `installer` argument."""
+        if installer is not None:
+            return installer(requirement)
+
+    def __iter__(self):
+        """Yield the unique project names of the available distributions"""
+        for key in self._distmap.keys():
+            if self[key]:
+                yield key
+
+    def __iadd__(self, other):
+        """In-place addition of a distribution or environment"""
+        if isinstance(other, Distribution):
+            self.add(other)
+        elif isinstance(other, Environment):
+            for project in other:
+                for dist in other[project]:
+                    self.add(dist)
+        else:
+            raise TypeError("Can't add %r to environment" % (other,))
+        return self
+
+    def __add__(self, other):
+        """Add an environment or distribution to an environment"""
+        new = self.__class__([], platform=None, python=None)
+        for env in self, other:
+            new += env
+        return new
+
+
+# XXX backward compatibility
+AvailableDistributions = Environment
+
+
+class ExtractionError(RuntimeError):
+    """An error occurred extracting a resource
+
+    The following attributes are available from instances of this exception:
+
+    manager
+        The resource manager that raised this exception
+
+    cache_path
+        The base directory for resource extraction
+
+    original_error
+        The exception instance that caused extraction to fail
+    """
+
+
+class ResourceManager:
+    """Manage resource extraction and packages"""
+    extraction_path = None
+
+    def __init__(self):
+        self.cached_files = {}
+
+    def resource_exists(self, package_or_requirement, resource_name):
+        """Does the named resource exist?"""
+        return get_provider(package_or_requirement).has_resource(resource_name)
+
+    def resource_isdir(self, package_or_requirement, resource_name):
+        """Is the named resource an existing directory?"""
+        return get_provider(package_or_requirement).resource_isdir(
+            resource_name
+        )
+
+    def resource_filename(self, package_or_requirement, resource_name):
+        """Return a true filesystem path for specified resource"""
+        return get_provider(package_or_requirement).get_resource_filename(
+            self, resource_name
+        )
+
+    def resource_stream(self, package_or_requirement, resource_name):
+        """Return a readable file-like object for specified resource"""
+        return get_provider(package_or_requirement).get_resource_stream(
+            self, resource_name
+        )
+
+    def resource_string(self, package_or_requirement, resource_name):
+        """Return specified resource as a string"""
+        return get_provider(package_or_requirement).get_resource_string(
+            self, resource_name
+        )
+
+    def resource_listdir(self, package_or_requirement, resource_name):
+        """List the contents of the named resource directory"""
+        return get_provider(package_or_requirement).resource_listdir(
+            resource_name
+        )
+
+    def extraction_error(self):
+        """Give an error message for problems extracting file(s)"""
+
+        old_exc = sys.exc_info()[1]
+        cache_path = self.extraction_path or get_default_cache()
+
+        tmpl = textwrap.dedent("""
+            Can't extract file(s) to egg cache
+
+            The following error occurred while trying to extract file(s)
+            to the Python egg cache:
+
+              {old_exc}
+
+            The Python egg cache directory is currently set to:
+
+              {cache_path}
+
+            Perhaps your account does not have write access to this directory?
+            You can change the cache directory by setting the PYTHON_EGG_CACHE
+            environment variable to point to an accessible directory.
+            """).lstrip()
+        err = ExtractionError(tmpl.format(**locals()))
+        err.manager = self
+        err.cache_path = cache_path
+        err.original_error = old_exc
+        raise err
+
+    def get_cache_path(self, archive_name, names=()):
+        """Return absolute location in cache for `archive_name` and `names`
+
+        The parent directory of the resulting path will be created if it does
+        not already exist.  `archive_name` should be the base filename of the
+        enclosing egg (which may not be the name of the enclosing zipfile!),
+        including its ".egg" extension.  `names`, if provided, should be a
+        sequence of path name parts "under" the egg's extraction location.
+
+        This method should only be called by resource providers that need to
+        obtain an extraction location, and only for names they intend to
+        extract, as it tracks the generated names for possible cleanup later.
+        """
+        extract_path = self.extraction_path or get_default_cache()
+        target_path = os.path.join(extract_path, archive_name + '-tmp', *names)
+        try:
+            _bypass_ensure_directory(target_path)
+        except Exception:
+            self.extraction_error()
+
+        self._warn_unsafe_extraction_path(extract_path)
+
+        self.cached_files[target_path] = 1
+        return target_path
+
+    @staticmethod
+    def _warn_unsafe_extraction_path(path):
+        """
+        If the default extraction path is overridden and set to an insecure
+        location, such as /tmp, it opens up an opportunity for an attacker to
+        replace an extracted file with an unauthorized payload. Warn the user
+        if a known insecure location is used.
+
+        See Distribute #375 for more details.
+        """
+        if os.name == 'nt' and not path.startswith(os.environ['windir']):
+            # On Windows, permissions are generally restrictive by default
+            #  and temp directories are not writable by other users, so
+            #  bypass the warning.
+            return
+        mode = os.stat(path).st_mode
+        if mode & stat.S_IWOTH or mode & stat.S_IWGRP:
+            msg = (
+                "Extraction path is writable by group/others "
+                "and vulnerable to attack when "
+                "used with get_resource_filename ({path}). "
+                "Consider a more secure "
+                "location (set with .set_extraction_path or the "
+                "PYTHON_EGG_CACHE environment variable)."
+            ).format(**locals())
+            warnings.warn(msg, UserWarning)
+
+    def postprocess(self, tempname, filename):
+        """Perform any platform-specific postprocessing of `tempname`
+
+        This is where Mac header rewrites should be done; other platforms don't
+        have anything special they should do.
+
+        Resource providers should call this method ONLY after successfully
+        extracting a compressed resource.  They must NOT call it on resources
+        that are already in the filesystem.
+
+        `tempname` is the current (temporary) name of the file, and `filename`
+        is the name it will be renamed to by the caller after this routine
+        returns.
+        """
+
+        if os.name == 'posix':
+            # Make the resource executable
+            mode = ((os.stat(tempname).st_mode) | 0o555) & 0o7777
+            os.chmod(tempname, mode)
+
+    def set_extraction_path(self, path):
+        """Set the base path where resources will be extracted to, if needed.
+
+        If you do not call this routine before any extractions take place, the
+        path defaults to the return value of ``get_default_cache()``.  (Which
+        is based on the ``PYTHON_EGG_CACHE`` environment variable, with various
+        platform-specific fallbacks.  See that routine's documentation for more
+        details.)
+
+        Resources are extracted to subdirectories of this path based upon
+        information given by the ``IResourceProvider``.  You may set this to a
+        temporary directory, but then you must call ``cleanup_resources()`` to
+        delete the extracted files when done.  There is no guarantee that
+        ``cleanup_resources()`` will be able to remove all extracted files.
+
+        (Note: you may not change the extraction path for a given resource
+        manager once resources have been extracted, unless you first call
+        ``cleanup_resources()``.)
+        """
+        if self.cached_files:
+            raise ValueError(
+                "Can't change extraction path, files already extracted"
+            )
+
+        self.extraction_path = path
+
+    def cleanup_resources(self, force=False):
+        """
+        Delete all extracted resource files and directories, returning a list
+        of the file and directory names that could not be successfully removed.
+        This function does not have any concurrency protection, so it should
+        generally only be called when the extraction path is a temporary
+        directory exclusive to a single process.  This method is not
+        automatically called; you must call it explicitly or register it as an
+        ``atexit`` function if you wish to ensure cleanup of a temporary
+        directory used for extractions.
+        """
+        # XXX
+
+
+def get_default_cache():
+    """
+    Return the ``PYTHON_EGG_CACHE`` environment variable
+    or a platform-relevant user cache dir for an app
+    named "Python-Eggs".
+    """
+    return (
+        os.environ.get('PYTHON_EGG_CACHE')
+        or appdirs.user_cache_dir(appname='Python-Eggs')
+    )
+
+
+def safe_name(name):
+    """Convert an arbitrary string to a standard distribution name
+
+    Any runs of non-alphanumeric/. characters are replaced with a single '-'.
+    """
+    return re.sub('[^A-Za-z0-9.]+', '-', name)
+
+
+def safe_version(version):
+    """
+    Convert an arbitrary string to a standard version string
+    """
+    try:
+        # normalize the version
+        return str(packaging.version.Version(version))
+    except packaging.version.InvalidVersion:
+        version = version.replace(' ', '.')
+        return re.sub('[^A-Za-z0-9.]+', '-', version)
+
+
+def safe_extra(extra):
+    """Convert an arbitrary string to a standard 'extra' name
+
+    Any runs of non-alphanumeric characters are replaced with a single '_',
+    and the result is always lowercased.
+    """
+    return re.sub('[^A-Za-z0-9.-]+', '_', extra).lower()
+
+
+def to_filename(name):
+    """Convert a project or version name to its filename-escaped form
+
+    Any '-' characters are currently replaced with '_'.
+    """
+    return name.replace('-', '_')
+
+
+def invalid_marker(text):
+    """
+    Validate text as a PEP 508 environment marker; return an exception
+    if invalid or False otherwise.
+    """
+    try:
+        evaluate_marker(text)
+    except SyntaxError as e:
+        e.filename = None
+        e.lineno = None
+        return e
+    return False
+
+
+def evaluate_marker(text, extra=None):
+    """
+    Evaluate a PEP 508 environment marker.
+    Return a boolean indicating the marker result in this environment.
+    Raise SyntaxError if marker is invalid.
+
+    This implementation uses the 'pyparsing' module.
+    """
+    try:
+        marker = packaging.markers.Marker(text)
+        return marker.evaluate()
+    except packaging.markers.InvalidMarker as e:
+        raise SyntaxError(e) from e
+
+
+class NullProvider:
+    """Try to implement resources and metadata for arbitrary PEP 302 loaders"""
+
+    egg_name = None
+    egg_info = None
+    loader = None
+
+    def __init__(self, module):
+        self.loader = getattr(module, '__loader__', None)
+        self.module_path = os.path.dirname(getattr(module, '__file__', ''))
+
+    def get_resource_filename(self, manager, resource_name):
+        return self._fn(self.module_path, resource_name)
+
+    def get_resource_stream(self, manager, resource_name):
+        return io.BytesIO(self.get_resource_string(manager, resource_name))
+
+    def get_resource_string(self, manager, resource_name):
+        return self._get(self._fn(self.module_path, resource_name))
+
+    def has_resource(self, resource_name):
+        return self._has(self._fn(self.module_path, resource_name))
+
+    def _get_metadata_path(self, name):
+        return self._fn(self.egg_info, name)
+
+    def has_metadata(self, name):
+        if not self.egg_info:
+            return self.egg_info
+
+        path = self._get_metadata_path(name)
+        return self._has(path)
+
+    def get_metadata(self, name):
+        if not self.egg_info:
+            return ""
+        path = self._get_metadata_path(name)
+        value = self._get(path)
+        try:
+            return value.decode('utf-8')
+        except UnicodeDecodeError as exc:
+            # Include the path in the error message to simplify
+            # troubleshooting, and without changing the exception type.
+            exc.reason += ' in {} file at path: {}'.format(name, path)
+            raise
+
+    def get_metadata_lines(self, name):
+        return yield_lines(self.get_metadata(name))
+
+    def resource_isdir(self, resource_name):
+        return self._isdir(self._fn(self.module_path, resource_name))
+
+    def metadata_isdir(self, name):
+        return self.egg_info and self._isdir(self._fn(self.egg_info, name))
+
+    def resource_listdir(self, resource_name):
+        return self._listdir(self._fn(self.module_path, resource_name))
+
+    def metadata_listdir(self, name):
+        if self.egg_info:
+            return self._listdir(self._fn(self.egg_info, name))
+        return []
+
+    def run_script(self, script_name, namespace):
+        script = 'scripts/' + script_name
+        if not self.has_metadata(script):
+            raise ResolutionError(
+                "Script {script!r} not found in metadata at {self.egg_info!r}"
+                .format(**locals()),
+            )
+        script_text = self.get_metadata(script).replace('\r\n', '\n')
+        script_text = script_text.replace('\r', '\n')
+        script_filename = self._fn(self.egg_info, script)
+        namespace['__file__'] = script_filename
+        if os.path.exists(script_filename):
+            with open(script_filename) as fid:
+                source = fid.read()
+            code = compile(source, script_filename, 'exec')
+            exec(code, namespace, namespace)
+        else:
+            from linecache import cache
+            cache[script_filename] = (
+                len(script_text), 0, script_text.split('\n'), script_filename
+            )
+            script_code = compile(script_text, script_filename, 'exec')
+            exec(script_code, namespace, namespace)
+
+    def _has(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _isdir(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _listdir(self, path):
+        raise NotImplementedError(
+            "Can't perform this operation for unregistered loader type"
+        )
+
+    def _fn(self, base, resource_name):
+        self._validate_resource_path(resource_name)
+        if resource_name:
+            return os.path.join(base, *resource_name.split('/'))
+        return base
+
+    @staticmethod
+    def _validate_resource_path(path):
+        """
+        Validate the resource paths according to the docs.
+        https://setuptools.readthedocs.io/en/latest/pkg_resources.html#basic-resource-access
+
+        >>> warned = getfixture('recwarn')
+        >>> warnings.simplefilter('always')
+        >>> vrp = NullProvider._validate_resource_path
+        >>> vrp('foo/bar.txt')
+        >>> bool(warned)
+        False
+        >>> vrp('../foo/bar.txt')
+        >>> bool(warned)
+        True
+        >>> warned.clear()
+        >>> vrp('/foo/bar.txt')
+        >>> bool(warned)
+        True
+        >>> vrp('foo/../../bar.txt')
+        >>> bool(warned)
+        True
+        >>> warned.clear()
+        >>> vrp('foo/f../bar.txt')
+        >>> bool(warned)
+        False
+
+        Windows path separators are straight-up disallowed.
+        >>> vrp(r'\\foo/bar.txt')
+        Traceback (most recent call last):
+        ...
+        ValueError: Use of .. or absolute path in a resource path \
+is not allowed.
+
+        >>> vrp(r'C:\\foo/bar.txt')
+        Traceback (most recent call last):
+        ...
+        ValueError: Use of .. or absolute path in a resource path \
+is not allowed.
+
+        Blank values are allowed
+
+        >>> vrp('')
+        >>> bool(warned)
+        False
+
+        Non-string values are not.
+
+        >>> vrp(None)
+        Traceback (most recent call last):
+        ...
+        AttributeError: ...
+        """
+        invalid = (
+            os.path.pardir in path.split(posixpath.sep) or
+            posixpath.isabs(path) or
+            ntpath.isabs(path)
+        )
+        if not invalid:
+            return
+
+        msg = "Use of .. or absolute path in a resource path is not allowed."
+
+        # Aggressively disallow Windows absolute paths
+        if ntpath.isabs(path) and not posixpath.isabs(path):
+            raise ValueError(msg)
+
+        # for compatibility, warn; in future
+        # raise ValueError(msg)
+        warnings.warn(
+            msg[:-1] + " and will raise exceptions in a future release.",
+            DeprecationWarning,
+            stacklevel=4,
+        )
+
+    def _get(self, path):
+        if hasattr(self.loader, 'get_data'):
+            return self.loader.get_data(path)
+        raise NotImplementedError(
+            "Can't perform this operation for loaders without 'get_data()'"
+        )
+
+
+register_loader_type(object, NullProvider)
+
+
+def _parents(path):
+    """
+    yield all parents of path including path
+    """
+    last = None
+    while path != last:
+        yield path
+        last = path
+        path, _ = os.path.split(path)
+
+
+class EggProvider(NullProvider):
+    """Provider based on a virtual filesystem"""
+
+    def __init__(self, module):
+        NullProvider.__init__(self, module)
+        self._setup_prefix()
+
+    def _setup_prefix(self):
+        # Assume that metadata may be nested inside a "basket"
+        # of multiple eggs and use module_path instead of .archive.
+        eggs = filter(_is_egg_path, _parents(self.module_path))
+        egg = next(eggs, None)
+        egg and self._set_egg(egg)
+
+    def _set_egg(self, path):
+        self.egg_name = os.path.basename(path)
+        self.egg_info = os.path.join(path, 'EGG-INFO')
+        self.egg_root = path
+
+
+class DefaultProvider(EggProvider):
+    """Provides access to package resources in the filesystem"""
+
+    def _has(self, path):
+        return os.path.exists(path)
+
+    def _isdir(self, path):
+        return os.path.isdir(path)
+
+    def _listdir(self, path):
+        return os.listdir(path)
+
+    def get_resource_stream(self, manager, resource_name):
+        return open(self._fn(self.module_path, resource_name), 'rb')
+
+    def _get(self, path):
+        with open(path, 'rb') as stream:
+            return stream.read()
+
+    @classmethod
+    def _register(cls):
+        loader_names = 'SourceFileLoader', 'SourcelessFileLoader',
+        for name in loader_names:
+            loader_cls = getattr(importlib_machinery, name, type(None))
+            register_loader_type(loader_cls, cls)
+
+
+DefaultProvider._register()
+
+
+class EmptyProvider(NullProvider):
+    """Provider that returns nothing for all requests"""
+
+    module_path = None
+
+    _isdir = _has = lambda self, path: False
+
+    def _get(self, path):
+        return ''
+
+    def _listdir(self, path):
+        return []
+
+    def __init__(self):
+        pass
+
+
+empty_provider = EmptyProvider()
+
+
+class ZipManifests(dict):
+    """
+    zip manifest builder
+    """
+
+    @classmethod
+    def build(cls, path):
+        """
+        Build a dictionary similar to the zipimport directory
+        caches, except instead of tuples, store ZipInfo objects.
+
+        Use a platform-specific path separator (os.sep) for the path keys
+        for compatibility with pypy on Windows.
+        """
+        with zipfile.ZipFile(path) as zfile:
+            items = (
+                (
+                    name.replace('/', os.sep),
+                    zfile.getinfo(name),
+                )
+                for name in zfile.namelist()
+            )
+            return dict(items)
+
+    load = build
+
+
+class MemoizedZipManifests(ZipManifests):
+    """
+    Memoized zipfile manifests.
+    """
+    manifest_mod = collections.namedtuple('manifest_mod', 'manifest mtime')
+
+    def load(self, path):
+        """
+        Load a manifest at path or return a suitable manifest already loaded.
+        """
+        path = os.path.normpath(path)
+        mtime = os.stat(path).st_mtime
+
+        if path not in self or self[path].mtime != mtime:
+            manifest = self.build(path)
+            self[path] = self.manifest_mod(manifest, mtime)
+
+        return self[path].manifest
+
+
+class ZipProvider(EggProvider):
+    """Resource support for zips and eggs"""
+
+    eagers = None
+    _zip_manifests = MemoizedZipManifests()
+
+    def __init__(self, module):
+        EggProvider.__init__(self, module)
+        self.zip_pre = self.loader.archive + os.sep
+
+    def _zipinfo_name(self, fspath):
+        # Convert a virtual filename (full path to file) into a zipfile subpath
+        # usable with the zipimport directory cache for our target archive
+        fspath = fspath.rstrip(os.sep)
+        if fspath == self.loader.archive:
+            return ''
+        if fspath.startswith(self.zip_pre):
+            return fspath[len(self.zip_pre):]
+        raise AssertionError(
+            "%s is not a subpath of %s" % (fspath, self.zip_pre)
+        )
+
+    def _parts(self, zip_path):
+        # Convert a zipfile subpath into an egg-relative path part list.
+        # pseudo-fs path
+        fspath = self.zip_pre + zip_path
+        if fspath.startswith(self.egg_root + os.sep):
+            return fspath[len(self.egg_root) + 1:].split(os.sep)
+        raise AssertionError(
+            "%s is not a subpath of %s" % (fspath, self.egg_root)
+        )
+
+    @property
+    def zipinfo(self):
+        return self._zip_manifests.load(self.loader.archive)
+
+    def get_resource_filename(self, manager, resource_name):
+        if not self.egg_name:
+            raise NotImplementedError(
+                "resource_filename() only supported for .egg, not .zip"
+            )
+        # no need to lock for extraction, since we use temp names
+        zip_path = self._resource_to_zip(resource_name)
+        eagers = self._get_eager_resources()
+        if '/'.join(self._parts(zip_path)) in eagers:
+            for name in eagers:
+                self._extract_resource(manager, self._eager_to_zip(name))
+        return self._extract_resource(manager, zip_path)
+
+    @staticmethod
+    def _get_date_and_size(zip_stat):
+        size = zip_stat.file_size
+        # ymdhms+wday, yday, dst
+        date_time = zip_stat.date_time + (0, 0, -1)
+        # 1980 offset already done
+        timestamp = time.mktime(date_time)
+        return timestamp, size
+
+    def _extract_resource(self, manager, zip_path):
+
+        if zip_path in self._index():
+            for name in self._index()[zip_path]:
+                last = self._extract_resource(
+                    manager, os.path.join(zip_path, name)
+                )
+            # return the extracted directory name
+            return os.path.dirname(last)
+
+        timestamp, size = self._get_date_and_size(self.zipinfo[zip_path])
+
+        if not WRITE_SUPPORT:
+            raise IOError('"os.rename" and "os.unlink" are not supported '
+                          'on this platform')
+        try:
+
+            real_path = manager.get_cache_path(
+                self.egg_name, self._parts(zip_path)
+            )
+
+            if self._is_current(real_path, zip_path):
+                return real_path
+
+            outf, tmpnam = _mkstemp(
+                ".$extract",
+                dir=os.path.dirname(real_path),
+            )
+            os.write(outf, self.loader.get_data(zip_path))
+            os.close(outf)
+            utime(tmpnam, (timestamp, timestamp))
+            manager.postprocess(tmpnam, real_path)
+
+            try:
+                rename(tmpnam, real_path)
+
+            except os.error:
+                if os.path.isfile(real_path):
+                    if self._is_current(real_path, zip_path):
+                        # the file became current since it was checked above,
+                        #  so proceed.
+                        return real_path
+                    # Windows, del old file and retry
+                    elif os.name == 'nt':
+                        unlink(real_path)
+                        rename(tmpnam, real_path)
+                        return real_path
+                raise
+
+        except os.error:
+            # report a user-friendly error
+            manager.extraction_error()
+
+        return real_path
+
+    def _is_current(self, file_path, zip_path):
+        """
+        Return True if the file_path is current for this zip_path
+        """
+        timestamp, size = self._get_date_and_size(self.zipinfo[zip_path])
+        if not os.path.isfile(file_path):
+            return False
+        stat = os.stat(file_path)
+        if stat.st_size != size or stat.st_mtime != timestamp:
+            return False
+        # check that the contents match
+        zip_contents = self.loader.get_data(zip_path)
+        with open(file_path, 'rb') as f:
+            file_contents = f.read()
+        return zip_contents == file_contents
+
+    def _get_eager_resources(self):
+        if self.eagers is None:
+            eagers = []
+            for name in ('native_libs.txt', 'eager_resources.txt'):
+                if self.has_metadata(name):
+                    eagers.extend(self.get_metadata_lines(name))
+            self.eagers = eagers
+        return self.eagers
+
+    def _index(self):
+        try:
+            return self._dirindex
+        except AttributeError:
+            ind = {}
+            for path in self.zipinfo:
+                parts = path.split(os.sep)
+                while parts:
+                    parent = os.sep.join(parts[:-1])
+                    if parent in ind:
+                        ind[parent].append(parts[-1])
+                        break
+                    else:
+                        ind[parent] = [parts.pop()]
+            self._dirindex = ind
+            return ind
+
+    def _has(self, fspath):
+        zip_path = self._zipinfo_name(fspath)
+        return zip_path in self.zipinfo or zip_path in self._index()
+
+    def _isdir(self, fspath):
+        return self._zipinfo_name(fspath) in self._index()
+
+    def _listdir(self, fspath):
+        return list(self._index().get(self._zipinfo_name(fspath), ()))
+
+    def _eager_to_zip(self, resource_name):
+        return self._zipinfo_name(self._fn(self.egg_root, resource_name))
+
+    def _resource_to_zip(self, resource_name):
+        return self._zipinfo_name(self._fn(self.module_path, resource_name))
+
+
+register_loader_type(zipimport.zipimporter, ZipProvider)
+
+
+class FileMetadata(EmptyProvider):
+    """Metadata handler for standalone PKG-INFO files
+
+    Usage::
+
+        metadata = FileMetadata("/path/to/PKG-INFO")
+
+    This provider rejects all data and metadata requests except for PKG-INFO,
+    which is treated as existing, and will be the contents of the file at
+    the provided location.
+    """
+
+    def __init__(self, path):
+        self.path = path
+
+    def _get_metadata_path(self, name):
+        return self.path
+
+    def has_metadata(self, name):
+        return name == 'PKG-INFO' and os.path.isfile(self.path)
+
+    def get_metadata(self, name):
+        if name != 'PKG-INFO':
+            raise KeyError("No metadata except PKG-INFO is available")
+
+        with io.open(self.path, encoding='utf-8', errors="replace") as f:
+            metadata = f.read()
+        self._warn_on_replacement(metadata)
+        return metadata
+
+    def _warn_on_replacement(self, metadata):
+        replacement_char = '�'
+        if replacement_char in metadata:
+            tmpl = "{self.path} could not be properly decoded in UTF-8"
+            msg = tmpl.format(**locals())
+            warnings.warn(msg)
+
+    def get_metadata_lines(self, name):
+        return yield_lines(self.get_metadata(name))
+
+
+class PathMetadata(DefaultProvider):
+    """Metadata provider for egg directories
+
+    Usage::
+
+        # Development eggs:
+
+        egg_info = "/path/to/PackageName.egg-info"
+        base_dir = os.path.dirname(egg_info)
+        metadata = PathMetadata(base_dir, egg_info)
+        dist_name = os.path.splitext(os.path.basename(egg_info))[0]
+        dist = Distribution(basedir, project_name=dist_name, metadata=metadata)
+
+        # Unpacked egg directories:
+
+        egg_path = "/path/to/PackageName-ver-pyver-etc.egg"
+        metadata = PathMetadata(egg_path, os.path.join(egg_path,'EGG-INFO'))
+        dist = Distribution.from_filename(egg_path, metadata=metadata)
+    """
+
+    def __init__(self, path, egg_info):
+        self.module_path = path
+        self.egg_info = egg_info
+
+
+class EggMetadata(ZipProvider):
+    """Metadata provider for .egg files"""
+
+    def __init__(self, importer):
+        """Create a metadata provider from a zipimporter"""
+
+        self.zip_pre = importer.archive + os.sep
+        self.loader = importer
+        if importer.prefix:
+            self.module_path = os.path.join(importer.archive, importer.prefix)
+        else:
+            self.module_path = importer.archive
+        self._setup_prefix()
+
+
+_declare_state('dict', _distribution_finders={})
+
+
+def register_finder(importer_type, distribution_finder):
+    """Register `distribution_finder` to find distributions in sys.path items
+
+    `importer_type` is the type or class of a PEP 302 "Importer" (sys.path item
+    handler), and `distribution_finder` is a callable that, passed a path
+    item and the importer instance, yields ``Distribution`` instances found on
+    that path item.  See ``pkg_resources.find_on_path`` for an example."""
+    _distribution_finders[importer_type] = distribution_finder
+
+
+def find_distributions(path_item, only=False):
+    """Yield distributions accessible via `path_item`"""
+    importer = get_importer(path_item)
+    finder = _find_adapter(_distribution_finders, importer)
+    return finder(importer, path_item, only)
+
+
+def find_eggs_in_zip(importer, path_item, only=False):
+    """
+    Find eggs in zip files; possibly multiple nested eggs.
+    """
+    if importer.archive.endswith('.whl'):
+        # wheels are not supported with this finder
+        # they don't have PKG-INFO metadata, and won't ever contain eggs
+        return
+    metadata = EggMetadata(importer)
+    if metadata.has_metadata('PKG-INFO'):
+        yield Distribution.from_filename(path_item, metadata=metadata)
+    if only:
+        # don't yield nested distros
+        return
+    for subitem in metadata.resource_listdir(''):
+        if _is_egg_path(subitem):
+            subpath = os.path.join(path_item, subitem)
+            dists = find_eggs_in_zip(zipimport.zipimporter(subpath), subpath)
+            for dist in dists:
+                yield dist
+        elif subitem.lower().endswith('.dist-info'):
+            subpath = os.path.join(path_item, subitem)
+            submeta = EggMetadata(zipimport.zipimporter(subpath))
+            submeta.egg_info = subpath
+            yield Distribution.from_location(path_item, subitem, submeta)
+
+
+register_finder(zipimport.zipimporter, find_eggs_in_zip)
+
+
+def find_nothing(importer, path_item, only=False):
+    return ()
+
+
+register_finder(object, find_nothing)
+
+
+def _by_version_descending(names):
+    """
+    Given a list of filenames, return them in descending order
+    by version number.
+
+    >>> names = 'bar', 'foo', 'Python-2.7.10.egg', 'Python-2.7.2.egg'
+    >>> _by_version_descending(names)
+    ['Python-2.7.10.egg', 'Python-2.7.2.egg', 'foo', 'bar']
+    >>> names = 'Setuptools-1.2.3b1.egg', 'Setuptools-1.2.3.egg'
+    >>> _by_version_descending(names)
+    ['Setuptools-1.2.3.egg', 'Setuptools-1.2.3b1.egg']
+    >>> names = 'Setuptools-1.2.3b1.egg', 'Setuptools-1.2.3.post1.egg'
+    >>> _by_version_descending(names)
+    ['Setuptools-1.2.3.post1.egg', 'Setuptools-1.2.3b1.egg']
+    """
+    def _by_version(name):
+        """
+        Parse each component of the filename
+        """
+        name, ext = os.path.splitext(name)
+        parts = itertools.chain(name.split('-'), [ext])
+        return [packaging.version.parse(part) for part in parts]
+
+    return sorted(names, key=_by_version, reverse=True)
+
+
+def find_on_path(importer, path_item, only=False):
+    """Yield distributions accessible on a sys.path directory"""
+    path_item = _normalize_cached(path_item)
+
+    if _is_unpacked_egg(path_item):
+        yield Distribution.from_filename(
+            path_item, metadata=PathMetadata(
+                path_item, os.path.join(path_item, 'EGG-INFO')
+            )
+        )
+        return
+
+    entries = (
+        os.path.join(path_item, child)
+        for child in safe_listdir(path_item)
+    )
+
+    # for performance, before sorting by version,
+    # screen entries for only those that will yield
+    # distributions
+    filtered = (
+        entry
+        for entry in entries
+        if dist_factory(path_item, entry, only)
+    )
+
+    # scan for .egg and .egg-info in directory
+    path_item_entries = _by_version_descending(filtered)
+    for entry in path_item_entries:
+        fullpath = os.path.join(path_item, entry)
+        factory = dist_factory(path_item, entry, only)
+        for dist in factory(fullpath):
+            yield dist
+
+
+def dist_factory(path_item, entry, only):
+    """Return a dist_factory for the given entry."""
+    lower = entry.lower()
+    is_egg_info = lower.endswith('.egg-info')
+    is_dist_info = (
+        lower.endswith('.dist-info') and
+        os.path.isdir(os.path.join(path_item, entry))
+    )
+    is_meta = is_egg_info or is_dist_info
+    return (
+        distributions_from_metadata
+        if is_meta else
+        find_distributions
+        if not only and _is_egg_path(entry) else
+        resolve_egg_link
+        if not only and lower.endswith('.egg-link') else
+        NoDists()
+    )
+
+
+class NoDists:
+    """
+    >>> bool(NoDists())
+    False
+
+    >>> list(NoDists()('anything'))
+    []
+    """
+    def __bool__(self):
+        return False
+
+    def __call__(self, fullpath):
+        return iter(())
+
+
+def safe_listdir(path):
+    """
+    Attempt to list contents of path, but suppress some exceptions.
+    """
+    try:
+        return os.listdir(path)
+    except (PermissionError, NotADirectoryError):
+        pass
+    except OSError as e:
+        # Ignore the directory if does not exist, not a directory or
+        # permission denied
+        if e.errno not in (errno.ENOTDIR, errno.EACCES, errno.ENOENT):
+            raise
+    return ()
+
+
+def distributions_from_metadata(path):
+    root = os.path.dirname(path)
+    if os.path.isdir(path):
+        if len(os.listdir(path)) == 0:
+            # empty metadata dir; skip
+            return
+        metadata = PathMetadata(root, path)
+    else:
+        metadata = FileMetadata(path)
+    entry = os.path.basename(path)
+    yield Distribution.from_location(
+        root, entry, metadata, precedence=DEVELOP_DIST,
+    )
+
+
+def non_empty_lines(path):
+    """
+    Yield non-empty lines from file at path
+    """
+    with open(path) as f:
+        for line in f:
+            line = line.strip()
+            if line:
+                yield line
+
+
+def resolve_egg_link(path):
+    """
+    Given a path to an .egg-link, resolve distributions
+    present in the referenced path.
+    """
+    referenced_paths = non_empty_lines(path)
+    resolved_paths = (
+        os.path.join(os.path.dirname(path), ref)
+        for ref in referenced_paths
+    )
+    dist_groups = map(find_distributions, resolved_paths)
+    return next(dist_groups, ())
+
+
+register_finder(pkgutil.ImpImporter, find_on_path)
+
+if hasattr(importlib_machinery, 'FileFinder'):
+    register_finder(importlib_machinery.FileFinder, find_on_path)
+
+_declare_state('dict', _namespace_handlers={})
+_declare_state('dict', _namespace_packages={})
+
+
+def register_namespace_handler(importer_type, namespace_handler):
+    """Register `namespace_handler` to declare namespace packages
+
+    `importer_type` is the type or class of a PEP 302 "Importer" (sys.path item
+    handler), and `namespace_handler` is a callable like this::
+
+        def namespace_handler(importer, path_entry, moduleName, module):
+            # return a path_entry to use for child packages
+
+    Namespace handlers are only called if the importer object has already
+    agreed that it can handle the relevant path item, and they should only
+    return a subpath if the module __path__ does not already contain an
+    equivalent subpath.  For an example namespace handler, see
+    ``pkg_resources.file_ns_handler``.
+    """
+    _namespace_handlers[importer_type] = namespace_handler
+
+
+def _handle_ns(packageName, path_item):
+    """Ensure that named package includes a subpath of path_item (if needed)"""
+
+    importer = get_importer(path_item)
+    if importer is None:
+        return None
+
+    # use find_spec (PEP 451) and fall-back to find_module (PEP 302)
+    try:
+        loader = importer.find_spec(packageName).loader
+    except AttributeError:
+        # capture warnings due to #1111
+        with warnings.catch_warnings():
+            warnings.simplefilter("ignore")
+            loader = importer.find_module(packageName)
+
+    if loader is None:
+        return None
+    module = sys.modules.get(packageName)
+    if module is None:
+        module = sys.modules[packageName] = types.ModuleType(packageName)
+        module.__path__ = []
+        _set_parent_ns(packageName)
+    elif not hasattr(module, '__path__'):
+        raise TypeError("Not a package:", packageName)
+    handler = _find_adapter(_namespace_handlers, importer)
+    subpath = handler(importer, path_item, packageName, module)
+    if subpath is not None:
+        path = module.__path__
+        path.append(subpath)
+        loader.load_module(packageName)
+        _rebuild_mod_path(path, packageName, module)
+    return subpath
+
+
+def _rebuild_mod_path(orig_path, package_name, module):
+    """
+    Rebuild module.__path__ ensuring that all entries are ordered
+    corresponding to their sys.path order
+    """
+    sys_path = [_normalize_cached(p) for p in sys.path]
+
+    def safe_sys_path_index(entry):
+        """
+        Workaround for #520 and #513.
+        """
+        try:
+            return sys_path.index(entry)
+        except ValueError:
+            return float('inf')
+
+    def position_in_sys_path(path):
+        """
+        Return the ordinal of the path based on its position in sys.path
+        """
+        path_parts = path.split(os.sep)
+        module_parts = package_name.count('.') + 1
+        parts = path_parts[:-module_parts]
+        return safe_sys_path_index(_normalize_cached(os.sep.join(parts)))
+
+    new_path = sorted(orig_path, key=position_in_sys_path)
+    new_path = [_normalize_cached(p) for p in new_path]
+
+    if isinstance(module.__path__, list):
+        module.__path__[:] = new_path
+    else:
+        module.__path__ = new_path
+
+
+def declare_namespace(packageName):
+    """Declare that package 'packageName' is a namespace package"""
+
+    _imp.acquire_lock()
+    try:
+        if packageName in _namespace_packages:
+            return
+
+        path = sys.path
+        parent, _, _ = packageName.rpartition('.')
+
+        if parent:
+            declare_namespace(parent)
+            if parent not in _namespace_packages:
+                __import__(parent)
+            try:
+                path = sys.modules[parent].__path__
+            except AttributeError as e:
+                raise TypeError("Not a package:", parent) from e
+
+        # Track what packages are namespaces, so when new path items are added,
+        # they can be updated
+        _namespace_packages.setdefault(parent or None, []).append(packageName)
+        _namespace_packages.setdefault(packageName, [])
+
+        for path_item in path:
+            # Ensure all the parent's path items are reflected in the child,
+            # if they apply
+            _handle_ns(packageName, path_item)
+
+    finally:
+        _imp.release_lock()
+
+
+def fixup_namespace_packages(path_item, parent=None):
+    """Ensure that previously-declared namespace packages include path_item"""
+    _imp.acquire_lock()
+    try:
+        for package in _namespace_packages.get(parent, ()):
+            subpath = _handle_ns(package, path_item)
+            if subpath:
+                fixup_namespace_packages(subpath, package)
+    finally:
+        _imp.release_lock()
+
+
+def file_ns_handler(importer, path_item, packageName, module):
+    """Compute an ns-package subpath for a filesystem or zipfile importer"""
+
+    subpath = os.path.join(path_item, packageName.split('.')[-1])
+    normalized = _normalize_cached(subpath)
+    for item in module.__path__:
+        if _normalize_cached(item) == normalized:
+            break
+    else:
+        # Only return the path if it's not already there
+        return subpath
+
+
+register_namespace_handler(pkgutil.ImpImporter, file_ns_handler)
+register_namespace_handler(zipimport.zipimporter, file_ns_handler)
+
+if hasattr(importlib_machinery, 'FileFinder'):
+    register_namespace_handler(importlib_machinery.FileFinder, file_ns_handler)
+
+
+def null_ns_handler(importer, path_item, packageName, module):
+    return None
+
+
+register_namespace_handler(object, null_ns_handler)
+
+
+def normalize_path(filename):
+    """Normalize a file/dir name for comparison purposes"""
+    return os.path.normcase(os.path.realpath(os.path.normpath(
+        _cygwin_patch(filename))))
+
+
+def _cygwin_patch(filename):  # pragma: nocover
+    """
+    Contrary to POSIX 2008, on Cygwin, getcwd (3) contains
+    symlink components. Using
+    os.path.abspath() works around this limitation. A fix in os.getcwd()
+    would probably better, in Cygwin even more so, except
+    that this seems to be by design...
+    """
+    return os.path.abspath(filename) if sys.platform == 'cygwin' else filename
+
+
+def _normalize_cached(filename, _cache={}):
+    try:
+        return _cache[filename]
+    except KeyError:
+        _cache[filename] = result = normalize_path(filename)
+        return result
+
+
+def _is_egg_path(path):
+    """
+    Determine if given path appears to be an egg.
+    """
+    return _is_zip_egg(path) or _is_unpacked_egg(path)
+
+
+def _is_zip_egg(path):
+    return (
+        path.lower().endswith('.egg') and
+        os.path.isfile(path) and
+        zipfile.is_zipfile(path)
+    )
+
+
+def _is_unpacked_egg(path):
+    """
+    Determine if given path appears to be an unpacked egg.
+    """
+    return (
+        path.lower().endswith('.egg') and
+        os.path.isfile(os.path.join(path, 'EGG-INFO', 'PKG-INFO'))
+    )
+
+
+def _set_parent_ns(packageName):
+    parts = packageName.split('.')
+    name = parts.pop()
+    if parts:
+        parent = '.'.join(parts)
+        setattr(sys.modules[parent], name, sys.modules[packageName])
+
+
+def yield_lines(strs):
+    """Yield non-empty/non-comment lines of a string or sequence"""
+    if isinstance(strs, str):
+        for s in strs.splitlines():
+            s = s.strip()
+            # skip blank lines/comments
+            if s and not s.startswith('#'):
+                yield s
+    else:
+        for ss in strs:
+            for s in yield_lines(ss):
+                yield s
+
+
+MODULE = re.compile(r"\w+(\.\w+)*$").match
+EGG_NAME = re.compile(
+    r"""
+    (?P<name>[^-]+) (
+        -(?P<ver>[^-]+) (
+            -py(?P<pyver>[^-]+) (
+                -(?P<plat>.+)
+            )?
+        )?
+    )?
+    """,
+    re.VERBOSE | re.IGNORECASE,
+).match
+
+
+class EntryPoint:
+    """Object representing an advertised importable object"""
+
+    def __init__(self, name, module_name, attrs=(), extras=(), dist=None):
+        if not MODULE(module_name):
+            raise ValueError("Invalid module name", module_name)
+        self.name = name
+        self.module_name = module_name
+        self.attrs = tuple(attrs)
+        self.extras = tuple(extras)
+        self.dist = dist
+
+    def __str__(self):
+        s = "%s = %s" % (self.name, self.module_name)
+        if self.attrs:
+            s += ':' + '.'.join(self.attrs)
+        if self.extras:
+            s += ' [%s]' % ','.join(self.extras)
+        return s
+
+    def __repr__(self):
+        return "EntryPoint.parse(%r)" % str(self)
+
+    def load(self, require=True, *args, **kwargs):
+        """
+        Require packages for this EntryPoint, then resolve it.
+        """
+        if not require or args or kwargs:
+            warnings.warn(
+                "Parameters to load are deprecated.  Call .resolve and "
+                ".require separately.",
+                PkgResourcesDeprecationWarning,
+                stacklevel=2,
+            )
+        if require:
+            self.require(*args, **kwargs)
+        return self.resolve()
+
+    def resolve(self):
+        """
+        Resolve the entry point from its module and attrs.
+        """
+        module = __import__(self.module_name, fromlist=['__name__'], level=0)
+        try:
+            return functools.reduce(getattr, self.attrs, module)
+        except AttributeError as exc:
+            raise ImportError(str(exc)) from exc
+
+    def require(self, env=None, installer=None):
+        if self.extras and not self.dist:
+            raise UnknownExtra("Can't require() without a distribution", self)
+
+        # Get the requirements for this entry point with all its extras and
+        # then resolve them. We have to pass `extras` along when resolving so
+        # that the working set knows what extras we want. Otherwise, for
+        # dist-info distributions, the working set will assume that the
+        # requirements for that extra are purely optional and skip over them.
+        reqs = self.dist.requires(self.extras)
+        items = working_set.resolve(reqs, env, installer, extras=self.extras)
+        list(map(working_set.add, items))
+
+    pattern = re.compile(
+        r'\s*'
+        r'(?P<name>.+?)\s*'
+        r'=\s*'
+        r'(?P<module>[\w.]+)\s*'
+        r'(:\s*(?P<attr>[\w.]+))?\s*'
+        r'(?P<extras>\[.*\])?\s*$'
+    )
+
+    @classmethod
+    def parse(cls, src, dist=None):
+        """Parse a single entry point from string `src`
+
+        Entry point syntax follows the form::
+
+            name = some.module:some.attr [extra1, extra2]
+
+        The entry name and module name are required, but the ``:attrs`` and
+        ``[extras]`` parts are optional
+        """
+        m = cls.pattern.match(src)
+        if not m:
+            msg = "EntryPoint must be in 'name=module:attrs [extras]' format"
+            raise ValueError(msg, src)
+        res = m.groupdict()
+        extras = cls._parse_extras(res['extras'])
+        attrs = res['attr'].split('.') if res['attr'] else ()
+        return cls(res['name'], res['module'], attrs, extras, dist)
+
+    @classmethod
+    def _parse_extras(cls, extras_spec):
+        if not extras_spec:
+            return ()
+        req = Requirement.parse('x' + extras_spec)
+        if req.specs:
+            raise ValueError()
+        return req.extras
+
+    @classmethod
+    def parse_group(cls, group, lines, dist=None):
+        """Parse an entry point group"""
+        if not MODULE(group):
+            raise ValueError("Invalid group name", group)
+        this = {}
+        for line in yield_lines(lines):
+            ep = cls.parse(line, dist)
+            if ep.name in this:
+                raise ValueError("Duplicate entry point", group, ep.name)
+            this[ep.name] = ep
+        return this
+
+    @classmethod
+    def parse_map(cls, data, dist=None):
+        """Parse a map of entry point groups"""
+        if isinstance(data, dict):
+            data = data.items()
+        else:
+            data = split_sections(data)
+        maps = {}
+        for group, lines in data:
+            if group is None:
+                if not lines:
+                    continue
+                raise ValueError("Entry points must be listed in groups")
+            group = group.strip()
+            if group in maps:
+                raise ValueError("Duplicate group name", group)
+            maps[group] = cls.parse_group(group, lines, dist)
+        return maps
+
+
+def _version_from_file(lines):
+    """
+    Given an iterable of lines from a Metadata file, return
+    the value of the Version field, if present, or None otherwise.
+    """
+    def is_version_line(line):
+        return line.lower().startswith('version:')
+    version_lines = filter(is_version_line, lines)
+    line = next(iter(version_lines), '')
+    _, _, value = line.partition(':')
+    return safe_version(value.strip()) or None
+
+
+class Distribution:
+    """Wrap an actual or potential sys.path entry w/metadata"""
+    PKG_INFO = 'PKG-INFO'
+
+    def __init__(
+            self, location=None, metadata=None, project_name=None,
+            version=None, py_version=PY_MAJOR, platform=None,
+            precedence=EGG_DIST):
+        self.project_name = safe_name(project_name or 'Unknown')
+        if version is not None:
+            self._version = safe_version(version)
+        self.py_version = py_version
+        self.platform = platform
+        self.location = location
+        self.precedence = precedence
+        self._provider = metadata or empty_provider
+
+    @classmethod
+    def from_location(cls, location, basename, metadata=None, **kw):
+        project_name, version, py_version, platform = [None] * 4
+        basename, ext = os.path.splitext(basename)
+        if ext.lower() in _distributionImpl:
+            cls = _distributionImpl[ext.lower()]
+
+            match = EGG_NAME(basename)
+            if match:
+                project_name, version, py_version, platform = match.group(
+                    'name', 'ver', 'pyver', 'plat'
+                )
+        return cls(
+            location, metadata, project_name=project_name, version=version,
+            py_version=py_version, platform=platform, **kw
+        )._reload_version()
+
+    def _reload_version(self):
+        return self
+
+    @property
+    def hashcmp(self):
+        return (
+            self.parsed_version,
+            self.precedence,
+            self.key,
+            self.location,
+            self.py_version or '',
+            self.platform or '',
+        )
+
+    def __hash__(self):
+        return hash(self.hashcmp)
+
+    def __lt__(self, other):
+        return self.hashcmp < other.hashcmp
+
+    def __le__(self, other):
+        return self.hashcmp <= other.hashcmp
+
+    def __gt__(self, other):
+        return self.hashcmp > other.hashcmp
+
+    def __ge__(self, other):
+        return self.hashcmp >= other.hashcmp
+
+    def __eq__(self, other):
+        if not isinstance(other, self.__class__):
+            # It's not a Distribution, so they are not equal
+            return False
+        return self.hashcmp == other.hashcmp
+
+    def __ne__(self, other):
+        return not self == other
+
+    # These properties have to be lazy so that we don't have to load any
+    # metadata until/unless it's actually needed.  (i.e., some distributions
+    # may not know their name or version without loading PKG-INFO)
+
+    @property
+    def key(self):
+        try:
+            return self._key
+        except AttributeError:
+            self._key = key = self.project_name.lower()
+            return key
+
+    @property
+    def parsed_version(self):
+        if not hasattr(self, "_parsed_version"):
+            self._parsed_version = parse_version(self.version)
+
+        return self._parsed_version
+
+    def _warn_legacy_version(self):
+        LV = packaging.version.LegacyVersion
+        is_legacy = isinstance(self._parsed_version, LV)
+        if not is_legacy:
+            return
+
+        # While an empty version is technically a legacy version and
+        # is not a valid PEP 440 version, it's also unlikely to
+        # actually come from someone and instead it is more likely that
+        # it comes from setuptools attempting to parse a filename and
+        # including it in the list. So for that we'll gate this warning
+        # on if the version is anything at all or not.
+        if not self.version:
+            return
+
+        tmpl = textwrap.dedent("""
+            '{project_name} ({version})' is being parsed as a legacy,
+            non PEP 440,
+            version. You may find odd behavior and sort order.
+            In particular it will be sorted as less than 0.0. It
+            is recommended to migrate to PEP 440 compatible
+            versions.
+            """).strip().replace('\n', ' ')
+
+        warnings.warn(tmpl.format(**vars(self)), PEP440Warning)
+
+    @property
+    def version(self):
+        try:
+            return self._version
+        except AttributeError as e:
+            version = self._get_version()
+            if version is None:
+                path = self._get_metadata_path_for_display(self.PKG_INFO)
+                msg = (
+                    "Missing 'Version:' header and/or {} file at path: {}"
+                ).format(self.PKG_INFO, path)
+                raise ValueError(msg, self) from e
+
+            return version
+
+    @property
+    def _dep_map(self):
+        """
+        A map of extra to its list of (direct) requirements
+        for this distribution, including the null extra.
+        """
+        try:
+            return self.__dep_map
+        except AttributeError:
+            self.__dep_map = self._filter_extras(self._build_dep_map())
+        return self.__dep_map
+
+    @staticmethod
+    def _filter_extras(dm):
+        """
+        Given a mapping of extras to dependencies, strip off
+        environment markers and filter out any dependencies
+        not matching the markers.
+        """
+        for extra in list(filter(None, dm)):
+            new_extra = extra
+            reqs = dm.pop(extra)
+            new_extra, _, marker = extra.partition(':')
+            fails_marker = marker and (
+                invalid_marker(marker)
+                or not evaluate_marker(marker)
+            )
+            if fails_marker:
+                reqs = []
+            new_extra = safe_extra(new_extra) or None
+
+            dm.setdefault(new_extra, []).extend(reqs)
+        return dm
+
+    def _build_dep_map(self):
+        dm = {}
+        for name in 'requires.txt', 'depends.txt':
+            for extra, reqs in split_sections(self._get_metadata(name)):
+                dm.setdefault(extra, []).extend(parse_requirements(reqs))
+        return dm
+
+    def requires(self, extras=()):
+        """List of Requirements needed for this distro if `extras` are used"""
+        dm = self._dep_map
+        deps = []
+        deps.extend(dm.get(None, ()))
+        for ext in extras:
+            try:
+                deps.extend(dm[safe_extra(ext)])
+            except KeyError as e:
+                raise UnknownExtra(
+                    "%s has no such extra feature %r" % (self, ext)
+                ) from e
+        return deps
+
+    def _get_metadata_path_for_display(self, name):
+        """
+        Return the path to the given metadata file, if available.
+        """
+        try:
+            # We need to access _get_metadata_path() on the provider object
+            # directly rather than through this class's __getattr__()
+            # since _get_metadata_path() is marked private.
+            path = self._provider._get_metadata_path(name)
+
+        # Handle exceptions e.g. in case the distribution's metadata
+        # provider doesn't support _get_metadata_path().
+        except Exception:
+            return '[could not detect]'
+
+        return path
+
+    def _get_metadata(self, name):
+        if self.has_metadata(name):
+            for line in self.get_metadata_lines(name):
+                yield line
+
+    def _get_version(self):
+        lines = self._get_metadata(self.PKG_INFO)
+        version = _version_from_file(lines)
+
+        return version
+
+    def activate(self, path=None, replace=False):
+        """Ensure distribution is importable on `path` (default=sys.path)"""
+        if path is None:
+            path = sys.path
+        self.insert_on(path, replace=replace)
+        if path is sys.path:
+            fixup_namespace_packages(self.location)
+            for pkg in self._get_metadata('namespace_packages.txt'):
+                if pkg in sys.modules:
+                    declare_namespace(pkg)
+
+    def egg_name(self):
+        """Return what this distribution's standard .egg filename should be"""
+        filename = "%s-%s-py%s" % (
+            to_filename(self.project_name), to_filename(self.version),
+            self.py_version or PY_MAJOR
+        )
+
+        if self.platform:
+            filename += '-' + self.platform
+        return filename
+
+    def __repr__(self):
+        if self.location:
+            return "%s (%s)" % (self, self.location)
+        else:
+            return str(self)
+
+    def __str__(self):
+        try:
+            version = getattr(self, 'version', None)
+        except ValueError:
+            version = None
+        version = version or "[unknown version]"
+        return "%s %s" % (self.project_name, version)
+
+    def __getattr__(self, attr):
+        """Delegate all unrecognized public attributes to .metadata provider"""
+        if attr.startswith('_'):
+            raise AttributeError(attr)
+        return getattr(self._provider, attr)
+
+    def __dir__(self):
+        return list(
+            set(super(Distribution, self).__dir__())
+            | set(
+                attr for attr in self._provider.__dir__()
+                if not attr.startswith('_')
+            )
+        )
+
+    @classmethod
+    def from_filename(cls, filename, metadata=None, **kw):
+        return cls.from_location(
+            _normalize_cached(filename), os.path.basename(filename), metadata,
+            **kw
+        )
+
+    def as_requirement(self):
+        """Return a ``Requirement`` that matches this distribution exactly"""
+        if isinstance(self.parsed_version, packaging.version.Version):
+            spec = "%s==%s" % (self.project_name, self.parsed_version)
+        else:
+            spec = "%s===%s" % (self.project_name, self.parsed_version)
+
+        return Requirement.parse(spec)
+
+    def load_entry_point(self, group, name):
+        """Return the `name` entry point of `group` or raise ImportError"""
+        ep = self.get_entry_info(group, name)
+        if ep is None:
+            raise ImportError("Entry point %r not found" % ((group, name),))
+        return ep.load()
+
+    def get_entry_map(self, group=None):
+        """Return the entry point map for `group`, or the full entry map"""
+        try:
+            ep_map = self._ep_map
+        except AttributeError:
+            ep_map = self._ep_map = EntryPoint.parse_map(
+                self._get_metadata('entry_points.txt'), self
+            )
+        if group is not None:
+            return ep_map.get(group, {})
+        return ep_map
+
+    def get_entry_info(self, group, name):
+        """Return the EntryPoint object for `group`+`name`, or ``None``"""
+        return self.get_entry_map(group).get(name)
+
+    def insert_on(self, path, loc=None, replace=False):
+        """Ensure self.location is on path
+
+        If replace=False (default):
+            - If location is already in path anywhere, do nothing.
+            - Else:
+              - If it's an egg and its parent directory is on path,
+                insert just ahead of the parent.
+              - Else: add to the end of path.
+        If replace=True:
+            - If location is already on path anywhere (not eggs)
+              or higher priority than its parent (eggs)
+              do nothing.
+            - Else:
+              - If it's an egg and its parent directory is on path,
+                insert just ahead of the parent,
+                removing any lower-priority entries.
+              - Else: add it to the front of path.
+        """
+
+        loc = loc or self.location
+        if not loc:
+            return
+
+        nloc = _normalize_cached(loc)
+        bdir = os.path.dirname(nloc)
+        npath = [(p and _normalize_cached(p) or p) for p in path]
+
+        for p, item in enumerate(npath):
+            if item == nloc:
+                if replace:
+                    break
+                else:
+                    # don't modify path (even removing duplicates) if
+                    # found and not replace
+                    return
+            elif item == bdir and self.precedence == EGG_DIST:
+                # if it's an .egg, give it precedence over its directory
+                # UNLESS it's already been added to sys.path and replace=False
+                if (not replace) and nloc in npath[p:]:
+                    return
+                if path is sys.path:
+                    self.check_version_conflict()
+                path.insert(p, loc)
+                npath.insert(p, nloc)
+                break
+        else:
+            if path is sys.path:
+                self.check_version_conflict()
+            if replace:
+                path.insert(0, loc)
+            else:
+                path.append(loc)
+            return
+
+        # p is the spot where we found or inserted loc; now remove duplicates
+        while True:
+            try:
+                np = npath.index(nloc, p + 1)
+            except ValueError:
+                break
+            else:
+                del npath[np], path[np]
+                # ha!
+                p = np
+
+        return
+
+    def check_version_conflict(self):
+        if self.key == 'setuptools':
+            # ignore the inevitable setuptools self-conflicts  :(
+            return
+
+        nsp = dict.fromkeys(self._get_metadata('namespace_packages.txt'))
+        loc = normalize_path(self.location)
+        for modname in self._get_metadata('top_level.txt'):
+            if (modname not in sys.modules or modname in nsp
+                    or modname in _namespace_packages):
+                continue
+            if modname in ('pkg_resources', 'setuptools', 'site'):
+                continue
+            fn = getattr(sys.modules[modname], '__file__', None)
+            if fn and (normalize_path(fn).startswith(loc) or
+                       fn.startswith(self.location)):
+                continue
+            issue_warning(
+                "Module %s was already imported from %s, but %s is being added"
+                " to sys.path" % (modname, fn, self.location),
+            )
+
+    def has_version(self):
+        try:
+            self.version
+        except ValueError:
+            issue_warning("Unbuilt egg for " + repr(self))
+            return False
+        return True
+
+    def clone(self, **kw):
+        """Copy this distribution, substituting in any changed keyword args"""
+        names = 'project_name version py_version platform location precedence'
+        for attr in names.split():
+            kw.setdefault(attr, getattr(self, attr, None))
+        kw.setdefault('metadata', self._provider)
+        return self.__class__(**kw)
+
+    @property
+    def extras(self):
+        return [dep for dep in self._dep_map if dep]
+
+
+class EggInfoDistribution(Distribution):
+    def _reload_version(self):
+        """
+        Packages installed by distutils (e.g. numpy or scipy),
+        which uses an old safe_version, and so
+        their version numbers can get mangled when
+        converted to filenames (e.g., 1.11.0.dev0+2329eae to
+        1.11.0.dev0_2329eae). These distributions will not be
+        parsed properly
+        downstream by Distribution and safe_version, so
+        take an extra step and try to get the version number from
+        the metadata file itself instead of the filename.
+        """
+        md_version = self._get_version()
+        if md_version:
+            self._version = md_version
+        return self
+
+
+class DistInfoDistribution(Distribution):
+    """
+    Wrap an actual or potential sys.path entry
+    w/metadata, .dist-info style.
+    """
+    PKG_INFO = 'METADATA'
+    EQEQ = re.compile(r"([\(,])\s*(\d.*?)\s*([,\)])")
+
+    @property
+    def _parsed_pkg_info(self):
+        """Parse and cache metadata"""
+        try:
+            return self._pkg_info
+        except AttributeError:
+            metadata = self.get_metadata(self.PKG_INFO)
+            self._pkg_info = email.parser.Parser().parsestr(metadata)
+            return self._pkg_info
+
+    @property
+    def _dep_map(self):
+        try:
+            return self.__dep_map
+        except AttributeError:
+            self.__dep_map = self._compute_dependencies()
+            return self.__dep_map
+
+    def _compute_dependencies(self):
+        """Recompute this distribution's dependencies."""
+        dm = self.__dep_map = {None: []}
+
+        reqs = []
+        # Including any condition expressions
+        for req in self._parsed_pkg_info.get_all('Requires-Dist') or []:
+            reqs.extend(parse_requirements(req))
+
+        def reqs_for_extra(extra):
+            for req in reqs:
+                if not req.marker or req.marker.evaluate({'extra': extra}):
+                    yield req
+
+        common = frozenset(reqs_for_extra(None))
+        dm[None].extend(common)
+
+        for extra in self._parsed_pkg_info.get_all('Provides-Extra') or []:
+            s_extra = safe_extra(extra.strip())
+            dm[s_extra] = list(frozenset(reqs_for_extra(extra)) - common)
+
+        return dm
+
+
+_distributionImpl = {
+    '.egg': Distribution,
+    '.egg-info': EggInfoDistribution,
+    '.dist-info': DistInfoDistribution,
+}
+
+
+def issue_warning(*args, **kw):
+    level = 1
+    g = globals()
+    try:
+        # find the first stack frame that is *not* code in
+        # the pkg_resources module, to use for the warning
+        while sys._getframe(level).f_globals is g:
+            level += 1
+    except ValueError:
+        pass
+    warnings.warn(stacklevel=level + 1, *args, **kw)
+
+
+def parse_requirements(strs):
+    """Yield ``Requirement`` objects for each specification in `strs`
+
+    `strs` must be a string, or a (possibly-nested) iterable thereof.
+    """
+    # create a steppable iterator, so we can handle \-continuations
+    lines = iter(yield_lines(strs))
+
+    for line in lines:
+        # Drop comments -- a hash without a space may be in a URL.
+        if ' #' in line:
+            line = line[:line.find(' #')]
+        # If there is a line continuation, drop it, and append the next line.
+        if line.endswith('\\'):
+            line = line[:-2].strip()
+            try:
+                line += next(lines)
+            except StopIteration:
+                return
+        yield Requirement(line)
+
+
+class RequirementParseError(packaging.requirements.InvalidRequirement):
+    "Compatibility wrapper for InvalidRequirement"
+
+
+class Requirement(packaging.requirements.Requirement):
+    def __init__(self, requirement_string):
+        """DO NOT CALL THIS UNDOCUMENTED METHOD; use Requirement.parse()!"""
+        super(Requirement, self).__init__(requirement_string)
+        self.unsafe_name = self.name
+        project_name = safe_name(self.name)
+        self.project_name, self.key = project_name, project_name.lower()
+        self.specs = [
+            (spec.operator, spec.version) for spec in self.specifier]
+        self.extras = tuple(map(safe_extra, self.extras))
+        self.hashCmp = (
+            self.key,
+            self.url,
+            self.specifier,
+            frozenset(self.extras),
+            str(self.marker) if self.marker else None,
+        )
+        self.__hash = hash(self.hashCmp)
+
+    def __eq__(self, other):
+        return (
+            isinstance(other, Requirement) and
+            self.hashCmp == other.hashCmp
+        )
+
+    def __ne__(self, other):
+        return not self == other
+
+    def __contains__(self, item):
+        if isinstance(item, Distribution):
+            if item.key != self.key:
+                return False
+
+            item = item.version
+
+        # Allow prereleases always in order to match the previous behavior of
+        # this method. In the future this should be smarter and follow PEP 440
+        # more accurately.
+        return self.specifier.contains(item, prereleases=True)
+
+    def __hash__(self):
+        return self.__hash
+
+    def __repr__(self):
+        return "Requirement.parse(%r)" % str(self)
+
+    @staticmethod
+    def parse(s):
+        req, = parse_requirements(s)
+        return req
+
+
+def _always_object(classes):
+    """
+    Ensure object appears in the mro even
+    for old-style classes.
+    """
+    if object not in classes:
+        return classes + (object,)
+    return classes
+
+
+def _find_adapter(registry, ob):
+    """Return an adapter factory for `ob` from `registry`"""
+    types = _always_object(inspect.getmro(getattr(ob, '__class__', type(ob))))
+    for t in types:
+        if t in registry:
+            return registry[t]
+
+
+def ensure_directory(path):
+    """Ensure that the parent directory of `path` exists"""
+    dirname = os.path.dirname(path)
+    os.makedirs(dirname, exist_ok=True)
+
+
+def _bypass_ensure_directory(path):
+    """Sandbox-bypassing version of ensure_directory()"""
+    if not WRITE_SUPPORT:
+        raise IOError('"os.mkdir" not supported on this platform.')
+    dirname, filename = split(path)
+    if dirname and filename and not isdir(dirname):
+        _bypass_ensure_directory(dirname)
+        try:
+            mkdir(dirname, 0o755)
+        except FileExistsError:
+            pass
+
+
+def split_sections(s):
+    """Split a string or iterable thereof into (section, content) pairs
+
+    Each ``section`` is a stripped version of the section header ("[section]")
+    and each ``content`` is a list of stripped lines excluding blank lines and
+    comment-only lines.  If there are any such lines before the first section
+    header, they're returned in a first ``section`` of ``None``.
+    """
+    section = None
+    content = []
+    for line in yield_lines(s):
+        if line.startswith("["):
+            if line.endswith("]"):
+                if section or content:
+                    yield section, content
+                section = line[1:-1].strip()
+                content = []
+            else:
+                raise ValueError("Invalid section heading", line)
+        else:
+            content.append(line)
+
+    # wrap up last segment
+    yield section, content
+
+
+def _mkstemp(*args, **kw):
+    old_open = os.open
+    try:
+        # temporarily bypass sandboxing
+        os.open = os_open
+        return tempfile.mkstemp(*args, **kw)
+    finally:
+        # and then put it back
+        os.open = old_open
+
+
+# Silence the PEP440Warning by default, so that end users don't get hit by it
+# randomly just because they use pkg_resources. We want to append the rule
+# because we want earlier uses of filterwarnings to take precedence over this
+# one.
+warnings.filterwarnings("ignore", category=PEP440Warning, append=True)
+
+
+# from jaraco.functools 1.3
+def _call_aside(f, *args, **kwargs):
+    f(*args, **kwargs)
+    return f
+
+
+@_call_aside
+def _initialize(g=globals()):
+    "Set up global resource manager (deliberately not state-saved)"
+    manager = ResourceManager()
+    g['_manager'] = manager
+    g.update(
+        (name, getattr(manager, name))
+        for name in dir(manager)
+        if not name.startswith('_')
+    )
+
+
+@_call_aside
+def _initialize_master_working_set():
+    """
+    Prepare the master working set and make the ``require()``
+    API available.
+
+    This function has explicit effects on the global state
+    of pkg_resources. It is intended to be invoked once at
+    the initialization of this module.
+
+    Invocation by other packages is unsupported and done
+    at their own risk.
+    """
+    working_set = WorkingSet._build_master()
+    _declare_state('object', working_set=working_set)
+
+    require = working_set.require
+    iter_entry_points = working_set.iter_entry_points
+    add_activation_listener = working_set.subscribe
+    run_script = working_set.run_script
+    # backward compatibility
+    run_main = run_script
+    # Activate all distributions already on sys.path with replace=False and
+    # ensure that all distributions added to the working set in the future
+    # (e.g. by calling ``require()``) will get activated as well,
+    # with higher priority (replace=True).
+    tuple(
+        dist.activate(replace=False)
+        for dist in working_set
+    )
+    add_activation_listener(
+        lambda dist: dist.activate(replace=True),
+        existing=False,
+    )
+    working_set.entries = []
+    # match order
+    list(map(working_set.add_entry, sys.path))
+    globals().update(locals())
+
+
+class PkgResourcesDeprecationWarning(Warning):
+    """
+    Base class for warning about deprecations in ``pkg_resources``
+
+    This class is not derived from ``DeprecationWarning``, and as such is
+    visible by default.
+    """
diff --git a/venv/Lib/site-packages/pkg_resources/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..c0df0ec91
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/__init__.py b/venv/Lib/site-packages/pkg_resources/_vendor/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..c6afe0821
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/appdirs.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/appdirs.cpython-36.pyc
new file mode 100644
index 000000000..fa307054c
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/appdirs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/pyparsing.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/pyparsing.cpython-36.pyc
new file mode 100644
index 000000000..12dc3adfc
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/__pycache__/pyparsing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/appdirs.py b/venv/Lib/site-packages/pkg_resources/_vendor/appdirs.py
new file mode 100644
index 000000000..ae67001af
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/appdirs.py
@@ -0,0 +1,608 @@
+#!/usr/bin/env python
+# -*- coding: utf-8 -*-
+# Copyright (c) 2005-2010 ActiveState Software Inc.
+# Copyright (c) 2013 Eddy Petrișor
+
+"""Utilities for determining application-specific dirs.
+
+See <http://github.com/ActiveState/appdirs> for details and usage.
+"""
+# Dev Notes:
+# - MSDN on where to store app data files:
+#   http://support.microsoft.com/default.aspx?scid=kb;en-us;310294#XSLTH3194121123120121120120
+# - Mac OS X: http://developer.apple.com/documentation/MacOSX/Conceptual/BPFileSystem/index.html
+# - XDG spec for Un*x: http://standards.freedesktop.org/basedir-spec/basedir-spec-latest.html
+
+__version_info__ = (1, 4, 3)
+__version__ = '.'.join(map(str, __version_info__))
+
+
+import sys
+import os
+
+PY3 = sys.version_info[0] == 3
+
+if PY3:
+    unicode = str
+
+if sys.platform.startswith('java'):
+    import platform
+    os_name = platform.java_ver()[3][0]
+    if os_name.startswith('Windows'): # "Windows XP", "Windows 7", etc.
+        system = 'win32'
+    elif os_name.startswith('Mac'): # "Mac OS X", etc.
+        system = 'darwin'
+    else: # "Linux", "SunOS", "FreeBSD", etc.
+        # Setting this to "linux2" is not ideal, but only Windows or Mac
+        # are actually checked for and the rest of the module expects
+        # *sys.platform* style strings.
+        system = 'linux2'
+else:
+    system = sys.platform
+
+
+
+def user_data_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user data directories are:
+        Mac OS X:               ~/Library/Application Support/<AppName>
+        Unix:                   ~/.local/share/<AppName>    # or in $XDG_DATA_HOME, if defined
+        Win XP (not roaming):   C:\Documents and Settings\<username>\Application Data\<AppAuthor>\<AppName>
+        Win XP (roaming):       C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>
+        Win 7  (not roaming):   C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>
+        Win 7  (roaming):       C:\Users\<username>\AppData\Roaming\<AppAuthor>\<AppName>
+
+    For Unix, we follow the XDG spec and support $XDG_DATA_HOME.
+    That means, by default "~/.local/share/<AppName>".
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        const = roaming and "CSIDL_APPDATA" or "CSIDL_LOCAL_APPDATA"
+        path = os.path.normpath(_get_win_folder(const))
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+    elif system == 'darwin':
+        path = os.path.expanduser('~/Library/Application Support/')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        path = os.getenv('XDG_DATA_HOME', os.path.expanduser("~/.local/share"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def site_data_dir(appname=None, appauthor=None, version=None, multipath=False):
+    r"""Return full path to the user-shared data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "multipath" is an optional parameter only applicable to *nix
+            which indicates that the entire list of data dirs should be
+            returned. By default, the first item from XDG_DATA_DIRS is
+            returned, or '/usr/local/share/<AppName>',
+            if XDG_DATA_DIRS is not set
+
+    Typical site data directories are:
+        Mac OS X:   /Library/Application Support/<AppName>
+        Unix:       /usr/local/share/<AppName> or /usr/share/<AppName>
+        Win XP:     C:\Documents and Settings\All Users\Application Data\<AppAuthor>\<AppName>
+        Vista:      (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
+        Win 7:      C:\ProgramData\<AppAuthor>\<AppName>   # Hidden, but writeable on Win 7.
+
+    For Unix, this is using the $XDG_DATA_DIRS[0] default.
+
+    WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        path = os.path.normpath(_get_win_folder("CSIDL_COMMON_APPDATA"))
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+    elif system == 'darwin':
+        path = os.path.expanduser('/Library/Application Support')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        # XDG default for $XDG_DATA_DIRS
+        # only first, if multipath is False
+        path = os.getenv('XDG_DATA_DIRS',
+                         os.pathsep.join(['/usr/local/share', '/usr/share']))
+        pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep)]
+        if appname:
+            if version:
+                appname = os.path.join(appname, version)
+            pathlist = [os.sep.join([x, appname]) for x in pathlist]
+
+        if multipath:
+            path = os.pathsep.join(pathlist)
+        else:
+            path = pathlist[0]
+        return path
+
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_config_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific config dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user config directories are:
+        Mac OS X:               same as user_data_dir
+        Unix:                   ~/.config/<AppName>     # or in $XDG_CONFIG_HOME, if defined
+        Win *:                  same as user_data_dir
+
+    For Unix, we follow the XDG spec and support $XDG_CONFIG_HOME.
+    That means, by default "~/.config/<AppName>".
+    """
+    if system in ["win32", "darwin"]:
+        path = user_data_dir(appname, appauthor, None, roaming)
+    else:
+        path = os.getenv('XDG_CONFIG_HOME', os.path.expanduser("~/.config"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def site_config_dir(appname=None, appauthor=None, version=None, multipath=False):
+    r"""Return full path to the user-shared data dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "multipath" is an optional parameter only applicable to *nix
+            which indicates that the entire list of config dirs should be
+            returned. By default, the first item from XDG_CONFIG_DIRS is
+            returned, or '/etc/xdg/<AppName>', if XDG_CONFIG_DIRS is not set
+
+    Typical site config directories are:
+        Mac OS X:   same as site_data_dir
+        Unix:       /etc/xdg/<AppName> or $XDG_CONFIG_DIRS[i]/<AppName> for each value in
+                    $XDG_CONFIG_DIRS
+        Win *:      same as site_data_dir
+        Vista:      (Fail! "C:\ProgramData" is a hidden *system* directory on Vista.)
+
+    For Unix, this is using the $XDG_CONFIG_DIRS[0] default, if multipath=False
+
+    WARNING: Do not use this on Windows. See the Vista-Fail note above for why.
+    """
+    if system in ["win32", "darwin"]:
+        path = site_data_dir(appname, appauthor)
+        if appname and version:
+            path = os.path.join(path, version)
+    else:
+        # XDG default for $XDG_CONFIG_DIRS
+        # only first, if multipath is False
+        path = os.getenv('XDG_CONFIG_DIRS', '/etc/xdg')
+        pathlist = [os.path.expanduser(x.rstrip(os.sep)) for x in path.split(os.pathsep)]
+        if appname:
+            if version:
+                appname = os.path.join(appname, version)
+            pathlist = [os.sep.join([x, appname]) for x in pathlist]
+
+        if multipath:
+            path = os.pathsep.join(pathlist)
+        else:
+            path = pathlist[0]
+    return path
+
+
+def user_cache_dir(appname=None, appauthor=None, version=None, opinion=True):
+    r"""Return full path to the user-specific cache dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "opinion" (boolean) can be False to disable the appending of
+            "Cache" to the base app data dir for Windows. See
+            discussion below.
+
+    Typical user cache directories are:
+        Mac OS X:   ~/Library/Caches/<AppName>
+        Unix:       ~/.cache/<AppName> (XDG default)
+        Win XP:     C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Cache
+        Vista:      C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Cache
+
+    On Windows the only suggestion in the MSDN docs is that local settings go in
+    the `CSIDL_LOCAL_APPDATA` directory. This is identical to the non-roaming
+    app data dir (the default returned by `user_data_dir` above). Apps typically
+    put cache data somewhere *under* the given dir here. Some examples:
+        ...\Mozilla\Firefox\Profiles\<ProfileName>\Cache
+        ...\Acme\SuperApp\Cache\1.0
+    OPINION: This function appends "Cache" to the `CSIDL_LOCAL_APPDATA` value.
+    This can be disabled with the `opinion=False` option.
+    """
+    if system == "win32":
+        if appauthor is None:
+            appauthor = appname
+        path = os.path.normpath(_get_win_folder("CSIDL_LOCAL_APPDATA"))
+        if appname:
+            if appauthor is not False:
+                path = os.path.join(path, appauthor, appname)
+            else:
+                path = os.path.join(path, appname)
+            if opinion:
+                path = os.path.join(path, "Cache")
+    elif system == 'darwin':
+        path = os.path.expanduser('~/Library/Caches')
+        if appname:
+            path = os.path.join(path, appname)
+    else:
+        path = os.getenv('XDG_CACHE_HOME', os.path.expanduser('~/.cache'))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_state_dir(appname=None, appauthor=None, version=None, roaming=False):
+    r"""Return full path to the user-specific state dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "roaming" (boolean, default False) can be set True to use the Windows
+            roaming appdata directory. That means that for users on a Windows
+            network setup for roaming profiles, this user data will be
+            sync'd on login. See
+            <http://technet.microsoft.com/en-us/library/cc766489(WS.10).aspx>
+            for a discussion of issues.
+
+    Typical user state directories are:
+        Mac OS X:  same as user_data_dir
+        Unix:      ~/.local/state/<AppName>   # or in $XDG_STATE_HOME, if defined
+        Win *:     same as user_data_dir
+
+    For Unix, we follow this Debian proposal <https://wiki.debian.org/XDGBaseDirectorySpecification#state>
+    to extend the XDG spec and support $XDG_STATE_HOME.
+
+    That means, by default "~/.local/state/<AppName>".
+    """
+    if system in ["win32", "darwin"]:
+        path = user_data_dir(appname, appauthor, None, roaming)
+    else:
+        path = os.getenv('XDG_STATE_HOME', os.path.expanduser("~/.local/state"))
+        if appname:
+            path = os.path.join(path, appname)
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+def user_log_dir(appname=None, appauthor=None, version=None, opinion=True):
+    r"""Return full path to the user-specific log dir for this application.
+
+        "appname" is the name of application.
+            If None, just the system directory is returned.
+        "appauthor" (only used on Windows) is the name of the
+            appauthor or distributing body for this application. Typically
+            it is the owning company name. This falls back to appname. You may
+            pass False to disable it.
+        "version" is an optional version path element to append to the
+            path. You might want to use this if you want multiple versions
+            of your app to be able to run independently. If used, this
+            would typically be "<major>.<minor>".
+            Only applied when appname is present.
+        "opinion" (boolean) can be False to disable the appending of
+            "Logs" to the base app data dir for Windows, and "log" to the
+            base cache dir for Unix. See discussion below.
+
+    Typical user log directories are:
+        Mac OS X:   ~/Library/Logs/<AppName>
+        Unix:       ~/.cache/<AppName>/log  # or under $XDG_CACHE_HOME if defined
+        Win XP:     C:\Documents and Settings\<username>\Local Settings\Application Data\<AppAuthor>\<AppName>\Logs
+        Vista:      C:\Users\<username>\AppData\Local\<AppAuthor>\<AppName>\Logs
+
+    On Windows the only suggestion in the MSDN docs is that local settings
+    go in the `CSIDL_LOCAL_APPDATA` directory. (Note: I'm interested in
+    examples of what some windows apps use for a logs dir.)
+
+    OPINION: This function appends "Logs" to the `CSIDL_LOCAL_APPDATA`
+    value for Windows and appends "log" to the user cache dir for Unix.
+    This can be disabled with the `opinion=False` option.
+    """
+    if system == "darwin":
+        path = os.path.join(
+            os.path.expanduser('~/Library/Logs'),
+            appname)
+    elif system == "win32":
+        path = user_data_dir(appname, appauthor, version)
+        version = False
+        if opinion:
+            path = os.path.join(path, "Logs")
+    else:
+        path = user_cache_dir(appname, appauthor, version)
+        version = False
+        if opinion:
+            path = os.path.join(path, "log")
+    if appname and version:
+        path = os.path.join(path, version)
+    return path
+
+
+class AppDirs(object):
+    """Convenience wrapper for getting application dirs."""
+    def __init__(self, appname=None, appauthor=None, version=None,
+            roaming=False, multipath=False):
+        self.appname = appname
+        self.appauthor = appauthor
+        self.version = version
+        self.roaming = roaming
+        self.multipath = multipath
+
+    @property
+    def user_data_dir(self):
+        return user_data_dir(self.appname, self.appauthor,
+                             version=self.version, roaming=self.roaming)
+
+    @property
+    def site_data_dir(self):
+        return site_data_dir(self.appname, self.appauthor,
+                             version=self.version, multipath=self.multipath)
+
+    @property
+    def user_config_dir(self):
+        return user_config_dir(self.appname, self.appauthor,
+                               version=self.version, roaming=self.roaming)
+
+    @property
+    def site_config_dir(self):
+        return site_config_dir(self.appname, self.appauthor,
+                             version=self.version, multipath=self.multipath)
+
+    @property
+    def user_cache_dir(self):
+        return user_cache_dir(self.appname, self.appauthor,
+                              version=self.version)
+
+    @property
+    def user_state_dir(self):
+        return user_state_dir(self.appname, self.appauthor,
+                              version=self.version)
+
+    @property
+    def user_log_dir(self):
+        return user_log_dir(self.appname, self.appauthor,
+                            version=self.version)
+
+
+#---- internal support stuff
+
+def _get_win_folder_from_registry(csidl_name):
+    """This is a fallback technique at best. I'm not sure if using the
+    registry for this guarantees us the correct answer for all CSIDL_*
+    names.
+    """
+    if PY3:
+      import winreg as _winreg
+    else:
+      import _winreg
+
+    shell_folder_name = {
+        "CSIDL_APPDATA": "AppData",
+        "CSIDL_COMMON_APPDATA": "Common AppData",
+        "CSIDL_LOCAL_APPDATA": "Local AppData",
+    }[csidl_name]
+
+    key = _winreg.OpenKey(
+        _winreg.HKEY_CURRENT_USER,
+        r"Software\Microsoft\Windows\CurrentVersion\Explorer\Shell Folders"
+    )
+    dir, type = _winreg.QueryValueEx(key, shell_folder_name)
+    return dir
+
+
+def _get_win_folder_with_pywin32(csidl_name):
+    from win32com.shell import shellcon, shell
+    dir = shell.SHGetFolderPath(0, getattr(shellcon, csidl_name), 0, 0)
+    # Try to make this a unicode path because SHGetFolderPath does
+    # not return unicode strings when there is unicode data in the
+    # path.
+    try:
+        dir = unicode(dir)
+
+        # Downgrade to short path name if have highbit chars. See
+        # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+        has_high_char = False
+        for c in dir:
+            if ord(c) > 255:
+                has_high_char = True
+                break
+        if has_high_char:
+            try:
+                import win32api
+                dir = win32api.GetShortPathName(dir)
+            except ImportError:
+                pass
+    except UnicodeError:
+        pass
+    return dir
+
+
+def _get_win_folder_with_ctypes(csidl_name):
+    import ctypes
+
+    csidl_const = {
+        "CSIDL_APPDATA": 26,
+        "CSIDL_COMMON_APPDATA": 35,
+        "CSIDL_LOCAL_APPDATA": 28,
+    }[csidl_name]
+
+    buf = ctypes.create_unicode_buffer(1024)
+    ctypes.windll.shell32.SHGetFolderPathW(None, csidl_const, None, 0, buf)
+
+    # Downgrade to short path name if have highbit chars. See
+    # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+    has_high_char = False
+    for c in buf:
+        if ord(c) > 255:
+            has_high_char = True
+            break
+    if has_high_char:
+        buf2 = ctypes.create_unicode_buffer(1024)
+        if ctypes.windll.kernel32.GetShortPathNameW(buf.value, buf2, 1024):
+            buf = buf2
+
+    return buf.value
+
+def _get_win_folder_with_jna(csidl_name):
+    import array
+    from com.sun import jna
+    from com.sun.jna.platform import win32
+
+    buf_size = win32.WinDef.MAX_PATH * 2
+    buf = array.zeros('c', buf_size)
+    shell = win32.Shell32.INSTANCE
+    shell.SHGetFolderPath(None, getattr(win32.ShlObj, csidl_name), None, win32.ShlObj.SHGFP_TYPE_CURRENT, buf)
+    dir = jna.Native.toString(buf.tostring()).rstrip("\0")
+
+    # Downgrade to short path name if have highbit chars. See
+    # <http://bugs.activestate.com/show_bug.cgi?id=85099>.
+    has_high_char = False
+    for c in dir:
+        if ord(c) > 255:
+            has_high_char = True
+            break
+    if has_high_char:
+        buf = array.zeros('c', buf_size)
+        kernel = win32.Kernel32.INSTANCE
+        if kernel.GetShortPathName(dir, buf, buf_size):
+            dir = jna.Native.toString(buf.tostring()).rstrip("\0")
+
+    return dir
+
+if system == "win32":
+    try:
+        import win32com.shell
+        _get_win_folder = _get_win_folder_with_pywin32
+    except ImportError:
+        try:
+            from ctypes import windll
+            _get_win_folder = _get_win_folder_with_ctypes
+        except ImportError:
+            try:
+                import com.sun.jna
+                _get_win_folder = _get_win_folder_with_jna
+            except ImportError:
+                _get_win_folder = _get_win_folder_from_registry
+
+
+#---- self test code
+
+if __name__ == "__main__":
+    appname = "MyApp"
+    appauthor = "MyCompany"
+
+    props = ("user_data_dir",
+             "user_config_dir",
+             "user_cache_dir",
+             "user_state_dir",
+             "user_log_dir",
+             "site_data_dir",
+             "site_config_dir")
+
+    print("-- app dirs %s --" % __version__)
+
+    print("-- app dirs (with optional 'version')")
+    dirs = AppDirs(appname, appauthor, version="1.0")
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (without optional 'version')")
+    dirs = AppDirs(appname, appauthor)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (without optional 'appauthor')")
+    dirs = AppDirs(appname)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
+
+    print("\n-- app dirs (with disabled 'appauthor')")
+    dirs = AppDirs(appname, appauthor=False)
+    for prop in props:
+        print("%s: %s" % (prop, getattr(dirs, prop)))
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__about__.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__about__.py
new file mode 100644
index 000000000..4d998578d
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__about__.py
@@ -0,0 +1,27 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
+
+__title__ = "packaging"
+__summary__ = "Core utilities for Python packages"
+__uri__ = "https://github.com/pypa/packaging"
+
+__version__ = "20.4"
+
+__author__ = "Donald Stufft and individual contributors"
+__email__ = "donald@stufft.io"
+
+__license__ = "BSD-2-Clause or Apache-2.0"
+__copyright__ = "Copyright 2014-2019 %s" % __author__
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__init__.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__init__.py
new file mode 100644
index 000000000..a0cf67df5
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__init__.py
@@ -0,0 +1,26 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+from .__about__ import (
+    __author__,
+    __copyright__,
+    __email__,
+    __license__,
+    __summary__,
+    __title__,
+    __uri__,
+    __version__,
+)
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__about__.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__about__.cpython-36.pyc
new file mode 100644
index 000000000..7c43e8086
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__about__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..6cfe55ae1
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_compat.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_compat.cpython-36.pyc
new file mode 100644
index 000000000..0c77d0128
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_structures.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_structures.cpython-36.pyc
new file mode 100644
index 000000000..1f1083a13
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_structures.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_typing.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_typing.cpython-36.pyc
new file mode 100644
index 000000000..410ee624f
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/_typing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/markers.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/markers.cpython-36.pyc
new file mode 100644
index 000000000..2a1a68e73
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/markers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/requirements.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/requirements.cpython-36.pyc
new file mode 100644
index 000000000..f8042109c
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/requirements.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc
new file mode 100644
index 000000000..821e37998
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/tags.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/tags.cpython-36.pyc
new file mode 100644
index 000000000..8717de1e2
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/tags.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..a900257ad
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..bfea761dc
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_compat.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_compat.py
new file mode 100644
index 000000000..e54bd4ede
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_compat.py
@@ -0,0 +1,38 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import sys
+
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Dict, Tuple, Type
+
+
+PY2 = sys.version_info[0] == 2
+PY3 = sys.version_info[0] == 3
+
+# flake8: noqa
+
+if PY3:
+    string_types = (str,)
+else:
+    string_types = (basestring,)
+
+
+def with_metaclass(meta, *bases):
+    # type: (Type[Any], Tuple[Type[Any], ...]) -> Any
+    """
+    Create a base class with a metaclass.
+    """
+    # This requires a bit of explanation: the basic idea is to make a dummy
+    # metaclass for one level of class instantiation that replaces itself with
+    # the actual metaclass.
+    class metaclass(meta):  # type: ignore
+        def __new__(cls, name, this_bases, d):
+            # type: (Type[Any], str, Tuple[Any], Dict[Any, Any]) -> Any
+            return meta(name, bases, d)
+
+    return type.__new__(metaclass, "temporary_class", (), {})
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_structures.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_structures.py
new file mode 100644
index 000000000..800d5c558
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_structures.py
@@ -0,0 +1,86 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+
+class InfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __neg__(self):
+        # type: (object) -> NegativeInfinityType
+        return NegativeInfinity
+
+
+Infinity = InfinityType()
+
+
+class NegativeInfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "-Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __neg__(self):
+        # type: (object) -> InfinityType
+        return Infinity
+
+
+NegativeInfinity = NegativeInfinityType()
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_typing.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_typing.py
new file mode 100644
index 000000000..77a8b9185
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/_typing.py
@@ -0,0 +1,48 @@
+"""For neatly implementing static typing in packaging.
+
+`mypy` - the static type analysis tool we use - uses the `typing` module, which
+provides core functionality fundamental to mypy's functioning.
+
+Generally, `typing` would be imported at runtime and used in that fashion -
+it acts as a no-op at runtime and does not have any run-time overhead by
+design.
+
+As it turns out, `typing` is not vendorable - it uses separate sources for
+Python 2/Python 3. Thus, this codebase can not expect it to be present.
+To work around this, mypy allows the typing import to be behind a False-y
+optional to prevent it from running at runtime and type-comments can be used
+to remove the need for the types to be accessible directly during runtime.
+
+This module provides the False-y guard in a nicely named fashion so that a
+curious maintainer can reach here to read this.
+
+In packaging, all static-typing related imports should be guarded as follows:
+
+    from packaging._typing import TYPE_CHECKING
+
+    if TYPE_CHECKING:
+        from typing import ...
+
+Ref: https://github.com/python/mypy/issues/3216
+"""
+
+__all__ = ["TYPE_CHECKING", "cast"]
+
+# The TYPE_CHECKING constant defined by the typing module is False at runtime
+# but True while type checking.
+if False:  # pragma: no cover
+    from typing import TYPE_CHECKING
+else:
+    TYPE_CHECKING = False
+
+# typing's cast syntax requires calling typing.cast at runtime, but we don't
+# want to import typing at runtime. Here, we inform the type checkers that
+# we're importing `typing.cast` as `cast` and re-implement typing.cast's
+# runtime behavior in a block that is ignored by type checkers.
+if TYPE_CHECKING:  # pragma: no cover
+    # not executed at runtime
+    from typing import cast
+else:
+    # executed at runtime
+    def cast(type_, value):  # noqa
+        return value
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/markers.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/markers.py
new file mode 100644
index 000000000..fd1559c10
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/markers.py
@@ -0,0 +1,328 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import operator
+import os
+import platform
+import sys
+
+from pkg_resources.extern.pyparsing import ParseException, ParseResults, stringStart, stringEnd
+from pkg_resources.extern.pyparsing import ZeroOrMore, Group, Forward, QuotedString
+from pkg_resources.extern.pyparsing import Literal as L  # noqa
+
+from ._compat import string_types
+from ._typing import TYPE_CHECKING
+from .specifiers import Specifier, InvalidSpecifier
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Callable, Dict, List, Optional, Tuple, Union
+
+    Operator = Callable[[str, str], bool]
+
+
+__all__ = [
+    "InvalidMarker",
+    "UndefinedComparison",
+    "UndefinedEnvironmentName",
+    "Marker",
+    "default_environment",
+]
+
+
+class InvalidMarker(ValueError):
+    """
+    An invalid marker was found, users should refer to PEP 508.
+    """
+
+
+class UndefinedComparison(ValueError):
+    """
+    An invalid operation was attempted on a value that doesn't support it.
+    """
+
+
+class UndefinedEnvironmentName(ValueError):
+    """
+    A name was attempted to be used that does not exist inside of the
+    environment.
+    """
+
+
+class Node(object):
+    def __init__(self, value):
+        # type: (Any) -> None
+        self.value = value
+
+    def __str__(self):
+        # type: () -> str
+        return str(self.value)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{0}({1!r})>".format(self.__class__.__name__, str(self))
+
+    def serialize(self):
+        # type: () -> str
+        raise NotImplementedError
+
+
+class Variable(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+class Value(Node):
+    def serialize(self):
+        # type: () -> str
+        return '"{0}"'.format(self)
+
+
+class Op(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+VARIABLE = (
+    L("implementation_version")
+    | L("platform_python_implementation")
+    | L("implementation_name")
+    | L("python_full_version")
+    | L("platform_release")
+    | L("platform_version")
+    | L("platform_machine")
+    | L("platform_system")
+    | L("python_version")
+    | L("sys_platform")
+    | L("os_name")
+    | L("os.name")  # PEP-345
+    | L("sys.platform")  # PEP-345
+    | L("platform.version")  # PEP-345
+    | L("platform.machine")  # PEP-345
+    | L("platform.python_implementation")  # PEP-345
+    | L("python_implementation")  # undocumented setuptools legacy
+    | L("extra")  # PEP-508
+)
+ALIASES = {
+    "os.name": "os_name",
+    "sys.platform": "sys_platform",
+    "platform.version": "platform_version",
+    "platform.machine": "platform_machine",
+    "platform.python_implementation": "platform_python_implementation",
+    "python_implementation": "platform_python_implementation",
+}
+VARIABLE.setParseAction(lambda s, l, t: Variable(ALIASES.get(t[0], t[0])))
+
+VERSION_CMP = (
+    L("===") | L("==") | L(">=") | L("<=") | L("!=") | L("~=") | L(">") | L("<")
+)
+
+MARKER_OP = VERSION_CMP | L("not in") | L("in")
+MARKER_OP.setParseAction(lambda s, l, t: Op(t[0]))
+
+MARKER_VALUE = QuotedString("'") | QuotedString('"')
+MARKER_VALUE.setParseAction(lambda s, l, t: Value(t[0]))
+
+BOOLOP = L("and") | L("or")
+
+MARKER_VAR = VARIABLE | MARKER_VALUE
+
+MARKER_ITEM = Group(MARKER_VAR + MARKER_OP + MARKER_VAR)
+MARKER_ITEM.setParseAction(lambda s, l, t: tuple(t[0]))
+
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+
+MARKER_EXPR = Forward()
+MARKER_ATOM = MARKER_ITEM | Group(LPAREN + MARKER_EXPR + RPAREN)
+MARKER_EXPR << MARKER_ATOM + ZeroOrMore(BOOLOP + MARKER_EXPR)
+
+MARKER = stringStart + MARKER_EXPR + stringEnd
+
+
+def _coerce_parse_result(results):
+    # type: (Union[ParseResults, List[Any]]) -> List[Any]
+    if isinstance(results, ParseResults):
+        return [_coerce_parse_result(i) for i in results]
+    else:
+        return results
+
+
+def _format_marker(marker, first=True):
+    # type: (Union[List[str], Tuple[Node, ...], str], Optional[bool]) -> str
+
+    assert isinstance(marker, (list, tuple, string_types))
+
+    # Sometimes we have a structure like [[...]] which is a single item list
+    # where the single item is itself it's own list. In that case we want skip
+    # the rest of this function so that we don't get extraneous () on the
+    # outside.
+    if (
+        isinstance(marker, list)
+        and len(marker) == 1
+        and isinstance(marker[0], (list, tuple))
+    ):
+        return _format_marker(marker[0])
+
+    if isinstance(marker, list):
+        inner = (_format_marker(m, first=False) for m in marker)
+        if first:
+            return " ".join(inner)
+        else:
+            return "(" + " ".join(inner) + ")"
+    elif isinstance(marker, tuple):
+        return " ".join([m.serialize() for m in marker])
+    else:
+        return marker
+
+
+_operators = {
+    "in": lambda lhs, rhs: lhs in rhs,
+    "not in": lambda lhs, rhs: lhs not in rhs,
+    "<": operator.lt,
+    "<=": operator.le,
+    "==": operator.eq,
+    "!=": operator.ne,
+    ">=": operator.ge,
+    ">": operator.gt,
+}  # type: Dict[str, Operator]
+
+
+def _eval_op(lhs, op, rhs):
+    # type: (str, Op, str) -> bool
+    try:
+        spec = Specifier("".join([op.serialize(), rhs]))
+    except InvalidSpecifier:
+        pass
+    else:
+        return spec.contains(lhs)
+
+    oper = _operators.get(op.serialize())  # type: Optional[Operator]
+    if oper is None:
+        raise UndefinedComparison(
+            "Undefined {0!r} on {1!r} and {2!r}.".format(op, lhs, rhs)
+        )
+
+    return oper(lhs, rhs)
+
+
+class Undefined(object):
+    pass
+
+
+_undefined = Undefined()
+
+
+def _get_env(environment, name):
+    # type: (Dict[str, str], str) -> str
+    value = environment.get(name, _undefined)  # type: Union[str, Undefined]
+
+    if isinstance(value, Undefined):
+        raise UndefinedEnvironmentName(
+            "{0!r} does not exist in evaluation environment.".format(name)
+        )
+
+    return value
+
+
+def _evaluate_markers(markers, environment):
+    # type: (List[Any], Dict[str, str]) -> bool
+    groups = [[]]  # type: List[List[bool]]
+
+    for marker in markers:
+        assert isinstance(marker, (list, tuple, string_types))
+
+        if isinstance(marker, list):
+            groups[-1].append(_evaluate_markers(marker, environment))
+        elif isinstance(marker, tuple):
+            lhs, op, rhs = marker
+
+            if isinstance(lhs, Variable):
+                lhs_value = _get_env(environment, lhs.value)
+                rhs_value = rhs.value
+            else:
+                lhs_value = lhs.value
+                rhs_value = _get_env(environment, rhs.value)
+
+            groups[-1].append(_eval_op(lhs_value, op, rhs_value))
+        else:
+            assert marker in ["and", "or"]
+            if marker == "or":
+                groups.append([])
+
+    return any(all(item) for item in groups)
+
+
+def format_full_version(info):
+    # type: (sys._version_info) -> str
+    version = "{0.major}.{0.minor}.{0.micro}".format(info)
+    kind = info.releaselevel
+    if kind != "final":
+        version += kind[0] + str(info.serial)
+    return version
+
+
+def default_environment():
+    # type: () -> Dict[str, str]
+    if hasattr(sys, "implementation"):
+        # Ignoring the `sys.implementation` reference for type checking due to
+        # mypy not liking that the attribute doesn't exist in Python 2.7 when
+        # run with the `--py27` flag.
+        iver = format_full_version(sys.implementation.version)  # type: ignore
+        implementation_name = sys.implementation.name  # type: ignore
+    else:
+        iver = "0"
+        implementation_name = ""
+
+    return {
+        "implementation_name": implementation_name,
+        "implementation_version": iver,
+        "os_name": os.name,
+        "platform_machine": platform.machine(),
+        "platform_release": platform.release(),
+        "platform_system": platform.system(),
+        "platform_version": platform.version(),
+        "python_full_version": platform.python_version(),
+        "platform_python_implementation": platform.python_implementation(),
+        "python_version": ".".join(platform.python_version_tuple()[:2]),
+        "sys_platform": sys.platform,
+    }
+
+
+class Marker(object):
+    def __init__(self, marker):
+        # type: (str) -> None
+        try:
+            self._markers = _coerce_parse_result(MARKER.parseString(marker))
+        except ParseException as e:
+            err_str = "Invalid marker: {0!r}, parse error at {1!r}".format(
+                marker, marker[e.loc : e.loc + 8]
+            )
+            raise InvalidMarker(err_str)
+
+    def __str__(self):
+        # type: () -> str
+        return _format_marker(self._markers)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Marker({0!r})>".format(str(self))
+
+    def evaluate(self, environment=None):
+        # type: (Optional[Dict[str, str]]) -> bool
+        """Evaluate a marker.
+
+        Return the boolean from evaluating the given marker against the
+        environment. environment is an optional argument to override all or
+        part of the determined environment.
+
+        The environment is determined from the current Python process.
+        """
+        current_environment = default_environment()
+        if environment is not None:
+            current_environment.update(environment)
+
+        return _evaluate_markers(self._markers, current_environment)
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/requirements.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/requirements.py
new file mode 100644
index 000000000..9495a1df1
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/requirements.py
@@ -0,0 +1,145 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import string
+import re
+
+from pkg_resources.extern.pyparsing import stringStart, stringEnd, originalTextFor, ParseException
+from pkg_resources.extern.pyparsing import ZeroOrMore, Word, Optional, Regex, Combine
+from pkg_resources.extern.pyparsing import Literal as L  # noqa
+from urllib import parse as urlparse
+
+from ._typing import TYPE_CHECKING
+from .markers import MARKER_EXPR, Marker
+from .specifiers import LegacySpecifier, Specifier, SpecifierSet
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import List
+
+
+class InvalidRequirement(ValueError):
+    """
+    An invalid requirement was found, users should refer to PEP 508.
+    """
+
+
+ALPHANUM = Word(string.ascii_letters + string.digits)
+
+LBRACKET = L("[").suppress()
+RBRACKET = L("]").suppress()
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+COMMA = L(",").suppress()
+SEMICOLON = L(";").suppress()
+AT = L("@").suppress()
+
+PUNCTUATION = Word("-_.")
+IDENTIFIER_END = ALPHANUM | (ZeroOrMore(PUNCTUATION) + ALPHANUM)
+IDENTIFIER = Combine(ALPHANUM + ZeroOrMore(IDENTIFIER_END))
+
+NAME = IDENTIFIER("name")
+EXTRA = IDENTIFIER
+
+URI = Regex(r"[^ ]+")("url")
+URL = AT + URI
+
+EXTRAS_LIST = EXTRA + ZeroOrMore(COMMA + EXTRA)
+EXTRAS = (LBRACKET + Optional(EXTRAS_LIST) + RBRACKET)("extras")
+
+VERSION_PEP440 = Regex(Specifier._regex_str, re.VERBOSE | re.IGNORECASE)
+VERSION_LEGACY = Regex(LegacySpecifier._regex_str, re.VERBOSE | re.IGNORECASE)
+
+VERSION_ONE = VERSION_PEP440 ^ VERSION_LEGACY
+VERSION_MANY = Combine(
+    VERSION_ONE + ZeroOrMore(COMMA + VERSION_ONE), joinString=",", adjacent=False
+)("_raw_spec")
+_VERSION_SPEC = Optional(((LPAREN + VERSION_MANY + RPAREN) | VERSION_MANY))
+_VERSION_SPEC.setParseAction(lambda s, l, t: t._raw_spec or "")
+
+VERSION_SPEC = originalTextFor(_VERSION_SPEC)("specifier")
+VERSION_SPEC.setParseAction(lambda s, l, t: t[1])
+
+MARKER_EXPR = originalTextFor(MARKER_EXPR())("marker")
+MARKER_EXPR.setParseAction(
+    lambda s, l, t: Marker(s[t._original_start : t._original_end])
+)
+MARKER_SEPARATOR = SEMICOLON
+MARKER = MARKER_SEPARATOR + MARKER_EXPR
+
+VERSION_AND_MARKER = VERSION_SPEC + Optional(MARKER)
+URL_AND_MARKER = URL + Optional(MARKER)
+
+NAMED_REQUIREMENT = NAME + Optional(EXTRAS) + (URL_AND_MARKER | VERSION_AND_MARKER)
+
+REQUIREMENT = stringStart + NAMED_REQUIREMENT + stringEnd
+# pkg_resources.extern.pyparsing isn't thread safe during initialization, so we do it eagerly, see
+# issue #104
+REQUIREMENT.parseString("x[]")
+
+
+class Requirement(object):
+    """Parse a requirement.
+
+    Parse a given requirement string into its parts, such as name, specifier,
+    URL, and extras. Raises InvalidRequirement on a badly-formed requirement
+    string.
+    """
+
+    # TODO: Can we test whether something is contained within a requirement?
+    #       If so how do we do that? Do we need to test against the _name_ of
+    #       the thing as well as the version? What about the markers?
+    # TODO: Can we normalize the name and extra name?
+
+    def __init__(self, requirement_string):
+        # type: (str) -> None
+        try:
+            req = REQUIREMENT.parseString(requirement_string)
+        except ParseException as e:
+            raise InvalidRequirement(
+                'Parse error at "{0!r}": {1}'.format(
+                    requirement_string[e.loc : e.loc + 8], e.msg
+                )
+            )
+
+        self.name = req.name
+        if req.url:
+            parsed_url = urlparse.urlparse(req.url)
+            if parsed_url.scheme == "file":
+                if urlparse.urlunparse(parsed_url) != req.url:
+                    raise InvalidRequirement("Invalid URL given")
+            elif not (parsed_url.scheme and parsed_url.netloc) or (
+                not parsed_url.scheme and not parsed_url.netloc
+            ):
+                raise InvalidRequirement("Invalid URL: {0}".format(req.url))
+            self.url = req.url
+        else:
+            self.url = None
+        self.extras = set(req.extras.asList() if req.extras else [])
+        self.specifier = SpecifierSet(req.specifier)
+        self.marker = req.marker if req.marker else None
+
+    def __str__(self):
+        # type: () -> str
+        parts = [self.name]  # type: List[str]
+
+        if self.extras:
+            parts.append("[{0}]".format(",".join(sorted(self.extras))))
+
+        if self.specifier:
+            parts.append(str(self.specifier))
+
+        if self.url:
+            parts.append("@ {0}".format(self.url))
+            if self.marker:
+                parts.append(" ")
+
+        if self.marker:
+            parts.append("; {0}".format(self.marker))
+
+        return "".join(parts)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Requirement({0!r})>".format(str(self))
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/specifiers.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/specifiers.py
new file mode 100644
index 000000000..fe09bb1db
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/specifiers.py
@@ -0,0 +1,863 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import abc
+import functools
+import itertools
+import re
+
+from ._compat import string_types, with_metaclass
+from ._typing import TYPE_CHECKING
+from .utils import canonicalize_version
+from .version import Version, LegacyVersion, parse
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        List,
+        Dict,
+        Union,
+        Iterable,
+        Iterator,
+        Optional,
+        Callable,
+        Tuple,
+        FrozenSet,
+    )
+
+    ParsedVersion = Union[Version, LegacyVersion]
+    UnparsedVersion = Union[Version, LegacyVersion, str]
+    CallableOperator = Callable[[ParsedVersion, str], bool]
+
+
+class InvalidSpecifier(ValueError):
+    """
+    An invalid specifier was found, users should refer to PEP 440.
+    """
+
+
+class BaseSpecifier(with_metaclass(abc.ABCMeta, object)):  # type: ignore
+    @abc.abstractmethod
+    def __str__(self):
+        # type: () -> str
+        """
+        Returns the str representation of this Specifier like object. This
+        should be representative of the Specifier itself.
+        """
+
+    @abc.abstractmethod
+    def __hash__(self):
+        # type: () -> int
+        """
+        Returns a hash value for this Specifier like object.
+        """
+
+    @abc.abstractmethod
+    def __eq__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are equal.
+        """
+
+    @abc.abstractmethod
+    def __ne__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are not equal.
+        """
+
+    @abc.abstractproperty
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        """
+        Returns whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        """
+        Sets whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @abc.abstractmethod
+    def contains(self, item, prereleases=None):
+        # type: (str, Optional[bool]) -> bool
+        """
+        Determines if the given item is contained within this specifier.
+        """
+
+    @abc.abstractmethod
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+        """
+        Takes an iterable of items and filters them so that only items which
+        are contained within this specifier are allowed in it.
+        """
+
+
+class _IndividualSpecifier(BaseSpecifier):
+
+    _operators = {}  # type: Dict[str, str]
+
+    def __init__(self, spec="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+        match = self._regex.search(spec)
+        if not match:
+            raise InvalidSpecifier("Invalid specifier: '{0}'".format(spec))
+
+        self._spec = (
+            match.group("operator").strip(),
+            match.group("version").strip(),
+        )  # type: Tuple[str, str]
+
+        # Store whether or not this Specifier should accept prereleases
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<{0}({1!r}{2})>".format(self.__class__.__name__, str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return "{0}{1}".format(*self._spec)
+
+    @property
+    def _canonical_spec(self):
+        # type: () -> Tuple[str, Union[Version, str]]
+        return self._spec[0], canonicalize_version(self._spec[1])
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._canonical_spec)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._canonical_spec == other._canonical_spec
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._spec != other._spec
+
+    def _get_operator(self, op):
+        # type: (str) -> CallableOperator
+        operator_callable = getattr(
+            self, "_compare_{0}".format(self._operators[op])
+        )  # type: CallableOperator
+        return operator_callable
+
+    def _coerce_version(self, version):
+        # type: (UnparsedVersion) -> ParsedVersion
+        if not isinstance(version, (LegacyVersion, Version)):
+            version = parse(version)
+        return version
+
+    @property
+    def operator(self):
+        # type: () -> str
+        return self._spec[0]
+
+    @property
+    def version(self):
+        # type: () -> str
+        return self._spec[1]
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        return self._prereleases
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (str) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (UnparsedVersion, Optional[bool]) -> bool
+
+        # Determine if prereleases are to be allowed or not.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # Normalize item to a Version or LegacyVersion, this allows us to have
+        # a shortcut for ``"2.0" in Specifier(">=2")
+        normalized_item = self._coerce_version(item)
+
+        # Determine if we should be supporting prereleases in this specifier
+        # or not, if we do not support prereleases than we can short circuit
+        # logic if this version is a prereleases.
+        if normalized_item.is_prerelease and not prereleases:
+            return False
+
+        # Actually do the comparison to determine if this item is contained
+        # within this Specifier or not.
+        operator_callable = self._get_operator(self.operator)  # type: CallableOperator
+        return operator_callable(normalized_item, self.version)
+
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+
+        yielded = False
+        found_prereleases = []
+
+        kw = {"prereleases": prereleases if prereleases is not None else True}
+
+        # Attempt to iterate over all the values in the iterable and if any of
+        # them match, yield them.
+        for version in iterable:
+            parsed_version = self._coerce_version(version)
+
+            if self.contains(parsed_version, **kw):
+                # If our version is a prerelease, and we were not set to allow
+                # prereleases, then we'll store it for later incase nothing
+                # else matches this specifier.
+                if parsed_version.is_prerelease and not (
+                    prereleases or self.prereleases
+                ):
+                    found_prereleases.append(version)
+                # Either this is not a prerelease, or we should have been
+                # accepting prereleases from the beginning.
+                else:
+                    yielded = True
+                    yield version
+
+        # Now that we've iterated over everything, determine if we've yielded
+        # any values, and if we have not and we have any prereleases stored up
+        # then we will go ahead and yield the prereleases.
+        if not yielded and found_prereleases:
+            for version in found_prereleases:
+                yield version
+
+
+class LegacySpecifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(==|!=|<=|>=|<|>))
+        \s*
+        (?P<version>
+            [^,;\s)]* # Since this is a "legacy" specifier, and the version
+                      # string can be just about anything, we match everything
+                      # except for whitespace, a semi-colon for marker support,
+                      # a closing paren since versions can be enclosed in
+                      # them, and a comma since it's a version separator.
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+    }
+
+    def _coerce_version(self, version):
+        # type: (Union[ParsedVersion, str]) -> LegacyVersion
+        if not isinstance(version, LegacyVersion):
+            version = LegacyVersion(str(version))
+        return version
+
+    def _compare_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective == self._coerce_version(spec)
+
+    def _compare_not_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective != self._coerce_version(spec)
+
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective <= self._coerce_version(spec)
+
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective >= self._coerce_version(spec)
+
+    def _compare_less_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective < self._coerce_version(spec)
+
+    def _compare_greater_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective > self._coerce_version(spec)
+
+
+def _require_version_compare(
+    fn  # type: (Callable[[Specifier, ParsedVersion, str], bool])
+):
+    # type: (...) -> Callable[[Specifier, ParsedVersion, str], bool]
+    @functools.wraps(fn)
+    def wrapped(self, prospective, spec):
+        # type: (Specifier, ParsedVersion, str) -> bool
+        if not isinstance(prospective, Version):
+            return False
+        return fn(self, prospective, spec)
+
+    return wrapped
+
+
+class Specifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(~=|==|!=|<=|>=|<|>|===))
+        (?P<version>
+            (?:
+                # The identity operators allow for an escape hatch that will
+                # do an exact string match of the version you wish to install.
+                # This will not be parsed by PEP 440 and we cannot determine
+                # any semantic meaning from it. This operator is discouraged
+                # but included entirely as an escape hatch.
+                (?<====)  # Only match for the identity operator
+                \s*
+                [^\s]*    # We just match everything, except for whitespace
+                          # since we are only testing for strict identity.
+            )
+            |
+            (?:
+                # The (non)equality operators allow for wild card and local
+                # versions to be specified so we have to define these two
+                # operators separately to enable that.
+                (?<===|!=)            # Only match for equals and not equals
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+
+                # You cannot use a wild card and a dev or local version
+                # together so group them with a | and make them optional.
+                (?:
+                    (?:[-_\.]?dev[-_\.]?[0-9]*)?         # dev release
+                    (?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
+                    |
+                    \.\*  # Wild card syntax of .*
+                )?
+            )
+            |
+            (?:
+                # The compatible operator requires at least two digits in the
+                # release segment.
+                (?<=~=)               # Only match for the compatible operator
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)+   # release  (We have a + instead of a *)
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+            |
+            (?:
+                # All other operators only allow a sub set of what the
+                # (non)equality operators do. Specifically they do not allow
+                # local versions to be specified nor do they allow the prefix
+                # matching wild cards.
+                (?<!==|!=|~=)         # We have special cases for these
+                                      # operators so we want to make sure they
+                                      # don't match here.
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "~=": "compatible",
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+        "===": "arbitrary",
+    }
+
+    @_require_version_compare
+    def _compare_compatible(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # Compatible releases have an equivalent combination of >= and ==. That
+        # is that ~=2.2 is equivalent to >=2.2,==2.*. This allows us to
+        # implement this in terms of the other specifiers instead of
+        # implementing it ourselves. The only thing we need to do is construct
+        # the other specifiers.
+
+        # We want everything but the last item in the version, but we want to
+        # ignore post and dev releases and we want to treat the pre-release as
+        # it's own separate segment.
+        prefix = ".".join(
+            list(
+                itertools.takewhile(
+                    lambda x: (not x.startswith("post") and not x.startswith("dev")),
+                    _version_split(spec),
+                )
+            )[:-1]
+        )
+
+        # Add the prefix notation to the end of our string
+        prefix += ".*"
+
+        return self._get_operator(">=")(prospective, spec) and self._get_operator("==")(
+            prospective, prefix
+        )
+
+    @_require_version_compare
+    def _compare_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # We need special logic to handle prefix matching
+        if spec.endswith(".*"):
+            # In the case of prefix matching we want to ignore local segment.
+            prospective = Version(prospective.public)
+            # Split the spec out by dots, and pretend that there is an implicit
+            # dot in between a release segment and a pre-release segment.
+            split_spec = _version_split(spec[:-2])  # Remove the trailing .*
+
+            # Split the prospective version out by dots, and pretend that there
+            # is an implicit dot in between a release segment and a pre-release
+            # segment.
+            split_prospective = _version_split(str(prospective))
+
+            # Shorten the prospective version to be the same length as the spec
+            # so that we can determine if the specifier is a prefix of the
+            # prospective version or not.
+            shortened_prospective = split_prospective[: len(split_spec)]
+
+            # Pad out our two sides with zeros so that they both equal the same
+            # length.
+            padded_spec, padded_prospective = _pad_version(
+                split_spec, shortened_prospective
+            )
+
+            return padded_prospective == padded_spec
+        else:
+            # Convert our spec string into a Version
+            spec_version = Version(spec)
+
+            # If the specifier does not have a local segment, then we want to
+            # act as if the prospective version also does not have a local
+            # segment.
+            if not spec_version.local:
+                prospective = Version(prospective.public)
+
+            return prospective == spec_version
+
+    @_require_version_compare
+    def _compare_not_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+        return not self._compare_equal(prospective, spec)
+
+    @_require_version_compare
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) <= Version(spec)
+
+    @_require_version_compare
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) >= Version(spec)
+
+    @_require_version_compare
+    def _compare_less_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is less than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective < spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a pre-release version, that we do not accept pre-release
+        # versions for the version mentioned in the specifier (e.g. <3.1 should
+        # not match 3.1.dev0, but should match 3.0.dev0).
+        if not spec.is_prerelease and prospective.is_prerelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # less than the spec version *and* it's not a pre-release of the same
+        # version in the spec.
+        return True
+
+    @_require_version_compare
+    def _compare_greater_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is greater than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective > spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a post-release version, that we do not accept
+        # post-release versions for the version mentioned in the specifier
+        # (e.g. >3.1 should not match 3.0.post0, but should match 3.2.post0).
+        if not spec.is_postrelease and prospective.is_postrelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # Ensure that we do not allow a local version of the version mentioned
+        # in the specifier, which is technically greater than, to match.
+        if prospective.local is not None:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # greater than the spec version *and* it's not a pre-release of the
+        # same version in the spec.
+        return True
+
+    def _compare_arbitrary(self, prospective, spec):
+        # type: (Version, str) -> bool
+        return str(prospective).lower() == str(spec).lower()
+
+    @property
+    def prereleases(self):
+        # type: () -> bool
+
+        # If there is an explicit prereleases set for this, then we'll just
+        # blindly use that.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # Look at all of our specifiers and determine if they are inclusive
+        # operators, and if they are if they are including an explicit
+        # prerelease.
+        operator, version = self._spec
+        if operator in ["==", ">=", "<=", "~=", "==="]:
+            # The == specifier can include a trailing .*, if it does we
+            # want to remove before parsing.
+            if operator == "==" and version.endswith(".*"):
+                version = version[:-2]
+
+            # Parse the version, and if it is a pre-release than this
+            # specifier allows pre-releases.
+            if parse(version).is_prerelease:
+                return True
+
+        return False
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+
+_prefix_regex = re.compile(r"^([0-9]+)((?:a|b|c|rc)[0-9]+)$")
+
+
+def _version_split(version):
+    # type: (str) -> List[str]
+    result = []  # type: List[str]
+    for item in version.split("."):
+        match = _prefix_regex.search(item)
+        if match:
+            result.extend(match.groups())
+        else:
+            result.append(item)
+    return result
+
+
+def _pad_version(left, right):
+    # type: (List[str], List[str]) -> Tuple[List[str], List[str]]
+    left_split, right_split = [], []
+
+    # Get the release segment of our versions
+    left_split.append(list(itertools.takewhile(lambda x: x.isdigit(), left)))
+    right_split.append(list(itertools.takewhile(lambda x: x.isdigit(), right)))
+
+    # Get the rest of our versions
+    left_split.append(left[len(left_split[0]) :])
+    right_split.append(right[len(right_split[0]) :])
+
+    # Insert our padding
+    left_split.insert(1, ["0"] * max(0, len(right_split[0]) - len(left_split[0])))
+    right_split.insert(1, ["0"] * max(0, len(left_split[0]) - len(right_split[0])))
+
+    return (list(itertools.chain(*left_split)), list(itertools.chain(*right_split)))
+
+
+class SpecifierSet(BaseSpecifier):
+    def __init__(self, specifiers="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+
+        # Split on , to break each individual specifier into it's own item, and
+        # strip each item to remove leading/trailing whitespace.
+        split_specifiers = [s.strip() for s in specifiers.split(",") if s.strip()]
+
+        # Parsed each individual specifier, attempting first to make it a
+        # Specifier and falling back to a LegacySpecifier.
+        parsed = set()
+        for specifier in split_specifiers:
+            try:
+                parsed.add(Specifier(specifier))
+            except InvalidSpecifier:
+                parsed.add(LegacySpecifier(specifier))
+
+        # Turn our parsed specifiers into a frozen set and save them for later.
+        self._specs = frozenset(parsed)
+
+        # Store our prereleases value so we can use it later to determine if
+        # we accept prereleases or not.
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<SpecifierSet({0!r}{1})>".format(str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return ",".join(sorted(str(s) for s in self._specs))
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._specs)
+
+    def __and__(self, other):
+        # type: (Union[SpecifierSet, str]) -> SpecifierSet
+        if isinstance(other, string_types):
+            other = SpecifierSet(other)
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        specifier = SpecifierSet()
+        specifier._specs = frozenset(self._specs | other._specs)
+
+        if self._prereleases is None and other._prereleases is not None:
+            specifier._prereleases = other._prereleases
+        elif self._prereleases is not None and other._prereleases is None:
+            specifier._prereleases = self._prereleases
+        elif self._prereleases == other._prereleases:
+            specifier._prereleases = self._prereleases
+        else:
+            raise ValueError(
+                "Cannot combine SpecifierSets with True and False prerelease "
+                "overrides."
+            )
+
+        return specifier
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs == other._specs
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs != other._specs
+
+    def __len__(self):
+        # type: () -> int
+        return len(self._specs)
+
+    def __iter__(self):
+        # type: () -> Iterator[FrozenSet[_IndividualSpecifier]]
+        return iter(self._specs)
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+
+        # If we have been given an explicit prerelease modifier, then we'll
+        # pass that through here.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # If we don't have any specifiers, and we don't have a forced value,
+        # then we'll just return None since we don't know if this should have
+        # pre-releases or not.
+        if not self._specs:
+            return None
+
+        # Otherwise we'll see if any of the given specifiers accept
+        # prereleases, if any of them do we'll return True, otherwise False.
+        return any(s.prereleases for s in self._specs)
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (Union[ParsedVersion, str]) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (Union[ParsedVersion, str], Optional[bool]) -> bool
+
+        # Ensure that our item is a Version or LegacyVersion instance.
+        if not isinstance(item, (LegacyVersion, Version)):
+            item = parse(item)
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # We can determine if we're going to allow pre-releases by looking to
+        # see if any of the underlying items supports them. If none of them do
+        # and this item is a pre-release then we do not allow it and we can
+        # short circuit that here.
+        # Note: This means that 1.0.dev1 would not be contained in something
+        #       like >=1.0.devabc however it would be in >=1.0.debabc,>0.0.dev0
+        if not prereleases and item.is_prerelease:
+            return False
+
+        # We simply dispatch to the underlying specs here to make sure that the
+        # given version is contained within all of them.
+        # Note: This use of all() here means that an empty set of specifiers
+        #       will always return True, this is an explicit design decision.
+        return all(s.contains(item, prereleases=prereleases) for s in self._specs)
+
+    def filter(
+        self,
+        iterable,  # type: Iterable[Union[ParsedVersion, str]]
+        prereleases=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> Iterable[Union[ParsedVersion, str]]
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # If we have any specifiers, then we want to wrap our iterable in the
+        # filter method for each one, this will act as a logical AND amongst
+        # each specifier.
+        if self._specs:
+            for spec in self._specs:
+                iterable = spec.filter(iterable, prereleases=bool(prereleases))
+            return iterable
+        # If we do not have any specifiers, then we need to have a rough filter
+        # which will filter out any pre-releases, unless there are no final
+        # releases, and which will filter out LegacyVersion in general.
+        else:
+            filtered = []  # type: List[Union[ParsedVersion, str]]
+            found_prereleases = []  # type: List[Union[ParsedVersion, str]]
+
+            for item in iterable:
+                # Ensure that we some kind of Version class for this item.
+                if not isinstance(item, (LegacyVersion, Version)):
+                    parsed_version = parse(item)
+                else:
+                    parsed_version = item
+
+                # Filter out any item which is parsed as a LegacyVersion
+                if isinstance(parsed_version, LegacyVersion):
+                    continue
+
+                # Store any item which is a pre-release for later unless we've
+                # already found a final version or we are accepting prereleases
+                if parsed_version.is_prerelease and not prereleases:
+                    if not filtered:
+                        found_prereleases.append(item)
+                else:
+                    filtered.append(item)
+
+            # If we've found no items except for pre-releases, then we'll go
+            # ahead and use the pre-releases
+            if not filtered and found_prereleases and prereleases is None:
+                return found_prereleases
+
+            return filtered
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/tags.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/tags.py
new file mode 100644
index 000000000..9064910b8
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/tags.py
@@ -0,0 +1,751 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+
+from __future__ import absolute_import
+
+import distutils.util
+
+try:
+    from importlib.machinery import EXTENSION_SUFFIXES
+except ImportError:  # pragma: no cover
+    import imp
+
+    EXTENSION_SUFFIXES = [x[0] for x in imp.get_suffixes()]
+    del imp
+import logging
+import os
+import platform
+import re
+import struct
+import sys
+import sysconfig
+import warnings
+
+from ._typing import TYPE_CHECKING, cast
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        Dict,
+        FrozenSet,
+        IO,
+        Iterable,
+        Iterator,
+        List,
+        Optional,
+        Sequence,
+        Tuple,
+        Union,
+    )
+
+    PythonVersion = Sequence[int]
+    MacVersion = Tuple[int, int]
+    GlibcVersion = Tuple[int, int]
+
+
+logger = logging.getLogger(__name__)
+
+INTERPRETER_SHORT_NAMES = {
+    "python": "py",  # Generic.
+    "cpython": "cp",
+    "pypy": "pp",
+    "ironpython": "ip",
+    "jython": "jy",
+}  # type: Dict[str, str]
+
+
+_32_BIT_INTERPRETER = sys.maxsize <= 2 ** 32
+
+
+class Tag(object):
+    """
+    A representation of the tag triple for a wheel.
+
+    Instances are considered immutable and thus are hashable. Equality checking
+    is also supported.
+    """
+
+    __slots__ = ["_interpreter", "_abi", "_platform"]
+
+    def __init__(self, interpreter, abi, platform):
+        # type: (str, str, str) -> None
+        self._interpreter = interpreter.lower()
+        self._abi = abi.lower()
+        self._platform = platform.lower()
+
+    @property
+    def interpreter(self):
+        # type: () -> str
+        return self._interpreter
+
+    @property
+    def abi(self):
+        # type: () -> str
+        return self._abi
+
+    @property
+    def platform(self):
+        # type: () -> str
+        return self._platform
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if not isinstance(other, Tag):
+            return NotImplemented
+
+        return (
+            (self.platform == other.platform)
+            and (self.abi == other.abi)
+            and (self.interpreter == other.interpreter)
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self._interpreter, self._abi, self._platform))
+
+    def __str__(self):
+        # type: () -> str
+        return "{}-{}-{}".format(self._interpreter, self._abi, self._platform)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{self} @ {self_id}>".format(self=self, self_id=id(self))
+
+
+def parse_tag(tag):
+    # type: (str) -> FrozenSet[Tag]
+    """
+    Parses the provided tag (e.g. `py3-none-any`) into a frozenset of Tag instances.
+
+    Returning a set is required due to the possibility that the tag is a
+    compressed tag set.
+    """
+    tags = set()
+    interpreters, abis, platforms = tag.split("-")
+    for interpreter in interpreters.split("."):
+        for abi in abis.split("."):
+            for platform_ in platforms.split("."):
+                tags.add(Tag(interpreter, abi, platform_))
+    return frozenset(tags)
+
+
+def _warn_keyword_parameter(func_name, kwargs):
+    # type: (str, Dict[str, bool]) -> bool
+    """
+    Backwards-compatibility with Python 2.7 to allow treating 'warn' as keyword-only.
+    """
+    if not kwargs:
+        return False
+    elif len(kwargs) > 1 or "warn" not in kwargs:
+        kwargs.pop("warn", None)
+        arg = next(iter(kwargs.keys()))
+        raise TypeError(
+            "{}() got an unexpected keyword argument {!r}".format(func_name, arg)
+        )
+    return kwargs["warn"]
+
+
+def _get_config_var(name, warn=False):
+    # type: (str, bool) -> Union[int, str, None]
+    value = sysconfig.get_config_var(name)
+    if value is None and warn:
+        logger.debug(
+            "Config variable '%s' is unset, Python ABI tag may be incorrect", name
+        )
+    return value
+
+
+def _normalize_string(string):
+    # type: (str) -> str
+    return string.replace(".", "_").replace("-", "_")
+
+
+def _abi3_applies(python_version):
+    # type: (PythonVersion) -> bool
+    """
+    Determine if the Python version supports abi3.
+
+    PEP 384 was first implemented in Python 3.2.
+    """
+    return len(python_version) > 1 and tuple(python_version) >= (3, 2)
+
+
+def _cpython_abis(py_version, warn=False):
+    # type: (PythonVersion, bool) -> List[str]
+    py_version = tuple(py_version)  # To allow for version comparison.
+    abis = []
+    version = _version_nodot(py_version[:2])
+    debug = pymalloc = ucs4 = ""
+    with_debug = _get_config_var("Py_DEBUG", warn)
+    has_refcount = hasattr(sys, "gettotalrefcount")
+    # Windows doesn't set Py_DEBUG, so checking for support of debug-compiled
+    # extension modules is the best option.
+    # https://github.com/pypa/pip/issues/3383#issuecomment-173267692
+    has_ext = "_d.pyd" in EXTENSION_SUFFIXES
+    if with_debug or (with_debug is None and (has_refcount or has_ext)):
+        debug = "d"
+    if py_version < (3, 8):
+        with_pymalloc = _get_config_var("WITH_PYMALLOC", warn)
+        if with_pymalloc or with_pymalloc is None:
+            pymalloc = "m"
+        if py_version < (3, 3):
+            unicode_size = _get_config_var("Py_UNICODE_SIZE", warn)
+            if unicode_size == 4 or (
+                unicode_size is None and sys.maxunicode == 0x10FFFF
+            ):
+                ucs4 = "u"
+    elif debug:
+        # Debug builds can also load "normal" extension modules.
+        # We can also assume no UCS-4 or pymalloc requirement.
+        abis.append("cp{version}".format(version=version))
+    abis.insert(
+        0,
+        "cp{version}{debug}{pymalloc}{ucs4}".format(
+            version=version, debug=debug, pymalloc=pymalloc, ucs4=ucs4
+        ),
+    )
+    return abis
+
+
+def cpython_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a CPython interpreter.
+
+    The tags consist of:
+    - cp<python_version>-<abi>-<platform>
+    - cp<python_version>-abi3-<platform>
+    - cp<python_version>-none-<platform>
+    - cp<less than python_version>-abi3-<platform>  # Older Python versions down to 3.2.
+
+    If python_version only specifies a major version then user-provided ABIs and
+    the 'none' ABItag will be used.
+
+    If 'abi3' or 'none' are specified in 'abis' then they will be yielded at
+    their normal position and not at the beginning.
+    """
+    warn = _warn_keyword_parameter("cpython_tags", kwargs)
+    if not python_version:
+        python_version = sys.version_info[:2]
+
+    interpreter = "cp{}".format(_version_nodot(python_version[:2]))
+
+    if abis is None:
+        if len(python_version) > 1:
+            abis = _cpython_abis(python_version, warn)
+        else:
+            abis = []
+    abis = list(abis)
+    # 'abi3' and 'none' are explicitly handled later.
+    for explicit_abi in ("abi3", "none"):
+        try:
+            abis.remove(explicit_abi)
+        except ValueError:
+            pass
+
+    platforms = list(platforms or _platform_tags())
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+    if _abi3_applies(python_version):
+        for tag in (Tag(interpreter, "abi3", platform_) for platform_ in platforms):
+            yield tag
+    for tag in (Tag(interpreter, "none", platform_) for platform_ in platforms):
+        yield tag
+
+    if _abi3_applies(python_version):
+        for minor_version in range(python_version[1] - 1, 1, -1):
+            for platform_ in platforms:
+                interpreter = "cp{version}".format(
+                    version=_version_nodot((python_version[0], minor_version))
+                )
+                yield Tag(interpreter, "abi3", platform_)
+
+
+def _generic_abi():
+    # type: () -> Iterator[str]
+    abi = sysconfig.get_config_var("SOABI")
+    if abi:
+        yield _normalize_string(abi)
+
+
+def generic_tags(
+    interpreter=None,  # type: Optional[str]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a generic interpreter.
+
+    The tags consist of:
+    - <interpreter>-<abi>-<platform>
+
+    The "none" ABI will be added if it was not explicitly provided.
+    """
+    warn = _warn_keyword_parameter("generic_tags", kwargs)
+    if not interpreter:
+        interp_name = interpreter_name()
+        interp_version = interpreter_version(warn=warn)
+        interpreter = "".join([interp_name, interp_version])
+    if abis is None:
+        abis = _generic_abi()
+    platforms = list(platforms or _platform_tags())
+    abis = list(abis)
+    if "none" not in abis:
+        abis.append("none")
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+
+
+def _py_interpreter_range(py_version):
+    # type: (PythonVersion) -> Iterator[str]
+    """
+    Yields Python versions in descending order.
+
+    After the latest version, the major-only version will be yielded, and then
+    all previous versions of that major version.
+    """
+    if len(py_version) > 1:
+        yield "py{version}".format(version=_version_nodot(py_version[:2]))
+    yield "py{major}".format(major=py_version[0])
+    if len(py_version) > 1:
+        for minor in range(py_version[1] - 1, -1, -1):
+            yield "py{version}".format(version=_version_nodot((py_version[0], minor)))
+
+
+def compatible_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    interpreter=None,  # type: Optional[str]
+    platforms=None,  # type: Optional[Iterable[str]]
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the sequence of tags that are compatible with a specific version of Python.
+
+    The tags consist of:
+    - py*-none-<platform>
+    - <interpreter>-none-any  # ... if `interpreter` is provided.
+    - py*-none-any
+    """
+    if not python_version:
+        python_version = sys.version_info[:2]
+    platforms = list(platforms or _platform_tags())
+    for version in _py_interpreter_range(python_version):
+        for platform_ in platforms:
+            yield Tag(version, "none", platform_)
+    if interpreter:
+        yield Tag(interpreter, "none", "any")
+    for version in _py_interpreter_range(python_version):
+        yield Tag(version, "none", "any")
+
+
+def _mac_arch(arch, is_32bit=_32_BIT_INTERPRETER):
+    # type: (str, bool) -> str
+    if not is_32bit:
+        return arch
+
+    if arch.startswith("ppc"):
+        return "ppc"
+
+    return "i386"
+
+
+def _mac_binary_formats(version, cpu_arch):
+    # type: (MacVersion, str) -> List[str]
+    formats = [cpu_arch]
+    if cpu_arch == "x86_64":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat64", "fat32"])
+
+    elif cpu_arch == "i386":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat32", "fat"])
+
+    elif cpu_arch == "ppc64":
+        # TODO: Need to care about 32-bit PPC for ppc64 through 10.2?
+        if version > (10, 5) or version < (10, 4):
+            return []
+        formats.append("fat64")
+
+    elif cpu_arch == "ppc":
+        if version > (10, 6):
+            return []
+        formats.extend(["fat32", "fat"])
+
+    formats.append("universal")
+    return formats
+
+
+def mac_platforms(version=None, arch=None):
+    # type: (Optional[MacVersion], Optional[str]) -> Iterator[str]
+    """
+    Yields the platform tags for a macOS system.
+
+    The `version` parameter is a two-item tuple specifying the macOS version to
+    generate platform tags for. The `arch` parameter is the CPU architecture to
+    generate platform tags for. Both parameters default to the appropriate value
+    for the current system.
+    """
+    version_str, _, cpu_arch = platform.mac_ver()  # type: ignore
+    if version is None:
+        version = cast("MacVersion", tuple(map(int, version_str.split(".")[:2])))
+    else:
+        version = version
+    if arch is None:
+        arch = _mac_arch(cpu_arch)
+    else:
+        arch = arch
+    for minor_version in range(version[1], -1, -1):
+        compat_version = version[0], minor_version
+        binary_formats = _mac_binary_formats(compat_version, arch)
+        for binary_format in binary_formats:
+            yield "macosx_{major}_{minor}_{binary_format}".format(
+                major=compat_version[0],
+                minor=compat_version[1],
+                binary_format=binary_format,
+            )
+
+
+# From PEP 513.
+def _is_manylinux_compatible(name, glibc_version):
+    # type: (str, GlibcVersion) -> bool
+    # Check for presence of _manylinux module.
+    try:
+        import _manylinux  # noqa
+
+        return bool(getattr(_manylinux, name + "_compatible"))
+    except (ImportError, AttributeError):
+        # Fall through to heuristic check below.
+        pass
+
+    return _have_compatible_glibc(*glibc_version)
+
+
+def _glibc_version_string():
+    # type: () -> Optional[str]
+    # Returns glibc version string, or None if not using glibc.
+    return _glibc_version_string_confstr() or _glibc_version_string_ctypes()
+
+
+def _glibc_version_string_confstr():
+    # type: () -> Optional[str]
+    """
+    Primary implementation of glibc_version_string using os.confstr.
+    """
+    # os.confstr is quite a bit faster than ctypes.DLL. It's also less likely
+    # to be broken or missing. This strategy is used in the standard library
+    # platform module.
+    # https://github.com/python/cpython/blob/fcf1d003bf4f0100c9d0921ff3d70e1127ca1b71/Lib/platform.py#L175-L183
+    try:
+        # os.confstr("CS_GNU_LIBC_VERSION") returns a string like "glibc 2.17".
+        version_string = os.confstr(  # type: ignore[attr-defined] # noqa: F821
+            "CS_GNU_LIBC_VERSION"
+        )
+        assert version_string is not None
+        _, version = version_string.split()  # type: Tuple[str, str]
+    except (AssertionError, AttributeError, OSError, ValueError):
+        # os.confstr() or CS_GNU_LIBC_VERSION not available (or a bad value)...
+        return None
+    return version
+
+
+def _glibc_version_string_ctypes():
+    # type: () -> Optional[str]
+    """
+    Fallback implementation of glibc_version_string using ctypes.
+    """
+    try:
+        import ctypes
+    except ImportError:
+        return None
+
+    # ctypes.CDLL(None) internally calls dlopen(NULL), and as the dlopen
+    # manpage says, "If filename is NULL, then the returned handle is for the
+    # main program". This way we can let the linker do the work to figure out
+    # which libc our process is actually using.
+    #
+    # Note: typeshed is wrong here so we are ignoring this line.
+    process_namespace = ctypes.CDLL(None)  # type: ignore
+    try:
+        gnu_get_libc_version = process_namespace.gnu_get_libc_version
+    except AttributeError:
+        # Symbol doesn't exist -> therefore, we are not linked to
+        # glibc.
+        return None
+
+    # Call gnu_get_libc_version, which returns a string like "2.5"
+    gnu_get_libc_version.restype = ctypes.c_char_p
+    version_str = gnu_get_libc_version()  # type: str
+    # py2 / py3 compatibility:
+    if not isinstance(version_str, str):
+        version_str = version_str.decode("ascii")
+
+    return version_str
+
+
+# Separated out from have_compatible_glibc for easier unit testing.
+def _check_glibc_version(version_str, required_major, minimum_minor):
+    # type: (str, int, int) -> bool
+    # Parse string and check against requested version.
+    #
+    # We use a regexp instead of str.split because we want to discard any
+    # random junk that might come after the minor version -- this might happen
+    # in patched/forked versions of glibc (e.g. Linaro's version of glibc
+    # uses version strings like "2.20-2014.11"). See gh-3588.
+    m = re.match(r"(?P<major>[0-9]+)\.(?P<minor>[0-9]+)", version_str)
+    if not m:
+        warnings.warn(
+            "Expected glibc version with 2 components major.minor,"
+            " got: %s" % version_str,
+            RuntimeWarning,
+        )
+        return False
+    return (
+        int(m.group("major")) == required_major
+        and int(m.group("minor")) >= minimum_minor
+    )
+
+
+def _have_compatible_glibc(required_major, minimum_minor):
+    # type: (int, int) -> bool
+    version_str = _glibc_version_string()
+    if version_str is None:
+        return False
+    return _check_glibc_version(version_str, required_major, minimum_minor)
+
+
+# Python does not provide platform information at sufficient granularity to
+# identify the architecture of the running executable in some cases, so we
+# determine it dynamically by reading the information from the running
+# process. This only applies on Linux, which uses the ELF format.
+class _ELFFileHeader(object):
+    # https://en.wikipedia.org/wiki/Executable_and_Linkable_Format#File_header
+    class _InvalidELFFileHeader(ValueError):
+        """
+        An invalid ELF file header was found.
+        """
+
+    ELF_MAGIC_NUMBER = 0x7F454C46
+    ELFCLASS32 = 1
+    ELFCLASS64 = 2
+    ELFDATA2LSB = 1
+    ELFDATA2MSB = 2
+    EM_386 = 3
+    EM_S390 = 22
+    EM_ARM = 40
+    EM_X86_64 = 62
+    EF_ARM_ABIMASK = 0xFF000000
+    EF_ARM_ABI_VER5 = 0x05000000
+    EF_ARM_ABI_FLOAT_HARD = 0x00000400
+
+    def __init__(self, file):
+        # type: (IO[bytes]) -> None
+        def unpack(fmt):
+            # type: (str) -> int
+            try:
+                (result,) = struct.unpack(
+                    fmt, file.read(struct.calcsize(fmt))
+                )  # type: (int, )
+            except struct.error:
+                raise _ELFFileHeader._InvalidELFFileHeader()
+            return result
+
+        self.e_ident_magic = unpack(">I")
+        if self.e_ident_magic != self.ELF_MAGIC_NUMBER:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_class = unpack("B")
+        if self.e_ident_class not in {self.ELFCLASS32, self.ELFCLASS64}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_data = unpack("B")
+        if self.e_ident_data not in {self.ELFDATA2LSB, self.ELFDATA2MSB}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_version = unpack("B")
+        self.e_ident_osabi = unpack("B")
+        self.e_ident_abiversion = unpack("B")
+        self.e_ident_pad = file.read(7)
+        format_h = "<H" if self.e_ident_data == self.ELFDATA2LSB else ">H"
+        format_i = "<I" if self.e_ident_data == self.ELFDATA2LSB else ">I"
+        format_q = "<Q" if self.e_ident_data == self.ELFDATA2LSB else ">Q"
+        format_p = format_i if self.e_ident_class == self.ELFCLASS32 else format_q
+        self.e_type = unpack(format_h)
+        self.e_machine = unpack(format_h)
+        self.e_version = unpack(format_i)
+        self.e_entry = unpack(format_p)
+        self.e_phoff = unpack(format_p)
+        self.e_shoff = unpack(format_p)
+        self.e_flags = unpack(format_i)
+        self.e_ehsize = unpack(format_h)
+        self.e_phentsize = unpack(format_h)
+        self.e_phnum = unpack(format_h)
+        self.e_shentsize = unpack(format_h)
+        self.e_shnum = unpack(format_h)
+        self.e_shstrndx = unpack(format_h)
+
+
+def _get_elf_header():
+    # type: () -> Optional[_ELFFileHeader]
+    try:
+        with open(sys.executable, "rb") as f:
+            elf_header = _ELFFileHeader(f)
+    except (IOError, OSError, TypeError, _ELFFileHeader._InvalidELFFileHeader):
+        return None
+    return elf_header
+
+
+def _is_linux_armhf():
+    # type: () -> bool
+    # hard-float ABI can be detected from the ELF header of the running
+    # process
+    # https://static.docs.arm.com/ihi0044/g/aaelf32.pdf
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_ARM
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABIMASK
+    ) == elf_header.EF_ARM_ABI_VER5
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABI_FLOAT_HARD
+    ) == elf_header.EF_ARM_ABI_FLOAT_HARD
+    return result
+
+
+def _is_linux_i686():
+    # type: () -> bool
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_386
+    return result
+
+
+def _have_compatible_manylinux_abi(arch):
+    # type: (str) -> bool
+    if arch == "armv7l":
+        return _is_linux_armhf()
+    if arch == "i686":
+        return _is_linux_i686()
+    return True
+
+
+def _linux_platforms(is_32bit=_32_BIT_INTERPRETER):
+    # type: (bool) -> Iterator[str]
+    linux = _normalize_string(distutils.util.get_platform())
+    if is_32bit:
+        if linux == "linux_x86_64":
+            linux = "linux_i686"
+        elif linux == "linux_aarch64":
+            linux = "linux_armv7l"
+    manylinux_support = []
+    _, arch = linux.split("_", 1)
+    if _have_compatible_manylinux_abi(arch):
+        if arch in {"x86_64", "i686", "aarch64", "armv7l", "ppc64", "ppc64le", "s390x"}:
+            manylinux_support.append(
+                ("manylinux2014", (2, 17))
+            )  # CentOS 7 w/ glibc 2.17 (PEP 599)
+        if arch in {"x86_64", "i686"}:
+            manylinux_support.append(
+                ("manylinux2010", (2, 12))
+            )  # CentOS 6 w/ glibc 2.12 (PEP 571)
+            manylinux_support.append(
+                ("manylinux1", (2, 5))
+            )  # CentOS 5 w/ glibc 2.5 (PEP 513)
+    manylinux_support_iter = iter(manylinux_support)
+    for name, glibc_version in manylinux_support_iter:
+        if _is_manylinux_compatible(name, glibc_version):
+            yield linux.replace("linux", name)
+            break
+    # Support for a later manylinux implies support for an earlier version.
+    for name, _ in manylinux_support_iter:
+        yield linux.replace("linux", name)
+    yield linux
+
+
+def _generic_platforms():
+    # type: () -> Iterator[str]
+    yield _normalize_string(distutils.util.get_platform())
+
+
+def _platform_tags():
+    # type: () -> Iterator[str]
+    """
+    Provides the platform tags for this installation.
+    """
+    if platform.system() == "Darwin":
+        return mac_platforms()
+    elif platform.system() == "Linux":
+        return _linux_platforms()
+    else:
+        return _generic_platforms()
+
+
+def interpreter_name():
+    # type: () -> str
+    """
+    Returns the name of the running interpreter.
+    """
+    try:
+        name = sys.implementation.name  # type: ignore
+    except AttributeError:  # pragma: no cover
+        # Python 2.7 compatibility.
+        name = platform.python_implementation().lower()
+    return INTERPRETER_SHORT_NAMES.get(name) or name
+
+
+def interpreter_version(**kwargs):
+    # type: (bool) -> str
+    """
+    Returns the version of the running interpreter.
+    """
+    warn = _warn_keyword_parameter("interpreter_version", kwargs)
+    version = _get_config_var("py_version_nodot", warn=warn)
+    if version:
+        version = str(version)
+    else:
+        version = _version_nodot(sys.version_info[:2])
+    return version
+
+
+def _version_nodot(version):
+    # type: (PythonVersion) -> str
+    if any(v >= 10 for v in version):
+        sep = "_"
+    else:
+        sep = ""
+    return sep.join(map(str, version))
+
+
+def sys_tags(**kwargs):
+    # type: (bool) -> Iterator[Tag]
+    """
+    Returns the sequence of tag triples for the running interpreter.
+
+    The order of the sequence corresponds to priority order for the
+    interpreter, from most to least important.
+    """
+    warn = _warn_keyword_parameter("sys_tags", kwargs)
+
+    interp_name = interpreter_name()
+    if interp_name == "cp":
+        for tag in cpython_tags(warn=warn):
+            yield tag
+    else:
+        for tag in generic_tags():
+            yield tag
+
+    for tag in compatible_tags():
+        yield tag
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/utils.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/utils.py
new file mode 100644
index 000000000..19579c1a0
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/utils.py
@@ -0,0 +1,65 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import re
+
+from ._typing import TYPE_CHECKING, cast
+from .version import InvalidVersion, Version
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import NewType, Union
+
+    NormalizedName = NewType("NormalizedName", str)
+
+_canonicalize_regex = re.compile(r"[-_.]+")
+
+
+def canonicalize_name(name):
+    # type: (str) -> NormalizedName
+    # This is taken from PEP 503.
+    value = _canonicalize_regex.sub("-", name).lower()
+    return cast("NormalizedName", value)
+
+
+def canonicalize_version(_version):
+    # type: (str) -> Union[Version, str]
+    """
+    This is very similar to Version.__str__, but has one subtle difference
+    with the way it handles the release segment.
+    """
+
+    try:
+        version = Version(_version)
+    except InvalidVersion:
+        # Legacy versions cannot be normalized
+        return _version
+
+    parts = []
+
+    # Epoch
+    if version.epoch != 0:
+        parts.append("{0}!".format(version.epoch))
+
+    # Release segment
+    # NB: This strips trailing '.0's to normalize
+    parts.append(re.sub(r"(\.0)+$", "", ".".join(str(x) for x in version.release)))
+
+    # Pre-release
+    if version.pre is not None:
+        parts.append("".join(str(x) for x in version.pre))
+
+    # Post-release
+    if version.post is not None:
+        parts.append(".post{0}".format(version.post))
+
+    # Development release
+    if version.dev is not None:
+        parts.append(".dev{0}".format(version.dev))
+
+    # Local version segment
+    if version.local is not None:
+        parts.append("+{0}".format(version.local))
+
+    return "".join(parts)
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/packaging/version.py b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/version.py
new file mode 100644
index 000000000..00371e86a
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/packaging/version.py
@@ -0,0 +1,535 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import collections
+import itertools
+import re
+
+from ._structures import Infinity, NegativeInfinity
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Callable, Iterator, List, Optional, SupportsInt, Tuple, Union
+
+    from ._structures import InfinityType, NegativeInfinityType
+
+    InfiniteTypes = Union[InfinityType, NegativeInfinityType]
+    PrePostDevType = Union[InfiniteTypes, Tuple[str, int]]
+    SubLocalType = Union[InfiniteTypes, int, str]
+    LocalType = Union[
+        NegativeInfinityType,
+        Tuple[
+            Union[
+                SubLocalType,
+                Tuple[SubLocalType, str],
+                Tuple[NegativeInfinityType, SubLocalType],
+            ],
+            ...,
+        ],
+    ]
+    CmpKey = Tuple[
+        int, Tuple[int, ...], PrePostDevType, PrePostDevType, PrePostDevType, LocalType
+    ]
+    LegacyCmpKey = Tuple[int, Tuple[str, ...]]
+    VersionComparisonMethod = Callable[
+        [Union[CmpKey, LegacyCmpKey], Union[CmpKey, LegacyCmpKey]], bool
+    ]
+
+__all__ = ["parse", "Version", "LegacyVersion", "InvalidVersion", "VERSION_PATTERN"]
+
+
+_Version = collections.namedtuple(
+    "_Version", ["epoch", "release", "dev", "pre", "post", "local"]
+)
+
+
+def parse(version):
+    # type: (str) -> Union[LegacyVersion, Version]
+    """
+    Parse the given version string and return either a :class:`Version` object
+    or a :class:`LegacyVersion` object depending on if the given version is
+    a valid PEP 440 version or a legacy version.
+    """
+    try:
+        return Version(version)
+    except InvalidVersion:
+        return LegacyVersion(version)
+
+
+class InvalidVersion(ValueError):
+    """
+    An invalid version was found, users should refer to PEP 440.
+    """
+
+
+class _BaseVersion(object):
+    _key = None  # type: Union[CmpKey, LegacyCmpKey]
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._key)
+
+    def __lt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s < o)
+
+    def __le__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s <= o)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s == o)
+
+    def __ge__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s >= o)
+
+    def __gt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s > o)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s != o)
+
+    def _compare(self, other, method):
+        # type: (object, VersionComparisonMethod) -> Union[bool, NotImplemented]
+        if not isinstance(other, _BaseVersion):
+            return NotImplemented
+
+        return method(self._key, other._key)
+
+
+class LegacyVersion(_BaseVersion):
+    def __init__(self, version):
+        # type: (str) -> None
+        self._version = str(version)
+        self._key = _legacy_cmpkey(self._version)
+
+    def __str__(self):
+        # type: () -> str
+        return self._version
+
+    def __repr__(self):
+        # type: () -> str
+        return "<LegacyVersion({0})>".format(repr(str(self)))
+
+    @property
+    def public(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        return -1
+
+    @property
+    def release(self):
+        # type: () -> None
+        return None
+
+    @property
+    def pre(self):
+        # type: () -> None
+        return None
+
+    @property
+    def post(self):
+        # type: () -> None
+        return None
+
+    @property
+    def dev(self):
+        # type: () -> None
+        return None
+
+    @property
+    def local(self):
+        # type: () -> None
+        return None
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return False
+
+
+_legacy_version_component_re = re.compile(r"(\d+ | [a-z]+ | \.| -)", re.VERBOSE)
+
+_legacy_version_replacement_map = {
+    "pre": "c",
+    "preview": "c",
+    "-": "final-",
+    "rc": "c",
+    "dev": "@",
+}
+
+
+def _parse_version_parts(s):
+    # type: (str) -> Iterator[str]
+    for part in _legacy_version_component_re.split(s):
+        part = _legacy_version_replacement_map.get(part, part)
+
+        if not part or part == ".":
+            continue
+
+        if part[:1] in "0123456789":
+            # pad for numeric comparison
+            yield part.zfill(8)
+        else:
+            yield "*" + part
+
+    # ensure that alpha/beta/candidate are before final
+    yield "*final"
+
+
+def _legacy_cmpkey(version):
+    # type: (str) -> LegacyCmpKey
+
+    # We hardcode an epoch of -1 here. A PEP 440 version can only have a epoch
+    # greater than or equal to 0. This will effectively put the LegacyVersion,
+    # which uses the defacto standard originally implemented by setuptools,
+    # as before all PEP 440 versions.
+    epoch = -1
+
+    # This scheme is taken from pkg_resources.parse_version setuptools prior to
+    # it's adoption of the packaging library.
+    parts = []  # type: List[str]
+    for part in _parse_version_parts(version.lower()):
+        if part.startswith("*"):
+            # remove "-" before a prerelease tag
+            if part < "*final":
+                while parts and parts[-1] == "*final-":
+                    parts.pop()
+
+            # remove trailing zeros from each series of numeric parts
+            while parts and parts[-1] == "00000000":
+                parts.pop()
+
+        parts.append(part)
+
+    return epoch, tuple(parts)
+
+
+# Deliberately not anchored to the start and end of the string, to make it
+# easier for 3rd party code to reuse
+VERSION_PATTERN = r"""
+    v?
+    (?:
+        (?:(?P<epoch>[0-9]+)!)?                           # epoch
+        (?P<release>[0-9]+(?:\.[0-9]+)*)                  # release segment
+        (?P<pre>                                          # pre-release
+            [-_\.]?
+            (?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
+            [-_\.]?
+            (?P<pre_n>[0-9]+)?
+        )?
+        (?P<post>                                         # post release
+            (?:-(?P<post_n1>[0-9]+))
+            |
+            (?:
+                [-_\.]?
+                (?P<post_l>post|rev|r)
+                [-_\.]?
+                (?P<post_n2>[0-9]+)?
+            )
+        )?
+        (?P<dev>                                          # dev release
+            [-_\.]?
+            (?P<dev_l>dev)
+            [-_\.]?
+            (?P<dev_n>[0-9]+)?
+        )?
+    )
+    (?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))?       # local version
+"""
+
+
+class Version(_BaseVersion):
+
+    _regex = re.compile(r"^\s*" + VERSION_PATTERN + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    def __init__(self, version):
+        # type: (str) -> None
+
+        # Validate the version and parse it into pieces
+        match = self._regex.search(version)
+        if not match:
+            raise InvalidVersion("Invalid version: '{0}'".format(version))
+
+        # Store the parsed out pieces of the version
+        self._version = _Version(
+            epoch=int(match.group("epoch")) if match.group("epoch") else 0,
+            release=tuple(int(i) for i in match.group("release").split(".")),
+            pre=_parse_letter_version(match.group("pre_l"), match.group("pre_n")),
+            post=_parse_letter_version(
+                match.group("post_l"), match.group("post_n1") or match.group("post_n2")
+            ),
+            dev=_parse_letter_version(match.group("dev_l"), match.group("dev_n")),
+            local=_parse_local_version(match.group("local")),
+        )
+
+        # Generate a key which will be used for sorting
+        self._key = _cmpkey(
+            self._version.epoch,
+            self._version.release,
+            self._version.pre,
+            self._version.post,
+            self._version.dev,
+            self._version.local,
+        )
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Version({0})>".format(repr(str(self)))
+
+    def __str__(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        # Pre-release
+        if self.pre is not None:
+            parts.append("".join(str(x) for x in self.pre))
+
+        # Post-release
+        if self.post is not None:
+            parts.append(".post{0}".format(self.post))
+
+        # Development release
+        if self.dev is not None:
+            parts.append(".dev{0}".format(self.dev))
+
+        # Local version segment
+        if self.local is not None:
+            parts.append("+{0}".format(self.local))
+
+        return "".join(parts)
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        _epoch = self._version.epoch  # type: int
+        return _epoch
+
+    @property
+    def release(self):
+        # type: () -> Tuple[int, ...]
+        _release = self._version.release  # type: Tuple[int, ...]
+        return _release
+
+    @property
+    def pre(self):
+        # type: () -> Optional[Tuple[str, int]]
+        _pre = self._version.pre  # type: Optional[Tuple[str, int]]
+        return _pre
+
+    @property
+    def post(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.post[1] if self._version.post else None
+
+    @property
+    def dev(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.dev[1] if self._version.dev else None
+
+    @property
+    def local(self):
+        # type: () -> Optional[str]
+        if self._version.local:
+            return ".".join(str(x) for x in self._version.local)
+        else:
+            return None
+
+    @property
+    def public(self):
+        # type: () -> str
+        return str(self).split("+", 1)[0]
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        return "".join(parts)
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return self.dev is not None or self.pre is not None
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return self.post is not None
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return self.dev is not None
+
+    @property
+    def major(self):
+        # type: () -> int
+        return self.release[0] if len(self.release) >= 1 else 0
+
+    @property
+    def minor(self):
+        # type: () -> int
+        return self.release[1] if len(self.release) >= 2 else 0
+
+    @property
+    def micro(self):
+        # type: () -> int
+        return self.release[2] if len(self.release) >= 3 else 0
+
+
+def _parse_letter_version(
+    letter,  # type: str
+    number,  # type: Union[str, bytes, SupportsInt]
+):
+    # type: (...) -> Optional[Tuple[str, int]]
+
+    if letter:
+        # We consider there to be an implicit 0 in a pre-release if there is
+        # not a numeral associated with it.
+        if number is None:
+            number = 0
+
+        # We normalize any letters to their lower case form
+        letter = letter.lower()
+
+        # We consider some words to be alternate spellings of other words and
+        # in those cases we want to normalize the spellings to our preferred
+        # spelling.
+        if letter == "alpha":
+            letter = "a"
+        elif letter == "beta":
+            letter = "b"
+        elif letter in ["c", "pre", "preview"]:
+            letter = "rc"
+        elif letter in ["rev", "r"]:
+            letter = "post"
+
+        return letter, int(number)
+    if not letter and number:
+        # We assume if we are given a number, but we are not given a letter
+        # then this is using the implicit post release syntax (e.g. 1.0-1)
+        letter = "post"
+
+        return letter, int(number)
+
+    return None
+
+
+_local_version_separators = re.compile(r"[\._-]")
+
+
+def _parse_local_version(local):
+    # type: (str) -> Optional[LocalType]
+    """
+    Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
+    """
+    if local is not None:
+        return tuple(
+            part.lower() if not part.isdigit() else int(part)
+            for part in _local_version_separators.split(local)
+        )
+    return None
+
+
+def _cmpkey(
+    epoch,  # type: int
+    release,  # type: Tuple[int, ...]
+    pre,  # type: Optional[Tuple[str, int]]
+    post,  # type: Optional[Tuple[str, int]]
+    dev,  # type: Optional[Tuple[str, int]]
+    local,  # type: Optional[Tuple[SubLocalType]]
+):
+    # type: (...) -> CmpKey
+
+    # When we compare a release version, we want to compare it with all of the
+    # trailing zeros removed. So we'll use a reverse the list, drop all the now
+    # leading zeros until we come to something non zero, then take the rest
+    # re-reverse it back into the correct order and make it a tuple and use
+    # that for our sorting key.
+    _release = tuple(
+        reversed(list(itertools.dropwhile(lambda x: x == 0, reversed(release))))
+    )
+
+    # We need to "trick" the sorting algorithm to put 1.0.dev0 before 1.0a0.
+    # We'll do this by abusing the pre segment, but we _only_ want to do this
+    # if there is not a pre or a post segment. If we have one of those then
+    # the normal sorting rules will handle this case correctly.
+    if pre is None and post is None and dev is not None:
+        _pre = NegativeInfinity  # type: PrePostDevType
+    # Versions without a pre-release (except as noted above) should sort after
+    # those with one.
+    elif pre is None:
+        _pre = Infinity
+    else:
+        _pre = pre
+
+    # Versions without a post segment should sort before those with one.
+    if post is None:
+        _post = NegativeInfinity  # type: PrePostDevType
+
+    else:
+        _post = post
+
+    # Versions without a development segment should sort after those with one.
+    if dev is None:
+        _dev = Infinity  # type: PrePostDevType
+
+    else:
+        _dev = dev
+
+    if local is None:
+        # Versions without a local segment should sort before those with one.
+        _local = NegativeInfinity  # type: LocalType
+    else:
+        # Versions with a local segment need that segment parsed to implement
+        # the sorting rules in PEP440.
+        # - Alpha numeric segments sort before numeric segments
+        # - Alpha numeric segments sort lexicographically
+        # - Numeric segments sort numerically
+        # - Shorter versions sort before longer versions when the prefixes
+        #   match exactly
+        _local = tuple(
+            (i, "") if isinstance(i, int) else (NegativeInfinity, i) for i in local
+        )
+
+    return epoch, _release, _pre, _post, _dev, _local
diff --git a/venv/Lib/site-packages/pkg_resources/_vendor/pyparsing.py b/venv/Lib/site-packages/pkg_resources/_vendor/pyparsing.py
new file mode 100644
index 000000000..4aa30ee6b
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/_vendor/pyparsing.py
@@ -0,0 +1,5742 @@
+# module pyparsing.py
+#
+# Copyright (c) 2003-2018  Paul T. McGuire
+#
+# Permission is hereby granted, free of charge, to any person obtaining
+# a copy of this software and associated documentation files (the
+# "Software"), to deal in the Software without restriction, including
+# without limitation the rights to use, copy, modify, merge, publish,
+# distribute, sublicense, and/or sell copies of the Software, and to
+# permit persons to whom the Software is furnished to do so, subject to
+# the following conditions:
+#
+# The above copyright notice and this permission notice shall be
+# included in all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+
+__doc__ = \
+"""
+pyparsing module - Classes and methods to define and execute parsing grammars
+=============================================================================
+
+The pyparsing module is an alternative approach to creating and executing simple grammars,
+vs. the traditional lex/yacc approach, or the use of regular expressions.  With pyparsing, you
+don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
+provides a library of classes that you use to construct the grammar directly in Python.
+
+Here is a program to parse "Hello, World!" (or any greeting of the form 
+C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements 
+(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
+L{Literal} expressions)::
+
+    from pyparsing import Word, alphas
+
+    # define grammar of a greeting
+    greet = Word(alphas) + "," + Word(alphas) + "!"
+
+    hello = "Hello, World!"
+    print (hello, "->", greet.parseString(hello))
+
+The program outputs the following::
+
+    Hello, World! -> ['Hello', ',', 'World', '!']
+
+The Python representation of the grammar is quite readable, owing to the self-explanatory
+class names, and the use of '+', '|' and '^' operators.
+
+The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
+object with named attributes.
+
+The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
+ - extra or missing whitespace (the above program will also handle "Hello,World!", "Hello  ,  World  !", etc.)
+ - quoted strings
+ - embedded comments
+
+
+Getting Started -
+-----------------
+Visit the classes L{ParserElement} and L{ParseResults} to see the base classes that most other pyparsing
+classes inherit from. Use the docstrings for examples of how to:
+ - construct literal match expressions from L{Literal} and L{CaselessLiteral} classes
+ - construct character word-group expressions using the L{Word} class
+ - see how to create repetitive expressions using L{ZeroOrMore} and L{OneOrMore} classes
+ - use L{'+'<And>}, L{'|'<MatchFirst>}, L{'^'<Or>}, and L{'&'<Each>} operators to combine simple expressions into more complex ones
+ - associate names with your parsed results using L{ParserElement.setResultsName}
+ - find some helpful expression short-cuts like L{delimitedList} and L{oneOf}
+ - find more useful common expressions in the L{pyparsing_common} namespace class
+"""
+
+__version__ = "2.2.1"
+__versionTime__ = "18 Sep 2018 00:49 UTC"
+__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
+
+import string
+from weakref import ref as wkref
+import copy
+import sys
+import warnings
+import re
+import sre_constants
+import collections
+import pprint
+import traceback
+import types
+from datetime import datetime
+
+try:
+    from _thread import RLock
+except ImportError:
+    from threading import RLock
+
+try:
+    # Python 3
+    from collections.abc import Iterable
+    from collections.abc import MutableMapping
+except ImportError:
+    # Python 2.7
+    from collections import Iterable
+    from collections import MutableMapping
+
+try:
+    from collections import OrderedDict as _OrderedDict
+except ImportError:
+    try:
+        from ordereddict import OrderedDict as _OrderedDict
+    except ImportError:
+        _OrderedDict = None
+
+#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) )
+
+__all__ = [
+'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
+'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
+'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
+'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
+'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
+'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 
+'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore',
+'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
+'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
+'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
+'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
+'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
+'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
+'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', 
+'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
+'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
+'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation','locatedExpr', 'withClass',
+'CloseMatch', 'tokenMap', 'pyparsing_common',
+]
+
+system_version = tuple(sys.version_info)[:3]
+PY_3 = system_version[0] == 3
+if PY_3:
+    _MAX_INT = sys.maxsize
+    basestring = str
+    unichr = chr
+    _ustr = str
+
+    # build list of single arg builtins, that can be used as parse actions
+    singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
+
+else:
+    _MAX_INT = sys.maxint
+    range = xrange
+
+    def _ustr(obj):
+        """Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
+           str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
+           then < returns the unicode object | encodes it with the default encoding | ... >.
+        """
+        if isinstance(obj,unicode):
+            return obj
+
+        try:
+            # If this works, then _ustr(obj) has the same behaviour as str(obj), so
+            # it won't break any existing code.
+            return str(obj)
+
+        except UnicodeEncodeError:
+            # Else encode it
+            ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
+            xmlcharref = Regex(r'&#\d+;')
+            xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
+            return xmlcharref.transformString(ret)
+
+    # build list of single arg builtins, tolerant of Python version, that can be used as parse actions
+    singleArgBuiltins = []
+    import __builtin__
+    for fname in "sum len sorted reversed list tuple set any all min max".split():
+        try:
+            singleArgBuiltins.append(getattr(__builtin__,fname))
+        except AttributeError:
+            continue
+            
+_generatorType = type((y for y in range(1)))
+ 
+def _xml_escape(data):
+    """Escape &, <, >, ", ', etc. in a string of data."""
+
+    # ampersand must be replaced first
+    from_symbols = '&><"\''
+    to_symbols = ('&'+s+';' for s in "amp gt lt quot apos".split())
+    for from_,to_ in zip(from_symbols, to_symbols):
+        data = data.replace(from_, to_)
+    return data
+
+class _Constants(object):
+    pass
+
+alphas     = string.ascii_uppercase + string.ascii_lowercase
+nums       = "0123456789"
+hexnums    = nums + "ABCDEFabcdef"
+alphanums  = alphas + nums
+_bslash    = chr(92)
+printables = "".join(c for c in string.printable if c not in string.whitespace)
+
+class ParseBaseException(Exception):
+    """base exception class for all parsing runtime exceptions"""
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__( self, pstr, loc=0, msg=None, elem=None ):
+        self.loc = loc
+        if msg is None:
+            self.msg = pstr
+            self.pstr = ""
+        else:
+            self.msg = msg
+            self.pstr = pstr
+        self.parserElement = elem
+        self.args = (pstr, loc, msg)
+
+    @classmethod
+    def _from_exception(cls, pe):
+        """
+        internal factory method to simplify creating one type of ParseException 
+        from another - avoids having __init__ signature conflicts among subclasses
+        """
+        return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
+
+    def __getattr__( self, aname ):
+        """supported attributes by name are:
+            - lineno - returns the line number of the exception text
+            - col - returns the column number of the exception text
+            - line - returns the line containing the exception text
+        """
+        if( aname == "lineno" ):
+            return lineno( self.loc, self.pstr )
+        elif( aname in ("col", "column") ):
+            return col( self.loc, self.pstr )
+        elif( aname == "line" ):
+            return line( self.loc, self.pstr )
+        else:
+            raise AttributeError(aname)
+
+    def __str__( self ):
+        return "%s (at char %d), (line:%d, col:%d)" % \
+                ( self.msg, self.loc, self.lineno, self.column )
+    def __repr__( self ):
+        return _ustr(self)
+    def markInputline( self, markerString = ">!<" ):
+        """Extracts the exception line from the input string, and marks
+           the location of the exception with a special symbol.
+        """
+        line_str = self.line
+        line_column = self.column - 1
+        if markerString:
+            line_str = "".join((line_str[:line_column],
+                                markerString, line_str[line_column:]))
+        return line_str.strip()
+    def __dir__(self):
+        return "lineno col line".split() + dir(type(self))
+
+class ParseException(ParseBaseException):
+    """
+    Exception thrown when parse expressions don't match class;
+    supported attributes by name are:
+     - lineno - returns the line number of the exception text
+     - col - returns the column number of the exception text
+     - line - returns the line containing the exception text
+        
+    Example::
+        try:
+            Word(nums).setName("integer").parseString("ABC")
+        except ParseException as pe:
+            print(pe)
+            print("column: {}".format(pe.col))
+            
+    prints::
+       Expected integer (at char 0), (line:1, col:1)
+        column: 1
+    """
+    pass
+
+class ParseFatalException(ParseBaseException):
+    """user-throwable exception thrown when inconsistent parse content
+       is found; stops all parsing immediately"""
+    pass
+
+class ParseSyntaxException(ParseFatalException):
+    """just like L{ParseFatalException}, but thrown internally when an
+       L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop 
+       immediately because an unbacktrackable syntax error has been found"""
+    pass
+
+#~ class ReparseException(ParseBaseException):
+    #~ """Experimental class - parse actions can raise this exception to cause
+       #~ pyparsing to reparse the input string:
+        #~ - with a modified input string, and/or
+        #~ - with a modified start location
+       #~ Set the values of the ReparseException in the constructor, and raise the
+       #~ exception in a parse action to cause pyparsing to use the new string/location.
+       #~ Setting the values as None causes no change to be made.
+       #~ """
+    #~ def __init_( self, newstring, restartLoc ):
+        #~ self.newParseText = newstring
+        #~ self.reparseLoc = restartLoc
+
+class RecursiveGrammarException(Exception):
+    """exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive"""
+    def __init__( self, parseElementList ):
+        self.parseElementTrace = parseElementList
+
+    def __str__( self ):
+        return "RecursiveGrammarException: %s" % self.parseElementTrace
+
+class _ParseResultsWithOffset(object):
+    def __init__(self,p1,p2):
+        self.tup = (p1,p2)
+    def __getitem__(self,i):
+        return self.tup[i]
+    def __repr__(self):
+        return repr(self.tup[0])
+    def setOffset(self,i):
+        self.tup = (self.tup[0],i)
+
+class ParseResults(object):
+    """
+    Structured parse results, to provide multiple means of access to the parsed data:
+       - as a list (C{len(results)})
+       - by list index (C{results[0], results[1]}, etc.)
+       - by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
+
+    Example::
+        integer = Word(nums)
+        date_str = (integer.setResultsName("year") + '/' 
+                        + integer.setResultsName("month") + '/' 
+                        + integer.setResultsName("day"))
+        # equivalent form:
+        # date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+        # parseString returns a ParseResults object
+        result = date_str.parseString("1999/12/31")
+
+        def test(s, fn=repr):
+            print("%s -> %s" % (s, fn(eval(s))))
+        test("list(result)")
+        test("result[0]")
+        test("result['month']")
+        test("result.day")
+        test("'month' in result")
+        test("'minutes' in result")
+        test("result.dump()", str)
+    prints::
+        list(result) -> ['1999', '/', '12', '/', '31']
+        result[0] -> '1999'
+        result['month'] -> '12'
+        result.day -> '31'
+        'month' in result -> True
+        'minutes' in result -> False
+        result.dump() -> ['1999', '/', '12', '/', '31']
+        - day: 31
+        - month: 12
+        - year: 1999
+    """
+    def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
+        if isinstance(toklist, cls):
+            return toklist
+        retobj = object.__new__(cls)
+        retobj.__doinit = True
+        return retobj
+
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
+        if self.__doinit:
+            self.__doinit = False
+            self.__name = None
+            self.__parent = None
+            self.__accumNames = {}
+            self.__asList = asList
+            self.__modal = modal
+            if toklist is None:
+                toklist = []
+            if isinstance(toklist, list):
+                self.__toklist = toklist[:]
+            elif isinstance(toklist, _generatorType):
+                self.__toklist = list(toklist)
+            else:
+                self.__toklist = [toklist]
+            self.__tokdict = dict()
+
+        if name is not None and name:
+            if not modal:
+                self.__accumNames[name] = 0
+            if isinstance(name,int):
+                name = _ustr(name) # will always return a str, but use _ustr for consistency
+            self.__name = name
+            if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,'',[])):
+                if isinstance(toklist,basestring):
+                    toklist = [ toklist ]
+                if asList:
+                    if isinstance(toklist,ParseResults):
+                        self[name] = _ParseResultsWithOffset(toklist.copy(),0)
+                    else:
+                        self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
+                    self[name].__name = name
+                else:
+                    try:
+                        self[name] = toklist[0]
+                    except (KeyError,TypeError,IndexError):
+                        self[name] = toklist
+
+    def __getitem__( self, i ):
+        if isinstance( i, (int,slice) ):
+            return self.__toklist[i]
+        else:
+            if i not in self.__accumNames:
+                return self.__tokdict[i][-1][0]
+            else:
+                return ParseResults([ v[0] for v in self.__tokdict[i] ])
+
+    def __setitem__( self, k, v, isinstance=isinstance ):
+        if isinstance(v,_ParseResultsWithOffset):
+            self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
+            sub = v[0]
+        elif isinstance(k,(int,slice)):
+            self.__toklist[k] = v
+            sub = v
+        else:
+            self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
+            sub = v
+        if isinstance(sub,ParseResults):
+            sub.__parent = wkref(self)
+
+    def __delitem__( self, i ):
+        if isinstance(i,(int,slice)):
+            mylen = len( self.__toklist )
+            del self.__toklist[i]
+
+            # convert int to slice
+            if isinstance(i, int):
+                if i < 0:
+                    i += mylen
+                i = slice(i, i+1)
+            # get removed indices
+            removed = list(range(*i.indices(mylen)))
+            removed.reverse()
+            # fixup indices in token dictionary
+            for name,occurrences in self.__tokdict.items():
+                for j in removed:
+                    for k, (value, position) in enumerate(occurrences):
+                        occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
+        else:
+            del self.__tokdict[i]
+
+    def __contains__( self, k ):
+        return k in self.__tokdict
+
+    def __len__( self ): return len( self.__toklist )
+    def __bool__(self): return ( not not self.__toklist )
+    __nonzero__ = __bool__
+    def __iter__( self ): return iter( self.__toklist )
+    def __reversed__( self ): return iter( self.__toklist[::-1] )
+    def _iterkeys( self ):
+        if hasattr(self.__tokdict, "iterkeys"):
+            return self.__tokdict.iterkeys()
+        else:
+            return iter(self.__tokdict)
+
+    def _itervalues( self ):
+        return (self[k] for k in self._iterkeys())
+            
+    def _iteritems( self ):
+        return ((k, self[k]) for k in self._iterkeys())
+
+    if PY_3:
+        keys = _iterkeys       
+        """Returns an iterator of all named result keys (Python 3.x only)."""
+
+        values = _itervalues
+        """Returns an iterator of all named result values (Python 3.x only)."""
+
+        items = _iteritems
+        """Returns an iterator of all named result key-value tuples (Python 3.x only)."""
+
+    else:
+        iterkeys = _iterkeys
+        """Returns an iterator of all named result keys (Python 2.x only)."""
+
+        itervalues = _itervalues
+        """Returns an iterator of all named result values (Python 2.x only)."""
+
+        iteritems = _iteritems
+        """Returns an iterator of all named result key-value tuples (Python 2.x only)."""
+
+        def keys( self ):
+            """Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iterkeys())
+
+        def values( self ):
+            """Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.itervalues())
+                
+        def items( self ):
+            """Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iteritems())
+
+    def haskeys( self ):
+        """Since keys() returns an iterator, this method is helpful in bypassing
+           code that looks for the existence of any defined results names."""
+        return bool(self.__tokdict)
+        
+    def pop( self, *args, **kwargs):
+        """
+        Removes and returns item at specified index (default=C{last}).
+        Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
+        argument or an integer argument, it will use C{list} semantics
+        and pop tokens from the list of parsed tokens. If passed a 
+        non-integer argument (most likely a string), it will use C{dict}
+        semantics and pop the corresponding value from any defined 
+        results names. A second default return value argument is 
+        supported, just as in C{dict.pop()}.
+
+        Example::
+            def remove_first(tokens):
+                tokens.pop(0)
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+            print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
+
+            label = Word(alphas)
+            patt = label("LABEL") + OneOrMore(Word(nums))
+            print(patt.parseString("AAB 123 321").dump())
+
+            # Use pop() in a parse action to remove named result (note that corresponding value is not
+            # removed from list form of results)
+            def remove_LABEL(tokens):
+                tokens.pop("LABEL")
+                return tokens
+            patt.addParseAction(remove_LABEL)
+            print(patt.parseString("AAB 123 321").dump())
+        prints::
+            ['AAB', '123', '321']
+            - LABEL: AAB
+
+            ['AAB', '123', '321']
+        """
+        if not args:
+            args = [-1]
+        for k,v in kwargs.items():
+            if k == 'default':
+                args = (args[0], v)
+            else:
+                raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
+        if (isinstance(args[0], int) or 
+                        len(args) == 1 or 
+                        args[0] in self):
+            index = args[0]
+            ret = self[index]
+            del self[index]
+            return ret
+        else:
+            defaultvalue = args[1]
+            return defaultvalue
+
+    def get(self, key, defaultValue=None):
+        """
+        Returns named result matching the given key, or if there is no
+        such name, then returns the given C{defaultValue} or C{None} if no
+        C{defaultValue} is specified.
+
+        Similar to C{dict.get()}.
+        
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            result = date_str.parseString("1999/12/31")
+            print(result.get("year")) # -> '1999'
+            print(result.get("hour", "not specified")) # -> 'not specified'
+            print(result.get("hour")) # -> None
+        """
+        if key in self:
+            return self[key]
+        else:
+            return defaultValue
+
+    def insert( self, index, insStr ):
+        """
+        Inserts new element at location index in the list of parsed tokens.
+        
+        Similar to C{list.insert()}.
+
+        Example::
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+
+            # use a parse action to insert the parse location in the front of the parsed results
+            def insert_locn(locn, tokens):
+                tokens.insert(0, locn)
+            print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
+        """
+        self.__toklist.insert(index, insStr)
+        # fixup indices in token dictionary
+        for name,occurrences in self.__tokdict.items():
+            for k, (value, position) in enumerate(occurrences):
+                occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
+
+    def append( self, item ):
+        """
+        Add single element to end of ParseResults list of elements.
+
+        Example::
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+            
+            # use a parse action to compute the sum of the parsed integers, and add it to the end
+            def append_sum(tokens):
+                tokens.append(sum(map(int, tokens)))
+            print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
+        """
+        self.__toklist.append(item)
+
+    def extend( self, itemseq ):
+        """
+        Add sequence of elements to end of ParseResults list of elements.
+
+        Example::
+            patt = OneOrMore(Word(alphas))
+            
+            # use a parse action to append the reverse of the matched strings, to make a palindrome
+            def make_palindrome(tokens):
+                tokens.extend(reversed([t[::-1] for t in tokens]))
+                return ''.join(tokens)
+            print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
+        """
+        if isinstance(itemseq, ParseResults):
+            self += itemseq
+        else:
+            self.__toklist.extend(itemseq)
+
+    def clear( self ):
+        """
+        Clear all elements and results names.
+        """
+        del self.__toklist[:]
+        self.__tokdict.clear()
+
+    def __getattr__( self, name ):
+        try:
+            return self[name]
+        except KeyError:
+            return ""
+            
+        if name in self.__tokdict:
+            if name not in self.__accumNames:
+                return self.__tokdict[name][-1][0]
+            else:
+                return ParseResults([ v[0] for v in self.__tokdict[name] ])
+        else:
+            return ""
+
+    def __add__( self, other ):
+        ret = self.copy()
+        ret += other
+        return ret
+
+    def __iadd__( self, other ):
+        if other.__tokdict:
+            offset = len(self.__toklist)
+            addoffset = lambda a: offset if a<0 else a+offset
+            otheritems = other.__tokdict.items()
+            otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
+                                for (k,vlist) in otheritems for v in vlist]
+            for k,v in otherdictitems:
+                self[k] = v
+                if isinstance(v[0],ParseResults):
+                    v[0].__parent = wkref(self)
+            
+        self.__toklist += other.__toklist
+        self.__accumNames.update( other.__accumNames )
+        return self
+
+    def __radd__(self, other):
+        if isinstance(other,int) and other == 0:
+            # useful for merging many ParseResults using sum() builtin
+            return self.copy()
+        else:
+            # this may raise a TypeError - so be it
+            return other + self
+        
+    def __repr__( self ):
+        return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) )
+
+    def __str__( self ):
+        return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
+
+    def _asStringList( self, sep='' ):
+        out = []
+        for item in self.__toklist:
+            if out and sep:
+                out.append(sep)
+            if isinstance( item, ParseResults ):
+                out += item._asStringList()
+            else:
+                out.append( _ustr(item) )
+        return out
+
+    def asList( self ):
+        """
+        Returns the parse results as a nested list of matching tokens, all converted to strings.
+
+        Example::
+            patt = OneOrMore(Word(alphas))
+            result = patt.parseString("sldkj lsdkj sldkj")
+            # even though the result prints in string-like form, it is actually a pyparsing ParseResults
+            print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
+            
+            # Use asList() to create an actual list
+            result_list = result.asList()
+            print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
+        """
+        return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]
+
+    def asDict( self ):
+        """
+        Returns the named parse results as a nested dictionary.
+
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+            
+            result = date_str.parseString('12/31/1999')
+            print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
+            
+            result_dict = result.asDict()
+            print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
+
+            # even though a ParseResults supports dict-like access, sometime you just need to have a dict
+            import json
+            print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
+            print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
+        """
+        if PY_3:
+            item_fn = self.items
+        else:
+            item_fn = self.iteritems
+            
+        def toItem(obj):
+            if isinstance(obj, ParseResults):
+                if obj.haskeys():
+                    return obj.asDict()
+                else:
+                    return [toItem(v) for v in obj]
+            else:
+                return obj
+                
+        return dict((k,toItem(v)) for k,v in item_fn())
+
+    def copy( self ):
+        """
+        Returns a new copy of a C{ParseResults} object.
+        """
+        ret = ParseResults( self.__toklist )
+        ret.__tokdict = self.__tokdict.copy()
+        ret.__parent = self.__parent
+        ret.__accumNames.update( self.__accumNames )
+        ret.__name = self.__name
+        return ret
+
+    def asXML( self, doctag=None, namedItemsOnly=False, indent="", formatted=True ):
+        """
+        (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
+        """
+        nl = "\n"
+        out = []
+        namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
+                                                            for v in vlist)
+        nextLevelIndent = indent + "  "
+
+        # collapse out indents if formatting is not desired
+        if not formatted:
+            indent = ""
+            nextLevelIndent = ""
+            nl = ""
+
+        selfTag = None
+        if doctag is not None:
+            selfTag = doctag
+        else:
+            if self.__name:
+                selfTag = self.__name
+
+        if not selfTag:
+            if namedItemsOnly:
+                return ""
+            else:
+                selfTag = "ITEM"
+
+        out += [ nl, indent, "<", selfTag, ">" ]
+
+        for i,res in enumerate(self.__toklist):
+            if isinstance(res,ParseResults):
+                if i in namedItems:
+                    out += [ res.asXML(namedItems[i],
+                                        namedItemsOnly and doctag is None,
+                                        nextLevelIndent,
+                                        formatted)]
+                else:
+                    out += [ res.asXML(None,
+                                        namedItemsOnly and doctag is None,
+                                        nextLevelIndent,
+                                        formatted)]
+            else:
+                # individual token, see if there is a name for it
+                resTag = None
+                if i in namedItems:
+                    resTag = namedItems[i]
+                if not resTag:
+                    if namedItemsOnly:
+                        continue
+                    else:
+                        resTag = "ITEM"
+                xmlBodyText = _xml_escape(_ustr(res))
+                out += [ nl, nextLevelIndent, "<", resTag, ">",
+                                                xmlBodyText,
+                                                "</", resTag, ">" ]
+
+        out += [ nl, indent, "</", selfTag, ">" ]
+        return "".join(out)
+
+    def __lookup(self,sub):
+        for k,vlist in self.__tokdict.items():
+            for v,loc in vlist:
+                if sub is v:
+                    return k
+        return None
+
+    def getName(self):
+        r"""
+        Returns the results name for this token expression. Useful when several 
+        different expressions might match at a particular location.
+
+        Example::
+            integer = Word(nums)
+            ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
+            house_number_expr = Suppress('#') + Word(nums, alphanums)
+            user_data = (Group(house_number_expr)("house_number") 
+                        | Group(ssn_expr)("ssn")
+                        | Group(integer)("age"))
+            user_info = OneOrMore(user_data)
+            
+            result = user_info.parseString("22 111-22-3333 #221B")
+            for item in result:
+                print(item.getName(), ':', item[0])
+        prints::
+            age : 22
+            ssn : 111-22-3333
+            house_number : 221B
+        """
+        if self.__name:
+            return self.__name
+        elif self.__parent:
+            par = self.__parent()
+            if par:
+                return par.__lookup(self)
+            else:
+                return None
+        elif (len(self) == 1 and
+               len(self.__tokdict) == 1 and
+               next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
+            return next(iter(self.__tokdict.keys()))
+        else:
+            return None
+
+    def dump(self, indent='', depth=0, full=True):
+        """
+        Diagnostic method for listing out the contents of a C{ParseResults}.
+        Accepts an optional C{indent} argument so that this string can be embedded
+        in a nested display of other data.
+
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+            
+            result = date_str.parseString('12/31/1999')
+            print(result.dump())
+        prints::
+            ['12', '/', '31', '/', '1999']
+            - day: 1999
+            - month: 31
+            - year: 12
+        """
+        out = []
+        NL = '\n'
+        out.append( indent+_ustr(self.asList()) )
+        if full:
+            if self.haskeys():
+                items = sorted((str(k), v) for k,v in self.items())
+                for k,v in items:
+                    if out:
+                        out.append(NL)
+                    out.append( "%s%s- %s: " % (indent,('  '*depth), k) )
+                    if isinstance(v,ParseResults):
+                        if v:
+                            out.append( v.dump(indent,depth+1) )
+                        else:
+                            out.append(_ustr(v))
+                    else:
+                        out.append(repr(v))
+            elif any(isinstance(vv,ParseResults) for vv in self):
+                v = self
+                for i,vv in enumerate(v):
+                    if isinstance(vv,ParseResults):
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),vv.dump(indent,depth+1) ))
+                    else:
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),_ustr(vv)))
+            
+        return "".join(out)
+
+    def pprint(self, *args, **kwargs):
+        """
+        Pretty-printer for parsed results as a list, using the C{pprint} module.
+        Accepts additional positional or keyword args as defined for the 
+        C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
+
+        Example::
+            ident = Word(alphas, alphanums)
+            num = Word(nums)
+            func = Forward()
+            term = ident | num | Group('(' + func + ')')
+            func <<= ident + Group(Optional(delimitedList(term)))
+            result = func.parseString("fna a,b,(fnb c,d,200),100")
+            result.pprint(width=40)
+        prints::
+            ['fna',
+             ['a',
+              'b',
+              ['(', 'fnb', ['c', 'd', '200'], ')'],
+              '100']]
+        """
+        pprint.pprint(self.asList(), *args, **kwargs)
+
+    # add support for pickle protocol
+    def __getstate__(self):
+        return ( self.__toklist,
+                 ( self.__tokdict.copy(),
+                   self.__parent is not None and self.__parent() or None,
+                   self.__accumNames,
+                   self.__name ) )
+
+    def __setstate__(self,state):
+        self.__toklist = state[0]
+        (self.__tokdict,
+         par,
+         inAccumNames,
+         self.__name) = state[1]
+        self.__accumNames = {}
+        self.__accumNames.update(inAccumNames)
+        if par is not None:
+            self.__parent = wkref(par)
+        else:
+            self.__parent = None
+
+    def __getnewargs__(self):
+        return self.__toklist, self.__name, self.__asList, self.__modal
+
+    def __dir__(self):
+        return (dir(type(self)) + list(self.keys()))
+
+MutableMapping.register(ParseResults)
+
+def col (loc,strg):
+    """Returns current column within a string, counting newlines as line separators.
+   The first column is number 1.
+
+   Note: the default parsing behavior is to expand tabs in the input string
+   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
+   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+   consistent view of the parsed string, the parse location, and line and column
+   positions within the parsed string.
+   """
+    s = strg
+    return 1 if 0<loc<len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
+
+def lineno(loc,strg):
+    """Returns current line number within a string, counting newlines as line separators.
+   The first line is number 1.
+
+   Note: the default parsing behavior is to expand tabs in the input string
+   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
+   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+   consistent view of the parsed string, the parse location, and line and column
+   positions within the parsed string.
+   """
+    return strg.count("\n",0,loc) + 1
+
+def line( loc, strg ):
+    """Returns the line of text containing loc within a string, counting newlines as line separators.
+       """
+    lastCR = strg.rfind("\n", 0, loc)
+    nextCR = strg.find("\n", loc)
+    if nextCR >= 0:
+        return strg[lastCR+1:nextCR]
+    else:
+        return strg[lastCR+1:]
+
+def _defaultStartDebugAction( instring, loc, expr ):
+    print (("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )))
+
+def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
+    print ("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
+
+def _defaultExceptionDebugAction( instring, loc, expr, exc ):
+    print ("Exception raised:" + _ustr(exc))
+
+def nullDebugAction(*args):
+    """'Do-nothing' debug action, to suppress debugging output during parsing."""
+    pass
+
+# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
+#~ 'decorator to trim function calls to match the arity of the target'
+#~ def _trim_arity(func, maxargs=3):
+    #~ if func in singleArgBuiltins:
+        #~ return lambda s,l,t: func(t)
+    #~ limit = 0
+    #~ foundArity = False
+    #~ def wrapper(*args):
+        #~ nonlocal limit,foundArity
+        #~ while 1:
+            #~ try:
+                #~ ret = func(*args[limit:])
+                #~ foundArity = True
+                #~ return ret
+            #~ except TypeError:
+                #~ if limit == maxargs or foundArity:
+                    #~ raise
+                #~ limit += 1
+                #~ continue
+    #~ return wrapper
+
+# this version is Python 2.x-3.x cross-compatible
+'decorator to trim function calls to match the arity of the target'
+def _trim_arity(func, maxargs=2):
+    if func in singleArgBuiltins:
+        return lambda s,l,t: func(t)
+    limit = [0]
+    foundArity = [False]
+    
+    # traceback return data structure changed in Py3.5 - normalize back to plain tuples
+    if system_version[:2] >= (3,5):
+        def extract_stack(limit=0):
+            # special handling for Python 3.5.0 - extra deep call stack by 1
+            offset = -3 if system_version == (3,5,0) else -2
+            frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
+            return [frame_summary[:2]]
+        def extract_tb(tb, limit=0):
+            frames = traceback.extract_tb(tb, limit=limit)
+            frame_summary = frames[-1]
+            return [frame_summary[:2]]
+    else:
+        extract_stack = traceback.extract_stack
+        extract_tb = traceback.extract_tb
+    
+    # synthesize what would be returned by traceback.extract_stack at the call to 
+    # user's parse action 'func', so that we don't incur call penalty at parse time
+    
+    LINE_DIFF = 6
+    # IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND 
+    # THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
+    this_line = extract_stack(limit=2)[-1]
+    pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)
+
+    def wrapper(*args):
+        while 1:
+            try:
+                ret = func(*args[limit[0]:])
+                foundArity[0] = True
+                return ret
+            except TypeError:
+                # re-raise TypeErrors if they did not come from our arity testing
+                if foundArity[0]:
+                    raise
+                else:
+                    try:
+                        tb = sys.exc_info()[-1]
+                        if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
+                            raise
+                    finally:
+                        del tb
+
+                if limit[0] <= maxargs:
+                    limit[0] += 1
+                    continue
+                raise
+
+    # copy func name to wrapper for sensible debug output
+    func_name = "<parse action>"
+    try:
+        func_name = getattr(func, '__name__', 
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    wrapper.__name__ = func_name
+
+    return wrapper
+
+class ParserElement(object):
+    """Abstract base level parser element class."""
+    DEFAULT_WHITE_CHARS = " \n\t\r"
+    verbose_stacktrace = False
+
+    @staticmethod
+    def setDefaultWhitespaceChars( chars ):
+        r"""
+        Overrides the default whitespace chars
+
+        Example::
+            # default whitespace chars are space, <TAB> and newline
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def', 'ghi', 'jkl']
+            
+            # change to just treat newline as significant
+            ParserElement.setDefaultWhitespaceChars(" \t")
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def']
+        """
+        ParserElement.DEFAULT_WHITE_CHARS = chars
+
+    @staticmethod
+    def inlineLiteralsUsing(cls):
+        """
+        Set class to be used for inclusion of string literals into a parser.
+        
+        Example::
+            # default literal class used is Literal
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+
+            # change to Suppress
+            ParserElement.inlineLiteralsUsing(Suppress)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '12', '31']
+        """
+        ParserElement._literalStringClass = cls
+
+    def __init__( self, savelist=False ):
+        self.parseAction = list()
+        self.failAction = None
+        #~ self.name = "<unknown>"  # don't define self.name, let subclasses try/except upcall
+        self.strRepr = None
+        self.resultsName = None
+        self.saveAsList = savelist
+        self.skipWhitespace = True
+        self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
+        self.copyDefaultWhiteChars = True
+        self.mayReturnEmpty = False # used when checking for left-recursion
+        self.keepTabs = False
+        self.ignoreExprs = list()
+        self.debug = False
+        self.streamlined = False
+        self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
+        self.errmsg = ""
+        self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
+        self.debugActions = ( None, None, None ) #custom debug actions
+        self.re = None
+        self.callPreparse = True # used to avoid redundant calls to preParse
+        self.callDuringTry = False
+
+    def copy( self ):
+        """
+        Make a copy of this C{ParserElement}.  Useful for defining different parse actions
+        for the same parsing pattern, using copies of the original parse element.
+        
+        Example::
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
+            integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
+            
+            print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
+        prints::
+            [5120, 100, 655360, 268435456]
+        Equivalent form of C{expr.copy()} is just C{expr()}::
+            integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
+        """
+        cpy = copy.copy( self )
+        cpy.parseAction = self.parseAction[:]
+        cpy.ignoreExprs = self.ignoreExprs[:]
+        if self.copyDefaultWhiteChars:
+            cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
+        return cpy
+
+    def setName( self, name ):
+        """
+        Define name for this expression, makes debugging and exception messages clearer.
+        
+        Example::
+            Word(nums).parseString("ABC")  # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
+            Word(nums).setName("integer").parseString("ABC")  # -> Exception: Expected integer (at char 0), (line:1, col:1)
+        """
+        self.name = name
+        self.errmsg = "Expected " + self.name
+        if hasattr(self,"exception"):
+            self.exception.msg = self.errmsg
+        return self
+
+    def setResultsName( self, name, listAllMatches=False ):
+        """
+        Define name for referencing matching tokens as a nested attribute
+        of the returned parse results.
+        NOTE: this returns a *copy* of the original C{ParserElement} object;
+        this is so that the client can define a basic element, such as an
+        integer, and reference it in multiple places with different names.
+
+        You can also set results names using the abbreviated syntax,
+        C{expr("name")} in place of C{expr.setResultsName("name")} - 
+        see L{I{__call__}<__call__>}.
+
+        Example::
+            date_str = (integer.setResultsName("year") + '/' 
+                        + integer.setResultsName("month") + '/' 
+                        + integer.setResultsName("day"))
+
+            # equivalent form:
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+        """
+        newself = self.copy()
+        if name.endswith("*"):
+            name = name[:-1]
+            listAllMatches=True
+        newself.resultsName = name
+        newself.modalResults = not listAllMatches
+        return newself
+
+    def setBreak(self,breakFlag = True):
+        """Method to invoke the Python pdb debugger when this element is
+           about to be parsed. Set C{breakFlag} to True to enable, False to
+           disable.
+        """
+        if breakFlag:
+            _parseMethod = self._parse
+            def breaker(instring, loc, doActions=True, callPreParse=True):
+                import pdb
+                pdb.set_trace()
+                return _parseMethod( instring, loc, doActions, callPreParse )
+            breaker._originalParseMethod = _parseMethod
+            self._parse = breaker
+        else:
+            if hasattr(self._parse,"_originalParseMethod"):
+                self._parse = self._parse._originalParseMethod
+        return self
+
+    def setParseAction( self, *fns, **kwargs ):
+        """
+        Define one or more actions to perform when successfully matching parse element definition.
+        Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
+        C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
+         - s   = the original string being parsed (see note below)
+         - loc = the location of the matching substring
+         - toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
+        If the functions in fns modify the tokens, they can return them as the return
+        value from fn, and the modified list of tokens will replace the original.
+        Otherwise, fn does not need to return any value.
+
+        Optional keyword arguments:
+         - callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
+
+        Note: the default parsing behavior is to expand tabs in the input string
+        before starting the parsing process.  See L{I{parseString}<parseString>} for more information
+        on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+        consistent view of the parsed string, the parse location, and line and column
+        positions within the parsed string.
+        
+        Example::
+            integer = Word(nums)
+            date_str = integer + '/' + integer + '/' + integer
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+            # use parse action to convert to ints at parse time
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            date_str = integer + '/' + integer + '/' + integer
+
+            # note that integer fields are now ints, not strings
+            date_str.parseString("1999/12/31")  # -> [1999, '/', 12, '/', 31]
+        """
+        self.parseAction = list(map(_trim_arity, list(fns)))
+        self.callDuringTry = kwargs.get("callDuringTry", False)
+        return self
+
+    def addParseAction( self, *fns, **kwargs ):
+        """
+        Add one or more parse actions to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
+        
+        See examples in L{I{copy}<copy>}.
+        """
+        self.parseAction += list(map(_trim_arity, list(fns)))
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def addCondition(self, *fns, **kwargs):
+        """Add a boolean predicate function to expression's list of parse actions. See 
+        L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction}, 
+        functions passed to C{addCondition} need to return boolean success/fail of the condition.
+
+        Optional keyword arguments:
+         - message = define a custom message to be used in the raised exception
+         - fatal   = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
+         
+        Example::
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            year_int = integer.copy()
+            year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
+            date_str = year_int + '/' + integer + '/' + integer
+
+            result = date_str.parseString("1999/12/31")  # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
+        """
+        msg = kwargs.get("message", "failed user-defined condition")
+        exc_type = ParseFatalException if kwargs.get("fatal", False) else ParseException
+        for fn in fns:
+            def pa(s,l,t):
+                if not bool(_trim_arity(fn)(s,l,t)):
+                    raise exc_type(s,l,msg)
+            self.parseAction.append(pa)
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def setFailAction( self, fn ):
+        """Define action to perform if parsing fails at this expression.
+           Fail acton fn is a callable function that takes the arguments
+           C{fn(s,loc,expr,err)} where:
+            - s = string being parsed
+            - loc = location where expression match was attempted and failed
+            - expr = the parse expression that failed
+            - err = the exception thrown
+           The function returns no value.  It may throw C{L{ParseFatalException}}
+           if it is desired to stop parsing immediately."""
+        self.failAction = fn
+        return self
+
+    def _skipIgnorables( self, instring, loc ):
+        exprsFound = True
+        while exprsFound:
+            exprsFound = False
+            for e in self.ignoreExprs:
+                try:
+                    while 1:
+                        loc,dummy = e._parse( instring, loc )
+                        exprsFound = True
+                except ParseException:
+                    pass
+        return loc
+
+    def preParse( self, instring, loc ):
+        if self.ignoreExprs:
+            loc = self._skipIgnorables( instring, loc )
+
+        if self.skipWhitespace:
+            wt = self.whiteChars
+            instrlen = len(instring)
+            while loc < instrlen and instring[loc] in wt:
+                loc += 1
+
+        return loc
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        return loc, []
+
+    def postParse( self, instring, loc, tokenlist ):
+        return tokenlist
+
+    #~ @profile
+    def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
+        debugging = ( self.debug ) #and doActions )
+
+        if debugging or self.failAction:
+            #~ print ("Match",self,"at loc",loc,"(%d,%d)" % ( lineno(loc,instring), col(loc,instring) ))
+            if (self.debugActions[0] ):
+                self.debugActions[0]( instring, loc, self )
+            if callPreParse and self.callPreparse:
+                preloc = self.preParse( instring, loc )
+            else:
+                preloc = loc
+            tokensStart = preloc
+            try:
+                try:
+                    loc,tokens = self.parseImpl( instring, preloc, doActions )
+                except IndexError:
+                    raise ParseException( instring, len(instring), self.errmsg, self )
+            except ParseBaseException as err:
+                #~ print ("Exception raised:", err)
+                if self.debugActions[2]:
+                    self.debugActions[2]( instring, tokensStart, self, err )
+                if self.failAction:
+                    self.failAction( instring, tokensStart, self, err )
+                raise
+        else:
+            if callPreParse and self.callPreparse:
+                preloc = self.preParse( instring, loc )
+            else:
+                preloc = loc
+            tokensStart = preloc
+            if self.mayIndexError or preloc >= len(instring):
+                try:
+                    loc,tokens = self.parseImpl( instring, preloc, doActions )
+                except IndexError:
+                    raise ParseException( instring, len(instring), self.errmsg, self )
+            else:
+                loc,tokens = self.parseImpl( instring, preloc, doActions )
+
+        tokens = self.postParse( instring, loc, tokens )
+
+        retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
+        if self.parseAction and (doActions or self.callDuringTry):
+            if debugging:
+                try:
+                    for fn in self.parseAction:
+                        tokens = fn( instring, tokensStart, retTokens )
+                        if tokens is not None:
+                            retTokens = ParseResults( tokens,
+                                                      self.resultsName,
+                                                      asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
+                                                      modal=self.modalResults )
+                except ParseBaseException as err:
+                    #~ print "Exception raised in user parse action:", err
+                    if (self.debugActions[2] ):
+                        self.debugActions[2]( instring, tokensStart, self, err )
+                    raise
+            else:
+                for fn in self.parseAction:
+                    tokens = fn( instring, tokensStart, retTokens )
+                    if tokens is not None:
+                        retTokens = ParseResults( tokens,
+                                                  self.resultsName,
+                                                  asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
+                                                  modal=self.modalResults )
+        if debugging:
+            #~ print ("Matched",self,"->",retTokens.asList())
+            if (self.debugActions[1] ):
+                self.debugActions[1]( instring, tokensStart, loc, self, retTokens )
+
+        return loc, retTokens
+
+    def tryParse( self, instring, loc ):
+        try:
+            return self._parse( instring, loc, doActions=False )[0]
+        except ParseFatalException:
+            raise ParseException( instring, loc, self.errmsg, self)
+    
+    def canParseNext(self, instring, loc):
+        try:
+            self.tryParse(instring, loc)
+        except (ParseException, IndexError):
+            return False
+        else:
+            return True
+
+    class _UnboundedCache(object):
+        def __init__(self):
+            cache = {}
+            self.not_in_cache = not_in_cache = object()
+
+            def get(self, key):
+                return cache.get(key, not_in_cache)
+
+            def set(self, key, value):
+                cache[key] = value
+
+            def clear(self):
+                cache.clear()
+                
+            def cache_len(self):
+                return len(cache)
+
+            self.get = types.MethodType(get, self)
+            self.set = types.MethodType(set, self)
+            self.clear = types.MethodType(clear, self)
+            self.__len__ = types.MethodType(cache_len, self)
+
+    if _OrderedDict is not None:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = _OrderedDict()
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(cache) > size:
+                        try:
+                            cache.popitem(False)
+                        except KeyError:
+                            pass
+
+                def clear(self):
+                    cache.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    else:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = {}
+                key_fifo = collections.deque([], size)
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(key_fifo) > size:
+                        cache.pop(key_fifo.popleft(), None)
+                    key_fifo.append(key)
+
+                def clear(self):
+                    cache.clear()
+                    key_fifo.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    # argument cache for optimizing repeated calls when backtracking through recursive expressions
+    packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
+    packrat_cache_lock = RLock()
+    packrat_cache_stats = [0, 0]
+
+    # this method gets repeatedly called during backtracking with the same arguments -
+    # we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
+    def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
+        HIT, MISS = 0, 1
+        lookup = (self, instring, loc, callPreParse, doActions)
+        with ParserElement.packrat_cache_lock:
+            cache = ParserElement.packrat_cache
+            value = cache.get(lookup)
+            if value is cache.not_in_cache:
+                ParserElement.packrat_cache_stats[MISS] += 1
+                try:
+                    value = self._parseNoCache(instring, loc, doActions, callPreParse)
+                except ParseBaseException as pe:
+                    # cache a copy of the exception, without the traceback
+                    cache.set(lookup, pe.__class__(*pe.args))
+                    raise
+                else:
+                    cache.set(lookup, (value[0], value[1].copy()))
+                    return value
+            else:
+                ParserElement.packrat_cache_stats[HIT] += 1
+                if isinstance(value, Exception):
+                    raise value
+                return (value[0], value[1].copy())
+
+    _parse = _parseNoCache
+
+    @staticmethod
+    def resetCache():
+        ParserElement.packrat_cache.clear()
+        ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
+
+    _packratEnabled = False
+    @staticmethod
+    def enablePackrat(cache_size_limit=128):
+        """Enables "packrat" parsing, which adds memoizing to the parsing logic.
+           Repeated parse attempts at the same string location (which happens
+           often in many complex grammars) can immediately return a cached value,
+           instead of re-executing parsing/validating code.  Memoizing is done of
+           both valid results and parsing exceptions.
+           
+           Parameters:
+            - cache_size_limit - (default=C{128}) - if an integer value is provided
+              will limit the size of the packrat cache; if None is passed, then
+              the cache size will be unbounded; if 0 is passed, the cache will
+              be effectively disabled.
+            
+           This speedup may break existing programs that use parse actions that
+           have side-effects.  For this reason, packrat parsing is disabled when
+           you first import pyparsing.  To activate the packrat feature, your
+           program must call the class method C{ParserElement.enablePackrat()}.  If
+           your program uses C{psyco} to "compile as you go", you must call
+           C{enablePackrat} before calling C{psyco.full()}.  If you do not do this,
+           Python will crash.  For best results, call C{enablePackrat()} immediately
+           after importing pyparsing.
+           
+           Example::
+               import pyparsing
+               pyparsing.ParserElement.enablePackrat()
+        """
+        if not ParserElement._packratEnabled:
+            ParserElement._packratEnabled = True
+            if cache_size_limit is None:
+                ParserElement.packrat_cache = ParserElement._UnboundedCache()
+            else:
+                ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
+            ParserElement._parse = ParserElement._parseCache
+
+    def parseString( self, instring, parseAll=False ):
+        """
+        Execute the parse expression with the given string.
+        This is the main interface to the client code, once the complete
+        expression has been built.
+
+        If you want the grammar to require that the entire input string be
+        successfully parsed, then set C{parseAll} to True (equivalent to ending
+        the grammar with C{L{StringEnd()}}).
+
+        Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
+        in order to report proper column numbers in parse actions.
+        If the input string contains tabs and
+        the grammar uses parse actions that use the C{loc} argument to index into the
+        string being parsed, you can ensure you have a consistent view of the input
+        string by:
+         - calling C{parseWithTabs} on your grammar before calling C{parseString}
+           (see L{I{parseWithTabs}<parseWithTabs>})
+         - define your parse action using the full C{(s,loc,toks)} signature, and
+           reference the input string using the parse action's C{s} argument
+         - explictly expand the tabs in your input string before calling
+           C{parseString}
+        
+        Example::
+            Word('a').parseString('aaaaabaaa')  # -> ['aaaaa']
+            Word('a').parseString('aaaaabaaa', parseAll=True)  # -> Exception: Expected end of text
+        """
+        ParserElement.resetCache()
+        if not self.streamlined:
+            self.streamline()
+            #~ self.saveAsList = True
+        for e in self.ignoreExprs:
+            e.streamline()
+        if not self.keepTabs:
+            instring = instring.expandtabs()
+        try:
+            loc, tokens = self._parse( instring, 0 )
+            if parseAll:
+                loc = self.preParse( instring, loc )
+                se = Empty() + StringEnd()
+                se._parse( instring, loc )
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+        else:
+            return tokens
+
+    def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
+        """
+        Scan the input string for expression matches.  Each match will return the
+        matching tokens, start location, and end location.  May be called with optional
+        C{maxMatches} argument, to clip scanning after 'n' matches are found.  If
+        C{overlap} is specified, then overlapping matches will be reported.
+
+        Note that the start and end locations are reported relative to the string
+        being parsed.  See L{I{parseString}<parseString>} for more information on parsing
+        strings with embedded tabs.
+
+        Example::
+            source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
+            print(source)
+            for tokens,start,end in Word(alphas).scanString(source):
+                print(' '*start + '^'*(end-start))
+                print(' '*start + tokens[0])
+        
+        prints::
+        
+            sldjf123lsdjjkf345sldkjf879lkjsfd987
+            ^^^^^
+            sldjf
+                    ^^^^^^^
+                    lsdjjkf
+                              ^^^^^^
+                              sldkjf
+                                       ^^^^^^
+                                       lkjsfd
+        """
+        if not self.streamlined:
+            self.streamline()
+        for e in self.ignoreExprs:
+            e.streamline()
+
+        if not self.keepTabs:
+            instring = _ustr(instring).expandtabs()
+        instrlen = len(instring)
+        loc = 0
+        preparseFn = self.preParse
+        parseFn = self._parse
+        ParserElement.resetCache()
+        matches = 0
+        try:
+            while loc <= instrlen and matches < maxMatches:
+                try:
+                    preloc = preparseFn( instring, loc )
+                    nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
+                except ParseException:
+                    loc = preloc+1
+                else:
+                    if nextLoc > loc:
+                        matches += 1
+                        yield tokens, preloc, nextLoc
+                        if overlap:
+                            nextloc = preparseFn( instring, loc )
+                            if nextloc > loc:
+                                loc = nextLoc
+                            else:
+                                loc += 1
+                        else:
+                            loc = nextLoc
+                    else:
+                        loc = preloc+1
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def transformString( self, instring ):
+        """
+        Extension to C{L{scanString}}, to modify matching text with modified tokens that may
+        be returned from a parse action.  To use C{transformString}, define a grammar and
+        attach a parse action to it that modifies the returned token list.
+        Invoking C{transformString()} on a target string will then scan for matches,
+        and replace the matched text patterns according to the logic in the parse
+        action.  C{transformString()} returns the resulting transformed string.
+        
+        Example::
+            wd = Word(alphas)
+            wd.setParseAction(lambda toks: toks[0].title())
+            
+            print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
+        Prints::
+            Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
+        """
+        out = []
+        lastE = 0
+        # force preservation of <TAB>s, to minimize unwanted transformation of string, and to
+        # keep string locs straight between transformString and scanString
+        self.keepTabs = True
+        try:
+            for t,s,e in self.scanString( instring ):
+                out.append( instring[lastE:s] )
+                if t:
+                    if isinstance(t,ParseResults):
+                        out += t.asList()
+                    elif isinstance(t,list):
+                        out += t
+                    else:
+                        out.append(t)
+                lastE = e
+            out.append(instring[lastE:])
+            out = [o for o in out if o]
+            return "".join(map(_ustr,_flatten(out)))
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def searchString( self, instring, maxMatches=_MAX_INT ):
+        """
+        Another extension to C{L{scanString}}, simplifying the access to the tokens found
+        to match the given parse expression.  May be called with optional
+        C{maxMatches} argument, to clip searching after 'n' matches are found.
+        
+        Example::
+            # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
+            cap_word = Word(alphas.upper(), alphas.lower())
+            
+            print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
+
+            # the sum() builtin can be used to merge results into a single ParseResults object
+            print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
+        prints::
+            [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
+            ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
+        """
+        try:
+            return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
+        """
+        Generator method to split a string using the given expression as a separator.
+        May be called with optional C{maxsplit} argument, to limit the number of splits;
+        and the optional C{includeSeparators} argument (default=C{False}), if the separating
+        matching text should be included in the split results.
+        
+        Example::        
+            punc = oneOf(list(".,;:/-!?"))
+            print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
+        prints::
+            ['This', ' this', '', ' this sentence', ' is badly punctuated', '']
+        """
+        splits = 0
+        last = 0
+        for t,s,e in self.scanString(instring, maxMatches=maxsplit):
+            yield instring[last:s]
+            if includeSeparators:
+                yield t[0]
+            last = e
+        yield instring[last:]
+
+    def __add__(self, other ):
+        """
+        Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
+        converts them to L{Literal}s by default.
+        
+        Example::
+            greet = Word(alphas) + "," + Word(alphas) + "!"
+            hello = "Hello, World!"
+            print (hello, "->", greet.parseString(hello))
+        Prints::
+            Hello, World! -> ['Hello', ',', 'World', '!']
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return And( [ self, other ] )
+
+    def __radd__(self, other ):
+        """
+        Implementation of + operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other + self
+
+    def __sub__(self, other):
+        """
+        Implementation of - operator, returns C{L{And}} with error stop
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return self + And._ErrorStop() + other
+
+    def __rsub__(self, other ):
+        """
+        Implementation of - operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other - self
+
+    def __mul__(self,other):
+        """
+        Implementation of * operator, allows use of C{expr * 3} in place of
+        C{expr + expr + expr}.  Expressions may also me multiplied by a 2-integer
+        tuple, similar to C{{min,max}} multipliers in regular expressions.  Tuples
+        may also include C{None} as in:
+         - C{expr*(n,None)} or C{expr*(n,)} is equivalent
+              to C{expr*n + L{ZeroOrMore}(expr)}
+              (read as "at least n instances of C{expr}")
+         - C{expr*(None,n)} is equivalent to C{expr*(0,n)}
+              (read as "0 to n instances of C{expr}")
+         - C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
+         - C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
+
+        Note that C{expr*(None,n)} does not raise an exception if
+        more than n exprs exist in the input stream; that is,
+        C{expr*(None,n)} does not enforce a maximum number of expr
+        occurrences.  If this behavior is desired, then write
+        C{expr*(None,n) + ~expr}
+        """
+        if isinstance(other,int):
+            minElements, optElements = other,0
+        elif isinstance(other,tuple):
+            other = (other + (None, None))[:2]
+            if other[0] is None:
+                other = (0, other[1])
+            if isinstance(other[0],int) and other[1] is None:
+                if other[0] == 0:
+                    return ZeroOrMore(self)
+                if other[0] == 1:
+                    return OneOrMore(self)
+                else:
+                    return self*other[0] + ZeroOrMore(self)
+            elif isinstance(other[0],int) and isinstance(other[1],int):
+                minElements, optElements = other
+                optElements -= minElements
+            else:
+                raise TypeError("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1]))
+        else:
+            raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
+
+        if minElements < 0:
+            raise ValueError("cannot multiply ParserElement by negative value")
+        if optElements < 0:
+            raise ValueError("second tuple value must be greater or equal to first tuple value")
+        if minElements == optElements == 0:
+            raise ValueError("cannot multiply ParserElement by 0 or (0,0)")
+
+        if (optElements):
+            def makeOptionalList(n):
+                if n>1:
+                    return Optional(self + makeOptionalList(n-1))
+                else:
+                    return Optional(self)
+            if minElements:
+                if minElements == 1:
+                    ret = self + makeOptionalList(optElements)
+                else:
+                    ret = And([self]*minElements) + makeOptionalList(optElements)
+            else:
+                ret = makeOptionalList(optElements)
+        else:
+            if minElements == 1:
+                ret = self
+            else:
+                ret = And([self]*minElements)
+        return ret
+
+    def __rmul__(self, other):
+        return self.__mul__(other)
+
+    def __or__(self, other ):
+        """
+        Implementation of | operator - returns C{L{MatchFirst}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return MatchFirst( [ self, other ] )
+
+    def __ror__(self, other ):
+        """
+        Implementation of | operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other | self
+
+    def __xor__(self, other ):
+        """
+        Implementation of ^ operator - returns C{L{Or}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return Or( [ self, other ] )
+
+    def __rxor__(self, other ):
+        """
+        Implementation of ^ operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other ^ self
+
+    def __and__(self, other ):
+        """
+        Implementation of & operator - returns C{L{Each}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return Each( [ self, other ] )
+
+    def __rand__(self, other ):
+        """
+        Implementation of & operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other & self
+
+    def __invert__( self ):
+        """
+        Implementation of ~ operator - returns C{L{NotAny}}
+        """
+        return NotAny( self )
+
+    def __call__(self, name=None):
+        """
+        Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
+        
+        If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
+        passed as C{True}.
+           
+        If C{name} is omitted, same as calling C{L{copy}}.
+
+        Example::
+            # these are equivalent
+            userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
+            userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")             
+        """
+        if name is not None:
+            return self.setResultsName(name)
+        else:
+            return self.copy()
+
+    def suppress( self ):
+        """
+        Suppresses the output of this C{ParserElement}; useful to keep punctuation from
+        cluttering up returned output.
+        """
+        return Suppress( self )
+
+    def leaveWhitespace( self ):
+        """
+        Disables the skipping of whitespace before matching the characters in the
+        C{ParserElement}'s defined pattern.  This is normally only used internally by
+        the pyparsing module, but may be needed in some whitespace-sensitive grammars.
+        """
+        self.skipWhitespace = False
+        return self
+
+    def setWhitespaceChars( self, chars ):
+        """
+        Overrides the default whitespace chars
+        """
+        self.skipWhitespace = True
+        self.whiteChars = chars
+        self.copyDefaultWhiteChars = False
+        return self
+
+    def parseWithTabs( self ):
+        """
+        Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
+        Must be called before C{parseString} when the input grammar contains elements that
+        match C{<TAB>} characters.
+        """
+        self.keepTabs = True
+        return self
+
+    def ignore( self, other ):
+        """
+        Define expression to be ignored (e.g., comments) while doing pattern
+        matching; may be called repeatedly, to define multiple comment or other
+        ignorable patterns.
+        
+        Example::
+            patt = OneOrMore(Word(alphas))
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
+            
+            patt.ignore(cStyleComment)
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
+        """
+        if isinstance(other, basestring):
+            other = Suppress(other)
+
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                self.ignoreExprs.append(other)
+        else:
+            self.ignoreExprs.append( Suppress( other.copy() ) )
+        return self
+
+    def setDebugActions( self, startAction, successAction, exceptionAction ):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        """
+        self.debugActions = (startAction or _defaultStartDebugAction,
+                             successAction or _defaultSuccessDebugAction,
+                             exceptionAction or _defaultExceptionDebugAction)
+        self.debug = True
+        return self
+
+    def setDebug( self, flag=True ):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        Set C{flag} to True to enable, False to disable.
+
+        Example::
+            wd = Word(alphas).setName("alphaword")
+            integer = Word(nums).setName("numword")
+            term = wd | integer
+            
+            # turn on debugging for wd
+            wd.setDebug()
+
+            OneOrMore(term).parseString("abc 123 xyz 890")
+        
+        prints::
+            Match alphaword at loc 0(1,1)
+            Matched alphaword -> ['abc']
+            Match alphaword at loc 3(1,4)
+            Exception raised:Expected alphaword (at char 4), (line:1, col:5)
+            Match alphaword at loc 7(1,8)
+            Matched alphaword -> ['xyz']
+            Match alphaword at loc 11(1,12)
+            Exception raised:Expected alphaword (at char 12), (line:1, col:13)
+            Match alphaword at loc 15(1,16)
+            Exception raised:Expected alphaword (at char 15), (line:1, col:16)
+
+        The output shown is that produced by the default debug actions - custom debug actions can be
+        specified using L{setDebugActions}. Prior to attempting
+        to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
+        is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
+        message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
+        which makes debugging and exception messages easier to understand - for instance, the default
+        name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
+        """
+        if flag:
+            self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
+        else:
+            self.debug = False
+        return self
+
+    def __str__( self ):
+        return self.name
+
+    def __repr__( self ):
+        return _ustr(self)
+
+    def streamline( self ):
+        self.streamlined = True
+        self.strRepr = None
+        return self
+
+    def checkRecursion( self, parseElementList ):
+        pass
+
+    def validate( self, validateTrace=[] ):
+        """
+        Check defined expressions for valid structure, check for infinite recursive definitions.
+        """
+        self.checkRecursion( [] )
+
+    def parseFile( self, file_or_filename, parseAll=False ):
+        """
+        Execute the parse expression on the given file or filename.
+        If a filename is specified (instead of a file object),
+        the entire file is opened, read, and closed before parsing.
+        """
+        try:
+            file_contents = file_or_filename.read()
+        except AttributeError:
+            with open(file_or_filename, "r") as f:
+                file_contents = f.read()
+        try:
+            return self.parseString(file_contents, parseAll)
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def __eq__(self,other):
+        if isinstance(other, ParserElement):
+            return self is other or vars(self) == vars(other)
+        elif isinstance(other, basestring):
+            return self.matches(other)
+        else:
+            return super(ParserElement,self)==other
+
+    def __ne__(self,other):
+        return not (self == other)
+
+    def __hash__(self):
+        return hash(id(self))
+
+    def __req__(self,other):
+        return self == other
+
+    def __rne__(self,other):
+        return not (self == other)
+
+    def matches(self, testString, parseAll=True):
+        """
+        Method for quick testing of a parser against a test string. Good for simple 
+        inline microtests of sub expressions while building up larger parser.
+           
+        Parameters:
+         - testString - to test against this expression for a match
+         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
+            
+        Example::
+            expr = Word(nums)
+            assert expr.matches("100")
+        """
+        try:
+            self.parseString(_ustr(testString), parseAll=parseAll)
+            return True
+        except ParseBaseException:
+            return False
+                
+    def runTests(self, tests, parseAll=True, comment='#', fullDump=True, printResults=True, failureTests=False):
+        """
+        Execute the parse expression on a series of test strings, showing each
+        test, the parsed results or where the parse failed. Quick and easy way to
+        run a parse expression against a list of sample strings.
+           
+        Parameters:
+         - tests - a list of separate test strings, or a multiline string of test strings
+         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests           
+         - comment - (default=C{'#'}) - expression for indicating embedded comments in the test 
+              string; pass None to disable comment filtering
+         - fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
+              if False, only dump nested list
+         - printResults - (default=C{True}) prints test output to stdout
+         - failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
+
+        Returns: a (success, results) tuple, where success indicates that all tests succeeded
+        (or failed if C{failureTests} is True), and the results contain a list of lines of each 
+        test's output
+        
+        Example::
+            number_expr = pyparsing_common.number.copy()
+
+            result = number_expr.runTests('''
+                # unsigned integer
+                100
+                # negative integer
+                -100
+                # float with scientific notation
+                6.02e23
+                # integer with scientific notation
+                1e-12
+                ''')
+            print("Success" if result[0] else "Failed!")
+
+            result = number_expr.runTests('''
+                # stray character
+                100Z
+                # missing leading digit before '.'
+                -.100
+                # too many '.'
+                3.14.159
+                ''', failureTests=True)
+            print("Success" if result[0] else "Failed!")
+        prints::
+            # unsigned integer
+            100
+            [100]
+
+            # negative integer
+            -100
+            [-100]
+
+            # float with scientific notation
+            6.02e23
+            [6.02e+23]
+
+            # integer with scientific notation
+            1e-12
+            [1e-12]
+
+            Success
+            
+            # stray character
+            100Z
+               ^
+            FAIL: Expected end of text (at char 3), (line:1, col:4)
+
+            # missing leading digit before '.'
+            -.100
+            ^
+            FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
+
+            # too many '.'
+            3.14.159
+                ^
+            FAIL: Expected end of text (at char 4), (line:1, col:5)
+
+            Success
+
+        Each test string must be on a single line. If you want to test a string that spans multiple
+        lines, create a test like this::
+
+            expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
+        
+        (Note that this is a raw string literal, you must include the leading 'r'.)
+        """
+        if isinstance(tests, basestring):
+            tests = list(map(str.strip, tests.rstrip().splitlines()))
+        if isinstance(comment, basestring):
+            comment = Literal(comment)
+        allResults = []
+        comments = []
+        success = True
+        for t in tests:
+            if comment is not None and comment.matches(t, False) or comments and not t:
+                comments.append(t)
+                continue
+            if not t:
+                continue
+            out = ['\n'.join(comments), t]
+            comments = []
+            try:
+                t = t.replace(r'\n','\n')
+                result = self.parseString(t, parseAll=parseAll)
+                out.append(result.dump(full=fullDump))
+                success = success and not failureTests
+            except ParseBaseException as pe:
+                fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
+                if '\n' in t:
+                    out.append(line(pe.loc, t))
+                    out.append(' '*(col(pe.loc,t)-1) + '^' + fatal)
+                else:
+                    out.append(' '*pe.loc + '^' + fatal)
+                out.append("FAIL: " + str(pe))
+                success = success and failureTests
+                result = pe
+            except Exception as exc:
+                out.append("FAIL-EXCEPTION: " + str(exc))
+                success = success and failureTests
+                result = exc
+
+            if printResults:
+                if fullDump:
+                    out.append('')
+                print('\n'.join(out))
+
+            allResults.append((t, result))
+        
+        return success, allResults
+
+        
+class Token(ParserElement):
+    """
+    Abstract C{ParserElement} subclass, for defining atomic matching patterns.
+    """
+    def __init__( self ):
+        super(Token,self).__init__( savelist=False )
+
+
+class Empty(Token):
+    """
+    An empty token, will always match.
+    """
+    def __init__( self ):
+        super(Empty,self).__init__()
+        self.name = "Empty"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+
+class NoMatch(Token):
+    """
+    A token that will never match.
+    """
+    def __init__( self ):
+        super(NoMatch,self).__init__()
+        self.name = "NoMatch"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.errmsg = "Unmatchable token"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Literal(Token):
+    """
+    Token to exactly match a specified string.
+    
+    Example::
+        Literal('blah').parseString('blah')  # -> ['blah']
+        Literal('blah').parseString('blahfooblah')  # -> ['blah']
+        Literal('blah').parseString('bla')  # -> Exception: Expected "blah"
+    
+    For case-insensitive matching, use L{CaselessLiteral}.
+    
+    For keyword matching (force word break before and after the matched string),
+    use L{Keyword} or L{CaselessKeyword}.
+    """
+    def __init__( self, matchString ):
+        super(Literal,self).__init__()
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Literal; use Empty() instead",
+                            SyntaxWarning, stacklevel=2)
+            self.__class__ = Empty
+        self.name = '"%s"' % _ustr(self.match)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+
+    # Performance tuning: this routine gets called a *lot*
+    # if this is a single character match string  and the first character matches,
+    # short-circuit as quickly as possible, and avoid calling startswith
+    #~ @profile
+    def parseImpl( self, instring, loc, doActions=True ):
+        if (instring[loc] == self.firstMatchChar and
+            (self.matchLen==1 or instring.startswith(self.match,loc)) ):
+            return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+_L = Literal
+ParserElement._literalStringClass = Literal
+
+class Keyword(Token):
+    """
+    Token to exactly match a specified string as a keyword, that is, it must be
+    immediately followed by a non-keyword character.  Compare with C{L{Literal}}:
+     - C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
+     - C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
+    Accepts two optional constructor arguments in addition to the keyword string:
+     - C{identChars} is a string of characters that would be valid identifier characters,
+          defaulting to all alphanumerics + "_" and "$"
+     - C{caseless} allows case-insensitive matching, default is C{False}.
+       
+    Example::
+        Keyword("start").parseString("start")  # -> ['start']
+        Keyword("start").parseString("starting")  # -> Exception
+
+    For case-insensitive matching, use L{CaselessKeyword}.
+    """
+    DEFAULT_KEYWORD_CHARS = alphanums+"_$"
+
+    def __init__( self, matchString, identChars=None, caseless=False ):
+        super(Keyword,self).__init__()
+        if identChars is None:
+            identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Keyword; use Empty() instead",
+                            SyntaxWarning, stacklevel=2)
+        self.name = '"%s"' % self.match
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+        self.caseless = caseless
+        if caseless:
+            self.caselessmatch = matchString.upper()
+            identChars = identChars.upper()
+        self.identChars = set(identChars)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.caseless:
+            if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
+                 (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
+                 (loc == 0 or instring[loc-1].upper() not in self.identChars) ):
+                return loc+self.matchLen, self.match
+        else:
+            if (instring[loc] == self.firstMatchChar and
+                (self.matchLen==1 or instring.startswith(self.match,loc)) and
+                (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
+                (loc == 0 or instring[loc-1] not in self.identChars) ):
+                return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+    def copy(self):
+        c = super(Keyword,self).copy()
+        c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        return c
+
+    @staticmethod
+    def setDefaultKeywordChars( chars ):
+        """Overrides the default Keyword chars
+        """
+        Keyword.DEFAULT_KEYWORD_CHARS = chars
+
+class CaselessLiteral(Literal):
+    """
+    Token to match a specified string, ignoring case of letters.
+    Note: the matched results will always be in the case of the given
+    match string, NOT the case of the input text.
+
+    Example::
+        OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
+        
+    (Contrast with example for L{CaselessKeyword}.)
+    """
+    def __init__( self, matchString ):
+        super(CaselessLiteral,self).__init__( matchString.upper() )
+        # Preserve the defining literal.
+        self.returnString = matchString
+        self.name = "'%s'" % self.returnString
+        self.errmsg = "Expected " + self.name
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if instring[ loc:loc+self.matchLen ].upper() == self.match:
+            return loc+self.matchLen, self.returnString
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class CaselessKeyword(Keyword):
+    """
+    Caseless version of L{Keyword}.
+
+    Example::
+        OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
+        
+    (Contrast with example for L{CaselessLiteral}.)
+    """
+    def __init__( self, matchString, identChars=None ):
+        super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
+             (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
+            return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class CloseMatch(Token):
+    """
+    A variation on L{Literal} which matches "close" matches, that is, 
+    strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
+     - C{match_string} - string to be matched
+     - C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
+    
+    The results from a successful parse will contain the matched text from the input string and the following named results:
+     - C{mismatches} - a list of the positions within the match_string where mismatches were found
+     - C{original} - the original match_string used to compare against the input string
+    
+    If C{mismatches} is an empty list, then the match was an exact match.
+    
+    Example::
+        patt = CloseMatch("ATCATCGAATGGA")
+        patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
+        patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
+
+        # exact match
+        patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
+
+        # close match allowing up to 2 mismatches
+        patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
+        patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
+    """
+    def __init__(self, match_string, maxMismatches=1):
+        super(CloseMatch,self).__init__()
+        self.name = match_string
+        self.match_string = match_string
+        self.maxMismatches = maxMismatches
+        self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
+        self.mayIndexError = False
+        self.mayReturnEmpty = False
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        start = loc
+        instrlen = len(instring)
+        maxloc = start + len(self.match_string)
+
+        if maxloc <= instrlen:
+            match_string = self.match_string
+            match_stringloc = 0
+            mismatches = []
+            maxMismatches = self.maxMismatches
+
+            for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
+                src,mat = s_m
+                if src != mat:
+                    mismatches.append(match_stringloc)
+                    if len(mismatches) > maxMismatches:
+                        break
+            else:
+                loc = match_stringloc + 1
+                results = ParseResults([instring[start:loc]])
+                results['original'] = self.match_string
+                results['mismatches'] = mismatches
+                return loc, results
+
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Word(Token):
+    """
+    Token for matching words composed of allowed character sets.
+    Defined with string containing all allowed initial characters,
+    an optional string containing allowed body characters (if omitted,
+    defaults to the initial character set), and an optional minimum,
+    maximum, and/or exact length.  The default value for C{min} is 1 (a
+    minimum value < 1 is not valid); the default values for C{max} and C{exact}
+    are 0, meaning no maximum or exact length restriction. An optional
+    C{excludeChars} parameter can list characters that might be found in 
+    the input C{bodyChars} string; useful to define a word of all printables
+    except for one or two characters, for instance.
+    
+    L{srange} is useful for defining custom character set strings for defining 
+    C{Word} expressions, using range notation from regular expression character sets.
+    
+    A common mistake is to use C{Word} to match a specific literal string, as in 
+    C{Word("Address")}. Remember that C{Word} uses the string argument to define
+    I{sets} of matchable characters. This expression would match "Add", "AAA",
+    "dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
+    To match an exact literal string, use L{Literal} or L{Keyword}.
+
+    pyparsing includes helper strings for building Words:
+     - L{alphas}
+     - L{nums}
+     - L{alphanums}
+     - L{hexnums}
+     - L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
+     - L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
+     - L{printables} (any non-whitespace character)
+
+    Example::
+        # a word composed of digits
+        integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
+        
+        # a word with a leading capital, and zero or more lowercase
+        capital_word = Word(alphas.upper(), alphas.lower())
+
+        # hostnames are alphanumeric, with leading alpha, and '-'
+        hostname = Word(alphas, alphanums+'-')
+        
+        # roman numeral (not a strict parser, accepts invalid mix of characters)
+        roman = Word("IVXLCDM")
+        
+        # any string of non-whitespace characters, except for ','
+        csv_value = Word(printables, excludeChars=",")
+    """
+    def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
+        super(Word,self).__init__()
+        if excludeChars:
+            initChars = ''.join(c for c in initChars if c not in excludeChars)
+            if bodyChars:
+                bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
+        self.initCharsOrig = initChars
+        self.initChars = set(initChars)
+        if bodyChars :
+            self.bodyCharsOrig = bodyChars
+            self.bodyChars = set(bodyChars)
+        else:
+            self.bodyCharsOrig = initChars
+            self.bodyChars = set(initChars)
+
+        self.maxSpecified = max > 0
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.asKeyword = asKeyword
+
+        if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
+            if self.bodyCharsOrig == self.initCharsOrig:
+                self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
+            elif len(self.initCharsOrig) == 1:
+                self.reString = "%s[%s]*" % \
+                                      (re.escape(self.initCharsOrig),
+                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
+            else:
+                self.reString = "[%s][%s]*" % \
+                                      (_escapeRegexRangeChars(self.initCharsOrig),
+                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
+            if self.asKeyword:
+                self.reString = r"\b"+self.reString+r"\b"
+            try:
+                self.re = re.compile( self.reString )
+            except Exception:
+                self.re = None
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.re:
+            result = self.re.match(instring,loc)
+            if not result:
+                raise ParseException(instring, loc, self.errmsg, self)
+
+            loc = result.end()
+            return loc, result.group()
+
+        if not(instring[ loc ] in self.initChars):
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        instrlen = len(instring)
+        bodychars = self.bodyChars
+        maxloc = start + self.maxLen
+        maxloc = min( maxloc, instrlen )
+        while loc < maxloc and instring[loc] in bodychars:
+            loc += 1
+
+        throwException = False
+        if loc - start < self.minLen:
+            throwException = True
+        if self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
+            throwException = True
+        if self.asKeyword:
+            if (start>0 and instring[start-1] in bodychars) or (loc<instrlen and instring[loc] in bodychars):
+                throwException = True
+
+        if throwException:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__( self ):
+        try:
+            return super(Word,self).__str__()
+        except Exception:
+            pass
+
+
+        if self.strRepr is None:
+
+            def charsAsStr(s):
+                if len(s)>4:
+                    return s[:4]+"..."
+                else:
+                    return s
+
+            if ( self.initCharsOrig != self.bodyCharsOrig ):
+                self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
+            else:
+                self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
+
+        return self.strRepr
+
+
+class Regex(Token):
+    r"""
+    Token for matching strings that match a given regular expression.
+    Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
+    If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as 
+    named parse results.
+
+    Example::
+        realnum = Regex(r"[+-]?\d+\.\d*")
+        date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
+        # ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
+        roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
+    """
+    compiledREtype = type(re.compile("[A-Z]"))
+    def __init__( self, pattern, flags=0):
+        """The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags."""
+        super(Regex,self).__init__()
+
+        if isinstance(pattern, basestring):
+            if not pattern:
+                warnings.warn("null string passed to Regex; use Empty() instead",
+                        SyntaxWarning, stacklevel=2)
+
+            self.pattern = pattern
+            self.flags = flags
+
+            try:
+                self.re = re.compile(self.pattern, self.flags)
+                self.reString = self.pattern
+            except sre_constants.error:
+                warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
+                    SyntaxWarning, stacklevel=2)
+                raise
+
+        elif isinstance(pattern, Regex.compiledREtype):
+            self.re = pattern
+            self.pattern = \
+            self.reString = str(pattern)
+            self.flags = flags
+            
+        else:
+            raise ValueError("Regex may only be constructed with a string or a compiled RE object")
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        result = self.re.match(instring,loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        d = result.groupdict()
+        ret = ParseResults(result.group())
+        if d:
+            for k in d:
+                ret[k] = d[k]
+        return loc,ret
+
+    def __str__( self ):
+        try:
+            return super(Regex,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "Re:(%s)" % repr(self.pattern)
+
+        return self.strRepr
+
+
+class QuotedString(Token):
+    r"""
+    Token for matching strings that are delimited by quoting characters.
+    
+    Defined with the following parameters:
+        - quoteChar - string of one or more characters defining the quote delimiting string
+        - escChar - character to escape quotes, typically backslash (default=C{None})
+        - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
+        - multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
+        - unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
+        - endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
+        - convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
+
+    Example::
+        qs = QuotedString('"')
+        print(qs.searchString('lsjdf "This is the quote" sldjf'))
+        complex_qs = QuotedString('{{', endQuoteChar='}}')
+        print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
+        sql_qs = QuotedString('"', escQuote='""')
+        print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
+    prints::
+        [['This is the quote']]
+        [['This is the "quote"']]
+        [['This is the quote with "embedded" quotes']]
+    """
+    def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
+        super(QuotedString,self).__init__()
+
+        # remove white space from quote chars - wont work anyway
+        quoteChar = quoteChar.strip()
+        if not quoteChar:
+            warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
+            raise SyntaxError()
+
+        if endQuoteChar is None:
+            endQuoteChar = quoteChar
+        else:
+            endQuoteChar = endQuoteChar.strip()
+            if not endQuoteChar:
+                warnings.warn("endQuoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
+                raise SyntaxError()
+
+        self.quoteChar = quoteChar
+        self.quoteCharLen = len(quoteChar)
+        self.firstQuoteChar = quoteChar[0]
+        self.endQuoteChar = endQuoteChar
+        self.endQuoteCharLen = len(endQuoteChar)
+        self.escChar = escChar
+        self.escQuote = escQuote
+        self.unquoteResults = unquoteResults
+        self.convertWhitespaceEscapes = convertWhitespaceEscapes
+
+        if multiline:
+            self.flags = re.MULTILINE | re.DOTALL
+            self.pattern = r'%s(?:[^%s%s]' % \
+                ( re.escape(self.quoteChar),
+                  _escapeRegexRangeChars(self.endQuoteChar[0]),
+                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
+        else:
+            self.flags = 0
+            self.pattern = r'%s(?:[^%s\n\r%s]' % \
+                ( re.escape(self.quoteChar),
+                  _escapeRegexRangeChars(self.endQuoteChar[0]),
+                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
+        if len(self.endQuoteChar) > 1:
+            self.pattern += (
+                '|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
+                                               _escapeRegexRangeChars(self.endQuoteChar[i]))
+                                    for i in range(len(self.endQuoteChar)-1,0,-1)) + ')'
+                )
+        if escQuote:
+            self.pattern += (r'|(?:%s)' % re.escape(escQuote))
+        if escChar:
+            self.pattern += (r'|(?:%s.)' % re.escape(escChar))
+            self.escCharReplacePattern = re.escape(self.escChar)+"(.)"
+        self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
+
+        try:
+            self.re = re.compile(self.pattern, self.flags)
+            self.reString = self.pattern
+        except sre_constants.error:
+            warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
+                SyntaxWarning, stacklevel=2)
+            raise
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = result.group()
+
+        if self.unquoteResults:
+
+            # strip off quotes
+            ret = ret[self.quoteCharLen:-self.endQuoteCharLen]
+
+            if isinstance(ret,basestring):
+                # replace escaped whitespace
+                if '\\' in ret and self.convertWhitespaceEscapes:
+                    ws_map = {
+                        r'\t' : '\t',
+                        r'\n' : '\n',
+                        r'\f' : '\f',
+                        r'\r' : '\r',
+                    }
+                    for wslit,wschar in ws_map.items():
+                        ret = ret.replace(wslit, wschar)
+
+                # replace escaped characters
+                if self.escChar:
+                    ret = re.sub(self.escCharReplacePattern, r"\g<1>", ret)
+
+                # replace escaped quotes
+                if self.escQuote:
+                    ret = ret.replace(self.escQuote, self.endQuoteChar)
+
+        return loc, ret
+
+    def __str__( self ):
+        try:
+            return super(QuotedString,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
+
+        return self.strRepr
+
+
+class CharsNotIn(Token):
+    """
+    Token for matching words composed of characters I{not} in a given set (will
+    include whitespace in matched characters if not listed in the provided exclusion set - see example).
+    Defined with string containing all disallowed characters, and an optional
+    minimum, maximum, and/or exact length.  The default value for C{min} is 1 (a
+    minimum value < 1 is not valid); the default values for C{max} and C{exact}
+    are 0, meaning no maximum or exact length restriction.
+
+    Example::
+        # define a comma-separated-value as anything that is not a ','
+        csv_value = CharsNotIn(',')
+        print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
+    prints::
+        ['dkls', 'lsdkjf', 's12 34', '@!#', '213']
+    """
+    def __init__( self, notChars, min=1, max=0, exact=0 ):
+        super(CharsNotIn,self).__init__()
+        self.skipWhitespace = False
+        self.notChars = notChars
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = ( self.minLen == 0 )
+        self.mayIndexError = False
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if instring[loc] in self.notChars:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        notchars = self.notChars
+        maxlen = min( start+self.maxLen, len(instring) )
+        while loc < maxlen and \
+              (instring[loc] not in notchars):
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__( self ):
+        try:
+            return super(CharsNotIn, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            if len(self.notChars) > 4:
+                self.strRepr = "!W:(%s...)" % self.notChars[:4]
+            else:
+                self.strRepr = "!W:(%s)" % self.notChars
+
+        return self.strRepr
+
+class White(Token):
+    """
+    Special matching class for matching whitespace.  Normally, whitespace is ignored
+    by pyparsing grammars.  This class is included when some whitespace structures
+    are significant.  Define with a string containing the whitespace characters to be
+    matched; default is C{" \\t\\r\\n"}.  Also takes optional C{min}, C{max}, and C{exact} arguments,
+    as defined for the C{L{Word}} class.
+    """
+    whiteStrs = {
+        " " : "<SPC>",
+        "\t": "<TAB>",
+        "\n": "<LF>",
+        "\r": "<CR>",
+        "\f": "<FF>",
+        }
+    def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
+        super(White,self).__init__()
+        self.matchWhite = ws
+        self.setWhitespaceChars( "".join(c for c in self.whiteChars if c not in self.matchWhite) )
+        #~ self.leaveWhitespace()
+        self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
+        self.mayReturnEmpty = True
+        self.errmsg = "Expected " + self.name
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if not(instring[ loc ] in self.matchWhite):
+            raise ParseException(instring, loc, self.errmsg, self)
+        start = loc
+        loc += 1
+        maxloc = start + self.maxLen
+        maxloc = min( maxloc, len(instring) )
+        while loc < maxloc and instring[loc] in self.matchWhite:
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+
+class _PositionToken(Token):
+    def __init__( self ):
+        super(_PositionToken,self).__init__()
+        self.name=self.__class__.__name__
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+class GoToColumn(_PositionToken):
+    """
+    Token to advance to a specific column of input text; useful for tabular report scraping.
+    """
+    def __init__( self, colno ):
+        super(GoToColumn,self).__init__()
+        self.col = colno
+
+    def preParse( self, instring, loc ):
+        if col(loc,instring) != self.col:
+            instrlen = len(instring)
+            if self.ignoreExprs:
+                loc = self._skipIgnorables( instring, loc )
+            while loc < instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
+                loc += 1
+        return loc
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        thiscol = col( loc, instring )
+        if thiscol > self.col:
+            raise ParseException( instring, loc, "Text not in expected column", self )
+        newloc = loc + self.col - thiscol
+        ret = instring[ loc: newloc ]
+        return newloc, ret
+
+
+class LineStart(_PositionToken):
+    """
+    Matches if current position is at the beginning of a line within the parse string
+    
+    Example::
+    
+        test = '''\
+        AAA this line
+        AAA and this line
+          AAA but not this one
+        B AAA and definitely not this one
+        '''
+
+        for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
+            print(t)
+    
+    Prints::
+        ['AAA', ' this line']
+        ['AAA', ' and this line']    
+
+    """
+    def __init__( self ):
+        super(LineStart,self).__init__()
+        self.errmsg = "Expected start of line"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if col(loc, instring) == 1:
+            return loc, []
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class LineEnd(_PositionToken):
+    """
+    Matches if current position is at the end of a line within the parse string
+    """
+    def __init__( self ):
+        super(LineEnd,self).__init__()
+        self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") )
+        self.errmsg = "Expected end of line"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc<len(instring):
+            if instring[loc] == "\n":
+                return loc+1, "\n"
+            else:
+                raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc+1, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class StringStart(_PositionToken):
+    """
+    Matches if current position is at the beginning of the parse string
+    """
+    def __init__( self ):
+        super(StringStart,self).__init__()
+        self.errmsg = "Expected start of text"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc != 0:
+            # see if entire string up to here is just whitespace and ignoreables
+            if loc != self.preParse( instring, 0 ):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class StringEnd(_PositionToken):
+    """
+    Matches if current position is at the end of the parse string
+    """
+    def __init__( self ):
+        super(StringEnd,self).__init__()
+        self.errmsg = "Expected end of text"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc < len(instring):
+            raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc+1, []
+        elif loc > len(instring):
+            return loc, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class WordStart(_PositionToken):
+    """
+    Matches if the current position is at the beginning of a Word, and
+    is not preceded by any character in a given set of C{wordChars}
+    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
+    use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
+    the string being parsed, or at the beginning of a line.
+    """
+    def __init__(self, wordChars = printables):
+        super(WordStart,self).__init__()
+        self.wordChars = set(wordChars)
+        self.errmsg = "Not at the start of a word"
+
+    def parseImpl(self, instring, loc, doActions=True ):
+        if loc != 0:
+            if (instring[loc-1] in self.wordChars or
+                instring[loc] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class WordEnd(_PositionToken):
+    """
+    Matches if the current position is at the end of a Word, and
+    is not followed by any character in a given set of C{wordChars}
+    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
+    use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
+    the string being parsed, or at the end of a line.
+    """
+    def __init__(self, wordChars = printables):
+        super(WordEnd,self).__init__()
+        self.wordChars = set(wordChars)
+        self.skipWhitespace = False
+        self.errmsg = "Not at the end of a word"
+
+    def parseImpl(self, instring, loc, doActions=True ):
+        instrlen = len(instring)
+        if instrlen>0 and loc<instrlen:
+            if (instring[loc] in self.wordChars or
+                instring[loc-1] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+
+class ParseExpression(ParserElement):
+    """
+    Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(ParseExpression,self).__init__(savelist)
+        if isinstance( exprs, _generatorType ):
+            exprs = list(exprs)
+
+        if isinstance( exprs, basestring ):
+            self.exprs = [ ParserElement._literalStringClass( exprs ) ]
+        elif isinstance( exprs, Iterable ):
+            exprs = list(exprs)
+            # if sequence of strings provided, wrap with Literal
+            if all(isinstance(expr, basestring) for expr in exprs):
+                exprs = map(ParserElement._literalStringClass, exprs)
+            self.exprs = list(exprs)
+        else:
+            try:
+                self.exprs = list( exprs )
+            except TypeError:
+                self.exprs = [ exprs ]
+        self.callPreparse = False
+
+    def __getitem__( self, i ):
+        return self.exprs[i]
+
+    def append( self, other ):
+        self.exprs.append( other )
+        self.strRepr = None
+        return self
+
+    def leaveWhitespace( self ):
+        """Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
+           all contained expressions."""
+        self.skipWhitespace = False
+        self.exprs = [ e.copy() for e in self.exprs ]
+        for e in self.exprs:
+            e.leaveWhitespace()
+        return self
+
+    def ignore( self, other ):
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                super( ParseExpression, self).ignore( other )
+                for e in self.exprs:
+                    e.ignore( self.ignoreExprs[-1] )
+        else:
+            super( ParseExpression, self).ignore( other )
+            for e in self.exprs:
+                e.ignore( self.ignoreExprs[-1] )
+        return self
+
+    def __str__( self ):
+        try:
+            return super(ParseExpression,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.exprs) )
+        return self.strRepr
+
+    def streamline( self ):
+        super(ParseExpression,self).streamline()
+
+        for e in self.exprs:
+            e.streamline()
+
+        # collapse nested And's of the form And( And( And( a,b), c), d) to And( a,b,c,d )
+        # but only if there are no parse actions or resultsNames on the nested And's
+        # (likewise for Or's and MatchFirst's)
+        if ( len(self.exprs) == 2 ):
+            other = self.exprs[0]
+            if ( isinstance( other, self.__class__ ) and
+                  not(other.parseAction) and
+                  other.resultsName is None and
+                  not other.debug ):
+                self.exprs = other.exprs[:] + [ self.exprs[1] ]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+            other = self.exprs[-1]
+            if ( isinstance( other, self.__class__ ) and
+                  not(other.parseAction) and
+                  other.resultsName is None and
+                  not other.debug ):
+                self.exprs = self.exprs[:-1] + other.exprs[:]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+        self.errmsg = "Expected " + _ustr(self)
+        
+        return self
+
+    def setResultsName( self, name, listAllMatches=False ):
+        ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
+        return ret
+
+    def validate( self, validateTrace=[] ):
+        tmp = validateTrace[:]+[self]
+        for e in self.exprs:
+            e.validate(tmp)
+        self.checkRecursion( [] )
+        
+    def copy(self):
+        ret = super(ParseExpression,self).copy()
+        ret.exprs = [e.copy() for e in self.exprs]
+        return ret
+
+class And(ParseExpression):
+    """
+    Requires all given C{ParseExpression}s to be found in the given order.
+    Expressions may be separated by whitespace.
+    May be constructed using the C{'+'} operator.
+    May also be constructed using the C{'-'} operator, which will suppress backtracking.
+
+    Example::
+        integer = Word(nums)
+        name_expr = OneOrMore(Word(alphas))
+
+        expr = And([integer("id"),name_expr("name"),integer("age")])
+        # more easily written as:
+        expr = integer("id") + name_expr("name") + integer("age")
+    """
+
+    class _ErrorStop(Empty):
+        def __init__(self, *args, **kwargs):
+            super(And._ErrorStop,self).__init__(*args, **kwargs)
+            self.name = '-'
+            self.leaveWhitespace()
+
+    def __init__( self, exprs, savelist = True ):
+        super(And,self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.setWhitespaceChars( self.exprs[0].whiteChars )
+        self.skipWhitespace = self.exprs[0].skipWhitespace
+        self.callPreparse = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        # pass False as last arg to _parse for first element, since we already
+        # pre-parsed the string as part of our And pre-parsing
+        loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
+        errorStop = False
+        for e in self.exprs[1:]:
+            if isinstance(e, And._ErrorStop):
+                errorStop = True
+                continue
+            if errorStop:
+                try:
+                    loc, exprtokens = e._parse( instring, loc, doActions )
+                except ParseSyntaxException:
+                    raise
+                except ParseBaseException as pe:
+                    pe.__traceback__ = None
+                    raise ParseSyntaxException._from_exception(pe)
+                except IndexError:
+                    raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
+            else:
+                loc, exprtokens = e._parse( instring, loc, doActions )
+            if exprtokens or exprtokens.haskeys():
+                resultlist += exprtokens
+        return loc, resultlist
+
+    def __iadd__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #And( [ self, other ] )
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+            if not e.mayReturnEmpty:
+                break
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+
+class Or(ParseExpression):
+    """
+    Requires that at least one C{ParseExpression} is found.
+    If two expressions match, the expression that matches the longest string will be used.
+    May be constructed using the C{'^'} operator.
+
+    Example::
+        # construct Or using '^' operator
+        
+        number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789"))
+    prints::
+        [['123'], ['3.1416'], ['789']]
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(Or,self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        maxExcLoc = -1
+        maxException = None
+        matches = []
+        for e in self.exprs:
+            try:
+                loc2 = e.tryParse( instring, loc )
+            except ParseException as err:
+                err.__traceback__ = None
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring,len(instring),e.errmsg,self)
+                    maxExcLoc = len(instring)
+            else:
+                # save match among all matches, to retry longest to shortest
+                matches.append((loc2, e))
+
+        if matches:
+            matches.sort(key=lambda x: -x[0])
+            for _,e in matches:
+                try:
+                    return e._parse( instring, loc, doActions )
+                except ParseException as err:
+                    err.__traceback__ = None
+                    if err.loc > maxExcLoc:
+                        maxException = err
+                        maxExcLoc = err.loc
+
+        if maxException is not None:
+            maxException.msg = self.errmsg
+            raise maxException
+        else:
+            raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+
+    def __ixor__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #Or( [ self, other ] )
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class MatchFirst(ParseExpression):
+    """
+    Requires that at least one C{ParseExpression} is found.
+    If two expressions match, the first one listed is the one that will match.
+    May be constructed using the C{'|'} operator.
+
+    Example::
+        # construct MatchFirst using '|' operator
+        
+        # watch the order of expressions to match
+        number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789")) #  Fail! -> [['123'], ['3'], ['1416'], ['789']]
+
+        # put more selective expression first
+        number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
+        print(number.searchString("123 3.1416 789")) #  Better -> [['123'], ['3.1416'], ['789']]
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(MatchFirst,self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        maxExcLoc = -1
+        maxException = None
+        for e in self.exprs:
+            try:
+                ret = e._parse( instring, loc, doActions )
+                return ret
+            except ParseException as err:
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring,len(instring),e.errmsg,self)
+                    maxExcLoc = len(instring)
+
+        # only got here if no expression matched, raise exception for match that made it the furthest
+        else:
+            if maxException is not None:
+                maxException.msg = self.errmsg
+                raise maxException
+            else:
+                raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+    def __ior__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #MatchFirst( [ self, other ] )
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class Each(ParseExpression):
+    """
+    Requires all given C{ParseExpression}s to be found, but in any order.
+    Expressions may be separated by whitespace.
+    May be constructed using the C{'&'} operator.
+
+    Example::
+        color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
+        shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
+        integer = Word(nums)
+        shape_attr = "shape:" + shape_type("shape")
+        posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
+        color_attr = "color:" + color("color")
+        size_attr = "size:" + integer("size")
+
+        # use Each (using operator '&') to accept attributes in any order 
+        # (shape and posn are required, color and size are optional)
+        shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
+
+        shape_spec.runTests('''
+            shape: SQUARE color: BLACK posn: 100, 120
+            shape: CIRCLE size: 50 color: BLUE posn: 50,80
+            color:GREEN size:20 shape:TRIANGLE posn:20,40
+            '''
+            )
+    prints::
+        shape: SQUARE color: BLACK posn: 100, 120
+        ['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
+        - color: BLACK
+        - posn: ['100', ',', '120']
+          - x: 100
+          - y: 120
+        - shape: SQUARE
+
+
+        shape: CIRCLE size: 50 color: BLUE posn: 50,80
+        ['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
+        - color: BLUE
+        - posn: ['50', ',', '80']
+          - x: 50
+          - y: 80
+        - shape: CIRCLE
+        - size: 50
+
+
+        color: GREEN size: 20 shape: TRIANGLE posn: 20,40
+        ['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
+        - color: GREEN
+        - posn: ['20', ',', '40']
+          - x: 20
+          - y: 40
+        - shape: TRIANGLE
+        - size: 20
+    """
+    def __init__( self, exprs, savelist = True ):
+        super(Each,self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.skipWhitespace = True
+        self.initExprGroups = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.initExprGroups:
+            self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
+            opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
+            opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
+            self.optionals = opt1 + opt2
+            self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
+            self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
+            self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
+            self.required += self.multirequired
+            self.initExprGroups = False
+        tmpLoc = loc
+        tmpReqd = self.required[:]
+        tmpOpt  = self.optionals[:]
+        matchOrder = []
+
+        keepMatching = True
+        while keepMatching:
+            tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
+            failed = []
+            for e in tmpExprs:
+                try:
+                    tmpLoc = e.tryParse( instring, tmpLoc )
+                except ParseException:
+                    failed.append(e)
+                else:
+                    matchOrder.append(self.opt1map.get(id(e),e))
+                    if e in tmpReqd:
+                        tmpReqd.remove(e)
+                    elif e in tmpOpt:
+                        tmpOpt.remove(e)
+            if len(failed) == len(tmpExprs):
+                keepMatching = False
+
+        if tmpReqd:
+            missing = ", ".join(_ustr(e) for e in tmpReqd)
+            raise ParseException(instring,loc,"Missing one or more required elements (%s)" % missing )
+
+        # add any unmatched Optionals, in case they have default values defined
+        matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]
+
+        resultlist = []
+        for e in matchOrder:
+            loc,results = e._parse(instring,loc,doActions)
+            resultlist.append(results)
+
+        finalResults = sum(resultlist, ParseResults([]))
+        return loc, finalResults
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class ParseElementEnhance(ParserElement):
+    """
+    Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
+    """
+    def __init__( self, expr, savelist=False ):
+        super(ParseElementEnhance,self).__init__(savelist)
+        if isinstance( expr, basestring ):
+            if issubclass(ParserElement._literalStringClass, Token):
+                expr = ParserElement._literalStringClass(expr)
+            else:
+                expr = ParserElement._literalStringClass(Literal(expr))
+        self.expr = expr
+        self.strRepr = None
+        if expr is not None:
+            self.mayIndexError = expr.mayIndexError
+            self.mayReturnEmpty = expr.mayReturnEmpty
+            self.setWhitespaceChars( expr.whiteChars )
+            self.skipWhitespace = expr.skipWhitespace
+            self.saveAsList = expr.saveAsList
+            self.callPreparse = expr.callPreparse
+            self.ignoreExprs.extend(expr.ignoreExprs)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.expr is not None:
+            return self.expr._parse( instring, loc, doActions, callPreParse=False )
+        else:
+            raise ParseException("",loc,self.errmsg,self)
+
+    def leaveWhitespace( self ):
+        self.skipWhitespace = False
+        self.expr = self.expr.copy()
+        if self.expr is not None:
+            self.expr.leaveWhitespace()
+        return self
+
+    def ignore( self, other ):
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                super( ParseElementEnhance, self).ignore( other )
+                if self.expr is not None:
+                    self.expr.ignore( self.ignoreExprs[-1] )
+        else:
+            super( ParseElementEnhance, self).ignore( other )
+            if self.expr is not None:
+                self.expr.ignore( self.ignoreExprs[-1] )
+        return self
+
+    def streamline( self ):
+        super(ParseElementEnhance,self).streamline()
+        if self.expr is not None:
+            self.expr.streamline()
+        return self
+
+    def checkRecursion( self, parseElementList ):
+        if self in parseElementList:
+            raise RecursiveGrammarException( parseElementList+[self] )
+        subRecCheckList = parseElementList[:] + [ self ]
+        if self.expr is not None:
+            self.expr.checkRecursion( subRecCheckList )
+
+    def validate( self, validateTrace=[] ):
+        tmp = validateTrace[:]+[self]
+        if self.expr is not None:
+            self.expr.validate(tmp)
+        self.checkRecursion( [] )
+
+    def __str__( self ):
+        try:
+            return super(ParseElementEnhance,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None and self.expr is not None:
+            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) )
+        return self.strRepr
+
+
+class FollowedBy(ParseElementEnhance):
+    """
+    Lookahead matching of the given parse expression.  C{FollowedBy}
+    does I{not} advance the parsing position within the input string, it only
+    verifies that the specified parse expression matches at the current
+    position.  C{FollowedBy} always returns a null token list.
+
+    Example::
+        # use FollowedBy to match a label only if it is followed by a ':'
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        
+        OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
+    prints::
+        [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
+    """
+    def __init__( self, expr ):
+        super(FollowedBy,self).__init__(expr)
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        self.expr.tryParse( instring, loc )
+        return loc, []
+
+
+class NotAny(ParseElementEnhance):
+    """
+    Lookahead to disallow matching with the given parse expression.  C{NotAny}
+    does I{not} advance the parsing position within the input string, it only
+    verifies that the specified parse expression does I{not} match at the current
+    position.  Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
+    always returns a null token list.  May be constructed using the '~' operator.
+
+    Example::
+        
+    """
+    def __init__( self, expr ):
+        super(NotAny,self).__init__(expr)
+        #~ self.leaveWhitespace()
+        self.skipWhitespace = False  # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
+        self.mayReturnEmpty = True
+        self.errmsg = "Found unwanted token, "+_ustr(self.expr)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.expr.canParseNext(instring, loc):
+            raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "~{" + _ustr(self.expr) + "}"
+
+        return self.strRepr
+
+class _MultipleMatch(ParseElementEnhance):
+    def __init__( self, expr, stopOn=None):
+        super(_MultipleMatch, self).__init__(expr)
+        self.saveAsList = True
+        ender = stopOn
+        if isinstance(ender, basestring):
+            ender = ParserElement._literalStringClass(ender)
+        self.not_ender = ~ender if ender is not None else None
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        self_expr_parse = self.expr._parse
+        self_skip_ignorables = self._skipIgnorables
+        check_ender = self.not_ender is not None
+        if check_ender:
+            try_not_ender = self.not_ender.tryParse
+        
+        # must be at least one (but first see if we are the stopOn sentinel;
+        # if so, fail)
+        if check_ender:
+            try_not_ender(instring, loc)
+        loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
+        try:
+            hasIgnoreExprs = (not not self.ignoreExprs)
+            while 1:
+                if check_ender:
+                    try_not_ender(instring, loc)
+                if hasIgnoreExprs:
+                    preloc = self_skip_ignorables( instring, loc )
+                else:
+                    preloc = loc
+                loc, tmptokens = self_expr_parse( instring, preloc, doActions )
+                if tmptokens or tmptokens.haskeys():
+                    tokens += tmptokens
+        except (ParseException,IndexError):
+            pass
+
+        return loc, tokens
+        
+class OneOrMore(_MultipleMatch):
+    """
+    Repetition of one or more of the given expression.
+    
+    Parameters:
+     - expr - expression that must match one or more times
+     - stopOn - (default=C{None}) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition 
+          expression)          
+
+    Example::
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: BLACK"
+        OneOrMore(attr_expr).parseString(text).pprint()  # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
+
+        # use stopOn attribute for OneOrMore to avoid reading label string as part of the data
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
+        
+        # could also be written as
+        (attr_expr * (1,)).parseString(text).pprint()
+    """
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + _ustr(self.expr) + "}..."
+
+        return self.strRepr
+
+class ZeroOrMore(_MultipleMatch):
+    """
+    Optional repetition of zero or more of the given expression.
+    
+    Parameters:
+     - expr - expression that must match zero or more times
+     - stopOn - (default=C{None}) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition 
+          expression)          
+
+    Example: similar to L{OneOrMore}
+    """
+    def __init__( self, expr, stopOn=None):
+        super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
+        self.mayReturnEmpty = True
+        
+    def parseImpl( self, instring, loc, doActions=True ):
+        try:
+            return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
+        except (ParseException,IndexError):
+            return loc, []
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]..."
+
+        return self.strRepr
+
+class _NullToken(object):
+    def __bool__(self):
+        return False
+    __nonzero__ = __bool__
+    def __str__(self):
+        return ""
+
+_optionalNotMatched = _NullToken()
+class Optional(ParseElementEnhance):
+    """
+    Optional matching of the given expression.
+
+    Parameters:
+     - expr - expression that must match zero or more times
+     - default (optional) - value to be returned if the optional expression is not found.
+
+    Example::
+        # US postal code can be a 5-digit zip, plus optional 4-digit qualifier
+        zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
+        zip.runTests('''
+            # traditional ZIP code
+            12345
+            
+            # ZIP+4 form
+            12101-0001
+            
+            # invalid ZIP
+            98765-
+            ''')
+    prints::
+        # traditional ZIP code
+        12345
+        ['12345']
+
+        # ZIP+4 form
+        12101-0001
+        ['12101-0001']
+
+        # invalid ZIP
+        98765-
+             ^
+        FAIL: Expected end of text (at char 5), (line:1, col:6)
+    """
+    def __init__( self, expr, default=_optionalNotMatched ):
+        super(Optional,self).__init__( expr, savelist=False )
+        self.saveAsList = self.expr.saveAsList
+        self.defaultValue = default
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        try:
+            loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
+        except (ParseException,IndexError):
+            if self.defaultValue is not _optionalNotMatched:
+                if self.expr.resultsName:
+                    tokens = ParseResults([ self.defaultValue ])
+                    tokens[self.expr.resultsName] = self.defaultValue
+                else:
+                    tokens = [ self.defaultValue ]
+            else:
+                tokens = []
+        return loc, tokens
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]"
+
+        return self.strRepr
+
+class SkipTo(ParseElementEnhance):
+    """
+    Token for skipping over all undefined text until the matched expression is found.
+
+    Parameters:
+     - expr - target expression marking the end of the data to be skipped
+     - include - (default=C{False}) if True, the target expression is also parsed 
+          (the skipped text and target expression are returned as a 2-element list).
+     - ignore - (default=C{None}) used to define grammars (typically quoted strings and 
+          comments) that might contain false matches to the target expression
+     - failOn - (default=C{None}) define expressions that are not allowed to be 
+          included in the skipped test; if found before the target expression is found, 
+          the SkipTo is not a match
+
+    Example::
+        report = '''
+            Outstanding Issues Report - 1 Jan 2000
+
+               # | Severity | Description                               |  Days Open
+            -----+----------+-------------------------------------------+-----------
+             101 | Critical | Intermittent system crash                 |          6
+              94 | Cosmetic | Spelling error on Login ('log|n')         |         14
+              79 | Minor    | System slow when running too many reports |         47
+            '''
+        integer = Word(nums)
+        SEP = Suppress('|')
+        # use SkipTo to simply match everything up until the next SEP
+        # - ignore quoted strings, so that a '|' character inside a quoted string does not match
+        # - parse action will call token.strip() for each matched token, i.e., the description body
+        string_data = SkipTo(SEP, ignore=quotedString)
+        string_data.setParseAction(tokenMap(str.strip))
+        ticket_expr = (integer("issue_num") + SEP 
+                      + string_data("sev") + SEP 
+                      + string_data("desc") + SEP 
+                      + integer("days_open"))
+        
+        for tkt in ticket_expr.searchString(report):
+            print tkt.dump()
+    prints::
+        ['101', 'Critical', 'Intermittent system crash', '6']
+        - days_open: 6
+        - desc: Intermittent system crash
+        - issue_num: 101
+        - sev: Critical
+        ['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
+        - days_open: 14
+        - desc: Spelling error on Login ('log|n')
+        - issue_num: 94
+        - sev: Cosmetic
+        ['79', 'Minor', 'System slow when running too many reports', '47']
+        - days_open: 47
+        - desc: System slow when running too many reports
+        - issue_num: 79
+        - sev: Minor
+    """
+    def __init__( self, other, include=False, ignore=None, failOn=None ):
+        super( SkipTo, self ).__init__( other )
+        self.ignoreExpr = ignore
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.includeMatch = include
+        self.asList = False
+        if isinstance(failOn, basestring):
+            self.failOn = ParserElement._literalStringClass(failOn)
+        else:
+            self.failOn = failOn
+        self.errmsg = "No match found for "+_ustr(self.expr)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        startloc = loc
+        instrlen = len(instring)
+        expr = self.expr
+        expr_parse = self.expr._parse
+        self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
+        self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
+        
+        tmploc = loc
+        while tmploc <= instrlen:
+            if self_failOn_canParseNext is not None:
+                # break if failOn expression matches
+                if self_failOn_canParseNext(instring, tmploc):
+                    break
+                    
+            if self_ignoreExpr_tryParse is not None:
+                # advance past ignore expressions
+                while 1:
+                    try:
+                        tmploc = self_ignoreExpr_tryParse(instring, tmploc)
+                    except ParseBaseException:
+                        break
+            
+            try:
+                expr_parse(instring, tmploc, doActions=False, callPreParse=False)
+            except (ParseException, IndexError):
+                # no match, advance loc in string
+                tmploc += 1
+            else:
+                # matched skipto expr, done
+                break
+
+        else:
+            # ran off the end of the input string without matching skipto expr, fail
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        # build up return values
+        loc = tmploc
+        skiptext = instring[startloc:loc]
+        skipresult = ParseResults(skiptext)
+        
+        if self.includeMatch:
+            loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
+            skipresult += mat
+
+        return loc, skipresult
+
+class Forward(ParseElementEnhance):
+    """
+    Forward declaration of an expression to be defined later -
+    used for recursive grammars, such as algebraic infix notation.
+    When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
+
+    Note: take care when assigning to C{Forward} not to overlook precedence of operators.
+    Specifically, '|' has a lower precedence than '<<', so that::
+        fwdExpr << a | b | c
+    will actually be evaluated as::
+        (fwdExpr << a) | b | c
+    thereby leaving b and c out as parseable alternatives.  It is recommended that you
+    explicitly group the values inserted into the C{Forward}::
+        fwdExpr << (a | b | c)
+    Converting to use the '<<=' operator instead will avoid this problem.
+
+    See L{ParseResults.pprint} for an example of a recursive parser created using
+    C{Forward}.
+    """
+    def __init__( self, other=None ):
+        super(Forward,self).__init__( other, savelist=False )
+
+    def __lshift__( self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass(other)
+        self.expr = other
+        self.strRepr = None
+        self.mayIndexError = self.expr.mayIndexError
+        self.mayReturnEmpty = self.expr.mayReturnEmpty
+        self.setWhitespaceChars( self.expr.whiteChars )
+        self.skipWhitespace = self.expr.skipWhitespace
+        self.saveAsList = self.expr.saveAsList
+        self.ignoreExprs.extend(self.expr.ignoreExprs)
+        return self
+        
+    def __ilshift__(self, other):
+        return self << other
+    
+    def leaveWhitespace( self ):
+        self.skipWhitespace = False
+        return self
+
+    def streamline( self ):
+        if not self.streamlined:
+            self.streamlined = True
+            if self.expr is not None:
+                self.expr.streamline()
+        return self
+
+    def validate( self, validateTrace=[] ):
+        if self not in validateTrace:
+            tmp = validateTrace[:]+[self]
+            if self.expr is not None:
+                self.expr.validate(tmp)
+        self.checkRecursion([])
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+        return self.__class__.__name__ + ": ..."
+
+        # stubbed out for now - creates awful memory and perf issues
+        self._revertClass = self.__class__
+        self.__class__ = _ForwardNoRecurse
+        try:
+            if self.expr is not None:
+                retString = _ustr(self.expr)
+            else:
+                retString = "None"
+        finally:
+            self.__class__ = self._revertClass
+        return self.__class__.__name__ + ": " + retString
+
+    def copy(self):
+        if self.expr is not None:
+            return super(Forward,self).copy()
+        else:
+            ret = Forward()
+            ret <<= self
+            return ret
+
+class _ForwardNoRecurse(Forward):
+    def __str__( self ):
+        return "..."
+
+class TokenConverter(ParseElementEnhance):
+    """
+    Abstract subclass of C{ParseExpression}, for converting parsed results.
+    """
+    def __init__( self, expr, savelist=False ):
+        super(TokenConverter,self).__init__( expr )#, savelist )
+        self.saveAsList = False
+
+class Combine(TokenConverter):
+    """
+    Converter to concatenate all matching tokens to a single string.
+    By default, the matching patterns must also be contiguous in the input string;
+    this can be disabled by specifying C{'adjacent=False'} in the constructor.
+
+    Example::
+        real = Word(nums) + '.' + Word(nums)
+        print(real.parseString('3.1416')) # -> ['3', '.', '1416']
+        # will also erroneously match the following
+        print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
+
+        real = Combine(Word(nums) + '.' + Word(nums))
+        print(real.parseString('3.1416')) # -> ['3.1416']
+        # no match when there are internal spaces
+        print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
+    """
+    def __init__( self, expr, joinString="", adjacent=True ):
+        super(Combine,self).__init__( expr )
+        # suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
+        if adjacent:
+            self.leaveWhitespace()
+        self.adjacent = adjacent
+        self.skipWhitespace = True
+        self.joinString = joinString
+        self.callPreparse = True
+
+    def ignore( self, other ):
+        if self.adjacent:
+            ParserElement.ignore(self, other)
+        else:
+            super( Combine, self).ignore( other )
+        return self
+
+    def postParse( self, instring, loc, tokenlist ):
+        retToks = tokenlist.copy()
+        del retToks[:]
+        retToks += ParseResults([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)
+
+        if self.resultsName and retToks.haskeys():
+            return [ retToks ]
+        else:
+            return retToks
+
+class Group(TokenConverter):
+    """
+    Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
+
+    Example::
+        ident = Word(alphas)
+        num = Word(nums)
+        term = ident | num
+        func = ident + Optional(delimitedList(term))
+        print(func.parseString("fn a,b,100"))  # -> ['fn', 'a', 'b', '100']
+
+        func = ident + Group(Optional(delimitedList(term)))
+        print(func.parseString("fn a,b,100"))  # -> ['fn', ['a', 'b', '100']]
+    """
+    def __init__( self, expr ):
+        super(Group,self).__init__( expr )
+        self.saveAsList = True
+
+    def postParse( self, instring, loc, tokenlist ):
+        return [ tokenlist ]
+
+class Dict(TokenConverter):
+    """
+    Converter to return a repetitive expression as a list, but also as a dictionary.
+    Each element can also be referenced using the first token in the expression as its key.
+    Useful for tabular report scraping when the first column can be used as a item key.
+
+    Example::
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        
+        # print attributes as plain groups
+        print(OneOrMore(attr_expr).parseString(text).dump())
+        
+        # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
+        result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
+        print(result.dump())
+        
+        # access named fields as dict entries, or output as dict
+        print(result['shape'])        
+        print(result.asDict())
+    prints::
+        ['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
+
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        {'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
+    See more examples at L{ParseResults} of accessing fields by results name.
+    """
+    def __init__( self, expr ):
+        super(Dict,self).__init__( expr )
+        self.saveAsList = True
+
+    def postParse( self, instring, loc, tokenlist ):
+        for i,tok in enumerate(tokenlist):
+            if len(tok) == 0:
+                continue
+            ikey = tok[0]
+            if isinstance(ikey,int):
+                ikey = _ustr(tok[0]).strip()
+            if len(tok)==1:
+                tokenlist[ikey] = _ParseResultsWithOffset("",i)
+            elif len(tok)==2 and not isinstance(tok[1],ParseResults):
+                tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
+            else:
+                dictvalue = tok.copy() #ParseResults(i)
+                del dictvalue[0]
+                if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
+                else:
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)
+
+        if self.resultsName:
+            return [ tokenlist ]
+        else:
+            return tokenlist
+
+
+class Suppress(TokenConverter):
+    """
+    Converter for ignoring the results of a parsed expression.
+
+    Example::
+        source = "a, b, c,d"
+        wd = Word(alphas)
+        wd_list1 = wd + ZeroOrMore(',' + wd)
+        print(wd_list1.parseString(source))
+
+        # often, delimiters that are useful during parsing are just in the
+        # way afterward - use Suppress to keep them out of the parsed output
+        wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
+        print(wd_list2.parseString(source))
+    prints::
+        ['a', ',', 'b', ',', 'c', ',', 'd']
+        ['a', 'b', 'c', 'd']
+    (See also L{delimitedList}.)
+    """
+    def postParse( self, instring, loc, tokenlist ):
+        return []
+
+    def suppress( self ):
+        return self
+
+
+class OnlyOnce(object):
+    """
+    Wrapper for parse actions, to ensure they are only called once.
+    """
+    def __init__(self, methodCall):
+        self.callable = _trim_arity(methodCall)
+        self.called = False
+    def __call__(self,s,l,t):
+        if not self.called:
+            results = self.callable(s,l,t)
+            self.called = True
+            return results
+        raise ParseException(s,l,"")
+    def reset(self):
+        self.called = False
+
+def traceParseAction(f):
+    """
+    Decorator for debugging parse actions. 
+    
+    When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
+    When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
+
+    Example::
+        wd = Word(alphas)
+
+        @traceParseAction
+        def remove_duplicate_chars(tokens):
+            return ''.join(sorted(set(''.join(tokens))))
+
+        wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
+        print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
+    prints::
+        >>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
+        <<leaving remove_duplicate_chars (ret: 'dfjkls')
+        ['dfjkls']
+    """
+    f = _trim_arity(f)
+    def z(*paArgs):
+        thisFunc = f.__name__
+        s,l,t = paArgs[-3:]
+        if len(paArgs)>3:
+            thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
+        sys.stderr.write( ">>entering %s(line: '%s', %d, %r)\n" % (thisFunc,line(l,s),l,t) )
+        try:
+            ret = f(*paArgs)
+        except Exception as exc:
+            sys.stderr.write( "<<leaving %s (exception: %s)\n" % (thisFunc,exc) )
+            raise
+        sys.stderr.write( "<<leaving %s (ret: %r)\n" % (thisFunc,ret) )
+        return ret
+    try:
+        z.__name__ = f.__name__
+    except AttributeError:
+        pass
+    return z
+
+#
+# global helpers
+#
+def delimitedList( expr, delim=",", combine=False ):
+    """
+    Helper to define a delimited list of expressions - the delimiter defaults to ','.
+    By default, the list elements and delimiters can have intervening whitespace, and
+    comments, but this can be overridden by passing C{combine=True} in the constructor.
+    If C{combine} is set to C{True}, the matching tokens are returned as a single token
+    string, with the delimiters included; otherwise, the matching tokens are returned
+    as a list of tokens, with the delimiters suppressed.
+
+    Example::
+        delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
+        delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
+    """
+    dlName = _ustr(expr)+" ["+_ustr(delim)+" "+_ustr(expr)+"]..."
+    if combine:
+        return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
+    else:
+        return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)
+
+def countedArray( expr, intExpr=None ):
+    """
+    Helper to define a counted list of expressions.
+    This helper defines a pattern of the form::
+        integer expr expr expr...
+    where the leading integer tells how many expr expressions follow.
+    The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
+    
+    If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
+
+    Example::
+        countedArray(Word(alphas)).parseString('2 ab cd ef')  # -> ['ab', 'cd']
+
+        # in this parser, the leading integer value is given in binary,
+        # '10' indicating that 2 values are in the array
+        binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
+        countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef')  # -> ['ab', 'cd']
+    """
+    arrayExpr = Forward()
+    def countFieldParseAction(s,l,t):
+        n = t[0]
+        arrayExpr << (n and Group(And([expr]*n)) or Group(empty))
+        return []
+    if intExpr is None:
+        intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
+    else:
+        intExpr = intExpr.copy()
+    intExpr.setName("arrayLen")
+    intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
+    return ( intExpr + arrayExpr ).setName('(len) ' + _ustr(expr) + '...')
+
+def _flatten(L):
+    ret = []
+    for i in L:
+        if isinstance(i,list):
+            ret.extend(_flatten(i))
+        else:
+            ret.append(i)
+    return ret
+
+def matchPreviousLiteral(expr):
+    """
+    Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks
+    for a 'repeat' of a previous expression.  For example::
+        first = Word(nums)
+        second = matchPreviousLiteral(first)
+        matchExpr = first + ":" + second
+    will match C{"1:1"}, but not C{"1:2"}.  Because this matches a
+    previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
+    If this is not desired, use C{matchPreviousExpr}.
+    Do I{not} use with packrat parsing enabled.
+    """
+    rep = Forward()
+    def copyTokenToRepeater(s,l,t):
+        if t:
+            if len(t) == 1:
+                rep << t[0]
+            else:
+                # flatten t tokens
+                tflat = _flatten(t.asList())
+                rep << And(Literal(tt) for tt in tflat)
+        else:
+            rep << Empty()
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def matchPreviousExpr(expr):
+    """
+    Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks
+    for a 'repeat' of a previous expression.  For example::
+        first = Word(nums)
+        second = matchPreviousExpr(first)
+        matchExpr = first + ":" + second
+    will match C{"1:1"}, but not C{"1:2"}.  Because this matches by
+    expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
+    the expressions are evaluated first, and then compared, so
+    C{"1"} is compared with C{"10"}.
+    Do I{not} use with packrat parsing enabled.
+    """
+    rep = Forward()
+    e2 = expr.copy()
+    rep <<= e2
+    def copyTokenToRepeater(s,l,t):
+        matchTokens = _flatten(t.asList())
+        def mustMatchTheseTokens(s,l,t):
+            theseTokens = _flatten(t.asList())
+            if  theseTokens != matchTokens:
+                raise ParseException("",0,"")
+        rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def _escapeRegexRangeChars(s):
+    #~  escape these chars: ^-]
+    for c in r"\^-]":
+        s = s.replace(c,_bslash+c)
+    s = s.replace("\n",r"\n")
+    s = s.replace("\t",r"\t")
+    return _ustr(s)
+
+def oneOf( strs, caseless=False, useRegex=True ):
+    """
+    Helper to quickly define a set of alternative Literals, and makes sure to do
+    longest-first testing when there is a conflict, regardless of the input order,
+    but returns a C{L{MatchFirst}} for best performance.
+
+    Parameters:
+     - strs - a string of space-delimited literals, or a collection of string literals
+     - caseless - (default=C{False}) - treat all literals as caseless
+     - useRegex - (default=C{True}) - as an optimization, will generate a Regex
+          object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
+          if creating a C{Regex} raises an exception)
+
+    Example::
+        comp_oper = oneOf("< = > <= >= !=")
+        var = Word(alphas)
+        number = Word(nums)
+        term = var | number
+        comparison_expr = term + comp_oper + term
+        print(comparison_expr.searchString("B = 12  AA=23 B<=AA AA>12"))
+    prints::
+        [['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
+    """
+    if caseless:
+        isequal = ( lambda a,b: a.upper() == b.upper() )
+        masks = ( lambda a,b: b.upper().startswith(a.upper()) )
+        parseElementClass = CaselessLiteral
+    else:
+        isequal = ( lambda a,b: a == b )
+        masks = ( lambda a,b: b.startswith(a) )
+        parseElementClass = Literal
+
+    symbols = []
+    if isinstance(strs,basestring):
+        symbols = strs.split()
+    elif isinstance(strs, Iterable):
+        symbols = list(strs)
+    else:
+        warnings.warn("Invalid argument to oneOf, expected string or iterable",
+                SyntaxWarning, stacklevel=2)
+    if not symbols:
+        return NoMatch()
+
+    i = 0
+    while i < len(symbols)-1:
+        cur = symbols[i]
+        for j,other in enumerate(symbols[i+1:]):
+            if ( isequal(other, cur) ):
+                del symbols[i+j+1]
+                break
+            elif ( masks(cur, other) ):
+                del symbols[i+j+1]
+                symbols.insert(i,other)
+                cur = other
+                break
+        else:
+            i += 1
+
+    if not caseless and useRegex:
+        #~ print (strs,"->", "|".join( [ _escapeRegexChars(sym) for sym in symbols] ))
+        try:
+            if len(symbols)==len("".join(symbols)):
+                return Regex( "[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(' | '.join(symbols))
+            else:
+                return Regex( "|".join(re.escape(sym) for sym in symbols) ).setName(' | '.join(symbols))
+        except Exception:
+            warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
+                    SyntaxWarning, stacklevel=2)
+
+
+    # last resort, just use MatchFirst
+    return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
+
+def dictOf( key, value ):
+    """
+    Helper to easily and clearly define a dictionary by specifying the respective patterns
+    for the key and value.  Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
+    in the proper order.  The key pattern can include delimiting markers or punctuation,
+    as long as they are suppressed, thereby leaving the significant key text.  The value
+    pattern can include named results, so that the C{Dict} results can include named token
+    fields.
+
+    Example::
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        print(OneOrMore(attr_expr).parseString(text).dump())
+        
+        attr_label = label
+        attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
+
+        # similar to Dict, but simpler call format
+        result = dictOf(attr_label, attr_value).parseString(text)
+        print(result.dump())
+        print(result['shape'])
+        print(result.shape)  # object attribute access works too
+        print(result.asDict())
+    prints::
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        SQUARE
+        {'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
+    """
+    return Dict( ZeroOrMore( Group ( key + value ) ) )
+
+def originalTextFor(expr, asString=True):
+    """
+    Helper to return the original, untokenized text for a given expression.  Useful to
+    restore the parsed fields of an HTML start tag into the raw tag text itself, or to
+    revert separate tokens with intervening whitespace back to the original matching
+    input text. By default, returns astring containing the original parsed text.  
+       
+    If the optional C{asString} argument is passed as C{False}, then the return value is a 
+    C{L{ParseResults}} containing any results names that were originally matched, and a 
+    single token containing the original matched text from the input string.  So if 
+    the expression passed to C{L{originalTextFor}} contains expressions with defined
+    results names, you must set C{asString} to C{False} if you want to preserve those
+    results name values.
+
+    Example::
+        src = "this is test <b> bold <i>text</i> </b> normal text "
+        for tag in ("b","i"):
+            opener,closer = makeHTMLTags(tag)
+            patt = originalTextFor(opener + SkipTo(closer) + closer)
+            print(patt.searchString(src)[0])
+    prints::
+        ['<b> bold <i>text</i> </b>']
+        ['<i>text</i>']
+    """
+    locMarker = Empty().setParseAction(lambda s,loc,t: loc)
+    endlocMarker = locMarker.copy()
+    endlocMarker.callPreparse = False
+    matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
+    if asString:
+        extractText = lambda s,l,t: s[t._original_start:t._original_end]
+    else:
+        def extractText(s,l,t):
+            t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
+    matchExpr.setParseAction(extractText)
+    matchExpr.ignoreExprs = expr.ignoreExprs
+    return matchExpr
+
+def ungroup(expr): 
+    """
+    Helper to undo pyparsing's default grouping of And expressions, even
+    if all but one are non-empty.
+    """
+    return TokenConverter(expr).setParseAction(lambda t:t[0])
+
+def locatedExpr(expr):
+    """
+    Helper to decorate a returned token with its starting and ending locations in the input string.
+    This helper adds the following results names:
+     - locn_start = location where matched expression begins
+     - locn_end = location where matched expression ends
+     - value = the actual parsed results
+
+    Be careful if the input text contains C{<TAB>} characters, you may want to call
+    C{L{ParserElement.parseWithTabs}}
+
+    Example::
+        wd = Word(alphas)
+        for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
+            print(match)
+    prints::
+        [[0, 'ljsdf', 5]]
+        [[8, 'lksdjjf', 15]]
+        [[18, 'lkkjj', 23]]
+    """
+    locator = Empty().setParseAction(lambda s,l,t: l)
+    return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
+
+
+# convenience constants for positional expressions
+empty       = Empty().setName("empty")
+lineStart   = LineStart().setName("lineStart")
+lineEnd     = LineEnd().setName("lineEnd")
+stringStart = StringStart().setName("stringStart")
+stringEnd   = StringEnd().setName("stringEnd")
+
+_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1])
+_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16)))
+_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
+_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | CharsNotIn(r'\]', exact=1)
+_charRange = Group(_singleChar + Suppress("-") + _singleChar)
+_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]"
+
+def srange(s):
+    r"""
+    Helper to easily define string ranges for use in Word construction.  Borrows
+    syntax from regexp '[]' string range definitions::
+        srange("[0-9]")   -> "0123456789"
+        srange("[a-z]")   -> "abcdefghijklmnopqrstuvwxyz"
+        srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
+    The input string must be enclosed in []'s, and the returned string is the expanded
+    character set joined into a single string.
+    The values enclosed in the []'s may be:
+     - a single character
+     - an escaped character with a leading backslash (such as C{\-} or C{\]})
+     - an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character) 
+         (C{\0x##} is also supported for backwards compatibility) 
+     - an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
+     - a range of any of the above, separated by a dash (C{'a-z'}, etc.)
+     - any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
+    """
+    _expanded = lambda p: p if not isinstance(p,ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
+    try:
+        return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
+    except Exception:
+        return ""
+
+def matchOnlyAtCol(n):
+    """
+    Helper method for defining parse actions that require matching at a specific
+    column in the input text.
+    """
+    def verifyCol(strg,locn,toks):
+        if col(locn,strg) != n:
+            raise ParseException(strg,locn,"matched token not at column %d" % n)
+    return verifyCol
+
+def replaceWith(replStr):
+    """
+    Helper method for common parse actions that simply return a literal value.  Especially
+    useful when used with C{L{transformString<ParserElement.transformString>}()}.
+
+    Example::
+        num = Word(nums).setParseAction(lambda toks: int(toks[0]))
+        na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
+        term = na | num
+        
+        OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
+    """
+    return lambda s,l,t: [replStr]
+
+def removeQuotes(s,l,t):
+    """
+    Helper parse action for removing quotation marks from parsed quoted strings.
+
+    Example::
+        # by default, quotation marks are included in parsed results
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
+
+        # use removeQuotes to strip quotation marks from parsed results
+        quotedString.setParseAction(removeQuotes)
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
+    """
+    return t[0][1:-1]
+
+def tokenMap(func, *args):
+    """
+    Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional 
+    args are passed, they are forwarded to the given function as additional arguments after
+    the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
+    parsed data to an integer using base 16.
+
+    Example (compare the last to example in L{ParserElement.transformString}::
+        hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
+        hex_ints.runTests('''
+            00 11 22 aa FF 0a 0d 1a
+            ''')
+        
+        upperword = Word(alphas).setParseAction(tokenMap(str.upper))
+        OneOrMore(upperword).runTests('''
+            my kingdom for a horse
+            ''')
+
+        wd = Word(alphas).setParseAction(tokenMap(str.title))
+        OneOrMore(wd).setParseAction(' '.join).runTests('''
+            now is the winter of our discontent made glorious summer by this sun of york
+            ''')
+    prints::
+        00 11 22 aa FF 0a 0d 1a
+        [0, 17, 34, 170, 255, 10, 13, 26]
+
+        my kingdom for a horse
+        ['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
+
+        now is the winter of our discontent made glorious summer by this sun of york
+        ['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
+    """
+    def pa(s,l,t):
+        return [func(tokn, *args) for tokn in t]
+
+    try:
+        func_name = getattr(func, '__name__', 
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    pa.__name__ = func_name
+
+    return pa
+
+upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
+"""(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}"""
+
+downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
+"""(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}"""
+    
+def _makeTags(tagStr, xml):
+    """Internal helper to construct opening and closing tag expressions, given a tag name"""
+    if isinstance(tagStr,basestring):
+        resname = tagStr
+        tagStr = Keyword(tagStr, caseless=not xml)
+    else:
+        resname = tagStr.name
+
+    tagAttrName = Word(alphas,alphanums+"_-:")
+    if (xml):
+        tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
+        openTag = Suppress("<") + tagStr("tag") + \
+                Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \
+                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
+    else:
+        printablesLessRAbrack = "".join(c for c in printables if c not in ">")
+        tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
+        openTag = Suppress("<") + tagStr("tag") + \
+                Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
+                Optional( Suppress("=") + tagAttrValue ) ))) + \
+                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
+    closeTag = Combine(_L("</") + tagStr + ">")
+
+    openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % resname)
+    closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("</%s>" % resname)
+    openTag.tag = resname
+    closeTag.tag = resname
+    return openTag, closeTag
+
+def makeHTMLTags(tagStr):
+    """
+    Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
+    tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
+
+    Example::
+        text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
+        # makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
+        a,a_end = makeHTMLTags("A")
+        link_expr = a + SkipTo(a_end)("link_text") + a_end
+        
+        for link in link_expr.searchString(text):
+            # attributes in the <A> tag (like "href" shown here) are also accessible as named results
+            print(link.link_text, '->', link.href)
+    prints::
+        pyparsing -> http://pyparsing.wikispaces.com
+    """
+    return _makeTags( tagStr, False )
+
+def makeXMLTags(tagStr):
+    """
+    Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
+    tags only in the given upper/lower case.
+
+    Example: similar to L{makeHTMLTags}
+    """
+    return _makeTags( tagStr, True )
+
+def withAttribute(*args,**attrDict):
+    """
+    Helper to create a validating parse action to be used with start tags created
+    with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
+    with a required attribute value, to avoid false matches on common tags such as
+    C{<TD>} or C{<DIV>}.
+
+    Call C{withAttribute} with a series of attribute names and values. Specify the list
+    of filter attributes names and values as:
+     - keyword arguments, as in C{(align="right")}, or
+     - as an explicit dict with C{**} operator, when an attribute name is also a Python
+          reserved word, as in C{**{"class":"Customer", "align":"right"}}
+     - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
+    For attribute names with a namespace prefix, you must use the second form.  Attribute
+    names are matched insensitive to upper/lower case.
+       
+    If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
+
+    To verify that the attribute exists, but without specifying a value, pass
+    C{withAttribute.ANY_VALUE} as the value.
+
+    Example::
+        html = '''
+            <div>
+            Some text
+            <div type="grid">1 4 0 1 0</div>
+            <div type="graph">1,3 2,3 1,1</div>
+            <div>this has no type</div>
+            </div>
+                
+        '''
+        div,div_end = makeHTMLTags("div")
+
+        # only match div tag having a type attribute with value "grid"
+        div_grid = div().setParseAction(withAttribute(type="grid"))
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+        
+        # construct a match with any div tag having a type attribute, regardless of the value
+        div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+    prints::
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    if args:
+        attrs = args[:]
+    else:
+        attrs = attrDict.items()
+    attrs = [(k,v) for k,v in attrs]
+    def pa(s,l,tokens):
+        for attrName,attrValue in attrs:
+            if attrName not in tokens:
+                raise ParseException(s,l,"no matching attribute " + attrName)
+            if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
+                raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" %
+                                            (attrName, tokens[attrName], attrValue))
+    return pa
+withAttribute.ANY_VALUE = object()
+
+def withClass(classname, namespace=''):
+    """
+    Simplified version of C{L{withAttribute}} when matching on a div class - made
+    difficult because C{class} is a reserved word in Python.
+
+    Example::
+        html = '''
+            <div>
+            Some text
+            <div class="grid">1 4 0 1 0</div>
+            <div class="graph">1,3 2,3 1,1</div>
+            <div>this &lt;div&gt; has no class</div>
+            </div>
+                
+        '''
+        div,div_end = makeHTMLTags("div")
+        div_grid = div().setParseAction(withClass("grid"))
+        
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+        
+        div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+    prints::
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    classattr = "%s:class" % namespace if namespace else "class"
+    return withAttribute(**{classattr : classname})        
+
+opAssoc = _Constants()
+opAssoc.LEFT = object()
+opAssoc.RIGHT = object()
+
+def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ):
+    """
+    Helper method for constructing grammars of expressions made up of
+    operators working in a precedence hierarchy.  Operators may be unary or
+    binary, left- or right-associative.  Parse actions can also be attached
+    to operator expressions. The generated parser will also recognize the use 
+    of parentheses to override operator precedences (see example below).
+    
+    Note: if you define a deep operator list, you may see performance issues
+    when using infixNotation. See L{ParserElement.enablePackrat} for a
+    mechanism to potentially improve your parser performance.
+
+    Parameters:
+     - baseExpr - expression representing the most basic element for the nested
+     - opList - list of tuples, one for each operator precedence level in the
+      expression grammar; each tuple is of the form
+      (opExpr, numTerms, rightLeftAssoc, parseAction), where:
+       - opExpr is the pyparsing expression for the operator;
+          may also be a string, which will be converted to a Literal;
+          if numTerms is 3, opExpr is a tuple of two expressions, for the
+          two operators separating the 3 terms
+       - numTerms is the number of terms for this operator (must
+          be 1, 2, or 3)
+       - rightLeftAssoc is the indicator whether the operator is
+          right or left associative, using the pyparsing-defined
+          constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
+       - parseAction is the parse action to be associated with
+          expressions matching this operator expression (the
+          parse action tuple member may be omitted); if the parse action
+          is passed a tuple or list of functions, this is equivalent to
+          calling C{setParseAction(*fn)} (L{ParserElement.setParseAction})
+     - lpar - expression for matching left-parentheses (default=C{Suppress('(')})
+     - rpar - expression for matching right-parentheses (default=C{Suppress(')')})
+
+    Example::
+        # simple example of four-function arithmetic with ints and variable names
+        integer = pyparsing_common.signed_integer
+        varname = pyparsing_common.identifier 
+        
+        arith_expr = infixNotation(integer | varname,
+            [
+            ('-', 1, opAssoc.RIGHT),
+            (oneOf('* /'), 2, opAssoc.LEFT),
+            (oneOf('+ -'), 2, opAssoc.LEFT),
+            ])
+        
+        arith_expr.runTests('''
+            5+3*6
+            (5+3)*6
+            -2--11
+            ''', fullDump=False)
+    prints::
+        5+3*6
+        [[5, '+', [3, '*', 6]]]
+
+        (5+3)*6
+        [[[5, '+', 3], '*', 6]]
+
+        -2--11
+        [[['-', 2], '-', ['-', 11]]]
+    """
+    ret = Forward()
+    lastExpr = baseExpr | ( lpar + ret + rpar )
+    for i,operDef in enumerate(opList):
+        opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
+        termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
+        if arity == 3:
+            if opExpr is None or len(opExpr) != 2:
+                raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions")
+            opExpr1, opExpr2 = opExpr
+        thisExpr = Forward().setName(termName)
+        if rightLeftAssoc == opAssoc.LEFT:
+            if arity == 1:
+                matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
+                else:
+                    matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
+            elif arity == 3:
+                matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
+                            Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        elif rightLeftAssoc == opAssoc.RIGHT:
+            if arity == 1:
+                # try to avoid LR with this extra test
+                if not isinstance(opExpr, Optional):
+                    opExpr = Optional(opExpr)
+                matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
+                else:
+                    matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
+            elif arity == 3:
+                matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
+                            Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        else:
+            raise ValueError("operator must indicate right or left associativity")
+        if pa:
+            if isinstance(pa, (tuple, list)):
+                matchExpr.setParseAction(*pa)
+            else:
+                matchExpr.setParseAction(pa)
+        thisExpr <<= ( matchExpr.setName(termName) | lastExpr )
+        lastExpr = thisExpr
+    ret <<= lastExpr
+    return ret
+
+operatorPrecedence = infixNotation
+"""(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release."""
+
+dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"').setName("string enclosed in double quotes")
+sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("string enclosed in single quotes")
+quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"'|
+                       Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("quotedString using single or double quotes")
+unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
+
+def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
+    """
+    Helper method for defining nested lists enclosed in opening and closing
+    delimiters ("(" and ")" are the default).
+
+    Parameters:
+     - opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
+     - closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
+     - content - expression for items within the nested lists (default=C{None})
+     - ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
+
+    If an expression is not provided for the content argument, the nested
+    expression will capture all whitespace-delimited content between delimiters
+    as a list of separate values.
+
+    Use the C{ignoreExpr} argument to define expressions that may contain
+    opening or closing characters that should not be treated as opening
+    or closing characters for nesting, such as quotedString or a comment
+    expression.  Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
+    The default is L{quotedString}, but if no expressions are to be ignored,
+    then pass C{None} for this argument.
+
+    Example::
+        data_type = oneOf("void int short long char float double")
+        decl_data_type = Combine(data_type + Optional(Word('*')))
+        ident = Word(alphas+'_', alphanums+'_')
+        number = pyparsing_common.number
+        arg = Group(decl_data_type + ident)
+        LPAR,RPAR = map(Suppress, "()")
+
+        code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
+
+        c_function = (decl_data_type("type") 
+                      + ident("name")
+                      + LPAR + Optional(delimitedList(arg), [])("args") + RPAR 
+                      + code_body("body"))
+        c_function.ignore(cStyleComment)
+        
+        source_code = '''
+            int is_odd(int x) { 
+                return (x%2); 
+            }
+                
+            int dec_to_hex(char hchar) { 
+                if (hchar >= '0' && hchar <= '9') { 
+                    return (ord(hchar)-ord('0')); 
+                } else { 
+                    return (10+ord(hchar)-ord('A'));
+                } 
+            }
+        '''
+        for func in c_function.searchString(source_code):
+            print("%(name)s (%(type)s) args: %(args)s" % func)
+
+    prints::
+        is_odd (int) args: [['int', 'x']]
+        dec_to_hex (int) args: [['char', 'hchar']]
+    """
+    if opener == closer:
+        raise ValueError("opening and closing strings cannot be the same")
+    if content is None:
+        if isinstance(opener,basestring) and isinstance(closer,basestring):
+            if len(opener) == 1 and len(closer)==1:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr +
+                                    CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+                else:
+                    content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
+                                ).setParseAction(lambda t:t[0].strip()))
+            else:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr + 
+                                    ~Literal(opener) + ~Literal(closer) +
+                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+                else:
+                    content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
+                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+        else:
+            raise ValueError("opening and closing arguments must be strings if no content expression is given")
+    ret = Forward()
+    if ignoreExpr is not None:
+        ret <<= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
+    else:
+        ret <<= Group( Suppress(opener) + ZeroOrMore( ret | content )  + Suppress(closer) )
+    ret.setName('nested %s%s expression' % (opener,closer))
+    return ret
+
+def indentedBlock(blockStatementExpr, indentStack, indent=True):
+    """
+    Helper method for defining space-delimited indentation blocks, such as
+    those used to define block statements in Python source code.
+
+    Parameters:
+     - blockStatementExpr - expression defining syntax of statement that
+            is repeated within the indented block
+     - indentStack - list created by caller to manage indentation stack
+            (multiple statementWithIndentedBlock expressions within a single grammar
+            should share a common indentStack)
+     - indent - boolean indicating whether block must be indented beyond the
+            the current level; set to False for block of left-most statements
+            (default=C{True})
+
+    A valid block must contain at least one C{blockStatement}.
+
+    Example::
+        data = '''
+        def A(z):
+          A1
+          B = 100
+          G = A2
+          A2
+          A3
+        B
+        def BB(a,b,c):
+          BB1
+          def BBA():
+            bba1
+            bba2
+            bba3
+        C
+        D
+        def spam(x,y):
+             def eggs(z):
+                 pass
+        '''
+
+
+        indentStack = [1]
+        stmt = Forward()
+
+        identifier = Word(alphas, alphanums)
+        funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
+        func_body = indentedBlock(stmt, indentStack)
+        funcDef = Group( funcDecl + func_body )
+
+        rvalue = Forward()
+        funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
+        rvalue << (funcCall | identifier | Word(nums))
+        assignment = Group(identifier + "=" + rvalue)
+        stmt << ( funcDef | assignment | identifier )
+
+        module_body = OneOrMore(stmt)
+
+        parseTree = module_body.parseString(data)
+        parseTree.pprint()
+    prints::
+        [['def',
+          'A',
+          ['(', 'z', ')'],
+          ':',
+          [['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
+         'B',
+         ['def',
+          'BB',
+          ['(', 'a', 'b', 'c', ')'],
+          ':',
+          [['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
+         'C',
+         'D',
+         ['def',
+          'spam',
+          ['(', 'x', 'y', ')'],
+          ':',
+          [[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]] 
+    """
+    def checkPeerIndent(s,l,t):
+        if l >= len(s): return
+        curCol = col(l,s)
+        if curCol != indentStack[-1]:
+            if curCol > indentStack[-1]:
+                raise ParseFatalException(s,l,"illegal nesting")
+            raise ParseException(s,l,"not a peer entry")
+
+    def checkSubIndent(s,l,t):
+        curCol = col(l,s)
+        if curCol > indentStack[-1]:
+            indentStack.append( curCol )
+        else:
+            raise ParseException(s,l,"not a subentry")
+
+    def checkUnindent(s,l,t):
+        if l >= len(s): return
+        curCol = col(l,s)
+        if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]):
+            raise ParseException(s,l,"not an unindent")
+        indentStack.pop()
+
+    NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress())
+    INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
+    PEER   = Empty().setParseAction(checkPeerIndent).setName('')
+    UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
+    if indent:
+        smExpr = Group( Optional(NL) +
+            #~ FollowedBy(blockStatementExpr) +
+            INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
+    else:
+        smExpr = Group( Optional(NL) +
+            (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
+    blockStatementExpr.ignore(_bslash + LineEnd())
+    return smExpr.setName('indented block')
+
+alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
+punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
+
+anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:").setName('any tag'))
+_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(),'><& "\''))
+commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
+def replaceHTMLEntity(t):
+    """Helper parser action to replace common HTML entities with their special characters"""
+    return _htmlEntityMap.get(t.entity)
+
+# it's easy to get these comment structures wrong - they're very common, so may as well make them available
+cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
+"Comment of the form C{/* ... */}"
+
+htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
+"Comment of the form C{<!-- ... -->}"
+
+restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
+dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
+"Comment of the form C{// ... (to end of line)}"
+
+cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/'| dblSlashComment).setName("C++ style comment")
+"Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}"
+
+javaStyleComment = cppStyleComment
+"Same as C{L{cppStyleComment}}"
+
+pythonStyleComment = Regex(r"#.*").setName("Python style comment")
+"Comment of the form C{# ... (to end of line)}"
+
+_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',') +
+                                  Optional( Word(" \t") +
+                                            ~Literal(",") + ~LineEnd() ) ) ).streamline().setName("commaItem")
+commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("commaSeparatedList")
+"""(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
+   This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}."""
+
+# some other useful expressions - using lower-case class name since we are really using this as a namespace
+class pyparsing_common:
+    """
+    Here are some common low-level expressions that may be useful in jump-starting parser development:
+     - numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
+     - common L{programming identifiers<identifier>}
+     - network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
+     - ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
+     - L{UUID<uuid>}
+     - L{comma-separated list<comma_separated_list>}
+    Parse actions:
+     - C{L{convertToInteger}}
+     - C{L{convertToFloat}}
+     - C{L{convertToDate}}
+     - C{L{convertToDatetime}}
+     - C{L{stripHTMLTags}}
+     - C{L{upcaseTokens}}
+     - C{L{downcaseTokens}}
+
+    Example::
+        pyparsing_common.number.runTests('''
+            # any int or real number, returned as the appropriate type
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.fnumber.runTests('''
+            # any int or real number, returned as float
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.hex_integer.runTests('''
+            # hex numbers
+            100
+            FF
+            ''')
+
+        pyparsing_common.fraction.runTests('''
+            # fractions
+            1/2
+            -3/4
+            ''')
+
+        pyparsing_common.mixed_integer.runTests('''
+            # mixed fractions
+            1
+            1/2
+            -3/4
+            1-3/4
+            ''')
+
+        import uuid
+        pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+        pyparsing_common.uuid.runTests('''
+            # uuid
+            12345678-1234-5678-1234-567812345678
+            ''')
+    prints::
+        # any int or real number, returned as the appropriate type
+        100
+        [100]
+
+        -100
+        [-100]
+
+        +100
+        [100]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # any int or real number, returned as float
+        100
+        [100.0]
+
+        -100
+        [-100.0]
+
+        +100
+        [100.0]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # hex numbers
+        100
+        [256]
+
+        FF
+        [255]
+
+        # fractions
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        # mixed fractions
+        1
+        [1]
+
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        1-3/4
+        [1.75]
+
+        # uuid
+        12345678-1234-5678-1234-567812345678
+        [UUID('12345678-1234-5678-1234-567812345678')]
+    """
+
+    convertToInteger = tokenMap(int)
+    """
+    Parse action for converting parsed integers to Python int
+    """
+
+    convertToFloat = tokenMap(float)
+    """
+    Parse action for converting parsed numbers to Python float
+    """
+
+    integer = Word(nums).setName("integer").setParseAction(convertToInteger)
+    """expression that parses an unsigned integer, returns an int"""
+
+    hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int,16))
+    """expression that parses a hexadecimal integer, returns an int"""
+
+    signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
+    """expression that parses an integer with optional leading sign, returns an int"""
+
+    fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
+    """fractional expression of an integer divided by an integer, returns a float"""
+    fraction.addParseAction(lambda t: t[0]/t[-1])
+
+    mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
+    """mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
+    mixed_integer.addParseAction(sum)
+
+    real = Regex(r'[+-]?\d+\.\d*').setName("real number").setParseAction(convertToFloat)
+    """expression that parses a floating point number and returns a float"""
+
+    sci_real = Regex(r'[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
+    """expression that parses a floating point number with optional scientific notation and returns a float"""
+
+    # streamlining this expression makes the docs nicer-looking
+    number = (sci_real | real | signed_integer).streamline()
+    """any numeric expression, returns the corresponding Python type"""
+
+    fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
+    """any int or real number, returned as float"""
+    
+    identifier = Word(alphas+'_', alphanums+'_').setName("identifier")
+    """typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
+    
+    ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
+    "IPv4 address (C{0.0.0.0 - 255.255.255.255})"
+
+    _ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
+    _full_ipv6_address = (_ipv6_part + (':' + _ipv6_part)*7).setName("full IPv6 address")
+    _short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part)*(0,6)) + "::" + Optional(_ipv6_part + (':' + _ipv6_part)*(0,6))).setName("short IPv6 address")
+    _short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
+    _mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
+    ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
+    "IPv6 address (long, short, or mixed form)"
+    
+    mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
+    "MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
+
+    @staticmethod
+    def convertToDate(fmt="%Y-%m-%d"):
+        """
+        Helper to create a parse action for converting parsed date string to Python datetime.date
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
+
+        Example::
+            date_expr = pyparsing_common.iso8601_date.copy()
+            date_expr.setParseAction(pyparsing_common.convertToDate())
+            print(date_expr.parseString("1999-12-31"))
+        prints::
+            [datetime.date(1999, 12, 31)]
+        """
+        def cvt_fn(s,l,t):
+            try:
+                return datetime.strptime(t[0], fmt).date()
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    @staticmethod
+    def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
+        """
+        Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
+
+        Example::
+            dt_expr = pyparsing_common.iso8601_datetime.copy()
+            dt_expr.setParseAction(pyparsing_common.convertToDatetime())
+            print(dt_expr.parseString("1999-12-31T23:59:59.999"))
+        prints::
+            [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
+        """
+        def cvt_fn(s,l,t):
+            try:
+                return datetime.strptime(t[0], fmt)
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
+    "ISO8601 date (C{yyyy-mm-dd})"
+
+    iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
+    "ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{'T'} or C{' '}"
+
+    uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
+    "UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})"
+
+    _html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
+    @staticmethod
+    def stripHTMLTags(s, l, tokens):
+        """
+        Parse action to remove HTML tags from web page HTML source
+
+        Example::
+            # strip HTML links from normal text 
+            text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
+            td,td_end = makeHTMLTags("TD")
+            table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
+            
+            print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
+        """
+        return pyparsing_common._html_stripper.transformString(tokens[0])
+
+    _commasepitem = Combine(OneOrMore(~Literal(",") + ~LineEnd() + Word(printables, excludeChars=',') 
+                                        + Optional( White(" \t") ) ) ).streamline().setName("commaItem")
+    comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("comma separated list")
+    """Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
+
+    upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
+    """Parse action to convert tokens to upper case."""
+
+    downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
+    """Parse action to convert tokens to lower case."""
+
+
+if __name__ == "__main__":
+
+    selectToken    = CaselessLiteral("select")
+    fromToken      = CaselessLiteral("from")
+
+    ident          = Word(alphas, alphanums + "_$")
+
+    columnName     = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    columnNameList = Group(delimitedList(columnName)).setName("columns")
+    columnSpec     = ('*' | columnNameList)
+
+    tableName      = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    tableNameList  = Group(delimitedList(tableName)).setName("tables")
+    
+    simpleSQL      = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
+
+    # demo runTests method, including embedded comments in test string
+    simpleSQL.runTests("""
+        # '*' as column list and dotted table name
+        select * from SYS.XYZZY
+
+        # caseless match on "SELECT", and casts back to "select"
+        SELECT * from XYZZY, ABC
+
+        # list of column names, and mixed case SELECT keyword
+        Select AA,BB,CC from Sys.dual
+
+        # multiple tables
+        Select A, B, C from Sys.dual, Table2
+
+        # invalid SELECT keyword - should fail
+        Xelect A, B, C from Sys.dual
+
+        # incomplete command - should fail
+        Select
+
+        # invalid column name - should fail
+        Select ^^^ frox Sys.dual
+
+        """)
+
+    pyparsing_common.number.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    # any int or real number, returned as float
+    pyparsing_common.fnumber.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    pyparsing_common.hex_integer.runTests("""
+        100
+        FF
+        """)
+
+    import uuid
+    pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+    pyparsing_common.uuid.runTests("""
+        12345678-1234-5678-1234-567812345678
+        """)
diff --git a/venv/Lib/site-packages/pkg_resources/extern/__init__.py b/venv/Lib/site-packages/pkg_resources/extern/__init__.py
new file mode 100644
index 000000000..4dc3beb2f
--- /dev/null
+++ b/venv/Lib/site-packages/pkg_resources/extern/__init__.py
@@ -0,0 +1,66 @@
+import sys
+
+
+class VendorImporter:
+    """
+    A PEP 302 meta path importer for finding optionally-vendored
+    or otherwise naturally-installed packages from root_name.
+    """
+
+    def __init__(self, root_name, vendored_names=(), vendor_pkg=None):
+        self.root_name = root_name
+        self.vendored_names = set(vendored_names)
+        self.vendor_pkg = vendor_pkg or root_name.replace('extern', '_vendor')
+
+    @property
+    def search_path(self):
+        """
+        Search first the vendor package then as a natural package.
+        """
+        yield self.vendor_pkg + '.'
+        yield ''
+
+    def find_module(self, fullname, path=None):
+        """
+        Return self when fullname starts with root_name and the
+        target module is one vendored through this importer.
+        """
+        root, base, target = fullname.partition(self.root_name + '.')
+        if root:
+            return
+        if not any(map(target.startswith, self.vendored_names)):
+            return
+        return self
+
+    def load_module(self, fullname):
+        """
+        Iterate over the search path to locate and load fullname.
+        """
+        root, base, target = fullname.partition(self.root_name + '.')
+        for prefix in self.search_path:
+            try:
+                extant = prefix + target
+                __import__(extant)
+                mod = sys.modules[extant]
+                sys.modules[fullname] = mod
+                return mod
+            except ImportError:
+                pass
+        else:
+            raise ImportError(
+                "The '{target}' package is required; "
+                "normally this is bundled with this package so if you get "
+                "this warning, consult the packager of your "
+                "distribution.".format(**locals())
+            )
+
+    def install(self):
+        """
+        Install this importer into sys.meta_path if not already present.
+        """
+        if self not in sys.meta_path:
+            sys.meta_path.append(self)
+
+
+names = 'packaging', 'pyparsing', 'appdirs'
+VendorImporter(__name__, names).install()
diff --git a/venv/Lib/site-packages/pkg_resources/extern/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/pkg_resources/extern/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..da4e5a870
Binary files /dev/null and b/venv/Lib/site-packages/pkg_resources/extern/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/INSTALLER b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/INSTALLER
new file mode 100644
index 000000000..a1b589e38
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/INSTALLER
@@ -0,0 +1 @@
+pip
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/LICENSE b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/LICENSE
new file mode 100644
index 000000000..6e0693b4b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/LICENSE
@@ -0,0 +1,19 @@
+Copyright (C) 2016 Jason R Coombs <jaraco@jaraco.com>
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of
+this software and associated documentation files (the "Software"), to deal in
+the Software without restriction, including without limitation the rights to
+use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies
+of the Software, and to permit persons to whom the Software is furnished to do
+so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/METADATA b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/METADATA
new file mode 100644
index 000000000..1e1b581e9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/METADATA
@@ -0,0 +1,109 @@
+Metadata-Version: 2.1
+Name: setuptools
+Version: 50.3.0
+Summary: Easily download, build, install, upgrade, and uninstall Python packages
+Home-page: https://github.com/pypa/setuptools
+Author: Python Packaging Authority
+Author-email: distutils-sig@python.org
+License: UNKNOWN
+Project-URL: Documentation, https://setuptools.readthedocs.io/
+Keywords: CPAN PyPI distutils eggs package management
+Platform: UNKNOWN
+Classifier: Development Status :: 5 - Production/Stable
+Classifier: Intended Audience :: Developers
+Classifier: License :: OSI Approved :: MIT License
+Classifier: Operating System :: OS Independent
+Classifier: Programming Language :: Python :: 3
+Classifier: Programming Language :: Python :: 3 :: Only
+Classifier: Programming Language :: Python :: 3.5
+Classifier: Programming Language :: Python :: 3.6
+Classifier: Programming Language :: Python :: 3.7
+Classifier: Programming Language :: Python :: 3.8
+Classifier: Topic :: Software Development :: Libraries :: Python Modules
+Classifier: Topic :: System :: Archiving :: Packaging
+Classifier: Topic :: System :: Systems Administration
+Classifier: Topic :: Utilities
+Requires-Python: >=3.5
+Description-Content-Type: text/x-rst; charset=UTF-8
+Provides-Extra: certs
+Requires-Dist: certifi (==2016.9.26) ; extra == 'certs'
+Provides-Extra: docs
+Requires-Dist: sphinx ; extra == 'docs'
+Requires-Dist: jaraco.packaging (>=6.1) ; extra == 'docs'
+Requires-Dist: rst.linker (>=1.9) ; extra == 'docs'
+Requires-Dist: pygments-github-lexers (==0.0.5) ; extra == 'docs'
+Provides-Extra: ssl
+Requires-Dist: wincertstore (==0.2) ; (sys_platform == "win32") and extra == 'ssl'
+Provides-Extra: tests
+Requires-Dist: mock ; extra == 'tests'
+Requires-Dist: pytest-flake8 ; extra == 'tests'
+Requires-Dist: virtualenv (>=13.0.0) ; extra == 'tests'
+Requires-Dist: pytest-virtualenv (>=1.2.7) ; extra == 'tests'
+Requires-Dist: pytest (>=3.7) ; extra == 'tests'
+Requires-Dist: wheel ; extra == 'tests'
+Requires-Dist: coverage (>=4.5.1) ; extra == 'tests'
+Requires-Dist: pytest-cov (>=2.5.1) ; extra == 'tests'
+Requires-Dist: pip (>=19.1) ; extra == 'tests'
+Requires-Dist: jaraco.envs ; extra == 'tests'
+Requires-Dist: flake8-2020 ; (python_version >= "3.6") and extra == 'tests'
+Requires-Dist: paver ; (python_version >= "3.6") and extra == 'tests'
+
+.. image:: https://img.shields.io/pypi/v/setuptools.svg
+   :target: `PyPI link`_
+
+.. image:: https://img.shields.io/pypi/pyversions/setuptools.svg
+   :target: `PyPI link`_
+
+.. _PyPI link: https://pypi.org/project/setuptools
+
+.. image:: https://dev.azure.com/jaraco/setuptools/_apis/build/status/pypa.setuptools?branchName=master
+   :target: https://dev.azure.com/jaraco/setuptools/_build/latest?definitionId=1&branchName=master
+
+.. image:: https://img.shields.io/travis/pypa/setuptools/master.svg?label=Linux%20CI&logo=travis&logoColor=white
+   :target: https://travis-ci.org/pypa/setuptools
+
+.. image:: https://img.shields.io/appveyor/ci/pypa/setuptools/master.svg?label=Windows%20CI&logo=appveyor&logoColor=white
+   :target: https://ci.appveyor.com/project/pypa/setuptools/branch/master
+
+.. image:: https://img.shields.io/readthedocs/setuptools/latest.svg
+    :target: https://setuptools.readthedocs.io
+
+.. image:: https://img.shields.io/codecov/c/github/pypa/setuptools/master.svg?logo=codecov&logoColor=white
+   :target: https://codecov.io/gh/pypa/setuptools
+
+.. image:: https://tidelift.com/badges/github/pypa/setuptools?style=flat
+   :target: https://tidelift.com/subscription/pkg/pypi-setuptools?utm_source=pypi-setuptools&utm_medium=readme
+
+See the `Installation Instructions
+<https://packaging.python.org/installing/>`_ in the Python Packaging
+User's Guide for instructions on installing, upgrading, and uninstalling
+Setuptools.
+
+Questions and comments should be directed to the `distutils-sig
+mailing list <http://mail.python.org/pipermail/distutils-sig/>`_.
+Bug reports and especially tested patches may be
+submitted directly to the `bug tracker
+<https://github.com/pypa/setuptools/issues>`_.
+
+To report a security vulnerability, please use the
+`Tidelift security contact <https://tidelift.com/security>`_.
+Tidelift will coordinate the fix and disclosure.
+
+
+For Enterprise
+==============
+
+Available as part of the Tidelift Subscription.
+
+Setuptools and the maintainers of thousands of other packages are working with Tidelift to deliver one enterprise subscription that covers all of the open source you use.
+
+`Learn more <https://tidelift.com/subscription/pkg/pypi-setuptools?utm_source=pypi-setuptools&utm_medium=referral&utm_campaign=github>`_.
+
+Code of Conduct
+===============
+
+Everyone interacting in the setuptools project's codebases, issue trackers,
+chat rooms, and mailing lists is expected to follow the
+`PSF Code of Conduct <https://github.com/pypa/.github/blob/main/CODE_OF_CONDUCT.md>`_.
+
+
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/RECORD b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/RECORD
new file mode 100644
index 000000000..a05c85b04
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/RECORD
@@ -0,0 +1,299 @@
+../../Scripts/easy_install-3.6.exe,sha256=B7fA8cauRiDXPvKTel1KPGNjazxdPAZOzZL8J6V0k_4,97246
+../../Scripts/easy_install.exe,sha256=B7fA8cauRiDXPvKTel1KPGNjazxdPAZOzZL8J6V0k_4,97246
+__pycache__/easy_install.cpython-36.pyc,,
+_distutils_hack/__init__.py,sha256=wFuARcmlHtkV20HfRBlQaMPY7hQx-TEEtnBpXeysiwI,3552
+_distutils_hack/__pycache__/__init__.cpython-36.pyc,,
+_distutils_hack/__pycache__/override.cpython-36.pyc,,
+_distutils_hack/override.py,sha256=Eu_s-NF6VIZ4Cqd0tbbA5wtWky2IZPNd8et6GLt1mzo,44
+distutils-precedence.pth,sha256=fqf_7z_ioRfuEsaO1lU2F_DX_S8FkCV8JcSElZo7c3M,152
+easy_install.py,sha256=MDC9vt5AxDsXX5qcKlBz2TnW6Tpuv_AobnfhCJ9X3PM,126
+pkg_resources/__init__.py,sha256=LERWHHiTbaylvENu2lku0M4zrzZBwFrnf2dbEFzFdvc,107946
+pkg_resources/__pycache__/__init__.cpython-36.pyc,,
+pkg_resources/_vendor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+pkg_resources/_vendor/__pycache__/__init__.cpython-36.pyc,,
+pkg_resources/_vendor/__pycache__/appdirs.cpython-36.pyc,,
+pkg_resources/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
+pkg_resources/_vendor/appdirs.py,sha256=MievUEuv3l_mQISH5SF0shDk_BNhHHzYiAPrT3ITN4I,24701
+pkg_resources/_vendor/packaging/__about__.py,sha256=PNMsaZn4UcCHyubgROH1bl6CluduPjI5kFrSp_Zgklo,736
+pkg_resources/_vendor/packaging/__init__.py,sha256=6enbp5XgRfjBjsI9-bn00HjHf5TH21PDMOKkJW8xw-w,562
+pkg_resources/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/_typing.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/tags.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
+pkg_resources/_vendor/packaging/_compat.py,sha256=MXdsGpSE_W-ZrHoC87andI4LV2FAwU7HLL-eHe_CjhU,1128
+pkg_resources/_vendor/packaging/_structures.py,sha256=ozkCX8Q8f2qE1Eic3YiQ4buDVfgz2iYevY9e7R2y3iY,2022
+pkg_resources/_vendor/packaging/_typing.py,sha256=x59EhQ57TMT-kTRyLZV25HZvYGGwbucTo6iKh_O0tMw,1812
+pkg_resources/_vendor/packaging/markers.py,sha256=YSntQkMnKyw1_FG6oRNNnGxLL6bAxcGXOtuFE-YTS3k,9518
+pkg_resources/_vendor/packaging/requirements.py,sha256=R8K4H4xX_iD4LvpGw1U3ouuPbGN-wzsFgD7brhAM71Y,4929
+pkg_resources/_vendor/packaging/specifiers.py,sha256=uYp9l13F0LcknS6d4N60ytiBgFmIhKideOq9AnsxTco,31944
+pkg_resources/_vendor/packaging/tags.py,sha256=NKMS37Zo_nWrZxgsD6zbXsXgc9edn9m160cBiLmHJdE,24067
+pkg_resources/_vendor/packaging/utils.py,sha256=RShlvnjO2CtYSD8uri32frMMFMTmB-3ihsq1-ghzLEw,1811
+pkg_resources/_vendor/packaging/version.py,sha256=Cnbm-OO9D_qd8ZTFxzFcjSavexSYFZmyeaoPvMsjgPc,15470
+pkg_resources/_vendor/pyparsing.py,sha256=tmrp-lu-qO1i75ZzIN5A12nKRRD1Cm4Vpk-5LR9rims,232055
+pkg_resources/extern/__init__.py,sha256=Gj7bMt5YI5cGt6kcg-M2GNxOL_k2x-bUlLzPaZK8uek,2094
+pkg_resources/extern/__pycache__/__init__.cpython-36.pyc,,
+setuptools-50.3.0.dist-info/INSTALLER,sha256=zuuue4knoyJ-UwPPXg8fezS7VCrXJQrAP7zeNuwvFQg,4
+setuptools-50.3.0.dist-info/LICENSE,sha256=wyo6w5WvYyHv0ovnPQagDw22q4h9HCHU_sRhKNIFbVo,1078
+setuptools-50.3.0.dist-info/METADATA,sha256=QJLf3i8KOvjTtKQcRPTJaaiQv1e0pE7OipFwkt1u3Ac,4793
+setuptools-50.3.0.dist-info/RECORD,,
+setuptools-50.3.0.dist-info/WHEEL,sha256=EVRjI69F5qVjm_YgqcTXPnTAv3BfSUr0WVAHuSP3Xoo,92
+setuptools-50.3.0.dist-info/dependency_links.txt,sha256=HlkCFkoK5TbZ5EMLbLKYhLcY_E31kBWD8TqW2EgmatQ,239
+setuptools-50.3.0.dist-info/entry_points.txt,sha256=1K5Fr0-5Ph3ZRZFuwNaw8ERGiNLVqHvdKDNt3oXGS6w,3143
+setuptools-50.3.0.dist-info/top_level.txt,sha256=Xc47-_bn9IXa0F2lP6dE-l-ySe5Xmv_ihIWX-aUjAgg,54
+setuptools-50.3.0.dist-info/zip-safe,sha256=AbpHGcgLb-kRsJGnwFEktk7uzpZOCcBY74-YBdrKVGs,1
+setuptools/__init__.py,sha256=0c232LRyOLGdL-Ywmgk8uMubx7I21w-ixJWiT0jQK-c,7681
+setuptools/__pycache__/__init__.cpython-36.pyc,,
+setuptools/__pycache__/_deprecation_warning.cpython-36.pyc,,
+setuptools/__pycache__/_imp.cpython-36.pyc,,
+setuptools/__pycache__/archive_util.cpython-36.pyc,,
+setuptools/__pycache__/build_meta.cpython-36.pyc,,
+setuptools/__pycache__/config.cpython-36.pyc,,
+setuptools/__pycache__/dep_util.cpython-36.pyc,,
+setuptools/__pycache__/depends.cpython-36.pyc,,
+setuptools/__pycache__/dist.cpython-36.pyc,,
+setuptools/__pycache__/errors.cpython-36.pyc,,
+setuptools/__pycache__/extension.cpython-36.pyc,,
+setuptools/__pycache__/glob.cpython-36.pyc,,
+setuptools/__pycache__/installer.cpython-36.pyc,,
+setuptools/__pycache__/launch.cpython-36.pyc,,
+setuptools/__pycache__/lib2to3_ex.cpython-36.pyc,,
+setuptools/__pycache__/monkey.cpython-36.pyc,,
+setuptools/__pycache__/msvc.cpython-36.pyc,,
+setuptools/__pycache__/namespaces.cpython-36.pyc,,
+setuptools/__pycache__/package_index.cpython-36.pyc,,
+setuptools/__pycache__/py34compat.cpython-36.pyc,,
+setuptools/__pycache__/sandbox.cpython-36.pyc,,
+setuptools/__pycache__/ssl_support.cpython-36.pyc,,
+setuptools/__pycache__/unicode_utils.cpython-36.pyc,,
+setuptools/__pycache__/version.cpython-36.pyc,,
+setuptools/__pycache__/wheel.cpython-36.pyc,,
+setuptools/__pycache__/windows_support.cpython-36.pyc,,
+setuptools/_deprecation_warning.py,sha256=jU9-dtfv6cKmtQJOXN8nP1mm7gONw5kKEtiPtbwnZyI,218
+setuptools/_distutils/__init__.py,sha256=lpQAphR_7uhWC2fbSEps4Ja9W4YwezN_IX_LJEt3khU,250
+setuptools/_distutils/__pycache__/__init__.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/_msvccompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/archive_util.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/bcppcompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/ccompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/cmd.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/config.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/core.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/cygwinccompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/debug.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/dep_util.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/dir_util.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/dist.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/errors.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/extension.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/fancy_getopt.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/file_util.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/filelist.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/log.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/msvc9compiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/msvccompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/py35compat.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/py38compat.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/spawn.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/sysconfig.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/text_file.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/unixccompiler.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/util.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/version.cpython-36.pyc,,
+setuptools/_distutils/__pycache__/versionpredicate.cpython-36.pyc,,
+setuptools/_distutils/_msvccompiler.py,sha256=JQcHez50UA3BQKK9fOKANI_GzNFx3_qnZdyHyHNAghA,20813
+setuptools/_distutils/archive_util.py,sha256=qW-uiGwYexTvK5e-iSel_31Dshx-CqTanNPK6snwf98,8572
+setuptools/_distutils/bcppcompiler.py,sha256=OJDVpCUmX6H8v_7lV1zifV1fcx92Cr2dhiUh6989UJI,14894
+setuptools/_distutils/ccompiler.py,sha256=4cqQgq06NbGo0vazGMT2aPZ6K2Z-HcuRn9Pfz_bQUPw,47437
+setuptools/_distutils/cmd.py,sha256=eco6LAGUtobLuPafuhmgKgkwRRL_WY8KJ4YeDCHpcls,18079
+setuptools/_distutils/command/__init__.py,sha256=2TA-rlNDlzeI-csbWHXFjGD8uOYqALMfyWOhT49nC6g,799
+setuptools/_distutils/command/__pycache__/__init__.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/bdist.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/bdist_dumb.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/bdist_msi.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/bdist_rpm.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/bdist_wininst.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/build.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/build_clib.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/build_ext.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/build_py.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/build_scripts.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/check.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/clean.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/config.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install_data.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install_egg_info.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install_headers.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install_lib.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/install_scripts.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/py37compat.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/register.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/sdist.cpython-36.pyc,,
+setuptools/_distutils/command/__pycache__/upload.cpython-36.pyc,,
+setuptools/_distutils/command/bdist.py,sha256=2z4eudRl_n7m3lG9leL0IYqes4bsm8c0fxfZuiafjMg,5562
+setuptools/_distutils/command/bdist_dumb.py,sha256=BTur9jcIppyP7Piavjfsk7YjElqvxeYO2npUyPPOekc,4913
+setuptools/_distutils/command/bdist_msi.py,sha256=EVFQYN_X-ExeeP8gmdV9JcINsuUGsLJUz9afMU0Rt8c,35579
+setuptools/_distutils/command/bdist_rpm.py,sha256=gjOw22GhDSbcq0bdq25cTb-n6HWWm0bShLQad_mkJ4k,21537
+setuptools/_distutils/command/bdist_wininst.py,sha256=iGlaI-VfElHOneeczKHWnSN5a10-7IMcJaXuR1mdS3c,16030
+setuptools/_distutils/command/build.py,sha256=11NyR2UAUzalrkTZ2ph0BAHFWFC2jtSsN7gIaF-NC08,5767
+setuptools/_distutils/command/build_clib.py,sha256=bgVTHh28eLQA2Gkw68amApd_j7qQBX4MTI-zTvAK_J4,8022
+setuptools/_distutils/command/build_ext.py,sha256=Y_SYbd8SHcpgNPfv3ifVniZljYs1cLAFleBSi2_O3CY,31685
+setuptools/_distutils/command/build_py.py,sha256=S_Nlw4hZE8PnIgqX5OFMdmt-GSmOhPQQ4f2jr1uBnoU,17190
+setuptools/_distutils/command/build_scripts.py,sha256=aKycJJPx3LfZ1cvZgSJaxnD2LnvRM5WJ-8xkpdgcLsI,6232
+setuptools/_distutils/command/check.py,sha256=5qDtI75ccZg3sAItQWeaIu8y3FR314O4rr9Smz4HsEo,5637
+setuptools/_distutils/command/clean.py,sha256=2TCt47ru4hZZM0RfVfUYj5bbpicpGLP4Qhw5jBtvp9k,2776
+setuptools/_distutils/command/config.py,sha256=2aTjww3PwjMB8-ZibCe4P7B-qG1hM1gn_rJXYyxRz6c,13117
+setuptools/_distutils/command/install.py,sha256=oOM2rD7l_SglARNVDmiZn8u6DAfidXRF_yE5QS328B4,27482
+setuptools/_distutils/command/install_data.py,sha256=YhGOAwh3gJPqF7em5XA0rmpR42z1bLh80ooElzDyUvk,2822
+setuptools/_distutils/command/install_egg_info.py,sha256=0kW0liVMeadkjX0ZcRfMptKFen07Gw6gyw1VHT5KIwc,2603
+setuptools/_distutils/command/install_headers.py,sha256=XQ6idkbIDfr1ljXCOznuVUMvOFpHBn6cK0Wz9gIM2b4,1298
+setuptools/_distutils/command/install_lib.py,sha256=9AofR-MO9lAtjwwuukCptepOaJEKMZW2VHiyR5hU7HA,8397
+setuptools/_distutils/command/install_scripts.py,sha256=_CLUeQwGJRcY2kik7azPMn5IdtDCrjWdUvZ1khlG6ck,2017
+setuptools/_distutils/command/py37compat.py,sha256=qzRhhvTihqx_PZZt2ZYECxh1X3Oj255VqatzelYFAKw,671
+setuptools/_distutils/command/register.py,sha256=2jaq9968rt2puRVDBx1HbNiXv27uOk8idE_4lPf_3VM,11712
+setuptools/_distutils/command/sdist.py,sha256=qotJjAOzyhJjq2-oDImjNFrOtaSneEFDJTB-sEk1wnU,19005
+setuptools/_distutils/command/upload.py,sha256=BLO1w7eSAqsCjCLXtf_CRVSjwF1WmyOByGVGNdcQ8oY,7597
+setuptools/_distutils/config.py,sha256=dtHgblx9JhfyrKx1-J7Jlxw_f7s8ZbPFQii2UWMTZpY,4827
+setuptools/_distutils/core.py,sha256=jbdOkpOK09xi-56vhhwvn3fYdhLb5DJO8q3K1fnQz0Q,8876
+setuptools/_distutils/cygwinccompiler.py,sha256=9U4JAusUzlAGJl0Y5nToPkQ3ldzseAtiye434mwJ0ow,16380
+setuptools/_distutils/debug.py,sha256=N6MrTAqK6l9SVk6tWweR108PM8Ol7qNlfyV-nHcLhsY,139
+setuptools/_distutils/dep_util.py,sha256=GuR9Iw_jzZRkyemJ5HX8rB_wRGxkIBcBm1qh54r7zhk,3491
+setuptools/_distutils/dir_util.py,sha256=UwhBOUTcV65GTwce4SPuTXR8Z8q3LYEcmttqcGb0bYo,7778
+setuptools/_distutils/dist.py,sha256=Biuf6ca8uiFfMScRFsYUKtb5neMPtxKxRtXn50_1f3U,50421
+setuptools/_distutils/errors.py,sha256=Yr6tKZGdzBoNi53vBtiq0UJ__X05CmxSdQJqOWaw6SY,3577
+setuptools/_distutils/extension.py,sha256=bTb3Q0CoevGKYv5dX1ls--Ln8tlB0-UEOsi9BwzlZ-s,10515
+setuptools/_distutils/fancy_getopt.py,sha256=OPxp2CxHi1Yp_d1D8JxW4Ueq9fC71tegQFaafh58GGU,17784
+setuptools/_distutils/file_util.py,sha256=0hUqfItN_x2DVihR0MHdA4KCMVCOO8VoByaFp_a6MDg,8148
+setuptools/_distutils/filelist.py,sha256=8bRxhzp2FsaoHT7TuKD4Qjcuh_B9Ow_xTt_htZJvN2Q,12832
+setuptools/_distutils/log.py,sha256=hWBmdUC2K927QcVv3REMW3HMPclxccPQngxLSuUXQl0,1969
+setuptools/_distutils/msvc9compiler.py,sha256=uv0TAfoWrxEBOQL-Z2uws5g4AXoTPahUEMuq6FLkCYY,30453
+setuptools/_distutils/msvccompiler.py,sha256=ZYsnUgIC4tZT2WkJbTkTUyVSCAc2nFM9DVKIuIfPBU0,23540
+setuptools/_distutils/py35compat.py,sha256=-sk1vBIsOgH-AobjIYbK_OEjdJF_54Ul_D1EiE9XM_c,455
+setuptools/_distutils/py38compat.py,sha256=II7ddBxOijC7uNN4z_46HYUjwYTJYMNiLJoGTormZm0,212
+setuptools/_distutils/spawn.py,sha256=XBmUqzhxXfay_JE18RkaalHf9kgi7NvXeBPW9BfTqmw,4408
+setuptools/_distutils/sysconfig.py,sha256=5z55MU7gXeceL_G9FK6ex-2OvdeIXJRZJafrtthJcfU,21349
+setuptools/_distutils/text_file.py,sha256=PsuAJeWdKJoLSV_6N6IpB5-0Pa84KzLUucJMFRazw3I,12483
+setuptools/_distutils/unixccompiler.py,sha256=E65edChYLoHY8wi4OxFu_wKt3hJe3GySF6v51G_ZzL0,14696
+setuptools/_distutils/util.py,sha256=Wlz9noChJjzem9mfgOu-KaN8soB4aNhRfe4VGltXd8w,20985
+setuptools/_distutils/version.py,sha256=8NogP6NPPQpp3EUMZcT9czEHia-ehqPo8spo_e7AgUU,12514
+setuptools/_distutils/versionpredicate.py,sha256=ZxpEA-TQv88mUWc6hetUO4qSqA2sa7ipjZ3QEK5evDk,5133
+setuptools/_imp.py,sha256=Qx0LJzEBaWk_6PfICamJtfBN2rh5K9sJq1wXvtZW-mc,2388
+setuptools/_vendor/__init__.py,sha256=47DEQpj8HBSa-_TImW-5JCeuQeRkm5NMpJWZG3hSuFU,0
+setuptools/_vendor/__pycache__/__init__.cpython-36.pyc,,
+setuptools/_vendor/__pycache__/ordered_set.cpython-36.pyc,,
+setuptools/_vendor/__pycache__/pyparsing.cpython-36.pyc,,
+setuptools/_vendor/ordered_set.py,sha256=dbaCcs27dyN9gnMWGF5nA_BrVn6Q-NrjKYJpV9_fgBs,15130
+setuptools/_vendor/packaging/__about__.py,sha256=PNMsaZn4UcCHyubgROH1bl6CluduPjI5kFrSp_Zgklo,736
+setuptools/_vendor/packaging/__init__.py,sha256=6enbp5XgRfjBjsI9-bn00HjHf5TH21PDMOKkJW8xw-w,562
+setuptools/_vendor/packaging/__pycache__/__about__.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/__init__.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/_compat.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/_structures.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/_typing.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/markers.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/requirements.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/tags.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/utils.cpython-36.pyc,,
+setuptools/_vendor/packaging/__pycache__/version.cpython-36.pyc,,
+setuptools/_vendor/packaging/_compat.py,sha256=MXdsGpSE_W-ZrHoC87andI4LV2FAwU7HLL-eHe_CjhU,1128
+setuptools/_vendor/packaging/_structures.py,sha256=ozkCX8Q8f2qE1Eic3YiQ4buDVfgz2iYevY9e7R2y3iY,2022
+setuptools/_vendor/packaging/_typing.py,sha256=x59EhQ57TMT-kTRyLZV25HZvYGGwbucTo6iKh_O0tMw,1812
+setuptools/_vendor/packaging/markers.py,sha256=BCCxZbt8xgysH8v5pqbLkdtQnRZHIGkJQqlNBGek4nQ,9509
+setuptools/_vendor/packaging/requirements.py,sha256=VHydZdk8m3qFxReomNwKr71cmpjantEV_xOhkEyyINI,4917
+setuptools/_vendor/packaging/specifiers.py,sha256=uYp9l13F0LcknS6d4N60ytiBgFmIhKideOq9AnsxTco,31944
+setuptools/_vendor/packaging/tags.py,sha256=NKMS37Zo_nWrZxgsD6zbXsXgc9edn9m160cBiLmHJdE,24067
+setuptools/_vendor/packaging/utils.py,sha256=RShlvnjO2CtYSD8uri32frMMFMTmB-3ihsq1-ghzLEw,1811
+setuptools/_vendor/packaging/version.py,sha256=Cnbm-OO9D_qd8ZTFxzFcjSavexSYFZmyeaoPvMsjgPc,15470
+setuptools/_vendor/pyparsing.py,sha256=tmrp-lu-qO1i75ZzIN5A12nKRRD1Cm4Vpk-5LR9rims,232055
+setuptools/archive_util.py,sha256=F1-XrQJTdXHRPRA09kxPWwm9Z2Ms1lE_IQZKG_JZ7rM,6638
+setuptools/build_meta.py,sha256=bm5RnBmygBneOldaLhcuncOiTqH5NPdBZISVeUDeYyc,10096
+setuptools/cli-32.exe,sha256=dfEuovMNnA2HLa3jRfMPVi5tk4R7alCbpTvuxtCyw0Y,65536
+setuptools/cli-64.exe,sha256=KLABu5pyrnokJCv6skjXZ6GsXeyYHGcqOUT3oHI3Xpo,74752
+setuptools/cli.exe,sha256=dfEuovMNnA2HLa3jRfMPVi5tk4R7alCbpTvuxtCyw0Y,65536
+setuptools/command/__init__.py,sha256=QCAuA9whnq8Bnoc0bBaS6Lw_KAUO0DiHYZQXEMNn5hg,568
+setuptools/command/__pycache__/__init__.cpython-36.pyc,,
+setuptools/command/__pycache__/alias.cpython-36.pyc,,
+setuptools/command/__pycache__/bdist_egg.cpython-36.pyc,,
+setuptools/command/__pycache__/bdist_rpm.cpython-36.pyc,,
+setuptools/command/__pycache__/bdist_wininst.cpython-36.pyc,,
+setuptools/command/__pycache__/build_clib.cpython-36.pyc,,
+setuptools/command/__pycache__/build_ext.cpython-36.pyc,,
+setuptools/command/__pycache__/build_py.cpython-36.pyc,,
+setuptools/command/__pycache__/develop.cpython-36.pyc,,
+setuptools/command/__pycache__/dist_info.cpython-36.pyc,,
+setuptools/command/__pycache__/easy_install.cpython-36.pyc,,
+setuptools/command/__pycache__/egg_info.cpython-36.pyc,,
+setuptools/command/__pycache__/install.cpython-36.pyc,,
+setuptools/command/__pycache__/install_egg_info.cpython-36.pyc,,
+setuptools/command/__pycache__/install_lib.cpython-36.pyc,,
+setuptools/command/__pycache__/install_scripts.cpython-36.pyc,,
+setuptools/command/__pycache__/py36compat.cpython-36.pyc,,
+setuptools/command/__pycache__/register.cpython-36.pyc,,
+setuptools/command/__pycache__/rotate.cpython-36.pyc,,
+setuptools/command/__pycache__/saveopts.cpython-36.pyc,,
+setuptools/command/__pycache__/sdist.cpython-36.pyc,,
+setuptools/command/__pycache__/setopt.cpython-36.pyc,,
+setuptools/command/__pycache__/test.cpython-36.pyc,,
+setuptools/command/__pycache__/upload.cpython-36.pyc,,
+setuptools/command/__pycache__/upload_docs.cpython-36.pyc,,
+setuptools/command/alias.py,sha256=1sLQxZcNh6dDQpDmm4G7UGGTol83nY1NTPmNBbm2siI,2381
+setuptools/command/bdist_egg.py,sha256=9qKKLR9gtYXx84xxU4DQYTtMK__mrsaxwjUAiGQ1foY,18244
+setuptools/command/bdist_rpm.py,sha256=_4Y7tVAzu1zEuDc8tpRdE_sy3zST3h3LPTtzioos5Ck,900
+setuptools/command/bdist_wininst.py,sha256=Tmqa9wW0F8i_72KHWpu9pDdnCN6Er_8uJUs2UmCAwTA,922
+setuptools/command/build_clib.py,sha256=fWHSFGkk10VCddBWCszvNhowbG9Z9CZXVjQ2uSInoOs,4415
+setuptools/command/build_ext.py,sha256=aI_qnK9m8lULZDS6XMv_p2j2pIehVbSarb4PJHDA7dw,13027
+setuptools/command/build_py.py,sha256=Qkh2epwENYPGZdbrTNS6Ayfq30f5ujU_wzkv9dP3Pxw,9475
+setuptools/command/develop.py,sha256=B0p5dh7VrSMdEfhdUE_AJlWk2UxAesOOY14CAV5_DEA,8045
+setuptools/command/dist_info.py,sha256=5t6kOfrdgALT-P3ogss6PF9k-Leyesueycuk3dUyZnI,960
+setuptools/command/easy_install.py,sha256=lMTMBbwsNdf7vYOJjPCZYCUBXVqOzKsd-NCE0V76dnU,86430
+setuptools/command/egg_info.py,sha256=fYhj14loPF7EIatisSLgmANhAi677A6UK4qbYmqdZhI,25426
+setuptools/command/install.py,sha256=8doMxeQEDoK4Eco0mO2WlXXzzp9QnsGJQ7Z7yWkZPG8,4705
+setuptools/command/install_egg_info.py,sha256=bMgeIeRiXzQ4DAGPV1328kcjwQjHjOWU4FngAWLV78Q,2203
+setuptools/command/install_lib.py,sha256=Uz42McsyHZAjrB6cw9E7Bz0xsaTbzxnM1PI9CBhiPtE,3875
+setuptools/command/install_scripts.py,sha256=x7sdEICuyFpaf5LuWXcTp49oYt8EeNbwKkW2Pv-TVXI,2519
+setuptools/command/launcher manifest.xml,sha256=xlLbjWrB01tKC0-hlVkOKkiSPbzMml2eOPtJ_ucCnbE,628
+setuptools/command/py36compat.py,sha256=7yLWzQj179Enx3pJ8V1cDDCzeLMFMd9XJXlK-iZTq5Y,4946
+setuptools/command/register.py,sha256=kk3DxXCb5lXTvqnhfwx2g6q7iwbUmgTyXUCaBooBOUk,468
+setuptools/command/rotate.py,sha256=SvsQPasezIojPjvMnfkqzh8P0U0tCj0daczF8uc3NQM,2128
+setuptools/command/saveopts.py,sha256=za7QCBcQimKKriWcoCcbhxPjUz30gSB74zuTL47xpP4,658
+setuptools/command/sdist.py,sha256=R1bt94i_RscMePwKS1iBSvdlpFFRfh5iCPkucsxx0oI,6970
+setuptools/command/setopt.py,sha256=LicqlXockLqBOHYPNv1J032HxoBKD4HOHB11qm_t-Bs,5051
+setuptools/command/test.py,sha256=Y4jwjdX_4DCimImq6fDWoHzBniXDNJVEcD6XxVZIYS0,9469
+setuptools/command/upload.py,sha256=XT3YFVfYPAmA5qhGg0euluU98ftxRUW-PzKcODMLxUs,462
+setuptools/command/upload_docs.py,sha256=482Bd7ksBBfzdokxjNQvnR0A6dg8XOOREg9wB5BwKtU,7151
+setuptools/config.py,sha256=NUrsVW54pxYCuekfJbV7B6wyKzvzatXM5zT4LqnegWo,21485
+setuptools/dep_util.py,sha256=BDx1BkzNQntvAB4alypHbW5UVBzjqths000PrUL4Zqc,949
+setuptools/depends.py,sha256=iHfZdLdlCu2BllSF9bRg7NU0oqbPWMH8ljm4BuwQDY0,5474
+setuptools/dist.py,sha256=msWjjUNczEXVO5H_X-Xx6Y00_9VM_S0_cIBWehrkVRM,38405
+setuptools/errors.py,sha256=MVOcv381HNSajDgEUWzOQ4J6B5BHCBMSjHfaWcEwA1o,524
+setuptools/extension.py,sha256=NMM46XjNdVelWemc0x8CyVKA5Ks6Zm3xTWSA2SS6xZM,1684
+setuptools/extern/__init__.py,sha256=59mpPNYGozvXXbAKrxldOmHLYFyBC4aaoYihYHkKnJ0,2121
+setuptools/extern/__pycache__/__init__.cpython-36.pyc,,
+setuptools/glob.py,sha256=o75cHrOxYsvn854thSxE0x9k8JrKDuhP_rRXlVB00Q4,5084
+setuptools/gui-32.exe,sha256=XBr0bHMA6Hpz2s9s9Bzjl-PwXfa9nH4ie0rFn4V2kWA,65536
+setuptools/gui-64.exe,sha256=aYKMhX1IJLn4ULHgWX0sE0yREUt6B3TEHf_jOw6yNyE,75264
+setuptools/gui.exe,sha256=XBr0bHMA6Hpz2s9s9Bzjl-PwXfa9nH4ie0rFn4V2kWA,65536
+setuptools/installer.py,sha256=G6xBHtc3GYR6fXKLN6xQl4f50KIaAMyMpMsknOLHRt0,5277
+setuptools/launch.py,sha256=TyPT-Ic1T2EnYvGO26gfNRP4ysBlrhpbRjQxWsiO414,812
+setuptools/lib2to3_ex.py,sha256=YKA7CmdIJWwy0-yuZAxUgoNHbXFmT4p53iNadWdBQCk,2335
+setuptools/monkey.py,sha256=0e3HdVKXHL415O7np-AUqhEFXPPuDdJKbI47chQ_DE4,5217
+setuptools/msvc.py,sha256=PHsjWnTwaD12gDJ1nbt9WkcRvwOOfTK0N7w5fmTZTS0,51197
+setuptools/namespaces.py,sha256=PMqGVPXPYQgjUTvEg9bGccRAkIODrQ6NmsDg_fwErwI,3093
+setuptools/package_index.py,sha256=lRLjafYNmRJ3_ZPmgwdU_Evh2BOu63PJoJPZbsXPIrQ,40610
+setuptools/py34compat.py,sha256=KYOd6ybRxjBW8NJmYD8t_UyyVmysppFXqHpFLdslGXU,245
+setuptools/sandbox.py,sha256=IirxmeCHbl1CHT7pEPgQ6tTx9wU854n-d2p80Su8t5c,14151
+setuptools/script (dev).tmpl,sha256=RUzQzCQUaXtwdLtYHWYbIQmOaES5Brqq1FvUA_tu-5I,218
+setuptools/script.tmpl,sha256=WGTt5piezO27c-Dbx6l5Q4T3Ff20A5z7872hv3aAhYY,138
+setuptools/ssl_support.py,sha256=3yuxmYJxPupL97d4RBihMo1UCMXSou1Upn4VE9jkq48,8511
+setuptools/unicode_utils.py,sha256=aOOFo4JGwAsiBttGYDsqFS7YqWQeZ2j6DWiCuctR_00,941
+setuptools/version.py,sha256=og_cuZQb0QI6ukKZFfZWPlr1HgJBPPn2vO2m_bI9ZTE,144
+setuptools/wheel.py,sha256=0P8tSk105uF_Ub-30N2HU2X2v7MKDSdjpeQlRRW3SkI,8288
+setuptools/windows_support.py,sha256=5GrfqSP2-dLGJoZTq2g6dCKkyQxxa2n5IQiXlJCoYEE,714
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/WHEEL b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/WHEEL
new file mode 100644
index 000000000..83ff02e96
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/WHEEL
@@ -0,0 +1,5 @@
+Wheel-Version: 1.0
+Generator: bdist_wheel (0.35.1)
+Root-Is-Purelib: true
+Tag: py3-none-any
+
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/dependency_links.txt b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/dependency_links.txt
new file mode 100644
index 000000000..e87d02103
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/dependency_links.txt
@@ -0,0 +1,2 @@
+https://files.pythonhosted.org/packages/source/c/certifi/certifi-2016.9.26.tar.gz#md5=baa81e951a29958563689d868ef1064d
+https://files.pythonhosted.org/packages/source/w/wincertstore/wincertstore-0.2.zip#md5=ae728f2f007185648d0c7a8679b361e2
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/entry_points.txt b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/entry_points.txt
new file mode 100644
index 000000000..f57c6d2a5
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/entry_points.txt
@@ -0,0 +1,68 @@
+[console_scripts]
+easy_install = setuptools.command.easy_install:main
+easy_install-3.8 = setuptools.command.easy_install:main
+
+[distutils.commands]
+alias = setuptools.command.alias:alias
+bdist_egg = setuptools.command.bdist_egg:bdist_egg
+bdist_rpm = setuptools.command.bdist_rpm:bdist_rpm
+bdist_wininst = setuptools.command.bdist_wininst:bdist_wininst
+build_clib = setuptools.command.build_clib:build_clib
+build_ext = setuptools.command.build_ext:build_ext
+build_py = setuptools.command.build_py:build_py
+develop = setuptools.command.develop:develop
+dist_info = setuptools.command.dist_info:dist_info
+easy_install = setuptools.command.easy_install:easy_install
+egg_info = setuptools.command.egg_info:egg_info
+install = setuptools.command.install:install
+install_egg_info = setuptools.command.install_egg_info:install_egg_info
+install_lib = setuptools.command.install_lib:install_lib
+install_scripts = setuptools.command.install_scripts:install_scripts
+rotate = setuptools.command.rotate:rotate
+saveopts = setuptools.command.saveopts:saveopts
+sdist = setuptools.command.sdist:sdist
+setopt = setuptools.command.setopt:setopt
+test = setuptools.command.test:test
+upload_docs = setuptools.command.upload_docs:upload_docs
+
+[distutils.setup_keywords]
+convert_2to3_doctests = setuptools.dist:assert_string_list
+dependency_links = setuptools.dist:assert_string_list
+eager_resources = setuptools.dist:assert_string_list
+entry_points = setuptools.dist:check_entry_points
+exclude_package_data = setuptools.dist:check_package_data
+extras_require = setuptools.dist:check_extras
+include_package_data = setuptools.dist:assert_bool
+install_requires = setuptools.dist:check_requirements
+namespace_packages = setuptools.dist:check_nsp
+package_data = setuptools.dist:check_package_data
+packages = setuptools.dist:check_packages
+python_requires = setuptools.dist:check_specifier
+setup_requires = setuptools.dist:check_requirements
+test_loader = setuptools.dist:check_importable
+test_runner = setuptools.dist:check_importable
+test_suite = setuptools.dist:check_test_suite
+tests_require = setuptools.dist:check_requirements
+use_2to3 = setuptools.dist:assert_bool
+use_2to3_exclude_fixers = setuptools.dist:assert_string_list
+use_2to3_fixers = setuptools.dist:assert_string_list
+zip_safe = setuptools.dist:assert_bool
+
+[egg_info.writers]
+PKG-INFO = setuptools.command.egg_info:write_pkg_info
+dependency_links.txt = setuptools.command.egg_info:overwrite_arg
+depends.txt = setuptools.command.egg_info:warn_depends_obsolete
+eager_resources.txt = setuptools.command.egg_info:overwrite_arg
+entry_points.txt = setuptools.command.egg_info:write_entries
+namespace_packages.txt = setuptools.command.egg_info:overwrite_arg
+requires.txt = setuptools.command.egg_info:write_requirements
+top_level.txt = setuptools.command.egg_info:write_toplevel_names
+
+[setuptools.finalize_distribution_options]
+2to3_doctests = setuptools.dist:Distribution._finalize_2to3_doctests
+keywords = setuptools.dist:Distribution._finalize_setup_keywords
+parent_finalize = setuptools.dist:_Distribution.finalize_options
+
+[setuptools.installation]
+eggsecutable = setuptools.command.easy_install:bootstrap
+
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/top_level.txt b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/top_level.txt
new file mode 100644
index 000000000..0ba4b25ad
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/top_level.txt
@@ -0,0 +1,4 @@
+_distutils_hack
+easy_install
+pkg_resources
+setuptools
diff --git a/venv/Lib/site-packages/setuptools-50.3.0.dist-info/zip-safe b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/zip-safe
new file mode 100644
index 000000000..8b1378917
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools-50.3.0.dist-info/zip-safe
@@ -0,0 +1 @@
+
diff --git a/venv/Lib/site-packages/setuptools/__init__.py b/venv/Lib/site-packages/setuptools/__init__.py
new file mode 100644
index 000000000..4d9b83572
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/__init__.py
@@ -0,0 +1,241 @@
+"""Extensions to the 'distutils' for large or complex distributions"""
+
+from fnmatch import fnmatchcase
+import functools
+import os
+import re
+
+import _distutils_hack.override  # noqa: F401
+
+import distutils.core
+from distutils.errors import DistutilsOptionError
+from distutils.util import convert_path
+
+from ._deprecation_warning import SetuptoolsDeprecationWarning
+
+import setuptools.version
+from setuptools.extension import Extension
+from setuptools.dist import Distribution
+from setuptools.depends import Require
+from . import monkey
+
+
+__all__ = [
+    'setup', 'Distribution', 'Command', 'Extension', 'Require',
+    'SetuptoolsDeprecationWarning',
+    'find_packages', 'find_namespace_packages',
+]
+
+__version__ = setuptools.version.__version__
+
+bootstrap_install_from = None
+
+# If we run 2to3 on .py files, should we also convert docstrings?
+# Default: yes; assume that we can detect doctests reliably
+run_2to3_on_doctests = True
+# Standard package names for fixer packages
+lib2to3_fixer_packages = ['lib2to3.fixes']
+
+
+class PackageFinder:
+    """
+    Generate a list of all Python packages found within a directory
+    """
+
+    @classmethod
+    def find(cls, where='.', exclude=(), include=('*',)):
+        """Return a list all Python packages found within directory 'where'
+
+        'where' is the root directory which will be searched for packages.  It
+        should be supplied as a "cross-platform" (i.e. URL-style) path; it will
+        be converted to the appropriate local path syntax.
+
+        'exclude' is a sequence of package names to exclude; '*' can be used
+        as a wildcard in the names, such that 'foo.*' will exclude all
+        subpackages of 'foo' (but not 'foo' itself).
+
+        'include' is a sequence of package names to include.  If it's
+        specified, only the named packages will be included.  If it's not
+        specified, all found packages will be included.  'include' can contain
+        shell style wildcard patterns just like 'exclude'.
+        """
+
+        return list(cls._find_packages_iter(
+            convert_path(where),
+            cls._build_filter('ez_setup', '*__pycache__', *exclude),
+            cls._build_filter(*include)))
+
+    @classmethod
+    def _find_packages_iter(cls, where, exclude, include):
+        """
+        All the packages found in 'where' that pass the 'include' filter, but
+        not the 'exclude' filter.
+        """
+        for root, dirs, files in os.walk(where, followlinks=True):
+            # Copy dirs to iterate over it, then empty dirs.
+            all_dirs = dirs[:]
+            dirs[:] = []
+
+            for dir in all_dirs:
+                full_path = os.path.join(root, dir)
+                rel_path = os.path.relpath(full_path, where)
+                package = rel_path.replace(os.path.sep, '.')
+
+                # Skip directory trees that are not valid packages
+                if ('.' in dir or not cls._looks_like_package(full_path)):
+                    continue
+
+                # Should this package be included?
+                if include(package) and not exclude(package):
+                    yield package
+
+                # Keep searching subdirectories, as there may be more packages
+                # down there, even if the parent was excluded.
+                dirs.append(dir)
+
+    @staticmethod
+    def _looks_like_package(path):
+        """Does a directory look like a package?"""
+        return os.path.isfile(os.path.join(path, '__init__.py'))
+
+    @staticmethod
+    def _build_filter(*patterns):
+        """
+        Given a list of patterns, return a callable that will be true only if
+        the input matches at least one of the patterns.
+        """
+        return lambda name: any(fnmatchcase(name, pat=pat) for pat in patterns)
+
+
+class PEP420PackageFinder(PackageFinder):
+    @staticmethod
+    def _looks_like_package(path):
+        return True
+
+
+find_packages = PackageFinder.find
+find_namespace_packages = PEP420PackageFinder.find
+
+
+def _install_setup_requires(attrs):
+    # Note: do not use `setuptools.Distribution` directly, as
+    # our PEP 517 backend patch `distutils.core.Distribution`.
+    class MinimalDistribution(distutils.core.Distribution):
+        """
+        A minimal version of a distribution for supporting the
+        fetch_build_eggs interface.
+        """
+        def __init__(self, attrs):
+            _incl = 'dependency_links', 'setup_requires'
+            filtered = {
+                k: attrs[k]
+                for k in set(_incl) & set(attrs)
+            }
+            distutils.core.Distribution.__init__(self, filtered)
+
+        def finalize_options(self):
+            """
+            Disable finalize_options to avoid building the working set.
+            Ref #2158.
+            """
+
+    dist = MinimalDistribution(attrs)
+
+    # Honor setup.cfg's options.
+    dist.parse_config_files(ignore_option_errors=True)
+    if dist.setup_requires:
+        dist.fetch_build_eggs(dist.setup_requires)
+
+
+def setup(**attrs):
+    # Make sure we have any requirements needed to interpret 'attrs'.
+    _install_setup_requires(attrs)
+    return distutils.core.setup(**attrs)
+
+
+setup.__doc__ = distutils.core.setup.__doc__
+
+
+_Command = monkey.get_unpatched(distutils.core.Command)
+
+
+class Command(_Command):
+    __doc__ = _Command.__doc__
+
+    command_consumes_arguments = False
+
+    def __init__(self, dist, **kw):
+        """
+        Construct the command for dist, updating
+        vars(self) with any keyword parameters.
+        """
+        _Command.__init__(self, dist)
+        vars(self).update(kw)
+
+    def _ensure_stringlike(self, option, what, default=None):
+        val = getattr(self, option)
+        if val is None:
+            setattr(self, option, default)
+            return default
+        elif not isinstance(val, str):
+            raise DistutilsOptionError("'%s' must be a %s (got `%s`)"
+                                       % (option, what, val))
+        return val
+
+    def ensure_string_list(self, option):
+        r"""Ensure that 'option' is a list of strings.  If 'option' is
+        currently a string, we split it either on /,\s*/ or /\s+/, so
+        "foo bar baz", "foo,bar,baz", and "foo,   bar baz" all become
+        ["foo", "bar", "baz"].
+        """
+        val = getattr(self, option)
+        if val is None:
+            return
+        elif isinstance(val, str):
+            setattr(self, option, re.split(r',\s*|\s+', val))
+        else:
+            if isinstance(val, list):
+                ok = all(isinstance(v, str) for v in val)
+            else:
+                ok = False
+            if not ok:
+                raise DistutilsOptionError(
+                    "'%s' must be a list of strings (got %r)"
+                    % (option, val))
+
+    def reinitialize_command(self, command, reinit_subcommands=0, **kw):
+        cmd = _Command.reinitialize_command(self, command, reinit_subcommands)
+        vars(cmd).update(kw)
+        return cmd
+
+
+def _find_all_simple(path):
+    """
+    Find all files under 'path'
+    """
+    results = (
+        os.path.join(base, file)
+        for base, dirs, files in os.walk(path, followlinks=True)
+        for file in files
+    )
+    return filter(os.path.isfile, results)
+
+
+def findall(dir=os.curdir):
+    """
+    Find all files under 'dir' and return the list of full filenames.
+    Unless dir is '.', return full filenames with dir prepended.
+    """
+    files = _find_all_simple(dir)
+    if dir == os.curdir:
+        make_rel = functools.partial(os.path.relpath, start=dir)
+        files = map(make_rel, files)
+    return list(files)
+
+
+class sic(str):
+    """Treat this string as-is (https://en.wikipedia.org/wiki/Sic)"""
+
+
+# Apply monkey patches
+monkey.patch_all()
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..f03cae072
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/_deprecation_warning.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/_deprecation_warning.cpython-36.pyc
new file mode 100644
index 000000000..d8503281d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/_deprecation_warning.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/_imp.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/_imp.cpython-36.pyc
new file mode 100644
index 000000000..1d0f1e0ad
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/_imp.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/archive_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/archive_util.cpython-36.pyc
new file mode 100644
index 000000000..ff6bd57d0
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/archive_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/build_meta.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/build_meta.cpython-36.pyc
new file mode 100644
index 000000000..1714c9d11
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/build_meta.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/config.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/config.cpython-36.pyc
new file mode 100644
index 000000000..ee95e46f2
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/dep_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/dep_util.cpython-36.pyc
new file mode 100644
index 000000000..0d83a63d2
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/dep_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/depends.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/depends.cpython-36.pyc
new file mode 100644
index 000000000..e6793dd54
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/depends.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/dist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/dist.cpython-36.pyc
new file mode 100644
index 000000000..3dd837521
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/dist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/errors.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/errors.cpython-36.pyc
new file mode 100644
index 000000000..d09beedf9
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/errors.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/extension.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/extension.cpython-36.pyc
new file mode 100644
index 000000000..472a69928
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/extension.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/glob.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/glob.cpython-36.pyc
new file mode 100644
index 000000000..870bb0919
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/glob.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/installer.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/installer.cpython-36.pyc
new file mode 100644
index 000000000..b1958460b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/installer.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/launch.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/launch.cpython-36.pyc
new file mode 100644
index 000000000..e9d64c5fe
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/launch.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/lib2to3_ex.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/lib2to3_ex.cpython-36.pyc
new file mode 100644
index 000000000..91f2db965
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/lib2to3_ex.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/monkey.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/monkey.cpython-36.pyc
new file mode 100644
index 000000000..3af0aaa9b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/monkey.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/msvc.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/msvc.cpython-36.pyc
new file mode 100644
index 000000000..d017a0d2f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/msvc.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/namespaces.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/namespaces.cpython-36.pyc
new file mode 100644
index 000000000..150b173bd
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/namespaces.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/package_index.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/package_index.cpython-36.pyc
new file mode 100644
index 000000000..5116d642c
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/package_index.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/py34compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/py34compat.cpython-36.pyc
new file mode 100644
index 000000000..0f8d2ab6d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/py34compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/sandbox.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/sandbox.cpython-36.pyc
new file mode 100644
index 000000000..d0c92b68d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/sandbox.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/ssl_support.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/ssl_support.cpython-36.pyc
new file mode 100644
index 000000000..6d839a2ee
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/ssl_support.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/unicode_utils.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/unicode_utils.cpython-36.pyc
new file mode 100644
index 000000000..5a3555053
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/unicode_utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..c08ea291a
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/wheel.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/wheel.cpython-36.pyc
new file mode 100644
index 000000000..269fd55f3
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/wheel.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/__pycache__/windows_support.cpython-36.pyc b/venv/Lib/site-packages/setuptools/__pycache__/windows_support.cpython-36.pyc
new file mode 100644
index 000000000..aff65f167
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/__pycache__/windows_support.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_deprecation_warning.py b/venv/Lib/site-packages/setuptools/_deprecation_warning.py
new file mode 100644
index 000000000..086b64dd3
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_deprecation_warning.py
@@ -0,0 +1,7 @@
+class SetuptoolsDeprecationWarning(Warning):
+    """
+    Base class for warning deprecations in ``setuptools``
+
+    This class is not derived from ``DeprecationWarning``, and as such is
+    visible by default.
+    """
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__init__.py b/venv/Lib/site-packages/setuptools/_distutils/__init__.py
new file mode 100644
index 000000000..7dac55b60
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/__init__.py
@@ -0,0 +1,15 @@
+"""distutils
+
+The main package for the Python Module Distribution Utilities.  Normally
+used from a setup script as
+
+   from distutils.core import setup
+
+   setup (...)
+"""
+
+import sys
+
+__version__ = sys.version[:sys.version.index(' ')]
+
+local = True
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..4af1e676d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/_msvccompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/_msvccompiler.cpython-36.pyc
new file mode 100644
index 000000000..4811070b6
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/_msvccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/archive_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/archive_util.cpython-36.pyc
new file mode 100644
index 000000000..5f91eaa73
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/archive_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/bcppcompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/bcppcompiler.cpython-36.pyc
new file mode 100644
index 000000000..c86026a56
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/bcppcompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/ccompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/ccompiler.cpython-36.pyc
new file mode 100644
index 000000000..cf7829cce
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/ccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cmd.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cmd.cpython-36.pyc
new file mode 100644
index 000000000..ba36aabd0
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cmd.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/config.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/config.cpython-36.pyc
new file mode 100644
index 000000000..28b3bc094
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/core.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/core.cpython-36.pyc
new file mode 100644
index 000000000..1005226b4
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/core.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cygwinccompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cygwinccompiler.cpython-36.pyc
new file mode 100644
index 000000000..3e1fe991e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/cygwinccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/debug.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/debug.cpython-36.pyc
new file mode 100644
index 000000000..f884e6b8c
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/debug.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dep_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dep_util.cpython-36.pyc
new file mode 100644
index 000000000..15717899e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dep_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dir_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dir_util.cpython-36.pyc
new file mode 100644
index 000000000..543829dee
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dir_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dist.cpython-36.pyc
new file mode 100644
index 000000000..5d2dce270
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/dist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/errors.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/errors.cpython-36.pyc
new file mode 100644
index 000000000..8ee37bc4e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/errors.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/extension.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/extension.cpython-36.pyc
new file mode 100644
index 000000000..e48d7e151
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/extension.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/fancy_getopt.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/fancy_getopt.cpython-36.pyc
new file mode 100644
index 000000000..365b47f3d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/fancy_getopt.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/file_util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/file_util.cpython-36.pyc
new file mode 100644
index 000000000..66da896fc
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/file_util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/filelist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/filelist.cpython-36.pyc
new file mode 100644
index 000000000..278ac4f9f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/filelist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/log.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/log.cpython-36.pyc
new file mode 100644
index 000000000..e32f0e4a0
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/log.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvc9compiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvc9compiler.cpython-36.pyc
new file mode 100644
index 000000000..374da804b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvc9compiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvccompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvccompiler.cpython-36.pyc
new file mode 100644
index 000000000..4d9d309ce
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/msvccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py35compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py35compat.cpython-36.pyc
new file mode 100644
index 000000000..c2a6a0ce8
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py35compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py38compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py38compat.cpython-36.pyc
new file mode 100644
index 000000000..ed625ebbc
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/py38compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/spawn.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/spawn.cpython-36.pyc
new file mode 100644
index 000000000..fd2c9a5e8
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/spawn.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/sysconfig.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/sysconfig.cpython-36.pyc
new file mode 100644
index 000000000..d32f2d34e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/sysconfig.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/text_file.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/text_file.cpython-36.pyc
new file mode 100644
index 000000000..e99fc5aa3
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/text_file.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/unixccompiler.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/unixccompiler.cpython-36.pyc
new file mode 100644
index 000000000..b3538e04c
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/unixccompiler.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/util.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/util.cpython-36.pyc
new file mode 100644
index 000000000..85cb68b40
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/util.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..519ae0796
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/__pycache__/versionpredicate.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/versionpredicate.cpython-36.pyc
new file mode 100644
index 000000000..64c2dea2f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/__pycache__/versionpredicate.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/_msvccompiler.py b/venv/Lib/site-packages/setuptools/_distutils/_msvccompiler.py
new file mode 100644
index 000000000..e9af4cf52
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/_msvccompiler.py
@@ -0,0 +1,561 @@
+"""distutils._msvccompiler
+
+Contains MSVCCompiler, an implementation of the abstract CCompiler class
+for Microsoft Visual Studio 2015.
+
+The module is compatible with VS 2015 and later. You can find legacy support
+for older versions in distutils.msvc9compiler and distutils.msvccompiler.
+"""
+
+# Written by Perry Stoll
+# hacked by Robin Becker and Thomas Heller to do a better job of
+#   finding DevStudio (through the registry)
+# ported to VS 2005 and VS 2008 by Christian Heimes
+# ported to VS 2015 by Steve Dower
+
+import os
+import subprocess
+import contextlib
+import warnings
+import unittest.mock
+with contextlib.suppress(ImportError):
+    import winreg
+
+from distutils.errors import DistutilsExecError, DistutilsPlatformError, \
+                             CompileError, LibError, LinkError
+from distutils.ccompiler import CCompiler, gen_lib_options
+from distutils import log
+from distutils.util import get_platform
+
+from itertools import count
+
+def _find_vc2015():
+    try:
+        key = winreg.OpenKeyEx(
+            winreg.HKEY_LOCAL_MACHINE,
+            r"Software\Microsoft\VisualStudio\SxS\VC7",
+            access=winreg.KEY_READ | winreg.KEY_WOW64_32KEY
+        )
+    except OSError:
+        log.debug("Visual C++ is not registered")
+        return None, None
+
+    best_version = 0
+    best_dir = None
+    with key:
+        for i in count():
+            try:
+                v, vc_dir, vt = winreg.EnumValue(key, i)
+            except OSError:
+                break
+            if v and vt == winreg.REG_SZ and os.path.isdir(vc_dir):
+                try:
+                    version = int(float(v))
+                except (ValueError, TypeError):
+                    continue
+                if version >= 14 and version > best_version:
+                    best_version, best_dir = version, vc_dir
+    return best_version, best_dir
+
+def _find_vc2017():
+    """Returns "15, path" based on the result of invoking vswhere.exe
+    If no install is found, returns "None, None"
+
+    The version is returned to avoid unnecessarily changing the function
+    result. It may be ignored when the path is not None.
+
+    If vswhere.exe is not available, by definition, VS 2017 is not
+    installed.
+    """
+    root = os.environ.get("ProgramFiles(x86)") or os.environ.get("ProgramFiles")
+    if not root:
+        return None, None
+
+    try:
+        path = subprocess.check_output([
+            os.path.join(root, "Microsoft Visual Studio", "Installer", "vswhere.exe"),
+            "-latest",
+            "-prerelease",
+            "-requires", "Microsoft.VisualStudio.Component.VC.Tools.x86.x64",
+            "-property", "installationPath",
+            "-products", "*",
+        ], encoding="mbcs", errors="strict").strip()
+    except (subprocess.CalledProcessError, OSError, UnicodeDecodeError):
+        return None, None
+
+    path = os.path.join(path, "VC", "Auxiliary", "Build")
+    if os.path.isdir(path):
+        return 15, path
+
+    return None, None
+
+PLAT_SPEC_TO_RUNTIME = {
+    'x86' : 'x86',
+    'x86_amd64' : 'x64',
+    'x86_arm' : 'arm',
+    'x86_arm64' : 'arm64'
+}
+
+def _find_vcvarsall(plat_spec):
+    # bpo-38597: Removed vcruntime return value
+    _, best_dir = _find_vc2017()
+
+    if not best_dir:
+        best_version, best_dir = _find_vc2015()
+
+    if not best_dir:
+        log.debug("No suitable Visual C++ version found")
+        return None, None
+
+    vcvarsall = os.path.join(best_dir, "vcvarsall.bat")
+    if not os.path.isfile(vcvarsall):
+        log.debug("%s cannot be found", vcvarsall)
+        return None, None
+
+    return vcvarsall, None
+
+def _get_vc_env(plat_spec):
+    if os.getenv("DISTUTILS_USE_SDK"):
+        return {
+            key.lower(): value
+            for key, value in os.environ.items()
+        }
+
+    vcvarsall, _ = _find_vcvarsall(plat_spec)
+    if not vcvarsall:
+        raise DistutilsPlatformError("Unable to find vcvarsall.bat")
+
+    try:
+        out = subprocess.check_output(
+            'cmd /u /c "{}" {} && set'.format(vcvarsall, plat_spec),
+            stderr=subprocess.STDOUT,
+        ).decode('utf-16le', errors='replace')
+    except subprocess.CalledProcessError as exc:
+        log.error(exc.output)
+        raise DistutilsPlatformError("Error executing {}"
+                .format(exc.cmd))
+
+    env = {
+        key.lower(): value
+        for key, _, value in
+        (line.partition('=') for line in out.splitlines())
+        if key and value
+    }
+
+    return env
+
+def _find_exe(exe, paths=None):
+    """Return path to an MSVC executable program.
+
+    Tries to find the program in several places: first, one of the
+    MSVC program search paths from the registry; next, the directories
+    in the PATH environment variable.  If any of those work, return an
+    absolute path that is known to exist.  If none of them work, just
+    return the original program name, 'exe'.
+    """
+    if not paths:
+        paths = os.getenv('path').split(os.pathsep)
+    for p in paths:
+        fn = os.path.join(os.path.abspath(p), exe)
+        if os.path.isfile(fn):
+            return fn
+    return exe
+
+# A map keyed by get_platform() return values to values accepted by
+# 'vcvarsall.bat'. Always cross-compile from x86 to work with the
+# lighter-weight MSVC installs that do not include native 64-bit tools.
+PLAT_TO_VCVARS = {
+    'win32' : 'x86',
+    'win-amd64' : 'x86_amd64',
+    'win-arm32' : 'x86_arm',
+    'win-arm64' : 'x86_arm64'
+}
+
+class MSVCCompiler(CCompiler) :
+    """Concrete class that implements an interface to Microsoft Visual C++,
+       as defined by the CCompiler abstract class."""
+
+    compiler_type = 'msvc'
+
+    # Just set this so CCompiler's constructor doesn't barf.  We currently
+    # don't use the 'set_executables()' bureaucracy provided by CCompiler,
+    # as it really isn't necessary for this sort of single-compiler class.
+    # Would be nice to have a consistent interface with UnixCCompiler,
+    # though, so it's worth thinking about.
+    executables = {}
+
+    # Private class data (need to distinguish C from C++ source for compiler)
+    _c_extensions = ['.c']
+    _cpp_extensions = ['.cc', '.cpp', '.cxx']
+    _rc_extensions = ['.rc']
+    _mc_extensions = ['.mc']
+
+    # Needed for the filename generation methods provided by the
+    # base class, CCompiler.
+    src_extensions = (_c_extensions + _cpp_extensions +
+                      _rc_extensions + _mc_extensions)
+    res_extension = '.res'
+    obj_extension = '.obj'
+    static_lib_extension = '.lib'
+    shared_lib_extension = '.dll'
+    static_lib_format = shared_lib_format = '%s%s'
+    exe_extension = '.exe'
+
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        CCompiler.__init__ (self, verbose, dry_run, force)
+        # target platform (.plat_name is consistent with 'bdist')
+        self.plat_name = None
+        self.initialized = False
+
+    def initialize(self, plat_name=None):
+        # multi-init means we would need to check platform same each time...
+        assert not self.initialized, "don't init multiple times"
+        if plat_name is None:
+            plat_name = get_platform()
+        # sanity check for platforms to prevent obscure errors later.
+        if plat_name not in PLAT_TO_VCVARS:
+            raise DistutilsPlatformError("--plat-name must be one of {}"
+                                         .format(tuple(PLAT_TO_VCVARS)))
+
+        # Get the vcvarsall.bat spec for the requested platform.
+        plat_spec = PLAT_TO_VCVARS[plat_name]
+
+        vc_env = _get_vc_env(plat_spec)
+        if not vc_env:
+            raise DistutilsPlatformError("Unable to find a compatible "
+                "Visual Studio installation.")
+
+        self._paths = vc_env.get('path', '')
+        paths = self._paths.split(os.pathsep)
+        self.cc = _find_exe("cl.exe", paths)
+        self.linker = _find_exe("link.exe", paths)
+        self.lib = _find_exe("lib.exe", paths)
+        self.rc = _find_exe("rc.exe", paths)   # resource compiler
+        self.mc = _find_exe("mc.exe", paths)   # message compiler
+        self.mt = _find_exe("mt.exe", paths)   # message compiler
+
+        for dir in vc_env.get('include', '').split(os.pathsep):
+            if dir:
+                self.add_include_dir(dir.rstrip(os.sep))
+
+        for dir in vc_env.get('lib', '').split(os.pathsep):
+            if dir:
+                self.add_library_dir(dir.rstrip(os.sep))
+
+        self.preprocess_options = None
+        # bpo-38597: Always compile with dynamic linking
+        # Future releases of Python 3.x will include all past
+        # versions of vcruntime*.dll for compatibility.
+        self.compile_options = [
+            '/nologo', '/Ox', '/W3', '/GL', '/DNDEBUG', '/MD'
+        ]
+
+        self.compile_options_debug = [
+            '/nologo', '/Od', '/MDd', '/Zi', '/W3', '/D_DEBUG'
+        ]
+
+        ldflags = [
+            '/nologo', '/INCREMENTAL:NO', '/LTCG'
+        ]
+
+        ldflags_debug = [
+            '/nologo', '/INCREMENTAL:NO', '/LTCG', '/DEBUG:FULL'
+        ]
+
+        self.ldflags_exe = [*ldflags, '/MANIFEST:EMBED,ID=1']
+        self.ldflags_exe_debug = [*ldflags_debug, '/MANIFEST:EMBED,ID=1']
+        self.ldflags_shared = [*ldflags, '/DLL', '/MANIFEST:EMBED,ID=2', '/MANIFESTUAC:NO']
+        self.ldflags_shared_debug = [*ldflags_debug, '/DLL', '/MANIFEST:EMBED,ID=2', '/MANIFESTUAC:NO']
+        self.ldflags_static = [*ldflags]
+        self.ldflags_static_debug = [*ldflags_debug]
+
+        self._ldflags = {
+            (CCompiler.EXECUTABLE, None): self.ldflags_exe,
+            (CCompiler.EXECUTABLE, False): self.ldflags_exe,
+            (CCompiler.EXECUTABLE, True): self.ldflags_exe_debug,
+            (CCompiler.SHARED_OBJECT, None): self.ldflags_shared,
+            (CCompiler.SHARED_OBJECT, False): self.ldflags_shared,
+            (CCompiler.SHARED_OBJECT, True): self.ldflags_shared_debug,
+            (CCompiler.SHARED_LIBRARY, None): self.ldflags_static,
+            (CCompiler.SHARED_LIBRARY, False): self.ldflags_static,
+            (CCompiler.SHARED_LIBRARY, True): self.ldflags_static_debug,
+        }
+
+        self.initialized = True
+
+    # -- Worker methods ------------------------------------------------
+
+    def object_filenames(self,
+                         source_filenames,
+                         strip_dir=0,
+                         output_dir=''):
+        ext_map = {
+            **{ext: self.obj_extension for ext in self.src_extensions},
+            **{ext: self.res_extension for ext in self._rc_extensions + self._mc_extensions},
+        }
+
+        output_dir = output_dir or ''
+
+        def make_out_path(p):
+            base, ext = os.path.splitext(p)
+            if strip_dir:
+                base = os.path.basename(base)
+            else:
+                _, base = os.path.splitdrive(base)
+                if base.startswith((os.path.sep, os.path.altsep)):
+                    base = base[1:]
+            try:
+                # XXX: This may produce absurdly long paths. We should check
+                # the length of the result and trim base until we fit within
+                # 260 characters.
+                return os.path.join(output_dir, base + ext_map[ext])
+            except LookupError:
+                # Better to raise an exception instead of silently continuing
+                # and later complain about sources and targets having
+                # different lengths
+                raise CompileError("Don't know how to compile {}".format(p))
+
+        return list(map(make_out_path, source_filenames))
+
+
+    def compile(self, sources,
+                output_dir=None, macros=None, include_dirs=None, debug=0,
+                extra_preargs=None, extra_postargs=None, depends=None):
+
+        if not self.initialized:
+            self.initialize()
+        compile_info = self._setup_compile(output_dir, macros, include_dirs,
+                                           sources, depends, extra_postargs)
+        macros, objects, extra_postargs, pp_opts, build = compile_info
+
+        compile_opts = extra_preargs or []
+        compile_opts.append('/c')
+        if debug:
+            compile_opts.extend(self.compile_options_debug)
+        else:
+            compile_opts.extend(self.compile_options)
+
+
+        add_cpp_opts = False
+
+        for obj in objects:
+            try:
+                src, ext = build[obj]
+            except KeyError:
+                continue
+            if debug:
+                # pass the full pathname to MSVC in debug mode,
+                # this allows the debugger to find the source file
+                # without asking the user to browse for it
+                src = os.path.abspath(src)
+
+            if ext in self._c_extensions:
+                input_opt = "/Tc" + src
+            elif ext in self._cpp_extensions:
+                input_opt = "/Tp" + src
+                add_cpp_opts = True
+            elif ext in self._rc_extensions:
+                # compile .RC to .RES file
+                input_opt = src
+                output_opt = "/fo" + obj
+                try:
+                    self.spawn([self.rc] + pp_opts + [output_opt, input_opt])
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            elif ext in self._mc_extensions:
+                # Compile .MC to .RC file to .RES file.
+                #   * '-h dir' specifies the directory for the
+                #     generated include file
+                #   * '-r dir' specifies the target directory of the
+                #     generated RC file and the binary message resource
+                #     it includes
+                #
+                # For now (since there are no options to change this),
+                # we use the source-directory for the include file and
+                # the build directory for the RC file and message
+                # resources. This works at least for win32all.
+                h_dir = os.path.dirname(src)
+                rc_dir = os.path.dirname(obj)
+                try:
+                    # first compile .MC to .RC and .H file
+                    self.spawn([self.mc, '-h', h_dir, '-r', rc_dir, src])
+                    base, _ = os.path.splitext(os.path.basename (src))
+                    rc_file = os.path.join(rc_dir, base + '.rc')
+                    # then compile .RC to .RES file
+                    self.spawn([self.rc, "/fo" + obj, rc_file])
+
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            else:
+                # how to handle this file?
+                raise CompileError("Don't know how to compile {} to {}"
+                                   .format(src, obj))
+
+            args = [self.cc] + compile_opts + pp_opts
+            if add_cpp_opts:
+                args.append('/EHsc')
+            args.append(input_opt)
+            args.append("/Fo" + obj)
+            args.extend(extra_postargs)
+
+            try:
+                self.spawn(args)
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+        return objects
+
+
+    def create_static_lib(self,
+                          objects,
+                          output_libname,
+                          output_dir=None,
+                          debug=0,
+                          target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        objects, output_dir = self._fix_object_args(objects, output_dir)
+        output_filename = self.library_filename(output_libname,
+                                                output_dir=output_dir)
+
+        if self._need_link(objects, output_filename):
+            lib_args = objects + ['/OUT:' + output_filename]
+            if debug:
+                pass # XXX what goes here?
+            try:
+                log.debug('Executing "%s" %s', self.lib, ' '.join(lib_args))
+                self.spawn([self.lib] + lib_args)
+            except DistutilsExecError as msg:
+                raise LibError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+
+    def link(self,
+             target_desc,
+             objects,
+             output_filename,
+             output_dir=None,
+             libraries=None,
+             library_dirs=None,
+             runtime_library_dirs=None,
+             export_symbols=None,
+             debug=0,
+             extra_preargs=None,
+             extra_postargs=None,
+             build_temp=None,
+             target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        objects, output_dir = self._fix_object_args(objects, output_dir)
+        fixed_args = self._fix_lib_args(libraries, library_dirs,
+                                        runtime_library_dirs)
+        libraries, library_dirs, runtime_library_dirs = fixed_args
+
+        if runtime_library_dirs:
+            self.warn("I don't know what to do with 'runtime_library_dirs': "
+                       + str(runtime_library_dirs))
+
+        lib_opts = gen_lib_options(self,
+                                   library_dirs, runtime_library_dirs,
+                                   libraries)
+        if output_dir is not None:
+            output_filename = os.path.join(output_dir, output_filename)
+
+        if self._need_link(objects, output_filename):
+            ldflags = self._ldflags[target_desc, debug]
+
+            export_opts = ["/EXPORT:" + sym for sym in (export_symbols or [])]
+
+            ld_args = (ldflags + lib_opts + export_opts +
+                       objects + ['/OUT:' + output_filename])
+
+            # The MSVC linker generates .lib and .exp files, which cannot be
+            # suppressed by any linker switches. The .lib files may even be
+            # needed! Make sure they are generated in the temporary build
+            # directory. Since they have different names for debug and release
+            # builds, they can go into the same directory.
+            build_temp = os.path.dirname(objects[0])
+            if export_symbols is not None:
+                (dll_name, dll_ext) = os.path.splitext(
+                    os.path.basename(output_filename))
+                implib_file = os.path.join(
+                    build_temp,
+                    self.library_filename(dll_name))
+                ld_args.append ('/IMPLIB:' + implib_file)
+
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+
+            output_dir = os.path.dirname(os.path.abspath(output_filename))
+            self.mkpath(output_dir)
+            try:
+                log.debug('Executing "%s" %s', self.linker, ' '.join(ld_args))
+                self.spawn([self.linker] + ld_args)
+            except DistutilsExecError as msg:
+                raise LinkError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    def spawn(self, cmd):
+        env = dict(os.environ, PATH=self._paths)
+        with self._fallback_spawn(cmd, env) as fallback:
+            return super().spawn(cmd, env=env)
+        return fallback.value
+
+    @contextlib.contextmanager
+    def _fallback_spawn(self, cmd, env):
+        """
+        Discovered in pypa/distutils#15, some tools monkeypatch the compiler,
+        so the 'env' kwarg causes a TypeError. Detect this condition and
+        restore the legacy, unsafe behavior.
+        """
+        bag = type('Bag', (), {})()
+        try:
+            yield bag
+        except TypeError as exc:
+            if "unexpected keyword argument 'env'" not in str(exc):
+                raise
+        else:
+            return
+        warnings.warn(
+            "Fallback spawn triggered. Please update distutils monkeypatch.")
+        with unittest.mock.patch('os.environ', env):
+            bag.value = super().spawn(cmd)
+
+    # -- Miscellaneous methods -----------------------------------------
+    # These are all used by the 'gen_lib_options() function, in
+    # ccompiler.py.
+
+    def library_dir_option(self, dir):
+        return "/LIBPATH:" + dir
+
+    def runtime_library_dir_option(self, dir):
+        raise DistutilsPlatformError(
+              "don't know how to set runtime library search path for MSVC")
+
+    def library_option(self, lib):
+        return self.library_filename(lib)
+
+    def find_library_file(self, dirs, lib, debug=0):
+        # Prefer a debugging library if found (and requested), but deal
+        # with it if we don't have one.
+        if debug:
+            try_names = [lib + "_d", lib]
+        else:
+            try_names = [lib]
+        for dir in dirs:
+            for name in try_names:
+                libfile = os.path.join(dir, self.library_filename(name))
+                if os.path.isfile(libfile):
+                    return libfile
+        else:
+            # Oops, didn't find it in *any* of 'dirs'
+            return None
diff --git a/venv/Lib/site-packages/setuptools/_distutils/archive_util.py b/venv/Lib/site-packages/setuptools/_distutils/archive_util.py
new file mode 100644
index 000000000..565a3117b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/archive_util.py
@@ -0,0 +1,256 @@
+"""distutils.archive_util
+
+Utility functions for creating archive files (tarballs, zip files,
+that sort of thing)."""
+
+import os
+from warnings import warn
+import sys
+
+try:
+    import zipfile
+except ImportError:
+    zipfile = None
+
+
+from distutils.errors import DistutilsExecError
+from distutils.spawn import spawn
+from distutils.dir_util import mkpath
+from distutils import log
+
+try:
+    from pwd import getpwnam
+except ImportError:
+    getpwnam = None
+
+try:
+    from grp import getgrnam
+except ImportError:
+    getgrnam = None
+
+def _get_gid(name):
+    """Returns a gid, given a group name."""
+    if getgrnam is None or name is None:
+        return None
+    try:
+        result = getgrnam(name)
+    except KeyError:
+        result = None
+    if result is not None:
+        return result[2]
+    return None
+
+def _get_uid(name):
+    """Returns an uid, given a user name."""
+    if getpwnam is None or name is None:
+        return None
+    try:
+        result = getpwnam(name)
+    except KeyError:
+        result = None
+    if result is not None:
+        return result[2]
+    return None
+
+def make_tarball(base_name, base_dir, compress="gzip", verbose=0, dry_run=0,
+                 owner=None, group=None):
+    """Create a (possibly compressed) tar file from all the files under
+    'base_dir'.
+
+    'compress' must be "gzip" (the default), "bzip2", "xz", "compress", or
+    None.  ("compress" will be deprecated in Python 3.2)
+
+    'owner' and 'group' can be used to define an owner and a group for the
+    archive that is being built. If not provided, the current owner and group
+    will be used.
+
+    The output tar file will be named 'base_dir' +  ".tar", possibly plus
+    the appropriate compression extension (".gz", ".bz2", ".xz" or ".Z").
+
+    Returns the output filename.
+    """
+    tar_compression = {'gzip': 'gz', 'bzip2': 'bz2', 'xz': 'xz', None: '',
+                       'compress': ''}
+    compress_ext = {'gzip': '.gz', 'bzip2': '.bz2', 'xz': '.xz',
+                    'compress': '.Z'}
+
+    # flags for compression program, each element of list will be an argument
+    if compress is not None and compress not in compress_ext.keys():
+        raise ValueError(
+              "bad value for 'compress': must be None, 'gzip', 'bzip2', "
+              "'xz' or 'compress'")
+
+    archive_name = base_name + '.tar'
+    if compress != 'compress':
+        archive_name += compress_ext.get(compress, '')
+
+    mkpath(os.path.dirname(archive_name), dry_run=dry_run)
+
+    # creating the tarball
+    import tarfile  # late import so Python build itself doesn't break
+
+    log.info('Creating tar archive')
+
+    uid = _get_uid(owner)
+    gid = _get_gid(group)
+
+    def _set_uid_gid(tarinfo):
+        if gid is not None:
+            tarinfo.gid = gid
+            tarinfo.gname = group
+        if uid is not None:
+            tarinfo.uid = uid
+            tarinfo.uname = owner
+        return tarinfo
+
+    if not dry_run:
+        tar = tarfile.open(archive_name, 'w|%s' % tar_compression[compress])
+        try:
+            tar.add(base_dir, filter=_set_uid_gid)
+        finally:
+            tar.close()
+
+    # compression using `compress`
+    if compress == 'compress':
+        warn("'compress' will be deprecated.", PendingDeprecationWarning)
+        # the option varies depending on the platform
+        compressed_name = archive_name + compress_ext[compress]
+        if sys.platform == 'win32':
+            cmd = [compress, archive_name, compressed_name]
+        else:
+            cmd = [compress, '-f', archive_name]
+        spawn(cmd, dry_run=dry_run)
+        return compressed_name
+
+    return archive_name
+
+def make_zipfile(base_name, base_dir, verbose=0, dry_run=0):
+    """Create a zip file from all the files under 'base_dir'.
+
+    The output zip file will be named 'base_name' + ".zip".  Uses either the
+    "zipfile" Python module (if available) or the InfoZIP "zip" utility
+    (if installed and found on the default search path).  If neither tool is
+    available, raises DistutilsExecError.  Returns the name of the output zip
+    file.
+    """
+    zip_filename = base_name + ".zip"
+    mkpath(os.path.dirname(zip_filename), dry_run=dry_run)
+
+    # If zipfile module is not available, try spawning an external
+    # 'zip' command.
+    if zipfile is None:
+        if verbose:
+            zipoptions = "-r"
+        else:
+            zipoptions = "-rq"
+
+        try:
+            spawn(["zip", zipoptions, zip_filename, base_dir],
+                  dry_run=dry_run)
+        except DistutilsExecError:
+            # XXX really should distinguish between "couldn't find
+            # external 'zip' command" and "zip failed".
+            raise DistutilsExecError(("unable to create zip file '%s': "
+                   "could neither import the 'zipfile' module nor "
+                   "find a standalone zip utility") % zip_filename)
+
+    else:
+        log.info("creating '%s' and adding '%s' to it",
+                 zip_filename, base_dir)
+
+        if not dry_run:
+            try:
+                zip = zipfile.ZipFile(zip_filename, "w",
+                                      compression=zipfile.ZIP_DEFLATED)
+            except RuntimeError:
+                zip = zipfile.ZipFile(zip_filename, "w",
+                                      compression=zipfile.ZIP_STORED)
+
+            with zip:
+                if base_dir != os.curdir:
+                    path = os.path.normpath(os.path.join(base_dir, ''))
+                    zip.write(path, path)
+                    log.info("adding '%s'", path)
+                for dirpath, dirnames, filenames in os.walk(base_dir):
+                    for name in dirnames:
+                        path = os.path.normpath(os.path.join(dirpath, name, ''))
+                        zip.write(path, path)
+                        log.info("adding '%s'", path)
+                    for name in filenames:
+                        path = os.path.normpath(os.path.join(dirpath, name))
+                        if os.path.isfile(path):
+                            zip.write(path, path)
+                            log.info("adding '%s'", path)
+
+    return zip_filename
+
+ARCHIVE_FORMATS = {
+    'gztar': (make_tarball, [('compress', 'gzip')], "gzip'ed tar-file"),
+    'bztar': (make_tarball, [('compress', 'bzip2')], "bzip2'ed tar-file"),
+    'xztar': (make_tarball, [('compress', 'xz')], "xz'ed tar-file"),
+    'ztar':  (make_tarball, [('compress', 'compress')], "compressed tar file"),
+    'tar':   (make_tarball, [('compress', None)], "uncompressed tar file"),
+    'zip':   (make_zipfile, [],"ZIP file")
+    }
+
+def check_archive_formats(formats):
+    """Returns the first format from the 'format' list that is unknown.
+
+    If all formats are known, returns None
+    """
+    for format in formats:
+        if format not in ARCHIVE_FORMATS:
+            return format
+    return None
+
+def make_archive(base_name, format, root_dir=None, base_dir=None, verbose=0,
+                 dry_run=0, owner=None, group=None):
+    """Create an archive file (eg. zip or tar).
+
+    'base_name' is the name of the file to create, minus any format-specific
+    extension; 'format' is the archive format: one of "zip", "tar", "gztar",
+    "bztar", "xztar", or "ztar".
+
+    'root_dir' is a directory that will be the root directory of the
+    archive; ie. we typically chdir into 'root_dir' before creating the
+    archive.  'base_dir' is the directory where we start archiving from;
+    ie. 'base_dir' will be the common prefix of all files and
+    directories in the archive.  'root_dir' and 'base_dir' both default
+    to the current directory.  Returns the name of the archive file.
+
+    'owner' and 'group' are used when creating a tar archive. By default,
+    uses the current owner and group.
+    """
+    save_cwd = os.getcwd()
+    if root_dir is not None:
+        log.debug("changing into '%s'", root_dir)
+        base_name = os.path.abspath(base_name)
+        if not dry_run:
+            os.chdir(root_dir)
+
+    if base_dir is None:
+        base_dir = os.curdir
+
+    kwargs = {'dry_run': dry_run}
+
+    try:
+        format_info = ARCHIVE_FORMATS[format]
+    except KeyError:
+        raise ValueError("unknown archive format '%s'" % format)
+
+    func = format_info[0]
+    for arg, val in format_info[1]:
+        kwargs[arg] = val
+
+    if format != 'zip':
+        kwargs['owner'] = owner
+        kwargs['group'] = group
+
+    try:
+        filename = func(base_name, base_dir, **kwargs)
+    finally:
+        if root_dir is not None:
+            log.debug("changing back to '%s'", save_cwd)
+            os.chdir(save_cwd)
+
+    return filename
diff --git a/venv/Lib/site-packages/setuptools/_distutils/bcppcompiler.py b/venv/Lib/site-packages/setuptools/_distutils/bcppcompiler.py
new file mode 100644
index 000000000..071fea5d0
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/bcppcompiler.py
@@ -0,0 +1,393 @@
+"""distutils.bcppcompiler
+
+Contains BorlandCCompiler, an implementation of the abstract CCompiler class
+for the Borland C++ compiler.
+"""
+
+# This implementation by Lyle Johnson, based on the original msvccompiler.py
+# module and using the directions originally published by Gordon Williams.
+
+# XXX looks like there's a LOT of overlap between these two classes:
+# someone should sit down and factor out the common code as
+# WindowsCCompiler!  --GPW
+
+
+import os
+from distutils.errors import \
+     DistutilsExecError, \
+     CompileError, LibError, LinkError, UnknownFileError
+from distutils.ccompiler import \
+     CCompiler, gen_preprocess_options
+from distutils.file_util import write_file
+from distutils.dep_util import newer
+from distutils import log
+
+class BCPPCompiler(CCompiler) :
+    """Concrete class that implements an interface to the Borland C/C++
+    compiler, as defined by the CCompiler abstract class.
+    """
+
+    compiler_type = 'bcpp'
+
+    # Just set this so CCompiler's constructor doesn't barf.  We currently
+    # don't use the 'set_executables()' bureaucracy provided by CCompiler,
+    # as it really isn't necessary for this sort of single-compiler class.
+    # Would be nice to have a consistent interface with UnixCCompiler,
+    # though, so it's worth thinking about.
+    executables = {}
+
+    # Private class data (need to distinguish C from C++ source for compiler)
+    _c_extensions = ['.c']
+    _cpp_extensions = ['.cc', '.cpp', '.cxx']
+
+    # Needed for the filename generation methods provided by the
+    # base class, CCompiler.
+    src_extensions = _c_extensions + _cpp_extensions
+    obj_extension = '.obj'
+    static_lib_extension = '.lib'
+    shared_lib_extension = '.dll'
+    static_lib_format = shared_lib_format = '%s%s'
+    exe_extension = '.exe'
+
+
+    def __init__ (self,
+                  verbose=0,
+                  dry_run=0,
+                  force=0):
+
+        CCompiler.__init__ (self, verbose, dry_run, force)
+
+        # These executables are assumed to all be in the path.
+        # Borland doesn't seem to use any special registry settings to
+        # indicate their installation locations.
+
+        self.cc = "bcc32.exe"
+        self.linker = "ilink32.exe"
+        self.lib = "tlib.exe"
+
+        self.preprocess_options = None
+        self.compile_options = ['/tWM', '/O2', '/q', '/g0']
+        self.compile_options_debug = ['/tWM', '/Od', '/q', '/g0']
+
+        self.ldflags_shared = ['/Tpd', '/Gn', '/q', '/x']
+        self.ldflags_shared_debug = ['/Tpd', '/Gn', '/q', '/x']
+        self.ldflags_static = []
+        self.ldflags_exe = ['/Gn', '/q', '/x']
+        self.ldflags_exe_debug = ['/Gn', '/q', '/x','/r']
+
+
+    # -- Worker methods ------------------------------------------------
+
+    def compile(self, sources,
+                output_dir=None, macros=None, include_dirs=None, debug=0,
+                extra_preargs=None, extra_postargs=None, depends=None):
+
+        macros, objects, extra_postargs, pp_opts, build = \
+                self._setup_compile(output_dir, macros, include_dirs, sources,
+                                    depends, extra_postargs)
+        compile_opts = extra_preargs or []
+        compile_opts.append ('-c')
+        if debug:
+            compile_opts.extend (self.compile_options_debug)
+        else:
+            compile_opts.extend (self.compile_options)
+
+        for obj in objects:
+            try:
+                src, ext = build[obj]
+            except KeyError:
+                continue
+            # XXX why do the normpath here?
+            src = os.path.normpath(src)
+            obj = os.path.normpath(obj)
+            # XXX _setup_compile() did a mkpath() too but before the normpath.
+            # Is it possible to skip the normpath?
+            self.mkpath(os.path.dirname(obj))
+
+            if ext == '.res':
+                # This is already a binary file -- skip it.
+                continue # the 'for' loop
+            if ext == '.rc':
+                # This needs to be compiled to a .res file -- do it now.
+                try:
+                    self.spawn (["brcc32", "-fo", obj, src])
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue # the 'for' loop
+
+            # The next two are both for the real compiler.
+            if ext in self._c_extensions:
+                input_opt = ""
+            elif ext in self._cpp_extensions:
+                input_opt = "-P"
+            else:
+                # Unknown file type -- no extra options.  The compiler
+                # will probably fail, but let it just in case this is a
+                # file the compiler recognizes even if we don't.
+                input_opt = ""
+
+            output_opt = "-o" + obj
+
+            # Compiler command line syntax is: "bcc32 [options] file(s)".
+            # Note that the source file names must appear at the end of
+            # the command line.
+            try:
+                self.spawn ([self.cc] + compile_opts + pp_opts +
+                            [input_opt, output_opt] +
+                            extra_postargs + [src])
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+        return objects
+
+    # compile ()
+
+
+    def create_static_lib (self,
+                           objects,
+                           output_libname,
+                           output_dir=None,
+                           debug=0,
+                           target_lang=None):
+
+        (objects, output_dir) = self._fix_object_args (objects, output_dir)
+        output_filename = \
+            self.library_filename (output_libname, output_dir=output_dir)
+
+        if self._need_link (objects, output_filename):
+            lib_args = [output_filename, '/u'] + objects
+            if debug:
+                pass                    # XXX what goes here?
+            try:
+                self.spawn ([self.lib] + lib_args)
+            except DistutilsExecError as msg:
+                raise LibError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    # create_static_lib ()
+
+
+    def link (self,
+              target_desc,
+              objects,
+              output_filename,
+              output_dir=None,
+              libraries=None,
+              library_dirs=None,
+              runtime_library_dirs=None,
+              export_symbols=None,
+              debug=0,
+              extra_preargs=None,
+              extra_postargs=None,
+              build_temp=None,
+              target_lang=None):
+
+        # XXX this ignores 'build_temp'!  should follow the lead of
+        # msvccompiler.py
+
+        (objects, output_dir) = self._fix_object_args (objects, output_dir)
+        (libraries, library_dirs, runtime_library_dirs) = \
+            self._fix_lib_args (libraries, library_dirs, runtime_library_dirs)
+
+        if runtime_library_dirs:
+            log.warn("I don't know what to do with 'runtime_library_dirs': %s",
+                     str(runtime_library_dirs))
+
+        if output_dir is not None:
+            output_filename = os.path.join (output_dir, output_filename)
+
+        if self._need_link (objects, output_filename):
+
+            # Figure out linker args based on type of target.
+            if target_desc == CCompiler.EXECUTABLE:
+                startup_obj = 'c0w32'
+                if debug:
+                    ld_args = self.ldflags_exe_debug[:]
+                else:
+                    ld_args = self.ldflags_exe[:]
+            else:
+                startup_obj = 'c0d32'
+                if debug:
+                    ld_args = self.ldflags_shared_debug[:]
+                else:
+                    ld_args = self.ldflags_shared[:]
+
+
+            # Create a temporary exports file for use by the linker
+            if export_symbols is None:
+                def_file = ''
+            else:
+                head, tail = os.path.split (output_filename)
+                modname, ext = os.path.splitext (tail)
+                temp_dir = os.path.dirname(objects[0]) # preserve tree structure
+                def_file = os.path.join (temp_dir, '%s.def' % modname)
+                contents = ['EXPORTS']
+                for sym in (export_symbols or []):
+                    contents.append('  %s=_%s' % (sym, sym))
+                self.execute(write_file, (def_file, contents),
+                             "writing %s" % def_file)
+
+            # Borland C++ has problems with '/' in paths
+            objects2 = map(os.path.normpath, objects)
+            # split objects in .obj and .res files
+            # Borland C++ needs them at different positions in the command line
+            objects = [startup_obj]
+            resources = []
+            for file in objects2:
+                (base, ext) = os.path.splitext(os.path.normcase(file))
+                if ext == '.res':
+                    resources.append(file)
+                else:
+                    objects.append(file)
+
+
+            for l in library_dirs:
+                ld_args.append("/L%s" % os.path.normpath(l))
+            ld_args.append("/L.") # we sometimes use relative paths
+
+            # list of object files
+            ld_args.extend(objects)
+
+            # XXX the command-line syntax for Borland C++ is a bit wonky;
+            # certain filenames are jammed together in one big string, but
+            # comma-delimited.  This doesn't mesh too well with the
+            # Unix-centric attitude (with a DOS/Windows quoting hack) of
+            # 'spawn()', so constructing the argument list is a bit
+            # awkward.  Note that doing the obvious thing and jamming all
+            # the filenames and commas into one argument would be wrong,
+            # because 'spawn()' would quote any filenames with spaces in
+            # them.  Arghghh!.  Apparently it works fine as coded...
+
+            # name of dll/exe file
+            ld_args.extend([',',output_filename])
+            # no map file and start libraries
+            ld_args.append(',,')
+
+            for lib in libraries:
+                # see if we find it and if there is a bcpp specific lib
+                # (xxx_bcpp.lib)
+                libfile = self.find_library_file(library_dirs, lib, debug)
+                if libfile is None:
+                    ld_args.append(lib)
+                    # probably a BCPP internal library -- don't warn
+                else:
+                    # full name which prefers bcpp_xxx.lib over xxx.lib
+                    ld_args.append(libfile)
+
+            # some default libraries
+            ld_args.append ('import32')
+            ld_args.append ('cw32mt')
+
+            # def file for export symbols
+            ld_args.extend([',',def_file])
+            # add resource files
+            ld_args.append(',')
+            ld_args.extend(resources)
+
+
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+
+            self.mkpath (os.path.dirname (output_filename))
+            try:
+                self.spawn ([self.linker] + ld_args)
+            except DistutilsExecError as msg:
+                raise LinkError(msg)
+
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    # link ()
+
+    # -- Miscellaneous methods -----------------------------------------
+
+
+    def find_library_file (self, dirs, lib, debug=0):
+        # List of effective library names to try, in order of preference:
+        # xxx_bcpp.lib is better than xxx.lib
+        # and xxx_d.lib is better than xxx.lib if debug is set
+        #
+        # The "_bcpp" suffix is to handle a Python installation for people
+        # with multiple compilers (primarily Distutils hackers, I suspect
+        # ;-).  The idea is they'd have one static library for each
+        # compiler they care about, since (almost?) every Windows compiler
+        # seems to have a different format for static libraries.
+        if debug:
+            dlib = (lib + "_d")
+            try_names = (dlib + "_bcpp", lib + "_bcpp", dlib, lib)
+        else:
+            try_names = (lib + "_bcpp", lib)
+
+        for dir in dirs:
+            for name in try_names:
+                libfile = os.path.join(dir, self.library_filename(name))
+                if os.path.exists(libfile):
+                    return libfile
+        else:
+            # Oops, didn't find it in *any* of 'dirs'
+            return None
+
+    # overwrite the one from CCompiler to support rc and res-files
+    def object_filenames (self,
+                          source_filenames,
+                          strip_dir=0,
+                          output_dir=''):
+        if output_dir is None: output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            # use normcase to make sure '.rc' is really '.rc' and not '.RC'
+            (base, ext) = os.path.splitext (os.path.normcase(src_name))
+            if ext not in (self.src_extensions + ['.rc','.res']):
+                raise UnknownFileError("unknown file type '%s' (from '%s')" % \
+                      (ext, src_name))
+            if strip_dir:
+                base = os.path.basename (base)
+            if ext == '.res':
+                # these can go unchanged
+                obj_names.append (os.path.join (output_dir, base + ext))
+            elif ext == '.rc':
+                # these need to be compiled to .res-files
+                obj_names.append (os.path.join (output_dir, base + '.res'))
+            else:
+                obj_names.append (os.path.join (output_dir,
+                                            base + self.obj_extension))
+        return obj_names
+
+    # object_filenames ()
+
+    def preprocess (self,
+                    source,
+                    output_file=None,
+                    macros=None,
+                    include_dirs=None,
+                    extra_preargs=None,
+                    extra_postargs=None):
+
+        (_, macros, include_dirs) = \
+            self._fix_compile_args(None, macros, include_dirs)
+        pp_opts = gen_preprocess_options(macros, include_dirs)
+        pp_args = ['cpp32.exe'] + pp_opts
+        if output_file is not None:
+            pp_args.append('-o' + output_file)
+        if extra_preargs:
+            pp_args[:0] = extra_preargs
+        if extra_postargs:
+            pp_args.extend(extra_postargs)
+        pp_args.append(source)
+
+        # We need to preprocess: either we're being forced to, or the
+        # source file is newer than the target (or the target doesn't
+        # exist).
+        if self.force or output_file is None or newer(source, output_file):
+            if output_file:
+                self.mkpath(os.path.dirname(output_file))
+            try:
+                self.spawn(pp_args)
+            except DistutilsExecError as msg:
+                print(msg)
+                raise CompileError(msg)
+
+    # preprocess()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/ccompiler.py b/venv/Lib/site-packages/setuptools/_distutils/ccompiler.py
new file mode 100644
index 000000000..57bb94e8b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/ccompiler.py
@@ -0,0 +1,1116 @@
+"""distutils.ccompiler
+
+Contains CCompiler, an abstract base class that defines the interface
+for the Distutils compiler abstraction model."""
+
+import sys, os, re
+from distutils.errors import *
+from distutils.spawn import spawn
+from distutils.file_util import move_file
+from distutils.dir_util import mkpath
+from distutils.dep_util import newer_group
+from distutils.util import split_quoted, execute
+from distutils import log
+
+class CCompiler:
+    """Abstract base class to define the interface that must be implemented
+    by real compiler classes.  Also has some utility methods used by
+    several compiler classes.
+
+    The basic idea behind a compiler abstraction class is that each
+    instance can be used for all the compile/link steps in building a
+    single project.  Thus, attributes common to all of those compile and
+    link steps -- include directories, macros to define, libraries to link
+    against, etc. -- are attributes of the compiler instance.  To allow for
+    variability in how individual files are treated, most of those
+    attributes may be varied on a per-compilation or per-link basis.
+    """
+
+    # 'compiler_type' is a class attribute that identifies this class.  It
+    # keeps code that wants to know what kind of compiler it's dealing with
+    # from having to import all possible compiler classes just to do an
+    # 'isinstance'.  In concrete CCompiler subclasses, 'compiler_type'
+    # should really, really be one of the keys of the 'compiler_class'
+    # dictionary (see below -- used by the 'new_compiler()' factory
+    # function) -- authors of new compiler interface classes are
+    # responsible for updating 'compiler_class'!
+    compiler_type = None
+
+    # XXX things not handled by this compiler abstraction model:
+    #   * client can't provide additional options for a compiler,
+    #     e.g. warning, optimization, debugging flags.  Perhaps this
+    #     should be the domain of concrete compiler abstraction classes
+    #     (UnixCCompiler, MSVCCompiler, etc.) -- or perhaps the base
+    #     class should have methods for the common ones.
+    #   * can't completely override the include or library searchg
+    #     path, ie. no "cc -I -Idir1 -Idir2" or "cc -L -Ldir1 -Ldir2".
+    #     I'm not sure how widely supported this is even by Unix
+    #     compilers, much less on other platforms.  And I'm even less
+    #     sure how useful it is; maybe for cross-compiling, but
+    #     support for that is a ways off.  (And anyways, cross
+    #     compilers probably have a dedicated binary with the
+    #     right paths compiled in.  I hope.)
+    #   * can't do really freaky things with the library list/library
+    #     dirs, e.g. "-Ldir1 -lfoo -Ldir2 -lfoo" to link against
+    #     different versions of libfoo.a in different locations.  I
+    #     think this is useless without the ability to null out the
+    #     library search path anyways.
+
+
+    # Subclasses that rely on the standard filename generation methods
+    # implemented below should override these; see the comment near
+    # those methods ('object_filenames()' et. al.) for details:
+    src_extensions = None               # list of strings
+    obj_extension = None                # string
+    static_lib_extension = None
+    shared_lib_extension = None         # string
+    static_lib_format = None            # format string
+    shared_lib_format = None            # prob. same as static_lib_format
+    exe_extension = None                # string
+
+    # Default language settings. language_map is used to detect a source
+    # file or Extension target language, checking source filenames.
+    # language_order is used to detect the language precedence, when deciding
+    # what language to use when mixing source types. For example, if some
+    # extension has two files with ".c" extension, and one with ".cpp", it
+    # is still linked as c++.
+    language_map = {".c"   : "c",
+                    ".cc"  : "c++",
+                    ".cpp" : "c++",
+                    ".cxx" : "c++",
+                    ".m"   : "objc",
+                   }
+    language_order = ["c++", "objc", "c"]
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        self.dry_run = dry_run
+        self.force = force
+        self.verbose = verbose
+
+        # 'output_dir': a common output directory for object, library,
+        # shared object, and shared library files
+        self.output_dir = None
+
+        # 'macros': a list of macro definitions (or undefinitions).  A
+        # macro definition is a 2-tuple (name, value), where the value is
+        # either a string or None (no explicit value).  A macro
+        # undefinition is a 1-tuple (name,).
+        self.macros = []
+
+        # 'include_dirs': a list of directories to search for include files
+        self.include_dirs = []
+
+        # 'libraries': a list of libraries to include in any link
+        # (library names, not filenames: eg. "foo" not "libfoo.a")
+        self.libraries = []
+
+        # 'library_dirs': a list of directories to search for libraries
+        self.library_dirs = []
+
+        # 'runtime_library_dirs': a list of directories to search for
+        # shared libraries/objects at runtime
+        self.runtime_library_dirs = []
+
+        # 'objects': a list of object files (or similar, such as explicitly
+        # named library files) to include on any link
+        self.objects = []
+
+        for key in self.executables.keys():
+            self.set_executable(key, self.executables[key])
+
+    def set_executables(self, **kwargs):
+        """Define the executables (and options for them) that will be run
+        to perform the various stages of compilation.  The exact set of
+        executables that may be specified here depends on the compiler
+        class (via the 'executables' class attribute), but most will have:
+          compiler      the C/C++ compiler
+          linker_so     linker used to create shared objects and libraries
+          linker_exe    linker used to create binary executables
+          archiver      static library creator
+
+        On platforms with a command-line (Unix, DOS/Windows), each of these
+        is a string that will be split into executable name and (optional)
+        list of arguments.  (Splitting the string is done similarly to how
+        Unix shells operate: words are delimited by spaces, but quotes and
+        backslashes can override this.  See
+        'distutils.util.split_quoted()'.)
+        """
+
+        # Note that some CCompiler implementation classes will define class
+        # attributes 'cpp', 'cc', etc. with hard-coded executable names;
+        # this is appropriate when a compiler class is for exactly one
+        # compiler/OS combination (eg. MSVCCompiler).  Other compiler
+        # classes (UnixCCompiler, in particular) are driven by information
+        # discovered at run-time, since there are many different ways to do
+        # basically the same things with Unix C compilers.
+
+        for key in kwargs:
+            if key not in self.executables:
+                raise ValueError("unknown executable '%s' for class %s" %
+                      (key, self.__class__.__name__))
+            self.set_executable(key, kwargs[key])
+
+    def set_executable(self, key, value):
+        if isinstance(value, str):
+            setattr(self, key, split_quoted(value))
+        else:
+            setattr(self, key, value)
+
+    def _find_macro(self, name):
+        i = 0
+        for defn in self.macros:
+            if defn[0] == name:
+                return i
+            i += 1
+        return None
+
+    def _check_macro_definitions(self, definitions):
+        """Ensures that every element of 'definitions' is a valid macro
+        definition, ie. either (name,value) 2-tuple or a (name,) tuple.  Do
+        nothing if all definitions are OK, raise TypeError otherwise.
+        """
+        for defn in definitions:
+            if not (isinstance(defn, tuple) and
+                    (len(defn) in (1, 2) and
+                      (isinstance (defn[1], str) or defn[1] is None)) and
+                    isinstance (defn[0], str)):
+                raise TypeError(("invalid macro definition '%s': " % defn) + \
+                      "must be tuple (string,), (string, string), or " + \
+                      "(string, None)")
+
+
+    # -- Bookkeeping methods -------------------------------------------
+
+    def define_macro(self, name, value=None):
+        """Define a preprocessor macro for all compilations driven by this
+        compiler object.  The optional parameter 'value' should be a
+        string; if it is not supplied, then the macro will be defined
+        without an explicit value and the exact outcome depends on the
+        compiler used (XXX true? does ANSI say anything about this?)
+        """
+        # Delete from the list of macro definitions/undefinitions if
+        # already there (so that this one will take precedence).
+        i = self._find_macro (name)
+        if i is not None:
+            del self.macros[i]
+
+        self.macros.append((name, value))
+
+    def undefine_macro(self, name):
+        """Undefine a preprocessor macro for all compilations driven by
+        this compiler object.  If the same macro is defined by
+        'define_macro()' and undefined by 'undefine_macro()' the last call
+        takes precedence (including multiple redefinitions or
+        undefinitions).  If the macro is redefined/undefined on a
+        per-compilation basis (ie. in the call to 'compile()'), then that
+        takes precedence.
+        """
+        # Delete from the list of macro definitions/undefinitions if
+        # already there (so that this one will take precedence).
+        i = self._find_macro (name)
+        if i is not None:
+            del self.macros[i]
+
+        undefn = (name,)
+        self.macros.append(undefn)
+
+    def add_include_dir(self, dir):
+        """Add 'dir' to the list of directories that will be searched for
+        header files.  The compiler is instructed to search directories in
+        the order in which they are supplied by successive calls to
+        'add_include_dir()'.
+        """
+        self.include_dirs.append(dir)
+
+    def set_include_dirs(self, dirs):
+        """Set the list of directories that will be searched to 'dirs' (a
+        list of strings).  Overrides any preceding calls to
+        'add_include_dir()'; subsequence calls to 'add_include_dir()' add
+        to the list passed to 'set_include_dirs()'.  This does not affect
+        any list of standard include directories that the compiler may
+        search by default.
+        """
+        self.include_dirs = dirs[:]
+
+    def add_library(self, libname):
+        """Add 'libname' to the list of libraries that will be included in
+        all links driven by this compiler object.  Note that 'libname'
+        should *not* be the name of a file containing a library, but the
+        name of the library itself: the actual filename will be inferred by
+        the linker, the compiler, or the compiler class (depending on the
+        platform).
+
+        The linker will be instructed to link against libraries in the
+        order they were supplied to 'add_library()' and/or
+        'set_libraries()'.  It is perfectly valid to duplicate library
+        names; the linker will be instructed to link against libraries as
+        many times as they are mentioned.
+        """
+        self.libraries.append(libname)
+
+    def set_libraries(self, libnames):
+        """Set the list of libraries to be included in all links driven by
+        this compiler object to 'libnames' (a list of strings).  This does
+        not affect any standard system libraries that the linker may
+        include by default.
+        """
+        self.libraries = libnames[:]
+
+    def add_library_dir(self, dir):
+        """Add 'dir' to the list of directories that will be searched for
+        libraries specified to 'add_library()' and 'set_libraries()'.  The
+        linker will be instructed to search for libraries in the order they
+        are supplied to 'add_library_dir()' and/or 'set_library_dirs()'.
+        """
+        self.library_dirs.append(dir)
+
+    def set_library_dirs(self, dirs):
+        """Set the list of library search directories to 'dirs' (a list of
+        strings).  This does not affect any standard library search path
+        that the linker may search by default.
+        """
+        self.library_dirs = dirs[:]
+
+    def add_runtime_library_dir(self, dir):
+        """Add 'dir' to the list of directories that will be searched for
+        shared libraries at runtime.
+        """
+        self.runtime_library_dirs.append(dir)
+
+    def set_runtime_library_dirs(self, dirs):
+        """Set the list of directories to search for shared libraries at
+        runtime to 'dirs' (a list of strings).  This does not affect any
+        standard search path that the runtime linker may search by
+        default.
+        """
+        self.runtime_library_dirs = dirs[:]
+
+    def add_link_object(self, object):
+        """Add 'object' to the list of object files (or analogues, such as
+        explicitly named library files or the output of "resource
+        compilers") to be included in every link driven by this compiler
+        object.
+        """
+        self.objects.append(object)
+
+    def set_link_objects(self, objects):
+        """Set the list of object files (or analogues) to be included in
+        every link to 'objects'.  This does not affect any standard object
+        files that the linker may include by default (such as system
+        libraries).
+        """
+        self.objects = objects[:]
+
+
+    # -- Private utility methods --------------------------------------
+    # (here for the convenience of subclasses)
+
+    # Helper method to prep compiler in subclass compile() methods
+
+    def _setup_compile(self, outdir, macros, incdirs, sources, depends,
+                       extra):
+        """Process arguments and decide which source files to compile."""
+        if outdir is None:
+            outdir = self.output_dir
+        elif not isinstance(outdir, str):
+            raise TypeError("'output_dir' must be a string or None")
+
+        if macros is None:
+            macros = self.macros
+        elif isinstance(macros, list):
+            macros = macros + (self.macros or [])
+        else:
+            raise TypeError("'macros' (if supplied) must be a list of tuples")
+
+        if incdirs is None:
+            incdirs = self.include_dirs
+        elif isinstance(incdirs, (list, tuple)):
+            incdirs = list(incdirs) + (self.include_dirs or [])
+        else:
+            raise TypeError(
+                  "'include_dirs' (if supplied) must be a list of strings")
+
+        if extra is None:
+            extra = []
+
+        # Get the list of expected output (object) files
+        objects = self.object_filenames(sources, strip_dir=0,
+                                        output_dir=outdir)
+        assert len(objects) == len(sources)
+
+        pp_opts = gen_preprocess_options(macros, incdirs)
+
+        build = {}
+        for i in range(len(sources)):
+            src = sources[i]
+            obj = objects[i]
+            ext = os.path.splitext(src)[1]
+            self.mkpath(os.path.dirname(obj))
+            build[obj] = (src, ext)
+
+        return macros, objects, extra, pp_opts, build
+
+    def _get_cc_args(self, pp_opts, debug, before):
+        # works for unixccompiler, cygwinccompiler
+        cc_args = pp_opts + ['-c']
+        if debug:
+            cc_args[:0] = ['-g']
+        if before:
+            cc_args[:0] = before
+        return cc_args
+
+    def _fix_compile_args(self, output_dir, macros, include_dirs):
+        """Typecheck and fix-up some of the arguments to the 'compile()'
+        method, and return fixed-up values.  Specifically: if 'output_dir'
+        is None, replaces it with 'self.output_dir'; ensures that 'macros'
+        is a list, and augments it with 'self.macros'; ensures that
+        'include_dirs' is a list, and augments it with 'self.include_dirs'.
+        Guarantees that the returned values are of the correct type,
+        i.e. for 'output_dir' either string or None, and for 'macros' and
+        'include_dirs' either list or None.
+        """
+        if output_dir is None:
+            output_dir = self.output_dir
+        elif not isinstance(output_dir, str):
+            raise TypeError("'output_dir' must be a string or None")
+
+        if macros is None:
+            macros = self.macros
+        elif isinstance(macros, list):
+            macros = macros + (self.macros or [])
+        else:
+            raise TypeError("'macros' (if supplied) must be a list of tuples")
+
+        if include_dirs is None:
+            include_dirs = self.include_dirs
+        elif isinstance(include_dirs, (list, tuple)):
+            include_dirs = list(include_dirs) + (self.include_dirs or [])
+        else:
+            raise TypeError(
+                  "'include_dirs' (if supplied) must be a list of strings")
+
+        return output_dir, macros, include_dirs
+
+    def _prep_compile(self, sources, output_dir, depends=None):
+        """Decide which souce files must be recompiled.
+
+        Determine the list of object files corresponding to 'sources',
+        and figure out which ones really need to be recompiled.
+        Return a list of all object files and a dictionary telling
+        which source files can be skipped.
+        """
+        # Get the list of expected output (object) files
+        objects = self.object_filenames(sources, output_dir=output_dir)
+        assert len(objects) == len(sources)
+
+        # Return an empty dict for the "which source files can be skipped"
+        # return value to preserve API compatibility.
+        return objects, {}
+
+    def _fix_object_args(self, objects, output_dir):
+        """Typecheck and fix up some arguments supplied to various methods.
+        Specifically: ensure that 'objects' is a list; if output_dir is
+        None, replace with self.output_dir.  Return fixed versions of
+        'objects' and 'output_dir'.
+        """
+        if not isinstance(objects, (list, tuple)):
+            raise TypeError("'objects' must be a list or tuple of strings")
+        objects = list(objects)
+
+        if output_dir is None:
+            output_dir = self.output_dir
+        elif not isinstance(output_dir, str):
+            raise TypeError("'output_dir' must be a string or None")
+
+        return (objects, output_dir)
+
+    def _fix_lib_args(self, libraries, library_dirs, runtime_library_dirs):
+        """Typecheck and fix up some of the arguments supplied to the
+        'link_*' methods.  Specifically: ensure that all arguments are
+        lists, and augment them with their permanent versions
+        (eg. 'self.libraries' augments 'libraries').  Return a tuple with
+        fixed versions of all arguments.
+        """
+        if libraries is None:
+            libraries = self.libraries
+        elif isinstance(libraries, (list, tuple)):
+            libraries = list (libraries) + (self.libraries or [])
+        else:
+            raise TypeError(
+                  "'libraries' (if supplied) must be a list of strings")
+
+        if library_dirs is None:
+            library_dirs = self.library_dirs
+        elif isinstance(library_dirs, (list, tuple)):
+            library_dirs = list (library_dirs) + (self.library_dirs or [])
+        else:
+            raise TypeError(
+                  "'library_dirs' (if supplied) must be a list of strings")
+
+        if runtime_library_dirs is None:
+            runtime_library_dirs = self.runtime_library_dirs
+        elif isinstance(runtime_library_dirs, (list, tuple)):
+            runtime_library_dirs = (list(runtime_library_dirs) +
+                                    (self.runtime_library_dirs or []))
+        else:
+            raise TypeError("'runtime_library_dirs' (if supplied) "
+                            "must be a list of strings")
+
+        return (libraries, library_dirs, runtime_library_dirs)
+
+    def _need_link(self, objects, output_file):
+        """Return true if we need to relink the files listed in 'objects'
+        to recreate 'output_file'.
+        """
+        if self.force:
+            return True
+        else:
+            if self.dry_run:
+                newer = newer_group (objects, output_file, missing='newer')
+            else:
+                newer = newer_group (objects, output_file)
+            return newer
+
+    def detect_language(self, sources):
+        """Detect the language of a given file, or list of files. Uses
+        language_map, and language_order to do the job.
+        """
+        if not isinstance(sources, list):
+            sources = [sources]
+        lang = None
+        index = len(self.language_order)
+        for source in sources:
+            base, ext = os.path.splitext(source)
+            extlang = self.language_map.get(ext)
+            try:
+                extindex = self.language_order.index(extlang)
+                if extindex < index:
+                    lang = extlang
+                    index = extindex
+            except ValueError:
+                pass
+        return lang
+
+
+    # -- Worker methods ------------------------------------------------
+    # (must be implemented by subclasses)
+
+    def preprocess(self, source, output_file=None, macros=None,
+                   include_dirs=None, extra_preargs=None, extra_postargs=None):
+        """Preprocess a single C/C++ source file, named in 'source'.
+        Output will be written to file named 'output_file', or stdout if
+        'output_file' not supplied.  'macros' is a list of macro
+        definitions as for 'compile()', which will augment the macros set
+        with 'define_macro()' and 'undefine_macro()'.  'include_dirs' is a
+        list of directory names that will be added to the default list.
+
+        Raises PreprocessError on failure.
+        """
+        pass
+
+    def compile(self, sources, output_dir=None, macros=None,
+                include_dirs=None, debug=0, extra_preargs=None,
+                extra_postargs=None, depends=None):
+        """Compile one or more source files.
+
+        'sources' must be a list of filenames, most likely C/C++
+        files, but in reality anything that can be handled by a
+        particular compiler and compiler class (eg. MSVCCompiler can
+        handle resource files in 'sources').  Return a list of object
+        filenames, one per source filename in 'sources'.  Depending on
+        the implementation, not all source files will necessarily be
+        compiled, but all corresponding object filenames will be
+        returned.
+
+        If 'output_dir' is given, object files will be put under it, while
+        retaining their original path component.  That is, "foo/bar.c"
+        normally compiles to "foo/bar.o" (for a Unix implementation); if
+        'output_dir' is "build", then it would compile to
+        "build/foo/bar.o".
+
+        'macros', if given, must be a list of macro definitions.  A macro
+        definition is either a (name, value) 2-tuple or a (name,) 1-tuple.
+        The former defines a macro; if the value is None, the macro is
+        defined without an explicit value.  The 1-tuple case undefines a
+        macro.  Later definitions/redefinitions/ undefinitions take
+        precedence.
+
+        'include_dirs', if given, must be a list of strings, the
+        directories to add to the default include file search path for this
+        compilation only.
+
+        'debug' is a boolean; if true, the compiler will be instructed to
+        output debug symbols in (or alongside) the object file(s).
+
+        'extra_preargs' and 'extra_postargs' are implementation- dependent.
+        On platforms that have the notion of a command-line (e.g. Unix,
+        DOS/Windows), they are most likely lists of strings: extra
+        command-line arguments to prepend/append to the compiler command
+        line.  On other platforms, consult the implementation class
+        documentation.  In any event, they are intended as an escape hatch
+        for those occasions when the abstract compiler framework doesn't
+        cut the mustard.
+
+        'depends', if given, is a list of filenames that all targets
+        depend on.  If a source file is older than any file in
+        depends, then the source file will be recompiled.  This
+        supports dependency tracking, but only at a coarse
+        granularity.
+
+        Raises CompileError on failure.
+        """
+        # A concrete compiler class can either override this method
+        # entirely or implement _compile().
+        macros, objects, extra_postargs, pp_opts, build = \
+                self._setup_compile(output_dir, macros, include_dirs, sources,
+                                    depends, extra_postargs)
+        cc_args = self._get_cc_args(pp_opts, debug, extra_preargs)
+
+        for obj in objects:
+            try:
+                src, ext = build[obj]
+            except KeyError:
+                continue
+            self._compile(obj, src, ext, cc_args, extra_postargs, pp_opts)
+
+        # Return *all* object filenames, not just the ones we just built.
+        return objects
+
+    def _compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
+        """Compile 'src' to product 'obj'."""
+        # A concrete compiler class that does not override compile()
+        # should implement _compile().
+        pass
+
+    def create_static_lib(self, objects, output_libname, output_dir=None,
+                          debug=0, target_lang=None):
+        """Link a bunch of stuff together to create a static library file.
+        The "bunch of stuff" consists of the list of object files supplied
+        as 'objects', the extra object files supplied to
+        'add_link_object()' and/or 'set_link_objects()', the libraries
+        supplied to 'add_library()' and/or 'set_libraries()', and the
+        libraries supplied as 'libraries' (if any).
+
+        'output_libname' should be a library name, not a filename; the
+        filename will be inferred from the library name.  'output_dir' is
+        the directory where the library file will be put.
+
+        'debug' is a boolean; if true, debugging information will be
+        included in the library (note that on most platforms, it is the
+        compile step where this matters: the 'debug' flag is included here
+        just for consistency).
+
+        'target_lang' is the target language for which the given objects
+        are being compiled. This allows specific linkage time treatment of
+        certain languages.
+
+        Raises LibError on failure.
+        """
+        pass
+
+
+    # values for target_desc parameter in link()
+    SHARED_OBJECT = "shared_object"
+    SHARED_LIBRARY = "shared_library"
+    EXECUTABLE = "executable"
+
+    def link(self,
+             target_desc,
+             objects,
+             output_filename,
+             output_dir=None,
+             libraries=None,
+             library_dirs=None,
+             runtime_library_dirs=None,
+             export_symbols=None,
+             debug=0,
+             extra_preargs=None,
+             extra_postargs=None,
+             build_temp=None,
+             target_lang=None):
+        """Link a bunch of stuff together to create an executable or
+        shared library file.
+
+        The "bunch of stuff" consists of the list of object files supplied
+        as 'objects'.  'output_filename' should be a filename.  If
+        'output_dir' is supplied, 'output_filename' is relative to it
+        (i.e. 'output_filename' can provide directory components if
+        needed).
+
+        'libraries' is a list of libraries to link against.  These are
+        library names, not filenames, since they're translated into
+        filenames in a platform-specific way (eg. "foo" becomes "libfoo.a"
+        on Unix and "foo.lib" on DOS/Windows).  However, they can include a
+        directory component, which means the linker will look in that
+        specific directory rather than searching all the normal locations.
+
+        'library_dirs', if supplied, should be a list of directories to
+        search for libraries that were specified as bare library names
+        (ie. no directory component).  These are on top of the system
+        default and those supplied to 'add_library_dir()' and/or
+        'set_library_dirs()'.  'runtime_library_dirs' is a list of
+        directories that will be embedded into the shared library and used
+        to search for other shared libraries that *it* depends on at
+        run-time.  (This may only be relevant on Unix.)
+
+        'export_symbols' is a list of symbols that the shared library will
+        export.  (This appears to be relevant only on Windows.)
+
+        'debug' is as for 'compile()' and 'create_static_lib()', with the
+        slight distinction that it actually matters on most platforms (as
+        opposed to 'create_static_lib()', which includes a 'debug' flag
+        mostly for form's sake).
+
+        'extra_preargs' and 'extra_postargs' are as for 'compile()' (except
+        of course that they supply command-line arguments for the
+        particular linker being used).
+
+        'target_lang' is the target language for which the given objects
+        are being compiled. This allows specific linkage time treatment of
+        certain languages.
+
+        Raises LinkError on failure.
+        """
+        raise NotImplementedError
+
+
+    # Old 'link_*()' methods, rewritten to use the new 'link()' method.
+
+    def link_shared_lib(self,
+                        objects,
+                        output_libname,
+                        output_dir=None,
+                        libraries=None,
+                        library_dirs=None,
+                        runtime_library_dirs=None,
+                        export_symbols=None,
+                        debug=0,
+                        extra_preargs=None,
+                        extra_postargs=None,
+                        build_temp=None,
+                        target_lang=None):
+        self.link(CCompiler.SHARED_LIBRARY, objects,
+                  self.library_filename(output_libname, lib_type='shared'),
+                  output_dir,
+                  libraries, library_dirs, runtime_library_dirs,
+                  export_symbols, debug,
+                  extra_preargs, extra_postargs, build_temp, target_lang)
+
+
+    def link_shared_object(self,
+                           objects,
+                           output_filename,
+                           output_dir=None,
+                           libraries=None,
+                           library_dirs=None,
+                           runtime_library_dirs=None,
+                           export_symbols=None,
+                           debug=0,
+                           extra_preargs=None,
+                           extra_postargs=None,
+                           build_temp=None,
+                           target_lang=None):
+        self.link(CCompiler.SHARED_OBJECT, objects,
+                  output_filename, output_dir,
+                  libraries, library_dirs, runtime_library_dirs,
+                  export_symbols, debug,
+                  extra_preargs, extra_postargs, build_temp, target_lang)
+
+
+    def link_executable(self,
+                        objects,
+                        output_progname,
+                        output_dir=None,
+                        libraries=None,
+                        library_dirs=None,
+                        runtime_library_dirs=None,
+                        debug=0,
+                        extra_preargs=None,
+                        extra_postargs=None,
+                        target_lang=None):
+        self.link(CCompiler.EXECUTABLE, objects,
+                  self.executable_filename(output_progname), output_dir,
+                  libraries, library_dirs, runtime_library_dirs, None,
+                  debug, extra_preargs, extra_postargs, None, target_lang)
+
+
+    # -- Miscellaneous methods -----------------------------------------
+    # These are all used by the 'gen_lib_options() function; there is
+    # no appropriate default implementation so subclasses should
+    # implement all of these.
+
+    def library_dir_option(self, dir):
+        """Return the compiler option to add 'dir' to the list of
+        directories searched for libraries.
+        """
+        raise NotImplementedError
+
+    def runtime_library_dir_option(self, dir):
+        """Return the compiler option to add 'dir' to the list of
+        directories searched for runtime libraries.
+        """
+        raise NotImplementedError
+
+    def library_option(self, lib):
+        """Return the compiler option to add 'lib' to the list of libraries
+        linked into the shared library or executable.
+        """
+        raise NotImplementedError
+
+    def has_function(self, funcname, includes=None, include_dirs=None,
+                     libraries=None, library_dirs=None):
+        """Return a boolean indicating whether funcname is supported on
+        the current platform.  The optional arguments can be used to
+        augment the compilation environment.
+        """
+        # this can't be included at module scope because it tries to
+        # import math which might not be available at that point - maybe
+        # the necessary logic should just be inlined?
+        import tempfile
+        if includes is None:
+            includes = []
+        if include_dirs is None:
+            include_dirs = []
+        if libraries is None:
+            libraries = []
+        if library_dirs is None:
+            library_dirs = []
+        fd, fname = tempfile.mkstemp(".c", funcname, text=True)
+        f = os.fdopen(fd, "w")
+        try:
+            for incl in includes:
+                f.write("""#include "%s"\n""" % incl)
+            f.write("""\
+int main (int argc, char **argv) {
+    %s();
+    return 0;
+}
+""" % funcname)
+        finally:
+            f.close()
+        try:
+            objects = self.compile([fname], include_dirs=include_dirs)
+        except CompileError:
+            return False
+
+        try:
+            self.link_executable(objects, "a.out",
+                                 libraries=libraries,
+                                 library_dirs=library_dirs)
+        except (LinkError, TypeError):
+            return False
+        return True
+
+    def find_library_file (self, dirs, lib, debug=0):
+        """Search the specified list of directories for a static or shared
+        library file 'lib' and return the full path to that file.  If
+        'debug' true, look for a debugging version (if that makes sense on
+        the current platform).  Return None if 'lib' wasn't found in any of
+        the specified directories.
+        """
+        raise NotImplementedError
+
+    # -- Filename generation methods -----------------------------------
+
+    # The default implementation of the filename generating methods are
+    # prejudiced towards the Unix/DOS/Windows view of the world:
+    #   * object files are named by replacing the source file extension
+    #     (eg. .c/.cpp -> .o/.obj)
+    #   * library files (shared or static) are named by plugging the
+    #     library name and extension into a format string, eg.
+    #     "lib%s.%s" % (lib_name, ".a") for Unix static libraries
+    #   * executables are named by appending an extension (possibly
+    #     empty) to the program name: eg. progname + ".exe" for
+    #     Windows
+    #
+    # To reduce redundant code, these methods expect to find
+    # several attributes in the current object (presumably defined
+    # as class attributes):
+    #   * src_extensions -
+    #     list of C/C++ source file extensions, eg. ['.c', '.cpp']
+    #   * obj_extension -
+    #     object file extension, eg. '.o' or '.obj'
+    #   * static_lib_extension -
+    #     extension for static library files, eg. '.a' or '.lib'
+    #   * shared_lib_extension -
+    #     extension for shared library/object files, eg. '.so', '.dll'
+    #   * static_lib_format -
+    #     format string for generating static library filenames,
+    #     eg. 'lib%s.%s' or '%s.%s'
+    #   * shared_lib_format
+    #     format string for generating shared library filenames
+    #     (probably same as static_lib_format, since the extension
+    #     is one of the intended parameters to the format string)
+    #   * exe_extension -
+    #     extension for executable files, eg. '' or '.exe'
+
+    def object_filenames(self, source_filenames, strip_dir=0, output_dir=''):
+        if output_dir is None:
+            output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            base, ext = os.path.splitext(src_name)
+            base = os.path.splitdrive(base)[1] # Chop off the drive
+            base = base[os.path.isabs(base):]  # If abs, chop off leading /
+            if ext not in self.src_extensions:
+                raise UnknownFileError(
+                      "unknown file type '%s' (from '%s')" % (ext, src_name))
+            if strip_dir:
+                base = os.path.basename(base)
+            obj_names.append(os.path.join(output_dir,
+                                          base + self.obj_extension))
+        return obj_names
+
+    def shared_object_filename(self, basename, strip_dir=0, output_dir=''):
+        assert output_dir is not None
+        if strip_dir:
+            basename = os.path.basename(basename)
+        return os.path.join(output_dir, basename + self.shared_lib_extension)
+
+    def executable_filename(self, basename, strip_dir=0, output_dir=''):
+        assert output_dir is not None
+        if strip_dir:
+            basename = os.path.basename(basename)
+        return os.path.join(output_dir, basename + (self.exe_extension or ''))
+
+    def library_filename(self, libname, lib_type='static',     # or 'shared'
+                         strip_dir=0, output_dir=''):
+        assert output_dir is not None
+        if lib_type not in ("static", "shared", "dylib", "xcode_stub"):
+            raise ValueError(
+                  "'lib_type' must be \"static\", \"shared\", \"dylib\", or \"xcode_stub\"")
+        fmt = getattr(self, lib_type + "_lib_format")
+        ext = getattr(self, lib_type + "_lib_extension")
+
+        dir, base = os.path.split(libname)
+        filename = fmt % (base, ext)
+        if strip_dir:
+            dir = ''
+
+        return os.path.join(output_dir, dir, filename)
+
+
+    # -- Utility methods -----------------------------------------------
+
+    def announce(self, msg, level=1):
+        log.debug(msg)
+
+    def debug_print(self, msg):
+        from distutils.debug import DEBUG
+        if DEBUG:
+            print(msg)
+
+    def warn(self, msg):
+        sys.stderr.write("warning: %s\n" % msg)
+
+    def execute(self, func, args, msg=None, level=1):
+        execute(func, args, msg, self.dry_run)
+
+    def spawn(self, cmd, **kwargs):
+        spawn(cmd, dry_run=self.dry_run, **kwargs)
+
+    def move_file(self, src, dst):
+        return move_file(src, dst, dry_run=self.dry_run)
+
+    def mkpath (self, name, mode=0o777):
+        mkpath(name, mode, dry_run=self.dry_run)
+
+
+# Map a sys.platform/os.name ('posix', 'nt') to the default compiler
+# type for that platform. Keys are interpreted as re match
+# patterns. Order is important; platform mappings are preferred over
+# OS names.
+_default_compilers = (
+
+    # Platform string mappings
+
+    # on a cygwin built python we can use gcc like an ordinary UNIXish
+    # compiler
+    ('cygwin.*', 'unix'),
+
+    # OS name mappings
+    ('posix', 'unix'),
+    ('nt', 'msvc'),
+
+    )
+
+def get_default_compiler(osname=None, platform=None):
+    """Determine the default compiler to use for the given platform.
+
+       osname should be one of the standard Python OS names (i.e. the
+       ones returned by os.name) and platform the common value
+       returned by sys.platform for the platform in question.
+
+       The default values are os.name and sys.platform in case the
+       parameters are not given.
+    """
+    if osname is None:
+        osname = os.name
+    if platform is None:
+        platform = sys.platform
+    for pattern, compiler in _default_compilers:
+        if re.match(pattern, platform) is not None or \
+           re.match(pattern, osname) is not None:
+            return compiler
+    # Default to Unix compiler
+    return 'unix'
+
+# Map compiler types to (module_name, class_name) pairs -- ie. where to
+# find the code that implements an interface to this compiler.  (The module
+# is assumed to be in the 'distutils' package.)
+compiler_class = { 'unix':    ('unixccompiler', 'UnixCCompiler',
+                               "standard UNIX-style compiler"),
+                   'msvc':    ('_msvccompiler', 'MSVCCompiler',
+                               "Microsoft Visual C++"),
+                   'cygwin':  ('cygwinccompiler', 'CygwinCCompiler',
+                               "Cygwin port of GNU C Compiler for Win32"),
+                   'mingw32': ('cygwinccompiler', 'Mingw32CCompiler',
+                               "Mingw32 port of GNU C Compiler for Win32"),
+                   'bcpp':    ('bcppcompiler', 'BCPPCompiler',
+                               "Borland C++ Compiler"),
+                 }
+
+def show_compilers():
+    """Print list of available compilers (used by the "--help-compiler"
+    options to "build", "build_ext", "build_clib").
+    """
+    # XXX this "knows" that the compiler option it's describing is
+    # "--compiler", which just happens to be the case for the three
+    # commands that use it.
+    from distutils.fancy_getopt import FancyGetopt
+    compilers = []
+    for compiler in compiler_class.keys():
+        compilers.append(("compiler="+compiler, None,
+                          compiler_class[compiler][2]))
+    compilers.sort()
+    pretty_printer = FancyGetopt(compilers)
+    pretty_printer.print_help("List of available compilers:")
+
+
+def new_compiler(plat=None, compiler=None, verbose=0, dry_run=0, force=0):
+    """Generate an instance of some CCompiler subclass for the supplied
+    platform/compiler combination.  'plat' defaults to 'os.name'
+    (eg. 'posix', 'nt'), and 'compiler' defaults to the default compiler
+    for that platform.  Currently only 'posix' and 'nt' are supported, and
+    the default compilers are "traditional Unix interface" (UnixCCompiler
+    class) and Visual C++ (MSVCCompiler class).  Note that it's perfectly
+    possible to ask for a Unix compiler object under Windows, and a
+    Microsoft compiler object under Unix -- if you supply a value for
+    'compiler', 'plat' is ignored.
+    """
+    if plat is None:
+        plat = os.name
+
+    try:
+        if compiler is None:
+            compiler = get_default_compiler(plat)
+
+        (module_name, class_name, long_description) = compiler_class[compiler]
+    except KeyError:
+        msg = "don't know how to compile C/C++ code on platform '%s'" % plat
+        if compiler is not None:
+            msg = msg + " with '%s' compiler" % compiler
+        raise DistutilsPlatformError(msg)
+
+    try:
+        module_name = "distutils." + module_name
+        __import__ (module_name)
+        module = sys.modules[module_name]
+        klass = vars(module)[class_name]
+    except ImportError:
+        raise DistutilsModuleError(
+              "can't compile C/C++ code: unable to load module '%s'" % \
+              module_name)
+    except KeyError:
+        raise DistutilsModuleError(
+               "can't compile C/C++ code: unable to find class '%s' "
+               "in module '%s'" % (class_name, module_name))
+
+    # XXX The None is necessary to preserve backwards compatibility
+    # with classes that expect verbose to be the first positional
+    # argument.
+    return klass(None, dry_run, force)
+
+
+def gen_preprocess_options(macros, include_dirs):
+    """Generate C pre-processor options (-D, -U, -I) as used by at least
+    two types of compilers: the typical Unix compiler and Visual C++.
+    'macros' is the usual thing, a list of 1- or 2-tuples, where (name,)
+    means undefine (-U) macro 'name', and (name,value) means define (-D)
+    macro 'name' to 'value'.  'include_dirs' is just a list of directory
+    names to be added to the header file search path (-I).  Returns a list
+    of command-line options suitable for either Unix compilers or Visual
+    C++.
+    """
+    # XXX it would be nice (mainly aesthetic, and so we don't generate
+    # stupid-looking command lines) to go over 'macros' and eliminate
+    # redundant definitions/undefinitions (ie. ensure that only the
+    # latest mention of a particular macro winds up on the command
+    # line).  I don't think it's essential, though, since most (all?)
+    # Unix C compilers only pay attention to the latest -D or -U
+    # mention of a macro on their command line.  Similar situation for
+    # 'include_dirs'.  I'm punting on both for now.  Anyways, weeding out
+    # redundancies like this should probably be the province of
+    # CCompiler, since the data structures used are inherited from it
+    # and therefore common to all CCompiler classes.
+    pp_opts = []
+    for macro in macros:
+        if not (isinstance(macro, tuple) and 1 <= len(macro) <= 2):
+            raise TypeError(
+                  "bad macro definition '%s': "
+                  "each element of 'macros' list must be a 1- or 2-tuple"
+                  % macro)
+
+        if len(macro) == 1:        # undefine this macro
+            pp_opts.append("-U%s" % macro[0])
+        elif len(macro) == 2:
+            if macro[1] is None:    # define with no explicit value
+                pp_opts.append("-D%s" % macro[0])
+            else:
+                # XXX *don't* need to be clever about quoting the
+                # macro value here, because we're going to avoid the
+                # shell at all costs when we spawn the command!
+                pp_opts.append("-D%s=%s" % macro)
+
+    for dir in include_dirs:
+        pp_opts.append("-I%s" % dir)
+    return pp_opts
+
+
+def gen_lib_options (compiler, library_dirs, runtime_library_dirs, libraries):
+    """Generate linker options for searching library directories and
+    linking with specific libraries.  'libraries' and 'library_dirs' are,
+    respectively, lists of library names (not filenames!) and search
+    directories.  Returns a list of command-line options suitable for use
+    with some compiler (depending on the two format strings passed in).
+    """
+    lib_opts = []
+
+    for dir in library_dirs:
+        lib_opts.append(compiler.library_dir_option(dir))
+
+    for dir in runtime_library_dirs:
+        opt = compiler.runtime_library_dir_option(dir)
+        if isinstance(opt, list):
+            lib_opts = lib_opts + opt
+        else:
+            lib_opts.append(opt)
+
+    # XXX it's important that we *not* remove redundant library mentions!
+    # sometimes you really do have to say "-lfoo -lbar -lfoo" in order to
+    # resolve all symbols.  I just hope we never have to say "-lfoo obj.o
+    # -lbar" to get things to work -- that's certainly a possibility, but a
+    # pretty nasty way to arrange your C code.
+
+    for lib in libraries:
+        (lib_dir, lib_name) = os.path.split(lib)
+        if lib_dir:
+            lib_file = compiler.find_library_file([lib_dir], lib_name)
+            if lib_file:
+                lib_opts.append(lib_file)
+            else:
+                compiler.warn("no library file corresponding to "
+                              "'%s' found (skipping)" % lib)
+        else:
+            lib_opts.append(compiler.library_option (lib))
+    return lib_opts
diff --git a/venv/Lib/site-packages/setuptools/_distutils/cmd.py b/venv/Lib/site-packages/setuptools/_distutils/cmd.py
new file mode 100644
index 000000000..dba3191e5
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/cmd.py
@@ -0,0 +1,403 @@
+"""distutils.cmd
+
+Provides the Command class, the base class for the command classes
+in the distutils.command package.
+"""
+
+import sys, os, re
+from distutils.errors import DistutilsOptionError
+from distutils import util, dir_util, file_util, archive_util, dep_util
+from distutils import log
+
+class Command:
+    """Abstract base class for defining command classes, the "worker bees"
+    of the Distutils.  A useful analogy for command classes is to think of
+    them as subroutines with local variables called "options".  The options
+    are "declared" in 'initialize_options()' and "defined" (given their
+    final values, aka "finalized") in 'finalize_options()', both of which
+    must be defined by every command class.  The distinction between the
+    two is necessary because option values might come from the outside
+    world (command line, config file, ...), and any options dependent on
+    other options must be computed *after* these outside influences have
+    been processed -- hence 'finalize_options()'.  The "body" of the
+    subroutine, where it does all its work based on the values of its
+    options, is the 'run()' method, which must also be implemented by every
+    command class.
+    """
+
+    # 'sub_commands' formalizes the notion of a "family" of commands,
+    # eg. "install" as the parent with sub-commands "install_lib",
+    # "install_headers", etc.  The parent of a family of commands
+    # defines 'sub_commands' as a class attribute; it's a list of
+    #    (command_name : string, predicate : unbound_method | string | None)
+    # tuples, where 'predicate' is a method of the parent command that
+    # determines whether the corresponding command is applicable in the
+    # current situation.  (Eg. we "install_headers" is only applicable if
+    # we have any C header files to install.)  If 'predicate' is None,
+    # that command is always applicable.
+    #
+    # 'sub_commands' is usually defined at the *end* of a class, because
+    # predicates can be unbound methods, so they must already have been
+    # defined.  The canonical example is the "install" command.
+    sub_commands = []
+
+
+    # -- Creation/initialization methods -------------------------------
+
+    def __init__(self, dist):
+        """Create and initialize a new Command object.  Most importantly,
+        invokes the 'initialize_options()' method, which is the real
+        initializer and depends on the actual command being
+        instantiated.
+        """
+        # late import because of mutual dependence between these classes
+        from distutils.dist import Distribution
+
+        if not isinstance(dist, Distribution):
+            raise TypeError("dist must be a Distribution instance")
+        if self.__class__ is Command:
+            raise RuntimeError("Command is an abstract class")
+
+        self.distribution = dist
+        self.initialize_options()
+
+        # Per-command versions of the global flags, so that the user can
+        # customize Distutils' behaviour command-by-command and let some
+        # commands fall back on the Distribution's behaviour.  None means
+        # "not defined, check self.distribution's copy", while 0 or 1 mean
+        # false and true (duh).  Note that this means figuring out the real
+        # value of each flag is a touch complicated -- hence "self._dry_run"
+        # will be handled by __getattr__, below.
+        # XXX This needs to be fixed.
+        self._dry_run = None
+
+        # verbose is largely ignored, but needs to be set for
+        # backwards compatibility (I think)?
+        self.verbose = dist.verbose
+
+        # Some commands define a 'self.force' option to ignore file
+        # timestamps, but methods defined *here* assume that
+        # 'self.force' exists for all commands.  So define it here
+        # just to be safe.
+        self.force = None
+
+        # The 'help' flag is just used for command-line parsing, so
+        # none of that complicated bureaucracy is needed.
+        self.help = 0
+
+        # 'finalized' records whether or not 'finalize_options()' has been
+        # called.  'finalize_options()' itself should not pay attention to
+        # this flag: it is the business of 'ensure_finalized()', which
+        # always calls 'finalize_options()', to respect/update it.
+        self.finalized = 0
+
+    # XXX A more explicit way to customize dry_run would be better.
+    def __getattr__(self, attr):
+        if attr == 'dry_run':
+            myval = getattr(self, "_" + attr)
+            if myval is None:
+                return getattr(self.distribution, attr)
+            else:
+                return myval
+        else:
+            raise AttributeError(attr)
+
+    def ensure_finalized(self):
+        if not self.finalized:
+            self.finalize_options()
+        self.finalized = 1
+
+    # Subclasses must define:
+    #   initialize_options()
+    #     provide default values for all options; may be customized by
+    #     setup script, by options from config file(s), or by command-line
+    #     options
+    #   finalize_options()
+    #     decide on the final values for all options; this is called
+    #     after all possible intervention from the outside world
+    #     (command-line, option file, etc.) has been processed
+    #   run()
+    #     run the command: do whatever it is we're here to do,
+    #     controlled by the command's various option values
+
+    def initialize_options(self):
+        """Set default values for all the options that this command
+        supports.  Note that these defaults may be overridden by other
+        commands, by the setup script, by config files, or by the
+        command-line.  Thus, this is not the place to code dependencies
+        between options; generally, 'initialize_options()' implementations
+        are just a bunch of "self.foo = None" assignments.
+
+        This method must be implemented by all command classes.
+        """
+        raise RuntimeError("abstract method -- subclass %s must override"
+                           % self.__class__)
+
+    def finalize_options(self):
+        """Set final values for all the options that this command supports.
+        This is always called as late as possible, ie.  after any option
+        assignments from the command-line or from other commands have been
+        done.  Thus, this is the place to code option dependencies: if
+        'foo' depends on 'bar', then it is safe to set 'foo' from 'bar' as
+        long as 'foo' still has the same value it was assigned in
+        'initialize_options()'.
+
+        This method must be implemented by all command classes.
+        """
+        raise RuntimeError("abstract method -- subclass %s must override"
+                           % self.__class__)
+
+
+    def dump_options(self, header=None, indent=""):
+        from distutils.fancy_getopt import longopt_xlate
+        if header is None:
+            header = "command options for '%s':" % self.get_command_name()
+        self.announce(indent + header, level=log.INFO)
+        indent = indent + "  "
+        for (option, _, _) in self.user_options:
+            option = option.translate(longopt_xlate)
+            if option[-1] == "=":
+                option = option[:-1]
+            value = getattr(self, option)
+            self.announce(indent + "%s = %s" % (option, value),
+                          level=log.INFO)
+
+    def run(self):
+        """A command's raison d'etre: carry out the action it exists to
+        perform, controlled by the options initialized in
+        'initialize_options()', customized by other commands, the setup
+        script, the command-line, and config files, and finalized in
+        'finalize_options()'.  All terminal output and filesystem
+        interaction should be done by 'run()'.
+
+        This method must be implemented by all command classes.
+        """
+        raise RuntimeError("abstract method -- subclass %s must override"
+                           % self.__class__)
+
+    def announce(self, msg, level=1):
+        """If the current verbosity level is of greater than or equal to
+        'level' print 'msg' to stdout.
+        """
+        log.log(level, msg)
+
+    def debug_print(self, msg):
+        """Print 'msg' to stdout if the global DEBUG (taken from the
+        DISTUTILS_DEBUG environment variable) flag is true.
+        """
+        from distutils.debug import DEBUG
+        if DEBUG:
+            print(msg)
+            sys.stdout.flush()
+
+
+    # -- Option validation methods -------------------------------------
+    # (these are very handy in writing the 'finalize_options()' method)
+    #
+    # NB. the general philosophy here is to ensure that a particular option
+    # value meets certain type and value constraints.  If not, we try to
+    # force it into conformance (eg. if we expect a list but have a string,
+    # split the string on comma and/or whitespace).  If we can't force the
+    # option into conformance, raise DistutilsOptionError.  Thus, command
+    # classes need do nothing more than (eg.)
+    #   self.ensure_string_list('foo')
+    # and they can be guaranteed that thereafter, self.foo will be
+    # a list of strings.
+
+    def _ensure_stringlike(self, option, what, default=None):
+        val = getattr(self, option)
+        if val is None:
+            setattr(self, option, default)
+            return default
+        elif not isinstance(val, str):
+            raise DistutilsOptionError("'%s' must be a %s (got `%s`)"
+                                       % (option, what, val))
+        return val
+
+    def ensure_string(self, option, default=None):
+        """Ensure that 'option' is a string; if not defined, set it to
+        'default'.
+        """
+        self._ensure_stringlike(option, "string", default)
+
+    def ensure_string_list(self, option):
+        r"""Ensure that 'option' is a list of strings.  If 'option' is
+        currently a string, we split it either on /,\s*/ or /\s+/, so
+        "foo bar baz", "foo,bar,baz", and "foo,   bar baz" all become
+        ["foo", "bar", "baz"].
+        """
+        val = getattr(self, option)
+        if val is None:
+            return
+        elif isinstance(val, str):
+            setattr(self, option, re.split(r',\s*|\s+', val))
+        else:
+            if isinstance(val, list):
+                ok = all(isinstance(v, str) for v in val)
+            else:
+                ok = False
+            if not ok:
+                raise DistutilsOptionError(
+                      "'%s' must be a list of strings (got %r)"
+                      % (option, val))
+
+    def _ensure_tested_string(self, option, tester, what, error_fmt,
+                              default=None):
+        val = self._ensure_stringlike(option, what, default)
+        if val is not None and not tester(val):
+            raise DistutilsOptionError(("error in '%s' option: " + error_fmt)
+                                       % (option, val))
+
+    def ensure_filename(self, option):
+        """Ensure that 'option' is the name of an existing file."""
+        self._ensure_tested_string(option, os.path.isfile,
+                                   "filename",
+                                   "'%s' does not exist or is not a file")
+
+    def ensure_dirname(self, option):
+        self._ensure_tested_string(option, os.path.isdir,
+                                   "directory name",
+                                   "'%s' does not exist or is not a directory")
+
+
+    # -- Convenience methods for commands ------------------------------
+
+    def get_command_name(self):
+        if hasattr(self, 'command_name'):
+            return self.command_name
+        else:
+            return self.__class__.__name__
+
+    def set_undefined_options(self, src_cmd, *option_pairs):
+        """Set the values of any "undefined" options from corresponding
+        option values in some other command object.  "Undefined" here means
+        "is None", which is the convention used to indicate that an option
+        has not been changed between 'initialize_options()' and
+        'finalize_options()'.  Usually called from 'finalize_options()' for
+        options that depend on some other command rather than another
+        option of the same command.  'src_cmd' is the other command from
+        which option values will be taken (a command object will be created
+        for it if necessary); the remaining arguments are
+        '(src_option,dst_option)' tuples which mean "take the value of
+        'src_option' in the 'src_cmd' command object, and copy it to
+        'dst_option' in the current command object".
+        """
+        # Option_pairs: list of (src_option, dst_option) tuples
+        src_cmd_obj = self.distribution.get_command_obj(src_cmd)
+        src_cmd_obj.ensure_finalized()
+        for (src_option, dst_option) in option_pairs:
+            if getattr(self, dst_option) is None:
+                setattr(self, dst_option, getattr(src_cmd_obj, src_option))
+
+    def get_finalized_command(self, command, create=1):
+        """Wrapper around Distribution's 'get_command_obj()' method: find
+        (create if necessary and 'create' is true) the command object for
+        'command', call its 'ensure_finalized()' method, and return the
+        finalized command object.
+        """
+        cmd_obj = self.distribution.get_command_obj(command, create)
+        cmd_obj.ensure_finalized()
+        return cmd_obj
+
+    # XXX rename to 'get_reinitialized_command()'? (should do the
+    # same in dist.py, if so)
+    def reinitialize_command(self, command, reinit_subcommands=0):
+        return self.distribution.reinitialize_command(command,
+                                                      reinit_subcommands)
+
+    def run_command(self, command):
+        """Run some other command: uses the 'run_command()' method of
+        Distribution, which creates and finalizes the command object if
+        necessary and then invokes its 'run()' method.
+        """
+        self.distribution.run_command(command)
+
+    def get_sub_commands(self):
+        """Determine the sub-commands that are relevant in the current
+        distribution (ie., that need to be run).  This is based on the
+        'sub_commands' class attribute: each tuple in that list may include
+        a method that we call to determine if the subcommand needs to be
+        run for the current distribution.  Return a list of command names.
+        """
+        commands = []
+        for (cmd_name, method) in self.sub_commands:
+            if method is None or method(self):
+                commands.append(cmd_name)
+        return commands
+
+
+    # -- External world manipulation -----------------------------------
+
+    def warn(self, msg):
+        log.warn("warning: %s: %s\n", self.get_command_name(), msg)
+
+    def execute(self, func, args, msg=None, level=1):
+        util.execute(func, args, msg, dry_run=self.dry_run)
+
+    def mkpath(self, name, mode=0o777):
+        dir_util.mkpath(name, mode, dry_run=self.dry_run)
+
+    def copy_file(self, infile, outfile, preserve_mode=1, preserve_times=1,
+                  link=None, level=1):
+        """Copy a file respecting verbose, dry-run and force flags.  (The
+        former two default to whatever is in the Distribution object, and
+        the latter defaults to false for commands that don't define it.)"""
+        return file_util.copy_file(infile, outfile, preserve_mode,
+                                   preserve_times, not self.force, link,
+                                   dry_run=self.dry_run)
+
+    def copy_tree(self, infile, outfile, preserve_mode=1, preserve_times=1,
+                   preserve_symlinks=0, level=1):
+        """Copy an entire directory tree respecting verbose, dry-run,
+        and force flags.
+        """
+        return dir_util.copy_tree(infile, outfile, preserve_mode,
+                                  preserve_times, preserve_symlinks,
+                                  not self.force, dry_run=self.dry_run)
+
+    def move_file (self, src, dst, level=1):
+        """Move a file respecting dry-run flag."""
+        return file_util.move_file(src, dst, dry_run=self.dry_run)
+
+    def spawn(self, cmd, search_path=1, level=1):
+        """Spawn an external command respecting dry-run flag."""
+        from distutils.spawn import spawn
+        spawn(cmd, search_path, dry_run=self.dry_run)
+
+    def make_archive(self, base_name, format, root_dir=None, base_dir=None,
+                     owner=None, group=None):
+        return archive_util.make_archive(base_name, format, root_dir, base_dir,
+                                         dry_run=self.dry_run,
+                                         owner=owner, group=group)
+
+    def make_file(self, infiles, outfile, func, args,
+                  exec_msg=None, skip_msg=None, level=1):
+        """Special case of 'execute()' for operations that process one or
+        more input files and generate one output file.  Works just like
+        'execute()', except the operation is skipped and a different
+        message printed if 'outfile' already exists and is newer than all
+        files listed in 'infiles'.  If the command defined 'self.force',
+        and it is true, then the command is unconditionally run -- does no
+        timestamp checks.
+        """
+        if skip_msg is None:
+            skip_msg = "skipping %s (inputs unchanged)" % outfile
+
+        # Allow 'infiles' to be a single string
+        if isinstance(infiles, str):
+            infiles = (infiles,)
+        elif not isinstance(infiles, (list, tuple)):
+            raise TypeError(
+                  "'infiles' must be a string, or a list or tuple of strings")
+
+        if exec_msg is None:
+            exec_msg = "generating %s from %s" % (outfile, ', '.join(infiles))
+
+        # If 'outfile' must be regenerated (either because it doesn't
+        # exist, is out-of-date, or the 'force' flag is true) then
+        # perform the action that presumably regenerates it
+        if self.force or dep_util.newer_group(infiles, outfile):
+            self.execute(func, args, exec_msg, level)
+        # Otherwise, print the "skip" message
+        else:
+            log.debug(skip_msg)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__init__.py b/venv/Lib/site-packages/setuptools/_distutils/command/__init__.py
new file mode 100644
index 000000000..481eea9fd
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/__init__.py
@@ -0,0 +1,31 @@
+"""distutils.command
+
+Package containing implementation of all the standard Distutils
+commands."""
+
+__all__ = ['build',
+           'build_py',
+           'build_ext',
+           'build_clib',
+           'build_scripts',
+           'clean',
+           'install',
+           'install_lib',
+           'install_headers',
+           'install_scripts',
+           'install_data',
+           'sdist',
+           'register',
+           'bdist',
+           'bdist_dumb',
+           'bdist_rpm',
+           'bdist_wininst',
+           'check',
+           'upload',
+           # These two are reserved for future use:
+           #'bdist_sdux',
+           #'bdist_pkgtool',
+           # Note:
+           # bdist_packager is not included because it only provides
+           # an abstract base class
+          ]
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..662bb0480
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist.cpython-36.pyc
new file mode 100644
index 000000000..cfaecd06f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_dumb.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_dumb.cpython-36.pyc
new file mode 100644
index 000000000..9dd7f81dd
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_dumb.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_msi.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_msi.cpython-36.pyc
new file mode 100644
index 000000000..26cfcb5a0
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_msi.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_rpm.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_rpm.cpython-36.pyc
new file mode 100644
index 000000000..8a0c35f2a
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_rpm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_wininst.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_wininst.cpython-36.pyc
new file mode 100644
index 000000000..f71c5619d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/bdist_wininst.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build.cpython-36.pyc
new file mode 100644
index 000000000..5130349fc
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_clib.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_clib.cpython-36.pyc
new file mode 100644
index 000000000..b18314b70
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_clib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_ext.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_ext.cpython-36.pyc
new file mode 100644
index 000000000..5f136ebbf
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_ext.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_py.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_py.cpython-36.pyc
new file mode 100644
index 000000000..e91094d1e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_py.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_scripts.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_scripts.cpython-36.pyc
new file mode 100644
index 000000000..46ce9591b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/build_scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/check.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/check.cpython-36.pyc
new file mode 100644
index 000000000..138fe0787
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/check.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/clean.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/clean.cpython-36.pyc
new file mode 100644
index 000000000..f7599a4ce
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/clean.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/config.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/config.cpython-36.pyc
new file mode 100644
index 000000000..991660fe1
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/config.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install.cpython-36.pyc
new file mode 100644
index 000000000..d66c6c853
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_data.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_data.cpython-36.pyc
new file mode 100644
index 000000000..c35bb984d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_data.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_egg_info.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_egg_info.cpython-36.pyc
new file mode 100644
index 000000000..cb528546d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_egg_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_headers.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_headers.cpython-36.pyc
new file mode 100644
index 000000000..0335e9b53
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_headers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_lib.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_lib.cpython-36.pyc
new file mode 100644
index 000000000..a6983b5bc
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_lib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_scripts.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_scripts.cpython-36.pyc
new file mode 100644
index 000000000..89a9e48e9
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/install_scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/py37compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/py37compat.cpython-36.pyc
new file mode 100644
index 000000000..4c6d57146
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/py37compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/register.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/register.cpython-36.pyc
new file mode 100644
index 000000000..ae63c3d11
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/register.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/sdist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/sdist.cpython-36.pyc
new file mode 100644
index 000000000..2685c3e93
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/sdist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/upload.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/upload.cpython-36.pyc
new file mode 100644
index 000000000..c6696dd8b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_distutils/command/__pycache__/upload.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/bdist.py b/venv/Lib/site-packages/setuptools/_distutils/command/bdist.py
new file mode 100644
index 000000000..014871d28
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/bdist.py
@@ -0,0 +1,143 @@
+"""distutils.command.bdist
+
+Implements the Distutils 'bdist' command (create a built [binary]
+distribution)."""
+
+import os
+from distutils.core import Command
+from distutils.errors import *
+from distutils.util import get_platform
+
+
+def show_formats():
+    """Print list of available formats (arguments to "--format" option).
+    """
+    from distutils.fancy_getopt import FancyGetopt
+    formats = []
+    for format in bdist.format_commands:
+        formats.append(("formats=" + format, None,
+                        bdist.format_command[format][1]))
+    pretty_printer = FancyGetopt(formats)
+    pretty_printer.print_help("List of available distribution formats:")
+
+
+class bdist(Command):
+
+    description = "create a built (binary) distribution"
+
+    user_options = [('bdist-base=', 'b',
+                     "temporary directory for creating built distributions"),
+                    ('plat-name=', 'p',
+                     "platform name to embed in generated filenames "
+                     "(default: %s)" % get_platform()),
+                    ('formats=', None,
+                     "formats for distribution (comma-separated list)"),
+                    ('dist-dir=', 'd',
+                     "directory to put final built distributions in "
+                     "[default: dist]"),
+                    ('skip-build', None,
+                     "skip rebuilding everything (for testing/debugging)"),
+                    ('owner=', 'u',
+                     "Owner name used when creating a tar file"
+                     " [default: current user]"),
+                    ('group=', 'g',
+                     "Group name used when creating a tar file"
+                     " [default: current group]"),
+                   ]
+
+    boolean_options = ['skip-build']
+
+    help_options = [
+        ('help-formats', None,
+         "lists available distribution formats", show_formats),
+        ]
+
+    # The following commands do not take a format option from bdist
+    no_format_option = ('bdist_rpm',)
+
+    # This won't do in reality: will need to distinguish RPM-ish Linux,
+    # Debian-ish Linux, Solaris, FreeBSD, ..., Windows, Mac OS.
+    default_format = {'posix': 'gztar',
+                      'nt': 'zip'}
+
+    # Establish the preferred order (for the --help-formats option).
+    format_commands = ['rpm', 'gztar', 'bztar', 'xztar', 'ztar', 'tar',
+                       'wininst', 'zip', 'msi']
+
+    # And the real information.
+    format_command = {'rpm':   ('bdist_rpm',  "RPM distribution"),
+                      'gztar': ('bdist_dumb', "gzip'ed tar file"),
+                      'bztar': ('bdist_dumb', "bzip2'ed tar file"),
+                      'xztar': ('bdist_dumb', "xz'ed tar file"),
+                      'ztar':  ('bdist_dumb', "compressed tar file"),
+                      'tar':   ('bdist_dumb', "tar file"),
+                      'wininst': ('bdist_wininst',
+                                  "Windows executable installer"),
+                      'zip':   ('bdist_dumb', "ZIP file"),
+                      'msi':   ('bdist_msi',  "Microsoft Installer")
+                      }
+
+
+    def initialize_options(self):
+        self.bdist_base = None
+        self.plat_name = None
+        self.formats = None
+        self.dist_dir = None
+        self.skip_build = 0
+        self.group = None
+        self.owner = None
+
+    def finalize_options(self):
+        # have to finalize 'plat_name' before 'bdist_base'
+        if self.plat_name is None:
+            if self.skip_build:
+                self.plat_name = get_platform()
+            else:
+                self.plat_name = self.get_finalized_command('build').plat_name
+
+        # 'bdist_base' -- parent of per-built-distribution-format
+        # temporary directories (eg. we'll probably have
+        # "build/bdist.<plat>/dumb", "build/bdist.<plat>/rpm", etc.)
+        if self.bdist_base is None:
+            build_base = self.get_finalized_command('build').build_base
+            self.bdist_base = os.path.join(build_base,
+                                           'bdist.' + self.plat_name)
+
+        self.ensure_string_list('formats')
+        if self.formats is None:
+            try:
+                self.formats = [self.default_format[os.name]]
+            except KeyError:
+                raise DistutilsPlatformError(
+                      "don't know how to create built distributions "
+                      "on platform %s" % os.name)
+
+        if self.dist_dir is None:
+            self.dist_dir = "dist"
+
+    def run(self):
+        # Figure out which sub-commands we need to run.
+        commands = []
+        for format in self.formats:
+            try:
+                commands.append(self.format_command[format][0])
+            except KeyError:
+                raise DistutilsOptionError("invalid format '%s'" % format)
+
+        # Reinitialize and run each command.
+        for i in range(len(self.formats)):
+            cmd_name = commands[i]
+            sub_cmd = self.reinitialize_command(cmd_name)
+            if cmd_name not in self.no_format_option:
+                sub_cmd.format = self.formats[i]
+
+            # passing the owner and group names for tar archiving
+            if cmd_name == 'bdist_dumb':
+                sub_cmd.owner = self.owner
+                sub_cmd.group = self.group
+
+            # If we're going to need to run this command again, tell it to
+            # keep its temporary files around so subsequent runs go faster.
+            if cmd_name in commands[i+1:]:
+                sub_cmd.keep_temp = 1
+            self.run_command(cmd_name)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/bdist_dumb.py b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_dumb.py
new file mode 100644
index 000000000..f0d6b5b8c
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_dumb.py
@@ -0,0 +1,123 @@
+"""distutils.command.bdist_dumb
+
+Implements the Distutils 'bdist_dumb' command (create a "dumb" built
+distribution -- i.e., just an archive to be unpacked under $prefix or
+$exec_prefix)."""
+
+import os
+from distutils.core import Command
+from distutils.util import get_platform
+from distutils.dir_util import remove_tree, ensure_relative
+from distutils.errors import *
+from distutils.sysconfig import get_python_version
+from distutils import log
+
+class bdist_dumb(Command):
+
+    description = "create a \"dumb\" built distribution"
+
+    user_options = [('bdist-dir=', 'd',
+                     "temporary directory for creating the distribution"),
+                    ('plat-name=', 'p',
+                     "platform name to embed in generated filenames "
+                     "(default: %s)" % get_platform()),
+                    ('format=', 'f',
+                     "archive format to create (tar, gztar, bztar, xztar, "
+                     "ztar, zip)"),
+                    ('keep-temp', 'k',
+                     "keep the pseudo-installation tree around after " +
+                     "creating the distribution archive"),
+                    ('dist-dir=', 'd',
+                     "directory to put final built distributions in"),
+                    ('skip-build', None,
+                     "skip rebuilding everything (for testing/debugging)"),
+                    ('relative', None,
+                     "build the archive using relative paths "
+                     "(default: false)"),
+                    ('owner=', 'u',
+                     "Owner name used when creating a tar file"
+                     " [default: current user]"),
+                    ('group=', 'g',
+                     "Group name used when creating a tar file"
+                     " [default: current group]"),
+                   ]
+
+    boolean_options = ['keep-temp', 'skip-build', 'relative']
+
+    default_format = { 'posix': 'gztar',
+                       'nt': 'zip' }
+
+    def initialize_options(self):
+        self.bdist_dir = None
+        self.plat_name = None
+        self.format = None
+        self.keep_temp = 0
+        self.dist_dir = None
+        self.skip_build = None
+        self.relative = 0
+        self.owner = None
+        self.group = None
+
+    def finalize_options(self):
+        if self.bdist_dir is None:
+            bdist_base = self.get_finalized_command('bdist').bdist_base
+            self.bdist_dir = os.path.join(bdist_base, 'dumb')
+
+        if self.format is None:
+            try:
+                self.format = self.default_format[os.name]
+            except KeyError:
+                raise DistutilsPlatformError(
+                       "don't know how to create dumb built distributions "
+                       "on platform %s" % os.name)
+
+        self.set_undefined_options('bdist',
+                                   ('dist_dir', 'dist_dir'),
+                                   ('plat_name', 'plat_name'),
+                                   ('skip_build', 'skip_build'))
+
+    def run(self):
+        if not self.skip_build:
+            self.run_command('build')
+
+        install = self.reinitialize_command('install', reinit_subcommands=1)
+        install.root = self.bdist_dir
+        install.skip_build = self.skip_build
+        install.warn_dir = 0
+
+        log.info("installing to %s", self.bdist_dir)
+        self.run_command('install')
+
+        # And make an archive relative to the root of the
+        # pseudo-installation tree.
+        archive_basename = "%s.%s" % (self.distribution.get_fullname(),
+                                      self.plat_name)
+
+        pseudoinstall_root = os.path.join(self.dist_dir, archive_basename)
+        if not self.relative:
+            archive_root = self.bdist_dir
+        else:
+            if (self.distribution.has_ext_modules() and
+                (install.install_base != install.install_platbase)):
+                raise DistutilsPlatformError(
+                       "can't make a dumb built distribution where "
+                       "base and platbase are different (%s, %s)"
+                       % (repr(install.install_base),
+                          repr(install.install_platbase)))
+            else:
+                archive_root = os.path.join(self.bdist_dir,
+                                   ensure_relative(install.install_base))
+
+        # Make the archive
+        filename = self.make_archive(pseudoinstall_root,
+                                     self.format, root_dir=archive_root,
+                                     owner=self.owner, group=self.group)
+        if self.distribution.has_ext_modules():
+            pyversion = get_python_version()
+        else:
+            pyversion = 'any'
+        self.distribution.dist_files.append(('bdist_dumb', pyversion,
+                                             filename))
+
+        if not self.keep_temp:
+            remove_tree(self.bdist_dir, dry_run=self.dry_run)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/bdist_msi.py b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_msi.py
new file mode 100644
index 000000000..0863a1883
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_msi.py
@@ -0,0 +1,749 @@
+# Copyright (C) 2005, 2006 Martin von Löwis
+# Licensed to PSF under a Contributor Agreement.
+# The bdist_wininst command proper
+# based on bdist_wininst
+"""
+Implements the bdist_msi command.
+"""
+
+import os
+import sys
+import warnings
+from distutils.core import Command
+from distutils.dir_util import remove_tree
+from distutils.sysconfig import get_python_version
+from distutils.version import StrictVersion
+from distutils.errors import DistutilsOptionError
+from distutils.util import get_platform
+from distutils import log
+import msilib
+from msilib import schema, sequence, text
+from msilib import Directory, Feature, Dialog, add_data
+
+class PyDialog(Dialog):
+    """Dialog class with a fixed layout: controls at the top, then a ruler,
+    then a list of buttons: back, next, cancel. Optionally a bitmap at the
+    left."""
+    def __init__(self, *args, **kw):
+        """Dialog(database, name, x, y, w, h, attributes, title, first,
+        default, cancel, bitmap=true)"""
+        Dialog.__init__(self, *args)
+        ruler = self.h - 36
+        bmwidth = 152*ruler/328
+        #if kw.get("bitmap", True):
+        #    self.bitmap("Bitmap", 0, 0, bmwidth, ruler, "PythonWin")
+        self.line("BottomLine", 0, ruler, self.w, 0)
+
+    def title(self, title):
+        "Set the title text of the dialog at the top."
+        # name, x, y, w, h, flags=Visible|Enabled|Transparent|NoPrefix,
+        # text, in VerdanaBold10
+        self.text("Title", 15, 10, 320, 60, 0x30003,
+                  r"{\VerdanaBold10}%s" % title)
+
+    def back(self, title, next, name = "Back", active = 1):
+        """Add a back button with a given title, the tab-next button,
+        its name in the Control table, possibly initially disabled.
+
+        Return the button, so that events can be associated"""
+        if active:
+            flags = 3 # Visible|Enabled
+        else:
+            flags = 1 # Visible
+        return self.pushbutton(name, 180, self.h-27 , 56, 17, flags, title, next)
+
+    def cancel(self, title, next, name = "Cancel", active = 1):
+        """Add a cancel button with a given title, the tab-next button,
+        its name in the Control table, possibly initially disabled.
+
+        Return the button, so that events can be associated"""
+        if active:
+            flags = 3 # Visible|Enabled
+        else:
+            flags = 1 # Visible
+        return self.pushbutton(name, 304, self.h-27, 56, 17, flags, title, next)
+
+    def next(self, title, next, name = "Next", active = 1):
+        """Add a Next button with a given title, the tab-next button,
+        its name in the Control table, possibly initially disabled.
+
+        Return the button, so that events can be associated"""
+        if active:
+            flags = 3 # Visible|Enabled
+        else:
+            flags = 1 # Visible
+        return self.pushbutton(name, 236, self.h-27, 56, 17, flags, title, next)
+
+    def xbutton(self, name, title, next, xpos):
+        """Add a button with a given title, the tab-next button,
+        its name in the Control table, giving its x position; the
+        y-position is aligned with the other buttons.
+
+        Return the button, so that events can be associated"""
+        return self.pushbutton(name, int(self.w*xpos - 28), self.h-27, 56, 17, 3, title, next)
+
+class bdist_msi(Command):
+
+    description = "create a Microsoft Installer (.msi) binary distribution"
+
+    user_options = [('bdist-dir=', None,
+                     "temporary directory for creating the distribution"),
+                    ('plat-name=', 'p',
+                     "platform name to embed in generated filenames "
+                     "(default: %s)" % get_platform()),
+                    ('keep-temp', 'k',
+                     "keep the pseudo-installation tree around after " +
+                     "creating the distribution archive"),
+                    ('target-version=', None,
+                     "require a specific python version" +
+                     " on the target system"),
+                    ('no-target-compile', 'c',
+                     "do not compile .py to .pyc on the target system"),
+                    ('no-target-optimize', 'o',
+                     "do not compile .py to .pyo (optimized) "
+                     "on the target system"),
+                    ('dist-dir=', 'd',
+                     "directory to put final built distributions in"),
+                    ('skip-build', None,
+                     "skip rebuilding everything (for testing/debugging)"),
+                    ('install-script=', None,
+                     "basename of installation script to be run after "
+                     "installation or before deinstallation"),
+                    ('pre-install-script=', None,
+                     "Fully qualified filename of a script to be run before "
+                     "any files are installed.  This script need not be in the "
+                     "distribution"),
+                   ]
+
+    boolean_options = ['keep-temp', 'no-target-compile', 'no-target-optimize',
+                       'skip-build']
+
+    all_versions = ['2.0', '2.1', '2.2', '2.3', '2.4',
+                    '2.5', '2.6', '2.7', '2.8', '2.9',
+                    '3.0', '3.1', '3.2', '3.3', '3.4',
+                    '3.5', '3.6', '3.7', '3.8', '3.9']
+    other_version = 'X'
+
+    def __init__(self, *args, **kw):
+        super().__init__(*args, **kw)
+        warnings.warn("bdist_msi command is deprecated since Python 3.9, "
+                      "use bdist_wheel (wheel packages) instead",
+                      DeprecationWarning, 2)
+
+    def initialize_options(self):
+        self.bdist_dir = None
+        self.plat_name = None
+        self.keep_temp = 0
+        self.no_target_compile = 0
+        self.no_target_optimize = 0
+        self.target_version = None
+        self.dist_dir = None
+        self.skip_build = None
+        self.install_script = None
+        self.pre_install_script = None
+        self.versions = None
+
+    def finalize_options(self):
+        self.set_undefined_options('bdist', ('skip_build', 'skip_build'))
+
+        if self.bdist_dir is None:
+            bdist_base = self.get_finalized_command('bdist').bdist_base
+            self.bdist_dir = os.path.join(bdist_base, 'msi')
+
+        short_version = get_python_version()
+        if (not self.target_version) and self.distribution.has_ext_modules():
+            self.target_version = short_version
+
+        if self.target_version:
+            self.versions = [self.target_version]
+            if not self.skip_build and self.distribution.has_ext_modules()\
+               and self.target_version != short_version:
+                raise DistutilsOptionError(
+                      "target version can only be %s, or the '--skip-build'"
+                      " option must be specified" % (short_version,))
+        else:
+            self.versions = list(self.all_versions)
+
+        self.set_undefined_options('bdist',
+                                   ('dist_dir', 'dist_dir'),
+                                   ('plat_name', 'plat_name'),
+                                   )
+
+        if self.pre_install_script:
+            raise DistutilsOptionError(
+                  "the pre-install-script feature is not yet implemented")
+
+        if self.install_script:
+            for script in self.distribution.scripts:
+                if self.install_script == os.path.basename(script):
+                    break
+            else:
+                raise DistutilsOptionError(
+                      "install_script '%s' not found in scripts"
+                      % self.install_script)
+        self.install_script_key = None
+
+    def run(self):
+        if not self.skip_build:
+            self.run_command('build')
+
+        install = self.reinitialize_command('install', reinit_subcommands=1)
+        install.prefix = self.bdist_dir
+        install.skip_build = self.skip_build
+        install.warn_dir = 0
+
+        install_lib = self.reinitialize_command('install_lib')
+        # we do not want to include pyc or pyo files
+        install_lib.compile = 0
+        install_lib.optimize = 0
+
+        if self.distribution.has_ext_modules():
+            # If we are building an installer for a Python version other
+            # than the one we are currently running, then we need to ensure
+            # our build_lib reflects the other Python version rather than ours.
+            # Note that for target_version!=sys.version, we must have skipped the
+            # build step, so there is no issue with enforcing the build of this
+            # version.
+            target_version = self.target_version
+            if not target_version:
+                assert self.skip_build, "Should have already checked this"
+                target_version = '%d.%d' % sys.version_info[:2]
+            plat_specifier = ".%s-%s" % (self.plat_name, target_version)
+            build = self.get_finalized_command('build')
+            build.build_lib = os.path.join(build.build_base,
+                                           'lib' + plat_specifier)
+
+        log.info("installing to %s", self.bdist_dir)
+        install.ensure_finalized()
+
+        # avoid warning of 'install_lib' about installing
+        # into a directory not in sys.path
+        sys.path.insert(0, os.path.join(self.bdist_dir, 'PURELIB'))
+
+        install.run()
+
+        del sys.path[0]
+
+        self.mkpath(self.dist_dir)
+        fullname = self.distribution.get_fullname()
+        installer_name = self.get_installer_filename(fullname)
+        installer_name = os.path.abspath(installer_name)
+        if os.path.exists(installer_name): os.unlink(installer_name)
+
+        metadata = self.distribution.metadata
+        author = metadata.author
+        if not author:
+            author = metadata.maintainer
+        if not author:
+            author = "UNKNOWN"
+        version = metadata.get_version()
+        # ProductVersion must be strictly numeric
+        # XXX need to deal with prerelease versions
+        sversion = "%d.%d.%d" % StrictVersion(version).version
+        # Prefix ProductName with Python x.y, so that
+        # it sorts together with the other Python packages
+        # in Add-Remove-Programs (APR)
+        fullname = self.distribution.get_fullname()
+        if self.target_version:
+            product_name = "Python %s %s" % (self.target_version, fullname)
+        else:
+            product_name = "Python %s" % (fullname)
+        self.db = msilib.init_database(installer_name, schema,
+                product_name, msilib.gen_uuid(),
+                sversion, author)
+        msilib.add_tables(self.db, sequence)
+        props = [('DistVersion', version)]
+        email = metadata.author_email or metadata.maintainer_email
+        if email:
+            props.append(("ARPCONTACT", email))
+        if metadata.url:
+            props.append(("ARPURLINFOABOUT", metadata.url))
+        if props:
+            add_data(self.db, 'Property', props)
+
+        self.add_find_python()
+        self.add_files()
+        self.add_scripts()
+        self.add_ui()
+        self.db.Commit()
+
+        if hasattr(self.distribution, 'dist_files'):
+            tup = 'bdist_msi', self.target_version or 'any', fullname
+            self.distribution.dist_files.append(tup)
+
+        if not self.keep_temp:
+            remove_tree(self.bdist_dir, dry_run=self.dry_run)
+
+    def add_files(self):
+        db = self.db
+        cab = msilib.CAB("distfiles")
+        rootdir = os.path.abspath(self.bdist_dir)
+
+        root = Directory(db, cab, None, rootdir, "TARGETDIR", "SourceDir")
+        f = Feature(db, "Python", "Python", "Everything",
+                    0, 1, directory="TARGETDIR")
+
+        items = [(f, root, '')]
+        for version in self.versions + [self.other_version]:
+            target = "TARGETDIR" + version
+            name = default = "Python" + version
+            desc = "Everything"
+            if version is self.other_version:
+                title = "Python from another location"
+                level = 2
+            else:
+                title = "Python %s from registry" % version
+                level = 1
+            f = Feature(db, name, title, desc, 1, level, directory=target)
+            dir = Directory(db, cab, root, rootdir, target, default)
+            items.append((f, dir, version))
+        db.Commit()
+
+        seen = {}
+        for feature, dir, version in items:
+            todo = [dir]
+            while todo:
+                dir = todo.pop()
+                for file in os.listdir(dir.absolute):
+                    afile = os.path.join(dir.absolute, file)
+                    if os.path.isdir(afile):
+                        short = "%s|%s" % (dir.make_short(file), file)
+                        default = file + version
+                        newdir = Directory(db, cab, dir, file, default, short)
+                        todo.append(newdir)
+                    else:
+                        if not dir.component:
+                            dir.start_component(dir.logical, feature, 0)
+                        if afile not in seen:
+                            key = seen[afile] = dir.add_file(file)
+                            if file==self.install_script:
+                                if self.install_script_key:
+                                    raise DistutilsOptionError(
+                                          "Multiple files with name %s" % file)
+                                self.install_script_key = '[#%s]' % key
+                        else:
+                            key = seen[afile]
+                            add_data(self.db, "DuplicateFile",
+                                [(key + version, dir.component, key, None, dir.logical)])
+            db.Commit()
+        cab.commit(db)
+
+    def add_find_python(self):
+        """Adds code to the installer to compute the location of Python.
+
+        Properties PYTHON.MACHINE.X.Y and PYTHON.USER.X.Y will be set from the
+        registry for each version of Python.
+
+        Properties TARGETDIRX.Y will be set from PYTHON.USER.X.Y if defined,
+        else from PYTHON.MACHINE.X.Y.
+
+        Properties PYTHONX.Y will be set to TARGETDIRX.Y\\python.exe"""
+
+        start = 402
+        for ver in self.versions:
+            install_path = r"SOFTWARE\Python\PythonCore\%s\InstallPath" % ver
+            machine_reg = "python.machine." + ver
+            user_reg = "python.user." + ver
+            machine_prop = "PYTHON.MACHINE." + ver
+            user_prop = "PYTHON.USER." + ver
+            machine_action = "PythonFromMachine" + ver
+            user_action = "PythonFromUser" + ver
+            exe_action = "PythonExe" + ver
+            target_dir_prop = "TARGETDIR" + ver
+            exe_prop = "PYTHON" + ver
+            if msilib.Win64:
+                # type: msidbLocatorTypeRawValue + msidbLocatorType64bit
+                Type = 2+16
+            else:
+                Type = 2
+            add_data(self.db, "RegLocator",
+                    [(machine_reg, 2, install_path, None, Type),
+                     (user_reg, 1, install_path, None, Type)])
+            add_data(self.db, "AppSearch",
+                    [(machine_prop, machine_reg),
+                     (user_prop, user_reg)])
+            add_data(self.db, "CustomAction",
+                    [(machine_action, 51+256, target_dir_prop, "[" + machine_prop + "]"),
+                     (user_action, 51+256, target_dir_prop, "[" + user_prop + "]"),
+                     (exe_action, 51+256, exe_prop, "[" + target_dir_prop + "]\\python.exe"),
+                    ])
+            add_data(self.db, "InstallExecuteSequence",
+                    [(machine_action, machine_prop, start),
+                     (user_action, user_prop, start + 1),
+                     (exe_action, None, start + 2),
+                    ])
+            add_data(self.db, "InstallUISequence",
+                    [(machine_action, machine_prop, start),
+                     (user_action, user_prop, start + 1),
+                     (exe_action, None, start + 2),
+                    ])
+            add_data(self.db, "Condition",
+                    [("Python" + ver, 0, "NOT TARGETDIR" + ver)])
+            start += 4
+            assert start < 500
+
+    def add_scripts(self):
+        if self.install_script:
+            start = 6800
+            for ver in self.versions + [self.other_version]:
+                install_action = "install_script." + ver
+                exe_prop = "PYTHON" + ver
+                add_data(self.db, "CustomAction",
+                        [(install_action, 50, exe_prop, self.install_script_key)])
+                add_data(self.db, "InstallExecuteSequence",
+                        [(install_action, "&Python%s=3" % ver, start)])
+                start += 1
+        # XXX pre-install scripts are currently refused in finalize_options()
+        #     but if this feature is completed, it will also need to add
+        #     entries for each version as the above code does
+        if self.pre_install_script:
+            scriptfn = os.path.join(self.bdist_dir, "preinstall.bat")
+            with open(scriptfn, "w") as f:
+                # The batch file will be executed with [PYTHON], so that %1
+                # is the path to the Python interpreter; %0 will be the path
+                # of the batch file.
+                # rem ="""
+                # %1 %0
+                # exit
+                # """
+                # <actual script>
+                f.write('rem ="""\n%1 %0\nexit\n"""\n')
+                with open(self.pre_install_script) as fin:
+                    f.write(fin.read())
+            add_data(self.db, "Binary",
+                [("PreInstall", msilib.Binary(scriptfn))
+                ])
+            add_data(self.db, "CustomAction",
+                [("PreInstall", 2, "PreInstall", None)
+                ])
+            add_data(self.db, "InstallExecuteSequence",
+                    [("PreInstall", "NOT Installed", 450)])
+
+
+    def add_ui(self):
+        db = self.db
+        x = y = 50
+        w = 370
+        h = 300
+        title = "[ProductName] Setup"
+
+        # see "Dialog Style Bits"
+        modal = 3      # visible | modal
+        modeless = 1   # visible
+        track_disk_space = 32
+
+        # UI customization properties
+        add_data(db, "Property",
+                 # See "DefaultUIFont Property"
+                 [("DefaultUIFont", "DlgFont8"),
+                  # See "ErrorDialog Style Bit"
+                  ("ErrorDialog", "ErrorDlg"),
+                  ("Progress1", "Install"),   # modified in maintenance type dlg
+                  ("Progress2", "installs"),
+                  ("MaintenanceForm_Action", "Repair"),
+                  # possible values: ALL, JUSTME
+                  ("WhichUsers", "ALL")
+                 ])
+
+        # Fonts, see "TextStyle Table"
+        add_data(db, "TextStyle",
+                 [("DlgFont8", "Tahoma", 9, None, 0),
+                  ("DlgFontBold8", "Tahoma", 8, None, 1), #bold
+                  ("VerdanaBold10", "Verdana", 10, None, 1),
+                  ("VerdanaRed9", "Verdana", 9, 255, 0),
+                 ])
+
+        # UI Sequences, see "InstallUISequence Table", "Using a Sequence Table"
+        # Numbers indicate sequence; see sequence.py for how these action integrate
+        add_data(db, "InstallUISequence",
+                 [("PrepareDlg", "Not Privileged or Windows9x or Installed", 140),
+                  ("WhichUsersDlg", "Privileged and not Windows9x and not Installed", 141),
+                  # In the user interface, assume all-users installation if privileged.
+                  ("SelectFeaturesDlg", "Not Installed", 1230),
+                  # XXX no support for resume installations yet
+                  #("ResumeDlg", "Installed AND (RESUME OR Preselected)", 1240),
+                  ("MaintenanceTypeDlg", "Installed AND NOT RESUME AND NOT Preselected", 1250),
+                  ("ProgressDlg", None, 1280)])
+
+        add_data(db, 'ActionText', text.ActionText)
+        add_data(db, 'UIText', text.UIText)
+        #####################################################################
+        # Standard dialogs: FatalError, UserExit, ExitDialog
+        fatal=PyDialog(db, "FatalError", x, y, w, h, modal, title,
+                     "Finish", "Finish", "Finish")
+        fatal.title("[ProductName] Installer ended prematurely")
+        fatal.back("< Back", "Finish", active = 0)
+        fatal.cancel("Cancel", "Back", active = 0)
+        fatal.text("Description1", 15, 70, 320, 80, 0x30003,
+                   "[ProductName] setup ended prematurely because of an error.  Your system has not been modified.  To install this program at a later time, please run the installation again.")
+        fatal.text("Description2", 15, 155, 320, 20, 0x30003,
+                   "Click the Finish button to exit the Installer.")
+        c=fatal.next("Finish", "Cancel", name="Finish")
+        c.event("EndDialog", "Exit")
+
+        user_exit=PyDialog(db, "UserExit", x, y, w, h, modal, title,
+                     "Finish", "Finish", "Finish")
+        user_exit.title("[ProductName] Installer was interrupted")
+        user_exit.back("< Back", "Finish", active = 0)
+        user_exit.cancel("Cancel", "Back", active = 0)
+        user_exit.text("Description1", 15, 70, 320, 80, 0x30003,
+                   "[ProductName] setup was interrupted.  Your system has not been modified.  "
+                   "To install this program at a later time, please run the installation again.")
+        user_exit.text("Description2", 15, 155, 320, 20, 0x30003,
+                   "Click the Finish button to exit the Installer.")
+        c = user_exit.next("Finish", "Cancel", name="Finish")
+        c.event("EndDialog", "Exit")
+
+        exit_dialog = PyDialog(db, "ExitDialog", x, y, w, h, modal, title,
+                             "Finish", "Finish", "Finish")
+        exit_dialog.title("Completing the [ProductName] Installer")
+        exit_dialog.back("< Back", "Finish", active = 0)
+        exit_dialog.cancel("Cancel", "Back", active = 0)
+        exit_dialog.text("Description", 15, 235, 320, 20, 0x30003,
+                   "Click the Finish button to exit the Installer.")
+        c = exit_dialog.next("Finish", "Cancel", name="Finish")
+        c.event("EndDialog", "Return")
+
+        #####################################################################
+        # Required dialog: FilesInUse, ErrorDlg
+        inuse = PyDialog(db, "FilesInUse",
+                         x, y, w, h,
+                         19,                # KeepModeless|Modal|Visible
+                         title,
+                         "Retry", "Retry", "Retry", bitmap=False)
+        inuse.text("Title", 15, 6, 200, 15, 0x30003,
+                   r"{\DlgFontBold8}Files in Use")
+        inuse.text("Description", 20, 23, 280, 20, 0x30003,
+               "Some files that need to be updated are currently in use.")
+        inuse.text("Text", 20, 55, 330, 50, 3,
+                   "The following applications are using files that need to be updated by this setup. Close these applications and then click Retry to continue the installation or Cancel to exit it.")
+        inuse.control("List", "ListBox", 20, 107, 330, 130, 7, "FileInUseProcess",
+                      None, None, None)
+        c=inuse.back("Exit", "Ignore", name="Exit")
+        c.event("EndDialog", "Exit")
+        c=inuse.next("Ignore", "Retry", name="Ignore")
+        c.event("EndDialog", "Ignore")
+        c=inuse.cancel("Retry", "Exit", name="Retry")
+        c.event("EndDialog","Retry")
+
+        # See "Error Dialog". See "ICE20" for the required names of the controls.
+        error = Dialog(db, "ErrorDlg",
+                       50, 10, 330, 101,
+                       65543,       # Error|Minimize|Modal|Visible
+                       title,
+                       "ErrorText", None, None)
+        error.text("ErrorText", 50,9,280,48,3, "")
+        #error.control("ErrorIcon", "Icon", 15, 9, 24, 24, 5242881, None, "py.ico", None, None)
+        error.pushbutton("N",120,72,81,21,3,"No",None).event("EndDialog","ErrorNo")
+        error.pushbutton("Y",240,72,81,21,3,"Yes",None).event("EndDialog","ErrorYes")
+        error.pushbutton("A",0,72,81,21,3,"Abort",None).event("EndDialog","ErrorAbort")
+        error.pushbutton("C",42,72,81,21,3,"Cancel",None).event("EndDialog","ErrorCancel")
+        error.pushbutton("I",81,72,81,21,3,"Ignore",None).event("EndDialog","ErrorIgnore")
+        error.pushbutton("O",159,72,81,21,3,"Ok",None).event("EndDialog","ErrorOk")
+        error.pushbutton("R",198,72,81,21,3,"Retry",None).event("EndDialog","ErrorRetry")
+
+        #####################################################################
+        # Global "Query Cancel" dialog
+        cancel = Dialog(db, "CancelDlg", 50, 10, 260, 85, 3, title,
+                        "No", "No", "No")
+        cancel.text("Text", 48, 15, 194, 30, 3,
+                    "Are you sure you want to cancel [ProductName] installation?")
+        #cancel.control("Icon", "Icon", 15, 15, 24, 24, 5242881, None,
+        #               "py.ico", None, None)
+        c=cancel.pushbutton("Yes", 72, 57, 56, 17, 3, "Yes", "No")
+        c.event("EndDialog", "Exit")
+
+        c=cancel.pushbutton("No", 132, 57, 56, 17, 3, "No", "Yes")
+        c.event("EndDialog", "Return")
+
+        #####################################################################
+        # Global "Wait for costing" dialog
+        costing = Dialog(db, "WaitForCostingDlg", 50, 10, 260, 85, modal, title,
+                         "Return", "Return", "Return")
+        costing.text("Text", 48, 15, 194, 30, 3,
+                     "Please wait while the installer finishes determining your disk space requirements.")
+        c = costing.pushbutton("Return", 102, 57, 56, 17, 3, "Return", None)
+        c.event("EndDialog", "Exit")
+
+        #####################################################################
+        # Preparation dialog: no user input except cancellation
+        prep = PyDialog(db, "PrepareDlg", x, y, w, h, modeless, title,
+                        "Cancel", "Cancel", "Cancel")
+        prep.text("Description", 15, 70, 320, 40, 0x30003,
+                  "Please wait while the Installer prepares to guide you through the installation.")
+        prep.title("Welcome to the [ProductName] Installer")
+        c=prep.text("ActionText", 15, 110, 320, 20, 0x30003, "Pondering...")
+        c.mapping("ActionText", "Text")
+        c=prep.text("ActionData", 15, 135, 320, 30, 0x30003, None)
+        c.mapping("ActionData", "Text")
+        prep.back("Back", None, active=0)
+        prep.next("Next", None, active=0)
+        c=prep.cancel("Cancel", None)
+        c.event("SpawnDialog", "CancelDlg")
+
+        #####################################################################
+        # Feature (Python directory) selection
+        seldlg = PyDialog(db, "SelectFeaturesDlg", x, y, w, h, modal, title,
+                        "Next", "Next", "Cancel")
+        seldlg.title("Select Python Installations")
+
+        seldlg.text("Hint", 15, 30, 300, 20, 3,
+                    "Select the Python locations where %s should be installed."
+                    % self.distribution.get_fullname())
+
+        seldlg.back("< Back", None, active=0)
+        c = seldlg.next("Next >", "Cancel")
+        order = 1
+        c.event("[TARGETDIR]", "[SourceDir]", ordering=order)
+        for version in self.versions + [self.other_version]:
+            order += 1
+            c.event("[TARGETDIR]", "[TARGETDIR%s]" % version,
+                    "FEATURE_SELECTED AND &Python%s=3" % version,
+                    ordering=order)
+        c.event("SpawnWaitDialog", "WaitForCostingDlg", ordering=order + 1)
+        c.event("EndDialog", "Return", ordering=order + 2)
+        c = seldlg.cancel("Cancel", "Features")
+        c.event("SpawnDialog", "CancelDlg")
+
+        c = seldlg.control("Features", "SelectionTree", 15, 60, 300, 120, 3,
+                           "FEATURE", None, "PathEdit", None)
+        c.event("[FEATURE_SELECTED]", "1")
+        ver = self.other_version
+        install_other_cond = "FEATURE_SELECTED AND &Python%s=3" % ver
+        dont_install_other_cond = "FEATURE_SELECTED AND &Python%s<>3" % ver
+
+        c = seldlg.text("Other", 15, 200, 300, 15, 3,
+                        "Provide an alternate Python location")
+        c.condition("Enable", install_other_cond)
+        c.condition("Show", install_other_cond)
+        c.condition("Disable", dont_install_other_cond)
+        c.condition("Hide", dont_install_other_cond)
+
+        c = seldlg.control("PathEdit", "PathEdit", 15, 215, 300, 16, 1,
+                           "TARGETDIR" + ver, None, "Next", None)
+        c.condition("Enable", install_other_cond)
+        c.condition("Show", install_other_cond)
+        c.condition("Disable", dont_install_other_cond)
+        c.condition("Hide", dont_install_other_cond)
+
+        #####################################################################
+        # Disk cost
+        cost = PyDialog(db, "DiskCostDlg", x, y, w, h, modal, title,
+                        "OK", "OK", "OK", bitmap=False)
+        cost.text("Title", 15, 6, 200, 15, 0x30003,
+                 r"{\DlgFontBold8}Disk Space Requirements")
+        cost.text("Description", 20, 20, 280, 20, 0x30003,
+                  "The disk space required for the installation of the selected features.")
+        cost.text("Text", 20, 53, 330, 60, 3,
+                  "The highlighted volumes (if any) do not have enough disk space "
+              "available for the currently selected features.  You can either "
+              "remove some files from the highlighted volumes, or choose to "
+              "install less features onto local drive(s), or select different "
+              "destination drive(s).")
+        cost.control("VolumeList", "VolumeCostList", 20, 100, 330, 150, 393223,
+                     None, "{120}{70}{70}{70}{70}", None, None)
+        cost.xbutton("OK", "Ok", None, 0.5).event("EndDialog", "Return")
+
+        #####################################################################
+        # WhichUsers Dialog. Only available on NT, and for privileged users.
+        # This must be run before FindRelatedProducts, because that will
+        # take into account whether the previous installation was per-user
+        # or per-machine. We currently don't support going back to this
+        # dialog after "Next" was selected; to support this, we would need to
+        # find how to reset the ALLUSERS property, and how to re-run
+        # FindRelatedProducts.
+        # On Windows9x, the ALLUSERS property is ignored on the command line
+        # and in the Property table, but installer fails according to the documentation
+        # if a dialog attempts to set ALLUSERS.
+        whichusers = PyDialog(db, "WhichUsersDlg", x, y, w, h, modal, title,
+                            "AdminInstall", "Next", "Cancel")
+        whichusers.title("Select whether to install [ProductName] for all users of this computer.")
+        # A radio group with two options: allusers, justme
+        g = whichusers.radiogroup("AdminInstall", 15, 60, 260, 50, 3,
+                                  "WhichUsers", "", "Next")
+        g.add("ALL", 0, 5, 150, 20, "Install for all users")
+        g.add("JUSTME", 0, 25, 150, 20, "Install just for me")
+
+        whichusers.back("Back", None, active=0)
+
+        c = whichusers.next("Next >", "Cancel")
+        c.event("[ALLUSERS]", "1", 'WhichUsers="ALL"', 1)
+        c.event("EndDialog", "Return", ordering = 2)
+
+        c = whichusers.cancel("Cancel", "AdminInstall")
+        c.event("SpawnDialog", "CancelDlg")
+
+        #####################################################################
+        # Installation Progress dialog (modeless)
+        progress = PyDialog(db, "ProgressDlg", x, y, w, h, modeless, title,
+                            "Cancel", "Cancel", "Cancel", bitmap=False)
+        progress.text("Title", 20, 15, 200, 15, 0x30003,
+                     r"{\DlgFontBold8}[Progress1] [ProductName]")
+        progress.text("Text", 35, 65, 300, 30, 3,
+                      "Please wait while the Installer [Progress2] [ProductName]. "
+                      "This may take several minutes.")
+        progress.text("StatusLabel", 35, 100, 35, 20, 3, "Status:")
+
+        c=progress.text("ActionText", 70, 100, w-70, 20, 3, "Pondering...")
+        c.mapping("ActionText", "Text")
+
+        #c=progress.text("ActionData", 35, 140, 300, 20, 3, None)
+        #c.mapping("ActionData", "Text")
+
+        c=progress.control("ProgressBar", "ProgressBar", 35, 120, 300, 10, 65537,
+                           None, "Progress done", None, None)
+        c.mapping("SetProgress", "Progress")
+
+        progress.back("< Back", "Next", active=False)
+        progress.next("Next >", "Cancel", active=False)
+        progress.cancel("Cancel", "Back").event("SpawnDialog", "CancelDlg")
+
+        ###################################################################
+        # Maintenance type: repair/uninstall
+        maint = PyDialog(db, "MaintenanceTypeDlg", x, y, w, h, modal, title,
+                         "Next", "Next", "Cancel")
+        maint.title("Welcome to the [ProductName] Setup Wizard")
+        maint.text("BodyText", 15, 63, 330, 42, 3,
+                   "Select whether you want to repair or remove [ProductName].")
+        g=maint.radiogroup("RepairRadioGroup", 15, 108, 330, 60, 3,
+                            "MaintenanceForm_Action", "", "Next")
+        #g.add("Change", 0, 0, 200, 17, "&Change [ProductName]")
+        g.add("Repair", 0, 18, 200, 17, "&Repair [ProductName]")
+        g.add("Remove", 0, 36, 200, 17, "Re&move [ProductName]")
+
+        maint.back("< Back", None, active=False)
+        c=maint.next("Finish", "Cancel")
+        # Change installation: Change progress dialog to "Change", then ask
+        # for feature selection
+        #c.event("[Progress1]", "Change", 'MaintenanceForm_Action="Change"', 1)
+        #c.event("[Progress2]", "changes", 'MaintenanceForm_Action="Change"', 2)
+
+        # Reinstall: Change progress dialog to "Repair", then invoke reinstall
+        # Also set list of reinstalled features to "ALL"
+        c.event("[REINSTALL]", "ALL", 'MaintenanceForm_Action="Repair"', 5)
+        c.event("[Progress1]", "Repairing", 'MaintenanceForm_Action="Repair"', 6)
+        c.event("[Progress2]", "repairs", 'MaintenanceForm_Action="Repair"', 7)
+        c.event("Reinstall", "ALL", 'MaintenanceForm_Action="Repair"', 8)
+
+        # Uninstall: Change progress to "Remove", then invoke uninstall
+        # Also set list of removed features to "ALL"
+        c.event("[REMOVE]", "ALL", 'MaintenanceForm_Action="Remove"', 11)
+        c.event("[Progress1]", "Removing", 'MaintenanceForm_Action="Remove"', 12)
+        c.event("[Progress2]", "removes", 'MaintenanceForm_Action="Remove"', 13)
+        c.event("Remove", "ALL", 'MaintenanceForm_Action="Remove"', 14)
+
+        # Close dialog when maintenance action scheduled
+        c.event("EndDialog", "Return", 'MaintenanceForm_Action<>"Change"', 20)
+        #c.event("NewDialog", "SelectFeaturesDlg", 'MaintenanceForm_Action="Change"', 21)
+
+        maint.cancel("Cancel", "RepairRadioGroup").event("SpawnDialog", "CancelDlg")
+
+    def get_installer_filename(self, fullname):
+        # Factored out to allow overriding in subclasses
+        if self.target_version:
+            base_name = "%s.%s-py%s.msi" % (fullname, self.plat_name,
+                                            self.target_version)
+        else:
+            base_name = "%s.%s.msi" % (fullname, self.plat_name)
+        installer_name = os.path.join(self.dist_dir, base_name)
+        return installer_name
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/bdist_rpm.py b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_rpm.py
new file mode 100644
index 000000000..550cbfa1e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_rpm.py
@@ -0,0 +1,579 @@
+"""distutils.command.bdist_rpm
+
+Implements the Distutils 'bdist_rpm' command (create RPM source and binary
+distributions)."""
+
+import subprocess, sys, os
+from distutils.core import Command
+from distutils.debug import DEBUG
+from distutils.file_util import write_file
+from distutils.errors import *
+from distutils.sysconfig import get_python_version
+from distutils import log
+
+class bdist_rpm(Command):
+
+    description = "create an RPM distribution"
+
+    user_options = [
+        ('bdist-base=', None,
+         "base directory for creating built distributions"),
+        ('rpm-base=', None,
+         "base directory for creating RPMs (defaults to \"rpm\" under "
+         "--bdist-base; must be specified for RPM 2)"),
+        ('dist-dir=', 'd',
+         "directory to put final RPM files in "
+         "(and .spec files if --spec-only)"),
+        ('python=', None,
+         "path to Python interpreter to hard-code in the .spec file "
+         "(default: \"python\")"),
+        ('fix-python', None,
+         "hard-code the exact path to the current Python interpreter in "
+         "the .spec file"),
+        ('spec-only', None,
+         "only regenerate spec file"),
+        ('source-only', None,
+         "only generate source RPM"),
+        ('binary-only', None,
+         "only generate binary RPM"),
+        ('use-bzip2', None,
+         "use bzip2 instead of gzip to create source distribution"),
+
+        # More meta-data: too RPM-specific to put in the setup script,
+        # but needs to go in the .spec file -- so we make these options
+        # to "bdist_rpm".  The idea is that packagers would put this
+        # info in setup.cfg, although they are of course free to
+        # supply it on the command line.
+        ('distribution-name=', None,
+         "name of the (Linux) distribution to which this "
+         "RPM applies (*not* the name of the module distribution!)"),
+        ('group=', None,
+         "package classification [default: \"Development/Libraries\"]"),
+        ('release=', None,
+         "RPM release number"),
+        ('serial=', None,
+         "RPM serial number"),
+        ('vendor=', None,
+         "RPM \"vendor\" (eg. \"Joe Blow <joe@example.com>\") "
+         "[default: maintainer or author from setup script]"),
+        ('packager=', None,
+         "RPM packager (eg. \"Jane Doe <jane@example.net>\") "
+         "[default: vendor]"),
+        ('doc-files=', None,
+         "list of documentation files (space or comma-separated)"),
+        ('changelog=', None,
+         "RPM changelog"),
+        ('icon=', None,
+         "name of icon file"),
+        ('provides=', None,
+         "capabilities provided by this package"),
+        ('requires=', None,
+         "capabilities required by this package"),
+        ('conflicts=', None,
+         "capabilities which conflict with this package"),
+        ('build-requires=', None,
+         "capabilities required to build this package"),
+        ('obsoletes=', None,
+         "capabilities made obsolete by this package"),
+        ('no-autoreq', None,
+         "do not automatically calculate dependencies"),
+
+        # Actions to take when building RPM
+        ('keep-temp', 'k',
+         "don't clean up RPM build directory"),
+        ('no-keep-temp', None,
+         "clean up RPM build directory [default]"),
+        ('use-rpm-opt-flags', None,
+         "compile with RPM_OPT_FLAGS when building from source RPM"),
+        ('no-rpm-opt-flags', None,
+         "do not pass any RPM CFLAGS to compiler"),
+        ('rpm3-mode', None,
+         "RPM 3 compatibility mode (default)"),
+        ('rpm2-mode', None,
+         "RPM 2 compatibility mode"),
+
+        # Add the hooks necessary for specifying custom scripts
+        ('prep-script=', None,
+         "Specify a script for the PREP phase of RPM building"),
+        ('build-script=', None,
+         "Specify a script for the BUILD phase of RPM building"),
+
+        ('pre-install=', None,
+         "Specify a script for the pre-INSTALL phase of RPM building"),
+        ('install-script=', None,
+         "Specify a script for the INSTALL phase of RPM building"),
+        ('post-install=', None,
+         "Specify a script for the post-INSTALL phase of RPM building"),
+
+        ('pre-uninstall=', None,
+         "Specify a script for the pre-UNINSTALL phase of RPM building"),
+        ('post-uninstall=', None,
+         "Specify a script for the post-UNINSTALL phase of RPM building"),
+
+        ('clean-script=', None,
+         "Specify a script for the CLEAN phase of RPM building"),
+
+        ('verify-script=', None,
+         "Specify a script for the VERIFY phase of the RPM build"),
+
+        # Allow a packager to explicitly force an architecture
+        ('force-arch=', None,
+         "Force an architecture onto the RPM build process"),
+
+        ('quiet', 'q',
+         "Run the INSTALL phase of RPM building in quiet mode"),
+        ]
+
+    boolean_options = ['keep-temp', 'use-rpm-opt-flags', 'rpm3-mode',
+                       'no-autoreq', 'quiet']
+
+    negative_opt = {'no-keep-temp': 'keep-temp',
+                    'no-rpm-opt-flags': 'use-rpm-opt-flags',
+                    'rpm2-mode': 'rpm3-mode'}
+
+
+    def initialize_options(self):
+        self.bdist_base = None
+        self.rpm_base = None
+        self.dist_dir = None
+        self.python = None
+        self.fix_python = None
+        self.spec_only = None
+        self.binary_only = None
+        self.source_only = None
+        self.use_bzip2 = None
+
+        self.distribution_name = None
+        self.group = None
+        self.release = None
+        self.serial = None
+        self.vendor = None
+        self.packager = None
+        self.doc_files = None
+        self.changelog = None
+        self.icon = None
+
+        self.prep_script = None
+        self.build_script = None
+        self.install_script = None
+        self.clean_script = None
+        self.verify_script = None
+        self.pre_install = None
+        self.post_install = None
+        self.pre_uninstall = None
+        self.post_uninstall = None
+        self.prep = None
+        self.provides = None
+        self.requires = None
+        self.conflicts = None
+        self.build_requires = None
+        self.obsoletes = None
+
+        self.keep_temp = 0
+        self.use_rpm_opt_flags = 1
+        self.rpm3_mode = 1
+        self.no_autoreq = 0
+
+        self.force_arch = None
+        self.quiet = 0
+
+    def finalize_options(self):
+        self.set_undefined_options('bdist', ('bdist_base', 'bdist_base'))
+        if self.rpm_base is None:
+            if not self.rpm3_mode:
+                raise DistutilsOptionError(
+                      "you must specify --rpm-base in RPM 2 mode")
+            self.rpm_base = os.path.join(self.bdist_base, "rpm")
+
+        if self.python is None:
+            if self.fix_python:
+                self.python = sys.executable
+            else:
+                self.python = "python3"
+        elif self.fix_python:
+            raise DistutilsOptionError(
+                  "--python and --fix-python are mutually exclusive options")
+
+        if os.name != 'posix':
+            raise DistutilsPlatformError("don't know how to create RPM "
+                   "distributions on platform %s" % os.name)
+        if self.binary_only and self.source_only:
+            raise DistutilsOptionError(
+                  "cannot supply both '--source-only' and '--binary-only'")
+
+        # don't pass CFLAGS to pure python distributions
+        if not self.distribution.has_ext_modules():
+            self.use_rpm_opt_flags = 0
+
+        self.set_undefined_options('bdist', ('dist_dir', 'dist_dir'))
+        self.finalize_package_data()
+
+    def finalize_package_data(self):
+        self.ensure_string('group', "Development/Libraries")
+        self.ensure_string('vendor',
+                           "%s <%s>" % (self.distribution.get_contact(),
+                                        self.distribution.get_contact_email()))
+        self.ensure_string('packager')
+        self.ensure_string_list('doc_files')
+        if isinstance(self.doc_files, list):
+            for readme in ('README', 'README.txt'):
+                if os.path.exists(readme) and readme not in self.doc_files:
+                    self.doc_files.append(readme)
+
+        self.ensure_string('release', "1")
+        self.ensure_string('serial')   # should it be an int?
+
+        self.ensure_string('distribution_name')
+
+        self.ensure_string('changelog')
+          # Format changelog correctly
+        self.changelog = self._format_changelog(self.changelog)
+
+        self.ensure_filename('icon')
+
+        self.ensure_filename('prep_script')
+        self.ensure_filename('build_script')
+        self.ensure_filename('install_script')
+        self.ensure_filename('clean_script')
+        self.ensure_filename('verify_script')
+        self.ensure_filename('pre_install')
+        self.ensure_filename('post_install')
+        self.ensure_filename('pre_uninstall')
+        self.ensure_filename('post_uninstall')
+
+        # XXX don't forget we punted on summaries and descriptions -- they
+        # should be handled here eventually!
+
+        # Now *this* is some meta-data that belongs in the setup script...
+        self.ensure_string_list('provides')
+        self.ensure_string_list('requires')
+        self.ensure_string_list('conflicts')
+        self.ensure_string_list('build_requires')
+        self.ensure_string_list('obsoletes')
+
+        self.ensure_string('force_arch')
+
+    def run(self):
+        if DEBUG:
+            print("before _get_package_data():")
+            print("vendor =", self.vendor)
+            print("packager =", self.packager)
+            print("doc_files =", self.doc_files)
+            print("changelog =", self.changelog)
+
+        # make directories
+        if self.spec_only:
+            spec_dir = self.dist_dir
+            self.mkpath(spec_dir)
+        else:
+            rpm_dir = {}
+            for d in ('SOURCES', 'SPECS', 'BUILD', 'RPMS', 'SRPMS'):
+                rpm_dir[d] = os.path.join(self.rpm_base, d)
+                self.mkpath(rpm_dir[d])
+            spec_dir = rpm_dir['SPECS']
+
+        # Spec file goes into 'dist_dir' if '--spec-only specified',
+        # build/rpm.<plat> otherwise.
+        spec_path = os.path.join(spec_dir,
+                                 "%s.spec" % self.distribution.get_name())
+        self.execute(write_file,
+                     (spec_path,
+                      self._make_spec_file()),
+                     "writing '%s'" % spec_path)
+
+        if self.spec_only: # stop if requested
+            return
+
+        # Make a source distribution and copy to SOURCES directory with
+        # optional icon.
+        saved_dist_files = self.distribution.dist_files[:]
+        sdist = self.reinitialize_command('sdist')
+        if self.use_bzip2:
+            sdist.formats = ['bztar']
+        else:
+            sdist.formats = ['gztar']
+        self.run_command('sdist')
+        self.distribution.dist_files = saved_dist_files
+
+        source = sdist.get_archive_files()[0]
+        source_dir = rpm_dir['SOURCES']
+        self.copy_file(source, source_dir)
+
+        if self.icon:
+            if os.path.exists(self.icon):
+                self.copy_file(self.icon, source_dir)
+            else:
+                raise DistutilsFileError(
+                      "icon file '%s' does not exist" % self.icon)
+
+        # build package
+        log.info("building RPMs")
+        rpm_cmd = ['rpmbuild']
+
+        if self.source_only: # what kind of RPMs?
+            rpm_cmd.append('-bs')
+        elif self.binary_only:
+            rpm_cmd.append('-bb')
+        else:
+            rpm_cmd.append('-ba')
+        rpm_cmd.extend(['--define', '__python %s' % self.python])
+        if self.rpm3_mode:
+            rpm_cmd.extend(['--define',
+                             '_topdir %s' % os.path.abspath(self.rpm_base)])
+        if not self.keep_temp:
+            rpm_cmd.append('--clean')
+
+        if self.quiet:
+            rpm_cmd.append('--quiet')
+
+        rpm_cmd.append(spec_path)
+        # Determine the binary rpm names that should be built out of this spec
+        # file
+        # Note that some of these may not be really built (if the file
+        # list is empty)
+        nvr_string = "%{name}-%{version}-%{release}"
+        src_rpm = nvr_string + ".src.rpm"
+        non_src_rpm = "%{arch}/" + nvr_string + ".%{arch}.rpm"
+        q_cmd = r"rpm -q --qf '%s %s\n' --specfile '%s'" % (
+            src_rpm, non_src_rpm, spec_path)
+
+        out = os.popen(q_cmd)
+        try:
+            binary_rpms = []
+            source_rpm = None
+            while True:
+                line = out.readline()
+                if not line:
+                    break
+                l = line.strip().split()
+                assert(len(l) == 2)
+                binary_rpms.append(l[1])
+                # The source rpm is named after the first entry in the spec file
+                if source_rpm is None:
+                    source_rpm = l[0]
+
+            status = out.close()
+            if status:
+                raise DistutilsExecError("Failed to execute: %s" % repr(q_cmd))
+
+        finally:
+            out.close()
+
+        self.spawn(rpm_cmd)
+
+        if not self.dry_run:
+            if self.distribution.has_ext_modules():
+                pyversion = get_python_version()
+            else:
+                pyversion = 'any'
+
+            if not self.binary_only:
+                srpm = os.path.join(rpm_dir['SRPMS'], source_rpm)
+                assert(os.path.exists(srpm))
+                self.move_file(srpm, self.dist_dir)
+                filename = os.path.join(self.dist_dir, source_rpm)
+                self.distribution.dist_files.append(
+                    ('bdist_rpm', pyversion, filename))
+
+            if not self.source_only:
+                for rpm in binary_rpms:
+                    rpm = os.path.join(rpm_dir['RPMS'], rpm)
+                    if os.path.exists(rpm):
+                        self.move_file(rpm, self.dist_dir)
+                        filename = os.path.join(self.dist_dir,
+                                                os.path.basename(rpm))
+                        self.distribution.dist_files.append(
+                            ('bdist_rpm', pyversion, filename))
+
+    def _dist_path(self, path):
+        return os.path.join(self.dist_dir, os.path.basename(path))
+
+    def _make_spec_file(self):
+        """Generate the text of an RPM spec file and return it as a
+        list of strings (one per line).
+        """
+        # definitions and headers
+        spec_file = [
+            '%define name ' + self.distribution.get_name(),
+            '%define version ' + self.distribution.get_version().replace('-','_'),
+            '%define unmangled_version ' + self.distribution.get_version(),
+            '%define release ' + self.release.replace('-','_'),
+            '',
+            'Summary: ' + self.distribution.get_description(),
+            ]
+
+        # Workaround for #14443 which affects some RPM based systems such as
+        # RHEL6 (and probably derivatives)
+        vendor_hook = subprocess.getoutput('rpm --eval %{__os_install_post}')
+        # Generate a potential replacement value for __os_install_post (whilst
+        # normalizing the whitespace to simplify the test for whether the
+        # invocation of brp-python-bytecompile passes in __python):
+        vendor_hook = '\n'.join(['  %s \\' % line.strip()
+                                 for line in vendor_hook.splitlines()])
+        problem = "brp-python-bytecompile \\\n"
+        fixed = "brp-python-bytecompile %{__python} \\\n"
+        fixed_hook = vendor_hook.replace(problem, fixed)
+        if fixed_hook != vendor_hook:
+            spec_file.append('# Workaround for http://bugs.python.org/issue14443')
+            spec_file.append('%define __os_install_post ' + fixed_hook + '\n')
+
+        # put locale summaries into spec file
+        # XXX not supported for now (hard to put a dictionary
+        # in a config file -- arg!)
+        #for locale in self.summaries.keys():
+        #    spec_file.append('Summary(%s): %s' % (locale,
+        #                                          self.summaries[locale]))
+
+        spec_file.extend([
+            'Name: %{name}',
+            'Version: %{version}',
+            'Release: %{release}',])
+
+        # XXX yuck! this filename is available from the "sdist" command,
+        # but only after it has run: and we create the spec file before
+        # running "sdist", in case of --spec-only.
+        if self.use_bzip2:
+            spec_file.append('Source0: %{name}-%{unmangled_version}.tar.bz2')
+        else:
+            spec_file.append('Source0: %{name}-%{unmangled_version}.tar.gz')
+
+        spec_file.extend([
+            'License: ' + self.distribution.get_license(),
+            'Group: ' + self.group,
+            'BuildRoot: %{_tmppath}/%{name}-%{version}-%{release}-buildroot',
+            'Prefix: %{_prefix}', ])
+
+        if not self.force_arch:
+            # noarch if no extension modules
+            if not self.distribution.has_ext_modules():
+                spec_file.append('BuildArch: noarch')
+        else:
+            spec_file.append( 'BuildArch: %s' % self.force_arch )
+
+        for field in ('Vendor',
+                      'Packager',
+                      'Provides',
+                      'Requires',
+                      'Conflicts',
+                      'Obsoletes',
+                      ):
+            val = getattr(self, field.lower())
+            if isinstance(val, list):
+                spec_file.append('%s: %s' % (field, ' '.join(val)))
+            elif val is not None:
+                spec_file.append('%s: %s' % (field, val))
+
+
+        if self.distribution.get_url() != 'UNKNOWN':
+            spec_file.append('Url: ' + self.distribution.get_url())
+
+        if self.distribution_name:
+            spec_file.append('Distribution: ' + self.distribution_name)
+
+        if self.build_requires:
+            spec_file.append('BuildRequires: ' +
+                             ' '.join(self.build_requires))
+
+        if self.icon:
+            spec_file.append('Icon: ' + os.path.basename(self.icon))
+
+        if self.no_autoreq:
+            spec_file.append('AutoReq: 0')
+
+        spec_file.extend([
+            '',
+            '%description',
+            self.distribution.get_long_description()
+            ])
+
+        # put locale descriptions into spec file
+        # XXX again, suppressed because config file syntax doesn't
+        # easily support this ;-(
+        #for locale in self.descriptions.keys():
+        #    spec_file.extend([
+        #        '',
+        #        '%description -l ' + locale,
+        #        self.descriptions[locale],
+        #        ])
+
+        # rpm scripts
+        # figure out default build script
+        def_setup_call = "%s %s" % (self.python,os.path.basename(sys.argv[0]))
+        def_build = "%s build" % def_setup_call
+        if self.use_rpm_opt_flags:
+            def_build = 'env CFLAGS="$RPM_OPT_FLAGS" ' + def_build
+
+        # insert contents of files
+
+        # XXX this is kind of misleading: user-supplied options are files
+        # that we open and interpolate into the spec file, but the defaults
+        # are just text that we drop in as-is.  Hmmm.
+
+        install_cmd = ('%s install -O1 --root=$RPM_BUILD_ROOT '
+                       '--record=INSTALLED_FILES') % def_setup_call
+
+        script_options = [
+            ('prep', 'prep_script', "%setup -n %{name}-%{unmangled_version}"),
+            ('build', 'build_script', def_build),
+            ('install', 'install_script', install_cmd),
+            ('clean', 'clean_script', "rm -rf $RPM_BUILD_ROOT"),
+            ('verifyscript', 'verify_script', None),
+            ('pre', 'pre_install', None),
+            ('post', 'post_install', None),
+            ('preun', 'pre_uninstall', None),
+            ('postun', 'post_uninstall', None),
+        ]
+
+        for (rpm_opt, attr, default) in script_options:
+            # Insert contents of file referred to, if no file is referred to
+            # use 'default' as contents of script
+            val = getattr(self, attr)
+            if val or default:
+                spec_file.extend([
+                    '',
+                    '%' + rpm_opt,])
+                if val:
+                    with open(val) as f:
+                        spec_file.extend(f.read().split('\n'))
+                else:
+                    spec_file.append(default)
+
+
+        # files section
+        spec_file.extend([
+            '',
+            '%files -f INSTALLED_FILES',
+            '%defattr(-,root,root)',
+            ])
+
+        if self.doc_files:
+            spec_file.append('%doc ' + ' '.join(self.doc_files))
+
+        if self.changelog:
+            spec_file.extend([
+                '',
+                '%changelog',])
+            spec_file.extend(self.changelog)
+
+        return spec_file
+
+    def _format_changelog(self, changelog):
+        """Format the changelog correctly and convert it to a list of strings
+        """
+        if not changelog:
+            return changelog
+        new_changelog = []
+        for line in changelog.strip().split('\n'):
+            line = line.strip()
+            if line[0] == '*':
+                new_changelog.extend(['', line])
+            elif line[0] == '-':
+                new_changelog.append(line)
+            else:
+                new_changelog.append('  ' + line)
+
+        # strip trailing newline inserted by first changelog entry
+        if not new_changelog[0]:
+            del new_changelog[0]
+
+        return new_changelog
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/bdist_wininst.py b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_wininst.py
new file mode 100644
index 000000000..0e9ddaa21
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/bdist_wininst.py
@@ -0,0 +1,377 @@
+"""distutils.command.bdist_wininst
+
+Implements the Distutils 'bdist_wininst' command: create a windows installer
+exe-program."""
+
+import os
+import sys
+import warnings
+from distutils.core import Command
+from distutils.util import get_platform
+from distutils.dir_util import remove_tree
+from distutils.errors import *
+from distutils.sysconfig import get_python_version
+from distutils import log
+
+class bdist_wininst(Command):
+
+    description = "create an executable installer for MS Windows"
+
+    user_options = [('bdist-dir=', None,
+                     "temporary directory for creating the distribution"),
+                    ('plat-name=', 'p',
+                     "platform name to embed in generated filenames "
+                     "(default: %s)" % get_platform()),
+                    ('keep-temp', 'k',
+                     "keep the pseudo-installation tree around after " +
+                     "creating the distribution archive"),
+                    ('target-version=', None,
+                     "require a specific python version" +
+                     " on the target system"),
+                    ('no-target-compile', 'c',
+                     "do not compile .py to .pyc on the target system"),
+                    ('no-target-optimize', 'o',
+                     "do not compile .py to .pyo (optimized) "
+                     "on the target system"),
+                    ('dist-dir=', 'd',
+                     "directory to put final built distributions in"),
+                    ('bitmap=', 'b',
+                     "bitmap to use for the installer instead of python-powered logo"),
+                    ('title=', 't',
+                     "title to display on the installer background instead of default"),
+                    ('skip-build', None,
+                     "skip rebuilding everything (for testing/debugging)"),
+                    ('install-script=', None,
+                     "basename of installation script to be run after "
+                     "installation or before deinstallation"),
+                    ('pre-install-script=', None,
+                     "Fully qualified filename of a script to be run before "
+                     "any files are installed.  This script need not be in the "
+                     "distribution"),
+                    ('user-access-control=', None,
+                     "specify Vista's UAC handling - 'none'/default=no "
+                     "handling, 'auto'=use UAC if target Python installed for "
+                     "all users, 'force'=always use UAC"),
+                   ]
+
+    boolean_options = ['keep-temp', 'no-target-compile', 'no-target-optimize',
+                       'skip-build']
+
+    # bpo-10945: bdist_wininst requires mbcs encoding only available on Windows
+    _unsupported = (sys.platform != "win32")
+
+    def __init__(self, *args, **kw):
+        super().__init__(*args, **kw)
+        warnings.warn("bdist_wininst command is deprecated since Python 3.8, "
+                      "use bdist_wheel (wheel packages) instead",
+                      DeprecationWarning, 2)
+
+    def initialize_options(self):
+        self.bdist_dir = None
+        self.plat_name = None
+        self.keep_temp = 0
+        self.no_target_compile = 0
+        self.no_target_optimize = 0
+        self.target_version = None
+        self.dist_dir = None
+        self.bitmap = None
+        self.title = None
+        self.skip_build = None
+        self.install_script = None
+        self.pre_install_script = None
+        self.user_access_control = None
+
+
+    def finalize_options(self):
+        self.set_undefined_options('bdist', ('skip_build', 'skip_build'))
+
+        if self.bdist_dir is None:
+            if self.skip_build and self.plat_name:
+                # If build is skipped and plat_name is overridden, bdist will
+                # not see the correct 'plat_name' - so set that up manually.
+                bdist = self.distribution.get_command_obj('bdist')
+                bdist.plat_name = self.plat_name
+                # next the command will be initialized using that name
+            bdist_base = self.get_finalized_command('bdist').bdist_base
+            self.bdist_dir = os.path.join(bdist_base, 'wininst')
+
+        if not self.target_version:
+            self.target_version = ""
+
+        if not self.skip_build and self.distribution.has_ext_modules():
+            short_version = get_python_version()
+            if self.target_version and self.target_version != short_version:
+                raise DistutilsOptionError(
+                      "target version can only be %s, or the '--skip-build'" \
+                      " option must be specified" % (short_version,))
+            self.target_version = short_version
+
+        self.set_undefined_options('bdist',
+                                   ('dist_dir', 'dist_dir'),
+                                   ('plat_name', 'plat_name'),
+                                  )
+
+        if self.install_script:
+            for script in self.distribution.scripts:
+                if self.install_script == os.path.basename(script):
+                    break
+            else:
+                raise DistutilsOptionError(
+                      "install_script '%s' not found in scripts"
+                      % self.install_script)
+
+    def run(self):
+        if (sys.platform != "win32" and
+            (self.distribution.has_ext_modules() or
+             self.distribution.has_c_libraries())):
+            raise DistutilsPlatformError \
+                  ("distribution contains extensions and/or C libraries; "
+                   "must be compiled on a Windows 32 platform")
+
+        if not self.skip_build:
+            self.run_command('build')
+
+        install = self.reinitialize_command('install', reinit_subcommands=1)
+        install.root = self.bdist_dir
+        install.skip_build = self.skip_build
+        install.warn_dir = 0
+        install.plat_name = self.plat_name
+
+        install_lib = self.reinitialize_command('install_lib')
+        # we do not want to include pyc or pyo files
+        install_lib.compile = 0
+        install_lib.optimize = 0
+
+        if self.distribution.has_ext_modules():
+            # If we are building an installer for a Python version other
+            # than the one we are currently running, then we need to ensure
+            # our build_lib reflects the other Python version rather than ours.
+            # Note that for target_version!=sys.version, we must have skipped the
+            # build step, so there is no issue with enforcing the build of this
+            # version.
+            target_version = self.target_version
+            if not target_version:
+                assert self.skip_build, "Should have already checked this"
+                target_version = '%d.%d' % sys.version_info[:2]
+            plat_specifier = ".%s-%s" % (self.plat_name, target_version)
+            build = self.get_finalized_command('build')
+            build.build_lib = os.path.join(build.build_base,
+                                           'lib' + plat_specifier)
+
+        # Use a custom scheme for the zip-file, because we have to decide
+        # at installation time which scheme to use.
+        for key in ('purelib', 'platlib', 'headers', 'scripts', 'data'):
+            value = key.upper()
+            if key == 'headers':
+                value = value + '/Include/$dist_name'
+            setattr(install,
+                    'install_' + key,
+                    value)
+
+        log.info("installing to %s", self.bdist_dir)
+        install.ensure_finalized()
+
+        # avoid warning of 'install_lib' about installing
+        # into a directory not in sys.path
+        sys.path.insert(0, os.path.join(self.bdist_dir, 'PURELIB'))
+
+        install.run()
+
+        del sys.path[0]
+
+        # And make an archive relative to the root of the
+        # pseudo-installation tree.
+        from tempfile import mktemp
+        archive_basename = mktemp()
+        fullname = self.distribution.get_fullname()
+        arcname = self.make_archive(archive_basename, "zip",
+                                    root_dir=self.bdist_dir)
+        # create an exe containing the zip-file
+        self.create_exe(arcname, fullname, self.bitmap)
+        if self.distribution.has_ext_modules():
+            pyversion = get_python_version()
+        else:
+            pyversion = 'any'
+        self.distribution.dist_files.append(('bdist_wininst', pyversion,
+                                             self.get_installer_filename(fullname)))
+        # remove the zip-file again
+        log.debug("removing temporary file '%s'", arcname)
+        os.remove(arcname)
+
+        if not self.keep_temp:
+            remove_tree(self.bdist_dir, dry_run=self.dry_run)
+
+    def get_inidata(self):
+        # Return data describing the installation.
+        lines = []
+        metadata = self.distribution.metadata
+
+        # Write the [metadata] section.
+        lines.append("[metadata]")
+
+        # 'info' will be displayed in the installer's dialog box,
+        # describing the items to be installed.
+        info = (metadata.long_description or '') + '\n'
+
+        # Escape newline characters
+        def escape(s):
+            return s.replace("\n", "\\n")
+
+        for name in ["author", "author_email", "description", "maintainer",
+                     "maintainer_email", "name", "url", "version"]:
+            data = getattr(metadata, name, "")
+            if data:
+                info = info + ("\n    %s: %s" % \
+                               (name.capitalize(), escape(data)))
+                lines.append("%s=%s" % (name, escape(data)))
+
+        # The [setup] section contains entries controlling
+        # the installer runtime.
+        lines.append("\n[Setup]")
+        if self.install_script:
+            lines.append("install_script=%s" % self.install_script)
+        lines.append("info=%s" % escape(info))
+        lines.append("target_compile=%d" % (not self.no_target_compile))
+        lines.append("target_optimize=%d" % (not self.no_target_optimize))
+        if self.target_version:
+            lines.append("target_version=%s" % self.target_version)
+        if self.user_access_control:
+            lines.append("user_access_control=%s" % self.user_access_control)
+
+        title = self.title or self.distribution.get_fullname()
+        lines.append("title=%s" % escape(title))
+        import time
+        import distutils
+        build_info = "Built %s with distutils-%s" % \
+                     (time.ctime(time.time()), distutils.__version__)
+        lines.append("build_info=%s" % build_info)
+        return "\n".join(lines)
+
+    def create_exe(self, arcname, fullname, bitmap=None):
+        import struct
+
+        self.mkpath(self.dist_dir)
+
+        cfgdata = self.get_inidata()
+
+        installer_name = self.get_installer_filename(fullname)
+        self.announce("creating %s" % installer_name)
+
+        if bitmap:
+            with open(bitmap, "rb") as f:
+                bitmapdata = f.read()
+            bitmaplen = len(bitmapdata)
+        else:
+            bitmaplen = 0
+
+        with open(installer_name, "wb") as file:
+            file.write(self.get_exe_bytes())
+            if bitmap:
+                file.write(bitmapdata)
+
+            # Convert cfgdata from unicode to ascii, mbcs encoded
+            if isinstance(cfgdata, str):
+                cfgdata = cfgdata.encode("mbcs")
+
+            # Append the pre-install script
+            cfgdata = cfgdata + b"\0"
+            if self.pre_install_script:
+                # We need to normalize newlines, so we open in text mode and
+                # convert back to bytes. "latin-1" simply avoids any possible
+                # failures.
+                with open(self.pre_install_script, "r",
+                          encoding="latin-1") as script:
+                    script_data = script.read().encode("latin-1")
+                cfgdata = cfgdata + script_data + b"\n\0"
+            else:
+                # empty pre-install script
+                cfgdata = cfgdata + b"\0"
+            file.write(cfgdata)
+
+            # The 'magic number' 0x1234567B is used to make sure that the
+            # binary layout of 'cfgdata' is what the wininst.exe binary
+            # expects.  If the layout changes, increment that number, make
+            # the corresponding changes to the wininst.exe sources, and
+            # recompile them.
+            header = struct.pack("<iii",
+                                0x1234567B,       # tag
+                                len(cfgdata),     # length
+                                bitmaplen,        # number of bytes in bitmap
+                                )
+            file.write(header)
+            with open(arcname, "rb") as f:
+                file.write(f.read())
+
+    def get_installer_filename(self, fullname):
+        # Factored out to allow overriding in subclasses
+        if self.target_version:
+            # if we create an installer for a specific python version,
+            # it's better to include this in the name
+            installer_name = os.path.join(self.dist_dir,
+                                          "%s.%s-py%s.exe" %
+                                           (fullname, self.plat_name, self.target_version))
+        else:
+            installer_name = os.path.join(self.dist_dir,
+                                          "%s.%s.exe" % (fullname, self.plat_name))
+        return installer_name
+
+    def get_exe_bytes(self):
+        # If a target-version other than the current version has been
+        # specified, then using the MSVC version from *this* build is no good.
+        # Without actually finding and executing the target version and parsing
+        # its sys.version, we just hard-code our knowledge of old versions.
+        # NOTE: Possible alternative is to allow "--target-version" to
+        # specify a Python executable rather than a simple version string.
+        # We can then execute this program to obtain any info we need, such
+        # as the real sys.version string for the build.
+        cur_version = get_python_version()
+
+        # If the target version is *later* than us, then we assume they
+        # use what we use
+        # string compares seem wrong, but are what sysconfig.py itself uses
+        if self.target_version and self.target_version < cur_version:
+            if self.target_version < "2.4":
+                bv = '6.0'
+            elif self.target_version == "2.4":
+                bv = '7.1'
+            elif self.target_version == "2.5":
+                bv = '8.0'
+            elif self.target_version <= "3.2":
+                bv = '9.0'
+            elif self.target_version <= "3.4":
+                bv = '10.0'
+            else:
+                bv = '14.0'
+        else:
+            # for current version - use authoritative check.
+            try:
+                from msvcrt import CRT_ASSEMBLY_VERSION
+            except ImportError:
+                # cross-building, so assume the latest version
+                bv = '14.0'
+            else:
+                # as far as we know, CRT is binary compatible based on
+                # the first field, so assume 'x.0' until proven otherwise
+                major = CRT_ASSEMBLY_VERSION.partition('.')[0]
+                bv = major + '.0'
+
+
+        # wininst-x.y.exe is in the same directory as this file
+        directory = os.path.dirname(__file__)
+        # we must use a wininst-x.y.exe built with the same C compiler
+        # used for python.  XXX What about mingw, borland, and so on?
+
+        # if plat_name starts with "win" but is not "win32"
+        # we want to strip "win" and leave the rest (e.g. -amd64)
+        # for all other cases, we don't want any suffix
+        if self.plat_name != 'win32' and self.plat_name[:3] == 'win':
+            sfix = self.plat_name[3:]
+        else:
+            sfix = ''
+
+        filename = os.path.join(directory, "wininst-%s%s.exe" % (bv, sfix))
+        f = open(filename, "rb")
+        try:
+            return f.read()
+        finally:
+            f.close()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/build.py b/venv/Lib/site-packages/setuptools/_distutils/command/build.py
new file mode 100644
index 000000000..a86df0bc7
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/build.py
@@ -0,0 +1,157 @@
+"""distutils.command.build
+
+Implements the Distutils 'build' command."""
+
+import sys, os
+from distutils.core import Command
+from distutils.errors import DistutilsOptionError
+from distutils.util import get_platform
+
+
+def show_compilers():
+    from distutils.ccompiler import show_compilers
+    show_compilers()
+
+
+class build(Command):
+
+    description = "build everything needed to install"
+
+    user_options = [
+        ('build-base=', 'b',
+         "base directory for build library"),
+        ('build-purelib=', None,
+         "build directory for platform-neutral distributions"),
+        ('build-platlib=', None,
+         "build directory for platform-specific distributions"),
+        ('build-lib=', None,
+         "build directory for all distribution (defaults to either " +
+         "build-purelib or build-platlib"),
+        ('build-scripts=', None,
+         "build directory for scripts"),
+        ('build-temp=', 't',
+         "temporary build directory"),
+        ('plat-name=', 'p',
+         "platform name to build for, if supported "
+         "(default: %s)" % get_platform()),
+        ('compiler=', 'c',
+         "specify the compiler type"),
+        ('parallel=', 'j',
+         "number of parallel build jobs"),
+        ('debug', 'g',
+         "compile extensions and libraries with debugging information"),
+        ('force', 'f',
+         "forcibly build everything (ignore file timestamps)"),
+        ('executable=', 'e',
+         "specify final destination interpreter path (build.py)"),
+        ]
+
+    boolean_options = ['debug', 'force']
+
+    help_options = [
+        ('help-compiler', None,
+         "list available compilers", show_compilers),
+        ]
+
+    def initialize_options(self):
+        self.build_base = 'build'
+        # these are decided only after 'build_base' has its final value
+        # (unless overridden by the user or client)
+        self.build_purelib = None
+        self.build_platlib = None
+        self.build_lib = None
+        self.build_temp = None
+        self.build_scripts = None
+        self.compiler = None
+        self.plat_name = None
+        self.debug = None
+        self.force = 0
+        self.executable = None
+        self.parallel = None
+
+    def finalize_options(self):
+        if self.plat_name is None:
+            self.plat_name = get_platform()
+        else:
+            # plat-name only supported for windows (other platforms are
+            # supported via ./configure flags, if at all).  Avoid misleading
+            # other platforms.
+            if os.name != 'nt':
+                raise DistutilsOptionError(
+                            "--plat-name only supported on Windows (try "
+                            "using './configure --help' on your platform)")
+
+        plat_specifier = ".%s-%d.%d" % (self.plat_name, *sys.version_info[:2])
+
+        # Make it so Python 2.x and Python 2.x with --with-pydebug don't
+        # share the same build directories. Doing so confuses the build
+        # process for C modules
+        if hasattr(sys, 'gettotalrefcount'):
+            plat_specifier += '-pydebug'
+
+        # 'build_purelib' and 'build_platlib' just default to 'lib' and
+        # 'lib.<plat>' under the base build directory.  We only use one of
+        # them for a given distribution, though --
+        if self.build_purelib is None:
+            self.build_purelib = os.path.join(self.build_base, 'lib')
+        if self.build_platlib is None:
+            self.build_platlib = os.path.join(self.build_base,
+                                              'lib' + plat_specifier)
+
+        # 'build_lib' is the actual directory that we will use for this
+        # particular module distribution -- if user didn't supply it, pick
+        # one of 'build_purelib' or 'build_platlib'.
+        if self.build_lib is None:
+            if self.distribution.ext_modules:
+                self.build_lib = self.build_platlib
+            else:
+                self.build_lib = self.build_purelib
+
+        # 'build_temp' -- temporary directory for compiler turds,
+        # "build/temp.<plat>"
+        if self.build_temp is None:
+            self.build_temp = os.path.join(self.build_base,
+                                           'temp' + plat_specifier)
+        if self.build_scripts is None:
+            self.build_scripts = os.path.join(self.build_base,
+                                              'scripts-%d.%d' % sys.version_info[:2])
+
+        if self.executable is None and sys.executable:
+            self.executable = os.path.normpath(sys.executable)
+
+        if isinstance(self.parallel, str):
+            try:
+                self.parallel = int(self.parallel)
+            except ValueError:
+                raise DistutilsOptionError("parallel should be an integer")
+
+    def run(self):
+        # Run all relevant sub-commands.  This will be some subset of:
+        #  - build_py      - pure Python modules
+        #  - build_clib    - standalone C libraries
+        #  - build_ext     - Python extensions
+        #  - build_scripts - (Python) scripts
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+
+    # -- Predicates for the sub-command list ---------------------------
+
+    def has_pure_modules(self):
+        return self.distribution.has_pure_modules()
+
+    def has_c_libraries(self):
+        return self.distribution.has_c_libraries()
+
+    def has_ext_modules(self):
+        return self.distribution.has_ext_modules()
+
+    def has_scripts(self):
+        return self.distribution.has_scripts()
+
+
+    sub_commands = [('build_py',      has_pure_modules),
+                    ('build_clib',    has_c_libraries),
+                    ('build_ext',     has_ext_modules),
+                    ('build_scripts', has_scripts),
+                   ]
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/build_clib.py b/venv/Lib/site-packages/setuptools/_distutils/command/build_clib.py
new file mode 100644
index 000000000..3e20ef23c
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/build_clib.py
@@ -0,0 +1,209 @@
+"""distutils.command.build_clib
+
+Implements the Distutils 'build_clib' command, to build a C/C++ library
+that is included in the module distribution and needed by an extension
+module."""
+
+
+# XXX this module has *lots* of code ripped-off quite transparently from
+# build_ext.py -- not surprisingly really, as the work required to build
+# a static library from a collection of C source files is not really all
+# that different from what's required to build a shared object file from
+# a collection of C source files.  Nevertheless, I haven't done the
+# necessary refactoring to account for the overlap in code between the
+# two modules, mainly because a number of subtle details changed in the
+# cut 'n paste.  Sigh.
+
+import os
+from distutils.core import Command
+from distutils.errors import *
+from distutils.sysconfig import customize_compiler
+from distutils import log
+
+def show_compilers():
+    from distutils.ccompiler import show_compilers
+    show_compilers()
+
+
+class build_clib(Command):
+
+    description = "build C/C++ libraries used by Python extensions"
+
+    user_options = [
+        ('build-clib=', 'b',
+         "directory to build C/C++ libraries to"),
+        ('build-temp=', 't',
+         "directory to put temporary build by-products"),
+        ('debug', 'g',
+         "compile with debugging information"),
+        ('force', 'f',
+         "forcibly build everything (ignore file timestamps)"),
+        ('compiler=', 'c',
+         "specify the compiler type"),
+        ]
+
+    boolean_options = ['debug', 'force']
+
+    help_options = [
+        ('help-compiler', None,
+         "list available compilers", show_compilers),
+        ]
+
+    def initialize_options(self):
+        self.build_clib = None
+        self.build_temp = None
+
+        # List of libraries to build
+        self.libraries = None
+
+        # Compilation options for all libraries
+        self.include_dirs = None
+        self.define = None
+        self.undef = None
+        self.debug = None
+        self.force = 0
+        self.compiler = None
+
+
+    def finalize_options(self):
+        # This might be confusing: both build-clib and build-temp default
+        # to build-temp as defined by the "build" command.  This is because
+        # I think that C libraries are really just temporary build
+        # by-products, at least from the point of view of building Python
+        # extensions -- but I want to keep my options open.
+        self.set_undefined_options('build',
+                                   ('build_temp', 'build_clib'),
+                                   ('build_temp', 'build_temp'),
+                                   ('compiler', 'compiler'),
+                                   ('debug', 'debug'),
+                                   ('force', 'force'))
+
+        self.libraries = self.distribution.libraries
+        if self.libraries:
+            self.check_library_list(self.libraries)
+
+        if self.include_dirs is None:
+            self.include_dirs = self.distribution.include_dirs or []
+        if isinstance(self.include_dirs, str):
+            self.include_dirs = self.include_dirs.split(os.pathsep)
+
+        # XXX same as for build_ext -- what about 'self.define' and
+        # 'self.undef' ?
+
+
+    def run(self):
+        if not self.libraries:
+            return
+
+        # Yech -- this is cut 'n pasted from build_ext.py!
+        from distutils.ccompiler import new_compiler
+        self.compiler = new_compiler(compiler=self.compiler,
+                                     dry_run=self.dry_run,
+                                     force=self.force)
+        customize_compiler(self.compiler)
+
+        if self.include_dirs is not None:
+            self.compiler.set_include_dirs(self.include_dirs)
+        if self.define is not None:
+            # 'define' option is a list of (name,value) tuples
+            for (name,value) in self.define:
+                self.compiler.define_macro(name, value)
+        if self.undef is not None:
+            for macro in self.undef:
+                self.compiler.undefine_macro(macro)
+
+        self.build_libraries(self.libraries)
+
+
+    def check_library_list(self, libraries):
+        """Ensure that the list of libraries is valid.
+
+        `library` is presumably provided as a command option 'libraries'.
+        This method checks that it is a list of 2-tuples, where the tuples
+        are (library_name, build_info_dict).
+
+        Raise DistutilsSetupError if the structure is invalid anywhere;
+        just returns otherwise.
+        """
+        if not isinstance(libraries, list):
+            raise DistutilsSetupError(
+                  "'libraries' option must be a list of tuples")
+
+        for lib in libraries:
+            if not isinstance(lib, tuple) and len(lib) != 2:
+                raise DistutilsSetupError(
+                      "each element of 'libraries' must a 2-tuple")
+
+            name, build_info = lib
+
+            if not isinstance(name, str):
+                raise DistutilsSetupError(
+                      "first element of each tuple in 'libraries' "
+                      "must be a string (the library name)")
+
+            if '/' in name or (os.sep != '/' and os.sep in name):
+                raise DistutilsSetupError("bad library name '%s': "
+                       "may not contain directory separators" % lib[0])
+
+            if not isinstance(build_info, dict):
+                raise DistutilsSetupError(
+                      "second element of each tuple in 'libraries' "
+                      "must be a dictionary (build info)")
+
+
+    def get_library_names(self):
+        # Assume the library list is valid -- 'check_library_list()' is
+        # called from 'finalize_options()', so it should be!
+        if not self.libraries:
+            return None
+
+        lib_names = []
+        for (lib_name, build_info) in self.libraries:
+            lib_names.append(lib_name)
+        return lib_names
+
+
+    def get_source_files(self):
+        self.check_library_list(self.libraries)
+        filenames = []
+        for (lib_name, build_info) in self.libraries:
+            sources = build_info.get('sources')
+            if sources is None or not isinstance(sources, (list, tuple)):
+                raise DistutilsSetupError(
+                       "in 'libraries' option (library '%s'), "
+                       "'sources' must be present and must be "
+                       "a list of source filenames" % lib_name)
+
+            filenames.extend(sources)
+        return filenames
+
+
+    def build_libraries(self, libraries):
+        for (lib_name, build_info) in libraries:
+            sources = build_info.get('sources')
+            if sources is None or not isinstance(sources, (list, tuple)):
+                raise DistutilsSetupError(
+                       "in 'libraries' option (library '%s'), "
+                       "'sources' must be present and must be "
+                       "a list of source filenames" % lib_name)
+            sources = list(sources)
+
+            log.info("building '%s' library", lib_name)
+
+            # First, compile the source code to object files in the library
+            # directory.  (This should probably change to putting object
+            # files in a temporary build directory.)
+            macros = build_info.get('macros')
+            include_dirs = build_info.get('include_dirs')
+            objects = self.compiler.compile(sources,
+                                            output_dir=self.build_temp,
+                                            macros=macros,
+                                            include_dirs=include_dirs,
+                                            debug=self.debug)
+
+            # Now "link" the object files together into a static library.
+            # (On Unix at least, this isn't really linking -- it just
+            # builds an archive.  Whatever.)
+            self.compiler.create_static_lib(objects, lib_name,
+                                            output_dir=self.build_clib,
+                                            debug=self.debug)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/build_ext.py b/venv/Lib/site-packages/setuptools/_distutils/command/build_ext.py
new file mode 100644
index 000000000..bbb348331
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/build_ext.py
@@ -0,0 +1,755 @@
+"""distutils.command.build_ext
+
+Implements the Distutils 'build_ext' command, for building extension
+modules (currently limited to C extensions, should accommodate C++
+extensions ASAP)."""
+
+import contextlib
+import os
+import re
+import sys
+from distutils.core import Command
+from distutils.errors import *
+from distutils.sysconfig import customize_compiler, get_python_version
+from distutils.sysconfig import get_config_h_filename
+from distutils.dep_util import newer_group
+from distutils.extension import Extension
+from distutils.util import get_platform
+from distutils import log
+from . import py37compat
+
+from site import USER_BASE
+
+# An extension name is just a dot-separated list of Python NAMEs (ie.
+# the same as a fully-qualified module name).
+extension_name_re = re.compile \
+    (r'^[a-zA-Z_][a-zA-Z_0-9]*(\.[a-zA-Z_][a-zA-Z_0-9]*)*$')
+
+
+def show_compilers ():
+    from distutils.ccompiler import show_compilers
+    show_compilers()
+
+
+class build_ext(Command):
+
+    description = "build C/C++ extensions (compile/link to build directory)"
+
+    # XXX thoughts on how to deal with complex command-line options like
+    # these, i.e. how to make it so fancy_getopt can suck them off the
+    # command line and make it look like setup.py defined the appropriate
+    # lists of tuples of what-have-you.
+    #   - each command needs a callback to process its command-line options
+    #   - Command.__init__() needs access to its share of the whole
+    #     command line (must ultimately come from
+    #     Distribution.parse_command_line())
+    #   - it then calls the current command class' option-parsing
+    #     callback to deal with weird options like -D, which have to
+    #     parse the option text and churn out some custom data
+    #     structure
+    #   - that data structure (in this case, a list of 2-tuples)
+    #     will then be present in the command object by the time
+    #     we get to finalize_options() (i.e. the constructor
+    #     takes care of both command-line and client options
+    #     in between initialize_options() and finalize_options())
+
+    sep_by = " (separated by '%s')" % os.pathsep
+    user_options = [
+        ('build-lib=', 'b',
+         "directory for compiled extension modules"),
+        ('build-temp=', 't',
+         "directory for temporary files (build by-products)"),
+        ('plat-name=', 'p',
+         "platform name to cross-compile for, if supported "
+         "(default: %s)" % get_platform()),
+        ('inplace', 'i',
+         "ignore build-lib and put compiled extensions into the source " +
+         "directory alongside your pure Python modules"),
+        ('include-dirs=', 'I',
+         "list of directories to search for header files" + sep_by),
+        ('define=', 'D',
+         "C preprocessor macros to define"),
+        ('undef=', 'U',
+         "C preprocessor macros to undefine"),
+        ('libraries=', 'l',
+         "external C libraries to link with"),
+        ('library-dirs=', 'L',
+         "directories to search for external C libraries" + sep_by),
+        ('rpath=', 'R',
+         "directories to search for shared C libraries at runtime"),
+        ('link-objects=', 'O',
+         "extra explicit link objects to include in the link"),
+        ('debug', 'g',
+         "compile/link with debugging information"),
+        ('force', 'f',
+         "forcibly build everything (ignore file timestamps)"),
+        ('compiler=', 'c',
+         "specify the compiler type"),
+        ('parallel=', 'j',
+         "number of parallel build jobs"),
+        ('swig-cpp', None,
+         "make SWIG create C++ files (default is C)"),
+        ('swig-opts=', None,
+         "list of SWIG command line options"),
+        ('swig=', None,
+         "path to the SWIG executable"),
+        ('user', None,
+         "add user include, library and rpath")
+        ]
+
+    boolean_options = ['inplace', 'debug', 'force', 'swig-cpp', 'user']
+
+    help_options = [
+        ('help-compiler', None,
+         "list available compilers", show_compilers),
+        ]
+
+    def initialize_options(self):
+        self.extensions = None
+        self.build_lib = None
+        self.plat_name = None
+        self.build_temp = None
+        self.inplace = 0
+        self.package = None
+
+        self.include_dirs = None
+        self.define = None
+        self.undef = None
+        self.libraries = None
+        self.library_dirs = None
+        self.rpath = None
+        self.link_objects = None
+        self.debug = None
+        self.force = None
+        self.compiler = None
+        self.swig = None
+        self.swig_cpp = None
+        self.swig_opts = None
+        self.user = None
+        self.parallel = None
+
+    def finalize_options(self):
+        from distutils import sysconfig
+
+        self.set_undefined_options('build',
+                                   ('build_lib', 'build_lib'),
+                                   ('build_temp', 'build_temp'),
+                                   ('compiler', 'compiler'),
+                                   ('debug', 'debug'),
+                                   ('force', 'force'),
+                                   ('parallel', 'parallel'),
+                                   ('plat_name', 'plat_name'),
+                                   )
+
+        if self.package is None:
+            self.package = self.distribution.ext_package
+
+        self.extensions = self.distribution.ext_modules
+
+        # Make sure Python's include directories (for Python.h, pyconfig.h,
+        # etc.) are in the include search path.
+        py_include = sysconfig.get_python_inc()
+        plat_py_include = sysconfig.get_python_inc(plat_specific=1)
+        if self.include_dirs is None:
+            self.include_dirs = self.distribution.include_dirs or []
+        if isinstance(self.include_dirs, str):
+            self.include_dirs = self.include_dirs.split(os.pathsep)
+
+        # If in a virtualenv, add its include directory
+        # Issue 16116
+        if sys.exec_prefix != sys.base_exec_prefix:
+            self.include_dirs.append(os.path.join(sys.exec_prefix, 'include'))
+
+        # Put the Python "system" include dir at the end, so that
+        # any local include dirs take precedence.
+        self.include_dirs.extend(py_include.split(os.path.pathsep))
+        if plat_py_include != py_include:
+            self.include_dirs.extend(
+                plat_py_include.split(os.path.pathsep))
+
+        self.ensure_string_list('libraries')
+        self.ensure_string_list('link_objects')
+
+        # Life is easier if we're not forever checking for None, so
+        # simplify these options to empty lists if unset
+        if self.libraries is None:
+            self.libraries = []
+        if self.library_dirs is None:
+            self.library_dirs = []
+        elif isinstance(self.library_dirs, str):
+            self.library_dirs = self.library_dirs.split(os.pathsep)
+
+        if self.rpath is None:
+            self.rpath = []
+        elif isinstance(self.rpath, str):
+            self.rpath = self.rpath.split(os.pathsep)
+
+        # for extensions under windows use different directories
+        # for Release and Debug builds.
+        # also Python's library directory must be appended to library_dirs
+        if os.name == 'nt':
+            # the 'libs' directory is for binary installs - we assume that
+            # must be the *native* platform.  But we don't really support
+            # cross-compiling via a binary install anyway, so we let it go.
+            self.library_dirs.append(os.path.join(sys.exec_prefix, 'libs'))
+            if sys.base_exec_prefix != sys.prefix:  # Issue 16116
+                self.library_dirs.append(os.path.join(sys.base_exec_prefix, 'libs'))
+            if self.debug:
+                self.build_temp = os.path.join(self.build_temp, "Debug")
+            else:
+                self.build_temp = os.path.join(self.build_temp, "Release")
+
+            # Append the source distribution include and library directories,
+            # this allows distutils on windows to work in the source tree
+            self.include_dirs.append(os.path.dirname(get_config_h_filename()))
+            _sys_home = getattr(sys, '_home', None)
+            if _sys_home:
+                self.library_dirs.append(_sys_home)
+
+            # Use the .lib files for the correct architecture
+            if self.plat_name == 'win32':
+                suffix = 'win32'
+            else:
+                # win-amd64
+                suffix = self.plat_name[4:]
+            new_lib = os.path.join(sys.exec_prefix, 'PCbuild')
+            if suffix:
+                new_lib = os.path.join(new_lib, suffix)
+            self.library_dirs.append(new_lib)
+
+        # For extensions under Cygwin, Python's library directory must be
+        # appended to library_dirs
+        if sys.platform[:6] == 'cygwin':
+            if sys.executable.startswith(os.path.join(sys.exec_prefix, "bin")):
+                # building third party extensions
+                self.library_dirs.append(os.path.join(sys.prefix, "lib",
+                                                      "python" + get_python_version(),
+                                                      "config"))
+            else:
+                # building python standard extensions
+                self.library_dirs.append('.')
+
+        # For building extensions with a shared Python library,
+        # Python's library directory must be appended to library_dirs
+        # See Issues: #1600860, #4366
+        if (sysconfig.get_config_var('Py_ENABLE_SHARED')):
+            if not sysconfig.python_build:
+                # building third party extensions
+                self.library_dirs.append(sysconfig.get_config_var('LIBDIR'))
+            else:
+                # building python standard extensions
+                self.library_dirs.append('.')
+
+        # The argument parsing will result in self.define being a string, but
+        # it has to be a list of 2-tuples.  All the preprocessor symbols
+        # specified by the 'define' option will be set to '1'.  Multiple
+        # symbols can be separated with commas.
+
+        if self.define:
+            defines = self.define.split(',')
+            self.define = [(symbol, '1') for symbol in defines]
+
+        # The option for macros to undefine is also a string from the
+        # option parsing, but has to be a list.  Multiple symbols can also
+        # be separated with commas here.
+        if self.undef:
+            self.undef = self.undef.split(',')
+
+        if self.swig_opts is None:
+            self.swig_opts = []
+        else:
+            self.swig_opts = self.swig_opts.split(' ')
+
+        # Finally add the user include and library directories if requested
+        if self.user:
+            user_include = os.path.join(USER_BASE, "include")
+            user_lib = os.path.join(USER_BASE, "lib")
+            if os.path.isdir(user_include):
+                self.include_dirs.append(user_include)
+            if os.path.isdir(user_lib):
+                self.library_dirs.append(user_lib)
+                self.rpath.append(user_lib)
+
+        if isinstance(self.parallel, str):
+            try:
+                self.parallel = int(self.parallel)
+            except ValueError:
+                raise DistutilsOptionError("parallel should be an integer")
+
+    def run(self):
+        from distutils.ccompiler import new_compiler
+
+        # 'self.extensions', as supplied by setup.py, is a list of
+        # Extension instances.  See the documentation for Extension (in
+        # distutils.extension) for details.
+        #
+        # For backwards compatibility with Distutils 0.8.2 and earlier, we
+        # also allow the 'extensions' list to be a list of tuples:
+        #    (ext_name, build_info)
+        # where build_info is a dictionary containing everything that
+        # Extension instances do except the name, with a few things being
+        # differently named.  We convert these 2-tuples to Extension
+        # instances as needed.
+
+        if not self.extensions:
+            return
+
+        # If we were asked to build any C/C++ libraries, make sure that the
+        # directory where we put them is in the library search path for
+        # linking extensions.
+        if self.distribution.has_c_libraries():
+            build_clib = self.get_finalized_command('build_clib')
+            self.libraries.extend(build_clib.get_library_names() or [])
+            self.library_dirs.append(build_clib.build_clib)
+
+        # Setup the CCompiler object that we'll use to do all the
+        # compiling and linking
+        self.compiler = new_compiler(compiler=self.compiler,
+                                     verbose=self.verbose,
+                                     dry_run=self.dry_run,
+                                     force=self.force)
+        customize_compiler(self.compiler)
+        # If we are cross-compiling, init the compiler now (if we are not
+        # cross-compiling, init would not hurt, but people may rely on
+        # late initialization of compiler even if they shouldn't...)
+        if os.name == 'nt' and self.plat_name != get_platform():
+            self.compiler.initialize(self.plat_name)
+
+        # And make sure that any compile/link-related options (which might
+        # come from the command-line or from the setup script) are set in
+        # that CCompiler object -- that way, they automatically apply to
+        # all compiling and linking done here.
+        if self.include_dirs is not None:
+            self.compiler.set_include_dirs(self.include_dirs)
+        if self.define is not None:
+            # 'define' option is a list of (name,value) tuples
+            for (name, value) in self.define:
+                self.compiler.define_macro(name, value)
+        if self.undef is not None:
+            for macro in self.undef:
+                self.compiler.undefine_macro(macro)
+        if self.libraries is not None:
+            self.compiler.set_libraries(self.libraries)
+        if self.library_dirs is not None:
+            self.compiler.set_library_dirs(self.library_dirs)
+        if self.rpath is not None:
+            self.compiler.set_runtime_library_dirs(self.rpath)
+        if self.link_objects is not None:
+            self.compiler.set_link_objects(self.link_objects)
+
+        # Now actually compile and link everything.
+        self.build_extensions()
+
+    def check_extensions_list(self, extensions):
+        """Ensure that the list of extensions (presumably provided as a
+        command option 'extensions') is valid, i.e. it is a list of
+        Extension objects.  We also support the old-style list of 2-tuples,
+        where the tuples are (ext_name, build_info), which are converted to
+        Extension instances here.
+
+        Raise DistutilsSetupError if the structure is invalid anywhere;
+        just returns otherwise.
+        """
+        if not isinstance(extensions, list):
+            raise DistutilsSetupError(
+                  "'ext_modules' option must be a list of Extension instances")
+
+        for i, ext in enumerate(extensions):
+            if isinstance(ext, Extension):
+                continue                # OK! (assume type-checking done
+                                        # by Extension constructor)
+
+            if not isinstance(ext, tuple) or len(ext) != 2:
+                raise DistutilsSetupError(
+                       "each element of 'ext_modules' option must be an "
+                       "Extension instance or 2-tuple")
+
+            ext_name, build_info = ext
+
+            log.warn("old-style (ext_name, build_info) tuple found in "
+                     "ext_modules for extension '%s' "
+                     "-- please convert to Extension instance", ext_name)
+
+            if not (isinstance(ext_name, str) and
+                    extension_name_re.match(ext_name)):
+                raise DistutilsSetupError(
+                       "first element of each tuple in 'ext_modules' "
+                       "must be the extension name (a string)")
+
+            if not isinstance(build_info, dict):
+                raise DistutilsSetupError(
+                       "second element of each tuple in 'ext_modules' "
+                       "must be a dictionary (build info)")
+
+            # OK, the (ext_name, build_info) dict is type-safe: convert it
+            # to an Extension instance.
+            ext = Extension(ext_name, build_info['sources'])
+
+            # Easy stuff: one-to-one mapping from dict elements to
+            # instance attributes.
+            for key in ('include_dirs', 'library_dirs', 'libraries',
+                        'extra_objects', 'extra_compile_args',
+                        'extra_link_args'):
+                val = build_info.get(key)
+                if val is not None:
+                    setattr(ext, key, val)
+
+            # Medium-easy stuff: same syntax/semantics, different names.
+            ext.runtime_library_dirs = build_info.get('rpath')
+            if 'def_file' in build_info:
+                log.warn("'def_file' element of build info dict "
+                         "no longer supported")
+
+            # Non-trivial stuff: 'macros' split into 'define_macros'
+            # and 'undef_macros'.
+            macros = build_info.get('macros')
+            if macros:
+                ext.define_macros = []
+                ext.undef_macros = []
+                for macro in macros:
+                    if not (isinstance(macro, tuple) and len(macro) in (1, 2)):
+                        raise DistutilsSetupError(
+                              "'macros' element of build info dict "
+                              "must be 1- or 2-tuple")
+                    if len(macro) == 1:
+                        ext.undef_macros.append(macro[0])
+                    elif len(macro) == 2:
+                        ext.define_macros.append(macro)
+
+            extensions[i] = ext
+
+    def get_source_files(self):
+        self.check_extensions_list(self.extensions)
+        filenames = []
+
+        # Wouldn't it be neat if we knew the names of header files too...
+        for ext in self.extensions:
+            filenames.extend(ext.sources)
+        return filenames
+
+    def get_outputs(self):
+        # Sanity check the 'extensions' list -- can't assume this is being
+        # done in the same run as a 'build_extensions()' call (in fact, we
+        # can probably assume that it *isn't*!).
+        self.check_extensions_list(self.extensions)
+
+        # And build the list of output (built) filenames.  Note that this
+        # ignores the 'inplace' flag, and assumes everything goes in the
+        # "build" tree.
+        outputs = []
+        for ext in self.extensions:
+            outputs.append(self.get_ext_fullpath(ext.name))
+        return outputs
+
+    def build_extensions(self):
+        # First, sanity-check the 'extensions' list
+        self.check_extensions_list(self.extensions)
+        if self.parallel:
+            self._build_extensions_parallel()
+        else:
+            self._build_extensions_serial()
+
+    def _build_extensions_parallel(self):
+        workers = self.parallel
+        if self.parallel is True:
+            workers = os.cpu_count()  # may return None
+        try:
+            from concurrent.futures import ThreadPoolExecutor
+        except ImportError:
+            workers = None
+
+        if workers is None:
+            self._build_extensions_serial()
+            return
+
+        with ThreadPoolExecutor(max_workers=workers) as executor:
+            futures = [executor.submit(self.build_extension, ext)
+                       for ext in self.extensions]
+            for ext, fut in zip(self.extensions, futures):
+                with self._filter_build_errors(ext):
+                    fut.result()
+
+    def _build_extensions_serial(self):
+        for ext in self.extensions:
+            with self._filter_build_errors(ext):
+                self.build_extension(ext)
+
+    @contextlib.contextmanager
+    def _filter_build_errors(self, ext):
+        try:
+            yield
+        except (CCompilerError, DistutilsError, CompileError) as e:
+            if not ext.optional:
+                raise
+            self.warn('building extension "%s" failed: %s' %
+                      (ext.name, e))
+
+    def build_extension(self, ext):
+        sources = ext.sources
+        if sources is None or not isinstance(sources, (list, tuple)):
+            raise DistutilsSetupError(
+                  "in 'ext_modules' option (extension '%s'), "
+                  "'sources' must be present and must be "
+                  "a list of source filenames" % ext.name)
+        # sort to make the resulting .so file build reproducible
+        sources = sorted(sources)
+
+        ext_path = self.get_ext_fullpath(ext.name)
+        depends = sources + ext.depends
+        if not (self.force or newer_group(depends, ext_path, 'newer')):
+            log.debug("skipping '%s' extension (up-to-date)", ext.name)
+            return
+        else:
+            log.info("building '%s' extension", ext.name)
+
+        # First, scan the sources for SWIG definition files (.i), run
+        # SWIG on 'em to create .c files, and modify the sources list
+        # accordingly.
+        sources = self.swig_sources(sources, ext)
+
+        # Next, compile the source code to object files.
+
+        # XXX not honouring 'define_macros' or 'undef_macros' -- the
+        # CCompiler API needs to change to accommodate this, and I
+        # want to do one thing at a time!
+
+        # Two possible sources for extra compiler arguments:
+        #   - 'extra_compile_args' in Extension object
+        #   - CFLAGS environment variable (not particularly
+        #     elegant, but people seem to expect it and I
+        #     guess it's useful)
+        # The environment variable should take precedence, and
+        # any sensible compiler will give precedence to later
+        # command line args.  Hence we combine them in order:
+        extra_args = ext.extra_compile_args or []
+
+        macros = ext.define_macros[:]
+        for undef in ext.undef_macros:
+            macros.append((undef,))
+
+        objects = self.compiler.compile(sources,
+                                         output_dir=self.build_temp,
+                                         macros=macros,
+                                         include_dirs=ext.include_dirs,
+                                         debug=self.debug,
+                                         extra_postargs=extra_args,
+                                         depends=ext.depends)
+
+        # XXX outdated variable, kept here in case third-part code
+        # needs it.
+        self._built_objects = objects[:]
+
+        # Now link the object files together into a "shared object" --
+        # of course, first we have to figure out all the other things
+        # that go into the mix.
+        if ext.extra_objects:
+            objects.extend(ext.extra_objects)
+        extra_args = ext.extra_link_args or []
+
+        # Detect target language, if not provided
+        language = ext.language or self.compiler.detect_language(sources)
+
+        self.compiler.link_shared_object(
+            objects, ext_path,
+            libraries=self.get_libraries(ext),
+            library_dirs=ext.library_dirs,
+            runtime_library_dirs=ext.runtime_library_dirs,
+            extra_postargs=extra_args,
+            export_symbols=self.get_export_symbols(ext),
+            debug=self.debug,
+            build_temp=self.build_temp,
+            target_lang=language)
+
+    def swig_sources(self, sources, extension):
+        """Walk the list of source files in 'sources', looking for SWIG
+        interface (.i) files.  Run SWIG on all that are found, and
+        return a modified 'sources' list with SWIG source files replaced
+        by the generated C (or C++) files.
+        """
+        new_sources = []
+        swig_sources = []
+        swig_targets = {}
+
+        # XXX this drops generated C/C++ files into the source tree, which
+        # is fine for developers who want to distribute the generated
+        # source -- but there should be an option to put SWIG output in
+        # the temp dir.
+
+        if self.swig_cpp:
+            log.warn("--swig-cpp is deprecated - use --swig-opts=-c++")
+
+        if self.swig_cpp or ('-c++' in self.swig_opts) or \
+           ('-c++' in extension.swig_opts):
+            target_ext = '.cpp'
+        else:
+            target_ext = '.c'
+
+        for source in sources:
+            (base, ext) = os.path.splitext(source)
+            if ext == ".i":             # SWIG interface file
+                new_sources.append(base + '_wrap' + target_ext)
+                swig_sources.append(source)
+                swig_targets[source] = new_sources[-1]
+            else:
+                new_sources.append(source)
+
+        if not swig_sources:
+            return new_sources
+
+        swig = self.swig or self.find_swig()
+        swig_cmd = [swig, "-python"]
+        swig_cmd.extend(self.swig_opts)
+        if self.swig_cpp:
+            swig_cmd.append("-c++")
+
+        # Do not override commandline arguments
+        if not self.swig_opts:
+            for o in extension.swig_opts:
+                swig_cmd.append(o)
+
+        for source in swig_sources:
+            target = swig_targets[source]
+            log.info("swigging %s to %s", source, target)
+            self.spawn(swig_cmd + ["-o", target, source])
+
+        return new_sources
+
+    def find_swig(self):
+        """Return the name of the SWIG executable.  On Unix, this is
+        just "swig" -- it should be in the PATH.  Tries a bit harder on
+        Windows.
+        """
+        if os.name == "posix":
+            return "swig"
+        elif os.name == "nt":
+            # Look for SWIG in its standard installation directory on
+            # Windows (or so I presume!).  If we find it there, great;
+            # if not, act like Unix and assume it's in the PATH.
+            for vers in ("1.3", "1.2", "1.1"):
+                fn = os.path.join("c:\\swig%s" % vers, "swig.exe")
+                if os.path.isfile(fn):
+                    return fn
+            else:
+                return "swig.exe"
+        else:
+            raise DistutilsPlatformError(
+                  "I don't know how to find (much less run) SWIG "
+                  "on platform '%s'" % os.name)
+
+    # -- Name generators -----------------------------------------------
+    # (extension names, filenames, whatever)
+    def get_ext_fullpath(self, ext_name):
+        """Returns the path of the filename for a given extension.
+
+        The file is located in `build_lib` or directly in the package
+        (inplace option).
+        """
+        fullname = self.get_ext_fullname(ext_name)
+        modpath = fullname.split('.')
+        filename = self.get_ext_filename(modpath[-1])
+
+        if not self.inplace:
+            # no further work needed
+            # returning :
+            #   build_dir/package/path/filename
+            filename = os.path.join(*modpath[:-1]+[filename])
+            return os.path.join(self.build_lib, filename)
+
+        # the inplace option requires to find the package directory
+        # using the build_py command for that
+        package = '.'.join(modpath[0:-1])
+        build_py = self.get_finalized_command('build_py')
+        package_dir = os.path.abspath(build_py.get_package_dir(package))
+
+        # returning
+        #   package_dir/filename
+        return os.path.join(package_dir, filename)
+
+    def get_ext_fullname(self, ext_name):
+        """Returns the fullname of a given extension name.
+
+        Adds the `package.` prefix"""
+        if self.package is None:
+            return ext_name
+        else:
+            return self.package + '.' + ext_name
+
+    def get_ext_filename(self, ext_name):
+        r"""Convert the name of an extension (eg. "foo.bar") into the name
+        of the file from which it will be loaded (eg. "foo/bar.so", or
+        "foo\bar.pyd").
+        """
+        from distutils.sysconfig import get_config_var
+        ext_path = ext_name.split('.')
+        ext_suffix = get_config_var('EXT_SUFFIX')
+        return os.path.join(*ext_path) + ext_suffix
+
+    def get_export_symbols(self, ext):
+        """Return the list of symbols that a shared extension has to
+        export.  This either uses 'ext.export_symbols' or, if it's not
+        provided, "PyInit_" + module_name.  Only relevant on Windows, where
+        the .pyd file (DLL) must export the module "PyInit_" function.
+        """
+        suffix = '_' + ext.name.split('.')[-1]
+        try:
+            # Unicode module name support as defined in PEP-489
+            # https://www.python.org/dev/peps/pep-0489/#export-hook-name
+            suffix.encode('ascii')
+        except UnicodeEncodeError:
+            suffix = 'U' + suffix.encode('punycode').replace(b'-', b'_').decode('ascii')
+
+        initfunc_name = "PyInit" + suffix
+        if initfunc_name not in ext.export_symbols:
+            ext.export_symbols.append(initfunc_name)
+        return ext.export_symbols
+
+    def get_libraries(self, ext):
+        """Return the list of libraries to link against when building a
+        shared extension.  On most platforms, this is just 'ext.libraries';
+        on Windows, we add the Python library (eg. python20.dll).
+        """
+        # The python library is always needed on Windows.  For MSVC, this
+        # is redundant, since the library is mentioned in a pragma in
+        # pyconfig.h that MSVC groks.  The other Windows compilers all seem
+        # to need it mentioned explicitly, though, so that's what we do.
+        # Append '_d' to the python import library on debug builds.
+        if sys.platform == "win32":
+            from distutils._msvccompiler import MSVCCompiler
+            if not isinstance(self.compiler, MSVCCompiler):
+                template = "python%d%d"
+                if self.debug:
+                    template = template + '_d'
+                pythonlib = (template %
+                       (sys.hexversion >> 24, (sys.hexversion >> 16) & 0xff))
+                # don't extend ext.libraries, it may be shared with other
+                # extensions, it is a reference to the original list
+                return ext.libraries + [pythonlib]
+        else:
+            # On Android only the main executable and LD_PRELOADs are considered
+            # to be RTLD_GLOBAL, all the dependencies of the main executable
+            # remain RTLD_LOCAL and so the shared libraries must be linked with
+            # libpython when python is built with a shared python library (issue
+            # bpo-21536).
+            # On Cygwin (and if required, other POSIX-like platforms based on
+            # Windows like MinGW) it is simply necessary that all symbols in
+            # shared libraries are resolved at link time.
+            from distutils.sysconfig import get_config_var
+            link_libpython = False
+            if get_config_var('Py_ENABLE_SHARED'):
+                # A native build on an Android device or on Cygwin
+                if hasattr(sys, 'getandroidapilevel'):
+                    link_libpython = True
+                elif sys.platform == 'cygwin':
+                    link_libpython = True
+                elif '_PYTHON_HOST_PLATFORM' in os.environ:
+                    # We are cross-compiling for one of the relevant platforms
+                    if get_config_var('ANDROID_API_LEVEL') != 0:
+                        link_libpython = True
+                    elif get_config_var('MACHDEP') == 'cygwin':
+                        link_libpython = True
+
+            if link_libpython:
+                ldversion = get_config_var('LDVERSION')
+                return ext.libraries + ['python' + ldversion]
+
+        return ext.libraries + py37compat.pythonlib()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/build_py.py b/venv/Lib/site-packages/setuptools/_distutils/command/build_py.py
new file mode 100644
index 000000000..edc2171cd
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/build_py.py
@@ -0,0 +1,416 @@
+"""distutils.command.build_py
+
+Implements the Distutils 'build_py' command."""
+
+import os
+import importlib.util
+import sys
+import glob
+
+from distutils.core import Command
+from distutils.errors import *
+from distutils.util import convert_path, Mixin2to3
+from distutils import log
+
+class build_py (Command):
+
+    description = "\"build\" pure Python modules (copy to build directory)"
+
+    user_options = [
+        ('build-lib=', 'd', "directory to \"build\" (copy) to"),
+        ('compile', 'c', "compile .py to .pyc"),
+        ('no-compile', None, "don't compile .py files [default]"),
+        ('optimize=', 'O',
+         "also compile with optimization: -O1 for \"python -O\", "
+         "-O2 for \"python -OO\", and -O0 to disable [default: -O0]"),
+        ('force', 'f', "forcibly build everything (ignore file timestamps)"),
+        ]
+
+    boolean_options = ['compile', 'force']
+    negative_opt = {'no-compile' : 'compile'}
+
+    def initialize_options(self):
+        self.build_lib = None
+        self.py_modules = None
+        self.package = None
+        self.package_data = None
+        self.package_dir = None
+        self.compile = 0
+        self.optimize = 0
+        self.force = None
+
+    def finalize_options(self):
+        self.set_undefined_options('build',
+                                   ('build_lib', 'build_lib'),
+                                   ('force', 'force'))
+
+        # Get the distribution options that are aliases for build_py
+        # options -- list of packages and list of modules.
+        self.packages = self.distribution.packages
+        self.py_modules = self.distribution.py_modules
+        self.package_data = self.distribution.package_data
+        self.package_dir = {}
+        if self.distribution.package_dir:
+            for name, path in self.distribution.package_dir.items():
+                self.package_dir[name] = convert_path(path)
+        self.data_files = self.get_data_files()
+
+        # Ick, copied straight from install_lib.py (fancy_getopt needs a
+        # type system!  Hell, *everything* needs a type system!!!)
+        if not isinstance(self.optimize, int):
+            try:
+                self.optimize = int(self.optimize)
+                assert 0 <= self.optimize <= 2
+            except (ValueError, AssertionError):
+                raise DistutilsOptionError("optimize must be 0, 1, or 2")
+
+    def run(self):
+        # XXX copy_file by default preserves atime and mtime.  IMHO this is
+        # the right thing to do, but perhaps it should be an option -- in
+        # particular, a site administrator might want installed files to
+        # reflect the time of installation rather than the last
+        # modification time before the installed release.
+
+        # XXX copy_file by default preserves mode, which appears to be the
+        # wrong thing to do: if a file is read-only in the working
+        # directory, we want it to be installed read/write so that the next
+        # installation of the same module distribution can overwrite it
+        # without problems.  (This might be a Unix-specific issue.)  Thus
+        # we turn off 'preserve_mode' when copying to the build directory,
+        # since the build directory is supposed to be exactly what the
+        # installation will look like (ie. we preserve mode when
+        # installing).
+
+        # Two options control which modules will be installed: 'packages'
+        # and 'py_modules'.  The former lets us work with whole packages, not
+        # specifying individual modules at all; the latter is for
+        # specifying modules one-at-a-time.
+
+        if self.py_modules:
+            self.build_modules()
+        if self.packages:
+            self.build_packages()
+            self.build_package_data()
+
+        self.byte_compile(self.get_outputs(include_bytecode=0))
+
+    def get_data_files(self):
+        """Generate list of '(package,src_dir,build_dir,filenames)' tuples"""
+        data = []
+        if not self.packages:
+            return data
+        for package in self.packages:
+            # Locate package source directory
+            src_dir = self.get_package_dir(package)
+
+            # Compute package build directory
+            build_dir = os.path.join(*([self.build_lib] + package.split('.')))
+
+            # Length of path to strip from found files
+            plen = 0
+            if src_dir:
+                plen = len(src_dir)+1
+
+            # Strip directory from globbed filenames
+            filenames = [
+                file[plen:] for file in self.find_data_files(package, src_dir)
+                ]
+            data.append((package, src_dir, build_dir, filenames))
+        return data
+
+    def find_data_files(self, package, src_dir):
+        """Return filenames for package's data files in 'src_dir'"""
+        globs = (self.package_data.get('', [])
+                 + self.package_data.get(package, []))
+        files = []
+        for pattern in globs:
+            # Each pattern has to be converted to a platform-specific path
+            filelist = glob.glob(os.path.join(glob.escape(src_dir), convert_path(pattern)))
+            # Files that match more than one pattern are only added once
+            files.extend([fn for fn in filelist if fn not in files
+                and os.path.isfile(fn)])
+        return files
+
+    def build_package_data(self):
+        """Copy data files into build directory"""
+        lastdir = None
+        for package, src_dir, build_dir, filenames in self.data_files:
+            for filename in filenames:
+                target = os.path.join(build_dir, filename)
+                self.mkpath(os.path.dirname(target))
+                self.copy_file(os.path.join(src_dir, filename), target,
+                               preserve_mode=False)
+
+    def get_package_dir(self, package):
+        """Return the directory, relative to the top of the source
+           distribution, where package 'package' should be found
+           (at least according to the 'package_dir' option, if any)."""
+        path = package.split('.')
+
+        if not self.package_dir:
+            if path:
+                return os.path.join(*path)
+            else:
+                return ''
+        else:
+            tail = []
+            while path:
+                try:
+                    pdir = self.package_dir['.'.join(path)]
+                except KeyError:
+                    tail.insert(0, path[-1])
+                    del path[-1]
+                else:
+                    tail.insert(0, pdir)
+                    return os.path.join(*tail)
+            else:
+                # Oops, got all the way through 'path' without finding a
+                # match in package_dir.  If package_dir defines a directory
+                # for the root (nameless) package, then fallback on it;
+                # otherwise, we might as well have not consulted
+                # package_dir at all, as we just use the directory implied
+                # by 'tail' (which should be the same as the original value
+                # of 'path' at this point).
+                pdir = self.package_dir.get('')
+                if pdir is not None:
+                    tail.insert(0, pdir)
+
+                if tail:
+                    return os.path.join(*tail)
+                else:
+                    return ''
+
+    def check_package(self, package, package_dir):
+        # Empty dir name means current directory, which we can probably
+        # assume exists.  Also, os.path.exists and isdir don't know about
+        # my "empty string means current dir" convention, so we have to
+        # circumvent them.
+        if package_dir != "":
+            if not os.path.exists(package_dir):
+                raise DistutilsFileError(
+                      "package directory '%s' does not exist" % package_dir)
+            if not os.path.isdir(package_dir):
+                raise DistutilsFileError(
+                       "supposed package directory '%s' exists, "
+                       "but is not a directory" % package_dir)
+
+        # Require __init__.py for all but the "root package"
+        if package:
+            init_py = os.path.join(package_dir, "__init__.py")
+            if os.path.isfile(init_py):
+                return init_py
+            else:
+                log.warn(("package init file '%s' not found " +
+                          "(or not a regular file)"), init_py)
+
+        # Either not in a package at all (__init__.py not expected), or
+        # __init__.py doesn't exist -- so don't return the filename.
+        return None
+
+    def check_module(self, module, module_file):
+        if not os.path.isfile(module_file):
+            log.warn("file %s (for module %s) not found", module_file, module)
+            return False
+        else:
+            return True
+
+    def find_package_modules(self, package, package_dir):
+        self.check_package(package, package_dir)
+        module_files = glob.glob(os.path.join(glob.escape(package_dir), "*.py"))
+        modules = []
+        setup_script = os.path.abspath(self.distribution.script_name)
+
+        for f in module_files:
+            abs_f = os.path.abspath(f)
+            if abs_f != setup_script:
+                module = os.path.splitext(os.path.basename(f))[0]
+                modules.append((package, module, f))
+            else:
+                self.debug_print("excluding %s" % setup_script)
+        return modules
+
+    def find_modules(self):
+        """Finds individually-specified Python modules, ie. those listed by
+        module name in 'self.py_modules'.  Returns a list of tuples (package,
+        module_base, filename): 'package' is a tuple of the path through
+        package-space to the module; 'module_base' is the bare (no
+        packages, no dots) module name, and 'filename' is the path to the
+        ".py" file (relative to the distribution root) that implements the
+        module.
+        """
+        # Map package names to tuples of useful info about the package:
+        #    (package_dir, checked)
+        # package_dir - the directory where we'll find source files for
+        #   this package
+        # checked - true if we have checked that the package directory
+        #   is valid (exists, contains __init__.py, ... ?)
+        packages = {}
+
+        # List of (package, module, filename) tuples to return
+        modules = []
+
+        # We treat modules-in-packages almost the same as toplevel modules,
+        # just the "package" for a toplevel is empty (either an empty
+        # string or empty list, depending on context).  Differences:
+        #   - don't check for __init__.py in directory for empty package
+        for module in self.py_modules:
+            path = module.split('.')
+            package = '.'.join(path[0:-1])
+            module_base = path[-1]
+
+            try:
+                (package_dir, checked) = packages[package]
+            except KeyError:
+                package_dir = self.get_package_dir(package)
+                checked = 0
+
+            if not checked:
+                init_py = self.check_package(package, package_dir)
+                packages[package] = (package_dir, 1)
+                if init_py:
+                    modules.append((package, "__init__", init_py))
+
+            # XXX perhaps we should also check for just .pyc files
+            # (so greedy closed-source bastards can distribute Python
+            # modules too)
+            module_file = os.path.join(package_dir, module_base + ".py")
+            if not self.check_module(module, module_file):
+                continue
+
+            modules.append((package, module_base, module_file))
+
+        return modules
+
+    def find_all_modules(self):
+        """Compute the list of all modules that will be built, whether
+        they are specified one-module-at-a-time ('self.py_modules') or
+        by whole packages ('self.packages').  Return a list of tuples
+        (package, module, module_file), just like 'find_modules()' and
+        'find_package_modules()' do."""
+        modules = []
+        if self.py_modules:
+            modules.extend(self.find_modules())
+        if self.packages:
+            for package in self.packages:
+                package_dir = self.get_package_dir(package)
+                m = self.find_package_modules(package, package_dir)
+                modules.extend(m)
+        return modules
+
+    def get_source_files(self):
+        return [module[-1] for module in self.find_all_modules()]
+
+    def get_module_outfile(self, build_dir, package, module):
+        outfile_path = [build_dir] + list(package) + [module + ".py"]
+        return os.path.join(*outfile_path)
+
+    def get_outputs(self, include_bytecode=1):
+        modules = self.find_all_modules()
+        outputs = []
+        for (package, module, module_file) in modules:
+            package = package.split('.')
+            filename = self.get_module_outfile(self.build_lib, package, module)
+            outputs.append(filename)
+            if include_bytecode:
+                if self.compile:
+                    outputs.append(importlib.util.cache_from_source(
+                        filename, optimization=''))
+                if self.optimize > 0:
+                    outputs.append(importlib.util.cache_from_source(
+                        filename, optimization=self.optimize))
+
+        outputs += [
+            os.path.join(build_dir, filename)
+            for package, src_dir, build_dir, filenames in self.data_files
+            for filename in filenames
+            ]
+
+        return outputs
+
+    def build_module(self, module, module_file, package):
+        if isinstance(package, str):
+            package = package.split('.')
+        elif not isinstance(package, (list, tuple)):
+            raise TypeError(
+                  "'package' must be a string (dot-separated), list, or tuple")
+
+        # Now put the module source file into the "build" area -- this is
+        # easy, we just copy it somewhere under self.build_lib (the build
+        # directory for Python source).
+        outfile = self.get_module_outfile(self.build_lib, package, module)
+        dir = os.path.dirname(outfile)
+        self.mkpath(dir)
+        return self.copy_file(module_file, outfile, preserve_mode=0)
+
+    def build_modules(self):
+        modules = self.find_modules()
+        for (package, module, module_file) in modules:
+            # Now "build" the module -- ie. copy the source file to
+            # self.build_lib (the build directory for Python source).
+            # (Actually, it gets copied to the directory for this package
+            # under self.build_lib.)
+            self.build_module(module, module_file, package)
+
+    def build_packages(self):
+        for package in self.packages:
+            # Get list of (package, module, module_file) tuples based on
+            # scanning the package directory.  'package' is only included
+            # in the tuple so that 'find_modules()' and
+            # 'find_package_tuples()' have a consistent interface; it's
+            # ignored here (apart from a sanity check).  Also, 'module' is
+            # the *unqualified* module name (ie. no dots, no package -- we
+            # already know its package!), and 'module_file' is the path to
+            # the .py file, relative to the current directory
+            # (ie. including 'package_dir').
+            package_dir = self.get_package_dir(package)
+            modules = self.find_package_modules(package, package_dir)
+
+            # Now loop over the modules we found, "building" each one (just
+            # copy it to self.build_lib).
+            for (package_, module, module_file) in modules:
+                assert package == package_
+                self.build_module(module, module_file, package)
+
+    def byte_compile(self, files):
+        if sys.dont_write_bytecode:
+            self.warn('byte-compiling is disabled, skipping.')
+            return
+
+        from distutils.util import byte_compile
+        prefix = self.build_lib
+        if prefix[-1] != os.sep:
+            prefix = prefix + os.sep
+
+        # XXX this code is essentially the same as the 'byte_compile()
+        # method of the "install_lib" command, except for the determination
+        # of the 'prefix' string.  Hmmm.
+        if self.compile:
+            byte_compile(files, optimize=0,
+                         force=self.force, prefix=prefix, dry_run=self.dry_run)
+        if self.optimize > 0:
+            byte_compile(files, optimize=self.optimize,
+                         force=self.force, prefix=prefix, dry_run=self.dry_run)
+
+class build_py_2to3(build_py, Mixin2to3):
+    def run(self):
+        self.updated_files = []
+
+        # Base class code
+        if self.py_modules:
+            self.build_modules()
+        if self.packages:
+            self.build_packages()
+            self.build_package_data()
+
+        # 2to3
+        self.run_2to3(self.updated_files)
+
+        # Remaining base class code
+        self.byte_compile(self.get_outputs(include_bytecode=0))
+
+    def build_module(self, module, module_file, package):
+        res = build_py.build_module(self, module, module_file, package)
+        if res[1]:
+            # file was copied
+            self.updated_files.append(res[0])
+        return res
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/build_scripts.py b/venv/Lib/site-packages/setuptools/_distutils/command/build_scripts.py
new file mode 100644
index 000000000..ccc70e646
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/build_scripts.py
@@ -0,0 +1,160 @@
+"""distutils.command.build_scripts
+
+Implements the Distutils 'build_scripts' command."""
+
+import os, re
+from stat import ST_MODE
+from distutils import sysconfig
+from distutils.core import Command
+from distutils.dep_util import newer
+from distutils.util import convert_path, Mixin2to3
+from distutils import log
+import tokenize
+
+# check if Python is called on the first line with this expression
+first_line_re = re.compile(b'^#!.*python[0-9.]*([ \t].*)?$')
+
+class build_scripts(Command):
+
+    description = "\"build\" scripts (copy and fixup #! line)"
+
+    user_options = [
+        ('build-dir=', 'd', "directory to \"build\" (copy) to"),
+        ('force', 'f', "forcibly build everything (ignore file timestamps"),
+        ('executable=', 'e', "specify final destination interpreter path"),
+        ]
+
+    boolean_options = ['force']
+
+
+    def initialize_options(self):
+        self.build_dir = None
+        self.scripts = None
+        self.force = None
+        self.executable = None
+        self.outfiles = None
+
+    def finalize_options(self):
+        self.set_undefined_options('build',
+                                   ('build_scripts', 'build_dir'),
+                                   ('force', 'force'),
+                                   ('executable', 'executable'))
+        self.scripts = self.distribution.scripts
+
+    def get_source_files(self):
+        return self.scripts
+
+    def run(self):
+        if not self.scripts:
+            return
+        self.copy_scripts()
+
+
+    def copy_scripts(self):
+        r"""Copy each script listed in 'self.scripts'; if it's marked as a
+        Python script in the Unix way (first line matches 'first_line_re',
+        ie. starts with "\#!" and contains "python"), then adjust the first
+        line to refer to the current Python interpreter as we copy.
+        """
+        self.mkpath(self.build_dir)
+        outfiles = []
+        updated_files = []
+        for script in self.scripts:
+            adjust = False
+            script = convert_path(script)
+            outfile = os.path.join(self.build_dir, os.path.basename(script))
+            outfiles.append(outfile)
+
+            if not self.force and not newer(script, outfile):
+                log.debug("not copying %s (up-to-date)", script)
+                continue
+
+            # Always open the file, but ignore failures in dry-run mode --
+            # that way, we'll get accurate feedback if we can read the
+            # script.
+            try:
+                f = open(script, "rb")
+            except OSError:
+                if not self.dry_run:
+                    raise
+                f = None
+            else:
+                encoding, lines = tokenize.detect_encoding(f.readline)
+                f.seek(0)
+                first_line = f.readline()
+                if not first_line:
+                    self.warn("%s is an empty file (skipping)" % script)
+                    continue
+
+                match = first_line_re.match(first_line)
+                if match:
+                    adjust = True
+                    post_interp = match.group(1) or b''
+
+            if adjust:
+                log.info("copying and adjusting %s -> %s", script,
+                         self.build_dir)
+                updated_files.append(outfile)
+                if not self.dry_run:
+                    if not sysconfig.python_build:
+                        executable = self.executable
+                    else:
+                        executable = os.path.join(
+                            sysconfig.get_config_var("BINDIR"),
+                           "python%s%s" % (sysconfig.get_config_var("VERSION"),
+                                           sysconfig.get_config_var("EXE")))
+                    executable = os.fsencode(executable)
+                    shebang = b"#!" + executable + post_interp + b"\n"
+                    # Python parser starts to read a script using UTF-8 until
+                    # it gets a #coding:xxx cookie. The shebang has to be the
+                    # first line of a file, the #coding:xxx cookie cannot be
+                    # written before. So the shebang has to be decodable from
+                    # UTF-8.
+                    try:
+                        shebang.decode('utf-8')
+                    except UnicodeDecodeError:
+                        raise ValueError(
+                            "The shebang ({!r}) is not decodable "
+                            "from utf-8".format(shebang))
+                    # If the script is encoded to a custom encoding (use a
+                    # #coding:xxx cookie), the shebang has to be decodable from
+                    # the script encoding too.
+                    try:
+                        shebang.decode(encoding)
+                    except UnicodeDecodeError:
+                        raise ValueError(
+                            "The shebang ({!r}) is not decodable "
+                            "from the script encoding ({})"
+                            .format(shebang, encoding))
+                    with open(outfile, "wb") as outf:
+                        outf.write(shebang)
+                        outf.writelines(f.readlines())
+                if f:
+                    f.close()
+            else:
+                if f:
+                    f.close()
+                updated_files.append(outfile)
+                self.copy_file(script, outfile)
+
+        if os.name == 'posix':
+            for file in outfiles:
+                if self.dry_run:
+                    log.info("changing mode of %s", file)
+                else:
+                    oldmode = os.stat(file)[ST_MODE] & 0o7777
+                    newmode = (oldmode | 0o555) & 0o7777
+                    if newmode != oldmode:
+                        log.info("changing mode of %s from %o to %o",
+                                 file, oldmode, newmode)
+                        os.chmod(file, newmode)
+        # XXX should we modify self.outfiles?
+        return outfiles, updated_files
+
+class build_scripts_2to3(build_scripts, Mixin2to3):
+
+    def copy_scripts(self):
+        outfiles, updated_files = build_scripts.copy_scripts(self)
+        if not self.dry_run:
+            self.run_2to3(updated_files)
+        return outfiles, updated_files
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/check.py b/venv/Lib/site-packages/setuptools/_distutils/command/check.py
new file mode 100644
index 000000000..ada250064
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/check.py
@@ -0,0 +1,148 @@
+"""distutils.command.check
+
+Implements the Distutils 'check' command.
+"""
+from distutils.core import Command
+from distutils.errors import DistutilsSetupError
+
+try:
+    # docutils is installed
+    from docutils.utils import Reporter
+    from docutils.parsers.rst import Parser
+    from docutils import frontend
+    from docutils import nodes
+
+    class SilentReporter(Reporter):
+
+        def __init__(self, source, report_level, halt_level, stream=None,
+                     debug=0, encoding='ascii', error_handler='replace'):
+            self.messages = []
+            Reporter.__init__(self, source, report_level, halt_level, stream,
+                              debug, encoding, error_handler)
+
+        def system_message(self, level, message, *children, **kwargs):
+            self.messages.append((level, message, children, kwargs))
+            return nodes.system_message(message, level=level,
+                                        type=self.levels[level],
+                                        *children, **kwargs)
+
+    HAS_DOCUTILS = True
+except Exception:
+    # Catch all exceptions because exceptions besides ImportError probably
+    # indicate that docutils is not ported to Py3k.
+    HAS_DOCUTILS = False
+
+class check(Command):
+    """This command checks the meta-data of the package.
+    """
+    description = ("perform some checks on the package")
+    user_options = [('metadata', 'm', 'Verify meta-data'),
+                    ('restructuredtext', 'r',
+                     ('Checks if long string meta-data syntax '
+                      'are reStructuredText-compliant')),
+                    ('strict', 's',
+                     'Will exit with an error if a check fails')]
+
+    boolean_options = ['metadata', 'restructuredtext', 'strict']
+
+    def initialize_options(self):
+        """Sets default values for options."""
+        self.restructuredtext = 0
+        self.metadata = 1
+        self.strict = 0
+        self._warnings = 0
+
+    def finalize_options(self):
+        pass
+
+    def warn(self, msg):
+        """Counts the number of warnings that occurs."""
+        self._warnings += 1
+        return Command.warn(self, msg)
+
+    def run(self):
+        """Runs the command."""
+        # perform the various tests
+        if self.metadata:
+            self.check_metadata()
+        if self.restructuredtext:
+            if HAS_DOCUTILS:
+                self.check_restructuredtext()
+            elif self.strict:
+                raise DistutilsSetupError('The docutils package is needed.')
+
+        # let's raise an error in strict mode, if we have at least
+        # one warning
+        if self.strict and self._warnings > 0:
+            raise DistutilsSetupError('Please correct your package.')
+
+    def check_metadata(self):
+        """Ensures that all required elements of meta-data are supplied.
+
+        Required fields:
+            name, version, URL
+
+        Recommended fields:
+            (author and author_email) or (maintainer and maintainer_email))
+
+        Warns if any are missing.
+        """
+        metadata = self.distribution.metadata
+
+        missing = []
+        for attr in ('name', 'version', 'url'):
+            if not (hasattr(metadata, attr) and getattr(metadata, attr)):
+                missing.append(attr)
+
+        if missing:
+            self.warn("missing required meta-data: %s"  % ', '.join(missing))
+        if metadata.author:
+            if not metadata.author_email:
+                self.warn("missing meta-data: if 'author' supplied, " +
+                          "'author_email' should be supplied too")
+        elif metadata.maintainer:
+            if not metadata.maintainer_email:
+                self.warn("missing meta-data: if 'maintainer' supplied, " +
+                          "'maintainer_email' should be supplied too")
+        else:
+            self.warn("missing meta-data: either (author and author_email) " +
+                      "or (maintainer and maintainer_email) " +
+                      "should be supplied")
+
+    def check_restructuredtext(self):
+        """Checks if the long string fields are reST-compliant."""
+        data = self.distribution.get_long_description()
+        for warning in self._check_rst_data(data):
+            line = warning[-1].get('line')
+            if line is None:
+                warning = warning[1]
+            else:
+                warning = '%s (line %s)' % (warning[1], line)
+            self.warn(warning)
+
+    def _check_rst_data(self, data):
+        """Returns warnings when the provided data doesn't compile."""
+        # the include and csv_table directives need this to be a path
+        source_path = self.distribution.script_name or 'setup.py'
+        parser = Parser()
+        settings = frontend.OptionParser(components=(Parser,)).get_default_values()
+        settings.tab_width = 4
+        settings.pep_references = None
+        settings.rfc_references = None
+        reporter = SilentReporter(source_path,
+                          settings.report_level,
+                          settings.halt_level,
+                          stream=settings.warning_stream,
+                          debug=settings.debug,
+                          encoding=settings.error_encoding,
+                          error_handler=settings.error_encoding_error_handler)
+
+        document = nodes.document(settings, reporter, source=source_path)
+        document.note_source(source_path, -1)
+        try:
+            parser.parse(data, document)
+        except AttributeError as e:
+            reporter.messages.append(
+                (-1, 'Could not finish the parsing: %s.' % e, '', {}))
+
+        return reporter.messages
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/clean.py b/venv/Lib/site-packages/setuptools/_distutils/command/clean.py
new file mode 100644
index 000000000..0cb270166
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/clean.py
@@ -0,0 +1,76 @@
+"""distutils.command.clean
+
+Implements the Distutils 'clean' command."""
+
+# contributed by Bastian Kleineidam <calvin@cs.uni-sb.de>, added 2000-03-18
+
+import os
+from distutils.core import Command
+from distutils.dir_util import remove_tree
+from distutils import log
+
+class clean(Command):
+
+    description = "clean up temporary files from 'build' command"
+    user_options = [
+        ('build-base=', 'b',
+         "base build directory (default: 'build.build-base')"),
+        ('build-lib=', None,
+         "build directory for all modules (default: 'build.build-lib')"),
+        ('build-temp=', 't',
+         "temporary build directory (default: 'build.build-temp')"),
+        ('build-scripts=', None,
+         "build directory for scripts (default: 'build.build-scripts')"),
+        ('bdist-base=', None,
+         "temporary directory for built distributions"),
+        ('all', 'a',
+         "remove all build output, not just temporary by-products")
+    ]
+
+    boolean_options = ['all']
+
+    def initialize_options(self):
+        self.build_base = None
+        self.build_lib = None
+        self.build_temp = None
+        self.build_scripts = None
+        self.bdist_base = None
+        self.all = None
+
+    def finalize_options(self):
+        self.set_undefined_options('build',
+                                   ('build_base', 'build_base'),
+                                   ('build_lib', 'build_lib'),
+                                   ('build_scripts', 'build_scripts'),
+                                   ('build_temp', 'build_temp'))
+        self.set_undefined_options('bdist',
+                                   ('bdist_base', 'bdist_base'))
+
+    def run(self):
+        # remove the build/temp.<plat> directory (unless it's already
+        # gone)
+        if os.path.exists(self.build_temp):
+            remove_tree(self.build_temp, dry_run=self.dry_run)
+        else:
+            log.debug("'%s' does not exist -- can't clean it",
+                      self.build_temp)
+
+        if self.all:
+            # remove build directories
+            for directory in (self.build_lib,
+                              self.bdist_base,
+                              self.build_scripts):
+                if os.path.exists(directory):
+                    remove_tree(directory, dry_run=self.dry_run)
+                else:
+                    log.warn("'%s' does not exist -- can't clean it",
+                             directory)
+
+        # just for the heck of it, try to remove the base build directory:
+        # we might have emptied it right now, but if not we don't care
+        if not self.dry_run:
+            try:
+                os.rmdir(self.build_base)
+                log.info("removing '%s'", self.build_base)
+            except OSError:
+                pass
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/config.py b/venv/Lib/site-packages/setuptools/_distutils/command/config.py
new file mode 100644
index 000000000..aeda408e7
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/config.py
@@ -0,0 +1,344 @@
+"""distutils.command.config
+
+Implements the Distutils 'config' command, a (mostly) empty command class
+that exists mainly to be sub-classed by specific module distributions and
+applications.  The idea is that while every "config" command is different,
+at least they're all named the same, and users always see "config" in the
+list of standard commands.  Also, this is a good place to put common
+configure-like tasks: "try to compile this C code", or "figure out where
+this header file lives".
+"""
+
+import os, re
+
+from distutils.core import Command
+from distutils.errors import DistutilsExecError
+from distutils.sysconfig import customize_compiler
+from distutils import log
+
+LANG_EXT = {"c": ".c", "c++": ".cxx"}
+
+class config(Command):
+
+    description = "prepare to build"
+
+    user_options = [
+        ('compiler=', None,
+         "specify the compiler type"),
+        ('cc=', None,
+         "specify the compiler executable"),
+        ('include-dirs=', 'I',
+         "list of directories to search for header files"),
+        ('define=', 'D',
+         "C preprocessor macros to define"),
+        ('undef=', 'U',
+         "C preprocessor macros to undefine"),
+        ('libraries=', 'l',
+         "external C libraries to link with"),
+        ('library-dirs=', 'L',
+         "directories to search for external C libraries"),
+
+        ('noisy', None,
+         "show every action (compile, link, run, ...) taken"),
+        ('dump-source', None,
+         "dump generated source files before attempting to compile them"),
+        ]
+
+
+    # The three standard command methods: since the "config" command
+    # does nothing by default, these are empty.
+
+    def initialize_options(self):
+        self.compiler = None
+        self.cc = None
+        self.include_dirs = None
+        self.libraries = None
+        self.library_dirs = None
+
+        # maximal output for now
+        self.noisy = 1
+        self.dump_source = 1
+
+        # list of temporary files generated along-the-way that we have
+        # to clean at some point
+        self.temp_files = []
+
+    def finalize_options(self):
+        if self.include_dirs is None:
+            self.include_dirs = self.distribution.include_dirs or []
+        elif isinstance(self.include_dirs, str):
+            self.include_dirs = self.include_dirs.split(os.pathsep)
+
+        if self.libraries is None:
+            self.libraries = []
+        elif isinstance(self.libraries, str):
+            self.libraries = [self.libraries]
+
+        if self.library_dirs is None:
+            self.library_dirs = []
+        elif isinstance(self.library_dirs, str):
+            self.library_dirs = self.library_dirs.split(os.pathsep)
+
+    def run(self):
+        pass
+
+    # Utility methods for actual "config" commands.  The interfaces are
+    # loosely based on Autoconf macros of similar names.  Sub-classes
+    # may use these freely.
+
+    def _check_compiler(self):
+        """Check that 'self.compiler' really is a CCompiler object;
+        if not, make it one.
+        """
+        # We do this late, and only on-demand, because this is an expensive
+        # import.
+        from distutils.ccompiler import CCompiler, new_compiler
+        if not isinstance(self.compiler, CCompiler):
+            self.compiler = new_compiler(compiler=self.compiler,
+                                         dry_run=self.dry_run, force=1)
+            customize_compiler(self.compiler)
+            if self.include_dirs:
+                self.compiler.set_include_dirs(self.include_dirs)
+            if self.libraries:
+                self.compiler.set_libraries(self.libraries)
+            if self.library_dirs:
+                self.compiler.set_library_dirs(self.library_dirs)
+
+    def _gen_temp_sourcefile(self, body, headers, lang):
+        filename = "_configtest" + LANG_EXT[lang]
+        with open(filename, "w") as file:
+            if headers:
+                for header in headers:
+                    file.write("#include <%s>\n" % header)
+                file.write("\n")
+            file.write(body)
+            if body[-1] != "\n":
+                file.write("\n")
+        return filename
+
+    def _preprocess(self, body, headers, include_dirs, lang):
+        src = self._gen_temp_sourcefile(body, headers, lang)
+        out = "_configtest.i"
+        self.temp_files.extend([src, out])
+        self.compiler.preprocess(src, out, include_dirs=include_dirs)
+        return (src, out)
+
+    def _compile(self, body, headers, include_dirs, lang):
+        src = self._gen_temp_sourcefile(body, headers, lang)
+        if self.dump_source:
+            dump_file(src, "compiling '%s':" % src)
+        (obj,) = self.compiler.object_filenames([src])
+        self.temp_files.extend([src, obj])
+        self.compiler.compile([src], include_dirs=include_dirs)
+        return (src, obj)
+
+    def _link(self, body, headers, include_dirs, libraries, library_dirs,
+              lang):
+        (src, obj) = self._compile(body, headers, include_dirs, lang)
+        prog = os.path.splitext(os.path.basename(src))[0]
+        self.compiler.link_executable([obj], prog,
+                                      libraries=libraries,
+                                      library_dirs=library_dirs,
+                                      target_lang=lang)
+
+        if self.compiler.exe_extension is not None:
+            prog = prog + self.compiler.exe_extension
+        self.temp_files.append(prog)
+
+        return (src, obj, prog)
+
+    def _clean(self, *filenames):
+        if not filenames:
+            filenames = self.temp_files
+            self.temp_files = []
+        log.info("removing: %s", ' '.join(filenames))
+        for filename in filenames:
+            try:
+                os.remove(filename)
+            except OSError:
+                pass
+
+
+    # XXX these ignore the dry-run flag: what to do, what to do? even if
+    # you want a dry-run build, you still need some sort of configuration
+    # info.  My inclination is to make it up to the real config command to
+    # consult 'dry_run', and assume a default (minimal) configuration if
+    # true.  The problem with trying to do it here is that you'd have to
+    # return either true or false from all the 'try' methods, neither of
+    # which is correct.
+
+    # XXX need access to the header search path and maybe default macros.
+
+    def try_cpp(self, body=None, headers=None, include_dirs=None, lang="c"):
+        """Construct a source file from 'body' (a string containing lines
+        of C/C++ code) and 'headers' (a list of header files to include)
+        and run it through the preprocessor.  Return true if the
+        preprocessor succeeded, false if there were any errors.
+        ('body' probably isn't of much use, but what the heck.)
+        """
+        from distutils.ccompiler import CompileError
+        self._check_compiler()
+        ok = True
+        try:
+            self._preprocess(body, headers, include_dirs, lang)
+        except CompileError:
+            ok = False
+
+        self._clean()
+        return ok
+
+    def search_cpp(self, pattern, body=None, headers=None, include_dirs=None,
+                   lang="c"):
+        """Construct a source file (just like 'try_cpp()'), run it through
+        the preprocessor, and return true if any line of the output matches
+        'pattern'.  'pattern' should either be a compiled regex object or a
+        string containing a regex.  If both 'body' and 'headers' are None,
+        preprocesses an empty file -- which can be useful to determine the
+        symbols the preprocessor and compiler set by default.
+        """
+        self._check_compiler()
+        src, out = self._preprocess(body, headers, include_dirs, lang)
+
+        if isinstance(pattern, str):
+            pattern = re.compile(pattern)
+
+        with open(out) as file:
+            match = False
+            while True:
+                line = file.readline()
+                if line == '':
+                    break
+                if pattern.search(line):
+                    match = True
+                    break
+
+        self._clean()
+        return match
+
+    def try_compile(self, body, headers=None, include_dirs=None, lang="c"):
+        """Try to compile a source file built from 'body' and 'headers'.
+        Return true on success, false otherwise.
+        """
+        from distutils.ccompiler import CompileError
+        self._check_compiler()
+        try:
+            self._compile(body, headers, include_dirs, lang)
+            ok = True
+        except CompileError:
+            ok = False
+
+        log.info(ok and "success!" or "failure.")
+        self._clean()
+        return ok
+
+    def try_link(self, body, headers=None, include_dirs=None, libraries=None,
+                 library_dirs=None, lang="c"):
+        """Try to compile and link a source file, built from 'body' and
+        'headers', to executable form.  Return true on success, false
+        otherwise.
+        """
+        from distutils.ccompiler import CompileError, LinkError
+        self._check_compiler()
+        try:
+            self._link(body, headers, include_dirs,
+                       libraries, library_dirs, lang)
+            ok = True
+        except (CompileError, LinkError):
+            ok = False
+
+        log.info(ok and "success!" or "failure.")
+        self._clean()
+        return ok
+
+    def try_run(self, body, headers=None, include_dirs=None, libraries=None,
+                library_dirs=None, lang="c"):
+        """Try to compile, link to an executable, and run a program
+        built from 'body' and 'headers'.  Return true on success, false
+        otherwise.
+        """
+        from distutils.ccompiler import CompileError, LinkError
+        self._check_compiler()
+        try:
+            src, obj, exe = self._link(body, headers, include_dirs,
+                                       libraries, library_dirs, lang)
+            self.spawn([exe])
+            ok = True
+        except (CompileError, LinkError, DistutilsExecError):
+            ok = False
+
+        log.info(ok and "success!" or "failure.")
+        self._clean()
+        return ok
+
+
+    # -- High-level methods --------------------------------------------
+    # (these are the ones that are actually likely to be useful
+    # when implementing a real-world config command!)
+
+    def check_func(self, func, headers=None, include_dirs=None,
+                   libraries=None, library_dirs=None, decl=0, call=0):
+        """Determine if function 'func' is available by constructing a
+        source file that refers to 'func', and compiles and links it.
+        If everything succeeds, returns true; otherwise returns false.
+
+        The constructed source file starts out by including the header
+        files listed in 'headers'.  If 'decl' is true, it then declares
+        'func' (as "int func()"); you probably shouldn't supply 'headers'
+        and set 'decl' true in the same call, or you might get errors about
+        a conflicting declarations for 'func'.  Finally, the constructed
+        'main()' function either references 'func' or (if 'call' is true)
+        calls it.  'libraries' and 'library_dirs' are used when
+        linking.
+        """
+        self._check_compiler()
+        body = []
+        if decl:
+            body.append("int %s ();" % func)
+        body.append("int main () {")
+        if call:
+            body.append("  %s();" % func)
+        else:
+            body.append("  %s;" % func)
+        body.append("}")
+        body = "\n".join(body) + "\n"
+
+        return self.try_link(body, headers, include_dirs,
+                             libraries, library_dirs)
+
+    def check_lib(self, library, library_dirs=None, headers=None,
+                  include_dirs=None, other_libraries=[]):
+        """Determine if 'library' is available to be linked against,
+        without actually checking that any particular symbols are provided
+        by it.  'headers' will be used in constructing the source file to
+        be compiled, but the only effect of this is to check if all the
+        header files listed are available.  Any libraries listed in
+        'other_libraries' will be included in the link, in case 'library'
+        has symbols that depend on other libraries.
+        """
+        self._check_compiler()
+        return self.try_link("int main (void) { }", headers, include_dirs,
+                             [library] + other_libraries, library_dirs)
+
+    def check_header(self, header, include_dirs=None, library_dirs=None,
+                     lang="c"):
+        """Determine if the system header file named by 'header_file'
+        exists and can be found by the preprocessor; return true if so,
+        false otherwise.
+        """
+        return self.try_cpp(body="/* No body */", headers=[header],
+                            include_dirs=include_dirs)
+
+def dump_file(filename, head=None):
+    """Dumps a file content into log.info.
+
+    If head is not None, will be dumped before the file content.
+    """
+    if head is None:
+        log.info('%s', filename)
+    else:
+        log.info(head)
+    file = open(filename)
+    try:
+        log.info(file.read())
+    finally:
+        file.close()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install.py b/venv/Lib/site-packages/setuptools/_distutils/command/install.py
new file mode 100644
index 000000000..13feeb890
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install.py
@@ -0,0 +1,677 @@
+"""distutils.command.install
+
+Implements the Distutils 'install' command."""
+
+import sys
+import os
+
+from distutils import log
+from distutils.core import Command
+from distutils.debug import DEBUG
+from distutils.sysconfig import get_config_vars
+from distutils.errors import DistutilsPlatformError
+from distutils.file_util import write_file
+from distutils.util import convert_path, subst_vars, change_root
+from distutils.util import get_platform
+from distutils.errors import DistutilsOptionError
+
+from site import USER_BASE
+from site import USER_SITE
+HAS_USER_SITE = True
+
+WINDOWS_SCHEME = {
+    'purelib': '$base/Lib/site-packages',
+    'platlib': '$base/Lib/site-packages',
+    'headers': '$base/Include/$dist_name',
+    'scripts': '$base/Scripts',
+    'data'   : '$base',
+}
+
+INSTALL_SCHEMES = {
+    'unix_prefix': {
+        'purelib': '$base/lib/python$py_version_short/site-packages',
+        'platlib': '$platbase/$platlibdir/python$py_version_short/site-packages',
+        'headers': '$base/include/python$py_version_short$abiflags/$dist_name',
+        'scripts': '$base/bin',
+        'data'   : '$base',
+        },
+    'unix_home': {
+        'purelib': '$base/lib/python',
+        'platlib': '$base/$platlibdir/python',
+        'headers': '$base/include/python/$dist_name',
+        'scripts': '$base/bin',
+        'data'   : '$base',
+        },
+    'nt': WINDOWS_SCHEME,
+    'pypy': {
+        'purelib': '$base/site-packages',
+        'platlib': '$base/site-packages',
+        'headers': '$base/include/$dist_name',
+        'scripts': '$base/bin',
+        'data'   : '$base',
+        },
+    'pypy_nt': {
+        'purelib': '$base/site-packages',
+        'platlib': '$base/site-packages',
+        'headers': '$base/include/$dist_name',
+        'scripts': '$base/Scripts',
+        'data'   : '$base',
+        },
+    }
+
+# user site schemes
+if HAS_USER_SITE:
+    INSTALL_SCHEMES['nt_user'] = {
+        'purelib': '$usersite',
+        'platlib': '$usersite',
+        'headers': '$userbase/Python$py_version_nodot/Include/$dist_name',
+        'scripts': '$userbase/Python$py_version_nodot/Scripts',
+        'data'   : '$userbase',
+        }
+
+    INSTALL_SCHEMES['unix_user'] = {
+        'purelib': '$usersite',
+        'platlib': '$usersite',
+        'headers':
+            '$userbase/include/python$py_version_short$abiflags/$dist_name',
+        'scripts': '$userbase/bin',
+        'data'   : '$userbase',
+        }
+
+# The keys to an installation scheme; if any new types of files are to be
+# installed, be sure to add an entry to every installation scheme above,
+# and to SCHEME_KEYS here.
+SCHEME_KEYS = ('purelib', 'platlib', 'headers', 'scripts', 'data')
+
+
+class install(Command):
+
+    description = "install everything from build directory"
+
+    user_options = [
+        # Select installation scheme and set base director(y|ies)
+        ('prefix=', None,
+         "installation prefix"),
+        ('exec-prefix=', None,
+         "(Unix only) prefix for platform-specific files"),
+        ('home=', None,
+         "(Unix only) home directory to install under"),
+
+        # Or, just set the base director(y|ies)
+        ('install-base=', None,
+         "base installation directory (instead of --prefix or --home)"),
+        ('install-platbase=', None,
+         "base installation directory for platform-specific files " +
+         "(instead of --exec-prefix or --home)"),
+        ('root=', None,
+         "install everything relative to this alternate root directory"),
+
+        # Or, explicitly set the installation scheme
+        ('install-purelib=', None,
+         "installation directory for pure Python module distributions"),
+        ('install-platlib=', None,
+         "installation directory for non-pure module distributions"),
+        ('install-lib=', None,
+         "installation directory for all module distributions " +
+         "(overrides --install-purelib and --install-platlib)"),
+
+        ('install-headers=', None,
+         "installation directory for C/C++ headers"),
+        ('install-scripts=', None,
+         "installation directory for Python scripts"),
+        ('install-data=', None,
+         "installation directory for data files"),
+
+        # Byte-compilation options -- see install_lib.py for details, as
+        # these are duplicated from there (but only install_lib does
+        # anything with them).
+        ('compile', 'c', "compile .py to .pyc [default]"),
+        ('no-compile', None, "don't compile .py files"),
+        ('optimize=', 'O',
+         "also compile with optimization: -O1 for \"python -O\", "
+         "-O2 for \"python -OO\", and -O0 to disable [default: -O0]"),
+
+        # Miscellaneous control options
+        ('force', 'f',
+         "force installation (overwrite any existing files)"),
+        ('skip-build', None,
+         "skip rebuilding everything (for testing/debugging)"),
+
+        # Where to install documentation (eventually!)
+        #('doc-format=', None, "format of documentation to generate"),
+        #('install-man=', None, "directory for Unix man pages"),
+        #('install-html=', None, "directory for HTML documentation"),
+        #('install-info=', None, "directory for GNU info files"),
+
+        ('record=', None,
+         "filename in which to record list of installed files"),
+        ]
+
+    boolean_options = ['compile', 'force', 'skip-build']
+
+    if HAS_USER_SITE:
+        user_options.append(('user', None,
+                             "install in user site-package '%s'" % USER_SITE))
+        boolean_options.append('user')
+
+    negative_opt = {'no-compile' : 'compile'}
+
+
+    def initialize_options(self):
+        """Initializes options."""
+        # High-level options: these select both an installation base
+        # and scheme.
+        self.prefix = None
+        self.exec_prefix = None
+        self.home = None
+        self.user = 0
+
+        # These select only the installation base; it's up to the user to
+        # specify the installation scheme (currently, that means supplying
+        # the --install-{platlib,purelib,scripts,data} options).
+        self.install_base = None
+        self.install_platbase = None
+        self.root = None
+
+        # These options are the actual installation directories; if not
+        # supplied by the user, they are filled in using the installation
+        # scheme implied by prefix/exec-prefix/home and the contents of
+        # that installation scheme.
+        self.install_purelib = None     # for pure module distributions
+        self.install_platlib = None     # non-pure (dists w/ extensions)
+        self.install_headers = None     # for C/C++ headers
+        self.install_lib = None         # set to either purelib or platlib
+        self.install_scripts = None
+        self.install_data = None
+        self.install_userbase = USER_BASE
+        self.install_usersite = USER_SITE
+
+        self.compile = None
+        self.optimize = None
+
+        # Deprecated
+        # These two are for putting non-packagized distributions into their
+        # own directory and creating a .pth file if it makes sense.
+        # 'extra_path' comes from the setup file; 'install_path_file' can
+        # be turned off if it makes no sense to install a .pth file.  (But
+        # better to install it uselessly than to guess wrong and not
+        # install it when it's necessary and would be used!)  Currently,
+        # 'install_path_file' is always true unless some outsider meddles
+        # with it.
+        self.extra_path = None
+        self.install_path_file = 1
+
+        # 'force' forces installation, even if target files are not
+        # out-of-date.  'skip_build' skips running the "build" command,
+        # handy if you know it's not necessary.  'warn_dir' (which is *not*
+        # a user option, it's just there so the bdist_* commands can turn
+        # it off) determines whether we warn about installing to a
+        # directory not in sys.path.
+        self.force = 0
+        self.skip_build = 0
+        self.warn_dir = 1
+
+        # These are only here as a conduit from the 'build' command to the
+        # 'install_*' commands that do the real work.  ('build_base' isn't
+        # actually used anywhere, but it might be useful in future.)  They
+        # are not user options, because if the user told the install
+        # command where the build directory is, that wouldn't affect the
+        # build command.
+        self.build_base = None
+        self.build_lib = None
+
+        # Not defined yet because we don't know anything about
+        # documentation yet.
+        #self.install_man = None
+        #self.install_html = None
+        #self.install_info = None
+
+        self.record = None
+
+
+    # -- Option finalizing methods -------------------------------------
+    # (This is rather more involved than for most commands,
+    # because this is where the policy for installing third-
+    # party Python modules on various platforms given a wide
+    # array of user input is decided.  Yes, it's quite complex!)
+
+    def finalize_options(self):
+        """Finalizes options."""
+        # This method (and its helpers, like 'finalize_unix()',
+        # 'finalize_other()', and 'select_scheme()') is where the default
+        # installation directories for modules, extension modules, and
+        # anything else we care to install from a Python module
+        # distribution.  Thus, this code makes a pretty important policy
+        # statement about how third-party stuff is added to a Python
+        # installation!  Note that the actual work of installation is done
+        # by the relatively simple 'install_*' commands; they just take
+        # their orders from the installation directory options determined
+        # here.
+
+        # Check for errors/inconsistencies in the options; first, stuff
+        # that's wrong on any platform.
+
+        if ((self.prefix or self.exec_prefix or self.home) and
+            (self.install_base or self.install_platbase)):
+            raise DistutilsOptionError(
+                   "must supply either prefix/exec-prefix/home or " +
+                   "install-base/install-platbase -- not both")
+
+        if self.home and (self.prefix or self.exec_prefix):
+            raise DistutilsOptionError(
+                  "must supply either home or prefix/exec-prefix -- not both")
+
+        if self.user and (self.prefix or self.exec_prefix or self.home or
+                self.install_base or self.install_platbase):
+            raise DistutilsOptionError("can't combine user with prefix, "
+                                       "exec_prefix/home, or install_(plat)base")
+
+        # Next, stuff that's wrong (or dubious) only on certain platforms.
+        if os.name != "posix":
+            if self.exec_prefix:
+                self.warn("exec-prefix option ignored on this platform")
+                self.exec_prefix = None
+
+        # Now the interesting logic -- so interesting that we farm it out
+        # to other methods.  The goal of these methods is to set the final
+        # values for the install_{lib,scripts,data,...}  options, using as
+        # input a heady brew of prefix, exec_prefix, home, install_base,
+        # install_platbase, user-supplied versions of
+        # install_{purelib,platlib,lib,scripts,data,...}, and the
+        # INSTALL_SCHEME dictionary above.  Phew!
+
+        self.dump_dirs("pre-finalize_{unix,other}")
+
+        if os.name == 'posix':
+            self.finalize_unix()
+        else:
+            self.finalize_other()
+
+        self.dump_dirs("post-finalize_{unix,other}()")
+
+        # Expand configuration variables, tilde, etc. in self.install_base
+        # and self.install_platbase -- that way, we can use $base or
+        # $platbase in the other installation directories and not worry
+        # about needing recursive variable expansion (shudder).
+
+        py_version = sys.version.split()[0]
+        (prefix, exec_prefix) = get_config_vars('prefix', 'exec_prefix')
+        try:
+            abiflags = sys.abiflags
+        except AttributeError:
+            # sys.abiflags may not be defined on all platforms.
+            abiflags = ''
+        self.config_vars = {'dist_name': self.distribution.get_name(),
+                            'dist_version': self.distribution.get_version(),
+                            'dist_fullname': self.distribution.get_fullname(),
+                            'py_version': py_version,
+                            'py_version_short': '%d.%d' % sys.version_info[:2],
+                            'py_version_nodot': '%d%d' % sys.version_info[:2],
+                            'sys_prefix': prefix,
+                            'prefix': prefix,
+                            'sys_exec_prefix': exec_prefix,
+                            'exec_prefix': exec_prefix,
+                            'abiflags': abiflags,
+                            'platlibdir': getattr(sys, 'platlibdir', 'lib'),
+                           }
+
+        if HAS_USER_SITE:
+            self.config_vars['userbase'] = self.install_userbase
+            self.config_vars['usersite'] = self.install_usersite
+
+        self.expand_basedirs()
+
+        self.dump_dirs("post-expand_basedirs()")
+
+        # Now define config vars for the base directories so we can expand
+        # everything else.
+        self.config_vars['base'] = self.install_base
+        self.config_vars['platbase'] = self.install_platbase
+
+        if DEBUG:
+            from pprint import pprint
+            print("config vars:")
+            pprint(self.config_vars)
+
+        # Expand "~" and configuration variables in the installation
+        # directories.
+        self.expand_dirs()
+
+        self.dump_dirs("post-expand_dirs()")
+
+        # Create directories in the home dir:
+        if self.user:
+            self.create_home_path()
+
+        # Pick the actual directory to install all modules to: either
+        # install_purelib or install_platlib, depending on whether this
+        # module distribution is pure or not.  Of course, if the user
+        # already specified install_lib, use their selection.
+        if self.install_lib is None:
+            if self.distribution.ext_modules: # has extensions: non-pure
+                self.install_lib = self.install_platlib
+            else:
+                self.install_lib = self.install_purelib
+
+
+        # Convert directories from Unix /-separated syntax to the local
+        # convention.
+        self.convert_paths('lib', 'purelib', 'platlib',
+                           'scripts', 'data', 'headers',
+                           'userbase', 'usersite')
+
+        # Deprecated
+        # Well, we're not actually fully completely finalized yet: we still
+        # have to deal with 'extra_path', which is the hack for allowing
+        # non-packagized module distributions (hello, Numerical Python!) to
+        # get their own directories.
+        self.handle_extra_path()
+        self.install_libbase = self.install_lib # needed for .pth file
+        self.install_lib = os.path.join(self.install_lib, self.extra_dirs)
+
+        # If a new root directory was supplied, make all the installation
+        # dirs relative to it.
+        if self.root is not None:
+            self.change_roots('libbase', 'lib', 'purelib', 'platlib',
+                              'scripts', 'data', 'headers')
+
+        self.dump_dirs("after prepending root")
+
+        # Find out the build directories, ie. where to install from.
+        self.set_undefined_options('build',
+                                   ('build_base', 'build_base'),
+                                   ('build_lib', 'build_lib'))
+
+        # Punt on doc directories for now -- after all, we're punting on
+        # documentation completely!
+
+    def dump_dirs(self, msg):
+        """Dumps the list of user options."""
+        if not DEBUG:
+            return
+        from distutils.fancy_getopt import longopt_xlate
+        log.debug(msg + ":")
+        for opt in self.user_options:
+            opt_name = opt[0]
+            if opt_name[-1] == "=":
+                opt_name = opt_name[0:-1]
+            if opt_name in self.negative_opt:
+                opt_name = self.negative_opt[opt_name]
+                opt_name = opt_name.translate(longopt_xlate)
+                val = not getattr(self, opt_name)
+            else:
+                opt_name = opt_name.translate(longopt_xlate)
+                val = getattr(self, opt_name)
+            log.debug("  %s: %s", opt_name, val)
+
+    def finalize_unix(self):
+        """Finalizes options for posix platforms."""
+        if self.install_base is not None or self.install_platbase is not None:
+            if ((self.install_lib is None and
+                 self.install_purelib is None and
+                 self.install_platlib is None) or
+                self.install_headers is None or
+                self.install_scripts is None or
+                self.install_data is None):
+                raise DistutilsOptionError(
+                      "install-base or install-platbase supplied, but "
+                      "installation scheme is incomplete")
+            return
+
+        if self.user:
+            if self.install_userbase is None:
+                raise DistutilsPlatformError(
+                    "User base directory is not specified")
+            self.install_base = self.install_platbase = self.install_userbase
+            self.select_scheme("unix_user")
+        elif self.home is not None:
+            self.install_base = self.install_platbase = self.home
+            self.select_scheme("unix_home")
+        else:
+            if self.prefix is None:
+                if self.exec_prefix is not None:
+                    raise DistutilsOptionError(
+                          "must not supply exec-prefix without prefix")
+
+                self.prefix = os.path.normpath(sys.prefix)
+                self.exec_prefix = os.path.normpath(sys.exec_prefix)
+
+            else:
+                if self.exec_prefix is None:
+                    self.exec_prefix = self.prefix
+
+            self.install_base = self.prefix
+            self.install_platbase = self.exec_prefix
+            self.select_scheme("unix_prefix")
+
+    def finalize_other(self):
+        """Finalizes options for non-posix platforms"""
+        if self.user:
+            if self.install_userbase is None:
+                raise DistutilsPlatformError(
+                    "User base directory is not specified")
+            self.install_base = self.install_platbase = self.install_userbase
+            self.select_scheme(os.name + "_user")
+        elif self.home is not None:
+            self.install_base = self.install_platbase = self.home
+            self.select_scheme("unix_home")
+        else:
+            if self.prefix is None:
+                self.prefix = os.path.normpath(sys.prefix)
+
+            self.install_base = self.install_platbase = self.prefix
+            try:
+                self.select_scheme(os.name)
+            except KeyError:
+                raise DistutilsPlatformError(
+                      "I don't know how to install stuff on '%s'" % os.name)
+
+    def select_scheme(self, name):
+        """Sets the install directories by applying the install schemes."""
+        # it's the caller's problem if they supply a bad name!
+        if (hasattr(sys, 'pypy_version_info') and
+                not name.endswith(('_user', '_home'))):
+            if os.name == 'nt':
+                name = 'pypy_nt'
+            else:
+                name = 'pypy'
+        scheme = INSTALL_SCHEMES[name]
+        for key in SCHEME_KEYS:
+            attrname = 'install_' + key
+            if getattr(self, attrname) is None:
+                setattr(self, attrname, scheme[key])
+
+    def _expand_attrs(self, attrs):
+        for attr in attrs:
+            val = getattr(self, attr)
+            if val is not None:
+                if os.name == 'posix' or os.name == 'nt':
+                    val = os.path.expanduser(val)
+                val = subst_vars(val, self.config_vars)
+                setattr(self, attr, val)
+
+    def expand_basedirs(self):
+        """Calls `os.path.expanduser` on install_base, install_platbase and
+        root."""
+        self._expand_attrs(['install_base', 'install_platbase', 'root'])
+
+    def expand_dirs(self):
+        """Calls `os.path.expanduser` on install dirs."""
+        self._expand_attrs(['install_purelib', 'install_platlib',
+                            'install_lib', 'install_headers',
+                            'install_scripts', 'install_data',])
+
+    def convert_paths(self, *names):
+        """Call `convert_path` over `names`."""
+        for name in names:
+            attr = "install_" + name
+            setattr(self, attr, convert_path(getattr(self, attr)))
+
+    def handle_extra_path(self):
+        """Set `path_file` and `extra_dirs` using `extra_path`."""
+        if self.extra_path is None:
+            self.extra_path = self.distribution.extra_path
+
+        if self.extra_path is not None:
+            log.warn(
+                "Distribution option extra_path is deprecated. "
+                "See issue27919 for details."
+            )
+            if isinstance(self.extra_path, str):
+                self.extra_path = self.extra_path.split(',')
+
+            if len(self.extra_path) == 1:
+                path_file = extra_dirs = self.extra_path[0]
+            elif len(self.extra_path) == 2:
+                path_file, extra_dirs = self.extra_path
+            else:
+                raise DistutilsOptionError(
+                      "'extra_path' option must be a list, tuple, or "
+                      "comma-separated string with 1 or 2 elements")
+
+            # convert to local form in case Unix notation used (as it
+            # should be in setup scripts)
+            extra_dirs = convert_path(extra_dirs)
+        else:
+            path_file = None
+            extra_dirs = ''
+
+        # XXX should we warn if path_file and not extra_dirs? (in which
+        # case the path file would be harmless but pointless)
+        self.path_file = path_file
+        self.extra_dirs = extra_dirs
+
+    def change_roots(self, *names):
+        """Change the install directories pointed by name using root."""
+        for name in names:
+            attr = "install_" + name
+            setattr(self, attr, change_root(self.root, getattr(self, attr)))
+
+    def create_home_path(self):
+        """Create directories under ~."""
+        if not self.user:
+            return
+        home = convert_path(os.path.expanduser("~"))
+        for name, path in self.config_vars.items():
+            if path.startswith(home) and not os.path.isdir(path):
+                self.debug_print("os.makedirs('%s', 0o700)" % path)
+                os.makedirs(path, 0o700)
+
+    # -- Command execution methods -------------------------------------
+
+    def run(self):
+        """Runs the command."""
+        # Obviously have to build before we can install
+        if not self.skip_build:
+            self.run_command('build')
+            # If we built for any other platform, we can't install.
+            build_plat = self.distribution.get_command_obj('build').plat_name
+            # check warn_dir - it is a clue that the 'install' is happening
+            # internally, and not to sys.path, so we don't check the platform
+            # matches what we are running.
+            if self.warn_dir and build_plat != get_platform():
+                raise DistutilsPlatformError("Can't install when "
+                                             "cross-compiling")
+
+        # Run all sub-commands (at least those that need to be run)
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+        if self.path_file:
+            self.create_path_file()
+
+        # write list of installed files, if requested.
+        if self.record:
+            outputs = self.get_outputs()
+            if self.root:               # strip any package prefix
+                root_len = len(self.root)
+                for counter in range(len(outputs)):
+                    outputs[counter] = outputs[counter][root_len:]
+            self.execute(write_file,
+                         (self.record, outputs),
+                         "writing list of installed files to '%s'" %
+                         self.record)
+
+        sys_path = map(os.path.normpath, sys.path)
+        sys_path = map(os.path.normcase, sys_path)
+        install_lib = os.path.normcase(os.path.normpath(self.install_lib))
+        if (self.warn_dir and
+            not (self.path_file and self.install_path_file) and
+            install_lib not in sys_path):
+            log.debug(("modules installed to '%s', which is not in "
+                       "Python's module search path (sys.path) -- "
+                       "you'll have to change the search path yourself"),
+                       self.install_lib)
+
+    def create_path_file(self):
+        """Creates the .pth file"""
+        filename = os.path.join(self.install_libbase,
+                                self.path_file + ".pth")
+        if self.install_path_file:
+            self.execute(write_file,
+                         (filename, [self.extra_dirs]),
+                         "creating %s" % filename)
+        else:
+            self.warn("path file '%s' not created" % filename)
+
+
+    # -- Reporting methods ---------------------------------------------
+
+    def get_outputs(self):
+        """Assembles the outputs of all the sub-commands."""
+        outputs = []
+        for cmd_name in self.get_sub_commands():
+            cmd = self.get_finalized_command(cmd_name)
+            # Add the contents of cmd.get_outputs(), ensuring
+            # that outputs doesn't contain duplicate entries
+            for filename in cmd.get_outputs():
+                if filename not in outputs:
+                    outputs.append(filename)
+
+        if self.path_file and self.install_path_file:
+            outputs.append(os.path.join(self.install_libbase,
+                                        self.path_file + ".pth"))
+
+        return outputs
+
+    def get_inputs(self):
+        """Returns the inputs of all the sub-commands"""
+        # XXX gee, this looks familiar ;-(
+        inputs = []
+        for cmd_name in self.get_sub_commands():
+            cmd = self.get_finalized_command(cmd_name)
+            inputs.extend(cmd.get_inputs())
+
+        return inputs
+
+    # -- Predicates for sub-command list -------------------------------
+
+    def has_lib(self):
+        """Returns true if the current distribution has any Python
+        modules to install."""
+        return (self.distribution.has_pure_modules() or
+                self.distribution.has_ext_modules())
+
+    def has_headers(self):
+        """Returns true if the current distribution has any headers to
+        install."""
+        return self.distribution.has_headers()
+
+    def has_scripts(self):
+        """Returns true if the current distribution has any scripts to.
+        install."""
+        return self.distribution.has_scripts()
+
+    def has_data(self):
+        """Returns true if the current distribution has any data to.
+        install."""
+        return self.distribution.has_data_files()
+
+    # 'sub_commands': a list of commands this command might have to run to
+    # get its work done.  See cmd.py for more info.
+    sub_commands = [('install_lib',     has_lib),
+                    ('install_headers', has_headers),
+                    ('install_scripts', has_scripts),
+                    ('install_data',    has_data),
+                    ('install_egg_info', lambda self:True),
+                   ]
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install_data.py b/venv/Lib/site-packages/setuptools/_distutils/command/install_data.py
new file mode 100644
index 000000000..947cd76a9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install_data.py
@@ -0,0 +1,79 @@
+"""distutils.command.install_data
+
+Implements the Distutils 'install_data' command, for installing
+platform-independent data files."""
+
+# contributed by Bastian Kleineidam
+
+import os
+from distutils.core import Command
+from distutils.util import change_root, convert_path
+
+class install_data(Command):
+
+    description = "install data files"
+
+    user_options = [
+        ('install-dir=', 'd',
+         "base directory for installing data files "
+         "(default: installation base dir)"),
+        ('root=', None,
+         "install everything relative to this alternate root directory"),
+        ('force', 'f', "force installation (overwrite existing files)"),
+        ]
+
+    boolean_options = ['force']
+
+    def initialize_options(self):
+        self.install_dir = None
+        self.outfiles = []
+        self.root = None
+        self.force = 0
+        self.data_files = self.distribution.data_files
+        self.warn_dir = 1
+
+    def finalize_options(self):
+        self.set_undefined_options('install',
+                                   ('install_data', 'install_dir'),
+                                   ('root', 'root'),
+                                   ('force', 'force'),
+                                  )
+
+    def run(self):
+        self.mkpath(self.install_dir)
+        for f in self.data_files:
+            if isinstance(f, str):
+                # it's a simple file, so copy it
+                f = convert_path(f)
+                if self.warn_dir:
+                    self.warn("setup script did not provide a directory for "
+                              "'%s' -- installing right in '%s'" %
+                              (f, self.install_dir))
+                (out, _) = self.copy_file(f, self.install_dir)
+                self.outfiles.append(out)
+            else:
+                # it's a tuple with path to install to and a list of files
+                dir = convert_path(f[0])
+                if not os.path.isabs(dir):
+                    dir = os.path.join(self.install_dir, dir)
+                elif self.root:
+                    dir = change_root(self.root, dir)
+                self.mkpath(dir)
+
+                if f[1] == []:
+                    # If there are no files listed, the user must be
+                    # trying to create an empty directory, so add the
+                    # directory to the list of output files.
+                    self.outfiles.append(dir)
+                else:
+                    # Copy files, adding them to the list of output files.
+                    for data in f[1]:
+                        data = convert_path(data)
+                        (out, _) = self.copy_file(data, dir)
+                        self.outfiles.append(out)
+
+    def get_inputs(self):
+        return self.data_files or []
+
+    def get_outputs(self):
+        return self.outfiles
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install_egg_info.py b/venv/Lib/site-packages/setuptools/_distutils/command/install_egg_info.py
new file mode 100644
index 000000000..0ddc7367c
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install_egg_info.py
@@ -0,0 +1,77 @@
+"""distutils.command.install_egg_info
+
+Implements the Distutils 'install_egg_info' command, for installing
+a package's PKG-INFO metadata."""
+
+
+from distutils.cmd import Command
+from distutils import log, dir_util
+import os, sys, re
+
+class install_egg_info(Command):
+    """Install an .egg-info file for the package"""
+
+    description = "Install package's PKG-INFO metadata as an .egg-info file"
+    user_options = [
+        ('install-dir=', 'd', "directory to install to"),
+    ]
+
+    def initialize_options(self):
+        self.install_dir = None
+
+    def finalize_options(self):
+        self.set_undefined_options('install_lib',('install_dir','install_dir'))
+        basename = "%s-%s-py%d.%d.egg-info" % (
+            to_filename(safe_name(self.distribution.get_name())),
+            to_filename(safe_version(self.distribution.get_version())),
+            *sys.version_info[:2]
+        )
+        self.target = os.path.join(self.install_dir, basename)
+        self.outputs = [self.target]
+
+    def run(self):
+        target = self.target
+        if os.path.isdir(target) and not os.path.islink(target):
+            dir_util.remove_tree(target, dry_run=self.dry_run)
+        elif os.path.exists(target):
+            self.execute(os.unlink,(self.target,),"Removing "+target)
+        elif not os.path.isdir(self.install_dir):
+            self.execute(os.makedirs, (self.install_dir,),
+                         "Creating "+self.install_dir)
+        log.info("Writing %s", target)
+        if not self.dry_run:
+            with open(target, 'w', encoding='UTF-8') as f:
+                self.distribution.metadata.write_pkg_file(f)
+
+    def get_outputs(self):
+        return self.outputs
+
+
+# The following routines are taken from setuptools' pkg_resources module and
+# can be replaced by importing them from pkg_resources once it is included
+# in the stdlib.
+
+def safe_name(name):
+    """Convert an arbitrary string to a standard distribution name
+
+    Any runs of non-alphanumeric/. characters are replaced with a single '-'.
+    """
+    return re.sub('[^A-Za-z0-9.]+', '-', name)
+
+
+def safe_version(version):
+    """Convert an arbitrary string to a standard version string
+
+    Spaces become dots, and all other non-alphanumeric characters become
+    dashes, with runs of multiple dashes condensed to a single dash.
+    """
+    version = version.replace(' ','.')
+    return re.sub('[^A-Za-z0-9.]+', '-', version)
+
+
+def to_filename(name):
+    """Convert a project or version name to its filename-escaped form
+
+    Any '-' characters are currently replaced with '_'.
+    """
+    return name.replace('-','_')
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install_headers.py b/venv/Lib/site-packages/setuptools/_distutils/command/install_headers.py
new file mode 100644
index 000000000..9bb0b18dc
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install_headers.py
@@ -0,0 +1,47 @@
+"""distutils.command.install_headers
+
+Implements the Distutils 'install_headers' command, to install C/C++ header
+files to the Python include directory."""
+
+from distutils.core import Command
+
+
+# XXX force is never used
+class install_headers(Command):
+
+    description = "install C/C++ header files"
+
+    user_options = [('install-dir=', 'd',
+                     "directory to install header files to"),
+                    ('force', 'f',
+                     "force installation (overwrite existing files)"),
+                   ]
+
+    boolean_options = ['force']
+
+    def initialize_options(self):
+        self.install_dir = None
+        self.force = 0
+        self.outfiles = []
+
+    def finalize_options(self):
+        self.set_undefined_options('install',
+                                   ('install_headers', 'install_dir'),
+                                   ('force', 'force'))
+
+
+    def run(self):
+        headers = self.distribution.headers
+        if not headers:
+            return
+
+        self.mkpath(self.install_dir)
+        for header in headers:
+            (out, _) = self.copy_file(header, self.install_dir)
+            self.outfiles.append(out)
+
+    def get_inputs(self):
+        return self.distribution.headers or []
+
+    def get_outputs(self):
+        return self.outfiles
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install_lib.py b/venv/Lib/site-packages/setuptools/_distutils/command/install_lib.py
new file mode 100644
index 000000000..6154cf094
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install_lib.py
@@ -0,0 +1,217 @@
+"""distutils.command.install_lib
+
+Implements the Distutils 'install_lib' command
+(install all Python modules)."""
+
+import os
+import importlib.util
+import sys
+
+from distutils.core import Command
+from distutils.errors import DistutilsOptionError
+
+
+# Extension for Python source files.
+PYTHON_SOURCE_EXTENSION = ".py"
+
+class install_lib(Command):
+
+    description = "install all Python modules (extensions and pure Python)"
+
+    # The byte-compilation options are a tad confusing.  Here are the
+    # possible scenarios:
+    #   1) no compilation at all (--no-compile --no-optimize)
+    #   2) compile .pyc only (--compile --no-optimize; default)
+    #   3) compile .pyc and "opt-1" .pyc (--compile --optimize)
+    #   4) compile "opt-1" .pyc only (--no-compile --optimize)
+    #   5) compile .pyc and "opt-2" .pyc (--compile --optimize-more)
+    #   6) compile "opt-2" .pyc only (--no-compile --optimize-more)
+    #
+    # The UI for this is two options, 'compile' and 'optimize'.
+    # 'compile' is strictly boolean, and only decides whether to
+    # generate .pyc files.  'optimize' is three-way (0, 1, or 2), and
+    # decides both whether to generate .pyc files and what level of
+    # optimization to use.
+
+    user_options = [
+        ('install-dir=', 'd', "directory to install to"),
+        ('build-dir=','b', "build directory (where to install from)"),
+        ('force', 'f', "force installation (overwrite existing files)"),
+        ('compile', 'c', "compile .py to .pyc [default]"),
+        ('no-compile', None, "don't compile .py files"),
+        ('optimize=', 'O',
+         "also compile with optimization: -O1 for \"python -O\", "
+         "-O2 for \"python -OO\", and -O0 to disable [default: -O0]"),
+        ('skip-build', None, "skip the build steps"),
+        ]
+
+    boolean_options = ['force', 'compile', 'skip-build']
+    negative_opt = {'no-compile' : 'compile'}
+
+    def initialize_options(self):
+        # let the 'install' command dictate our installation directory
+        self.install_dir = None
+        self.build_dir = None
+        self.force = 0
+        self.compile = None
+        self.optimize = None
+        self.skip_build = None
+
+    def finalize_options(self):
+        # Get all the information we need to install pure Python modules
+        # from the umbrella 'install' command -- build (source) directory,
+        # install (target) directory, and whether to compile .py files.
+        self.set_undefined_options('install',
+                                   ('build_lib', 'build_dir'),
+                                   ('install_lib', 'install_dir'),
+                                   ('force', 'force'),
+                                   ('compile', 'compile'),
+                                   ('optimize', 'optimize'),
+                                   ('skip_build', 'skip_build'),
+                                  )
+
+        if self.compile is None:
+            self.compile = True
+        if self.optimize is None:
+            self.optimize = False
+
+        if not isinstance(self.optimize, int):
+            try:
+                self.optimize = int(self.optimize)
+                if self.optimize not in (0, 1, 2):
+                    raise AssertionError
+            except (ValueError, AssertionError):
+                raise DistutilsOptionError("optimize must be 0, 1, or 2")
+
+    def run(self):
+        # Make sure we have built everything we need first
+        self.build()
+
+        # Install everything: simply dump the entire contents of the build
+        # directory to the installation directory (that's the beauty of
+        # having a build directory!)
+        outfiles = self.install()
+
+        # (Optionally) compile .py to .pyc
+        if outfiles is not None and self.distribution.has_pure_modules():
+            self.byte_compile(outfiles)
+
+    # -- Top-level worker functions ------------------------------------
+    # (called from 'run()')
+
+    def build(self):
+        if not self.skip_build:
+            if self.distribution.has_pure_modules():
+                self.run_command('build_py')
+            if self.distribution.has_ext_modules():
+                self.run_command('build_ext')
+
+    def install(self):
+        if os.path.isdir(self.build_dir):
+            outfiles = self.copy_tree(self.build_dir, self.install_dir)
+        else:
+            self.warn("'%s' does not exist -- no Python modules to install" %
+                      self.build_dir)
+            return
+        return outfiles
+
+    def byte_compile(self, files):
+        if sys.dont_write_bytecode:
+            self.warn('byte-compiling is disabled, skipping.')
+            return
+
+        from distutils.util import byte_compile
+
+        # Get the "--root" directory supplied to the "install" command,
+        # and use it as a prefix to strip off the purported filename
+        # encoded in bytecode files.  This is far from complete, but it
+        # should at least generate usable bytecode in RPM distributions.
+        install_root = self.get_finalized_command('install').root
+
+        if self.compile:
+            byte_compile(files, optimize=0,
+                         force=self.force, prefix=install_root,
+                         dry_run=self.dry_run)
+        if self.optimize > 0:
+            byte_compile(files, optimize=self.optimize,
+                         force=self.force, prefix=install_root,
+                         verbose=self.verbose, dry_run=self.dry_run)
+
+
+    # -- Utility methods -----------------------------------------------
+
+    def _mutate_outputs(self, has_any, build_cmd, cmd_option, output_dir):
+        if not has_any:
+            return []
+
+        build_cmd = self.get_finalized_command(build_cmd)
+        build_files = build_cmd.get_outputs()
+        build_dir = getattr(build_cmd, cmd_option)
+
+        prefix_len = len(build_dir) + len(os.sep)
+        outputs = []
+        for file in build_files:
+            outputs.append(os.path.join(output_dir, file[prefix_len:]))
+
+        return outputs
+
+    def _bytecode_filenames(self, py_filenames):
+        bytecode_files = []
+        for py_file in py_filenames:
+            # Since build_py handles package data installation, the
+            # list of outputs can contain more than just .py files.
+            # Make sure we only report bytecode for the .py files.
+            ext = os.path.splitext(os.path.normcase(py_file))[1]
+            if ext != PYTHON_SOURCE_EXTENSION:
+                continue
+            if self.compile:
+                bytecode_files.append(importlib.util.cache_from_source(
+                    py_file, optimization=''))
+            if self.optimize > 0:
+                bytecode_files.append(importlib.util.cache_from_source(
+                    py_file, optimization=self.optimize))
+
+        return bytecode_files
+
+
+    # -- External interface --------------------------------------------
+    # (called by outsiders)
+
+    def get_outputs(self):
+        """Return the list of files that would be installed if this command
+        were actually run.  Not affected by the "dry-run" flag or whether
+        modules have actually been built yet.
+        """
+        pure_outputs = \
+            self._mutate_outputs(self.distribution.has_pure_modules(),
+                                 'build_py', 'build_lib',
+                                 self.install_dir)
+        if self.compile:
+            bytecode_outputs = self._bytecode_filenames(pure_outputs)
+        else:
+            bytecode_outputs = []
+
+        ext_outputs = \
+            self._mutate_outputs(self.distribution.has_ext_modules(),
+                                 'build_ext', 'build_lib',
+                                 self.install_dir)
+
+        return pure_outputs + bytecode_outputs + ext_outputs
+
+    def get_inputs(self):
+        """Get the list of files that are input to this command, ie. the
+        files that get installed as they are named in the build tree.
+        The files in this list correspond one-to-one to the output
+        filenames returned by 'get_outputs()'.
+        """
+        inputs = []
+
+        if self.distribution.has_pure_modules():
+            build_py = self.get_finalized_command('build_py')
+            inputs.extend(build_py.get_outputs())
+
+        if self.distribution.has_ext_modules():
+            build_ext = self.get_finalized_command('build_ext')
+            inputs.extend(build_ext.get_outputs())
+
+        return inputs
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/install_scripts.py b/venv/Lib/site-packages/setuptools/_distutils/command/install_scripts.py
new file mode 100644
index 000000000..31a1130ee
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/install_scripts.py
@@ -0,0 +1,60 @@
+"""distutils.command.install_scripts
+
+Implements the Distutils 'install_scripts' command, for installing
+Python scripts."""
+
+# contributed by Bastian Kleineidam
+
+import os
+from distutils.core import Command
+from distutils import log
+from stat import ST_MODE
+
+
+class install_scripts(Command):
+
+    description = "install scripts (Python or otherwise)"
+
+    user_options = [
+        ('install-dir=', 'd', "directory to install scripts to"),
+        ('build-dir=','b', "build directory (where to install from)"),
+        ('force', 'f', "force installation (overwrite existing files)"),
+        ('skip-build', None, "skip the build steps"),
+    ]
+
+    boolean_options = ['force', 'skip-build']
+
+    def initialize_options(self):
+        self.install_dir = None
+        self.force = 0
+        self.build_dir = None
+        self.skip_build = None
+
+    def finalize_options(self):
+        self.set_undefined_options('build', ('build_scripts', 'build_dir'))
+        self.set_undefined_options('install',
+                                   ('install_scripts', 'install_dir'),
+                                   ('force', 'force'),
+                                   ('skip_build', 'skip_build'),
+                                  )
+
+    def run(self):
+        if not self.skip_build:
+            self.run_command('build_scripts')
+        self.outfiles = self.copy_tree(self.build_dir, self.install_dir)
+        if os.name == 'posix':
+            # Set the executable bits (owner, group, and world) on
+            # all the scripts we just installed.
+            for file in self.get_outputs():
+                if self.dry_run:
+                    log.info("changing mode of %s", file)
+                else:
+                    mode = ((os.stat(file)[ST_MODE]) | 0o555) & 0o7777
+                    log.info("changing mode of %s to %o", file, mode)
+                    os.chmod(file, mode)
+
+    def get_inputs(self):
+        return self.distribution.scripts or []
+
+    def get_outputs(self):
+        return self.outfiles or []
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/py37compat.py b/venv/Lib/site-packages/setuptools/_distutils/command/py37compat.py
new file mode 100644
index 000000000..754715a50
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/py37compat.py
@@ -0,0 +1,30 @@
+import sys
+
+
+def _pythonlib_compat():
+    """
+    On Python 3.7 and earlier, distutils would include the Python
+    library. See pypa/distutils#9.
+    """
+    from distutils import sysconfig
+    if not sysconfig.get_config_var('Py_ENABLED_SHARED'):
+        return
+
+    yield 'python{}.{}{}'.format(
+        sys.hexversion >> 24,
+        (sys.hexversion >> 16) & 0xff,
+        sysconfig.get_config_var('ABIFLAGS'),
+    )
+
+
+def compose(f1, f2):
+    return lambda *args, **kwargs: f1(f2(*args, **kwargs))
+
+
+pythonlib = (
+    compose(list, _pythonlib_compat)
+    if sys.version_info < (3, 8)
+    and sys.platform != 'darwin'
+    and sys.platform[:3] != 'aix'
+    else list
+)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/register.py b/venv/Lib/site-packages/setuptools/_distutils/command/register.py
new file mode 100644
index 000000000..0fac94e9e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/register.py
@@ -0,0 +1,304 @@
+"""distutils.command.register
+
+Implements the Distutils 'register' command (register with the repository).
+"""
+
+# created 2002/10/21, Richard Jones
+
+import getpass
+import io
+import urllib.parse, urllib.request
+from warnings import warn
+
+from distutils.core import PyPIRCCommand
+from distutils.errors import *
+from distutils import log
+
+class register(PyPIRCCommand):
+
+    description = ("register the distribution with the Python package index")
+    user_options = PyPIRCCommand.user_options + [
+        ('list-classifiers', None,
+         'list the valid Trove classifiers'),
+        ('strict', None ,
+         'Will stop the registering if the meta-data are not fully compliant')
+        ]
+    boolean_options = PyPIRCCommand.boolean_options + [
+        'verify', 'list-classifiers', 'strict']
+
+    sub_commands = [('check', lambda self: True)]
+
+    def initialize_options(self):
+        PyPIRCCommand.initialize_options(self)
+        self.list_classifiers = 0
+        self.strict = 0
+
+    def finalize_options(self):
+        PyPIRCCommand.finalize_options(self)
+        # setting options for the `check` subcommand
+        check_options = {'strict': ('register', self.strict),
+                         'restructuredtext': ('register', 1)}
+        self.distribution.command_options['check'] = check_options
+
+    def run(self):
+        self.finalize_options()
+        self._set_config()
+
+        # Run sub commands
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+        if self.dry_run:
+            self.verify_metadata()
+        elif self.list_classifiers:
+            self.classifiers()
+        else:
+            self.send_metadata()
+
+    def check_metadata(self):
+        """Deprecated API."""
+        warn("distutils.command.register.check_metadata is deprecated, \
+              use the check command instead", PendingDeprecationWarning)
+        check = self.distribution.get_command_obj('check')
+        check.ensure_finalized()
+        check.strict = self.strict
+        check.restructuredtext = 1
+        check.run()
+
+    def _set_config(self):
+        ''' Reads the configuration file and set attributes.
+        '''
+        config = self._read_pypirc()
+        if config != {}:
+            self.username = config['username']
+            self.password = config['password']
+            self.repository = config['repository']
+            self.realm = config['realm']
+            self.has_config = True
+        else:
+            if self.repository not in ('pypi', self.DEFAULT_REPOSITORY):
+                raise ValueError('%s not found in .pypirc' % self.repository)
+            if self.repository == 'pypi':
+                self.repository = self.DEFAULT_REPOSITORY
+            self.has_config = False
+
+    def classifiers(self):
+        ''' Fetch the list of classifiers from the server.
+        '''
+        url = self.repository+'?:action=list_classifiers'
+        response = urllib.request.urlopen(url)
+        log.info(self._read_pypi_response(response))
+
+    def verify_metadata(self):
+        ''' Send the metadata to the package index server to be checked.
+        '''
+        # send the info to the server and report the result
+        (code, result) = self.post_to_server(self.build_post_data('verify'))
+        log.info('Server response (%s): %s', code, result)
+
+    def send_metadata(self):
+        ''' Send the metadata to the package index server.
+
+            Well, do the following:
+            1. figure who the user is, and then
+            2. send the data as a Basic auth'ed POST.
+
+            First we try to read the username/password from $HOME/.pypirc,
+            which is a ConfigParser-formatted file with a section
+            [distutils] containing username and password entries (both
+            in clear text). Eg:
+
+                [distutils]
+                index-servers =
+                    pypi
+
+                [pypi]
+                username: fred
+                password: sekrit
+
+            Otherwise, to figure who the user is, we offer the user three
+            choices:
+
+             1. use existing login,
+             2. register as a new user, or
+             3. set the password to a random string and email the user.
+
+        '''
+        # see if we can short-cut and get the username/password from the
+        # config
+        if self.has_config:
+            choice = '1'
+            username = self.username
+            password = self.password
+        else:
+            choice = 'x'
+            username = password = ''
+
+        # get the user's login info
+        choices = '1 2 3 4'.split()
+        while choice not in choices:
+            self.announce('''\
+We need to know who you are, so please choose either:
+ 1. use your existing login,
+ 2. register as a new user,
+ 3. have the server generate a new password for you (and email it to you), or
+ 4. quit
+Your selection [default 1]: ''', log.INFO)
+            choice = input()
+            if not choice:
+                choice = '1'
+            elif choice not in choices:
+                print('Please choose one of the four options!')
+
+        if choice == '1':
+            # get the username and password
+            while not username:
+                username = input('Username: ')
+            while not password:
+                password = getpass.getpass('Password: ')
+
+            # set up the authentication
+            auth = urllib.request.HTTPPasswordMgr()
+            host = urllib.parse.urlparse(self.repository)[1]
+            auth.add_password(self.realm, host, username, password)
+            # send the info to the server and report the result
+            code, result = self.post_to_server(self.build_post_data('submit'),
+                auth)
+            self.announce('Server response (%s): %s' % (code, result),
+                          log.INFO)
+
+            # possibly save the login
+            if code == 200:
+                if self.has_config:
+                    # sharing the password in the distribution instance
+                    # so the upload command can reuse it
+                    self.distribution.password = password
+                else:
+                    self.announce(('I can store your PyPI login so future '
+                                   'submissions will be faster.'), log.INFO)
+                    self.announce('(the login will be stored in %s)' % \
+                                  self._get_rc_file(), log.INFO)
+                    choice = 'X'
+                    while choice.lower() not in 'yn':
+                        choice = input('Save your login (y/N)?')
+                        if not choice:
+                            choice = 'n'
+                    if choice.lower() == 'y':
+                        self._store_pypirc(username, password)
+
+        elif choice == '2':
+            data = {':action': 'user'}
+            data['name'] = data['password'] = data['email'] = ''
+            data['confirm'] = None
+            while not data['name']:
+                data['name'] = input('Username: ')
+            while data['password'] != data['confirm']:
+                while not data['password']:
+                    data['password'] = getpass.getpass('Password: ')
+                while not data['confirm']:
+                    data['confirm'] = getpass.getpass(' Confirm: ')
+                if data['password'] != data['confirm']:
+                    data['password'] = ''
+                    data['confirm'] = None
+                    print("Password and confirm don't match!")
+            while not data['email']:
+                data['email'] = input('   EMail: ')
+            code, result = self.post_to_server(data)
+            if code != 200:
+                log.info('Server response (%s): %s', code, result)
+            else:
+                log.info('You will receive an email shortly.')
+                log.info(('Follow the instructions in it to '
+                          'complete registration.'))
+        elif choice == '3':
+            data = {':action': 'password_reset'}
+            data['email'] = ''
+            while not data['email']:
+                data['email'] = input('Your email address: ')
+            code, result = self.post_to_server(data)
+            log.info('Server response (%s): %s', code, result)
+
+    def build_post_data(self, action):
+        # figure the data to send - the metadata plus some additional
+        # information used by the package server
+        meta = self.distribution.metadata
+        data = {
+            ':action': action,
+            'metadata_version' : '1.0',
+            'name': meta.get_name(),
+            'version': meta.get_version(),
+            'summary': meta.get_description(),
+            'home_page': meta.get_url(),
+            'author': meta.get_contact(),
+            'author_email': meta.get_contact_email(),
+            'license': meta.get_licence(),
+            'description': meta.get_long_description(),
+            'keywords': meta.get_keywords(),
+            'platform': meta.get_platforms(),
+            'classifiers': meta.get_classifiers(),
+            'download_url': meta.get_download_url(),
+            # PEP 314
+            'provides': meta.get_provides(),
+            'requires': meta.get_requires(),
+            'obsoletes': meta.get_obsoletes(),
+        }
+        if data['provides'] or data['requires'] or data['obsoletes']:
+            data['metadata_version'] = '1.1'
+        return data
+
+    def post_to_server(self, data, auth=None):
+        ''' Post a query to the server, and return a string response.
+        '''
+        if 'name' in data:
+            self.announce('Registering %s to %s' % (data['name'],
+                                                    self.repository),
+                                                    log.INFO)
+        # Build up the MIME payload for the urllib2 POST data
+        boundary = '--------------GHSKFJDLGDS7543FJKLFHRE75642756743254'
+        sep_boundary = '\n--' + boundary
+        end_boundary = sep_boundary + '--'
+        body = io.StringIO()
+        for key, value in data.items():
+            # handle multiple entries for the same name
+            if type(value) not in (type([]), type( () )):
+                value = [value]
+            for value in value:
+                value = str(value)
+                body.write(sep_boundary)
+                body.write('\nContent-Disposition: form-data; name="%s"'%key)
+                body.write("\n\n")
+                body.write(value)
+                if value and value[-1] == '\r':
+                    body.write('\n')  # write an extra newline (lurve Macs)
+        body.write(end_boundary)
+        body.write("\n")
+        body = body.getvalue().encode("utf-8")
+
+        # build the Request
+        headers = {
+            'Content-type': 'multipart/form-data; boundary=%s; charset=utf-8'%boundary,
+            'Content-length': str(len(body))
+        }
+        req = urllib.request.Request(self.repository, body, headers)
+
+        # handle HTTP and include the Basic Auth handler
+        opener = urllib.request.build_opener(
+            urllib.request.HTTPBasicAuthHandler(password_mgr=auth)
+        )
+        data = ''
+        try:
+            result = opener.open(req)
+        except urllib.error.HTTPError as e:
+            if self.show_response:
+                data = e.fp.read()
+            result = e.code, e.msg
+        except urllib.error.URLError as e:
+            result = 500, str(e)
+        else:
+            if self.show_response:
+                data = self._read_pypi_response(result)
+            result = 200, 'OK'
+        if self.show_response:
+            msg = '\n'.join(('-' * 75, data, '-' * 75))
+            self.announce(msg, log.INFO)
+        return result
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/sdist.py b/venv/Lib/site-packages/setuptools/_distutils/command/sdist.py
new file mode 100644
index 000000000..b4996fcb1
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/sdist.py
@@ -0,0 +1,494 @@
+"""distutils.command.sdist
+
+Implements the Distutils 'sdist' command (create a source distribution)."""
+
+import os
+import sys
+from glob import glob
+from warnings import warn
+
+from distutils.core import Command
+from distutils import dir_util
+from distutils import file_util
+from distutils import archive_util
+from distutils.text_file import TextFile
+from distutils.filelist import FileList
+from distutils import log
+from distutils.util import convert_path
+from distutils.errors import DistutilsTemplateError, DistutilsOptionError
+
+
+def show_formats():
+    """Print all possible values for the 'formats' option (used by
+    the "--help-formats" command-line option).
+    """
+    from distutils.fancy_getopt import FancyGetopt
+    from distutils.archive_util import ARCHIVE_FORMATS
+    formats = []
+    for format in ARCHIVE_FORMATS.keys():
+        formats.append(("formats=" + format, None,
+                        ARCHIVE_FORMATS[format][2]))
+    formats.sort()
+    FancyGetopt(formats).print_help(
+        "List of available source distribution formats:")
+
+
+class sdist(Command):
+
+    description = "create a source distribution (tarball, zip file, etc.)"
+
+    def checking_metadata(self):
+        """Callable used for the check sub-command.
+
+        Placed here so user_options can view it"""
+        return self.metadata_check
+
+    user_options = [
+        ('template=', 't',
+         "name of manifest template file [default: MANIFEST.in]"),
+        ('manifest=', 'm',
+         "name of manifest file [default: MANIFEST]"),
+        ('use-defaults', None,
+         "include the default file set in the manifest "
+         "[default; disable with --no-defaults]"),
+        ('no-defaults', None,
+         "don't include the default file set"),
+        ('prune', None,
+         "specifically exclude files/directories that should not be "
+         "distributed (build tree, RCS/CVS dirs, etc.) "
+         "[default; disable with --no-prune]"),
+        ('no-prune', None,
+         "don't automatically exclude anything"),
+        ('manifest-only', 'o',
+         "just regenerate the manifest and then stop "
+         "(implies --force-manifest)"),
+        ('force-manifest', 'f',
+         "forcibly regenerate the manifest and carry on as usual. "
+         "Deprecated: now the manifest is always regenerated."),
+        ('formats=', None,
+         "formats for source distribution (comma-separated list)"),
+        ('keep-temp', 'k',
+         "keep the distribution tree around after creating " +
+         "archive file(s)"),
+        ('dist-dir=', 'd',
+         "directory to put the source distribution archive(s) in "
+         "[default: dist]"),
+        ('metadata-check', None,
+         "Ensure that all required elements of meta-data "
+         "are supplied. Warn if any missing. [default]"),
+        ('owner=', 'u',
+         "Owner name used when creating a tar file [default: current user]"),
+        ('group=', 'g',
+         "Group name used when creating a tar file [default: current group]"),
+        ]
+
+    boolean_options = ['use-defaults', 'prune',
+                       'manifest-only', 'force-manifest',
+                       'keep-temp', 'metadata-check']
+
+    help_options = [
+        ('help-formats', None,
+         "list available distribution formats", show_formats),
+        ]
+
+    negative_opt = {'no-defaults': 'use-defaults',
+                    'no-prune': 'prune' }
+
+    sub_commands = [('check', checking_metadata)]
+
+    READMES = ('README', 'README.txt', 'README.rst')
+
+    def initialize_options(self):
+        # 'template' and 'manifest' are, respectively, the names of
+        # the manifest template and manifest file.
+        self.template = None
+        self.manifest = None
+
+        # 'use_defaults': if true, we will include the default file set
+        # in the manifest
+        self.use_defaults = 1
+        self.prune = 1
+
+        self.manifest_only = 0
+        self.force_manifest = 0
+
+        self.formats = ['gztar']
+        self.keep_temp = 0
+        self.dist_dir = None
+
+        self.archive_files = None
+        self.metadata_check = 1
+        self.owner = None
+        self.group = None
+
+    def finalize_options(self):
+        if self.manifest is None:
+            self.manifest = "MANIFEST"
+        if self.template is None:
+            self.template = "MANIFEST.in"
+
+        self.ensure_string_list('formats')
+
+        bad_format = archive_util.check_archive_formats(self.formats)
+        if bad_format:
+            raise DistutilsOptionError(
+                  "unknown archive format '%s'" % bad_format)
+
+        if self.dist_dir is None:
+            self.dist_dir = "dist"
+
+    def run(self):
+        # 'filelist' contains the list of files that will make up the
+        # manifest
+        self.filelist = FileList()
+
+        # Run sub commands
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+        # Do whatever it takes to get the list of files to process
+        # (process the manifest template, read an existing manifest,
+        # whatever).  File list is accumulated in 'self.filelist'.
+        self.get_file_list()
+
+        # If user just wanted us to regenerate the manifest, stop now.
+        if self.manifest_only:
+            return
+
+        # Otherwise, go ahead and create the source distribution tarball,
+        # or zipfile, or whatever.
+        self.make_distribution()
+
+    def check_metadata(self):
+        """Deprecated API."""
+        warn("distutils.command.sdist.check_metadata is deprecated, \
+              use the check command instead", PendingDeprecationWarning)
+        check = self.distribution.get_command_obj('check')
+        check.ensure_finalized()
+        check.run()
+
+    def get_file_list(self):
+        """Figure out the list of files to include in the source
+        distribution, and put it in 'self.filelist'.  This might involve
+        reading the manifest template (and writing the manifest), or just
+        reading the manifest, or just using the default file set -- it all
+        depends on the user's options.
+        """
+        # new behavior when using a template:
+        # the file list is recalculated every time because
+        # even if MANIFEST.in or setup.py are not changed
+        # the user might have added some files in the tree that
+        # need to be included.
+        #
+        #  This makes --force the default and only behavior with templates.
+        template_exists = os.path.isfile(self.template)
+        if not template_exists and self._manifest_is_not_generated():
+            self.read_manifest()
+            self.filelist.sort()
+            self.filelist.remove_duplicates()
+            return
+
+        if not template_exists:
+            self.warn(("manifest template '%s' does not exist " +
+                        "(using default file list)") %
+                        self.template)
+        self.filelist.findall()
+
+        if self.use_defaults:
+            self.add_defaults()
+
+        if template_exists:
+            self.read_template()
+
+        if self.prune:
+            self.prune_file_list()
+
+        self.filelist.sort()
+        self.filelist.remove_duplicates()
+        self.write_manifest()
+
+    def add_defaults(self):
+        """Add all the default files to self.filelist:
+          - README or README.txt
+          - setup.py
+          - test/test*.py
+          - all pure Python modules mentioned in setup script
+          - all files pointed by package_data (build_py)
+          - all files defined in data_files.
+          - all files defined as scripts.
+          - all C sources listed as part of extensions or C libraries
+            in the setup script (doesn't catch C headers!)
+        Warns if (README or README.txt) or setup.py are missing; everything
+        else is optional.
+        """
+        self._add_defaults_standards()
+        self._add_defaults_optional()
+        self._add_defaults_python()
+        self._add_defaults_data_files()
+        self._add_defaults_ext()
+        self._add_defaults_c_libs()
+        self._add_defaults_scripts()
+
+    @staticmethod
+    def _cs_path_exists(fspath):
+        """
+        Case-sensitive path existence check
+
+        >>> sdist._cs_path_exists(__file__)
+        True
+        >>> sdist._cs_path_exists(__file__.upper())
+        False
+        """
+        if not os.path.exists(fspath):
+            return False
+        # make absolute so we always have a directory
+        abspath = os.path.abspath(fspath)
+        directory, filename = os.path.split(abspath)
+        return filename in os.listdir(directory)
+
+    def _add_defaults_standards(self):
+        standards = [self.READMES, self.distribution.script_name]
+        for fn in standards:
+            if isinstance(fn, tuple):
+                alts = fn
+                got_it = False
+                for fn in alts:
+                    if self._cs_path_exists(fn):
+                        got_it = True
+                        self.filelist.append(fn)
+                        break
+
+                if not got_it:
+                    self.warn("standard file not found: should have one of " +
+                              ', '.join(alts))
+            else:
+                if self._cs_path_exists(fn):
+                    self.filelist.append(fn)
+                else:
+                    self.warn("standard file '%s' not found" % fn)
+
+    def _add_defaults_optional(self):
+        optional = ['test/test*.py', 'setup.cfg']
+        for pattern in optional:
+            files = filter(os.path.isfile, glob(pattern))
+            self.filelist.extend(files)
+
+    def _add_defaults_python(self):
+        # build_py is used to get:
+        #  - python modules
+        #  - files defined in package_data
+        build_py = self.get_finalized_command('build_py')
+
+        # getting python files
+        if self.distribution.has_pure_modules():
+            self.filelist.extend(build_py.get_source_files())
+
+        # getting package_data files
+        # (computed in build_py.data_files by build_py.finalize_options)
+        for pkg, src_dir, build_dir, filenames in build_py.data_files:
+            for filename in filenames:
+                self.filelist.append(os.path.join(src_dir, filename))
+
+    def _add_defaults_data_files(self):
+        # getting distribution.data_files
+        if self.distribution.has_data_files():
+            for item in self.distribution.data_files:
+                if isinstance(item, str):
+                    # plain file
+                    item = convert_path(item)
+                    if os.path.isfile(item):
+                        self.filelist.append(item)
+                else:
+                    # a (dirname, filenames) tuple
+                    dirname, filenames = item
+                    for f in filenames:
+                        f = convert_path(f)
+                        if os.path.isfile(f):
+                            self.filelist.append(f)
+
+    def _add_defaults_ext(self):
+        if self.distribution.has_ext_modules():
+            build_ext = self.get_finalized_command('build_ext')
+            self.filelist.extend(build_ext.get_source_files())
+
+    def _add_defaults_c_libs(self):
+        if self.distribution.has_c_libraries():
+            build_clib = self.get_finalized_command('build_clib')
+            self.filelist.extend(build_clib.get_source_files())
+
+    def _add_defaults_scripts(self):
+        if self.distribution.has_scripts():
+            build_scripts = self.get_finalized_command('build_scripts')
+            self.filelist.extend(build_scripts.get_source_files())
+
+    def read_template(self):
+        """Read and parse manifest template file named by self.template.
+
+        (usually "MANIFEST.in") The parsing and processing is done by
+        'self.filelist', which updates itself accordingly.
+        """
+        log.info("reading manifest template '%s'", self.template)
+        template = TextFile(self.template, strip_comments=1, skip_blanks=1,
+                            join_lines=1, lstrip_ws=1, rstrip_ws=1,
+                            collapse_join=1)
+
+        try:
+            while True:
+                line = template.readline()
+                if line is None:            # end of file
+                    break
+
+                try:
+                    self.filelist.process_template_line(line)
+                # the call above can raise a DistutilsTemplateError for
+                # malformed lines, or a ValueError from the lower-level
+                # convert_path function
+                except (DistutilsTemplateError, ValueError) as msg:
+                    self.warn("%s, line %d: %s" % (template.filename,
+                                                   template.current_line,
+                                                   msg))
+        finally:
+            template.close()
+
+    def prune_file_list(self):
+        """Prune off branches that might slip into the file list as created
+        by 'read_template()', but really don't belong there:
+          * the build tree (typically "build")
+          * the release tree itself (only an issue if we ran "sdist"
+            previously with --keep-temp, or it aborted)
+          * any RCS, CVS, .svn, .hg, .git, .bzr, _darcs directories
+        """
+        build = self.get_finalized_command('build')
+        base_dir = self.distribution.get_fullname()
+
+        self.filelist.exclude_pattern(None, prefix=build.build_base)
+        self.filelist.exclude_pattern(None, prefix=base_dir)
+
+        if sys.platform == 'win32':
+            seps = r'/|\\'
+        else:
+            seps = '/'
+
+        vcs_dirs = ['RCS', 'CVS', r'\.svn', r'\.hg', r'\.git', r'\.bzr',
+                    '_darcs']
+        vcs_ptrn = r'(^|%s)(%s)(%s).*' % (seps, '|'.join(vcs_dirs), seps)
+        self.filelist.exclude_pattern(vcs_ptrn, is_regex=1)
+
+    def write_manifest(self):
+        """Write the file list in 'self.filelist' (presumably as filled in
+        by 'add_defaults()' and 'read_template()') to the manifest file
+        named by 'self.manifest'.
+        """
+        if self._manifest_is_not_generated():
+            log.info("not writing to manually maintained "
+                     "manifest file '%s'" % self.manifest)
+            return
+
+        content = self.filelist.files[:]
+        content.insert(0, '# file GENERATED by distutils, do NOT edit')
+        self.execute(file_util.write_file, (self.manifest, content),
+                     "writing manifest file '%s'" % self.manifest)
+
+    def _manifest_is_not_generated(self):
+        # check for special comment used in 3.1.3 and higher
+        if not os.path.isfile(self.manifest):
+            return False
+
+        fp = open(self.manifest)
+        try:
+            first_line = fp.readline()
+        finally:
+            fp.close()
+        return first_line != '# file GENERATED by distutils, do NOT edit\n'
+
+    def read_manifest(self):
+        """Read the manifest file (named by 'self.manifest') and use it to
+        fill in 'self.filelist', the list of files to include in the source
+        distribution.
+        """
+        log.info("reading manifest file '%s'", self.manifest)
+        with open(self.manifest) as manifest:
+            for line in manifest:
+                # ignore comments and blank lines
+                line = line.strip()
+                if line.startswith('#') or not line:
+                    continue
+                self.filelist.append(line)
+
+    def make_release_tree(self, base_dir, files):
+        """Create the directory tree that will become the source
+        distribution archive.  All directories implied by the filenames in
+        'files' are created under 'base_dir', and then we hard link or copy
+        (if hard linking is unavailable) those files into place.
+        Essentially, this duplicates the developer's source tree, but in a
+        directory named after the distribution, containing only the files
+        to be distributed.
+        """
+        # Create all the directories under 'base_dir' necessary to
+        # put 'files' there; the 'mkpath()' is just so we don't die
+        # if the manifest happens to be empty.
+        self.mkpath(base_dir)
+        dir_util.create_tree(base_dir, files, dry_run=self.dry_run)
+
+        # And walk over the list of files, either making a hard link (if
+        # os.link exists) to each one that doesn't already exist in its
+        # corresponding location under 'base_dir', or copying each file
+        # that's out-of-date in 'base_dir'.  (Usually, all files will be
+        # out-of-date, because by default we blow away 'base_dir' when
+        # we're done making the distribution archives.)
+
+        if hasattr(os, 'link'):        # can make hard links on this system
+            link = 'hard'
+            msg = "making hard links in %s..." % base_dir
+        else:                           # nope, have to copy
+            link = None
+            msg = "copying files to %s..." % base_dir
+
+        if not files:
+            log.warn("no files to distribute -- empty manifest?")
+        else:
+            log.info(msg)
+        for file in files:
+            if not os.path.isfile(file):
+                log.warn("'%s' not a regular file -- skipping", file)
+            else:
+                dest = os.path.join(base_dir, file)
+                self.copy_file(file, dest, link=link)
+
+        self.distribution.metadata.write_pkg_info(base_dir)
+
+    def make_distribution(self):
+        """Create the source distribution(s).  First, we create the release
+        tree with 'make_release_tree()'; then, we create all required
+        archive files (according to 'self.formats') from the release tree.
+        Finally, we clean up by blowing away the release tree (unless
+        'self.keep_temp' is true).  The list of archive files created is
+        stored so it can be retrieved later by 'get_archive_files()'.
+        """
+        # Don't warn about missing meta-data here -- should be (and is!)
+        # done elsewhere.
+        base_dir = self.distribution.get_fullname()
+        base_name = os.path.join(self.dist_dir, base_dir)
+
+        self.make_release_tree(base_dir, self.filelist.files)
+        archive_files = []              # remember names of files we create
+        # tar archive must be created last to avoid overwrite and remove
+        if 'tar' in self.formats:
+            self.formats.append(self.formats.pop(self.formats.index('tar')))
+
+        for fmt in self.formats:
+            file = self.make_archive(base_name, fmt, base_dir=base_dir,
+                                     owner=self.owner, group=self.group)
+            archive_files.append(file)
+            self.distribution.dist_files.append(('sdist', '', file))
+
+        self.archive_files = archive_files
+
+        if not self.keep_temp:
+            dir_util.remove_tree(base_dir, dry_run=self.dry_run)
+
+    def get_archive_files(self):
+        """Return the list of archive files created when the command
+        was run, or None if the command hasn't run yet.
+        """
+        return self.archive_files
diff --git a/venv/Lib/site-packages/setuptools/_distutils/command/upload.py b/venv/Lib/site-packages/setuptools/_distutils/command/upload.py
new file mode 100644
index 000000000..95e9fda18
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/command/upload.py
@@ -0,0 +1,214 @@
+"""
+distutils.command.upload
+
+Implements the Distutils 'upload' subcommand (upload package to a package
+index).
+"""
+
+import os
+import io
+import hashlib
+from base64 import standard_b64encode
+from urllib.request import urlopen, Request, HTTPError
+from urllib.parse import urlparse
+from distutils.errors import DistutilsError, DistutilsOptionError
+from distutils.core import PyPIRCCommand
+from distutils.spawn import spawn
+from distutils import log
+
+
+# PyPI Warehouse supports MD5, SHA256, and Blake2 (blake2-256)
+# https://bugs.python.org/issue40698
+_FILE_CONTENT_DIGESTS = {
+    "md5_digest": getattr(hashlib, "md5", None),
+    "sha256_digest": getattr(hashlib, "sha256", None),
+    "blake2_256_digest": getattr(hashlib, "blake2b", None),
+}
+
+
+class upload(PyPIRCCommand):
+
+    description = "upload binary package to PyPI"
+
+    user_options = PyPIRCCommand.user_options + [
+        ('sign', 's',
+         'sign files to upload using gpg'),
+        ('identity=', 'i', 'GPG identity used to sign files'),
+        ]
+
+    boolean_options = PyPIRCCommand.boolean_options + ['sign']
+
+    def initialize_options(self):
+        PyPIRCCommand.initialize_options(self)
+        self.username = ''
+        self.password = ''
+        self.show_response = 0
+        self.sign = False
+        self.identity = None
+
+    def finalize_options(self):
+        PyPIRCCommand.finalize_options(self)
+        if self.identity and not self.sign:
+            raise DistutilsOptionError(
+                "Must use --sign for --identity to have meaning"
+            )
+        config = self._read_pypirc()
+        if config != {}:
+            self.username = config['username']
+            self.password = config['password']
+            self.repository = config['repository']
+            self.realm = config['realm']
+
+        # getting the password from the distribution
+        # if previously set by the register command
+        if not self.password and self.distribution.password:
+            self.password = self.distribution.password
+
+    def run(self):
+        if not self.distribution.dist_files:
+            msg = ("Must create and upload files in one command "
+                   "(e.g. setup.py sdist upload)")
+            raise DistutilsOptionError(msg)
+        for command, pyversion, filename in self.distribution.dist_files:
+            self.upload_file(command, pyversion, filename)
+
+    def upload_file(self, command, pyversion, filename):
+        # Makes sure the repository URL is compliant
+        schema, netloc, url, params, query, fragments = \
+            urlparse(self.repository)
+        if params or query or fragments:
+            raise AssertionError("Incompatible url %s" % self.repository)
+
+        if schema not in ('http', 'https'):
+            raise AssertionError("unsupported schema " + schema)
+
+        # Sign if requested
+        if self.sign:
+            gpg_args = ["gpg", "--detach-sign", "-a", filename]
+            if self.identity:
+                gpg_args[2:2] = ["--local-user", self.identity]
+            spawn(gpg_args,
+                  dry_run=self.dry_run)
+
+        # Fill in the data - send all the meta-data in case we need to
+        # register a new release
+        f = open(filename,'rb')
+        try:
+            content = f.read()
+        finally:
+            f.close()
+
+        meta = self.distribution.metadata
+        data = {
+            # action
+            ':action': 'file_upload',
+            'protocol_version': '1',
+
+            # identify release
+            'name': meta.get_name(),
+            'version': meta.get_version(),
+
+            # file content
+            'content': (os.path.basename(filename),content),
+            'filetype': command,
+            'pyversion': pyversion,
+
+            # additional meta-data
+            'metadata_version': '1.0',
+            'summary': meta.get_description(),
+            'home_page': meta.get_url(),
+            'author': meta.get_contact(),
+            'author_email': meta.get_contact_email(),
+            'license': meta.get_licence(),
+            'description': meta.get_long_description(),
+            'keywords': meta.get_keywords(),
+            'platform': meta.get_platforms(),
+            'classifiers': meta.get_classifiers(),
+            'download_url': meta.get_download_url(),
+            # PEP 314
+            'provides': meta.get_provides(),
+            'requires': meta.get_requires(),
+            'obsoletes': meta.get_obsoletes(),
+            }
+
+        data['comment'] = ''
+
+        # file content digests
+        for digest_name, digest_cons in _FILE_CONTENT_DIGESTS.items():
+            if digest_cons is None:
+                continue
+            try:
+                data[digest_name] = digest_cons(content).hexdigest()
+            except ValueError:
+                # hash digest not available or blocked by security policy
+                pass
+
+        if self.sign:
+            with open(filename + ".asc", "rb") as f:
+                data['gpg_signature'] = (os.path.basename(filename) + ".asc",
+                                         f.read())
+
+        # set up the authentication
+        user_pass = (self.username + ":" + self.password).encode('ascii')
+        # The exact encoding of the authentication string is debated.
+        # Anyway PyPI only accepts ascii for both username or password.
+        auth = "Basic " + standard_b64encode(user_pass).decode('ascii')
+
+        # Build up the MIME payload for the POST data
+        boundary = '--------------GHSKFJDLGDS7543FJKLFHRE75642756743254'
+        sep_boundary = b'\r\n--' + boundary.encode('ascii')
+        end_boundary = sep_boundary + b'--\r\n'
+        body = io.BytesIO()
+        for key, value in data.items():
+            title = '\r\nContent-Disposition: form-data; name="%s"' % key
+            # handle multiple entries for the same name
+            if not isinstance(value, list):
+                value = [value]
+            for value in value:
+                if type(value) is tuple:
+                    title += '; filename="%s"' % value[0]
+                    value = value[1]
+                else:
+                    value = str(value).encode('utf-8')
+                body.write(sep_boundary)
+                body.write(title.encode('utf-8'))
+                body.write(b"\r\n\r\n")
+                body.write(value)
+        body.write(end_boundary)
+        body = body.getvalue()
+
+        msg = "Submitting %s to %s" % (filename, self.repository)
+        self.announce(msg, log.INFO)
+
+        # build the Request
+        headers = {
+            'Content-type': 'multipart/form-data; boundary=%s' % boundary,
+            'Content-length': str(len(body)),
+            'Authorization': auth,
+        }
+
+        request = Request(self.repository, data=body,
+                          headers=headers)
+        # send the data
+        try:
+            result = urlopen(request)
+            status = result.getcode()
+            reason = result.msg
+        except HTTPError as e:
+            status = e.code
+            reason = e.msg
+        except OSError as e:
+            self.announce(str(e), log.ERROR)
+            raise
+
+        if status == 200:
+            self.announce('Server response (%s): %s' % (status, reason),
+                          log.INFO)
+            if self.show_response:
+                text = self._read_pypi_response(result)
+                msg = '\n'.join(('-' * 75, text, '-' * 75))
+                self.announce(msg, log.INFO)
+        else:
+            msg = 'Upload failed (%s): %s' % (status, reason)
+            self.announce(msg, log.ERROR)
+            raise DistutilsError(msg)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/config.py b/venv/Lib/site-packages/setuptools/_distutils/config.py
new file mode 100644
index 000000000..2171abd69
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/config.py
@@ -0,0 +1,130 @@
+"""distutils.pypirc
+
+Provides the PyPIRCCommand class, the base class for the command classes
+that uses .pypirc in the distutils.command package.
+"""
+import os
+from configparser import RawConfigParser
+
+from distutils.cmd import Command
+
+DEFAULT_PYPIRC = """\
+[distutils]
+index-servers =
+    pypi
+
+[pypi]
+username:%s
+password:%s
+"""
+
+class PyPIRCCommand(Command):
+    """Base command that knows how to handle the .pypirc file
+    """
+    DEFAULT_REPOSITORY = 'https://upload.pypi.org/legacy/'
+    DEFAULT_REALM = 'pypi'
+    repository = None
+    realm = None
+
+    user_options = [
+        ('repository=', 'r',
+         "url of repository [default: %s]" % \
+            DEFAULT_REPOSITORY),
+        ('show-response', None,
+         'display full response text from server')]
+
+    boolean_options = ['show-response']
+
+    def _get_rc_file(self):
+        """Returns rc file path."""
+        return os.path.join(os.path.expanduser('~'), '.pypirc')
+
+    def _store_pypirc(self, username, password):
+        """Creates a default .pypirc file."""
+        rc = self._get_rc_file()
+        with os.fdopen(os.open(rc, os.O_CREAT | os.O_WRONLY, 0o600), 'w') as f:
+            f.write(DEFAULT_PYPIRC % (username, password))
+
+    def _read_pypirc(self):
+        """Reads the .pypirc file."""
+        rc = self._get_rc_file()
+        if os.path.exists(rc):
+            self.announce('Using PyPI login from %s' % rc)
+            repository = self.repository or self.DEFAULT_REPOSITORY
+
+            config = RawConfigParser()
+            config.read(rc)
+            sections = config.sections()
+            if 'distutils' in sections:
+                # let's get the list of servers
+                index_servers = config.get('distutils', 'index-servers')
+                _servers = [server.strip() for server in
+                            index_servers.split('\n')
+                            if server.strip() != '']
+                if _servers == []:
+                    # nothing set, let's try to get the default pypi
+                    if 'pypi' in sections:
+                        _servers = ['pypi']
+                    else:
+                        # the file is not properly defined, returning
+                        # an empty dict
+                        return {}
+                for server in _servers:
+                    current = {'server': server}
+                    current['username'] = config.get(server, 'username')
+
+                    # optional params
+                    for key, default in (('repository',
+                                          self.DEFAULT_REPOSITORY),
+                                         ('realm', self.DEFAULT_REALM),
+                                         ('password', None)):
+                        if config.has_option(server, key):
+                            current[key] = config.get(server, key)
+                        else:
+                            current[key] = default
+
+                    # work around people having "repository" for the "pypi"
+                    # section of their config set to the HTTP (rather than
+                    # HTTPS) URL
+                    if (server == 'pypi' and
+                        repository in (self.DEFAULT_REPOSITORY, 'pypi')):
+                        current['repository'] = self.DEFAULT_REPOSITORY
+                        return current
+
+                    if (current['server'] == repository or
+                        current['repository'] == repository):
+                        return current
+            elif 'server-login' in sections:
+                # old format
+                server = 'server-login'
+                if config.has_option(server, 'repository'):
+                    repository = config.get(server, 'repository')
+                else:
+                    repository = self.DEFAULT_REPOSITORY
+                return {'username': config.get(server, 'username'),
+                        'password': config.get(server, 'password'),
+                        'repository': repository,
+                        'server': server,
+                        'realm': self.DEFAULT_REALM}
+
+        return {}
+
+    def _read_pypi_response(self, response):
+        """Read and decode a PyPI HTTP response."""
+        import cgi
+        content_type = response.getheader('content-type', 'text/plain')
+        encoding = cgi.parse_header(content_type)[1].get('charset', 'ascii')
+        return response.read().decode(encoding)
+
+    def initialize_options(self):
+        """Initialize options."""
+        self.repository = None
+        self.realm = None
+        self.show_response = 0
+
+    def finalize_options(self):
+        """Finalizes options."""
+        if self.repository is None:
+            self.repository = self.DEFAULT_REPOSITORY
+        if self.realm is None:
+            self.realm = self.DEFAULT_REALM
diff --git a/venv/Lib/site-packages/setuptools/_distutils/core.py b/venv/Lib/site-packages/setuptools/_distutils/core.py
new file mode 100644
index 000000000..d603d4a45
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/core.py
@@ -0,0 +1,234 @@
+"""distutils.core
+
+The only module that needs to be imported to use the Distutils; provides
+the 'setup' function (which is to be called from the setup script).  Also
+indirectly provides the Distribution and Command classes, although they are
+really defined in distutils.dist and distutils.cmd.
+"""
+
+import os
+import sys
+
+from distutils.debug import DEBUG
+from distutils.errors import *
+
+# Mainly import these so setup scripts can "from distutils.core import" them.
+from distutils.dist import Distribution
+from distutils.cmd import Command
+from distutils.config import PyPIRCCommand
+from distutils.extension import Extension
+
+# This is a barebones help message generated displayed when the user
+# runs the setup script with no arguments at all.  More useful help
+# is generated with various --help options: global help, list commands,
+# and per-command help.
+USAGE = """\
+usage: %(script)s [global_opts] cmd1 [cmd1_opts] [cmd2 [cmd2_opts] ...]
+   or: %(script)s --help [cmd1 cmd2 ...]
+   or: %(script)s --help-commands
+   or: %(script)s cmd --help
+"""
+
+def gen_usage (script_name):
+    script = os.path.basename(script_name)
+    return USAGE % vars()
+
+
+# Some mild magic to control the behaviour of 'setup()' from 'run_setup()'.
+_setup_stop_after = None
+_setup_distribution = None
+
+# Legal keyword arguments for the setup() function
+setup_keywords = ('distclass', 'script_name', 'script_args', 'options',
+                  'name', 'version', 'author', 'author_email',
+                  'maintainer', 'maintainer_email', 'url', 'license',
+                  'description', 'long_description', 'keywords',
+                  'platforms', 'classifiers', 'download_url',
+                  'requires', 'provides', 'obsoletes',
+                  )
+
+# Legal keyword arguments for the Extension constructor
+extension_keywords = ('name', 'sources', 'include_dirs',
+                      'define_macros', 'undef_macros',
+                      'library_dirs', 'libraries', 'runtime_library_dirs',
+                      'extra_objects', 'extra_compile_args', 'extra_link_args',
+                      'swig_opts', 'export_symbols', 'depends', 'language')
+
+def setup (**attrs):
+    """The gateway to the Distutils: do everything your setup script needs
+    to do, in a highly flexible and user-driven way.  Briefly: create a
+    Distribution instance; find and parse config files; parse the command
+    line; run each Distutils command found there, customized by the options
+    supplied to 'setup()' (as keyword arguments), in config files, and on
+    the command line.
+
+    The Distribution instance might be an instance of a class supplied via
+    the 'distclass' keyword argument to 'setup'; if no such class is
+    supplied, then the Distribution class (in dist.py) is instantiated.
+    All other arguments to 'setup' (except for 'cmdclass') are used to set
+    attributes of the Distribution instance.
+
+    The 'cmdclass' argument, if supplied, is a dictionary mapping command
+    names to command classes.  Each command encountered on the command line
+    will be turned into a command class, which is in turn instantiated; any
+    class found in 'cmdclass' is used in place of the default, which is
+    (for command 'foo_bar') class 'foo_bar' in module
+    'distutils.command.foo_bar'.  The command class must provide a
+    'user_options' attribute which is a list of option specifiers for
+    'distutils.fancy_getopt'.  Any command-line options between the current
+    and the next command are used to set attributes of the current command
+    object.
+
+    When the entire command-line has been successfully parsed, calls the
+    'run()' method on each command object in turn.  This method will be
+    driven entirely by the Distribution object (which each command object
+    has a reference to, thanks to its constructor), and the
+    command-specific options that became attributes of each command
+    object.
+    """
+
+    global _setup_stop_after, _setup_distribution
+
+    # Determine the distribution class -- either caller-supplied or
+    # our Distribution (see below).
+    klass = attrs.get('distclass')
+    if klass:
+        del attrs['distclass']
+    else:
+        klass = Distribution
+
+    if 'script_name' not in attrs:
+        attrs['script_name'] = os.path.basename(sys.argv[0])
+    if 'script_args'  not in attrs:
+        attrs['script_args'] = sys.argv[1:]
+
+    # Create the Distribution instance, using the remaining arguments
+    # (ie. everything except distclass) to initialize it
+    try:
+        _setup_distribution = dist = klass(attrs)
+    except DistutilsSetupError as msg:
+        if 'name' not in attrs:
+            raise SystemExit("error in setup command: %s" % msg)
+        else:
+            raise SystemExit("error in %s setup command: %s" % \
+                  (attrs['name'], msg))
+
+    if _setup_stop_after == "init":
+        return dist
+
+    # Find and parse the config file(s): they will override options from
+    # the setup script, but be overridden by the command line.
+    dist.parse_config_files()
+
+    if DEBUG:
+        print("options (after parsing config files):")
+        dist.dump_option_dicts()
+
+    if _setup_stop_after == "config":
+        return dist
+
+    # Parse the command line and override config files; any
+    # command-line errors are the end user's fault, so turn them into
+    # SystemExit to suppress tracebacks.
+    try:
+        ok = dist.parse_command_line()
+    except DistutilsArgError as msg:
+        raise SystemExit(gen_usage(dist.script_name) + "\nerror: %s" % msg)
+
+    if DEBUG:
+        print("options (after parsing command line):")
+        dist.dump_option_dicts()
+
+    if _setup_stop_after == "commandline":
+        return dist
+
+    # And finally, run all the commands found on the command line.
+    if ok:
+        try:
+            dist.run_commands()
+        except KeyboardInterrupt:
+            raise SystemExit("interrupted")
+        except OSError as exc:
+            if DEBUG:
+                sys.stderr.write("error: %s\n" % (exc,))
+                raise
+            else:
+                raise SystemExit("error: %s" % (exc,))
+
+        except (DistutilsError,
+                CCompilerError) as msg:
+            if DEBUG:
+                raise
+            else:
+                raise SystemExit("error: " + str(msg))
+
+    return dist
+
+# setup ()
+
+
+def run_setup (script_name, script_args=None, stop_after="run"):
+    """Run a setup script in a somewhat controlled environment, and
+    return the Distribution instance that drives things.  This is useful
+    if you need to find out the distribution meta-data (passed as
+    keyword args from 'script' to 'setup()', or the contents of the
+    config files or command-line.
+
+    'script_name' is a file that will be read and run with 'exec()';
+    'sys.argv[0]' will be replaced with 'script' for the duration of the
+    call.  'script_args' is a list of strings; if supplied,
+    'sys.argv[1:]' will be replaced by 'script_args' for the duration of
+    the call.
+
+    'stop_after' tells 'setup()' when to stop processing; possible
+    values:
+      init
+        stop after the Distribution instance has been created and
+        populated with the keyword arguments to 'setup()'
+      config
+        stop after config files have been parsed (and their data
+        stored in the Distribution instance)
+      commandline
+        stop after the command-line ('sys.argv[1:]' or 'script_args')
+        have been parsed (and the data stored in the Distribution)
+      run [default]
+        stop after all commands have been run (the same as if 'setup()'
+        had been called in the usual way
+
+    Returns the Distribution instance, which provides all information
+    used to drive the Distutils.
+    """
+    if stop_after not in ('init', 'config', 'commandline', 'run'):
+        raise ValueError("invalid value for 'stop_after': %r" % (stop_after,))
+
+    global _setup_stop_after, _setup_distribution
+    _setup_stop_after = stop_after
+
+    save_argv = sys.argv.copy()
+    g = {'__file__': script_name}
+    try:
+        try:
+            sys.argv[0] = script_name
+            if script_args is not None:
+                sys.argv[1:] = script_args
+            with open(script_name, 'rb') as f:
+                exec(f.read(), g)
+        finally:
+            sys.argv = save_argv
+            _setup_stop_after = None
+    except SystemExit:
+        # Hmm, should we do something if exiting with a non-zero code
+        # (ie. error)?
+        pass
+
+    if _setup_distribution is None:
+        raise RuntimeError(("'distutils.core.setup()' was never called -- "
+               "perhaps '%s' is not a Distutils setup script?") % \
+              script_name)
+
+    # I wonder if the setup script's namespace -- g and l -- would be of
+    # any interest to callers?
+    #print "_setup_distribution:", _setup_distribution
+    return _setup_distribution
+
+# run_setup ()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/cygwinccompiler.py b/venv/Lib/site-packages/setuptools/_distutils/cygwinccompiler.py
new file mode 100644
index 000000000..66c12dd35
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/cygwinccompiler.py
@@ -0,0 +1,403 @@
+"""distutils.cygwinccompiler
+
+Provides the CygwinCCompiler class, a subclass of UnixCCompiler that
+handles the Cygwin port of the GNU C compiler to Windows.  It also contains
+the Mingw32CCompiler class which handles the mingw32 port of GCC (same as
+cygwin in no-cygwin mode).
+"""
+
+# problems:
+#
+# * if you use a msvc compiled python version (1.5.2)
+#   1. you have to insert a __GNUC__ section in its config.h
+#   2. you have to generate an import library for its dll
+#      - create a def-file for python??.dll
+#      - create an import library using
+#             dlltool --dllname python15.dll --def python15.def \
+#                       --output-lib libpython15.a
+#
+#   see also http://starship.python.net/crew/kernr/mingw32/Notes.html
+#
+# * We put export_symbols in a def-file, and don't use
+#   --export-all-symbols because it doesn't worked reliable in some
+#   tested configurations. And because other windows compilers also
+#   need their symbols specified this no serious problem.
+#
+# tested configurations:
+#
+# * cygwin gcc 2.91.57/ld 2.9.4/dllwrap 0.2.4 works
+#   (after patching python's config.h and for C++ some other include files)
+#   see also http://starship.python.net/crew/kernr/mingw32/Notes.html
+# * mingw32 gcc 2.95.2/ld 2.9.4/dllwrap 0.2.4 works
+#   (ld doesn't support -shared, so we use dllwrap)
+# * cygwin gcc 2.95.2/ld 2.10.90/dllwrap 2.10.90 works now
+#   - its dllwrap doesn't work, there is a bug in binutils 2.10.90
+#     see also http://sources.redhat.com/ml/cygwin/2000-06/msg01274.html
+#   - using gcc -mdll instead dllwrap doesn't work without -static because
+#     it tries to link against dlls instead their import libraries. (If
+#     it finds the dll first.)
+#     By specifying -static we force ld to link against the import libraries,
+#     this is windows standard and there are normally not the necessary symbols
+#     in the dlls.
+#   *** only the version of June 2000 shows these problems
+# * cygwin gcc 3.2/ld 2.13.90 works
+#   (ld supports -shared)
+# * mingw gcc 3.2/ld 2.13 works
+#   (ld supports -shared)
+
+import os
+import sys
+import copy
+from subprocess import Popen, PIPE, check_output
+import re
+
+from distutils.unixccompiler import UnixCCompiler
+from distutils.file_util import write_file
+from distutils.errors import (DistutilsExecError, CCompilerError,
+        CompileError, UnknownFileError)
+from distutils.version import LooseVersion
+from distutils.spawn import find_executable
+
+def get_msvcr():
+    """Include the appropriate MSVC runtime library if Python was built
+    with MSVC 7.0 or later.
+    """
+    msc_pos = sys.version.find('MSC v.')
+    if msc_pos != -1:
+        msc_ver = sys.version[msc_pos+6:msc_pos+10]
+        if msc_ver == '1300':
+            # MSVC 7.0
+            return ['msvcr70']
+        elif msc_ver == '1310':
+            # MSVC 7.1
+            return ['msvcr71']
+        elif msc_ver == '1400':
+            # VS2005 / MSVC 8.0
+            return ['msvcr80']
+        elif msc_ver == '1500':
+            # VS2008 / MSVC 9.0
+            return ['msvcr90']
+        elif msc_ver == '1600':
+            # VS2010 / MSVC 10.0
+            return ['msvcr100']
+        else:
+            raise ValueError("Unknown MS Compiler version %s " % msc_ver)
+
+
+class CygwinCCompiler(UnixCCompiler):
+    """ Handles the Cygwin port of the GNU C compiler to Windows.
+    """
+    compiler_type = 'cygwin'
+    obj_extension = ".o"
+    static_lib_extension = ".a"
+    shared_lib_extension = ".dll"
+    static_lib_format = "lib%s%s"
+    shared_lib_format = "%s%s"
+    exe_extension = ".exe"
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+
+        UnixCCompiler.__init__(self, verbose, dry_run, force)
+
+        status, details = check_config_h()
+        self.debug_print("Python's GCC status: %s (details: %s)" %
+                         (status, details))
+        if status is not CONFIG_H_OK:
+            self.warn(
+                "Python's pyconfig.h doesn't seem to support your compiler. "
+                "Reason: %s. "
+                "Compiling may fail because of undefined preprocessor macros."
+                % details)
+
+        self.gcc_version, self.ld_version, self.dllwrap_version = \
+            get_versions()
+        self.debug_print(self.compiler_type + ": gcc %s, ld %s, dllwrap %s\n" %
+                         (self.gcc_version,
+                          self.ld_version,
+                          self.dllwrap_version) )
+
+        # ld_version >= "2.10.90" and < "2.13" should also be able to use
+        # gcc -mdll instead of dllwrap
+        # Older dllwraps had own version numbers, newer ones use the
+        # same as the rest of binutils ( also ld )
+        # dllwrap 2.10.90 is buggy
+        if self.ld_version >= "2.10.90":
+            self.linker_dll = "gcc"
+        else:
+            self.linker_dll = "dllwrap"
+
+        # ld_version >= "2.13" support -shared so use it instead of
+        # -mdll -static
+        if self.ld_version >= "2.13":
+            shared_option = "-shared"
+        else:
+            shared_option = "-mdll -static"
+
+        # Hard-code GCC because that's what this is all about.
+        # XXX optimization, warnings etc. should be customizable.
+        self.set_executables(compiler='gcc -mcygwin -O -Wall',
+                             compiler_so='gcc -mcygwin -mdll -O -Wall',
+                             compiler_cxx='g++ -mcygwin -O -Wall',
+                             linker_exe='gcc -mcygwin',
+                             linker_so=('%s -mcygwin %s' %
+                                        (self.linker_dll, shared_option)))
+
+        # cygwin and mingw32 need different sets of libraries
+        if self.gcc_version == "2.91.57":
+            # cygwin shouldn't need msvcrt, but without the dlls will crash
+            # (gcc version 2.91.57) -- perhaps something about initialization
+            self.dll_libraries=["msvcrt"]
+            self.warn(
+                "Consider upgrading to a newer version of gcc")
+        else:
+            # Include the appropriate MSVC runtime library if Python was built
+            # with MSVC 7.0 or later.
+            self.dll_libraries = get_msvcr()
+
+    def _compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
+        """Compiles the source by spawning GCC and windres if needed."""
+        if ext == '.rc' or ext == '.res':
+            # gcc needs '.res' and '.rc' compiled to object files !!!
+            try:
+                self.spawn(["windres", "-i", src, "-o", obj])
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+        else: # for other files use the C-compiler
+            try:
+                self.spawn(self.compiler_so + cc_args + [src, '-o', obj] +
+                           extra_postargs)
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+    def link(self, target_desc, objects, output_filename, output_dir=None,
+             libraries=None, library_dirs=None, runtime_library_dirs=None,
+             export_symbols=None, debug=0, extra_preargs=None,
+             extra_postargs=None, build_temp=None, target_lang=None):
+        """Link the objects."""
+        # use separate copies, so we can modify the lists
+        extra_preargs = copy.copy(extra_preargs or [])
+        libraries = copy.copy(libraries or [])
+        objects = copy.copy(objects or [])
+
+        # Additional libraries
+        libraries.extend(self.dll_libraries)
+
+        # handle export symbols by creating a def-file
+        # with executables this only works with gcc/ld as linker
+        if ((export_symbols is not None) and
+            (target_desc != self.EXECUTABLE or self.linker_dll == "gcc")):
+            # (The linker doesn't do anything if output is up-to-date.
+            # So it would probably better to check if we really need this,
+            # but for this we had to insert some unchanged parts of
+            # UnixCCompiler, and this is not what we want.)
+
+            # we want to put some files in the same directory as the
+            # object files are, build_temp doesn't help much
+            # where are the object files
+            temp_dir = os.path.dirname(objects[0])
+            # name of dll to give the helper files the same base name
+            (dll_name, dll_extension) = os.path.splitext(
+                os.path.basename(output_filename))
+
+            # generate the filenames for these files
+            def_file = os.path.join(temp_dir, dll_name + ".def")
+            lib_file = os.path.join(temp_dir, 'lib' + dll_name + ".a")
+
+            # Generate .def file
+            contents = [
+                "LIBRARY %s" % os.path.basename(output_filename),
+                "EXPORTS"]
+            for sym in export_symbols:
+                contents.append(sym)
+            self.execute(write_file, (def_file, contents),
+                         "writing %s" % def_file)
+
+            # next add options for def-file and to creating import libraries
+
+            # dllwrap uses different options than gcc/ld
+            if self.linker_dll == "dllwrap":
+                extra_preargs.extend(["--output-lib", lib_file])
+                # for dllwrap we have to use a special option
+                extra_preargs.extend(["--def", def_file])
+            # we use gcc/ld here and can be sure ld is >= 2.9.10
+            else:
+                # doesn't work: bfd_close build\...\libfoo.a: Invalid operation
+                #extra_preargs.extend(["-Wl,--out-implib,%s" % lib_file])
+                # for gcc/ld the def-file is specified as any object files
+                objects.append(def_file)
+
+        #end: if ((export_symbols is not None) and
+        #        (target_desc != self.EXECUTABLE or self.linker_dll == "gcc")):
+
+        # who wants symbols and a many times larger output file
+        # should explicitly switch the debug mode on
+        # otherwise we let dllwrap/ld strip the output file
+        # (On my machine: 10KiB < stripped_file < ??100KiB
+        #   unstripped_file = stripped_file + XXX KiB
+        #  ( XXX=254 for a typical python extension))
+        if not debug:
+            extra_preargs.append("-s")
+
+        UnixCCompiler.link(self, target_desc, objects, output_filename,
+                           output_dir, libraries, library_dirs,
+                           runtime_library_dirs,
+                           None, # export_symbols, we do this in our def-file
+                           debug, extra_preargs, extra_postargs, build_temp,
+                           target_lang)
+
+    # -- Miscellaneous methods -----------------------------------------
+
+    def object_filenames(self, source_filenames, strip_dir=0, output_dir=''):
+        """Adds supports for rc and res files."""
+        if output_dir is None:
+            output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            # use normcase to make sure '.rc' is really '.rc' and not '.RC'
+            base, ext = os.path.splitext(os.path.normcase(src_name))
+            if ext not in (self.src_extensions + ['.rc','.res']):
+                raise UnknownFileError("unknown file type '%s' (from '%s')" % \
+                      (ext, src_name))
+            if strip_dir:
+                base = os.path.basename (base)
+            if ext in ('.res', '.rc'):
+                # these need to be compiled to object files
+                obj_names.append (os.path.join(output_dir,
+                                              base + ext + self.obj_extension))
+            else:
+                obj_names.append (os.path.join(output_dir,
+                                               base + self.obj_extension))
+        return obj_names
+
+# the same as cygwin plus some additional parameters
+class Mingw32CCompiler(CygwinCCompiler):
+    """ Handles the Mingw32 port of the GNU C compiler to Windows.
+    """
+    compiler_type = 'mingw32'
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+
+        CygwinCCompiler.__init__ (self, verbose, dry_run, force)
+
+        # ld_version >= "2.13" support -shared so use it instead of
+        # -mdll -static
+        if self.ld_version >= "2.13":
+            shared_option = "-shared"
+        else:
+            shared_option = "-mdll -static"
+
+        # A real mingw32 doesn't need to specify a different entry point,
+        # but cygwin 2.91.57 in no-cygwin-mode needs it.
+        if self.gcc_version <= "2.91.57":
+            entry_point = '--entry _DllMain@12'
+        else:
+            entry_point = ''
+
+        if is_cygwingcc():
+            raise CCompilerError(
+                'Cygwin gcc cannot be used with --compiler=mingw32')
+
+        self.set_executables(compiler='gcc -O -Wall',
+                             compiler_so='gcc -mdll -O -Wall',
+                             compiler_cxx='g++ -O -Wall',
+                             linker_exe='gcc',
+                             linker_so='%s %s %s'
+                                        % (self.linker_dll, shared_option,
+                                           entry_point))
+        # Maybe we should also append -mthreads, but then the finished
+        # dlls need another dll (mingwm10.dll see Mingw32 docs)
+        # (-mthreads: Support thread-safe exception handling on `Mingw32')
+
+        # no additional libraries needed
+        self.dll_libraries=[]
+
+        # Include the appropriate MSVC runtime library if Python was built
+        # with MSVC 7.0 or later.
+        self.dll_libraries = get_msvcr()
+
+# Because these compilers aren't configured in Python's pyconfig.h file by
+# default, we should at least warn the user if he is using an unmodified
+# version.
+
+CONFIG_H_OK = "ok"
+CONFIG_H_NOTOK = "not ok"
+CONFIG_H_UNCERTAIN = "uncertain"
+
+def check_config_h():
+    """Check if the current Python installation appears amenable to building
+    extensions with GCC.
+
+    Returns a tuple (status, details), where 'status' is one of the following
+    constants:
+
+    - CONFIG_H_OK: all is well, go ahead and compile
+    - CONFIG_H_NOTOK: doesn't look good
+    - CONFIG_H_UNCERTAIN: not sure -- unable to read pyconfig.h
+
+    'details' is a human-readable string explaining the situation.
+
+    Note there are two ways to conclude "OK": either 'sys.version' contains
+    the string "GCC" (implying that this Python was built with GCC), or the
+    installed "pyconfig.h" contains the string "__GNUC__".
+    """
+
+    # XXX since this function also checks sys.version, it's not strictly a
+    # "pyconfig.h" check -- should probably be renamed...
+
+    from distutils import sysconfig
+
+    # if sys.version contains GCC then python was compiled with GCC, and the
+    # pyconfig.h file should be OK
+    if "GCC" in sys.version:
+        return CONFIG_H_OK, "sys.version mentions 'GCC'"
+
+    # let's see if __GNUC__ is mentioned in python.h
+    fn = sysconfig.get_config_h_filename()
+    try:
+        config_h = open(fn)
+        try:
+            if "__GNUC__" in config_h.read():
+                return CONFIG_H_OK, "'%s' mentions '__GNUC__'" % fn
+            else:
+                return CONFIG_H_NOTOK, "'%s' does not mention '__GNUC__'" % fn
+        finally:
+            config_h.close()
+    except OSError as exc:
+        return (CONFIG_H_UNCERTAIN,
+                "couldn't read '%s': %s" % (fn, exc.strerror))
+
+RE_VERSION = re.compile(br'(\d+\.\d+(\.\d+)*)')
+
+def _find_exe_version(cmd):
+    """Find the version of an executable by running `cmd` in the shell.
+
+    If the command is not found, or the output does not match
+    `RE_VERSION`, returns None.
+    """
+    executable = cmd.split()[0]
+    if find_executable(executable) is None:
+        return None
+    out = Popen(cmd, shell=True, stdout=PIPE).stdout
+    try:
+        out_string = out.read()
+    finally:
+        out.close()
+    result = RE_VERSION.search(out_string)
+    if result is None:
+        return None
+    # LooseVersion works with strings
+    # so we need to decode our bytes
+    return LooseVersion(result.group(1).decode())
+
+def get_versions():
+    """ Try to find out the versions of gcc, ld and dllwrap.
+
+    If not possible it returns None for it.
+    """
+    commands = ['gcc -dumpversion', 'ld -v', 'dllwrap --version']
+    return tuple([_find_exe_version(cmd) for cmd in commands])
+
+def is_cygwingcc():
+    '''Try to determine if the gcc that would be used is from cygwin.'''
+    out_string = check_output(['gcc', '-dumpmachine'])
+    return out_string.strip().endswith(b'cygwin')
diff --git a/venv/Lib/site-packages/setuptools/_distutils/debug.py b/venv/Lib/site-packages/setuptools/_distutils/debug.py
new file mode 100644
index 000000000..daf1660f0
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/debug.py
@@ -0,0 +1,5 @@
+import os
+
+# If DISTUTILS_DEBUG is anything other than the empty string, we run in
+# debug mode.
+DEBUG = os.environ.get('DISTUTILS_DEBUG')
diff --git a/venv/Lib/site-packages/setuptools/_distutils/dep_util.py b/venv/Lib/site-packages/setuptools/_distutils/dep_util.py
new file mode 100644
index 000000000..d74f5e4e9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/dep_util.py
@@ -0,0 +1,92 @@
+"""distutils.dep_util
+
+Utility functions for simple, timestamp-based dependency of files
+and groups of files; also, function based entirely on such
+timestamp dependency analysis."""
+
+import os
+from distutils.errors import DistutilsFileError
+
+
+def newer (source, target):
+    """Return true if 'source' exists and is more recently modified than
+    'target', or if 'source' exists and 'target' doesn't.  Return false if
+    both exist and 'target' is the same age or younger than 'source'.
+    Raise DistutilsFileError if 'source' does not exist.
+    """
+    if not os.path.exists(source):
+        raise DistutilsFileError("file '%s' does not exist" %
+                                 os.path.abspath(source))
+    if not os.path.exists(target):
+        return 1
+
+    from stat import ST_MTIME
+    mtime1 = os.stat(source)[ST_MTIME]
+    mtime2 = os.stat(target)[ST_MTIME]
+
+    return mtime1 > mtime2
+
+# newer ()
+
+
+def newer_pairwise (sources, targets):
+    """Walk two filename lists in parallel, testing if each source is newer
+    than its corresponding target.  Return a pair of lists (sources,
+    targets) where source is newer than target, according to the semantics
+    of 'newer()'.
+    """
+    if len(sources) != len(targets):
+        raise ValueError("'sources' and 'targets' must be same length")
+
+    # build a pair of lists (sources, targets) where  source is newer
+    n_sources = []
+    n_targets = []
+    for i in range(len(sources)):
+        if newer(sources[i], targets[i]):
+            n_sources.append(sources[i])
+            n_targets.append(targets[i])
+
+    return (n_sources, n_targets)
+
+# newer_pairwise ()
+
+
+def newer_group (sources, target, missing='error'):
+    """Return true if 'target' is out-of-date with respect to any file
+    listed in 'sources'.  In other words, if 'target' exists and is newer
+    than every file in 'sources', return false; otherwise return true.
+    'missing' controls what we do when a source file is missing; the
+    default ("error") is to blow up with an OSError from inside 'stat()';
+    if it is "ignore", we silently drop any missing source files; if it is
+    "newer", any missing source files make us assume that 'target' is
+    out-of-date (this is handy in "dry-run" mode: it'll make you pretend to
+    carry out commands that wouldn't work because inputs are missing, but
+    that doesn't matter because you're not actually going to run the
+    commands).
+    """
+    # If the target doesn't even exist, then it's definitely out-of-date.
+    if not os.path.exists(target):
+        return 1
+
+    # Otherwise we have to find out the hard way: if *any* source file
+    # is more recent than 'target', then 'target' is out-of-date and
+    # we can immediately return true.  If we fall through to the end
+    # of the loop, then 'target' is up-to-date and we return false.
+    from stat import ST_MTIME
+    target_mtime = os.stat(target)[ST_MTIME]
+    for source in sources:
+        if not os.path.exists(source):
+            if missing == 'error':      # blow up when we stat() the file
+                pass
+            elif missing == 'ignore':   # missing source dropped from
+                continue                #  target's dependency list
+            elif missing == 'newer':    # missing source means target is
+                return 1                #  out-of-date
+
+        source_mtime = os.stat(source)[ST_MTIME]
+        if source_mtime > target_mtime:
+            return 1
+    else:
+        return 0
+
+# newer_group ()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/dir_util.py b/venv/Lib/site-packages/setuptools/_distutils/dir_util.py
new file mode 100644
index 000000000..d5cd8e3e2
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/dir_util.py
@@ -0,0 +1,210 @@
+"""distutils.dir_util
+
+Utility functions for manipulating directories and directory trees."""
+
+import os
+import errno
+from distutils.errors import DistutilsFileError, DistutilsInternalError
+from distutils import log
+
+# cache for by mkpath() -- in addition to cheapening redundant calls,
+# eliminates redundant "creating /foo/bar/baz" messages in dry-run mode
+_path_created = {}
+
+# I don't use os.makedirs because a) it's new to Python 1.5.2, and
+# b) it blows up if the directory already exists (I want to silently
+# succeed in that case).
+def mkpath(name, mode=0o777, verbose=1, dry_run=0):
+    """Create a directory and any missing ancestor directories.
+
+    If the directory already exists (or if 'name' is the empty string, which
+    means the current directory, which of course exists), then do nothing.
+    Raise DistutilsFileError if unable to create some directory along the way
+    (eg. some sub-path exists, but is a file rather than a directory).
+    If 'verbose' is true, print a one-line summary of each mkdir to stdout.
+    Return the list of directories actually created.
+    """
+
+    global _path_created
+
+    # Detect a common bug -- name is None
+    if not isinstance(name, str):
+        raise DistutilsInternalError(
+              "mkpath: 'name' must be a string (got %r)" % (name,))
+
+    # XXX what's the better way to handle verbosity? print as we create
+    # each directory in the path (the current behaviour), or only announce
+    # the creation of the whole path? (quite easy to do the latter since
+    # we're not using a recursive algorithm)
+
+    name = os.path.normpath(name)
+    created_dirs = []
+    if os.path.isdir(name) or name == '':
+        return created_dirs
+    if _path_created.get(os.path.abspath(name)):
+        return created_dirs
+
+    (head, tail) = os.path.split(name)
+    tails = [tail]                      # stack of lone dirs to create
+
+    while head and tail and not os.path.isdir(head):
+        (head, tail) = os.path.split(head)
+        tails.insert(0, tail)          # push next higher dir onto stack
+
+    # now 'head' contains the deepest directory that already exists
+    # (that is, the child of 'head' in 'name' is the highest directory
+    # that does *not* exist)
+    for d in tails:
+        #print "head = %s, d = %s: " % (head, d),
+        head = os.path.join(head, d)
+        abs_head = os.path.abspath(head)
+
+        if _path_created.get(abs_head):
+            continue
+
+        if verbose >= 1:
+            log.info("creating %s", head)
+
+        if not dry_run:
+            try:
+                os.mkdir(head, mode)
+            except OSError as exc:
+                if not (exc.errno == errno.EEXIST and os.path.isdir(head)):
+                    raise DistutilsFileError(
+                          "could not create '%s': %s" % (head, exc.args[-1]))
+            created_dirs.append(head)
+
+        _path_created[abs_head] = 1
+    return created_dirs
+
+def create_tree(base_dir, files, mode=0o777, verbose=1, dry_run=0):
+    """Create all the empty directories under 'base_dir' needed to put 'files'
+    there.
+
+    'base_dir' is just the name of a directory which doesn't necessarily
+    exist yet; 'files' is a list of filenames to be interpreted relative to
+    'base_dir'.  'base_dir' + the directory portion of every file in 'files'
+    will be created if it doesn't already exist.  'mode', 'verbose' and
+    'dry_run' flags are as for 'mkpath()'.
+    """
+    # First get the list of directories to create
+    need_dir = set()
+    for file in files:
+        need_dir.add(os.path.join(base_dir, os.path.dirname(file)))
+
+    # Now create them
+    for dir in sorted(need_dir):
+        mkpath(dir, mode, verbose=verbose, dry_run=dry_run)
+
+def copy_tree(src, dst, preserve_mode=1, preserve_times=1,
+              preserve_symlinks=0, update=0, verbose=1, dry_run=0):
+    """Copy an entire directory tree 'src' to a new location 'dst'.
+
+    Both 'src' and 'dst' must be directory names.  If 'src' is not a
+    directory, raise DistutilsFileError.  If 'dst' does not exist, it is
+    created with 'mkpath()'.  The end result of the copy is that every
+    file in 'src' is copied to 'dst', and directories under 'src' are
+    recursively copied to 'dst'.  Return the list of files that were
+    copied or might have been copied, using their output name.  The
+    return value is unaffected by 'update' or 'dry_run': it is simply
+    the list of all files under 'src', with the names changed to be
+    under 'dst'.
+
+    'preserve_mode' and 'preserve_times' are the same as for
+    'copy_file'; note that they only apply to regular files, not to
+    directories.  If 'preserve_symlinks' is true, symlinks will be
+    copied as symlinks (on platforms that support them!); otherwise
+    (the default), the destination of the symlink will be copied.
+    'update' and 'verbose' are the same as for 'copy_file'.
+    """
+    from distutils.file_util import copy_file
+
+    if not dry_run and not os.path.isdir(src):
+        raise DistutilsFileError(
+              "cannot copy tree '%s': not a directory" % src)
+    try:
+        names = os.listdir(src)
+    except OSError as e:
+        if dry_run:
+            names = []
+        else:
+            raise DistutilsFileError(
+                  "error listing files in '%s': %s" % (src, e.strerror))
+
+    if not dry_run:
+        mkpath(dst, verbose=verbose)
+
+    outputs = []
+
+    for n in names:
+        src_name = os.path.join(src, n)
+        dst_name = os.path.join(dst, n)
+
+        if n.startswith('.nfs'):
+            # skip NFS rename files
+            continue
+
+        if preserve_symlinks and os.path.islink(src_name):
+            link_dest = os.readlink(src_name)
+            if verbose >= 1:
+                log.info("linking %s -> %s", dst_name, link_dest)
+            if not dry_run:
+                os.symlink(link_dest, dst_name)
+            outputs.append(dst_name)
+
+        elif os.path.isdir(src_name):
+            outputs.extend(
+                copy_tree(src_name, dst_name, preserve_mode,
+                          preserve_times, preserve_symlinks, update,
+                          verbose=verbose, dry_run=dry_run))
+        else:
+            copy_file(src_name, dst_name, preserve_mode,
+                      preserve_times, update, verbose=verbose,
+                      dry_run=dry_run)
+            outputs.append(dst_name)
+
+    return outputs
+
+def _build_cmdtuple(path, cmdtuples):
+    """Helper for remove_tree()."""
+    for f in os.listdir(path):
+        real_f = os.path.join(path,f)
+        if os.path.isdir(real_f) and not os.path.islink(real_f):
+            _build_cmdtuple(real_f, cmdtuples)
+        else:
+            cmdtuples.append((os.remove, real_f))
+    cmdtuples.append((os.rmdir, path))
+
+def remove_tree(directory, verbose=1, dry_run=0):
+    """Recursively remove an entire directory tree.
+
+    Any errors are ignored (apart from being reported to stdout if 'verbose'
+    is true).
+    """
+    global _path_created
+
+    if verbose >= 1:
+        log.info("removing '%s' (and everything under it)", directory)
+    if dry_run:
+        return
+    cmdtuples = []
+    _build_cmdtuple(directory, cmdtuples)
+    for cmd in cmdtuples:
+        try:
+            cmd[0](cmd[1])
+            # remove dir from cache if it's already there
+            abspath = os.path.abspath(cmd[1])
+            if abspath in _path_created:
+                del _path_created[abspath]
+        except OSError as exc:
+            log.warn("error removing %s: %s", directory, exc)
+
+def ensure_relative(path):
+    """Take the full path 'path', and make it a relative path.
+
+    This is useful to make 'path' the second argument to os.path.join().
+    """
+    drive, path = os.path.splitdrive(path)
+    if path[0:1] == os.sep:
+        path = drive + path[1:]
+    return path
diff --git a/venv/Lib/site-packages/setuptools/_distutils/dist.py b/venv/Lib/site-packages/setuptools/_distutils/dist.py
new file mode 100644
index 000000000..37db4d6cd
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/dist.py
@@ -0,0 +1,1257 @@
+"""distutils.dist
+
+Provides the Distribution class, which represents the module distribution
+being built/installed/distributed.
+"""
+
+import sys
+import os
+import re
+from email import message_from_file
+
+try:
+    import warnings
+except ImportError:
+    warnings = None
+
+from distutils.errors import *
+from distutils.fancy_getopt import FancyGetopt, translate_longopt
+from distutils.util import check_environ, strtobool, rfc822_escape
+from distutils import log
+from distutils.debug import DEBUG
+
+# Regex to define acceptable Distutils command names.  This is not *quite*
+# the same as a Python NAME -- I don't allow leading underscores.  The fact
+# that they're very similar is no coincidence; the default naming scheme is
+# to look for a Python module named after the command.
+command_re = re.compile(r'^[a-zA-Z]([a-zA-Z0-9_]*)$')
+
+
+def _ensure_list(value, fieldname):
+    if isinstance(value, str):
+        # a string containing comma separated values is okay.  It will
+        # be converted to a list by Distribution.finalize_options().
+        pass
+    elif not isinstance(value, list):
+        # passing a tuple or an iterator perhaps, warn and convert
+        typename = type(value).__name__
+        msg = "Warning: '{fieldname}' should be a list, got type '{typename}'"
+        msg = msg.format(**locals())
+        log.log(log.WARN, msg)
+        value = list(value)
+    return value
+
+
+class Distribution:
+    """The core of the Distutils.  Most of the work hiding behind 'setup'
+    is really done within a Distribution instance, which farms the work out
+    to the Distutils commands specified on the command line.
+
+    Setup scripts will almost never instantiate Distribution directly,
+    unless the 'setup()' function is totally inadequate to their needs.
+    However, it is conceivable that a setup script might wish to subclass
+    Distribution for some specialized purpose, and then pass the subclass
+    to 'setup()' as the 'distclass' keyword argument.  If so, it is
+    necessary to respect the expectations that 'setup' has of Distribution.
+    See the code for 'setup()', in core.py, for details.
+    """
+
+    # 'global_options' describes the command-line options that may be
+    # supplied to the setup script prior to any actual commands.
+    # Eg. "./setup.py -n" or "./setup.py --quiet" both take advantage of
+    # these global options.  This list should be kept to a bare minimum,
+    # since every global option is also valid as a command option -- and we
+    # don't want to pollute the commands with too many options that they
+    # have minimal control over.
+    # The fourth entry for verbose means that it can be repeated.
+    global_options = [
+        ('verbose', 'v', "run verbosely (default)", 1),
+        ('quiet', 'q', "run quietly (turns verbosity off)"),
+        ('dry-run', 'n', "don't actually do anything"),
+        ('help', 'h', "show detailed help message"),
+        ('no-user-cfg', None,
+            'ignore pydistutils.cfg in your home directory'),
+    ]
+
+    # 'common_usage' is a short (2-3 line) string describing the common
+    # usage of the setup script.
+    common_usage = """\
+Common commands: (see '--help-commands' for more)
+
+  setup.py build      will build the package underneath 'build/'
+  setup.py install    will install the package
+"""
+
+    # options that are not propagated to the commands
+    display_options = [
+        ('help-commands', None,
+         "list all available commands"),
+        ('name', None,
+         "print package name"),
+        ('version', 'V',
+         "print package version"),
+        ('fullname', None,
+         "print <package name>-<version>"),
+        ('author', None,
+         "print the author's name"),
+        ('author-email', None,
+         "print the author's email address"),
+        ('maintainer', None,
+         "print the maintainer's name"),
+        ('maintainer-email', None,
+         "print the maintainer's email address"),
+        ('contact', None,
+         "print the maintainer's name if known, else the author's"),
+        ('contact-email', None,
+         "print the maintainer's email address if known, else the author's"),
+        ('url', None,
+         "print the URL for this package"),
+        ('license', None,
+         "print the license of the package"),
+        ('licence', None,
+         "alias for --license"),
+        ('description', None,
+         "print the package description"),
+        ('long-description', None,
+         "print the long package description"),
+        ('platforms', None,
+         "print the list of platforms"),
+        ('classifiers', None,
+         "print the list of classifiers"),
+        ('keywords', None,
+         "print the list of keywords"),
+        ('provides', None,
+         "print the list of packages/modules provided"),
+        ('requires', None,
+         "print the list of packages/modules required"),
+        ('obsoletes', None,
+         "print the list of packages/modules made obsolete")
+        ]
+    display_option_names = [translate_longopt(x[0]) for x in display_options]
+
+    # negative options are options that exclude other options
+    negative_opt = {'quiet': 'verbose'}
+
+    # -- Creation/initialization methods -------------------------------
+
+    def __init__(self, attrs=None):
+        """Construct a new Distribution instance: initialize all the
+        attributes of a Distribution, and then use 'attrs' (a dictionary
+        mapping attribute names to values) to assign some of those
+        attributes their "real" values.  (Any attributes not mentioned in
+        'attrs' will be assigned to some null value: 0, None, an empty list
+        or dictionary, etc.)  Most importantly, initialize the
+        'command_obj' attribute to the empty dictionary; this will be
+        filled in with real command objects by 'parse_command_line()'.
+        """
+
+        # Default values for our command-line options
+        self.verbose = 1
+        self.dry_run = 0
+        self.help = 0
+        for attr in self.display_option_names:
+            setattr(self, attr, 0)
+
+        # Store the distribution meta-data (name, version, author, and so
+        # forth) in a separate object -- we're getting to have enough
+        # information here (and enough command-line options) that it's
+        # worth it.  Also delegate 'get_XXX()' methods to the 'metadata'
+        # object in a sneaky and underhanded (but efficient!) way.
+        self.metadata = DistributionMetadata()
+        for basename in self.metadata._METHOD_BASENAMES:
+            method_name = "get_" + basename
+            setattr(self, method_name, getattr(self.metadata, method_name))
+
+        # 'cmdclass' maps command names to class objects, so we
+        # can 1) quickly figure out which class to instantiate when
+        # we need to create a new command object, and 2) have a way
+        # for the setup script to override command classes
+        self.cmdclass = {}
+
+        # 'command_packages' is a list of packages in which commands
+        # are searched for.  The factory for command 'foo' is expected
+        # to be named 'foo' in the module 'foo' in one of the packages
+        # named here.  This list is searched from the left; an error
+        # is raised if no named package provides the command being
+        # searched for.  (Always access using get_command_packages().)
+        self.command_packages = None
+
+        # 'script_name' and 'script_args' are usually set to sys.argv[0]
+        # and sys.argv[1:], but they can be overridden when the caller is
+        # not necessarily a setup script run from the command-line.
+        self.script_name = None
+        self.script_args = None
+
+        # 'command_options' is where we store command options between
+        # parsing them (from config files, the command-line, etc.) and when
+        # they are actually needed -- ie. when the command in question is
+        # instantiated.  It is a dictionary of dictionaries of 2-tuples:
+        #   command_options = { command_name : { option : (source, value) } }
+        self.command_options = {}
+
+        # 'dist_files' is the list of (command, pyversion, file) that
+        # have been created by any dist commands run so far. This is
+        # filled regardless of whether the run is dry or not. pyversion
+        # gives sysconfig.get_python_version() if the dist file is
+        # specific to a Python version, 'any' if it is good for all
+        # Python versions on the target platform, and '' for a source
+        # file. pyversion should not be used to specify minimum or
+        # maximum required Python versions; use the metainfo for that
+        # instead.
+        self.dist_files = []
+
+        # These options are really the business of various commands, rather
+        # than of the Distribution itself.  We provide aliases for them in
+        # Distribution as a convenience to the developer.
+        self.packages = None
+        self.package_data = {}
+        self.package_dir = None
+        self.py_modules = None
+        self.libraries = None
+        self.headers = None
+        self.ext_modules = None
+        self.ext_package = None
+        self.include_dirs = None
+        self.extra_path = None
+        self.scripts = None
+        self.data_files = None
+        self.password = ''
+
+        # And now initialize bookkeeping stuff that can't be supplied by
+        # the caller at all.  'command_obj' maps command names to
+        # Command instances -- that's how we enforce that every command
+        # class is a singleton.
+        self.command_obj = {}
+
+        # 'have_run' maps command names to boolean values; it keeps track
+        # of whether we have actually run a particular command, to make it
+        # cheap to "run" a command whenever we think we might need to -- if
+        # it's already been done, no need for expensive filesystem
+        # operations, we just check the 'have_run' dictionary and carry on.
+        # It's only safe to query 'have_run' for a command class that has
+        # been instantiated -- a false value will be inserted when the
+        # command object is created, and replaced with a true value when
+        # the command is successfully run.  Thus it's probably best to use
+        # '.get()' rather than a straight lookup.
+        self.have_run = {}
+
+        # Now we'll use the attrs dictionary (ultimately, keyword args from
+        # the setup script) to possibly override any or all of these
+        # distribution options.
+
+        if attrs:
+            # Pull out the set of command options and work on them
+            # specifically.  Note that this order guarantees that aliased
+            # command options will override any supplied redundantly
+            # through the general options dictionary.
+            options = attrs.get('options')
+            if options is not None:
+                del attrs['options']
+                for (command, cmd_options) in options.items():
+                    opt_dict = self.get_option_dict(command)
+                    for (opt, val) in cmd_options.items():
+                        opt_dict[opt] = ("setup script", val)
+
+            if 'licence' in attrs:
+                attrs['license'] = attrs['licence']
+                del attrs['licence']
+                msg = "'licence' distribution option is deprecated; use 'license'"
+                if warnings is not None:
+                    warnings.warn(msg)
+                else:
+                    sys.stderr.write(msg + "\n")
+
+            # Now work on the rest of the attributes.  Any attribute that's
+            # not already defined is invalid!
+            for (key, val) in attrs.items():
+                if hasattr(self.metadata, "set_" + key):
+                    getattr(self.metadata, "set_" + key)(val)
+                elif hasattr(self.metadata, key):
+                    setattr(self.metadata, key, val)
+                elif hasattr(self, key):
+                    setattr(self, key, val)
+                else:
+                    msg = "Unknown distribution option: %s" % repr(key)
+                    warnings.warn(msg)
+
+        # no-user-cfg is handled before other command line args
+        # because other args override the config files, and this
+        # one is needed before we can load the config files.
+        # If attrs['script_args'] wasn't passed, assume false.
+        #
+        # This also make sure we just look at the global options
+        self.want_user_cfg = True
+
+        if self.script_args is not None:
+            for arg in self.script_args:
+                if not arg.startswith('-'):
+                    break
+                if arg == '--no-user-cfg':
+                    self.want_user_cfg = False
+                    break
+
+        self.finalize_options()
+
+    def get_option_dict(self, command):
+        """Get the option dictionary for a given command.  If that
+        command's option dictionary hasn't been created yet, then create it
+        and return the new dictionary; otherwise, return the existing
+        option dictionary.
+        """
+        dict = self.command_options.get(command)
+        if dict is None:
+            dict = self.command_options[command] = {}
+        return dict
+
+    def dump_option_dicts(self, header=None, commands=None, indent=""):
+        from pprint import pformat
+
+        if commands is None:             # dump all command option dicts
+            commands = sorted(self.command_options.keys())
+
+        if header is not None:
+            self.announce(indent + header)
+            indent = indent + "  "
+
+        if not commands:
+            self.announce(indent + "no commands known yet")
+            return
+
+        for cmd_name in commands:
+            opt_dict = self.command_options.get(cmd_name)
+            if opt_dict is None:
+                self.announce(indent +
+                              "no option dict for '%s' command" % cmd_name)
+            else:
+                self.announce(indent +
+                              "option dict for '%s' command:" % cmd_name)
+                out = pformat(opt_dict)
+                for line in out.split('\n'):
+                    self.announce(indent + "  " + line)
+
+    # -- Config file finding/parsing methods ---------------------------
+
+    def find_config_files(self):
+        """Find as many configuration files as should be processed for this
+        platform, and return a list of filenames in the order in which they
+        should be parsed.  The filenames returned are guaranteed to exist
+        (modulo nasty race conditions).
+
+        There are three possible config files: distutils.cfg in the
+        Distutils installation directory (ie. where the top-level
+        Distutils __inst__.py file lives), a file in the user's home
+        directory named .pydistutils.cfg on Unix and pydistutils.cfg
+        on Windows/Mac; and setup.cfg in the current directory.
+
+        The file in the user's home directory can be disabled with the
+        --no-user-cfg option.
+        """
+        files = []
+        check_environ()
+
+        # Where to look for the system-wide Distutils config file
+        sys_dir = os.path.dirname(sys.modules['distutils'].__file__)
+
+        # Look for the system config file
+        sys_file = os.path.join(sys_dir, "distutils.cfg")
+        if os.path.isfile(sys_file):
+            files.append(sys_file)
+
+        # What to call the per-user config file
+        if os.name == 'posix':
+            user_filename = ".pydistutils.cfg"
+        else:
+            user_filename = "pydistutils.cfg"
+
+        # And look for the user config file
+        if self.want_user_cfg:
+            user_file = os.path.join(os.path.expanduser('~'), user_filename)
+            if os.path.isfile(user_file):
+                files.append(user_file)
+
+        # All platforms support local setup.cfg
+        local_file = "setup.cfg"
+        if os.path.isfile(local_file):
+            files.append(local_file)
+
+        if DEBUG:
+            self.announce("using config files: %s" % ', '.join(files))
+
+        return files
+
+    def parse_config_files(self, filenames=None):
+        from configparser import ConfigParser
+
+        # Ignore install directory options if we have a venv
+        if sys.prefix != sys.base_prefix:
+            ignore_options = [
+                'install-base', 'install-platbase', 'install-lib',
+                'install-platlib', 'install-purelib', 'install-headers',
+                'install-scripts', 'install-data', 'prefix', 'exec-prefix',
+                'home', 'user', 'root']
+        else:
+            ignore_options = []
+
+        ignore_options = frozenset(ignore_options)
+
+        if filenames is None:
+            filenames = self.find_config_files()
+
+        if DEBUG:
+            self.announce("Distribution.parse_config_files():")
+
+        parser = ConfigParser()
+        for filename in filenames:
+            if DEBUG:
+                self.announce("  reading %s" % filename)
+            parser.read(filename)
+            for section in parser.sections():
+                options = parser.options(section)
+                opt_dict = self.get_option_dict(section)
+
+                for opt in options:
+                    if opt != '__name__' and opt not in ignore_options:
+                        val = parser.get(section,opt)
+                        opt = opt.replace('-', '_')
+                        opt_dict[opt] = (filename, val)
+
+            # Make the ConfigParser forget everything (so we retain
+            # the original filenames that options come from)
+            parser.__init__()
+
+        # If there was a "global" section in the config file, use it
+        # to set Distribution options.
+
+        if 'global' in self.command_options:
+            for (opt, (src, val)) in self.command_options['global'].items():
+                alias = self.negative_opt.get(opt)
+                try:
+                    if alias:
+                        setattr(self, alias, not strtobool(val))
+                    elif opt in ('verbose', 'dry_run'): # ugh!
+                        setattr(self, opt, strtobool(val))
+                    else:
+                        setattr(self, opt, val)
+                except ValueError as msg:
+                    raise DistutilsOptionError(msg)
+
+    # -- Command-line parsing methods ----------------------------------
+
+    def parse_command_line(self):
+        """Parse the setup script's command line, taken from the
+        'script_args' instance attribute (which defaults to 'sys.argv[1:]'
+        -- see 'setup()' in core.py).  This list is first processed for
+        "global options" -- options that set attributes of the Distribution
+        instance.  Then, it is alternately scanned for Distutils commands
+        and options for that command.  Each new command terminates the
+        options for the previous command.  The allowed options for a
+        command are determined by the 'user_options' attribute of the
+        command class -- thus, we have to be able to load command classes
+        in order to parse the command line.  Any error in that 'options'
+        attribute raises DistutilsGetoptError; any error on the
+        command-line raises DistutilsArgError.  If no Distutils commands
+        were found on the command line, raises DistutilsArgError.  Return
+        true if command-line was successfully parsed and we should carry
+        on with executing commands; false if no errors but we shouldn't
+        execute commands (currently, this only happens if user asks for
+        help).
+        """
+        #
+        # We now have enough information to show the Macintosh dialog
+        # that allows the user to interactively specify the "command line".
+        #
+        toplevel_options = self._get_toplevel_options()
+
+        # We have to parse the command line a bit at a time -- global
+        # options, then the first command, then its options, and so on --
+        # because each command will be handled by a different class, and
+        # the options that are valid for a particular class aren't known
+        # until we have loaded the command class, which doesn't happen
+        # until we know what the command is.
+
+        self.commands = []
+        parser = FancyGetopt(toplevel_options + self.display_options)
+        parser.set_negative_aliases(self.negative_opt)
+        parser.set_aliases({'licence': 'license'})
+        args = parser.getopt(args=self.script_args, object=self)
+        option_order = parser.get_option_order()
+        log.set_verbosity(self.verbose)
+
+        # for display options we return immediately
+        if self.handle_display_options(option_order):
+            return
+        while args:
+            args = self._parse_command_opts(parser, args)
+            if args is None:            # user asked for help (and got it)
+                return
+
+        # Handle the cases of --help as a "global" option, ie.
+        # "setup.py --help" and "setup.py --help command ...".  For the
+        # former, we show global options (--verbose, --dry-run, etc.)
+        # and display-only options (--name, --version, etc.); for the
+        # latter, we omit the display-only options and show help for
+        # each command listed on the command line.
+        if self.help:
+            self._show_help(parser,
+                            display_options=len(self.commands) == 0,
+                            commands=self.commands)
+            return
+
+        # Oops, no commands found -- an end-user error
+        if not self.commands:
+            raise DistutilsArgError("no commands supplied")
+
+        # All is well: return true
+        return True
+
+    def _get_toplevel_options(self):
+        """Return the non-display options recognized at the top level.
+
+        This includes options that are recognized *only* at the top
+        level as well as options recognized for commands.
+        """
+        return self.global_options + [
+            ("command-packages=", None,
+             "list of packages that provide distutils commands"),
+            ]
+
+    def _parse_command_opts(self, parser, args):
+        """Parse the command-line options for a single command.
+        'parser' must be a FancyGetopt instance; 'args' must be the list
+        of arguments, starting with the current command (whose options
+        we are about to parse).  Returns a new version of 'args' with
+        the next command at the front of the list; will be the empty
+        list if there are no more commands on the command line.  Returns
+        None if the user asked for help on this command.
+        """
+        # late import because of mutual dependence between these modules
+        from distutils.cmd import Command
+
+        # Pull the current command from the head of the command line
+        command = args[0]
+        if not command_re.match(command):
+            raise SystemExit("invalid command name '%s'" % command)
+        self.commands.append(command)
+
+        # Dig up the command class that implements this command, so we
+        # 1) know that it's a valid command, and 2) know which options
+        # it takes.
+        try:
+            cmd_class = self.get_command_class(command)
+        except DistutilsModuleError as msg:
+            raise DistutilsArgError(msg)
+
+        # Require that the command class be derived from Command -- want
+        # to be sure that the basic "command" interface is implemented.
+        if not issubclass(cmd_class, Command):
+            raise DistutilsClassError(
+                "command class %s must subclass Command" % cmd_class)
+
+        # Also make sure that the command object provides a list of its
+        # known options.
+        if not (hasattr(cmd_class, 'user_options') and
+                isinstance(cmd_class.user_options, list)):
+            msg = ("command class %s must provide "
+                "'user_options' attribute (a list of tuples)")
+            raise DistutilsClassError(msg % cmd_class)
+
+        # If the command class has a list of negative alias options,
+        # merge it in with the global negative aliases.
+        negative_opt = self.negative_opt
+        if hasattr(cmd_class, 'negative_opt'):
+            negative_opt = negative_opt.copy()
+            negative_opt.update(cmd_class.negative_opt)
+
+        # Check for help_options in command class.  They have a different
+        # format (tuple of four) so we need to preprocess them here.
+        if (hasattr(cmd_class, 'help_options') and
+                isinstance(cmd_class.help_options, list)):
+            help_options = fix_help_options(cmd_class.help_options)
+        else:
+            help_options = []
+
+        # All commands support the global options too, just by adding
+        # in 'global_options'.
+        parser.set_option_table(self.global_options +
+                                cmd_class.user_options +
+                                help_options)
+        parser.set_negative_aliases(negative_opt)
+        (args, opts) = parser.getopt(args[1:])
+        if hasattr(opts, 'help') and opts.help:
+            self._show_help(parser, display_options=0, commands=[cmd_class])
+            return
+
+        if (hasattr(cmd_class, 'help_options') and
+                isinstance(cmd_class.help_options, list)):
+            help_option_found=0
+            for (help_option, short, desc, func) in cmd_class.help_options:
+                if hasattr(opts, parser.get_attr_name(help_option)):
+                    help_option_found=1
+                    if callable(func):
+                        func()
+                    else:
+                        raise DistutilsClassError(
+                            "invalid help function %r for help option '%s': "
+                            "must be a callable object (function, etc.)"
+                            % (func, help_option))
+
+            if help_option_found:
+                return
+
+        # Put the options from the command-line into their official
+        # holding pen, the 'command_options' dictionary.
+        opt_dict = self.get_option_dict(command)
+        for (name, value) in vars(opts).items():
+            opt_dict[name] = ("command line", value)
+
+        return args
+
+    def finalize_options(self):
+        """Set final values for all the options on the Distribution
+        instance, analogous to the .finalize_options() method of Command
+        objects.
+        """
+        for attr in ('keywords', 'platforms'):
+            value = getattr(self.metadata, attr)
+            if value is None:
+                continue
+            if isinstance(value, str):
+                value = [elm.strip() for elm in value.split(',')]
+                setattr(self.metadata, attr, value)
+
+    def _show_help(self, parser, global_options=1, display_options=1,
+                   commands=[]):
+        """Show help for the setup script command-line in the form of
+        several lists of command-line options.  'parser' should be a
+        FancyGetopt instance; do not expect it to be returned in the
+        same state, as its option table will be reset to make it
+        generate the correct help text.
+
+        If 'global_options' is true, lists the global options:
+        --verbose, --dry-run, etc.  If 'display_options' is true, lists
+        the "display-only" options: --name, --version, etc.  Finally,
+        lists per-command help for every command name or command class
+        in 'commands'.
+        """
+        # late import because of mutual dependence between these modules
+        from distutils.core import gen_usage
+        from distutils.cmd import Command
+
+        if global_options:
+            if display_options:
+                options = self._get_toplevel_options()
+            else:
+                options = self.global_options
+            parser.set_option_table(options)
+            parser.print_help(self.common_usage + "\nGlobal options:")
+            print('')
+
+        if display_options:
+            parser.set_option_table(self.display_options)
+            parser.print_help(
+                "Information display options (just display " +
+                "information, ignore any commands)")
+            print('')
+
+        for command in self.commands:
+            if isinstance(command, type) and issubclass(command, Command):
+                klass = command
+            else:
+                klass = self.get_command_class(command)
+            if (hasattr(klass, 'help_options') and
+                    isinstance(klass.help_options, list)):
+                parser.set_option_table(klass.user_options +
+                                        fix_help_options(klass.help_options))
+            else:
+                parser.set_option_table(klass.user_options)
+            parser.print_help("Options for '%s' command:" % klass.__name__)
+            print('')
+
+        print(gen_usage(self.script_name))
+
+    def handle_display_options(self, option_order):
+        """If there were any non-global "display-only" options
+        (--help-commands or the metadata display options) on the command
+        line, display the requested info and return true; else return
+        false.
+        """
+        from distutils.core import gen_usage
+
+        # User just wants a list of commands -- we'll print it out and stop
+        # processing now (ie. if they ran "setup --help-commands foo bar",
+        # we ignore "foo bar").
+        if self.help_commands:
+            self.print_commands()
+            print('')
+            print(gen_usage(self.script_name))
+            return 1
+
+        # If user supplied any of the "display metadata" options, then
+        # display that metadata in the order in which the user supplied the
+        # metadata options.
+        any_display_options = 0
+        is_display_option = {}
+        for option in self.display_options:
+            is_display_option[option[0]] = 1
+
+        for (opt, val) in option_order:
+            if val and is_display_option.get(opt):
+                opt = translate_longopt(opt)
+                value = getattr(self.metadata, "get_"+opt)()
+                if opt in ['keywords', 'platforms']:
+                    print(','.join(value))
+                elif opt in ('classifiers', 'provides', 'requires',
+                             'obsoletes'):
+                    print('\n'.join(value))
+                else:
+                    print(value)
+                any_display_options = 1
+
+        return any_display_options
+
+    def print_command_list(self, commands, header, max_length):
+        """Print a subset of the list of all commands -- used by
+        'print_commands()'.
+        """
+        print(header + ":")
+
+        for cmd in commands:
+            klass = self.cmdclass.get(cmd)
+            if not klass:
+                klass = self.get_command_class(cmd)
+            try:
+                description = klass.description
+            except AttributeError:
+                description = "(no description available)"
+
+            print("  %-*s  %s" % (max_length, cmd, description))
+
+    def print_commands(self):
+        """Print out a help message listing all available commands with a
+        description of each.  The list is divided into "standard commands"
+        (listed in distutils.command.__all__) and "extra commands"
+        (mentioned in self.cmdclass, but not a standard command).  The
+        descriptions come from the command class attribute
+        'description'.
+        """
+        import distutils.command
+        std_commands = distutils.command.__all__
+        is_std = {}
+        for cmd in std_commands:
+            is_std[cmd] = 1
+
+        extra_commands = []
+        for cmd in self.cmdclass.keys():
+            if not is_std.get(cmd):
+                extra_commands.append(cmd)
+
+        max_length = 0
+        for cmd in (std_commands + extra_commands):
+            if len(cmd) > max_length:
+                max_length = len(cmd)
+
+        self.print_command_list(std_commands,
+                                "Standard commands",
+                                max_length)
+        if extra_commands:
+            print()
+            self.print_command_list(extra_commands,
+                                    "Extra commands",
+                                    max_length)
+
+    def get_command_list(self):
+        """Get a list of (command, description) tuples.
+        The list is divided into "standard commands" (listed in
+        distutils.command.__all__) and "extra commands" (mentioned in
+        self.cmdclass, but not a standard command).  The descriptions come
+        from the command class attribute 'description'.
+        """
+        # Currently this is only used on Mac OS, for the Mac-only GUI
+        # Distutils interface (by Jack Jansen)
+        import distutils.command
+        std_commands = distutils.command.__all__
+        is_std = {}
+        for cmd in std_commands:
+            is_std[cmd] = 1
+
+        extra_commands = []
+        for cmd in self.cmdclass.keys():
+            if not is_std.get(cmd):
+                extra_commands.append(cmd)
+
+        rv = []
+        for cmd in (std_commands + extra_commands):
+            klass = self.cmdclass.get(cmd)
+            if not klass:
+                klass = self.get_command_class(cmd)
+            try:
+                description = klass.description
+            except AttributeError:
+                description = "(no description available)"
+            rv.append((cmd, description))
+        return rv
+
+    # -- Command class/object methods ----------------------------------
+
+    def get_command_packages(self):
+        """Return a list of packages from which commands are loaded."""
+        pkgs = self.command_packages
+        if not isinstance(pkgs, list):
+            if pkgs is None:
+                pkgs = ''
+            pkgs = [pkg.strip() for pkg in pkgs.split(',') if pkg != '']
+            if "distutils.command" not in pkgs:
+                pkgs.insert(0, "distutils.command")
+            self.command_packages = pkgs
+        return pkgs
+
+    def get_command_class(self, command):
+        """Return the class that implements the Distutils command named by
+        'command'.  First we check the 'cmdclass' dictionary; if the
+        command is mentioned there, we fetch the class object from the
+        dictionary and return it.  Otherwise we load the command module
+        ("distutils.command." + command) and fetch the command class from
+        the module.  The loaded class is also stored in 'cmdclass'
+        to speed future calls to 'get_command_class()'.
+
+        Raises DistutilsModuleError if the expected module could not be
+        found, or if that module does not define the expected class.
+        """
+        klass = self.cmdclass.get(command)
+        if klass:
+            return klass
+
+        for pkgname in self.get_command_packages():
+            module_name = "%s.%s" % (pkgname, command)
+            klass_name = command
+
+            try:
+                __import__(module_name)
+                module = sys.modules[module_name]
+            except ImportError:
+                continue
+
+            try:
+                klass = getattr(module, klass_name)
+            except AttributeError:
+                raise DistutilsModuleError(
+                    "invalid command '%s' (no class '%s' in module '%s')"
+                    % (command, klass_name, module_name))
+
+            self.cmdclass[command] = klass
+            return klass
+
+        raise DistutilsModuleError("invalid command '%s'" % command)
+
+    def get_command_obj(self, command, create=1):
+        """Return the command object for 'command'.  Normally this object
+        is cached on a previous call to 'get_command_obj()'; if no command
+        object for 'command' is in the cache, then we either create and
+        return it (if 'create' is true) or return None.
+        """
+        cmd_obj = self.command_obj.get(command)
+        if not cmd_obj and create:
+            if DEBUG:
+                self.announce("Distribution.get_command_obj(): "
+                              "creating '%s' command object" % command)
+
+            klass = self.get_command_class(command)
+            cmd_obj = self.command_obj[command] = klass(self)
+            self.have_run[command] = 0
+
+            # Set any options that were supplied in config files
+            # or on the command line.  (NB. support for error
+            # reporting is lame here: any errors aren't reported
+            # until 'finalize_options()' is called, which means
+            # we won't report the source of the error.)
+            options = self.command_options.get(command)
+            if options:
+                self._set_command_options(cmd_obj, options)
+
+        return cmd_obj
+
+    def _set_command_options(self, command_obj, option_dict=None):
+        """Set the options for 'command_obj' from 'option_dict'.  Basically
+        this means copying elements of a dictionary ('option_dict') to
+        attributes of an instance ('command').
+
+        'command_obj' must be a Command instance.  If 'option_dict' is not
+        supplied, uses the standard option dictionary for this command
+        (from 'self.command_options').
+        """
+        command_name = command_obj.get_command_name()
+        if option_dict is None:
+            option_dict = self.get_option_dict(command_name)
+
+        if DEBUG:
+            self.announce("  setting options for '%s' command:" % command_name)
+        for (option, (source, value)) in option_dict.items():
+            if DEBUG:
+                self.announce("    %s = %s (from %s)" % (option, value,
+                                                         source))
+            try:
+                bool_opts = [translate_longopt(o)
+                             for o in command_obj.boolean_options]
+            except AttributeError:
+                bool_opts = []
+            try:
+                neg_opt = command_obj.negative_opt
+            except AttributeError:
+                neg_opt = {}
+
+            try:
+                is_string = isinstance(value, str)
+                if option in neg_opt and is_string:
+                    setattr(command_obj, neg_opt[option], not strtobool(value))
+                elif option in bool_opts and is_string:
+                    setattr(command_obj, option, strtobool(value))
+                elif hasattr(command_obj, option):
+                    setattr(command_obj, option, value)
+                else:
+                    raise DistutilsOptionError(
+                        "error in %s: command '%s' has no such option '%s'"
+                        % (source, command_name, option))
+            except ValueError as msg:
+                raise DistutilsOptionError(msg)
+
+    def reinitialize_command(self, command, reinit_subcommands=0):
+        """Reinitializes a command to the state it was in when first
+        returned by 'get_command_obj()': ie., initialized but not yet
+        finalized.  This provides the opportunity to sneak option
+        values in programmatically, overriding or supplementing
+        user-supplied values from the config files and command line.
+        You'll have to re-finalize the command object (by calling
+        'finalize_options()' or 'ensure_finalized()') before using it for
+        real.
+
+        'command' should be a command name (string) or command object.  If
+        'reinit_subcommands' is true, also reinitializes the command's
+        sub-commands, as declared by the 'sub_commands' class attribute (if
+        it has one).  See the "install" command for an example.  Only
+        reinitializes the sub-commands that actually matter, ie. those
+        whose test predicates return true.
+
+        Returns the reinitialized command object.
+        """
+        from distutils.cmd import Command
+        if not isinstance(command, Command):
+            command_name = command
+            command = self.get_command_obj(command_name)
+        else:
+            command_name = command.get_command_name()
+
+        if not command.finalized:
+            return command
+        command.initialize_options()
+        command.finalized = 0
+        self.have_run[command_name] = 0
+        self._set_command_options(command)
+
+        if reinit_subcommands:
+            for sub in command.get_sub_commands():
+                self.reinitialize_command(sub, reinit_subcommands)
+
+        return command
+
+    # -- Methods that operate on the Distribution ----------------------
+
+    def announce(self, msg, level=log.INFO):
+        log.log(level, msg)
+
+    def run_commands(self):
+        """Run each command that was seen on the setup script command line.
+        Uses the list of commands found and cache of command objects
+        created by 'get_command_obj()'.
+        """
+        for cmd in self.commands:
+            self.run_command(cmd)
+
+    # -- Methods that operate on its Commands --------------------------
+
+    def run_command(self, command):
+        """Do whatever it takes to run a command (including nothing at all,
+        if the command has already been run).  Specifically: if we have
+        already created and run the command named by 'command', return
+        silently without doing anything.  If the command named by 'command'
+        doesn't even have a command object yet, create one.  Then invoke
+        'run()' on that command object (or an existing one).
+        """
+        # Already been here, done that? then return silently.
+        if self.have_run.get(command):
+            return
+
+        log.info("running %s", command)
+        cmd_obj = self.get_command_obj(command)
+        cmd_obj.ensure_finalized()
+        cmd_obj.run()
+        self.have_run[command] = 1
+
+    # -- Distribution query methods ------------------------------------
+
+    def has_pure_modules(self):
+        return len(self.packages or self.py_modules or []) > 0
+
+    def has_ext_modules(self):
+        return self.ext_modules and len(self.ext_modules) > 0
+
+    def has_c_libraries(self):
+        return self.libraries and len(self.libraries) > 0
+
+    def has_modules(self):
+        return self.has_pure_modules() or self.has_ext_modules()
+
+    def has_headers(self):
+        return self.headers and len(self.headers) > 0
+
+    def has_scripts(self):
+        return self.scripts and len(self.scripts) > 0
+
+    def has_data_files(self):
+        return self.data_files and len(self.data_files) > 0
+
+    def is_pure(self):
+        return (self.has_pure_modules() and
+                not self.has_ext_modules() and
+                not self.has_c_libraries())
+
+    # -- Metadata query methods ----------------------------------------
+
+    # If you're looking for 'get_name()', 'get_version()', and so forth,
+    # they are defined in a sneaky way: the constructor binds self.get_XXX
+    # to self.metadata.get_XXX.  The actual code is in the
+    # DistributionMetadata class, below.
+
+class DistributionMetadata:
+    """Dummy class to hold the distribution meta-data: name, version,
+    author, and so forth.
+    """
+
+    _METHOD_BASENAMES = ("name", "version", "author", "author_email",
+                         "maintainer", "maintainer_email", "url",
+                         "license", "description", "long_description",
+                         "keywords", "platforms", "fullname", "contact",
+                         "contact_email", "classifiers", "download_url",
+                         # PEP 314
+                         "provides", "requires", "obsoletes",
+                         )
+
+    def __init__(self, path=None):
+        if path is not None:
+            self.read_pkg_file(open(path))
+        else:
+            self.name = None
+            self.version = None
+            self.author = None
+            self.author_email = None
+            self.maintainer = None
+            self.maintainer_email = None
+            self.url = None
+            self.license = None
+            self.description = None
+            self.long_description = None
+            self.keywords = None
+            self.platforms = None
+            self.classifiers = None
+            self.download_url = None
+            # PEP 314
+            self.provides = None
+            self.requires = None
+            self.obsoletes = None
+
+    def read_pkg_file(self, file):
+        """Reads the metadata values from a file object."""
+        msg = message_from_file(file)
+
+        def _read_field(name):
+            value = msg[name]
+            if value == 'UNKNOWN':
+                return None
+            return value
+
+        def _read_list(name):
+            values = msg.get_all(name, None)
+            if values == []:
+                return None
+            return values
+
+        metadata_version = msg['metadata-version']
+        self.name = _read_field('name')
+        self.version = _read_field('version')
+        self.description = _read_field('summary')
+        # we are filling author only.
+        self.author = _read_field('author')
+        self.maintainer = None
+        self.author_email = _read_field('author-email')
+        self.maintainer_email = None
+        self.url = _read_field('home-page')
+        self.license = _read_field('license')
+
+        if 'download-url' in msg:
+            self.download_url = _read_field('download-url')
+        else:
+            self.download_url = None
+
+        self.long_description = _read_field('description')
+        self.description = _read_field('summary')
+
+        if 'keywords' in msg:
+            self.keywords = _read_field('keywords').split(',')
+
+        self.platforms = _read_list('platform')
+        self.classifiers = _read_list('classifier')
+
+        # PEP 314 - these fields only exist in 1.1
+        if metadata_version == '1.1':
+            self.requires = _read_list('requires')
+            self.provides = _read_list('provides')
+            self.obsoletes = _read_list('obsoletes')
+        else:
+            self.requires = None
+            self.provides = None
+            self.obsoletes = None
+
+    def write_pkg_info(self, base_dir):
+        """Write the PKG-INFO file into the release tree.
+        """
+        with open(os.path.join(base_dir, 'PKG-INFO'), 'w',
+                  encoding='UTF-8') as pkg_info:
+            self.write_pkg_file(pkg_info)
+
+    def write_pkg_file(self, file):
+        """Write the PKG-INFO format data to a file object.
+        """
+        version = '1.0'
+        if (self.provides or self.requires or self.obsoletes or
+                self.classifiers or self.download_url):
+            version = '1.1'
+
+        file.write('Metadata-Version: %s\n' % version)
+        file.write('Name: %s\n' % self.get_name())
+        file.write('Version: %s\n' % self.get_version())
+        file.write('Summary: %s\n' % self.get_description())
+        file.write('Home-page: %s\n' % self.get_url())
+        file.write('Author: %s\n' % self.get_contact())
+        file.write('Author-email: %s\n' % self.get_contact_email())
+        file.write('License: %s\n' % self.get_license())
+        if self.download_url:
+            file.write('Download-URL: %s\n' % self.download_url)
+
+        long_desc = rfc822_escape(self.get_long_description())
+        file.write('Description: %s\n' % long_desc)
+
+        keywords = ','.join(self.get_keywords())
+        if keywords:
+            file.write('Keywords: %s\n' % keywords)
+
+        self._write_list(file, 'Platform', self.get_platforms())
+        self._write_list(file, 'Classifier', self.get_classifiers())
+
+        # PEP 314
+        self._write_list(file, 'Requires', self.get_requires())
+        self._write_list(file, 'Provides', self.get_provides())
+        self._write_list(file, 'Obsoletes', self.get_obsoletes())
+
+    def _write_list(self, file, name, values):
+        for value in values:
+            file.write('%s: %s\n' % (name, value))
+
+    # -- Metadata query methods ----------------------------------------
+
+    def get_name(self):
+        return self.name or "UNKNOWN"
+
+    def get_version(self):
+        return self.version or "0.0.0"
+
+    def get_fullname(self):
+        return "%s-%s" % (self.get_name(), self.get_version())
+
+    def get_author(self):
+        return self.author or "UNKNOWN"
+
+    def get_author_email(self):
+        return self.author_email or "UNKNOWN"
+
+    def get_maintainer(self):
+        return self.maintainer or "UNKNOWN"
+
+    def get_maintainer_email(self):
+        return self.maintainer_email or "UNKNOWN"
+
+    def get_contact(self):
+        return self.maintainer or self.author or "UNKNOWN"
+
+    def get_contact_email(self):
+        return self.maintainer_email or self.author_email or "UNKNOWN"
+
+    def get_url(self):
+        return self.url or "UNKNOWN"
+
+    def get_license(self):
+        return self.license or "UNKNOWN"
+    get_licence = get_license
+
+    def get_description(self):
+        return self.description or "UNKNOWN"
+
+    def get_long_description(self):
+        return self.long_description or "UNKNOWN"
+
+    def get_keywords(self):
+        return self.keywords or []
+
+    def set_keywords(self, value):
+        self.keywords = _ensure_list(value, 'keywords')
+
+    def get_platforms(self):
+        return self.platforms or ["UNKNOWN"]
+
+    def set_platforms(self, value):
+        self.platforms = _ensure_list(value, 'platforms')
+
+    def get_classifiers(self):
+        return self.classifiers or []
+
+    def set_classifiers(self, value):
+        self.classifiers = _ensure_list(value, 'classifiers')
+
+    def get_download_url(self):
+        return self.download_url or "UNKNOWN"
+
+    # PEP 314
+    def get_requires(self):
+        return self.requires or []
+
+    def set_requires(self, value):
+        import distutils.versionpredicate
+        for v in value:
+            distutils.versionpredicate.VersionPredicate(v)
+        self.requires = list(value)
+
+    def get_provides(self):
+        return self.provides or []
+
+    def set_provides(self, value):
+        value = [v.strip() for v in value]
+        for v in value:
+            import distutils.versionpredicate
+            distutils.versionpredicate.split_provision(v)
+        self.provides = value
+
+    def get_obsoletes(self):
+        return self.obsoletes or []
+
+    def set_obsoletes(self, value):
+        import distutils.versionpredicate
+        for v in value:
+            distutils.versionpredicate.VersionPredicate(v)
+        self.obsoletes = list(value)
+
+def fix_help_options(options):
+    """Convert a 4-tuple 'help_options' list as found in various command
+    classes to the 3-tuple form required by FancyGetopt.
+    """
+    new_options = []
+    for help_tuple in options:
+        new_options.append(help_tuple[0:3])
+    return new_options
diff --git a/venv/Lib/site-packages/setuptools/_distutils/errors.py b/venv/Lib/site-packages/setuptools/_distutils/errors.py
new file mode 100644
index 000000000..8b93059e1
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/errors.py
@@ -0,0 +1,97 @@
+"""distutils.errors
+
+Provides exceptions used by the Distutils modules.  Note that Distutils
+modules may raise standard exceptions; in particular, SystemExit is
+usually raised for errors that are obviously the end-user's fault
+(eg. bad command-line arguments).
+
+This module is safe to use in "from ... import *" mode; it only exports
+symbols whose names start with "Distutils" and end with "Error"."""
+
+class DistutilsError (Exception):
+    """The root of all Distutils evil."""
+    pass
+
+class DistutilsModuleError (DistutilsError):
+    """Unable to load an expected module, or to find an expected class
+    within some module (in particular, command modules and classes)."""
+    pass
+
+class DistutilsClassError (DistutilsError):
+    """Some command class (or possibly distribution class, if anyone
+    feels a need to subclass Distribution) is found not to be holding
+    up its end of the bargain, ie. implementing some part of the
+    "command "interface."""
+    pass
+
+class DistutilsGetoptError (DistutilsError):
+    """The option table provided to 'fancy_getopt()' is bogus."""
+    pass
+
+class DistutilsArgError (DistutilsError):
+    """Raised by fancy_getopt in response to getopt.error -- ie. an
+    error in the command line usage."""
+    pass
+
+class DistutilsFileError (DistutilsError):
+    """Any problems in the filesystem: expected file not found, etc.
+    Typically this is for problems that we detect before OSError
+    could be raised."""
+    pass
+
+class DistutilsOptionError (DistutilsError):
+    """Syntactic/semantic errors in command options, such as use of
+    mutually conflicting options, or inconsistent options,
+    badly-spelled values, etc.  No distinction is made between option
+    values originating in the setup script, the command line, config
+    files, or what-have-you -- but if we *know* something originated in
+    the setup script, we'll raise DistutilsSetupError instead."""
+    pass
+
+class DistutilsSetupError (DistutilsError):
+    """For errors that can be definitely blamed on the setup script,
+    such as invalid keyword arguments to 'setup()'."""
+    pass
+
+class DistutilsPlatformError (DistutilsError):
+    """We don't know how to do something on the current platform (but
+    we do know how to do it on some platform) -- eg. trying to compile
+    C files on a platform not supported by a CCompiler subclass."""
+    pass
+
+class DistutilsExecError (DistutilsError):
+    """Any problems executing an external program (such as the C
+    compiler, when compiling C files)."""
+    pass
+
+class DistutilsInternalError (DistutilsError):
+    """Internal inconsistencies or impossibilities (obviously, this
+    should never be seen if the code is working!)."""
+    pass
+
+class DistutilsTemplateError (DistutilsError):
+    """Syntax error in a file list template."""
+
+class DistutilsByteCompileError(DistutilsError):
+    """Byte compile error."""
+
+# Exception classes used by the CCompiler implementation classes
+class CCompilerError (Exception):
+    """Some compile/link operation failed."""
+
+class PreprocessError (CCompilerError):
+    """Failure to preprocess one or more C/C++ files."""
+
+class CompileError (CCompilerError):
+    """Failure to compile one or more C/C++ source files."""
+
+class LibError (CCompilerError):
+    """Failure to create a static library from one or more C/C++ object
+    files."""
+
+class LinkError (CCompilerError):
+    """Failure to link one or more C/C++ object files into an executable
+    or shared library file."""
+
+class UnknownFileError (CCompilerError):
+    """Attempt to process an unknown file type."""
diff --git a/venv/Lib/site-packages/setuptools/_distutils/extension.py b/venv/Lib/site-packages/setuptools/_distutils/extension.py
new file mode 100644
index 000000000..c507da360
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/extension.py
@@ -0,0 +1,240 @@
+"""distutils.extension
+
+Provides the Extension class, used to describe C/C++ extension
+modules in setup scripts."""
+
+import os
+import warnings
+
+# This class is really only used by the "build_ext" command, so it might
+# make sense to put it in distutils.command.build_ext.  However, that
+# module is already big enough, and I want to make this class a bit more
+# complex to simplify some common cases ("foo" module in "foo.c") and do
+# better error-checking ("foo.c" actually exists).
+#
+# Also, putting this in build_ext.py means every setup script would have to
+# import that large-ish module (indirectly, through distutils.core) in
+# order to do anything.
+
+class Extension:
+    """Just a collection of attributes that describes an extension
+    module and everything needed to build it (hopefully in a portable
+    way, but there are hooks that let you be as unportable as you need).
+
+    Instance attributes:
+      name : string
+        the full name of the extension, including any packages -- ie.
+        *not* a filename or pathname, but Python dotted name
+      sources : [string]
+        list of source filenames, relative to the distribution root
+        (where the setup script lives), in Unix form (slash-separated)
+        for portability.  Source files may be C, C++, SWIG (.i),
+        platform-specific resource files, or whatever else is recognized
+        by the "build_ext" command as source for a Python extension.
+      include_dirs : [string]
+        list of directories to search for C/C++ header files (in Unix
+        form for portability)
+      define_macros : [(name : string, value : string|None)]
+        list of macros to define; each macro is defined using a 2-tuple,
+        where 'value' is either the string to define it to or None to
+        define it without a particular value (equivalent of "#define
+        FOO" in source or -DFOO on Unix C compiler command line)
+      undef_macros : [string]
+        list of macros to undefine explicitly
+      library_dirs : [string]
+        list of directories to search for C/C++ libraries at link time
+      libraries : [string]
+        list of library names (not filenames or paths) to link against
+      runtime_library_dirs : [string]
+        list of directories to search for C/C++ libraries at run time
+        (for shared extensions, this is when the extension is loaded)
+      extra_objects : [string]
+        list of extra files to link with (eg. object files not implied
+        by 'sources', static library that must be explicitly specified,
+        binary resource files, etc.)
+      extra_compile_args : [string]
+        any extra platform- and compiler-specific information to use
+        when compiling the source files in 'sources'.  For platforms and
+        compilers where "command line" makes sense, this is typically a
+        list of command-line arguments, but for other platforms it could
+        be anything.
+      extra_link_args : [string]
+        any extra platform- and compiler-specific information to use
+        when linking object files together to create the extension (or
+        to create a new static Python interpreter).  Similar
+        interpretation as for 'extra_compile_args'.
+      export_symbols : [string]
+        list of symbols to be exported from a shared extension.  Not
+        used on all platforms, and not generally necessary for Python
+        extensions, which typically export exactly one symbol: "init" +
+        extension_name.
+      swig_opts : [string]
+        any extra options to pass to SWIG if a source file has the .i
+        extension.
+      depends : [string]
+        list of files that the extension depends on
+      language : string
+        extension language (i.e. "c", "c++", "objc"). Will be detected
+        from the source extensions if not provided.
+      optional : boolean
+        specifies that a build failure in the extension should not abort the
+        build process, but simply not install the failing extension.
+    """
+
+    # When adding arguments to this constructor, be sure to update
+    # setup_keywords in core.py.
+    def __init__(self, name, sources,
+                  include_dirs=None,
+                  define_macros=None,
+                  undef_macros=None,
+                  library_dirs=None,
+                  libraries=None,
+                  runtime_library_dirs=None,
+                  extra_objects=None,
+                  extra_compile_args=None,
+                  extra_link_args=None,
+                  export_symbols=None,
+                  swig_opts = None,
+                  depends=None,
+                  language=None,
+                  optional=None,
+                  **kw                      # To catch unknown keywords
+                 ):
+        if not isinstance(name, str):
+            raise AssertionError("'name' must be a string")
+        if not (isinstance(sources, list) and
+                all(isinstance(v, str) for v in sources)):
+            raise AssertionError("'sources' must be a list of strings")
+
+        self.name = name
+        self.sources = sources
+        self.include_dirs = include_dirs or []
+        self.define_macros = define_macros or []
+        self.undef_macros = undef_macros or []
+        self.library_dirs = library_dirs or []
+        self.libraries = libraries or []
+        self.runtime_library_dirs = runtime_library_dirs or []
+        self.extra_objects = extra_objects or []
+        self.extra_compile_args = extra_compile_args or []
+        self.extra_link_args = extra_link_args or []
+        self.export_symbols = export_symbols or []
+        self.swig_opts = swig_opts or []
+        self.depends = depends or []
+        self.language = language
+        self.optional = optional
+
+        # If there are unknown keyword options, warn about them
+        if len(kw) > 0:
+            options = [repr(option) for option in kw]
+            options = ', '.join(sorted(options))
+            msg = "Unknown Extension options: %s" % options
+            warnings.warn(msg)
+
+    def __repr__(self):
+        return '<%s.%s(%r) at %#x>' % (
+            self.__class__.__module__,
+            self.__class__.__qualname__,
+            self.name,
+            id(self))
+
+
+def read_setup_file(filename):
+    """Reads a Setup file and returns Extension instances."""
+    from distutils.sysconfig import (parse_makefile, expand_makefile_vars,
+                                     _variable_rx)
+
+    from distutils.text_file import TextFile
+    from distutils.util import split_quoted
+
+    # First pass over the file to gather "VAR = VALUE" assignments.
+    vars = parse_makefile(filename)
+
+    # Second pass to gobble up the real content: lines of the form
+    #   <module> ... [<sourcefile> ...] [<cpparg> ...] [<library> ...]
+    file = TextFile(filename,
+                    strip_comments=1, skip_blanks=1, join_lines=1,
+                    lstrip_ws=1, rstrip_ws=1)
+    try:
+        extensions = []
+
+        while True:
+            line = file.readline()
+            if line is None:                # eof
+                break
+            if _variable_rx.match(line):    # VAR=VALUE, handled in first pass
+                continue
+
+            if line[0] == line[-1] == "*":
+                file.warn("'%s' lines not handled yet" % line)
+                continue
+
+            line = expand_makefile_vars(line, vars)
+            words = split_quoted(line)
+
+            # NB. this parses a slightly different syntax than the old
+            # makesetup script: here, there must be exactly one extension per
+            # line, and it must be the first word of the line.  I have no idea
+            # why the old syntax supported multiple extensions per line, as
+            # they all wind up being the same.
+
+            module = words[0]
+            ext = Extension(module, [])
+            append_next_word = None
+
+            for word in words[1:]:
+                if append_next_word is not None:
+                    append_next_word.append(word)
+                    append_next_word = None
+                    continue
+
+                suffix = os.path.splitext(word)[1]
+                switch = word[0:2] ; value = word[2:]
+
+                if suffix in (".c", ".cc", ".cpp", ".cxx", ".c++", ".m", ".mm"):
+                    # hmm, should we do something about C vs. C++ sources?
+                    # or leave it up to the CCompiler implementation to
+                    # worry about?
+                    ext.sources.append(word)
+                elif switch == "-I":
+                    ext.include_dirs.append(value)
+                elif switch == "-D":
+                    equals = value.find("=")
+                    if equals == -1:        # bare "-DFOO" -- no value
+                        ext.define_macros.append((value, None))
+                    else:                   # "-DFOO=blah"
+                        ext.define_macros.append((value[0:equals],
+                                                  value[equals+2:]))
+                elif switch == "-U":
+                    ext.undef_macros.append(value)
+                elif switch == "-C":        # only here 'cause makesetup has it!
+                    ext.extra_compile_args.append(word)
+                elif switch == "-l":
+                    ext.libraries.append(value)
+                elif switch == "-L":
+                    ext.library_dirs.append(value)
+                elif switch == "-R":
+                    ext.runtime_library_dirs.append(value)
+                elif word == "-rpath":
+                    append_next_word = ext.runtime_library_dirs
+                elif word == "-Xlinker":
+                    append_next_word = ext.extra_link_args
+                elif word == "-Xcompiler":
+                    append_next_word = ext.extra_compile_args
+                elif switch == "-u":
+                    ext.extra_link_args.append(word)
+                    if not value:
+                        append_next_word = ext.extra_link_args
+                elif suffix in (".a", ".so", ".sl", ".o", ".dylib"):
+                    # NB. a really faithful emulation of makesetup would
+                    # append a .o file to extra_objects only if it
+                    # had a slash in it; otherwise, it would s/.o/.c/
+                    # and append it to sources.  Hmmmm.
+                    ext.extra_objects.append(word)
+                else:
+                    file.warn("unrecognized argument '%s'" % word)
+
+            extensions.append(ext)
+    finally:
+        file.close()
+
+    return extensions
diff --git a/venv/Lib/site-packages/setuptools/_distutils/fancy_getopt.py b/venv/Lib/site-packages/setuptools/_distutils/fancy_getopt.py
new file mode 100644
index 000000000..7d170dd27
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/fancy_getopt.py
@@ -0,0 +1,457 @@
+"""distutils.fancy_getopt
+
+Wrapper around the standard getopt module that provides the following
+additional features:
+  * short and long options are tied together
+  * options have help strings, so fancy_getopt could potentially
+    create a complete usage summary
+  * options set attributes of a passed-in object
+"""
+
+import sys, string, re
+import getopt
+from distutils.errors import *
+
+# Much like command_re in distutils.core, this is close to but not quite
+# the same as a Python NAME -- except, in the spirit of most GNU
+# utilities, we use '-' in place of '_'.  (The spirit of LISP lives on!)
+# The similarities to NAME are again not a coincidence...
+longopt_pat = r'[a-zA-Z](?:[a-zA-Z0-9-]*)'
+longopt_re = re.compile(r'^%s$' % longopt_pat)
+
+# For recognizing "negative alias" options, eg. "quiet=!verbose"
+neg_alias_re = re.compile("^(%s)=!(%s)$" % (longopt_pat, longopt_pat))
+
+# This is used to translate long options to legitimate Python identifiers
+# (for use as attributes of some object).
+longopt_xlate = str.maketrans('-', '_')
+
+class FancyGetopt:
+    """Wrapper around the standard 'getopt()' module that provides some
+    handy extra functionality:
+      * short and long options are tied together
+      * options have help strings, and help text can be assembled
+        from them
+      * options set attributes of a passed-in object
+      * boolean options can have "negative aliases" -- eg. if
+        --quiet is the "negative alias" of --verbose, then "--quiet"
+        on the command line sets 'verbose' to false
+    """
+
+    def __init__(self, option_table=None):
+        # The option table is (currently) a list of tuples.  The
+        # tuples may have 3 or four values:
+        #   (long_option, short_option, help_string [, repeatable])
+        # if an option takes an argument, its long_option should have '='
+        # appended; short_option should just be a single character, no ':'
+        # in any case.  If a long_option doesn't have a corresponding
+        # short_option, short_option should be None.  All option tuples
+        # must have long options.
+        self.option_table = option_table
+
+        # 'option_index' maps long option names to entries in the option
+        # table (ie. those 3-tuples).
+        self.option_index = {}
+        if self.option_table:
+            self._build_index()
+
+        # 'alias' records (duh) alias options; {'foo': 'bar'} means
+        # --foo is an alias for --bar
+        self.alias = {}
+
+        # 'negative_alias' keeps track of options that are the boolean
+        # opposite of some other option
+        self.negative_alias = {}
+
+        # These keep track of the information in the option table.  We
+        # don't actually populate these structures until we're ready to
+        # parse the command-line, since the 'option_table' passed in here
+        # isn't necessarily the final word.
+        self.short_opts = []
+        self.long_opts = []
+        self.short2long = {}
+        self.attr_name = {}
+        self.takes_arg = {}
+
+        # And 'option_order' is filled up in 'getopt()'; it records the
+        # original order of options (and their values) on the command-line,
+        # but expands short options, converts aliases, etc.
+        self.option_order = []
+
+    def _build_index(self):
+        self.option_index.clear()
+        for option in self.option_table:
+            self.option_index[option[0]] = option
+
+    def set_option_table(self, option_table):
+        self.option_table = option_table
+        self._build_index()
+
+    def add_option(self, long_option, short_option=None, help_string=None):
+        if long_option in self.option_index:
+            raise DistutilsGetoptError(
+                  "option conflict: already an option '%s'" % long_option)
+        else:
+            option = (long_option, short_option, help_string)
+            self.option_table.append(option)
+            self.option_index[long_option] = option
+
+    def has_option(self, long_option):
+        """Return true if the option table for this parser has an
+        option with long name 'long_option'."""
+        return long_option in self.option_index
+
+    def get_attr_name(self, long_option):
+        """Translate long option name 'long_option' to the form it
+        has as an attribute of some object: ie., translate hyphens
+        to underscores."""
+        return long_option.translate(longopt_xlate)
+
+    def _check_alias_dict(self, aliases, what):
+        assert isinstance(aliases, dict)
+        for (alias, opt) in aliases.items():
+            if alias not in self.option_index:
+                raise DistutilsGetoptError(("invalid %s '%s': "
+                       "option '%s' not defined") % (what, alias, alias))
+            if opt not in self.option_index:
+                raise DistutilsGetoptError(("invalid %s '%s': "
+                       "aliased option '%s' not defined") % (what, alias, opt))
+
+    def set_aliases(self, alias):
+        """Set the aliases for this option parser."""
+        self._check_alias_dict(alias, "alias")
+        self.alias = alias
+
+    def set_negative_aliases(self, negative_alias):
+        """Set the negative aliases for this option parser.
+        'negative_alias' should be a dictionary mapping option names to
+        option names, both the key and value must already be defined
+        in the option table."""
+        self._check_alias_dict(negative_alias, "negative alias")
+        self.negative_alias = negative_alias
+
+    def _grok_option_table(self):
+        """Populate the various data structures that keep tabs on the
+        option table.  Called by 'getopt()' before it can do anything
+        worthwhile.
+        """
+        self.long_opts = []
+        self.short_opts = []
+        self.short2long.clear()
+        self.repeat = {}
+
+        for option in self.option_table:
+            if len(option) == 3:
+                long, short, help = option
+                repeat = 0
+            elif len(option) == 4:
+                long, short, help, repeat = option
+            else:
+                # the option table is part of the code, so simply
+                # assert that it is correct
+                raise ValueError("invalid option tuple: %r" % (option,))
+
+            # Type- and value-check the option names
+            if not isinstance(long, str) or len(long) < 2:
+                raise DistutilsGetoptError(("invalid long option '%s': "
+                       "must be a string of length >= 2") % long)
+
+            if (not ((short is None) or
+                     (isinstance(short, str) and len(short) == 1))):
+                raise DistutilsGetoptError("invalid short option '%s': "
+                       "must a single character or None" % short)
+
+            self.repeat[long] = repeat
+            self.long_opts.append(long)
+
+            if long[-1] == '=':             # option takes an argument?
+                if short: short = short + ':'
+                long = long[0:-1]
+                self.takes_arg[long] = 1
+            else:
+                # Is option is a "negative alias" for some other option (eg.
+                # "quiet" == "!verbose")?
+                alias_to = self.negative_alias.get(long)
+                if alias_to is not None:
+                    if self.takes_arg[alias_to]:
+                        raise DistutilsGetoptError(
+                              "invalid negative alias '%s': "
+                              "aliased option '%s' takes a value"
+                              % (long, alias_to))
+
+                    self.long_opts[-1] = long # XXX redundant?!
+                self.takes_arg[long] = 0
+
+            # If this is an alias option, make sure its "takes arg" flag is
+            # the same as the option it's aliased to.
+            alias_to = self.alias.get(long)
+            if alias_to is not None:
+                if self.takes_arg[long] != self.takes_arg[alias_to]:
+                    raise DistutilsGetoptError(
+                          "invalid alias '%s': inconsistent with "
+                          "aliased option '%s' (one of them takes a value, "
+                          "the other doesn't"
+                          % (long, alias_to))
+
+            # Now enforce some bondage on the long option name, so we can
+            # later translate it to an attribute name on some object.  Have
+            # to do this a bit late to make sure we've removed any trailing
+            # '='.
+            if not longopt_re.match(long):
+                raise DistutilsGetoptError(
+                       "invalid long option name '%s' "
+                       "(must be letters, numbers, hyphens only" % long)
+
+            self.attr_name[long] = self.get_attr_name(long)
+            if short:
+                self.short_opts.append(short)
+                self.short2long[short[0]] = long
+
+    def getopt(self, args=None, object=None):
+        """Parse command-line options in args. Store as attributes on object.
+
+        If 'args' is None or not supplied, uses 'sys.argv[1:]'.  If
+        'object' is None or not supplied, creates a new OptionDummy
+        object, stores option values there, and returns a tuple (args,
+        object).  If 'object' is supplied, it is modified in place and
+        'getopt()' just returns 'args'; in both cases, the returned
+        'args' is a modified copy of the passed-in 'args' list, which
+        is left untouched.
+        """
+        if args is None:
+            args = sys.argv[1:]
+        if object is None:
+            object = OptionDummy()
+            created_object = True
+        else:
+            created_object = False
+
+        self._grok_option_table()
+
+        short_opts = ' '.join(self.short_opts)
+        try:
+            opts, args = getopt.getopt(args, short_opts, self.long_opts)
+        except getopt.error as msg:
+            raise DistutilsArgError(msg)
+
+        for opt, val in opts:
+            if len(opt) == 2 and opt[0] == '-': # it's a short option
+                opt = self.short2long[opt[1]]
+            else:
+                assert len(opt) > 2 and opt[:2] == '--'
+                opt = opt[2:]
+
+            alias = self.alias.get(opt)
+            if alias:
+                opt = alias
+
+            if not self.takes_arg[opt]:     # boolean option?
+                assert val == '', "boolean option can't have value"
+                alias = self.negative_alias.get(opt)
+                if alias:
+                    opt = alias
+                    val = 0
+                else:
+                    val = 1
+
+            attr = self.attr_name[opt]
+            # The only repeating option at the moment is 'verbose'.
+            # It has a negative option -q quiet, which should set verbose = 0.
+            if val and self.repeat.get(attr) is not None:
+                val = getattr(object, attr, 0) + 1
+            setattr(object, attr, val)
+            self.option_order.append((opt, val))
+
+        # for opts
+        if created_object:
+            return args, object
+        else:
+            return args
+
+    def get_option_order(self):
+        """Returns the list of (option, value) tuples processed by the
+        previous run of 'getopt()'.  Raises RuntimeError if
+        'getopt()' hasn't been called yet.
+        """
+        if self.option_order is None:
+            raise RuntimeError("'getopt()' hasn't been called yet")
+        else:
+            return self.option_order
+
+    def generate_help(self, header=None):
+        """Generate help text (a list of strings, one per suggested line of
+        output) from the option table for this FancyGetopt object.
+        """
+        # Blithely assume the option table is good: probably wouldn't call
+        # 'generate_help()' unless you've already called 'getopt()'.
+
+        # First pass: determine maximum length of long option names
+        max_opt = 0
+        for option in self.option_table:
+            long = option[0]
+            short = option[1]
+            l = len(long)
+            if long[-1] == '=':
+                l = l - 1
+            if short is not None:
+                l = l + 5                   # " (-x)" where short == 'x'
+            if l > max_opt:
+                max_opt = l
+
+        opt_width = max_opt + 2 + 2 + 2     # room for indent + dashes + gutter
+
+        # Typical help block looks like this:
+        #   --foo       controls foonabulation
+        # Help block for longest option looks like this:
+        #   --flimflam  set the flim-flam level
+        # and with wrapped text:
+        #   --flimflam  set the flim-flam level (must be between
+        #               0 and 100, except on Tuesdays)
+        # Options with short names will have the short name shown (but
+        # it doesn't contribute to max_opt):
+        #   --foo (-f)  controls foonabulation
+        # If adding the short option would make the left column too wide,
+        # we push the explanation off to the next line
+        #   --flimflam (-l)
+        #               set the flim-flam level
+        # Important parameters:
+        #   - 2 spaces before option block start lines
+        #   - 2 dashes for each long option name
+        #   - min. 2 spaces between option and explanation (gutter)
+        #   - 5 characters (incl. space) for short option name
+
+        # Now generate lines of help text.  (If 80 columns were good enough
+        # for Jesus, then 78 columns are good enough for me!)
+        line_width = 78
+        text_width = line_width - opt_width
+        big_indent = ' ' * opt_width
+        if header:
+            lines = [header]
+        else:
+            lines = ['Option summary:']
+
+        for option in self.option_table:
+            long, short, help = option[:3]
+            text = wrap_text(help, text_width)
+            if long[-1] == '=':
+                long = long[0:-1]
+
+            # Case 1: no short option at all (makes life easy)
+            if short is None:
+                if text:
+                    lines.append("  --%-*s  %s" % (max_opt, long, text[0]))
+                else:
+                    lines.append("  --%-*s  " % (max_opt, long))
+
+            # Case 2: we have a short option, so we have to include it
+            # just after the long option
+            else:
+                opt_names = "%s (-%s)" % (long, short)
+                if text:
+                    lines.append("  --%-*s  %s" %
+                                 (max_opt, opt_names, text[0]))
+                else:
+                    lines.append("  --%-*s" % opt_names)
+
+            for l in text[1:]:
+                lines.append(big_indent + l)
+        return lines
+
+    def print_help(self, header=None, file=None):
+        if file is None:
+            file = sys.stdout
+        for line in self.generate_help(header):
+            file.write(line + "\n")
+
+
+def fancy_getopt(options, negative_opt, object, args):
+    parser = FancyGetopt(options)
+    parser.set_negative_aliases(negative_opt)
+    return parser.getopt(args, object)
+
+
+WS_TRANS = {ord(_wschar) : ' ' for _wschar in string.whitespace}
+
+def wrap_text(text, width):
+    """wrap_text(text : string, width : int) -> [string]
+
+    Split 'text' into multiple lines of no more than 'width' characters
+    each, and return the list of strings that results.
+    """
+    if text is None:
+        return []
+    if len(text) <= width:
+        return [text]
+
+    text = text.expandtabs()
+    text = text.translate(WS_TRANS)
+    chunks = re.split(r'( +|-+)', text)
+    chunks = [ch for ch in chunks if ch] # ' - ' results in empty strings
+    lines = []
+
+    while chunks:
+        cur_line = []                   # list of chunks (to-be-joined)
+        cur_len = 0                     # length of current line
+
+        while chunks:
+            l = len(chunks[0])
+            if cur_len + l <= width:    # can squeeze (at least) this chunk in
+                cur_line.append(chunks[0])
+                del chunks[0]
+                cur_len = cur_len + l
+            else:                       # this line is full
+                # drop last chunk if all space
+                if cur_line and cur_line[-1][0] == ' ':
+                    del cur_line[-1]
+                break
+
+        if chunks:                      # any chunks left to process?
+            # if the current line is still empty, then we had a single
+            # chunk that's too big too fit on a line -- so we break
+            # down and break it up at the line width
+            if cur_len == 0:
+                cur_line.append(chunks[0][0:width])
+                chunks[0] = chunks[0][width:]
+
+            # all-whitespace chunks at the end of a line can be discarded
+            # (and we know from the re.split above that if a chunk has
+            # *any* whitespace, it is *all* whitespace)
+            if chunks[0][0] == ' ':
+                del chunks[0]
+
+        # and store this line in the list-of-all-lines -- as a single
+        # string, of course!
+        lines.append(''.join(cur_line))
+
+    return lines
+
+
+def translate_longopt(opt):
+    """Convert a long option name to a valid Python identifier by
+    changing "-" to "_".
+    """
+    return opt.translate(longopt_xlate)
+
+
+class OptionDummy:
+    """Dummy class just used as a place to hold command-line option
+    values as instance attributes."""
+
+    def __init__(self, options=[]):
+        """Create a new OptionDummy instance.  The attributes listed in
+        'options' will be initialized to None."""
+        for opt in options:
+            setattr(self, opt, None)
+
+
+if __name__ == "__main__":
+    text = """\
+Tra-la-la, supercalifragilisticexpialidocious.
+How *do* you spell that odd word, anyways?
+(Someone ask Mary -- she'll know [or she'll
+say, "How should I know?"].)"""
+
+    for w in (10, 20, 30, 40):
+        print("width: %d" % w)
+        print("\n".join(wrap_text(text, w)))
+        print()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/file_util.py b/venv/Lib/site-packages/setuptools/_distutils/file_util.py
new file mode 100644
index 000000000..b3fee35a6
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/file_util.py
@@ -0,0 +1,238 @@
+"""distutils.file_util
+
+Utility functions for operating on single files.
+"""
+
+import os
+from distutils.errors import DistutilsFileError
+from distutils import log
+
+# for generating verbose output in 'copy_file()'
+_copy_action = { None:   'copying',
+                 'hard': 'hard linking',
+                 'sym':  'symbolically linking' }
+
+
+def _copy_file_contents(src, dst, buffer_size=16*1024):
+    """Copy the file 'src' to 'dst'; both must be filenames.  Any error
+    opening either file, reading from 'src', or writing to 'dst', raises
+    DistutilsFileError.  Data is read/written in chunks of 'buffer_size'
+    bytes (default 16k).  No attempt is made to handle anything apart from
+    regular files.
+    """
+    # Stolen from shutil module in the standard library, but with
+    # custom error-handling added.
+    fsrc = None
+    fdst = None
+    try:
+        try:
+            fsrc = open(src, 'rb')
+        except OSError as e:
+            raise DistutilsFileError("could not open '%s': %s" % (src, e.strerror))
+
+        if os.path.exists(dst):
+            try:
+                os.unlink(dst)
+            except OSError as e:
+                raise DistutilsFileError(
+                      "could not delete '%s': %s" % (dst, e.strerror))
+
+        try:
+            fdst = open(dst, 'wb')
+        except OSError as e:
+            raise DistutilsFileError(
+                  "could not create '%s': %s" % (dst, e.strerror))
+
+        while True:
+            try:
+                buf = fsrc.read(buffer_size)
+            except OSError as e:
+                raise DistutilsFileError(
+                      "could not read from '%s': %s" % (src, e.strerror))
+
+            if not buf:
+                break
+
+            try:
+                fdst.write(buf)
+            except OSError as e:
+                raise DistutilsFileError(
+                      "could not write to '%s': %s" % (dst, e.strerror))
+    finally:
+        if fdst:
+            fdst.close()
+        if fsrc:
+            fsrc.close()
+
+def copy_file(src, dst, preserve_mode=1, preserve_times=1, update=0,
+              link=None, verbose=1, dry_run=0):
+    """Copy a file 'src' to 'dst'.  If 'dst' is a directory, then 'src' is
+    copied there with the same name; otherwise, it must be a filename.  (If
+    the file exists, it will be ruthlessly clobbered.)  If 'preserve_mode'
+    is true (the default), the file's mode (type and permission bits, or
+    whatever is analogous on the current platform) is copied.  If
+    'preserve_times' is true (the default), the last-modified and
+    last-access times are copied as well.  If 'update' is true, 'src' will
+    only be copied if 'dst' does not exist, or if 'dst' does exist but is
+    older than 'src'.
+
+    'link' allows you to make hard links (os.link) or symbolic links
+    (os.symlink) instead of copying: set it to "hard" or "sym"; if it is
+    None (the default), files are copied.  Don't set 'link' on systems that
+    don't support it: 'copy_file()' doesn't check if hard or symbolic
+    linking is available. If hardlink fails, falls back to
+    _copy_file_contents().
+
+    Under Mac OS, uses the native file copy function in macostools; on
+    other systems, uses '_copy_file_contents()' to copy file contents.
+
+    Return a tuple (dest_name, copied): 'dest_name' is the actual name of
+    the output file, and 'copied' is true if the file was copied (or would
+    have been copied, if 'dry_run' true).
+    """
+    # XXX if the destination file already exists, we clobber it if
+    # copying, but blow up if linking.  Hmmm.  And I don't know what
+    # macostools.copyfile() does.  Should definitely be consistent, and
+    # should probably blow up if destination exists and we would be
+    # changing it (ie. it's not already a hard/soft link to src OR
+    # (not update) and (src newer than dst).
+
+    from distutils.dep_util import newer
+    from stat import ST_ATIME, ST_MTIME, ST_MODE, S_IMODE
+
+    if not os.path.isfile(src):
+        raise DistutilsFileError(
+              "can't copy '%s': doesn't exist or not a regular file" % src)
+
+    if os.path.isdir(dst):
+        dir = dst
+        dst = os.path.join(dst, os.path.basename(src))
+    else:
+        dir = os.path.dirname(dst)
+
+    if update and not newer(src, dst):
+        if verbose >= 1:
+            log.debug("not copying %s (output up-to-date)", src)
+        return (dst, 0)
+
+    try:
+        action = _copy_action[link]
+    except KeyError:
+        raise ValueError("invalid value '%s' for 'link' argument" % link)
+
+    if verbose >= 1:
+        if os.path.basename(dst) == os.path.basename(src):
+            log.info("%s %s -> %s", action, src, dir)
+        else:
+            log.info("%s %s -> %s", action, src, dst)
+
+    if dry_run:
+        return (dst, 1)
+
+    # If linking (hard or symbolic), use the appropriate system call
+    # (Unix only, of course, but that's the caller's responsibility)
+    elif link == 'hard':
+        if not (os.path.exists(dst) and os.path.samefile(src, dst)):
+            try:
+                os.link(src, dst)
+                return (dst, 1)
+            except OSError:
+                # If hard linking fails, fall back on copying file
+                # (some special filesystems don't support hard linking
+                #  even under Unix, see issue #8876).
+                pass
+    elif link == 'sym':
+        if not (os.path.exists(dst) and os.path.samefile(src, dst)):
+            os.symlink(src, dst)
+            return (dst, 1)
+
+    # Otherwise (non-Mac, not linking), copy the file contents and
+    # (optionally) copy the times and mode.
+    _copy_file_contents(src, dst)
+    if preserve_mode or preserve_times:
+        st = os.stat(src)
+
+        # According to David Ascher <da@ski.org>, utime() should be done
+        # before chmod() (at least under NT).
+        if preserve_times:
+            os.utime(dst, (st[ST_ATIME], st[ST_MTIME]))
+        if preserve_mode:
+            os.chmod(dst, S_IMODE(st[ST_MODE]))
+
+    return (dst, 1)
+
+
+# XXX I suspect this is Unix-specific -- need porting help!
+def move_file (src, dst,
+               verbose=1,
+               dry_run=0):
+
+    """Move a file 'src' to 'dst'.  If 'dst' is a directory, the file will
+    be moved into it with the same name; otherwise, 'src' is just renamed
+    to 'dst'.  Return the new full name of the file.
+
+    Handles cross-device moves on Unix using 'copy_file()'.  What about
+    other systems???
+    """
+    from os.path import exists, isfile, isdir, basename, dirname
+    import errno
+
+    if verbose >= 1:
+        log.info("moving %s -> %s", src, dst)
+
+    if dry_run:
+        return dst
+
+    if not isfile(src):
+        raise DistutilsFileError("can't move '%s': not a regular file" % src)
+
+    if isdir(dst):
+        dst = os.path.join(dst, basename(src))
+    elif exists(dst):
+        raise DistutilsFileError(
+              "can't move '%s': destination '%s' already exists" %
+              (src, dst))
+
+    if not isdir(dirname(dst)):
+        raise DistutilsFileError(
+              "can't move '%s': destination '%s' not a valid path" %
+              (src, dst))
+
+    copy_it = False
+    try:
+        os.rename(src, dst)
+    except OSError as e:
+        (num, msg) = e.args
+        if num == errno.EXDEV:
+            copy_it = True
+        else:
+            raise DistutilsFileError(
+                  "couldn't move '%s' to '%s': %s" % (src, dst, msg))
+
+    if copy_it:
+        copy_file(src, dst, verbose=verbose)
+        try:
+            os.unlink(src)
+        except OSError as e:
+            (num, msg) = e.args
+            try:
+                os.unlink(dst)
+            except OSError:
+                pass
+            raise DistutilsFileError(
+                  "couldn't move '%s' to '%s' by copy/delete: "
+                  "delete '%s' failed: %s"
+                  % (src, dst, src, msg))
+    return dst
+
+
+def write_file (filename, contents):
+    """Create a file with the specified name and write 'contents' (a
+    sequence of strings without line terminators) to it.
+    """
+    f = open(filename, "w")
+    try:
+        for line in contents:
+            f.write(line + "\n")
+    finally:
+        f.close()
diff --git a/venv/Lib/site-packages/setuptools/_distutils/filelist.py b/venv/Lib/site-packages/setuptools/_distutils/filelist.py
new file mode 100644
index 000000000..c92d5fdba
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/filelist.py
@@ -0,0 +1,327 @@
+"""distutils.filelist
+
+Provides the FileList class, used for poking about the filesystem
+and building lists of files.
+"""
+
+import os, re
+import fnmatch
+import functools
+from distutils.util import convert_path
+from distutils.errors import DistutilsTemplateError, DistutilsInternalError
+from distutils import log
+
+class FileList:
+    """A list of files built by on exploring the filesystem and filtered by
+    applying various patterns to what we find there.
+
+    Instance attributes:
+      dir
+        directory from which files will be taken -- only used if
+        'allfiles' not supplied to constructor
+      files
+        list of filenames currently being built/filtered/manipulated
+      allfiles
+        complete list of files under consideration (ie. without any
+        filtering applied)
+    """
+
+    def __init__(self, warn=None, debug_print=None):
+        # ignore argument to FileList, but keep them for backwards
+        # compatibility
+        self.allfiles = None
+        self.files = []
+
+    def set_allfiles(self, allfiles):
+        self.allfiles = allfiles
+
+    def findall(self, dir=os.curdir):
+        self.allfiles = findall(dir)
+
+    def debug_print(self, msg):
+        """Print 'msg' to stdout if the global DEBUG (taken from the
+        DISTUTILS_DEBUG environment variable) flag is true.
+        """
+        from distutils.debug import DEBUG
+        if DEBUG:
+            print(msg)
+
+    # -- List-like methods ---------------------------------------------
+
+    def append(self, item):
+        self.files.append(item)
+
+    def extend(self, items):
+        self.files.extend(items)
+
+    def sort(self):
+        # Not a strict lexical sort!
+        sortable_files = sorted(map(os.path.split, self.files))
+        self.files = []
+        for sort_tuple in sortable_files:
+            self.files.append(os.path.join(*sort_tuple))
+
+
+    # -- Other miscellaneous utility methods ---------------------------
+
+    def remove_duplicates(self):
+        # Assumes list has been sorted!
+        for i in range(len(self.files) - 1, 0, -1):
+            if self.files[i] == self.files[i - 1]:
+                del self.files[i]
+
+
+    # -- "File template" methods ---------------------------------------
+
+    def _parse_template_line(self, line):
+        words = line.split()
+        action = words[0]
+
+        patterns = dir = dir_pattern = None
+
+        if action in ('include', 'exclude',
+                      'global-include', 'global-exclude'):
+            if len(words) < 2:
+                raise DistutilsTemplateError(
+                      "'%s' expects <pattern1> <pattern2> ..." % action)
+            patterns = [convert_path(w) for w in words[1:]]
+        elif action in ('recursive-include', 'recursive-exclude'):
+            if len(words) < 3:
+                raise DistutilsTemplateError(
+                      "'%s' expects <dir> <pattern1> <pattern2> ..." % action)
+            dir = convert_path(words[1])
+            patterns = [convert_path(w) for w in words[2:]]
+        elif action in ('graft', 'prune'):
+            if len(words) != 2:
+                raise DistutilsTemplateError(
+                      "'%s' expects a single <dir_pattern>" % action)
+            dir_pattern = convert_path(words[1])
+        else:
+            raise DistutilsTemplateError("unknown action '%s'" % action)
+
+        return (action, patterns, dir, dir_pattern)
+
+    def process_template_line(self, line):
+        # Parse the line: split it up, make sure the right number of words
+        # is there, and return the relevant words.  'action' is always
+        # defined: it's the first word of the line.  Which of the other
+        # three are defined depends on the action; it'll be either
+        # patterns, (dir and patterns), or (dir_pattern).
+        (action, patterns, dir, dir_pattern) = self._parse_template_line(line)
+
+        # OK, now we know that the action is valid and we have the
+        # right number of words on the line for that action -- so we
+        # can proceed with minimal error-checking.
+        if action == 'include':
+            self.debug_print("include " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.include_pattern(pattern, anchor=1):
+                    log.warn("warning: no files found matching '%s'",
+                             pattern)
+
+        elif action == 'exclude':
+            self.debug_print("exclude " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.exclude_pattern(pattern, anchor=1):
+                    log.warn(("warning: no previously-included files "
+                              "found matching '%s'"), pattern)
+
+        elif action == 'global-include':
+            self.debug_print("global-include " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.include_pattern(pattern, anchor=0):
+                    log.warn(("warning: no files found matching '%s' "
+                              "anywhere in distribution"), pattern)
+
+        elif action == 'global-exclude':
+            self.debug_print("global-exclude " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.exclude_pattern(pattern, anchor=0):
+                    log.warn(("warning: no previously-included files matching "
+                              "'%s' found anywhere in distribution"),
+                             pattern)
+
+        elif action == 'recursive-include':
+            self.debug_print("recursive-include %s %s" %
+                             (dir, ' '.join(patterns)))
+            for pattern in patterns:
+                if not self.include_pattern(pattern, prefix=dir):
+                    log.warn(("warning: no files found matching '%s' "
+                                "under directory '%s'"),
+                             pattern, dir)
+
+        elif action == 'recursive-exclude':
+            self.debug_print("recursive-exclude %s %s" %
+                             (dir, ' '.join(patterns)))
+            for pattern in patterns:
+                if not self.exclude_pattern(pattern, prefix=dir):
+                    log.warn(("warning: no previously-included files matching "
+                              "'%s' found under directory '%s'"),
+                             pattern, dir)
+
+        elif action == 'graft':
+            self.debug_print("graft " + dir_pattern)
+            if not self.include_pattern(None, prefix=dir_pattern):
+                log.warn("warning: no directories found matching '%s'",
+                         dir_pattern)
+
+        elif action == 'prune':
+            self.debug_print("prune " + dir_pattern)
+            if not self.exclude_pattern(None, prefix=dir_pattern):
+                log.warn(("no previously-included directories found "
+                          "matching '%s'"), dir_pattern)
+        else:
+            raise DistutilsInternalError(
+                  "this cannot happen: invalid action '%s'" % action)
+
+
+    # -- Filtering/selection methods -----------------------------------
+
+    def include_pattern(self, pattern, anchor=1, prefix=None, is_regex=0):
+        """Select strings (presumably filenames) from 'self.files' that
+        match 'pattern', a Unix-style wildcard (glob) pattern.  Patterns
+        are not quite the same as implemented by the 'fnmatch' module: '*'
+        and '?'  match non-special characters, where "special" is platform-
+        dependent: slash on Unix; colon, slash, and backslash on
+        DOS/Windows; and colon on Mac OS.
+
+        If 'anchor' is true (the default), then the pattern match is more
+        stringent: "*.py" will match "foo.py" but not "foo/bar.py".  If
+        'anchor' is false, both of these will match.
+
+        If 'prefix' is supplied, then only filenames starting with 'prefix'
+        (itself a pattern) and ending with 'pattern', with anything in between
+        them, will match.  'anchor' is ignored in this case.
+
+        If 'is_regex' is true, 'anchor' and 'prefix' are ignored, and
+        'pattern' is assumed to be either a string containing a regex or a
+        regex object -- no translation is done, the regex is just compiled
+        and used as-is.
+
+        Selected strings will be added to self.files.
+
+        Return True if files are found, False otherwise.
+        """
+        # XXX docstring lying about what the special chars are?
+        files_found = False
+        pattern_re = translate_pattern(pattern, anchor, prefix, is_regex)
+        self.debug_print("include_pattern: applying regex r'%s'" %
+                         pattern_re.pattern)
+
+        # delayed loading of allfiles list
+        if self.allfiles is None:
+            self.findall()
+
+        for name in self.allfiles:
+            if pattern_re.search(name):
+                self.debug_print(" adding " + name)
+                self.files.append(name)
+                files_found = True
+        return files_found
+
+
+    def exclude_pattern (self, pattern,
+                         anchor=1, prefix=None, is_regex=0):
+        """Remove strings (presumably filenames) from 'files' that match
+        'pattern'.  Other parameters are the same as for
+        'include_pattern()', above.
+        The list 'self.files' is modified in place.
+        Return True if files are found, False otherwise.
+        """
+        files_found = False
+        pattern_re = translate_pattern(pattern, anchor, prefix, is_regex)
+        self.debug_print("exclude_pattern: applying regex r'%s'" %
+                         pattern_re.pattern)
+        for i in range(len(self.files)-1, -1, -1):
+            if pattern_re.search(self.files[i]):
+                self.debug_print(" removing " + self.files[i])
+                del self.files[i]
+                files_found = True
+        return files_found
+
+
+# ----------------------------------------------------------------------
+# Utility functions
+
+def _find_all_simple(path):
+    """
+    Find all files under 'path'
+    """
+    results = (
+        os.path.join(base, file)
+        for base, dirs, files in os.walk(path, followlinks=True)
+        for file in files
+    )
+    return filter(os.path.isfile, results)
+
+
+def findall(dir=os.curdir):
+    """
+    Find all files under 'dir' and return the list of full filenames.
+    Unless dir is '.', return full filenames with dir prepended.
+    """
+    files = _find_all_simple(dir)
+    if dir == os.curdir:
+        make_rel = functools.partial(os.path.relpath, start=dir)
+        files = map(make_rel, files)
+    return list(files)
+
+
+def glob_to_re(pattern):
+    """Translate a shell-like glob pattern to a regular expression; return
+    a string containing the regex.  Differs from 'fnmatch.translate()' in
+    that '*' does not match "special characters" (which are
+    platform-specific).
+    """
+    pattern_re = fnmatch.translate(pattern)
+
+    # '?' and '*' in the glob pattern become '.' and '.*' in the RE, which
+    # IMHO is wrong -- '?' and '*' aren't supposed to match slash in Unix,
+    # and by extension they shouldn't match such "special characters" under
+    # any OS.  So change all non-escaped dots in the RE to match any
+    # character except the special characters (currently: just os.sep).
+    sep = os.sep
+    if os.sep == '\\':
+        # we're using a regex to manipulate a regex, so we need
+        # to escape the backslash twice
+        sep = r'\\\\'
+    escaped = r'\1[^%s]' % sep
+    pattern_re = re.sub(r'((?<!\\)(\\\\)*)\.', escaped, pattern_re)
+    return pattern_re
+
+
+def translate_pattern(pattern, anchor=1, prefix=None, is_regex=0):
+    """Translate a shell-like wildcard pattern to a compiled regular
+    expression.  Return the compiled regex.  If 'is_regex' true,
+    then 'pattern' is directly compiled to a regex (if it's a string)
+    or just returned as-is (assumes it's a regex object).
+    """
+    if is_regex:
+        if isinstance(pattern, str):
+            return re.compile(pattern)
+        else:
+            return pattern
+
+    # ditch start and end characters
+    start, _, end = glob_to_re('_').partition('_')
+
+    if pattern:
+        pattern_re = glob_to_re(pattern)
+        assert pattern_re.startswith(start) and pattern_re.endswith(end)
+    else:
+        pattern_re = ''
+
+    if prefix is not None:
+        prefix_re = glob_to_re(prefix)
+        assert prefix_re.startswith(start) and prefix_re.endswith(end)
+        prefix_re = prefix_re[len(start): len(prefix_re) - len(end)]
+        sep = os.sep
+        if os.sep == '\\':
+            sep = r'\\'
+        pattern_re = pattern_re[len(start): len(pattern_re) - len(end)]
+        pattern_re = r'%s\A%s%s.*%s%s' % (start, prefix_re, sep, pattern_re, end)
+    else:                               # no prefix -- respect anchor flag
+        if anchor:
+            pattern_re = r'%s\A%s' % (start, pattern_re[len(start):])
+
+    return re.compile(pattern_re)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/log.py b/venv/Lib/site-packages/setuptools/_distutils/log.py
new file mode 100644
index 000000000..8ef6b28ea
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/log.py
@@ -0,0 +1,77 @@
+"""A simple log mechanism styled after PEP 282."""
+
+# The class here is styled after PEP 282 so that it could later be
+# replaced with a standard Python logging implementation.
+
+DEBUG = 1
+INFO = 2
+WARN = 3
+ERROR = 4
+FATAL = 5
+
+import sys
+
+class Log:
+
+    def __init__(self, threshold=WARN):
+        self.threshold = threshold
+
+    def _log(self, level, msg, args):
+        if level not in (DEBUG, INFO, WARN, ERROR, FATAL):
+            raise ValueError('%s wrong log level' % str(level))
+
+        if level >= self.threshold:
+            if args:
+                msg = msg % args
+            if level in (WARN, ERROR, FATAL):
+                stream = sys.stderr
+            else:
+                stream = sys.stdout
+            try:
+                stream.write('%s\n' % msg)
+            except UnicodeEncodeError:
+                # emulate backslashreplace error handler
+                encoding = stream.encoding
+                msg = msg.encode(encoding, "backslashreplace").decode(encoding)
+                stream.write('%s\n' % msg)
+            stream.flush()
+
+    def log(self, level, msg, *args):
+        self._log(level, msg, args)
+
+    def debug(self, msg, *args):
+        self._log(DEBUG, msg, args)
+
+    def info(self, msg, *args):
+        self._log(INFO, msg, args)
+
+    def warn(self, msg, *args):
+        self._log(WARN, msg, args)
+
+    def error(self, msg, *args):
+        self._log(ERROR, msg, args)
+
+    def fatal(self, msg, *args):
+        self._log(FATAL, msg, args)
+
+_global_log = Log()
+log = _global_log.log
+debug = _global_log.debug
+info = _global_log.info
+warn = _global_log.warn
+error = _global_log.error
+fatal = _global_log.fatal
+
+def set_threshold(level):
+    # return the old threshold for use from tests
+    old = _global_log.threshold
+    _global_log.threshold = level
+    return old
+
+def set_verbosity(v):
+    if v <= 0:
+        set_threshold(WARN)
+    elif v == 1:
+        set_threshold(INFO)
+    elif v >= 2:
+        set_threshold(DEBUG)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/msvc9compiler.py b/venv/Lib/site-packages/setuptools/_distutils/msvc9compiler.py
new file mode 100644
index 000000000..6934e964a
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/msvc9compiler.py
@@ -0,0 +1,788 @@
+"""distutils.msvc9compiler
+
+Contains MSVCCompiler, an implementation of the abstract CCompiler class
+for the Microsoft Visual Studio 2008.
+
+The module is compatible with VS 2005 and VS 2008. You can find legacy support
+for older versions of VS in distutils.msvccompiler.
+"""
+
+# Written by Perry Stoll
+# hacked by Robin Becker and Thomas Heller to do a better job of
+#   finding DevStudio (through the registry)
+# ported to VS2005 and VS 2008 by Christian Heimes
+
+import os
+import subprocess
+import sys
+import re
+
+from distutils.errors import DistutilsExecError, DistutilsPlatformError, \
+                             CompileError, LibError, LinkError
+from distutils.ccompiler import CCompiler, gen_lib_options
+from distutils import log
+from distutils.util import get_platform
+
+import winreg
+
+RegOpenKeyEx = winreg.OpenKeyEx
+RegEnumKey = winreg.EnumKey
+RegEnumValue = winreg.EnumValue
+RegError = winreg.error
+
+HKEYS = (winreg.HKEY_USERS,
+         winreg.HKEY_CURRENT_USER,
+         winreg.HKEY_LOCAL_MACHINE,
+         winreg.HKEY_CLASSES_ROOT)
+
+NATIVE_WIN64 = (sys.platform == 'win32' and sys.maxsize > 2**32)
+if NATIVE_WIN64:
+    # Visual C++ is a 32-bit application, so we need to look in
+    # the corresponding registry branch, if we're running a
+    # 64-bit Python on Win64
+    VS_BASE = r"Software\Wow6432Node\Microsoft\VisualStudio\%0.1f"
+    WINSDK_BASE = r"Software\Wow6432Node\Microsoft\Microsoft SDKs\Windows"
+    NET_BASE = r"Software\Wow6432Node\Microsoft\.NETFramework"
+else:
+    VS_BASE = r"Software\Microsoft\VisualStudio\%0.1f"
+    WINSDK_BASE = r"Software\Microsoft\Microsoft SDKs\Windows"
+    NET_BASE = r"Software\Microsoft\.NETFramework"
+
+# A map keyed by get_platform() return values to values accepted by
+# 'vcvarsall.bat'.  Note a cross-compile may combine these (eg, 'x86_amd64' is
+# the param to cross-compile on x86 targeting amd64.)
+PLAT_TO_VCVARS = {
+    'win32' : 'x86',
+    'win-amd64' : 'amd64',
+}
+
+class Reg:
+    """Helper class to read values from the registry
+    """
+
+    def get_value(cls, path, key):
+        for base in HKEYS:
+            d = cls.read_values(base, path)
+            if d and key in d:
+                return d[key]
+        raise KeyError(key)
+    get_value = classmethod(get_value)
+
+    def read_keys(cls, base, key):
+        """Return list of registry keys."""
+        try:
+            handle = RegOpenKeyEx(base, key)
+        except RegError:
+            return None
+        L = []
+        i = 0
+        while True:
+            try:
+                k = RegEnumKey(handle, i)
+            except RegError:
+                break
+            L.append(k)
+            i += 1
+        return L
+    read_keys = classmethod(read_keys)
+
+    def read_values(cls, base, key):
+        """Return dict of registry keys and values.
+
+        All names are converted to lowercase.
+        """
+        try:
+            handle = RegOpenKeyEx(base, key)
+        except RegError:
+            return None
+        d = {}
+        i = 0
+        while True:
+            try:
+                name, value, type = RegEnumValue(handle, i)
+            except RegError:
+                break
+            name = name.lower()
+            d[cls.convert_mbcs(name)] = cls.convert_mbcs(value)
+            i += 1
+        return d
+    read_values = classmethod(read_values)
+
+    def convert_mbcs(s):
+        dec = getattr(s, "decode", None)
+        if dec is not None:
+            try:
+                s = dec("mbcs")
+            except UnicodeError:
+                pass
+        return s
+    convert_mbcs = staticmethod(convert_mbcs)
+
+class MacroExpander:
+
+    def __init__(self, version):
+        self.macros = {}
+        self.vsbase = VS_BASE % version
+        self.load_macros(version)
+
+    def set_macro(self, macro, path, key):
+        self.macros["$(%s)" % macro] = Reg.get_value(path, key)
+
+    def load_macros(self, version):
+        self.set_macro("VCInstallDir", self.vsbase + r"\Setup\VC", "productdir")
+        self.set_macro("VSInstallDir", self.vsbase + r"\Setup\VS", "productdir")
+        self.set_macro("FrameworkDir", NET_BASE, "installroot")
+        try:
+            if version >= 8.0:
+                self.set_macro("FrameworkSDKDir", NET_BASE,
+                               "sdkinstallrootv2.0")
+            else:
+                raise KeyError("sdkinstallrootv2.0")
+        except KeyError:
+            raise DistutilsPlatformError(
+            """Python was built with Visual Studio 2008;
+extensions must be built with a compiler than can generate compatible binaries.
+Visual Studio 2008 was not found on this system. If you have Cygwin installed,
+you can try compiling with MingW32, by passing "-c mingw32" to setup.py.""")
+
+        if version >= 9.0:
+            self.set_macro("FrameworkVersion", self.vsbase, "clr version")
+            self.set_macro("WindowsSdkDir", WINSDK_BASE, "currentinstallfolder")
+        else:
+            p = r"Software\Microsoft\NET Framework Setup\Product"
+            for base in HKEYS:
+                try:
+                    h = RegOpenKeyEx(base, p)
+                except RegError:
+                    continue
+                key = RegEnumKey(h, 0)
+                d = Reg.get_value(base, r"%s\%s" % (p, key))
+                self.macros["$(FrameworkVersion)"] = d["version"]
+
+    def sub(self, s):
+        for k, v in self.macros.items():
+            s = s.replace(k, v)
+        return s
+
+def get_build_version():
+    """Return the version of MSVC that was used to build Python.
+
+    For Python 2.3 and up, the version number is included in
+    sys.version.  For earlier versions, assume the compiler is MSVC 6.
+    """
+    prefix = "MSC v."
+    i = sys.version.find(prefix)
+    if i == -1:
+        return 6
+    i = i + len(prefix)
+    s, rest = sys.version[i:].split(" ", 1)
+    majorVersion = int(s[:-2]) - 6
+    if majorVersion >= 13:
+        # v13 was skipped and should be v14
+        majorVersion += 1
+    minorVersion = int(s[2:3]) / 10.0
+    # I don't think paths are affected by minor version in version 6
+    if majorVersion == 6:
+        minorVersion = 0
+    if majorVersion >= 6:
+        return majorVersion + minorVersion
+    # else we don't know what version of the compiler this is
+    return None
+
+def normalize_and_reduce_paths(paths):
+    """Return a list of normalized paths with duplicates removed.
+
+    The current order of paths is maintained.
+    """
+    # Paths are normalized so things like:  /a and /a/ aren't both preserved.
+    reduced_paths = []
+    for p in paths:
+        np = os.path.normpath(p)
+        # XXX(nnorwitz): O(n**2), if reduced_paths gets long perhaps use a set.
+        if np not in reduced_paths:
+            reduced_paths.append(np)
+    return reduced_paths
+
+def removeDuplicates(variable):
+    """Remove duplicate values of an environment variable.
+    """
+    oldList = variable.split(os.pathsep)
+    newList = []
+    for i in oldList:
+        if i not in newList:
+            newList.append(i)
+    newVariable = os.pathsep.join(newList)
+    return newVariable
+
+def find_vcvarsall(version):
+    """Find the vcvarsall.bat file
+
+    At first it tries to find the productdir of VS 2008 in the registry. If
+    that fails it falls back to the VS90COMNTOOLS env var.
+    """
+    vsbase = VS_BASE % version
+    try:
+        productdir = Reg.get_value(r"%s\Setup\VC" % vsbase,
+                                   "productdir")
+    except KeyError:
+        log.debug("Unable to find productdir in registry")
+        productdir = None
+
+    if not productdir or not os.path.isdir(productdir):
+        toolskey = "VS%0.f0COMNTOOLS" % version
+        toolsdir = os.environ.get(toolskey, None)
+
+        if toolsdir and os.path.isdir(toolsdir):
+            productdir = os.path.join(toolsdir, os.pardir, os.pardir, "VC")
+            productdir = os.path.abspath(productdir)
+            if not os.path.isdir(productdir):
+                log.debug("%s is not a valid directory" % productdir)
+                return None
+        else:
+            log.debug("Env var %s is not set or invalid" % toolskey)
+    if not productdir:
+        log.debug("No productdir found")
+        return None
+    vcvarsall = os.path.join(productdir, "vcvarsall.bat")
+    if os.path.isfile(vcvarsall):
+        return vcvarsall
+    log.debug("Unable to find vcvarsall.bat")
+    return None
+
+def query_vcvarsall(version, arch="x86"):
+    """Launch vcvarsall.bat and read the settings from its environment
+    """
+    vcvarsall = find_vcvarsall(version)
+    interesting = {"include", "lib", "libpath", "path"}
+    result = {}
+
+    if vcvarsall is None:
+        raise DistutilsPlatformError("Unable to find vcvarsall.bat")
+    log.debug("Calling 'vcvarsall.bat %s' (version=%s)", arch, version)
+    popen = subprocess.Popen('"%s" %s & set' % (vcvarsall, arch),
+                             stdout=subprocess.PIPE,
+                             stderr=subprocess.PIPE)
+    try:
+        stdout, stderr = popen.communicate()
+        if popen.wait() != 0:
+            raise DistutilsPlatformError(stderr.decode("mbcs"))
+
+        stdout = stdout.decode("mbcs")
+        for line in stdout.split("\n"):
+            line = Reg.convert_mbcs(line)
+            if '=' not in line:
+                continue
+            line = line.strip()
+            key, value = line.split('=', 1)
+            key = key.lower()
+            if key in interesting:
+                if value.endswith(os.pathsep):
+                    value = value[:-1]
+                result[key] = removeDuplicates(value)
+
+    finally:
+        popen.stdout.close()
+        popen.stderr.close()
+
+    if len(result) != len(interesting):
+        raise ValueError(str(list(result.keys())))
+
+    return result
+
+# More globals
+VERSION = get_build_version()
+if VERSION < 8.0:
+    raise DistutilsPlatformError("VC %0.1f is not supported by this module" % VERSION)
+# MACROS = MacroExpander(VERSION)
+
+class MSVCCompiler(CCompiler) :
+    """Concrete class that implements an interface to Microsoft Visual C++,
+       as defined by the CCompiler abstract class."""
+
+    compiler_type = 'msvc'
+
+    # Just set this so CCompiler's constructor doesn't barf.  We currently
+    # don't use the 'set_executables()' bureaucracy provided by CCompiler,
+    # as it really isn't necessary for this sort of single-compiler class.
+    # Would be nice to have a consistent interface with UnixCCompiler,
+    # though, so it's worth thinking about.
+    executables = {}
+
+    # Private class data (need to distinguish C from C++ source for compiler)
+    _c_extensions = ['.c']
+    _cpp_extensions = ['.cc', '.cpp', '.cxx']
+    _rc_extensions = ['.rc']
+    _mc_extensions = ['.mc']
+
+    # Needed for the filename generation methods provided by the
+    # base class, CCompiler.
+    src_extensions = (_c_extensions + _cpp_extensions +
+                      _rc_extensions + _mc_extensions)
+    res_extension = '.res'
+    obj_extension = '.obj'
+    static_lib_extension = '.lib'
+    shared_lib_extension = '.dll'
+    static_lib_format = shared_lib_format = '%s%s'
+    exe_extension = '.exe'
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        CCompiler.__init__ (self, verbose, dry_run, force)
+        self.__version = VERSION
+        self.__root = r"Software\Microsoft\VisualStudio"
+        # self.__macros = MACROS
+        self.__paths = []
+        # target platform (.plat_name is consistent with 'bdist')
+        self.plat_name = None
+        self.__arch = None # deprecated name
+        self.initialized = False
+
+    def initialize(self, plat_name=None):
+        # multi-init means we would need to check platform same each time...
+        assert not self.initialized, "don't init multiple times"
+        if plat_name is None:
+            plat_name = get_platform()
+        # sanity check for platforms to prevent obscure errors later.
+        ok_plats = 'win32', 'win-amd64'
+        if plat_name not in ok_plats:
+            raise DistutilsPlatformError("--plat-name must be one of %s" %
+                                         (ok_plats,))
+
+        if "DISTUTILS_USE_SDK" in os.environ and "MSSdk" in os.environ and self.find_exe("cl.exe"):
+            # Assume that the SDK set up everything alright; don't try to be
+            # smarter
+            self.cc = "cl.exe"
+            self.linker = "link.exe"
+            self.lib = "lib.exe"
+            self.rc = "rc.exe"
+            self.mc = "mc.exe"
+        else:
+            # On x86, 'vcvars32.bat amd64' creates an env that doesn't work;
+            # to cross compile, you use 'x86_amd64'.
+            # On AMD64, 'vcvars32.bat amd64' is a native build env; to cross
+            # compile use 'x86' (ie, it runs the x86 compiler directly)
+            if plat_name == get_platform() or plat_name == 'win32':
+                # native build or cross-compile to win32
+                plat_spec = PLAT_TO_VCVARS[plat_name]
+            else:
+                # cross compile from win32 -> some 64bit
+                plat_spec = PLAT_TO_VCVARS[get_platform()] + '_' + \
+                            PLAT_TO_VCVARS[plat_name]
+
+            vc_env = query_vcvarsall(VERSION, plat_spec)
+
+            self.__paths = vc_env['path'].split(os.pathsep)
+            os.environ['lib'] = vc_env['lib']
+            os.environ['include'] = vc_env['include']
+
+            if len(self.__paths) == 0:
+                raise DistutilsPlatformError("Python was built with %s, "
+                       "and extensions need to be built with the same "
+                       "version of the compiler, but it isn't installed."
+                       % self.__product)
+
+            self.cc = self.find_exe("cl.exe")
+            self.linker = self.find_exe("link.exe")
+            self.lib = self.find_exe("lib.exe")
+            self.rc = self.find_exe("rc.exe")   # resource compiler
+            self.mc = self.find_exe("mc.exe")   # message compiler
+            #self.set_path_env_var('lib')
+            #self.set_path_env_var('include')
+
+        # extend the MSVC path with the current path
+        try:
+            for p in os.environ['path'].split(';'):
+                self.__paths.append(p)
+        except KeyError:
+            pass
+        self.__paths = normalize_and_reduce_paths(self.__paths)
+        os.environ['path'] = ";".join(self.__paths)
+
+        self.preprocess_options = None
+        if self.__arch == "x86":
+            self.compile_options = [ '/nologo', '/Ox', '/MD', '/W3',
+                                     '/DNDEBUG']
+            self.compile_options_debug = ['/nologo', '/Od', '/MDd', '/W3',
+                                          '/Z7', '/D_DEBUG']
+        else:
+            # Win64
+            self.compile_options = [ '/nologo', '/Ox', '/MD', '/W3', '/GS-' ,
+                                     '/DNDEBUG']
+            self.compile_options_debug = ['/nologo', '/Od', '/MDd', '/W3', '/GS-',
+                                          '/Z7', '/D_DEBUG']
+
+        self.ldflags_shared = ['/DLL', '/nologo', '/INCREMENTAL:NO']
+        if self.__version >= 7:
+            self.ldflags_shared_debug = [
+                '/DLL', '/nologo', '/INCREMENTAL:no', '/DEBUG'
+                ]
+        self.ldflags_static = [ '/nologo']
+
+        self.initialized = True
+
+    # -- Worker methods ------------------------------------------------
+
+    def object_filenames(self,
+                         source_filenames,
+                         strip_dir=0,
+                         output_dir=''):
+        # Copied from ccompiler.py, extended to return .res as 'object'-file
+        # for .rc input file
+        if output_dir is None: output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            (base, ext) = os.path.splitext (src_name)
+            base = os.path.splitdrive(base)[1] # Chop off the drive
+            base = base[os.path.isabs(base):]  # If abs, chop off leading /
+            if ext not in self.src_extensions:
+                # Better to raise an exception instead of silently continuing
+                # and later complain about sources and targets having
+                # different lengths
+                raise CompileError ("Don't know how to compile %s" % src_name)
+            if strip_dir:
+                base = os.path.basename (base)
+            if ext in self._rc_extensions:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.res_extension))
+            elif ext in self._mc_extensions:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.res_extension))
+            else:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.obj_extension))
+        return obj_names
+
+
+    def compile(self, sources,
+                output_dir=None, macros=None, include_dirs=None, debug=0,
+                extra_preargs=None, extra_postargs=None, depends=None):
+
+        if not self.initialized:
+            self.initialize()
+        compile_info = self._setup_compile(output_dir, macros, include_dirs,
+                                           sources, depends, extra_postargs)
+        macros, objects, extra_postargs, pp_opts, build = compile_info
+
+        compile_opts = extra_preargs or []
+        compile_opts.append ('/c')
+        if debug:
+            compile_opts.extend(self.compile_options_debug)
+        else:
+            compile_opts.extend(self.compile_options)
+
+        for obj in objects:
+            try:
+                src, ext = build[obj]
+            except KeyError:
+                continue
+            if debug:
+                # pass the full pathname to MSVC in debug mode,
+                # this allows the debugger to find the source file
+                # without asking the user to browse for it
+                src = os.path.abspath(src)
+
+            if ext in self._c_extensions:
+                input_opt = "/Tc" + src
+            elif ext in self._cpp_extensions:
+                input_opt = "/Tp" + src
+            elif ext in self._rc_extensions:
+                # compile .RC to .RES file
+                input_opt = src
+                output_opt = "/fo" + obj
+                try:
+                    self.spawn([self.rc] + pp_opts +
+                               [output_opt] + [input_opt])
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            elif ext in self._mc_extensions:
+                # Compile .MC to .RC file to .RES file.
+                #   * '-h dir' specifies the directory for the
+                #     generated include file
+                #   * '-r dir' specifies the target directory of the
+                #     generated RC file and the binary message resource
+                #     it includes
+                #
+                # For now (since there are no options to change this),
+                # we use the source-directory for the include file and
+                # the build directory for the RC file and message
+                # resources. This works at least for win32all.
+                h_dir = os.path.dirname(src)
+                rc_dir = os.path.dirname(obj)
+                try:
+                    # first compile .MC to .RC and .H file
+                    self.spawn([self.mc] +
+                               ['-h', h_dir, '-r', rc_dir] + [src])
+                    base, _ = os.path.splitext (os.path.basename (src))
+                    rc_file = os.path.join (rc_dir, base + '.rc')
+                    # then compile .RC to .RES file
+                    self.spawn([self.rc] +
+                               ["/fo" + obj] + [rc_file])
+
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            else:
+                # how to handle this file?
+                raise CompileError("Don't know how to compile %s to %s"
+                                   % (src, obj))
+
+            output_opt = "/Fo" + obj
+            try:
+                self.spawn([self.cc] + compile_opts + pp_opts +
+                           [input_opt, output_opt] +
+                           extra_postargs)
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+        return objects
+
+
+    def create_static_lib(self,
+                          objects,
+                          output_libname,
+                          output_dir=None,
+                          debug=0,
+                          target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        (objects, output_dir) = self._fix_object_args(objects, output_dir)
+        output_filename = self.library_filename(output_libname,
+                                                output_dir=output_dir)
+
+        if self._need_link(objects, output_filename):
+            lib_args = objects + ['/OUT:' + output_filename]
+            if debug:
+                pass # XXX what goes here?
+            try:
+                self.spawn([self.lib] + lib_args)
+            except DistutilsExecError as msg:
+                raise LibError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+
+    def link(self,
+             target_desc,
+             objects,
+             output_filename,
+             output_dir=None,
+             libraries=None,
+             library_dirs=None,
+             runtime_library_dirs=None,
+             export_symbols=None,
+             debug=0,
+             extra_preargs=None,
+             extra_postargs=None,
+             build_temp=None,
+             target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        (objects, output_dir) = self._fix_object_args(objects, output_dir)
+        fixed_args = self._fix_lib_args(libraries, library_dirs,
+                                        runtime_library_dirs)
+        (libraries, library_dirs, runtime_library_dirs) = fixed_args
+
+        if runtime_library_dirs:
+            self.warn ("I don't know what to do with 'runtime_library_dirs': "
+                       + str (runtime_library_dirs))
+
+        lib_opts = gen_lib_options(self,
+                                   library_dirs, runtime_library_dirs,
+                                   libraries)
+        if output_dir is not None:
+            output_filename = os.path.join(output_dir, output_filename)
+
+        if self._need_link(objects, output_filename):
+            if target_desc == CCompiler.EXECUTABLE:
+                if debug:
+                    ldflags = self.ldflags_shared_debug[1:]
+                else:
+                    ldflags = self.ldflags_shared[1:]
+            else:
+                if debug:
+                    ldflags = self.ldflags_shared_debug
+                else:
+                    ldflags = self.ldflags_shared
+
+            export_opts = []
+            for sym in (export_symbols or []):
+                export_opts.append("/EXPORT:" + sym)
+
+            ld_args = (ldflags + lib_opts + export_opts +
+                       objects + ['/OUT:' + output_filename])
+
+            # The MSVC linker generates .lib and .exp files, which cannot be
+            # suppressed by any linker switches. The .lib files may even be
+            # needed! Make sure they are generated in the temporary build
+            # directory. Since they have different names for debug and release
+            # builds, they can go into the same directory.
+            build_temp = os.path.dirname(objects[0])
+            if export_symbols is not None:
+                (dll_name, dll_ext) = os.path.splitext(
+                    os.path.basename(output_filename))
+                implib_file = os.path.join(
+                    build_temp,
+                    self.library_filename(dll_name))
+                ld_args.append ('/IMPLIB:' + implib_file)
+
+            self.manifest_setup_ldargs(output_filename, build_temp, ld_args)
+
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+
+            self.mkpath(os.path.dirname(output_filename))
+            try:
+                self.spawn([self.linker] + ld_args)
+            except DistutilsExecError as msg:
+                raise LinkError(msg)
+
+            # embed the manifest
+            # XXX - this is somewhat fragile - if mt.exe fails, distutils
+            # will still consider the DLL up-to-date, but it will not have a
+            # manifest.  Maybe we should link to a temp file?  OTOH, that
+            # implies a build environment error that shouldn't go undetected.
+            mfinfo = self.manifest_get_embed_info(target_desc, ld_args)
+            if mfinfo is not None:
+                mffilename, mfid = mfinfo
+                out_arg = '-outputresource:%s;%s' % (output_filename, mfid)
+                try:
+                    self.spawn(['mt.exe', '-nologo', '-manifest',
+                                mffilename, out_arg])
+                except DistutilsExecError as msg:
+                    raise LinkError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    def manifest_setup_ldargs(self, output_filename, build_temp, ld_args):
+        # If we need a manifest at all, an embedded manifest is recommended.
+        # See MSDN article titled
+        # "How to: Embed a Manifest Inside a C/C++ Application"
+        # (currently at http://msdn2.microsoft.com/en-us/library/ms235591(VS.80).aspx)
+        # Ask the linker to generate the manifest in the temp dir, so
+        # we can check it, and possibly embed it, later.
+        temp_manifest = os.path.join(
+                build_temp,
+                os.path.basename(output_filename) + ".manifest")
+        ld_args.append('/MANIFESTFILE:' + temp_manifest)
+
+    def manifest_get_embed_info(self, target_desc, ld_args):
+        # If a manifest should be embedded, return a tuple of
+        # (manifest_filename, resource_id).  Returns None if no manifest
+        # should be embedded.  See http://bugs.python.org/issue7833 for why
+        # we want to avoid any manifest for extension modules if we can)
+        for arg in ld_args:
+            if arg.startswith("/MANIFESTFILE:"):
+                temp_manifest = arg.split(":", 1)[1]
+                break
+        else:
+            # no /MANIFESTFILE so nothing to do.
+            return None
+        if target_desc == CCompiler.EXECUTABLE:
+            # by default, executables always get the manifest with the
+            # CRT referenced.
+            mfid = 1
+        else:
+            # Extension modules try and avoid any manifest if possible.
+            mfid = 2
+            temp_manifest = self._remove_visual_c_ref(temp_manifest)
+        if temp_manifest is None:
+            return None
+        return temp_manifest, mfid
+
+    def _remove_visual_c_ref(self, manifest_file):
+        try:
+            # Remove references to the Visual C runtime, so they will
+            # fall through to the Visual C dependency of Python.exe.
+            # This way, when installed for a restricted user (e.g.
+            # runtimes are not in WinSxS folder, but in Python's own
+            # folder), the runtimes do not need to be in every folder
+            # with .pyd's.
+            # Returns either the filename of the modified manifest or
+            # None if no manifest should be embedded.
+            manifest_f = open(manifest_file)
+            try:
+                manifest_buf = manifest_f.read()
+            finally:
+                manifest_f.close()
+            pattern = re.compile(
+                r"""<assemblyIdentity.*?name=("|')Microsoft\."""\
+                r"""VC\d{2}\.CRT("|').*?(/>|</assemblyIdentity>)""",
+                re.DOTALL)
+            manifest_buf = re.sub(pattern, "", manifest_buf)
+            pattern = r"<dependentAssembly>\s*</dependentAssembly>"
+            manifest_buf = re.sub(pattern, "", manifest_buf)
+            # Now see if any other assemblies are referenced - if not, we
+            # don't want a manifest embedded.
+            pattern = re.compile(
+                r"""<assemblyIdentity.*?name=(?:"|')(.+?)(?:"|')"""
+                r""".*?(?:/>|</assemblyIdentity>)""", re.DOTALL)
+            if re.search(pattern, manifest_buf) is None:
+                return None
+
+            manifest_f = open(manifest_file, 'w')
+            try:
+                manifest_f.write(manifest_buf)
+                return manifest_file
+            finally:
+                manifest_f.close()
+        except OSError:
+            pass
+
+    # -- Miscellaneous methods -----------------------------------------
+    # These are all used by the 'gen_lib_options() function, in
+    # ccompiler.py.
+
+    def library_dir_option(self, dir):
+        return "/LIBPATH:" + dir
+
+    def runtime_library_dir_option(self, dir):
+        raise DistutilsPlatformError(
+              "don't know how to set runtime library search path for MSVC++")
+
+    def library_option(self, lib):
+        return self.library_filename(lib)
+
+
+    def find_library_file(self, dirs, lib, debug=0):
+        # Prefer a debugging library if found (and requested), but deal
+        # with it if we don't have one.
+        if debug:
+            try_names = [lib + "_d", lib]
+        else:
+            try_names = [lib]
+        for dir in dirs:
+            for name in try_names:
+                libfile = os.path.join(dir, self.library_filename (name))
+                if os.path.exists(libfile):
+                    return libfile
+        else:
+            # Oops, didn't find it in *any* of 'dirs'
+            return None
+
+    # Helper methods for using the MSVC registry settings
+
+    def find_exe(self, exe):
+        """Return path to an MSVC executable program.
+
+        Tries to find the program in several places: first, one of the
+        MSVC program search paths from the registry; next, the directories
+        in the PATH environment variable.  If any of those work, return an
+        absolute path that is known to exist.  If none of them work, just
+        return the original program name, 'exe'.
+        """
+        for p in self.__paths:
+            fn = os.path.join(os.path.abspath(p), exe)
+            if os.path.isfile(fn):
+                return fn
+
+        # didn't find it; try existing path
+        for p in os.environ['Path'].split(';'):
+            fn = os.path.join(os.path.abspath(p),exe)
+            if os.path.isfile(fn):
+                return fn
+
+        return exe
diff --git a/venv/Lib/site-packages/setuptools/_distutils/msvccompiler.py b/venv/Lib/site-packages/setuptools/_distutils/msvccompiler.py
new file mode 100644
index 000000000..d5857cb1f
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/msvccompiler.py
@@ -0,0 +1,643 @@
+"""distutils.msvccompiler
+
+Contains MSVCCompiler, an implementation of the abstract CCompiler class
+for the Microsoft Visual Studio.
+"""
+
+# Written by Perry Stoll
+# hacked by Robin Becker and Thomas Heller to do a better job of
+#   finding DevStudio (through the registry)
+
+import sys, os
+from distutils.errors import \
+     DistutilsExecError, DistutilsPlatformError, \
+     CompileError, LibError, LinkError
+from distutils.ccompiler import \
+     CCompiler, gen_lib_options
+from distutils import log
+
+_can_read_reg = False
+try:
+    import winreg
+
+    _can_read_reg = True
+    hkey_mod = winreg
+
+    RegOpenKeyEx = winreg.OpenKeyEx
+    RegEnumKey = winreg.EnumKey
+    RegEnumValue = winreg.EnumValue
+    RegError = winreg.error
+
+except ImportError:
+    try:
+        import win32api
+        import win32con
+        _can_read_reg = True
+        hkey_mod = win32con
+
+        RegOpenKeyEx = win32api.RegOpenKeyEx
+        RegEnumKey = win32api.RegEnumKey
+        RegEnumValue = win32api.RegEnumValue
+        RegError = win32api.error
+    except ImportError:
+        log.info("Warning: Can't read registry to find the "
+                 "necessary compiler setting\n"
+                 "Make sure that Python modules winreg, "
+                 "win32api or win32con are installed.")
+        pass
+
+if _can_read_reg:
+    HKEYS = (hkey_mod.HKEY_USERS,
+             hkey_mod.HKEY_CURRENT_USER,
+             hkey_mod.HKEY_LOCAL_MACHINE,
+             hkey_mod.HKEY_CLASSES_ROOT)
+
+def read_keys(base, key):
+    """Return list of registry keys."""
+    try:
+        handle = RegOpenKeyEx(base, key)
+    except RegError:
+        return None
+    L = []
+    i = 0
+    while True:
+        try:
+            k = RegEnumKey(handle, i)
+        except RegError:
+            break
+        L.append(k)
+        i += 1
+    return L
+
+def read_values(base, key):
+    """Return dict of registry keys and values.
+
+    All names are converted to lowercase.
+    """
+    try:
+        handle = RegOpenKeyEx(base, key)
+    except RegError:
+        return None
+    d = {}
+    i = 0
+    while True:
+        try:
+            name, value, type = RegEnumValue(handle, i)
+        except RegError:
+            break
+        name = name.lower()
+        d[convert_mbcs(name)] = convert_mbcs(value)
+        i += 1
+    return d
+
+def convert_mbcs(s):
+    dec = getattr(s, "decode", None)
+    if dec is not None:
+        try:
+            s = dec("mbcs")
+        except UnicodeError:
+            pass
+    return s
+
+class MacroExpander:
+    def __init__(self, version):
+        self.macros = {}
+        self.load_macros(version)
+
+    def set_macro(self, macro, path, key):
+        for base in HKEYS:
+            d = read_values(base, path)
+            if d:
+                self.macros["$(%s)" % macro] = d[key]
+                break
+
+    def load_macros(self, version):
+        vsbase = r"Software\Microsoft\VisualStudio\%0.1f" % version
+        self.set_macro("VCInstallDir", vsbase + r"\Setup\VC", "productdir")
+        self.set_macro("VSInstallDir", vsbase + r"\Setup\VS", "productdir")
+        net = r"Software\Microsoft\.NETFramework"
+        self.set_macro("FrameworkDir", net, "installroot")
+        try:
+            if version > 7.0:
+                self.set_macro("FrameworkSDKDir", net, "sdkinstallrootv1.1")
+            else:
+                self.set_macro("FrameworkSDKDir", net, "sdkinstallroot")
+        except KeyError as exc: #
+            raise DistutilsPlatformError(
+            """Python was built with Visual Studio 2003;
+extensions must be built with a compiler than can generate compatible binaries.
+Visual Studio 2003 was not found on this system. If you have Cygwin installed,
+you can try compiling with MingW32, by passing "-c mingw32" to setup.py.""")
+
+        p = r"Software\Microsoft\NET Framework Setup\Product"
+        for base in HKEYS:
+            try:
+                h = RegOpenKeyEx(base, p)
+            except RegError:
+                continue
+            key = RegEnumKey(h, 0)
+            d = read_values(base, r"%s\%s" % (p, key))
+            self.macros["$(FrameworkVersion)"] = d["version"]
+
+    def sub(self, s):
+        for k, v in self.macros.items():
+            s = s.replace(k, v)
+        return s
+
+def get_build_version():
+    """Return the version of MSVC that was used to build Python.
+
+    For Python 2.3 and up, the version number is included in
+    sys.version.  For earlier versions, assume the compiler is MSVC 6.
+    """
+    prefix = "MSC v."
+    i = sys.version.find(prefix)
+    if i == -1:
+        return 6
+    i = i + len(prefix)
+    s, rest = sys.version[i:].split(" ", 1)
+    majorVersion = int(s[:-2]) - 6
+    if majorVersion >= 13:
+        # v13 was skipped and should be v14
+        majorVersion += 1
+    minorVersion = int(s[2:3]) / 10.0
+    # I don't think paths are affected by minor version in version 6
+    if majorVersion == 6:
+        minorVersion = 0
+    if majorVersion >= 6:
+        return majorVersion + minorVersion
+    # else we don't know what version of the compiler this is
+    return None
+
+def get_build_architecture():
+    """Return the processor architecture.
+
+    Possible results are "Intel" or "AMD64".
+    """
+
+    prefix = " bit ("
+    i = sys.version.find(prefix)
+    if i == -1:
+        return "Intel"
+    j = sys.version.find(")", i)
+    return sys.version[i+len(prefix):j]
+
+def normalize_and_reduce_paths(paths):
+    """Return a list of normalized paths with duplicates removed.
+
+    The current order of paths is maintained.
+    """
+    # Paths are normalized so things like:  /a and /a/ aren't both preserved.
+    reduced_paths = []
+    for p in paths:
+        np = os.path.normpath(p)
+        # XXX(nnorwitz): O(n**2), if reduced_paths gets long perhaps use a set.
+        if np not in reduced_paths:
+            reduced_paths.append(np)
+    return reduced_paths
+
+
+class MSVCCompiler(CCompiler) :
+    """Concrete class that implements an interface to Microsoft Visual C++,
+       as defined by the CCompiler abstract class."""
+
+    compiler_type = 'msvc'
+
+    # Just set this so CCompiler's constructor doesn't barf.  We currently
+    # don't use the 'set_executables()' bureaucracy provided by CCompiler,
+    # as it really isn't necessary for this sort of single-compiler class.
+    # Would be nice to have a consistent interface with UnixCCompiler,
+    # though, so it's worth thinking about.
+    executables = {}
+
+    # Private class data (need to distinguish C from C++ source for compiler)
+    _c_extensions = ['.c']
+    _cpp_extensions = ['.cc', '.cpp', '.cxx']
+    _rc_extensions = ['.rc']
+    _mc_extensions = ['.mc']
+
+    # Needed for the filename generation methods provided by the
+    # base class, CCompiler.
+    src_extensions = (_c_extensions + _cpp_extensions +
+                      _rc_extensions + _mc_extensions)
+    res_extension = '.res'
+    obj_extension = '.obj'
+    static_lib_extension = '.lib'
+    shared_lib_extension = '.dll'
+    static_lib_format = shared_lib_format = '%s%s'
+    exe_extension = '.exe'
+
+    def __init__(self, verbose=0, dry_run=0, force=0):
+        CCompiler.__init__ (self, verbose, dry_run, force)
+        self.__version = get_build_version()
+        self.__arch = get_build_architecture()
+        if self.__arch == "Intel":
+            # x86
+            if self.__version >= 7:
+                self.__root = r"Software\Microsoft\VisualStudio"
+                self.__macros = MacroExpander(self.__version)
+            else:
+                self.__root = r"Software\Microsoft\Devstudio"
+            self.__product = "Visual Studio version %s" % self.__version
+        else:
+            # Win64. Assume this was built with the platform SDK
+            self.__product = "Microsoft SDK compiler %s" % (self.__version + 6)
+
+        self.initialized = False
+
+    def initialize(self):
+        self.__paths = []
+        if "DISTUTILS_USE_SDK" in os.environ and "MSSdk" in os.environ and self.find_exe("cl.exe"):
+            # Assume that the SDK set up everything alright; don't try to be
+            # smarter
+            self.cc = "cl.exe"
+            self.linker = "link.exe"
+            self.lib = "lib.exe"
+            self.rc = "rc.exe"
+            self.mc = "mc.exe"
+        else:
+            self.__paths = self.get_msvc_paths("path")
+
+            if len(self.__paths) == 0:
+                raise DistutilsPlatformError("Python was built with %s, "
+                       "and extensions need to be built with the same "
+                       "version of the compiler, but it isn't installed."
+                       % self.__product)
+
+            self.cc = self.find_exe("cl.exe")
+            self.linker = self.find_exe("link.exe")
+            self.lib = self.find_exe("lib.exe")
+            self.rc = self.find_exe("rc.exe")   # resource compiler
+            self.mc = self.find_exe("mc.exe")   # message compiler
+            self.set_path_env_var('lib')
+            self.set_path_env_var('include')
+
+        # extend the MSVC path with the current path
+        try:
+            for p in os.environ['path'].split(';'):
+                self.__paths.append(p)
+        except KeyError:
+            pass
+        self.__paths = normalize_and_reduce_paths(self.__paths)
+        os.environ['path'] = ";".join(self.__paths)
+
+        self.preprocess_options = None
+        if self.__arch == "Intel":
+            self.compile_options = [ '/nologo', '/Ox', '/MD', '/W3', '/GX' ,
+                                     '/DNDEBUG']
+            self.compile_options_debug = ['/nologo', '/Od', '/MDd', '/W3', '/GX',
+                                          '/Z7', '/D_DEBUG']
+        else:
+            # Win64
+            self.compile_options = [ '/nologo', '/Ox', '/MD', '/W3', '/GS-' ,
+                                     '/DNDEBUG']
+            self.compile_options_debug = ['/nologo', '/Od', '/MDd', '/W3', '/GS-',
+                                          '/Z7', '/D_DEBUG']
+
+        self.ldflags_shared = ['/DLL', '/nologo', '/INCREMENTAL:NO']
+        if self.__version >= 7:
+            self.ldflags_shared_debug = [
+                '/DLL', '/nologo', '/INCREMENTAL:no', '/DEBUG'
+                ]
+        else:
+            self.ldflags_shared_debug = [
+                '/DLL', '/nologo', '/INCREMENTAL:no', '/pdb:None', '/DEBUG'
+                ]
+        self.ldflags_static = [ '/nologo']
+
+        self.initialized = True
+
+    # -- Worker methods ------------------------------------------------
+
+    def object_filenames(self,
+                         source_filenames,
+                         strip_dir=0,
+                         output_dir=''):
+        # Copied from ccompiler.py, extended to return .res as 'object'-file
+        # for .rc input file
+        if output_dir is None: output_dir = ''
+        obj_names = []
+        for src_name in source_filenames:
+            (base, ext) = os.path.splitext (src_name)
+            base = os.path.splitdrive(base)[1] # Chop off the drive
+            base = base[os.path.isabs(base):]  # If abs, chop off leading /
+            if ext not in self.src_extensions:
+                # Better to raise an exception instead of silently continuing
+                # and later complain about sources and targets having
+                # different lengths
+                raise CompileError ("Don't know how to compile %s" % src_name)
+            if strip_dir:
+                base = os.path.basename (base)
+            if ext in self._rc_extensions:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.res_extension))
+            elif ext in self._mc_extensions:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.res_extension))
+            else:
+                obj_names.append (os.path.join (output_dir,
+                                                base + self.obj_extension))
+        return obj_names
+
+
+    def compile(self, sources,
+                output_dir=None, macros=None, include_dirs=None, debug=0,
+                extra_preargs=None, extra_postargs=None, depends=None):
+
+        if not self.initialized:
+            self.initialize()
+        compile_info = self._setup_compile(output_dir, macros, include_dirs,
+                                           sources, depends, extra_postargs)
+        macros, objects, extra_postargs, pp_opts, build = compile_info
+
+        compile_opts = extra_preargs or []
+        compile_opts.append ('/c')
+        if debug:
+            compile_opts.extend(self.compile_options_debug)
+        else:
+            compile_opts.extend(self.compile_options)
+
+        for obj in objects:
+            try:
+                src, ext = build[obj]
+            except KeyError:
+                continue
+            if debug:
+                # pass the full pathname to MSVC in debug mode,
+                # this allows the debugger to find the source file
+                # without asking the user to browse for it
+                src = os.path.abspath(src)
+
+            if ext in self._c_extensions:
+                input_opt = "/Tc" + src
+            elif ext in self._cpp_extensions:
+                input_opt = "/Tp" + src
+            elif ext in self._rc_extensions:
+                # compile .RC to .RES file
+                input_opt = src
+                output_opt = "/fo" + obj
+                try:
+                    self.spawn([self.rc] + pp_opts +
+                               [output_opt] + [input_opt])
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            elif ext in self._mc_extensions:
+                # Compile .MC to .RC file to .RES file.
+                #   * '-h dir' specifies the directory for the
+                #     generated include file
+                #   * '-r dir' specifies the target directory of the
+                #     generated RC file and the binary message resource
+                #     it includes
+                #
+                # For now (since there are no options to change this),
+                # we use the source-directory for the include file and
+                # the build directory for the RC file and message
+                # resources. This works at least for win32all.
+                h_dir = os.path.dirname(src)
+                rc_dir = os.path.dirname(obj)
+                try:
+                    # first compile .MC to .RC and .H file
+                    self.spawn([self.mc] +
+                               ['-h', h_dir, '-r', rc_dir] + [src])
+                    base, _ = os.path.splitext (os.path.basename (src))
+                    rc_file = os.path.join (rc_dir, base + '.rc')
+                    # then compile .RC to .RES file
+                    self.spawn([self.rc] +
+                               ["/fo" + obj] + [rc_file])
+
+                except DistutilsExecError as msg:
+                    raise CompileError(msg)
+                continue
+            else:
+                # how to handle this file?
+                raise CompileError("Don't know how to compile %s to %s"
+                                   % (src, obj))
+
+            output_opt = "/Fo" + obj
+            try:
+                self.spawn([self.cc] + compile_opts + pp_opts +
+                           [input_opt, output_opt] +
+                           extra_postargs)
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+        return objects
+
+
+    def create_static_lib(self,
+                          objects,
+                          output_libname,
+                          output_dir=None,
+                          debug=0,
+                          target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        (objects, output_dir) = self._fix_object_args(objects, output_dir)
+        output_filename = self.library_filename(output_libname,
+                                                output_dir=output_dir)
+
+        if self._need_link(objects, output_filename):
+            lib_args = objects + ['/OUT:' + output_filename]
+            if debug:
+                pass # XXX what goes here?
+            try:
+                self.spawn([self.lib] + lib_args)
+            except DistutilsExecError as msg:
+                raise LibError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+
+    def link(self,
+             target_desc,
+             objects,
+             output_filename,
+             output_dir=None,
+             libraries=None,
+             library_dirs=None,
+             runtime_library_dirs=None,
+             export_symbols=None,
+             debug=0,
+             extra_preargs=None,
+             extra_postargs=None,
+             build_temp=None,
+             target_lang=None):
+
+        if not self.initialized:
+            self.initialize()
+        (objects, output_dir) = self._fix_object_args(objects, output_dir)
+        fixed_args = self._fix_lib_args(libraries, library_dirs,
+                                        runtime_library_dirs)
+        (libraries, library_dirs, runtime_library_dirs) = fixed_args
+
+        if runtime_library_dirs:
+            self.warn ("I don't know what to do with 'runtime_library_dirs': "
+                       + str (runtime_library_dirs))
+
+        lib_opts = gen_lib_options(self,
+                                   library_dirs, runtime_library_dirs,
+                                   libraries)
+        if output_dir is not None:
+            output_filename = os.path.join(output_dir, output_filename)
+
+        if self._need_link(objects, output_filename):
+            if target_desc == CCompiler.EXECUTABLE:
+                if debug:
+                    ldflags = self.ldflags_shared_debug[1:]
+                else:
+                    ldflags = self.ldflags_shared[1:]
+            else:
+                if debug:
+                    ldflags = self.ldflags_shared_debug
+                else:
+                    ldflags = self.ldflags_shared
+
+            export_opts = []
+            for sym in (export_symbols or []):
+                export_opts.append("/EXPORT:" + sym)
+
+            ld_args = (ldflags + lib_opts + export_opts +
+                       objects + ['/OUT:' + output_filename])
+
+            # The MSVC linker generates .lib and .exp files, which cannot be
+            # suppressed by any linker switches. The .lib files may even be
+            # needed! Make sure they are generated in the temporary build
+            # directory. Since they have different names for debug and release
+            # builds, they can go into the same directory.
+            if export_symbols is not None:
+                (dll_name, dll_ext) = os.path.splitext(
+                    os.path.basename(output_filename))
+                implib_file = os.path.join(
+                    os.path.dirname(objects[0]),
+                    self.library_filename(dll_name))
+                ld_args.append ('/IMPLIB:' + implib_file)
+
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+
+            self.mkpath(os.path.dirname(output_filename))
+            try:
+                self.spawn([self.linker] + ld_args)
+            except DistutilsExecError as msg:
+                raise LinkError(msg)
+
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+
+    # -- Miscellaneous methods -----------------------------------------
+    # These are all used by the 'gen_lib_options() function, in
+    # ccompiler.py.
+
+    def library_dir_option(self, dir):
+        return "/LIBPATH:" + dir
+
+    def runtime_library_dir_option(self, dir):
+        raise DistutilsPlatformError(
+              "don't know how to set runtime library search path for MSVC++")
+
+    def library_option(self, lib):
+        return self.library_filename(lib)
+
+
+    def find_library_file(self, dirs, lib, debug=0):
+        # Prefer a debugging library if found (and requested), but deal
+        # with it if we don't have one.
+        if debug:
+            try_names = [lib + "_d", lib]
+        else:
+            try_names = [lib]
+        for dir in dirs:
+            for name in try_names:
+                libfile = os.path.join(dir, self.library_filename (name))
+                if os.path.exists(libfile):
+                    return libfile
+        else:
+            # Oops, didn't find it in *any* of 'dirs'
+            return None
+
+    # Helper methods for using the MSVC registry settings
+
+    def find_exe(self, exe):
+        """Return path to an MSVC executable program.
+
+        Tries to find the program in several places: first, one of the
+        MSVC program search paths from the registry; next, the directories
+        in the PATH environment variable.  If any of those work, return an
+        absolute path that is known to exist.  If none of them work, just
+        return the original program name, 'exe'.
+        """
+        for p in self.__paths:
+            fn = os.path.join(os.path.abspath(p), exe)
+            if os.path.isfile(fn):
+                return fn
+
+        # didn't find it; try existing path
+        for p in os.environ['Path'].split(';'):
+            fn = os.path.join(os.path.abspath(p),exe)
+            if os.path.isfile(fn):
+                return fn
+
+        return exe
+
+    def get_msvc_paths(self, path, platform='x86'):
+        """Get a list of devstudio directories (include, lib or path).
+
+        Return a list of strings.  The list will be empty if unable to
+        access the registry or appropriate registry keys not found.
+        """
+        if not _can_read_reg:
+            return []
+
+        path = path + " dirs"
+        if self.__version >= 7:
+            key = (r"%s\%0.1f\VC\VC_OBJECTS_PLATFORM_INFO\Win32\Directories"
+                   % (self.__root, self.__version))
+        else:
+            key = (r"%s\6.0\Build System\Components\Platforms"
+                   r"\Win32 (%s)\Directories" % (self.__root, platform))
+
+        for base in HKEYS:
+            d = read_values(base, key)
+            if d:
+                if self.__version >= 7:
+                    return self.__macros.sub(d[path]).split(";")
+                else:
+                    return d[path].split(";")
+        # MSVC 6 seems to create the registry entries we need only when
+        # the GUI is run.
+        if self.__version == 6:
+            for base in HKEYS:
+                if read_values(base, r"%s\6.0" % self.__root) is not None:
+                    self.warn("It seems you have Visual Studio 6 installed, "
+                        "but the expected registry settings are not present.\n"
+                        "You must at least run the Visual Studio GUI once "
+                        "so that these entries are created.")
+                    break
+        return []
+
+    def set_path_env_var(self, name):
+        """Set environment variable 'name' to an MSVC path type value.
+
+        This is equivalent to a SET command prior to execution of spawned
+        commands.
+        """
+
+        if name == "lib":
+            p = self.get_msvc_paths("library")
+        else:
+            p = self.get_msvc_paths(name)
+        if p:
+            os.environ[name] = ';'.join(p)
+
+
+if get_build_version() >= 8.0:
+    log.debug("Importing new compiler from distutils.msvc9compiler")
+    OldMSVCCompiler = MSVCCompiler
+    from distutils.msvc9compiler import MSVCCompiler
+    # get_build_architecture not really relevant now we support cross-compile
+    from distutils.msvc9compiler import MacroExpander
diff --git a/venv/Lib/site-packages/setuptools/_distutils/py35compat.py b/venv/Lib/site-packages/setuptools/_distutils/py35compat.py
new file mode 100644
index 000000000..79b2e7f38
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/py35compat.py
@@ -0,0 +1,19 @@
+import sys
+import subprocess
+
+
+def __optim_args_from_interpreter_flags():
+    """Return a list of command-line arguments reproducing the current
+    optimization settings in sys.flags."""
+    args = []
+    value = sys.flags.optimize
+    if value > 0:
+        args.append("-" + "O" * value)
+    return args
+
+
+_optim_args_from_interpreter_flags = getattr(
+    subprocess,
+    "_optim_args_from_interpreter_flags",
+    __optim_args_from_interpreter_flags,
+)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/py38compat.py b/venv/Lib/site-packages/setuptools/_distutils/py38compat.py
new file mode 100644
index 000000000..7dbe8cef5
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/py38compat.py
@@ -0,0 +1,7 @@
+def aix_platform(osname, version, release):
+    try:
+        import _aix_support
+        return _aix_support.aix_platform()
+    except ImportError:
+        pass
+    return "%s-%s.%s" % (osname, version, release)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/spawn.py b/venv/Lib/site-packages/setuptools/_distutils/spawn.py
new file mode 100644
index 000000000..fc592d4a9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/spawn.py
@@ -0,0 +1,125 @@
+"""distutils.spawn
+
+Provides the 'spawn()' function, a front-end to various platform-
+specific functions for launching another program in a sub-process.
+Also provides the 'find_executable()' to search the path for a given
+executable name.
+"""
+
+import sys
+import os
+import subprocess
+
+from distutils.errors import DistutilsPlatformError, DistutilsExecError
+from distutils.debug import DEBUG
+from distutils import log
+
+
+if sys.platform == 'darwin':
+    _cfg_target = None
+    _cfg_target_split = None
+
+
+def spawn(cmd, search_path=1, verbose=0, dry_run=0, env=None):
+    """Run another program, specified as a command list 'cmd', in a new process.
+
+    'cmd' is just the argument list for the new process, ie.
+    cmd[0] is the program to run and cmd[1:] are the rest of its arguments.
+    There is no way to run a program with a name different from that of its
+    executable.
+
+    If 'search_path' is true (the default), the system's executable
+    search path will be used to find the program; otherwise, cmd[0]
+    must be the exact path to the executable.  If 'dry_run' is true,
+    the command will not actually be run.
+
+    Raise DistutilsExecError if running the program fails in any way; just
+    return on success.
+    """
+    # cmd is documented as a list, but just in case some code passes a tuple
+    # in, protect our %-formatting code against horrible death
+    cmd = list(cmd)
+
+    log.info(' '.join(cmd))
+    if dry_run:
+        return
+
+    if search_path:
+        executable = find_executable(cmd[0])
+        if executable is not None:
+            cmd[0] = executable
+
+    env = env if env is not None else dict(os.environ)
+
+    if sys.platform == 'darwin':
+        global _cfg_target, _cfg_target_split
+        if _cfg_target is None:
+            from distutils import sysconfig
+            _cfg_target = sysconfig.get_config_var(
+                                  'MACOSX_DEPLOYMENT_TARGET') or ''
+            if _cfg_target:
+                _cfg_target_split = [int(x) for x in _cfg_target.split('.')]
+        if _cfg_target:
+            # ensure that the deployment target of build process is not less
+            # than that used when the interpreter was built. This ensures
+            # extension modules are built with correct compatibility values
+            cur_target = os.environ.get('MACOSX_DEPLOYMENT_TARGET', _cfg_target)
+            if _cfg_target_split > [int(x) for x in cur_target.split('.')]:
+                my_msg = ('$MACOSX_DEPLOYMENT_TARGET mismatch: '
+                          'now "%s" but "%s" during configure'
+                                % (cur_target, _cfg_target))
+                raise DistutilsPlatformError(my_msg)
+            env.update(MACOSX_DEPLOYMENT_TARGET=cur_target)
+
+    try:
+        proc = subprocess.Popen(cmd, env=env)
+        proc.wait()
+        exitcode = proc.returncode
+    except OSError as exc:
+        if not DEBUG:
+            cmd = cmd[0]
+        raise DistutilsExecError(
+            "command %r failed: %s" % (cmd, exc.args[-1])) from exc
+
+    if exitcode:
+        if not DEBUG:
+            cmd = cmd[0]
+        raise DistutilsExecError(
+              "command %r failed with exit code %s" % (cmd, exitcode))
+
+
+def find_executable(executable, path=None):
+    """Tries to find 'executable' in the directories listed in 'path'.
+
+    A string listing directories separated by 'os.pathsep'; defaults to
+    os.environ['PATH'].  Returns the complete filename or None if not found.
+    """
+    _, ext = os.path.splitext(executable)
+    if (sys.platform == 'win32') and (ext != '.exe'):
+        executable = executable + '.exe'
+
+    if os.path.isfile(executable):
+        return executable
+
+    if path is None:
+        path = os.environ.get('PATH', None)
+        if path is None:
+            try:
+                path = os.confstr("CS_PATH")
+            except (AttributeError, ValueError):
+                # os.confstr() or CS_PATH is not available
+                path = os.defpath
+        # bpo-35755: Don't use os.defpath if the PATH environment variable is
+        # set to an empty string
+
+    # PATH='' doesn't match, whereas PATH=':' looks in the current directory
+    if not path:
+        return None
+
+    paths = path.split(os.pathsep)
+    for p in paths:
+        f = os.path.join(p, executable)
+        if os.path.isfile(f):
+            # the file exists, we have a shot at spawn working
+            return f
+    return None
diff --git a/venv/Lib/site-packages/setuptools/_distutils/sysconfig.py b/venv/Lib/site-packages/setuptools/_distutils/sysconfig.py
new file mode 100644
index 000000000..879b6981e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/sysconfig.py
@@ -0,0 +1,573 @@
+"""Provide access to Python's configuration information.  The specific
+configuration variables available depend heavily on the platform and
+configuration.  The values may be retrieved using
+get_config_var(name), and the list of variables is available via
+get_config_vars().keys().  Additional convenience functions are also
+available.
+
+Written by:   Fred L. Drake, Jr.
+Email:        <fdrake@acm.org>
+"""
+
+import _imp
+import os
+import re
+import sys
+
+from .errors import DistutilsPlatformError
+
+IS_PYPY = '__pypy__' in sys.builtin_module_names
+
+# These are needed in a couple of spots, so just compute them once.
+PREFIX = os.path.normpath(sys.prefix)
+EXEC_PREFIX = os.path.normpath(sys.exec_prefix)
+BASE_PREFIX = os.path.normpath(sys.base_prefix)
+BASE_EXEC_PREFIX = os.path.normpath(sys.base_exec_prefix)
+
+# Path to the base directory of the project. On Windows the binary may
+# live in project/PCbuild/win32 or project/PCbuild/amd64.
+# set for cross builds
+if "_PYTHON_PROJECT_BASE" in os.environ:
+    project_base = os.path.abspath(os.environ["_PYTHON_PROJECT_BASE"])
+else:
+    if sys.executable:
+        project_base = os.path.dirname(os.path.abspath(sys.executable))
+    else:
+        # sys.executable can be empty if argv[0] has been changed and Python is
+        # unable to retrieve the real program name
+        project_base = os.getcwd()
+
+
+# python_build: (Boolean) if true, we're either building Python or
+# building an extension with an un-installed Python, so we use
+# different (hard-wired) directories.
+def _is_python_source_dir(d):
+    for fn in ("Setup", "Setup.local"):
+        if os.path.isfile(os.path.join(d, "Modules", fn)):
+            return True
+    return False
+
+_sys_home = getattr(sys, '_home', None)
+
+if os.name == 'nt':
+    def _fix_pcbuild(d):
+        if d and os.path.normcase(d).startswith(
+                os.path.normcase(os.path.join(PREFIX, "PCbuild"))):
+            return PREFIX
+        return d
+    project_base = _fix_pcbuild(project_base)
+    _sys_home = _fix_pcbuild(_sys_home)
+
+def _python_build():
+    if _sys_home:
+        return _is_python_source_dir(_sys_home)
+    return _is_python_source_dir(project_base)
+
+python_build = _python_build()
+
+
+# Calculate the build qualifier flags if they are defined.  Adding the flags
+# to the include and lib directories only makes sense for an installation, not
+# an in-source build.
+build_flags = ''
+try:
+    if not python_build:
+        build_flags = sys.abiflags
+except AttributeError:
+    # It's not a configure-based build, so the sys module doesn't have
+    # this attribute, which is fine.
+    pass
+
+def get_python_version():
+    """Return a string containing the major and minor Python version,
+    leaving off the patchlevel.  Sample return values could be '1.5'
+    or '2.2'.
+    """
+    return '%d.%d' % sys.version_info[:2]
+
+
+def get_python_inc(plat_specific=0, prefix=None):
+    """Return the directory containing installed Python header files.
+
+    If 'plat_specific' is false (the default), this is the path to the
+    non-platform-specific header files, i.e. Python.h and so on;
+    otherwise, this is the path to platform-specific header files
+    (namely pyconfig.h).
+
+    If 'prefix' is supplied, use it instead of sys.base_prefix or
+    sys.base_exec_prefix -- i.e., ignore 'plat_specific'.
+    """
+    if prefix is None:
+        prefix = plat_specific and BASE_EXEC_PREFIX or BASE_PREFIX
+    if IS_PYPY:
+        return os.path.join(prefix, 'include')
+    elif os.name == "posix":
+        if python_build:
+            # Assume the executable is in the build directory.  The
+            # pyconfig.h file should be in the same directory.  Since
+            # the build directory may not be the source directory, we
+            # must use "srcdir" from the makefile to find the "Include"
+            # directory.
+            if plat_specific:
+                return _sys_home or project_base
+            else:
+                incdir = os.path.join(get_config_var('srcdir'), 'Include')
+                return os.path.normpath(incdir)
+        python_dir = 'python' + get_python_version() + build_flags
+        return os.path.join(prefix, "include", python_dir)
+    elif os.name == "nt":
+        if python_build:
+            # Include both the include and PC dir to ensure we can find
+            # pyconfig.h
+            return (os.path.join(prefix, "include") + os.path.pathsep +
+                    os.path.join(prefix, "PC"))
+        return os.path.join(prefix, "include")
+    else:
+        raise DistutilsPlatformError(
+            "I don't know where Python installs its C header files "
+            "on platform '%s'" % os.name)
+
+
+def get_python_lib(plat_specific=0, standard_lib=0, prefix=None):
+    """Return the directory containing the Python library (standard or
+    site additions).
+
+    If 'plat_specific' is true, return the directory containing
+    platform-specific modules, i.e. any module from a non-pure-Python
+    module distribution; otherwise, return the platform-shared library
+    directory.  If 'standard_lib' is true, return the directory
+    containing standard Python library modules; otherwise, return the
+    directory for site-specific modules.
+
+    If 'prefix' is supplied, use it instead of sys.base_prefix or
+    sys.base_exec_prefix -- i.e., ignore 'plat_specific'.
+    """
+    if IS_PYPY:
+        # PyPy-specific schema
+        if prefix is None:
+            prefix = PREFIX
+        if standard_lib:
+            return os.path.join(prefix, "lib-python", sys.version[0])
+        return os.path.join(prefix, 'site-packages')
+
+    if prefix is None:
+        if standard_lib:
+            prefix = plat_specific and BASE_EXEC_PREFIX or BASE_PREFIX
+        else:
+            prefix = plat_specific and EXEC_PREFIX or PREFIX
+
+    if os.name == "posix":
+        if plat_specific or standard_lib:
+            # Platform-specific modules (any module from a non-pure-Python
+            # module distribution) or standard Python library modules.
+            libdir = getattr(sys, "platlibdir", "lib")
+        else:
+            # Pure Python
+            libdir = "lib"
+        libpython = os.path.join(prefix, libdir,
+                                 "python" + get_python_version())
+        if standard_lib:
+            return libpython
+        else:
+            return os.path.join(libpython, "site-packages")
+    elif os.name == "nt":
+        if standard_lib:
+            return os.path.join(prefix, "Lib")
+        else:
+            return os.path.join(prefix, "Lib", "site-packages")
+    else:
+        raise DistutilsPlatformError(
+            "I don't know where Python installs its library "
+            "on platform '%s'" % os.name)
+
+
+
+def customize_compiler(compiler):
+    """Do any platform-specific customization of a CCompiler instance.
+
+    Mainly needed on Unix, so we can plug in the information that
+    varies across Unices and is stored in Python's Makefile.
+    """
+    if compiler.compiler_type == "unix":
+        if sys.platform == "darwin":
+            # Perform first-time customization of compiler-related
+            # config vars on OS X now that we know we need a compiler.
+            # This is primarily to support Pythons from binary
+            # installers.  The kind and paths to build tools on
+            # the user system may vary significantly from the system
+            # that Python itself was built on.  Also the user OS
+            # version and build tools may not support the same set
+            # of CPU architectures for universal builds.
+            global _config_vars
+            # Use get_config_var() to ensure _config_vars is initialized.
+            if not get_config_var('CUSTOMIZED_OSX_COMPILER'):
+                import _osx_support
+                _osx_support.customize_compiler(_config_vars)
+                _config_vars['CUSTOMIZED_OSX_COMPILER'] = 'True'
+
+        (cc, cxx, cflags, ccshared, ldshared, shlib_suffix, ar, ar_flags) = \
+            get_config_vars('CC', 'CXX', 'CFLAGS',
+                            'CCSHARED', 'LDSHARED', 'SHLIB_SUFFIX', 'AR', 'ARFLAGS')
+
+        if 'CC' in os.environ:
+            newcc = os.environ['CC']
+            if (sys.platform == 'darwin'
+                    and 'LDSHARED' not in os.environ
+                    and ldshared.startswith(cc)):
+                # On OS X, if CC is overridden, use that as the default
+                #       command for LDSHARED as well
+                ldshared = newcc + ldshared[len(cc):]
+            cc = newcc
+        if 'CXX' in os.environ:
+            cxx = os.environ['CXX']
+        if 'LDSHARED' in os.environ:
+            ldshared = os.environ['LDSHARED']
+        if 'CPP' in os.environ:
+            cpp = os.environ['CPP']
+        else:
+            cpp = cc + " -E"           # not always
+        if 'LDFLAGS' in os.environ:
+            ldshared = ldshared + ' ' + os.environ['LDFLAGS']
+        if 'CFLAGS' in os.environ:
+            cflags = cflags + ' ' + os.environ['CFLAGS']
+            ldshared = ldshared + ' ' + os.environ['CFLAGS']
+        if 'CPPFLAGS' in os.environ:
+            cpp = cpp + ' ' + os.environ['CPPFLAGS']
+            cflags = cflags + ' ' + os.environ['CPPFLAGS']
+            ldshared = ldshared + ' ' + os.environ['CPPFLAGS']
+        if 'AR' in os.environ:
+            ar = os.environ['AR']
+        if 'ARFLAGS' in os.environ:
+            archiver = ar + ' ' + os.environ['ARFLAGS']
+        else:
+            archiver = ar + ' ' + ar_flags
+
+        cc_cmd = cc + ' ' + cflags
+        compiler.set_executables(
+            preprocessor=cpp,
+            compiler=cc_cmd,
+            compiler_so=cc_cmd + ' ' + ccshared,
+            compiler_cxx=cxx,
+            linker_so=ldshared,
+            linker_exe=cc,
+            archiver=archiver)
+
+        compiler.shared_lib_extension = shlib_suffix
+
+
+def get_config_h_filename():
+    """Return full pathname of installed pyconfig.h file."""
+    if python_build:
+        if os.name == "nt":
+            inc_dir = os.path.join(_sys_home or project_base, "PC")
+        else:
+            inc_dir = _sys_home or project_base
+    else:
+        inc_dir = get_python_inc(plat_specific=1)
+
+    return os.path.join(inc_dir, 'pyconfig.h')
+
+
+def get_makefile_filename():
+    """Return full pathname of installed Makefile from the Python build."""
+    if python_build:
+        return os.path.join(_sys_home or project_base, "Makefile")
+    lib_dir = get_python_lib(plat_specific=0, standard_lib=1)
+    config_file = 'config-{}{}'.format(get_python_version(), build_flags)
+    if hasattr(sys.implementation, '_multiarch'):
+        config_file += '-%s' % sys.implementation._multiarch
+    return os.path.join(lib_dir, config_file, 'Makefile')
+
+
+def parse_config_h(fp, g=None):
+    """Parse a config.h-style file.
+
+    A dictionary containing name/value pairs is returned.  If an
+    optional dictionary is passed in as the second argument, it is
+    used instead of a new dictionary.
+    """
+    if g is None:
+        g = {}
+    define_rx = re.compile("#define ([A-Z][A-Za-z0-9_]+) (.*)\n")
+    undef_rx = re.compile("/[*] #undef ([A-Z][A-Za-z0-9_]+) [*]/\n")
+    #
+    while True:
+        line = fp.readline()
+        if not line:
+            break
+        m = define_rx.match(line)
+        if m:
+            n, v = m.group(1, 2)
+            try: v = int(v)
+            except ValueError: pass
+            g[n] = v
+        else:
+            m = undef_rx.match(line)
+            if m:
+                g[m.group(1)] = 0
+    return g
+
+
+# Regexes needed for parsing Makefile (and similar syntaxes,
+# like old-style Setup files).
+_variable_rx = re.compile(r"([a-zA-Z][a-zA-Z0-9_]+)\s*=\s*(.*)")
+_findvar1_rx = re.compile(r"\$\(([A-Za-z][A-Za-z0-9_]*)\)")
+_findvar2_rx = re.compile(r"\${([A-Za-z][A-Za-z0-9_]*)}")
+
+def parse_makefile(fn, g=None):
+    """Parse a Makefile-style file.
+
+    A dictionary containing name/value pairs is returned.  If an
+    optional dictionary is passed in as the second argument, it is
+    used instead of a new dictionary.
+    """
+    from distutils.text_file import TextFile
+    fp = TextFile(fn, strip_comments=1, skip_blanks=1, join_lines=1, errors="surrogateescape")
+
+    if g is None:
+        g = {}
+    done = {}
+    notdone = {}
+
+    while True:
+        line = fp.readline()
+        if line is None: # eof
+            break
+        m = _variable_rx.match(line)
+        if m:
+            n, v = m.group(1, 2)
+            v = v.strip()
+            # `$$' is a literal `$' in make
+            tmpv = v.replace('$$', '')
+
+            if "$" in tmpv:
+                notdone[n] = v
+            else:
+                try:
+                    v = int(v)
+                except ValueError:
+                    # insert literal `$'
+                    done[n] = v.replace('$$', '$')
+                else:
+                    done[n] = v
+
+    # Variables with a 'PY_' prefix in the makefile. These need to
+    # be made available without that prefix through sysconfig.
+    # Special care is needed to ensure that variable expansion works, even
+    # if the expansion uses the name without a prefix.
+    renamed_variables = ('CFLAGS', 'LDFLAGS', 'CPPFLAGS')
+
+    # do variable interpolation here
+    while notdone:
+        for name in list(notdone):
+            value = notdone[name]
+            m = _findvar1_rx.search(value) or _findvar2_rx.search(value)
+            if m:
+                n = m.group(1)
+                found = True
+                if n in done:
+                    item = str(done[n])
+                elif n in notdone:
+                    # get it on a subsequent round
+                    found = False
+                elif n in os.environ:
+                    # do it like make: fall back to environment
+                    item = os.environ[n]
+
+                elif n in renamed_variables:
+                    if name.startswith('PY_') and name[3:] in renamed_variables:
+                        item = ""
+
+                    elif 'PY_' + n in notdone:
+                        found = False
+
+                    else:
+                        item = str(done['PY_' + n])
+                else:
+                    done[n] = item = ""
+                if found:
+                    after = value[m.end():]
+                    value = value[:m.start()] + item + after
+                    if "$" in after:
+                        notdone[name] = value
+                    else:
+                        try: value = int(value)
+                        except ValueError:
+                            done[name] = value.strip()
+                        else:
+                            done[name] = value
+                        del notdone[name]
+
+                        if name.startswith('PY_') \
+                            and name[3:] in renamed_variables:
+
+                            name = name[3:]
+                            if name not in done:
+                                done[name] = value
+            else:
+                # bogus variable reference; just drop it since we can't deal
+                del notdone[name]
+
+    fp.close()
+
+    # strip spurious spaces
+    for k, v in done.items():
+        if isinstance(v, str):
+            done[k] = v.strip()
+
+    # save the results in the global dictionary
+    g.update(done)
+    return g
+
+
+def expand_makefile_vars(s, vars):
+    """Expand Makefile-style variables -- "${foo}" or "$(foo)" -- in
+    'string' according to 'vars' (a dictionary mapping variable names to
+    values).  Variables not present in 'vars' are silently expanded to the
+    empty string.  The variable values in 'vars' should not contain further
+    variable expansions; if 'vars' is the output of 'parse_makefile()',
+    you're fine.  Returns a variable-expanded version of 's'.
+    """
+
+    # This algorithm does multiple expansion, so if vars['foo'] contains
+    # "${bar}", it will expand ${foo} to ${bar}, and then expand
+    # ${bar}... and so forth.  This is fine as long as 'vars' comes from
+    # 'parse_makefile()', which takes care of such expansions eagerly,
+    # according to make's variable expansion semantics.
+
+    while True:
+        m = _findvar1_rx.search(s) or _findvar2_rx.search(s)
+        if m:
+            (beg, end) = m.span()
+            s = s[0:beg] + vars.get(m.group(1)) + s[end:]
+        else:
+            break
+    return s
+
+
+_config_vars = None
+
+def _init_posix():
+    """Initialize the module as appropriate for POSIX systems."""
+    # _sysconfigdata is generated at build time, see the sysconfig module
+    name = os.environ.get('_PYTHON_SYSCONFIGDATA_NAME',
+        '_sysconfigdata_{abi}_{platform}_{multiarch}'.format(
+        abi=sys.abiflags,
+        platform=sys.platform,
+        multiarch=getattr(sys.implementation, '_multiarch', ''),
+    ))
+    try:
+        _temp = __import__(name, globals(), locals(), ['build_time_vars'], 0)
+    except ImportError:
+        # Python 3.5 and pypy 7.3.1
+        _temp = __import__(
+            '_sysconfigdata', globals(), locals(), ['build_time_vars'], 0)
+    build_time_vars = _temp.build_time_vars
+    global _config_vars
+    _config_vars = {}
+    _config_vars.update(build_time_vars)
+
+
+def _init_nt():
+    """Initialize the module as appropriate for NT"""
+    g = {}
+    # set basic install directories
+    g['LIBDEST'] = get_python_lib(plat_specific=0, standard_lib=1)
+    g['BINLIBDEST'] = get_python_lib(plat_specific=1, standard_lib=1)
+
+    # XXX hmmm.. a normal install puts include files here
+    g['INCLUDEPY'] = get_python_inc(plat_specific=0)
+
+    g['EXT_SUFFIX'] = _imp.extension_suffixes()[0]
+    g['EXE'] = ".exe"
+    g['VERSION'] = get_python_version().replace(".", "")
+    g['BINDIR'] = os.path.dirname(os.path.abspath(sys.executable))
+
+    global _config_vars
+    _config_vars = g
+
+
+def get_config_vars(*args):
+    """With no arguments, return a dictionary of all configuration
+    variables relevant for the current platform.  Generally this includes
+    everything needed to build extensions and install both pure modules and
+    extensions.  On Unix, this means every variable defined in Python's
+    installed Makefile; on Windows it's a much smaller set.
+
+    With arguments, return a list of values that result from looking up
+    each argument in the configuration variable dictionary.
+    """
+    global _config_vars
+    if _config_vars is None:
+        func = globals().get("_init_" + os.name)
+        if func:
+            func()
+        else:
+            _config_vars = {}
+
+        # Normalized versions of prefix and exec_prefix are handy to have;
+        # in fact, these are the standard versions used most places in the
+        # Distutils.
+        _config_vars['prefix'] = PREFIX
+        _config_vars['exec_prefix'] = EXEC_PREFIX
+
+        if not IS_PYPY:
+            # For backward compatibility, see issue19555
+            SO = _config_vars.get('EXT_SUFFIX')
+            if SO is not None:
+                _config_vars['SO'] = SO
+
+            # Always convert srcdir to an absolute path
+            srcdir = _config_vars.get('srcdir', project_base)
+            if os.name == 'posix':
+                if python_build:
+                    # If srcdir is a relative path (typically '.' or '..')
+                    # then it should be interpreted relative to the directory
+                    # containing Makefile.
+                    base = os.path.dirname(get_makefile_filename())
+                    srcdir = os.path.join(base, srcdir)
+                else:
+                    # srcdir is not meaningful since the installation is
+                    # spread about the filesystem.  We choose the
+                    # directory containing the Makefile since we know it
+                    # exists.
+                    srcdir = os.path.dirname(get_makefile_filename())
+            _config_vars['srcdir'] = os.path.abspath(os.path.normpath(srcdir))
+
+            # Convert srcdir into an absolute path if it appears necessary.
+            # Normally it is relative to the build directory.  However, during
+            # testing, for example, we might be running a non-installed python
+            # from a different directory.
+            if python_build and os.name == "posix":
+                base = project_base
+                if (not os.path.isabs(_config_vars['srcdir']) and
+                    base != os.getcwd()):
+                    # srcdir is relative and we are not in the same directory
+                    # as the executable. Assume executable is in the build
+                    # directory and make srcdir absolute.
+                    srcdir = os.path.join(base, _config_vars['srcdir'])
+                    _config_vars['srcdir'] = os.path.normpath(srcdir)
+
+        # OS X platforms require special customization to handle
+        # multi-architecture, multi-os-version installers
+        if sys.platform == 'darwin':
+            import _osx_support
+            _osx_support.customize_config_vars(_config_vars)
+
+    if args:
+        vals = []
+        for name in args:
+            vals.append(_config_vars.get(name))
+        return vals
+    else:
+        return _config_vars
+
+def get_config_var(name):
+    """Return the value of a single variable using the dictionary
+    returned by 'get_config_vars()'.  Equivalent to
+    get_config_vars().get(name)
+    """
+    if name == 'SO':
+        import warnings
+        warnings.warn('SO is deprecated, use EXT_SUFFIX', DeprecationWarning, 2)
+    return get_config_vars().get(name)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/text_file.py b/venv/Lib/site-packages/setuptools/_distutils/text_file.py
new file mode 100644
index 000000000..93abad38f
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/text_file.py
@@ -0,0 +1,286 @@
+"""text_file
+
+provides the TextFile class, which gives an interface to text files
+that (optionally) takes care of stripping comments, ignoring blank
+lines, and joining lines with backslashes."""
+
+import sys, io
+
+
+class TextFile:
+    """Provides a file-like object that takes care of all the things you
+       commonly want to do when processing a text file that has some
+       line-by-line syntax: strip comments (as long as "#" is your
+       comment character), skip blank lines, join adjacent lines by
+       escaping the newline (ie. backslash at end of line), strip
+       leading and/or trailing whitespace.  All of these are optional
+       and independently controllable.
+
+       Provides a 'warn()' method so you can generate warning messages that
+       report physical line number, even if the logical line in question
+       spans multiple physical lines.  Also provides 'unreadline()' for
+       implementing line-at-a-time lookahead.
+
+       Constructor is called as:
+
+           TextFile (filename=None, file=None, **options)
+
+       It bombs (RuntimeError) if both 'filename' and 'file' are None;
+       'filename' should be a string, and 'file' a file object (or
+       something that provides 'readline()' and 'close()' methods).  It is
+       recommended that you supply at least 'filename', so that TextFile
+       can include it in warning messages.  If 'file' is not supplied,
+       TextFile creates its own using 'io.open()'.
+
+       The options are all boolean, and affect the value returned by
+       'readline()':
+         strip_comments [default: true]
+           strip from "#" to end-of-line, as well as any whitespace
+           leading up to the "#" -- unless it is escaped by a backslash
+         lstrip_ws [default: false]
+           strip leading whitespace from each line before returning it
+         rstrip_ws [default: true]
+           strip trailing whitespace (including line terminator!) from
+           each line before returning it
+         skip_blanks [default: true}
+           skip lines that are empty *after* stripping comments and
+           whitespace.  (If both lstrip_ws and rstrip_ws are false,
+           then some lines may consist of solely whitespace: these will
+           *not* be skipped, even if 'skip_blanks' is true.)
+         join_lines [default: false]
+           if a backslash is the last non-newline character on a line
+           after stripping comments and whitespace, join the following line
+           to it to form one "logical line"; if N consecutive lines end
+           with a backslash, then N+1 physical lines will be joined to
+           form one logical line.
+         collapse_join [default: false]
+           strip leading whitespace from lines that are joined to their
+           predecessor; only matters if (join_lines and not lstrip_ws)
+         errors [default: 'strict']
+           error handler used to decode the file content
+
+       Note that since 'rstrip_ws' can strip the trailing newline, the
+       semantics of 'readline()' must differ from those of the builtin file
+       object's 'readline()' method!  In particular, 'readline()' returns
+       None for end-of-file: an empty string might just be a blank line (or
+       an all-whitespace line), if 'rstrip_ws' is true but 'skip_blanks' is
+       not."""
+
+    default_options = { 'strip_comments': 1,
+                        'skip_blanks':    1,
+                        'lstrip_ws':      0,
+                        'rstrip_ws':      1,
+                        'join_lines':     0,
+                        'collapse_join':  0,
+                        'errors':         'strict',
+                      }
+
+    def __init__(self, filename=None, file=None, **options):
+        """Construct a new TextFile object.  At least one of 'filename'
+           (a string) and 'file' (a file-like object) must be supplied.
+           They keyword argument options are described above and affect
+           the values returned by 'readline()'."""
+        if filename is None and file is None:
+            raise RuntimeError("you must supply either or both of 'filename' and 'file'")
+
+        # set values for all options -- either from client option hash
+        # or fallback to default_options
+        for opt in self.default_options.keys():
+            if opt in options:
+                setattr(self, opt, options[opt])
+            else:
+                setattr(self, opt, self.default_options[opt])
+
+        # sanity check client option hash
+        for opt in options.keys():
+            if opt not in self.default_options:
+                raise KeyError("invalid TextFile option '%s'" % opt)
+
+        if file is None:
+            self.open(filename)
+        else:
+            self.filename = filename
+            self.file = file
+            self.current_line = 0       # assuming that file is at BOF!
+
+        # 'linebuf' is a stack of lines that will be emptied before we
+        # actually read from the file; it's only populated by an
+        # 'unreadline()' operation
+        self.linebuf = []
+
+    def open(self, filename):
+        """Open a new file named 'filename'.  This overrides both the
+           'filename' and 'file' arguments to the constructor."""
+        self.filename = filename
+        self.file = io.open(self.filename, 'r', errors=self.errors)
+        self.current_line = 0
+
+    def close(self):
+        """Close the current file and forget everything we know about it
+           (filename, current line number)."""
+        file = self.file
+        self.file = None
+        self.filename = None
+        self.current_line = None
+        file.close()
+
+    def gen_error(self, msg, line=None):
+        outmsg = []
+        if line is None:
+            line = self.current_line
+        outmsg.append(self.filename + ", ")
+        if isinstance(line, (list, tuple)):
+            outmsg.append("lines %d-%d: " % tuple(line))
+        else:
+            outmsg.append("line %d: " % line)
+        outmsg.append(str(msg))
+        return "".join(outmsg)
+
+    def error(self, msg, line=None):
+        raise ValueError("error: " + self.gen_error(msg, line))
+
+    def warn(self, msg, line=None):
+        """Print (to stderr) a warning message tied to the current logical
+           line in the current file.  If the current logical line in the
+           file spans multiple physical lines, the warning refers to the
+           whole range, eg. "lines 3-5".  If 'line' supplied, it overrides
+           the current line number; it may be a list or tuple to indicate a
+           range of physical lines, or an integer for a single physical
+           line."""
+        sys.stderr.write("warning: " + self.gen_error(msg, line) + "\n")
+
+    def readline(self):
+        """Read and return a single logical line from the current file (or
+           from an internal buffer if lines have previously been "unread"
+           with 'unreadline()').  If the 'join_lines' option is true, this
+           may involve reading multiple physical lines concatenated into a
+           single string.  Updates the current line number, so calling
+           'warn()' after 'readline()' emits a warning about the physical
+           line(s) just read.  Returns None on end-of-file, since the empty
+           string can occur if 'rstrip_ws' is true but 'strip_blanks' is
+           not."""
+        # If any "unread" lines waiting in 'linebuf', return the top
+        # one.  (We don't actually buffer read-ahead data -- lines only
+        # get put in 'linebuf' if the client explicitly does an
+        # 'unreadline()'.
+        if self.linebuf:
+            line = self.linebuf[-1]
+            del self.linebuf[-1]
+            return line
+
+        buildup_line = ''
+
+        while True:
+            # read the line, make it None if EOF
+            line = self.file.readline()
+            if line == '':
+                line = None
+
+            if self.strip_comments and line:
+
+                # Look for the first "#" in the line.  If none, never
+                # mind.  If we find one and it's the first character, or
+                # is not preceded by "\", then it starts a comment --
+                # strip the comment, strip whitespace before it, and
+                # carry on.  Otherwise, it's just an escaped "#", so
+                # unescape it (and any other escaped "#"'s that might be
+                # lurking in there) and otherwise leave the line alone.
+
+                pos = line.find("#")
+                if pos == -1: # no "#" -- no comments
+                    pass
+
+                # It's definitely a comment -- either "#" is the first
+                # character, or it's elsewhere and unescaped.
+                elif pos == 0 or line[pos-1] != "\\":
+                    # Have to preserve the trailing newline, because it's
+                    # the job of a later step (rstrip_ws) to remove it --
+                    # and if rstrip_ws is false, we'd better preserve it!
+                    # (NB. this means that if the final line is all comment
+                    # and has no trailing newline, we will think that it's
+                    # EOF; I think that's OK.)
+                    eol = (line[-1] == '\n') and '\n' or ''
+                    line = line[0:pos] + eol
+
+                    # If all that's left is whitespace, then skip line
+                    # *now*, before we try to join it to 'buildup_line' --
+                    # that way constructs like
+                    #   hello \\
+                    #   # comment that should be ignored
+                    #   there
+                    # result in "hello there".
+                    if line.strip() == "":
+                        continue
+                else: # it's an escaped "#"
+                    line = line.replace("\\#", "#")
+
+            # did previous line end with a backslash? then accumulate
+            if self.join_lines and buildup_line:
+                # oops: end of file
+                if line is None:
+                    self.warn("continuation line immediately precedes "
+                              "end-of-file")
+                    return buildup_line
+
+                if self.collapse_join:
+                    line = line.lstrip()
+                line = buildup_line + line
+
+                # careful: pay attention to line number when incrementing it
+                if isinstance(self.current_line, list):
+                    self.current_line[1] = self.current_line[1] + 1
+                else:
+                    self.current_line = [self.current_line,
+                                         self.current_line + 1]
+            # just an ordinary line, read it as usual
+            else:
+                if line is None: # eof
+                    return None
+
+                # still have to be careful about incrementing the line number!
+                if isinstance(self.current_line, list):
+                    self.current_line = self.current_line[1] + 1
+                else:
+                    self.current_line = self.current_line + 1
+
+            # strip whitespace however the client wants (leading and
+            # trailing, or one or the other, or neither)
+            if self.lstrip_ws and self.rstrip_ws:
+                line = line.strip()
+            elif self.lstrip_ws:
+                line = line.lstrip()
+            elif self.rstrip_ws:
+                line = line.rstrip()
+
+            # blank line (whether we rstrip'ed or not)? skip to next line
+            # if appropriate
+            if (line == '' or line == '\n') and self.skip_blanks:
+                continue
+
+            if self.join_lines:
+                if line[-1] == '\\':
+                    buildup_line = line[:-1]
+                    continue
+
+                if line[-2:] == '\\\n':
+                    buildup_line = line[0:-2] + '\n'
+                    continue
+
+            # well, I guess there's some actual content there: return it
+            return line
+
+    def readlines(self):
+        """Read and return the list of all logical lines remaining in the
+           current file."""
+        lines = []
+        while True:
+            line = self.readline()
+            if line is None:
+                return lines
+            lines.append(line)
+
+    def unreadline(self, line):
+        """Push 'line' (a string) onto an internal buffer that will be
+           checked by future 'readline()' calls.  Handy for implementing
+           a parser with line-at-a-time lookahead."""
+        self.linebuf.append(line)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/unixccompiler.py b/venv/Lib/site-packages/setuptools/_distutils/unixccompiler.py
new file mode 100644
index 000000000..4d7a6de74
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/unixccompiler.py
@@ -0,0 +1,328 @@
+"""distutils.unixccompiler
+
+Contains the UnixCCompiler class, a subclass of CCompiler that handles
+the "typical" Unix-style command-line C compiler:
+  * macros defined with -Dname[=value]
+  * macros undefined with -Uname
+  * include search directories specified with -Idir
+  * libraries specified with -lllib
+  * library search directories specified with -Ldir
+  * compile handled by 'cc' (or similar) executable with -c option:
+    compiles .c to .o
+  * link static library handled by 'ar' command (possibly with 'ranlib')
+  * link shared library handled by 'cc -shared'
+"""
+
+import os, sys, re
+
+from distutils import sysconfig
+from distutils.dep_util import newer
+from distutils.ccompiler import \
+     CCompiler, gen_preprocess_options, gen_lib_options
+from distutils.errors import \
+     DistutilsExecError, CompileError, LibError, LinkError
+from distutils import log
+
+if sys.platform == 'darwin':
+    import _osx_support
+
+# XXX Things not currently handled:
+#   * optimization/debug/warning flags; we just use whatever's in Python's
+#     Makefile and live with it.  Is this adequate?  If not, we might
+#     have to have a bunch of subclasses GNUCCompiler, SGICCompiler,
+#     SunCCompiler, and I suspect down that road lies madness.
+#   * even if we don't know a warning flag from an optimization flag,
+#     we need some way for outsiders to feed preprocessor/compiler/linker
+#     flags in to us -- eg. a sysadmin might want to mandate certain flags
+#     via a site config file, or a user might want to set something for
+#     compiling this module distribution only via the setup.py command
+#     line, whatever.  As long as these options come from something on the
+#     current system, they can be as system-dependent as they like, and we
+#     should just happily stuff them into the preprocessor/compiler/linker
+#     options and carry on.
+
+
+class UnixCCompiler(CCompiler):
+
+    compiler_type = 'unix'
+
+    # These are used by CCompiler in two places: the constructor sets
+    # instance attributes 'preprocessor', 'compiler', etc. from them, and
+    # 'set_executable()' allows any of these to be set.  The defaults here
+    # are pretty generic; they will probably have to be set by an outsider
+    # (eg. using information discovered by the sysconfig about building
+    # Python extensions).
+    executables = {'preprocessor' : None,
+                   'compiler'     : ["cc"],
+                   'compiler_so'  : ["cc"],
+                   'compiler_cxx' : ["cc"],
+                   'linker_so'    : ["cc", "-shared"],
+                   'linker_exe'   : ["cc"],
+                   'archiver'     : ["ar", "-cr"],
+                   'ranlib'       : None,
+                  }
+
+    if sys.platform[:6] == "darwin":
+        executables['ranlib'] = ["ranlib"]
+
+    # Needed for the filename generation methods provided by the base
+    # class, CCompiler.  NB. whoever instantiates/uses a particular
+    # UnixCCompiler instance should set 'shared_lib_ext' -- we set a
+    # reasonable common default here, but it's not necessarily used on all
+    # Unices!
+
+    src_extensions = [".c",".C",".cc",".cxx",".cpp",".m"]
+    obj_extension = ".o"
+    static_lib_extension = ".a"
+    shared_lib_extension = ".so"
+    dylib_lib_extension = ".dylib"
+    xcode_stub_lib_extension = ".tbd"
+    static_lib_format = shared_lib_format = dylib_lib_format = "lib%s%s"
+    xcode_stub_lib_format = dylib_lib_format
+    if sys.platform == "cygwin":
+        exe_extension = ".exe"
+
+    def preprocess(self, source, output_file=None, macros=None,
+                   include_dirs=None, extra_preargs=None, extra_postargs=None):
+        fixed_args = self._fix_compile_args(None, macros, include_dirs)
+        ignore, macros, include_dirs = fixed_args
+        pp_opts = gen_preprocess_options(macros, include_dirs)
+        pp_args = self.preprocessor + pp_opts
+        if output_file:
+            pp_args.extend(['-o', output_file])
+        if extra_preargs:
+            pp_args[:0] = extra_preargs
+        if extra_postargs:
+            pp_args.extend(extra_postargs)
+        pp_args.append(source)
+
+        # We need to preprocess: either we're being forced to, or we're
+        # generating output to stdout, or there's a target output file and
+        # the source file is newer than the target (or the target doesn't
+        # exist).
+        if self.force or output_file is None or newer(source, output_file):
+            if output_file:
+                self.mkpath(os.path.dirname(output_file))
+            try:
+                self.spawn(pp_args)
+            except DistutilsExecError as msg:
+                raise CompileError(msg)
+
+    def _compile(self, obj, src, ext, cc_args, extra_postargs, pp_opts):
+        compiler_so = self.compiler_so
+        if sys.platform == 'darwin':
+            compiler_so = _osx_support.compiler_fixup(compiler_so,
+                                                    cc_args + extra_postargs)
+        try:
+            self.spawn(compiler_so + cc_args + [src, '-o', obj] +
+                       extra_postargs)
+        except DistutilsExecError as msg:
+            raise CompileError(msg)
+
+    def create_static_lib(self, objects, output_libname,
+                          output_dir=None, debug=0, target_lang=None):
+        objects, output_dir = self._fix_object_args(objects, output_dir)
+
+        output_filename = \
+            self.library_filename(output_libname, output_dir=output_dir)
+
+        if self._need_link(objects, output_filename):
+            self.mkpath(os.path.dirname(output_filename))
+            self.spawn(self.archiver +
+                       [output_filename] +
+                       objects + self.objects)
+
+            # Not many Unices required ranlib anymore -- SunOS 4.x is, I
+            # think the only major Unix that does.  Maybe we need some
+            # platform intelligence here to skip ranlib if it's not
+            # needed -- or maybe Python's configure script took care of
+            # it for us, hence the check for leading colon.
+            if self.ranlib:
+                try:
+                    self.spawn(self.ranlib + [output_filename])
+                except DistutilsExecError as msg:
+                    raise LibError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    def link(self, target_desc, objects,
+             output_filename, output_dir=None, libraries=None,
+             library_dirs=None, runtime_library_dirs=None,
+             export_symbols=None, debug=0, extra_preargs=None,
+             extra_postargs=None, build_temp=None, target_lang=None):
+        objects, output_dir = self._fix_object_args(objects, output_dir)
+        fixed_args = self._fix_lib_args(libraries, library_dirs,
+                                        runtime_library_dirs)
+        libraries, library_dirs, runtime_library_dirs = fixed_args
+
+        lib_opts = gen_lib_options(self, library_dirs, runtime_library_dirs,
+                                   libraries)
+        if not isinstance(output_dir, (str, type(None))):
+            raise TypeError("'output_dir' must be a string or None")
+        if output_dir is not None:
+            output_filename = os.path.join(output_dir, output_filename)
+
+        if self._need_link(objects, output_filename):
+            ld_args = (objects + self.objects +
+                       lib_opts + ['-o', output_filename])
+            if debug:
+                ld_args[:0] = ['-g']
+            if extra_preargs:
+                ld_args[:0] = extra_preargs
+            if extra_postargs:
+                ld_args.extend(extra_postargs)
+            self.mkpath(os.path.dirname(output_filename))
+            try:
+                if target_desc == CCompiler.EXECUTABLE:
+                    linker = self.linker_exe[:]
+                else:
+                    linker = self.linker_so[:]
+                if target_lang == "c++" and self.compiler_cxx:
+                    # skip over environment variable settings if /usr/bin/env
+                    # is used to set up the linker's environment.
+                    # This is needed on OSX. Note: this assumes that the
+                    # normal and C++ compiler have the same environment
+                    # settings.
+                    i = 0
+                    if os.path.basename(linker[0]) == "env":
+                        i = 1
+                        while '=' in linker[i]:
+                            i += 1
+
+                    if os.path.basename(linker[i]) == 'ld_so_aix':
+                        # AIX platforms prefix the compiler with the ld_so_aix
+                        # script, so we need to adjust our linker index
+                        offset = 1
+                    else:
+                        offset = 0
+
+                    linker[i+offset] = self.compiler_cxx[i]
+
+                if sys.platform == 'darwin':
+                    linker = _osx_support.compiler_fixup(linker, ld_args)
+
+                self.spawn(linker + ld_args)
+            except DistutilsExecError as msg:
+                raise LinkError(msg)
+        else:
+            log.debug("skipping %s (up-to-date)", output_filename)
+
+    # -- Miscellaneous methods -----------------------------------------
+    # These are all used by the 'gen_lib_options() function, in
+    # ccompiler.py.
+
+    def library_dir_option(self, dir):
+        return "-L" + dir
+
+    def _is_gcc(self, compiler_name):
+        return "gcc" in compiler_name or "g++" in compiler_name
+
+    def runtime_library_dir_option(self, dir):
+        # XXX Hackish, at the very least.  See Python bug #445902:
+        # http://sourceforge.net/tracker/index.php
+        #   ?func=detail&aid=445902&group_id=5470&atid=105470
+        # Linkers on different platforms need different options to
+        # specify that directories need to be added to the list of
+        # directories searched for dependencies when a dynamic library
+        # is sought.  GCC on GNU systems (Linux, FreeBSD, ...) has to
+        # be told to pass the -R option through to the linker, whereas
+        # other compilers and gcc on other systems just know this.
+        # Other compilers may need something slightly different.  At
+        # this time, there's no way to determine this information from
+        # the configuration data stored in the Python installation, so
+        # we use this hack.
+        compiler = os.path.basename(sysconfig.get_config_var("CC"))
+        if sys.platform[:6] == "darwin":
+            # MacOSX's linker doesn't understand the -R flag at all
+            return "-L" + dir
+        elif sys.platform[:7] == "freebsd":
+            return "-Wl,-rpath=" + dir
+        elif sys.platform[:5] == "hp-ux":
+            if self._is_gcc(compiler):
+                return ["-Wl,+s", "-L" + dir]
+            return ["+s", "-L" + dir]
+        else:
+            if self._is_gcc(compiler):
+                # gcc on non-GNU systems does not need -Wl, but can
+                # use it anyway.  Since distutils has always passed in
+                # -Wl whenever gcc was used in the past it is probably
+                # safest to keep doing so.
+                if sysconfig.get_config_var("GNULD") == "yes":
+                    # GNU ld needs an extra option to get a RUNPATH
+                    # instead of just an RPATH.
+                    return "-Wl,--enable-new-dtags,-R" + dir
+                else:
+                    return "-Wl,-R" + dir
+            else:
+                # No idea how --enable-new-dtags would be passed on to
+                # ld if this system was using GNU ld.  Don't know if a
+                # system like this even exists.
+                return "-R" + dir
+
+    def library_option(self, lib):
+        return "-l" + lib
+
+    def find_library_file(self, dirs, lib, debug=0):
+        shared_f = self.library_filename(lib, lib_type='shared')
+        dylib_f = self.library_filename(lib, lib_type='dylib')
+        xcode_stub_f = self.library_filename(lib, lib_type='xcode_stub')
+        static_f = self.library_filename(lib, lib_type='static')
+
+        if sys.platform == 'darwin':
+            # On OSX users can specify an alternate SDK using
+            # '-isysroot', calculate the SDK root if it is specified
+            # (and use it further on)
+            #
+            # Note that, as of Xcode 7, Apple SDKs may contain textual stub
+            # libraries with .tbd extensions rather than the normal .dylib
+            # shared libraries installed in /.  The Apple compiler tool
+            # chain handles this transparently but it can cause problems
+            # for programs that are being built with an SDK and searching
+            # for specific libraries.  Callers of find_library_file need to
+            # keep in mind that the base filename of the returned SDK library
+            # file might have a different extension from that of the library
+            # file installed on the running system, for example:
+            #   /Applications/Xcode.app/Contents/Developer/Platforms/
+            #       MacOSX.platform/Developer/SDKs/MacOSX10.11.sdk/
+            #       usr/lib/libedit.tbd
+            # vs
+            #   /usr/lib/libedit.dylib
+            cflags = sysconfig.get_config_var('CFLAGS')
+            m = re.search(r'-isysroot\s*(\S+)', cflags)
+            if m is None:
+                sysroot = '/'
+            else:
+                sysroot = m.group(1)
+
+
+
+        for dir in dirs:
+            shared = os.path.join(dir, shared_f)
+            dylib = os.path.join(dir, dylib_f)
+            static = os.path.join(dir, static_f)
+            xcode_stub = os.path.join(dir, xcode_stub_f)
+
+            if sys.platform == 'darwin' and (
+                dir.startswith('/System/') or (
+                dir.startswith('/usr/') and not dir.startswith('/usr/local/'))):
+
+                shared = os.path.join(sysroot, dir[1:], shared_f)
+                dylib = os.path.join(sysroot, dir[1:], dylib_f)
+                static = os.path.join(sysroot, dir[1:], static_f)
+                xcode_stub = os.path.join(sysroot, dir[1:], xcode_stub_f)
+
+            # We're second-guessing the linker here, with not much hard
+            # data to go on: GCC seems to prefer the shared library, so I'm
+            # assuming that *all* Unix C compilers do.  And of course I'm
+            # ignoring even GCC's "-static" option.  So sue me.
+            if os.path.exists(dylib):
+                return dylib
+            elif os.path.exists(xcode_stub):
+                return xcode_stub
+            elif os.path.exists(shared):
+                return shared
+            elif os.path.exists(static):
+                return static
+
+        # Oops, didn't find it in *any* of 'dirs'
+        return None
diff --git a/venv/Lib/site-packages/setuptools/_distutils/util.py b/venv/Lib/site-packages/setuptools/_distutils/util.py
new file mode 100644
index 000000000..f5aca7942
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/util.py
@@ -0,0 +1,561 @@
+"""distutils.util
+
+Miscellaneous utility functions -- anything that doesn't fit into
+one of the other *util.py modules.
+"""
+
+import os
+import re
+import importlib.util
+import string
+import sys
+from distutils.errors import DistutilsPlatformError
+from distutils.dep_util import newer
+from distutils.spawn import spawn
+from distutils import log
+from distutils.errors import DistutilsByteCompileError
+from .py35compat import _optim_args_from_interpreter_flags
+
+
+def get_host_platform():
+    """Return a string that identifies the current platform.  This is used mainly to
+    distinguish platform-specific build directories and platform-specific built
+    distributions.  Typically includes the OS name and version and the
+    architecture (as supplied by 'os.uname()'), although the exact information
+    included depends on the OS; eg. on Linux, the kernel version isn't
+    particularly important.
+
+    Examples of returned values:
+       linux-i586
+       linux-alpha (?)
+       solaris-2.6-sun4u
+
+    Windows will return one of:
+       win-amd64 (64bit Windows on AMD64 (aka x86_64, Intel64, EM64T, etc)
+       win32 (all others - specifically, sys.platform is returned)
+
+    For other non-POSIX platforms, currently just returns 'sys.platform'.
+
+    """
+    if os.name == 'nt':
+        if 'amd64' in sys.version.lower():
+            return 'win-amd64'
+        if '(arm)' in sys.version.lower():
+            return 'win-arm32'
+        if '(arm64)' in sys.version.lower():
+            return 'win-arm64'
+        return sys.platform
+
+    # Set for cross builds explicitly
+    if "_PYTHON_HOST_PLATFORM" in os.environ:
+        return os.environ["_PYTHON_HOST_PLATFORM"]
+
+    if os.name != "posix" or not hasattr(os, 'uname'):
+        # XXX what about the architecture? NT is Intel or Alpha,
+        # Mac OS is M68k or PPC, etc.
+        return sys.platform
+
+    # Try to distinguish various flavours of Unix
+
+    (osname, host, release, version, machine) = os.uname()
+
+    # Convert the OS name to lowercase, remove '/' characters, and translate
+    # spaces (for "Power Macintosh")
+    osname = osname.lower().replace('/', '')
+    machine = machine.replace(' ', '_')
+    machine = machine.replace('/', '-')
+
+    if osname[:5] == "linux":
+        # At least on Linux/Intel, 'machine' is the processor --
+        # i386, etc.
+        # XXX what about Alpha, SPARC, etc?
+        return  "%s-%s" % (osname, machine)
+    elif osname[:5] == "sunos":
+        if release[0] >= "5":           # SunOS 5 == Solaris 2
+            osname = "solaris"
+            release = "%d.%s" % (int(release[0]) - 3, release[2:])
+            # We can't use "platform.architecture()[0]" because a
+            # bootstrap problem. We use a dict to get an error
+            # if some suspicious happens.
+            bitness = {2147483647:"32bit", 9223372036854775807:"64bit"}
+            machine += ".%s" % bitness[sys.maxsize]
+        # fall through to standard osname-release-machine representation
+    elif osname[:3] == "aix":
+        from .py38compat import aix_platform
+        return aix_platform(osname, version, release)
+    elif osname[:6] == "cygwin":
+        osname = "cygwin"
+        rel_re = re.compile (r'[\d.]+', re.ASCII)
+        m = rel_re.match(release)
+        if m:
+            release = m.group()
+    elif osname[:6] == "darwin":
+        import _osx_support, distutils.sysconfig
+        osname, release, machine = _osx_support.get_platform_osx(
+                                        distutils.sysconfig.get_config_vars(),
+                                        osname, release, machine)
+
+    return "%s-%s-%s" % (osname, release, machine)
+
+def get_platform():
+    if os.name == 'nt':
+        TARGET_TO_PLAT = {
+            'x86' : 'win32',
+            'x64' : 'win-amd64',
+            'arm' : 'win-arm32',
+        }
+        return TARGET_TO_PLAT.get(os.environ.get('VSCMD_ARG_TGT_ARCH')) or get_host_platform()
+    else:
+        return get_host_platform()
+
+def convert_path (pathname):
+    """Return 'pathname' as a name that will work on the native filesystem,
+    i.e. split it on '/' and put it back together again using the current
+    directory separator.  Needed because filenames in the setup script are
+    always supplied in Unix style, and have to be converted to the local
+    convention before we can actually use them in the filesystem.  Raises
+    ValueError on non-Unix-ish systems if 'pathname' either starts or
+    ends with a slash.
+    """
+    if os.sep == '/':
+        return pathname
+    if not pathname:
+        return pathname
+    if pathname[0] == '/':
+        raise ValueError("path '%s' cannot be absolute" % pathname)
+    if pathname[-1] == '/':
+        raise ValueError("path '%s' cannot end with '/'" % pathname)
+
+    paths = pathname.split('/')
+    while '.' in paths:
+        paths.remove('.')
+    if not paths:
+        return os.curdir
+    return os.path.join(*paths)
+
+# convert_path ()
+
+
+def change_root (new_root, pathname):
+    """Return 'pathname' with 'new_root' prepended.  If 'pathname' is
+    relative, this is equivalent to "os.path.join(new_root,pathname)".
+    Otherwise, it requires making 'pathname' relative and then joining the
+    two, which is tricky on DOS/Windows and Mac OS.
+    """
+    if os.name == 'posix':
+        if not os.path.isabs(pathname):
+            return os.path.join(new_root, pathname)
+        else:
+            return os.path.join(new_root, pathname[1:])
+
+    elif os.name == 'nt':
+        (drive, path) = os.path.splitdrive(pathname)
+        if path[0] == '\\':
+            path = path[1:]
+        return os.path.join(new_root, path)
+
+    else:
+        raise DistutilsPlatformError("nothing known about platform '%s'" % os.name)
+
+
+_environ_checked = 0
+def check_environ ():
+    """Ensure that 'os.environ' has all the environment variables we
+    guarantee that users can use in config files, command-line options,
+    etc.  Currently this includes:
+      HOME - user's home directory (Unix only)
+      PLAT - description of the current platform, including hardware
+             and OS (see 'get_platform()')
+    """
+    global _environ_checked
+    if _environ_checked:
+        return
+
+    if os.name == 'posix' and 'HOME' not in os.environ:
+        try:
+            import pwd
+            os.environ['HOME'] = pwd.getpwuid(os.getuid())[5]
+        except (ImportError, KeyError):
+            # bpo-10496: if the current user identifier doesn't exist in the
+            # password database, do nothing
+            pass
+
+    if 'PLAT' not in os.environ:
+        os.environ['PLAT'] = get_platform()
+
+    _environ_checked = 1
+
+
+def subst_vars (s, local_vars):
+    """Perform shell/Perl-style variable substitution on 'string'.  Every
+    occurrence of '$' followed by a name is considered a variable, and
+    variable is substituted by the value found in the 'local_vars'
+    dictionary, or in 'os.environ' if it's not in 'local_vars'.
+    'os.environ' is first checked/augmented to guarantee that it contains
+    certain values: see 'check_environ()'.  Raise ValueError for any
+    variables not found in either 'local_vars' or 'os.environ'.
+    """
+    check_environ()
+    def _subst (match, local_vars=local_vars):
+        var_name = match.group(1)
+        if var_name in local_vars:
+            return str(local_vars[var_name])
+        else:
+            return os.environ[var_name]
+
+    try:
+        return re.sub(r'\$([a-zA-Z_][a-zA-Z_0-9]*)', _subst, s)
+    except KeyError as var:
+        raise ValueError("invalid variable '$%s'" % var)
+
+# subst_vars ()
+
+
+def grok_environment_error (exc, prefix="error: "):
+    # Function kept for backward compatibility.
+    # Used to try clever things with EnvironmentErrors,
+    # but nowadays str(exception) produces good messages.
+    return prefix + str(exc)
+
+
+# Needed by 'split_quoted()'
+_wordchars_re = _squote_re = _dquote_re = None
+def _init_regex():
+    global _wordchars_re, _squote_re, _dquote_re
+    _wordchars_re = re.compile(r'[^\\\'\"%s ]*' % string.whitespace)
+    _squote_re = re.compile(r"'(?:[^'\\]|\\.)*'")
+    _dquote_re = re.compile(r'"(?:[^"\\]|\\.)*"')
+
+def split_quoted (s):
+    """Split a string up according to Unix shell-like rules for quotes and
+    backslashes.  In short: words are delimited by spaces, as long as those
+    spaces are not escaped by a backslash, or inside a quoted string.
+    Single and double quotes are equivalent, and the quote characters can
+    be backslash-escaped.  The backslash is stripped from any two-character
+    escape sequence, leaving only the escaped character.  The quote
+    characters are stripped from any quoted string.  Returns a list of
+    words.
+    """
+
+    # This is a nice algorithm for splitting up a single string, since it
+    # doesn't require character-by-character examination.  It was a little
+    # bit of a brain-bender to get it working right, though...
+    if _wordchars_re is None: _init_regex()
+
+    s = s.strip()
+    words = []
+    pos = 0
+
+    while s:
+        m = _wordchars_re.match(s, pos)
+        end = m.end()
+        if end == len(s):
+            words.append(s[:end])
+            break
+
+        if s[end] in string.whitespace: # unescaped, unquoted whitespace: now
+            words.append(s[:end])       # we definitely have a word delimiter
+            s = s[end:].lstrip()
+            pos = 0
+
+        elif s[end] == '\\':            # preserve whatever is being escaped;
+                                        # will become part of the current word
+            s = s[:end] + s[end+1:]
+            pos = end+1
+
+        else:
+            if s[end] == "'":           # slurp singly-quoted string
+                m = _squote_re.match(s, end)
+            elif s[end] == '"':         # slurp doubly-quoted string
+                m = _dquote_re.match(s, end)
+            else:
+                raise RuntimeError("this can't happen (bad char '%c')" % s[end])
+
+            if m is None:
+                raise ValueError("bad string (mismatched %s quotes?)" % s[end])
+
+            (beg, end) = m.span()
+            s = s[:beg] + s[beg+1:end-1] + s[end:]
+            pos = m.end() - 2
+
+        if pos >= len(s):
+            words.append(s)
+            break
+
+    return words
+
+# split_quoted ()
+
+
+def execute (func, args, msg=None, verbose=0, dry_run=0):
+    """Perform some action that affects the outside world (eg.  by
+    writing to the filesystem).  Such actions are special because they
+    are disabled by the 'dry_run' flag.  This method takes care of all
+    that bureaucracy for you; all you have to do is supply the
+    function to call and an argument tuple for it (to embody the
+    "external action" being performed), and an optional message to
+    print.
+    """
+    if msg is None:
+        msg = "%s%r" % (func.__name__, args)
+        if msg[-2:] == ',)':        # correct for singleton tuple
+            msg = msg[0:-2] + ')'
+
+    log.info(msg)
+    if not dry_run:
+        func(*args)
+
+
+def strtobool (val):
+    """Convert a string representation of truth to true (1) or false (0).
+
+    True values are 'y', 'yes', 't', 'true', 'on', and '1'; false values
+    are 'n', 'no', 'f', 'false', 'off', and '0'.  Raises ValueError if
+    'val' is anything else.
+    """
+    val = val.lower()
+    if val in ('y', 'yes', 't', 'true', 'on', '1'):
+        return 1
+    elif val in ('n', 'no', 'f', 'false', 'off', '0'):
+        return 0
+    else:
+        raise ValueError("invalid truth value %r" % (val,))
+
+
+def byte_compile (py_files,
+                  optimize=0, force=0,
+                  prefix=None, base_dir=None,
+                  verbose=1, dry_run=0,
+                  direct=None):
+    """Byte-compile a collection of Python source files to .pyc
+    files in a __pycache__ subdirectory.  'py_files' is a list
+    of files to compile; any files that don't end in ".py" are silently
+    skipped.  'optimize' must be one of the following:
+      0 - don't optimize
+      1 - normal optimization (like "python -O")
+      2 - extra optimization (like "python -OO")
+    If 'force' is true, all files are recompiled regardless of
+    timestamps.
+
+    The source filename encoded in each bytecode file defaults to the
+    filenames listed in 'py_files'; you can modify these with 'prefix' and
+    'basedir'.  'prefix' is a string that will be stripped off of each
+    source filename, and 'base_dir' is a directory name that will be
+    prepended (after 'prefix' is stripped).  You can supply either or both
+    (or neither) of 'prefix' and 'base_dir', as you wish.
+
+    If 'dry_run' is true, doesn't actually do anything that would
+    affect the filesystem.
+
+    Byte-compilation is either done directly in this interpreter process
+    with the standard py_compile module, or indirectly by writing a
+    temporary script and executing it.  Normally, you should let
+    'byte_compile()' figure out to use direct compilation or not (see
+    the source for details).  The 'direct' flag is used by the script
+    generated in indirect mode; unless you know what you're doing, leave
+    it set to None.
+    """
+
+    # Late import to fix a bootstrap issue: _posixsubprocess is built by
+    # setup.py, but setup.py uses distutils.
+    import subprocess
+
+    # nothing is done if sys.dont_write_bytecode is True
+    if sys.dont_write_bytecode:
+        raise DistutilsByteCompileError('byte-compiling is disabled.')
+
+    # First, if the caller didn't force us into direct or indirect mode,
+    # figure out which mode we should be in.  We take a conservative
+    # approach: choose direct mode *only* if the current interpreter is
+    # in debug mode and optimize is 0.  If we're not in debug mode (-O
+    # or -OO), we don't know which level of optimization this
+    # interpreter is running with, so we can't do direct
+    # byte-compilation and be certain that it's the right thing.  Thus,
+    # always compile indirectly if the current interpreter is in either
+    # optimize mode, or if either optimization level was requested by
+    # the caller.
+    if direct is None:
+        direct = (__debug__ and optimize == 0)
+
+    # "Indirect" byte-compilation: write a temporary script and then
+    # run it with the appropriate flags.
+    if not direct:
+        try:
+            from tempfile import mkstemp
+            (script_fd, script_name) = mkstemp(".py")
+        except ImportError:
+            from tempfile import mktemp
+            (script_fd, script_name) = None, mktemp(".py")
+        log.info("writing byte-compilation script '%s'", script_name)
+        if not dry_run:
+            if script_fd is not None:
+                script = os.fdopen(script_fd, "w")
+            else:
+                script = open(script_name, "w")
+
+            with script:
+                script.write("""\
+from distutils.util import byte_compile
+files = [
+""")
+
+                # XXX would be nice to write absolute filenames, just for
+                # safety's sake (script should be more robust in the face of
+                # chdir'ing before running it).  But this requires abspath'ing
+                # 'prefix' as well, and that breaks the hack in build_lib's
+                # 'byte_compile()' method that carefully tacks on a trailing
+                # slash (os.sep really) to make sure the prefix here is "just
+                # right".  This whole prefix business is rather delicate -- the
+                # problem is that it's really a directory, but I'm treating it
+                # as a dumb string, so trailing slashes and so forth matter.
+
+                #py_files = map(os.path.abspath, py_files)
+                #if prefix:
+                #    prefix = os.path.abspath(prefix)
+
+                script.write(",\n".join(map(repr, py_files)) + "]\n")
+                script.write("""
+byte_compile(files, optimize=%r, force=%r,
+             prefix=%r, base_dir=%r,
+             verbose=%r, dry_run=0,
+             direct=1)
+""" % (optimize, force, prefix, base_dir, verbose))
+
+        cmd = [sys.executable]
+        cmd.extend(_optim_args_from_interpreter_flags())
+        cmd.append(script_name)
+        spawn(cmd, dry_run=dry_run)
+        execute(os.remove, (script_name,), "removing %s" % script_name,
+                dry_run=dry_run)
+
+    # "Direct" byte-compilation: use the py_compile module to compile
+    # right here, right now.  Note that the script generated in indirect
+    # mode simply calls 'byte_compile()' in direct mode, a weird sort of
+    # cross-process recursion.  Hey, it works!
+    else:
+        from py_compile import compile
+
+        for file in py_files:
+            if file[-3:] != ".py":
+                # This lets us be lazy and not filter filenames in
+                # the "install_lib" command.
+                continue
+
+            # Terminology from the py_compile module:
+            #   cfile - byte-compiled file
+            #   dfile - purported source filename (same as 'file' by default)
+            if optimize >= 0:
+                opt = '' if optimize == 0 else optimize
+                cfile = importlib.util.cache_from_source(
+                    file, optimization=opt)
+            else:
+                cfile = importlib.util.cache_from_source(file)
+            dfile = file
+            if prefix:
+                if file[:len(prefix)] != prefix:
+                    raise ValueError("invalid prefix: filename %r doesn't start with %r"
+                           % (file, prefix))
+                dfile = dfile[len(prefix):]
+            if base_dir:
+                dfile = os.path.join(base_dir, dfile)
+
+            cfile_base = os.path.basename(cfile)
+            if direct:
+                if force or newer(file, cfile):
+                    log.info("byte-compiling %s to %s", file, cfile_base)
+                    if not dry_run:
+                        compile(file, cfile, dfile)
+                else:
+                    log.debug("skipping byte-compilation of %s to %s",
+                              file, cfile_base)
+
+# byte_compile ()
+
+def rfc822_escape (header):
+    """Return a version of the string escaped for inclusion in an
+    RFC-822 header, by ensuring there are 8 spaces space after each newline.
+    """
+    lines = header.split('\n')
+    sep = '\n' + 8 * ' '
+    return sep.join(lines)
+
+# 2to3 support
+
+def run_2to3(files, fixer_names=None, options=None, explicit=None):
+    """Invoke 2to3 on a list of Python files.
+    The files should all come from the build area, as the
+    modification is done in-place. To reduce the build time,
+    only files modified since the last invocation of this
+    function should be passed in the files argument."""
+
+    if not files:
+        return
+
+    # Make this class local, to delay import of 2to3
+    from lib2to3.refactor import RefactoringTool, get_fixers_from_package
+    class DistutilsRefactoringTool(RefactoringTool):
+        def log_error(self, msg, *args, **kw):
+            log.error(msg, *args)
+
+        def log_message(self, msg, *args):
+            log.info(msg, *args)
+
+        def log_debug(self, msg, *args):
+            log.debug(msg, *args)
+
+    if fixer_names is None:
+        fixer_names = get_fixers_from_package('lib2to3.fixes')
+    r = DistutilsRefactoringTool(fixer_names, options=options)
+    r.refactor(files, write=True)
+
+def copydir_run_2to3(src, dest, template=None, fixer_names=None,
+                     options=None, explicit=None):
+    """Recursively copy a directory, only copying new and changed files,
+    running run_2to3 over all newly copied Python modules afterward.
+
+    If you give a template string, it's parsed like a MANIFEST.in.
+    """
+    from distutils.dir_util import mkpath
+    from distutils.file_util import copy_file
+    from distutils.filelist import FileList
+    filelist = FileList()
+    curdir = os.getcwd()
+    os.chdir(src)
+    try:
+        filelist.findall()
+    finally:
+        os.chdir(curdir)
+    filelist.files[:] = filelist.allfiles
+    if template:
+        for line in template.splitlines():
+            line = line.strip()
+            if not line: continue
+            filelist.process_template_line(line)
+    copied = []
+    for filename in filelist.files:
+        outname = os.path.join(dest, filename)
+        mkpath(os.path.dirname(outname))
+        res = copy_file(os.path.join(src, filename), outname, update=1)
+        if res[1]: copied.append(outname)
+    run_2to3([fn for fn in copied if fn.lower().endswith('.py')],
+             fixer_names=fixer_names, options=options, explicit=explicit)
+    return copied
+
+class Mixin2to3:
+    '''Mixin class for commands that run 2to3.
+    To configure 2to3, setup scripts may either change
+    the class variables, or inherit from individual commands
+    to override how 2to3 is invoked.'''
+
+    # provide list of fixers to run;
+    # defaults to all from lib2to3.fixers
+    fixer_names = None
+
+    # options dictionary
+    options = None
+
+    # list of fixers to invoke even though they are marked as explicit
+    explicit = None
+
+    def run_2to3(self, files):
+        return run_2to3(files, self.fixer_names, self.options, self.explicit)
diff --git a/venv/Lib/site-packages/setuptools/_distutils/version.py b/venv/Lib/site-packages/setuptools/_distutils/version.py
new file mode 100644
index 000000000..c33bebaed
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/version.py
@@ -0,0 +1,347 @@
+#
+# distutils/version.py
+#
+# Implements multiple version numbering conventions for the
+# Python Module Distribution Utilities.
+#
+# $Id$
+#
+
+"""Provides classes to represent module version numbers (one class for
+each style of version numbering).  There are currently two such classes
+implemented: StrictVersion and LooseVersion.
+
+Every version number class implements the following interface:
+  * the 'parse' method takes a string and parses it to some internal
+    representation; if the string is an invalid version number,
+    'parse' raises a ValueError exception
+  * the class constructor takes an optional string argument which,
+    if supplied, is passed to 'parse'
+  * __str__ reconstructs the string that was passed to 'parse' (or
+    an equivalent string -- ie. one that will generate an equivalent
+    version number instance)
+  * __repr__ generates Python code to recreate the version number instance
+  * _cmp compares the current instance with either another instance
+    of the same class or a string (which will be parsed to an instance
+    of the same class, thus must follow the same rules)
+"""
+
+import re
+
+class Version:
+    """Abstract base class for version numbering classes.  Just provides
+    constructor (__init__) and reproducer (__repr__), because those
+    seem to be the same for all version numbering classes; and route
+    rich comparisons to _cmp.
+    """
+
+    def __init__ (self, vstring=None):
+        if vstring:
+            self.parse(vstring)
+
+    def __repr__ (self):
+        return "%s ('%s')" % (self.__class__.__name__, str(self))
+
+    def __eq__(self, other):
+        c = self._cmp(other)
+        if c is NotImplemented:
+            return c
+        return c == 0
+
+    def __lt__(self, other):
+        c = self._cmp(other)
+        if c is NotImplemented:
+            return c
+        return c < 0
+
+    def __le__(self, other):
+        c = self._cmp(other)
+        if c is NotImplemented:
+            return c
+        return c <= 0
+
+    def __gt__(self, other):
+        c = self._cmp(other)
+        if c is NotImplemented:
+            return c
+        return c > 0
+
+    def __ge__(self, other):
+        c = self._cmp(other)
+        if c is NotImplemented:
+            return c
+        return c >= 0
+
+
+# Interface for version-number classes -- must be implemented
+# by the following classes (the concrete ones -- Version should
+# be treated as an abstract class).
+#    __init__ (string) - create and take same action as 'parse'
+#                        (string parameter is optional)
+#    parse (string)    - convert a string representation to whatever
+#                        internal representation is appropriate for
+#                        this style of version numbering
+#    __str__ (self)    - convert back to a string; should be very similar
+#                        (if not identical to) the string supplied to parse
+#    __repr__ (self)   - generate Python code to recreate
+#                        the instance
+#    _cmp (self, other) - compare two version numbers ('other' may
+#                        be an unparsed version string, or another
+#                        instance of your version class)
+
+
+class StrictVersion (Version):
+
+    """Version numbering for anal retentives and software idealists.
+    Implements the standard interface for version number classes as
+    described above.  A version number consists of two or three
+    dot-separated numeric components, with an optional "pre-release" tag
+    on the end.  The pre-release tag consists of the letter 'a' or 'b'
+    followed by a number.  If the numeric components of two version
+    numbers are equal, then one with a pre-release tag will always
+    be deemed earlier (lesser) than one without.
+
+    The following are valid version numbers (shown in the order that
+    would be obtained by sorting according to the supplied cmp function):
+
+        0.4       0.4.0  (these two are equivalent)
+        0.4.1
+        0.5a1
+        0.5b3
+        0.5
+        0.9.6
+        1.0
+        1.0.4a3
+        1.0.4b1
+        1.0.4
+
+    The following are examples of invalid version numbers:
+
+        1
+        2.7.2.2
+        1.3.a4
+        1.3pl1
+        1.3c4
+
+    The rationale for this version numbering system will be explained
+    in the distutils documentation.
+    """
+
+    version_re = re.compile(r'^(\d+) \. (\d+) (\. (\d+))? ([ab](\d+))?$',
+                            re.VERBOSE | re.ASCII)
+
+
+    def parse (self, vstring):
+        match = self.version_re.match(vstring)
+        if not match:
+            raise ValueError("invalid version number '%s'" % vstring)
+
+        (major, minor, patch, prerelease, prerelease_num) = \
+            match.group(1, 2, 4, 5, 6)
+
+        if patch:
+            self.version = tuple(map(int, [major, minor, patch]))
+        else:
+            self.version = tuple(map(int, [major, minor])) + (0,)
+
+        if prerelease:
+            self.prerelease = (prerelease[0], int(prerelease_num))
+        else:
+            self.prerelease = None
+
+
+    def __str__ (self):
+
+        if self.version[2] == 0:
+            vstring = '.'.join(map(str, self.version[0:2]))
+        else:
+            vstring = '.'.join(map(str, self.version))
+
+        if self.prerelease:
+            vstring = vstring + self.prerelease[0] + str(self.prerelease[1])
+
+        return vstring
+
+
+    def _cmp (self, other):
+        if isinstance(other, str):
+            other = StrictVersion(other)
+        elif not isinstance(other, StrictVersion):
+            return NotImplemented
+
+        if self.version != other.version:
+            # numeric versions don't match
+            # prerelease stuff doesn't matter
+            if self.version < other.version:
+                return -1
+            else:
+                return 1
+
+        # have to compare prerelease
+        # case 1: neither has prerelease; they're equal
+        # case 2: self has prerelease, other doesn't; other is greater
+        # case 3: self doesn't have prerelease, other does: self is greater
+        # case 4: both have prerelease: must compare them!
+
+        if (not self.prerelease and not other.prerelease):
+            return 0
+        elif (self.prerelease and not other.prerelease):
+            return -1
+        elif (not self.prerelease and other.prerelease):
+            return 1
+        elif (self.prerelease and other.prerelease):
+            if self.prerelease == other.prerelease:
+                return 0
+            elif self.prerelease < other.prerelease:
+                return -1
+            else:
+                return 1
+        else:
+            assert False, "never get here"
+
+# end class StrictVersion
+
+
+# The rules according to Greg Stein:
+# 1) a version number has 1 or more numbers separated by a period or by
+#    sequences of letters. If only periods, then these are compared
+#    left-to-right to determine an ordering.
+# 2) sequences of letters are part of the tuple for comparison and are
+#    compared lexicographically
+# 3) recognize the numeric components may have leading zeroes
+#
+# The LooseVersion class below implements these rules: a version number
+# string is split up into a tuple of integer and string components, and
+# comparison is a simple tuple comparison.  This means that version
+# numbers behave in a predictable and obvious way, but a way that might
+# not necessarily be how people *want* version numbers to behave.  There
+# wouldn't be a problem if people could stick to purely numeric version
+# numbers: just split on period and compare the numbers as tuples.
+# However, people insist on putting letters into their version numbers;
+# the most common purpose seems to be:
+#   - indicating a "pre-release" version
+#     ('alpha', 'beta', 'a', 'b', 'pre', 'p')
+#   - indicating a post-release patch ('p', 'pl', 'patch')
+# but of course this can't cover all version number schemes, and there's
+# no way to know what a programmer means without asking him.
+#
+# The problem is what to do with letters (and other non-numeric
+# characters) in a version number.  The current implementation does the
+# obvious and predictable thing: keep them as strings and compare
+# lexically within a tuple comparison.  This has the desired effect if
+# an appended letter sequence implies something "post-release":
+# eg. "0.99" < "0.99pl14" < "1.0", and "5.001" < "5.001m" < "5.002".
+#
+# However, if letters in a version number imply a pre-release version,
+# the "obvious" thing isn't correct.  Eg. you would expect that
+# "1.5.1" < "1.5.2a2" < "1.5.2", but under the tuple/lexical comparison
+# implemented here, this just isn't so.
+#
+# Two possible solutions come to mind.  The first is to tie the
+# comparison algorithm to a particular set of semantic rules, as has
+# been done in the StrictVersion class above.  This works great as long
+# as everyone can go along with bondage and discipline.  Hopefully a
+# (large) subset of Python module programmers will agree that the
+# particular flavour of bondage and discipline provided by StrictVersion
+# provides enough benefit to be worth using, and will submit their
+# version numbering scheme to its domination.  The free-thinking
+# anarchists in the lot will never give in, though, and something needs
+# to be done to accommodate them.
+#
+# Perhaps a "moderately strict" version class could be implemented that
+# lets almost anything slide (syntactically), and makes some heuristic
+# assumptions about non-digits in version number strings.  This could
+# sink into special-case-hell, though; if I was as talented and
+# idiosyncratic as Larry Wall, I'd go ahead and implement a class that
+# somehow knows that "1.2.1" < "1.2.2a2" < "1.2.2" < "1.2.2pl3", and is
+# just as happy dealing with things like "2g6" and "1.13++".  I don't
+# think I'm smart enough to do it right though.
+#
+# In any case, I've coded the test suite for this module (see
+# ../test/test_version.py) specifically to fail on things like comparing
+# "1.2a2" and "1.2".  That's not because the *code* is doing anything
+# wrong, it's because the simple, obvious design doesn't match my
+# complicated, hairy expectations for real-world version numbers.  It
+# would be a snap to fix the test suite to say, "Yep, LooseVersion does
+# the Right Thing" (ie. the code matches the conception).  But I'd rather
+# have a conception that matches common notions about version numbers.
+
+class LooseVersion (Version):
+
+    """Version numbering for anarchists and software realists.
+    Implements the standard interface for version number classes as
+    described above.  A version number consists of a series of numbers,
+    separated by either periods or strings of letters.  When comparing
+    version numbers, the numeric components will be compared
+    numerically, and the alphabetic components lexically.  The following
+    are all valid version numbers, in no particular order:
+
+        1.5.1
+        1.5.2b2
+        161
+        3.10a
+        8.02
+        3.4j
+        1996.07.12
+        3.2.pl0
+        3.1.1.6
+        2g6
+        11g
+        0.960923
+        2.2beta29
+        1.13++
+        5.5.kw
+        2.0b1pl0
+
+    In fact, there is no such thing as an invalid version number under
+    this scheme; the rules for comparison are simple and predictable,
+    but may not always give the results you want (for some definition
+    of "want").
+    """
+
+    component_re = re.compile(r'(\d+ | [a-z]+ | \.)', re.VERBOSE)
+
+    def __init__ (self, vstring=None):
+        if vstring:
+            self.parse(vstring)
+
+
+    def parse (self, vstring):
+        # I've given up on thinking I can reconstruct the version string
+        # from the parsed tuple -- so I just store the string here for
+        # use by __str__
+        self.vstring = vstring
+        components = [x for x in self.component_re.split(vstring)
+                              if x and x != '.']
+        for i, obj in enumerate(components):
+            try:
+                components[i] = int(obj)
+            except ValueError:
+                pass
+
+        self.version = components
+
+
+    def __str__ (self):
+        return self.vstring
+
+
+    def __repr__ (self):
+        return "LooseVersion ('%s')" % str(self)
+
+
+    def _cmp (self, other):
+        if isinstance(other, str):
+            other = LooseVersion(other)
+        elif not isinstance(other, LooseVersion):
+            return NotImplemented
+
+        if self.version == other.version:
+            return 0
+        if self.version < other.version:
+            return -1
+        if self.version > other.version:
+            return 1
+
+
+# end class LooseVersion
diff --git a/venv/Lib/site-packages/setuptools/_distutils/versionpredicate.py b/venv/Lib/site-packages/setuptools/_distutils/versionpredicate.py
new file mode 100644
index 000000000..062c98f24
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_distutils/versionpredicate.py
@@ -0,0 +1,166 @@
+"""Module for parsing and testing package version predicate strings.
+"""
+import re
+import distutils.version
+import operator
+
+
+re_validPackage = re.compile(r"(?i)^\s*([a-z_]\w*(?:\.[a-z_]\w*)*)(.*)",
+    re.ASCII)
+# (package) (rest)
+
+re_paren = re.compile(r"^\s*\((.*)\)\s*$") # (list) inside of parentheses
+re_splitComparison = re.compile(r"^\s*(<=|>=|<|>|!=|==)\s*([^\s,]+)\s*$")
+# (comp) (version)
+
+
+def splitUp(pred):
+    """Parse a single version comparison.
+
+    Return (comparison string, StrictVersion)
+    """
+    res = re_splitComparison.match(pred)
+    if not res:
+        raise ValueError("bad package restriction syntax: %r" % pred)
+    comp, verStr = res.groups()
+    return (comp, distutils.version.StrictVersion(verStr))
+
+compmap = {"<": operator.lt, "<=": operator.le, "==": operator.eq,
+           ">": operator.gt, ">=": operator.ge, "!=": operator.ne}
+
+class VersionPredicate:
+    """Parse and test package version predicates.
+
+    >>> v = VersionPredicate('pyepat.abc (>1.0, <3333.3a1, !=1555.1b3)')
+
+    The `name` attribute provides the full dotted name that is given::
+
+    >>> v.name
+    'pyepat.abc'
+
+    The str() of a `VersionPredicate` provides a normalized
+    human-readable version of the expression::
+
+    >>> print(v)
+    pyepat.abc (> 1.0, < 3333.3a1, != 1555.1b3)
+
+    The `satisfied_by()` method can be used to determine with a given
+    version number is included in the set described by the version
+    restrictions::
+
+    >>> v.satisfied_by('1.1')
+    True
+    >>> v.satisfied_by('1.4')
+    True
+    >>> v.satisfied_by('1.0')
+    False
+    >>> v.satisfied_by('4444.4')
+    False
+    >>> v.satisfied_by('1555.1b3')
+    False
+
+    `VersionPredicate` is flexible in accepting extra whitespace::
+
+    >>> v = VersionPredicate(' pat( ==  0.1  )  ')
+    >>> v.name
+    'pat'
+    >>> v.satisfied_by('0.1')
+    True
+    >>> v.satisfied_by('0.2')
+    False
+
+    If any version numbers passed in do not conform to the
+    restrictions of `StrictVersion`, a `ValueError` is raised::
+
+    >>> v = VersionPredicate('p1.p2.p3.p4(>=1.0, <=1.3a1, !=1.2zb3)')
+    Traceback (most recent call last):
+      ...
+    ValueError: invalid version number '1.2zb3'
+
+    It the module or package name given does not conform to what's
+    allowed as a legal module or package name, `ValueError` is
+    raised::
+
+    >>> v = VersionPredicate('foo-bar')
+    Traceback (most recent call last):
+      ...
+    ValueError: expected parenthesized list: '-bar'
+
+    >>> v = VersionPredicate('foo bar (12.21)')
+    Traceback (most recent call last):
+      ...
+    ValueError: expected parenthesized list: 'bar (12.21)'
+
+    """
+
+    def __init__(self, versionPredicateStr):
+        """Parse a version predicate string.
+        """
+        # Fields:
+        #    name:  package name
+        #    pred:  list of (comparison string, StrictVersion)
+
+        versionPredicateStr = versionPredicateStr.strip()
+        if not versionPredicateStr:
+            raise ValueError("empty package restriction")
+        match = re_validPackage.match(versionPredicateStr)
+        if not match:
+            raise ValueError("bad package name in %r" % versionPredicateStr)
+        self.name, paren = match.groups()
+        paren = paren.strip()
+        if paren:
+            match = re_paren.match(paren)
+            if not match:
+                raise ValueError("expected parenthesized list: %r" % paren)
+            str = match.groups()[0]
+            self.pred = [splitUp(aPred) for aPred in str.split(",")]
+            if not self.pred:
+                raise ValueError("empty parenthesized list in %r"
+                                 % versionPredicateStr)
+        else:
+            self.pred = []
+
+    def __str__(self):
+        if self.pred:
+            seq = [cond + " " + str(ver) for cond, ver in self.pred]
+            return self.name + " (" + ", ".join(seq) + ")"
+        else:
+            return self.name
+
+    def satisfied_by(self, version):
+        """True if version is compatible with all the predicates in self.
+        The parameter version must be acceptable to the StrictVersion
+        constructor.  It may be either a string or StrictVersion.
+        """
+        for cond, ver in self.pred:
+            if not compmap[cond](version, ver):
+                return False
+        return True
+
+
+_provision_rx = None
+
+def split_provision(value):
+    """Return the name and optional version number of a provision.
+
+    The version number, if given, will be returned as a `StrictVersion`
+    instance, otherwise it will be `None`.
+
+    >>> split_provision('mypkg')
+    ('mypkg', None)
+    >>> split_provision(' mypkg( 1.2 ) ')
+    ('mypkg', StrictVersion ('1.2'))
+    """
+    global _provision_rx
+    if _provision_rx is None:
+        _provision_rx = re.compile(
+            r"([a-zA-Z_]\w*(?:\.[a-zA-Z_]\w*)*)(?:\s*\(\s*([^)\s]+)\s*\))?$",
+            re.ASCII)
+    value = value.strip()
+    m = _provision_rx.match(value)
+    if not m:
+        raise ValueError("illegal provides specification: %r" % value)
+    ver = m.group(2) or None
+    if ver:
+        ver = distutils.version.StrictVersion(ver)
+    return m.group(1), ver
diff --git a/venv/Lib/site-packages/setuptools/_imp.py b/venv/Lib/site-packages/setuptools/_imp.py
new file mode 100644
index 000000000..451e45a83
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_imp.py
@@ -0,0 +1,82 @@
+"""
+Re-implementation of find_module and get_frozen_object
+from the deprecated imp module.
+"""
+
+import os
+import importlib.util
+import importlib.machinery
+
+from .py34compat import module_from_spec
+
+
+PY_SOURCE = 1
+PY_COMPILED = 2
+C_EXTENSION = 3
+C_BUILTIN = 6
+PY_FROZEN = 7
+
+
+def find_spec(module, paths):
+    finder = (
+        importlib.machinery.PathFinder().find_spec
+        if isinstance(paths, list) else
+        importlib.util.find_spec
+    )
+    return finder(module, paths)
+
+
+def find_module(module, paths=None):
+    """Just like 'imp.find_module()', but with package support"""
+    spec = find_spec(module, paths)
+    if spec is None:
+        raise ImportError("Can't find %s" % module)
+    if not spec.has_location and hasattr(spec, 'submodule_search_locations'):
+        spec = importlib.util.spec_from_loader('__init__.py', spec.loader)
+
+    kind = -1
+    file = None
+    static = isinstance(spec.loader, type)
+    if spec.origin == 'frozen' or static and issubclass(
+            spec.loader, importlib.machinery.FrozenImporter):
+        kind = PY_FROZEN
+        path = None  # imp compabilty
+        suffix = mode = ''  # imp compability
+    elif spec.origin == 'built-in' or static and issubclass(
+            spec.loader, importlib.machinery.BuiltinImporter):
+        kind = C_BUILTIN
+        path = None  # imp compabilty
+        suffix = mode = ''  # imp compability
+    elif spec.has_location:
+        path = spec.origin
+        suffix = os.path.splitext(path)[1]
+        mode = 'r' if suffix in importlib.machinery.SOURCE_SUFFIXES else 'rb'
+
+        if suffix in importlib.machinery.SOURCE_SUFFIXES:
+            kind = PY_SOURCE
+        elif suffix in importlib.machinery.BYTECODE_SUFFIXES:
+            kind = PY_COMPILED
+        elif suffix in importlib.machinery.EXTENSION_SUFFIXES:
+            kind = C_EXTENSION
+
+        if kind in {PY_SOURCE, PY_COMPILED}:
+            file = open(path, mode)
+    else:
+        path = None
+        suffix = mode = ''
+
+    return file, path, (suffix, mode, kind)
+
+
+def get_frozen_object(module, paths=None):
+    spec = find_spec(module, paths)
+    if not spec:
+        raise ImportError("Can't find %s" % module)
+    return spec.loader.get_code(module)
+
+
+def get_module(module, paths, info):
+    spec = find_spec(module, paths)
+    if not spec:
+        raise ImportError("Can't find %s" % module)
+    return module_from_spec(spec)
diff --git a/venv/Lib/site-packages/setuptools/_vendor/__init__.py b/venv/Lib/site-packages/setuptools/_vendor/__init__.py
new file mode 100644
index 000000000..e69de29bb
diff --git a/venv/Lib/site-packages/setuptools/_vendor/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..77a1bc12e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/__pycache__/ordered_set.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/ordered_set.cpython-36.pyc
new file mode 100644
index 000000000..b8a6e49f4
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/ordered_set.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/__pycache__/pyparsing.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/pyparsing.cpython-36.pyc
new file mode 100644
index 000000000..6be0e5e64
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/__pycache__/pyparsing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/ordered_set.py b/venv/Lib/site-packages/setuptools/_vendor/ordered_set.py
new file mode 100644
index 000000000..14876000d
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/ordered_set.py
@@ -0,0 +1,488 @@
+"""
+An OrderedSet is a custom MutableSet that remembers its order, so that every
+entry has an index that can be looked up.
+
+Based on a recipe originally posted to ActiveState Recipes by Raymond Hettiger,
+and released under the MIT license.
+"""
+import itertools as it
+from collections import deque
+
+try:
+    # Python 3
+    from collections.abc import MutableSet, Sequence
+except ImportError:
+    # Python 2.7
+    from collections import MutableSet, Sequence
+
+SLICE_ALL = slice(None)
+__version__ = "3.1"
+
+
+def is_iterable(obj):
+    """
+    Are we being asked to look up a list of things, instead of a single thing?
+    We check for the `__iter__` attribute so that this can cover types that
+    don't have to be known by this module, such as NumPy arrays.
+
+    Strings, however, should be considered as atomic values to look up, not
+    iterables. The same goes for tuples, since they are immutable and therefore
+    valid entries.
+
+    We don't need to check for the Python 2 `unicode` type, because it doesn't
+    have an `__iter__` attribute anyway.
+    """
+    return (
+        hasattr(obj, "__iter__")
+        and not isinstance(obj, str)
+        and not isinstance(obj, tuple)
+    )
+
+
+class OrderedSet(MutableSet, Sequence):
+    """
+    An OrderedSet is a custom MutableSet that remembers its order, so that
+    every entry has an index that can be looked up.
+
+    Example:
+        >>> OrderedSet([1, 1, 2, 3, 2])
+        OrderedSet([1, 2, 3])
+    """
+
+    def __init__(self, iterable=None):
+        self.items = []
+        self.map = {}
+        if iterable is not None:
+            self |= iterable
+
+    def __len__(self):
+        """
+        Returns the number of unique elements in the ordered set
+
+        Example:
+            >>> len(OrderedSet([]))
+            0
+            >>> len(OrderedSet([1, 2]))
+            2
+        """
+        return len(self.items)
+
+    def __getitem__(self, index):
+        """
+        Get the item at a given index.
+
+        If `index` is a slice, you will get back that slice of items, as a
+        new OrderedSet.
+
+        If `index` is a list or a similar iterable, you'll get a list of
+        items corresponding to those indices. This is similar to NumPy's
+        "fancy indexing". The result is not an OrderedSet because you may ask
+        for duplicate indices, and the number of elements returned should be
+        the number of elements asked for.
+
+        Example:
+            >>> oset = OrderedSet([1, 2, 3])
+            >>> oset[1]
+            2
+        """
+        if isinstance(index, slice) and index == SLICE_ALL:
+            return self.copy()
+        elif is_iterable(index):
+            return [self.items[i] for i in index]
+        elif hasattr(index, "__index__") or isinstance(index, slice):
+            result = self.items[index]
+            if isinstance(result, list):
+                return self.__class__(result)
+            else:
+                return result
+        else:
+            raise TypeError("Don't know how to index an OrderedSet by %r" % index)
+
+    def copy(self):
+        """
+        Return a shallow copy of this object.
+
+        Example:
+            >>> this = OrderedSet([1, 2, 3])
+            >>> other = this.copy()
+            >>> this == other
+            True
+            >>> this is other
+            False
+        """
+        return self.__class__(self)
+
+    def __getstate__(self):
+        if len(self) == 0:
+            # The state can't be an empty list.
+            # We need to return a truthy value, or else __setstate__ won't be run.
+            #
+            # This could have been done more gracefully by always putting the state
+            # in a tuple, but this way is backwards- and forwards- compatible with
+            # previous versions of OrderedSet.
+            return (None,)
+        else:
+            return list(self)
+
+    def __setstate__(self, state):
+        if state == (None,):
+            self.__init__([])
+        else:
+            self.__init__(state)
+
+    def __contains__(self, key):
+        """
+        Test if the item is in this ordered set
+
+        Example:
+            >>> 1 in OrderedSet([1, 3, 2])
+            True
+            >>> 5 in OrderedSet([1, 3, 2])
+            False
+        """
+        return key in self.map
+
+    def add(self, key):
+        """
+        Add `key` as an item to this OrderedSet, then return its index.
+
+        If `key` is already in the OrderedSet, return the index it already
+        had.
+
+        Example:
+            >>> oset = OrderedSet()
+            >>> oset.append(3)
+            0
+            >>> print(oset)
+            OrderedSet([3])
+        """
+        if key not in self.map:
+            self.map[key] = len(self.items)
+            self.items.append(key)
+        return self.map[key]
+
+    append = add
+
+    def update(self, sequence):
+        """
+        Update the set with the given iterable sequence, then return the index
+        of the last element inserted.
+
+        Example:
+            >>> oset = OrderedSet([1, 2, 3])
+            >>> oset.update([3, 1, 5, 1, 4])
+            4
+            >>> print(oset)
+            OrderedSet([1, 2, 3, 5, 4])
+        """
+        item_index = None
+        try:
+            for item in sequence:
+                item_index = self.add(item)
+        except TypeError:
+            raise ValueError(
+                "Argument needs to be an iterable, got %s" % type(sequence)
+            )
+        return item_index
+
+    def index(self, key):
+        """
+        Get the index of a given entry, raising an IndexError if it's not
+        present.
+
+        `key` can be an iterable of entries that is not a string, in which case
+        this returns a list of indices.
+
+        Example:
+            >>> oset = OrderedSet([1, 2, 3])
+            >>> oset.index(2)
+            1
+        """
+        if is_iterable(key):
+            return [self.index(subkey) for subkey in key]
+        return self.map[key]
+
+    # Provide some compatibility with pd.Index
+    get_loc = index
+    get_indexer = index
+
+    def pop(self):
+        """
+        Remove and return the last element from the set.
+
+        Raises KeyError if the set is empty.
+
+        Example:
+            >>> oset = OrderedSet([1, 2, 3])
+            >>> oset.pop()
+            3
+        """
+        if not self.items:
+            raise KeyError("Set is empty")
+
+        elem = self.items[-1]
+        del self.items[-1]
+        del self.map[elem]
+        return elem
+
+    def discard(self, key):
+        """
+        Remove an element.  Do not raise an exception if absent.
+
+        The MutableSet mixin uses this to implement the .remove() method, which
+        *does* raise an error when asked to remove a non-existent item.
+
+        Example:
+            >>> oset = OrderedSet([1, 2, 3])
+            >>> oset.discard(2)
+            >>> print(oset)
+            OrderedSet([1, 3])
+            >>> oset.discard(2)
+            >>> print(oset)
+            OrderedSet([1, 3])
+        """
+        if key in self:
+            i = self.map[key]
+            del self.items[i]
+            del self.map[key]
+            for k, v in self.map.items():
+                if v >= i:
+                    self.map[k] = v - 1
+
+    def clear(self):
+        """
+        Remove all items from this OrderedSet.
+        """
+        del self.items[:]
+        self.map.clear()
+
+    def __iter__(self):
+        """
+        Example:
+            >>> list(iter(OrderedSet([1, 2, 3])))
+            [1, 2, 3]
+        """
+        return iter(self.items)
+
+    def __reversed__(self):
+        """
+        Example:
+            >>> list(reversed(OrderedSet([1, 2, 3])))
+            [3, 2, 1]
+        """
+        return reversed(self.items)
+
+    def __repr__(self):
+        if not self:
+            return "%s()" % (self.__class__.__name__,)
+        return "%s(%r)" % (self.__class__.__name__, list(self))
+
+    def __eq__(self, other):
+        """
+        Returns true if the containers have the same items. If `other` is a
+        Sequence, then order is checked, otherwise it is ignored.
+
+        Example:
+            >>> oset = OrderedSet([1, 3, 2])
+            >>> oset == [1, 3, 2]
+            True
+            >>> oset == [1, 2, 3]
+            False
+            >>> oset == [2, 3]
+            False
+            >>> oset == OrderedSet([3, 2, 1])
+            False
+        """
+        # In Python 2 deque is not a Sequence, so treat it as one for
+        # consistent behavior with Python 3.
+        if isinstance(other, (Sequence, deque)):
+            # Check that this OrderedSet contains the same elements, in the
+            # same order, as the other object.
+            return list(self) == list(other)
+        try:
+            other_as_set = set(other)
+        except TypeError:
+            # If `other` can't be converted into a set, it's not equal.
+            return False
+        else:
+            return set(self) == other_as_set
+
+    def union(self, *sets):
+        """
+        Combines all unique items.
+        Each items order is defined by its first appearance.
+
+        Example:
+            >>> oset = OrderedSet.union(OrderedSet([3, 1, 4, 1, 5]), [1, 3], [2, 0])
+            >>> print(oset)
+            OrderedSet([3, 1, 4, 5, 2, 0])
+            >>> oset.union([8, 9])
+            OrderedSet([3, 1, 4, 5, 2, 0, 8, 9])
+            >>> oset | {10}
+            OrderedSet([3, 1, 4, 5, 2, 0, 10])
+        """
+        cls = self.__class__ if isinstance(self, OrderedSet) else OrderedSet
+        containers = map(list, it.chain([self], sets))
+        items = it.chain.from_iterable(containers)
+        return cls(items)
+
+    def __and__(self, other):
+        # the parent implementation of this is backwards
+        return self.intersection(other)
+
+    def intersection(self, *sets):
+        """
+        Returns elements in common between all sets. Order is defined only
+        by the first set.
+
+        Example:
+            >>> oset = OrderedSet.intersection(OrderedSet([0, 1, 2, 3]), [1, 2, 3])
+            >>> print(oset)
+            OrderedSet([1, 2, 3])
+            >>> oset.intersection([2, 4, 5], [1, 2, 3, 4])
+            OrderedSet([2])
+            >>> oset.intersection()
+            OrderedSet([1, 2, 3])
+        """
+        cls = self.__class__ if isinstance(self, OrderedSet) else OrderedSet
+        if sets:
+            common = set.intersection(*map(set, sets))
+            items = (item for item in self if item in common)
+        else:
+            items = self
+        return cls(items)
+
+    def difference(self, *sets):
+        """
+        Returns all elements that are in this set but not the others.
+
+        Example:
+            >>> OrderedSet([1, 2, 3]).difference(OrderedSet([2]))
+            OrderedSet([1, 3])
+            >>> OrderedSet([1, 2, 3]).difference(OrderedSet([2]), OrderedSet([3]))
+            OrderedSet([1])
+            >>> OrderedSet([1, 2, 3]) - OrderedSet([2])
+            OrderedSet([1, 3])
+            >>> OrderedSet([1, 2, 3]).difference()
+            OrderedSet([1, 2, 3])
+        """
+        cls = self.__class__
+        if sets:
+            other = set.union(*map(set, sets))
+            items = (item for item in self if item not in other)
+        else:
+            items = self
+        return cls(items)
+
+    def issubset(self, other):
+        """
+        Report whether another set contains this set.
+
+        Example:
+            >>> OrderedSet([1, 2, 3]).issubset({1, 2})
+            False
+            >>> OrderedSet([1, 2, 3]).issubset({1, 2, 3, 4})
+            True
+            >>> OrderedSet([1, 2, 3]).issubset({1, 4, 3, 5})
+            False
+        """
+        if len(self) > len(other):  # Fast check for obvious cases
+            return False
+        return all(item in other for item in self)
+
+    def issuperset(self, other):
+        """
+        Report whether this set contains another set.
+
+        Example:
+            >>> OrderedSet([1, 2]).issuperset([1, 2, 3])
+            False
+            >>> OrderedSet([1, 2, 3, 4]).issuperset({1, 2, 3})
+            True
+            >>> OrderedSet([1, 4, 3, 5]).issuperset({1, 2, 3})
+            False
+        """
+        if len(self) < len(other):  # Fast check for obvious cases
+            return False
+        return all(item in self for item in other)
+
+    def symmetric_difference(self, other):
+        """
+        Return the symmetric difference of two OrderedSets as a new set.
+        That is, the new set will contain all elements that are in exactly
+        one of the sets.
+
+        Their order will be preserved, with elements from `self` preceding
+        elements from `other`.
+
+        Example:
+            >>> this = OrderedSet([1, 4, 3, 5, 7])
+            >>> other = OrderedSet([9, 7, 1, 3, 2])
+            >>> this.symmetric_difference(other)
+            OrderedSet([4, 5, 9, 2])
+        """
+        cls = self.__class__ if isinstance(self, OrderedSet) else OrderedSet
+        diff1 = cls(self).difference(other)
+        diff2 = cls(other).difference(self)
+        return diff1.union(diff2)
+
+    def _update_items(self, items):
+        """
+        Replace the 'items' list of this OrderedSet with a new one, updating
+        self.map accordingly.
+        """
+        self.items = items
+        self.map = {item: idx for (idx, item) in enumerate(items)}
+
+    def difference_update(self, *sets):
+        """
+        Update this OrderedSet to remove items from one or more other sets.
+
+        Example:
+            >>> this = OrderedSet([1, 2, 3])
+            >>> this.difference_update(OrderedSet([2, 4]))
+            >>> print(this)
+            OrderedSet([1, 3])
+
+            >>> this = OrderedSet([1, 2, 3, 4, 5])
+            >>> this.difference_update(OrderedSet([2, 4]), OrderedSet([1, 4, 6]))
+            >>> print(this)
+            OrderedSet([3, 5])
+        """
+        items_to_remove = set()
+        for other in sets:
+            items_to_remove |= set(other)
+        self._update_items([item for item in self.items if item not in items_to_remove])
+
+    def intersection_update(self, other):
+        """
+        Update this OrderedSet to keep only items in another set, preserving
+        their order in this set.
+
+        Example:
+            >>> this = OrderedSet([1, 4, 3, 5, 7])
+            >>> other = OrderedSet([9, 7, 1, 3, 2])
+            >>> this.intersection_update(other)
+            >>> print(this)
+            OrderedSet([1, 3, 7])
+        """
+        other = set(other)
+        self._update_items([item for item in self.items if item in other])
+
+    def symmetric_difference_update(self, other):
+        """
+        Update this OrderedSet to remove items from another set, then
+        add items from the other set that were not present in this set.
+
+        Example:
+            >>> this = OrderedSet([1, 4, 3, 5, 7])
+            >>> other = OrderedSet([9, 7, 1, 3, 2])
+            >>> this.symmetric_difference_update(other)
+            >>> print(this)
+            OrderedSet([4, 5, 9, 2])
+        """
+        items_to_add = [item for item in other if item not in self]
+        items_to_remove = set(other)
+        self._update_items(
+            [item for item in self.items if item not in items_to_remove] + items_to_add
+        )
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__about__.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/__about__.py
new file mode 100644
index 000000000..4d998578d
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/__about__.py
@@ -0,0 +1,27 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
+
+__title__ = "packaging"
+__summary__ = "Core utilities for Python packages"
+__uri__ = "https://github.com/pypa/packaging"
+
+__version__ = "20.4"
+
+__author__ = "Donald Stufft and individual contributors"
+__email__ = "donald@stufft.io"
+
+__license__ = "BSD-2-Clause or Apache-2.0"
+__copyright__ = "Copyright 2014-2019 %s" % __author__
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__init__.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/__init__.py
new file mode 100644
index 000000000..a0cf67df5
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/__init__.py
@@ -0,0 +1,26 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+from .__about__ import (
+    __author__,
+    __copyright__,
+    __email__,
+    __license__,
+    __summary__,
+    __title__,
+    __uri__,
+    __version__,
+)
+
+__all__ = [
+    "__title__",
+    "__summary__",
+    "__uri__",
+    "__version__",
+    "__author__",
+    "__email__",
+    "__license__",
+    "__copyright__",
+]
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__about__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__about__.cpython-36.pyc
new file mode 100644
index 000000000..7cbda8c9b
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__about__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..b5f2d2f46
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_compat.cpython-36.pyc
new file mode 100644
index 000000000..332b612d1
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_structures.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_structures.cpython-36.pyc
new file mode 100644
index 000000000..7e75a7df0
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_structures.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_typing.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_typing.cpython-36.pyc
new file mode 100644
index 000000000..e1ef5f4f3
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/_typing.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/markers.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/markers.cpython-36.pyc
new file mode 100644
index 000000000..89b92733e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/markers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/requirements.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/requirements.cpython-36.pyc
new file mode 100644
index 000000000..cda50a09a
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/requirements.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc
new file mode 100644
index 000000000..05f0ee405
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/specifiers.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/tags.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/tags.cpython-36.pyc
new file mode 100644
index 000000000..e625665b8
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/tags.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/utils.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/utils.cpython-36.pyc
new file mode 100644
index 000000000..2e703b915
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/utils.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/version.cpython-36.pyc b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/version.cpython-36.pyc
new file mode 100644
index 000000000..ee81ef982
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/_vendor/packaging/__pycache__/version.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/_compat.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/_compat.py
new file mode 100644
index 000000000..e54bd4ede
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/_compat.py
@@ -0,0 +1,38 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import sys
+
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Dict, Tuple, Type
+
+
+PY2 = sys.version_info[0] == 2
+PY3 = sys.version_info[0] == 3
+
+# flake8: noqa
+
+if PY3:
+    string_types = (str,)
+else:
+    string_types = (basestring,)
+
+
+def with_metaclass(meta, *bases):
+    # type: (Type[Any], Tuple[Type[Any], ...]) -> Any
+    """
+    Create a base class with a metaclass.
+    """
+    # This requires a bit of explanation: the basic idea is to make a dummy
+    # metaclass for one level of class instantiation that replaces itself with
+    # the actual metaclass.
+    class metaclass(meta):  # type: ignore
+        def __new__(cls, name, this_bases, d):
+            # type: (Type[Any], str, Tuple[Any], Dict[Any, Any]) -> Any
+            return meta(name, bases, d)
+
+    return type.__new__(metaclass, "temporary_class", (), {})
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/_structures.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/_structures.py
new file mode 100644
index 000000000..800d5c558
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/_structures.py
@@ -0,0 +1,86 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+
+class InfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __neg__(self):
+        # type: (object) -> NegativeInfinityType
+        return NegativeInfinity
+
+
+Infinity = InfinityType()
+
+
+class NegativeInfinityType(object):
+    def __repr__(self):
+        # type: () -> str
+        return "-Infinity"
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(repr(self))
+
+    def __lt__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __le__(self, other):
+        # type: (object) -> bool
+        return True
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return isinstance(other, self.__class__)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return not isinstance(other, self.__class__)
+
+    def __gt__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __ge__(self, other):
+        # type: (object) -> bool
+        return False
+
+    def __neg__(self):
+        # type: (object) -> InfinityType
+        return Infinity
+
+
+NegativeInfinity = NegativeInfinityType()
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/_typing.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/_typing.py
new file mode 100644
index 000000000..77a8b9185
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/_typing.py
@@ -0,0 +1,48 @@
+"""For neatly implementing static typing in packaging.
+
+`mypy` - the static type analysis tool we use - uses the `typing` module, which
+provides core functionality fundamental to mypy's functioning.
+
+Generally, `typing` would be imported at runtime and used in that fashion -
+it acts as a no-op at runtime and does not have any run-time overhead by
+design.
+
+As it turns out, `typing` is not vendorable - it uses separate sources for
+Python 2/Python 3. Thus, this codebase can not expect it to be present.
+To work around this, mypy allows the typing import to be behind a False-y
+optional to prevent it from running at runtime and type-comments can be used
+to remove the need for the types to be accessible directly during runtime.
+
+This module provides the False-y guard in a nicely named fashion so that a
+curious maintainer can reach here to read this.
+
+In packaging, all static-typing related imports should be guarded as follows:
+
+    from packaging._typing import TYPE_CHECKING
+
+    if TYPE_CHECKING:
+        from typing import ...
+
+Ref: https://github.com/python/mypy/issues/3216
+"""
+
+__all__ = ["TYPE_CHECKING", "cast"]
+
+# The TYPE_CHECKING constant defined by the typing module is False at runtime
+# but True while type checking.
+if False:  # pragma: no cover
+    from typing import TYPE_CHECKING
+else:
+    TYPE_CHECKING = False
+
+# typing's cast syntax requires calling typing.cast at runtime, but we don't
+# want to import typing at runtime. Here, we inform the type checkers that
+# we're importing `typing.cast` as `cast` and re-implement typing.cast's
+# runtime behavior in a block that is ignored by type checkers.
+if TYPE_CHECKING:  # pragma: no cover
+    # not executed at runtime
+    from typing import cast
+else:
+    # executed at runtime
+    def cast(type_, value):  # noqa
+        return value
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/markers.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/markers.py
new file mode 100644
index 000000000..03fbdfcc9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/markers.py
@@ -0,0 +1,328 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import operator
+import os
+import platform
+import sys
+
+from setuptools.extern.pyparsing import ParseException, ParseResults, stringStart, stringEnd
+from setuptools.extern.pyparsing import ZeroOrMore, Group, Forward, QuotedString
+from setuptools.extern.pyparsing import Literal as L  # noqa
+
+from ._compat import string_types
+from ._typing import TYPE_CHECKING
+from .specifiers import Specifier, InvalidSpecifier
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Any, Callable, Dict, List, Optional, Tuple, Union
+
+    Operator = Callable[[str, str], bool]
+
+
+__all__ = [
+    "InvalidMarker",
+    "UndefinedComparison",
+    "UndefinedEnvironmentName",
+    "Marker",
+    "default_environment",
+]
+
+
+class InvalidMarker(ValueError):
+    """
+    An invalid marker was found, users should refer to PEP 508.
+    """
+
+
+class UndefinedComparison(ValueError):
+    """
+    An invalid operation was attempted on a value that doesn't support it.
+    """
+
+
+class UndefinedEnvironmentName(ValueError):
+    """
+    A name was attempted to be used that does not exist inside of the
+    environment.
+    """
+
+
+class Node(object):
+    def __init__(self, value):
+        # type: (Any) -> None
+        self.value = value
+
+    def __str__(self):
+        # type: () -> str
+        return str(self.value)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{0}({1!r})>".format(self.__class__.__name__, str(self))
+
+    def serialize(self):
+        # type: () -> str
+        raise NotImplementedError
+
+
+class Variable(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+class Value(Node):
+    def serialize(self):
+        # type: () -> str
+        return '"{0}"'.format(self)
+
+
+class Op(Node):
+    def serialize(self):
+        # type: () -> str
+        return str(self)
+
+
+VARIABLE = (
+    L("implementation_version")
+    | L("platform_python_implementation")
+    | L("implementation_name")
+    | L("python_full_version")
+    | L("platform_release")
+    | L("platform_version")
+    | L("platform_machine")
+    | L("platform_system")
+    | L("python_version")
+    | L("sys_platform")
+    | L("os_name")
+    | L("os.name")  # PEP-345
+    | L("sys.platform")  # PEP-345
+    | L("platform.version")  # PEP-345
+    | L("platform.machine")  # PEP-345
+    | L("platform.python_implementation")  # PEP-345
+    | L("python_implementation")  # undocumented setuptools legacy
+    | L("extra")  # PEP-508
+)
+ALIASES = {
+    "os.name": "os_name",
+    "sys.platform": "sys_platform",
+    "platform.version": "platform_version",
+    "platform.machine": "platform_machine",
+    "platform.python_implementation": "platform_python_implementation",
+    "python_implementation": "platform_python_implementation",
+}
+VARIABLE.setParseAction(lambda s, l, t: Variable(ALIASES.get(t[0], t[0])))
+
+VERSION_CMP = (
+    L("===") | L("==") | L(">=") | L("<=") | L("!=") | L("~=") | L(">") | L("<")
+)
+
+MARKER_OP = VERSION_CMP | L("not in") | L("in")
+MARKER_OP.setParseAction(lambda s, l, t: Op(t[0]))
+
+MARKER_VALUE = QuotedString("'") | QuotedString('"')
+MARKER_VALUE.setParseAction(lambda s, l, t: Value(t[0]))
+
+BOOLOP = L("and") | L("or")
+
+MARKER_VAR = VARIABLE | MARKER_VALUE
+
+MARKER_ITEM = Group(MARKER_VAR + MARKER_OP + MARKER_VAR)
+MARKER_ITEM.setParseAction(lambda s, l, t: tuple(t[0]))
+
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+
+MARKER_EXPR = Forward()
+MARKER_ATOM = MARKER_ITEM | Group(LPAREN + MARKER_EXPR + RPAREN)
+MARKER_EXPR << MARKER_ATOM + ZeroOrMore(BOOLOP + MARKER_EXPR)
+
+MARKER = stringStart + MARKER_EXPR + stringEnd
+
+
+def _coerce_parse_result(results):
+    # type: (Union[ParseResults, List[Any]]) -> List[Any]
+    if isinstance(results, ParseResults):
+        return [_coerce_parse_result(i) for i in results]
+    else:
+        return results
+
+
+def _format_marker(marker, first=True):
+    # type: (Union[List[str], Tuple[Node, ...], str], Optional[bool]) -> str
+
+    assert isinstance(marker, (list, tuple, string_types))
+
+    # Sometimes we have a structure like [[...]] which is a single item list
+    # where the single item is itself it's own list. In that case we want skip
+    # the rest of this function so that we don't get extraneous () on the
+    # outside.
+    if (
+        isinstance(marker, list)
+        and len(marker) == 1
+        and isinstance(marker[0], (list, tuple))
+    ):
+        return _format_marker(marker[0])
+
+    if isinstance(marker, list):
+        inner = (_format_marker(m, first=False) for m in marker)
+        if first:
+            return " ".join(inner)
+        else:
+            return "(" + " ".join(inner) + ")"
+    elif isinstance(marker, tuple):
+        return " ".join([m.serialize() for m in marker])
+    else:
+        return marker
+
+
+_operators = {
+    "in": lambda lhs, rhs: lhs in rhs,
+    "not in": lambda lhs, rhs: lhs not in rhs,
+    "<": operator.lt,
+    "<=": operator.le,
+    "==": operator.eq,
+    "!=": operator.ne,
+    ">=": operator.ge,
+    ">": operator.gt,
+}  # type: Dict[str, Operator]
+
+
+def _eval_op(lhs, op, rhs):
+    # type: (str, Op, str) -> bool
+    try:
+        spec = Specifier("".join([op.serialize(), rhs]))
+    except InvalidSpecifier:
+        pass
+    else:
+        return spec.contains(lhs)
+
+    oper = _operators.get(op.serialize())  # type: Optional[Operator]
+    if oper is None:
+        raise UndefinedComparison(
+            "Undefined {0!r} on {1!r} and {2!r}.".format(op, lhs, rhs)
+        )
+
+    return oper(lhs, rhs)
+
+
+class Undefined(object):
+    pass
+
+
+_undefined = Undefined()
+
+
+def _get_env(environment, name):
+    # type: (Dict[str, str], str) -> str
+    value = environment.get(name, _undefined)  # type: Union[str, Undefined]
+
+    if isinstance(value, Undefined):
+        raise UndefinedEnvironmentName(
+            "{0!r} does not exist in evaluation environment.".format(name)
+        )
+
+    return value
+
+
+def _evaluate_markers(markers, environment):
+    # type: (List[Any], Dict[str, str]) -> bool
+    groups = [[]]  # type: List[List[bool]]
+
+    for marker in markers:
+        assert isinstance(marker, (list, tuple, string_types))
+
+        if isinstance(marker, list):
+            groups[-1].append(_evaluate_markers(marker, environment))
+        elif isinstance(marker, tuple):
+            lhs, op, rhs = marker
+
+            if isinstance(lhs, Variable):
+                lhs_value = _get_env(environment, lhs.value)
+                rhs_value = rhs.value
+            else:
+                lhs_value = lhs.value
+                rhs_value = _get_env(environment, rhs.value)
+
+            groups[-1].append(_eval_op(lhs_value, op, rhs_value))
+        else:
+            assert marker in ["and", "or"]
+            if marker == "or":
+                groups.append([])
+
+    return any(all(item) for item in groups)
+
+
+def format_full_version(info):
+    # type: (sys._version_info) -> str
+    version = "{0.major}.{0.minor}.{0.micro}".format(info)
+    kind = info.releaselevel
+    if kind != "final":
+        version += kind[0] + str(info.serial)
+    return version
+
+
+def default_environment():
+    # type: () -> Dict[str, str]
+    if hasattr(sys, "implementation"):
+        # Ignoring the `sys.implementation` reference for type checking due to
+        # mypy not liking that the attribute doesn't exist in Python 2.7 when
+        # run with the `--py27` flag.
+        iver = format_full_version(sys.implementation.version)  # type: ignore
+        implementation_name = sys.implementation.name  # type: ignore
+    else:
+        iver = "0"
+        implementation_name = ""
+
+    return {
+        "implementation_name": implementation_name,
+        "implementation_version": iver,
+        "os_name": os.name,
+        "platform_machine": platform.machine(),
+        "platform_release": platform.release(),
+        "platform_system": platform.system(),
+        "platform_version": platform.version(),
+        "python_full_version": platform.python_version(),
+        "platform_python_implementation": platform.python_implementation(),
+        "python_version": ".".join(platform.python_version_tuple()[:2]),
+        "sys_platform": sys.platform,
+    }
+
+
+class Marker(object):
+    def __init__(self, marker):
+        # type: (str) -> None
+        try:
+            self._markers = _coerce_parse_result(MARKER.parseString(marker))
+        except ParseException as e:
+            err_str = "Invalid marker: {0!r}, parse error at {1!r}".format(
+                marker, marker[e.loc : e.loc + 8]
+            )
+            raise InvalidMarker(err_str)
+
+    def __str__(self):
+        # type: () -> str
+        return _format_marker(self._markers)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Marker({0!r})>".format(str(self))
+
+    def evaluate(self, environment=None):
+        # type: (Optional[Dict[str, str]]) -> bool
+        """Evaluate a marker.
+
+        Return the boolean from evaluating the given marker against the
+        environment. environment is an optional argument to override all or
+        part of the determined environment.
+
+        The environment is determined from the current Python process.
+        """
+        current_environment = default_environment()
+        if environment is not None:
+            current_environment.update(environment)
+
+        return _evaluate_markers(self._markers, current_environment)
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/requirements.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/requirements.py
new file mode 100644
index 000000000..5d50c7d7e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/requirements.py
@@ -0,0 +1,145 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import string
+import re
+
+from setuptools.extern.pyparsing import stringStart, stringEnd, originalTextFor, ParseException
+from setuptools.extern.pyparsing import ZeroOrMore, Word, Optional, Regex, Combine
+from setuptools.extern.pyparsing import Literal as L  # noqa
+from urllib import parse as urlparse
+
+from ._typing import TYPE_CHECKING
+from .markers import MARKER_EXPR, Marker
+from .specifiers import LegacySpecifier, Specifier, SpecifierSet
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import List
+
+
+class InvalidRequirement(ValueError):
+    """
+    An invalid requirement was found, users should refer to PEP 508.
+    """
+
+
+ALPHANUM = Word(string.ascii_letters + string.digits)
+
+LBRACKET = L("[").suppress()
+RBRACKET = L("]").suppress()
+LPAREN = L("(").suppress()
+RPAREN = L(")").suppress()
+COMMA = L(",").suppress()
+SEMICOLON = L(";").suppress()
+AT = L("@").suppress()
+
+PUNCTUATION = Word("-_.")
+IDENTIFIER_END = ALPHANUM | (ZeroOrMore(PUNCTUATION) + ALPHANUM)
+IDENTIFIER = Combine(ALPHANUM + ZeroOrMore(IDENTIFIER_END))
+
+NAME = IDENTIFIER("name")
+EXTRA = IDENTIFIER
+
+URI = Regex(r"[^ ]+")("url")
+URL = AT + URI
+
+EXTRAS_LIST = EXTRA + ZeroOrMore(COMMA + EXTRA)
+EXTRAS = (LBRACKET + Optional(EXTRAS_LIST) + RBRACKET)("extras")
+
+VERSION_PEP440 = Regex(Specifier._regex_str, re.VERBOSE | re.IGNORECASE)
+VERSION_LEGACY = Regex(LegacySpecifier._regex_str, re.VERBOSE | re.IGNORECASE)
+
+VERSION_ONE = VERSION_PEP440 ^ VERSION_LEGACY
+VERSION_MANY = Combine(
+    VERSION_ONE + ZeroOrMore(COMMA + VERSION_ONE), joinString=",", adjacent=False
+)("_raw_spec")
+_VERSION_SPEC = Optional(((LPAREN + VERSION_MANY + RPAREN) | VERSION_MANY))
+_VERSION_SPEC.setParseAction(lambda s, l, t: t._raw_spec or "")
+
+VERSION_SPEC = originalTextFor(_VERSION_SPEC)("specifier")
+VERSION_SPEC.setParseAction(lambda s, l, t: t[1])
+
+MARKER_EXPR = originalTextFor(MARKER_EXPR())("marker")
+MARKER_EXPR.setParseAction(
+    lambda s, l, t: Marker(s[t._original_start : t._original_end])
+)
+MARKER_SEPARATOR = SEMICOLON
+MARKER = MARKER_SEPARATOR + MARKER_EXPR
+
+VERSION_AND_MARKER = VERSION_SPEC + Optional(MARKER)
+URL_AND_MARKER = URL + Optional(MARKER)
+
+NAMED_REQUIREMENT = NAME + Optional(EXTRAS) + (URL_AND_MARKER | VERSION_AND_MARKER)
+
+REQUIREMENT = stringStart + NAMED_REQUIREMENT + stringEnd
+# setuptools.extern.pyparsing isn't thread safe during initialization, so we do it eagerly, see
+# issue #104
+REQUIREMENT.parseString("x[]")
+
+
+class Requirement(object):
+    """Parse a requirement.
+
+    Parse a given requirement string into its parts, such as name, specifier,
+    URL, and extras. Raises InvalidRequirement on a badly-formed requirement
+    string.
+    """
+
+    # TODO: Can we test whether something is contained within a requirement?
+    #       If so how do we do that? Do we need to test against the _name_ of
+    #       the thing as well as the version? What about the markers?
+    # TODO: Can we normalize the name and extra name?
+
+    def __init__(self, requirement_string):
+        # type: (str) -> None
+        try:
+            req = REQUIREMENT.parseString(requirement_string)
+        except ParseException as e:
+            raise InvalidRequirement(
+                'Parse error at "{0!r}": {1}'.format(
+                    requirement_string[e.loc : e.loc + 8], e.msg
+                )
+            )
+
+        self.name = req.name
+        if req.url:
+            parsed_url = urlparse.urlparse(req.url)
+            if parsed_url.scheme == "file":
+                if urlparse.urlunparse(parsed_url) != req.url:
+                    raise InvalidRequirement("Invalid URL given")
+            elif not (parsed_url.scheme and parsed_url.netloc) or (
+                not parsed_url.scheme and not parsed_url.netloc
+            ):
+                raise InvalidRequirement("Invalid URL: {0}".format(req.url))
+            self.url = req.url
+        else:
+            self.url = None
+        self.extras = set(req.extras.asList() if req.extras else [])
+        self.specifier = SpecifierSet(req.specifier)
+        self.marker = req.marker if req.marker else None
+
+    def __str__(self):
+        # type: () -> str
+        parts = [self.name]  # type: List[str]
+
+        if self.extras:
+            parts.append("[{0}]".format(",".join(sorted(self.extras))))
+
+        if self.specifier:
+            parts.append(str(self.specifier))
+
+        if self.url:
+            parts.append("@ {0}".format(self.url))
+            if self.marker:
+                parts.append(" ")
+
+        if self.marker:
+            parts.append("; {0}".format(self.marker))
+
+        return "".join(parts)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Requirement({0!r})>".format(str(self))
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/specifiers.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/specifiers.py
new file mode 100644
index 000000000..fe09bb1db
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/specifiers.py
@@ -0,0 +1,863 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import abc
+import functools
+import itertools
+import re
+
+from ._compat import string_types, with_metaclass
+from ._typing import TYPE_CHECKING
+from .utils import canonicalize_version
+from .version import Version, LegacyVersion, parse
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        List,
+        Dict,
+        Union,
+        Iterable,
+        Iterator,
+        Optional,
+        Callable,
+        Tuple,
+        FrozenSet,
+    )
+
+    ParsedVersion = Union[Version, LegacyVersion]
+    UnparsedVersion = Union[Version, LegacyVersion, str]
+    CallableOperator = Callable[[ParsedVersion, str], bool]
+
+
+class InvalidSpecifier(ValueError):
+    """
+    An invalid specifier was found, users should refer to PEP 440.
+    """
+
+
+class BaseSpecifier(with_metaclass(abc.ABCMeta, object)):  # type: ignore
+    @abc.abstractmethod
+    def __str__(self):
+        # type: () -> str
+        """
+        Returns the str representation of this Specifier like object. This
+        should be representative of the Specifier itself.
+        """
+
+    @abc.abstractmethod
+    def __hash__(self):
+        # type: () -> int
+        """
+        Returns a hash value for this Specifier like object.
+        """
+
+    @abc.abstractmethod
+    def __eq__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are equal.
+        """
+
+    @abc.abstractmethod
+    def __ne__(self, other):
+        # type: (object) -> bool
+        """
+        Returns a boolean representing whether or not the two Specifier like
+        objects are not equal.
+        """
+
+    @abc.abstractproperty
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        """
+        Returns whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        """
+        Sets whether or not pre-releases as a whole are allowed by this
+        specifier.
+        """
+
+    @abc.abstractmethod
+    def contains(self, item, prereleases=None):
+        # type: (str, Optional[bool]) -> bool
+        """
+        Determines if the given item is contained within this specifier.
+        """
+
+    @abc.abstractmethod
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+        """
+        Takes an iterable of items and filters them so that only items which
+        are contained within this specifier are allowed in it.
+        """
+
+
+class _IndividualSpecifier(BaseSpecifier):
+
+    _operators = {}  # type: Dict[str, str]
+
+    def __init__(self, spec="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+        match = self._regex.search(spec)
+        if not match:
+            raise InvalidSpecifier("Invalid specifier: '{0}'".format(spec))
+
+        self._spec = (
+            match.group("operator").strip(),
+            match.group("version").strip(),
+        )  # type: Tuple[str, str]
+
+        # Store whether or not this Specifier should accept prereleases
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<{0}({1!r}{2})>".format(self.__class__.__name__, str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return "{0}{1}".format(*self._spec)
+
+    @property
+    def _canonical_spec(self):
+        # type: () -> Tuple[str, Union[Version, str]]
+        return self._spec[0], canonicalize_version(self._spec[1])
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._canonical_spec)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._canonical_spec == other._canonical_spec
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, string_types):
+            try:
+                other = self.__class__(str(other))
+            except InvalidSpecifier:
+                return NotImplemented
+        elif not isinstance(other, self.__class__):
+            return NotImplemented
+
+        return self._spec != other._spec
+
+    def _get_operator(self, op):
+        # type: (str) -> CallableOperator
+        operator_callable = getattr(
+            self, "_compare_{0}".format(self._operators[op])
+        )  # type: CallableOperator
+        return operator_callable
+
+    def _coerce_version(self, version):
+        # type: (UnparsedVersion) -> ParsedVersion
+        if not isinstance(version, (LegacyVersion, Version)):
+            version = parse(version)
+        return version
+
+    @property
+    def operator(self):
+        # type: () -> str
+        return self._spec[0]
+
+    @property
+    def version(self):
+        # type: () -> str
+        return self._spec[1]
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+        return self._prereleases
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (str) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (UnparsedVersion, Optional[bool]) -> bool
+
+        # Determine if prereleases are to be allowed or not.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # Normalize item to a Version or LegacyVersion, this allows us to have
+        # a shortcut for ``"2.0" in Specifier(">=2")
+        normalized_item = self._coerce_version(item)
+
+        # Determine if we should be supporting prereleases in this specifier
+        # or not, if we do not support prereleases than we can short circuit
+        # logic if this version is a prereleases.
+        if normalized_item.is_prerelease and not prereleases:
+            return False
+
+        # Actually do the comparison to determine if this item is contained
+        # within this Specifier or not.
+        operator_callable = self._get_operator(self.operator)  # type: CallableOperator
+        return operator_callable(normalized_item, self.version)
+
+    def filter(self, iterable, prereleases=None):
+        # type: (Iterable[UnparsedVersion], Optional[bool]) -> Iterable[UnparsedVersion]
+
+        yielded = False
+        found_prereleases = []
+
+        kw = {"prereleases": prereleases if prereleases is not None else True}
+
+        # Attempt to iterate over all the values in the iterable and if any of
+        # them match, yield them.
+        for version in iterable:
+            parsed_version = self._coerce_version(version)
+
+            if self.contains(parsed_version, **kw):
+                # If our version is a prerelease, and we were not set to allow
+                # prereleases, then we'll store it for later incase nothing
+                # else matches this specifier.
+                if parsed_version.is_prerelease and not (
+                    prereleases or self.prereleases
+                ):
+                    found_prereleases.append(version)
+                # Either this is not a prerelease, or we should have been
+                # accepting prereleases from the beginning.
+                else:
+                    yielded = True
+                    yield version
+
+        # Now that we've iterated over everything, determine if we've yielded
+        # any values, and if we have not and we have any prereleases stored up
+        # then we will go ahead and yield the prereleases.
+        if not yielded and found_prereleases:
+            for version in found_prereleases:
+                yield version
+
+
+class LegacySpecifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(==|!=|<=|>=|<|>))
+        \s*
+        (?P<version>
+            [^,;\s)]* # Since this is a "legacy" specifier, and the version
+                      # string can be just about anything, we match everything
+                      # except for whitespace, a semi-colon for marker support,
+                      # a closing paren since versions can be enclosed in
+                      # them, and a comma since it's a version separator.
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+    }
+
+    def _coerce_version(self, version):
+        # type: (Union[ParsedVersion, str]) -> LegacyVersion
+        if not isinstance(version, LegacyVersion):
+            version = LegacyVersion(str(version))
+        return version
+
+    def _compare_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective == self._coerce_version(spec)
+
+    def _compare_not_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective != self._coerce_version(spec)
+
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective <= self._coerce_version(spec)
+
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective >= self._coerce_version(spec)
+
+    def _compare_less_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective < self._coerce_version(spec)
+
+    def _compare_greater_than(self, prospective, spec):
+        # type: (LegacyVersion, str) -> bool
+        return prospective > self._coerce_version(spec)
+
+
+def _require_version_compare(
+    fn  # type: (Callable[[Specifier, ParsedVersion, str], bool])
+):
+    # type: (...) -> Callable[[Specifier, ParsedVersion, str], bool]
+    @functools.wraps(fn)
+    def wrapped(self, prospective, spec):
+        # type: (Specifier, ParsedVersion, str) -> bool
+        if not isinstance(prospective, Version):
+            return False
+        return fn(self, prospective, spec)
+
+    return wrapped
+
+
+class Specifier(_IndividualSpecifier):
+
+    _regex_str = r"""
+        (?P<operator>(~=|==|!=|<=|>=|<|>|===))
+        (?P<version>
+            (?:
+                # The identity operators allow for an escape hatch that will
+                # do an exact string match of the version you wish to install.
+                # This will not be parsed by PEP 440 and we cannot determine
+                # any semantic meaning from it. This operator is discouraged
+                # but included entirely as an escape hatch.
+                (?<====)  # Only match for the identity operator
+                \s*
+                [^\s]*    # We just match everything, except for whitespace
+                          # since we are only testing for strict identity.
+            )
+            |
+            (?:
+                # The (non)equality operators allow for wild card and local
+                # versions to be specified so we have to define these two
+                # operators separately to enable that.
+                (?<===|!=)            # Only match for equals and not equals
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+
+                # You cannot use a wild card and a dev or local version
+                # together so group them with a | and make them optional.
+                (?:
+                    (?:[-_\.]?dev[-_\.]?[0-9]*)?         # dev release
+                    (?:\+[a-z0-9]+(?:[-_\.][a-z0-9]+)*)? # local
+                    |
+                    \.\*  # Wild card syntax of .*
+                )?
+            )
+            |
+            (?:
+                # The compatible operator requires at least two digits in the
+                # release segment.
+                (?<=~=)               # Only match for the compatible operator
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)+   # release  (We have a + instead of a *)
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+            |
+            (?:
+                # All other operators only allow a sub set of what the
+                # (non)equality operators do. Specifically they do not allow
+                # local versions to be specified nor do they allow the prefix
+                # matching wild cards.
+                (?<!==|!=|~=)         # We have special cases for these
+                                      # operators so we want to make sure they
+                                      # don't match here.
+
+                \s*
+                v?
+                (?:[0-9]+!)?          # epoch
+                [0-9]+(?:\.[0-9]+)*   # release
+                (?:                   # pre release
+                    [-_\.]?
+                    (a|b|c|rc|alpha|beta|pre|preview)
+                    [-_\.]?
+                    [0-9]*
+                )?
+                (?:                                   # post release
+                    (?:-[0-9]+)|(?:[-_\.]?(post|rev|r)[-_\.]?[0-9]*)
+                )?
+                (?:[-_\.]?dev[-_\.]?[0-9]*)?          # dev release
+            )
+        )
+        """
+
+    _regex = re.compile(r"^\s*" + _regex_str + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    _operators = {
+        "~=": "compatible",
+        "==": "equal",
+        "!=": "not_equal",
+        "<=": "less_than_equal",
+        ">=": "greater_than_equal",
+        "<": "less_than",
+        ">": "greater_than",
+        "===": "arbitrary",
+    }
+
+    @_require_version_compare
+    def _compare_compatible(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # Compatible releases have an equivalent combination of >= and ==. That
+        # is that ~=2.2 is equivalent to >=2.2,==2.*. This allows us to
+        # implement this in terms of the other specifiers instead of
+        # implementing it ourselves. The only thing we need to do is construct
+        # the other specifiers.
+
+        # We want everything but the last item in the version, but we want to
+        # ignore post and dev releases and we want to treat the pre-release as
+        # it's own separate segment.
+        prefix = ".".join(
+            list(
+                itertools.takewhile(
+                    lambda x: (not x.startswith("post") and not x.startswith("dev")),
+                    _version_split(spec),
+                )
+            )[:-1]
+        )
+
+        # Add the prefix notation to the end of our string
+        prefix += ".*"
+
+        return self._get_operator(">=")(prospective, spec) and self._get_operator("==")(
+            prospective, prefix
+        )
+
+    @_require_version_compare
+    def _compare_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # We need special logic to handle prefix matching
+        if spec.endswith(".*"):
+            # In the case of prefix matching we want to ignore local segment.
+            prospective = Version(prospective.public)
+            # Split the spec out by dots, and pretend that there is an implicit
+            # dot in between a release segment and a pre-release segment.
+            split_spec = _version_split(spec[:-2])  # Remove the trailing .*
+
+            # Split the prospective version out by dots, and pretend that there
+            # is an implicit dot in between a release segment and a pre-release
+            # segment.
+            split_prospective = _version_split(str(prospective))
+
+            # Shorten the prospective version to be the same length as the spec
+            # so that we can determine if the specifier is a prefix of the
+            # prospective version or not.
+            shortened_prospective = split_prospective[: len(split_spec)]
+
+            # Pad out our two sides with zeros so that they both equal the same
+            # length.
+            padded_spec, padded_prospective = _pad_version(
+                split_spec, shortened_prospective
+            )
+
+            return padded_prospective == padded_spec
+        else:
+            # Convert our spec string into a Version
+            spec_version = Version(spec)
+
+            # If the specifier does not have a local segment, then we want to
+            # act as if the prospective version also does not have a local
+            # segment.
+            if not spec_version.local:
+                prospective = Version(prospective.public)
+
+            return prospective == spec_version
+
+    @_require_version_compare
+    def _compare_not_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+        return not self._compare_equal(prospective, spec)
+
+    @_require_version_compare
+    def _compare_less_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) <= Version(spec)
+
+    @_require_version_compare
+    def _compare_greater_than_equal(self, prospective, spec):
+        # type: (ParsedVersion, str) -> bool
+
+        # NB: Local version identifiers are NOT permitted in the version
+        # specifier, so local version labels can be universally removed from
+        # the prospective version.
+        return Version(prospective.public) >= Version(spec)
+
+    @_require_version_compare
+    def _compare_less_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is less than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective < spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a pre-release version, that we do not accept pre-release
+        # versions for the version mentioned in the specifier (e.g. <3.1 should
+        # not match 3.1.dev0, but should match 3.0.dev0).
+        if not spec.is_prerelease and prospective.is_prerelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # less than the spec version *and* it's not a pre-release of the same
+        # version in the spec.
+        return True
+
+    @_require_version_compare
+    def _compare_greater_than(self, prospective, spec_str):
+        # type: (ParsedVersion, str) -> bool
+
+        # Convert our spec to a Version instance, since we'll want to work with
+        # it as a version.
+        spec = Version(spec_str)
+
+        # Check to see if the prospective version is greater than the spec
+        # version. If it's not we can short circuit and just return False now
+        # instead of doing extra unneeded work.
+        if not prospective > spec:
+            return False
+
+        # This special case is here so that, unless the specifier itself
+        # includes is a post-release version, that we do not accept
+        # post-release versions for the version mentioned in the specifier
+        # (e.g. >3.1 should not match 3.0.post0, but should match 3.2.post0).
+        if not spec.is_postrelease and prospective.is_postrelease:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # Ensure that we do not allow a local version of the version mentioned
+        # in the specifier, which is technically greater than, to match.
+        if prospective.local is not None:
+            if Version(prospective.base_version) == Version(spec.base_version):
+                return False
+
+        # If we've gotten to here, it means that prospective version is both
+        # greater than the spec version *and* it's not a pre-release of the
+        # same version in the spec.
+        return True
+
+    def _compare_arbitrary(self, prospective, spec):
+        # type: (Version, str) -> bool
+        return str(prospective).lower() == str(spec).lower()
+
+    @property
+    def prereleases(self):
+        # type: () -> bool
+
+        # If there is an explicit prereleases set for this, then we'll just
+        # blindly use that.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # Look at all of our specifiers and determine if they are inclusive
+        # operators, and if they are if they are including an explicit
+        # prerelease.
+        operator, version = self._spec
+        if operator in ["==", ">=", "<=", "~=", "==="]:
+            # The == specifier can include a trailing .*, if it does we
+            # want to remove before parsing.
+            if operator == "==" and version.endswith(".*"):
+                version = version[:-2]
+
+            # Parse the version, and if it is a pre-release than this
+            # specifier allows pre-releases.
+            if parse(version).is_prerelease:
+                return True
+
+        return False
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+
+_prefix_regex = re.compile(r"^([0-9]+)((?:a|b|c|rc)[0-9]+)$")
+
+
+def _version_split(version):
+    # type: (str) -> List[str]
+    result = []  # type: List[str]
+    for item in version.split("."):
+        match = _prefix_regex.search(item)
+        if match:
+            result.extend(match.groups())
+        else:
+            result.append(item)
+    return result
+
+
+def _pad_version(left, right):
+    # type: (List[str], List[str]) -> Tuple[List[str], List[str]]
+    left_split, right_split = [], []
+
+    # Get the release segment of our versions
+    left_split.append(list(itertools.takewhile(lambda x: x.isdigit(), left)))
+    right_split.append(list(itertools.takewhile(lambda x: x.isdigit(), right)))
+
+    # Get the rest of our versions
+    left_split.append(left[len(left_split[0]) :])
+    right_split.append(right[len(right_split[0]) :])
+
+    # Insert our padding
+    left_split.insert(1, ["0"] * max(0, len(right_split[0]) - len(left_split[0])))
+    right_split.insert(1, ["0"] * max(0, len(left_split[0]) - len(right_split[0])))
+
+    return (list(itertools.chain(*left_split)), list(itertools.chain(*right_split)))
+
+
+class SpecifierSet(BaseSpecifier):
+    def __init__(self, specifiers="", prereleases=None):
+        # type: (str, Optional[bool]) -> None
+
+        # Split on , to break each individual specifier into it's own item, and
+        # strip each item to remove leading/trailing whitespace.
+        split_specifiers = [s.strip() for s in specifiers.split(",") if s.strip()]
+
+        # Parsed each individual specifier, attempting first to make it a
+        # Specifier and falling back to a LegacySpecifier.
+        parsed = set()
+        for specifier in split_specifiers:
+            try:
+                parsed.add(Specifier(specifier))
+            except InvalidSpecifier:
+                parsed.add(LegacySpecifier(specifier))
+
+        # Turn our parsed specifiers into a frozen set and save them for later.
+        self._specs = frozenset(parsed)
+
+        # Store our prereleases value so we can use it later to determine if
+        # we accept prereleases or not.
+        self._prereleases = prereleases
+
+    def __repr__(self):
+        # type: () -> str
+        pre = (
+            ", prereleases={0!r}".format(self.prereleases)
+            if self._prereleases is not None
+            else ""
+        )
+
+        return "<SpecifierSet({0!r}{1})>".format(str(self), pre)
+
+    def __str__(self):
+        # type: () -> str
+        return ",".join(sorted(str(s) for s in self._specs))
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._specs)
+
+    def __and__(self, other):
+        # type: (Union[SpecifierSet, str]) -> SpecifierSet
+        if isinstance(other, string_types):
+            other = SpecifierSet(other)
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        specifier = SpecifierSet()
+        specifier._specs = frozenset(self._specs | other._specs)
+
+        if self._prereleases is None and other._prereleases is not None:
+            specifier._prereleases = other._prereleases
+        elif self._prereleases is not None and other._prereleases is None:
+            specifier._prereleases = self._prereleases
+        elif self._prereleases == other._prereleases:
+            specifier._prereleases = self._prereleases
+        else:
+            raise ValueError(
+                "Cannot combine SpecifierSets with True and False prerelease "
+                "overrides."
+            )
+
+        return specifier
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs == other._specs
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        if isinstance(other, (string_types, _IndividualSpecifier)):
+            other = SpecifierSet(str(other))
+        elif not isinstance(other, SpecifierSet):
+            return NotImplemented
+
+        return self._specs != other._specs
+
+    def __len__(self):
+        # type: () -> int
+        return len(self._specs)
+
+    def __iter__(self):
+        # type: () -> Iterator[FrozenSet[_IndividualSpecifier]]
+        return iter(self._specs)
+
+    @property
+    def prereleases(self):
+        # type: () -> Optional[bool]
+
+        # If we have been given an explicit prerelease modifier, then we'll
+        # pass that through here.
+        if self._prereleases is not None:
+            return self._prereleases
+
+        # If we don't have any specifiers, and we don't have a forced value,
+        # then we'll just return None since we don't know if this should have
+        # pre-releases or not.
+        if not self._specs:
+            return None
+
+        # Otherwise we'll see if any of the given specifiers accept
+        # prereleases, if any of them do we'll return True, otherwise False.
+        return any(s.prereleases for s in self._specs)
+
+    @prereleases.setter
+    def prereleases(self, value):
+        # type: (bool) -> None
+        self._prereleases = value
+
+    def __contains__(self, item):
+        # type: (Union[ParsedVersion, str]) -> bool
+        return self.contains(item)
+
+    def contains(self, item, prereleases=None):
+        # type: (Union[ParsedVersion, str], Optional[bool]) -> bool
+
+        # Ensure that our item is a Version or LegacyVersion instance.
+        if not isinstance(item, (LegacyVersion, Version)):
+            item = parse(item)
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # We can determine if we're going to allow pre-releases by looking to
+        # see if any of the underlying items supports them. If none of them do
+        # and this item is a pre-release then we do not allow it and we can
+        # short circuit that here.
+        # Note: This means that 1.0.dev1 would not be contained in something
+        #       like >=1.0.devabc however it would be in >=1.0.debabc,>0.0.dev0
+        if not prereleases and item.is_prerelease:
+            return False
+
+        # We simply dispatch to the underlying specs here to make sure that the
+        # given version is contained within all of them.
+        # Note: This use of all() here means that an empty set of specifiers
+        #       will always return True, this is an explicit design decision.
+        return all(s.contains(item, prereleases=prereleases) for s in self._specs)
+
+    def filter(
+        self,
+        iterable,  # type: Iterable[Union[ParsedVersion, str]]
+        prereleases=None,  # type: Optional[bool]
+    ):
+        # type: (...) -> Iterable[Union[ParsedVersion, str]]
+
+        # Determine if we're forcing a prerelease or not, if we're not forcing
+        # one for this particular filter call, then we'll use whatever the
+        # SpecifierSet thinks for whether or not we should support prereleases.
+        if prereleases is None:
+            prereleases = self.prereleases
+
+        # If we have any specifiers, then we want to wrap our iterable in the
+        # filter method for each one, this will act as a logical AND amongst
+        # each specifier.
+        if self._specs:
+            for spec in self._specs:
+                iterable = spec.filter(iterable, prereleases=bool(prereleases))
+            return iterable
+        # If we do not have any specifiers, then we need to have a rough filter
+        # which will filter out any pre-releases, unless there are no final
+        # releases, and which will filter out LegacyVersion in general.
+        else:
+            filtered = []  # type: List[Union[ParsedVersion, str]]
+            found_prereleases = []  # type: List[Union[ParsedVersion, str]]
+
+            for item in iterable:
+                # Ensure that we some kind of Version class for this item.
+                if not isinstance(item, (LegacyVersion, Version)):
+                    parsed_version = parse(item)
+                else:
+                    parsed_version = item
+
+                # Filter out any item which is parsed as a LegacyVersion
+                if isinstance(parsed_version, LegacyVersion):
+                    continue
+
+                # Store any item which is a pre-release for later unless we've
+                # already found a final version or we are accepting prereleases
+                if parsed_version.is_prerelease and not prereleases:
+                    if not filtered:
+                        found_prereleases.append(item)
+                else:
+                    filtered.append(item)
+
+            # If we've found no items except for pre-releases, then we'll go
+            # ahead and use the pre-releases
+            if not filtered and found_prereleases and prereleases is None:
+                return found_prereleases
+
+            return filtered
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/tags.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/tags.py
new file mode 100644
index 000000000..9064910b8
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/tags.py
@@ -0,0 +1,751 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+
+from __future__ import absolute_import
+
+import distutils.util
+
+try:
+    from importlib.machinery import EXTENSION_SUFFIXES
+except ImportError:  # pragma: no cover
+    import imp
+
+    EXTENSION_SUFFIXES = [x[0] for x in imp.get_suffixes()]
+    del imp
+import logging
+import os
+import platform
+import re
+import struct
+import sys
+import sysconfig
+import warnings
+
+from ._typing import TYPE_CHECKING, cast
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import (
+        Dict,
+        FrozenSet,
+        IO,
+        Iterable,
+        Iterator,
+        List,
+        Optional,
+        Sequence,
+        Tuple,
+        Union,
+    )
+
+    PythonVersion = Sequence[int]
+    MacVersion = Tuple[int, int]
+    GlibcVersion = Tuple[int, int]
+
+
+logger = logging.getLogger(__name__)
+
+INTERPRETER_SHORT_NAMES = {
+    "python": "py",  # Generic.
+    "cpython": "cp",
+    "pypy": "pp",
+    "ironpython": "ip",
+    "jython": "jy",
+}  # type: Dict[str, str]
+
+
+_32_BIT_INTERPRETER = sys.maxsize <= 2 ** 32
+
+
+class Tag(object):
+    """
+    A representation of the tag triple for a wheel.
+
+    Instances are considered immutable and thus are hashable. Equality checking
+    is also supported.
+    """
+
+    __slots__ = ["_interpreter", "_abi", "_platform"]
+
+    def __init__(self, interpreter, abi, platform):
+        # type: (str, str, str) -> None
+        self._interpreter = interpreter.lower()
+        self._abi = abi.lower()
+        self._platform = platform.lower()
+
+    @property
+    def interpreter(self):
+        # type: () -> str
+        return self._interpreter
+
+    @property
+    def abi(self):
+        # type: () -> str
+        return self._abi
+
+    @property
+    def platform(self):
+        # type: () -> str
+        return self._platform
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        if not isinstance(other, Tag):
+            return NotImplemented
+
+        return (
+            (self.platform == other.platform)
+            and (self.abi == other.abi)
+            and (self.interpreter == other.interpreter)
+        )
+
+    def __hash__(self):
+        # type: () -> int
+        return hash((self._interpreter, self._abi, self._platform))
+
+    def __str__(self):
+        # type: () -> str
+        return "{}-{}-{}".format(self._interpreter, self._abi, self._platform)
+
+    def __repr__(self):
+        # type: () -> str
+        return "<{self} @ {self_id}>".format(self=self, self_id=id(self))
+
+
+def parse_tag(tag):
+    # type: (str) -> FrozenSet[Tag]
+    """
+    Parses the provided tag (e.g. `py3-none-any`) into a frozenset of Tag instances.
+
+    Returning a set is required due to the possibility that the tag is a
+    compressed tag set.
+    """
+    tags = set()
+    interpreters, abis, platforms = tag.split("-")
+    for interpreter in interpreters.split("."):
+        for abi in abis.split("."):
+            for platform_ in platforms.split("."):
+                tags.add(Tag(interpreter, abi, platform_))
+    return frozenset(tags)
+
+
+def _warn_keyword_parameter(func_name, kwargs):
+    # type: (str, Dict[str, bool]) -> bool
+    """
+    Backwards-compatibility with Python 2.7 to allow treating 'warn' as keyword-only.
+    """
+    if not kwargs:
+        return False
+    elif len(kwargs) > 1 or "warn" not in kwargs:
+        kwargs.pop("warn", None)
+        arg = next(iter(kwargs.keys()))
+        raise TypeError(
+            "{}() got an unexpected keyword argument {!r}".format(func_name, arg)
+        )
+    return kwargs["warn"]
+
+
+def _get_config_var(name, warn=False):
+    # type: (str, bool) -> Union[int, str, None]
+    value = sysconfig.get_config_var(name)
+    if value is None and warn:
+        logger.debug(
+            "Config variable '%s' is unset, Python ABI tag may be incorrect", name
+        )
+    return value
+
+
+def _normalize_string(string):
+    # type: (str) -> str
+    return string.replace(".", "_").replace("-", "_")
+
+
+def _abi3_applies(python_version):
+    # type: (PythonVersion) -> bool
+    """
+    Determine if the Python version supports abi3.
+
+    PEP 384 was first implemented in Python 3.2.
+    """
+    return len(python_version) > 1 and tuple(python_version) >= (3, 2)
+
+
+def _cpython_abis(py_version, warn=False):
+    # type: (PythonVersion, bool) -> List[str]
+    py_version = tuple(py_version)  # To allow for version comparison.
+    abis = []
+    version = _version_nodot(py_version[:2])
+    debug = pymalloc = ucs4 = ""
+    with_debug = _get_config_var("Py_DEBUG", warn)
+    has_refcount = hasattr(sys, "gettotalrefcount")
+    # Windows doesn't set Py_DEBUG, so checking for support of debug-compiled
+    # extension modules is the best option.
+    # https://github.com/pypa/pip/issues/3383#issuecomment-173267692
+    has_ext = "_d.pyd" in EXTENSION_SUFFIXES
+    if with_debug or (with_debug is None and (has_refcount or has_ext)):
+        debug = "d"
+    if py_version < (3, 8):
+        with_pymalloc = _get_config_var("WITH_PYMALLOC", warn)
+        if with_pymalloc or with_pymalloc is None:
+            pymalloc = "m"
+        if py_version < (3, 3):
+            unicode_size = _get_config_var("Py_UNICODE_SIZE", warn)
+            if unicode_size == 4 or (
+                unicode_size is None and sys.maxunicode == 0x10FFFF
+            ):
+                ucs4 = "u"
+    elif debug:
+        # Debug builds can also load "normal" extension modules.
+        # We can also assume no UCS-4 or pymalloc requirement.
+        abis.append("cp{version}".format(version=version))
+    abis.insert(
+        0,
+        "cp{version}{debug}{pymalloc}{ucs4}".format(
+            version=version, debug=debug, pymalloc=pymalloc, ucs4=ucs4
+        ),
+    )
+    return abis
+
+
+def cpython_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a CPython interpreter.
+
+    The tags consist of:
+    - cp<python_version>-<abi>-<platform>
+    - cp<python_version>-abi3-<platform>
+    - cp<python_version>-none-<platform>
+    - cp<less than python_version>-abi3-<platform>  # Older Python versions down to 3.2.
+
+    If python_version only specifies a major version then user-provided ABIs and
+    the 'none' ABItag will be used.
+
+    If 'abi3' or 'none' are specified in 'abis' then they will be yielded at
+    their normal position and not at the beginning.
+    """
+    warn = _warn_keyword_parameter("cpython_tags", kwargs)
+    if not python_version:
+        python_version = sys.version_info[:2]
+
+    interpreter = "cp{}".format(_version_nodot(python_version[:2]))
+
+    if abis is None:
+        if len(python_version) > 1:
+            abis = _cpython_abis(python_version, warn)
+        else:
+            abis = []
+    abis = list(abis)
+    # 'abi3' and 'none' are explicitly handled later.
+    for explicit_abi in ("abi3", "none"):
+        try:
+            abis.remove(explicit_abi)
+        except ValueError:
+            pass
+
+    platforms = list(platforms or _platform_tags())
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+    if _abi3_applies(python_version):
+        for tag in (Tag(interpreter, "abi3", platform_) for platform_ in platforms):
+            yield tag
+    for tag in (Tag(interpreter, "none", platform_) for platform_ in platforms):
+        yield tag
+
+    if _abi3_applies(python_version):
+        for minor_version in range(python_version[1] - 1, 1, -1):
+            for platform_ in platforms:
+                interpreter = "cp{version}".format(
+                    version=_version_nodot((python_version[0], minor_version))
+                )
+                yield Tag(interpreter, "abi3", platform_)
+
+
+def _generic_abi():
+    # type: () -> Iterator[str]
+    abi = sysconfig.get_config_var("SOABI")
+    if abi:
+        yield _normalize_string(abi)
+
+
+def generic_tags(
+    interpreter=None,  # type: Optional[str]
+    abis=None,  # type: Optional[Iterable[str]]
+    platforms=None,  # type: Optional[Iterable[str]]
+    **kwargs  # type: bool
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the tags for a generic interpreter.
+
+    The tags consist of:
+    - <interpreter>-<abi>-<platform>
+
+    The "none" ABI will be added if it was not explicitly provided.
+    """
+    warn = _warn_keyword_parameter("generic_tags", kwargs)
+    if not interpreter:
+        interp_name = interpreter_name()
+        interp_version = interpreter_version(warn=warn)
+        interpreter = "".join([interp_name, interp_version])
+    if abis is None:
+        abis = _generic_abi()
+    platforms = list(platforms or _platform_tags())
+    abis = list(abis)
+    if "none" not in abis:
+        abis.append("none")
+    for abi in abis:
+        for platform_ in platforms:
+            yield Tag(interpreter, abi, platform_)
+
+
+def _py_interpreter_range(py_version):
+    # type: (PythonVersion) -> Iterator[str]
+    """
+    Yields Python versions in descending order.
+
+    After the latest version, the major-only version will be yielded, and then
+    all previous versions of that major version.
+    """
+    if len(py_version) > 1:
+        yield "py{version}".format(version=_version_nodot(py_version[:2]))
+    yield "py{major}".format(major=py_version[0])
+    if len(py_version) > 1:
+        for minor in range(py_version[1] - 1, -1, -1):
+            yield "py{version}".format(version=_version_nodot((py_version[0], minor)))
+
+
+def compatible_tags(
+    python_version=None,  # type: Optional[PythonVersion]
+    interpreter=None,  # type: Optional[str]
+    platforms=None,  # type: Optional[Iterable[str]]
+):
+    # type: (...) -> Iterator[Tag]
+    """
+    Yields the sequence of tags that are compatible with a specific version of Python.
+
+    The tags consist of:
+    - py*-none-<platform>
+    - <interpreter>-none-any  # ... if `interpreter` is provided.
+    - py*-none-any
+    """
+    if not python_version:
+        python_version = sys.version_info[:2]
+    platforms = list(platforms or _platform_tags())
+    for version in _py_interpreter_range(python_version):
+        for platform_ in platforms:
+            yield Tag(version, "none", platform_)
+    if interpreter:
+        yield Tag(interpreter, "none", "any")
+    for version in _py_interpreter_range(python_version):
+        yield Tag(version, "none", "any")
+
+
+def _mac_arch(arch, is_32bit=_32_BIT_INTERPRETER):
+    # type: (str, bool) -> str
+    if not is_32bit:
+        return arch
+
+    if arch.startswith("ppc"):
+        return "ppc"
+
+    return "i386"
+
+
+def _mac_binary_formats(version, cpu_arch):
+    # type: (MacVersion, str) -> List[str]
+    formats = [cpu_arch]
+    if cpu_arch == "x86_64":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat64", "fat32"])
+
+    elif cpu_arch == "i386":
+        if version < (10, 4):
+            return []
+        formats.extend(["intel", "fat32", "fat"])
+
+    elif cpu_arch == "ppc64":
+        # TODO: Need to care about 32-bit PPC for ppc64 through 10.2?
+        if version > (10, 5) or version < (10, 4):
+            return []
+        formats.append("fat64")
+
+    elif cpu_arch == "ppc":
+        if version > (10, 6):
+            return []
+        formats.extend(["fat32", "fat"])
+
+    formats.append("universal")
+    return formats
+
+
+def mac_platforms(version=None, arch=None):
+    # type: (Optional[MacVersion], Optional[str]) -> Iterator[str]
+    """
+    Yields the platform tags for a macOS system.
+
+    The `version` parameter is a two-item tuple specifying the macOS version to
+    generate platform tags for. The `arch` parameter is the CPU architecture to
+    generate platform tags for. Both parameters default to the appropriate value
+    for the current system.
+    """
+    version_str, _, cpu_arch = platform.mac_ver()  # type: ignore
+    if version is None:
+        version = cast("MacVersion", tuple(map(int, version_str.split(".")[:2])))
+    else:
+        version = version
+    if arch is None:
+        arch = _mac_arch(cpu_arch)
+    else:
+        arch = arch
+    for minor_version in range(version[1], -1, -1):
+        compat_version = version[0], minor_version
+        binary_formats = _mac_binary_formats(compat_version, arch)
+        for binary_format in binary_formats:
+            yield "macosx_{major}_{minor}_{binary_format}".format(
+                major=compat_version[0],
+                minor=compat_version[1],
+                binary_format=binary_format,
+            )
+
+
+# From PEP 513.
+def _is_manylinux_compatible(name, glibc_version):
+    # type: (str, GlibcVersion) -> bool
+    # Check for presence of _manylinux module.
+    try:
+        import _manylinux  # noqa
+
+        return bool(getattr(_manylinux, name + "_compatible"))
+    except (ImportError, AttributeError):
+        # Fall through to heuristic check below.
+        pass
+
+    return _have_compatible_glibc(*glibc_version)
+
+
+def _glibc_version_string():
+    # type: () -> Optional[str]
+    # Returns glibc version string, or None if not using glibc.
+    return _glibc_version_string_confstr() or _glibc_version_string_ctypes()
+
+
+def _glibc_version_string_confstr():
+    # type: () -> Optional[str]
+    """
+    Primary implementation of glibc_version_string using os.confstr.
+    """
+    # os.confstr is quite a bit faster than ctypes.DLL. It's also less likely
+    # to be broken or missing. This strategy is used in the standard library
+    # platform module.
+    # https://github.com/python/cpython/blob/fcf1d003bf4f0100c9d0921ff3d70e1127ca1b71/Lib/platform.py#L175-L183
+    try:
+        # os.confstr("CS_GNU_LIBC_VERSION") returns a string like "glibc 2.17".
+        version_string = os.confstr(  # type: ignore[attr-defined] # noqa: F821
+            "CS_GNU_LIBC_VERSION"
+        )
+        assert version_string is not None
+        _, version = version_string.split()  # type: Tuple[str, str]
+    except (AssertionError, AttributeError, OSError, ValueError):
+        # os.confstr() or CS_GNU_LIBC_VERSION not available (or a bad value)...
+        return None
+    return version
+
+
+def _glibc_version_string_ctypes():
+    # type: () -> Optional[str]
+    """
+    Fallback implementation of glibc_version_string using ctypes.
+    """
+    try:
+        import ctypes
+    except ImportError:
+        return None
+
+    # ctypes.CDLL(None) internally calls dlopen(NULL), and as the dlopen
+    # manpage says, "If filename is NULL, then the returned handle is for the
+    # main program". This way we can let the linker do the work to figure out
+    # which libc our process is actually using.
+    #
+    # Note: typeshed is wrong here so we are ignoring this line.
+    process_namespace = ctypes.CDLL(None)  # type: ignore
+    try:
+        gnu_get_libc_version = process_namespace.gnu_get_libc_version
+    except AttributeError:
+        # Symbol doesn't exist -> therefore, we are not linked to
+        # glibc.
+        return None
+
+    # Call gnu_get_libc_version, which returns a string like "2.5"
+    gnu_get_libc_version.restype = ctypes.c_char_p
+    version_str = gnu_get_libc_version()  # type: str
+    # py2 / py3 compatibility:
+    if not isinstance(version_str, str):
+        version_str = version_str.decode("ascii")
+
+    return version_str
+
+
+# Separated out from have_compatible_glibc for easier unit testing.
+def _check_glibc_version(version_str, required_major, minimum_minor):
+    # type: (str, int, int) -> bool
+    # Parse string and check against requested version.
+    #
+    # We use a regexp instead of str.split because we want to discard any
+    # random junk that might come after the minor version -- this might happen
+    # in patched/forked versions of glibc (e.g. Linaro's version of glibc
+    # uses version strings like "2.20-2014.11"). See gh-3588.
+    m = re.match(r"(?P<major>[0-9]+)\.(?P<minor>[0-9]+)", version_str)
+    if not m:
+        warnings.warn(
+            "Expected glibc version with 2 components major.minor,"
+            " got: %s" % version_str,
+            RuntimeWarning,
+        )
+        return False
+    return (
+        int(m.group("major")) == required_major
+        and int(m.group("minor")) >= minimum_minor
+    )
+
+
+def _have_compatible_glibc(required_major, minimum_minor):
+    # type: (int, int) -> bool
+    version_str = _glibc_version_string()
+    if version_str is None:
+        return False
+    return _check_glibc_version(version_str, required_major, minimum_minor)
+
+
+# Python does not provide platform information at sufficient granularity to
+# identify the architecture of the running executable in some cases, so we
+# determine it dynamically by reading the information from the running
+# process. This only applies on Linux, which uses the ELF format.
+class _ELFFileHeader(object):
+    # https://en.wikipedia.org/wiki/Executable_and_Linkable_Format#File_header
+    class _InvalidELFFileHeader(ValueError):
+        """
+        An invalid ELF file header was found.
+        """
+
+    ELF_MAGIC_NUMBER = 0x7F454C46
+    ELFCLASS32 = 1
+    ELFCLASS64 = 2
+    ELFDATA2LSB = 1
+    ELFDATA2MSB = 2
+    EM_386 = 3
+    EM_S390 = 22
+    EM_ARM = 40
+    EM_X86_64 = 62
+    EF_ARM_ABIMASK = 0xFF000000
+    EF_ARM_ABI_VER5 = 0x05000000
+    EF_ARM_ABI_FLOAT_HARD = 0x00000400
+
+    def __init__(self, file):
+        # type: (IO[bytes]) -> None
+        def unpack(fmt):
+            # type: (str) -> int
+            try:
+                (result,) = struct.unpack(
+                    fmt, file.read(struct.calcsize(fmt))
+                )  # type: (int, )
+            except struct.error:
+                raise _ELFFileHeader._InvalidELFFileHeader()
+            return result
+
+        self.e_ident_magic = unpack(">I")
+        if self.e_ident_magic != self.ELF_MAGIC_NUMBER:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_class = unpack("B")
+        if self.e_ident_class not in {self.ELFCLASS32, self.ELFCLASS64}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_data = unpack("B")
+        if self.e_ident_data not in {self.ELFDATA2LSB, self.ELFDATA2MSB}:
+            raise _ELFFileHeader._InvalidELFFileHeader()
+        self.e_ident_version = unpack("B")
+        self.e_ident_osabi = unpack("B")
+        self.e_ident_abiversion = unpack("B")
+        self.e_ident_pad = file.read(7)
+        format_h = "<H" if self.e_ident_data == self.ELFDATA2LSB else ">H"
+        format_i = "<I" if self.e_ident_data == self.ELFDATA2LSB else ">I"
+        format_q = "<Q" if self.e_ident_data == self.ELFDATA2LSB else ">Q"
+        format_p = format_i if self.e_ident_class == self.ELFCLASS32 else format_q
+        self.e_type = unpack(format_h)
+        self.e_machine = unpack(format_h)
+        self.e_version = unpack(format_i)
+        self.e_entry = unpack(format_p)
+        self.e_phoff = unpack(format_p)
+        self.e_shoff = unpack(format_p)
+        self.e_flags = unpack(format_i)
+        self.e_ehsize = unpack(format_h)
+        self.e_phentsize = unpack(format_h)
+        self.e_phnum = unpack(format_h)
+        self.e_shentsize = unpack(format_h)
+        self.e_shnum = unpack(format_h)
+        self.e_shstrndx = unpack(format_h)
+
+
+def _get_elf_header():
+    # type: () -> Optional[_ELFFileHeader]
+    try:
+        with open(sys.executable, "rb") as f:
+            elf_header = _ELFFileHeader(f)
+    except (IOError, OSError, TypeError, _ELFFileHeader._InvalidELFFileHeader):
+        return None
+    return elf_header
+
+
+def _is_linux_armhf():
+    # type: () -> bool
+    # hard-float ABI can be detected from the ELF header of the running
+    # process
+    # https://static.docs.arm.com/ihi0044/g/aaelf32.pdf
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_ARM
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABIMASK
+    ) == elf_header.EF_ARM_ABI_VER5
+    result &= (
+        elf_header.e_flags & elf_header.EF_ARM_ABI_FLOAT_HARD
+    ) == elf_header.EF_ARM_ABI_FLOAT_HARD
+    return result
+
+
+def _is_linux_i686():
+    # type: () -> bool
+    elf_header = _get_elf_header()
+    if elf_header is None:
+        return False
+    result = elf_header.e_ident_class == elf_header.ELFCLASS32
+    result &= elf_header.e_ident_data == elf_header.ELFDATA2LSB
+    result &= elf_header.e_machine == elf_header.EM_386
+    return result
+
+
+def _have_compatible_manylinux_abi(arch):
+    # type: (str) -> bool
+    if arch == "armv7l":
+        return _is_linux_armhf()
+    if arch == "i686":
+        return _is_linux_i686()
+    return True
+
+
+def _linux_platforms(is_32bit=_32_BIT_INTERPRETER):
+    # type: (bool) -> Iterator[str]
+    linux = _normalize_string(distutils.util.get_platform())
+    if is_32bit:
+        if linux == "linux_x86_64":
+            linux = "linux_i686"
+        elif linux == "linux_aarch64":
+            linux = "linux_armv7l"
+    manylinux_support = []
+    _, arch = linux.split("_", 1)
+    if _have_compatible_manylinux_abi(arch):
+        if arch in {"x86_64", "i686", "aarch64", "armv7l", "ppc64", "ppc64le", "s390x"}:
+            manylinux_support.append(
+                ("manylinux2014", (2, 17))
+            )  # CentOS 7 w/ glibc 2.17 (PEP 599)
+        if arch in {"x86_64", "i686"}:
+            manylinux_support.append(
+                ("manylinux2010", (2, 12))
+            )  # CentOS 6 w/ glibc 2.12 (PEP 571)
+            manylinux_support.append(
+                ("manylinux1", (2, 5))
+            )  # CentOS 5 w/ glibc 2.5 (PEP 513)
+    manylinux_support_iter = iter(manylinux_support)
+    for name, glibc_version in manylinux_support_iter:
+        if _is_manylinux_compatible(name, glibc_version):
+            yield linux.replace("linux", name)
+            break
+    # Support for a later manylinux implies support for an earlier version.
+    for name, _ in manylinux_support_iter:
+        yield linux.replace("linux", name)
+    yield linux
+
+
+def _generic_platforms():
+    # type: () -> Iterator[str]
+    yield _normalize_string(distutils.util.get_platform())
+
+
+def _platform_tags():
+    # type: () -> Iterator[str]
+    """
+    Provides the platform tags for this installation.
+    """
+    if platform.system() == "Darwin":
+        return mac_platforms()
+    elif platform.system() == "Linux":
+        return _linux_platforms()
+    else:
+        return _generic_platforms()
+
+
+def interpreter_name():
+    # type: () -> str
+    """
+    Returns the name of the running interpreter.
+    """
+    try:
+        name = sys.implementation.name  # type: ignore
+    except AttributeError:  # pragma: no cover
+        # Python 2.7 compatibility.
+        name = platform.python_implementation().lower()
+    return INTERPRETER_SHORT_NAMES.get(name) or name
+
+
+def interpreter_version(**kwargs):
+    # type: (bool) -> str
+    """
+    Returns the version of the running interpreter.
+    """
+    warn = _warn_keyword_parameter("interpreter_version", kwargs)
+    version = _get_config_var("py_version_nodot", warn=warn)
+    if version:
+        version = str(version)
+    else:
+        version = _version_nodot(sys.version_info[:2])
+    return version
+
+
+def _version_nodot(version):
+    # type: (PythonVersion) -> str
+    if any(v >= 10 for v in version):
+        sep = "_"
+    else:
+        sep = ""
+    return sep.join(map(str, version))
+
+
+def sys_tags(**kwargs):
+    # type: (bool) -> Iterator[Tag]
+    """
+    Returns the sequence of tag triples for the running interpreter.
+
+    The order of the sequence corresponds to priority order for the
+    interpreter, from most to least important.
+    """
+    warn = _warn_keyword_parameter("sys_tags", kwargs)
+
+    interp_name = interpreter_name()
+    if interp_name == "cp":
+        for tag in cpython_tags(warn=warn):
+            yield tag
+    else:
+        for tag in generic_tags():
+            yield tag
+
+    for tag in compatible_tags():
+        yield tag
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/utils.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/utils.py
new file mode 100644
index 000000000..19579c1a0
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/utils.py
@@ -0,0 +1,65 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import re
+
+from ._typing import TYPE_CHECKING, cast
+from .version import InvalidVersion, Version
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import NewType, Union
+
+    NormalizedName = NewType("NormalizedName", str)
+
+_canonicalize_regex = re.compile(r"[-_.]+")
+
+
+def canonicalize_name(name):
+    # type: (str) -> NormalizedName
+    # This is taken from PEP 503.
+    value = _canonicalize_regex.sub("-", name).lower()
+    return cast("NormalizedName", value)
+
+
+def canonicalize_version(_version):
+    # type: (str) -> Union[Version, str]
+    """
+    This is very similar to Version.__str__, but has one subtle difference
+    with the way it handles the release segment.
+    """
+
+    try:
+        version = Version(_version)
+    except InvalidVersion:
+        # Legacy versions cannot be normalized
+        return _version
+
+    parts = []
+
+    # Epoch
+    if version.epoch != 0:
+        parts.append("{0}!".format(version.epoch))
+
+    # Release segment
+    # NB: This strips trailing '.0's to normalize
+    parts.append(re.sub(r"(\.0)+$", "", ".".join(str(x) for x in version.release)))
+
+    # Pre-release
+    if version.pre is not None:
+        parts.append("".join(str(x) for x in version.pre))
+
+    # Post-release
+    if version.post is not None:
+        parts.append(".post{0}".format(version.post))
+
+    # Development release
+    if version.dev is not None:
+        parts.append(".dev{0}".format(version.dev))
+
+    # Local version segment
+    if version.local is not None:
+        parts.append("+{0}".format(version.local))
+
+    return "".join(parts)
diff --git a/venv/Lib/site-packages/setuptools/_vendor/packaging/version.py b/venv/Lib/site-packages/setuptools/_vendor/packaging/version.py
new file mode 100644
index 000000000..00371e86a
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/packaging/version.py
@@ -0,0 +1,535 @@
+# This file is dual licensed under the terms of the Apache License, Version
+# 2.0, and the BSD License. See the LICENSE file in the root of this repository
+# for complete details.
+from __future__ import absolute_import, division, print_function
+
+import collections
+import itertools
+import re
+
+from ._structures import Infinity, NegativeInfinity
+from ._typing import TYPE_CHECKING
+
+if TYPE_CHECKING:  # pragma: no cover
+    from typing import Callable, Iterator, List, Optional, SupportsInt, Tuple, Union
+
+    from ._structures import InfinityType, NegativeInfinityType
+
+    InfiniteTypes = Union[InfinityType, NegativeInfinityType]
+    PrePostDevType = Union[InfiniteTypes, Tuple[str, int]]
+    SubLocalType = Union[InfiniteTypes, int, str]
+    LocalType = Union[
+        NegativeInfinityType,
+        Tuple[
+            Union[
+                SubLocalType,
+                Tuple[SubLocalType, str],
+                Tuple[NegativeInfinityType, SubLocalType],
+            ],
+            ...,
+        ],
+    ]
+    CmpKey = Tuple[
+        int, Tuple[int, ...], PrePostDevType, PrePostDevType, PrePostDevType, LocalType
+    ]
+    LegacyCmpKey = Tuple[int, Tuple[str, ...]]
+    VersionComparisonMethod = Callable[
+        [Union[CmpKey, LegacyCmpKey], Union[CmpKey, LegacyCmpKey]], bool
+    ]
+
+__all__ = ["parse", "Version", "LegacyVersion", "InvalidVersion", "VERSION_PATTERN"]
+
+
+_Version = collections.namedtuple(
+    "_Version", ["epoch", "release", "dev", "pre", "post", "local"]
+)
+
+
+def parse(version):
+    # type: (str) -> Union[LegacyVersion, Version]
+    """
+    Parse the given version string and return either a :class:`Version` object
+    or a :class:`LegacyVersion` object depending on if the given version is
+    a valid PEP 440 version or a legacy version.
+    """
+    try:
+        return Version(version)
+    except InvalidVersion:
+        return LegacyVersion(version)
+
+
+class InvalidVersion(ValueError):
+    """
+    An invalid version was found, users should refer to PEP 440.
+    """
+
+
+class _BaseVersion(object):
+    _key = None  # type: Union[CmpKey, LegacyCmpKey]
+
+    def __hash__(self):
+        # type: () -> int
+        return hash(self._key)
+
+    def __lt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s < o)
+
+    def __le__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s <= o)
+
+    def __eq__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s == o)
+
+    def __ge__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s >= o)
+
+    def __gt__(self, other):
+        # type: (_BaseVersion) -> bool
+        return self._compare(other, lambda s, o: s > o)
+
+    def __ne__(self, other):
+        # type: (object) -> bool
+        return self._compare(other, lambda s, o: s != o)
+
+    def _compare(self, other, method):
+        # type: (object, VersionComparisonMethod) -> Union[bool, NotImplemented]
+        if not isinstance(other, _BaseVersion):
+            return NotImplemented
+
+        return method(self._key, other._key)
+
+
+class LegacyVersion(_BaseVersion):
+    def __init__(self, version):
+        # type: (str) -> None
+        self._version = str(version)
+        self._key = _legacy_cmpkey(self._version)
+
+    def __str__(self):
+        # type: () -> str
+        return self._version
+
+    def __repr__(self):
+        # type: () -> str
+        return "<LegacyVersion({0})>".format(repr(str(self)))
+
+    @property
+    def public(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        return self._version
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        return -1
+
+    @property
+    def release(self):
+        # type: () -> None
+        return None
+
+    @property
+    def pre(self):
+        # type: () -> None
+        return None
+
+    @property
+    def post(self):
+        # type: () -> None
+        return None
+
+    @property
+    def dev(self):
+        # type: () -> None
+        return None
+
+    @property
+    def local(self):
+        # type: () -> None
+        return None
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return False
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return False
+
+
+_legacy_version_component_re = re.compile(r"(\d+ | [a-z]+ | \.| -)", re.VERBOSE)
+
+_legacy_version_replacement_map = {
+    "pre": "c",
+    "preview": "c",
+    "-": "final-",
+    "rc": "c",
+    "dev": "@",
+}
+
+
+def _parse_version_parts(s):
+    # type: (str) -> Iterator[str]
+    for part in _legacy_version_component_re.split(s):
+        part = _legacy_version_replacement_map.get(part, part)
+
+        if not part or part == ".":
+            continue
+
+        if part[:1] in "0123456789":
+            # pad for numeric comparison
+            yield part.zfill(8)
+        else:
+            yield "*" + part
+
+    # ensure that alpha/beta/candidate are before final
+    yield "*final"
+
+
+def _legacy_cmpkey(version):
+    # type: (str) -> LegacyCmpKey
+
+    # We hardcode an epoch of -1 here. A PEP 440 version can only have a epoch
+    # greater than or equal to 0. This will effectively put the LegacyVersion,
+    # which uses the defacto standard originally implemented by setuptools,
+    # as before all PEP 440 versions.
+    epoch = -1
+
+    # This scheme is taken from pkg_resources.parse_version setuptools prior to
+    # it's adoption of the packaging library.
+    parts = []  # type: List[str]
+    for part in _parse_version_parts(version.lower()):
+        if part.startswith("*"):
+            # remove "-" before a prerelease tag
+            if part < "*final":
+                while parts and parts[-1] == "*final-":
+                    parts.pop()
+
+            # remove trailing zeros from each series of numeric parts
+            while parts and parts[-1] == "00000000":
+                parts.pop()
+
+        parts.append(part)
+
+    return epoch, tuple(parts)
+
+
+# Deliberately not anchored to the start and end of the string, to make it
+# easier for 3rd party code to reuse
+VERSION_PATTERN = r"""
+    v?
+    (?:
+        (?:(?P<epoch>[0-9]+)!)?                           # epoch
+        (?P<release>[0-9]+(?:\.[0-9]+)*)                  # release segment
+        (?P<pre>                                          # pre-release
+            [-_\.]?
+            (?P<pre_l>(a|b|c|rc|alpha|beta|pre|preview))
+            [-_\.]?
+            (?P<pre_n>[0-9]+)?
+        )?
+        (?P<post>                                         # post release
+            (?:-(?P<post_n1>[0-9]+))
+            |
+            (?:
+                [-_\.]?
+                (?P<post_l>post|rev|r)
+                [-_\.]?
+                (?P<post_n2>[0-9]+)?
+            )
+        )?
+        (?P<dev>                                          # dev release
+            [-_\.]?
+            (?P<dev_l>dev)
+            [-_\.]?
+            (?P<dev_n>[0-9]+)?
+        )?
+    )
+    (?:\+(?P<local>[a-z0-9]+(?:[-_\.][a-z0-9]+)*))?       # local version
+"""
+
+
+class Version(_BaseVersion):
+
+    _regex = re.compile(r"^\s*" + VERSION_PATTERN + r"\s*$", re.VERBOSE | re.IGNORECASE)
+
+    def __init__(self, version):
+        # type: (str) -> None
+
+        # Validate the version and parse it into pieces
+        match = self._regex.search(version)
+        if not match:
+            raise InvalidVersion("Invalid version: '{0}'".format(version))
+
+        # Store the parsed out pieces of the version
+        self._version = _Version(
+            epoch=int(match.group("epoch")) if match.group("epoch") else 0,
+            release=tuple(int(i) for i in match.group("release").split(".")),
+            pre=_parse_letter_version(match.group("pre_l"), match.group("pre_n")),
+            post=_parse_letter_version(
+                match.group("post_l"), match.group("post_n1") or match.group("post_n2")
+            ),
+            dev=_parse_letter_version(match.group("dev_l"), match.group("dev_n")),
+            local=_parse_local_version(match.group("local")),
+        )
+
+        # Generate a key which will be used for sorting
+        self._key = _cmpkey(
+            self._version.epoch,
+            self._version.release,
+            self._version.pre,
+            self._version.post,
+            self._version.dev,
+            self._version.local,
+        )
+
+    def __repr__(self):
+        # type: () -> str
+        return "<Version({0})>".format(repr(str(self)))
+
+    def __str__(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        # Pre-release
+        if self.pre is not None:
+            parts.append("".join(str(x) for x in self.pre))
+
+        # Post-release
+        if self.post is not None:
+            parts.append(".post{0}".format(self.post))
+
+        # Development release
+        if self.dev is not None:
+            parts.append(".dev{0}".format(self.dev))
+
+        # Local version segment
+        if self.local is not None:
+            parts.append("+{0}".format(self.local))
+
+        return "".join(parts)
+
+    @property
+    def epoch(self):
+        # type: () -> int
+        _epoch = self._version.epoch  # type: int
+        return _epoch
+
+    @property
+    def release(self):
+        # type: () -> Tuple[int, ...]
+        _release = self._version.release  # type: Tuple[int, ...]
+        return _release
+
+    @property
+    def pre(self):
+        # type: () -> Optional[Tuple[str, int]]
+        _pre = self._version.pre  # type: Optional[Tuple[str, int]]
+        return _pre
+
+    @property
+    def post(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.post[1] if self._version.post else None
+
+    @property
+    def dev(self):
+        # type: () -> Optional[Tuple[str, int]]
+        return self._version.dev[1] if self._version.dev else None
+
+    @property
+    def local(self):
+        # type: () -> Optional[str]
+        if self._version.local:
+            return ".".join(str(x) for x in self._version.local)
+        else:
+            return None
+
+    @property
+    def public(self):
+        # type: () -> str
+        return str(self).split("+", 1)[0]
+
+    @property
+    def base_version(self):
+        # type: () -> str
+        parts = []
+
+        # Epoch
+        if self.epoch != 0:
+            parts.append("{0}!".format(self.epoch))
+
+        # Release segment
+        parts.append(".".join(str(x) for x in self.release))
+
+        return "".join(parts)
+
+    @property
+    def is_prerelease(self):
+        # type: () -> bool
+        return self.dev is not None or self.pre is not None
+
+    @property
+    def is_postrelease(self):
+        # type: () -> bool
+        return self.post is not None
+
+    @property
+    def is_devrelease(self):
+        # type: () -> bool
+        return self.dev is not None
+
+    @property
+    def major(self):
+        # type: () -> int
+        return self.release[0] if len(self.release) >= 1 else 0
+
+    @property
+    def minor(self):
+        # type: () -> int
+        return self.release[1] if len(self.release) >= 2 else 0
+
+    @property
+    def micro(self):
+        # type: () -> int
+        return self.release[2] if len(self.release) >= 3 else 0
+
+
+def _parse_letter_version(
+    letter,  # type: str
+    number,  # type: Union[str, bytes, SupportsInt]
+):
+    # type: (...) -> Optional[Tuple[str, int]]
+
+    if letter:
+        # We consider there to be an implicit 0 in a pre-release if there is
+        # not a numeral associated with it.
+        if number is None:
+            number = 0
+
+        # We normalize any letters to their lower case form
+        letter = letter.lower()
+
+        # We consider some words to be alternate spellings of other words and
+        # in those cases we want to normalize the spellings to our preferred
+        # spelling.
+        if letter == "alpha":
+            letter = "a"
+        elif letter == "beta":
+            letter = "b"
+        elif letter in ["c", "pre", "preview"]:
+            letter = "rc"
+        elif letter in ["rev", "r"]:
+            letter = "post"
+
+        return letter, int(number)
+    if not letter and number:
+        # We assume if we are given a number, but we are not given a letter
+        # then this is using the implicit post release syntax (e.g. 1.0-1)
+        letter = "post"
+
+        return letter, int(number)
+
+    return None
+
+
+_local_version_separators = re.compile(r"[\._-]")
+
+
+def _parse_local_version(local):
+    # type: (str) -> Optional[LocalType]
+    """
+    Takes a string like abc.1.twelve and turns it into ("abc", 1, "twelve").
+    """
+    if local is not None:
+        return tuple(
+            part.lower() if not part.isdigit() else int(part)
+            for part in _local_version_separators.split(local)
+        )
+    return None
+
+
+def _cmpkey(
+    epoch,  # type: int
+    release,  # type: Tuple[int, ...]
+    pre,  # type: Optional[Tuple[str, int]]
+    post,  # type: Optional[Tuple[str, int]]
+    dev,  # type: Optional[Tuple[str, int]]
+    local,  # type: Optional[Tuple[SubLocalType]]
+):
+    # type: (...) -> CmpKey
+
+    # When we compare a release version, we want to compare it with all of the
+    # trailing zeros removed. So we'll use a reverse the list, drop all the now
+    # leading zeros until we come to something non zero, then take the rest
+    # re-reverse it back into the correct order and make it a tuple and use
+    # that for our sorting key.
+    _release = tuple(
+        reversed(list(itertools.dropwhile(lambda x: x == 0, reversed(release))))
+    )
+
+    # We need to "trick" the sorting algorithm to put 1.0.dev0 before 1.0a0.
+    # We'll do this by abusing the pre segment, but we _only_ want to do this
+    # if there is not a pre or a post segment. If we have one of those then
+    # the normal sorting rules will handle this case correctly.
+    if pre is None and post is None and dev is not None:
+        _pre = NegativeInfinity  # type: PrePostDevType
+    # Versions without a pre-release (except as noted above) should sort after
+    # those with one.
+    elif pre is None:
+        _pre = Infinity
+    else:
+        _pre = pre
+
+    # Versions without a post segment should sort before those with one.
+    if post is None:
+        _post = NegativeInfinity  # type: PrePostDevType
+
+    else:
+        _post = post
+
+    # Versions without a development segment should sort after those with one.
+    if dev is None:
+        _dev = Infinity  # type: PrePostDevType
+
+    else:
+        _dev = dev
+
+    if local is None:
+        # Versions without a local segment should sort before those with one.
+        _local = NegativeInfinity  # type: LocalType
+    else:
+        # Versions with a local segment need that segment parsed to implement
+        # the sorting rules in PEP440.
+        # - Alpha numeric segments sort before numeric segments
+        # - Alpha numeric segments sort lexicographically
+        # - Numeric segments sort numerically
+        # - Shorter versions sort before longer versions when the prefixes
+        #   match exactly
+        _local = tuple(
+            (i, "") if isinstance(i, int) else (NegativeInfinity, i) for i in local
+        )
+
+    return epoch, _release, _pre, _post, _dev, _local
diff --git a/venv/Lib/site-packages/setuptools/_vendor/pyparsing.py b/venv/Lib/site-packages/setuptools/_vendor/pyparsing.py
new file mode 100644
index 000000000..4aa30ee6b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/_vendor/pyparsing.py
@@ -0,0 +1,5742 @@
+# module pyparsing.py
+#
+# Copyright (c) 2003-2018  Paul T. McGuire
+#
+# Permission is hereby granted, free of charge, to any person obtaining
+# a copy of this software and associated documentation files (the
+# "Software"), to deal in the Software without restriction, including
+# without limitation the rights to use, copy, modify, merge, publish,
+# distribute, sublicense, and/or sell copies of the Software, and to
+# permit persons to whom the Software is furnished to do so, subject to
+# the following conditions:
+#
+# The above copyright notice and this permission notice shall be
+# included in all copies or substantial portions of the Software.
+#
+# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
+# EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
+# MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.
+# IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY
+# CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,
+# TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE
+# SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
+#
+
+__doc__ = \
+"""
+pyparsing module - Classes and methods to define and execute parsing grammars
+=============================================================================
+
+The pyparsing module is an alternative approach to creating and executing simple grammars,
+vs. the traditional lex/yacc approach, or the use of regular expressions.  With pyparsing, you
+don't need to learn a new syntax for defining grammars or matching expressions - the parsing module
+provides a library of classes that you use to construct the grammar directly in Python.
+
+Here is a program to parse "Hello, World!" (or any greeting of the form 
+C{"<salutation>, <addressee>!"}), built up using L{Word}, L{Literal}, and L{And} elements 
+(L{'+'<ParserElement.__add__>} operator gives L{And} expressions, strings are auto-converted to
+L{Literal} expressions)::
+
+    from pyparsing import Word, alphas
+
+    # define grammar of a greeting
+    greet = Word(alphas) + "," + Word(alphas) + "!"
+
+    hello = "Hello, World!"
+    print (hello, "->", greet.parseString(hello))
+
+The program outputs the following::
+
+    Hello, World! -> ['Hello', ',', 'World', '!']
+
+The Python representation of the grammar is quite readable, owing to the self-explanatory
+class names, and the use of '+', '|' and '^' operators.
+
+The L{ParseResults} object returned from L{ParserElement.parseString<ParserElement.parseString>} can be accessed as a nested list, a dictionary, or an
+object with named attributes.
+
+The pyparsing module handles some of the problems that are typically vexing when writing text parsers:
+ - extra or missing whitespace (the above program will also handle "Hello,World!", "Hello  ,  World  !", etc.)
+ - quoted strings
+ - embedded comments
+
+
+Getting Started -
+-----------------
+Visit the classes L{ParserElement} and L{ParseResults} to see the base classes that most other pyparsing
+classes inherit from. Use the docstrings for examples of how to:
+ - construct literal match expressions from L{Literal} and L{CaselessLiteral} classes
+ - construct character word-group expressions using the L{Word} class
+ - see how to create repetitive expressions using L{ZeroOrMore} and L{OneOrMore} classes
+ - use L{'+'<And>}, L{'|'<MatchFirst>}, L{'^'<Or>}, and L{'&'<Each>} operators to combine simple expressions into more complex ones
+ - associate names with your parsed results using L{ParserElement.setResultsName}
+ - find some helpful expression short-cuts like L{delimitedList} and L{oneOf}
+ - find more useful common expressions in the L{pyparsing_common} namespace class
+"""
+
+__version__ = "2.2.1"
+__versionTime__ = "18 Sep 2018 00:49 UTC"
+__author__ = "Paul McGuire <ptmcg@users.sourceforge.net>"
+
+import string
+from weakref import ref as wkref
+import copy
+import sys
+import warnings
+import re
+import sre_constants
+import collections
+import pprint
+import traceback
+import types
+from datetime import datetime
+
+try:
+    from _thread import RLock
+except ImportError:
+    from threading import RLock
+
+try:
+    # Python 3
+    from collections.abc import Iterable
+    from collections.abc import MutableMapping
+except ImportError:
+    # Python 2.7
+    from collections import Iterable
+    from collections import MutableMapping
+
+try:
+    from collections import OrderedDict as _OrderedDict
+except ImportError:
+    try:
+        from ordereddict import OrderedDict as _OrderedDict
+    except ImportError:
+        _OrderedDict = None
+
+#~ sys.stderr.write( "testing pyparsing module, version %s, %s\n" % (__version__,__versionTime__ ) )
+
+__all__ = [
+'And', 'CaselessKeyword', 'CaselessLiteral', 'CharsNotIn', 'Combine', 'Dict', 'Each', 'Empty',
+'FollowedBy', 'Forward', 'GoToColumn', 'Group', 'Keyword', 'LineEnd', 'LineStart', 'Literal',
+'MatchFirst', 'NoMatch', 'NotAny', 'OneOrMore', 'OnlyOnce', 'Optional', 'Or',
+'ParseBaseException', 'ParseElementEnhance', 'ParseException', 'ParseExpression', 'ParseFatalException',
+'ParseResults', 'ParseSyntaxException', 'ParserElement', 'QuotedString', 'RecursiveGrammarException',
+'Regex', 'SkipTo', 'StringEnd', 'StringStart', 'Suppress', 'Token', 'TokenConverter', 
+'White', 'Word', 'WordEnd', 'WordStart', 'ZeroOrMore',
+'alphanums', 'alphas', 'alphas8bit', 'anyCloseTag', 'anyOpenTag', 'cStyleComment', 'col',
+'commaSeparatedList', 'commonHTMLEntity', 'countedArray', 'cppStyleComment', 'dblQuotedString',
+'dblSlashComment', 'delimitedList', 'dictOf', 'downcaseTokens', 'empty', 'hexnums',
+'htmlComment', 'javaStyleComment', 'line', 'lineEnd', 'lineStart', 'lineno',
+'makeHTMLTags', 'makeXMLTags', 'matchOnlyAtCol', 'matchPreviousExpr', 'matchPreviousLiteral',
+'nestedExpr', 'nullDebugAction', 'nums', 'oneOf', 'opAssoc', 'operatorPrecedence', 'printables',
+'punc8bit', 'pythonStyleComment', 'quotedString', 'removeQuotes', 'replaceHTMLEntity', 
+'replaceWith', 'restOfLine', 'sglQuotedString', 'srange', 'stringEnd',
+'stringStart', 'traceParseAction', 'unicodeString', 'upcaseTokens', 'withAttribute',
+'indentedBlock', 'originalTextFor', 'ungroup', 'infixNotation','locatedExpr', 'withClass',
+'CloseMatch', 'tokenMap', 'pyparsing_common',
+]
+
+system_version = tuple(sys.version_info)[:3]
+PY_3 = system_version[0] == 3
+if PY_3:
+    _MAX_INT = sys.maxsize
+    basestring = str
+    unichr = chr
+    _ustr = str
+
+    # build list of single arg builtins, that can be used as parse actions
+    singleArgBuiltins = [sum, len, sorted, reversed, list, tuple, set, any, all, min, max]
+
+else:
+    _MAX_INT = sys.maxint
+    range = xrange
+
+    def _ustr(obj):
+        """Drop-in replacement for str(obj) that tries to be Unicode friendly. It first tries
+           str(obj). If that fails with a UnicodeEncodeError, then it tries unicode(obj). It
+           then < returns the unicode object | encodes it with the default encoding | ... >.
+        """
+        if isinstance(obj,unicode):
+            return obj
+
+        try:
+            # If this works, then _ustr(obj) has the same behaviour as str(obj), so
+            # it won't break any existing code.
+            return str(obj)
+
+        except UnicodeEncodeError:
+            # Else encode it
+            ret = unicode(obj).encode(sys.getdefaultencoding(), 'xmlcharrefreplace')
+            xmlcharref = Regex(r'&#\d+;')
+            xmlcharref.setParseAction(lambda t: '\\u' + hex(int(t[0][2:-1]))[2:])
+            return xmlcharref.transformString(ret)
+
+    # build list of single arg builtins, tolerant of Python version, that can be used as parse actions
+    singleArgBuiltins = []
+    import __builtin__
+    for fname in "sum len sorted reversed list tuple set any all min max".split():
+        try:
+            singleArgBuiltins.append(getattr(__builtin__,fname))
+        except AttributeError:
+            continue
+            
+_generatorType = type((y for y in range(1)))
+ 
+def _xml_escape(data):
+    """Escape &, <, >, ", ', etc. in a string of data."""
+
+    # ampersand must be replaced first
+    from_symbols = '&><"\''
+    to_symbols = ('&'+s+';' for s in "amp gt lt quot apos".split())
+    for from_,to_ in zip(from_symbols, to_symbols):
+        data = data.replace(from_, to_)
+    return data
+
+class _Constants(object):
+    pass
+
+alphas     = string.ascii_uppercase + string.ascii_lowercase
+nums       = "0123456789"
+hexnums    = nums + "ABCDEFabcdef"
+alphanums  = alphas + nums
+_bslash    = chr(92)
+printables = "".join(c for c in string.printable if c not in string.whitespace)
+
+class ParseBaseException(Exception):
+    """base exception class for all parsing runtime exceptions"""
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__( self, pstr, loc=0, msg=None, elem=None ):
+        self.loc = loc
+        if msg is None:
+            self.msg = pstr
+            self.pstr = ""
+        else:
+            self.msg = msg
+            self.pstr = pstr
+        self.parserElement = elem
+        self.args = (pstr, loc, msg)
+
+    @classmethod
+    def _from_exception(cls, pe):
+        """
+        internal factory method to simplify creating one type of ParseException 
+        from another - avoids having __init__ signature conflicts among subclasses
+        """
+        return cls(pe.pstr, pe.loc, pe.msg, pe.parserElement)
+
+    def __getattr__( self, aname ):
+        """supported attributes by name are:
+            - lineno - returns the line number of the exception text
+            - col - returns the column number of the exception text
+            - line - returns the line containing the exception text
+        """
+        if( aname == "lineno" ):
+            return lineno( self.loc, self.pstr )
+        elif( aname in ("col", "column") ):
+            return col( self.loc, self.pstr )
+        elif( aname == "line" ):
+            return line( self.loc, self.pstr )
+        else:
+            raise AttributeError(aname)
+
+    def __str__( self ):
+        return "%s (at char %d), (line:%d, col:%d)" % \
+                ( self.msg, self.loc, self.lineno, self.column )
+    def __repr__( self ):
+        return _ustr(self)
+    def markInputline( self, markerString = ">!<" ):
+        """Extracts the exception line from the input string, and marks
+           the location of the exception with a special symbol.
+        """
+        line_str = self.line
+        line_column = self.column - 1
+        if markerString:
+            line_str = "".join((line_str[:line_column],
+                                markerString, line_str[line_column:]))
+        return line_str.strip()
+    def __dir__(self):
+        return "lineno col line".split() + dir(type(self))
+
+class ParseException(ParseBaseException):
+    """
+    Exception thrown when parse expressions don't match class;
+    supported attributes by name are:
+     - lineno - returns the line number of the exception text
+     - col - returns the column number of the exception text
+     - line - returns the line containing the exception text
+        
+    Example::
+        try:
+            Word(nums).setName("integer").parseString("ABC")
+        except ParseException as pe:
+            print(pe)
+            print("column: {}".format(pe.col))
+            
+    prints::
+       Expected integer (at char 0), (line:1, col:1)
+        column: 1
+    """
+    pass
+
+class ParseFatalException(ParseBaseException):
+    """user-throwable exception thrown when inconsistent parse content
+       is found; stops all parsing immediately"""
+    pass
+
+class ParseSyntaxException(ParseFatalException):
+    """just like L{ParseFatalException}, but thrown internally when an
+       L{ErrorStop<And._ErrorStop>} ('-' operator) indicates that parsing is to stop 
+       immediately because an unbacktrackable syntax error has been found"""
+    pass
+
+#~ class ReparseException(ParseBaseException):
+    #~ """Experimental class - parse actions can raise this exception to cause
+       #~ pyparsing to reparse the input string:
+        #~ - with a modified input string, and/or
+        #~ - with a modified start location
+       #~ Set the values of the ReparseException in the constructor, and raise the
+       #~ exception in a parse action to cause pyparsing to use the new string/location.
+       #~ Setting the values as None causes no change to be made.
+       #~ """
+    #~ def __init_( self, newstring, restartLoc ):
+        #~ self.newParseText = newstring
+        #~ self.reparseLoc = restartLoc
+
+class RecursiveGrammarException(Exception):
+    """exception thrown by L{ParserElement.validate} if the grammar could be improperly recursive"""
+    def __init__( self, parseElementList ):
+        self.parseElementTrace = parseElementList
+
+    def __str__( self ):
+        return "RecursiveGrammarException: %s" % self.parseElementTrace
+
+class _ParseResultsWithOffset(object):
+    def __init__(self,p1,p2):
+        self.tup = (p1,p2)
+    def __getitem__(self,i):
+        return self.tup[i]
+    def __repr__(self):
+        return repr(self.tup[0])
+    def setOffset(self,i):
+        self.tup = (self.tup[0],i)
+
+class ParseResults(object):
+    """
+    Structured parse results, to provide multiple means of access to the parsed data:
+       - as a list (C{len(results)})
+       - by list index (C{results[0], results[1]}, etc.)
+       - by attribute (C{results.<resultsName>} - see L{ParserElement.setResultsName})
+
+    Example::
+        integer = Word(nums)
+        date_str = (integer.setResultsName("year") + '/' 
+                        + integer.setResultsName("month") + '/' 
+                        + integer.setResultsName("day"))
+        # equivalent form:
+        # date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+
+        # parseString returns a ParseResults object
+        result = date_str.parseString("1999/12/31")
+
+        def test(s, fn=repr):
+            print("%s -> %s" % (s, fn(eval(s))))
+        test("list(result)")
+        test("result[0]")
+        test("result['month']")
+        test("result.day")
+        test("'month' in result")
+        test("'minutes' in result")
+        test("result.dump()", str)
+    prints::
+        list(result) -> ['1999', '/', '12', '/', '31']
+        result[0] -> '1999'
+        result['month'] -> '12'
+        result.day -> '31'
+        'month' in result -> True
+        'minutes' in result -> False
+        result.dump() -> ['1999', '/', '12', '/', '31']
+        - day: 31
+        - month: 12
+        - year: 1999
+    """
+    def __new__(cls, toklist=None, name=None, asList=True, modal=True ):
+        if isinstance(toklist, cls):
+            return toklist
+        retobj = object.__new__(cls)
+        retobj.__doinit = True
+        return retobj
+
+    # Performance tuning: we construct a *lot* of these, so keep this
+    # constructor as small and fast as possible
+    def __init__( self, toklist=None, name=None, asList=True, modal=True, isinstance=isinstance ):
+        if self.__doinit:
+            self.__doinit = False
+            self.__name = None
+            self.__parent = None
+            self.__accumNames = {}
+            self.__asList = asList
+            self.__modal = modal
+            if toklist is None:
+                toklist = []
+            if isinstance(toklist, list):
+                self.__toklist = toklist[:]
+            elif isinstance(toklist, _generatorType):
+                self.__toklist = list(toklist)
+            else:
+                self.__toklist = [toklist]
+            self.__tokdict = dict()
+
+        if name is not None and name:
+            if not modal:
+                self.__accumNames[name] = 0
+            if isinstance(name,int):
+                name = _ustr(name) # will always return a str, but use _ustr for consistency
+            self.__name = name
+            if not (isinstance(toklist, (type(None), basestring, list)) and toklist in (None,'',[])):
+                if isinstance(toklist,basestring):
+                    toklist = [ toklist ]
+                if asList:
+                    if isinstance(toklist,ParseResults):
+                        self[name] = _ParseResultsWithOffset(toklist.copy(),0)
+                    else:
+                        self[name] = _ParseResultsWithOffset(ParseResults(toklist[0]),0)
+                    self[name].__name = name
+                else:
+                    try:
+                        self[name] = toklist[0]
+                    except (KeyError,TypeError,IndexError):
+                        self[name] = toklist
+
+    def __getitem__( self, i ):
+        if isinstance( i, (int,slice) ):
+            return self.__toklist[i]
+        else:
+            if i not in self.__accumNames:
+                return self.__tokdict[i][-1][0]
+            else:
+                return ParseResults([ v[0] for v in self.__tokdict[i] ])
+
+    def __setitem__( self, k, v, isinstance=isinstance ):
+        if isinstance(v,_ParseResultsWithOffset):
+            self.__tokdict[k] = self.__tokdict.get(k,list()) + [v]
+            sub = v[0]
+        elif isinstance(k,(int,slice)):
+            self.__toklist[k] = v
+            sub = v
+        else:
+            self.__tokdict[k] = self.__tokdict.get(k,list()) + [_ParseResultsWithOffset(v,0)]
+            sub = v
+        if isinstance(sub,ParseResults):
+            sub.__parent = wkref(self)
+
+    def __delitem__( self, i ):
+        if isinstance(i,(int,slice)):
+            mylen = len( self.__toklist )
+            del self.__toklist[i]
+
+            # convert int to slice
+            if isinstance(i, int):
+                if i < 0:
+                    i += mylen
+                i = slice(i, i+1)
+            # get removed indices
+            removed = list(range(*i.indices(mylen)))
+            removed.reverse()
+            # fixup indices in token dictionary
+            for name,occurrences in self.__tokdict.items():
+                for j in removed:
+                    for k, (value, position) in enumerate(occurrences):
+                        occurrences[k] = _ParseResultsWithOffset(value, position - (position > j))
+        else:
+            del self.__tokdict[i]
+
+    def __contains__( self, k ):
+        return k in self.__tokdict
+
+    def __len__( self ): return len( self.__toklist )
+    def __bool__(self): return ( not not self.__toklist )
+    __nonzero__ = __bool__
+    def __iter__( self ): return iter( self.__toklist )
+    def __reversed__( self ): return iter( self.__toklist[::-1] )
+    def _iterkeys( self ):
+        if hasattr(self.__tokdict, "iterkeys"):
+            return self.__tokdict.iterkeys()
+        else:
+            return iter(self.__tokdict)
+
+    def _itervalues( self ):
+        return (self[k] for k in self._iterkeys())
+            
+    def _iteritems( self ):
+        return ((k, self[k]) for k in self._iterkeys())
+
+    if PY_3:
+        keys = _iterkeys       
+        """Returns an iterator of all named result keys (Python 3.x only)."""
+
+        values = _itervalues
+        """Returns an iterator of all named result values (Python 3.x only)."""
+
+        items = _iteritems
+        """Returns an iterator of all named result key-value tuples (Python 3.x only)."""
+
+    else:
+        iterkeys = _iterkeys
+        """Returns an iterator of all named result keys (Python 2.x only)."""
+
+        itervalues = _itervalues
+        """Returns an iterator of all named result values (Python 2.x only)."""
+
+        iteritems = _iteritems
+        """Returns an iterator of all named result key-value tuples (Python 2.x only)."""
+
+        def keys( self ):
+            """Returns all named result keys (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iterkeys())
+
+        def values( self ):
+            """Returns all named result values (as a list in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.itervalues())
+                
+        def items( self ):
+            """Returns all named result key-values (as a list of tuples in Python 2.x, as an iterator in Python 3.x)."""
+            return list(self.iteritems())
+
+    def haskeys( self ):
+        """Since keys() returns an iterator, this method is helpful in bypassing
+           code that looks for the existence of any defined results names."""
+        return bool(self.__tokdict)
+        
+    def pop( self, *args, **kwargs):
+        """
+        Removes and returns item at specified index (default=C{last}).
+        Supports both C{list} and C{dict} semantics for C{pop()}. If passed no
+        argument or an integer argument, it will use C{list} semantics
+        and pop tokens from the list of parsed tokens. If passed a 
+        non-integer argument (most likely a string), it will use C{dict}
+        semantics and pop the corresponding value from any defined 
+        results names. A second default return value argument is 
+        supported, just as in C{dict.pop()}.
+
+        Example::
+            def remove_first(tokens):
+                tokens.pop(0)
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+            print(OneOrMore(Word(nums)).addParseAction(remove_first).parseString("0 123 321")) # -> ['123', '321']
+
+            label = Word(alphas)
+            patt = label("LABEL") + OneOrMore(Word(nums))
+            print(patt.parseString("AAB 123 321").dump())
+
+            # Use pop() in a parse action to remove named result (note that corresponding value is not
+            # removed from list form of results)
+            def remove_LABEL(tokens):
+                tokens.pop("LABEL")
+                return tokens
+            patt.addParseAction(remove_LABEL)
+            print(patt.parseString("AAB 123 321").dump())
+        prints::
+            ['AAB', '123', '321']
+            - LABEL: AAB
+
+            ['AAB', '123', '321']
+        """
+        if not args:
+            args = [-1]
+        for k,v in kwargs.items():
+            if k == 'default':
+                args = (args[0], v)
+            else:
+                raise TypeError("pop() got an unexpected keyword argument '%s'" % k)
+        if (isinstance(args[0], int) or 
+                        len(args) == 1 or 
+                        args[0] in self):
+            index = args[0]
+            ret = self[index]
+            del self[index]
+            return ret
+        else:
+            defaultvalue = args[1]
+            return defaultvalue
+
+    def get(self, key, defaultValue=None):
+        """
+        Returns named result matching the given key, or if there is no
+        such name, then returns the given C{defaultValue} or C{None} if no
+        C{defaultValue} is specified.
+
+        Similar to C{dict.get()}.
+        
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            result = date_str.parseString("1999/12/31")
+            print(result.get("year")) # -> '1999'
+            print(result.get("hour", "not specified")) # -> 'not specified'
+            print(result.get("hour")) # -> None
+        """
+        if key in self:
+            return self[key]
+        else:
+            return defaultValue
+
+    def insert( self, index, insStr ):
+        """
+        Inserts new element at location index in the list of parsed tokens.
+        
+        Similar to C{list.insert()}.
+
+        Example::
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+
+            # use a parse action to insert the parse location in the front of the parsed results
+            def insert_locn(locn, tokens):
+                tokens.insert(0, locn)
+            print(OneOrMore(Word(nums)).addParseAction(insert_locn).parseString("0 123 321")) # -> [0, '0', '123', '321']
+        """
+        self.__toklist.insert(index, insStr)
+        # fixup indices in token dictionary
+        for name,occurrences in self.__tokdict.items():
+            for k, (value, position) in enumerate(occurrences):
+                occurrences[k] = _ParseResultsWithOffset(value, position + (position > index))
+
+    def append( self, item ):
+        """
+        Add single element to end of ParseResults list of elements.
+
+        Example::
+            print(OneOrMore(Word(nums)).parseString("0 123 321")) # -> ['0', '123', '321']
+            
+            # use a parse action to compute the sum of the parsed integers, and add it to the end
+            def append_sum(tokens):
+                tokens.append(sum(map(int, tokens)))
+            print(OneOrMore(Word(nums)).addParseAction(append_sum).parseString("0 123 321")) # -> ['0', '123', '321', 444]
+        """
+        self.__toklist.append(item)
+
+    def extend( self, itemseq ):
+        """
+        Add sequence of elements to end of ParseResults list of elements.
+
+        Example::
+            patt = OneOrMore(Word(alphas))
+            
+            # use a parse action to append the reverse of the matched strings, to make a palindrome
+            def make_palindrome(tokens):
+                tokens.extend(reversed([t[::-1] for t in tokens]))
+                return ''.join(tokens)
+            print(patt.addParseAction(make_palindrome).parseString("lskdj sdlkjf lksd")) # -> 'lskdjsdlkjflksddsklfjkldsjdksl'
+        """
+        if isinstance(itemseq, ParseResults):
+            self += itemseq
+        else:
+            self.__toklist.extend(itemseq)
+
+    def clear( self ):
+        """
+        Clear all elements and results names.
+        """
+        del self.__toklist[:]
+        self.__tokdict.clear()
+
+    def __getattr__( self, name ):
+        try:
+            return self[name]
+        except KeyError:
+            return ""
+            
+        if name in self.__tokdict:
+            if name not in self.__accumNames:
+                return self.__tokdict[name][-1][0]
+            else:
+                return ParseResults([ v[0] for v in self.__tokdict[name] ])
+        else:
+            return ""
+
+    def __add__( self, other ):
+        ret = self.copy()
+        ret += other
+        return ret
+
+    def __iadd__( self, other ):
+        if other.__tokdict:
+            offset = len(self.__toklist)
+            addoffset = lambda a: offset if a<0 else a+offset
+            otheritems = other.__tokdict.items()
+            otherdictitems = [(k, _ParseResultsWithOffset(v[0],addoffset(v[1])) )
+                                for (k,vlist) in otheritems for v in vlist]
+            for k,v in otherdictitems:
+                self[k] = v
+                if isinstance(v[0],ParseResults):
+                    v[0].__parent = wkref(self)
+            
+        self.__toklist += other.__toklist
+        self.__accumNames.update( other.__accumNames )
+        return self
+
+    def __radd__(self, other):
+        if isinstance(other,int) and other == 0:
+            # useful for merging many ParseResults using sum() builtin
+            return self.copy()
+        else:
+            # this may raise a TypeError - so be it
+            return other + self
+        
+    def __repr__( self ):
+        return "(%s, %s)" % ( repr( self.__toklist ), repr( self.__tokdict ) )
+
+    def __str__( self ):
+        return '[' + ', '.join(_ustr(i) if isinstance(i, ParseResults) else repr(i) for i in self.__toklist) + ']'
+
+    def _asStringList( self, sep='' ):
+        out = []
+        for item in self.__toklist:
+            if out and sep:
+                out.append(sep)
+            if isinstance( item, ParseResults ):
+                out += item._asStringList()
+            else:
+                out.append( _ustr(item) )
+        return out
+
+    def asList( self ):
+        """
+        Returns the parse results as a nested list of matching tokens, all converted to strings.
+
+        Example::
+            patt = OneOrMore(Word(alphas))
+            result = patt.parseString("sldkj lsdkj sldkj")
+            # even though the result prints in string-like form, it is actually a pyparsing ParseResults
+            print(type(result), result) # -> <class 'pyparsing.ParseResults'> ['sldkj', 'lsdkj', 'sldkj']
+            
+            # Use asList() to create an actual list
+            result_list = result.asList()
+            print(type(result_list), result_list) # -> <class 'list'> ['sldkj', 'lsdkj', 'sldkj']
+        """
+        return [res.asList() if isinstance(res,ParseResults) else res for res in self.__toklist]
+
+    def asDict( self ):
+        """
+        Returns the named parse results as a nested dictionary.
+
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+            
+            result = date_str.parseString('12/31/1999')
+            print(type(result), repr(result)) # -> <class 'pyparsing.ParseResults'> (['12', '/', '31', '/', '1999'], {'day': [('1999', 4)], 'year': [('12', 0)], 'month': [('31', 2)]})
+            
+            result_dict = result.asDict()
+            print(type(result_dict), repr(result_dict)) # -> <class 'dict'> {'day': '1999', 'year': '12', 'month': '31'}
+
+            # even though a ParseResults supports dict-like access, sometime you just need to have a dict
+            import json
+            print(json.dumps(result)) # -> Exception: TypeError: ... is not JSON serializable
+            print(json.dumps(result.asDict())) # -> {"month": "31", "day": "1999", "year": "12"}
+        """
+        if PY_3:
+            item_fn = self.items
+        else:
+            item_fn = self.iteritems
+            
+        def toItem(obj):
+            if isinstance(obj, ParseResults):
+                if obj.haskeys():
+                    return obj.asDict()
+                else:
+                    return [toItem(v) for v in obj]
+            else:
+                return obj
+                
+        return dict((k,toItem(v)) for k,v in item_fn())
+
+    def copy( self ):
+        """
+        Returns a new copy of a C{ParseResults} object.
+        """
+        ret = ParseResults( self.__toklist )
+        ret.__tokdict = self.__tokdict.copy()
+        ret.__parent = self.__parent
+        ret.__accumNames.update( self.__accumNames )
+        ret.__name = self.__name
+        return ret
+
+    def asXML( self, doctag=None, namedItemsOnly=False, indent="", formatted=True ):
+        """
+        (Deprecated) Returns the parse results as XML. Tags are created for tokens and lists that have defined results names.
+        """
+        nl = "\n"
+        out = []
+        namedItems = dict((v[1],k) for (k,vlist) in self.__tokdict.items()
+                                                            for v in vlist)
+        nextLevelIndent = indent + "  "
+
+        # collapse out indents if formatting is not desired
+        if not formatted:
+            indent = ""
+            nextLevelIndent = ""
+            nl = ""
+
+        selfTag = None
+        if doctag is not None:
+            selfTag = doctag
+        else:
+            if self.__name:
+                selfTag = self.__name
+
+        if not selfTag:
+            if namedItemsOnly:
+                return ""
+            else:
+                selfTag = "ITEM"
+
+        out += [ nl, indent, "<", selfTag, ">" ]
+
+        for i,res in enumerate(self.__toklist):
+            if isinstance(res,ParseResults):
+                if i in namedItems:
+                    out += [ res.asXML(namedItems[i],
+                                        namedItemsOnly and doctag is None,
+                                        nextLevelIndent,
+                                        formatted)]
+                else:
+                    out += [ res.asXML(None,
+                                        namedItemsOnly and doctag is None,
+                                        nextLevelIndent,
+                                        formatted)]
+            else:
+                # individual token, see if there is a name for it
+                resTag = None
+                if i in namedItems:
+                    resTag = namedItems[i]
+                if not resTag:
+                    if namedItemsOnly:
+                        continue
+                    else:
+                        resTag = "ITEM"
+                xmlBodyText = _xml_escape(_ustr(res))
+                out += [ nl, nextLevelIndent, "<", resTag, ">",
+                                                xmlBodyText,
+                                                "</", resTag, ">" ]
+
+        out += [ nl, indent, "</", selfTag, ">" ]
+        return "".join(out)
+
+    def __lookup(self,sub):
+        for k,vlist in self.__tokdict.items():
+            for v,loc in vlist:
+                if sub is v:
+                    return k
+        return None
+
+    def getName(self):
+        r"""
+        Returns the results name for this token expression. Useful when several 
+        different expressions might match at a particular location.
+
+        Example::
+            integer = Word(nums)
+            ssn_expr = Regex(r"\d\d\d-\d\d-\d\d\d\d")
+            house_number_expr = Suppress('#') + Word(nums, alphanums)
+            user_data = (Group(house_number_expr)("house_number") 
+                        | Group(ssn_expr)("ssn")
+                        | Group(integer)("age"))
+            user_info = OneOrMore(user_data)
+            
+            result = user_info.parseString("22 111-22-3333 #221B")
+            for item in result:
+                print(item.getName(), ':', item[0])
+        prints::
+            age : 22
+            ssn : 111-22-3333
+            house_number : 221B
+        """
+        if self.__name:
+            return self.__name
+        elif self.__parent:
+            par = self.__parent()
+            if par:
+                return par.__lookup(self)
+            else:
+                return None
+        elif (len(self) == 1 and
+               len(self.__tokdict) == 1 and
+               next(iter(self.__tokdict.values()))[0][1] in (0,-1)):
+            return next(iter(self.__tokdict.keys()))
+        else:
+            return None
+
+    def dump(self, indent='', depth=0, full=True):
+        """
+        Diagnostic method for listing out the contents of a C{ParseResults}.
+        Accepts an optional C{indent} argument so that this string can be embedded
+        in a nested display of other data.
+
+        Example::
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+            
+            result = date_str.parseString('12/31/1999')
+            print(result.dump())
+        prints::
+            ['12', '/', '31', '/', '1999']
+            - day: 1999
+            - month: 31
+            - year: 12
+        """
+        out = []
+        NL = '\n'
+        out.append( indent+_ustr(self.asList()) )
+        if full:
+            if self.haskeys():
+                items = sorted((str(k), v) for k,v in self.items())
+                for k,v in items:
+                    if out:
+                        out.append(NL)
+                    out.append( "%s%s- %s: " % (indent,('  '*depth), k) )
+                    if isinstance(v,ParseResults):
+                        if v:
+                            out.append( v.dump(indent,depth+1) )
+                        else:
+                            out.append(_ustr(v))
+                    else:
+                        out.append(repr(v))
+            elif any(isinstance(vv,ParseResults) for vv in self):
+                v = self
+                for i,vv in enumerate(v):
+                    if isinstance(vv,ParseResults):
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),vv.dump(indent,depth+1) ))
+                    else:
+                        out.append("\n%s%s[%d]:\n%s%s%s" % (indent,('  '*(depth)),i,indent,('  '*(depth+1)),_ustr(vv)))
+            
+        return "".join(out)
+
+    def pprint(self, *args, **kwargs):
+        """
+        Pretty-printer for parsed results as a list, using the C{pprint} module.
+        Accepts additional positional or keyword args as defined for the 
+        C{pprint.pprint} method. (U{http://docs.python.org/3/library/pprint.html#pprint.pprint})
+
+        Example::
+            ident = Word(alphas, alphanums)
+            num = Word(nums)
+            func = Forward()
+            term = ident | num | Group('(' + func + ')')
+            func <<= ident + Group(Optional(delimitedList(term)))
+            result = func.parseString("fna a,b,(fnb c,d,200),100")
+            result.pprint(width=40)
+        prints::
+            ['fna',
+             ['a',
+              'b',
+              ['(', 'fnb', ['c', 'd', '200'], ')'],
+              '100']]
+        """
+        pprint.pprint(self.asList(), *args, **kwargs)
+
+    # add support for pickle protocol
+    def __getstate__(self):
+        return ( self.__toklist,
+                 ( self.__tokdict.copy(),
+                   self.__parent is not None and self.__parent() or None,
+                   self.__accumNames,
+                   self.__name ) )
+
+    def __setstate__(self,state):
+        self.__toklist = state[0]
+        (self.__tokdict,
+         par,
+         inAccumNames,
+         self.__name) = state[1]
+        self.__accumNames = {}
+        self.__accumNames.update(inAccumNames)
+        if par is not None:
+            self.__parent = wkref(par)
+        else:
+            self.__parent = None
+
+    def __getnewargs__(self):
+        return self.__toklist, self.__name, self.__asList, self.__modal
+
+    def __dir__(self):
+        return (dir(type(self)) + list(self.keys()))
+
+MutableMapping.register(ParseResults)
+
+def col (loc,strg):
+    """Returns current column within a string, counting newlines as line separators.
+   The first column is number 1.
+
+   Note: the default parsing behavior is to expand tabs in the input string
+   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
+   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+   consistent view of the parsed string, the parse location, and line and column
+   positions within the parsed string.
+   """
+    s = strg
+    return 1 if 0<loc<len(s) and s[loc-1] == '\n' else loc - s.rfind("\n", 0, loc)
+
+def lineno(loc,strg):
+    """Returns current line number within a string, counting newlines as line separators.
+   The first line is number 1.
+
+   Note: the default parsing behavior is to expand tabs in the input string
+   before starting the parsing process.  See L{I{ParserElement.parseString}<ParserElement.parseString>} for more information
+   on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+   consistent view of the parsed string, the parse location, and line and column
+   positions within the parsed string.
+   """
+    return strg.count("\n",0,loc) + 1
+
+def line( loc, strg ):
+    """Returns the line of text containing loc within a string, counting newlines as line separators.
+       """
+    lastCR = strg.rfind("\n", 0, loc)
+    nextCR = strg.find("\n", loc)
+    if nextCR >= 0:
+        return strg[lastCR+1:nextCR]
+    else:
+        return strg[lastCR+1:]
+
+def _defaultStartDebugAction( instring, loc, expr ):
+    print (("Match " + _ustr(expr) + " at loc " + _ustr(loc) + "(%d,%d)" % ( lineno(loc,instring), col(loc,instring) )))
+
+def _defaultSuccessDebugAction( instring, startloc, endloc, expr, toks ):
+    print ("Matched " + _ustr(expr) + " -> " + str(toks.asList()))
+
+def _defaultExceptionDebugAction( instring, loc, expr, exc ):
+    print ("Exception raised:" + _ustr(exc))
+
+def nullDebugAction(*args):
+    """'Do-nothing' debug action, to suppress debugging output during parsing."""
+    pass
+
+# Only works on Python 3.x - nonlocal is toxic to Python 2 installs
+#~ 'decorator to trim function calls to match the arity of the target'
+#~ def _trim_arity(func, maxargs=3):
+    #~ if func in singleArgBuiltins:
+        #~ return lambda s,l,t: func(t)
+    #~ limit = 0
+    #~ foundArity = False
+    #~ def wrapper(*args):
+        #~ nonlocal limit,foundArity
+        #~ while 1:
+            #~ try:
+                #~ ret = func(*args[limit:])
+                #~ foundArity = True
+                #~ return ret
+            #~ except TypeError:
+                #~ if limit == maxargs or foundArity:
+                    #~ raise
+                #~ limit += 1
+                #~ continue
+    #~ return wrapper
+
+# this version is Python 2.x-3.x cross-compatible
+'decorator to trim function calls to match the arity of the target'
+def _trim_arity(func, maxargs=2):
+    if func in singleArgBuiltins:
+        return lambda s,l,t: func(t)
+    limit = [0]
+    foundArity = [False]
+    
+    # traceback return data structure changed in Py3.5 - normalize back to plain tuples
+    if system_version[:2] >= (3,5):
+        def extract_stack(limit=0):
+            # special handling for Python 3.5.0 - extra deep call stack by 1
+            offset = -3 if system_version == (3,5,0) else -2
+            frame_summary = traceback.extract_stack(limit=-offset+limit-1)[offset]
+            return [frame_summary[:2]]
+        def extract_tb(tb, limit=0):
+            frames = traceback.extract_tb(tb, limit=limit)
+            frame_summary = frames[-1]
+            return [frame_summary[:2]]
+    else:
+        extract_stack = traceback.extract_stack
+        extract_tb = traceback.extract_tb
+    
+    # synthesize what would be returned by traceback.extract_stack at the call to 
+    # user's parse action 'func', so that we don't incur call penalty at parse time
+    
+    LINE_DIFF = 6
+    # IF ANY CODE CHANGES, EVEN JUST COMMENTS OR BLANK LINES, BETWEEN THE NEXT LINE AND 
+    # THE CALL TO FUNC INSIDE WRAPPER, LINE_DIFF MUST BE MODIFIED!!!!
+    this_line = extract_stack(limit=2)[-1]
+    pa_call_line_synth = (this_line[0], this_line[1]+LINE_DIFF)
+
+    def wrapper(*args):
+        while 1:
+            try:
+                ret = func(*args[limit[0]:])
+                foundArity[0] = True
+                return ret
+            except TypeError:
+                # re-raise TypeErrors if they did not come from our arity testing
+                if foundArity[0]:
+                    raise
+                else:
+                    try:
+                        tb = sys.exc_info()[-1]
+                        if not extract_tb(tb, limit=2)[-1][:2] == pa_call_line_synth:
+                            raise
+                    finally:
+                        del tb
+
+                if limit[0] <= maxargs:
+                    limit[0] += 1
+                    continue
+                raise
+
+    # copy func name to wrapper for sensible debug output
+    func_name = "<parse action>"
+    try:
+        func_name = getattr(func, '__name__', 
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    wrapper.__name__ = func_name
+
+    return wrapper
+
+class ParserElement(object):
+    """Abstract base level parser element class."""
+    DEFAULT_WHITE_CHARS = " \n\t\r"
+    verbose_stacktrace = False
+
+    @staticmethod
+    def setDefaultWhitespaceChars( chars ):
+        r"""
+        Overrides the default whitespace chars
+
+        Example::
+            # default whitespace chars are space, <TAB> and newline
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def', 'ghi', 'jkl']
+            
+            # change to just treat newline as significant
+            ParserElement.setDefaultWhitespaceChars(" \t")
+            OneOrMore(Word(alphas)).parseString("abc def\nghi jkl")  # -> ['abc', 'def']
+        """
+        ParserElement.DEFAULT_WHITE_CHARS = chars
+
+    @staticmethod
+    def inlineLiteralsUsing(cls):
+        """
+        Set class to be used for inclusion of string literals into a parser.
+        
+        Example::
+            # default literal class used is Literal
+            integer = Word(nums)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+
+            # change to Suppress
+            ParserElement.inlineLiteralsUsing(Suppress)
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")           
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '12', '31']
+        """
+        ParserElement._literalStringClass = cls
+
+    def __init__( self, savelist=False ):
+        self.parseAction = list()
+        self.failAction = None
+        #~ self.name = "<unknown>"  # don't define self.name, let subclasses try/except upcall
+        self.strRepr = None
+        self.resultsName = None
+        self.saveAsList = savelist
+        self.skipWhitespace = True
+        self.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
+        self.copyDefaultWhiteChars = True
+        self.mayReturnEmpty = False # used when checking for left-recursion
+        self.keepTabs = False
+        self.ignoreExprs = list()
+        self.debug = False
+        self.streamlined = False
+        self.mayIndexError = True # used to optimize exception handling for subclasses that don't advance parse index
+        self.errmsg = ""
+        self.modalResults = True # used to mark results names as modal (report only last) or cumulative (list all)
+        self.debugActions = ( None, None, None ) #custom debug actions
+        self.re = None
+        self.callPreparse = True # used to avoid redundant calls to preParse
+        self.callDuringTry = False
+
+    def copy( self ):
+        """
+        Make a copy of this C{ParserElement}.  Useful for defining different parse actions
+        for the same parsing pattern, using copies of the original parse element.
+        
+        Example::
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            integerK = integer.copy().addParseAction(lambda toks: toks[0]*1024) + Suppress("K")
+            integerM = integer.copy().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
+            
+            print(OneOrMore(integerK | integerM | integer).parseString("5K 100 640K 256M"))
+        prints::
+            [5120, 100, 655360, 268435456]
+        Equivalent form of C{expr.copy()} is just C{expr()}::
+            integerM = integer().addParseAction(lambda toks: toks[0]*1024*1024) + Suppress("M")
+        """
+        cpy = copy.copy( self )
+        cpy.parseAction = self.parseAction[:]
+        cpy.ignoreExprs = self.ignoreExprs[:]
+        if self.copyDefaultWhiteChars:
+            cpy.whiteChars = ParserElement.DEFAULT_WHITE_CHARS
+        return cpy
+
+    def setName( self, name ):
+        """
+        Define name for this expression, makes debugging and exception messages clearer.
+        
+        Example::
+            Word(nums).parseString("ABC")  # -> Exception: Expected W:(0123...) (at char 0), (line:1, col:1)
+            Word(nums).setName("integer").parseString("ABC")  # -> Exception: Expected integer (at char 0), (line:1, col:1)
+        """
+        self.name = name
+        self.errmsg = "Expected " + self.name
+        if hasattr(self,"exception"):
+            self.exception.msg = self.errmsg
+        return self
+
+    def setResultsName( self, name, listAllMatches=False ):
+        """
+        Define name for referencing matching tokens as a nested attribute
+        of the returned parse results.
+        NOTE: this returns a *copy* of the original C{ParserElement} object;
+        this is so that the client can define a basic element, such as an
+        integer, and reference it in multiple places with different names.
+
+        You can also set results names using the abbreviated syntax,
+        C{expr("name")} in place of C{expr.setResultsName("name")} - 
+        see L{I{__call__}<__call__>}.
+
+        Example::
+            date_str = (integer.setResultsName("year") + '/' 
+                        + integer.setResultsName("month") + '/' 
+                        + integer.setResultsName("day"))
+
+            # equivalent form:
+            date_str = integer("year") + '/' + integer("month") + '/' + integer("day")
+        """
+        newself = self.copy()
+        if name.endswith("*"):
+            name = name[:-1]
+            listAllMatches=True
+        newself.resultsName = name
+        newself.modalResults = not listAllMatches
+        return newself
+
+    def setBreak(self,breakFlag = True):
+        """Method to invoke the Python pdb debugger when this element is
+           about to be parsed. Set C{breakFlag} to True to enable, False to
+           disable.
+        """
+        if breakFlag:
+            _parseMethod = self._parse
+            def breaker(instring, loc, doActions=True, callPreParse=True):
+                import pdb
+                pdb.set_trace()
+                return _parseMethod( instring, loc, doActions, callPreParse )
+            breaker._originalParseMethod = _parseMethod
+            self._parse = breaker
+        else:
+            if hasattr(self._parse,"_originalParseMethod"):
+                self._parse = self._parse._originalParseMethod
+        return self
+
+    def setParseAction( self, *fns, **kwargs ):
+        """
+        Define one or more actions to perform when successfully matching parse element definition.
+        Parse action fn is a callable method with 0-3 arguments, called as C{fn(s,loc,toks)},
+        C{fn(loc,toks)}, C{fn(toks)}, or just C{fn()}, where:
+         - s   = the original string being parsed (see note below)
+         - loc = the location of the matching substring
+         - toks = a list of the matched tokens, packaged as a C{L{ParseResults}} object
+        If the functions in fns modify the tokens, they can return them as the return
+        value from fn, and the modified list of tokens will replace the original.
+        Otherwise, fn does not need to return any value.
+
+        Optional keyword arguments:
+         - callDuringTry = (default=C{False}) indicate if parse action should be run during lookaheads and alternate testing
+
+        Note: the default parsing behavior is to expand tabs in the input string
+        before starting the parsing process.  See L{I{parseString}<parseString>} for more information
+        on parsing strings containing C{<TAB>}s, and suggested methods to maintain a
+        consistent view of the parsed string, the parse location, and line and column
+        positions within the parsed string.
+        
+        Example::
+            integer = Word(nums)
+            date_str = integer + '/' + integer + '/' + integer
+
+            date_str.parseString("1999/12/31")  # -> ['1999', '/', '12', '/', '31']
+
+            # use parse action to convert to ints at parse time
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            date_str = integer + '/' + integer + '/' + integer
+
+            # note that integer fields are now ints, not strings
+            date_str.parseString("1999/12/31")  # -> [1999, '/', 12, '/', 31]
+        """
+        self.parseAction = list(map(_trim_arity, list(fns)))
+        self.callDuringTry = kwargs.get("callDuringTry", False)
+        return self
+
+    def addParseAction( self, *fns, **kwargs ):
+        """
+        Add one or more parse actions to expression's list of parse actions. See L{I{setParseAction}<setParseAction>}.
+        
+        See examples in L{I{copy}<copy>}.
+        """
+        self.parseAction += list(map(_trim_arity, list(fns)))
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def addCondition(self, *fns, **kwargs):
+        """Add a boolean predicate function to expression's list of parse actions. See 
+        L{I{setParseAction}<setParseAction>} for function call signatures. Unlike C{setParseAction}, 
+        functions passed to C{addCondition} need to return boolean success/fail of the condition.
+
+        Optional keyword arguments:
+         - message = define a custom message to be used in the raised exception
+         - fatal   = if True, will raise ParseFatalException to stop parsing immediately; otherwise will raise ParseException
+         
+        Example::
+            integer = Word(nums).setParseAction(lambda toks: int(toks[0]))
+            year_int = integer.copy()
+            year_int.addCondition(lambda toks: toks[0] >= 2000, message="Only support years 2000 and later")
+            date_str = year_int + '/' + integer + '/' + integer
+
+            result = date_str.parseString("1999/12/31")  # -> Exception: Only support years 2000 and later (at char 0), (line:1, col:1)
+        """
+        msg = kwargs.get("message", "failed user-defined condition")
+        exc_type = ParseFatalException if kwargs.get("fatal", False) else ParseException
+        for fn in fns:
+            def pa(s,l,t):
+                if not bool(_trim_arity(fn)(s,l,t)):
+                    raise exc_type(s,l,msg)
+            self.parseAction.append(pa)
+        self.callDuringTry = self.callDuringTry or kwargs.get("callDuringTry", False)
+        return self
+
+    def setFailAction( self, fn ):
+        """Define action to perform if parsing fails at this expression.
+           Fail acton fn is a callable function that takes the arguments
+           C{fn(s,loc,expr,err)} where:
+            - s = string being parsed
+            - loc = location where expression match was attempted and failed
+            - expr = the parse expression that failed
+            - err = the exception thrown
+           The function returns no value.  It may throw C{L{ParseFatalException}}
+           if it is desired to stop parsing immediately."""
+        self.failAction = fn
+        return self
+
+    def _skipIgnorables( self, instring, loc ):
+        exprsFound = True
+        while exprsFound:
+            exprsFound = False
+            for e in self.ignoreExprs:
+                try:
+                    while 1:
+                        loc,dummy = e._parse( instring, loc )
+                        exprsFound = True
+                except ParseException:
+                    pass
+        return loc
+
+    def preParse( self, instring, loc ):
+        if self.ignoreExprs:
+            loc = self._skipIgnorables( instring, loc )
+
+        if self.skipWhitespace:
+            wt = self.whiteChars
+            instrlen = len(instring)
+            while loc < instrlen and instring[loc] in wt:
+                loc += 1
+
+        return loc
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        return loc, []
+
+    def postParse( self, instring, loc, tokenlist ):
+        return tokenlist
+
+    #~ @profile
+    def _parseNoCache( self, instring, loc, doActions=True, callPreParse=True ):
+        debugging = ( self.debug ) #and doActions )
+
+        if debugging or self.failAction:
+            #~ print ("Match",self,"at loc",loc,"(%d,%d)" % ( lineno(loc,instring), col(loc,instring) ))
+            if (self.debugActions[0] ):
+                self.debugActions[0]( instring, loc, self )
+            if callPreParse and self.callPreparse:
+                preloc = self.preParse( instring, loc )
+            else:
+                preloc = loc
+            tokensStart = preloc
+            try:
+                try:
+                    loc,tokens = self.parseImpl( instring, preloc, doActions )
+                except IndexError:
+                    raise ParseException( instring, len(instring), self.errmsg, self )
+            except ParseBaseException as err:
+                #~ print ("Exception raised:", err)
+                if self.debugActions[2]:
+                    self.debugActions[2]( instring, tokensStart, self, err )
+                if self.failAction:
+                    self.failAction( instring, tokensStart, self, err )
+                raise
+        else:
+            if callPreParse and self.callPreparse:
+                preloc = self.preParse( instring, loc )
+            else:
+                preloc = loc
+            tokensStart = preloc
+            if self.mayIndexError or preloc >= len(instring):
+                try:
+                    loc,tokens = self.parseImpl( instring, preloc, doActions )
+                except IndexError:
+                    raise ParseException( instring, len(instring), self.errmsg, self )
+            else:
+                loc,tokens = self.parseImpl( instring, preloc, doActions )
+
+        tokens = self.postParse( instring, loc, tokens )
+
+        retTokens = ParseResults( tokens, self.resultsName, asList=self.saveAsList, modal=self.modalResults )
+        if self.parseAction and (doActions or self.callDuringTry):
+            if debugging:
+                try:
+                    for fn in self.parseAction:
+                        tokens = fn( instring, tokensStart, retTokens )
+                        if tokens is not None:
+                            retTokens = ParseResults( tokens,
+                                                      self.resultsName,
+                                                      asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
+                                                      modal=self.modalResults )
+                except ParseBaseException as err:
+                    #~ print "Exception raised in user parse action:", err
+                    if (self.debugActions[2] ):
+                        self.debugActions[2]( instring, tokensStart, self, err )
+                    raise
+            else:
+                for fn in self.parseAction:
+                    tokens = fn( instring, tokensStart, retTokens )
+                    if tokens is not None:
+                        retTokens = ParseResults( tokens,
+                                                  self.resultsName,
+                                                  asList=self.saveAsList and isinstance(tokens,(ParseResults,list)),
+                                                  modal=self.modalResults )
+        if debugging:
+            #~ print ("Matched",self,"->",retTokens.asList())
+            if (self.debugActions[1] ):
+                self.debugActions[1]( instring, tokensStart, loc, self, retTokens )
+
+        return loc, retTokens
+
+    def tryParse( self, instring, loc ):
+        try:
+            return self._parse( instring, loc, doActions=False )[0]
+        except ParseFatalException:
+            raise ParseException( instring, loc, self.errmsg, self)
+    
+    def canParseNext(self, instring, loc):
+        try:
+            self.tryParse(instring, loc)
+        except (ParseException, IndexError):
+            return False
+        else:
+            return True
+
+    class _UnboundedCache(object):
+        def __init__(self):
+            cache = {}
+            self.not_in_cache = not_in_cache = object()
+
+            def get(self, key):
+                return cache.get(key, not_in_cache)
+
+            def set(self, key, value):
+                cache[key] = value
+
+            def clear(self):
+                cache.clear()
+                
+            def cache_len(self):
+                return len(cache)
+
+            self.get = types.MethodType(get, self)
+            self.set = types.MethodType(set, self)
+            self.clear = types.MethodType(clear, self)
+            self.__len__ = types.MethodType(cache_len, self)
+
+    if _OrderedDict is not None:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = _OrderedDict()
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(cache) > size:
+                        try:
+                            cache.popitem(False)
+                        except KeyError:
+                            pass
+
+                def clear(self):
+                    cache.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    else:
+        class _FifoCache(object):
+            def __init__(self, size):
+                self.not_in_cache = not_in_cache = object()
+
+                cache = {}
+                key_fifo = collections.deque([], size)
+
+                def get(self, key):
+                    return cache.get(key, not_in_cache)
+
+                def set(self, key, value):
+                    cache[key] = value
+                    while len(key_fifo) > size:
+                        cache.pop(key_fifo.popleft(), None)
+                    key_fifo.append(key)
+
+                def clear(self):
+                    cache.clear()
+                    key_fifo.clear()
+
+                def cache_len(self):
+                    return len(cache)
+
+                self.get = types.MethodType(get, self)
+                self.set = types.MethodType(set, self)
+                self.clear = types.MethodType(clear, self)
+                self.__len__ = types.MethodType(cache_len, self)
+
+    # argument cache for optimizing repeated calls when backtracking through recursive expressions
+    packrat_cache = {} # this is set later by enabledPackrat(); this is here so that resetCache() doesn't fail
+    packrat_cache_lock = RLock()
+    packrat_cache_stats = [0, 0]
+
+    # this method gets repeatedly called during backtracking with the same arguments -
+    # we can cache these arguments and save ourselves the trouble of re-parsing the contained expression
+    def _parseCache( self, instring, loc, doActions=True, callPreParse=True ):
+        HIT, MISS = 0, 1
+        lookup = (self, instring, loc, callPreParse, doActions)
+        with ParserElement.packrat_cache_lock:
+            cache = ParserElement.packrat_cache
+            value = cache.get(lookup)
+            if value is cache.not_in_cache:
+                ParserElement.packrat_cache_stats[MISS] += 1
+                try:
+                    value = self._parseNoCache(instring, loc, doActions, callPreParse)
+                except ParseBaseException as pe:
+                    # cache a copy of the exception, without the traceback
+                    cache.set(lookup, pe.__class__(*pe.args))
+                    raise
+                else:
+                    cache.set(lookup, (value[0], value[1].copy()))
+                    return value
+            else:
+                ParserElement.packrat_cache_stats[HIT] += 1
+                if isinstance(value, Exception):
+                    raise value
+                return (value[0], value[1].copy())
+
+    _parse = _parseNoCache
+
+    @staticmethod
+    def resetCache():
+        ParserElement.packrat_cache.clear()
+        ParserElement.packrat_cache_stats[:] = [0] * len(ParserElement.packrat_cache_stats)
+
+    _packratEnabled = False
+    @staticmethod
+    def enablePackrat(cache_size_limit=128):
+        """Enables "packrat" parsing, which adds memoizing to the parsing logic.
+           Repeated parse attempts at the same string location (which happens
+           often in many complex grammars) can immediately return a cached value,
+           instead of re-executing parsing/validating code.  Memoizing is done of
+           both valid results and parsing exceptions.
+           
+           Parameters:
+            - cache_size_limit - (default=C{128}) - if an integer value is provided
+              will limit the size of the packrat cache; if None is passed, then
+              the cache size will be unbounded; if 0 is passed, the cache will
+              be effectively disabled.
+            
+           This speedup may break existing programs that use parse actions that
+           have side-effects.  For this reason, packrat parsing is disabled when
+           you first import pyparsing.  To activate the packrat feature, your
+           program must call the class method C{ParserElement.enablePackrat()}.  If
+           your program uses C{psyco} to "compile as you go", you must call
+           C{enablePackrat} before calling C{psyco.full()}.  If you do not do this,
+           Python will crash.  For best results, call C{enablePackrat()} immediately
+           after importing pyparsing.
+           
+           Example::
+               import pyparsing
+               pyparsing.ParserElement.enablePackrat()
+        """
+        if not ParserElement._packratEnabled:
+            ParserElement._packratEnabled = True
+            if cache_size_limit is None:
+                ParserElement.packrat_cache = ParserElement._UnboundedCache()
+            else:
+                ParserElement.packrat_cache = ParserElement._FifoCache(cache_size_limit)
+            ParserElement._parse = ParserElement._parseCache
+
+    def parseString( self, instring, parseAll=False ):
+        """
+        Execute the parse expression with the given string.
+        This is the main interface to the client code, once the complete
+        expression has been built.
+
+        If you want the grammar to require that the entire input string be
+        successfully parsed, then set C{parseAll} to True (equivalent to ending
+        the grammar with C{L{StringEnd()}}).
+
+        Note: C{parseString} implicitly calls C{expandtabs()} on the input string,
+        in order to report proper column numbers in parse actions.
+        If the input string contains tabs and
+        the grammar uses parse actions that use the C{loc} argument to index into the
+        string being parsed, you can ensure you have a consistent view of the input
+        string by:
+         - calling C{parseWithTabs} on your grammar before calling C{parseString}
+           (see L{I{parseWithTabs}<parseWithTabs>})
+         - define your parse action using the full C{(s,loc,toks)} signature, and
+           reference the input string using the parse action's C{s} argument
+         - explictly expand the tabs in your input string before calling
+           C{parseString}
+        
+        Example::
+            Word('a').parseString('aaaaabaaa')  # -> ['aaaaa']
+            Word('a').parseString('aaaaabaaa', parseAll=True)  # -> Exception: Expected end of text
+        """
+        ParserElement.resetCache()
+        if not self.streamlined:
+            self.streamline()
+            #~ self.saveAsList = True
+        for e in self.ignoreExprs:
+            e.streamline()
+        if not self.keepTabs:
+            instring = instring.expandtabs()
+        try:
+            loc, tokens = self._parse( instring, 0 )
+            if parseAll:
+                loc = self.preParse( instring, loc )
+                se = Empty() + StringEnd()
+                se._parse( instring, loc )
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+        else:
+            return tokens
+
+    def scanString( self, instring, maxMatches=_MAX_INT, overlap=False ):
+        """
+        Scan the input string for expression matches.  Each match will return the
+        matching tokens, start location, and end location.  May be called with optional
+        C{maxMatches} argument, to clip scanning after 'n' matches are found.  If
+        C{overlap} is specified, then overlapping matches will be reported.
+
+        Note that the start and end locations are reported relative to the string
+        being parsed.  See L{I{parseString}<parseString>} for more information on parsing
+        strings with embedded tabs.
+
+        Example::
+            source = "sldjf123lsdjjkf345sldkjf879lkjsfd987"
+            print(source)
+            for tokens,start,end in Word(alphas).scanString(source):
+                print(' '*start + '^'*(end-start))
+                print(' '*start + tokens[0])
+        
+        prints::
+        
+            sldjf123lsdjjkf345sldkjf879lkjsfd987
+            ^^^^^
+            sldjf
+                    ^^^^^^^
+                    lsdjjkf
+                              ^^^^^^
+                              sldkjf
+                                       ^^^^^^
+                                       lkjsfd
+        """
+        if not self.streamlined:
+            self.streamline()
+        for e in self.ignoreExprs:
+            e.streamline()
+
+        if not self.keepTabs:
+            instring = _ustr(instring).expandtabs()
+        instrlen = len(instring)
+        loc = 0
+        preparseFn = self.preParse
+        parseFn = self._parse
+        ParserElement.resetCache()
+        matches = 0
+        try:
+            while loc <= instrlen and matches < maxMatches:
+                try:
+                    preloc = preparseFn( instring, loc )
+                    nextLoc,tokens = parseFn( instring, preloc, callPreParse=False )
+                except ParseException:
+                    loc = preloc+1
+                else:
+                    if nextLoc > loc:
+                        matches += 1
+                        yield tokens, preloc, nextLoc
+                        if overlap:
+                            nextloc = preparseFn( instring, loc )
+                            if nextloc > loc:
+                                loc = nextLoc
+                            else:
+                                loc += 1
+                        else:
+                            loc = nextLoc
+                    else:
+                        loc = preloc+1
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def transformString( self, instring ):
+        """
+        Extension to C{L{scanString}}, to modify matching text with modified tokens that may
+        be returned from a parse action.  To use C{transformString}, define a grammar and
+        attach a parse action to it that modifies the returned token list.
+        Invoking C{transformString()} on a target string will then scan for matches,
+        and replace the matched text patterns according to the logic in the parse
+        action.  C{transformString()} returns the resulting transformed string.
+        
+        Example::
+            wd = Word(alphas)
+            wd.setParseAction(lambda toks: toks[0].title())
+            
+            print(wd.transformString("now is the winter of our discontent made glorious summer by this sun of york."))
+        Prints::
+            Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York.
+        """
+        out = []
+        lastE = 0
+        # force preservation of <TAB>s, to minimize unwanted transformation of string, and to
+        # keep string locs straight between transformString and scanString
+        self.keepTabs = True
+        try:
+            for t,s,e in self.scanString( instring ):
+                out.append( instring[lastE:s] )
+                if t:
+                    if isinstance(t,ParseResults):
+                        out += t.asList()
+                    elif isinstance(t,list):
+                        out += t
+                    else:
+                        out.append(t)
+                lastE = e
+            out.append(instring[lastE:])
+            out = [o for o in out if o]
+            return "".join(map(_ustr,_flatten(out)))
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def searchString( self, instring, maxMatches=_MAX_INT ):
+        """
+        Another extension to C{L{scanString}}, simplifying the access to the tokens found
+        to match the given parse expression.  May be called with optional
+        C{maxMatches} argument, to clip searching after 'n' matches are found.
+        
+        Example::
+            # a capitalized word starts with an uppercase letter, followed by zero or more lowercase letters
+            cap_word = Word(alphas.upper(), alphas.lower())
+            
+            print(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity"))
+
+            # the sum() builtin can be used to merge results into a single ParseResults object
+            print(sum(cap_word.searchString("More than Iron, more than Lead, more than Gold I need Electricity")))
+        prints::
+            [['More'], ['Iron'], ['Lead'], ['Gold'], ['I'], ['Electricity']]
+            ['More', 'Iron', 'Lead', 'Gold', 'I', 'Electricity']
+        """
+        try:
+            return ParseResults([ t for t,s,e in self.scanString( instring, maxMatches ) ])
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def split(self, instring, maxsplit=_MAX_INT, includeSeparators=False):
+        """
+        Generator method to split a string using the given expression as a separator.
+        May be called with optional C{maxsplit} argument, to limit the number of splits;
+        and the optional C{includeSeparators} argument (default=C{False}), if the separating
+        matching text should be included in the split results.
+        
+        Example::        
+            punc = oneOf(list(".,;:/-!?"))
+            print(list(punc.split("This, this?, this sentence, is badly punctuated!")))
+        prints::
+            ['This', ' this', '', ' this sentence', ' is badly punctuated', '']
+        """
+        splits = 0
+        last = 0
+        for t,s,e in self.scanString(instring, maxMatches=maxsplit):
+            yield instring[last:s]
+            if includeSeparators:
+                yield t[0]
+            last = e
+        yield instring[last:]
+
+    def __add__(self, other ):
+        """
+        Implementation of + operator - returns C{L{And}}. Adding strings to a ParserElement
+        converts them to L{Literal}s by default.
+        
+        Example::
+            greet = Word(alphas) + "," + Word(alphas) + "!"
+            hello = "Hello, World!"
+            print (hello, "->", greet.parseString(hello))
+        Prints::
+            Hello, World! -> ['Hello', ',', 'World', '!']
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return And( [ self, other ] )
+
+    def __radd__(self, other ):
+        """
+        Implementation of + operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other + self
+
+    def __sub__(self, other):
+        """
+        Implementation of - operator, returns C{L{And}} with error stop
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return self + And._ErrorStop() + other
+
+    def __rsub__(self, other ):
+        """
+        Implementation of - operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other - self
+
+    def __mul__(self,other):
+        """
+        Implementation of * operator, allows use of C{expr * 3} in place of
+        C{expr + expr + expr}.  Expressions may also me multiplied by a 2-integer
+        tuple, similar to C{{min,max}} multipliers in regular expressions.  Tuples
+        may also include C{None} as in:
+         - C{expr*(n,None)} or C{expr*(n,)} is equivalent
+              to C{expr*n + L{ZeroOrMore}(expr)}
+              (read as "at least n instances of C{expr}")
+         - C{expr*(None,n)} is equivalent to C{expr*(0,n)}
+              (read as "0 to n instances of C{expr}")
+         - C{expr*(None,None)} is equivalent to C{L{ZeroOrMore}(expr)}
+         - C{expr*(1,None)} is equivalent to C{L{OneOrMore}(expr)}
+
+        Note that C{expr*(None,n)} does not raise an exception if
+        more than n exprs exist in the input stream; that is,
+        C{expr*(None,n)} does not enforce a maximum number of expr
+        occurrences.  If this behavior is desired, then write
+        C{expr*(None,n) + ~expr}
+        """
+        if isinstance(other,int):
+            minElements, optElements = other,0
+        elif isinstance(other,tuple):
+            other = (other + (None, None))[:2]
+            if other[0] is None:
+                other = (0, other[1])
+            if isinstance(other[0],int) and other[1] is None:
+                if other[0] == 0:
+                    return ZeroOrMore(self)
+                if other[0] == 1:
+                    return OneOrMore(self)
+                else:
+                    return self*other[0] + ZeroOrMore(self)
+            elif isinstance(other[0],int) and isinstance(other[1],int):
+                minElements, optElements = other
+                optElements -= minElements
+            else:
+                raise TypeError("cannot multiply 'ParserElement' and ('%s','%s') objects", type(other[0]),type(other[1]))
+        else:
+            raise TypeError("cannot multiply 'ParserElement' and '%s' objects", type(other))
+
+        if minElements < 0:
+            raise ValueError("cannot multiply ParserElement by negative value")
+        if optElements < 0:
+            raise ValueError("second tuple value must be greater or equal to first tuple value")
+        if minElements == optElements == 0:
+            raise ValueError("cannot multiply ParserElement by 0 or (0,0)")
+
+        if (optElements):
+            def makeOptionalList(n):
+                if n>1:
+                    return Optional(self + makeOptionalList(n-1))
+                else:
+                    return Optional(self)
+            if minElements:
+                if minElements == 1:
+                    ret = self + makeOptionalList(optElements)
+                else:
+                    ret = And([self]*minElements) + makeOptionalList(optElements)
+            else:
+                ret = makeOptionalList(optElements)
+        else:
+            if minElements == 1:
+                ret = self
+            else:
+                ret = And([self]*minElements)
+        return ret
+
+    def __rmul__(self, other):
+        return self.__mul__(other)
+
+    def __or__(self, other ):
+        """
+        Implementation of | operator - returns C{L{MatchFirst}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return MatchFirst( [ self, other ] )
+
+    def __ror__(self, other ):
+        """
+        Implementation of | operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other | self
+
+    def __xor__(self, other ):
+        """
+        Implementation of ^ operator - returns C{L{Or}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return Or( [ self, other ] )
+
+    def __rxor__(self, other ):
+        """
+        Implementation of ^ operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other ^ self
+
+    def __and__(self, other ):
+        """
+        Implementation of & operator - returns C{L{Each}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return Each( [ self, other ] )
+
+    def __rand__(self, other ):
+        """
+        Implementation of & operator when left operand is not a C{L{ParserElement}}
+        """
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        if not isinstance( other, ParserElement ):
+            warnings.warn("Cannot combine element of type %s with ParserElement" % type(other),
+                    SyntaxWarning, stacklevel=2)
+            return None
+        return other & self
+
+    def __invert__( self ):
+        """
+        Implementation of ~ operator - returns C{L{NotAny}}
+        """
+        return NotAny( self )
+
+    def __call__(self, name=None):
+        """
+        Shortcut for C{L{setResultsName}}, with C{listAllMatches=False}.
+        
+        If C{name} is given with a trailing C{'*'} character, then C{listAllMatches} will be
+        passed as C{True}.
+           
+        If C{name} is omitted, same as calling C{L{copy}}.
+
+        Example::
+            # these are equivalent
+            userdata = Word(alphas).setResultsName("name") + Word(nums+"-").setResultsName("socsecno")
+            userdata = Word(alphas)("name") + Word(nums+"-")("socsecno")             
+        """
+        if name is not None:
+            return self.setResultsName(name)
+        else:
+            return self.copy()
+
+    def suppress( self ):
+        """
+        Suppresses the output of this C{ParserElement}; useful to keep punctuation from
+        cluttering up returned output.
+        """
+        return Suppress( self )
+
+    def leaveWhitespace( self ):
+        """
+        Disables the skipping of whitespace before matching the characters in the
+        C{ParserElement}'s defined pattern.  This is normally only used internally by
+        the pyparsing module, but may be needed in some whitespace-sensitive grammars.
+        """
+        self.skipWhitespace = False
+        return self
+
+    def setWhitespaceChars( self, chars ):
+        """
+        Overrides the default whitespace chars
+        """
+        self.skipWhitespace = True
+        self.whiteChars = chars
+        self.copyDefaultWhiteChars = False
+        return self
+
+    def parseWithTabs( self ):
+        """
+        Overrides default behavior to expand C{<TAB>}s to spaces before parsing the input string.
+        Must be called before C{parseString} when the input grammar contains elements that
+        match C{<TAB>} characters.
+        """
+        self.keepTabs = True
+        return self
+
+    def ignore( self, other ):
+        """
+        Define expression to be ignored (e.g., comments) while doing pattern
+        matching; may be called repeatedly, to define multiple comment or other
+        ignorable patterns.
+        
+        Example::
+            patt = OneOrMore(Word(alphas))
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj']
+            
+            patt.ignore(cStyleComment)
+            patt.parseString('ablaj /* comment */ lskjd') # -> ['ablaj', 'lskjd']
+        """
+        if isinstance(other, basestring):
+            other = Suppress(other)
+
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                self.ignoreExprs.append(other)
+        else:
+            self.ignoreExprs.append( Suppress( other.copy() ) )
+        return self
+
+    def setDebugActions( self, startAction, successAction, exceptionAction ):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        """
+        self.debugActions = (startAction or _defaultStartDebugAction,
+                             successAction or _defaultSuccessDebugAction,
+                             exceptionAction or _defaultExceptionDebugAction)
+        self.debug = True
+        return self
+
+    def setDebug( self, flag=True ):
+        """
+        Enable display of debugging messages while doing pattern matching.
+        Set C{flag} to True to enable, False to disable.
+
+        Example::
+            wd = Word(alphas).setName("alphaword")
+            integer = Word(nums).setName("numword")
+            term = wd | integer
+            
+            # turn on debugging for wd
+            wd.setDebug()
+
+            OneOrMore(term).parseString("abc 123 xyz 890")
+        
+        prints::
+            Match alphaword at loc 0(1,1)
+            Matched alphaword -> ['abc']
+            Match alphaword at loc 3(1,4)
+            Exception raised:Expected alphaword (at char 4), (line:1, col:5)
+            Match alphaword at loc 7(1,8)
+            Matched alphaword -> ['xyz']
+            Match alphaword at loc 11(1,12)
+            Exception raised:Expected alphaword (at char 12), (line:1, col:13)
+            Match alphaword at loc 15(1,16)
+            Exception raised:Expected alphaword (at char 15), (line:1, col:16)
+
+        The output shown is that produced by the default debug actions - custom debug actions can be
+        specified using L{setDebugActions}. Prior to attempting
+        to match the C{wd} expression, the debugging message C{"Match <exprname> at loc <n>(<line>,<col>)"}
+        is shown. Then if the parse succeeds, a C{"Matched"} message is shown, or an C{"Exception raised"}
+        message is shown. Also note the use of L{setName} to assign a human-readable name to the expression,
+        which makes debugging and exception messages easier to understand - for instance, the default
+        name created for the C{Word} expression without calling C{setName} is C{"W:(ABCD...)"}.
+        """
+        if flag:
+            self.setDebugActions( _defaultStartDebugAction, _defaultSuccessDebugAction, _defaultExceptionDebugAction )
+        else:
+            self.debug = False
+        return self
+
+    def __str__( self ):
+        return self.name
+
+    def __repr__( self ):
+        return _ustr(self)
+
+    def streamline( self ):
+        self.streamlined = True
+        self.strRepr = None
+        return self
+
+    def checkRecursion( self, parseElementList ):
+        pass
+
+    def validate( self, validateTrace=[] ):
+        """
+        Check defined expressions for valid structure, check for infinite recursive definitions.
+        """
+        self.checkRecursion( [] )
+
+    def parseFile( self, file_or_filename, parseAll=False ):
+        """
+        Execute the parse expression on the given file or filename.
+        If a filename is specified (instead of a file object),
+        the entire file is opened, read, and closed before parsing.
+        """
+        try:
+            file_contents = file_or_filename.read()
+        except AttributeError:
+            with open(file_or_filename, "r") as f:
+                file_contents = f.read()
+        try:
+            return self.parseString(file_contents, parseAll)
+        except ParseBaseException as exc:
+            if ParserElement.verbose_stacktrace:
+                raise
+            else:
+                # catch and re-raise exception from here, clears out pyparsing internal stack trace
+                raise exc
+
+    def __eq__(self,other):
+        if isinstance(other, ParserElement):
+            return self is other or vars(self) == vars(other)
+        elif isinstance(other, basestring):
+            return self.matches(other)
+        else:
+            return super(ParserElement,self)==other
+
+    def __ne__(self,other):
+        return not (self == other)
+
+    def __hash__(self):
+        return hash(id(self))
+
+    def __req__(self,other):
+        return self == other
+
+    def __rne__(self,other):
+        return not (self == other)
+
+    def matches(self, testString, parseAll=True):
+        """
+        Method for quick testing of a parser against a test string. Good for simple 
+        inline microtests of sub expressions while building up larger parser.
+           
+        Parameters:
+         - testString - to test against this expression for a match
+         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests
+            
+        Example::
+            expr = Word(nums)
+            assert expr.matches("100")
+        """
+        try:
+            self.parseString(_ustr(testString), parseAll=parseAll)
+            return True
+        except ParseBaseException:
+            return False
+                
+    def runTests(self, tests, parseAll=True, comment='#', fullDump=True, printResults=True, failureTests=False):
+        """
+        Execute the parse expression on a series of test strings, showing each
+        test, the parsed results or where the parse failed. Quick and easy way to
+        run a parse expression against a list of sample strings.
+           
+        Parameters:
+         - tests - a list of separate test strings, or a multiline string of test strings
+         - parseAll - (default=C{True}) - flag to pass to C{L{parseString}} when running tests           
+         - comment - (default=C{'#'}) - expression for indicating embedded comments in the test 
+              string; pass None to disable comment filtering
+         - fullDump - (default=C{True}) - dump results as list followed by results names in nested outline;
+              if False, only dump nested list
+         - printResults - (default=C{True}) prints test output to stdout
+         - failureTests - (default=C{False}) indicates if these tests are expected to fail parsing
+
+        Returns: a (success, results) tuple, where success indicates that all tests succeeded
+        (or failed if C{failureTests} is True), and the results contain a list of lines of each 
+        test's output
+        
+        Example::
+            number_expr = pyparsing_common.number.copy()
+
+            result = number_expr.runTests('''
+                # unsigned integer
+                100
+                # negative integer
+                -100
+                # float with scientific notation
+                6.02e23
+                # integer with scientific notation
+                1e-12
+                ''')
+            print("Success" if result[0] else "Failed!")
+
+            result = number_expr.runTests('''
+                # stray character
+                100Z
+                # missing leading digit before '.'
+                -.100
+                # too many '.'
+                3.14.159
+                ''', failureTests=True)
+            print("Success" if result[0] else "Failed!")
+        prints::
+            # unsigned integer
+            100
+            [100]
+
+            # negative integer
+            -100
+            [-100]
+
+            # float with scientific notation
+            6.02e23
+            [6.02e+23]
+
+            # integer with scientific notation
+            1e-12
+            [1e-12]
+
+            Success
+            
+            # stray character
+            100Z
+               ^
+            FAIL: Expected end of text (at char 3), (line:1, col:4)
+
+            # missing leading digit before '.'
+            -.100
+            ^
+            FAIL: Expected {real number with scientific notation | real number | signed integer} (at char 0), (line:1, col:1)
+
+            # too many '.'
+            3.14.159
+                ^
+            FAIL: Expected end of text (at char 4), (line:1, col:5)
+
+            Success
+
+        Each test string must be on a single line. If you want to test a string that spans multiple
+        lines, create a test like this::
+
+            expr.runTest(r"this is a test\\n of strings that spans \\n 3 lines")
+        
+        (Note that this is a raw string literal, you must include the leading 'r'.)
+        """
+        if isinstance(tests, basestring):
+            tests = list(map(str.strip, tests.rstrip().splitlines()))
+        if isinstance(comment, basestring):
+            comment = Literal(comment)
+        allResults = []
+        comments = []
+        success = True
+        for t in tests:
+            if comment is not None and comment.matches(t, False) or comments and not t:
+                comments.append(t)
+                continue
+            if not t:
+                continue
+            out = ['\n'.join(comments), t]
+            comments = []
+            try:
+                t = t.replace(r'\n','\n')
+                result = self.parseString(t, parseAll=parseAll)
+                out.append(result.dump(full=fullDump))
+                success = success and not failureTests
+            except ParseBaseException as pe:
+                fatal = "(FATAL)" if isinstance(pe, ParseFatalException) else ""
+                if '\n' in t:
+                    out.append(line(pe.loc, t))
+                    out.append(' '*(col(pe.loc,t)-1) + '^' + fatal)
+                else:
+                    out.append(' '*pe.loc + '^' + fatal)
+                out.append("FAIL: " + str(pe))
+                success = success and failureTests
+                result = pe
+            except Exception as exc:
+                out.append("FAIL-EXCEPTION: " + str(exc))
+                success = success and failureTests
+                result = exc
+
+            if printResults:
+                if fullDump:
+                    out.append('')
+                print('\n'.join(out))
+
+            allResults.append((t, result))
+        
+        return success, allResults
+
+        
+class Token(ParserElement):
+    """
+    Abstract C{ParserElement} subclass, for defining atomic matching patterns.
+    """
+    def __init__( self ):
+        super(Token,self).__init__( savelist=False )
+
+
+class Empty(Token):
+    """
+    An empty token, will always match.
+    """
+    def __init__( self ):
+        super(Empty,self).__init__()
+        self.name = "Empty"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+
+class NoMatch(Token):
+    """
+    A token that will never match.
+    """
+    def __init__( self ):
+        super(NoMatch,self).__init__()
+        self.name = "NoMatch"
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.errmsg = "Unmatchable token"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Literal(Token):
+    """
+    Token to exactly match a specified string.
+    
+    Example::
+        Literal('blah').parseString('blah')  # -> ['blah']
+        Literal('blah').parseString('blahfooblah')  # -> ['blah']
+        Literal('blah').parseString('bla')  # -> Exception: Expected "blah"
+    
+    For case-insensitive matching, use L{CaselessLiteral}.
+    
+    For keyword matching (force word break before and after the matched string),
+    use L{Keyword} or L{CaselessKeyword}.
+    """
+    def __init__( self, matchString ):
+        super(Literal,self).__init__()
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Literal; use Empty() instead",
+                            SyntaxWarning, stacklevel=2)
+            self.__class__ = Empty
+        self.name = '"%s"' % _ustr(self.match)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+
+    # Performance tuning: this routine gets called a *lot*
+    # if this is a single character match string  and the first character matches,
+    # short-circuit as quickly as possible, and avoid calling startswith
+    #~ @profile
+    def parseImpl( self, instring, loc, doActions=True ):
+        if (instring[loc] == self.firstMatchChar and
+            (self.matchLen==1 or instring.startswith(self.match,loc)) ):
+            return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+_L = Literal
+ParserElement._literalStringClass = Literal
+
+class Keyword(Token):
+    """
+    Token to exactly match a specified string as a keyword, that is, it must be
+    immediately followed by a non-keyword character.  Compare with C{L{Literal}}:
+     - C{Literal("if")} will match the leading C{'if'} in C{'ifAndOnlyIf'}.
+     - C{Keyword("if")} will not; it will only match the leading C{'if'} in C{'if x=1'}, or C{'if(y==2)'}
+    Accepts two optional constructor arguments in addition to the keyword string:
+     - C{identChars} is a string of characters that would be valid identifier characters,
+          defaulting to all alphanumerics + "_" and "$"
+     - C{caseless} allows case-insensitive matching, default is C{False}.
+       
+    Example::
+        Keyword("start").parseString("start")  # -> ['start']
+        Keyword("start").parseString("starting")  # -> Exception
+
+    For case-insensitive matching, use L{CaselessKeyword}.
+    """
+    DEFAULT_KEYWORD_CHARS = alphanums+"_$"
+
+    def __init__( self, matchString, identChars=None, caseless=False ):
+        super(Keyword,self).__init__()
+        if identChars is None:
+            identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        self.match = matchString
+        self.matchLen = len(matchString)
+        try:
+            self.firstMatchChar = matchString[0]
+        except IndexError:
+            warnings.warn("null string passed to Keyword; use Empty() instead",
+                            SyntaxWarning, stacklevel=2)
+        self.name = '"%s"' % self.match
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = False
+        self.mayIndexError = False
+        self.caseless = caseless
+        if caseless:
+            self.caselessmatch = matchString.upper()
+            identChars = identChars.upper()
+        self.identChars = set(identChars)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.caseless:
+            if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
+                 (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) and
+                 (loc == 0 or instring[loc-1].upper() not in self.identChars) ):
+                return loc+self.matchLen, self.match
+        else:
+            if (instring[loc] == self.firstMatchChar and
+                (self.matchLen==1 or instring.startswith(self.match,loc)) and
+                (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen] not in self.identChars) and
+                (loc == 0 or instring[loc-1] not in self.identChars) ):
+                return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+    def copy(self):
+        c = super(Keyword,self).copy()
+        c.identChars = Keyword.DEFAULT_KEYWORD_CHARS
+        return c
+
+    @staticmethod
+    def setDefaultKeywordChars( chars ):
+        """Overrides the default Keyword chars
+        """
+        Keyword.DEFAULT_KEYWORD_CHARS = chars
+
+class CaselessLiteral(Literal):
+    """
+    Token to match a specified string, ignoring case of letters.
+    Note: the matched results will always be in the case of the given
+    match string, NOT the case of the input text.
+
+    Example::
+        OneOrMore(CaselessLiteral("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD', 'CMD']
+        
+    (Contrast with example for L{CaselessKeyword}.)
+    """
+    def __init__( self, matchString ):
+        super(CaselessLiteral,self).__init__( matchString.upper() )
+        # Preserve the defining literal.
+        self.returnString = matchString
+        self.name = "'%s'" % self.returnString
+        self.errmsg = "Expected " + self.name
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if instring[ loc:loc+self.matchLen ].upper() == self.match:
+            return loc+self.matchLen, self.returnString
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class CaselessKeyword(Keyword):
+    """
+    Caseless version of L{Keyword}.
+
+    Example::
+        OneOrMore(CaselessKeyword("CMD")).parseString("cmd CMD Cmd10") # -> ['CMD', 'CMD']
+        
+    (Contrast with example for L{CaselessLiteral}.)
+    """
+    def __init__( self, matchString, identChars=None ):
+        super(CaselessKeyword,self).__init__( matchString, identChars, caseless=True )
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if ( (instring[ loc:loc+self.matchLen ].upper() == self.caselessmatch) and
+             (loc >= len(instring)-self.matchLen or instring[loc+self.matchLen].upper() not in self.identChars) ):
+            return loc+self.matchLen, self.match
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class CloseMatch(Token):
+    """
+    A variation on L{Literal} which matches "close" matches, that is, 
+    strings with at most 'n' mismatching characters. C{CloseMatch} takes parameters:
+     - C{match_string} - string to be matched
+     - C{maxMismatches} - (C{default=1}) maximum number of mismatches allowed to count as a match
+    
+    The results from a successful parse will contain the matched text from the input string and the following named results:
+     - C{mismatches} - a list of the positions within the match_string where mismatches were found
+     - C{original} - the original match_string used to compare against the input string
+    
+    If C{mismatches} is an empty list, then the match was an exact match.
+    
+    Example::
+        patt = CloseMatch("ATCATCGAATGGA")
+        patt.parseString("ATCATCGAAXGGA") # -> (['ATCATCGAAXGGA'], {'mismatches': [[9]], 'original': ['ATCATCGAATGGA']})
+        patt.parseString("ATCAXCGAAXGGA") # -> Exception: Expected 'ATCATCGAATGGA' (with up to 1 mismatches) (at char 0), (line:1, col:1)
+
+        # exact match
+        patt.parseString("ATCATCGAATGGA") # -> (['ATCATCGAATGGA'], {'mismatches': [[]], 'original': ['ATCATCGAATGGA']})
+
+        # close match allowing up to 2 mismatches
+        patt = CloseMatch("ATCATCGAATGGA", maxMismatches=2)
+        patt.parseString("ATCAXCGAAXGGA") # -> (['ATCAXCGAAXGGA'], {'mismatches': [[4, 9]], 'original': ['ATCATCGAATGGA']})
+    """
+    def __init__(self, match_string, maxMismatches=1):
+        super(CloseMatch,self).__init__()
+        self.name = match_string
+        self.match_string = match_string
+        self.maxMismatches = maxMismatches
+        self.errmsg = "Expected %r (with up to %d mismatches)" % (self.match_string, self.maxMismatches)
+        self.mayIndexError = False
+        self.mayReturnEmpty = False
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        start = loc
+        instrlen = len(instring)
+        maxloc = start + len(self.match_string)
+
+        if maxloc <= instrlen:
+            match_string = self.match_string
+            match_stringloc = 0
+            mismatches = []
+            maxMismatches = self.maxMismatches
+
+            for match_stringloc,s_m in enumerate(zip(instring[loc:maxloc], self.match_string)):
+                src,mat = s_m
+                if src != mat:
+                    mismatches.append(match_stringloc)
+                    if len(mismatches) > maxMismatches:
+                        break
+            else:
+                loc = match_stringloc + 1
+                results = ParseResults([instring[start:loc]])
+                results['original'] = self.match_string
+                results['mismatches'] = mismatches
+                return loc, results
+
+        raise ParseException(instring, loc, self.errmsg, self)
+
+
+class Word(Token):
+    """
+    Token for matching words composed of allowed character sets.
+    Defined with string containing all allowed initial characters,
+    an optional string containing allowed body characters (if omitted,
+    defaults to the initial character set), and an optional minimum,
+    maximum, and/or exact length.  The default value for C{min} is 1 (a
+    minimum value < 1 is not valid); the default values for C{max} and C{exact}
+    are 0, meaning no maximum or exact length restriction. An optional
+    C{excludeChars} parameter can list characters that might be found in 
+    the input C{bodyChars} string; useful to define a word of all printables
+    except for one or two characters, for instance.
+    
+    L{srange} is useful for defining custom character set strings for defining 
+    C{Word} expressions, using range notation from regular expression character sets.
+    
+    A common mistake is to use C{Word} to match a specific literal string, as in 
+    C{Word("Address")}. Remember that C{Word} uses the string argument to define
+    I{sets} of matchable characters. This expression would match "Add", "AAA",
+    "dAred", or any other word made up of the characters 'A', 'd', 'r', 'e', and 's'.
+    To match an exact literal string, use L{Literal} or L{Keyword}.
+
+    pyparsing includes helper strings for building Words:
+     - L{alphas}
+     - L{nums}
+     - L{alphanums}
+     - L{hexnums}
+     - L{alphas8bit} (alphabetic characters in ASCII range 128-255 - accented, tilded, umlauted, etc.)
+     - L{punc8bit} (non-alphabetic characters in ASCII range 128-255 - currency, symbols, superscripts, diacriticals, etc.)
+     - L{printables} (any non-whitespace character)
+
+    Example::
+        # a word composed of digits
+        integer = Word(nums) # equivalent to Word("0123456789") or Word(srange("0-9"))
+        
+        # a word with a leading capital, and zero or more lowercase
+        capital_word = Word(alphas.upper(), alphas.lower())
+
+        # hostnames are alphanumeric, with leading alpha, and '-'
+        hostname = Word(alphas, alphanums+'-')
+        
+        # roman numeral (not a strict parser, accepts invalid mix of characters)
+        roman = Word("IVXLCDM")
+        
+        # any string of non-whitespace characters, except for ','
+        csv_value = Word(printables, excludeChars=",")
+    """
+    def __init__( self, initChars, bodyChars=None, min=1, max=0, exact=0, asKeyword=False, excludeChars=None ):
+        super(Word,self).__init__()
+        if excludeChars:
+            initChars = ''.join(c for c in initChars if c not in excludeChars)
+            if bodyChars:
+                bodyChars = ''.join(c for c in bodyChars if c not in excludeChars)
+        self.initCharsOrig = initChars
+        self.initChars = set(initChars)
+        if bodyChars :
+            self.bodyCharsOrig = bodyChars
+            self.bodyChars = set(bodyChars)
+        else:
+            self.bodyCharsOrig = initChars
+            self.bodyChars = set(initChars)
+
+        self.maxSpecified = max > 0
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use Optional(Word()) if zero-length word is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.asKeyword = asKeyword
+
+        if ' ' not in self.initCharsOrig+self.bodyCharsOrig and (min==1 and max==0 and exact==0):
+            if self.bodyCharsOrig == self.initCharsOrig:
+                self.reString = "[%s]+" % _escapeRegexRangeChars(self.initCharsOrig)
+            elif len(self.initCharsOrig) == 1:
+                self.reString = "%s[%s]*" % \
+                                      (re.escape(self.initCharsOrig),
+                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
+            else:
+                self.reString = "[%s][%s]*" % \
+                                      (_escapeRegexRangeChars(self.initCharsOrig),
+                                      _escapeRegexRangeChars(self.bodyCharsOrig),)
+            if self.asKeyword:
+                self.reString = r"\b"+self.reString+r"\b"
+            try:
+                self.re = re.compile( self.reString )
+            except Exception:
+                self.re = None
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.re:
+            result = self.re.match(instring,loc)
+            if not result:
+                raise ParseException(instring, loc, self.errmsg, self)
+
+            loc = result.end()
+            return loc, result.group()
+
+        if not(instring[ loc ] in self.initChars):
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        instrlen = len(instring)
+        bodychars = self.bodyChars
+        maxloc = start + self.maxLen
+        maxloc = min( maxloc, instrlen )
+        while loc < maxloc and instring[loc] in bodychars:
+            loc += 1
+
+        throwException = False
+        if loc - start < self.minLen:
+            throwException = True
+        if self.maxSpecified and loc < instrlen and instring[loc] in bodychars:
+            throwException = True
+        if self.asKeyword:
+            if (start>0 and instring[start-1] in bodychars) or (loc<instrlen and instring[loc] in bodychars):
+                throwException = True
+
+        if throwException:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__( self ):
+        try:
+            return super(Word,self).__str__()
+        except Exception:
+            pass
+
+
+        if self.strRepr is None:
+
+            def charsAsStr(s):
+                if len(s)>4:
+                    return s[:4]+"..."
+                else:
+                    return s
+
+            if ( self.initCharsOrig != self.bodyCharsOrig ):
+                self.strRepr = "W:(%s,%s)" % ( charsAsStr(self.initCharsOrig), charsAsStr(self.bodyCharsOrig) )
+            else:
+                self.strRepr = "W:(%s)" % charsAsStr(self.initCharsOrig)
+
+        return self.strRepr
+
+
+class Regex(Token):
+    r"""
+    Token for matching strings that match a given regular expression.
+    Defined with string specifying the regular expression in a form recognized by the inbuilt Python re module.
+    If the given regex contains named groups (defined using C{(?P<name>...)}), these will be preserved as 
+    named parse results.
+
+    Example::
+        realnum = Regex(r"[+-]?\d+\.\d*")
+        date = Regex(r'(?P<year>\d{4})-(?P<month>\d\d?)-(?P<day>\d\d?)')
+        # ref: http://stackoverflow.com/questions/267399/how-do-you-match-only-valid-roman-numerals-with-a-regular-expression
+        roman = Regex(r"M{0,4}(CM|CD|D?C{0,3})(XC|XL|L?X{0,3})(IX|IV|V?I{0,3})")
+    """
+    compiledREtype = type(re.compile("[A-Z]"))
+    def __init__( self, pattern, flags=0):
+        """The parameters C{pattern} and C{flags} are passed to the C{re.compile()} function as-is. See the Python C{re} module for an explanation of the acceptable patterns and flags."""
+        super(Regex,self).__init__()
+
+        if isinstance(pattern, basestring):
+            if not pattern:
+                warnings.warn("null string passed to Regex; use Empty() instead",
+                        SyntaxWarning, stacklevel=2)
+
+            self.pattern = pattern
+            self.flags = flags
+
+            try:
+                self.re = re.compile(self.pattern, self.flags)
+                self.reString = self.pattern
+            except sre_constants.error:
+                warnings.warn("invalid pattern (%s) passed to Regex" % pattern,
+                    SyntaxWarning, stacklevel=2)
+                raise
+
+        elif isinstance(pattern, Regex.compiledREtype):
+            self.re = pattern
+            self.pattern = \
+            self.reString = str(pattern)
+            self.flags = flags
+            
+        else:
+            raise ValueError("Regex may only be constructed with a string or a compiled RE object")
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        result = self.re.match(instring,loc)
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        d = result.groupdict()
+        ret = ParseResults(result.group())
+        if d:
+            for k in d:
+                ret[k] = d[k]
+        return loc,ret
+
+    def __str__( self ):
+        try:
+            return super(Regex,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "Re:(%s)" % repr(self.pattern)
+
+        return self.strRepr
+
+
+class QuotedString(Token):
+    r"""
+    Token for matching strings that are delimited by quoting characters.
+    
+    Defined with the following parameters:
+        - quoteChar - string of one or more characters defining the quote delimiting string
+        - escChar - character to escape quotes, typically backslash (default=C{None})
+        - escQuote - special quote sequence to escape an embedded quote string (such as SQL's "" to escape an embedded ") (default=C{None})
+        - multiline - boolean indicating whether quotes can span multiple lines (default=C{False})
+        - unquoteResults - boolean indicating whether the matched text should be unquoted (default=C{True})
+        - endQuoteChar - string of one or more characters defining the end of the quote delimited string (default=C{None} => same as quoteChar)
+        - convertWhitespaceEscapes - convert escaped whitespace (C{'\t'}, C{'\n'}, etc.) to actual whitespace (default=C{True})
+
+    Example::
+        qs = QuotedString('"')
+        print(qs.searchString('lsjdf "This is the quote" sldjf'))
+        complex_qs = QuotedString('{{', endQuoteChar='}}')
+        print(complex_qs.searchString('lsjdf {{This is the "quote"}} sldjf'))
+        sql_qs = QuotedString('"', escQuote='""')
+        print(sql_qs.searchString('lsjdf "This is the quote with ""embedded"" quotes" sldjf'))
+    prints::
+        [['This is the quote']]
+        [['This is the "quote"']]
+        [['This is the quote with "embedded" quotes']]
+    """
+    def __init__( self, quoteChar, escChar=None, escQuote=None, multiline=False, unquoteResults=True, endQuoteChar=None, convertWhitespaceEscapes=True):
+        super(QuotedString,self).__init__()
+
+        # remove white space from quote chars - wont work anyway
+        quoteChar = quoteChar.strip()
+        if not quoteChar:
+            warnings.warn("quoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
+            raise SyntaxError()
+
+        if endQuoteChar is None:
+            endQuoteChar = quoteChar
+        else:
+            endQuoteChar = endQuoteChar.strip()
+            if not endQuoteChar:
+                warnings.warn("endQuoteChar cannot be the empty string",SyntaxWarning,stacklevel=2)
+                raise SyntaxError()
+
+        self.quoteChar = quoteChar
+        self.quoteCharLen = len(quoteChar)
+        self.firstQuoteChar = quoteChar[0]
+        self.endQuoteChar = endQuoteChar
+        self.endQuoteCharLen = len(endQuoteChar)
+        self.escChar = escChar
+        self.escQuote = escQuote
+        self.unquoteResults = unquoteResults
+        self.convertWhitespaceEscapes = convertWhitespaceEscapes
+
+        if multiline:
+            self.flags = re.MULTILINE | re.DOTALL
+            self.pattern = r'%s(?:[^%s%s]' % \
+                ( re.escape(self.quoteChar),
+                  _escapeRegexRangeChars(self.endQuoteChar[0]),
+                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
+        else:
+            self.flags = 0
+            self.pattern = r'%s(?:[^%s\n\r%s]' % \
+                ( re.escape(self.quoteChar),
+                  _escapeRegexRangeChars(self.endQuoteChar[0]),
+                  (escChar is not None and _escapeRegexRangeChars(escChar) or '') )
+        if len(self.endQuoteChar) > 1:
+            self.pattern += (
+                '|(?:' + ')|(?:'.join("%s[^%s]" % (re.escape(self.endQuoteChar[:i]),
+                                               _escapeRegexRangeChars(self.endQuoteChar[i]))
+                                    for i in range(len(self.endQuoteChar)-1,0,-1)) + ')'
+                )
+        if escQuote:
+            self.pattern += (r'|(?:%s)' % re.escape(escQuote))
+        if escChar:
+            self.pattern += (r'|(?:%s.)' % re.escape(escChar))
+            self.escCharReplacePattern = re.escape(self.escChar)+"(.)"
+        self.pattern += (r')*%s' % re.escape(self.endQuoteChar))
+
+        try:
+            self.re = re.compile(self.pattern, self.flags)
+            self.reString = self.pattern
+        except sre_constants.error:
+            warnings.warn("invalid pattern (%s) passed to Regex" % self.pattern,
+                SyntaxWarning, stacklevel=2)
+            raise
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayIndexError = False
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        result = instring[loc] == self.firstQuoteChar and self.re.match(instring,loc) or None
+        if not result:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        loc = result.end()
+        ret = result.group()
+
+        if self.unquoteResults:
+
+            # strip off quotes
+            ret = ret[self.quoteCharLen:-self.endQuoteCharLen]
+
+            if isinstance(ret,basestring):
+                # replace escaped whitespace
+                if '\\' in ret and self.convertWhitespaceEscapes:
+                    ws_map = {
+                        r'\t' : '\t',
+                        r'\n' : '\n',
+                        r'\f' : '\f',
+                        r'\r' : '\r',
+                    }
+                    for wslit,wschar in ws_map.items():
+                        ret = ret.replace(wslit, wschar)
+
+                # replace escaped characters
+                if self.escChar:
+                    ret = re.sub(self.escCharReplacePattern, r"\g<1>", ret)
+
+                # replace escaped quotes
+                if self.escQuote:
+                    ret = ret.replace(self.escQuote, self.endQuoteChar)
+
+        return loc, ret
+
+    def __str__( self ):
+        try:
+            return super(QuotedString,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "quoted string, starting with %s ending with %s" % (self.quoteChar, self.endQuoteChar)
+
+        return self.strRepr
+
+
+class CharsNotIn(Token):
+    """
+    Token for matching words composed of characters I{not} in a given set (will
+    include whitespace in matched characters if not listed in the provided exclusion set - see example).
+    Defined with string containing all disallowed characters, and an optional
+    minimum, maximum, and/or exact length.  The default value for C{min} is 1 (a
+    minimum value < 1 is not valid); the default values for C{max} and C{exact}
+    are 0, meaning no maximum or exact length restriction.
+
+    Example::
+        # define a comma-separated-value as anything that is not a ','
+        csv_value = CharsNotIn(',')
+        print(delimitedList(csv_value).parseString("dkls,lsdkjf,s12 34,@!#,213"))
+    prints::
+        ['dkls', 'lsdkjf', 's12 34', '@!#', '213']
+    """
+    def __init__( self, notChars, min=1, max=0, exact=0 ):
+        super(CharsNotIn,self).__init__()
+        self.skipWhitespace = False
+        self.notChars = notChars
+
+        if min < 1:
+            raise ValueError("cannot specify a minimum length < 1; use Optional(CharsNotIn()) if zero-length char group is permitted")
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+        self.name = _ustr(self)
+        self.errmsg = "Expected " + self.name
+        self.mayReturnEmpty = ( self.minLen == 0 )
+        self.mayIndexError = False
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if instring[loc] in self.notChars:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        start = loc
+        loc += 1
+        notchars = self.notChars
+        maxlen = min( start+self.maxLen, len(instring) )
+        while loc < maxlen and \
+              (instring[loc] not in notchars):
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+    def __str__( self ):
+        try:
+            return super(CharsNotIn, self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            if len(self.notChars) > 4:
+                self.strRepr = "!W:(%s...)" % self.notChars[:4]
+            else:
+                self.strRepr = "!W:(%s)" % self.notChars
+
+        return self.strRepr
+
+class White(Token):
+    """
+    Special matching class for matching whitespace.  Normally, whitespace is ignored
+    by pyparsing grammars.  This class is included when some whitespace structures
+    are significant.  Define with a string containing the whitespace characters to be
+    matched; default is C{" \\t\\r\\n"}.  Also takes optional C{min}, C{max}, and C{exact} arguments,
+    as defined for the C{L{Word}} class.
+    """
+    whiteStrs = {
+        " " : "<SPC>",
+        "\t": "<TAB>",
+        "\n": "<LF>",
+        "\r": "<CR>",
+        "\f": "<FF>",
+        }
+    def __init__(self, ws=" \t\r\n", min=1, max=0, exact=0):
+        super(White,self).__init__()
+        self.matchWhite = ws
+        self.setWhitespaceChars( "".join(c for c in self.whiteChars if c not in self.matchWhite) )
+        #~ self.leaveWhitespace()
+        self.name = ("".join(White.whiteStrs[c] for c in self.matchWhite))
+        self.mayReturnEmpty = True
+        self.errmsg = "Expected " + self.name
+
+        self.minLen = min
+
+        if max > 0:
+            self.maxLen = max
+        else:
+            self.maxLen = _MAX_INT
+
+        if exact > 0:
+            self.maxLen = exact
+            self.minLen = exact
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if not(instring[ loc ] in self.matchWhite):
+            raise ParseException(instring, loc, self.errmsg, self)
+        start = loc
+        loc += 1
+        maxloc = start + self.maxLen
+        maxloc = min( maxloc, len(instring) )
+        while loc < maxloc and instring[loc] in self.matchWhite:
+            loc += 1
+
+        if loc - start < self.minLen:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        return loc, instring[start:loc]
+
+
+class _PositionToken(Token):
+    def __init__( self ):
+        super(_PositionToken,self).__init__()
+        self.name=self.__class__.__name__
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+
+class GoToColumn(_PositionToken):
+    """
+    Token to advance to a specific column of input text; useful for tabular report scraping.
+    """
+    def __init__( self, colno ):
+        super(GoToColumn,self).__init__()
+        self.col = colno
+
+    def preParse( self, instring, loc ):
+        if col(loc,instring) != self.col:
+            instrlen = len(instring)
+            if self.ignoreExprs:
+                loc = self._skipIgnorables( instring, loc )
+            while loc < instrlen and instring[loc].isspace() and col( loc, instring ) != self.col :
+                loc += 1
+        return loc
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        thiscol = col( loc, instring )
+        if thiscol > self.col:
+            raise ParseException( instring, loc, "Text not in expected column", self )
+        newloc = loc + self.col - thiscol
+        ret = instring[ loc: newloc ]
+        return newloc, ret
+
+
+class LineStart(_PositionToken):
+    """
+    Matches if current position is at the beginning of a line within the parse string
+    
+    Example::
+    
+        test = '''\
+        AAA this line
+        AAA and this line
+          AAA but not this one
+        B AAA and definitely not this one
+        '''
+
+        for t in (LineStart() + 'AAA' + restOfLine).searchString(test):
+            print(t)
+    
+    Prints::
+        ['AAA', ' this line']
+        ['AAA', ' and this line']    
+
+    """
+    def __init__( self ):
+        super(LineStart,self).__init__()
+        self.errmsg = "Expected start of line"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if col(loc, instring) == 1:
+            return loc, []
+        raise ParseException(instring, loc, self.errmsg, self)
+
+class LineEnd(_PositionToken):
+    """
+    Matches if current position is at the end of a line within the parse string
+    """
+    def __init__( self ):
+        super(LineEnd,self).__init__()
+        self.setWhitespaceChars( ParserElement.DEFAULT_WHITE_CHARS.replace("\n","") )
+        self.errmsg = "Expected end of line"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc<len(instring):
+            if instring[loc] == "\n":
+                return loc+1, "\n"
+            else:
+                raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc+1, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class StringStart(_PositionToken):
+    """
+    Matches if current position is at the beginning of the parse string
+    """
+    def __init__( self ):
+        super(StringStart,self).__init__()
+        self.errmsg = "Expected start of text"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc != 0:
+            # see if entire string up to here is just whitespace and ignoreables
+            if loc != self.preParse( instring, 0 ):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class StringEnd(_PositionToken):
+    """
+    Matches if current position is at the end of the parse string
+    """
+    def __init__( self ):
+        super(StringEnd,self).__init__()
+        self.errmsg = "Expected end of text"
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if loc < len(instring):
+            raise ParseException(instring, loc, self.errmsg, self)
+        elif loc == len(instring):
+            return loc+1, []
+        elif loc > len(instring):
+            return loc, []
+        else:
+            raise ParseException(instring, loc, self.errmsg, self)
+
+class WordStart(_PositionToken):
+    """
+    Matches if the current position is at the beginning of a Word, and
+    is not preceded by any character in a given set of C{wordChars}
+    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
+    use C{WordStart(alphanums)}. C{WordStart} will also match at the beginning of
+    the string being parsed, or at the beginning of a line.
+    """
+    def __init__(self, wordChars = printables):
+        super(WordStart,self).__init__()
+        self.wordChars = set(wordChars)
+        self.errmsg = "Not at the start of a word"
+
+    def parseImpl(self, instring, loc, doActions=True ):
+        if loc != 0:
+            if (instring[loc-1] in self.wordChars or
+                instring[loc] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+class WordEnd(_PositionToken):
+    """
+    Matches if the current position is at the end of a Word, and
+    is not followed by any character in a given set of C{wordChars}
+    (default=C{printables}). To emulate the C{\b} behavior of regular expressions,
+    use C{WordEnd(alphanums)}. C{WordEnd} will also match at the end of
+    the string being parsed, or at the end of a line.
+    """
+    def __init__(self, wordChars = printables):
+        super(WordEnd,self).__init__()
+        self.wordChars = set(wordChars)
+        self.skipWhitespace = False
+        self.errmsg = "Not at the end of a word"
+
+    def parseImpl(self, instring, loc, doActions=True ):
+        instrlen = len(instring)
+        if instrlen>0 and loc<instrlen:
+            if (instring[loc] in self.wordChars or
+                instring[loc-1] not in self.wordChars):
+                raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+
+class ParseExpression(ParserElement):
+    """
+    Abstract subclass of ParserElement, for combining and post-processing parsed tokens.
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(ParseExpression,self).__init__(savelist)
+        if isinstance( exprs, _generatorType ):
+            exprs = list(exprs)
+
+        if isinstance( exprs, basestring ):
+            self.exprs = [ ParserElement._literalStringClass( exprs ) ]
+        elif isinstance( exprs, Iterable ):
+            exprs = list(exprs)
+            # if sequence of strings provided, wrap with Literal
+            if all(isinstance(expr, basestring) for expr in exprs):
+                exprs = map(ParserElement._literalStringClass, exprs)
+            self.exprs = list(exprs)
+        else:
+            try:
+                self.exprs = list( exprs )
+            except TypeError:
+                self.exprs = [ exprs ]
+        self.callPreparse = False
+
+    def __getitem__( self, i ):
+        return self.exprs[i]
+
+    def append( self, other ):
+        self.exprs.append( other )
+        self.strRepr = None
+        return self
+
+    def leaveWhitespace( self ):
+        """Extends C{leaveWhitespace} defined in base class, and also invokes C{leaveWhitespace} on
+           all contained expressions."""
+        self.skipWhitespace = False
+        self.exprs = [ e.copy() for e in self.exprs ]
+        for e in self.exprs:
+            e.leaveWhitespace()
+        return self
+
+    def ignore( self, other ):
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                super( ParseExpression, self).ignore( other )
+                for e in self.exprs:
+                    e.ignore( self.ignoreExprs[-1] )
+        else:
+            super( ParseExpression, self).ignore( other )
+            for e in self.exprs:
+                e.ignore( self.ignoreExprs[-1] )
+        return self
+
+    def __str__( self ):
+        try:
+            return super(ParseExpression,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None:
+            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.exprs) )
+        return self.strRepr
+
+    def streamline( self ):
+        super(ParseExpression,self).streamline()
+
+        for e in self.exprs:
+            e.streamline()
+
+        # collapse nested And's of the form And( And( And( a,b), c), d) to And( a,b,c,d )
+        # but only if there are no parse actions or resultsNames on the nested And's
+        # (likewise for Or's and MatchFirst's)
+        if ( len(self.exprs) == 2 ):
+            other = self.exprs[0]
+            if ( isinstance( other, self.__class__ ) and
+                  not(other.parseAction) and
+                  other.resultsName is None and
+                  not other.debug ):
+                self.exprs = other.exprs[:] + [ self.exprs[1] ]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+            other = self.exprs[-1]
+            if ( isinstance( other, self.__class__ ) and
+                  not(other.parseAction) and
+                  other.resultsName is None and
+                  not other.debug ):
+                self.exprs = self.exprs[:-1] + other.exprs[:]
+                self.strRepr = None
+                self.mayReturnEmpty |= other.mayReturnEmpty
+                self.mayIndexError  |= other.mayIndexError
+
+        self.errmsg = "Expected " + _ustr(self)
+        
+        return self
+
+    def setResultsName( self, name, listAllMatches=False ):
+        ret = super(ParseExpression,self).setResultsName(name,listAllMatches)
+        return ret
+
+    def validate( self, validateTrace=[] ):
+        tmp = validateTrace[:]+[self]
+        for e in self.exprs:
+            e.validate(tmp)
+        self.checkRecursion( [] )
+        
+    def copy(self):
+        ret = super(ParseExpression,self).copy()
+        ret.exprs = [e.copy() for e in self.exprs]
+        return ret
+
+class And(ParseExpression):
+    """
+    Requires all given C{ParseExpression}s to be found in the given order.
+    Expressions may be separated by whitespace.
+    May be constructed using the C{'+'} operator.
+    May also be constructed using the C{'-'} operator, which will suppress backtracking.
+
+    Example::
+        integer = Word(nums)
+        name_expr = OneOrMore(Word(alphas))
+
+        expr = And([integer("id"),name_expr("name"),integer("age")])
+        # more easily written as:
+        expr = integer("id") + name_expr("name") + integer("age")
+    """
+
+    class _ErrorStop(Empty):
+        def __init__(self, *args, **kwargs):
+            super(And._ErrorStop,self).__init__(*args, **kwargs)
+            self.name = '-'
+            self.leaveWhitespace()
+
+    def __init__( self, exprs, savelist = True ):
+        super(And,self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.setWhitespaceChars( self.exprs[0].whiteChars )
+        self.skipWhitespace = self.exprs[0].skipWhitespace
+        self.callPreparse = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        # pass False as last arg to _parse for first element, since we already
+        # pre-parsed the string as part of our And pre-parsing
+        loc, resultlist = self.exprs[0]._parse( instring, loc, doActions, callPreParse=False )
+        errorStop = False
+        for e in self.exprs[1:]:
+            if isinstance(e, And._ErrorStop):
+                errorStop = True
+                continue
+            if errorStop:
+                try:
+                    loc, exprtokens = e._parse( instring, loc, doActions )
+                except ParseSyntaxException:
+                    raise
+                except ParseBaseException as pe:
+                    pe.__traceback__ = None
+                    raise ParseSyntaxException._from_exception(pe)
+                except IndexError:
+                    raise ParseSyntaxException(instring, len(instring), self.errmsg, self)
+            else:
+                loc, exprtokens = e._parse( instring, loc, doActions )
+            if exprtokens or exprtokens.haskeys():
+                resultlist += exprtokens
+        return loc, resultlist
+
+    def __iadd__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #And( [ self, other ] )
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+            if not e.mayReturnEmpty:
+                break
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+
+class Or(ParseExpression):
+    """
+    Requires that at least one C{ParseExpression} is found.
+    If two expressions match, the expression that matches the longest string will be used.
+    May be constructed using the C{'^'} operator.
+
+    Example::
+        # construct Or using '^' operator
+        
+        number = Word(nums) ^ Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789"))
+    prints::
+        [['123'], ['3.1416'], ['789']]
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(Or,self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        maxExcLoc = -1
+        maxException = None
+        matches = []
+        for e in self.exprs:
+            try:
+                loc2 = e.tryParse( instring, loc )
+            except ParseException as err:
+                err.__traceback__ = None
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring,len(instring),e.errmsg,self)
+                    maxExcLoc = len(instring)
+            else:
+                # save match among all matches, to retry longest to shortest
+                matches.append((loc2, e))
+
+        if matches:
+            matches.sort(key=lambda x: -x[0])
+            for _,e in matches:
+                try:
+                    return e._parse( instring, loc, doActions )
+                except ParseException as err:
+                    err.__traceback__ = None
+                    if err.loc > maxExcLoc:
+                        maxException = err
+                        maxExcLoc = err.loc
+
+        if maxException is not None:
+            maxException.msg = self.errmsg
+            raise maxException
+        else:
+            raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+
+    def __ixor__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #Or( [ self, other ] )
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " ^ ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class MatchFirst(ParseExpression):
+    """
+    Requires that at least one C{ParseExpression} is found.
+    If two expressions match, the first one listed is the one that will match.
+    May be constructed using the C{'|'} operator.
+
+    Example::
+        # construct MatchFirst using '|' operator
+        
+        # watch the order of expressions to match
+        number = Word(nums) | Combine(Word(nums) + '.' + Word(nums))
+        print(number.searchString("123 3.1416 789")) #  Fail! -> [['123'], ['3'], ['1416'], ['789']]
+
+        # put more selective expression first
+        number = Combine(Word(nums) + '.' + Word(nums)) | Word(nums)
+        print(number.searchString("123 3.1416 789")) #  Better -> [['123'], ['3.1416'], ['789']]
+    """
+    def __init__( self, exprs, savelist = False ):
+        super(MatchFirst,self).__init__(exprs, savelist)
+        if self.exprs:
+            self.mayReturnEmpty = any(e.mayReturnEmpty for e in self.exprs)
+        else:
+            self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        maxExcLoc = -1
+        maxException = None
+        for e in self.exprs:
+            try:
+                ret = e._parse( instring, loc, doActions )
+                return ret
+            except ParseException as err:
+                if err.loc > maxExcLoc:
+                    maxException = err
+                    maxExcLoc = err.loc
+            except IndexError:
+                if len(instring) > maxExcLoc:
+                    maxException = ParseException(instring,len(instring),e.errmsg,self)
+                    maxExcLoc = len(instring)
+
+        # only got here if no expression matched, raise exception for match that made it the furthest
+        else:
+            if maxException is not None:
+                maxException.msg = self.errmsg
+                raise maxException
+            else:
+                raise ParseException(instring, loc, "no defined alternatives to match", self)
+
+    def __ior__(self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass( other )
+        return self.append( other ) #MatchFirst( [ self, other ] )
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " | ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class Each(ParseExpression):
+    """
+    Requires all given C{ParseExpression}s to be found, but in any order.
+    Expressions may be separated by whitespace.
+    May be constructed using the C{'&'} operator.
+
+    Example::
+        color = oneOf("RED ORANGE YELLOW GREEN BLUE PURPLE BLACK WHITE BROWN")
+        shape_type = oneOf("SQUARE CIRCLE TRIANGLE STAR HEXAGON OCTAGON")
+        integer = Word(nums)
+        shape_attr = "shape:" + shape_type("shape")
+        posn_attr = "posn:" + Group(integer("x") + ',' + integer("y"))("posn")
+        color_attr = "color:" + color("color")
+        size_attr = "size:" + integer("size")
+
+        # use Each (using operator '&') to accept attributes in any order 
+        # (shape and posn are required, color and size are optional)
+        shape_spec = shape_attr & posn_attr & Optional(color_attr) & Optional(size_attr)
+
+        shape_spec.runTests('''
+            shape: SQUARE color: BLACK posn: 100, 120
+            shape: CIRCLE size: 50 color: BLUE posn: 50,80
+            color:GREEN size:20 shape:TRIANGLE posn:20,40
+            '''
+            )
+    prints::
+        shape: SQUARE color: BLACK posn: 100, 120
+        ['shape:', 'SQUARE', 'color:', 'BLACK', 'posn:', ['100', ',', '120']]
+        - color: BLACK
+        - posn: ['100', ',', '120']
+          - x: 100
+          - y: 120
+        - shape: SQUARE
+
+
+        shape: CIRCLE size: 50 color: BLUE posn: 50,80
+        ['shape:', 'CIRCLE', 'size:', '50', 'color:', 'BLUE', 'posn:', ['50', ',', '80']]
+        - color: BLUE
+        - posn: ['50', ',', '80']
+          - x: 50
+          - y: 80
+        - shape: CIRCLE
+        - size: 50
+
+
+        color: GREEN size: 20 shape: TRIANGLE posn: 20,40
+        ['color:', 'GREEN', 'size:', '20', 'shape:', 'TRIANGLE', 'posn:', ['20', ',', '40']]
+        - color: GREEN
+        - posn: ['20', ',', '40']
+          - x: 20
+          - y: 40
+        - shape: TRIANGLE
+        - size: 20
+    """
+    def __init__( self, exprs, savelist = True ):
+        super(Each,self).__init__(exprs, savelist)
+        self.mayReturnEmpty = all(e.mayReturnEmpty for e in self.exprs)
+        self.skipWhitespace = True
+        self.initExprGroups = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.initExprGroups:
+            self.opt1map = dict((id(e.expr),e) for e in self.exprs if isinstance(e,Optional))
+            opt1 = [ e.expr for e in self.exprs if isinstance(e,Optional) ]
+            opt2 = [ e for e in self.exprs if e.mayReturnEmpty and not isinstance(e,Optional)]
+            self.optionals = opt1 + opt2
+            self.multioptionals = [ e.expr for e in self.exprs if isinstance(e,ZeroOrMore) ]
+            self.multirequired = [ e.expr for e in self.exprs if isinstance(e,OneOrMore) ]
+            self.required = [ e for e in self.exprs if not isinstance(e,(Optional,ZeroOrMore,OneOrMore)) ]
+            self.required += self.multirequired
+            self.initExprGroups = False
+        tmpLoc = loc
+        tmpReqd = self.required[:]
+        tmpOpt  = self.optionals[:]
+        matchOrder = []
+
+        keepMatching = True
+        while keepMatching:
+            tmpExprs = tmpReqd + tmpOpt + self.multioptionals + self.multirequired
+            failed = []
+            for e in tmpExprs:
+                try:
+                    tmpLoc = e.tryParse( instring, tmpLoc )
+                except ParseException:
+                    failed.append(e)
+                else:
+                    matchOrder.append(self.opt1map.get(id(e),e))
+                    if e in tmpReqd:
+                        tmpReqd.remove(e)
+                    elif e in tmpOpt:
+                        tmpOpt.remove(e)
+            if len(failed) == len(tmpExprs):
+                keepMatching = False
+
+        if tmpReqd:
+            missing = ", ".join(_ustr(e) for e in tmpReqd)
+            raise ParseException(instring,loc,"Missing one or more required elements (%s)" % missing )
+
+        # add any unmatched Optionals, in case they have default values defined
+        matchOrder += [e for e in self.exprs if isinstance(e,Optional) and e.expr in tmpOpt]
+
+        resultlist = []
+        for e in matchOrder:
+            loc,results = e._parse(instring,loc,doActions)
+            resultlist.append(results)
+
+        finalResults = sum(resultlist, ParseResults([]))
+        return loc, finalResults
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + " & ".join(_ustr(e) for e in self.exprs) + "}"
+
+        return self.strRepr
+
+    def checkRecursion( self, parseElementList ):
+        subRecCheckList = parseElementList[:] + [ self ]
+        for e in self.exprs:
+            e.checkRecursion( subRecCheckList )
+
+
+class ParseElementEnhance(ParserElement):
+    """
+    Abstract subclass of C{ParserElement}, for combining and post-processing parsed tokens.
+    """
+    def __init__( self, expr, savelist=False ):
+        super(ParseElementEnhance,self).__init__(savelist)
+        if isinstance( expr, basestring ):
+            if issubclass(ParserElement._literalStringClass, Token):
+                expr = ParserElement._literalStringClass(expr)
+            else:
+                expr = ParserElement._literalStringClass(Literal(expr))
+        self.expr = expr
+        self.strRepr = None
+        if expr is not None:
+            self.mayIndexError = expr.mayIndexError
+            self.mayReturnEmpty = expr.mayReturnEmpty
+            self.setWhitespaceChars( expr.whiteChars )
+            self.skipWhitespace = expr.skipWhitespace
+            self.saveAsList = expr.saveAsList
+            self.callPreparse = expr.callPreparse
+            self.ignoreExprs.extend(expr.ignoreExprs)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.expr is not None:
+            return self.expr._parse( instring, loc, doActions, callPreParse=False )
+        else:
+            raise ParseException("",loc,self.errmsg,self)
+
+    def leaveWhitespace( self ):
+        self.skipWhitespace = False
+        self.expr = self.expr.copy()
+        if self.expr is not None:
+            self.expr.leaveWhitespace()
+        return self
+
+    def ignore( self, other ):
+        if isinstance( other, Suppress ):
+            if other not in self.ignoreExprs:
+                super( ParseElementEnhance, self).ignore( other )
+                if self.expr is not None:
+                    self.expr.ignore( self.ignoreExprs[-1] )
+        else:
+            super( ParseElementEnhance, self).ignore( other )
+            if self.expr is not None:
+                self.expr.ignore( self.ignoreExprs[-1] )
+        return self
+
+    def streamline( self ):
+        super(ParseElementEnhance,self).streamline()
+        if self.expr is not None:
+            self.expr.streamline()
+        return self
+
+    def checkRecursion( self, parseElementList ):
+        if self in parseElementList:
+            raise RecursiveGrammarException( parseElementList+[self] )
+        subRecCheckList = parseElementList[:] + [ self ]
+        if self.expr is not None:
+            self.expr.checkRecursion( subRecCheckList )
+
+    def validate( self, validateTrace=[] ):
+        tmp = validateTrace[:]+[self]
+        if self.expr is not None:
+            self.expr.validate(tmp)
+        self.checkRecursion( [] )
+
+    def __str__( self ):
+        try:
+            return super(ParseElementEnhance,self).__str__()
+        except Exception:
+            pass
+
+        if self.strRepr is None and self.expr is not None:
+            self.strRepr = "%s:(%s)" % ( self.__class__.__name__, _ustr(self.expr) )
+        return self.strRepr
+
+
+class FollowedBy(ParseElementEnhance):
+    """
+    Lookahead matching of the given parse expression.  C{FollowedBy}
+    does I{not} advance the parsing position within the input string, it only
+    verifies that the specified parse expression matches at the current
+    position.  C{FollowedBy} always returns a null token list.
+
+    Example::
+        # use FollowedBy to match a label only if it is followed by a ':'
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        
+        OneOrMore(attr_expr).parseString("shape: SQUARE color: BLACK posn: upper left").pprint()
+    prints::
+        [['shape', 'SQUARE'], ['color', 'BLACK'], ['posn', 'upper left']]
+    """
+    def __init__( self, expr ):
+        super(FollowedBy,self).__init__(expr)
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        self.expr.tryParse( instring, loc )
+        return loc, []
+
+
+class NotAny(ParseElementEnhance):
+    """
+    Lookahead to disallow matching with the given parse expression.  C{NotAny}
+    does I{not} advance the parsing position within the input string, it only
+    verifies that the specified parse expression does I{not} match at the current
+    position.  Also, C{NotAny} does I{not} skip over leading whitespace. C{NotAny}
+    always returns a null token list.  May be constructed using the '~' operator.
+
+    Example::
+        
+    """
+    def __init__( self, expr ):
+        super(NotAny,self).__init__(expr)
+        #~ self.leaveWhitespace()
+        self.skipWhitespace = False  # do NOT use self.leaveWhitespace(), don't want to propagate to exprs
+        self.mayReturnEmpty = True
+        self.errmsg = "Found unwanted token, "+_ustr(self.expr)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        if self.expr.canParseNext(instring, loc):
+            raise ParseException(instring, loc, self.errmsg, self)
+        return loc, []
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "~{" + _ustr(self.expr) + "}"
+
+        return self.strRepr
+
+class _MultipleMatch(ParseElementEnhance):
+    def __init__( self, expr, stopOn=None):
+        super(_MultipleMatch, self).__init__(expr)
+        self.saveAsList = True
+        ender = stopOn
+        if isinstance(ender, basestring):
+            ender = ParserElement._literalStringClass(ender)
+        self.not_ender = ~ender if ender is not None else None
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        self_expr_parse = self.expr._parse
+        self_skip_ignorables = self._skipIgnorables
+        check_ender = self.not_ender is not None
+        if check_ender:
+            try_not_ender = self.not_ender.tryParse
+        
+        # must be at least one (but first see if we are the stopOn sentinel;
+        # if so, fail)
+        if check_ender:
+            try_not_ender(instring, loc)
+        loc, tokens = self_expr_parse( instring, loc, doActions, callPreParse=False )
+        try:
+            hasIgnoreExprs = (not not self.ignoreExprs)
+            while 1:
+                if check_ender:
+                    try_not_ender(instring, loc)
+                if hasIgnoreExprs:
+                    preloc = self_skip_ignorables( instring, loc )
+                else:
+                    preloc = loc
+                loc, tmptokens = self_expr_parse( instring, preloc, doActions )
+                if tmptokens or tmptokens.haskeys():
+                    tokens += tmptokens
+        except (ParseException,IndexError):
+            pass
+
+        return loc, tokens
+        
+class OneOrMore(_MultipleMatch):
+    """
+    Repetition of one or more of the given expression.
+    
+    Parameters:
+     - expr - expression that must match one or more times
+     - stopOn - (default=C{None}) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition 
+          expression)          
+
+    Example::
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: BLACK"
+        OneOrMore(attr_expr).parseString(text).pprint()  # Fail! read 'color' as data instead of next label -> [['shape', 'SQUARE color']]
+
+        # use stopOn attribute for OneOrMore to avoid reading label string as part of the data
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        OneOrMore(attr_expr).parseString(text).pprint() # Better -> [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'BLACK']]
+        
+        # could also be written as
+        (attr_expr * (1,)).parseString(text).pprint()
+    """
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "{" + _ustr(self.expr) + "}..."
+
+        return self.strRepr
+
+class ZeroOrMore(_MultipleMatch):
+    """
+    Optional repetition of zero or more of the given expression.
+    
+    Parameters:
+     - expr - expression that must match zero or more times
+     - stopOn - (default=C{None}) - expression for a terminating sentinel
+          (only required if the sentinel would ordinarily match the repetition 
+          expression)          
+
+    Example: similar to L{OneOrMore}
+    """
+    def __init__( self, expr, stopOn=None):
+        super(ZeroOrMore,self).__init__(expr, stopOn=stopOn)
+        self.mayReturnEmpty = True
+        
+    def parseImpl( self, instring, loc, doActions=True ):
+        try:
+            return super(ZeroOrMore, self).parseImpl(instring, loc, doActions)
+        except (ParseException,IndexError):
+            return loc, []
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]..."
+
+        return self.strRepr
+
+class _NullToken(object):
+    def __bool__(self):
+        return False
+    __nonzero__ = __bool__
+    def __str__(self):
+        return ""
+
+_optionalNotMatched = _NullToken()
+class Optional(ParseElementEnhance):
+    """
+    Optional matching of the given expression.
+
+    Parameters:
+     - expr - expression that must match zero or more times
+     - default (optional) - value to be returned if the optional expression is not found.
+
+    Example::
+        # US postal code can be a 5-digit zip, plus optional 4-digit qualifier
+        zip = Combine(Word(nums, exact=5) + Optional('-' + Word(nums, exact=4)))
+        zip.runTests('''
+            # traditional ZIP code
+            12345
+            
+            # ZIP+4 form
+            12101-0001
+            
+            # invalid ZIP
+            98765-
+            ''')
+    prints::
+        # traditional ZIP code
+        12345
+        ['12345']
+
+        # ZIP+4 form
+        12101-0001
+        ['12101-0001']
+
+        # invalid ZIP
+        98765-
+             ^
+        FAIL: Expected end of text (at char 5), (line:1, col:6)
+    """
+    def __init__( self, expr, default=_optionalNotMatched ):
+        super(Optional,self).__init__( expr, savelist=False )
+        self.saveAsList = self.expr.saveAsList
+        self.defaultValue = default
+        self.mayReturnEmpty = True
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        try:
+            loc, tokens = self.expr._parse( instring, loc, doActions, callPreParse=False )
+        except (ParseException,IndexError):
+            if self.defaultValue is not _optionalNotMatched:
+                if self.expr.resultsName:
+                    tokens = ParseResults([ self.defaultValue ])
+                    tokens[self.expr.resultsName] = self.defaultValue
+                else:
+                    tokens = [ self.defaultValue ]
+            else:
+                tokens = []
+        return loc, tokens
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+
+        if self.strRepr is None:
+            self.strRepr = "[" + _ustr(self.expr) + "]"
+
+        return self.strRepr
+
+class SkipTo(ParseElementEnhance):
+    """
+    Token for skipping over all undefined text until the matched expression is found.
+
+    Parameters:
+     - expr - target expression marking the end of the data to be skipped
+     - include - (default=C{False}) if True, the target expression is also parsed 
+          (the skipped text and target expression are returned as a 2-element list).
+     - ignore - (default=C{None}) used to define grammars (typically quoted strings and 
+          comments) that might contain false matches to the target expression
+     - failOn - (default=C{None}) define expressions that are not allowed to be 
+          included in the skipped test; if found before the target expression is found, 
+          the SkipTo is not a match
+
+    Example::
+        report = '''
+            Outstanding Issues Report - 1 Jan 2000
+
+               # | Severity | Description                               |  Days Open
+            -----+----------+-------------------------------------------+-----------
+             101 | Critical | Intermittent system crash                 |          6
+              94 | Cosmetic | Spelling error on Login ('log|n')         |         14
+              79 | Minor    | System slow when running too many reports |         47
+            '''
+        integer = Word(nums)
+        SEP = Suppress('|')
+        # use SkipTo to simply match everything up until the next SEP
+        # - ignore quoted strings, so that a '|' character inside a quoted string does not match
+        # - parse action will call token.strip() for each matched token, i.e., the description body
+        string_data = SkipTo(SEP, ignore=quotedString)
+        string_data.setParseAction(tokenMap(str.strip))
+        ticket_expr = (integer("issue_num") + SEP 
+                      + string_data("sev") + SEP 
+                      + string_data("desc") + SEP 
+                      + integer("days_open"))
+        
+        for tkt in ticket_expr.searchString(report):
+            print tkt.dump()
+    prints::
+        ['101', 'Critical', 'Intermittent system crash', '6']
+        - days_open: 6
+        - desc: Intermittent system crash
+        - issue_num: 101
+        - sev: Critical
+        ['94', 'Cosmetic', "Spelling error on Login ('log|n')", '14']
+        - days_open: 14
+        - desc: Spelling error on Login ('log|n')
+        - issue_num: 94
+        - sev: Cosmetic
+        ['79', 'Minor', 'System slow when running too many reports', '47']
+        - days_open: 47
+        - desc: System slow when running too many reports
+        - issue_num: 79
+        - sev: Minor
+    """
+    def __init__( self, other, include=False, ignore=None, failOn=None ):
+        super( SkipTo, self ).__init__( other )
+        self.ignoreExpr = ignore
+        self.mayReturnEmpty = True
+        self.mayIndexError = False
+        self.includeMatch = include
+        self.asList = False
+        if isinstance(failOn, basestring):
+            self.failOn = ParserElement._literalStringClass(failOn)
+        else:
+            self.failOn = failOn
+        self.errmsg = "No match found for "+_ustr(self.expr)
+
+    def parseImpl( self, instring, loc, doActions=True ):
+        startloc = loc
+        instrlen = len(instring)
+        expr = self.expr
+        expr_parse = self.expr._parse
+        self_failOn_canParseNext = self.failOn.canParseNext if self.failOn is not None else None
+        self_ignoreExpr_tryParse = self.ignoreExpr.tryParse if self.ignoreExpr is not None else None
+        
+        tmploc = loc
+        while tmploc <= instrlen:
+            if self_failOn_canParseNext is not None:
+                # break if failOn expression matches
+                if self_failOn_canParseNext(instring, tmploc):
+                    break
+                    
+            if self_ignoreExpr_tryParse is not None:
+                # advance past ignore expressions
+                while 1:
+                    try:
+                        tmploc = self_ignoreExpr_tryParse(instring, tmploc)
+                    except ParseBaseException:
+                        break
+            
+            try:
+                expr_parse(instring, tmploc, doActions=False, callPreParse=False)
+            except (ParseException, IndexError):
+                # no match, advance loc in string
+                tmploc += 1
+            else:
+                # matched skipto expr, done
+                break
+
+        else:
+            # ran off the end of the input string without matching skipto expr, fail
+            raise ParseException(instring, loc, self.errmsg, self)
+
+        # build up return values
+        loc = tmploc
+        skiptext = instring[startloc:loc]
+        skipresult = ParseResults(skiptext)
+        
+        if self.includeMatch:
+            loc, mat = expr_parse(instring,loc,doActions,callPreParse=False)
+            skipresult += mat
+
+        return loc, skipresult
+
+class Forward(ParseElementEnhance):
+    """
+    Forward declaration of an expression to be defined later -
+    used for recursive grammars, such as algebraic infix notation.
+    When the expression is known, it is assigned to the C{Forward} variable using the '<<' operator.
+
+    Note: take care when assigning to C{Forward} not to overlook precedence of operators.
+    Specifically, '|' has a lower precedence than '<<', so that::
+        fwdExpr << a | b | c
+    will actually be evaluated as::
+        (fwdExpr << a) | b | c
+    thereby leaving b and c out as parseable alternatives.  It is recommended that you
+    explicitly group the values inserted into the C{Forward}::
+        fwdExpr << (a | b | c)
+    Converting to use the '<<=' operator instead will avoid this problem.
+
+    See L{ParseResults.pprint} for an example of a recursive parser created using
+    C{Forward}.
+    """
+    def __init__( self, other=None ):
+        super(Forward,self).__init__( other, savelist=False )
+
+    def __lshift__( self, other ):
+        if isinstance( other, basestring ):
+            other = ParserElement._literalStringClass(other)
+        self.expr = other
+        self.strRepr = None
+        self.mayIndexError = self.expr.mayIndexError
+        self.mayReturnEmpty = self.expr.mayReturnEmpty
+        self.setWhitespaceChars( self.expr.whiteChars )
+        self.skipWhitespace = self.expr.skipWhitespace
+        self.saveAsList = self.expr.saveAsList
+        self.ignoreExprs.extend(self.expr.ignoreExprs)
+        return self
+        
+    def __ilshift__(self, other):
+        return self << other
+    
+    def leaveWhitespace( self ):
+        self.skipWhitespace = False
+        return self
+
+    def streamline( self ):
+        if not self.streamlined:
+            self.streamlined = True
+            if self.expr is not None:
+                self.expr.streamline()
+        return self
+
+    def validate( self, validateTrace=[] ):
+        if self not in validateTrace:
+            tmp = validateTrace[:]+[self]
+            if self.expr is not None:
+                self.expr.validate(tmp)
+        self.checkRecursion([])
+
+    def __str__( self ):
+        if hasattr(self,"name"):
+            return self.name
+        return self.__class__.__name__ + ": ..."
+
+        # stubbed out for now - creates awful memory and perf issues
+        self._revertClass = self.__class__
+        self.__class__ = _ForwardNoRecurse
+        try:
+            if self.expr is not None:
+                retString = _ustr(self.expr)
+            else:
+                retString = "None"
+        finally:
+            self.__class__ = self._revertClass
+        return self.__class__.__name__ + ": " + retString
+
+    def copy(self):
+        if self.expr is not None:
+            return super(Forward,self).copy()
+        else:
+            ret = Forward()
+            ret <<= self
+            return ret
+
+class _ForwardNoRecurse(Forward):
+    def __str__( self ):
+        return "..."
+
+class TokenConverter(ParseElementEnhance):
+    """
+    Abstract subclass of C{ParseExpression}, for converting parsed results.
+    """
+    def __init__( self, expr, savelist=False ):
+        super(TokenConverter,self).__init__( expr )#, savelist )
+        self.saveAsList = False
+
+class Combine(TokenConverter):
+    """
+    Converter to concatenate all matching tokens to a single string.
+    By default, the matching patterns must also be contiguous in the input string;
+    this can be disabled by specifying C{'adjacent=False'} in the constructor.
+
+    Example::
+        real = Word(nums) + '.' + Word(nums)
+        print(real.parseString('3.1416')) # -> ['3', '.', '1416']
+        # will also erroneously match the following
+        print(real.parseString('3. 1416')) # -> ['3', '.', '1416']
+
+        real = Combine(Word(nums) + '.' + Word(nums))
+        print(real.parseString('3.1416')) # -> ['3.1416']
+        # no match when there are internal spaces
+        print(real.parseString('3. 1416')) # -> Exception: Expected W:(0123...)
+    """
+    def __init__( self, expr, joinString="", adjacent=True ):
+        super(Combine,self).__init__( expr )
+        # suppress whitespace-stripping in contained parse expressions, but re-enable it on the Combine itself
+        if adjacent:
+            self.leaveWhitespace()
+        self.adjacent = adjacent
+        self.skipWhitespace = True
+        self.joinString = joinString
+        self.callPreparse = True
+
+    def ignore( self, other ):
+        if self.adjacent:
+            ParserElement.ignore(self, other)
+        else:
+            super( Combine, self).ignore( other )
+        return self
+
+    def postParse( self, instring, loc, tokenlist ):
+        retToks = tokenlist.copy()
+        del retToks[:]
+        retToks += ParseResults([ "".join(tokenlist._asStringList(self.joinString)) ], modal=self.modalResults)
+
+        if self.resultsName and retToks.haskeys():
+            return [ retToks ]
+        else:
+            return retToks
+
+class Group(TokenConverter):
+    """
+    Converter to return the matched tokens as a list - useful for returning tokens of C{L{ZeroOrMore}} and C{L{OneOrMore}} expressions.
+
+    Example::
+        ident = Word(alphas)
+        num = Word(nums)
+        term = ident | num
+        func = ident + Optional(delimitedList(term))
+        print(func.parseString("fn a,b,100"))  # -> ['fn', 'a', 'b', '100']
+
+        func = ident + Group(Optional(delimitedList(term)))
+        print(func.parseString("fn a,b,100"))  # -> ['fn', ['a', 'b', '100']]
+    """
+    def __init__( self, expr ):
+        super(Group,self).__init__( expr )
+        self.saveAsList = True
+
+    def postParse( self, instring, loc, tokenlist ):
+        return [ tokenlist ]
+
+class Dict(TokenConverter):
+    """
+    Converter to return a repetitive expression as a list, but also as a dictionary.
+    Each element can also be referenced using the first token in the expression as its key.
+    Useful for tabular report scraping when the first column can be used as a item key.
+
+    Example::
+        data_word = Word(alphas)
+        label = data_word + FollowedBy(':')
+        attr_expr = Group(label + Suppress(':') + OneOrMore(data_word).setParseAction(' '.join))
+
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        
+        # print attributes as plain groups
+        print(OneOrMore(attr_expr).parseString(text).dump())
+        
+        # instead of OneOrMore(expr), parse using Dict(OneOrMore(Group(expr))) - Dict will auto-assign names
+        result = Dict(OneOrMore(Group(attr_expr))).parseString(text)
+        print(result.dump())
+        
+        # access named fields as dict entries, or output as dict
+        print(result['shape'])        
+        print(result.asDict())
+    prints::
+        ['shape', 'SQUARE', 'posn', 'upper left', 'color', 'light blue', 'texture', 'burlap']
+
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        {'color': 'light blue', 'posn': 'upper left', 'texture': 'burlap', 'shape': 'SQUARE'}
+    See more examples at L{ParseResults} of accessing fields by results name.
+    """
+    def __init__( self, expr ):
+        super(Dict,self).__init__( expr )
+        self.saveAsList = True
+
+    def postParse( self, instring, loc, tokenlist ):
+        for i,tok in enumerate(tokenlist):
+            if len(tok) == 0:
+                continue
+            ikey = tok[0]
+            if isinstance(ikey,int):
+                ikey = _ustr(tok[0]).strip()
+            if len(tok)==1:
+                tokenlist[ikey] = _ParseResultsWithOffset("",i)
+            elif len(tok)==2 and not isinstance(tok[1],ParseResults):
+                tokenlist[ikey] = _ParseResultsWithOffset(tok[1],i)
+            else:
+                dictvalue = tok.copy() #ParseResults(i)
+                del dictvalue[0]
+                if len(dictvalue)!= 1 or (isinstance(dictvalue,ParseResults) and dictvalue.haskeys()):
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue,i)
+                else:
+                    tokenlist[ikey] = _ParseResultsWithOffset(dictvalue[0],i)
+
+        if self.resultsName:
+            return [ tokenlist ]
+        else:
+            return tokenlist
+
+
+class Suppress(TokenConverter):
+    """
+    Converter for ignoring the results of a parsed expression.
+
+    Example::
+        source = "a, b, c,d"
+        wd = Word(alphas)
+        wd_list1 = wd + ZeroOrMore(',' + wd)
+        print(wd_list1.parseString(source))
+
+        # often, delimiters that are useful during parsing are just in the
+        # way afterward - use Suppress to keep them out of the parsed output
+        wd_list2 = wd + ZeroOrMore(Suppress(',') + wd)
+        print(wd_list2.parseString(source))
+    prints::
+        ['a', ',', 'b', ',', 'c', ',', 'd']
+        ['a', 'b', 'c', 'd']
+    (See also L{delimitedList}.)
+    """
+    def postParse( self, instring, loc, tokenlist ):
+        return []
+
+    def suppress( self ):
+        return self
+
+
+class OnlyOnce(object):
+    """
+    Wrapper for parse actions, to ensure they are only called once.
+    """
+    def __init__(self, methodCall):
+        self.callable = _trim_arity(methodCall)
+        self.called = False
+    def __call__(self,s,l,t):
+        if not self.called:
+            results = self.callable(s,l,t)
+            self.called = True
+            return results
+        raise ParseException(s,l,"")
+    def reset(self):
+        self.called = False
+
+def traceParseAction(f):
+    """
+    Decorator for debugging parse actions. 
+    
+    When the parse action is called, this decorator will print C{">> entering I{method-name}(line:I{current_source_line}, I{parse_location}, I{matched_tokens})".}
+    When the parse action completes, the decorator will print C{"<<"} followed by the returned value, or any exception that the parse action raised.
+
+    Example::
+        wd = Word(alphas)
+
+        @traceParseAction
+        def remove_duplicate_chars(tokens):
+            return ''.join(sorted(set(''.join(tokens))))
+
+        wds = OneOrMore(wd).setParseAction(remove_duplicate_chars)
+        print(wds.parseString("slkdjs sld sldd sdlf sdljf"))
+    prints::
+        >>entering remove_duplicate_chars(line: 'slkdjs sld sldd sdlf sdljf', 0, (['slkdjs', 'sld', 'sldd', 'sdlf', 'sdljf'], {}))
+        <<leaving remove_duplicate_chars (ret: 'dfjkls')
+        ['dfjkls']
+    """
+    f = _trim_arity(f)
+    def z(*paArgs):
+        thisFunc = f.__name__
+        s,l,t = paArgs[-3:]
+        if len(paArgs)>3:
+            thisFunc = paArgs[0].__class__.__name__ + '.' + thisFunc
+        sys.stderr.write( ">>entering %s(line: '%s', %d, %r)\n" % (thisFunc,line(l,s),l,t) )
+        try:
+            ret = f(*paArgs)
+        except Exception as exc:
+            sys.stderr.write( "<<leaving %s (exception: %s)\n" % (thisFunc,exc) )
+            raise
+        sys.stderr.write( "<<leaving %s (ret: %r)\n" % (thisFunc,ret) )
+        return ret
+    try:
+        z.__name__ = f.__name__
+    except AttributeError:
+        pass
+    return z
+
+#
+# global helpers
+#
+def delimitedList( expr, delim=",", combine=False ):
+    """
+    Helper to define a delimited list of expressions - the delimiter defaults to ','.
+    By default, the list elements and delimiters can have intervening whitespace, and
+    comments, but this can be overridden by passing C{combine=True} in the constructor.
+    If C{combine} is set to C{True}, the matching tokens are returned as a single token
+    string, with the delimiters included; otherwise, the matching tokens are returned
+    as a list of tokens, with the delimiters suppressed.
+
+    Example::
+        delimitedList(Word(alphas)).parseString("aa,bb,cc") # -> ['aa', 'bb', 'cc']
+        delimitedList(Word(hexnums), delim=':', combine=True).parseString("AA:BB:CC:DD:EE") # -> ['AA:BB:CC:DD:EE']
+    """
+    dlName = _ustr(expr)+" ["+_ustr(delim)+" "+_ustr(expr)+"]..."
+    if combine:
+        return Combine( expr + ZeroOrMore( delim + expr ) ).setName(dlName)
+    else:
+        return ( expr + ZeroOrMore( Suppress( delim ) + expr ) ).setName(dlName)
+
+def countedArray( expr, intExpr=None ):
+    """
+    Helper to define a counted list of expressions.
+    This helper defines a pattern of the form::
+        integer expr expr expr...
+    where the leading integer tells how many expr expressions follow.
+    The matched tokens returns the array of expr tokens as a list - the leading count token is suppressed.
+    
+    If C{intExpr} is specified, it should be a pyparsing expression that produces an integer value.
+
+    Example::
+        countedArray(Word(alphas)).parseString('2 ab cd ef')  # -> ['ab', 'cd']
+
+        # in this parser, the leading integer value is given in binary,
+        # '10' indicating that 2 values are in the array
+        binaryConstant = Word('01').setParseAction(lambda t: int(t[0], 2))
+        countedArray(Word(alphas), intExpr=binaryConstant).parseString('10 ab cd ef')  # -> ['ab', 'cd']
+    """
+    arrayExpr = Forward()
+    def countFieldParseAction(s,l,t):
+        n = t[0]
+        arrayExpr << (n and Group(And([expr]*n)) or Group(empty))
+        return []
+    if intExpr is None:
+        intExpr = Word(nums).setParseAction(lambda t:int(t[0]))
+    else:
+        intExpr = intExpr.copy()
+    intExpr.setName("arrayLen")
+    intExpr.addParseAction(countFieldParseAction, callDuringTry=True)
+    return ( intExpr + arrayExpr ).setName('(len) ' + _ustr(expr) + '...')
+
+def _flatten(L):
+    ret = []
+    for i in L:
+        if isinstance(i,list):
+            ret.extend(_flatten(i))
+        else:
+            ret.append(i)
+    return ret
+
+def matchPreviousLiteral(expr):
+    """
+    Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks
+    for a 'repeat' of a previous expression.  For example::
+        first = Word(nums)
+        second = matchPreviousLiteral(first)
+        matchExpr = first + ":" + second
+    will match C{"1:1"}, but not C{"1:2"}.  Because this matches a
+    previous literal, will also match the leading C{"1:1"} in C{"1:10"}.
+    If this is not desired, use C{matchPreviousExpr}.
+    Do I{not} use with packrat parsing enabled.
+    """
+    rep = Forward()
+    def copyTokenToRepeater(s,l,t):
+        if t:
+            if len(t) == 1:
+                rep << t[0]
+            else:
+                # flatten t tokens
+                tflat = _flatten(t.asList())
+                rep << And(Literal(tt) for tt in tflat)
+        else:
+            rep << Empty()
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def matchPreviousExpr(expr):
+    """
+    Helper to define an expression that is indirectly defined from
+    the tokens matched in a previous expression, that is, it looks
+    for a 'repeat' of a previous expression.  For example::
+        first = Word(nums)
+        second = matchPreviousExpr(first)
+        matchExpr = first + ":" + second
+    will match C{"1:1"}, but not C{"1:2"}.  Because this matches by
+    expressions, will I{not} match the leading C{"1:1"} in C{"1:10"};
+    the expressions are evaluated first, and then compared, so
+    C{"1"} is compared with C{"10"}.
+    Do I{not} use with packrat parsing enabled.
+    """
+    rep = Forward()
+    e2 = expr.copy()
+    rep <<= e2
+    def copyTokenToRepeater(s,l,t):
+        matchTokens = _flatten(t.asList())
+        def mustMatchTheseTokens(s,l,t):
+            theseTokens = _flatten(t.asList())
+            if  theseTokens != matchTokens:
+                raise ParseException("",0,"")
+        rep.setParseAction( mustMatchTheseTokens, callDuringTry=True )
+    expr.addParseAction(copyTokenToRepeater, callDuringTry=True)
+    rep.setName('(prev) ' + _ustr(expr))
+    return rep
+
+def _escapeRegexRangeChars(s):
+    #~  escape these chars: ^-]
+    for c in r"\^-]":
+        s = s.replace(c,_bslash+c)
+    s = s.replace("\n",r"\n")
+    s = s.replace("\t",r"\t")
+    return _ustr(s)
+
+def oneOf( strs, caseless=False, useRegex=True ):
+    """
+    Helper to quickly define a set of alternative Literals, and makes sure to do
+    longest-first testing when there is a conflict, regardless of the input order,
+    but returns a C{L{MatchFirst}} for best performance.
+
+    Parameters:
+     - strs - a string of space-delimited literals, or a collection of string literals
+     - caseless - (default=C{False}) - treat all literals as caseless
+     - useRegex - (default=C{True}) - as an optimization, will generate a Regex
+          object; otherwise, will generate a C{MatchFirst} object (if C{caseless=True}, or
+          if creating a C{Regex} raises an exception)
+
+    Example::
+        comp_oper = oneOf("< = > <= >= !=")
+        var = Word(alphas)
+        number = Word(nums)
+        term = var | number
+        comparison_expr = term + comp_oper + term
+        print(comparison_expr.searchString("B = 12  AA=23 B<=AA AA>12"))
+    prints::
+        [['B', '=', '12'], ['AA', '=', '23'], ['B', '<=', 'AA'], ['AA', '>', '12']]
+    """
+    if caseless:
+        isequal = ( lambda a,b: a.upper() == b.upper() )
+        masks = ( lambda a,b: b.upper().startswith(a.upper()) )
+        parseElementClass = CaselessLiteral
+    else:
+        isequal = ( lambda a,b: a == b )
+        masks = ( lambda a,b: b.startswith(a) )
+        parseElementClass = Literal
+
+    symbols = []
+    if isinstance(strs,basestring):
+        symbols = strs.split()
+    elif isinstance(strs, Iterable):
+        symbols = list(strs)
+    else:
+        warnings.warn("Invalid argument to oneOf, expected string or iterable",
+                SyntaxWarning, stacklevel=2)
+    if not symbols:
+        return NoMatch()
+
+    i = 0
+    while i < len(symbols)-1:
+        cur = symbols[i]
+        for j,other in enumerate(symbols[i+1:]):
+            if ( isequal(other, cur) ):
+                del symbols[i+j+1]
+                break
+            elif ( masks(cur, other) ):
+                del symbols[i+j+1]
+                symbols.insert(i,other)
+                cur = other
+                break
+        else:
+            i += 1
+
+    if not caseless and useRegex:
+        #~ print (strs,"->", "|".join( [ _escapeRegexChars(sym) for sym in symbols] ))
+        try:
+            if len(symbols)==len("".join(symbols)):
+                return Regex( "[%s]" % "".join(_escapeRegexRangeChars(sym) for sym in symbols) ).setName(' | '.join(symbols))
+            else:
+                return Regex( "|".join(re.escape(sym) for sym in symbols) ).setName(' | '.join(symbols))
+        except Exception:
+            warnings.warn("Exception creating Regex for oneOf, building MatchFirst",
+                    SyntaxWarning, stacklevel=2)
+
+
+    # last resort, just use MatchFirst
+    return MatchFirst(parseElementClass(sym) for sym in symbols).setName(' | '.join(symbols))
+
+def dictOf( key, value ):
+    """
+    Helper to easily and clearly define a dictionary by specifying the respective patterns
+    for the key and value.  Takes care of defining the C{L{Dict}}, C{L{ZeroOrMore}}, and C{L{Group}} tokens
+    in the proper order.  The key pattern can include delimiting markers or punctuation,
+    as long as they are suppressed, thereby leaving the significant key text.  The value
+    pattern can include named results, so that the C{Dict} results can include named token
+    fields.
+
+    Example::
+        text = "shape: SQUARE posn: upper left color: light blue texture: burlap"
+        attr_expr = (label + Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join))
+        print(OneOrMore(attr_expr).parseString(text).dump())
+        
+        attr_label = label
+        attr_value = Suppress(':') + OneOrMore(data_word, stopOn=label).setParseAction(' '.join)
+
+        # similar to Dict, but simpler call format
+        result = dictOf(attr_label, attr_value).parseString(text)
+        print(result.dump())
+        print(result['shape'])
+        print(result.shape)  # object attribute access works too
+        print(result.asDict())
+    prints::
+        [['shape', 'SQUARE'], ['posn', 'upper left'], ['color', 'light blue'], ['texture', 'burlap']]
+        - color: light blue
+        - posn: upper left
+        - shape: SQUARE
+        - texture: burlap
+        SQUARE
+        SQUARE
+        {'color': 'light blue', 'shape': 'SQUARE', 'posn': 'upper left', 'texture': 'burlap'}
+    """
+    return Dict( ZeroOrMore( Group ( key + value ) ) )
+
+def originalTextFor(expr, asString=True):
+    """
+    Helper to return the original, untokenized text for a given expression.  Useful to
+    restore the parsed fields of an HTML start tag into the raw tag text itself, or to
+    revert separate tokens with intervening whitespace back to the original matching
+    input text. By default, returns astring containing the original parsed text.  
+       
+    If the optional C{asString} argument is passed as C{False}, then the return value is a 
+    C{L{ParseResults}} containing any results names that were originally matched, and a 
+    single token containing the original matched text from the input string.  So if 
+    the expression passed to C{L{originalTextFor}} contains expressions with defined
+    results names, you must set C{asString} to C{False} if you want to preserve those
+    results name values.
+
+    Example::
+        src = "this is test <b> bold <i>text</i> </b> normal text "
+        for tag in ("b","i"):
+            opener,closer = makeHTMLTags(tag)
+            patt = originalTextFor(opener + SkipTo(closer) + closer)
+            print(patt.searchString(src)[0])
+    prints::
+        ['<b> bold <i>text</i> </b>']
+        ['<i>text</i>']
+    """
+    locMarker = Empty().setParseAction(lambda s,loc,t: loc)
+    endlocMarker = locMarker.copy()
+    endlocMarker.callPreparse = False
+    matchExpr = locMarker("_original_start") + expr + endlocMarker("_original_end")
+    if asString:
+        extractText = lambda s,l,t: s[t._original_start:t._original_end]
+    else:
+        def extractText(s,l,t):
+            t[:] = [s[t.pop('_original_start'):t.pop('_original_end')]]
+    matchExpr.setParseAction(extractText)
+    matchExpr.ignoreExprs = expr.ignoreExprs
+    return matchExpr
+
+def ungroup(expr): 
+    """
+    Helper to undo pyparsing's default grouping of And expressions, even
+    if all but one are non-empty.
+    """
+    return TokenConverter(expr).setParseAction(lambda t:t[0])
+
+def locatedExpr(expr):
+    """
+    Helper to decorate a returned token with its starting and ending locations in the input string.
+    This helper adds the following results names:
+     - locn_start = location where matched expression begins
+     - locn_end = location where matched expression ends
+     - value = the actual parsed results
+
+    Be careful if the input text contains C{<TAB>} characters, you may want to call
+    C{L{ParserElement.parseWithTabs}}
+
+    Example::
+        wd = Word(alphas)
+        for match in locatedExpr(wd).searchString("ljsdf123lksdjjf123lkkjj1222"):
+            print(match)
+    prints::
+        [[0, 'ljsdf', 5]]
+        [[8, 'lksdjjf', 15]]
+        [[18, 'lkkjj', 23]]
+    """
+    locator = Empty().setParseAction(lambda s,l,t: l)
+    return Group(locator("locn_start") + expr("value") + locator.copy().leaveWhitespace()("locn_end"))
+
+
+# convenience constants for positional expressions
+empty       = Empty().setName("empty")
+lineStart   = LineStart().setName("lineStart")
+lineEnd     = LineEnd().setName("lineEnd")
+stringStart = StringStart().setName("stringStart")
+stringEnd   = StringEnd().setName("stringEnd")
+
+_escapedPunc = Word( _bslash, r"\[]-*.$+^?()~ ", exact=2 ).setParseAction(lambda s,l,t:t[0][1])
+_escapedHexChar = Regex(r"\\0?[xX][0-9a-fA-F]+").setParseAction(lambda s,l,t:unichr(int(t[0].lstrip(r'\0x'),16)))
+_escapedOctChar = Regex(r"\\0[0-7]+").setParseAction(lambda s,l,t:unichr(int(t[0][1:],8)))
+_singleChar = _escapedPunc | _escapedHexChar | _escapedOctChar | CharsNotIn(r'\]', exact=1)
+_charRange = Group(_singleChar + Suppress("-") + _singleChar)
+_reBracketExpr = Literal("[") + Optional("^").setResultsName("negate") + Group( OneOrMore( _charRange | _singleChar ) ).setResultsName("body") + "]"
+
+def srange(s):
+    r"""
+    Helper to easily define string ranges for use in Word construction.  Borrows
+    syntax from regexp '[]' string range definitions::
+        srange("[0-9]")   -> "0123456789"
+        srange("[a-z]")   -> "abcdefghijklmnopqrstuvwxyz"
+        srange("[a-z$_]") -> "abcdefghijklmnopqrstuvwxyz$_"
+    The input string must be enclosed in []'s, and the returned string is the expanded
+    character set joined into a single string.
+    The values enclosed in the []'s may be:
+     - a single character
+     - an escaped character with a leading backslash (such as C{\-} or C{\]})
+     - an escaped hex character with a leading C{'\x'} (C{\x21}, which is a C{'!'} character) 
+         (C{\0x##} is also supported for backwards compatibility) 
+     - an escaped octal character with a leading C{'\0'} (C{\041}, which is a C{'!'} character)
+     - a range of any of the above, separated by a dash (C{'a-z'}, etc.)
+     - any combination of the above (C{'aeiouy'}, C{'a-zA-Z0-9_$'}, etc.)
+    """
+    _expanded = lambda p: p if not isinstance(p,ParseResults) else ''.join(unichr(c) for c in range(ord(p[0]),ord(p[1])+1))
+    try:
+        return "".join(_expanded(part) for part in _reBracketExpr.parseString(s).body)
+    except Exception:
+        return ""
+
+def matchOnlyAtCol(n):
+    """
+    Helper method for defining parse actions that require matching at a specific
+    column in the input text.
+    """
+    def verifyCol(strg,locn,toks):
+        if col(locn,strg) != n:
+            raise ParseException(strg,locn,"matched token not at column %d" % n)
+    return verifyCol
+
+def replaceWith(replStr):
+    """
+    Helper method for common parse actions that simply return a literal value.  Especially
+    useful when used with C{L{transformString<ParserElement.transformString>}()}.
+
+    Example::
+        num = Word(nums).setParseAction(lambda toks: int(toks[0]))
+        na = oneOf("N/A NA").setParseAction(replaceWith(math.nan))
+        term = na | num
+        
+        OneOrMore(term).parseString("324 234 N/A 234") # -> [324, 234, nan, 234]
+    """
+    return lambda s,l,t: [replStr]
+
+def removeQuotes(s,l,t):
+    """
+    Helper parse action for removing quotation marks from parsed quoted strings.
+
+    Example::
+        # by default, quotation marks are included in parsed results
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["'Now is the Winter of our Discontent'"]
+
+        # use removeQuotes to strip quotation marks from parsed results
+        quotedString.setParseAction(removeQuotes)
+        quotedString.parseString("'Now is the Winter of our Discontent'") # -> ["Now is the Winter of our Discontent"]
+    """
+    return t[0][1:-1]
+
+def tokenMap(func, *args):
+    """
+    Helper to define a parse action by mapping a function to all elements of a ParseResults list.If any additional 
+    args are passed, they are forwarded to the given function as additional arguments after
+    the token, as in C{hex_integer = Word(hexnums).setParseAction(tokenMap(int, 16))}, which will convert the
+    parsed data to an integer using base 16.
+
+    Example (compare the last to example in L{ParserElement.transformString}::
+        hex_ints = OneOrMore(Word(hexnums)).setParseAction(tokenMap(int, 16))
+        hex_ints.runTests('''
+            00 11 22 aa FF 0a 0d 1a
+            ''')
+        
+        upperword = Word(alphas).setParseAction(tokenMap(str.upper))
+        OneOrMore(upperword).runTests('''
+            my kingdom for a horse
+            ''')
+
+        wd = Word(alphas).setParseAction(tokenMap(str.title))
+        OneOrMore(wd).setParseAction(' '.join).runTests('''
+            now is the winter of our discontent made glorious summer by this sun of york
+            ''')
+    prints::
+        00 11 22 aa FF 0a 0d 1a
+        [0, 17, 34, 170, 255, 10, 13, 26]
+
+        my kingdom for a horse
+        ['MY', 'KINGDOM', 'FOR', 'A', 'HORSE']
+
+        now is the winter of our discontent made glorious summer by this sun of york
+        ['Now Is The Winter Of Our Discontent Made Glorious Summer By This Sun Of York']
+    """
+    def pa(s,l,t):
+        return [func(tokn, *args) for tokn in t]
+
+    try:
+        func_name = getattr(func, '__name__', 
+                            getattr(func, '__class__').__name__)
+    except Exception:
+        func_name = str(func)
+    pa.__name__ = func_name
+
+    return pa
+
+upcaseTokens = tokenMap(lambda t: _ustr(t).upper())
+"""(Deprecated) Helper parse action to convert tokens to upper case. Deprecated in favor of L{pyparsing_common.upcaseTokens}"""
+
+downcaseTokens = tokenMap(lambda t: _ustr(t).lower())
+"""(Deprecated) Helper parse action to convert tokens to lower case. Deprecated in favor of L{pyparsing_common.downcaseTokens}"""
+    
+def _makeTags(tagStr, xml):
+    """Internal helper to construct opening and closing tag expressions, given a tag name"""
+    if isinstance(tagStr,basestring):
+        resname = tagStr
+        tagStr = Keyword(tagStr, caseless=not xml)
+    else:
+        resname = tagStr.name
+
+    tagAttrName = Word(alphas,alphanums+"_-:")
+    if (xml):
+        tagAttrValue = dblQuotedString.copy().setParseAction( removeQuotes )
+        openTag = Suppress("<") + tagStr("tag") + \
+                Dict(ZeroOrMore(Group( tagAttrName + Suppress("=") + tagAttrValue ))) + \
+                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
+    else:
+        printablesLessRAbrack = "".join(c for c in printables if c not in ">")
+        tagAttrValue = quotedString.copy().setParseAction( removeQuotes ) | Word(printablesLessRAbrack)
+        openTag = Suppress("<") + tagStr("tag") + \
+                Dict(ZeroOrMore(Group( tagAttrName.setParseAction(downcaseTokens) + \
+                Optional( Suppress("=") + tagAttrValue ) ))) + \
+                Optional("/",default=[False]).setResultsName("empty").setParseAction(lambda s,l,t:t[0]=='/') + Suppress(">")
+    closeTag = Combine(_L("</") + tagStr + ">")
+
+    openTag = openTag.setResultsName("start"+"".join(resname.replace(":"," ").title().split())).setName("<%s>" % resname)
+    closeTag = closeTag.setResultsName("end"+"".join(resname.replace(":"," ").title().split())).setName("</%s>" % resname)
+    openTag.tag = resname
+    closeTag.tag = resname
+    return openTag, closeTag
+
+def makeHTMLTags(tagStr):
+    """
+    Helper to construct opening and closing tag expressions for HTML, given a tag name. Matches
+    tags in either upper or lower case, attributes with namespaces and with quoted or unquoted values.
+
+    Example::
+        text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
+        # makeHTMLTags returns pyparsing expressions for the opening and closing tags as a 2-tuple
+        a,a_end = makeHTMLTags("A")
+        link_expr = a + SkipTo(a_end)("link_text") + a_end
+        
+        for link in link_expr.searchString(text):
+            # attributes in the <A> tag (like "href" shown here) are also accessible as named results
+            print(link.link_text, '->', link.href)
+    prints::
+        pyparsing -> http://pyparsing.wikispaces.com
+    """
+    return _makeTags( tagStr, False )
+
+def makeXMLTags(tagStr):
+    """
+    Helper to construct opening and closing tag expressions for XML, given a tag name. Matches
+    tags only in the given upper/lower case.
+
+    Example: similar to L{makeHTMLTags}
+    """
+    return _makeTags( tagStr, True )
+
+def withAttribute(*args,**attrDict):
+    """
+    Helper to create a validating parse action to be used with start tags created
+    with C{L{makeXMLTags}} or C{L{makeHTMLTags}}. Use C{withAttribute} to qualify a starting tag
+    with a required attribute value, to avoid false matches on common tags such as
+    C{<TD>} or C{<DIV>}.
+
+    Call C{withAttribute} with a series of attribute names and values. Specify the list
+    of filter attributes names and values as:
+     - keyword arguments, as in C{(align="right")}, or
+     - as an explicit dict with C{**} operator, when an attribute name is also a Python
+          reserved word, as in C{**{"class":"Customer", "align":"right"}}
+     - a list of name-value tuples, as in ( ("ns1:class", "Customer"), ("ns2:align","right") )
+    For attribute names with a namespace prefix, you must use the second form.  Attribute
+    names are matched insensitive to upper/lower case.
+       
+    If just testing for C{class} (with or without a namespace), use C{L{withClass}}.
+
+    To verify that the attribute exists, but without specifying a value, pass
+    C{withAttribute.ANY_VALUE} as the value.
+
+    Example::
+        html = '''
+            <div>
+            Some text
+            <div type="grid">1 4 0 1 0</div>
+            <div type="graph">1,3 2,3 1,1</div>
+            <div>this has no type</div>
+            </div>
+                
+        '''
+        div,div_end = makeHTMLTags("div")
+
+        # only match div tag having a type attribute with value "grid"
+        div_grid = div().setParseAction(withAttribute(type="grid"))
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+        
+        # construct a match with any div tag having a type attribute, regardless of the value
+        div_any_type = div().setParseAction(withAttribute(type=withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+    prints::
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    if args:
+        attrs = args[:]
+    else:
+        attrs = attrDict.items()
+    attrs = [(k,v) for k,v in attrs]
+    def pa(s,l,tokens):
+        for attrName,attrValue in attrs:
+            if attrName not in tokens:
+                raise ParseException(s,l,"no matching attribute " + attrName)
+            if attrValue != withAttribute.ANY_VALUE and tokens[attrName] != attrValue:
+                raise ParseException(s,l,"attribute '%s' has value '%s', must be '%s'" %
+                                            (attrName, tokens[attrName], attrValue))
+    return pa
+withAttribute.ANY_VALUE = object()
+
+def withClass(classname, namespace=''):
+    """
+    Simplified version of C{L{withAttribute}} when matching on a div class - made
+    difficult because C{class} is a reserved word in Python.
+
+    Example::
+        html = '''
+            <div>
+            Some text
+            <div class="grid">1 4 0 1 0</div>
+            <div class="graph">1,3 2,3 1,1</div>
+            <div>this &lt;div&gt; has no class</div>
+            </div>
+                
+        '''
+        div,div_end = makeHTMLTags("div")
+        div_grid = div().setParseAction(withClass("grid"))
+        
+        grid_expr = div_grid + SkipTo(div | div_end)("body")
+        for grid_header in grid_expr.searchString(html):
+            print(grid_header.body)
+        
+        div_any_type = div().setParseAction(withClass(withAttribute.ANY_VALUE))
+        div_expr = div_any_type + SkipTo(div | div_end)("body")
+        for div_header in div_expr.searchString(html):
+            print(div_header.body)
+    prints::
+        1 4 0 1 0
+
+        1 4 0 1 0
+        1,3 2,3 1,1
+    """
+    classattr = "%s:class" % namespace if namespace else "class"
+    return withAttribute(**{classattr : classname})        
+
+opAssoc = _Constants()
+opAssoc.LEFT = object()
+opAssoc.RIGHT = object()
+
+def infixNotation( baseExpr, opList, lpar=Suppress('('), rpar=Suppress(')') ):
+    """
+    Helper method for constructing grammars of expressions made up of
+    operators working in a precedence hierarchy.  Operators may be unary or
+    binary, left- or right-associative.  Parse actions can also be attached
+    to operator expressions. The generated parser will also recognize the use 
+    of parentheses to override operator precedences (see example below).
+    
+    Note: if you define a deep operator list, you may see performance issues
+    when using infixNotation. See L{ParserElement.enablePackrat} for a
+    mechanism to potentially improve your parser performance.
+
+    Parameters:
+     - baseExpr - expression representing the most basic element for the nested
+     - opList - list of tuples, one for each operator precedence level in the
+      expression grammar; each tuple is of the form
+      (opExpr, numTerms, rightLeftAssoc, parseAction), where:
+       - opExpr is the pyparsing expression for the operator;
+          may also be a string, which will be converted to a Literal;
+          if numTerms is 3, opExpr is a tuple of two expressions, for the
+          two operators separating the 3 terms
+       - numTerms is the number of terms for this operator (must
+          be 1, 2, or 3)
+       - rightLeftAssoc is the indicator whether the operator is
+          right or left associative, using the pyparsing-defined
+          constants C{opAssoc.RIGHT} and C{opAssoc.LEFT}.
+       - parseAction is the parse action to be associated with
+          expressions matching this operator expression (the
+          parse action tuple member may be omitted); if the parse action
+          is passed a tuple or list of functions, this is equivalent to
+          calling C{setParseAction(*fn)} (L{ParserElement.setParseAction})
+     - lpar - expression for matching left-parentheses (default=C{Suppress('(')})
+     - rpar - expression for matching right-parentheses (default=C{Suppress(')')})
+
+    Example::
+        # simple example of four-function arithmetic with ints and variable names
+        integer = pyparsing_common.signed_integer
+        varname = pyparsing_common.identifier 
+        
+        arith_expr = infixNotation(integer | varname,
+            [
+            ('-', 1, opAssoc.RIGHT),
+            (oneOf('* /'), 2, opAssoc.LEFT),
+            (oneOf('+ -'), 2, opAssoc.LEFT),
+            ])
+        
+        arith_expr.runTests('''
+            5+3*6
+            (5+3)*6
+            -2--11
+            ''', fullDump=False)
+    prints::
+        5+3*6
+        [[5, '+', [3, '*', 6]]]
+
+        (5+3)*6
+        [[[5, '+', 3], '*', 6]]
+
+        -2--11
+        [[['-', 2], '-', ['-', 11]]]
+    """
+    ret = Forward()
+    lastExpr = baseExpr | ( lpar + ret + rpar )
+    for i,operDef in enumerate(opList):
+        opExpr,arity,rightLeftAssoc,pa = (operDef + (None,))[:4]
+        termName = "%s term" % opExpr if arity < 3 else "%s%s term" % opExpr
+        if arity == 3:
+            if opExpr is None or len(opExpr) != 2:
+                raise ValueError("if numterms=3, opExpr must be a tuple or list of two expressions")
+            opExpr1, opExpr2 = opExpr
+        thisExpr = Forward().setName(termName)
+        if rightLeftAssoc == opAssoc.LEFT:
+            if arity == 1:
+                matchExpr = FollowedBy(lastExpr + opExpr) + Group( lastExpr + OneOrMore( opExpr ) )
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = FollowedBy(lastExpr + opExpr + lastExpr) + Group( lastExpr + OneOrMore( opExpr + lastExpr ) )
+                else:
+                    matchExpr = FollowedBy(lastExpr+lastExpr) + Group( lastExpr + OneOrMore(lastExpr) )
+            elif arity == 3:
+                matchExpr = FollowedBy(lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr) + \
+                            Group( lastExpr + opExpr1 + lastExpr + opExpr2 + lastExpr )
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        elif rightLeftAssoc == opAssoc.RIGHT:
+            if arity == 1:
+                # try to avoid LR with this extra test
+                if not isinstance(opExpr, Optional):
+                    opExpr = Optional(opExpr)
+                matchExpr = FollowedBy(opExpr.expr + thisExpr) + Group( opExpr + thisExpr )
+            elif arity == 2:
+                if opExpr is not None:
+                    matchExpr = FollowedBy(lastExpr + opExpr + thisExpr) + Group( lastExpr + OneOrMore( opExpr + thisExpr ) )
+                else:
+                    matchExpr = FollowedBy(lastExpr + thisExpr) + Group( lastExpr + OneOrMore( thisExpr ) )
+            elif arity == 3:
+                matchExpr = FollowedBy(lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr) + \
+                            Group( lastExpr + opExpr1 + thisExpr + opExpr2 + thisExpr )
+            else:
+                raise ValueError("operator must be unary (1), binary (2), or ternary (3)")
+        else:
+            raise ValueError("operator must indicate right or left associativity")
+        if pa:
+            if isinstance(pa, (tuple, list)):
+                matchExpr.setParseAction(*pa)
+            else:
+                matchExpr.setParseAction(pa)
+        thisExpr <<= ( matchExpr.setName(termName) | lastExpr )
+        lastExpr = thisExpr
+    ret <<= lastExpr
+    return ret
+
+operatorPrecedence = infixNotation
+"""(Deprecated) Former name of C{L{infixNotation}}, will be dropped in a future release."""
+
+dblQuotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"').setName("string enclosed in double quotes")
+sglQuotedString = Combine(Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("string enclosed in single quotes")
+quotedString = Combine(Regex(r'"(?:[^"\n\r\\]|(?:"")|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*')+'"'|
+                       Regex(r"'(?:[^'\n\r\\]|(?:'')|(?:\\(?:[^x]|x[0-9a-fA-F]+)))*")+"'").setName("quotedString using single or double quotes")
+unicodeString = Combine(_L('u') + quotedString.copy()).setName("unicode string literal")
+
+def nestedExpr(opener="(", closer=")", content=None, ignoreExpr=quotedString.copy()):
+    """
+    Helper method for defining nested lists enclosed in opening and closing
+    delimiters ("(" and ")" are the default).
+
+    Parameters:
+     - opener - opening character for a nested list (default=C{"("}); can also be a pyparsing expression
+     - closer - closing character for a nested list (default=C{")"}); can also be a pyparsing expression
+     - content - expression for items within the nested lists (default=C{None})
+     - ignoreExpr - expression for ignoring opening and closing delimiters (default=C{quotedString})
+
+    If an expression is not provided for the content argument, the nested
+    expression will capture all whitespace-delimited content between delimiters
+    as a list of separate values.
+
+    Use the C{ignoreExpr} argument to define expressions that may contain
+    opening or closing characters that should not be treated as opening
+    or closing characters for nesting, such as quotedString or a comment
+    expression.  Specify multiple expressions using an C{L{Or}} or C{L{MatchFirst}}.
+    The default is L{quotedString}, but if no expressions are to be ignored,
+    then pass C{None} for this argument.
+
+    Example::
+        data_type = oneOf("void int short long char float double")
+        decl_data_type = Combine(data_type + Optional(Word('*')))
+        ident = Word(alphas+'_', alphanums+'_')
+        number = pyparsing_common.number
+        arg = Group(decl_data_type + ident)
+        LPAR,RPAR = map(Suppress, "()")
+
+        code_body = nestedExpr('{', '}', ignoreExpr=(quotedString | cStyleComment))
+
+        c_function = (decl_data_type("type") 
+                      + ident("name")
+                      + LPAR + Optional(delimitedList(arg), [])("args") + RPAR 
+                      + code_body("body"))
+        c_function.ignore(cStyleComment)
+        
+        source_code = '''
+            int is_odd(int x) { 
+                return (x%2); 
+            }
+                
+            int dec_to_hex(char hchar) { 
+                if (hchar >= '0' && hchar <= '9') { 
+                    return (ord(hchar)-ord('0')); 
+                } else { 
+                    return (10+ord(hchar)-ord('A'));
+                } 
+            }
+        '''
+        for func in c_function.searchString(source_code):
+            print("%(name)s (%(type)s) args: %(args)s" % func)
+
+    prints::
+        is_odd (int) args: [['int', 'x']]
+        dec_to_hex (int) args: [['char', 'hchar']]
+    """
+    if opener == closer:
+        raise ValueError("opening and closing strings cannot be the same")
+    if content is None:
+        if isinstance(opener,basestring) and isinstance(closer,basestring):
+            if len(opener) == 1 and len(closer)==1:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr +
+                                    CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+                else:
+                    content = (empty.copy()+CharsNotIn(opener+closer+ParserElement.DEFAULT_WHITE_CHARS
+                                ).setParseAction(lambda t:t[0].strip()))
+            else:
+                if ignoreExpr is not None:
+                    content = (Combine(OneOrMore(~ignoreExpr + 
+                                    ~Literal(opener) + ~Literal(closer) +
+                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+                else:
+                    content = (Combine(OneOrMore(~Literal(opener) + ~Literal(closer) +
+                                    CharsNotIn(ParserElement.DEFAULT_WHITE_CHARS,exact=1))
+                                ).setParseAction(lambda t:t[0].strip()))
+        else:
+            raise ValueError("opening and closing arguments must be strings if no content expression is given")
+    ret = Forward()
+    if ignoreExpr is not None:
+        ret <<= Group( Suppress(opener) + ZeroOrMore( ignoreExpr | ret | content ) + Suppress(closer) )
+    else:
+        ret <<= Group( Suppress(opener) + ZeroOrMore( ret | content )  + Suppress(closer) )
+    ret.setName('nested %s%s expression' % (opener,closer))
+    return ret
+
+def indentedBlock(blockStatementExpr, indentStack, indent=True):
+    """
+    Helper method for defining space-delimited indentation blocks, such as
+    those used to define block statements in Python source code.
+
+    Parameters:
+     - blockStatementExpr - expression defining syntax of statement that
+            is repeated within the indented block
+     - indentStack - list created by caller to manage indentation stack
+            (multiple statementWithIndentedBlock expressions within a single grammar
+            should share a common indentStack)
+     - indent - boolean indicating whether block must be indented beyond the
+            the current level; set to False for block of left-most statements
+            (default=C{True})
+
+    A valid block must contain at least one C{blockStatement}.
+
+    Example::
+        data = '''
+        def A(z):
+          A1
+          B = 100
+          G = A2
+          A2
+          A3
+        B
+        def BB(a,b,c):
+          BB1
+          def BBA():
+            bba1
+            bba2
+            bba3
+        C
+        D
+        def spam(x,y):
+             def eggs(z):
+                 pass
+        '''
+
+
+        indentStack = [1]
+        stmt = Forward()
+
+        identifier = Word(alphas, alphanums)
+        funcDecl = ("def" + identifier + Group( "(" + Optional( delimitedList(identifier) ) + ")" ) + ":")
+        func_body = indentedBlock(stmt, indentStack)
+        funcDef = Group( funcDecl + func_body )
+
+        rvalue = Forward()
+        funcCall = Group(identifier + "(" + Optional(delimitedList(rvalue)) + ")")
+        rvalue << (funcCall | identifier | Word(nums))
+        assignment = Group(identifier + "=" + rvalue)
+        stmt << ( funcDef | assignment | identifier )
+
+        module_body = OneOrMore(stmt)
+
+        parseTree = module_body.parseString(data)
+        parseTree.pprint()
+    prints::
+        [['def',
+          'A',
+          ['(', 'z', ')'],
+          ':',
+          [['A1'], [['B', '=', '100']], [['G', '=', 'A2']], ['A2'], ['A3']]],
+         'B',
+         ['def',
+          'BB',
+          ['(', 'a', 'b', 'c', ')'],
+          ':',
+          [['BB1'], [['def', 'BBA', ['(', ')'], ':', [['bba1'], ['bba2'], ['bba3']]]]]],
+         'C',
+         'D',
+         ['def',
+          'spam',
+          ['(', 'x', 'y', ')'],
+          ':',
+          [[['def', 'eggs', ['(', 'z', ')'], ':', [['pass']]]]]]] 
+    """
+    def checkPeerIndent(s,l,t):
+        if l >= len(s): return
+        curCol = col(l,s)
+        if curCol != indentStack[-1]:
+            if curCol > indentStack[-1]:
+                raise ParseFatalException(s,l,"illegal nesting")
+            raise ParseException(s,l,"not a peer entry")
+
+    def checkSubIndent(s,l,t):
+        curCol = col(l,s)
+        if curCol > indentStack[-1]:
+            indentStack.append( curCol )
+        else:
+            raise ParseException(s,l,"not a subentry")
+
+    def checkUnindent(s,l,t):
+        if l >= len(s): return
+        curCol = col(l,s)
+        if not(indentStack and curCol < indentStack[-1] and curCol <= indentStack[-2]):
+            raise ParseException(s,l,"not an unindent")
+        indentStack.pop()
+
+    NL = OneOrMore(LineEnd().setWhitespaceChars("\t ").suppress())
+    INDENT = (Empty() + Empty().setParseAction(checkSubIndent)).setName('INDENT')
+    PEER   = Empty().setParseAction(checkPeerIndent).setName('')
+    UNDENT = Empty().setParseAction(checkUnindent).setName('UNINDENT')
+    if indent:
+        smExpr = Group( Optional(NL) +
+            #~ FollowedBy(blockStatementExpr) +
+            INDENT + (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) + UNDENT)
+    else:
+        smExpr = Group( Optional(NL) +
+            (OneOrMore( PEER + Group(blockStatementExpr) + Optional(NL) )) )
+    blockStatementExpr.ignore(_bslash + LineEnd())
+    return smExpr.setName('indented block')
+
+alphas8bit = srange(r"[\0xc0-\0xd6\0xd8-\0xf6\0xf8-\0xff]")
+punc8bit = srange(r"[\0xa1-\0xbf\0xd7\0xf7]")
+
+anyOpenTag,anyCloseTag = makeHTMLTags(Word(alphas,alphanums+"_:").setName('any tag'))
+_htmlEntityMap = dict(zip("gt lt amp nbsp quot apos".split(),'><& "\''))
+commonHTMLEntity = Regex('&(?P<entity>' + '|'.join(_htmlEntityMap.keys()) +");").setName("common HTML entity")
+def replaceHTMLEntity(t):
+    """Helper parser action to replace common HTML entities with their special characters"""
+    return _htmlEntityMap.get(t.entity)
+
+# it's easy to get these comment structures wrong - they're very common, so may as well make them available
+cStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/').setName("C style comment")
+"Comment of the form C{/* ... */}"
+
+htmlComment = Regex(r"<!--[\s\S]*?-->").setName("HTML comment")
+"Comment of the form C{<!-- ... -->}"
+
+restOfLine = Regex(r".*").leaveWhitespace().setName("rest of line")
+dblSlashComment = Regex(r"//(?:\\\n|[^\n])*").setName("// comment")
+"Comment of the form C{// ... (to end of line)}"
+
+cppStyleComment = Combine(Regex(r"/\*(?:[^*]|\*(?!/))*") + '*/'| dblSlashComment).setName("C++ style comment")
+"Comment of either form C{L{cStyleComment}} or C{L{dblSlashComment}}"
+
+javaStyleComment = cppStyleComment
+"Same as C{L{cppStyleComment}}"
+
+pythonStyleComment = Regex(r"#.*").setName("Python style comment")
+"Comment of the form C{# ... (to end of line)}"
+
+_commasepitem = Combine(OneOrMore(Word(printables, excludeChars=',') +
+                                  Optional( Word(" \t") +
+                                            ~Literal(",") + ~LineEnd() ) ) ).streamline().setName("commaItem")
+commaSeparatedList = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("commaSeparatedList")
+"""(Deprecated) Predefined expression of 1 or more printable words or quoted strings, separated by commas.
+   This expression is deprecated in favor of L{pyparsing_common.comma_separated_list}."""
+
+# some other useful expressions - using lower-case class name since we are really using this as a namespace
+class pyparsing_common:
+    """
+    Here are some common low-level expressions that may be useful in jump-starting parser development:
+     - numeric forms (L{integers<integer>}, L{reals<real>}, L{scientific notation<sci_real>})
+     - common L{programming identifiers<identifier>}
+     - network addresses (L{MAC<mac_address>}, L{IPv4<ipv4_address>}, L{IPv6<ipv6_address>})
+     - ISO8601 L{dates<iso8601_date>} and L{datetime<iso8601_datetime>}
+     - L{UUID<uuid>}
+     - L{comma-separated list<comma_separated_list>}
+    Parse actions:
+     - C{L{convertToInteger}}
+     - C{L{convertToFloat}}
+     - C{L{convertToDate}}
+     - C{L{convertToDatetime}}
+     - C{L{stripHTMLTags}}
+     - C{L{upcaseTokens}}
+     - C{L{downcaseTokens}}
+
+    Example::
+        pyparsing_common.number.runTests('''
+            # any int or real number, returned as the appropriate type
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.fnumber.runTests('''
+            # any int or real number, returned as float
+            100
+            -100
+            +100
+            3.14159
+            6.02e23
+            1e-12
+            ''')
+
+        pyparsing_common.hex_integer.runTests('''
+            # hex numbers
+            100
+            FF
+            ''')
+
+        pyparsing_common.fraction.runTests('''
+            # fractions
+            1/2
+            -3/4
+            ''')
+
+        pyparsing_common.mixed_integer.runTests('''
+            # mixed fractions
+            1
+            1/2
+            -3/4
+            1-3/4
+            ''')
+
+        import uuid
+        pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+        pyparsing_common.uuid.runTests('''
+            # uuid
+            12345678-1234-5678-1234-567812345678
+            ''')
+    prints::
+        # any int or real number, returned as the appropriate type
+        100
+        [100]
+
+        -100
+        [-100]
+
+        +100
+        [100]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # any int or real number, returned as float
+        100
+        [100.0]
+
+        -100
+        [-100.0]
+
+        +100
+        [100.0]
+
+        3.14159
+        [3.14159]
+
+        6.02e23
+        [6.02e+23]
+
+        1e-12
+        [1e-12]
+
+        # hex numbers
+        100
+        [256]
+
+        FF
+        [255]
+
+        # fractions
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        # mixed fractions
+        1
+        [1]
+
+        1/2
+        [0.5]
+
+        -3/4
+        [-0.75]
+
+        1-3/4
+        [1.75]
+
+        # uuid
+        12345678-1234-5678-1234-567812345678
+        [UUID('12345678-1234-5678-1234-567812345678')]
+    """
+
+    convertToInteger = tokenMap(int)
+    """
+    Parse action for converting parsed integers to Python int
+    """
+
+    convertToFloat = tokenMap(float)
+    """
+    Parse action for converting parsed numbers to Python float
+    """
+
+    integer = Word(nums).setName("integer").setParseAction(convertToInteger)
+    """expression that parses an unsigned integer, returns an int"""
+
+    hex_integer = Word(hexnums).setName("hex integer").setParseAction(tokenMap(int,16))
+    """expression that parses a hexadecimal integer, returns an int"""
+
+    signed_integer = Regex(r'[+-]?\d+').setName("signed integer").setParseAction(convertToInteger)
+    """expression that parses an integer with optional leading sign, returns an int"""
+
+    fraction = (signed_integer().setParseAction(convertToFloat) + '/' + signed_integer().setParseAction(convertToFloat)).setName("fraction")
+    """fractional expression of an integer divided by an integer, returns a float"""
+    fraction.addParseAction(lambda t: t[0]/t[-1])
+
+    mixed_integer = (fraction | signed_integer + Optional(Optional('-').suppress() + fraction)).setName("fraction or mixed integer-fraction")
+    """mixed integer of the form 'integer - fraction', with optional leading integer, returns float"""
+    mixed_integer.addParseAction(sum)
+
+    real = Regex(r'[+-]?\d+\.\d*').setName("real number").setParseAction(convertToFloat)
+    """expression that parses a floating point number and returns a float"""
+
+    sci_real = Regex(r'[+-]?\d+([eE][+-]?\d+|\.\d*([eE][+-]?\d+)?)').setName("real number with scientific notation").setParseAction(convertToFloat)
+    """expression that parses a floating point number with optional scientific notation and returns a float"""
+
+    # streamlining this expression makes the docs nicer-looking
+    number = (sci_real | real | signed_integer).streamline()
+    """any numeric expression, returns the corresponding Python type"""
+
+    fnumber = Regex(r'[+-]?\d+\.?\d*([eE][+-]?\d+)?').setName("fnumber").setParseAction(convertToFloat)
+    """any int or real number, returned as float"""
+    
+    identifier = Word(alphas+'_', alphanums+'_').setName("identifier")
+    """typical code identifier (leading alpha or '_', followed by 0 or more alphas, nums, or '_')"""
+    
+    ipv4_address = Regex(r'(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})(\.(25[0-5]|2[0-4][0-9]|1?[0-9]{1,2})){3}').setName("IPv4 address")
+    "IPv4 address (C{0.0.0.0 - 255.255.255.255})"
+
+    _ipv6_part = Regex(r'[0-9a-fA-F]{1,4}').setName("hex_integer")
+    _full_ipv6_address = (_ipv6_part + (':' + _ipv6_part)*7).setName("full IPv6 address")
+    _short_ipv6_address = (Optional(_ipv6_part + (':' + _ipv6_part)*(0,6)) + "::" + Optional(_ipv6_part + (':' + _ipv6_part)*(0,6))).setName("short IPv6 address")
+    _short_ipv6_address.addCondition(lambda t: sum(1 for tt in t if pyparsing_common._ipv6_part.matches(tt)) < 8)
+    _mixed_ipv6_address = ("::ffff:" + ipv4_address).setName("mixed IPv6 address")
+    ipv6_address = Combine((_full_ipv6_address | _mixed_ipv6_address | _short_ipv6_address).setName("IPv6 address")).setName("IPv6 address")
+    "IPv6 address (long, short, or mixed form)"
+    
+    mac_address = Regex(r'[0-9a-fA-F]{2}([:.-])[0-9a-fA-F]{2}(?:\1[0-9a-fA-F]{2}){4}').setName("MAC address")
+    "MAC address xx:xx:xx:xx:xx (may also have '-' or '.' delimiters)"
+
+    @staticmethod
+    def convertToDate(fmt="%Y-%m-%d"):
+        """
+        Helper to create a parse action for converting parsed date string to Python datetime.date
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%d"})
+
+        Example::
+            date_expr = pyparsing_common.iso8601_date.copy()
+            date_expr.setParseAction(pyparsing_common.convertToDate())
+            print(date_expr.parseString("1999-12-31"))
+        prints::
+            [datetime.date(1999, 12, 31)]
+        """
+        def cvt_fn(s,l,t):
+            try:
+                return datetime.strptime(t[0], fmt).date()
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    @staticmethod
+    def convertToDatetime(fmt="%Y-%m-%dT%H:%M:%S.%f"):
+        """
+        Helper to create a parse action for converting parsed datetime string to Python datetime.datetime
+
+        Params -
+         - fmt - format to be passed to datetime.strptime (default=C{"%Y-%m-%dT%H:%M:%S.%f"})
+
+        Example::
+            dt_expr = pyparsing_common.iso8601_datetime.copy()
+            dt_expr.setParseAction(pyparsing_common.convertToDatetime())
+            print(dt_expr.parseString("1999-12-31T23:59:59.999"))
+        prints::
+            [datetime.datetime(1999, 12, 31, 23, 59, 59, 999000)]
+        """
+        def cvt_fn(s,l,t):
+            try:
+                return datetime.strptime(t[0], fmt)
+            except ValueError as ve:
+                raise ParseException(s, l, str(ve))
+        return cvt_fn
+
+    iso8601_date = Regex(r'(?P<year>\d{4})(?:-(?P<month>\d\d)(?:-(?P<day>\d\d))?)?').setName("ISO8601 date")
+    "ISO8601 date (C{yyyy-mm-dd})"
+
+    iso8601_datetime = Regex(r'(?P<year>\d{4})-(?P<month>\d\d)-(?P<day>\d\d)[T ](?P<hour>\d\d):(?P<minute>\d\d)(:(?P<second>\d\d(\.\d*)?)?)?(?P<tz>Z|[+-]\d\d:?\d\d)?').setName("ISO8601 datetime")
+    "ISO8601 datetime (C{yyyy-mm-ddThh:mm:ss.s(Z|+-00:00)}) - trailing seconds, milliseconds, and timezone optional; accepts separating C{'T'} or C{' '}"
+
+    uuid = Regex(r'[0-9a-fA-F]{8}(-[0-9a-fA-F]{4}){3}-[0-9a-fA-F]{12}').setName("UUID")
+    "UUID (C{xxxxxxxx-xxxx-xxxx-xxxx-xxxxxxxxxxxx})"
+
+    _html_stripper = anyOpenTag.suppress() | anyCloseTag.suppress()
+    @staticmethod
+    def stripHTMLTags(s, l, tokens):
+        """
+        Parse action to remove HTML tags from web page HTML source
+
+        Example::
+            # strip HTML links from normal text 
+            text = '<td>More info at the <a href="http://pyparsing.wikispaces.com">pyparsing</a> wiki page</td>'
+            td,td_end = makeHTMLTags("TD")
+            table_text = td + SkipTo(td_end).setParseAction(pyparsing_common.stripHTMLTags)("body") + td_end
+            
+            print(table_text.parseString(text).body) # -> 'More info at the pyparsing wiki page'
+        """
+        return pyparsing_common._html_stripper.transformString(tokens[0])
+
+    _commasepitem = Combine(OneOrMore(~Literal(",") + ~LineEnd() + Word(printables, excludeChars=',') 
+                                        + Optional( White(" \t") ) ) ).streamline().setName("commaItem")
+    comma_separated_list = delimitedList( Optional( quotedString.copy() | _commasepitem, default="") ).setName("comma separated list")
+    """Predefined expression of 1 or more printable words or quoted strings, separated by commas."""
+
+    upcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).upper()))
+    """Parse action to convert tokens to upper case."""
+
+    downcaseTokens = staticmethod(tokenMap(lambda t: _ustr(t).lower()))
+    """Parse action to convert tokens to lower case."""
+
+
+if __name__ == "__main__":
+
+    selectToken    = CaselessLiteral("select")
+    fromToken      = CaselessLiteral("from")
+
+    ident          = Word(alphas, alphanums + "_$")
+
+    columnName     = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    columnNameList = Group(delimitedList(columnName)).setName("columns")
+    columnSpec     = ('*' | columnNameList)
+
+    tableName      = delimitedList(ident, ".", combine=True).setParseAction(upcaseTokens)
+    tableNameList  = Group(delimitedList(tableName)).setName("tables")
+    
+    simpleSQL      = selectToken("command") + columnSpec("columns") + fromToken + tableNameList("tables")
+
+    # demo runTests method, including embedded comments in test string
+    simpleSQL.runTests("""
+        # '*' as column list and dotted table name
+        select * from SYS.XYZZY
+
+        # caseless match on "SELECT", and casts back to "select"
+        SELECT * from XYZZY, ABC
+
+        # list of column names, and mixed case SELECT keyword
+        Select AA,BB,CC from Sys.dual
+
+        # multiple tables
+        Select A, B, C from Sys.dual, Table2
+
+        # invalid SELECT keyword - should fail
+        Xelect A, B, C from Sys.dual
+
+        # incomplete command - should fail
+        Select
+
+        # invalid column name - should fail
+        Select ^^^ frox Sys.dual
+
+        """)
+
+    pyparsing_common.number.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    # any int or real number, returned as float
+    pyparsing_common.fnumber.runTests("""
+        100
+        -100
+        +100
+        3.14159
+        6.02e23
+        1e-12
+        """)
+
+    pyparsing_common.hex_integer.runTests("""
+        100
+        FF
+        """)
+
+    import uuid
+    pyparsing_common.uuid.setParseAction(tokenMap(uuid.UUID))
+    pyparsing_common.uuid.runTests("""
+        12345678-1234-5678-1234-567812345678
+        """)
diff --git a/venv/Lib/site-packages/setuptools/archive_util.py b/venv/Lib/site-packages/setuptools/archive_util.py
new file mode 100644
index 000000000..0ce190b8c
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/archive_util.py
@@ -0,0 +1,175 @@
+"""Utilities for extracting common archive formats"""
+
+import zipfile
+import tarfile
+import os
+import shutil
+import posixpath
+import contextlib
+from distutils.errors import DistutilsError
+
+from pkg_resources import ensure_directory
+
+__all__ = [
+    "unpack_archive", "unpack_zipfile", "unpack_tarfile", "default_filter",
+    "UnrecognizedFormat", "extraction_drivers", "unpack_directory",
+]
+
+
+class UnrecognizedFormat(DistutilsError):
+    """Couldn't recognize the archive type"""
+
+
+def default_filter(src, dst):
+    """The default progress/filter callback; returns True for all files"""
+    return dst
+
+
+def unpack_archive(
+        filename, extract_dir, progress_filter=default_filter,
+        drivers=None):
+    """Unpack `filename` to `extract_dir`, or raise ``UnrecognizedFormat``
+
+    `progress_filter` is a function taking two arguments: a source path
+    internal to the archive ('/'-separated), and a filesystem path where it
+    will be extracted.  The callback must return the desired extract path
+    (which may be the same as the one passed in), or else ``None`` to skip
+    that file or directory.  The callback can thus be used to report on the
+    progress of the extraction, as well as to filter the items extracted or
+    alter their extraction paths.
+
+    `drivers`, if supplied, must be a non-empty sequence of functions with the
+    same signature as this function (minus the `drivers` argument), that raise
+    ``UnrecognizedFormat`` if they do not support extracting the designated
+    archive type.  The `drivers` are tried in sequence until one is found that
+    does not raise an error, or until all are exhausted (in which case
+    ``UnrecognizedFormat`` is raised).  If you do not supply a sequence of
+    drivers, the module's ``extraction_drivers`` constant will be used, which
+    means that ``unpack_zipfile`` and ``unpack_tarfile`` will be tried, in that
+    order.
+    """
+    for driver in drivers or extraction_drivers:
+        try:
+            driver(filename, extract_dir, progress_filter)
+        except UnrecognizedFormat:
+            continue
+        else:
+            return
+    else:
+        raise UnrecognizedFormat(
+            "Not a recognized archive type: %s" % filename
+        )
+
+
+def unpack_directory(filename, extract_dir, progress_filter=default_filter):
+    """"Unpack" a directory, using the same interface as for archives
+
+    Raises ``UnrecognizedFormat`` if `filename` is not a directory
+    """
+    if not os.path.isdir(filename):
+        raise UnrecognizedFormat("%s is not a directory" % filename)
+
+    paths = {
+        filename: ('', extract_dir),
+    }
+    for base, dirs, files in os.walk(filename):
+        src, dst = paths[base]
+        for d in dirs:
+            paths[os.path.join(base, d)] = src + d + '/', os.path.join(dst, d)
+        for f in files:
+            target = os.path.join(dst, f)
+            target = progress_filter(src + f, target)
+            if not target:
+                # skip non-files
+                continue
+            ensure_directory(target)
+            f = os.path.join(base, f)
+            shutil.copyfile(f, target)
+            shutil.copystat(f, target)
+
+
+def unpack_zipfile(filename, extract_dir, progress_filter=default_filter):
+    """Unpack zip `filename` to `extract_dir`
+
+    Raises ``UnrecognizedFormat`` if `filename` is not a zipfile (as determined
+    by ``zipfile.is_zipfile()``).  See ``unpack_archive()`` for an explanation
+    of the `progress_filter` argument.
+    """
+
+    if not zipfile.is_zipfile(filename):
+        raise UnrecognizedFormat("%s is not a zip file" % (filename,))
+
+    with zipfile.ZipFile(filename) as z:
+        for info in z.infolist():
+            name = info.filename
+
+            # don't extract absolute paths or ones with .. in them
+            if name.startswith('/') or '..' in name.split('/'):
+                continue
+
+            target = os.path.join(extract_dir, *name.split('/'))
+            target = progress_filter(name, target)
+            if not target:
+                continue
+            if name.endswith('/'):
+                # directory
+                ensure_directory(target)
+            else:
+                # file
+                ensure_directory(target)
+                data = z.read(info.filename)
+                with open(target, 'wb') as f:
+                    f.write(data)
+            unix_attributes = info.external_attr >> 16
+            if unix_attributes:
+                os.chmod(target, unix_attributes)
+
+
+def unpack_tarfile(filename, extract_dir, progress_filter=default_filter):
+    """Unpack tar/tar.gz/tar.bz2 `filename` to `extract_dir`
+
+    Raises ``UnrecognizedFormat`` if `filename` is not a tarfile (as determined
+    by ``tarfile.open()``).  See ``unpack_archive()`` for an explanation
+    of the `progress_filter` argument.
+    """
+    try:
+        tarobj = tarfile.open(filename)
+    except tarfile.TarError as e:
+        raise UnrecognizedFormat(
+            "%s is not a compressed or uncompressed tar file" % (filename,)
+        ) from e
+    with contextlib.closing(tarobj):
+        # don't do any chowning!
+        tarobj.chown = lambda *args: None
+        for member in tarobj:
+            name = member.name
+            # don't extract absolute paths or ones with .. in them
+            if not name.startswith('/') and '..' not in name.split('/'):
+                prelim_dst = os.path.join(extract_dir, *name.split('/'))
+
+                # resolve any links and to extract the link targets as normal
+                # files
+                while member is not None and (
+                        member.islnk() or member.issym()):
+                    linkpath = member.linkname
+                    if member.issym():
+                        base = posixpath.dirname(member.name)
+                        linkpath = posixpath.join(base, linkpath)
+                        linkpath = posixpath.normpath(linkpath)
+                    member = tarobj._getmember(linkpath)
+
+                if member is not None and (member.isfile() or member.isdir()):
+                    final_dst = progress_filter(name, prelim_dst)
+                    if final_dst:
+                        if final_dst.endswith(os.sep):
+                            final_dst = final_dst[:-1]
+                        try:
+                            # XXX Ugh
+                            tarobj._extract_member(member, final_dst)
+                        except tarfile.ExtractError:
+                            # chown/chmod/mkfifo/mknode/makedev failed
+                            pass
+        return True
+
+
+extraction_drivers = unpack_directory, unpack_zipfile, unpack_tarfile
diff --git a/venv/Lib/site-packages/setuptools/build_meta.py b/venv/Lib/site-packages/setuptools/build_meta.py
new file mode 100644
index 000000000..b9e8a2b3f
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/build_meta.py
@@ -0,0 +1,276 @@
+"""A PEP 517 interface to setuptools
+
+Previously, when a user or a command line tool (let's call it a "frontend")
+needed to make a request of setuptools to take a certain action, for
+example, generating a list of installation requirements, the frontend would
+would call "setup.py egg_info" or "setup.py bdist_wheel" on the command line.
+
+PEP 517 defines a different method of interfacing with setuptools. Rather
+than calling "setup.py" directly, the frontend should:
+
+  1. Set the current directory to the directory with a setup.py file
+  2. Import this module into a safe python interpreter (one in which
+     setuptools can potentially set global variables or crash hard).
+  3. Call one of the functions defined in PEP 517.
+
+What each function does is defined in PEP 517. However, here is a "casual"
+definition of the functions (this definition should not be relied on for
+bug reports or API stability):
+
+  - `build_wheel`: build a wheel in the folder and return the basename
+  - `get_requires_for_build_wheel`: get the `setup_requires` to build
+  - `prepare_metadata_for_build_wheel`: get the `install_requires`
+  - `build_sdist`: build an sdist in the folder and return the basename
+  - `get_requires_for_build_sdist`: get the `setup_requires` to build
+
+Again, this is not a formal definition! Just a "taste" of the module.
+"""
+
+import io
+import os
+import sys
+import tokenize
+import shutil
+import contextlib
+import tempfile
+
+import setuptools
+import distutils
+
+from pkg_resources import parse_requirements
+
+__all__ = ['get_requires_for_build_sdist',
+           'get_requires_for_build_wheel',
+           'prepare_metadata_for_build_wheel',
+           'build_wheel',
+           'build_sdist',
+           '__legacy__',
+           'SetupRequirementsError']
+
+
+class SetupRequirementsError(BaseException):
+    def __init__(self, specifiers):
+        self.specifiers = specifiers
+
+
+class Distribution(setuptools.dist.Distribution):
+    def fetch_build_eggs(self, specifiers):
+        specifier_list = list(map(str, parse_requirements(specifiers)))
+
+        raise SetupRequirementsError(specifier_list)
+
+    @classmethod
+    @contextlib.contextmanager
+    def patch(cls):
+        """
+        Replace
+        distutils.dist.Distribution with this class
+        for the duration of this context.
+        """
+        orig = distutils.core.Distribution
+        distutils.core.Distribution = cls
+        try:
+            yield
+        finally:
+            distutils.core.Distribution = orig
+
+
+@contextlib.contextmanager
+def no_install_setup_requires():
+    """Temporarily disable installing setup_requires
+
+    Under PEP 517, the backend reports build dependencies to the frontend,
+    and the frontend is responsible for ensuring they're installed.
+    So setuptools (acting as a backend) should not try to install them.
+    """
+    orig = setuptools._install_setup_requires
+    setuptools._install_setup_requires = lambda attrs: None
+    try:
+        yield
+    finally:
+        setuptools._install_setup_requires = orig
+
+
+def _get_immediate_subdirectories(a_dir):
+    return [name for name in os.listdir(a_dir)
+            if os.path.isdir(os.path.join(a_dir, name))]
+
+
+def _file_with_extension(directory, extension):
+    matching = (
+        f for f in os.listdir(directory)
+        if f.endswith(extension)
+    )
+    file, = matching
+    return file
+
+
+def _open_setup_script(setup_script):
+    if not os.path.exists(setup_script):
+        # Supply a default setup.py
+        return io.StringIO(u"from setuptools import setup; setup()")
+
+    return getattr(tokenize, 'open', open)(setup_script)
+
+
+class _BuildMetaBackend(object):
+
+    def _fix_config(self, config_settings):
+        config_settings = config_settings or {}
+        config_settings.setdefault('--global-option', [])
+        return config_settings
+
+    def _get_build_requires(self, config_settings, requirements):
+        config_settings = self._fix_config(config_settings)
+
+        sys.argv = sys.argv[:1] + ['egg_info'] + \
+            config_settings["--global-option"]
+        try:
+            with Distribution.patch():
+                self.run_setup()
+        except SetupRequirementsError as e:
+            requirements += e.specifiers
+
+        return requirements
+
+    def run_setup(self, setup_script='setup.py'):
+        # Note that we can reuse our build directory between calls
+        # Correctness comes first, then optimization later
+        __file__ = setup_script
+        __name__ = '__main__'
+
+        with _open_setup_script(__file__) as f:
+            code = f.read().replace(r'\r\n', r'\n')
+
+        exec(compile(code, __file__, 'exec'), locals())
+
+    def get_requires_for_build_wheel(self, config_settings=None):
+        config_settings = self._fix_config(config_settings)
+        return self._get_build_requires(
+            config_settings, requirements=['wheel'])
+
+    def get_requires_for_build_sdist(self, config_settings=None):
+        config_settings = self._fix_config(config_settings)
+        return self._get_build_requires(config_settings, requirements=[])
+
+    def prepare_metadata_for_build_wheel(self, metadata_directory,
+                                         config_settings=None):
+        sys.argv = sys.argv[:1] + [
+            'dist_info', '--egg-base', metadata_directory]
+        with no_install_setup_requires():
+            self.run_setup()
+
+        dist_info_directory = metadata_directory
+        while True:
+            dist_infos = [f for f in os.listdir(dist_info_directory)
+                          if f.endswith('.dist-info')]
+
+            if (
+                len(dist_infos) == 0 and
+                len(_get_immediate_subdirectories(dist_info_directory)) == 1
+            ):
+
+                dist_info_directory = os.path.join(
+                    dist_info_directory, os.listdir(dist_info_directory)[0])
+                continue
+
+            assert len(dist_infos) == 1
+            break
+
+        # PEP 517 requires that the .dist-info directory be placed in the
+        # metadata_directory. To comply, we MUST copy the directory to the root
+        if dist_info_directory != metadata_directory:
+            shutil.move(
+                os.path.join(dist_info_directory, dist_infos[0]),
+                metadata_directory)
+            shutil.rmtree(dist_info_directory, ignore_errors=True)
+
+        return dist_infos[0]
+
+    def _build_with_temp_dir(self, setup_command, result_extension,
+                             result_directory, config_settings):
+        config_settings = self._fix_config(config_settings)
+        result_directory = os.path.abspath(result_directory)
+
+        # Build in a temporary directory, then copy to the target.
+        os.makedirs(result_directory, exist_ok=True)
+        with tempfile.TemporaryDirectory(dir=result_directory) as tmp_dist_dir:
+            sys.argv = (sys.argv[:1] + setup_command +
+                        ['--dist-dir', tmp_dist_dir] +
+                        config_settings["--global-option"])
+            with no_install_setup_requires():
+                self.run_setup()
+
+            result_basename = _file_with_extension(
+                tmp_dist_dir, result_extension)
+            result_path = os.path.join(result_directory, result_basename)
+            if os.path.exists(result_path):
+                # os.rename will fail overwriting on non-Unix.
+                os.remove(result_path)
+            os.rename(os.path.join(tmp_dist_dir, result_basename), result_path)
+
+        return result_basename
+
+    def build_wheel(self, wheel_directory, config_settings=None,
+                    metadata_directory=None):
+        return self._build_with_temp_dir(['bdist_wheel'], '.whl',
+                                         wheel_directory, config_settings)
+
+    def build_sdist(self, sdist_directory, config_settings=None):
+        return self._build_with_temp_dir(['sdist', '--formats', 'gztar'],
+                                         '.tar.gz', sdist_directory,
+                                         config_settings)
+
+
+class _BuildMetaLegacyBackend(_BuildMetaBackend):
+    """Compatibility backend for setuptools
+
+    This is a version of setuptools.build_meta that endeavors
+    to maintain backwards
+    compatibility with pre-PEP 517 modes of invocation. It
+    exists as a temporary
+    bridge between the old packaging mechanism and the new
+    packaging mechanism,
+    and will eventually be removed.
+    """
+    def run_setup(self, setup_script='setup.py'):
+        # In order to maintain compatibility with scripts assuming that
+        # the setup.py script is in a directory on the PYTHONPATH, inject
+        # '' into sys.path. (pypa/setuptools#1642)
+        sys_path = list(sys.path)           # Save the original path
+
+        script_dir = os.path.dirname(os.path.abspath(setup_script))
+        if script_dir not in sys.path:
+            sys.path.insert(0, script_dir)
+
+        # Some setup.py scripts (e.g. in pygame and numpy) use sys.argv[0] to
+        # get the directory of the source code. They expect it to refer to the
+        # setup.py script.
+        sys_argv_0 = sys.argv[0]
+        sys.argv[0] = setup_script
+
+        try:
+            super(_BuildMetaLegacyBackend,
+                  self).run_setup(setup_script=setup_script)
+        finally:
+            # While PEP 517 frontends should be calling each hook in a fresh
+            # subprocess according to the standard (and thus it should not be
+            # strictly necessary to restore the old sys.path), we'll restore
+            # the original path so that the path manipulation does not persist
+            # within the hook after run_setup is called.
+            sys.path[:] = sys_path
+            sys.argv[0] = sys_argv_0
+
+
+# The primary backend
+_BACKEND = _BuildMetaBackend()
+
+get_requires_for_build_wheel = _BACKEND.get_requires_for_build_wheel
+get_requires_for_build_sdist = _BACKEND.get_requires_for_build_sdist
+prepare_metadata_for_build_wheel = _BACKEND.prepare_metadata_for_build_wheel
+build_wheel = _BACKEND.build_wheel
+build_sdist = _BACKEND.build_sdist
+
+
+# The legacy backend
+__legacy__ = _BuildMetaLegacyBackend()
diff --git a/venv/Lib/site-packages/setuptools/cli-32.exe b/venv/Lib/site-packages/setuptools/cli-32.exe
new file mode 100644
index 000000000..b1487b781
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/cli-32.exe differ
diff --git a/venv/Lib/site-packages/setuptools/cli-64.exe b/venv/Lib/site-packages/setuptools/cli-64.exe
new file mode 100644
index 000000000..675e6bf37
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/cli-64.exe differ
diff --git a/venv/Lib/site-packages/setuptools/cli.exe b/venv/Lib/site-packages/setuptools/cli.exe
new file mode 100644
index 000000000..b1487b781
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/cli.exe differ
diff --git a/venv/Lib/site-packages/setuptools/command/__init__.py b/venv/Lib/site-packages/setuptools/command/__init__.py
new file mode 100644
index 000000000..743f5588f
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/__init__.py
@@ -0,0 +1,17 @@
+__all__ = [
+    'alias', 'bdist_egg', 'bdist_rpm', 'build_ext', 'build_py', 'develop',
+    'easy_install', 'egg_info', 'install', 'install_lib', 'rotate', 'saveopts',
+    'sdist', 'setopt', 'test', 'install_egg_info', 'install_scripts',
+    'bdist_wininst', 'upload_docs', 'build_clib', 'dist_info',
+]
+
+from distutils.command.bdist import bdist
+import sys
+
+from setuptools.command import install_scripts
+
+if 'egg' not in bdist.format_commands:
+    bdist.format_command['egg'] = ('bdist_egg', "Python .egg file")
+    bdist.format_commands.append('egg')
+
+del bdist, sys
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..75ffbc619
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/alias.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/alias.cpython-36.pyc
new file mode 100644
index 000000000..da4a101dd
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/alias.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_egg.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_egg.cpython-36.pyc
new file mode 100644
index 000000000..841ae5616
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_egg.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_rpm.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_rpm.cpython-36.pyc
new file mode 100644
index 000000000..efb2a1814
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_rpm.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_wininst.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_wininst.cpython-36.pyc
new file mode 100644
index 000000000..3df72c3ed
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/bdist_wininst.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/build_clib.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/build_clib.cpython-36.pyc
new file mode 100644
index 000000000..a5e3ede1f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/build_clib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/build_ext.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/build_ext.cpython-36.pyc
new file mode 100644
index 000000000..b361d62d5
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/build_ext.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/build_py.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/build_py.cpython-36.pyc
new file mode 100644
index 000000000..03e18aa97
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/build_py.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/develop.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/develop.cpython-36.pyc
new file mode 100644
index 000000000..e6050310c
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/develop.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/dist_info.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/dist_info.cpython-36.pyc
new file mode 100644
index 000000000..85a618023
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/dist_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/easy_install.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/easy_install.cpython-36.pyc
new file mode 100644
index 000000000..a551b7fed
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/easy_install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/egg_info.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/egg_info.cpython-36.pyc
new file mode 100644
index 000000000..c23b01b89
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/egg_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/install.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/install.cpython-36.pyc
new file mode 100644
index 000000000..bef8301f1
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/install.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/install_egg_info.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/install_egg_info.cpython-36.pyc
new file mode 100644
index 000000000..dff947a44
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/install_egg_info.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/install_lib.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/install_lib.cpython-36.pyc
new file mode 100644
index 000000000..fcda17e7c
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/install_lib.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/install_scripts.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/install_scripts.cpython-36.pyc
new file mode 100644
index 000000000..860e5df2f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/install_scripts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/py36compat.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/py36compat.cpython-36.pyc
new file mode 100644
index 000000000..632766d14
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/py36compat.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/register.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/register.cpython-36.pyc
new file mode 100644
index 000000000..612b62e65
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/register.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/rotate.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/rotate.cpython-36.pyc
new file mode 100644
index 000000000..4aca90d86
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/rotate.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/saveopts.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/saveopts.cpython-36.pyc
new file mode 100644
index 000000000..037f2dfe9
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/saveopts.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/sdist.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/sdist.cpython-36.pyc
new file mode 100644
index 000000000..d2e63c591
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/sdist.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/setopt.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/setopt.cpython-36.pyc
new file mode 100644
index 000000000..a6fc9b02a
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/setopt.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/test.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/test.cpython-36.pyc
new file mode 100644
index 000000000..d5570e52f
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/test.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/upload.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/upload.cpython-36.pyc
new file mode 100644
index 000000000..558b71a43
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/upload.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/__pycache__/upload_docs.cpython-36.pyc b/venv/Lib/site-packages/setuptools/command/__pycache__/upload_docs.cpython-36.pyc
new file mode 100644
index 000000000..ab0167b0e
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/command/__pycache__/upload_docs.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/command/alias.py b/venv/Lib/site-packages/setuptools/command/alias.py
new file mode 100644
index 000000000..452a9244e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/alias.py
@@ -0,0 +1,78 @@
+from distutils.errors import DistutilsOptionError
+
+from setuptools.command.setopt import edit_config, option_base, config_file
+
+
+def shquote(arg):
+    """Quote an argument for later parsing by shlex.split()"""
+    for c in '"', "'", "\\", "#":
+        if c in arg:
+            return repr(arg)
+    if arg.split() != [arg]:
+        return repr(arg)
+    return arg
+
+
+class alias(option_base):
+    """Define a shortcut that invokes one or more commands"""
+
+    description = "define a shortcut to invoke one or more commands"
+    command_consumes_arguments = True
+
+    user_options = [
+        ('remove', 'r', 'remove (unset) the alias'),
+    ] + option_base.user_options
+
+    boolean_options = option_base.boolean_options + ['remove']
+
+    def initialize_options(self):
+        option_base.initialize_options(self)
+        self.args = None
+        self.remove = None
+
+    def finalize_options(self):
+        option_base.finalize_options(self)
+        if self.remove and len(self.args) != 1:
+            raise DistutilsOptionError(
+                "Must specify exactly one argument (the alias name) when "
+                "using --remove"
+            )
+
+    def run(self):
+        aliases = self.distribution.get_option_dict('aliases')
+
+        if not self.args:
+            print("Command Aliases")
+            print("---------------")
+            for alias in aliases:
+                print("setup.py alias", format_alias(alias, aliases))
+            return
+
+        elif len(self.args) == 1:
+            alias, = self.args
+            if self.remove:
+                command = None
+            elif alias in aliases:
+                print("setup.py alias", format_alias(alias, aliases))
+                return
+            else:
+                print("No alias definition found for %r" % alias)
+                return
+        else:
+            alias = self.args[0]
+            command = ' '.join(map(shquote, self.args[1:]))
+
+        edit_config(self.filename, {'aliases': {alias: command}}, self.dry_run)
+
+
+def format_alias(name, aliases):
+    source, command = aliases[name]
+    if source == config_file('global'):
+        source = '--global-config '
+    elif source == config_file('user'):
+        source = '--user-config '
+    elif source == config_file('local'):
+        source = ''
+    else:
+        source = '--filename=%r' % source
+    return source + name + ' ' + command
diff --git a/venv/Lib/site-packages/setuptools/command/bdist_egg.py b/venv/Lib/site-packages/setuptools/command/bdist_egg.py
new file mode 100644
index 000000000..a88efb45b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/bdist_egg.py
@@ -0,0 +1,501 @@
+"""setuptools.command.bdist_egg
+
+Build .egg distributions"""
+
+from distutils.errors import DistutilsSetupError
+from distutils.dir_util import remove_tree, mkpath
+from distutils import log
+from types import CodeType
+import sys
+import os
+import re
+import textwrap
+import marshal
+import warnings
+
+from pkg_resources import get_build_platform, Distribution, ensure_directory
+from pkg_resources import EntryPoint
+from setuptools.extension import Library
+from setuptools import Command, SetuptoolsDeprecationWarning
+
+from sysconfig import get_path, get_python_version
+
+
+def _get_purelib():
+    return get_path("purelib")
+
+
+def strip_module(filename):
+    if '.' in filename:
+        filename = os.path.splitext(filename)[0]
+    if filename.endswith('module'):
+        filename = filename[:-6]
+    return filename
+
+
+def sorted_walk(dir):
+    """Do os.walk in a reproducible way,
+    independent of indeterministic filesystem readdir order
+    """
+    for base, dirs, files in os.walk(dir):
+        dirs.sort()
+        files.sort()
+        yield base, dirs, files
+
+
+def write_stub(resource, pyfile):
+    _stub_template = textwrap.dedent("""
+        def __bootstrap__():
+            global __bootstrap__, __loader__, __file__
+            import sys, pkg_resources, importlib.util
+            __file__ = pkg_resources.resource_filename(__name__, %r)
+            __loader__ = None; del __bootstrap__, __loader__
+            spec = importlib.util.spec_from_file_location(__name__,__file__)
+            mod = importlib.util.module_from_spec(spec)
+            spec.loader.exec_module(mod)
+        __bootstrap__()
+        """).lstrip()
+    with open(pyfile, 'w') as f:
+        f.write(_stub_template % resource)
+
+
+class bdist_egg(Command):
+    description = "create an \"egg\" distribution"
+
+    user_options = [
+        ('bdist-dir=', 'b',
+         "temporary directory for creating the distribution"),
+        ('plat-name=', 'p', "platform name to embed in generated filenames "
+                            "(default: %s)" % get_build_platform()),
+        ('exclude-source-files', None,
+         "remove all .py files from the generated egg"),
+        ('keep-temp', 'k',
+         "keep the pseudo-installation tree around after " +
+         "creating the distribution archive"),
+        ('dist-dir=', 'd',
+         "directory to put final built distributions in"),
+        ('skip-build', None,
+         "skip rebuilding everything (for testing/debugging)"),
+    ]
+
+    boolean_options = [
+        'keep-temp', 'skip-build', 'exclude-source-files'
+    ]
+
+    def initialize_options(self):
+        self.bdist_dir = None
+        self.plat_name = None
+        self.keep_temp = 0
+        self.dist_dir = None
+        self.skip_build = 0
+        self.egg_output = None
+        self.exclude_source_files = None
+
+    def finalize_options(self):
+        ei_cmd = self.ei_cmd = self.get_finalized_command("egg_info")
+        self.egg_info = ei_cmd.egg_info
+
+        if self.bdist_dir is None:
+            bdist_base = self.get_finalized_command('bdist').bdist_base
+            self.bdist_dir = os.path.join(bdist_base, 'egg')
+
+        if self.plat_name is None:
+            self.plat_name = get_build_platform()
+
+        self.set_undefined_options('bdist', ('dist_dir', 'dist_dir'))
+
+        if self.egg_output is None:
+
+            # Compute filename of the output egg
+            basename = Distribution(
+                None, None, ei_cmd.egg_name, ei_cmd.egg_version,
+                get_python_version(),
+                self.distribution.has_ext_modules() and self.plat_name
+            ).egg_name()
+
+            self.egg_output = os.path.join(self.dist_dir, basename + '.egg')
+
+    def do_install_data(self):
+        # Hack for packages that install data to install's --install-lib
+        self.get_finalized_command('install').install_lib = self.bdist_dir
+
+        site_packages = os.path.normcase(os.path.realpath(_get_purelib()))
+        old, self.distribution.data_files = self.distribution.data_files, []
+
+        for item in old:
+            if isinstance(item, tuple) and len(item) == 2:
+                if os.path.isabs(item[0]):
+                    realpath = os.path.realpath(item[0])
+                    normalized = os.path.normcase(realpath)
+                    if normalized == site_packages or normalized.startswith(
+                        site_packages + os.sep
+                    ):
+                        item = realpath[len(site_packages) + 1:], item[1]
+                        # XXX else: raise ???
+            self.distribution.data_files.append(item)
+
+        try:
+            log.info("installing package data to %s", self.bdist_dir)
+            self.call_command('install_data', force=0, root=None)
+        finally:
+            self.distribution.data_files = old
+
+    def get_outputs(self):
+        return [self.egg_output]
+
+    def call_command(self, cmdname, **kw):
+        """Invoke reinitialized command `cmdname` with keyword args"""
+        for dirname in INSTALL_DIRECTORY_ATTRS:
+            kw.setdefault(dirname, self.bdist_dir)
+        kw.setdefault('skip_build', self.skip_build)
+        kw.setdefault('dry_run', self.dry_run)
+        cmd = self.reinitialize_command(cmdname, **kw)
+        self.run_command(cmdname)
+        return cmd
+
+    def run(self):
+        # Generate metadata first
+        self.run_command("egg_info")
+        # We run install_lib before install_data, because some data hacks
+        # pull their data path from the install_lib command.
+        log.info("installing library code to %s", self.bdist_dir)
+        instcmd = self.get_finalized_command('install')
+        old_root = instcmd.root
+        instcmd.root = None
+        if self.distribution.has_c_libraries() and not self.skip_build:
+            self.run_command('build_clib')
+        cmd = self.call_command('install_lib', warn_dir=0)
+        instcmd.root = old_root
+
+        all_outputs, ext_outputs = self.get_ext_outputs()
+        self.stubs = []
+        to_compile = []
+        for (p, ext_name) in enumerate(ext_outputs):
+            filename, ext = os.path.splitext(ext_name)
+            pyfile = os.path.join(self.bdist_dir, strip_module(filename) +
+                                  '.py')
+            self.stubs.append(pyfile)
+            log.info("creating stub loader for %s", ext_name)
+            if not self.dry_run:
+                write_stub(os.path.basename(ext_name), pyfile)
+            to_compile.append(pyfile)
+            ext_outputs[p] = ext_name.replace(os.sep, '/')
+
+        if to_compile:
+            cmd.byte_compile(to_compile)
+        if self.distribution.data_files:
+            self.do_install_data()
+
+        # Make the EGG-INFO directory
+        archive_root = self.bdist_dir
+        egg_info = os.path.join(archive_root, 'EGG-INFO')
+        self.mkpath(egg_info)
+        if self.distribution.scripts:
+            script_dir = os.path.join(egg_info, 'scripts')
+            log.info("installing scripts to %s", script_dir)
+            self.call_command('install_scripts', install_dir=script_dir,
+                              no_ep=1)
+
+        self.copy_metadata_to(egg_info)
+        native_libs = os.path.join(egg_info, "native_libs.txt")
+        if all_outputs:
+            log.info("writing %s", native_libs)
+            if not self.dry_run:
+                ensure_directory(native_libs)
+                libs_file = open(native_libs, 'wt')
+                libs_file.write('\n'.join(all_outputs))
+                libs_file.write('\n')
+                libs_file.close()
+        elif os.path.isfile(native_libs):
+            log.info("removing %s", native_libs)
+            if not self.dry_run:
+                os.unlink(native_libs)
+
+        write_safety_flag(
+            os.path.join(archive_root, 'EGG-INFO'), self.zip_safe()
+        )
+
+        if os.path.exists(os.path.join(self.egg_info, 'depends.txt')):
+            log.warn(
+                "WARNING: 'depends.txt' will not be used by setuptools 0.6!\n"
+                "Use the install_requires/extras_require setup() args instead."
+            )
+
+        if self.exclude_source_files:
+            self.zap_pyfiles()
+
+        # Make the archive
+        make_zipfile(self.egg_output, archive_root, verbose=self.verbose,
+                     dry_run=self.dry_run, mode=self.gen_header())
+        if not self.keep_temp:
+            remove_tree(self.bdist_dir, dry_run=self.dry_run)
+
+        # Add to 'Distribution.dist_files' so that the "upload" command works
+        getattr(self.distribution, 'dist_files', []).append(
+            ('bdist_egg', get_python_version(), self.egg_output))
+
+    def zap_pyfiles(self):
+        log.info("Removing .py files from temporary directory")
+        for base, dirs, files in walk_egg(self.bdist_dir):
+            for name in files:
+                path = os.path.join(base, name)
+
+                if name.endswith('.py'):
+                    log.debug("Deleting %s", path)
+                    os.unlink(path)
+
+                if base.endswith('__pycache__'):
+                    path_old = path
+
+                    pattern = r'(?P<name>.+)\.(?P<magic>[^.]+)\.pyc'
+                    m = re.match(pattern, name)
+                    path_new = os.path.join(
+                        base, os.pardir, m.group('name') + '.pyc')
+                    log.info(
+                        "Renaming file from [%s] to [%s]"
+                        % (path_old, path_new))
+                    try:
+                        os.remove(path_new)
+                    except OSError:
+                        pass
+                    os.rename(path_old, path_new)
+
+    def zip_safe(self):
+        safe = getattr(self.distribution, 'zip_safe', None)
+        if safe is not None:
+            return safe
+        log.warn("zip_safe flag not set; analyzing archive contents...")
+        return analyze_egg(self.bdist_dir, self.stubs)
+
+    def gen_header(self):
+        epm = EntryPoint.parse_map(self.distribution.entry_points or '')
+        ep = epm.get('setuptools.installation', {}).get('eggsecutable')
+        if ep is None:
+            return 'w'  # not an eggsecutable, do it the usual way.
+
+        warnings.warn(
+            "Eggsecutables are deprecated and will be removed in a future "
+            "version.",
+            SetuptoolsDeprecationWarning
+        )
+
+        if not ep.attrs or ep.extras:
+            raise DistutilsSetupError(
+                "eggsecutable entry point (%r) cannot have 'extras' "
+                "or refer to a module" % (ep,)
+            )
+
+        pyver = '{}.{}'.format(*sys.version_info)
+        pkg = ep.module_name
+        full = '.'.join(ep.attrs)
+        base = ep.attrs[0]
+        basename = os.path.basename(self.egg_output)
+
+        header = (
+            "#!/bin/sh\n"
+            'if [ `basename $0` = "%(basename)s" ]\n'
+            'then exec python%(pyver)s -c "'
+            "import sys, os; sys.path.insert(0, os.path.abspath('$0')); "
+            "from %(pkg)s import %(base)s; sys.exit(%(full)s())"
+            '" "$@"\n'
+            'else\n'
+            '  echo $0 is not the correct name for this egg file.\n'
+            '  echo Please rename it back to %(basename)s and try again.\n'
+            '  exec false\n'
+            'fi\n'
+        ) % locals()
+
+        if not self.dry_run:
+            mkpath(os.path.dirname(self.egg_output), dry_run=self.dry_run)
+            f = open(self.egg_output, 'w')
+            f.write(header)
+            f.close()
+        return 'a'
+
+    def copy_metadata_to(self, target_dir):
+        "Copy metadata (egg info) to the target_dir"
+        # normalize the path (so that a forward-slash in egg_info will
+        # match using startswith below)
+        norm_egg_info = os.path.normpath(self.egg_info)
+        prefix = os.path.join(norm_egg_info, '')
+        for path in self.ei_cmd.filelist.files:
+            if path.startswith(prefix):
+                target = os.path.join(target_dir, path[len(prefix):])
+                ensure_directory(target)
+                self.copy_file(path, target)
+
+    def get_ext_outputs(self):
+        """Get a list of relative paths to C extensions in the output distro"""
+
+        all_outputs = []
+        ext_outputs = []
+
+        paths = {self.bdist_dir: ''}
+        for base, dirs, files in sorted_walk(self.bdist_dir):
+            for filename in files:
+                if os.path.splitext(filename)[1].lower() in NATIVE_EXTENSIONS:
+                    all_outputs.append(paths[base] + filename)
+            for filename in dirs:
+                paths[os.path.join(base, filename)] = (paths[base] +
+                                                       filename + '/')
+
+        if self.distribution.has_ext_modules():
+            build_cmd = self.get_finalized_command('build_ext')
+            for ext in build_cmd.extensions:
+                if isinstance(ext, Library):
+                    continue
+                fullname = build_cmd.get_ext_fullname(ext.name)
+                filename = build_cmd.get_ext_filename(fullname)
+                if not os.path.basename(filename).startswith('dl-'):
+                    if os.path.exists(os.path.join(self.bdist_dir, filename)):
+                        ext_outputs.append(filename)
+
+        return all_outputs, ext_outputs
+
+
+NATIVE_EXTENSIONS = dict.fromkeys('.dll .so .dylib .pyd'.split())
+
+
+def walk_egg(egg_dir):
+    """Walk an unpacked egg's contents, skipping the metadata directory"""
+    walker = sorted_walk(egg_dir)
+    base, dirs, files = next(walker)
+    if 'EGG-INFO' in dirs:
+        dirs.remove('EGG-INFO')
+    yield base, dirs, files
+    for bdf in walker:
+        yield bdf
+
+
+def analyze_egg(egg_dir, stubs):
+    # check for existing flag in EGG-INFO
+    for flag, fn in safety_flags.items():
+        if os.path.exists(os.path.join(egg_dir, 'EGG-INFO', fn)):
+            return flag
+    if not can_scan():
+        return False
+    safe = True
+    for base, dirs, files in walk_egg(egg_dir):
+        for name in files:
+            if name.endswith('.py') or name.endswith('.pyw'):
+                continue
+            elif name.endswith('.pyc') or name.endswith('.pyo'):
+                # always scan, even if we already know we're not safe
+                safe = scan_module(egg_dir, base, name, stubs) and safe
+    return safe
+
+
+def write_safety_flag(egg_dir, safe):
+    # Write or remove zip safety flag file(s)
+    for flag, fn in safety_flags.items():
+        fn = os.path.join(egg_dir, fn)
+        if os.path.exists(fn):
+            if safe is None or bool(safe) != flag:
+                os.unlink(fn)
+        elif safe is not None and bool(safe) == flag:
+            f = open(fn, 'wt')
+            f.write('\n')
+            f.close()
+
+
+safety_flags = {
+    True: 'zip-safe',
+    False: 'not-zip-safe',
+}
+
+
+def scan_module(egg_dir, base, name, stubs):
+    """Check whether module possibly uses unsafe-for-zipfile stuff"""
+
+    filename = os.path.join(base, name)
+    if filename[:-1] in stubs:
+        return True  # Extension module
+    pkg = base[len(egg_dir) + 1:].replace(os.sep, '.')
+    module = pkg + (pkg and '.' or '') + os.path.splitext(name)[0]
+    if sys.version_info < (3, 7):
+        skip = 12  # skip magic & date & file size
+    else:
+        skip = 16  # skip magic & reserved? & date & file size
+    f = open(filename, 'rb')
+    f.read(skip)
+    code = marshal.load(f)
+    f.close()
+    safe = True
+    symbols = dict.fromkeys(iter_symbols(code))
+    for bad in ['__file__', '__path__']:
+        if bad in symbols:
+            log.warn("%s: module references %s", module, bad)
+            safe = False
+    if 'inspect' in symbols:
+        for bad in [
+            'getsource', 'getabsfile', 'getsourcefile', 'getfile'
+            'getsourcelines', 'findsource', 'getcomments', 'getframeinfo',
+            'getinnerframes', 'getouterframes', 'stack', 'trace'
+        ]:
+            if bad in symbols:
+                log.warn("%s: module MAY be using inspect.%s", module, bad)
+                safe = False
+    return safe
+
+
+def iter_symbols(code):
+    """Yield names and strings used by `code` and its nested code objects"""
+    for name in code.co_names:
+        yield name
+    for const in code.co_consts:
+        if isinstance(const, str):
+            yield const
+        elif isinstance(const, CodeType):
+            for name in iter_symbols(const):
+                yield name
+
+
+def can_scan():
+    if not sys.platform.startswith('java') and sys.platform != 'cli':
+        # CPython, PyPy, etc.
+        return True
+    log.warn("Unable to analyze compiled code on this platform.")
+    log.warn("Please ask the author to include a 'zip_safe'"
+             " setting (either True or False) in the package's setup.py")
+
+
+# Attribute names of options for commands that might need to be convinced to
+# install to the egg build directory
+
+INSTALL_DIRECTORY_ATTRS = [
+    'install_lib', 'install_dir', 'install_data', 'install_base'
+]
+
+
+def make_zipfile(zip_filename, base_dir, verbose=0, dry_run=0, compress=True,
+                 mode='w'):
+    """Create a zip file from all the files under 'base_dir'.  The output
+    zip file will be named 'base_dir' + ".zip".  Uses either the "zipfile"
+    Python module (if available) or the InfoZIP "zip" utility (if installed
+    and found on the default search path).  If neither tool is available,
+    raises DistutilsExecError.  Returns the name of the output zip file.
+    """
+    import zipfile
+
+    mkpath(os.path.dirname(zip_filename), dry_run=dry_run)
+    log.info("creating '%s' and adding '%s' to it", zip_filename, base_dir)
+
+    def visit(z, dirname, names):
+        for name in names:
+            path = os.path.normpath(os.path.join(dirname, name))
+            if os.path.isfile(path):
+                p = path[len(base_dir) + 1:]
+                if not dry_run:
+                    z.write(path, p)
+                log.debug("adding '%s'", p)
+
+    compression = zipfile.ZIP_DEFLATED if compress else zipfile.ZIP_STORED
+    if not dry_run:
+        z = zipfile.ZipFile(zip_filename, mode, compression=compression)
+        for dirname, dirs, files in sorted_walk(base_dir):
+            visit(z, dirname, files)
+        z.close()
+    else:
+        for dirname, dirs, files in sorted_walk(base_dir):
+            visit(None, dirname, files)
+    return zip_filename
diff --git a/venv/Lib/site-packages/setuptools/command/bdist_rpm.py b/venv/Lib/site-packages/setuptools/command/bdist_rpm.py
new file mode 100644
index 000000000..0eb1b9c25
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/bdist_rpm.py
@@ -0,0 +1,31 @@
+import distutils.command.bdist_rpm as orig
+
+
+class bdist_rpm(orig.bdist_rpm):
+    """
+    Override the default bdist_rpm behavior to do the following:
+
+    1. Run egg_info to ensure the name and version are properly calculated.
+    2. Always run 'install' using --single-version-externally-managed to
+       disable eggs in RPM distributions.
+    """
+
+    def run(self):
+        # ensure distro name is up-to-date
+        self.run_command('egg_info')
+
+        orig.bdist_rpm.run(self)
+
+    def _make_spec_file(self):
+        spec = orig.bdist_rpm._make_spec_file(self)
+        spec = [
+            line.replace(
+                "setup.py install ",
+                "setup.py install --single-version-externally-managed "
+            ).replace(
+                "%setup",
+                "%setup -n %{name}-%{unmangled_version}"
+            )
+            for line in spec
+        ]
+        return spec
diff --git a/venv/Lib/site-packages/setuptools/command/bdist_wininst.py b/venv/Lib/site-packages/setuptools/command/bdist_wininst.py
new file mode 100644
index 000000000..ff4b63459
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/bdist_wininst.py
@@ -0,0 +1,30 @@
+import distutils.command.bdist_wininst as orig
+import warnings
+
+from setuptools import SetuptoolsDeprecationWarning
+
+
+class bdist_wininst(orig.bdist_wininst):
+    def reinitialize_command(self, command, reinit_subcommands=0):
+        """
+        Supplement reinitialize_command to work around
+        http://bugs.python.org/issue20819
+        """
+        cmd = self.distribution.reinitialize_command(
+            command, reinit_subcommands)
+        if command in ('install', 'install_lib'):
+            cmd.install_lib = None
+        return cmd
+
+    def run(self):
+        warnings.warn(
+            "bdist_wininst is deprecated and will be removed in a future "
+            "version. Use bdist_wheel (wheel packages) instead.",
+            SetuptoolsDeprecationWarning
+        )
+
+        self._is_running = True
+        try:
+            orig.bdist_wininst.run(self)
+        finally:
+            self._is_running = False
diff --git a/venv/Lib/site-packages/setuptools/command/build_clib.py b/venv/Lib/site-packages/setuptools/command/build_clib.py
new file mode 100644
index 000000000..67ce2444e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/build_clib.py
@@ -0,0 +1,101 @@
+import distutils.command.build_clib as orig
+from distutils.errors import DistutilsSetupError
+from distutils import log
+from setuptools.dep_util import newer_pairwise_group
+
+
+class build_clib(orig.build_clib):
+    """
+    Override the default build_clib behaviour to do the following:
+
+    1. Implement a rudimentary timestamp-based dependency system
+       so 'compile()' doesn't run every time.
+    2. Add more keys to the 'build_info' dictionary:
+        * obj_deps - specify dependencies for each object compiled.
+                     this should be a dictionary mapping a key
+                     with the source filename to a list of
+                     dependencies. Use an empty string for global
+                     dependencies.
+        * cflags   - specify a list of additional flags to pass to
+                     the compiler.
+    """
+
+    def build_libraries(self, libraries):
+        for (lib_name, build_info) in libraries:
+            sources = build_info.get('sources')
+            if sources is None or not isinstance(sources, (list, tuple)):
+                raise DistutilsSetupError(
+                    "in 'libraries' option (library '%s'), "
+                    "'sources' must be present and must be "
+                    "a list of source filenames" % lib_name)
+            sources = list(sources)
+
+            log.info("building '%s' library", lib_name)
+
+            # Make sure everything is the correct type.
+            # obj_deps should be a dictionary of keys as sources
+            # and a list/tuple of files that are its dependencies.
+            obj_deps = build_info.get('obj_deps', dict())
+            if not isinstance(obj_deps, dict):
+                raise DistutilsSetupError(
+                    "in 'libraries' option (library '%s'), "
+                    "'obj_deps' must be a dictionary of "
+                    "type 'source: list'" % lib_name)
+            dependencies = []
+
+            # Get the global dependencies that are specified by the '' key.
+            # These will go into every source's dependency list.
+            global_deps = obj_deps.get('', list())
+            if not isinstance(global_deps, (list, tuple)):
+                raise DistutilsSetupError(
+                    "in 'libraries' option (library '%s'), "
+                    "'obj_deps' must be a dictionary of "
+                    "type 'source: list'" % lib_name)
+
+            # Build the list to be used by newer_pairwise_group
+            # each source will be auto-added to its dependencies.
+            for source in sources:
+                src_deps = [source]
+                src_deps.extend(global_deps)
+                extra_deps = obj_deps.get(source, list())
+                if not isinstance(extra_deps, (list, tuple)):
+                    raise DistutilsSetupError(
+                        "in 'libraries' option (library '%s'), "
+                        "'obj_deps' must be a dictionary of "
+                        "type 'source: list'" % lib_name)
+                src_deps.extend(extra_deps)
+                dependencies.append(src_deps)
+
+            expected_objects = self.compiler.object_filenames(
+                sources,
+                output_dir=self.build_temp,
+            )
+
+            if (
+                newer_pairwise_group(dependencies, expected_objects)
+                != ([], [])
+            ):
+                # First, compile the source code to object files in the library
+                # directory.  (This should probably change to putting object
+                # files in a temporary build directory.)
+                macros = build_info.get('macros')
+                include_dirs = build_info.get('include_dirs')
+                cflags = build_info.get('cflags')
+                self.compiler.compile(
+                    sources,
+                    output_dir=self.build_temp,
+                    macros=macros,
+                    include_dirs=include_dirs,
+                    extra_postargs=cflags,
+                    debug=self.debug
+                )
+
+            # Now "link" the object files together into a static library.
+            # (On Unix at least, this isn't really linking -- it just
+            # builds an archive.  Whatever.)
+            self.compiler.create_static_lib(
+                expected_objects,
+                lib_name,
+                output_dir=self.build_clib,
+                debug=self.debug
+            )
diff --git a/venv/Lib/site-packages/setuptools/command/build_ext.py b/venv/Lib/site-packages/setuptools/command/build_ext.py
new file mode 100644
index 000000000..03a72b4fc
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/build_ext.py
@@ -0,0 +1,322 @@
+import os
+import sys
+import itertools
+from importlib.machinery import EXTENSION_SUFFIXES
+from distutils.command.build_ext import build_ext as _du_build_ext
+from distutils.file_util import copy_file
+from distutils.ccompiler import new_compiler
+from distutils.sysconfig import customize_compiler, get_config_var
+from distutils.errors import DistutilsError
+from distutils import log
+
+from setuptools.extension import Library
+
+try:
+    # Attempt to use Cython for building extensions, if available
+    from Cython.Distutils.build_ext import build_ext as _build_ext
+    # Additionally, assert that the compiler module will load
+    # also. Ref #1229.
+    __import__('Cython.Compiler.Main')
+except ImportError:
+    _build_ext = _du_build_ext
+
+# make sure _config_vars is initialized
+get_config_var("LDSHARED")
+from distutils.sysconfig import _config_vars as _CONFIG_VARS  # noqa
+
+
+def _customize_compiler_for_shlib(compiler):
+    if sys.platform == "darwin":
+        # building .dylib requires additional compiler flags on OSX; here we
+        # temporarily substitute the pyconfig.h variables so that distutils'
+        # 'customize_compiler' uses them before we build the shared libraries.
+        tmp = _CONFIG_VARS.copy()
+        try:
+            # XXX Help!  I don't have any idea whether these are right...
+            _CONFIG_VARS['LDSHARED'] = (
+                "gcc -Wl,-x -dynamiclib -undefined dynamic_lookup")
+            _CONFIG_VARS['CCSHARED'] = " -dynamiclib"
+            _CONFIG_VARS['SO'] = ".dylib"
+            customize_compiler(compiler)
+        finally:
+            _CONFIG_VARS.clear()
+            _CONFIG_VARS.update(tmp)
+    else:
+        customize_compiler(compiler)
+
+
+have_rtld = False
+use_stubs = False
+libtype = 'shared'
+
+if sys.platform == "darwin":
+    use_stubs = True
+elif os.name != 'nt':
+    try:
+        import dl
+        use_stubs = have_rtld = hasattr(dl, 'RTLD_NOW')
+    except ImportError:
+        pass
+
+
+def if_dl(s):
+    return s if have_rtld else ''
+
+
+def get_abi3_suffix():
+    """Return the file extension for an abi3-compliant Extension()"""
+    for suffix in EXTENSION_SUFFIXES:
+        if '.abi3' in suffix:  # Unix
+            return suffix
+        elif suffix == '.pyd':  # Windows
+            return suffix
+
+
+class build_ext(_build_ext):
+    def run(self):
+        """Build extensions in build directory, then copy if --inplace"""
+        old_inplace, self.inplace = self.inplace, 0
+        _build_ext.run(self)
+        self.inplace = old_inplace
+        if old_inplace:
+            self.copy_extensions_to_source()
+
+    def copy_extensions_to_source(self):
+        build_py = self.get_finalized_command('build_py')
+        for ext in self.extensions:
+            fullname = self.get_ext_fullname(ext.name)
+            filename = self.get_ext_filename(fullname)
+            modpath = fullname.split('.')
+            package = '.'.join(modpath[:-1])
+            package_dir = build_py.get_package_dir(package)
+            dest_filename = os.path.join(package_dir,
+                                         os.path.basename(filename))
+            src_filename = os.path.join(self.build_lib, filename)
+
+            # Always copy, even if source is older than destination, to ensure
+            # that the right extensions for the current Python/platform are
+            # used.
+            copy_file(
+                src_filename, dest_filename, verbose=self.verbose,
+                dry_run=self.dry_run
+            )
+            if ext._needs_stub:
+                self.write_stub(package_dir or os.curdir, ext, True)
+
+    def get_ext_filename(self, fullname):
+        filename = _build_ext.get_ext_filename(self, fullname)
+        if fullname in self.ext_map:
+            ext = self.ext_map[fullname]
+            use_abi3 = getattr(ext, 'py_limited_api') and get_abi3_suffix()
+            if use_abi3:
+                so_ext = get_config_var('EXT_SUFFIX')
+                filename = filename[:-len(so_ext)]
+                filename = filename + get_abi3_suffix()
+            if isinstance(ext, Library):
+                fn, ext = os.path.splitext(filename)
+                return self.shlib_compiler.library_filename(fn, libtype)
+            elif use_stubs and ext._links_to_dynamic:
+                d, fn = os.path.split(filename)
+                return os.path.join(d, 'dl-' + fn)
+        return filename
+
+    def initialize_options(self):
+        _build_ext.initialize_options(self)
+        self.shlib_compiler = None
+        self.shlibs = []
+        self.ext_map = {}
+
+    def finalize_options(self):
+        _build_ext.finalize_options(self)
+        self.extensions = self.extensions or []
+        self.check_extensions_list(self.extensions)
+        self.shlibs = [ext for ext in self.extensions
+                       if isinstance(ext, Library)]
+        if self.shlibs:
+            self.setup_shlib_compiler()
+        for ext in self.extensions:
+            ext._full_name = self.get_ext_fullname(ext.name)
+        for ext in self.extensions:
+            fullname = ext._full_name
+            self.ext_map[fullname] = ext
+
+            # distutils 3.1 will also ask for module names
+            # XXX what to do with conflicts?
+            self.ext_map[fullname.split('.')[-1]] = ext
+
+            ltd = self.shlibs and self.links_to_dynamic(ext) or False
+            ns = ltd and use_stubs and not isinstance(ext, Library)
+            ext._links_to_dynamic = ltd
+            ext._needs_stub = ns
+            filename = ext._file_name = self.get_ext_filename(fullname)
+            libdir = os.path.dirname(os.path.join(self.build_lib, filename))
+            if ltd and libdir not in ext.library_dirs:
+                ext.library_dirs.append(libdir)
+            if ltd and use_stubs and os.curdir not in ext.runtime_library_dirs:
+                ext.runtime_library_dirs.append(os.curdir)
+
+    def setup_shlib_compiler(self):
+        compiler = self.shlib_compiler = new_compiler(
+            compiler=self.compiler, dry_run=self.dry_run, force=self.force
+        )
+        _customize_compiler_for_shlib(compiler)
+
+        if self.include_dirs is not None:
+            compiler.set_include_dirs(self.include_dirs)
+        if self.define is not None:
+            # 'define' option is a list of (name,value) tuples
+            for (name, value) in self.define:
+                compiler.define_macro(name, value)
+        if self.undef is not None:
+            for macro in self.undef:
+                compiler.undefine_macro(macro)
+        if self.libraries is not None:
+            compiler.set_libraries(self.libraries)
+        if self.library_dirs is not None:
+            compiler.set_library_dirs(self.library_dirs)
+        if self.rpath is not None:
+            compiler.set_runtime_library_dirs(self.rpath)
+        if self.link_objects is not None:
+            compiler.set_link_objects(self.link_objects)
+
+        # hack so distutils' build_extension() builds a library instead
+        compiler.link_shared_object = link_shared_object.__get__(compiler)
+
+    def get_export_symbols(self, ext):
+        if isinstance(ext, Library):
+            return ext.export_symbols
+        return _build_ext.get_export_symbols(self, ext)
+
+    def build_extension(self, ext):
+        ext._convert_pyx_sources_to_lang()
+        _compiler = self.compiler
+        try:
+            if isinstance(ext, Library):
+                self.compiler = self.shlib_compiler
+            _build_ext.build_extension(self, ext)
+            if ext._needs_stub:
+                cmd = self.get_finalized_command('build_py').build_lib
+                self.write_stub(cmd, ext)
+        finally:
+            self.compiler = _compiler
+
+    def links_to_dynamic(self, ext):
+        """Return true if 'ext' links to a dynamic lib in the same package"""
+        # XXX this should check to ensure the lib is actually being built
+        # XXX as dynamic, and not just using a locally-found version or a
+        # XXX static-compiled version
+        libnames = dict.fromkeys([lib._full_name for lib in self.shlibs])
+        pkg = '.'.join(ext._full_name.split('.')[:-1] + [''])
+        return any(pkg + libname in libnames for libname in ext.libraries)
+
+    def get_outputs(self):
+        return _build_ext.get_outputs(self) + self.__get_stubs_outputs()
+
+    def __get_stubs_outputs(self):
+        # assemble the base name for each extension that needs a stub
+        ns_ext_bases = (
+            os.path.join(self.build_lib, *ext._full_name.split('.'))
+            for ext in self.extensions
+            if ext._needs_stub
+        )
+        # pair each base with the extension
+        pairs = itertools.product(ns_ext_bases, self.__get_output_extensions())
+        return list(base + fnext for base, fnext in pairs)
+
+    def __get_output_extensions(self):
+        yield '.py'
+        yield '.pyc'
+        if self.get_finalized_command('build_py').optimize:
+            yield '.pyo'
+
+    def write_stub(self, output_dir, ext, compile=False):
+        log.info("writing stub loader for %s to %s", ext._full_name,
+                 output_dir)
+        stub_file = (os.path.join(output_dir, *ext._full_name.split('.')) +
+                     '.py')
+        if compile and os.path.exists(stub_file):
+            raise DistutilsError(stub_file + " already exists! Please delete.")
+        if not self.dry_run:
+            f = open(stub_file, 'w')
+            f.write(
+                '\n'.join([
+                    "def __bootstrap__():",
+                    "   global __bootstrap__, __file__, __loader__",
+                    "   import sys, os, pkg_resources, importlib.util" +
+                    if_dl(", dl"),
+                    "   __file__ = pkg_resources.resource_filename"
+                    "(__name__,%r)"
+                    % os.path.basename(ext._file_name),
+                    "   del __bootstrap__",
+                    "   if '__loader__' in globals():",
+                    "       del __loader__",
+                    if_dl("   old_flags = sys.getdlopenflags()"),
+                    "   old_dir = os.getcwd()",
+                    "   try:",
+                    "     os.chdir(os.path.dirname(__file__))",
+                    if_dl("     sys.setdlopenflags(dl.RTLD_NOW)"),
+                    "     spec = importlib.util.spec_from_file_location(",
+                    "                __name__, __file__)",
+                    "     mod = importlib.util.module_from_spec(spec)",
+                    "     spec.loader.exec_module(mod)",
+                    "   finally:",
+                    if_dl("     sys.setdlopenflags(old_flags)"),
+                    "     os.chdir(old_dir)",
+                    "__bootstrap__()",
+                    ""  # terminal \n
+                ])
+            )
+            f.close()
+        if compile:
+            from distutils.util import byte_compile
+
+            byte_compile([stub_file], optimize=0,
+                         force=True, dry_run=self.dry_run)
+            optimize = self.get_finalized_command('install_lib').optimize
+            if optimize > 0:
+                byte_compile([stub_file], optimize=optimize,
+                             force=True, dry_run=self.dry_run)
+            if os.path.exists(stub_file) and not self.dry_run:
+                os.unlink(stub_file)
+
+
+if use_stubs or os.name == 'nt':
+    # Build shared libraries
+    #
+    def link_shared_object(
+            self, objects, output_libname, output_dir=None, libraries=None,
+            library_dirs=None, runtime_library_dirs=None, export_symbols=None,
+            debug=0, extra_preargs=None, extra_postargs=None, build_temp=None,
+            target_lang=None):
+        self.link(
+            self.SHARED_LIBRARY, objects, output_libname,
+            output_dir, libraries, library_dirs, runtime_library_dirs,
+            export_symbols, debug, extra_preargs, extra_postargs,
+            build_temp, target_lang
+        )
+else:
+    # Build static libraries everywhere else
+    libtype = 'static'
+
+    def link_shared_object(
+            self, objects, output_libname, output_dir=None, libraries=None,
+            library_dirs=None, runtime_library_dirs=None, export_symbols=None,
+            debug=0, extra_preargs=None, extra_postargs=None, build_temp=None,
+            target_lang=None):
+        # XXX we need to either disallow these attrs on Library instances,
+        # or warn/abort here if set, or something...
+        # libraries=None, library_dirs=None, runtime_library_dirs=None,
+        # export_symbols=None, extra_preargs=None, extra_postargs=None,
+        # build_temp=None
+
+        assert output_dir is None  # distutils build_ext doesn't pass this
+        output_dir, filename = os.path.split(output_libname)
+        basename, ext = os.path.splitext(filename)
+        if self.library_filename("x").startswith('lib'):
+            # strip 'lib' prefix; this is kludgy if some platform uses
+            # a different prefix
+            basename = basename[3:]
+
+        self.create_static_lib(
+            objects, basename, output_dir, debug, target_lang
+        )
diff --git a/venv/Lib/site-packages/setuptools/command/build_py.py b/venv/Lib/site-packages/setuptools/command/build_py.py
new file mode 100644
index 000000000..4709679b9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/build_py.py
@@ -0,0 +1,270 @@
+from glob import glob
+from distutils.util import convert_path
+import distutils.command.build_py as orig
+import os
+import fnmatch
+import textwrap
+import io
+import distutils.errors
+import itertools
+import stat
+
+try:
+    from setuptools.lib2to3_ex import Mixin2to3
+except ImportError:
+
+    class Mixin2to3:
+        def run_2to3(self, files, doctests=True):
+            "do nothing"
+
+
+def make_writable(target):
+    os.chmod(target, os.stat(target).st_mode | stat.S_IWRITE)
+
+
+class build_py(orig.build_py, Mixin2to3):
+    """Enhanced 'build_py' command that includes data files with packages
+
+    The data files are specified via a 'package_data' argument to 'setup()'.
+    See 'setuptools.dist.Distribution' for more details.
+
+    Also, this version of the 'build_py' command allows you to specify both
+    'py_modules' and 'packages' in the same setup operation.
+    """
+
+    def finalize_options(self):
+        orig.build_py.finalize_options(self)
+        self.package_data = self.distribution.package_data
+        self.exclude_package_data = (self.distribution.exclude_package_data or
+                                     {})
+        if 'data_files' in self.__dict__:
+            del self.__dict__['data_files']
+        self.__updated_files = []
+        self.__doctests_2to3 = []
+
+    def run(self):
+        """Build modules, packages, and copy data files to build directory"""
+        if not self.py_modules and not self.packages:
+            return
+
+        if self.py_modules:
+            self.build_modules()
+
+        if self.packages:
+            self.build_packages()
+            self.build_package_data()
+
+        self.run_2to3(self.__updated_files, False)
+        self.run_2to3(self.__updated_files, True)
+        self.run_2to3(self.__doctests_2to3, True)
+
+        # Only compile actual .py files, using our base class' idea of what our
+        # output files are.
+        self.byte_compile(orig.build_py.get_outputs(self, include_bytecode=0))
+
+    def __getattr__(self, attr):
+        "lazily compute data files"
+        if attr == 'data_files':
+            self.data_files = self._get_data_files()
+            return self.data_files
+        return orig.build_py.__getattr__(self, attr)
+
+    def build_module(self, module, module_file, package):
+        outfile, copied = orig.build_py.build_module(self, module, module_file,
+                                                     package)
+        if copied:
+            self.__updated_files.append(outfile)
+        return outfile, copied
+
+    def _get_data_files(self):
+        """Generate list of '(package,src_dir,build_dir,filenames)' tuples"""
+        self.analyze_manifest()
+        return list(map(self._get_pkg_data_files, self.packages or ()))
+
+    def _get_pkg_data_files(self, package):
+        # Locate package source directory
+        src_dir = self.get_package_dir(package)
+
+        # Compute package build directory
+        build_dir = os.path.join(*([self.build_lib] + package.split('.')))
+
+        # Strip directory from globbed filenames
+        filenames = [
+            os.path.relpath(file, src_dir)
+            for file in self.find_data_files(package, src_dir)
+        ]
+        return package, src_dir, build_dir, filenames
+
+    def find_data_files(self, package, src_dir):
+        """Return filenames for package's data files in 'src_dir'"""
+        patterns = self._get_platform_patterns(
+            self.package_data,
+            package,
+            src_dir,
+        )
+        globs_expanded = map(glob, patterns)
+        # flatten the expanded globs into an iterable of matches
+        globs_matches = itertools.chain.from_iterable(globs_expanded)
+        glob_files = filter(os.path.isfile, globs_matches)
+        files = itertools.chain(
+            self.manifest_files.get(package, []),
+            glob_files,
+        )
+        return self.exclude_data_files(package, src_dir, files)
+
+    def build_package_data(self):
+        """Copy data files into build directory"""
+        for package, src_dir, build_dir, filenames in self.data_files:
+            for filename in filenames:
+                target = os.path.join(build_dir, filename)
+                self.mkpath(os.path.dirname(target))
+                srcfile = os.path.join(src_dir, filename)
+                outf, copied = self.copy_file(srcfile, target)
+                make_writable(target)
+                srcfile = os.path.abspath(srcfile)
+                if (copied and
+                        srcfile in self.distribution.convert_2to3_doctests):
+                    self.__doctests_2to3.append(outf)
+
+    def analyze_manifest(self):
+        self.manifest_files = mf = {}
+        if not self.distribution.include_package_data:
+            return
+        src_dirs = {}
+        for package in self.packages or ():
+            # Locate package source directory
+            src_dirs[assert_relative(self.get_package_dir(package))] = package
+
+        self.run_command('egg_info')
+        ei_cmd = self.get_finalized_command('egg_info')
+        for path in ei_cmd.filelist.files:
+            d, f = os.path.split(assert_relative(path))
+            prev = None
+            oldf = f
+            while d and d != prev and d not in src_dirs:
+                prev = d
+                d, df = os.path.split(d)
+                f = os.path.join(df, f)
+            if d in src_dirs:
+                if path.endswith('.py') and f == oldf:
+                    continue  # it's a module, not data
+                mf.setdefault(src_dirs[d], []).append(path)
+
+    def get_data_files(self):
+        pass  # Lazily compute data files in _get_data_files() function.
+
+    def check_package(self, package, package_dir):
+        """Check namespace packages' __init__ for declare_namespace"""
+        try:
+            return self.packages_checked[package]
+        except KeyError:
+            pass
+
+        init_py = orig.build_py.check_package(self, package, package_dir)
+        self.packages_checked[package] = init_py
+
+        if not init_py or not self.distribution.namespace_packages:
+            return init_py
+
+        for pkg in self.distribution.namespace_packages:
+            if pkg == package or pkg.startswith(package + '.'):
+                break
+        else:
+            return init_py
+
+        with io.open(init_py, 'rb') as f:
+            contents = f.read()
+        if b'declare_namespace' not in contents:
+            raise distutils.errors.DistutilsError(
+                "Namespace package problem: %s is a namespace package, but "
+                "its\n__init__.py does not call declare_namespace()! Please "
+                'fix it.\n(See the setuptools manual under '
+                '"Namespace Packages" for details.)\n"' % (package,)
+            )
+        return init_py
+
+    def initialize_options(self):
+        self.packages_checked = {}
+        orig.build_py.initialize_options(self)
+
+    def get_package_dir(self, package):
+        res = orig.build_py.get_package_dir(self, package)
+        if self.distribution.src_root is not None:
+            return os.path.join(self.distribution.src_root, res)
+        return res
+
+    def exclude_data_files(self, package, src_dir, files):
+        """Filter filenames for package's data files in 'src_dir'"""
+        files = list(files)
+        patterns = self._get_platform_patterns(
+            self.exclude_package_data,
+            package,
+            src_dir,
+        )
+        match_groups = (
+            fnmatch.filter(files, pattern)
+            for pattern in patterns
+        )
+        # flatten the groups of matches into an iterable of matches
+        matches = itertools.chain.from_iterable(match_groups)
+        bad = set(matches)
+        keepers = (
+            fn
+            for fn in files
+            if fn not in bad
+        )
+        # ditch dupes
+        return list(_unique_everseen(keepers))
+
+    @staticmethod
+    def _get_platform_patterns(spec, package, src_dir):
+        """
+        yield platform-specific path patterns (suitable for glob
+        or fn_match) from a glob-based spec (such as
+        self.package_data or self.exclude_package_data)
+        matching package in src_dir.
+        """
+        raw_patterns = itertools.chain(
+            spec.get('', []),
+            spec.get(package, []),
+        )
+        return (
+            # Each pattern has to be converted to a platform-specific path
+            os.path.join(src_dir, convert_path(pattern))
+            for pattern in raw_patterns
+        )
+
+
+# from Python docs
+def _unique_everseen(iterable, key=None):
+    "List unique elements, preserving order. Remember all elements ever seen."
+    # unique_everseen('AAAABBBCCDAABBB') --> A B C D
+    # unique_everseen('ABBCcAD', str.lower) --> A B C D
+    seen = set()
+    seen_add = seen.add
+    if key is None:
+        for element in itertools.filterfalse(seen.__contains__, iterable):
+            seen_add(element)
+            yield element
+    else:
+        for element in iterable:
+            k = key(element)
+            if k not in seen:
+                seen_add(k)
+                yield element
+
+
+def assert_relative(path):
+    if not os.path.isabs(path):
+        return path
+    from distutils.errors import DistutilsSetupError
+
+    msg = textwrap.dedent("""
+        Error: setup script specifies an absolute path:
+
+            %s
+
+        setup() arguments must *always* be /-separated paths relative to the
+        setup.py directory, *never* absolute paths.
+        """).lstrip() % path
+    raise DistutilsSetupError(msg)
diff --git a/venv/Lib/site-packages/setuptools/command/develop.py b/venv/Lib/site-packages/setuptools/command/develop.py
new file mode 100644
index 000000000..faf8c988e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/develop.py
@@ -0,0 +1,216 @@
+from distutils.util import convert_path
+from distutils import log
+from distutils.errors import DistutilsError, DistutilsOptionError
+import os
+import glob
+import io
+
+import pkg_resources
+from setuptools.command.easy_install import easy_install
+from setuptools import namespaces
+import setuptools
+
+
+class develop(namespaces.DevelopInstaller, easy_install):
+    """Set up package for development"""
+
+    description = "install package in 'development mode'"
+
+    user_options = easy_install.user_options + [
+        ("uninstall", "u", "Uninstall this source package"),
+        ("egg-path=", None, "Set the path to be used in the .egg-link file"),
+    ]
+
+    boolean_options = easy_install.boolean_options + ['uninstall']
+
+    command_consumes_arguments = False  # override base
+
+    def run(self):
+        if self.uninstall:
+            self.multi_version = True
+            self.uninstall_link()
+            self.uninstall_namespaces()
+        else:
+            self.install_for_development()
+        self.warn_deprecated_options()
+
+    def initialize_options(self):
+        self.uninstall = None
+        self.egg_path = None
+        easy_install.initialize_options(self)
+        self.setup_path = None
+        self.always_copy_from = '.'  # always copy eggs installed in curdir
+
+    def finalize_options(self):
+        ei = self.get_finalized_command("egg_info")
+        if ei.broken_egg_info:
+            template = "Please rename %r to %r before using 'develop'"
+            args = ei.egg_info, ei.broken_egg_info
+            raise DistutilsError(template % args)
+        self.args = [ei.egg_name]
+
+        easy_install.finalize_options(self)
+        self.expand_basedirs()
+        self.expand_dirs()
+        # pick up setup-dir .egg files only: no .egg-info
+        self.package_index.scan(glob.glob('*.egg'))
+
+        egg_link_fn = ei.egg_name + '.egg-link'
+        self.egg_link = os.path.join(self.install_dir, egg_link_fn)
+        self.egg_base = ei.egg_base
+        if self.egg_path is None:
+            self.egg_path = os.path.abspath(ei.egg_base)
+
+        target = pkg_resources.normalize_path(self.egg_base)
+        egg_path = pkg_resources.normalize_path(
+            os.path.join(self.install_dir, self.egg_path))
+        if egg_path != target:
+            raise DistutilsOptionError(
+                "--egg-path must be a relative path from the install"
+                " directory to " + target
+            )
+
+        # Make a distribution for the package's source
+        self.dist = pkg_resources.Distribution(
+            target,
+            pkg_resources.PathMetadata(target, os.path.abspath(ei.egg_info)),
+            project_name=ei.egg_name
+        )
+
+        self.setup_path = self._resolve_setup_path(
+            self.egg_base,
+            self.install_dir,
+            self.egg_path,
+        )
+
+    @staticmethod
+    def _resolve_setup_path(egg_base, install_dir, egg_path):
+        """
+        Generate a path from egg_base back to '.' where the
+        setup script resides and ensure that path points to the
+        setup path from $install_dir/$egg_path.
+        """
+        path_to_setup = egg_base.replace(os.sep, '/').rstrip('/')
+        if path_to_setup != os.curdir:
+            path_to_setup = '../' * (path_to_setup.count('/') + 1)
+        resolved = pkg_resources.normalize_path(
+            os.path.join(install_dir, egg_path, path_to_setup)
+        )
+        if resolved != pkg_resources.normalize_path(os.curdir):
+            raise DistutilsOptionError(
+                "Can't get a consistent path to setup script from"
+                " installation directory", resolved,
+                pkg_resources.normalize_path(os.curdir))
+        return path_to_setup
+
+    def install_for_development(self):
+        if getattr(self.distribution, 'use_2to3', False):
+            # If we run 2to3 we can not do this inplace:
+
+            # Ensure metadata is up-to-date
+            self.reinitialize_command('build_py', inplace=0)
+            self.run_command('build_py')
+            bpy_cmd = self.get_finalized_command("build_py")
+            build_path = pkg_resources.normalize_path(bpy_cmd.build_lib)
+
+            # Build extensions
+            self.reinitialize_command('egg_info', egg_base=build_path)
+            self.run_command('egg_info')
+
+            self.reinitialize_command('build_ext', inplace=0)
+            self.run_command('build_ext')
+
+            # Fixup egg-link and easy-install.pth
+            ei_cmd = self.get_finalized_command("egg_info")
+            self.egg_path = build_path
+            self.dist.location = build_path
+            # XXX
+            self.dist._provider = pkg_resources.PathMetadata(
+                build_path, ei_cmd.egg_info)
+        else:
+            # Without 2to3 inplace works fine:
+            self.run_command('egg_info')
+
+            # Build extensions in-place
+            self.reinitialize_command('build_ext', inplace=1)
+            self.run_command('build_ext')
+
+        if setuptools.bootstrap_install_from:
+            self.easy_install(setuptools.bootstrap_install_from)
+            setuptools.bootstrap_install_from = None
+
+        self.install_namespaces()
+
+        # create an .egg-link in the installation dir, pointing to our egg
+        log.info("Creating %s (link to %s)", self.egg_link, self.egg_base)
+        if not self.dry_run:
+            with open(self.egg_link, "w") as f:
+                f.write(self.egg_path + "\n" + self.setup_path)
+        # postprocess the installed distro, fixing up .pth, installing scripts,
+        # and handling requirements
+        self.process_distribution(None, self.dist, not self.no_deps)
+
+    def uninstall_link(self):
+        if os.path.exists(self.egg_link):
+            log.info("Removing %s (link to %s)", self.egg_link, self.egg_base)
+            egg_link_file = open(self.egg_link)
+            contents = [line.rstrip() for line in egg_link_file]
+            egg_link_file.close()
+            if contents not in ([self.egg_path],
+                                [self.egg_path, self.setup_path]):
+                log.warn("Link points to %s: uninstall aborted", contents)
+                return
+            if not self.dry_run:
+                os.unlink(self.egg_link)
+        if not self.dry_run:
+            self.update_pth(self.dist)  # remove any .pth link to us
+        if self.distribution.scripts:
+            # XXX should also check for entry point scripts!
+            log.warn("Note: you must uninstall or replace scripts manually!")
+
+    def install_egg_scripts(self, dist):
+        if dist is not self.dist:
+            # Installing a dependency, so fall back to normal behavior
+            return easy_install.install_egg_scripts(self, dist)
+
+        # create wrapper scripts in the script dir, pointing to dist.scripts
+
+        # new-style...
+        self.install_wrapper_scripts(dist)
+
+        # ...and old-style
+        for script_name in self.distribution.scripts or []:
+            script_path = os.path.abspath(convert_path(script_name))
+            script_name = os.path.basename(script_path)
+            with io.open(script_path) as strm:
+                script_text = strm.read()
+            self.install_script(dist, script_name, script_text, script_path)
+
+    def install_wrapper_scripts(self, dist):
+        dist = VersionlessRequirement(dist)
+        return easy_install.install_wrapper_scripts(self, dist)
+
+
+class VersionlessRequirement:
+    """
+    Adapt a pkg_resources.Distribution to simply return the project
+    name as the 'requirement' so that scripts will work across
+    multiple versions.
+
+    >>> from pkg_resources import Distribution
+    >>> dist = Distribution(project_name='foo', version='1.0')
+    >>> str(dist.as_requirement())
+    'foo==1.0'
+    >>> adapted_dist = VersionlessRequirement(dist)
+    >>> str(adapted_dist.as_requirement())
+    'foo'
+    """
+
+    def __init__(self, dist):
+        self.__dist = dist
+
+    def __getattr__(self, name):
+        return getattr(self.__dist, name)
+
+    def as_requirement(self):
+        return self.project_name
diff --git a/venv/Lib/site-packages/setuptools/command/dist_info.py b/venv/Lib/site-packages/setuptools/command/dist_info.py
new file mode 100644
index 000000000..c45258fa0
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/dist_info.py
@@ -0,0 +1,36 @@
+"""
+Create a dist_info directory
+As defined in the wheel specification
+"""
+
+import os
+
+from distutils.core import Command
+from distutils import log
+
+
+class dist_info(Command):
+
+    description = 'create a .dist-info directory'
+
+    user_options = [
+        ('egg-base=', 'e', "directory containing .egg-info directories"
+                           " (default: top of the source tree)"),
+    ]
+
+    def initialize_options(self):
+        self.egg_base = None
+
+    def finalize_options(self):
+        pass
+
+    def run(self):
+        egg_info = self.get_finalized_command('egg_info')
+        egg_info.egg_base = self.egg_base
+        egg_info.finalize_options()
+        egg_info.run()
+        dist_info_dir = egg_info.egg_info[:-len('.egg-info')] + '.dist-info'
+        log.info("creating '{}'".format(os.path.abspath(dist_info_dir)))
+
+        bdist_wheel = self.get_finalized_command('bdist_wheel')
+        bdist_wheel.egg2dist(egg_info.egg_info, dist_info_dir)
diff --git a/venv/Lib/site-packages/setuptools/command/easy_install.py b/venv/Lib/site-packages/setuptools/command/easy_install.py
new file mode 100644
index 000000000..9ec83b7d8
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/easy_install.py
@@ -0,0 +1,2318 @@
+"""
+Easy Install
+------------
+
+A tool for doing automatic download/extract/build of distutils-based Python
+packages.  For detailed documentation, see the accompanying EasyInstall.txt
+file, or visit the `EasyInstall home page`__.
+
+__ https://setuptools.readthedocs.io/en/latest/easy_install.html
+
+"""
+
+from glob import glob
+from distutils.util import get_platform
+from distutils.util import convert_path, subst_vars
+from distutils.errors import (
+    DistutilsArgError, DistutilsOptionError,
+    DistutilsError, DistutilsPlatformError,
+)
+from distutils.command.install import INSTALL_SCHEMES, SCHEME_KEYS
+from distutils import log, dir_util
+from distutils.command.build_scripts import first_line_re
+from distutils.spawn import find_executable
+import sys
+import os
+import zipimport
+import shutil
+import tempfile
+import zipfile
+import re
+import stat
+import random
+import textwrap
+import warnings
+import site
+import struct
+import contextlib
+import subprocess
+import shlex
+import io
+import configparser
+
+
+from sysconfig import get_config_vars, get_path
+
+from setuptools import SetuptoolsDeprecationWarning
+
+from setuptools import Command
+from setuptools.sandbox import run_setup
+from setuptools.command import setopt
+from setuptools.archive_util import unpack_archive
+from setuptools.package_index import (
+    PackageIndex, parse_requirement_arg, URL_SCHEME,
+)
+from setuptools.command import bdist_egg, egg_info
+from setuptools.wheel import Wheel
+from pkg_resources import (
+    yield_lines, normalize_path, resource_string, ensure_directory,
+    get_distribution, find_distributions, Environment, Requirement,
+    Distribution, PathMetadata, EggMetadata, WorkingSet, DistributionNotFound,
+    VersionConflict, DEVELOP_DIST,
+)
+import pkg_resources
+
+# Turn on PEP440Warnings
+warnings.filterwarnings("default", category=pkg_resources.PEP440Warning)
+
+__all__ = [
+    'samefile', 'easy_install', 'PthDistributions', 'extract_wininst_cfg',
+    'main', 'get_exe_prefixes',
+]
+
+
+def is_64bit():
+    return struct.calcsize("P") == 8
+
+
+def samefile(p1, p2):
+    """
+    Determine if two paths reference the same file.
+
+    Augments os.path.samefile to work on Windows and
+    suppresses errors if the path doesn't exist.
+    """
+    both_exist = os.path.exists(p1) and os.path.exists(p2)
+    use_samefile = hasattr(os.path, 'samefile') and both_exist
+    if use_samefile:
+        return os.path.samefile(p1, p2)
+    norm_p1 = os.path.normpath(os.path.normcase(p1))
+    norm_p2 = os.path.normpath(os.path.normcase(p2))
+    return norm_p1 == norm_p2
+
+
+def _to_bytes(s):
+    return s.encode('utf8')
+
+
+def isascii(s):
+    try:
+        s.encode('ascii')
+        return True
+    except UnicodeError:
+        return False
+
+
+def _one_liner(text):
+    return textwrap.dedent(text).strip().replace('\n', '; ')
+
+
+class easy_install(Command):
+    """Manage a download/build/install process"""
+    description = "Find/get/install Python packages"
+    command_consumes_arguments = True
+
+    user_options = [
+        ('prefix=', None, "installation prefix"),
+        ("zip-ok", "z", "install package as a zipfile"),
+        ("multi-version", "m", "make apps have to require() a version"),
+        ("upgrade", "U", "force upgrade (searches PyPI for latest versions)"),
+        ("install-dir=", "d", "install package to DIR"),
+        ("script-dir=", "s", "install scripts to DIR"),
+        ("exclude-scripts", "x", "Don't install scripts"),
+        ("always-copy", "a", "Copy all needed packages to install dir"),
+        ("index-url=", "i", "base URL of Python Package Index"),
+        ("find-links=", "f", "additional URL(s) to search for packages"),
+        ("build-directory=", "b",
+         "download/extract/build in DIR; keep the results"),
+        ('optimize=', 'O',
+         "also compile with optimization: -O1 for \"python -O\", "
+         "-O2 for \"python -OO\", and -O0 to disable [default: -O0]"),
+        ('record=', None,
+         "filename in which to record list of installed files"),
+        ('always-unzip', 'Z', "don't install as a zipfile, no matter what"),
+        ('site-dirs=', 'S', "list of directories where .pth files work"),
+        ('editable', 'e', "Install specified packages in editable form"),
+        ('no-deps', 'N', "don't install dependencies"),
+        ('allow-hosts=', 'H', "pattern(s) that hostnames must match"),
+        ('local-snapshots-ok', 'l',
+         "allow building eggs from local checkouts"),
+        ('version', None, "print version information and exit"),
+        ('no-find-links', None,
+         "Don't load find-links defined in packages being installed"),
+        ('user', None, "install in user site-package '%s'" % site.USER_SITE)
+    ]
+    boolean_options = [
+        'zip-ok', 'multi-version', 'exclude-scripts', 'upgrade', 'always-copy',
+        'editable',
+        'no-deps', 'local-snapshots-ok', 'version',
+        'user'
+    ]
+
+    negative_opt = {'always-unzip': 'zip-ok'}
+    create_index = PackageIndex
+
+    def initialize_options(self):
+        # the --user option seems to be an opt-in one,
+        # so the default should be False.
+        self.user = 0
+        self.zip_ok = self.local_snapshots_ok = None
+        self.install_dir = self.script_dir = self.exclude_scripts = None
+        self.index_url = None
+        self.find_links = None
+        self.build_directory = None
+        self.args = None
+        self.optimize = self.record = None
+        self.upgrade = self.always_copy = self.multi_version = None
+        self.editable = self.no_deps = self.allow_hosts = None
+        self.root = self.prefix = self.no_report = None
+        self.version = None
+        self.install_purelib = None  # for pure module distributions
+        self.install_platlib = None  # non-pure (dists w/ extensions)
+        self.install_headers = None  # for C/C++ headers
+        self.install_lib = None  # set to either purelib or platlib
+        self.install_scripts = None
+        self.install_data = None
+        self.install_base = None
+        self.install_platbase = None
+        if site.ENABLE_USER_SITE:
+            self.install_userbase = site.USER_BASE
+            self.install_usersite = site.USER_SITE
+        else:
+            self.install_userbase = None
+            self.install_usersite = None
+        self.no_find_links = None
+
+        # Options not specifiable via command line
+        self.package_index = None
+        self.pth_file = self.always_copy_from = None
+        self.site_dirs = None
+        self.installed_projects = {}
+        # Always read easy_install options, even if we are subclassed, or have
+        # an independent instance created.  This ensures that defaults will
+        # always come from the standard configuration file(s)' "easy_install"
+        # section, even if this is a "develop" or "install" command, or some
+        # other embedding.
+        self._dry_run = None
+        self.verbose = self.distribution.verbose
+        self.distribution._set_command_options(
+            self, self.distribution.get_option_dict('easy_install')
+        )
+
+    def delete_blockers(self, blockers):
+        extant_blockers = (
+            filename for filename in blockers
+            if os.path.exists(filename) or os.path.islink(filename)
+        )
+        list(map(self._delete_path, extant_blockers))
+
+    def _delete_path(self, path):
+        log.info("Deleting %s", path)
+        if self.dry_run:
+            return
+
+        is_tree = os.path.isdir(path) and not os.path.islink(path)
+        remover = rmtree if is_tree else os.unlink
+        remover(path)
+
+    @staticmethod
+    def _render_version():
+        """
+        Render the Setuptools version and installation details, then exit.
+        """
+        ver = '{}.{}'.format(*sys.version_info)
+        dist = get_distribution('setuptools')
+        tmpl = 'setuptools {dist.version} from {dist.location} (Python {ver})'
+        print(tmpl.format(**locals()))
+        raise SystemExit()
+
+    def finalize_options(self):
+        self.version and self._render_version()
+
+        py_version = sys.version.split()[0]
+        prefix, exec_prefix = get_config_vars('prefix', 'exec_prefix')
+
+        self.config_vars = {
+            'dist_name': self.distribution.get_name(),
+            'dist_version': self.distribution.get_version(),
+            'dist_fullname': self.distribution.get_fullname(),
+            'py_version': py_version,
+            'py_version_short': py_version[0:3],
+            'py_version_nodot': py_version[0] + py_version[2],
+            'sys_prefix': prefix,
+            'prefix': prefix,
+            'sys_exec_prefix': exec_prefix,
+            'exec_prefix': exec_prefix,
+            # Only python 3.2+ has abiflags
+            'abiflags': getattr(sys, 'abiflags', ''),
+        }
+
+        if site.ENABLE_USER_SITE:
+            self.config_vars['userbase'] = self.install_userbase
+            self.config_vars['usersite'] = self.install_usersite
+
+        elif self.user:
+            log.warn("WARNING: The user site-packages directory is disabled.")
+
+        self._fix_install_dir_for_user_site()
+
+        self.expand_basedirs()
+        self.expand_dirs()
+
+        self._expand(
+            'install_dir', 'script_dir', 'build_directory',
+            'site_dirs',
+        )
+        # If a non-default installation directory was specified, default the
+        # script directory to match it.
+        if self.script_dir is None:
+            self.script_dir = self.install_dir
+
+        if self.no_find_links is None:
+            self.no_find_links = False
+
+        # Let install_dir get set by install_lib command, which in turn
+        # gets its info from the install command, and takes into account
+        # --prefix and --home and all that other crud.
+        self.set_undefined_options(
+            'install_lib', ('install_dir', 'install_dir')
+        )
+        # Likewise, set default script_dir from 'install_scripts.install_dir'
+        self.set_undefined_options(
+            'install_scripts', ('install_dir', 'script_dir')
+        )
+
+        if self.user and self.install_purelib:
+            self.install_dir = self.install_purelib
+            self.script_dir = self.install_scripts
+        # default --record from the install command
+        self.set_undefined_options('install', ('record', 'record'))
+        # Should this be moved to the if statement below? It's not used
+        # elsewhere
+        normpath = map(normalize_path, sys.path)
+        self.all_site_dirs = get_site_dirs()
+        if self.site_dirs is not None:
+            site_dirs = [
+                os.path.expanduser(s.strip()) for s in
+                self.site_dirs.split(',')
+            ]
+            for d in site_dirs:
+                if not os.path.isdir(d):
+                    log.warn("%s (in --site-dirs) does not exist", d)
+                elif normalize_path(d) not in normpath:
+                    raise DistutilsOptionError(
+                        d + " (in --site-dirs) is not on sys.path"
+                    )
+                else:
+                    self.all_site_dirs.append(normalize_path(d))
+        if not self.editable:
+            self.check_site_dir()
+        self.index_url = self.index_url or "https://pypi.org/simple/"
+        self.shadow_path = self.all_site_dirs[:]
+        for path_item in self.install_dir, normalize_path(self.script_dir):
+            if path_item not in self.shadow_path:
+                self.shadow_path.insert(0, path_item)
+
+        if self.allow_hosts is not None:
+            hosts = [s.strip() for s in self.allow_hosts.split(',')]
+        else:
+            hosts = ['*']
+        if self.package_index is None:
+            self.package_index = self.create_index(
+                self.index_url, search_path=self.shadow_path, hosts=hosts,
+            )
+        self.local_index = Environment(self.shadow_path + sys.path)
+
+        if self.find_links is not None:
+            if isinstance(self.find_links, str):
+                self.find_links = self.find_links.split()
+        else:
+            self.find_links = []
+        if self.local_snapshots_ok:
+            self.package_index.scan_egg_links(self.shadow_path + sys.path)
+        if not self.no_find_links:
+            self.package_index.add_find_links(self.find_links)
+        self.set_undefined_options('install_lib', ('optimize', 'optimize'))
+        if not isinstance(self.optimize, int):
+            try:
+                self.optimize = int(self.optimize)
+                if not (0 <= self.optimize <= 2):
+                    raise ValueError
+            except ValueError as e:
+                raise DistutilsOptionError(
+                    "--optimize must be 0, 1, or 2"
+                ) from e
+
+        if self.editable and not self.build_directory:
+            raise DistutilsArgError(
+                "Must specify a build directory (-b) when using --editable"
+            )
+        if not self.args:
+            raise DistutilsArgError(
+                "No urls, filenames, or requirements specified (see --help)")
+
+        self.outputs = []
+
+    def _fix_install_dir_for_user_site(self):
+        """
+        Fix the install_dir if "--user" was used.
+        """
+        if not self.user or not site.ENABLE_USER_SITE:
+            return
+
+        self.create_home_path()
+        if self.install_userbase is None:
+            msg = "User base directory is not specified"
+            raise DistutilsPlatformError(msg)
+        self.install_base = self.install_platbase = self.install_userbase
+        scheme_name = os.name.replace('posix', 'unix') + '_user'
+        self.select_scheme(scheme_name)
+
+    def _expand_attrs(self, attrs):
+        for attr in attrs:
+            val = getattr(self, attr)
+            if val is not None:
+                if os.name == 'posix' or os.name == 'nt':
+                    val = os.path.expanduser(val)
+                val = subst_vars(val, self.config_vars)
+                setattr(self, attr, val)
+
+    def expand_basedirs(self):
+        """Calls `os.path.expanduser` on install_base, install_platbase and
+        root."""
+        self._expand_attrs(['install_base', 'install_platbase', 'root'])
+
+    def expand_dirs(self):
+        """Calls `os.path.expanduser` on install dirs."""
+        dirs = [
+            'install_purelib',
+            'install_platlib',
+            'install_lib',
+            'install_headers',
+            'install_scripts',
+            'install_data',
+        ]
+        self._expand_attrs(dirs)
+
+    def run(self, show_deprecation=True):
+        if show_deprecation:
+            self.announce(
+                "WARNING: The easy_install command is deprecated "
+                "and will be removed in a future version.",
+                log.WARN,
+            )
+        if self.verbose != self.distribution.verbose:
+            log.set_verbosity(self.verbose)
+        try:
+            for spec in self.args:
+                self.easy_install(spec, not self.no_deps)
+            if self.record:
+                outputs = self.outputs
+                if self.root:  # strip any package prefix
+                    root_len = len(self.root)
+                    for counter in range(len(outputs)):
+                        outputs[counter] = outputs[counter][root_len:]
+                from distutils import file_util
+
+                self.execute(
+                    file_util.write_file, (self.record, outputs),
+                    "writing list of installed files to '%s'" %
+                    self.record
+                )
+            self.warn_deprecated_options()
+        finally:
+            log.set_verbosity(self.distribution.verbose)
+
+    def pseudo_tempname(self):
+        """Return a pseudo-tempname base in the install directory.
+        This code is intentionally naive; if a malicious party can write to
+        the target directory you're already in deep doodoo.
+        """
+        try:
+            pid = os.getpid()
+        except Exception:
+            pid = random.randint(0, sys.maxsize)
+        return os.path.join(self.install_dir, "test-easy-install-%s" % pid)
+
+    def warn_deprecated_options(self):
+        pass
+
+    def check_site_dir(self):
+        """Verify that self.install_dir is .pth-capable dir, if needed"""
+
+        instdir = normalize_path(self.install_dir)
+        pth_file = os.path.join(instdir, 'easy-install.pth')
+
+        if not os.path.exists(instdir):
+            try:
+                os.makedirs(instdir)
+            except (OSError, IOError):
+                self.cant_write_to_target()
+
+        # Is it a configured, PYTHONPATH, implicit, or explicit site dir?
+        is_site_dir = instdir in self.all_site_dirs
+
+        if not is_site_dir and not self.multi_version:
+            # No?  Then directly test whether it does .pth file processing
+            is_site_dir = self.check_pth_processing()
+        else:
+            # make sure we can write to target dir
+            testfile = self.pseudo_tempname() + '.write-test'
+            test_exists = os.path.exists(testfile)
+            try:
+                if test_exists:
+                    os.unlink(testfile)
+                open(testfile, 'w').close()
+                os.unlink(testfile)
+            except (OSError, IOError):
+                self.cant_write_to_target()
+
+        if not is_site_dir and not self.multi_version:
+            # Can't install non-multi to non-site dir with easy_install
+            pythonpath = os.environ.get('PYTHONPATH', '')
+            log.warn(self.__no_default_msg, self.install_dir, pythonpath)
+
+        if is_site_dir:
+            if self.pth_file is None:
+                self.pth_file = PthDistributions(pth_file, self.all_site_dirs)
+        else:
+            self.pth_file = None
+
+        if self.multi_version and not os.path.exists(pth_file):
+            self.pth_file = None  # don't create a .pth file
+        self.install_dir = instdir
+
+    __cant_write_msg = textwrap.dedent("""
+        can't create or remove files in install directory
+
+        The following error occurred while trying to add or remove files in the
+        installation directory:
+
+            %s
+
+        The installation directory you specified (via --install-dir, --prefix, or
+        the distutils default setting) was:
+
+            %s
+        """).lstrip()  # noqa
+
+    __not_exists_id = textwrap.dedent("""
+        This directory does not currently exist.  Please create it and try again, or
+        choose a different installation directory (using the -d or --install-dir
+        option).
+        """).lstrip()  # noqa
+
+    __access_msg = textwrap.dedent("""
+        Perhaps your account does not have write access to this directory?  If the
+        installation directory is a system-owned directory, you may need to sign in
+        as the administrator or "root" account.  If you do not have administrative
+        access to this machine, you may wish to choose a different installation
+        directory, preferably one that is listed in your PYTHONPATH environment
+        variable.
+
+        For information on other options, you may wish to consult the
+        documentation at:
+
+          https://setuptools.readthedocs.io/en/latest/easy_install.html
+
+        Please make the appropriate changes for your system and try again.
+        """).lstrip()  # noqa
+
+    def cant_write_to_target(self):
+        msg = self.__cant_write_msg % (sys.exc_info()[1], self.install_dir,)
+
+        if not os.path.exists(self.install_dir):
+            msg += '\n' + self.__not_exists_id
+        else:
+            msg += '\n' + self.__access_msg
+        raise DistutilsError(msg)
+
+    def check_pth_processing(self):
+        """Empirically verify whether .pth files are supported in inst. dir"""
+        instdir = self.install_dir
+        log.info("Checking .pth file support in %s", instdir)
+        pth_file = self.pseudo_tempname() + ".pth"
+        ok_file = pth_file + '.ok'
+        ok_exists = os.path.exists(ok_file)
+        tmpl = _one_liner("""
+            import os
+            f = open({ok_file!r}, 'w')
+            f.write('OK')
+            f.close()
+            """) + '\n'
+        try:
+            if ok_exists:
+                os.unlink(ok_file)
+            dirname = os.path.dirname(ok_file)
+            os.makedirs(dirname, exist_ok=True)
+            f = open(pth_file, 'w')
+        except (OSError, IOError):
+            self.cant_write_to_target()
+        else:
+            try:
+                f.write(tmpl.format(**locals()))
+                f.close()
+                f = None
+                executable = sys.executable
+                if os.name == 'nt':
+                    dirname, basename = os.path.split(executable)
+                    alt = os.path.join(dirname, 'pythonw.exe')
+                    use_alt = (
+                        basename.lower() == 'python.exe' and
+                        os.path.exists(alt)
+                    )
+                    if use_alt:
+                        # use pythonw.exe to avoid opening a console window
+                        executable = alt
+
+                from distutils.spawn import spawn
+
+                spawn([executable, '-E', '-c', 'pass'], 0)
+
+                if os.path.exists(ok_file):
+                    log.info(
+                        "TEST PASSED: %s appears to support .pth files",
+                        instdir
+                    )
+                    return True
+            finally:
+                if f:
+                    f.close()
+                if os.path.exists(ok_file):
+                    os.unlink(ok_file)
+                if os.path.exists(pth_file):
+                    os.unlink(pth_file)
+        if not self.multi_version:
+            log.warn("TEST FAILED: %s does NOT support .pth files", instdir)
+        return False
+
+    def install_egg_scripts(self, dist):
+        """Write all the scripts for `dist`, unless scripts are excluded"""
+        if not self.exclude_scripts and dist.metadata_isdir('scripts'):
+            for script_name in dist.metadata_listdir('scripts'):
+                if dist.metadata_isdir('scripts/' + script_name):
+                    # The "script" is a directory, likely a Python 3
+                    # __pycache__ directory, so skip it.
+                    continue
+                self.install_script(
+                    dist, script_name,
+                    dist.get_metadata('scripts/' + script_name)
+                )
+        self.install_wrapper_scripts(dist)
+
+    def add_output(self, path):
+        if os.path.isdir(path):
+            for base, dirs, files in os.walk(path):
+                for filename in files:
+                    self.outputs.append(os.path.join(base, filename))
+        else:
+            self.outputs.append(path)
+
+    def not_editable(self, spec):
+        if self.editable:
+            raise DistutilsArgError(
+                "Invalid argument %r: you can't use filenames or URLs "
+                "with --editable (except via the --find-links option)."
+                % (spec,)
+            )
+
+    def check_editable(self, spec):
+        if not self.editable:
+            return
+
+        if os.path.exists(os.path.join(self.build_directory, spec.key)):
+            raise DistutilsArgError(
+                "%r already exists in %s; can't do a checkout there" %
+                (spec.key, self.build_directory)
+            )
+
+    @contextlib.contextmanager
+    def _tmpdir(self):
+        tmpdir = tempfile.mkdtemp(prefix=u"easy_install-")
+        try:
+            # cast to str as workaround for #709 and #710 and #712
+            yield str(tmpdir)
+        finally:
+            os.path.exists(tmpdir) and rmtree(tmpdir)
+
+    def easy_install(self, spec, deps=False):
+        with self._tmpdir() as tmpdir:
+            if not isinstance(spec, Requirement):
+                if URL_SCHEME(spec):
+                    # It's a url, download it to tmpdir and process
+                    self.not_editable(spec)
+                    dl = self.package_index.download(spec, tmpdir)
+                    return self.install_item(None, dl, tmpdir, deps, True)
+
+                elif os.path.exists(spec):
+                    # Existing file or directory, just process it directly
+                    self.not_editable(spec)
+                    return self.install_item(None, spec, tmpdir, deps, True)
+                else:
+                    spec = parse_requirement_arg(spec)
+
+            self.check_editable(spec)
+            dist = self.package_index.fetch_distribution(
+                spec, tmpdir, self.upgrade, self.editable,
+                not self.always_copy, self.local_index
+            )
+            if dist is None:
+                msg = "Could not find suitable distribution for %r" % spec
+                if self.always_copy:
+                    msg += " (--always-copy skips system and development eggs)"
+                raise DistutilsError(msg)
+            elif dist.precedence == DEVELOP_DIST:
+                # .egg-info dists don't need installing, just process deps
+                self.process_distribution(spec, dist, deps, "Using")
+                return dist
+            else:
+                return self.install_item(spec, dist.location, tmpdir, deps)
+
+    def install_item(self, spec, download, tmpdir, deps, install_needed=False):
+
+        # Installation is also needed if file in tmpdir or is not an egg
+        install_needed = install_needed or self.always_copy
+        install_needed = install_needed or os.path.dirname(download) == tmpdir
+        install_needed = install_needed or not download.endswith('.egg')
+        install_needed = install_needed or (
+            self.always_copy_from is not None and
+            os.path.dirname(normalize_path(download)) ==
+            normalize_path(self.always_copy_from)
+        )
+
+        if spec and not install_needed:
+            # at this point, we know it's a local .egg, we just don't know if
+            # it's already installed.
+            for dist in self.local_index[spec.project_name]:
+                if dist.location == download:
+                    break
+            else:
+                install_needed = True  # it's not in the local index
+
+        log.info("Processing %s", os.path.basename(download))
+
+        if install_needed:
+            dists = self.install_eggs(spec, download, tmpdir)
+            for dist in dists:
+                self.process_distribution(spec, dist, deps)
+        else:
+            dists = [self.egg_distribution(download)]
+            self.process_distribution(spec, dists[0], deps, "Using")
+
+        if spec is not None:
+            for dist in dists:
+                if dist in spec:
+                    return dist
+
+    def select_scheme(self, name):
+        """Sets the install directories by applying the install schemes."""
+        # it's the caller's problem if they supply a bad name!
+        scheme = INSTALL_SCHEMES[name]
+        for key in SCHEME_KEYS:
+            attrname = 'install_' + key
+            if getattr(self, attrname) is None:
+                setattr(self, attrname, scheme[key])
+
+    def process_distribution(self, requirement, dist, deps=True, *info):
+        self.update_pth(dist)
+        self.package_index.add(dist)
+        if dist in self.local_index[dist.key]:
+            self.local_index.remove(dist)
+        self.local_index.add(dist)
+        self.install_egg_scripts(dist)
+        self.installed_projects[dist.key] = dist
+        log.info(self.installation_report(requirement, dist, *info))
+        if (dist.has_metadata('dependency_links.txt') and
+                not self.no_find_links):
+            self.package_index.add_find_links(
+                dist.get_metadata_lines('dependency_links.txt')
+            )
+        if not deps and not self.always_copy:
+            return
+        elif requirement is not None and dist.key != requirement.key:
+            log.warn("Skipping dependencies for %s", dist)
+            return  # XXX this is not the distribution we were looking for
+        elif requirement is None or dist not in requirement:
+            # if we wound up with a different version, resolve what we've got
+            distreq = dist.as_requirement()
+            requirement = Requirement(str(distreq))
+        log.info("Processing dependencies for %s", requirement)
+        try:
+            distros = WorkingSet([]).resolve(
+                [requirement], self.local_index, self.easy_install
+            )
+        except DistributionNotFound as e:
+            raise DistutilsError(str(e)) from e
+        except VersionConflict as e:
+            raise DistutilsError(e.report()) from e
+        if self.always_copy or self.always_copy_from:
+            # Force all the relevant distros to be copied or activated
+            for dist in distros:
+                if dist.key not in self.installed_projects:
+                    self.easy_install(dist.as_requirement())
+        log.info("Finished processing dependencies for %s", requirement)
+
+    def should_unzip(self, dist):
+        if self.zip_ok is not None:
+            return not self.zip_ok
+        if dist.has_metadata('not-zip-safe'):
+            return True
+        if not dist.has_metadata('zip-safe'):
+            return True
+        return False
+
+    def maybe_move(self, spec, dist_filename, setup_base):
+        dst = os.path.join(self.build_directory, spec.key)
+        if os.path.exists(dst):
+            msg = (
+                "%r already exists in %s; build directory %s will not be kept"
+            )
+            log.warn(msg, spec.key, self.build_directory, setup_base)
+            return setup_base
+        if os.path.isdir(dist_filename):
+            setup_base = dist_filename
+        else:
+            if os.path.dirname(dist_filename) == setup_base:
+                os.unlink(dist_filename)  # get it out of the tmp dir
+            contents = os.listdir(setup_base)
+            if len(contents) == 1:
+                dist_filename = os.path.join(setup_base, contents[0])
+                if os.path.isdir(dist_filename):
+                    # if the only thing there is a directory, move it instead
+                    setup_base = dist_filename
+        ensure_directory(dst)
+        shutil.move(setup_base, dst)
+        return dst
+
+    def install_wrapper_scripts(self, dist):
+        if self.exclude_scripts:
+            return
+        for args in ScriptWriter.best().get_args(dist):
+            self.write_script(*args)
+
+    def install_script(self, dist, script_name, script_text, dev_path=None):
+        """Generate a legacy script wrapper and install it"""
+        spec = str(dist.as_requirement())
+        is_script = is_python_script(script_text, script_name)
+
+        if is_script:
+            body = self._load_template(dev_path) % locals()
+            script_text = ScriptWriter.get_header(script_text) + body
+        self.write_script(script_name, _to_bytes(script_text), 'b')
+
+    @staticmethod
+    def _load_template(dev_path):
+        """
+        There are a couple of template scripts in the package. This
+        function loads one of them and prepares it for use.
+        """
+        # See https://github.com/pypa/setuptools/issues/134 for info
+        # on script file naming and downstream issues with SVR4
+        name = 'script.tmpl'
+        if dev_path:
+            name = name.replace('.tmpl', ' (dev).tmpl')
+
+        raw_bytes = resource_string('setuptools', name)
+        return raw_bytes.decode('utf-8')
+
+    def write_script(self, script_name, contents, mode="t", blockers=()):
+        """Write an executable file to the scripts directory"""
+        self.delete_blockers(  # clean up old .py/.pyw w/o a script
+            [os.path.join(self.script_dir, x) for x in blockers]
+        )
+        log.info("Installing %s script to %s", script_name, self.script_dir)
+        target = os.path.join(self.script_dir, script_name)
+        self.add_output(target)
+
+        if self.dry_run:
+            return
+
+        mask = current_umask()
+        ensure_directory(target)
+        if os.path.exists(target):
+            os.unlink(target)
+        with open(target, "w" + mode) as f:
+            f.write(contents)
+        chmod(target, 0o777 - mask)
+
+    def install_eggs(self, spec, dist_filename, tmpdir):
+        # .egg dirs or files are already built, so just return them
+        if dist_filename.lower().endswith('.egg'):
+            return [self.install_egg(dist_filename, tmpdir)]
+        elif dist_filename.lower().endswith('.exe'):
+            return [self.install_exe(dist_filename, tmpdir)]
+        elif dist_filename.lower().endswith('.whl'):
+            return [self.install_wheel(dist_filename, tmpdir)]
+
+        # Anything else, try to extract and build
+        setup_base = tmpdir
+        if os.path.isfile(dist_filename) and not dist_filename.endswith('.py'):
+            unpack_archive(dist_filename, tmpdir, self.unpack_progress)
+        elif os.path.isdir(dist_filename):
+            setup_base = os.path.abspath(dist_filename)
+
+        if (setup_base.startswith(tmpdir)  # something we downloaded
+                and self.build_directory and spec is not None):
+            setup_base = self.maybe_move(spec, dist_filename, setup_base)
+
+        # Find the setup.py file
+        setup_script = os.path.join(setup_base, 'setup.py')
+
+        if not os.path.exists(setup_script):
+            setups = glob(os.path.join(setup_base, '*', 'setup.py'))
+            if not setups:
+                raise DistutilsError(
+                    "Couldn't find a setup script in %s" %
+                    os.path.abspath(dist_filename)
+                )
+            if len(setups) > 1:
+                raise DistutilsError(
+                    "Multiple setup scripts in %s" %
+                    os.path.abspath(dist_filename)
+                )
+            setup_script = setups[0]
+
+        # Now run it, and return the result
+        if self.editable:
+            log.info(self.report_editable(spec, setup_script))
+            return []
+        else:
+            return self.build_and_install(setup_script, setup_base)
+
+    def egg_distribution(self, egg_path):
+        if os.path.isdir(egg_path):
+            metadata = PathMetadata(egg_path, os.path.join(egg_path,
+                                                           'EGG-INFO'))
+        else:
+            metadata = EggMetadata(zipimport.zipimporter(egg_path))
+        return Distribution.from_filename(egg_path, metadata=metadata)
+
+    def install_egg(self, egg_path, tmpdir):
+        destination = os.path.join(
+            self.install_dir,
+            os.path.basename(egg_path),
+        )
+        destination = os.path.abspath(destination)
+        if not self.dry_run:
+            ensure_directory(destination)
+
+        dist = self.egg_distribution(egg_path)
+        if not samefile(egg_path, destination):
+            if os.path.isdir(destination) and not os.path.islink(destination):
+                dir_util.remove_tree(destination, dry_run=self.dry_run)
+            elif os.path.exists(destination):
+                self.execute(
+                    os.unlink,
+                    (destination,),
+                    "Removing " + destination,
+                )
+            try:
+                new_dist_is_zipped = False
+                if os.path.isdir(egg_path):
+                    if egg_path.startswith(tmpdir):
+                        f, m = shutil.move, "Moving"
+                    else:
+                        f, m = shutil.copytree, "Copying"
+                elif self.should_unzip(dist):
+                    self.mkpath(destination)
+                    f, m = self.unpack_and_compile, "Extracting"
+                else:
+                    new_dist_is_zipped = True
+                    if egg_path.startswith(tmpdir):
+                        f, m = shutil.move, "Moving"
+                    else:
+                        f, m = shutil.copy2, "Copying"
+                self.execute(
+                    f,
+                    (egg_path, destination),
+                    (m + " %s to %s") % (
+                        os.path.basename(egg_path),
+                        os.path.dirname(destination)
+                    ),
+                )
+                update_dist_caches(
+                    destination,
+                    fix_zipimporter_caches=new_dist_is_zipped,
+                )
+            except Exception:
+                update_dist_caches(destination, fix_zipimporter_caches=False)
+                raise
+
+        self.add_output(destination)
+        return self.egg_distribution(destination)
+
+    def install_exe(self, dist_filename, tmpdir):
+        # See if it's valid, get data
+        cfg = extract_wininst_cfg(dist_filename)
+        if cfg is None:
+            raise DistutilsError(
+                "%s is not a valid distutils Windows .exe" % dist_filename
+            )
+        # Create a dummy distribution object until we build the real distro
+        dist = Distribution(
+            None,
+            project_name=cfg.get('metadata', 'name'),
+            version=cfg.get('metadata', 'version'), platform=get_platform(),
+        )
+
+        # Convert the .exe to an unpacked egg
+        egg_path = os.path.join(tmpdir, dist.egg_name() + '.egg')
+        dist.location = egg_path
+        egg_tmp = egg_path + '.tmp'
+        _egg_info = os.path.join(egg_tmp, 'EGG-INFO')
+        pkg_inf = os.path.join(_egg_info, 'PKG-INFO')
+        ensure_directory(pkg_inf)  # make sure EGG-INFO dir exists
+        dist._provider = PathMetadata(egg_tmp, _egg_info)  # XXX
+        self.exe_to_egg(dist_filename, egg_tmp)
+
+        # Write EGG-INFO/PKG-INFO
+        if not os.path.exists(pkg_inf):
+            f = open(pkg_inf, 'w')
+            f.write('Metadata-Version: 1.0\n')
+            for k, v in cfg.items('metadata'):
+                if k != 'target_version':
+                    f.write('%s: %s\n' % (k.replace('_', '-').title(), v))
+            f.close()
+        script_dir = os.path.join(_egg_info, 'scripts')
+        # delete entry-point scripts to avoid duping
+        self.delete_blockers([
+            os.path.join(script_dir, args[0])
+            for args in ScriptWriter.get_args(dist)
+        ])
+        # Build .egg file from tmpdir
+        bdist_egg.make_zipfile(
+            egg_path, egg_tmp, verbose=self.verbose, dry_run=self.dry_run,
+        )
+        # install the .egg
+        return self.install_egg(egg_path, tmpdir)
+
+    def exe_to_egg(self, dist_filename, egg_tmp):
+        """Extract a bdist_wininst to the directories an egg would use"""
+        # Check for .pth file and set up prefix translations
+        prefixes = get_exe_prefixes(dist_filename)
+        to_compile = []
+        native_libs = []
+        top_level = {}
+
+        def process(src, dst):
+            s = src.lower()
+            for old, new in prefixes:
+                if s.startswith(old):
+                    src = new + src[len(old):]
+                    parts = src.split('/')
+                    dst = os.path.join(egg_tmp, *parts)
+                    dl = dst.lower()
+                    if dl.endswith('.pyd') or dl.endswith('.dll'):
+                        parts[-1] = bdist_egg.strip_module(parts[-1])
+                        top_level[os.path.splitext(parts[0])[0]] = 1
+                        native_libs.append(src)
+                    elif dl.endswith('.py') and old != 'SCRIPTS/':
+                        top_level[os.path.splitext(parts[0])[0]] = 1
+                        to_compile.append(dst)
+                    return dst
+            if not src.endswith('.pth'):
+                log.warn("WARNING: can't process %s", src)
+            return None
+
+        # extract, tracking .pyd/.dll->native_libs and .py -> to_compile
+        unpack_archive(dist_filename, egg_tmp, process)
+        stubs = []
+        for res in native_libs:
+            if res.lower().endswith('.pyd'):  # create stubs for .pyd's
+                parts = res.split('/')
+                resource = parts[-1]
+                parts[-1] = bdist_egg.strip_module(parts[-1]) + '.py'
+                pyfile = os.path.join(egg_tmp, *parts)
+                to_compile.append(pyfile)
+                stubs.append(pyfile)
+                bdist_egg.write_stub(resource, pyfile)
+        self.byte_compile(to_compile)  # compile .py's
+        bdist_egg.write_safety_flag(
+            os.path.join(egg_tmp, 'EGG-INFO'),
+            bdist_egg.analyze_egg(egg_tmp, stubs))  # write zip-safety flag
+
+        for name in 'top_level', 'native_libs':
+            if locals()[name]:
+                txt = os.path.join(egg_tmp, 'EGG-INFO', name + '.txt')
+                if not os.path.exists(txt):
+                    f = open(txt, 'w')
+                    f.write('\n'.join(locals()[name]) + '\n')
+                    f.close()
+
+    def install_wheel(self, wheel_path, tmpdir):
+        wheel = Wheel(wheel_path)
+        assert wheel.is_compatible()
+        destination = os.path.join(self.install_dir, wheel.egg_name())
+        destination = os.path.abspath(destination)
+        if not self.dry_run:
+            ensure_directory(destination)
+        if os.path.isdir(destination) and not os.path.islink(destination):
+            dir_util.remove_tree(destination, dry_run=self.dry_run)
+        elif os.path.exists(destination):
+            self.execute(
+                os.unlink,
+                (destination,),
+                "Removing " + destination,
+            )
+        try:
+            self.execute(
+                wheel.install_as_egg,
+                (destination,),
+                ("Installing %s to %s") % (
+                    os.path.basename(wheel_path),
+                    os.path.dirname(destination)
+                ),
+            )
+        finally:
+            update_dist_caches(destination, fix_zipimporter_caches=False)
+        self.add_output(destination)
+        return self.egg_distribution(destination)
+
+    __mv_warning = textwrap.dedent("""
+        Because this distribution was installed --multi-version, before you can
+        import modules from this package in an application, you will need to
+        'import pkg_resources' and then use a 'require()' call similar to one of
+        these examples, in order to select the desired version:
+
+            pkg_resources.require("%(name)s")  # latest installed version
+            pkg_resources.require("%(name)s==%(version)s")  # this exact version
+            pkg_resources.require("%(name)s>=%(version)s")  # this version or higher
+        """).lstrip()  # noqa
+
+    __id_warning = textwrap.dedent("""
+        Note also that the installation directory must be on sys.path at runtime for
+        this to work.  (e.g. by being the application's script directory, by being on
+        PYTHONPATH, or by being added to sys.path by your code.)
+        """)  # noqa
+
+    def installation_report(self, req, dist, what="Installed"):
+        """Helpful installation message for display to package users"""
+        msg = "\n%(what)s %(eggloc)s%(extras)s"
+        if self.multi_version and not self.no_report:
+            msg += '\n' + self.__mv_warning
+            if self.install_dir not in map(normalize_path, sys.path):
+                msg += '\n' + self.__id_warning
+
+        eggloc = dist.location
+        name = dist.project_name
+        version = dist.version
+        extras = ''  # TODO: self.report_extras(req, dist)
+        return msg % locals()
+
+    __editable_msg = textwrap.dedent("""
+        Extracted editable version of %(spec)s to %(dirname)s
+
+        If it uses setuptools in its setup script, you can activate it in
+        "development" mode by going to that directory and running::
+
+            %(python)s setup.py develop
+
+        See the setuptools documentation for the "develop" command for more info.
+        """).lstrip()  # noqa
+
+    def report_editable(self, spec, setup_script):
+        dirname = os.path.dirname(setup_script)
+        python = sys.executable
+        return '\n' + self.__editable_msg % locals()
+
+    def run_setup(self, setup_script, setup_base, args):
+        sys.modules.setdefault('distutils.command.bdist_egg', bdist_egg)
+        sys.modules.setdefault('distutils.command.egg_info', egg_info)
+
+        args = list(args)
+        if self.verbose > 2:
+            v = 'v' * (self.verbose - 1)
+            args.insert(0, '-' + v)
+        elif self.verbose < 2:
+            args.insert(0, '-q')
+        if self.dry_run:
+            args.insert(0, '-n')
+        log.info(
+            "Running %s %s", setup_script[len(setup_base) + 1:], ' '.join(args)
+        )
+        try:
+            run_setup(setup_script, args)
+        except SystemExit as v:
+            raise DistutilsError(
+                "Setup script exited with %s" % (v.args[0],)
+            ) from v
+
+    def build_and_install(self, setup_script, setup_base):
+        args = ['bdist_egg', '--dist-dir']
+
+        dist_dir = tempfile.mkdtemp(
+            prefix='egg-dist-tmp-', dir=os.path.dirname(setup_script)
+        )
+        try:
+            self._set_fetcher_options(os.path.dirname(setup_script))
+            args.append(dist_dir)
+
+            self.run_setup(setup_script, setup_base, args)
+            all_eggs = Environment([dist_dir])
+            eggs = []
+            for key in all_eggs:
+                for dist in all_eggs[key]:
+                    eggs.append(self.install_egg(dist.location, setup_base))
+            if not eggs and not self.dry_run:
+                log.warn("No eggs found in %s (setup script problem?)",
+                         dist_dir)
+            return eggs
+        finally:
+            rmtree(dist_dir)
+            log.set_verbosity(self.verbose)  # restore our log verbosity
+
+    def _set_fetcher_options(self, base):
+        """
+        When easy_install is about to run bdist_egg on a source dist, that
+        source dist might have 'setup_requires' directives, requiring
+        additional fetching. Ensure the fetcher options given to easy_install
+        are available to that command as well.
+        """
+        # find the fetch options from easy_install and write them out
+        # to the setup.cfg file.
+        ei_opts = self.distribution.get_option_dict('easy_install').copy()
+        fetch_directives = (
+            'find_links', 'site_dirs', 'index_url', 'optimize', 'allow_hosts',
+        )
+        fetch_options = {}
+        for key, val in ei_opts.items():
+            if key not in fetch_directives:
+                continue
+            fetch_options[key.replace('_', '-')] = val[1]
+        # create a settings dictionary suitable for `edit_config`
+        settings = dict(easy_install=fetch_options)
+        cfg_filename = os.path.join(base, 'setup.cfg')
+        setopt.edit_config(cfg_filename, settings)
+
+    def update_pth(self, dist):
+        if self.pth_file is None:
+            return
+
+        for d in self.pth_file[dist.key]:  # drop old entries
+            if self.multi_version or d.location != dist.location:
+                log.info("Removing %s from easy-install.pth file", d)
+                self.pth_file.remove(d)
+                if d.location in self.shadow_path:
+                    self.shadow_path.remove(d.location)
+
+        if not self.multi_version:
+            if dist.location in self.pth_file.paths:
+                log.info(
+                    "%s is already the active version in easy-install.pth",
+                    dist,
+                )
+            else:
+                log.info("Adding %s to easy-install.pth file", dist)
+                self.pth_file.add(dist)  # add new entry
+                if dist.location not in self.shadow_path:
+                    self.shadow_path.append(dist.location)
+
+        if not self.dry_run:
+
+            self.pth_file.save()
+
+            if dist.key == 'setuptools':
+                # Ensure that setuptools itself never becomes unavailable!
+                # XXX should this check for latest version?
+                filename = os.path.join(self.install_dir, 'setuptools.pth')
+                if os.path.islink(filename):
+                    os.unlink(filename)
+                f = open(filename, 'wt')
+                f.write(self.pth_file.make_relative(dist.location) + '\n')
+                f.close()
+
+    def unpack_progress(self, src, dst):
+        # Progress filter for unpacking
+        log.debug("Unpacking %s to %s", src, dst)
+        return dst  # only unpack-and-compile skips files for dry run
+
+    def unpack_and_compile(self, egg_path, destination):
+        to_compile = []
+        to_chmod = []
+
+        def pf(src, dst):
+            if dst.endswith('.py') and not src.startswith('EGG-INFO/'):
+                to_compile.append(dst)
+            elif dst.endswith('.dll') or dst.endswith('.so'):
+                to_chmod.append(dst)
+            self.unpack_progress(src, dst)
+            return not self.dry_run and dst or None
+
+        unpack_archive(egg_path, destination, pf)
+        self.byte_compile(to_compile)
+        if not self.dry_run:
+            for f in to_chmod:
+                mode = ((os.stat(f)[stat.ST_MODE]) | 0o555) & 0o7755
+                chmod(f, mode)
+
+    def byte_compile(self, to_compile):
+        if sys.dont_write_bytecode:
+            return
+
+        from distutils.util import byte_compile
+
+        try:
+            # try to make the byte compile messages quieter
+            log.set_verbosity(self.verbose - 1)
+
+            byte_compile(to_compile, optimize=0, force=1, dry_run=self.dry_run)
+            if self.optimize:
+                byte_compile(
+                    to_compile, optimize=self.optimize, force=1,
+                    dry_run=self.dry_run,
+                )
+        finally:
+            log.set_verbosity(self.verbose)  # restore original verbosity
+
+    __no_default_msg = textwrap.dedent("""
+        bad install directory or PYTHONPATH
+
+        You are attempting to install a package to a directory that is not
+        on PYTHONPATH and which Python does not read ".pth" files from.  The
+        installation directory you specified (via --install-dir, --prefix, or
+        the distutils default setting) was:
+
+            %s
+
+        and your PYTHONPATH environment variable currently contains:
+
+            %r
+
+        Here are some of your options for correcting the problem:
+
+        * You can choose a different installation directory, i.e., one that is
+          on PYTHONPATH or supports .pth files
+
+        * You can add the installation directory to the PYTHONPATH environment
+          variable.  (It must then also be on PYTHONPATH whenever you run
+          Python and want to use the package(s) you are installing.)
+
+        * You can set up the installation directory to support ".pth" files by
+          using one of the approaches described here:
+
+          https://setuptools.readthedocs.io/en/latest/easy_install.html#custom-installation-locations
+
+
+        Please make the appropriate changes for your system and try again.
+        """).strip()
+
+    def create_home_path(self):
+        """Create directories under ~."""
+        if not self.user:
+            return
+        home = convert_path(os.path.expanduser("~"))
+        for name, path in self.config_vars.items():
+            if path.startswith(home) and not os.path.isdir(path):
+                self.debug_print("os.makedirs('%s', 0o700)" % path)
+                os.makedirs(path, 0o700)
+
+    INSTALL_SCHEMES = dict(
+        posix=dict(
+            install_dir='$base/lib/python$py_version_short/site-packages',
+            script_dir='$base/bin',
+        ),
+    )
+
+    DEFAULT_SCHEME = dict(
+        install_dir='$base/Lib/site-packages',
+        script_dir='$base/Scripts',
+    )
+
+    def _expand(self, *attrs):
+        config_vars = self.get_finalized_command('install').config_vars
+
+        if self.prefix:
+            # Set default install_dir/scripts from --prefix
+            config_vars = config_vars.copy()
+            config_vars['base'] = self.prefix
+            scheme = self.INSTALL_SCHEMES.get(os.name, self.DEFAULT_SCHEME)
+            for attr, val in scheme.items():
+                if getattr(self, attr, None) is None:
+                    setattr(self, attr, val)
+
+        from distutils.util import subst_vars
+
+        for attr in attrs:
+            val = getattr(self, attr)
+            if val is not None:
+                val = subst_vars(val, config_vars)
+                if os.name == 'posix':
+                    val = os.path.expanduser(val)
+                setattr(self, attr, val)
+
+
+def _pythonpath():
+    items = os.environ.get('PYTHONPATH', '').split(os.pathsep)
+    return filter(None, items)
+
+
+def get_site_dirs():
+    """
+    Return a list of 'site' dirs
+    """
+
+    sitedirs = []
+
+    # start with PYTHONPATH
+    sitedirs.extend(_pythonpath())
+
+    prefixes = [sys.prefix]
+    if sys.exec_prefix != sys.prefix:
+        prefixes.append(sys.exec_prefix)
+    for prefix in prefixes:
+        if prefix:
+            if sys.platform in ('os2emx', 'riscos'):
+                sitedirs.append(os.path.join(prefix, "Lib", "site-packages"))
+            elif os.sep == '/':
+                sitedirs.extend([
+                    os.path.join(
+                        prefix,
+                        "lib",
+                        "python{}.{}".format(*sys.version_info),
+                        "site-packages",
+                    ),
+                    os.path.join(prefix, "lib", "site-python"),
+                ])
+            else:
+                sitedirs.extend([
+                    prefix,
+                    os.path.join(prefix, "lib", "site-packages"),
+                ])
+            if sys.platform == 'darwin':
+                # for framework builds *only* we add the standard Apple
+                # locations. Currently only per-user, but /Library and
+                # /Network/Library could be added too
+                if 'Python.framework' in prefix:
+                    home = os.environ.get('HOME')
+                    if home:
+                        home_sp = os.path.join(
+                            home,
+                            'Library',
+                            'Python',
+                            '{}.{}'.format(*sys.version_info),
+                            'site-packages',
+                        )
+                        sitedirs.append(home_sp)
+    lib_paths = get_path('purelib'), get_path('platlib')
+    for site_lib in lib_paths:
+        if site_lib not in sitedirs:
+            sitedirs.append(site_lib)
+
+    if site.ENABLE_USER_SITE:
+        sitedirs.append(site.USER_SITE)
+
+    try:
+        sitedirs.extend(site.getsitepackages())
+    except AttributeError:
+        pass
+
+    sitedirs = list(map(normalize_path, sitedirs))
+
+    return sitedirs
+
+
+def expand_paths(inputs):
+    """Yield sys.path directories that might contain "old-style" packages"""
+
+    seen = {}
+
+    for dirname in inputs:
+        dirname = normalize_path(dirname)
+        if dirname in seen:
+            continue
+
+        seen[dirname] = 1
+        if not os.path.isdir(dirname):
+            continue
+
+        files = os.listdir(dirname)
+        yield dirname, files
+
+        for name in files:
+            if not name.endswith('.pth'):
+                # We only care about the .pth files
+                continue
+            if name in ('easy-install.pth', 'setuptools.pth'):
+                # Ignore .pth files that we control
+                continue
+
+            # Read the .pth file
+            f = open(os.path.join(dirname, name))
+            lines = list(yield_lines(f))
+            f.close()
+
+            # Yield existing non-dupe, non-import directory lines from it
+            for line in lines:
+                if not line.startswith("import"):
+                    line = normalize_path(line.rstrip())
+                    if line not in seen:
+                        seen[line] = 1
+                        if not os.path.isdir(line):
+                            continue
+                        yield line, os.listdir(line)
+
+
+def extract_wininst_cfg(dist_filename):
+    """Extract configuration data from a bdist_wininst .exe
+
+    Returns a configparser.RawConfigParser, or None
+    """
+    f = open(dist_filename, 'rb')
+    try:
+        endrec = zipfile._EndRecData(f)
+        if endrec is None:
+            return None
+
+        prepended = (endrec[9] - endrec[5]) - endrec[6]
+        if prepended < 12:  # no wininst data here
+            return None
+        f.seek(prepended - 12)
+
+        tag, cfglen, bmlen = struct.unpack("<iii", f.read(12))
+        if tag not in (0x1234567A, 0x1234567B):
+            return None  # not a valid tag
+
+        f.seek(prepended - (12 + cfglen))
+        init = {'version': '', 'target_version': ''}
+        cfg = configparser.RawConfigParser(init)
+        try:
+            part = f.read(cfglen)
+            # Read up to the first null byte.
+            config = part.split(b'\0', 1)[0]
+            # Now the config is in bytes, but for RawConfigParser, it should
+            #  be text, so decode it.
+            config = config.decode(sys.getfilesystemencoding())
+            cfg.readfp(io.StringIO(config))
+        except configparser.Error:
+            return None
+        if not cfg.has_section('metadata') or not cfg.has_section('Setup'):
+            return None
+        return cfg
+
+    finally:
+        f.close()
+
+
+def get_exe_prefixes(exe_filename):
+    """Get exe->egg path translations for a given .exe file"""
+
+    prefixes = [
+        ('PURELIB/', ''),
+        ('PLATLIB/pywin32_system32', ''),
+        ('PLATLIB/', ''),
+        ('SCRIPTS/', 'EGG-INFO/scripts/'),
+        ('DATA/lib/site-packages', ''),
+    ]
+    z = zipfile.ZipFile(exe_filename)
+    try:
+        for info in z.infolist():
+            name = info.filename
+            parts = name.split('/')
+            if len(parts) == 3 and parts[2] == 'PKG-INFO':
+                if parts[1].endswith('.egg-info'):
+                    prefixes.insert(0, ('/'.join(parts[:2]), 'EGG-INFO/'))
+                    break
+            if len(parts) != 2 or not name.endswith('.pth'):
+                continue
+            if name.endswith('-nspkg.pth'):
+                continue
+            if parts[0].upper() in ('PURELIB', 'PLATLIB'):
+                contents = z.read(name).decode()
+                for pth in yield_lines(contents):
+                    pth = pth.strip().replace('\\', '/')
+                    if not pth.startswith('import'):
+                        prefixes.append((('%s/%s/' % (parts[0], pth)), ''))
+    finally:
+        z.close()
+    prefixes = [(x.lower(), y) for x, y in prefixes]
+    prefixes.sort()
+    prefixes.reverse()
+    return prefixes
+
+
+class PthDistributions(Environment):
+    """A .pth file with Distribution paths in it"""
+
+    dirty = False
+
+    def __init__(self, filename, sitedirs=()):
+        self.filename = filename
+        self.sitedirs = list(map(normalize_path, sitedirs))
+        self.basedir = normalize_path(os.path.dirname(self.filename))
+        self._load()
+        Environment.__init__(self, [], None, None)
+        for path in yield_lines(self.paths):
+            list(map(self.add, find_distributions(path, True)))
+
+    def _load(self):
+        self.paths = []
+        saw_import = False
+        seen = dict.fromkeys(self.sitedirs)
+        if os.path.isfile(self.filename):
+            f = open(self.filename, 'rt')
+            for line in f:
+                if line.startswith('import'):
+                    saw_import = True
+                    continue
+                path = line.rstrip()
+                self.paths.append(path)
+                if not path.strip() or path.strip().startswith('#'):
+                    continue
+                # skip non-existent paths, in case somebody deleted a package
+                # manually, and duplicate paths as well
+                path = self.paths[-1] = normalize_path(
+                    os.path.join(self.basedir, path)
+                )
+                if not os.path.exists(path) or path in seen:
+                    self.paths.pop()  # skip it
+                    self.dirty = True  # we cleaned up, so we're dirty now :)
+                    continue
+                seen[path] = 1
+            f.close()
+
+        if self.paths and not saw_import:
+            self.dirty = True  # ensure anything we touch has import wrappers
+        while self.paths and not self.paths[-1].strip():
+            self.paths.pop()
+
+    def save(self):
+        """Write changed .pth file back to disk"""
+        if not self.dirty:
+            return
+
+        rel_paths = list(map(self.make_relative, self.paths))
+        if rel_paths:
+            log.debug("Saving %s", self.filename)
+            lines = self._wrap_lines(rel_paths)
+            data = '\n'.join(lines) + '\n'
+
+            if os.path.islink(self.filename):
+                os.unlink(self.filename)
+            with open(self.filename, 'wt') as f:
+                f.write(data)
+
+        elif os.path.exists(self.filename):
+            log.debug("Deleting empty %s", self.filename)
+            os.unlink(self.filename)
+
+        self.dirty = False
+
+    @staticmethod
+    def _wrap_lines(lines):
+        return lines
+
+    def add(self, dist):
+        """Add `dist` to the distribution map"""
+        new_path = (
+            dist.location not in self.paths and (
+                dist.location not in self.sitedirs or
+                # account for '.' being in PYTHONPATH
+                dist.location == os.getcwd()
+            )
+        )
+        if new_path:
+            self.paths.append(dist.location)
+            self.dirty = True
+        Environment.add(self, dist)
+
+    def remove(self, dist):
+        """Remove `dist` from the distribution map"""
+        while dist.location in self.paths:
+            self.paths.remove(dist.location)
+            self.dirty = True
+        Environment.remove(self, dist)
+
+    def make_relative(self, path):
+        npath, last = os.path.split(normalize_path(path))
+        baselen = len(self.basedir)
+        parts = [last]
+        sep = os.altsep == '/' and '/' or os.sep
+        while len(npath) >= baselen:
+            if npath == self.basedir:
+                parts.append(os.curdir)
+                parts.reverse()
+                return sep.join(parts)
+            npath, last = os.path.split(npath)
+            parts.append(last)
+        else:
+            return path
+
+
+class RewritePthDistributions(PthDistributions):
+    @classmethod
+    def _wrap_lines(cls, lines):
+        yield cls.prelude
+        for line in lines:
+            yield line
+        yield cls.postlude
+
+    prelude = _one_liner("""
+        import sys
+        sys.__plen = len(sys.path)
+        """)
+    postlude = _one_liner("""
+        import sys
+        new = sys.path[sys.__plen:]
+        del sys.path[sys.__plen:]
+        p = getattr(sys, '__egginsert', 0)
+        sys.path[p:p] = new
+        sys.__egginsert = p + len(new)
+        """)
+
+
+if os.environ.get('SETUPTOOLS_SYS_PATH_TECHNIQUE', 'raw') == 'rewrite':
+    PthDistributions = RewritePthDistributions
+
+
+def _first_line_re():
+    """
+    Return a regular expression based on first_line_re suitable for matching
+    strings.
+    """
+    if isinstance(first_line_re.pattern, str):
+        return first_line_re
+
+    # first_line_re in Python >=3.1.4 and >=3.2.1 is a bytes pattern.
+    return re.compile(first_line_re.pattern.decode())
+
+
+def auto_chmod(func, arg, exc):
+    if func in [os.unlink, os.remove] and os.name == 'nt':
+        chmod(arg, stat.S_IWRITE)
+        return func(arg)
+    et, ev, _ = sys.exc_info()
+    # TODO: This code doesn't make sense. What is it trying to do?
+    raise (ev[0], ev[1] + (" %s %s" % (func, arg)))
+
+
+def update_dist_caches(dist_path, fix_zipimporter_caches):
+    """
+    Fix any globally cached `dist_path` related data
+
+    `dist_path` should be a path of a newly installed egg distribution (zipped
+    or unzipped).
+
+    sys.path_importer_cache contains finder objects that have been cached when
+    importing data from the original distribution. Any such finders need to be
+    cleared since the replacement distribution might be packaged differently,
+    e.g. a zipped egg distribution might get replaced with an unzipped egg
+    folder or vice versa. Having the old finders cached may then cause Python
+    to attempt loading modules from the replacement distribution using an
+    incorrect loader.
+
+    zipimport.zipimporter objects are Python loaders charged with importing
+    data packaged inside zip archives. If stale loaders referencing the
+    original distribution, are left behind, they can fail to load modules from
+    the replacement distribution. E.g. if an old zipimport.zipimporter instance
+    is used to load data from a new zipped egg archive, it may cause the
+    operation to attempt to locate the requested data in the wrong location -
+    one indicated by the original distribution's zip archive directory
+    information. Such an operation may then fail outright, e.g. report having
+    read a 'bad local file header', or even worse, it may fail silently &
+    return invalid data.
+
+    zipimport._zip_directory_cache contains cached zip archive directory
+    information for all existing zipimport.zipimporter instances and all such
+    instances connected to the same archive share the same cached directory
+    information.
+
+    If asked, and the underlying Python implementation allows it, we can fix
+    all existing zipimport.zipimporter instances instead of having to track
+    them down and remove them one by one, by updating their shared cached zip
+    archive directory information. This, of course, assumes that the
+    replacement distribution is packaged as a zipped egg.
+
+    If not asked to fix existing zipimport.zipimporter instances, we still do
+    our best to clear any remaining zipimport.zipimporter related cached data
+    that might somehow later get used when attempting to load data from the new
+    distribution and thus cause such load operations to fail. Note that when
+    tracking down such remaining stale data, we can not catch every conceivable
+    usage from here, and we clear only those that we know of and have found to
+    cause problems if left alive. Any remaining caches should be updated by
+    whomever is in charge of maintaining them, i.e. they should be ready to
+    handle us replacing their zip archives with new distributions at runtime.
+
+    """
+    # There are several other known sources of stale zipimport.zipimporter
+    # instances that we do not clear here, but might if ever given a reason to
+    # do so:
+    # * Global setuptools pkg_resources.working_set (a.k.a. 'master working
+    # set') may contain distributions which may in turn contain their
+    #   zipimport.zipimporter loaders.
+    # * Several zipimport.zipimporter loaders held by local variables further
+    #   up the function call stack when running the setuptools installation.
+    # * Already loaded modules may have their __loader__ attribute set to the
+    #   exact loader instance used when importing them. Python 3.4 docs state
+    #   that this information is intended mostly for introspection and so is
+    #   not expected to cause us problems.
+    normalized_path = normalize_path(dist_path)
+    _uncache(normalized_path, sys.path_importer_cache)
+    if fix_zipimporter_caches:
+        _replace_zip_directory_cache_data(normalized_path)
+    else:
+        # Here, even though we do not want to fix existing and now stale
+        # zipimporter cache information, we still want to remove it. Related to
+        # Python's zip archive directory information cache, we clear each of
+        # its stale entries in two phases:
+        #   1. Clear the entry so attempting to access zip archive information
+        #      via any existing stale zipimport.zipimporter instances fails.
+        #   2. Remove the entry from the cache so any newly constructed
+        #      zipimport.zipimporter instances do not end up using old stale
+        #      zip archive directory information.
+        # This whole stale data removal step does not seem strictly necessary,
+        # but has been left in because it was done before we started replacing
+        # the zip archive directory information cache content if possible, and
+        # there are no relevant unit tests that we can depend on to tell us if
+        # this is really needed.
+        _remove_and_clear_zip_directory_cache_data(normalized_path)
+
+
+def _collect_zipimporter_cache_entries(normalized_path, cache):
+    """
+    Return zipimporter cache entry keys related to a given normalized path.
+
+    Alternative path spellings (e.g. those using different character case or
+    those using alternative path separators) related to the same path are
+    included. Any sub-path entries are included as well, i.e. those
+    corresponding to zip archives embedded in other zip archives.
+
+    """
+    result = []
+    prefix_len = len(normalized_path)
+    for p in cache:
+        np = normalize_path(p)
+        if (np.startswith(normalized_path) and
+                np[prefix_len:prefix_len + 1] in (os.sep, '')):
+            result.append(p)
+    return result
+
+
+def _update_zipimporter_cache(normalized_path, cache, updater=None):
+    """
+    Update zipimporter cache data for a given normalized path.
+
+    Any sub-path entries are processed as well, i.e. those corresponding to zip
+    archives embedded in other zip archives.
+
+    Given updater is a callable taking a cache entry key and the original entry
+    (after already removing the entry from the cache), and expected to update
+    the entry and possibly return a new one to be inserted in its place.
+    Returning None indicates that the entry should not be replaced with a new
+    one. If no updater is given, the cache entries are simply removed without
+    any additional processing, the same as if the updater simply returned None.
+
+    """
+    for p in _collect_zipimporter_cache_entries(normalized_path, cache):
+        # N.B. pypy's custom zipimport._zip_directory_cache implementation does
+        # not support the complete dict interface:
+        # * Does not support item assignment, thus not allowing this function
+        #    to be used only for removing existing cache entries.
+        #  * Does not support the dict.pop() method, forcing us to use the
+        #    get/del patterns instead. For more detailed information see the
+        #    following links:
+        #      https://github.com/pypa/setuptools/issues/202#issuecomment-202913420
+        #      http://bit.ly/2h9itJX
+        old_entry = cache[p]
+        del cache[p]
+        new_entry = updater and updater(p, old_entry)
+        if new_entry is not None:
+            cache[p] = new_entry
+
+
+def _uncache(normalized_path, cache):
+    _update_zipimporter_cache(normalized_path, cache)
+
+
+def _remove_and_clear_zip_directory_cache_data(normalized_path):
+    def clear_and_remove_cached_zip_archive_directory_data(path, old_entry):
+        old_entry.clear()
+
+    _update_zipimporter_cache(
+        normalized_path, zipimport._zip_directory_cache,
+        updater=clear_and_remove_cached_zip_archive_directory_data)
+
+
+# PyPy Python implementation does not allow directly writing to the
+# zipimport._zip_directory_cache and so prevents us from attempting to correct
+# its content. The best we can do there is clear the problematic cache content
+# and have PyPy repopulate it as needed. The downside is that if there are any
+# stale zipimport.zipimporter instances laying around, attempting to use them
+# will fail due to not having its zip archive directory information available
+# instead of being automatically corrected to use the new correct zip archive
+# directory information.
+if '__pypy__' in sys.builtin_module_names:
+    _replace_zip_directory_cache_data = \
+        _remove_and_clear_zip_directory_cache_data
+else:
+
+    def _replace_zip_directory_cache_data(normalized_path):
+        def replace_cached_zip_archive_directory_data(path, old_entry):
+            # N.B. In theory, we could load the zip directory information just
+            # once for all updated path spellings, and then copy it locally and
+            # update its contained path strings to contain the correct
+            # spelling, but that seems like a way too invasive move (this cache
+            # structure is not officially documented anywhere and could in
+            # theory change with new Python releases) for no significant
+            # benefit.
+            old_entry.clear()
+            zipimport.zipimporter(path)
+            old_entry.update(zipimport._zip_directory_cache[path])
+            return old_entry
+
+        _update_zipimporter_cache(
+            normalized_path, zipimport._zip_directory_cache,
+            updater=replace_cached_zip_archive_directory_data)
+
+
+def is_python(text, filename='<string>'):
+    "Is this string a valid Python script?"
+    try:
+        compile(text, filename, 'exec')
+    except (SyntaxError, TypeError):
+        return False
+    else:
+        return True
+
+
+def is_sh(executable):
+    """Determine if the specified executable is a .sh (contains a #! line)"""
+    try:
+        with io.open(executable, encoding='latin-1') as fp:
+            magic = fp.read(2)
+    except (OSError, IOError):
+        return executable
+    return magic == '#!'
+
+
+def nt_quote_arg(arg):
+    """Quote a command line argument according to Windows parsing rules"""
+    return subprocess.list2cmdline([arg])
+
+
+def is_python_script(script_text, filename):
+    """Is this text, as a whole, a Python script? (as opposed to shell/bat/etc.
+    """
+    if filename.endswith('.py') or filename.endswith('.pyw'):
+        return True  # extension says it's Python
+    if is_python(script_text, filename):
+        return True  # it's syntactically valid Python
+    if script_text.startswith('#!'):
+        # It begins with a '#!' line, so check if 'python' is in it somewhere
+        return 'python' in script_text.splitlines()[0].lower()
+
+    return False  # Not any Python I can recognize
+
+
+try:
+    from os import chmod as _chmod
+except ImportError:
+    # Jython compatibility
+    def _chmod(*args):
+        pass
+
+
+def chmod(path, mode):
+    log.debug("changing mode of %s to %o", path, mode)
+    try:
+        _chmod(path, mode)
+    except os.error as e:
+        log.debug("chmod failed: %s", e)
+
+
+class CommandSpec(list):
+    """
+    A command spec for a #! header, specified as a list of arguments akin to
+    those passed to Popen.
+    """
+
+    options = []
+    split_args = dict()
+
+    @classmethod
+    def best(cls):
+        """
+        Choose the best CommandSpec class based on environmental conditions.
+        """
+        return cls
+
+    @classmethod
+    def _sys_executable(cls):
+        _default = os.path.normpath(sys.executable)
+        return os.environ.get('__PYVENV_LAUNCHER__', _default)
+
+    @classmethod
+    def from_param(cls, param):
+        """
+        Construct a CommandSpec from a parameter to build_scripts, which may
+        be None.
+        """
+        if isinstance(param, cls):
+            return param
+        if isinstance(param, list):
+            return cls(param)
+        if param is None:
+            return cls.from_environment()
+        # otherwise, assume it's a string.
+        return cls.from_string(param)
+
+    @classmethod
+    def from_environment(cls):
+        return cls([cls._sys_executable()])
+
+    @classmethod
+    def from_string(cls, string):
+        """
+        Construct a command spec from a simple string representing a command
+        line parseable by shlex.split.
+        """
+        items = shlex.split(string, **cls.split_args)
+        return cls(items)
+
+    def install_options(self, script_text):
+        self.options = shlex.split(self._extract_options(script_text))
+        cmdline = subprocess.list2cmdline(self)
+        if not isascii(cmdline):
+            self.options[:0] = ['-x']
+
+    @staticmethod
+    def _extract_options(orig_script):
+        """
+        Extract any options from the first line of the script.
+        """
+        first = (orig_script + '\n').splitlines()[0]
+        match = _first_line_re().match(first)
+        options = match.group(1) or '' if match else ''
+        return options.strip()
+
+    def as_header(self):
+        return self._render(self + list(self.options))
+
+    @staticmethod
+    def _strip_quotes(item):
+        _QUOTES = '"\''
+        for q in _QUOTES:
+            if item.startswith(q) and item.endswith(q):
+                return item[1:-1]
+        return item
+
+    @staticmethod
+    def _render(items):
+        cmdline = subprocess.list2cmdline(
+            CommandSpec._strip_quotes(item.strip()) for item in items)
+        return '#!' + cmdline + '\n'
+
+
+# For pbr compat; will be removed in a future version.
+sys_executable = CommandSpec._sys_executable()
+
+
+class WindowsCommandSpec(CommandSpec):
+    split_args = dict(posix=False)
+
+
+class ScriptWriter:
+    """
+    Encapsulates behavior around writing entry point scripts for console and
+    gui apps.
+    """
+
+    template = textwrap.dedent(r"""
+        # EASY-INSTALL-ENTRY-SCRIPT: %(spec)r,%(group)r,%(name)r
+        import re
+        import sys
+
+        # for compatibility with easy_install; see #2198
+        __requires__ = %(spec)r
+
+        try:
+            from importlib.metadata import distribution
+        except ImportError:
+            try:
+                from importlib_metadata import distribution
+            except ImportError:
+                from pkg_resources import load_entry_point
+
+
+        def importlib_load_entry_point(spec, group, name):
+            dist_name, _, _ = spec.partition('==')
+            matches = (
+                entry_point
+                for entry_point in distribution(dist_name).entry_points
+                if entry_point.group == group and entry_point.name == name
+            )
+            return next(matches).load()
+
+
+        globals().setdefault('load_entry_point', importlib_load_entry_point)
+
+
+        if __name__ == '__main__':
+            sys.argv[0] = re.sub(r'(-script\.pyw?|\.exe)?$', '', sys.argv[0])
+            sys.exit(load_entry_point(%(spec)r, %(group)r, %(name)r)())
+        """).lstrip()
+
+    command_spec_class = CommandSpec
+
+    @classmethod
+    def get_script_args(cls, dist, executable=None, wininst=False):
+        # for backward compatibility
+        warnings.warn("Use get_args", EasyInstallDeprecationWarning)
+        writer = (WindowsScriptWriter if wininst else ScriptWriter).best()
+        header = cls.get_script_header("", executable, wininst)
+        return writer.get_args(dist, header)
+
+    @classmethod
+    def get_script_header(cls, script_text, executable=None, wininst=False):
+        # for backward compatibility
+        warnings.warn(
+            "Use get_header", EasyInstallDeprecationWarning, stacklevel=2)
+        if wininst:
+            executable = "python.exe"
+        return cls.get_header(script_text, executable)
+
+    @classmethod
+    def get_args(cls, dist, header=None):
+        """
+        Yield write_script() argument tuples for a distribution's
+        console_scripts and gui_scripts entry points.
+        """
+        if header is None:
+            header = cls.get_header()
+        spec = str(dist.as_requirement())
+        for type_ in 'console', 'gui':
+            group = type_ + '_scripts'
+            for name, ep in dist.get_entry_map(group).items():
+                cls._ensure_safe_name(name)
+                script_text = cls.template % locals()
+                args = cls._get_script_args(type_, name, header, script_text)
+                for res in args:
+                    yield res
+
+    @staticmethod
+    def _ensure_safe_name(name):
+        """
+        Prevent paths in *_scripts entry point names.
+        """
+        has_path_sep = re.search(r'[\\/]', name)
+        if has_path_sep:
+            raise ValueError("Path separators not allowed in script names")
+
+    @classmethod
+    def get_writer(cls, force_windows):
+        # for backward compatibility
+        warnings.warn("Use best", EasyInstallDeprecationWarning)
+        return WindowsScriptWriter.best() if force_windows else cls.best()
+
+    @classmethod
+    def best(cls):
+        """
+        Select the best ScriptWriter for this environment.
+        """
+        if sys.platform == 'win32' or (os.name == 'java' and os._name == 'nt'):
+            return WindowsScriptWriter.best()
+        else:
+            return cls
+
+    @classmethod
+    def _get_script_args(cls, type_, name, header, script_text):
+        # Simply write the stub with no extension.
+        yield (name, header + script_text)
+
+    @classmethod
+    def get_header(cls, script_text="", executable=None):
+        """Create a #! line, getting options (if any) from script_text"""
+        cmd = cls.command_spec_class.best().from_param(executable)
+        cmd.install_options(script_text)
+        return cmd.as_header()
+
+
+class WindowsScriptWriter(ScriptWriter):
+    command_spec_class = WindowsCommandSpec
+
+    @classmethod
+    def get_writer(cls):
+        # for backward compatibility
+        warnings.warn("Use best", EasyInstallDeprecationWarning)
+        return cls.best()
+
+    @classmethod
+    def best(cls):
+        """
+        Select the best ScriptWriter suitable for Windows
+        """
+        writer_lookup = dict(
+            executable=WindowsExecutableLauncherWriter,
+            natural=cls,
+        )
+        # for compatibility, use the executable launcher by default
+        launcher = os.environ.get('SETUPTOOLS_LAUNCHER', 'executable')
+        return writer_lookup[launcher]
+
+    @classmethod
+    def _get_script_args(cls, type_, name, header, script_text):
+        "For Windows, add a .py extension"
+        ext = dict(console='.pya', gui='.pyw')[type_]
+        if ext not in os.environ['PATHEXT'].lower().split(';'):
+            msg = (
+                "{ext} not listed in PATHEXT; scripts will not be "
+                "recognized as executables."
+            ).format(**locals())
+            warnings.warn(msg, UserWarning)
+        old = ['.pya', '.py', '-script.py', '.pyc', '.pyo', '.pyw', '.exe']
+        old.remove(ext)
+        header = cls._adjust_header(type_, header)
+        blockers = [name + x for x in old]
+        yield name + ext, header + script_text, 't', blockers
+
+    @classmethod
+    def _adjust_header(cls, type_, orig_header):
+        """
+        Make sure 'pythonw' is used for gui and and 'python' is used for
+        console (regardless of what sys.executable is).
+        """
+        pattern = 'pythonw.exe'
+        repl = 'python.exe'
+        if type_ == 'gui':
+            pattern, repl = repl, pattern
+        pattern_ob = re.compile(re.escape(pattern), re.IGNORECASE)
+        new_header = pattern_ob.sub(string=orig_header, repl=repl)
+        return new_header if cls._use_header(new_header) else orig_header
+
+    @staticmethod
+    def _use_header(new_header):
+        """
+        Should _adjust_header use the replaced header?
+
+        On non-windows systems, always use. On
+        Windows systems, only use the replaced header if it resolves
+        to an executable on the system.
+        """
+        clean_header = new_header[2:-1].strip('"')
+        return sys.platform != 'win32' or find_executable(clean_header)
+
+
+class WindowsExecutableLauncherWriter(WindowsScriptWriter):
+    @classmethod
+    def _get_script_args(cls, type_, name, header, script_text):
+        """
+        For Windows, add a .py extension and an .exe launcher
+        """
+        if type_ == 'gui':
+            launcher_type = 'gui'
+            ext = '-script.pyw'
+            old = ['.pyw']
+        else:
+            launcher_type = 'cli'
+            ext = '-script.py'
+            old = ['.py', '.pyc', '.pyo']
+        hdr = cls._adjust_header(type_, header)
+        blockers = [name + x for x in old]
+        yield (name + ext, hdr + script_text, 't', blockers)
+        yield (
+            name + '.exe', get_win_launcher(launcher_type),
+            'b'  # write in binary mode
+        )
+        if not is_64bit():
+            # install a manifest for the launcher to prevent Windows
+            # from detecting it as an installer (which it will for
+            #  launchers like easy_install.exe). Consider only
+            #  adding a manifest for launchers detected as installers.
+            #  See Distribute #143 for details.
+            m_name = name + '.exe.manifest'
+            yield (m_name, load_launcher_manifest(name), 't')
+
+
+# for backward-compatibility
+get_script_args = ScriptWriter.get_script_args
+get_script_header = ScriptWriter.get_script_header
+
+
+def get_win_launcher(type):
+    """
+    Load the Windows launcher (executable) suitable for launching a script.
+
+    `type` should be either 'cli' or 'gui'
+
+    Returns the executable as a byte string.
+    """
+    launcher_fn = '%s.exe' % type
+    if is_64bit():
+        launcher_fn = launcher_fn.replace(".", "-64.")
+    else:
+        launcher_fn = launcher_fn.replace(".", "-32.")
+    return resource_string('setuptools', launcher_fn)
+
+
+def load_launcher_manifest(name):
+    manifest = pkg_resources.resource_string(__name__, 'launcher manifest.xml')
+    return manifest.decode('utf-8') % vars()
+
+
+def rmtree(path, ignore_errors=False, onerror=auto_chmod):
+    return shutil.rmtree(path, ignore_errors, onerror)
+
+
+def current_umask():
+    tmp = os.umask(0o022)
+    os.umask(tmp)
+    return tmp
+
+
+def bootstrap():
+    # This function is called when setuptools*.egg is run using /bin/sh
+    import setuptools
+
+    argv0 = os.path.dirname(setuptools.__path__[0])
+    sys.argv[0] = argv0
+    sys.argv.append(argv0)
+    main()
+
+
+def main(argv=None, **kw):
+    from setuptools import setup
+    from setuptools.dist import Distribution
+
+    class DistributionWithoutHelpCommands(Distribution):
+        common_usage = ""
+
+        def _show_help(self, *args, **kw):
+            with _patch_usage():
+                Distribution._show_help(self, *args, **kw)
+
+    if argv is None:
+        argv = sys.argv[1:]
+
+    with _patch_usage():
+        setup(
+            script_args=['-q', 'easy_install', '-v'] + argv,
+            script_name=sys.argv[0] or 'easy_install',
+            distclass=DistributionWithoutHelpCommands,
+            **kw
+        )
+
+
+@contextlib.contextmanager
+def _patch_usage():
+    import distutils.core
+    USAGE = textwrap.dedent("""
+        usage: %(script)s [options] requirement_or_url ...
+           or: %(script)s --help
+        """).lstrip()
+
+    def gen_usage(script_name):
+        return USAGE % dict(
+            script=os.path.basename(script_name),
+        )
+
+    saved = distutils.core.gen_usage
+    distutils.core.gen_usage = gen_usage
+    try:
+        yield
+    finally:
+        distutils.core.gen_usage = saved
+
+
+class EasyInstallDeprecationWarning(SetuptoolsDeprecationWarning):
+    """
+    Warning for EasyInstall deprecations, bypassing suppression.
+    """
diff --git a/venv/Lib/site-packages/setuptools/command/egg_info.py b/venv/Lib/site-packages/setuptools/command/egg_info.py
new file mode 100644
index 000000000..c957154a1
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/egg_info.py
@@ -0,0 +1,717 @@
+"""setuptools.command.egg_info
+
+Create a distribution's .egg-info directory and contents"""
+
+from distutils.filelist import FileList as _FileList
+from distutils.errors import DistutilsInternalError
+from distutils.util import convert_path
+from distutils import log
+import distutils.errors
+import distutils.filelist
+import os
+import re
+import sys
+import io
+import warnings
+import time
+import collections
+
+from setuptools import Command
+from setuptools.command.sdist import sdist
+from setuptools.command.sdist import walk_revctrl
+from setuptools.command.setopt import edit_config
+from setuptools.command import bdist_egg
+from pkg_resources import (
+    parse_requirements, safe_name, parse_version,
+    safe_version, yield_lines, EntryPoint, iter_entry_points, to_filename)
+import setuptools.unicode_utils as unicode_utils
+from setuptools.glob import glob
+
+from setuptools.extern import packaging
+from setuptools import SetuptoolsDeprecationWarning
+
+
+def translate_pattern(glob):
+    """
+    Translate a file path glob like '*.txt' in to a regular expression.
+    This differs from fnmatch.translate which allows wildcards to match
+    directory separators. It also knows about '**/' which matches any number of
+    directories.
+    """
+    pat = ''
+
+    # This will split on '/' within [character classes]. This is deliberate.
+    chunks = glob.split(os.path.sep)
+
+    sep = re.escape(os.sep)
+    valid_char = '[^%s]' % (sep,)
+
+    for c, chunk in enumerate(chunks):
+        last_chunk = c == len(chunks) - 1
+
+        # Chunks that are a literal ** are globstars. They match anything.
+        if chunk == '**':
+            if last_chunk:
+                # Match anything if this is the last component
+                pat += '.*'
+            else:
+                # Match '(name/)*'
+                pat += '(?:%s+%s)*' % (valid_char, sep)
+            continue  # Break here as the whole path component has been handled
+
+        # Find any special characters in the remainder
+        i = 0
+        chunk_len = len(chunk)
+        while i < chunk_len:
+            char = chunk[i]
+            if char == '*':
+                # Match any number of name characters
+                pat += valid_char + '*'
+            elif char == '?':
+                # Match a name character
+                pat += valid_char
+            elif char == '[':
+                # Character class
+                inner_i = i + 1
+                # Skip initial !/] chars
+                if inner_i < chunk_len and chunk[inner_i] == '!':
+                    inner_i = inner_i + 1
+                if inner_i < chunk_len and chunk[inner_i] == ']':
+                    inner_i = inner_i + 1
+
+                # Loop till the closing ] is found
+                while inner_i < chunk_len and chunk[inner_i] != ']':
+                    inner_i = inner_i + 1
+
+                if inner_i >= chunk_len:
+                    # Got to the end of the string without finding a closing ]
+                    # Do not treat this as a matching group, but as a literal [
+                    pat += re.escape(char)
+                else:
+                    # Grab the insides of the [brackets]
+                    inner = chunk[i + 1:inner_i]
+                    char_class = ''
+
+                    # Class negation
+                    if inner[0] == '!':
+                        char_class = '^'
+                        inner = inner[1:]
+
+                    char_class += re.escape(inner)
+                    pat += '[%s]' % (char_class,)
+
+                    # Skip to the end ]
+                    i = inner_i
+            else:
+                pat += re.escape(char)
+            i += 1
+
+        # Join each chunk with the dir separator
+        if not last_chunk:
+            pat += sep
+
+    pat += r'\Z'
+    return re.compile(pat, flags=re.MULTILINE | re.DOTALL)
+
+
+class InfoCommon:
+    tag_build = None
+    tag_date = None
+
+    @property
+    def name(self):
+        return safe_name(self.distribution.get_name())
+
+    def tagged_version(self):
+        version = self.distribution.get_version()
+        # egg_info may be called more than once for a distribution,
+        # in which case the version string already contains all tags.
+        if self.vtags and version.endswith(self.vtags):
+            return safe_version(version)
+        return safe_version(version + self.vtags)
+
+    def tags(self):
+        version = ''
+        if self.tag_build:
+            version += self.tag_build
+        if self.tag_date:
+            version += time.strftime("-%Y%m%d")
+        return version
+    vtags = property(tags)
+
+
+class egg_info(InfoCommon, Command):
+    description = "create a distribution's .egg-info directory"
+
+    user_options = [
+        ('egg-base=', 'e', "directory containing .egg-info directories"
+                           " (default: top of the source tree)"),
+        ('tag-date', 'd', "Add date stamp (e.g. 20050528) to version number"),
+        ('tag-build=', 'b', "Specify explicit tag to add to version number"),
+        ('no-date', 'D', "Don't include date stamp [default]"),
+    ]
+
+    boolean_options = ['tag-date']
+    negative_opt = {
+        'no-date': 'tag-date',
+    }
+
+    def initialize_options(self):
+        self.egg_base = None
+        self.egg_name = None
+        self.egg_info = None
+        self.egg_version = None
+        self.broken_egg_info = False
+
+    ####################################
+    # allow the 'tag_svn_revision' to be detected and
+    # set, supporting sdists built on older Setuptools.
+    @property
+    def tag_svn_revision(self):
+        pass
+
+    @tag_svn_revision.setter
+    def tag_svn_revision(self, value):
+        pass
+    ####################################
+
+    def save_version_info(self, filename):
+        """
+        Materialize the value of date into the
+        build tag. Install build keys in a deterministic order
+        to avoid arbitrary reordering on subsequent builds.
+        """
+        egg_info = collections.OrderedDict()
+        # follow the order these keys would have been added
+        # when PYTHONHASHSEED=0
+        egg_info['tag_build'] = self.tags()
+        egg_info['tag_date'] = 0
+        edit_config(filename, dict(egg_info=egg_info))
+
+    def finalize_options(self):
+        # Note: we need to capture the current value returned
+        # by `self.tagged_version()`, so we can later update
+        # `self.distribution.metadata.version` without
+        # repercussions.
+        self.egg_name = self.name
+        self.egg_version = self.tagged_version()
+        parsed_version = parse_version(self.egg_version)
+
+        try:
+            is_version = isinstance(parsed_version, packaging.version.Version)
+            spec = (
+                "%s==%s" if is_version else "%s===%s"
+            )
+            list(
+                parse_requirements(spec % (self.egg_name, self.egg_version))
+            )
+        except ValueError as e:
+            raise distutils.errors.DistutilsOptionError(
+                "Invalid distribution name or version syntax: %s-%s" %
+                (self.egg_name, self.egg_version)
+            ) from e
+
+        if self.egg_base is None:
+            dirs = self.distribution.package_dir
+            self.egg_base = (dirs or {}).get('', os.curdir)
+
+        self.ensure_dirname('egg_base')
+        self.egg_info = to_filename(self.egg_name) + '.egg-info'
+        if self.egg_base != os.curdir:
+            self.egg_info = os.path.join(self.egg_base, self.egg_info)
+        if '-' in self.egg_name:
+            self.check_broken_egg_info()
+
+        # Set package version for the benefit of dumber commands
+        # (e.g. sdist, bdist_wininst, etc.)
+        #
+        self.distribution.metadata.version = self.egg_version
+
+        # If we bootstrapped around the lack of a PKG-INFO, as might be the
+        # case in a fresh checkout, make sure that any special tags get added
+        # to the version info
+        #
+        pd = self.distribution._patched_dist
+        if pd is not None and pd.key == self.egg_name.lower():
+            pd._version = self.egg_version
+            pd._parsed_version = parse_version(self.egg_version)
+            self.distribution._patched_dist = None
+
+    def write_or_delete_file(self, what, filename, data, force=False):
+        """Write `data` to `filename` or delete if empty
+
+        If `data` is non-empty, this routine is the same as ``write_file()``.
+        If `data` is empty but not ``None``, this is the same as calling
+        ``delete_file(filename)`.  If `data` is ``None``, then this is a no-op
+        unless `filename` exists, in which case a warning is issued about the
+        orphaned file (if `force` is false), or deleted (if `force` is true).
+        """
+        if data:
+            self.write_file(what, filename, data)
+        elif os.path.exists(filename):
+            if data is None and not force:
+                log.warn(
+                    "%s not set in setup(), but %s exists", what, filename
+                )
+                return
+            else:
+                self.delete_file(filename)
+
+    def write_file(self, what, filename, data):
+        """Write `data` to `filename` (if not a dry run) after announcing it
+
+        `what` is used in a log message to identify what is being written
+        to the file.
+        """
+        log.info("writing %s to %s", what, filename)
+        data = data.encode("utf-8")
+        if not self.dry_run:
+            f = open(filename, 'wb')
+            f.write(data)
+            f.close()
+
+    def delete_file(self, filename):
+        """Delete `filename` (if not a dry run) after announcing it"""
+        log.info("deleting %s", filename)
+        if not self.dry_run:
+            os.unlink(filename)
+
+    def run(self):
+        self.mkpath(self.egg_info)
+        os.utime(self.egg_info, None)
+        installer = self.distribution.fetch_build_egg
+        for ep in iter_entry_points('egg_info.writers'):
+            ep.require(installer=installer)
+            writer = ep.resolve()
+            writer(self, ep.name, os.path.join(self.egg_info, ep.name))
+
+        # Get rid of native_libs.txt if it was put there by older bdist_egg
+        nl = os.path.join(self.egg_info, "native_libs.txt")
+        if os.path.exists(nl):
+            self.delete_file(nl)
+
+        self.find_sources()
+
+    def find_sources(self):
+        """Generate SOURCES.txt manifest file"""
+        manifest_filename = os.path.join(self.egg_info, "SOURCES.txt")
+        mm = manifest_maker(self.distribution)
+        mm.manifest = manifest_filename
+        mm.run()
+        self.filelist = mm.filelist
+
+    def check_broken_egg_info(self):
+        bei = self.egg_name + '.egg-info'
+        if self.egg_base != os.curdir:
+            bei = os.path.join(self.egg_base, bei)
+        if os.path.exists(bei):
+            log.warn(
+                "-" * 78 + '\n'
+                "Note: Your current .egg-info directory has a '-' in its name;"
+                '\nthis will not work correctly with "setup.py develop".\n\n'
+                'Please rename %s to %s to correct this problem.\n' + '-' * 78,
+                bei, self.egg_info
+            )
+            self.broken_egg_info = self.egg_info
+            self.egg_info = bei  # make it work for now
+
+
+class FileList(_FileList):
+    # Implementations of the various MANIFEST.in commands
+
+    def process_template_line(self, line):
+        # Parse the line: split it up, make sure the right number of words
+        # is there, and return the relevant words.  'action' is always
+        # defined: it's the first word of the line.  Which of the other
+        # three are defined depends on the action; it'll be either
+        # patterns, (dir and patterns), or (dir_pattern).
+        (action, patterns, dir, dir_pattern) = self._parse_template_line(line)
+
+        # OK, now we know that the action is valid and we have the
+        # right number of words on the line for that action -- so we
+        # can proceed with minimal error-checking.
+        if action == 'include':
+            self.debug_print("include " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.include(pattern):
+                    log.warn("warning: no files found matching '%s'", pattern)
+
+        elif action == 'exclude':
+            self.debug_print("exclude " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.exclude(pattern):
+                    log.warn(("warning: no previously-included files "
+                              "found matching '%s'"), pattern)
+
+        elif action == 'global-include':
+            self.debug_print("global-include " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.global_include(pattern):
+                    log.warn(("warning: no files found matching '%s' "
+                              "anywhere in distribution"), pattern)
+
+        elif action == 'global-exclude':
+            self.debug_print("global-exclude " + ' '.join(patterns))
+            for pattern in patterns:
+                if not self.global_exclude(pattern):
+                    log.warn(("warning: no previously-included files matching "
+                              "'%s' found anywhere in distribution"),
+                             pattern)
+
+        elif action == 'recursive-include':
+            self.debug_print("recursive-include %s %s" %
+                             (dir, ' '.join(patterns)))
+            for pattern in patterns:
+                if not self.recursive_include(dir, pattern):
+                    log.warn(("warning: no files found matching '%s' "
+                              "under directory '%s'"),
+                             pattern, dir)
+
+        elif action == 'recursive-exclude':
+            self.debug_print("recursive-exclude %s %s" %
+                             (dir, ' '.join(patterns)))
+            for pattern in patterns:
+                if not self.recursive_exclude(dir, pattern):
+                    log.warn(("warning: no previously-included files matching "
+                              "'%s' found under directory '%s'"),
+                             pattern, dir)
+
+        elif action == 'graft':
+            self.debug_print("graft " + dir_pattern)
+            if not self.graft(dir_pattern):
+                log.warn("warning: no directories found matching '%s'",
+                         dir_pattern)
+
+        elif action == 'prune':
+            self.debug_print("prune " + dir_pattern)
+            if not self.prune(dir_pattern):
+                log.warn(("no previously-included directories found "
+                          "matching '%s'"), dir_pattern)
+
+        else:
+            raise DistutilsInternalError(
+                "this cannot happen: invalid action '%s'" % action)
+
+    def _remove_files(self, predicate):
+        """
+        Remove all files from the file list that match the predicate.
+        Return True if any matching files were removed
+        """
+        found = False
+        for i in range(len(self.files) - 1, -1, -1):
+            if predicate(self.files[i]):
+                self.debug_print(" removing " + self.files[i])
+                del self.files[i]
+                found = True
+        return found
+
+    def include(self, pattern):
+        """Include files that match 'pattern'."""
+        found = [f for f in glob(pattern) if not os.path.isdir(f)]
+        self.extend(found)
+        return bool(found)
+
+    def exclude(self, pattern):
+        """Exclude files that match 'pattern'."""
+        match = translate_pattern(pattern)
+        return self._remove_files(match.match)
+
+    def recursive_include(self, dir, pattern):
+        """
+        Include all files anywhere in 'dir/' that match the pattern.
+        """
+        full_pattern = os.path.join(dir, '**', pattern)
+        found = [f for f in glob(full_pattern, recursive=True)
+                 if not os.path.isdir(f)]
+        self.extend(found)
+        return bool(found)
+
+    def recursive_exclude(self, dir, pattern):
+        """
+        Exclude any file anywhere in 'dir/' that match the pattern.
+        """
+        match = translate_pattern(os.path.join(dir, '**', pattern))
+        return self._remove_files(match.match)
+
+    def graft(self, dir):
+        """Include all files from 'dir/'."""
+        found = [
+            item
+            for match_dir in glob(dir)
+            for item in distutils.filelist.findall(match_dir)
+        ]
+        self.extend(found)
+        return bool(found)
+
+    def prune(self, dir):
+        """Filter out files from 'dir/'."""
+        match = translate_pattern(os.path.join(dir, '**'))
+        return self._remove_files(match.match)
+
+    def global_include(self, pattern):
+        """
+        Include all files anywhere in the current directory that match the
+        pattern. This is very inefficient on large file trees.
+        """
+        if self.allfiles is None:
+            self.findall()
+        match = translate_pattern(os.path.join('**', pattern))
+        found = [f for f in self.allfiles if match.match(f)]
+        self.extend(found)
+        return bool(found)
+
+    def global_exclude(self, pattern):
+        """
+        Exclude all files anywhere that match the pattern.
+        """
+        match = translate_pattern(os.path.join('**', pattern))
+        return self._remove_files(match.match)
+
+    def append(self, item):
+        if item.endswith('\r'):  # Fix older sdists built on Windows
+            item = item[:-1]
+        path = convert_path(item)
+
+        if self._safe_path(path):
+            self.files.append(path)
+
+    def extend(self, paths):
+        self.files.extend(filter(self._safe_path, paths))
+
+    def _repair(self):
+        """
+        Replace self.files with only safe paths
+
+        Because some owners of FileList manipulate the underlying
+        ``files`` attribute directly, this method must be called to
+        repair those paths.
+        """
+        self.files = list(filter(self._safe_path, self.files))
+
+    def _safe_path(self, path):
+        enc_warn = "'%s' not %s encodable -- skipping"
+
+        # To avoid accidental trans-codings errors, first to unicode
+        u_path = unicode_utils.filesys_decode(path)
+        if u_path is None:
+            log.warn("'%s' in unexpected encoding -- skipping" % path)
+            return False
+
+        # Must ensure utf-8 encodability
+        utf8_path = unicode_utils.try_encode(u_path, "utf-8")
+        if utf8_path is None:
+            log.warn(enc_warn, path, 'utf-8')
+            return False
+
+        try:
+            # accept is either way checks out
+            if os.path.exists(u_path) or os.path.exists(utf8_path):
+                return True
+        # this will catch any encode errors decoding u_path
+        except UnicodeEncodeError:
+            log.warn(enc_warn, path, sys.getfilesystemencoding())
+
+
+class manifest_maker(sdist):
+    template = "MANIFEST.in"
+
+    def initialize_options(self):
+        self.use_defaults = 1
+        self.prune = 1
+        self.manifest_only = 1
+        self.force_manifest = 1
+
+    def finalize_options(self):
+        pass
+
+    def run(self):
+        self.filelist = FileList()
+        if not os.path.exists(self.manifest):
+            self.write_manifest()  # it must exist so it'll get in the list
+        self.add_defaults()
+        if os.path.exists(self.template):
+            self.read_template()
+        self.prune_file_list()
+        self.filelist.sort()
+        self.filelist.remove_duplicates()
+        self.write_manifest()
+
+    def _manifest_normalize(self, path):
+        path = unicode_utils.filesys_decode(path)
+        return path.replace(os.sep, '/')
+
+    def write_manifest(self):
+        """
+        Write the file list in 'self.filelist' to the manifest file
+        named by 'self.manifest'.
+        """
+        self.filelist._repair()
+
+        # Now _repairs should encodability, but not unicode
+        files = [self._manifest_normalize(f) for f in self.filelist.files]
+        msg = "writing manifest file '%s'" % self.manifest
+        self.execute(write_file, (self.manifest, files), msg)
+
+    def warn(self, msg):
+        if not self._should_suppress_warning(msg):
+            sdist.warn(self, msg)
+
+    @staticmethod
+    def _should_suppress_warning(msg):
+        """
+        suppress missing-file warnings from sdist
+        """
+        return re.match(r"standard file .*not found", msg)
+
+    def add_defaults(self):
+        sdist.add_defaults(self)
+        self.check_license()
+        self.filelist.append(self.template)
+        self.filelist.append(self.manifest)
+        rcfiles = list(walk_revctrl())
+        if rcfiles:
+            self.filelist.extend(rcfiles)
+        elif os.path.exists(self.manifest):
+            self.read_manifest()
+
+        if os.path.exists("setup.py"):
+            # setup.py should be included by default, even if it's not
+            # the script called to create the sdist
+            self.filelist.append("setup.py")
+
+        ei_cmd = self.get_finalized_command('egg_info')
+        self.filelist.graft(ei_cmd.egg_info)
+
+    def prune_file_list(self):
+        build = self.get_finalized_command('build')
+        base_dir = self.distribution.get_fullname()
+        self.filelist.prune(build.build_base)
+        self.filelist.prune(base_dir)
+        sep = re.escape(os.sep)
+        self.filelist.exclude_pattern(r'(^|' + sep + r')(RCS|CVS|\.svn)' + sep,
+                                      is_regex=1)
+
+
+def write_file(filename, contents):
+    """Create a file with the specified name and write 'contents' (a
+    sequence of strings without line terminators) to it.
+    """
+    contents = "\n".join(contents)
+
+    # assuming the contents has been vetted for utf-8 encoding
+    contents = contents.encode("utf-8")
+
+    with open(filename, "wb") as f:  # always write POSIX-style manifest
+        f.write(contents)
+
+
+def write_pkg_info(cmd, basename, filename):
+    log.info("writing %s", filename)
+    if not cmd.dry_run:
+        metadata = cmd.distribution.metadata
+        metadata.version, oldver = cmd.egg_version, metadata.version
+        metadata.name, oldname = cmd.egg_name, metadata.name
+
+        try:
+            # write unescaped data to PKG-INFO, so older pkg_resources
+            # can still parse it
+            metadata.write_pkg_info(cmd.egg_info)
+        finally:
+            metadata.name, metadata.version = oldname, oldver
+
+        safe = getattr(cmd.distribution, 'zip_safe', None)
+
+        bdist_egg.write_safety_flag(cmd.egg_info, safe)
+
+
+def warn_depends_obsolete(cmd, basename, filename):
+    if os.path.exists(filename):
+        log.warn(
+            "WARNING: 'depends.txt' is not used by setuptools 0.6!\n"
+            "Use the install_requires/extras_require setup() args instead."
+        )
+
+
+def _write_requirements(stream, reqs):
+    lines = yield_lines(reqs or ())
+
+    def append_cr(line):
+        return line + '\n'
+    lines = map(append_cr, lines)
+    stream.writelines(lines)
+
+
+def write_requirements(cmd, basename, filename):
+    dist = cmd.distribution
+    data = io.StringIO()
+    _write_requirements(data, dist.install_requires)
+    extras_require = dist.extras_require or {}
+    for extra in sorted(extras_require):
+        data.write('\n[{extra}]\n'.format(**vars()))
+        _write_requirements(data, extras_require[extra])
+    cmd.write_or_delete_file("requirements", filename, data.getvalue())
+
+
+def write_setup_requirements(cmd, basename, filename):
+    data = io.StringIO()
+    _write_requirements(data, cmd.distribution.setup_requires)
+    cmd.write_or_delete_file("setup-requirements", filename, data.getvalue())
+
+
+def write_toplevel_names(cmd, basename, filename):
+    pkgs = dict.fromkeys(
+        [
+            k.split('.', 1)[0]
+            for k in cmd.distribution.iter_distribution_names()
+        ]
+    )
+    cmd.write_file("top-level names", filename, '\n'.join(sorted(pkgs)) + '\n')
+
+
+def overwrite_arg(cmd, basename, filename):
+    write_arg(cmd, basename, filename, True)
+
+
+def write_arg(cmd, basename, filename, force=False):
+    argname = os.path.splitext(basename)[0]
+    value = getattr(cmd.distribution, argname, None)
+    if value is not None:
+        value = '\n'.join(value) + '\n'
+    cmd.write_or_delete_file(argname, filename, value, force)
+
+
+def write_entries(cmd, basename, filename):
+    ep = cmd.distribution.entry_points
+
+    if isinstance(ep, str) or ep is None:
+        data = ep
+    elif ep is not None:
+        data = []
+        for section, contents in sorted(ep.items()):
+            if not isinstance(contents, str):
+                contents = EntryPoint.parse_group(section, contents)
+                contents = '\n'.join(sorted(map(str, contents.values())))
+            data.append('[%s]\n%s\n\n' % (section, contents))
+        data = ''.join(data)
+
+    cmd.write_or_delete_file('entry points', filename, data, True)
+
+
+def get_pkg_info_revision():
+    """
+    Get a -r### off of PKG-INFO Version in case this is an sdist of
+    a subversion revision.
+    """
+    warnings.warn(
+        "get_pkg_info_revision is deprecated.", EggInfoDeprecationWarning)
+    if os.path.exists('PKG-INFO'):
+        with io.open('PKG-INFO') as f:
+            for line in f:
+                match = re.match(r"Version:.*-r(\d+)\s*$", line)
+                if match:
+                    return int(match.group(1))
+    return 0
+
+
+class EggInfoDeprecationWarning(SetuptoolsDeprecationWarning):
+    """Deprecated behavior warning for EggInfo, bypassing suppression."""
diff --git a/venv/Lib/site-packages/setuptools/command/install.py b/venv/Lib/site-packages/setuptools/command/install.py
new file mode 100644
index 000000000..72b9a3e42
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/install.py
@@ -0,0 +1,125 @@
+from distutils.errors import DistutilsArgError
+import inspect
+import glob
+import warnings
+import platform
+import distutils.command.install as orig
+
+import setuptools
+
+# Prior to numpy 1.9, NumPy relies on the '_install' name, so provide it for
+# now. See https://github.com/pypa/setuptools/issues/199/
+_install = orig.install
+
+
+class install(orig.install):
+    """Use easy_install to install the package, w/dependencies"""
+
+    user_options = orig.install.user_options + [
+        ('old-and-unmanageable', None, "Try not to use this!"),
+        ('single-version-externally-managed', None,
+         "used by system package builders to create 'flat' eggs"),
+    ]
+    boolean_options = orig.install.boolean_options + [
+        'old-and-unmanageable', 'single-version-externally-managed',
+    ]
+    new_commands = [
+        ('install_egg_info', lambda self: True),
+        ('install_scripts', lambda self: True),
+    ]
+    _nc = dict(new_commands)
+
+    def initialize_options(self):
+        orig.install.initialize_options(self)
+        self.old_and_unmanageable = None
+        self.single_version_externally_managed = None
+
+    def finalize_options(self):
+        orig.install.finalize_options(self)
+        if self.root:
+            self.single_version_externally_managed = True
+        elif self.single_version_externally_managed:
+            if not self.root and not self.record:
+                raise DistutilsArgError(
+                    "You must specify --record or --root when building system"
+                    " packages"
+                )
+
+    def handle_extra_path(self):
+        if self.root or self.single_version_externally_managed:
+            # explicit backward-compatibility mode, allow extra_path to work
+            return orig.install.handle_extra_path(self)
+
+        # Ignore extra_path when installing an egg (or being run by another
+        # command without --root or --single-version-externally-managed
+        self.path_file = None
+        self.extra_dirs = ''
+
+    def run(self):
+        # Explicit request for old-style install?  Just do it
+        if self.old_and_unmanageable or self.single_version_externally_managed:
+            return orig.install.run(self)
+
+        if not self._called_from_setup(inspect.currentframe()):
+            # Run in backward-compatibility mode to support bdist_* commands.
+            orig.install.run(self)
+        else:
+            self.do_egg_install()
+
+    @staticmethod
+    def _called_from_setup(run_frame):
+        """
+        Attempt to detect whether run() was called from setup() or by another
+        command.  If called by setup(), the parent caller will be the
+        'run_command' method in 'distutils.dist', and *its* caller will be
+        the 'run_commands' method.  If called any other way, the
+        immediate caller *might* be 'run_command', but it won't have been
+        called by 'run_commands'. Return True in that case or if a call stack
+        is unavailable. Return False otherwise.
+        """
+        if run_frame is None:
+            msg = "Call stack not available. bdist_* commands may fail."
+            warnings.warn(msg)
+            if platform.python_implementation() == 'IronPython':
+                msg = "For best results, pass -X:Frames to enable call stack."
+                warnings.warn(msg)
+            return True
+        res = inspect.getouterframes(run_frame)[2]
+        caller, = res[:1]
+        info = inspect.getframeinfo(caller)
+        caller_module = caller.f_globals.get('__name__', '')
+        return (
+            caller_module == 'distutils.dist'
+            and info.function == 'run_commands'
+        )
+
+    def do_egg_install(self):
+
+        easy_install = self.distribution.get_command_class('easy_install')
+
+        cmd = easy_install(
+            self.distribution, args="x", root=self.root, record=self.record,
+        )
+        cmd.ensure_finalized()  # finalize before bdist_egg munges install cmd
+        cmd.always_copy_from = '.'  # make sure local-dir eggs get installed
+
+        # pick up setup-dir .egg files only: no .egg-info
+        cmd.package_index.scan(glob.glob('*.egg'))
+
+        self.run_command('bdist_egg')
+        args = [self.distribution.get_command_obj('bdist_egg').egg_output]
+
+        if setuptools.bootstrap_install_from:
+            # Bootstrap self-installation of setuptools
+            args.insert(0, setuptools.bootstrap_install_from)
+
+        cmd.args = args
+        cmd.run(show_deprecation=False)
+        setuptools.bootstrap_install_from = None
+
+
+# XXX Python 3.1 doesn't see _nc if this is inside the class
+install.sub_commands = (
+    [cmd for cmd in orig.install.sub_commands if cmd[0] not in install._nc] +
+    install.new_commands
+)
diff --git a/venv/Lib/site-packages/setuptools/command/install_egg_info.py b/venv/Lib/site-packages/setuptools/command/install_egg_info.py
new file mode 100644
index 000000000..edc4718b6
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/install_egg_info.py
@@ -0,0 +1,62 @@
+from distutils import log, dir_util
+import os
+
+from setuptools import Command
+from setuptools import namespaces
+from setuptools.archive_util import unpack_archive
+import pkg_resources
+
+
+class install_egg_info(namespaces.Installer, Command):
+    """Install an .egg-info directory for the package"""
+
+    description = "Install an .egg-info directory for the package"
+
+    user_options = [
+        ('install-dir=', 'd', "directory to install to"),
+    ]
+
+    def initialize_options(self):
+        self.install_dir = None
+
+    def finalize_options(self):
+        self.set_undefined_options('install_lib',
+                                   ('install_dir', 'install_dir'))
+        ei_cmd = self.get_finalized_command("egg_info")
+        basename = pkg_resources.Distribution(
+            None, None, ei_cmd.egg_name, ei_cmd.egg_version
+        ).egg_name() + '.egg-info'
+        self.source = ei_cmd.egg_info
+        self.target = os.path.join(self.install_dir, basename)
+        self.outputs = []
+
+    def run(self):
+        self.run_command('egg_info')
+        if os.path.isdir(self.target) and not os.path.islink(self.target):
+            dir_util.remove_tree(self.target, dry_run=self.dry_run)
+        elif os.path.exists(self.target):
+            self.execute(os.unlink, (self.target,), "Removing " + self.target)
+        if not self.dry_run:
+            pkg_resources.ensure_directory(self.target)
+        self.execute(
+            self.copytree, (), "Copying %s to %s" % (self.source, self.target)
+        )
+        self.install_namespaces()
+
+    def get_outputs(self):
+        return self.outputs
+
+    def copytree(self):
+        # Copy the .egg-info tree to site-packages
+        def skimmer(src, dst):
+            # filter out source-control directories; note that 'src' is always
+            # a '/'-separated path, regardless of platform.  'dst' is a
+            # platform-specific path.
+            for skip in '.svn/', 'CVS/':
+                if src.startswith(skip) or '/' + skip in src:
+                    return None
+            self.outputs.append(dst)
+            log.debug("Copying %s to %s", src, dst)
+            return dst
+
+        unpack_archive(self.source, self.target, skimmer)
diff --git a/venv/Lib/site-packages/setuptools/command/install_lib.py b/venv/Lib/site-packages/setuptools/command/install_lib.py
new file mode 100644
index 000000000..2e9d8757a
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/install_lib.py
@@ -0,0 +1,122 @@
+import os
+import sys
+from itertools import product, starmap
+import distutils.command.install_lib as orig
+
+
+class install_lib(orig.install_lib):
+    """Don't add compiled flags to filenames of non-Python files"""
+
+    def run(self):
+        self.build()
+        outfiles = self.install()
+        if outfiles is not None:
+            # always compile, in case we have any extension stubs to deal with
+            self.byte_compile(outfiles)
+
+    def get_exclusions(self):
+        """
+        Return a collections.Sized collections.Container of paths to be
+        excluded for single_version_externally_managed installations.
+        """
+        all_packages = (
+            pkg
+            for ns_pkg in self._get_SVEM_NSPs()
+            for pkg in self._all_packages(ns_pkg)
+        )
+
+        excl_specs = product(all_packages, self._gen_exclusion_paths())
+        return set(starmap(self._exclude_pkg_path, excl_specs))
+
+    def _exclude_pkg_path(self, pkg, exclusion_path):
+        """
+        Given a package name and exclusion path within that package,
+        compute the full exclusion path.
+        """
+        parts = pkg.split('.') + [exclusion_path]
+        return os.path.join(self.install_dir, *parts)
+
+    @staticmethod
+    def _all_packages(pkg_name):
+        """
+        >>> list(install_lib._all_packages('foo.bar.baz'))
+        ['foo.bar.baz', 'foo.bar', 'foo']
+        """
+        while pkg_name:
+            yield pkg_name
+            pkg_name, sep, child = pkg_name.rpartition('.')
+
+    def _get_SVEM_NSPs(self):
+        """
+        Get namespace packages (list) but only for
+        single_version_externally_managed installations and empty otherwise.
+        """
+        # TODO: is it necessary to short-circuit here? i.e. what's the cost
+        # if get_finalized_command is called even when namespace_packages is
+        # False?
+        if not self.distribution.namespace_packages:
+            return []
+
+        install_cmd = self.get_finalized_command('install')
+        svem = install_cmd.single_version_externally_managed
+
+        return self.distribution.namespace_packages if svem else []
+
+    @staticmethod
+    def _gen_exclusion_paths():
+        """
+        Generate file paths to be excluded for namespace packages (bytecode
+        cache files).
+        """
+        # always exclude the package module itself
+        yield '__init__.py'
+
+        yield '__init__.pyc'
+        yield '__init__.pyo'
+
+        if not hasattr(sys, 'implementation'):
+            return
+
+        base = os.path.join(
+            '__pycache__', '__init__.' + sys.implementation.cache_tag)
+        yield base + '.pyc'
+        yield base + '.pyo'
+        yield base + '.opt-1.pyc'
+        yield base + '.opt-2.pyc'
+
+    def copy_tree(
+            self, infile, outfile,
+            preserve_mode=1, preserve_times=1, preserve_symlinks=0, level=1
+    ):
+        assert preserve_mode and preserve_times and not preserve_symlinks
+        exclude = self.get_exclusions()
+
+        if not exclude:
+            return orig.install_lib.copy_tree(self, infile, outfile)
+
+        # Exclude namespace package __init__.py* files from the output
+
+        from setuptools.archive_util import unpack_directory
+        from distutils import log
+
+        outfiles = []
+
+        def pf(src, dst):
+            if dst in exclude:
+                log.warn("Skipping installation of %s (namespace package)",
+                         dst)
+                return False
+
+            log.info("copying %s -> %s", src, os.path.dirname(dst))
+            outfiles.append(dst)
+            return dst
+
+        unpack_directory(infile, outfile, pf)
+        return outfiles
+
+    def get_outputs(self):
+        outputs = orig.install_lib.get_outputs(self)
+        exclude = self.get_exclusions()
+        if exclude:
+            return [f for f in outputs if f not in exclude]
+        return outputs
diff --git a/venv/Lib/site-packages/setuptools/command/install_scripts.py b/venv/Lib/site-packages/setuptools/command/install_scripts.py
new file mode 100644
index 000000000..8c9a15e2b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/install_scripts.py
@@ -0,0 +1,68 @@
+from distutils import log
+import distutils.command.install_scripts as orig
+import os
+import sys
+
+from pkg_resources import Distribution, PathMetadata, ensure_directory
+
+
+class install_scripts(orig.install_scripts):
+    """Do normal script install, plus any egg_info wrapper scripts"""
+
+    def initialize_options(self):
+        orig.install_scripts.initialize_options(self)
+        self.no_ep = False
+
+    def run(self):
+        import setuptools.command.easy_install as ei
+
+        self.run_command("egg_info")
+        if self.distribution.scripts:
+            orig.install_scripts.run(self)  # run first to set up self.outfiles
+        else:
+            self.outfiles = []
+        if self.no_ep:
+            # don't install entry point scripts into .egg file!
+            return
+
+        ei_cmd = self.get_finalized_command("egg_info")
+        dist = Distribution(
+            ei_cmd.egg_base, PathMetadata(ei_cmd.egg_base, ei_cmd.egg_info),
+            ei_cmd.egg_name, ei_cmd.egg_version,
+        )
+        bs_cmd = self.get_finalized_command('build_scripts')
+        exec_param = getattr(bs_cmd, 'executable', None)
+        try:
+            bw_cmd = self.get_finalized_command("bdist_wininst")
+            is_wininst = getattr(bw_cmd, '_is_running', False)
+        except ImportError:
+            is_wininst = False
+        writer = ei.ScriptWriter
+        if is_wininst:
+            exec_param = "python.exe"
+            writer = ei.WindowsScriptWriter
+        if exec_param == sys.executable:
+            # In case the path to the Python executable contains a space, wrap
+            # it so it's not split up.
+            exec_param = [exec_param]
+        # resolve the writer to the environment
+        writer = writer.best()
+        cmd = writer.command_spec_class.best().from_param(exec_param)
+        for args in writer.get_args(dist, cmd.as_header()):
+            self.write_script(*args)
+
+    def write_script(self, script_name, contents, mode="t", *ignored):
+        """Write an executable file to the scripts directory"""
+        from setuptools.command.easy_install import chmod, current_umask
+
+        log.info("Installing %s script to %s", script_name, self.install_dir)
+        target = os.path.join(self.install_dir, script_name)
+        self.outfiles.append(target)
+
+        mask = current_umask()
+        if not self.dry_run:
+            ensure_directory(target)
+            f = open(target, "w" + mode)
+            f.write(contents)
+            f.close()
+            chmod(target, 0o777 - mask)
diff --git a/venv/Lib/site-packages/setuptools/command/launcher manifest.xml b/venv/Lib/site-packages/setuptools/command/launcher manifest.xml
new file mode 100644
index 000000000..5972a96d8
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/launcher manifest.xml	
@@ -0,0 +1,15 @@
+<?xml version="1.0" encoding="UTF-8" standalone="yes"?>
+<assembly xmlns="urn:schemas-microsoft-com:asm.v1" manifestVersion="1.0">
+    <assemblyIdentity version="1.0.0.0"
+                      processorArchitecture="X86"
+                      name="%(name)s"
+                      type="win32"/>
+    <!-- Identify the application security requirements. -->
+    <trustInfo xmlns="urn:schemas-microsoft-com:asm.v3">
+        <security>
+            <requestedPrivileges>
+                <requestedExecutionLevel level="asInvoker" uiAccess="false"/>
+            </requestedPrivileges>
+        </security>
+    </trustInfo>
+</assembly>
diff --git a/venv/Lib/site-packages/setuptools/command/py36compat.py b/venv/Lib/site-packages/setuptools/command/py36compat.py
new file mode 100644
index 000000000..343547a4d
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/py36compat.py
@@ -0,0 +1,134 @@
+import os
+from glob import glob
+from distutils.util import convert_path
+from distutils.command import sdist
+
+
+class sdist_add_defaults:
+    """
+    Mix-in providing forward-compatibility for functionality as found in
+    distutils on Python 3.7.
+
+    Do not edit the code in this class except to update functionality
+    as implemented in distutils. Instead, override in the subclass.
+    """
+
+    def add_defaults(self):
+        """Add all the default files to self.filelist:
+          - README or README.txt
+          - setup.py
+          - test/test*.py
+          - all pure Python modules mentioned in setup script
+          - all files pointed by package_data (build_py)
+          - all files defined in data_files.
+          - all files defined as scripts.
+          - all C sources listed as part of extensions or C libraries
+            in the setup script (doesn't catch C headers!)
+        Warns if (README or README.txt) or setup.py are missing; everything
+        else is optional.
+        """
+        self._add_defaults_standards()
+        self._add_defaults_optional()
+        self._add_defaults_python()
+        self._add_defaults_data_files()
+        self._add_defaults_ext()
+        self._add_defaults_c_libs()
+        self._add_defaults_scripts()
+
+    @staticmethod
+    def _cs_path_exists(fspath):
+        """
+        Case-sensitive path existence check
+
+        >>> sdist_add_defaults._cs_path_exists(__file__)
+        True
+        >>> sdist_add_defaults._cs_path_exists(__file__.upper())
+        False
+        """
+        if not os.path.exists(fspath):
+            return False
+        # make absolute so we always have a directory
+        abspath = os.path.abspath(fspath)
+        directory, filename = os.path.split(abspath)
+        return filename in os.listdir(directory)
+
+    def _add_defaults_standards(self):
+        standards = [self.READMES, self.distribution.script_name]
+        for fn in standards:
+            if isinstance(fn, tuple):
+                alts = fn
+                got_it = False
+                for fn in alts:
+                    if self._cs_path_exists(fn):
+                        got_it = True
+                        self.filelist.append(fn)
+                        break
+
+                if not got_it:
+                    self.warn("standard file not found: should have one of " +
+                              ', '.join(alts))
+            else:
+                if self._cs_path_exists(fn):
+                    self.filelist.append(fn)
+                else:
+                    self.warn("standard file '%s' not found" % fn)
+
+    def _add_defaults_optional(self):
+        optional = ['test/test*.py', 'setup.cfg']
+        for pattern in optional:
+            files = filter(os.path.isfile, glob(pattern))
+            self.filelist.extend(files)
+
+    def _add_defaults_python(self):
+        # build_py is used to get:
+        #  - python modules
+        #  - files defined in package_data
+        build_py = self.get_finalized_command('build_py')
+
+        # getting python files
+        if self.distribution.has_pure_modules():
+            self.filelist.extend(build_py.get_source_files())
+
+        # getting package_data files
+        # (computed in build_py.data_files by build_py.finalize_options)
+        for pkg, src_dir, build_dir, filenames in build_py.data_files:
+            for filename in filenames:
+                self.filelist.append(os.path.join(src_dir, filename))
+
+    def _add_defaults_data_files(self):
+        # getting distribution.data_files
+        if self.distribution.has_data_files():
+            for item in self.distribution.data_files:
+                if isinstance(item, str):
+                    # plain file
+                    item = convert_path(item)
+                    if os.path.isfile(item):
+                        self.filelist.append(item)
+                else:
+                    # a (dirname, filenames) tuple
+                    dirname, filenames = item
+                    for f in filenames:
+                        f = convert_path(f)
+                        if os.path.isfile(f):
+                            self.filelist.append(f)
+
+    def _add_defaults_ext(self):
+        if self.distribution.has_ext_modules():
+            build_ext = self.get_finalized_command('build_ext')
+            self.filelist.extend(build_ext.get_source_files())
+
+    def _add_defaults_c_libs(self):
+        if self.distribution.has_c_libraries():
+            build_clib = self.get_finalized_command('build_clib')
+            self.filelist.extend(build_clib.get_source_files())
+
+    def _add_defaults_scripts(self):
+        if self.distribution.has_scripts():
+            build_scripts = self.get_finalized_command('build_scripts')
+            self.filelist.extend(build_scripts.get_source_files())
+
+
+if hasattr(sdist.sdist, '_add_defaults_standards'):
+    # disable the functionality already available upstream
+    class sdist_add_defaults:  # noqa
+        pass
diff --git a/venv/Lib/site-packages/setuptools/command/register.py b/venv/Lib/site-packages/setuptools/command/register.py
new file mode 100644
index 000000000..b8266b9a6
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/register.py
@@ -0,0 +1,18 @@
+from distutils import log
+import distutils.command.register as orig
+
+from setuptools.errors import RemovedCommandError
+
+
+class register(orig.register):
+    """Formerly used to register packages on PyPI."""
+
+    def run(self):
+        msg = (
+            "The register command has been removed, use twine to upload "
+            + "instead (https://pypi.org/p/twine)"
+        )
+
+        self.announce("ERROR: " + msg, log.ERROR)
+
+        raise RemovedCommandError(msg)
diff --git a/venv/Lib/site-packages/setuptools/command/rotate.py b/venv/Lib/site-packages/setuptools/command/rotate.py
new file mode 100644
index 000000000..74795ba92
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/rotate.py
@@ -0,0 +1,64 @@
+from distutils.util import convert_path
+from distutils import log
+from distutils.errors import DistutilsOptionError
+import os
+import shutil
+
+from setuptools import Command
+
+
+class rotate(Command):
+    """Delete older distributions"""
+
+    description = "delete older distributions, keeping N newest files"
+    user_options = [
+        ('match=', 'm', "patterns to match (required)"),
+        ('dist-dir=', 'd', "directory where the distributions are"),
+        ('keep=', 'k', "number of matching distributions to keep"),
+    ]
+
+    boolean_options = []
+
+    def initialize_options(self):
+        self.match = None
+        self.dist_dir = None
+        self.keep = None
+
+    def finalize_options(self):
+        if self.match is None:
+            raise DistutilsOptionError(
+                "Must specify one or more (comma-separated) match patterns "
+                "(e.g. '.zip' or '.egg')"
+            )
+        if self.keep is None:
+            raise DistutilsOptionError("Must specify number of files to keep")
+        try:
+            self.keep = int(self.keep)
+        except ValueError as e:
+            raise DistutilsOptionError("--keep must be an integer") from e
+        if isinstance(self.match, str):
+            self.match = [
+                convert_path(p.strip()) for p in self.match.split(',')
+            ]
+        self.set_undefined_options('bdist', ('dist_dir', 'dist_dir'))
+
+    def run(self):
+        self.run_command("egg_info")
+        from glob import glob
+
+        for pattern in self.match:
+            pattern = self.distribution.get_name() + '*' + pattern
+            files = glob(os.path.join(self.dist_dir, pattern))
+            files = [(os.path.getmtime(f), f) for f in files]
+            files.sort()
+            files.reverse()
+
+            log.info("%d file(s) matching %s", len(files), pattern)
+            files = files[self.keep:]
+            for (t, f) in files:
+                log.info("Deleting %s", f)
+                if not self.dry_run:
+                    if os.path.isdir(f):
+                        shutil.rmtree(f)
+                    else:
+                        os.unlink(f)
diff --git a/venv/Lib/site-packages/setuptools/command/saveopts.py b/venv/Lib/site-packages/setuptools/command/saveopts.py
new file mode 100644
index 000000000..611cec552
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/saveopts.py
@@ -0,0 +1,22 @@
+from setuptools.command.setopt import edit_config, option_base
+
+
+class saveopts(option_base):
+    """Save command-line options to a file"""
+
+    description = "save supplied options to setup.cfg or other config file"
+
+    def run(self):
+        dist = self.distribution
+        settings = {}
+
+        for cmd in dist.command_options:
+
+            if cmd == 'saveopts':
+                continue  # don't save our own options!
+
+            for opt, (src, val) in dist.get_option_dict(cmd).items():
+                if src == "command line":
+                    settings.setdefault(cmd, {})[opt] = val
+
+        edit_config(self.filename, settings, self.dry_run)
diff --git a/venv/Lib/site-packages/setuptools/command/sdist.py b/venv/Lib/site-packages/setuptools/command/sdist.py
new file mode 100644
index 000000000..887b7efa0
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/sdist.py
@@ -0,0 +1,222 @@
+from distutils import log
+import distutils.command.sdist as orig
+import os
+import sys
+import io
+import contextlib
+
+from setuptools.extern import ordered_set
+
+from .py36compat import sdist_add_defaults
+
+import pkg_resources
+
+_default_revctrl = list
+
+
+def walk_revctrl(dirname=''):
+    """Find all files under revision control"""
+    for ep in pkg_resources.iter_entry_points('setuptools.file_finders'):
+        for item in ep.load()(dirname):
+            yield item
+
+
+class sdist(sdist_add_defaults, orig.sdist):
+    """Smart sdist that finds anything supported by revision control"""
+
+    user_options = [
+        ('formats=', None,
+         "formats for source distribution (comma-separated list)"),
+        ('keep-temp', 'k',
+         "keep the distribution tree around after creating " +
+         "archive file(s)"),
+        ('dist-dir=', 'd',
+         "directory to put the source distribution archive(s) in "
+         "[default: dist]"),
+    ]
+
+    negative_opt = {}
+
+    README_EXTENSIONS = ['', '.rst', '.txt', '.md']
+    READMES = tuple('README{0}'.format(ext) for ext in README_EXTENSIONS)
+
+    def run(self):
+        self.run_command('egg_info')
+        ei_cmd = self.get_finalized_command('egg_info')
+        self.filelist = ei_cmd.filelist
+        self.filelist.append(os.path.join(ei_cmd.egg_info, 'SOURCES.txt'))
+        self.check_readme()
+
+        # Run sub commands
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+        self.make_distribution()
+
+        dist_files = getattr(self.distribution, 'dist_files', [])
+        for file in self.archive_files:
+            data = ('sdist', '', file)
+            if data not in dist_files:
+                dist_files.append(data)
+
+    def initialize_options(self):
+        orig.sdist.initialize_options(self)
+
+        self._default_to_gztar()
+
+    def _default_to_gztar(self):
+        # only needed on Python prior to 3.6.
+        if sys.version_info >= (3, 6, 0, 'beta', 1):
+            return
+        self.formats = ['gztar']
+
+    def make_distribution(self):
+        """
+        Workaround for #516
+        """
+        with self._remove_os_link():
+            orig.sdist.make_distribution(self)
+
+    @staticmethod
+    @contextlib.contextmanager
+    def _remove_os_link():
+        """
+        In a context, remove and restore os.link if it exists
+        """
+
+        class NoValue:
+            pass
+
+        orig_val = getattr(os, 'link', NoValue)
+        try:
+            del os.link
+        except Exception:
+            pass
+        try:
+            yield
+        finally:
+            if orig_val is not NoValue:
+                setattr(os, 'link', orig_val)
+
+    def _add_defaults_optional(self):
+        super()._add_defaults_optional()
+        if os.path.isfile('pyproject.toml'):
+            self.filelist.append('pyproject.toml')
+
+    def _add_defaults_python(self):
+        """getting python files"""
+        if self.distribution.has_pure_modules():
+            build_py = self.get_finalized_command('build_py')
+            self.filelist.extend(build_py.get_source_files())
+            self._add_data_files(self._safe_data_files(build_py))
+
+    def _safe_data_files(self, build_py):
+        """
+        Extracting data_files from build_py is known to cause
+        infinite recursion errors when `include_package_data`
+        is enabled, so suppress it in that case.
+        """
+        if self.distribution.include_package_data:
+            return ()
+        return build_py.data_files
+
+    def _add_data_files(self, data_files):
+        """
+        Add data files as found in build_py.data_files.
+        """
+        self.filelist.extend(
+            os.path.join(src_dir, name)
+            for _, src_dir, _, filenames in data_files
+            for name in filenames
+        )
+
+    def _add_defaults_data_files(self):
+        try:
+            super()._add_defaults_data_files()
+        except TypeError:
+            log.warn("data_files contains unexpected objects")
+
+    def check_readme(self):
+        for f in self.READMES:
+            if os.path.exists(f):
+                return
+        else:
+            self.warn(
+                "standard file not found: should have one of " +
+                ', '.join(self.READMES)
+            )
+
+    def make_release_tree(self, base_dir, files):
+        orig.sdist.make_release_tree(self, base_dir, files)
+
+        # Save any egg_info command line options used to create this sdist
+        dest = os.path.join(base_dir, 'setup.cfg')
+        if hasattr(os, 'link') and os.path.exists(dest):
+            # unlink and re-copy, since it might be hard-linked, and
+            # we don't want to change the source version
+            os.unlink(dest)
+            self.copy_file('setup.cfg', dest)
+
+        self.get_finalized_command('egg_info').save_version_info(dest)
+
+    def _manifest_is_not_generated(self):
+        # check for special comment used in 2.7.1 and higher
+        if not os.path.isfile(self.manifest):
+            return False
+
+        with io.open(self.manifest, 'rb') as fp:
+            first_line = fp.readline()
+        return (first_line !=
+                '# file GENERATED by distutils, do NOT edit\n'.encode())
+
+    def read_manifest(self):
+        """Read the manifest file (named by 'self.manifest') and use it to
+        fill in 'self.filelist', the list of files to include in the source
+        distribution.
+        """
+        log.info("reading manifest file '%s'", self.manifest)
+        manifest = open(self.manifest, 'rb')
+        for line in manifest:
+            # The manifest must contain UTF-8. See #303.
+            try:
+                line = line.decode('UTF-8')
+            except UnicodeDecodeError:
+                log.warn("%r not UTF-8 decodable -- skipping" % line)
+                continue
+            # ignore comments and blank lines
+            line = line.strip()
+            if line.startswith('#') or not line:
+                continue
+            self.filelist.append(line)
+        manifest.close()
+
+    def check_license(self):
+        """Checks if license_file' or 'license_files' is configured and adds any
+        valid paths to 'self.filelist'.
+        """
+
+        files = ordered_set.OrderedSet()
+
+        opts = self.distribution.get_option_dict('metadata')
+
+        # ignore the source of the value
+        _, license_file = opts.get('license_file', (None, None))
+
+        if license_file is None:
+            log.debug("'license_file' option was not specified")
+        else:
+            files.add(license_file)
+
+        try:
+            files.update(self.distribution.metadata.license_files)
+        except TypeError:
+            log.warn("warning: 'license_files' option is malformed")
+
+        for f in files:
+            if not os.path.exists(f):
+                log.warn(
+                    "warning: Failed to find the configured license file '%s'",
+                    f)
+                files.remove(f)
+
+        self.filelist.extend(files)
diff --git a/venv/Lib/site-packages/setuptools/command/setopt.py b/venv/Lib/site-packages/setuptools/command/setopt.py
new file mode 100644
index 000000000..e18057c81
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/setopt.py
@@ -0,0 +1,148 @@
+from distutils.util import convert_path
+from distutils import log
+from distutils.errors import DistutilsOptionError
+import distutils
+import os
+import configparser
+
+from setuptools import Command
+
+__all__ = ['config_file', 'edit_config', 'option_base', 'setopt']
+
+
+def config_file(kind="local"):
+    """Get the filename of the distutils, local, global, or per-user config
+
+    `kind` must be one of "local", "global", or "user"
+    """
+    if kind == 'local':
+        return 'setup.cfg'
+    if kind == 'global':
+        return os.path.join(
+            os.path.dirname(distutils.__file__), 'distutils.cfg'
+        )
+    if kind == 'user':
+        dot = os.name == 'posix' and '.' or ''
+        return os.path.expanduser(convert_path("~/%spydistutils.cfg" % dot))
+    raise ValueError(
+        "config_file() type must be 'local', 'global', or 'user'", kind
+    )
+
+
+def edit_config(filename, settings, dry_run=False):
+    """Edit a configuration file to include `settings`
+
+    `settings` is a dictionary of dictionaries or ``None`` values, keyed by
+    command/section name.  A ``None`` value means to delete the entire section,
+    while a dictionary lists settings to be changed or deleted in that section.
+    A setting of ``None`` means to delete that setting.
+    """
+    log.debug("Reading configuration from %s", filename)
+    opts = configparser.RawConfigParser()
+    opts.read([filename])
+    for section, options in settings.items():
+        if options is None:
+            log.info("Deleting section [%s] from %s", section, filename)
+            opts.remove_section(section)
+        else:
+            if not opts.has_section(section):
+                log.debug("Adding new section [%s] to %s", section, filename)
+                opts.add_section(section)
+            for option, value in options.items():
+                if value is None:
+                    log.debug(
+                        "Deleting %s.%s from %s",
+                        section, option, filename
+                    )
+                    opts.remove_option(section, option)
+                    if not opts.options(section):
+                        log.info("Deleting empty [%s] section from %s",
+                                 section, filename)
+                        opts.remove_section(section)
+                else:
+                    log.debug(
+                        "Setting %s.%s to %r in %s",
+                        section, option, value, filename
+                    )
+                    opts.set(section, option, value)
+
+    log.info("Writing %s", filename)
+    if not dry_run:
+        with open(filename, 'w') as f:
+            opts.write(f)
+
+
+class option_base(Command):
+    """Abstract base class for commands that mess with config files"""
+
+    user_options = [
+        ('global-config', 'g',
+         "save options to the site-wide distutils.cfg file"),
+        ('user-config', 'u',
+         "save options to the current user's pydistutils.cfg file"),
+        ('filename=', 'f',
+         "configuration file to use (default=setup.cfg)"),
+    ]
+
+    boolean_options = [
+        'global-config', 'user-config',
+    ]
+
+    def initialize_options(self):
+        self.global_config = None
+        self.user_config = None
+        self.filename = None
+
+    def finalize_options(self):
+        filenames = []
+        if self.global_config:
+            filenames.append(config_file('global'))
+        if self.user_config:
+            filenames.append(config_file('user'))
+        if self.filename is not None:
+            filenames.append(self.filename)
+        if not filenames:
+            filenames.append(config_file('local'))
+        if len(filenames) > 1:
+            raise DistutilsOptionError(
+                "Must specify only one configuration file option",
+                filenames
+            )
+        self.filename, = filenames
+
+
+class setopt(option_base):
+    """Save command-line options to a file"""
+
+    description = "set an option in setup.cfg or another config file"
+
+    user_options = [
+        ('command=', 'c', 'command to set an option for'),
+        ('option=', 'o', 'option to set'),
+        ('set-value=', 's', 'value of the option'),
+        ('remove', 'r', 'remove (unset) the value'),
+    ] + option_base.user_options
+
+    boolean_options = option_base.boolean_options + ['remove']
+
+    def initialize_options(self):
+        option_base.initialize_options(self)
+        self.command = None
+        self.option = None
+        self.set_value = None
+        self.remove = None
+
+    def finalize_options(self):
+        option_base.finalize_options(self)
+        if self.command is None or self.option is None:
+            raise DistutilsOptionError("Must specify --command *and* --option")
+        if self.set_value is None and not self.remove:
+            raise DistutilsOptionError("Must specify --set-value or --remove")
+
+    def run(self):
+        edit_config(
+            self.filename, {
+                self.command: {self.option.replace('-', '_'): self.set_value}
+            },
+            self.dry_run
+        )
diff --git a/venv/Lib/site-packages/setuptools/command/test.py b/venv/Lib/site-packages/setuptools/command/test.py
new file mode 100644
index 000000000..cf71ad015
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/test.py
@@ -0,0 +1,274 @@
+import os
+import operator
+import sys
+import contextlib
+import itertools
+import unittest
+from distutils.errors import DistutilsError, DistutilsOptionError
+from distutils import log
+from unittest import TestLoader
+
+from pkg_resources import (resource_listdir, resource_exists, normalize_path,
+                           working_set, _namespace_packages, evaluate_marker,
+                           add_activation_listener, require, EntryPoint)
+from setuptools import Command
+from .build_py import _unique_everseen
+
+
+class ScanningLoader(TestLoader):
+
+    def __init__(self):
+        TestLoader.__init__(self)
+        self._visited = set()
+
+    def loadTestsFromModule(self, module, pattern=None):
+        """Return a suite of all tests cases contained in the given module
+
+        If the module is a package, load tests from all the modules in it.
+        If the module has an ``additional_tests`` function, call it and add
+        the return value to the tests.
+        """
+        if module in self._visited:
+            return None
+        self._visited.add(module)
+
+        tests = []
+        tests.append(TestLoader.loadTestsFromModule(self, module))
+
+        if hasattr(module, "additional_tests"):
+            tests.append(module.additional_tests())
+
+        if hasattr(module, '__path__'):
+            for file in resource_listdir(module.__name__, ''):
+                if file.endswith('.py') and file != '__init__.py':
+                    submodule = module.__name__ + '.' + file[:-3]
+                else:
+                    if resource_exists(module.__name__, file + '/__init__.py'):
+                        submodule = module.__name__ + '.' + file
+                    else:
+                        continue
+                tests.append(self.loadTestsFromName(submodule))
+
+        if len(tests) != 1:
+            return self.suiteClass(tests)
+        else:
+            return tests[0]  # don't create a nested suite for only one return
+
+
+# adapted from jaraco.classes.properties:NonDataProperty
+class NonDataProperty:
+    def __init__(self, fget):
+        self.fget = fget
+
+    def __get__(self, obj, objtype=None):
+        if obj is None:
+            return self
+        return self.fget(obj)
+
+
+class test(Command):
+    """Command to run unit tests after in-place build"""
+
+    description = "run unit tests after in-place build (deprecated)"
+
+    user_options = [
+        ('test-module=', 'm', "Run 'test_suite' in specified module"),
+        ('test-suite=', 's',
+         "Run single test, case or suite (e.g. 'module.test_suite')"),
+        ('test-runner=', 'r', "Test runner to use"),
+    ]
+
+    def initialize_options(self):
+        self.test_suite = None
+        self.test_module = None
+        self.test_loader = None
+        self.test_runner = None
+
+    def finalize_options(self):
+
+        if self.test_suite and self.test_module:
+            msg = "You may specify a module or a suite, but not both"
+            raise DistutilsOptionError(msg)
+
+        if self.test_suite is None:
+            if self.test_module is None:
+                self.test_suite = self.distribution.test_suite
+            else:
+                self.test_suite = self.test_module + ".test_suite"
+
+        if self.test_loader is None:
+            self.test_loader = getattr(self.distribution, 'test_loader', None)
+        if self.test_loader is None:
+            self.test_loader = "setuptools.command.test:ScanningLoader"
+        if self.test_runner is None:
+            self.test_runner = getattr(self.distribution, 'test_runner', None)
+
+    @NonDataProperty
+    def test_args(self):
+        return list(self._test_args())
+
+    def _test_args(self):
+        if not self.test_suite and sys.version_info >= (2, 7):
+            yield 'discover'
+        if self.verbose:
+            yield '--verbose'
+        if self.test_suite:
+            yield self.test_suite
+
+    def with_project_on_sys_path(self, func):
+        """
+        Backward compatibility for project_on_sys_path context.
+        """
+        with self.project_on_sys_path():
+            func()
+
+    @contextlib.contextmanager
+    def project_on_sys_path(self, include_dists=[]):
+        with_2to3 = getattr(self.distribution, 'use_2to3', False)
+
+        if with_2to3:
+            # If we run 2to3 we can not do this inplace:
+
+            # Ensure metadata is up-to-date
+            self.reinitialize_command('build_py', inplace=0)
+            self.run_command('build_py')
+            bpy_cmd = self.get_finalized_command("build_py")
+            build_path = normalize_path(bpy_cmd.build_lib)
+
+            # Build extensions
+            self.reinitialize_command('egg_info', egg_base=build_path)
+            self.run_command('egg_info')
+
+            self.reinitialize_command('build_ext', inplace=0)
+            self.run_command('build_ext')
+        else:
+            # Without 2to3 inplace works fine:
+            self.run_command('egg_info')
+
+            # Build extensions in-place
+            self.reinitialize_command('build_ext', inplace=1)
+            self.run_command('build_ext')
+
+        ei_cmd = self.get_finalized_command("egg_info")
+
+        old_path = sys.path[:]
+        old_modules = sys.modules.copy()
+
+        try:
+            project_path = normalize_path(ei_cmd.egg_base)
+            sys.path.insert(0, project_path)
+            working_set.__init__()
+            add_activation_listener(lambda dist: dist.activate())
+            require('%s==%s' % (ei_cmd.egg_name, ei_cmd.egg_version))
+            with self.paths_on_pythonpath([project_path]):
+                yield
+        finally:
+            sys.path[:] = old_path
+            sys.modules.clear()
+            sys.modules.update(old_modules)
+            working_set.__init__()
+
+    @staticmethod
+    @contextlib.contextmanager
+    def paths_on_pythonpath(paths):
+        """
+        Add the indicated paths to the head of the PYTHONPATH environment
+        variable so that subprocesses will also see the packages at
+        these paths.
+
+        Do this in a context that restores the value on exit.
+        """
+        nothing = object()
+        orig_pythonpath = os.environ.get('PYTHONPATH', nothing)
+        current_pythonpath = os.environ.get('PYTHONPATH', '')
+        try:
+            prefix = os.pathsep.join(_unique_everseen(paths))
+            to_join = filter(None, [prefix, current_pythonpath])
+            new_path = os.pathsep.join(to_join)
+            if new_path:
+                os.environ['PYTHONPATH'] = new_path
+            yield
+        finally:
+            if orig_pythonpath is nothing:
+                os.environ.pop('PYTHONPATH', None)
+            else:
+                os.environ['PYTHONPATH'] = orig_pythonpath
+
+    @staticmethod
+    def install_dists(dist):
+        """
+        Install the requirements indicated by self.distribution and
+        return an iterable of the dists that were built.
+        """
+        ir_d = dist.fetch_build_eggs(dist.install_requires)
+        tr_d = dist.fetch_build_eggs(dist.tests_require or [])
+        er_d = dist.fetch_build_eggs(
+            v for k, v in dist.extras_require.items()
+            if k.startswith(':') and evaluate_marker(k[1:])
+        )
+        return itertools.chain(ir_d, tr_d, er_d)
+
+    def run(self):
+        self.announce(
+            "WARNING: Testing via this command is deprecated and will be "
+            "removed in a future version. Users looking for a generic test "
+            "entry point independent of test runner are encouraged to use "
+            "tox.",
+            log.WARN,
+        )
+
+        installed_dists = self.install_dists(self.distribution)
+
+        cmd = ' '.join(self._argv)
+        if self.dry_run:
+            self.announce('skipping "%s" (dry run)' % cmd)
+            return
+
+        self.announce('running "%s"' % cmd)
+
+        paths = map(operator.attrgetter('location'), installed_dists)
+        with self.paths_on_pythonpath(paths):
+            with self.project_on_sys_path():
+                self.run_tests()
+
+    def run_tests(self):
+        # Purge modules under test from sys.modules. The test loader will
+        # re-import them from the build location. Required when 2to3 is used
+        # with namespace packages.
+        if getattr(self.distribution, 'use_2to3', False):
+            module = self.test_suite.split('.')[0]
+            if module in _namespace_packages:
+                del_modules = []
+                if module in sys.modules:
+                    del_modules.append(module)
+                module += '.'
+                for name in sys.modules:
+                    if name.startswith(module):
+                        del_modules.append(name)
+                list(map(sys.modules.__delitem__, del_modules))
+
+        test = unittest.main(
+            None, None, self._argv,
+            testLoader=self._resolve_as_ep(self.test_loader),
+            testRunner=self._resolve_as_ep(self.test_runner),
+            exit=False,
+        )
+        if not test.result.wasSuccessful():
+            msg = 'Test failed: %s' % test.result
+            self.announce(msg, log.ERROR)
+            raise DistutilsError(msg)
+
+    @property
+    def _argv(self):
+        return ['unittest'] + self.test_args
+
+    @staticmethod
+    def _resolve_as_ep(val):
+        """
+        Load the indicated attribute value, called, as a as if it were
+        specified as an entry point.
+        """
+        if val is None:
+            return
+        parsed = EntryPoint.parse("x=" + val)
+        return parsed.resolve()()
diff --git a/venv/Lib/site-packages/setuptools/command/upload.py b/venv/Lib/site-packages/setuptools/command/upload.py
new file mode 100644
index 000000000..ec7f81e22
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/upload.py
@@ -0,0 +1,17 @@
+from distutils import log
+from distutils.command import upload as orig
+
+from setuptools.errors import RemovedCommandError
+
+
+class upload(orig.upload):
+    """Formerly used to upload packages to PyPI."""
+
+    def run(self):
+        msg = (
+            "The upload command has been removed, use twine to upload "
+            + "instead (https://pypi.org/p/twine)"
+        )
+
+        self.announce("ERROR: " + msg, log.ERROR)
+        raise RemovedCommandError(msg)
diff --git a/venv/Lib/site-packages/setuptools/command/upload_docs.py b/venv/Lib/site-packages/setuptools/command/upload_docs.py
new file mode 100644
index 000000000..2559458a1
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/command/upload_docs.py
@@ -0,0 +1,202 @@
+# -*- coding: utf-8 -*-
+"""upload_docs
+
+Implements a Distutils 'upload_docs' subcommand (upload documentation to
+PyPI's pythonhosted.org).
+"""
+
+from base64 import standard_b64encode
+from distutils import log
+from distutils.errors import DistutilsOptionError
+import os
+import socket
+import zipfile
+import tempfile
+import shutil
+import itertools
+import functools
+import http.client
+import urllib.parse
+
+from pkg_resources import iter_entry_points
+from .upload import upload
+
+
+def _encode(s):
+    return s.encode('utf-8', 'surrogateescape')
+
+
+class upload_docs(upload):
+    # override the default repository as upload_docs isn't
+    # supported by Warehouse (and won't be).
+    DEFAULT_REPOSITORY = 'https://pypi.python.org/pypi/'
+
+    description = 'Upload documentation to PyPI'
+
+    user_options = [
+        ('repository=', 'r',
+         "url of repository [default: %s]" % upload.DEFAULT_REPOSITORY),
+        ('show-response', None,
+         'display full response text from server'),
+        ('upload-dir=', None, 'directory to upload'),
+    ]
+    boolean_options = upload.boolean_options
+
+    def has_sphinx(self):
+        if self.upload_dir is None:
+            for ep in iter_entry_points('distutils.commands', 'build_sphinx'):
+                return True
+
+    sub_commands = [('build_sphinx', has_sphinx)]
+
+    def initialize_options(self):
+        upload.initialize_options(self)
+        self.upload_dir = None
+        self.target_dir = None
+
+    def finalize_options(self):
+        upload.finalize_options(self)
+        if self.upload_dir is None:
+            if self.has_sphinx():
+                build_sphinx = self.get_finalized_command('build_sphinx')
+                self.target_dir = build_sphinx.builder_target_dir
+            else:
+                build = self.get_finalized_command('build')
+                self.target_dir = os.path.join(build.build_base, 'docs')
+        else:
+            self.ensure_dirname('upload_dir')
+            self.target_dir = self.upload_dir
+        if 'pypi.python.org' in self.repository:
+            log.warn("Upload_docs command is deprecated. Use RTD instead.")
+        self.announce('Using upload directory %s' % self.target_dir)
+
+    def create_zipfile(self, filename):
+        zip_file = zipfile.ZipFile(filename, "w")
+        try:
+            self.mkpath(self.target_dir)  # just in case
+            for root, dirs, files in os.walk(self.target_dir):
+                if root == self.target_dir and not files:
+                    tmpl = "no files found in upload directory '%s'"
+                    raise DistutilsOptionError(tmpl % self.target_dir)
+                for name in files:
+                    full = os.path.join(root, name)
+                    relative = root[len(self.target_dir):].lstrip(os.path.sep)
+                    dest = os.path.join(relative, name)
+                    zip_file.write(full, dest)
+        finally:
+            zip_file.close()
+
+    def run(self):
+        # Run sub commands
+        for cmd_name in self.get_sub_commands():
+            self.run_command(cmd_name)
+
+        tmp_dir = tempfile.mkdtemp()
+        name = self.distribution.metadata.get_name()
+        zip_file = os.path.join(tmp_dir, "%s.zip" % name)
+        try:
+            self.create_zipfile(zip_file)
+            self.upload_file(zip_file)
+        finally:
+            shutil.rmtree(tmp_dir)
+
+    @staticmethod
+    def _build_part(item, sep_boundary):
+        key, values = item
+        title = '\nContent-Disposition: form-data; name="%s"' % key
+        # handle multiple entries for the same name
+        if not isinstance(values, list):
+            values = [values]
+        for value in values:
+            if isinstance(value, tuple):
+                title += '; filename="%s"' % value[0]
+                value = value[1]
+            else:
+                value = _encode(value)
+            yield sep_boundary
+            yield _encode(title)
+            yield b"\n\n"
+            yield value
+            if value and value[-1:] == b'\r':
+                yield b'\n'  # write an extra newline (lurve Macs)
+
+    @classmethod
+    def _build_multipart(cls, data):
+        """
+        Build up the MIME payload for the POST data
+        """
+        boundary = '--------------GHSKFJDLGDS7543FJKLFHRE75642756743254'
+        sep_boundary = b'\n--' + boundary.encode('ascii')
+        end_boundary = sep_boundary + b'--'
+        end_items = end_boundary, b"\n",
+        builder = functools.partial(
+            cls._build_part,
+            sep_boundary=sep_boundary,
+        )
+        part_groups = map(builder, data.items())
+        parts = itertools.chain.from_iterable(part_groups)
+        body_items = itertools.chain(parts, end_items)
+        content_type = 'multipart/form-data; boundary=%s' % boundary
+        return b''.join(body_items), content_type
+
+    def upload_file(self, filename):
+        with open(filename, 'rb') as f:
+            content = f.read()
+        meta = self.distribution.metadata
+        data = {
+            ':action': 'doc_upload',
+            'name': meta.get_name(),
+            'content': (os.path.basename(filename), content),
+        }
+        # set up the authentication
+        credentials = _encode(self.username + ':' + self.password)
+        credentials = standard_b64encode(credentials).decode('ascii')
+        auth = "Basic " + credentials
+
+        body, ct = self._build_multipart(data)
+
+        msg = "Submitting documentation to %s" % (self.repository)
+        self.announce(msg, log.INFO)
+
+        # build the Request
+        # We can't use urllib2 since we need to send the Basic
+        # auth right with the first request
+        schema, netloc, url, params, query, fragments = \
+            urllib.parse.urlparse(self.repository)
+        assert not params and not query and not fragments
+        if schema == 'http':
+            conn = http.client.HTTPConnection(netloc)
+        elif schema == 'https':
+            conn = http.client.HTTPSConnection(netloc)
+        else:
+            raise AssertionError("unsupported schema " + schema)
+
+        data = ''
+        try:
+            conn.connect()
+            conn.putrequest("POST", url)
+            content_type = ct
+            conn.putheader('Content-type', content_type)
+            conn.putheader('Content-length', str(len(body)))
+            conn.putheader('Authorization', auth)
+            conn.endheaders()
+            conn.send(body)
+        except socket.error as e:
+            self.announce(str(e), log.ERROR)
+            return
+
+        r = conn.getresponse()
+        if r.status == 200:
+            msg = 'Server response (%s): %s' % (r.status, r.reason)
+            self.announce(msg, log.INFO)
+        elif r.status == 301:
+            location = r.getheader('Location')
+            if location is None:
+                location = 'https://pythonhosted.org/%s/' % meta.get_name()
+            msg = 'Upload successful. Visit %s' % location
+            self.announce(msg, log.INFO)
+        else:
+            msg = 'Upload failed (%s): %s' % (r.status, r.reason)
+            self.announce(msg, log.ERROR)
+        if self.show_response:
+            print('-' * 75, r.read(), '-' * 75)
diff --git a/venv/Lib/site-packages/setuptools/config.py b/venv/Lib/site-packages/setuptools/config.py
new file mode 100644
index 000000000..af3a3bcbd
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/config.py
@@ -0,0 +1,693 @@
+import ast
+import io
+import os
+import sys
+
+import warnings
+import functools
+import importlib
+from collections import defaultdict
+from functools import partial
+from functools import wraps
+import contextlib
+
+from distutils.errors import DistutilsOptionError, DistutilsFileError
+from setuptools.extern.packaging.version import LegacyVersion, parse
+from setuptools.extern.packaging.specifiers import SpecifierSet
+
+
+class StaticModule:
+    """
+    Attempt to load the module by the name
+    """
+    def __init__(self, name):
+        spec = importlib.util.find_spec(name)
+        with open(spec.origin) as strm:
+            src = strm.read()
+        module = ast.parse(src)
+        vars(self).update(locals())
+        del self.self
+
+    def __getattr__(self, attr):
+        try:
+            return next(
+                ast.literal_eval(statement.value)
+                for statement in self.module.body
+                if isinstance(statement, ast.Assign)
+                for target in statement.targets
+                if isinstance(target, ast.Name) and target.id == attr
+            )
+        except Exception as e:
+            raise AttributeError(
+                "{self.name} has no attribute {attr}".format(**locals())
+            ) from e
+
+
+@contextlib.contextmanager
+def patch_path(path):
+    """
+    Add path to front of sys.path for the duration of the context.
+    """
+    try:
+        sys.path.insert(0, path)
+        yield
+    finally:
+        sys.path.remove(path)
+
+
+def read_configuration(
+        filepath, find_others=False, ignore_option_errors=False):
+    """Read given configuration file and returns options from it as a dict.
+
+    :param str|unicode filepath: Path to configuration file
+        to get options from.
+
+    :param bool find_others: Whether to search for other configuration files
+        which could be on in various places.
+
+    :param bool ignore_option_errors: Whether to silently ignore
+        options, values of which could not be resolved (e.g. due to exceptions
+        in directives such as file:, attr:, etc.).
+        If False exceptions are propagated as expected.
+
+    :rtype: dict
+    """
+    from setuptools.dist import Distribution, _Distribution
+
+    filepath = os.path.abspath(filepath)
+
+    if not os.path.isfile(filepath):
+        raise DistutilsFileError(
+            'Configuration file %s does not exist.' % filepath)
+
+    current_directory = os.getcwd()
+    os.chdir(os.path.dirname(filepath))
+
+    try:
+        dist = Distribution()
+
+        filenames = dist.find_config_files() if find_others else []
+        if filepath not in filenames:
+            filenames.append(filepath)
+
+        _Distribution.parse_config_files(dist, filenames=filenames)
+
+        handlers = parse_configuration(
+            dist, dist.command_options,
+            ignore_option_errors=ignore_option_errors)
+
+    finally:
+        os.chdir(current_directory)
+
+    return configuration_to_dict(handlers)
+
+
+def _get_option(target_obj, key):
+    """
+    Given a target object and option key, get that option from
+    the target object, either through a get_{key} method or
+    from an attribute directly.
+    """
+    getter_name = 'get_{key}'.format(**locals())
+    by_attribute = functools.partial(getattr, target_obj, key)
+    getter = getattr(target_obj, getter_name, by_attribute)
+    return getter()
+
+
+def configuration_to_dict(handlers):
+    """Returns configuration data gathered by given handlers as a dict.
+
+    :param list[ConfigHandler] handlers: Handlers list,
+        usually from parse_configuration()
+
+    :rtype: dict
+    """
+    config_dict = defaultdict(dict)
+
+    for handler in handlers:
+        for option in handler.set_options:
+            value = _get_option(handler.target_obj, option)
+            config_dict[handler.section_prefix][option] = value
+
+    return config_dict
+
+
+def parse_configuration(
+        distribution, command_options, ignore_option_errors=False):
+    """Performs additional parsing of configuration options
+    for a distribution.
+
+    Returns a list of used option handlers.
+
+    :param Distribution distribution:
+    :param dict command_options:
+    :param bool ignore_option_errors: Whether to silently ignore
+        options, values of which could not be resolved (e.g. due to exceptions
+        in directives such as file:, attr:, etc.).
+        If False exceptions are propagated as expected.
+    :rtype: list
+    """
+    options = ConfigOptionsHandler(
+        distribution, command_options, ignore_option_errors)
+    options.parse()
+
+    meta = ConfigMetadataHandler(
+        distribution.metadata, command_options, ignore_option_errors,
+        distribution.package_dir)
+    meta.parse()
+
+    return meta, options
+
+
+class ConfigHandler:
+    """Handles metadata supplied in configuration files."""
+
+    section_prefix = None
+    """Prefix for config sections handled by this handler.
+    Must be provided by class heirs.
+
+    """
+
+    aliases = {}
+    """Options aliases.
+    For compatibility with various packages. E.g.: d2to1 and pbr.
+    Note: `-` in keys is replaced with `_` by config parser.
+
+    """
+
+    def __init__(self, target_obj, options, ignore_option_errors=False):
+        sections = {}
+
+        section_prefix = self.section_prefix
+        for section_name, section_options in options.items():
+            if not section_name.startswith(section_prefix):
+                continue
+
+            section_name = section_name.replace(section_prefix, '').strip('.')
+            sections[section_name] = section_options
+
+        self.ignore_option_errors = ignore_option_errors
+        self.target_obj = target_obj
+        self.sections = sections
+        self.set_options = []
+
+    @property
+    def parsers(self):
+        """Metadata item name to parser function mapping."""
+        raise NotImplementedError(
+            '%s must provide .parsers property' % self.__class__.__name__)
+
+    def __setitem__(self, option_name, value):
+        unknown = tuple()
+        target_obj = self.target_obj
+
+        # Translate alias into real name.
+        option_name = self.aliases.get(option_name, option_name)
+
+        current_value = getattr(target_obj, option_name, unknown)
+
+        if current_value is unknown:
+            raise KeyError(option_name)
+
+        if current_value:
+            # Already inhabited. Skipping.
+            return
+
+        skip_option = False
+        parser = self.parsers.get(option_name)
+        if parser:
+            try:
+                value = parser(value)
+
+            except Exception:
+                skip_option = True
+                if not self.ignore_option_errors:
+                    raise
+
+        if skip_option:
+            return
+
+        setter = getattr(target_obj, 'set_%s' % option_name, None)
+        if setter is None:
+            setattr(target_obj, option_name, value)
+        else:
+            setter(value)
+
+        self.set_options.append(option_name)
+
+    @classmethod
+    def _parse_list(cls, value, separator=','):
+        """Represents value as a list.
+
+        Value is split either by separator (defaults to comma) or by lines.
+
+        :param value:
+        :param separator: List items separator character.
+        :rtype: list
+        """
+        if isinstance(value, list):  # _get_parser_compound case
+            return value
+
+        if '\n' in value:
+            value = value.splitlines()
+        else:
+            value = value.split(separator)
+
+        return [chunk.strip() for chunk in value if chunk.strip()]
+
+    @classmethod
+    def _parse_dict(cls, value):
+        """Represents value as a dict.
+
+        :param value:
+        :rtype: dict
+        """
+        separator = '='
+        result = {}
+        for line in cls._parse_list(value):
+            key, sep, val = line.partition(separator)
+            if sep != separator:
+                raise DistutilsOptionError(
+                    'Unable to parse option value to dict: %s' % value)
+            result[key.strip()] = val.strip()
+
+        return result
+
+    @classmethod
+    def _parse_bool(cls, value):
+        """Represents value as boolean.
+
+        :param value:
+        :rtype: bool
+        """
+        value = value.lower()
+        return value in ('1', 'true', 'yes')
+
+    @classmethod
+    def _exclude_files_parser(cls, key):
+        """Returns a parser function to make sure field inputs
+        are not files.
+
+        Parses a value after getting the key so error messages are
+        more informative.
+
+        :param key:
+        :rtype: callable
+        """
+        def parser(value):
+            exclude_directive = 'file:'
+            if value.startswith(exclude_directive):
+                raise ValueError(
+                    'Only strings are accepted for the {0} field, '
+                    'files are not accepted'.format(key))
+            return value
+        return parser
+
+    @classmethod
+    def _parse_file(cls, value):
+        """Represents value as a string, allowing including text
+        from nearest files using `file:` directive.
+
+        Directive is sandboxed and won't reach anything outside
+        directory with setup.py.
+
+        Examples:
+            file: README.rst, CHANGELOG.md, src/file.txt
+
+        :param str value:
+        :rtype: str
+        """
+        include_directive = 'file:'
+
+        if not isinstance(value, str):
+            return value
+
+        if not value.startswith(include_directive):
+            return value
+
+        spec = value[len(include_directive):]
+        filepaths = (os.path.abspath(path.strip()) for path in spec.split(','))
+        return '\n'.join(
+            cls._read_file(path)
+            for path in filepaths
+            if (cls._assert_local(path) or True)
+            and os.path.isfile(path)
+        )
+
+    @staticmethod
+    def _assert_local(filepath):
+        if not filepath.startswith(os.getcwd()):
+            raise DistutilsOptionError(
+                '`file:` directive can not access %s' % filepath)
+
+    @staticmethod
+    def _read_file(filepath):
+        with io.open(filepath, encoding='utf-8') as f:
+            return f.read()
+
+    @classmethod
+    def _parse_attr(cls, value, package_dir=None):
+        """Represents value as a module attribute.
+
+        Examples:
+            attr: package.attr
+            attr: package.module.attr
+
+        :param str value:
+        :rtype: str
+        """
+        attr_directive = 'attr:'
+        if not value.startswith(attr_directive):
+            return value
+
+        attrs_path = value.replace(attr_directive, '').strip().split('.')
+        attr_name = attrs_path.pop()
+
+        module_name = '.'.join(attrs_path)
+        module_name = module_name or '__init__'
+
+        parent_path = os.getcwd()
+        if package_dir:
+            if attrs_path[0] in package_dir:
+                # A custom path was specified for the module we want to import
+                custom_path = package_dir[attrs_path[0]]
+                parts = custom_path.rsplit('/', 1)
+                if len(parts) > 1:
+                    parent_path = os.path.join(os.getcwd(), parts[0])
+                    module_name = parts[1]
+                else:
+                    module_name = custom_path
+            elif '' in package_dir:
+                # A custom parent directory was specified for all root modules
+                parent_path = os.path.join(os.getcwd(), package_dir[''])
+
+        with patch_path(parent_path):
+            try:
+                # attempt to load value statically
+                return getattr(StaticModule(module_name), attr_name)
+            except Exception:
+                # fallback to simple import
+                module = importlib.import_module(module_name)
+
+        return getattr(module, attr_name)
+
+    @classmethod
+    def _get_parser_compound(cls, *parse_methods):
+        """Returns parser function to represents value as a list.
+
+        Parses a value applying given methods one after another.
+
+        :param parse_methods:
+        :rtype: callable
+        """
+        def parse(value):
+            parsed = value
+
+            for method in parse_methods:
+                parsed = method(parsed)
+
+            return parsed
+
+        return parse
+
+    @classmethod
+    def _parse_section_to_dict(cls, section_options, values_parser=None):
+        """Parses section options into a dictionary.
+
+        Optionally applies a given parser to values.
+
+        :param dict section_options:
+        :param callable values_parser:
+        :rtype: dict
+        """
+        value = {}
+        values_parser = values_parser or (lambda val: val)
+        for key, (_, val) in section_options.items():
+            value[key] = values_parser(val)
+        return value
+
+    def parse_section(self, section_options):
+        """Parses configuration file section.
+
+        :param dict section_options:
+        """
+        for (name, (_, value)) in section_options.items():
+            try:
+                self[name] = value
+
+            except KeyError:
+                pass  # Keep silent for a new option may appear anytime.
+
+    def parse(self):
+        """Parses configuration file items from one
+        or more related sections.
+
+        """
+        for section_name, section_options in self.sections.items():
+
+            method_postfix = ''
+            if section_name:  # [section.option] variant
+                method_postfix = '_%s' % section_name
+
+            section_parser_method = getattr(
+                self,
+                # Dots in section names are translated into dunderscores.
+                ('parse_section%s' % method_postfix).replace('.', '__'),
+                None)
+
+            if section_parser_method is None:
+                raise DistutilsOptionError(
+                    'Unsupported distribution option section: [%s.%s]' % (
+                        self.section_prefix, section_name))
+
+            section_parser_method(section_options)
+
+    def _deprecated_config_handler(self, func, msg, warning_class):
+        """ this function will wrap around parameters that are deprecated
+
+        :param msg: deprecation message
+        :param warning_class: class of warning exception to be raised
+        :param func: function to be wrapped around
+        """
+        @wraps(func)
+        def config_handler(*args, **kwargs):
+            warnings.warn(msg, warning_class)
+            return func(*args, **kwargs)
+
+        return config_handler
+
+
+class ConfigMetadataHandler(ConfigHandler):
+
+    section_prefix = 'metadata'
+
+    aliases = {
+        'home_page': 'url',
+        'summary': 'description',
+        'classifier': 'classifiers',
+        'platform': 'platforms',
+    }
+
+    strict_mode = False
+    """We need to keep it loose, to be partially compatible with
+    `pbr` and `d2to1` packages which also uses `metadata` section.
+
+    """
+
+    def __init__(self, target_obj, options, ignore_option_errors=False,
+                 package_dir=None):
+        super(ConfigMetadataHandler, self).__init__(target_obj, options,
+                                                    ignore_option_errors)
+        self.package_dir = package_dir
+
+    @property
+    def parsers(self):
+        """Metadata item name to parser function mapping."""
+        parse_list = self._parse_list
+        parse_file = self._parse_file
+        parse_dict = self._parse_dict
+        exclude_files_parser = self._exclude_files_parser
+
+        return {
+            'platforms': parse_list,
+            'keywords': parse_list,
+            'provides': parse_list,
+            'requires': self._deprecated_config_handler(
+                parse_list,
+                "The requires parameter is deprecated, please use "
+                "install_requires for runtime dependencies.",
+                DeprecationWarning),
+            'obsoletes': parse_list,
+            'classifiers': self._get_parser_compound(parse_file, parse_list),
+            'license': exclude_files_parser('license'),
+            'license_files': parse_list,
+            'description': parse_file,
+            'long_description': parse_file,
+            'version': self._parse_version,
+            'project_urls': parse_dict,
+        }
+
+    def _parse_version(self, value):
+        """Parses `version` option value.
+
+        :param value:
+        :rtype: str
+
+        """
+        version = self._parse_file(value)
+
+        if version != value:
+            version = version.strip()
+            # Be strict about versions loaded from file because it's easy to
+            # accidentally include newlines and other unintended content
+            if isinstance(parse(version), LegacyVersion):
+                tmpl = (
+                    'Version loaded from {value} does not '
+                    'comply with PEP 440: {version}'
+                )
+                raise DistutilsOptionError(tmpl.format(**locals()))
+
+            return version
+
+        version = self._parse_attr(value, self.package_dir)
+
+        if callable(version):
+            version = version()
+
+        if not isinstance(version, str):
+            if hasattr(version, '__iter__'):
+                version = '.'.join(map(str, version))
+            else:
+                version = '%s' % version
+
+        return version
+
+
+class ConfigOptionsHandler(ConfigHandler):
+
+    section_prefix = 'options'
+
+    @property
+    def parsers(self):
+        """Metadata item name to parser function mapping."""
+        parse_list = self._parse_list
+        parse_list_semicolon = partial(self._parse_list, separator=';')
+        parse_bool = self._parse_bool
+        parse_dict = self._parse_dict
+
+        return {
+            'zip_safe': parse_bool,
+            'use_2to3': parse_bool,
+            'include_package_data': parse_bool,
+            'package_dir': parse_dict,
+            'use_2to3_fixers': parse_list,
+            'use_2to3_exclude_fixers': parse_list,
+            'convert_2to3_doctests': parse_list,
+            'scripts': parse_list,
+            'eager_resources': parse_list,
+            'dependency_links': parse_list,
+            'namespace_packages': parse_list,
+            'install_requires': parse_list_semicolon,
+            'setup_requires': parse_list_semicolon,
+            'tests_require': parse_list_semicolon,
+            'packages': self._parse_packages,
+            'entry_points': self._parse_file,
+            'py_modules': parse_list,
+            'python_requires': SpecifierSet,
+        }
+
+    def _parse_packages(self, value):
+        """Parses `packages` option value.
+
+        :param value:
+        :rtype: list
+        """
+        find_directives = ['find:', 'find_namespace:']
+        trimmed_value = value.strip()
+
+        if trimmed_value not in find_directives:
+            return self._parse_list(value)
+
+        findns = trimmed_value == find_directives[1]
+
+        # Read function arguments from a dedicated section.
+        find_kwargs = self.parse_section_packages__find(
+            self.sections.get('packages.find', {}))
+
+        if findns:
+            from setuptools import find_namespace_packages as find_packages
+        else:
+            from setuptools import find_packages
+
+        return find_packages(**find_kwargs)
+
+    def parse_section_packages__find(self, section_options):
+        """Parses `packages.find` configuration file section.
+
+        To be used in conjunction with _parse_packages().
+
+        :param dict section_options:
+        """
+        section_data = self._parse_section_to_dict(
+            section_options, self._parse_list)
+
+        valid_keys = ['where', 'include', 'exclude']
+
+        find_kwargs = dict(
+            [(k, v) for k, v in section_data.items() if k in valid_keys and v])
+
+        where = find_kwargs.get('where')
+        if where is not None:
+            find_kwargs['where'] = where[0]  # cast list to single val
+
+        return find_kwargs
+
+    def parse_section_entry_points(self, section_options):
+        """Parses `entry_points` configuration file section.
+
+        :param dict section_options:
+        """
+        parsed = self._parse_section_to_dict(section_options, self._parse_list)
+        self['entry_points'] = parsed
+
+    def _parse_package_data(self, section_options):
+        parsed = self._parse_section_to_dict(section_options, self._parse_list)
+
+        root = parsed.get('*')
+        if root:
+            parsed[''] = root
+            del parsed['*']
+
+        return parsed
+
+    def parse_section_package_data(self, section_options):
+        """Parses `package_data` configuration file section.
+
+        :param dict section_options:
+        """
+        self['package_data'] = self._parse_package_data(section_options)
+
+    def parse_section_exclude_package_data(self, section_options):
+        """Parses `exclude_package_data` configuration file section.
+
+        :param dict section_options:
+        """
+        self['exclude_package_data'] = self._parse_package_data(
+            section_options)
+
+    def parse_section_extras_require(self, section_options):
+        """Parses `extras_require` configuration file section.
+
+        :param dict section_options:
+        """
+        parse_list = partial(self._parse_list, separator=';')
+        self['extras_require'] = self._parse_section_to_dict(
+            section_options, parse_list)
+
+    def parse_section_data_files(self, section_options):
+        """Parses `data_files` configuration file section.
+
+        :param dict section_options:
+        """
+        parsed = self._parse_section_to_dict(section_options, self._parse_list)
+        self['data_files'] = [(k, v) for k, v in parsed.items()]
diff --git a/venv/Lib/site-packages/setuptools/dep_util.py b/venv/Lib/site-packages/setuptools/dep_util.py
new file mode 100644
index 000000000..521eb716a
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/dep_util.py
@@ -0,0 +1,25 @@
+from distutils.dep_util import newer_group
+
+
+# yes, this is was almost entirely copy-pasted from
+# 'newer_pairwise()', this is just another convenience
+# function.
+def newer_pairwise_group(sources_groups, targets):
+    """Walk both arguments in parallel, testing if each source group is newer
+    than its corresponding target. Returns a pair of lists (sources_groups,
+    targets) where sources is newer than target, according to the semantics
+    of 'newer_group()'.
+    """
+    if len(sources_groups) != len(targets):
+        raise ValueError(
+            "'sources_group' and 'targets' must be the same length")
+
+    # build a pair of lists (sources_groups, targets) where source is newer
+    n_sources = []
+    n_targets = []
+    for i in range(len(sources_groups)):
+        if newer_group(sources_groups[i], targets[i]):
+            n_sources.append(sources_groups[i])
+            n_targets.append(targets[i])
+
+    return n_sources, n_targets
diff --git a/venv/Lib/site-packages/setuptools/depends.py b/venv/Lib/site-packages/setuptools/depends.py
new file mode 100644
index 000000000..8be6928a3
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/depends.py
@@ -0,0 +1,175 @@
+import sys
+import marshal
+import contextlib
+import dis
+from distutils.version import StrictVersion
+
+from ._imp import find_module, PY_COMPILED, PY_FROZEN, PY_SOURCE
+from . import _imp
+
+
+__all__ = [
+    'Require', 'find_module', 'get_module_constant', 'extract_constant'
+]
+
+
+class Require:
+    """A prerequisite to building or installing a distribution"""
+
+    def __init__(
+            self, name, requested_version, module, homepage='',
+            attribute=None, format=None):
+
+        if format is None and requested_version is not None:
+            format = StrictVersion
+
+        if format is not None:
+            requested_version = format(requested_version)
+            if attribute is None:
+                attribute = '__version__'
+
+        self.__dict__.update(locals())
+        del self.self
+
+    def full_name(self):
+        """Return full package/distribution name, w/version"""
+        if self.requested_version is not None:
+            return '%s-%s' % (self.name, self.requested_version)
+        return self.name
+
+    def version_ok(self, version):
+        """Is 'version' sufficiently up-to-date?"""
+        return self.attribute is None or self.format is None or \
+            str(version) != "unknown" and version >= self.requested_version
+
+    def get_version(self, paths=None, default="unknown"):
+        """Get version number of installed module, 'None', or 'default'
+
+        Search 'paths' for module.  If not found, return 'None'.  If found,
+        return the extracted version attribute, or 'default' if no version
+        attribute was specified, or the value cannot be determined without
+        importing the module.  The version is formatted according to the
+        requirement's version format (if any), unless it is 'None' or the
+        supplied 'default'.
+        """
+
+        if self.attribute is None:
+            try:
+                f, p, i = find_module(self.module, paths)
+                if f:
+                    f.close()
+                return default
+            except ImportError:
+                return None
+
+        v = get_module_constant(self.module, self.attribute, default, paths)
+
+        if v is not None and v is not default and self.format is not None:
+            return self.format(v)
+
+        return v
+
+    def is_present(self, paths=None):
+        """Return true if dependency is present on 'paths'"""
+        return self.get_version(paths) is not None
+
+    def is_current(self, paths=None):
+        """Return true if dependency is present and up-to-date on 'paths'"""
+        version = self.get_version(paths)
+        if version is None:
+            return False
+        return self.version_ok(version)
+
+
+def maybe_close(f):
+    @contextlib.contextmanager
+    def empty():
+        yield
+        return
+    if not f:
+        return empty()
+
+    return contextlib.closing(f)
+
+
+def get_module_constant(module, symbol, default=-1, paths=None):
+    """Find 'module' by searching 'paths', and extract 'symbol'
+
+    Return 'None' if 'module' does not exist on 'paths', or it does not define
+    'symbol'.  If the module defines 'symbol' as a constant, return the
+    constant.  Otherwise, return 'default'."""
+
+    try:
+        f, path, (suffix, mode, kind) = info = find_module(module, paths)
+    except ImportError:
+        # Module doesn't exist
+        return None
+
+    with maybe_close(f):
+        if kind == PY_COMPILED:
+            f.read(8)  # skip magic & date
+            code = marshal.load(f)
+        elif kind == PY_FROZEN:
+            code = _imp.get_frozen_object(module, paths)
+        elif kind == PY_SOURCE:
+            code = compile(f.read(), path, 'exec')
+        else:
+            # Not something we can parse; we'll have to import it.  :(
+            imported = _imp.get_module(module, paths, info)
+            return getattr(imported, symbol, None)
+
+    return extract_constant(code, symbol, default)
+
+
+def extract_constant(code, symbol, default=-1):
+    """Extract the constant value of 'symbol' from 'code'
+
+    If the name 'symbol' is bound to a constant value by the Python code
+    object 'code', return that value.  If 'symbol' is bound to an expression,
+    return 'default'.  Otherwise, return 'None'.
+
+    Return value is based on the first assignment to 'symbol'.  'symbol' must
+    be a global, or at least a non-"fast" local in the code block.  That is,
+    only 'STORE_NAME' and 'STORE_GLOBAL' opcodes are checked, and 'symbol'
+    must be present in 'code.co_names'.
+    """
+    if symbol not in code.co_names:
+        # name's not there, can't possibly be an assignment
+        return None
+
+    name_idx = list(code.co_names).index(symbol)
+
+    STORE_NAME = 90
+    STORE_GLOBAL = 97
+    LOAD_CONST = 100
+
+    const = default
+
+    for byte_code in dis.Bytecode(code):
+        op = byte_code.opcode
+        arg = byte_code.arg
+
+        if op == LOAD_CONST:
+            const = code.co_consts[arg]
+        elif arg == name_idx and (op == STORE_NAME or op == STORE_GLOBAL):
+            return const
+        else:
+            const = default
+
+
+def _update_globals():
+    """
+    Patch the globals to remove the objects not available on some platforms.
+
+    XXX it'd be better to test assertions about bytecode instead.
+    """
+
+    if not sys.platform.startswith('java') and sys.platform != 'cli':
+        return
+    incompatible = 'extract_constant', 'get_module_constant'
+    for name in incompatible:
+        del globals()[name]
+        __all__.remove(name)
+
+
+_update_globals()
diff --git a/venv/Lib/site-packages/setuptools/dist.py b/venv/Lib/site-packages/setuptools/dist.py
new file mode 100644
index 000000000..2c088ef8c
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/dist.py
@@ -0,0 +1,1009 @@
+# -*- coding: utf-8 -*-
+__all__ = ['Distribution']
+
+import io
+import sys
+import re
+import os
+import warnings
+import numbers
+import distutils.log
+import distutils.core
+import distutils.cmd
+import distutils.dist
+from distutils.util import strtobool
+from distutils.debug import DEBUG
+from distutils.fancy_getopt import translate_longopt
+import itertools
+
+from collections import defaultdict
+from email import message_from_file
+
+from distutils.errors import DistutilsOptionError, DistutilsSetupError
+from distutils.util import rfc822_escape
+from distutils.version import StrictVersion
+
+from setuptools.extern import packaging
+from setuptools.extern import ordered_set
+
+from . import SetuptoolsDeprecationWarning
+
+import setuptools
+from setuptools import windows_support
+from setuptools.monkey import get_unpatched
+from setuptools.config import parse_configuration
+import pkg_resources
+
+__import__('setuptools.extern.packaging.specifiers')
+__import__('setuptools.extern.packaging.version')
+
+
+def _get_unpatched(cls):
+    warnings.warn("Do not call this function", DistDeprecationWarning)
+    return get_unpatched(cls)
+
+
+def get_metadata_version(self):
+    mv = getattr(self, 'metadata_version', None)
+
+    if mv is None:
+        if self.long_description_content_type or self.provides_extras:
+            mv = StrictVersion('2.1')
+        elif (self.maintainer is not None or
+              self.maintainer_email is not None or
+              getattr(self, 'python_requires', None) is not None or
+              self.project_urls):
+            mv = StrictVersion('1.2')
+        elif (self.provides or self.requires or self.obsoletes or
+                self.classifiers or self.download_url):
+            mv = StrictVersion('1.1')
+        else:
+            mv = StrictVersion('1.0')
+
+        self.metadata_version = mv
+
+    return mv
+
+
+def read_pkg_file(self, file):
+    """Reads the metadata values from a file object."""
+    msg = message_from_file(file)
+
+    def _read_field(name):
+        value = msg[name]
+        if value == 'UNKNOWN':
+            return None
+        return value
+
+    def _read_list(name):
+        values = msg.get_all(name, None)
+        if values == []:
+            return None
+        return values
+
+    self.metadata_version = StrictVersion(msg['metadata-version'])
+    self.name = _read_field('name')
+    self.version = _read_field('version')
+    self.description = _read_field('summary')
+    # we are filling author only.
+    self.author = _read_field('author')
+    self.maintainer = None
+    self.author_email = _read_field('author-email')
+    self.maintainer_email = None
+    self.url = _read_field('home-page')
+    self.license = _read_field('license')
+
+    if 'download-url' in msg:
+        self.download_url = _read_field('download-url')
+    else:
+        self.download_url = None
+
+    self.long_description = _read_field('description')
+    self.description = _read_field('summary')
+
+    if 'keywords' in msg:
+        self.keywords = _read_field('keywords').split(',')
+
+    self.platforms = _read_list('platform')
+    self.classifiers = _read_list('classifier')
+
+    # PEP 314 - these fields only exist in 1.1
+    if self.metadata_version == StrictVersion('1.1'):
+        self.requires = _read_list('requires')
+        self.provides = _read_list('provides')
+        self.obsoletes = _read_list('obsoletes')
+    else:
+        self.requires = None
+        self.provides = None
+        self.obsoletes = None
+
+
+# Based on Python 3.5 version
+def write_pkg_file(self, file):
+    """Write the PKG-INFO format data to a file object.
+    """
+    version = self.get_metadata_version()
+
+    def write_field(key, value):
+        file.write("%s: %s\n" % (key, value))
+
+    write_field('Metadata-Version', str(version))
+    write_field('Name', self.get_name())
+    write_field('Version', self.get_version())
+    write_field('Summary', self.get_description())
+    write_field('Home-page', self.get_url())
+
+    if version < StrictVersion('1.2'):
+        write_field('Author', self.get_contact())
+        write_field('Author-email', self.get_contact_email())
+    else:
+        optional_fields = (
+            ('Author', 'author'),
+            ('Author-email', 'author_email'),
+            ('Maintainer', 'maintainer'),
+            ('Maintainer-email', 'maintainer_email'),
+        )
+
+        for field, attr in optional_fields:
+            attr_val = getattr(self, attr)
+
+            if attr_val is not None:
+                write_field(field, attr_val)
+
+    write_field('License', self.get_license())
+    if self.download_url:
+        write_field('Download-URL', self.download_url)
+    for project_url in self.project_urls.items():
+        write_field('Project-URL', '%s, %s' % project_url)
+
+    long_desc = rfc822_escape(self.get_long_description())
+    write_field('Description', long_desc)
+
+    keywords = ','.join(self.get_keywords())
+    if keywords:
+        write_field('Keywords', keywords)
+
+    if version >= StrictVersion('1.2'):
+        for platform in self.get_platforms():
+            write_field('Platform', platform)
+    else:
+        self._write_list(file, 'Platform', self.get_platforms())
+
+    self._write_list(file, 'Classifier', self.get_classifiers())
+
+    # PEP 314
+    self._write_list(file, 'Requires', self.get_requires())
+    self._write_list(file, 'Provides', self.get_provides())
+    self._write_list(file, 'Obsoletes', self.get_obsoletes())
+
+    # Setuptools specific for PEP 345
+    if hasattr(self, 'python_requires'):
+        write_field('Requires-Python', self.python_requires)
+
+    # PEP 566
+    if self.long_description_content_type:
+        write_field(
+            'Description-Content-Type',
+            self.long_description_content_type
+        )
+    if self.provides_extras:
+        for extra in self.provides_extras:
+            write_field('Provides-Extra', extra)
+
+
+sequence = tuple, list
+
+
+def check_importable(dist, attr, value):
+    try:
+        ep = pkg_resources.EntryPoint.parse('x=' + value)
+        assert not ep.extras
+    except (TypeError, ValueError, AttributeError, AssertionError) as e:
+        raise DistutilsSetupError(
+            "%r must be importable 'module:attrs' string (got %r)"
+            % (attr, value)
+        ) from e
+
+
+def assert_string_list(dist, attr, value):
+    """Verify that value is a string list"""
+    try:
+        # verify that value is a list or tuple to exclude unordered
+        # or single-use iterables
+        assert isinstance(value, (list, tuple))
+        # verify that elements of value are strings
+        assert ''.join(value) != value
+    except (TypeError, ValueError, AttributeError, AssertionError) as e:
+        raise DistutilsSetupError(
+            "%r must be a list of strings (got %r)" % (attr, value)
+        ) from e
+
+
+def check_nsp(dist, attr, value):
+    """Verify that namespace packages are valid"""
+    ns_packages = value
+    assert_string_list(dist, attr, ns_packages)
+    for nsp in ns_packages:
+        if not dist.has_contents_for(nsp):
+            raise DistutilsSetupError(
+                "Distribution contains no modules or packages for " +
+                "namespace package %r" % nsp
+            )
+        parent, sep, child = nsp.rpartition('.')
+        if parent and parent not in ns_packages:
+            distutils.log.warn(
+                "WARNING: %r is declared as a package namespace, but %r"
+                " is not: please correct this in setup.py", nsp, parent
+            )
+
+
+def check_extras(dist, attr, value):
+    """Verify that extras_require mapping is valid"""
+    try:
+        list(itertools.starmap(_check_extra, value.items()))
+    except (TypeError, ValueError, AttributeError) as e:
+        raise DistutilsSetupError(
+            "'extras_require' must be a dictionary whose values are "
+            "strings or lists of strings containing valid project/version "
+            "requirement specifiers."
+        ) from e
+
+
+def _check_extra(extra, reqs):
+    name, sep, marker = extra.partition(':')
+    if marker and pkg_resources.invalid_marker(marker):
+        raise DistutilsSetupError("Invalid environment marker: " + marker)
+    list(pkg_resources.parse_requirements(reqs))
+
+
+def assert_bool(dist, attr, value):
+    """Verify that value is True, False, 0, or 1"""
+    if bool(value) != value:
+        tmpl = "{attr!r} must be a boolean value (got {value!r})"
+        raise DistutilsSetupError(tmpl.format(attr=attr, value=value))
+
+
+def check_requirements(dist, attr, value):
+    """Verify that install_requires is a valid requirements list"""
+    try:
+        list(pkg_resources.parse_requirements(value))
+        if isinstance(value, (dict, set)):
+            raise TypeError("Unordered types are not allowed")
+    except (TypeError, ValueError) as error:
+        tmpl = (
+            "{attr!r} must be a string or list of strings "
+            "containing valid project/version requirement specifiers; {error}"
+        )
+        raise DistutilsSetupError(
+            tmpl.format(attr=attr, error=error)
+        ) from error
+
+
+def check_specifier(dist, attr, value):
+    """Verify that value is a valid version specifier"""
+    try:
+        packaging.specifiers.SpecifierSet(value)
+    except packaging.specifiers.InvalidSpecifier as error:
+        tmpl = (
+            "{attr!r} must be a string "
+            "containing valid version specifiers; {error}"
+        )
+        raise DistutilsSetupError(
+            tmpl.format(attr=attr, error=error)
+        ) from error
+
+
+def check_entry_points(dist, attr, value):
+    """Verify that entry_points map is parseable"""
+    try:
+        pkg_resources.EntryPoint.parse_map(value)
+    except ValueError as e:
+        raise DistutilsSetupError(e) from e
+
+
+def check_test_suite(dist, attr, value):
+    if not isinstance(value, str):
+        raise DistutilsSetupError("test_suite must be a string")
+
+
+def check_package_data(dist, attr, value):
+    """Verify that value is a dictionary of package names to glob lists"""
+    if not isinstance(value, dict):
+        raise DistutilsSetupError(
+            "{!r} must be a dictionary mapping package names to lists of "
+            "string wildcard patterns".format(attr))
+    for k, v in value.items():
+        if not isinstance(k, str):
+            raise DistutilsSetupError(
+                "keys of {!r} dict must be strings (got {!r})"
+                .format(attr, k)
+            )
+        assert_string_list(dist, 'values of {!r} dict'.format(attr), v)
+
+
+def check_packages(dist, attr, value):
+    for pkgname in value:
+        if not re.match(r'\w+(\.\w+)*', pkgname):
+            distutils.log.warn(
+                "WARNING: %r not a valid package name; please use only "
+                ".-separated package names in setup.py", pkgname
+            )
+
+
+_Distribution = get_unpatched(distutils.core.Distribution)
+
+
+class Distribution(_Distribution):
+    """Distribution with support for tests and package data
+
+    This is an enhanced version of 'distutils.dist.Distribution' that
+    effectively adds the following new optional keyword arguments to 'setup()':
+
+     'install_requires' -- a string or sequence of strings specifying project
+        versions that the distribution requires when installed, in the format
+        used by 'pkg_resources.require()'.  They will be installed
+        automatically when the package is installed.  If you wish to use
+        packages that are not available in PyPI, or want to give your users an
+        alternate download location, you can add a 'find_links' option to the
+        '[easy_install]' section of your project's 'setup.cfg' file, and then
+        setuptools will scan the listed web pages for links that satisfy the
+        requirements.
+
+     'extras_require' -- a dictionary mapping names of optional "extras" to the
+        additional requirement(s) that using those extras incurs. For example,
+        this::
+
+            extras_require = dict(reST = ["docutils>=0.3", "reSTedit"])
+
+        indicates that the distribution can optionally provide an extra
+        capability called "reST", but it can only be used if docutils and
+        reSTedit are installed.  If the user installs your package using
+        EasyInstall and requests one of your extras, the corresponding
+        additional requirements will be installed if needed.
+
+     'test_suite' -- the name of a test suite to run for the 'test' command.
+        If the user runs 'python setup.py test', the package will be installed,
+        and the named test suite will be run.  The format is the same as
+        would be used on a 'unittest.py' command line.  That is, it is the
+        dotted name of an object to import and call to generate a test suite.
+
+     'package_data' -- a dictionary mapping package names to lists of filenames
+        or globs to use to find data files contained in the named packages.
+        If the dictionary has filenames or globs listed under '""' (the empty
+        string), those names will be searched for in every package, in addition
+        to any names for the specific package.  Data files found using these
+        names/globs will be installed along with the package, in the same
+        location as the package.  Note that globs are allowed to reference
+        the contents of non-package subdirectories, as long as you use '/' as
+        a path separator.  (Globs are automatically converted to
+        platform-specific paths at runtime.)
+
+    In addition to these new keywords, this class also has several new methods
+    for manipulating the distribution's contents.  For example, the 'include()'
+    and 'exclude()' methods can be thought of as in-place add and subtract
+    commands that add or remove packages, modules, extensions, and so on from
+    the distribution.
+    """
+
+    _DISTUTILS_UNSUPPORTED_METADATA = {
+        'long_description_content_type': None,
+        'project_urls': dict,
+        'provides_extras': ordered_set.OrderedSet,
+        'license_files': ordered_set.OrderedSet,
+    }
+
+    _patched_dist = None
+
+    def patch_missing_pkg_info(self, attrs):
+        # Fake up a replacement for the data that would normally come from
+        # PKG-INFO, but which might not yet be built if this is a fresh
+        # checkout.
+        #
+        if not attrs or 'name' not in attrs or 'version' not in attrs:
+            return
+        key = pkg_resources.safe_name(str(attrs['name'])).lower()
+        dist = pkg_resources.working_set.by_key.get(key)
+        if dist is not None and not dist.has_metadata('PKG-INFO'):
+            dist._version = pkg_resources.safe_version(str(attrs['version']))
+            self._patched_dist = dist
+
+    def __init__(self, attrs=None):
+        have_package_data = hasattr(self, "package_data")
+        if not have_package_data:
+            self.package_data = {}
+        attrs = attrs or {}
+        self.dist_files = []
+        # Filter-out setuptools' specific options.
+        self.src_root = attrs.pop("src_root", None)
+        self.patch_missing_pkg_info(attrs)
+        self.dependency_links = attrs.pop('dependency_links', [])
+        self.setup_requires = attrs.pop('setup_requires', [])
+        for ep in pkg_resources.iter_entry_points('distutils.setup_keywords'):
+            vars(self).setdefault(ep.name, None)
+        _Distribution.__init__(self, {
+            k: v for k, v in attrs.items()
+            if k not in self._DISTUTILS_UNSUPPORTED_METADATA
+        })
+
+        # Fill-in missing metadata fields not supported by distutils.
+        # Note some fields may have been set by other tools (e.g. pbr)
+        # above; they are taken preferrentially to setup() arguments
+        for option, default in self._DISTUTILS_UNSUPPORTED_METADATA.items():
+            for source in self.metadata.__dict__, attrs:
+                if option in source:
+                    value = source[option]
+                    break
+            else:
+                value = default() if default else None
+            setattr(self.metadata, option, value)
+
+        self.metadata.version = self._normalize_version(
+            self._validate_version(self.metadata.version))
+        self._finalize_requires()
+
+    @staticmethod
+    def _normalize_version(version):
+        if isinstance(version, setuptools.sic) or version is None:
+            return version
+
+        normalized = str(packaging.version.Version(version))
+        if version != normalized:
+            tmpl = "Normalizing '{version}' to '{normalized}'"
+            warnings.warn(tmpl.format(**locals()))
+            return normalized
+        return version
+
+    @staticmethod
+    def _validate_version(version):
+        if isinstance(version, numbers.Number):
+            # Some people apparently take "version number" too literally :)
+            version = str(version)
+
+        if version is not None:
+            try:
+                packaging.version.Version(version)
+            except (packaging.version.InvalidVersion, TypeError):
+                warnings.warn(
+                    "The version specified (%r) is an invalid version, this "
+                    "may not work as expected with newer versions of "
+                    "setuptools, pip, and PyPI. Please see PEP 440 for more "
+                    "details." % version
+                )
+                return setuptools.sic(version)
+        return version
+
+    def _finalize_requires(self):
+        """
+        Set `metadata.python_requires` and fix environment markers
+        in `install_requires` and `extras_require`.
+        """
+        if getattr(self, 'python_requires', None):
+            self.metadata.python_requires = self.python_requires
+
+        if getattr(self, 'extras_require', None):
+            for extra in self.extras_require.keys():
+                # Since this gets called multiple times at points where the
+                # keys have become 'converted' extras, ensure that we are only
+                # truly adding extras we haven't seen before here.
+                extra = extra.split(':')[0]
+                if extra:
+                    self.metadata.provides_extras.add(extra)
+
+        self._convert_extras_requirements()
+        self._move_install_requirements_markers()
+
+    def _convert_extras_requirements(self):
+        """
+        Convert requirements in `extras_require` of the form
+        `"extra": ["barbazquux; {marker}"]` to
+        `"extra:{marker}": ["barbazquux"]`.
+        """
+        spec_ext_reqs = getattr(self, 'extras_require', None) or {}
+        self._tmp_extras_require = defaultdict(list)
+        for section, v in spec_ext_reqs.items():
+            # Do not strip empty sections.
+            self._tmp_extras_require[section]
+            for r in pkg_resources.parse_requirements(v):
+                suffix = self._suffix_for(r)
+                self._tmp_extras_require[section + suffix].append(r)
+
+    @staticmethod
+    def _suffix_for(req):
+        """
+        For a requirement, return the 'extras_require' suffix for
+        that requirement.
+        """
+        return ':' + str(req.marker) if req.marker else ''
+
+    def _move_install_requirements_markers(self):
+        """
+        Move requirements in `install_requires` that are using environment
+        markers `extras_require`.
+        """
+
+        # divide the install_requires into two sets, simple ones still
+        # handled by install_requires and more complex ones handled
+        # by extras_require.
+
+        def is_simple_req(req):
+            return not req.marker
+
+        spec_inst_reqs = getattr(self, 'install_requires', None) or ()
+        inst_reqs = list(pkg_resources.parse_requirements(spec_inst_reqs))
+        simple_reqs = filter(is_simple_req, inst_reqs)
+        complex_reqs = itertools.filterfalse(is_simple_req, inst_reqs)
+        self.install_requires = list(map(str, simple_reqs))
+
+        for r in complex_reqs:
+            self._tmp_extras_require[':' + str(r.marker)].append(r)
+        self.extras_require = dict(
+            (k, [str(r) for r in map(self._clean_req, v)])
+            for k, v in self._tmp_extras_require.items()
+        )
+
+    def _clean_req(self, req):
+        """
+        Given a Requirement, remove environment markers and return it.
+        """
+        req.marker = None
+        return req
+
+    def _parse_config_files(self, filenames=None):
+        """
+        Adapted from distutils.dist.Distribution.parse_config_files,
+        this method provides the same functionality in subtly-improved
+        ways.
+        """
+        from configparser import ConfigParser
+
+        # Ignore install directory options if we have a venv
+        if sys.prefix != sys.base_prefix:
+            ignore_options = [
+                'install-base', 'install-platbase', 'install-lib',
+                'install-platlib', 'install-purelib', 'install-headers',
+                'install-scripts', 'install-data', 'prefix', 'exec-prefix',
+                'home', 'user', 'root']
+        else:
+            ignore_options = []
+
+        ignore_options = frozenset(ignore_options)
+
+        if filenames is None:
+            filenames = self.find_config_files()
+
+        if DEBUG:
+            self.announce("Distribution.parse_config_files():")
+
+        parser = ConfigParser()
+        for filename in filenames:
+            with io.open(filename, encoding='utf-8') as reader:
+                if DEBUG:
+                    self.announce("  reading {filename}".format(**locals()))
+                parser.read_file(reader)
+            for section in parser.sections():
+                options = parser.options(section)
+                opt_dict = self.get_option_dict(section)
+
+                for opt in options:
+                    if opt != '__name__' and opt not in ignore_options:
+                        val = parser.get(section, opt)
+                        opt = opt.replace('-', '_')
+                        opt_dict[opt] = (filename, val)
+
+            # Make the ConfigParser forget everything (so we retain
+            # the original filenames that options come from)
+            parser.__init__()
+
+        # If there was a "global" section in the config file, use it
+        # to set Distribution options.
+
+        if 'global' in self.command_options:
+            for (opt, (src, val)) in self.command_options['global'].items():
+                alias = self.negative_opt.get(opt)
+                try:
+                    if alias:
+                        setattr(self, alias, not strtobool(val))
+                    elif opt in ('verbose', 'dry_run'):  # ugh!
+                        setattr(self, opt, strtobool(val))
+                    else:
+                        setattr(self, opt, val)
+                except ValueError as e:
+                    raise DistutilsOptionError(e) from e
+
+    def _set_command_options(self, command_obj, option_dict=None):
+        """
+        Set the options for 'command_obj' from 'option_dict'.  Basically
+        this means copying elements of a dictionary ('option_dict') to
+        attributes of an instance ('command').
+
+        'command_obj' must be a Command instance.  If 'option_dict' is not
+        supplied, uses the standard option dictionary for this command
+        (from 'self.command_options').
+
+        (Adopted from distutils.dist.Distribution._set_command_options)
+        """
+        command_name = command_obj.get_command_name()
+        if option_dict is None:
+            option_dict = self.get_option_dict(command_name)
+
+        if DEBUG:
+            self.announce("  setting options for '%s' command:" % command_name)
+        for (option, (source, value)) in option_dict.items():
+            if DEBUG:
+                self.announce("    %s = %s (from %s)" % (option, value,
+                                                         source))
+            try:
+                bool_opts = [translate_longopt(o)
+                             for o in command_obj.boolean_options]
+            except AttributeError:
+                bool_opts = []
+            try:
+                neg_opt = command_obj.negative_opt
+            except AttributeError:
+                neg_opt = {}
+
+            try:
+                is_string = isinstance(value, str)
+                if option in neg_opt and is_string:
+                    setattr(command_obj, neg_opt[option], not strtobool(value))
+                elif option in bool_opts and is_string:
+                    setattr(command_obj, option, strtobool(value))
+                elif hasattr(command_obj, option):
+                    setattr(command_obj, option, value)
+                else:
+                    raise DistutilsOptionError(
+                        "error in %s: command '%s' has no such option '%s'"
+                        % (source, command_name, option))
+            except ValueError as e:
+                raise DistutilsOptionError(e) from e
+
+    def parse_config_files(self, filenames=None, ignore_option_errors=False):
+        """Parses configuration files from various levels
+        and loads configuration.
+
+        """
+        self._parse_config_files(filenames=filenames)
+
+        parse_configuration(self, self.command_options,
+                            ignore_option_errors=ignore_option_errors)
+        self._finalize_requires()
+
+    def fetch_build_eggs(self, requires):
+        """Resolve pre-setup requirements"""
+        resolved_dists = pkg_resources.working_set.resolve(
+            pkg_resources.parse_requirements(requires),
+            installer=self.fetch_build_egg,
+            replace_conflicting=True,
+        )
+        for dist in resolved_dists:
+            pkg_resources.working_set.add(dist, replace=True)
+        return resolved_dists
+
+    def finalize_options(self):
+        """
+        Allow plugins to apply arbitrary operations to the
+        distribution. Each hook may optionally define a 'order'
+        to influence the order of execution. Smaller numbers
+        go first and the default is 0.
+        """
+        group = 'setuptools.finalize_distribution_options'
+
+        def by_order(hook):
+            return getattr(hook, 'order', 0)
+        eps = map(lambda e: e.load(), pkg_resources.iter_entry_points(group))
+        for ep in sorted(eps, key=by_order):
+            ep(self)
+
+    def _finalize_setup_keywords(self):
+        for ep in pkg_resources.iter_entry_points('distutils.setup_keywords'):
+            value = getattr(self, ep.name, None)
+            if value is not None:
+                ep.require(installer=self.fetch_build_egg)
+                ep.load()(self, ep.name, value)
+
+    def _finalize_2to3_doctests(self):
+        if getattr(self, 'convert_2to3_doctests', None):
+            # XXX may convert to set here when we can rely on set being builtin
+            self.convert_2to3_doctests = [
+                os.path.abspath(p)
+                for p in self.convert_2to3_doctests
+            ]
+        else:
+            self.convert_2to3_doctests = []
+
+    def get_egg_cache_dir(self):
+        egg_cache_dir = os.path.join(os.curdir, '.eggs')
+        if not os.path.exists(egg_cache_dir):
+            os.mkdir(egg_cache_dir)
+            windows_support.hide_file(egg_cache_dir)
+            readme_txt_filename = os.path.join(egg_cache_dir, 'README.txt')
+            with open(readme_txt_filename, 'w') as f:
+                f.write('This directory contains eggs that were downloaded '
+                        'by setuptools to build, test, and run plug-ins.\n\n')
+                f.write('This directory caches those eggs to prevent '
+                        'repeated downloads.\n\n')
+                f.write('However, it is safe to delete this directory.\n\n')
+
+        return egg_cache_dir
+
+    def fetch_build_egg(self, req):
+        """Fetch an egg needed for building"""
+        from setuptools.installer import fetch_build_egg
+        return fetch_build_egg(self, req)
+
+    def get_command_class(self, command):
+        """Pluggable version of get_command_class()"""
+        if command in self.cmdclass:
+            return self.cmdclass[command]
+
+        eps = pkg_resources.iter_entry_points('distutils.commands', command)
+        for ep in eps:
+            ep.require(installer=self.fetch_build_egg)
+            self.cmdclass[command] = cmdclass = ep.load()
+            return cmdclass
+        else:
+            return _Distribution.get_command_class(self, command)
+
+    def print_commands(self):
+        for ep in pkg_resources.iter_entry_points('distutils.commands'):
+            if ep.name not in self.cmdclass:
+                # don't require extras as the commands won't be invoked
+                cmdclass = ep.resolve()
+                self.cmdclass[ep.name] = cmdclass
+        return _Distribution.print_commands(self)
+
+    def get_command_list(self):
+        for ep in pkg_resources.iter_entry_points('distutils.commands'):
+            if ep.name not in self.cmdclass:
+                # don't require extras as the commands won't be invoked
+                cmdclass = ep.resolve()
+                self.cmdclass[ep.name] = cmdclass
+        return _Distribution.get_command_list(self)
+
+    def include(self, **attrs):
+        """Add items to distribution that are named in keyword arguments
+
+        For example, 'dist.include(py_modules=["x"])' would add 'x' to
+        the distribution's 'py_modules' attribute, if it was not already
+        there.
+
+        Currently, this method only supports inclusion for attributes that are
+        lists or tuples.  If you need to add support for adding to other
+        attributes in this or a subclass, you can add an '_include_X' method,
+        where 'X' is the name of the attribute.  The method will be called with
+        the value passed to 'include()'.  So, 'dist.include(foo={"bar":"baz"})'
+        will try to call 'dist._include_foo({"bar":"baz"})', which can then
+        handle whatever special inclusion logic is needed.
+        """
+        for k, v in attrs.items():
+            include = getattr(self, '_include_' + k, None)
+            if include:
+                include(v)
+            else:
+                self._include_misc(k, v)
+
+    def exclude_package(self, package):
+        """Remove packages, modules, and extensions in named package"""
+
+        pfx = package + '.'
+        if self.packages:
+            self.packages = [
+                p for p in self.packages
+                if p != package and not p.startswith(pfx)
+            ]
+
+        if self.py_modules:
+            self.py_modules = [
+                p for p in self.py_modules
+                if p != package and not p.startswith(pfx)
+            ]
+
+        if self.ext_modules:
+            self.ext_modules = [
+                p for p in self.ext_modules
+                if p.name != package and not p.name.startswith(pfx)
+            ]
+
+    def has_contents_for(self, package):
+        """Return true if 'exclude_package(package)' would do something"""
+
+        pfx = package + '.'
+
+        for p in self.iter_distribution_names():
+            if p == package or p.startswith(pfx):
+                return True
+
+    def _exclude_misc(self, name, value):
+        """Handle 'exclude()' for list/tuple attrs without a special handler"""
+        if not isinstance(value, sequence):
+            raise DistutilsSetupError(
+                "%s: setting must be a list or tuple (%r)" % (name, value)
+            )
+        try:
+            old = getattr(self, name)
+        except AttributeError as e:
+            raise DistutilsSetupError(
+                "%s: No such distribution setting" % name
+            ) from e
+        if old is not None and not isinstance(old, sequence):
+            raise DistutilsSetupError(
+                name + ": this setting cannot be changed via include/exclude"
+            )
+        elif old:
+            setattr(self, name, [item for item in old if item not in value])
+
+    def _include_misc(self, name, value):
+        """Handle 'include()' for list/tuple attrs without a special handler"""
+
+        if not isinstance(value, sequence):
+            raise DistutilsSetupError(
+                "%s: setting must be a list (%r)" % (name, value)
+            )
+        try:
+            old = getattr(self, name)
+        except AttributeError as e:
+            raise DistutilsSetupError(
+                "%s: No such distribution setting" % name
+            ) from e
+        if old is None:
+            setattr(self, name, value)
+        elif not isinstance(old, sequence):
+            raise DistutilsSetupError(
+                name + ": this setting cannot be changed via include/exclude"
+            )
+        else:
+            new = [item for item in value if item not in old]
+            setattr(self, name, old + new)
+
+    def exclude(self, **attrs):
+        """Remove items from distribution that are named in keyword arguments
+
+        For example, 'dist.exclude(py_modules=["x"])' would remove 'x' from
+        the distribution's 'py_modules' attribute.  Excluding packages uses
+        the 'exclude_package()' method, so all of the package's contained
+        packages, modules, and extensions are also excluded.
+
+        Currently, this method only supports exclusion from attributes that are
+        lists or tuples.  If you need to add support for excluding from other
+        attributes in this or a subclass, you can add an '_exclude_X' method,
+        where 'X' is the name of the attribute.  The method will be called with
+        the value passed to 'exclude()'.  So, 'dist.exclude(foo={"bar":"baz"})'
+        will try to call 'dist._exclude_foo({"bar":"baz"})', which can then
+        handle whatever special exclusion logic is needed.
+        """
+        for k, v in attrs.items():
+            exclude = getattr(self, '_exclude_' + k, None)
+            if exclude:
+                exclude(v)
+            else:
+                self._exclude_misc(k, v)
+
+    def _exclude_packages(self, packages):
+        if not isinstance(packages, sequence):
+            raise DistutilsSetupError(
+                "packages: setting must be a list or tuple (%r)" % (packages,)
+            )
+        list(map(self.exclude_package, packages))
+
+    def _parse_command_opts(self, parser, args):
+        # Remove --with-X/--without-X options when processing command args
+        self.global_options = self.__class__.global_options
+        self.negative_opt = self.__class__.negative_opt
+
+        # First, expand any aliases
+        command = args[0]
+        aliases = self.get_option_dict('aliases')
+        while command in aliases:
+            src, alias = aliases[command]
+            del aliases[command]  # ensure each alias can expand only once!
+            import shlex
+            args[:1] = shlex.split(alias, True)
+            command = args[0]
+
+        nargs = _Distribution._parse_command_opts(self, parser, args)
+
+        # Handle commands that want to consume all remaining arguments
+        cmd_class = self.get_command_class(command)
+        if getattr(cmd_class, 'command_consumes_arguments', None):
+            self.get_option_dict(command)['args'] = ("command line", nargs)
+            if nargs is not None:
+                return []
+
+        return nargs
+
+    def get_cmdline_options(self):
+        """Return a '{cmd: {opt:val}}' map of all command-line options
+
+        Option names are all long, but do not include the leading '--', and
+        contain dashes rather than underscores.  If the option doesn't take
+        an argument (e.g. '--quiet'), the 'val' is 'None'.
+
+        Note that options provided by config files are intentionally excluded.
+        """
+
+        d = {}
+
+        for cmd, opts in self.command_options.items():
+
+            for opt, (src, val) in opts.items():
+
+                if src != "command line":
+                    continue
+
+                opt = opt.replace('_', '-')
+
+                if val == 0:
+                    cmdobj = self.get_command_obj(cmd)
+                    neg_opt = self.negative_opt.copy()
+                    neg_opt.update(getattr(cmdobj, 'negative_opt', {}))
+                    for neg, pos in neg_opt.items():
+                        if pos == opt:
+                            opt = neg
+                            val = None
+                            break
+                    else:
+                        raise AssertionError("Shouldn't be able to get here")
+
+                elif val == 1:
+                    val = None
+
+                d.setdefault(cmd, {})[opt] = val
+
+        return d
+
+    def iter_distribution_names(self):
+        """Yield all packages, modules, and extension names in distribution"""
+
+        for pkg in self.packages or ():
+            yield pkg
+
+        for module in self.py_modules or ():
+            yield module
+
+        for ext in self.ext_modules or ():
+            if isinstance(ext, tuple):
+                name, buildinfo = ext
+            else:
+                name = ext.name
+            if name.endswith('module'):
+                name = name[:-6]
+            yield name
+
+    def handle_display_options(self, option_order):
+        """If there were any non-global "display-only" options
+        (--help-commands or the metadata display options) on the command
+        line, display the requested info and return true; else return
+        false.
+        """
+        import sys
+
+        if self.help_commands:
+            return _Distribution.handle_display_options(self, option_order)
+
+        # Stdout may be StringIO (e.g. in tests)
+        if not isinstance(sys.stdout, io.TextIOWrapper):
+            return _Distribution.handle_display_options(self, option_order)
+
+        # Don't wrap stdout if utf-8 is already the encoding. Provides
+        #  workaround for #334.
+        if sys.stdout.encoding.lower() in ('utf-8', 'utf8'):
+            return _Distribution.handle_display_options(self, option_order)
+
+        # Print metadata in UTF-8 no matter the platform
+        encoding = sys.stdout.encoding
+        errors = sys.stdout.errors
+        newline = sys.platform != 'win32' and '\n' or None
+        line_buffering = sys.stdout.line_buffering
+
+        sys.stdout = io.TextIOWrapper(
+            sys.stdout.detach(), 'utf-8', errors, newline, line_buffering)
+        try:
+            return _Distribution.handle_display_options(self, option_order)
+        finally:
+            sys.stdout = io.TextIOWrapper(
+                sys.stdout.detach(), encoding, errors, newline, line_buffering)
+
+
+class DistDeprecationWarning(SetuptoolsDeprecationWarning):
+    """Class for warning about deprecations in dist in
+    setuptools. Not ignored by default, unlike DeprecationWarning."""
diff --git a/venv/Lib/site-packages/setuptools/errors.py b/venv/Lib/site-packages/setuptools/errors.py
new file mode 100644
index 000000000..2701747f5
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/errors.py
@@ -0,0 +1,16 @@
+"""setuptools.errors
+
+Provides exceptions used by setuptools modules.
+"""
+
+from distutils.errors import DistutilsError
+
+
+class RemovedCommandError(DistutilsError, RuntimeError):
+    """Error used for commands that have been removed in setuptools.
+
+    Since ``setuptools`` is built on ``distutils``, simply removing a command
+    from ``setuptools`` will make the behavior fall back to ``distutils``; this
+    error is raised if a command exists in ``distutils`` but has been actively
+    removed in ``setuptools``.
+    """
diff --git a/venv/Lib/site-packages/setuptools/extension.py b/venv/Lib/site-packages/setuptools/extension.py
new file mode 100644
index 000000000..1820722a4
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/extension.py
@@ -0,0 +1,55 @@
+import re
+import functools
+import distutils.core
+import distutils.errors
+import distutils.extension
+
+from .monkey import get_unpatched
+
+
+def _have_cython():
+    """
+    Return True if Cython can be imported.
+    """
+    cython_impl = 'Cython.Distutils.build_ext'
+    try:
+        # from (cython_impl) import build_ext
+        __import__(cython_impl, fromlist=['build_ext']).build_ext
+        return True
+    except Exception:
+        pass
+    return False
+
+
+# for compatibility
+have_pyrex = _have_cython
+
+_Extension = get_unpatched(distutils.core.Extension)
+
+
+class Extension(_Extension):
+    """Extension that uses '.c' files in place of '.pyx' files"""
+
+    def __init__(self, name, sources, *args, **kw):
+        # The *args is needed for compatibility as calls may use positional
+        # arguments. py_limited_api may be set only via keyword.
+        self.py_limited_api = kw.pop("py_limited_api", False)
+        _Extension.__init__(self, name, sources, *args, **kw)
+
+    def _convert_pyx_sources_to_lang(self):
+        """
+        Replace sources with .pyx extensions to sources with the target
+        language extension. This mechanism allows language authors to supply
+        pre-converted sources but to prefer the .pyx sources.
+        """
+        if _have_cython():
+            # the build has Cython, so allow it to compile the .pyx files
+            return
+        lang = self.language or ''
+        target_ext = '.cpp' if lang.lower() == 'c++' else '.c'
+        sub = functools.partial(re.sub, '.pyx$', target_ext)
+        self.sources = list(map(sub, self.sources))
+
+
+class Library(Extension):
+    """Just like a regular Extension, but built as a library instead"""
diff --git a/venv/Lib/site-packages/setuptools/extern/__init__.py b/venv/Lib/site-packages/setuptools/extern/__init__.py
new file mode 100644
index 000000000..b7f30dc2e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/extern/__init__.py
@@ -0,0 +1,66 @@
+import sys
+
+
+class VendorImporter:
+    """
+    A PEP 302 meta path importer for finding optionally-vendored
+    or otherwise naturally-installed packages from root_name.
+    """
+
+    def __init__(self, root_name, vendored_names=(), vendor_pkg=None):
+        self.root_name = root_name
+        self.vendored_names = set(vendored_names)
+        self.vendor_pkg = vendor_pkg or root_name.replace('extern', '_vendor')
+
+    @property
+    def search_path(self):
+        """
+        Search first the vendor package then as a natural package.
+        """
+        yield self.vendor_pkg + '.'
+        yield ''
+
+    def find_module(self, fullname, path=None):
+        """
+        Return self when fullname starts with root_name and the
+        target module is one vendored through this importer.
+        """
+        root, base, target = fullname.partition(self.root_name + '.')
+        if root:
+            return
+        if not any(map(target.startswith, self.vendored_names)):
+            return
+        return self
+
+    def load_module(self, fullname):
+        """
+        Iterate over the search path to locate and load fullname.
+        """
+        root, base, target = fullname.partition(self.root_name + '.')
+        for prefix in self.search_path:
+            try:
+                extant = prefix + target
+                __import__(extant)
+                mod = sys.modules[extant]
+                sys.modules[fullname] = mod
+                return mod
+            except ImportError:
+                pass
+        else:
+            raise ImportError(
+                "The '{target}' package is required; "
+                "normally this is bundled with this package so if you get "
+                "this warning, consult the packager of your "
+                "distribution.".format(**locals())
+            )
+
+    def install(self):
+        """
+        Install this importer into sys.meta_path if not already present.
+        """
+        if self not in sys.meta_path:
+            sys.meta_path.append(self)
+
+
+names = 'packaging', 'pyparsing', 'ordered_set',
+VendorImporter(__name__, names, 'setuptools._vendor').install()
diff --git a/venv/Lib/site-packages/setuptools/extern/__pycache__/__init__.cpython-36.pyc b/venv/Lib/site-packages/setuptools/extern/__pycache__/__init__.cpython-36.pyc
new file mode 100644
index 000000000..1161e9b89
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/extern/__pycache__/__init__.cpython-36.pyc differ
diff --git a/venv/Lib/site-packages/setuptools/glob.py b/venv/Lib/site-packages/setuptools/glob.py
new file mode 100644
index 000000000..9d7cbc5da
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/glob.py
@@ -0,0 +1,174 @@
+"""
+Filename globbing utility. Mostly a copy of `glob` from Python 3.5.
+
+Changes include:
+ * `yield from` and PEP3102 `*` removed.
+ * Hidden files are not ignored.
+"""
+
+import os
+import re
+import fnmatch
+
+__all__ = ["glob", "iglob", "escape"]
+
+
+def glob(pathname, recursive=False):
+    """Return a list of paths matching a pathname pattern.
+
+    The pattern may contain simple shell-style wildcards a la
+    fnmatch. However, unlike fnmatch, filenames starting with a
+    dot are special cases that are not matched by '*' and '?'
+    patterns.
+
+    If recursive is true, the pattern '**' will match any files and
+    zero or more directories and subdirectories.
+    """
+    return list(iglob(pathname, recursive=recursive))
+
+
+def iglob(pathname, recursive=False):
+    """Return an iterator which yields the paths matching a pathname pattern.
+
+    The pattern may contain simple shell-style wildcards a la
+    fnmatch. However, unlike fnmatch, filenames starting with a
+    dot are special cases that are not matched by '*' and '?'
+    patterns.
+
+    If recursive is true, the pattern '**' will match any files and
+    zero or more directories and subdirectories.
+    """
+    it = _iglob(pathname, recursive)
+    if recursive and _isrecursive(pathname):
+        s = next(it)  # skip empty string
+        assert not s
+    return it
+
+
+def _iglob(pathname, recursive):
+    dirname, basename = os.path.split(pathname)
+    if not has_magic(pathname):
+        if basename:
+            if os.path.lexists(pathname):
+                yield pathname
+        else:
+            # Patterns ending with a slash should match only directories
+            if os.path.isdir(dirname):
+                yield pathname
+        return
+    if not dirname:
+        if recursive and _isrecursive(basename):
+            for x in glob2(dirname, basename):
+                yield x
+        else:
+            for x in glob1(dirname, basename):
+                yield x
+        return
+    # `os.path.split()` returns the argument itself as a dirname if it is a
+    # drive or UNC path.  Prevent an infinite recursion if a drive or UNC path
+    # contains magic characters (i.e. r'\\?\C:').
+    if dirname != pathname and has_magic(dirname):
+        dirs = _iglob(dirname, recursive)
+    else:
+        dirs = [dirname]
+    if has_magic(basename):
+        if recursive and _isrecursive(basename):
+            glob_in_dir = glob2
+        else:
+            glob_in_dir = glob1
+    else:
+        glob_in_dir = glob0
+    for dirname in dirs:
+        for name in glob_in_dir(dirname, basename):
+            yield os.path.join(dirname, name)
+
+
+# These 2 helper functions non-recursively glob inside a literal directory.
+# They return a list of basenames. `glob1` accepts a pattern while `glob0`
+# takes a literal basename (so it only has to check for its existence).
+
+
+def glob1(dirname, pattern):
+    if not dirname:
+        if isinstance(pattern, bytes):
+            dirname = os.curdir.encode('ASCII')
+        else:
+            dirname = os.curdir
+    try:
+        names = os.listdir(dirname)
+    except OSError:
+        return []
+    return fnmatch.filter(names, pattern)
+
+
+def glob0(dirname, basename):
+    if not basename:
+        # `os.path.split()` returns an empty basename for paths ending with a
+        # directory separator.  'q*x/' should match only directories.
+        if os.path.isdir(dirname):
+            return [basename]
+    else:
+        if os.path.lexists(os.path.join(dirname, basename)):
+            return [basename]
+    return []
+
+
+# This helper function recursively yields relative pathnames inside a literal
+# directory.
+
+
+def glob2(dirname, pattern):
+    assert _isrecursive(pattern)
+    yield pattern[:0]
+    for x in _rlistdir(dirname):
+        yield x
+
+
+# Recursively yields relative pathnames inside a literal directory.
+def _rlistdir(dirname):
+    if not dirname:
+        if isinstance(dirname, bytes):
+            dirname = os.curdir.encode('ASCII')
+        else:
+            dirname = os.curdir
+    try:
+        names = os.listdir(dirname)
+    except os.error:
+        return
+    for x in names:
+        yield x
+        path = os.path.join(dirname, x) if dirname else x
+        for y in _rlistdir(path):
+            yield os.path.join(x, y)
+
+
+magic_check = re.compile('([*?[])')
+magic_check_bytes = re.compile(b'([*?[])')
+
+
+def has_magic(s):
+    if isinstance(s, bytes):
+        match = magic_check_bytes.search(s)
+    else:
+        match = magic_check.search(s)
+    return match is not None
+
+
+def _isrecursive(pattern):
+    if isinstance(pattern, bytes):
+        return pattern == b'**'
+    else:
+        return pattern == '**'
+
+
+def escape(pathname):
+    """Escape all special characters.
+    """
+    # Escaping is done by wrapping any of "*?[" between square brackets.
+    # Metacharacters do not work in the drive part and shouldn't be escaped.
+    drive, pathname = os.path.splitdrive(pathname)
+    if isinstance(pathname, bytes):
+        pathname = magic_check_bytes.sub(br'[\1]', pathname)
+    else:
+        pathname = magic_check.sub(r'[\1]', pathname)
+    return drive + pathname
diff --git a/venv/Lib/site-packages/setuptools/gui-32.exe b/venv/Lib/site-packages/setuptools/gui-32.exe
new file mode 100644
index 000000000..f8d350965
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/gui-32.exe differ
diff --git a/venv/Lib/site-packages/setuptools/gui-64.exe b/venv/Lib/site-packages/setuptools/gui-64.exe
new file mode 100644
index 000000000..330c51a5d
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/gui-64.exe differ
diff --git a/venv/Lib/site-packages/setuptools/gui.exe b/venv/Lib/site-packages/setuptools/gui.exe
new file mode 100644
index 000000000..f8d350965
Binary files /dev/null and b/venv/Lib/site-packages/setuptools/gui.exe differ
diff --git a/venv/Lib/site-packages/setuptools/installer.py b/venv/Lib/site-packages/setuptools/installer.py
new file mode 100644
index 000000000..e630b8747
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/installer.py
@@ -0,0 +1,148 @@
+import glob
+import os
+import subprocess
+import sys
+import tempfile
+from distutils import log
+from distutils.errors import DistutilsError
+
+import pkg_resources
+from setuptools.command.easy_install import easy_install
+from setuptools.wheel import Wheel
+
+
+def _fixup_find_links(find_links):
+    """Ensure find-links option end-up being a list of strings."""
+    if isinstance(find_links, str):
+        return find_links.split()
+    assert isinstance(find_links, (tuple, list))
+    return find_links
+
+
+def _legacy_fetch_build_egg(dist, req):
+    """Fetch an egg needed for building.
+
+    Legacy path using EasyInstall.
+    """
+    tmp_dist = dist.__class__({'script_args': ['easy_install']})
+    opts = tmp_dist.get_option_dict('easy_install')
+    opts.clear()
+    opts.update(
+        (k, v)
+        for k, v in dist.get_option_dict('easy_install').items()
+        if k in (
+            # don't use any other settings
+            'find_links', 'site_dirs', 'index_url',
+            'optimize', 'site_dirs', 'allow_hosts',
+        ))
+    if dist.dependency_links:
+        links = dist.dependency_links[:]
+        if 'find_links' in opts:
+            links = _fixup_find_links(opts['find_links'][1]) + links
+        opts['find_links'] = ('setup', links)
+    install_dir = dist.get_egg_cache_dir()
+    cmd = easy_install(
+        tmp_dist, args=["x"], install_dir=install_dir,
+        exclude_scripts=True,
+        always_copy=False, build_directory=None, editable=False,
+        upgrade=False, multi_version=True, no_report=True, user=False
+    )
+    cmd.ensure_finalized()
+    return cmd.easy_install(req)
+
+
+def fetch_build_egg(dist, req):
+    """Fetch an egg needed for building.
+
+    Use pip/wheel to fetch/build a wheel."""
+    # Check pip is available.
+    try:
+        pkg_resources.get_distribution('pip')
+    except pkg_resources.DistributionNotFound:
+        dist.announce(
+            'WARNING: The pip package is not available, falling back '
+            'to EasyInstall for handling setup_requires/test_requires; '
+            'this is deprecated and will be removed in a future version.',
+            log.WARN
+        )
+        return _legacy_fetch_build_egg(dist, req)
+    # Warn if wheel is not.
+    try:
+        pkg_resources.get_distribution('wheel')
+    except pkg_resources.DistributionNotFound:
+        dist.announce('WARNING: The wheel package is not available.', log.WARN)
+    # Ignore environment markers; if supplied, it is required.
+    req = strip_marker(req)
+    # Take easy_install options into account, but do not override relevant
+    # pip environment variables (like PIP_INDEX_URL or PIP_QUIET); they'll
+    # take precedence.
+    opts = dist.get_option_dict('easy_install')
+    if 'allow_hosts' in opts:
+        raise DistutilsError('the `allow-hosts` option is not supported '
+                             'when using pip to install requirements.')
+    if 'PIP_QUIET' in os.environ or 'PIP_VERBOSE' in os.environ:
+        quiet = False
+    else:
+        quiet = True
+    if 'PIP_INDEX_URL' in os.environ:
+        index_url = None
+    elif 'index_url' in opts:
+        index_url = opts['index_url'][1]
+    else:
+        index_url = None
+    if 'find_links' in opts:
+        find_links = _fixup_find_links(opts['find_links'][1])[:]
+    else:
+        find_links = []
+    if dist.dependency_links:
+        find_links.extend(dist.dependency_links)
+    eggs_dir = os.path.realpath(dist.get_egg_cache_dir())
+    environment = pkg_resources.Environment()
+    for egg_dist in pkg_resources.find_distributions(eggs_dir):
+        if egg_dist in req and environment.can_add(egg_dist):
+            return egg_dist
+    with tempfile.TemporaryDirectory() as tmpdir:
+        cmd = [
+            sys.executable, '-m', 'pip',
+            '--disable-pip-version-check',
+            'wheel', '--no-deps',
+            '-w', tmpdir,
+        ]
+        if quiet:
+            cmd.append('--quiet')
+        if index_url is not None:
+            cmd.extend(('--index-url', index_url))
+        if find_links is not None:
+            for link in find_links:
+                cmd.extend(('--find-links', link))
+        # If requirement is a PEP 508 direct URL, directly pass
+        # the URL to pip, as `req @ url` does not work on the
+        # command line.
+        if req.url:
+            cmd.append(req.url)
+        else:
+            cmd.append(str(req))
+        try:
+            subprocess.check_call(cmd)
+        except subprocess.CalledProcessError as e:
+            raise DistutilsError(str(e)) from e
+        wheel = Wheel(glob.glob(os.path.join(tmpdir, '*.whl'))[0])
+        dist_location = os.path.join(eggs_dir, wheel.egg_name())
+        wheel.install_as_egg(dist_location)
+        dist_metadata = pkg_resources.PathMetadata(
+            dist_location, os.path.join(dist_location, 'EGG-INFO'))
+        dist = pkg_resources.Distribution.from_filename(
+            dist_location, metadata=dist_metadata)
+        return dist
+
+
+def strip_marker(req):
+    """
+    Return a new requirement without the environment marker to avoid
+    calling pip with something like `babel; extra == "i18n"`, which
+    would always be ignored.
+    """
+    # create a copy to avoid mutating the input
+    req = pkg_resources.Requirement.parse(str(req))
+    req.marker = None
+    return req
diff --git a/venv/Lib/site-packages/setuptools/launch.py b/venv/Lib/site-packages/setuptools/launch.py
new file mode 100644
index 000000000..0208fdf33
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/launch.py
@@ -0,0 +1,36 @@
+"""
+Launch the Python script on the command line after
+setuptools is bootstrapped via import.
+"""
+
+# Note that setuptools gets imported implicitly by the
+# invocation of this script using python -m setuptools.launch
+
+import tokenize
+import sys
+
+
+def run():
+    """
+    Run the script in sys.argv[1] as if it had
+    been invoked naturally.
+    """
+    __builtins__
+    script_name = sys.argv[1]
+    namespace = dict(
+        __file__=script_name,
+        __name__='__main__',
+        __doc__=None,
+    )
+    sys.argv[:] = sys.argv[1:]
+
+    open_ = getattr(tokenize, 'open', open)
+    with open_(script_name) as fid:
+        script = fid.read()
+    norm_script = script.replace('\\r\\n', '\\n')
+    code = compile(norm_script, script_name, 'exec')
+    exec(code, namespace)
+
+
+if __name__ == '__main__':
+    run()
diff --git a/venv/Lib/site-packages/setuptools/lib2to3_ex.py b/venv/Lib/site-packages/setuptools/lib2to3_ex.py
new file mode 100644
index 000000000..c176abf63
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/lib2to3_ex.py
@@ -0,0 +1,68 @@
+"""
+Customized Mixin2to3 support:
+
+ - adds support for converting doctests
+"""
+
+import warnings
+from distutils.util import Mixin2to3 as _Mixin2to3
+from distutils import log
+from lib2to3.refactor import RefactoringTool, get_fixers_from_package
+
+import setuptools
+from ._deprecation_warning import SetuptoolsDeprecationWarning
+
+
+class DistutilsRefactoringTool(RefactoringTool):
+    def log_error(self, msg, *args, **kw):
+        log.error(msg, *args)
+
+    def log_message(self, msg, *args):
+        log.info(msg, *args)
+
+    def log_debug(self, msg, *args):
+        log.debug(msg, *args)
+
+
+class Mixin2to3(_Mixin2to3):
+    def run_2to3(self, files, doctests=False):
+        # See of the distribution option has been set, otherwise check the
+        # setuptools default.
+        if self.distribution.use_2to3 is not True:
+            return
+        if not files:
+            return
+
+        warnings.warn(
+            "2to3 support is deprecated. If the project still "
+            "requires Python 2 support, please migrate to "
+            "a single-codebase solution or employ an "
+            "independent conversion process.",
+            SetuptoolsDeprecationWarning)
+        log.info("Fixing " + " ".join(files))
+        self.__build_fixer_names()
+        self.__exclude_fixers()
+        if doctests:
+            if setuptools.run_2to3_on_doctests:
+                r = DistutilsRefactoringTool(self.fixer_names)
+                r.refactor(files, write=True, doctests_only=True)
+        else:
+            _Mixin2to3.run_2to3(self, files)
+
+    def __build_fixer_names(self):
+        if self.fixer_names:
+            return
+        self.fixer_names = []
+        for p in setuptools.lib2to3_fixer_packages:
+            self.fixer_names.extend(get_fixers_from_package(p))
+        if self.distribution.use_2to3_fixers is not None:
+            for p in self.distribution.use_2to3_fixers:
+                self.fixer_names.extend(get_fixers_from_package(p))
+
+    def __exclude_fixers(self):
+        excluded_fixers = getattr(self, 'exclude_fixers', [])
+        if self.distribution.use_2to3_exclude_fixers is not None:
+            excluded_fixers.extend(self.distribution.use_2to3_exclude_fixers)
+        for fixer_name in excluded_fixers:
+            if fixer_name in self.fixer_names:
+                self.fixer_names.remove(fixer_name)
diff --git a/venv/Lib/site-packages/setuptools/monkey.py b/venv/Lib/site-packages/setuptools/monkey.py
new file mode 100644
index 000000000..fb36dc1a9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/monkey.py
@@ -0,0 +1,177 @@
+"""
+Monkey patching of distutils.
+"""
+
+import sys
+import distutils.filelist
+import platform
+import types
+import functools
+from importlib import import_module
+import inspect
+
+import setuptools
+
+__all__ = []
+"""
+Everything is private. Contact the project team
+if you think you need this functionality.
+"""
+
+
+def _get_mro(cls):
+    """
+    Returns the bases classes for cls sorted by the MRO.
+
+    Works around an issue on Jython where inspect.getmro will not return all
+    base classes if multiple classes share the same name. Instead, this
+    function will return a tuple containing the class itself, and the contents
+    of cls.__bases__. See https://github.com/pypa/setuptools/issues/1024.
+    """
+    if platform.python_implementation() == "Jython":
+        return (cls,) + cls.__bases__
+    return inspect.getmro(cls)
+
+
+def get_unpatched(item):
+    lookup = (
+        get_unpatched_class if isinstance(item, type) else
+        get_unpatched_function if isinstance(item, types.FunctionType) else
+        lambda item: None
+    )
+    return lookup(item)
+
+
+def get_unpatched_class(cls):
+    """Protect against re-patching the distutils if reloaded
+
+    Also ensures that no other distutils extension monkeypatched the distutils
+    first.
+    """
+    external_bases = (
+        cls
+        for cls in _get_mro(cls)
+        if not cls.__module__.startswith('setuptools')
+    )
+    base = next(external_bases)
+    if not base.__module__.startswith('distutils'):
+        msg = "distutils has already been patched by %r" % cls
+        raise AssertionError(msg)
+    return base
+
+
+def patch_all():
+    # we can't patch distutils.cmd, alas
+    distutils.core.Command = setuptools.Command
+
+    has_issue_12885 = sys.version_info <= (3, 5, 3)
+
+    if has_issue_12885:
+        # fix findall bug in distutils (http://bugs.python.org/issue12885)
+        distutils.filelist.findall = setuptools.findall
+
+    needs_warehouse = (
+        sys.version_info < (2, 7, 13)
+        or
+        (3, 4) < sys.version_info < (3, 4, 6)
+        or
+        (3, 5) < sys.version_info <= (3, 5, 3)
+    )
+
+    if needs_warehouse:
+        warehouse = 'https://upload.pypi.org/legacy/'
+        distutils.config.PyPIRCCommand.DEFAULT_REPOSITORY = warehouse
+
+    _patch_distribution_metadata()
+
+    # Install Distribution throughout the distutils
+    for module in distutils.dist, distutils.core, distutils.cmd:
+        module.Distribution = setuptools.dist.Distribution
+
+    # Install the patched Extension
+    distutils.core.Extension = setuptools.extension.Extension
+    distutils.extension.Extension = setuptools.extension.Extension
+    if 'distutils.command.build_ext' in sys.modules:
+        sys.modules['distutils.command.build_ext'].Extension = (
+            setuptools.extension.Extension
+        )
+
+    patch_for_msvc_specialized_compiler()
+
+
+def _patch_distribution_metadata():
+    """Patch write_pkg_file and read_pkg_file for higher metadata standards"""
+    for attr in ('write_pkg_file', 'read_pkg_file', 'get_metadata_version'):
+        new_val = getattr(setuptools.dist, attr)
+        setattr(distutils.dist.DistributionMetadata, attr, new_val)
+
+
+def patch_func(replacement, target_mod, func_name):
+    """
+    Patch func_name in target_mod with replacement
+
+    Important - original must be resolved by name to avoid
+    patching an already patched function.
+    """
+    original = getattr(target_mod, func_name)
+
+    # set the 'unpatched' attribute on the replacement to
+    # point to the original.
+    vars(replacement).setdefault('unpatched', original)
+
+    # replace the function in the original module
+    setattr(target_mod, func_name, replacement)
+
+
+def get_unpatched_function(candidate):
+    return getattr(candidate, 'unpatched')
+
+
+def patch_for_msvc_specialized_compiler():
+    """
+    Patch functions in distutils to use standalone Microsoft Visual C++
+    compilers.
+    """
+    # import late to avoid circular imports on Python < 3.5
+    msvc = import_module('setuptools.msvc')
+
+    if platform.system() != 'Windows':
+        # Compilers only available on Microsoft Windows
+        return
+
+    def patch_params(mod_name, func_name):
+        """
+        Prepare the parameters for patch_func to patch indicated function.
+        """
+        repl_prefix = 'msvc9_' if 'msvc9' in mod_name else 'msvc14_'
+        repl_name = repl_prefix + func_name.lstrip('_')
+        repl = getattr(msvc, repl_name)
+        mod = import_module(mod_name)
+        if not hasattr(mod, func_name):
+            raise ImportError(func_name)
+        return repl, mod, func_name
+
+    # Python 2.7 to 3.4
+    msvc9 = functools.partial(patch_params, 'distutils.msvc9compiler')
+
+    # Python 3.5+
+    msvc14 = functools.partial(patch_params, 'distutils._msvccompiler')
+
+    try:
+        # Patch distutils.msvc9compiler
+        patch_func(*msvc9('find_vcvarsall'))
+        patch_func(*msvc9('query_vcvarsall'))
+    except ImportError:
+        pass
+
+    try:
+        # Patch distutils._msvccompiler._get_vc_env
+        patch_func(*msvc14('_get_vc_env'))
+    except ImportError:
+        pass
+
+    try:
+        # Patch distutils._msvccompiler.gen_lib_options for Numpy
+        patch_func(*msvc14('gen_lib_options'))
+    except ImportError:
+        pass
diff --git a/venv/Lib/site-packages/setuptools/msvc.py b/venv/Lib/site-packages/setuptools/msvc.py
new file mode 100644
index 000000000..1ead72b42
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/msvc.py
@@ -0,0 +1,1830 @@
+"""
+Improved support for Microsoft Visual C++ compilers.
+
+Known supported compilers:
+--------------------------
+Microsoft Visual C++ 9.0:
+    Microsoft Visual C++ Compiler for Python 2.7 (x86, amd64)
+    Microsoft Windows SDK 6.1 (x86, x64, ia64)
+    Microsoft Windows SDK 7.0 (x86, x64, ia64)
+
+Microsoft Visual C++ 10.0:
+    Microsoft Windows SDK 7.1 (x86, x64, ia64)
+
+Microsoft Visual C++ 14.X:
+    Microsoft Visual C++ Build Tools 2015 (x86, x64, arm)
+    Microsoft Visual Studio Build Tools 2017 (x86, x64, arm, arm64)
+    Microsoft Visual Studio Build Tools 2019 (x86, x64, arm, arm64)
+
+This may also support compilers shipped with compatible Visual Studio versions.
+"""
+
+import json
+from io import open
+from os import listdir, pathsep
+from os.path import join, isfile, isdir, dirname
+import sys
+import platform
+import itertools
+import subprocess
+import distutils.errors
+from setuptools.extern.packaging.version import LegacyVersion
+
+from .monkey import get_unpatched
+
+if platform.system() == 'Windows':
+    import winreg
+    from os import environ
+else:
+    # Mock winreg and environ so the module can be imported on this platform.
+
+    class winreg:
+        HKEY_USERS = None
+        HKEY_CURRENT_USER = None
+        HKEY_LOCAL_MACHINE = None
+        HKEY_CLASSES_ROOT = None
+
+    environ = dict()
+
+_msvc9_suppress_errors = (
+    # msvc9compiler isn't available on some platforms
+    ImportError,
+
+    # msvc9compiler raises DistutilsPlatformError in some
+    # environments. See #1118.
+    distutils.errors.DistutilsPlatformError,
+)
+
+try:
+    from distutils.msvc9compiler import Reg
+except _msvc9_suppress_errors:
+    pass
+
+
+def msvc9_find_vcvarsall(version):
+    """
+    Patched "distutils.msvc9compiler.find_vcvarsall" to use the standalone
+    compiler build for Python
+    (VCForPython / Microsoft Visual C++ Compiler for Python 2.7).
+
+    Fall back to original behavior when the standalone compiler is not
+    available.
+
+    Redirect the path of "vcvarsall.bat".
+
+    Parameters
+    ----------
+    version: float
+        Required Microsoft Visual C++ version.
+
+    Return
+    ------
+    str
+        vcvarsall.bat path
+    """
+    vc_base = r'Software\%sMicrosoft\DevDiv\VCForPython\%0.1f'
+    key = vc_base % ('', version)
+    try:
+        # Per-user installs register the compiler path here
+        productdir = Reg.get_value(key, "installdir")
+    except KeyError:
+        try:
+            # All-user installs on a 64-bit system register here
+            key = vc_base % ('Wow6432Node\\', version)
+            productdir = Reg.get_value(key, "installdir")
+        except KeyError:
+            productdir = None
+
+    if productdir:
+        vcvarsall = join(productdir, "vcvarsall.bat")
+        if isfile(vcvarsall):
+            return vcvarsall
+
+    return get_unpatched(msvc9_find_vcvarsall)(version)
+
+
+def msvc9_query_vcvarsall(ver, arch='x86', *args, **kwargs):
+    """
+    Patched "distutils.msvc9compiler.query_vcvarsall" for support extra
+    Microsoft Visual C++ 9.0 and 10.0 compilers.
+
+    Set environment without use of "vcvarsall.bat".
+
+    Parameters
+    ----------
+    ver: float
+        Required Microsoft Visual C++ version.
+    arch: str
+        Target architecture.
+
+    Return
+    ------
+    dict
+        environment
+    """
+    # Try to get environment from vcvarsall.bat (Classical way)
+    try:
+        orig = get_unpatched(msvc9_query_vcvarsall)
+        return orig(ver, arch, *args, **kwargs)
+    except distutils.errors.DistutilsPlatformError:
+        # Pass error if Vcvarsall.bat is missing
+        pass
+    except ValueError:
+        # Pass error if environment not set after executing vcvarsall.bat
+        pass
+
+    # If error, try to set environment directly
+    try:
+        return EnvironmentInfo(arch, ver).return_env()
+    except distutils.errors.DistutilsPlatformError as exc:
+        _augment_exception(exc, ver, arch)
+        raise
+
+
+def _msvc14_find_vc2015():
+    """Python 3.8 "distutils/_msvccompiler.py" backport"""
+    try:
+        key = winreg.OpenKey(
+            winreg.HKEY_LOCAL_MACHINE,
+            r"Software\Microsoft\VisualStudio\SxS\VC7",
+            0,
+            winreg.KEY_READ | winreg.KEY_WOW64_32KEY
+        )
+    except OSError:
+        return None, None
+
+    best_version = 0
+    best_dir = None
+    with key:
+        for i in itertools.count():
+            try:
+                v, vc_dir, vt = winreg.EnumValue(key, i)
+            except OSError:
+                break
+            if v and vt == winreg.REG_SZ and isdir(vc_dir):
+                try:
+                    version = int(float(v))
+                except (ValueError, TypeError):
+                    continue
+                if version >= 14 and version > best_version:
+                    best_version, best_dir = version, vc_dir
+    return best_version, best_dir
+
+
+def _msvc14_find_vc2017():
+    """Python 3.8 "distutils/_msvccompiler.py" backport
+
+    Returns "15, path" based on the result of invoking vswhere.exe
+    If no install is found, returns "None, None"
+
+    The version is returned to avoid unnecessarily changing the function
+    result. It may be ignored when the path is not None.
+
+    If vswhere.exe is not available, by definition, VS 2017 is not
+    installed.
+    """
+    root = environ.get("ProgramFiles(x86)") or environ.get("ProgramFiles")
+    if not root:
+        return None, None
+
+    try:
+        path = subprocess.check_output([
+            join(root, "Microsoft Visual Studio", "Installer", "vswhere.exe"),
+            "-latest",
+            "-prerelease",
+            "-requires", "Microsoft.VisualStudio.Component.VC.Tools.x86.x64",
+            "-property", "installationPath",
+            "-products", "*",
+        ]).decode(encoding="mbcs", errors="strict").strip()
+    except (subprocess.CalledProcessError, OSError, UnicodeDecodeError):
+        return None, None
+
+    path = join(path, "VC", "Auxiliary", "Build")
+    if isdir(path):
+        return 15, path
+
+    return None, None
+
+
+PLAT_SPEC_TO_RUNTIME = {
+    'x86': 'x86',
+    'x86_amd64': 'x64',
+    'x86_arm': 'arm',
+    'x86_arm64': 'arm64'
+}
+
+
+def _msvc14_find_vcvarsall(plat_spec):
+    """Python 3.8 "distutils/_msvccompiler.py" backport"""
+    _, best_dir = _msvc14_find_vc2017()
+    vcruntime = None
+
+    if plat_spec in PLAT_SPEC_TO_RUNTIME:
+        vcruntime_plat = PLAT_SPEC_TO_RUNTIME[plat_spec]
+    else:
+        vcruntime_plat = 'x64' if 'amd64' in plat_spec else 'x86'
+
+    if best_dir:
+        vcredist = join(best_dir, "..", "..", "redist", "MSVC", "**",
+                        vcruntime_plat, "Microsoft.VC14*.CRT",
+                        "vcruntime140.dll")
+        try:
+            import glob
+            vcruntime = glob.glob(vcredist, recursive=True)[-1]
+        except (ImportError, OSError, LookupError):
+            vcruntime = None
+
+    if not best_dir:
+        best_version, best_dir = _msvc14_find_vc2015()
+        if best_version:
+            vcruntime = join(best_dir, 'redist', vcruntime_plat,
+                             "Microsoft.VC140.CRT", "vcruntime140.dll")
+
+    if not best_dir:
+        return None, None
+
+    vcvarsall = join(best_dir, "vcvarsall.bat")
+    if not isfile(vcvarsall):
+        return None, None
+
+    if not vcruntime or not isfile(vcruntime):
+        vcruntime = None
+
+    return vcvarsall, vcruntime
+
+
+def _msvc14_get_vc_env(plat_spec):
+    """Python 3.8 "distutils/_msvccompiler.py" backport"""
+    if "DISTUTILS_USE_SDK" in environ:
+        return {
+            key.lower(): value
+            for key, value in environ.items()
+        }
+
+    vcvarsall, vcruntime = _msvc14_find_vcvarsall(plat_spec)
+    if not vcvarsall:
+        raise distutils.errors.DistutilsPlatformError(
+            "Unable to find vcvarsall.bat"
+        )
+
+    try:
+        out = subprocess.check_output(
+            'cmd /u /c "{}" {} && set'.format(vcvarsall, plat_spec),
+            stderr=subprocess.STDOUT,
+        ).decode('utf-16le', errors='replace')
+    except subprocess.CalledProcessError as exc:
+        raise distutils.errors.DistutilsPlatformError(
+            "Error executing {}".format(exc.cmd)
+        ) from exc
+
+    env = {
+        key.lower(): value
+        for key, _, value in
+        (line.partition('=') for line in out.splitlines())
+        if key and value
+    }
+
+    if vcruntime:
+        env['py_vcruntime_redist'] = vcruntime
+    return env
+
+
+def msvc14_get_vc_env(plat_spec):
+    """
+    Patched "distutils._msvccompiler._get_vc_env" for support extra
+    Microsoft Visual C++ 14.X compilers.
+
+    Set environment without use of "vcvarsall.bat".
+
+    Parameters
+    ----------
+    plat_spec: str
+        Target architecture.
+
+    Return
+    ------
+    dict
+        environment
+    """
+
+    # Always use backport from CPython 3.8
+    try:
+        return _msvc14_get_vc_env(plat_spec)
+    except distutils.errors.DistutilsPlatformError as exc:
+        _augment_exception(exc, 14.0)
+        raise
+
+
+def msvc14_gen_lib_options(*args, **kwargs):
+    """
+    Patched "distutils._msvccompiler.gen_lib_options" for fix
+    compatibility between "numpy.distutils" and "distutils._msvccompiler"
+    (for Numpy < 1.11.2)
+    """
+    if "numpy.distutils" in sys.modules:
+        import numpy as np
+        if LegacyVersion(np.__version__) < LegacyVersion('1.11.2'):
+            return np.distutils.ccompiler.gen_lib_options(*args, **kwargs)
+    return get_unpatched(msvc14_gen_lib_options)(*args, **kwargs)
+
+
+def _augment_exception(exc, version, arch=''):
+    """
+    Add details to the exception message to help guide the user
+    as to what action will resolve it.
+    """
+    # Error if MSVC++ directory not found or environment not set
+    message = exc.args[0]
+
+    if "vcvarsall" in message.lower() or "visual c" in message.lower():
+        # Special error message if MSVC++ not installed
+        tmpl = 'Microsoft Visual C++ {version:0.1f} or greater is required.'
+        message = tmpl.format(**locals())
+        msdownload = 'www.microsoft.com/download/details.aspx?id=%d'
+        if version == 9.0:
+            if arch.lower().find('ia64') > -1:
+                # For VC++ 9.0, if IA64 support is needed, redirect user
+                # to Windows SDK 7.0.
+                # Note: No download link available from Microsoft.
+                message += ' Get it with "Microsoft Windows SDK 7.0"'
+            else:
+                # For VC++ 9.0 redirect user to Vc++ for Python 2.7 :
+                # This redirection link is maintained by Microsoft.
+                # Contact vspython@microsoft.com if it needs updating.
+                message += ' Get it from http://aka.ms/vcpython27'
+        elif version == 10.0:
+            # For VC++ 10.0 Redirect user to Windows SDK 7.1
+            message += ' Get it with "Microsoft Windows SDK 7.1": '
+            message += msdownload % 8279
+        elif version >= 14.0:
+            # For VC++ 14.X Redirect user to latest Visual C++ Build Tools
+            message += (' Get it with "Microsoft C++ Build Tools": '
+                        r'https://visualstudio.microsoft.com'
+                        r'/visual-cpp-build-tools/')
+
+    exc.args = (message, )
+
+
+class PlatformInfo:
+    """
+    Current and Target Architectures information.
+
+    Parameters
+    ----------
+    arch: str
+        Target architecture.
+    """
+    current_cpu = environ.get('processor_architecture', '').lower()
+
+    def __init__(self, arch):
+        self.arch = arch.lower().replace('x64', 'amd64')
+
+    @property
+    def target_cpu(self):
+        """
+        Return Target CPU architecture.
+
+        Return
+        ------
+        str
+            Target CPU
+        """
+        return self.arch[self.arch.find('_') + 1:]
+
+    def target_is_x86(self):
+        """
+        Return True if target CPU is x86 32 bits..
+
+        Return
+        ------
+        bool
+            CPU is x86 32 bits
+        """
+        return self.target_cpu == 'x86'
+
+    def current_is_x86(self):
+        """
+        Return True if current CPU is x86 32 bits..
+
+        Return
+        ------
+        bool
+            CPU is x86 32 bits
+        """
+        return self.current_cpu == 'x86'
+
+    def current_dir(self, hidex86=False, x64=False):
+        """
+        Current platform specific subfolder.
+
+        Parameters
+        ----------
+        hidex86: bool
+            return '' and not '\x86' if architecture is x86.
+        x64: bool
+            return '\x64' and not '\amd64' if architecture is amd64.
+
+        Return
+        ------
+        str
+            subfolder: '\target', or '' (see hidex86 parameter)
+        """
+        return (
+            '' if (self.current_cpu == 'x86' and hidex86) else
+            r'\x64' if (self.current_cpu == 'amd64' and x64) else
+            r'\%s' % self.current_cpu
+        )
+
+    def target_dir(self, hidex86=False, x64=False):
+        r"""
+        Target platform specific subfolder.
+
+        Parameters
+        ----------
+        hidex86: bool
+            return '' and not '\x86' if architecture is x86.
+        x64: bool
+            return '\x64' and not '\amd64' if architecture is amd64.
+
+        Return
+        ------
+        str
+            subfolder: '\current', or '' (see hidex86 parameter)
+        """
+        return (
+            '' if (self.target_cpu == 'x86' and hidex86) else
+            r'\x64' if (self.target_cpu == 'amd64' and x64) else
+            r'\%s' % self.target_cpu
+        )
+
+    def cross_dir(self, forcex86=False):
+        r"""
+        Cross platform specific subfolder.
+
+        Parameters
+        ----------
+        forcex86: bool
+            Use 'x86' as current architecture even if current architecture is
+            not x86.
+
+        Return
+        ------
+        str
+            subfolder: '' if target architecture is current architecture,
+            '\current_target' if not.
+        """
+        current = 'x86' if forcex86 else self.current_cpu
+        return (
+            '' if self.target_cpu == current else
+            self.target_dir().replace('\\', '\\%s_' % current)
+        )
+
+
+class RegistryInfo:
+    """
+    Microsoft Visual Studio related registry information.
+
+    Parameters
+    ----------
+    platform_info: PlatformInfo
+        "PlatformInfo" instance.
+    """
+    HKEYS = (winreg.HKEY_USERS,
+             winreg.HKEY_CURRENT_USER,
+             winreg.HKEY_LOCAL_MACHINE,
+             winreg.HKEY_CLASSES_ROOT)
+
+    def __init__(self, platform_info):
+        self.pi = platform_info
+
+    @property
+    def visualstudio(self):
+        """
+        Microsoft Visual Studio root registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return 'VisualStudio'
+
+    @property
+    def sxs(self):
+        """
+        Microsoft Visual Studio SxS registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return join(self.visualstudio, 'SxS')
+
+    @property
+    def vc(self):
+        """
+        Microsoft Visual C++ VC7 registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return join(self.sxs, 'VC7')
+
+    @property
+    def vs(self):
+        """
+        Microsoft Visual Studio VS7 registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return join(self.sxs, 'VS7')
+
+    @property
+    def vc_for_python(self):
+        """
+        Microsoft Visual C++ for Python registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return r'DevDiv\VCForPython'
+
+    @property
+    def microsoft_sdk(self):
+        """
+        Microsoft SDK registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return 'Microsoft SDKs'
+
+    @property
+    def windows_sdk(self):
+        """
+        Microsoft Windows/Platform SDK registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return join(self.microsoft_sdk, 'Windows')
+
+    @property
+    def netfx_sdk(self):
+        """
+        Microsoft .NET Framework SDK registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return join(self.microsoft_sdk, 'NETFXSDK')
+
+    @property
+    def windows_kits_roots(self):
+        """
+        Microsoft Windows Kits Roots registry key.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        return r'Windows Kits\Installed Roots'
+
+    def microsoft(self, key, x86=False):
+        """
+        Return key in Microsoft software registry.
+
+        Parameters
+        ----------
+        key: str
+            Registry key path where look.
+        x86: str
+            Force x86 software registry.
+
+        Return
+        ------
+        str
+            Registry key
+        """
+        node64 = '' if self.pi.current_is_x86() or x86 else 'Wow6432Node'
+        return join('Software', node64, 'Microsoft', key)
+
+    def lookup(self, key, name):
+        """
+        Look for values in registry in Microsoft software registry.
+
+        Parameters
+        ----------
+        key: str
+            Registry key path where look.
+        name: str
+            Value name to find.
+
+        Return
+        ------
+        str
+            value
+        """
+        key_read = winreg.KEY_READ
+        openkey = winreg.OpenKey
+        closekey = winreg.CloseKey
+        ms = self.microsoft
+        for hkey in self.HKEYS:
+            bkey = None
+            try:
+                bkey = openkey(hkey, ms(key), 0, key_read)
+            except (OSError, IOError):
+                if not self.pi.current_is_x86():
+                    try:
+                        bkey = openkey(hkey, ms(key, True), 0, key_read)
+                    except (OSError, IOError):
+                        continue
+                else:
+                    continue
+            try:
+                return winreg.QueryValueEx(bkey, name)[0]
+            except (OSError, IOError):
+                pass
+            finally:
+                if bkey:
+                    closekey(bkey)
+
+
+class SystemInfo:
+    """
+    Microsoft Windows and Visual Studio related system information.
+
+    Parameters
+    ----------
+    registry_info: RegistryInfo
+        "RegistryInfo" instance.
+    vc_ver: float
+        Required Microsoft Visual C++ version.
+    """
+
+    # Variables and properties in this class use originals CamelCase variables
+    # names from Microsoft source files for more easy comparison.
+    WinDir = environ.get('WinDir', '')
+    ProgramFiles = environ.get('ProgramFiles', '')
+    ProgramFilesx86 = environ.get('ProgramFiles(x86)', ProgramFiles)
+
+    def __init__(self, registry_info, vc_ver=None):
+        self.ri = registry_info
+        self.pi = self.ri.pi
+
+        self.known_vs_paths = self.find_programdata_vs_vers()
+
+        # Except for VS15+, VC version is aligned with VS version
+        self.vs_ver = self.vc_ver = (
+            vc_ver or self._find_latest_available_vs_ver())
+
+    def _find_latest_available_vs_ver(self):
+        """
+        Find the latest VC version
+
+        Return
+        ------
+        float
+            version
+        """
+        reg_vc_vers = self.find_reg_vs_vers()
+
+        if not (reg_vc_vers or self.known_vs_paths):
+            raise distutils.errors.DistutilsPlatformError(
+                'No Microsoft Visual C++ version found')
+
+        vc_vers = set(reg_vc_vers)
+        vc_vers.update(self.known_vs_paths)
+        return sorted(vc_vers)[-1]
+
+    def find_reg_vs_vers(self):
+        """
+        Find Microsoft Visual Studio versions available in registry.
+
+        Return
+        ------
+        list of float
+            Versions
+        """
+        ms = self.ri.microsoft
+        vckeys = (self.ri.vc, self.ri.vc_for_python, self.ri.vs)
+        vs_vers = []
+        for hkey in self.ri.HKEYS:
+            for key in vckeys:
+                try:
+                    bkey = winreg.OpenKey(hkey, ms(key), 0, winreg.KEY_READ)
+                except (OSError, IOError):
+                    continue
+                with bkey:
+                    subkeys, values, _ = winreg.QueryInfoKey(bkey)
+                    for i in range(values):
+                        try:
+                            ver = float(winreg.EnumValue(bkey, i)[0])
+                            if ver not in vs_vers:
+                                vs_vers.append(ver)
+                        except ValueError:
+                            pass
+                    for i in range(subkeys):
+                        try:
+                            ver = float(winreg.EnumKey(bkey, i))
+                            if ver not in vs_vers:
+                                vs_vers.append(ver)
+                        except ValueError:
+                            pass
+        return sorted(vs_vers)
+
+    def find_programdata_vs_vers(self):
+        r"""
+        Find Visual studio 2017+ versions from information in
+        "C:\ProgramData\Microsoft\VisualStudio\Packages\_Instances".
+
+        Return
+        ------
+        dict
+            float version as key, path as value.
+        """
+        vs_versions = {}
+        instances_dir = \
+            r'C:\ProgramData\Microsoft\VisualStudio\Packages\_Instances'
+
+        try:
+            hashed_names = listdir(instances_dir)
+
+        except (OSError, IOError):
+            # Directory not exists with all Visual Studio versions
+            return vs_versions
+
+        for name in hashed_names:
+            try:
+                # Get VS installation path from "state.json" file
+                state_path = join(instances_dir, name, 'state.json')
+                with open(state_path, 'rt', encoding='utf-8') as state_file:
+                    state = json.load(state_file)
+                vs_path = state['installationPath']
+
+                # Raises OSError if this VS installation does not contain VC
+                listdir(join(vs_path, r'VC\Tools\MSVC'))
+
+                # Store version and path
+                vs_versions[self._as_float_version(
+                    state['installationVersion'])] = vs_path
+
+            except (OSError, IOError, KeyError):
+                # Skip if "state.json" file is missing or bad format
+                continue
+
+        return vs_versions
+
+    @staticmethod
+    def _as_float_version(version):
+        """
+        Return a string version as a simplified float version (major.minor)
+
+        Parameters
+        ----------
+        version: str
+            Version.
+
+        Return
+        ------
+        float
+            version
+        """
+        return float('.'.join(version.split('.')[:2]))
+
+    @property
+    def VSInstallDir(self):
+        """
+        Microsoft Visual Studio directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        # Default path
+        default = join(self.ProgramFilesx86,
+                       'Microsoft Visual Studio %0.1f' % self.vs_ver)
+
+        # Try to get path from registry, if fail use default path
+        return self.ri.lookup(self.ri.vs, '%0.1f' % self.vs_ver) or default
+
+    @property
+    def VCInstallDir(self):
+        """
+        Microsoft Visual C++ directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        path = self._guess_vc() or self._guess_vc_legacy()
+
+        if not isdir(path):
+            msg = 'Microsoft Visual C++ directory not found'
+            raise distutils.errors.DistutilsPlatformError(msg)
+
+        return path
+
+    def _guess_vc(self):
+        """
+        Locate Visual C++ for VS2017+.
+
+        Return
+        ------
+        str
+            path
+        """
+        if self.vs_ver <= 14.0:
+            return ''
+
+        try:
+            # First search in known VS paths
+            vs_dir = self.known_vs_paths[self.vs_ver]
+        except KeyError:
+            # Else, search with path from registry
+            vs_dir = self.VSInstallDir
+
+        guess_vc = join(vs_dir, r'VC\Tools\MSVC')
+
+        # Subdir with VC exact version as name
+        try:
+            # Update the VC version with real one instead of VS version
+            vc_ver = listdir(guess_vc)[-1]
+            self.vc_ver = self._as_float_version(vc_ver)
+            return join(guess_vc, vc_ver)
+        except (OSError, IOError, IndexError):
+            return ''
+
+    def _guess_vc_legacy(self):
+        """
+        Locate Visual C++ for versions prior to 2017.
+
+        Return
+        ------
+        str
+            path
+        """
+        default = join(self.ProgramFilesx86,
+                       r'Microsoft Visual Studio %0.1f\VC' % self.vs_ver)
+
+        # Try to get "VC++ for Python" path from registry as default path
+        reg_path = join(self.ri.vc_for_python, '%0.1f' % self.vs_ver)
+        python_vc = self.ri.lookup(reg_path, 'installdir')
+        default_vc = join(python_vc, 'VC') if python_vc else default
+
+        # Try to get path from registry, if fail use default path
+        return self.ri.lookup(self.ri.vc, '%0.1f' % self.vs_ver) or default_vc
+
+    @property
+    def WindowsSdkVersion(self):
+        """
+        Microsoft Windows SDK versions for specified MSVC++ version.
+
+        Return
+        ------
+        tuple of str
+            versions
+        """
+        if self.vs_ver <= 9.0:
+            return '7.0', '6.1', '6.0a'
+        elif self.vs_ver == 10.0:
+            return '7.1', '7.0a'
+        elif self.vs_ver == 11.0:
+            return '8.0', '8.0a'
+        elif self.vs_ver == 12.0:
+            return '8.1', '8.1a'
+        elif self.vs_ver >= 14.0:
+            return '10.0', '8.1'
+
+    @property
+    def WindowsSdkLastVersion(self):
+        """
+        Microsoft Windows SDK last version.
+
+        Return
+        ------
+        str
+            version
+        """
+        return self._use_last_dir_name(join(self.WindowsSdkDir, 'lib'))
+
+    @property
+    def WindowsSdkDir(self):
+        """
+        Microsoft Windows SDK directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        sdkdir = ''
+        for ver in self.WindowsSdkVersion:
+            # Try to get it from registry
+            loc = join(self.ri.windows_sdk, 'v%s' % ver)
+            sdkdir = self.ri.lookup(loc, 'installationfolder')
+            if sdkdir:
+                break
+        if not sdkdir or not isdir(sdkdir):
+            # Try to get "VC++ for Python" version from registry
+            path = join(self.ri.vc_for_python, '%0.1f' % self.vc_ver)
+            install_base = self.ri.lookup(path, 'installdir')
+            if install_base:
+                sdkdir = join(install_base, 'WinSDK')
+        if not sdkdir or not isdir(sdkdir):
+            # If fail, use default new path
+            for ver in self.WindowsSdkVersion:
+                intver = ver[:ver.rfind('.')]
+                path = r'Microsoft SDKs\Windows Kits\%s' % intver
+                d = join(self.ProgramFiles, path)
+                if isdir(d):
+                    sdkdir = d
+        if not sdkdir or not isdir(sdkdir):
+            # If fail, use default old path
+            for ver in self.WindowsSdkVersion:
+                path = r'Microsoft SDKs\Windows\v%s' % ver
+                d = join(self.ProgramFiles, path)
+                if isdir(d):
+                    sdkdir = d
+        if not sdkdir:
+            # If fail, use Platform SDK
+            sdkdir = join(self.VCInstallDir, 'PlatformSDK')
+        return sdkdir
+
+    @property
+    def WindowsSDKExecutablePath(self):
+        """
+        Microsoft Windows SDK executable directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        # Find WinSDK NetFx Tools registry dir name
+        if self.vs_ver <= 11.0:
+            netfxver = 35
+            arch = ''
+        else:
+            netfxver = 40
+            hidex86 = True if self.vs_ver <= 12.0 else False
+            arch = self.pi.current_dir(x64=True, hidex86=hidex86)
+        fx = 'WinSDK-NetFx%dTools%s' % (netfxver, arch.replace('\\', '-'))
+
+        # list all possibles registry paths
+        regpaths = []
+        if self.vs_ver >= 14.0:
+            for ver in self.NetFxSdkVersion:
+                regpaths += [join(self.ri.netfx_sdk, ver, fx)]
+
+        for ver in self.WindowsSdkVersion:
+            regpaths += [join(self.ri.windows_sdk, 'v%sA' % ver, fx)]
+
+        # Return installation folder from the more recent path
+        for path in regpaths:
+            execpath = self.ri.lookup(path, 'installationfolder')
+            if execpath:
+                return execpath
+
+    @property
+    def FSharpInstallDir(self):
+        """
+        Microsoft Visual F# directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        path = join(self.ri.visualstudio, r'%0.1f\Setup\F#' % self.vs_ver)
+        return self.ri.lookup(path, 'productdir') or ''
+
+    @property
+    def UniversalCRTSdkDir(self):
+        """
+        Microsoft Universal CRT SDK directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        # Set Kit Roots versions for specified MSVC++ version
+        vers = ('10', '81') if self.vs_ver >= 14.0 else ()
+
+        # Find path of the more recent Kit
+        for ver in vers:
+            sdkdir = self.ri.lookup(self.ri.windows_kits_roots,
+                                    'kitsroot%s' % ver)
+            if sdkdir:
+                return sdkdir or ''
+
+    @property
+    def UniversalCRTSdkLastVersion(self):
+        """
+        Microsoft Universal C Runtime SDK last version.
+
+        Return
+        ------
+        str
+            version
+        """
+        return self._use_last_dir_name(join(self.UniversalCRTSdkDir, 'lib'))
+
+    @property
+    def NetFxSdkVersion(self):
+        """
+        Microsoft .NET Framework SDK versions.
+
+        Return
+        ------
+        tuple of str
+            versions
+        """
+        # Set FxSdk versions for specified VS version
+        return (('4.7.2', '4.7.1', '4.7',
+                 '4.6.2', '4.6.1', '4.6',
+                 '4.5.2', '4.5.1', '4.5')
+                if self.vs_ver >= 14.0 else ())
+
+    @property
+    def NetFxSdkDir(self):
+        """
+        Microsoft .NET Framework SDK directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        sdkdir = ''
+        for ver in self.NetFxSdkVersion:
+            loc = join(self.ri.netfx_sdk, ver)
+            sdkdir = self.ri.lookup(loc, 'kitsinstallationfolder')
+            if sdkdir:
+                break
+        return sdkdir
+
+    @property
+    def FrameworkDir32(self):
+        """
+        Microsoft .NET Framework 32bit directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        # Default path
+        guess_fw = join(self.WinDir, r'Microsoft.NET\Framework')
+
+        # Try to get path from registry, if fail use default path
+        return self.ri.lookup(self.ri.vc, 'frameworkdir32') or guess_fw
+
+    @property
+    def FrameworkDir64(self):
+        """
+        Microsoft .NET Framework 64bit directory.
+
+        Return
+        ------
+        str
+            path
+        """
+        # Default path
+        guess_fw = join(self.WinDir, r'Microsoft.NET\Framework64')
+
+        # Try to get path from registry, if fail use default path
+        return self.ri.lookup(self.ri.vc, 'frameworkdir64') or guess_fw
+
+    @property
+    def FrameworkVersion32(self):
+        """
+        Microsoft .NET Framework 32bit versions.
+
+        Return
+        ------
+        tuple of str
+            versions
+        """
+        return self._find_dot_net_versions(32)
+
+    @property
+    def FrameworkVersion64(self):
+        """
+        Microsoft .NET Framework 64bit versions.
+
+        Return
+        ------
+        tuple of str
+            versions
+        """
+        return self._find_dot_net_versions(64)
+
+    def _find_dot_net_versions(self, bits):
+        """
+        Find Microsoft .NET Framework versions.
+
+        Parameters
+        ----------
+        bits: int
+            Platform number of bits: 32 or 64.
+
+        Return
+        ------
+        tuple of str
+            versions
+        """
+        # Find actual .NET version in registry
+        reg_ver = self.ri.lookup(self.ri.vc, 'frameworkver%d' % bits)
+        dot_net_dir = getattr(self, 'FrameworkDir%d' % bits)
+        ver = reg_ver or self._use_last_dir_name(dot_net_dir, 'v') or ''
+
+        # Set .NET versions for specified MSVC++ version
+        if self.vs_ver >= 12.0:
+            return ver, 'v4.0'
+        elif self.vs_ver >= 10.0:
+            return 'v4.0.30319' if ver.lower()[:2] != 'v4' else ver, 'v3.5'
+        elif self.vs_ver == 9.0:
+            return 'v3.5', 'v2.0.50727'
+        elif self.vs_ver == 8.0:
+            return 'v3.0', 'v2.0.50727'
+
+    @staticmethod
+    def _use_last_dir_name(path, prefix=''):
+        """
+        Return name of the last dir in path or '' if no dir found.
+
+        Parameters
+        ----------
+        path: str
+            Use dirs in this path
+        prefix: str
+            Use only dirs starting by this prefix
+
+        Return
+        ------
+        str
+            name
+        """
+        matching_dirs = (
+            dir_name
+            for dir_name in reversed(listdir(path))
+            if isdir(join(path, dir_name)) and
+            dir_name.startswith(prefix)
+        )
+        return next(matching_dirs, None) or ''
+
+
+class EnvironmentInfo:
+    """
+    Return environment variables for specified Microsoft Visual C++ version
+    and platform : Lib, Include, Path and libpath.
+
+    This function is compatible with Microsoft Visual C++ 9.0 to 14.X.
+
+    Script created by analysing Microsoft environment configuration files like
+    "vcvars[...].bat", "SetEnv.Cmd", "vcbuildtools.bat", ...
+
+    Parameters
+    ----------
+    arch: str
+        Target architecture.
+    vc_ver: float
+        Required Microsoft Visual C++ version. If not set, autodetect the last
+        version.
+    vc_min_ver: float
+        Minimum Microsoft Visual C++ version.
+    """
+
+    # Variables and properties in this class use originals CamelCase variables
+    # names from Microsoft source files for more easy comparison.
+
+    def __init__(self, arch, vc_ver=None, vc_min_ver=0):
+        self.pi = PlatformInfo(arch)
+        self.ri = RegistryInfo(self.pi)
+        self.si = SystemInfo(self.ri, vc_ver)
+
+        if self.vc_ver < vc_min_ver:
+            err = 'No suitable Microsoft Visual C++ version found'
+            raise distutils.errors.DistutilsPlatformError(err)
+
+    @property
+    def vs_ver(self):
+        """
+        Microsoft Visual Studio.
+
+        Return
+        ------
+        float
+            version
+        """
+        return self.si.vs_ver
+
+    @property
+    def vc_ver(self):
+        """
+        Microsoft Visual C++ version.
+
+        Return
+        ------
+        float
+            version
+        """
+        return self.si.vc_ver
+
+    @property
+    def VSTools(self):
+        """
+        Microsoft Visual Studio Tools.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        paths = [r'Common7\IDE', r'Common7\Tools']
+
+        if self.vs_ver >= 14.0:
+            arch_subdir = self.pi.current_dir(hidex86=True, x64=True)
+            paths += [r'Common7\IDE\CommonExtensions\Microsoft\TestWindow']
+            paths += [r'Team Tools\Performance Tools']
+            paths += [r'Team Tools\Performance Tools%s' % arch_subdir]
+
+        return [join(self.si.VSInstallDir, path) for path in paths]
+
+    @property
+    def VCIncludes(self):
+        """
+        Microsoft Visual C++ & Microsoft Foundation Class Includes.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        return [join(self.si.VCInstallDir, 'Include'),
+                join(self.si.VCInstallDir, r'ATLMFC\Include')]
+
+    @property
+    def VCLibraries(self):
+        """
+        Microsoft Visual C++ & Microsoft Foundation Class Libraries.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver >= 15.0:
+            arch_subdir = self.pi.target_dir(x64=True)
+        else:
+            arch_subdir = self.pi.target_dir(hidex86=True)
+        paths = ['Lib%s' % arch_subdir, r'ATLMFC\Lib%s' % arch_subdir]
+
+        if self.vs_ver >= 14.0:
+            paths += [r'Lib\store%s' % arch_subdir]
+
+        return [join(self.si.VCInstallDir, path) for path in paths]
+
+    @property
+    def VCStoreRefs(self):
+        """
+        Microsoft Visual C++ store references Libraries.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 14.0:
+            return []
+        return [join(self.si.VCInstallDir, r'Lib\store\references')]
+
+    @property
+    def VCTools(self):
+        """
+        Microsoft Visual C++ Tools.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        si = self.si
+        tools = [join(si.VCInstallDir, 'VCPackages')]
+
+        forcex86 = True if self.vs_ver <= 10.0 else False
+        arch_subdir = self.pi.cross_dir(forcex86)
+        if arch_subdir:
+            tools += [join(si.VCInstallDir, 'Bin%s' % arch_subdir)]
+
+        if self.vs_ver == 14.0:
+            path = 'Bin%s' % self.pi.current_dir(hidex86=True)
+            tools += [join(si.VCInstallDir, path)]
+
+        elif self.vs_ver >= 15.0:
+            host_dir = (r'bin\HostX86%s' if self.pi.current_is_x86() else
+                        r'bin\HostX64%s')
+            tools += [join(
+                si.VCInstallDir, host_dir % self.pi.target_dir(x64=True))]
+
+            if self.pi.current_cpu != self.pi.target_cpu:
+                tools += [join(
+                    si.VCInstallDir, host_dir % self.pi.current_dir(x64=True))]
+
+        else:
+            tools += [join(si.VCInstallDir, 'Bin')]
+
+        return tools
+
+    @property
+    def OSLibraries(self):
+        """
+        Microsoft Windows SDK Libraries.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver <= 10.0:
+            arch_subdir = self.pi.target_dir(hidex86=True, x64=True)
+            return [join(self.si.WindowsSdkDir, 'Lib%s' % arch_subdir)]
+
+        else:
+            arch_subdir = self.pi.target_dir(x64=True)
+            lib = join(self.si.WindowsSdkDir, 'lib')
+            libver = self._sdk_subdir
+            return [join(lib, '%sum%s' % (libver, arch_subdir))]
+
+    @property
+    def OSIncludes(self):
+        """
+        Microsoft Windows SDK Include.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        include = join(self.si.WindowsSdkDir, 'include')
+
+        if self.vs_ver <= 10.0:
+            return [include, join(include, 'gl')]
+
+        else:
+            if self.vs_ver >= 14.0:
+                sdkver = self._sdk_subdir
+            else:
+                sdkver = ''
+            return [join(include, '%sshared' % sdkver),
+                    join(include, '%sum' % sdkver),
+                    join(include, '%swinrt' % sdkver)]
+
+    @property
+    def OSLibpath(self):
+        """
+        Microsoft Windows SDK Libraries Paths.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        ref = join(self.si.WindowsSdkDir, 'References')
+        libpath = []
+
+        if self.vs_ver <= 9.0:
+            libpath += self.OSLibraries
+
+        if self.vs_ver >= 11.0:
+            libpath += [join(ref, r'CommonConfiguration\Neutral')]
+
+        if self.vs_ver >= 14.0:
+            libpath += [
+                ref,
+                join(self.si.WindowsSdkDir, 'UnionMetadata'),
+                join(
+                    ref, 'Windows.Foundation.UniversalApiContract', '1.0.0.0'),
+                join(ref, 'Windows.Foundation.FoundationContract', '1.0.0.0'),
+                join(
+                    ref, 'Windows.Networking.Connectivity.WwanContract',
+                    '1.0.0.0'),
+                join(
+                    self.si.WindowsSdkDir, 'ExtensionSDKs', 'Microsoft.VCLibs',
+                    '%0.1f' % self.vs_ver, 'References', 'CommonConfiguration',
+                    'neutral'),
+            ]
+        return libpath
+
+    @property
+    def SdkTools(self):
+        """
+        Microsoft Windows SDK Tools.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        return list(self._sdk_tools())
+
+    def _sdk_tools(self):
+        """
+        Microsoft Windows SDK Tools paths generator.
+
+        Return
+        ------
+        generator of str
+            paths
+        """
+        if self.vs_ver < 15.0:
+            bin_dir = 'Bin' if self.vs_ver <= 11.0 else r'Bin\x86'
+            yield join(self.si.WindowsSdkDir, bin_dir)
+
+        if not self.pi.current_is_x86():
+            arch_subdir = self.pi.current_dir(x64=True)
+            path = 'Bin%s' % arch_subdir
+            yield join(self.si.WindowsSdkDir, path)
+
+        if self.vs_ver in (10.0, 11.0):
+            if self.pi.target_is_x86():
+                arch_subdir = ''
+            else:
+                arch_subdir = self.pi.current_dir(hidex86=True, x64=True)
+            path = r'Bin\NETFX 4.0 Tools%s' % arch_subdir
+            yield join(self.si.WindowsSdkDir, path)
+
+        elif self.vs_ver >= 15.0:
+            path = join(self.si.WindowsSdkDir, 'Bin')
+            arch_subdir = self.pi.current_dir(x64=True)
+            sdkver = self.si.WindowsSdkLastVersion
+            yield join(path, '%s%s' % (sdkver, arch_subdir))
+
+        if self.si.WindowsSDKExecutablePath:
+            yield self.si.WindowsSDKExecutablePath
+
+    @property
+    def _sdk_subdir(self):
+        """
+        Microsoft Windows SDK version subdir.
+
+        Return
+        ------
+        str
+            subdir
+        """
+        ucrtver = self.si.WindowsSdkLastVersion
+        return ('%s\\' % ucrtver) if ucrtver else ''
+
+    @property
+    def SdkSetup(self):
+        """
+        Microsoft Windows SDK Setup.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver > 9.0:
+            return []
+
+        return [join(self.si.WindowsSdkDir, 'Setup')]
+
+    @property
+    def FxTools(self):
+        """
+        Microsoft .NET Framework Tools.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        pi = self.pi
+        si = self.si
+
+        if self.vs_ver <= 10.0:
+            include32 = True
+            include64 = not pi.target_is_x86() and not pi.current_is_x86()
+        else:
+            include32 = pi.target_is_x86() or pi.current_is_x86()
+            include64 = pi.current_cpu == 'amd64' or pi.target_cpu == 'amd64'
+
+        tools = []
+        if include32:
+            tools += [join(si.FrameworkDir32, ver)
+                      for ver in si.FrameworkVersion32]
+        if include64:
+            tools += [join(si.FrameworkDir64, ver)
+                      for ver in si.FrameworkVersion64]
+        return tools
+
+    @property
+    def NetFxSDKLibraries(self):
+        """
+        Microsoft .Net Framework SDK Libraries.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 14.0 or not self.si.NetFxSdkDir:
+            return []
+
+        arch_subdir = self.pi.target_dir(x64=True)
+        return [join(self.si.NetFxSdkDir, r'lib\um%s' % arch_subdir)]
+
+    @property
+    def NetFxSDKIncludes(self):
+        """
+        Microsoft .Net Framework SDK Includes.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 14.0 or not self.si.NetFxSdkDir:
+            return []
+
+        return [join(self.si.NetFxSdkDir, r'include\um')]
+
+    @property
+    def VsTDb(self):
+        """
+        Microsoft Visual Studio Team System Database.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        return [join(self.si.VSInstallDir, r'VSTSDB\Deploy')]
+
+    @property
+    def MSBuild(self):
+        """
+        Microsoft Build Engine.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 12.0:
+            return []
+        elif self.vs_ver < 15.0:
+            base_path = self.si.ProgramFilesx86
+            arch_subdir = self.pi.current_dir(hidex86=True)
+        else:
+            base_path = self.si.VSInstallDir
+            arch_subdir = ''
+
+        path = r'MSBuild\%0.1f\bin%s' % (self.vs_ver, arch_subdir)
+        build = [join(base_path, path)]
+
+        if self.vs_ver >= 15.0:
+            # Add Roslyn C# & Visual Basic Compiler
+            build += [join(base_path, path, 'Roslyn')]
+
+        return build
+
+    @property
+    def HTMLHelpWorkshop(self):
+        """
+        Microsoft HTML Help Workshop.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 11.0:
+            return []
+
+        return [join(self.si.ProgramFilesx86, 'HTML Help Workshop')]
+
+    @property
+    def UCRTLibraries(self):
+        """
+        Microsoft Universal C Runtime SDK Libraries.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 14.0:
+            return []
+
+        arch_subdir = self.pi.target_dir(x64=True)
+        lib = join(self.si.UniversalCRTSdkDir, 'lib')
+        ucrtver = self._ucrt_subdir
+        return [join(lib, '%sucrt%s' % (ucrtver, arch_subdir))]
+
+    @property
+    def UCRTIncludes(self):
+        """
+        Microsoft Universal C Runtime SDK Include.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if self.vs_ver < 14.0:
+            return []
+
+        include = join(self.si.UniversalCRTSdkDir, 'include')
+        return [join(include, '%sucrt' % self._ucrt_subdir)]
+
+    @property
+    def _ucrt_subdir(self):
+        """
+        Microsoft Universal C Runtime SDK version subdir.
+
+        Return
+        ------
+        str
+            subdir
+        """
+        ucrtver = self.si.UniversalCRTSdkLastVersion
+        return ('%s\\' % ucrtver) if ucrtver else ''
+
+    @property
+    def FSharp(self):
+        """
+        Microsoft Visual F#.
+
+        Return
+        ------
+        list of str
+            paths
+        """
+        if 11.0 > self.vs_ver > 12.0:
+            return []
+
+        return [self.si.FSharpInstallDir]
+
+    @property
+    def VCRuntimeRedist(self):
+        """
+        Microsoft Visual C++ runtime redistributable dll.
+
+        Return
+        ------
+        str
+            path
+        """
+        vcruntime = 'vcruntime%d0.dll' % self.vc_ver
+        arch_subdir = self.pi.target_dir(x64=True).strip('\\')
+
+        # Installation prefixes candidates
+        prefixes = []
+        tools_path = self.si.VCInstallDir
+        redist_path = dirname(tools_path.replace(r'\Tools', r'\Redist'))
+        if isdir(redist_path):
+            # Redist version may not be exactly the same as tools
+            redist_path = join(redist_path, listdir(redist_path)[-1])
+            prefixes += [redist_path, join(redist_path, 'onecore')]
+
+        prefixes += [join(tools_path, 'redist')]  # VS14 legacy path
+
+        # CRT directory
+        crt_dirs = ('Microsoft.VC%d.CRT' % (self.vc_ver * 10),
+                    # Sometime store in directory with VS version instead of VC
+                    'Microsoft.VC%d.CRT' % (int(self.vs_ver) * 10))
+
+        # vcruntime path
+        for prefix, crt_dir in itertools.product(prefixes, crt_dirs):
+            path = join(prefix, arch_subdir, crt_dir, vcruntime)
+            if isfile(path):
+                return path
+
+    def return_env(self, exists=True):
+        """
+        Return environment dict.
+
+        Parameters
+        ----------
+        exists: bool
+            It True, only return existing paths.
+
+        Return
+        ------
+        dict
+            environment
+        """
+        env = dict(
+            include=self._build_paths('include',
+                                      [self.VCIncludes,
+                                       self.OSIncludes,
+                                       self.UCRTIncludes,
+                                       self.NetFxSDKIncludes],
+                                      exists),
+            lib=self._build_paths('lib',
+                                  [self.VCLibraries,
+                                   self.OSLibraries,
+                                   self.FxTools,
+                                   self.UCRTLibraries,
+                                   self.NetFxSDKLibraries],
+                                  exists),
+            libpath=self._build_paths('libpath',
+                                      [self.VCLibraries,
+                                       self.FxTools,
+                                       self.VCStoreRefs,
+                                       self.OSLibpath],
+                                      exists),
+            path=self._build_paths('path',
+                                   [self.VCTools,
+                                    self.VSTools,
+                                    self.VsTDb,
+                                    self.SdkTools,
+                                    self.SdkSetup,
+                                    self.FxTools,
+                                    self.MSBuild,
+                                    self.HTMLHelpWorkshop,
+                                    self.FSharp],
+                                   exists),
+        )
+        if self.vs_ver >= 14 and isfile(self.VCRuntimeRedist):
+            env['py_vcruntime_redist'] = self.VCRuntimeRedist
+        return env
+
+    def _build_paths(self, name, spec_path_lists, exists):
+        """
+        Given an environment variable name and specified paths,
+        return a pathsep-separated string of paths containing
+        unique, extant, directories from those paths and from
+        the environment variable. Raise an error if no paths
+        are resolved.
+
+        Parameters
+        ----------
+        name: str
+            Environment variable name
+        spec_path_lists: list of str
+            Paths
+        exists: bool
+            It True, only return existing paths.
+
+        Return
+        ------
+        str
+            Pathsep-separated paths
+        """
+        # flatten spec_path_lists
+        spec_paths = itertools.chain.from_iterable(spec_path_lists)
+        env_paths = environ.get(name, '').split(pathsep)
+        paths = itertools.chain(spec_paths, env_paths)
+        extant_paths = list(filter(isdir, paths)) if exists else paths
+        if not extant_paths:
+            msg = "%s environment variable is empty" % name.upper()
+            raise distutils.errors.DistutilsPlatformError(msg)
+        unique_paths = self._unique_everseen(extant_paths)
+        return pathsep.join(unique_paths)
+
+    # from Python docs
+    @staticmethod
+    def _unique_everseen(iterable, key=None):
+        """
+        List unique elements, preserving order.
+        Remember all elements ever seen.
+
+        _unique_everseen('AAAABBBCCDAABBB') --> A B C D
+
+        _unique_everseen('ABBCcAD', str.lower) --> A B C D
+        """
+        seen = set()
+        seen_add = seen.add
+        if key is None:
+            for element in itertools.filterfalse(seen.__contains__, iterable):
+                seen_add(element)
+                yield element
+        else:
+            for element in iterable:
+                k = key(element)
+                if k not in seen:
+                    seen_add(k)
+                    yield element
diff --git a/venv/Lib/site-packages/setuptools/namespaces.py b/venv/Lib/site-packages/setuptools/namespaces.py
new file mode 100644
index 000000000..44939e1c6
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/namespaces.py
@@ -0,0 +1,107 @@
+import os
+from distutils import log
+import itertools
+
+
+flatten = itertools.chain.from_iterable
+
+
+class Installer:
+
+    nspkg_ext = '-nspkg.pth'
+
+    def install_namespaces(self):
+        nsp = self._get_all_ns_packages()
+        if not nsp:
+            return
+        filename, ext = os.path.splitext(self._get_target())
+        filename += self.nspkg_ext
+        self.outputs.append(filename)
+        log.info("Installing %s", filename)
+        lines = map(self._gen_nspkg_line, nsp)
+
+        if self.dry_run:
+            # always generate the lines, even in dry run
+            list(lines)
+            return
+
+        with open(filename, 'wt') as f:
+            f.writelines(lines)
+
+    def uninstall_namespaces(self):
+        filename, ext = os.path.splitext(self._get_target())
+        filename += self.nspkg_ext
+        if not os.path.exists(filename):
+            return
+        log.info("Removing %s", filename)
+        os.remove(filename)
+
+    def _get_target(self):
+        return self.target
+
+    _nspkg_tmpl = (
+        "import sys, types, os",
+        "has_mfs = sys.version_info > (3, 5)",
+        "p = os.path.join(%(root)s, *%(pth)r)",
+        "importlib = has_mfs and __import__('importlib.util')",
+        "has_mfs and __import__('importlib.machinery')",
+        (
+            "m = has_mfs and "
+            "sys.modules.setdefault(%(pkg)r, "
+            "importlib.util.module_from_spec("
+            "importlib.machinery.PathFinder.find_spec(%(pkg)r, "
+            "[os.path.dirname(p)])))"
+        ),
+        (
+            "m = m or "
+            "sys.modules.setdefault(%(pkg)r, types.ModuleType(%(pkg)r))"
+        ),
+        "mp = (m or []) and m.__dict__.setdefault('__path__',[])",
+        "(p not in mp) and mp.append(p)",
+    )
+    "lines for the namespace installer"
+
+    _nspkg_tmpl_multi = (
+        'm and setattr(sys.modules[%(parent)r], %(child)r, m)',
+    )
+    "additional line(s) when a parent package is indicated"
+
+    def _get_root(self):
+        return "sys._getframe(1).f_locals['sitedir']"
+
+    def _gen_nspkg_line(self, pkg):
+        pth = tuple(pkg.split('.'))
+        root = self._get_root()
+        tmpl_lines = self._nspkg_tmpl
+        parent, sep, child = pkg.rpartition('.')
+        if parent:
+            tmpl_lines += self._nspkg_tmpl_multi
+        return ';'.join(tmpl_lines) % locals() + '\n'
+
+    def _get_all_ns_packages(self):
+        """Return sorted list of all package namespaces"""
+        pkgs = self.distribution.namespace_packages or []
+        return sorted(flatten(map(self._pkg_names, pkgs)))
+
+    @staticmethod
+    def _pkg_names(pkg):
+        """
+        Given a namespace package, yield the components of that
+        package.
+
+        >>> names = Installer._pkg_names('a.b.c')
+        >>> set(names) == set(['a', 'a.b', 'a.b.c'])
+        True
+        """
+        parts = pkg.split('.')
+        while parts:
+            yield '.'.join(parts)
+            parts.pop()
+
+
+class DevelopInstaller(Installer):
+    def _get_root(self):
+        return repr(str(self.egg_path))
+
+    def _get_target(self):
+        return self.egg_link
diff --git a/venv/Lib/site-packages/setuptools/package_index.py b/venv/Lib/site-packages/setuptools/package_index.py
new file mode 100644
index 000000000..3979b131b
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/package_index.py
@@ -0,0 +1,1139 @@
+"""PyPI and direct package downloading"""
+import sys
+import os
+import re
+import io
+import shutil
+import socket
+import base64
+import hashlib
+import itertools
+import warnings
+import configparser
+import html
+import http.client
+import urllib.parse
+import urllib.request
+import urllib.error
+from functools import wraps
+
+import setuptools
+from pkg_resources import (
+    CHECKOUT_DIST, Distribution, BINARY_DIST, normalize_path, SOURCE_DIST,
+    Environment, find_distributions, safe_name, safe_version,
+    to_filename, Requirement, DEVELOP_DIST, EGG_DIST,
+)
+from setuptools import ssl_support
+from distutils import log
+from distutils.errors import DistutilsError
+from fnmatch import translate
+from setuptools.wheel import Wheel
+
+EGG_FRAGMENT = re.compile(r'^egg=([-A-Za-z0-9_.+!]+)$')
+HREF = re.compile(r"""href\s*=\s*['"]?([^'"> ]+)""", re.I)
+PYPI_MD5 = re.compile(
+    r'<a href="([^"#]+)">([^<]+)</a>\n\s+\(<a (?:title="MD5 hash"\n\s+)'
+    r'href="[^?]+\?:action=show_md5&amp;digest=([0-9a-f]{32})">md5</a>\)'
+)
+URL_SCHEME = re.compile('([-+.a-z0-9]{2,}):', re.I).match
+EXTENSIONS = ".tar.gz .tar.bz2 .tar .zip .tgz".split()
+
+__all__ = [
+    'PackageIndex', 'distros_for_url', 'parse_bdist_wininst',
+    'interpret_distro_name',
+]
+
+_SOCKET_TIMEOUT = 15
+
+_tmpl = "setuptools/{setuptools.__version__} Python-urllib/{py_major}"
+user_agent = _tmpl.format(
+    py_major='{}.{}'.format(*sys.version_info), setuptools=setuptools)
+
+
+def parse_requirement_arg(spec):
+    try:
+        return Requirement.parse(spec)
+    except ValueError as e:
+        raise DistutilsError(
+            "Not a URL, existing file, or requirement spec: %r" % (spec,)
+        ) from e
+
+
+def parse_bdist_wininst(name):
+    """Return (base,pyversion) or (None,None) for possible .exe name"""
+
+    lower = name.lower()
+    base, py_ver, plat = None, None, None
+
+    if lower.endswith('.exe'):
+        if lower.endswith('.win32.exe'):
+            base = name[:-10]
+            plat = 'win32'
+        elif lower.startswith('.win32-py', -16):
+            py_ver = name[-7:-4]
+            base = name[:-16]
+            plat = 'win32'
+        elif lower.endswith('.win-amd64.exe'):
+            base = name[:-14]
+            plat = 'win-amd64'
+        elif lower.startswith('.win-amd64-py', -20):
+            py_ver = name[-7:-4]
+            base = name[:-20]
+            plat = 'win-amd64'
+    return base, py_ver, plat
+
+
+def egg_info_for_url(url):
+    parts = urllib.parse.urlparse(url)
+    scheme, server, path, parameters, query, fragment = parts
+    base = urllib.parse.unquote(path.split('/')[-1])
+    if server == 'sourceforge.net' and base == 'download':  # XXX Yuck
+        base = urllib.parse.unquote(path.split('/')[-2])
+    if '#' in base:
+        base, fragment = base.split('#', 1)
+    return base, fragment
+
+
+def distros_for_url(url, metadata=None):
+    """Yield egg or source distribution objects that might be found at a URL"""
+    base, fragment = egg_info_for_url(url)
+    for dist in distros_for_location(url, base, metadata):
+        yield dist
+    if fragment:
+        match = EGG_FRAGMENT.match(fragment)
+        if match:
+            for dist in interpret_distro_name(
+                url, match.group(1), metadata, precedence=CHECKOUT_DIST
+            ):
+                yield dist
+
+
+def distros_for_location(location, basename, metadata=None):
+    """Yield egg or source distribution objects based on basename"""
+    if basename.endswith('.egg.zip'):
+        basename = basename[:-4]  # strip the .zip
+    if basename.endswith('.egg') and '-' in basename:
+        # only one, unambiguous interpretation
+        return [Distribution.from_location(location, basename, metadata)]
+    if basename.endswith('.whl') and '-' in basename:
+        wheel = Wheel(basename)
+        if not wheel.is_compatible():
+            return []
+        return [Distribution(
+            location=location,
+            project_name=wheel.project_name,
+            version=wheel.version,
+            # Increase priority over eggs.
+            precedence=EGG_DIST + 1,
+        )]
+    if basename.endswith('.exe'):
+        win_base, py_ver, platform = parse_bdist_wininst(basename)
+        if win_base is not None:
+            return interpret_distro_name(
+                location, win_base, metadata, py_ver, BINARY_DIST, platform
+            )
+    # Try source distro extensions (.zip, .tgz, etc.)
+    #
+    for ext in EXTENSIONS:
+        if basename.endswith(ext):
+            basename = basename[:-len(ext)]
+            return interpret_distro_name(location, basename, metadata)
+    return []  # no extension matched
+
+
+def distros_for_filename(filename, metadata=None):
+    """Yield possible egg or source distribution objects based on a filename"""
+    return distros_for_location(
+        normalize_path(filename), os.path.basename(filename), metadata
+    )
+
+
+def interpret_distro_name(
+        location, basename, metadata, py_version=None, precedence=SOURCE_DIST,
+        platform=None
+):
+    """Generate alternative interpretations of a source distro name
+
+    Note: if `location` is a filesystem filename, you should call
+    ``pkg_resources.normalize_path()`` on it before passing it to this
+    routine!
+    """
+    # Generate alternative interpretations of a source distro name
+    # Because some packages are ambiguous as to name/versions split
+    # e.g. "adns-python-1.1.0", "egenix-mx-commercial", etc.
+    # So, we generate each possible interepretation (e.g. "adns, python-1.1.0"
+    # "adns-python, 1.1.0", and "adns-python-1.1.0, no version").  In practice,
+    # the spurious interpretations should be ignored, because in the event
+    # there's also an "adns" package, the spurious "python-1.1.0" version will
+    # compare lower than any numeric version number, and is therefore unlikely
+    # to match a request for it.  It's still a potential problem, though, and
+    # in the long run PyPI and the distutils should go for "safe" names and
+    # versions in distribution archive names (sdist and bdist).
+
+    parts = basename.split('-')
+    if not py_version and any(re.match(r'py\d\.\d$', p) for p in parts[2:]):
+        # it is a bdist_dumb, not an sdist -- bail out
+        return
+
+    for p in range(1, len(parts) + 1):
+        yield Distribution(
+            location, metadata, '-'.join(parts[:p]), '-'.join(parts[p:]),
+            py_version=py_version, precedence=precedence,
+            platform=platform
+        )
+
+
+# From Python 2.7 docs
+def unique_everseen(iterable, key=None):
+    "List unique elements, preserving order. Remember all elements ever seen."
+    # unique_everseen('AAAABBBCCDAABBB') --> A B C D
+    # unique_everseen('ABBCcAD', str.lower) --> A B C D
+    seen = set()
+    seen_add = seen.add
+    if key is None:
+        for element in itertools.filterfalse(seen.__contains__, iterable):
+            seen_add(element)
+            yield element
+    else:
+        for element in iterable:
+            k = key(element)
+            if k not in seen:
+                seen_add(k)
+                yield element
+
+
+def unique_values(func):
+    """
+    Wrap a function returning an iterable such that the resulting iterable
+    only ever yields unique items.
+    """
+
+    @wraps(func)
+    def wrapper(*args, **kwargs):
+        return unique_everseen(func(*args, **kwargs))
+
+    return wrapper
+
+
+REL = re.compile(r"""<([^>]*\srel\s*=\s*['"]?([^'">]+)[^>]*)>""", re.I)
+# this line is here to fix emacs' cruddy broken syntax highlighting
+
+
+@unique_values
+def find_external_links(url, page):
+    """Find rel="homepage" and rel="download" links in `page`, yielding URLs"""
+
+    for match in REL.finditer(page):
+        tag, rel = match.groups()
+        rels = set(map(str.strip, rel.lower().split(',')))
+        if 'homepage' in rels or 'download' in rels:
+            for match in HREF.finditer(tag):
+                yield urllib.parse.urljoin(url, htmldecode(match.group(1)))
+
+    for tag in ("<th>Home Page", "<th>Download URL"):
+        pos = page.find(tag)
+        if pos != -1:
+            match = HREF.search(page, pos)
+            if match:
+                yield urllib.parse.urljoin(url, htmldecode(match.group(1)))
+
+
+class ContentChecker:
+    """
+    A null content checker that defines the interface for checking content
+    """
+
+    def feed(self, block):
+        """
+        Feed a block of data to the hash.
+        """
+        return
+
+    def is_valid(self):
+        """
+        Check the hash. Return False if validation fails.
+        """
+        return True
+
+    def report(self, reporter, template):
+        """
+        Call reporter with information about the checker (hash name)
+        substituted into the template.
+        """
+        return
+
+
+class HashChecker(ContentChecker):
+    pattern = re.compile(
+        r'(?P<hash_name>sha1|sha224|sha384|sha256|sha512|md5)='
+        r'(?P<expected>[a-f0-9]+)'
+    )
+
+    def __init__(self, hash_name, expected):
+        self.hash_name = hash_name
+        self.hash = hashlib.new(hash_name)
+        self.expected = expected
+
+    @classmethod
+    def from_url(cls, url):
+        "Construct a (possibly null) ContentChecker from a URL"
+        fragment = urllib.parse.urlparse(url)[-1]
+        if not fragment:
+            return ContentChecker()
+        match = cls.pattern.search(fragment)
+        if not match:
+            return ContentChecker()
+        return cls(**match.groupdict())
+
+    def feed(self, block):
+        self.hash.update(block)
+
+    def is_valid(self):
+        return self.hash.hexdigest() == self.expected
+
+    def report(self, reporter, template):
+        msg = template % self.hash_name
+        return reporter(msg)
+
+
+class PackageIndex(Environment):
+    """A distribution index that scans web pages for download URLs"""
+
+    def __init__(
+            self, index_url="https://pypi.org/simple/", hosts=('*',),
+            ca_bundle=None, verify_ssl=True, *args, **kw
+    ):
+        Environment.__init__(self, *args, **kw)
+        self.index_url = index_url + "/" [:not index_url.endswith('/')]
+        self.scanned_urls = {}
+        self.fetched_urls = {}
+        self.package_pages = {}
+        self.allows = re.compile('|'.join(map(translate, hosts))).match
+        self.to_scan = []
+        use_ssl = (
+            verify_ssl
+            and ssl_support.is_available
+            and (ca_bundle or ssl_support.find_ca_bundle())
+        )
+        if use_ssl:
+            self.opener = ssl_support.opener_for(ca_bundle)
+        else:
+            self.opener = urllib.request.urlopen
+
+    def process_url(self, url, retrieve=False):
+        """Evaluate a URL as a possible download, and maybe retrieve it"""
+        if url in self.scanned_urls and not retrieve:
+            return
+        self.scanned_urls[url] = True
+        if not URL_SCHEME(url):
+            self.process_filename(url)
+            return
+        else:
+            dists = list(distros_for_url(url))
+            if dists:
+                if not self.url_ok(url):
+                    return
+                self.debug("Found link: %s", url)
+
+        if dists or not retrieve or url in self.fetched_urls:
+            list(map(self.add, dists))
+            return  # don't need the actual page
+
+        if not self.url_ok(url):
+            self.fetched_urls[url] = True
+            return
+
+        self.info("Reading %s", url)
+        self.fetched_urls[url] = True  # prevent multiple fetch attempts
+        tmpl = "Download error on %s: %%s -- Some packages may not be found!"
+        f = self.open_url(url, tmpl % url)
+        if f is None:
+            return
+        if isinstance(f, urllib.error.HTTPError) and f.code == 401:
+            self.info("Authentication error: %s" % f.msg)
+        self.fetched_urls[f.url] = True
+        if 'html' not in f.headers.get('content-type', '').lower():
+            f.close()  # not html, we can't process it
+            return
+
+        base = f.url  # handle redirects
+        page = f.read()
+        if not isinstance(page, str):
+            # In Python 3 and got bytes but want str.
+            if isinstance(f, urllib.error.HTTPError):
+                # Errors have no charset, assume latin1:
+                charset = 'latin-1'
+            else:
+                charset = f.headers.get_param('charset') or 'latin-1'
+            page = page.decode(charset, "ignore")
+        f.close()
+        for match in HREF.finditer(page):
+            link = urllib.parse.urljoin(base, htmldecode(match.group(1)))
+            self.process_url(link)
+        if url.startswith(self.index_url) and getattr(f, 'code', None) != 404:
+            page = self.process_index(url, page)
+
+    def process_filename(self, fn, nested=False):
+        # process filenames or directories
+        if not os.path.exists(fn):
+            self.warn("Not found: %s", fn)
+            return
+
+        if os.path.isdir(fn) and not nested:
+            path = os.path.realpath(fn)
+            for item in os.listdir(path):
+                self.process_filename(os.path.join(path, item), True)
+
+        dists = distros_for_filename(fn)
+        if dists:
+            self.debug("Found: %s", fn)
+            list(map(self.add, dists))
+
+    def url_ok(self, url, fatal=False):
+        s = URL_SCHEME(url)
+        is_file = s and s.group(1).lower() == 'file'
+        if is_file or self.allows(urllib.parse.urlparse(url)[1]):
+            return True
+        msg = (
+            "\nNote: Bypassing %s (disallowed host; see "
+            "http://bit.ly/2hrImnY for details).\n")
+        if fatal:
+            raise DistutilsError(msg % url)
+        else:
+            self.warn(msg, url)
+
+    def scan_egg_links(self, search_path):
+        dirs = filter(os.path.isdir, search_path)
+        egg_links = (
+            (path, entry)
+            for path in dirs
+            for entry in os.listdir(path)
+            if entry.endswith('.egg-link')
+        )
+        list(itertools.starmap(self.scan_egg_link, egg_links))
+
+    def scan_egg_link(self, path, entry):
+        with open(os.path.join(path, entry)) as raw_lines:
+            # filter non-empty lines
+            lines = list(filter(None, map(str.strip, raw_lines)))
+
+        if len(lines) != 2:
+            # format is not recognized; punt
+            return
+
+        egg_path, setup_path = lines
+
+        for dist in find_distributions(os.path.join(path, egg_path)):
+            dist.location = os.path.join(path, *lines)
+            dist.precedence = SOURCE_DIST
+            self.add(dist)
+
+    def process_index(self, url, page):
+        """Process the contents of a PyPI page"""
+
+        def scan(link):
+            # Process a URL to see if it's for a package page
+            if link.startswith(self.index_url):
+                parts = list(map(
+                    urllib.parse.unquote, link[len(self.index_url):].split('/')
+                ))
+                if len(parts) == 2 and '#' not in parts[1]:
+                    # it's a package page, sanitize and index it
+                    pkg = safe_name(parts[0])
+                    ver = safe_version(parts[1])
+                    self.package_pages.setdefault(pkg.lower(), {})[link] = True
+                    return to_filename(pkg), to_filename(ver)
+            return None, None
+
+        # process an index page into the package-page index
+        for match in HREF.finditer(page):
+            try:
+                scan(urllib.parse.urljoin(url, htmldecode(match.group(1))))
+            except ValueError:
+                pass
+
+        pkg, ver = scan(url)  # ensure this page is in the page index
+        if pkg:
+            # process individual package page
+            for new_url in find_external_links(url, page):
+                # Process the found URL
+                base, frag = egg_info_for_url(new_url)
+                if base.endswith('.py') and not frag:
+                    if ver:
+                        new_url += '#egg=%s-%s' % (pkg, ver)
+                    else:
+                        self.need_version_info(url)
+                self.scan_url(new_url)
+
+            return PYPI_MD5.sub(
+                lambda m: '<a href="%s#md5=%s">%s</a>' % m.group(1, 3, 2), page
+            )
+        else:
+            return ""  # no sense double-scanning non-package pages
+
+    def need_version_info(self, url):
+        self.scan_all(
+            "Page at %s links to .py file(s) without version info; an index "
+            "scan is required.", url
+        )
+
+    def scan_all(self, msg=None, *args):
+        if self.index_url not in self.fetched_urls:
+            if msg:
+                self.warn(msg, *args)
+            self.info(
+                "Scanning index of all packages (this may take a while)"
+            )
+        self.scan_url(self.index_url)
+
+    def find_packages(self, requirement):
+        self.scan_url(self.index_url + requirement.unsafe_name + '/')
+
+        if not self.package_pages.get(requirement.key):
+            # Fall back to safe version of the name
+            self.scan_url(self.index_url + requirement.project_name + '/')
+
+        if not self.package_pages.get(requirement.key):
+            # We couldn't find the target package, so search the index page too
+            self.not_found_in_index(requirement)
+
+        for url in list(self.package_pages.get(requirement.key, ())):
+            # scan each page that might be related to the desired package
+            self.scan_url(url)
+
+    def obtain(self, requirement, installer=None):
+        self.prescan()
+        self.find_packages(requirement)
+        for dist in self[requirement.key]:
+            if dist in requirement:
+                return dist
+            self.debug("%s does not match %s", requirement, dist)
+        return super(PackageIndex, self).obtain(requirement, installer)
+
+    def check_hash(self, checker, filename, tfp):
+        """
+        checker is a ContentChecker
+        """
+        checker.report(
+            self.debug,
+            "Validating %%s checksum for %s" % filename)
+        if not checker.is_valid():
+            tfp.close()
+            os.unlink(filename)
+            raise DistutilsError(
+                "%s validation failed for %s; "
+                "possible download problem?"
+                % (checker.hash.name, os.path.basename(filename))
+            )
+
+    def add_find_links(self, urls):
+        """Add `urls` to the list that will be prescanned for searches"""
+        for url in urls:
+            if (
+                self.to_scan is None  # if we have already "gone online"
+                or not URL_SCHEME(url)  # or it's a local file/directory
+                or url.startswith('file:')
+                or list(distros_for_url(url))  # or a direct package link
+            ):
+                # then go ahead and process it now
+                self.scan_url(url)
+            else:
+                # otherwise, defer retrieval till later
+                self.to_scan.append(url)
+
+    def prescan(self):
+        """Scan urls scheduled for prescanning (e.g. --find-links)"""
+        if self.to_scan:
+            list(map(self.scan_url, self.to_scan))
+        self.to_scan = None  # from now on, go ahead and process immediately
+
+    def not_found_in_index(self, requirement):
+        if self[requirement.key]:  # we've seen at least one distro
+            meth, msg = self.info, "Couldn't retrieve index page for %r"
+        else:  # no distros seen for this name, might be misspelled
+            meth, msg = (
+                self.warn,
+                "Couldn't find index page for %r (maybe misspelled?)")
+        meth(msg, requirement.unsafe_name)
+        self.scan_all()
+
+    def download(self, spec, tmpdir):
+        """Locate and/or download `spec` to `tmpdir`, returning a local path
+
+        `spec` may be a ``Requirement`` object, or a string containing a URL,
+        an existing local filename, or a project/version requirement spec
+        (i.e. the string form of a ``Requirement`` object).  If it is the URL
+        of a .py file with an unambiguous ``#egg=name-version`` tag (i.e., one
+        that escapes ``-`` as ``_`` throughout), a trivial ``setup.py`` is
+        automatically created alongside the downloaded file.
+
+        If `spec` is a ``Requirement`` object or a string containing a
+        project/version requirement spec, this method returns the location of
+        a matching distribution (possibly after downloading it to `tmpdir`).
+        If `spec` is a locally existing file or directory name, it is simply
+        returned unchanged.  If `spec` is a URL, it is downloaded to a subpath
+        of `tmpdir`, and the local filename is returned.  Various errors may be
+        raised if a problem occurs during downloading.
+        """
+        if not isinstance(spec, Requirement):
+            scheme = URL_SCHEME(spec)
+            if scheme:
+                # It's a url, download it to tmpdir
+                found = self._download_url(scheme.group(1), spec, tmpdir)
+                base, fragment = egg_info_for_url(spec)
+                if base.endswith('.py'):
+                    found = self.gen_setup(found, fragment, tmpdir)
+                return found
+            elif os.path.exists(spec):
+                # Existing file or directory, just return it
+                return spec
+            else:
+                spec = parse_requirement_arg(spec)
+        return getattr(self.fetch_distribution(spec, tmpdir), 'location', None)
+
+    def fetch_distribution(
+            self, requirement, tmpdir, force_scan=False, source=False,
+            develop_ok=False, local_index=None):
+        """Obtain a distribution suitable for fulfilling `requirement`
+
+        `requirement` must be a ``pkg_resources.Requirement`` instance.
+        If necessary, or if the `force_scan` flag is set, the requirement is
+        searched for in the (online) package index as well as the locally
+        installed packages.  If a distribution matching `requirement` is found,
+        the returned distribution's ``location`` is the value you would have
+        gotten from calling the ``download()`` method with the matching
+        distribution's URL or filename.  If no matching distribution is found,
+        ``None`` is returned.
+
+        If the `source` flag is set, only source distributions and source
+        checkout links will be considered.  Unless the `develop_ok` flag is
+        set, development and system eggs (i.e., those using the ``.egg-info``
+        format) will be ignored.
+        """
+        # process a Requirement
+        self.info("Searching for %s", requirement)
+        skipped = {}
+        dist = None
+
+        def find(req, env=None):
+            if env is None:
+                env = self
+            # Find a matching distribution; may be called more than once
+
+            for dist in env[req.key]:
+
+                if dist.precedence == DEVELOP_DIST and not develop_ok:
+                    if dist not in skipped:
+                        self.warn(
+                            "Skipping development or system egg: %s", dist,
+                        )
+                        skipped[dist] = 1
+                    continue
+
+                test = (
+                    dist in req
+                    and (dist.precedence <= SOURCE_DIST or not source)
+                )
+                if test:
+                    loc = self.download(dist.location, tmpdir)
+                    dist.download_location = loc
+                    if os.path.exists(dist.download_location):
+                        return dist
+
+        if force_scan:
+            self.prescan()
+            self.find_packages(requirement)
+            dist = find(requirement)
+
+        if not dist and local_index is not None:
+            dist = find(requirement, local_index)
+
+        if dist is None:
+            if self.to_scan is not None:
+                self.prescan()
+            dist = find(requirement)
+
+        if dist is None and not force_scan:
+            self.find_packages(requirement)
+            dist = find(requirement)
+
+        if dist is None:
+            self.warn(
+                "No local packages or working download links found for %s%s",
+                (source and "a source distribution of " or ""),
+                requirement,
+            )
+        else:
+            self.info("Best match: %s", dist)
+            return dist.clone(location=dist.download_location)
+
+    def fetch(self, requirement, tmpdir, force_scan=False, source=False):
+        """Obtain a file suitable for fulfilling `requirement`
+
+        DEPRECATED; use the ``fetch_distribution()`` method now instead.  For
+        backward compatibility, this routine is identical but returns the
+        ``location`` of the downloaded distribution instead of a distribution
+        object.
+        """
+        dist = self.fetch_distribution(requirement, tmpdir, force_scan, source)
+        if dist is not None:
+            return dist.location
+        return None
+
+    def gen_setup(self, filename, fragment, tmpdir):
+        match = EGG_FRAGMENT.match(fragment)
+        dists = match and [
+            d for d in
+            interpret_distro_name(filename, match.group(1), None) if d.version
+        ] or []
+
+        if len(dists) == 1:  # unambiguous ``#egg`` fragment
+            basename = os.path.basename(filename)
+
+            # Make sure the file has been downloaded to the temp dir.
+            if os.path.dirname(filename) != tmpdir:
+                dst = os.path.join(tmpdir, basename)
+                from setuptools.command.easy_install import samefile
+                if not samefile(filename, dst):
+                    shutil.copy2(filename, dst)
+                    filename = dst
+
+            with open(os.path.join(tmpdir, 'setup.py'), 'w') as file:
+                file.write(
+                    "from setuptools import setup\n"
+                    "setup(name=%r, version=%r, py_modules=[%r])\n"
+                    % (
+                        dists[0].project_name, dists[0].version,
+                        os.path.splitext(basename)[0]
+                    )
+                )
+            return filename
+
+        elif match:
+            raise DistutilsError(
+                "Can't unambiguously interpret project/version identifier %r; "
+                "any dashes in the name or version should be escaped using "
+                "underscores. %r" % (fragment, dists)
+            )
+        else:
+            raise DistutilsError(
+                "Can't process plain .py files without an '#egg=name-version'"
+                " suffix to enable automatic setup script generation."
+            )
+
+    dl_blocksize = 8192
+
+    def _download_to(self, url, filename):
+        self.info("Downloading %s", url)
+        # Download the file
+        fp = None
+        try:
+            checker = HashChecker.from_url(url)
+            fp = self.open_url(url)
+            if isinstance(fp, urllib.error.HTTPError):
+                raise DistutilsError(
+                    "Can't download %s: %s %s" % (url, fp.code, fp.msg)
+                )
+            headers = fp.info()
+            blocknum = 0
+            bs = self.dl_blocksize
+            size = -1
+            if "content-length" in headers:
+                # Some servers return multiple Content-Length headers :(
+                sizes = headers.get_all('Content-Length')
+                size = max(map(int, sizes))
+                self.reporthook(url, filename, blocknum, bs, size)
+            with open(filename, 'wb') as tfp:
+                while True:
+                    block = fp.read(bs)
+                    if block:
+                        checker.feed(block)
+                        tfp.write(block)
+                        blocknum += 1
+                        self.reporthook(url, filename, blocknum, bs, size)
+                    else:
+                        break
+                self.check_hash(checker, filename, tfp)
+            return headers
+        finally:
+            if fp:
+                fp.close()
+
+    def reporthook(self, url, filename, blocknum, blksize, size):
+        pass  # no-op
+
+    def open_url(self, url, warning=None):
+        if url.startswith('file:'):
+            return local_open(url)
+        try:
+            return open_with_auth(url, self.opener)
+        except (ValueError, http.client.InvalidURL) as v:
+            msg = ' '.join([str(arg) for arg in v.args])
+            if warning:
+                self.warn(warning, msg)
+            else:
+                raise DistutilsError('%s %s' % (url, msg)) from v
+        except urllib.error.HTTPError as v:
+            return v
+        except urllib.error.URLError as v:
+            if warning:
+                self.warn(warning, v.reason)
+            else:
+                raise DistutilsError("Download error for %s: %s"
+                                     % (url, v.reason)) from v
+        except http.client.BadStatusLine as v:
+            if warning:
+                self.warn(warning, v.line)
+            else:
+                raise DistutilsError(
+                    '%s returned a bad status line. The server might be '
+                    'down, %s' %
+                    (url, v.line)
+                ) from v
+        except (http.client.HTTPException, socket.error) as v:
+            if warning:
+                self.warn(warning, v)
+            else:
+                raise DistutilsError("Download error for %s: %s"
+                                     % (url, v)) from v
+
+    def _download_url(self, scheme, url, tmpdir):
+        # Determine download filename
+        #
+        name, fragment = egg_info_for_url(url)
+        if name:
+            while '..' in name:
+                name = name.replace('..', '.').replace('\\', '_')
+        else:
+            name = "__downloaded__"  # default if URL has no path contents
+
+        if name.endswith('.egg.zip'):
+            name = name[:-4]  # strip the extra .zip before download
+
+        filename = os.path.join(tmpdir, name)
+
+        # Download the file
+        #
+        if scheme == 'svn' or scheme.startswith('svn+'):
+            return self._download_svn(url, filename)
+        elif scheme == 'git' or scheme.startswith('git+'):
+            return self._download_git(url, filename)
+        elif scheme.startswith('hg+'):
+            return self._download_hg(url, filename)
+        elif scheme == 'file':
+            return urllib.request.url2pathname(urllib.parse.urlparse(url)[2])
+        else:
+            self.url_ok(url, True)  # raises error if not allowed
+            return self._attempt_download(url, filename)
+
+    def scan_url(self, url):
+        self.process_url(url, True)
+
+    def _attempt_download(self, url, filename):
+        headers = self._download_to(url, filename)
+        if 'html' in headers.get('content-type', '').lower():
+            return self._download_html(url, headers, filename)
+        else:
+            return filename
+
+    def _download_html(self, url, headers, filename):
+        file = open(filename)
+        for line in file:
+            if line.strip():
+                # Check for a subversion index page
+                if re.search(r'<title>([^- ]+ - )?Revision \d+:', line):
+                    # it's a subversion index page:
+                    file.close()
+                    os.unlink(filename)
+                    return self._download_svn(url, filename)
+                break  # not an index page
+        file.close()
+        os.unlink(filename)
+        raise DistutilsError("Unexpected HTML page found at " + url)
+
+    def _download_svn(self, url, filename):
+        warnings.warn("SVN download support is deprecated", UserWarning)
+        url = url.split('#', 1)[0]  # remove any fragment for svn's sake
+        creds = ''
+        if url.lower().startswith('svn:') and '@' in url:
+            scheme, netloc, path, p, q, f = urllib.parse.urlparse(url)
+            if not netloc and path.startswith('//') and '/' in path[2:]:
+                netloc, path = path[2:].split('/', 1)
+                auth, host = _splituser(netloc)
+                if auth:
+                    if ':' in auth:
+                        user, pw = auth.split(':', 1)
+                        creds = " --username=%s --password=%s" % (user, pw)
+                    else:
+                        creds = " --username=" + auth
+                    netloc = host
+                    parts = scheme, netloc, url, p, q, f
+                    url = urllib.parse.urlunparse(parts)
+        self.info("Doing subversion checkout from %s to %s", url, filename)
+        os.system("svn checkout%s -q %s %s" % (creds, url, filename))
+        return filename
+
+    @staticmethod
+    def _vcs_split_rev_from_url(url, pop_prefix=False):
+        scheme, netloc, path, query, frag = urllib.parse.urlsplit(url)
+
+        scheme = scheme.split('+', 1)[-1]
+
+        # Some fragment identification fails
+        path = path.split('#', 1)[0]
+
+        rev = None
+        if '@' in path:
+            path, rev = path.rsplit('@', 1)
+
+        # Also, discard fragment
+        url = urllib.parse.urlunsplit((scheme, netloc, path, query, ''))
+
+        return url, rev
+
+    def _download_git(self, url, filename):
+        filename = filename.split('#', 1)[0]
+        url, rev = self._vcs_split_rev_from_url(url, pop_prefix=True)
+
+        self.info("Doing git clone from %s to %s", url, filename)
+        os.system("git clone --quiet %s %s" % (url, filename))
+
+        if rev is not None:
+            self.info("Checking out %s", rev)
+            os.system("git -C %s checkout --quiet %s" % (
+                filename,
+                rev,
+            ))
+
+        return filename
+
+    def _download_hg(self, url, filename):
+        filename = filename.split('#', 1)[0]
+        url, rev = self._vcs_split_rev_from_url(url, pop_prefix=True)
+
+        self.info("Doing hg clone from %s to %s", url, filename)
+        os.system("hg clone --quiet %s %s" % (url, filename))
+
+        if rev is not None:
+            self.info("Updating to %s", rev)
+            os.system("hg --cwd %s up -C -r %s -q" % (
+                filename,
+                rev,
+            ))
+
+        return filename
+
+    def debug(self, msg, *args):
+        log.debug(msg, *args)
+
+    def info(self, msg, *args):
+        log.info(msg, *args)
+
+    def warn(self, msg, *args):
+        log.warn(msg, *args)
+
+
+# This pattern matches a character entity reference (a decimal numeric
+# references, a hexadecimal numeric reference, or a named reference).
+entity_sub = re.compile(r'&(#(\d+|x[\da-fA-F]+)|[\w.:-]+);?').sub
+
+
+def decode_entity(match):
+    what = match.group(0)
+    return html.unescape(what)
+
+
+def htmldecode(text):
+    """
+    Decode HTML entities in the given text.
+
+    >>> htmldecode(
+    ...     'https://../package_name-0.1.2.tar.gz'
+    ...     '?tokena=A&amp;tokenb=B">package_name-0.1.2.tar.gz')
+    'https://../package_name-0.1.2.tar.gz?tokena=A&tokenb=B">package_name-0.1.2.tar.gz'
+    """
+    return entity_sub(decode_entity, text)
+
+
+def socket_timeout(timeout=15):
+    def _socket_timeout(func):
+        def _socket_timeout(*args, **kwargs):
+            old_timeout = socket.getdefaulttimeout()
+            socket.setdefaulttimeout(timeout)
+            try:
+                return func(*args, **kwargs)
+            finally:
+                socket.setdefaulttimeout(old_timeout)
+
+        return _socket_timeout
+
+    return _socket_timeout
+
+
+def _encode_auth(auth):
+    """
+    Encode auth from a URL suitable for an HTTP header.
+    >>> str(_encode_auth('username%3Apassword'))
+    'dXNlcm5hbWU6cGFzc3dvcmQ='
+
+    Long auth strings should not cause a newline to be inserted.
+    >>> long_auth = 'username:' + 'password'*10
+    >>> chr(10) in str(_encode_auth(long_auth))
+    False
+    """
+    auth_s = urllib.parse.unquote(auth)
+    # convert to bytes
+    auth_bytes = auth_s.encode()
+    encoded_bytes = base64.b64encode(auth_bytes)
+    # convert back to a string
+    encoded = encoded_bytes.decode()
+    # strip the trailing carriage return
+    return encoded.replace('\n', '')
+
+
+class Credential:
+    """
+    A username/password pair. Use like a namedtuple.
+    """
+
+    def __init__(self, username, password):
+        self.username = username
+        self.password = password
+
+    def __iter__(self):
+        yield self.username
+        yield self.password
+
+    def __str__(self):
+        return '%(username)s:%(password)s' % vars(self)
+
+
+class PyPIConfig(configparser.RawConfigParser):
+    def __init__(self):
+        """
+        Load from ~/.pypirc
+        """
+        defaults = dict.fromkeys(['username', 'password', 'repository'], '')
+        configparser.RawConfigParser.__init__(self, defaults)
+
+        rc = os.path.join(os.path.expanduser('~'), '.pypirc')
+        if os.path.exists(rc):
+            self.read(rc)
+
+    @property
+    def creds_by_repository(self):
+        sections_with_repositories = [
+            section for section in self.sections()
+            if self.get(section, 'repository').strip()
+        ]
+
+        return dict(map(self._get_repo_cred, sections_with_repositories))
+
+    def _get_repo_cred(self, section):
+        repo = self.get(section, 'repository').strip()
+        return repo, Credential(
+            self.get(section, 'username').strip(),
+            self.get(section, 'password').strip(),
+        )
+
+    def find_credential(self, url):
+        """
+        If the URL indicated appears to be a repository defined in this
+        config, return the credential for that repository.
+        """
+        for repository, cred in self.creds_by_repository.items():
+            if url.startswith(repository):
+                return cred
+
+
+def open_with_auth(url, opener=urllib.request.urlopen):
+    """Open a urllib2 request, handling HTTP authentication"""
+
+    parsed = urllib.parse.urlparse(url)
+    scheme, netloc, path, params, query, frag = parsed
+
+    # Double scheme does not raise on macOS as revealed by a
+    # failing test. We would expect "nonnumeric port". Refs #20.
+    if netloc.endswith(':'):
+        raise http.client.InvalidURL("nonnumeric port: ''")
+
+    if scheme in ('http', 'https'):
+        auth, address = _splituser(netloc)
+    else:
+        auth = None
+
+    if not auth:
+        cred = PyPIConfig().find_credential(url)
+        if cred:
+            auth = str(cred)
+            info = cred.username, url
+            log.info('Authenticating as %s for %s (from .pypirc)', *info)
+
+    if auth:
+        auth = "Basic " + _encode_auth(auth)
+        parts = scheme, address, path, params, query, frag
+        new_url = urllib.parse.urlunparse(parts)
+        request = urllib.request.Request(new_url)
+        request.add_header("Authorization", auth)
+    else:
+        request = urllib.request.Request(url)
+
+    request.add_header('User-Agent', user_agent)
+    fp = opener(request)
+
+    if auth:
+        # Put authentication info back into request URL if same host,
+        # so that links found on the page will work
+        s2, h2, path2, param2, query2, frag2 = urllib.parse.urlparse(fp.url)
+        if s2 == scheme and h2 == address:
+            parts = s2, netloc, path2, param2, query2, frag2
+            fp.url = urllib.parse.urlunparse(parts)
+
+    return fp
+
+
+# copy of urllib.parse._splituser from Python 3.8
+def _splituser(host):
+    """splituser('user[:passwd]@host[:port]')
+    --> 'user[:passwd]', 'host[:port]'."""
+    user, delim, host = host.rpartition('@')
+    return (user if delim else None), host
+
+
+# adding a timeout to avoid freezing package_index
+open_with_auth = socket_timeout(_SOCKET_TIMEOUT)(open_with_auth)
+
+
+def fix_sf_url(url):
+    return url  # backward compatibility
+
+
+def local_open(url):
+    """Read a local path, with special support for directories"""
+    scheme, server, path, param, query, frag = urllib.parse.urlparse(url)
+    filename = urllib.request.url2pathname(path)
+    if os.path.isfile(filename):
+        return urllib.request.urlopen(url)
+    elif path.endswith('/') and os.path.isdir(filename):
+        files = []
+        for f in os.listdir(filename):
+            filepath = os.path.join(filename, f)
+            if f == 'index.html':
+                with open(filepath, 'r') as fp:
+                    body = fp.read()
+                break
+            elif os.path.isdir(filepath):
+                f += '/'
+            files.append('<a href="{name}">{name}</a>'.format(name=f))
+        else:
+            tmpl = (
+                "<html><head><title>{url}</title>"
+                "</head><body>{files}</body></html>")
+            body = tmpl.format(url=url, files='\n'.join(files))
+        status, message = 200, "OK"
+    else:
+        status, message, body = 404, "Path not found", "Not found"
+
+    headers = {'content-type': 'text/html'}
+    body_stream = io.StringIO(body)
+    return urllib.error.HTTPError(url, status, message, headers, body_stream)
diff --git a/venv/Lib/site-packages/setuptools/py34compat.py b/venv/Lib/site-packages/setuptools/py34compat.py
new file mode 100644
index 000000000..3ad917222
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/py34compat.py
@@ -0,0 +1,13 @@
+import importlib
+
+try:
+    import importlib.util
+except ImportError:
+    pass
+
+
+try:
+    module_from_spec = importlib.util.module_from_spec
+except AttributeError:
+    def module_from_spec(spec):
+        return spec.loader.load_module(spec.name)
diff --git a/venv/Lib/site-packages/setuptools/sandbox.py b/venv/Lib/site-packages/setuptools/sandbox.py
new file mode 100644
index 000000000..91b960d89
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/sandbox.py
@@ -0,0 +1,496 @@
+import os
+import sys
+import tempfile
+import operator
+import functools
+import itertools
+import re
+import contextlib
+import pickle
+import textwrap
+import builtins
+
+import pkg_resources
+from distutils.errors import DistutilsError
+from pkg_resources import working_set
+
+if sys.platform.startswith('java'):
+    import org.python.modules.posix.PosixModule as _os
+else:
+    _os = sys.modules[os.name]
+try:
+    _file = file
+except NameError:
+    _file = None
+_open = open
+
+
+__all__ = [
+    "AbstractSandbox", "DirectorySandbox", "SandboxViolation", "run_setup",
+]
+
+
+def _execfile(filename, globals, locals=None):
+    """
+    Python 3 implementation of execfile.
+    """
+    mode = 'rb'
+    with open(filename, mode) as stream:
+        script = stream.read()
+    if locals is None:
+        locals = globals
+    code = compile(script, filename, 'exec')
+    exec(code, globals, locals)
+
+
+@contextlib.contextmanager
+def save_argv(repl=None):
+    saved = sys.argv[:]
+    if repl is not None:
+        sys.argv[:] = repl
+    try:
+        yield saved
+    finally:
+        sys.argv[:] = saved
+
+
+@contextlib.contextmanager
+def save_path():
+    saved = sys.path[:]
+    try:
+        yield saved
+    finally:
+        sys.path[:] = saved
+
+
+@contextlib.contextmanager
+def override_temp(replacement):
+    """
+    Monkey-patch tempfile.tempdir with replacement, ensuring it exists
+    """
+    os.makedirs(replacement, exist_ok=True)
+
+    saved = tempfile.tempdir
+
+    tempfile.tempdir = replacement
+
+    try:
+        yield
+    finally:
+        tempfile.tempdir = saved
+
+
+@contextlib.contextmanager
+def pushd(target):
+    saved = os.getcwd()
+    os.chdir(target)
+    try:
+        yield saved
+    finally:
+        os.chdir(saved)
+
+
+class UnpickleableException(Exception):
+    """
+    An exception representing another Exception that could not be pickled.
+    """
+
+    @staticmethod
+    def dump(type, exc):
+        """
+        Always return a dumped (pickled) type and exc. If exc can't be pickled,
+        wrap it in UnpickleableException first.
+        """
+        try:
+            return pickle.dumps(type), pickle.dumps(exc)
+        except Exception:
+            # get UnpickleableException inside the sandbox
+            from setuptools.sandbox import UnpickleableException as cls
+            return cls.dump(cls, cls(repr(exc)))
+
+
+class ExceptionSaver:
+    """
+    A Context Manager that will save an exception, serialized, and restore it
+    later.
+    """
+
+    def __enter__(self):
+        return self
+
+    def __exit__(self, type, exc, tb):
+        if not exc:
+            return
+
+        # dump the exception
+        self._saved = UnpickleableException.dump(type, exc)
+        self._tb = tb
+
+        # suppress the exception
+        return True
+
+    def resume(self):
+        "restore and re-raise any exception"
+
+        if '_saved' not in vars(self):
+            return
+
+        type, exc = map(pickle.loads, self._saved)
+        raise exc.with_traceback(self._tb)
+
+
+@contextlib.contextmanager
+def save_modules():
+    """
+    Context in which imported modules are saved.
+
+    Translates exceptions internal to the context into the equivalent exception
+    outside the context.
+    """
+    saved = sys.modules.copy()
+    with ExceptionSaver() as saved_exc:
+        yield saved
+
+    sys.modules.update(saved)
+    # remove any modules imported since
+    del_modules = (
+        mod_name for mod_name in sys.modules
+        if mod_name not in saved
+        # exclude any encodings modules. See #285
+        and not mod_name.startswith('encodings.')
+    )
+    _clear_modules(del_modules)
+
+    saved_exc.resume()
+
+
+def _clear_modules(module_names):
+    for mod_name in list(module_names):
+        del sys.modules[mod_name]
+
+
+@contextlib.contextmanager
+def save_pkg_resources_state():
+    saved = pkg_resources.__getstate__()
+    try:
+        yield saved
+    finally:
+        pkg_resources.__setstate__(saved)
+
+
+@contextlib.contextmanager
+def setup_context(setup_dir):
+    temp_dir = os.path.join(setup_dir, 'temp')
+    with save_pkg_resources_state():
+        with save_modules():
+            with save_path():
+                hide_setuptools()
+                with save_argv():
+                    with override_temp(temp_dir):
+                        with pushd(setup_dir):
+                            # ensure setuptools commands are available
+                            __import__('setuptools')
+                            yield
+
+
+_MODULES_TO_HIDE = {
+    'setuptools',
+    'distutils',
+    'pkg_resources',
+    'Cython',
+    '_distutils_hack',
+}
+
+
+def _needs_hiding(mod_name):
+    """
+    >>> _needs_hiding('setuptools')
+    True
+    >>> _needs_hiding('pkg_resources')
+    True
+    >>> _needs_hiding('setuptools_plugin')
+    False
+    >>> _needs_hiding('setuptools.__init__')
+    True
+    >>> _needs_hiding('distutils')
+    True
+    >>> _needs_hiding('os')
+    False
+    >>> _needs_hiding('Cython')
+    True
+    """
+    base_module = mod_name.split('.', 1)[0]
+    return base_module in _MODULES_TO_HIDE
+
+
+def hide_setuptools():
+    """
+    Remove references to setuptools' modules from sys.modules to allow the
+    invocation to import the most appropriate setuptools. This technique is
+    necessary to avoid issues such as #315 where setuptools upgrading itself
+    would fail to find a function declared in the metadata.
+    """
+    _distutils_hack = sys.modules.get('_distutils_hack', None)
+    if _distutils_hack is not None:
+        _distutils_hack.remove_shim()
+
+    modules = filter(_needs_hiding, sys.modules)
+    _clear_modules(modules)
+
+
+def run_setup(setup_script, args):
+    """Run a distutils setup script, sandboxed in its directory"""
+    setup_dir = os.path.abspath(os.path.dirname(setup_script))
+    with setup_context(setup_dir):
+        try:
+            sys.argv[:] = [setup_script] + list(args)
+            sys.path.insert(0, setup_dir)
+            # reset to include setup dir, w/clean callback list
+            working_set.__init__()
+            working_set.callbacks.append(lambda dist: dist.activate())
+
+            with DirectorySandbox(setup_dir):
+                ns = dict(__file__=setup_script, __name__='__main__')
+                _execfile(setup_script, ns)
+        except SystemExit as v:
+            if v.args and v.args[0]:
+                raise
+            # Normal exit, just return
+
+
+class AbstractSandbox:
+    """Wrap 'os' module and 'open()' builtin for virtualizing setup scripts"""
+
+    _active = False
+
+    def __init__(self):
+        self._attrs = [
+            name for name in dir(_os)
+            if not name.startswith('_') and hasattr(self, name)
+        ]
+
+    def _copy(self, source):
+        for name in self._attrs:
+            setattr(os, name, getattr(source, name))
+
+    def __enter__(self):
+        self._copy(self)
+        if _file:
+            builtins.file = self._file
+        builtins.open = self._open
+        self._active = True
+
+    def __exit__(self, exc_type, exc_value, traceback):
+        self._active = False
+        if _file:
+            builtins.file = _file
+        builtins.open = _open
+        self._copy(_os)
+
+    def run(self, func):
+        """Run 'func' under os sandboxing"""
+        with self:
+            return func()
+
+    def _mk_dual_path_wrapper(name):
+        original = getattr(_os, name)
+
+        def wrap(self, src, dst, *args, **kw):
+            if self._active:
+                src, dst = self._remap_pair(name, src, dst, *args, **kw)
+            return original(src, dst, *args, **kw)
+
+        return wrap
+
+    for name in ["rename", "link", "symlink"]:
+        if hasattr(_os, name):
+            locals()[name] = _mk_dual_path_wrapper(name)
+
+    def _mk_single_path_wrapper(name, original=None):
+        original = original or getattr(_os, name)
+
+        def wrap(self, path, *args, **kw):
+            if self._active:
+                path = self._remap_input(name, path, *args, **kw)
+            return original(path, *args, **kw)
+
+        return wrap
+
+    if _file:
+        _file = _mk_single_path_wrapper('file', _file)
+    _open = _mk_single_path_wrapper('open', _open)
+    for name in [
+        "stat", "listdir", "chdir", "open", "chmod", "chown", "mkdir",
+        "remove", "unlink", "rmdir", "utime", "lchown", "chroot", "lstat",
+        "startfile", "mkfifo", "mknod", "pathconf", "access"
+    ]:
+        if hasattr(_os, name):
+            locals()[name] = _mk_single_path_wrapper(name)
+
+    def _mk_single_with_return(name):
+        original = getattr(_os, name)
+
+        def wrap(self, path, *args, **kw):
+            if self._active:
+                path = self._remap_input(name, path, *args, **kw)
+                return self._remap_output(name, original(path, *args, **kw))
+            return original(path, *args, **kw)
+
+        return wrap
+
+    for name in ['readlink', 'tempnam']:
+        if hasattr(_os, name):
+            locals()[name] = _mk_single_with_return(name)
+
+    def _mk_query(name):
+        original = getattr(_os, name)
+
+        def wrap(self, *args, **kw):
+            retval = original(*args, **kw)
+            if self._active:
+                return self._remap_output(name, retval)
+            return retval
+
+        return wrap
+
+    for name in ['getcwd', 'tmpnam']:
+        if hasattr(_os, name):
+            locals()[name] = _mk_query(name)
+
+    def _validate_path(self, path):
+        """Called to remap or validate any path, whether input or output"""
+        return path
+
+    def _remap_input(self, operation, path, *args, **kw):
+        """Called for path inputs"""
+        return self._validate_path(path)
+
+    def _remap_output(self, operation, path):
+        """Called for path outputs"""
+        return self._validate_path(path)
+
+    def _remap_pair(self, operation, src, dst, *args, **kw):
+        """Called for path pairs like rename, link, and symlink operations"""
+        return (
+            self._remap_input(operation + '-from', src, *args, **kw),
+            self._remap_input(operation + '-to', dst, *args, **kw)
+        )
+
+
+if hasattr(os, 'devnull'):
+    _EXCEPTIONS = [os.devnull]
+else:
+    _EXCEPTIONS = []
+
+
+class DirectorySandbox(AbstractSandbox):
+    """Restrict operations to a single subdirectory - pseudo-chroot"""
+
+    write_ops = dict.fromkeys([
+        "open", "chmod", "chown", "mkdir", "remove", "unlink", "rmdir",
+        "utime", "lchown", "chroot", "mkfifo", "mknod", "tempnam",
+    ])
+
+    _exception_patterns = [
+        # Allow lib2to3 to attempt to save a pickled grammar object (#121)
+        r'.*lib2to3.*\.pickle$',
+    ]
+    "exempt writing to paths that match the pattern"
+
+    def __init__(self, sandbox, exceptions=_EXCEPTIONS):
+        self._sandbox = os.path.normcase(os.path.realpath(sandbox))
+        self._prefix = os.path.join(self._sandbox, '')
+        self._exceptions = [
+            os.path.normcase(os.path.realpath(path))
+            for path in exceptions
+        ]
+        AbstractSandbox.__init__(self)
+
+    def _violation(self, operation, *args, **kw):
+        from setuptools.sandbox import SandboxViolation
+        raise SandboxViolation(operation, args, kw)
+
+    if _file:
+
+        def _file(self, path, mode='r', *args, **kw):
+            if mode not in ('r', 'rt', 'rb', 'rU', 'U') and not self._ok(path):
+                self._violation("file", path, mode, *args, **kw)
+            return _file(path, mode, *args, **kw)
+
+    def _open(self, path, mode='r', *args, **kw):
+        if mode not in ('r', 'rt', 'rb', 'rU', 'U') and not self._ok(path):
+            self._violation("open", path, mode, *args, **kw)
+        return _open(path, mode, *args, **kw)
+
+    def tmpnam(self):
+        self._violation("tmpnam")
+
+    def _ok(self, path):
+        active = self._active
+        try:
+            self._active = False
+            realpath = os.path.normcase(os.path.realpath(path))
+            return (
+                self._exempted(realpath)
+                or realpath == self._sandbox
+                or realpath.startswith(self._prefix)
+            )
+        finally:
+            self._active = active
+
+    def _exempted(self, filepath):
+        start_matches = (
+            filepath.startswith(exception)
+            for exception in self._exceptions
+        )
+        pattern_matches = (
+            re.match(pattern, filepath)
+            for pattern in self._exception_patterns
+        )
+        candidates = itertools.chain(start_matches, pattern_matches)
+        return any(candidates)
+
+    def _remap_input(self, operation, path, *args, **kw):
+        """Called for path inputs"""
+        if operation in self.write_ops and not self._ok(path):
+            self._violation(operation, os.path.realpath(path), *args, **kw)
+        return path
+
+    def _remap_pair(self, operation, src, dst, *args, **kw):
+        """Called for path pairs like rename, link, and symlink operations"""
+        if not self._ok(src) or not self._ok(dst):
+            self._violation(operation, src, dst, *args, **kw)
+        return (src, dst)
+
+    def open(self, file, flags, mode=0o777, *args, **kw):
+        """Called for low-level os.open()"""
+        if flags & WRITE_FLAGS and not self._ok(file):
+            self._violation("os.open", file, flags, mode, *args, **kw)
+        return _os.open(file, flags, mode, *args, **kw)
+
+
+WRITE_FLAGS = functools.reduce(
+    operator.or_, [
+        getattr(_os, a, 0) for a in
+        "O_WRONLY O_RDWR O_APPEND O_CREAT O_TRUNC O_TEMPORARY".split()]
+)
+
+
+class SandboxViolation(DistutilsError):
+    """A setup script attempted to modify the filesystem outside the sandbox"""
+
+    tmpl = textwrap.dedent("""
+        SandboxViolation: {cmd}{args!r} {kwargs}
+
+        The package setup script has attempted to modify files on your system
+        that are not within the EasyInstall build area, and has been aborted.
+
+        This package cannot be safely installed by EasyInstall, and may not
+        support alternate installation locations even if you run its setup
+        script by hand.  Please inform the package's author and the EasyInstall
+        maintainers to find out if a fix or workaround is available.
+        """).lstrip()
+
+    def __str__(self):
+        cmd, args, kwargs = self.args
+        return self.tmpl.format(**locals())
diff --git a/venv/Lib/site-packages/setuptools/script (dev).tmpl b/venv/Lib/site-packages/setuptools/script (dev).tmpl
new file mode 100644
index 000000000..39a24b048
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/script (dev).tmpl	
@@ -0,0 +1,6 @@
+# EASY-INSTALL-DEV-SCRIPT: %(spec)r,%(script_name)r
+__requires__ = %(spec)r
+__import__('pkg_resources').require(%(spec)r)
+__file__ = %(dev_path)r
+with open(__file__) as f:
+    exec(compile(f.read(), __file__, 'exec'))
diff --git a/venv/Lib/site-packages/setuptools/script.tmpl b/venv/Lib/site-packages/setuptools/script.tmpl
new file mode 100644
index 000000000..ff5efbcab
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/script.tmpl
@@ -0,0 +1,3 @@
+# EASY-INSTALL-SCRIPT: %(spec)r,%(script_name)r
+__requires__ = %(spec)r
+__import__('pkg_resources').run_script(%(spec)r, %(script_name)r)
diff --git a/venv/Lib/site-packages/setuptools/ssl_support.py b/venv/Lib/site-packages/setuptools/ssl_support.py
new file mode 100644
index 000000000..eac5e6560
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/ssl_support.py
@@ -0,0 +1,266 @@
+import os
+import socket
+import atexit
+import re
+import functools
+import urllib.request
+import http.client
+
+
+from pkg_resources import ResolutionError, ExtractionError
+
+try:
+    import ssl
+except ImportError:
+    ssl = None
+
+__all__ = [
+    'VerifyingHTTPSHandler', 'find_ca_bundle', 'is_available', 'cert_paths',
+    'opener_for'
+]
+
+cert_paths = """
+/etc/pki/tls/certs/ca-bundle.crt
+/etc/ssl/certs/ca-certificates.crt
+/usr/share/ssl/certs/ca-bundle.crt
+/usr/local/share/certs/ca-root.crt
+/etc/ssl/cert.pem
+/System/Library/OpenSSL/certs/cert.pem
+/usr/local/share/certs/ca-root-nss.crt
+/etc/ssl/ca-bundle.pem
+""".strip().split()
+
+try:
+    HTTPSHandler = urllib.request.HTTPSHandler
+    HTTPSConnection = http.client.HTTPSConnection
+except AttributeError:
+    HTTPSHandler = HTTPSConnection = object
+
+is_available = ssl is not None and object not in (
+    HTTPSHandler, HTTPSConnection)
+
+
+try:
+    from ssl import CertificateError, match_hostname
+except ImportError:
+    try:
+        from backports.ssl_match_hostname import CertificateError
+        from backports.ssl_match_hostname import match_hostname
+    except ImportError:
+        CertificateError = None
+        match_hostname = None
+
+if not CertificateError:
+
+    class CertificateError(ValueError):
+        pass
+
+
+if not match_hostname:
+
+    def _dnsname_match(dn, hostname, max_wildcards=1):
+        """Matching according to RFC 6125, section 6.4.3
+
+        https://tools.ietf.org/html/rfc6125#section-6.4.3
+        """
+        pats = []
+        if not dn:
+            return False
+
+        # Ported from python3-syntax:
+        # leftmost, *remainder = dn.split(r'.')
+        parts = dn.split(r'.')
+        leftmost = parts[0]
+        remainder = parts[1:]
+
+        wildcards = leftmost.count('*')
+        if wildcards > max_wildcards:
+            # Issue #17980: avoid denials of service by refusing more
+            # than one wildcard per fragment.  A survey of established
+            # policy among SSL implementations showed it to be a
+            # reasonable choice.
+            raise CertificateError(
+                "too many wildcards in certificate DNS name: " + repr(dn))
+
+        # speed up common case w/o wildcards
+        if not wildcards:
+            return dn.lower() == hostname.lower()
+
+        # RFC 6125, section 6.4.3, subitem 1.
+        # The client SHOULD NOT attempt to match a
+        # presented identifier in which the wildcard
+        # character comprises a label other than the
+        # left-most label.
+        if leftmost == '*':
+            # When '*' is a fragment by itself, it matches a non-empty dotless
+            # fragment.
+            pats.append('[^.]+')
+        elif leftmost.startswith('xn--') or hostname.startswith('xn--'):
+            # RFC 6125, section 6.4.3, subitem 3.
+            # The client SHOULD NOT attempt to match a presented identifier
+            # where the wildcard character is embedded within an A-label or
+            # U-label of an internationalized domain name.
+            pats.append(re.escape(leftmost))
+        else:
+            # Otherwise, '*' matches any dotless string, e.g. www*
+            pats.append(re.escape(leftmost).replace(r'\*', '[^.]*'))
+
+        # add the remaining fragments, ignore any wildcards
+        for frag in remainder:
+            pats.append(re.escape(frag))
+
+        pat = re.compile(r'\A' + r'\.'.join(pats) + r'\Z', re.IGNORECASE)
+        return pat.match(hostname)
+
+    def match_hostname(cert, hostname):
+        """Verify that *cert* (in decoded format as returned by
+        SSLSocket.getpeercert()) matches the *hostname*.  RFC 2818 and RFC 6125
+        rules are followed, but IP addresses are not accepted for *hostname*.
+
+        CertificateError is raised on failure. On success, the function
+        returns nothing.
+        """
+        if not cert:
+            raise ValueError("empty or no certificate")
+        dnsnames = []
+        san = cert.get('subjectAltName', ())
+        for key, value in san:
+            if key == 'DNS':
+                if _dnsname_match(value, hostname):
+                    return
+                dnsnames.append(value)
+        if not dnsnames:
+            # The subject is only checked when there is no dNSName entry
+            # in subjectAltName
+            for sub in cert.get('subject', ()):
+                for key, value in sub:
+                    # XXX according to RFC 2818, the most specific Common Name
+                    # must be used.
+                    if key == 'commonName':
+                        if _dnsname_match(value, hostname):
+                            return
+                        dnsnames.append(value)
+        if len(dnsnames) > 1:
+            raise CertificateError(
+                "hostname %r doesn't match either of %s"
+                % (hostname, ', '.join(map(repr, dnsnames))))
+        elif len(dnsnames) == 1:
+            raise CertificateError(
+                "hostname %r doesn't match %r"
+                % (hostname, dnsnames[0]))
+        else:
+            raise CertificateError(
+                "no appropriate commonName or "
+                "subjectAltName fields were found")
+
+
+class VerifyingHTTPSHandler(HTTPSHandler):
+    """Simple verifying handler: no auth, subclasses, timeouts, etc."""
+
+    def __init__(self, ca_bundle):
+        self.ca_bundle = ca_bundle
+        HTTPSHandler.__init__(self)
+
+    def https_open(self, req):
+        return self.do_open(
+            lambda host, **kw: VerifyingHTTPSConn(host, self.ca_bundle, **kw),
+            req
+        )
+
+
+class VerifyingHTTPSConn(HTTPSConnection):
+    """Simple verifying connection: no auth, subclasses, timeouts, etc."""
+
+    def __init__(self, host, ca_bundle, **kw):
+        HTTPSConnection.__init__(self, host, **kw)
+        self.ca_bundle = ca_bundle
+
+    def connect(self):
+        sock = socket.create_connection(
+            (self.host, self.port), getattr(self, 'source_address', None)
+        )
+
+        # Handle the socket if a (proxy) tunnel is present
+        if hasattr(self, '_tunnel') and getattr(self, '_tunnel_host', None):
+            self.sock = sock
+            self._tunnel()
+            # http://bugs.python.org/issue7776: Python>=3.4.1 and >=2.7.7
+            # change self.host to mean the proxy server host when tunneling is
+            # being used. Adapt, since we are interested in the destination
+            # host for the match_hostname() comparison.
+            actual_host = self._tunnel_host
+        else:
+            actual_host = self.host
+
+        if hasattr(ssl, 'create_default_context'):
+            ctx = ssl.create_default_context(cafile=self.ca_bundle)
+            self.sock = ctx.wrap_socket(sock, server_hostname=actual_host)
+        else:
+            # This is for python < 2.7.9 and < 3.4?
+            self.sock = ssl.wrap_socket(
+                sock, cert_reqs=ssl.CERT_REQUIRED, ca_certs=self.ca_bundle
+            )
+        try:
+            match_hostname(self.sock.getpeercert(), actual_host)
+        except CertificateError:
+            self.sock.shutdown(socket.SHUT_RDWR)
+            self.sock.close()
+            raise
+
+
+def opener_for(ca_bundle=None):
+    """Get a urlopen() replacement that uses ca_bundle for verification"""
+    return urllib.request.build_opener(
+        VerifyingHTTPSHandler(ca_bundle or find_ca_bundle())
+    ).open
+
+
+# from jaraco.functools
+def once(func):
+    @functools.wraps(func)
+    def wrapper(*args, **kwargs):
+        if not hasattr(func, 'always_returns'):
+            func.always_returns = func(*args, **kwargs)
+        return func.always_returns
+    return wrapper
+
+
+@once
+def get_win_certfile():
+    try:
+        import wincertstore
+    except ImportError:
+        return None
+
+    class CertFile(wincertstore.CertFile):
+        def __init__(self):
+            super(CertFile, self).__init__()
+            atexit.register(self.close)
+
+        def close(self):
+            try:
+                super(CertFile, self).close()
+            except OSError:
+                pass
+
+    _wincerts = CertFile()
+    _wincerts.addstore('CA')
+    _wincerts.addstore('ROOT')
+    return _wincerts.name
+
+
+def find_ca_bundle():
+    """Return an existing CA bundle path, or None"""
+    extant_cert_paths = filter(os.path.isfile, cert_paths)
+    return (
+        get_win_certfile()
+        or next(extant_cert_paths, None)
+        or _certifi_where()
+    )
+
+
+def _certifi_where():
+    try:
+        return __import__('certifi').where()
+    except (ImportError, ResolutionError, ExtractionError):
+        pass
diff --git a/venv/Lib/site-packages/setuptools/unicode_utils.py b/venv/Lib/site-packages/setuptools/unicode_utils.py
new file mode 100644
index 000000000..e84e65e3e
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/unicode_utils.py
@@ -0,0 +1,42 @@
+import unicodedata
+import sys
+
+
+# HFS Plus uses decomposed UTF-8
+def decompose(path):
+    if isinstance(path, str):
+        return unicodedata.normalize('NFD', path)
+    try:
+        path = path.decode('utf-8')
+        path = unicodedata.normalize('NFD', path)
+        path = path.encode('utf-8')
+    except UnicodeError:
+        pass  # Not UTF-8
+    return path
+
+
+def filesys_decode(path):
+    """
+    Ensure that the given path is decoded,
+    NONE when no expected encoding works
+    """
+
+    if isinstance(path, str):
+        return path
+
+    fs_enc = sys.getfilesystemencoding() or 'utf-8'
+    candidates = fs_enc, 'utf-8'
+
+    for enc in candidates:
+        try:
+            return path.decode(enc)
+        except UnicodeDecodeError:
+            continue
+
+
+def try_encode(string, enc):
+    "turn unicode encoding into a functional routine"
+    try:
+        return string.encode(enc)
+    except UnicodeEncodeError:
+        return None
diff --git a/venv/Lib/site-packages/setuptools/version.py b/venv/Lib/site-packages/setuptools/version.py
new file mode 100644
index 000000000..95e186965
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/version.py
@@ -0,0 +1,6 @@
+import pkg_resources
+
+try:
+    __version__ = pkg_resources.get_distribution('setuptools').version
+except Exception:
+    __version__ = 'unknown'
diff --git a/venv/Lib/site-packages/setuptools/wheel.py b/venv/Lib/site-packages/setuptools/wheel.py
new file mode 100644
index 000000000..0be811af2
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/wheel.py
@@ -0,0 +1,213 @@
+"""Wheels support."""
+
+from distutils.util import get_platform
+from distutils import log
+import email
+import itertools
+import os
+import posixpath
+import re
+import zipfile
+
+import pkg_resources
+import setuptools
+from pkg_resources import parse_version
+from setuptools.extern.packaging.tags import sys_tags
+from setuptools.extern.packaging.utils import canonicalize_name
+from setuptools.command.egg_info import write_requirements
+
+
+WHEEL_NAME = re.compile(
+    r"""^(?P<project_name>.+?)-(?P<version>\d.*?)
+    ((-(?P<build>\d.*?))?-(?P<py_version>.+?)-(?P<abi>.+?)-(?P<platform>.+?)
+    )\.whl$""",
+    re.VERBOSE).match
+
+NAMESPACE_PACKAGE_INIT = \
+    "__import__('pkg_resources').declare_namespace(__name__)\n"
+
+
+def unpack(src_dir, dst_dir):
+    '''Move everything under `src_dir` to `dst_dir`, and delete the former.'''
+    for dirpath, dirnames, filenames in os.walk(src_dir):
+        subdir = os.path.relpath(dirpath, src_dir)
+        for f in filenames:
+            src = os.path.join(dirpath, f)
+            dst = os.path.join(dst_dir, subdir, f)
+            os.renames(src, dst)
+        for n, d in reversed(list(enumerate(dirnames))):
+            src = os.path.join(dirpath, d)
+            dst = os.path.join(dst_dir, subdir, d)
+            if not os.path.exists(dst):
+                # Directory does not exist in destination,
+                # rename it and prune it from os.walk list.
+                os.renames(src, dst)
+                del dirnames[n]
+    # Cleanup.
+    for dirpath, dirnames, filenames in os.walk(src_dir, topdown=True):
+        assert not filenames
+        os.rmdir(dirpath)
+
+
+class Wheel:
+
+    def __init__(self, filename):
+        match = WHEEL_NAME(os.path.basename(filename))
+        if match is None:
+            raise ValueError('invalid wheel name: %r' % filename)
+        self.filename = filename
+        for k, v in match.groupdict().items():
+            setattr(self, k, v)
+
+    def tags(self):
+        '''List tags (py_version, abi, platform) supported by this wheel.'''
+        return itertools.product(
+            self.py_version.split('.'),
+            self.abi.split('.'),
+            self.platform.split('.'),
+        )
+
+    def is_compatible(self):
+        '''Is the wheel is compatible with the current platform?'''
+        supported_tags = set(
+            (t.interpreter, t.abi, t.platform) for t in sys_tags())
+        return next((True for t in self.tags() if t in supported_tags), False)
+
+    def egg_name(self):
+        return pkg_resources.Distribution(
+            project_name=self.project_name, version=self.version,
+            platform=(None if self.platform == 'any' else get_platform()),
+        ).egg_name() + '.egg'
+
+    def get_dist_info(self, zf):
+        # find the correct name of the .dist-info dir in the wheel file
+        for member in zf.namelist():
+            dirname = posixpath.dirname(member)
+            if (dirname.endswith('.dist-info') and
+                    canonicalize_name(dirname).startswith(
+                        canonicalize_name(self.project_name))):
+                return dirname
+        raise ValueError("unsupported wheel format. .dist-info not found")
+
+    def install_as_egg(self, destination_eggdir):
+        '''Install wheel as an egg directory.'''
+        with zipfile.ZipFile(self.filename) as zf:
+            self._install_as_egg(destination_eggdir, zf)
+
+    def _install_as_egg(self, destination_eggdir, zf):
+        dist_basename = '%s-%s' % (self.project_name, self.version)
+        dist_info = self.get_dist_info(zf)
+        dist_data = '%s.data' % dist_basename
+        egg_info = os.path.join(destination_eggdir, 'EGG-INFO')
+
+        self._convert_metadata(zf, destination_eggdir, dist_info, egg_info)
+        self._move_data_entries(destination_eggdir, dist_data)
+        self._fix_namespace_packages(egg_info, destination_eggdir)
+
+    @staticmethod
+    def _convert_metadata(zf, destination_eggdir, dist_info, egg_info):
+        def get_metadata(name):
+            with zf.open(posixpath.join(dist_info, name)) as fp:
+                value = fp.read().decode('utf-8')
+                return email.parser.Parser().parsestr(value)
+
+        wheel_metadata = get_metadata('WHEEL')
+        # Check wheel format version is supported.
+        wheel_version = parse_version(wheel_metadata.get('Wheel-Version'))
+        wheel_v1 = (
+            parse_version('1.0') <= wheel_version < parse_version('2.0dev0')
+        )
+        if not wheel_v1:
+            raise ValueError(
+                'unsupported wheel format version: %s' % wheel_version)
+        # Extract to target directory.
+        os.mkdir(destination_eggdir)
+        zf.extractall(destination_eggdir)
+        # Convert metadata.
+        dist_info = os.path.join(destination_eggdir, dist_info)
+        dist = pkg_resources.Distribution.from_location(
+            destination_eggdir, dist_info,
+            metadata=pkg_resources.PathMetadata(destination_eggdir, dist_info),
+        )
+
+        # Note: Evaluate and strip markers now,
+        # as it's difficult to convert back from the syntax:
+        # foobar; "linux" in sys_platform and extra == 'test'
+        def raw_req(req):
+            req.marker = None
+            return str(req)
+        install_requires = list(sorted(map(raw_req, dist.requires())))
+        extras_require = {
+            extra: sorted(
+                req
+                for req in map(raw_req, dist.requires((extra,)))
+                if req not in install_requires
+            )
+            for extra in dist.extras
+        }
+        os.rename(dist_info, egg_info)
+        os.rename(
+            os.path.join(egg_info, 'METADATA'),
+            os.path.join(egg_info, 'PKG-INFO'),
+        )
+        setup_dist = setuptools.Distribution(
+            attrs=dict(
+                install_requires=install_requires,
+                extras_require=extras_require,
+            ),
+        )
+        # Temporarily disable info traces.
+        log_threshold = log._global_log.threshold
+        log.set_threshold(log.WARN)
+        try:
+            write_requirements(
+                setup_dist.get_command_obj('egg_info'),
+                None,
+                os.path.join(egg_info, 'requires.txt'),
+            )
+        finally:
+            log.set_threshold(log_threshold)
+
+    @staticmethod
+    def _move_data_entries(destination_eggdir, dist_data):
+        """Move data entries to their correct location."""
+        dist_data = os.path.join(destination_eggdir, dist_data)
+        dist_data_scripts = os.path.join(dist_data, 'scripts')
+        if os.path.exists(dist_data_scripts):
+            egg_info_scripts = os.path.join(
+                destination_eggdir, 'EGG-INFO', 'scripts')
+            os.mkdir(egg_info_scripts)
+            for entry in os.listdir(dist_data_scripts):
+                # Remove bytecode, as it's not properly handled
+                # during easy_install scripts install phase.
+                if entry.endswith('.pyc'):
+                    os.unlink(os.path.join(dist_data_scripts, entry))
+                else:
+                    os.rename(
+                        os.path.join(dist_data_scripts, entry),
+                        os.path.join(egg_info_scripts, entry),
+                    )
+            os.rmdir(dist_data_scripts)
+        for subdir in filter(os.path.exists, (
+            os.path.join(dist_data, d)
+            for d in ('data', 'headers', 'purelib', 'platlib')
+        )):
+            unpack(subdir, destination_eggdir)
+        if os.path.exists(dist_data):
+            os.rmdir(dist_data)
+
+    @staticmethod
+    def _fix_namespace_packages(egg_info, destination_eggdir):
+        namespace_packages = os.path.join(
+            egg_info, 'namespace_packages.txt')
+        if os.path.exists(namespace_packages):
+            with open(namespace_packages) as fp:
+                namespace_packages = fp.read().split()
+            for mod in namespace_packages:
+                mod_dir = os.path.join(destination_eggdir, *mod.split('.'))
+                mod_init = os.path.join(mod_dir, '__init__.py')
+                if not os.path.exists(mod_dir):
+                    os.mkdir(mod_dir)
+                if not os.path.exists(mod_init):
+                    with open(mod_init, 'w') as fp:
+                        fp.write(NAMESPACE_PACKAGE_INIT)
diff --git a/venv/Lib/site-packages/setuptools/windows_support.py b/venv/Lib/site-packages/setuptools/windows_support.py
new file mode 100644
index 000000000..cb977cff9
--- /dev/null
+++ b/venv/Lib/site-packages/setuptools/windows_support.py
@@ -0,0 +1,29 @@
+import platform
+import ctypes
+
+
+def windows_only(func):
+    if platform.system() != 'Windows':
+        return lambda *args, **kwargs: None
+    return func
+
+
+@windows_only
+def hide_file(path):
+    """
+    Set the hidden attribute on a file or directory.
+
+    From http://stackoverflow.com/questions/19622133/
+
+    `path` must be text.
+    """
+    __import__('ctypes.wintypes')
+    SetFileAttributes = ctypes.windll.kernel32.SetFileAttributesW
+    SetFileAttributes.argtypes = ctypes.wintypes.LPWSTR, ctypes.wintypes.DWORD
+    SetFileAttributes.restype = ctypes.wintypes.BOOL
+
+    FILE_ATTRIBUTE_HIDDEN = 0x02
+
+    ret = SetFileAttributes(path, FILE_ATTRIBUTE_HIDDEN)
+    if not ret:
+        raise ctypes.WinError()
diff --git a/venv/Lib/tcl8.6/init.tcl b/venv/Lib/tcl8.6/init.tcl
new file mode 100644
index 000000000..9ca45145a
--- /dev/null
+++ b/venv/Lib/tcl8.6/init.tcl
@@ -0,0 +1,818 @@
+# init.tcl --
+#
+# Default system startup file for Tcl-based applications.  Defines
+# "unknown" procedure and auto-load facilities.
+#
+# Copyright (c) 1991-1993 The Regents of the University of California.
+# Copyright (c) 1994-1996 Sun Microsystems, Inc.
+# Copyright (c) 1998-1999 Scriptics Corporation.
+# Copyright (c) 2004 by Kevin B. Kenny.  All rights reserved.
+#
+# See the file "license.terms" for information on usage and redistribution
+# of this file, and for a DISCLAIMER OF ALL WARRANTIES.
+#
+
+# This test intentionally written in pre-7.5 Tcl
+if {[info commands package] == ""} {
+    error "version mismatch: library\nscripts expect Tcl version 7.5b1 or later but the loaded version is\nonly [info patchlevel]"
+}
+package require -exact Tcl 8.6.6
+
+# Compute the auto path to use in this interpreter.
+# The values on the path come from several locations:
+#
+# The environment variable TCLLIBPATH
+#
+# tcl_library, which is the directory containing this init.tcl script.
+# [tclInit] (Tcl_Init()) searches around for the directory containing this
+# init.tcl and defines tcl_library to that location before sourcing it.
+#
+# The parent directory of tcl_library. Adding the parent
+# means that packages in peer directories will be found automatically.
+#
+# Also add the directory ../lib relative to the directory where the
+# executable is located.  This is meant to find binary packages for the
+# same architecture as the current executable.
+#
+# tcl_pkgPath, which is set by the platform-specific initialization routines
+#	On UNIX it is compiled in
+#       On Windows, it is not used
+
+if {![info exists auto_path]} {
+    if {[info exists env(TCLLIBPATH)]} {
+	set auto_path $env(TCLLIBPATH)
+    } else {
+	set auto_path ""
+    }
+}
+namespace eval tcl {
+    variable Dir
+    foreach Dir [list $::tcl_library [file dirname $::tcl_library]] {
+	if {$Dir ni $::auto_path} {
+	    lappend ::auto_path $Dir
+	}
+    }
+    set Dir [file join [file dirname [file dirname \
+	    [info nameofexecutable]]] lib]
+    if {$Dir ni $::auto_path} {
+	lappend ::auto_path $Dir
+    }
+    catch {
+	foreach Dir $::tcl_pkgPath {
+	    if {$Dir ni $::auto_path} {
+		lappend ::auto_path $Dir
+	    }
+	}
+    }
+
+    if {![interp issafe]} {
+        variable Path [encoding dirs]
+        set Dir [file join $::tcl_library encoding]
+        if {$Dir ni $Path} {
+	    lappend Path $Dir
+	    encoding dirs $Path
+        }
+    }
+
+    # TIP #255 min and max functions
+    namespace eval mathfunc {
+	proc min {args} {
+	    if {![llength $args]} {
+		return -code error \
+		    "too few arguments to math function \"min\""
+	    }
+	    set val Inf
+	    foreach arg $args {
+		# This will handle forcing the numeric value without
+		# ruining the internal type of a numeric object
+		if {[catch {expr {double($arg)}} err]} {
+		    return -code error $err
+		}
+		if {$arg < $val} {set val $arg}
+	    }
+	    return $val
+	}
+	proc max {args} {
+	    if {![llength $args]} {
+		return -code error \
+		    "too few arguments to math function \"max\""
+	    }
+	    set val -Inf
+	    foreach arg $args {
+		# This will handle forcing the numeric value without
+		# ruining the internal type of a numeric object
+		if {[catch {expr {double($arg)}} err]} {
+		    return -code error $err
+		}
+		if {$arg > $val} {set val $arg}
+	    }
+	    return $val
+	}
+	namespace export min max
+    }
+}
+
+# Windows specific end of initialization
+
+if {(![interp issafe]) && ($tcl_platform(platform) eq "windows")} {
+    namespace eval tcl {
+	proc EnvTraceProc {lo n1 n2 op} {
+	    global env
+	    set x $env($n2)
+	    set env($lo) $x
+	    set env([string toupper $lo]) $x
+	}
+	proc InitWinEnv {} {
+	    global env tcl_platform
+	    foreach p [array names env] {
+		set u [string toupper $p]
+		if {$u ne $p} {
+		    switch -- $u {
+			COMSPEC -
+			PATH {
+			    set temp $env($p)
+			    unset env($p)
+			    set env($u) $temp
+			    trace add variable env($p) write \
+				    [namespace code [list EnvTraceProc $p]]
+			    trace add variable env($u) write \
+				    [namespace code [list EnvTraceProc $p]]
+			}
+		    }
+		}
+	    }
+	    if {![info exists env(COMSPEC)]} {
+		set env(COMSPEC) cmd.exe
+	    }
+	}
+	InitWinEnv
+    }
+}
+
+# Setup the unknown package handler
+
+
+if {[interp issafe]} {
+    package unknown {::tcl::tm::UnknownHandler ::tclPkgUnknown}
+} else {
+    # Set up search for Tcl Modules (TIP #189).
+    # and setup platform specific unknown package handlers
+    if {$tcl_platform(os) eq "Darwin"
+	    && $tcl_platform(platform) eq "unix"} {
+	package unknown {::tcl::tm::UnknownHandler \
+		{::tcl::MacOSXPkgUnknown ::tclPkgUnknown}}
+    } else {
+	package unknown {::tcl::tm::UnknownHandler ::tclPkgUnknown}
+    }
+
+    # Set up the 'clock' ensemble
+
+    namespace eval ::tcl::clock [list variable TclLibDir $::tcl_library]
+
+    proc clock args {
+	namespace eval ::tcl::clock [list namespace ensemble create -command \
+		[uplevel 1 [list namespace origin [lindex [info level 0] 0]]] \
+		-subcommands {
+		    add clicks format microseconds milliseconds scan seconds
+		}]
+
+	# Auto-loading stubs for 'clock.tcl'
+
+	foreach cmd {add format scan} {
+	    proc ::tcl::clock::$cmd args {
+		variable TclLibDir
+		source -encoding utf-8 [file join $TclLibDir clock.tcl]
+		return [uplevel 1 [info level 0]]
+	    }
+	}
+
+	return [uplevel 1 [info level 0]]
+    }
+}
+
+# Conditionalize for presence of exec.
+
+if {[namespace which -command exec] eq ""} {
+
+    # Some machines do not have exec. Also, on all
+    # platforms, safe interpreters do not have exec.
+
+    set auto_noexec 1
+}
+
+# Define a log command (which can be overwitten to log errors
+# differently, specially when stderr is not available)
+
+if {[namespace which -command tclLog] eq ""} {
+    proc tclLog {string} {
+	catch {puts stderr $string}
+    }
+}
+
+# unknown --
+# This procedure is called when a Tcl command is invoked that doesn't
+# exist in the interpreter.  It takes the following steps to make the
+# command available:
+#
+#	1. See if the autoload facility can locate the command in a
+#	   Tcl script file.  If so, load it and execute it.
+#	2. If the command was invoked interactively at top-level:
+#	    (a) see if the command exists as an executable UNIX program.
+#		If so, "exec" the command.
+#	    (b) see if the command requests csh-like history substitution
+#		in one of the common forms !!, !<number>, or ^old^new.  If
+#		so, emulate csh's history substitution.
+#	    (c) see if the command is a unique abbreviation for another
+#		command.  If so, invoke the command.
+#
+# Arguments:
+# args -	A list whose elements are the words of the original
+#		command, including the command name.
+
+proc unknown args {
+    variable ::tcl::UnknownPending
+    global auto_noexec auto_noload env tcl_interactive errorInfo errorCode
+
+    if {[info exists errorInfo]} {
+	set savedErrorInfo $errorInfo
+    }
+    if {[info exists errorCode]} {
+	set savedErrorCode $errorCode
+    }
+
+    set name [lindex $args 0]
+    if {![info exists auto_noload]} {
+	#
+	# Make sure we're not trying to load the same proc twice.
+	#
+	if {[info exists UnknownPending($name)]} {
+	    return -code error "self-referential recursion\
+		    in \"unknown\" for command \"$name\""
+	}
+	set UnknownPending($name) pending
+	set ret [catch {
+		auto_load $name [uplevel 1 {::namespace current}]
+	} msg opts]
+	unset UnknownPending($name)
+	if {$ret != 0} {
+	    dict append opts -errorinfo "\n    (autoloading \"$name\")"
+	    return -options $opts $msg
+	}
+	if {![array size UnknownPending]} {
+	    unset UnknownPending
+	}
+	if {$msg} {
+	    if {[info exists savedErrorCode]} {
+		set ::errorCode $savedErrorCode
+	    } else {
+		unset -nocomplain ::errorCode
+	    }
+	    if {[info exists savedErrorInfo]} {
+		set errorInfo $savedErrorInfo
+	    } else {
+		unset -nocomplain errorInfo
+	    }
+	    set code [catch {uplevel 1 $args} msg opts]
+	    if {$code ==  1} {
+		#
+		# Compute stack trace contribution from the [uplevel].
+		# Note the dependence on how Tcl_AddErrorInfo, etc.
+		# construct the stack trace.
+		#
+		set errInfo [dict get $opts -errorinfo]
+		set errCode [dict get $opts -errorcode]
+		set cinfo $args
+		if {[string bytelength $cinfo] > 150} {
+		    set cinfo [string range $cinfo 0 150]
+		    while {[string bytelength $cinfo] > 150} {
+			set cinfo [string range $cinfo 0 end-1]
+		    }
+		    append cinfo ...
+		}
+		append cinfo "\"\n    (\"uplevel\" body line 1)"
+		append cinfo "\n    invoked from within"
+		append cinfo "\n\"uplevel 1 \$args\""
+		#
+		# Try each possible form of the stack trace
+		# and trim the extra contribution from the matching case
+		#
+		set expect "$msg\n    while executing\n\"$cinfo"
+		if {$errInfo eq $expect} {
+		    #
+		    # The stack has only the eval from the expanded command
+		    # Do not generate any stack trace here.
+		    #
+		    dict unset opts -errorinfo
+		    dict incr opts -level
+		    return -options $opts $msg
+		}
+		#
+		# Stack trace is nested, trim off just the contribution
+		# from the extra "eval" of $args due to the "catch" above.
+		#
+		set expect "\n    invoked from within\n\"$cinfo"
+		set exlen [string length $expect]
+		set eilen [string length $errInfo]
+		set i [expr {$eilen - $exlen - 1}]
+		set einfo [string range $errInfo 0 $i]
+		#
+		# For now verify that $errInfo consists of what we are about
+		# to return plus what we expected to trim off.
+		#
+		if {$errInfo ne "$einfo$expect"} {
+		    error "Tcl bug: unexpected stack trace in \"unknown\"" {} \
+			[list CORE UNKNOWN BADTRACE $einfo $expect $errInfo]
+		}
+		return -code error -errorcode $errCode \
+			-errorinfo $einfo $msg
+	    } else {
+		dict incr opts -level
+		return -options $opts $msg
+	    }
+	}
+    }
+
+    if {([info level] == 1) && ([info script] eq "")
+	    && [info exists tcl_interactive] && $tcl_interactive} {
+	if {![info exists auto_noexec]} {
+	    set new [auto_execok $name]
+	    if {$new ne ""} {
+		set redir ""
+		if {[namespace which -command console] eq ""} {
+		    set redir ">&@stdout <@stdin"
+		}
+		uplevel 1 [list ::catch \
+			[concat exec $redir $new [lrange $args 1 end]] \
+			::tcl::UnknownResult ::tcl::UnknownOptions]
+		dict incr ::tcl::UnknownOptions -level
+		return -options $::tcl::UnknownOptions $::tcl::UnknownResult
+	    }
+	}
+	if {$name eq "!!"} {
+	    set newcmd [history event]
+	} elseif {[regexp {^!(.+)$} $name -> event]} {
+	    set newcmd [history event $event]
+	} elseif {[regexp {^\^([^^]*)\^([^^]*)\^?$} $name -> old new]} {
+	    set newcmd [history event -1]
+	    catch {regsub -all -- $old $newcmd $new newcmd}
+	}
+	if {[info exists newcmd]} {
+	    tclLog $newcmd
+	    history change $newcmd 0
+	    uplevel 1 [list ::catch $newcmd \
+		    ::tcl::UnknownResult ::tcl::UnknownOptions]
+	    dict incr ::tcl::UnknownOptions -level
+	    return -options $::tcl::UnknownOptions $::tcl::UnknownResult
+	}
+
+	set ret [catch {set candidates [info commands $name*]} msg]
+	if {$name eq "::"} {
+	    set name ""
+	}
+	if {$ret != 0} {
+	    dict append opts -errorinfo \
+		    "\n    (expanding command prefix \"$name\" in unknown)"
+	    return -options $opts $msg
+	}
+	# Filter out bogus matches when $name contained
+	# a glob-special char [Bug 946952]
+	if {$name eq ""} {
+	    # Handle empty $name separately due to strangeness
+	    # in [string first] (See RFE 1243354)
+	    set cmds $candidates
+	} else {
+	    set cmds [list]
+	    foreach x $candidates {
+		if {[string first $name $x] == 0} {
+		    lappend cmds $x
+		}
+	    }
+	}
+	if {[llength $cmds] == 1} {
+	    uplevel 1 [list ::catch [lreplace $args 0 0 [lindex $cmds 0]] \
+		    ::tcl::UnknownResult ::tcl::UnknownOptions]
+	    dict incr ::tcl::UnknownOptions -level
+	    return -options $::tcl::UnknownOptions $::tcl::UnknownResult
+	}
+	if {[llength $cmds]} {
+	    return -code error "ambiguous command name \"$name\": [lsort $cmds]"
+	}
+    }
+    return -code error -errorcode [list TCL LOOKUP COMMAND $name] \
+	"invalid command name \"$name\""
+}
+
+# auto_load --
+# Checks a collection of library directories to see if a procedure
+# is defined in one of them.  If so, it sources the appropriate
+# library file to create the procedure.  Returns 1 if it successfully
+# loaded the procedure, 0 otherwise.
+#
+# Arguments:
+# cmd -			Name of the command to find and load.
+# namespace (optional)  The namespace where the command is being used - must be
+#                       a canonical namespace as returned [namespace current]
+#                       for instance. If not given, namespace current is used.
+
+proc auto_load {cmd {namespace {}}} {
+    global auto_index auto_path
+
+    if {$namespace eq ""} {
+	set namespace [uplevel 1 [list ::namespace current]]
+    }
+    set nameList [auto_qualify $cmd $namespace]
+    # workaround non canonical auto_index entries that might be around
+    # from older auto_mkindex versions
+    lappend nameList $cmd
+    foreach name $nameList {
+	if {[info exists auto_index($name)]} {
+	    namespace eval :: $auto_index($name)
+	    # There's a couple of ways to look for a command of a given
+	    # name.  One is to use
+	    #    info commands $name
+	    # Unfortunately, if the name has glob-magic chars in it like *
+	    # or [], it may not match.  For our purposes here, a better
+	    # route is to use
+	    #    namespace which -command $name
+	    if {[namespace which -command $name] ne ""} {
+		return 1
+	    }
+	}
+    }
+    if {![info exists auto_path]} {
+	return 0
+    }
+
+    if {![auto_load_index]} {
+	return 0
+    }
+    foreach name $nameList {
+	if {[info exists auto_index($name)]} {
+	    namespace eval :: $auto_index($name)
+	    if {[namespace which -command $name] ne ""} {
+		return 1
+	    }
+	}
+    }
+    return 0
+}
+
+# auto_load_index --
+# Loads the contents of tclIndex files on the auto_path directory
+# list.  This is usually invoked within auto_load to load the index
+# of available commands.  Returns 1 if the index is loaded, and 0 if
+# the index is already loaded and up to date.
+#
+# Arguments:
+# None.
+
+proc auto_load_index {} {
+    variable ::tcl::auto_oldpath
+    global auto_index auto_path
+
+    if {[info exists auto_oldpath] && ($auto_oldpath eq $auto_path)} {
+	return 0
+    }
+    set auto_oldpath $auto_path
+
+    # Check if we are a safe interpreter. In that case, we support only
+    # newer format tclIndex files.
+
+    set issafe [interp issafe]
+    for {set i [expr {[llength $auto_path] - 1}]} {$i >= 0} {incr i -1} {
+	set dir [lindex $auto_path $i]
+	set f ""
+	if {$issafe} {
+	    catch {source [file join $dir tclIndex]}
+	} elseif {[catch {set f [open [file join $dir tclIndex]]}]} {
+	    continue
+	} else {
+	    set error [catch {
+		set id [gets $f]
+		if {$id eq "# Tcl autoload index file, version 2.0"} {
+		    eval [read $f]
+		} elseif {$id eq "# Tcl autoload index file: each line identifies a Tcl"} {
+		    while {[gets $f line] >= 0} {
+			if {([string index $line 0] eq "#") \
+				|| ([llength $line] != 2)} {
+			    continue
+			}
+			set name [lindex $line 0]
+			set auto_index($name) \
+				"source [file join $dir [lindex $line 1]]"
+		    }
+		} else {
+		    error "[file join $dir tclIndex] isn't a proper Tcl index file"
+		}
+	    } msg opts]
+	    if {$f ne ""} {
+		close $f
+	    }
+	    if {$error} {
+		return -options $opts $msg
+	    }
+	}
+    }
+    return 1
+}
+
+# auto_qualify --
+#
+# Compute a fully qualified names list for use in the auto_index array.
+# For historical reasons, commands in the global namespace do not have leading
+# :: in the index key. The list has two elements when the command name is
+# relative (no leading ::) and the namespace is not the global one. Otherwise
+# only one name is returned (and searched in the auto_index).
+#
+# Arguments -
+# cmd		The command name. Can be any name accepted for command
+#               invocations (Like "foo::::bar").
+# namespace	The namespace where the command is being used - must be
+#               a canonical namespace as returned by [namespace current]
+#               for instance.
+
+proc auto_qualify {cmd namespace} {
+
+    # count separators and clean them up
+    # (making sure that foo:::::bar will be treated as foo::bar)
+    set n [regsub -all {::+} $cmd :: cmd]
+
+    # Ignore namespace if the name starts with ::
+    # Handle special case of only leading ::
+
+    # Before each return case we give an example of which category it is
+    # with the following form :
+    # (inputCmd, inputNameSpace) -> output
+
+    if {[string match ::* $cmd]} {
+	if {$n > 1} {
+	    # (::foo::bar , *) -> ::foo::bar
+	    return [list $cmd]
+	} else {
+	    # (::global , *) -> global
+	    return [list [string range $cmd 2 end]]
+	}
+    }
+
+    # Potentially returning 2 elements to try  :
+    # (if the current namespace is not the global one)
+
+    if {$n == 0} {
+	if {$namespace eq "::"} {
+	    # (nocolons , ::) -> nocolons
+	    return [list $cmd]
+	} else {
+	    # (nocolons , ::sub) -> ::sub::nocolons nocolons
+	    return [list ${namespace}::$cmd $cmd]
+	}
+    } elseif {$namespace eq "::"} {
+	#  (foo::bar , ::) -> ::foo::bar
+	return [list ::$cmd]
+    } else {
+	# (foo::bar , ::sub) -> ::sub::foo::bar ::foo::bar
+	return [list ${namespace}::$cmd ::$cmd]
+    }
+}
+
+# auto_import --
+#
+# Invoked during "namespace import" to make see if the imported commands
+# reside in an autoloaded library.  If so, the commands are loaded so
+# that they will be available for the import links.  If not, then this
+# procedure does nothing.
+#
+# Arguments -
+# pattern	The pattern of commands being imported (like "foo::*")
+#               a canonical namespace as returned by [namespace current]
+
+proc auto_import {pattern} {
+    global auto_index
+
+    # If no namespace is specified, this will be an error case
+
+    if {![string match *::* $pattern]} {
+	return
+    }
+
+    set ns [uplevel 1 [list ::namespace current]]
+    set patternList [auto_qualify $pattern $ns]
+
+    auto_load_index
+
+    foreach pattern $patternList {
+        foreach name [array names auto_index $pattern] {
+            if {([namespace which -command $name] eq "")
+		    && ([namespace qualifiers $pattern] eq [namespace qualifiers $name])} {
+                namespace eval :: $auto_index($name)
+            }
+        }
+    }
+}
+
+# auto_execok --
+#
+# Returns string that indicates name of program to execute if
+# name corresponds to a shell builtin or an executable in the
+# Windows search path, or "" otherwise.  Builds an associative
+# array auto_execs that caches information about previous checks,
+# for speed.
+#
+# Arguments:
+# name -			Name of a command.
+
+if {$tcl_platform(platform) eq "windows"} {
+# Windows version.
+#
+# Note that info executable doesn't work under Windows, so we have to
+# look for files with .exe, .com, or .bat extensions.  Also, the path
+# may be in the Path or PATH environment variables, and path
+# components are separated with semicolons, not colons as under Unix.
+#
+proc auto_execok name {
+    global auto_execs env tcl_platform
+
+    if {[info exists auto_execs($name)]} {
+	return $auto_execs($name)
+    }
+    set auto_execs($name) ""
+
+    set shellBuiltins [list cls copy date del dir echo erase md mkdir \
+	    mklink rd ren rename rmdir start time type ver vol]
+    if {[info exists env(PATHEXT)]} {
+	# Add an initial ; to have the {} extension check first.
+	set execExtensions [split ";$env(PATHEXT)" ";"]
+    } else {
+	set execExtensions [list {} .com .exe .bat .cmd]
+    }
+
+    if {[string tolower $name] in $shellBuiltins} {
+	# When this is command.com for some reason on Win2K, Tcl won't
+	# exec it unless the case is right, which this corrects.  COMSPEC
+	# may not point to a real file, so do the check.
+	set cmd $env(COMSPEC)
+	if {[file exists $cmd]} {
+	    set cmd [file attributes $cmd -shortname]
+	}
+	return [set auto_execs($name) [list $cmd /c $name]]
+    }
+
+    if {[llength [file split $name]] != 1} {
+	foreach ext $execExtensions {
+	    set file ${name}${ext}
+	    if {[file exists $file] && ![file isdirectory $file]} {
+		return [set auto_execs($name) [list $file]]
+	    }
+	}
+	return ""
+    }
+
+    set path "[file dirname [info nameof]];.;"
+    if {[info exists env(WINDIR)]} {
+	set windir $env(WINDIR)
+    }
+    if {[info exists windir]} {
+	if {$tcl_platform(os) eq "Windows NT"} {
+	    append path "$windir/system32;"
+	}
+	append path "$windir/system;$windir;"
+    }
+
+    foreach var {PATH Path path} {
+	if {[info exists env($var)]} {
+	    append path ";$env($var)"
+	}
+    }
+
+    foreach ext $execExtensions {
+	unset -nocomplain checked
+	foreach dir [split $path {;}] {
+	    # Skip already checked directories
+	    if {[info exists checked($dir)] || ($dir eq "")} {
+		continue
+	    }
+	    set checked($dir) {}
+	    set file [file join $dir ${name}${ext}]
+	    if {[file exists $file] && ![file isdirectory $file]} {
+		return [set auto_execs($name) [list $file]]
+	    }
+	}
+    }
+    return ""
+}
+
+} else {
+# Unix version.
+#
+proc auto_execok name {
+    global auto_execs env
+
+    if {[info exists auto_execs($name)]} {
+	return $auto_execs($name)
+    }
+    set auto_execs($name) ""
+    if {[llength [file split $name]] != 1} {
+	if {[file executable $name] && ![file isdirectory $name]} {
+	    set auto_execs($name) [list $name]
+	}
+	return $auto_execs($name)
+    }
+    foreach dir [split $env(PATH) :] {
+	if {$dir eq ""} {
+	    set dir .
+	}
+	set file [file join $dir $name]
+	if {[file executable $file] && ![file isdirectory $file]} {
+	    set auto_execs($name) [list $file]
+	    return $auto_execs($name)
+	}
+    }
+    return ""
+}
+
+}
+
+# ::tcl::CopyDirectory --
+#
+# This procedure is called by Tcl's core when attempts to call the
+# filesystem's copydirectory function fail.  The semantics of the call
+# are that 'dest' does not yet exist, i.e. dest should become the exact
+# image of src.  If dest does exist, we throw an error.
+#
+# Note that making changes to this procedure can change the results
+# of running Tcl's tests.
+#
+# Arguments:
+# action -              "renaming" or "copying"
+# src -			source directory
+# dest -		destination directory
+proc tcl::CopyDirectory {action src dest} {
+    set nsrc [file normalize $src]
+    set ndest [file normalize $dest]
+
+    if {$action eq "renaming"} {
+	# Can't rename volumes.  We could give a more precise
+	# error message here, but that would break the test suite.
+	if {$nsrc in [file volumes]} {
+	    return -code error "error $action \"$src\" to\
+	      \"$dest\": trying to rename a volume or move a directory\
+	      into itself"
+	}
+    }
+    if {[file exists $dest]} {
+	if {$nsrc eq $ndest} {
+	    return -code error "error $action \"$src\" to\
+	      \"$dest\": trying to rename a volume or move a directory\
+	      into itself"
+	}
+	if {$action eq "copying"} {
+	    # We used to throw an error here, but, looking more closely
+	    # at the core copy code in tclFCmd.c, if the destination
+	    # exists, then we should only call this function if -force
+	    # is true, which means we just want to over-write.  So,
+	    # the following code is now commented out.
+	    #
+	    # return -code error "error $action \"$src\" to\
+	    # \"$dest\": file already exists"
+	} else {
+	    # Depending on the platform, and on the current
+	    # working directory, the directories '.', '..'
+	    # can be returned in various combinations.  Anyway,
+	    # if any other file is returned, we must signal an error.
+	    set existing [glob -nocomplain -directory $dest * .*]
+	    lappend existing {*}[glob -nocomplain -directory $dest \
+		    -type hidden * .*]
+	    foreach s $existing {
+		if {[file tail $s] ni {. ..}} {
+		    return -code error "error $action \"$src\" to\
+		      \"$dest\": file already exists"
+		}
+	    }
+	}
+    } else {
+	if {[string first $nsrc $ndest] != -1} {
+	    set srclen [expr {[llength [file split $nsrc]] - 1}]
+	    set ndest [lindex [file split $ndest] $srclen]
+	    if {$ndest eq [file tail $nsrc]} {
+		return -code error "error $action \"$src\" to\
+		  \"$dest\": trying to rename a volume or move a directory\
+		  into itself"
+	    }
+	}
+	file mkdir $dest
+    }
+    # Have to be careful to capture both visible and hidden files.
+    # We will also be more generous to the file system and not
+    # assume the hidden and non-hidden lists are non-overlapping.
+    #
+    # On Unix 'hidden' files begin with '.'.  On other platforms
+    # or filesystems hidden files may have other interpretations.
+    set filelist [concat [glob -nocomplain -directory $src *] \
+      [glob -nocomplain -directory $src -types hidden *]]
+
+    foreach s [lsort -unique $filelist] {
+	if {[file tail $s] ni {. ..}} {
+	    file copy -force -- $s [file join $dest [file tail $s]]
+	}
+    }
+    return
+}
diff --git a/venv/Scripts/Activate.ps1 b/venv/Scripts/Activate.ps1
new file mode 100644
index 000000000..2d17bc331
--- /dev/null
+++ b/venv/Scripts/Activate.ps1
@@ -0,0 +1,51 @@
+function global:deactivate ([switch]$NonDestructive) {
+    # Revert to original values
+    if (Test-Path function:_OLD_VIRTUAL_PROMPT) {
+        copy-item function:_OLD_VIRTUAL_PROMPT function:prompt
+        remove-item function:_OLD_VIRTUAL_PROMPT
+    }
+
+    if (Test-Path env:_OLD_VIRTUAL_PYTHONHOME) {
+        copy-item env:_OLD_VIRTUAL_PYTHONHOME env:PYTHONHOME
+        remove-item env:_OLD_VIRTUAL_PYTHONHOME
+    }
+
+    if (Test-Path env:_OLD_VIRTUAL_PATH) {
+        copy-item env:_OLD_VIRTUAL_PATH env:PATH
+        remove-item env:_OLD_VIRTUAL_PATH
+    }
+
+    if (Test-Path env:VIRTUAL_ENV) {
+        remove-item env:VIRTUAL_ENV
+    }
+
+    if (!$NonDestructive) {
+        # Self destruct!
+        remove-item function:deactivate
+    }
+}
+
+deactivate -nondestructive
+
+$env:VIRTUAL_ENV="C:\Users\batuh\OneDrive\Desktop\UniWork\Year 4\Semester 1\CEG4912\Project\Vehicle Anti-Theft Face Recognition System\venv"
+
+if (! $env:VIRTUAL_ENV_DISABLE_PROMPT) {
+    # Set the prompt to include the env name
+    # Make sure _OLD_VIRTUAL_PROMPT is global
+    function global:_OLD_VIRTUAL_PROMPT {""}
+    copy-item function:prompt function:_OLD_VIRTUAL_PROMPT
+    function global:prompt {
+        Write-Host -NoNewline -ForegroundColor Green '(venv) '
+        _OLD_VIRTUAL_PROMPT
+    }
+}
+
+# Clear PYTHONHOME
+if (Test-Path env:PYTHONHOME) {
+    copy-item env:PYTHONHOME env:_OLD_VIRTUAL_PYTHONHOME
+    remove-item env:PYTHONHOME
+}
+
+# Add the venv to the PATH
+copy-item env:PATH env:_OLD_VIRTUAL_PATH
+$env:PATH = "$env:VIRTUAL_ENV\Scripts;$env:PATH"
diff --git a/venv/Scripts/_asyncio.pyd b/venv/Scripts/_asyncio.pyd
new file mode 100644
index 000000000..f654aba68
Binary files /dev/null and b/venv/Scripts/_asyncio.pyd differ
diff --git a/venv/Scripts/_bz2.pyd b/venv/Scripts/_bz2.pyd
new file mode 100644
index 000000000..f2c542a9d
Binary files /dev/null and b/venv/Scripts/_bz2.pyd differ
diff --git a/venv/Scripts/_ctypes.pyd b/venv/Scripts/_ctypes.pyd
new file mode 100644
index 000000000..72754d1e3
Binary files /dev/null and b/venv/Scripts/_ctypes.pyd differ
diff --git a/venv/Scripts/_ctypes_test.pyd b/venv/Scripts/_ctypes_test.pyd
new file mode 100644
index 000000000..53df131d4
Binary files /dev/null and b/venv/Scripts/_ctypes_test.pyd differ
diff --git a/venv/Scripts/_decimal.pyd b/venv/Scripts/_decimal.pyd
new file mode 100644
index 000000000..66ca6a378
Binary files /dev/null and b/venv/Scripts/_decimal.pyd differ
diff --git a/venv/Scripts/_distutils_findvs.pyd b/venv/Scripts/_distutils_findvs.pyd
new file mode 100644
index 000000000..9dea16ef9
Binary files /dev/null and b/venv/Scripts/_distutils_findvs.pyd differ
diff --git a/venv/Scripts/_elementtree.pyd b/venv/Scripts/_elementtree.pyd
new file mode 100644
index 000000000..e98c097fd
Binary files /dev/null and b/venv/Scripts/_elementtree.pyd differ
diff --git a/venv/Scripts/_hashlib.pyd b/venv/Scripts/_hashlib.pyd
new file mode 100644
index 000000000..9d6fad594
Binary files /dev/null and b/venv/Scripts/_hashlib.pyd differ
diff --git a/venv/Scripts/_lzma.pyd b/venv/Scripts/_lzma.pyd
new file mode 100644
index 000000000..cf7fcd93b
Binary files /dev/null and b/venv/Scripts/_lzma.pyd differ
diff --git a/venv/Scripts/_msi.pyd b/venv/Scripts/_msi.pyd
new file mode 100644
index 000000000..129c8d5d6
Binary files /dev/null and b/venv/Scripts/_msi.pyd differ
diff --git a/venv/Scripts/_multiprocessing.pyd b/venv/Scripts/_multiprocessing.pyd
new file mode 100644
index 000000000..2b63d95e7
Binary files /dev/null and b/venv/Scripts/_multiprocessing.pyd differ
diff --git a/venv/Scripts/_overlapped.pyd b/venv/Scripts/_overlapped.pyd
new file mode 100644
index 000000000..d4f50e7f0
Binary files /dev/null and b/venv/Scripts/_overlapped.pyd differ
diff --git a/venv/Scripts/_socket.pyd b/venv/Scripts/_socket.pyd
new file mode 100644
index 000000000..63531126e
Binary files /dev/null and b/venv/Scripts/_socket.pyd differ
diff --git a/venv/Scripts/_sqlite3.pyd b/venv/Scripts/_sqlite3.pyd
new file mode 100644
index 000000000..2b8c11eac
Binary files /dev/null and b/venv/Scripts/_sqlite3.pyd differ
diff --git a/venv/Scripts/_ssl.pyd b/venv/Scripts/_ssl.pyd
new file mode 100644
index 000000000..3fefd1cf0
Binary files /dev/null and b/venv/Scripts/_ssl.pyd differ
diff --git a/venv/Scripts/_testbuffer.pyd b/venv/Scripts/_testbuffer.pyd
new file mode 100644
index 000000000..b4b95877c
Binary files /dev/null and b/venv/Scripts/_testbuffer.pyd differ
diff --git a/venv/Scripts/_testcapi.pyd b/venv/Scripts/_testcapi.pyd
new file mode 100644
index 000000000..31be30445
Binary files /dev/null and b/venv/Scripts/_testcapi.pyd differ
diff --git a/venv/Scripts/_testconsole.pyd b/venv/Scripts/_testconsole.pyd
new file mode 100644
index 000000000..7da70ad30
Binary files /dev/null and b/venv/Scripts/_testconsole.pyd differ
diff --git a/venv/Scripts/_testimportmultiple.pyd b/venv/Scripts/_testimportmultiple.pyd
new file mode 100644
index 000000000..0e81e6756
Binary files /dev/null and b/venv/Scripts/_testimportmultiple.pyd differ
diff --git a/venv/Scripts/_testmultiphase.pyd b/venv/Scripts/_testmultiphase.pyd
new file mode 100644
index 000000000..57d035818
Binary files /dev/null and b/venv/Scripts/_testmultiphase.pyd differ
diff --git a/venv/Scripts/_tkinter.pyd b/venv/Scripts/_tkinter.pyd
new file mode 100644
index 000000000..1db9d0f3d
Binary files /dev/null and b/venv/Scripts/_tkinter.pyd differ
diff --git a/venv/Scripts/activate b/venv/Scripts/activate
new file mode 100644
index 000000000..9a36785aa
--- /dev/null
+++ b/venv/Scripts/activate
@@ -0,0 +1,76 @@
+# This file must be used with "source bin/activate" *from bash*
+# you cannot run it directly
+
+deactivate () {
+    # reset old environment variables
+    if [ -n "${_OLD_VIRTUAL_PATH:-}" ] ; then
+        PATH="${_OLD_VIRTUAL_PATH:-}"
+        export PATH
+        unset _OLD_VIRTUAL_PATH
+    fi
+    if [ -n "${_OLD_VIRTUAL_PYTHONHOME:-}" ] ; then
+        PYTHONHOME="${_OLD_VIRTUAL_PYTHONHOME:-}"
+        export PYTHONHOME
+        unset _OLD_VIRTUAL_PYTHONHOME
+    fi
+
+    # This should detect bash and zsh, which have a hash command that must
+    # be called to get it to forget past commands.  Without forgetting
+    # past commands the $PATH changes we made may not be respected
+    if [ -n "${BASH:-}" -o -n "${ZSH_VERSION:-}" ] ; then
+        hash -r
+    fi
+
+    if [ -n "${_OLD_VIRTUAL_PS1:-}" ] ; then
+        PS1="${_OLD_VIRTUAL_PS1:-}"
+        export PS1
+        unset _OLD_VIRTUAL_PS1
+    fi
+
+    unset VIRTUAL_ENV
+    if [ ! "$1" = "nondestructive" ] ; then
+    # Self destruct!
+        unset -f deactivate
+    fi
+}
+
+# unset irrelevant variables
+deactivate nondestructive
+
+VIRTUAL_ENV="C:\Users\batuh\OneDrive\Desktop\UniWork\Year 4\Semester 1\CEG4912\Project\Vehicle Anti-Theft Face Recognition System\venv"
+export VIRTUAL_ENV
+
+_OLD_VIRTUAL_PATH="$PATH"
+PATH="$VIRTUAL_ENV/Scripts:$PATH"
+export PATH
+
+# unset PYTHONHOME if set
+# this will fail if PYTHONHOME is set to the empty string (which is bad anyway)
+# could use `if (set -u; : $PYTHONHOME) ;` in bash
+if [ -n "${PYTHONHOME:-}" ] ; then
+    _OLD_VIRTUAL_PYTHONHOME="${PYTHONHOME:-}"
+    unset PYTHONHOME
+fi
+
+if [ -z "${VIRTUAL_ENV_DISABLE_PROMPT:-}" ] ; then
+    _OLD_VIRTUAL_PS1="${PS1:-}"
+    if [ "x(venv) " != x ] ; then
+	PS1="(venv) ${PS1:-}"
+    else
+    if [ "`basename \"$VIRTUAL_ENV\"`" = "__" ] ; then
+        # special case for Aspen magic directories
+        # see http://www.zetadev.com/software/aspen/
+        PS1="[`basename \`dirname \"$VIRTUAL_ENV\"\``] $PS1"
+    else
+        PS1="(`basename \"$VIRTUAL_ENV\"`)$PS1"
+    fi
+    fi
+    export PS1
+fi
+
+# This should detect bash and zsh, which have a hash command that must
+# be called to get it to forget past commands.  Without forgetting
+# past commands the $PATH changes we made may not be respected
+if [ -n "${BASH:-}" -o -n "${ZSH_VERSION:-}" ] ; then
+    hash -r
+fi
diff --git a/venv/Scripts/activate.bat b/venv/Scripts/activate.bat
new file mode 100644
index 000000000..611a07e97
--- /dev/null
+++ b/venv/Scripts/activate.bat
@@ -0,0 +1,45 @@
+@echo off
+
+rem This file is UTF-8 encoded, so we need to update the current code page while executing it
+for /f "tokens=2 delims=:" %%a in ('"%SystemRoot%\System32\chcp.com"') do (
+    set "_OLD_CODEPAGE=%%a"
+)
+if defined _OLD_CODEPAGE (
+    "%SystemRoot%\System32\chcp.com" 65001 > nul
+)
+
+set "VIRTUAL_ENV=C:\Users\batuh\OneDrive\Desktop\UniWork\Year 4\Semester 1\CEG4912\Project\Vehicle Anti-Theft Face Recognition System\venv"
+
+if not defined PROMPT (
+    set "PROMPT=$P$G"
+)
+
+if defined _OLD_VIRTUAL_PROMPT (
+    set "PROMPT=%_OLD_VIRTUAL_PROMPT%"
+)
+
+if defined _OLD_VIRTUAL_PYTHONHOME (
+    set "PYTHONHOME=%_OLD_VIRTUAL_PYTHONHOME%"
+)
+
+set "_OLD_VIRTUAL_PROMPT=%PROMPT%"
+set "PROMPT=(venv) %PROMPT%"
+
+if defined PYTHONHOME (
+    set "_OLD_VIRTUAL_PYTHONHOME=%PYTHONHOME%"
+    set PYTHONHOME=
+)
+
+if defined _OLD_VIRTUAL_PATH (
+    set "PATH=%_OLD_VIRTUAL_PATH%"
+) else (
+    set "_OLD_VIRTUAL_PATH=%PATH%"
+)
+
+set "PATH=%VIRTUAL_ENV%\Scripts;%PATH%"
+
+:END
+if defined _OLD_CODEPAGE (
+    "%SystemRoot%\System32\chcp.com" %_OLD_CODEPAGE% > nul
+    set "_OLD_CODEPAGE="
+)
diff --git a/venv/Scripts/deactivate.bat b/venv/Scripts/deactivate.bat
new file mode 100644
index 000000000..1205c6186
--- /dev/null
+++ b/venv/Scripts/deactivate.bat
@@ -0,0 +1,21 @@
+@echo off
+
+if defined _OLD_VIRTUAL_PROMPT (
+    set "PROMPT=%_OLD_VIRTUAL_PROMPT%"
+)
+set _OLD_VIRTUAL_PROMPT=
+
+if defined _OLD_VIRTUAL_PYTHONHOME (
+    set "PYTHONHOME=%_OLD_VIRTUAL_PYTHONHOME%"
+    set _OLD_VIRTUAL_PYTHONHOME=
+)
+
+if defined _OLD_VIRTUAL_PATH (
+    set "PATH=%_OLD_VIRTUAL_PATH%"
+)
+
+set _OLD_VIRTUAL_PATH=
+
+set VIRTUAL_ENV=
+
+:END
diff --git a/venv/Scripts/easy_install-3.6.exe b/venv/Scripts/easy_install-3.6.exe
new file mode 100644
index 000000000..02b270ed4
Binary files /dev/null and b/venv/Scripts/easy_install-3.6.exe differ
diff --git a/venv/Scripts/easy_install.exe b/venv/Scripts/easy_install.exe
new file mode 100644
index 000000000..02b270ed4
Binary files /dev/null and b/venv/Scripts/easy_install.exe differ
diff --git a/venv/Scripts/f2py.exe b/venv/Scripts/f2py.exe
new file mode 100644
index 000000000..7bf5782c3
Binary files /dev/null and b/venv/Scripts/f2py.exe differ
diff --git a/venv/Scripts/pip.exe b/venv/Scripts/pip.exe
new file mode 100644
index 000000000..214893b8d
Binary files /dev/null and b/venv/Scripts/pip.exe differ
diff --git a/venv/Scripts/pip3.6.exe b/venv/Scripts/pip3.6.exe
new file mode 100644
index 000000000..214893b8d
Binary files /dev/null and b/venv/Scripts/pip3.6.exe differ
diff --git a/venv/Scripts/pip3.exe b/venv/Scripts/pip3.exe
new file mode 100644
index 000000000..214893b8d
Binary files /dev/null and b/venv/Scripts/pip3.exe differ
diff --git a/venv/Scripts/pyexpat.pyd b/venv/Scripts/pyexpat.pyd
new file mode 100644
index 000000000..6f2664fdd
Binary files /dev/null and b/venv/Scripts/pyexpat.pyd differ
diff --git a/venv/Scripts/python.exe b/venv/Scripts/python.exe
new file mode 100644
index 000000000..472ded0a4
Binary files /dev/null and b/venv/Scripts/python.exe differ
diff --git a/venv/Scripts/python3.dll b/venv/Scripts/python3.dll
new file mode 100644
index 000000000..ebabdde63
Binary files /dev/null and b/venv/Scripts/python3.dll differ
diff --git a/venv/Scripts/python36.dll b/venv/Scripts/python36.dll
new file mode 100644
index 000000000..e908016c7
Binary files /dev/null and b/venv/Scripts/python36.dll differ
diff --git a/venv/Scripts/pythonw.exe b/venv/Scripts/pythonw.exe
new file mode 100644
index 000000000..d707013a5
Binary files /dev/null and b/venv/Scripts/pythonw.exe differ
diff --git a/venv/Scripts/select.pyd b/venv/Scripts/select.pyd
new file mode 100644
index 000000000..d18cce9bd
Binary files /dev/null and b/venv/Scripts/select.pyd differ
diff --git a/venv/Scripts/sqlite3.dll b/venv/Scripts/sqlite3.dll
new file mode 100644
index 000000000..00b4f1976
Binary files /dev/null and b/venv/Scripts/sqlite3.dll differ
diff --git a/venv/Scripts/tcl86t.dll b/venv/Scripts/tcl86t.dll
new file mode 100644
index 000000000..7b9dc2540
Binary files /dev/null and b/venv/Scripts/tcl86t.dll differ
diff --git a/venv/Scripts/tk86t.dll b/venv/Scripts/tk86t.dll
new file mode 100644
index 000000000..eff6f63e2
Binary files /dev/null and b/venv/Scripts/tk86t.dll differ
diff --git a/venv/Scripts/unicodedata.pyd b/venv/Scripts/unicodedata.pyd
new file mode 100644
index 000000000..cca9280cc
Binary files /dev/null and b/venv/Scripts/unicodedata.pyd differ
diff --git a/venv/Scripts/vcruntime140.dll b/venv/Scripts/vcruntime140.dll
new file mode 100644
index 000000000..21c18f7e8
Binary files /dev/null and b/venv/Scripts/vcruntime140.dll differ
diff --git a/venv/Scripts/winsound.pyd b/venv/Scripts/winsound.pyd
new file mode 100644
index 000000000..2fe0b91c0
Binary files /dev/null and b/venv/Scripts/winsound.pyd differ
diff --git a/venv/pyvenv.cfg b/venv/pyvenv.cfg
new file mode 100644
index 000000000..c1b211bce
--- /dev/null
+++ b/venv/pyvenv.cfg
@@ -0,0 +1,3 @@
+home = C:\Users\batuh\AppData\Local\Programs\Python\Python36-32
+include-system-site-packages = false
+version = 3.6.5